From f4da2d56b7785569e1b88625bb766675b20438cc Mon Sep 17 00:00:00 2001
From: SendaoYan <syan@openjdk.org>
Date: Tue, 3 Mar 2026 08:38:42 +0000
Subject: [PATCH 001/655] 8378684: Fix -Wdeprecated-declarations warnings from
 gtest by clang23

Reviewed-by: erikj, kbarrett
---
 make/hotspot/lib/CompileGtest.gmk | 4 ++++
 1 file changed, 4 insertions(+)

diff --git a/make/hotspot/lib/CompileGtest.gmk b/make/hotspot/lib/CompileGtest.gmk
index 327014b1e9d..4b21d481049 100644
--- a/make/hotspot/lib/CompileGtest.gmk
+++ b/make/hotspot/lib/CompileGtest.gmk
@@ -63,6 +63,10 @@ $(eval $(call SetupJdkLibrary, BUILD_GTEST_LIBGTEST, \
         unused-result zero-as-null-pointer-constant, \
     DISABLED_WARNINGS_clang := format-nonliteral undef unused-result \
         zero-as-null-pointer-constant, \
+    $(comment Disable deprecated-declarations warnings to workaround) \
+    $(comment clang18+glibc12 bug https://github.com/llvm/llvm-project/issues/76515) \
+    $(comment until the clang bug has been fixed) \
+    DISABLED_WARNINGS_clang_gtest-all.cc := deprecated-declarations, \
     DISABLED_WARNINGS_microsoft := 4530, \
     DEFAULT_CFLAGS := false, \
     CFLAGS := $(JVM_CFLAGS) \

From 7e9e64966b47c788c91f934b5fca5cd31ad465b3 Mon Sep 17 00:00:00 2001
From: SendaoYan <syan@openjdk.org>
Date: Tue, 3 Mar 2026 08:39:04 +0000
Subject: [PATCH 002/655] 8378083: Mark
 shenandoah/generational/TestOldGrowthTriggers.java as flagless

Reviewed-by: wkemper
---
 .../gc/shenandoah/generational/TestOldGrowthTriggers.java     | 2 +-
 test/lib/jdk/test/lib/process/ProcessTools.java               | 4 ++--
 2 files changed, 3 insertions(+), 3 deletions(-)

diff --git a/test/hotspot/jtreg/gc/shenandoah/generational/TestOldGrowthTriggers.java b/test/hotspot/jtreg/gc/shenandoah/generational/TestOldGrowthTriggers.java
index a66b9161c7e..7af81fabe13 100644
--- a/test/hotspot/jtreg/gc/shenandoah/generational/TestOldGrowthTriggers.java
+++ b/test/hotspot/jtreg/gc/shenandoah/generational/TestOldGrowthTriggers.java
@@ -27,6 +27,7 @@
  * @summary Test that growth of old-gen triggers old-gen marking
  * @key intermittent
  * @requires vm.gc.Shenandoah
+ * @requires vm.flagless
  * @library /test/lib
  * @run driver TestOldGrowthTriggers
  */
@@ -34,7 +35,6 @@
 import java.util.*;
 import java.math.BigInteger;
 
-import jdk.test.lib.Asserts;
 import jdk.test.lib.process.ProcessTools;
 import jdk.test.lib.process.OutputAnalyzer;
 
diff --git a/test/lib/jdk/test/lib/process/ProcessTools.java b/test/lib/jdk/test/lib/process/ProcessTools.java
index fe9c1de9f30..e7dd20c6286 100644
--- a/test/lib/jdk/test/lib/process/ProcessTools.java
+++ b/test/lib/jdk/test/lib/process/ProcessTools.java
@@ -575,7 +575,7 @@ public final class ProcessTools {
      * "test.vm.opts" and "test.java.opts"</b> and this method will
      * not do that.
      *
-     * <p>If you still chose to use
+     * <p>If you still choose to use
      * createLimitedTestJavaProcessBuilder() you should probably use
      * it in combination with <b>@requires vm.flagless</b> JTREG
      * anotation as to not waste energy and test resources.
@@ -609,7 +609,7 @@ public final class ProcessTools {
      * "test.vm.opts" and "test.java.opts"</b> and this method will
      * not do that.
      *
-     * <p>If you still chose to use
+     * <p>If you still choose to use
      * createLimitedTestJavaProcessBuilder() you should probably use
      * it in combination with <b>@requires vm.flagless</b> JTREG
      * anotation as to not waste energy and test resources.

From c0c8bdd294c5ca56307123c7f10ec10ba33c4bca Mon Sep 17 00:00:00 2001
From: Albert Mingkun Yang <ayang@openjdk.org>
Date: Tue, 3 Mar 2026 09:23:22 +0000
Subject: [PATCH 003/655] 8378948: Remove unused local variable in
 RunnerGSInserterThread

Reviewed-by: syan, jiefu
---
 test/hotspot/gtest/utilities/test_concurrentHashtable.cpp | 1 -
 1 file changed, 1 deletion(-)

diff --git a/test/hotspot/gtest/utilities/test_concurrentHashtable.cpp b/test/hotspot/gtest/utilities/test_concurrentHashtable.cpp
index 77055e92256..8094e93b944 100644
--- a/test/hotspot/gtest/utilities/test_concurrentHashtable.cpp
+++ b/test/hotspot/gtest/utilities/test_concurrentHashtable.cpp
@@ -888,7 +888,6 @@ public:
   virtual ~RunnerGSInserterThread(){}
 
   void premain() {
-    volatile bool timeout = false;
     _start = START;
     _range = RANGE;
     CHTTestThread* tt[GSTEST_THREAD_COUNT];

From 0b183bf2d608bedf118607b1471fbf1e68813a08 Mon Sep 17 00:00:00 2001
From: Kelvin Nilsen <kdnilsen@openjdk.org>
Date: Tue, 3 Mar 2026 09:39:06 +0000
Subject: [PATCH 004/655] 8312116: GenShen: make instantaneous allocation rate
 triggers more timely

Reviewed-by: wkemper
---
 .../shenandoahAdaptiveHeuristics.cpp          | 559 ++++++++++++++++--
 .../shenandoahAdaptiveHeuristics.hpp          |  76 +++
 .../shenandoahGenerationalHeuristics.cpp      |   6 +
 .../shenandoahGenerationalHeuristics.hpp      |   2 +
 .../heuristics/shenandoahHeuristics.cpp       |  30 +-
 .../heuristics/shenandoahHeuristics.hpp       |  33 +-
 .../heuristics/shenandoahYoungHeuristics.cpp  |   3 +-
 .../gc/shenandoah/shenandoahConcurrentGC.cpp  |   1 +
 .../gc/shenandoah/shenandoahControlThread.cpp |  19 +-
 .../gc/shenandoah/shenandoahDegeneratedGC.cpp |   1 +
 .../share/gc/shenandoah/shenandoahFreeSet.cpp |  62 +-
 .../share/gc/shenandoah/shenandoahFreeSet.hpp |  70 ++-
 .../share/gc/shenandoah/shenandoahFullGC.cpp  |   4 +-
 .../gc/shenandoah/shenandoahGeneration.cpp    |   7 +-
 .../gc/shenandoah/shenandoahGeneration.hpp    |   2 +-
 .../shenandoahGenerationalControlThread.cpp   |   3 +-
 .../shenandoah/shenandoahGenerationalHeap.cpp |  22 +-
 .../shenandoah/shenandoahGenerationalHeap.hpp |   3 +
 .../share/gc/shenandoah/shenandoahHeap.cpp    |  27 +-
 .../share/gc/shenandoah/shenandoahHeap.hpp    |   3 +
 .../gc/shenandoah/shenandoahOldGeneration.cpp |   2 +
 .../shenandoah/shenandoahRegulatorThread.cpp  |  16 +-
 .../shenandoah/shenandoahRegulatorThread.hpp  |   3 +
 .../gc/shenandoah/shenandoah_globals.hpp      |  53 ++
 24 files changed, 899 insertions(+), 108 deletions(-)

diff --git a/src/hotspot/share/gc/shenandoah/heuristics/shenandoahAdaptiveHeuristics.cpp b/src/hotspot/share/gc/shenandoah/heuristics/shenandoahAdaptiveHeuristics.cpp
index 7a8bd55c795..ac8b3ebdf37 100644
--- a/src/hotspot/share/gc/shenandoah/heuristics/shenandoahAdaptiveHeuristics.cpp
+++ b/src/hotspot/share/gc/shenandoah/heuristics/shenandoahAdaptiveHeuristics.cpp
@@ -33,6 +33,7 @@
 #include "gc/shenandoah/shenandoahCollectorPolicy.hpp"
 #include "gc/shenandoah/shenandoahHeap.inline.hpp"
 #include "gc/shenandoah/shenandoahHeapRegion.inline.hpp"
+#include "gc/shenandoah/shenandoahYoungGeneration.hpp"
 #include "logging/log.hpp"
 #include "logging/logTag.hpp"
 #include "runtime/globals.hpp"
@@ -59,14 +60,95 @@ const double ShenandoahAdaptiveHeuristics::HIGHEST_EXPECTED_AVAILABLE_AT_END = 0
 const double ShenandoahAdaptiveHeuristics::MINIMUM_CONFIDENCE = 0.319; // 25%
 const double ShenandoahAdaptiveHeuristics::MAXIMUM_CONFIDENCE = 3.291; // 99.9%
 
+
+// To enable detection of GC time trends, we keep separate track of the recent history of gc time.  During initialization,
+// for example, the amount of live memory may be increasing, which is likely to cause the GC times to increase.  This history
+// allows us to predict increasing GC times rather than always assuming average recent GC time is the best predictor.
+const size_t ShenandoahAdaptiveHeuristics::GC_TIME_SAMPLE_SIZE = 3;
+
+// We also keep separate track of recently sampled allocation rates for two purposes:
+//  1. The number of samples examined to determine acceleration of allocation is represented by
+//     ShenandoahRateAccelerationSampleSize
+//  2. The number of most recent samples averaged to determine a momentary allocation spike is represented by
+//     ShenandoahMomentaryAllocationRateSpikeSampleSize
+
+// Allocation rates are sampled by the regulator thread, which typically runs every ms.  There may be jitter in the scheduling
+// of the regulator thread.  To reduce signal noise and synchronization overhead, we do not sample allocation rate with every
+// iteration of the regulator.  We prefer sample time longer than 1 ms so that there can be a statistically significant number
+// of allocations occuring within each sample period.  The regulator thread samples allocation rate only if at least
+// ShenandoahAccelerationSamplePeriod ms have passed since it previously sampled the allocation rate.
+//
+// This trigger responds much more quickly than the traditional trigger, which monitors 100 ms spans.  When acceleration is
+// detected, the impact of acceleration on anticipated consumption of available memory is also much more impactful
+// than the assumed constant allocation rate consumption of available memory.
+
 ShenandoahAdaptiveHeuristics::ShenandoahAdaptiveHeuristics(ShenandoahSpaceInfo* space_info) :
   ShenandoahHeuristics(space_info),
   _margin_of_error_sd(ShenandoahAdaptiveInitialConfidence),
   _spike_threshold_sd(ShenandoahAdaptiveInitialSpikeThreshold),
   _last_trigger(OTHER),
-  _available(Moving_Average_Samples, ShenandoahAdaptiveDecayFactor) { }
+  _available(Moving_Average_Samples, ShenandoahAdaptiveDecayFactor),
+  _free_set(nullptr),
+  _previous_acceleration_sample_timestamp(0.0),
+  _gc_time_first_sample_index(0),
+  _gc_time_num_samples(0),
+  _gc_time_timestamps(NEW_C_HEAP_ARRAY(double, GC_TIME_SAMPLE_SIZE, mtGC)),
+  _gc_time_samples(NEW_C_HEAP_ARRAY(double, GC_TIME_SAMPLE_SIZE, mtGC)),
+  _gc_time_xy(NEW_C_HEAP_ARRAY(double, GC_TIME_SAMPLE_SIZE, mtGC)),
+  _gc_time_xx(NEW_C_HEAP_ARRAY(double, GC_TIME_SAMPLE_SIZE, mtGC)),
+  _gc_time_sum_of_timestamps(0),
+  _gc_time_sum_of_samples(0),
+  _gc_time_sum_of_xy(0),
+  _gc_time_sum_of_xx(0),
+  _gc_time_m(0.0),
+  _gc_time_b(0.0),
+  _gc_time_sd(0.0),
+  _spike_acceleration_buffer_size(MAX2(ShenandoahRateAccelerationSampleSize, 1+ShenandoahMomentaryAllocationRateSpikeSampleSize)),
+  _spike_acceleration_first_sample_index(0),
+  _spike_acceleration_num_samples(0),
+  _spike_acceleration_rate_samples(NEW_C_HEAP_ARRAY(double, _spike_acceleration_buffer_size, mtGC)),
+  _spike_acceleration_rate_timestamps(NEW_C_HEAP_ARRAY(double, _spike_acceleration_buffer_size, mtGC)) {
+  }
 
-ShenandoahAdaptiveHeuristics::~ShenandoahAdaptiveHeuristics() {}
+ShenandoahAdaptiveHeuristics::~ShenandoahAdaptiveHeuristics() {
+  FREE_C_HEAP_ARRAY(double, _spike_acceleration_rate_samples);
+  FREE_C_HEAP_ARRAY(double, _spike_acceleration_rate_timestamps);
+  FREE_C_HEAP_ARRAY(double, _gc_time_timestamps);
+  FREE_C_HEAP_ARRAY(double, _gc_time_samples);
+  FREE_C_HEAP_ARRAY(double, _gc_time_xy);
+  FREE_C_HEAP_ARRAY(double, _gc_time_xx);
+}
+
+void ShenandoahAdaptiveHeuristics::initialize() {
+  ShenandoahHeuristics::initialize();
+}
+
+void ShenandoahAdaptiveHeuristics::post_initialize() {
+  ShenandoahHeuristics::post_initialize();
+  _free_set = ShenandoahHeap::heap()->free_set();
+  assert(!ShenandoahHeap::heap()->mode()->is_generational(), "ShenandoahGenerationalHeuristics overrides this method");
+  compute_headroom_adjustment();
+}
+
+void ShenandoahAdaptiveHeuristics::compute_headroom_adjustment() {
+  // The trigger threshold represents mutator available - "head room".
+  // We plan for GC to finish before the amount of allocated memory exceeds trigger threshold.  This is the same  as saying we
+  // intend to finish GC before the amount of available memory is less than the allocation headroom.  Headroom is the planned
+  // safety buffer to allow a small amount of additional allocation to take place in case we were overly optimistic in delaying
+  // our trigger.
+  size_t capacity = ShenandoahHeap::heap()->soft_max_capacity();
+  size_t spike_headroom = capacity / 100 * ShenandoahAllocSpikeFactor;
+  size_t penalties      = capacity / 100 * _gc_time_penalties;
+  _headroom_adjustment = spike_headroom + penalties;
+}
+
+void ShenandoahAdaptiveHeuristics::start_idle_span() {
+  compute_headroom_adjustment();
+}
+
+void ShenandoahAdaptiveHeuristics::adjust_penalty(intx step) {
+  ShenandoahHeuristics::adjust_penalty(step);
+}
 
 void ShenandoahAdaptiveHeuristics::choose_collection_set_from_regiondata(ShenandoahCollectionSet* cset,
                                                                          RegionData* data, size_t size,
@@ -76,8 +158,8 @@ void ShenandoahAdaptiveHeuristics::choose_collection_set_from_regiondata(Shenand
   // The logic for cset selection in adaptive is as follows:
   //
   //   1. We cannot get cset larger than available free space. Otherwise we guarantee OOME
-  //      during evacuation, and thus guarantee full GC. In practice, we also want to let
-  //      application to allocate something. This is why we limit CSet to some fraction of
+  //      during evacuation, and thus guarantee full GC. In practice, we also want to let the
+  //      application allocate during concurrent GC. This is why we limit CSet to some fraction of
   //      available space. In non-overloaded heap, max_cset would contain all plausible candidates
   //      over garbage threshold.
   //
@@ -108,6 +190,7 @@ void ShenandoahAdaptiveHeuristics::choose_collection_set_from_regiondata(Shenand
   size_t cur_cset = 0;
   size_t cur_garbage = 0;
 
+  // Regions are sorted in order of decreasing garbage
   for (size_t idx = 0; idx < size; idx++) {
     ShenandoahHeapRegion* r = data[idx].get_region();
 
@@ -126,6 +209,88 @@ void ShenandoahAdaptiveHeuristics::choose_collection_set_from_regiondata(Shenand
   }
 }
 
+void ShenandoahAdaptiveHeuristics::add_degenerated_gc_time(double timestamp, double gc_time) {
+  // Conservatively add sample into linear model If this time is above the predicted concurrent gc time
+  if (predict_gc_time(timestamp) < gc_time) {
+    add_gc_time(timestamp, gc_time);
+  }
+}
+
+void ShenandoahAdaptiveHeuristics::add_gc_time(double timestamp, double gc_time) {
+  // Update best-fit linear predictor of GC time
+  uint index = (_gc_time_first_sample_index + _gc_time_num_samples) % GC_TIME_SAMPLE_SIZE;
+  if (_gc_time_num_samples == GC_TIME_SAMPLE_SIZE) {
+    _gc_time_sum_of_timestamps -= _gc_time_timestamps[index];
+    _gc_time_sum_of_samples -= _gc_time_samples[index];
+    _gc_time_sum_of_xy -= _gc_time_xy[index];
+    _gc_time_sum_of_xx -= _gc_time_xx[index];
+  }
+  _gc_time_timestamps[index] = timestamp;
+  _gc_time_samples[index] = gc_time;
+  _gc_time_xy[index] = timestamp * gc_time;
+  _gc_time_xx[index] = timestamp * timestamp;
+
+  _gc_time_sum_of_timestamps += _gc_time_timestamps[index];
+  _gc_time_sum_of_samples += _gc_time_samples[index];
+  _gc_time_sum_of_xy += _gc_time_xy[index];
+  _gc_time_sum_of_xx += _gc_time_xx[index];
+
+  if (_gc_time_num_samples < GC_TIME_SAMPLE_SIZE) {
+    _gc_time_num_samples++;
+  } else {
+    _gc_time_first_sample_index = (_gc_time_first_sample_index + 1) % GC_TIME_SAMPLE_SIZE;
+  }
+
+  if (_gc_time_num_samples == 1) {
+    // The predictor is constant (horizontal line)
+    _gc_time_m = 0;
+    _gc_time_b = gc_time;
+    _gc_time_sd = 0.0;
+  } else if (_gc_time_num_samples == 2) {
+    // Two points define a line
+    double delta_y = gc_time - _gc_time_samples[_gc_time_first_sample_index];
+    double delta_x = timestamp - _gc_time_timestamps[_gc_time_first_sample_index];
+    _gc_time_m = delta_y / delta_x;
+
+    // y = mx + b
+    // so b = y0 - mx0
+    _gc_time_b = gc_time - _gc_time_m * timestamp;
+    _gc_time_sd = 0.0;
+  } else {
+    _gc_time_m = ((_gc_time_num_samples * _gc_time_sum_of_xy - _gc_time_sum_of_timestamps * _gc_time_sum_of_samples) /
+                  (_gc_time_num_samples * _gc_time_sum_of_xx - _gc_time_sum_of_timestamps * _gc_time_sum_of_timestamps));
+    _gc_time_b = (_gc_time_sum_of_samples - _gc_time_m * _gc_time_sum_of_timestamps) / _gc_time_num_samples;
+    double sum_of_squared_deviations = 0.0;
+    for (size_t i = 0; i < _gc_time_num_samples; i++) {
+      uint index = (_gc_time_first_sample_index + i) % GC_TIME_SAMPLE_SIZE;
+      double x = _gc_time_timestamps[index];
+      double predicted_y = _gc_time_m * x + _gc_time_b;
+      double deviation = predicted_y - _gc_time_samples[index];
+      sum_of_squared_deviations += deviation * deviation;
+    }
+    _gc_time_sd = sqrt(sum_of_squared_deviations / _gc_time_num_samples);
+  }
+}
+
+double ShenandoahAdaptiveHeuristics::predict_gc_time(double timestamp_at_start) {
+  return _gc_time_m * timestamp_at_start + _gc_time_b + _gc_time_sd * _margin_of_error_sd;;
+}
+
+void ShenandoahAdaptiveHeuristics::add_rate_to_acceleration_history(double timestamp, double rate) {
+  uint new_sample_index =
+    (_spike_acceleration_first_sample_index + _spike_acceleration_num_samples) % _spike_acceleration_buffer_size;
+  _spike_acceleration_rate_timestamps[new_sample_index] = timestamp;
+  _spike_acceleration_rate_samples[new_sample_index] = rate;
+  if (_spike_acceleration_num_samples == _spike_acceleration_buffer_size) {
+    _spike_acceleration_first_sample_index++;
+    if (_spike_acceleration_first_sample_index == _spike_acceleration_buffer_size) {
+      _spike_acceleration_first_sample_index = 0;
+    }
+  } else {
+    _spike_acceleration_num_samples++;
+  }
+}
+
 void ShenandoahAdaptiveHeuristics::record_cycle_start() {
   ShenandoahHeuristics::record_cycle_start();
   _allocation_rate.allocation_counter_reset();
@@ -133,6 +298,10 @@ void ShenandoahAdaptiveHeuristics::record_cycle_start() {
 
 void ShenandoahAdaptiveHeuristics::record_success_concurrent() {
   ShenandoahHeuristics::record_success_concurrent();
+  double now = os::elapsedTime();
+
+  // Should we not add GC time if this was an abbreviated cycle?
+  add_gc_time(_cycle_start, elapsed_cycle_time());
 
   size_t available = _space_info->available();
 
@@ -185,6 +354,7 @@ void ShenandoahAdaptiveHeuristics::record_success_concurrent() {
 
 void ShenandoahAdaptiveHeuristics::record_degenerated() {
   ShenandoahHeuristics::record_degenerated();
+  add_degenerated_gc_time(_precursor_cycle_start, elapsed_degenerated_cycle_time());
   // Adjust both trigger's parameters in the case of a degenerated GC because
   // either of them should have triggered earlier to avoid this case.
   adjust_margin_of_error(DEGENERATE_PENALTY_SD);
@@ -236,6 +406,24 @@ bool ShenandoahAdaptiveHeuristics::should_start_gc() {
   size_t available = _space_info->soft_mutator_available();
   size_t allocated = _space_info->bytes_allocated_since_gc_start();
 
+  double avg_cycle_time = 0;
+  double avg_alloc_rate = 0;
+  double now = get_most_recent_wake_time();
+  size_t allocatable_words = this->allocatable(available);
+  double predicted_future_accelerated_gc_time = 0.0;
+  size_t allocated_bytes_since_last_sample = 0;
+  double instantaneous_rate_words_per_second = 0.0;
+  size_t consumption_accelerated = 0;
+  double acceleration = 0.0;
+  double current_rate_by_acceleration = 0.0;
+  size_t min_threshold = min_free_threshold();
+  double predicted_future_gc_time = 0;
+  double future_planned_gc_time = 0;
+  bool future_planned_gc_time_is_average = false;
+  double avg_time_to_deplete_available = 0.0;
+  bool is_spiking = false;
+  double spike_time_to_deplete_available = 0.0;
+
   log_debug(gc, ergo)("should_start_gc calculation: available: " PROPERFMT ", soft_max_capacity: "  PROPERFMT ", "
                 "allocated_since_gc_start: "  PROPERFMT,
                 PROPERFMTARGS(available), PROPERFMTARGS(capacity), PROPERFMTARGS(allocated));
@@ -250,7 +438,6 @@ bool ShenandoahAdaptiveHeuristics::should_start_gc() {
 
   _last_trigger = OTHER;
 
-  size_t min_threshold = min_free_threshold();
   if (available < min_threshold) {
     log_trigger("Free (Soft) (" PROPERFMT ") is below minimum threshold (" PROPERFMT ")",
                  PROPERFMTARGS(available), PROPERFMTARGS(min_threshold));
@@ -271,55 +458,227 @@ bool ShenandoahAdaptiveHeuristics::should_start_gc() {
       return true;
     }
   }
-  // Check if allocation headroom is still okay. This also factors in:
-  //   1. Some space to absorb allocation spikes (ShenandoahAllocSpikeFactor)
-  //   2. Accumulated penalties from Degenerated and Full GC
-  size_t allocation_headroom = available;
 
-  size_t spike_headroom = capacity / 100 * ShenandoahAllocSpikeFactor;
-  size_t penalties      = capacity / 100 * _gc_time_penalties;
+  // The test (3 * allocated > available) below is intended to prevent triggers from firing so quickly that there
+  // has not been sufficient time to create garbage that can be reclaimed during the triggered GC cycle.  If we trigger before
+  // garbage has been created, the concurrent GC will find no garbage.  This has been observed to result in degens which
+  // experience OOM during evac or that experience "bad progress", both of which escalate to Full GC.  Note that garbage that
+  // was allocated following the start of the current GC cycle cannot be reclaimed in this GC cycle.  Here is the derivation
+  // of the expression:
+  //
+  // Let R (runway) represent the total amount of memory that can be allocated following the start of GC(N).  The runway
+  // represents memory available at the start of the current GC plus garbage reclaimed by the current GC. In a balanced,
+  // fully utilized configuration, we will be starting each new GC cycle immediately following completion of the preceding
+  // GC cycle.  In this configuration, we would expect half of R to be consumed during concurrent cycle GC(N) and half
+  // to be consumed during concurrent GC(N+1).
+  //
+  // Assume we want to delay GC trigger until:    A/V > 0.33
+  //     This is equivalent to enforcing that:      A > 0.33V
+  //                                 which is:     3A > V
+  //              Since A+V equals R, we have: A + 3A > A + V  = R
+  //                     which is to say that:      A > R/4
+  //
+  // Postponing the trigger until at least 1/4 of the runway has been consumed helps to improve the efficiency of the
+  // triggered GC.  Under heavy steady state workload, this delay condition generally has no effect: if the allocation
+  // runway is divided "equally" between the current GC and the next GC, then at any potential trigger point (which cannot
+  // happen any sooner than completion of the first GC), it is already the case that roughly A > R/2.
+  if (3 * allocated <= available) {
+    // Even though we will not issue an adaptive trigger unless a minimum threshold of memory has been allocated,
+    // we still allow more generic triggers, such as guaranteed GC intervals, to act.
+    return ShenandoahHeuristics::should_start_gc();
+  }
 
-  allocation_headroom -= MIN2(allocation_headroom, spike_headroom);
-  allocation_headroom -= MIN2(allocation_headroom, penalties);
+  avg_cycle_time = _gc_cycle_time_history->davg() + (_margin_of_error_sd * _gc_cycle_time_history->dsd());
+  avg_alloc_rate = _allocation_rate.upper_bound(_margin_of_error_sd);
+  if ((now - _previous_acceleration_sample_timestamp) >= (ShenandoahAccelerationSamplePeriod / 1000.0)) {
+    predicted_future_accelerated_gc_time =
+      predict_gc_time(now + MAX2(get_planned_sleep_interval(), ShenandoahAccelerationSamplePeriod / 1000.0));
+    double future_accelerated_planned_gc_time;
+    bool future_accelerated_planned_gc_time_is_average;
+    if (predicted_future_accelerated_gc_time > avg_cycle_time) {
+      future_accelerated_planned_gc_time = predicted_future_accelerated_gc_time;
+      future_accelerated_planned_gc_time_is_average = false;
+    } else {
+      future_accelerated_planned_gc_time = avg_cycle_time;
+      future_accelerated_planned_gc_time_is_average = true;
+    }
+    allocated_bytes_since_last_sample = _free_set->get_bytes_allocated_since_previous_sample();
+    instantaneous_rate_words_per_second =
+      (allocated_bytes_since_last_sample / HeapWordSize) / (now - _previous_acceleration_sample_timestamp);
 
-  double avg_cycle_time = _gc_cycle_time_history->davg() + (_margin_of_error_sd * _gc_cycle_time_history->dsd());
-  double avg_alloc_rate = _allocation_rate.upper_bound(_margin_of_error_sd);
+    _previous_acceleration_sample_timestamp = now;
+    add_rate_to_acceleration_history(now, instantaneous_rate_words_per_second);
+    current_rate_by_acceleration = instantaneous_rate_words_per_second;
+    consumption_accelerated =
+      accelerated_consumption(acceleration, current_rate_by_acceleration, avg_alloc_rate / HeapWordSize,
+                              (ShenandoahAccelerationSamplePeriod / 1000.0) + future_accelerated_planned_gc_time);
 
-  log_debug(gc)("average GC time: %.2f ms, allocation rate: %.0f %s/s",
-          avg_cycle_time * 1000, byte_size_in_proper_unit(avg_alloc_rate), proper_unit_for_byte_size(avg_alloc_rate));
-  if (avg_cycle_time * avg_alloc_rate > allocation_headroom) {
-    log_trigger("Average GC time (%.2f ms) is above the time for average allocation rate (%.0f %sB/s)"
-                 " to deplete free headroom (%zu%s) (margin of error = %.2f)",
-                 avg_cycle_time * 1000,
-                 byte_size_in_proper_unit(avg_alloc_rate), proper_unit_for_byte_size(avg_alloc_rate),
-                 byte_size_in_proper_unit(allocation_headroom), proper_unit_for_byte_size(allocation_headroom),
-                 _margin_of_error_sd);
-    log_info(gc, ergo)("Free headroom: %zu%s (free) - %zu%s (spike) - %zu%s (penalties) = %zu%s",
-                       byte_size_in_proper_unit(available),           proper_unit_for_byte_size(available),
-                       byte_size_in_proper_unit(spike_headroom),      proper_unit_for_byte_size(spike_headroom),
-                       byte_size_in_proper_unit(penalties),           proper_unit_for_byte_size(penalties),
-                       byte_size_in_proper_unit(allocation_headroom), proper_unit_for_byte_size(allocation_headroom));
+    // Note that even a single thread that wakes up and begins to allocate excessively can manifest as accelerating allocation
+    // rate. This thread will initially allocate a TLAB of minimum size.  Then it will allocate a TLAB twice as big a bit later,
+    // and then twice as big again after another short delay.  When a phase change causes many threads to increase their
+    // allocation behavior, this effect is multiplied, and compounded by jitter in the times that individual threads experience
+    // the phase change.
+    //
+    // The following trace represents an actual workload, with allocation rates sampled at 10 Hz, the default behavior before
+    // introduction of accelerated allocation rate detection.  Though the allocation rate is seen to be increasing at times
+    // 101.907 and 102.007 and 102.108, the newly sampled allocation rate is not enough to trigger GC because the headroom is
+    // still quite large.  In fact, GC is not triggered until time 102.409s, and this GC degenerates.
+    //
+    //    Sample Time (s)      Allocation Rate (MB/s)       Headroom (GB)
+    //       101.807                       0.0                  26.93
+    //                                                                  <--- accelerated spike can trigger here, around time 101.9s
+    //       101.907                     477.6                  26.85
+    //       102.007                   3,206.0                  26.35
+    //       102.108                  23,797.8                  24.19
+    //       102.208                  24,164.5                  21.83
+    //       102.309                  23,965.0                  19.47
+    //       102.409                  24,624.35                 17.05   <--- without accelerated rate detection, we trigger here
+    //
+    // Though the above measurements are from actual workload, the following details regarding sampled allocation rates at 3ms
+    // period were not measured directly for this run-time sample.  These are hypothetical, though they represent a plausible
+    // result that correlates with the actual measurements.
+    //
+    // For most of the 100 ms time span that precedes the sample at 101.907, the allocation rate still remains at zero.  The phase
+    // change that causes increasing allocations occurs near the end ot this time segment.  When sampled with a 3 ms period,
+    // acceration of allocation can be triggered at approximately time 101.88s.
+    //
+    // In the default configuration, accelerated allocation rate is detected by examining a sequence of 8 allocation rate samples.
+    //
+    // Even a single allocation rate sample above the norm can be interpreted as acceleration of allocation rate.  For example, the
+    // the best-fit line for the following samples has an acceleration rate of 3,553.3 MB/s/s.  This is not enough to trigger GC,
+    // especially given the abundance of Headroom at this moment in time.
+    //
+    //    TimeStamp (s)     Alloc rate (MB/s)
+    //    101.857                 0
+    //    101.860                 0
+    //    101.863                 0
+    //    101.866                 0
+    //    101.869                53.3
+    //
+    // At the next sample time, we will compute a slightly higher acceration, 9,150 MB/s/s.  This is also insufficient to trigger
+    // GC.
+    //
+    //    TimeStamp (s)     Alloc rate (MB/s)
+    //    101.860                 0
+    //    101.863                 0
+    //    101.866                 0
+    //    101.869                53.3
+    //    101.872               110.6
+    //
+    // Eventually, we will observe a full history of accelerating rate samples, computing acceleration of 18,500 MB/s/s.  This will
+    // trigger GC over 500 ms earlier than was previously possible.
+    //
+    //    TimeStamp (s)     Alloc rate (MB/s)
+    //    101.866                 0
+    //    101.869                53.3
+    //    101.872               110.6
+    //    101.875               165.9
+    //    101.878               221.2
+    //
+    // The accelerated rate heuristic is based on the following idea:
+    //
+    //    Assume allocation rate is accelerating at a constant rate.  If we postpone the spike trigger until the subsequent
+    //    sample point, will there be enough memory to satisfy allocations that occur during the anticipated concurrent GC
+    //    cycle?  If not, we should trigger right now.
+    //
+    // Outline of this heuristic triggering technique:
+    //
+    //  1. We remember the N (e.g. N=3) most recent samples of spike allocation rate r0, r1, r2 samples at t0, t1, and t2
+    //  2. if r1 < r0 or r2 < r1, approximate Acceleration = 0.0, Rate = Average(r0, r1, r2)
+    //  3. Otherwise, use least squares method to compute best-fit line of rate vs time
+    //  4. The slope of this line represents Acceleration. The y-intercept of this line represents "initial rate"
+    //  5. Use r2 to rrpresent CurrentRate
+    //  6. Use Consumption = CurrentRate * GCTime + 1/2 * Acceleration * GCTime * GCTime
+    //     (See High School physics discussions on constant acceleration: D = v0 * t + 1/2 * a * t^2)
+    //  7. if Consumption exceeds headroom, trigger now
+    //
+    // Though larger sample size may improve quality of predictor, it also delays trigger response.  Smaller sample sizes
+    // are more susceptible to false triggers based on random noise.  The default configuration uses a sample size of 8 and
+    // a sample period of roughly 15 ms, spanning approximately 120 ms of execution.
+    if (consumption_accelerated > allocatable_words) {
+      size_t size_t_alloc_rate = (size_t) current_rate_by_acceleration * HeapWordSize;
+      if (acceleration > 0) {
+        size_t size_t_acceleration = (size_t) acceleration * HeapWordSize;
+        log_trigger("Accelerated consumption (" PROPERFMT ") exceeds free headroom (" PROPERFMT ") at "
+                    "current rate (" PROPERFMT "/s) with acceleration (" PROPERFMT "/s/s) for planned %s GC time (%.2f ms)",
+                    PROPERFMTARGS(consumption_accelerated * HeapWordSize),
+                    PROPERFMTARGS(allocatable_words * HeapWordSize),
+                    PROPERFMTARGS(size_t_alloc_rate),
+                    PROPERFMTARGS(size_t_acceleration),
+                    future_accelerated_planned_gc_time_is_average? "(from average)": "(by linear prediction)",
+                    future_accelerated_planned_gc_time * 1000);
+      } else {
+        log_trigger("Momentary spike consumption (" PROPERFMT ") exceeds free headroom (" PROPERFMT ") at "
+                    "current rate (" PROPERFMT "/s) for planned %s GC time (%.2f ms) (spike threshold = %.2f)",
+                    PROPERFMTARGS(consumption_accelerated * HeapWordSize),
+                    PROPERFMTARGS(allocatable_words * HeapWordSize),
+                    PROPERFMTARGS(size_t_alloc_rate),
+                    future_accelerated_planned_gc_time_is_average? "(from average)": "(by linear prediction)",
+                    future_accelerated_planned_gc_time * 1000, _spike_threshold_sd);
+
+
+      }
+      _spike_acceleration_num_samples = 0;
+      _spike_acceleration_first_sample_index = 0;
+
+      // Count this as a form of RATE trigger for purposes of adjusting heuristic triggering configuration because this
+      // trigger is influenced more by margin_of_error_sd than by spike_threshold_sd.
+      accept_trigger_with_type(RATE);
+      return true;
+    }
+  }
+
+  // Suppose we don't trigger now, but decide to trigger in the next regulator cycle.  What will be the GC time then?
+  predicted_future_gc_time = predict_gc_time(now + get_planned_sleep_interval());
+  if (predicted_future_gc_time > avg_cycle_time) {
+    future_planned_gc_time = predicted_future_gc_time;
+    future_planned_gc_time_is_average = false;
+  } else {
+    future_planned_gc_time = avg_cycle_time;
+    future_planned_gc_time_is_average = true;
+  }
+
+  log_debug(gc)("%s: average GC time: %.2f ms, predicted GC time: %.2f ms, allocation rate: %.0f %s/s",
+                _space_info->name(), avg_cycle_time * 1000, predicted_future_gc_time * 1000,
+                byte_size_in_proper_unit(avg_alloc_rate), proper_unit_for_byte_size(avg_alloc_rate));
+  size_t allocatable_bytes = allocatable_words * HeapWordSize;
+  avg_time_to_deplete_available = allocatable_bytes / avg_alloc_rate;
+
+  if (future_planned_gc_time > avg_time_to_deplete_available) {
+    log_trigger("%s GC time (%.2f ms) is above the time for average allocation rate (%.0f %sB/s)"
+                " to deplete free headroom (%zu%s) (margin of error = %.2f)",
+                future_planned_gc_time_is_average? "Average": "Linear prediction of", future_planned_gc_time * 1000,
+                byte_size_in_proper_unit(avg_alloc_rate),    proper_unit_for_byte_size(avg_alloc_rate),
+                byte_size_in_proper_unit(allocatable_bytes), proper_unit_for_byte_size(allocatable_bytes),
+                _margin_of_error_sd);
+
+    size_t spike_headroom = capacity / 100 * ShenandoahAllocSpikeFactor;
+    size_t penalties      = capacity / 100 * _gc_time_penalties;
+    size_t allocation_headroom = available;
+    allocation_headroom -= MIN2(allocation_headroom, spike_headroom);
+    allocation_headroom -= MIN2(allocation_headroom, penalties);
+    log_info(gc, ergo)("Free headroom: " PROPERFMT " (free) - " PROPERFMT "(spike) - " PROPERFMT " (penalties) = " PROPERFMT,
+                       PROPERFMTARGS(available),
+                       PROPERFMTARGS(spike_headroom),
+                       PROPERFMTARGS(penalties),
+                       PROPERFMTARGS(allocation_headroom));
     accept_trigger_with_type(RATE);
     return true;
   }
 
-  bool is_spiking = _allocation_rate.is_spiking(rate, _spike_threshold_sd);
-  if (is_spiking && avg_cycle_time > allocation_headroom / rate) {
-    log_trigger("Average GC time (%.2f ms) is above the time for instantaneous allocation rate (%.0f %sB/s) to deplete free headroom (%zu%s) (spike threshold = %.2f)",
-                 avg_cycle_time * 1000,
-                 byte_size_in_proper_unit(rate), proper_unit_for_byte_size(rate),
-                 byte_size_in_proper_unit(allocation_headroom), proper_unit_for_byte_size(allocation_headroom),
-                 _spike_threshold_sd);
+  is_spiking = _allocation_rate.is_spiking(rate, _spike_threshold_sd);
+  spike_time_to_deplete_available = (rate == 0)? 0: allocatable_bytes / rate;
+  if (is_spiking && (rate != 0) && (future_planned_gc_time > spike_time_to_deplete_available)) {
+    log_trigger("%s GC time (%.2f ms) is above the time for instantaneous allocation rate (%.0f %sB/s)"
+                " to deplete free headroom (%zu%s) (spike threshold = %.2f)",
+                future_planned_gc_time_is_average? "Average": "Linear prediction of", future_planned_gc_time * 1000,
+                byte_size_in_proper_unit(rate),        proper_unit_for_byte_size(rate),
+                byte_size_in_proper_unit(allocatable_bytes), proper_unit_for_byte_size(allocatable_bytes),
+                _spike_threshold_sd);
     accept_trigger_with_type(SPIKE);
     return true;
   }
-
-  if (ShenandoahHeuristics::should_start_gc()) {
-    _start_gc_is_pending = true;
-    return true;
-  } else {
-    return false;
-  }
+  return ShenandoahHeuristics::should_start_gc();
 }
 
 void ShenandoahAdaptiveHeuristics::adjust_last_trigger_parameters(double amount) {
@@ -352,6 +711,112 @@ size_t ShenandoahAdaptiveHeuristics::min_free_threshold() {
   return ShenandoahHeap::heap()->soft_max_capacity() / 100 * ShenandoahMinFreeThreshold;
 }
 
+// This is called each time a new rate sample has been gathered, as governed by ShenandoahAccelerationSamplePeriod.
+// Unlike traditional calculation of average allocation rate, there is no adjustment for standard deviation of the
+// accelerated rate prediction.
+size_t ShenandoahAdaptiveHeuristics::accelerated_consumption(double& acceleration, double& current_rate,
+                                                             double avg_alloc_rate_words_per_second,
+                                                             double predicted_cycle_time) const
+{
+  double *x_array = (double *) alloca(ShenandoahRateAccelerationSampleSize * sizeof(double));
+  double *y_array = (double *) alloca(ShenandoahRateAccelerationSampleSize * sizeof(double));
+  double x_sum = 0.0;
+  double y_sum = 0.0;
+
+  assert(_spike_acceleration_num_samples > 0, "At minimum, we should have sample from this period");
+
+  double weighted_average_alloc;
+  if (_spike_acceleration_num_samples >= ShenandoahRateAccelerationSampleSize) {
+    double weighted_y_sum = 0;
+    double total_weight = 0;
+    double previous_x = 0;
+    uint delta = _spike_acceleration_num_samples - ShenandoahRateAccelerationSampleSize;
+    for (uint i = 0; i < ShenandoahRateAccelerationSampleSize; i++) {
+      uint index = (_spike_acceleration_first_sample_index + delta + i) % _spike_acceleration_buffer_size;
+      x_array[i] = _spike_acceleration_rate_timestamps[index];
+      x_sum += x_array[i];
+      y_array[i] = _spike_acceleration_rate_samples[index];
+      if (i > 0) {
+        // first sample not included in weighted average because it has no weight.
+        double sample_weight = x_array[i] - x_array[i-1];
+        weighted_y_sum = y_array[i] * sample_weight;
+        total_weight += sample_weight;
+      }
+      y_sum += y_array[i];
+    }
+    weighted_average_alloc = (total_weight > 0)? weighted_y_sum / total_weight: 0;
+  } else {
+    weighted_average_alloc = 0;
+  }
+
+  double momentary_rate;
+  if (_spike_acceleration_num_samples > ShenandoahMomentaryAllocationRateSpikeSampleSize) {
+    // Num samples must be strictly greater than sample size, because we need one extra sample to compute rate and weights
+    // In this context, the weight of a y value (an allocation rate) is the duration for which this allocation rate was
+    // active (the time since previous y value was reported).  An allocation rate measured over a span of 300 ms (e.g. during
+    // concurrent GC) has much more "weight" than an allocation rate measured over a span of 15 s.
+    double weighted_y_sum = 0;
+    double total_weight = 0;
+    double sum_for_average = 0.0;
+    uint delta = _spike_acceleration_num_samples - ShenandoahMomentaryAllocationRateSpikeSampleSize;
+    for (uint i = 0; i < ShenandoahMomentaryAllocationRateSpikeSampleSize; i++) {
+      uint sample_index = (_spike_acceleration_first_sample_index + delta + i) % _spike_acceleration_buffer_size;
+      uint preceding_index = (sample_index == 0)? _spike_acceleration_buffer_size - 1: sample_index - 1;
+      double sample_weight = (_spike_acceleration_rate_timestamps[sample_index]
+                              - _spike_acceleration_rate_timestamps[preceding_index]);
+      weighted_y_sum += _spike_acceleration_rate_samples[sample_index] * sample_weight;
+      total_weight += sample_weight;
+    }
+    momentary_rate = weighted_y_sum / total_weight;
+    bool is_spiking = _allocation_rate.is_spiking(momentary_rate, _spike_threshold_sd);
+    if (!is_spiking) {
+      // Disable momentary spike trigger unless allocation rate delta from average exceeds sd
+      momentary_rate = 0.0;
+    }
+  } else {
+    momentary_rate = 0.0;
+  }
+
+  // By default, use momentary_rate for current rate and zero acceleration. Overwrite iff best-fit line has positive slope.
+  current_rate = momentary_rate;
+  acceleration = 0.0;
+  if ((_spike_acceleration_num_samples >= ShenandoahRateAccelerationSampleSize)
+      && (weighted_average_alloc >= avg_alloc_rate_words_per_second))  {
+    // If the average rate across the acceleration samples is below the overall average, this sample is not eligible to
+    //  represent acceleration of allocation rate.  We may just be catching up with allocations after a lull.
+
+    double *xy_array = (double *) alloca(ShenandoahRateAccelerationSampleSize * sizeof(double));
+    double *x2_array = (double *) alloca(ShenandoahRateAccelerationSampleSize * sizeof(double));
+    double xy_sum = 0.0;
+    double x2_sum = 0.0;
+    for (uint i = 0; i < ShenandoahRateAccelerationSampleSize; i++) {
+      xy_array[i] = x_array[i] * y_array[i];
+      xy_sum += xy_array[i];
+      x2_array[i] = x_array[i] * x_array[i];
+      x2_sum += x2_array[i];
+    }
+    // Find the best-fit least-squares linear representation of rate vs time
+    double m;                 /* slope */
+    double b;                 /* y-intercept */
+
+    m = ((ShenandoahRateAccelerationSampleSize * xy_sum - x_sum * y_sum)
+         / (ShenandoahRateAccelerationSampleSize * x2_sum - x_sum * x_sum));
+    b = (y_sum - m * x_sum) / ShenandoahRateAccelerationSampleSize;
+
+    if (m > 0) {
+      double proposed_current_rate = m * x_array[ShenandoahRateAccelerationSampleSize - 1] + b;
+      acceleration = m;
+      current_rate = proposed_current_rate;
+    }
+    // else, leave current_rate = momentary_rate, acceleration = 0
+  }
+  // and here also, leave current_rate = momentary_rate, acceleration = 0
+
+  double time_delta = get_planned_sleep_interval() + predicted_cycle_time;
+  size_t words_to_be_consumed = (size_t) (current_rate * time_delta + 0.5 * acceleration * time_delta * time_delta);
+  return words_to_be_consumed;
+}
+
 ShenandoahAllocationRate::ShenandoahAllocationRate() :
   _last_sample_time(os::elapsedTime()),
   _last_sample_value(0),
@@ -363,7 +828,7 @@ ShenandoahAllocationRate::ShenandoahAllocationRate() :
 double ShenandoahAllocationRate::force_sample(size_t allocated, size_t &unaccounted_bytes_allocated) {
   const double MinSampleTime = 0.002;    // Do not sample if time since last update is less than 2 ms
   double now = os::elapsedTime();
-  double time_since_last_update = now -_last_sample_time;
+  double time_since_last_update = now - _last_sample_time;
   if (time_since_last_update < MinSampleTime) {
     unaccounted_bytes_allocated = allocated - _last_sample_value;
     _last_sample_value = 0;
@@ -412,8 +877,10 @@ bool ShenandoahAllocationRate::is_spiking(double rate, double threshold) const {
 
   double sd = _rate.sd();
   if (sd > 0) {
-    // There is a small chance that that rate has already been sampled, but it
-    // seems not to matter in practice.
+    // There is a small chance that that rate has already been sampled, but it seems not to matter in practice.
+    // Note that z_score reports how close the rate is to the average.  A value between -1 and 1 means we are within one
+    // standard deviation.  A value between -3 and +3 means we are within 3 standard deviations.  We only check for z_score
+    // greater than threshold because we are looking for an allocation spike which is greater than the mean.
     double z_score = (rate - _rate.avg()) / sd;
     if (z_score > threshold) {
       return true;
diff --git a/src/hotspot/share/gc/shenandoah/heuristics/shenandoahAdaptiveHeuristics.hpp b/src/hotspot/share/gc/shenandoah/heuristics/shenandoahAdaptiveHeuristics.hpp
index 9b7824a50d7..c761f2a82f3 100644
--- a/src/hotspot/share/gc/shenandoah/heuristics/shenandoahAdaptiveHeuristics.hpp
+++ b/src/hotspot/share/gc/shenandoah/heuristics/shenandoahAdaptiveHeuristics.hpp
@@ -27,7 +27,9 @@
 #define SHARE_GC_SHENANDOAH_HEURISTICS_SHENANDOAHADAPTIVEHEURISTICS_HPP
 
 #include "gc/shenandoah/heuristics/shenandoahHeuristics.hpp"
+#include "gc/shenandoah/shenandoahFreeSet.hpp"
 #include "gc/shenandoah/shenandoahPhaseTimings.hpp"
+#include "gc/shenandoah/shenandoahRegulatorThread.hpp"
 #include "gc/shenandoah/shenandoahSharedVariables.hpp"
 #include "memory/allocation.hpp"
 #include "utilities/numberSeq.hpp"
@@ -108,6 +110,26 @@ public:
 
   virtual ~ShenandoahAdaptiveHeuristics();
 
+  virtual void initialize() override;
+
+  virtual void post_initialize() override;
+
+  virtual void adjust_penalty(intx step) override;
+
+  // At the end of GC(N), we idle GC until necessary to start the next GC.  Compute the threshold of memory that can be allocated
+  // before we need to start the next GC.
+  void start_idle_span() override;
+
+  // Having observed a new allocation rate sample, add this to the acceleration history so that we can determine if allocation
+  // rate is accelerating.
+  void add_rate_to_acceleration_history(double timestamp, double rate);
+
+  // Compute and return the current allocation rate, the current rate of acceleration, and the amount of memory that we expect
+  // to consume if we start GC right now and gc takes predicted_cycle_time to complete.
+  size_t accelerated_consumption(double& acceleration, double& current_rate,
+                                 double avg_rate_words_per_sec, double predicted_cycle_time) const;
+
+
   void choose_collection_set_from_regiondata(ShenandoahCollectionSet* cset,
                                                        RegionData* data, size_t size,
                                                        size_t actual_free) override;
@@ -136,6 +158,8 @@ public:
   const static double LOWEST_EXPECTED_AVAILABLE_AT_END;
   const static double HIGHEST_EXPECTED_AVAILABLE_AT_END;
 
+  const static size_t GC_TIME_SAMPLE_SIZE;
+
   friend class ShenandoahAllocationRate;
 
   // Used to record the last trigger that signaled to start a GC.
@@ -150,9 +174,19 @@ public:
   void adjust_margin_of_error(double amount);
   void adjust_spike_threshold(double amount);
 
+  // Returns number of words that can be allocated before we need to trigger next GC, given available in bytes.
+  inline size_t allocatable(size_t available) const {
+    return (available > _headroom_adjustment)? (available - _headroom_adjustment) / HeapWordSize: 0;
+  }
+
 protected:
   ShenandoahAllocationRate _allocation_rate;
 
+  // Invocations of should_start_gc() happen approximately once per ms.  Queries of allocation rate only happen if a
+  // a certain amount of time has passed since the previous query.
+  size_t _allocated_at_previous_query;
+  double _time_of_previous_allocation_query;
+
   // The margin of error expressed in standard deviations to add to our
   // average cycle time and allocation rate. As this value increases we
   // tend to overestimate the rate at which mutators will deplete the
@@ -179,6 +213,48 @@ protected:
   // source of feedback to adjust trigger parameters.
   TruncatedSeq _available;
 
+  ShenandoahFreeSet* _free_set;
+
+  // This represents the time at which the allocation rate was most recently sampled for the purpose of detecting acceleration.
+  double _previous_acceleration_sample_timestamp;
+  size_t _total_allocations_at_start_of_idle;
+
+  // bytes of headroom at which we should trigger GC
+  size_t _headroom_adjustment;
+
+  // Keep track of GC_TIME_SAMPLE_SIZE most recent concurrent GC cycle times
+  uint _gc_time_first_sample_index;
+  uint _gc_time_num_samples;
+  double* const _gc_time_timestamps;
+  double* const _gc_time_samples;
+  double* const _gc_time_xy;    // timestamp * sample
+  double* const _gc_time_xx;    // timestamp squared
+  double _gc_time_sum_of_timestamps;
+  double _gc_time_sum_of_samples;
+  double _gc_time_sum_of_xy;
+  double _gc_time_sum_of_xx;
+
+  double _gc_time_m;            // slope
+  double _gc_time_b;            // y-intercept
+  double _gc_time_sd;           // sd on deviance from prediction
+
+  // In preparation for a span during which GC will be idle, compute the headroom adjustment that will be used to
+  // detect when GC needs to trigger.
+  void compute_headroom_adjustment() override;
+
+  void add_gc_time(double timestamp_at_start, double duration);
+  void add_degenerated_gc_time(double timestamp_at_start, double duration);
+  double predict_gc_time(double timestamp_at_start);
+
+  // Keep track of SPIKE_ACCELERATION_SAMPLE_SIZE most recent spike allocation rate measurements. Note that it is
+  // typical to experience a small spike following end of GC cycle, as mutator threads refresh their TLABs.  But
+  // there is generally an abundance of memory at this time as well, so this will not generally trigger GC.
+  uint _spike_acceleration_buffer_size;
+  uint _spike_acceleration_first_sample_index;
+  uint _spike_acceleration_num_samples;
+  double* const _spike_acceleration_rate_samples; // holds rates in words/second
+  double* const _spike_acceleration_rate_timestamps;
+
   // A conservative minimum threshold of free space that we'll try to maintain when possible.
   // For example, we might trigger a concurrent gc if we are likely to drop below
   // this threshold, or we might consider this when dynamically resizing generations
diff --git a/src/hotspot/share/gc/shenandoah/heuristics/shenandoahGenerationalHeuristics.cpp b/src/hotspot/share/gc/shenandoah/heuristics/shenandoahGenerationalHeuristics.cpp
index 029b917deab..f3d31b8d0e1 100644
--- a/src/hotspot/share/gc/shenandoah/heuristics/shenandoahGenerationalHeuristics.cpp
+++ b/src/hotspot/share/gc/shenandoah/heuristics/shenandoahGenerationalHeuristics.cpp
@@ -52,6 +52,12 @@ static int compare_by_aged_live(AgedRegionData a, AgedRegionData b) {
   return 0;
 }
 
+void ShenandoahGenerationalHeuristics::post_initialize() {
+  ShenandoahHeuristics::post_initialize();
+  _free_set = ShenandoahHeap::heap()->free_set();
+  compute_headroom_adjustment();
+}
+
 inline void assert_no_in_place_promotions() {
 #ifdef ASSERT
   class ShenandoahNoInPlacePromotions : public ShenandoahHeapRegionClosure {
diff --git a/src/hotspot/share/gc/shenandoah/heuristics/shenandoahGenerationalHeuristics.hpp b/src/hotspot/share/gc/shenandoah/heuristics/shenandoahGenerationalHeuristics.hpp
index 74d657feab7..da883d0d26f 100644
--- a/src/hotspot/share/gc/shenandoah/heuristics/shenandoahGenerationalHeuristics.hpp
+++ b/src/hotspot/share/gc/shenandoah/heuristics/shenandoahGenerationalHeuristics.hpp
@@ -49,6 +49,8 @@ public:
 
   void choose_collection_set(ShenandoahCollectionSet* collection_set) override;
 
+  virtual void post_initialize() override;
+
 private:
   // Compute evacuation budgets prior to choosing collection set.
   void compute_evacuation_budgets(ShenandoahHeap* const heap);
diff --git a/src/hotspot/share/gc/shenandoah/heuristics/shenandoahHeuristics.cpp b/src/hotspot/share/gc/shenandoah/heuristics/shenandoahHeuristics.cpp
index 8fc744112bf..603e00c401d 100644
--- a/src/hotspot/share/gc/shenandoah/heuristics/shenandoahHeuristics.cpp
+++ b/src/hotspot/share/gc/shenandoah/heuristics/shenandoahHeuristics.cpp
@@ -46,13 +46,16 @@ int ShenandoahHeuristics::compare_by_garbage(RegionData a, RegionData b) {
 }
 
 ShenandoahHeuristics::ShenandoahHeuristics(ShenandoahSpaceInfo* space_info) :
+  _most_recent_trigger_evaluation_time(os::elapsedTime()),
+  _most_recent_planned_sleep_interval(0.0),
   _start_gc_is_pending(false),
   _declined_trigger_count(0),
   _most_recent_declined_trigger_count(0),
   _space_info(space_info),
   _region_data(nullptr),
   _guaranteed_gc_interval(0),
-  _cycle_start(os::elapsedTime()),
+  _precursor_cycle_start(os::elapsedTime()),
+  _cycle_start(_precursor_cycle_start),
   _last_cycle_end(0),
   _gc_times_learned(0),
   _gc_time_penalties(0),
@@ -156,6 +159,19 @@ void ShenandoahHeuristics::choose_collection_set(ShenandoahCollectionSet* collec
   collection_set->summarize(total_garbage, immediate_garbage, immediate_regions);
 }
 
+void ShenandoahHeuristics::start_idle_span() {
+  // do nothing
+}
+
+void ShenandoahHeuristics::record_degenerated_cycle_start(bool out_of_cycle) {
+  if (out_of_cycle) {
+    _precursor_cycle_start = _cycle_start = os::elapsedTime();
+  } else {
+    _precursor_cycle_start = _cycle_start;
+    _cycle_start = os::elapsedTime();
+  }
+}
+
 void ShenandoahHeuristics::record_cycle_start() {
   _cycle_start = os::elapsedTime();
 }
@@ -197,7 +213,6 @@ bool ShenandoahHeuristics::should_degenerate_cycle() {
 void ShenandoahHeuristics::adjust_penalty(intx step) {
   assert(0 <= _gc_time_penalties && _gc_time_penalties <= 100,
          "In range before adjustment: %zd", _gc_time_penalties);
-
   if ((_most_recent_declined_trigger_count <= Penalty_Free_Declinations) && (step > 0)) {
     // Don't penalize if heuristics are not responsible for a negative outcome.  Allow Penalty_Free_Declinations following
     // previous GC for self calibration without penalty.
@@ -274,6 +289,17 @@ void ShenandoahHeuristics::initialize() {
   // Nothing to do by default.
 }
 
+void ShenandoahHeuristics::post_initialize() {
+  // Nothing to do by default.
+}
+
 double ShenandoahHeuristics::elapsed_cycle_time() const {
   return os::elapsedTime() - _cycle_start;
 }
+
+
+// Includes the time spent in abandoned concurrent GC cycle that may have triggered this degenerated cycle.
+double ShenandoahHeuristics::elapsed_degenerated_cycle_time() const {
+  double now = os::elapsedTime();
+  return now - _precursor_cycle_start;
+}
diff --git a/src/hotspot/share/gc/shenandoah/heuristics/shenandoahHeuristics.hpp b/src/hotspot/share/gc/shenandoah/heuristics/shenandoahHeuristics.hpp
index 633c4e87126..5bfba4f52d5 100644
--- a/src/hotspot/share/gc/shenandoah/heuristics/shenandoahHeuristics.hpp
+++ b/src/hotspot/share/gc/shenandoah/heuristics/shenandoahHeuristics.hpp
@@ -78,6 +78,10 @@ class ShenandoahHeuristics : public CHeapObj<mtGC> {
   };
 #endif
 
+private:
+  double _most_recent_trigger_evaluation_time;
+  double _most_recent_planned_sleep_interval;
+
 protected:
   static const uint Moving_Average_Samples = 10; // Number of samples to store in moving averages
 
@@ -85,14 +89,13 @@ protected:
   size_t _declined_trigger_count;         // This counts how many times since previous GC finished that this
                                           //  heuristic has answered false to should_start_gc().
   size_t _most_recent_declined_trigger_count;
-                                       ;  // This represents the value of _declined_trigger_count as captured at the
+                                          // This represents the value of _declined_trigger_count as captured at the
                                           //  moment the most recent GC effort was triggered.  In case the most recent
                                           //  concurrent GC effort degenerates, the value of this variable allows us to
                                           //  differentiate between degeneration because heuristic was overly optimistic
                                           //  in delaying the trigger vs. degeneration for other reasons (such as the
                                           //  most recent GC triggered "immediately" after previous GC finished, but the
                                           //  free headroom has already been depleted).
-
   class RegionData {
     private:
     ShenandoahHeapRegion* _region;
@@ -103,6 +106,7 @@ protected:
 #ifdef ASSERT
     UnionTag _union_tag;
 #endif
+
     public:
 
     inline void clear() {
@@ -171,6 +175,7 @@ protected:
 
   size_t _guaranteed_gc_interval;
 
+  double _precursor_cycle_start;
   double _cycle_start;
   double _last_cycle_end;
 
@@ -188,7 +193,7 @@ protected:
                                                      RegionData* data, size_t data_size,
                                                      size_t free) = 0;
 
-  void adjust_penalty(intx step);
+  virtual void adjust_penalty(intx step);
 
   inline void accept_trigger() {
     _most_recent_declined_trigger_count = _declined_trigger_count;
@@ -200,6 +205,14 @@ protected:
     _declined_trigger_count++;
   }
 
+  inline double get_most_recent_wake_time() const {
+    return _most_recent_trigger_evaluation_time;
+  }
+
+  inline double get_planned_sleep_interval() const {
+    return _most_recent_planned_sleep_interval;
+  }
+
 public:
   ShenandoahHeuristics(ShenandoahSpaceInfo* space_info);
   virtual ~ShenandoahHeuristics();
@@ -212,10 +225,22 @@ public:
     _guaranteed_gc_interval = guaranteed_gc_interval;
   }
 
+  virtual void start_idle_span();
+  virtual void compute_headroom_adjustment() {
+    // Default implementation does nothing.
+  }
+
   virtual void record_cycle_start();
 
+  void record_degenerated_cycle_start(bool out_of_cycle);
+
   virtual void record_cycle_end();
 
+  void update_should_start_query_times(double now, double planned_sleep_interval) {
+    _most_recent_trigger_evaluation_time = now;
+    _most_recent_planned_sleep_interval = planned_sleep_interval;
+  }
+
   virtual bool should_start_gc();
 
   inline void cancel_trigger_request() {
@@ -248,8 +273,10 @@ public:
   virtual bool is_diagnostic() = 0;
   virtual bool is_experimental() = 0;
   virtual void initialize();
+  virtual void post_initialize();
 
   double elapsed_cycle_time() const;
+  double elapsed_degenerated_cycle_time() const;
 
   virtual size_t force_alloc_rate_sample(size_t bytes_allocated) {
     // do nothing
diff --git a/src/hotspot/share/gc/shenandoah/heuristics/shenandoahYoungHeuristics.cpp b/src/hotspot/share/gc/shenandoah/heuristics/shenandoahYoungHeuristics.cpp
index beff2200d90..09508a1163f 100644
--- a/src/hotspot/share/gc/shenandoah/heuristics/shenandoahYoungHeuristics.cpp
+++ b/src/hotspot/share/gc/shenandoah/heuristics/shenandoahYoungHeuristics.cpp
@@ -137,6 +137,7 @@ bool ShenandoahYoungHeuristics::should_start_gc() {
 
   // inherited triggers have already decided to start a cycle, so no further evaluation is required
   if (ShenandoahAdaptiveHeuristics::should_start_gc()) {
+    // ShenandoahAdaptiveHeuristics::should_start_gc() has already accepted trigger, or declined it.
     return true;
   }
 
@@ -178,7 +179,7 @@ size_t ShenandoahYoungHeuristics::bytes_of_allocation_runway_before_gc_trigger(s
   size_t capacity = _space_info->max_capacity();
   size_t usage = _space_info->used();
   size_t available = (capacity > usage)? capacity - usage: 0;
-  size_t allocated = _space_info->bytes_allocated_since_gc_start();
+  size_t allocated = _free_set->get_bytes_allocated_since_gc_start();
 
   size_t available_young_collected = ShenandoahHeap::heap()->collection_set()->get_young_available_bytes_collected();
   size_t anticipated_available =
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahConcurrentGC.cpp b/src/hotspot/share/gc/shenandoah/shenandoahConcurrentGC.cpp
index 5206a0558e8..f0125c38cae 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahConcurrentGC.cpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahConcurrentGC.cpp
@@ -1215,6 +1215,7 @@ void ShenandoahConcurrentGC::op_final_update_refs() {
   }
 
   heap->rebuild_free_set(true /*concurrent*/);
+  _generation->heuristics()->start_idle_span();
 
   {
     ShenandoahTimingsTracker timing(ShenandoahPhaseTimings::final_update_refs_propagate_gc_state);
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahControlThread.cpp b/src/hotspot/share/gc/shenandoah/shenandoahControlThread.cpp
index bc11659c5e5..c5607421265 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahControlThread.cpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahControlThread.cpp
@@ -59,6 +59,7 @@ void ShenandoahControlThread::run_service() {
 
   ShenandoahCollectorPolicy* const policy = heap->shenandoah_policy();
   ShenandoahHeuristics* const heuristics = heap->heuristics();
+  double most_recent_wake_time = os::elapsedTime();
   while (!should_terminate()) {
     const GCCause::Cause cancelled_cause = heap->cancelled_cause();
     if (cancelled_cause == GCCause::_shenandoah_stop_vm) {
@@ -222,16 +223,26 @@ void ShenandoahControlThread::run_service() {
     // Wait before performing the next action. If allocation happened during this wait,
     // we exit sooner, to let heuristics re-evaluate new conditions. If we are at idle,
     // back off exponentially.
-    const double current = os::elapsedTime();
+    const double before_sleep = most_recent_wake_time;
     if (heap->has_changed()) {
       sleep = ShenandoahControlIntervalMin;
-    } else if ((current - last_sleep_adjust_time) * 1000 > ShenandoahControlIntervalAdjustPeriod){
+    } else if ((before_sleep - last_sleep_adjust_time) * 1000 > ShenandoahControlIntervalAdjustPeriod){
       sleep = MIN2<int>(ShenandoahControlIntervalMax, MAX2(1, sleep * 2));
-      last_sleep_adjust_time = current;
+      last_sleep_adjust_time = before_sleep;
     }
-
     MonitorLocker ml(&_control_lock, Mutex::_no_safepoint_check_flag);
     ml.wait(sleep);
+    // Record a conservative estimate of the longest anticipated sleep duration until we sample again.
+    double planned_sleep_interval = MIN2<int>(ShenandoahControlIntervalMax, MAX2(1, sleep * 2)) / 1000.0;
+    most_recent_wake_time = os::elapsedTime();
+    heuristics->update_should_start_query_times(most_recent_wake_time, planned_sleep_interval);
+    if (LogTarget(Debug, gc, thread)::is_enabled()) {
+      double elapsed = most_recent_wake_time - before_sleep;
+      double hiccup = elapsed - double(sleep);
+      if (hiccup > 0.001) {
+        log_debug(gc, thread)("Control Thread hiccup time: %.3fs", hiccup);
+      }
+    }
   }
 }
 
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahDegeneratedGC.cpp b/src/hotspot/share/gc/shenandoah/shenandoahDegeneratedGC.cpp
index 99776e38bfe..8cd8a390c4a 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahDegeneratedGC.cpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahDegeneratedGC.cpp
@@ -314,6 +314,7 @@ void ShenandoahDegenGC::op_degenerated() {
   if (progress) {
     heap->notify_gc_progress();
     _generation->heuristics()->record_degenerated();
+    heap->start_idle_span();
   } else if (policy->should_upgrade_degenerated_gc()) {
     // Upgrade to full GC, register full-GC impact on heuristics.
     op_degenerated_futile();
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahFreeSet.cpp b/src/hotspot/share/gc/shenandoah/shenandoahFreeSet.cpp
index 961800f20d9..c39e2e7bb79 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahFreeSet.cpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahFreeSet.cpp
@@ -287,9 +287,25 @@ void ShenandoahFreeSet::resize_old_collector_capacity(size_t regions) {
   // else, old generation is already appropriately sized
 }
 
+
 void ShenandoahFreeSet::reset_bytes_allocated_since_gc_start(size_t initial_bytes_allocated) {
   shenandoah_assert_heaplocked();
+  // Future inquiries of get_total_bytes_allocated() will return the sum of
+  //    _total_bytes_previously_allocated and _mutator_bytes_allocated_since_gc_start.
+  // Since _mutator_bytes_allocated_since_gc_start does not start at zero, we subtract initial_bytes_allocated so as
+  // to not double count these allocated bytes.
+  size_t original_mutator_bytes_allocated_since_gc_start = _mutator_bytes_allocated_since_gc_start;
+
+  // Setting _mutator_bytes_allocated_since_gc_start before _total_bytes_previously_allocated reduces the damage
+  // in the case that the control or regulator thread queries get_bytes_allocated_since_previous_sample() between
+  // the two assignments.
+  //
+  // These are not declared as volatile so the compiler or hardware may reorder the assignments.  The implementation of
+  // get_bytes_allocated_since_previous_cycle() is robust to this possibility, as are triggering heuristics.  The current
+  // implementation assumes we are better off to tolerate the very rare race rather than impose a synchronization penalty
+  // on every update and fetch.  (Perhaps it would be better to make the opposite tradeoff for improved maintainability.)
   _mutator_bytes_allocated_since_gc_start = initial_bytes_allocated;
+  _total_bytes_previously_allocated += original_mutator_bytes_allocated_since_gc_start - initial_bytes_allocated;
 }
 
 void ShenandoahFreeSet::increase_bytes_allocated(size_t bytes) {
@@ -1211,6 +1227,8 @@ inline void ShenandoahRegionPartitions::assert_bounds_sanity() {
 ShenandoahFreeSet::ShenandoahFreeSet(ShenandoahHeap* heap, size_t max_regions) :
   _heap(heap),
   _partitions(max_regions, this),
+  _total_bytes_previously_allocated(0),
+  _mutator_bytes_at_last_sample(0),
   _total_humongous_waste(0),
   _alloc_bias_weight(0),
   _total_young_used(0),
@@ -1676,9 +1694,6 @@ HeapWord* ShenandoahFreeSet::try_allocate_in(ShenandoahHeapRegion* r, Shenandoah
     // Regardless of whether this allocation succeeded, if the remaining memory is less than PLAB:min_size(), retire this region.
     // Note that retire_from_partition() increases used to account for waste.
 
-    // Also, if this allocation request failed and the consumed within this region * ShenandoahEvacWaste > region size,
-    // then retire the region so that subsequent searches can find available memory more quickly.
-
     size_t idx = r->index();
     size_t waste_bytes = _partitions.retire_from_partition(orig_partition, idx, r->used());
     DEBUG_ONLY(boundary_changed = true;)
@@ -1796,7 +1811,6 @@ HeapWord* ShenandoahFreeSet::allocate_contiguous(ShenandoahAllocRequest& req, bo
       // found the match
       break;
     }
-
     end++;
   }
 
@@ -2036,7 +2050,8 @@ void ShenandoahFreeSet::clear_internal() {
   _partitions.set_bias_from_left_to_right(ShenandoahFreeSetPartitionId::OldCollector, false);
 }
 
-void ShenandoahFreeSet::find_regions_with_alloc_capacity(size_t &young_trashed_regions, size_t &old_trashed_regions,
+// Returns total allocatable words in Mutator partition
+size_t ShenandoahFreeSet::find_regions_with_alloc_capacity(size_t &young_trashed_regions, size_t &old_trashed_regions,
                                                          size_t &first_old_region, size_t &last_old_region,
                                                          size_t &old_region_count) {
   // This resets all state information, removing all regions from all sets.
@@ -2054,6 +2069,8 @@ void ShenandoahFreeSet::find_regions_with_alloc_capacity(size_t &young_trashed_r
   size_t region_size_bytes = _partitions.region_size_bytes();
   size_t max_regions = _partitions.max();
 
+  size_t mutator_alloc_capacity_in_words = 0;
+
   size_t mutator_leftmost = max_regions;
   size_t mutator_rightmost = 0;
   size_t mutator_leftmost_empty = max_regions;
@@ -2123,6 +2140,7 @@ void ShenandoahFreeSet::find_regions_with_alloc_capacity(size_t &young_trashed_r
         if (region->is_trash() || !region->is_old()) {
           // Both young and old (possibly immediately) collected regions (trashed) are placed into the Mutator set
           _partitions.raw_assign_membership(idx, ShenandoahFreeSetPartitionId::Mutator);
+          mutator_alloc_capacity_in_words += ac / HeapWordSize;
           if (idx < mutator_leftmost) {
             mutator_leftmost = idx;
           }
@@ -2279,6 +2297,7 @@ void ShenandoahFreeSet::find_regions_with_alloc_capacity(size_t &young_trashed_r
                       _partitions.rightmost(ShenandoahFreeSetPartitionId::Mutator),
                       _partitions.leftmost(ShenandoahFreeSetPartitionId::OldCollector),
                       _partitions.rightmost(ShenandoahFreeSetPartitionId::OldCollector));
+  return mutator_alloc_capacity_in_words;
 }
 
 void ShenandoahFreeSet::transfer_humongous_regions_from_mutator_to_old_collector(size_t xfer_regions,
@@ -2583,19 +2602,20 @@ void ShenandoahFreeSet::prepare_to_rebuild(size_t &young_trashed_regions, size_t
   clear();
   log_debug(gc, free)("Rebuilding FreeSet");
 
-  // This places regions that have alloc_capacity into the old_collector set if they identify as is_old() or the
-  // mutator set otherwise.  All trashed (cset) regions are affiliated young and placed in mutator set.
-  find_regions_with_alloc_capacity(young_trashed_regions, old_trashed_regions,
-                                   first_old_region, last_old_region, old_region_count);
+  // Place regions that have alloc_capacity into the old_collector set if they identify as is_old() or the
+  // mutator set otherwise.  All trashed (cset) regions are affiliated young and placed in mutator set.  Save the
+  // allocatable words in mutator partition in state variable.
+  _prepare_to_rebuild_mutator_free = find_regions_with_alloc_capacity(young_trashed_regions, old_trashed_regions,
+                                                                      first_old_region, last_old_region, old_region_count);
 }
 
-
-void ShenandoahFreeSet::finish_rebuild(size_t young_cset_regions, size_t old_cset_regions, size_t old_region_count) {
+// Return mutator free
+void ShenandoahFreeSet::finish_rebuild(size_t young_trashed_regions, size_t old_trashed_regions, size_t old_region_count) {
   shenandoah_assert_heaplocked();
   size_t young_reserve(0), old_reserve(0);
 
   if (_heap->mode()->is_generational()) {
-    compute_young_and_old_reserves(young_cset_regions, old_cset_regions, young_reserve, old_reserve);
+    compute_young_and_old_reserves(young_trashed_regions, old_trashed_regions, young_reserve, old_reserve);
   } else {
     young_reserve = (_heap->max_capacity() / 100) * ShenandoahEvacReserve;
     old_reserve = 0;
@@ -2744,10 +2764,13 @@ void ShenandoahFreeSet::compute_young_and_old_reserves(size_t young_trashed_regi
 // into the collector set or old collector set in order to assure that the memory available for allocations within
 // the collector set is at least to_reserve and the memory available for allocations within the old collector set
 // is at least to_reserve_old.
-void ShenandoahFreeSet::reserve_regions(size_t to_reserve, size_t to_reserve_old, size_t &old_region_count,
-                                        size_t &young_used_regions, size_t &old_used_regions,
-                                        size_t &young_used_bytes, size_t &old_used_bytes) {
+//
+// Returns total mutator alloc capacity, in words.
+size_t ShenandoahFreeSet::reserve_regions(size_t to_reserve, size_t to_reserve_old, size_t &old_region_count,
+                                          size_t &young_used_regions, size_t &old_used_regions,
+                                          size_t &young_used_bytes, size_t &old_used_bytes) {
   const size_t region_size_bytes = ShenandoahHeapRegion::region_size_bytes();
+  size_t mutator_allocatable_words = _prepare_to_rebuild_mutator_free;
 
   young_used_regions = 0;
   old_used_regions = 0;
@@ -2825,6 +2848,8 @@ void ShenandoahFreeSet::reserve_regions(size_t to_reserve, size_t to_reserve_old
                               _partitions.leftmost(ShenandoahFreeSetPartitionId::OldCollector),
                               _partitions.rightmost(ShenandoahFreeSetPartitionId::OldCollector));
           old_region_count++;
+          assert(ac = ShenandoahHeapRegion::region_size_bytes(), "Cannot move to old unless entire region is in alloc capacity");
+          mutator_allocatable_words -= ShenandoahHeapRegion::region_size_words();
           continue;
         }
       }
@@ -2868,8 +2893,10 @@ void ShenandoahFreeSet::reserve_regions(size_t to_reserve, size_t to_reserve_old
                             "  Collector range [%zd, %zd]",
                             _partitions.leftmost(ShenandoahFreeSetPartitionId::Mutator),
                             _partitions.rightmost(ShenandoahFreeSetPartitionId::Mutator),
-                            _partitions.leftmost(ShenandoahFreeSetPartitionId::Collector),
-                            _partitions.rightmost(ShenandoahFreeSetPartitionId::Collector));
+                            _partitions.leftmost(ShenandoahFreeSetPartitionId::OldCollector),
+                            _partitions.rightmost(ShenandoahFreeSetPartitionId::OldCollector));
+
+        mutator_allocatable_words -= ac / HeapWordSize;
         continue;
       }
 
@@ -2977,6 +3004,7 @@ void ShenandoahFreeSet::reserve_regions(size_t to_reserve, size_t to_reserve_old
                          PROPERFMTARGS(to_reserve), PROPERFMTARGS(reserve));
     }
   }
+  return mutator_allocatable_words;
 }
 
 void ShenandoahFreeSet::establish_old_collector_alloc_bias() {
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahFreeSet.hpp b/src/hotspot/share/gc/shenandoah/shenandoahFreeSet.hpp
index d55a06d5713..2df06432bd2 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahFreeSet.hpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahFreeSet.hpp
@@ -437,6 +437,12 @@ private:
   ShenandoahHeap* const _heap;
   ShenandoahRegionPartitions _partitions;
 
+  size_t _total_bytes_previously_allocated;
+  size_t _mutator_bytes_at_last_sample;
+
+  // Temporarily holds mutator_Free allocatable bytes between prepare_to_rebuild() and finish_rebuild()
+  size_t _prepare_to_rebuild_mutator_free;
+
   // This locks the rebuild process (in combination with the global heap lock).  Whenever we rebuild the free set,
   // we first acquire the global heap lock and then we acquire this _rebuild_lock in a nested context.  Threads that
   // need to check available, acquire only the _rebuild_lock to make sure that they are not obtaining the value of
@@ -446,10 +452,10 @@ private:
   // locks will acquire them in the same order: first the global heap lock and then the rebuild lock.
   ShenandoahRebuildLock _rebuild_lock;
 
-  size_t _total_humongous_waste;
-
   HeapWord* allocate_aligned_plab(size_t size, ShenandoahAllocRequest& req, ShenandoahHeapRegion* r);
 
+  size_t _total_humongous_waste;
+
   // We re-evaluate the left-to-right allocation bias whenever _alloc_bias_weight is less than zero.  Each time
   // we allocate an object, we decrement the count of this value.  Each time we re-evaluate whether to allocate
   // from right-to-left or left-to-right, we reset the value of this counter to _InitialAllocBiasWeight.
@@ -662,10 +668,47 @@ public:
 
   void increase_bytes_allocated(size_t bytes);
 
+  // Return an approximation of the bytes allocated since GC start.  The value returned is monotonically non-decreasing
+  // in time within each GC cycle.  For certain GC cycles, the value returned may include some bytes allocated before
+  // the start of the current GC cycle.
   inline size_t get_bytes_allocated_since_gc_start() const {
     return _mutator_bytes_allocated_since_gc_start;
   }
 
+  inline size_t get_total_bytes_allocated() {
+    return  _mutator_bytes_allocated_since_gc_start + _total_bytes_previously_allocated;
+  }
+
+  inline size_t get_bytes_allocated_since_previous_sample() {
+    size_t total_bytes = get_total_bytes_allocated();
+    size_t result;
+    if (total_bytes < _mutator_bytes_at_last_sample) {
+      // This rare condition may occur if bytes allocated overflows (wraps around) size_t tally of allocations.
+      // This may also occur in the very rare situation that get_total_bytes_allocated() is queried in the middle of
+      // reset_bytes_allocated_since_gc_start().  Note that there is no lock to assure that the two global variables
+      // it modifies are modified atomically (_total_bytes_previously_allocated and _mutator_byts_allocated_since_gc_start)
+      // This has been observed to occur when an out-of-cycle degenerated cycle is starting (and thus calls
+      // reset_bytes_allocated_since_gc_start()) at the same time that the control (non-generational mode) or
+      // regulator (generational-mode) thread calls should_start_gc() (which invokes get_bytes_allocated_since_previous_sample()).
+      //
+      // Handle this rare situation by responding with the "innocent" value 0 and resetting internal state so that the
+      // the next query can recalibrate.
+      result = 0;
+    } else {
+      // Note: there's always the possibility that the tally of total allocations exceeds the 64-bit capacity of our size_t
+      // counter.  We assume that the difference between relevant samples does not exceed this count.  Example:
+      //   Suppose _mutator_words_at_last_sample is 0xffff_ffff_ffff_fff0 (18,446,744,073,709,551,600 Decimal)
+      //                        and _total_words is 0x0000_0000_0000_0800 (                    32,768 Decimal)
+      // Then, total_words - _mutator_words_at_last_sample can be done adding 1's complement of subtrahend:
+      //   1's complement of _mutator_words_at_last_sample is: 0x0000_0000_0000_0010 (    16 Decimal))
+      //                                     plus total_words: 0x0000_0000_0000_0800 (32,768 Decimal)
+      //                                                  sum: 0x0000_0000_0000_0810 (32,784 Decimal)
+      result = total_bytes - _mutator_bytes_at_last_sample;
+    }
+    _mutator_bytes_at_last_sample = total_bytes;
+    return result;
+  }
+
   // Public because ShenandoahRegionPartitions assertions require access.
   inline size_t alloc_capacity(ShenandoahHeapRegion *r) const;
   inline size_t alloc_capacity(size_t idx) const;
@@ -781,15 +824,15 @@ public:
   // Acquire heap lock and log status, assuming heap lock is not acquired by the caller.
   void log_status_under_lock();
 
-  // Note that capacity is the number of regions that had available memory at most recent rebuild.  It is not the
-  // entire size of the young or global generation.  (Regions within the generation that were fully utilized at time of
-  // rebuild are not counted as part of capacity.)
-
-  // All three of the following functions may produce stale data if called without owning the global heap lock.
+  // All four of the following functions may produce stale data if called without owning the global heap lock.
   // Changes to the values of these variables are performed with a lock.  A change to capacity or used "atomically"
   // adjusts available with respect to lock holders.  However, sequential calls to these three functions may produce
   // inconsistent data: available may not equal capacity - used because the intermediate states of any "atomic"
   // locked action can be seen by these unlocked functions.
+
+  // Note that capacity is the number of regions that had available memory at most recent rebuild.  It is not the
+  // entire size of the young or global generation.  (Regions within the generation that were fully utilized at time of
+  // rebuild are not counted as part of capacity.)
   inline size_t capacity_holding_lock() const {
     shenandoah_assert_heaplocked();
     return _partitions.capacity_of(ShenandoahFreeSetPartitionId::Mutator);
@@ -808,11 +851,14 @@ public:
     ShenandoahRebuildLocker locker(rebuild_lock());
     return _partitions.used_by(ShenandoahFreeSetPartitionId::Mutator);
   }
+  inline size_t reserved()  const { return _partitions.capacity_of(ShenandoahFreeSetPartitionId::Collector);           }
   inline size_t available() {
     shenandoah_assert_not_heaplocked();
     ShenandoahRebuildLocker locker(rebuild_lock());
     return _partitions.available_in_locked_for_rebuild(ShenandoahFreeSetPartitionId::Mutator);
   }
+  inline size_t available_holding_lock() const
+                                  { return _partitions.available_in(ShenandoahFreeSetPartitionId::Mutator); }
 
   // Use this version of available() if the heap lock is held.
   inline size_t available_locked() const {
@@ -880,13 +926,17 @@ public:
   //   first_old_region is the index of the first region that is part of the OldCollector set
   //    last_old_region is the index of the last region that is part of the OldCollector set
   //   old_region_count is the number of regions in the OldCollector set that have memory available to be allocated
-  void find_regions_with_alloc_capacity(size_t &young_cset_regions, size_t &old_cset_regions,
-                                        size_t &first_old_region, size_t &last_old_region, size_t &old_region_count);
+  //
+  // Returns allocatable memory within Mutator partition, in words.
+  size_t find_regions_with_alloc_capacity(size_t &young_cset_regions, size_t &old_cset_regions,
+                                          size_t &first_old_region, size_t &last_old_region, size_t &old_region_count);
 
   // Ensure that Collector has at least to_reserve bytes of available memory, and OldCollector has at least old_reserve
   // bytes of available memory.  On input, old_region_count holds the number of regions already present in the
   // OldCollector partition.  Upon return, old_region_count holds the updated number of regions in the OldCollector partition.
-  void reserve_regions(size_t to_reserve, size_t old_reserve, size_t &old_region_count,
+  //
+  // Returns allocatable memory within Mutator partition, in words.
+  size_t reserve_regions(size_t to_reserve, size_t old_reserve, size_t &old_region_count,
                        size_t &young_used_regions, size_t &old_used_regions, size_t &young_used_bytes, size_t &old_used_bytes);
 
   // Reserve space for evacuations, with regions reserved for old evacuations placed to the right
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahFullGC.cpp b/src/hotspot/share/gc/shenandoah/shenandoahFullGC.cpp
index 3c92750cc0c..750f7e9122d 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahFullGC.cpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahFullGC.cpp
@@ -252,6 +252,7 @@ void ShenandoahFullGC::do_it(GCCause::Cause gc_cause) {
 
     phase5_epilog();
   }
+  heap->start_idle_span();
 
   // Resize metaspace
   MetaspaceGC::compute_new_size();
@@ -1124,8 +1125,9 @@ void ShenandoahFullGC::phase5_epilog() {
       if (heap->mode()->is_generational()) {
         ShenandoahGenerationalFullGC::compute_balances();
       }
-      free_set->finish_rebuild(young_trashed_regions, old_trashed_regions, num_old);
+      heap->free_set()->finish_rebuild(young_trashed_regions, old_trashed_regions, num_old);
     }
+
     // Set mark incomplete because the marking bitmaps have been reset except pinned regions.
     _generation->set_mark_incomplete();
 
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahGeneration.cpp b/src/hotspot/share/gc/shenandoah/shenandoahGeneration.cpp
index ddb50ee0020..b2d5e5423dd 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahGeneration.cpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahGeneration.cpp
@@ -151,6 +151,10 @@ ShenandoahHeuristics* ShenandoahGeneration::initialize_heuristics(ShenandoahMode
   return _heuristics;
 }
 
+void ShenandoahGeneration::post_initialize_heuristics() {
+  _heuristics->post_initialize();
+}
+
 void ShenandoahGeneration::set_evacuation_reserve(size_t new_val) {
   shenandoah_assert_heaplocked();
   _evacuation_reserve = new_val;
@@ -358,8 +362,7 @@ void ShenandoahGeneration::cancel_marking() {
   set_concurrent_mark_in_progress(false);
 }
 
-ShenandoahGeneration::ShenandoahGeneration(ShenandoahGenerationType type,
-                                           uint max_workers) :
+ShenandoahGeneration::ShenandoahGeneration(ShenandoahGenerationType type, uint max_workers) :
   _type(type),
   _task_queues(new ShenandoahObjToScanQueueSet(max_workers)),
   _ref_processor(new ShenandoahReferenceProcessor(this, MAX2(max_workers, 1U))),
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahGeneration.hpp b/src/hotspot/share/gc/shenandoah/shenandoahGeneration.hpp
index 946f2b91520..1a549be8988 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahGeneration.hpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahGeneration.hpp
@@ -83,10 +83,10 @@ private:
   ShenandoahReferenceProcessor* ref_processor() { return _ref_processor; }
 
   virtual ShenandoahHeuristics* initialize_heuristics(ShenandoahMode* gc_mode);
+  virtual void post_initialize_heuristics();
 
   virtual void post_initialize(ShenandoahHeap* heap);
 
-  virtual size_t bytes_allocated_since_gc_start() const override = 0;
   virtual size_t used() const override = 0;
   virtual size_t used_regions() const = 0;
   virtual size_t used_regions_size() const = 0;
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahGenerationalControlThread.cpp b/src/hotspot/share/gc/shenandoah/shenandoahGenerationalControlThread.cpp
index 3b57190cc75..cc7547b8ac1 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahGenerationalControlThread.cpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahGenerationalControlThread.cpp
@@ -622,10 +622,11 @@ void ShenandoahGenerationalControlThread::service_stw_full_cycle(GCCause::Cause
 
 void ShenandoahGenerationalControlThread::service_stw_degenerated_cycle(const ShenandoahGCRequest& request) {
   assert(_degen_point != ShenandoahGC::_degenerated_unset, "Degenerated point should be set");
+  request.generation->heuristics()->record_degenerated_cycle_start(ShenandoahGC::ShenandoahDegenPoint::_degenerated_outside_cycle
+                                                                  == _degen_point);
   _heap->increment_total_collections(false);
 
   ShenandoahGCSession session(request.cause, request.generation);
-
   ShenandoahDegenGC gc(_degen_point, request.generation);
   gc.collect(request.cause);
   _degen_point = ShenandoahGC::_degenerated_unset;
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahGenerationalHeap.cpp b/src/hotspot/share/gc/shenandoah/shenandoahGenerationalHeap.cpp
index 2c2e5533c01..b302bde8510 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahGenerationalHeap.cpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahGenerationalHeap.cpp
@@ -90,11 +90,23 @@ ShenandoahGenerationalHeap::ShenandoahGenerationalHeap(ShenandoahCollectorPolicy
   assert(is_aligned(_max_plab_size, CardTable::card_size_in_words()), "max_plab_size must be aligned");
 }
 
+void ShenandoahGenerationalHeap::initialize_generations() {
+  ShenandoahHeap::initialize_generations();
+  _young_generation->post_initialize(this);
+  _old_generation->post_initialize(this);
+}
+
 void ShenandoahGenerationalHeap::post_initialize() {
   ShenandoahHeap::post_initialize();
   _age_census = new ShenandoahAgeCensus();
 }
 
+void ShenandoahGenerationalHeap::post_initialize_heuristics() {
+  ShenandoahHeap::post_initialize_heuristics();
+  _young_generation->post_initialize_heuristics();
+  _old_generation->post_initialize_heuristics();
+}
+
 void ShenandoahGenerationalHeap::print_init_logger() const {
   ShenandoahGenerationalInitLogger logger;
   logger.print_all();
@@ -110,12 +122,6 @@ void ShenandoahGenerationalHeap::initialize_heuristics() {
   _old_generation->initialize_heuristics(mode());
 }
 
-void ShenandoahGenerationalHeap::post_initialize_heuristics() {
-  ShenandoahHeap::post_initialize_heuristics();
-  _young_generation->post_initialize(this);
-  _old_generation->post_initialize(this);
-}
-
 void ShenandoahGenerationalHeap::initialize_serviceability() {
   assert(mode()->is_generational(), "Only for the generational mode");
   _young_gen_memory_pool = new ShenandoahYoungGenMemoryPool(this);
@@ -152,6 +158,10 @@ void ShenandoahGenerationalHeap::stop() {
   regulator_thread()->stop();
 }
 
+void ShenandoahGenerationalHeap::start_idle_span() {
+  young_generation()->heuristics()->start_idle_span();
+}
+
 bool ShenandoahGenerationalHeap::requires_barriers(stackChunkOop obj) const {
   if (is_idle()) {
     return false;
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahGenerationalHeap.hpp b/src/hotspot/share/gc/shenandoah/shenandoahGenerationalHeap.hpp
index 719bae52a83..7fe0362aa3f 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahGenerationalHeap.hpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahGenerationalHeap.hpp
@@ -40,6 +40,7 @@ class ShenandoahGenerationalHeap : public ShenandoahHeap {
 public:
   explicit ShenandoahGenerationalHeap(ShenandoahCollectorPolicy* policy);
   void post_initialize() override;
+  void initialize_generations() override;
   void initialize_heuristics() override;
   void post_initialize_heuristics() override;
 
@@ -82,6 +83,8 @@ public:
 
   inline bool is_tenurable(const ShenandoahHeapRegion* r) const;
 
+  void start_idle_span() override;
+
   // Ages regions that haven't been used for allocations in the current cycle.
   // Resets ages for regions that have been used for allocations.
   void update_region_ages(ShenandoahMarkingContext* ctx);
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahHeap.cpp b/src/hotspot/share/gc/shenandoah/shenandoahHeap.cpp
index d78bdae6a51..c6889351161 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahHeap.cpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahHeap.cpp
@@ -435,7 +435,7 @@ jint ShenandoahHeap::initialize() {
     }
 
     _free_set = new ShenandoahFreeSet(this, _num_regions);
-    post_initialize_heuristics();
+    initialize_generations();
 
     // We are initializing free set.  We ignore cset region tallies.
     size_t young_trashed_regions, old_trashed_regions, first_old, last_old, num_old;
@@ -492,16 +492,17 @@ jint ShenandoahHeap::initialize() {
   _phase_timings = new ShenandoahPhaseTimings(max_workers());
   ShenandoahCodeRoots::initialize();
 
+  // Initialization of controller makes use of variables established by initialize_heuristics.
   initialize_controller();
 
+  // Certain initialization of heuristics must be deferred until after controller is initialized.
+  post_initialize_heuristics();
+  start_idle_span();
   if (ShenandoahUncommit) {
     _uncommit_thread = new ShenandoahUncommitThread(this);
   }
-
   print_init_logger();
-
   FullGCForwarding::initialize(_heap_region);
-
   return JNI_OK;
 }
 
@@ -545,10 +546,6 @@ void ShenandoahHeap::initialize_heuristics() {
   _global_generation->initialize_heuristics(mode());
 }
 
-void ShenandoahHeap::post_initialize_heuristics() {
-  _global_generation->post_initialize(this);
-}
-
 #ifdef _MSC_VER
 #pragma warning( push )
 #pragma warning( disable:4355 ) // 'this' : used in base member initializer list
@@ -690,6 +687,11 @@ public:
   }
 };
 
+void ShenandoahHeap::initialize_generations() {
+  _global_generation->post_initialize(this);
+}
+
+// We do not call this explicitly  It is called by Hotspot infrastructure.
 void ShenandoahHeap::post_initialize() {
   CollectedHeap::post_initialize();
 
@@ -717,6 +719,10 @@ void ShenandoahHeap::post_initialize() {
   JFR_ONLY(ShenandoahJFRSupport::register_jfr_type_serializers();)
 }
 
+void ShenandoahHeap::post_initialize_heuristics() {
+  _global_generation->post_initialize_heuristics();
+}
+
 ShenandoahHeuristics* ShenandoahHeap::heuristics() {
   return _global_generation->heuristics();
 }
@@ -760,6 +766,7 @@ void ShenandoahHeap::set_soft_max_capacity(size_t v) {
          "Should be in bounds: %zu <= %zu <= %zu",
          min_capacity(), v, max_capacity());
   _soft_max_size.store_relaxed(v);
+  heuristics()->compute_headroom_adjustment();
 }
 
 size_t ShenandoahHeap::min_capacity() const {
@@ -835,6 +842,10 @@ void ShenandoahHeap::notify_heap_changed() {
   _heap_changed.try_set();
 }
 
+void ShenandoahHeap::start_idle_span() {
+  heuristics()->start_idle_span();
+}
+
 void ShenandoahHeap::set_forced_counters_update(bool value) {
   monitoring_support()->set_forced_counters_update(value);
 }
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahHeap.hpp b/src/hotspot/share/gc/shenandoah/shenandoahHeap.hpp
index 85ad339469d..d4604be0aec 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahHeap.hpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahHeap.hpp
@@ -195,6 +195,7 @@ public:
   ShenandoahHeap(ShenandoahCollectorPolicy* policy);
   jint initialize() override;
   void post_initialize() override;
+  virtual void initialize_generations();
   void initialize_mode();
   virtual void initialize_heuristics();
   virtual void post_initialize_heuristics();
@@ -393,6 +394,8 @@ public:
     return _heap_changed.try_unset();
   }
 
+  virtual void start_idle_span();
+
   void set_concurrent_young_mark_in_progress(bool in_progress);
   void set_concurrent_old_mark_in_progress(bool in_progress);
   void set_evacuation_in_progress(bool in_progress);
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahOldGeneration.cpp b/src/hotspot/share/gc/shenandoah/shenandoahOldGeneration.cpp
index 4fda65b4030..1b12909bcaf 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahOldGeneration.cpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahOldGeneration.cpp
@@ -422,6 +422,7 @@ void ShenandoahOldGeneration::prepare_regions_and_collection_set(bool concurrent
     // At the end of old-gen, we may find that we have reclaimed immediate garbage, allowing a longer allocation runway.
     // We may also find that we have accumulated canddiate regions for mixed evacuation.  If so, we will want to expand
     // the OldCollector reserve in order to make room for these mixed evacuations.
+
     assert(ShenandoahHeap::heap()->mode()->is_generational(), "sanity");
     assert(young_trash_regions == 0, "sanity");
     ShenandoahGenerationalHeap* gen_heap = ShenandoahGenerationalHeap::heap();
@@ -765,6 +766,7 @@ size_t ShenandoahOldGeneration::used_regions_size() const {
   return used_regions * ShenandoahHeapRegion::region_size_bytes();
 }
 
+// For the old generation, max_capacity() equals soft_max_capacity()
 size_t ShenandoahOldGeneration::max_capacity() const {
   size_t total_regions = _free_set->total_old_regions();
   return total_regions * ShenandoahHeapRegion::region_size_bytes();
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahRegulatorThread.cpp b/src/hotspot/share/gc/shenandoah/shenandoahRegulatorThread.cpp
index ec4b7c7217c..fe92a3a3e08 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahRegulatorThread.cpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahRegulatorThread.cpp
@@ -36,7 +36,8 @@ ShenandoahRegulatorThread::ShenandoahRegulatorThread(ShenandoahGenerationalContr
   _heap(ShenandoahHeap::heap()),
   _control_thread(control_thread),
   _sleep(ShenandoahControlIntervalMin),
-  _last_sleep_adjust_time(os::elapsedTime()) {
+  _most_recent_wake_time(os::elapsedTime()),
+  _last_sleep_adjust_time(_most_recent_wake_time) {
   shenandoah_assert_generational();
   _old_heuristics = _heap->old_generation()->heuristics();
   _young_heuristics = _heap->young_generation()->heuristics();
@@ -115,19 +116,22 @@ void ShenandoahRegulatorThread::regulator_sleep() {
   // Wait before performing the next action. If allocation happened during this wait,
   // we exit sooner, to let heuristics re-evaluate new conditions. If we are at idle,
   // back off exponentially.
-  double current = os::elapsedTime();
-
+  double before_sleep_time = _most_recent_wake_time;
   if (ShenandoahHeap::heap()->has_changed()) {
     _sleep = ShenandoahControlIntervalMin;
-  } else if ((current - _last_sleep_adjust_time) * 1000 > ShenandoahControlIntervalAdjustPeriod){
+  } else if ((before_sleep_time - _last_sleep_adjust_time) * 1000 > ShenandoahControlIntervalAdjustPeriod){
     _sleep = MIN2<uint>(ShenandoahControlIntervalMax, MAX2(1u, _sleep * 2));
-    _last_sleep_adjust_time = current;
+    _last_sleep_adjust_time = before_sleep_time;
   }
 
   SuspendibleThreadSetLeaver leaver;
   os::naked_short_sleep(_sleep);
+  double wake_time = os::elapsedTime();
+  _most_recent_period = wake_time - _most_recent_wake_time;
+  _most_recent_wake_time = wake_time;
+  _young_heuristics->update_should_start_query_times(_most_recent_wake_time, double(_sleep) / 1000.0);
   if (LogTarget(Debug, gc, thread)::is_enabled()) {
-    double elapsed = os::elapsedTime() - current;
+    double elapsed = _most_recent_wake_time - before_sleep_time;
     double hiccup = elapsed - double(_sleep);
     if (hiccup > 0.001) {
       log_debug(gc, thread)("Regulator hiccup time: %.3fs", hiccup);
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahRegulatorThread.hpp b/src/hotspot/share/gc/shenandoah/shenandoahRegulatorThread.hpp
index 2519025b6fb..cc41bc2c65b 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahRegulatorThread.hpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahRegulatorThread.hpp
@@ -79,7 +79,10 @@ class ShenandoahRegulatorThread: public ConcurrentGCThread {
   ShenandoahOldHeuristics* _old_heuristics;
   ShenandoahHeuristics* _global_heuristics;
 
+  // duration of planned regulator sleep period, in ms
   uint _sleep;
+  double _most_recent_wake_time;
+  double _most_recent_period;
   double _last_sleep_adjust_time;
 };
 
diff --git a/src/hotspot/share/gc/shenandoah/shenandoah_globals.hpp b/src/hotspot/share/gc/shenandoah/shenandoah_globals.hpp
index 3eb1a06a911..d3e9a1f9fae 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoah_globals.hpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoah_globals.hpp
@@ -34,6 +34,59 @@
                             range,                                          \
                             constraint)                                     \
                                                                             \
+  product(uint, ShenandoahAccelerationSamplePeriod, 15, EXPERIMENTAL,       \
+          "When at least this much time (measured in ms) has passed "       \
+          "since the acceleration allocation rate was most recently "       \
+          "sampled, capture another allocation rate sample for the purpose "\
+          "of detecting acceleration or momentary spikes in allocation "    \
+          "rate. A smaller value allows quicker response to changes in "    \
+          "allocation rates but is more vulnerable to noise and requires "  \
+          "more monitoring effort.")                                        \
+          range(1, 1000)                                                    \
+                                                                            \
+  product(uint, ShenandoahRateAccelerationSampleSize, 8, EXPERIMENTAL,      \
+          "In selected ShenandoahControlIntervals "                         \
+          "(if ShenandoahAccelerationSamplePeriod ms have passed "          \
+          "since previous allocation rate sample), "                        \
+          "we compute the allocation rate since the previous rate was "     \
+          "sampled.  This many samples are analyzed to determine whether "  \
+          "allocation rates are accelerating.  Acceleration may occur "     \
+          "due to increasing client demand or due to phase changes in "     \
+          "an application.  A larger value reduces sensitivity to "         \
+          "noise and delays recognition of the accelerating trend.  A "     \
+          "larger value may also cause the heuristic to miss detection "    \
+          "of very quick accelerations.  Smaller values may cause random "  \
+          "noise to be perceived as acceleration of allocation rate, "      \
+          "triggering excess collections.  Note that the acceleration "     \
+          "need not last the entire span of the sampled duration to be "    \
+          "detected.  If the last several of all samples are signficantly " \
+          "larger than the other samples, the best fit line through all "   \
+          "sampled values will have an upward slope, manifesting as "       \
+          "acceleration.")                                                  \
+          range(1,64)                                                       \
+                                                                            \
+  product(uint, ShenandoahMomentaryAllocationRateSpikeSampleSize,           \
+          2, EXPERIMENTAL,                                                  \
+          "In selected ShenandoahControlIntervals "                         \
+          "(if ShenandoahAccelerationSamplePeriod ms have passed "          \
+          "since previous allocation rate sample), we compute "             \
+          "the allocation rate since the previous rate was sampled. "       \
+          "The weighted average of this "                                   \
+          "many most recent momentary allocation rate samples is compared " \
+          "against current allocation runway and anticipated GC time to "   \
+          "determine whether a spike in momentary allocation rate "         \
+          "justifies an early GC trigger.  Momentary allocation spike "     \
+          "detection is in addition to previously implemented "             \
+          "ShenandoahAdaptiveInitialSpikeThreshold, the latter of which "   \
+          "is more effective at detecting slower spikes.  The latter "      \
+          "spike detection samples at the rate specifieid by "              \
+          "ShenandoahAdaptiveSampleFrequencyHz.  The value of this "        \
+          "parameter must be less than the value of "                       \
+          "ShenandoahRateAccelerationSampleSize.  A larger value makes "    \
+          "momentary spike detection less sensitive.  A smaller value "     \
+          "may result in excessive GC triggers.")                           \
+          range(1,64)                                                       \
+                                                                            \
   product(uintx, ShenandoahGenerationalMinPIPUsage, 30, EXPERIMENTAL,       \
           "(Generational mode only) What percent of a heap region "         \
           "should be used before we consider promoting a region in "        \

From 297812eec1ad5c9f48822ace2bd720fd02c6b263 Mon Sep 17 00:00:00 2001
From: Alexey Semenyuk <asemenyuk@openjdk.org>
Date: Tue, 3 Mar 2026 09:54:54 +0000
Subject: [PATCH 005/655] 8378867: jpackage references non-existing
 "message.app-image-requires-identifier" l10n key

Reviewed-by: almatvee
---
 .../internal/MacApplicationBuilder.java       |  9 +++---
 .../resources/MacResources.properties         |  2 ++
 .../cli/OptionsValidationFailTest.excludes    |  1 +
 test/jdk/tools/jpackage/share/ErrorTest.java  | 31 ++++++++++++++++++-
 4 files changed, 37 insertions(+), 6 deletions(-)

diff --git a/src/jdk.jpackage/macosx/classes/jdk/jpackage/internal/MacApplicationBuilder.java b/src/jdk.jpackage/macosx/classes/jdk/jpackage/internal/MacApplicationBuilder.java
index a73a6152f6d..43590fb5e2c 100644
--- a/src/jdk.jpackage/macosx/classes/jdk/jpackage/internal/MacApplicationBuilder.java
+++ b/src/jdk.jpackage/macosx/classes/jdk/jpackage/internal/MacApplicationBuilder.java
@@ -32,7 +32,6 @@ import java.util.Objects;
 import java.util.Optional;
 import java.util.Set;
 import java.util.stream.Collectors;
-import jdk.jpackage.internal.util.RootedPath;
 import java.util.stream.Stream;
 import jdk.jpackage.internal.model.AppImageLayout;
 import jdk.jpackage.internal.model.AppImageSigningConfig;
@@ -40,6 +39,8 @@ import jdk.jpackage.internal.model.Application;
 import jdk.jpackage.internal.model.Launcher;
 import jdk.jpackage.internal.model.MacApplication;
 import jdk.jpackage.internal.model.MacApplicationMixin;
+import jdk.jpackage.internal.model.JPackageException;
+import jdk.jpackage.internal.util.RootedPath;
 
 final class MacApplicationBuilder {
 
@@ -183,10 +184,8 @@ final class MacApplicationBuilder {
         } catch (IOException ex) {
             throw new UncheckedIOException(ex);
         } catch (Exception ex) {
-            throw I18N.buildConfigException("message.app-image-requires-identifier")
-                    .advice("message.app-image-requires-identifier.advice")
-                    .cause(ex)
-                    .create();
+            throw new JPackageException(
+                    I18N.format("error.invalid-app-image-plist-file", externalInfoPlistFile), ex);
         }
     }
 
diff --git a/src/jdk.jpackage/macosx/classes/jdk/jpackage/internal/resources/MacResources.properties b/src/jdk.jpackage/macosx/classes/jdk/jpackage/internal/resources/MacResources.properties
index e43cadc5782..3aebdc39d41 100644
--- a/src/jdk.jpackage/macosx/classes/jdk/jpackage/internal/resources/MacResources.properties
+++ b/src/jdk.jpackage/macosx/classes/jdk/jpackage/internal/resources/MacResources.properties
@@ -31,6 +31,8 @@ error.app-image.mac-sign.required=--mac-sign option is required with predefined
 error.invalid-runtime-image-missing-file=Runtime image "{0}" is missing "{1}" file
 error.invalid-runtime-image-bin-dir=Runtime image "{0}" should not contain "bin" folder
 error.invalid-runtime-image-bin-dir.advice=Use --strip-native-commands jlink option when generating runtime image used with {0} option
+error.invalid-app-image-plist-file=Invalid "{0}" file in the predefined application image
+
 resource.app-info-plist=Application Info.plist
 resource.app-runtime-info-plist=Embedded Java Runtime Info.plist
 resource.runtime-info-plist=Java Runtime Info.plist
diff --git a/test/jdk/tools/jpackage/junit/share/jdk.jpackage/jdk/jpackage/internal/cli/OptionsValidationFailTest.excludes b/test/jdk/tools/jpackage/junit/share/jdk.jpackage/jdk/jpackage/internal/cli/OptionsValidationFailTest.excludes
index 0b98c051238..f86fb9a3897 100644
--- a/test/jdk/tools/jpackage/junit/share/jdk.jpackage/jdk/jpackage/internal/cli/OptionsValidationFailTest.excludes
+++ b/test/jdk/tools/jpackage/junit/share/jdk.jpackage/jdk/jpackage/internal/cli/OptionsValidationFailTest.excludes
@@ -23,6 +23,7 @@ ErrorTest.test(NATIVE; app-desc=Hello; args-add=[--mac-app-store, --runtime-imag
 ErrorTest.test(NATIVE; app-desc=Hello; args-add=[--runtime-image, @@EMPTY_DIR@@]; errors=[message.error-header+[error.invalid-runtime-image-missing-file, @@EMPTY_DIR@@, lib/**/libjli.dylib]])
 ErrorTest.test(NATIVE; app-desc=Hello; args-add=[--runtime-image, @@INVALID_MAC_RUNTIME_BUNDLE@@]; errors=[message.error-header+[error.invalid-runtime-image-missing-file, @@INVALID_MAC_RUNTIME_BUNDLE@@, Contents/Home/lib/**/libjli.dylib]])
 ErrorTest.test(NATIVE; app-desc=Hello; args-add=[--runtime-image, @@INVALID_MAC_RUNTIME_IMAGE@@]; errors=[message.error-header+[error.invalid-runtime-image-missing-file, @@INVALID_MAC_RUNTIME_IMAGE@@, lib/**/libjli.dylib]])
+ErrorTest.test(NATIVE; args-add=[--app-image, @@MAC_APP_IMAGE_INVALID_INFO_PLIST@@]; errors=[message.error-header+[error.invalid-app-image-plist-file, @@MAC_APP_IMAGE_INVALID_INFO_PLIST@@]])
 ErrorTest.test(NATIVE; args-add=[--runtime-image, @@EMPTY_DIR@@]; errors=[message.error-header+[error.invalid-runtime-image-missing-file, @@EMPTY_DIR@@, lib/**/libjli.dylib]])
 ErrorTest.test(NATIVE; args-add=[--runtime-image, @@INVALID_MAC_RUNTIME_BUNDLE@@]; errors=[message.error-header+[error.invalid-runtime-image-missing-file, @@INVALID_MAC_RUNTIME_BUNDLE@@, Contents/Home/lib/**/libjli.dylib]])
 ErrorTest.test(NATIVE; args-add=[--runtime-image, @@INVALID_MAC_RUNTIME_IMAGE@@]; errors=[message.error-header+[error.invalid-runtime-image-missing-file, @@INVALID_MAC_RUNTIME_IMAGE@@, lib/**/libjli.dylib]])
diff --git a/test/jdk/tools/jpackage/share/ErrorTest.java b/test/jdk/tools/jpackage/share/ErrorTest.java
index 2133823381c..8bc7ba2521f 100644
--- a/test/jdk/tools/jpackage/share/ErrorTest.java
+++ b/test/jdk/tools/jpackage/share/ErrorTest.java
@@ -26,6 +26,11 @@ import static java.util.stream.Collectors.toMap;
 import static jdk.internal.util.OperatingSystem.LINUX;
 import static jdk.internal.util.OperatingSystem.MACOS;
 import static jdk.internal.util.OperatingSystem.WINDOWS;
+import static jdk.jpackage.internal.util.PListWriter.writeDict;
+import static jdk.jpackage.internal.util.PListWriter.writePList;
+import static jdk.jpackage.internal.util.XmlUtils.createXml;
+import static jdk.jpackage.internal.util.XmlUtils.toXmlConsumer;
+import static jdk.jpackage.internal.util.function.ThrowingFunction.toFunction;
 import static jdk.jpackage.internal.util.function.ThrowingSupplier.toSupplier;
 import static jdk.jpackage.test.JPackageCommand.makeAdvice;
 import static jdk.jpackage.test.JPackageCommand.makeError;
@@ -46,6 +51,7 @@ import java.util.regex.Pattern;
 import java.util.stream.IntStream;
 import java.util.stream.Stream;
 import jdk.internal.util.OperatingSystem;
+import jdk.jpackage.internal.util.MacBundle;
 import jdk.jpackage.internal.util.TokenReplace;
 import jdk.jpackage.test.Annotations.Parameter;
 import jdk.jpackage.test.Annotations.ParameterSupplier;
@@ -54,6 +60,7 @@ import jdk.jpackage.test.CannedArgument;
 import jdk.jpackage.test.CannedFormattedString;
 import jdk.jpackage.test.JPackageCommand;
 import jdk.jpackage.test.JPackageOutputValidator;
+import jdk.jpackage.test.JavaTool;
 import jdk.jpackage.test.MacSign;
 import jdk.jpackage.test.MacSign.CertificateRequest;
 import jdk.jpackage.test.MacSign.CertificateType;
@@ -105,6 +112,11 @@ public final class ErrorTest {
             final var appImageRoot = TKit.createTempDirectory("appimage");
 
             final var appImageCmd = JPackageCommand.helloAppImage()
+                    // Use the default jpackage tool provider to create an application image.
+                    // The ErrorTest is used from the OptionsValidationFailTest unit tests that override
+                    // the default jpackage tool provider with the implementation that doesn't do packaging
+                    // and can not create a valid application image.
+                    .useToolProvider(JavaTool.JPACKAGE.asToolProvider())
                     .setFakeRuntime().setArgumentValue("--dest", appImageRoot);
 
             appImageCmd.execute();
@@ -124,6 +136,19 @@ public final class ErrorTest {
 
             return appImageCmd.outputBundle();
         }),
+        MAC_APP_IMAGE_INVALID_INFO_PLIST(toFunction(cmd -> {
+            var appImageDir = (Path)APP_IMAGE.expand(cmd).orElseThrow();
+            // Replace the default Info.plist file with an empty one.
+            var plistFile = new MacBundle(appImageDir).infoPlistFile();
+            TKit.trace(String.format("Create invalid plist file in [%s]", plistFile));
+            createXml(plistFile, xml -> {
+                writePList(xml, toXmlConsumer(() -> {
+                    writeDict(xml, toXmlConsumer(() -> {
+                    }));
+                }));
+            });
+            return appImageDir;
+        })),
         INVALID_MAC_RUNTIME_BUNDLE(toSupplier(() -> {
             // Has "Contents/MacOS/libjli.dylib", but missing "Contents/Home/lib/libjli.dylib".
             final Path root = TKit.createTempDirectory("mac-invalid-runtime-bundle");
@@ -963,7 +988,11 @@ public final class ErrorTest {
                 testSpec().noAppDesc().nativeType().addArgs("--app-image", Token.EMPTY_DIR.token())
                         .error("error.parameter-not-mac-bundle", JPackageCommand.cannedArgument(cmd -> {
                             return Path.of(cmd.getArgumentValue("--app-image"));
-                        }, Token.EMPTY_DIR.token()), "--app-image")
+                        }, Token.EMPTY_DIR.token()), "--app-image"),
+                testSpec().nativeType().noAppDesc().addArgs("--app-image", Token.MAC_APP_IMAGE_INVALID_INFO_PLIST.token())
+                        .error("error.invalid-app-image-plist-file", JPackageCommand.cannedArgument(cmd -> {
+                            return new MacBundle(Path.of(cmd.getArgumentValue("--app-image"))).infoPlistFile();
+                        }, Token.MAC_APP_IMAGE_INVALID_INFO_PLIST.token()))
         ).map(TestSpec.Builder::create).toList());
 
         macInvalidRuntime(testCases::add);

From 57db48cc21d47475caf2d1fae6bf37eab8d7521e Mon Sep 17 00:00:00 2001
From: Jayathirth D V <jdv@openjdk.org>
Date: Tue, 3 Mar 2026 10:01:00 +0000
Subject: [PATCH 006/655] 8373290: Update FreeType to 2.14.1

Reviewed-by: azvegint, serb, prr
---
 src/java.desktop/share/legal/freetype.md      |   40 +-
 .../include/freetype/config/ftconfig.h        |    2 +-
 .../include/freetype/config/ftheader.h        |    2 +-
 .../include/freetype/config/ftoption.h        |   49 +-
 .../include/freetype/config/ftstdlib.h        |    2 +-
 .../include/freetype/config/integer-types.h   |   31 +-
 .../include/freetype/config/mac-support.h     |    2 +-
 .../include/freetype/config/public-macros.h   |    6 +-
 .../libfreetype/include/freetype/freetype.h   |   98 +-
 .../libfreetype/include/freetype/ftadvanc.h   |    2 +-
 .../libfreetype/include/freetype/ftbbox.h     |    2 +-
 .../libfreetype/include/freetype/ftbdf.h      |    2 +-
 .../libfreetype/include/freetype/ftbitmap.h   |    2 +-
 .../libfreetype/include/freetype/ftcid.h      |    2 +-
 .../libfreetype/include/freetype/ftcolor.h    |   17 +-
 .../libfreetype/include/freetype/ftdriver.h   |    6 +-
 .../libfreetype/include/freetype/fterrdef.h   |    2 +-
 .../libfreetype/include/freetype/fterrors.h   |    2 +-
 .../libfreetype/include/freetype/ftfntfmt.h   |    2 +-
 .../libfreetype/include/freetype/ftgasp.h     |    2 +-
 .../libfreetype/include/freetype/ftglyph.h    |    2 +-
 .../libfreetype/include/freetype/ftgzip.h     |    2 +-
 .../libfreetype/include/freetype/ftimage.h    |    8 +-
 .../libfreetype/include/freetype/ftincrem.h   |    2 +-
 .../libfreetype/include/freetype/ftlcdfil.h   |    2 +-
 .../libfreetype/include/freetype/ftlist.h     |    2 +-
 .../libfreetype/include/freetype/ftlogging.h  |    2 +-
 .../libfreetype/include/freetype/ftmac.h      |    2 +-
 .../libfreetype/include/freetype/ftmm.h       |  256 ++-
 .../libfreetype/include/freetype/ftmodapi.h   |    2 +-
 .../libfreetype/include/freetype/ftmoderr.h   |    2 +-
 .../libfreetype/include/freetype/ftoutln.h    |    2 +-
 .../libfreetype/include/freetype/ftparams.h   |    2 +-
 .../libfreetype/include/freetype/ftrender.h   |    2 +-
 .../libfreetype/include/freetype/ftsizes.h    |    2 +-
 .../libfreetype/include/freetype/ftsnames.h   |    2 +-
 .../libfreetype/include/freetype/ftstroke.h   |    2 +-
 .../libfreetype/include/freetype/ftsynth.h    |    2 +-
 .../libfreetype/include/freetype/ftsystem.h   |    2 +-
 .../libfreetype/include/freetype/fttrigon.h   |    2 +-
 .../libfreetype/include/freetype/fttypes.h    |    2 +-
 .../include/freetype/internal/autohint.h      |    2 +-
 .../include/freetype/internal/cffotypes.h     |    2 +-
 .../include/freetype/internal/cfftypes.h      |    2 +-
 .../freetype/internal/compiler-macros.h       |    6 +-
 .../include/freetype/internal/ftcalc.h        |  300 +--
 .../include/freetype/internal/ftdebug.h       |    2 +-
 .../include/freetype/internal/ftdrv.h         |    2 +-
 .../include/freetype/internal/ftgloadr.h      |    2 +-
 .../include/freetype/internal/fthash.h        |   23 +
 .../include/freetype/internal/ftmemory.h      |    2 +-
 .../include/freetype/internal/ftmmtypes.h     |    2 +-
 .../include/freetype/internal/ftobjs.h        |   30 +-
 .../include/freetype/internal/ftpsprop.h      |    2 +-
 .../include/freetype/internal/ftrfork.h       |    2 +-
 .../include/freetype/internal/ftserv.h        |    2 +-
 .../include/freetype/internal/ftstream.h      |    2 +-
 .../include/freetype/internal/fttrace.h       |    5 +-
 .../include/freetype/internal/ftvalid.h       |    2 +-
 .../include/freetype/internal/psaux.h         |    2 +-
 .../include/freetype/internal/pshints.h       |    2 +-
 .../freetype/internal/services/svbdf.h        |    2 +-
 .../freetype/internal/services/svcfftl.h      |    2 +-
 .../freetype/internal/services/svcid.h        |    2 +-
 .../freetype/internal/services/svfntfmt.h     |    2 +-
 .../freetype/internal/services/svgldict.h     |    2 +-
 .../freetype/internal/services/svgxval.h      |    2 +-
 .../freetype/internal/services/svkern.h       |    2 +-
 .../freetype/internal/services/svmetric.h     |    4 +-
 .../include/freetype/internal/services/svmm.h |    2 +-
 .../freetype/internal/services/svotval.h      |    2 +-
 .../freetype/internal/services/svpfr.h        |    2 +-
 .../freetype/internal/services/svpostnm.h     |    2 +-
 .../freetype/internal/services/svprop.h       |    2 +-
 .../freetype/internal/services/svpscmap.h     |    2 +-
 .../freetype/internal/services/svpsinfo.h     |    2 +-
 .../freetype/internal/services/svsfnt.h       |    2 +-
 .../freetype/internal/services/svttcmap.h     |    2 +-
 .../freetype/internal/services/svtteng.h      |    2 +-
 .../freetype/internal/services/svttglyf.h     |    2 +-
 .../freetype/internal/services/svwinfnt.h     |    2 +-
 .../include/freetype/internal/sfnt.h          |    8 +-
 .../include/freetype/internal/svginterface.h  |    2 +-
 .../include/freetype/internal/t1types.h       |    2 +-
 .../include/freetype/internal/tttypes.h       |   41 +-
 .../include/freetype/internal/wofftypes.h     |    2 +-
 .../libfreetype/include/freetype/otsvg.h      |    2 +-
 .../libfreetype/include/freetype/t1tables.h   |    2 +-
 .../libfreetype/include/freetype/ttnameid.h   |  258 +--
 .../libfreetype/include/freetype/tttables.h   |   13 +-
 .../libfreetype/include/freetype/tttags.h     |    2 +-
 .../native/libfreetype/include/ft2build.h     |    2 +-
 .../native/libfreetype/src/autofit/afadjust.c | 1612 +++++++++++++++++
 .../native/libfreetype/src/autofit/afadjust.h |  130 ++
 .../native/libfreetype/src/autofit/afblue.c   |  194 +-
 .../native/libfreetype/src/autofit/afblue.cin |    2 +-
 .../native/libfreetype/src/autofit/afblue.dat |  194 +-
 .../native/libfreetype/src/autofit/afblue.h   |   11 +-
 .../native/libfreetype/src/autofit/afblue.hin |   11 +-
 .../native/libfreetype/src/autofit/afcjk.c    |   49 +-
 .../native/libfreetype/src/autofit/afcjk.h    |    2 +-
 .../native/libfreetype/src/autofit/afcover.h  |    2 +-
 .../native/libfreetype/src/autofit/afdummy.c  |    2 +-
 .../native/libfreetype/src/autofit/afdummy.h  |    2 +-
 .../native/libfreetype/src/autofit/aferrors.h |    2 +-
 .../native/libfreetype/src/autofit/afglobal.c |   40 +-
 .../native/libfreetype/src/autofit/afglobal.h |   15 +-
 .../native/libfreetype/src/autofit/afhints.c  |   23 +-
 .../native/libfreetype/src/autofit/afhints.h  |   19 +-
 .../native/libfreetype/src/autofit/afindic.c  |    2 +-
 .../native/libfreetype/src/autofit/afindic.h  |    2 +-
 .../native/libfreetype/src/autofit/aflatin.c  | 1555 +++++++++++++++-
 .../native/libfreetype/src/autofit/aflatin.h  |   25 +-
 .../native/libfreetype/src/autofit/afloader.c |    2 +-
 .../native/libfreetype/src/autofit/afloader.h |    2 +-
 .../native/libfreetype/src/autofit/afmodule.c |   14 +-
 .../native/libfreetype/src/autofit/afmodule.h |    8 +-
 .../native/libfreetype/src/autofit/afranges.c |   63 +-
 .../native/libfreetype/src/autofit/afranges.h |    2 +-
 .../native/libfreetype/src/autofit/afscript.h |    2 +-
 .../native/libfreetype/src/autofit/afshaper.c |  340 ++--
 .../native/libfreetype/src/autofit/afshaper.h |   19 +-
 .../native/libfreetype/src/autofit/afstyles.h |   58 +-
 .../native/libfreetype/src/autofit/aftypes.h  |    6 +-
 .../libfreetype/src/autofit/afws-decl.h       |    2 +-
 .../libfreetype/src/autofit/afws-iter.h       |    2 +-
 .../native/libfreetype/src/autofit/ft-hb.c    |  197 ++
 .../native/libfreetype/src/autofit/ft-hb.h    |   82 +
 .../native/libfreetype/src/base/ftadvanc.c    |    2 +-
 .../native/libfreetype/src/base/ftbase.h      |    4 +-
 .../native/libfreetype/src/base/ftbbox.c      |    2 +-
 .../native/libfreetype/src/base/ftbitmap.c    |   12 +-
 .../native/libfreetype/src/base/ftcalc.c      |  146 +-
 .../share/native/libfreetype/src/base/ftcid.c |    2 +-
 .../native/libfreetype/src/base/ftcolor.c     |   21 +-
 .../native/libfreetype/src/base/ftdbgmem.c    |    3 +-
 .../native/libfreetype/src/base/ftdebug.c     |    4 +-
 .../native/libfreetype/src/base/ftfntfmt.c    |    2 +-
 .../native/libfreetype/src/base/ftfstype.c    |    2 +-
 .../native/libfreetype/src/base/ftgasp.c      |    2 +-
 .../native/libfreetype/src/base/ftgloadr.c    |    2 +-
 .../native/libfreetype/src/base/ftglyph.c     |    2 +-
 .../native/libfreetype/src/base/fthash.c      |  104 +-
 .../native/libfreetype/src/base/ftinit.c      |    2 +-
 .../native/libfreetype/src/base/ftlcdfil.c    |    2 +-
 .../share/native/libfreetype/src/base/ftmac.c |    2 +-
 .../share/native/libfreetype/src/base/ftmm.c  |   37 +-
 .../native/libfreetype/src/base/ftobjs.c      |   64 +-
 .../native/libfreetype/src/base/ftoutln.c     |    2 +-
 .../native/libfreetype/src/base/ftpatent.c    |    2 +-
 .../native/libfreetype/src/base/ftpsprop.c    |    2 +-
 .../native/libfreetype/src/base/ftrfork.c     |   10 +-
 .../native/libfreetype/src/base/ftsnames.c    |    2 +-
 .../native/libfreetype/src/base/ftstream.c    |    4 +-
 .../native/libfreetype/src/base/ftstroke.c    |   24 +-
 .../native/libfreetype/src/base/ftsynth.c     |    4 +-
 .../native/libfreetype/src/base/ftsystem.c    |    4 +-
 .../native/libfreetype/src/base/fttrigon.c    |    2 +-
 .../native/libfreetype/src/base/fttype1.c     |    2 +-
 .../native/libfreetype/src/base/ftutil.c      |    2 +-
 .../native/libfreetype/src/cff/cffcmap.c      |    2 +-
 .../native/libfreetype/src/cff/cffcmap.h      |    2 +-
 .../native/libfreetype/src/cff/cffdrivr.c     |  162 +-
 .../native/libfreetype/src/cff/cffdrivr.h     |    2 +-
 .../native/libfreetype/src/cff/cfferrs.h      |    2 +-
 .../native/libfreetype/src/cff/cffgload.c     |   70 +-
 .../native/libfreetype/src/cff/cffgload.h     |    2 +-
 .../native/libfreetype/src/cff/cffload.c      |   16 +-
 .../native/libfreetype/src/cff/cffload.h      |    2 +-
 .../native/libfreetype/src/cff/cffobjs.c      |   16 +-
 .../native/libfreetype/src/cff/cffobjs.h      |    2 +-
 .../native/libfreetype/src/cff/cffparse.c     |   10 +-
 .../native/libfreetype/src/cff/cffparse.h     |    2 +-
 .../native/libfreetype/src/cff/cfftoken.h     |    2 +-
 .../native/libfreetype/src/cid/ciderrs.h      |    2 +-
 .../native/libfreetype/src/cid/cidgload.c     |   46 +-
 .../native/libfreetype/src/cid/cidgload.h     |    2 +-
 .../native/libfreetype/src/cid/cidload.c      |    2 +-
 .../native/libfreetype/src/cid/cidload.h      |    2 +-
 .../native/libfreetype/src/cid/cidobjs.c      |    2 +-
 .../native/libfreetype/src/cid/cidobjs.h      |    2 +-
 .../native/libfreetype/src/cid/cidparse.c     |    2 +-
 .../native/libfreetype/src/cid/cidparse.h     |    2 +-
 .../native/libfreetype/src/cid/cidriver.c     |    2 +-
 .../native/libfreetype/src/cid/cidriver.h     |    2 +-
 .../native/libfreetype/src/cid/cidtoken.h     |    2 +-
 .../native/libfreetype/src/psaux/afmparse.c   |    2 +-
 .../native/libfreetype/src/psaux/afmparse.h   |    2 +-
 .../native/libfreetype/src/psaux/cffdecode.c  |    6 +-
 .../native/libfreetype/src/psaux/cffdecode.h  |    2 +-
 .../native/libfreetype/src/psaux/psauxerr.h   |    2 +-
 .../native/libfreetype/src/psaux/psauxmod.c   |    2 +-
 .../native/libfreetype/src/psaux/psauxmod.h   |    5 +-
 .../native/libfreetype/src/psaux/psconv.c     |    2 +-
 .../native/libfreetype/src/psaux/psconv.h     |    2 +-
 .../native/libfreetype/src/psaux/psintrp.c    |    2 +-
 .../native/libfreetype/src/psaux/psobjs.c     |    9 +-
 .../native/libfreetype/src/psaux/psobjs.h     |    2 +-
 .../native/libfreetype/src/psaux/t1cmap.c     |    2 +-
 .../native/libfreetype/src/psaux/t1cmap.h     |    2 +-
 .../native/libfreetype/src/psaux/t1decode.c   |    4 +-
 .../native/libfreetype/src/psaux/t1decode.h   |    2 +-
 .../native/libfreetype/src/pshinter/pshalgo.c |    4 +-
 .../native/libfreetype/src/pshinter/pshalgo.h |    2 +-
 .../native/libfreetype/src/pshinter/pshglob.c |    2 +-
 .../native/libfreetype/src/pshinter/pshglob.h |    2 +-
 .../native/libfreetype/src/pshinter/pshmod.c  |    2 +-
 .../native/libfreetype/src/pshinter/pshmod.h  |    2 +-
 .../libfreetype/src/pshinter/pshnterr.h       |    2 +-
 .../native/libfreetype/src/pshinter/pshrec.c  |   12 +-
 .../native/libfreetype/src/pshinter/pshrec.h  |    2 +-
 .../native/libfreetype/src/psnames/psmodule.c |    2 +-
 .../native/libfreetype/src/psnames/psmodule.h |    2 +-
 .../native/libfreetype/src/psnames/psnamerr.h |    2 +-
 .../native/libfreetype/src/psnames/pstables.h |    2 +-
 .../native/libfreetype/src/raster/ftmisc.h    |    2 +-
 .../native/libfreetype/src/raster/ftraster.c  |   18 +-
 .../native/libfreetype/src/raster/ftraster.h  |    2 +-
 .../native/libfreetype/src/raster/ftrend1.c   |    2 +-
 .../native/libfreetype/src/raster/ftrend1.h   |    2 +-
 .../native/libfreetype/src/raster/rasterrs.h  |    2 +-
 .../native/libfreetype/src/sfnt/pngshim.c     |    2 +-
 .../native/libfreetype/src/sfnt/pngshim.h     |    2 +-
 .../native/libfreetype/src/sfnt/sfdriver.c    |    4 +-
 .../native/libfreetype/src/sfnt/sfdriver.h    |    2 +-
 .../native/libfreetype/src/sfnt/sferrors.h    |    2 +-
 .../native/libfreetype/src/sfnt/sfobjs.c      |    9 +-
 .../native/libfreetype/src/sfnt/sfobjs.h      |    2 +-
 .../native/libfreetype/src/sfnt/sfwoff.c      |    2 +-
 .../native/libfreetype/src/sfnt/sfwoff.h      |    2 +-
 .../native/libfreetype/src/sfnt/sfwoff2.c     |    8 +-
 .../native/libfreetype/src/sfnt/sfwoff2.h     |    2 +-
 .../native/libfreetype/src/sfnt/ttcmap.c      |   22 +-
 .../native/libfreetype/src/sfnt/ttcmap.h      |    2 +-
 .../native/libfreetype/src/sfnt/ttcmapc.h     |    2 +-
 .../native/libfreetype/src/sfnt/ttcolr.c      |    4 +-
 .../native/libfreetype/src/sfnt/ttcolr.h      |    2 +-
 .../native/libfreetype/src/sfnt/ttcpal.c      |    2 +-
 .../native/libfreetype/src/sfnt/ttcpal.h      |    2 +-
 .../native/libfreetype/src/sfnt/ttkern.c      |    5 +-
 .../native/libfreetype/src/sfnt/ttkern.h      |    8 +-
 .../native/libfreetype/src/sfnt/ttload.c      |   32 +-
 .../native/libfreetype/src/sfnt/ttload.h      |    2 +-
 .../share/native/libfreetype/src/sfnt/ttmtx.c |    4 +-
 .../share/native/libfreetype/src/sfnt/ttmtx.h |    2 +-
 .../native/libfreetype/src/sfnt/ttpost.c      |    2 +-
 .../native/libfreetype/src/sfnt/ttpost.h      |    2 +-
 .../native/libfreetype/src/sfnt/ttsbit.c      |   55 +-
 .../native/libfreetype/src/sfnt/ttsbit.h      |    2 +-
 .../native/libfreetype/src/sfnt/woff2tags.c   |    2 +-
 .../native/libfreetype/src/sfnt/woff2tags.h   |    2 +-
 .../native/libfreetype/src/smooth/ftgrays.c   |   84 +-
 .../native/libfreetype/src/smooth/ftgrays.h   |   13 +-
 .../native/libfreetype/src/smooth/ftsmerrs.h  |    2 +-
 .../native/libfreetype/src/smooth/ftsmooth.c  |    2 +-
 .../native/libfreetype/src/smooth/ftsmooth.h  |    2 +-
 .../libfreetype/src/truetype/ttdriver.c       |    6 +-
 .../libfreetype/src/truetype/ttdriver.h       |    2 +-
 .../libfreetype/src/truetype/tterrors.h       |    2 +-
 .../native/libfreetype/src/truetype/ttgload.c |  423 ++---
 .../native/libfreetype/src/truetype/ttgload.h |    2 +-
 .../native/libfreetype/src/truetype/ttgxvar.c |  702 +++++--
 .../native/libfreetype/src/truetype/ttgxvar.h |    7 +-
 .../libfreetype/src/truetype/ttinterp.c       | 1587 +++++++---------
 .../libfreetype/src/truetype/ttinterp.h       |  128 +-
 .../native/libfreetype/src/truetype/ttobjs.c  |  450 ++---
 .../native/libfreetype/src/truetype/ttobjs.h  |  127 +-
 .../native/libfreetype/src/truetype/ttpload.c |   18 +-
 .../native/libfreetype/src/truetype/ttpload.h |    2 +-
 .../libfreetype/src/truetype/ttsubpix.c       | 1013 -----------
 .../libfreetype/src/truetype/ttsubpix.h       |  110 --
 .../native/libfreetype/src/type1/t1afm.c      |    2 +-
 .../native/libfreetype/src/type1/t1afm.h      |    2 +-
 .../native/libfreetype/src/type1/t1driver.c   |    2 +-
 .../native/libfreetype/src/type1/t1driver.h   |    2 +-
 .../native/libfreetype/src/type1/t1errors.h   |    2 +-
 .../native/libfreetype/src/type1/t1gload.c    |   44 +-
 .../native/libfreetype/src/type1/t1gload.h    |    2 +-
 .../native/libfreetype/src/type1/t1load.c     |    8 +-
 .../native/libfreetype/src/type1/t1load.h     |    2 +-
 .../native/libfreetype/src/type1/t1objs.c     |    2 +-
 .../native/libfreetype/src/type1/t1objs.h     |    2 +-
 .../native/libfreetype/src/type1/t1parse.c    |    2 +-
 .../native/libfreetype/src/type1/t1parse.h    |    2 +-
 .../native/libfreetype/src/type1/t1tokens.h   |    2 +-
 .../html/CSS/8231286/HtmlFontSizeTest.java    |   18 +-
 286 files changed, 7169 insertions(+), 4787 deletions(-)
 create mode 100644 src/java.desktop/share/native/libfreetype/src/autofit/afadjust.c
 create mode 100644 src/java.desktop/share/native/libfreetype/src/autofit/afadjust.h
 create mode 100644 src/java.desktop/share/native/libfreetype/src/autofit/ft-hb.c
 create mode 100644 src/java.desktop/share/native/libfreetype/src/autofit/ft-hb.h
 delete mode 100644 src/java.desktop/share/native/libfreetype/src/truetype/ttsubpix.c
 delete mode 100644 src/java.desktop/share/native/libfreetype/src/truetype/ttsubpix.h

diff --git a/src/java.desktop/share/legal/freetype.md b/src/java.desktop/share/legal/freetype.md
index 5df525e2f67..cf2518df594 100644
--- a/src/java.desktop/share/legal/freetype.md
+++ b/src/java.desktop/share/legal/freetype.md
@@ -1,4 +1,4 @@
-## The FreeType Project: Freetype v2.13.3
+## The FreeType Project: Freetype v2.14.1
 
 
 ### FreeType Notice
@@ -21,25 +21,24 @@ which fits your needs best.
 ### FreeType License
 ```
 
-Copyright (C) 1996-2024 by David Turner, Robert Wilhelm, and Werner Lemberg.
-Copyright (C) 2007-2024 by Dereg Clegg and Michael Toftdal.
-Copyright (C) 1996-2024 by Just van Rossum, David Turner, Robert Wilhelm, and Werner Lemberg.
-Copyright (C) 2022-2024 by David Turner, Robert Wilhelm, Werner Lemberg, George Williams, and
-Copyright (C) 2004-2024 by Masatake YAMATO and Redhat K.K.
-Copyright (C) 2007-2024 by Derek Clegg and Michael Toftdal.
-Copyright (C) 2003-2024 by Masatake YAMATO, Red Hat K.K.,
-Copyright (C) 1996-2024 by David Turner, Robert Wilhelm, Werner Lemberg, and Dominik Röttsches.
-Copyright (C) 2007-2024 by David Turner.
-Copyright (C) 2022-2024 by David Turner, Robert Wilhelm, Werner Lemberg, and Moazin Khatti.
-Copyright (C) 2007-2024 by Rahul Bhalerao <rahul.bhalerao@redhat.com>, <b.rahul.pm@gmail.com>.
-Copyright (C) 2008-2024 by David Turner, Robert Wilhelm, Werner Lemberg, and suzuki toshiya.
-Copyright (C) 2013-2024 by Google, Inc.
-Copyright (C) 2019-2024 by Nikhil Ramakrishnan, David Turner, Robert Wilhelm, and Werner Lemberg.
-Copyright (C) 2009-2024 by Oran Agra and Mickey Gabel.
-Copyright (C) 2018-2024 by David Turner, Robert Wilhelm, Dominik Röttsches, and Werner Lemberg.
-Copyright (C) 2004-2024 by David Turner, Robert Wilhelm, Werner Lemberg, and George Williams.
-
-
+Copyright (C) 1996-2025 by David Turner, Robert Wilhelm, and Werner Lemberg.
+Copyright (C) 2007-2025 by Dereg Clegg and Michael Toftdal.
+Copyright (C) 1996-2025 by Just van Rossum, David Turner, Robert Wilhelm, and Werner Lemberg.
+Copyright (C) 2022-2025 by David Turner, Robert Wilhelm, Werner Lemberg, George Williams, and
+Copyright (C) 2004-2025 by Masatake YAMATO and Redhat K.K.
+Copyright (C) 2007-2025 by Derek Clegg and Michael Toftdal.
+Copyright (C) 2003-2025 by Masatake YAMATO, Red Hat K.K.,
+Copyright (C) 1996-2025 by David Turner, Robert Wilhelm, Werner Lemberg, and Dominik Röttsches.
+Copyright (C) 2007-2025 by David Turner.
+Copyright (C) 2022-2025 by David Turner, Robert Wilhelm, Werner Lemberg, and Moazin Khatti.
+Copyright (C) 2007-2025 by Rahul Bhalerao <rahul.bhalerao@redhat.com>, <b.rahul.pm@gmail.com>.
+Copyright (C) 2025 by Behdad Esfahbod.
+Copyright (C) 2008-2025 by David Turner, Robert Wilhelm, Werner Lemberg, and suzuki toshiya.
+Copyright (C) 2013-2025 by Google, Inc.
+Copyright (C) 2019-2025 by Nikhil Ramakrishnan, David Turner, Robert Wilhelm, and Werner Lemberg.
+Copyright (C) 2009-2025 by Oran Agra and Mickey Gabel.
+Copyright (C) 2018-2025 by David Turner, Robert Wilhelm, Dominik Röttsches, and Werner Lemberg.
+Copyright (C) 2004-2025 by David Turner, Robert Wilhelm, Werner Lemberg, and George Williams.
                     The FreeType Project LICENSE
                     ----------------------------
 
@@ -207,6 +206,7 @@ Legal Terms
 
     https://www.freetype.org
 
+
 ```
 
 ### GPL v2
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/config/ftconfig.h b/src/java.desktop/share/native/libfreetype/include/freetype/config/ftconfig.h
index 0667493fec6..d66c5df9976 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/config/ftconfig.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/config/ftconfig.h
@@ -4,7 +4,7 @@
  *
  *   ANSI-specific configuration file (specification only).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/config/ftheader.h b/src/java.desktop/share/native/libfreetype/include/freetype/config/ftheader.h
index f6ef2618ded..16eab9048fc 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/config/ftheader.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/config/ftheader.h
@@ -4,7 +4,7 @@
  *
  *   Build macros of the FreeType 2 library.
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/config/ftoption.h b/src/java.desktop/share/native/libfreetype/include/freetype/config/ftoption.h
index d29a0a7cefb..be7a4c50dc3 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/config/ftoption.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/config/ftoption.h
@@ -4,7 +4,7 @@
  *
  *   User-selectable configuration macros (specification only).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
@@ -158,12 +158,12 @@ FT_BEGIN_HEADER
 
   /**************************************************************************
    *
-   * If this macro is defined, try to use an inlined assembler version of the
-   * @FT_MulFix function, which is a 'hotspot' when loading and hinting
-   * glyphs, and which should be executed as fast as possible.
+   * If this macro is defined, try to use an inlined 64-bit or assembler
+   * version of the @FT_MulFix function, which is a 'hotspot' when loading
+   * and hinting glyphs, and which should be executed as fast as possible.
    *
-   * Note that if your compiler or CPU is not supported, this will default to
-   * the standard and portable implementation found in `ftcalc.c`.
+   * If your compiler is not C99-compliant or CPU assembly is not supported,
+   * you can disable this option.
    */
 #define FT_CONFIG_OPTION_INLINE_MULFIX
 
@@ -293,6 +293,31 @@ FT_BEGIN_HEADER
 /* #define FT_CONFIG_OPTION_USE_HARFBUZZ */
 
 
+  /**************************************************************************
+   *
+   * HarfBuzz dynamic support.
+   *
+   *   Define this macro if you want the HarfBuzz library to be loaded at
+   *   runtime instead of being linked to FreeType.
+   *
+   *   This option has no effect if `FT_CONFIG_OPTION_USE_HARFBUZZ` is not
+   *   defined.
+   *
+   *   When this option is enabled, FreeType will try to load the HarfBuzz
+   *   library at runtime, using `dlopen` or `LoadLibrary`, depending on the
+   *   platform.  On Microsoft platforms, the library name looked up is
+   *   `libharfbuzz-0.dll`.  On Apple platforms, the library name looked up
+   *   is `libharfbuzz.0.dylib`.  On all other platforms, the library name
+   *   looked up is `libharfbuzz.so.0`.  This name can be overridden by
+   *   defining the macro `FT_LIBHARFBUZZ` at FreeType compilation time.
+   *
+   *   If you use a build system like cmake or the `configure` script,
+   *   options set by those programs have precedence, overwriting the value
+   *   here with the configured one.
+   */
+/* #define FT_CONFIG_OPTION_USE_HARFBUZZ_DYNAMIC */
+
+
   /**************************************************************************
    *
    * Brotli support.
@@ -679,7 +704,7 @@ FT_BEGIN_HEADER
    * defined.
    *
    * [1]
-   * https://www.microsoft.com/typography/cleartype/truetypecleartype.aspx
+   * https://learn.microsoft.com/typography/cleartype/truetypecleartype
    */
 #define TT_CONFIG_OPTION_SUBPIXEL_HINTING
 
@@ -697,7 +722,7 @@ FT_BEGIN_HEADER
    * flags array which can be used to disambiguate, but old fonts will not
    * have them.
    *
-   *   https://www.microsoft.com/typography/otspec/glyf.htm
+   *   https://learn.microsoft.com/typography/opentype/spec/glyf
    *   https://developer.apple.com/fonts/TrueType-Reference-Manual/RM06/Chap6glyf.html
    */
 #undef TT_CONFIG_OPTION_COMPONENT_OFFSET_SCALED
@@ -760,10 +785,10 @@ FT_BEGIN_HEADER
   /**************************************************************************
    *
    * Option `TT_CONFIG_OPTION_GPOS_KERNING` enables a basic GPOS kerning
-   * implementation (for TrueType fonts only).  With this defined, FreeType
-   * is able to get kerning pair data from the GPOS 'kern' feature as well as
-   * legacy 'kern' tables; without this defined, FreeType will only be able
-   * to use legacy 'kern' tables.
+   * implementation (for TrueType and OpenType fonts only).  With this
+   * defined, FreeType is able to get kerning pair data from the GPOS 'kern'
+   * feature as well as legacy 'kern' tables; without this defined, FreeType
+   * will only be able to use legacy 'kern' tables.
    *
    * Note that FreeType does not support more advanced GPOS layout features;
    * even the 'kern' feature implemented here doesn't handle more
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/config/ftstdlib.h b/src/java.desktop/share/native/libfreetype/include/freetype/config/ftstdlib.h
index e17aa7b89d5..f846b4456c1 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/config/ftstdlib.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/config/ftstdlib.h
@@ -5,7 +5,7 @@
  *   ANSI-specific library and header configuration file (specification
  *   only).
  *
- * Copyright (C) 2002-2024 by
+ * Copyright (C) 2002-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/config/integer-types.h b/src/java.desktop/share/native/libfreetype/include/freetype/config/integer-types.h
index c27505ffc4b..a0b892ece4b 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/config/integer-types.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/config/integer-types.h
@@ -4,7 +4,7 @@
  *
  *   FreeType integer types definitions.
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
@@ -17,6 +17,8 @@
 #ifndef FREETYPE_CONFIG_INTEGER_TYPES_H_
 #define FREETYPE_CONFIG_INTEGER_TYPES_H_
 
+FT_BEGIN_HEADER
+
   /* There are systems (like the Texas Instruments 'C54x) where a `char`  */
   /* has 16~bits.  ANSI~C says that `sizeof(char)` is always~1.  Since an */
   /* `int` has 16~bits also for this system, `sizeof(int)` gives~1 which  */
@@ -242,9 +244,34 @@
 #endif /* FT_SIZEOF_LONG == (64 / FT_CHAR_BIT) */
 
 #ifdef FT_INT64
+
   typedef FT_INT64   FT_Int64;
   typedef FT_UINT64  FT_UInt64;
-#endif
 
+#  define FT_INT64_ZERO  0
+
+#else  /* !FT_INT64 */
+
+  /* we need to emulate 64-bit data types if none are available */
+
+  typedef struct  FT_Int64_
+  {
+    FT_UInt32  lo;
+    FT_UInt32  hi;
+
+  } FT_Int64;
+
+  typedef struct  FT_UInt64_
+  {
+    FT_UInt32  lo;
+    FT_UInt32  hi;
+
+  } FT_UInt64;
+
+#  define FT_INT64_ZERO  { 0, 0 }
+
+#endif /* !FT_INT64 */
+
+FT_END_HEADER
 
 #endif  /* FREETYPE_CONFIG_INTEGER_TYPES_H_ */
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/config/mac-support.h b/src/java.desktop/share/native/libfreetype/include/freetype/config/mac-support.h
index 07b6f915bd8..d1b6a9898fd 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/config/mac-support.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/config/mac-support.h
@@ -4,7 +4,7 @@
  *
  *   Mac/OS X support configuration header.
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/config/public-macros.h b/src/java.desktop/share/native/libfreetype/include/freetype/config/public-macros.h
index f56581a6ee7..9f28b394737 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/config/public-macros.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/config/public-macros.h
@@ -4,7 +4,7 @@
  *
  *   Define a set of compiler macros used in public FreeType headers.
  *
- * Copyright (C) 2020-2024 by
+ * Copyright (C) 2020-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
@@ -62,8 +62,8 @@ FT_BEGIN_HEADER
    * because it is needed by `FT_EXPORT`.
    */
 
-  /* Visual C, mingw */
-#if defined( _WIN32 )
+  /* Visual C, MinGW, Cygwin */
+#if defined( _WIN32 ) || defined( __CYGWIN__ )
 
 #if defined( FT2_BUILD_LIBRARY ) && defined( DLL_EXPORT )
 #define FT_PUBLIC_FUNCTION_ATTRIBUTE  __declspec( dllexport )
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/freetype.h b/src/java.desktop/share/native/libfreetype/include/freetype/freetype.h
index 58fc33dfe60..1e249235882 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/freetype.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/freetype.h
@@ -4,7 +4,7 @@
  *
  *   FreeType high-level API and common types (specification only).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
@@ -811,7 +811,7 @@ FT_BEGIN_HEADER
    *   FT_ENCODING_MS_SYMBOL ::
    *     Microsoft Symbol encoding, used to encode mathematical symbols and
    *     wingdings.  For more information, see
-   *     'https://www.microsoft.com/typography/otspec/recom.htm#non-standard-symbol-fonts',
+   *     'https://learn.microsoft.com/typography/opentype/spec/recom#non-standard-symbol-fonts',
    *     'http://www.kostis.net/charsets/symbol.htm', and
    *     'http://www.kostis.net/charsets/wingding.htm'.
    *
@@ -1068,12 +1068,12 @@ FT_BEGIN_HEADER
    *     the face in the font file (starting with value~0).  They are set
    *     to~0 if there is only one face in the font file.
    *
-   *     [Since 2.6.1] Bits 16-30 are relevant to GX and OpenType variation
-   *     fonts only, holding the named instance index for the current face
-   *     index (starting with value~1; value~0 indicates font access without
-   *     a named instance).  For non-variation fonts, bits 16-30 are ignored.
-   *     If we have the third named instance of face~4, say, `face_index` is
-   *     set to 0x00030004.
+   *     [Since 2.6.1] Bits 16-30 are relevant to TrueType GX and OpenType
+   *     Font Variations only, holding the named instance index for the
+   *     current face index (starting with value~1; value~0 indicates font
+   *     access without a named instance).  For non-variation fonts, bits
+   *     16-30 are ignored.  If we have the third named instance of face~4,
+   *     say, `face_index` is set to 0x00030004.
    *
    *     Bit 31 is always zero (that is, `face_index` is always a positive
    *     value).
@@ -1092,10 +1092,10 @@ FT_BEGIN_HEADER
    *     the face; see @FT_STYLE_FLAG_XXX for the details.
    *
    *     [Since 2.6.1] Bits 16-30 hold the number of named instances
-   *     available for the current face if we have a GX or OpenType variation
-   *     (sub)font.  Bit 31 is always zero (that is, `style_flags` is always
-   *     a positive value).  Note that a variation font has always at least
-   *     one named instance, namely the default instance.
+   *     available for the current face if we have a TrueType GX or OpenType
+   *     Font Variation.  Bit 31 is always zero (that is, `style_flags` is
+   *     always a positive value).  Note that a variation font has always at
+   *     least one named instance, namely the default instance.
    *
    *   num_glyphs ::
    *     The number of glyphs in the face.  If the face is scalable and has
@@ -1159,7 +1159,7 @@ FT_BEGIN_HEADER
    *     Note that the bounding box might be off by (at least) one pixel for
    *     hinted fonts.  See @FT_Size_Metrics for further discussion.
    *
-   *     Note that the bounding box does not vary in OpenType variation fonts
+   *     Note that the bounding box does not vary in OpenType Font Variations
    *     and should only be used in relation to the default instance.
    *
    *   units_per_EM ::
@@ -1218,7 +1218,7 @@ FT_BEGIN_HEADER
    *   Fields may be changed after a call to @FT_Attach_File or
    *   @FT_Attach_Stream.
    *
-   *   For an OpenType variation font, the values of the following fields can
+   *   For OpenType Font Variations, the values of the following fields can
    *   change after a call to @FT_Set_Var_Design_Coordinates (and friends) if
    *   the font contains an 'MVAR' table: `ascender`, `descender`, `height`,
    *   `underline_position`, and `underline_thickness`.
@@ -1336,7 +1336,7 @@ FT_BEGIN_HEADER
    *   FT_FACE_FLAG_MULTIPLE_MASTERS ::
    *     The face contains multiple masters and is capable of interpolating
    *     between them.  Supported formats are Adobe MM, TrueType GX, and
-   *     OpenType variation fonts.
+   *     OpenType Font Variations.
    *
    *     See section @multiple_masters for API details.
    *
@@ -1609,7 +1609,7 @@ FT_BEGIN_HEADER
    *
    * @description:
    *   A macro that returns true whenever a face object is a named instance
-   *   of a GX or OpenType variation font.
+   *   of a TrueType GX or OpenType Font Variations.
    *
    *   [Since 2.9] Changing the design coordinates with
    *   @FT_Set_Var_Design_Coordinates or @FT_Set_Var_Blend_Coordinates does
@@ -2147,7 +2147,7 @@ FT_BEGIN_HEADER
    *     freed.
    *
    *     [Since 2.10.1] If @FT_LOAD_NO_SCALE is set, outline coordinates of
-   *     OpenType variation fonts for a selected instance are internally
+   *     OpenType Font Variations for a selected instance are internally
    *     handled as 26.6 fractional font units but returned as (rounded)
    *     integers, as expected.  To get unrounded font units, don't use
    *     @FT_LOAD_NO_SCALE but load the glyph with @FT_LOAD_NO_HINTING and
@@ -2640,14 +2640,14 @@ FT_BEGIN_HEADER
    *     the face in the font file (starting with value~0).  Set it to~0 if
    *     there is only one face in the font file.
    *
-   *     [Since 2.6.1] Bits 16-30 are relevant to GX and OpenType variation
-   *     fonts only, specifying the named instance index for the current face
-   *     index (starting with value~1; value~0 makes FreeType ignore named
-   *     instances).  For non-variation fonts, bits 16-30 are ignored.
-   *     Assuming that you want to access the third named instance in face~4,
-   *     `face_index` should be set to 0x00030004.  If you want to access
-   *     face~4 without variation handling, simply set `face_index` to
-   *     value~4.
+   *     [Since 2.6.1] Bits 16-30 are relevant to TrueType GX and OpenType
+   *     Font Variations only, specifying the named instance index for the
+   *     current face index (starting with value~1; value~0 makes FreeType
+   *     ignore named instances).  For non-variation fonts, bits 16-30 are
+   *     ignored.  Assuming that you want to access the third named instance
+   *     in face~4, `face_index` should be set to 0x00030004.  If you want
+   *     to access face~4 without variation handling, simply set
+   *     `face_index` to value~4.
    *
    *     `FT_Open_Face` and its siblings can be used to quickly check whether
    *     the font format of a given font resource is supported by FreeType.
@@ -2914,11 +2914,11 @@ FT_BEGIN_HEADER
    *   of the available glyphs at a given ppem value is available.  FreeType
    *   silently uses outlines if there is no bitmap for a given glyph index.
    *
-   *   For GX and OpenType variation fonts, a bitmap strike makes sense only
-   *   if the default instance is active (that is, no glyph variation takes
-   *   place); otherwise, FreeType simply ignores bitmap strikes.  The same
-   *   is true for all named instances that are different from the default
-   *   instance.
+   *   For TrueType GX and OpenType Font Variations, a bitmap strike makes
+   *   sense only if the default instance is active (that is, no glyph
+   *   variation takes place); otherwise, FreeType simply ignores bitmap
+   *   strikes.  The same is true for all named instances that are different
+   *   from the default instance.
    *
    *   Don't use this function if you are using the FreeType cache API.
    */
@@ -3078,7 +3078,7 @@ FT_BEGIN_HEADER
    *   is dependent entirely on how the size is defined in the source face.
    *   The font designer chooses the final size of each glyph relative to
    *   this size.  For more information refer to
-   *   'https://www.freetype.org/freetype2/docs/glyphs/glyphs-2.html'.
+   *   'https://freetype.org/freetype2/docs/glyphs/glyphs-2.html'.
    *
    *   Contrary to @FT_Set_Char_Size, this function doesn't have special code
    *   to normalize zero-valued widths, heights, or resolutions, which are
@@ -3441,8 +3441,10 @@ FT_BEGIN_HEADER
    *     blending of the color glyph layers associated with the glyph index,
    *     using the same bitmap format as embedded color bitmap images.  This
    *     is mainly for convenience and works only for glyphs in 'COLR' v0
-   *     tables (or glyphs in 'COLR' v1 tables that exclusively use v0
-   *     features).  For full control of color layers use
+   *     tables.  **There is no rendering support for 'COLR' v1** (with the
+   *     exception of v1 tables that exclusively use v0 features)!  You need
+   *     a graphics library like Skia or Cairo to interpret the graphics
+   *     commands stored in v1 tables.  For full control of color layers use
    *     @FT_Get_Color_Glyph_Layer and FreeType's color functions like
    *     @FT_Palette_Select instead of setting @FT_LOAD_COLOR for rendering
    *     so that the client application can handle blending by itself.
@@ -3895,8 +3897,10 @@ FT_BEGIN_HEADER
    *
    *   This process can cost performance.  There is an approximation that
    *   does not need to know about the background color; see
-   *   https://bel.fi/alankila/lcd/ and
-   *   https://bel.fi/alankila/lcd/alpcor.html for details.
+   *   https://web.archive.org/web/20211019204945/https://bel.fi/alankila/lcd/
+   *   and
+   *   https://web.archive.org/web/20210211002939/https://bel.fi/alankila/lcd/alpcor.html
+   *   for details.
    *
    *   **ATTENTION**: Linear blending is even more important when dealing
    *   with subpixel-rendered glyphs to prevent color-fringing!  A
@@ -3993,13 +3997,13 @@ FT_BEGIN_HEADER
    *   out of the scope of this API function -- they can be implemented
    *   through format-specific interfaces.
    *
-   *   Note that, for TrueType fonts only, this can extract data from both
-   *   the 'kern' table and the basic, pair-wise kerning feature from the
-   *   GPOS table (with `TT_CONFIG_OPTION_GPOS_KERNING` enabled), though
-   *   FreeType does not support the more advanced GPOS layout features; use
-   *   a library like HarfBuzz for those instead.  If a font has both a
-   *   'kern' table and kern features of a GPOS table, the 'kern' table will
-   *   be used.
+   *   Note that, for TrueType and OpenType fonts only, this can extract data
+   *   from both the 'kern' table and the basic, pair-wise kerning feature
+   *   from the GPOS table (with `TT_CONFIG_OPTION_GPOS_KERNING` enabled),
+   *   though FreeType does not support the more advanced GPOS layout
+   *   features; use a library like HarfBuzz for those instead.  If a font
+   *   has both a 'kern' table and kern features of a GPOS table, the 'kern'
+   *   table will be used.
    *
    *   Also note for right-to-left scripts, the functionality may differ for
    *   fonts with GPOS tables vs. 'kern' tables.  For GPOS, right-to-left
@@ -4530,7 +4534,7 @@ FT_BEGIN_HEADER
    *   table description in the OpenType specification for the meaning of the
    *   various flags (which get synthesized for non-OpenType subglyphs).
    *
-   *     https://docs.microsoft.com/en-us/typography/opentype/spec/glyf#composite-glyph-description
+   *     https://learn.microsoft.com/typography/opentype/spec/glyf#composite-glyph-description
    *
    * @values:
    *   FT_SUBGLYPH_FLAG_ARGS_ARE_WORDS ::
@@ -4593,7 +4597,7 @@ FT_BEGIN_HEADER
    *   interpreted depending on the flags returned in `*p_flags`.  See the
    *   OpenType specification for details.
    *
-   *     https://docs.microsoft.com/en-us/typography/opentype/spec/glyf#composite-glyph-description
+   *     https://learn.microsoft.com/typography/opentype/spec/glyf#composite-glyph-description
    *
    */
   FT_EXPORT( FT_Error )
@@ -4619,7 +4623,7 @@ FT_BEGIN_HEADER
    *   associated with a font.
    *
    *   See
-   *   https://www.adobe.com/content/dam/Adobe/en/devnet/acrobat/pdfs/FontPolicies.pdf
+   *   https://adobe-type-tools.github.io/font-tech-notes/pdfs/AcrobatDC_FontPolicies.pdf
    *   for more details.
    *
    * @values:
@@ -5173,8 +5177,8 @@ FT_BEGIN_HEADER
    *
    */
 #define FREETYPE_MAJOR  2
-#define FREETYPE_MINOR  13
-#define FREETYPE_PATCH  3
+#define FREETYPE_MINOR  14
+#define FREETYPE_PATCH  1
 
 
   /**************************************************************************
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/ftadvanc.h b/src/java.desktop/share/native/libfreetype/include/freetype/ftadvanc.h
index 85b8ba2554b..62a856ccbd7 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/ftadvanc.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/ftadvanc.h
@@ -4,7 +4,7 @@
  *
  *   Quick computation of advance widths (specification only).
  *
- * Copyright (C) 2008-2024 by
+ * Copyright (C) 2008-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/ftbbox.h b/src/java.desktop/share/native/libfreetype/include/freetype/ftbbox.h
index 12bbfa63a62..348b4b3a268 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/ftbbox.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/ftbbox.h
@@ -4,7 +4,7 @@
  *
  *   FreeType exact bbox computation (specification).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/ftbdf.h b/src/java.desktop/share/native/libfreetype/include/freetype/ftbdf.h
index 6f63b0b1e78..faad25689c9 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/ftbdf.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/ftbdf.h
@@ -4,7 +4,7 @@
  *
  *   FreeType API for accessing BDF-specific strings (specification).
  *
- * Copyright (C) 2002-2024 by
+ * Copyright (C) 2002-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/ftbitmap.h b/src/java.desktop/share/native/libfreetype/include/freetype/ftbitmap.h
index df9d462652e..a22d43adf14 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/ftbitmap.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/ftbitmap.h
@@ -4,7 +4,7 @@
  *
  *   FreeType utility functions for bitmaps (specification).
  *
- * Copyright (C) 2004-2024 by
+ * Copyright (C) 2004-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/ftcid.h b/src/java.desktop/share/native/libfreetype/include/freetype/ftcid.h
index 96b2a90fc59..7cda8ff3f39 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/ftcid.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/ftcid.h
@@ -4,7 +4,7 @@
  *
  *   FreeType API for accessing CID font information (specification).
  *
- * Copyright (C) 2007-2024 by
+ * Copyright (C) 2007-2025 by
  * Dereg Clegg and Michael Toftdal.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/ftcolor.h b/src/java.desktop/share/native/libfreetype/include/freetype/ftcolor.h
index 420720ddf22..129b1a23fb0 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/ftcolor.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/ftcolor.h
@@ -4,7 +4,7 @@
  *
  *   FreeType's glyph color management (specification).
  *
- * Copyright (C) 2018-2024 by
+ * Copyright (C) 2018-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
@@ -317,6 +317,15 @@ FT_BEGIN_HEADER
    * @description:
    *   The functions described here allow access of colored glyph layer data
    *   in OpenType's 'COLR' tables.
+   *
+   *   Note that FreeType does *not* provide rendering in general of glyphs
+   *   that use a 'COLR' table!  While FreeType has very limited rendering
+   *   support for 'COLR' v0 tables (without a possibility to change the
+   *   color palette) via @FT_Render_Glyph, there is no such convenience
+   *   code for 'COLR' v1 tables -- while it appears that v1 is simply an
+   *   'improved' version of v0, this is not the case: it is a completely
+   *   different color font format, and you need a dedicated graphics
+   *   library like Skia or Cairo to handle a v1 table's drawing commands.
    */
 
 
@@ -359,7 +368,7 @@ FT_BEGIN_HEADER
    *   iteratively retrieve the colored glyph layers associated with the
    *   current glyph slot.
    *
-   *     https://docs.microsoft.com/en-us/typography/opentype/spec/colr
+   *     https://learn.microsoft.com/typography/opentype/spec/colr
    *
    *   The glyph layer data for a given glyph index, if present, provides an
    *   alternative, multi-color glyph representation: Instead of rendering
@@ -1518,7 +1527,7 @@ FT_BEGIN_HEADER
    *
    * @return:
    *   Value~1 if a clip box is found.  If no clip box is found or an error
-   *   occured, value~0 is returned.
+   *   occurred, value~0 is returned.
    *
    * @note:
    *   To retrieve the clip box in font units, reset scale to units-per-em
@@ -1646,7 +1655,7 @@ FT_BEGIN_HEADER
    *
    * @return:
    *   Value~1 if everything is OK.  Value~0 if no details can be found for
-   *   this paint or any other error occured.
+   *   this paint or any other error occurred.
    *
    * @since:
    *   2.13
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/ftdriver.h b/src/java.desktop/share/native/libfreetype/include/freetype/ftdriver.h
index 1b7f539f5e2..b65a06ab69b 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/ftdriver.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/ftdriver.h
@@ -4,7 +4,7 @@
  *
  *   FreeType API for controlling driver modules (specification only).
  *
- * Copyright (C) 2017-2024 by
+ * Copyright (C) 2017-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
@@ -282,7 +282,7 @@ FT_BEGIN_HEADER
    *   minimize hinting techniques that were problematic with the extra
    *   resolution of ClearType; see
    *   http://rastertragedy.com/RTRCh4.htm#Sec1 and
-   *   https://www.microsoft.com/typography/cleartype/truetypecleartype.aspx.
+   *   https://learn.microsoft.com/typography/cleartype/truetypecleartype.
    *   This technique is not to be confused with ClearType compatible widths.
    *   ClearType backward compatibility has no direct impact on changing
    *   advance widths, but there might be an indirect impact on disabling
@@ -784,7 +784,7 @@ FT_BEGIN_HEADER
    *
    *   Details on subpixel hinting and some of the necessary tweaks can be
    *   found in Greg Hitchcock's whitepaper at
-   *   'https://www.microsoft.com/typography/cleartype/truetypecleartype.aspx'.
+   *   'https://learn.microsoft.com/typography/cleartype/truetypecleartype'.
    *   Note that FreeType currently doesn't really 'subpixel hint' (6x1, 6x2,
    *   or 6x5 supersampling) like discussed in the paper.  Depending on the
    *   chosen interpreter, it simply ignores instructions on vertical stems
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/fterrdef.h b/src/java.desktop/share/native/libfreetype/include/freetype/fterrdef.h
index 710ca91bbdd..3e591bede8d 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/fterrdef.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/fterrdef.h
@@ -4,7 +4,7 @@
  *
  *   FreeType error codes (specification).
  *
- * Copyright (C) 2002-2024 by
+ * Copyright (C) 2002-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/fterrors.h b/src/java.desktop/share/native/libfreetype/include/freetype/fterrors.h
index 27c0ece5c1c..eca494f90c0 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/fterrors.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/fterrors.h
@@ -4,7 +4,7 @@
  *
  *   FreeType error code handling (specification).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/ftfntfmt.h b/src/java.desktop/share/native/libfreetype/include/freetype/ftfntfmt.h
index 7c8b0874a81..5df82447d0e 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/ftfntfmt.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/ftfntfmt.h
@@ -4,7 +4,7 @@
  *
  *   Support functions for font formats.
  *
- * Copyright (C) 2002-2024 by
+ * Copyright (C) 2002-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/ftgasp.h b/src/java.desktop/share/native/libfreetype/include/freetype/ftgasp.h
index 30e5a9bf82b..77e5a7e7bfd 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/ftgasp.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/ftgasp.h
@@ -4,7 +4,7 @@
  *
  *   Access of TrueType's 'gasp' table (specification).
  *
- * Copyright (C) 2007-2024 by
+ * Copyright (C) 2007-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/ftglyph.h b/src/java.desktop/share/native/libfreetype/include/freetype/ftglyph.h
index dc1eb8873ae..3691781cf52 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/ftglyph.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/ftglyph.h
@@ -4,7 +4,7 @@
  *
  *   FreeType convenience functions to handle glyphs (specification).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/ftgzip.h b/src/java.desktop/share/native/libfreetype/include/freetype/ftgzip.h
index 9516dc030ac..e26c334c11a 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/ftgzip.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/ftgzip.h
@@ -4,7 +4,7 @@
  *
  *   Gzip-compressed stream support.
  *
- * Copyright (C) 2002-2024 by
+ * Copyright (C) 2002-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/ftimage.h b/src/java.desktop/share/native/libfreetype/include/freetype/ftimage.h
index 2b4b4ac60ae..b0a0172ef4f 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/ftimage.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/ftimage.h
@@ -5,7 +5,7 @@
  *   FreeType glyph image formats and default raster interface
  *   (specification).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
@@ -267,6 +267,10 @@ FT_BEGIN_HEADER
    *   *logical* one.  For example, if @FT_Pixel_Mode is set to
    *   `FT_PIXEL_MODE_LCD`, the logical width is a just a third of the
    *   physical one.
+   *
+   *   An empty bitmap with a NULL `buffer` is valid, with `rows` and/or
+   *   `pitch` also set to 0.  Such bitmaps might be produced while rendering
+   *   empty or degenerate outlines.
    */
   typedef struct  FT_Bitmap_
   {
@@ -439,7 +443,7 @@ FT_BEGIN_HEADER
    *   rasterizer; see the `tags` field in @FT_Outline.
    *
    *   Please refer to the description of the 'SCANTYPE' instruction in the
-   *   [OpenType specification](https://learn.microsoft.com/en-us/typography/opentype/spec/tt_instructions#scantype)
+   *   [OpenType specification](https://learn.microsoft.com/typography/opentype/spec/tt_instructions#scantype)
    *   how simple drop-outs, smart drop-outs, and stubs are defined.
    */
 #define FT_OUTLINE_NONE             0x0
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/ftincrem.h b/src/java.desktop/share/native/libfreetype/include/freetype/ftincrem.h
index 816581b78eb..2233044754e 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/ftincrem.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/ftincrem.h
@@ -4,7 +4,7 @@
  *
  *   FreeType incremental loading (specification).
  *
- * Copyright (C) 2002-2024 by
+ * Copyright (C) 2002-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/ftlcdfil.h b/src/java.desktop/share/native/libfreetype/include/freetype/ftlcdfil.h
index 25274dc4ac2..a0a8e9da929 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/ftlcdfil.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/ftlcdfil.h
@@ -5,7 +5,7 @@
  *   FreeType API for color filtering of subpixel bitmap glyphs
  *   (specification).
  *
- * Copyright (C) 2006-2024 by
+ * Copyright (C) 2006-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/ftlist.h b/src/java.desktop/share/native/libfreetype/include/freetype/ftlist.h
index 972fbfa2fe4..14958b0ff37 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/ftlist.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/ftlist.h
@@ -4,7 +4,7 @@
  *
  *   Generic list support for FreeType (specification).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/ftlogging.h b/src/java.desktop/share/native/libfreetype/include/freetype/ftlogging.h
index 1813cfc2c27..d155171136c 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/ftlogging.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/ftlogging.h
@@ -4,7 +4,7 @@
  *
  *   Additional debugging APIs.
  *
- * Copyright (C) 2020-2024 by
+ * Copyright (C) 2020-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/ftmac.h b/src/java.desktop/share/native/libfreetype/include/freetype/ftmac.h
index e4efde33dd8..c5ac49101a4 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/ftmac.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/ftmac.h
@@ -4,7 +4,7 @@
  *
  *   Additional Mac-specific API.
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * Just van Rossum, David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/ftmm.h b/src/java.desktop/share/native/libfreetype/include/freetype/ftmm.h
index 35ed039c89b..ff0bbab59f9 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/ftmm.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/ftmm.h
@@ -2,9 +2,9 @@
  *
  * ftmm.h
  *
- *   FreeType Multiple Master font interface (specification).
+ *   FreeType variation font interface (specification).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
@@ -37,24 +37,79 @@ FT_BEGIN_HEADER
    *   multiple_masters
    *
    * @title:
-   *   Multiple Masters
+   *   OpenType Font Variations, TrueType GX, and Adobe MM Fonts
    *
    * @abstract:
-   *   How to manage Multiple Masters fonts.
+   *   How to manage variable fonts with multiple design axes.
    *
    * @description:
-   *   The following types and functions are used to manage Multiple Master
-   *   fonts, i.e., the selection of specific design instances by setting
-   *   design axis coordinates.
+   *   The following types and functions manage OpenType Font Variations,
+   *   Adobe Multiple Master (MM) fonts, and Apple TrueType GX fonts.  These
+   *   formats have in common that they allow the selection of specific
+   *   design instances by setting design coordinates for one or more axes
+   *   like font weight or width.
    *
-   *   Besides Adobe MM fonts, the interface supports Apple's TrueType GX and
-   *   OpenType variation fonts.  Some of the routines only work with Adobe
-   *   MM fonts, others will work with all three types.  They are similar
-   *   enough that a consistent interface makes sense.
+   *   For historical reasons there are two interfaces.  The first, older one
+   *   can be used with Adobe MM fonts only, and the second, newer one is a
+   *   unified interface that handles all three font formats.  However, some
+   *   differences remain and are documented accordingly; in particular,
+   *   Adobe MM fonts don't have named instances (see below).
    *
-   *   For Adobe MM fonts, macro @FT_IS_SFNT returns false.  For GX and
-   *   OpenType variation fonts, it returns true.
+   *   For Adobe MM fonts, macro @FT_IS_SFNT returns false.  For TrueType GX
+   *   and OpenType Font Variations, it returns true.
    *
+   *   We use mostly the terminology of the OpenType standard.  Here are some
+   *   important technical terms.
+   *
+   *   * A 'named instance' is a tuple of design coordinates that has a
+   *     string ID (i.e., an index into the font's 'name' table) associated
+   *     with it.  The font can tell the user that, for example,
+   *     [Weight=700,Width=110] is 'Bold'.  Another name for 'named instance'
+   *     is 'named style'.
+   *
+   *       Adobe MM fonts don't have named instances.
+   *
+   *   * The 'default instance' of a variation font is that instance for
+   *     which the nth axis coordinate is equal to the nth default axis
+   *     coordinate (i.e., `axis[n].def` as specified in the @FT_MM_Var
+   *     structure), with~n covering all axes.  In TrueType GX and OpenType
+   *     Font Variations, the default instance is explicitly given.  In Adobe
+   *     MM fonts, the `WeightVector` entry as found in the font file is
+   *     taken as the default instance.
+   *
+   *       For TrueType GX and OpenType Font Variations, FreeType synthesizes
+   *       a named instance for the default instance if the font does not
+   *       contain such an entry.
+   *
+   *   * 'Design coordinates' are the axis values found in a variation font
+   *      file.  Their meaning is specified by the font designer and the
+   *      values are rather arbitrary.
+   *
+   *       For example, the 'weight' axis in design coordinates might vary
+   *       between 100 (thin) and 900 (heavy) in font~A, while font~B
+   *       contains values between 400 (normal) and 800 (extra bold).
+   *
+   *   * 'Normalized coordinates' are design coordinates mapped to a standard
+   *     range; they are also called 'blend coordinates'.
+   *
+   *       For TrueType GX and OpenType Font Variations, the range is [-1;1],
+   *       with the minimum mapped to value~-1, the default mapped to
+   *       value~0, and the maximum mapped to value~1, and all other
+   *       coordinates mapped to intervening points.  Please look up the
+   *       [OpenType
+   *       specification](https://learn.microsoft.com/en-us/typography/opentype/spec/otvaroverview)
+   *       on how this mapping works in detail.
+   *
+   *       For Adobe MM fonts, this standard range is [0;1], with the minimum
+   *       mapped to value~0 and the maximum mapped to value~1, and all other
+   *       coordinates mapped to intervening points.  Please look up [Adobe
+   *       TechNote
+   *       #5015](https://adobe-type-tools.github.io/font-tech-notes/pdfs/5015.Type1_Supp.pdf)
+   *       on how this mapping works in detail.
+   *
+   *       Assuming that the two fonts in the previous example are OpenType
+   *       Font Variations, both font~A's [100;900] and font~B's [400;800]
+   *       coordinate ranges get mapped to [-1;1].
    */
 
 
@@ -64,14 +119,14 @@ FT_BEGIN_HEADER
    *   T1_MAX_MM_XXX
    *
    * @description:
-   *   Multiple Masters limits as defined in their specifications.
+   *   Adobe MM font limits as defined in their specifications.
    *
    * @values:
    *   T1_MAX_MM_AXIS ::
-   *     The maximum number of Multiple Masters axes.
+   *     The maximum number of Adobe MM font axes.
    *
    *   T1_MAX_MM_DESIGNS ::
-   *     The maximum number of Multiple Masters designs.
+   *     The maximum number of Adobe MM font designs.
    *
    *   T1_MAX_MM_MAP_POINTS ::
    *     The maximum number of elements in a design map.
@@ -88,11 +143,10 @@ FT_BEGIN_HEADER
    *   FT_MM_Axis
    *
    * @description:
-   *   A structure to model a given axis in design space for Multiple Masters
-   *   fonts.
+   *   A structure to model a given axis in design space for Adobe MM fonts.
    *
-   *   This structure can't be used for TrueType GX or OpenType variation
-   *   fonts.
+   *   This structure can't be used with TrueType GX or OpenType Font
+   *   Variations.
    *
    * @fields:
    *   name ::
@@ -119,17 +173,17 @@ FT_BEGIN_HEADER
    *   FT_Multi_Master
    *
    * @description:
-   *   A structure to model the axes and space of a Multiple Masters font.
+   *   A structure to model the axes and space of an Adobe MM font.
    *
-   *   This structure can't be used for TrueType GX or OpenType variation
-   *   fonts.
+   *   This structure can't be used with TrueType GX or OpenType Font
+   *   Variations.
    *
    * @fields:
    *   num_axis ::
    *     Number of axes.  Cannot exceed~4.
    *
    *   num_designs ::
-   *     Number of designs; should be normally 2^num_axis even though the
+   *     Number of designs; should be normally `2^num_axis` even though the
    *     Type~1 specification strangely allows for intermediate designs to be
    *     present.  This number cannot exceed~16.
    *
@@ -151,13 +205,13 @@ FT_BEGIN_HEADER
    *   FT_Var_Axis
    *
    * @description:
-   *   A structure to model a given axis in design space for Multiple
-   *   Masters, TrueType GX, and OpenType variation fonts.
+   *   A structure to model a given axis in design space for Adobe MM fonts,
+   *   TrueType GX, and OpenType Font Variations.
    *
    * @fields:
    *   name ::
    *     The axis's name.  Not always meaningful for TrueType GX or OpenType
-   *     variation fonts.
+   *     Font Variations.
    *
    *   minimum ::
    *     The axis's minimum design coordinate.
@@ -171,17 +225,17 @@ FT_BEGIN_HEADER
    *
    *   tag ::
    *     The axis's tag (the equivalent to 'name' for TrueType GX and
-   *     OpenType variation fonts).  FreeType provides default values for
+   *     OpenType Font Variations).  FreeType provides default values for
    *     Adobe MM fonts if possible.
    *
    *   strid ::
    *     The axis name entry in the font's 'name' table.  This is another
    *     (and often better) version of the 'name' field for TrueType GX or
-   *     OpenType variation fonts.  Not meaningful for Adobe MM fonts.
+   *     OpenType Font Variations.  Not meaningful for Adobe MM fonts.
    *
    * @note:
    *   The fields `minimum`, `def`, and `maximum` are 16.16 fractional values
-   *   for TrueType GX and OpenType variation fonts.  For Adobe MM fonts, the
+   *   for TrueType GX and OpenType Font Variations.  For Adobe MM fonts, the
    *   values are whole numbers (i.e., the fractional part is zero).
    */
   typedef struct  FT_Var_Axis_
@@ -205,7 +259,7 @@ FT_BEGIN_HEADER
    *
    * @description:
    *   A structure to model a named instance in a TrueType GX or OpenType
-   *   variation font.
+   *   Font Variations.
    *
    *   This structure can't be used for Adobe MM fonts.
    *
@@ -215,11 +269,11 @@ FT_BEGIN_HEADER
    *     entry for each axis.
    *
    *   strid ::
-   *     The entry in 'name' table identifying this instance.
+   *     An index into the 'name' table identifying this instance.
    *
    *   psid ::
-   *     The entry in 'name' table identifying a PostScript name for this
-   *     instance.  Value 0xFFFF indicates a missing entry.
+   *     An index into the 'name' table identifying a PostScript name for
+   *     this instance.  Value 0xFFFF indicates a missing entry.
    */
   typedef struct  FT_Var_Named_Style_
   {
@@ -236,39 +290,33 @@ FT_BEGIN_HEADER
    *   FT_MM_Var
    *
    * @description:
-   *   A structure to model the axes and space of an Adobe MM, TrueType GX,
-   *   or OpenType variation font.
+   *   A structure to model the axes and space of Adobe MM fonts, TrueType
+   *   GX, or OpenType Font Variations.
    *
    *   Some fields are specific to one format and not to the others.
    *
    * @fields:
    *   num_axis ::
    *     The number of axes.  The maximum value is~4 for Adobe MM fonts; no
-   *     limit in TrueType GX or OpenType variation fonts.
+   *     limit in TrueType GX or OpenType Font Variations.
    *
    *   num_designs ::
-   *     The number of designs; should be normally 2^num_axis for Adobe MM
-   *     fonts.  Not meaningful for TrueType GX or OpenType variation fonts
+   *     The number of designs; should be normally `2^num_axis` for Adobe MM
+   *     fonts.  Not meaningful for TrueType GX or OpenType Font Variations
    *     (where every glyph could have a different number of designs).
    *
    *   num_namedstyles ::
-   *     The number of named styles; a 'named style' is a tuple of design
-   *     coordinates that has a string ID (in the 'name' table) associated
-   *     with it.  The font can tell the user that, for example,
-   *     [Weight=1.5,Width=1.1] is 'Bold'.  Another name for 'named style' is
-   *     'named instance'.
-   *
-   *     For Adobe Multiple Masters fonts, this value is always zero because
-   *     the format does not support named styles.
+   *     The number of named instances.  For Adobe MM fonts, this value is
+   *     always zero.
    *
    *   axis ::
-   *     An axis descriptor table.  TrueType GX and OpenType variation fonts
+   *     An axis descriptor table.  TrueType GX and OpenType Font Variations
    *     contain slightly more data than Adobe MM fonts.  Memory management
    *     of this pointer is done internally by FreeType.
    *
    *   namedstyle ::
-   *     A named style (instance) table.  Only meaningful for TrueType GX and
-   *     OpenType variation fonts.  Memory management of this pointer is done
+   *     An array of named instances.  Only meaningful for TrueType GX and
+   *     OpenType Font Variations.  Memory management of this pointer is done
    *     internally by FreeType.
    */
   typedef struct  FT_MM_Var_
@@ -290,8 +338,8 @@ FT_BEGIN_HEADER
    * @description:
    *   Retrieve a variation descriptor of a given Adobe MM font.
    *
-   *   This function can't be used with TrueType GX or OpenType variation
-   *   fonts.
+   *   This function can't be used with TrueType GX or OpenType Font
+   *   Variations.
    *
    * @input:
    *   face ::
@@ -299,7 +347,7 @@ FT_BEGIN_HEADER
    *
    * @output:
    *   amaster ::
-   *     The Multiple Masters descriptor.
+   *     The Adobe MM font's variation descriptor.
    *
    * @return:
    *   FreeType error code.  0~means success.
@@ -366,8 +414,8 @@ FT_BEGIN_HEADER
    *   For Adobe MM fonts, choose an interpolated font design through design
    *   coordinates.
    *
-   *   This function can't be used with TrueType GX or OpenType variation
-   *   fonts.
+   *   This function can't be used with TrueType GX or OpenType Font
+   *   Variations.
    *
    * @inout:
    *   face ::
@@ -391,8 +439,8 @@ FT_BEGIN_HEADER
    *
    *   [Since 2.9] If `num_coords` is larger than zero, this function sets
    *   the @FT_FACE_FLAG_VARIATION bit in @FT_Face's `face_flags` field
-   *   (i.e., @FT_IS_VARIATION will return true).  If `num_coords` is zero,
-   *   this bit flag gets unset.
+   *   (i.e., @FT_IS_VARIATION returns true).  If `num_coords` is zero, this
+   *   bit flag gets unset.
    */
   FT_EXPORT( FT_Error )
   FT_Set_MM_Design_Coordinates( FT_Face   face,
@@ -428,7 +476,7 @@ FT_BEGIN_HEADER
    *
    * @note:
    *   The design coordinates are 16.16 fractional values for TrueType GX and
-   *   OpenType variation fonts.  For Adobe MM fonts, the values are supposed
+   *   OpenType Font Variations.  For Adobe MM fonts, the values are supposed
    *   to be whole numbers (i.e., the fractional part is zero).
    *
    *   [Since 2.8.1] To reset all axes to the default values, call the
@@ -438,8 +486,14 @@ FT_BEGIN_HEADER
    *
    *   [Since 2.9] If `num_coords` is larger than zero, this function sets
    *   the @FT_FACE_FLAG_VARIATION bit in @FT_Face's `face_flags` field
-   *   (i.e., @FT_IS_VARIATION will return true).  If `num_coords` is zero,
-   *   this bit flag gets unset.
+   *   (i.e., @FT_IS_VARIATION returns true).  If `num_coords` is zero, this
+   *   bit flag gets unset.
+   *
+   *   [Since 2.14] This function also sets the @FT_FACE_FLAG_VARIATION bit
+   *   in @FT_Face's `face_flags` field (i.e., @FT_IS_VARIATION returns
+   *   true) if any of the provided coordinates is different from the face's
+   *   default value for the corresponding axis, that is, the set up face is
+   *   not at its default position.
    */
   FT_EXPORT( FT_Error )
   FT_Set_Var_Design_Coordinates( FT_Face    face,
@@ -468,14 +522,14 @@ FT_BEGIN_HEADER
    *
    * @output:
    *   coords ::
-   *     The design coordinates array.
+   *     The design coordinates array, which must be allocated by the user.
    *
    * @return:
    *   FreeType error code.  0~means success.
    *
    * @note:
    *   The design coordinates are 16.16 fractional values for TrueType GX and
-   *   OpenType variation fonts.  For Adobe MM fonts, the values are whole
+   *   OpenType Font Variations.  For Adobe MM fonts, the values are whole
    *   numbers (i.e., the fractional part is zero).
    *
    * @since:
@@ -493,8 +547,7 @@ FT_BEGIN_HEADER
    *   FT_Set_MM_Blend_Coordinates
    *
    * @description:
-   *   Choose an interpolated font design through normalized blend
-   *   coordinates.
+   *   Choose an interpolated font design through normalized coordinates.
    *
    *   This function works with all supported variation formats.
    *
@@ -509,9 +562,10 @@ FT_BEGIN_HEADER
    *     the number of axes, use default values for the remaining axes.
    *
    *   coords ::
-   *     The design coordinates array.  Each element is a 16.16 fractional
-   *     value and must be between 0 and 1.0 for Adobe MM fonts, and between
-   *     -1.0 and 1.0 for TrueType GX and OpenType variation fonts.
+   *     The normalized coordinates array.  Each element is a 16.16
+   *     fractional value and must be between 0 and 1.0 for Adobe MM fonts,
+   *     and between -1.0 and 1.0 for TrueType GX and OpenType Font
+   *     Variations.
    *
    * @return:
    *   FreeType error code.  0~means success.
@@ -524,8 +578,14 @@ FT_BEGIN_HEADER
    *
    *   [Since 2.9] If `num_coords` is larger than zero, this function sets
    *   the @FT_FACE_FLAG_VARIATION bit in @FT_Face's `face_flags` field
-   *   (i.e., @FT_IS_VARIATION will return true).  If `num_coords` is zero,
-   *   this bit flag gets unset.
+   *   (i.e., @FT_IS_VARIATION returns true).  If `num_coords` is zero, this
+   *   bit flag gets unset.
+   *
+   *   [Since 2.14] This function also sets the @FT_FACE_FLAG_VARIATION bit
+   *   in @FT_Face's `face_flags` field (i.e., @FT_IS_VARIATION returns
+   *   true) if any of the provided coordinates is different from the face's
+   *   default value for the corresponding axis, that is, the set up face is
+   *   not at its default position.
    */
   FT_EXPORT( FT_Error )
   FT_Set_MM_Blend_Coordinates( FT_Face    face,
@@ -539,8 +599,8 @@ FT_BEGIN_HEADER
    *   FT_Get_MM_Blend_Coordinates
    *
    * @description:
-   *   Get the normalized blend coordinates of the currently selected
-   *   interpolated font.
+   *   Get the normalized coordinates of the currently selected interpolated
+   *   font.
    *
    *   This function works with all supported variation formats.
    *
@@ -549,14 +609,14 @@ FT_BEGIN_HEADER
    *     A handle to the source face.
    *
    *   num_coords ::
-   *     The number of normalized blend coordinates to retrieve.  If it is
-   *     larger than the number of axes, set the excess values to~0.5 for
-   *     Adobe MM fonts, and to~0 for TrueType GX and OpenType variation
-   *     fonts.
+   *     The number of normalized coordinates to retrieve.  If it is larger
+   *     than the number of axes, set the excess values to~0.5 for Adobe MM
+   *     fonts, and to~0 for TrueType GX and OpenType Font Variations.
    *
    * @output:
    *   coords ::
-   *     The normalized blend coordinates array (as 16.16 fractional values).
+   *     The normalized coordinates array (as 16.16 fractional values), which
+   *     must be allocated by the user.
    *
    * @return:
    *   FreeType error code.  0~means success.
@@ -610,8 +670,8 @@ FT_BEGIN_HEADER
    *   For Adobe MM fonts, choose an interpolated font design by directly
    *   setting the weight vector.
    *
-   *   This function can't be used with TrueType GX or OpenType variation
-   *   fonts.
+   *   This function can't be used with TrueType GX or OpenType Font
+   *   Variations.
    *
    * @inout:
    *   face ::
@@ -630,16 +690,16 @@ FT_BEGIN_HEADER
    *   FreeType error code.  0~means success.
    *
    * @note:
-   *   Adobe Multiple Master fonts limit the number of designs, and thus the
-   *   length of the weight vector to 16~elements.
+   *   Adobe MM fonts limit the number of designs, and thus the length of the
+   *   weight vector, to 16~elements.
    *
    *   If `len` is larger than zero, this function sets the
    *   @FT_FACE_FLAG_VARIATION bit in @FT_Face's `face_flags` field (i.e.,
-   *   @FT_IS_VARIATION will return true).  If `len` is zero, this bit flag
-   *   is unset and the weight vector array is reset to the default values.
+   *   @FT_IS_VARIATION returns true).  If `len` is zero, this bit flag is
+   *   unset and the weight vector array is reset to the default values.
    *
    *   The Adobe documentation also states that the values in the
-   *   WeightVector array must total 1.0 +/-~0.001.  In practice this does
+   *   `WeightVector` array must total 1.0 +/-~0.001.  In practice this does
    *   not seem to be enforced, so is not enforced here, either.
    *
    * @since:
@@ -659,8 +719,8 @@ FT_BEGIN_HEADER
    * @description:
    *   For Adobe MM fonts, retrieve the current weight vector of the font.
    *
-   *   This function can't be used with TrueType GX or OpenType variation
-   *   fonts.
+   *   This function can't be used with TrueType GX or OpenType Font
+   *   Variations.
    *
    * @inout:
    *   face ::
@@ -677,14 +737,14 @@ FT_BEGIN_HEADER
    *
    * @output:
    *   weightvector ::
-   *     An array to be filled.
+   *     An array to be filled; it must be allocated by the user.
    *
    * @return:
    *   FreeType error code.  0~means success.
    *
    * @note:
-   *   Adobe Multiple Master fonts limit the number of designs, and thus the
-   *   length of the WeightVector to~16.
+   *   Adobe MM fonts limit the number of designs, and thus the length of the
+   *   weight vector, to~16 elements.
    *
    * @since:
    *   2.10
@@ -760,8 +820,8 @@ FT_BEGIN_HEADER
    *     A handle to the source face.
    *
    *   instance_index ::
-   *     The index of the requested instance, starting with value 1.  If set
-   *     to value 0, FreeType switches to font access without a named
+   *     The index of the requested instance, starting with value~1.  If set
+   *     to value~0, FreeType switches to font access without a named
    *     instance.
    *
    * @return:
@@ -771,11 +831,11 @@ FT_BEGIN_HEADER
    *   The function uses the value of `instance_index` to set bits 16-30 of
    *   the face's `face_index` field.  It also resets any variation applied
    *   to the font, and the @FT_FACE_FLAG_VARIATION bit of the face's
-   *   `face_flags` field gets reset to zero (i.e., @FT_IS_VARIATION will
-   *   return false).
+   *   `face_flags` field gets reset to zero (i.e., @FT_IS_VARIATION returns
+   *   false).
    *
-   *   For Adobe MM fonts (which don't have named instances) this function
-   *   simply resets the current face to the default instance.
+   *   For Adobe MM fonts, this function resets the current face to the
+   *   default instance.
    *
    * @since:
    *   2.9
@@ -794,10 +854,6 @@ FT_BEGIN_HEADER
    *   Retrieve the index of the default named instance, to be used with
    *   @FT_Set_Named_Instance.
    *
-   *   The default instance of a variation font is that instance for which
-   *   the nth axis coordinate is equal to `axis[n].def` (as specified in the
-   *   @FT_MM_Var structure), with~n covering all axes.
-   *
    *   FreeType synthesizes a named instance for the default instance if the
    *   font does not contain such an entry.
    *
@@ -813,8 +869,8 @@ FT_BEGIN_HEADER
    *   FreeType error code.  0~means success.
    *
    * @note:
-   *   For Adobe MM fonts (which don't have named instances) this function
-   *   always returns zero for `instance_index`.
+   *   For Adobe MM fonts, this function always returns zero for
+   *   `instance_index`.
    *
    * @since:
    *   2.13.1
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/ftmodapi.h b/src/java.desktop/share/native/libfreetype/include/freetype/ftmodapi.h
index 0ee715898f7..2669e4a03b3 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/ftmodapi.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/ftmodapi.h
@@ -4,7 +4,7 @@
  *
  *   FreeType modules public interface (specification).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/ftmoderr.h b/src/java.desktop/share/native/libfreetype/include/freetype/ftmoderr.h
index 6722fbf8b70..8e2ef2f01f8 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/ftmoderr.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/ftmoderr.h
@@ -4,7 +4,7 @@
  *
  *   FreeType module error offsets (specification).
  *
- * Copyright (C) 2001-2024 by
+ * Copyright (C) 2001-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/ftoutln.h b/src/java.desktop/share/native/libfreetype/include/freetype/ftoutln.h
index 44e94b4f5bb..2545ca8486b 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/ftoutln.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/ftoutln.h
@@ -5,7 +5,7 @@
  *   Support for the FT_Outline type used to store glyph shapes of
  *   most scalable font formats (specification).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/ftparams.h b/src/java.desktop/share/native/libfreetype/include/freetype/ftparams.h
index 43bf69c202f..2c09db1683e 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/ftparams.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/ftparams.h
@@ -4,7 +4,7 @@
  *
  *   FreeType API for possible FT_Parameter tags (specification only).
  *
- * Copyright (C) 2017-2024 by
+ * Copyright (C) 2017-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/ftrender.h b/src/java.desktop/share/native/libfreetype/include/freetype/ftrender.h
index dc5018a1b54..cc3102073b1 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/ftrender.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/ftrender.h
@@ -4,7 +4,7 @@
  *
  *   FreeType renderer modules public interface (specification).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/ftsizes.h b/src/java.desktop/share/native/libfreetype/include/freetype/ftsizes.h
index 4ef5c7955df..fdb89f24ccc 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/ftsizes.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/ftsizes.h
@@ -4,7 +4,7 @@
  *
  *   FreeType size objects management (specification).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/ftsnames.h b/src/java.desktop/share/native/libfreetype/include/freetype/ftsnames.h
index d5d5cd93103..99728574db6 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/ftsnames.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/ftsnames.h
@@ -7,7 +7,7 @@
  *
  *   This is _not_ used to retrieve glyph names!
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/ftstroke.h b/src/java.desktop/share/native/libfreetype/include/freetype/ftstroke.h
index 41626dc9d7b..2c4761c768d 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/ftstroke.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/ftstroke.h
@@ -4,7 +4,7 @@
  *
  *   FreeType path stroker (specification).
  *
- * Copyright (C) 2002-2024 by
+ * Copyright (C) 2002-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/ftsynth.h b/src/java.desktop/share/native/libfreetype/include/freetype/ftsynth.h
index 43081b6c330..93499a4b4f1 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/ftsynth.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/ftsynth.h
@@ -5,7 +5,7 @@
  *   FreeType synthesizing code for emboldening and slanting
  *   (specification).
  *
- * Copyright (C) 2000-2024 by
+ * Copyright (C) 2000-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/ftsystem.h b/src/java.desktop/share/native/libfreetype/include/freetype/ftsystem.h
index 1eacb3af398..1de9f8e603d 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/ftsystem.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/ftsystem.h
@@ -4,7 +4,7 @@
  *
  *   FreeType low-level system interface definition (specification).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/fttrigon.h b/src/java.desktop/share/native/libfreetype/include/freetype/fttrigon.h
index a5299e938d4..ed7bd06a78f 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/fttrigon.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/fttrigon.h
@@ -4,7 +4,7 @@
  *
  *   FreeType trigonometric functions (specification).
  *
- * Copyright (C) 2001-2024 by
+ * Copyright (C) 2001-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/fttypes.h b/src/java.desktop/share/native/libfreetype/include/freetype/fttypes.h
index 27815143a64..e207c5ebe09 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/fttypes.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/fttypes.h
@@ -4,7 +4,7 @@
  *
  *   FreeType simple types definitions (specification only).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/internal/autohint.h b/src/java.desktop/share/native/libfreetype/include/freetype/internal/autohint.h
index 8865d53b389..987e704e9b0 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/internal/autohint.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/internal/autohint.h
@@ -4,7 +4,7 @@
  *
  *   High-level 'autohint' module-specific interface (specification).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/internal/cffotypes.h b/src/java.desktop/share/native/libfreetype/include/freetype/internal/cffotypes.h
index 36b0390a5a5..26ee43bb9a9 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/internal/cffotypes.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/internal/cffotypes.h
@@ -4,7 +4,7 @@
  *
  *   Basic OpenType/CFF object type definitions (specification).
  *
- * Copyright (C) 2017-2024 by
+ * Copyright (C) 2017-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/internal/cfftypes.h b/src/java.desktop/share/native/libfreetype/include/freetype/internal/cfftypes.h
index ef2e8e7569c..62335db4834 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/internal/cfftypes.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/internal/cfftypes.h
@@ -5,7 +5,7 @@
  *   Basic OpenType/CFF type definitions and interface (specification
  *   only).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/internal/compiler-macros.h b/src/java.desktop/share/native/libfreetype/include/freetype/internal/compiler-macros.h
index 876f66e2561..e6d0166d888 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/internal/compiler-macros.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/internal/compiler-macros.h
@@ -4,7 +4,7 @@
  *
  *   Compiler-specific macro definitions used internally by FreeType.
  *
- * Copyright (C) 2020-2024 by
+ * Copyright (C) 2020-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
@@ -128,8 +128,8 @@ FT_BEGIN_HEADER
    * before a function declaration.
    */
 
-  /* Visual C, mingw */
-#if defined( _WIN32 )
+  /* Visual C, MinGW, Cygwin */
+#if defined( _WIN32 ) || defined( __CYGWIN__ )
 #define FT_INTERNAL_FUNCTION_ATTRIBUTE  /* empty */
 
   /* gcc, clang */
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/internal/ftcalc.h b/src/java.desktop/share/native/libfreetype/include/freetype/internal/ftcalc.h
index 71128a2df90..16a732224ef 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/internal/ftcalc.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/internal/ftcalc.h
@@ -4,7 +4,7 @@
  *
  *   Arithmetic computations (specification).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
@@ -27,17 +27,87 @@
 FT_BEGIN_HEADER
 
 
+  /*
+   * The following macros have two purposes.
+   *
+   * - Tag places where overflow is expected and harmless.
+   *
+   * - Avoid run-time undefined behavior sanitizer errors.
+   *
+   * Use with care!
+   */
+#define ADD_INT( a, b )                           \
+          (FT_Int)( (FT_UInt)(a) + (FT_UInt)(b) )
+#define SUB_INT( a, b )                           \
+          (FT_Int)( (FT_UInt)(a) - (FT_UInt)(b) )
+#define MUL_INT( a, b )                           \
+          (FT_Int)( (FT_UInt)(a) * (FT_UInt)(b) )
+#define NEG_INT( a )                              \
+          (FT_Int)( (FT_UInt)0 - (FT_UInt)(a) )
+
+#define ADD_LONG( a, b )                             \
+          (FT_Long)( (FT_ULong)(a) + (FT_ULong)(b) )
+#define SUB_LONG( a, b )                             \
+          (FT_Long)( (FT_ULong)(a) - (FT_ULong)(b) )
+#define MUL_LONG( a, b )                             \
+          (FT_Long)( (FT_ULong)(a) * (FT_ULong)(b) )
+#define NEG_LONG( a )                                \
+          (FT_Long)( (FT_ULong)0 - (FT_ULong)(a) )
+
+#define ADD_INT32( a, b )                               \
+          (FT_Int32)( (FT_UInt32)(a) + (FT_UInt32)(b) )
+#define SUB_INT32( a, b )                               \
+          (FT_Int32)( (FT_UInt32)(a) - (FT_UInt32)(b) )
+#define MUL_INT32( a, b )                               \
+          (FT_Int32)( (FT_UInt32)(a) * (FT_UInt32)(b) )
+#define NEG_INT32( a )                                  \
+          (FT_Int32)( (FT_UInt32)0 - (FT_UInt32)(a) )
+
+#ifdef FT_INT64
+
+#define ADD_INT64( a, b )                               \
+          (FT_Int64)( (FT_UInt64)(a) + (FT_UInt64)(b) )
+#define SUB_INT64( a, b )                               \
+          (FT_Int64)( (FT_UInt64)(a) - (FT_UInt64)(b) )
+#define MUL_INT64( a, b )                               \
+          (FT_Int64)( (FT_UInt64)(a) * (FT_UInt64)(b) )
+#define NEG_INT64( a )                                  \
+          (FT_Int64)( (FT_UInt64)0 - (FT_UInt64)(a) )
+
+#endif /* FT_INT64 */
+
+
   /**************************************************************************
    *
    * FT_MulDiv() and FT_MulFix() are declared in freetype.h.
    *
    */
 
-#ifndef  FT_CONFIG_OPTION_NO_ASSEMBLER
-  /* Provide assembler fragments for performance-critical functions. */
-  /* These must be defined `static __inline__' with GCC.             */
+#ifdef FT_CONFIG_OPTION_INLINE_MULFIX
 
-#if defined( __CC_ARM ) || defined( __ARMCC__ )  /* RVCT */
+#ifdef FT_INT64
+
+  static inline FT_Long
+  FT_MulFix_64( FT_Long  a,
+                FT_Long  b )
+  {
+    FT_Int64  ab = MUL_INT64( a, b );
+
+
+    ab = ADD_INT64( ab, 0x8000 + ( ab >> 63 ) );  /* rounding phase */
+
+    return (FT_Long)( ab >> 16 );
+  }
+
+
+#define FT_MulFix( a, b )  FT_MulFix_64( a, b )
+
+#elif !defined( FT_CONFIG_OPTION_NO_ASSEMBLER )
+  /* Provide 32-bit assembler fragments for optimized FT_MulFix. */
+  /* These must be defined `static __inline__' or similar.       */
+
+#if defined( __arm__ )                                 && \
+    ( defined( __thumb2__ ) || !defined( __thumb__ ) )
 
 #define FT_MULFIX_ASSEMBLER  FT_MulFix_arm
 
@@ -49,6 +119,7 @@ FT_BEGIN_HEADER
   {
     FT_Int32  t, t2;
 
+#if defined( __CC_ARM ) || defined( __ARMCC__ )  /* RVCT */
 
     __asm
     {
@@ -60,28 +131,8 @@ FT_BEGIN_HEADER
       mov   a,  t2, lsr #16         /* a   = t2 >> 16 */
       orr   a,  a,  t,  lsl #16     /* a  |= t << 16 */
     }
-    return a;
-  }
-
-#endif /* __CC_ARM || __ARMCC__ */
-
-
-#ifdef __GNUC__
-
-#if defined( __arm__ )                                 && \
-    ( !defined( __thumb__ ) || defined( __thumb2__ ) ) && \
-    !( defined( __CC_ARM ) || defined( __ARMCC__ ) )
-
-#define FT_MULFIX_ASSEMBLER  FT_MulFix_arm
-
-  /* documentation is in freetype.h */
-
-  static __inline__ FT_Int32
-  FT_MulFix_arm( FT_Int32  a,
-                 FT_Int32  b )
-  {
-    FT_Int32  t, t2;
 
+#elif defined( __GNUC__ )
 
     __asm__ __volatile__ (
       "smull  %1, %2, %4, %3\n\t"       /* (lo=%1,hi=%2) = a*b */
@@ -98,26 +149,25 @@ FT_BEGIN_HEADER
       : "=r"(a), "=&r"(t2), "=&r"(t)
       : "r"(a), "r"(b)
       : "cc" );
+
+#endif
+
     return a;
   }
 
-#endif /* __arm__                      && */
-       /* ( __thumb2__ || !__thumb__ ) && */
-       /* !( __CC_ARM || __ARMCC__ )      */
-
-
-#if defined( __i386__ )
+#elif defined( __i386__ ) || defined( _M_IX86 )
 
 #define FT_MULFIX_ASSEMBLER  FT_MulFix_i386
 
   /* documentation is in freetype.h */
 
-  static __inline__ FT_Int32
+  static __inline FT_Int32
   FT_MulFix_i386( FT_Int32  a,
                   FT_Int32  b )
   {
     FT_Int32  result;
 
+#if defined( __GNUC__ )
 
     __asm__ __volatile__ (
       "imul  %%edx\n"
@@ -132,27 +182,8 @@ FT_BEGIN_HEADER
       : "=a"(result), "=d"(b)
       : "a"(a), "d"(b)
       : "%ecx", "cc" );
-    return result;
-  }
 
-#endif /* i386 */
-
-#endif /* __GNUC__ */
-
-
-#ifdef _MSC_VER /* Visual C++ */
-
-#ifdef _M_IX86
-
-#define FT_MULFIX_ASSEMBLER  FT_MulFix_i386
-
-  /* documentation is in freetype.h */
-
-  static __inline FT_Int32
-  FT_MulFix_i386( FT_Int32  a,
-                  FT_Int32  b )
-  {
-    FT_Int32  result;
+#elif defined( _MSC_VER )
 
     __asm
     {
@@ -169,81 +200,21 @@ FT_BEGIN_HEADER
       add eax, edx
       mov result, eax
     }
+
+#endif
+
     return result;
   }
 
-#endif /* _M_IX86 */
+#endif /* __i386__ || _M_IX86 */
 
-#endif /* _MSC_VER */
-
-
-#if defined( __GNUC__ ) && defined( __x86_64__ )
-
-#define FT_MULFIX_ASSEMBLER  FT_MulFix_x86_64
-
-  static __inline__ FT_Int32
-  FT_MulFix_x86_64( FT_Int32  a,
-                    FT_Int32  b )
-  {
-    /* Temporarily disable the warning that C90 doesn't support */
-    /* `long long'.                                             */
-#if __GNUC__ > 4 || ( __GNUC__ == 4 && __GNUC_MINOR__ >= 6 )
-#pragma GCC diagnostic push
-#pragma GCC diagnostic ignored "-Wlong-long"
-#endif
-
-#if 1
-    /* Technically not an assembly fragment, but GCC does a really good */
-    /* job at inlining it and generating good machine code for it.      */
-    long long  ret, tmp;
-
-
-    ret  = (long long)a * b;
-    tmp  = ret >> 63;
-    ret += 0x8000 + tmp;
-
-    return (FT_Int32)( ret >> 16 );
-#else
-
-    /* For some reason, GCC 4.6 on Ubuntu 12.04 generates invalid machine  */
-    /* code from the lines below.  The main issue is that `wide_a' is not  */
-    /* properly initialized by sign-extending `a'.  Instead, the generated */
-    /* machine code assumes that the register that contains `a' on input   */
-    /* can be used directly as a 64-bit value, which is wrong most of the  */
-    /* time.                                                               */
-    long long  wide_a = (long long)a;
-    long long  wide_b = (long long)b;
-    long long  result;
-
-
-    __asm__ __volatile__ (
-      "imul %2, %1\n"
-      "mov %1, %0\n"
-      "sar $63, %0\n"
-      "lea 0x8000(%1, %0), %0\n"
-      "sar $16, %0\n"
-      : "=&r"(result), "=&r"(wide_a)
-      : "r"(wide_b)
-      : "cc" );
-
-    return (FT_Int32)result;
-#endif
-
-#if __GNUC__ > 4 || ( __GNUC__ == 4 && __GNUC_MINOR__ >= 6 )
-#pragma GCC diagnostic pop
-#endif
-  }
-
-#endif /* __GNUC__ && __x86_64__ */
-
-#endif /* !FT_CONFIG_OPTION_NO_ASSEMBLER */
-
-
-#ifdef FT_CONFIG_OPTION_INLINE_MULFIX
 #ifdef FT_MULFIX_ASSEMBLER
 #define FT_MulFix( a, b )  FT_MULFIX_ASSEMBLER( (FT_Int32)(a), (FT_Int32)(b) )
 #endif
-#endif
+
+#endif /* !FT_CONFIG_OPTION_NO_ASSEMBLER */
+
+#endif /* FT_CONFIG_OPTION_INLINE_MULFIX */
 
 
   /**************************************************************************
@@ -278,40 +249,6 @@ FT_BEGIN_HEADER
                       FT_Long  c );
 
 
-  /**************************************************************************
-   *
-   * @function:
-   *   FT_MulAddFix
-   *
-   * @description:
-   *   Compute `(s[0] * f[0] + s[1] * f[1] + ...) / 0x10000`, where `s[n]` is
-   *   usually a 16.16 scalar.
-   *
-   * @input:
-   *   s ::
-   *     The array of scalars.
-   *   f ::
-   *     The array of factors.
-   *   count ::
-   *     The number of entries in the array.
-   *
-   * @return:
-   *   The result of `(s[0] * f[0] + s[1] * f[1] + ...) / 0x10000`.
-   *
-   * @note:
-   *   This function is currently used for the scaled delta computation of
-   *   variation stores.  It internally uses 64-bit data types when
-   *   available, otherwise it emulates 64-bit math by using 32-bit
-   *   operations, which produce a correct result but most likely at a slower
-   *   performance in comparison to the implementation base on `int64_t`.
-   *
-   */
-  FT_BASE( FT_Int32 )
-  FT_MulAddFix( FT_Fixed*  s,
-                FT_Int32*  f,
-                FT_UInt    count );
-
-
   /*
    * A variant of FT_Matrix_Multiply which scales its result afterwards.  The
    * idea is that both `a' and `b' are scaled by factors of 10 so that the
@@ -455,6 +392,10 @@ FT_BEGIN_HEADER
 
 #define FT_MSB( x )  FT_MSB_i386( x )
 
+#elif defined( __CC_ARM )
+
+#define FT_MSB( x )  ( 31 - __clz( x ) )
+
 #elif defined( __SunOS_5_11 )
 
 #include <string.h>
@@ -526,55 +467,6 @@ FT_BEGIN_HEADER
 
 #define ROUND_F26DOT6( x )     ( ( (x) + 32 - ( x < 0 ) ) & -64 )
 
-  /*
-   * The following macros have two purposes.
-   *
-   * - Tag places where overflow is expected and harmless.
-   *
-   * - Avoid run-time sanitizer errors.
-   *
-   * Use with care!
-   */
-#define ADD_INT( a, b )                           \
-          (FT_Int)( (FT_UInt)(a) + (FT_UInt)(b) )
-#define SUB_INT( a, b )                           \
-          (FT_Int)( (FT_UInt)(a) - (FT_UInt)(b) )
-#define MUL_INT( a, b )                           \
-          (FT_Int)( (FT_UInt)(a) * (FT_UInt)(b) )
-#define NEG_INT( a )                              \
-          (FT_Int)( (FT_UInt)0 - (FT_UInt)(a) )
-
-#define ADD_LONG( a, b )                             \
-          (FT_Long)( (FT_ULong)(a) + (FT_ULong)(b) )
-#define SUB_LONG( a, b )                             \
-          (FT_Long)( (FT_ULong)(a) - (FT_ULong)(b) )
-#define MUL_LONG( a, b )                             \
-          (FT_Long)( (FT_ULong)(a) * (FT_ULong)(b) )
-#define NEG_LONG( a )                                \
-          (FT_Long)( (FT_ULong)0 - (FT_ULong)(a) )
-
-#define ADD_INT32( a, b )                               \
-          (FT_Int32)( (FT_UInt32)(a) + (FT_UInt32)(b) )
-#define SUB_INT32( a, b )                               \
-          (FT_Int32)( (FT_UInt32)(a) - (FT_UInt32)(b) )
-#define MUL_INT32( a, b )                               \
-          (FT_Int32)( (FT_UInt32)(a) * (FT_UInt32)(b) )
-#define NEG_INT32( a )                                  \
-          (FT_Int32)( (FT_UInt32)0 - (FT_UInt32)(a) )
-
-#ifdef FT_INT64
-
-#define ADD_INT64( a, b )                               \
-          (FT_Int64)( (FT_UInt64)(a) + (FT_UInt64)(b) )
-#define SUB_INT64( a, b )                               \
-          (FT_Int64)( (FT_UInt64)(a) - (FT_UInt64)(b) )
-#define MUL_INT64( a, b )                               \
-          (FT_Int64)( (FT_UInt64)(a) * (FT_UInt64)(b) )
-#define NEG_INT64( a )                                  \
-          (FT_Int64)( (FT_UInt64)0 - (FT_UInt64)(a) )
-
-#endif /* FT_INT64 */
-
 
 FT_END_HEADER
 
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/internal/ftdebug.h b/src/java.desktop/share/native/libfreetype/include/freetype/internal/ftdebug.h
index d7fa8dc93cf..d7facf40d12 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/internal/ftdebug.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/internal/ftdebug.h
@@ -4,7 +4,7 @@
  *
  *   Debugging and logging component (specification).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/internal/ftdrv.h b/src/java.desktop/share/native/libfreetype/include/freetype/internal/ftdrv.h
index 5609b3ef12b..24be4dad36b 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/internal/ftdrv.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/internal/ftdrv.h
@@ -4,7 +4,7 @@
  *
  *   FreeType internal font driver interface (specification).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/internal/ftgloadr.h b/src/java.desktop/share/native/libfreetype/include/freetype/internal/ftgloadr.h
index f1c155b162c..8f2a54c015b 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/internal/ftgloadr.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/internal/ftgloadr.h
@@ -4,7 +4,7 @@
  *
  *   The FreeType glyph loader (specification).
  *
- * Copyright (C) 2002-2024 by
+ * Copyright (C) 2002-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/internal/fthash.h b/src/java.desktop/share/native/libfreetype/include/freetype/internal/fthash.h
index 622ec76bb9a..642d21e21c6 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/internal/fthash.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/internal/fthash.h
@@ -117,6 +117,18 @@ FT_BEGIN_HEADER
                       FT_Hash    hash,
                       FT_Memory  memory );
 
+  FT_Error
+  ft_hash_str_insert_no_overwrite( const char*  key,
+                                   size_t       data,
+                                   FT_Hash      hash,
+                                   FT_Memory    memory );
+
+  FT_Error
+  ft_hash_num_insert_no_overwrite( FT_Int     num,
+                                   size_t     data,
+                                   FT_Hash    hash,
+                                   FT_Memory  memory );
+
   size_t*
   ft_hash_str_lookup( const char*  key,
                       FT_Hash      hash );
@@ -125,6 +137,17 @@ FT_BEGIN_HEADER
   ft_hash_num_lookup( FT_Int   num,
                       FT_Hash  hash );
 
+  FT_Bool
+  ft_hash_num_iterator( FT_UInt  *idx,
+                        FT_Int   *key,
+                        size_t   *value,
+                        FT_Hash   hash );
+
+  FT_Bool
+  ft_hash_str_iterator( FT_UInt      *idx,
+                        const char*  *key,
+                        size_t       *value,
+                        FT_Hash       hash );
 
 FT_END_HEADER
 
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/internal/ftmemory.h b/src/java.desktop/share/native/libfreetype/include/freetype/internal/ftmemory.h
index 4e05a29f13a..c75c33f2895 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/internal/ftmemory.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/internal/ftmemory.h
@@ -4,7 +4,7 @@
  *
  *   The FreeType memory management macros (specification).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/internal/ftmmtypes.h b/src/java.desktop/share/native/libfreetype/include/freetype/internal/ftmmtypes.h
index 8449e7a010d..be3747bbf94 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/internal/ftmmtypes.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/internal/ftmmtypes.h
@@ -5,7 +5,7 @@
  *   OpenType Variations type definitions for internal use
  *   with the multi-masters service (specification).
  *
- * Copyright (C) 2022-2024 by
+ * Copyright (C) 2022-2025 by
  * David Turner, Robert Wilhelm, Werner Lemberg, George Williams, and
  * Dominik Röttsches.
  *
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/internal/ftobjs.h b/src/java.desktop/share/native/libfreetype/include/freetype/internal/ftobjs.h
index a1e93298fdb..3db2fe28ffd 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/internal/ftobjs.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/internal/ftobjs.h
@@ -4,7 +4,7 @@
  *
  *   The FreeType private base classes (specification).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
@@ -275,6 +275,28 @@ FT_BEGIN_HEADER
                   FT_GlyphSlot    slot,
                   FT_Render_Mode  mode );
 
+
+  /**************************************************************************
+   *
+   * @Function:
+   *   find_unicode_charmap
+   *
+   * @Description:
+   *   This function finds a Unicode charmap, if there is one.  And if there
+   *   is more than one, it tries to favour the more extensive one, i.e., one
+   *   that supports UCS-4 against those which are limited to the BMP (UCS-2
+   *   encoding.)
+   *
+   *   If a unicode charmap is found, `face->charmap` is set to it.
+   *
+   *   This function is called from `open_face`, from `FT_Select_Charmap(...,
+   *   FT_ENCODING_UNICODE)`, and also from `afadjust.c` in the 'autofit'
+   *   module.
+   */
+  FT_BASE( FT_Error )
+  find_unicode_charmap( FT_Face  face );
+
+
 #ifdef FT_CONFIG_OPTION_SUBPIXEL_RENDERING
 
   typedef void  (*FT_Bitmap_LcdFilterFunc)( FT_Bitmap*      bitmap,
@@ -498,9 +520,9 @@ FT_BEGIN_HEADER
    */
   typedef struct  FT_ModuleRec_
   {
-    FT_Module_Class*  clazz;
-    FT_Library        library;
-    FT_Memory         memory;
+    const FT_Module_Class*  clazz;
+    FT_Library              library;
+    FT_Memory               memory;
 
   } FT_ModuleRec;
 
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/internal/ftpsprop.h b/src/java.desktop/share/native/libfreetype/include/freetype/internal/ftpsprop.h
index 4f11aa16ba1..18a954d22f5 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/internal/ftpsprop.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/internal/ftpsprop.h
@@ -4,7 +4,7 @@
  *
  *   Get and set properties of PostScript drivers (specification).
  *
- * Copyright (C) 2017-2024 by
+ * Copyright (C) 2017-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/internal/ftrfork.h b/src/java.desktop/share/native/libfreetype/include/freetype/internal/ftrfork.h
index 05c1d6c48b5..e077f98bfb9 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/internal/ftrfork.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/internal/ftrfork.h
@@ -4,7 +4,7 @@
  *
  *   Embedded resource forks accessor (specification).
  *
- * Copyright (C) 2004-2024 by
+ * Copyright (C) 2004-2025 by
  * Masatake YAMATO and Redhat K.K.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/internal/ftserv.h b/src/java.desktop/share/native/libfreetype/include/freetype/internal/ftserv.h
index 8c35dbd7139..ce11bba19b2 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/internal/ftserv.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/internal/ftserv.h
@@ -4,7 +4,7 @@
  *
  *   The FreeType services (specification only).
  *
- * Copyright (C) 2003-2024 by
+ * Copyright (C) 2003-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/internal/ftstream.h b/src/java.desktop/share/native/libfreetype/include/freetype/internal/ftstream.h
index fd52f767ef7..20c1dd7c4b0 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/internal/ftstream.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/internal/ftstream.h
@@ -4,7 +4,7 @@
  *
  *   Stream handling (specification).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/internal/fttrace.h b/src/java.desktop/share/native/libfreetype/include/freetype/internal/fttrace.h
index 42595a29ff3..3fd592800e2 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/internal/fttrace.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/internal/fttrace.h
@@ -4,7 +4,7 @@
  *
  *   Tracing handling (specification only).
  *
- * Copyright (C) 2002-2024 by
+ * Copyright (C) 2002-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
@@ -19,7 +19,7 @@
   /* definitions of trace levels for FreeType 2 */
 
   /* the maximum string length (if the argument to `FT_TRACE_DEF` */
-  /* gets used as a string) plus one charachter for ':' plus      */
+  /* gets used as a string) plus one character for ':' plus       */
   /* another one for the trace level                              */
 #define FT_MAX_TRACE_LEVEL_LENGTH  (9 + 1 + 1)
 
@@ -159,6 +159,7 @@ FT_TRACE_DEF( gxvprop )
 FT_TRACE_DEF( gxvtrak )
 
   /* autofit components */
+FT_TRACE_DEF( afadjust )
 FT_TRACE_DEF( afcjk )
 FT_TRACE_DEF( afglobal )
 FT_TRACE_DEF( afhints )
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/internal/ftvalid.h b/src/java.desktop/share/native/libfreetype/include/freetype/internal/ftvalid.h
index a1312f2aba6..03a726c82cb 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/internal/ftvalid.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/internal/ftvalid.h
@@ -4,7 +4,7 @@
  *
  *   FreeType validation support (specification).
  *
- * Copyright (C) 2004-2024 by
+ * Copyright (C) 2004-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/internal/psaux.h b/src/java.desktop/share/native/libfreetype/include/freetype/internal/psaux.h
index 745d2cb56b7..344be0f19a7 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/internal/psaux.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/internal/psaux.h
@@ -5,7 +5,7 @@
  *   Auxiliary functions and data structures related to PostScript fonts
  *   (specification).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/internal/pshints.h b/src/java.desktop/share/native/libfreetype/include/freetype/internal/pshints.h
index dba6c7303fd..96c5d84f058 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/internal/pshints.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/internal/pshints.h
@@ -6,7 +6,7 @@
  *   recorders (specification only).  These are used to support native
  *   T1/T2 hints in the 'type1', 'cid', and 'cff' font drivers.
  *
- * Copyright (C) 2001-2024 by
+ * Copyright (C) 2001-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/internal/services/svbdf.h b/src/java.desktop/share/native/libfreetype/include/freetype/internal/services/svbdf.h
index 89e9c2e5de8..5bd51da23f4 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/internal/services/svbdf.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/internal/services/svbdf.h
@@ -4,7 +4,7 @@
  *
  *   The FreeType BDF services (specification).
  *
- * Copyright (C) 2003-2024 by
+ * Copyright (C) 2003-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/internal/services/svcfftl.h b/src/java.desktop/share/native/libfreetype/include/freetype/internal/services/svcfftl.h
index 3cb483c344f..c97bf84fb2e 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/internal/services/svcfftl.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/internal/services/svcfftl.h
@@ -4,7 +4,7 @@
  *
  *   The FreeType CFF tables loader service (specification).
  *
- * Copyright (C) 2017-2024 by
+ * Copyright (C) 2017-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/internal/services/svcid.h b/src/java.desktop/share/native/libfreetype/include/freetype/internal/services/svcid.h
index 8362cb8724d..748a8caf887 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/internal/services/svcid.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/internal/services/svcid.h
@@ -4,7 +4,7 @@
  *
  *   The FreeType CID font services (specification).
  *
- * Copyright (C) 2007-2024 by
+ * Copyright (C) 2007-2025 by
  * Derek Clegg and Michael Toftdal.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/internal/services/svfntfmt.h b/src/java.desktop/share/native/libfreetype/include/freetype/internal/services/svfntfmt.h
index 6b837e79fcd..690fdc2a24f 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/internal/services/svfntfmt.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/internal/services/svfntfmt.h
@@ -4,7 +4,7 @@
  *
  *   The FreeType font format service (specification only).
  *
- * Copyright (C) 2003-2024 by
+ * Copyright (C) 2003-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/internal/services/svgldict.h b/src/java.desktop/share/native/libfreetype/include/freetype/internal/services/svgldict.h
index 6126ec9ada4..7128d6f3d7a 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/internal/services/svgldict.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/internal/services/svgldict.h
@@ -4,7 +4,7 @@
  *
  *   The FreeType glyph dictionary services (specification).
  *
- * Copyright (C) 2003-2024 by
+ * Copyright (C) 2003-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/internal/services/svgxval.h b/src/java.desktop/share/native/libfreetype/include/freetype/internal/services/svgxval.h
index 29cf5528189..1ca3e0a031b 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/internal/services/svgxval.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/internal/services/svgxval.h
@@ -4,7 +4,7 @@
  *
  *   FreeType API for validating TrueTypeGX/AAT tables (specification).
  *
- * Copyright (C) 2004-2024 by
+ * Copyright (C) 2004-2025 by
  * Masatake YAMATO, Red Hat K.K.,
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/internal/services/svkern.h b/src/java.desktop/share/native/libfreetype/include/freetype/internal/services/svkern.h
index ac1bc30c412..8a3d59bec6d 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/internal/services/svkern.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/internal/services/svkern.h
@@ -4,7 +4,7 @@
  *
  *   The FreeType Kerning service (specification).
  *
- * Copyright (C) 2006-2024 by
+ * Copyright (C) 2006-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/internal/services/svmetric.h b/src/java.desktop/share/native/libfreetype/include/freetype/internal/services/svmetric.h
index 8b3563b25ca..4dde3a8151a 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/internal/services/svmetric.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/internal/services/svmetric.h
@@ -4,7 +4,7 @@
  *
  *   The FreeType services for metrics variations (specification).
  *
- * Copyright (C) 2016-2024 by
+ * Copyright (C) 2016-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
@@ -77,7 +77,7 @@ FT_BEGIN_HEADER
   typedef void
   (*FT_Metrics_Adjust_Func)( FT_Face  face );
 
-  typedef FT_Error
+  typedef void
   (*FT_Size_Reset_Func)( FT_Size  size );
 
 
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/internal/services/svmm.h b/src/java.desktop/share/native/libfreetype/include/freetype/internal/services/svmm.h
index 5288fadf375..9be133e2db0 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/internal/services/svmm.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/internal/services/svmm.h
@@ -4,7 +4,7 @@
  *
  *   The FreeType Multiple Masters and GX var services (specification).
  *
- * Copyright (C) 2003-2024 by
+ * Copyright (C) 2003-2025 by
  * David Turner, Robert Wilhelm, Werner Lemberg, and Dominik Röttsches.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/internal/services/svotval.h b/src/java.desktop/share/native/libfreetype/include/freetype/internal/services/svotval.h
index 7aea7ec11f0..933e5de98da 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/internal/services/svotval.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/internal/services/svotval.h
@@ -4,7 +4,7 @@
  *
  *   The FreeType OpenType validation service (specification).
  *
- * Copyright (C) 2004-2024 by
+ * Copyright (C) 2004-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/internal/services/svpfr.h b/src/java.desktop/share/native/libfreetype/include/freetype/internal/services/svpfr.h
index b2fac6d086b..c81b6a68a8b 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/internal/services/svpfr.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/internal/services/svpfr.h
@@ -4,7 +4,7 @@
  *
  *   Internal PFR service functions (specification).
  *
- * Copyright (C) 2003-2024 by
+ * Copyright (C) 2003-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/internal/services/svpostnm.h b/src/java.desktop/share/native/libfreetype/include/freetype/internal/services/svpostnm.h
index d19f3adc6d5..33864ebc344 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/internal/services/svpostnm.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/internal/services/svpostnm.h
@@ -4,7 +4,7 @@
  *
  *   The FreeType PostScript name services (specification).
  *
- * Copyright (C) 2003-2024 by
+ * Copyright (C) 2003-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/internal/services/svprop.h b/src/java.desktop/share/native/libfreetype/include/freetype/internal/services/svprop.h
index ba39c0dd4da..0eb79c885d8 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/internal/services/svprop.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/internal/services/svprop.h
@@ -4,7 +4,7 @@
  *
  *   The FreeType property service (specification).
  *
- * Copyright (C) 2012-2024 by
+ * Copyright (C) 2012-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/internal/services/svpscmap.h b/src/java.desktop/share/native/libfreetype/include/freetype/internal/services/svpscmap.h
index d4908ee41aa..8f85d12157c 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/internal/services/svpscmap.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/internal/services/svpscmap.h
@@ -4,7 +4,7 @@
  *
  *   The FreeType PostScript charmap service (specification).
  *
- * Copyright (C) 2003-2024 by
+ * Copyright (C) 2003-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/internal/services/svpsinfo.h b/src/java.desktop/share/native/libfreetype/include/freetype/internal/services/svpsinfo.h
index 2aadcdd02a1..83de04478df 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/internal/services/svpsinfo.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/internal/services/svpsinfo.h
@@ -4,7 +4,7 @@
  *
  *   The FreeType PostScript info service (specification).
  *
- * Copyright (C) 2003-2024 by
+ * Copyright (C) 2003-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/internal/services/svsfnt.h b/src/java.desktop/share/native/libfreetype/include/freetype/internal/services/svsfnt.h
index 9e0f4ff202e..9bf5e3473c4 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/internal/services/svsfnt.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/internal/services/svsfnt.h
@@ -4,7 +4,7 @@
  *
  *   The FreeType SFNT table loading service (specification).
  *
- * Copyright (C) 2003-2024 by
+ * Copyright (C) 2003-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/internal/services/svttcmap.h b/src/java.desktop/share/native/libfreetype/include/freetype/internal/services/svttcmap.h
index 250886bcc5d..fc9b0aeb8e3 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/internal/services/svttcmap.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/internal/services/svttcmap.h
@@ -4,7 +4,7 @@
  *
  *   The FreeType TrueType/sfnt cmap extra information service.
  *
- * Copyright (C) 2003-2024 by
+ * Copyright (C) 2003-2025 by
  * Masatake YAMATO, Redhat K.K.,
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/internal/services/svtteng.h b/src/java.desktop/share/native/libfreetype/include/freetype/internal/services/svtteng.h
index 14967529a9a..979e9ea102e 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/internal/services/svtteng.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/internal/services/svtteng.h
@@ -4,7 +4,7 @@
  *
  *   The FreeType TrueType engine query service (specification).
  *
- * Copyright (C) 2006-2024 by
+ * Copyright (C) 2006-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/internal/services/svttglyf.h b/src/java.desktop/share/native/libfreetype/include/freetype/internal/services/svttglyf.h
index f190b3985d0..e4f54c10037 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/internal/services/svttglyf.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/internal/services/svttglyf.h
@@ -4,7 +4,7 @@
  *
  *   The FreeType TrueType glyph service.
  *
- * Copyright (C) 2007-2024 by
+ * Copyright (C) 2007-2025 by
  * David Turner.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/internal/services/svwinfnt.h b/src/java.desktop/share/native/libfreetype/include/freetype/internal/services/svwinfnt.h
index 49f3fb7f775..ff887ffdc03 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/internal/services/svwinfnt.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/internal/services/svwinfnt.h
@@ -4,7 +4,7 @@
  *
  *   The FreeType Windows FNT/FONT service (specification).
  *
- * Copyright (C) 2003-2024 by
+ * Copyright (C) 2003-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/internal/sfnt.h b/src/java.desktop/share/native/libfreetype/include/freetype/internal/sfnt.h
index 35e4e73af02..adba2178877 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/internal/sfnt.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/internal/sfnt.h
@@ -4,7 +4,7 @@
  *
  *   High-level 'sfnt' driver interface (specification).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
@@ -612,7 +612,7 @@ FT_BEGIN_HEADER
    *
    * @return:
    *   Value~1 if a ClipBox is found.  If no clip box is found or an
-   *   error occured, value~0 is returned.
+   *   error occurred, value~0 is returned.
    */
   typedef FT_Bool
   ( *TT_Get_Color_Glyph_ClipBox_Func )( TT_Face      face,
@@ -707,7 +707,7 @@ FT_BEGIN_HEADER
    *
    * @return:
    *   Value~1 if everything is OK.  Value~0 if no details can be found for
-   *   this paint or any other error occured.
+   *   this paint or any other error occurred.
    */
   typedef FT_Bool
   ( *TT_Get_Paint_Func )( TT_Face         face,
@@ -808,7 +808,7 @@ FT_BEGIN_HEADER
    *     corresponding (1,0) Apple entry.
    *
    * @return:
-   *   1 if there is either a win or apple entry (or both), 0 otheriwse.
+   *   1 if there is either a win or apple entry (or both), 0 otherwise.
    */
   typedef FT_Bool
   (*TT_Get_Name_ID_Func)( TT_Face    face,
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/internal/svginterface.h b/src/java.desktop/share/native/libfreetype/include/freetype/internal/svginterface.h
index 68c99efb10a..20c73b2fbd2 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/internal/svginterface.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/internal/svginterface.h
@@ -4,7 +4,7 @@
  *
  *   Interface of ot-svg module (specification only).
  *
- * Copyright (C) 2022-2024 by
+ * Copyright (C) 2022-2025 by
  * David Turner, Robert Wilhelm, Werner Lemberg, and Moazin Khatti.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/internal/t1types.h b/src/java.desktop/share/native/libfreetype/include/freetype/internal/t1types.h
index 1821ae5cc83..5b26e4620d0 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/internal/t1types.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/internal/t1types.h
@@ -5,7 +5,7 @@
  *   Basic Type1/Type2 type definitions and interface (specification
  *   only).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/internal/tttypes.h b/src/java.desktop/share/native/libfreetype/include/freetype/internal/tttypes.h
index 7053e656a7e..d0e5eee89bc 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/internal/tttypes.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/internal/tttypes.h
@@ -5,7 +5,7 @@
  *   Basic SFNT/TrueType type definitions and interface (specification
  *   only).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
@@ -930,8 +930,8 @@ FT_BEGIN_HEADER
    *   resolution and scaling independent parts of a TrueType font resource.
    *
    * @note:
-   *   The TT_Face structure is also used as a 'parent class' for the
-   *   OpenType-CFF class (T2_Face).
+   *   The TT_Face structure is also used for CFF support; see file
+   *   `cffotypes.h`.
    */
   typedef struct TT_FaceRec_*  TT_Face;
 
@@ -1276,10 +1276,6 @@ FT_BEGIN_HEADER
    *
    *     If varied by the `CVAR' table, non-integer values are possible.
    *
-   *   interpreter ::
-   *     A pointer to the TrueType bytecode interpreters field is also used
-   *     to hook the debugger in 'ttdebug'.
-   *
    *   extra ::
    *     Reserved for third-party font drivers.
    *
@@ -1521,10 +1517,6 @@ FT_BEGIN_HEADER
     FT_ULong              cvt_size;
     FT_Int32*             cvt;
 
-    /* A pointer to the bytecode interpreter to use.  This is also */
-    /* used to hook the debugger for the `ttdebug' utility.        */
-    TT_Interpreter        interpreter;
-
 
     /************************************************************************
      *
@@ -1582,11 +1574,6 @@ FT_BEGIN_HEADER
     FT_UInt32             kern_avail_bits;
     FT_UInt32             kern_order_bits;
 
-#ifdef TT_CONFIG_OPTION_GPOS_KERNING
-    FT_Byte*              gpos_table;
-    FT_Bool               gpos_kerning_available;
-#endif
-
 #ifdef TT_CONFIG_OPTION_BDF
     TT_BDFRec             bdf;
 #endif /* TT_CONFIG_OPTION_BDF */
@@ -1608,6 +1595,15 @@ FT_BEGIN_HEADER
     /* since 2.12 */
     void*                 svg;
 
+#ifdef TT_CONFIG_OPTION_GPOS_KERNING
+    /* since 2.13.3 */
+    FT_Byte*              gpos_table;
+    /* since 2.14 */
+    /* This is actually an array of GPOS lookup subtables. */
+    FT_UInt32*            gpos_lookups_kerning;
+    FT_UInt               num_gpos_lookups_kerning;
+#endif
+
   } TT_FaceRec;
 
 
@@ -1621,15 +1617,6 @@ FT_BEGIN_HEADER
    *   coordinates.
    *
    * @fields:
-   *   memory ::
-   *     A handle to the memory manager.
-   *
-   *   max_points ::
-   *     The maximum size in points of the zone.
-   *
-   *   max_contours ::
-   *     Max size in links contours of the zone.
-   *
    *   n_points ::
    *     The current number of points in the zone.
    *
@@ -1653,9 +1640,6 @@ FT_BEGIN_HEADER
    */
   typedef struct  TT_GlyphZoneRec_
   {
-    FT_Memory   memory;
-    FT_UShort   max_points;
-    FT_UShort   max_contours;
     FT_UShort   n_points;    /* number of points in zone    */
     FT_UShort   n_contours;  /* number of contours          */
 
@@ -1714,7 +1698,6 @@ FT_BEGIN_HEADER
     TT_GlyphZoneRec  zone;
 
     TT_ExecContext   exec;
-    FT_Byte*         instructions;
     FT_ULong         ins_pos;
 
     /* for possible extensibility in other formats */
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/internal/wofftypes.h b/src/java.desktop/share/native/libfreetype/include/freetype/internal/wofftypes.h
index 4a169d12f57..7d5b7df0fa1 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/internal/wofftypes.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/internal/wofftypes.h
@@ -5,7 +5,7 @@
  *   Basic WOFF/WOFF2 type definitions and interface (specification
  *   only).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/otsvg.h b/src/java.desktop/share/native/libfreetype/include/freetype/otsvg.h
index 9d356938cc7..326bbcd0153 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/otsvg.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/otsvg.h
@@ -4,7 +4,7 @@
  *
  *   Interface for OT-SVG support related things (specification).
  *
- * Copyright (C) 2022-2024 by
+ * Copyright (C) 2022-2025 by
  * David Turner, Robert Wilhelm, Werner Lemberg, and Moazin Khatti.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/t1tables.h b/src/java.desktop/share/native/libfreetype/include/freetype/t1tables.h
index fbd558aa34d..fc3c1706de5 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/t1tables.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/t1tables.h
@@ -5,7 +5,7 @@
  *   Basic Type 1/Type 2 tables definitions and interface (specification
  *   only).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/ttnameid.h b/src/java.desktop/share/native/libfreetype/include/freetype/ttnameid.h
index d5d470e380f..3ef61091cc9 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/ttnameid.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/ttnameid.h
@@ -4,7 +4,7 @@
  *
  *   TrueType name ID definitions (specification only).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
@@ -436,7 +436,7 @@ FT_BEGIN_HEADER
    *
    *   The canonical source for Microsoft's IDs is
    *
-   *     https://docs.microsoft.com/en-us/windows/desktop/Intl/language-identifier-constants-and-strings ,
+   *     https://learn.microsoft.com/windows/win32/intl/language-identifier-constants-and-strings ,
    *
    *   however, we only provide macros for language identifiers present in
    *   the OpenType specification: Microsoft has abandoned the concept of
@@ -847,113 +847,113 @@ FT_BEGIN_HEADER
   /* --------------- */
 
   /* Bit  0   Basic Latin */
-#define TT_UCR_BASIC_LATIN                     (1L <<  0) /* U+0020-U+007E */
+#define TT_UCR_BASIC_LATIN                    (1UL <<  0) /* U+0020-U+007E */
   /* Bit  1   C1 Controls and Latin-1 Supplement */
-#define TT_UCR_LATIN1_SUPPLEMENT               (1L <<  1) /* U+0080-U+00FF */
+#define TT_UCR_LATIN1_SUPPLEMENT              (1UL <<  1) /* U+0080-U+00FF */
   /* Bit  2   Latin Extended-A */
-#define TT_UCR_LATIN_EXTENDED_A                (1L <<  2) /* U+0100-U+017F */
+#define TT_UCR_LATIN_EXTENDED_A               (1UL <<  2) /* U+0100-U+017F */
   /* Bit  3   Latin Extended-B */
-#define TT_UCR_LATIN_EXTENDED_B                (1L <<  3) /* U+0180-U+024F */
+#define TT_UCR_LATIN_EXTENDED_B               (1UL <<  3) /* U+0180-U+024F */
   /* Bit  4   IPA Extensions                 */
   /*          Phonetic Extensions            */
   /*          Phonetic Extensions Supplement */
-#define TT_UCR_IPA_EXTENSIONS                  (1L <<  4) /* U+0250-U+02AF */
+#define TT_UCR_IPA_EXTENSIONS                 (1UL <<  4) /* U+0250-U+02AF */
                                                           /* U+1D00-U+1D7F */
                                                           /* U+1D80-U+1DBF */
   /* Bit  5   Spacing Modifier Letters */
   /*          Modifier Tone Letters    */
-#define TT_UCR_SPACING_MODIFIER                (1L <<  5) /* U+02B0-U+02FF */
+#define TT_UCR_SPACING_MODIFIER               (1UL <<  5) /* U+02B0-U+02FF */
                                                           /* U+A700-U+A71F */
   /* Bit  6   Combining Diacritical Marks            */
   /*          Combining Diacritical Marks Supplement */
-#define TT_UCR_COMBINING_DIACRITICAL_MARKS     (1L <<  6) /* U+0300-U+036F */
+#define TT_UCR_COMBINING_DIACRITICAL_MARKS    (1UL <<  6) /* U+0300-U+036F */
                                                           /* U+1DC0-U+1DFF */
   /* Bit  7   Greek and Coptic */
-#define TT_UCR_GREEK                           (1L <<  7) /* U+0370-U+03FF */
+#define TT_UCR_GREEK                          (1UL <<  7) /* U+0370-U+03FF */
   /* Bit  8   Coptic */
-#define TT_UCR_COPTIC                          (1L <<  8) /* U+2C80-U+2CFF */
+#define TT_UCR_COPTIC                         (1UL <<  8) /* U+2C80-U+2CFF */
   /* Bit  9   Cyrillic            */
   /*          Cyrillic Supplement */
   /*          Cyrillic Extended-A */
   /*          Cyrillic Extended-B */
-#define TT_UCR_CYRILLIC                        (1L <<  9) /* U+0400-U+04FF */
+#define TT_UCR_CYRILLIC                       (1UL <<  9) /* U+0400-U+04FF */
                                                           /* U+0500-U+052F */
                                                           /* U+2DE0-U+2DFF */
                                                           /* U+A640-U+A69F */
   /* Bit 10   Armenian */
-#define TT_UCR_ARMENIAN                        (1L << 10) /* U+0530-U+058F */
+#define TT_UCR_ARMENIAN                       (1UL << 10) /* U+0530-U+058F */
   /* Bit 11   Hebrew */
-#define TT_UCR_HEBREW                          (1L << 11) /* U+0590-U+05FF */
+#define TT_UCR_HEBREW                         (1UL << 11) /* U+0590-U+05FF */
   /* Bit 12   Vai */
-#define TT_UCR_VAI                             (1L << 12) /* U+A500-U+A63F */
+#define TT_UCR_VAI                            (1UL << 12) /* U+A500-U+A63F */
   /* Bit 13   Arabic            */
   /*          Arabic Supplement */
-#define TT_UCR_ARABIC                          (1L << 13) /* U+0600-U+06FF */
+#define TT_UCR_ARABIC                         (1UL << 13) /* U+0600-U+06FF */
                                                           /* U+0750-U+077F */
   /* Bit 14   NKo */
-#define TT_UCR_NKO                             (1L << 14) /* U+07C0-U+07FF */
+#define TT_UCR_NKO                            (1UL << 14) /* U+07C0-U+07FF */
   /* Bit 15   Devanagari */
-#define TT_UCR_DEVANAGARI                      (1L << 15) /* U+0900-U+097F */
-  /* Bit 16   Bengali */
-#define TT_UCR_BENGALI                         (1L << 16) /* U+0980-U+09FF */
+#define TT_UCR_DEVANAGARI                     (1UL << 15) /* U+0900-U+097F */
+  /* Bit 16   Bangla (Bengali) */
+#define TT_UCR_BENGALI                        (1UL << 16) /* U+0980-U+09FF */
   /* Bit 17   Gurmukhi */
-#define TT_UCR_GURMUKHI                        (1L << 17) /* U+0A00-U+0A7F */
+#define TT_UCR_GURMUKHI                       (1UL << 17) /* U+0A00-U+0A7F */
   /* Bit 18   Gujarati */
-#define TT_UCR_GUJARATI                        (1L << 18) /* U+0A80-U+0AFF */
-  /* Bit 19   Oriya */
-#define TT_UCR_ORIYA                           (1L << 19) /* U+0B00-U+0B7F */
+#define TT_UCR_GUJARATI                       (1UL << 18) /* U+0A80-U+0AFF */
+  /* Bit 19   Oriya (Odia) */
+#define TT_UCR_ORIYA                          (1UL << 19) /* U+0B00-U+0B7F */
   /* Bit 20   Tamil */
-#define TT_UCR_TAMIL                           (1L << 20) /* U+0B80-U+0BFF */
+#define TT_UCR_TAMIL                          (1UL << 20) /* U+0B80-U+0BFF */
   /* Bit 21   Telugu */
-#define TT_UCR_TELUGU                          (1L << 21) /* U+0C00-U+0C7F */
+#define TT_UCR_TELUGU                         (1UL << 21) /* U+0C00-U+0C7F */
   /* Bit 22   Kannada */
-#define TT_UCR_KANNADA                         (1L << 22) /* U+0C80-U+0CFF */
+#define TT_UCR_KANNADA                        (1UL << 22) /* U+0C80-U+0CFF */
   /* Bit 23   Malayalam */
-#define TT_UCR_MALAYALAM                       (1L << 23) /* U+0D00-U+0D7F */
+#define TT_UCR_MALAYALAM                      (1UL << 23) /* U+0D00-U+0D7F */
   /* Bit 24   Thai */
-#define TT_UCR_THAI                            (1L << 24) /* U+0E00-U+0E7F */
+#define TT_UCR_THAI                           (1UL << 24) /* U+0E00-U+0E7F */
   /* Bit 25   Lao */
-#define TT_UCR_LAO                             (1L << 25) /* U+0E80-U+0EFF */
+#define TT_UCR_LAO                            (1UL << 25) /* U+0E80-U+0EFF */
   /* Bit 26   Georgian            */
   /*          Georgian Supplement */
-#define TT_UCR_GEORGIAN                        (1L << 26) /* U+10A0-U+10FF */
+#define TT_UCR_GEORGIAN                       (1UL << 26) /* U+10A0-U+10FF */
                                                           /* U+2D00-U+2D2F */
   /* Bit 27   Balinese */
-#define TT_UCR_BALINESE                        (1L << 27) /* U+1B00-U+1B7F */
+#define TT_UCR_BALINESE                       (1UL << 27) /* U+1B00-U+1B7F */
   /* Bit 28   Hangul Jamo */
-#define TT_UCR_HANGUL_JAMO                     (1L << 28) /* U+1100-U+11FF */
+#define TT_UCR_HANGUL_JAMO                    (1UL << 28) /* U+1100-U+11FF */
   /* Bit 29   Latin Extended Additional */
   /*          Latin Extended-C          */
   /*          Latin Extended-D          */
-#define TT_UCR_LATIN_EXTENDED_ADDITIONAL       (1L << 29) /* U+1E00-U+1EFF */
+#define TT_UCR_LATIN_EXTENDED_ADDITIONAL      (1UL << 29) /* U+1E00-U+1EFF */
                                                           /* U+2C60-U+2C7F */
                                                           /* U+A720-U+A7FF */
   /* Bit 30   Greek Extended */
-#define TT_UCR_GREEK_EXTENDED                  (1L << 30) /* U+1F00-U+1FFF */
+#define TT_UCR_GREEK_EXTENDED                 (1UL << 30) /* U+1F00-U+1FFF */
   /* Bit 31   General Punctuation      */
   /*          Supplemental Punctuation */
-#define TT_UCR_GENERAL_PUNCTUATION             (1L << 31) /* U+2000-U+206F */
+#define TT_UCR_GENERAL_PUNCTUATION            (1UL << 31) /* U+2000-U+206F */
                                                           /* U+2E00-U+2E7F */
 
   /* ulUnicodeRange2 */
   /* --------------- */
 
   /* Bit 32   Superscripts And Subscripts */
-#define TT_UCR_SUPERSCRIPTS_SUBSCRIPTS         (1L <<  0) /* U+2070-U+209F */
+#define TT_UCR_SUPERSCRIPTS_SUBSCRIPTS        (1UL <<  0) /* U+2070-U+209F */
   /* Bit 33   Currency Symbols */
-#define TT_UCR_CURRENCY_SYMBOLS                (1L <<  1) /* U+20A0-U+20CF */
+#define TT_UCR_CURRENCY_SYMBOLS               (1UL <<  1) /* U+20A0-U+20CF */
   /* Bit 34   Combining Diacritical Marks For Symbols */
 #define TT_UCR_COMBINING_DIACRITICAL_MARKS_SYMB \
-                                               (1L <<  2) /* U+20D0-U+20FF */
+                                              (1UL <<  2) /* U+20D0-U+20FF */
   /* Bit 35   Letterlike Symbols */
-#define TT_UCR_LETTERLIKE_SYMBOLS              (1L <<  3) /* U+2100-U+214F */
+#define TT_UCR_LETTERLIKE_SYMBOLS             (1UL <<  3) /* U+2100-U+214F */
   /* Bit 36   Number Forms */
-#define TT_UCR_NUMBER_FORMS                    (1L <<  4) /* U+2150-U+218F */
+#define TT_UCR_NUMBER_FORMS                   (1UL <<  4) /* U+2150-U+218F */
   /* Bit 37   Arrows                           */
   /*          Supplemental Arrows-A            */
   /*          Supplemental Arrows-B            */
   /*          Miscellaneous Symbols and Arrows */
-#define TT_UCR_ARROWS                          (1L <<  5) /* U+2190-U+21FF */
+#define TT_UCR_ARROWS                         (1UL <<  5) /* U+2190-U+21FF */
                                                           /* U+27F0-U+27FF */
                                                           /* U+2900-U+297F */
                                                           /* U+2B00-U+2BFF */
@@ -961,52 +961,52 @@ FT_BEGIN_HEADER
   /*          Supplemental Mathematical Operators  */
   /*          Miscellaneous Mathematical Symbols-A */
   /*          Miscellaneous Mathematical Symbols-B */
-#define TT_UCR_MATHEMATICAL_OPERATORS          (1L <<  6) /* U+2200-U+22FF */
+#define TT_UCR_MATHEMATICAL_OPERATORS         (1UL <<  6) /* U+2200-U+22FF */
                                                           /* U+2A00-U+2AFF */
                                                           /* U+27C0-U+27EF */
                                                           /* U+2980-U+29FF */
   /* Bit 39 Miscellaneous Technical */
-#define TT_UCR_MISCELLANEOUS_TECHNICAL         (1L <<  7) /* U+2300-U+23FF */
+#define TT_UCR_MISCELLANEOUS_TECHNICAL        (1UL <<  7) /* U+2300-U+23FF */
   /* Bit 40   Control Pictures */
-#define TT_UCR_CONTROL_PICTURES                (1L <<  8) /* U+2400-U+243F */
+#define TT_UCR_CONTROL_PICTURES               (1UL <<  8) /* U+2400-U+243F */
   /* Bit 41   Optical Character Recognition */
-#define TT_UCR_OCR                             (1L <<  9) /* U+2440-U+245F */
+#define TT_UCR_OCR                            (1UL <<  9) /* U+2440-U+245F */
   /* Bit 42   Enclosed Alphanumerics */
-#define TT_UCR_ENCLOSED_ALPHANUMERICS          (1L << 10) /* U+2460-U+24FF */
+#define TT_UCR_ENCLOSED_ALPHANUMERICS         (1UL << 10) /* U+2460-U+24FF */
   /* Bit 43   Box Drawing */
-#define TT_UCR_BOX_DRAWING                     (1L << 11) /* U+2500-U+257F */
+#define TT_UCR_BOX_DRAWING                    (1UL << 11) /* U+2500-U+257F */
   /* Bit 44   Block Elements */
-#define TT_UCR_BLOCK_ELEMENTS                  (1L << 12) /* U+2580-U+259F */
+#define TT_UCR_BLOCK_ELEMENTS                 (1UL << 12) /* U+2580-U+259F */
   /* Bit 45   Geometric Shapes */
-#define TT_UCR_GEOMETRIC_SHAPES                (1L << 13) /* U+25A0-U+25FF */
+#define TT_UCR_GEOMETRIC_SHAPES               (1UL << 13) /* U+25A0-U+25FF */
   /* Bit 46   Miscellaneous Symbols */
-#define TT_UCR_MISCELLANEOUS_SYMBOLS           (1L << 14) /* U+2600-U+26FF */
+#define TT_UCR_MISCELLANEOUS_SYMBOLS          (1UL << 14) /* U+2600-U+26FF */
   /* Bit 47   Dingbats */
-#define TT_UCR_DINGBATS                        (1L << 15) /* U+2700-U+27BF */
+#define TT_UCR_DINGBATS                       (1UL << 15) /* U+2700-U+27BF */
   /* Bit 48   CJK Symbols and Punctuation */
-#define TT_UCR_CJK_SYMBOLS                     (1L << 16) /* U+3000-U+303F */
+#define TT_UCR_CJK_SYMBOLS                    (1UL << 16) /* U+3000-U+303F */
   /* Bit 49   Hiragana */
-#define TT_UCR_HIRAGANA                        (1L << 17) /* U+3040-U+309F */
+#define TT_UCR_HIRAGANA                       (1UL << 17) /* U+3040-U+309F */
   /* Bit 50   Katakana                     */
   /*          Katakana Phonetic Extensions */
-#define TT_UCR_KATAKANA                        (1L << 18) /* U+30A0-U+30FF */
+#define TT_UCR_KATAKANA                       (1UL << 18) /* U+30A0-U+30FF */
                                                           /* U+31F0-U+31FF */
   /* Bit 51   Bopomofo          */
   /*          Bopomofo Extended */
-#define TT_UCR_BOPOMOFO                        (1L << 19) /* U+3100-U+312F */
+#define TT_UCR_BOPOMOFO                       (1UL << 19) /* U+3100-U+312F */
                                                           /* U+31A0-U+31BF */
   /* Bit 52   Hangul Compatibility Jamo */
-#define TT_UCR_HANGUL_COMPATIBILITY_JAMO       (1L << 20) /* U+3130-U+318F */
+#define TT_UCR_HANGUL_COMPATIBILITY_JAMO      (1UL << 20) /* U+3130-U+318F */
   /* Bit 53   Phags-Pa */
-#define TT_UCR_CJK_MISC                        (1L << 21) /* U+A840-U+A87F */
-#define TT_UCR_KANBUN  TT_UCR_CJK_MISC /* deprecated */
-#define TT_UCR_PHAGSPA
+#define TT_UCR_PHAGSPA                        (1UL << 21) /* U+A840-U+A87F */
+#define TT_UCR_KANBUN    TT_UCR_PHAGSPA  /* deprecated */
+#define TT_UCR_CJK_MISC  TT_UCR_PHAGSPA  /* deprecated */
   /* Bit 54   Enclosed CJK Letters and Months */
-#define TT_UCR_ENCLOSED_CJK_LETTERS_MONTHS     (1L << 22) /* U+3200-U+32FF */
+#define TT_UCR_ENCLOSED_CJK_LETTERS_MONTHS    (1UL << 22) /* U+3200-U+32FF */
   /* Bit 55   CJK Compatibility */
-#define TT_UCR_CJK_COMPATIBILITY               (1L << 23) /* U+3300-U+33FF */
+#define TT_UCR_CJK_COMPATIBILITY              (1UL << 23) /* U+3300-U+33FF */
   /* Bit 56   Hangul Syllables */
-#define TT_UCR_HANGUL                          (1L << 24) /* U+AC00-U+D7A3 */
+#define TT_UCR_HANGUL                         (1UL << 24) /* U+AC00-U+D7A3 */
   /* Bit 57   High Surrogates              */
   /*          High Private Use Surrogates  */
   /*          Low Surrogates               */
@@ -1017,12 +1017,12 @@ FT_BEGIN_HEADER
   /* Basic Multilingual Plane that is      */
   /* supported by this font.  So it really */
   /* means >= U+10000.                     */
-#define TT_UCR_SURROGATES                      (1L << 25) /* U+D800-U+DB7F */
+#define TT_UCR_SURROGATES                     (1UL << 25) /* U+D800-U+DB7F */
                                                           /* U+DB80-U+DBFF */
                                                           /* U+DC00-U+DFFF */
 #define TT_UCR_NON_PLANE_0  TT_UCR_SURROGATES
   /* Bit 58  Phoenician */
-#define TT_UCR_PHOENICIAN                      (1L << 26) /*U+10900-U+1091F*/
+#define TT_UCR_PHOENICIAN                     (1UL << 26) /*U+10900-U+1091F*/
   /* Bit 59   CJK Unified Ideographs             */
   /*          CJK Radicals Supplement            */
   /*          Kangxi Radicals                    */
@@ -1030,7 +1030,7 @@ FT_BEGIN_HEADER
   /*          CJK Unified Ideographs Extension A */
   /*          CJK Unified Ideographs Extension B */
   /*          Kanbun                             */
-#define TT_UCR_CJK_UNIFIED_IDEOGRAPHS          (1L << 27) /* U+4E00-U+9FFF */
+#define TT_UCR_CJK_UNIFIED_IDEOGRAPHS         (1UL << 27) /* U+4E00-U+9FFF */
                                                           /* U+2E80-U+2EFF */
                                                           /* U+2F00-U+2FDF */
                                                           /* U+2FF0-U+2FFF */
@@ -1038,178 +1038,178 @@ FT_BEGIN_HEADER
                                                           /*U+20000-U+2A6DF*/
                                                           /* U+3190-U+319F */
   /* Bit 60   Private Use */
-#define TT_UCR_PRIVATE_USE                     (1L << 28) /* U+E000-U+F8FF */
+#define TT_UCR_PRIVATE_USE                    (1UL << 28) /* U+E000-U+F8FF */
   /* Bit 61   CJK Strokes                             */
   /*          CJK Compatibility Ideographs            */
   /*          CJK Compatibility Ideographs Supplement */
-#define TT_UCR_CJK_COMPATIBILITY_IDEOGRAPHS    (1L << 29) /* U+31C0-U+31EF */
+#define TT_UCR_CJK_COMPATIBILITY_IDEOGRAPHS   (1UL << 29) /* U+31C0-U+31EF */
                                                           /* U+F900-U+FAFF */
                                                           /*U+2F800-U+2FA1F*/
   /* Bit 62   Alphabetic Presentation Forms */
-#define TT_UCR_ALPHABETIC_PRESENTATION_FORMS   (1L << 30) /* U+FB00-U+FB4F */
+#define TT_UCR_ALPHABETIC_PRESENTATION_FORMS  (1UL << 30) /* U+FB00-U+FB4F */
   /* Bit 63   Arabic Presentation Forms-A */
-#define TT_UCR_ARABIC_PRESENTATION_FORMS_A     (1L << 31) /* U+FB50-U+FDFF */
+#define TT_UCR_ARABIC_PRESENTATION_FORMS_A    (1UL << 31) /* U+FB50-U+FDFF */
 
   /* ulUnicodeRange3 */
   /* --------------- */
 
   /* Bit 64   Combining Half Marks */
-#define TT_UCR_COMBINING_HALF_MARKS            (1L <<  0) /* U+FE20-U+FE2F */
+#define TT_UCR_COMBINING_HALF_MARKS           (1UL <<  0) /* U+FE20-U+FE2F */
   /* Bit 65   Vertical forms          */
   /*          CJK Compatibility Forms */
-#define TT_UCR_CJK_COMPATIBILITY_FORMS         (1L <<  1) /* U+FE10-U+FE1F */
+#define TT_UCR_CJK_COMPATIBILITY_FORMS        (1UL <<  1) /* U+FE10-U+FE1F */
                                                           /* U+FE30-U+FE4F */
   /* Bit 66   Small Form Variants */
-#define TT_UCR_SMALL_FORM_VARIANTS             (1L <<  2) /* U+FE50-U+FE6F */
+#define TT_UCR_SMALL_FORM_VARIANTS            (1UL <<  2) /* U+FE50-U+FE6F */
   /* Bit 67   Arabic Presentation Forms-B */
-#define TT_UCR_ARABIC_PRESENTATION_FORMS_B     (1L <<  3) /* U+FE70-U+FEFE */
+#define TT_UCR_ARABIC_PRESENTATION_FORMS_B    (1UL <<  3) /* U+FE70-U+FEFF */
   /* Bit 68   Halfwidth and Fullwidth Forms */
-#define TT_UCR_HALFWIDTH_FULLWIDTH_FORMS       (1L <<  4) /* U+FF00-U+FFEF */
+#define TT_UCR_HALFWIDTH_FULLWIDTH_FORMS      (1UL <<  4) /* U+FF00-U+FFEF */
   /* Bit 69   Specials */
-#define TT_UCR_SPECIALS                        (1L <<  5) /* U+FFF0-U+FFFD */
+#define TT_UCR_SPECIALS                       (1UL <<  5) /* U+FFF0-U+FFFF */
   /* Bit 70   Tibetan */
-#define TT_UCR_TIBETAN                         (1L <<  6) /* U+0F00-U+0FFF */
+#define TT_UCR_TIBETAN                        (1UL <<  6) /* U+0F00-U+0FFF */
   /* Bit 71   Syriac */
-#define TT_UCR_SYRIAC                          (1L <<  7) /* U+0700-U+074F */
+#define TT_UCR_SYRIAC                         (1UL <<  7) /* U+0700-U+074F */
   /* Bit 72   Thaana */
-#define TT_UCR_THAANA                          (1L <<  8) /* U+0780-U+07BF */
+#define TT_UCR_THAANA                         (1UL <<  8) /* U+0780-U+07BF */
   /* Bit 73   Sinhala */
-#define TT_UCR_SINHALA                         (1L <<  9) /* U+0D80-U+0DFF */
+#define TT_UCR_SINHALA                        (1UL <<  9) /* U+0D80-U+0DFF */
   /* Bit 74   Myanmar */
-#define TT_UCR_MYANMAR                         (1L << 10) /* U+1000-U+109F */
+#define TT_UCR_MYANMAR                        (1UL << 10) /* U+1000-U+109F */
   /* Bit 75   Ethiopic            */
   /*          Ethiopic Supplement */
   /*          Ethiopic Extended   */
-#define TT_UCR_ETHIOPIC                        (1L << 11) /* U+1200-U+137F */
+#define TT_UCR_ETHIOPIC                       (1UL << 11) /* U+1200-U+137F */
                                                           /* U+1380-U+139F */
                                                           /* U+2D80-U+2DDF */
   /* Bit 76   Cherokee */
-#define TT_UCR_CHEROKEE                        (1L << 12) /* U+13A0-U+13FF */
+#define TT_UCR_CHEROKEE                       (1UL << 12) /* U+13A0-U+13FF */
   /* Bit 77   Unified Canadian Aboriginal Syllabics */
-#define TT_UCR_CANADIAN_ABORIGINAL_SYLLABICS   (1L << 13) /* U+1400-U+167F */
+#define TT_UCR_CANADIAN_ABORIGINAL_SYLLABICS  (1UL << 13) /* U+1400-U+167F */
   /* Bit 78   Ogham */
-#define TT_UCR_OGHAM                           (1L << 14) /* U+1680-U+169F */
+#define TT_UCR_OGHAM                          (1UL << 14) /* U+1680-U+169F */
   /* Bit 79   Runic */
-#define TT_UCR_RUNIC                           (1L << 15) /* U+16A0-U+16FF */
+#define TT_UCR_RUNIC                          (1UL << 15) /* U+16A0-U+16FF */
   /* Bit 80   Khmer         */
   /*          Khmer Symbols */
-#define TT_UCR_KHMER                           (1L << 16) /* U+1780-U+17FF */
+#define TT_UCR_KHMER                          (1UL << 16) /* U+1780-U+17FF */
                                                           /* U+19E0-U+19FF */
   /* Bit 81   Mongolian */
-#define TT_UCR_MONGOLIAN                       (1L << 17) /* U+1800-U+18AF */
+#define TT_UCR_MONGOLIAN                      (1UL << 17) /* U+1800-U+18AF */
   /* Bit 82   Braille Patterns */
-#define TT_UCR_BRAILLE                         (1L << 18) /* U+2800-U+28FF */
+#define TT_UCR_BRAILLE                        (1UL << 18) /* U+2800-U+28FF */
   /* Bit 83   Yi Syllables */
   /*          Yi Radicals  */
-#define TT_UCR_YI                              (1L << 19) /* U+A000-U+A48F */
+#define TT_UCR_YI                             (1UL << 19) /* U+A000-U+A48F */
                                                           /* U+A490-U+A4CF */
   /* Bit 84   Tagalog  */
   /*          Hanunoo  */
   /*          Buhid    */
   /*          Tagbanwa */
-#define TT_UCR_PHILIPPINE                      (1L << 20) /* U+1700-U+171F */
+#define TT_UCR_PHILIPPINE                     (1UL << 20) /* U+1700-U+171F */
                                                           /* U+1720-U+173F */
                                                           /* U+1740-U+175F */
                                                           /* U+1760-U+177F */
   /* Bit 85   Old Italic */
-#define TT_UCR_OLD_ITALIC                      (1L << 21) /*U+10300-U+1032F*/
+#define TT_UCR_OLD_ITALIC                     (1UL << 21) /*U+10300-U+1032F*/
   /* Bit 86   Gothic */
-#define TT_UCR_GOTHIC                          (1L << 22) /*U+10330-U+1034F*/
+#define TT_UCR_GOTHIC                         (1UL << 22) /*U+10330-U+1034F*/
   /* Bit 87   Deseret */
-#define TT_UCR_DESERET                         (1L << 23) /*U+10400-U+1044F*/
+#define TT_UCR_DESERET                        (1UL << 23) /*U+10400-U+1044F*/
   /* Bit 88   Byzantine Musical Symbols      */
   /*          Musical Symbols                */
   /*          Ancient Greek Musical Notation */
-#define TT_UCR_MUSICAL_SYMBOLS                 (1L << 24) /*U+1D000-U+1D0FF*/
+#define TT_UCR_MUSICAL_SYMBOLS                (1UL << 24) /*U+1D000-U+1D0FF*/
                                                           /*U+1D100-U+1D1FF*/
                                                           /*U+1D200-U+1D24F*/
   /* Bit 89   Mathematical Alphanumeric Symbols */
-#define TT_UCR_MATH_ALPHANUMERIC_SYMBOLS       (1L << 25) /*U+1D400-U+1D7FF*/
+#define TT_UCR_MATH_ALPHANUMERIC_SYMBOLS      (1UL << 25) /*U+1D400-U+1D7FF*/
   /* Bit 90   Private Use (plane 15) */
   /*          Private Use (plane 16) */
-#define TT_UCR_PRIVATE_USE_SUPPLEMENTARY       (1L << 26) /*U+F0000-U+FFFFD*/
+#define TT_UCR_PRIVATE_USE_SUPPLEMENTARY      (1UL << 26) /*U+F0000-U+FFFFD*/
                                                         /*U+100000-U+10FFFD*/
   /* Bit 91   Variation Selectors            */
   /*          Variation Selectors Supplement */
-#define TT_UCR_VARIATION_SELECTORS             (1L << 27) /* U+FE00-U+FE0F */
+#define TT_UCR_VARIATION_SELECTORS            (1UL << 27) /* U+FE00-U+FE0F */
                                                           /*U+E0100-U+E01EF*/
   /* Bit 92   Tags */
-#define TT_UCR_TAGS                            (1L << 28) /*U+E0000-U+E007F*/
+#define TT_UCR_TAGS                           (1UL << 28) /*U+E0000-U+E007F*/
   /* Bit 93   Limbu */
-#define TT_UCR_LIMBU                           (1L << 29) /* U+1900-U+194F */
+#define TT_UCR_LIMBU                          (1UL << 29) /* U+1900-U+194F */
   /* Bit 94   Tai Le */
-#define TT_UCR_TAI_LE                          (1L << 30) /* U+1950-U+197F */
+#define TT_UCR_TAI_LE                         (1UL << 30) /* U+1950-U+197F */
   /* Bit 95   New Tai Lue */
-#define TT_UCR_NEW_TAI_LUE                     (1L << 31) /* U+1980-U+19DF */
+#define TT_UCR_NEW_TAI_LUE                    (1UL << 31) /* U+1980-U+19DF */
 
   /* ulUnicodeRange4 */
   /* --------------- */
 
   /* Bit 96   Buginese */
-#define TT_UCR_BUGINESE                        (1L <<  0) /* U+1A00-U+1A1F */
+#define TT_UCR_BUGINESE                       (1UL <<  0) /* U+1A00-U+1A1F */
   /* Bit 97   Glagolitic */
-#define TT_UCR_GLAGOLITIC                      (1L <<  1) /* U+2C00-U+2C5F */
+#define TT_UCR_GLAGOLITIC                     (1UL <<  1) /* U+2C00-U+2C5F */
   /* Bit 98   Tifinagh */
-#define TT_UCR_TIFINAGH                        (1L <<  2) /* U+2D30-U+2D7F */
+#define TT_UCR_TIFINAGH                       (1UL <<  2) /* U+2D30-U+2D7F */
   /* Bit 99   Yijing Hexagram Symbols */
-#define TT_UCR_YIJING                          (1L <<  3) /* U+4DC0-U+4DFF */
+#define TT_UCR_YIJING                         (1UL <<  3) /* U+4DC0-U+4DFF */
   /* Bit 100  Syloti Nagri */
-#define TT_UCR_SYLOTI_NAGRI                    (1L <<  4) /* U+A800-U+A82F */
+#define TT_UCR_SYLOTI_NAGRI                   (1UL <<  4) /* U+A800-U+A82F */
   /* Bit 101  Linear B Syllabary */
   /*          Linear B Ideograms */
   /*          Aegean Numbers     */
-#define TT_UCR_LINEAR_B                        (1L <<  5) /*U+10000-U+1007F*/
+#define TT_UCR_LINEAR_B                       (1UL <<  5) /*U+10000-U+1007F*/
                                                           /*U+10080-U+100FF*/
                                                           /*U+10100-U+1013F*/
   /* Bit 102  Ancient Greek Numbers */
-#define TT_UCR_ANCIENT_GREEK_NUMBERS           (1L <<  6) /*U+10140-U+1018F*/
+#define TT_UCR_ANCIENT_GREEK_NUMBERS          (1UL <<  6) /*U+10140-U+1018F*/
   /* Bit 103  Ugaritic */
-#define TT_UCR_UGARITIC                        (1L <<  7) /*U+10380-U+1039F*/
+#define TT_UCR_UGARITIC                       (1UL <<  7) /*U+10380-U+1039F*/
   /* Bit 104  Old Persian */
-#define TT_UCR_OLD_PERSIAN                     (1L <<  8) /*U+103A0-U+103DF*/
+#define TT_UCR_OLD_PERSIAN                    (1UL <<  8) /*U+103A0-U+103DF*/
   /* Bit 105  Shavian */
-#define TT_UCR_SHAVIAN                         (1L <<  9) /*U+10450-U+1047F*/
+#define TT_UCR_SHAVIAN                        (1UL <<  9) /*U+10450-U+1047F*/
   /* Bit 106  Osmanya */
-#define TT_UCR_OSMANYA                         (1L << 10) /*U+10480-U+104AF*/
+#define TT_UCR_OSMANYA                        (1UL << 10) /*U+10480-U+104AF*/
   /* Bit 107  Cypriot Syllabary */
-#define TT_UCR_CYPRIOT_SYLLABARY               (1L << 11) /*U+10800-U+1083F*/
+#define TT_UCR_CYPRIOT_SYLLABARY              (1UL << 11) /*U+10800-U+1083F*/
   /* Bit 108  Kharoshthi */
-#define TT_UCR_KHAROSHTHI                      (1L << 12) /*U+10A00-U+10A5F*/
+#define TT_UCR_KHAROSHTHI                     (1UL << 12) /*U+10A00-U+10A5F*/
   /* Bit 109  Tai Xuan Jing Symbols */
-#define TT_UCR_TAI_XUAN_JING                   (1L << 13) /*U+1D300-U+1D35F*/
+#define TT_UCR_TAI_XUAN_JING                  (1UL << 13) /*U+1D300-U+1D35F*/
   /* Bit 110  Cuneiform                         */
   /*          Cuneiform Numbers and Punctuation */
-#define TT_UCR_CUNEIFORM                       (1L << 14) /*U+12000-U+123FF*/
+#define TT_UCR_CUNEIFORM                      (1UL << 14) /*U+12000-U+123FF*/
                                                           /*U+12400-U+1247F*/
   /* Bit 111  Counting Rod Numerals */
-#define TT_UCR_COUNTING_ROD_NUMERALS           (1L << 15) /*U+1D360-U+1D37F*/
+#define TT_UCR_COUNTING_ROD_NUMERALS          (1UL << 15) /*U+1D360-U+1D37F*/
   /* Bit 112  Sundanese */
-#define TT_UCR_SUNDANESE                       (1L << 16) /* U+1B80-U+1BBF */
+#define TT_UCR_SUNDANESE                      (1UL << 16) /* U+1B80-U+1BBF */
   /* Bit 113  Lepcha */
-#define TT_UCR_LEPCHA                          (1L << 17) /* U+1C00-U+1C4F */
+#define TT_UCR_LEPCHA                         (1UL << 17) /* U+1C00-U+1C4F */
   /* Bit 114  Ol Chiki */
-#define TT_UCR_OL_CHIKI                        (1L << 18) /* U+1C50-U+1C7F */
+#define TT_UCR_OL_CHIKI                       (1UL << 18) /* U+1C50-U+1C7F */
   /* Bit 115  Saurashtra */
-#define TT_UCR_SAURASHTRA                      (1L << 19) /* U+A880-U+A8DF */
+#define TT_UCR_SAURASHTRA                     (1UL << 19) /* U+A880-U+A8DF */
   /* Bit 116  Kayah Li */
-#define TT_UCR_KAYAH_LI                        (1L << 20) /* U+A900-U+A92F */
+#define TT_UCR_KAYAH_LI                       (1UL << 20) /* U+A900-U+A92F */
   /* Bit 117  Rejang */
-#define TT_UCR_REJANG                          (1L << 21) /* U+A930-U+A95F */
+#define TT_UCR_REJANG                         (1UL << 21) /* U+A930-U+A95F */
   /* Bit 118  Cham */
-#define TT_UCR_CHAM                            (1L << 22) /* U+AA00-U+AA5F */
+#define TT_UCR_CHAM                           (1UL << 22) /* U+AA00-U+AA5F */
   /* Bit 119  Ancient Symbols */
-#define TT_UCR_ANCIENT_SYMBOLS                 (1L << 23) /*U+10190-U+101CF*/
+#define TT_UCR_ANCIENT_SYMBOLS                (1UL << 23) /*U+10190-U+101CF*/
   /* Bit 120  Phaistos Disc */
-#define TT_UCR_PHAISTOS_DISC                   (1L << 24) /*U+101D0-U+101FF*/
+#define TT_UCR_PHAISTOS_DISC                  (1UL << 24) /*U+101D0-U+101FF*/
   /* Bit 121  Carian */
   /*          Lycian */
   /*          Lydian */
-#define TT_UCR_OLD_ANATOLIAN                   (1L << 25) /*U+102A0-U+102DF*/
+#define TT_UCR_OLD_ANATOLIAN                  (1UL << 25) /*U+102A0-U+102DF*/
                                                           /*U+10280-U+1029F*/
                                                           /*U+10920-U+1093F*/
   /* Bit 122  Domino Tiles  */
   /*          Mahjong Tiles */
-#define TT_UCR_GAME_TILES                      (1L << 26) /*U+1F030-U+1F09F*/
+#define TT_UCR_GAME_TILES                     (1UL << 26) /*U+1F030-U+1F09F*/
                                                           /*U+1F000-U+1F02F*/
   /* Bit 123-127 Reserved for process-internal usage */
 
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/tttables.h b/src/java.desktop/share/native/libfreetype/include/freetype/tttables.h
index 2cf0ff1bc61..aa4336435d9 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/tttables.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/tttables.h
@@ -5,7 +5,7 @@
  *   Basic SFNT/TrueType tables definitions and interface
  *   (specification only).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
@@ -192,7 +192,7 @@ FT_BEGIN_HEADER
    *     A pointer into the 'hmtx' table.
    *
    * @note:
-   *   For an OpenType variation font, the values of the following fields can
+   *   For OpenType Font Variations, the values of the following fields can
    *   change after a call to @FT_Set_Var_Design_Coordinates (and friends) if
    *   the font contains an 'MVAR' table: `caret_Slope_Rise`,
    *   `caret_Slope_Run`, and `caret_Offset`.
@@ -310,7 +310,7 @@ FT_BEGIN_HEADER
    *     A pointer into the 'vmtx' table.
    *
    * @note:
-   *   For an OpenType variation font, the values of the following fields can
+   *   For OpenType Font Variations, the values of the following fields can
    *   change after a call to @FT_Set_Var_Design_Coordinates (and friends) if
    *   the font contains an 'MVAR' table: `Ascender`, `Descender`,
    *   `Line_Gap`, `caret_Slope_Rise`, `caret_Slope_Run`, and `caret_Offset`.
@@ -359,7 +359,7 @@ FT_BEGIN_HEADER
    *   table.  In this case, the `version` field is always set to 0xFFFF.
    *
    * @note:
-   *   For an OpenType variation font, the values of the following fields can
+   *   For OpenType Font Variations, the values of the following fields can
    *   change after a call to @FT_Set_Var_Design_Coordinates (and friends) if
    *   the font contains an 'MVAR' table: `sCapHeight`, `sTypoAscender`,
    *   `sTypoDescender`, `sTypoLineGap`, `sxHeight`, `usWinAscent`,
@@ -442,7 +442,7 @@ FT_BEGIN_HEADER
    *   them.
    *
    * @note:
-   *   For an OpenType variation font, the values of the following fields can
+   *   For OpenType Font Variations, the values of the following fields can
    *   change after a call to @FT_Set_Var_Design_Coordinates (and friends) if
    *   the font contains an 'MVAR' table: `underlinePosition` and
    *   `underlineThickness`.
@@ -705,6 +705,9 @@ FT_BEGIN_HEADER
    *     definitions found in the @FT_TRUETYPE_TAGS_H file, or forge a new
    *     one with @FT_MAKE_TAG.
    *
+   *     [Since 2.14] Use value~1 if you want to access the table directory
+   *     of the (currently selected) font.
+   *
    *   offset ::
    *     The starting offset in the table (or file if tag~==~0).
    *
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/tttags.h b/src/java.desktop/share/native/libfreetype/include/freetype/tttags.h
index da0af5d3f23..56bb0a3ee5e 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/tttags.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/tttags.h
@@ -4,7 +4,7 @@
  *
  *   Tags for TrueType and OpenType tables (specification only).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/include/ft2build.h b/src/java.desktop/share/native/libfreetype/include/ft2build.h
index d3d7685039c..3008aea7cf5 100644
--- a/src/java.desktop/share/native/libfreetype/include/ft2build.h
+++ b/src/java.desktop/share/native/libfreetype/include/ft2build.h
@@ -4,7 +4,7 @@
  *
  *   FreeType 2 build and setup macros.
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/autofit/afadjust.c b/src/java.desktop/share/native/libfreetype/src/autofit/afadjust.c
new file mode 100644
index 00000000000..6637cacfccf
--- /dev/null
+++ b/src/java.desktop/share/native/libfreetype/src/autofit/afadjust.c
@@ -0,0 +1,1612 @@
+/****************************************************************************
+ *
+ * afadjust.c
+ *
+ *   Auto-fitter routines to adjust components based on charcode (body).
+ *
+ * Copyright (C) 2023-2025 by
+ * David Turner, Robert Wilhelm, and Werner Lemberg.
+ *
+ * Written by Craig White <gerzytet@gmail.com>.
+ *
+ * This file is part of the FreeType project, and may only be used,
+ * modified, and distributed under the terms of the FreeType project
+ * license, LICENSE.TXT.  By continuing to use, modify, or distribute
+ * this file you indicate that you have read the license and
+ * understand and accept it fully.
+ *
+ */
+
+#include "afadjust.h"
+#ifdef FT_CONFIG_OPTION_USE_HARFBUZZ
+#  include "afgsub.h"
+#endif
+
+#include <freetype/freetype.h>
+#include <freetype/internal/ftobjs.h>
+#include <freetype/internal/ftmemory.h>
+#include <freetype/internal/ftdebug.h>
+
+#define AF_ADJUSTMENT_DATABASE_LENGTH           \
+          ( sizeof ( adjustment_database ) /    \
+            sizeof ( adjustment_database[0] ) )
+
+#undef  FT_COMPONENT
+#define FT_COMPONENT  afadjust
+
+
+  typedef struct  AF_AdjustmentDatabaseEntry_
+  {
+    FT_UInt32  codepoint;
+    FT_UInt32  flags;
+
+  } AF_AdjustmentDatabaseEntry;
+
+
+  /*
+    All entries in this list must be sorted by ascending Unicode code
+    points.  The table entries are 3 numbers consisting of:
+
+    - Unicode code point.
+    - The vertical adjustment type.  This should be a combination of the
+      AF_ADJUST_XXX and AF_IGNORE_XXX macros.
+  */
+  static AF_AdjustmentDatabaseEntry  adjustment_database[] =
+  {
+    /* C0 Controls and Basic Latin */
+    { 0x21,  AF_ADJUST_UP | AF_ADJUST_NO_HEIGHT_CHECK }, /* ! */
+    { 0x51,  AF_IGNORE_CAPITAL_BOTTOM } , /* Q */
+    { 0x3F,  AF_ADJUST_UP | AF_ADJUST_NO_HEIGHT_CHECK }, /* ? */
+    { 0x69,  AF_ADJUST_UP }, /* i */
+    { 0x6A,  AF_ADJUST_UP }, /* j */
+#if 0
+    /* XXX TODO */
+    { 0x7E,  AF_ADJUST_TILDE_TOP }, /* ~ */
+#endif
+
+    /* C1 Controls and Latin-1 Supplement */
+    { 0xA1,  AF_ADJUST_UP }, /* ¡ */
+    { 0xA6,  AF_ADJUST_UP | AF_ADJUST_NO_HEIGHT_CHECK }, /* ¦ */
+    { 0xAA,  AF_ADJUST_UP }, /* ª */
+    { 0xBA,  AF_ADJUST_UP }, /* º */
+    { 0xBF,  AF_ADJUST_UP }, /* ¿ */
+
+    { 0xC0,  AF_ADJUST_UP }, /* À */
+    { 0xC1,  AF_ADJUST_UP }, /* Á */
+    { 0xC2,  AF_ADJUST_UP }, /* Â */
+    { 0xC3,  AF_ADJUST_UP | AF_ADJUST_TILDE_TOP }, /* Ã */
+    { 0xC4,  AF_ADJUST_UP }, /* Ä */
+    { 0xC5,  AF_ADJUST_UP }, /* Å */
+    { 0xC7,  AF_IGNORE_CAPITAL_BOTTOM }, /* Ç */
+    { 0xC8,  AF_ADJUST_UP }, /* È */
+    { 0xC9,  AF_ADJUST_UP }, /* É */
+    { 0xCA,  AF_ADJUST_UP }, /* Ê */
+    { 0xCB,  AF_ADJUST_UP }, /* Ë */
+    { 0xCC,  AF_ADJUST_UP }, /* Ì */
+    { 0xCD,  AF_ADJUST_UP }, /* Í */
+    { 0xCE,  AF_ADJUST_UP }, /* Î */
+    { 0xCF,  AF_ADJUST_UP }, /* Ï */
+
+    { 0xD1,  AF_ADJUST_UP | AF_ADJUST_TILDE_TOP }, /* Ñ */
+    { 0xD2,  AF_ADJUST_UP }, /* Ò */
+    { 0xD3,  AF_ADJUST_UP }, /* Ó */
+    { 0xD4,  AF_ADJUST_UP }, /* Ô */
+    { 0xD5,  AF_ADJUST_UP | AF_ADJUST_TILDE_TOP }, /* Õ */
+    { 0xD6,  AF_ADJUST_UP }, /* Ö */
+    { 0xD8,  AF_IGNORE_CAPITAL_TOP | AF_IGNORE_CAPITAL_BOTTOM }, /* Ø */
+    { 0xD9,  AF_ADJUST_UP }, /* Ù */
+    { 0xDA,  AF_ADJUST_UP }, /* Ú */
+    { 0xDB,  AF_ADJUST_UP }, /* Û */
+    { 0xDC,  AF_ADJUST_UP }, /* Ü */
+    { 0xDD,  AF_ADJUST_UP }, /* Ý */
+
+    { 0xE0,  AF_ADJUST_UP }, /* à */
+    { 0xE1,  AF_ADJUST_UP }, /* á */
+    { 0xE2,  AF_ADJUST_UP }, /* â */
+    { 0xE3,  AF_ADJUST_UP | AF_ADJUST_TILDE_TOP }, /* ã */
+    { 0xE4,  AF_ADJUST_UP }, /* ä */
+    { 0xE5,  AF_ADJUST_UP }, /* å */
+    { 0xE7,  AF_IGNORE_SMALL_BOTTOM }, /* ç */
+    { 0xE8,  AF_ADJUST_UP }, /* è */
+    { 0xE9,  AF_ADJUST_UP }, /* é */
+    { 0xEA,  AF_ADJUST_UP }, /* ê */
+    { 0xEB,  AF_ADJUST_UP }, /* ë */
+    { 0xEC,  AF_ADJUST_UP }, /* ì */
+    { 0xED,  AF_ADJUST_UP }, /* í */
+    { 0xEE,  AF_ADJUST_UP }, /* î */
+    { 0xEF,  AF_ADJUST_UP }, /* ï */
+
+    { 0xF1,  AF_ADJUST_UP | AF_ADJUST_TILDE_TOP }, /* ñ */
+    { 0xF2,  AF_ADJUST_UP }, /* ò */
+    { 0xF3,  AF_ADJUST_UP }, /* ó */
+    { 0xF4,  AF_ADJUST_UP }, /* ô */
+    { 0xF5,  AF_ADJUST_UP | AF_ADJUST_TILDE_TOP }, /* õ */
+    { 0xF6,  AF_ADJUST_UP }, /* ö */
+    { 0xF8,  AF_IGNORE_SMALL_TOP | AF_IGNORE_SMALL_BOTTOM }, /* ø */
+    { 0xF9,  AF_ADJUST_UP }, /* ù */
+    { 0xFA,  AF_ADJUST_UP }, /* ú */
+    { 0xFB,  AF_ADJUST_UP }, /* û */
+    { 0xFC,  AF_ADJUST_UP }, /* ü */
+    { 0xFD,  AF_ADJUST_UP }, /* ý */
+    { 0xFF,  AF_ADJUST_UP }, /* ÿ */
+
+    /* Latin Extended-A */
+    { 0x100, AF_ADJUST_UP }, /* Ā */
+    { 0x101, AF_ADJUST_UP }, /* ā */
+    { 0x102, AF_ADJUST_UP }, /* Ă */
+    { 0x103, AF_ADJUST_UP }, /* ă */
+    { 0x104, AF_IGNORE_CAPITAL_BOTTOM }, /* Ą */
+    { 0x105, AF_IGNORE_SMALL_BOTTOM }, /* ą */
+    { 0x106, AF_ADJUST_UP }, /* Ć */
+    { 0x107, AF_ADJUST_UP }, /* ć */
+    { 0x108, AF_ADJUST_UP }, /* Ĉ */
+    { 0x109, AF_ADJUST_UP }, /* ĉ */
+    { 0x10A, AF_ADJUST_UP }, /* Ċ */
+    { 0x10B, AF_ADJUST_UP }, /* ċ */
+    { 0x10C, AF_ADJUST_UP }, /* Č */
+    { 0x10D, AF_ADJUST_UP }, /* č */
+    { 0x10E, AF_ADJUST_UP }, /* Ď */
+
+    { 0x112, AF_ADJUST_UP }, /* Ē */
+    { 0x113, AF_ADJUST_UP }, /* ē */
+    { 0x114, AF_ADJUST_UP }, /* Ĕ */
+    { 0x115, AF_ADJUST_UP }, /* ĕ */
+    { 0x116, AF_ADJUST_UP }, /* Ė */
+    { 0x117, AF_ADJUST_UP }, /* ė */
+    { 0x118, AF_IGNORE_CAPITAL_BOTTOM }, /* Ę */
+    { 0x119, AF_IGNORE_SMALL_BOTTOM }, /* ę */
+    { 0x11A, AF_ADJUST_UP }, /* Ě */
+    { 0x11B, AF_ADJUST_UP }, /* ě */
+    { 0x11C, AF_ADJUST_UP }, /* Ĝ */
+    { 0x11D, AF_ADJUST_UP }, /* ĝ */
+    { 0x11E, AF_ADJUST_UP }, /* Ğ */
+    { 0x11F, AF_ADJUST_UP }, /* ğ */
+
+    { 0x120, AF_ADJUST_UP }, /* Ġ */
+    { 0x121, AF_ADJUST_UP }, /* ġ */
+    { 0x122, AF_ADJUST_DOWN }, /* Ģ */
+    { 0x123, AF_ADJUST_UP }, /* ģ */
+    { 0x124, AF_ADJUST_UP }, /* Ĥ */
+    { 0x125, AF_ADJUST_UP }, /* ĥ */
+    { 0x128, AF_ADJUST_UP | AF_ADJUST_TILDE_TOP }, /* Ĩ */
+    { 0x129, AF_ADJUST_UP | AF_ADJUST_TILDE_TOP }, /* ĩ */
+    { 0x12A, AF_ADJUST_UP }, /* Ī */
+    { 0x12B, AF_ADJUST_UP }, /* ī */
+    { 0x12C, AF_ADJUST_UP }, /* Ĭ */
+    { 0x12D, AF_ADJUST_UP }, /* ĭ */
+    { 0x12E, AF_IGNORE_CAPITAL_BOTTOM }, /* Į */
+    { 0x12F, AF_ADJUST_UP | AF_IGNORE_SMALL_BOTTOM }, /* į */
+
+    { 0x130, AF_ADJUST_UP }, /* İ */
+    { 0x133, AF_ADJUST_UP }, /* ij */
+    { 0x134, AF_ADJUST_UP }, /* Ĵ */
+    { 0x135, AF_ADJUST_UP }, /* ĵ */
+    { 0x136, AF_ADJUST_DOWN }, /* Ķ */
+    { 0x137, AF_ADJUST_DOWN }, /* ķ */
+    { 0x139, AF_ADJUST_UP }, /* Ĺ */
+    { 0x13A, AF_ADJUST_UP }, /* ĺ */
+    { 0x13B, AF_ADJUST_DOWN }, /* Ļ */
+    { 0x13C, AF_ADJUST_DOWN }, /* ļ */
+
+    { 0x143, AF_ADJUST_UP }, /* Ń */
+    { 0x144, AF_ADJUST_UP }, /* ń */
+    { 0x145, AF_ADJUST_DOWN }, /* Ņ */
+    { 0x146, AF_ADJUST_DOWN }, /* ņ */
+    { 0x147, AF_ADJUST_UP }, /* Ň */
+    { 0x148, AF_ADJUST_UP }, /* ň */
+    { 0x14C, AF_ADJUST_UP }, /* Ō */
+    { 0x14D, AF_ADJUST_UP }, /* ō */
+    { 0x14E, AF_ADJUST_UP }, /* Ŏ */
+    { 0x14F, AF_ADJUST_UP }, /* ŏ */
+
+    { 0x150, AF_ADJUST_UP }, /* Ő */
+    { 0x151, AF_ADJUST_UP }, /* ő */
+    { 0x154, AF_ADJUST_UP }, /* Ŕ */
+    { 0x155, AF_ADJUST_UP }, /* ŕ */
+    { 0x156, AF_ADJUST_DOWN }, /* Ŗ */
+    { 0x157, AF_ADJUST_DOWN }, /* ŗ */
+    { 0x158, AF_ADJUST_UP }, /* Ř */
+    { 0x159, AF_ADJUST_UP }, /* ř */
+    { 0x15A, AF_ADJUST_UP }, /* Ś */
+    { 0x15B, AF_ADJUST_UP }, /* ś */
+    { 0x15C, AF_ADJUST_UP }, /* Ŝ */
+    { 0x15D, AF_ADJUST_UP }, /* ŝ */
+    { 0x15E, AF_IGNORE_CAPITAL_BOTTOM }, /* Ş */
+    { 0x15F, AF_IGNORE_SMALL_BOTTOM }, /* ş */
+
+    { 0x160, AF_ADJUST_UP }, /* Š */
+    { 0x161, AF_ADJUST_UP }, /* š */
+    { 0x162, AF_IGNORE_CAPITAL_BOTTOM }, /* Ţ */
+    { 0x163, AF_IGNORE_SMALL_BOTTOM }, /* ţ */
+    { 0x164, AF_ADJUST_UP }, /* Ť */
+    { 0x168, AF_ADJUST_UP | AF_ADJUST_TILDE_TOP }, /* Ũ */
+    { 0x169, AF_ADJUST_UP | AF_ADJUST_TILDE_TOP }, /* ũ */
+    { 0x16A, AF_ADJUST_UP }, /* Ū */
+    { 0x16B, AF_ADJUST_UP }, /* ū */
+    { 0x16C, AF_ADJUST_UP }, /* Ŭ */
+    { 0x16D, AF_ADJUST_UP }, /* ŭ */
+    { 0x16E, AF_ADJUST_UP }, /* Ů */
+    { 0x16F, AF_ADJUST_UP }, /* ů */
+
+    { 0x170, AF_ADJUST_UP }, /* Ű */
+    { 0x171, AF_ADJUST_UP }, /* ű */
+    { 0x172, AF_IGNORE_CAPITAL_BOTTOM }, /* Ų */
+    { 0x173, AF_IGNORE_SMALL_BOTTOM }, /* ų */
+    { 0x174, AF_ADJUST_UP }, /* Ŵ */
+    { 0x175, AF_ADJUST_UP }, /* ŵ */
+    { 0x176, AF_ADJUST_UP }, /* Ŷ */
+    { 0x177, AF_ADJUST_UP }, /* ŷ */
+    { 0x178, AF_ADJUST_UP }, /* Ÿ */
+    { 0x179, AF_ADJUST_UP }, /* Ź */
+    { 0x17A, AF_ADJUST_UP }, /* ź */
+    { 0x17B, AF_ADJUST_UP }, /* Ż */
+    { 0x17C, AF_ADJUST_UP }, /* ż */
+    { 0x17D, AF_ADJUST_UP }, /* Ž */
+    { 0x17E, AF_ADJUST_UP }, /* ž */
+
+    /* Latin Extended-B */
+    { 0x187, AF_IGNORE_CAPITAL_TOP }, /* Ƈ */
+    { 0x188, AF_IGNORE_SMALL_TOP }, /* ƈ */
+
+    { 0x1A0, AF_IGNORE_CAPITAL_TOP }, /* Ơ */
+    { 0x1A1, AF_IGNORE_SMALL_TOP }, /* ơ */
+    { 0x1A5, AF_IGNORE_SMALL_TOP }, /* ƥ */
+    { 0x1AB, AF_IGNORE_SMALL_BOTTOM }, /* ƫ */
+    { 0x1AE, AF_IGNORE_CAPITAL_BOTTOM }, /* Ʈ */
+    { 0x1AF, AF_IGNORE_CAPITAL_TOP }, /* Ư */
+
+    { 0x1B0, AF_IGNORE_SMALL_TOP }, /* ư */
+    { 0x1B4, AF_IGNORE_SMALL_TOP }, /* ƴ */
+
+    { 0x1C3, AF_ADJUST_UP | AF_ADJUST_NO_HEIGHT_CHECK }, /* ǃ */
+    { 0x1C4, AF_ADJUST_UP }, /* DŽ */
+#if 0
+    { 0x1C5, AF_ADJUST_UP }, /* Dž */
+    { 0x1C6, AF_ADJUST_UP }, /* dž */
+    { 0x1C8, AF_ADJUST_UP }, /* Lj */
+    { 0x1C9, AF_ADJUST_UP }, /* lj */
+    { 0x1CB, AF_ADJUST_UP }, /* Nj */
+#endif
+    { 0x1CC, AF_ADJUST_UP }, /* nj */
+    { 0x1CD, AF_ADJUST_UP }, /* Ǎ */
+    { 0x1CE, AF_ADJUST_UP }, /* ǎ */
+    { 0x1CF, AF_ADJUST_UP }, /* Ǐ */
+
+    { 0x1D0, AF_ADJUST_UP }, /* ǐ */
+    { 0x1D1, AF_ADJUST_UP }, /* Ǒ */
+    { 0x1D2, AF_ADJUST_UP }, /* ǒ */
+    { 0x1D3, AF_ADJUST_UP }, /* Ǔ */
+    { 0x1D4, AF_ADJUST_UP }, /* ǔ */
+    { 0x1D5, AF_ADJUST_UP2 }, /* Ǖ */
+    { 0x1D6, AF_ADJUST_UP2 }, /* ǖ */
+    { 0x1D7, AF_ADJUST_UP2 }, /* Ǘ */
+    { 0x1D8, AF_ADJUST_UP2 }, /* ǘ */
+    { 0x1D9, AF_ADJUST_UP2 }, /* Ǚ */
+    { 0x1DA, AF_ADJUST_UP2 }, /* ǚ */
+    { 0x1DB, AF_ADJUST_UP2 }, /* Ǜ */
+    { 0x1DC, AF_ADJUST_UP2 }, /* ǜ */
+    { 0x1DE, AF_ADJUST_UP2 }, /* Ǟ */
+    { 0x1DF, AF_ADJUST_UP2 }, /* ǟ */
+
+    { 0x1E0, AF_ADJUST_UP2 }, /* Ǡ */
+    { 0x1E1, AF_ADJUST_UP2 }, /* ǡ */
+    { 0x1E2, AF_ADJUST_UP }, /* Ǣ */
+    { 0x1E3, AF_ADJUST_UP }, /* ǣ */
+    { 0x1E6, AF_ADJUST_UP }, /* Ǧ */
+    { 0x1E7, AF_ADJUST_UP }, /* ǧ */
+    { 0x1E8, AF_ADJUST_UP }, /* Ǩ */
+    { 0x1E9, AF_ADJUST_UP }, /* ǩ */
+    { 0x1EA, AF_IGNORE_CAPITAL_BOTTOM }, /* Ǫ */
+    { 0x1EB, AF_IGNORE_SMALL_BOTTOM }, /* ǫ */
+    { 0x1EC, AF_ADJUST_UP | AF_IGNORE_CAPITAL_BOTTOM }, /* Ǭ */
+    { 0x1ED, AF_ADJUST_UP | AF_IGNORE_SMALL_BOTTOM }, /* ǭ */
+    { 0x1EE, AF_ADJUST_UP }, /* Ǯ */
+    { 0x1EF, AF_ADJUST_UP }, /* ǯ */
+
+    { 0x1F0, AF_ADJUST_UP }, /* ǰ */
+    { 0x1F4, AF_ADJUST_UP }, /* Ǵ */
+    { 0x1F5, AF_ADJUST_UP }, /* ǵ */
+    { 0x1F8, AF_ADJUST_UP }, /* Ǹ */
+    { 0x1F9, AF_ADJUST_UP }, /* ǹ */
+    { 0x1FA, AF_ADJUST_UP2 }, /* Ǻ */
+    { 0x1FB, AF_ADJUST_UP2 }, /* ǻ */
+    { 0x1FC, AF_ADJUST_UP }, /* Ǽ */
+    { 0x1FD, AF_ADJUST_UP }, /* ǽ */
+    { 0x1FE, AF_ADJUST_UP }, /* Ǿ */
+    { 0x1FF, AF_ADJUST_UP }, /* ǿ */
+
+    { 0x200, AF_ADJUST_UP }, /* Ȁ */
+    { 0x201, AF_ADJUST_UP }, /* ȁ */
+    { 0x202, AF_ADJUST_UP }, /* Ȃ */
+    { 0x203, AF_ADJUST_UP }, /* ȃ */
+    { 0x204, AF_ADJUST_UP }, /* Ȅ */
+    { 0x205, AF_ADJUST_UP }, /* ȅ */
+    { 0x206, AF_ADJUST_UP }, /* Ȇ */
+    { 0x207, AF_ADJUST_UP }, /* ȇ */
+    { 0x208, AF_ADJUST_UP }, /* Ȉ */
+    { 0x209, AF_ADJUST_UP }, /* ȉ */
+    { 0x20A, AF_ADJUST_UP }, /* Ȋ */
+    { 0x20B, AF_ADJUST_UP }, /* ȋ */
+    { 0x20C, AF_ADJUST_UP }, /* Ȍ */
+    { 0x20D, AF_ADJUST_UP }, /* ȍ */
+    { 0x20E, AF_ADJUST_UP }, /* Ȏ */
+    { 0x20F, AF_ADJUST_UP }, /* ȏ */
+
+    { 0x210, AF_ADJUST_UP }, /* Ȑ */
+    { 0x211, AF_ADJUST_UP }, /* ȑ */
+    { 0x212, AF_ADJUST_UP }, /* Ȓ */
+    { 0x213, AF_ADJUST_UP }, /* ȓ */
+    { 0x214, AF_ADJUST_UP }, /* Ȕ */
+    { 0x215, AF_ADJUST_UP }, /* ȕ */
+    { 0x216, AF_ADJUST_UP }, /* Ȗ */
+    { 0x217, AF_ADJUST_UP }, /* ȗ */
+    { 0x218, AF_ADJUST_DOWN }, /* Ș */
+    { 0x219, AF_ADJUST_DOWN }, /* ș */
+    { 0x21A, AF_ADJUST_DOWN }, /* Ț */
+    { 0x21B, AF_ADJUST_DOWN }, /* ț */
+    { 0x21E, AF_ADJUST_UP }, /* Ȟ */
+    { 0x21F, AF_ADJUST_UP }, /* ȟ */
+
+    { 0x224, AF_IGNORE_CAPITAL_BOTTOM }, /* Ȥ */
+    { 0x225, AF_IGNORE_SMALL_BOTTOM }, /* ȥ */
+    { 0x226, AF_ADJUST_UP }, /* Ȧ */
+    { 0x227, AF_ADJUST_UP }, /* ȧ */
+    { 0x228, AF_IGNORE_CAPITAL_BOTTOM }, /* Ȩ */
+    { 0x229, AF_IGNORE_SMALL_BOTTOM }, /* ȩ */
+    { 0x22A, AF_ADJUST_UP2 }, /* Ȫ */
+    { 0x22B, AF_ADJUST_UP2 }, /* ȫ */
+    { 0x22C, AF_ADJUST_UP2 }, /* Ȭ */
+    { 0x22D, AF_ADJUST_UP2 }, /* ȭ */
+    { 0x22E, AF_ADJUST_UP }, /* Ȯ */
+    { 0x22F, AF_ADJUST_UP }, /* ȯ */
+
+    { 0x230, AF_ADJUST_UP2 }, /* Ȱ */
+    { 0x231, AF_ADJUST_UP2 }, /* ȱ */
+    { 0x232, AF_ADJUST_UP }, /* Ȳ */
+    { 0x233, AF_ADJUST_UP }, /* ȳ */
+    { 0x23A, AF_IGNORE_CAPITAL_TOP | AF_IGNORE_CAPITAL_BOTTOM }, /* Ⱥ */
+    { 0x23B, AF_IGNORE_CAPITAL_TOP | AF_IGNORE_CAPITAL_BOTTOM }, /* Ȼ */
+    { 0x23F, AF_IGNORE_SMALL_BOTTOM }, /* ȿ */
+
+    { 0x240, AF_IGNORE_SMALL_BOTTOM }, /* ɀ */
+    { 0x249, AF_ADJUST_UP }, /* ɉ */
+
+    /* IPA Extensions */
+    { 0x256, AF_IGNORE_SMALL_BOTTOM }, /* ɖ */
+
+    { 0x260, AF_IGNORE_SMALL_TOP }, /* ɠ */
+    { 0x267, AF_IGNORE_SMALL_BOTTOM }, /* ɧ */
+    { 0x268, AF_ADJUST_UP }, /* ɨ */
+
+    { 0x272, AF_IGNORE_SMALL_BOTTOM }, /* ɲ */
+    { 0x273, AF_IGNORE_SMALL_BOTTOM }, /* ɳ */
+    { 0x27B, AF_IGNORE_SMALL_BOTTOM }, /* ɻ */
+    { 0x27D, AF_IGNORE_SMALL_BOTTOM }, /* ɽ */
+
+    { 0x282, AF_IGNORE_SMALL_BOTTOM }, /* ʂ */
+    { 0x288, AF_IGNORE_SMALL_BOTTOM }, /* ʈ */
+
+    { 0x290, AF_IGNORE_SMALL_BOTTOM }, /* ʐ */
+    { 0x29B, AF_IGNORE_SMALL_TOP }, /* ʛ */
+
+    { 0x2A0, AF_IGNORE_SMALL_TOP }, /* ʠ */
+
+    /* Spacing Modifier Letters */
+    { 0x2B2, AF_ADJUST_UP }, /* ʲ */
+    { 0x2B5, AF_IGNORE_SMALL_BOTTOM }, /* ʵ */
+
+    /* Greek and Coptic */
+    { 0x390, AF_ADJUST_UP2 }, /* ΐ */
+
+    { 0x3AA, AF_ADJUST_UP }, /* Ϊ */
+    { 0x3AB, AF_ADJUST_UP }, /* Ϋ */
+    { 0x3AC, AF_ADJUST_UP }, /* ά */
+    { 0x3AD, AF_ADJUST_UP }, /* έ */
+    { 0x3AE, AF_ADJUST_UP }, /* ή */
+    { 0x3AF, AF_ADJUST_UP }, /* ί */
+
+    { 0x3B0, AF_ADJUST_UP2 }, /* ΰ */
+
+    { 0x3CA, AF_ADJUST_UP }, /* ϊ */
+    { 0x3CB, AF_ADJUST_UP }, /* ϋ */
+    { 0x3CC, AF_ADJUST_UP }, /* ό */
+    { 0x3CD, AF_ADJUST_UP }, /* ύ */
+    { 0x3CE, AF_ADJUST_UP }, /* ώ */
+    { 0x3CF, AF_IGNORE_CAPITAL_BOTTOM }, /* Ϗ */
+
+    { 0x3D4, AF_ADJUST_UP }, /* ϔ */
+    { 0x3D7, AF_IGNORE_SMALL_BOTTOM }, /* ϗ */
+    { 0x3D9, AF_IGNORE_SMALL_BOTTOM }, /* ϙ */
+
+    { 0x3E2, AF_IGNORE_CAPITAL_BOTTOM }, /* Ϣ */
+    { 0x3E3, AF_IGNORE_SMALL_BOTTOM }, /* ϣ */
+
+    { 0x3F3, AF_ADJUST_UP }, /* ϳ */
+
+    /* Cyrillic */
+    { 0x400, AF_ADJUST_UP }, /* Ѐ */
+    { 0x401, AF_ADJUST_UP }, /* Ё */
+    { 0x403, AF_ADJUST_UP }, /* Ѓ */
+    { 0x407, AF_ADJUST_UP }, /* Ї */
+    { 0x40C, AF_ADJUST_UP }, /* Ќ */
+    { 0x40D, AF_ADJUST_UP }, /* Ѝ */
+    { 0x40E, AF_ADJUST_UP }, /* Ў */
+    { 0x40F, AF_IGNORE_CAPITAL_BOTTOM }, /* Џ */
+
+    { 0x419, AF_ADJUST_UP }, /* Й */
+
+    { 0x426, AF_IGNORE_CAPITAL_BOTTOM }, /* Ц */
+    { 0x429, AF_IGNORE_CAPITAL_BOTTOM }, /* Щ */
+
+    { 0x439, AF_ADJUST_UP }, /* й */
+
+    { 0x446, AF_IGNORE_SMALL_BOTTOM }, /* ц */
+    { 0x449, AF_IGNORE_SMALL_BOTTOM }, /* щ */
+
+    { 0x450, AF_ADJUST_UP }, /* ѐ */
+    { 0x451, AF_ADJUST_UP }, /* ё */
+    { 0x453, AF_ADJUST_UP }, /* ѓ */
+    { 0x456, AF_ADJUST_UP }, /* і */
+    { 0x457, AF_ADJUST_UP }, /* ї */
+    { 0x458, AF_ADJUST_UP }, /* ј */
+    { 0x45C, AF_ADJUST_UP }, /* ќ */
+    { 0x45D, AF_ADJUST_UP }, /* ѝ */
+    { 0x45E, AF_ADJUST_UP }, /* ў */
+    { 0x45F, AF_IGNORE_SMALL_BOTTOM }, /* џ */
+
+    { 0x476, AF_ADJUST_UP }, /* Ѷ */
+    { 0x477, AF_ADJUST_UP }, /* ѷ */
+    { 0x47C, AF_ADJUST_UP2 }, /* Ѽ */
+    { 0x47D, AF_ADJUST_UP2 }, /* ѽ */
+    { 0x47E, AF_ADJUST_UP }, /* Ѿ */
+    { 0x47F, AF_ADJUST_UP }, /* ѿ */
+
+    { 0x480, AF_IGNORE_CAPITAL_BOTTOM }, /* Ҁ */
+    { 0x481, AF_IGNORE_SMALL_BOTTOM }, /* ҁ */
+    { 0x48A, AF_ADJUST_UP | AF_IGNORE_CAPITAL_BOTTOM }, /* Ҋ */
+    { 0x48B, AF_ADJUST_UP | AF_IGNORE_SMALL_BOTTOM }, /* ҋ */
+
+    { 0x490, AF_IGNORE_CAPITAL_TOP }, /* Ґ */
+    { 0x491, AF_IGNORE_SMALL_TOP }, /* ґ */
+    { 0x496, AF_IGNORE_CAPITAL_BOTTOM }, /* Җ */
+    { 0x497, AF_IGNORE_SMALL_BOTTOM }, /* җ */
+    { 0x498, AF_IGNORE_CAPITAL_BOTTOM }, /* Ҙ */
+    { 0x499, AF_IGNORE_SMALL_BOTTOM }, /* ҙ */
+    { 0x49A, AF_IGNORE_CAPITAL_BOTTOM }, /* Қ */
+    { 0x49B, AF_IGNORE_SMALL_BOTTOM }, /* қ */
+
+    { 0x4A2, AF_IGNORE_CAPITAL_BOTTOM }, /* Ң */
+    { 0x4A3, AF_IGNORE_SMALL_BOTTOM }, /* ң */
+    { 0x4AA, AF_IGNORE_CAPITAL_BOTTOM }, /* Ҫ */
+    { 0x4AB, AF_IGNORE_SMALL_BOTTOM }, /* ҫ */
+    { 0x4AC, AF_IGNORE_CAPITAL_BOTTOM }, /* Ҭ */
+    { 0x4AD, AF_IGNORE_SMALL_BOTTOM }, /* ҭ */
+
+    { 0x4B2, AF_IGNORE_CAPITAL_BOTTOM }, /* Ҳ */
+    { 0x4B3, AF_IGNORE_SMALL_BOTTOM }, /* ҳ */
+    { 0x4B4, AF_IGNORE_CAPITAL_BOTTOM }, /* Ҵ */
+    { 0x4B5, AF_IGNORE_SMALL_BOTTOM }, /* ҵ */
+    { 0x4B6, AF_IGNORE_CAPITAL_BOTTOM }, /* Ҷ */
+    { 0x4B7, AF_IGNORE_SMALL_BOTTOM }, /* ҷ */
+    { 0x4BE, AF_IGNORE_CAPITAL_BOTTOM }, /* Ҿ */
+    { 0x4BF, AF_IGNORE_SMALL_BOTTOM }, /* ҿ */
+
+    { 0x4C1, AF_ADJUST_UP }, /* Ӂ */
+    { 0x4C2, AF_ADJUST_UP }, /* ӂ */
+    { 0x4C5, AF_IGNORE_CAPITAL_BOTTOM }, /* Ӆ */
+    { 0x4C6, AF_IGNORE_SMALL_BOTTOM }, /* ӆ */
+    { 0x4C9, AF_IGNORE_CAPITAL_BOTTOM }, /* Ӊ */
+    { 0x4CA, AF_IGNORE_SMALL_BOTTOM }, /* ӊ */
+    { 0x4CB, AF_IGNORE_CAPITAL_BOTTOM }, /* Ӌ */
+    { 0x4CC, AF_IGNORE_SMALL_BOTTOM }, /* ӌ */
+    { 0x4CD, AF_IGNORE_CAPITAL_BOTTOM }, /* Ӎ */
+    { 0x4CE, AF_IGNORE_SMALL_BOTTOM }, /* ӎ */
+
+    { 0x4D0, AF_ADJUST_UP }, /* Ӑ */
+    { 0x4D1, AF_ADJUST_UP }, /* ӑ */
+    { 0x4D2, AF_ADJUST_UP }, /* Ӓ */
+    { 0x4D3, AF_ADJUST_UP }, /* ӓ */
+    { 0x4D6, AF_ADJUST_UP }, /* Ӗ */
+    { 0x4D7, AF_ADJUST_UP }, /* ӗ */
+    { 0x4DA, AF_ADJUST_UP }, /* Ӛ */
+    { 0x4DB, AF_ADJUST_UP }, /* ӛ */
+    { 0x4DC, AF_ADJUST_UP }, /* Ӝ */
+    { 0x4DD, AF_ADJUST_UP }, /* ӝ */
+    { 0x4DE, AF_ADJUST_UP }, /* Ӟ */
+    { 0x4DF, AF_ADJUST_UP }, /* ӟ */
+
+    { 0x4E2, AF_ADJUST_UP }, /* Ӣ */
+    { 0x4E3, AF_ADJUST_UP }, /* ӣ */
+    { 0x4E4, AF_ADJUST_UP }, /* Ӥ */
+    { 0x4E5, AF_ADJUST_UP }, /* ӥ */
+    { 0x4E6, AF_ADJUST_UP }, /* Ӧ */
+    { 0x4E7, AF_ADJUST_UP }, /* ӧ */
+    { 0x4EA, AF_ADJUST_UP }, /* Ӫ */
+    { 0x4EB, AF_ADJUST_UP }, /* ӫ */
+    { 0x4EC, AF_ADJUST_UP }, /* Ӭ */
+    { 0x4ED, AF_ADJUST_UP }, /* ӭ */
+    { 0x4EE, AF_ADJUST_UP }, /* Ӯ */
+    { 0x4EF, AF_ADJUST_UP }, /* ӯ */
+
+    { 0x4F0, AF_ADJUST_UP }, /* Ӱ */
+    { 0x4F1, AF_ADJUST_UP }, /* ӱ */
+    { 0x4F2, AF_ADJUST_UP }, /* Ӳ */
+    { 0x4F3, AF_ADJUST_UP }, /* ӳ */
+    { 0x4F4, AF_ADJUST_UP }, /* Ӵ */
+    { 0x4F5, AF_ADJUST_UP }, /* ӵ */
+    { 0x4F6, AF_IGNORE_CAPITAL_BOTTOM }, /* Ӷ */
+    { 0x4F7, AF_IGNORE_SMALL_BOTTOM }, /* ӷ */
+    { 0x4F8, AF_ADJUST_UP }, /* Ӹ */
+    { 0x4F9, AF_ADJUST_UP }, /* ӹ */
+    { 0x4FA, AF_IGNORE_CAPITAL_BOTTOM }, /* Ӻ */
+    { 0x4FB, AF_IGNORE_SMALL_BOTTOM }, /* ӻ */
+
+    /* Cyrillic Supplement */
+    { 0x506, AF_IGNORE_CAPITAL_BOTTOM }, /* Ԇ */
+    { 0x507, AF_IGNORE_SMALL_BOTTOM }, /* ԇ */
+
+    { 0x524, AF_IGNORE_CAPITAL_BOTTOM }, /* Ԥ */
+    { 0x525, AF_IGNORE_SMALL_BOTTOM }, /* ԥ */
+    { 0x526, AF_IGNORE_CAPITAL_BOTTOM }, /* Ԧ */
+    { 0x527, AF_IGNORE_SMALL_BOTTOM }, /* ԧ */
+    { 0x52E, AF_IGNORE_CAPITAL_BOTTOM }, /* Ԯ */
+    { 0x52F, AF_IGNORE_SMALL_BOTTOM }, /* ԯ */
+
+    /* Cherokee */
+    { 0x13A5, AF_ADJUST_UP }, /* Ꭵ */
+
+    /* Phonetic Extensions */
+    { 0x1D09, AF_ADJUST_DOWN }, /* ᴉ */
+
+    { 0x1D4E, AF_ADJUST_DOWN }, /* ᵎ */
+
+    { 0x1D51, AF_IGNORE_SMALL_BOTTOM }, /* ᵑ */
+
+    { 0x1D62, AF_ADJUST_UP }, /* ᵢ */
+
+    /* Phonetic Extensions Supplement */
+    { 0x1D80, AF_IGNORE_SMALL_BOTTOM }, /* ᶀ */
+    { 0x1D81, AF_IGNORE_SMALL_BOTTOM }, /* ᶁ */
+    { 0x1D82, AF_IGNORE_SMALL_BOTTOM }, /* ᶂ */
+    { 0x1D84, AF_IGNORE_SMALL_BOTTOM }, /* ᶄ */
+    { 0x1D85, AF_IGNORE_SMALL_BOTTOM }, /* ᶅ */
+    { 0x1D86, AF_IGNORE_SMALL_BOTTOM }, /* ᶆ */
+    { 0x1D87, AF_IGNORE_SMALL_BOTTOM }, /* ᶇ */
+    { 0x1D89, AF_IGNORE_SMALL_BOTTOM }, /* ᶉ */
+    { 0x1D8A, AF_IGNORE_SMALL_BOTTOM }, /* ᶊ */
+    { 0x1D8C, AF_IGNORE_SMALL_BOTTOM }, /* ᶌ */
+    { 0x1D8D, AF_IGNORE_SMALL_BOTTOM }, /* ᶍ */
+    { 0x1D8E, AF_IGNORE_SMALL_BOTTOM }, /* ᶎ */
+    { 0x1D8F, AF_IGNORE_SMALL_BOTTOM }, /* ᶏ */
+
+    { 0x1D90, AF_IGNORE_SMALL_BOTTOM }, /* ᶐ */
+    { 0x1D91, AF_IGNORE_SMALL_BOTTOM }, /* ᶑ */
+    { 0x1D92, AF_IGNORE_SMALL_BOTTOM }, /* ᶒ */
+    { 0x1D93, AF_IGNORE_SMALL_BOTTOM }, /* ᶓ */
+    { 0x1D94, AF_IGNORE_SMALL_BOTTOM }, /* ᶔ */
+    { 0x1D95, AF_IGNORE_SMALL_BOTTOM }, /* ᶕ */
+    { 0x1D96, AF_ADJUST_UP | AF_IGNORE_SMALL_BOTTOM }, /* ᶖ */
+    { 0x1D97, AF_IGNORE_SMALL_BOTTOM }, /* ᶗ */
+    { 0x1D98, AF_IGNORE_SMALL_BOTTOM }, /* ᶘ */
+    { 0x1D99, AF_IGNORE_SMALL_BOTTOM }, /* ᶙ */
+    { 0x1D9A, AF_IGNORE_SMALL_BOTTOM }, /* ᶚ */
+
+    { 0x1DA4, AF_ADJUST_UP }, /* ᶤ */
+    { 0x1DA8, AF_ADJUST_UP }, /* ᶨ */
+    { 0x1DA9, AF_IGNORE_SMALL_BOTTOM }, /* ᶩ */
+    { 0x1DAA, AF_IGNORE_SMALL_BOTTOM }, /* ᶪ */
+    { 0x1DAC, AF_IGNORE_SMALL_BOTTOM }, /* ᶬ */
+    { 0x1DAE, AF_IGNORE_SMALL_BOTTOM }, /* ᶮ */
+    { 0x1DAF, AF_IGNORE_SMALL_BOTTOM }, /* ᶯ */
+
+    { 0x1DB3, AF_IGNORE_SMALL_BOTTOM }, /* ᶳ */
+    { 0x1DB5, AF_IGNORE_SMALL_BOTTOM }, /* ᶵ */
+    { 0x1DBC, AF_IGNORE_SMALL_BOTTOM }, /* ᶼ */
+
+    /* Latin Extended Additional */
+    { 0x1E00, AF_ADJUST_DOWN }, /* Ḁ */
+    { 0x1E01, AF_ADJUST_DOWN }, /* ḁ */
+    { 0x1E02, AF_ADJUST_UP }, /* Ḃ */
+    { 0x1E03, AF_ADJUST_UP }, /* ḃ */
+    { 0x1E04, AF_ADJUST_DOWN }, /* Ḅ */
+    { 0x1E05, AF_ADJUST_DOWN }, /* ḅ */
+    { 0x1E06, AF_ADJUST_DOWN }, /* Ḇ */
+    { 0x1E07, AF_ADJUST_DOWN }, /* ḇ */
+    { 0x1E08, AF_ADJUST_UP | AF_IGNORE_CAPITAL_BOTTOM }, /* Ḉ */
+    { 0x1E09, AF_ADJUST_UP | AF_IGNORE_SMALL_BOTTOM }, /* ḉ */
+    { 0x1E0A, AF_ADJUST_UP }, /* Ḋ */
+    { 0x1E0B, AF_ADJUST_UP }, /* ḋ */
+    { 0x1E0C, AF_ADJUST_DOWN }, /* Ḍ */
+    { 0x1E0D, AF_ADJUST_DOWN }, /* ḍ */
+    { 0x1E0E, AF_ADJUST_DOWN }, /* Ḏ */
+    { 0x1E0F, AF_ADJUST_DOWN }, /* ḏ */
+
+    { 0x1E10, AF_ADJUST_DOWN }, /* Ḑ */
+    { 0x1E11, AF_ADJUST_DOWN }, /* ḑ */
+    { 0x1E12, AF_ADJUST_DOWN }, /* Ḓ */
+    { 0x1E13, AF_ADJUST_DOWN }, /* ḓ */
+    { 0x1E14, AF_ADJUST_UP2 }, /* Ḕ */
+    { 0x1E15, AF_ADJUST_UP2 }, /* ḕ */
+    { 0x1E16, AF_ADJUST_UP2 }, /* Ḗ */
+    { 0x1E17, AF_ADJUST_UP2 }, /* ḗ */
+    { 0x1E18, AF_ADJUST_DOWN }, /* Ḙ */
+    { 0x1E19, AF_ADJUST_DOWN }, /* ḙ */
+    { 0x1E1A, AF_ADJUST_DOWN | AF_ADJUST_TILDE_BOTTOM }, /* Ḛ */
+    { 0x1E1B, AF_ADJUST_DOWN | AF_ADJUST_TILDE_BOTTOM }, /* ḛ */
+    { 0x1E1C, AF_ADJUST_UP | AF_IGNORE_CAPITAL_BOTTOM }, /* Ḝ */
+    { 0x1E1D, AF_ADJUST_UP | AF_IGNORE_SMALL_BOTTOM }, /* ḝ */
+    { 0x1E1E, AF_ADJUST_UP }, /* Ḟ */
+    { 0x1E1F, AF_ADJUST_UP }, /* ḟ */
+
+    { 0x1E20, AF_ADJUST_UP }, /* Ḡ */
+    { 0x1E21, AF_ADJUST_UP }, /* ḡ */
+    { 0x1E22, AF_ADJUST_UP }, /* Ḣ */
+    { 0x1E23, AF_ADJUST_UP }, /* ḣ */
+    { 0x1E24, AF_ADJUST_DOWN }, /* Ḥ */
+    { 0x1E25, AF_ADJUST_DOWN }, /* ḥ */
+    { 0x1E26, AF_ADJUST_UP }, /* Ḧ */
+    { 0x1E27, AF_ADJUST_UP }, /* ḧ */
+    { 0x1E28, AF_IGNORE_CAPITAL_BOTTOM }, /* Ḩ */
+    { 0x1E29, AF_IGNORE_SMALL_BOTTOM }, /* ḩ */
+    { 0x1E2A, AF_ADJUST_DOWN }, /* Ḫ */
+    { 0x1E2B, AF_ADJUST_DOWN }, /* ḫ */
+    { 0x1E2C, AF_ADJUST_DOWN | AF_ADJUST_TILDE_BOTTOM }, /* Ḭ */
+    { 0x1E2D, AF_ADJUST_UP | AF_ADJUST_DOWN | AF_ADJUST_TILDE_BOTTOM }, /* ḭ */
+    { 0x1E2E, AF_ADJUST_UP2 }, /* Ḯ */
+    { 0x1E2F, AF_ADJUST_UP2 }, /* ḯ */
+
+    { 0x1E30, AF_ADJUST_UP }, /* Ḱ */
+    { 0x1E31, AF_ADJUST_UP }, /* ḱ */
+    { 0x1E32, AF_ADJUST_DOWN }, /* Ḳ */
+    { 0x1E33, AF_ADJUST_DOWN }, /* ḳ */
+    { 0x1E34, AF_ADJUST_DOWN }, /* Ḵ */
+    { 0x1E35, AF_ADJUST_DOWN }, /* ḵ */
+    { 0x1E36, AF_ADJUST_DOWN }, /* Ḷ */
+    { 0x1E37, AF_ADJUST_DOWN }, /* ḷ */
+    { 0x1E38, AF_ADJUST_UP | AF_ADJUST_DOWN }, /* Ḹ */
+    { 0x1E39, AF_ADJUST_UP | AF_ADJUST_DOWN }, /* ḹ */
+    { 0x1E3A, AF_ADJUST_DOWN }, /* Ḻ */
+    { 0x1E3B, AF_ADJUST_DOWN }, /* ḻ */
+    { 0x1E3C, AF_ADJUST_DOWN }, /* Ḽ */
+    { 0x1E3D, AF_ADJUST_DOWN }, /* ḽ */
+    { 0x1E3E, AF_ADJUST_UP }, /* Ḿ */
+    { 0x1E3F, AF_ADJUST_UP }, /* ḿ */
+
+    { 0x1E40, AF_ADJUST_UP }, /* Ṁ */
+    { 0x1E41, AF_ADJUST_UP }, /* ṁ */
+    { 0x1E42, AF_ADJUST_DOWN }, /* Ṃ */
+    { 0x1E43, AF_ADJUST_DOWN }, /* ṃ */
+    { 0x1E44, AF_ADJUST_UP }, /* Ṅ */
+    { 0x1E45, AF_ADJUST_UP }, /* ṅ */
+    { 0x1E46, AF_ADJUST_DOWN }, /* Ṇ */
+    { 0x1E47, AF_ADJUST_DOWN }, /* ṇ */
+    { 0x1E48, AF_ADJUST_DOWN }, /* Ṉ */
+    { 0x1E49, AF_ADJUST_DOWN }, /* ṉ */
+    { 0x1E4A, AF_ADJUST_DOWN }, /* Ṋ */
+    { 0x1E4B, AF_ADJUST_DOWN }, /* ṋ */
+    { 0x1E4C, AF_ADJUST_UP2 | AF_ADJUST_TILDE_TOP2 }, /* Ṍ */
+    { 0x1E4D, AF_ADJUST_UP2 | AF_ADJUST_TILDE_TOP2 }, /* ṍ */
+    { 0x1E4E, AF_ADJUST_UP2 | AF_ADJUST_TILDE_TOP2 }, /* Ṏ */
+    { 0x1E4F, AF_ADJUST_UP2 | AF_ADJUST_TILDE_TOP2 }, /* ṏ */
+
+    { 0x1E50, AF_ADJUST_UP2 }, /* Ṑ */
+    { 0x1E51, AF_ADJUST_UP2 }, /* ṑ */
+    { 0x1E52, AF_ADJUST_UP2 }, /* Ṓ */
+    { 0x1E53, AF_ADJUST_UP2 }, /* ṓ */
+    { 0x1E54, AF_ADJUST_UP }, /* Ṕ */
+    { 0x1E55, AF_ADJUST_UP }, /* ṕ */
+    { 0x1E56, AF_ADJUST_UP }, /* Ṗ */
+    { 0x1E57, AF_ADJUST_UP }, /* ṗ */
+    { 0x1E58, AF_ADJUST_UP }, /* Ṙ */
+    { 0x1E59, AF_ADJUST_UP }, /* ṙ */
+    { 0x1E5A, AF_ADJUST_DOWN }, /* Ṛ */
+    { 0x1E5B, AF_ADJUST_DOWN }, /* ṛ */
+    { 0x1E5C, AF_ADJUST_UP | AF_ADJUST_DOWN }, /* Ṝ */
+    { 0x1E5D, AF_ADJUST_UP | AF_ADJUST_DOWN }, /* ṝ */
+    { 0x1E5E, AF_ADJUST_DOWN }, /* Ṟ */
+    { 0x1E5F, AF_ADJUST_DOWN }, /* ṟ */
+
+    { 0x1E60, AF_ADJUST_UP }, /* Ṡ */
+    { 0x1E61, AF_ADJUST_UP }, /* ṡ */
+    { 0x1E62, AF_ADJUST_DOWN }, /* Ṣ */
+    { 0x1E63, AF_ADJUST_DOWN }, /* ṣ */
+    { 0x1E64, AF_ADJUST_UP }, /* Ṥ */
+    { 0x1E65, AF_ADJUST_UP }, /* ṥ */
+    { 0x1E66, AF_ADJUST_UP }, /* Ṧ */
+    { 0x1E67, AF_ADJUST_UP }, /* ṧ */
+    { 0x1E68, AF_ADJUST_UP | AF_ADJUST_DOWN }, /* Ṩ */
+    { 0x1E69, AF_ADJUST_UP | AF_ADJUST_DOWN }, /* ṩ */
+    { 0x1E6A, AF_ADJUST_UP }, /* Ṫ */
+    { 0x1E6B, AF_ADJUST_UP }, /* ṫ */
+    { 0x1E6C, AF_ADJUST_DOWN }, /* Ṭ */
+    { 0x1E6D, AF_ADJUST_DOWN }, /* ṭ */
+    { 0x1E6E, AF_ADJUST_DOWN }, /* Ṯ */
+    { 0x1E6F, AF_ADJUST_DOWN }, /* ṯ */
+
+    { 0x1E70, AF_ADJUST_DOWN }, /* Ṱ */
+    { 0x1E71, AF_ADJUST_DOWN }, /* ṱ */
+    { 0x1E72, AF_ADJUST_DOWN }, /* Ṳ */
+    { 0x1E73, AF_ADJUST_DOWN }, /* ṳ */
+    { 0x1E74, AF_ADJUST_DOWN | AF_ADJUST_TILDE_BOTTOM }, /* Ṵ */
+    { 0x1E75, AF_ADJUST_DOWN | AF_ADJUST_TILDE_BOTTOM }, /* ṵ */
+    { 0x1E76, AF_ADJUST_DOWN }, /* Ṷ */
+    { 0x1E77, AF_ADJUST_DOWN }, /* ṷ */
+    { 0x1E78, AF_ADJUST_UP2 | AF_ADJUST_TILDE_TOP2 }, /* Ṹ */
+    { 0x1E79, AF_ADJUST_UP2 | AF_ADJUST_TILDE_TOP2 }, /* ṹ */
+    { 0x1E7A, AF_ADJUST_UP2 }, /* Ṻ */
+    { 0x1E7B, AF_ADJUST_UP2 }, /* ṻ */
+    { 0x1E7C, AF_ADJUST_UP | AF_ADJUST_TILDE_TOP }, /* Ṽ */
+    { 0x1E7D, AF_ADJUST_UP | AF_ADJUST_TILDE_TOP }, /* ṽ */
+    { 0x1E7E, AF_ADJUST_DOWN }, /* Ṿ */
+    { 0x1E7F, AF_ADJUST_DOWN }, /* ṿ */
+
+    { 0x1E80, AF_ADJUST_UP }, /* Ẁ */
+    { 0x1E81, AF_ADJUST_UP }, /* ẁ */
+    { 0x1E82, AF_ADJUST_UP }, /* Ẃ */
+    { 0x1E83, AF_ADJUST_UP }, /* ẃ */
+    { 0x1E84, AF_ADJUST_UP }, /* Ẅ */
+    { 0x1E85, AF_ADJUST_UP }, /* ẅ */
+    { 0x1E86, AF_ADJUST_UP }, /* Ẇ */
+    { 0x1E87, AF_ADJUST_UP }, /* ẇ */
+    { 0x1E88, AF_ADJUST_DOWN }, /* Ẉ */
+    { 0x1E89, AF_ADJUST_DOWN }, /* ẉ */
+    { 0x1E8A, AF_ADJUST_UP }, /* Ẋ */
+    { 0x1E8B, AF_ADJUST_UP }, /* ẋ */
+    { 0x1E8C, AF_ADJUST_UP }, /* Ẍ */
+    { 0x1E8D, AF_ADJUST_UP }, /* ẍ */
+    { 0x1E8E, AF_ADJUST_UP }, /* Ẏ */
+    { 0x1E8F, AF_ADJUST_UP }, /* ẏ */
+
+    { 0x1E90, AF_ADJUST_UP }, /* Ẑ */
+    { 0x1E91, AF_ADJUST_UP }, /* ẑ */
+    { 0x1E92, AF_ADJUST_DOWN }, /* Ẓ */
+    { 0x1E93, AF_ADJUST_DOWN }, /* ẓ */
+    { 0x1E94, AF_ADJUST_DOWN }, /* Ẕ */
+    { 0x1E95, AF_ADJUST_DOWN }, /* ẕ */
+    { 0x1E96, AF_ADJUST_DOWN }, /* ẖ */
+    { 0x1E97, AF_ADJUST_UP }, /* ẗ */
+    { 0x1E98, AF_ADJUST_UP }, /* ẘ */
+    { 0x1E99, AF_ADJUST_UP }, /* ẙ */
+    { 0x1E9A, AF_ADJUST_UP }, /* ẚ */
+    { 0x1E9B, AF_ADJUST_UP }, /* ẛ */
+
+    { 0x1EA0, AF_ADJUST_DOWN }, /* Ạ */
+    { 0x1EA1, AF_ADJUST_DOWN }, /* ạ */
+    { 0x1EA2, AF_ADJUST_UP }, /* Ả */
+    { 0x1EA3, AF_ADJUST_UP }, /* ả */
+    { 0x1EA4, AF_ADJUST_UP2 }, /* Ấ */
+    { 0x1EA5, AF_ADJUST_UP2 }, /* ấ */
+    { 0x1EA6, AF_ADJUST_UP2 }, /* Ầ */
+    { 0x1EA7, AF_ADJUST_UP2 }, /* ầ */
+    { 0x1EA8, AF_ADJUST_UP2 }, /* Ẩ */
+    { 0x1EA9, AF_ADJUST_UP2 }, /* ẩ */
+    { 0x1EAA, AF_ADJUST_UP2 | AF_ADJUST_TILDE_TOP }, /* Ẫ */
+    { 0x1EAB, AF_ADJUST_UP2 | AF_ADJUST_TILDE_TOP }, /* ẫ */
+    { 0x1EAC, AF_ADJUST_UP | AF_ADJUST_DOWN }, /* Ậ */
+    { 0x1EAD, AF_ADJUST_UP | AF_ADJUST_DOWN }, /* ậ */
+    { 0x1EAE, AF_ADJUST_UP2 }, /* Ắ */
+    { 0x1EAF, AF_ADJUST_UP2 }, /* ắ */
+
+    { 0x1EB0, AF_ADJUST_UP2 }, /* Ằ */
+    { 0x1EB1, AF_ADJUST_UP2 }, /* ằ */
+    { 0x1EB2, AF_ADJUST_UP2 }, /* Ẳ */
+    { 0x1EB3, AF_ADJUST_UP2 }, /* ẳ */
+    { 0x1EB4, AF_ADJUST_UP2 | AF_ADJUST_TILDE_TOP }, /* Ẵ */
+    { 0x1EB5, AF_ADJUST_UP2 | AF_ADJUST_TILDE_TOP }, /* ẵ */
+    { 0x1EB6, AF_ADJUST_UP | AF_ADJUST_DOWN }, /* Ặ */
+    { 0x1EB7, AF_ADJUST_UP | AF_ADJUST_DOWN }, /* ặ */
+    { 0x1EB8, AF_ADJUST_DOWN }, /* Ẹ */
+    { 0x1EB9, AF_ADJUST_DOWN }, /* ẹ */
+    { 0x1EBA, AF_ADJUST_UP }, /* Ẻ */
+    { 0x1EBB, AF_ADJUST_UP }, /* ẻ */
+    { 0x1EBC, AF_ADJUST_UP | AF_ADJUST_TILDE_TOP }, /* Ẽ */
+    { 0x1EBD, AF_ADJUST_UP | AF_ADJUST_TILDE_TOP }, /* ẽ */
+    { 0x1EBE, AF_ADJUST_UP2 }, /* Ế */
+    { 0x1EBF, AF_ADJUST_UP2 }, /* ế */
+
+    { 0x1EC0, AF_ADJUST_UP2 }, /* Ề */
+    { 0x1EC1, AF_ADJUST_UP2 }, /* ề */
+    { 0x1EC2, AF_ADJUST_UP2 }, /* Ể */
+    { 0x1EC3, AF_ADJUST_UP2 }, /* ể */
+    { 0x1EC4, AF_ADJUST_UP2 | AF_ADJUST_TILDE_TOP }, /* Ễ */
+    { 0x1EC5, AF_ADJUST_UP2 | AF_ADJUST_TILDE_TOP }, /* ễ */
+    { 0x1EC6, AF_ADJUST_UP | AF_ADJUST_DOWN }, /* Ệ */
+    { 0x1EC7, AF_ADJUST_UP | AF_ADJUST_DOWN }, /* ệ */
+    { 0x1EC8, AF_ADJUST_UP }, /* Ỉ */
+    { 0x1EC9, AF_ADJUST_UP }, /* ỉ */
+    { 0x1ECA, AF_ADJUST_DOWN }, /* Ị */
+    { 0x1ECB, AF_ADJUST_UP | AF_ADJUST_DOWN }, /* ị */
+    { 0x1ECC, AF_ADJUST_DOWN }, /* Ọ */
+    { 0x1ECD, AF_ADJUST_DOWN }, /* ọ */
+    { 0x1ECE, AF_ADJUST_UP }, /* Ỏ */
+    { 0x1ECF, AF_ADJUST_UP }, /* ỏ */
+
+    { 0x1ED0, AF_ADJUST_UP2 }, /* Ố */
+    { 0x1ED1, AF_ADJUST_UP2 }, /* ố */
+    { 0x1ED2, AF_ADJUST_UP2 }, /* Ồ */
+    { 0x1ED3, AF_ADJUST_UP2 }, /* ồ */
+    { 0x1ED4, AF_ADJUST_UP2 }, /* Ổ */
+    { 0x1ED5, AF_ADJUST_UP2 }, /* ổ */
+    { 0x1ED6, AF_ADJUST_UP2 | AF_ADJUST_TILDE_TOP }, /* Ỗ */
+    { 0x1ED7, AF_ADJUST_UP2 | AF_ADJUST_TILDE_TOP }, /* ỗ */
+    { 0x1ED8, AF_ADJUST_UP | AF_ADJUST_DOWN }, /* Ộ */
+    { 0x1ED9, AF_ADJUST_UP | AF_ADJUST_DOWN }, /* ộ */
+    { 0x1EDA, AF_ADJUST_UP | AF_IGNORE_CAPITAL_TOP }, /* Ớ */
+    { 0x1EDB, AF_ADJUST_UP | AF_IGNORE_SMALL_TOP }, /* ớ */
+    { 0x1EDC, AF_ADJUST_UP | AF_IGNORE_CAPITAL_TOP }, /* Ờ */
+    { 0x1EDD, AF_ADJUST_UP | AF_IGNORE_SMALL_TOP }, /* ờ */
+    { 0x1EDE, AF_ADJUST_UP | AF_IGNORE_CAPITAL_TOP }, /* Ở */
+    { 0x1EDF, AF_ADJUST_UP | AF_IGNORE_SMALL_TOP }, /* ở */
+
+    { 0x1EE0, AF_ADJUST_UP | AF_ADJUST_TILDE_TOP | AF_IGNORE_CAPITAL_TOP }, /* Ỡ */
+    { 0x1EE1, AF_ADJUST_UP | AF_ADJUST_TILDE_TOP | AF_IGNORE_SMALL_TOP }, /* ỡ */
+    { 0x1EE2, AF_ADJUST_DOWN | AF_IGNORE_CAPITAL_TOP }, /* Ợ */
+    { 0x1EE3, AF_ADJUST_DOWN | AF_IGNORE_SMALL_TOP }, /* ợ */
+    { 0x1EE4, AF_ADJUST_DOWN }, /* Ụ */
+    { 0x1EE5, AF_ADJUST_DOWN }, /* ụ */
+    { 0x1EE6, AF_ADJUST_UP }, /* Ủ */
+    { 0x1EE7, AF_ADJUST_UP }, /* ủ */
+    { 0x1EE8, AF_ADJUST_UP | AF_IGNORE_CAPITAL_TOP }, /* Ứ */
+    { 0x1EE9, AF_ADJUST_UP | AF_IGNORE_SMALL_TOP }, /* ứ */
+    { 0x1EEA, AF_ADJUST_UP | AF_IGNORE_CAPITAL_TOP }, /* Ừ */
+    { 0x1EEB, AF_ADJUST_UP | AF_IGNORE_SMALL_TOP }, /* ừ */
+    { 0x1EEC, AF_ADJUST_UP | AF_IGNORE_CAPITAL_TOP }, /* Ử */
+    { 0x1EED, AF_ADJUST_UP | AF_IGNORE_SMALL_TOP }, /* ử */
+    { 0x1EEE, AF_ADJUST_UP | AF_ADJUST_TILDE_TOP | AF_IGNORE_CAPITAL_TOP }, /* Ữ */
+    { 0x1EEF, AF_ADJUST_UP | AF_ADJUST_TILDE_TOP | AF_IGNORE_SMALL_TOP }, /* ữ */
+
+    { 0x1EF0, AF_ADJUST_DOWN | AF_IGNORE_CAPITAL_TOP }, /* Ự */
+    { 0x1EF1, AF_ADJUST_DOWN | AF_IGNORE_SMALL_TOP }, /* ự */
+    { 0x1EF2, AF_ADJUST_UP }, /* Ỳ */
+    { 0x1EF3, AF_ADJUST_UP }, /* ỳ */
+    { 0x1EF4, AF_ADJUST_DOWN }, /* Ỵ */
+    { 0x1EF5, AF_ADJUST_DOWN }, /* ỵ */
+    { 0x1EF6, AF_ADJUST_UP }, /* Ỷ */
+    { 0x1EF7, AF_ADJUST_UP }, /* ỷ */
+    { 0x1EF8, AF_ADJUST_UP | AF_ADJUST_TILDE_TOP }, /* Ỹ */
+    { 0x1EF9, AF_ADJUST_UP | AF_ADJUST_TILDE_TOP }, /* ỹ */
+
+    /* Greek Extended */
+    { 0x1F00, AF_ADJUST_UP }, /* ἀ */
+    { 0x1F01, AF_ADJUST_UP }, /* ἁ */
+    { 0x1F02, AF_ADJUST_UP }, /* ἂ */
+    { 0x1F03, AF_ADJUST_UP }, /* ἃ */
+    { 0x1F04, AF_ADJUST_UP }, /* ἄ */
+    { 0x1F05, AF_ADJUST_UP }, /* ἅ */
+    { 0x1F06, AF_ADJUST_UP2 | AF_ADJUST_TILDE_TOP }, /* ἆ */
+    { 0x1F07, AF_ADJUST_UP2 | AF_ADJUST_TILDE_TOP }, /* ἇ */
+
+    { 0x1F10, AF_ADJUST_UP }, /* ἐ */
+    { 0x1F11, AF_ADJUST_UP }, /* ἑ */
+    { 0x1F12, AF_ADJUST_UP }, /* ἒ */
+    { 0x1F13, AF_ADJUST_UP }, /* ἓ */
+    { 0x1F14, AF_ADJUST_UP }, /* ἔ */
+    { 0x1F15, AF_ADJUST_UP }, /* ἕ */
+
+    { 0x1F20, AF_ADJUST_UP }, /* ἠ */
+    { 0x1F21, AF_ADJUST_UP }, /* ἡ */
+    { 0x1F22, AF_ADJUST_UP }, /* ἢ */
+    { 0x1F23, AF_ADJUST_UP }, /* ἣ */
+    { 0x1F24, AF_ADJUST_UP }, /* ἤ */
+    { 0x1F25, AF_ADJUST_UP }, /* ἥ */
+    { 0x1F26, AF_ADJUST_UP2 | AF_ADJUST_TILDE_TOP }, /* ἦ */
+    { 0x1F27, AF_ADJUST_UP2 | AF_ADJUST_TILDE_TOP }, /* ἧ */
+
+    { 0x1F30, AF_ADJUST_UP }, /* ἰ */
+    { 0x1F31, AF_ADJUST_UP }, /* ἱ */
+    { 0x1F32, AF_ADJUST_UP }, /* ἲ */
+    { 0x1F33, AF_ADJUST_UP }, /* ἳ */
+    { 0x1F34, AF_ADJUST_UP }, /* ἴ */
+    { 0x1F35, AF_ADJUST_UP }, /* ἵ */
+    { 0x1F36, AF_ADJUST_UP2 | AF_ADJUST_TILDE_TOP }, /* ἶ */
+    { 0x1F37, AF_ADJUST_UP2 | AF_ADJUST_TILDE_TOP }, /* ἷ */
+
+    { 0x1F40, AF_ADJUST_UP }, /* ὀ */
+    { 0x1F41, AF_ADJUST_UP }, /* ὁ */
+    { 0x1F42, AF_ADJUST_UP }, /* ὂ */
+    { 0x1F43, AF_ADJUST_UP }, /* ὃ */
+    { 0x1F44, AF_ADJUST_UP }, /* ὄ */
+    { 0x1F45, AF_ADJUST_UP }, /* ὅ */
+
+    { 0x1F50, AF_ADJUST_UP }, /* ὐ */
+    { 0x1F51, AF_ADJUST_UP }, /* ὑ */
+    { 0x1F52, AF_ADJUST_UP }, /* ὒ */
+    { 0x1F53, AF_ADJUST_UP }, /* ὓ */
+    { 0x1F54, AF_ADJUST_UP }, /* ὔ */
+    { 0x1F55, AF_ADJUST_UP }, /* ὕ */
+    { 0x1F56, AF_ADJUST_UP2 | AF_ADJUST_TILDE_TOP }, /* ὖ */
+    { 0x1F57, AF_ADJUST_UP2 | AF_ADJUST_TILDE_TOP }, /* ὗ */
+
+    { 0x1F60, AF_ADJUST_UP }, /* ὠ */
+    { 0x1F61, AF_ADJUST_UP }, /* ὡ */
+    { 0x1F62, AF_ADJUST_UP }, /* ὢ */
+    { 0x1F63, AF_ADJUST_UP }, /* ὣ */
+    { 0x1F64, AF_ADJUST_UP }, /* ὤ */
+    { 0x1F65, AF_ADJUST_UP }, /* ὥ */
+    { 0x1F66, AF_ADJUST_UP2 | AF_ADJUST_TILDE_TOP }, /* ὦ */
+    { 0x1F67, AF_ADJUST_UP2 | AF_ADJUST_TILDE_TOP }, /* ὧ */
+
+    { 0x1F70, AF_ADJUST_UP }, /* ὰ */
+    { 0x1F71, AF_ADJUST_UP }, /* ά */
+    { 0x1F72, AF_ADJUST_UP }, /* ὲ */
+    { 0x1F73, AF_ADJUST_UP }, /* έ */
+    { 0x1F74, AF_ADJUST_UP }, /* ὴ */
+    { 0x1F75, AF_ADJUST_UP }, /* ή */
+    { 0x1F76, AF_ADJUST_UP }, /* ὶ */
+    { 0x1F77, AF_ADJUST_UP }, /* ί */
+    { 0x1F78, AF_ADJUST_UP }, /* ὸ */
+    { 0x1F79, AF_ADJUST_UP }, /* ό */
+    { 0x1F7A, AF_ADJUST_UP }, /* ὺ */
+    { 0x1F7B, AF_ADJUST_UP }, /* ύ */
+    { 0x1F7C, AF_ADJUST_UP }, /* ὼ */
+    { 0x1F7D, AF_ADJUST_UP }, /* ώ */
+
+    { 0x1F80, AF_ADJUST_UP | AF_ADJUST_DOWN }, /* ᾀ */
+    { 0x1F81, AF_ADJUST_UP | AF_ADJUST_DOWN }, /* ᾁ */
+    { 0x1F82, AF_ADJUST_UP | AF_ADJUST_DOWN }, /* ᾂ */
+    { 0x1F83, AF_ADJUST_UP | AF_ADJUST_DOWN }, /* ᾃ */
+    { 0x1F84, AF_ADJUST_UP | AF_ADJUST_DOWN }, /* ᾄ */
+    { 0x1F85, AF_ADJUST_UP | AF_ADJUST_DOWN }, /* ᾅ */
+    { 0x1F86, AF_ADJUST_UP2 | AF_ADJUST_TILDE_TOP | AF_ADJUST_DOWN }, /* ᾆ */
+    { 0x1F87, AF_ADJUST_UP2 | AF_ADJUST_TILDE_TOP | AF_ADJUST_DOWN }, /* ᾇ */
+    { 0x1F88, AF_ADJUST_DOWN }, /* ᾈ */
+    { 0x1F89, AF_ADJUST_DOWN }, /* ᾉ */
+    { 0x1F8A, AF_ADJUST_DOWN }, /* ᾊ */
+    { 0x1F8B, AF_ADJUST_DOWN }, /* ᾋ */
+    { 0x1F8C, AF_ADJUST_DOWN }, /* ᾌ */
+    { 0x1F8D, AF_ADJUST_DOWN }, /* ᾍ */
+    { 0x1F8E, AF_ADJUST_DOWN }, /* ᾎ */
+    { 0x1F8F, AF_ADJUST_DOWN }, /* ᾏ */
+
+    { 0x1F90, AF_ADJUST_UP | AF_ADJUST_DOWN }, /* ᾐ */
+    { 0x1F91, AF_ADJUST_UP | AF_ADJUST_DOWN }, /* ᾑ */
+    { 0x1F92, AF_ADJUST_UP | AF_ADJUST_DOWN }, /* ᾒ */
+    { 0x1F93, AF_ADJUST_UP | AF_ADJUST_DOWN }, /* ᾓ */
+    { 0x1F94, AF_ADJUST_UP | AF_ADJUST_DOWN }, /* ᾔ */
+    { 0x1F95, AF_ADJUST_UP | AF_ADJUST_DOWN }, /* ᾕ */
+    { 0x1F96, AF_ADJUST_UP2 | AF_ADJUST_TILDE_TOP | AF_ADJUST_DOWN }, /* ᾖ */
+    { 0x1F97, AF_ADJUST_UP2 | AF_ADJUST_TILDE_TOP | AF_ADJUST_DOWN }, /* ᾗ */
+    { 0x1F98, AF_ADJUST_DOWN }, /* ᾘ */
+    { 0x1F99, AF_ADJUST_DOWN }, /* ᾙ */
+    { 0x1F9A, AF_ADJUST_DOWN }, /* ᾚ */
+    { 0x1F9B, AF_ADJUST_DOWN }, /* ᾛ */
+    { 0x1F9C, AF_ADJUST_DOWN }, /* ᾜ */
+    { 0x1F9D, AF_ADJUST_DOWN }, /* ᾝ */
+    { 0x1F9E, AF_ADJUST_DOWN }, /* ᾞ */
+    { 0x1F9F, AF_ADJUST_DOWN }, /* ᾟ */
+
+    { 0x1FA0, AF_ADJUST_UP | AF_ADJUST_DOWN }, /* ᾠ */
+    { 0x1FA1, AF_ADJUST_UP | AF_ADJUST_DOWN }, /* ᾡ */
+    { 0x1FA2, AF_ADJUST_UP | AF_ADJUST_DOWN }, /* ᾢ */
+    { 0x1FA3, AF_ADJUST_UP | AF_ADJUST_DOWN }, /* ᾣ */
+    { 0x1FA4, AF_ADJUST_UP | AF_ADJUST_DOWN }, /* ᾤ */
+    { 0x1FA5, AF_ADJUST_UP | AF_ADJUST_DOWN }, /* ᾥ */
+    { 0x1FA6, AF_ADJUST_UP2 | AF_ADJUST_TILDE_TOP | AF_ADJUST_DOWN }, /* ᾦ */
+    { 0x1FA7, AF_ADJUST_UP2 | AF_ADJUST_TILDE_TOP | AF_ADJUST_DOWN }, /* ᾧ */
+    { 0x1FA8, AF_ADJUST_DOWN }, /* ᾨ */
+    { 0x1FA9, AF_ADJUST_DOWN }, /* ᾩ */
+    { 0x1FAA, AF_ADJUST_DOWN }, /* ᾪ */
+    { 0x1FAB, AF_ADJUST_DOWN }, /* ᾫ */
+    { 0x1FAC, AF_ADJUST_DOWN }, /* ᾬ */
+    { 0x1FAD, AF_ADJUST_DOWN }, /* ᾭ */
+    { 0x1FAE, AF_ADJUST_DOWN }, /* ᾮ */
+    { 0x1FAF, AF_ADJUST_DOWN }, /* ᾯ */
+
+    { 0x1FB0, AF_ADJUST_UP }, /* ᾰ */
+    { 0x1FB1, AF_ADJUST_UP }, /* ᾱ */
+    { 0x1FB2, AF_ADJUST_UP | AF_ADJUST_DOWN }, /* ᾲ */
+    { 0x1FB3, AF_ADJUST_DOWN }, /* ᾳ */
+    { 0x1FB4, AF_ADJUST_UP | AF_ADJUST_DOWN }, /* ᾴ */
+    { 0x1FB6, AF_ADJUST_UP | AF_ADJUST_TILDE_TOP }, /* ᾶ */
+    { 0x1FB7, AF_ADJUST_UP | AF_ADJUST_TILDE_TOP | AF_ADJUST_DOWN }, /* ᾷ */
+    { 0x1FB8, AF_ADJUST_UP }, /* Ᾰ */
+    { 0x1FB9, AF_ADJUST_UP }, /* Ᾱ */
+    { 0x1FBC, AF_ADJUST_DOWN }, /* ᾼ */
+
+    { 0x1FC2, AF_ADJUST_UP | AF_ADJUST_DOWN }, /* ῂ */
+    { 0x1FC3, AF_ADJUST_DOWN }, /* ῃ */
+    { 0x1FC4, AF_ADJUST_UP | AF_ADJUST_DOWN }, /* ῄ */
+    { 0x1FC6, AF_ADJUST_UP | AF_ADJUST_TILDE_TOP }, /* ῆ */
+    { 0x1FC7, AF_ADJUST_UP | AF_ADJUST_TILDE_TOP | AF_ADJUST_DOWN }, /* ῇ */
+    { 0x1FCC, AF_ADJUST_DOWN }, /* ῌ */
+
+    { 0x1FD0, AF_ADJUST_UP }, /* ῐ */
+    { 0x1FD1, AF_ADJUST_UP }, /* ῑ */
+    { 0x1FD2, AF_ADJUST_UP2 }, /* ῒ */
+    { 0x1FD3, AF_ADJUST_UP2 }, /* ΐ */
+    { 0x1FD6, AF_ADJUST_UP | AF_ADJUST_TILDE_TOP }, /* ῖ */
+    { 0x1FD7, AF_ADJUST_UP2 | AF_ADJUST_TILDE_TOP }, /* ῗ */
+    { 0x1FD8, AF_ADJUST_UP }, /* Ῐ */
+    { 0x1FD9, AF_ADJUST_UP }, /* Ῑ */
+
+    { 0x1FE0, AF_ADJUST_UP }, /* ῠ */
+    { 0x1FE1, AF_ADJUST_UP }, /* ῡ */
+    { 0x1FE2, AF_ADJUST_UP2 }, /* ῢ */
+    { 0x1FE3, AF_ADJUST_UP2 }, /* ΰ */
+    { 0x1FE4, AF_ADJUST_UP }, /* ῤ */
+    { 0x1FE5, AF_ADJUST_UP }, /* ῥ */
+    { 0x1FE6, AF_ADJUST_UP | AF_ADJUST_TILDE_TOP }, /* ῦ */
+    { 0x1FE7, AF_ADJUST_UP2 | AF_ADJUST_TILDE_TOP }, /* ῧ */
+    { 0x1FE8, AF_ADJUST_UP }, /* Ῠ */
+    { 0x1FE9, AF_ADJUST_UP }, /* Ῡ */
+    { 0x1FF2, AF_ADJUST_UP | AF_ADJUST_DOWN }, /* ῲ */
+    { 0x1FF3, AF_ADJUST_DOWN }, /* ῳ */
+    { 0x1FF4, AF_ADJUST_UP | AF_ADJUST_DOWN }, /* ῴ */
+    { 0x1FF6, AF_ADJUST_UP | AF_ADJUST_TILDE_TOP }, /* ῶ */
+    { 0x1FF7, AF_ADJUST_UP | AF_ADJUST_TILDE_TOP | AF_ADJUST_DOWN }, /* ῷ */
+    { 0x1FFC, AF_ADJUST_DOWN }, /* ῼ */
+
+    /* General Punctuation */
+    { 0x203C, AF_ADJUST_UP | AF_ADJUST_NO_HEIGHT_CHECK }, /* ‼ */
+    { 0x203D, AF_ADJUST_UP | AF_ADJUST_NO_HEIGHT_CHECK }, /* ‽ */
+
+    { 0x2047, AF_ADJUST_UP | AF_ADJUST_NO_HEIGHT_CHECK }, /* ⁇ */
+    { 0x2048, AF_ADJUST_UP | AF_ADJUST_NO_HEIGHT_CHECK }, /* ⁈ */
+    { 0x2049, AF_ADJUST_UP | AF_ADJUST_NO_HEIGHT_CHECK }, /* ⁉ */
+
+    /* Superscripts and Subscripts */
+    { 0x2071, AF_ADJUST_UP }, /* ⁱ */
+
+    /* Currency Symbols */
+    { 0x20AB, AF_ADJUST_DOWN }, /* ₫ */
+
+    { 0x20C0, AF_ADJUST_DOWN }, /* ⃀ */
+
+    /* Number Forms */
+    { 0x2170, AF_ADJUST_UP }, /* ⅰ */
+    { 0x2171, AF_ADJUST_UP }, /* ⅱ */
+    { 0x2172, AF_ADJUST_UP }, /* ⅲ */
+    { 0x2173, AF_ADJUST_UP }, /* ⅳ */
+    { 0x2175, AF_ADJUST_UP }, /* ⅵ */
+    { 0x2176, AF_ADJUST_UP }, /* ⅶ */
+    { 0x2177, AF_ADJUST_UP }, /* ⅷ */
+    { 0x2178, AF_ADJUST_UP }, /* ⅸ */
+    { 0x217A, AF_ADJUST_UP }, /* ⅺ */
+    { 0x217B, AF_ADJUST_UP }, /* ⅻ */
+
+    /* Latin Extended-C */
+    { 0x2C64, AF_IGNORE_CAPITAL_BOTTOM } , /* Ɽ */
+    { 0x2C67, AF_IGNORE_CAPITAL_BOTTOM } , /* Ⱨ */
+    { 0x2C68, AF_IGNORE_SMALL_BOTTOM } , /* ⱨ */
+    { 0x2C69, AF_IGNORE_CAPITAL_BOTTOM } , /* Ⱪ */
+    { 0x2C6A, AF_IGNORE_SMALL_BOTTOM } , /* ⱪ */
+    { 0x2C6B, AF_IGNORE_CAPITAL_BOTTOM } , /* Ⱬ */
+    { 0x2C6C, AF_IGNORE_SMALL_BOTTOM } , /* ⱬ */
+    { 0x2C6E, AF_IGNORE_CAPITAL_BOTTOM } , /* Ɱ */
+
+    { 0x2C7C, AF_ADJUST_UP }, /* ⱼ */
+    { 0x2C7E, AF_IGNORE_CAPITAL_BOTTOM } , /* Ȿ */
+    { 0x2C7F, AF_IGNORE_CAPITAL_BOTTOM } , /* Ɀ */
+
+    /* Coptic */
+    { 0x2CC2, AF_ADJUST_UP }, /* Ⳃ */
+    { 0x2CC3, AF_ADJUST_UP }, /* ⳃ */
+
+    /* Supplemental Punctuation */
+    { 0x2E18, AF_ADJUST_UP }, /* ⸘ */
+
+    { 0x2E2E, AF_ADJUST_UP | AF_ADJUST_NO_HEIGHT_CHECK }, /* ⸮ */
+
+    /* Cyrillic Extended-B */
+    { 0xA640, AF_IGNORE_CAPITAL_BOTTOM } , /* Ꙁ */
+    { 0xA641, AF_IGNORE_SMALL_BOTTOM } , /* ꙁ */
+    { 0xA642, AF_IGNORE_CAPITAL_BOTTOM } , /* Ꙃ */
+    { 0xA643, AF_IGNORE_SMALL_BOTTOM } , /* ꙃ */
+
+    { 0xA680, AF_IGNORE_CAPITAL_TOP } , /* Ꚁ */
+    { 0xA681, AF_IGNORE_SMALL_TOP } , /* ꚁ */
+    { 0xA688, AF_IGNORE_CAPITAL_BOTTOM } , /* Ꚉ */
+    { 0xA689, AF_IGNORE_SMALL_BOTTOM } , /* ꚉ */
+    { 0xA68A, AF_IGNORE_CAPITAL_BOTTOM } , /* Ꚋ */
+    { 0xA68B, AF_IGNORE_SMALL_BOTTOM } , /* ꚋ */
+    { 0xA68E, AF_IGNORE_CAPITAL_BOTTOM } , /* Ꚏ */
+    { 0xA68F, AF_IGNORE_SMALL_BOTTOM } , /* ꚏ */
+
+    { 0xA690, AF_IGNORE_CAPITAL_BOTTOM } , /* Ꚑ */
+    { 0xA691, AF_IGNORE_SMALL_BOTTOM } , /* ꚑ */
+    { 0xA696, AF_IGNORE_CAPITAL_BOTTOM } , /* Ꚗ */
+    { 0xA697, AF_IGNORE_SMALL_BOTTOM } , /* ꚗ */
+
+    /* Latin Extended-D */
+    { 0xA726, AF_IGNORE_CAPITAL_BOTTOM } , /* Ꜧ */
+    { 0xA727, AF_IGNORE_SMALL_BOTTOM } , /* ꜧ */
+
+    { 0xA756, AF_IGNORE_CAPITAL_BOTTOM } , /* Ꝗ */
+    { 0xA758, AF_IGNORE_CAPITAL_BOTTOM } , /* Ꝙ */
+
+    { 0xA771, AF_IGNORE_SMALL_BOTTOM } , /* ꝱ */
+    { 0xA772, AF_IGNORE_SMALL_BOTTOM } , /* ꝲ */
+    { 0xA773, AF_IGNORE_SMALL_BOTTOM } , /* ꝳ */
+    { 0xA774, AF_IGNORE_SMALL_BOTTOM } , /* ꝴ */
+    { 0xA776, AF_IGNORE_SMALL_BOTTOM } , /* ꝶ */
+
+    { 0xA790, AF_IGNORE_CAPITAL_BOTTOM } , /* Ꞑ */
+    { 0xA791, AF_IGNORE_SMALL_BOTTOM } , /* ꞑ */
+    { 0xA794, AF_IGNORE_SMALL_BOTTOM } , /* ꞔ */
+    { 0xA795, AF_IGNORE_SMALL_BOTTOM } , /* ꞕ */
+
+    { 0xA7C0, AF_IGNORE_CAPITAL_TOP | AF_IGNORE_CAPITAL_BOTTOM }, /* Ꟁ */
+    { 0xA7C1, AF_IGNORE_SMALL_TOP | AF_IGNORE_SMALL_BOTTOM }, /* ꟁ */
+    { 0xA7C4, AF_IGNORE_CAPITAL_BOTTOM } , /* Ꞔ */
+    { 0xA7C5, AF_IGNORE_CAPITAL_BOTTOM } , /* Ʂ */
+    { 0xA7C6, AF_IGNORE_CAPITAL_BOTTOM } , /* Ᶎ */
+    { 0xA7CC, AF_IGNORE_CAPITAL_TOP | AF_IGNORE_CAPITAL_BOTTOM }, /* Ꟍ */
+    { 0xA7CD, AF_IGNORE_SMALL_TOP | AF_IGNORE_SMALL_BOTTOM }, /* ꟍ */
+
+    /* Latin Extended-E */
+    { 0xAB3C, AF_IGNORE_SMALL_BOTTOM } , /* ꬼ */
+
+    { 0xAB46, AF_IGNORE_SMALL_BOTTOM } , /* ꭆ */
+
+    { 0xAB5C, AF_IGNORE_SMALL_BOTTOM } , /* ꭜ */
+
+    { 0xAB66, AF_IGNORE_SMALL_BOTTOM } , /* ꭦ */
+    { 0xAB67, AF_IGNORE_SMALL_BOTTOM } , /* ꭧ */
+  };
+
+
+  FT_LOCAL_DEF( FT_UInt32 )
+  af_adjustment_database_lookup( FT_UInt32  codepoint )
+  {
+    /* Binary search for database entry */
+    FT_Offset  low  = 0;
+    FT_Offset  high = AF_ADJUSTMENT_DATABASE_LENGTH - 1;
+
+
+    while ( high >= low )
+    {
+      FT_Offset  mid           = ( low + high ) / 2;
+      FT_UInt32  mid_codepoint = adjustment_database[mid].codepoint;
+
+
+      if ( mid_codepoint < codepoint )
+        low = mid + 1;
+      else if ( mid_codepoint > codepoint )
+        high = mid - 1;
+      else
+        return adjustment_database[mid].flags;
+    }
+
+    return 0;
+  }
+
+
+#ifdef FT_CONFIG_OPTION_USE_HARFBUZZ
+
+  static FT_Error
+  add_substitute( FT_Int     glyph_idx,
+                  size_t     value,
+                  FT_UInt32  codepoint,
+                  FT_Hash    reverse_map,
+                  FT_Hash    subst_map,
+                  FT_Memory  memory )
+  {
+    FT_Error  error;
+
+    FT_Int  first_substitute = (FT_Int)( value & 0xFFFF );
+
+    FT_UInt  used = reverse_map->used;
+
+
+    /*
+      OpenType features like 'unic' map lowercase letter glyphs to uppercase
+      forms (and vice versa), which could lead to the use of wrong entries
+      in the adjustment database.  For this reason we don't overwrite,
+      prioritizing cmap entries.
+
+      XXX Note, however, that this cannot cover all cases since there might
+      be contradictory entries for glyphs not in the cmap.  A possible
+      solution might be to specially mark pairs of related lowercase and
+      uppercase characters in the adjustment database that have diacritics
+      on different vertical sides (for example, U+0122 'Ģ' and U+0123 'ģ').
+      The auto-hinter could then perform a topological analysis to do the
+      right thing.
+    */
+    error = ft_hash_num_insert_no_overwrite( first_substitute, codepoint,
+                                             reverse_map, memory );
+    if ( error )
+      return error;
+
+    if ( reverse_map->used > used )
+    {
+      size_t*  subst = ft_hash_num_lookup( first_substitute, subst_map );
+
+
+      if ( subst )
+      {
+        error = add_substitute( first_substitute, *subst, codepoint,
+                                reverse_map, subst_map, memory );
+        if ( error )
+          return error;
+      }
+    }
+
+    /* The remaining substitutes. */
+    if ( value & 0xFFFF0000U )
+    {
+      FT_UInt  num_substitutes = value >> 16;
+
+      FT_UInt  i;
+
+
+      for ( i = 1; i <= num_substitutes; i++ )
+      {
+        FT_Int   idx        = glyph_idx + (FT_Int)( i << 16 );
+        size_t*  substitute = ft_hash_num_lookup( idx, subst_map );
+
+
+        used = reverse_map->used;
+
+        error = ft_hash_num_insert_no_overwrite( *substitute,
+                                                 codepoint,
+                                                 reverse_map,
+                                                 memory );
+        if ( error )
+          return error;
+
+        if ( reverse_map->used > used )
+        {
+          size_t*  subst = ft_hash_num_lookup( *substitute, subst_map );
+
+
+          if ( subst )
+          {
+            error = add_substitute( *substitute, *subst, codepoint,
+                                    reverse_map, subst_map, memory );
+            if ( error )
+              return error;
+          }
+        }
+      }
+    }
+
+    return FT_Err_Ok;
+  }
+
+#endif /* FT_CONFIG_OPTION_USE_HARFBUZZ */
+
+
+  /* Construct a 'reverse cmap' (i.e., a mapping from glyph indices to   */
+  /* character codes) for all glyphs that an input code point could turn */
+  /* into.                                                               */
+  /*                                                                     */
+  /* If HarfBuzz support is not available, this is the direct inversion  */
+  /* of the cmap table, otherwise the mapping gets extended with data    */
+  /* from the 'GSUB' table.                                              */
+  FT_LOCAL_DEF( FT_Error )
+  af_reverse_character_map_new( FT_Hash         *map,
+                                AF_StyleMetrics  metrics )
+  {
+    FT_Error  error;
+
+    AF_FaceGlobals  globals = metrics->globals;
+    FT_Face         face    = globals->face;
+    FT_Memory       memory  = face->memory;
+
+    FT_CharMap  old_charmap;
+
+    FT_UInt32  codepoint;
+    FT_Offset  i;
+
+
+    FT_TRACE4(( "af_reverse_character_map_new:"
+                " building reverse character map (style `%s')\n",
+                af_style_names[metrics->style_class->style] ));
+
+    /* Search for a unicode charmap.           */
+    /* If there isn't one, create a blank map. */
+
+    /* Back up `face->charmap` because `find_unicode_charmap` sets it. */
+    old_charmap = face->charmap;
+
+    if ( ( error = find_unicode_charmap( face ) ) )
+      goto Exit;
+
+    *map = NULL;
+    if ( FT_QNEW( *map ) )
+      goto Exit;
+
+    error = ft_hash_num_init( *map, memory );
+    if ( error )
+      goto Exit;
+
+    /* Initialize reverse cmap with data directly from the cmap table. */
+    for ( i = 0; i < AF_ADJUSTMENT_DATABASE_LENGTH; i++ )
+    {
+      FT_Int  cmap_glyph;
+
+
+      /*
+        We cannot restrict `codepoint` to character ranges; we have no
+        control what data the script-specific portion of the GSUB table
+        actually holds.
+
+        An example is `arial.ttf` version 7.00; in this font, there are
+        lookups for Cyrillic (lookup 43), Greek (lookup 44), and Latin
+        (lookup 45) that map capital letter glyphs to small capital glyphs.
+        It is tempting to expect that script-specific versions of the 'c2sc'
+        feature only use script-specific lookups.  However, this is not the
+        case in this font: the feature uses all three lookups regardless of
+        the script.
+
+        The auto-hinter, while assigning glyphs to styles, uses the first
+        coverage result it encounters for a particular glyph.  For example,
+        if the coverage for Cyrillic is tested before Latin (as is currently
+        the case), glyphs without a cmap entry that are covered in 'c2sc'
+        are treated as Cyrillic.
+
+        If we now look at glyph 3498, which is a small-caps version of the
+        Latin character 'A grave' (U+00C0, glyph 172), we can see that it is
+        registered as belonging to a Cyrillic style due to the algorithm
+        just described.  As a result, checking only for characters from the
+        Latin range would miss this glyph; we thus have to test all
+        character codes in the database.
+      */
+      codepoint = adjustment_database[i].codepoint;
+
+      cmap_glyph = (FT_Int)FT_Get_Char_Index( face, codepoint );
+      if ( cmap_glyph == 0 )
+        continue;
+
+      error = ft_hash_num_insert( cmap_glyph, codepoint, *map, memory );
+      if ( error )
+        goto Exit;
+    }
+
+#ifdef FT_CONFIG_OPTION_USE_HARFBUZZ
+
+    if ( ft_hb_enabled( globals ) )
+    {
+      hb_font_t  *hb_font;
+      hb_face_t  *hb_face;
+
+      hb_set_t    *gsub_lookups;
+      hb_script_t  script;
+
+      unsigned int  script_count   = 1;
+      hb_tag_t      script_tags[2] = { HB_TAG_NONE, HB_TAG_NONE };
+
+      FT_Hash  subst_map = NULL;
+
+      hb_codepoint_t  idx;
+      FT_UInt         hash_idx;
+      FT_Int          glyph_idx;
+      size_t          value;
+
+
+      /* No need to check whether HarfBuzz has allocation issues; */
+      /* it continues to work in such cases and simply returns    */
+      /* 'empty' objects that do nothing.                         */
+
+      hb_font = globals->hb_font;
+      hb_face = hb( font_get_face )( hb_font );
+
+      gsub_lookups = hb( set_create )();
+
+      script = af_hb_scripts[metrics->style_class->script];
+
+      hb( ot_tags_from_script_and_language )( script, NULL,
+                                              &script_count, script_tags,
+                                              NULL, NULL );
+
+      /* Compute set of all script-specific GSUB lookups. */
+      hb( ot_layout_collect_lookups )( hb_face,
+                                       HB_OT_TAG_GSUB,
+                                       script_tags, NULL, NULL,
+                                       gsub_lookups );
+
+#ifdef FT_DEBUG_LEVEL_TRACE
+      {
+        FT_Bool  have_idx = FALSE;
+
+
+        FT_TRACE4(( "  GSUB lookups to check:\n" ));
+
+        FT_TRACE4(( "  " ));
+        idx = HB_SET_VALUE_INVALID;
+        while ( hb( set_next )( gsub_lookups, &idx ) )
+          if ( globals->gsub_lookups_single_alternate[idx] )
+          {
+            have_idx = TRUE;
+            FT_TRACE4(( "  %u", idx ));
+          }
+        if ( !have_idx )
+          FT_TRACE4(( "  (none)" ));
+        FT_TRACE4(( "\n" ));
+
+        FT_TRACE4(( "\n" ));
+      }
+#endif
+
+      if ( FT_QNEW( subst_map ) )
+        goto Exit_HarfBuzz;
+
+      error = ft_hash_num_init( subst_map, memory );
+      if ( error )
+        goto Exit_HarfBuzz;
+
+      idx = HB_SET_VALUE_INVALID;
+      while ( hb( set_next )( gsub_lookups, &idx ) )
+      {
+        FT_UInt32  offset = globals->gsub_lookups_single_alternate[idx];
+
+
+        /* Put all substitutions into a single hash table.  Note that   */
+        /* the hash values usually contain more than a single character */
+        /* code; this can happen if different 'SingleSubst' subtables   */
+        /* map a given glyph index to different substitutions, or if    */
+        /* 'AlternateSubst' subtable entries are present.               */
+        if ( offset )
+          af_map_lookup( globals, subst_map, offset );
+      }
+
+      /*
+        Now iterate over the collected substitution data in `subst_map`
+        (using recursion to resolve one-to-many mappings) and insert the
+        data into the reverse cmap.
+
+        As an example, suppose we have the following cmap and substitution
+        data:
+
+          cmap: X -> a
+                Y -> b
+                Z -> c
+
+          substitutions: a -> b
+                         b -> c, d
+                         d -> e
+
+        The reverse map now becomes as follows.
+
+          a -> X
+          b -> Y
+          c -> Z (via cmap, ignoring mapping from 'b')
+          d -> Y (via 'b')
+          e -> Y (via 'b' and 'd')
+      */
+
+      hash_idx = 0;
+      while ( ft_hash_num_iterator( &hash_idx,
+                                    &glyph_idx,
+                                    &value,
+                                    subst_map ) )
+      {
+        size_t*  val;
+
+
+        /* Ignore keys that do not point to the first substitute. */
+        if ( (FT_UInt)glyph_idx & 0xFFFF0000U )
+          continue;
+
+        /* Ignore glyph indices that are not related to accents. */
+        val = ft_hash_num_lookup( glyph_idx, *map );
+        if ( !val )
+          continue;
+
+        codepoint = *val;
+
+        error = add_substitute( glyph_idx, value, codepoint,
+                                *map, subst_map, memory );
+        if ( error )
+          break;
+      }
+
+    Exit_HarfBuzz:
+      hb( set_destroy )( gsub_lookups );
+
+      ft_hash_num_free( subst_map, memory );
+      FT_FREE( subst_map );
+
+      if ( error )
+        goto Exit;
+    }
+
+#endif /* FT_CONFIG_OPTION_USE_HARFBUZZ */
+
+    FT_TRACE4(( "    reverse character map built successfully"
+                " with %u entries\n", ( *map )->used ));
+
+#ifdef FT_DEBUG_LEVEL_TRACE
+
+    {
+      FT_UInt  cnt;
+
+
+      FT_TRACE7(( "       gidx   code    flags\n" ));
+               /* "      XXXXX  0xXXXX  XXXXXXXXXXX..." */
+      FT_TRACE7(( "     ------------------------------\n" ));
+
+      for ( cnt = 0; cnt < globals->glyph_count; cnt++ )
+      {
+        size_t*    val;
+        FT_UInt32  adj_type;
+
+        const char*  flag_names[] =
+        {
+          "up",          /* AF_ADJUST_UP    */
+          "down",        /* AF_ADJUST_DOWN  */
+          "double up",   /* AF_ADJUST_UP2   */
+          "double down", /* AF_ADJUST_DOWN2 */
+
+          "top tilde",          /* AF_ADJUST_TILDE_TOP     */
+          "bottom tilde",       /* AF_ADJUST_TILDE_BOTTOM  */
+          "below-top tilde",    /* AF_ADJUST_TILDE_TOP2    */
+          "above-bottom tilde", /* AF_ADJUST_TILDE_BOTTOM2 */
+
+          "ignore capital top",    /* AF_IGNORE_CAPITAL_TOP    */
+          "ignore capital bottom", /* AF_IGNORE_CAPITAL_BOTTOM */
+          "ignore small top",      /* AF_IGNORE_SMALL_TOP      */
+          "ignore small bottom",   /* AF_IGNORE_SMALL_BOTTOM   */
+        };
+        size_t  flag_names_size = sizeof ( flag_names ) / sizeof ( char* );
+
+        char  flag_str[256];
+        int   need_comma;
+
+        size_t  j;
+
+
+        val = ft_hash_num_lookup( (FT_Int)cnt, *map );
+        if ( !val )
+          continue;
+        codepoint = *val;
+
+        adj_type = af_adjustment_database_lookup( codepoint );
+        if ( !adj_type )
+          continue;
+
+        flag_str[0] = '\0';
+        need_comma  = 0;
+
+        for ( j = 0; j < flag_names_size; j++ )
+        {
+          if ( adj_type & (1 << j ) )
+          {
+            if ( !need_comma )
+              need_comma = 1;
+            else
+              strcat( flag_str, ", " );
+            strcat( flag_str, flag_names[j] );
+          }
+        }
+
+        FT_TRACE7(( "      %5u  0x%04X  %s\n", cnt, codepoint, flag_str ));
+      }
+    }
+
+#endif /* FT_DEBUG_LEVEL_TRACE */
+
+
+  Exit:
+    face->charmap = old_charmap;
+
+    if ( error )
+    {
+      FT_TRACE4(( "    error while building reverse character map."
+                  " Using blank map.\n" ));
+
+      if ( *map )
+        ft_hash_num_free( *map, memory );
+
+      FT_FREE( *map );
+      *map = NULL;
+      return error;
+    }
+
+    return FT_Err_Ok;
+  }
+
+
+  FT_LOCAL_DEF( FT_Error )
+  af_reverse_character_map_done( FT_Hash    map,
+                                 FT_Memory  memory )
+  {
+    if ( map )
+      ft_hash_num_free( map, memory );
+    FT_FREE( map );
+
+    return FT_Err_Ok;
+  }
+
+
+/* END */
diff --git a/src/java.desktop/share/native/libfreetype/src/autofit/afadjust.h b/src/java.desktop/share/native/libfreetype/src/autofit/afadjust.h
new file mode 100644
index 00000000000..4837451ae4c
--- /dev/null
+++ b/src/java.desktop/share/native/libfreetype/src/autofit/afadjust.h
@@ -0,0 +1,130 @@
+/****************************************************************************
+ *
+ * afadjust.h
+ *
+ *   Auto-fitter routines to adjust components based on charcode (header).
+ *
+ * Copyright (C) 2023-2025 by
+ * David Turner, Robert Wilhelm, and Werner Lemberg.
+ *
+ * Written by Craig White <gerzytet@gmail.com>.
+ *
+ * This file is part of the FreeType project, and may only be used,
+ * modified, and distributed under the terms of the FreeType project
+ * license, LICENSE.TXT.  By continuing to use, modify, or distribute
+ * this file you indicate that you have read the license and
+ * understand and accept it fully.
+ *
+ */
+
+
+#ifndef AFADJUST_H_
+#define AFADJUST_H_
+
+#include <freetype/fttypes.h>
+
+#include "afglobal.h"
+#include "aftypes.h"
+
+
+FT_BEGIN_HEADER
+
+  /*
+   * Adjustment type flags.
+   *
+   * They also specify topological constraints that the auto-hinter relies
+   * on.  For example, using `AF_ADJUST_UP` implies that we have two
+   * enclosing contours, one for the base glyph and one for the diacritic
+   * above, and no other contour inbetween or above.  With 'enclosing' it is
+   * meant that such a contour can contain more inner contours.
+   *
+   */
+
+  /* Find the topmost contour and push it up until its lowest point is */
+  /* one pixel above the highest point not enclosed by that contour.   */
+#define AF_ADJUST_UP  0x01
+
+  /* Find the bottommost contour and push it down until its highest point */
+  /* is one pixel below the lowest point not enclosed by that contour.    */
+#define AF_ADJUST_DOWN  0x02
+
+  /* Find the contour below the topmost contour and push it up, together */
+  /* with the topmost contour, until its lowest point is one pixel above */
+  /* the highest point not enclosed by that contour.  This flag is       */
+  /* mutually exclusive with `AF_ADJUST_UP`.                             */
+#define AF_ADJUST_UP2  0x04
+
+  /* Find the contour above the bottommost contour and push it down,  */
+  /* together with the bottommost contour, until its highest point is */
+  /* one pixel below the lowest point not enclosed by that contour.   */
+  /* This flag is mutually exclusive with `AF_ADJUST_DOWN`.           */
+#define AF_ADJUST_DOWN2  0x08
+
+  /* The topmost contour is a tilde.  Enlarge it vertically so that it    */
+  /* stays legible at small sizes, not degenerating to a horizontal line. */
+#define AF_ADJUST_TILDE_TOP  0x10
+
+  /* The bottommost contour is a tilde.  Enlarge it vertically so that it */
+  /* stays legible at small sizes, not degenerating to a horizontal line. */
+#define AF_ADJUST_TILDE_BOTTOM  0x20
+
+  /* The contour below the topmost contour is a tilde.  Enlarge it        */
+  /* vertically so that it stays legible at small sizes, not degenerating */
+  /* to a horizontal line.  To be used with `AF_ADJUST_UP2` only.         */
+#define AF_ADJUST_TILDE_TOP2  0x40
+
+  /* The contour above the bottommost contour is a tilde.  Enlarge it     */
+  /* vertically so that it stays legible at small sizes, not degenerating */
+  /* to a horizontal line.  To be used with `AF_ADJUST_DOWN2` only.       */
+#define AF_ADJUST_TILDE_BOTTOM2  0x80
+
+  /* Make the auto-hinter ignore any diacritic (either a separate contour */
+  /* or part of the base character outline) that is attached to the top   */
+  /* of an uppercase base character.                                      */
+#define AF_IGNORE_CAPITAL_TOP  0x100
+
+  /* Make the auto-hinter ignore any diacritic (either a separate contour */
+  /* or part of the base character outline) that is attached to the       */
+  /* bottom of an uppercase base character.                               */
+#define AF_IGNORE_CAPITAL_BOTTOM  0x200
+
+  /* Make the auto-hinter ignore any diacritic (either a separate contour */
+  /* or part of the base character outline) that is attached to the top   */
+  /* of a lowercase base character.                                       */
+#define AF_IGNORE_SMALL_TOP  0x400
+
+  /* Make the auto-hinter ignore any diacritic (either a separate contour */
+  /* or part of the base character outline) that is attached to the       */
+  /* bottom of a lowercase base character.                                */
+#define AF_IGNORE_SMALL_BOTTOM  0x800
+
+  /* By default, the AF_ADJUST_XXX flags are applied only if diacritics */
+  /* have a 'small' height (based on some heuristic checks).  If this   */
+  /* flag is set, no such check is performed.                           */
+#define AF_ADJUST_NO_HEIGHT_CHECK  0x1000
+
+  /* No adjustment, i.e., no flag is set. */
+#define AF_ADJUST_NONE  0x00
+
+
+  FT_LOCAL( FT_UInt32 )
+  af_adjustment_database_lookup( FT_UInt32  codepoint );
+
+  /* Allocate and populate the reverse character map, */
+  /* using the character map within the face.         */
+  FT_LOCAL( FT_Error )
+  af_reverse_character_map_new( FT_Hash         *map,
+                                AF_StyleMetrics  metrics );
+
+  /* Free the reverse character map. */
+  FT_LOCAL( FT_Error )
+  af_reverse_character_map_done( FT_Hash    map,
+                                 FT_Memory  memory );
+
+
+FT_END_HEADER
+
+#endif /* AFADJUST_H_ */
+
+
+/* END */
diff --git a/src/java.desktop/share/native/libfreetype/src/autofit/afblue.c b/src/java.desktop/share/native/libfreetype/src/autofit/afblue.c
index ea83969cdc9..a6219bdfe41 100644
--- a/src/java.desktop/share/native/libfreetype/src/autofit/afblue.c
+++ b/src/java.desktop/share/native/libfreetype/src/autofit/afblue.c
@@ -7,7 +7,7 @@
  *
  *   Auto-fitter data for blue strings (body).
  *
- * Copyright (C) 2013-2024 by
+ * Copyright (C) 2013-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
@@ -467,24 +467,24 @@
   af_blue_stringsets[] =
   {
     /* */
-    { AF_BLUE_STRING_ADLAM_CAPITAL_TOP,    AF_BLUE_PROPERTY_LATIN_TOP        },
-    { AF_BLUE_STRING_ADLAM_CAPITAL_BOTTOM, 0                                 },
+    { AF_BLUE_STRING_ADLAM_CAPITAL_TOP,    AF_BLUE_PROPERTY_LATIN_TOP            },
+    { AF_BLUE_STRING_ADLAM_CAPITAL_BOTTOM, AF_BLUE_PROPERTY_LATIN_CAPITAL_BOTTOM },
     { AF_BLUE_STRING_ADLAM_SMALL_TOP,      AF_BLUE_PROPERTY_LATIN_TOP      |
-                                           AF_BLUE_PROPERTY_LATIN_X_HEIGHT   },
-    { AF_BLUE_STRING_ADLAM_SMALL_BOTTOM,   0                                 },
-    { AF_BLUE_STRING_MAX,                  0                                 },
+                                           AF_BLUE_PROPERTY_LATIN_X_HEIGHT       },
+    { AF_BLUE_STRING_ADLAM_SMALL_BOTTOM,   AF_BLUE_PROPERTY_LATIN_SMALL_BOTTOM   },
+    { AF_BLUE_STRING_MAX,                  0                                     },
     { AF_BLUE_STRING_ARABIC_TOP,    AF_BLUE_PROPERTY_LATIN_TOP     },
     { AF_BLUE_STRING_ARABIC_BOTTOM, 0                              },
     { AF_BLUE_STRING_ARABIC_JOIN,   AF_BLUE_PROPERTY_LATIN_NEUTRAL },
     { AF_BLUE_STRING_MAX,           0                              },
-    { AF_BLUE_STRING_ARMENIAN_CAPITAL_TOP,     AF_BLUE_PROPERTY_LATIN_TOP        },
-    { AF_BLUE_STRING_ARMENIAN_CAPITAL_BOTTOM,  0                                 },
-    { AF_BLUE_STRING_ARMENIAN_SMALL_ASCENDER,  AF_BLUE_PROPERTY_LATIN_TOP        },
+    { AF_BLUE_STRING_ARMENIAN_CAPITAL_TOP,     AF_BLUE_PROPERTY_LATIN_TOP            },
+    { AF_BLUE_STRING_ARMENIAN_CAPITAL_BOTTOM,  AF_BLUE_PROPERTY_LATIN_CAPITAL_BOTTOM },
+    { AF_BLUE_STRING_ARMENIAN_SMALL_ASCENDER,  AF_BLUE_PROPERTY_LATIN_TOP            },
     { AF_BLUE_STRING_ARMENIAN_SMALL_TOP,       AF_BLUE_PROPERTY_LATIN_TOP      |
-                                               AF_BLUE_PROPERTY_LATIN_X_HEIGHT   },
-    { AF_BLUE_STRING_ARMENIAN_SMALL_BOTTOM,    0                                 },
-    { AF_BLUE_STRING_ARMENIAN_SMALL_DESCENDER, 0                                 },
-    { AF_BLUE_STRING_MAX,                      0                                 },
+                                               AF_BLUE_PROPERTY_LATIN_X_HEIGHT       },
+    { AF_BLUE_STRING_ARMENIAN_SMALL_BOTTOM,    AF_BLUE_PROPERTY_LATIN_SMALL_BOTTOM   },
+    { AF_BLUE_STRING_ARMENIAN_SMALL_DESCENDER, 0                                     },
+    { AF_BLUE_STRING_MAX,                      0                                     },
     { AF_BLUE_STRING_AVESTAN_TOP,    AF_BLUE_PROPERTY_LATIN_TOP },
     { AF_BLUE_STRING_AVESTAN_BOTTOM, 0                          },
     { AF_BLUE_STRING_MAX,            0                          },
@@ -508,14 +508,14 @@
     { AF_BLUE_STRING_CHAKMA_BOTTOM,    0                          },
     { AF_BLUE_STRING_CHAKMA_DESCENDER, 0                          },
     { AF_BLUE_STRING_MAX,              0                          },
-    { AF_BLUE_STRING_CANADIAN_SYLLABICS_TOP,          AF_BLUE_PROPERTY_LATIN_TOP        },
-    { AF_BLUE_STRING_CANADIAN_SYLLABICS_BOTTOM,       0                                 },
+    { AF_BLUE_STRING_CANADIAN_SYLLABICS_TOP,          AF_BLUE_PROPERTY_LATIN_TOP          },
+    { AF_BLUE_STRING_CANADIAN_SYLLABICS_BOTTOM,       0                                   },
     { AF_BLUE_STRING_CANADIAN_SYLLABICS_SMALL_TOP,    AF_BLUE_PROPERTY_LATIN_TOP      |
-                                                      AF_BLUE_PROPERTY_LATIN_X_HEIGHT   },
-    { AF_BLUE_STRING_CANADIAN_SYLLABICS_SMALL_BOTTOM, 0                                 },
-    { AF_BLUE_STRING_CANADIAN_SYLLABICS_SUPS_TOP,     AF_BLUE_PROPERTY_LATIN_TOP        },
-    { AF_BLUE_STRING_CANADIAN_SYLLABICS_SUPS_BOTTOM,  0                                 },
-    { AF_BLUE_STRING_MAX,                             0                                 },
+                                                      AF_BLUE_PROPERTY_LATIN_X_HEIGHT     },
+    { AF_BLUE_STRING_CANADIAN_SYLLABICS_SMALL_BOTTOM, AF_BLUE_PROPERTY_LATIN_SMALL_BOTTOM },
+    { AF_BLUE_STRING_CANADIAN_SYLLABICS_SUPS_TOP,     AF_BLUE_PROPERTY_LATIN_TOP          },
+    { AF_BLUE_STRING_CANADIAN_SYLLABICS_SUPS_BOTTOM,  0                                   },
+    { AF_BLUE_STRING_MAX,                             0                                   },
     { AF_BLUE_STRING_CARIAN_TOP,    AF_BLUE_PROPERTY_LATIN_TOP },
     { AF_BLUE_STRING_CARIAN_BOTTOM, 0                          },
     { AF_BLUE_STRING_MAX,           0                          },
@@ -527,24 +527,24 @@
     { AF_BLUE_STRING_CHEROKEE_SMALL,           0                                 },
     { AF_BLUE_STRING_CHEROKEE_SMALL_DESCENDER, 0                                 },
     { AF_BLUE_STRING_MAX,                      0                                 },
-    { AF_BLUE_STRING_COPTIC_CAPITAL_TOP,    AF_BLUE_PROPERTY_LATIN_TOP        },
-    { AF_BLUE_STRING_COPTIC_CAPITAL_BOTTOM, 0                                 },
+    { AF_BLUE_STRING_COPTIC_CAPITAL_TOP,    AF_BLUE_PROPERTY_LATIN_TOP            },
+    { AF_BLUE_STRING_COPTIC_CAPITAL_BOTTOM, AF_BLUE_PROPERTY_LATIN_CAPITAL_BOTTOM },
     { AF_BLUE_STRING_COPTIC_SMALL_TOP,      AF_BLUE_PROPERTY_LATIN_TOP      |
-                                            AF_BLUE_PROPERTY_LATIN_X_HEIGHT   },
-    { AF_BLUE_STRING_COPTIC_SMALL_BOTTOM,   0                                 },
-    { AF_BLUE_STRING_MAX,                   0                                 },
+                                            AF_BLUE_PROPERTY_LATIN_X_HEIGHT       },
+    { AF_BLUE_STRING_COPTIC_SMALL_BOTTOM,   AF_BLUE_PROPERTY_LATIN_SMALL_BOTTOM   },
+    { AF_BLUE_STRING_MAX,                   0                                     },
     { AF_BLUE_STRING_CYPRIOT_TOP,    AF_BLUE_PROPERTY_LATIN_TOP },
     { AF_BLUE_STRING_CYPRIOT_BOTTOM, 0                          },
     { AF_BLUE_STRING_CYPRIOT_SMALL,  AF_BLUE_PROPERTY_LATIN_TOP },
     { AF_BLUE_STRING_CYPRIOT_SMALL,  0                          },
     { AF_BLUE_STRING_MAX,            0                          },
-    { AF_BLUE_STRING_CYRILLIC_CAPITAL_TOP,     AF_BLUE_PROPERTY_LATIN_TOP        },
-    { AF_BLUE_STRING_CYRILLIC_CAPITAL_BOTTOM,  0                                 },
+    { AF_BLUE_STRING_CYRILLIC_CAPITAL_TOP,     AF_BLUE_PROPERTY_LATIN_TOP            },
+    { AF_BLUE_STRING_CYRILLIC_CAPITAL_BOTTOM,  AF_BLUE_PROPERTY_LATIN_CAPITAL_BOTTOM },
     { AF_BLUE_STRING_CYRILLIC_SMALL,           AF_BLUE_PROPERTY_LATIN_TOP      |
-                                               AF_BLUE_PROPERTY_LATIN_X_HEIGHT   },
-    { AF_BLUE_STRING_CYRILLIC_SMALL,           0                                 },
-    { AF_BLUE_STRING_CYRILLIC_SMALL_DESCENDER, 0                                 },
-    { AF_BLUE_STRING_MAX,                      0                                 },
+                                               AF_BLUE_PROPERTY_LATIN_X_HEIGHT       },
+    { AF_BLUE_STRING_CYRILLIC_SMALL,           0                                     },
+    { AF_BLUE_STRING_CYRILLIC_SMALL_DESCENDER, 0                                     },
+    { AF_BLUE_STRING_MAX,                      0                                     },
     { AF_BLUE_STRING_DEVANAGARI_TOP,    AF_BLUE_PROPERTY_LATIN_TOP        },
     { AF_BLUE_STRING_DEVANAGARI_HEAD,   AF_BLUE_PROPERTY_LATIN_TOP        },
     { AF_BLUE_STRING_DEVANAGARI_BASE,   AF_BLUE_PROPERTY_LATIN_TOP      |
@@ -553,12 +553,12 @@
     { AF_BLUE_STRING_DEVANAGARI_BASE,   0                                 },
     { AF_BLUE_STRING_DEVANAGARI_BOTTOM, 0                                 },
     { AF_BLUE_STRING_MAX,               0                                 },
-    { AF_BLUE_STRING_DESERET_CAPITAL_TOP,    AF_BLUE_PROPERTY_LATIN_TOP        },
-    { AF_BLUE_STRING_DESERET_CAPITAL_BOTTOM, 0                                 },
+    { AF_BLUE_STRING_DESERET_CAPITAL_TOP,    AF_BLUE_PROPERTY_LATIN_TOP            },
+    { AF_BLUE_STRING_DESERET_CAPITAL_BOTTOM, AF_BLUE_PROPERTY_LATIN_CAPITAL_BOTTOM },
     { AF_BLUE_STRING_DESERET_SMALL_TOP,      AF_BLUE_PROPERTY_LATIN_TOP      |
-                                             AF_BLUE_PROPERTY_LATIN_X_HEIGHT   },
-    { AF_BLUE_STRING_DESERET_SMALL_BOTTOM,   0                                 },
-    { AF_BLUE_STRING_MAX,                    0                                 },
+                                             AF_BLUE_PROPERTY_LATIN_X_HEIGHT       },
+    { AF_BLUE_STRING_DESERET_SMALL_BOTTOM,   AF_BLUE_PROPERTY_LATIN_SMALL_BOTTOM   },
+    { AF_BLUE_STRING_MAX,                    0                                     },
     { AF_BLUE_STRING_ETHIOPIC_TOP,    AF_BLUE_PROPERTY_LATIN_TOP },
     { AF_BLUE_STRING_ETHIOPIC_BOTTOM, 0                          },
     { AF_BLUE_STRING_MAX,             0                          },
@@ -578,23 +578,23 @@
     { AF_BLUE_STRING_GEORGIAN_NUSKHURI_ASCENDER,  AF_BLUE_PROPERTY_LATIN_TOP        },
     { AF_BLUE_STRING_GEORGIAN_NUSKHURI_DESCENDER, 0                                 },
     { AF_BLUE_STRING_MAX,                         0                                 },
-    { AF_BLUE_STRING_GLAGOLITIC_CAPITAL_TOP,    AF_BLUE_PROPERTY_LATIN_TOP        },
-    { AF_BLUE_STRING_GLAGOLITIC_CAPITAL_BOTTOM, 0                                 },
+    { AF_BLUE_STRING_GLAGOLITIC_CAPITAL_TOP,    AF_BLUE_PROPERTY_LATIN_TOP            },
+    { AF_BLUE_STRING_GLAGOLITIC_CAPITAL_BOTTOM, AF_BLUE_PROPERTY_LATIN_CAPITAL_BOTTOM },
     { AF_BLUE_STRING_GLAGOLITIC_SMALL_TOP,      AF_BLUE_PROPERTY_LATIN_TOP      |
-                                                AF_BLUE_PROPERTY_LATIN_X_HEIGHT   },
-    { AF_BLUE_STRING_GLAGOLITIC_SMALL_BOTTOM,   0                                 },
-    { AF_BLUE_STRING_MAX,                       0                                 },
+                                                AF_BLUE_PROPERTY_LATIN_X_HEIGHT       },
+    { AF_BLUE_STRING_GLAGOLITIC_SMALL_BOTTOM,   AF_BLUE_PROPERTY_LATIN_SMALL_BOTTOM   },
+    { AF_BLUE_STRING_MAX,                       0                                     },
     { AF_BLUE_STRING_GOTHIC_TOP,    AF_BLUE_PROPERTY_LATIN_TOP },
     { AF_BLUE_STRING_GOTHIC_BOTTOM, 0                          },
     { AF_BLUE_STRING_MAX,           0                          },
-    { AF_BLUE_STRING_GREEK_CAPITAL_TOP,     AF_BLUE_PROPERTY_LATIN_TOP        },
-    { AF_BLUE_STRING_GREEK_CAPITAL_BOTTOM,  0                                 },
-    { AF_BLUE_STRING_GREEK_SMALL_BETA_TOP,  AF_BLUE_PROPERTY_LATIN_TOP        },
+    { AF_BLUE_STRING_GREEK_CAPITAL_TOP,     AF_BLUE_PROPERTY_LATIN_TOP            },
+    { AF_BLUE_STRING_GREEK_CAPITAL_BOTTOM,  AF_BLUE_PROPERTY_LATIN_CAPITAL_BOTTOM },
+    { AF_BLUE_STRING_GREEK_SMALL_BETA_TOP,  AF_BLUE_PROPERTY_LATIN_TOP            },
     { AF_BLUE_STRING_GREEK_SMALL,           AF_BLUE_PROPERTY_LATIN_TOP      |
-                                            AF_BLUE_PROPERTY_LATIN_X_HEIGHT   },
-    { AF_BLUE_STRING_GREEK_SMALL,           0                                 },
-    { AF_BLUE_STRING_GREEK_SMALL_DESCENDER, 0                                 },
-    { AF_BLUE_STRING_MAX,                   0                                 },
+                                            AF_BLUE_PROPERTY_LATIN_X_HEIGHT       },
+    { AF_BLUE_STRING_GREEK_SMALL,           0                                     },
+    { AF_BLUE_STRING_GREEK_SMALL_DESCENDER, 0                                     },
+    { AF_BLUE_STRING_MAX,                   0                                     },
     { AF_BLUE_STRING_GUJARATI_TOP,       AF_BLUE_PROPERTY_LATIN_TOP      |
                                          AF_BLUE_PROPERTY_LATIN_X_HEIGHT   },
     { AF_BLUE_STRING_GUJARATI_BOTTOM,    0                                 },
@@ -643,45 +643,45 @@
     { AF_BLUE_STRING_LAO_LARGE_ASCENDER, AF_BLUE_PROPERTY_LATIN_TOP        },
     { AF_BLUE_STRING_LAO_DESCENDER,      0                                 },
     { AF_BLUE_STRING_MAX,                0                                 },
-    { AF_BLUE_STRING_LATIN_CAPITAL_TOP,     AF_BLUE_PROPERTY_LATIN_TOP        },
-    { AF_BLUE_STRING_LATIN_CAPITAL_BOTTOM,  0                                 },
-    { AF_BLUE_STRING_LATIN_SMALL_F_TOP,     AF_BLUE_PROPERTY_LATIN_TOP        },
+    { AF_BLUE_STRING_LATIN_CAPITAL_TOP,     AF_BLUE_PROPERTY_LATIN_TOP            },
+    { AF_BLUE_STRING_LATIN_CAPITAL_BOTTOM,  AF_BLUE_PROPERTY_LATIN_CAPITAL_BOTTOM },
+    { AF_BLUE_STRING_LATIN_SMALL_F_TOP,     AF_BLUE_PROPERTY_LATIN_TOP            },
     { AF_BLUE_STRING_LATIN_SMALL_TOP,       AF_BLUE_PROPERTY_LATIN_TOP      |
-                                            AF_BLUE_PROPERTY_LATIN_X_HEIGHT   },
-    { AF_BLUE_STRING_LATIN_SMALL_BOTTOM,    0                                 },
-    { AF_BLUE_STRING_LATIN_SMALL_DESCENDER, 0                                 },
-    { AF_BLUE_STRING_MAX,                   0                                 },
-    { AF_BLUE_STRING_LATIN_SUBS_CAPITAL_TOP,     AF_BLUE_PROPERTY_LATIN_TOP        },
-    { AF_BLUE_STRING_LATIN_SUBS_CAPITAL_BOTTOM,  0                                 },
-    { AF_BLUE_STRING_LATIN_SUBS_SMALL_F_TOP,     AF_BLUE_PROPERTY_LATIN_TOP        },
+                                            AF_BLUE_PROPERTY_LATIN_X_HEIGHT       },
+    { AF_BLUE_STRING_LATIN_SMALL_BOTTOM,    AF_BLUE_PROPERTY_LATIN_SMALL_BOTTOM   },
+    { AF_BLUE_STRING_LATIN_SMALL_DESCENDER, 0                                     },
+    { AF_BLUE_STRING_MAX,                   0                                     },
+    { AF_BLUE_STRING_LATIN_SUBS_CAPITAL_TOP,     AF_BLUE_PROPERTY_LATIN_TOP            },
+    { AF_BLUE_STRING_LATIN_SUBS_CAPITAL_BOTTOM,  AF_BLUE_PROPERTY_LATIN_CAPITAL_BOTTOM },
+    { AF_BLUE_STRING_LATIN_SUBS_SMALL_F_TOP,     AF_BLUE_PROPERTY_LATIN_TOP            },
     { AF_BLUE_STRING_LATIN_SUBS_SMALL,           AF_BLUE_PROPERTY_LATIN_TOP      |
-                                                 AF_BLUE_PROPERTY_LATIN_X_HEIGHT   },
-    { AF_BLUE_STRING_LATIN_SUBS_SMALL,           0                                 },
-    { AF_BLUE_STRING_LATIN_SUBS_SMALL_DESCENDER, 0                                 },
-    { AF_BLUE_STRING_MAX,                        0                                 },
-    { AF_BLUE_STRING_LATIN_SUPS_CAPITAL_TOP,     AF_BLUE_PROPERTY_LATIN_TOP        },
-    { AF_BLUE_STRING_LATIN_SUPS_CAPITAL_BOTTOM,  0                                 },
-    { AF_BLUE_STRING_LATIN_SUPS_SMALL_F_TOP,     AF_BLUE_PROPERTY_LATIN_TOP        },
+                                                 AF_BLUE_PROPERTY_LATIN_X_HEIGHT       },
+    { AF_BLUE_STRING_LATIN_SUBS_SMALL,           0                                     },
+    { AF_BLUE_STRING_LATIN_SUBS_SMALL_DESCENDER, 0                                     },
+    { AF_BLUE_STRING_MAX,                        0                                     },
+    { AF_BLUE_STRING_LATIN_SUPS_CAPITAL_TOP,     AF_BLUE_PROPERTY_LATIN_TOP            },
+    { AF_BLUE_STRING_LATIN_SUPS_CAPITAL_BOTTOM,  AF_BLUE_PROPERTY_LATIN_CAPITAL_BOTTOM },
+    { AF_BLUE_STRING_LATIN_SUPS_SMALL_F_TOP,     AF_BLUE_PROPERTY_LATIN_TOP            },
     { AF_BLUE_STRING_LATIN_SUPS_SMALL,           AF_BLUE_PROPERTY_LATIN_TOP      |
-                                                 AF_BLUE_PROPERTY_LATIN_X_HEIGHT   },
-    { AF_BLUE_STRING_LATIN_SUPS_SMALL,           0                                 },
-    { AF_BLUE_STRING_LATIN_SUPS_SMALL_DESCENDER, 0                                 },
-    { AF_BLUE_STRING_MAX,                        0                                 },
+                                                 AF_BLUE_PROPERTY_LATIN_X_HEIGHT       },
+    { AF_BLUE_STRING_LATIN_SUPS_SMALL,           0                                     },
+    { AF_BLUE_STRING_LATIN_SUPS_SMALL_DESCENDER, 0                                     },
+    { AF_BLUE_STRING_MAX,                        0                                     },
     { AF_BLUE_STRING_LISU_TOP,    AF_BLUE_PROPERTY_LATIN_TOP },
     { AF_BLUE_STRING_LISU_BOTTOM, 0                          },
     { AF_BLUE_STRING_MAX,         0                          },
     { AF_BLUE_STRING_MALAYALAM_TOP,    AF_BLUE_PROPERTY_LATIN_TOP },
     { AF_BLUE_STRING_MALAYALAM_BOTTOM, 0                          },
     { AF_BLUE_STRING_MAX,              0                          },
-    { AF_BLUE_STRING_MEDEFAIDRIN_CAPITAL_TOP,     AF_BLUE_PROPERTY_LATIN_TOP        },
-    { AF_BLUE_STRING_MEDEFAIDRIN_CAPITAL_BOTTOM,  0                                 },
-    { AF_BLUE_STRING_MEDEFAIDRIN_SMALL_F_TOP,     AF_BLUE_PROPERTY_LATIN_TOP        },
+    { AF_BLUE_STRING_MEDEFAIDRIN_CAPITAL_TOP,     AF_BLUE_PROPERTY_LATIN_TOP            },
+    { AF_BLUE_STRING_MEDEFAIDRIN_CAPITAL_BOTTOM,  AF_BLUE_PROPERTY_LATIN_CAPITAL_BOTTOM },
+    { AF_BLUE_STRING_MEDEFAIDRIN_SMALL_F_TOP,     AF_BLUE_PROPERTY_LATIN_TOP            },
     { AF_BLUE_STRING_MEDEFAIDRIN_SMALL_TOP,       AF_BLUE_PROPERTY_LATIN_TOP      |
-                                                  AF_BLUE_PROPERTY_LATIN_X_HEIGHT   },
-    { AF_BLUE_STRING_MEDEFAIDRIN_SMALL_BOTTOM,    0                                 },
-    { AF_BLUE_STRING_MEDEFAIDRIN_SMALL_DESCENDER, 0                                 },
-    { AF_BLUE_STRING_MEDEFAIDRIN_DIGIT_TOP,       AF_BLUE_PROPERTY_LATIN_TOP        },
-    { AF_BLUE_STRING_MAX,                         0                                 },
+                                                  AF_BLUE_PROPERTY_LATIN_X_HEIGHT       },
+    { AF_BLUE_STRING_MEDEFAIDRIN_SMALL_BOTTOM,    AF_BLUE_PROPERTY_LATIN_SMALL_BOTTOM   },
+    { AF_BLUE_STRING_MEDEFAIDRIN_SMALL_DESCENDER, 0                                     },
+    { AF_BLUE_STRING_MEDEFAIDRIN_DIGIT_TOP,       AF_BLUE_PROPERTY_LATIN_TOP            },
+    { AF_BLUE_STRING_MAX,                         0                                     },
     { AF_BLUE_STRING_MONGOLIAN_TOP_BASE,    AF_BLUE_PROPERTY_LATIN_TOP },
     { AF_BLUE_STRING_MONGOLIAN_BOTTOM_BASE, 0                          },
     { AF_BLUE_STRING_MAX,                   0                          },
@@ -691,12 +691,12 @@
     { AF_BLUE_STRING_MYANMAR_ASCENDER,  AF_BLUE_PROPERTY_LATIN_TOP        },
     { AF_BLUE_STRING_MYANMAR_DESCENDER, 0                                 },
     { AF_BLUE_STRING_MAX,               0                                 },
-    { AF_BLUE_STRING_NKO_TOP,          AF_BLUE_PROPERTY_LATIN_TOP        },
-    { AF_BLUE_STRING_NKO_BOTTOM,       0                                 },
+    { AF_BLUE_STRING_NKO_TOP,          AF_BLUE_PROPERTY_LATIN_TOP          },
+    { AF_BLUE_STRING_NKO_BOTTOM,       0                                   },
     { AF_BLUE_STRING_NKO_SMALL_TOP,    AF_BLUE_PROPERTY_LATIN_TOP      |
-                                       AF_BLUE_PROPERTY_LATIN_X_HEIGHT   },
-    { AF_BLUE_STRING_NKO_SMALL_BOTTOM, 0                                 },
-    { AF_BLUE_STRING_MAX,              0                                 },
+                                       AF_BLUE_PROPERTY_LATIN_X_HEIGHT     },
+    { AF_BLUE_STRING_NKO_SMALL_BOTTOM, AF_BLUE_PROPERTY_LATIN_SMALL_BOTTOM },
+    { AF_BLUE_STRING_MAX,              0                                   },
     { AF_BLUE_STRING_MAX, 0 },
     { AF_BLUE_STRING_OL_CHIKI, AF_BLUE_PROPERTY_LATIN_TOP },
     { AF_BLUE_STRING_OL_CHIKI, 0                          },
@@ -704,15 +704,15 @@
     { AF_BLUE_STRING_OLD_TURKIC_TOP,    AF_BLUE_PROPERTY_LATIN_TOP },
     { AF_BLUE_STRING_OLD_TURKIC_BOTTOM, 0                          },
     { AF_BLUE_STRING_MAX,               0                          },
-    { AF_BLUE_STRING_OSAGE_CAPITAL_TOP,       AF_BLUE_PROPERTY_LATIN_TOP       },
-    { AF_BLUE_STRING_OSAGE_CAPITAL_BOTTOM,    0                                },
-    { AF_BLUE_STRING_OSAGE_CAPITAL_DESCENDER, 0                                },
-    { AF_BLUE_STRING_OSAGE_SMALL_TOP,         AF_BLUE_PROPERTY_LATIN_TOP     |
-                                              AF_BLUE_PROPERTY_LATIN_X_HEIGHT  },
-    { AF_BLUE_STRING_OSAGE_SMALL_BOTTOM,      0                                },
-    { AF_BLUE_STRING_OSAGE_SMALL_ASCENDER,    AF_BLUE_PROPERTY_LATIN_TOP       },
-    { AF_BLUE_STRING_OSAGE_SMALL_DESCENDER,   0                                },
-    { AF_BLUE_STRING_MAX,                     0                                },
+    { AF_BLUE_STRING_OSAGE_CAPITAL_TOP,       AF_BLUE_PROPERTY_LATIN_TOP            },
+    { AF_BLUE_STRING_OSAGE_CAPITAL_BOTTOM,    AF_BLUE_PROPERTY_LATIN_CAPITAL_BOTTOM },
+    { AF_BLUE_STRING_OSAGE_CAPITAL_DESCENDER, 0                                     },
+    { AF_BLUE_STRING_OSAGE_SMALL_TOP,         AF_BLUE_PROPERTY_LATIN_TOP      |
+                                              AF_BLUE_PROPERTY_LATIN_X_HEIGHT       },
+    { AF_BLUE_STRING_OSAGE_SMALL_BOTTOM,      AF_BLUE_PROPERTY_LATIN_SMALL_BOTTOM   },
+    { AF_BLUE_STRING_OSAGE_SMALL_ASCENDER,    AF_BLUE_PROPERTY_LATIN_TOP            },
+    { AF_BLUE_STRING_OSAGE_SMALL_DESCENDER,   0                                     },
+    { AF_BLUE_STRING_MAX,                     0                                     },
     { AF_BLUE_STRING_OSMANYA_TOP,    AF_BLUE_PROPERTY_LATIN_TOP },
     { AF_BLUE_STRING_OSMANYA_BOTTOM, 0                          },
     { AF_BLUE_STRING_MAX,            0                          },
@@ -723,13 +723,13 @@
     { AF_BLUE_STRING_SAURASHTRA_TOP,    AF_BLUE_PROPERTY_LATIN_TOP },
     { AF_BLUE_STRING_SAURASHTRA_BOTTOM, 0                          },
     { AF_BLUE_STRING_MAX,               0                          },
-    { AF_BLUE_STRING_SHAVIAN_TOP,          AF_BLUE_PROPERTY_LATIN_TOP        },
-    { AF_BLUE_STRING_SHAVIAN_BOTTOM,       0                                 },
-    { AF_BLUE_STRING_SHAVIAN_DESCENDER,    0                                 },
+    { AF_BLUE_STRING_SHAVIAN_TOP,          AF_BLUE_PROPERTY_LATIN_TOP          },
+    { AF_BLUE_STRING_SHAVIAN_BOTTOM,       0                                   },
+    { AF_BLUE_STRING_SHAVIAN_DESCENDER,    0                                   },
     { AF_BLUE_STRING_SHAVIAN_SMALL_TOP,    AF_BLUE_PROPERTY_LATIN_TOP      |
-                                           AF_BLUE_PROPERTY_LATIN_X_HEIGHT   },
-    { AF_BLUE_STRING_SHAVIAN_SMALL_BOTTOM, 0                                 },
-    { AF_BLUE_STRING_MAX,                  0                                 },
+                                           AF_BLUE_PROPERTY_LATIN_X_HEIGHT     },
+    { AF_BLUE_STRING_SHAVIAN_SMALL_BOTTOM, AF_BLUE_PROPERTY_LATIN_SMALL_BOTTOM },
+    { AF_BLUE_STRING_MAX,                  0                                   },
     { AF_BLUE_STRING_SINHALA_TOP,       AF_BLUE_PROPERTY_LATIN_TOP },
     { AF_BLUE_STRING_SINHALA_BOTTOM,    0                          },
     { AF_BLUE_STRING_SINHALA_DESCENDER, 0                          },
diff --git a/src/java.desktop/share/native/libfreetype/src/autofit/afblue.cin b/src/java.desktop/share/native/libfreetype/src/autofit/afblue.cin
index d2270fac744..786c6b3b9e6 100644
--- a/src/java.desktop/share/native/libfreetype/src/autofit/afblue.cin
+++ b/src/java.desktop/share/native/libfreetype/src/autofit/afblue.cin
@@ -4,7 +4,7 @@
  *
  *   Auto-fitter data for blue strings (body).
  *
- * Copyright (C) 2013-2024 by
+ * Copyright (C) 2013-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/autofit/afblue.dat b/src/java.desktop/share/native/libfreetype/src/autofit/afblue.dat
index 88bab2632ab..f6e96ff8189 100644
--- a/src/java.desktop/share/native/libfreetype/src/autofit/afblue.dat
+++ b/src/java.desktop/share/native/libfreetype/src/autofit/afblue.dat
@@ -2,7 +2,7 @@
 //
 //   Auto-fitter data for blue strings.
 //
-// Copyright (C) 2013-2024 by
+// Copyright (C) 2013-2025 by
 // David Turner, Robert Wilhelm, and Werner Lemberg.
 //
 // This file is part of the FreeType project, and may only be used,
@@ -699,12 +699,12 @@ AF_BLUE_STRING_ENUM AF_BLUE_STRINGS_ARRAY AF_BLUE_STRING_MAX_LEN:
 AF_BLUE_STRINGSET_ENUM AF_BLUE_STRINGSETS_ARRAY AF_BLUE_STRINGSET_MAX_LEN:
 
   AF_BLUE_STRINGSET_ADLM
-    { AF_BLUE_STRING_ADLAM_CAPITAL_TOP,    AF_BLUE_PROPERTY_LATIN_TOP        }
-    { AF_BLUE_STRING_ADLAM_CAPITAL_BOTTOM, 0                                 }
+    { AF_BLUE_STRING_ADLAM_CAPITAL_TOP,    AF_BLUE_PROPERTY_LATIN_TOP            }
+    { AF_BLUE_STRING_ADLAM_CAPITAL_BOTTOM, AF_BLUE_PROPERTY_LATIN_CAPITAL_BOTTOM }
     { AF_BLUE_STRING_ADLAM_SMALL_TOP,      AF_BLUE_PROPERTY_LATIN_TOP      |
-                                           AF_BLUE_PROPERTY_LATIN_X_HEIGHT   }
-    { AF_BLUE_STRING_ADLAM_SMALL_BOTTOM,   0                                 }
-    { AF_BLUE_STRING_MAX,                  0                                 }
+                                           AF_BLUE_PROPERTY_LATIN_X_HEIGHT       }
+    { AF_BLUE_STRING_ADLAM_SMALL_BOTTOM,   AF_BLUE_PROPERTY_LATIN_SMALL_BOTTOM   }
+    { AF_BLUE_STRING_MAX,                  0                                     }
 
   AF_BLUE_STRINGSET_ARAB
     { AF_BLUE_STRING_ARABIC_TOP,    AF_BLUE_PROPERTY_LATIN_TOP     }
@@ -713,14 +713,14 @@ AF_BLUE_STRINGSET_ENUM AF_BLUE_STRINGSETS_ARRAY AF_BLUE_STRINGSET_MAX_LEN:
     { AF_BLUE_STRING_MAX,           0                              }
 
   AF_BLUE_STRINGSET_ARMN
-    { AF_BLUE_STRING_ARMENIAN_CAPITAL_TOP,     AF_BLUE_PROPERTY_LATIN_TOP        }
-    { AF_BLUE_STRING_ARMENIAN_CAPITAL_BOTTOM,  0                                 }
-    { AF_BLUE_STRING_ARMENIAN_SMALL_ASCENDER,  AF_BLUE_PROPERTY_LATIN_TOP        }
+    { AF_BLUE_STRING_ARMENIAN_CAPITAL_TOP,     AF_BLUE_PROPERTY_LATIN_TOP            }
+    { AF_BLUE_STRING_ARMENIAN_CAPITAL_BOTTOM,  AF_BLUE_PROPERTY_LATIN_CAPITAL_BOTTOM }
+    { AF_BLUE_STRING_ARMENIAN_SMALL_ASCENDER,  AF_BLUE_PROPERTY_LATIN_TOP            }
     { AF_BLUE_STRING_ARMENIAN_SMALL_TOP,       AF_BLUE_PROPERTY_LATIN_TOP      |
-                                               AF_BLUE_PROPERTY_LATIN_X_HEIGHT   }
-    { AF_BLUE_STRING_ARMENIAN_SMALL_BOTTOM,    0                                 }
-    { AF_BLUE_STRING_ARMENIAN_SMALL_DESCENDER, 0                                 }
-    { AF_BLUE_STRING_MAX,                      0                                 }
+                                               AF_BLUE_PROPERTY_LATIN_X_HEIGHT       }
+    { AF_BLUE_STRING_ARMENIAN_SMALL_BOTTOM,    AF_BLUE_PROPERTY_LATIN_SMALL_BOTTOM   }
+    { AF_BLUE_STRING_ARMENIAN_SMALL_DESCENDER, 0                                     }
+    { AF_BLUE_STRING_MAX,                      0                                     }
 
   AF_BLUE_STRINGSET_AVST
     { AF_BLUE_STRING_AVESTAN_TOP,    AF_BLUE_PROPERTY_LATIN_TOP }
@@ -756,14 +756,14 @@ AF_BLUE_STRINGSET_ENUM AF_BLUE_STRINGSETS_ARRAY AF_BLUE_STRINGSET_MAX_LEN:
     { AF_BLUE_STRING_MAX,              0                          }
 
   AF_BLUE_STRINGSET_CANS
-    { AF_BLUE_STRING_CANADIAN_SYLLABICS_TOP,          AF_BLUE_PROPERTY_LATIN_TOP        }
-    { AF_BLUE_STRING_CANADIAN_SYLLABICS_BOTTOM,       0                                 }
+    { AF_BLUE_STRING_CANADIAN_SYLLABICS_TOP,          AF_BLUE_PROPERTY_LATIN_TOP          }
+    { AF_BLUE_STRING_CANADIAN_SYLLABICS_BOTTOM,       0                                   }
     { AF_BLUE_STRING_CANADIAN_SYLLABICS_SMALL_TOP,    AF_BLUE_PROPERTY_LATIN_TOP      |
-                                                      AF_BLUE_PROPERTY_LATIN_X_HEIGHT   }
-    { AF_BLUE_STRING_CANADIAN_SYLLABICS_SMALL_BOTTOM, 0                                 }
-    { AF_BLUE_STRING_CANADIAN_SYLLABICS_SUPS_TOP,     AF_BLUE_PROPERTY_LATIN_TOP        }
-    { AF_BLUE_STRING_CANADIAN_SYLLABICS_SUPS_BOTTOM,  0                                 }
-    { AF_BLUE_STRING_MAX,                             0                                 }
+                                                      AF_BLUE_PROPERTY_LATIN_X_HEIGHT     }
+    { AF_BLUE_STRING_CANADIAN_SYLLABICS_SMALL_BOTTOM, AF_BLUE_PROPERTY_LATIN_SMALL_BOTTOM }
+    { AF_BLUE_STRING_CANADIAN_SYLLABICS_SUPS_TOP,     AF_BLUE_PROPERTY_LATIN_TOP          }
+    { AF_BLUE_STRING_CANADIAN_SYLLABICS_SUPS_BOTTOM,  0                                   }
+    { AF_BLUE_STRING_MAX,                             0                                   }
 
   AF_BLUE_STRINGSET_CARI
     { AF_BLUE_STRING_CARIAN_TOP,    AF_BLUE_PROPERTY_LATIN_TOP }
@@ -781,12 +781,12 @@ AF_BLUE_STRINGSET_ENUM AF_BLUE_STRINGSETS_ARRAY AF_BLUE_STRINGSET_MAX_LEN:
     { AF_BLUE_STRING_MAX,                      0                                 }
 
   AF_BLUE_STRINGSET_COPT
-    { AF_BLUE_STRING_COPTIC_CAPITAL_TOP,    AF_BLUE_PROPERTY_LATIN_TOP        }
-    { AF_BLUE_STRING_COPTIC_CAPITAL_BOTTOM, 0                                 }
+    { AF_BLUE_STRING_COPTIC_CAPITAL_TOP,    AF_BLUE_PROPERTY_LATIN_TOP            }
+    { AF_BLUE_STRING_COPTIC_CAPITAL_BOTTOM, AF_BLUE_PROPERTY_LATIN_CAPITAL_BOTTOM }
     { AF_BLUE_STRING_COPTIC_SMALL_TOP,      AF_BLUE_PROPERTY_LATIN_TOP      |
-                                            AF_BLUE_PROPERTY_LATIN_X_HEIGHT   }
-    { AF_BLUE_STRING_COPTIC_SMALL_BOTTOM,   0                                 }
-    { AF_BLUE_STRING_MAX,                   0                                 }
+                                            AF_BLUE_PROPERTY_LATIN_X_HEIGHT       }
+    { AF_BLUE_STRING_COPTIC_SMALL_BOTTOM,   AF_BLUE_PROPERTY_LATIN_SMALL_BOTTOM   }
+    { AF_BLUE_STRING_MAX,                   0                                     }
 
   AF_BLUE_STRINGSET_CPRT
     { AF_BLUE_STRING_CYPRIOT_TOP,    AF_BLUE_PROPERTY_LATIN_TOP }
@@ -796,13 +796,13 @@ AF_BLUE_STRINGSET_ENUM AF_BLUE_STRINGSETS_ARRAY AF_BLUE_STRINGSET_MAX_LEN:
     { AF_BLUE_STRING_MAX,            0                          }
 
   AF_BLUE_STRINGSET_CYRL
-    { AF_BLUE_STRING_CYRILLIC_CAPITAL_TOP,     AF_BLUE_PROPERTY_LATIN_TOP        }
-    { AF_BLUE_STRING_CYRILLIC_CAPITAL_BOTTOM,  0                                 }
+    { AF_BLUE_STRING_CYRILLIC_CAPITAL_TOP,     AF_BLUE_PROPERTY_LATIN_TOP            }
+    { AF_BLUE_STRING_CYRILLIC_CAPITAL_BOTTOM,  AF_BLUE_PROPERTY_LATIN_CAPITAL_BOTTOM }
     { AF_BLUE_STRING_CYRILLIC_SMALL,           AF_BLUE_PROPERTY_LATIN_TOP      |
-                                               AF_BLUE_PROPERTY_LATIN_X_HEIGHT   }
-    { AF_BLUE_STRING_CYRILLIC_SMALL,           0                                 }
-    { AF_BLUE_STRING_CYRILLIC_SMALL_DESCENDER, 0                                 }
-    { AF_BLUE_STRING_MAX,                      0                                 }
+                                               AF_BLUE_PROPERTY_LATIN_X_HEIGHT       }
+    { AF_BLUE_STRING_CYRILLIC_SMALL,           0                                     }
+    { AF_BLUE_STRING_CYRILLIC_SMALL_DESCENDER, 0                                     }
+    { AF_BLUE_STRING_MAX,                      0                                     }
 
   AF_BLUE_STRINGSET_DEVA
     { AF_BLUE_STRING_DEVANAGARI_TOP,    AF_BLUE_PROPERTY_LATIN_TOP        }
@@ -815,12 +815,12 @@ AF_BLUE_STRINGSET_ENUM AF_BLUE_STRINGSETS_ARRAY AF_BLUE_STRINGSET_MAX_LEN:
     { AF_BLUE_STRING_MAX,               0                                 }
 
   AF_BLUE_STRINGSET_DSRT
-    { AF_BLUE_STRING_DESERET_CAPITAL_TOP,    AF_BLUE_PROPERTY_LATIN_TOP        }
-    { AF_BLUE_STRING_DESERET_CAPITAL_BOTTOM, 0                                 }
+    { AF_BLUE_STRING_DESERET_CAPITAL_TOP,    AF_BLUE_PROPERTY_LATIN_TOP            }
+    { AF_BLUE_STRING_DESERET_CAPITAL_BOTTOM, AF_BLUE_PROPERTY_LATIN_CAPITAL_BOTTOM }
     { AF_BLUE_STRING_DESERET_SMALL_TOP,      AF_BLUE_PROPERTY_LATIN_TOP      |
-                                             AF_BLUE_PROPERTY_LATIN_X_HEIGHT   }
-    { AF_BLUE_STRING_DESERET_SMALL_BOTTOM,   0                                 }
-    { AF_BLUE_STRING_MAX,                    0                                 }
+                                             AF_BLUE_PROPERTY_LATIN_X_HEIGHT       }
+    { AF_BLUE_STRING_DESERET_SMALL_BOTTOM,   AF_BLUE_PROPERTY_LATIN_SMALL_BOTTOM   }
+    { AF_BLUE_STRING_MAX,                    0                                     }
 
   AF_BLUE_STRINGSET_ETHI
     { AF_BLUE_STRING_ETHIOPIC_TOP,    AF_BLUE_PROPERTY_LATIN_TOP }
@@ -848,12 +848,12 @@ AF_BLUE_STRINGSET_ENUM AF_BLUE_STRINGSETS_ARRAY AF_BLUE_STRINGSET_MAX_LEN:
     { AF_BLUE_STRING_MAX,                         0                                 }
 
   AF_BLUE_STRINGSET_GLAG
-    { AF_BLUE_STRING_GLAGOLITIC_CAPITAL_TOP,    AF_BLUE_PROPERTY_LATIN_TOP        }
-    { AF_BLUE_STRING_GLAGOLITIC_CAPITAL_BOTTOM, 0                                 }
+    { AF_BLUE_STRING_GLAGOLITIC_CAPITAL_TOP,    AF_BLUE_PROPERTY_LATIN_TOP            }
+    { AF_BLUE_STRING_GLAGOLITIC_CAPITAL_BOTTOM, AF_BLUE_PROPERTY_LATIN_CAPITAL_BOTTOM }
     { AF_BLUE_STRING_GLAGOLITIC_SMALL_TOP,      AF_BLUE_PROPERTY_LATIN_TOP      |
-                                                AF_BLUE_PROPERTY_LATIN_X_HEIGHT   }
-    { AF_BLUE_STRING_GLAGOLITIC_SMALL_BOTTOM,   0                                 }
-    { AF_BLUE_STRING_MAX,                       0                                 }
+                                                AF_BLUE_PROPERTY_LATIN_X_HEIGHT       }
+    { AF_BLUE_STRING_GLAGOLITIC_SMALL_BOTTOM,   AF_BLUE_PROPERTY_LATIN_SMALL_BOTTOM   }
+    { AF_BLUE_STRING_MAX,                       0                                     }
 
   AF_BLUE_STRINGSET_GOTH
     { AF_BLUE_STRING_GOTHIC_TOP,    AF_BLUE_PROPERTY_LATIN_TOP }
@@ -861,14 +861,14 @@ AF_BLUE_STRINGSET_ENUM AF_BLUE_STRINGSETS_ARRAY AF_BLUE_STRINGSET_MAX_LEN:
     { AF_BLUE_STRING_MAX,           0                          }
 
   AF_BLUE_STRINGSET_GREK
-    { AF_BLUE_STRING_GREEK_CAPITAL_TOP,     AF_BLUE_PROPERTY_LATIN_TOP        }
-    { AF_BLUE_STRING_GREEK_CAPITAL_BOTTOM,  0                                 }
-    { AF_BLUE_STRING_GREEK_SMALL_BETA_TOP,  AF_BLUE_PROPERTY_LATIN_TOP        }
+    { AF_BLUE_STRING_GREEK_CAPITAL_TOP,     AF_BLUE_PROPERTY_LATIN_TOP            }
+    { AF_BLUE_STRING_GREEK_CAPITAL_BOTTOM,  AF_BLUE_PROPERTY_LATIN_CAPITAL_BOTTOM }
+    { AF_BLUE_STRING_GREEK_SMALL_BETA_TOP,  AF_BLUE_PROPERTY_LATIN_TOP            }
     { AF_BLUE_STRING_GREEK_SMALL,           AF_BLUE_PROPERTY_LATIN_TOP      |
-                                            AF_BLUE_PROPERTY_LATIN_X_HEIGHT   }
-    { AF_BLUE_STRING_GREEK_SMALL,           0                                 }
-    { AF_BLUE_STRING_GREEK_SMALL_DESCENDER, 0                                 }
-    { AF_BLUE_STRING_MAX,                   0                                 }
+                                            AF_BLUE_PROPERTY_LATIN_X_HEIGHT       }
+    { AF_BLUE_STRING_GREEK_SMALL,           0                                     }
+    { AF_BLUE_STRING_GREEK_SMALL_DESCENDER, 0                                     }
+    { AF_BLUE_STRING_MAX,                   0                                     }
 
   AF_BLUE_STRINGSET_GUJR
     { AF_BLUE_STRING_GUJARATI_TOP,       AF_BLUE_PROPERTY_LATIN_TOP      |
@@ -935,34 +935,34 @@ AF_BLUE_STRINGSET_ENUM AF_BLUE_STRINGSETS_ARRAY AF_BLUE_STRINGSET_MAX_LEN:
     { AF_BLUE_STRING_MAX,                0                                 }
 
   AF_BLUE_STRINGSET_LATN
-    { AF_BLUE_STRING_LATIN_CAPITAL_TOP,     AF_BLUE_PROPERTY_LATIN_TOP        }
-    { AF_BLUE_STRING_LATIN_CAPITAL_BOTTOM,  0                                 }
-    { AF_BLUE_STRING_LATIN_SMALL_F_TOP,     AF_BLUE_PROPERTY_LATIN_TOP        }
+    { AF_BLUE_STRING_LATIN_CAPITAL_TOP,     AF_BLUE_PROPERTY_LATIN_TOP            }
+    { AF_BLUE_STRING_LATIN_CAPITAL_BOTTOM,  AF_BLUE_PROPERTY_LATIN_CAPITAL_BOTTOM }
+    { AF_BLUE_STRING_LATIN_SMALL_F_TOP,     AF_BLUE_PROPERTY_LATIN_TOP            }
     { AF_BLUE_STRING_LATIN_SMALL_TOP,       AF_BLUE_PROPERTY_LATIN_TOP      |
-                                            AF_BLUE_PROPERTY_LATIN_X_HEIGHT   }
-    { AF_BLUE_STRING_LATIN_SMALL_BOTTOM,    0                                 }
-    { AF_BLUE_STRING_LATIN_SMALL_DESCENDER, 0                                 }
-    { AF_BLUE_STRING_MAX,                   0                                 }
+                                            AF_BLUE_PROPERTY_LATIN_X_HEIGHT       }
+    { AF_BLUE_STRING_LATIN_SMALL_BOTTOM,    AF_BLUE_PROPERTY_LATIN_SMALL_BOTTOM   }
+    { AF_BLUE_STRING_LATIN_SMALL_DESCENDER, 0                                     }
+    { AF_BLUE_STRING_MAX,                   0                                     }
 
   AF_BLUE_STRINGSET_LATB
-    { AF_BLUE_STRING_LATIN_SUBS_CAPITAL_TOP,     AF_BLUE_PROPERTY_LATIN_TOP        }
-    { AF_BLUE_STRING_LATIN_SUBS_CAPITAL_BOTTOM,  0                                 }
-    { AF_BLUE_STRING_LATIN_SUBS_SMALL_F_TOP,     AF_BLUE_PROPERTY_LATIN_TOP        }
+    { AF_BLUE_STRING_LATIN_SUBS_CAPITAL_TOP,     AF_BLUE_PROPERTY_LATIN_TOP            }
+    { AF_BLUE_STRING_LATIN_SUBS_CAPITAL_BOTTOM,  AF_BLUE_PROPERTY_LATIN_CAPITAL_BOTTOM }
+    { AF_BLUE_STRING_LATIN_SUBS_SMALL_F_TOP,     AF_BLUE_PROPERTY_LATIN_TOP            }
     { AF_BLUE_STRING_LATIN_SUBS_SMALL,           AF_BLUE_PROPERTY_LATIN_TOP      |
-                                                 AF_BLUE_PROPERTY_LATIN_X_HEIGHT   }
-    { AF_BLUE_STRING_LATIN_SUBS_SMALL,           0                                 }
-    { AF_BLUE_STRING_LATIN_SUBS_SMALL_DESCENDER, 0                                 }
-    { AF_BLUE_STRING_MAX,                        0                                 }
+                                                 AF_BLUE_PROPERTY_LATIN_X_HEIGHT       }
+    { AF_BLUE_STRING_LATIN_SUBS_SMALL,           0                                     }
+    { AF_BLUE_STRING_LATIN_SUBS_SMALL_DESCENDER, 0                                     }
+    { AF_BLUE_STRING_MAX,                        0                                     }
 
   AF_BLUE_STRINGSET_LATP
-    { AF_BLUE_STRING_LATIN_SUPS_CAPITAL_TOP,     AF_BLUE_PROPERTY_LATIN_TOP        }
-    { AF_BLUE_STRING_LATIN_SUPS_CAPITAL_BOTTOM,  0                                 }
-    { AF_BLUE_STRING_LATIN_SUPS_SMALL_F_TOP,     AF_BLUE_PROPERTY_LATIN_TOP        }
+    { AF_BLUE_STRING_LATIN_SUPS_CAPITAL_TOP,     AF_BLUE_PROPERTY_LATIN_TOP            }
+    { AF_BLUE_STRING_LATIN_SUPS_CAPITAL_BOTTOM,  AF_BLUE_PROPERTY_LATIN_CAPITAL_BOTTOM }
+    { AF_BLUE_STRING_LATIN_SUPS_SMALL_F_TOP,     AF_BLUE_PROPERTY_LATIN_TOP            }
     { AF_BLUE_STRING_LATIN_SUPS_SMALL,           AF_BLUE_PROPERTY_LATIN_TOP      |
-                                                 AF_BLUE_PROPERTY_LATIN_X_HEIGHT   }
-    { AF_BLUE_STRING_LATIN_SUPS_SMALL,           0                                 }
-    { AF_BLUE_STRING_LATIN_SUPS_SMALL_DESCENDER, 0                                 }
-    { AF_BLUE_STRING_MAX,                        0                                 }
+                                                 AF_BLUE_PROPERTY_LATIN_X_HEIGHT       }
+    { AF_BLUE_STRING_LATIN_SUPS_SMALL,           0                                     }
+    { AF_BLUE_STRING_LATIN_SUPS_SMALL_DESCENDER, 0                                     }
+    { AF_BLUE_STRING_MAX,                        0                                     }
 
   AF_BLUE_STRINGSET_LISU
     { AF_BLUE_STRING_LISU_TOP,    AF_BLUE_PROPERTY_LATIN_TOP }
@@ -975,15 +975,15 @@ AF_BLUE_STRINGSET_ENUM AF_BLUE_STRINGSETS_ARRAY AF_BLUE_STRINGSET_MAX_LEN:
     { AF_BLUE_STRING_MAX,              0                          }
 
   AF_BLUE_STRINGSET_MEDF
-    { AF_BLUE_STRING_MEDEFAIDRIN_CAPITAL_TOP,     AF_BLUE_PROPERTY_LATIN_TOP        }
-    { AF_BLUE_STRING_MEDEFAIDRIN_CAPITAL_BOTTOM,  0                                 }
-    { AF_BLUE_STRING_MEDEFAIDRIN_SMALL_F_TOP,     AF_BLUE_PROPERTY_LATIN_TOP        }
+    { AF_BLUE_STRING_MEDEFAIDRIN_CAPITAL_TOP,     AF_BLUE_PROPERTY_LATIN_TOP            }
+    { AF_BLUE_STRING_MEDEFAIDRIN_CAPITAL_BOTTOM,  AF_BLUE_PROPERTY_LATIN_CAPITAL_BOTTOM }
+    { AF_BLUE_STRING_MEDEFAIDRIN_SMALL_F_TOP,     AF_BLUE_PROPERTY_LATIN_TOP            }
     { AF_BLUE_STRING_MEDEFAIDRIN_SMALL_TOP,       AF_BLUE_PROPERTY_LATIN_TOP      |
-                                                  AF_BLUE_PROPERTY_LATIN_X_HEIGHT   }
-    { AF_BLUE_STRING_MEDEFAIDRIN_SMALL_BOTTOM,    0                                 }
-    { AF_BLUE_STRING_MEDEFAIDRIN_SMALL_DESCENDER, 0                                 }
-    { AF_BLUE_STRING_MEDEFAIDRIN_DIGIT_TOP,       AF_BLUE_PROPERTY_LATIN_TOP        }
-    { AF_BLUE_STRING_MAX,                         0                                 }
+                                                  AF_BLUE_PROPERTY_LATIN_X_HEIGHT       }
+    { AF_BLUE_STRING_MEDEFAIDRIN_SMALL_BOTTOM,    AF_BLUE_PROPERTY_LATIN_SMALL_BOTTOM   }
+    { AF_BLUE_STRING_MEDEFAIDRIN_SMALL_DESCENDER, 0                                     }
+    { AF_BLUE_STRING_MEDEFAIDRIN_DIGIT_TOP,       AF_BLUE_PROPERTY_LATIN_TOP            }
+    { AF_BLUE_STRING_MAX,                         0                                     }
 
   AF_BLUE_STRINGSET_MONG
     { AF_BLUE_STRING_MONGOLIAN_TOP_BASE,    AF_BLUE_PROPERTY_LATIN_TOP }
@@ -999,12 +999,12 @@ AF_BLUE_STRINGSET_ENUM AF_BLUE_STRINGSETS_ARRAY AF_BLUE_STRINGSET_MAX_LEN:
     { AF_BLUE_STRING_MAX,               0                                 }
 
   AF_BLUE_STRINGSET_NKOO
-    { AF_BLUE_STRING_NKO_TOP,          AF_BLUE_PROPERTY_LATIN_TOP        }
-    { AF_BLUE_STRING_NKO_BOTTOM,       0                                 }
+    { AF_BLUE_STRING_NKO_TOP,          AF_BLUE_PROPERTY_LATIN_TOP          }
+    { AF_BLUE_STRING_NKO_BOTTOM,       0                                   }
     { AF_BLUE_STRING_NKO_SMALL_TOP,    AF_BLUE_PROPERTY_LATIN_TOP      |
-                                       AF_BLUE_PROPERTY_LATIN_X_HEIGHT   }
-    { AF_BLUE_STRING_NKO_SMALL_BOTTOM, 0                                 }
-    { AF_BLUE_STRING_MAX,              0                                 }
+                                       AF_BLUE_PROPERTY_LATIN_X_HEIGHT     }
+    { AF_BLUE_STRING_NKO_SMALL_BOTTOM, AF_BLUE_PROPERTY_LATIN_SMALL_BOTTOM }
+    { AF_BLUE_STRING_MAX,              0                                   }
 
   AF_BLUE_STRINGSET_NONE
     { AF_BLUE_STRING_MAX, 0 }
@@ -1020,15 +1020,15 @@ AF_BLUE_STRINGSET_ENUM AF_BLUE_STRINGSETS_ARRAY AF_BLUE_STRINGSET_MAX_LEN:
     { AF_BLUE_STRING_MAX,               0                          }
 
   AF_BLUE_STRINGSET_OSGE
-    { AF_BLUE_STRING_OSAGE_CAPITAL_TOP,       AF_BLUE_PROPERTY_LATIN_TOP       }
-    { AF_BLUE_STRING_OSAGE_CAPITAL_BOTTOM,    0                                }
-    { AF_BLUE_STRING_OSAGE_CAPITAL_DESCENDER, 0                                }
-    { AF_BLUE_STRING_OSAGE_SMALL_TOP,         AF_BLUE_PROPERTY_LATIN_TOP     |
-                                              AF_BLUE_PROPERTY_LATIN_X_HEIGHT  }
-    { AF_BLUE_STRING_OSAGE_SMALL_BOTTOM,      0                                }
-    { AF_BLUE_STRING_OSAGE_SMALL_ASCENDER,    AF_BLUE_PROPERTY_LATIN_TOP       }
-    { AF_BLUE_STRING_OSAGE_SMALL_DESCENDER,   0                                }
-    { AF_BLUE_STRING_MAX,                     0                                }
+    { AF_BLUE_STRING_OSAGE_CAPITAL_TOP,       AF_BLUE_PROPERTY_LATIN_TOP            }
+    { AF_BLUE_STRING_OSAGE_CAPITAL_BOTTOM,    AF_BLUE_PROPERTY_LATIN_CAPITAL_BOTTOM }
+    { AF_BLUE_STRING_OSAGE_CAPITAL_DESCENDER, 0                                     }
+    { AF_BLUE_STRING_OSAGE_SMALL_TOP,         AF_BLUE_PROPERTY_LATIN_TOP      |
+                                              AF_BLUE_PROPERTY_LATIN_X_HEIGHT       }
+    { AF_BLUE_STRING_OSAGE_SMALL_BOTTOM,      AF_BLUE_PROPERTY_LATIN_SMALL_BOTTOM   }
+    { AF_BLUE_STRING_OSAGE_SMALL_ASCENDER,    AF_BLUE_PROPERTY_LATIN_TOP            }
+    { AF_BLUE_STRING_OSAGE_SMALL_DESCENDER,   0                                     }
+    { AF_BLUE_STRING_MAX,                     0                                     }
 
   AF_BLUE_STRINGSET_OSMA
     { AF_BLUE_STRING_OSMANYA_TOP,    AF_BLUE_PROPERTY_LATIN_TOP }
@@ -1047,13 +1047,13 @@ AF_BLUE_STRINGSET_ENUM AF_BLUE_STRINGSETS_ARRAY AF_BLUE_STRINGSET_MAX_LEN:
     { AF_BLUE_STRING_MAX,               0                          }
 
   AF_BLUE_STRINGSET_SHAW
-    { AF_BLUE_STRING_SHAVIAN_TOP,          AF_BLUE_PROPERTY_LATIN_TOP        }
-    { AF_BLUE_STRING_SHAVIAN_BOTTOM,       0                                 }
-    { AF_BLUE_STRING_SHAVIAN_DESCENDER,    0                                 }
+    { AF_BLUE_STRING_SHAVIAN_TOP,          AF_BLUE_PROPERTY_LATIN_TOP          }
+    { AF_BLUE_STRING_SHAVIAN_BOTTOM,       0                                   }
+    { AF_BLUE_STRING_SHAVIAN_DESCENDER,    0                                   }
     { AF_BLUE_STRING_SHAVIAN_SMALL_TOP,    AF_BLUE_PROPERTY_LATIN_TOP      |
-                                           AF_BLUE_PROPERTY_LATIN_X_HEIGHT   }
-    { AF_BLUE_STRING_SHAVIAN_SMALL_BOTTOM, 0                                 }
-    { AF_BLUE_STRING_MAX,                  0                                 }
+                                           AF_BLUE_PROPERTY_LATIN_X_HEIGHT     }
+    { AF_BLUE_STRING_SHAVIAN_SMALL_BOTTOM, AF_BLUE_PROPERTY_LATIN_SMALL_BOTTOM }
+    { AF_BLUE_STRING_MAX,                  0                                   }
 
   AF_BLUE_STRINGSET_SINH
     { AF_BLUE_STRING_SINHALA_TOP,       AF_BLUE_PROPERTY_LATIN_TOP }
diff --git a/src/java.desktop/share/native/libfreetype/src/autofit/afblue.h b/src/java.desktop/share/native/libfreetype/src/autofit/afblue.h
index 2aa9d0984ef..5bb8406dc2b 100644
--- a/src/java.desktop/share/native/libfreetype/src/autofit/afblue.h
+++ b/src/java.desktop/share/native/libfreetype/src/autofit/afblue.h
@@ -7,7 +7,7 @@
  *
  *   Auto-fitter data for blue strings (specification).
  *
- * Copyright (C) 2013-2024 by
+ * Copyright (C) 2013-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
@@ -314,14 +314,17 @@ FT_BEGIN_HEADER
   /* Properties are specific to a writing system.  We assume that a given  */
   /* blue string can't be used in more than a single writing system, which */
   /* is a safe bet.                                                        */
-#define AF_BLUE_PROPERTY_LATIN_TOP       ( 1U << 0 )  /* must have value 1 */
+#define AF_BLUE_PROPERTY_LATIN_TOP       ( 1U << 0 )    /* must be value 1 */
 #define AF_BLUE_PROPERTY_LATIN_SUB_TOP   ( 1U << 1 )
 #define AF_BLUE_PROPERTY_LATIN_NEUTRAL   ( 1U << 2 )
 #define AF_BLUE_PROPERTY_LATIN_X_HEIGHT  ( 1U << 3 )
 #define AF_BLUE_PROPERTY_LATIN_LONG      ( 1U << 4 )
 
-#define AF_BLUE_PROPERTY_CJK_TOP    ( 1U << 0 )       /* must have value 1 */
-#define AF_BLUE_PROPERTY_CJK_HORIZ  ( 1U << 1 )       /* must have value 2 */
+#define AF_BLUE_PROPERTY_LATIN_CAPITAL_BOTTOM  ( 1U << 5 )
+#define AF_BLUE_PROPERTY_LATIN_SMALL_BOTTOM    ( 1U << 6 )
+
+#define AF_BLUE_PROPERTY_CJK_TOP    ( 1U << 0 )         /* must be value 1 */
+#define AF_BLUE_PROPERTY_CJK_HORIZ  ( 1U << 1 )         /* must be value 2 */
 #define AF_BLUE_PROPERTY_CJK_RIGHT  AF_BLUE_PROPERTY_CJK_TOP
 
 
diff --git a/src/java.desktop/share/native/libfreetype/src/autofit/afblue.hin b/src/java.desktop/share/native/libfreetype/src/autofit/afblue.hin
index 38031505a85..dbac14548d5 100644
--- a/src/java.desktop/share/native/libfreetype/src/autofit/afblue.hin
+++ b/src/java.desktop/share/native/libfreetype/src/autofit/afblue.hin
@@ -4,7 +4,7 @@
  *
  *   Auto-fitter data for blue strings (specification).
  *
- * Copyright (C) 2013-2024 by
+ * Copyright (C) 2013-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
@@ -99,14 +99,17 @@ FT_BEGIN_HEADER
   /* Properties are specific to a writing system.  We assume that a given  */
   /* blue string can't be used in more than a single writing system, which */
   /* is a safe bet.                                                        */
-#define AF_BLUE_PROPERTY_LATIN_TOP       ( 1U << 0 )  /* must have value 1 */
+#define AF_BLUE_PROPERTY_LATIN_TOP       ( 1U << 0 )    /* must be value 1 */
 #define AF_BLUE_PROPERTY_LATIN_SUB_TOP   ( 1U << 1 )
 #define AF_BLUE_PROPERTY_LATIN_NEUTRAL   ( 1U << 2 )
 #define AF_BLUE_PROPERTY_LATIN_X_HEIGHT  ( 1U << 3 )
 #define AF_BLUE_PROPERTY_LATIN_LONG      ( 1U << 4 )
 
-#define AF_BLUE_PROPERTY_CJK_TOP    ( 1U << 0 )       /* must have value 1 */
-#define AF_BLUE_PROPERTY_CJK_HORIZ  ( 1U << 1 )       /* must have value 2 */
+#define AF_BLUE_PROPERTY_LATIN_CAPITAL_BOTTOM  ( 1U << 5 )
+#define AF_BLUE_PROPERTY_LATIN_SMALL_BOTTOM    ( 1U << 6 )
+
+#define AF_BLUE_PROPERTY_CJK_TOP    ( 1U << 0 )         /* must be value 1 */
+#define AF_BLUE_PROPERTY_CJK_HORIZ  ( 1U << 1 )         /* must be value 2 */
 #define AF_BLUE_PROPERTY_CJK_RIGHT  AF_BLUE_PROPERTY_CJK_TOP
 
 
diff --git a/src/java.desktop/share/native/libfreetype/src/autofit/afcjk.c b/src/java.desktop/share/native/libfreetype/src/autofit/afcjk.c
index 869b60487c2..7086601838c 100644
--- a/src/java.desktop/share/native/libfreetype/src/autofit/afcjk.c
+++ b/src/java.desktop/share/native/libfreetype/src/autofit/afcjk.c
@@ -4,7 +4,7 @@
  *
  *   Auto-fitter hinting routines for CJK writing system (body).
  *
- * Copyright (C) 2006-2024 by
+ * Copyright (C) 2006-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
@@ -90,12 +90,8 @@
 
       /* If HarfBuzz is not available, we need a pointer to a single */
       /* unsigned long value.                                        */
-#ifdef FT_CONFIG_OPTION_USE_HARFBUZZ
-      void*     shaper_buf;
-#else
       FT_ULong  shaper_buf_;
       void*     shaper_buf = &shaper_buf_;
-#endif
 
       const char*  p;
 
@@ -105,9 +101,8 @@
 
       p = script_class->standard_charstring;
 
-#ifdef FT_CONFIG_OPTION_USE_HARFBUZZ
-      shaper_buf = af_shaper_buf_create( face );
-#endif
+      if ( ft_hb_enabled( metrics->root.globals ) )
+        shaper_buf = af_shaper_buf_create( metrics->root.globals );
 
       /* We check a list of standard characters.  The first match wins. */
 
@@ -144,7 +139,7 @@
           break;
       }
 
-      af_shaper_buf_destroy( face, shaper_buf );
+      af_shaper_buf_destroy( metrics->root.globals, shaper_buf );
 
       if ( !glyph_index )
         goto Exit;
@@ -152,7 +147,7 @@
       if ( !glyph_index )
         goto Exit;
 
-      FT_TRACE5(( "standard character: U+%04lX (glyph index %ld)\n",
+      FT_TRACE5(( "standard character: U+%04lX (glyph index %lu)\n",
                   ch, glyph_index ));
 
       error = FT_Load_Glyph( face, glyph_index, FT_LOAD_NO_SCALE );
@@ -297,12 +292,8 @@
 
     /* If HarfBuzz is not available, we need a pointer to a single */
     /* unsigned long value.                                        */
-#ifdef FT_CONFIG_OPTION_USE_HARFBUZZ
-    void*     shaper_buf;
-#else
     FT_ULong  shaper_buf_;
     void*     shaper_buf = &shaper_buf_;
-#endif
 
 
     /* we walk over the blue character strings as specified in the   */
@@ -313,9 +304,8 @@
     FT_TRACE5(( "==========================\n" ));
     FT_TRACE5(( "\n" ));
 
-#ifdef FT_CONFIG_OPTION_USE_HARFBUZZ
-    shaper_buf = af_shaper_buf_create( face );
-#endif
+    if ( ft_hb_enabled( metrics->root.globals ) )
+      shaper_buf = af_shaper_buf_create( metrics->root.globals );
 
     for ( ; bs->string != AF_BLUE_STRING_MAX; bs++ )
     {
@@ -340,7 +330,7 @@
         };
 
 
-        FT_TRACE5(( "blue zone %d (%s):\n",
+        FT_TRACE5(( "blue zone %u (%s):\n",
                     axis->blue_count,
                     cjk_blue_name[AF_CJK_IS_HORIZ_BLUE( bs ) |
                                   AF_CJK_IS_TOP_BLUE( bs )   ] ));
@@ -553,7 +543,7 @@
 
     } /* end for loop */
 
-    af_shaper_buf_destroy( face, shaper_buf );
+    af_shaper_buf_destroy( metrics->root.globals, shaper_buf );
 
     FT_TRACE5(( "\n" ));
 
@@ -572,23 +562,20 @@
 
     /* If HarfBuzz is not available, we need a pointer to a single */
     /* unsigned long value.                                        */
-#ifdef FT_CONFIG_OPTION_USE_HARFBUZZ
-    void*     shaper_buf;
-#else
     FT_ULong  shaper_buf_;
     void*     shaper_buf = &shaper_buf_;
-#endif
 
     /* in all supported charmaps, digits have character codes 0x30-0x39 */
     const char   digits[] = "0 1 2 3 4 5 6 7 8 9";
     const char*  p;
 
+    FT_UNUSED( face );
+
 
     p = digits;
 
-#ifdef FT_CONFIG_OPTION_USE_HARFBUZZ
-    shaper_buf = af_shaper_buf_create( face );
-#endif
+    if ( ft_hb_enabled( metrics->root.globals ) )
+      shaper_buf = af_shaper_buf_create( metrics->root.globals );
 
     while ( *p )
     {
@@ -624,7 +611,7 @@
       }
     }
 
-    af_shaper_buf_destroy( face, shaper_buf );
+    af_shaper_buf_destroy( metrics->root.globals, shaper_buf );
 
     metrics->root.digits_have_same_width = same_width;
   }
@@ -710,7 +697,7 @@
         FT_Pos  delta1, delta2;
 
 
-        blue->ref.fit  = FT_PIX_ROUND( blue->ref.cur );
+        blue->ref.fit = FT_PIX_ROUND( blue->ref.cur );
 
         /* shoot is under shoot for cjk */
         delta1 = FT_DivFix( blue->ref.fit, scale ) - blue->shoot.org;
@@ -736,7 +723,7 @@
 
         blue->shoot.fit = blue->ref.fit - delta2;
 
-        FT_TRACE5(( ">> active cjk blue zone %c%d[%ld/%ld]:\n",
+        FT_TRACE5(( ">> active cjk blue zone %c%u[%ld/%ld]:\n",
                     ( dim == AF_DIMENSION_HORZ ) ? 'H' : 'V',
                     nn, blue->ref.org, blue->shoot.org ));
         FT_TRACE5(( "     ref:   cur=%.2f fit=%.2f\n",
@@ -1378,7 +1365,7 @@
   }
 
 
-  /* Initalize hinting engine. */
+  /* Initialize hinting engine. */
 
   FT_LOCAL_DEF( FT_Error )
   af_cjk_hints_init( AF_GlyphHints    hints,
@@ -2185,7 +2172,7 @@
   af_cjk_align_edge_points( AF_GlyphHints  hints,
                             AF_Dimension   dim )
   {
-    AF_AxisHints  axis       = & hints->axis[dim];
+    AF_AxisHints  axis       = &hints->axis[dim];
     AF_Edge       edges      = axis->edges;
     AF_Edge       edge_limit = FT_OFFSET( edges, axis->num_edges );
     AF_Edge       edge;
diff --git a/src/java.desktop/share/native/libfreetype/src/autofit/afcjk.h b/src/java.desktop/share/native/libfreetype/src/autofit/afcjk.h
index bc5aaf12e6e..bd1b39358e0 100644
--- a/src/java.desktop/share/native/libfreetype/src/autofit/afcjk.h
+++ b/src/java.desktop/share/native/libfreetype/src/autofit/afcjk.h
@@ -4,7 +4,7 @@
  *
  *   Auto-fitter hinting routines for CJK writing system (specification).
  *
- * Copyright (C) 2006-2024 by
+ * Copyright (C) 2006-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/autofit/afcover.h b/src/java.desktop/share/native/libfreetype/src/autofit/afcover.h
index 7980cf2e979..b93bcd1a2c5 100644
--- a/src/java.desktop/share/native/libfreetype/src/autofit/afcover.h
+++ b/src/java.desktop/share/native/libfreetype/src/autofit/afcover.h
@@ -4,7 +4,7 @@
  *
  *   Auto-fitter coverages (specification only).
  *
- * Copyright (C) 2013-2024 by
+ * Copyright (C) 2013-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/autofit/afdummy.c b/src/java.desktop/share/native/libfreetype/src/autofit/afdummy.c
index ad667d2edc7..8613544f913 100644
--- a/src/java.desktop/share/native/libfreetype/src/autofit/afdummy.c
+++ b/src/java.desktop/share/native/libfreetype/src/autofit/afdummy.c
@@ -5,7 +5,7 @@
  *   Auto-fitter dummy routines to be used if no hinting should be
  *   performed (body).
  *
- * Copyright (C) 2003-2024 by
+ * Copyright (C) 2003-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/autofit/afdummy.h b/src/java.desktop/share/native/libfreetype/src/autofit/afdummy.h
index 613c2f88a38..78a79439d95 100644
--- a/src/java.desktop/share/native/libfreetype/src/autofit/afdummy.h
+++ b/src/java.desktop/share/native/libfreetype/src/autofit/afdummy.h
@@ -5,7 +5,7 @@
  *   Auto-fitter dummy routines to be used if no hinting should be
  *   performed (specification).
  *
- * Copyright (C) 2003-2024 by
+ * Copyright (C) 2003-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/autofit/aferrors.h b/src/java.desktop/share/native/libfreetype/src/autofit/aferrors.h
index ae584ff06db..f3093fc90df 100644
--- a/src/java.desktop/share/native/libfreetype/src/autofit/aferrors.h
+++ b/src/java.desktop/share/native/libfreetype/src/autofit/aferrors.h
@@ -4,7 +4,7 @@
  *
  *   Autofitter error codes (specification only).
  *
- * Copyright (C) 2005-2024 by
+ * Copyright (C) 2005-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/autofit/afglobal.c b/src/java.desktop/share/native/libfreetype/src/autofit/afglobal.c
index b7403fa65e1..e74d8141161 100644
--- a/src/java.desktop/share/native/libfreetype/src/autofit/afglobal.c
+++ b/src/java.desktop/share/native/libfreetype/src/autofit/afglobal.c
@@ -4,7 +4,7 @@
  *
  *   Auto-fitter routines to compute global hinting values (body).
  *
- * Copyright (C) 2003-2024 by
+ * Copyright (C) 2003-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
@@ -22,6 +22,11 @@
 #include "afws-decl.h"
 #include <freetype/internal/ftdebug.h>
 
+#ifdef FT_CONFIG_OPTION_USE_HARFBUZZ
+#  include "afgsub.h"
+#  include "ft-hb-ft.h"
+#endif
+
 
   /**************************************************************************
    *
@@ -184,7 +189,7 @@
           if ( gindex != 0                                                &&
                gindex < globals->glyph_count                              &&
                ( gstyles[gindex] & AF_STYLE_MASK ) == AF_STYLE_UNASSIGNED )
-            gstyles[gindex] = ss;
+            gstyles[gindex] = ss | AF_HAS_CMAP_ENTRY;
 
           for (;;)
           {
@@ -195,7 +200,7 @@
 
             if ( gindex < globals->glyph_count                              &&
                  ( gstyles[gindex] & AF_STYLE_MASK ) == AF_STYLE_UNASSIGNED )
-              gstyles[gindex] = ss;
+              gstyles[gindex] = ss | AF_HAS_CMAP_ENTRY;
           }
         }
 
@@ -301,7 +306,7 @@
           if ( !( count % 10 ) )
             FT_TRACE4(( " " ));
 
-          FT_TRACE4(( " %d", idx ));
+          FT_TRACE4(( " %u", idx ));
           count++;
 
           if ( !( count % 10 ) )
@@ -356,8 +361,21 @@
     globals->scale_down_factor         = 0;
 
 #ifdef FT_CONFIG_OPTION_USE_HARFBUZZ
-    globals->hb_font = hb_ft_font_create_( face, NULL );
-    globals->hb_buf  = hb_buffer_create();
+    if ( ft_hb_enabled ( globals ) )
+    {
+      globals->hb_font = ft_hb_ft_font_create( globals );
+      globals->hb_buf  = hb( buffer_create )();
+
+      af_parse_gsub( globals );
+    }
+    else
+    {
+      globals->hb_font = NULL;
+      globals->hb_buf  = NULL;
+
+      globals->gsub                          = NULL;
+      globals->gsub_lookups_single_alternate = NULL;
+    }
 #endif
 
     error = af_face_globals_compute_style_coverage( globals );
@@ -405,8 +423,14 @@
       }
 
 #ifdef FT_CONFIG_OPTION_USE_HARFBUZZ
-      hb_font_destroy( globals->hb_font );
-      hb_buffer_destroy( globals->hb_buf );
+      if ( ft_hb_enabled ( globals ) )
+      {
+        hb( font_destroy )( globals->hb_font );
+        hb( buffer_destroy )( globals->hb_buf );
+
+        FT_FREE( globals->gsub );
+        FT_FREE( globals->gsub_lookups_single_alternate );
+      }
 #endif
 
       /* no need to free `globals->glyph_styles'; */
diff --git a/src/java.desktop/share/native/libfreetype/src/autofit/afglobal.h b/src/java.desktop/share/native/libfreetype/src/autofit/afglobal.h
index ddb54c89b27..362f56e290b 100644
--- a/src/java.desktop/share/native/libfreetype/src/autofit/afglobal.h
+++ b/src/java.desktop/share/native/libfreetype/src/autofit/afglobal.h
@@ -5,7 +5,7 @@
  *   Auto-fitter routines to compute global hinting values
  *   (specification).
  *
- * Copyright (C) 2003-2024 by
+ * Copyright (C) 2003-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
@@ -73,15 +73,17 @@ FT_BEGIN_HEADER
   /* default script for OpenType; ignored if HarfBuzz isn't used */
 #define AF_SCRIPT_DEFAULT    AF_SCRIPT_LATN
 
-  /* a bit mask for AF_DIGIT and AF_NONBASE */
-#define AF_STYLE_MASK        0x3FFF
+  /* a bit mask for AF_DIGIT, AF_NONBASE, and AF_HAS_CMAP_ENTRY */
+#define AF_STYLE_MASK        0x1FFF
   /* an uncovered glyph      */
 #define AF_STYLE_UNASSIGNED  AF_STYLE_MASK
 
-  /* if this flag is set, we have an ASCII digit   */
+  /* if this flag is set, we have an ASCII digit */
 #define AF_DIGIT             0x8000U
   /* if this flag is set, we have a non-base character */
 #define AF_NONBASE           0x4000U
+  /* if this flag is set, the glyph has a (direct) cmap entry */
+#define AF_HAS_CMAP_ENTRY    0x2000U
 
   /* `increase-x-height' property */
 #define AF_PROP_INCREASE_X_HEIGHT_MIN  6
@@ -111,6 +113,11 @@ FT_BEGIN_HEADER
 #ifdef FT_CONFIG_OPTION_USE_HARFBUZZ
     hb_font_t*       hb_font;
     hb_buffer_t*     hb_buf;           /* for feature comparison */
+
+    /* The GSUB table. */
+    FT_Byte*         gsub;
+    /* Lookup offsets, with only SingleSubst and AlternateSubst non-NULL. */
+    FT_UInt32*       gsub_lookups_single_alternate;
 #endif
 
     /* per-face auto-hinter properties */
diff --git a/src/java.desktop/share/native/libfreetype/src/autofit/afhints.c b/src/java.desktop/share/native/libfreetype/src/autofit/afhints.c
index 96ffe343aa4..11faa655f62 100644
--- a/src/java.desktop/share/native/libfreetype/src/autofit/afhints.c
+++ b/src/java.desktop/share/native/libfreetype/src/autofit/afhints.c
@@ -4,7 +4,7 @@
  *
  *   Auto-fitter hinting routines (body).
  *
- * Copyright (C) 2003-2024 by
+ * Copyright (C) 2003-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
@@ -840,6 +840,10 @@
 
     if ( hints->contours != hints->embedded.contours )
       FT_FREE( hints->contours );
+    if ( hints->contour_y_minima != hints->embedded.contour_y_minima )
+      FT_FREE( hints->contour_y_minima );
+    if ( hints->contour_y_maxima != hints->embedded.contour_y_maxima )
+      FT_FREE( hints->contour_y_maxima );
     hints->max_contours = 0;
     hints->num_contours = 0;
 
@@ -896,19 +900,30 @@
     {
       if ( !hints->contours )
       {
-        hints->contours     = hints->embedded.contours;
+        hints->contours         = hints->embedded.contours;
+        hints->contour_y_minima = hints->embedded.contour_y_minima;
+        hints->contour_y_maxima = hints->embedded.contour_y_maxima;
+
         hints->max_contours = AF_CONTOURS_EMBEDDED;
       }
     }
     else if ( new_max > old_max )
     {
       if ( hints->contours == hints->embedded.contours )
-        hints->contours = NULL;
+      {
+        hints->contours         = NULL;
+        hints->contour_y_minima = NULL;
+        hints->contour_y_maxima = NULL;
+      }
 
       new_max = ( new_max + 3 ) & ~3; /* round up to a multiple of 4 */
 
       if ( FT_RENEW_ARRAY( hints->contours, old_max, new_max ) )
         goto Exit;
+      if ( FT_RENEW_ARRAY( hints->contour_y_minima, old_max, new_max ) )
+        goto Exit;
+      if ( FT_RENEW_ARRAY( hints->contour_y_maxima, old_max, new_max ) )
+        goto Exit;
 
       hints->max_contours = new_max;
     }
@@ -1324,7 +1339,7 @@
   af_glyph_hints_align_edge_points( AF_GlyphHints  hints,
                                     AF_Dimension   dim )
   {
-    AF_AxisHints  axis          = & hints->axis[dim];
+    AF_AxisHints  axis          = &hints->axis[dim];
     AF_Segment    segments      = axis->segments;
     AF_Segment    segment_limit = FT_OFFSET( segments, axis->num_segments );
     AF_Segment    seg;
diff --git a/src/java.desktop/share/native/libfreetype/src/autofit/afhints.h b/src/java.desktop/share/native/libfreetype/src/autofit/afhints.h
index 76fe83006a5..46b3ed3366f 100644
--- a/src/java.desktop/share/native/libfreetype/src/autofit/afhints.h
+++ b/src/java.desktop/share/native/libfreetype/src/autofit/afhints.h
@@ -4,7 +4,7 @@
  *
  *   Auto-fitter hinting routines (specification).
  *
- * Copyright (C) 2003-2024 by
+ * Copyright (C) 2003-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
@@ -222,6 +222,9 @@ FT_BEGIN_HEADER
   /* the distance to the next point is very small */
 #define AF_FLAG_NEAR  ( 1U << 5 )
 
+  /* prevent the auto-hinter from adding such a point to a segment */
+#define AF_FLAG_IGNORE  ( 1U << 6 )
+
 
   /* edge hint flags */
 #define AF_EDGE_NORMAL  0
@@ -229,6 +232,7 @@ FT_BEGIN_HEADER
 #define AF_EDGE_SERIF    ( 1U << 1 )
 #define AF_EDGE_DONE     ( 1U << 2 )
 #define AF_EDGE_NEUTRAL  ( 1U << 3 ) /* edge aligns to a neutral blue zone */
+#define AF_EDGE_NO_BLUE  ( 1U << 4 ) /* do not align edge to blue zone     */
 
 
   typedef struct AF_PointRec_*    AF_Point;
@@ -303,6 +307,7 @@ FT_BEGIN_HEADER
 
   } AF_EdgeRec;
 
+
 #define AF_SEGMENTS_EMBEDDED  18   /* number of embedded segments   */
 #define AF_EDGES_EMBEDDED     12   /* number of embedded edges      */
 
@@ -346,9 +351,11 @@ FT_BEGIN_HEADER
     FT_Int           num_points;    /* number of used points      */
     AF_Point         points;        /* points array               */
 
-    FT_Int           max_contours;  /* number of allocated contours */
-    FT_Int           num_contours;  /* number of used contours      */
-    AF_Point*        contours;      /* contours array               */
+    FT_Int           max_contours;     /* number of allocated contours    */
+    FT_Int           num_contours;     /* number of used contours         */
+    AF_Point*        contours;         /* contours array                  */
+    FT_Pos*          contour_y_minima; /* array with y maxima of contours */
+    FT_Pos*          contour_y_maxima; /* array with y minima of contours */
 
     AF_AxisHintsRec  axis[AF_DIMENSION_MAX];
 
@@ -357,11 +364,13 @@ FT_BEGIN_HEADER
                                     /* implementations         */
     AF_StyleMetrics  metrics;
 
-    /* Two arrays to avoid allocation penalty.            */
+    /* Some arrays to avoid allocation penalty.           */
     /* The `embedded' structure must be the last element! */
     struct
     {
       AF_Point       contours[AF_CONTOURS_EMBEDDED];
+      FT_Pos         contour_y_minima[AF_CONTOURS_EMBEDDED];
+      FT_Pos         contour_y_maxima[AF_CONTOURS_EMBEDDED];
       AF_PointRec    points[AF_POINTS_EMBEDDED];
     } embedded;
 
diff --git a/src/java.desktop/share/native/libfreetype/src/autofit/afindic.c b/src/java.desktop/share/native/libfreetype/src/autofit/afindic.c
index c6d23efd86f..a2cd14f8817 100644
--- a/src/java.desktop/share/native/libfreetype/src/autofit/afindic.c
+++ b/src/java.desktop/share/native/libfreetype/src/autofit/afindic.c
@@ -4,7 +4,7 @@
  *
  *   Auto-fitter hinting routines for Indic writing system (body).
  *
- * Copyright (C) 2007-2024 by
+ * Copyright (C) 2007-2025 by
  * Rahul Bhalerao <rahul.bhalerao@redhat.com>, <b.rahul.pm@gmail.com>.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/autofit/afindic.h b/src/java.desktop/share/native/libfreetype/src/autofit/afindic.h
index a7f73f25153..a2e825e9f86 100644
--- a/src/java.desktop/share/native/libfreetype/src/autofit/afindic.h
+++ b/src/java.desktop/share/native/libfreetype/src/autofit/afindic.h
@@ -5,7 +5,7 @@
  *   Auto-fitter hinting routines for Indic writing system
  *   (specification).
  *
- * Copyright (C) 2007-2024 by
+ * Copyright (C) 2007-2025 by
  * Rahul Bhalerao <rahul.bhalerao@redhat.com>, <b.rahul.pm@gmail.com>.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/autofit/aflatin.c b/src/java.desktop/share/native/libfreetype/src/autofit/aflatin.c
index 89287f7ea5a..cb5667ff793 100644
--- a/src/java.desktop/share/native/libfreetype/src/autofit/aflatin.c
+++ b/src/java.desktop/share/native/libfreetype/src/autofit/aflatin.c
@@ -4,7 +4,7 @@
  *
  *   Auto-fitter hinting routines for latin writing system (body).
  *
- * Copyright (C) 2003-2024 by
+ * Copyright (C) 2003-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
@@ -22,6 +22,7 @@
 #include "afglobal.h"
 #include "aflatin.h"
 #include "aferrors.h"
+#include "afadjust.h"
 
 
   /**************************************************************************
@@ -81,12 +82,8 @@
 
       /* If HarfBuzz is not available, we need a pointer to a single */
       /* unsigned long value.                                        */
-#ifdef FT_CONFIG_OPTION_USE_HARFBUZZ
-      void*     shaper_buf;
-#else
       FT_ULong  shaper_buf_;
       void*     shaper_buf = &shaper_buf_;
-#endif
 
       const char*  p;
 
@@ -97,9 +94,9 @@
 
       p = script_class->standard_charstring;
 
-#ifdef FT_CONFIG_OPTION_USE_HARFBUZZ
-      shaper_buf = af_shaper_buf_create( face );
-#endif
+      if ( ft_hb_enabled ( metrics->root.globals ) )
+        shaper_buf = af_shaper_buf_create( metrics->root.globals );
+
       /*
        * We check a list of standard characters to catch features like
        * `c2sc' (small caps from caps) that don't contain lowercase letters
@@ -140,7 +137,7 @@
           break;
       }
 
-      af_shaper_buf_destroy( face, shaper_buf );
+      af_shaper_buf_destroy( metrics->root.globals, shaper_buf );
 
       if ( !glyph_index )
       {
@@ -149,7 +146,7 @@
         goto Exit;
       }
 
-      FT_TRACE5(( "standard character: U+%04lX (glyph index %ld)\n",
+      FT_TRACE5(( "standard character: U+%04lX (glyph index %lu)\n",
                   ch, glyph_index ));
 
       error = FT_Load_Glyph( face, glyph_index, FT_LOAD_NO_SCALE );
@@ -334,12 +331,8 @@
 
     /* If HarfBuzz is not available, we need a pointer to a single */
     /* unsigned long value.                                        */
-#ifdef FT_CONFIG_OPTION_USE_HARFBUZZ
-    void*     shaper_buf;
-#else
     FT_ULong  shaper_buf_;
     void*     shaper_buf = &shaper_buf_;
-#endif
 
 
     /* we walk over the blue character strings as specified in the */
@@ -349,9 +342,8 @@
     FT_TRACE5(( "============================\n" ));
     FT_TRACE5(( "\n" ));
 
-#ifdef FT_CONFIG_OPTION_USE_HARFBUZZ
-    shaper_buf = af_shaper_buf_create( face );
-#endif
+    if ( ft_hb_enabled ( metrics->root.globals ) )
+      shaper_buf = af_shaper_buf_create( metrics->root.globals );
 
     for ( ; bs->string != AF_BLUE_STRING_MAX; bs++ )
     {
@@ -367,7 +359,7 @@
         FT_Bool  have_flag = 0;
 
 
-        FT_TRACE5(( "blue zone %d", axis->blue_count ));
+        FT_TRACE5(( "blue zone %u", axis->blue_count ));
 
         if ( bs->properties )
         {
@@ -407,6 +399,20 @@
             FT_TRACE5(( "long" ));
           }
 
+          if ( AF_LATIN_IS_CAPITAL_BOTTOM_BLUE( bs ) )
+          {
+            if ( have_flag )
+              FT_TRACE5(( ", " ));
+            FT_TRACE5(( "capital bottom" ));
+          }
+
+          if ( AF_LATIN_IS_SMALL_BOTTOM_BLUE( bs ) )
+          {
+            if ( have_flag )
+              FT_TRACE5(( ", " ));
+            FT_TRACE5(( "small bottom" ));
+          }
+
           FT_TRACE5(( ")" ));
         }
 
@@ -454,9 +460,9 @@
         }
 
         if ( AF_LATIN_IS_TOP_BLUE( bs ) )
-          best_y_extremum = FT_INT_MIN;
+          best_y_extremum = FT_LONG_MIN;
         else
-          best_y_extremum = FT_INT_MAX;
+          best_y_extremum = FT_LONG_MAX;
 
         /* iterate over all glyph elements of the character cluster */
         /* and get the data of the `biggest' one                    */
@@ -487,7 +493,7 @@
             if ( num_idx == 1 )
               FT_TRACE5(( "  U+%04lX contains no (usable) outlines\n", ch ));
             else
-              FT_TRACE5(( "  component %d of cluster starting with U+%04lX"
+              FT_TRACE5(( "  component %u of cluster starting with U+%04lX"
                           " contains no (usable) outlines\n", i, ch ));
 #endif
             continue;
@@ -825,7 +831,7 @@
             if ( num_idx == 1 )
               FT_TRACE5(( "  U+%04lX: best_y = %5ld", ch, best_y ));
             else
-              FT_TRACE5(( "  component %d of cluster starting with U+%04lX:"
+              FT_TRACE5(( "  component %u of cluster starting with U+%04lX:"
                           " best_y = %5ld", i, ch, best_y ));
 #endif
 
@@ -879,8 +885,8 @@
 
         } /* end for loop */
 
-        if ( !( best_y_extremum == FT_INT_MIN ||
-                best_y_extremum == FT_INT_MAX ) )
+        if ( !( best_y_extremum == FT_LONG_MIN ||
+                best_y_extremum == FT_LONG_MAX ) )
         {
           if ( best_round )
             rounds[num_rounds++] = best_y_extremum;
@@ -959,6 +965,10 @@
         blue->flags |= AF_LATIN_BLUE_SUB_TOP;
       if ( AF_LATIN_IS_NEUTRAL_BLUE( bs ) )
         blue->flags |= AF_LATIN_BLUE_NEUTRAL;
+      if ( AF_LATIN_IS_CAPITAL_BOTTOM_BLUE( bs ) )
+        blue->flags |= AF_LATIN_BLUE_BOTTOM;
+      if ( AF_LATIN_IS_SMALL_BOTTOM_BLUE( bs ) )
+        blue->flags |= AF_LATIN_BLUE_BOTTOM_SMALL;
 
       /*
        * The following flag is used later to adjust the y and x scales
@@ -973,7 +983,7 @@
 
     } /* end for loop */
 
-    af_shaper_buf_destroy( face, shaper_buf );
+    af_shaper_buf_destroy( metrics->root.globals, shaper_buf );
 
     if ( axis->blue_count )
     {
@@ -1070,23 +1080,20 @@
 
     /* If HarfBuzz is not available, we need a pointer to a single */
     /* unsigned long value.                                        */
-#ifdef FT_CONFIG_OPTION_USE_HARFBUZZ
-    void*     shaper_buf;
-#else
     FT_ULong  shaper_buf_;
     void*     shaper_buf = &shaper_buf_;
-#endif
 
     /* in all supported charmaps, digits have character codes 0x30-0x39 */
     const char   digits[] = "0 1 2 3 4 5 6 7 8 9";
     const char*  p;
 
+    FT_UNUSED( face );
+
 
     p = digits;
 
-#ifdef FT_CONFIG_OPTION_USE_HARFBUZZ
-    shaper_buf = af_shaper_buf_create( face );
-#endif
+    if ( ft_hb_enabled ( metrics->root.globals ) )
+      shaper_buf = af_shaper_buf_create( metrics->root.globals );
 
     while ( *p )
     {
@@ -1122,7 +1129,7 @@
       }
     }
 
-    af_shaper_buf_destroy( face, shaper_buf );
+    af_shaper_buf_destroy( metrics->root.globals, shaper_buf );
 
     metrics->root.digits_have_same_width = same_width;
   }
@@ -1155,6 +1162,9 @@
       af_latin_metrics_check_digits( metrics, face );
     }
 
+    af_reverse_character_map_new( &metrics->root.reverse_charmap,
+                                  &metrics->root );
+
   Exit:
     face->charmap = oldmap;
     return error;
@@ -1263,7 +1273,7 @@
               max_height = FT_MAX( max_height, -Axis->blues[nn].descender );
             }
 
-            dist  = FT_MulFix( max_height, new_scale - scale );
+            dist = FT_MulFix( max_height, new_scale - scale );
 
             if ( -128 < dist && dist < 128 )
             {
@@ -1466,13 +1476,13 @@
         AF_LatinBlue  blue = &axis->blues[nn];
 
 
-        FT_TRACE5(( "  reference %d: %ld scaled to %.2f%s\n",
+        FT_TRACE5(( "  reference %u: %ld scaled to %.2f%s\n",
                     nn,
                     blue->ref.org,
                     (double)blue->ref.fit / 64,
                     ( blue->flags & AF_LATIN_BLUE_ACTIVE ) ? ""
                                                            : " (inactive)" ));
-        FT_TRACE5(( "  overshoot %d: %ld scaled to %.2f%s\n",
+        FT_TRACE5(( "  overshoot %u: %ld scaled to %.2f%s\n",
                     nn,
                     blue->shoot.org,
                     (double)blue->shoot.fit / 64,
@@ -1484,6 +1494,17 @@
   }
 
 
+  FT_CALLBACK_DEF( void )
+  af_latin_metrics_done( AF_StyleMetrics  metrics_ )
+  {
+    AF_LatinMetrics  metrics = (AF_LatinMetrics)metrics_;
+
+
+    af_reverse_character_map_done( metrics->root.reverse_charmap,
+                                   metrics->root.globals->face->memory );
+  }
+
+
   /* Scale global values in both directions. */
 
   FT_LOCAL_DEF( void )
@@ -1617,7 +1638,8 @@
       FT_Pos     prev_max_on_coord = max_on_coord;
 
 
-      if ( FT_ABS( last->out_dir )  == major_dir &&
+      if ( !( point->flags & AF_FLAG_IGNORE )    &&
+           FT_ABS( last->out_dir )  == major_dir &&
            FT_ABS( point->out_dir ) == major_dir )
       {
         /* we are already on an edge, try to locate its start */
@@ -1676,13 +1698,17 @@
               max_on_coord = v;
           }
 
-          if ( point->out_dir != segment_dir || point == last )
+          if ( point->flags & AF_FLAG_IGNORE ||
+               point->out_dir != segment_dir ||
+               point == last )
           {
             /* check whether the new segment's start point is identical to */
             /* the previous segment's end point; for example, this might   */
             /* happen for spikes                                           */
 
-            if ( !prev_segment || segment->first != prev_segment->last )
+            if ( point->flags & AF_FLAG_IGNORE        ||
+                 !prev_segment                        ||
+                 segment->first != prev_segment->last )
             {
               /* points are different: we are just leaving an edge, thus */
               /* record a new segment                                    */
@@ -1842,7 +1868,8 @@
         /* if we are not on an edge, check whether the major direction */
         /* coincides with the current point's `out' direction, or      */
         /* whether we have a single-point contour                      */
-        if ( !on_edge                                  &&
+        if ( !( point->flags & AF_FLAG_IGNORE )        &&
+             !on_edge                                  &&
              ( FT_ABS( point->out_dir ) == major_dir ||
                point == point->prev                  ) )
         {
@@ -2521,6 +2548,9 @@
       FT_Pos    best_dist;                 /* initial threshold */
 
 
+      if ( edge->flags & AF_EDGE_NO_BLUE )
+        continue;
+
       /* compute the initial threshold as a fraction of the EM size */
       /* (the value 40 is heuristic)                                */
       best_dist = FT_MulFix( metrics->units_per_em / 40, scale );
@@ -2610,7 +2640,7 @@
   }
 
 
-  /* Initalize hinting engine. */
+  /* Initialize hinting engine. */
 
   static FT_Error
   af_latin_hints_init( AF_GlyphHints    hints,
@@ -2737,6 +2767,1192 @@
   }
 
 
+#undef  FT_COMPONENT
+#define FT_COMPONENT  afadjust
+
+
+  static void
+  af_move_contour_vertically( AF_Point  contour,
+                              FT_Int    movement )
+  {
+    AF_Point  point       = contour;
+    AF_Point  first_point = point;
+
+
+    if ( point )
+    {
+      do
+      {
+        point->y += movement;
+        point     = point->next;
+
+      } while ( point != first_point );
+    }
+  }
+
+
+  /* Move all contours higher than `limit` by `delta`. */
+  static void
+  af_move_contours_up( AF_GlyphHints  hints,
+                       FT_Pos         limit,
+                       FT_Pos         delta )
+  {
+    FT_Int  contour;
+
+
+    for ( contour = 0; contour < hints->num_contours; contour++ )
+    {
+      FT_Pos  min_y = hints->contour_y_minima[contour];
+      FT_Pos  max_y = hints->contour_y_maxima[contour];
+
+
+      if ( min_y < max_y &&
+           min_y > limit )
+        af_move_contour_vertically( hints->contours[contour],
+                                    delta );
+    }
+  }
+
+
+  static void
+  af_move_contours_down( AF_GlyphHints  hints,
+                         FT_Pos         limit,
+                         FT_Pos         delta )
+  {
+    FT_Int  contour;
+
+
+    for ( contour = 0; contour < hints->num_contours; contour++ )
+    {
+      FT_Pos  min_y = hints->contour_y_minima[contour];
+      FT_Pos  max_y = hints->contour_y_maxima[contour];
+
+
+      if ( min_y < max_y &&
+           max_y < limit )
+        af_move_contour_vertically( hints->contours[contour],
+                                    -delta );
+    }
+  }
+
+
+  /* Compute vertical extrema of all contours and store them in the */
+  /* `contour_y_minima` and `contour_y_maxima` arrays of `hints`.   */
+  static void
+  af_compute_vertical_extrema( AF_GlyphHints  hints )
+  {
+    FT_Int  contour;
+
+
+    for ( contour = 0; contour < hints->num_contours; contour++ )
+    {
+      FT_Pos  min_y = FT_LONG_MAX;
+      FT_Pos  max_y = FT_LONG_MIN;
+
+      AF_Point  first_point = hints->contours[contour];
+      AF_Point  point       = first_point;
+
+
+      if ( !first_point || first_point->next->next == first_point )
+        goto End_loop;
+
+      do
+      {
+        if ( point->y < min_y )
+          min_y = point->y;
+        if ( point->y > max_y )
+          max_y = point->y;
+
+        point = point->next;
+
+      } while ( point != first_point );
+
+    End_loop:
+      hints->contour_y_minima[contour] = min_y;
+      hints->contour_y_maxima[contour] = max_y;
+    }
+  }
+
+
+  static FT_Int
+  af_find_highest_contour( AF_GlyphHints  hints )
+  {
+    FT_Int  highest_contour = 0;
+    FT_Pos  highest_min_y   = FT_LONG_MAX;
+    FT_Pos  highest_max_y   = FT_LONG_MIN;
+
+    FT_Int  contour;
+
+
+    /* At this point we have one 'lower' (usually the base glyph)   */
+    /* and one 'upper' object (usually the diacritic glyph).  If    */
+    /* there are more contours, they must be enclosed within either */
+    /* 'lower' or 'upper'.  To find this enclosing 'upper' contour  */
+    /* it is thus sufficient to search for the contour with the     */
+    /* highest y maximum value.                                     */
+    for ( contour = 0; contour < hints->num_contours; contour++ )
+    {
+      FT_Pos  current_min_y = hints->contour_y_minima[contour];
+      FT_Pos  current_max_y = hints->contour_y_maxima[contour];
+
+
+      /* If we have two contours with the same maximum value, take */
+      /* the one that has a smaller height.                        */
+      if ( current_max_y > highest_max_y      ||
+           ( current_max_y == highest_max_y &&
+             current_min_y > highest_min_y  ) )
+      {
+        highest_min_y   = current_min_y;
+        highest_max_y   = current_max_y;
+        highest_contour = contour;
+      }
+    }
+
+    return highest_contour;
+  }
+
+
+  static FT_Int
+  af_find_second_highest_contour( AF_GlyphHints  hints )
+  {
+    FT_Int  highest_contour;
+    FT_Pos  highest_min_y;
+
+    FT_Int  second_highest_contour = 0;
+    FT_Pos  second_highest_max_y   = FT_LONG_MIN;
+
+    FT_Int  contour;
+
+
+    if ( hints->num_contours < 3 )
+      return 0;
+
+    highest_contour = af_find_highest_contour( hints );
+    highest_min_y   = hints->contour_y_minima[highest_contour];
+
+    /* Search the contour with the largest vertical maximum that has a */
+    /* vertical minimum lower than the vertical minimum of the topmost */
+    /* contour.                                                        */
+    for ( contour = 0; contour < hints->num_contours; contour++ )
+    {
+      FT_Pos  current_min_y;
+      FT_Pos  current_max_y;
+
+
+      if ( contour == highest_contour )
+        continue;
+
+      current_min_y = hints->contour_y_minima[contour];
+      current_max_y = hints->contour_y_maxima[contour];
+
+      if ( current_max_y > second_highest_max_y &&
+           current_min_y < highest_min_y        )
+      {
+        second_highest_max_y   = current_max_y;
+        second_highest_contour = contour;
+      }
+    }
+
+    return second_highest_contour;
+  }
+
+
+  static FT_Int
+  af_find_lowest_contour( AF_GlyphHints  hints )
+  {
+    FT_Int  lowest_contour = 0;
+    FT_Pos  lowest_min_y   = FT_LONG_MAX;
+    FT_Pos  lowest_max_y   = FT_LONG_MIN;
+
+    FT_Int  contour;
+
+
+    for ( contour = 0; contour < hints->num_contours; contour++ )
+    {
+      FT_Pos  current_min_y = hints->contour_y_minima[contour];
+      FT_Pos  current_max_y = hints->contour_y_maxima[contour];
+
+
+      if ( current_min_y < lowest_min_y      ||
+           ( current_min_y == lowest_min_y &&
+             current_max_y < lowest_max_y  ) )
+      {
+        lowest_min_y   = current_min_y;
+        lowest_max_y   = current_max_y;
+        lowest_contour = contour;
+      }
+    }
+
+    return lowest_contour;
+  }
+
+
+  static FT_Int
+  af_find_second_lowest_contour( AF_GlyphHints  hints )
+  {
+    FT_Int  lowest_contour;
+    FT_Pos  lowest_max_y;
+
+    FT_Int  second_lowest_contour = 0;
+    FT_Pos  second_lowest_min_y   = FT_LONG_MAX;
+
+    FT_Int  contour;
+
+
+    if ( hints->num_contours < 3 )
+      return 0;
+
+    lowest_contour = af_find_lowest_contour( hints );
+    lowest_max_y   = hints->contour_y_maxima[lowest_contour];
+
+    for ( contour = 0; contour < hints->num_contours; contour++ )
+    {
+      FT_Pos  current_min_y;
+      FT_Pos  current_max_y;
+
+
+      if ( contour == lowest_contour )
+        continue;
+
+      current_min_y = hints->contour_y_minima[contour];
+      current_max_y = hints->contour_y_maxima[contour];
+
+      if ( current_min_y < second_lowest_min_y &&
+           current_max_y > lowest_max_y        )
+      {
+        second_lowest_min_y   = current_min_y;
+        second_lowest_contour = contour;
+      }
+    }
+
+    return second_lowest_contour;
+  }
+
+
+  /* While aligning edges to blue zones, make the auto-hinter */
+  /* ignore the ones that are higher than `pos`.              */
+  static void
+  af_prevent_top_blue_alignment( AF_GlyphHints  hints,
+                                 FT_Pos         pos )
+  {
+    AF_AxisHints  axis = &hints->axis[AF_DIMENSION_VERT];
+
+    AF_Edge  edges      = axis->edges;
+    AF_Edge  edge_limit = FT_OFFSET( edges, axis->num_edges );
+    AF_Edge  edge;
+
+
+    for ( edge = edges; edge < edge_limit; edge++ )
+      if ( edge->pos > pos )
+        edge->flags |= AF_EDGE_NO_BLUE;
+  }
+
+
+  static void
+  af_prevent_bottom_blue_alignment( AF_GlyphHints  hints,
+                                    FT_Pos         pos )
+  {
+    AF_AxisHints  axis = &hints->axis[AF_DIMENSION_VERT];
+
+    AF_Edge  edges      = axis->edges;
+    AF_Edge  edge_limit = FT_OFFSET( edges, axis->num_edges );
+    AF_Edge  edge;
+
+
+    for ( edge = edges; edge < edge_limit; edge++ )
+      if ( edge->pos < pos )
+        edge->flags |= AF_EDGE_NO_BLUE;
+  }
+
+
+  static void
+  af_latin_get_base_glyph_blues( AF_GlyphHints  hints,
+                                 FT_Bool        is_capital,
+                                 AF_LatinBlue*  top,
+                                 AF_LatinBlue*  bottom )
+  {
+    AF_LatinMetrics  metrics = (AF_LatinMetrics)hints->metrics;
+    AF_LatinAxis     axis    = &metrics->axis[AF_DIMENSION_VERT];
+
+    FT_UInt  top_flag;
+    FT_UInt  bottom_flag;
+
+    FT_UInt  i;
+
+
+    top_flag  = is_capital ? AF_LATIN_BLUE_TOP
+                           : AF_LATIN_BLUE_ADJUSTMENT;
+    top_flag |= AF_LATIN_BLUE_ACTIVE;
+
+    for ( i = 0; i < axis->blue_count; i++ )
+      if ( ( axis->blues[i].flags & top_flag ) == top_flag )
+        break;
+    if ( i < axis->blue_count )
+      *top = &axis->blues[i];
+
+    bottom_flag  = is_capital ? AF_LATIN_BLUE_BOTTOM
+                              : AF_LATIN_BLUE_BOTTOM_SMALL;
+    bottom_flag |= AF_LATIN_BLUE_ACTIVE;
+
+    for ( i = 0; i < axis->blue_count; i++ )
+      if ( ( axis->blues[i].flags & bottom_flag ) == bottom_flag )
+        break;
+    if ( i < axis->blue_count )
+      *bottom = &axis->blues[i];
+  }
+
+
+  /* Make the auto-hinter ignore top blue zones while aligning edges. */
+  /* This affects everything that is higher than a vertical position  */
+  /* based on the lowercase or uppercase top and bottom blue zones    */
+  /* (depending on `is_capital`).                                     */
+  static void
+  af_latin_ignore_top( AF_GlyphHints  hints,
+                       AF_LatinBlue   top_blue,
+                       AF_LatinBlue   bottom_blue )
+  {
+    FT_Pos  base_glyph_height;
+    FT_Pos  limit;
+
+
+    /* Ignore blue zones that are higher than a heuristic threshold     */
+    /* (value 7 corresponds to approx. 14%, which should be sufficient  */
+    /* to exceed the height of uppercase serifs.  We also add a quarter */
+    /* of a pixel as a safety measure.                                  */
+    base_glyph_height = top_blue->shoot.cur - bottom_blue->shoot.cur;
+    limit             = top_blue->shoot.cur + base_glyph_height / 7 + 16;
+
+    af_prevent_top_blue_alignment( hints, limit );
+  }
+
+
+  static void
+  af_latin_ignore_bottom( AF_GlyphHints  hints,
+                          AF_LatinBlue   top_blue,
+                          AF_LatinBlue   bottom_blue )
+  {
+    FT_Pos  base_glyph_height;
+    FT_Pos  limit;
+
+
+    base_glyph_height = top_blue->shoot.cur - bottom_blue->shoot.cur;
+    limit             = bottom_blue->shoot.cur - base_glyph_height / 7 - 16;
+
+    af_prevent_bottom_blue_alignment( hints, limit );
+  }
+
+
+  static void
+  af_touch_contour( AF_GlyphHints  hints,
+                    FT_Int         contour )
+  {
+    AF_Point  first_point = hints->contours[contour];
+    AF_Point  p           = first_point;
+
+
+    do
+    {
+      p = p->next;
+
+      p->flags |= AF_FLAG_IGNORE;
+      if ( !( p->flags & AF_FLAG_CONTROL ) )
+        p->flags |= AF_FLAG_TOUCH_Y;
+
+    } while ( p != first_point );
+  }
+
+
+  static void
+  af_touch_top_contours( AF_GlyphHints  hints,
+                         FT_Int         limit_contour )
+  {
+    FT_Pos  limit = hints->contour_y_minima[limit_contour];
+
+    FT_Int  contour;
+
+
+    for ( contour = 0; contour < hints->num_contours; contour++ )
+    {
+      FT_Pos  min_y = hints->contour_y_minima[contour];
+      FT_Pos  max_y = hints->contour_y_maxima[contour];
+
+
+      if ( min_y < max_y  &&
+           min_y >= limit )
+        af_touch_contour( hints, contour );
+    }
+  }
+
+
+  static void
+  af_touch_bottom_contours( AF_GlyphHints  hints,
+                            FT_Int         limit_contour )
+  {
+    FT_Pos  limit = hints->contour_y_minima[limit_contour];
+
+    FT_Int  contour;
+
+
+    for ( contour = 0; contour < hints->num_contours; contour++ )
+    {
+      FT_Pos  min_y = hints->contour_y_minima[contour];
+      FT_Pos  max_y = hints->contour_y_maxima[contour];
+
+
+      if ( min_y < max_y  &&
+           max_y <= limit )
+        af_touch_contour( hints, contour );
+    }
+  }
+
+
+  /* Stretch tilde vertically, if necessary, and return the height */
+  /* difference between the original and the stretched outline.    */
+  static FT_Pos
+  af_latin_stretch_top_tilde( AF_GlyphHints  hints,
+                              FT_Int         tilde_contour )
+  {
+    AF_Point  p           = hints->contours[tilde_contour];
+    AF_Point  first_point = p;
+
+    FT_Pos  min_y = hints->contour_y_minima[tilde_contour];
+    FT_Pos  max_y = hints->contour_y_maxima[tilde_contour];
+
+    FT_Pos   min_measurement   = FT_LONG_MAX;
+    FT_Bool  measurement_taken = FALSE;
+
+    FT_Pos  height;
+    FT_Pos  extremum_threshold;
+    FT_Pos  target_height;
+
+
+    if ( min_y == max_y )
+      return 0;
+
+    FT_TRACE4(( "af_latin_stretch_top_tilde: min y: %ld, max y: %ld\n",
+                min_y, max_y ));
+
+    height             = SUB_LONG( max_y, min_y );
+    extremum_threshold = height / 8;    /* Value 8 is heuristic. */
+
+    /* Find points that are local vertical round extrema, and which   */
+    /* do not coincide with the vertical extreme values (i.e., we     */
+    /* search for the 'other' wiggles in the tilde), then measure the */
+    /* distance to the vertical extreme values.  Try to find the one  */
+    /* with the smallest distance.                                    */
+    /*                                                                */
+    /* The algorithm only works for tilde shapes that don't deviate   */
+    /* from the standard shape too much.  In particular, the wiggles  */
+    /* must be round extrema.                                         */
+    do
+    {
+      p = p->next;
+
+      if ( !( p->flags & AF_FLAG_CONTROL )          &&
+           p->prev->y == p->y && p->next->y == p->y &&
+           p->y != min_y && p->y != max_y           &&
+           p->prev->flags & AF_FLAG_CONTROL         &&
+           p->next->flags & AF_FLAG_CONTROL         )
+      {
+        /* This point could be a candidate.  Find the next and previous */
+        /* on-curve points, and make sure they are both either above or */
+        /* below the point, then make the measurement.                  */
+        AF_Point  prev_on = p->prev;
+        AF_Point  next_on = p->next;
+
+        FT_Pos  measurement;
+
+
+        while ( prev_on->flags & AF_FLAG_CONTROL )
+          prev_on = prev_on->prev;
+        while ( next_on->flags & AF_FLAG_CONTROL )
+          next_on = next_on->next;
+
+        if ( next_on->y > p->y && prev_on->y > p->y )
+          measurement = p->y - min_y;
+        else if ( next_on->y < p->y && prev_on->y < p->y )
+          measurement = max_y - p->y;
+        else
+          continue;
+
+        /* Ignore hits that are too near to a vertical extremum. */
+        if ( measurement < extremum_threshold )
+          continue;
+
+        if ( !measurement_taken || measurement < min_measurement )
+        {
+          measurement_taken = TRUE;
+          min_measurement   = measurement;
+        }
+      }
+
+    } while ( p != first_point );
+
+    if ( !measurement_taken )
+      min_measurement = 0;
+
+    FT_TRACE4(( "af_latin_stretch_top_tilde: min measurement %ld\n",
+                min_measurement ));
+
+    /* To preserve the stretched shape we prevent that the tilde */
+    /* gets auto-hinted; we do this for all contours equal or    */
+    /* above the vertical minimum of `tilde_contour`.            */
+    af_touch_top_contours( hints, tilde_contour );
+
+    /* XXX This is an important element of the algorithm; */
+    /*     we need a description.                         */
+    target_height = min_measurement + 64;
+    if ( height >= target_height )
+      return 0;
+
+    /* Do the scaling. */
+    p = first_point;
+    do
+    {
+      p     = p->next;
+      /* We adjust the height of the diacritic only, which means    */
+      /* we are never dealing with large numbers and can thus avoid */
+      /* `FT_MulFix`.                                               */
+      p->y  = ( ( p->y - min_y ) * target_height / height ) + min_y;
+
+    } while ( p != first_point );
+
+    return target_height - height;
+  }
+
+
+  static FT_Pos
+  af_latin_stretch_bottom_tilde( AF_GlyphHints  hints,
+                                 FT_Int         tilde_contour )
+  {
+    AF_Point  p           = hints->contours[tilde_contour];
+    AF_Point  first_point = p;
+
+    FT_Pos  min_y = hints->contour_y_minima[tilde_contour];
+    FT_Pos  max_y = hints->contour_y_maxima[tilde_contour];
+
+    FT_Pos   min_measurement   = FT_LONG_MAX;
+    FT_Bool  measurement_taken = FALSE;
+
+    FT_Pos  height;
+    FT_Pos  extremum_threshold;
+    FT_Pos  target_height;
+
+
+    if ( min_y == max_y )
+      return 0;
+
+    FT_TRACE4(( "af_latin_stretch_bottom_tilde: min y: %ld, max y: %ld\n",
+                min_y, max_y ));
+
+    height             = SUB_LONG( max_y, min_y );
+    extremum_threshold = height / 8;
+
+    do
+    {
+      p = p->next;
+
+      if ( !( p->flags & AF_FLAG_CONTROL )          &&
+           p->prev->y == p->y && p->next->y == p->y &&
+           p->y != min_y && p->y != max_y           &&
+           p->prev->flags & AF_FLAG_CONTROL         &&
+           p->next->flags & AF_FLAG_CONTROL         )
+      {
+        AF_Point  prev_on = p->prev;
+        AF_Point  next_on = p->next;
+
+        FT_Pos  measurement;
+
+
+        while ( prev_on->flags & AF_FLAG_CONTROL )
+          prev_on = prev_on->prev;
+        while ( next_on->flags & AF_FLAG_CONTROL )
+          next_on = next_on->next;
+
+        if ( next_on->y > p->y && prev_on->y > p->y )
+          measurement = p->y - min_y;
+        else if ( next_on->y < p->y && prev_on->y < p->y )
+          measurement = max_y - p->y;
+        else
+          continue;
+
+        if ( measurement < extremum_threshold )
+          continue;
+
+        if ( !measurement_taken || measurement < min_measurement )
+        {
+          measurement_taken = TRUE;
+          min_measurement   = measurement;
+        }
+      }
+
+    } while ( p != first_point );
+
+    if ( !measurement_taken )
+      min_measurement = 0;
+
+    FT_TRACE4(( "af_latin_stretch_bottom_tilde: min measurement %ld\n",
+                min_measurement ));
+
+    af_touch_bottom_contours( hints, tilde_contour );
+
+    target_height = min_measurement + 64;
+    if ( height >= target_height )
+      return 0;
+
+    p = first_point;
+    do
+    {
+      p     = p->next;
+      p->y  = ( ( p->y - max_y ) * target_height / height ) + max_y;
+
+    } while ( p != first_point );
+
+    return target_height - height;
+  }
+
+
+  /*
+    As part of `af_latin_stretch_top_tilde`, normally all points in the
+    tilde are marked as touched, so the existing grid fitting will leave the
+    tilde misaligned with the grid.
+
+    This function moves the tilde contour down to be grid-fitted.  We assume
+    that if moving the tilde down would cause it to touch or overlap another
+    countour, the vertical adjustment step will fix it.
+
+    Because the vertical adjustment step comes after all other grid-fitting
+    steps, the top edge of the contour under the tilde is usually aligned
+    with a horizontal grid line.  The vertical gap enforced by the vertical
+    adjustment is exactly one pixel, so if the top edge of the contour below
+    the tilde is on a grid line, the resulting tilde contour will also be
+    grid-aligned.
+
+    But in cases where the gap is already big enough so that the vertical
+    adjustment does nothing, this function ensures that even without the
+    intervention of the vertical adjustment step, the tilde will be
+    grid-aligned.
+
+    Return the vertical alignment amount.
+  */
+  static FT_Pos
+  af_latin_align_top_tilde( AF_GlyphHints  hints,
+                            FT_Int         tilde_contour )
+  {
+    AF_Point  p           = hints->contours[tilde_contour];
+    AF_Point  first_point = p;
+
+    FT_Pos  min_y = p->y;
+    FT_Pos  max_y = p->y;
+
+    FT_Pos  min_y_rounded;
+    FT_Pos  delta;
+    FT_Pos  height;
+
+
+    /* Find vertical extrema of the (now stretched) tilde contour. */
+    do
+    {
+      p = p->next;
+      if ( p->y < min_y )
+        min_y = p->y;
+      if ( p->y > max_y )
+        max_y = p->y;
+
+    } while ( p != first_point );
+
+    /* Align bottom of the tilde to the grid. */
+    min_y_rounded = FT_PIX_ROUND( min_y );
+    delta         = min_y_rounded - min_y;
+    height        = max_y - min_y;
+
+    /* If the tilde is less than 3 pixels tall, snap the center of it */
+    /* to the grid instead of the bottom to improve readability.      */
+    if ( height < 64 * 3 )
+      delta += ( FT_PIX_ROUND( height ) - height ) / 2;
+
+    af_move_contour_vertically( first_point, delta );
+
+    return delta;
+  }
+
+
+  static FT_Pos
+  af_latin_align_bottom_tilde( AF_GlyphHints  hints,
+                               FT_Int         tilde_contour )
+  {
+    AF_Point  p           = hints->contours[tilde_contour];
+    AF_Point  first_point = p;
+
+    FT_Pos  min_y = p->y;
+    FT_Pos  max_y = p->y;
+
+    FT_Pos  max_y_rounded;
+    FT_Pos  delta;
+    FT_Pos  height;
+
+
+    do
+    {
+      p = p->next;
+      if ( p->y < min_y )
+        min_y = p->y;
+      if ( p->y > max_y )
+        max_y = p->y;
+
+    } while ( p != first_point );
+
+    max_y_rounded = FT_PIX_ROUND( max_y );
+    delta         = max_y_rounded - max_y;
+    height        = max_y - min_y;
+
+    if ( height < 64 * 3 )
+      delta -= ( FT_PIX_ROUND( height ) - height ) / 2;
+
+    af_move_contour_vertically( first_point, delta );
+
+    return delta;
+  }
+
+
+  /* Return 1 if the given contour overlaps horizontally with the bounding */
+  /* box of all other contours combined.  This is a helper for function    */
+  /* `af_glyph_hints_apply_vertical_separation_adjustments`.               */
+  static FT_Bool
+  af_check_contour_horizontal_overlap( AF_GlyphHints  hints,
+                                       FT_Int         contour_index )
+  {
+    FT_Pos  contour_max_x = FT_LONG_MIN;
+    FT_Pos  contour_min_x = FT_LONG_MAX;
+    FT_Pos  others_max_x  = FT_LONG_MIN;
+    FT_Pos  others_min_x  = FT_LONG_MAX;
+
+    FT_Int  contour;
+
+    FT_Bool  horizontal_overlap;
+
+
+    for ( contour = 0; contour < hints->num_contours; contour++ )
+    {
+      AF_Point  first_point = hints->contours[contour];
+      AF_Point  p           = first_point;
+
+
+      /* Ignore dimensionless contours (i.e., contours with only one or */
+      /* two points).                                                   */
+      if ( first_point->next->next == first_point )
+        continue;
+
+      do
+      {
+        p = p->next;
+
+        if ( contour == contour_index )
+        {
+          if ( p->x < contour_min_x )
+            contour_min_x = p->x;
+          if ( p->x > contour_max_x )
+            contour_max_x = p->x;
+        }
+        else
+        {
+          if ( p->x < others_min_x )
+            others_min_x = p->x;
+          if ( p->x > others_max_x )
+            others_max_x = p->x;
+        }
+      } while ( p != first_point );
+    }
+
+    horizontal_overlap =
+      ( others_min_x <= contour_max_x && contour_max_x <= others_max_x ) ||
+      ( others_min_x <= contour_min_x && contour_min_x <= others_max_x ) ||
+      ( contour_max_x >= others_max_x && contour_min_x <= others_min_x );
+
+    return horizontal_overlap;
+  }
+
+
+  static void
+  af_glyph_hints_apply_vertical_separation_adjustments(
+    AF_GlyphHints  hints,
+    AF_Dimension   dim,
+    FT_UInt        glyph_index,
+    FT_Pos         accent_height_limit,
+    FT_Hash        reverse_charmap )
+  {
+    FT_Bool  adjust_top       = FALSE;
+    FT_Bool  adjust_below_top = FALSE;
+
+    FT_Bool  adjust_bottom       = FALSE;
+    FT_Bool  adjust_above_bottom = FALSE;
+
+    size_t*    val;
+    FT_UInt32  adj_type = AF_ADJUST_NONE;
+
+
+    FT_TRACE4(( "Entering"
+                " af_glyph_hints_apply_vertical_separation_adjustments\n" ));
+
+    if ( dim != AF_DIMENSION_VERT )
+      return;
+
+    val = ft_hash_num_lookup( (FT_Int)glyph_index, reverse_charmap );
+    if ( val )
+    {
+      FT_UInt  codepoint = *val;
+
+
+      adj_type = af_adjustment_database_lookup( codepoint );
+
+      if ( adj_type )
+      {
+        adjust_top       = !!( adj_type & AF_ADJUST_UP );
+        adjust_below_top = !!( adj_type & AF_ADJUST_UP2 );
+
+        adjust_bottom       = !!( adj_type & AF_ADJUST_DOWN );
+        adjust_above_bottom = !!( adj_type & AF_ADJUST_DOWN2 );
+      }
+    }
+
+    if ( ( ( adjust_top || adjust_bottom ) &&
+           hints->num_contours >= 2        )             ||
+         ( ( adjust_below_top || adjust_above_bottom ) &&
+           hints->num_contours >= 3                    ) )
+    {
+      /* Recompute vertical extrema, this time acting on already */
+      /* auto-hinted outlines.                                   */
+      af_compute_vertical_extrema( hints );
+    }
+
+    if ( ( adjust_top && hints->num_contours >= 2 )       ||
+         ( adjust_below_top && hints->num_contours >= 3 ) )
+    {
+      FT_Int  high_contour;
+      FT_Pos  high_min_y;
+      FT_Pos  high_max_y;
+      FT_Pos  high_height;
+
+      FT_Int  tilde_contour;
+      FT_Pos  tilde_min_y;
+      FT_Pos  tilde_max_y;
+      FT_Pos  tilde_height;
+
+      FT_Int   contour;
+      FT_Bool  horizontal_overlap;
+
+      FT_Pos  min_distance         = 64;
+      FT_Pos  adjustment_amount;
+      FT_Pos  calculated_amount;
+      FT_Pos  centering_adjustment = 0;
+      FT_Pos  pos;
+
+      FT_Bool  is_top_tilde       = !!( adj_type & AF_ADJUST_TILDE_TOP );
+      FT_Bool  is_below_top_tilde = !!( adj_type & AF_ADJUST_TILDE_TOP2 );
+
+
+      FT_TRACE4(( "af_glyph_hints_apply_vertical_separation_adjustments:\n"
+                  "  Applying vertical adjustment: %s\n",
+                  adjust_top ? "AF_ADJUST_TOP" : "AF_ADJUST_TOP2" ));
+
+      high_contour = adjust_below_top
+                       ? af_find_second_highest_contour( hints )
+                       : af_find_highest_contour( hints );
+
+      /* Check for a horizontal overlap between the high contour and the */
+      /* rest.  If there is no overlap, do not adjust.                   */
+      horizontal_overlap =
+        af_check_contour_horizontal_overlap( hints, high_contour );
+      if ( !horizontal_overlap )
+      {
+        FT_TRACE4(( "    High contour does not horizontally overlap"
+                    " with other contours.\n"
+                    "    Skipping adjustment.\n" ));
+        return;
+      }
+
+      high_min_y  = hints->contour_y_minima[high_contour];
+      high_max_y  = hints->contour_y_maxima[high_contour];
+      high_height = high_max_y - high_min_y;
+
+      if ( high_height > accent_height_limit )
+      {
+        FT_TRACE4(( "    High contour height (%.2f) exceeds accent height"
+                    " limit (%.2f).\n"
+                    "    Skipping adjustment.\n",
+                    (double)high_height / 64,
+                    (double)accent_height_limit / 64 ));
+        return;
+      }
+
+      /* If the difference between the vertical minimum of the high   */
+      /* contour and the vertical maximum of another contour is less  */
+      /* than a pixel, shift up the high contour to make the distance */
+      /* one pixel.                                                   */
+      for ( contour = 0; contour < hints->num_contours; contour++ )
+      {
+        FT_Pos  min_y;
+        FT_Pos  max_y;
+        FT_Pos  distance;
+
+
+        if ( contour == high_contour )
+          continue;
+
+        min_y = hints->contour_y_minima[contour];
+        max_y = hints->contour_y_maxima[contour];
+
+        /* We also check that the y minimum of the 'other' contour */
+        /* is below the high contour to avoid potential false hits */
+        /* with contours enclosed in the high one.                 */
+        distance = high_min_y - max_y;
+        if ( distance < 64           &&
+             distance < min_distance &&
+             min_y < high_min_y      )
+          min_distance = distance;
+      }
+
+      adjustment_amount = 64 - min_distance;
+
+      if ( is_top_tilde || is_below_top_tilde )
+      {
+        tilde_contour = adjust_top
+                          ? high_contour
+                          : ( is_below_top_tilde
+                                ? high_contour
+                                : af_find_highest_contour( hints ) );
+
+        tilde_min_y  = hints->contour_y_minima[tilde_contour];
+        tilde_max_y  = hints->contour_y_maxima[tilde_contour];
+        tilde_height = tilde_max_y - tilde_min_y;
+
+        /* The vertical separation adjustment potentially undoes a */
+        /* tilde center alignment.  If it would grid-align a tilde */
+        /* less than 3 pixels in height, shift additionally to     */
+        /* re-center the tilde.                                    */
+
+        pos = high_min_y + adjustment_amount;
+        if ( adjust_below_top && is_top_tilde )
+          pos += high_height;
+
+        if ( pos % 64 == 0 && tilde_height < 3 * 64 )
+        {
+          centering_adjustment = ( FT_PIX_ROUND( tilde_height ) -
+                                   tilde_height ) / 2;
+
+          FT_TRACE4(( "    Additional tilde centering adjustment: %ld\n",
+                      centering_adjustment ));
+        }
+      }
+
+      if ( ( adjust_top && is_top_tilde )             ||
+           ( adjust_below_top && is_below_top_tilde ) )
+        calculated_amount = adjustment_amount + centering_adjustment;
+      else
+        calculated_amount = adjustment_amount;
+
+      /* allow a delta of 2/64px to handle rounding differences */
+      FT_TRACE4(( "    Calculated adjustment amount: %ld%s\n",
+                  calculated_amount,
+                  ( calculated_amount < -2                               ||
+                    ( adjustment_amount > 66 && calculated_amount > 66 ) )
+                      ? " (out of range [-2;66], not adjusting)" : "" ));
+
+      if ( calculated_amount != 0                                 &&
+           calculated_amount >= -2                                &&
+           ( calculated_amount <= 66 || adjustment_amount <= 66 ) )
+      {
+        /* Value 8 is heuristic. */
+        FT_Pos  height_delta = high_height / 8;
+        FT_Pos  min_y_limit  = high_min_y - height_delta;
+
+
+        FT_TRACE4(( "    Pushing high contour %ld units up\n",
+                    calculated_amount ));
+
+        /* While we use only a single contour (the 'high' one) for    */
+        /* computing `adjustment_amount`, we apply it to all contours */
+        /* that are (approximately) in the same vertical range or     */
+        /* higher.  This covers, for example, the inner contour of    */
+        /* the Czech ring accent or the second acute accent in the    */
+        /* Hungarian double acute accent.                             */
+        af_move_contours_up( hints, min_y_limit, adjustment_amount );
+
+        if ( adjust_below_top && is_top_tilde )
+        {
+          FT_TRACE4(( "    Pushing top tilde %ld units up\n",
+                      centering_adjustment ));
+
+          af_move_contours_up( hints,
+                               min_y_limit + high_height,
+                               centering_adjustment );
+        }
+      }
+    }
+
+    if ( ( adjust_bottom && hints->num_contours >= 2 )       ||
+         ( adjust_above_bottom && hints->num_contours >= 3 ) )
+    {
+      FT_Int  low_contour;
+      FT_Pos  low_min_y;
+      FT_Pos  low_max_y;
+      FT_Pos  low_height;
+
+      FT_Int  tilde_contour;
+      FT_Pos  tilde_min_y;
+      FT_Pos  tilde_max_y;
+      FT_Pos  tilde_height;
+
+      FT_Int   contour;
+      FT_Bool  horizontal_overlap;
+
+      FT_Pos  min_distance         = 64;
+      FT_Pos  adjustment_amount;
+      FT_Pos  calculated_amount;
+      FT_Pos  centering_adjustment = 0;
+      FT_Pos  pos;
+
+      FT_Bool  is_bottom_tilde =
+                 !!( adj_type & AF_ADJUST_TILDE_BOTTOM );
+      FT_Bool  is_above_bottom_tilde =
+                 !!( adj_type & AF_ADJUST_TILDE_BOTTOM2 );
+
+
+      FT_TRACE4(( "af_glyph_hints_apply_vertical_separation_adjustments:\n"
+                  "  Applying vertical adjustment: %s\n",
+                  adjust_bottom ? "AF_ADJUST_DOWN": "AF_ADJUST_DOWN2" ));
+
+      low_contour = adjust_above_bottom
+                      ? af_find_second_lowest_contour( hints )
+                      : af_find_lowest_contour( hints );
+
+      horizontal_overlap =
+        af_check_contour_horizontal_overlap( hints, low_contour );
+      if ( !horizontal_overlap )
+      {
+        FT_TRACE4(( "    Low contour does not horizontally overlap"
+                    " with other contours.\n"
+                    "    Skipping adjustment.\n" ));
+        return;
+      }
+
+      low_min_y  = hints->contour_y_minima[low_contour];
+      low_max_y  = hints->contour_y_maxima[low_contour];
+      low_height = low_max_y - low_min_y;
+
+      if ( low_height > accent_height_limit )
+      {
+        FT_TRACE4(( "    Low contour height (%.2f) exceeds accent height"
+                    " limit (%.2f).\n"
+                    "    Skipping adjustment.\n",
+                    (double)low_height / 64,
+                    (double)accent_height_limit / 64 ));
+        return;
+      }
+
+      for ( contour = 0; contour < hints->num_contours; contour++ )
+      {
+        FT_Pos  min_y;
+        FT_Pos  max_y;
+        FT_Pos  distance;
+
+
+        if ( contour == low_contour )
+          continue;
+
+        min_y = hints->contour_y_minima[contour];
+        max_y = hints->contour_y_maxima[contour];
+
+        distance = min_y - low_max_y;
+        if ( distance < 64           &&
+             distance < min_distance &&
+             max_y > low_max_y       )
+          min_distance = distance;
+      }
+
+      adjustment_amount = 64 - min_distance;
+
+      if ( is_bottom_tilde || is_above_bottom_tilde )
+      {
+        tilde_contour = adjust_bottom
+                          ? low_contour
+                          : ( is_above_bottom_tilde
+                                ? low_contour
+                                : af_find_lowest_contour( hints ) );
+
+        tilde_min_y  = hints->contour_y_minima[tilde_contour];
+        tilde_max_y  = hints->contour_y_maxima[tilde_contour];
+        tilde_height = tilde_max_y - tilde_min_y;
+
+        pos = low_max_y - adjustment_amount;
+        if ( adjust_above_bottom && is_bottom_tilde )
+          pos -= low_height;
+
+        if ( pos % 64 == 0 && tilde_height < 3 * 64 )
+        {
+          centering_adjustment = ( FT_PIX_ROUND( tilde_height ) -
+                                   tilde_height ) / 2;
+
+          FT_TRACE4(( "    Additional tilde centering adjustment: %ld\n",
+                      centering_adjustment ));
+        }
+      }
+
+      if ( ( adjust_bottom && is_bottom_tilde )             ||
+           ( adjust_above_bottom && is_above_bottom_tilde ) )
+        calculated_amount = adjustment_amount + centering_adjustment;
+      else
+        calculated_amount = adjustment_amount;
+
+      FT_TRACE4(( "    Calculated adjustment amount: %ld%s\n",
+                  calculated_amount,
+                  ( calculated_amount < -2                               ||
+                    ( adjustment_amount > 66 && calculated_amount > 66 ) )
+                      ? " (out of range [-2;66], not adjusting)" : "" ));
+
+      if ( calculated_amount != 0                                 &&
+           calculated_amount >= -2                                &&
+           ( calculated_amount <= 66 || adjustment_amount <= 66 ) )
+      {
+        FT_Pos  height_delta = low_height / 8;
+        FT_Pos  max_y_limit  = low_max_y + height_delta;
+
+
+        FT_TRACE4(( "    Pushing low contour %ld units down\n",
+                    calculated_amount ));
+
+        af_move_contours_down( hints, max_y_limit, adjustment_amount );
+
+        if ( adjust_above_bottom && is_bottom_tilde )
+        {
+          FT_TRACE4(( "    Pushing bottom tilde %ld units down\n",
+                      centering_adjustment ));
+
+          af_move_contours_down( hints,
+                                 max_y_limit - low_height,
+                                 centering_adjustment );
+        }
+      }
+    }
+
+#ifdef FT_DEBUG_LEVEL_TRACE
+    if ( !( ( ( adjust_top || adjust_bottom ) &&
+              hints->num_contours >= 2        )             ||
+            ( ( adjust_below_top || adjust_above_bottom ) &&
+              hints->num_contours >= 3                    ) ) )
+      FT_TRACE4(( "af_glyph_hints_apply_vertical_separation_adjustments:\n"
+                  "  No vertical adjustment applied\n" ));
+#endif
+
+    FT_TRACE4(( "Exiting"
+                " af_glyph_hints_apply_vertical_separation_adjustments\n" ));
+  }
+
+
+#undef  FT_COMPONENT
+#define FT_COMPONENT  aflatin
+
+
   /* Compute the snapped width of a given stem, ignoring very thin ones. */
   /* There is a lot of voodoo in this function; changing the hard-coded  */
   /* parameters influence the whole hinting process.                     */
@@ -2998,13 +4214,15 @@
   af_latin_hint_edges( AF_GlyphHints  hints,
                        AF_Dimension   dim )
   {
-    AF_AxisHints  axis       = &hints->axis[dim];
-    AF_Edge       edges      = axis->edges;
-    AF_Edge       edge_limit = FT_OFFSET( edges, axis->num_edges );
-    FT_PtrDist    n_edges;
-    AF_Edge       edge;
-    AF_Edge       anchor     = NULL;
-    FT_Int        has_serifs = 0;
+    AF_AxisHints  axis = &hints->axis[dim];
+
+    AF_Edge     edges      = axis->edges;
+    AF_Edge     edge_limit = FT_OFFSET( edges, axis->num_edges );
+    AF_Edge     edge;
+    FT_PtrDist  n_edges;
+
+    AF_Edge  anchor             = NULL;
+    FT_Bool  has_non_stem_edges = 0;
 
     AF_StyleClass   style_class  = hints->metrics->style_class;
     AF_ScriptClass  script_class = af_script_classes[style_class->script];
@@ -3131,7 +4349,7 @@
       edge2 = edge->link;
       if ( !edge2 )
       {
-        has_serifs++;
+        has_non_stem_edges = TRUE;
         continue;
       }
 
@@ -3408,7 +4626,7 @@
       }
     }
 
-    if ( has_serifs || !anchor )
+    if ( has_non_stem_edges || !anchor )
     {
       /*
        * now hint the remaining edges (serifs and single) in order
@@ -3426,9 +4644,75 @@
 
         if ( edge->serif )
         {
+          AF_Edge  e, top, bottom;
+          FT_Pos   min_pos, max_pos;
+
+
+          /* Check whether we have a real serif -- if there are  */
+          /* other edges with overlapping (or enclosed) segments */
+          /* between the primary and serif edge, we have not.    */
+          /*                                                     */
+          /* Such a situation might happen if an accent is very  */
+          /* near to its base glyph (for example, Vietnamese     */
+          /* uppercase letters with two accents in `arial.ttf`), */
+          /* and the segment detection algorithm classifies the  */
+          /* top of the accent incorrectly as a serif.           */
           delta = edge->serif->opos - edge->opos;
           if ( delta < 0 )
+          {
             delta = -delta;
+
+            top    = edge;
+            bottom = edge->serif;
+          }
+          else
+          {
+            top    = edge->serif;
+            bottom = edge;
+          }
+
+          if ( delta < 64 + 32 )
+          {
+            /* take care of outline orientation while computing extrema */
+            min_pos = FT_MIN( FT_MIN( FT_MIN( top->first->first->v,
+                                              top->first->last->v ),
+                                      FT_MIN( top->last->first->v,
+                                              top->last->last->v ) ),
+                              FT_MIN( FT_MIN( bottom->first->first->v,
+                                              bottom->first->last->v ),
+                                      FT_MIN( bottom->last->first->v,
+                                              bottom->last->last->v ) ) );
+            max_pos = FT_MAX( FT_MAX( FT_MAX( top->first->first->v,
+                                              top->first->last->v ),
+                                      FT_MAX( top->last->first->v,
+                                              top->last->last->v ) ),
+                              FT_MAX( FT_MAX( bottom->first->first->v,
+                                              bottom->first->last->v ),
+                                      FT_MAX( bottom->last->first->v,
+                                              bottom->last->last->v ) ) );
+
+            for ( e = bottom + 1; e < top; e++ )
+            {
+              FT_Pos  e_min = FT_MIN( FT_MIN( e->first->first->v,
+                                              e->first->last->v ),
+                                      FT_MIN( e->last->first->v,
+                                              e->last->last->v ) );
+              FT_Pos  e_max = FT_MAX( FT_MAX( e->first->first->v,
+                                              e->first->last->v ),
+                                      FT_MAX( e->last->first->v,
+                                              e->last->last->v ) );
+
+              if ( !( ( e_min < min_pos && e_max < min_pos ) ||
+                      ( e_min > max_pos && e_max > max_pos ) ) )
+              {
+                delta = 1000;  /* not a real serif */
+                break;
+              }
+            }
+
+            if ( delta == 1000 )
+              continue;
+          }
         }
 
         if ( delta < 64 + 16 )
@@ -3562,6 +4846,8 @@
 
     AF_LatinAxis  axis;
 
+    FT_Pos  accent_height_limit = 0;
+
 
     error = af_glyph_hints_reload( hints, outline );
     if ( error )
@@ -3581,11 +4867,172 @@
 
     if ( AF_HINTS_DO_VERTICAL( hints ) )
     {
+      size_t*  val;
+
+      FT_Int  top_tilde_contour    = 0;
+      FT_Int  bottom_tilde_contour = 0;
+
+      FT_Int  below_top_tilde_contour    = 0;
+      FT_Int  above_bottom_tilde_contour = 0;
+
+      AF_LatinBlue  capital_top_blue    = NULL;
+      AF_LatinBlue  capital_bottom_blue = NULL;
+
+      AF_LatinBlue  small_top_blue    = NULL;
+      AF_LatinBlue  small_bottom_blue = NULL;
+
+      FT_Bool  have_flags = FALSE;
+
+      FT_Bool  is_top_tilde    = FALSE;
+      FT_Bool  is_bottom_tilde = FALSE;
+
+      FT_Bool  is_below_top_tilde    = FALSE;
+      FT_Bool  is_above_bottom_tilde = FALSE;
+
+      FT_Bool  ignore_capital_top    = FALSE;
+      FT_Bool  ignore_capital_bottom = FALSE;
+
+      FT_Bool  ignore_small_top    = FALSE;
+      FT_Bool  ignore_small_bottom = FALSE;
+
+      FT_Bool  do_height_check = TRUE;
+
+      FT_Pos  limit;
+      FT_Pos  y_offset;
+
+
+      val = ft_hash_num_lookup( (FT_Int)glyph_index,
+                                metrics->root.reverse_charmap );
+      if ( val )
+      {
+        FT_UInt    codepoint = *val;
+        FT_UInt32  adj_type  = af_adjustment_database_lookup( codepoint );
+
+
+        if ( adj_type )
+        {
+          have_flags = !!adj_type;
+
+          is_top_tilde    = !!( adj_type & AF_ADJUST_TILDE_TOP );
+          is_bottom_tilde = !!( adj_type & AF_ADJUST_TILDE_BOTTOM );
+
+          is_below_top_tilde    = !!( adj_type & AF_ADJUST_TILDE_TOP2 );
+          is_above_bottom_tilde = !!( adj_type & AF_ADJUST_TILDE_BOTTOM2 );
+
+          ignore_capital_top    = !!( adj_type & AF_IGNORE_CAPITAL_TOP );
+          ignore_capital_bottom = !!( adj_type & AF_IGNORE_CAPITAL_BOTTOM );
+
+          ignore_small_top    = !!( adj_type & AF_IGNORE_SMALL_TOP );
+          ignore_small_bottom = !!( adj_type & AF_IGNORE_SMALL_BOTTOM );
+
+          do_height_check = !( adj_type & AF_ADJUST_NO_HEIGHT_CHECK );
+        }
+      }
+
+      if ( is_top_tilde || is_bottom_tilde             ||
+           is_below_top_tilde || is_above_bottom_tilde )
+        af_compute_vertical_extrema( hints );
+
+      /* Process inner tilde glyphs first. */
+      if ( is_below_top_tilde )
+      {
+        below_top_tilde_contour = af_find_second_highest_contour( hints );
+
+        y_offset = af_latin_stretch_top_tilde(
+                     hints, below_top_tilde_contour );
+        y_offset += af_latin_align_top_tilde(
+                      hints, below_top_tilde_contour );
+
+        limit = hints->contour_y_minima[below_top_tilde_contour];
+        af_move_contours_up( hints, limit, y_offset );
+      }
+      if ( is_above_bottom_tilde )
+      {
+        above_bottom_tilde_contour = af_find_second_lowest_contour( hints );
+
+        y_offset = af_latin_stretch_bottom_tilde(
+                     hints, above_bottom_tilde_contour );
+        y_offset -= af_latin_align_bottom_tilde(
+                      hints, above_bottom_tilde_contour );
+
+        limit = hints->contour_y_maxima[above_bottom_tilde_contour];
+        af_move_contours_down( hints, limit, y_offset );
+      }
+
+      if ( is_top_tilde )
+      {
+        top_tilde_contour = af_find_highest_contour( hints );
+
+        (void)af_latin_stretch_top_tilde( hints, top_tilde_contour );
+        (void)af_latin_align_top_tilde( hints, top_tilde_contour );
+      }
+      if ( is_bottom_tilde )
+      {
+        bottom_tilde_contour = af_find_lowest_contour( hints );
+
+        (void)af_latin_stretch_bottom_tilde( hints, bottom_tilde_contour );
+        (void)af_latin_align_bottom_tilde( hints, bottom_tilde_contour );
+      }
+
       axis  = &metrics->axis[AF_DIMENSION_VERT];
       error = af_latin_hints_detect_features( hints,
                                               axis->width_count,
                                               axis->widths,
                                               AF_DIMENSION_VERT );
+
+      if ( have_flags )
+      {
+        af_latin_get_base_glyph_blues( hints,
+                                       TRUE,
+                                       &capital_top_blue,
+                                       &capital_bottom_blue );
+        af_latin_get_base_glyph_blues( hints,
+                                       FALSE,
+                                       &small_top_blue,
+                                       &small_bottom_blue );
+
+        if ( do_height_check )
+        {
+          /* Set a heuristic limit for the accent height so that    */
+          /* `af_glyph_hints_apply_vertical_separation_adjustments` */
+          /* can correctly ignore the case where an accent is       */
+          /* unexpectedly not the highest (or lowest) contour.      */
+
+          /* Either 2/3 of the lowercase blue zone height... */
+          if ( small_top_blue && small_bottom_blue )
+            accent_height_limit = 2 * ( small_top_blue->shoot.cur -
+                                        small_bottom_blue->shoot.cur ) / 3;
+          /* or 1/2 of the uppercase blue zone height... */
+          else if ( capital_top_blue && capital_bottom_blue )
+            accent_height_limit = ( capital_top_blue->shoot.cur -
+                                    capital_bottom_blue->shoot.cur ) / 2;
+          /* or half of the standard PostScript ascender value (8/10) */
+          /* of the EM value, scaled.                                 */
+          else
+            accent_height_limit = FT_MulFix( metrics->units_per_em * 4 / 10,
+                                             metrics->root.scaler.y_scale );
+        }
+      }
+
+      if ( capital_top_blue && capital_bottom_blue )
+      {
+        if ( ignore_capital_top )
+          af_latin_ignore_top( hints,
+                               capital_top_blue, capital_bottom_blue );
+        if ( ignore_capital_bottom )
+          af_latin_ignore_bottom( hints,
+                                  capital_top_blue, capital_bottom_blue );
+      }
+      if ( small_top_blue && small_bottom_blue )
+      {
+        if ( ignore_small_top )
+          af_latin_ignore_top( hints,
+                               small_top_blue, small_bottom_blue );
+        if ( ignore_small_bottom )
+          af_latin_ignore_bottom( hints,
+                                  small_top_blue, small_bottom_blue );
+      }
+
       if ( error )
         goto Exit;
 
@@ -3604,6 +5051,12 @@
         af_glyph_hints_align_edge_points( hints, (AF_Dimension)dim );
         af_glyph_hints_align_strong_points( hints, (AF_Dimension)dim );
         af_glyph_hints_align_weak_points( hints, (AF_Dimension)dim );
+        af_glyph_hints_apply_vertical_separation_adjustments(
+          hints,
+          (AF_Dimension)dim,
+          glyph_index,
+          accent_height_limit,
+          metrics->root.reverse_charmap );
       }
     }
 
@@ -3632,7 +5085,7 @@
 
     (AF_WritingSystem_InitMetricsFunc) af_latin_metrics_init,        /* style_metrics_init    */
     (AF_WritingSystem_ScaleMetricsFunc)af_latin_metrics_scale,       /* style_metrics_scale   */
-    (AF_WritingSystem_DoneMetricsFunc) NULL,                         /* style_metrics_done    */
+    (AF_WritingSystem_DoneMetricsFunc) af_latin_metrics_done,        /* style_metrics_done    */
     (AF_WritingSystem_GetStdWidthsFunc)af_latin_get_standard_widths, /* style_metrics_getstdw */
 
     (AF_WritingSystem_InitHintsFunc)   af_latin_hints_init,          /* style_hints_init      */
diff --git a/src/java.desktop/share/native/libfreetype/src/autofit/aflatin.h b/src/java.desktop/share/native/libfreetype/src/autofit/aflatin.h
index 54e50615021..82b4b0d480d 100644
--- a/src/java.desktop/share/native/libfreetype/src/autofit/aflatin.h
+++ b/src/java.desktop/share/native/libfreetype/src/autofit/aflatin.h
@@ -5,7 +5,7 @@
  *   Auto-fitter hinting routines for latin writing system
  *   (specification).
  *
- * Copyright (C) 2003-2024 by
+ * Copyright (C) 2003-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
@@ -61,17 +61,26 @@ FT_BEGIN_HEADER
           ( (b)->properties & AF_BLUE_PROPERTY_LATIN_X_HEIGHT )
 #define AF_LATIN_IS_LONG_BLUE( b ) \
           ( (b)->properties & AF_BLUE_PROPERTY_LATIN_LONG )
+#define AF_LATIN_IS_CAPITAL_BOTTOM_BLUE( b ) \
+          ( (b)->properties & AF_BLUE_PROPERTY_LATIN_CAPITAL_BOTTOM )
+#define AF_LATIN_IS_SMALL_BOTTOM_BLUE( b ) \
+          ( (b)->properties & AF_BLUE_PROPERTY_LATIN_SMALL_BOTTOM )
 
 #define AF_LATIN_MAX_WIDTHS  16
 
 
-#define AF_LATIN_BLUE_ACTIVE      ( 1U << 0 ) /* zone height is <= 3/4px   */
-#define AF_LATIN_BLUE_TOP         ( 1U << 1 ) /* we have a top blue zone   */
-#define AF_LATIN_BLUE_SUB_TOP     ( 1U << 2 ) /* we have a subscript top   */
-                                              /* blue zone                 */
-#define AF_LATIN_BLUE_NEUTRAL     ( 1U << 3 ) /* we have neutral blue zone */
-#define AF_LATIN_BLUE_ADJUSTMENT  ( 1U << 4 ) /* used for scale adjustment */
-                                              /* optimization              */
+#define AF_LATIN_BLUE_ACTIVE        ( 1U << 0 ) /* zone height is <= 3/4px */
+#define AF_LATIN_BLUE_TOP           ( 1U << 1 ) /* we have a top blue zone */
+#define AF_LATIN_BLUE_SUB_TOP       ( 1U << 2 ) /* we have a subscript     */
+                                                /* top blue zone           */
+#define AF_LATIN_BLUE_NEUTRAL       ( 1U << 3 ) /* we have a neutral blue  */
+                                                /* zone                    */
+#define AF_LATIN_BLUE_ADJUSTMENT    ( 1U << 4 ) /* used for scale adjustm. */
+                                                /* optimization            */
+#define AF_LATIN_BLUE_BOTTOM        ( 1U << 5 ) /* we have a capital       */
+                                                /* letter bottom blue zone */
+#define AF_LATIN_BLUE_BOTTOM_SMALL  ( 1U << 6 ) /* we have a small letter  */
+                                                /* bottom blue zone        */
 
 
   typedef struct  AF_LatinBlueRec_
diff --git a/src/java.desktop/share/native/libfreetype/src/autofit/afloader.c b/src/java.desktop/share/native/libfreetype/src/autofit/afloader.c
index af1d59a6896..d84adc09679 100644
--- a/src/java.desktop/share/native/libfreetype/src/autofit/afloader.c
+++ b/src/java.desktop/share/native/libfreetype/src/autofit/afloader.c
@@ -4,7 +4,7 @@
  *
  *   Auto-fitter glyph loading routines (body).
  *
- * Copyright (C) 2003-2024 by
+ * Copyright (C) 2003-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/autofit/afloader.h b/src/java.desktop/share/native/libfreetype/src/autofit/afloader.h
index 99f0e15f92b..a04b4df0b3b 100644
--- a/src/java.desktop/share/native/libfreetype/src/autofit/afloader.h
+++ b/src/java.desktop/share/native/libfreetype/src/autofit/afloader.h
@@ -4,7 +4,7 @@
  *
  *   Auto-fitter glyph loading routines (specification).
  *
- * Copyright (C) 2003-2024 by
+ * Copyright (C) 2003-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/autofit/afmodule.c b/src/java.desktop/share/native/libfreetype/src/autofit/afmodule.c
index 726f6ca2b78..22d85a889e8 100644
--- a/src/java.desktop/share/native/libfreetype/src/autofit/afmodule.c
+++ b/src/java.desktop/share/native/libfreetype/src/autofit/afmodule.c
@@ -4,7 +4,7 @@
  *
  *   Auto-fitter module implementation (body).
  *
- * Copyright (C) 2003-2024 by
+ * Copyright (C) 2003-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
@@ -146,7 +146,7 @@
 
       if ( !af_style_classes[ss] )
       {
-        FT_TRACE2(( "af_property_set: Invalid value %d for property `%s'\n",
+        FT_TRACE2(( "af_property_set: Invalid value %u for property `%s'\n",
                     *fallback_script, property_name ));
         return FT_THROW( Invalid_Argument );
       }
@@ -412,6 +412,11 @@
     module->darken_params[6]  = CFF_CONFIG_OPTION_DARKENING_PARAMETER_X4;
     module->darken_params[7]  = CFF_CONFIG_OPTION_DARKENING_PARAMETER_Y4;
 
+#if defined( FT_CONFIG_OPTION_USE_HARFBUZZ )         && \
+    defined( FT_CONFIG_OPTION_USE_HARFBUZZ_DYNAMIC )
+    ft_hb_funcs_init( module );
+#endif
+
     return FT_Err_Ok;
   }
 
@@ -421,6 +426,11 @@
   {
     FT_UNUSED( ft_module );
 
+#if defined( FT_CONFIG_OPTION_USE_HARFBUZZ )         && \
+    defined( FT_CONFIG_OPTION_USE_HARFBUZZ_DYNAMIC )
+    ft_hb_funcs_done( (AF_Module)ft_module );
+#endif
+
 #ifdef FT_DEBUG_AUTOFIT
     if ( af_debug_hints_rec_->memory )
       af_glyph_hints_done( af_debug_hints_rec_ );
diff --git a/src/java.desktop/share/native/libfreetype/src/autofit/afmodule.h b/src/java.desktop/share/native/libfreetype/src/autofit/afmodule.h
index 91a1abfef1f..c62421ef696 100644
--- a/src/java.desktop/share/native/libfreetype/src/autofit/afmodule.h
+++ b/src/java.desktop/share/native/libfreetype/src/autofit/afmodule.h
@@ -4,7 +4,7 @@
  *
  *   Auto-fitter module implementation (specification).
  *
- * Copyright (C) 2003-2024 by
+ * Copyright (C) 2003-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
@@ -22,6 +22,7 @@
 #include <freetype/internal/ftobjs.h>
 #include <freetype/ftmodapi.h>
 
+#include "ft-hb.h"
 
 FT_BEGIN_HEADER
 
@@ -40,6 +41,11 @@ FT_BEGIN_HEADER
     FT_Bool       no_stem_darkening;
     FT_Int        darken_params[8];
 
+#if defined( FT_CONFIG_OPTION_USE_HARFBUZZ )         && \
+    defined( FT_CONFIG_OPTION_USE_HARFBUZZ_DYNAMIC )
+    ft_hb_funcs_t*  hb_funcs;
+#endif
+
   } AF_ModuleRec, *AF_Module;
 
 
diff --git a/src/java.desktop/share/native/libfreetype/src/autofit/afranges.c b/src/java.desktop/share/native/libfreetype/src/autofit/afranges.c
index 007b4328189..fd54948f3a5 100644
--- a/src/java.desktop/share/native/libfreetype/src/autofit/afranges.c
+++ b/src/java.desktop/share/native/libfreetype/src/autofit/afranges.c
@@ -4,7 +4,7 @@
  *
  *   Auto-fitter Unicode script ranges (body).
  *
- * Copyright (C) 2013-2024 by
+ * Copyright (C) 2013-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
@@ -73,9 +73,11 @@
   {
     AF_UNIRANGE_REC(  0x0600,  0x06FF ),  /* Arabic                                 */
     AF_UNIRANGE_REC(  0x0750,  0x07FF ),  /* Arabic Supplement                      */
+    AF_UNIRANGE_REC(  0x0870,  0x089F ),  /* Arabic Extended-B                      */
     AF_UNIRANGE_REC(  0x08A0,  0x08FF ),  /* Arabic Extended-A                      */
     AF_UNIRANGE_REC(  0xFB50,  0xFDFF ),  /* Arabic Presentation Forms-A            */
     AF_UNIRANGE_REC(  0xFE70,  0xFEFF ),  /* Arabic Presentation Forms-B            */
+    AF_UNIRANGE_REC( 0x10EC0, 0x10EFF ),  /* Arabic Extended-C                      */
     AF_UNIRANGE_REC( 0x1EE00, 0x1EEFF ),  /* Arabic Mathematical Alphabetic Symbols */
     AF_UNIRANGE_REC(       0,       0 )
   };
@@ -90,8 +92,9 @@
     AF_UNIRANGE_REC(  0x06DF,  0x06E4 ),
     AF_UNIRANGE_REC(  0x06E7,  0x06E8 ),
     AF_UNIRANGE_REC(  0x06EA,  0x06ED ),
-    AF_UNIRANGE_REC(  0x08D4,  0x08E1 ),
-    AF_UNIRANGE_REC(  0x08D3,  0x08FF ),
+    AF_UNIRANGE_REC(  0x0897,  0x089F ),
+    AF_UNIRANGE_REC(  0x08CA,  0x08E1 ),
+    AF_UNIRANGE_REC(  0x08E3,  0x08FF ),
     AF_UNIRANGE_REC(  0xFBB2,  0xFBC1 ),
     AF_UNIRANGE_REC(  0xFE70,  0xFE70 ),
     AF_UNIRANGE_REC(  0xFE72,  0xFE72 ),
@@ -101,6 +104,7 @@
     AF_UNIRANGE_REC(  0xFE7A,  0xFE7A ),
     AF_UNIRANGE_REC(  0xFE7C,  0xFE7C ),
     AF_UNIRANGE_REC(  0xFE7E,  0xFE7E ),
+    AF_UNIRANGE_REC( 0x10EFD, 0x10EFF ),
     AF_UNIRANGE_REC(       0,       0 )
   };
 
@@ -198,8 +202,9 @@
 
   const AF_Script_UniRangeRec  af_cans_uniranges[] =
   {
-    AF_UNIRANGE_REC(  0x1400,  0x167F ), /* Unified Canadian Aboriginal Syllabics          */
-    AF_UNIRANGE_REC(  0x18B0,  0x18FF ), /* Unified Canadian Aboriginal Syllabics Extended */
+    AF_UNIRANGE_REC(  0x1400,  0x167F ), /* Unified Canadian Aboriginal Syllabics            */
+    AF_UNIRANGE_REC(  0x18B0,  0x18FF ), /* Unified Canadian Aboriginal Syllabics Extended   */
+    AF_UNIRANGE_REC( 0x11AB0, 0x11ABF ), /* Unified Canadian Aboriginal Syllabics Extended-A */
     AF_UNIRANGE_REC(       0,       0 )
   };
 
@@ -259,6 +264,9 @@
   };
 
 
+  /* TODO: Split off data for new 'cyrb' (subscript) and 'cyrp'     */
+  /*       (superscript) groups (mainly from the Extended-D block), */
+  /*       in analogy to 'latb' and 'latp'?                         */
   const AF_Script_UniRangeRec  af_cyrl_uniranges[] =
   {
     AF_UNIRANGE_REC(  0x0400,  0x04FF ),  /* Cyrillic            */
@@ -266,6 +274,7 @@
     AF_UNIRANGE_REC(  0x2DE0,  0x2DFF ),  /* Cyrillic Extended-A */
     AF_UNIRANGE_REC(  0xA640,  0xA69F ),  /* Cyrillic Extended-B */
     AF_UNIRANGE_REC(  0x1C80,  0x1C8F ),  /* Cyrillic Extended-C */
+    AF_UNIRANGE_REC( 0x1E030, 0x1E08F ),  /* Cyrillic Extended-D */
     AF_UNIRANGE_REC(       0,       0 )
   };
 
@@ -285,15 +294,16 @@
 
   const AF_Script_UniRangeRec  af_deva_uniranges[] =
   {
-    AF_UNIRANGE_REC(  0x0900,  0x093B ),  /* Devanagari          */
+    AF_UNIRANGE_REC(  0x0900,  0x093B ),  /* Devanagari            */
     /* omitting U+093C nukta */
-    AF_UNIRANGE_REC(  0x093D,  0x0950 ),  /* ... continued       */
+    AF_UNIRANGE_REC(  0x093D,  0x0950 ),  /* ... continued         */
     /* omitting U+0951 udatta, U+0952 anudatta */
-    AF_UNIRANGE_REC(  0x0953,  0x0963 ),  /* ... continued       */
+    AF_UNIRANGE_REC(  0x0953,  0x0963 ),  /* ... continued         */
     /* omitting U+0964 danda, U+0965 double danda */
-    AF_UNIRANGE_REC(  0x0966,  0x097F ),  /* ... continued       */
-    AF_UNIRANGE_REC(  0x20B9,  0x20B9 ),  /* (new) Rupee sign    */
-    AF_UNIRANGE_REC(  0xA8E0,  0xA8FF ),  /* Devanagari Extended */
+    AF_UNIRANGE_REC(  0x0966,  0x097F ),  /* ... continued         */
+    AF_UNIRANGE_REC(  0x20B9,  0x20B9 ),  /* (new) Rupee sign      */
+    AF_UNIRANGE_REC(  0xA8E0,  0xA8FF ),  /* Devanagari Extended   */
+    AF_UNIRANGE_REC( 0x11B00, 0x11B5F ),  /* Devanagari Extended-A */
     AF_UNIRANGE_REC(       0,       0 )
   };
 
@@ -329,6 +339,7 @@
     AF_UNIRANGE_REC(  0x1380,  0x139F ),  /* Ethiopic Supplement */
     AF_UNIRANGE_REC(  0x2D80,  0x2DDF ),  /* Ethiopic Extended   */
     AF_UNIRANGE_REC(  0xAB00,  0xAB2F ),  /* Ethiopic Extended-A */
+    AF_UNIRANGE_REC( 0x1E7E0, 0x1E7FF ),  /* Ethiopic Extended-B */
     AF_UNIRANGE_REC(       0,       0 )
   };
 
@@ -534,7 +545,7 @@
   {
     AF_UNIRANGE_REC(  0x0EB1,  0x0EB1 ),
     AF_UNIRANGE_REC(  0x0EB4,  0x0EBC ),
-    AF_UNIRANGE_REC(  0x0EC8,  0x0ECD ),
+    AF_UNIRANGE_REC(  0x0EC8,  0x0ECE ),
     AF_UNIRANGE_REC(       0,       0 )
   };
 
@@ -567,12 +578,15 @@
     AF_UNIRANGE_REC(  0x2C7E,  0x2C7F ),  /* ... continued                          */
     AF_UNIRANGE_REC(  0x2E00,  0x2E7F ),  /* Supplemental Punctuation               */
     AF_UNIRANGE_REC(  0xA720,  0xA76F ),  /* Latin Extended-D                       */
-    AF_UNIRANGE_REC(  0xA771,  0xA7F7 ),  /* ... continued                          */
+    AF_UNIRANGE_REC(  0xA771,  0xA7F0 ),  /* ... continued                          */
+    AF_UNIRANGE_REC(  0xA7F2,  0xA7F7 ),  /* ... continued                          */
     AF_UNIRANGE_REC(  0xA7FA,  0xA7FF ),  /* ... continued                          */
     AF_UNIRANGE_REC(  0xAB30,  0xAB5B ),  /* Latin Extended-E                       */
-    AF_UNIRANGE_REC(  0xAB60,  0xAB6F ),  /* ... continued                          */
+    AF_UNIRANGE_REC(  0xAB60,  0xAB68 ),  /* ... continued                          */
+    AF_UNIRANGE_REC(  0xAB6A,  0xAB6F ),  /* ... continued                          */
     AF_UNIRANGE_REC(  0xFB00,  0xFB06 ),  /* Alphab. Present. Forms (Latin Ligs)    */
     AF_UNIRANGE_REC( 0x1D400, 0x1D7FF ),  /* Mathematical Alphanumeric Symbols      */
+    AF_UNIRANGE_REC( 0x1DF00, 0x1DFFF ),  /* Latin Extended-G                       */
     AF_UNIRANGE_REC(       0,       0 )
   };
 
@@ -588,7 +602,7 @@
     AF_UNIRANGE_REC(  0x02B9,  0x02DF ),
     AF_UNIRANGE_REC(  0x02E5,  0x02FF ),
     AF_UNIRANGE_REC(  0x0300,  0x036F ),
-    AF_UNIRANGE_REC(  0x1AB0,  0x1ABE ),
+    AF_UNIRANGE_REC(  0x1AB0,  0x1AEB ),
     AF_UNIRANGE_REC(  0x1DC0,  0x1DFF ),
     AF_UNIRANGE_REC(  0x2017,  0x2017 ),
     AF_UNIRANGE_REC(  0x203E,  0x203E ),
@@ -625,8 +639,11 @@
     AF_UNIRANGE_REC(  0x2070,  0x207F ),  /* superscript digits and letters      */
     AF_UNIRANGE_REC(  0x2C7D,  0x2C7D ),  /* modifier letter capital v           */
     AF_UNIRANGE_REC(  0xA770,  0xA770 ),  /* modifier letter us                  */
+    AF_UNIRANGE_REC(  0xA7F1,  0xA7F1 ),  /* modifier letter capital s           */
     AF_UNIRANGE_REC(  0xA7F8,  0xA7F9 ),  /* more modifier letters               */
     AF_UNIRANGE_REC(  0xAB5C,  0xAB5F ),  /* more modifier letters               */
+    AF_UNIRANGE_REC(  0xAB69,  0xAB69 ),  /* modifier letter small turned w      */
+    AF_UNIRANGE_REC( 0x10780, 0x107FB ),  /* Latin Extended-F                    */
     AF_UNIRANGE_REC(       0,       0 )
   };
 
@@ -638,7 +655,8 @@
 
   const AF_Script_UniRangeRec  af_lisu_uniranges[] =
   {
-    AF_UNIRANGE_REC(  0xA4D0,  0xA4FF ),    /* Lisu */
+    AF_UNIRANGE_REC(  0xA4D0,  0xA4FF ),    /* Lisu            */
+    AF_UNIRANGE_REC( 0x11FB0, 0x11FBF ),    /* Lisu Supplement */
     AF_UNIRANGE_REC(       0,       0 )
   };
 
@@ -696,6 +714,7 @@
     AF_UNIRANGE_REC(  0x1000,  0x109F ),    /* Myanmar            */
     AF_UNIRANGE_REC(  0xA9E0,  0xA9FF ),    /* Myanmar Extended-B */
     AF_UNIRANGE_REC(  0xAA60,  0xAA7F ),    /* Myanmar Extended-A */
+    AF_UNIRANGE_REC( 0x116D0, 0x116FF ),    /* Myanmar Extended-C */
     AF_UNIRANGE_REC(       0,       0 )
   };
 
@@ -836,6 +855,7 @@
 
   const AF_Script_UniRangeRec  af_sinh_nonbase_uniranges[] =
   {
+    AF_UNIRANGE_REC(  0x0D81,  0x0D81 ),
     AF_UNIRANGE_REC(  0x0DCA,  0x0DCA ),
     AF_UNIRANGE_REC(  0x0DD2,  0x0DD6 ),
     AF_UNIRANGE_REC(       0,       0 )
@@ -859,7 +879,8 @@
 
   const AF_Script_UniRangeRec  af_taml_uniranges[] =
   {
-    AF_UNIRANGE_REC(  0x0B80,  0x0BFF ),  /* Tamil */
+    AF_UNIRANGE_REC(  0x0B80,  0x0BFF ),  /* Tamil            */
+    AF_UNIRANGE_REC( 0x11FC0, 0x11FFF ),  /* Tamil Supplement */
     AF_UNIRANGE_REC(       0,       0 )
   };
 
@@ -899,6 +920,7 @@
   {
     AF_UNIRANGE_REC(  0x0C00,  0x0C00 ),
     AF_UNIRANGE_REC(  0x0C04,  0x0C04 ),
+    AF_UNIRANGE_REC(  0x0C3C,  0x0C3C ),
     AF_UNIRANGE_REC(  0x0C3E,  0x0C40 ),
     AF_UNIRANGE_REC(  0x0C46,  0x0C56 ),
     AF_UNIRANGE_REC(  0x0C62,  0x0C63 ),
@@ -992,6 +1014,7 @@
     AF_UNIRANGE_REC(  0xA806,  0xA806 ),
     AF_UNIRANGE_REC(  0xA80B,  0xA80B ),
     AF_UNIRANGE_REC(  0xA825,  0xA826 ),
+    AF_UNIRANGE_REC(  0xA82C,  0xA82C ),
     AF_UNIRANGE_REC(       0,       0 )
   };
 
@@ -1048,15 +1071,21 @@
     AF_UNIRANGE_REC(  0xFE10,  0xFE1F ),  /* Vertical forms                          */
     AF_UNIRANGE_REC(  0xFE30,  0xFE4F ),  /* CJK Compatibility Forms                 */
     AF_UNIRANGE_REC(  0xFF00,  0xFFEF ),  /* Halfwidth and Fullwidth Forms           */
+    AF_UNIRANGE_REC( 0x1AFF0, 0x1AFFF ),  /* Kana Extended-B                         */
     AF_UNIRANGE_REC( 0x1B000, 0x1B0FF ),  /* Kana Supplement                         */
     AF_UNIRANGE_REC( 0x1B100, 0x1B12F ),  /* Kana Extended-A                         */
+    AF_UNIRANGE_REC( 0x1B130, 0x1B16F ),  /* Small Kana Extension                    */
     AF_UNIRANGE_REC( 0x1D300, 0x1D35F ),  /* Tai Xuan Hing Symbols                   */
     AF_UNIRANGE_REC( 0x20000, 0x2A6DF ),  /* CJK Unified Ideographs Extension B      */
     AF_UNIRANGE_REC( 0x2A700, 0x2B73F ),  /* CJK Unified Ideographs Extension C      */
     AF_UNIRANGE_REC( 0x2B740, 0x2B81F ),  /* CJK Unified Ideographs Extension D      */
     AF_UNIRANGE_REC( 0x2B820, 0x2CEAF ),  /* CJK Unified Ideographs Extension E      */
     AF_UNIRANGE_REC( 0x2CEB0, 0x2EBEF ),  /* CJK Unified Ideographs Extension F      */
+    AF_UNIRANGE_REC( 0x2EBF0, 0x2EE5D ),  /* CJK Unified Ideographs Extension I      */
     AF_UNIRANGE_REC( 0x2F800, 0x2FA1F ),  /* CJK Compatibility Ideographs Supplement */
+    AF_UNIRANGE_REC( 0x30000, 0x3134A ),  /* CJK Unified Ideographs Extension G      */
+    AF_UNIRANGE_REC( 0x31350, 0x323AF ),  /* CJK Unified Ideographs Extension H      */
+    AF_UNIRANGE_REC( 0x323B0, 0x33479 ),  /* CJK Unified Ideographs Extension J      */
     AF_UNIRANGE_REC(       0,       0 )
   };
 
diff --git a/src/java.desktop/share/native/libfreetype/src/autofit/afranges.h b/src/java.desktop/share/native/libfreetype/src/autofit/afranges.h
index 813b3ee78ef..fa00eb75046 100644
--- a/src/java.desktop/share/native/libfreetype/src/autofit/afranges.h
+++ b/src/java.desktop/share/native/libfreetype/src/autofit/afranges.h
@@ -4,7 +4,7 @@
  *
  *   Auto-fitter Unicode script ranges (specification).
  *
- * Copyright (C) 2013-2024 by
+ * Copyright (C) 2013-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/autofit/afscript.h b/src/java.desktop/share/native/libfreetype/src/autofit/afscript.h
index 0a83d771501..5c4cbbcb922 100644
--- a/src/java.desktop/share/native/libfreetype/src/autofit/afscript.h
+++ b/src/java.desktop/share/native/libfreetype/src/autofit/afscript.h
@@ -4,7 +4,7 @@
  *
  *   Auto-fitter scripts (specification only).
  *
- * Copyright (C) 2013-2024 by
+ * Copyright (C) 2013-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/autofit/afshaper.c b/src/java.desktop/share/native/libfreetype/src/autofit/afshaper.c
index df0f46ada89..f3c0744fd9d 100644
--- a/src/java.desktop/share/native/libfreetype/src/autofit/afshaper.c
+++ b/src/java.desktop/share/native/libfreetype/src/autofit/afshaper.c
@@ -4,7 +4,7 @@
  *
  *   HarfBuzz interface for accessing OpenType features (body).
  *
- * Copyright (C) 2013-2024 by
+ * Copyright (C) 2013-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
@@ -22,8 +22,8 @@
 #include "aftypes.h"
 #include "afshaper.h"
 
-#ifdef FT_CONFIG_OPTION_USE_HARFBUZZ
 
+#ifdef FT_CONFIG_OPTION_USE_HARFBUZZ
 
   /**************************************************************************
    *
@@ -89,17 +89,18 @@
 #define SCRIPT( s, S, d, h, H, ss )  h,
 
 
-  static const hb_script_t  scripts[] =
+  FT_LOCAL_ARRAY_DEF( hb_script_t )
+  af_hb_scripts[] =
   {
 #include "afscript.h"
   };
 
 
-  FT_Error
-  af_shaper_get_coverage( AF_FaceGlobals  globals,
-                          AF_StyleClass   style_class,
-                          FT_UShort*      gstyles,
-                          FT_Bool         default_script )
+  static FT_Error
+  af_shaper_get_coverage_hb( AF_FaceGlobals  globals,
+                             AF_StyleClass   style_class,
+                             FT_UShort*      gstyles,
+                             FT_Bool         default_script )
   {
     hb_face_t*  face;
 
@@ -124,10 +125,10 @@
     if ( !globals || !style_class || !gstyles )
       return FT_THROW( Invalid_Argument );
 
-    face = hb_font_get_face( globals->hb_font );
+    face = hb( font_get_face )( globals->hb_font );
 
     coverage_tags = coverages[style_class->coverage];
-    script        = scripts[style_class->script];
+    script        = af_hb_scripts[style_class->script];
 
     /* Convert a HarfBuzz script tag into the corresponding OpenType */
     /* tag or tags -- some Indic scripts like Devanagari have an old */
@@ -137,19 +138,19 @@
       hb_tag_t      tags[3];
 
 
-      hb_ot_tags_from_script_and_language( script,
-                                           HB_LANGUAGE_INVALID,
-                                           &tags_count,
-                                           tags,
-                                           NULL,
-                                           NULL );
+      hb( ot_tags_from_script_and_language )( script,
+                                              HB_LANGUAGE_INVALID,
+                                              &tags_count,
+                                              tags,
+                                              NULL,
+                                              NULL );
       script_tags[0] = tags_count > 0 ? tags[0] : HB_TAG_NONE;
       script_tags[1] = tags_count > 1 ? tags[1] : HB_TAG_NONE;
       script_tags[2] = tags_count > 2 ? tags[2] : HB_TAG_NONE;
     }
 
-    /* If the second tag is HB_OT_TAG_DEFAULT_SCRIPT, change that to     */
-    /* HB_TAG_NONE except for the default script.                        */
+    /* If the second tag is HB_OT_TAG_DEFAULT_SCRIPT, change that to */
+    /* HB_TAG_NONE except for the default script.                    */
     if ( default_script )
     {
       if ( script_tags[0] == HB_TAG_NONE )
@@ -170,15 +171,15 @@
         goto Exit;
     }
 
-    gsub_lookups = hb_set_create();
-    hb_ot_layout_collect_lookups( face,
-                                  HB_OT_TAG_GSUB,
-                                  script_tags,
-                                  NULL,
-                                  coverage_tags,
-                                  gsub_lookups );
+    gsub_lookups = hb( set_create )();
+    hb( ot_layout_collect_lookups )( face,
+                                     HB_OT_TAG_GSUB,
+                                     script_tags,
+                                     NULL,
+                                     coverage_tags,
+                                     gsub_lookups );
 
-    if ( hb_set_is_empty( gsub_lookups ) )
+    if ( hb( set_is_empty )( gsub_lookups ) )
       goto Exit; /* nothing to do */
 
     FT_TRACE4(( "GSUB lookups (style `%s'):\n",
@@ -189,22 +190,22 @@
     count = 0;
 #endif
 
-    gsub_glyphs = hb_set_create();
-    for ( idx = HB_SET_VALUE_INVALID; hb_set_next( gsub_lookups, &idx ); )
+    gsub_glyphs = hb( set_create )();
+    for ( idx = HB_SET_VALUE_INVALID; hb( set_next )( gsub_lookups, &idx ); )
     {
 #ifdef FT_DEBUG_LEVEL_TRACE
-      FT_TRACE4(( " %d", idx ));
+      FT_TRACE4(( " %u", idx ));
       count++;
 #endif
 
       /* get output coverage of GSUB feature */
-      hb_ot_layout_lookup_collect_glyphs( face,
-                                          HB_OT_TAG_GSUB,
-                                          idx,
-                                          NULL,
-                                          NULL,
-                                          NULL,
-                                          gsub_glyphs );
+      hb( ot_layout_lookup_collect_glyphs )( face,
+                                             HB_OT_TAG_GSUB,
+                                             idx,
+                                             NULL,
+                                             NULL,
+                                             NULL,
+                                             gsub_glyphs );
     }
 
 #ifdef FT_DEBUG_LEVEL_TRACE
@@ -218,34 +219,34 @@
                 af_style_names[style_class->style] ));
     FT_TRACE4(( " " ));
 
-    gpos_lookups = hb_set_create();
-    hb_ot_layout_collect_lookups( face,
-                                  HB_OT_TAG_GPOS,
-                                  script_tags,
-                                  NULL,
-                                  coverage_tags,
-                                  gpos_lookups );
+    gpos_lookups = hb( set_create )();
+    hb( ot_layout_collect_lookups )( face,
+                                     HB_OT_TAG_GPOS,
+                                     script_tags,
+                                     NULL,
+                                     coverage_tags,
+                                     gpos_lookups );
 
 #ifdef FT_DEBUG_LEVEL_TRACE
     count = 0;
 #endif
 
-    gpos_glyphs = hb_set_create();
-    for ( idx = HB_SET_VALUE_INVALID; hb_set_next( gpos_lookups, &idx ); )
+    gpos_glyphs = hb( set_create )();
+    for ( idx = HB_SET_VALUE_INVALID; hb( set_next )( gpos_lookups, &idx ); )
     {
 #ifdef FT_DEBUG_LEVEL_TRACE
-      FT_TRACE4(( " %d", idx ));
+      FT_TRACE4(( " %u", idx ));
       count++;
 #endif
 
       /* get input coverage of GPOS feature */
-      hb_ot_layout_lookup_collect_glyphs( face,
-                                          HB_OT_TAG_GPOS,
-                                          idx,
-                                          NULL,
-                                          gpos_glyphs,
-                                          NULL,
-                                          NULL );
+      hb( ot_layout_lookup_collect_glyphs )( face,
+                                             HB_OT_TAG_GPOS,
+                                             idx,
+                                             NULL,
+                                             gpos_glyphs,
+                                             NULL,
+                                             NULL );
     }
 
 #ifdef FT_DEBUG_LEVEL_TRACE
@@ -281,14 +282,14 @@
 
           GET_UTF8_CHAR( ch, p );
 
-          for ( idx = HB_SET_VALUE_INVALID; hb_set_next( gsub_lookups,
-                                                         &idx ); )
+          for ( idx = HB_SET_VALUE_INVALID; hb( set_next )( gsub_lookups,
+                                                            &idx ); )
           {
             hb_codepoint_t  gidx = FT_Get_Char_Index( globals->face, ch );
 
 
-            if ( hb_ot_layout_lookup_would_substitute( face, idx,
-                                                       &gidx, 1, 1 ) )
+            if ( hb( ot_layout_lookup_would_substitute )( face, idx,
+                                                          &gidx, 1, 1 ) )
             {
               found = 1;
               break;
@@ -352,14 +353,14 @@
      *
      */
     if ( style_class->coverage != AF_COVERAGE_DEFAULT )
-      hb_set_subtract( gsub_glyphs, gpos_glyphs );
+      hb( set_subtract )( gsub_glyphs, gpos_glyphs );
 
 #ifdef FT_DEBUG_LEVEL_TRACE
     FT_TRACE4(( "  glyphs without GPOS data (`*' means already assigned)" ));
     count = 0;
 #endif
 
-    for ( idx = HB_SET_VALUE_INVALID; hb_set_next( gsub_glyphs, &idx ); )
+    for ( idx = HB_SET_VALUE_INVALID; hb( set_next )( gsub_glyphs, &idx ); )
     {
 #ifdef FT_DEBUG_LEVEL_TRACE
       if ( !( count % 10 ) )
@@ -368,7 +369,7 @@
         FT_TRACE4(( "   " ));
       }
 
-      FT_TRACE4(( " %d", idx ));
+      FT_TRACE4(( " %u", idx ));
       count++;
 #endif
 
@@ -397,10 +398,10 @@
 #endif
 
   Exit:
-    hb_set_destroy( gsub_lookups );
-    hb_set_destroy( gsub_glyphs  );
-    hb_set_destroy( gpos_lookups );
-    hb_set_destroy( gpos_glyphs  );
+    hb( set_destroy )( gsub_lookups );
+    hb( set_destroy )( gsub_glyphs  );
+    hb( set_destroy )( gpos_lookups );
+    hb( set_destroy )( gpos_glyphs  );
 
     return FT_Err_Ok;
   }
@@ -437,31 +438,33 @@
   };
 
 
-  void*
-  af_shaper_buf_create( FT_Face  face )
+  static void*
+  af_shaper_buf_create_hb( AF_FaceGlobals  globals )
   {
-    FT_UNUSED( face );
+    FT_UNUSED( globals );
 
-    return (void*)hb_buffer_create();
+    return (void*)hb( buffer_create )();
   }
 
 
-  void
-  af_shaper_buf_destroy( FT_Face  face,
-                         void*    buf )
+  static void
+  af_shaper_buf_destroy_hb( AF_FaceGlobals  globals,
+                            void*           buf )
   {
-    FT_UNUSED( face );
+    FT_UNUSED( globals );
 
-    hb_buffer_destroy( (hb_buffer_t*)buf );
+    hb( buffer_destroy )( (hb_buffer_t*)buf );
   }
 
 
-  const char*
-  af_shaper_get_cluster( const char*      p,
-                         AF_StyleMetrics  metrics,
-                         void*            buf_,
-                         unsigned int*    count )
+  static const char*
+  af_shaper_get_cluster_hb( const char*      p,
+                            AF_StyleMetrics  metrics,
+                            void*            buf_,
+                            unsigned int*    count )
   {
+    AF_FaceGlobals  globals = metrics->globals;
+
     AF_StyleClass        style_class;
     const hb_feature_t*  feature;
     FT_Int               upem;
@@ -472,6 +475,8 @@
     hb_font_t*      font;
     hb_codepoint_t  dummy;
 
+    FT_UNUSED( globals );
+
 
     upem        = (FT_Int)metrics->globals->face->units_per_EM;
     style_class = metrics->style_class;
@@ -480,7 +485,7 @@
     font = metrics->globals->hb_font;
 
     /* we shape at a size of units per EM; this means font units */
-    hb_font_set_scale( font, upem, upem );
+    hb( font_set_scale )( font, upem, upem );
 
     while ( *p == ' ' )
       p++;
@@ -492,15 +497,15 @@
     len = (int)( q - p );
 
     /* feed character(s) to the HarfBuzz buffer */
-    hb_buffer_clear_contents( buf );
-    hb_buffer_add_utf8( buf, p, len, 0, len );
+    hb( buffer_clear_contents )( buf );
+    hb( buffer_add_utf8 )( buf, p, len, 0, len );
 
     /* we let HarfBuzz guess the script and writing direction */
-    hb_buffer_guess_segment_properties( buf );
+    hb( buffer_guess_segment_properties )( buf );
 
     /* shape buffer, which means conversion from character codes to */
     /* glyph indices, possibly applying a feature                   */
-    hb_shape( font, buf, feature, feature ? 1 : 0 );
+    hb( shape )( font, buf, feature, feature ? 1 : 0 );
 
     if ( feature )
     {
@@ -517,13 +522,13 @@
       /* glyph indices; otherwise the affected glyph or glyphs aren't     */
       /* available at all in the feature                                  */
 
-      hb_buffer_clear_contents( hb_buf );
-      hb_buffer_add_utf8( hb_buf, p, len, 0, len );
-      hb_buffer_guess_segment_properties( hb_buf );
-      hb_shape( font, hb_buf, NULL, 0 );
+      hb( buffer_clear_contents )( hb_buf );
+      hb( buffer_add_utf8 )( hb_buf, p, len, 0, len );
+      hb( buffer_guess_segment_properties )( hb_buf );
+      hb( shape )( font, hb_buf, NULL, 0 );
 
-      ginfo    = hb_buffer_get_glyph_infos( buf, &gcount );
-      hb_ginfo = hb_buffer_get_glyph_infos( hb_buf, &hb_gcount );
+      ginfo    = hb( buffer_get_glyph_infos )( buf, &gcount );
+      hb_ginfo = hb( buffer_get_glyph_infos )( hb_buf, &hb_gcount );
 
       if ( gcount == hb_gcount )
       {
@@ -537,12 +542,12 @@
         if ( i == gcount )
         {
           /* both buffers have identical glyph indices */
-          hb_buffer_clear_contents( buf );
+          hb( buffer_clear_contents )( buf );
         }
       }
     }
 
-    *count = hb_buffer_get_length( buf );
+    *count = hb( buffer_get_length )( buf );
 
 #ifdef FT_DEBUG_LEVEL_TRACE
     if ( feature && *count > 1 )
@@ -554,23 +559,25 @@
   }
 
 
-  FT_ULong
-  af_shaper_get_elem( AF_StyleMetrics  metrics,
-                      void*            buf_,
-                      unsigned int     idx,
-                      FT_Long*         advance,
-                      FT_Long*         y_offset )
+  static FT_ULong
+  af_shaper_get_elem_hb( AF_StyleMetrics  metrics,
+                         void*            buf_,
+                         unsigned int     idx,
+                         FT_Long*         advance,
+                         FT_Long*         y_offset )
   {
+    AF_FaceGlobals  globals = metrics->globals;
+
     hb_buffer_t*          buf = (hb_buffer_t*)buf_;
     hb_glyph_info_t*      ginfo;
     hb_glyph_position_t*  gpos;
     unsigned int          gcount;
 
-    FT_UNUSED( metrics );
+    FT_UNUSED( globals );
 
 
-    ginfo = hb_buffer_get_glyph_infos( buf, &gcount );
-    gpos  = hb_buffer_get_glyph_positions( buf, &gcount );
+    ginfo = hb( buffer_get_glyph_infos )( buf, &gcount );
+    gpos  = hb( buffer_get_glyph_positions )( buf, &gcount );
 
     if ( idx >= gcount )
       return 0;
@@ -584,14 +591,14 @@
   }
 
 
-#else /* !FT_CONFIG_OPTION_USE_HARFBUZZ */
+#endif /* FT_CONFIG_OPTION_USE_HARFBUZZ */
 
 
-  FT_Error
-  af_shaper_get_coverage( AF_FaceGlobals  globals,
-                          AF_StyleClass   style_class,
-                          FT_UShort*      gstyles,
-                          FT_Bool         default_script )
+  static FT_Error
+  af_shaper_get_coverage_nohb( AF_FaceGlobals  globals,
+                               AF_StyleClass   style_class,
+                               FT_UShort*      gstyles,
+                               FT_Bool         default_script )
   {
     FT_UNUSED( globals );
     FT_UNUSED( style_class );
@@ -602,29 +609,29 @@
   }
 
 
-  void*
-  af_shaper_buf_create( FT_Face  face )
+  static void*
+  af_shaper_buf_create_nohb( AF_FaceGlobals  globals )
   {
-    FT_UNUSED( face );
+    FT_UNUSED( globals );
 
     return NULL;
   }
 
 
-  void
-  af_shaper_buf_destroy( FT_Face  face,
-                         void*    buf )
+  static void
+  af_shaper_buf_destroy_nohb( AF_FaceGlobals  globals,
+                              void*    buf )
   {
-    FT_UNUSED( face );
+    FT_UNUSED( globals );
     FT_UNUSED( buf );
   }
 
 
-  const char*
-  af_shaper_get_cluster( const char*      p,
-                         AF_StyleMetrics  metrics,
-                         void*            buf_,
-                         unsigned int*    count )
+  static const char*
+  af_shaper_get_cluster_nohb( const char*      p,
+                              AF_StyleMetrics  metrics,
+                              void*            buf_,
+                              unsigned int*    count )
   {
     FT_Face    face      = metrics->globals->face;
     FT_ULong   ch, dummy = 0;
@@ -656,12 +663,12 @@
   }
 
 
-  FT_ULong
-  af_shaper_get_elem( AF_StyleMetrics  metrics,
-                      void*            buf_,
-                      unsigned int     idx,
-                      FT_Long*         advance,
-                      FT_Long*         y_offset )
+  static FT_ULong
+  af_shaper_get_elem_nohb( AF_StyleMetrics  metrics,
+                           void*            buf_,
+                           unsigned int     idx,
+                           FT_Long*         advance,
+                           FT_Long*         y_offset )
   {
     FT_Face   face        = metrics->globals->face;
     FT_ULong  glyph_index = *(FT_ULong*)buf_;
@@ -684,7 +691,90 @@
   }
 
 
-#endif /* !FT_CONFIG_OPTION_USE_HARFBUZZ */
+  /********************************************************************/
+
+  FT_Error
+  af_shaper_get_coverage( AF_FaceGlobals  globals,
+                          AF_StyleClass   style_class,
+                          FT_UShort*      gstyles,
+                          FT_Bool         default_script )
+  {
+#ifdef FT_CONFIG_OPTION_USE_HARFBUZZ
+    if ( ft_hb_enabled( globals ) )
+      return af_shaper_get_coverage_hb( globals,
+                                        style_class,
+                                        gstyles,
+                                        default_script );
+    else
+#endif
+      return af_shaper_get_coverage_nohb( globals,
+                                          style_class,
+                                          gstyles,
+                                          default_script );
+  }
+
+
+  void*
+  af_shaper_buf_create( AF_FaceGlobals  globals )
+  {
+#ifdef FT_CONFIG_OPTION_USE_HARFBUZZ
+    if ( ft_hb_enabled( globals ) )
+      return af_shaper_buf_create_hb( globals );
+    else
+#endif
+      return af_shaper_buf_create_nohb( globals );
+  }
+
+
+  void
+  af_shaper_buf_destroy( AF_FaceGlobals  globals,
+                         void*           buf )
+  {
+#ifdef FT_CONFIG_OPTION_USE_HARFBUZZ
+    if ( ft_hb_enabled( globals ) )
+      af_shaper_buf_destroy_hb( globals, buf );
+    else
+#endif
+      af_shaper_buf_destroy_nohb( globals, buf );
+  }
+
+
+  const char*
+  af_shaper_get_cluster( const char*      p,
+                         AF_StyleMetrics  metrics,
+                         void*            buf_,
+                         unsigned int*    count )
+  {
+#ifdef FT_CONFIG_OPTION_USE_HARFBUZZ
+    if ( ft_hb_enabled( metrics->globals ) )
+      return af_shaper_get_cluster_hb( p, metrics, buf_, count );
+    else
+#endif
+      return af_shaper_get_cluster_nohb( p, metrics, buf_, count );
+  }
+
+
+  FT_ULong
+  af_shaper_get_elem( AF_StyleMetrics  metrics,
+                      void*            buf_,
+                      unsigned int     idx,
+                      FT_Long*         advance,
+                      FT_Long*         y_offset )
+  {
+#ifdef FT_CONFIG_OPTION_USE_HARFBUZZ
+    if ( ft_hb_enabled( metrics->globals ) )
+      return af_shaper_get_elem_hb( metrics,
+                                    buf_,
+                                    idx,
+                                    advance,
+                                    y_offset );
+#endif
+      return af_shaper_get_elem_nohb( metrics,
+                                      buf_,
+                                      idx,
+                                      advance,
+                                      y_offset );
+  }
 
 
 /* END */
diff --git a/src/java.desktop/share/native/libfreetype/src/autofit/afshaper.h b/src/java.desktop/share/native/libfreetype/src/autofit/afshaper.h
index 2eb03bb5d98..757368fc9c0 100644
--- a/src/java.desktop/share/native/libfreetype/src/autofit/afshaper.h
+++ b/src/java.desktop/share/native/libfreetype/src/autofit/afshaper.h
@@ -4,7 +4,7 @@
  *
  *   HarfBuzz interface for accessing OpenType features (specification).
  *
- * Copyright (C) 2013-2024 by
+ * Copyright (C) 2013-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
@@ -23,17 +23,14 @@
 #include <freetype/freetype.h>
 
 
+FT_BEGIN_HEADER
+
 #ifdef FT_CONFIG_OPTION_USE_HARFBUZZ
-
-#include <hb.h>
-#include <hb-ot.h>
-#include "ft-hb.h"
-
+  FT_LOCAL_ARRAY( hb_script_t )
+  af_hb_scripts[];
 #endif
 
 
-FT_BEGIN_HEADER
-
   FT_Error
   af_shaper_get_coverage( AF_FaceGlobals  globals,
                           AF_StyleClass   style_class,
@@ -42,11 +39,11 @@ FT_BEGIN_HEADER
 
 
   void*
-  af_shaper_buf_create( FT_Face  face );
+  af_shaper_buf_create( AF_FaceGlobals  globals );
 
   void
-  af_shaper_buf_destroy( FT_Face  face,
-                         void*    buf );
+  af_shaper_buf_destroy( AF_FaceGlobals  globals,
+                         void*           buf );
 
   const char*
   af_shaper_get_cluster( const char*      p,
diff --git a/src/java.desktop/share/native/libfreetype/src/autofit/afstyles.h b/src/java.desktop/share/native/libfreetype/src/autofit/afstyles.h
index 7a33f37a856..206232efe25 100644
--- a/src/java.desktop/share/native/libfreetype/src/autofit/afstyles.h
+++ b/src/java.desktop/share/native/libfreetype/src/autofit/afstyles.h
@@ -4,7 +4,7 @@
  *
  *   Auto-fitter styles (specification only).
  *
- * Copyright (C) 2013-2024 by
+ * Copyright (C) 2013-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
@@ -50,36 +50,36 @@
                  AF_COVERAGE_ ## C )
 
 #undef  META_STYLE_LATIN
-#define META_STYLE_LATIN( s, S, ds )                     \
-          STYLE_LATIN( s, S, c2cp, C2CP, ds,             \
+#define META_STYLE_LATIN( s, S, ds )                    \
+          STYLE_LATIN( s, S, c2cp, C2CP, ds,            \
                        "petite capitals from capitals", \
-                       PETITE_CAPITALS_FROM_CAPITALS )   \
-          STYLE_LATIN( s, S, c2sc, C2SC, ds,             \
+                       PETITE_CAPITALS_FROM_CAPITALS )  \
+          STYLE_LATIN( s, S, c2sc, C2SC, ds,            \
                        "small capitals from capitals",  \
-                       SMALL_CAPITALS_FROM_CAPITALS )    \
-          STYLE_LATIN( s, S, ordn, ORDN, ds,             \
-                       "ordinals",                       \
-                       ORDINALS )                        \
-          STYLE_LATIN( s, S, pcap, PCAP, ds,             \
-                       "petite capitals",                \
-                       PETITE_CAPITALS )                 \
-          STYLE_LATIN( s, S, sinf, SINF, ds,             \
-                       "scientific inferiors",           \
-                       SCIENTIFIC_INFERIORS )            \
-          STYLE_LATIN( s, S, smcp, SMCP, ds,             \
-                       "small capitals",                 \
-                       SMALL_CAPITALS )                  \
-          STYLE_LATIN( s, S, subs, SUBS, ds,             \
-                       "subscript",                      \
-                       SUBSCRIPT )                       \
-          STYLE_LATIN( s, S, sups, SUPS, ds,             \
-                       "superscript",                    \
-                       SUPERSCRIPT )                     \
-          STYLE_LATIN( s, S, titl, TITL, ds,             \
-                       "titling",                        \
-                       TITLING )                         \
-          STYLE_LATIN( s, S, dflt, DFLT, ds,             \
-                       "default",                        \
+                       SMALL_CAPITALS_FROM_CAPITALS )   \
+          STYLE_LATIN( s, S, ordn, ORDN, ds,            \
+                       "ordinals",                      \
+                       ORDINALS )                       \
+          STYLE_LATIN( s, S, pcap, PCAP, ds,            \
+                       "petite capitals",               \
+                       PETITE_CAPITALS )                \
+          STYLE_LATIN( s, S, sinf, SINF, ds,            \
+                       "scientific inferiors",          \
+                       SCIENTIFIC_INFERIORS )           \
+          STYLE_LATIN( s, S, smcp, SMCP, ds,            \
+                       "small capitals",                \
+                       SMALL_CAPITALS )                 \
+          STYLE_LATIN( s, S, subs, SUBS, ds,            \
+                       "subscript",                     \
+                       SUBSCRIPT )                      \
+          STYLE_LATIN( s, S, sups, SUPS, ds,            \
+                       "superscript",                   \
+                       SUPERSCRIPT )                    \
+          STYLE_LATIN( s, S, titl, TITL, ds,            \
+                       "titling",                       \
+                       TITLING )                        \
+          STYLE_LATIN( s, S, dflt, DFLT, ds,            \
+                       "default",                       \
                        DEFAULT )
 
 
diff --git a/src/java.desktop/share/native/libfreetype/src/autofit/aftypes.h b/src/java.desktop/share/native/libfreetype/src/autofit/aftypes.h
index 27e4185e9f8..959640a12ec 100644
--- a/src/java.desktop/share/native/libfreetype/src/autofit/aftypes.h
+++ b/src/java.desktop/share/native/libfreetype/src/autofit/aftypes.h
@@ -4,7 +4,7 @@
  *
  *   Auto-fitter types (specification only).
  *
- * Copyright (C) 2003-2024 by
+ * Copyright (C) 2003-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
@@ -35,6 +35,7 @@
 
 #include <freetype/freetype.h>
 #include <freetype/ftoutln.h>
+#include <freetype/internal/fthash.h>
 #include <freetype/internal/ftobjs.h>
 #include <freetype/internal/ftdebug.h>
 
@@ -406,6 +407,7 @@ extern void*  af_debug_hints_;
 
   typedef struct AF_FaceGlobalsRec_*  AF_FaceGlobals;
 
+
   /* This is the main structure that combines everything.  Autofit modules */
   /* specific to writing systems derive their structures from it, for      */
   /* example `AF_LatinMetrics'.                                            */
@@ -418,6 +420,8 @@ extern void*  af_debug_hints_;
 
     AF_FaceGlobals  globals;    /* to access properties */
 
+    FT_Hash  reverse_charmap;
+
   } AF_StyleMetricsRec;
 
 
diff --git a/src/java.desktop/share/native/libfreetype/src/autofit/afws-decl.h b/src/java.desktop/share/native/libfreetype/src/autofit/afws-decl.h
index b78745af74e..12fa7a27a2b 100644
--- a/src/java.desktop/share/native/libfreetype/src/autofit/afws-decl.h
+++ b/src/java.desktop/share/native/libfreetype/src/autofit/afws-decl.h
@@ -4,7 +4,7 @@
  *
  *   Auto-fitter writing system declarations (specification only).
  *
- * Copyright (C) 2013-2024 by
+ * Copyright (C) 2013-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/autofit/afws-iter.h b/src/java.desktop/share/native/libfreetype/src/autofit/afws-iter.h
index c86d609a352..1752697b375 100644
--- a/src/java.desktop/share/native/libfreetype/src/autofit/afws-iter.h
+++ b/src/java.desktop/share/native/libfreetype/src/autofit/afws-iter.h
@@ -4,7 +4,7 @@
  *
  *   Auto-fitter writing systems iterator (specification only).
  *
- * Copyright (C) 2013-2024 by
+ * Copyright (C) 2013-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/autofit/ft-hb.c b/src/java.desktop/share/native/libfreetype/src/autofit/ft-hb.c
new file mode 100644
index 00000000000..3c145d04640
--- /dev/null
+++ b/src/java.desktop/share/native/libfreetype/src/autofit/ft-hb.c
@@ -0,0 +1,197 @@
+/****************************************************************************
+ *
+ * ft-hb.c
+ *
+ *   FreeType-HarfBuzz bridge (body).
+ *
+ * Copyright (C) 2025 by
+ * Behdad Esfahbod.
+ *
+ * This file is part of the FreeType project, and may only be used,
+ * modified, and distributed under the terms of the FreeType project
+ * license, LICENSE.TXT.  By continuing to use, modify, or distribute
+ * this file you indicate that you have read the license and
+ * understand and accept it fully.
+ *
+ */
+
+
+#if !defined( _WIN32 ) && !defined( _GNU_SOURCE )
+#  define _GNU_SOURCE  1  /* for RTLD_DEFAULT */
+#endif
+
+#include <freetype/freetype.h>
+#include <freetype/internal/ftmemory.h>
+
+#include "afglobal.h"
+
+#include "ft-hb.h"
+
+
+#if defined( FT_CONFIG_OPTION_USE_HARFBUZZ )         && \
+    defined( FT_CONFIG_OPTION_USE_HARFBUZZ_DYNAMIC )
+
+#ifndef FT_LIBHARFBUZZ
+#  ifdef _WIN32
+#    define FT_LIBHARFBUZZ "libharfbuzz-0.dll"
+#  else
+#    ifdef __APPLE__
+#      define FT_LIBHARFBUZZ "libharfbuzz.0.dylib"
+#    else
+#      define FT_LIBHARFBUZZ "libharfbuzz.so.0"
+#    endif
+#  endif
+#endif
+
+#ifdef _WIN32
+
+#  include <windows.h>
+
+#else /* !_WIN32 */
+
+#  include <dlfcn.h>
+
+  /* The GCC pragma suppresses the warning "ISO C forbids     */
+  /* assignment between function pointer and 'void *'", which */
+  /* inevitably gets emitted with `-Wpedantic`; see the man   */
+  /* page of function `dlsym` for more information.           */
+#  if defined( __GNUC__ )
+#    pragma GCC diagnostic push
+#    ifndef __cplusplus
+#      pragma GCC diagnostic ignored "-Wpedantic"
+#    endif
+#  endif
+
+#endif /* !_WIN32 */
+
+
+  FT_LOCAL_DEF( void )
+  ft_hb_funcs_init( struct AF_ModuleRec_  *af_module )
+  {
+    FT_Memory  memory = af_module->root.memory;
+    FT_Error   error;
+
+    ft_hb_funcs_t                *funcs           = NULL;
+    ft_hb_version_atleast_func_t  version_atleast = NULL;
+
+#ifdef _WIN32
+    HANDLE  lib;
+#  define DLSYM( lib, name ) \
+            (ft_ ## name ## _func_t)GetProcAddress( lib, #name )
+#else
+    void  *lib;
+#  define DLSYM( lib, name ) \
+            (ft_ ## name ## _func_t)dlsym( lib, #name )
+#endif
+
+
+    af_module->hb_funcs = NULL;
+
+    if ( FT_NEW( funcs ) )
+      return;
+    FT_ZERO( funcs );
+
+#ifdef _WIN32
+
+    lib = LoadLibraryA( FT_LIBHARFBUZZ );
+    if ( !lib )
+      goto Fail;
+    version_atleast = DLSYM( lib, hb_version_atleast );
+
+#else /* !_WIN32 */
+
+#  ifdef RTLD_DEFAULT
+#    define FT_RTLD_FLAGS RTLD_LAZY | RTLD_GLOBAL
+    lib             = RTLD_DEFAULT;
+    version_atleast = DLSYM( lib, hb_version_atleast );
+#  else
+#    define FT_RTLD_FLAGS RTLD_LAZY
+#  endif
+
+    if ( !version_atleast )
+    {
+      /* Load the HarfBuzz library.
+       *
+       * We never close the library, since we opened it with RTLD_GLOBAL.
+       * This is important for the case where we are using HarfBuzz as a
+       * shared library, and we want to use the symbols from the library in
+       * other shared libraries or clients.  HarfBuzz holds onto global
+       * variables, and closing the library will cause them to be
+       * invalidated.
+       */
+      lib = dlopen( FT_LIBHARFBUZZ, FT_RTLD_FLAGS );
+      if ( !lib )
+        goto Fail;
+      version_atleast = DLSYM( lib, hb_version_atleast );
+    }
+
+#endif /* !_WIN32 */
+
+    if ( !version_atleast )
+      goto Fail;
+
+    /* Load all symbols we use. */
+#define HB_EXTERN( ret, name, args )  \
+  {                                   \
+    funcs->name = DLSYM( lib, name ); \
+    if ( !funcs->name )               \
+      goto Fail;                      \
+  }
+#include "ft-hb-decls.h"
+#undef HB_EXTERN
+
+#undef DLSYM
+
+    af_module->hb_funcs = funcs;
+    return;
+
+  Fail:
+    if ( funcs )
+      FT_FREE( funcs );
+  }
+
+
+  FT_LOCAL_DEF( void )
+  ft_hb_funcs_done( struct AF_ModuleRec_  *af_module )
+  {
+    FT_Memory  memory = af_module->root.memory;
+
+
+    if ( af_module->hb_funcs )
+    {
+      FT_FREE( af_module->hb_funcs );
+      af_module->hb_funcs = NULL;
+    }
+  }
+
+
+  FT_LOCAL_DEF( FT_Bool )
+  ft_hb_enabled( struct AF_FaceGlobalsRec_  *globals )
+  {
+    return globals->module->hb_funcs != NULL;
+  }
+
+#ifndef _WIN32
+#  if defined( __GNUC__ )
+#    pragma GCC diagnostic pop
+#  endif
+#endif
+
+#else /* !FT_CONFIG_OPTION_USE_HARFBUZZ_DYNAMIC */
+
+  FT_LOCAL_DEF( FT_Bool )
+  ft_hb_enabled( struct AF_FaceGlobalsRec_  *globals )
+  {
+    FT_UNUSED( globals );
+
+#ifdef FT_CONFIG_OPTION_USE_HARFBUZZ
+    return TRUE;
+#else
+    return FALSE;
+#endif
+  }
+
+#endif /* !FT_CONFIG_OPTION_USE_HARFBUZZ_DYNAMIC */
+
+
+/* END */
diff --git a/src/java.desktop/share/native/libfreetype/src/autofit/ft-hb.h b/src/java.desktop/share/native/libfreetype/src/autofit/ft-hb.h
new file mode 100644
index 00000000000..95914deb8d3
--- /dev/null
+++ b/src/java.desktop/share/native/libfreetype/src/autofit/ft-hb.h
@@ -0,0 +1,82 @@
+/****************************************************************************
+ *
+ * ft-hb.h
+ *
+ *   FreeType-HarfBuzz bridge (specification).
+ *
+ * Copyright (C) 2025 by
+ * Behdad Esfahbod.
+ *
+ * This file is part of the FreeType project, and may only be used,
+ * modified, and distributed under the terms of the FreeType project
+ * license, LICENSE.TXT.  By continuing to use, modify, or distribute
+ * this file you indicate that you have read the license and
+ * understand and accept it fully.
+ *
+ */
+
+
+#ifndef FT_HB_H
+#define FT_HB_H
+
+#include <freetype/internal/compiler-macros.h>
+#include <freetype/freetype.h>
+
+
+FT_BEGIN_HEADER
+
+#ifdef FT_CONFIG_OPTION_USE_HARFBUZZ
+
+#  include "ft-hb-types.h"
+
+#  ifdef FT_CONFIG_OPTION_USE_HARFBUZZ_DYNAMIC
+
+#    define HB_EXTERN( ret, name, args ) \
+              typedef ret (*ft_ ## name ## _func_t) args;
+#    include "ft-hb-decls.h"
+#    undef HB_EXTERN
+
+  typedef struct ft_hb_funcs_t
+  {
+#    define HB_EXTERN( ret, name, args ) \
+              ft_ ## name ## _func_t  name;
+#    include "ft-hb-decls.h"
+#    undef HB_EXTERN
+  } ft_hb_funcs_t;
+
+  struct  AF_ModuleRec_;
+
+  FT_LOCAL( void )
+  ft_hb_funcs_init( struct AF_ModuleRec_  *af_module );
+
+  FT_LOCAL( void )
+  ft_hb_funcs_done( struct AF_ModuleRec_  *af_module );
+
+#    define hb( x )  globals->module->hb_funcs->hb_ ## x
+
+#  else /* !FT_CONFIG_OPTION_USE_HARFBUZZ_DYNAMIC */
+
+#    define HB_EXTERN( ret, name, args ) \
+              ret name args;
+#    include "ft-hb-decls.h"
+#    undef HB_EXTERN
+
+#    define hb( x )  hb_ ## x
+
+#  endif /* !FT_CONFIG_OPTION_USE_HARFBUZZ_DYNAMIC */
+
+#endif /* FT_CONFIG_OPTION_USE_HARFBUZZ */
+
+
+  struct AF_FaceGlobalsRec_;
+
+  FT_LOCAL( FT_Bool )
+  ft_hb_enabled( struct AF_FaceGlobalsRec_  *globals );
+
+
+FT_END_HEADER
+
+#endif /* FT_HB_H */
+
+
+/* END */
diff --git a/src/java.desktop/share/native/libfreetype/src/base/ftadvanc.c b/src/java.desktop/share/native/libfreetype/src/base/ftadvanc.c
index 717f7d08b35..ff0fc510503 100644
--- a/src/java.desktop/share/native/libfreetype/src/base/ftadvanc.c
+++ b/src/java.desktop/share/native/libfreetype/src/base/ftadvanc.c
@@ -4,7 +4,7 @@
  *
  *   Quick computation of advance widths (body).
  *
- * Copyright (C) 2008-2024 by
+ * Copyright (C) 2008-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/base/ftbase.h b/src/java.desktop/share/native/libfreetype/src/base/ftbase.h
index 1d98b26dd51..66f091165fe 100644
--- a/src/java.desktop/share/native/libfreetype/src/base/ftbase.h
+++ b/src/java.desktop/share/native/libfreetype/src/base/ftbase.h
@@ -4,7 +4,7 @@
  *
  *   Private functions used in the `base' module (specification).
  *
- * Copyright (C) 2008-2024 by
+ * Copyright (C) 2008-2025 by
  * David Turner, Robert Wilhelm, Werner Lemberg, and suzuki toshiya.
  *
  * This file is part of the FreeType project, and may only be used,
@@ -34,7 +34,7 @@ FT_BEGIN_HEADER
 #ifdef FT_CONFIG_OPTION_MAC_FONTS
 
   /* MacOS resource fork cannot exceed 16MB at least for Carbon code; */
-  /* see https://support.microsoft.com/en-us/kb/130437                */
+  /* see https://jeffpar.github.io/kbarchive/kb/130/Q130437/          */
 #define FT_MAC_RFORK_MAX_LEN  0x00FFFFFFUL
 
 
diff --git a/src/java.desktop/share/native/libfreetype/src/base/ftbbox.c b/src/java.desktop/share/native/libfreetype/src/base/ftbbox.c
index d6aa5d56df8..feccdee5dd7 100644
--- a/src/java.desktop/share/native/libfreetype/src/base/ftbbox.c
+++ b/src/java.desktop/share/native/libfreetype/src/base/ftbbox.c
@@ -4,7 +4,7 @@
  *
  *   FreeType bbox computation (body).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used
diff --git a/src/java.desktop/share/native/libfreetype/src/base/ftbitmap.c b/src/java.desktop/share/native/libfreetype/src/base/ftbitmap.c
index 4be145679fd..2c8e44b905d 100644
--- a/src/java.desktop/share/native/libfreetype/src/base/ftbitmap.c
+++ b/src/java.desktop/share/native/libfreetype/src/base/ftbitmap.c
@@ -4,7 +4,7 @@
  *
  *   FreeType utility functions for bitmaps (body).
  *
- * Copyright (C) 2004-2024 by
+ * Copyright (C) 2004-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
@@ -876,13 +876,13 @@
 
 #ifdef FT_DEBUG_LEVEL_TRACE
     FT_TRACE5(( "FT_Bitmap_Blend:\n" ));
-    FT_TRACE5(( "  source bitmap: (%ld, %ld) -- (%ld, %ld); %d x %d\n",
+    FT_TRACE5(( "  source bitmap: (%ld, %ld) -- (%ld, %ld); %u x %u\n",
       source_llx / 64, source_lly / 64,
       source_urx / 64, source_ury / 64,
       source_->width, source_->rows ));
 
     if ( target->width && target->rows )
-      FT_TRACE5(( "  target bitmap: (%ld, %ld) -- (%ld, %ld); %d x %d\n",
+      FT_TRACE5(( "  target bitmap: (%ld, %ld) -- (%ld, %ld); %u x %u\n",
         target_llx / 64, target_lly / 64,
         target_urx / 64, target_ury / 64,
         target->width, target->rows ));
@@ -890,7 +890,7 @@
       FT_TRACE5(( "  target bitmap: empty\n" ));
 
     if ( final_width && final_rows )
-      FT_TRACE5(( "  final bitmap: (%ld, %ld) -- (%ld, %ld); %d x %d\n",
+      FT_TRACE5(( "  final bitmap: (%ld, %ld) -- (%ld, %ld); %u x %u\n",
         final_llx / 64, final_lly / 64,
         final_urx / 64, final_ury / 64,
         final_width, final_rows ));
@@ -924,7 +924,7 @@
 
       if ( FT_LONG_MAX / target->pitch < (int)target->rows )
       {
-        FT_TRACE5(( "FT_Blend_Bitmap: target bitmap too large (%d x %d)\n",
+        FT_TRACE5(( "FT_Blend_Bitmap: target bitmap too large (%u x %u)\n",
                      final_width, final_rows ));
         return FT_THROW( Invalid_Argument );
       }
@@ -952,7 +952,7 @@
 
       if ( FT_LONG_MAX / new_pitch < (int)final_rows )
       {
-        FT_TRACE5(( "FT_Blend_Bitmap: target bitmap too large (%d x %d)\n",
+        FT_TRACE5(( "FT_Blend_Bitmap: target bitmap too large (%u x %u)\n",
                      final_width, final_rows ));
         return FT_THROW( Invalid_Argument );
       }
diff --git a/src/java.desktop/share/native/libfreetype/src/base/ftcalc.c b/src/java.desktop/share/native/libfreetype/src/base/ftcalc.c
index 92de09ed877..7d6e12e2543 100644
--- a/src/java.desktop/share/native/libfreetype/src/base/ftcalc.c
+++ b/src/java.desktop/share/native/libfreetype/src/base/ftcalc.c
@@ -4,7 +4,7 @@
  *
  *   Arithmetic computations (body).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
@@ -38,24 +38,11 @@
 #include <freetype/internal/ftdebug.h>
 #include <freetype/internal/ftobjs.h>
 
-
-#ifdef FT_MULFIX_ASSEMBLER
-#undef FT_MulFix
+  /* cancel inlining macro from internal/ftcalc.h */
+#ifdef FT_MulFix
+#  undef FT_MulFix
 #endif
 
-/* we need to emulate a 64-bit data type if a real one isn't available */
-
-#ifndef FT_INT64
-
-  typedef struct  FT_Int64_
-  {
-    FT_UInt32  lo;
-    FT_UInt32  hi;
-
-  } FT_Int64;
-
-#endif /* !FT_INT64 */
-
 
   /**************************************************************************
    *
@@ -88,7 +75,7 @@
   FT_EXPORT_DEF( FT_Fixed )
   FT_RoundFix( FT_Fixed  a )
   {
-    return ( ADD_LONG( a, 0x8000L - ( a < 0 ) ) ) & ~0xFFFFL;
+    return ADD_LONG( a, 0x8000L - ( a < 0 ) ) & ~0xFFFFL;
   }
 
 
@@ -97,7 +84,7 @@
   FT_EXPORT_DEF( FT_Fixed )
   FT_CeilFix( FT_Fixed  a )
   {
-    return ( ADD_LONG( a, 0xFFFFL ) ) & ~0xFFFFL;
+    return ADD_LONG( a, 0xFFFFL ) & ~0xFFFFL;
   }
 
 
@@ -225,18 +212,18 @@
   FT_MulFix( FT_Long  a_,
              FT_Long  b_ )
   {
-#ifdef FT_MULFIX_ASSEMBLER
+#ifdef FT_CONFIG_OPTION_INLINE_MULFIX
 
-    return FT_MULFIX_ASSEMBLER( (FT_Int32)a_, (FT_Int32)b_ );
+    return FT_MulFix_64( a_, b_ );
 
 #else
 
-    FT_Int64  ab = (FT_Int64)a_ * (FT_Int64)b_;
+    FT_Int64  ab = MUL_INT64( a_, b_ );
 
     /* this requires arithmetic right shift of signed numbers */
-    return (FT_Long)( ( ab + 0x8000L - ( ab < 0 ) ) >> 16 );
+    return (FT_Long)( ( ab + 0x8000L + ( ab >> 63 ) ) >> 16 );
 
-#endif /* FT_MULFIX_ASSEMBLER */
+#endif /* FT_CONFIG_OPTION_INLINE_MULFIX */
   }
 
 
@@ -975,43 +962,36 @@
 
 #else
 
-    FT_Int  result;
+    FT_Int64  z1, z2;
+    FT_Int    result;
 
 
-    if ( ADD_LONG( FT_ABS( in_x ), FT_ABS( out_y ) ) <= 131071L &&
-         ADD_LONG( FT_ABS( in_y ), FT_ABS( out_x ) ) <= 131071L )
+    if ( (FT_ULong)FT_ABS( in_x ) + (FT_ULong)FT_ABS( out_y ) <= 92681UL )
     {
-      FT_Long  z1 = MUL_LONG( in_x, out_y );
-      FT_Long  z2 = MUL_LONG( in_y, out_x );
-
-
-      if ( z1 > z2 )
-        result = +1;
-      else if ( z1 < z2 )
-        result = -1;
-      else
-        result = 0;
+      z1.lo = (FT_UInt32)in_x * (FT_UInt32)out_y;
+      z1.hi = (FT_UInt32)( (FT_Int32)z1.lo >> 31 );  /* sign-expansion */
     }
-    else /* products might overflow 32 bits */
-    {
-      FT_Int64  z1, z2;
-
-
-      /* XXX: this function does not allow 64-bit arguments */
+    else
       ft_multo64( (FT_UInt32)in_x, (FT_UInt32)out_y, &z1 );
+
+    if ( (FT_ULong)FT_ABS( in_y ) + (FT_ULong)FT_ABS( out_x ) <= 92681UL )
+    {
+      z2.lo = (FT_UInt32)in_y * (FT_UInt32)out_x;
+      z2.hi = (FT_UInt32)( (FT_Int32)z2.lo >> 31 );  /* sign-expansion */
+    }
+    else
       ft_multo64( (FT_UInt32)in_y, (FT_UInt32)out_x, &z2 );
 
-      if ( z1.hi > z2.hi )
-        result = +1;
-      else if ( z1.hi < z2.hi )
-        result = -1;
-      else if ( z1.lo > z2.lo )
-        result = +1;
-      else if ( z1.lo < z2.lo )
-        result = -1;
-      else
-        result = 0;
-    }
+    if      ( (FT_Int32)z1.hi > (FT_Int32)z2.hi )
+      result = +1;
+    else if ( (FT_Int32)z1.hi < (FT_Int32)z2.hi )
+      result = -1;
+    else if ( z1.lo > z2.lo )
+      result = +1;
+    else if ( z1.lo < z2.lo )
+      result = -1;
+    else
+      result =  0;
 
     /* XXX: only the sign of return value, +1/0/-1 must be used */
     return result;
@@ -1065,62 +1045,4 @@
   }
 
 
-  FT_BASE_DEF( FT_Int32 )
-  FT_MulAddFix( FT_Fixed*  s,
-                FT_Int32*  f,
-                FT_UInt    count )
-  {
-    FT_UInt   i;
-    FT_Int64  temp;
-
-
-#ifdef FT_INT64
-    temp = 0;
-
-    for ( i = 0; i < count; ++i )
-      temp += (FT_Int64)s[i] * f[i];
-
-    return (FT_Int32)( ( temp + 0x8000 ) >> 16 );
-#else
-    temp.hi = 0;
-    temp.lo = 0;
-
-    for ( i = 0; i < count; ++i )
-    {
-      FT_Int64  multResult;
-
-      FT_Int     sign  = 1;
-      FT_UInt32  carry = 0;
-
-      FT_UInt32  scalar;
-      FT_UInt32  factor;
-
-
-      FT_MOVE_SIGN( FT_UInt32, s[i], scalar, sign );
-      FT_MOVE_SIGN( FT_UInt32, f[i], factor, sign );
-
-      ft_multo64( scalar, factor, &multResult );
-
-      if ( sign < 0 )
-      {
-        /* Emulated `FT_Int64` negation. */
-        carry = ( multResult.lo == 0 );
-
-        multResult.lo = ~multResult.lo + 1;
-        multResult.hi = ~multResult.hi + carry;
-      }
-
-      FT_Add64( &temp, &multResult, &temp );
-    }
-
-    /* Shift and round value. */
-    return (FT_Int32)( ( ( temp.hi << 16 ) | ( temp.lo >> 16 ) )
-                                     + ( 1 & ( temp.lo >> 15 ) ) );
-
-
-#endif /* !FT_INT64 */
-
-  }
-
-
 /* END */
diff --git a/src/java.desktop/share/native/libfreetype/src/base/ftcid.c b/src/java.desktop/share/native/libfreetype/src/base/ftcid.c
index 4f2deb19a05..35cd0fcd2be 100644
--- a/src/java.desktop/share/native/libfreetype/src/base/ftcid.c
+++ b/src/java.desktop/share/native/libfreetype/src/base/ftcid.c
@@ -4,7 +4,7 @@
  *
  *   FreeType API for accessing CID font information.
  *
- * Copyright (C) 2007-2024 by
+ * Copyright (C) 2007-2025 by
  * Derek Clegg and Michael Toftdal.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/base/ftcolor.c b/src/java.desktop/share/native/libfreetype/src/base/ftcolor.c
index c6bf2a3cd1a..90b02b7d2de 100644
--- a/src/java.desktop/share/native/libfreetype/src/base/ftcolor.c
+++ b/src/java.desktop/share/native/libfreetype/src/base/ftcolor.c
@@ -4,7 +4,7 @@
  *
  *   FreeType's glyph color management (body).
  *
- * Copyright (C) 2018-2024 by
+ * Copyright (C) 2018-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
@@ -56,9 +56,7 @@
                      FT_Color*  *apalette )
   {
     FT_Error  error;
-
-    TT_Face       ttface;
-    SFNT_Service  sfnt;
+    TT_Face   ttface = (TT_Face)face;
 
 
     if ( !face )
@@ -72,14 +70,17 @@
       return FT_Err_Ok;
     }
 
-    ttface = (TT_Face)face;
-    sfnt   = (SFNT_Service)ttface->sfnt;
+    if ( palette_index != ttface->palette_index )
+    {
+      SFNT_Service  sfnt = (SFNT_Service)ttface->sfnt;
 
-    error = sfnt->set_palette( ttface, palette_index );
-    if ( error )
-      return error;
 
-    ttface->palette_index = palette_index;
+      error = sfnt->set_palette( ttface, palette_index );
+      if ( error )
+        return error;
+
+      ttface->palette_index = palette_index;
+    }
 
     if ( apalette )
       *apalette = ttface->palette;
diff --git a/src/java.desktop/share/native/libfreetype/src/base/ftdbgmem.c b/src/java.desktop/share/native/libfreetype/src/base/ftdbgmem.c
index 902a5dc8bbc..7f54e759b16 100644
--- a/src/java.desktop/share/native/libfreetype/src/base/ftdbgmem.c
+++ b/src/java.desktop/share/native/libfreetype/src/base/ftdbgmem.c
@@ -4,7 +4,7 @@
  *
  *   Memory debugger (body).
  *
- * Copyright (C) 2001-2024 by
+ * Copyright (C) 2001-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
@@ -139,7 +139,6 @@
   } FT_MemTableRec;
 
 
-#define FT_MEM_SIZE_MIN  7
 #define FT_MEM_SIZE_MAX  13845163
 
 #define FT_FILENAME( x )  ( (x) ? (x) : "unknown file" )
diff --git a/src/java.desktop/share/native/libfreetype/src/base/ftdebug.c b/src/java.desktop/share/native/libfreetype/src/base/ftdebug.c
index 11307eaace4..c615f29e521 100644
--- a/src/java.desktop/share/native/libfreetype/src/base/ftdebug.c
+++ b/src/java.desktop/share/native/libfreetype/src/base/ftdebug.c
@@ -4,7 +4,7 @@
  *
  *   Debugging and logging component (body).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
@@ -64,7 +64,7 @@
    *    with the actual log message if set to true.
    *
    * 5. The flag `ft_timestamp_flag` prints time along with the actual log
-   *    message if set to ture.
+   *    message if set to true.
    *
    * 6. `ft_have_newline_char` is used to differentiate between a log
    *    message with and without a trailing newline character.
diff --git a/src/java.desktop/share/native/libfreetype/src/base/ftfntfmt.c b/src/java.desktop/share/native/libfreetype/src/base/ftfntfmt.c
index 77b4089e7e2..7f4f14ffdb0 100644
--- a/src/java.desktop/share/native/libfreetype/src/base/ftfntfmt.c
+++ b/src/java.desktop/share/native/libfreetype/src/base/ftfntfmt.c
@@ -4,7 +4,7 @@
  *
  *   FreeType utility file for font formats (body).
  *
- * Copyright (C) 2002-2024 by
+ * Copyright (C) 2002-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/base/ftfstype.c b/src/java.desktop/share/native/libfreetype/src/base/ftfstype.c
index 1565c3b7e25..3a95752ffaa 100644
--- a/src/java.desktop/share/native/libfreetype/src/base/ftfstype.c
+++ b/src/java.desktop/share/native/libfreetype/src/base/ftfstype.c
@@ -4,7 +4,7 @@
  *
  *   FreeType utility file to access FSType data (body).
  *
- * Copyright (C) 2008-2024 by
+ * Copyright (C) 2008-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/base/ftgasp.c b/src/java.desktop/share/native/libfreetype/src/base/ftgasp.c
index c63d30e978c..2202240b57e 100644
--- a/src/java.desktop/share/native/libfreetype/src/base/ftgasp.c
+++ b/src/java.desktop/share/native/libfreetype/src/base/ftgasp.c
@@ -4,7 +4,7 @@
  *
  *   Access of TrueType's `gasp' table (body).
  *
- * Copyright (C) 2007-2024 by
+ * Copyright (C) 2007-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/base/ftgloadr.c b/src/java.desktop/share/native/libfreetype/src/base/ftgloadr.c
index 484d98f1722..47781bc4d5c 100644
--- a/src/java.desktop/share/native/libfreetype/src/base/ftgloadr.c
+++ b/src/java.desktop/share/native/libfreetype/src/base/ftgloadr.c
@@ -4,7 +4,7 @@
  *
  *   The FreeType glyph loader (body).
  *
- * Copyright (C) 2002-2024 by
+ * Copyright (C) 2002-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/base/ftglyph.c b/src/java.desktop/share/native/libfreetype/src/base/ftglyph.c
index 1b5849f99af..75babb1aa56 100644
--- a/src/java.desktop/share/native/libfreetype/src/base/ftglyph.c
+++ b/src/java.desktop/share/native/libfreetype/src/base/ftglyph.c
@@ -4,7 +4,7 @@
  *
  *   FreeType convenience functions to handle glyphs (body).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/base/fthash.c b/src/java.desktop/share/native/libfreetype/src/base/fthash.c
index 313bbbb4b27..ab248ace8bd 100644
--- a/src/java.desktop/share/native/libfreetype/src/base/fthash.c
+++ b/src/java.desktop/share/native/libfreetype/src/base/fthash.c
@@ -41,6 +41,7 @@
 
 #include <freetype/internal/fthash.h>
 #include <freetype/internal/ftmemory.h>
+#include <freetype/internal/ftobjs.h>
 
 
 #define INITIAL_HT_SIZE  241
@@ -233,7 +234,8 @@
   hash_insert( FT_Hashkey  key,
                size_t      data,
                FT_Hash     hash,
-               FT_Memory   memory )
+               FT_Memory   memory,
+               FT_Bool     overwrite )
   {
     FT_Hashnode   nn;
     FT_Hashnode*  bp    = hash_bucket( key, hash );
@@ -259,7 +261,7 @@
 
       hash->used++;
     }
-    else
+    else if ( overwrite )
       nn->data = data;
 
   Exit:
@@ -278,7 +280,7 @@
 
     hk.str = key;
 
-    return hash_insert( hk, data, hash, memory );
+    return hash_insert( hk, data, hash, memory, TRUE );
   }
 
 
@@ -293,7 +295,37 @@
 
     hk.num = num;
 
-    return hash_insert( hk, data, hash, memory );
+    return hash_insert( hk, data, hash, memory, TRUE );
+  }
+
+
+  FT_Error
+  ft_hash_str_insert_no_overwrite( const char*  key,
+                                   size_t       data,
+                                   FT_Hash      hash,
+                                   FT_Memory    memory )
+  {
+    FT_Hashkey  hk;
+
+
+    hk.str = key;
+
+    return hash_insert( hk, data, hash, memory, FALSE );
+  }
+
+
+  FT_Error
+  ft_hash_num_insert_no_overwrite( FT_Int     num,
+                                   size_t     data,
+                                   FT_Hash    hash,
+                                   FT_Memory  memory )
+  {
+    FT_Hashkey  hk;
+
+
+    hk.num = num;
+
+    return hash_insert( hk, data, hash, memory, FALSE );
   }
 
 
@@ -335,4 +367,68 @@
   }
 
 
+  FT_Bool
+  ft_hash_num_iterator( FT_UInt  *idx,
+                        FT_Int   *key,
+                        size_t   *value,
+                        FT_Hash   hash )
+  {
+    FT_Hashnode  nn = NULL;
+
+
+    while ( 1 )
+    {
+      if ( *idx >= hash->size )
+        return 0;
+
+      nn = hash->table[*idx];
+      if ( nn )
+        break;
+
+      (*idx)++;
+    }
+
+    if ( key )
+      *key = nn->key.num;
+    if ( value )
+      *value = nn->data;
+
+    (*idx)++;
+
+    return 1;
+  }
+
+
+  FT_Bool
+  ft_hash_str_iterator( FT_UInt      *idx,
+                        const char*  *key,
+                        size_t       *value,
+                        FT_Hash       hash )
+  {
+    FT_Hashnode  nn = NULL;
+
+
+    while ( 1 )
+    {
+      if ( *idx >= hash->size )
+        return 0;
+
+      nn = hash->table[*idx];
+      if ( nn )
+        break;
+
+      (*idx)++;
+    }
+
+    if ( key )
+      *key = nn->key.str;
+    if ( value )
+      *value = nn->data;
+
+    (*idx)++;
+
+    return 1;
+  }
+
+
 /* END */
diff --git a/src/java.desktop/share/native/libfreetype/src/base/ftinit.c b/src/java.desktop/share/native/libfreetype/src/base/ftinit.c
index 9a6c00e13ef..37d7f87bcb9 100644
--- a/src/java.desktop/share/native/libfreetype/src/base/ftinit.c
+++ b/src/java.desktop/share/native/libfreetype/src/base/ftinit.c
@@ -4,7 +4,7 @@
  *
  *   FreeType initialization layer (body).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/base/ftlcdfil.c b/src/java.desktop/share/native/libfreetype/src/base/ftlcdfil.c
index 1e69d4da70f..d026da8b012 100644
--- a/src/java.desktop/share/native/libfreetype/src/base/ftlcdfil.c
+++ b/src/java.desktop/share/native/libfreetype/src/base/ftlcdfil.c
@@ -4,7 +4,7 @@
  *
  *   FreeType API for color filtering of subpixel bitmap glyphs (body).
  *
- * Copyright (C) 2006-2024 by
+ * Copyright (C) 2006-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/base/ftmac.c b/src/java.desktop/share/native/libfreetype/src/base/ftmac.c
index e8e35627b50..37d97be1838 100644
--- a/src/java.desktop/share/native/libfreetype/src/base/ftmac.c
+++ b/src/java.desktop/share/native/libfreetype/src/base/ftmac.c
@@ -8,7 +8,7 @@
  * This file is for Mac OS X only; see builds/mac/ftoldmac.c for
  * classic platforms built by MPW.
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * Just van Rossum, David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/base/ftmm.c b/src/java.desktop/share/native/libfreetype/src/base/ftmm.c
index cc4ca22fba3..9e67001406c 100644
--- a/src/java.desktop/share/native/libfreetype/src/base/ftmm.c
+++ b/src/java.desktop/share/native/libfreetype/src/base/ftmm.c
@@ -4,7 +4,7 @@
  *
  *   Multiple Master font support (body).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
@@ -292,6 +292,9 @@
     if ( num_coords && !coords )
       return FT_THROW( Invalid_Argument );
 
+    if ( !num_coords && !FT_IS_VARIATION( face ) )
+      return FT_Err_Ok;  /* nothing to be done */
+
     error = ft_face_get_mm_service( face, &service_mm );
     if ( !error )
     {
@@ -299,15 +302,21 @@
       if ( service_mm->set_var_design )
         error = service_mm->set_var_design( face, num_coords, coords );
 
-      if ( !error || error == -1 )
+      if ( !error || error == -1 || error == -2 )
       {
         FT_Bool  is_variation_old = FT_IS_VARIATION( face );
 
 
-        if ( num_coords )
-          face->face_flags |= FT_FACE_FLAG_VARIATION;
-        else
-          face->face_flags &= ~FT_FACE_FLAG_VARIATION;
+        if ( error != -1 )
+        {
+          if ( error == -2 ) /* -2 means is_variable. */
+          {
+            face->face_flags |= FT_FACE_FLAG_VARIATION;
+            error             = FT_Err_Ok;
+          }
+          else
+            face->face_flags &= ~FT_FACE_FLAG_VARIATION;
+        }
 
         if ( service_mm->construct_ps_name )
         {
@@ -474,15 +483,21 @@
       if ( service_mm->set_mm_blend )
         error = service_mm->set_mm_blend( face, num_coords, coords );
 
-      if ( !error || error == -1 )
+      if ( !error || error == -1 || error == -2 )
       {
         FT_Bool  is_variation_old = FT_IS_VARIATION( face );
 
 
-        if ( num_coords )
-          face->face_flags |= FT_FACE_FLAG_VARIATION;
-        else
-          face->face_flags &= ~FT_FACE_FLAG_VARIATION;
+        if ( error != -1 )
+        {
+          if ( error == -2 ) /* -2 means is_variable. */
+          {
+            face->face_flags |= FT_FACE_FLAG_VARIATION;
+            error             = FT_Err_Ok;
+          }
+          else
+            face->face_flags &= ~FT_FACE_FLAG_VARIATION;
+        }
 
         if ( service_mm->construct_ps_name )
         {
diff --git a/src/java.desktop/share/native/libfreetype/src/base/ftobjs.c b/src/java.desktop/share/native/libfreetype/src/base/ftobjs.c
index 9b97820c379..cced4fed06b 100644
--- a/src/java.desktop/share/native/libfreetype/src/base/ftobjs.c
+++ b/src/java.desktop/share/native/libfreetype/src/base/ftobjs.c
@@ -4,7 +4,7 @@
  *
  *   The FreeType private base classes (body).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
@@ -905,7 +905,6 @@
     FT_Library    library;
     FT_Bool       autohint = FALSE;
     FT_Module     hinter;
-    TT_Face       ttface = (TT_Face)face;
 
 
     if ( !face || !face->size || !face->glyph )
@@ -983,6 +982,7 @@
       {
         FT_Render_Mode  mode = FT_LOAD_TARGET_MODE( load_flags );
         FT_Bool         is_light_type1;
+        TT_Face         ttface = (TT_Face)face;
 
 
         /* only the new Adobe engine (for both CFF and Type 1) is `light'; */
@@ -994,8 +994,7 @@
         /* the check for `num_locations' assures that we actually    */
         /* test for instructions in a TTF and not in a CFF-based OTF */
         /*                                                           */
-        /* since `maxSizeOfInstructions' might be unreliable, we     */
-        /* check the size of the `fpgm' and `prep' tables, too --    */
+        /* we check the size of the `fpgm' and `prep' tables, too -- */
         /* the assumption is that there don't exist real TTFs where  */
         /* both `fpgm' and `prep' tables are missing                 */
         if ( ( mode == FT_RENDER_MODE_LIGHT           &&
@@ -1003,9 +1002,8 @@
                  !is_light_type1                    ) )         ||
              ( FT_IS_SFNT( face )                             &&
                ttface->num_locations                          &&
-               ttface->max_profile.maxSizeOfInstructions == 0 &&
                ttface->font_program_size == 0                 &&
-               ttface->cvt_program_size == 0                  ) )
+               ttface->cvt_program_size <= 7                  ) )
           autohint = TRUE;
       }
     }
@@ -1172,9 +1170,9 @@
     }
 
 #ifdef FT_DEBUG_LEVEL_TRACE
-    FT_TRACE5(( "FT_Load_Glyph: index %d, flags 0x%x\n",
+    FT_TRACE5(( "FT_Load_Glyph: index %u, flags 0x%x\n",
                 glyph_index, load_flags ));
-    FT_TRACE5(( "  bitmap %dx%d %s, %s (mode %d)\n",
+    FT_TRACE5(( "  bitmap %ux%u %s, %s (mode %d)\n",
                 slot->bitmap.width,
                 slot->bitmap.rows,
                 slot->outline.points ?
@@ -1253,14 +1251,14 @@
     FT_Driver  driver = (FT_Driver)driver_;
 
 
-    /* finalize client-specific data */
-    if ( size->generic.finalizer )
-      size->generic.finalizer( size );
-
     /* finalize format-specific stuff */
     if ( driver->clazz->done_size )
       driver->clazz->done_size( size );
 
+    /* finalize client-specific data */
+    if ( size->generic.finalizer )
+      size->generic.finalizer( size );
+
     FT_FREE( size->internal );
     FT_FREE( size );
   }
@@ -1322,10 +1320,6 @@
                       driver );
     face->size = NULL;
 
-    /* now discard client data */
-    if ( face->generic.finalizer )
-      face->generic.finalizer( face );
-
     /* discard charmaps */
     destroy_charmaps( face, memory );
 
@@ -1340,6 +1334,10 @@
 
     face->stream = NULL;
 
+    /* now discard client data */
+    if ( face->generic.finalizer )
+      face->generic.finalizer( face );
+
     /* get rid of it */
     if ( face->internal )
     {
@@ -1359,21 +1357,9 @@
   }
 
 
-  /**************************************************************************
-   *
-   * @Function:
-   *   find_unicode_charmap
-   *
-   * @Description:
-   *   This function finds a Unicode charmap, if there is one.
-   *   And if there is more than one, it tries to favour the more
-   *   extensive one, i.e., one that supports UCS-4 against those which
-   *   are limited to the BMP (said UCS-2 encoding.)
-   *
-   *   This function is called from open_face() (just below), and also
-   *   from FT_Select_Charmap( ..., FT_ENCODING_UNICODE ).
-   */
-  static FT_Error
+  /* documentation is in ftobjs.h */
+
+  FT_BASE_DEF( FT_Error )
   find_unicode_charmap( FT_Face  face )
   {
     FT_CharMap*  first;
@@ -2125,7 +2111,7 @@
       if ( pfb_pos > pfb_len || pfb_pos + rlen > pfb_len )
         goto Exit2;
 
-      FT_TRACE3(( "    Load POST fragment #%d (%ld byte) to buffer"
+      FT_TRACE3(( "    Load POST fragment #%d (%lu byte) to buffer"
                   " %p + 0x%08lx\n",
                   i, rlen, (void*)pfb_data, pfb_pos ));
 
@@ -2398,7 +2384,7 @@
       is_darwin_vfs = ft_raccess_rule_by_darwin_vfs( library, i );
       if ( is_darwin_vfs && vfs_rfork_has_no_font )
       {
-        FT_TRACE3(( "Skip rule %d: darwin vfs resource fork"
+        FT_TRACE3(( "Skip rule %u: darwin vfs resource fork"
                     " is already checked and"
                     " no font is found\n",
                     i ));
@@ -2407,7 +2393,7 @@
 
       if ( errors[i] )
       {
-        FT_TRACE3(( "Error 0x%x has occurred in rule %d\n",
+        FT_TRACE3(( "Error 0x%x has occurred in rule %u\n",
                     errors[i], i ));
         continue;
       }
@@ -2415,7 +2401,7 @@
       args2.flags    = FT_OPEN_PATHNAME;
       args2.pathname = file_names[i] ? file_names[i] : args->pathname;
 
-      FT_TRACE3(( "Try rule %d: %s (offset=%ld) ...",
+      FT_TRACE3(( "Try rule %u: %s (offset=%ld) ...",
                   i, args2.pathname, offsets[i] ));
 
       error = FT_Stream_New( library, &args2, &stream2 );
@@ -5044,9 +5030,9 @@
   static void
   Destroy_Module( FT_Module  module )
   {
-    FT_Memory         memory  = module->memory;
-    FT_Module_Class*  clazz   = module->clazz;
-    FT_Library        library = module->library;
+    const FT_Module_Class*  clazz   = module->clazz;
+    FT_Library              library = module->library;
+    FT_Memory               memory  = module->memory;
 
 
     if ( library && library->auto_hinter == module )
@@ -5125,9 +5111,9 @@
       goto Exit;
 
     /* base initialization */
+    module->clazz   = clazz;
     module->library = library;
     module->memory  = memory;
-    module->clazz   = (FT_Module_Class*)clazz;
 
     /* check whether the module is a renderer - this must be performed */
     /* before the normal module initialization                         */
diff --git a/src/java.desktop/share/native/libfreetype/src/base/ftoutln.c b/src/java.desktop/share/native/libfreetype/src/base/ftoutln.c
index ef699b3c7cd..8a15b03eb83 100644
--- a/src/java.desktop/share/native/libfreetype/src/base/ftoutln.c
+++ b/src/java.desktop/share/native/libfreetype/src/base/ftoutln.c
@@ -4,7 +4,7 @@
  *
  *   FreeType outline management (body).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/base/ftpatent.c b/src/java.desktop/share/native/libfreetype/src/base/ftpatent.c
index 2055757e023..664bc34deea 100644
--- a/src/java.desktop/share/native/libfreetype/src/base/ftpatent.c
+++ b/src/java.desktop/share/native/libfreetype/src/base/ftpatent.c
@@ -5,7 +5,7 @@
  *   FreeType API for checking patented TrueType bytecode instructions
  *   (body).  Obsolete, retained for backward compatibility.
  *
- * Copyright (C) 2007-2024 by
+ * Copyright (C) 2007-2025 by
  * David Turner.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/base/ftpsprop.c b/src/java.desktop/share/native/libfreetype/src/base/ftpsprop.c
index 37a6cee6cc9..0631cd63f62 100644
--- a/src/java.desktop/share/native/libfreetype/src/base/ftpsprop.c
+++ b/src/java.desktop/share/native/libfreetype/src/base/ftpsprop.c
@@ -5,7 +5,7 @@
  *   Get and set properties of PostScript drivers (body).
  *   See `ftdriver.h' for available properties.
  *
- * Copyright (C) 2017-2024 by
+ * Copyright (C) 2017-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/base/ftrfork.c b/src/java.desktop/share/native/libfreetype/src/base/ftrfork.c
index dc9b043d8bb..1e241f4f95b 100644
--- a/src/java.desktop/share/native/libfreetype/src/base/ftrfork.c
+++ b/src/java.desktop/share/native/libfreetype/src/base/ftrfork.c
@@ -4,7 +4,7 @@
  *
  *   Embedded resource forks accessor (body).
  *
- * Copyright (C) 2004-2024 by
+ * Copyright (C) 2004-2025 by
  * Masatake YAMATO and Redhat K.K.
  *
  * FT_Raccess_Get_HeaderInfo() and raccess_guess_darwin_hfsplus() are
@@ -269,14 +269,8 @@
            * According to Inside Macintosh: More Macintosh Toolbox,
            * "Resource IDs" (1-46), there are some reserved IDs.
            * However, FreeType2 is not a font synthesizer, no need
-           * to check the acceptable resource ID.
+           * to check the acceptable resource ID or its attributes.
            */
-          if ( temp < 0 )
-          {
-            error = FT_THROW( Invalid_Table );
-            goto Exit;
-          }
-
           ref[j].offset = temp & 0xFFFFFFL;
 
           FT_TRACE3(( "             [%d]:"
diff --git a/src/java.desktop/share/native/libfreetype/src/base/ftsnames.c b/src/java.desktop/share/native/libfreetype/src/base/ftsnames.c
index f7231fd61cc..34a67a148fc 100644
--- a/src/java.desktop/share/native/libfreetype/src/base/ftsnames.c
+++ b/src/java.desktop/share/native/libfreetype/src/base/ftsnames.c
@@ -7,7 +7,7 @@
  *
  *   This is _not_ used to retrieve glyph names!
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/base/ftstream.c b/src/java.desktop/share/native/libfreetype/src/base/ftstream.c
index 66722246128..c04a0506def 100644
--- a/src/java.desktop/share/native/libfreetype/src/base/ftstream.c
+++ b/src/java.desktop/share/native/libfreetype/src/base/ftstream.c
@@ -4,7 +4,7 @@
  *
  *   I/O stream support (body).
  *
- * Copyright (C) 2000-2024 by
+ * Copyright (C) 2000-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
@@ -242,7 +242,7 @@
     FT_ULong  read_bytes;
 
 
-    FT_TRACE7(( "FT_Stream_EnterFrame: %ld bytes\n", count ));
+    FT_TRACE7(( "FT_Stream_EnterFrame: %lu bytes\n", count ));
 
     /* check for nested frame access */
     FT_ASSERT( stream && stream->cursor == 0 );
diff --git a/src/java.desktop/share/native/libfreetype/src/base/ftstroke.c b/src/java.desktop/share/native/libfreetype/src/base/ftstroke.c
index 64f46ce43e7..591f18eaa83 100644
--- a/src/java.desktop/share/native/libfreetype/src/base/ftstroke.c
+++ b/src/java.desktop/share/native/libfreetype/src/base/ftstroke.c
@@ -4,7 +4,7 @@
  *
  *   FreeType path stroker (body).
  *
- * Copyright (C) 2002-2024 by
+ * Copyright (C) 2002-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
@@ -1070,7 +1070,7 @@
         if ( theta == FT_ANGLE_PI2 )
           theta = -rotate;
 
-        phi    = stroker->angle_in + theta + rotate;
+        phi = stroker->angle_in + theta + rotate;
 
         FT_Vector_From_Polar( &sigma, stroker->miter_limit, theta );
 
@@ -1371,7 +1371,7 @@
     arc[1] = *control;
     arc[2] = stroker->center;
 
-    while ( arc >= bez_stack )
+    do
     {
       FT_Angle  angle_in, angle_out;
 
@@ -1524,10 +1524,12 @@
         }
       }
 
-      arc -= 2;
-
       stroker->angle_in = angle_out;
-    }
+
+      if ( arc == bez_stack )
+        break;
+      arc -= 2;
+    } while ( 1 );
 
     stroker->center      = *to;
     stroker->line_length = 0;
@@ -1577,7 +1579,7 @@
     arc[2] = *control1;
     arc[3] = stroker->center;
 
-    while ( arc >= bez_stack )
+    do
     {
       FT_Angle  angle_in, angle_mid, angle_out;
 
@@ -1741,10 +1743,12 @@
         }
       }
 
-      arc -= 3;
-
       stroker->angle_in = angle_out;
-    }
+
+      if ( arc == bez_stack )
+        break;
+      arc -= 3;
+    } while ( 1 );
 
     stroker->center      = *to;
     stroker->line_length = 0;
diff --git a/src/java.desktop/share/native/libfreetype/src/base/ftsynth.c b/src/java.desktop/share/native/libfreetype/src/base/ftsynth.c
index ec05bce33a9..08bc1742202 100644
--- a/src/java.desktop/share/native/libfreetype/src/base/ftsynth.c
+++ b/src/java.desktop/share/native/libfreetype/src/base/ftsynth.c
@@ -4,7 +4,7 @@
  *
  *   FreeType synthesizing code for emboldening and slanting (body).
  *
- * Copyright (C) 2000-2024 by
+ * Copyright (C) 2000-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
@@ -141,7 +141,7 @@
       /*
        * XXX: overflow check for 16-bit system, for compatibility
        *      with FT_GlyphSlot_Embolden() since FreeType 2.1.10.
-       *      unfortunately, this function return no informations
+       *      unfortunately, this function returns no information
        *      about the cause of error.
        */
       if ( ( ystr >> 6 ) > FT_INT_MAX || ( ystr >> 6 ) < FT_INT_MIN )
diff --git a/src/java.desktop/share/native/libfreetype/src/base/ftsystem.c b/src/java.desktop/share/native/libfreetype/src/base/ftsystem.c
index eee3642334f..186119d5581 100644
--- a/src/java.desktop/share/native/libfreetype/src/base/ftsystem.c
+++ b/src/java.desktop/share/native/libfreetype/src/base/ftsystem.c
@@ -4,7 +4,7 @@
  *
  *   ANSI-specific FreeType low-level system interface (body).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
@@ -280,7 +280,7 @@
     stream->close = ft_ansi_stream_close;
 
     FT_TRACE1(( "FT_Stream_Open:" ));
-    FT_TRACE1(( " opened `%s' (%ld bytes) successfully\n",
+    FT_TRACE1(( " opened `%s' (%lu bytes) successfully\n",
                 filepathname, stream->size ));
 
     return FT_Err_Ok;
diff --git a/src/java.desktop/share/native/libfreetype/src/base/fttrigon.c b/src/java.desktop/share/native/libfreetype/src/base/fttrigon.c
index 4b1aced1cba..29eff639c51 100644
--- a/src/java.desktop/share/native/libfreetype/src/base/fttrigon.c
+++ b/src/java.desktop/share/native/libfreetype/src/base/fttrigon.c
@@ -4,7 +4,7 @@
  *
  *   FreeType trigonometric functions (body).
  *
- * Copyright (C) 2001-2024 by
+ * Copyright (C) 2001-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/base/fttype1.c b/src/java.desktop/share/native/libfreetype/src/base/fttype1.c
index cedf7c40505..77978df674d 100644
--- a/src/java.desktop/share/native/libfreetype/src/base/fttype1.c
+++ b/src/java.desktop/share/native/libfreetype/src/base/fttype1.c
@@ -4,7 +4,7 @@
  *
  *   FreeType utility file for PS names support (body).
  *
- * Copyright (C) 2002-2024 by
+ * Copyright (C) 2002-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/base/ftutil.c b/src/java.desktop/share/native/libfreetype/src/base/ftutil.c
index b13512f8704..0b7382627c5 100644
--- a/src/java.desktop/share/native/libfreetype/src/base/ftutil.c
+++ b/src/java.desktop/share/native/libfreetype/src/base/ftutil.c
@@ -4,7 +4,7 @@
  *
  *   FreeType utility file for memory and list management (body).
  *
- * Copyright (C) 2002-2024 by
+ * Copyright (C) 2002-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/cff/cffcmap.c b/src/java.desktop/share/native/libfreetype/src/cff/cffcmap.c
index ea5f8ed2885..cb69abdb90f 100644
--- a/src/java.desktop/share/native/libfreetype/src/cff/cffcmap.c
+++ b/src/java.desktop/share/native/libfreetype/src/cff/cffcmap.c
@@ -4,7 +4,7 @@
  *
  *   CFF character mapping table (cmap) support (body).
  *
- * Copyright (C) 2002-2024 by
+ * Copyright (C) 2002-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/cff/cffcmap.h b/src/java.desktop/share/native/libfreetype/src/cff/cffcmap.h
index 1dd8700cd8b..60e16d94875 100644
--- a/src/java.desktop/share/native/libfreetype/src/cff/cffcmap.h
+++ b/src/java.desktop/share/native/libfreetype/src/cff/cffcmap.h
@@ -4,7 +4,7 @@
  *
  *   CFF character mapping table (cmap) support (specification).
  *
- * Copyright (C) 2002-2024 by
+ * Copyright (C) 2002-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/cff/cffdrivr.c b/src/java.desktop/share/native/libfreetype/src/cff/cffdrivr.c
index f6ebdb3810a..0079ddd1950 100644
--- a/src/java.desktop/share/native/libfreetype/src/cff/cffdrivr.c
+++ b/src/java.desktop/share/native/libfreetype/src/cff/cffdrivr.c
@@ -4,7 +4,7 @@
  *
  *   OpenType font driver implementation (body).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, Werner Lemberg, and Dominik Röttsches.
  *
  * This file is part of the FreeType project, and may only be used,
@@ -121,7 +121,20 @@
     kerning->y = 0;
 
     if ( sfnt )
-      kerning->x = sfnt->get_kerning( cffface, left_glyph, right_glyph );
+    {
+      /* Use 'kern' table if available since that can be faster; otherwise */
+      /* use GPOS kerning pairs if available.                              */
+      if ( cffface->kern_avail_bits )
+        kerning->x = sfnt->get_kerning( cffface,
+                                        left_glyph,
+                                        right_glyph );
+#ifdef TT_CONFIG_OPTION_GPOS_KERNING
+      else if ( cffface->num_gpos_lookups_kerning )
+        kerning->x = sfnt->get_gpos_kerning( cffface,
+                                             left_glyph,
+                                             right_glyph );
+#endif
+    }
 
     return FT_Err_Ok;
   }
@@ -168,25 +181,7 @@
     CFF_Size       cffsize = (CFF_Size)size;
 
 
-    if ( !cffslot )
-      return FT_THROW( Invalid_Slot_Handle );
-
-    FT_TRACE1(( "cff_glyph_load: glyph index %d\n", glyph_index ));
-
-    /* check whether we want a scaled outline or bitmap */
-    if ( !cffsize )
-      load_flags |= FT_LOAD_NO_SCALE | FT_LOAD_NO_HINTING;
-
-    /* reset the size object if necessary */
-    if ( load_flags & FT_LOAD_NO_SCALE )
-      size = NULL;
-
-    if ( size )
-    {
-      /* these two objects must have the same parent */
-      if ( size->face != slot->face )
-        return FT_THROW( Invalid_Face_Handle );
-    }
+    FT_TRACE1(( "cff_glyph_load: glyph index %u\n", glyph_index ));
 
     /* now load the glyph outline if necessary */
     error = cff_slot_load( cffslot, cffsize, glyph_index, load_flags );
@@ -205,105 +200,70 @@
                     FT_Int32   flags,
                     FT_Fixed*  advances )
   {
-    FT_UInt       nn;
-    FT_Error      error = FT_Err_Ok;
-    FT_GlyphSlot  slot  = face->glyph;
+    CFF_Face  cffface = (CFF_Face)face;
+    FT_Bool   horz;
+    FT_UInt   nn;
 
 
-    if ( FT_IS_SFNT( face ) )
+    if ( !FT_IS_SFNT( face ) )
+      return FT_THROW( Unimplemented_Feature );
+
+    horz = !( flags & FT_LOAD_VERTICAL_LAYOUT );
+
+    if ( horz )
     {
       /* OpenType 1.7 mandates that the data from `hmtx' table be used; */
       /* it is no longer necessary that those values are identical to   */
       /* the values in the `CFF' table                                  */
+      if ( !cffface->horizontal.number_Of_HMetrics )
+        return FT_THROW( Unimplemented_Feature );
 
-      CFF_Face  cffface = (CFF_Face)face;
-      FT_Short  dummy;
-
-
-      if ( flags & FT_LOAD_VERTICAL_LAYOUT )
-      {
 #ifdef TT_CONFIG_OPTION_GX_VAR_SUPPORT
-        /* no fast retrieval for blended MM fonts without VVAR table */
-        if ( ( FT_IS_NAMED_INSTANCE( face ) || FT_IS_VARIATION( face ) ) &&
-             !( cffface->variation_support & TT_FACE_FLAG_VAR_VADVANCE ) )
-          return FT_THROW( Unimplemented_Feature );
+      /* no fast retrieval for blended MM fonts without HVAR table */
+      if ( ( FT_IS_NAMED_INSTANCE( face ) || FT_IS_VARIATION( face ) ) &&
+           !( cffface->variation_support & TT_FACE_FLAG_VAR_HADVANCE ) )
+        return FT_THROW( Unimplemented_Feature );
 #endif
+    }
+    else  /* vertical */
+    {
+      /* check whether we have data from the `vmtx' table at all; */
+      /* otherwise we extract the info from the CFF glyphstrings  */
+      /* (instead of synthesizing a global value using the `OS/2' */
+      /* table)                                                   */
+      if ( !cffface->vertical_info )
+        return FT_THROW( Unimplemented_Feature );
 
-        /* check whether we have data from the `vmtx' table at all; */
-        /* otherwise we extract the info from the CFF glyphstrings  */
-        /* (instead of synthesizing a global value using the `OS/2' */
-        /* table)                                                   */
-        if ( !cffface->vertical_info )
-          goto Missing_Table;
-
-        for ( nn = 0; nn < count; nn++ )
-        {
-          FT_UShort  ah;
-
-
-          ( (SFNT_Service)cffface->sfnt )->get_metrics( cffface,
-                                                        1,
-                                                        start + nn,
-                                                        &dummy,
-                                                        &ah );
-
-          FT_TRACE5(( "  idx %d: advance height %d font unit%s\n",
-                      start + nn,
-                      ah,
-                      ah == 1 ? "" : "s" ));
-          advances[nn] = ah;
-        }
-      }
-      else
-      {
 #ifdef TT_CONFIG_OPTION_GX_VAR_SUPPORT
-        /* no fast retrieval for blended MM fonts without HVAR table */
-        if ( ( FT_IS_NAMED_INSTANCE( face ) || FT_IS_VARIATION( face ) ) &&
-             !( cffface->variation_support & TT_FACE_FLAG_VAR_HADVANCE ) )
-          return FT_THROW( Unimplemented_Feature );
+      /* no fast retrieval for blended MM fonts without VVAR table */
+      if ( ( FT_IS_NAMED_INSTANCE( face ) || FT_IS_VARIATION( face ) ) &&
+           !( cffface->variation_support & TT_FACE_FLAG_VAR_VADVANCE ) )
+        return FT_THROW( Unimplemented_Feature );
 #endif
-
-        /* check whether we have data from the `hmtx' table at all */
-        if ( !cffface->horizontal.number_Of_HMetrics )
-          goto Missing_Table;
-
-        for ( nn = 0; nn < count; nn++ )
-        {
-          FT_UShort  aw;
-
-
-          ( (SFNT_Service)cffface->sfnt )->get_metrics( cffface,
-                                                        0,
-                                                        start + nn,
-                                                        &dummy,
-                                                        &aw );
-
-          FT_TRACE5(( "  idx %d: advance width %d font unit%s\n",
-                      start + nn,
-                      aw,
-                      aw == 1 ? "" : "s" ));
-          advances[nn] = aw;
-        }
-      }
-
-      return error;
     }
 
-  Missing_Table:
-    flags |= (FT_UInt32)FT_LOAD_ADVANCE_ONLY;
-
+    /* proceed to fast advances */
     for ( nn = 0; nn < count; nn++ )
     {
-      error = cff_glyph_load( slot, face->size, start + nn, flags );
-      if ( error )
-        break;
+      FT_UShort  aw;
+      FT_Short   dummy;
 
-      advances[nn] = ( flags & FT_LOAD_VERTICAL_LAYOUT )
-                     ? slot->linearVertAdvance
-                     : slot->linearHoriAdvance;
+
+      ( (SFNT_Service)cffface->sfnt )->get_metrics( cffface,
+                                                    !horz,
+                                                    start + nn,
+                                                    &dummy,
+                                                    &aw );
+
+      FT_TRACE5(( "  idx %u: advance %s %d font unit%s\n",
+                  start + nn,
+                  horz ? "width" : "height",
+                  aw,
+                  aw == 1 ? "" : "s" ));
+      advances[nn] = aw;
     }
 
-    return error;
+    return FT_Err_Ok;
   }
 
 
diff --git a/src/java.desktop/share/native/libfreetype/src/cff/cffdrivr.h b/src/java.desktop/share/native/libfreetype/src/cff/cffdrivr.h
index fd5bc37ecd4..52a1e727a6a 100644
--- a/src/java.desktop/share/native/libfreetype/src/cff/cffdrivr.h
+++ b/src/java.desktop/share/native/libfreetype/src/cff/cffdrivr.h
@@ -4,7 +4,7 @@
  *
  *   High-level OpenType driver interface (specification).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/cff/cfferrs.h b/src/java.desktop/share/native/libfreetype/src/cff/cfferrs.h
index 128adc3b716..7491886c7be 100644
--- a/src/java.desktop/share/native/libfreetype/src/cff/cfferrs.h
+++ b/src/java.desktop/share/native/libfreetype/src/cff/cfferrs.h
@@ -4,7 +4,7 @@
  *
  *   CFF error codes (specification only).
  *
- * Copyright (C) 2001-2024 by
+ * Copyright (C) 2001-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/cff/cffgload.c b/src/java.desktop/share/native/libfreetype/src/cff/cffgload.c
index cbb071abdfe..e8bab3c1e33 100644
--- a/src/java.desktop/share/native/libfreetype/src/cff/cffgload.c
+++ b/src/java.desktop/share/native/libfreetype/src/cff/cffgload.c
@@ -4,7 +4,7 @@
  *
  *   OpenType Glyph Loader (body).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
@@ -238,24 +238,12 @@
     else if ( glyph_index >= cff->num_glyphs )
       return FT_THROW( Invalid_Argument );
 
-    if ( load_flags & FT_LOAD_NO_RECURSE )
-      load_flags |= FT_LOAD_NO_SCALE | FT_LOAD_NO_HINTING;
-
-    glyph->x_scale = 0x10000L;
-    glyph->y_scale = 0x10000L;
-    if ( size )
-    {
-      glyph->x_scale = size->root.metrics.x_scale;
-      glyph->y_scale = size->root.metrics.y_scale;
-    }
-
 #ifdef TT_CONFIG_OPTION_EMBEDDED_BITMAPS
 
     /* try to load embedded bitmap if any              */
     /*                                                 */
     /* XXX: The convention should be emphasized in     */
     /*      the documents because it can be confusing. */
-    if ( size )
     {
       CFF_Face      cff_face = (CFF_Face)size->root.face;
       SFNT_Service  sfnt     = (SFNT_Service)cff_face->sfnt;
@@ -284,9 +272,6 @@
           FT_Short   dummy;
 
 
-          glyph->root.outline.n_points   = 0;
-          glyph->root.outline.n_contours = 0;
-
           glyph->root.metrics.width  = (FT_Pos)metrics.width  * 64;
           glyph->root.metrics.height = (FT_Pos)metrics.height * 64;
 
@@ -423,6 +408,25 @@
 
 #endif /* FT_CONFIG_OPTION_SVG */
 
+    /* top-level code ensures that FT_LOAD_NO_HINTING is set */
+    /* if FT_LOAD_NO_SCALE is active                         */
+    hinting = FT_BOOL( ( load_flags & FT_LOAD_NO_HINTING ) == 0 );
+    scaled  = FT_BOOL( ( load_flags & FT_LOAD_NO_SCALE   ) == 0 );
+
+    glyph->hint        = hinting;
+    glyph->scaled      = scaled;
+
+    if ( scaled )
+    {
+      glyph->x_scale = size->root.metrics.x_scale;
+      glyph->y_scale = size->root.metrics.y_scale;
+    }
+    else
+    {
+      glyph->x_scale = 0x10000L;
+      glyph->y_scale = 0x10000L;
+    }
+
     /* if we have a CID subfont, use its matrix (which has already */
     /* been multiplied with the root matrix)                       */
 
@@ -457,18 +461,6 @@
       font_offset = cff->top_font.font_dict.font_offset;
     }
 
-    glyph->root.outline.n_points   = 0;
-    glyph->root.outline.n_contours = 0;
-
-    /* top-level code ensures that FT_LOAD_NO_HINTING is set */
-    /* if FT_LOAD_NO_SCALE is active                         */
-    hinting = FT_BOOL( ( load_flags & FT_LOAD_NO_HINTING ) == 0 );
-    scaled  = FT_BOOL( ( load_flags & FT_LOAD_NO_SCALE   ) == 0 );
-
-    glyph->hint        = hinting;
-    glyph->scaled      = scaled;
-    glyph->root.format = FT_GLYPH_FORMAT_OUTLINE;  /* by default */
-
     {
 #ifdef CFF_CONFIG_OPTION_OLD_ENGINE
       PS_Driver  driver = (PS_Driver)FT_FACE_DRIVER( face );
@@ -602,10 +594,8 @@
     {
       /* Now, set the metrics -- this is rather simple, as   */
       /* the left side bearing is the xMin, and the top side */
-      /* bearing the yMax.                                   */
-
-      /* For composite glyphs, return only left side bearing and */
-      /* advance width.                                          */
+      /* bearing the yMax. For composite glyphs, return only */
+      /* left side bearing and advance width.                */
       if ( load_flags & FT_LOAD_NO_RECURSE )
       {
         FT_Slot_Internal  internal = glyph->root.internal;
@@ -624,6 +614,12 @@
         FT_Bool            has_vertical_info;
 
 
+        glyph->root.format = FT_GLYPH_FORMAT_OUTLINE;
+
+        glyph->root.outline.flags = FT_OUTLINE_REVERSE_FILL;
+        if ( size && size->root.metrics.y_ppem < 24 )
+          glyph->root.outline.flags |= FT_OUTLINE_HIGH_PRECISION;
+
         if ( face->horizontal.number_Of_HMetrics )
         {
           FT_Short   horiBearingX = 0;
@@ -677,14 +673,6 @@
 
         glyph->root.linearVertAdvance = metrics->vertAdvance;
 
-        glyph->root.format = FT_GLYPH_FORMAT_OUTLINE;
-
-        glyph->root.outline.flags = 0;
-        if ( size && size->root.metrics.y_ppem < 24 )
-          glyph->root.outline.flags |= FT_OUTLINE_HIGH_PRECISION;
-
-        glyph->root.outline.flags |= FT_OUTLINE_REVERSE_FILL;
-
         /* apply the font matrix, if any */
         if ( font_matrix.xx != 0x10000L || font_matrix.yy != 0x10000L ||
              font_matrix.xy != 0        || font_matrix.yx != 0        )
@@ -707,7 +695,7 @@
           metrics->vertAdvance += font_offset.y;
         }
 
-        if ( ( load_flags & FT_LOAD_NO_SCALE ) == 0 || force_scaling )
+        if ( scaled || force_scaling )
         {
           /* scale the outline and the metrics */
           FT_Int       n;
diff --git a/src/java.desktop/share/native/libfreetype/src/cff/cffgload.h b/src/java.desktop/share/native/libfreetype/src/cff/cffgload.h
index 346d4b11c31..662bb7cff53 100644
--- a/src/java.desktop/share/native/libfreetype/src/cff/cffgload.h
+++ b/src/java.desktop/share/native/libfreetype/src/cff/cffgload.h
@@ -4,7 +4,7 @@
  *
  *   OpenType Glyph Loader (specification).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/cff/cffload.c b/src/java.desktop/share/native/libfreetype/src/cff/cffload.c
index 979fd45f6ca..326f885056f 100644
--- a/src/java.desktop/share/native/libfreetype/src/cff/cffload.c
+++ b/src/java.desktop/share/native/libfreetype/src/cff/cffload.c
@@ -4,7 +4,7 @@
  *
  *   OpenType and CFF data/program tables loader (body).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
@@ -442,7 +442,7 @@
       if ( cur_offset != 0 )
       {
         FT_TRACE0(( "cff_index_get_pointers:"
-                    " invalid first offset value %ld set to zero\n",
+                    " invalid first offset value %lu set to zero\n",
                     cur_offset ));
         cur_offset = 0;
       }
@@ -559,8 +559,8 @@
            idx->data_offset > stream->size - off2 + 1 )
       {
         FT_ERROR(( "cff_index_access_element:"
-                   " offset to next entry (%ld)"
-                   " exceeds the end of stream (%ld)\n",
+                   " offset to next entry (%lu)"
+                   " exceeds the end of stream (%lu)\n",
                    off2, stream->size - idx->data_offset + 1 ));
         off2 = stream->size - idx->data_offset + 1;
       }
@@ -982,7 +982,7 @@
             if ( glyph_sid > 0xFFFFL - nleft )
             {
               FT_ERROR(( "cff_charset_load: invalid SID range trimmed"
-                         " nleft=%d -> %ld\n", nleft, 0xFFFFL - glyph_sid ));
+                         " nleft=%u -> %ld\n", nleft, 0xFFFFL - glyph_sid ));
               nleft = ( FT_UInt )( 0xFFFFL - glyph_sid );
             }
 
@@ -1315,7 +1315,7 @@
 
     if ( numOperands > count )
     {
-      FT_TRACE4(( " cff_blend_doBlend: Stack underflow %d argument%s\n",
+      FT_TRACE4(( " cff_blend_doBlend: Stack underflow %u argument%s\n",
                   count,
                   count == 1 ? "" : "s" ));
 
@@ -1466,7 +1466,7 @@
       if ( master == 0 )
       {
         blend->BV[master] = FT_FIXED_ONE;
-        FT_TRACE4(( "   build blend vector len %d\n", len ));
+        FT_TRACE4(( "   build blend vector len %u\n", len ));
         FT_TRACE4(( "   [ %f ", blend->BV[master] / 65536.0 ));
         continue;
       }
@@ -2341,7 +2341,7 @@
       if ( face_index > 0 && subfont_index >= font->name_index.count )
       {
         FT_ERROR(( "cff_font_load:"
-                   " invalid subfont index for pure CFF font (%d)\n",
+                   " invalid subfont index for pure CFF font (%u)\n",
                    subfont_index ));
         error = FT_THROW( Invalid_Argument );
         goto Exit;
diff --git a/src/java.desktop/share/native/libfreetype/src/cff/cffload.h b/src/java.desktop/share/native/libfreetype/src/cff/cffload.h
index 02209245421..fdc132c8f3f 100644
--- a/src/java.desktop/share/native/libfreetype/src/cff/cffload.h
+++ b/src/java.desktop/share/native/libfreetype/src/cff/cffload.h
@@ -4,7 +4,7 @@
  *
  *   OpenType & CFF data/program tables loader (specification).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/cff/cffobjs.c b/src/java.desktop/share/native/libfreetype/src/cff/cffobjs.c
index 7c6713739a1..1aeb908f4a1 100644
--- a/src/java.desktop/share/native/libfreetype/src/cff/cffobjs.c
+++ b/src/java.desktop/share/native/libfreetype/src/cff/cffobjs.c
@@ -4,7 +4,7 @@
  *
  *   OpenType objects manager (body).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
@@ -537,8 +537,8 @@
 
       sfnt_format = 1;
 
-      /* now, the font can be either an OpenType/CFF font, or an SVG CEF */
-      /* font; in the latter case it doesn't have a `head' table         */
+      /* the font may be OpenType/CFF, SVG CEF, or sfnt/CFF; a `head' table */
+      /* implies OpenType/CFF, otherwise just look for an optional cmap     */
       error = face->goto_table( face, TTAG_head, stream, 0 );
       if ( !error )
       {
@@ -554,7 +554,9 @@
       {
         /* load the `cmap' table explicitly */
         error = sfnt->load_cmap( face, stream );
-        if ( error )
+
+        /* this may fail because CID-keyed fonts don't have a cmap */
+        if ( FT_ERR_NEQ( error, Table_Missing ) && FT_ERR_NEQ( error, Ok ) )
           goto Exit;
       }
 
@@ -651,7 +653,7 @@
         {
           s = cff_index_get_sid_string( cff, idx );
           if ( s )
-            FT_TRACE4(( "  %5d %s\n", idx, s ));
+            FT_TRACE4(( "  %5u %s\n", idx, s ));
         }
 
         /* In Multiple Master CFFs, two SIDs hold the Normalize Design  */
@@ -666,7 +668,7 @@
           FT_PtrDist  l;
 
 
-          FT_TRACE4(( "  %5d ", idx + 390 ));
+          FT_TRACE4(( "  %5u ", idx + 390 ));
           for ( l = 0; l < s1len; l++ )
             FT_TRACE4(( "%c", s1[l] ));
           FT_TRACE4(( "\n" ));
@@ -681,7 +683,7 @@
           FT_PtrDist  l;
 
 
-          FT_TRACE4(( "  %5d ", cff->num_strings + 390 ));
+          FT_TRACE4(( "  %5u ", cff->num_strings + 390 ));
           for ( l = 0; l < s1len; l++ )
             FT_TRACE4(( "%c", s1[l] ));
           FT_TRACE4(( "\n" ));
diff --git a/src/java.desktop/share/native/libfreetype/src/cff/cffobjs.h b/src/java.desktop/share/native/libfreetype/src/cff/cffobjs.h
index 91ad83b1cd0..982dcd64dd0 100644
--- a/src/java.desktop/share/native/libfreetype/src/cff/cffobjs.h
+++ b/src/java.desktop/share/native/libfreetype/src/cff/cffobjs.h
@@ -4,7 +4,7 @@
  *
  *   OpenType objects manager (specification).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/cff/cffparse.c b/src/java.desktop/share/native/libfreetype/src/cff/cffparse.c
index 92a69c3b516..864b2490b3b 100644
--- a/src/java.desktop/share/native/libfreetype/src/cff/cffparse.c
+++ b/src/java.desktop/share/native/libfreetype/src/cff/cffparse.c
@@ -4,7 +4,7 @@
  *
  *   CFF token stream parser (body)
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
@@ -892,7 +892,7 @@
                    dict->cid_supplement ));
       error = FT_Err_Ok;
 
-      FT_TRACE4(( " %d %d %ld\n",
+      FT_TRACE4(( " %u %u %ld\n",
                   dict->cid_registry,
                   dict->cid_ordering,
                   dict->cid_supplement ));
@@ -929,7 +929,7 @@
 
     priv->vsindex = (FT_UInt)cff_parse_num( parser, data++ );
 
-    FT_TRACE4(( " %d\n", priv->vsindex ));
+    FT_TRACE4(( " %u\n", priv->vsindex ));
 
     error = FT_Err_Ok;
 
@@ -979,7 +979,7 @@
       goto Exit;
     }
 
-    FT_TRACE4(( "   %d value%s blended\n",
+    FT_TRACE4(( "   %u value%s blended\n",
                 numBlends,
                 numBlends == 1 ? "" : "s" ));
 
@@ -1014,7 +1014,7 @@
     if ( dict->maxstack < CFF2_DEFAULT_STACK )
       dict->maxstack = CFF2_DEFAULT_STACK;
 
-    FT_TRACE4(( " %d\n", dict->maxstack ));
+    FT_TRACE4(( " %u\n", dict->maxstack ));
 
   Exit:
     return error;
diff --git a/src/java.desktop/share/native/libfreetype/src/cff/cffparse.h b/src/java.desktop/share/native/libfreetype/src/cff/cffparse.h
index ca6b18af6aa..47cceb1a4a0 100644
--- a/src/java.desktop/share/native/libfreetype/src/cff/cffparse.h
+++ b/src/java.desktop/share/native/libfreetype/src/cff/cffparse.h
@@ -4,7 +4,7 @@
  *
  *   CFF token stream parser (specification)
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/cff/cfftoken.h b/src/java.desktop/share/native/libfreetype/src/cff/cfftoken.h
index da45faa7f4e..cc5aaa2867a 100644
--- a/src/java.desktop/share/native/libfreetype/src/cff/cfftoken.h
+++ b/src/java.desktop/share/native/libfreetype/src/cff/cfftoken.h
@@ -4,7 +4,7 @@
  *
  *   CFF token definitions (specification only).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/cid/ciderrs.h b/src/java.desktop/share/native/libfreetype/src/cid/ciderrs.h
index c439a8c4a0b..1591979d370 100644
--- a/src/java.desktop/share/native/libfreetype/src/cid/ciderrs.h
+++ b/src/java.desktop/share/native/libfreetype/src/cid/ciderrs.h
@@ -4,7 +4,7 @@
  *
  *   CID error codes (specification only).
  *
- * Copyright (C) 2001-2024 by
+ * Copyright (C) 2001-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/cid/cidgload.c b/src/java.desktop/share/native/libfreetype/src/cid/cidgload.c
index 7b571322d45..249ede5757d 100644
--- a/src/java.desktop/share/native/libfreetype/src/cid/cidgload.c
+++ b/src/java.desktop/share/native/libfreetype/src/cid/cidgload.c
@@ -4,7 +4,7 @@
  *
  *   CID-keyed Type1 Glyph Loader (body).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
@@ -103,20 +103,20 @@
       if ( ( cid->fd_bytes == 1 && fd_select == 0xFFU   ) ||
            ( cid->fd_bytes == 2 && fd_select == 0xFFFFU ) )
       {
-        FT_TRACE1(( "cid_load_glyph: fail for glyph index %d:\n",
+        FT_TRACE1(( "cid_load_glyph: fail for glyph index %u:\n",
                     glyph_index ));
-        FT_TRACE1(( "                FD number %ld is the maximum\n",
+        FT_TRACE1(( "                FD number %lu is the maximum\n",
                     fd_select ));
-        FT_TRACE1(( "                integer fitting into %d byte%s\n",
+        FT_TRACE1(( "                integer fitting into %u byte%s\n",
                     cid->fd_bytes, cid->fd_bytes == 1 ? "" : "s" ));
       }
       else
       {
-        FT_TRACE0(( "cid_load_glyph: fail for glyph index %d:\n",
+        FT_TRACE0(( "cid_load_glyph: fail for glyph index %u:\n",
                     glyph_index ));
-        FT_TRACE0(( "                FD number %ld is larger\n",
+        FT_TRACE0(( "                FD number %lu is larger\n",
                     fd_select ));
-        FT_TRACE0(( "                than number of dictionaries (%d)\n",
+        FT_TRACE0(( "                than number of dictionaries (%u)\n",
                     cid->num_dicts ));
       }
 
@@ -125,7 +125,7 @@
     }
     else if ( off2 > stream->size )
     {
-      FT_TRACE0(( "cid_load_glyph: fail for glyph index %d:\n",
+      FT_TRACE0(( "cid_load_glyph: fail for glyph index %u:\n",
                   glyph_index ));
       FT_TRACE0(( "               end of the glyph data\n" ));
       FT_TRACE0(( "               is beyond the data stream\n" ));
@@ -135,7 +135,7 @@
     }
     else if ( off1 > off2 )
     {
-      FT_TRACE0(( "cid_load_glyph: fail for glyph index %d:\n",
+      FT_TRACE0(( "cid_load_glyph: fail for glyph index %u:\n",
                   glyph_index ));
       FT_TRACE0(( "                the end position of glyph data\n" ));
       FT_TRACE0(( "                is set before the start position\n" ));
@@ -252,8 +252,8 @@
       cs_offset = decoder->lenIV >= 0 ? (FT_UInt)decoder->lenIV : 0;
       if ( cs_offset > glyph_length )
       {
-        FT_TRACE0(( "cid_load_glyph: fail for glyph_index=%d, "
-                    "offset to the charstring is beyond glyph length\n",
+        FT_TRACE0(( "cid_load_glyph: fail for glyph_index=%u,"
+                    " offset to the charstring is beyond glyph length\n",
                     glyph_index ));
         error = FT_THROW( Invalid_Offset );
         goto Exit;
@@ -452,16 +452,12 @@
     glyph->x_scale = cidsize->metrics.x_scale;
     glyph->y_scale = cidsize->metrics.y_scale;
 
-    cidglyph->outline.n_points   = 0;
-    cidglyph->outline.n_contours = 0;
-
     hinting = FT_BOOL( ( load_flags & FT_LOAD_NO_SCALE   ) == 0 &&
                        ( load_flags & FT_LOAD_NO_HINTING ) == 0 );
     scaled  = FT_BOOL( ( load_flags & FT_LOAD_NO_SCALE   ) == 0 );
 
     glyph->hint      = hinting;
     glyph->scaled    = scaled;
-    cidglyph->format = FT_GLYPH_FORMAT_OUTLINE;
 
     error = psaux->t1_decoder_funcs->init( &decoder,
                                            cidglyph->face,
@@ -501,12 +497,8 @@
 
     /* now set the metrics -- this is rather simple, as    */
     /* the left side bearing is the xMin, and the top side */
-    /* bearing the yMax                                    */
-    cidglyph->outline.flags &= FT_OUTLINE_OWNER;
-    cidglyph->outline.flags |= FT_OUTLINE_REVERSE_FILL;
-
-    /* for composite glyphs, return only left side bearing and */
-    /* advance width                                           */
+    /* bearing the yMax; for composite glyphs, return only */
+    /* left side bearing and advance width                 */
     if ( load_flags & FT_LOAD_NO_RECURSE )
     {
       FT_Slot_Internal  internal = cidglyph->internal;
@@ -527,6 +519,13 @@
       FT_Glyph_Metrics*  metrics = &cidglyph->metrics;
 
 
+      cidglyph->format = FT_GLYPH_FORMAT_OUTLINE;
+
+      cidglyph->outline.flags &= FT_OUTLINE_OWNER;
+      cidglyph->outline.flags |= FT_OUTLINE_REVERSE_FILL;
+      if ( cidsize->metrics.y_ppem < 24 )
+        cidglyph->outline.flags |= FT_OUTLINE_HIGH_PRECISION;
+
       /* copy the _unscaled_ advance width */
       metrics->horiAdvance =
         FIXED_TO_INT( decoder.builder.advance.x );
@@ -539,11 +538,6 @@
                                       face->cid.font_bbox.yMin ) >> 16;
       cidglyph->linearVertAdvance = metrics->vertAdvance;
 
-      cidglyph->format            = FT_GLYPH_FORMAT_OUTLINE;
-
-      if ( cidsize->metrics.y_ppem < 24 )
-        cidglyph->outline.flags |= FT_OUTLINE_HIGH_PRECISION;
-
       /* apply the font matrix, if any */
       if ( font_matrix.xx != 0x10000L || font_matrix.yy != 0x10000L ||
            font_matrix.xy != 0        || font_matrix.yx != 0        )
diff --git a/src/java.desktop/share/native/libfreetype/src/cid/cidgload.h b/src/java.desktop/share/native/libfreetype/src/cid/cidgload.h
index 9fdc9db5892..cef96073ded 100644
--- a/src/java.desktop/share/native/libfreetype/src/cid/cidgload.h
+++ b/src/java.desktop/share/native/libfreetype/src/cid/cidgload.h
@@ -4,7 +4,7 @@
  *
  *   OpenType Glyph Loader (specification).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/cid/cidload.c b/src/java.desktop/share/native/libfreetype/src/cid/cidload.c
index 722f5a34ddf..bb1bf13e221 100644
--- a/src/java.desktop/share/native/libfreetype/src/cid/cidload.c
+++ b/src/java.desktop/share/native/libfreetype/src/cid/cidload.c
@@ -4,7 +4,7 @@
  *
  *   CID-keyed Type1 font loader (body).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/cid/cidload.h b/src/java.desktop/share/native/libfreetype/src/cid/cidload.h
index 7f030b32df7..659dd0e378c 100644
--- a/src/java.desktop/share/native/libfreetype/src/cid/cidload.h
+++ b/src/java.desktop/share/native/libfreetype/src/cid/cidload.h
@@ -4,7 +4,7 @@
  *
  *   CID-keyed Type1 font loader (specification).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/cid/cidobjs.c b/src/java.desktop/share/native/libfreetype/src/cid/cidobjs.c
index 8d337c41128..634bbf2f135 100644
--- a/src/java.desktop/share/native/libfreetype/src/cid/cidobjs.c
+++ b/src/java.desktop/share/native/libfreetype/src/cid/cidobjs.c
@@ -4,7 +4,7 @@
  *
  *   CID objects manager (body).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/cid/cidobjs.h b/src/java.desktop/share/native/libfreetype/src/cid/cidobjs.h
index d371cbe9954..800268efa2f 100644
--- a/src/java.desktop/share/native/libfreetype/src/cid/cidobjs.h
+++ b/src/java.desktop/share/native/libfreetype/src/cid/cidobjs.h
@@ -4,7 +4,7 @@
  *
  *   CID objects manager (specification).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/cid/cidparse.c b/src/java.desktop/share/native/libfreetype/src/cid/cidparse.c
index 73a3ade893b..4d1ba335960 100644
--- a/src/java.desktop/share/native/libfreetype/src/cid/cidparse.c
+++ b/src/java.desktop/share/native/libfreetype/src/cid/cidparse.c
@@ -4,7 +4,7 @@
  *
  *   CID-keyed Type1 parser (body).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/cid/cidparse.h b/src/java.desktop/share/native/libfreetype/src/cid/cidparse.h
index 0f5baddcb92..6ae2e542394 100644
--- a/src/java.desktop/share/native/libfreetype/src/cid/cidparse.h
+++ b/src/java.desktop/share/native/libfreetype/src/cid/cidparse.h
@@ -4,7 +4,7 @@
  *
  *   CID-keyed Type1 parser (specification).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/cid/cidriver.c b/src/java.desktop/share/native/libfreetype/src/cid/cidriver.c
index 4be8a5c00d5..a3a587c57bf 100644
--- a/src/java.desktop/share/native/libfreetype/src/cid/cidriver.c
+++ b/src/java.desktop/share/native/libfreetype/src/cid/cidriver.c
@@ -4,7 +4,7 @@
  *
  *   CID driver interface (body).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/cid/cidriver.h b/src/java.desktop/share/native/libfreetype/src/cid/cidriver.h
index 7ddce431c5b..55d0b8a0d9b 100644
--- a/src/java.desktop/share/native/libfreetype/src/cid/cidriver.h
+++ b/src/java.desktop/share/native/libfreetype/src/cid/cidriver.h
@@ -4,7 +4,7 @@
  *
  *   High-level CID driver interface (specification).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/cid/cidtoken.h b/src/java.desktop/share/native/libfreetype/src/cid/cidtoken.h
index 160897d1447..25ba74fed94 100644
--- a/src/java.desktop/share/native/libfreetype/src/cid/cidtoken.h
+++ b/src/java.desktop/share/native/libfreetype/src/cid/cidtoken.h
@@ -4,7 +4,7 @@
  *
  *   CID token definitions (specification only).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/psaux/afmparse.c b/src/java.desktop/share/native/libfreetype/src/psaux/afmparse.c
index e2f6a8e5adb..b813efde4eb 100644
--- a/src/java.desktop/share/native/libfreetype/src/psaux/afmparse.c
+++ b/src/java.desktop/share/native/libfreetype/src/psaux/afmparse.c
@@ -4,7 +4,7 @@
  *
  *   AFM parser (body).
  *
- * Copyright (C) 2006-2024 by
+ * Copyright (C) 2006-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/psaux/afmparse.h b/src/java.desktop/share/native/libfreetype/src/psaux/afmparse.h
index b7766372821..add8597717d 100644
--- a/src/java.desktop/share/native/libfreetype/src/psaux/afmparse.h
+++ b/src/java.desktop/share/native/libfreetype/src/psaux/afmparse.h
@@ -4,7 +4,7 @@
  *
  *   AFM parser (specification).
  *
- * Copyright (C) 2006-2024 by
+ * Copyright (C) 2006-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/psaux/cffdecode.c b/src/java.desktop/share/native/libfreetype/src/psaux/cffdecode.c
index 9556e11a586..17bdd23c7d4 100644
--- a/src/java.desktop/share/native/libfreetype/src/psaux/cffdecode.c
+++ b/src/java.desktop/share/native/libfreetype/src/psaux/cffdecode.c
@@ -4,7 +4,7 @@
  *
  *   PostScript CFF (Type 2) decoding routines (body).
  *
- * Copyright (C) 2017-2024 by
+ * Copyright (C) 2017-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
@@ -2141,7 +2141,7 @@
                                       decoder->locals_bias );
 
 
-            FT_TRACE4(( " callsubr (idx %d, entering level %td)\n",
+            FT_TRACE4(( " callsubr (idx %u, entering level %td)\n",
                         idx,
                         zone - decoder->zones + 1 ));
 
@@ -2185,7 +2185,7 @@
                                       decoder->globals_bias );
 
 
-            FT_TRACE4(( " callgsubr (idx %d, entering level %td)\n",
+            FT_TRACE4(( " callgsubr (idx %u, entering level %td)\n",
                         idx,
                         zone - decoder->zones + 1 ));
 
diff --git a/src/java.desktop/share/native/libfreetype/src/psaux/cffdecode.h b/src/java.desktop/share/native/libfreetype/src/psaux/cffdecode.h
index 038f7235c3d..e72ec043baa 100644
--- a/src/java.desktop/share/native/libfreetype/src/psaux/cffdecode.h
+++ b/src/java.desktop/share/native/libfreetype/src/psaux/cffdecode.h
@@ -4,7 +4,7 @@
  *
  *   PostScript CFF (Type 2) decoding routines (specification).
  *
- * Copyright (C) 2017-2024 by
+ * Copyright (C) 2017-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/psaux/psauxerr.h b/src/java.desktop/share/native/libfreetype/src/psaux/psauxerr.h
index 18428c40d5a..0d7fe2b6121 100644
--- a/src/java.desktop/share/native/libfreetype/src/psaux/psauxerr.h
+++ b/src/java.desktop/share/native/libfreetype/src/psaux/psauxerr.h
@@ -4,7 +4,7 @@
  *
  *   PS auxiliary module error codes (specification only).
  *
- * Copyright (C) 2001-2024 by
+ * Copyright (C) 2001-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/psaux/psauxmod.c b/src/java.desktop/share/native/libfreetype/src/psaux/psauxmod.c
index 6826f9d8d3e..942804190c5 100644
--- a/src/java.desktop/share/native/libfreetype/src/psaux/psauxmod.c
+++ b/src/java.desktop/share/native/libfreetype/src/psaux/psauxmod.c
@@ -4,7 +4,7 @@
  *
  *   FreeType auxiliary PostScript module implementation (body).
  *
- * Copyright (C) 2000-2024 by
+ * Copyright (C) 2000-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/psaux/psauxmod.h b/src/java.desktop/share/native/libfreetype/src/psaux/psauxmod.h
index 82d7e348af8..4a5ebc1b607 100644
--- a/src/java.desktop/share/native/libfreetype/src/psaux/psauxmod.h
+++ b/src/java.desktop/share/native/libfreetype/src/psaux/psauxmod.h
@@ -4,7 +4,7 @@
  *
  *   FreeType auxiliary PostScript module implementation (specification).
  *
- * Copyright (C) 2000-2024 by
+ * Copyright (C) 2000-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
@@ -46,9 +46,6 @@ FT_BEGIN_HEADER
   const CFF_Decoder_FuncsRec  cff_decoder_funcs;
 
 
-  FT_EXPORT_VAR( const FT_Module_Class )  psaux_driver_class;
-
-
   FT_DECLARE_MODULE( psaux_module_class )
 
 
diff --git a/src/java.desktop/share/native/libfreetype/src/psaux/psconv.c b/src/java.desktop/share/native/libfreetype/src/psaux/psconv.c
index 56c0ecd1d7f..4567d3f3c06 100644
--- a/src/java.desktop/share/native/libfreetype/src/psaux/psconv.c
+++ b/src/java.desktop/share/native/libfreetype/src/psaux/psconv.c
@@ -4,7 +4,7 @@
  *
  *   Some convenience conversions (body).
  *
- * Copyright (C) 2006-2024 by
+ * Copyright (C) 2006-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/psaux/psconv.h b/src/java.desktop/share/native/libfreetype/src/psaux/psconv.h
index 91fcd15a1c9..63735af411f 100644
--- a/src/java.desktop/share/native/libfreetype/src/psaux/psconv.h
+++ b/src/java.desktop/share/native/libfreetype/src/psaux/psconv.h
@@ -4,7 +4,7 @@
  *
  *   Some convenience conversions (specification).
  *
- * Copyright (C) 2006-2024 by
+ * Copyright (C) 2006-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/psaux/psintrp.c b/src/java.desktop/share/native/libfreetype/src/psaux/psintrp.c
index 7572e225e37..7e3475e6f58 100644
--- a/src/java.desktop/share/native/libfreetype/src/psaux/psintrp.c
+++ b/src/java.desktop/share/native/libfreetype/src/psaux/psintrp.c
@@ -618,7 +618,7 @@
     /*       Our copy of it does not change that requirement.         */
     cf2_arrstack_setCount( &subrStack, CF2_MAX_SUBR + 1 );
 
-    charstring  = (CF2_Buffer)cf2_arrstack_getBuffer( &subrStack );
+    charstring = (CF2_Buffer)cf2_arrstack_getBuffer( &subrStack );
 
     /* catch errors so far */
     if ( *error )
diff --git a/src/java.desktop/share/native/libfreetype/src/psaux/psobjs.c b/src/java.desktop/share/native/libfreetype/src/psaux/psobjs.c
index eca465f009e..8159fd6ef15 100644
--- a/src/java.desktop/share/native/libfreetype/src/psaux/psobjs.c
+++ b/src/java.desktop/share/native/libfreetype/src/psaux/psobjs.c
@@ -4,7 +4,7 @@
  *
  *   Auxiliary functions for PostScript fonts (body).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
@@ -460,6 +460,9 @@
       case '%':
         skip_comment( &cur, limit );
         break;
+
+      default:
+        break;
       }
     }
 
@@ -1145,7 +1148,7 @@
             FT_ERROR(( "ps_parser_load_field:"
                        " expected a name or string\n" ));
             FT_ERROR(( "                     "
-                       " but found token of type %d instead\n",
+                       " but found token of type %u instead\n",
                        token.type ));
             error = FT_THROW( Invalid_File_Format );
             goto Exit;
@@ -1225,7 +1228,7 @@
             if ( result < 0 || (FT_UInt)result < max_objects )
             {
               FT_ERROR(( "ps_parser_load_field:"
-                         " expected %d integer%s in the %s subarray\n",
+                         " expected %u integer%s in the %s subarray\n",
                          max_objects, max_objects > 1 ? "s" : "",
                          i == 0 ? "first"
                                 : ( i == 1 ? "second"
diff --git a/src/java.desktop/share/native/libfreetype/src/psaux/psobjs.h b/src/java.desktop/share/native/libfreetype/src/psaux/psobjs.h
index 345fc8a7335..277aa1247c5 100644
--- a/src/java.desktop/share/native/libfreetype/src/psaux/psobjs.h
+++ b/src/java.desktop/share/native/libfreetype/src/psaux/psobjs.h
@@ -4,7 +4,7 @@
  *
  *   Auxiliary functions for PostScript fonts (specification).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/psaux/t1cmap.c b/src/java.desktop/share/native/libfreetype/src/psaux/t1cmap.c
index 5681c3bd0fd..66493b68123 100644
--- a/src/java.desktop/share/native/libfreetype/src/psaux/t1cmap.c
+++ b/src/java.desktop/share/native/libfreetype/src/psaux/t1cmap.c
@@ -4,7 +4,7 @@
  *
  *   Type 1 character map support (body).
  *
- * Copyright (C) 2002-2024 by
+ * Copyright (C) 2002-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/psaux/t1cmap.h b/src/java.desktop/share/native/libfreetype/src/psaux/t1cmap.h
index 445e6a2784f..114bfbb0410 100644
--- a/src/java.desktop/share/native/libfreetype/src/psaux/t1cmap.h
+++ b/src/java.desktop/share/native/libfreetype/src/psaux/t1cmap.h
@@ -4,7 +4,7 @@
  *
  *   Type 1 character map support (specification).
  *
- * Copyright (C) 2002-2024 by
+ * Copyright (C) 2002-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/psaux/t1decode.c b/src/java.desktop/share/native/libfreetype/src/psaux/t1decode.c
index c74baa8038f..c3fb343d4c9 100644
--- a/src/java.desktop/share/native/libfreetype/src/psaux/t1decode.c
+++ b/src/java.desktop/share/native/libfreetype/src/psaux/t1decode.c
@@ -4,7 +4,7 @@
  *
  *   PostScript Type 1 decoding routines (body).
  *
- * Copyright (C) 2000-2024 by
+ * Copyright (C) 2000-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
@@ -1633,7 +1633,7 @@
 
         default:
           FT_ERROR(( "t1_decoder_parse_charstrings:"
-                     " unhandled opcode %d\n", op ));
+                     " unhandled opcode %u\n", op ));
           goto Syntax_Error;
         }
 
diff --git a/src/java.desktop/share/native/libfreetype/src/psaux/t1decode.h b/src/java.desktop/share/native/libfreetype/src/psaux/t1decode.h
index 16203b8f734..7b913f55dff 100644
--- a/src/java.desktop/share/native/libfreetype/src/psaux/t1decode.h
+++ b/src/java.desktop/share/native/libfreetype/src/psaux/t1decode.h
@@ -4,7 +4,7 @@
  *
  *   PostScript Type 1 decoding routines (specification).
  *
- * Copyright (C) 2000-2024 by
+ * Copyright (C) 2000-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/pshinter/pshalgo.c b/src/java.desktop/share/native/libfreetype/src/pshinter/pshalgo.c
index 967767b3485..ca30702321d 100644
--- a/src/java.desktop/share/native/libfreetype/src/pshinter/pshalgo.c
+++ b/src/java.desktop/share/native/libfreetype/src/pshinter/pshalgo.c
@@ -4,7 +4,7 @@
  *
  *   PostScript hinting algorithm (body).
  *
- * Copyright (C) 2001-2024 by
+ * Copyright (C) 2001-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used
@@ -100,7 +100,7 @@
 
     if ( idx >= table->max_hints )
     {
-      FT_TRACE0(( "psh_hint_table_record: invalid hint index %d\n", idx ));
+      FT_TRACE0(( "psh_hint_table_record: invalid hint index %u\n", idx ));
       return;
     }
 
diff --git a/src/java.desktop/share/native/libfreetype/src/pshinter/pshalgo.h b/src/java.desktop/share/native/libfreetype/src/pshinter/pshalgo.h
index fb362f061b6..f4aa8540559 100644
--- a/src/java.desktop/share/native/libfreetype/src/pshinter/pshalgo.h
+++ b/src/java.desktop/share/native/libfreetype/src/pshinter/pshalgo.h
@@ -4,7 +4,7 @@
  *
  *   PostScript hinting algorithm (specification).
  *
- * Copyright (C) 2001-2024 by
+ * Copyright (C) 2001-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/pshinter/pshglob.c b/src/java.desktop/share/native/libfreetype/src/pshinter/pshglob.c
index 435f45838ff..521a5ff6c5c 100644
--- a/src/java.desktop/share/native/libfreetype/src/pshinter/pshglob.c
+++ b/src/java.desktop/share/native/libfreetype/src/pshinter/pshglob.c
@@ -5,7 +5,7 @@
  *   PostScript hinter global hinting management (body).
  *   Inspired by the new auto-hinter module.
  *
- * Copyright (C) 2001-2024 by
+ * Copyright (C) 2001-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used
diff --git a/src/java.desktop/share/native/libfreetype/src/pshinter/pshglob.h b/src/java.desktop/share/native/libfreetype/src/pshinter/pshglob.h
index c5a5c913168..555e99facb2 100644
--- a/src/java.desktop/share/native/libfreetype/src/pshinter/pshglob.h
+++ b/src/java.desktop/share/native/libfreetype/src/pshinter/pshglob.h
@@ -4,7 +4,7 @@
  *
  *   PostScript hinter global hinting management.
  *
- * Copyright (C) 2001-2024 by
+ * Copyright (C) 2001-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/pshinter/pshmod.c b/src/java.desktop/share/native/libfreetype/src/pshinter/pshmod.c
index 9965d5b16bf..c9f4a94fe98 100644
--- a/src/java.desktop/share/native/libfreetype/src/pshinter/pshmod.c
+++ b/src/java.desktop/share/native/libfreetype/src/pshinter/pshmod.c
@@ -4,7 +4,7 @@
  *
  *   FreeType PostScript hinter module implementation (body).
  *
- * Copyright (C) 2001-2024 by
+ * Copyright (C) 2001-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/pshinter/pshmod.h b/src/java.desktop/share/native/libfreetype/src/pshinter/pshmod.h
index 62ac0a60fdc..de9c398e9fb 100644
--- a/src/java.desktop/share/native/libfreetype/src/pshinter/pshmod.h
+++ b/src/java.desktop/share/native/libfreetype/src/pshinter/pshmod.h
@@ -4,7 +4,7 @@
  *
  *   PostScript hinter module interface (specification).
  *
- * Copyright (C) 2001-2024 by
+ * Copyright (C) 2001-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/pshinter/pshnterr.h b/src/java.desktop/share/native/libfreetype/src/pshinter/pshnterr.h
index e9641340e53..7076664ddde 100644
--- a/src/java.desktop/share/native/libfreetype/src/pshinter/pshnterr.h
+++ b/src/java.desktop/share/native/libfreetype/src/pshinter/pshnterr.h
@@ -4,7 +4,7 @@
  *
  *   PS Hinter error codes (specification only).
  *
- * Copyright (C) 2003-2024 by
+ * Copyright (C) 2003-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/pshinter/pshrec.c b/src/java.desktop/share/native/libfreetype/src/pshinter/pshrec.c
index 0b2b549fc29..13754313fbb 100644
--- a/src/java.desktop/share/native/libfreetype/src/pshinter/pshrec.c
+++ b/src/java.desktop/share/native/libfreetype/src/pshinter/pshrec.c
@@ -4,7 +4,7 @@
  *
  *   FreeType PostScript hints recorder (body).
  *
- * Copyright (C) 2001-2024 by
+ * Copyright (C) 2001-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
@@ -467,7 +467,7 @@
       table->num_masks--;
     }
     else
-      FT_TRACE0(( "ps_mask_table_merge: ignoring invalid indices (%d,%d)\n",
+      FT_TRACE0(( "ps_mask_table_merge: ignoring invalid indices (%u,%u)\n",
                   index1, index2 ));
 
   Exit:
@@ -817,7 +817,7 @@
     /* limit "dimension" to 0..1 */
     if ( dimension > 1 )
     {
-      FT_TRACE0(( "ps_hints_stem: invalid dimension (%d) used\n",
+      FT_TRACE0(( "ps_hints_stem: invalid dimension (%u) used\n",
                   dimension ));
       dimension = ( dimension != 0 );
     }
@@ -870,7 +870,7 @@
       /* limit "dimension" to 0..1 */
       if ( dimension > 1 )
       {
-        FT_TRACE0(( "ps_hints_t1stem3: invalid dimension (%d) used\n",
+        FT_TRACE0(( "ps_hints_t1stem3: invalid dimension (%u) used\n",
                     dimension ));
         dimension = ( dimension != 0 );
       }
@@ -976,7 +976,7 @@
       if ( bit_count !=  count1 + count2 )
       {
         FT_TRACE0(( "ps_hints_t2mask:"
-                    " called with invalid bitcount %d (instead of %d)\n",
+                    " called with invalid bitcount %u (instead of %u)\n",
                    bit_count, count1 + count2 ));
 
         /* simply ignore the operator */
@@ -1022,7 +1022,7 @@
       if ( bit_count !=  count1 + count2 )
       {
         FT_TRACE0(( "ps_hints_t2counter:"
-                    " called with invalid bitcount %d (instead of %d)\n",
+                    " called with invalid bitcount %u (instead of %u)\n",
                    bit_count, count1 + count2 ));
 
         /* simply ignore the operator */
diff --git a/src/java.desktop/share/native/libfreetype/src/pshinter/pshrec.h b/src/java.desktop/share/native/libfreetype/src/pshinter/pshrec.h
index 7e375af7ba8..a79069f98d2 100644
--- a/src/java.desktop/share/native/libfreetype/src/pshinter/pshrec.h
+++ b/src/java.desktop/share/native/libfreetype/src/pshinter/pshrec.h
@@ -4,7 +4,7 @@
  *
  *   Postscript (Type1/Type2) hints recorder (specification).
  *
- * Copyright (C) 2001-2024 by
+ * Copyright (C) 2001-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/psnames/psmodule.c b/src/java.desktop/share/native/libfreetype/src/psnames/psmodule.c
index 35d054d1cfb..c5d71edad88 100644
--- a/src/java.desktop/share/native/libfreetype/src/psnames/psmodule.c
+++ b/src/java.desktop/share/native/libfreetype/src/psnames/psmodule.c
@@ -4,7 +4,7 @@
  *
  *   psnames module implementation (body).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/psnames/psmodule.h b/src/java.desktop/share/native/libfreetype/src/psnames/psmodule.h
index 770458316b1..482fd0a36d1 100644
--- a/src/java.desktop/share/native/libfreetype/src/psnames/psmodule.h
+++ b/src/java.desktop/share/native/libfreetype/src/psnames/psmodule.h
@@ -4,7 +4,7 @@
  *
  *   High-level psnames module interface (specification).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/psnames/psnamerr.h b/src/java.desktop/share/native/libfreetype/src/psnames/psnamerr.h
index e123eb65e39..17987f9cd4f 100644
--- a/src/java.desktop/share/native/libfreetype/src/psnames/psnamerr.h
+++ b/src/java.desktop/share/native/libfreetype/src/psnames/psnamerr.h
@@ -4,7 +4,7 @@
  *
  *   PS names module error codes (specification only).
  *
- * Copyright (C) 2001-2024 by
+ * Copyright (C) 2001-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/psnames/pstables.h b/src/java.desktop/share/native/libfreetype/src/psnames/pstables.h
index 2a941b04609..65ce6c0b47f 100644
--- a/src/java.desktop/share/native/libfreetype/src/psnames/pstables.h
+++ b/src/java.desktop/share/native/libfreetype/src/psnames/pstables.h
@@ -4,7 +4,7 @@
  *
  *   PostScript glyph names.
  *
- * Copyright (C) 2005-2024 by
+ * Copyright (C) 2005-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/raster/ftmisc.h b/src/java.desktop/share/native/libfreetype/src/raster/ftmisc.h
index 943f2aa0a50..9d97223e94e 100644
--- a/src/java.desktop/share/native/libfreetype/src/raster/ftmisc.h
+++ b/src/java.desktop/share/native/libfreetype/src/raster/ftmisc.h
@@ -5,7 +5,7 @@
  *   Miscellaneous macros for stand-alone rasterizer (specification
  *   only).
  *
- * Copyright (C) 2005-2024 by
+ * Copyright (C) 2005-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used
diff --git a/src/java.desktop/share/native/libfreetype/src/raster/ftraster.c b/src/java.desktop/share/native/libfreetype/src/raster/ftraster.c
index e4b7b937d5a..807d444e7aa 100644
--- a/src/java.desktop/share/native/libfreetype/src/raster/ftraster.c
+++ b/src/java.desktop/share/native/libfreetype/src/raster/ftraster.c
@@ -4,7 +4,7 @@
  *
  *   The FreeType glyph rasterizer (body).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
@@ -251,7 +251,11 @@
   /* On the other hand, SMulDiv means `Slow MulDiv', and is used typically */
   /* for clipping computations.  It simply uses the FT_MulDiv() function   */
   /* defined in `ftcalc.h'.                                                */
-#define SMulDiv_No_Round  FT_MulDiv_No_Round
+#ifdef FT_INT64
+#define SMulDiv( a, b, c )  (Long)( (FT_Int64)(a) * (b) / (c) )
+#else
+#define SMulDiv  FT_MulDiv_No_Round
+#endif
 
   /* The rasterizer is a very general purpose component; please leave */
   /* the following redefinitions there (you never know your target    */
@@ -653,7 +657,7 @@
       ras.cProfile->height = 0;
     }
 
-    ras.cProfile->flags  = ras.dropOutControl;
+    ras.cProfile->flags = ras.dropOutControl;
 
     switch ( aState )
     {
@@ -967,14 +971,14 @@
       goto Fin;
     }
 
-    Ix     = SMulDiv_No_Round( e - y1, Dx, Dy );
+    Ix     = SMulDiv( e - y1, Dx, Dy );
     x1    += Ix;
     *top++ = x1;
 
     if ( --size )
     {
       Ax = Dx * ( e - y1 )    - Dy * Ix;  /* remainder */
-      Ix = FMulDiv( ras.precision, Dx, Dy );
+      Ix = SMulDiv( ras.precision, Dx, Dy );
       Rx = Dx * ras.precision - Dy * Ix;  /* remainder */
       Dx = 1;
 
@@ -1090,8 +1094,8 @@
     PLong  top;
 
 
-    y1  = arc[degree].y;
-    y2  = arc[0].y;
+    y1 = arc[degree].y;
+    y2 = arc[0].y;
 
     if ( y2 < miny || y1 > maxy )
       return SUCCESS;
diff --git a/src/java.desktop/share/native/libfreetype/src/raster/ftraster.h b/src/java.desktop/share/native/libfreetype/src/raster/ftraster.h
index ad9cb1b9fe0..64499bf955b 100644
--- a/src/java.desktop/share/native/libfreetype/src/raster/ftraster.h
+++ b/src/java.desktop/share/native/libfreetype/src/raster/ftraster.h
@@ -4,7 +4,7 @@
  *
  *   The FreeType glyph rasterizer (specification).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used
diff --git a/src/java.desktop/share/native/libfreetype/src/raster/ftrend1.c b/src/java.desktop/share/native/libfreetype/src/raster/ftrend1.c
index fd9f174f2e1..3fa008704e5 100644
--- a/src/java.desktop/share/native/libfreetype/src/raster/ftrend1.c
+++ b/src/java.desktop/share/native/libfreetype/src/raster/ftrend1.c
@@ -4,7 +4,7 @@
  *
  *   The FreeType glyph rasterizer interface (body).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/raster/ftrend1.h b/src/java.desktop/share/native/libfreetype/src/raster/ftrend1.h
index cf3e73c0a24..d838a942b04 100644
--- a/src/java.desktop/share/native/libfreetype/src/raster/ftrend1.h
+++ b/src/java.desktop/share/native/libfreetype/src/raster/ftrend1.h
@@ -4,7 +4,7 @@
  *
  *   The FreeType glyph rasterizer interface (specification).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/raster/rasterrs.h b/src/java.desktop/share/native/libfreetype/src/raster/rasterrs.h
index 326d42e0438..39d82a8051a 100644
--- a/src/java.desktop/share/native/libfreetype/src/raster/rasterrs.h
+++ b/src/java.desktop/share/native/libfreetype/src/raster/rasterrs.h
@@ -4,7 +4,7 @@
  *
  *   monochrome renderer error codes (specification only).
  *
- * Copyright (C) 2001-2024 by
+ * Copyright (C) 2001-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/sfnt/pngshim.c b/src/java.desktop/share/native/libfreetype/src/sfnt/pngshim.c
index 76181568af9..9df75dc3acc 100644
--- a/src/java.desktop/share/native/libfreetype/src/sfnt/pngshim.c
+++ b/src/java.desktop/share/native/libfreetype/src/sfnt/pngshim.c
@@ -4,7 +4,7 @@
  *
  *   PNG Bitmap glyph support.
  *
- * Copyright (C) 2013-2024 by
+ * Copyright (C) 2013-2025 by
  * Google, Inc.
  * Written by Stuart Gill and Behdad Esfahbod.
  *
diff --git a/src/java.desktop/share/native/libfreetype/src/sfnt/pngshim.h b/src/java.desktop/share/native/libfreetype/src/sfnt/pngshim.h
index 6e7a5c08e71..c59199e60df 100644
--- a/src/java.desktop/share/native/libfreetype/src/sfnt/pngshim.h
+++ b/src/java.desktop/share/native/libfreetype/src/sfnt/pngshim.h
@@ -4,7 +4,7 @@
  *
  *   PNG Bitmap glyph support.
  *
- * Copyright (C) 2013-2024 by
+ * Copyright (C) 2013-2025 by
  * Google, Inc.
  * Written by Stuart Gill and Behdad Esfahbod.
  *
diff --git a/src/java.desktop/share/native/libfreetype/src/sfnt/sfdriver.c b/src/java.desktop/share/native/libfreetype/src/sfnt/sfdriver.c
index 81072207b49..ec78247aa56 100644
--- a/src/java.desktop/share/native/libfreetype/src/sfnt/sfdriver.c
+++ b/src/java.desktop/share/native/libfreetype/src/sfnt/sfdriver.c
@@ -4,7 +4,7 @@
  *
  *   High-level SFNT driver interface (body).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
@@ -895,7 +895,7 @@
         FT_TRACE0(( "sfnt_get_var_ps_name:"
                     " Shortening variation PS name prefix\n" ));
         FT_TRACE0(( "                     "
-                    " to %d characters\n", len ));
+                    " to %u characters\n", len ));
       }
 
       face->var_postscript_prefix     = result;
diff --git a/src/java.desktop/share/native/libfreetype/src/sfnt/sfdriver.h b/src/java.desktop/share/native/libfreetype/src/sfnt/sfdriver.h
index 6f71489fdc1..be4e33166c1 100644
--- a/src/java.desktop/share/native/libfreetype/src/sfnt/sfdriver.h
+++ b/src/java.desktop/share/native/libfreetype/src/sfnt/sfdriver.h
@@ -4,7 +4,7 @@
  *
  *   High-level SFNT driver interface (specification).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/sfnt/sferrors.h b/src/java.desktop/share/native/libfreetype/src/sfnt/sferrors.h
index d3ca1d9aa8b..2da4ac776b0 100644
--- a/src/java.desktop/share/native/libfreetype/src/sfnt/sferrors.h
+++ b/src/java.desktop/share/native/libfreetype/src/sfnt/sferrors.h
@@ -4,7 +4,7 @@
  *
  *   SFNT error codes (specification only).
  *
- * Copyright (C) 2001-2024 by
+ * Copyright (C) 2001-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/sfnt/sfobjs.c b/src/java.desktop/share/native/libfreetype/src/sfnt/sfobjs.c
index 6ee4e5e939b..6af35787e85 100644
--- a/src/java.desktop/share/native/libfreetype/src/sfnt/sfobjs.c
+++ b/src/java.desktop/share/native/libfreetype/src/sfnt/sfobjs.c
@@ -4,7 +4,7 @@
  *
  *   SFNT object management (base).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
@@ -579,6 +579,9 @@
     if ( face_instance_index < 0 && face_index > 0 )
       face_index--;
 
+    /* Note that `face_index` is also used to enumerate elements */
+    /* of containers like a Mac Resource; this means we must     */
+    /* check whether we actually have a TTC.                     */
     if ( face_index >= face->ttc_header.count )
     {
       if ( face_instance_index >= 0 )
@@ -1127,9 +1130,9 @@
         flags |= FT_FACE_FLAG_VERTICAL;
 
       /* kerning available ? */
-      if ( TT_FACE_HAS_KERNING( face )
+      if ( face->kern_avail_bits
 #ifdef TT_CONFIG_OPTION_GPOS_KERNING
-           || face->gpos_kerning_available
+           || face->num_gpos_lookups_kerning
 #endif
          )
         flags |= FT_FACE_FLAG_KERNING;
diff --git a/src/java.desktop/share/native/libfreetype/src/sfnt/sfobjs.h b/src/java.desktop/share/native/libfreetype/src/sfnt/sfobjs.h
index 90847d95732..8c38b727950 100644
--- a/src/java.desktop/share/native/libfreetype/src/sfnt/sfobjs.h
+++ b/src/java.desktop/share/native/libfreetype/src/sfnt/sfobjs.h
@@ -4,7 +4,7 @@
  *
  *   SFNT object management (specification).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/sfnt/sfwoff.c b/src/java.desktop/share/native/libfreetype/src/sfnt/sfwoff.c
index 14514bf9574..015c7b78b4d 100644
--- a/src/java.desktop/share/native/libfreetype/src/sfnt/sfwoff.c
+++ b/src/java.desktop/share/native/libfreetype/src/sfnt/sfwoff.c
@@ -4,7 +4,7 @@
  *
  *   WOFF format management (base).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/sfnt/sfwoff.h b/src/java.desktop/share/native/libfreetype/src/sfnt/sfwoff.h
index a04735ffe28..df7ace5c209 100644
--- a/src/java.desktop/share/native/libfreetype/src/sfnt/sfwoff.h
+++ b/src/java.desktop/share/native/libfreetype/src/sfnt/sfwoff.h
@@ -4,7 +4,7 @@
  *
  *   WOFFF format management (specification).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/sfnt/sfwoff2.c b/src/java.desktop/share/native/libfreetype/src/sfnt/sfwoff2.c
index 589b3e0c6b7..5acbbaa2a77 100644
--- a/src/java.desktop/share/native/libfreetype/src/sfnt/sfwoff2.c
+++ b/src/java.desktop/share/native/libfreetype/src/sfnt/sfwoff2.c
@@ -4,7 +4,7 @@
  *
  *   WOFF2 format management (base).
  *
- * Copyright (C) 2019-2024 by
+ * Copyright (C) 2019-2025 by
  * Nikhil Ramakrishnan, David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
@@ -902,7 +902,7 @@
       substreams[i].offset = pos + offset;
       substreams[i].size   = substream_size;
 
-      FT_TRACE5(( "  Substream %d: offset = %lu; size = %lu;\n",
+      FT_TRACE5(( "  Substream %u: offset = %lu; size = %lu;\n",
                   i, substreams[i].offset, substreams[i].size ));
       offset += substream_size;
     }
@@ -1592,7 +1592,7 @@
       WOFF2_TableRec  table = *( indices[nn] );
 
 
-      FT_TRACE3(( "Seeking to %ld with table size %ld.\n",
+      FT_TRACE3(( "Seeking to %lu with table size %lu.\n",
                   table.src_offset, table.src_length ));
       FT_TRACE3(( "Table tag: %c%c%c%c.\n",
                   (FT_Char)( table.Tag >> 24 ),
@@ -1943,7 +1943,7 @@
       src_offset       += table->TransformLength;
       table->dst_offset = 0;
 
-      FT_TRACE2(( "  %c%c%c%c  %08d  %08d   %08ld    %08ld    %08ld\n",
+      FT_TRACE2(( "  %c%c%c%c  %08d  %08d   %08lu    %08lu    %08lu\n",
                   (FT_Char)( table->Tag >> 24 ),
                   (FT_Char)( table->Tag >> 16 ),
                   (FT_Char)( table->Tag >> 8  ),
diff --git a/src/java.desktop/share/native/libfreetype/src/sfnt/sfwoff2.h b/src/java.desktop/share/native/libfreetype/src/sfnt/sfwoff2.h
index f41140648dc..588761d0c8e 100644
--- a/src/java.desktop/share/native/libfreetype/src/sfnt/sfwoff2.h
+++ b/src/java.desktop/share/native/libfreetype/src/sfnt/sfwoff2.h
@@ -4,7 +4,7 @@
  *
  *   WOFFF2 format management (specification).
  *
- * Copyright (C) 2019-2024 by
+ * Copyright (C) 2019-2025 by
  * Nikhil Ramakrishnan, David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/sfnt/ttcmap.c b/src/java.desktop/share/native/libfreetype/src/sfnt/ttcmap.c
index 28f4d1173c0..91b02344224 100644
--- a/src/java.desktop/share/native/libfreetype/src/sfnt/ttcmap.c
+++ b/src/java.desktop/share/native/libfreetype/src/sfnt/ttcmap.c
@@ -4,7 +4,7 @@
  *
  *   TrueType character mapping table (cmap) support (body).
  *
- * Copyright (C) 2002-2024 by
+ * Copyright (C) 2002-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
@@ -179,7 +179,7 @@
 
 
     cmap_info->format   = 0;
-    cmap_info->language = (FT_ULong)TT_PEEK_USHORT( p );
+    cmap_info->language = TT_PEEK_USHORT( p );
 
     return FT_Err_Ok;
   }
@@ -596,7 +596,7 @@
 
 
     cmap_info->format   = 2;
-    cmap_info->language = (FT_ULong)TT_PEEK_USHORT( p );
+    cmap_info->language = TT_PEEK_USHORT( p );
 
     return FT_Err_Ok;
   }
@@ -1539,7 +1539,7 @@
 
 
     cmap_info->format   = 4;
-    cmap_info->language = (FT_ULong)TT_PEEK_USHORT( p );
+    cmap_info->language = TT_PEEK_USHORT( p );
 
     return FT_Err_Ok;
   }
@@ -1712,7 +1712,7 @@
 
 
     cmap_info->format   = 6;
-    cmap_info->language = (FT_ULong)TT_PEEK_USHORT( p );
+    cmap_info->language = TT_PEEK_USHORT( p );
 
     return FT_Err_Ok;
   }
@@ -2009,7 +2009,7 @@
 
 
     cmap_info->format   = 8;
-    cmap_info->language = (FT_ULong)TT_PEEK_ULONG( p );
+    cmap_info->language = TT_PEEK_ULONG( p );
 
     return FT_Err_Ok;
   }
@@ -2184,7 +2184,7 @@
 
 
     cmap_info->format   = 10;
-    cmap_info->language = (FT_ULong)TT_PEEK_ULONG( p );
+    cmap_info->language = TT_PEEK_ULONG( p );
 
     return FT_Err_Ok;
   }
@@ -2528,7 +2528,7 @@
 
 
     cmap_info->format   = 12;
-    cmap_info->language = (FT_ULong)TT_PEEK_ULONG( p );
+    cmap_info->language = TT_PEEK_ULONG( p );
 
     return FT_Err_Ok;
   }
@@ -2844,7 +2844,7 @@
 
 
     cmap_info->format   = 13;
-    cmap_info->language = (FT_ULong)TT_PEEK_ULONG( p );
+    cmap_info->language = TT_PEEK_ULONG( p );
 
     return FT_Err_Ok;
   }
@@ -3792,7 +3792,7 @@
       return FT_THROW( Invalid_Table );
 
     /* Version 1.8.3 of the OpenType specification contains the following */
-    /* (https://docs.microsoft.com/en-us/typography/opentype/spec/cmap):  */
+    /* (https://learn.microsoft.com/typography/opentype/spec/cmap):       */
     /*                                                                    */
     /*   The 'cmap' table version number remains at 0x0000 for fonts that */
     /*   make use of the newer subtable formats.                          */
@@ -3803,7 +3803,7 @@
     p += 2;
 
     num_cmaps = TT_NEXT_USHORT( p );
-    FT_TRACE4(( "tt_face_build_cmaps: %d cmaps\n", num_cmaps ));
+    FT_TRACE4(( "tt_face_build_cmaps: %u cmaps\n", num_cmaps ));
 
     limit = table + face->cmap_size;
     for ( ; num_cmaps > 0 && p + 8 <= limit; num_cmaps-- )
diff --git a/src/java.desktop/share/native/libfreetype/src/sfnt/ttcmap.h b/src/java.desktop/share/native/libfreetype/src/sfnt/ttcmap.h
index e2c5e72bf02..645e9e37e0c 100644
--- a/src/java.desktop/share/native/libfreetype/src/sfnt/ttcmap.h
+++ b/src/java.desktop/share/native/libfreetype/src/sfnt/ttcmap.h
@@ -4,7 +4,7 @@
  *
  *   TrueType character mapping table (cmap) support (specification).
  *
- * Copyright (C) 2002-2024 by
+ * Copyright (C) 2002-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/sfnt/ttcmapc.h b/src/java.desktop/share/native/libfreetype/src/sfnt/ttcmapc.h
index 370898363f3..65807bb7378 100644
--- a/src/java.desktop/share/native/libfreetype/src/sfnt/ttcmapc.h
+++ b/src/java.desktop/share/native/libfreetype/src/sfnt/ttcmapc.h
@@ -4,7 +4,7 @@
  *
  *   TT CMAP classes definitions (specification only).
  *
- * Copyright (C) 2009-2024 by
+ * Copyright (C) 2009-2025 by
  * Oran Agra and Mickey Gabel.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/sfnt/ttcolr.c b/src/java.desktop/share/native/libfreetype/src/sfnt/ttcolr.c
index b37658dde9e..ad9ad6f2710 100644
--- a/src/java.desktop/share/native/libfreetype/src/sfnt/ttcolr.c
+++ b/src/java.desktop/share/native/libfreetype/src/sfnt/ttcolr.c
@@ -4,7 +4,7 @@
  *
  *   TrueType and OpenType colored glyph layer support (body).
  *
- * Copyright (C) 2018-2024 by
+ * Copyright (C) 2018-2025 by
  * David Turner, Robert Wilhelm, Dominik Röttsches, and Werner Lemberg.
  *
  * Originally written by Shao Yu Zhang <shaozhang@fb.com>.
@@ -51,7 +51,7 @@
 #define COLOR_STOP_SIZE                   6U
 #define VAR_IDX_BASE_SIZE                 4U
 #define LAYER_SIZE                        4U
-/* https://docs.microsoft.com/en-us/typography/opentype/spec/colr#colr-header */
+/* https://learn.microsoft.com/typography/opentype/spec/colr#colr-header */
 /* 3 * uint16 + 2 * Offset32 */
 #define COLRV0_HEADER_SIZE               14U
 /* COLRV0_HEADER_SIZE + 5 * Offset32 */
diff --git a/src/java.desktop/share/native/libfreetype/src/sfnt/ttcolr.h b/src/java.desktop/share/native/libfreetype/src/sfnt/ttcolr.h
index 30031464c73..3913acc74d5 100644
--- a/src/java.desktop/share/native/libfreetype/src/sfnt/ttcolr.h
+++ b/src/java.desktop/share/native/libfreetype/src/sfnt/ttcolr.h
@@ -4,7 +4,7 @@
  *
  *   TrueType and OpenType colored glyph layer support (specification).
  *
- * Copyright (C) 2018-2024 by
+ * Copyright (C) 2018-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * Originally written by Shao Yu Zhang <shaozhang@fb.com>.
diff --git a/src/java.desktop/share/native/libfreetype/src/sfnt/ttcpal.c b/src/java.desktop/share/native/libfreetype/src/sfnt/ttcpal.c
index 997eb869ffc..6d1208f6af2 100644
--- a/src/java.desktop/share/native/libfreetype/src/sfnt/ttcpal.c
+++ b/src/java.desktop/share/native/libfreetype/src/sfnt/ttcpal.c
@@ -4,7 +4,7 @@
  *
  *   TrueType and OpenType color palette support (body).
  *
- * Copyright (C) 2018-2024 by
+ * Copyright (C) 2018-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * Originally written by Shao Yu Zhang <shaozhang@fb.com>.
diff --git a/src/java.desktop/share/native/libfreetype/src/sfnt/ttcpal.h b/src/java.desktop/share/native/libfreetype/src/sfnt/ttcpal.h
index bb301ae88b6..a0b4c9d927f 100644
--- a/src/java.desktop/share/native/libfreetype/src/sfnt/ttcpal.h
+++ b/src/java.desktop/share/native/libfreetype/src/sfnt/ttcpal.h
@@ -4,7 +4,7 @@
  *
  *   TrueType and OpenType color palette support (specification).
  *
- * Copyright (C) 2018-2024 by
+ * Copyright (C) 2018-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * Originally written by Shao Yu Zhang <shaozhang@fb.com>.
diff --git a/src/java.desktop/share/native/libfreetype/src/sfnt/ttkern.c b/src/java.desktop/share/native/libfreetype/src/sfnt/ttkern.c
index f0411366af4..76618b0d3bb 100644
--- a/src/java.desktop/share/native/libfreetype/src/sfnt/ttkern.c
+++ b/src/java.desktop/share/native/libfreetype/src/sfnt/ttkern.c
@@ -2,10 +2,9 @@
  *
  * ttkern.c
  *
- *   Load the basic TrueType kerning table.  This doesn't handle
- *   kerning data within the GPOS table at the moment.
+ *   Routines to parse and access the 'kern' table for kerning (body).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/sfnt/ttkern.h b/src/java.desktop/share/native/libfreetype/src/sfnt/ttkern.h
index a54e51df12d..e0075dce61d 100644
--- a/src/java.desktop/share/native/libfreetype/src/sfnt/ttkern.h
+++ b/src/java.desktop/share/native/libfreetype/src/sfnt/ttkern.h
@@ -2,10 +2,10 @@
  *
  * ttkern.h
  *
- *   Load the basic TrueType kerning table.  This doesn't handle
- *   kerning data within the GPOS table at the moment.
+ *   Routines to parse and access the 'kern' table for kerning
+ *   (specification).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
@@ -40,8 +40,6 @@ FT_BEGIN_HEADER
                        FT_UInt     left_glyph,
                        FT_UInt     right_glyph );
 
-#define TT_FACE_HAS_KERNING( face )  ( (face)->kern_avail_bits != 0 )
-
 
 FT_END_HEADER
 
diff --git a/src/java.desktop/share/native/libfreetype/src/sfnt/ttload.c b/src/java.desktop/share/native/libfreetype/src/sfnt/ttload.c
index c3a5fae2cb9..0c257ce4d31 100644
--- a/src/java.desktop/share/native/libfreetype/src/sfnt/ttload.c
+++ b/src/java.desktop/share/native/libfreetype/src/sfnt/ttload.c
@@ -5,7 +5,7 @@
  *   Load the basic TrueType tables, i.e., tables that can be either in
  *   TTF or OTF fonts (body).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
@@ -535,7 +535,8 @@
    *     The tag of table to load.  Use the value 0 if you want
    *     to access the whole font file, else set this parameter
    *     to a valid TrueType table tag that you can forge with
-   *     the MAKE_TT_TAG macro.
+   *     the MAKE_TT_TAG macro.  Use value 1 to access the table
+   *     directory.
    *
    *   offset ::
    *     The starting offset in the table (or the file if
@@ -577,7 +578,29 @@
     FT_ULong   size;
 
 
-    if ( tag != 0 )
+    if ( tag == 0 )
+    {
+      /* The whole font file. */
+      size = face->root.stream->size;
+    }
+    else if ( tag == 1 )
+    {
+      /* The currently selected font's table directory.            */
+      /*                                                           */
+      /* Note that `face_index` is also used to enumerate elements */
+      /* of containers like a Mac Resource; this means we must     */
+      /* check whether we actually have a TTC (with multiple table */
+      /* directories).                                             */
+      FT_Long  idx = face->root.face_index & 0xFFFF;
+
+
+      if ( idx >= face->ttc_header.count )
+        idx = 0;
+
+      offset += face->ttc_header.offsets[idx];
+      size    = 4 + 8 + 16 * face->num_tables;
+    }
+    else
     {
       /* look for tag in font directory */
       table = tt_face_lookup_table( face, tag );
@@ -590,9 +613,6 @@
       offset += table->Offset;
       size    = table->Length;
     }
-    else
-      /* tag == 0 -- the user wants to access the font file directly */
-      size = face->root.stream->size;
 
     if ( length && *length == 0 )
     {
diff --git a/src/java.desktop/share/native/libfreetype/src/sfnt/ttload.h b/src/java.desktop/share/native/libfreetype/src/sfnt/ttload.h
index 2b1d62d9bd9..e3666c901b1 100644
--- a/src/java.desktop/share/native/libfreetype/src/sfnt/ttload.h
+++ b/src/java.desktop/share/native/libfreetype/src/sfnt/ttload.h
@@ -5,7 +5,7 @@
  *   Load the basic TrueType tables, i.e., tables that can be either in
  *   TTF or OTF fonts (specification).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/sfnt/ttmtx.c b/src/java.desktop/share/native/libfreetype/src/sfnt/ttmtx.c
index 27884118563..541d8447470 100644
--- a/src/java.desktop/share/native/libfreetype/src/sfnt/ttmtx.c
+++ b/src/java.desktop/share/native/libfreetype/src/sfnt/ttmtx.c
@@ -4,7 +4,7 @@
  *
  *   Load the metrics tables common to TTF and OTF fonts (body).
  *
- * Copyright (C) 2006-2024 by
+ * Copyright (C) 2006-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
@@ -306,7 +306,7 @@
     }
 
 #ifdef TT_CONFIG_OPTION_GX_VAR_SUPPORT
-    if ( var && face->blend )
+    if ( var && FT_IS_VARIATION( &face->root ) )
     {
       FT_Face  f = FT_FACE( face );
       FT_Int   a = (FT_Int)*aadvance;
diff --git a/src/java.desktop/share/native/libfreetype/src/sfnt/ttmtx.h b/src/java.desktop/share/native/libfreetype/src/sfnt/ttmtx.h
index 34b3c0e18f2..1ee84507f15 100644
--- a/src/java.desktop/share/native/libfreetype/src/sfnt/ttmtx.h
+++ b/src/java.desktop/share/native/libfreetype/src/sfnt/ttmtx.h
@@ -4,7 +4,7 @@
  *
  *   Load the metrics tables common to TTF and OTF fonts (specification).
  *
- * Copyright (C) 2006-2024 by
+ * Copyright (C) 2006-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/sfnt/ttpost.c b/src/java.desktop/share/native/libfreetype/src/sfnt/ttpost.c
index 5698a62c8d1..4246b6c8eff 100644
--- a/src/java.desktop/share/native/libfreetype/src/sfnt/ttpost.c
+++ b/src/java.desktop/share/native/libfreetype/src/sfnt/ttpost.c
@@ -5,7 +5,7 @@
  *   PostScript name table processing for TrueType and OpenType fonts
  *   (body).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/sfnt/ttpost.h b/src/java.desktop/share/native/libfreetype/src/sfnt/ttpost.h
index 150db6c3981..a11b6696854 100644
--- a/src/java.desktop/share/native/libfreetype/src/sfnt/ttpost.h
+++ b/src/java.desktop/share/native/libfreetype/src/sfnt/ttpost.h
@@ -5,7 +5,7 @@
  *   PostScript name table processing for TrueType and OpenType fonts
  *   (specification).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/sfnt/ttsbit.c b/src/java.desktop/share/native/libfreetype/src/sfnt/ttsbit.c
index cb3a8abf182..9f9013bf39b 100644
--- a/src/java.desktop/share/native/libfreetype/src/sfnt/ttsbit.c
+++ b/src/java.desktop/share/native/libfreetype/src/sfnt/ttsbit.c
@@ -4,7 +4,7 @@
  *
  *   TrueType and OpenType embedded bitmap support (body).
  *
- * Copyright (C) 2005-2024 by
+ * Copyright (C) 2005-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * Copyright 2013 by Google, Inc.
@@ -342,7 +342,7 @@
             FT_TRACE2(( "tt_face_load_strike_metrics:"
                         " sanitizing invalid ascender and descender\n" ));
             FT_TRACE2(( "                            "
-                        " values for strike %ld (%dppem, %dppem)\n",
+                        " values for strike %lu (%dppem, %dppem)\n",
                         strike_index,
                         metrics->x_ppem, metrics->y_ppem ));
 
@@ -993,7 +993,7 @@
       goto Fail;
     }
 
-    FT_TRACE3(( "tt_sbit_decoder_load_compound: loading %d component%s\n",
+    FT_TRACE3(( "tt_sbit_decoder_load_compound: loading %u component%s\n",
                 num_components,
                 num_components == 1 ? "" : "s" ));
 
@@ -1419,7 +1419,7 @@
     image_start = image_offset + image_start;
 
     FT_TRACE3(( "tt_sbit_decoder_load_image:"
-                " found sbit (format %d) for glyph index %d\n",
+                " found sbit (format %u) for glyph index %u\n",
                 image_format, glyph_index ));
 
     return tt_sbit_decoder_load_bitmap( decoder,
@@ -1438,13 +1438,13 @@
     if ( recurse_count )
     {
       FT_TRACE4(( "tt_sbit_decoder_load_image:"
-                  " missing subglyph sbit with glyph index %d\n",
+                  " missing subglyph sbit with glyph index %u\n",
                   glyph_index ));
       return FT_THROW( Invalid_Composite );
     }
 
     FT_TRACE4(( "tt_sbit_decoder_load_image:"
-                " no sbit found for glyph index %d\n", glyph_index ));
+                " no sbit found for glyph index %u\n", glyph_index ));
     return FT_THROW( Missing_Bitmap );
   }
 
@@ -1462,12 +1462,13 @@
     FT_Int    originOffsetX, originOffsetY;
     FT_Tag    graphicType;
     FT_Int    recurse_depth = 0;
+    FT_Bool   flipped       = FALSE;
 
     FT_Error  error;
     FT_Byte*  p;
 
-    FT_UNUSED( map );
 #ifndef FT_CONFIG_OPTION_USE_PNG
+    FT_UNUSED( map );
     FT_UNUSED( metrics_only );
 #endif
 
@@ -1517,12 +1518,16 @@
 
     switch ( graphicType )
     {
+    case FT_MAKE_TAG( 'f', 'l', 'i', 'p' ):
+      flipped = !flipped;
+      FALL_THROUGH;
+
     case FT_MAKE_TAG( 'd', 'u', 'p', 'e' ):
-      if ( recurse_depth < 4 )
+      if ( recurse_depth++ < 4 )
       {
         glyph_index = FT_GET_USHORT();
         FT_FRAME_EXIT();
-        recurse_depth++;
+
         goto retry;
       }
       error = FT_THROW( Invalid_File_Format );
@@ -1540,6 +1545,38 @@
                              glyph_end - glyph_start - 8,
                              TRUE,
                              metrics_only );
+      if ( flipped && !metrics_only && !error )
+      {
+        FT_UInt32*  curr_pos = (FT_UInt32*)map->buffer;
+
+        /* `Load_SBit_Png` always returns a pixmap with 32 bits per pixel */
+        /* and no extra pitch bytes.                                      */
+        FT_UInt  width = map->width;
+        FT_UInt  y;
+
+
+        for ( y = 0; y < map->rows; y++ )
+        {
+          FT_UInt32*  left  = curr_pos;
+          FT_UInt32*  right = curr_pos + width - 1;
+
+
+          while ( left < right )
+          {
+            FT_UInt32  value;
+
+
+            value  = *right;
+            *right = *left;
+            *left  = value;
+
+            left++;
+            right--;
+          }
+
+          curr_pos += width;
+        }
+      }
 #else
       error = FT_THROW( Unimplemented_Feature );
 #endif
diff --git a/src/java.desktop/share/native/libfreetype/src/sfnt/ttsbit.h b/src/java.desktop/share/native/libfreetype/src/sfnt/ttsbit.h
index 96f80a58424..7427149d68f 100644
--- a/src/java.desktop/share/native/libfreetype/src/sfnt/ttsbit.h
+++ b/src/java.desktop/share/native/libfreetype/src/sfnt/ttsbit.h
@@ -4,7 +4,7 @@
  *
  *   TrueType and OpenType embedded bitmap support (specification).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/sfnt/woff2tags.c b/src/java.desktop/share/native/libfreetype/src/sfnt/woff2tags.c
index 532ccfa1737..0f9e3889aab 100644
--- a/src/java.desktop/share/native/libfreetype/src/sfnt/woff2tags.c
+++ b/src/java.desktop/share/native/libfreetype/src/sfnt/woff2tags.c
@@ -4,7 +4,7 @@
  *
  *   WOFF2 Font table tags (base).
  *
- * Copyright (C) 2019-2024 by
+ * Copyright (C) 2019-2025 by
  * Nikhil Ramakrishnan, David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/sfnt/woff2tags.h b/src/java.desktop/share/native/libfreetype/src/sfnt/woff2tags.h
index d03b4b41bc9..e223022962e 100644
--- a/src/java.desktop/share/native/libfreetype/src/sfnt/woff2tags.h
+++ b/src/java.desktop/share/native/libfreetype/src/sfnt/woff2tags.h
@@ -4,7 +4,7 @@
  *
  *   WOFF2 Font table tags (specification).
  *
- * Copyright (C) 2019-2024 by
+ * Copyright (C) 2019-2025 by
  * Nikhil Ramakrishnan, David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/smooth/ftgrays.c b/src/java.desktop/share/native/libfreetype/src/smooth/ftgrays.c
index b7c0632a6fa..365fbad42ad 100644
--- a/src/java.desktop/share/native/libfreetype/src/smooth/ftgrays.c
+++ b/src/java.desktop/share/native/libfreetype/src/smooth/ftgrays.c
@@ -4,7 +4,7 @@
  *
  *   A new `perfect' anti-aliasing renderer (body).
  *
- * Copyright (C) 2000-2024 by
+ * Copyright (C) 2000-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
@@ -157,10 +157,6 @@
 
 #define ft_memset   memset
 
-#define ft_setjmp   setjmp
-#define ft_longjmp  longjmp
-#define ft_jmp_buf  jmp_buf
-
 typedef ptrdiff_t  FT_PtrDist;
 
 
@@ -170,8 +166,8 @@ typedef ptrdiff_t  FT_PtrDist;
 #define Smooth_Err_Invalid_Argument     -3
 #define Smooth_Err_Raster_Overflow      -4
 
-#define FT_BEGIN_HEADER
-#define FT_END_HEADER
+#define FT_BEGIN_HEADER  /* nothing */
+#define FT_END_HEADER    /* nothing */
 
 #include "ftimage.h"
 #include "ftgrays.h"
@@ -495,6 +491,7 @@ typedef ptrdiff_t  FT_PtrDist;
     TCoord  min_ey, max_ey;
     TCoord  count_ey;        /* same as (max_ey - min_ey) */
 
+    int         error;       /* pool overflow exception                  */
     PCell       cell;        /* current cell                             */
     PCell       cell_free;   /* call allocation next free slot           */
     PCell       cell_null;   /* last cell, used as dumpster and limit    */
@@ -510,8 +507,6 @@ typedef ptrdiff_t  FT_PtrDist;
     FT_Raster_Span_Func  render_span;
     void*                render_span_data;
 
-    ft_jmp_buf  jump_buffer;
-
   } gray_TWorker, *gray_PWorker;
 
 #if defined( _MSC_VER )
@@ -613,9 +608,14 @@ typedef ptrdiff_t  FT_PtrDist;
       }
 
       /* insert new cell */
-      cell = ras.cell_free++;
-      if ( cell >= ras.cell_null )
-        ft_longjmp( ras.jump_buffer, 1 );
+      cell = ras.cell_free;
+      if ( cell == ras.cell_null )
+      {
+        ras.error = FT_THROW( Raster_Overflow );
+        goto Found;
+      }
+
+      ras.cell_free = cell + 1;
 
       cell->x     = ex;
       cell->area  = 0;
@@ -1353,7 +1353,8 @@ typedef ptrdiff_t  FT_PtrDist;
 
     ras.x = x;
     ras.y = y;
-    return 0;
+
+    return ras.error;
   }
 
 
@@ -1365,7 +1366,8 @@ typedef ptrdiff_t  FT_PtrDist;
 
 
     gray_render_line( RAS_VAR_ UPSCALE( to->x ), UPSCALE( to->y ) );
-    return 0;
+
+    return ras.error;
   }
 
 
@@ -1378,7 +1380,8 @@ typedef ptrdiff_t  FT_PtrDist;
 
 
     gray_render_conic( RAS_VAR_ control, to );
-    return 0;
+
+    return ras.error;
   }
 
 
@@ -1392,7 +1395,8 @@ typedef ptrdiff_t  FT_PtrDist;
 
 
     gray_render_cubic( RAS_VAR_ control1, control2, to );
-    return 0;
+
+    return ras.error;
   }
 
 
@@ -1700,30 +1704,22 @@ typedef ptrdiff_t  FT_PtrDist;
   gray_convert_glyph_inner( RAS_ARG_
                             int  continued )
   {
-    volatile int  error;
+    int  error;
 
 
-    if ( ft_setjmp( ras.jump_buffer ) == 0 )
-    {
-      if ( continued )
-        FT_Trace_Disable();
-      error = FT_Outline_Decompose( &ras.outline, &func_interface, &ras );
-      if ( continued )
-        FT_Trace_Enable();
+    if ( continued )
+      FT_Trace_Disable();
+    error = FT_Outline_Decompose( &ras.outline, &func_interface, &ras );
+    if ( continued )
+      FT_Trace_Enable();
 
-      FT_TRACE7(( "band [%d..%d]: %td cell%s remaining\n",
-                  ras.min_ey,
-                  ras.max_ey,
-                  ras.cell_null - ras.cell_free,
-                  ras.cell_null - ras.cell_free == 1 ? "" : "s" ));
-    }
-    else
-    {
-      error = FT_THROW( Raster_Overflow );
-
-      FT_TRACE7(( "band [%d..%d]: to be bisected\n",
-                  ras.min_ey, ras.max_ey ));
-    }
+    FT_TRACE7(( error == Smooth_Err_Raster_Overflow
+                  ? "band [%d..%d]: to be bisected\n"
+                  : "band [%d..%d]: %td cell%s remaining\n",
+                ras.min_ey,
+                ras.max_ey,
+                ras.cell_null - ras.cell_free,
+                ras.cell_null - ras.cell_free == 1 ? "" : "s" ));
 
     return error;
   }
@@ -1873,6 +1869,7 @@ typedef ptrdiff_t  FT_PtrDist;
     TCoord*  band;
 
     int  continued = 0;
+    int  error     = Smooth_Err_Ok;
 
 
     /* Initialize the null cell at the end of the poll. */
@@ -1907,7 +1904,6 @@ typedef ptrdiff_t  FT_PtrDist;
       do
       {
         TCoord  i;
-        int     error;
 
 
         ras.min_ex = band[1];
@@ -1922,6 +1918,7 @@ typedef ptrdiff_t  FT_PtrDist;
 
         ras.cell_free = buffer + n;
         ras.cell      = ras.cell_null;
+        ras.error     = Smooth_Err_Ok;
 
         error     = gray_convert_glyph_inner( RAS_VAR_ continued );
         continued = 1;
@@ -1936,7 +1933,7 @@ typedef ptrdiff_t  FT_PtrDist;
           continue;
         }
         else if ( error != Smooth_Err_Raster_Overflow )
-          return error;
+          goto Exit;
 
         /* render pool overflow; we will reduce the render band by half */
         i = ( band[0] - band[1] ) >> 1;
@@ -1945,7 +1942,8 @@ typedef ptrdiff_t  FT_PtrDist;
         if ( i == 0 )
         {
           FT_TRACE7(( "gray_convert_glyph: rotten glyph\n" ));
-          return FT_THROW( Raster_Overflow );
+          error = FT_THROW( Raster_Overflow );
+          goto Exit;
         }
 
         band++;
@@ -1954,7 +1952,11 @@ typedef ptrdiff_t  FT_PtrDist;
       } while ( band >= bands );
     }
 
-    return Smooth_Err_Ok;
+  Exit:
+    ras.cell   = ras.cell_free = ras.cell_null = NULL;
+    ras.ycells = NULL;
+
+    return error;
   }
 
 
diff --git a/src/java.desktop/share/native/libfreetype/src/smooth/ftgrays.h b/src/java.desktop/share/native/libfreetype/src/smooth/ftgrays.h
index 940fbe8c79b..e463e5b3eb8 100644
--- a/src/java.desktop/share/native/libfreetype/src/smooth/ftgrays.h
+++ b/src/java.desktop/share/native/libfreetype/src/smooth/ftgrays.h
@@ -4,7 +4,7 @@
  *
  *   FreeType smooth renderer declaration
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
@@ -19,11 +19,6 @@
 #ifndef FTGRAYS_H_
 #define FTGRAYS_H_
 
-#ifdef __cplusplus
-  extern "C" {
-#endif
-
-
 #ifdef STANDALONE_
 #include "ftimage.h"
 #else
@@ -31,6 +26,7 @@
 #include <freetype/ftimage.h>
 #endif
 
+FT_BEGIN_HEADER
 
   /**************************************************************************
    *
@@ -46,10 +42,7 @@
 
   FT_EXPORT_VAR( const FT_Raster_Funcs )  ft_grays_raster;
 
-
-#ifdef __cplusplus
-  }
-#endif
+FT_END_HEADER
 
 #endif /* FTGRAYS_H_ */
 
diff --git a/src/java.desktop/share/native/libfreetype/src/smooth/ftsmerrs.h b/src/java.desktop/share/native/libfreetype/src/smooth/ftsmerrs.h
index 6d41fb8e0fd..8d5068549fa 100644
--- a/src/java.desktop/share/native/libfreetype/src/smooth/ftsmerrs.h
+++ b/src/java.desktop/share/native/libfreetype/src/smooth/ftsmerrs.h
@@ -4,7 +4,7 @@
  *
  *   smooth renderer error codes (specification only).
  *
- * Copyright (C) 2001-2024 by
+ * Copyright (C) 2001-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/smooth/ftsmooth.c b/src/java.desktop/share/native/libfreetype/src/smooth/ftsmooth.c
index f0acc1ea4a6..21a6eca00ba 100644
--- a/src/java.desktop/share/native/libfreetype/src/smooth/ftsmooth.c
+++ b/src/java.desktop/share/native/libfreetype/src/smooth/ftsmooth.c
@@ -4,7 +4,7 @@
  *
  *   Anti-aliasing renderer interface (body).
  *
- * Copyright (C) 2000-2024 by
+ * Copyright (C) 2000-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/smooth/ftsmooth.h b/src/java.desktop/share/native/libfreetype/src/smooth/ftsmooth.h
index d7b61a9e60e..f76708ae701 100644
--- a/src/java.desktop/share/native/libfreetype/src/smooth/ftsmooth.h
+++ b/src/java.desktop/share/native/libfreetype/src/smooth/ftsmooth.h
@@ -4,7 +4,7 @@
  *
  *   Anti-aliasing renderer interface (specification).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/truetype/ttdriver.c b/src/java.desktop/share/native/libfreetype/src/truetype/ttdriver.c
index 4ab68eb9a12..6369d83d6d5 100644
--- a/src/java.desktop/share/native/libfreetype/src/truetype/ttdriver.c
+++ b/src/java.desktop/share/native/libfreetype/src/truetype/ttdriver.c
@@ -4,7 +4,7 @@
  *
  *   TrueType font driver implementation (body).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
@@ -220,12 +220,12 @@
     {
       /* Use 'kern' table if available since that can be faster; otherwise */
       /* use GPOS kerning pairs if available.                              */
-      if ( ttface->kern_avail_bits != 0 )
+      if ( ttface->kern_avail_bits )
         kerning->x = sfnt->get_kerning( ttface,
                                         left_glyph,
                                         right_glyph );
 #ifdef TT_CONFIG_OPTION_GPOS_KERNING
-      else if ( ttface->gpos_kerning_available )
+      else if ( ttface->num_gpos_lookups_kerning )
         kerning->x = sfnt->get_gpos_kerning( ttface,
                                              left_glyph,
                                              right_glyph );
diff --git a/src/java.desktop/share/native/libfreetype/src/truetype/ttdriver.h b/src/java.desktop/share/native/libfreetype/src/truetype/ttdriver.h
index 3e1cf234fcf..943eaae3482 100644
--- a/src/java.desktop/share/native/libfreetype/src/truetype/ttdriver.h
+++ b/src/java.desktop/share/native/libfreetype/src/truetype/ttdriver.h
@@ -4,7 +4,7 @@
  *
  *   High-level TrueType driver interface (specification).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/truetype/tterrors.h b/src/java.desktop/share/native/libfreetype/src/truetype/tterrors.h
index 7ad937bd04d..631dbf5a80f 100644
--- a/src/java.desktop/share/native/libfreetype/src/truetype/tterrors.h
+++ b/src/java.desktop/share/native/libfreetype/src/truetype/tterrors.h
@@ -4,7 +4,7 @@
  *
  *   TrueType error codes (specification only).
  *
- * Copyright (C) 2001-2024 by
+ * Copyright (C) 2001-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/truetype/ttgload.c b/src/java.desktop/share/native/libfreetype/src/truetype/ttgload.c
index b656ccf04e3..e810ebfd550 100644
--- a/src/java.desktop/share/native/libfreetype/src/truetype/ttgload.c
+++ b/src/java.desktop/share/native/libfreetype/src/truetype/ttgload.c
@@ -4,7 +4,7 @@
  *
  *   TrueType Glyph Loader (body).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
@@ -660,7 +660,7 @@
     } while ( subglyph->flags & MORE_COMPONENTS );
 
     gloader->current.num_subglyphs = num_subglyphs;
-    FT_TRACE5(( "  %d component%s\n",
+    FT_TRACE5(( "  %u component%s\n",
                 num_subglyphs,
                 num_subglyphs > 1 ? "s" : "" ));
 
@@ -674,7 +674,7 @@
       for ( i = 0; i < num_subglyphs; i++ )
       {
         if ( num_subglyphs > 1 )
-          FT_TRACE7(( "    subglyph %d:\n", i ));
+          FT_TRACE7(( "    subglyph %u:\n", i ));
 
         FT_TRACE7(( "      glyph index: %d\n", subglyph->index ));
 
@@ -777,15 +777,11 @@
   TT_Hint_Glyph( TT_Loader  loader,
                  FT_Bool    is_composite )
   {
-#ifdef TT_SUPPORT_SUBPIXEL_HINTING_MINIMAL
-    TT_Face    face   = loader->face;
-    TT_Driver  driver = (TT_Driver)FT_FACE_DRIVER( face );
-#endif
-
     TT_GlyphZone  zone = &loader->zone;
 
 #ifdef TT_USE_BYTECODE_INTERPRETER
     TT_ExecContext  exec  = loader->exec;
+    TT_Size         size  = loader->size;
     FT_Long         n_ins = exec->glyphSize;
 #else
     FT_UNUSED( is_composite );
@@ -797,9 +793,6 @@
     if ( n_ins > 0 )
       FT_ARRAY_COPY( zone->org, zone->cur, zone->n_points );
 
-    /* Reset graphics state. */
-    exec->GS = loader->size->GS;
-
     /* XXX: UNDOCUMENTED! Hinting instructions of a composite glyph */
     /*      completely refer to the (already) hinted subglyphs.     */
     if ( is_composite )
@@ -811,8 +804,8 @@
     }
     else
     {
-      exec->metrics.x_scale = loader->size->metrics->x_scale;
-      exec->metrics.y_scale = loader->size->metrics->y_scale;
+      exec->metrics.x_scale = size->metrics->x_scale;
+      exec->metrics.y_scale = size->metrics->y_scale;
     }
 #endif
 
@@ -838,7 +831,7 @@
       exec->is_composite = is_composite;
       exec->pts          = *zone;
 
-      error = TT_Run_Context( exec );
+      error = TT_Run_Context( exec, size );
       if ( error && exec->pedantic_hinting )
         return error;
 
@@ -854,8 +847,7 @@
     /* to change bearings or advance widths.                               */
 
 #ifdef TT_SUPPORT_SUBPIXEL_HINTING_MINIMAL
-    if ( driver->interpreter_version == TT_INTERPRETER_VERSION_40 &&
-         exec->backward_compatibility )
+    if ( exec->backward_compatibility )
       return FT_Err_Ok;
 #endif
 
@@ -1152,30 +1144,15 @@
         x = FT_MulFix( x, x_scale );
         y = FT_MulFix( y, y_scale );
 
-        if ( subglyph->flags & ROUND_XY_TO_GRID )
+        if ( subglyph->flags & ROUND_XY_TO_GRID &&
+             IS_HINTED( loader->load_flags )    )
         {
-          TT_Face    face   = loader->face;
-          TT_Driver  driver = (TT_Driver)FT_FACE_DRIVER( face );
+#ifdef TT_SUPPORT_SUBPIXEL_HINTING_MINIMAL
+          if ( !loader->exec->backward_compatibility )
+#endif
+            x = FT_PIX_ROUND( x );
 
-
-          if ( IS_HINTED( loader->load_flags ) )
-          {
-            /*
-             * We round the horizontal offset only if there is hinting along
-             * the x axis; this corresponds to integer advance width values.
-             *
-             * Theoretically, a glyph's bytecode can toggle ClearType's
-             * `backward compatibility' mode, which would allow modification
-             * of the advance width.  In reality, however, applications
-             * neither allow nor expect modified advance widths if subpixel
-             * rendering is active.
-             *
-             */
-            if ( driver->interpreter_version == TT_INTERPRETER_VERSION_35 )
-              x = FT_PIX_ROUND( x );
-
-            y = FT_PIX_ROUND( y );
-          }
+          y = FT_PIX_ROUND( y );
         }
       }
     }
@@ -1204,8 +1181,6 @@
   {
     FT_Error     error;
     FT_Outline*  outline = &loader->gloader->base.outline;
-    FT_Stream    stream = loader->stream;
-    FT_UShort    n_ins;
     FT_UInt      i;
 
 
@@ -1224,8 +1199,10 @@
 #ifdef TT_USE_BYTECODE_INTERPRETER
 
     {
-      TT_ExecContext  exec = loader->exec;
+      TT_ExecContext  exec   = loader->exec;
       FT_Memory       memory = exec->memory;
+      FT_Stream       stream = loader->stream;
+      FT_UShort       n_ins;
 
 
       if ( exec->glyphSize )
@@ -1378,8 +1355,9 @@
 
       if ( driver->interpreter_version == TT_INTERPRETER_VERSION_40 &&
            loader->exec                                             &&
-           loader->exec->subpixel_hinting_lean                      &&
-           loader->exec->grayscale_cleartype                        )
+           loader->exec->mode != FT_RENDER_MODE_MONO                &&
+           loader->exec->mode != FT_RENDER_MODE_LCD                 &&
+           loader->exec->mode != FT_RENDER_MODE_LCD_V               )
       {
         loader->pp3.x = loader->advance / 2;
         loader->pp4.x = loader->advance / 2;
@@ -1444,13 +1422,13 @@
 
 #ifdef FT_DEBUG_LEVEL_TRACE
     if ( recurse_count )
-      FT_TRACE5(( "  nesting level: %d\n", recurse_count ));
+      FT_TRACE5(( "  nesting level: %u\n", recurse_count ));
 #endif
 
     /* some fonts have an incorrect value of `maxComponentDepth' */
     if ( recurse_count > face->max_profile.maxComponentDepth )
     {
-      FT_TRACE1(( "load_truetype_glyph: maxComponentDepth set to %d\n",
+      FT_TRACE1(( "load_truetype_glyph: maxComponentDepth set to %u\n",
                   recurse_count ));
       face->max_profile.maxComponentDepth = (FT_UShort)recurse_count;
     }
@@ -1566,18 +1544,18 @@
     if ( header_only )
       goto Exit;
 
+#ifdef FT_CONFIG_OPTION_INCREMENTAL
+    tt_get_metrics_incremental( loader, glyph_index );
+#endif
+    tt_loader_set_pp( loader );
+
+    /* shortcut for empty glyphs */
     if ( loader->byte_len == 0 || loader->n_contours == 0 )
     {
-#ifdef FT_CONFIG_OPTION_INCREMENTAL
-      tt_get_metrics_incremental( loader, glyph_index );
-#endif
-      tt_loader_set_pp( loader );
-
 
 #ifdef TT_CONFIG_OPTION_GX_VAR_SUPPORT
 
-      if ( FT_IS_NAMED_INSTANCE( FT_FACE( face ) ) ||
-           FT_IS_VARIATION( FT_FACE( face ) )      )
+      if ( !IS_DEFAULT_INSTANCE( FT_FACE( face ) ) )
       {
         /* a small outline structure with four elements for */
         /* communication with `TT_Vary_Apply_Glyph_Deltas'  */
@@ -1627,11 +1605,6 @@
       goto Exit;
     }
 
-#ifdef FT_CONFIG_OPTION_INCREMENTAL
-    tt_get_metrics_incremental( loader, glyph_index );
-#endif
-    tt_loader_set_pp( loader );
-
 
     /***********************************************************************/
     /***********************************************************************/
@@ -1735,8 +1708,7 @@
 
 #ifdef TT_CONFIG_OPTION_GX_VAR_SUPPORT
 
-      if ( FT_IS_NAMED_INSTANCE( FT_FACE( face ) ) ||
-           FT_IS_VARIATION( FT_FACE( face ) )      )
+      if ( !IS_DEFAULT_INSTANCE( FT_FACE( face ) ) )
       {
         FT_UShort    i, limit;
         FT_SubGlyph  subglyph;
@@ -1953,6 +1925,9 @@
 
 #ifdef FT_CONFIG_OPTION_INCREMENTAL
 
+    /* restore the original stream */
+    loader->stream = face->root.stream;
+
     if ( glyph_data_loaded )
       face->root.internal->incremental_interface->funcs->free_glyph_data(
         face->root.internal->incremental_interface->object,
@@ -2112,7 +2087,6 @@
   {
     TT_Face             face   = (TT_Face)glyph->face;
     SFNT_Service        sfnt   = (SFNT_Service)face->sfnt;
-    FT_Stream           stream = face->root.stream;
     FT_Error            error;
     TT_SBit_MetricsRec  sbit_metrics;
 
@@ -2121,14 +2095,11 @@
                                    size->strike_index,
                                    glyph_index,
                                    (FT_UInt)load_flags,
-                                   stream,
+                                   face->root.stream,
                                    &glyph->bitmap,
                                    &sbit_metrics );
     if ( !error )
     {
-      glyph->outline.n_points   = 0;
-      glyph->outline.n_contours = 0;
-
       glyph->metrics.width  = (FT_Pos)sbit_metrics.width  * 64;
       glyph->metrics.height = (FT_Pos)sbit_metrics.height * 64;
 
@@ -2153,6 +2124,50 @@
         glyph->bitmap_top  = sbit_metrics.horiBearingY;
       }
     }
+    /* a missing glyph in a bitmap-only font is assumed whitespace */
+    /* that needs to be constructed using metrics data from `hmtx' */
+    /* and, optionally, `vmtx' tables                              */
+    else if ( FT_ERR_EQ( error, Missing_Bitmap ) &&
+              !FT_IS_SCALABLE( glyph->face )     &&
+              face->horz_metrics_size            )
+    {
+      FT_Fixed  x_scale = size->root.metrics.x_scale;
+      FT_Fixed  y_scale = size->root.metrics.y_scale;
+
+      FT_Short  left_bearing = 0;
+      FT_Short  top_bearing  = 0;
+
+      FT_UShort  advance_width  = 0;
+      FT_UShort  advance_height = 0;
+
+
+      TT_Get_HMetrics( face, glyph_index,
+                       &left_bearing,
+                       &advance_width );
+      TT_Get_VMetrics( face, glyph_index,
+                       0,
+                       &top_bearing,
+                       &advance_height );
+
+      glyph->metrics.width  = 0;
+      glyph->metrics.height = 0;
+
+      glyph->metrics.horiBearingX = FT_MulFix( left_bearing, x_scale );
+      glyph->metrics.horiBearingY = 0;
+      glyph->metrics.horiAdvance  = FT_MulFix( advance_width, x_scale );
+
+      glyph->metrics.vertBearingX = 0;
+      glyph->metrics.vertBearingY = FT_MulFix( top_bearing, y_scale );
+      glyph->metrics.vertAdvance  = FT_MulFix( advance_height, y_scale );
+
+      glyph->format            = FT_GLYPH_FORMAT_BITMAP;
+      glyph->bitmap.pixel_mode = FT_PIXEL_MODE_MONO;
+
+      glyph->bitmap_left = 0;
+      glyph->bitmap_top  = 0;
+
+      error = FT_Err_Ok;
+    }
 
     return error;
   }
@@ -2168,15 +2183,6 @@
                   FT_Bool       glyf_table_only )
   {
     TT_Face    face   = (TT_Face)glyph->face;
-    FT_Stream  stream = face->root.stream;
-
-#ifdef TT_USE_BYTECODE_INTERPRETER
-    FT_Error   error;
-    FT_Bool    pedantic = FT_BOOL( load_flags & FT_LOAD_PEDANTIC );
-#ifdef TT_SUPPORT_SUBPIXEL_HINTING_MINIMAL
-    TT_Driver  driver   = (TT_Driver)FT_FACE_DRIVER( glyph->face );
-#endif
-#endif
 
 
     FT_ZERO( loader );
@@ -2186,122 +2192,78 @@
     /* load execution context */
     if ( IS_HINTED( load_flags ) && !glyf_table_only )
     {
+      FT_Error        error;
       TT_ExecContext  exec;
-      FT_Bool         grayscale = TRUE;
+      FT_Render_Mode  mode      = FT_LOAD_TARGET_MODE( load_flags );
+      FT_Bool         grayscale = FT_BOOL( mode != FT_RENDER_MODE_MONO );
+      FT_Bool         reexecute = FALSE;
 #ifdef TT_SUPPORT_SUBPIXEL_HINTING_MINIMAL
-      FT_Bool         subpixel_hinting_lean;
-      FT_Bool         grayscale_cleartype;
+      TT_Driver       driver    = (TT_Driver)FT_FACE_DRIVER( glyph->face );
 #endif
 
-      FT_Bool  reexecute = FALSE;
 
-
-      if ( size->bytecode_ready < 0 || size->cvt_ready < 0 )
+      if ( size->bytecode_ready > 0 )
+        return size->bytecode_ready;
+      if ( size->bytecode_ready < 0 )
       {
-        error = tt_size_ready_bytecode( size, pedantic );
+        FT_Bool  pedantic = FT_BOOL( load_flags & FT_LOAD_PEDANTIC );
+
+
+        error = tt_size_init_bytecode( size, pedantic );
         if ( error )
           return error;
       }
-      else if ( size->bytecode_ready )
-        return size->bytecode_ready;
-      else if ( size->cvt_ready )
-        return size->cvt_ready;
 
-      /* query new execution context */
       exec = size->context;
-      if ( !exec )
-        return FT_THROW( Could_Not_Find_Context );
-
-      grayscale = FT_BOOL( FT_LOAD_TARGET_MODE( load_flags ) !=
-                             FT_RENDER_MODE_MONO             );
 
 #ifdef TT_SUPPORT_SUBPIXEL_HINTING_MINIMAL
       if ( driver->interpreter_version == TT_INTERPRETER_VERSION_40 )
       {
-        subpixel_hinting_lean =
-          FT_BOOL( FT_LOAD_TARGET_MODE( load_flags ) !=
-                   FT_RENDER_MODE_MONO               );
-        grayscale_cleartype =
-          FT_BOOL( subpixel_hinting_lean         &&
-                   !( ( load_flags         &
-                        FT_LOAD_TARGET_LCD )   ||
-                      ( load_flags           &
-                        FT_LOAD_TARGET_LCD_V ) ) );
-        exec->vertical_lcd_lean =
-          FT_BOOL( subpixel_hinting_lean    &&
-                   ( load_flags           &
-                     FT_LOAD_TARGET_LCD_V ) );
-        grayscale = FT_BOOL( grayscale && !subpixel_hinting_lean );
-      }
-      else
-      {
-        subpixel_hinting_lean   = FALSE;
-        grayscale_cleartype     = FALSE;
-        exec->vertical_lcd_lean = FALSE;
+        grayscale = FALSE;
+
+        /* any mode change requires a re-execution of the CVT program */
+        if ( mode != exec->mode )
+        {
+          FT_TRACE4(( "tt_loader_init: render mode change,"
+                      " re-executing `prep' table\n" ));
+
+          exec->mode = mode;
+          reexecute  = TRUE;
+        }
       }
 #endif
 
+      /* a change from mono to grayscale rendering (and vice versa) */
+      /* requires a re-execution of the CVT program                 */
+      if ( grayscale != exec->grayscale )
+      {
+        FT_TRACE4(( "tt_loader_init: grayscale hinting change,"
+                    " re-executing `prep' table\n" ));
+
+        exec->grayscale = grayscale;
+        reexecute       = TRUE;
+      }
+
+      if ( size->cvt_ready > 0 )
+        return size->cvt_ready;
+      if ( size->cvt_ready < 0 || reexecute )
+      {
+        error = tt_size_run_prep( size );
+        if ( error )
+          return error;
+      }
+
       error = TT_Load_Context( exec, face, size );
       if ( error )
         return error;
 
-      {
-#ifdef TT_SUPPORT_SUBPIXEL_HINTING_MINIMAL
-        if ( driver->interpreter_version == TT_INTERPRETER_VERSION_40 )
-        {
-          /* a change from mono to subpixel rendering (and vice versa) */
-          /* requires a re-execution of the CVT program                */
-          if ( subpixel_hinting_lean != exec->subpixel_hinting_lean )
-          {
-            FT_TRACE4(( "tt_loader_init: subpixel hinting change,"
-                        " re-executing `prep' table\n" ));
-
-            exec->subpixel_hinting_lean = subpixel_hinting_lean;
-            reexecute                   = TRUE;
-          }
-
-          /* a change from colored to grayscale subpixel rendering (and */
-          /* vice versa) requires a re-execution of the CVT program     */
-          if ( grayscale_cleartype != exec->grayscale_cleartype )
-          {
-            FT_TRACE4(( "tt_loader_init: grayscale subpixel hinting change,"
-                        " re-executing `prep' table\n" ));
-
-            exec->grayscale_cleartype = grayscale_cleartype;
-            reexecute                 = TRUE;
-          }
-        }
-#endif
-
-        /* a change from mono to grayscale rendering (and vice versa) */
-        /* requires a re-execution of the CVT program                 */
-        if ( grayscale != exec->grayscale )
-        {
-          FT_TRACE4(( "tt_loader_init: grayscale hinting change,"
-                      " re-executing `prep' table\n" ));
-
-          exec->grayscale = grayscale;
-          reexecute       = TRUE;
-        }
-      }
-
-      if ( reexecute )
-      {
-        error = tt_size_run_prep( size, pedantic );
-        if ( error )
-          return error;
-        error = TT_Load_Context( exec, face, size );
-        if ( error )
-          return error;
-      }
-
       /* check whether the cvt program has disabled hinting */
-      if ( exec->GS.instruct_control & 1 )
+      if ( size->GS.instruct_control & 1 )
         load_flags |= FT_LOAD_NO_HINTING;
 
-      /* load default graphics state -- if needed */
-      if ( exec->GS.instruct_control & 2 )
-        exec->GS = tt_default_graphics_state;
+      /* check whether GS modifications should be reverted */
+      if ( size->GS.instruct_control & 2 )
+        size->GS = tt_default_graphics_state;
 
 #ifdef TT_SUPPORT_SUBPIXEL_HINTING_MINIMAL
       /*
@@ -2318,28 +2280,25 @@
        *
        */
       if ( driver->interpreter_version == TT_INTERPRETER_VERSION_40 &&
-           subpixel_hinting_lean                                    &&
+           mode != FT_RENDER_MODE_MONO                              &&
            !FT_IS_TRICKY( glyph->face )                             )
-        exec->backward_compatibility = !( exec->GS.instruct_control & 4 );
+        exec->backward_compatibility = ( size->GS.instruct_control & 4 ) ^ 4;
       else
-        exec->backward_compatibility = FALSE;
+        exec->backward_compatibility = 0;
 #endif /* TT_SUPPORT_SUBPIXEL_HINTING_MINIMAL */
 
-      exec->pedantic_hinting = FT_BOOL( load_flags & FT_LOAD_PEDANTIC );
       loader->exec = exec;
-      loader->instructions = exec->glyphIns;
 
       /* Use the hdmx table if any unless FT_LOAD_COMPUTE_METRICS */
       /* is set or backward compatibility mode of the v38 or v40  */
       /* interpreters is active.  See `ttinterp.h' for details on */
       /* backward compatibility mode.                             */
-      if ( IS_HINTED( loader->load_flags )                                &&
-           !( loader->load_flags & FT_LOAD_COMPUTE_METRICS )              &&
+      if ( IS_HINTED( load_flags )                   &&
+           !( load_flags & FT_LOAD_COMPUTE_METRICS ) &&
 #ifdef TT_SUPPORT_SUBPIXEL_HINTING_MINIMAL
-           !( driver->interpreter_version == TT_INTERPRETER_VERSION_40  &&
-              exec->backward_compatibility                              ) &&
+           !exec->backward_compatibility             &&
 #endif
-           !face->postscript.isFixedPitch                                 )
+           !face->postscript.isFixedPitch            )
       {
         loader->widthp = size->widthp;
       }
@@ -2364,7 +2323,7 @@
     loader->face   = face;
     loader->size   = size;
     loader->glyph  = (FT_GlyphSlot)glyph;
-    loader->stream = stream;
+    loader->stream = face->root.stream;
 
     loader->composites.head = NULL;
     loader->composites.tail = NULL;
@@ -2426,84 +2385,26 @@
     TT_LoaderRec  loader;
 
 
-    FT_TRACE1(( "TT_Load_Glyph: glyph index %d\n", glyph_index ));
+    FT_TRACE1(( "TT_Load_Glyph: glyph index %u\n", glyph_index ));
 
 #ifdef TT_CONFIG_OPTION_EMBEDDED_BITMAPS
 
     /* try to load embedded bitmap (if any) */
-    if ( size->strike_index != 0xFFFFFFFFUL      &&
-         ( load_flags & FT_LOAD_NO_BITMAP ) == 0 &&
-         IS_DEFAULT_INSTANCE( glyph->face )      )
+    if ( size->strike_index != 0xFFFFFFFFUL  &&
+         !( load_flags & FT_LOAD_NO_BITMAP &&
+            FT_IS_SCALABLE( glyph->face )  ) &&
+         IS_DEFAULT_INSTANCE( glyph->face )  )
     {
-      FT_Fixed  x_scale = size->root.metrics.x_scale;
-      FT_Fixed  y_scale = size->root.metrics.y_scale;
-
-
       error = load_sbit_image( size, glyph, glyph_index, load_flags );
-      if ( FT_ERR_EQ( error, Missing_Bitmap ) )
-      {
-        /* the bitmap strike is incomplete and misses the requested glyph; */
-        /* if we have a bitmap-only font, return an empty glyph            */
-        if ( !FT_IS_SCALABLE( glyph->face ) )
-        {
-          FT_Short  left_bearing = 0;
-          FT_Short  top_bearing  = 0;
-
-          FT_UShort  advance_width  = 0;
-          FT_UShort  advance_height = 0;
-
-
-          /* to return an empty glyph, however, we need metrics data   */
-          /* from the `hmtx' (or `vmtx') table; the assumption is that */
-          /* empty glyphs are missing intentionally, representing      */
-          /* whitespace - not having at least horizontal metrics is    */
-          /* thus considered an error                                  */
-          if ( !face->horz_metrics_size )
-            return error;
-
-          /* we now construct an empty bitmap glyph */
-          TT_Get_HMetrics( face, glyph_index,
-                           &left_bearing,
-                           &advance_width );
-          TT_Get_VMetrics( face, glyph_index,
-                           0,
-                           &top_bearing,
-                           &advance_height );
-
-          glyph->outline.n_points   = 0;
-          glyph->outline.n_contours = 0;
-
-          glyph->metrics.width  = 0;
-          glyph->metrics.height = 0;
-
-          glyph->metrics.horiBearingX = FT_MulFix( left_bearing, x_scale );
-          glyph->metrics.horiBearingY = 0;
-          glyph->metrics.horiAdvance  = FT_MulFix( advance_width, x_scale );
-
-          glyph->metrics.vertBearingX = 0;
-          glyph->metrics.vertBearingY = FT_MulFix( top_bearing, y_scale );
-          glyph->metrics.vertAdvance  = FT_MulFix( advance_height, y_scale );
-
-          glyph->format            = FT_GLYPH_FORMAT_BITMAP;
-          glyph->bitmap.pixel_mode = FT_PIXEL_MODE_MONO;
-
-          glyph->bitmap_left = 0;
-          glyph->bitmap_top  = 0;
-
-          return FT_Err_Ok;
-        }
-      }
-      else if ( error )
-      {
-        /* return error if font is not scalable */
-        if ( !FT_IS_SCALABLE( glyph->face ) )
-          return error;
-      }
-      else
+      if ( !error )
       {
         if ( FT_IS_SCALABLE( glyph->face ) ||
              FT_HAS_SBIX( glyph->face )    )
         {
+          FT_Fixed  x_scale = size->root.metrics.x_scale;
+          FT_Fixed  y_scale = size->root.metrics.y_scale;
+
+
           /* for the bbox we need the header only */
           (void)tt_loader_init( &loader, size, glyph, load_flags, TRUE );
           (void)load_truetype_glyph( &loader, glyph_index, 0, TRUE );
@@ -2550,8 +2451,10 @@
                                                     y_scale );
         }
 
-        return FT_Err_Ok;
+        goto Exit;
       }
+      else if ( !FT_IS_SCALABLE( glyph->face ) )
+        goto Exit;
     }
 
     if ( load_flags & FT_LOAD_SBITS_ONLY )
@@ -2563,7 +2466,7 @@
 #endif /* TT_CONFIG_OPTION_EMBEDDED_BITMAPS */
 
     /* if FT_LOAD_NO_SCALE is not set, `ttmetrics' must be valid */
-    if ( !( load_flags & FT_LOAD_NO_SCALE ) && !size->ttmetrics.valid )
+    if ( !( load_flags & FT_LOAD_NO_SCALE ) && !size->ttmetrics.ppem )
     {
       error = FT_THROW( Invalid_Size_Handle );
       goto Exit;
@@ -2614,7 +2517,7 @@
         glyph->metrics.horiAdvance = FT_MulFix( advanceX, x_scale );
         glyph->metrics.vertAdvance = FT_MulFix( advanceY, y_scale );
 
-        return error;
+        goto Exit;
       }
 
       FT_TRACE3(( "Failed to load SVG glyph\n" ));
@@ -2642,10 +2545,6 @@
       goto Done;
     }
 
-    glyph->format        = FT_GLYPH_FORMAT_OUTLINE;
-    glyph->num_subglyphs = 0;
-    glyph->outline.flags = 0;
-
     /* main loading loop */
     error = load_truetype_glyph( &loader, glyph_index, 0, FALSE );
     if ( !error )
@@ -2657,9 +2556,18 @@
       }
       else
       {
+        glyph->format         = FT_GLYPH_FORMAT_OUTLINE;
+
         glyph->outline        = loader.gloader->base.outline;
         glyph->outline.flags &= ~FT_OUTLINE_SINGLE_PASS;
 
+        /* Set the `high precision' bit flag.  This is _critical_ to   */
+        /* get correct output for monochrome TrueType glyphs at all    */
+        /* sizes using the bytecode interpreter.                       */
+        if ( !( load_flags & FT_LOAD_NO_SCALE ) &&
+             size->metrics->y_ppem < 24         )
+          glyph->outline.flags |= FT_OUTLINE_HIGH_PRECISION;
+
         /* Translate array so that (0,0) is the glyph's origin.  Note  */
         /* that this behaviour is independent on the value of bit 1 of */
         /* the `flags' field in the `head' table -- at least major     */
@@ -2708,14 +2616,6 @@
       error = compute_glyph_metrics( &loader, glyph_index );
     }
 
-    /* Set the `high precision' bit flag.                           */
-    /* This is _critical_ to get correct output for monochrome      */
-    /* TrueType glyphs at all sizes using the bytecode interpreter. */
-    /*                                                              */
-    if ( !( load_flags & FT_LOAD_NO_SCALE ) &&
-         size->metrics->y_ppem < 24         )
-      glyph->outline.flags |= FT_OUTLINE_HIGH_PRECISION;
-
     FT_TRACE1(( "  subglyphs = %u, contours = %hu, points = %hu,"
                 " flags = 0x%.3x\n",
                 loader.gloader->base.num_subglyphs,
@@ -2727,11 +2627,8 @@
     tt_loader_done( &loader );
 
   Exit:
-#ifdef FT_DEBUG_LEVEL_TRACE
-    if ( error )
-      FT_TRACE1(( "  failed (error code 0x%x)\n",
-                  error ));
-#endif
+    FT_TRACE1(( error ? "  failed (error code 0x%x)\n" : "",
+                error ));
 
     return error;
   }
diff --git a/src/java.desktop/share/native/libfreetype/src/truetype/ttgload.h b/src/java.desktop/share/native/libfreetype/src/truetype/ttgload.h
index 22ea967f301..39d6ae3664c 100644
--- a/src/java.desktop/share/native/libfreetype/src/truetype/ttgload.h
+++ b/src/java.desktop/share/native/libfreetype/src/truetype/ttgload.h
@@ -4,7 +4,7 @@
  *
  *   TrueType Glyph Loader (specification).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/truetype/ttgxvar.c b/src/java.desktop/share/native/libfreetype/src/truetype/ttgxvar.c
index 4f0083c96b7..0732fcbae36 100644
--- a/src/java.desktop/share/native/libfreetype/src/truetype/ttgxvar.c
+++ b/src/java.desktop/share/native/libfreetype/src/truetype/ttgxvar.c
@@ -4,7 +4,7 @@
  *
  *   TrueType GX Font Variation loader
  *
- * Copyright (C) 2004-2024 by
+ * Copyright (C) 2004-2025 by
  * David Turner, Robert Wilhelm, Werner Lemberg, and George Williams.
  *
  * This file is part of the FreeType project, and may only be used,
@@ -489,8 +489,9 @@
     FT_UShort  axis_count;
     FT_UInt    region_count;
 
-    FT_UInt  i, j;
-    FT_Bool  long_words;
+    FT_UInt   i, j;
+    FT_Byte*  bytes;
+    FT_Bool   long_words;
 
     GX_Blend   blend           = ttface->blend;
     FT_ULong*  dataOffsetArray = NULL;
@@ -526,11 +527,15 @@
     if ( FT_QNEW_ARRAY( dataOffsetArray, data_count ) )
       goto Exit;
 
+    if ( FT_FRAME_ENTER( data_count * 4 ) )
+      goto Exit;
+
+    bytes = stream->cursor;
+
     for ( i = 0; i < data_count; i++ )
-    {
-      if ( FT_READ_ULONG( dataOffsetArray[i] ) )
-        goto Exit;
-    }
+      dataOffsetArray[i] = FT_NEXT_ULONG( bytes );
+
+    FT_FRAME_EXIT();
 
     /* parse array of region records (region list) */
     if ( FT_STREAM_SEEK( offset + region_offset ) )
@@ -564,13 +569,26 @@
       goto Exit;
     itemStore->regionCount = region_count;
 
-    for ( i = 0; i < itemStore->regionCount; i++ )
+    if ( FT_FRAME_ENTER( (FT_Long)region_count * axis_count * 6 ) )
+    {
+      FT_TRACE2(( "tt_var_load_item_variation_store:"
+                  " not enough data for variation regions\n" ));
+      error = FT_THROW( Invalid_Table );
+      goto Exit;
+    }
+
+    bytes = stream->cursor;
+
+    for ( i = 0; i < region_count; i++ )
     {
       GX_AxisCoords  axisCoords;
 
 
       if ( FT_NEW_ARRAY( itemStore->varRegionList[i].axisList, axis_count ) )
+      {
+        FT_FRAME_EXIT();
         goto Exit;
+      }
 
       axisCoords = itemStore->varRegionList[i].axisList;
 
@@ -579,10 +597,9 @@
         FT_Int  start, peak, end;
 
 
-        if ( FT_READ_SHORT( start ) ||
-             FT_READ_SHORT( peak )  ||
-             FT_READ_SHORT( end )   )
-          goto Exit;
+        start = FT_NEXT_SHORT( bytes );
+        peak  = FT_NEXT_SHORT( bytes );
+        end   = FT_NEXT_SHORT( bytes );
 
         /* immediately tag invalid ranges with special peak = 0 */
         if ( ( start < 0 && end > 0 ) || start > peak || peak > end )
@@ -594,6 +611,8 @@
       }
     }
 
+    FT_FRAME_EXIT();
+
     /* end of region list parse */
 
     /* use dataOffsetArray now to parse varData items */
@@ -625,7 +644,7 @@
       /* check some data consistency */
       if ( word_delta_count > region_idx_count )
       {
-        FT_TRACE2(( "bad short count %d or region count %d\n",
+        FT_TRACE2(( "bad short count %d or region count %u\n",
                     word_delta_count,
                     region_idx_count ));
         error = FT_THROW( Invalid_Table );
@@ -634,7 +653,7 @@
 
       if ( region_idx_count > itemStore->regionCount )
       {
-        FT_TRACE2(( "inconsistent regionCount %d in varData[%d]\n",
+        FT_TRACE2(( "inconsistent regionCount %u in varData[%u]\n",
                     region_idx_count,
                     i ));
         error = FT_THROW( Invalid_Table );
@@ -648,20 +667,32 @@
       varData->wordDeltaCount = word_delta_count;
       varData->longWords      = long_words;
 
+      if ( FT_FRAME_ENTER( region_idx_count * 2 ) )
+      {
+        FT_TRACE2(( "tt_var_load_item_variation_store:"
+                    " not enough data for region indices\n" ));
+        error = FT_THROW( Invalid_Table );
+        goto Exit;
+      }
+
+      bytes = stream->cursor;
+
       for ( j = 0; j < varData->regionIdxCount; j++ )
       {
-        if ( FT_READ_USHORT( varData->regionIndices[j] ) )
-          goto Exit;
+        varData->regionIndices[j] = FT_NEXT_USHORT( bytes );
 
         if ( varData->regionIndices[j] >= itemStore->regionCount )
         {
-          FT_TRACE2(( "bad region index %d\n",
+          FT_TRACE2(( "bad region index %u\n",
                       varData->regionIndices[j] ));
+          FT_FRAME_EXIT();
           error = FT_THROW( Invalid_Table );
           goto Exit;
         }
       }
 
+      FT_FRAME_EXIT();
+
       per_region_size = word_delta_count + region_idx_count;
       if ( long_words )
         per_region_size *= 2;
@@ -706,6 +737,7 @@
     FT_UInt   innerIndexMask;
     FT_ULong  i;
     FT_UInt   j;
+    FT_Byte*  bytes;
 
 
     if ( FT_STREAM_SEEK( offset )    ||
@@ -757,6 +789,16 @@
     if ( FT_NEW_ARRAY( map->outerIndex, map->mapCount ) )
       goto Exit;
 
+    if ( FT_FRAME_ENTER( map->mapCount * entrySize ) )
+    {
+      FT_TRACE2(( "tt_var_load_delta_set_index_mapping:"
+                  " invalid number of delta-set index mappings\n" ));
+      error = FT_THROW( Invalid_Table );
+      goto Exit;
+    }
+
+    bytes = stream->cursor;
+
     for ( i = 0; i < map->mapCount; i++ )
     {
       FT_UInt  mapData = 0;
@@ -769,9 +811,7 @@
         FT_Byte  data;
 
 
-        if ( FT_READ_BYTE( data ) )
-          goto Exit;
-
+        data    = FT_NEXT_BYTE( bytes );
         mapData = ( mapData << 8 ) | data;
       }
 
@@ -789,7 +829,7 @@
 
       if ( outerIndex >= itemStore->dataCount )
       {
-        FT_TRACE2(( "outerIndex[%ld] == %d out of range\n",
+        FT_TRACE2(( "outerIndex[%lu] == %u out of range\n",
                     i,
                     outerIndex ));
         error = FT_THROW( Invalid_Table );
@@ -802,7 +842,7 @@
 
       if ( innerIndex >= itemStore->varData[outerIndex].itemCount )
       {
-        FT_TRACE2(( "innerIndex[%ld] == %d out of range\n",
+        FT_TRACE2(( "innerIndex[%lu] == %u out of range\n",
                     i,
                     innerIndex ));
         error = FT_THROW( Invalid_Table );
@@ -812,6 +852,8 @@
       map->innerIndex[i] = innerIndex;
     }
 
+    FT_FRAME_EXIT();
+
   Exit:
     return error;
   }
@@ -965,28 +1007,181 @@
   }
 
 
+  static FT_Fixed
+  tt_calculate_scalar( GX_AxisCoords  axis,
+                       FT_UInt        axisCount,
+                       FT_Fixed*      normalizedcoords )
+  {
+    FT_Fixed  scalar = 0x10000L;
+    FT_UInt   j;
+
+
+    /* Inner loop steps through axes in this region. */
+    for ( j = 0; j < axisCount; j++, axis++ )
+    {
+      FT_Fixed  ncv = normalizedcoords[j];
+
+
+      /* Compute the scalar contribution of this axis, */
+      /* with peak of 0 used for invalid axes.         */
+      if ( axis->peakCoord == ncv ||
+           axis->peakCoord == 0   )
+        continue;
+
+      /* Ignore this region if coordinates are out of range. */
+      else if ( ncv <= axis->startCoord ||
+                ncv >= axis->endCoord   )
+      {
+        scalar = 0;
+        break;
+      }
+
+      /* Cumulative product of all the axis scalars. */
+      else if ( ncv < axis->peakCoord )
+        scalar = FT_MulDiv( scalar,
+                            ncv - axis->startCoord,
+                            axis->peakCoord - axis->startCoord );
+      else   /* ncv > axis->peakCoord */
+        scalar = FT_MulDiv( scalar,
+                            axis->endCoord - ncv,
+                            axis->endCoord - axis->peakCoord );
+
+    } /* per-axis loop */
+
+    return scalar;
+  }
+
+
+  static FT_Int64
+  ft_mul_add_delta_scalar( FT_Int64  returnValue,
+                           FT_Int32  delta,
+                           FT_Int32  scalar )
+  {
+
+#ifdef FT_INT64
+
+    return returnValue + (FT_Int64)delta * scalar;
+
+#else /* !FT_INT64 */
+
+    if ( (FT_UInt32)( delta + 0x8000 ) <= 0x20000 )
+    {
+      /* Fast path: multiplication result fits into 32 bits. */
+
+      FT_Int32  lo = delta * scalar;
+
+
+      returnValue.lo += (FT_UInt32)lo;
+
+      if ( returnValue.lo < (FT_UInt32)lo )
+        returnValue.hi += ( lo < 0 ) ? 0 : 1;
+
+      if ( lo < 0 )
+        returnValue.hi -= 1;
+
+      return returnValue;
+    }
+    else
+    {
+      /* Slow path: full 32x32 -> 64-bit signed multiplication. */
+
+      FT_Int64 product;
+
+      /* Get absolute values. */
+      FT_UInt32  a = ( delta < 0 ) ? -delta : delta;
+      FT_UInt32  b = ( scalar < 0 ) ? -scalar : scalar;
+
+      /* Prepare unsigned multiplication. */
+      FT_UInt32  a_lo = a & 0xFFFF;
+      FT_UInt32  a_hi = a >> 16;
+
+      FT_UInt32  b_lo = b & 0xFFFF;
+      FT_UInt32  b_hi = b >> 16;
+
+      /* Partial products. */
+      FT_UInt32  p0 = a_lo * b_lo;
+      FT_UInt32  p1 = a_lo * b_hi;
+      FT_UInt32  p2 = a_hi * b_lo;
+      FT_UInt32  p3 = a_hi * b_hi;
+
+      /* Combine: result = p3 << 32 + (p1 + p2) << 16 + p0 */
+      FT_UInt32  mid       = p1 + p2;
+      FT_UInt32  mid_carry = ( mid < p1 );
+
+      FT_UInt32  carry;
+
+
+      product.lo = ( mid << 16 ) + ( p0 & 0xFFFF );
+      carry      = ( product.lo < ( p0 & 0xFFFF ) ) ? 1 : 0;
+      product.hi = p3 + ( mid >> 16 ) + mid_carry + carry;
+
+      /* If result should be negative, negate. */
+      if ( ( delta < 0 ) ^ ( scalar < 0 ) )
+      {
+        product.lo = ~product.lo + 1;
+        product.hi = ~product.hi + ( product.lo == 0 ? 1 : 0 );
+      }
+
+      /* Add to `returnValue`. */
+      returnValue.lo += product.lo;
+      if ( returnValue.lo < product.lo )
+        returnValue.hi++;
+      returnValue.hi += product.hi;
+
+      return returnValue;
+    }
+
+#endif /* !FT_INT64 */
+
+  }
+
+
+  static FT_ItemVarDelta
+  ft_round_and_shift16( FT_Int64  returnValue )
+  {
+
+#ifdef FT_INT64
+
+    return (FT_ItemVarDelta)( returnValue + 0x8000L ) >> 16;
+
+#else /* !FT_INT64 */
+
+    FT_UInt hi = returnValue.hi;
+    FT_UInt lo = returnValue.lo;
+
+    FT_UInt delta;
+
+
+    /* Add 0x8000 to round. */
+    lo += 0x8000;
+    if ( lo < 0x8000 )  /* overflow occurred */
+      hi += 1;
+
+    /* Shift right by 16 bits. */
+    delta = ( hi << 16 ) | ( lo >> 16 );
+
+    return (FT_ItemVarDelta)delta;
+
+#endif /* !FT_INT64 */
+
+  }
+
+
   FT_LOCAL_DEF( FT_ItemVarDelta )
   tt_var_get_item_delta( FT_Face          face,        /* TT_Face */
                          GX_ItemVarStore  itemStore,
                          FT_UInt          outerIndex,
                          FT_UInt          innerIndex )
   {
-    TT_Face    ttface = (TT_Face)face;
-    FT_Stream  stream = FT_FACE_STREAM( face );
-    FT_Memory  memory = stream->memory;
-    FT_Error   error  = FT_Err_Ok;
+    TT_Face  ttface = (TT_Face)face;
 
-    GX_ItemVarData    varData;
-    FT_ItemVarDelta*  deltaSet = NULL;
-    FT_ItemVarDelta   deltaSetStack[16];
+    GX_ItemVarData  varData;
 
-    FT_Fixed*  scalars = NULL;
-    FT_Fixed   scalarsStack[16];
-
-    FT_UInt          master, j;
-    FT_ItemVarDelta  returnValue = 0;
-    FT_UInt          per_region_size;
-    FT_Byte*         bytes;
+    FT_UInt   master;
+    FT_Int64  returnValue = FT_INT64_ZERO;
+    FT_UInt   shift_base  = 1;
+    FT_UInt   per_region_size;
+    FT_Byte*  bytes;
 
 
     if ( !ttface->blend || !ttface->blend->normalizedcoords )
@@ -1011,113 +1206,63 @@
     if ( varData->regionIdxCount == 0 )
       return 0; /* Avoid "applying zero offset to null pointer". */
 
-    if ( varData->regionIdxCount < 16 )
-    {
-      deltaSet = deltaSetStack;
-      scalars  = scalarsStack;
-    }
-    else
-    {
-      if ( FT_QNEW_ARRAY( deltaSet, varData->regionIdxCount ) )
-        goto Exit;
-      if ( FT_QNEW_ARRAY( scalars, varData->regionIdxCount ) )
-        goto Exit;
-    }
-
     /* Parse delta set.                                            */
     /*                                                             */
     /* Deltas are (word_delta_count + region_idx_count) bytes each */
     /* if `longWords` isn't set, and twice as much otherwise.      */
     per_region_size = varData->wordDeltaCount + varData->regionIdxCount;
     if ( varData->longWords )
+    {
+      shift_base       = 2;
       per_region_size *= 2;
+    }
 
     bytes = varData->deltaSet + per_region_size * innerIndex;
 
-    if ( varData->longWords )
-    {
-      for ( master = 0; master < varData->wordDeltaCount; master++ )
-        deltaSet[master] = FT_NEXT_LONG( bytes );
-      for ( ; master < varData->regionIdxCount; master++ )
-        deltaSet[master] = FT_NEXT_SHORT( bytes );
-    }
-    else
-    {
-      for ( master = 0; master < varData->wordDeltaCount; master++ )
-        deltaSet[master] = FT_NEXT_SHORT( bytes );
-      for ( ; master < varData->regionIdxCount; master++ )
-        deltaSet[master] = FT_NEXT_CHAR( bytes );
-    }
-
     /* outer loop steps through master designs to be blended */
     for ( master = 0; master < varData->regionIdxCount; master++ )
     {
-      FT_Fixed  scalar      = 0x10000L;
-      FT_UInt   regionIndex = varData->regionIndices[master];
+      FT_UInt  regionIndex = varData->regionIndices[master];
 
       GX_AxisCoords  axis = itemStore->varRegionList[regionIndex].axisList;
 
+      FT_Fixed  scalar = tt_calculate_scalar(
+                           axis,
+                           itemStore->axisCount,
+                           ttface->blend->normalizedcoords );
 
-      /* inner loop steps through axes in this region */
-      for ( j = 0; j < itemStore->axisCount; j++, axis++ )
+
+      if ( scalar )
       {
-        FT_Fixed  ncv = ttface->blend->normalizedcoords[j];
+        FT_Int  delta;
 
 
-        /* compute the scalar contribution of this axis */
-        /* with peak of 0 used for invalid axes         */
-        if ( axis->peakCoord == ncv ||
-             axis->peakCoord == 0   )
-          continue;
-
-        /* ignore this region if coords are out of range */
-        else if ( ncv <= axis->startCoord ||
-                  ncv >= axis->endCoord   )
+        if ( varData->longWords )
         {
-          scalar = 0;
-          break;
+          if ( master < varData->wordDeltaCount )
+            delta = FT_NEXT_LONG( bytes );
+          else
+            delta = FT_NEXT_SHORT( bytes );
+        }
+        else
+        {
+          if ( master < varData->wordDeltaCount )
+            delta = FT_NEXT_SHORT( bytes );
+          else
+            delta = FT_NEXT_CHAR( bytes );
         }
 
-        /* cumulative product of all the axis scalars */
-        else if ( ncv < axis->peakCoord )
-          scalar = FT_MulDiv( scalar,
-                              ncv - axis->startCoord,
-                              axis->peakCoord - axis->startCoord );
-        else   /* ncv > axis->peakCoord */
-          scalar = FT_MulDiv( scalar,
-                              axis->endCoord - ncv,
-                              axis->endCoord - axis->peakCoord );
-
-      } /* per-axis loop */
-
-      scalars[master] = scalar;
+        returnValue = ft_mul_add_delta_scalar( returnValue, delta, scalar );
+      }
+      else
+      {
+        /* Branch-free, yay. */
+        bytes += shift_base << ( master < varData->wordDeltaCount );
+      }
 
     } /* per-region loop */
 
-
-    /* Compute the scaled delta for this region.
-     *
-     * From: https://docs.microsoft.com/en-us/typography/opentype/spec/otvarcommonformats#item-variation-store-header-and-item-variation-data-subtables:
-     *
-     *   `Fixed` is a 32-bit (16.16) type and, in the general case, requires
-     *   32-bit deltas.  As described above, the `DeltaSet` record can
-     *   accommodate deltas that are, logically, either 16-bit or 32-bit.
-     *   When scaled deltas are applied to `Fixed` values, the `Fixed` value
-     *   is treated like a 32-bit integer.
-     *
-     * `FT_MulAddFix` internally uses 64-bit precision; it thus can handle
-     * deltas ranging from small 8-bit to large 32-bit values that are
-     * applied to 16.16 `FT_Fixed` / OpenType `Fixed` values.
-     */
-    returnValue = FT_MulAddFix( scalars, deltaSet, varData->regionIdxCount );
-
-  Exit:
-    if ( scalars != scalarsStack )
-      FT_FREE( scalars );
-    if ( deltaSet != deltaSetStack )
-      FT_FREE( deltaSet );
-
-    return returnValue;
+    return ft_round_and_shift16( returnValue );
   }
 
 
@@ -1643,6 +1788,7 @@
     GX_Blend      blend  = face->blend;
     FT_Error      error;
     FT_UInt       i, j;
+    FT_Byte*      bytes;
     FT_ULong      table_len;
     FT_ULong      gvar_start;
     FT_ULong      offsetToData;
@@ -1734,6 +1880,8 @@
     if ( FT_FRAME_ENTER( offsets_len ) )
       goto Exit;
 
+    bytes = stream->cursor;
+
     /* offsets (one more offset than glyphs, to mark size of last) */
     if ( FT_QNEW_ARRAY( blend->glyphoffsets, gvar_head.glyphCount + 1 ) )
       goto Fail2;
@@ -1744,16 +1892,24 @@
       FT_ULong  max_offset = 0;
 
 
+      if ( stream->limit - stream->cursor < gvar_head.glyphCount * 4 )
+      {
+        FT_TRACE2(( "ft_var_load_gvar:"
+                    " glyph variation data offset not enough\n" ));
+        error = FT_THROW( Invalid_Table );
+        goto Fail;
+      }
+
       for ( i = 0; i <= gvar_head.glyphCount; i++ )
       {
-        blend->glyphoffsets[i] = offsetToData + FT_GET_ULONG();
+        blend->glyphoffsets[i] = offsetToData + FT_NEXT_ULONG( bytes );
 
         if ( max_offset <= blend->glyphoffsets[i] )
           max_offset = blend->glyphoffsets[i];
         else
         {
           FT_TRACE2(( "ft_var_load_gvar:"
-                      " glyph variation data offset %d not monotonic\n",
+                      " glyph variation data offset %u not monotonic\n",
                       i ));
           blend->glyphoffsets[i] = max_offset;
         }
@@ -1762,7 +1918,7 @@
         if ( limit < blend->glyphoffsets[i] )
         {
           FT_TRACE2(( "ft_var_load_gvar:"
-                      " glyph variation data offset %d out of range\n",
+                      " glyph variation data offset %u out of range\n",
                       i ));
           blend->glyphoffsets[i] = limit;
         }
@@ -1774,16 +1930,24 @@
       FT_ULong  max_offset = 0;
 
 
+      if ( stream->limit - stream->cursor < gvar_head.glyphCount * 2 )
+      {
+        FT_TRACE2(( "ft_var_load_gvar:"
+                    " glyph variation data offset not enough\n" ));
+        error = FT_THROW( Invalid_Table );
+        goto Fail;
+      }
+
       for ( i = 0; i <= gvar_head.glyphCount; i++ )
       {
-        blend->glyphoffsets[i] = offsetToData + FT_GET_USHORT() * 2;
+        blend->glyphoffsets[i] = offsetToData + FT_NEXT_USHORT( bytes ) * 2;
 
         if ( max_offset <= blend->glyphoffsets[i] )
           max_offset = blend->glyphoffsets[i];
         else
         {
           FT_TRACE2(( "ft_var_load_gvar:"
-                      " glyph variation data offset %d not monotonic\n",
+                      " glyph variation data offset %u not monotonic\n",
                       i ));
           blend->glyphoffsets[i] = max_offset;
         }
@@ -1792,7 +1956,7 @@
         if ( limit < blend->glyphoffsets[i] )
         {
           FT_TRACE2(( "ft_var_load_gvar:"
-                      " glyph variation data offset %d out of range\n",
+                      " glyph variation data offset %u out of range\n",
                       i ));
           blend->glyphoffsets[i] = limit;
         }
@@ -1814,6 +1978,8 @@
         goto Fail;
       }
 
+      bytes = stream->cursor;
+
       if ( FT_QNEW_ARRAY( blend->tuplecoords,
                           gvar_head.axisCount * gvar_head.globalCoordCount ) )
         goto Fail2;
@@ -1824,13 +1990,17 @@
         for ( j = 0; j < (FT_UInt)gvar_head.axisCount; j++ )
         {
           blend->tuplecoords[i * gvar_head.axisCount + j] =
-            FT_fdot14ToFixed( FT_GET_SHORT() );
+            FT_fdot14ToFixed( FT_NEXT_SHORT( bytes ) );
           FT_TRACE5(( "%.5f ",
             (double)blend->tuplecoords[i * gvar_head.axisCount + j] / 65536 ));
         }
         FT_TRACE5(( "]\n" ));
       }
 
+      if ( FT_NEW_ARRAY( blend->tuplescalars,
+                         gvar_head.globalCoordCount ) )
+        goto Fail2;
+
       blend->tuplecount = gvar_head.globalCoordCount;
 
       FT_TRACE5(( "\n" ));
@@ -1896,15 +2066,25 @@
 
     for ( i = 0; i < blend->num_axis; i++ )
     {
-      FT_Fixed  ncv = blend->normalizedcoords[i];
+      FT_Fixed  ncv;
 
 
-      FT_TRACE6(( "    axis %d coordinate %.5f:\n", i, (double)ncv / 65536 ));
+      if ( tuple_coords[i] == 0 )
+      {
+        FT_TRACE6(( "      tuple coordinate is zero, ignore\n" ));
+        continue;
+      }
 
-      /* It's not clear why (for intermediate tuples) we don't need     */
-      /* to check against start/end -- the documentation says we don't. */
-      /* Similarly, it's unclear why we don't need to scale along the   */
-      /* axis.                                                          */
+      ncv = blend->normalizedcoords[i];
+
+      FT_TRACE6(( "    axis %u coordinate %.5f:\n", i, (double)ncv / 65536 ));
+
+      if ( ncv == 0 )
+      {
+        FT_TRACE6(( "      axis coordinate is zero, stop\n" ));
+        apply = 0;
+        break;
+      }
 
       if ( tuple_coords[i] == ncv )
       {
@@ -1914,12 +2094,6 @@
         continue;
       }
 
-      if ( tuple_coords[i] == 0 )
-      {
-        FT_TRACE6(( "      tuple coordinate is zero, ignore\n" ));
-        continue;
-      }
-
       if ( !( tupleIndex & GX_TI_INTERMEDIATE_TUPLE ) )
       {
         /* not an intermediate tuple */
@@ -2001,7 +2175,7 @@
     if ( num_coords > mmvar->num_axis )
     {
       FT_TRACE2(( "ft_var_to_normalized:"
-                  " only using first %d of %d coordinates\n",
+                  " only using first %u of %u coordinates\n",
                   mmvar->num_axis, num_coords ));
       num_coords = mmvar->num_axis;
     }
@@ -2016,7 +2190,7 @@
       FT_Fixed  coord = coords[i];
 
 
-      FT_TRACE5(( "    %d: %.5f\n", i, (double)coord / 65536 ));
+      FT_TRACE5(( "    %u: %.5f\n", i, (double)coord / 65536 ));
       if ( coord > a->maximum || coord < a->minimum )
       {
         FT_TRACE1(( "ft_var_to_normalized: design coordinate %.5f\n",
@@ -2156,7 +2330,7 @@
     if ( num_coords > blend->num_axis )
     {
       FT_TRACE2(( "ft_var_to_design:"
-                  " only using first %d of %d coordinates\n",
+                  " only using first %u of %u coordinates\n",
                   blend->num_axis, num_coords ));
       nc = blend->num_axis;
     }
@@ -2516,7 +2690,7 @@
                       "    minimum     default     maximum   flags\n" ));
                    /* "  XXXX.XXXXX  XXXX.XXXXX  XXXX.XXXXX  0xXXXX" */
 
-        FT_TRACE5(( "  %3d  `%s'"
+        FT_TRACE5(( "  %3u  `%s'"
                     "  %10.5f  %10.5f  %10.5f  0x%04X%s\n",
                     i,
                     a->name,
@@ -2608,7 +2782,7 @@
 
           (void)FT_STREAM_SEEK( pos );
 
-          FT_TRACE5(( "  named instance %d (%s%s%s, %s%s%s)\n",
+          FT_TRACE5(( "  named instance %u (%s%s%s, %s%s%s)\n",
                       i,
                       strname ? "name: `" : "",
                       strname ? strname : "unnamed",
@@ -2636,7 +2810,7 @@
         FT_UInt  strid = ~0U;
 
 
-        /* The default instance is missing in array the    */
+        /* The default instance is missing in the array    */
         /* of named instances; try to synthesize an entry. */
         /* If this fails, `default_named_instance` remains */
         /* at value zero, which doesn't do any harm.       */
@@ -2766,10 +2940,18 @@
     } manageCvt;
 
 
-    face->doblend = FALSE;
-
     if ( !face->blend )
     {
+      face->doblend = FALSE;
+      for ( i = 0; i < num_coords; i++ )
+        if ( coords[i] )
+        {
+          face->doblend = TRUE;
+          break;
+        }
+      if ( !face->doblend )
+        goto Exit;
+
       if ( FT_SET_ERROR( TT_Get_MM_Var( FT_FACE( face ), NULL ) ) )
         goto Exit;
     }
@@ -2780,7 +2962,7 @@
     if ( num_coords > mmvar->num_axis )
     {
       FT_TRACE2(( "TT_Set_MM_Blend:"
-                  " only using first %d of %d coordinates\n",
+                  " only using first %u of %u coordinates\n",
                   mmvar->num_axis, num_coords ));
       num_coords = mmvar->num_axis;
     }
@@ -2882,11 +3064,7 @@
 
       /* return value -1 indicates `no change' */
       if ( !have_diff )
-      {
-        face->doblend = TRUE;
-
         return -1;
-      }
 
       for ( ; i < mmvar->num_axis; i++ )
       {
@@ -2915,7 +3093,15 @@
                         blend->normalizedcoords,
                         blend->coords );
 
-    face->doblend = TRUE;
+    face->doblend = FALSE;
+    for ( i = 0; i < blend->num_axis; i++ )
+    {
+      if ( blend->normalizedcoords[i] )
+      {
+        face->doblend = TRUE;
+        break;
+      }
+    }
 
     if ( face->cvt )
     {
@@ -2941,6 +3127,9 @@
       }
     }
 
+    for ( i = 0 ; i < blend->tuplecount ; i++ )
+      blend->tuplescalars[i] = (FT_Fixed)-0x20000L;
+
   Exit:
     return error;
   }
@@ -2980,7 +3169,24 @@
                    FT_UInt    num_coords,
                    FT_Fixed*  coords )
   {
-    return tt_set_mm_blend( (TT_Face)face, num_coords, coords, 1 );
+    FT_Error  error;
+
+
+    error = tt_set_mm_blend( (TT_Face)face, num_coords, coords, 1 );
+    if ( error == FT_Err_Ok )
+    {
+      FT_UInt  i;
+
+
+      for ( i = 0; i < num_coords; i++ )
+        if ( coords[i] )
+        {
+          error = -2; /* -2 means is_variable. */
+          break;
+        }
+    }
+
+    return error;
   }
 
 
@@ -3043,7 +3249,7 @@
     if ( num_coords > blend->num_axis )
     {
       FT_TRACE2(( "TT_Get_MM_Blend:"
-                  " only using first %d of %d coordinates\n",
+                  " only using first %u of %u coordinates\n",
                   blend->num_axis, num_coords ));
       nc = blend->num_axis;
     }
@@ -3125,7 +3331,7 @@
     if ( num_coords > mmvar->num_axis )
     {
       FT_TRACE2(( "TT_Set_Var_Design:"
-                  " only using first %d of %d coordinates\n",
+                  " only using first %u of %u coordinates\n",
                   mmvar->num_axis, num_coords ));
       num_coords = mmvar->num_axis;
     }
@@ -3201,6 +3407,15 @@
     if ( error )
       goto Exit;
 
+    for ( i = 0; i < num_coords; i++ )
+    {
+      if ( normalized[i] )
+      {
+        error = -2; /* -2 means is_variable. */
+        break;
+      }
+    }
+
   Exit:
     FT_FREE( normalized );
     return error;
@@ -3237,10 +3452,12 @@
                      FT_UInt    num_coords,
                      FT_Fixed*  coords )
   {
-    TT_Face   ttface = (TT_Face)face;
-    FT_Error  error  = FT_Err_Ok;
-    GX_Blend  blend;
-    FT_UInt   i, nc;
+    TT_Face       ttface = (TT_Face)face;
+    FT_Error      error  = FT_Err_Ok;
+    GX_Blend      blend;
+    FT_MM_Var*    mmvar;
+    FT_Var_Axis*  a;
+    FT_UInt       i, nc;
 
 
     if ( !ttface->blend )
@@ -3263,24 +3480,26 @@
     if ( num_coords > blend->num_axis )
     {
       FT_TRACE2(( "TT_Get_Var_Design:"
-                  " only using first %d of %d coordinates\n",
+                  " only using first %u of %u coordinates\n",
                   blend->num_axis, num_coords ));
       nc = blend->num_axis;
     }
 
+    mmvar = blend->mmvar;
+    a     = mmvar->axis;
     if ( ttface->doblend )
     {
-      for ( i = 0; i < nc; i++ )
+      for ( i = 0; i < nc; i++, a++ )
         coords[i] = blend->coords[i];
     }
     else
     {
-      for ( i = 0; i < nc; i++ )
-        coords[i] = 0;
+      for ( i = 0; i < nc; i++, a++ )
+        coords[i] = a->def;
     }
 
-    for ( ; i < num_coords; i++ )
-      coords[i] = 0;
+    for ( ; i < num_coords; i++, a++ )
+      coords[i] = a->def;
 
     return FT_Err_Ok;
   }
@@ -3373,6 +3592,9 @@
       error = TT_Set_Var_Design( face, 0, NULL );
     }
 
+    if ( error == -1 || error == -2 )
+      error = FT_Err_Ok;
+
   Exit:
     return error;
   }
@@ -3591,7 +3813,7 @@
       FT_Stream_SeekSet( stream, here );
     }
 
-    FT_TRACE5(( "cvar: there %s %d tuple%s:\n",
+    FT_TRACE5(( "cvar: there %s %u tuple%s:\n",
                 ( tupleCount & GX_TC_TUPLE_COUNT_MASK ) == 1 ? "is" : "are",
                 tupleCount & GX_TC_TUPLE_COUNT_MASK,
                 ( tupleCount & GX_TC_TUPLE_COUNT_MASK ) == 1 ? "" : "s" ));
@@ -3610,7 +3832,7 @@
       FT_Fixed  apply;
 
 
-      FT_TRACE6(( "  tuple %d:\n", i ));
+      FT_TRACE6(( "  tuple %u:\n", i ));
 
       tupleDataSize = FT_GET_USHORT();
       tupleIndex    = FT_GET_USHORT();
@@ -3676,7 +3898,7 @@
       if ( !points || !deltas )
         ; /* failure, ignore it */
 
-      else if ( localpoints == ALL_POINTS )
+      else if ( points == ALL_POINTS )
       {
 #ifdef FT_DEBUG_LEVEL_TRACE
         int  count = 0;
@@ -3697,7 +3919,7 @@
 #ifdef FT_DEBUG_LEVEL_TRACE
           if ( old_cvt_delta != cvt_deltas[j] )
           {
-            FT_TRACE7(( "      %d: %f -> %f\n",
+            FT_TRACE7(( "      %u: %f -> %f\n",
                         j,
                         (double)( FT_fdot6ToFixed( face->cvt[j] ) +
                                     old_cvt_delta ) / 65536,
@@ -4027,7 +4249,7 @@
                               FT_Outline*  outline,
                               FT_Vector*   unrounded )
   {
-    FT_Error   error;
+    FT_Error   error       = FT_Err_Ok;
     TT_Face    face        = loader->face;
     FT_Stream  stream      = face->root.stream;
     FT_Memory  memory      = stream->memory;
@@ -4047,6 +4269,15 @@
     FT_ULong  here;
     FT_UInt   i, j;
 
+    FT_UInt   peak_coords_size;
+    FT_UInt   point_deltas_x_size;
+    FT_UInt   points_org_size;
+    FT_UInt   points_out_size;
+    FT_UInt   has_delta_size;
+    FT_UInt   pool_size;
+    FT_Byte*  pool = NULL;
+    FT_Byte*  p;
+
     FT_Fixed*  peak_coords = NULL;
     FT_Fixed*  tuple_coords;
     FT_Fixed*  im_start_coords;
@@ -4067,21 +4298,24 @@
     FT_Fixed*  point_deltas_y = NULL;
 
 
-    if ( !face->doblend || !blend )
-      return FT_THROW( Invalid_Argument );
-
     for ( i = 0; i < n_points; i++ )
     {
       unrounded[i].x = INT_TO_F26DOT6( outline->points[i].x );
       unrounded[i].y = INT_TO_F26DOT6( outline->points[i].y );
     }
 
+    if ( !face->doblend  )
+      goto Exit;
+
+    if ( !blend )
+      return FT_THROW( Invalid_Argument );
+
     if ( glyph_index >= blend->gv_glyphcnt      ||
          blend->glyphoffsets[glyph_index] ==
            blend->glyphoffsets[glyph_index + 1] )
     {
       FT_TRACE2(( "TT_Vary_Apply_Glyph_Deltas:"
-                  " no variation data for glyph %d\n", glyph_index ));
+                  " no variation data for glyph %u\n", glyph_index ));
       return FT_Err_Ok;
     }
 
@@ -4125,18 +4359,41 @@
       FT_Stream_SeekSet( stream, here );
     }
 
-    FT_TRACE5(( "gvar: there %s %d tuple%s:\n",
+    FT_TRACE5(( "gvar: there %s %u tuple%s:\n",
                 ( tupleCount & GX_TC_TUPLE_COUNT_MASK ) == 1 ? "is" : "are",
                 tupleCount & GX_TC_TUPLE_COUNT_MASK,
                 ( tupleCount & GX_TC_TUPLE_COUNT_MASK ) == 1 ? "" : "s" ));
 
-    if ( FT_QNEW_ARRAY( peak_coords, 3 * blend->num_axis ) ||
-         FT_NEW_ARRAY( point_deltas_x, 2 * n_points )      ||
-         FT_QNEW_ARRAY( points_org, n_points )             ||
-         FT_QNEW_ARRAY( points_out, n_points )             ||
-         FT_QNEW_ARRAY( has_delta, n_points )              )
+    peak_coords_size    = ALIGN_SIZE( 3 * blend->num_axis *
+                                      sizeof ( *peak_coords ) );
+    point_deltas_x_size = ALIGN_SIZE( 2 * n_points *
+                                      sizeof ( *point_deltas_x ) );
+    points_org_size     = ALIGN_SIZE( n_points * sizeof ( *points_org ) );
+    points_out_size     = ALIGN_SIZE( n_points * sizeof ( *points_out ) );
+    has_delta_size      = ALIGN_SIZE( n_points * sizeof ( *has_delta ) );
+
+    pool_size = peak_coords_size    +
+                point_deltas_x_size +
+                points_org_size     +
+                points_out_size     +
+                has_delta_size;
+
+    if ( FT_ALLOC( pool, pool_size ) )
       goto Exit;
 
+    p               = pool;
+    peak_coords     = (FT_Fixed*)p;
+    p              += peak_coords_size;
+    point_deltas_x  = (FT_Fixed*)p;
+    p              += point_deltas_x_size;
+    points_org      = (FT_Vector*)p;
+    p              += points_org_size;
+    points_out      = (FT_Vector*)p;
+    p              += points_out_size;
+    has_delta       = (FT_Bool*)p;
+
+    FT_ARRAY_ZERO( point_deltas_x, 2 * n_points );
+
     im_start_coords = peak_coords + blend->num_axis;
     im_end_coords   = im_start_coords + blend->num_axis;
     point_deltas_y  = point_deltas_x + n_points;
@@ -4147,27 +4404,70 @@
       points_org[j].y = FT_intToFixed( outline->points[j].y );
     }
 
-    for ( i = 0; i < ( tupleCount & GX_TC_TUPLE_COUNT_MASK ); i++ )
+    p = stream->cursor;
+
+    tupleCount &= GX_TC_TUPLE_COUNT_MASK;
+    for ( i = 0; i < tupleCount; i++ )
     {
-      FT_UInt   tupleDataSize;
-      FT_UInt   tupleIndex;
-      FT_Fixed  apply;
+      FT_UInt    tupleDataSize;
+      FT_UInt    tupleIndex;
+      FT_Fixed   apply;
+      FT_Fixed*  tupleScalars;
 
 
-      FT_TRACE6(( "  tuple %d:\n", i ));
+      FT_TRACE6(( "  tuple %u:\n", i ));
 
-      tupleDataSize = FT_GET_USHORT();
-      tupleIndex    = FT_GET_USHORT();
+      tupleScalars = blend->tuplescalars;
+
+      /* Enter frame for four bytes. */
+      if ( 4 > stream->limit - p )
+      {
+        FT_TRACE2(( "TT_Vary_Apply_Glyph_Deltas:"
+                    " invalid glyph variation array header\n" ));
+        error = FT_THROW( Invalid_Table );
+        goto Exit;
+      }
+
+      tupleDataSize = FT_NEXT_USHORT( p );
+      tupleIndex    = FT_NEXT_USHORT( p );
+
+      if ( tupleIndex & GX_TI_INTERMEDIATE_TUPLE )
+        tupleScalars = NULL;
 
       if ( tupleIndex & GX_TI_EMBEDDED_TUPLE_COORD )
       {
+        if ( 2 * blend->num_axis > (FT_UInt)( stream->limit - p ) )
+        {
+          FT_TRACE2(( "TT_Vary_Apply_Glyph_Deltas:"
+                      " invalid glyph variation array header\n" ));
+          error = FT_THROW( Invalid_Table );
+          goto Exit;
+        }
+
         for ( j = 0; j < blend->num_axis; j++ )
-          peak_coords[j] = FT_fdot14ToFixed( FT_GET_SHORT() );
+          peak_coords[j] = FT_fdot14ToFixed( FT_NEXT_SHORT( p ) );
+
         tuple_coords = peak_coords;
+        tupleScalars = NULL;
       }
       else if ( ( tupleIndex & GX_TI_TUPLE_INDEX_MASK ) < blend->tuplecount )
+      {
+        FT_Fixed  scalar =
+                    tupleScalars
+                      ? tupleScalars[tupleIndex & GX_TI_TUPLE_INDEX_MASK]
+                      : (FT_Fixed)-0x20000;
+
+
+        if ( scalar != (FT_Fixed)-0x20000 )
+        {
+          apply = scalar;
+          goto apply_found;
+        }
+
         tuple_coords = blend->tuplecoords +
-            ( tupleIndex & GX_TI_TUPLE_INDEX_MASK ) * blend->num_axis;
+                         ( tupleIndex & GX_TI_TUPLE_INDEX_MASK ) *
+                         blend->num_axis;
+      }
       else
       {
         FT_TRACE2(( "TT_Vary_Apply_Glyph_Deltas:"
@@ -4179,10 +4479,18 @@
 
       if ( tupleIndex & GX_TI_INTERMEDIATE_TUPLE )
       {
+        if ( 4 * blend->num_axis > (FT_UInt)( stream->limit - p ) )
+        {
+          FT_TRACE2(( "TT_Vary_Apply_Glyph_Deltas:"
+                      " invalid glyph variation array header\n" ));
+          error = FT_THROW( Invalid_Table );
+          goto Exit;
+        }
+
         for ( j = 0; j < blend->num_axis; j++ )
-          im_start_coords[j] = FT_fdot14ToFixed( FT_GET_SHORT() );
+          im_start_coords[j] = FT_fdot14ToFixed( FT_NEXT_SHORT( p ) );
         for ( j = 0; j < blend->num_axis; j++ )
-          im_end_coords[j] = FT_fdot14ToFixed( FT_GET_SHORT() );
+          im_end_coords[j] = FT_fdot14ToFixed( FT_NEXT_SHORT( p ) );
       }
 
       apply = ft_var_apply_tuple( blend,
@@ -4191,6 +4499,11 @@
                                   im_start_coords,
                                   im_end_coords );
 
+      if ( tupleScalars )
+        tupleScalars[tupleIndex & GX_TI_TUPLE_INDEX_MASK] = apply;
+
+    apply_found:
+
       if ( apply == 0 )              /* tuple isn't active for our blend */
       {
         offsetToData += tupleDataSize;
@@ -4247,7 +4560,7 @@
 #ifdef FT_DEBUG_LEVEL_TRACE
           if ( point_delta_x || point_delta_y )
           {
-            FT_TRACE7(( "      %d: (%f, %f) -> (%f, %f)\n",
+            FT_TRACE7(( "      %u: (%f, %f) -> (%f, %f)\n",
                         j,
                         (double)( FT_intToFixed( outline->points[j].x ) +
                                     old_point_delta_x ) / 65536,
@@ -4321,7 +4634,7 @@
 #ifdef FT_DEBUG_LEVEL_TRACE
           if ( point_delta_x || point_delta_y )
           {
-            FT_TRACE7(( "      %d: (%f, %f) -> (%f, %f)\n",
+            FT_TRACE7(( "      %u: (%f, %f) -> (%f, %f)\n",
                         j,
                         (double)( FT_intToFixed( outline->points[j].x ) +
                                     old_point_delta_x ) / 65536,
@@ -4402,11 +4715,7 @@
   Exit:
     if ( sharedpoints != ALL_POINTS )
       FT_FREE( sharedpoints );
-    FT_FREE( points_org );
-    FT_FREE( points_out );
-    FT_FREE( has_delta );
-    FT_FREE( peak_coords );
-    FT_FREE( point_deltas_x );
+    FT_FREE( pool );
 
   FExit:
     FT_FRAME_EXIT();
@@ -4577,6 +4886,7 @@
         FT_FREE( blend->mvar_table );
       }
 
+      FT_FREE( blend->tuplescalars );
       FT_FREE( blend->tuplecoords );
       FT_FREE( blend->glyphoffsets );
       FT_FREE( blend );
diff --git a/src/java.desktop/share/native/libfreetype/src/truetype/ttgxvar.h b/src/java.desktop/share/native/libfreetype/src/truetype/ttgxvar.h
index 9326011e3a2..568c8027bbf 100644
--- a/src/java.desktop/share/native/libfreetype/src/truetype/ttgxvar.h
+++ b/src/java.desktop/share/native/libfreetype/src/truetype/ttgxvar.h
@@ -4,7 +4,7 @@
  *
  *   TrueType GX Font Variation loader (specification)
  *
- * Copyright (C) 2004-2024 by
+ * Copyright (C) 2004-2025 by
  * David Turner, Robert Wilhelm, Werner Lemberg and George Williams.
  *
  * This file is part of the FreeType project, and may only be used,
@@ -255,6 +255,10 @@ FT_BEGIN_HEADER
    *     A two-dimensional array that holds the shared tuple coordinates
    *     in the `gvar' table.
    *
+   *   tuplescalars ::
+   *     A one-dimensional array that holds the shared tuple
+   *     scalars in the `gvar' table for current face coordinates.
+   *
    *   gv_glyphcnt ::
    *     The number of glyphs handled in the `gvar' table.
    *
@@ -293,6 +297,7 @@ FT_BEGIN_HEADER
 
     FT_UInt         tuplecount;
     FT_Fixed*       tuplecoords;      /* tuplecoords[tuplecount][num_axis] */
+    FT_Fixed*       tuplescalars;     /* tuplescalars[tuplecount]          */
 
     FT_UInt         gv_glyphcnt;
     FT_ULong*       glyphoffsets;         /* glyphoffsets[gv_glyphcnt + 1] */
diff --git a/src/java.desktop/share/native/libfreetype/src/truetype/ttinterp.c b/src/java.desktop/share/native/libfreetype/src/truetype/ttinterp.c
index 951891dbf51..7b26c9a9df2 100644
--- a/src/java.desktop/share/native/libfreetype/src/truetype/ttinterp.c
+++ b/src/java.desktop/share/native/libfreetype/src/truetype/ttinterp.c
@@ -4,7 +4,7 @@
  *
  *   TrueType bytecode interpreter (body).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
@@ -27,6 +27,8 @@
 #include <freetype/ftdriver.h>
 #include <freetype/ftmm.h>
 
+#ifdef TT_USE_BYTECODE_INTERPRETER
+
 #include "ttinterp.h"
 #include "tterrors.h"
 #ifdef TT_CONFIG_OPTION_GX_VAR_SUPPORT
@@ -34,9 +36,6 @@
 #endif
 
 
-#ifdef TT_USE_BYTECODE_INTERPRETER
-
-
   /**************************************************************************
    *
    * The macro FT_COMPONENT is used in trace mode.  It is an implicit
@@ -89,6 +88,32 @@
 #define FAILURE  1
 
 
+  /* The default value for `scan_control' is documented as FALSE in the */
+  /* TrueType specification.  This is confusing since it implies a      */
+  /* Boolean value.  However, this is not the case, thus both the       */
+  /* default values of our `scan_type' and `scan_control' fields (which */
+  /* the documentation's `scan_control' variable is split into) are     */
+  /* zero.                                                              */
+  /*                                                                    */
+  /* The rounding compensation should logically belong here but poorly  */
+  /* described in the OpenType specs.  It was probably important in the */
+  /* days of dot matrix printers.  The values are referenced by color   */
+  /* as Gray, Black, and White in order. The Apple specification says   */
+  /* that the Gray compensation is always zero.  The fourth value is    */
+  /* not described at all, but Greg says that it is the same as Gray.   */
+  /* FreeType sets all compensation values to zero.                     */
+
+  const TT_GraphicsState  tt_default_graphics_state =
+  {
+    0, 0, 0,  1, 1, 1,
+    { 0x4000, 0 }, { 0x4000, 0 }, { 0x4000, 0 },
+    1, 1, { 0, 0, 0, 0 },
+
+    64, 68, 0, 0, 9, 3,
+    TRUE, 0, FALSE, 0
+  };
+
+
   /**************************************************************************
    *
    *                       CODERANGE FUNCTIONS
@@ -96,53 +121,6 @@
    */
 
 
-  /**************************************************************************
-   *
-   * @Function:
-   *   TT_Goto_CodeRange
-   *
-   * @Description:
-   *   Switches to a new code range (updates the code related elements in
-   *   `exec', and `IP').
-   *
-   * @Input:
-   *   range ::
-   *     The new execution code range.
-   *
-   *   IP ::
-   *     The new IP in the new code range.
-   *
-   * @InOut:
-   *   exec ::
-   *     The target execution context.
-   */
-  FT_LOCAL_DEF( void )
-  TT_Goto_CodeRange( TT_ExecContext  exec,
-                     FT_Int          range,
-                     FT_Long         IP )
-  {
-    TT_CodeRange*  coderange;
-
-
-    FT_ASSERT( range >= 1 && range <= 3 );
-
-    coderange = &exec->codeRangeTable[range - 1];
-
-    FT_ASSERT( coderange->base );
-
-    /* NOTE: Because the last instruction of a program may be a CALL */
-    /*       which will return to the first byte *after* the code    */
-    /*       range, we test for IP <= Size instead of IP < Size.     */
-    /*                                                               */
-    FT_ASSERT( IP <= coderange->size );
-
-    exec->code     = coderange->base;
-    exec->codeSize = coderange->size;
-    exec->IP       = IP;
-    exec->curRange = range;
-  }
-
-
   /**************************************************************************
    *
    * @Function:
@@ -168,13 +146,19 @@
   FT_LOCAL_DEF( void )
   TT_Set_CodeRange( TT_ExecContext  exec,
                     FT_Int          range,
-                    void*           base,
+                    FT_Byte*        base,
                     FT_Long         length )
   {
     FT_ASSERT( range >= 1 && range <= 3 );
 
-    exec->codeRangeTable[range - 1].base = (FT_Byte*)base;
+    exec->codeRangeTable[range - 1].base = base;
     exec->codeRangeTable[range - 1].size = length;
+
+    exec->code     = base;
+    exec->codeSize = length;
+    exec->IP       = 0;
+    exec->curRange = range;
+    exec->iniRange = range;
   }
 
 
@@ -224,9 +208,6 @@
    *   exec ::
    *     A handle to the target execution context.
    *
-   *   memory ::
-   *     A handle to the parent memory object.
-   *
    * @Note:
    *   Only the glyph loader and debugger should call this function.
    */
@@ -240,10 +221,6 @@
     exec->maxPoints   = 0;
     exec->maxContours = 0;
 
-    /* free stack */
-    FT_FREE( exec->stack );
-    exec->stackSize = 0;
-
     /* free glyf cvt working area */
     FT_FREE( exec->glyfCvt );
     exec->glyfCvtSize = 0;
@@ -300,72 +277,26 @@
                    TT_Face         face,
                    TT_Size         size )
   {
-    FT_Int          i;
-    TT_MaxProfile*  maxp;
-    FT_Error        error;
-    FT_Memory       memory = exec->memory;
+    FT_Memory  memory = exec->memory;
 
 
     exec->face = face;
-    maxp       = &face->max_profile;
     exec->size = size;
 
-    if ( size )
-    {
-      exec->numFDefs   = size->num_function_defs;
-      exec->maxFDefs   = size->max_function_defs;
-      exec->numIDefs   = size->num_instruction_defs;
-      exec->maxIDefs   = size->max_instruction_defs;
-      exec->FDefs      = size->function_defs;
-      exec->IDefs      = size->instruction_defs;
-      exec->pointSize  = size->point_size;
-      exec->tt_metrics = size->ttmetrics;
-      exec->metrics    = *size->metrics;
-
-      exec->maxFunc    = size->max_func;
-      exec->maxIns     = size->max_ins;
-
-      for ( i = 0; i < TT_MAX_CODE_RANGES; i++ )
-        exec->codeRangeTable[i] = size->codeRangeTable[i];
-
-      /* set graphics state */
-      exec->GS = size->GS;
-
-      exec->cvtSize = size->cvt_size;
-      exec->cvt     = size->cvt;
-
-      exec->storeSize = size->storage_size;
-      exec->storage   = size->storage;
-
-      exec->twilight  = size->twilight;
-
-      /* In case of multi-threading it can happen that the old size object */
-      /* no longer exists, thus we must clear all glyph zone references.   */
-      FT_ZERO( &exec->zp0 );
-      exec->zp1 = exec->zp0;
-      exec->zp2 = exec->zp0;
-    }
-
-    /* XXX: We reserve a little more elements on the stack to deal safely */
-    /*      with broken fonts like arialbs, courbs, timesbs, etc.         */
-    if ( FT_QRENEW_ARRAY( exec->stack,
-                          exec->stackSize,
-                          maxp->maxStackElements + 32 ) )
-      return error;
-    exec->stackSize = maxp->maxStackElements + 32;
+    /* CVT and storage are not persistent in FreeType */
+    /* reset them after they might have been modifief */
+    exec->storage = exec->stack   + exec->stackSize;
+    exec->cvt     = exec->storage + exec->storeSize;
 
     /* free previous glyph code range */
     FT_FREE( exec->glyphIns );
     exec->glyphSize = 0;
 
-    exec->pts.n_points   = 0;
-    exec->pts.n_contours = 0;
+    exec->pointSize  = size->point_size;
+    exec->tt_metrics = size->ttmetrics;
+    exec->metrics    = *size->metrics;
 
-    exec->zp1 = exec->pts;
-    exec->zp2 = exec->pts;
-    exec->zp0 = exec->pts;
-
-    exec->instruction_trap = FALSE;
+    exec->twilight   = size->twilight;
 
     return FT_Err_Ok;
   }
@@ -394,89 +325,22 @@
   TT_Save_Context( TT_ExecContext  exec,
                    TT_Size         size )
   {
-    FT_Int  i;
+    /* UNDOCUMENTED!                                            */
+    /* Only these GS values can be modified by the CVT program. */
 
-
-    /* XXX: Will probably disappear soon with all the code range */
-    /*      management, which is now rather obsolete.            */
-    /*                                                           */
-    size->num_function_defs    = exec->numFDefs;
-    size->num_instruction_defs = exec->numIDefs;
-
-    size->max_func = exec->maxFunc;
-    size->max_ins  = exec->maxIns;
-
-    for ( i = 0; i < TT_MAX_CODE_RANGES; i++ )
-      size->codeRangeTable[i] = exec->codeRangeTable[i];
+    size->GS.minimum_distance    = exec->GS.minimum_distance;
+    size->GS.control_value_cutin = exec->GS.control_value_cutin;
+    size->GS.single_width_cutin  = exec->GS.single_width_cutin;
+    size->GS.single_width_value  = exec->GS.single_width_value;
+    size->GS.delta_base          = exec->GS.delta_base;
+    size->GS.delta_shift         = exec->GS.delta_shift;
+    size->GS.auto_flip           = exec->GS.auto_flip;
+    size->GS.instruct_control    = exec->GS.instruct_control;
+    size->GS.scan_control        = exec->GS.scan_control;
+    size->GS.scan_type           = exec->GS.scan_type;
   }
 
 
-  /**************************************************************************
-   *
-   * @Function:
-   *   TT_Run_Context
-   *
-   * @Description:
-   *   Executes one or more instructions in the execution context.
-   *
-   * @Input:
-   *   exec ::
-   *     A handle to the target execution context.
-   *
-   * @Return:
-   *   TrueType error code.  0 means success.
-   */
-  FT_LOCAL_DEF( FT_Error )
-  TT_Run_Context( TT_ExecContext  exec )
-  {
-    TT_Goto_CodeRange( exec, tt_coderange_glyph, 0 );
-
-    exec->zp0 = exec->pts;
-    exec->zp1 = exec->pts;
-    exec->zp2 = exec->pts;
-
-    exec->GS.gep0 = 1;
-    exec->GS.gep1 = 1;
-    exec->GS.gep2 = 1;
-
-    exec->GS.projVector.x = 0x4000;
-    exec->GS.projVector.y = 0x0000;
-
-    exec->GS.freeVector = exec->GS.projVector;
-    exec->GS.dualVector = exec->GS.projVector;
-
-    exec->GS.round_state = 1;
-    exec->GS.loop        = 1;
-
-    /* some glyphs leave something on the stack. so we clean it */
-    /* before a new execution.                                  */
-    exec->top     = 0;
-    exec->callTop = 0;
-
-    return exec->face->interpreter( exec );
-  }
-
-
-  /* The default value for `scan_control' is documented as FALSE in the */
-  /* TrueType specification.  This is confusing since it implies a      */
-  /* Boolean value.  However, this is not the case, thus both the       */
-  /* default values of our `scan_type' and `scan_control' fields (which */
-  /* the documentation's `scan_control' variable is split into) are     */
-  /* zero.                                                              */
-
-  const TT_GraphicsState  tt_default_graphics_state =
-  {
-    0, 0, 0,
-    { 0x4000, 0 },
-    { 0x4000, 0 },
-    { 0x4000, 0 },
-
-    1, 64, 1,
-    TRUE, 68, 0, 0, 9, 3,
-    0, FALSE, 0, 1, 1, 1
-  };
-
-
   /* documentation is in ttinterp.h */
 
   FT_EXPORT_DEF( TT_ExecContext )
@@ -485,7 +349,8 @@
     FT_Memory  memory;
     FT_Error   error;
 
-    TT_ExecContext  exec = NULL;
+    TT_ExecContext     exec = NULL;
+    FT_DebugHook_Func  interp;
 
 
     if ( !driver )
@@ -497,6 +362,15 @@
     if ( FT_NEW( exec ) )
       goto Fail;
 
+    /* set `exec->interpreter' according to the debug hook present, */
+    /* which is used by 'ttdebug'.                                  */
+    interp = driver->root.root.library->debug_hooks[FT_DEBUG_HOOK_TRUETYPE];
+
+    if ( interp )
+      exec->interpreter = (TT_Interpreter)interp;
+    else
+      exec->interpreter = (TT_Interpreter)TT_RunIns;
+
     /* create callStack here, other allocations delayed */
     exec->memory   = memory;
     exec->callSize = 32;
@@ -1160,20 +1034,35 @@
 #undef PACK
 
 
-#ifndef FT_CONFIG_OPTION_NO_ASSEMBLER
+#ifdef FT_INT64
+
+#define TT_MulFix14( a, b )  TT_MulFix14_64( a, b )
+
+  static inline FT_F26Dot6
+  TT_MulFix14_64( FT_F26Dot6  a,
+                  FT_F2Dot14  b )
+  {
+    FT_Int64  ab = MUL_INT64( a, b );
+
+
+    ab = ADD_INT64( ab, 0x2000 + ( ab >> 63 ) );  /* rounding phase */
+
+    return (FT_F26Dot6)( ab >> 14 );
+  }
+
+#elif !defined( FT_CONFIG_OPTION_NO_ASSEMBLER )
 
 #if defined( __arm__ )                                 && \
     ( defined( __thumb2__ ) || !defined( __thumb__ ) )
 
 #define TT_MulFix14  TT_MulFix14_arm
 
-  static FT_Int32
+  static __inline FT_Int32
   TT_MulFix14_arm( FT_Int32  a,
-                   FT_Int    b )
+                   FT_Int32  b )
   {
     FT_Int32  t, t2;
 
-
 #if defined( __CC_ARM ) || defined( __ARMCC__ )
 
     __asm
@@ -1199,8 +1088,8 @@
 #endif
       "adds   %1, %1, %0\n\t"           /* %1 += %0 */
       "adc    %2, %2, #0\n\t"           /* %2 += carry */
-      "mov    %0, %1, lsr #14\n\t"      /* %0  = %1 >> 16 */
-      "orr    %0, %0, %2, lsl #18\n\t"  /* %0 |= %2 << 16 */
+      "mov    %0, %1, lsr #14\n\t"      /* %0  = %1 >> 14 */
+      "orr    %0, %0, %2, lsl #18\n\t"  /* %0 |= %2 << 18 */
       : "=r"(a), "=&r"(t2), "=&r"(t)
       : "r"(a), "r"(b)
       : "cc" );
@@ -1210,49 +1099,60 @@
     return a;
   }
 
-#endif /* __arm__ && ( __thumb2__ || !__thumb__ ) */
+#elif defined( __i386__ ) || defined( _M_IX86 )
 
-#endif /* !FT_CONFIG_OPTION_NO_ASSEMBLER */
+#define TT_MulFix14  TT_MulFix14_i386
 
+  /* documentation is in freetype.h */
 
-#if defined( __GNUC__ )                              && \
-    ( defined( __i386__ ) || defined( __x86_64__ ) )
-
-#define TT_MulFix14  TT_MulFix14_long_long
-
-  /* Temporarily disable the warning that C90 doesn't support `long long'. */
-#if ( __GNUC__ * 100 + __GNUC_MINOR__ ) >= 406
-#pragma GCC diagnostic push
-#endif
-#pragma GCC diagnostic ignored "-Wlong-long"
-
-  /* This is declared `noinline' because inlining the function results */
-  /* in slower code.  The `pure' attribute indicates that the result   */
-  /* only depends on the parameters.                                   */
-  static __attribute__(( noinline ))
-         __attribute__(( pure )) FT_Int32
-  TT_MulFix14_long_long( FT_Int32  a,
-                         FT_Int    b )
+  static __inline FT_Int32
+  TT_MulFixi14_i386( FT_Int32  a,
+                     FT_Int32  b )
   {
+    FT_Int32  result;
 
-    long long  ret = (long long)a * b;
+#if defined( __GNUC__ )
 
-    /* The following line assumes that right shifting of signed values */
-    /* will actually preserve the sign bit.  The exact behaviour is    */
-    /* undefined, but this is true on x86 and x86_64.                  */
-    long long  tmp = ret >> 63;
+    __asm__ __volatile__ (
+      "imul  %%edx\n"
+      "movl  %%edx, %%ecx\n"
+      "sarl  $31, %%ecx\n"
+      "addl  $0x2000, %%ecx\n"
+      "addl  %%ecx, %%eax\n"
+      "adcl  $0, %%edx\n"
+      "shrl  $14, %%eax\n"
+      "shll  $18, %%edx\n"
+      "addl  %%edx, %%eax\n"
+      : "=a"(result), "=d"(b)
+      : "a"(a), "d"(b)
+      : "%ecx", "cc" );
 
+#elif defined( _MSC_VER)
 
-    ret += 0x2000 + tmp;
+    __asm
+    {
+      mov eax, a
+      mov edx, b
+      imul edx
+      mov ecx, edx
+      sar ecx, 31
+      add ecx, 2000h
+      add eax, ecx
+      adc edx, 0
+      shr eax, 14
+      shl edx, 18
+      add eax, edx
+      mov result, eax
+    }
 
-    return (FT_Int32)( ret >> 14 );
+#endif
+
+    return result;
   }
 
-#if ( __GNUC__ * 100 + __GNUC_MINOR__ ) >= 406
-#pragma GCC diagnostic pop
-#endif
+#endif /* __i386__ || _M_IX86 */
 
-#endif /* __GNUC__ && ( __i386__ || __x86_64__ ) */
+#endif /* !FT_CONFIG_OPTION_NO_ASSEMBLER */
 
 
 #ifndef TT_MulFix14
@@ -1262,92 +1162,59 @@
   /* for platforms where sizeof(int) == 2.                   */
   static FT_Int32
   TT_MulFix14( FT_Int32  a,
-               FT_Int    b )
+               FT_Int16  b )
   {
-    FT_Int32   sign;
-    FT_UInt32  ah, al, mid, lo, hi;
+    FT_Int32   m, hi;
+    FT_UInt32  l, lo;
 
 
-    sign = a ^ b;
+    /* compute a*b as 64-bit (hi_lo) value */
+    l = (FT_UInt32)( ( a & 0xFFFFU ) * b );
+    m = ( a >> 16 ) * b;
 
-    if ( a < 0 )
-      a = -a;
-    if ( b < 0 )
-      b = -b;
+    lo = l + ( (FT_UInt32)m << 16 );
+    hi = ( m >> 16 ) + ( (FT_Int32)l >> 31 ) + ( lo < l );
 
-    ah = (FT_UInt32)( ( a >> 16 ) & 0xFFFFU );
-    al = (FT_UInt32)( a & 0xFFFFU );
+    /* divide the result by 2^14 with rounding */
+    l   = lo + 0x2000U + (FT_UInt32)( hi >> 31 );  /* rounding phase */
+    hi += ( l < lo );
 
-    lo    = al * b;
-    mid   = ah * b;
-    hi    = mid >> 16;
-    mid   = ( mid << 16 ) + ( 1 << 13 ); /* rounding */
-    lo   += mid;
-    if ( lo < mid )
-      hi += 1;
-
-    mid = ( lo >> 14 ) | ( hi << 18 );
-
-    return sign >= 0 ? (FT_Int32)mid : -(FT_Int32)mid;
+    return (FT_F26Dot6)( ( (FT_UInt32)hi << 18 ) | ( l >> 14 ) );
   }
 
 #endif  /* !TT_MulFix14 */
 
 
-#if defined( __GNUC__ )        && \
-    ( defined( __i386__ )   ||    \
-      defined( __x86_64__ ) ||    \
-      defined( __arm__ )    )
-
-#define TT_DotFix14  TT_DotFix14_long_long
-
-#if ( __GNUC__ * 100 + __GNUC_MINOR__ ) >= 406
-#pragma GCC diagnostic push
-#endif
-#pragma GCC diagnostic ignored "-Wlong-long"
-
-  static __attribute__(( pure )) FT_Int32
-  TT_DotFix14_long_long( FT_Int32  ax,
-                         FT_Int32  ay,
-                         FT_Int    bx,
-                         FT_Int    by )
-  {
-    /* Temporarily disable the warning that C90 doesn't support */
-    /* `long long'.                                             */
-
-    long long  temp1 = (long long)ax * bx;
-    long long  temp2 = (long long)ay * by;
-
-
-    temp1 += temp2;
-    temp2  = temp1 >> 63;
-    temp1 += 0x2000 + temp2;
-
-    return (FT_Int32)( temp1 >> 14 );
-
-  }
-
-#if ( __GNUC__ * 100 + __GNUC_MINOR__ ) >= 406
-#pragma GCC diagnostic pop
-#endif
-
-#endif /* __GNUC__ && (__arm__ || __i386__ || __x86_64__) */
-
-
-#ifndef TT_DotFix14
+#ifdef FT_INT64
 
   /* compute (ax*bx+ay*by)/2^14 with maximum accuracy and rounding */
-  static FT_Int32
-  TT_DotFix14( FT_Int32  ax,
-               FT_Int32  ay,
-               FT_Int    bx,
-               FT_Int    by )
+  static inline FT_F26Dot6
+  TT_DotFix14( FT_F26Dot6  ax,
+               FT_F26Dot6  ay,
+               FT_F2Dot14  bx,
+               FT_F2Dot14  by )
   {
-    FT_Int32   m, s, hi1, hi2, hi;
+    FT_Int64  c = ADD_INT64( MUL_INT64( ax, bx ), MUL_INT64( ay, by ) );
+
+
+    c = ADD_INT64( c, 0x2000 + ( c >> 63 ) );  /* rounding phase */
+
+    return (FT_F26Dot6)( c >> 14 );
+  }
+
+#else
+
+  static inline FT_F26Dot6
+  TT_DotFix14( FT_F26Dot6  ax,
+               FT_F26Dot6  ay,
+               FT_F2Dot14  bx,
+               FT_F2Dot14  by )
+  {
+    FT_Int32   m, hi1, hi2, hi;
     FT_UInt32  l, lo1, lo2, lo;
 
 
-    /* compute ax*bx as 64-bit value */
+    /* compute ax*bx as 64-bit (hi_lo) value */
     l = (FT_UInt32)( ( ax & 0xFFFFU ) * bx );
     m = ( ax >> 16 ) * bx;
 
@@ -1366,18 +1233,13 @@
     hi = hi1 + hi2 + ( lo < lo1 );
 
     /* divide the result by 2^14 with rounding */
-    s   = hi >> 31;
-    l   = lo + (FT_UInt32)s;
-    hi += s + ( l < lo );
-    lo  = l;
-
-    l   = lo + 0x2000U;
+    l   = lo + 0x2000U + (FT_UInt32)( hi >> 31 );  /* rounding phase */
     hi += ( l < lo );
 
-    return (FT_Int32)( ( (FT_UInt32)hi << 18 ) | ( l >> 14 ) );
+    return (FT_F26Dot6)( ( (FT_UInt32)hi << 18 ) | ( l >> 14 ) );
   }
 
-#endif /* TT_DotFix14 */
+#endif /* !FT_INT64 */
 
 
   /**************************************************************************
@@ -1531,31 +1393,6 @@
   }
 
 
-  /**************************************************************************
-   *
-   * @Function:
-   *   GetShortIns
-   *
-   * @Description:
-   *   Returns a short integer taken from the instruction stream at
-   *   address IP.
-   *
-   * @Return:
-   *   Short read at code[IP].
-   *
-   * @Note:
-   *   This one could become a macro.
-   */
-  static FT_Short
-  GetShortIns( TT_ExecContext  exc )
-  {
-    /* Reading a byte stream so there is no endianness (DaveP) */
-    exc->IP += 2;
-    return (FT_Short)( ( exc->code[exc->IP - 2] << 8 ) +
-                         exc->code[exc->IP - 1]      );
-  }
-
-
   /**************************************************************************
    *
    * @Function:
@@ -1609,6 +1446,7 @@
     exc->code     = range->base;
     exc->codeSize = range->size;
     exc->IP       = aIP;
+    exc->length   = 0;
     exc->curRange = aRange;
 
     return SUCCESS;
@@ -1671,48 +1509,33 @@
                FT_UShort       point,
                FT_F26Dot6      distance )
   {
-    FT_F26Dot6  v;
+    FT_Fixed  v;
 
 
-    v = exc->GS.freeVector.x;
-
+    v = exc->moveVector.x;
     if ( v != 0 )
     {
 #ifdef TT_SUPPORT_SUBPIXEL_HINTING_MINIMAL
       /* Exception to the post-IUP curfew: Allow the x component of */
       /* diagonal moves, but only post-IUP.  DejaVu tries to adjust */
       /* diagonal stems like on `Z' and `z' post-IUP.               */
-      if ( SUBPIXEL_HINTING_MINIMAL && !exc->backward_compatibility )
-        zone->cur[point].x = ADD_LONG( zone->cur[point].x,
-                                       FT_MulDiv( distance,
-                                                  v,
-                                                  exc->F_dot_P ) );
-      else
+      if ( !exc->backward_compatibility )
 #endif
-
-      if ( NO_SUBPIXEL_HINTING )
         zone->cur[point].x = ADD_LONG( zone->cur[point].x,
-                                       FT_MulDiv( distance,
-                                                  v,
-                                                  exc->F_dot_P ) );
+                                       FT_MulFix( distance, v ) );
 
       zone->tags[point] |= FT_CURVE_TAG_TOUCH_X;
     }
 
-    v = exc->GS.freeVector.y;
-
+    v = exc->moveVector.y;
     if ( v != 0 )
     {
 #ifdef TT_SUPPORT_SUBPIXEL_HINTING_MINIMAL
-      if ( !( SUBPIXEL_HINTING_MINIMAL    &&
-              exc->backward_compatibility &&
-              exc->iupx_called            &&
-              exc->iupy_called            ) )
+      /* See `ttinterp.h' for details on backward compatibility mode. */
+      if ( exc->backward_compatibility != 0x7 )
 #endif
         zone->cur[point].y = ADD_LONG( zone->cur[point].y,
-                                       FT_MulDiv( distance,
-                                                  v,
-                                                  exc->F_dot_P ) );
+                                       FT_MulFix( distance, v ) );
 
       zone->tags[point] |= FT_CURVE_TAG_TOUCH_Y;
     }
@@ -1745,24 +1568,20 @@
                     FT_UShort       point,
                     FT_F26Dot6      distance )
   {
-    FT_F26Dot6  v;
+    FT_Fixed  v;
 
 
-    v = exc->GS.freeVector.x;
+    v = exc->moveVector.x;
 
     if ( v != 0 )
       zone->org[point].x = ADD_LONG( zone->org[point].x,
-                                     FT_MulDiv( distance,
-                                                v,
-                                                exc->F_dot_P ) );
+                                     FT_MulFix( distance, v ) );
 
-    v = exc->GS.freeVector.y;
+    v = exc->moveVector.y;
 
     if ( v != 0 )
       zone->org[point].y = ADD_LONG( zone->org[point].y,
-                                     FT_MulDiv( distance,
-                                                v,
-                                                exc->F_dot_P ) );
+                                     FT_MulFix( distance, v ) );
   }
 
 
@@ -1784,12 +1603,8 @@
                  FT_F26Dot6      distance )
   {
 #ifdef TT_SUPPORT_SUBPIXEL_HINTING_MINIMAL
-    if ( SUBPIXEL_HINTING_MINIMAL && !exc->backward_compatibility )
-      zone->cur[point].x = ADD_LONG( zone->cur[point].x, distance );
-    else
+    if ( !exc->backward_compatibility )
 #endif
-
-    if ( NO_SUBPIXEL_HINTING )
       zone->cur[point].x = ADD_LONG( zone->cur[point].x, distance );
 
     zone->tags[point]  |= FT_CURVE_TAG_TOUCH_X;
@@ -1805,9 +1620,8 @@
     FT_UNUSED( exc );
 
 #ifdef TT_SUPPORT_SUBPIXEL_HINTING_MINIMAL
-    if ( !( SUBPIXEL_HINTING_MINIMAL             &&
-            exc->backward_compatibility          &&
-            exc->iupx_called && exc->iupy_called ) )
+    /* See `ttinterp.h' for details on backward compatibility mode. */
+    if ( exc->backward_compatibility != 0x7 )
 #endif
       zone->cur[point].y = ADD_LONG( zone->cur[point].y, distance );
 
@@ -1860,8 +1674,8 @@
    *   distance ::
    *     The distance (not) to round.
    *
-   *   color ::
-   *     The engine compensation color.
+   *   compensation ::
+   *     The engine compensation.
    *
    * @Return:
    *   The compensated distance.
@@ -1869,10 +1683,10 @@
   static FT_F26Dot6
   Round_None( TT_ExecContext  exc,
               FT_F26Dot6      distance,
-              FT_Int          color )
+              FT_F26Dot6      compensation )
   {
-    FT_F26Dot6  compensation = exc->tt_metrics.compensations[color];
     FT_F26Dot6  val;
+    FT_UNUSED( exc );
 
 
     if ( distance >= 0 )
@@ -1903,8 +1717,8 @@
    *   distance ::
    *     The distance to round.
    *
-   *   color ::
-   *     The engine compensation color.
+   *   compensation ::
+   *     The engine compensation.
    *
    * @Return:
    *   Rounded distance.
@@ -1912,10 +1726,10 @@
   static FT_F26Dot6
   Round_To_Grid( TT_ExecContext  exc,
                  FT_F26Dot6      distance,
-                 FT_Int          color )
+                 FT_F26Dot6      compensation )
   {
-    FT_F26Dot6  compensation = exc->tt_metrics.compensations[color];
     FT_F26Dot6  val;
+    FT_UNUSED( exc );
 
 
     if ( distance >= 0 )
@@ -1948,8 +1762,8 @@
    *   distance ::
    *     The distance to round.
    *
-   *   color ::
-   *     The engine compensation color.
+   *   compensation ::
+   *     The engine compensation.
    *
    * @Return:
    *   Rounded distance.
@@ -1957,10 +1771,10 @@
   static FT_F26Dot6
   Round_To_Half_Grid( TT_ExecContext  exc,
                       FT_F26Dot6      distance,
-                      FT_Int          color )
+                      FT_F26Dot6      compensation )
   {
-    FT_F26Dot6  compensation = exc->tt_metrics.compensations[color];
     FT_F26Dot6  val;
+    FT_UNUSED( exc );
 
 
     if ( distance >= 0 )
@@ -1995,8 +1809,8 @@
    *   distance ::
    *     The distance to round.
    *
-   *   color ::
-   *     The engine compensation color.
+   *   compensation ::
+   *     The engine compensation.
    *
    * @Return:
    *   Rounded distance.
@@ -2004,10 +1818,10 @@
   static FT_F26Dot6
   Round_Down_To_Grid( TT_ExecContext  exc,
                       FT_F26Dot6      distance,
-                      FT_Int          color )
+                      FT_F26Dot6      compensation )
   {
-    FT_F26Dot6  compensation = exc->tt_metrics.compensations[color];
     FT_F26Dot6  val;
+    FT_UNUSED( exc );
 
 
     if ( distance >= 0 )
@@ -2039,8 +1853,8 @@
    *   distance ::
    *     The distance to round.
    *
-   *   color ::
-   *     The engine compensation color.
+   *   compensation ::
+   *     The engine compensation.
    *
    * @Return:
    *   Rounded distance.
@@ -2048,10 +1862,10 @@
   static FT_F26Dot6
   Round_Up_To_Grid( TT_ExecContext  exc,
                     FT_F26Dot6      distance,
-                    FT_Int          color )
+                    FT_F26Dot6      compensation )
   {
-    FT_F26Dot6  compensation = exc->tt_metrics.compensations[color];
     FT_F26Dot6  val;
+    FT_UNUSED( exc );
 
 
     if ( distance >= 0 )
@@ -2084,8 +1898,8 @@
    *   distance ::
    *     The distance to round.
    *
-   *   color ::
-   *     The engine compensation color.
+   *   compensation ::
+   *     The engine compensation.
    *
    * @Return:
    *   Rounded distance.
@@ -2093,10 +1907,10 @@
   static FT_F26Dot6
   Round_To_Double_Grid( TT_ExecContext  exc,
                         FT_F26Dot6      distance,
-                        FT_Int          color )
+                        FT_F26Dot6      compensation )
   {
-    FT_F26Dot6  compensation = exc->tt_metrics.compensations[color];
     FT_F26Dot6  val;
+    FT_UNUSED( exc );
 
 
     if ( distance >= 0 )
@@ -2129,8 +1943,8 @@
    *   distance ::
    *     The distance to round.
    *
-   *   color ::
-   *     The engine compensation color.
+   *   compensation ::
+   *     The engine compensation.
    *
    * @Return:
    *   Rounded distance.
@@ -2144,9 +1958,8 @@
   static FT_F26Dot6
   Round_Super( TT_ExecContext  exc,
                FT_F26Dot6      distance,
-               FT_Int          color )
+               FT_F26Dot6      compensation )
   {
-    FT_F26Dot6  compensation = exc->tt_metrics.compensations[color];
     FT_F26Dot6  val;
 
 
@@ -2185,8 +1998,8 @@
    *   distance ::
    *     The distance to round.
    *
-   *   color ::
-   *     The engine compensation color.
+   *   compensation ::
+   *     The engine compensation.
    *
    * @Return:
    *   Rounded distance.
@@ -2198,9 +2011,8 @@
   static FT_F26Dot6
   Round_Super_45( TT_ExecContext  exc,
                   FT_F26Dot6      distance,
-                  FT_Int          color )
+                  FT_F26Dot6      compensation )
   {
-    FT_F26Dot6  compensation = exc->tt_metrics.compensations[color];
     FT_F26Dot6  val;
 
 
@@ -2227,59 +2039,6 @@
   }
 
 
-  /**************************************************************************
-   *
-   * @Function:
-   *   Compute_Round
-   *
-   * @Description:
-   *   Sets the rounding mode.
-   *
-   * @Input:
-   *   round_mode ::
-   *     The rounding mode to be used.
-   */
-  static void
-  Compute_Round( TT_ExecContext  exc,
-                 FT_Byte         round_mode )
-  {
-    switch ( round_mode )
-    {
-    case TT_Round_Off:
-      exc->func_round = (TT_Round_Func)Round_None;
-      break;
-
-    case TT_Round_To_Grid:
-      exc->func_round = (TT_Round_Func)Round_To_Grid;
-      break;
-
-    case TT_Round_Up_To_Grid:
-      exc->func_round = (TT_Round_Func)Round_Up_To_Grid;
-      break;
-
-    case TT_Round_Down_To_Grid:
-      exc->func_round = (TT_Round_Func)Round_Down_To_Grid;
-      break;
-
-    case TT_Round_To_Half_Grid:
-      exc->func_round = (TT_Round_Func)Round_To_Half_Grid;
-      break;
-
-    case TT_Round_To_Double_Grid:
-      exc->func_round = (TT_Round_Func)Round_To_Double_Grid;
-      break;
-
-    case TT_Round_Super:
-      exc->func_round = (TT_Round_Func)Round_Super;
-      break;
-
-    case TT_Round_Super_45:
-      exc->func_round = (TT_Round_Func)Round_Super_45;
-      break;
-    }
-  }
-
-
   /**************************************************************************
    *
    * @Function:
@@ -2481,14 +2240,45 @@
   static void
   Compute_Funcs( TT_ExecContext  exc )
   {
-    if ( exc->GS.freeVector.x == 0x4000 )
-      exc->F_dot_P = exc->GS.projVector.x;
-    else if ( exc->GS.freeVector.y == 0x4000 )
-      exc->F_dot_P = exc->GS.projVector.y;
+    FT_Long  F_dot_P =
+             ( (FT_Long)exc->GS.projVector.x * exc->GS.freeVector.x +
+               (FT_Long)exc->GS.projVector.y * exc->GS.freeVector.y +
+               0x2000L ) >> 14;
+
+
+    if ( F_dot_P >= 0x3FFEL )
+    {
+      /* commonly collinear */
+      exc->moveVector.x = exc->GS.freeVector.x * 4;
+      exc->moveVector.y = exc->GS.freeVector.y * 4;
+    }
+    else if ( -0x400L < F_dot_P && F_dot_P < 0x400L )
+    {
+      /* prohibitively orthogonal */
+      exc->moveVector.x = 0;
+      exc->moveVector.y = 0;
+    }
     else
-      exc->F_dot_P =
-        ( (FT_Long)exc->GS.projVector.x * exc->GS.freeVector.x +
-          (FT_Long)exc->GS.projVector.y * exc->GS.freeVector.y ) >> 14;
+    {
+      exc->moveVector.x = exc->GS.freeVector.x * 0x10000L / F_dot_P;
+      exc->moveVector.y = exc->GS.freeVector.y * 0x10000L / F_dot_P;
+    }
+
+    if ( F_dot_P >= 0x3FFEL && exc->GS.freeVector.x == 0x4000 )
+    {
+      exc->func_move      = (TT_Move_Func)Direct_Move_X;
+      exc->func_move_orig = (TT_Move_Func)Direct_Move_Orig_X;
+    }
+    else if ( F_dot_P >= 0x3FFEL && exc->GS.freeVector.y == 0x4000 )
+    {
+      exc->func_move      = (TT_Move_Func)Direct_Move_Y;
+      exc->func_move_orig = (TT_Move_Func)Direct_Move_Orig_Y;
+    }
+    else
+    {
+      exc->func_move      = (TT_Move_Func)Direct_Move;
+      exc->func_move_orig = (TT_Move_Func)Direct_Move_Orig;
+    }
 
     if ( exc->GS.projVector.x == 0x4000 )
       exc->func_project = (TT_Project_Func)Project_x;
@@ -2504,29 +2294,6 @@
     else
       exc->func_dualproj = (TT_Project_Func)Dual_Project;
 
-    exc->func_move      = (TT_Move_Func)Direct_Move;
-    exc->func_move_orig = (TT_Move_Func)Direct_Move_Orig;
-
-    if ( exc->F_dot_P == 0x4000L )
-    {
-      if ( exc->GS.freeVector.x == 0x4000 )
-      {
-        exc->func_move      = (TT_Move_Func)Direct_Move_X;
-        exc->func_move_orig = (TT_Move_Func)Direct_Move_Orig_X;
-      }
-      else if ( exc->GS.freeVector.y == 0x4000 )
-      {
-        exc->func_move      = (TT_Move_Func)Direct_Move_Y;
-        exc->func_move_orig = (TT_Move_Func)Direct_Move_Orig_Y;
-      }
-    }
-
-    /* at small sizes, F_dot_P can become too small, resulting   */
-    /* in overflows and `spikes' in a number of glyphs like `w'. */
-
-    if ( FT_ABS( exc->F_dot_P ) < 0x400L )
-      exc->F_dot_P = 0x4000L;
-
     /* Disable cached aspect ratio */
     exc->tt_metrics.ratio = 0;
   }
@@ -2799,7 +2566,7 @@
   Ins_ODD( TT_ExecContext  exc,
            FT_Long*        args )
   {
-    args[0] = ( ( exc->func_round( exc, args[0], 3 ) & 127 ) == 64 );
+    args[0] = ( ( exc->func_round( exc, args[0], 0 ) & 64 ) == 64 );
   }
 
 
@@ -2813,7 +2580,7 @@
   Ins_EVEN( TT_ExecContext  exc,
             FT_Long*        args )
   {
-    args[0] = ( ( exc->func_round( exc, args[0], 3 ) & 127 ) == 0 );
+    args[0] = ( ( exc->func_round( exc, args[0], 0 ) & 64 ) == 0 );
   }
 
 
@@ -3020,7 +2787,7 @@
         FT_MEM_QRENEW_ARRAY( exc->glyfStorage,
                              exc->glyfStoreSize,
                              exc->storeSize );
-        exc->error  = error;
+        exc->error = error;
         if ( error )
           return;
 
@@ -3143,7 +2910,8 @@
   Ins_ROUND( TT_ExecContext  exc,
              FT_Long*        args )
   {
-    args[0] = exc->func_round( exc, args[0], exc->opcode & 3 );
+    args[0] = exc->func_round( exc, args[0],
+                               exc->GS.compensation[exc->opcode & 3] );
   }
 
 
@@ -3157,7 +2925,8 @@
   Ins_NROUND( TT_ExecContext  exc,
               FT_Long*        args )
   {
-    args[0] = Round_None( exc, args[0], exc->opcode & 3 );
+    args[0] = Round_None( exc, args[0],
+                          exc->GS.compensation[exc->opcode & 3] );
   }
 
 
@@ -3211,13 +2980,11 @@
     }
     else
     {
-      K = exc->stack[exc->args - L];
+      K = args[-L];
 
-      FT_ARRAY_MOVE( &exc->stack[exc->args - L    ],
-                     &exc->stack[exc->args - L + 1],
-                     ( L - 1 ) );
+      FT_ARRAY_MOVE( args - L, args - L + 1, L - 1 );
 
-      exc->stack[exc->args - 1] = K;
+      args[-1] = K;
     }
   }
 
@@ -3244,7 +3011,7 @@
       args[0] = 0;
     }
     else
-      args[0] = exc->stack[exc->args - L];
+      args[0] = args[-L];
   }
 
 
@@ -3314,8 +3081,7 @@
         exc->length = 2 - exc->length * exc->code[exc->IP + 1];
       }
 
-      if ( exc->IP + exc->length <= exc->codeSize )
-        return SUCCESS;
+      return SUCCESS;
     }
 
   Fail_Overflow:
@@ -3363,6 +3129,9 @@
         nIfs--;
         Out = FT_BOOL( nIfs == 0 );
         break;
+
+      default:
+        break;
       }
     } while ( Out == 0 );
   }
@@ -3396,6 +3165,9 @@
       case 0x59:    /* EIF */
         nIfs--;
         break;
+
+      default:
+        break;
       }
     } while ( nIfs != 0 );
   }
@@ -3439,7 +3211,7 @@
       return;
     }
 
-    exc->step_ins = FALSE;
+    exc->length = 0;
 
     if ( args[0] < 0 )
     {
@@ -3540,10 +3312,10 @@
       return;
     }
 
-    rec->range          = exc->curRange;
-    rec->opc            = (FT_UInt16)n;
-    rec->start          = exc->IP + 1;
-    rec->active         = TRUE;
+    rec->range  = exc->curRange;
+    rec->opc    = (FT_UInt16)n;
+    rec->start  = exc->IP + 1;
+    rec->active = TRUE;
 
     if ( n > exc->maxFunc )
       exc->maxFunc = (FT_UInt16)n;
@@ -3555,14 +3327,17 @@
     {
       switch ( exc->opcode )
       {
-      case 0x89:    /* IDEF */
-      case 0x2C:    /* FDEF */
+      case 0x89:   /* IDEF */
+      case 0x2C:   /* FDEF */
         exc->error = FT_THROW( Nested_DEFS );
         return;
 
       case 0x2D:   /* ENDF */
         rec->end = exc->IP;
         return;
+
+      default:
+        break;
       }
     }
   }
@@ -3592,12 +3367,11 @@
 
     pRec->Cur_Count--;
 
-    exc->step_ins = FALSE;
-
     if ( pRec->Cur_Count > 0 )
     {
       exc->callTop++;
-      exc->IP = pRec->Def->start;
+      exc->IP     = pRec->Def->start;
+      exc->length = 0;
     }
     else
       /* Loop through the current function */
@@ -3685,8 +3459,6 @@
 
     Ins_Goto_CodeRange( exc, def->range, def->start );
 
-    exc->step_ins = FALSE;
-
     return;
 
   Fail:
@@ -3764,8 +3536,6 @@
 
       Ins_Goto_CodeRange( exc, def->range, def->start );
 
-      exc->step_ins = FALSE;
-
       exc->loopcall_counter += (FT_ULong)args[0];
       if ( exc->loopcall_counter > exc->loopcall_counter_max )
         exc->error = FT_THROW( Execution_Too_Long );
@@ -3845,9 +3615,13 @@
       case 0x2C:   /* FDEF */
         exc->error = FT_THROW( Nested_DEFS );
         return;
+
       case 0x2D:   /* ENDF */
         def->end = exc->IP;
         return;
+
+      default:
+        break;
       }
     }
   }
@@ -3870,10 +3644,23 @@
   Ins_NPUSHB( TT_ExecContext  exc,
               FT_Long*        args )
   {
-    FT_UShort  L, K;
+    FT_Long  IP = exc->IP;
+    FT_Int   L, K;
 
 
-    L = (FT_UShort)exc->code[exc->IP + 1];
+    if ( ++IP >= exc->codeSize )
+    {
+      exc->error = FT_THROW( Code_Overflow );
+      return;
+    }
+
+    L = exc->code[IP];
+
+    if ( IP + L >= exc->codeSize )
+    {
+      exc->error = FT_THROW( Code_Overflow );
+      return;
+    }
 
     if ( BOUNDS( L, exc->stackSize + 1 - exc->top ) )
     {
@@ -3881,10 +3668,11 @@
       return;
     }
 
-    for ( K = 1; K <= L; K++ )
-      args[K - 1] = exc->code[exc->IP + K + 1];
+    for ( K = 0; K < L; K++ )
+      args[K] = exc->code[++IP];
 
     exc->new_top += L;
+    exc->IP       = IP;
   }
 
 
@@ -3898,10 +3686,23 @@
   Ins_NPUSHW( TT_ExecContext  exc,
               FT_Long*        args )
   {
-    FT_UShort  L, K;
+    FT_Long  IP = exc->IP;
+    FT_Int   L, K;
 
 
-    L = (FT_UShort)exc->code[exc->IP + 1];
+    if ( ++IP >= exc->codeSize )
+    {
+      exc->error = FT_THROW( Code_Overflow );
+      return;
+    }
+
+    L = exc->code[IP];
+
+    if ( IP + 2 * L >= exc->codeSize )
+    {
+      exc->error = FT_THROW( Code_Overflow );
+      return;
+    }
 
     if ( BOUNDS( L, exc->stackSize + 1 - exc->top ) )
     {
@@ -3909,13 +3710,12 @@
       return;
     }
 
-    exc->IP += 2;
+    /* note casting for sign-extension */
+    for ( K = 0; K < L; K++, IP += 2 )
+      args[K] = (FT_Short)( exc->code[IP + 1] << 8 ) | exc->code[IP + 2];
 
-    for ( K = 0; K < L; K++ )
-      args[K] = GetShortIns( exc );
-
-    exc->step_ins = FALSE;
     exc->new_top += L;
+    exc->IP       = IP;
   }
 
 
@@ -3929,10 +3729,17 @@
   Ins_PUSHB( TT_ExecContext  exc,
              FT_Long*        args )
   {
-    FT_UShort  L, K;
+    FT_Long  IP = exc->IP;
+    FT_Int   L, K;
 
 
-    L = (FT_UShort)( exc->opcode - 0xB0 + 1 );
+    L = exc->opcode - 0xB0 + 1;
+
+    if ( IP + L >= exc->codeSize )
+    {
+      exc->error = FT_THROW( Code_Overflow );
+      return;
+    }
 
     if ( BOUNDS( L, exc->stackSize + 1 - exc->top ) )
     {
@@ -3940,8 +3747,10 @@
       return;
     }
 
-    for ( K = 1; K <= L; K++ )
-      args[K - 1] = exc->code[exc->IP + K];
+    for ( K = 0; K < L; K++ )
+      args[K] = exc->code[++IP];
+
+    exc->IP = IP;
   }
 
 
@@ -3955,10 +3764,17 @@
   Ins_PUSHW( TT_ExecContext  exc,
              FT_Long*        args )
   {
-    FT_UShort  L, K;
+    FT_Long  IP = exc->IP;
+    FT_Int   L, K;
 
 
-    L = (FT_UShort)( exc->opcode - 0xB8 + 1 );
+    L = exc->opcode - 0xB8 + 1;
+
+    if ( IP + 2 * L >= exc->codeSize )
+    {
+      exc->error = FT_THROW( Code_Overflow );
+      return;
+    }
 
     if ( BOUNDS( L, exc->stackSize + 1 - exc->top ) )
     {
@@ -3966,12 +3782,11 @@
       return;
     }
 
-    exc->IP++;
+    /* note casting for sign-extension */
+    for ( K = 0; K < L; K++, IP += 2 )
+      args[K] = (FT_Short)( exc->code[IP + 1] << 8 ) | exc->code[IP + 2];
 
-    for ( K = 0; K < L; K++ )
-      args[K] = GetShortIns( exc );
-
-    exc->step_ins = FALSE;
+    exc->IP = IP;
   }
 
 
@@ -4142,15 +3957,12 @@
   Ins_SPVFS( TT_ExecContext  exc,
              FT_Long*        args )
   {
-    FT_Short  S;
     FT_Long   X, Y;
 
 
     /* Only use low 16bits, then sign extend */
-    S = (FT_Short)args[1];
-    Y = (FT_Long)S;
-    S = (FT_Short)args[0];
-    X = (FT_Long)S;
+    Y = (FT_Short)args[1];
+    X = (FT_Short)args[0];
 
     Normalize( X, Y, &exc->GS.projVector );
 
@@ -4169,15 +3981,12 @@
   Ins_SFVFS( TT_ExecContext  exc,
              FT_Long*        args )
   {
-    FT_Short  S;
     FT_Long   X, Y;
 
 
     /* Only use low 16bits, then sign extend */
-    S = (FT_Short)args[1];
-    Y = (FT_Long)S;
-    S = (FT_Short)args[0];
-    X = S;
+    Y = (FT_Short)args[1];
+    X = (FT_Short)args[0];
 
     Normalize( X, Y, &exc->GS.freeVector );
     Compute_Funcs( exc );
@@ -4915,7 +4724,7 @@
       /* compatibility hacks and lets them program points to the grid like */
       /* it's 1996.  They might sign a waiver for just one glyph, though.  */
       if ( SUBPIXEL_HINTING_MINIMAL )
-        exc->backward_compatibility = !FT_BOOL( L == 4 );
+        exc->backward_compatibility = ( L & 4 ) ^ 4;
 #endif
     }
     else if ( exc->pedantic_hinting )
@@ -4999,32 +4808,31 @@
    * Stack:        uint32... -->
    */
   static void
-  Ins_FLIPPT( TT_ExecContext  exc )
+  Ins_FLIPPT( TT_ExecContext  exc,
+              FT_Long*        args )
   {
+    FT_Long    loop = exc->GS.loop;
     FT_UShort  point;
 
 
-#ifdef TT_SUPPORT_SUBPIXEL_HINTING_MINIMAL
-    /* See `ttinterp.h' for details on backward compatibility mode. */
-    if ( SUBPIXEL_HINTING_MINIMAL    &&
-         exc->backward_compatibility &&
-         exc->iupx_called            &&
-         exc->iupy_called            )
-      goto Fail;
-#endif
-
-    if ( exc->top < exc->GS.loop )
+    if ( exc->new_top < loop )
     {
       if ( exc->pedantic_hinting )
         exc->error = FT_THROW( Too_Few_Arguments );
       goto Fail;
     }
 
-    while ( exc->GS.loop > 0 )
-    {
-      exc->args--;
+    exc->new_top -= loop;
 
-      point = (FT_UShort)exc->stack[exc->args];
+#ifdef TT_SUPPORT_SUBPIXEL_HINTING_MINIMAL
+    /* See `ttinterp.h' for details on backward compatibility mode. */
+    if ( exc->backward_compatibility == 0x7 )
+      goto Fail;
+#endif
+
+    while ( loop-- )
+    {
+      point = (FT_UShort)*(--args);
 
       if ( BOUNDS( point, exc->pts.n_points ) )
       {
@@ -5036,13 +4844,10 @@
       }
       else
         exc->pts.tags[point] ^= FT_CURVE_TAG_ON;
-
-      exc->GS.loop--;
     }
 
   Fail:
     exc->GS.loop = 1;
-    exc->new_top = exc->args;
   }
 
 
@@ -5061,10 +4866,7 @@
 
 #ifdef TT_SUPPORT_SUBPIXEL_HINTING_MINIMAL
     /* See `ttinterp.h' for details on backward compatibility mode. */
-    if ( SUBPIXEL_HINTING_MINIMAL    &&
-         exc->backward_compatibility &&
-         exc->iupx_called            &&
-         exc->iupy_called            )
+    if ( exc->backward_compatibility == 0x7 )
       return;
 #endif
 
@@ -5099,10 +4901,7 @@
 
 #ifdef TT_SUPPORT_SUBPIXEL_HINTING_MINIMAL
     /* See `ttinterp.h' for details on backward compatibility mode. */
-    if ( SUBPIXEL_HINTING_MINIMAL    &&
-         exc->backward_compatibility &&
-         exc->iupx_called            &&
-         exc->iupy_called            )
+    if ( exc->backward_compatibility == 0x7 )
       return;
 #endif
 
@@ -5158,8 +4957,8 @@
 
     d = PROJECT( zp.cur + p, zp.org + p );
 
-    *x = FT_MulDiv( d, (FT_Long)exc->GS.freeVector.x, exc->F_dot_P );
-    *y = FT_MulDiv( d, (FT_Long)exc->GS.freeVector.y, exc->F_dot_P );
+    *x = FT_MulFix( d, exc->moveVector.x );
+    *y = FT_MulFix( d, exc->moveVector.y );
 
     return SUCCESS;
   }
@@ -5176,8 +4975,8 @@
     if ( exc->GS.freeVector.x != 0 )
     {
 #ifdef TT_SUPPORT_SUBPIXEL_HINTING_MINIMAL
-      if ( !( SUBPIXEL_HINTING_MINIMAL    &&
-              exc->backward_compatibility ) )
+      /* See `ttinterp.h' for details on backward compatibility mode. */
+      if ( !exc->backward_compatibility )
 #endif
         exc->zp2.cur[point].x = ADD_LONG( exc->zp2.cur[point].x, dx );
 
@@ -5188,10 +4987,8 @@
     if ( exc->GS.freeVector.y != 0 )
     {
 #ifdef TT_SUPPORT_SUBPIXEL_HINTING_MINIMAL
-      if ( !( SUBPIXEL_HINTING_MINIMAL    &&
-              exc->backward_compatibility &&
-              exc->iupx_called            &&
-              exc->iupy_called            ) )
+      /* See `ttinterp.h' for details on backward compatibility mode. */
+      if ( exc->backward_compatibility != 0x7 )
 #endif
         exc->zp2.cur[point].y = ADD_LONG( exc->zp2.cur[point].y, dy );
 
@@ -5208,8 +5005,10 @@
    * Stack:        uint32... -->
    */
   static void
-  Ins_SHP( TT_ExecContext  exc )
+  Ins_SHP( TT_ExecContext  exc,
+           FT_Long*        args )
   {
+    FT_Long          loop = exc->GS.loop;
     TT_GlyphZoneRec  zp;
     FT_UShort        refp;
 
@@ -5217,20 +5016,21 @@
     FT_UShort        point;
 
 
-    if ( exc->top < exc->GS.loop )
+    if ( exc->new_top < loop )
     {
       if ( exc->pedantic_hinting )
-        exc->error = FT_THROW( Invalid_Reference );
+        exc->error = FT_THROW( Too_Few_Arguments );
       goto Fail;
     }
 
+    exc->new_top -= loop;
+
     if ( Compute_Point_Displacement( exc, &dx, &dy, &zp, &refp ) )
       return;
 
-    while ( exc->GS.loop > 0 )
+    while ( loop-- )
     {
-      exc->args--;
-      point = (FT_UShort)exc->stack[exc->args];
+      point = (FT_UShort)*(--args);
 
       if ( BOUNDS( point, exc->zp2.n_points ) )
       {
@@ -5242,13 +5042,10 @@
       }
       else
         Move_Zp2_Point( exc, point, dx, dy, TRUE );
-
-      exc->GS.loop--;
     }
 
   Fail:
     exc->GS.loop = 1;
-    exc->new_top = exc->args;
   }
 
 
@@ -5364,6 +5161,7 @@
   Ins_SHPIX( TT_ExecContext  exc,
              FT_Long*        args )
   {
+    FT_Long     loop = exc->GS.loop;
     FT_F26Dot6  dx, dy;
     FT_UShort   point;
 #ifdef TT_SUPPORT_SUBPIXEL_HINTING_MINIMAL
@@ -5373,22 +5171,21 @@
 #endif
 
 
-
-    if ( exc->top < exc->GS.loop + 1 )
+    if ( exc->new_top < loop )
     {
       if ( exc->pedantic_hinting )
-        exc->error = FT_THROW( Invalid_Reference );
+        exc->error = FT_THROW( Too_Few_Arguments );
       goto Fail;
     }
 
+    exc->new_top -= loop;
+
     dx = TT_MulFix14( args[0], exc->GS.freeVector.x );
     dy = TT_MulFix14( args[0], exc->GS.freeVector.y );
 
-    while ( exc->GS.loop > 0 )
+    while ( loop-- )
     {
-      exc->args--;
-
-      point = (FT_UShort)exc->stack[exc->args];
+      point = (FT_UShort)*(--args);
 
       if ( BOUNDS( point, exc->zp2.n_points ) )
       {
@@ -5400,8 +5197,7 @@
       }
       else
 #ifdef TT_SUPPORT_SUBPIXEL_HINTING_MINIMAL
-      if ( SUBPIXEL_HINTING_MINIMAL    &&
-           exc->backward_compatibility )
+      if ( exc->backward_compatibility )
       {
         /* Special case: allow SHPIX to move points in the twilight zone.  */
         /* Otherwise, treat SHPIX the same as DELTAP.  Unbreaks various    */
@@ -5409,7 +5205,7 @@
         /* that would glitch severely after calling ALIGNRP after a        */
         /* blocked SHPIX.                                                  */
         if ( in_twilight                                                ||
-             ( !( exc->iupx_called && exc->iupy_called )              &&
+             ( exc->backward_compatibility != 0x7                     &&
                ( ( exc->is_composite && exc->GS.freeVector.y != 0 ) ||
                  ( exc->zp2.tags[point] & FT_CURVE_TAG_TOUCH_Y )    ) ) )
           Move_Zp2_Point( exc, point, 0, dy, TRUE );
@@ -5417,13 +5213,10 @@
       else
 #endif
         Move_Zp2_Point( exc, point, dx, dy, TRUE );
-
-      exc->GS.loop--;
     }
 
   Fail:
     exc->GS.loop = 1;
-    exc->new_top = exc->args;
   }
 
 
@@ -5502,7 +5295,7 @@
     if ( ( exc->opcode & 1 ) != 0 )
     {
       cur_dist = FAST_PROJECT( &exc->zp0.cur[point] );
-      distance = SUB_LONG( exc->func_round( exc, cur_dist, 3 ), cur_dist );
+      distance = SUB_LONG( exc->func_round( exc, cur_dist, 0 ), cur_dist );
     }
     else
       distance = 0;
@@ -5566,7 +5359,7 @@
     if ( exc->GS.gep0 == 0 )   /* If in twilight zone */
     {
       exc->zp0.org[point].x = TT_MulFix14( distance,
-                                             exc->GS.freeVector.x );
+                                           exc->GS.freeVector.x );
       exc->zp0.org[point].y = TT_MulFix14( distance,
                                            exc->GS.freeVector.y );
       exc->zp0.cur[point]   = exc->zp0.org[point];
@@ -5587,7 +5380,7 @@
       if ( delta > control_value_cutin )
         distance = org_dist;
 
-      distance = exc->func_round( exc, distance, 3 );
+      distance = exc->func_round( exc, distance, 0 );
     }
 
     exc->func_move( exc, &exc->zp0, point, SUB_LONG( distance, org_dist ) );
@@ -5609,7 +5402,7 @@
             FT_Long*        args )
   {
     FT_UShort   point = 0;
-    FT_F26Dot6  org_dist, distance;
+    FT_F26Dot6  org_dist, distance, compensation;
 
 
     point = (FT_UShort)args[0];
@@ -5678,12 +5471,12 @@
 
     /* round flag */
 
+    compensation = exc->GS.compensation[exc->opcode & 3];
+
     if ( ( exc->opcode & 4 ) != 0 )
-    {
-      distance = exc->func_round( exc, org_dist, exc->opcode & 3 );
-    }
+      distance = exc->func_round( exc, org_dist, compensation );
     else
-      distance = Round_None( exc, org_dist, exc->opcode & 3 );
+      distance = Round_None( exc, org_dist, compensation );
 
     /* minimum distance flag */
 
@@ -5735,7 +5528,8 @@
     FT_F26Dot6  cvt_dist,
                 distance,
                 cur_dist,
-                org_dist;
+                org_dist,
+                compensation;
 
     FT_F26Dot6  delta;
 
@@ -5801,6 +5595,8 @@
 
     /* control value cut-in and round */
 
+    compensation = exc->GS.compensation[exc->opcode & 3];
+
     if ( ( exc->opcode & 4 ) != 0 )
     {
       /* XXX: UNDOCUMENTED!  Only perform cut-in test when both points */
@@ -5831,16 +5627,16 @@
           cvt_dist = org_dist;
       }
 
-      distance = exc->func_round( exc, cvt_dist, exc->opcode & 3 );
+      distance = exc->func_round( exc, cvt_dist, compensation );
     }
     else
-      distance = Round_None( exc, cvt_dist, exc->opcode & 3 );
+      distance = Round_None( exc, cvt_dist, compensation );
 
     /* minimum distance test */
 
     if ( ( exc->opcode & 8 ) != 0 )
     {
-      FT_F26Dot6  minimum_distance    = exc->GS.minimum_distance;
+      FT_F26Dot6  minimum_distance = exc->GS.minimum_distance;
 
 
       if ( org_dist >= 0 )
@@ -5862,11 +5658,10 @@
 
   Fail:
     exc->GS.rp1 = exc->GS.rp0;
+    exc->GS.rp2 = point;
 
     if ( ( exc->opcode & 16 ) != 0 )
       exc->GS.rp0 = point;
-
-    exc->GS.rp2 = point;
   }
 
 
@@ -5877,25 +5672,33 @@
    * Stack:        uint32 uint32... -->
    */
   static void
-  Ins_ALIGNRP( TT_ExecContext  exc )
+  Ins_ALIGNRP( TT_ExecContext  exc,
+               FT_Long*        args )
   {
+    FT_Long     loop = exc->GS.loop;
     FT_UShort   point;
     FT_F26Dot6  distance;
 
 
-    if ( exc->top < exc->GS.loop                  ||
-         BOUNDS( exc->GS.rp0, exc->zp0.n_points ) )
+    if ( exc->new_top < loop )
+    {
+      if ( exc->pedantic_hinting )
+        exc->error = FT_THROW( Too_Few_Arguments );
+      goto Fail;
+    }
+
+    exc->new_top -= loop;
+
+    if ( BOUNDS( exc->GS.rp0, exc->zp0.n_points ) )
     {
       if ( exc->pedantic_hinting )
         exc->error = FT_THROW( Invalid_Reference );
       goto Fail;
     }
 
-    while ( exc->GS.loop > 0 )
+    while ( loop-- )
     {
-      exc->args--;
-
-      point = (FT_UShort)exc->stack[exc->args];
+      point = (FT_UShort)*(--args);
 
       if ( BOUNDS( point, exc->zp1.n_points ) )
       {
@@ -5912,13 +5715,10 @@
 
         exc->func_move( exc, &exc->zp1, point, NEG_LONG( distance ) );
       }
-
-      exc->GS.loop--;
     }
 
   Fail:
     exc->GS.loop = 1;
-    exc->new_top = exc->args;
   }
 
 
@@ -6060,15 +5860,26 @@
   /* SOMETIMES, DUMBER CODE IS BETTER CODE */
 
   static void
-  Ins_IP( TT_ExecContext  exc )
+  Ins_IP( TT_ExecContext  exc,
+          FT_Long*        args )
   {
+    FT_Long     loop = exc->GS.loop;
     FT_F26Dot6  old_range, cur_range;
     FT_Vector*  orus_base;
     FT_Vector*  cur_base;
     FT_Int      twilight;
 
 
-    if ( exc->top < exc->GS.loop )
+    if ( exc->new_top < loop )
+    {
+      if ( exc->pedantic_hinting )
+        exc->error = FT_THROW( Too_Few_Arguments );
+      goto Fail;
+    }
+
+    exc->new_top -= loop;
+
+    if ( BOUNDS( exc->GS.rp1, exc->zp0.n_points ) )
     {
       if ( exc->pedantic_hinting )
         exc->error = FT_THROW( Invalid_Reference );
@@ -6084,13 +5895,6 @@
                  exc->GS.gep1 == 0 ||
                  exc->GS.gep2 == 0 );
 
-    if ( BOUNDS( exc->GS.rp1, exc->zp0.n_points ) )
-    {
-      if ( exc->pedantic_hinting )
-        exc->error = FT_THROW( Invalid_Reference );
-      goto Fail;
-    }
-
     if ( twilight )
       orus_base = &exc->zp0.org[exc->GS.rp1];
     else
@@ -6102,8 +5906,7 @@
     /*      fonts out there (e.g. [aeu]grave in monotype.ttf)   */
     /*      calling IP[] with bad values of rp[12].             */
     /*      Do something sane when this odd thing happens.      */
-    if ( BOUNDS( exc->GS.rp1, exc->zp0.n_points ) ||
-         BOUNDS( exc->GS.rp2, exc->zp1.n_points ) )
+    if ( BOUNDS( exc->GS.rp2, exc->zp1.n_points ) )
     {
       old_range = 0;
       cur_range = 0;
@@ -6132,9 +5935,9 @@
       cur_range = PROJECT( &exc->zp1.cur[exc->GS.rp2], cur_base );
     }
 
-    for ( ; exc->GS.loop > 0; exc->GS.loop-- )
+    while ( loop-- )
     {
-      FT_UInt     point = (FT_UInt)exc->stack[--exc->args];
+      FT_UInt     point = (FT_UInt)*(--args);
       FT_F26Dot6  org_dist, cur_dist, new_dist;
 
 
@@ -6206,7 +6009,6 @@
 
   Fail:
     exc->GS.loop = 1;
-    exc->new_top = exc->args;
   }
 
 
@@ -6405,17 +6207,10 @@
     /* See `ttinterp.h' for details on backward compatibility mode.  */
     /* Allow IUP until it has been called on both axes.  Immediately */
     /* return on subsequent ones.                                    */
-    if ( SUBPIXEL_HINTING_MINIMAL    &&
-         exc->backward_compatibility )
-    {
-      if ( exc->iupx_called && exc->iupy_called )
-        return;
-
-      if ( exc->opcode & 1 )
-        exc->iupx_called = TRUE;
-      else
-        exc->iupy_called = TRUE;
-    }
+    if ( exc->backward_compatibility == 0x7 )
+      return;
+    else if ( exc->backward_compatibility )
+      exc->backward_compatibility |= 1 << ( exc->opcode & 1 );
 #endif
 
     /* ignore empty outlines */
@@ -6507,30 +6302,50 @@
   Ins_DELTAP( TT_ExecContext  exc,
               FT_Long*        args )
   {
-    FT_ULong   nump, k;
+    FT_Long    nump;
     FT_UShort  A;
-    FT_ULong   C, P;
-    FT_Long    B;
+    FT_Long    B, P, F;
 
 
-    P    = (FT_ULong)exc->func_cur_ppem( exc );
-    nump = (FT_ULong)args[0];   /* some points theoretically may occur more
-                                   than once, thus UShort isn't enough */
+    nump = args[0];  /* signed value for convenience */
 
-    for ( k = 1; k <= nump; k++ )
+    if ( nump < 0 || nump > exc->new_top / 2 )
     {
-      if ( exc->args < 2 )
-      {
-        if ( exc->pedantic_hinting )
-          exc->error = FT_THROW( Too_Few_Arguments );
-        exc->args = 0;
-        goto Fail;
-      }
+      if ( exc->pedantic_hinting )
+        exc->error = FT_THROW( Too_Few_Arguments );
 
-      exc->args -= 2;
+      nump = exc->new_top / 2;
+    }
 
-      A = (FT_UShort)exc->stack[exc->args + 1];
-      B = exc->stack[exc->args];
+    exc->new_top -= 2 * nump;
+
+    P = exc->func_cur_ppem( exc ) - exc->GS.delta_base;
+
+    switch ( exc->opcode )
+    {
+    case 0x5D:
+      break;
+
+    case 0x71:
+      P -= 16;
+      break;
+
+    case 0x72:
+      P -= 32;
+      break;
+    }
+
+    /* check applicable range of adjusted ppem */
+    if ( P & ~0xF )         /* P < 0 || P > 15 */
+      return;
+
+    P <<= 4;
+    F   = 1L << ( 6 - exc->GS.delta_shift );
+
+    while ( nump-- )
+    {
+      A = (FT_UShort)*(--args);
+      B = *(--args);
 
       /* XXX: Because some popular fonts contain some invalid DeltaP */
       /*      instructions, we simply ignore them when the stacked   */
@@ -6538,41 +6353,28 @@
       /*      error.  As a delta instruction doesn't change a glyph  */
       /*      in great ways, this shouldn't be a problem.            */
 
-      if ( !BOUNDS( A, exc->zp0.n_points ) )
+      if ( BOUNDS( A, exc->zp0.n_points ) )
       {
-        C = ( (FT_ULong)B & 0xF0 ) >> 4;
-
-        switch ( exc->opcode )
+        if ( exc->pedantic_hinting )
         {
-        case 0x5D:
-          break;
-
-        case 0x71:
-          C += 16;
-          break;
-
-        case 0x72:
-          C += 32;
-          break;
+          exc->error = FT_THROW( Invalid_Reference );
+          return;
         }
-
-        C += exc->GS.delta_base;
-
-        if ( P == C )
+      }
+      else
+      {
+        if ( ( B & 0xF0 ) == P )
         {
-          B = ( (FT_ULong)B & 0xF ) - 8;
+          B = ( B & 0xF ) - 8;
           if ( B >= 0 )
             B++;
-          B *= 1L << ( 6 - exc->GS.delta_shift );
-
+          B *= F;
 
 #ifdef TT_SUPPORT_SUBPIXEL_HINTING_MINIMAL
-          /* See `ttinterp.h' for details on backward compatibility */
-          /* mode.                                                  */
-          if ( SUBPIXEL_HINTING_MINIMAL    &&
-               exc->backward_compatibility )
+          /* See `ttinterp.h' for details on backward compatibility mode. */
+          if ( exc->backward_compatibility )
           {
-            if ( !( exc->iupx_called && exc->iupy_called )              &&
+            if ( exc->backward_compatibility != 0x7                     &&
                  ( ( exc->is_composite && exc->GS.freeVector.y != 0 ) ||
                    ( exc->zp0.tags[A] & FT_CURVE_TAG_TOUCH_Y )        ) )
               exc->func_move( exc, &exc->zp0, A, B );
@@ -6582,13 +6384,7 @@
             exc->func_move( exc, &exc->zp0, A, B );
         }
       }
-      else
-        if ( exc->pedantic_hinting )
-          exc->error = FT_THROW( Invalid_Reference );
     }
-
-  Fail:
-    exc->new_top = exc->args;
   }
 
 
@@ -6602,28 +6398,50 @@
   Ins_DELTAC( TT_ExecContext  exc,
               FT_Long*        args )
   {
-    FT_ULong  nump, k;
-    FT_ULong  A, C, P;
-    FT_Long   B;
+    FT_Long   nump;
+    FT_ULong  A;
+    FT_Long   B, P, F;
 
 
-    P    = (FT_ULong)exc->func_cur_ppem( exc );
-    nump = (FT_ULong)args[0];
+    nump = args[0];  /* signed value for convenience */
 
-    for ( k = 1; k <= nump; k++ )
+    if ( nump < 0 || nump > exc->new_top / 2 )
     {
-      if ( exc->args < 2 )
-      {
-        if ( exc->pedantic_hinting )
-          exc->error = FT_THROW( Too_Few_Arguments );
-        exc->args = 0;
-        goto Fail;
-      }
+      if ( exc->pedantic_hinting )
+        exc->error = FT_THROW( Too_Few_Arguments );
 
-      exc->args -= 2;
+      nump = exc->new_top / 2;
+    }
 
-      A = (FT_ULong)exc->stack[exc->args + 1];
-      B = exc->stack[exc->args];
+    exc->new_top -= 2 * nump;
+
+    P = exc->func_cur_ppem( exc ) - exc->GS.delta_base;
+
+    switch ( exc->opcode )
+    {
+    case 0x73:
+      break;
+
+    case 0x74:
+      P -= 16;
+      break;
+
+    case 0x75:
+      P -= 32;
+      break;
+    }
+
+    /* check applicable range of adjusted ppem */
+    if ( P & ~0xF )         /* P < 0 || P > 15 */
+      return;
+
+    P <<= 4;
+    F   = 1L << ( 6 - exc->GS.delta_shift );
+
+    while ( nump-- )
+    {
+      A = (FT_ULong)*(--args);
+      B = *(--args);
 
       if ( BOUNDSL( A, exc->cvtSize ) )
       {
@@ -6635,38 +6453,17 @@
       }
       else
       {
-        C = ( (FT_ULong)B & 0xF0 ) >> 4;
-
-        switch ( exc->opcode )
+        if ( ( B & 0xF0 ) == P )
         {
-        case 0x73:
-          break;
-
-        case 0x74:
-          C += 16;
-          break;
-
-        case 0x75:
-          C += 32;
-          break;
-        }
-
-        C += exc->GS.delta_base;
-
-        if ( P == C )
-        {
-          B = ( (FT_ULong)B & 0xF ) - 8;
+          B = ( B & 0xF ) - 8;
           if ( B >= 0 )
             B++;
-          B *= 1L << ( 6 - exc->GS.delta_shift );
+          B *= F;
 
           exc->func_move_cvt( exc, A, B );
         }
       }
     }
-
-  Fail:
-    exc->new_top = exc->args;
   }
 
 
@@ -6736,7 +6533,7 @@
     /* Otherwise, instructions may behave weirdly and rendering results */
     /* may differ between v35 and v40 mode, e.g., in `Times New Roman   */
     /* Bold Italic'. */
-    if ( SUBPIXEL_HINTING_MINIMAL && exc->subpixel_hinting_lean )
+    if ( SUBPIXEL_HINTING_MINIMAL && exc->mode != FT_RENDER_MODE_MONO )
     {
       /*********************************
        * HINTING FOR SUBPIXEL
@@ -6753,7 +6550,7 @@
        * Selector Bit:  8
        * Return Bit(s): 15
        */
-      if ( ( args[0] & 256 ) != 0 && exc->vertical_lcd_lean )
+      if ( ( args[0] & 256 ) != 0 && exc->mode == FT_RENDER_MODE_LCD_V )
         K |= 1 << 15;
 
       /*********************************
@@ -6774,7 +6571,7 @@
        * The only smoothing method FreeType supports unless someone sets
        * FT_LOAD_TARGET_MONO.
        */
-      if ( ( args[0] & 2048 ) != 0 && exc->subpixel_hinting_lean )
+      if ( ( args[0] & 2048 ) != 0 && exc->mode != FT_RENDER_MODE_MONO )
         K |= 1 << 18;
 
       /*********************************
@@ -6786,7 +6583,10 @@
        * Grayscale rendering is what FreeType does anyway unless someone
        * sets FT_LOAD_TARGET_MONO or FT_LOAD_TARGET_LCD(_V)
        */
-      if ( ( args[0] & 4096 ) != 0 && exc->grayscale_cleartype )
+      if ( ( args[0] & 4096 ) != 0           &&
+           exc->mode != FT_RENDER_MODE_MONO  &&
+           exc->mode != FT_RENDER_MODE_LCD   &&
+           exc->mode != FT_RENDER_MODE_LCD_V )
         K |= 1 << 19;
     }
 #endif
@@ -6833,6 +6633,8 @@
       for ( i = 0; i < num_axes; i++ )
         args[i] = 0;
     }
+
+    exc->new_top += num_axes;
   }
 
 
@@ -6883,7 +6685,6 @@
 
         Ins_Goto_CodeRange( exc, def->range, def->start );
 
-        exc->step_ins = FALSE;
         return;
       }
     }
@@ -6928,96 +6729,22 @@
   TT_RunIns( void*  exec )
   {
     TT_ExecContext  exc = (TT_ExecContext)exec;
+    FT_ULong        ins_counter = 0;
 
-    FT_ULong   ins_counter = 0;  /* executed instructions counter */
-    FT_ULong   num_twilight_points;
-    FT_UShort  i;
-
-
-    /* We restrict the number of twilight points to a reasonable,     */
-    /* heuristic value to avoid slow execution of malformed bytecode. */
-    num_twilight_points = FT_MAX( 30,
-                                  2 * ( exc->pts.n_points + exc->cvtSize ) );
-    if ( exc->twilight.n_points > num_twilight_points )
-    {
-      if ( num_twilight_points > 0xFFFFU )
-        num_twilight_points = 0xFFFFU;
-
-      FT_TRACE5(( "TT_RunIns: Resetting number of twilight points\n" ));
-      FT_TRACE5(( "           from %d to the more reasonable value %ld\n",
-                  exc->twilight.n_points,
-                  num_twilight_points ));
-      exc->twilight.n_points = (FT_UShort)num_twilight_points;
-    }
-
-    /* Set up loop detectors.  We restrict the number of LOOPCALL loops */
-    /* and the number of JMPR, JROT, and JROF calls with a negative     */
-    /* argument to values that depend on various parameters like the    */
-    /* size of the CVT table or the number of points in the current     */
-    /* glyph (if applicable).                                           */
-    /*                                                                  */
-    /* The idea is that in real-world bytecode you either iterate over  */
-    /* all CVT entries (in the `prep' table), or over all points (or    */
-    /* contours, in the `glyf' table) of a glyph, and such iterations   */
-    /* don't happen very often.                                         */
-    exc->loopcall_counter = 0;
-    exc->neg_jump_counter = 0;
-
-    /* The maximum values are heuristic. */
-    if ( exc->pts.n_points )
-      exc->loopcall_counter_max = FT_MAX( 50,
-                                          10 * exc->pts.n_points ) +
-                                  FT_MAX( 50,
-                                          exc->cvtSize / 10 );
-    else
-      exc->loopcall_counter_max = 300 + 22 * exc->cvtSize;
-
-    /* as a protection against an unreasonable number of CVT entries  */
-    /* we assume at most 100 control values per glyph for the counter */
-    if ( exc->loopcall_counter_max >
-         100 * (FT_ULong)exc->face->root.num_glyphs )
-      exc->loopcall_counter_max = 100 * (FT_ULong)exc->face->root.num_glyphs;
-
-    FT_TRACE5(( "TT_RunIns: Limiting total number of loops in LOOPCALL"
-                " to %ld\n", exc->loopcall_counter_max ));
-
-    exc->neg_jump_counter_max = exc->loopcall_counter_max;
-    FT_TRACE5(( "TT_RunIns: Limiting total number of backward jumps"
-                " to %ld\n", exc->neg_jump_counter_max ));
-
-    /* set PPEM and CVT functions */
-    exc->tt_metrics.ratio = 0;
-    if ( exc->metrics.x_ppem != exc->metrics.y_ppem )
-    {
-      /* non-square pixels, use the stretched routines */
-      exc->func_cur_ppem  = Current_Ppem_Stretched;
-      exc->func_read_cvt  = Read_CVT_Stretched;
-      exc->func_write_cvt = Write_CVT_Stretched;
-      exc->func_move_cvt  = Move_CVT_Stretched;
-    }
-    else
-    {
-      /* square pixels, use normal routines */
-      exc->func_cur_ppem  = Current_Ppem;
-      exc->func_read_cvt  = Read_CVT;
-      exc->func_write_cvt = Write_CVT;
-      exc->func_move_cvt  = Move_CVT;
-    }
-
-    exc->iniRange    = exc->curRange;
-
-    Compute_Funcs( exc );
-    Compute_Round( exc, (FT_Byte)exc->GS.round_state );
-
-    /* These flags cancel execution of some opcodes after IUP is called */
-#ifdef TT_SUPPORT_SUBPIXEL_HINTING_MINIMAL
-    exc->iupx_called = FALSE;
-    exc->iupy_called = FALSE;
-#endif
 
     do
     {
+      /* increment instruction counter and check if we didn't */
+      /* run this program for too long (e.g. infinite loops). */
+      if ( ++ins_counter > TT_CONFIG_OPTION_MAX_RUNNABLE_OPCODES )
+      {
+        exc->error = FT_THROW( Execution_Too_Long );
+        goto LErrorLabel_;
+      }
+
+      exc->error  = FT_Err_Ok;
       exc->opcode = exc->code[exc->IP];
+      exc->length = 1;
 
 #ifdef FT_DEBUG_LEVEL_TRACE
       if ( ft_trace_levels[trace_ttinterp] >= 6 )
@@ -7041,17 +6768,6 @@
       }
 #endif /* FT_DEBUG_LEVEL_TRACE */
 
-      if ( ( exc->length = opcode_length[exc->opcode] ) < 0 )
-      {
-        if ( exc->IP + 1 >= exc->codeSize )
-          goto LErrorCodeOverflow_;
-
-        exc->length = 2 - exc->length * exc->code[exc->IP + 1];
-      }
-
-      if ( exc->IP + exc->length > exc->codeSize )
-        goto LErrorCodeOverflow_;
-
       /* First, let's check for empty stack and overflow */
       exc->args = exc->top - ( Pop_Push_Count[exc->opcode] >> 4 );
 
@@ -7059,6 +6775,9 @@
       /* One can also interpret it as the index of the last argument.    */
       if ( exc->args < 0 )
       {
+        FT_UShort  i;
+
+
         if ( exc->pedantic_hinting )
         {
           exc->error = FT_THROW( Too_Few_Arguments );
@@ -7071,21 +6790,7 @@
         exc->args = 0;
       }
 
-#ifdef TT_CONFIG_OPTION_GX_VAR_SUPPORT
-      if ( exc->opcode == 0x91 )
-      {
-        /* this is very special: GETVARIATION returns */
-        /* a variable number of arguments             */
-
-        /* it is the job of the application to `activate' GX handling, */
-        /* that is, calling any of the GX API functions on the current */
-        /* font to select a variation instance                         */
-        if ( exc->face->blend )
-          exc->new_top = exc->args + exc->face->blend->num_axis;
-      }
-      else
-#endif
-        exc->new_top = exc->args + ( Pop_Push_Count[exc->opcode] & 15 );
+      exc->new_top = exc->args + ( Pop_Push_Count[exc->opcode] & 15 );
 
       /* `new_top' is the new top of the stack, after the instruction's */
       /* execution.  `top' will be set to `new_top' after the `switch'  */
@@ -7096,9 +6801,6 @@
         goto LErrorLabel_;
       }
 
-      exc->step_ins = TRUE;
-      exc->error    = FT_Err_Ok;
-
       {
         FT_Long*  args   = exc->stack + exc->args;
         FT_Byte   opcode = exc->opcode;
@@ -7281,7 +6983,7 @@
 
         case 0x32:  /* SHP */
         case 0x33:  /* SHP */
-          Ins_SHP( exc );
+          Ins_SHP( exc, args );
           break;
 
         case 0x34:  /* SHC */
@@ -7299,7 +7001,7 @@
           break;
 
         case 0x39:  /* IP    */
-          Ins_IP( exc );
+          Ins_IP( exc, args );
           break;
 
         case 0x3A:  /* MSIRP */
@@ -7308,7 +7010,7 @@
           break;
 
         case 0x3C:  /* AlignRP */
-          Ins_ALIGNRP( exc );
+          Ins_ALIGNRP( exc, args );
           break;
 
         case 0x3D:  /* RTDG */
@@ -7544,7 +7246,7 @@
           break;
 
         case 0x80:  /* FLIPPT */
-          Ins_FLIPPT( exc );
+          Ins_FLIPPT( exc, args );
           break;
 
         case 0x81:  /* FLIPRGON */
@@ -7642,13 +7344,13 @@
       {
         switch ( exc->error )
         {
-          /* looking for redefined instructions */
         case FT_ERR( Invalid_Opcode ):
           {
             TT_DefRecord*  def   = exc->IDefs;
             TT_DefRecord*  limit = FT_OFFSET( def, exc->numIDefs );
 
 
+            /* looking for redefined instructions */
             for ( ; def < limit; def++ )
             {
               if ( def->active && exc->opcode == (FT_Byte)def->opc )
@@ -7678,37 +7380,15 @@
               }
             }
           }
-
-          exc->error = FT_THROW( Invalid_Opcode );
-          goto LErrorLabel_;
-
-#if 0
-          break;   /* Unreachable code warning suppression.             */
-                   /* Leave to remind in case a later change the editor */
-                   /* to consider break;                                */
-#endif
+          FALL_THROUGH;
 
         default:
           goto LErrorLabel_;
-
-#if 0
-        break;
-#endif
         }
       }
 
       exc->top = exc->new_top;
-
-      if ( exc->step_ins )
-        exc->IP += exc->length;
-
-      /* increment instruction counter and check if we didn't */
-      /* run this program for too long (e.g. infinite loops). */
-      if ( ++ins_counter > TT_CONFIG_OPTION_MAX_RUNNABLE_OPCODES )
-      {
-        exc->error = FT_THROW( Execution_Too_Long );
-        goto LErrorLabel_;
-      }
+      exc->IP += exc->length;
 
     LSuiteLabel_:
       if ( exc->IP >= exc->codeSize )
@@ -7724,15 +7404,12 @@
     } while ( !exc->instruction_trap );
 
   LNo_Error_:
-    FT_TRACE4(( "  %ld instruction%s executed\n",
+    FT_TRACE4(( "  %lu instruction%s executed\n",
                 ins_counter,
                 ins_counter == 1 ? "" : "s" ));
 
     return FT_Err_Ok;
 
-  LErrorCodeOverflow_:
-    exc->error = FT_THROW( Code_Overflow );
-
   LErrorLabel_:
     if ( exc->error && !exc->instruction_trap )
       FT_TRACE1(( "  The interpreter returned error 0x%x\n", exc->error ));
@@ -7740,6 +7417,126 @@
     return exc->error;
   }
 
+
+  /**************************************************************************
+   *
+   * @Function:
+   *   TT_Run_Context
+   *
+   * @Description:
+   *   Executes one or more instructions in the execution context.
+   *
+   * @Input:
+   *   exec ::
+   *     A handle to the target execution context.
+   *
+   * @Return:
+   *   TrueType error code.  0 means success.
+   */
+  FT_LOCAL_DEF( FT_Error )
+  TT_Run_Context( TT_ExecContext  exec,
+                  TT_Size         size )
+  {
+    FT_ULong   num_twilight_points;
+
+
+    exec->zp0 = exec->pts;
+    exec->zp1 = exec->pts;
+    exec->zp2 = exec->pts;
+
+    /* We restrict the number of twilight points to a reasonable,     */
+    /* heuristic value to avoid slow execution of malformed bytecode. */
+    /* The selected value is large enough to support fonts hinted     */
+    /* with `ttfautohint`, which uses twilight points to store        */
+    /* vertical coordinates of (auto-hinter) segments.                */
+    num_twilight_points = FT_MAX( 30,
+                                  2 * ( exec->pts.n_points + exec->cvtSize ) );
+    if ( exec->twilight.n_points > num_twilight_points )
+    {
+      if ( num_twilight_points > 0xFFFFU )
+        num_twilight_points = 0xFFFFU;
+
+      FT_TRACE5(( "TT_RunIns: Resetting number of twilight points\n" ));
+      FT_TRACE5(( "           from %d to the more reasonable value %lu\n",
+                  exec->twilight.n_points,
+                  num_twilight_points ));
+      exec->twilight.n_points = (FT_UShort)num_twilight_points;
+    }
+
+    /* Set up loop detectors.  We restrict the number of LOOPCALL loops */
+    /* and the number of JMPR, JROT, and JROF calls with a negative     */
+    /* argument to values that depend on various parameters like the    */
+    /* size of the CVT table or the number of points in the current     */
+    /* glyph (if applicable).                                           */
+    /*                                                                  */
+    /* The idea is that in real-world bytecode you either iterate over  */
+    /* all CVT entries (in the `prep' table), or over all points (or    */
+    /* contours, in the `glyf' table) of a glyph, and such iterations   */
+    /* don't happen very often.                                         */
+    exec->loopcall_counter = 0;
+    exec->neg_jump_counter = 0;
+
+    /* The maximum values are heuristic. */
+    if ( exec->pts.n_points )
+      exec->loopcall_counter_max = FT_MAX( 50,
+                                           10 * exec->pts.n_points ) +
+                                   FT_MAX( 50,
+                                           exec->cvtSize / 10 );
+    else
+      exec->loopcall_counter_max = 300 + 22 * exec->cvtSize;
+
+    /* as a protection against an unreasonable number of CVT entries  */
+    /* we assume at most 100 control values per glyph for the counter */
+    if ( exec->loopcall_counter_max >
+         100 * (FT_ULong)exec->face->root.num_glyphs )
+      exec->loopcall_counter_max = 100 * (FT_ULong)exec->face->root.num_glyphs;
+
+    FT_TRACE5(( "TT_RunIns: Limiting total number of loops in LOOPCALL"
+                " to %lu\n", exec->loopcall_counter_max ));
+
+    exec->neg_jump_counter_max = exec->loopcall_counter_max;
+    FT_TRACE5(( "TT_RunIns: Limiting total number of backward jumps"
+                " to %lu\n", exec->neg_jump_counter_max ));
+
+    /* set PPEM and CVT functions */
+    if ( exec->metrics.x_ppem != exec->metrics.y_ppem )
+    {
+      /* non-square pixels, use the stretched routines */
+      exec->func_cur_ppem  = Current_Ppem_Stretched;
+      exec->func_read_cvt  = Read_CVT_Stretched;
+      exec->func_write_cvt = Write_CVT_Stretched;
+      exec->func_move_cvt  = Move_CVT_Stretched;
+    }
+    else
+    {
+      /* square pixels, use normal routines */
+      exec->func_cur_ppem  = Current_Ppem;
+      exec->func_read_cvt  = Read_CVT;
+      exec->func_write_cvt = Write_CVT;
+      exec->func_move_cvt  = Move_CVT;
+    }
+
+    /* reset graphics state */
+    exec->GS         = size->GS;
+    exec->func_round = (TT_Round_Func)Round_To_Grid;
+    Compute_Funcs( exec );
+
+#ifdef TT_SUPPORT_SUBPIXEL_HINTING_MINIMAL
+    /* Reset IUP tracking bits in the backward compatibility mode. */
+    /* See `ttinterp.h' for details.                               */
+    exec->backward_compatibility &= ~0x3;
+#endif
+
+    /* some glyphs leave something on the stack, */
+    /* so we clean it before a new execution.    */
+    exec->top     = 0;
+    exec->callTop = 0;
+
+    exec->instruction_trap = FALSE;
+
+    return exec->interpreter( exec );
+  }
+
 #else /* !TT_USE_BYTECODE_INTERPRETER */
 
   /* ANSI C doesn't like empty source files */
diff --git a/src/java.desktop/share/native/libfreetype/src/truetype/ttinterp.h b/src/java.desktop/share/native/libfreetype/src/truetype/ttinterp.h
index 4f1a9bbc679..2e69d191890 100644
--- a/src/java.desktop/share/native/libfreetype/src/truetype/ttinterp.h
+++ b/src/java.desktop/share/native/libfreetype/src/truetype/ttinterp.h
@@ -4,7 +4,7 @@
  *
  *   TrueType bytecode interpreter (specification).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
@@ -39,6 +39,60 @@ FT_BEGIN_HEADER
 #define TT_Round_Super_45        7
 
 
+  /**************************************************************************
+   *
+   * EXECUTION SUBTABLES
+   *
+   * These sub-tables relate to instruction execution.
+   *
+   */
+
+
+#define TT_MAX_CODE_RANGES  3
+
+
+  /**************************************************************************
+   *
+   * There can only be 3 active code ranges at once:
+   *   - the Font Program
+   *   - the CVT Program
+   *   - a glyph's instructions set
+   */
+  typedef enum  TT_CodeRange_Tag_
+  {
+    tt_coderange_none = 0,
+    tt_coderange_font,
+    tt_coderange_cvt,
+    tt_coderange_glyph
+
+  } TT_CodeRange_Tag;
+
+
+  typedef struct  TT_CodeRange_
+  {
+    FT_Byte*  base;
+    FT_Long   size;
+
+  } TT_CodeRange;
+
+  typedef TT_CodeRange  TT_CodeRangeTable[TT_MAX_CODE_RANGES];
+
+
+  /**************************************************************************
+   *
+   * Defines a function/instruction definition record.
+   */
+  typedef struct  TT_DefRecord_
+  {
+    FT_Int    range;          /* in which code range is it located?     */
+    FT_Long   start;          /* where does it start?                   */
+    FT_Long   end;            /* where does it end?                     */
+    FT_UInt   opc;            /* function #, or instruction code        */
+    FT_Bool   active;         /* is it active?                          */
+
+  } TT_DefRecord, *TT_DefArray;
+
+
   /**************************************************************************
    *
    * Function types used by the interpreter, depending on various modes
@@ -51,7 +105,7 @@ FT_BEGIN_HEADER
   typedef FT_F26Dot6
   (*TT_Round_Func)( TT_ExecContext  exc,
                     FT_F26Dot6      distance,
-                    FT_Int          color );
+                    FT_F26Dot6      compensation );
 
   /* Point displacement along the freedom vector routine */
   typedef void
@@ -111,12 +165,13 @@ FT_BEGIN_HEADER
     TT_Face            face;       /* ! */
     TT_Size            size;       /* ! */
     FT_Memory          memory;
+    TT_Interpreter     interpreter;
 
     /* instructions state */
 
     FT_Error           error;      /* last execution error */
 
-    FT_Long            top;        /* @ top of exec. stack */
+    FT_Long            top;        /* @! top of exec. stack */
 
     FT_Long            stackSize;  /* ! size of exec. stack */
     FT_Long*           stack;      /* ! current exec. stack */
@@ -142,11 +197,9 @@ FT_BEGIN_HEADER
     FT_Long            IP;        /* current instruction pointer */
     FT_Long            codeSize;  /* size of current range       */
 
-    FT_Byte            opcode;    /* current opcode              */
-    FT_Int             length;    /* length of current opcode    */
+    FT_Byte            opcode;    /* current opcode             */
+    FT_Int             length;    /* opcode length or increment */
 
-    FT_Bool            step_ins;  /* true if the interpreter must */
-                                  /* increment IP after ins. exec */
     FT_ULong           cvtSize;   /* ! */
     FT_Long*           cvt;       /* ! */
     FT_ULong           glyfCvtSize;
@@ -166,9 +219,9 @@ FT_BEGIN_HEADER
     FT_UInt            maxFunc;   /* ! maximum function index    */
     FT_UInt            maxIns;    /* ! maximum instruction index */
 
-    FT_Int             callTop,    /* @ top of call stack during execution */
-                       callSize;   /*   size of call stack                 */
-    TT_CallStack       callStack;  /*   call stack                         */
+    FT_Int             callTop,    /* @! top of call stack during execution */
+                       callSize;   /*    size of call stack                 */
+    TT_CallStack       callStack;  /*    call stack                         */
 
     FT_UShort          maxPoints;    /* capacity of this context's `pts' */
     FT_Short           maxContours;  /* record, expressed in points and  */
@@ -189,16 +242,14 @@ FT_BEGIN_HEADER
     FT_Bool            instruction_trap; /* ! If `True', the interpreter   */
                                          /*   exits after each instruction */
 
-    TT_GraphicsState   default_GS;       /* graphics state resulting from   */
-                                         /* the prep program                */
     FT_Bool            is_composite;     /* true if the glyph is composite  */
     FT_Bool            pedantic_hinting; /* true if pedantic interpretation */
 
     /* latest interpreter additions */
 
-    FT_Long            F_dot_P;    /* dot product of freedom and projection */
-                                   /* vectors                               */
-    TT_Round_Func      func_round; /* current rounding function             */
+    TT_Round_Func      func_round;     /* current rounding function   */
+
+    FT_Vector          moveVector;     /* "projected" freedom vector  */
 
     TT_Project_Func    func_project,   /* current projection function */
                        func_dualproj,  /* current dual proj. function */
@@ -327,34 +378,13 @@ FT_BEGIN_HEADER
      *
      */
 
-    /* Using v40 implies subpixel hinting, unless FT_RENDER_MODE_MONO has been
-     * requested.  Used to detect interpreter */
-    /* version switches.  `_lean' to differentiate from the Infinality */
-    /* `subpixel_hinting', which is managed differently.               */
-    FT_Bool            subpixel_hinting_lean;
+    /* Activate backward compatibility (bit 2) and track IUP (bits 0-1). */
+    /* If this is zero, it means that the interpreter is either in v35   */
+    /* or in native ClearType mode.                                      */
+    FT_Int             backward_compatibility;
 
-    /* Long side of a LCD subpixel is vertical (e.g., screen is rotated). */
-    /* `_lean' to differentiate from the Infinality `vertical_lcd', which */
-    /* is managed differently.                                            */
-    FT_Bool            vertical_lcd_lean;
+    FT_Render_Mode     mode;  /* target render mode */
 
-    /* Default to backward compatibility mode in v40 interpreter.  If   */
-    /* this is false, it implies the interpreter is in v35 or in native */
-    /* ClearType mode.                                                  */
-    FT_Bool            backward_compatibility;
-
-    /* Useful for detecting and denying post-IUP trickery that is usually */
-    /* used to fix pixel patterns (`superhinting').                       */
-    FT_Bool            iupx_called;
-    FT_Bool            iupy_called;
-
-    /* ClearType hinting and grayscale rendering, as used by Universal */
-    /* Windows Platform apps (Windows 8 and above).  Like the standard */
-    /* colorful ClearType mode, it utilizes a vastly increased virtual */
-    /* resolution on the x axis.  Different from bi-level hinting and  */
-    /* grayscale rendering, the old mode from Win9x days that roughly  */
-    /* adheres to the physical pixel grid on both axes.                */
-    FT_Bool            grayscale_cleartype;
 #endif /* TT_SUPPORT_SUBPIXEL_HINTING_MINIMAL */
 
     /* We maintain two counters (in addition to the instruction counter) */
@@ -371,22 +401,15 @@ FT_BEGIN_HEADER
   extern const TT_GraphicsState  tt_default_graphics_state;
 
 
-#ifdef TT_USE_BYTECODE_INTERPRETER
-  FT_LOCAL( void )
-  TT_Goto_CodeRange( TT_ExecContext  exec,
-                     FT_Int          range,
-                     FT_Long         IP );
-
   FT_LOCAL( void )
   TT_Set_CodeRange( TT_ExecContext  exec,
                     FT_Int          range,
-                    void*           base,
+                    FT_Byte*        base,
                     FT_Long         length );
 
   FT_LOCAL( void )
   TT_Clear_CodeRange( TT_ExecContext  exec,
                       FT_Int          range );
-#endif /* TT_USE_BYTECODE_INTERPRETER */
 
 
   /**************************************************************************
@@ -413,7 +436,6 @@ FT_BEGIN_HEADER
   TT_New_Context( TT_Driver  driver );
 
 
-#ifdef TT_USE_BYTECODE_INTERPRETER
   FT_LOCAL( void )
   TT_Done_Context( TT_ExecContext  exec );
 
@@ -424,11 +446,11 @@ FT_BEGIN_HEADER
 
   FT_LOCAL( void )
   TT_Save_Context( TT_ExecContext  exec,
-                   TT_Size         ins );
+                   TT_Size         size );
 
   FT_LOCAL( FT_Error )
-  TT_Run_Context( TT_ExecContext  exec );
-#endif /* TT_USE_BYTECODE_INTERPRETER */
+  TT_Run_Context( TT_ExecContext  exec,
+                  TT_Size         size );
 
 
   /**************************************************************************
diff --git a/src/java.desktop/share/native/libfreetype/src/truetype/ttobjs.c b/src/java.desktop/share/native/libfreetype/src/truetype/ttobjs.c
index d0ac3181204..fd0c0ad14f6 100644
--- a/src/java.desktop/share/native/libfreetype/src/truetype/ttobjs.c
+++ b/src/java.desktop/share/native/libfreetype/src/truetype/ttobjs.c
@@ -4,7 +4,7 @@
  *
  *   Objects manager (body).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
@@ -67,23 +67,13 @@
    *     A pointer to the target glyph zone.
    */
   FT_LOCAL_DEF( void )
-  tt_glyphzone_done( TT_GlyphZone  zone )
+  tt_glyphzone_done( FT_Memory     memory,
+                     TT_GlyphZone  zone )
   {
-    FT_Memory  memory = zone->memory;
+    FT_FREE( zone->org );
 
-
-    if ( memory )
-    {
-      FT_FREE( zone->contours );
-      FT_FREE( zone->tags );
-      FT_FREE( zone->cur );
-      FT_FREE( zone->org );
-      FT_FREE( zone->orus );
-
-      zone->max_points   = zone->n_points   = 0;
-      zone->max_contours = zone->n_contours = 0;
-      zone->memory       = NULL;
-    }
+    zone->n_points   = 0;
+    zone->n_contours = 0;
   }
 
 
@@ -119,23 +109,22 @@
                     TT_GlyphZone  zone )
   {
     FT_Error  error;
+    FT_Long   size = 3 * maxPoints * sizeof ( FT_Vector ) +
+                       maxContours * sizeof ( FT_UShort ) +
+                         maxPoints * sizeof ( FT_Byte );
 
 
-    FT_ZERO( zone );
-    zone->memory = memory;
-
-    if ( FT_NEW_ARRAY( zone->org,      maxPoints   ) ||
-         FT_NEW_ARRAY( zone->cur,      maxPoints   ) ||
-         FT_NEW_ARRAY( zone->orus,     maxPoints   ) ||
-         FT_NEW_ARRAY( zone->tags,     maxPoints   ) ||
-         FT_NEW_ARRAY( zone->contours, maxContours ) )
+    if ( !FT_ALLOC( zone->org, size ) )
     {
-      tt_glyphzone_done( zone );
-    }
-    else
-    {
-      zone->max_points   = maxPoints;
-      zone->max_contours = maxContours;
+      zone->n_points   = maxPoints;
+      zone->n_contours = maxContours;
+
+      zone->cur      =               zone->org      + maxPoints;
+      zone->orus     =               zone->cur      + maxPoints;
+      zone->contours = (FT_UShort*)( zone->orus     + maxPoints );
+      zone->tags     =   (FT_Byte*)( zone->contours + maxContours );
+
+      zone->first_point = 0;
     }
 
     return error;
@@ -488,8 +477,7 @@
     int        j, k;
 
 
-    FT_MEM_SET( num_matched_ids, 0,
-                sizeof ( int ) * TRICK_SFNT_IDS_NUM_FACES );
+    FT_ARRAY_ZERO( num_matched_ids, TRICK_SFNT_IDS_NUM_FACES );
     has_cvt  = FALSE;
     has_fpgm = FALSE;
     has_prep = FALSE;
@@ -787,7 +775,7 @@
       FT_UInt  instance_index = (FT_UInt)face_index >> 16;
 
 
-      if ( FT_HAS_MULTIPLE_MASTERS( ttface ) )
+      if ( instance_index && FT_HAS_MULTIPLE_MASTERS( ttface ) )
       {
         error = FT_Set_Named_Instance( ttface, instance_index );
         if ( error )
@@ -885,75 +873,40 @@
    *   size ::
    *     A handle to the size object.
    *
-   *   pedantic ::
-   *     Set if bytecode execution should be pedantic.
-   *
    * @Return:
    *   FreeType error code.  0 means success.
    */
   FT_LOCAL_DEF( FT_Error )
-  tt_size_run_fpgm( TT_Size  size,
-                    FT_Bool  pedantic )
+  tt_size_run_fpgm( TT_Size  size )
   {
     TT_Face         face = (TT_Face)size->root.face;
-    TT_ExecContext  exec;
+    TT_ExecContext  exec = size->context;
     FT_Error        error;
 
 
-    exec = size->context;
-
     error = TT_Load_Context( exec, face, size );
     if ( error )
       return error;
 
-    exec->callTop = 0;
-    exec->top     = 0;
-
-    exec->period    = 64;
-    exec->phase     = 0;
-    exec->threshold = 0;
-
-    exec->instruction_trap = FALSE;
-    exec->F_dot_P          = 0x4000L;
-
-    exec->pedantic_hinting = pedantic;
-
-    {
-      FT_Size_Metrics*  size_metrics = &exec->metrics;
-      TT_Size_Metrics*  tt_metrics   = &exec->tt_metrics;
-
-
-      size_metrics->x_ppem   = 0;
-      size_metrics->y_ppem   = 0;
-      size_metrics->x_scale  = 0;
-      size_metrics->y_scale  = 0;
-
-      tt_metrics->ppem  = 0;
-      tt_metrics->scale = 0;
-      tt_metrics->ratio = 0x10000L;
-    }
-
-    /* allow font program execution */
-    TT_Set_CodeRange( exec,
-                      tt_coderange_font,
-                      face->font_program,
-                      (FT_Long)face->font_program_size );
-
     /* disable CVT and glyph programs coderange */
     TT_Clear_CodeRange( exec, tt_coderange_cvt );
     TT_Clear_CodeRange( exec, tt_coderange_glyph );
 
     if ( face->font_program_size > 0 )
     {
-      TT_Goto_CodeRange( exec, tt_coderange_font, 0 );
+      /* allow font program execution */
+      TT_Set_CodeRange( exec,
+                        tt_coderange_font,
+                        face->font_program,
+                        (FT_Long)face->font_program_size );
+
+      exec->pts.n_points   = 0;
+      exec->pts.n_contours = 0;
 
       FT_TRACE4(( "Executing `fpgm' table.\n" ));
-      error = face->interpreter( exec );
-#ifdef FT_DEBUG_LEVEL_TRACE
-      if ( error )
-        FT_TRACE4(( "  interpretation failed with error code 0x%x\n",
-                    error ));
-#endif
+      error = TT_Run_Context( exec, size );
+      FT_TRACE4(( error ? "  failed (error code 0x%x)\n" : "",
+                  error ));
     }
     else
       error = FT_Err_Ok;
@@ -979,212 +932,146 @@
    *   size ::
    *     A handle to the size object.
    *
-   *   pedantic ::
-   *     Set if bytecode execution should be pedantic.
-   *
    * @Return:
    *   FreeType error code.  0 means success.
    */
   FT_LOCAL_DEF( FT_Error )
-  tt_size_run_prep( TT_Size  size,
-                    FT_Bool  pedantic )
+  tt_size_run_prep( TT_Size  size )
   {
     TT_Face         face = (TT_Face)size->root.face;
-    TT_ExecContext  exec;
+    TT_ExecContext  exec = size->context;
     FT_Error        error;
     FT_UInt         i;
 
 
-    /* Scale the cvt values to the new ppem.            */
-    /* By default, we use the y ppem value for scaling. */
-    FT_TRACE6(( "CVT values:\n" ));
-    for ( i = 0; i < size->cvt_size; i++ )
-    {
-      /* Unscaled CVT values are already stored in 26.6 format.            */
-      /* Note that this scaling operation is very sensitive to rounding;   */
-      /* the integer division by 64 must be applied to the first argument. */
-      size->cvt[i] = FT_MulFix( face->cvt[i] / 64, size->ttmetrics.scale );
-      FT_TRACE6(( "  %3d: %f (%f)\n",
-                  i, (double)face->cvt[i] / 64, (double)size->cvt[i] / 64 ));
-    }
-    FT_TRACE6(( "\n" ));
+    /* set default GS, twilight points, and storage */
+    /* before CV program can modify them.           */
+    size->GS = tt_default_graphics_state;
 
-    exec = size->context;
+    /* all twilight points are originally zero */
+    FT_ARRAY_ZERO( size->twilight.org, size->twilight.n_points );
+    FT_ARRAY_ZERO( size->twilight.cur, size->twilight.n_points );
 
     error = TT_Load_Context( exec, face, size );
     if ( error )
       return error;
 
-    exec->callTop = 0;
-    exec->top     = 0;
+    /* clear storage area */
+    FT_ARRAY_ZERO( exec->storage, exec->storeSize );
 
-    exec->instruction_trap = FALSE;
-
-    exec->pedantic_hinting = pedantic;
-
-    TT_Set_CodeRange( exec,
-                      tt_coderange_cvt,
-                      face->cvt_program,
-                      (FT_Long)face->cvt_program_size );
+    /* Scale the cvt values to the new ppem.            */
+    /* By default, we use the y ppem value for scaling. */
+    FT_TRACE6(( "CVT values:\n" ));
+    for ( i = 0; i < exec->cvtSize; i++ )
+    {
+      /* Unscaled CVT values are already stored in 26.6 format.            */
+      /* Note that this scaling operation is very sensitive to rounding;   */
+      /* the integer division by 64 must be applied to the first argument. */
+      exec->cvt[i] = FT_MulFix( face->cvt[i] / 64, size->ttmetrics.scale );
+      FT_TRACE6(( "  %3u: %f (%f)\n",
+                  i, (double)face->cvt[i] / 64, (double)exec->cvt[i] / 64 ));
+    }
+    FT_TRACE6(( "\n" ));
 
     TT_Clear_CodeRange( exec, tt_coderange_glyph );
 
     if ( face->cvt_program_size > 0 )
     {
-      TT_Goto_CodeRange( exec, tt_coderange_cvt, 0 );
+      /* allow CV program execution */
+      TT_Set_CodeRange( exec,
+                        tt_coderange_cvt,
+                        face->cvt_program,
+                        (FT_Long)face->cvt_program_size );
+
+      exec->pts.n_points   = 0;
+      exec->pts.n_contours = 0;
 
       FT_TRACE4(( "Executing `prep' table.\n" ));
-      error = face->interpreter( exec );
-#ifdef FT_DEBUG_LEVEL_TRACE
-      if ( error )
-        FT_TRACE4(( "  interpretation failed with error code 0x%x\n",
-                    error ));
-#endif
+      error = TT_Run_Context( exec, size );
+      FT_TRACE4(( error ? "  failed (error code 0x%x)\n" : "",
+                  error ));
     }
     else
       error = FT_Err_Ok;
 
     size->cvt_ready = error;
 
-    /* UNDOCUMENTED!  The MS rasterizer doesn't allow the following */
-    /* graphics state variables to be modified by the CVT program.  */
-
-    exec->GS.dualVector.x = 0x4000;
-    exec->GS.dualVector.y = 0;
-    exec->GS.projVector.x = 0x4000;
-    exec->GS.projVector.y = 0x0;
-    exec->GS.freeVector.x = 0x4000;
-    exec->GS.freeVector.y = 0x0;
-
-    exec->GS.rp0 = 0;
-    exec->GS.rp1 = 0;
-    exec->GS.rp2 = 0;
-
-    exec->GS.gep0 = 1;
-    exec->GS.gep1 = 1;
-    exec->GS.gep2 = 1;
-
-    exec->GS.loop = 1;
-
-    /* save as default graphics state */
-    size->GS = exec->GS;
-
-    TT_Save_Context( exec, size );
+    if ( !error )
+      TT_Save_Context( exec, size );
 
     return error;
   }
 
 
   static void
-  tt_size_done_bytecode( FT_Size  ftsize )
+  tt_size_done_bytecode( TT_Size  size )
   {
-    TT_Size    size   = (TT_Size)ftsize;
-    TT_Face    face   = (TT_Face)ftsize->face;
-    FT_Memory  memory = face->root.memory;
+    FT_Memory       memory = size->root.face->memory;
+    TT_ExecContext  exec   = size->context;
 
-    if ( size->context )
+
+    if ( exec )
     {
-      TT_Done_Context( size->context );
+      FT_FREE( exec->stack );
+      FT_FREE( exec->FDefs );
+
+      TT_Done_Context( exec );
       size->context = NULL;
     }
 
-    FT_FREE( size->cvt );
-    size->cvt_size = 0;
-
-    /* free storage area */
-    FT_FREE( size->storage );
-    size->storage_size = 0;
-
     /* twilight zone */
-    tt_glyphzone_done( &size->twilight );
-
-    FT_FREE( size->function_defs );
-    FT_FREE( size->instruction_defs );
-
-    size->num_function_defs    = 0;
-    size->max_function_defs    = 0;
-    size->num_instruction_defs = 0;
-    size->max_instruction_defs = 0;
-
-    size->max_func = 0;
-    size->max_ins  = 0;
-
-    size->bytecode_ready = -1;
-    size->cvt_ready      = -1;
+    tt_glyphzone_done( memory, &size->twilight );
   }
 
 
   /* Initialize bytecode-related fields in the size object.       */
   /* We do this only if bytecode interpretation is really needed. */
-  static FT_Error
-  tt_size_init_bytecode( FT_Size  ftsize,
+  FT_LOCAL_DEF( FT_Error )
+  tt_size_init_bytecode( TT_Size  size,
                          FT_Bool  pedantic )
   {
     FT_Error   error;
-    TT_Size    size = (TT_Size)ftsize;
-    TT_Face    face = (TT_Face)ftsize->face;
-    FT_Memory  memory = face->root.memory;
+    TT_Face    face = (TT_Face)size->root.face;
+    FT_Memory  memory = size->root.face->memory;
 
     FT_UShort       n_twilight;
     TT_MaxProfile*  maxp = &face->max_profile;
+    TT_ExecContext  exec;
 
 
-    /* clean up bytecode related data */
-    FT_FREE( size->function_defs );
-    FT_FREE( size->instruction_defs );
-    FT_FREE( size->cvt );
-    FT_FREE( size->storage );
+    exec = TT_New_Context( (TT_Driver)face->root.driver );
+    if ( !exec )
+      return FT_THROW( Could_Not_Find_Context );
 
-    if ( size->context )
-      TT_Done_Context( size->context );
-    tt_glyphzone_done( &size->twilight );
+    exec->pedantic_hinting = pedantic;
 
-    size->bytecode_ready = -1;
-    size->cvt_ready      = -1;
+    exec->maxFDefs = maxp->maxFunctionDefs;
+    exec->maxIDefs = maxp->maxInstructionDefs;
 
-    size->context = TT_New_Context( (TT_Driver)face->root.driver );
-
-    size->max_function_defs    = maxp->maxFunctionDefs;
-    size->max_instruction_defs = maxp->maxInstructionDefs;
-
-    size->num_function_defs    = 0;
-    size->num_instruction_defs = 0;
-
-    size->max_func = 0;
-    size->max_ins  = 0;
-
-    size->cvt_size     = face->cvt_size;
-    size->storage_size = maxp->maxStorage;
-
-    /* Set default metrics */
-    {
-      TT_Size_Metrics*  tt_metrics = &size->ttmetrics;
-
-
-      tt_metrics->rotated   = FALSE;
-      tt_metrics->stretched = FALSE;
-
-      /* Set default engine compensation.  Value 3 is not described */
-      /* in the OpenType specification (as of Mai 2019), but Greg   */
-      /* says that MS handles it the same as `gray'.                */
-      /*                                                            */
-      /* The Apple specification says that the compensation for     */
-      /* `gray' is always zero.  FreeType doesn't do any            */
-      /* compensation at all.                                       */
-      tt_metrics->compensations[0] = 0;   /* gray  */
-      tt_metrics->compensations[1] = 0;   /* black */
-      tt_metrics->compensations[2] = 0;   /* white */
-      tt_metrics->compensations[3] = 0;   /* zero  */
-    }
-
-    /* allocate function defs, instruction defs, cvt, and storage area */
-    if ( FT_NEW_ARRAY( size->function_defs,    size->max_function_defs    ) ||
-         FT_NEW_ARRAY( size->instruction_defs, size->max_instruction_defs ) ||
-         FT_NEW_ARRAY( size->cvt,              size->cvt_size             ) ||
-         FT_NEW_ARRAY( size->storage,          size->storage_size         ) )
+    if ( FT_NEW_ARRAY( exec->FDefs, exec->maxFDefs + exec->maxIDefs ) )
       goto Exit;
 
-    /* reserve twilight zone */
+    exec->IDefs = exec->FDefs + exec->maxFDefs;
+
+    exec->numFDefs = 0;
+    exec->numIDefs = 0;
+
+    exec->maxFunc = 0;
+    exec->maxIns  = 0;
+
+    /* XXX: We reserve a little more elements on the stack to deal */
+    /*      with broken fonts like arialbs, courbs, timesbs, etc.  */
+    exec->stackSize = maxp->maxStackElements + 32;
+    exec->storeSize = maxp->maxStorage;
+    exec->cvtSize   = face->cvt_size;
+
+    if ( FT_NEW_ARRAY( exec->stack,
+                       exec->stackSize +
+                         (FT_Long)( exec->storeSize + exec->cvtSize ) ) )
+      goto Exit;
+
+    /* reserve twilight zone and set GS before fpgm is executed, */
+    /* just in case, even though fpgm should not touch them      */
     n_twilight = maxp->maxTwilightPoints;
 
     /* there are 4 phantom points (do we need this?) */
@@ -1194,20 +1081,12 @@
     if ( error )
       goto Exit;
 
-    size->twilight.n_points = n_twilight;
+    size->GS        = tt_default_graphics_state;
+    size->cvt_ready = -1;
+    size->context   = exec;
 
-    size->GS = tt_default_graphics_state;
-
-    /* set `face->interpreter' according to the debug hook present */
-    {
-      FT_Library  library = face->root.driver->root.library;
-
-
-      face->interpreter = (TT_Interpreter)
-                            library->debug_hooks[FT_DEBUG_HOOK_TRUETYPE];
-      if ( !face->interpreter )
-        face->interpreter = (TT_Interpreter)TT_RunIns;
-    }
+    size->ttmetrics.rotated   = FALSE;
+    size->ttmetrics.stretched = FALSE;
 
     /* Fine, now run the font program! */
 
@@ -1217,62 +1096,16 @@
     /* to be executed just once; calling it again is completely useless   */
     /* and might even lead to extremely slow behaviour if it is malformed */
     /* (containing an infinite loop, for example).                        */
-    error = tt_size_run_fpgm( size, pedantic );
+    error = tt_size_run_fpgm( size );
     return error;
 
   Exit:
     if ( error )
-      tt_size_done_bytecode( ftsize );
+      tt_size_done_bytecode( size );
 
     return error;
   }
 
-
-  FT_LOCAL_DEF( FT_Error )
-  tt_size_ready_bytecode( TT_Size  size,
-                          FT_Bool  pedantic )
-  {
-    FT_Error  error = FT_Err_Ok;
-
-
-    if ( size->bytecode_ready < 0 )
-      error = tt_size_init_bytecode( (FT_Size)size, pedantic );
-    else
-      error = size->bytecode_ready;
-
-    if ( error )
-      goto Exit;
-
-    /* rescale CVT when needed */
-    if ( size->cvt_ready < 0 )
-    {
-      FT_UShort  i;
-
-
-      /* all twilight points are originally zero */
-      for ( i = 0; i < size->twilight.n_points; i++ )
-      {
-        size->twilight.org[i].x = 0;
-        size->twilight.org[i].y = 0;
-        size->twilight.cur[i].x = 0;
-        size->twilight.cur[i].y = 0;
-      }
-
-      /* clear storage area */
-      for ( i = 0; i < size->storage_size; i++ )
-        size->storage[i] = 0;
-
-      size->GS = tt_default_graphics_state;
-
-      error = tt_size_run_prep( size, pedantic );
-    }
-    else
-      error = size->cvt_ready;
-
-  Exit:
-    return error;
-  }
-
 #endif /* TT_USE_BYTECODE_INTERPRETER */
 
 
@@ -1300,11 +1133,9 @@
 
 #ifdef TT_USE_BYTECODE_INTERPRETER
     size->bytecode_ready = -1;
-    size->cvt_ready      = -1;
 #endif
 
-    size->ttmetrics.valid = FALSE;
-    size->strike_index    = 0xFFFFFFFFUL;
+    size->strike_index = 0xFFFFFFFFUL;
 
     return error;
   }
@@ -1325,14 +1156,11 @@
   FT_LOCAL_DEF( void )
   tt_size_done( FT_Size  ttsize )           /* TT_Size */
   {
-    TT_Size  size = (TT_Size)ttsize;
-
-
 #ifdef TT_USE_BYTECODE_INTERPRETER
-    tt_size_done_bytecode( ttsize );
+    tt_size_done_bytecode( (TT_Size)ttsize );
+#else
+    FT_UNUSED( ttsize );
 #endif
-
-    size->ttmetrics.valid = FALSE;
   }
 
 
@@ -1353,21 +1181,13 @@
    *     function must take `FT_Size` as a result. The passed `FT_Size` is
    *     expected to point to a `TT_Size`.
    */
-  FT_LOCAL_DEF( FT_Error )
+  FT_LOCAL_DEF( void )
   tt_size_reset_height( FT_Size  ft_size )
   {
     TT_Size           size         = (TT_Size)ft_size;
-    TT_Face           face         = (TT_Face)size->root.face;
+    TT_Face           face         = (TT_Face)ft_size->face;
     FT_Size_Metrics*  size_metrics = &size->hinted_metrics;
 
-    size->ttmetrics.valid = FALSE;
-
-    /* copy the result from base layer */
-    *size_metrics = size->root.metrics;
-
-    if ( size_metrics->x_ppem < 1 || size_metrics->y_ppem < 1 )
-      return FT_THROW( Invalid_PPem );
-
     /* This bit flag, if set, indicates that the ppems must be       */
     /* rounded to integers.  Nearly all TrueType fonts have this bit */
     /* set, as hinting won't work really well otherwise.             */
@@ -1385,10 +1205,6 @@
                                FT_MulFix( face->root.height,
                                           size_metrics->y_scale ) );
     }
-
-    size->ttmetrics.valid = TRUE;
-
-    return FT_Err_Ok;
   }
 
 
@@ -1408,14 +1224,20 @@
   FT_LOCAL_DEF( FT_Error )
   tt_size_reset( TT_Size  size )
   {
-    FT_Error          error;
     TT_Face           face         = (TT_Face)size->root.face;
     FT_Size_Metrics*  size_metrics = &size->hinted_metrics;
 
 
-    error = tt_size_reset_height( (FT_Size)size );
-    if ( error )
-      return error;
+    /* invalidate the size object first */
+    size->ttmetrics.ppem = 0;
+
+    if ( size->root.metrics.x_ppem == 0 || size->root.metrics.y_ppem == 0 )
+      return FT_THROW( Invalid_PPem );
+
+    /* copy the result from base layer */
+    *size_metrics = size->root.metrics;
+
+    tt_size_reset_height( (FT_Size)size );
 
     if ( face->header.Flags & 8 )
     {
diff --git a/src/java.desktop/share/native/libfreetype/src/truetype/ttobjs.h b/src/java.desktop/share/native/libfreetype/src/truetype/ttobjs.h
index 9c36ca78362..28d6c7d855f 100644
--- a/src/java.desktop/share/native/libfreetype/src/truetype/ttobjs.h
+++ b/src/java.desktop/share/native/libfreetype/src/truetype/ttobjs.h
@@ -4,7 +4,7 @@
  *
  *   Objects manager (specification).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
@@ -53,6 +53,8 @@ FT_BEGIN_HEADER
   typedef FT_GlyphSlot  TT_GlyphSlot;
 
 
+#ifdef TT_USE_BYTECODE_INTERPRETER
+
   /**************************************************************************
    *
    * @Struct:
@@ -67,21 +69,27 @@ FT_BEGIN_HEADER
     FT_UShort      rp1;
     FT_UShort      rp2;
 
+    FT_UShort      gep0;
+    FT_UShort      gep1;
+    FT_UShort      gep2;
+
     FT_UnitVector  dualVector;
     FT_UnitVector  projVector;
     FT_UnitVector  freeVector;
 
     FT_Long        loop;
-    FT_F26Dot6     minimum_distance;
     FT_Int         round_state;
+    FT_F26Dot6     compensation[4];   /* device-specific compensations  */
 
-    FT_Bool        auto_flip;
+    /* default values below can be modified by 'fpgm' and 'prep' */
+    FT_F26Dot6     minimum_distance;
     FT_F26Dot6     control_value_cutin;
     FT_F26Dot6     single_width_cutin;
     FT_F26Dot6     single_width_value;
     FT_UShort      delta_base;
     FT_UShort      delta_shift;
 
+    FT_Bool        auto_flip;
     FT_Byte        instruct_control;
     /* According to Greg Hitchcock from Microsoft, the `scan_control'     */
     /* variable as documented in the TrueType specification is a 32-bit   */
@@ -90,17 +98,12 @@ FT_BEGIN_HEADER
     FT_Bool        scan_control;
     FT_Int         scan_type;
 
-    FT_UShort      gep0;
-    FT_UShort      gep1;
-    FT_UShort      gep2;
-
   } TT_GraphicsState;
 
 
-#ifdef TT_USE_BYTECODE_INTERPRETER
-
   FT_LOCAL( void )
-  tt_glyphzone_done( TT_GlyphZone  zone );
+  tt_glyphzone_done( FT_Memory     memory,
+                     TT_GlyphZone  zone );
 
   FT_LOCAL( FT_Error )
   tt_glyphzone_new( FT_Memory     memory,
@@ -112,73 +115,6 @@ FT_BEGIN_HEADER
 
 
 
-  /**************************************************************************
-   *
-   * EXECUTION SUBTABLES
-   *
-   * These sub-tables relate to instruction execution.
-   *
-   */
-
-
-#define TT_MAX_CODE_RANGES  3
-
-
-  /**************************************************************************
-   *
-   * There can only be 3 active code ranges at once:
-   *   - the Font Program
-   *   - the CVT Program
-   *   - a glyph's instructions set
-   */
-  typedef enum  TT_CodeRange_Tag_
-  {
-    tt_coderange_none = 0,
-    tt_coderange_font,
-    tt_coderange_cvt,
-    tt_coderange_glyph
-
-  } TT_CodeRange_Tag;
-
-
-  typedef struct  TT_CodeRange_
-  {
-    FT_Byte*  base;
-    FT_Long   size;
-
-  } TT_CodeRange;
-
-  typedef TT_CodeRange  TT_CodeRangeTable[TT_MAX_CODE_RANGES];
-
-
-  /**************************************************************************
-   *
-   * Defines a function/instruction definition record.
-   */
-  typedef struct  TT_DefRecord_
-  {
-    FT_Int    range;          /* in which code range is it located?     */
-    FT_Long   start;          /* where does it start?                   */
-    FT_Long   end;            /* where does it end?                     */
-    FT_UInt   opc;            /* function #, or instruction code        */
-    FT_Bool   active;         /* is it active?                          */
-
-  } TT_DefRecord, *TT_DefArray;
-
-
-  /**************************************************************************
-   *
-   * Subglyph transformation record.
-   */
-  typedef struct  TT_Transform_
-  {
-    FT_Fixed    xx, xy;     /* transformation matrix coefficients */
-    FT_Fixed    yx, yy;
-    FT_F26Dot6  ox, oy;     /* offsets                            */
-
-  } TT_Transform;
-
-
   /**************************************************************************
    *
    * A note regarding non-squared pixels:
@@ -251,13 +187,9 @@ FT_BEGIN_HEADER
     FT_Long     x_ratio;
     FT_Long     y_ratio;
 
-    FT_UShort   ppem;               /* maximum ppem size              */
     FT_Long     ratio;              /* current ratio                  */
     FT_Fixed    scale;
-
-    FT_F26Dot6  compensations[4];   /* device-specific compensations  */
-
-    FT_Bool     valid;
+    FT_UShort   ppem;               /* maximum ppem size              */
 
     FT_Bool     rotated;            /* `is the glyph rotated?'-flag   */
     FT_Bool     stretched;          /* `is the glyph stretched?'-flag */
@@ -288,27 +220,8 @@ FT_BEGIN_HEADER
 
     FT_Long            point_size;    /* for the `MPS' bytecode instruction */
 
-    FT_UInt            num_function_defs; /* number of function definitions */
-    FT_UInt            max_function_defs;
-    TT_DefArray        function_defs;     /* table of function definitions  */
-
-    FT_UInt            num_instruction_defs;  /* number of ins. definitions */
-    FT_UInt            max_instruction_defs;
-    TT_DefArray        instruction_defs;      /* table of ins. definitions  */
-
-    FT_UInt            max_func;
-    FT_UInt            max_ins;
-
-    TT_CodeRangeTable  codeRangeTable;
-
     TT_GraphicsState   GS;
 
-    FT_ULong           cvt_size;      /* the scaled control value table */
-    FT_Long*           cvt;
-
-    FT_UShort          storage_size; /* The storage area is now part of */
-    FT_Long*           storage;      /* the instance                    */
-
     TT_GlyphZoneRec    twilight;     /* The instance's twilight zone    */
 
     TT_ExecContext     context;
@@ -375,20 +288,18 @@ FT_BEGIN_HEADER
 #ifdef TT_USE_BYTECODE_INTERPRETER
 
   FT_LOCAL( FT_Error )
-  tt_size_run_fpgm( TT_Size  size,
-                    FT_Bool  pedantic );
+  tt_size_run_fpgm( TT_Size  size );
 
   FT_LOCAL( FT_Error )
-  tt_size_run_prep( TT_Size  size,
-                    FT_Bool  pedantic );
+  tt_size_run_prep( TT_Size  size );
 
   FT_LOCAL( FT_Error )
-  tt_size_ready_bytecode( TT_Size  size,
-                          FT_Bool  pedantic );
+  tt_size_init_bytecode( TT_Size  size,
+                         FT_Bool  pedantic );
 
 #endif /* TT_USE_BYTECODE_INTERPRETER */
 
-  FT_LOCAL( FT_Error )
+  FT_LOCAL( void )
   tt_size_reset_height( FT_Size  size );
 
   FT_LOCAL( FT_Error )
diff --git a/src/java.desktop/share/native/libfreetype/src/truetype/ttpload.c b/src/java.desktop/share/native/libfreetype/src/truetype/ttpload.c
index 9505b5f179f..827454d8574 100644
--- a/src/java.desktop/share/native/libfreetype/src/truetype/ttpload.c
+++ b/src/java.desktop/share/native/libfreetype/src/truetype/ttpload.c
@@ -4,7 +4,7 @@
  *
  *   TrueType-specific tables loader (body).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
@@ -110,7 +110,7 @@
 
     if ( face->num_locations != (FT_ULong)face->root.num_glyphs + 1 )
     {
-      FT_TRACE2(( "glyph count mismatch!  loca: %ld, maxp: %ld\n",
+      FT_TRACE2(( "glyph count mismatch!  loca: %lu, maxp: %ld\n",
                   face->num_locations - 1, face->root.num_glyphs ));
 
       /* we only handle the case where `maxp' gives a larger value */
@@ -151,7 +151,7 @@
           face->num_locations = (FT_ULong)face->root.num_glyphs + 1;
           table_len           = new_loca_len;
 
-          FT_TRACE2(( "adjusting num_locations to %ld\n",
+          FT_TRACE2(( "adjusting num_locations to %lu\n",
                       face->num_locations ));
         }
         else
@@ -225,7 +225,7 @@
     if ( pos1 > ttface->glyf_len )
     {
       FT_TRACE1(( "tt_face_get_location:"
-                  " too large offset (0x%08lx) found for glyph index %d,\n",
+                  " too large offset (0x%08lx) found for glyph index %u,\n",
                   pos1, gindex ));
       FT_TRACE1(( "                     "
                   " exceeding the end of `glyf' table (0x%08lx)\n",
@@ -240,17 +240,17 @@
       if ( gindex == ttface->num_locations - 2 )
       {
         FT_TRACE1(( "tt_face_get_location:"
-                    " too large size (%ld bytes) found for glyph index %d,\n",
+                    " too large size (%lu bytes) found for glyph index %u,\n",
                     pos2 - pos1, gindex ));
         FT_TRACE1(( "                     "
-                    " truncating at the end of `glyf' table to %ld bytes\n",
+                    " truncating at the end of `glyf' table to %lu bytes\n",
                     ttface->glyf_len - pos1 ));
         pos2 = ttface->glyf_len;
       }
       else
       {
         FT_TRACE1(( "tt_face_get_location:"
-                    " too large offset (0x%08lx) found for glyph index %d,\n",
+                    " too large offset (0x%08lx) found for glyph index %u,\n",
                     pos2, gindex + 1 ));
         FT_TRACE1(( "                     "
                     " exceeding the end of `glyf' table (0x%08lx)\n",
@@ -419,7 +419,7 @@
       if ( FT_FRAME_EXTRACT( table_len, face->font_program ) )
         goto Exit;
 
-      FT_TRACE2(( "loaded, %12ld bytes\n", face->font_program_size ));
+      FT_TRACE2(( "loaded, %12lu bytes\n", face->font_program_size ));
     }
 
   Exit:
@@ -482,7 +482,7 @@
       if ( FT_FRAME_EXTRACT( table_len, face->cvt_program ) )
         goto Exit;
 
-      FT_TRACE2(( "loaded, %12ld bytes\n", face->cvt_program_size ));
+      FT_TRACE2(( "loaded, %12lu bytes\n", face->cvt_program_size ));
     }
 
   Exit:
diff --git a/src/java.desktop/share/native/libfreetype/src/truetype/ttpload.h b/src/java.desktop/share/native/libfreetype/src/truetype/ttpload.h
index bc32b58020c..bb4d3c9cc55 100644
--- a/src/java.desktop/share/native/libfreetype/src/truetype/ttpload.h
+++ b/src/java.desktop/share/native/libfreetype/src/truetype/ttpload.h
@@ -4,7 +4,7 @@
  *
  *   TrueType-specific tables loader (specification).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/truetype/ttsubpix.c b/src/java.desktop/share/native/libfreetype/src/truetype/ttsubpix.c
deleted file mode 100644
index d811beef0df..00000000000
--- a/src/java.desktop/share/native/libfreetype/src/truetype/ttsubpix.c
+++ /dev/null
@@ -1,1013 +0,0 @@
-/****************************************************************************
- *
- * ttsubpix.c
- *
- *   TrueType Subpixel Hinting.
- *
- * Copyright (C) 2010-2023 by
- * David Turner, Robert Wilhelm, and Werner Lemberg.
- *
- * This file is part of the FreeType project, and may only be used,
- * modified, and distributed under the terms of the FreeType project
- * license, LICENSE.TXT.  By continuing to use, modify, or distribute
- * this file you indicate that you have read the license and
- * understand and accept it fully.
- *
- */
-
-#include <freetype/internal/ftdebug.h>
-#include <freetype/internal/ftcalc.h>
-#include <freetype/internal/ftstream.h>
-#include <freetype/internal/sfnt.h>
-#include <freetype/tttags.h>
-#include <freetype/ftoutln.h>
-#include <freetype/ftdriver.h>
-
-#include "ttsubpix.h"
-
-
-#if defined( TT_USE_BYTECODE_INTERPRETER )            && \
-    defined( TT_SUPPORT_SUBPIXEL_HINTING_INFINALITY )
-
-  /**************************************************************************
-   *
-   * These rules affect how the TT Interpreter does hinting, with the
-   * goal of doing subpixel hinting by (in general) ignoring x moves.
-   * Some of these rules are fixes that go above and beyond the
-   * stated techniques in the MS whitepaper on Cleartype, due to
-   * artifacts in many glyphs.  So, these rules make some glyphs render
-   * better than they do in the MS rasterizer.
-   *
-   * "" string or 0 int/char indicates to apply to all glyphs.
-   * "-" used as dummy placeholders, but any non-matching string works.
-   *
-   * Some of this could arguably be implemented in fontconfig, however:
-   *
-   * - Fontconfig can't set things on a glyph-by-glyph basis.
-   * - The tweaks that happen here are very low-level, from an average
-   *   user's point of view and are best implemented in the hinter.
-   *
-   * The goal is to make the subpixel hinting techniques as generalized
-   * as possible across all fonts to prevent the need for extra rules such
-   * as these.
-   *
-   * The rule structure is designed so that entirely new rules can easily
-   * be added when a new compatibility feature is discovered.
-   *
-   * The rule structures could also use some enhancement to handle ranges.
-   *
-   *     ****************** WORK IN PROGRESS *******************
-   */
-
-  /* These are `classes' of fonts that can be grouped together and used in */
-  /* rules below.  A blank entry "" is required at the end of these!       */
-#define FAMILY_CLASS_RULES_SIZE  7
-
-  static const SPH_Font_Class  FAMILY_CLASS_Rules
-                               [FAMILY_CLASS_RULES_SIZE] =
-  {
-    { "MS Legacy Fonts",
-      { "Aharoni",
-        "Andale Mono",
-        "Andalus",
-        "Angsana New",
-        "AngsanaUPC",
-        "Arabic Transparent",
-        "Arial Black",
-        "Arial Narrow",
-        "Arial Unicode MS",
-        "Arial",
-        "Batang",
-        "Browallia New",
-        "BrowalliaUPC",
-        "Comic Sans MS",
-        "Cordia New",
-        "CordiaUPC",
-        "Courier New",
-        "DFKai-SB",
-        "David Transparent",
-        "David",
-        "DilleniaUPC",
-        "Estrangelo Edessa",
-        "EucrosiaUPC",
-        "FangSong_GB2312",
-        "Fixed Miriam Transparent",
-        "FrankRuehl",
-        "Franklin Gothic Medium",
-        "FreesiaUPC",
-        "Garamond",
-        "Gautami",
-        "Georgia",
-        "Gulim",
-        "Impact",
-        "IrisUPC",
-        "JasmineUPC",
-        "KaiTi_GB2312",
-        "KodchiangUPC",
-        "Latha",
-        "Levenim MT",
-        "LilyUPC",
-        "Lucida Console",
-        "Lucida Sans Unicode",
-        "MS Gothic",
-        "MS Mincho",
-        "MV Boli",
-        "Mangal",
-        "Marlett",
-        "Microsoft Sans Serif",
-        "Mingliu",
-        "Miriam Fixed",
-        "Miriam Transparent",
-        "Miriam",
-        "Narkisim",
-        "Palatino Linotype",
-        "Raavi",
-        "Rod Transparent",
-        "Rod",
-        "Shruti",
-        "SimHei",
-        "Simplified Arabic Fixed",
-        "Simplified Arabic",
-        "Simsun",
-        "Sylfaen",
-        "Symbol",
-        "Tahoma",
-        "Times New Roman",
-        "Traditional Arabic",
-        "Trebuchet MS",
-        "Tunga",
-        "Verdana",
-        "Webdings",
-        "Wingdings",
-        "",
-      },
-    },
-    { "Core MS Legacy Fonts",
-      { "Arial Black",
-        "Arial Narrow",
-        "Arial Unicode MS",
-        "Arial",
-        "Comic Sans MS",
-        "Courier New",
-        "Garamond",
-        "Georgia",
-        "Impact",
-        "Lucida Console",
-        "Lucida Sans Unicode",
-        "Microsoft Sans Serif",
-        "Palatino Linotype",
-        "Tahoma",
-        "Times New Roman",
-        "Trebuchet MS",
-        "Verdana",
-        "",
-      },
-    },
-    { "Apple Legacy Fonts",
-      { "Geneva",
-        "Times",
-        "Monaco",
-        "Century",
-        "Chalkboard",
-        "Lobster",
-        "Century Gothic",
-        "Optima",
-        "Lucida Grande",
-        "Gill Sans",
-        "Baskerville",
-        "Helvetica",
-        "Helvetica Neue",
-        "",
-      },
-    },
-    { "Legacy Sans Fonts",
-      { "Andale Mono",
-        "Arial Unicode MS",
-        "Arial",
-        "Century Gothic",
-        "Comic Sans MS",
-        "Franklin Gothic Medium",
-        "Geneva",
-        "Lucida Console",
-        "Lucida Grande",
-        "Lucida Sans Unicode",
-        "Lucida Sans Typewriter",
-        "Microsoft Sans Serif",
-        "Monaco",
-        "Tahoma",
-        "Trebuchet MS",
-        "Verdana",
-        "",
-      },
-    },
-
-    { "Misc Legacy Fonts",
-      { "Dark Courier", "", }, },
-    { "Verdana Clones",
-      { "DejaVu Sans",
-        "Bitstream Vera Sans", "", }, },
-    { "Verdana and Clones",
-      { "DejaVu Sans",
-        "Bitstream Vera Sans",
-        "Verdana", "", }, },
-  };
-
-
-  /* Define this to force natural (i.e. not bitmap-compatible) widths.     */
-  /* The default leans strongly towards natural widths except for a few    */
-  /* legacy fonts where a selective combination produces nicer results.    */
-/* #define FORCE_NATURAL_WIDTHS   */
-
-
-  /* Define `classes' of styles that can be grouped together and used in   */
-  /* rules below.  A blank entry "" is required at the end of these!       */
-#define STYLE_CLASS_RULES_SIZE  5
-
-  static const SPH_Font_Class  STYLE_CLASS_Rules
-                               [STYLE_CLASS_RULES_SIZE] =
-  {
-    { "Regular Class",
-      { "Regular",
-        "Book",
-        "Medium",
-        "Roman",
-        "Normal",
-        "",
-      },
-    },
-    { "Regular/Italic Class",
-      { "Regular",
-        "Book",
-        "Medium",
-        "Italic",
-        "Oblique",
-        "Roman",
-        "Normal",
-        "",
-      },
-    },
-    { "Bold/BoldItalic Class",
-      { "Bold",
-        "Bold Italic",
-        "Black",
-        "",
-      },
-    },
-    { "Bold/Italic/BoldItalic Class",
-      { "Bold",
-        "Bold Italic",
-        "Black",
-        "Italic",
-        "Oblique",
-        "",
-      },
-    },
-    { "Regular/Bold Class",
-      { "Regular",
-        "Book",
-        "Medium",
-        "Normal",
-        "Roman",
-        "Bold",
-        "Black",
-        "",
-      },
-    },
-  };
-
-
-  /* Force special legacy fixes for fonts.                                 */
-#define COMPATIBILITY_MODE_RULES_SIZE  1
-
-  static const SPH_TweakRule  COMPATIBILITY_MODE_Rules
-                              [COMPATIBILITY_MODE_RULES_SIZE] =
-  {
-    { "Verdana Clones", 0, "", 0 },
-  };
-
-
-  /* Don't do subpixel (ignore_x_mode) hinting; do normal hinting.         */
-#define PIXEL_HINTING_RULES_SIZE  2
-
-  static const SPH_TweakRule  PIXEL_HINTING_Rules
-                              [PIXEL_HINTING_RULES_SIZE] =
-  {
-    /* these characters are almost always safe */
-    { "Courier New", 12, "Italic", 'z' },
-    { "Courier New", 11, "Italic", 'z' },
-  };
-
-
-  /* Subpixel hinting ignores SHPIX rules on X.  Force SHPIX for these.    */
-#define DO_SHPIX_RULES_SIZE  1
-
-  static const SPH_TweakRule  DO_SHPIX_Rules
-                              [DO_SHPIX_RULES_SIZE] =
-  {
-    { "-", 0, "", 0 },
-  };
-
-
-  /* Skip Y moves that start with a point that is not on a Y pixel         */
-  /* boundary and don't move that point to a Y pixel boundary.             */
-#define SKIP_NONPIXEL_Y_MOVES_RULES_SIZE  4
-
-  static const SPH_TweakRule  SKIP_NONPIXEL_Y_MOVES_Rules
-                              [SKIP_NONPIXEL_Y_MOVES_RULES_SIZE] =
-  {
-    /* fix vwxyz thinness */
-    { "Consolas", 0, "", 0 },
-    /* Fix thin middle stems */
-    { "Core MS Legacy Fonts", 0, "Regular", 0 },
-    /* Cyrillic small letter I */
-    { "Legacy Sans Fonts", 0, "", 0 },
-    /* Fix artifacts with some Regular & Bold */
-    { "Verdana Clones", 0, "", 0 },
-  };
-
-
-#define SKIP_NONPIXEL_Y_MOVES_RULES_EXCEPTIONS_SIZE  1
-
-  static const SPH_TweakRule  SKIP_NONPIXEL_Y_MOVES_Rules_Exceptions
-                              [SKIP_NONPIXEL_Y_MOVES_RULES_EXCEPTIONS_SIZE] =
-  {
-    /* Fixes < and > */
-    { "Courier New", 0, "Regular", 0 },
-  };
-
-
-  /* Skip Y moves that start with a point that is not on a Y pixel         */
-  /* boundary and don't move that point to a Y pixel boundary.             */
-#define SKIP_NONPIXEL_Y_MOVES_DELTAP_RULES_SIZE  2
-
-  static const SPH_TweakRule  SKIP_NONPIXEL_Y_MOVES_DELTAP_Rules
-                              [SKIP_NONPIXEL_Y_MOVES_DELTAP_RULES_SIZE] =
-  {
-    /* Maintain thickness of diagonal in 'N' */
-    { "Times New Roman", 0, "Regular/Bold Class", 'N' },
-    { "Georgia", 0, "Regular/Bold Class", 'N' },
-  };
-
-
-  /* Skip Y moves that move a point off a Y pixel boundary.                */
-#define SKIP_OFFPIXEL_Y_MOVES_RULES_SIZE  1
-
-  static const SPH_TweakRule  SKIP_OFFPIXEL_Y_MOVES_Rules
-                              [SKIP_OFFPIXEL_Y_MOVES_RULES_SIZE] =
-  {
-    { "-", 0, "", 0 },
-  };
-
-
-#define SKIP_OFFPIXEL_Y_MOVES_RULES_EXCEPTIONS_SIZE  1
-
-  static const SPH_TweakRule  SKIP_OFFPIXEL_Y_MOVES_Rules_Exceptions
-                              [SKIP_OFFPIXEL_Y_MOVES_RULES_EXCEPTIONS_SIZE] =
-  {
-    { "-", 0, "", 0 },
-  };
-
-
-  /* Round moves that don't move a point to a Y pixel boundary.            */
-#define ROUND_NONPIXEL_Y_MOVES_RULES_SIZE  2
-
-  static const SPH_TweakRule  ROUND_NONPIXEL_Y_MOVES_Rules
-                              [ROUND_NONPIXEL_Y_MOVES_RULES_SIZE] =
-  {
-    /* Droid font instructions don't snap Y to pixels */
-    { "Droid Sans", 0, "Regular/Italic Class", 0 },
-    { "Droid Sans Mono", 0, "", 0 },
-  };
-
-
-#define ROUND_NONPIXEL_Y_MOVES_RULES_EXCEPTIONS_SIZE  1
-
-  static const SPH_TweakRule  ROUND_NONPIXEL_Y_MOVES_Rules_Exceptions
-                              [ROUND_NONPIXEL_Y_MOVES_RULES_EXCEPTIONS_SIZE] =
-  {
-    { "-", 0, "", 0 },
-  };
-
-
-  /* Allow a Direct_Move along X freedom vector if matched.                */
-#define ALLOW_X_DMOVE_RULES_SIZE  1
-
-  static const SPH_TweakRule  ALLOW_X_DMOVE_Rules
-                              [ALLOW_X_DMOVE_RULES_SIZE] =
-  {
-    /* Fixes vanishing diagonal in 4 */
-    { "Verdana", 0, "Regular", '4' },
-  };
-
-
-  /* Return MS rasterizer version 35 if matched.                           */
-#define RASTERIZER_35_RULES_SIZE  8
-
-  static const SPH_TweakRule  RASTERIZER_35_Rules
-                              [RASTERIZER_35_RULES_SIZE] =
-  {
-    /* This seems to be the only way to make these look good */
-    { "Times New Roman", 0, "Regular", 'i' },
-    { "Times New Roman", 0, "Regular", 'j' },
-    { "Times New Roman", 0, "Regular", 'm' },
-    { "Times New Roman", 0, "Regular", 'r' },
-    { "Times New Roman", 0, "Regular", 'a' },
-    { "Times New Roman", 0, "Regular", 'n' },
-    { "Times New Roman", 0, "Regular", 'p' },
-    { "Times", 0, "", 0 },
-  };
-
-
-  /* Don't round to the subpixel grid.  Round to pixel grid.               */
-#define NORMAL_ROUND_RULES_SIZE  1
-
-  static const SPH_TweakRule  NORMAL_ROUND_Rules
-                              [NORMAL_ROUND_RULES_SIZE] =
-  {
-    /* Fix serif thickness for certain ppems */
-    /* Can probably be generalized somehow   */
-    { "Courier New", 0, "", 0 },
-  };
-
-
-  /* Skip IUP instructions if matched.                                     */
-#define SKIP_IUP_RULES_SIZE  1
-
-  static const SPH_TweakRule  SKIP_IUP_Rules
-                              [SKIP_IUP_RULES_SIZE] =
-  {
-    { "Arial", 13, "Regular", 'a' },
-  };
-
-
-  /* Skip MIAP Twilight hack if matched.                                   */
-#define MIAP_HACK_RULES_SIZE  1
-
-  static const SPH_TweakRule  MIAP_HACK_Rules
-                              [MIAP_HACK_RULES_SIZE] =
-  {
-    { "Geneva", 12, "", 0 },
-  };
-
-
-  /* Skip DELTAP instructions if matched.                                  */
-#define ALWAYS_SKIP_DELTAP_RULES_SIZE  23
-
-  static const SPH_TweakRule  ALWAYS_SKIP_DELTAP_Rules
-                              [ALWAYS_SKIP_DELTAP_RULES_SIZE] =
-  {
-    { "Georgia", 0, "Regular", 'k' },
-    /* fix various problems with e in different versions */
-    { "Trebuchet MS", 14, "Regular", 'e' },
-    { "Trebuchet MS", 13, "Regular", 'e' },
-    { "Trebuchet MS", 15, "Regular", 'e' },
-    { "Trebuchet MS", 0, "Italic", 'v' },
-    { "Trebuchet MS", 0, "Italic", 'w' },
-    { "Trebuchet MS", 0, "Regular", 'Y' },
-    { "Arial", 11, "Regular", 's' },
-    /* prevent problems with '3' and others */
-    { "Verdana", 10, "Regular", 0 },
-    { "Verdana", 9, "Regular", 0 },
-    /* Cyrillic small letter short I */
-    { "Legacy Sans Fonts", 0, "", 0x438 },
-    { "Legacy Sans Fonts", 0, "", 0x439 },
-    { "Arial", 10, "Regular", '6' },
-    { "Arial", 0, "Bold/BoldItalic Class", 'a' },
-    /* Make horizontal stems consistent with the rest */
-    { "Arial", 24, "Bold", 'a' },
-    { "Arial", 25, "Bold", 'a' },
-    { "Arial", 24, "Bold", 's' },
-    { "Arial", 25, "Bold", 's' },
-    { "Arial", 34, "Bold", 's' },
-    { "Arial", 35, "Bold", 's' },
-    { "Arial", 36, "Bold", 's' },
-    { "Arial", 25, "Regular", 's' },
-    { "Arial", 26, "Regular", 's' },
-  };
-
-
-  /* Always do DELTAP instructions if matched.                             */
-#define ALWAYS_DO_DELTAP_RULES_SIZE  1
-
-  static const SPH_TweakRule  ALWAYS_DO_DELTAP_Rules
-                              [ALWAYS_DO_DELTAP_RULES_SIZE] =
-  {
-    { "-", 0, "", 0 },
-  };
-
-
-  /* Don't allow ALIGNRP after IUP.                                        */
-#define NO_ALIGNRP_AFTER_IUP_RULES_SIZE  1
-
-  static const SPH_TweakRule  NO_ALIGNRP_AFTER_IUP_Rules
-                              [NO_ALIGNRP_AFTER_IUP_RULES_SIZE] =
-  {
-    /* Prevent creation of dents in outline */
-    { "-", 0, "", 0 },
-  };
-
-
-  /* Don't allow DELTAP after IUP.                                         */
-#define NO_DELTAP_AFTER_IUP_RULES_SIZE  1
-
-  static const SPH_TweakRule  NO_DELTAP_AFTER_IUP_Rules
-                              [NO_DELTAP_AFTER_IUP_RULES_SIZE] =
-  {
-    { "-", 0, "", 0 },
-  };
-
-
-  /* Don't allow CALL after IUP.                                           */
-#define NO_CALL_AFTER_IUP_RULES_SIZE  1
-
-  static const SPH_TweakRule  NO_CALL_AFTER_IUP_Rules
-                              [NO_CALL_AFTER_IUP_RULES_SIZE] =
-  {
-    /* Prevent creation of dents in outline */
-    { "-", 0, "", 0 },
-  };
-
-
-  /* De-embolden these glyphs slightly.                                    */
-#define DEEMBOLDEN_RULES_SIZE  9
-
-  static const SPH_TweakRule  DEEMBOLDEN_Rules
-                              [DEEMBOLDEN_RULES_SIZE] =
-  {
-    { "Courier New", 0, "Bold", 'A' },
-    { "Courier New", 0, "Bold", 'W' },
-    { "Courier New", 0, "Bold", 'w' },
-    { "Courier New", 0, "Bold", 'M' },
-    { "Courier New", 0, "Bold", 'X' },
-    { "Courier New", 0, "Bold", 'K' },
-    { "Courier New", 0, "Bold", 'x' },
-    { "Courier New", 0, "Bold", 'z' },
-    { "Courier New", 0, "Bold", 'v' },
-  };
-
-
-  /* Embolden these glyphs slightly.                                       */
-#define EMBOLDEN_RULES_SIZE  2
-
-  static const SPH_TweakRule  EMBOLDEN_Rules
-                              [EMBOLDEN_RULES_SIZE] =
-  {
-    { "Courier New", 0, "Regular", 0 },
-    { "Courier New", 0, "Italic", 0 },
-  };
-
-
-  /* This is a CVT hack that makes thick horizontal stems on 2, 5, 7       */
-  /* similar to Windows XP.                                                */
-#define TIMES_NEW_ROMAN_HACK_RULES_SIZE  12
-
-  static const SPH_TweakRule  TIMES_NEW_ROMAN_HACK_Rules
-                              [TIMES_NEW_ROMAN_HACK_RULES_SIZE] =
-  {
-    { "Times New Roman", 16, "Italic", '2' },
-    { "Times New Roman", 16, "Italic", '5' },
-    { "Times New Roman", 16, "Italic", '7' },
-    { "Times New Roman", 16, "Regular", '2' },
-    { "Times New Roman", 16, "Regular", '5' },
-    { "Times New Roman", 16, "Regular", '7' },
-    { "Times New Roman", 17, "Italic", '2' },
-    { "Times New Roman", 17, "Italic", '5' },
-    { "Times New Roman", 17, "Italic", '7' },
-    { "Times New Roman", 17, "Regular", '2' },
-    { "Times New Roman", 17, "Regular", '5' },
-    { "Times New Roman", 17, "Regular", '7' },
-  };
-
-
-  /* This fudges distance on 2 to get rid of the vanishing stem issue.     */
-  /* A real solution to this is certainly welcome.                         */
-#define COURIER_NEW_2_HACK_RULES_SIZE  15
-
-  static const SPH_TweakRule  COURIER_NEW_2_HACK_Rules
-                              [COURIER_NEW_2_HACK_RULES_SIZE] =
-  {
-    { "Courier New", 10, "Regular", '2' },
-    { "Courier New", 11, "Regular", '2' },
-    { "Courier New", 12, "Regular", '2' },
-    { "Courier New", 13, "Regular", '2' },
-    { "Courier New", 14, "Regular", '2' },
-    { "Courier New", 15, "Regular", '2' },
-    { "Courier New", 16, "Regular", '2' },
-    { "Courier New", 17, "Regular", '2' },
-    { "Courier New", 18, "Regular", '2' },
-    { "Courier New", 19, "Regular", '2' },
-    { "Courier New", 20, "Regular", '2' },
-    { "Courier New", 21, "Regular", '2' },
-    { "Courier New", 22, "Regular", '2' },
-    { "Courier New", 23, "Regular", '2' },
-    { "Courier New", 24, "Regular", '2' },
-  };
-
-
-#ifndef FORCE_NATURAL_WIDTHS
-
-  /* Use compatible widths with these glyphs.  Compatible widths is always */
-  /* on when doing B/W TrueType instructing, but is used selectively here, */
-  /* typically on glyphs with 3 or more vertical stems.                    */
-#define COMPATIBLE_WIDTHS_RULES_SIZE  38
-
-  static const SPH_TweakRule  COMPATIBLE_WIDTHS_Rules
-                              [COMPATIBLE_WIDTHS_RULES_SIZE] =
-  {
-    { "Arial Unicode MS", 12, "Regular Class", 'm' },
-    { "Arial Unicode MS", 14, "Regular Class", 'm' },
-    /* Cyrillic small letter sha */
-    { "Arial", 10, "Regular Class", 0x448 },
-    { "Arial", 11, "Regular Class", 'm' },
-    { "Arial", 12, "Regular Class", 'm' },
-    /* Cyrillic small letter sha */
-    { "Arial", 12, "Regular Class", 0x448 },
-    { "Arial", 13, "Regular Class", 0x448 },
-    { "Arial", 14, "Regular Class", 'm' },
-    /* Cyrillic small letter sha */
-    { "Arial", 14, "Regular Class", 0x448 },
-    { "Arial", 15, "Regular Class", 0x448 },
-    { "Arial", 17, "Regular Class", 'm' },
-    { "DejaVu Sans", 15, "Regular Class", 0 },
-    { "Microsoft Sans Serif", 11, "Regular Class", 0 },
-    { "Microsoft Sans Serif", 12, "Regular Class", 0 },
-    { "Segoe UI", 11, "Regular Class", 0 },
-    { "Monaco", 0, "Regular Class", 0 },
-    { "Segoe UI", 12, "Regular Class", 'm' },
-    { "Segoe UI", 14, "Regular Class", 'm' },
-    { "Tahoma", 11, "Regular Class", 0 },
-    { "Times New Roman", 16, "Regular Class", 'c' },
-    { "Times New Roman", 16, "Regular Class", 'm' },
-    { "Times New Roman", 16, "Regular Class", 'o' },
-    { "Times New Roman", 16, "Regular Class", 'w' },
-    { "Trebuchet MS", 11, "Regular Class", 0 },
-    { "Trebuchet MS", 12, "Regular Class", 0 },
-    { "Trebuchet MS", 14, "Regular Class", 0 },
-    { "Trebuchet MS", 15, "Regular Class", 0 },
-    { "Ubuntu", 12, "Regular Class", 'm' },
-    /* Cyrillic small letter sha */
-    { "Verdana", 10, "Regular Class", 0x448 },
-    { "Verdana", 11, "Regular Class", 0x448 },
-    { "Verdana and Clones", 12, "Regular Class", 'i' },
-    { "Verdana and Clones", 12, "Regular Class", 'j' },
-    { "Verdana and Clones", 12, "Regular Class", 'l' },
-    { "Verdana and Clones", 12, "Regular Class", 'm' },
-    { "Verdana and Clones", 13, "Regular Class", 'i' },
-    { "Verdana and Clones", 13, "Regular Class", 'j' },
-    { "Verdana and Clones", 13, "Regular Class", 'l' },
-    { "Verdana and Clones", 14, "Regular Class", 'm' },
-  };
-
-
-  /* Scaling slightly in the x-direction prior to hinting results in       */
-  /* more visually pleasing glyphs in certain cases.                       */
-  /* This sometimes needs to be coordinated with compatible width rules.   */
-  /* A value of 1000 corresponds to a scaled value of 1.0.                 */
-
-#define X_SCALING_RULES_SIZE  50
-
-  static const SPH_ScaleRule  X_SCALING_Rules[X_SCALING_RULES_SIZE] =
-  {
-    { "DejaVu Sans", 12, "Regular Class", 'm', 950 },
-    { "Verdana and Clones", 12, "Regular Class", 'a', 1100 },
-    { "Verdana and Clones", 13, "Regular Class", 'a', 1050 },
-    { "Arial", 11, "Regular Class", 'm', 975 },
-    { "Arial", 12, "Regular Class", 'm', 1050 },
-    /* Cyrillic small letter el */
-    { "Arial", 13, "Regular Class", 0x43B, 950 },
-    { "Arial", 13, "Regular Class", 'o', 950 },
-    { "Arial", 13, "Regular Class", 'e', 950 },
-    { "Arial", 14, "Regular Class", 'm', 950 },
-    /* Cyrillic small letter el */
-    { "Arial", 15, "Regular Class", 0x43B, 925 },
-    { "Bitstream Vera Sans", 10, "Regular/Italic Class", 0, 1100 },
-    { "Bitstream Vera Sans", 12, "Regular/Italic Class", 0, 1050 },
-    { "Bitstream Vera Sans", 16, "Regular Class", 0, 1050 },
-    { "Bitstream Vera Sans", 9, "Regular/Italic Class", 0, 1050 },
-    { "DejaVu Sans", 12, "Regular Class", 'l', 975 },
-    { "DejaVu Sans", 12, "Regular Class", 'i', 975 },
-    { "DejaVu Sans", 12, "Regular Class", 'j', 975 },
-    { "DejaVu Sans", 13, "Regular Class", 'l', 950 },
-    { "DejaVu Sans", 13, "Regular Class", 'i', 950 },
-    { "DejaVu Sans", 13, "Regular Class", 'j', 950 },
-    { "DejaVu Sans", 10, "Regular/Italic Class", 0, 1100 },
-    { "DejaVu Sans", 12, "Regular/Italic Class", 0, 1050 },
-    { "Georgia", 10, "", 0, 1050 },
-    { "Georgia", 11, "", 0, 1100 },
-    { "Georgia", 12, "", 0, 1025 },
-    { "Georgia", 13, "", 0, 1050 },
-    { "Georgia", 16, "", 0, 1050 },
-    { "Georgia", 17, "", 0, 1030 },
-    { "Liberation Sans", 12, "Regular Class", 'm', 1100 },
-    { "Lucida Grande", 11, "Regular Class", 'm', 1100 },
-    { "Microsoft Sans Serif", 11, "Regular Class", 'm', 950 },
-    { "Microsoft Sans Serif", 12, "Regular Class", 'm', 1050 },
-    { "Segoe UI", 12, "Regular Class", 'H', 1050 },
-    { "Segoe UI", 12, "Regular Class", 'm', 1050 },
-    { "Segoe UI", 14, "Regular Class", 'm', 1050 },
-    { "Tahoma", 11, "Regular Class", 'i', 975 },
-    { "Tahoma", 11, "Regular Class", 'l', 975 },
-    { "Tahoma", 11, "Regular Class", 'j', 900 },
-    { "Tahoma", 11, "Regular Class", 'm', 918 },
-    { "Verdana", 10, "Regular/Italic Class", 0, 1100 },
-    { "Verdana", 12, "Regular Class", 'm', 975 },
-    { "Verdana", 12, "Regular/Italic Class", 0, 1050 },
-    { "Verdana", 13, "Regular/Italic Class", 'i', 950 },
-    { "Verdana", 13, "Regular/Italic Class", 'j', 950 },
-    { "Verdana", 13, "Regular/Italic Class", 'l', 950 },
-    { "Verdana", 16, "Regular Class", 0, 1050 },
-    { "Verdana", 9, "Regular/Italic Class", 0, 1050 },
-    { "Times New Roman", 16, "Regular Class", 'm', 918 },
-    { "Trebuchet MS", 11, "Regular Class", 'm', 800 },
-    { "Trebuchet MS", 12, "Regular Class", 'm', 800 },
-  };
-
-#else
-
-#define COMPATIBLE_WIDTHS_RULES_SIZE  1
-
-  static const SPH_TweakRule  COMPATIBLE_WIDTHS_Rules
-                              [COMPATIBLE_WIDTHS_RULES_SIZE] =
-  {
-    { "-", 0, "", 0 },
-  };
-
-
-#define X_SCALING_RULES_SIZE  1
-
-  static const SPH_ScaleRule  X_SCALING_Rules
-                              [X_SCALING_RULES_SIZE] =
-  {
-    { "-", 0, "", 0, 1000 },
-  };
-
-#endif /* FORCE_NATURAL_WIDTHS */
-
-
-  static FT_Bool
-  is_member_of_family_class( const FT_String*  detected_font_name,
-                             const FT_String*  rule_font_name )
-  {
-    FT_UInt  i, j;
-
-
-    /* Does font name match rule family? */
-    if ( ft_strcmp( detected_font_name, rule_font_name ) == 0 )
-      return TRUE;
-
-    /* Is font name a wildcard ""? */
-    if ( ft_strcmp( rule_font_name, "" ) == 0 )
-      return TRUE;
-
-    /* Is font name contained in a class list? */
-    for ( i = 0; i < FAMILY_CLASS_RULES_SIZE; i++ )
-    {
-      if ( ft_strcmp( FAMILY_CLASS_Rules[i].name, rule_font_name ) == 0 )
-      {
-        for ( j = 0; j < SPH_MAX_CLASS_MEMBERS; j++ )
-        {
-          if ( ft_strcmp( FAMILY_CLASS_Rules[i].member[j], "" ) == 0 )
-            continue;
-          if ( ft_strcmp( FAMILY_CLASS_Rules[i].member[j],
-                          detected_font_name ) == 0 )
-            return TRUE;
-        }
-      }
-    }
-
-    return FALSE;
-  }
-
-
-  static FT_Bool
-  is_member_of_style_class( const FT_String*  detected_font_style,
-                            const FT_String*  rule_font_style )
-  {
-    FT_UInt  i, j;
-
-
-    /* Does font style match rule style? */
-    if ( ft_strcmp( detected_font_style, rule_font_style ) == 0 )
-      return TRUE;
-
-    /* Is font style a wildcard ""? */
-    if ( ft_strcmp( rule_font_style, "" ) == 0 )
-      return TRUE;
-
-    /* Is font style contained in a class list? */
-    for ( i = 0; i < STYLE_CLASS_RULES_SIZE; i++ )
-    {
-      if ( ft_strcmp( STYLE_CLASS_Rules[i].name, rule_font_style ) == 0 )
-      {
-        for ( j = 0; j < SPH_MAX_CLASS_MEMBERS; j++ )
-        {
-          if ( ft_strcmp( STYLE_CLASS_Rules[i].member[j], "" ) == 0 )
-            continue;
-          if ( ft_strcmp( STYLE_CLASS_Rules[i].member[j],
-                          detected_font_style ) == 0 )
-            return TRUE;
-        }
-      }
-    }
-
-    return FALSE;
-  }
-
-
-  FT_LOCAL_DEF( FT_Bool )
-  sph_test_tweak( TT_Face               face,
-                  const FT_String*      family,
-                  FT_UInt               ppem,
-                  const FT_String*      style,
-                  FT_UInt               glyph_index,
-                  const SPH_TweakRule*  rule,
-                  FT_UInt               num_rules )
-  {
-    FT_UInt  i;
-
-
-    /* rule checks may be able to be optimized further */
-    for ( i = 0; i < num_rules; i++ )
-    {
-      if ( family                                                   &&
-           ( is_member_of_family_class ( family, rule[i].family ) ) )
-        if ( rule[i].ppem == 0    ||
-             rule[i].ppem == ppem )
-          if ( style                                             &&
-               is_member_of_style_class ( style, rule[i].style ) )
-            if ( rule[i].glyph == 0                                ||
-                 FT_Get_Char_Index( (FT_Face)face,
-                                    rule[i].glyph ) == glyph_index )
-        return TRUE;
-    }
-
-    return FALSE;
-  }
-
-
-  static FT_UInt
-  scale_test_tweak( TT_Face               face,
-                    const FT_String*      family,
-                    FT_UInt               ppem,
-                    const FT_String*      style,
-                    FT_UInt               glyph_index,
-                    const SPH_ScaleRule*  rule,
-                    FT_UInt               num_rules )
-  {
-    FT_UInt  i;
-
-
-    /* rule checks may be able to be optimized further */
-    for ( i = 0; i < num_rules; i++ )
-    {
-      if ( family                                                   &&
-           ( is_member_of_family_class ( family, rule[i].family ) ) )
-        if ( rule[i].ppem == 0    ||
-             rule[i].ppem == ppem )
-          if ( style                                            &&
-               is_member_of_style_class( style, rule[i].style ) )
-            if ( rule[i].glyph == 0                                ||
-                 FT_Get_Char_Index( (FT_Face)face,
-                                    rule[i].glyph ) == glyph_index )
-        return rule[i].scale;
-    }
-
-    return 1000;
-  }
-
-
-  FT_LOCAL_DEF( FT_UInt )
-  sph_test_tweak_x_scaling( TT_Face           face,
-                            const FT_String*  family,
-                            FT_UInt           ppem,
-                            const FT_String*  style,
-                            FT_UInt           glyph_index )
-  {
-    return scale_test_tweak( face, family, ppem, style, glyph_index,
-                             X_SCALING_Rules, X_SCALING_RULES_SIZE );
-  }
-
-
-#define TWEAK_RULES( x )                                       \
-  if ( sph_test_tweak( face, family, ppem, style, glyph_index, \
-                       x##_Rules, x##_RULES_SIZE ) )           \
-    loader->exec->sph_tweak_flags |= SPH_TWEAK_##x
-
-#define TWEAK_RULES_EXCEPTIONS( x )                                        \
-  if ( sph_test_tweak( face, family, ppem, style, glyph_index,             \
-                       x##_Rules_Exceptions, x##_RULES_EXCEPTIONS_SIZE ) ) \
-    loader->exec->sph_tweak_flags &= ~SPH_TWEAK_##x
-
-
-  FT_LOCAL_DEF( void )
-  sph_set_tweaks( TT_Loader  loader,
-                  FT_UInt    glyph_index )
-  {
-    TT_Face     face   = loader->face;
-    FT_String*  family = face->root.family_name;
-    FT_UInt     ppem   = loader->size->metrics->x_ppem;
-    FT_String*  style  = face->root.style_name;
-
-
-    /* don't apply rules if style isn't set */
-    if ( !face->root.style_name )
-      return;
-
-#ifdef SPH_DEBUG_MORE_VERBOSE
-    printf( "%s,%d,%s,%c=%d ",
-            family, ppem, style, glyph_index, glyph_index );
-#endif
-
-    TWEAK_RULES( PIXEL_HINTING );
-
-    if ( loader->exec->sph_tweak_flags & SPH_TWEAK_PIXEL_HINTING )
-    {
-      loader->exec->ignore_x_mode = FALSE;
-      return;
-    }
-
-    TWEAK_RULES( ALLOW_X_DMOVE );
-    TWEAK_RULES( ALWAYS_DO_DELTAP );
-    TWEAK_RULES( ALWAYS_SKIP_DELTAP );
-    TWEAK_RULES( DEEMBOLDEN );
-    TWEAK_RULES( DO_SHPIX );
-    TWEAK_RULES( EMBOLDEN );
-    TWEAK_RULES( MIAP_HACK );
-    TWEAK_RULES( NORMAL_ROUND );
-    TWEAK_RULES( NO_ALIGNRP_AFTER_IUP );
-    TWEAK_RULES( NO_CALL_AFTER_IUP );
-    TWEAK_RULES( NO_DELTAP_AFTER_IUP );
-    TWEAK_RULES( RASTERIZER_35 );
-    TWEAK_RULES( SKIP_IUP );
-
-    TWEAK_RULES( SKIP_OFFPIXEL_Y_MOVES );
-    TWEAK_RULES_EXCEPTIONS( SKIP_OFFPIXEL_Y_MOVES );
-
-    TWEAK_RULES( SKIP_NONPIXEL_Y_MOVES_DELTAP );
-
-    TWEAK_RULES( SKIP_NONPIXEL_Y_MOVES );
-    TWEAK_RULES_EXCEPTIONS( SKIP_NONPIXEL_Y_MOVES );
-
-    TWEAK_RULES( ROUND_NONPIXEL_Y_MOVES );
-    TWEAK_RULES_EXCEPTIONS( ROUND_NONPIXEL_Y_MOVES );
-
-    if ( loader->exec->sph_tweak_flags & SPH_TWEAK_RASTERIZER_35 )
-    {
-      if ( loader->exec->rasterizer_version != TT_INTERPRETER_VERSION_35 )
-      {
-        loader->exec->rasterizer_version = TT_INTERPRETER_VERSION_35;
-        loader->exec->size->cvt_ready    = -1;
-
-        tt_size_ready_bytecode(
-          loader->exec->size,
-          FT_BOOL( loader->load_flags & FT_LOAD_PEDANTIC ) );
-      }
-      else
-        loader->exec->rasterizer_version = TT_INTERPRETER_VERSION_35;
-    }
-    else
-    {
-      if ( loader->exec->rasterizer_version  !=
-           SPH_OPTION_SET_RASTERIZER_VERSION )
-      {
-        loader->exec->rasterizer_version = SPH_OPTION_SET_RASTERIZER_VERSION;
-        loader->exec->size->cvt_ready    = -1;
-
-        tt_size_ready_bytecode(
-          loader->exec->size,
-          FT_BOOL( loader->load_flags & FT_LOAD_PEDANTIC ) );
-      }
-      else
-        loader->exec->rasterizer_version = SPH_OPTION_SET_RASTERIZER_VERSION;
-    }
-
-    if ( IS_HINTED( loader->load_flags ) )
-    {
-      TWEAK_RULES( TIMES_NEW_ROMAN_HACK );
-      TWEAK_RULES( COURIER_NEW_2_HACK );
-    }
-
-    if ( sph_test_tweak( face, family, ppem, style, glyph_index,
-           COMPATIBILITY_MODE_Rules, COMPATIBILITY_MODE_RULES_SIZE ) )
-      loader->exec->face->sph_compatibility_mode = TRUE;
-
-
-    if ( IS_HINTED( loader->load_flags ) )
-    {
-      if ( sph_test_tweak( face, family, ppem, style, glyph_index,
-             COMPATIBLE_WIDTHS_Rules, COMPATIBLE_WIDTHS_RULES_SIZE ) )
-        loader->exec->compatible_widths |= TRUE;
-    }
-  }
-
-#else /* !(TT_USE_BYTECODE_INTERPRETER &&          */
-      /*   TT_SUPPORT_SUBPIXEL_HINTING_INFINALITY) */
-
-  /* ANSI C doesn't like empty source files */
-  typedef int  _tt_subpix_dummy;
-
-#endif /* !(TT_USE_BYTECODE_INTERPRETER &&          */
-       /*   TT_SUPPORT_SUBPIXEL_HINTING_INFINALITY) */
-
-
-/* END */
diff --git a/src/java.desktop/share/native/libfreetype/src/truetype/ttsubpix.h b/src/java.desktop/share/native/libfreetype/src/truetype/ttsubpix.h
deleted file mode 100644
index 62af4c272d1..00000000000
--- a/src/java.desktop/share/native/libfreetype/src/truetype/ttsubpix.h
+++ /dev/null
@@ -1,110 +0,0 @@
-/****************************************************************************
- *
- * ttsubpix.h
- *
- *   TrueType Subpixel Hinting.
- *
- * Copyright (C) 2010-2023 by
- * David Turner, Robert Wilhelm, and Werner Lemberg.
- *
- * This file is part of the FreeType project, and may only be used,
- * modified, and distributed under the terms of the FreeType project
- * license, LICENSE.TXT.  By continuing to use, modify, or distribute
- * this file you indicate that you have read the license and
- * understand and accept it fully.
- *
- */
-
-
-#ifndef TTSUBPIX_H_
-#define TTSUBPIX_H_
-
-#include "ttobjs.h"
-#include "ttinterp.h"
-
-
-FT_BEGIN_HEADER
-
-
-#ifdef TT_SUPPORT_SUBPIXEL_HINTING_INFINALITY
-
-  /**************************************************************************
-   *
-   * ID flags to identify special functions at FDEF and runtime.
-   *
-   */
-#define SPH_FDEF_INLINE_DELTA_1       0x0000001
-#define SPH_FDEF_INLINE_DELTA_2       0x0000002
-#define SPH_FDEF_DIAGONAL_STROKE      0x0000004
-#define SPH_FDEF_VACUFORM_ROUND_1     0x0000008
-#define SPH_FDEF_TTFAUTOHINT_1        0x0000010
-#define SPH_FDEF_SPACING_1            0x0000020
-#define SPH_FDEF_SPACING_2            0x0000040
-#define SPH_FDEF_TYPEMAN_STROKES      0x0000080
-#define SPH_FDEF_TYPEMAN_DIAGENDCTRL  0x0000100
-
-
-  /**************************************************************************
-   *
-   * Tweak flags that are set for each glyph by the below rules.
-   *
-   */
-#define SPH_TWEAK_ALLOW_X_DMOVE                   0x0000001UL
-#define SPH_TWEAK_ALWAYS_DO_DELTAP                0x0000002UL
-#define SPH_TWEAK_ALWAYS_SKIP_DELTAP              0x0000004UL
-#define SPH_TWEAK_COURIER_NEW_2_HACK              0x0000008UL
-#define SPH_TWEAK_DEEMBOLDEN                      0x0000010UL
-#define SPH_TWEAK_DO_SHPIX                        0x0000020UL
-#define SPH_TWEAK_EMBOLDEN                        0x0000040UL
-#define SPH_TWEAK_MIAP_HACK                       0x0000080UL
-#define SPH_TWEAK_NORMAL_ROUND                    0x0000100UL
-#define SPH_TWEAK_NO_ALIGNRP_AFTER_IUP            0x0000200UL
-#define SPH_TWEAK_NO_CALL_AFTER_IUP               0x0000400UL
-#define SPH_TWEAK_NO_DELTAP_AFTER_IUP             0x0000800UL
-#define SPH_TWEAK_PIXEL_HINTING                   0x0001000UL
-#define SPH_TWEAK_RASTERIZER_35                   0x0002000UL
-#define SPH_TWEAK_ROUND_NONPIXEL_Y_MOVES          0x0004000UL
-#define SPH_TWEAK_SKIP_IUP                        0x0008000UL
-#define SPH_TWEAK_SKIP_NONPIXEL_Y_MOVES           0x0010000UL
-#define SPH_TWEAK_SKIP_OFFPIXEL_Y_MOVES           0x0020000UL
-#define SPH_TWEAK_TIMES_NEW_ROMAN_HACK            0x0040000UL
-#define SPH_TWEAK_SKIP_NONPIXEL_Y_MOVES_DELTAP    0x0080000UL
-
-
-  FT_LOCAL( FT_Bool )
-  sph_test_tweak( TT_Face               face,
-                  const FT_String*      family,
-                  FT_UInt               ppem,
-                  const FT_String*      style,
-                  FT_UInt               glyph_index,
-                  const SPH_TweakRule*  rule,
-                  FT_UInt               num_rules );
-
-  FT_LOCAL( FT_UInt )
-  sph_test_tweak_x_scaling( TT_Face           face,
-                            const FT_String*  family,
-                            FT_UInt           ppem,
-                            const FT_String*  style,
-                            FT_UInt           glyph_index );
-
-  FT_LOCAL( void )
-  sph_set_tweaks( TT_Loader  loader,
-                  FT_UInt    glyph_index );
-
-
-  /* These macros are defined absent a method for setting them */
-#define SPH_OPTION_BITMAP_WIDTHS           FALSE
-#define SPH_OPTION_SET_SUBPIXEL            TRUE
-#define SPH_OPTION_SET_GRAYSCALE           FALSE
-#define SPH_OPTION_SET_COMPATIBLE_WIDTHS   FALSE
-#define SPH_OPTION_SET_RASTERIZER_VERSION  38
-
-#endif /* TT_SUPPORT_SUBPIXEL_HINTING_INFINALITY */
-
-
-FT_END_HEADER
-
-#endif /* TTSUBPIX_H_ */
-
-
-/* END */
diff --git a/src/java.desktop/share/native/libfreetype/src/type1/t1afm.c b/src/java.desktop/share/native/libfreetype/src/type1/t1afm.c
index a63cd4dc48a..b1a0d23bed6 100644
--- a/src/java.desktop/share/native/libfreetype/src/type1/t1afm.c
+++ b/src/java.desktop/share/native/libfreetype/src/type1/t1afm.c
@@ -4,7 +4,7 @@
  *
  *   AFM support for Type 1 fonts (body).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/type1/t1afm.h b/src/java.desktop/share/native/libfreetype/src/type1/t1afm.h
index 7f5cdda191f..92ff627dd0d 100644
--- a/src/java.desktop/share/native/libfreetype/src/type1/t1afm.h
+++ b/src/java.desktop/share/native/libfreetype/src/type1/t1afm.h
@@ -4,7 +4,7 @@
  *
  *   AFM support for Type 1 fonts (specification).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/type1/t1driver.c b/src/java.desktop/share/native/libfreetype/src/type1/t1driver.c
index 8ed01914a5a..5ded7714021 100644
--- a/src/java.desktop/share/native/libfreetype/src/type1/t1driver.c
+++ b/src/java.desktop/share/native/libfreetype/src/type1/t1driver.c
@@ -4,7 +4,7 @@
  *
  *   Type 1 driver interface (body).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/type1/t1driver.h b/src/java.desktop/share/native/libfreetype/src/type1/t1driver.h
index 5ff52b55b1a..1cc3d24e7dd 100644
--- a/src/java.desktop/share/native/libfreetype/src/type1/t1driver.h
+++ b/src/java.desktop/share/native/libfreetype/src/type1/t1driver.h
@@ -4,7 +4,7 @@
  *
  *   High-level Type 1 driver interface (specification).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/type1/t1errors.h b/src/java.desktop/share/native/libfreetype/src/type1/t1errors.h
index 8aeb24ae188..46bddbc30fd 100644
--- a/src/java.desktop/share/native/libfreetype/src/type1/t1errors.h
+++ b/src/java.desktop/share/native/libfreetype/src/type1/t1errors.h
@@ -4,7 +4,7 @@
  *
  *   Type 1 error codes (specification only).
  *
- * Copyright (C) 2001-2024 by
+ * Copyright (C) 2001-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/type1/t1gload.c b/src/java.desktop/share/native/libfreetype/src/type1/t1gload.c
index c29e682510c..b9bc0b56ce8 100644
--- a/src/java.desktop/share/native/libfreetype/src/type1/t1gload.c
+++ b/src/java.desktop/share/native/libfreetype/src/type1/t1gload.c
@@ -4,7 +4,7 @@
  *
  *   Type 1 Glyph Loader (body).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
@@ -70,8 +70,13 @@
     /* For incremental fonts get the character data using the */
     /* callback function.                                     */
     if ( inc )
+    {
+      /* So `free_glyph_data` knows whether to free it. */
+      char_string->pointer = NULL;
+
       error = inc->funcs->get_glyph_data( inc->object,
                                           glyph_index, char_string );
+    }
     else
 
 #endif /* FT_CONFIG_OPTION_INCREMENTAL */
@@ -155,6 +160,9 @@
       decoder->builder.advance.y      = INT_TO_FIXED( metrics.advance_v );
     }
 
+    if ( error && inc )
+      inc->funcs->free_glyph_data( inc->object, char_string );
+
 #endif /* FT_CONFIG_OPTION_INCREMENTAL */
 
     return error;
@@ -295,7 +303,7 @@
       {
         advances[nn] = 0;
 
-        FT_TRACE5(( "  idx %d: advance height 0 font units\n",
+        FT_TRACE5(( "  idx %u: advance height 0 font units\n",
                     first + nn ));
       }
 
@@ -333,7 +341,7 @@
       else
         advances[nn] = 0;
 
-      FT_TRACE5(( "  idx %d: advance width %ld font unit%s\n",
+      FT_TRACE5(( "  idx %u: advance width %ld font unit%s\n",
                   first + nn,
                   advances[nn],
                   advances[nn] == 1 ? "" : "s" ));
@@ -380,7 +388,7 @@
       goto Exit;
     }
 
-    FT_TRACE1(( "T1_Load_Glyph: glyph index %d\n", glyph_index ));
+    FT_TRACE1(( "T1_Load_Glyph: glyph index %u\n", glyph_index ));
 
     FT_ASSERT( ( face->len_buildchar == 0 ) == ( face->buildchar == NULL ) );
 
@@ -398,16 +406,12 @@
       glyph->y_scale = 0x10000L;
     }
 
-    t1glyph->outline.n_points   = 0;
-    t1glyph->outline.n_contours = 0;
-
     hinting = FT_BOOL( !( load_flags & FT_LOAD_NO_SCALE   ) &&
                        !( load_flags & FT_LOAD_NO_HINTING ) );
     scaled  = FT_BOOL( !( load_flags & FT_LOAD_NO_SCALE   ) );
 
     glyph->hint     = hinting;
     glyph->scaled   = scaled;
-    t1glyph->format = FT_GLYPH_FORMAT_OUTLINE;
 
     error = decoder_funcs->init( &decoder,
                                  t1glyph->face,
@@ -452,16 +456,12 @@
 
     must_finish_decoder = FALSE;
 
-    /* now, set the metrics -- this is rather simple, as   */
-    /* the left side bearing is the xMin, and the top side */
-    /* bearing the yMax                                    */
     if ( !error )
     {
-      t1glyph->outline.flags &= FT_OUTLINE_OWNER;
-      t1glyph->outline.flags |= FT_OUTLINE_REVERSE_FILL;
-
-      /* for composite glyphs, return only left side bearing and */
-      /* advance width                                           */
+      /* now, set the metrics -- this is rather simple, as   */
+      /* the left side bearing is the xMin, and the top side */
+      /* bearing the yMax; for composite glyphs, return only */
+      /* left side bearing and advance width                 */
       if ( load_flags & FT_LOAD_NO_RECURSE )
       {
         FT_Slot_Internal  internal = t1glyph->internal;
@@ -482,6 +482,13 @@
         FT_Glyph_Metrics*  metrics = &t1glyph->metrics;
 
 
+        t1glyph->format = FT_GLYPH_FORMAT_OUTLINE;
+
+        t1glyph->outline.flags &= FT_OUTLINE_OWNER;
+        t1glyph->outline.flags |= FT_OUTLINE_REVERSE_FILL;
+        if ( t1size && t1size->metrics.y_ppem < 24 )
+          t1glyph->outline.flags |= FT_OUTLINE_HIGH_PRECISION;
+
         /* copy the _unscaled_ advance width */
         metrics->horiAdvance =
           FIXED_TO_INT( decoder.builder.advance.x );
@@ -504,11 +511,6 @@
             FIXED_TO_INT( decoder.builder.advance.y );
         }
 
-        t1glyph->format = FT_GLYPH_FORMAT_OUTLINE;
-
-        if ( t1size && t1size->metrics.y_ppem < 24 )
-          t1glyph->outline.flags |= FT_OUTLINE_HIGH_PRECISION;
-
 #if 1
         /* apply the font matrix, if any */
         if ( font_matrix.xx != 0x10000L || font_matrix.yy != 0x10000L ||
diff --git a/src/java.desktop/share/native/libfreetype/src/type1/t1gload.h b/src/java.desktop/share/native/libfreetype/src/type1/t1gload.h
index 17a6a5941e3..6bedd132c5f 100644
--- a/src/java.desktop/share/native/libfreetype/src/type1/t1gload.h
+++ b/src/java.desktop/share/native/libfreetype/src/type1/t1gload.h
@@ -4,7 +4,7 @@
  *
  *   Type 1 Glyph Loader (specification).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/type1/t1load.c b/src/java.desktop/share/native/libfreetype/src/type1/t1load.c
index ee7fb42a517..0f11445bef0 100644
--- a/src/java.desktop/share/native/libfreetype/src/type1/t1load.c
+++ b/src/java.desktop/share/native/libfreetype/src/type1/t1load.c
@@ -4,7 +4,7 @@
  *
  *   Type 1 font loader (body).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
@@ -471,7 +471,7 @@
     nc = num_coords;
     if ( num_coords > blend->num_axis )
     {
-      FT_TRACE2(( "T1_Get_MM_Blend: only using first %d of %d coordinates\n",
+      FT_TRACE2(( "T1_Get_MM_Blend: only using first %u of %u coordinates\n",
                   blend->num_axis, num_coords ));
       nc = blend->num_axis;
     }
@@ -640,7 +640,7 @@
   {
     FT_UNUSED( instance_index );
 
-    return T1_Set_MM_Blend( face, 0, NULL );
+    return T1_Set_MM_WeightVector( face, 0, NULL );
   }
 
 
@@ -691,7 +691,7 @@
     if ( num_coords > blend->num_axis )
     {
       FT_TRACE2(( "T1_Get_Var_Design:"
-                  " only using first %d of %d coordinates\n",
+                  " only using first %u of %u coordinates\n",
                   blend->num_axis, num_coords ));
       nc = blend->num_axis;
     }
diff --git a/src/java.desktop/share/native/libfreetype/src/type1/t1load.h b/src/java.desktop/share/native/libfreetype/src/type1/t1load.h
index a45efa7cb7b..2cd8241968d 100644
--- a/src/java.desktop/share/native/libfreetype/src/type1/t1load.h
+++ b/src/java.desktop/share/native/libfreetype/src/type1/t1load.h
@@ -4,7 +4,7 @@
  *
  *   Type 1 font loader (specification).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/type1/t1objs.c b/src/java.desktop/share/native/libfreetype/src/type1/t1objs.c
index b1b27c31fe3..7f25208f875 100644
--- a/src/java.desktop/share/native/libfreetype/src/type1/t1objs.c
+++ b/src/java.desktop/share/native/libfreetype/src/type1/t1objs.c
@@ -4,7 +4,7 @@
  *
  *   Type 1 objects manager (body).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/type1/t1objs.h b/src/java.desktop/share/native/libfreetype/src/type1/t1objs.h
index 3809370c1e0..6c71977c154 100644
--- a/src/java.desktop/share/native/libfreetype/src/type1/t1objs.h
+++ b/src/java.desktop/share/native/libfreetype/src/type1/t1objs.h
@@ -4,7 +4,7 @@
  *
  *   Type 1 objects manager (specification).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/type1/t1parse.c b/src/java.desktop/share/native/libfreetype/src/type1/t1parse.c
index 3717ea7c572..ef643e298f4 100644
--- a/src/java.desktop/share/native/libfreetype/src/type1/t1parse.c
+++ b/src/java.desktop/share/native/libfreetype/src/type1/t1parse.c
@@ -4,7 +4,7 @@
  *
  *   Type 1 parser (body).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/type1/t1parse.h b/src/java.desktop/share/native/libfreetype/src/type1/t1parse.h
index a0a2134d45c..f4ad426e9e1 100644
--- a/src/java.desktop/share/native/libfreetype/src/type1/t1parse.h
+++ b/src/java.desktop/share/native/libfreetype/src/type1/t1parse.h
@@ -4,7 +4,7 @@
  *
  *   Type 1 parser (specification).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/src/java.desktop/share/native/libfreetype/src/type1/t1tokens.h b/src/java.desktop/share/native/libfreetype/src/type1/t1tokens.h
index 5a3d2f1ef08..c3736cd42c0 100644
--- a/src/java.desktop/share/native/libfreetype/src/type1/t1tokens.h
+++ b/src/java.desktop/share/native/libfreetype/src/type1/t1tokens.h
@@ -4,7 +4,7 @@
  *
  *   Type 1 tokenizer (specification).
  *
- * Copyright (C) 1996-2024 by
+ * Copyright (C) 1996-2025 by
  * David Turner, Robert Wilhelm, and Werner Lemberg.
  *
  * This file is part of the FreeType project, and may only be used,
diff --git a/test/jdk/javax/swing/text/html/CSS/8231286/HtmlFontSizeTest.java b/test/jdk/javax/swing/text/html/CSS/8231286/HtmlFontSizeTest.java
index 9bdf4dbfae8..eea0a969e77 100644
--- a/test/jdk/javax/swing/text/html/CSS/8231286/HtmlFontSizeTest.java
+++ b/test/jdk/javax/swing/text/html/CSS/8231286/HtmlFontSizeTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2021, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -51,8 +51,8 @@ public class HtmlFontSizeTest {
         htmlPane.setEditorKit(kit);
 
         String htmlString = "<html>\n"
-            + "<body style=\"font-family:SansSerif; font-size:16pt\">\n"
-            + "<p>This should be 16 pt.</p>\n"
+            + "<body style=\"font-family:SansSerif; font-size:32pt\">\n"
+            + "<p>This should be 32 pt.</p>\n"
             + "</body>\n"
             + "</html>";
 
@@ -71,10 +71,16 @@ public class HtmlFontSizeTest {
         System.out.println("size with W3C:" + w3cFrameSize);
         System.out.println("size without W3C:" + stdFrameSize);
 
-        float ratio = (float)w3cFrameSize.width / (float)stdFrameSize.width;
-        System.out.println("w3cFrameSize.width/stdFrameSize.width " + ratio);
+        float widthRatio = (float)w3cFrameSize.width / (float)stdFrameSize.width;
+        System.out.println("w3cFrameSize.width/stdFrameSize.width " + widthRatio);
 
-        if (!"1.3".equals(String.format(Locale.ENGLISH, "%.1f", ratio))) {
+        float heightRatio = (float)w3cFrameSize.height / (float)stdFrameSize.height;
+        System.out.println("w3cFrameSize.height/stdFrameSize.height " + heightRatio);
+
+        float avgRatio = (widthRatio + heightRatio) / 2.0f;
+        System.out.println("Average ratio of two dimensions " + avgRatio);
+
+        if (!"1.3".equals(String.format(Locale.ENGLISH, "%.1f", avgRatio))) {
             throw new RuntimeException("HTML font size too large with high-DPI scaling and W3C_LENGTH_UNITS");
         }
     }

From 667404948c1c967daf6e274c61b9d1b1bd0827d4 Mon Sep 17 00:00:00 2001
From: Oli Gillespie <ogillespie@openjdk.org>
Date: Tue, 3 Mar 2026 10:05:14 +0000
Subject: [PATCH 007/655] 8378963: Test
 test/jdk/java/lang/management/RuntimeMXBean/InputArgument.java#id4 failed

Reviewed-by: kevinw, dholmes
---
 .../jdk/java/lang/management/RuntimeMXBean/InputArgument.java | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/test/jdk/java/lang/management/RuntimeMXBean/InputArgument.java b/test/jdk/java/lang/management/RuntimeMXBean/InputArgument.java
index 0e7609b86ed..8f0ed8e48af 100644
--- a/test/jdk/java/lang/management/RuntimeMXBean/InputArgument.java
+++ b/test/jdk/java/lang/management/RuntimeMXBean/InputArgument.java
@@ -69,7 +69,7 @@
  *
  * @run driver InputArgument generateFlagsFile
  * @run main/othervm -XX:+UseFastJNIAccessors -XX:Flags=InputArgument.flags InputArgument
- * -XX:+UseFastJNIAccessors -XX:-UseG1GC -XX:+UseParallelGC -XX:MaxHeapSize=100M
+ * -XX:+UseFastJNIAccessors -XX:+PrintWarnings -XX:-PrintCommandLineFlags -XX:ErrorLogTimeout=100
  */
 
 import java.lang.management.*;
@@ -116,6 +116,6 @@ public class InputArgument {
     private static void generateFlagsFile() throws Exception {
         // 3 types of flag; both boolean cases and 1 numeric
         Files.writeString(Paths.get("", "InputArgument.flags"),
-            String.format("-UseG1GC%n+UseParallelGC%nMaxHeapSize=100M%n"));
+            String.format("+PrintWarnings%n-PrintCommandLineFlags%nErrorLogTimeout=100%n"));
     }
 }

From b28568f5d8308170c018651ea1c87c2b8f36acb2 Mon Sep 17 00:00:00 2001
From: Vic Wang <vicwang@zhaoxin.com>
Date: Tue, 3 Mar 2026 10:41:47 +0000
Subject: [PATCH 008/655] 8367478: Improve UseAVX setting and add cpu
 descriptions for zhaoxin processors

Reviewed-by: jiefu, dholmes
---
 src/hotspot/cpu/x86/vm_version_x86.cpp | 40 ++++++++++++++++++++++++--
 1 file changed, 37 insertions(+), 3 deletions(-)

diff --git a/src/hotspot/cpu/x86/vm_version_x86.cpp b/src/hotspot/cpu/x86/vm_version_x86.cpp
index 78d6dec08cf..b352de77d6f 100644
--- a/src/hotspot/cpu/x86/vm_version_x86.cpp
+++ b/src/hotspot/cpu/x86/vm_version_x86.cpp
@@ -958,9 +958,17 @@ void VM_Version::get_processor_features() {
   if (UseSSE < 1)
     _features.clear_feature(CPU_SSE);
 
-  //since AVX instructions is slower than SSE in some ZX cpus, force USEAVX=0.
-  if (is_zx() && ((cpu_family() == 6) || (cpu_family() == 7))) {
-    UseAVX = 0;
+  // ZX cpus specific settings
+  if (is_zx() && FLAG_IS_DEFAULT(UseAVX)) {
+    if (cpu_family() == 7) {
+      if (extended_cpu_model() == 0x5B || extended_cpu_model() == 0x6B) {
+        UseAVX = 1;
+      } else if (extended_cpu_model() == 0x1B || extended_cpu_model() == 0x3B) {
+        UseAVX = 0;
+      }
+    } else if (cpu_family() == 6) {
+      UseAVX = 0;
+    }
   }
 
   // UseSSE is set to the smaller of what hardware supports and what
@@ -2623,6 +2631,23 @@ const char* VM_Version::cpu_family_description(void) {
       return _family_id_intel[cpu_family_id];
     }
   }
+  if (is_zx()) {
+    int cpu_model_id = extended_cpu_model();
+    if (cpu_family_id == 7) {
+      switch (cpu_model_id) {
+        case 0x1B:
+          return "wudaokou";
+        case 0x3B:
+          return "lujiazui";
+        case 0x5B:
+          return "yongfeng";
+        case 0x6B:
+          return "shijidadao";
+      }
+    } else if (cpu_family_id == 6) {
+      return "zhangjiang";
+    }
+  }
   if (is_hygon()) {
     return "Dhyana";
   }
@@ -2642,6 +2667,9 @@ int VM_Version::cpu_type_description(char* const buf, size_t buf_len) {
   } else if (is_amd()) {
     cpu_type = "AMD";
     x64 = cpu_is_em64t() ? " AMD64" : "";
+  } else if (is_zx()) {
+    cpu_type = "Zhaoxin";
+    x64 = cpu_is_em64t() ? " x86_64" : "";
   } else if (is_hygon()) {
     cpu_type = "Hygon";
     x64 = cpu_is_em64t() ? " AMD64" : "";
@@ -3259,6 +3287,12 @@ int VM_Version::allocate_prefetch_distance(bool use_watermark_prefetch) {
     } else {
       return 128; // Athlon
     }
+  } else if (is_zx()) {
+    if (supports_sse2()) {
+      return 256;
+    } else {
+      return 128;
+    }
   } else { // Intel
     if (supports_sse3() && is_intel_server_family()) {
       if (supports_sse4_2() && supports_ht()) { // Nehalem based cpus

From 7dc97af89f0965ff9e0fa38426adcfc8c69c34ea Mon Sep 17 00:00:00 2001
From: Dingli Zhang <dzhang@openjdk.org>
Date: Tue, 3 Mar 2026 12:37:05 +0000
Subject: [PATCH 009/655] 8378905: RISC-V: fastdebug build fails after
 JDK-8377554

Reviewed-by: fyang, wenanjian
---
 src/hotspot/cpu/riscv/riscv.ad | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/src/hotspot/cpu/riscv/riscv.ad b/src/hotspot/cpu/riscv/riscv.ad
index 730dd68dd88..ed6e8db0606 100644
--- a/src/hotspot/cpu/riscv/riscv.ad
+++ b/src/hotspot/cpu/riscv/riscv.ad
@@ -2274,7 +2274,7 @@ encode %{
       } else if (rtype == relocInfo::metadata_type) {
         __ mov_metadata(dst_reg, (Metadata*)con);
       } else {
-        assert(rtype == relocInfo::none, "unexpected reloc type");
+        assert(rtype == relocInfo::none || rtype == relocInfo::external_word_type, "unexpected reloc type");
         __ mv(dst_reg, $src$$constant);
       }
     }

From 6cf8b2ea2fb34b2e63a44d74ffe0495669ea5690 Mon Sep 17 00:00:00 2001
From: Thomas Schatzl <tschatzl@openjdk.org>
Date: Tue, 3 Mar 2026 13:26:20 +0000
Subject: [PATCH 010/655] 8378845: Add NoSafepointVerifier to CriticalSection
 classes

Reviewed-by: dholmes, iwalulya
---
 src/hotspot/share/utilities/globalCounter.inline.hpp     | 7 +++++--
 src/hotspot/share/utilities/singleWriterSynchronizer.hpp | 5 ++++-
 2 files changed, 9 insertions(+), 3 deletions(-)

diff --git a/src/hotspot/share/utilities/globalCounter.inline.hpp b/src/hotspot/share/utilities/globalCounter.inline.hpp
index ed37b8a878d..0d05096716a 100644
--- a/src/hotspot/share/utilities/globalCounter.inline.hpp
+++ b/src/hotspot/share/utilities/globalCounter.inline.hpp
@@ -29,6 +29,7 @@
 
 #include "runtime/atomic.hpp"
 #include "runtime/javaThread.hpp"
+#include "runtime/safepointVerifiers.hpp"
 
 inline GlobalCounter::CSContext
 GlobalCounter::critical_section_begin(Thread *thread) {
@@ -53,11 +54,13 @@ GlobalCounter::critical_section_end(Thread *thread, CSContext context) {
 }
 
 class GlobalCounter::CriticalSection {
- private:
+  NoSafepointVerifier _nsv;
   Thread* _thread;
   CSContext _context;
- public:
+
+public:
   inline CriticalSection(Thread* thread) :
+    _nsv(),
     _thread(thread),
     _context(GlobalCounter::critical_section_begin(_thread))
   {}
diff --git a/src/hotspot/share/utilities/singleWriterSynchronizer.hpp b/src/hotspot/share/utilities/singleWriterSynchronizer.hpp
index 450c7e89233..c21c9d4ee5e 100644
--- a/src/hotspot/share/utilities/singleWriterSynchronizer.hpp
+++ b/src/hotspot/share/utilities/singleWriterSynchronizer.hpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -27,6 +27,7 @@
 
 #include "memory/allocation.hpp"
 #include "runtime/atomic.hpp"
+#include "runtime/safepointVerifiers.hpp"
 #include "runtime/semaphore.hpp"
 #include "utilities/globalDefinitions.hpp"
 #include "utilities/macros.hpp"
@@ -101,12 +102,14 @@ inline void SingleWriterSynchronizer::exit(uint enter_value) {
 }
 
 class SingleWriterSynchronizer::CriticalSection : public StackObj {
+  NoSafepointVerifier _nsv;
   SingleWriterSynchronizer* _synchronizer;
   uint _enter_value;
 
 public:
   // Enter synchronizer's critical section.
   explicit CriticalSection(SingleWriterSynchronizer* synchronizer) :
+    _nsv(),
     _synchronizer(synchronizer),
     _enter_value(synchronizer->enter())
   {}

From 364fd0e37e05b98042db9c7c140c5ed6d78b50e0 Mon Sep 17 00:00:00 2001
From: Oli Gillespie <ogillespie@openjdk.org>
Date: Tue, 3 Mar 2026 15:23:08 +0000
Subject: [PATCH 011/655] 8378971: Test
 jdk/jfr/event/runtime/TestVMInfoEvent.java fails after JDK-8378110
 (RuntimeMXBean.getInputArguments())

Reviewed-by: syan, kevinw
---
 .../jdk/jfr/event/runtime/TestVMInfoEvent.java    | 15 ++++++++-------
 1 file changed, 8 insertions(+), 7 deletions(-)

diff --git a/test/jdk/jdk/jfr/event/runtime/TestVMInfoEvent.java b/test/jdk/jdk/jfr/event/runtime/TestVMInfoEvent.java
index 2571530a470..8cbc6ea2bb8 100644
--- a/test/jdk/jdk/jfr/event/runtime/TestVMInfoEvent.java
+++ b/test/jdk/jdk/jfr/event/runtime/TestVMInfoEvent.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2013, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2013, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -28,8 +28,9 @@ import java.lang.management.RuntimeMXBean;
 import java.nio.file.Files;
 import java.nio.file.Paths;
 import java.util.List;
-import java.util.stream.Collectors;
+import java.util.Properties;
 
+import jdk.internal.vm.VMSupport;
 import jdk.jfr.Recording;
 import jdk.jfr.consumer.RecordedEvent;
 import jdk.test.lib.Asserts;
@@ -38,6 +39,7 @@ import jdk.test.lib.jfr.Events;
 
 /**
  * @test
+ * @modules java.base/jdk.internal.vm
  * @requires vm.flagless
  * @requires vm.gc == "Serial" | vm.gc == null
  * @requires vm.hasJFR
@@ -69,13 +71,12 @@ public class TestVMInfoEvent {
                 Asserts.fail(String.format("%s does not contain %s", jvmVersion, mbean.getVmVersion()));
             }
 
-            String jvmArgs = Events.assertField(event, "jvmArguments").notNull().getValue();
-            String jvmFlags = Events.assertField(event, "jvmFlags").notNull().getValue();
             Long pid = Events.assertField(event, "pid").atLeast(0L).getValue();
             Asserts.assertEquals(pid, ProcessHandle.current().pid());
-            String eventArgs = (jvmFlags.trim() + " " + jvmArgs).trim();
-            String beanArgs = mbean.getInputArguments().stream().collect(Collectors.joining(" "));
-            Asserts.assertEquals(eventArgs, beanArgs, "Wrong inputArgs");
+
+            Properties agentProps = VMSupport.getAgentProperties();
+            Events.assertField(event, "jvmArguments").equal(agentProps.getProperty("sun.jvm.args"));
+            Events.assertField(event, "jvmFlags").equal(agentProps.getProperty("sun.jvm.flags"));
 
             final String javaCommand = mbean.getSystemProperties().get("sun.java.command");
             Events.assertField(event, "javaArguments").equal(javaCommand);

From 0ea7d890d98eda32912e9a8340020ee405042576 Mon Sep 17 00:00:00 2001
From: Raffaello Giulietti <rgiulietti@openjdk.org>
Date: Tue, 3 Mar 2026 16:57:09 +0000
Subject: [PATCH 012/655] 8377903: ArraysSupport::mismatch should document that
 they return the smallest index

Reviewed-by: rriggs, vyazici
---
 .../classes/jdk/internal/util/ArraysSupport.java   | 14 +++++++-------
 1 file changed, 7 insertions(+), 7 deletions(-)

diff --git a/src/java.base/share/classes/jdk/internal/util/ArraysSupport.java b/src/java.base/share/classes/jdk/internal/util/ArraysSupport.java
index c220455e80b..3bd2486fa39 100644
--- a/src/java.base/share/classes/jdk/internal/util/ArraysSupport.java
+++ b/src/java.base/share/classes/jdk/internal/util/ArraysSupport.java
@@ -478,7 +478,7 @@ public class ArraysSupport {
     // Bytes
 
     /**
-     * Find the index of a mismatch between two arrays.
+     * Find the smallest index of a mismatch between two arrays.
      *
      * <p>This method does not perform bounds checks. It is the responsibility
      * of the caller to perform such bounds checks before calling this method.
@@ -486,9 +486,9 @@ public class ArraysSupport {
      * @param a the first array to be tested for a mismatch
      * @param b the second array to be tested for a mismatch
      * @param length the number of bytes from each array to check
-     * @return the index of a mismatch between the two arrays, otherwise -1 if
-     * no mismatch.  The index will be within the range of (inclusive) 0 to
-     * (exclusive) the smaller of the two array lengths.
+     * @return the smallest index of a mismatch between the two arrays,
+     * otherwise -1 if no mismatch.  The index will be within the range of
+     * (inclusive) 0 to (exclusive) the smaller of the two array lengths.
      */
     public static int mismatch(byte[] a,
                                byte[] b,
@@ -520,8 +520,8 @@ public class ArraysSupport {
     }
 
     /**
-     * Find the relative index of a mismatch between two arrays starting from
-     * given indexes.
+     * Find the smallest relative index of a mismatch between two arrays
+     * starting from given indexes.
      *
      * <p>This method does not perform bounds checks. It is the responsibility
      * of the caller to perform such bounds checks before calling this method.
@@ -533,7 +533,7 @@ public class ArraysSupport {
      * @param bFromIndex the index of the first element (inclusive) in the
      * second array to be compared
      * @param length the number of bytes from each array to check
-     * @return the relative index of a mismatch between the two arrays,
+     * @return the smallest relative index of a mismatch between the two arrays,
      * otherwise -1 if no mismatch.  The index will be within the range of
      * (inclusive) 0 to (exclusive) the smaller of the two array bounds.
      */

From df43ef915ab13714c7a191c6413494f97f9db8c2 Mon Sep 17 00:00:00 2001
From: Dingli Zhang <dzhang@openjdk.org>
Date: Tue, 3 Mar 2026 17:09:14 +0000
Subject: [PATCH 013/655] 8378883: Enable more vector reductions IR matching
 tests for RISC-V

Reviewed-by: fyang
---
 .../loopopts/superword/TestReductions.java    | 78 +++++++++----------
 1 file changed, 39 insertions(+), 39 deletions(-)

diff --git a/test/hotspot/jtreg/compiler/loopopts/superword/TestReductions.java b/test/hotspot/jtreg/compiler/loopopts/superword/TestReductions.java
index 9d674950499..5c085e6a3a3 100644
--- a/test/hotspot/jtreg/compiler/loopopts/superword/TestReductions.java
+++ b/test/hotspot/jtreg/compiler/loopopts/superword/TestReductions.java
@@ -1340,7 +1340,7 @@ public class TestReductions {
     @IR(counts = {IRNode.LOAD_VECTOR_I,   "> 0",
                   IRNode.AND_REDUCTION_V, "> 0",
                   IRNode.AND_VI,          "> 0"},
-        applyIfCPUFeatureOr = {"sse4.1", "true", "asimd", "true"},
+        applyIfCPUFeatureOr = {"sse4.1", "true", "asimd", "true", "rvv", "true"},
         applyIf = {"AutoVectorizationOverrideProfitability", "> 0"})
     @IR(failOn = IRNode.LOAD_VECTOR_I,
         applyIf = {"AutoVectorizationOverrideProfitability", "= 0"})
@@ -1357,7 +1357,7 @@ public class TestReductions {
     @IR(counts = {IRNode.LOAD_VECTOR_I,  "> 0",
                   IRNode.OR_REDUCTION_V, "> 0",
                   IRNode.OR_VI,          "> 0"},
-        applyIfCPUFeatureOr = {"sse4.1", "true", "asimd", "true"},
+        applyIfCPUFeatureOr = {"sse4.1", "true", "asimd", "true", "rvv", "true"},
         applyIf = {"AutoVectorizationOverrideProfitability", "> 0"})
     @IR(failOn = IRNode.LOAD_VECTOR_I,
         applyIf = {"AutoVectorizationOverrideProfitability", "= 0"})
@@ -1374,7 +1374,7 @@ public class TestReductions {
     @IR(counts = {IRNode.LOAD_VECTOR_I,   "> 0",
                   IRNode.XOR_REDUCTION_V, "> 0",
                   IRNode.XOR_VI,          "> 0"},
-        applyIfCPUFeatureOr = {"sse4.1", "true", "asimd", "true"},
+        applyIfCPUFeatureOr = {"sse4.1", "true", "asimd", "true", "rvv", "true"},
         applyIf = {"AutoVectorizationOverrideProfitability", "> 0"})
     @IR(failOn = IRNode.LOAD_VECTOR_I,
         applyIf = {"AutoVectorizationOverrideProfitability", "= 0"})
@@ -1391,7 +1391,7 @@ public class TestReductions {
     @IR(counts = {IRNode.LOAD_VECTOR_I,    "> 0",
                   IRNode.ADD_REDUCTION_VI, "> 0",
                   IRNode.ADD_VI,           "> 0"},
-        applyIfCPUFeatureOr = {"sse4.1", "true", "asimd", "true"},
+        applyIfCPUFeatureOr = {"sse4.1", "true", "asimd", "true", "rvv", "true"},
         applyIf = {"AutoVectorizationOverrideProfitability", "> 0"})
     @IR(failOn = IRNode.LOAD_VECTOR_I,
         applyIf = {"AutoVectorizationOverrideProfitability", "= 0"})
@@ -1408,7 +1408,7 @@ public class TestReductions {
     @IR(counts = {IRNode.LOAD_VECTOR_I,    "> 0",
                   IRNode.MUL_REDUCTION_VI, "> 0",
                   IRNode.MUL_VI,           "> 0"},
-        applyIfCPUFeatureOr = {"sse4.1", "true", "asimd", "true"},
+        applyIfCPUFeatureOr = {"sse4.1", "true", "asimd", "true", "rvv", "true"},
         applyIf = {"AutoVectorizationOverrideProfitability", "> 0"})
     @IR(failOn = IRNode.LOAD_VECTOR_I,
         applyIf = {"AutoVectorizationOverrideProfitability", "= 0"})
@@ -1425,7 +1425,7 @@ public class TestReductions {
     @IR(counts = {IRNode.LOAD_VECTOR_I,   "> 0",
                   IRNode.MIN_REDUCTION_V, "> 0",
                   IRNode.MIN_VI,          "> 0"},
-        applyIfCPUFeatureOr = {"sse4.1", "true", "asimd", "true"},
+        applyIfCPUFeatureOr = {"sse4.1", "true", "asimd", "true", "rvv", "true"},
         applyIf = {"AutoVectorizationOverrideProfitability", "> 0"})
     @IR(failOn = IRNode.LOAD_VECTOR_I,
         applyIf = {"AutoVectorizationOverrideProfitability", "= 0"})
@@ -1442,7 +1442,7 @@ public class TestReductions {
     @IR(counts = {IRNode.LOAD_VECTOR_I,   "> 0",
                   IRNode.MAX_REDUCTION_V, "> 0",
                   IRNode.MAX_VI,          "> 0"},
-        applyIfCPUFeatureOr = {"sse4.1", "true", "asimd", "true"},
+        applyIfCPUFeatureOr = {"sse4.1", "true", "asimd", "true", "rvv", "true"},
         applyIf = {"AutoVectorizationOverrideProfitability", "> 0"})
     @IR(failOn = IRNode.LOAD_VECTOR_I,
         applyIf = {"AutoVectorizationOverrideProfitability", "= 0"})
@@ -1460,7 +1460,7 @@ public class TestReductions {
     @IR(counts = {IRNode.LOAD_VECTOR_I,   "> 0",
                   IRNode.AND_REDUCTION_V, "> 0",
                   IRNode.AND_VI,          "> 0"},
-        applyIfCPUFeatureOr = {"sse4.1", "true", "asimd", "true"},
+        applyIfCPUFeatureOr = {"sse4.1", "true", "asimd", "true", "rvv", "true"},
         applyIf = {"AutoVectorizationOverrideProfitability", "> 0"})
     @IR(failOn = IRNode.LOAD_VECTOR_I,
         applyIf = {"AutoVectorizationOverrideProfitability", "= 0"})
@@ -1477,7 +1477,7 @@ public class TestReductions {
     @IR(counts = {IRNode.LOAD_VECTOR_I,  "> 0",
                   IRNode.OR_REDUCTION_V, "> 0",
                   IRNode.OR_VI,          "> 0"},
-        applyIfCPUFeatureOr = {"sse4.1", "true", "asimd", "true"},
+        applyIfCPUFeatureOr = {"sse4.1", "true", "asimd", "true", "rvv", "true"},
         applyIf = {"AutoVectorizationOverrideProfitability", "> 0"})
     @IR(failOn = IRNode.LOAD_VECTOR_I,
         applyIf = {"AutoVectorizationOverrideProfitability", "= 0"})
@@ -1494,7 +1494,7 @@ public class TestReductions {
     @IR(counts = {IRNode.LOAD_VECTOR_I,   "> 0",
                   IRNode.XOR_REDUCTION_V, "> 0",
                   IRNode.XOR_VI,          "> 0"},
-        applyIfCPUFeatureOr = {"sse4.1", "true", "asimd", "true"},
+        applyIfCPUFeatureOr = {"sse4.1", "true", "asimd", "true", "rvv", "true"},
         applyIf = {"AutoVectorizationOverrideProfitability", "> 0"})
     @IR(failOn = IRNode.LOAD_VECTOR_I,
         applyIf = {"AutoVectorizationOverrideProfitability", "= 0"})
@@ -1511,7 +1511,7 @@ public class TestReductions {
     @IR(counts = {IRNode.LOAD_VECTOR_I,    "> 0",
                   IRNode.ADD_REDUCTION_VI, "> 0",
                   IRNode.ADD_VI,           "> 0"},
-        applyIfCPUFeatureOr = {"sse4.1", "true", "asimd", "true"},
+        applyIfCPUFeatureOr = {"sse4.1", "true", "asimd", "true", "rvv", "true"},
         applyIf = {"AutoVectorizationOverrideProfitability", "> 0"})
     @IR(failOn = IRNode.LOAD_VECTOR_I,
         applyIf = {"AutoVectorizationOverrideProfitability", "= 0"})
@@ -1528,7 +1528,7 @@ public class TestReductions {
     @IR(counts = {IRNode.LOAD_VECTOR_I,    "> 0",
                   IRNode.MUL_REDUCTION_VI, "> 0",
                   IRNode.MUL_VI,           "> 0"},
-        applyIfCPUFeatureOr = {"sse4.1", "true", "asimd", "true"},
+        applyIfCPUFeatureOr = {"sse4.1", "true", "asimd", "true", "rvv", "true"},
         applyIf = {"AutoVectorizationOverrideProfitability", "> 0"})
     @IR(failOn = IRNode.LOAD_VECTOR_I,
         applyIf = {"AutoVectorizationOverrideProfitability", "= 0"})
@@ -1545,7 +1545,7 @@ public class TestReductions {
     @IR(counts = {IRNode.LOAD_VECTOR_I,   "> 0",
                   IRNode.MIN_REDUCTION_V, "> 0",
                   IRNode.MIN_VI,          "> 0"},
-        applyIfCPUFeatureOr = {"sse4.1", "true", "asimd", "true"},
+        applyIfCPUFeatureOr = {"sse4.1", "true", "asimd", "true", "rvv", "true"},
         applyIf = {"AutoVectorizationOverrideProfitability", "> 0"})
     @IR(failOn = IRNode.LOAD_VECTOR_I,
         applyIf = {"AutoVectorizationOverrideProfitability", "= 0"})
@@ -1562,7 +1562,7 @@ public class TestReductions {
     @IR(counts = {IRNode.LOAD_VECTOR_I,   "> 0",
                   IRNode.MAX_REDUCTION_V, "> 0",
                   IRNode.MAX_VI,          "> 0"},
-        applyIfCPUFeatureOr = {"sse4.1", "true", "asimd", "true"},
+        applyIfCPUFeatureOr = {"sse4.1", "true", "asimd", "true", "rvv", "true"},
         applyIf = {"AutoVectorizationOverrideProfitability", "> 0"})
     @IR(failOn = IRNode.LOAD_VECTOR_I,
         applyIf = {"AutoVectorizationOverrideProfitability", "= 0"})
@@ -1580,7 +1580,7 @@ public class TestReductions {
     @IR(counts = {IRNode.LOAD_VECTOR_I,   "> 0",
                   IRNode.AND_REDUCTION_V, "> 0",
                   IRNode.AND_VI,          "> 0"},
-        applyIfCPUFeatureOr = {"sse4.1", "true", "asimd", "true"},
+        applyIfCPUFeatureOr = {"sse4.1", "true", "asimd", "true", "rvv", "true"},
         applyIf = {"AutoVectorizationOverrideProfitability", "> 0"})
     @IR(failOn = IRNode.LOAD_VECTOR_I,
         applyIf = {"AutoVectorizationOverrideProfitability", "= 0"})
@@ -1597,7 +1597,7 @@ public class TestReductions {
     @IR(counts = {IRNode.LOAD_VECTOR_I,  "> 0",
                   IRNode.OR_REDUCTION_V, "> 0",
                   IRNode.OR_VI,          "> 0"},
-        applyIfCPUFeatureOr = {"sse4.1", "true", "asimd", "true"},
+        applyIfCPUFeatureOr = {"sse4.1", "true", "asimd", "true", "rvv", "true"},
         applyIf = {"AutoVectorizationOverrideProfitability", "> 0"})
     @IR(failOn = IRNode.LOAD_VECTOR_I,
         applyIf = {"AutoVectorizationOverrideProfitability", "= 0"})
@@ -1614,7 +1614,7 @@ public class TestReductions {
     @IR(counts = {IRNode.LOAD_VECTOR_I,   "> 0",
                   IRNode.XOR_REDUCTION_V, "> 0",
                   IRNode.XOR_VI,          "> 0"},
-        applyIfCPUFeatureOr = {"sse4.1", "true", "asimd", "true"},
+        applyIfCPUFeatureOr = {"sse4.1", "true", "asimd", "true", "rvv", "true"},
         applyIf = {"AutoVectorizationOverrideProfitability", "> 0"})
     @IR(failOn = IRNode.LOAD_VECTOR_I,
         applyIf = {"AutoVectorizationOverrideProfitability", "= 0"})
@@ -1631,7 +1631,7 @@ public class TestReductions {
     @IR(counts = {IRNode.LOAD_VECTOR_I,    "> 0",
                   IRNode.ADD_REDUCTION_VI, "> 0",
                   IRNode.ADD_VI,           "> 0"},
-        applyIfCPUFeatureOr = {"sse4.1", "true", "asimd", "true"},
+        applyIfCPUFeatureOr = {"sse4.1", "true", "asimd", "true", "rvv", "true"},
         applyIf = {"AutoVectorizationOverrideProfitability", "> 0"})
     @IR(failOn = IRNode.LOAD_VECTOR_I,
         applyIf = {"AutoVectorizationOverrideProfitability", "= 0"})
@@ -1648,7 +1648,7 @@ public class TestReductions {
     @IR(counts = {IRNode.LOAD_VECTOR_I,    "> 0",
                   IRNode.MUL_REDUCTION_VI, "> 0",
                   IRNode.MUL_VI,           "> 0"},
-        applyIfCPUFeatureOr = {"sse4.1", "true", "asimd", "true"},
+        applyIfCPUFeatureOr = {"sse4.1", "true", "asimd", "true", "rvv", "true"},
         applyIf = {"AutoVectorizationOverrideProfitability", "> 0"})
     @IR(failOn = IRNode.LOAD_VECTOR_I,
         applyIf = {"AutoVectorizationOverrideProfitability", "= 0"})
@@ -1665,7 +1665,7 @@ public class TestReductions {
     @IR(counts = {IRNode.LOAD_VECTOR_I,   "> 0",
                   IRNode.MIN_REDUCTION_V, "> 0",
                   IRNode.MIN_VI,          "> 0"},
-        applyIfCPUFeatureOr = {"sse4.1", "true", "asimd", "true"},
+        applyIfCPUFeatureOr = {"sse4.1", "true", "asimd", "true", "rvv", "true"},
         applyIf = {"AutoVectorizationOverrideProfitability", "> 0"})
     @IR(failOn = IRNode.LOAD_VECTOR_I,
         applyIf = {"AutoVectorizationOverrideProfitability", "= 0"})
@@ -1682,7 +1682,7 @@ public class TestReductions {
     @IR(counts = {IRNode.LOAD_VECTOR_I,   "> 0",
                   IRNode.MAX_REDUCTION_V, "> 0",
                   IRNode.MAX_VI,          "> 0"},
-        applyIfCPUFeatureOr = {"sse4.1", "true", "asimd", "true"},
+        applyIfCPUFeatureOr = {"sse4.1", "true", "asimd", "true", "rvv", "true"},
         applyIf = {"AutoVectorizationOverrideProfitability", "> 0"})
     @IR(failOn = IRNode.LOAD_VECTOR_I,
         applyIf = {"AutoVectorizationOverrideProfitability", "= 0"})
@@ -1700,7 +1700,7 @@ public class TestReductions {
     @IR(counts = {IRNode.LOAD_VECTOR_L,   "> 0",
                   IRNode.AND_REDUCTION_V, "> 0",
                   IRNode.AND_VL,          "> 0"},
-        applyIfCPUFeatureOr = {"sse4.1", "true", "asimd", "true"},
+        applyIfCPUFeatureOr = {"sse4.1", "true", "asimd", "true", "rvv", "true"},
         applyIf = {"AutoVectorizationOverrideProfitability", "> 0"})
     @IR(failOn = IRNode.LOAD_VECTOR_L,
         applyIf = {"AutoVectorizationOverrideProfitability", "= 0"})
@@ -1717,7 +1717,7 @@ public class TestReductions {
     @IR(counts = {IRNode.LOAD_VECTOR_L,  "> 0",
                   IRNode.OR_REDUCTION_V, "> 0",
                   IRNode.OR_VL,          "> 0"},
-        applyIfCPUFeatureOr = {"sse4.1", "true", "asimd", "true"},
+        applyIfCPUFeatureOr = {"sse4.1", "true", "asimd", "true", "rvv", "true"},
         applyIf = {"AutoVectorizationOverrideProfitability", "> 0"})
     @IR(failOn = IRNode.LOAD_VECTOR_L,
         applyIf = {"AutoVectorizationOverrideProfitability", "= 0"})
@@ -1734,7 +1734,7 @@ public class TestReductions {
     @IR(counts = {IRNode.LOAD_VECTOR_L,   "> 0",
                   IRNode.XOR_REDUCTION_V, "> 0",
                   IRNode.XOR_VL,          "> 0"},
-        applyIfCPUFeatureOr = {"sse4.1", "true", "asimd", "true"},
+        applyIfCPUFeatureOr = {"sse4.1", "true", "asimd", "true", "rvv", "true"},
         applyIf = {"AutoVectorizationOverrideProfitability", "> 0"})
     @IR(failOn = IRNode.LOAD_VECTOR_L,
         applyIf = {"AutoVectorizationOverrideProfitability", "= 0"})
@@ -1751,7 +1751,7 @@ public class TestReductions {
     @IR(counts = {IRNode.LOAD_VECTOR_L,    "> 0",
                   IRNode.ADD_REDUCTION_VL, "> 0",
                   IRNode.ADD_VL,           "> 0"},
-        applyIfCPUFeatureOr = {"sse4.1", "true", "asimd", "true"},
+        applyIfCPUFeatureOr = {"sse4.1", "true", "asimd", "true", "rvv", "true"},
         applyIf = {"AutoVectorizationOverrideProfitability", "> 0"})
     @IR(failOn = IRNode.LOAD_VECTOR_L,
         applyIf = {"AutoVectorizationOverrideProfitability", "= 0"})
@@ -1799,7 +1799,7 @@ public class TestReductions {
     @IR(counts = {IRNode.LOAD_VECTOR_L,   "> 0",
                   IRNode.MIN_REDUCTION_V, "> 0",
                   IRNode.MIN_VL,          "> 0"},
-        applyIfCPUFeatureOr = {"avx512", "true", "asimd", "true"},
+        applyIfCPUFeatureOr = {"avx512", "true", "asimd", "true", "rvv", "true"},
         applyIf = {"AutoVectorizationOverrideProfitability", "> 0"})
     @IR(failOn = IRNode.LOAD_VECTOR_L,
         applyIfCPUFeatureAnd = {"avx512", "false", "avx2", "true"})
@@ -1819,7 +1819,7 @@ public class TestReductions {
     @IR(counts = {IRNode.LOAD_VECTOR_L,   "> 0",
                   IRNode.MAX_REDUCTION_V, "> 0",
                   IRNode.MAX_VL,          "> 0"},
-        applyIfCPUFeatureOr = {"avx512", "true", "asimd", "true"},
+        applyIfCPUFeatureOr = {"avx512", "true", "asimd", "true", "rvv", "true"},
         applyIf = {"AutoVectorizationOverrideProfitability", "> 0"})
     @IR(failOn = IRNode.LOAD_VECTOR_L,
         applyIfCPUFeatureAnd = {"avx512", "false", "avx2", "true"})
@@ -2207,7 +2207,7 @@ public class TestReductions {
     @IR(counts = {IRNode.LOAD_VECTOR_F,   "> 0",
                   IRNode.MIN_REDUCTION_V, "> 0",
                   IRNode.MIN_VF,          "> 0"},
-        applyIfCPUFeatureOr = {"avx", "true", "asimd", "true"},
+        applyIfCPUFeatureOr = {"avx", "true", "asimd", "true", "rvv", "true"},
         applyIf = {"AutoVectorizationOverrideProfitability", "> 0"})
     @IR(failOn = IRNode.LOAD_VECTOR_F,
         applyIf = {"AutoVectorizationOverrideProfitability", "= 0"})
@@ -2224,7 +2224,7 @@ public class TestReductions {
     @IR(counts = {IRNode.LOAD_VECTOR_F,   "> 0",
                   IRNode.MAX_REDUCTION_V, "> 0",
                   IRNode.MAX_VF,          "> 0"},
-        applyIfCPUFeatureOr = {"avx", "true", "asimd", "true"},
+        applyIfCPUFeatureOr = {"avx", "true", "asimd", "true", "rvv", "true"},
         applyIf = {"AutoVectorizationOverrideProfitability", "> 0"})
     @IR(failOn = IRNode.LOAD_VECTOR_F,
         applyIf = {"AutoVectorizationOverrideProfitability", "= 0"})
@@ -2284,7 +2284,7 @@ public class TestReductions {
     @IR(counts = {IRNode.LOAD_VECTOR_F,   "> 0",
                   IRNode.MIN_REDUCTION_V, "> 0",
                   IRNode.MIN_VF,          "> 0"},
-        applyIfCPUFeatureOr = {"avx", "true", "asimd", "true"},
+        applyIfCPUFeatureOr = {"avx", "true", "asimd", "true", "rvv", "true"},
         applyIf = {"AutoVectorizationOverrideProfitability", "> 0"})
     @IR(failOn = IRNode.LOAD_VECTOR_F,
         applyIf = {"AutoVectorizationOverrideProfitability", "= 0"})
@@ -2301,7 +2301,7 @@ public class TestReductions {
     @IR(counts = {IRNode.LOAD_VECTOR_F,   "> 0",
                   IRNode.MAX_REDUCTION_V, "> 0",
                   IRNode.MAX_VF,          "> 0"},
-        applyIfCPUFeatureOr = {"avx", "true", "asimd", "true"},
+        applyIfCPUFeatureOr = {"avx", "true", "asimd", "true", "rvv", "true"},
         applyIf = {"AutoVectorizationOverrideProfitability", "> 0"})
     @IR(failOn = IRNode.LOAD_VECTOR_F,
         applyIf = {"AutoVectorizationOverrideProfitability", "= 0"})
@@ -2361,7 +2361,7 @@ public class TestReductions {
     @IR(counts = {IRNode.LOAD_VECTOR_F,   "> 0",
                   IRNode.MIN_REDUCTION_V, "> 0",
                   IRNode.MIN_VF,          "> 0"},
-        applyIfCPUFeatureOr = {"avx", "true", "asimd", "true"},
+        applyIfCPUFeatureOr = {"avx", "true", "asimd", "true", "rvv", "true"},
         applyIf = {"AutoVectorizationOverrideProfitability", "> 0"})
     @IR(failOn = IRNode.LOAD_VECTOR_F,
         applyIf = {"AutoVectorizationOverrideProfitability", "= 0"})
@@ -2378,7 +2378,7 @@ public class TestReductions {
     @IR(counts = {IRNode.LOAD_VECTOR_F,   "> 0",
                   IRNode.MAX_REDUCTION_V, "> 0",
                   IRNode.MAX_VF,          "> 0"},
-        applyIfCPUFeatureOr = {"avx", "true", "asimd", "true"},
+        applyIfCPUFeatureOr = {"avx", "true", "asimd", "true", "rvv", "true"},
         applyIf = {"AutoVectorizationOverrideProfitability", "> 0"})
     @IR(failOn = IRNode.LOAD_VECTOR_F,
         applyIf = {"AutoVectorizationOverrideProfitability", "= 0"})
@@ -2444,7 +2444,7 @@ public class TestReductions {
     @IR(counts = {IRNode.LOAD_VECTOR_D,   "> 0",
                   IRNode.MIN_REDUCTION_V, "> 0",
                   IRNode.MIN_VD,          "> 0"},
-        applyIfCPUFeatureOr = {"avx", "true", "asimd", "true"},
+        applyIfCPUFeatureOr = {"avx", "true", "asimd", "true", "rvv", "true"},
         applyIf = {"AutoVectorizationOverrideProfitability", "> 0"})
     @IR(failOn = IRNode.LOAD_VECTOR_D,
         applyIf = {"AutoVectorizationOverrideProfitability", "= 0"})
@@ -2461,7 +2461,7 @@ public class TestReductions {
     @IR(counts = {IRNode.LOAD_VECTOR_D,   "> 0",
                   IRNode.MAX_REDUCTION_V, "> 0",
                   IRNode.MAX_VD,          "> 0"},
-        applyIfCPUFeatureOr = {"avx", "true", "asimd", "true"},
+        applyIfCPUFeatureOr = {"avx", "true", "asimd", "true", "rvv", "true"},
         applyIf = {"AutoVectorizationOverrideProfitability", "> 0"})
     @IR(failOn = IRNode.LOAD_VECTOR_D,
         applyIf = {"AutoVectorizationOverrideProfitability", "= 0"})
@@ -2521,7 +2521,7 @@ public class TestReductions {
     @IR(counts = {IRNode.LOAD_VECTOR_D,   "> 0",
                   IRNode.MIN_REDUCTION_V, "> 0",
                   IRNode.MIN_VD,          "> 0"},
-        applyIfCPUFeatureOr = {"avx", "true", "asimd", "true"},
+        applyIfCPUFeatureOr = {"avx", "true", "asimd", "true", "rvv", "true"},
         applyIf = {"AutoVectorizationOverrideProfitability", "> 0"})
     @IR(failOn = IRNode.LOAD_VECTOR_D,
         applyIf = {"AutoVectorizationOverrideProfitability", "= 0"})
@@ -2538,7 +2538,7 @@ public class TestReductions {
     @IR(counts = {IRNode.LOAD_VECTOR_D,   "> 0",
                   IRNode.MAX_REDUCTION_V, "> 0",
                   IRNode.MAX_VD,          "> 0"},
-        applyIfCPUFeatureOr = {"avx", "true", "asimd", "true"},
+        applyIfCPUFeatureOr = {"avx", "true", "asimd", "true", "rvv", "true"},
         applyIf = {"AutoVectorizationOverrideProfitability", "> 0"})
     @IR(failOn = IRNode.LOAD_VECTOR_D,
         applyIf = {"AutoVectorizationOverrideProfitability", "= 0"})
@@ -2598,7 +2598,7 @@ public class TestReductions {
     @IR(counts = {IRNode.LOAD_VECTOR_D,   "> 0",
                   IRNode.MIN_REDUCTION_V, "> 0",
                   IRNode.MIN_VD,          "> 0"},
-        applyIfCPUFeatureOr = {"avx", "true", "asimd", "true"},
+        applyIfCPUFeatureOr = {"avx", "true", "asimd", "true", "rvv", "true"},
         applyIf = {"AutoVectorizationOverrideProfitability", "> 0"})
     @IR(failOn = IRNode.LOAD_VECTOR_D,
         applyIf = {"AutoVectorizationOverrideProfitability", "= 0"})
@@ -2615,7 +2615,7 @@ public class TestReductions {
     @IR(counts = {IRNode.LOAD_VECTOR_D,   "> 0",
                   IRNode.MAX_REDUCTION_V, "> 0",
                   IRNode.MAX_VD,          "> 0"},
-        applyIfCPUFeatureOr = {"avx", "true", "asimd", "true"},
+        applyIfCPUFeatureOr = {"avx", "true", "asimd", "true", "rvv", "true"},
         applyIf = {"AutoVectorizationOverrideProfitability", "> 0"})
     @IR(failOn = IRNode.LOAD_VECTOR_D,
         applyIf = {"AutoVectorizationOverrideProfitability", "= 0"})

From 86800eb2b34bd6ea7a77e7a9ac2f7dbce89c11fb Mon Sep 17 00:00:00 2001
From: Justin Lu <jlu@openjdk.org>
Date: Tue, 3 Mar 2026 17:11:17 +0000
Subject: [PATCH 014/655] 8378723: Locale variant delimiter is unclear

Reviewed-by: naoto
---
 src/java.base/share/classes/java/util/Locale.java | 7 +++++--
 1 file changed, 5 insertions(+), 2 deletions(-)

diff --git a/src/java.base/share/classes/java/util/Locale.java b/src/java.base/share/classes/java/util/Locale.java
index f45a52c14fa..682476d8082 100644
--- a/src/java.base/share/classes/java/util/Locale.java
+++ b/src/java.base/share/classes/java/util/Locale.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1996, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1996, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -176,7 +176,10 @@ import sun.util.locale.provider.TimeZoneNameUtility;
  *   SUBTAG (('_'|'-') SUBTAG)*} where {@code SUBTAG =
  *   [0-9][0-9a-zA-Z]{3} | [0-9a-zA-Z]{5,8}}.</dd>
  *   <dd> <em>BCP 47 deviation:</em> BCP 47 only
- *   uses hyphen ('-') as a delimiter, {@code Locale} is more lenient.</dd>
+ *   uses hyphen ('-') as a delimiter and APIs provided by {@code Locale} which accept
+ *   BCP 47 language tags expect as such. However, for backwards compatibility,
+ *   {@link Locale.Builder#setVariant(String)} also accepts underscore ('_').
+ *   {@link Locale#of(String, String, String)} accepts only underscore ('_').</dd>
  *
  *   <dd> <em>Example:</em> "polyton" (Polytonic Greek), "POSIX"</dd>
  *

From c13fdc044d188d2266b2a96c4d1803b014a00633 Mon Sep 17 00:00:00 2001
From: Alexey Semenyuk <asemenyuk@openjdk.org>
Date: Tue, 3 Mar 2026 19:09:03 +0000
Subject: [PATCH 015/655] 8378877: jpackage: improve rebranding of exe files on
 Windows

Reviewed-by: almatvee
---
 .../internal/ExecutableRebrander.java         | 142 +++++++++++-------
 .../jpackage/internal/WindowsDefender.java    |  72 ---------
 .../jpackage/internal/WindowsRegistry.java    | 130 ----------------
 .../resources/WinResources.properties         |   1 -
 4 files changed, 87 insertions(+), 258 deletions(-)
 delete mode 100644 src/jdk.jpackage/windows/classes/jdk/jpackage/internal/WindowsDefender.java
 delete mode 100644 src/jdk.jpackage/windows/classes/jdk/jpackage/internal/WindowsRegistry.java

diff --git a/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/ExecutableRebrander.java b/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/ExecutableRebrander.java
index 05b87e6f449..ec2a96d4c7d 100644
--- a/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/ExecutableRebrander.java
+++ b/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/ExecutableRebrander.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2020, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -40,9 +40,11 @@ import java.util.Map;
 import java.util.Objects;
 import java.util.Optional;
 import java.util.Properties;
+import java.util.concurrent.TimeUnit;
 import java.util.function.Function;
 import java.util.stream.Stream;
 import jdk.jpackage.internal.model.DottedVersion;
+import jdk.jpackage.internal.model.JPackageException;
 import jdk.jpackage.internal.model.WinApplication;
 import jdk.jpackage.internal.model.WinExePackage;
 import jdk.jpackage.internal.model.WinLauncher;
@@ -74,11 +76,11 @@ final class ExecutableRebrander {
 
         this.props = new HashMap<>();
 
-        validateValueAndPut(this.props, Map.entry("COMPANY_NAME", props.vendor), "vendor");
-        validateValueAndPut(this.props, Map.entry("FILE_DESCRIPTION",props.description), "description");
-        validateValueAndPut(this.props, Map.entry("FILE_VERSION", props.version.toString()), "version");
-        validateValueAndPut(this.props, Map.entry("LEGAL_COPYRIGHT", props.copyright), "copyright");
-        validateValueAndPut(this.props, Map.entry("PRODUCT_NAME", props.name), "name");
+        this.props.put("COMPANY_NAME", validateSingleLine(props.vendor));
+        this.props.put("FILE_DESCRIPTION", validateSingleLine(props.description));
+        this.props.put("FILE_VERSION", validateSingleLine(props.version.toString()));
+        this.props.put("LEGAL_COPYRIGHT", validateSingleLine(props.copyright));
+        this.props.put("PRODUCT_NAME", validateSingleLine(props.name));
 
         this.props.put("FIXEDFILEINFO_FILE_VERSION", toFixedFileVersion(props.version));
         this.props.put("INTERNAL_NAME", props.executableName);
@@ -90,7 +92,7 @@ final class ExecutableRebrander {
 
         UpdateResourceAction versionSwapper = resourceLock -> {
             if (versionSwap(resourceLock, propsArray) != 0) {
-                throw I18N.buildException().message("error.version-swap", target).create(RuntimeException::new);
+                throw new JPackageException(I18N.format("error.version-swap", target));
             }
         };
 
@@ -100,7 +102,7 @@ final class ExecutableRebrander {
                 .map(absIcon -> {
                     return resourceLock -> {
                         if (iconSwap(resourceLock, absIcon.toString()) != 0) {
-                            throw I18N.buildException().message("error.icon-swap", absIcon).create(RuntimeException::new);
+                            throw new JPackageException(I18N.format("error.icon-swap", absIcon));
                         }
                     };
                 });
@@ -118,43 +120,58 @@ final class ExecutableRebrander {
 
     private static void rebrandExecutable(BuildEnv env, final Path target,
             List<UpdateResourceAction> actions) throws IOException {
+
+        Objects.requireNonNull(env);
+        Objects.requireNonNull(target);
         Objects.requireNonNull(actions);
         actions.forEach(Objects::requireNonNull);
 
-        String tempDirectory = env.buildRoot().toAbsolutePath().toString();
-        if (WindowsDefender.isThereAPotentialWindowsDefenderIssue(tempDirectory)) {
-            Log.verbose(I18N.format("message.potential.windows.defender.issue", tempDirectory));
-        }
-
-        var shortTargetPath = ShortPathUtils.toShortPath(target);
-        long resourceLock = lockResource(shortTargetPath.orElse(target).toString());
-        if (resourceLock == 0) {
-            throw I18N.buildException().message("error.lock-resource", shortTargetPath.orElse(target)).create(RuntimeException::new);
-        }
-
-        final boolean resourceUnlockedSuccess;
         try {
-            for (var action : actions) {
-                action.editResource(resourceLock);
-            }
-        } finally {
-            if (resourceLock == 0) {
-                resourceUnlockedSuccess = true;
-            } else {
-                resourceUnlockedSuccess = unlockResource(resourceLock);
-                if (shortTargetPath.isPresent()) {
-                    // Windows will rename the executable in the unlock operation.
-                    // Should restore executable's name.
-                    var tmpPath = target.getParent().resolve(
-                            target.getFileName().toString() + ".restore");
-                    Files.move(shortTargetPath.get(), tmpPath);
-                    Files.move(tmpPath, target);
-                }
-            }
-        }
+            Globals.instance().objectFactory().<Void, RuntimeException>retryExecutor(RuntimeException.class).setExecutable(() -> {
 
-        if (!resourceUnlockedSuccess) {
-            throw I18N.buildException().message("error.unlock-resource", target).create(RuntimeException::new);
+                var shortTargetPath = ShortPathUtils.toShortPath(target);
+                long resourceLock = lockResource(shortTargetPath.orElse(target).toString());
+                if (resourceLock == 0) {
+                    throw new JPackageException(I18N.format("error.lock-resource", shortTargetPath.orElse(target)));
+                }
+
+                final boolean resourceUnlockedSuccess;
+                try {
+                    for (var action : actions) {
+                        try {
+                            action.editResource(resourceLock);
+                        } catch (IOException ex) {
+                            throw new UncheckedIOException(ex);
+                        }
+                    }
+                } finally {
+                    if (resourceLock == 0) {
+                        resourceUnlockedSuccess = true;
+                    } else {
+                        resourceUnlockedSuccess = unlockResource(resourceLock);
+                        if (shortTargetPath.isPresent()) {
+                            // Windows will rename the executable in the unlock operation.
+                            // Should restore executable's name.
+                            var tmpPath = target.getParent().resolve(
+                                    target.getFileName().toString() + ".restore");
+                            try {
+                                Files.move(shortTargetPath.get(), tmpPath);
+                                Files.move(tmpPath, target);
+                            } catch (IOException ex) {
+                                throw new UncheckedIOException(ex);
+                            }
+                        }
+                    }
+                }
+
+                if (!resourceUnlockedSuccess) {
+                    throw new JPackageException(I18N.format("error.unlock-resource", shortTargetPath.orElse(target)));
+                }
+
+                return null;
+            }).setMaxAttemptsCount(5).setAttemptTimeout(3, TimeUnit.SECONDS).execute();
+        } catch (UncheckedIOException ex) {
+            throw ex.getCause();
         }
     }
 
@@ -197,14 +214,13 @@ final class ExecutableRebrander {
         }
     }
 
-    private static void validateValueAndPut(Map<String, String> target,
-            Map.Entry<String, String> e, String label) {
-        if (e.getValue().contains("\r") || e.getValue().contains("\n")) {
-            Log.error("Configuration parameter " + label
-                    + " contains multiple lines of text, ignore it");
-            e = Map.entry(e.getKey(), "");
+    private static String validateSingleLine(String v) {
+        Objects.requireNonNull(v);
+        if (v.contains("\r") || v.contains("\n")) {
+            throw new IllegalArgumentException("Configuration parameter contains multiple lines of text");
+        } else {
+            return v;
         }
-        target.put(e.getKey(), e.getValue());
     }
 
     @FunctionalInterface
@@ -212,19 +228,35 @@ final class ExecutableRebrander {
         public void editResource(long resourceLock) throws IOException;
     }
 
-    private static record ExecutableProperties(String vendor, String description,
+    private record ExecutableProperties(String vendor, String description,
             DottedVersion version, String copyright, String name, String executableName) {
-        static ExecutableProperties create(WinApplication app,
-                WinLauncher launcher) {
-            return new ExecutableProperties(app.vendor(), launcher.description(),
-                    app.winVersion(), app.copyright(), launcher.name(),
+
+        ExecutableProperties {
+            Objects.requireNonNull(vendor);
+            Objects.requireNonNull(description);
+            Objects.requireNonNull(version);
+            Objects.requireNonNull(copyright);
+            Objects.requireNonNull(name);
+            Objects.requireNonNull(executableName);
+        }
+
+        static ExecutableProperties create(WinApplication app, WinLauncher launcher) {
+            return new ExecutableProperties(
+                    app.vendor(),
+                    launcher.description(),
+                    app.winVersion(),
+                    app.copyright(),
+                    launcher.name(),
                     launcher.executableNameWithSuffix());
         }
 
         static ExecutableProperties create(WinExePackage pkg) {
-            return new ExecutableProperties(pkg.app().vendor(),
-                    pkg.description(), DottedVersion.lazy(pkg.version()),
-                    pkg.app().copyright(), pkg.packageName(),
+            return new ExecutableProperties(
+                    pkg.app().vendor(),
+                    pkg.description(),
+                    DottedVersion.lazy(pkg.version()),
+                    pkg.app().copyright(),
+                    pkg.packageName(),
                     pkg.packageFileNameWithSuffix());
         }
     }
diff --git a/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/WindowsDefender.java b/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/WindowsDefender.java
deleted file mode 100644
index 075d87bcbca..00000000000
--- a/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/WindowsDefender.java
+++ /dev/null
@@ -1,72 +0,0 @@
-/*
- * Copyright (c) 2012, 2023, Oracle and/or its affiliates. All rights reserved.
- * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
- *
- * This code is free software; you can redistribute it and/or modify it
- * under the terms of the GNU General Public License version 2 only, as
- * published by the Free Software Foundation.  Oracle designates this
- * particular file as subject to the "Classpath" exception as provided
- * by Oracle in the LICENSE file that accompanied this code.
- *
- * This code is distributed in the hope that it will be useful, but WITHOUT
- * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
- * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
- * version 2 for more details (a copy is included in the LICENSE file that
- * accompanied this code).
- *
- * You should have received a copy of the GNU General Public License version
- * 2 along with this work; if not, write to the Free Software Foundation,
- * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
- *
- * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
- * or visit www.oracle.com if you need additional information or have any
- * questions.
- */
-
-package jdk.jpackage.internal;
-
-import java.util.List;
-import jdk.internal.util.OperatingSystem;
-import jdk.internal.util.OSVersion;
-
-final class WindowsDefender {
-
-    private WindowsDefender() {}
-
-    static final boolean isThereAPotentialWindowsDefenderIssue(String dir) {
-        boolean result = false;
-
-        if (OperatingSystem.isWindows() &&
-                OSVersion.current().major() == 10) {
-
-            // If DisableRealtimeMonitoring is not enabled then there
-            // may be a problem.
-            if (!WindowsRegistry.readDisableRealtimeMonitoring() &&
-                !isDirectoryInExclusionPath(dir)) {
-                result = true;
-            }
-        }
-
-        return result;
-    }
-
-    private static boolean isDirectoryInExclusionPath(String dir) {
-        boolean result = false;
-        // If the user temp directory is not found in the exclusion
-        // list then there may be a problem.
-        List<String> paths = WindowsRegistry.readExclusionsPaths();
-        for (String s : paths) {
-            if (WindowsRegistry.comparePaths(s, dir)) {
-                result = true;
-                break;
-            }
-        }
-
-        return result;
-    }
-
-    static final String getUserTempDirectory() {
-        String tempDirectory = System.getProperty("java.io.tmpdir");
-        return tempDirectory;
-    }
-}
diff --git a/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/WindowsRegistry.java b/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/WindowsRegistry.java
deleted file mode 100644
index 7eb7b922667..00000000000
--- a/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/WindowsRegistry.java
+++ /dev/null
@@ -1,130 +0,0 @@
-/*
- * Copyright (c) 2012, 2024, Oracle and/or its affiliates. All rights reserved.
- * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
- *
- * This code is free software; you can redistribute it and/or modify it
- * under the terms of the GNU General Public License version 2 only, as
- * published by the Free Software Foundation.  Oracle designates this
- * particular file as subject to the "Classpath" exception as provided
- * by Oracle in the LICENSE file that accompanied this code.
- *
- * This code is distributed in the hope that it will be useful, but WITHOUT
- * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
- * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
- * version 2 for more details (a copy is included in the LICENSE file that
- * accompanied this code).
- *
- * You should have received a copy of the GNU General Public License version
- * 2 along with this work; if not, write to the Free Software Foundation,
- * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
- *
- * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
- * or visit www.oracle.com if you need additional information or have any
- * questions.
- */
-
-package jdk.jpackage.internal;
-
-import java.util.ArrayList;
-import java.util.List;
-
-@SuppressWarnings("restricted")
-final class WindowsRegistry {
-
-    // Currently we only support HKEY_LOCAL_MACHINE. Native implementation will
-    // require support for additinal HKEY if needed.
-    private static final int HKEY_LOCAL_MACHINE = 1;
-
-    static {
-        System.loadLibrary("jpackage");
-    }
-
-    private WindowsRegistry() {}
-
-    /**
-     * Reads the registry value for DisableRealtimeMonitoring.
-     * @return true if DisableRealtimeMonitoring is set to 0x1,
-     *         false otherwise.
-     */
-    static final boolean readDisableRealtimeMonitoring() {
-        final String subKey = "Software\\Microsoft\\"
-                  + "Windows Defender\\Real-Time Protection";
-        final String value = "DisableRealtimeMonitoring";
-        int result = readDwordValue(HKEY_LOCAL_MACHINE, subKey, value, 0);
-        return (result == 1);
-    }
-
-    static final List<String> readExclusionsPaths() {
-        List<String> result = new ArrayList<>();
-        final String subKey = "Software\\Microsoft\\"
-                + "Windows Defender\\Exclusions\\Paths";
-        long lKey = openRegistryKey(HKEY_LOCAL_MACHINE, subKey);
-        if (lKey == 0) {
-            return result;
-        }
-
-        String valueName;
-        int index = 0;
-        do {
-            valueName = enumRegistryValue(lKey, index);
-            if (valueName != null) {
-                result.add(valueName);
-                index++;
-            }
-        } while (valueName != null);
-
-        closeRegistryKey(lKey);
-
-        return result;
-    }
-
-    /**
-     * Reads DWORD registry value.
-     *
-     * @param key one of HKEY predefine value
-     * @param subKey registry sub key
-     * @param value value to read
-     * @param defaultValue default value in case if subKey or value not found
-     *                     or any other errors occurred
-     * @return value's data only if it was read successfully, otherwise
-     *         defaultValue
-     */
-    private static native int readDwordValue(int key, String subKey,
-            String value, int defaultValue);
-
-    /**
-     * Open registry key.
-     *
-     * @param key one of HKEY predefine value
-     * @param subKey registry sub key
-     * @return native handle to open key
-     */
-    private static native long openRegistryKey(int key, String subKey);
-
-    /**
-     * Enumerates the values for registry key.
-     *
-     * @param lKey native handle to open key returned by openRegistryKey
-     * @param index index of value starting from 0. Increment until this
-     *              function returns NULL which means no more values.
-     * @return returns value or NULL if error or no more data
-     */
-    private static native String enumRegistryValue(long lKey, int index);
-
-    /**
-     * Close registry key.
-     *
-     * @param lKey native handle to open key returned by openRegistryKey
-     */
-    private static native void closeRegistryKey(long lKey);
-
-    /**
-     * Compares two Windows paths regardless case and if paths
-     * are short or long.
-     *
-     * @param path1 path to compare
-     * @param path2 path to compare
-     * @return true if paths point to same location
-     */
-    public static native boolean comparePaths(String path1, String path2);
-}
diff --git a/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/resources/WinResources.properties b/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/resources/WinResources.properties
index 38d0bd02bbb..13a6c989324 100644
--- a/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/resources/WinResources.properties
+++ b/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/resources/WinResources.properties
@@ -55,7 +55,6 @@ error.missing-service-installer='service-installer.exe' service installer not fo
 error.missing-service-installer.advice=Add 'service-installer.exe' service installer to the resource directory
 
 message.icon-not-ico=The specified icon "{0}" is not an ICO file and will not be used. The default icon will be used in it's place.
-message.potential.windows.defender.issue=Warning: Windows Defender may prevent jpackage from functioning. If there is an issue, it can be addressed by either disabling realtime monitoring, or adding an exclusion for the directory "{0}".
 message.tool-version=Detected [{0}] version [{1}].
 message.wrong-tool-version=Detected [{0}] version {1} but version {2} is required.
 message.use-wix36-features=WiX {0} detected. Enabling advanced cleanup action.

From a6db3f870218bc016ecc67e3f5e142d6491ac080 Mon Sep 17 00:00:00 2001
From: Alexey Semenyuk <asemenyuk@openjdk.org>
Date: Tue, 3 Mar 2026 19:11:11 +0000
Subject: [PATCH 016/655] 8378873: jpackage: remove macOS-specific code from
 jdk.jpackage.internal.ModuleInfo

Reviewed-by: almatvee
---
 .../jdk/jpackage/internal/FromOptions.java     | 18 +++++++++++++++++-
 .../jdk/jpackage/internal/ModuleInfo.java      | 15 ++-------------
 2 files changed, 19 insertions(+), 14 deletions(-)

diff --git a/src/jdk.jpackage/share/classes/jdk/jpackage/internal/FromOptions.java b/src/jdk.jpackage/share/classes/jdk/jpackage/internal/FromOptions.java
index cccd05792d6..4f590850328 100644
--- a/src/jdk.jpackage/share/classes/jdk/jpackage/internal/FromOptions.java
+++ b/src/jdk.jpackage/share/classes/jdk/jpackage/internal/FromOptions.java
@@ -49,6 +49,7 @@ import java.nio.file.Path;
 import java.util.Collection;
 import java.util.List;
 import java.util.Map;
+import java.util.Objects;
 import java.util.Optional;
 import java.util.Set;
 import java.util.function.BiFunction;
@@ -149,6 +150,13 @@ final class FromOptions {
             ApplicationLayout appLayout, RuntimeLayout runtimeLayout,
             Optional<RuntimeLayout> predefinedRuntimeLayout) {
 
+        Objects.requireNonNull(options);
+        Objects.requireNonNull(launcherCtor);
+        Objects.requireNonNull(launcherOverrideCtor);
+        Objects.requireNonNull(appLayout);
+        Objects.requireNonNull(runtimeLayout);
+        Objects.requireNonNull(predefinedRuntimeLayout);
+
         final var appBuilder = new ApplicationBuilder();
 
         final var isRuntimeInstaller = isRuntimeInstaller(options);
@@ -185,7 +193,15 @@ final class FromOptions {
         } else {
             appBuilder.appImageLayout(appLayout);
 
-            final var launchers = createLaunchers(options, launcherCtor);
+            // Adjust the value of the PREDEFINED_RUNTIME_IMAGE option to make it reference
+            // a directory with the standard Java runtime structure.
+            final var launcherOptions = predefinedRuntimeDirectory.filter(v -> {
+                return !predefinedRuntimeImage.get().equals(v);
+            }).map(v -> {
+                return Options.of(Map.of(PREDEFINED_RUNTIME_IMAGE, v)).copyWithParent(options);
+            }).orElse(options);
+
+            final var launchers = createLaunchers(launcherOptions, launcherCtor);
 
             if (PREDEFINED_APP_IMAGE.containsIn(options)) {
                 appBuilder.launchers(launchers);
diff --git a/src/jdk.jpackage/share/classes/jdk/jpackage/internal/ModuleInfo.java b/src/jdk.jpackage/share/classes/jdk/jpackage/internal/ModuleInfo.java
index 590321d5e86..71d1a66659e 100644
--- a/src/jdk.jpackage/share/classes/jdk/jpackage/internal/ModuleInfo.java
+++ b/src/jdk.jpackage/share/classes/jdk/jpackage/internal/ModuleInfo.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2025, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -35,7 +35,6 @@ import java.util.List;
 import java.util.Objects;
 import java.util.Optional;
 import java.util.Properties;
-import jdk.internal.util.OperatingSystem;
 
 record ModuleInfo(String name, Optional<String> version, Optional<String> mainClass, Optional<URI> location) {
 
@@ -61,17 +60,7 @@ record ModuleInfo(String name, Optional<String> version, Optional<String> mainCl
         // is linked in the runtime by simply analysing the data
         // of `release` file.
 
-        final Path releaseFile;
-        if (!OperatingSystem.isMacOS()) {
-            releaseFile = cookedRuntime.resolve("release");
-        } else {
-            // On Mac `cookedRuntime` can be runtime root or runtime home.
-            Path runtimeHome = cookedRuntime.resolve("Contents/Home");
-            if (!Files.isDirectory(runtimeHome)) {
-                runtimeHome = cookedRuntime;
-            }
-            releaseFile = runtimeHome.resolve("release");
-        }
+        final Path releaseFile = cookedRuntime.resolve("release");
 
         try (Reader reader = Files.newBufferedReader(releaseFile)) {
             Properties props = new Properties();

From 73363a0cb501eb10f5be4a6a283b20da58b1950d Mon Sep 17 00:00:00 2001
From: Alexey Semenyuk <asemenyuk@openjdk.org>
Date: Tue, 3 Mar 2026 21:53:20 +0000
Subject: [PATCH 017/655] 8378874: jpackage: remove redundant messages

Reviewed-by: almatvee
---
 .../jdk/jpackage/internal/MacPkgPackager.java       |  6 ------
 .../internal/resources/MacResources.properties      |  1 -
 .../jdk/jpackage/internal/WinMsiPackager.java       |  3 ---
 .../internal/WixAppImageFragmentBuilder.java        | 13 +------------
 .../jdk/jpackage/internal/WixFragmentBuilder.java   |  9 ++-------
 .../internal/resources/WinResources.properties      |  1 -
 6 files changed, 3 insertions(+), 30 deletions(-)

diff --git a/src/jdk.jpackage/macosx/classes/jdk/jpackage/internal/MacPkgPackager.java b/src/jdk.jpackage/macosx/classes/jdk/jpackage/internal/MacPkgPackager.java
index fc5c85c699c..369ab201611 100644
--- a/src/jdk.jpackage/macosx/classes/jdk/jpackage/internal/MacPkgPackager.java
+++ b/src/jdk.jpackage/macosx/classes/jdk/jpackage/internal/MacPkgPackager.java
@@ -51,7 +51,6 @@ import javax.xml.transform.dom.DOMSource;
 import javax.xml.transform.stream.StreamResult;
 import javax.xml.transform.stream.StreamSource;
 import jdk.internal.util.Architecture;
-import jdk.internal.util.OSVersion;
 import jdk.jpackage.internal.PackagingPipeline.PackageTaskID;
 import jdk.jpackage.internal.PackagingPipeline.TaskID;
 import jdk.jpackage.internal.model.MacPkgPackage;
@@ -509,11 +508,6 @@ record MacPkgPackager(BuildEnv env, MacPkgPackage pkg, Optional<Services> servic
 
         // maybe sign
         if (pkg.sign()) {
-            if (OSVersion.current().compareTo(new OSVersion(10, 12)) >= 0) {
-                // we need this for OS X 10.12+
-                Log.verbose(I18N.getString("message.signing.pkg"));
-            }
-
             final var pkgSigningConfig = pkg.signingConfig().orElseThrow();
 
             commandLine.add("--sign");
diff --git a/src/jdk.jpackage/macosx/classes/jdk/jpackage/internal/resources/MacResources.properties b/src/jdk.jpackage/macosx/classes/jdk/jpackage/internal/resources/MacResources.properties
index 3aebdc39d41..90c4162b80e 100644
--- a/src/jdk.jpackage/macosx/classes/jdk/jpackage/internal/resources/MacResources.properties
+++ b/src/jdk.jpackage/macosx/classes/jdk/jpackage/internal/resources/MacResources.properties
@@ -61,7 +61,6 @@ message.invalid-identifier.advice=specify identifier with "--mac-package-identif
 message.preparing-dmg-setup=Preparing dmg setup: {0}.
 message.preparing-scripts=Preparing package scripts.
 message.preparing-distribution-dist=Preparing distribution.dist: {0}.
-message.signing.pkg=Warning: For signing PKG, you might need to set "Always Trust" for your certificate using "Keychain Access" tool.
 message.setfile.dmg=Setting custom icon on DMG file skipped because 'SetFile' utility was not found. Installing Xcode with Command Line Tools should resolve this issue.
 message.codesign.failed.reason.app.content="codesign" failed and additional application content was supplied via the "--app-content" parameter. Probably the additional content broke the integrity of the application bundle and caused the failure. Ensure content supplied via the "--app-content" parameter does not break the integrity of the application bundle, or add it in the post-processing step.
 message.codesign.failed.reason.xcode.tools=Possible reason for "codesign" failure is missing Xcode with command line developer tools. Install Xcode with command line developer tools to see if it resolves the problem.
diff --git a/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/WinMsiPackager.java b/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/WinMsiPackager.java
index c72b14a76d5..a53d083847a 100644
--- a/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/WinMsiPackager.java
+++ b/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/WinMsiPackager.java
@@ -151,9 +151,6 @@ final class WinMsiPackager implements Consumer<PackagingPipeline.Builder> {
 
         wixFragments.forEach(wixFragment -> wixFragment.setWixVersion(wixToolset.getVersion(),
                 wixToolset.getType()));
-
-        wixFragments.stream().map(WixFragmentBuilder::getLoggableWixFeatures).flatMap(
-                List::stream).distinct().toList().forEach(Log::verbose);
     }
 
     WinMsiPackager(BuildEnv env, WinMsiPackage pkg, Path outputDir, WinSystemEnvironment sysEnv) {
diff --git a/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/WixAppImageFragmentBuilder.java b/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/WixAppImageFragmentBuilder.java
index 0dff5c26ae2..ac7af873739 100644
--- a/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/WixAppImageFragmentBuilder.java
+++ b/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/WixAppImageFragmentBuilder.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2019, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2019, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -31,7 +31,6 @@ import static jdk.jpackage.internal.util.CollectionUtils.toCollection;
 import java.io.IOException;
 import java.nio.charset.StandardCharsets;
 import java.nio.file.Path;
-import java.text.MessageFormat;
 import java.util.ArrayList;
 import java.util.Collection;
 import java.util.Comparator;
@@ -142,16 +141,6 @@ final class WixAppImageFragmentBuilder extends WixFragmentBuilder {
         super.addFilesToConfigRoot();
     }
 
-    @Override
-    List<String> getLoggableWixFeatures() {
-        if (isWithWix36Features()) {
-            return List.of(MessageFormat.format(I18N.getString("message.use-wix36-features"),
-                    getWixVersion()));
-        } else {
-            return List.of();
-        }
-    }
-
     @Override
     protected Collection<XmlConsumer> getFragmentWriters() {
         return List.of(
diff --git a/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/WixFragmentBuilder.java b/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/WixFragmentBuilder.java
index 4d180a94871..46894699d98 100644
--- a/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/WixFragmentBuilder.java
+++ b/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/WixFragmentBuilder.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2021, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2021, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -30,19 +30,18 @@ import java.lang.reflect.Method;
 import java.lang.reflect.Proxy;
 import java.nio.file.Path;
 import java.util.Collection;
-import java.util.List;
 import java.util.Map;
 import java.util.Objects;
 import java.util.Optional;
 import java.util.regex.Matcher;
 import java.util.regex.Pattern;
 import javax.xml.stream.XMLStreamWriter;
-import jdk.jpackage.internal.util.XmlConsumer;
 import jdk.internal.util.Architecture;
 import jdk.jpackage.internal.WixSourceConverter.ResourceGroup;
 import jdk.jpackage.internal.WixToolset.WixToolsetType;
 import jdk.jpackage.internal.model.DottedVersion;
 import jdk.jpackage.internal.model.WinMsiPackage;
+import jdk.jpackage.internal.util.XmlConsumer;
 import jdk.jpackage.internal.util.XmlUtils;
 
 /**
@@ -72,10 +71,6 @@ abstract class WixFragmentBuilder {
         fragmentResource = env.createResource(defaultResourceName).setPublicName(outputFileName);
     }
 
-    List<String> getLoggableWixFeatures() {
-        return List.of();
-    }
-
     void configureWixPipeline(WixPipeline.Builder wixPipeline) {
         wixPipeline.addSource(configRoot.resolve(outputFileName),
                 Optional.ofNullable(wixVariables).map(WixVariables::getValues).orElse(
diff --git a/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/resources/WinResources.properties b/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/resources/WinResources.properties
index 13a6c989324..0f3dcab8260 100644
--- a/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/resources/WinResources.properties
+++ b/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/resources/WinResources.properties
@@ -57,7 +57,6 @@ error.missing-service-installer.advice=Add 'service-installer.exe' service insta
 message.icon-not-ico=The specified icon "{0}" is not an ICO file and will not be used. The default icon will be used in it's place.
 message.tool-version=Detected [{0}] version [{1}].
 message.wrong-tool-version=Detected [{0}] version {1} but version {2} is required.
-message.use-wix36-features=WiX {0} detected. Enabling advanced cleanup action.
 message.product-code=MSI ProductCode: {0}.
 message.upgrade-code=MSI UpgradeCode: {0}.
 message.preparing-msi-config=Preparing MSI config: {0}.

From 0729d1d82207de856fdd8d2fe2a2ea4a0b8694a2 Mon Sep 17 00:00:00 2001
From: Yasumasa Suenaga <ysuenaga@openjdk.org>
Date: Wed, 4 Mar 2026 00:36:08 +0000
Subject: [PATCH 018/655] 8379039: Build failure on vector API source
 generation after JDK-8378312

Reviewed-by: jbhateja, psandoz
---
 .../share/classes/jdk/incubator/vector/X-Vector.java.template | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/X-Vector.java.template b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/X-Vector.java.template
index d6763c2c03a..95fe8ca35db 100644
--- a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/X-Vector.java.template
+++ b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/X-Vector.java.template
@@ -772,7 +772,7 @@ public abstract class $abstractvectortype$ extends AbstractVector<$Boxtype$> {
     @ForceInline
     final
     $abstractvectortype$ unaryMathOp(VectorOperators.Unary op) {
-        return VectorMathLibrary.unaryMathOp(op, opCode(op), species(), $abstractvectortype$::unaryOperations,
+        return VectorMathLibrary.unaryMathOp(op, opCode(op), vspecies(), $abstractvectortype$::unaryOperations,
                                              this);
     }
 #end[FP]
@@ -983,7 +983,7 @@ public abstract class $abstractvectortype$ extends AbstractVector<$Boxtype$> {
     @ForceInline
     final
     $abstractvectortype$ binaryMathOp(VectorOperators.Binary op, $abstractvectortype$ that) {
-        return VectorMathLibrary.binaryMathOp(op, opCode(op), species(), $abstractvectortype$::binaryOperations,
+        return VectorMathLibrary.binaryMathOp(op, opCode(op), vspecies(), $abstractvectortype$::binaryOperations,
                                               this, that);
     }
 #end[FP]

From 284d1310d059764b5fb887d4693af623c2f7e89a Mon Sep 17 00:00:00 2001
From: Alexey Semenyuk <asemenyuk@openjdk.org>
Date: Wed, 4 Mar 2026 00:49:05 +0000
Subject: [PATCH 019/655] 8378876: jpackage: facilitate testing with mocks

Reviewed-by: almatvee
---
 .../jpackage/internal/LibProvidersLookup.java |  2 +-
 .../LinuxDebSystemEnvironmentMixin.java       |  3 ++
 .../LinuxRpmSystemEnvironmentMixin.java       |  4 +-
 .../internal/MacBundlingEnvironment.java      |  5 +++
 .../internal/MacDmgSystemEnvironment.java     | 23 ++++++++---
 .../jdk/jpackage/internal/AppImageFile.java   | 13 -------
 .../internal/DefaultBundlingEnvironment.java  |  9 +++++
 .../jpackage/internal/OptionsTransformer.java |  7 +++-
 .../jdk/jpackage/internal/PackageBuilder.java | 22 ++++++-----
 .../jdk/jpackage/internal/ToolValidator.java  |  4 --
 .../jdk/jpackage/internal/cli/Main.java       | 39 +++++++++++--------
 .../internal/cli/OptionsAnalyzer.java         | 12 +++---
 .../internal/cli/OptionsProcessor.java        |  6 ++-
 .../jpackage/internal/cli/StandardOption.java |  6 +++
 .../jdk/jpackage/test/AppImageFile.java       | 16 ++++----
 .../helpers/jdk/jpackage/test/JavaTool.java   |  5 ++-
 .../helpers/jdk/jpackage/test/TKit.java       | 39 +++++++++++++++----
 .../test/stdmock/JPackageMockUtils.java       |  2 +-
 .../jpackage/internal/AppImageFileTest.java   | 16 +++++---
 .../jdk/jpackage/internal/cli/MainTest.java   |  6 ++-
 .../internal/cli/OptionsProcessorTest.java    |  4 +-
 .../cli/OptionsValidationFailTest.java        |  2 +-
 22 files changed, 157 insertions(+), 88 deletions(-)

diff --git a/src/jdk.jpackage/linux/classes/jdk/jpackage/internal/LibProvidersLookup.java b/src/jdk.jpackage/linux/classes/jdk/jpackage/internal/LibProvidersLookup.java
index 6faacbca528..2dccc91cf8f 100644
--- a/src/jdk.jpackage/linux/classes/jdk/jpackage/internal/LibProvidersLookup.java
+++ b/src/jdk.jpackage/linux/classes/jdk/jpackage/internal/LibProvidersLookup.java
@@ -44,7 +44,7 @@ import java.util.stream.Stream;
  */
 public final class LibProvidersLookup {
     static boolean supported() {
-        return (new ToolValidator(TOOL_LDD).validate() == null);
+        return (new ToolValidator(TOOL_LDD).setCommandLine("--version").validate() == null);
     }
 
     LibProvidersLookup setPackageLookup(PackageLookup v) {
diff --git a/src/jdk.jpackage/linux/classes/jdk/jpackage/internal/LinuxDebSystemEnvironmentMixin.java b/src/jdk.jpackage/linux/classes/jdk/jpackage/internal/LinuxDebSystemEnvironmentMixin.java
index 2cf3e9e36e8..4c6fd75bed8 100644
--- a/src/jdk.jpackage/linux/classes/jdk/jpackage/internal/LinuxDebSystemEnvironmentMixin.java
+++ b/src/jdk.jpackage/linux/classes/jdk/jpackage/internal/LinuxDebSystemEnvironmentMixin.java
@@ -40,6 +40,9 @@ interface LinuxDebSystemEnvironmentMixin {
     static Result<LinuxDebSystemEnvironmentMixin> create() {
         final var errors = Stream.of(Internal.TOOL_DPKG_DEB, Internal.TOOL_DPKG, Internal.TOOL_FAKEROOT)
                 .map(ToolValidator::new)
+                .map(v -> {
+                    return v.setCommandLine("--version");
+                })
                 .map(ToolValidator::validate)
                 .filter(Objects::nonNull)
                 .toList();
diff --git a/src/jdk.jpackage/linux/classes/jdk/jpackage/internal/LinuxRpmSystemEnvironmentMixin.java b/src/jdk.jpackage/linux/classes/jdk/jpackage/internal/LinuxRpmSystemEnvironmentMixin.java
index 4cbd3ce4a9c..8de28b79430 100644
--- a/src/jdk.jpackage/linux/classes/jdk/jpackage/internal/LinuxRpmSystemEnvironmentMixin.java
+++ b/src/jdk.jpackage/linux/classes/jdk/jpackage/internal/LinuxRpmSystemEnvironmentMixin.java
@@ -44,7 +44,9 @@ interface LinuxRpmSystemEnvironmentMixin {
         final var errors = Stream.of(
                 Internal.createRpmbuildToolValidator(),
                 new ToolValidator(Internal.TOOL_RPM)
-        ).map(ToolValidator::validate).filter(Objects::nonNull).toList();
+        ).map(v -> {
+            return v.setCommandLine("--version");
+        }).map(ToolValidator::validate).filter(Objects::nonNull).toList();
 
         if (errors.isEmpty()) {
             return Result.ofValue(new Stub(Internal.TOOL_RPM, Internal.TOOL_RPMBUILD));
diff --git a/src/jdk.jpackage/macosx/classes/jdk/jpackage/internal/MacBundlingEnvironment.java b/src/jdk.jpackage/macosx/classes/jdk/jpackage/internal/MacBundlingEnvironment.java
index 224ea20f249..1e60d8490f0 100644
--- a/src/jdk.jpackage/macosx/classes/jdk/jpackage/internal/MacBundlingEnvironment.java
+++ b/src/jdk.jpackage/macosx/classes/jdk/jpackage/internal/MacBundlingEnvironment.java
@@ -31,6 +31,7 @@ import static jdk.jpackage.internal.cli.StandardBundlingOperation.CREATE_MAC_APP
 import static jdk.jpackage.internal.cli.StandardBundlingOperation.CREATE_MAC_DMG;
 import static jdk.jpackage.internal.cli.StandardBundlingOperation.CREATE_MAC_PKG;
 import static jdk.jpackage.internal.cli.StandardBundlingOperation.SIGN_MAC_APP_IMAGE;
+import static jdk.jpackage.internal.cli.StandardOption.EXIT_AFTER_CONFIGURATION_PHASE;
 
 import java.util.Optional;
 import jdk.jpackage.internal.cli.Options;
@@ -74,6 +75,10 @@ public class MacBundlingEnvironment extends DefaultBundlingEnvironment {
 
         final var pkg = createSignAppImagePackage(app, env);
 
+        if (EXIT_AFTER_CONFIGURATION_PHASE.getFrom(options)) {
+            return;
+        }
+
         buildPipeline(pkg).create().execute(env, pkg, env.appImageDir());
     }
 
diff --git a/src/jdk.jpackage/macosx/classes/jdk/jpackage/internal/MacDmgSystemEnvironment.java b/src/jdk.jpackage/macosx/classes/jdk/jpackage/internal/MacDmgSystemEnvironment.java
index 12d105b99b5..11cf94ca66d 100644
--- a/src/jdk.jpackage/macosx/classes/jdk/jpackage/internal/MacDmgSystemEnvironment.java
+++ b/src/jdk.jpackage/macosx/classes/jdk/jpackage/internal/MacDmgSystemEnvironment.java
@@ -31,6 +31,7 @@ import java.util.Objects;
 import java.util.Optional;
 import java.util.stream.Collectors;
 import java.util.stream.Stream;
+import jdk.internal.util.OperatingSystem;
 import jdk.jpackage.internal.util.Result;
 
 record MacDmgSystemEnvironment(Path hdiutil, Path osascript, Optional<Path> setFileUtility) implements SystemEnvironment {
@@ -39,12 +40,22 @@ record MacDmgSystemEnvironment(Path hdiutil, Path osascript, Optional<Path> setF
     }
 
     static Result<MacDmgSystemEnvironment> create() {
-        final var errors = Stream.of(HDIUTIL, OSASCRIPT)
-                .map(ToolValidator::new)
-                .map(ToolValidator::checkExistsOnly)
-                .map(ToolValidator::validate)
-                .filter(Objects::nonNull)
-                .toList();
+
+        List<? extends Exception> errors;
+
+        if (OperatingSystem.isMacOS()) {
+            errors = Stream.of(HDIUTIL, OSASCRIPT)
+                    .map(ToolValidator::new)
+                    .map(ToolValidator::checkExistsOnly)
+                    .map(ToolValidator::validate)
+                    .filter(Objects::nonNull)
+                    .toList();
+        } else {
+            // The code runs on an OS other than macOS. Presume this is mock testing.
+            // Don't validate the tools; checking that their executables exist will fail in this environment.
+            errors = List.of();
+        }
+
         if (errors.isEmpty()) {
             return Result.ofValue(new MacDmgSystemEnvironment(HDIUTIL, OSASCRIPT, findSetFileUtility()));
         } else {
diff --git a/src/jdk.jpackage/share/classes/jdk/jpackage/internal/AppImageFile.java b/src/jdk.jpackage/share/classes/jdk/jpackage/internal/AppImageFile.java
index 75ead9d08ad..7edc6cd3c11 100644
--- a/src/jdk.jpackage/share/classes/jdk/jpackage/internal/AppImageFile.java
+++ b/src/jdk.jpackage/share/classes/jdk/jpackage/internal/AppImageFile.java
@@ -134,19 +134,6 @@ final class AppImageFile {
         return appLayout.appDirectory().resolve(FILENAME);
     }
 
-    /**
-     * Loads application image info from the specified application layout.
-     * <p>
-     * It is an equivalent to calling
-     * {@link #load(ApplicationLayout, OperatingSystem)} method with
-     * {@code OperatingSystem.current()} for the second parameter.
-     *
-     * @param appLayout the application layout
-     */
-    static ExternalApplication load(ApplicationLayout appLayout) {
-        return load(appLayout, OperatingSystem.current());
-    }
-
     /**
      * Loads application image info from the specified application layout and OS.
      *
diff --git a/src/jdk.jpackage/share/classes/jdk/jpackage/internal/DefaultBundlingEnvironment.java b/src/jdk.jpackage/share/classes/jdk/jpackage/internal/DefaultBundlingEnvironment.java
index fc51f60aa66..ae4b1005318 100644
--- a/src/jdk.jpackage/share/classes/jdk/jpackage/internal/DefaultBundlingEnvironment.java
+++ b/src/jdk.jpackage/share/classes/jdk/jpackage/internal/DefaultBundlingEnvironment.java
@@ -25,6 +25,7 @@
 package jdk.jpackage.internal;
 
 import static java.util.stream.Collectors.toMap;
+import static jdk.jpackage.internal.cli.StandardOption.EXIT_AFTER_CONFIGURATION_PHASE;
 import static jdk.jpackage.internal.util.MemoizingSupplier.runOnce;
 
 import java.io.IOException;
@@ -129,6 +130,10 @@ class DefaultBundlingEnvironment implements CliBundlingEnvironment {
         Objects.requireNonNull(app);
         Objects.requireNonNull(pipelineBuilder);
 
+        if (EXIT_AFTER_CONFIGURATION_PHASE.getFrom(options)) {
+            return;
+        }
+
         final var outputDir = PathUtils.normalizedAbsolutePath(OptionUtils.outputDir(options).resolve(app.appImageDirName()));
 
         Log.verbose(I18N.getString("message.create-app-image"));
@@ -170,6 +175,10 @@ class DefaultBundlingEnvironment implements CliBundlingEnvironment {
         Objects.requireNonNull(createPipelineBuilder);
         Objects.requireNonNull(pipelineBuilderMutatorFactory);
 
+        if (EXIT_AFTER_CONFIGURATION_PHASE.getFrom(options)) {
+            return;
+        }
+
         var pipelineBuilder = Objects.requireNonNull(createPipelineBuilder.apply(pkg));
 
         // Delete an old output package file (if any) before creating a new one.
diff --git a/src/jdk.jpackage/share/classes/jdk/jpackage/internal/OptionsTransformer.java b/src/jdk.jpackage/share/classes/jdk/jpackage/internal/OptionsTransformer.java
index a01be089a49..f7b535b06f6 100644
--- a/src/jdk.jpackage/share/classes/jdk/jpackage/internal/OptionsTransformer.java
+++ b/src/jdk.jpackage/share/classes/jdk/jpackage/internal/OptionsTransformer.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2025, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -46,7 +46,10 @@ record OptionsTransformer(Options mainOptions, Optional<ExternalApplication> ext
     }
 
     OptionsTransformer(Options mainOptions, ApplicationLayout appLayout) {
-        this(mainOptions, PREDEFINED_APP_IMAGE.findIn(mainOptions).map(appLayout::resolveAt).map(AppImageFile::load));
+        this(mainOptions, PREDEFINED_APP_IMAGE.findIn(mainOptions).map(appLayout::resolveAt).map(resolvedLayout -> {
+            var os = OptionUtils.bundlingOperation(mainOptions).os();
+            return AppImageFile.load(resolvedLayout, os);
+        }));
     }
 
     Options appOptions() {
diff --git a/src/jdk.jpackage/share/classes/jdk/jpackage/internal/PackageBuilder.java b/src/jdk.jpackage/share/classes/jdk/jpackage/internal/PackageBuilder.java
index f537a1ea0a2..8b61ef19fa2 100644
--- a/src/jdk.jpackage/share/classes/jdk/jpackage/internal/PackageBuilder.java
+++ b/src/jdk.jpackage/share/classes/jdk/jpackage/internal/PackageBuilder.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2025, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -207,7 +207,7 @@ final class PackageBuilder {
         });
     }
 
-    private static Path mapInstallDir(Path installDir, PackageType pkgType) {
+    private static Path mapInstallDir(Path installDir, PackageType type) {
         var ex = buildConfigException("error.invalid-install-dir", installDir).create();
 
         if (installDir.getNameCount() == 0) {
@@ -223,15 +223,17 @@ final class PackageBuilder {
             throw ex;
         }
 
-        switch (pkgType) {
-            case StandardPackageType.WIN_EXE, StandardPackageType.WIN_MSI -> {
-                if (installDir.isAbsolute()) {
-                    throw ex;
+        if (type instanceof StandardPackageType stdType) {
+            switch (stdType) {
+                case WIN_EXE, WIN_MSI -> {
+                    if (installDir.isAbsolute()) {
+                        throw ex;
+                    }
                 }
-            }
-            default -> {
-                if (!installDir.isAbsolute()) {
-                    throw ex;
+                default -> {
+                    if (!installDir.isAbsolute()) {
+                        throw ex;
+                    }
                 }
             }
         }
diff --git a/src/jdk.jpackage/share/classes/jdk/jpackage/internal/ToolValidator.java b/src/jdk.jpackage/share/classes/jdk/jpackage/internal/ToolValidator.java
index 9440aff3a53..13a9e05e934 100644
--- a/src/jdk.jpackage/share/classes/jdk/jpackage/internal/ToolValidator.java
+++ b/src/jdk.jpackage/share/classes/jdk/jpackage/internal/ToolValidator.java
@@ -33,7 +33,6 @@ import java.util.Objects;
 import java.util.function.BiFunction;
 import java.util.function.Function;
 import java.util.stream.Stream;
-import jdk.internal.util.OperatingSystem;
 import jdk.jpackage.internal.model.ConfigException;
 import jdk.jpackage.internal.model.DottedVersion;
 
@@ -46,9 +45,6 @@ final class ToolValidator {
 
     ToolValidator(Path toolPath) {
         this.toolPath = Objects.requireNonNull(toolPath);
-        if (OperatingSystem.isLinux()) {
-            setCommandLine("--version");
-        }
     }
 
     ToolValidator setCommandLine(String... args) {
diff --git a/src/jdk.jpackage/share/classes/jdk/jpackage/internal/cli/Main.java b/src/jdk.jpackage/share/classes/jdk/jpackage/internal/cli/Main.java
index d40895a7da6..5789203c3e9 100644
--- a/src/jdk.jpackage/share/classes/jdk/jpackage/internal/cli/Main.java
+++ b/src/jdk.jpackage/share/classes/jdk/jpackage/internal/cli/Main.java
@@ -64,14 +64,15 @@ import jdk.jpackage.internal.util.function.ExceptionBox;
  */
 public final class Main {
 
-    public record Provider(Supplier<CliBundlingEnvironment> bundlingEnvSupplier) implements ToolProvider {
+    public record Provider(Supplier<CliBundlingEnvironment> bundlingEnvSupplier, OperatingSystem os) implements ToolProvider {
 
         public Provider {
             Objects.requireNonNull(bundlingEnvSupplier);
+            Objects.requireNonNull(os);
         }
 
         public Provider() {
-            this(DefaultBundlingEnvironmentLoader.INSTANCE);
+            this(DefaultBundlingEnvironmentLoader.INSTANCE, OperatingSystem.current());
         }
 
         @Override
@@ -81,7 +82,7 @@ public final class Main {
 
         @Override
         public int run(PrintWriter out, PrintWriter err, String... args) {
-            return Main.run(bundlingEnvSupplier, out, err, args);
+            return Main.run(os, bundlingEnvSupplier, out, err, args);
         }
 
         @Override
@@ -107,25 +108,29 @@ public final class Main {
     public static void main(String... args) {
         var out = toPrintWriter(System.out);
         var err = toPrintWriter(System.err);
-        System.exit(run(out, err, args));
+        System.exit(run(OperatingSystem.current(), DefaultBundlingEnvironmentLoader.INSTANCE, out, err, args));
     }
 
-    static int run(PrintWriter out, PrintWriter err, String... args) {
-        return run(DefaultBundlingEnvironmentLoader.INSTANCE, out, err, args);
-    }
-
-    static int run(Supplier<CliBundlingEnvironment> bundlingEnvSupplier, PrintWriter out, PrintWriter err, String... args) {
-        return Globals.main(() -> {
-            return runWithGlobals(bundlingEnvSupplier, out, err, args);
-        });
-    }
-
-    private static int runWithGlobals(
+    static int run(
+            OperatingSystem os,
             Supplier<CliBundlingEnvironment> bundlingEnvSupplier,
             PrintWriter out,
             PrintWriter err,
             String... args) {
 
+        return Globals.main(() -> {
+            return runWithGlobals(os, bundlingEnvSupplier, out, err, args);
+        });
+    }
+
+    private static int runWithGlobals(
+            OperatingSystem os,
+            Supplier<CliBundlingEnvironment> bundlingEnvSupplier,
+            PrintWriter out,
+            PrintWriter err,
+            String... args) {
+
+        Objects.requireNonNull(os);
         Objects.requireNonNull(bundlingEnvSupplier);
         Objects.requireNonNull(args);
         for (String arg : args) {
@@ -162,7 +167,7 @@ public final class Main {
 
             final var bundlingEnv = bundlingEnvSupplier.get();
 
-            final var parseResult = Utils.buildParser(OperatingSystem.current(), bundlingEnv).create().apply(mappedArgs.get());
+            final var parseResult = Utils.buildParser(os, bundlingEnv).create().apply(mappedArgs.get());
 
             return runner.run(() -> {
                 final var parsedOptionsBuilder = parseResult.orElseThrow();
@@ -189,7 +194,7 @@ public final class Main {
                     Globals.instance().loggerVerbose();
                 }
 
-                final var optionsProcessor = new OptionsProcessor(parsedOptionsBuilder, bundlingEnv);
+                final var optionsProcessor = new OptionsProcessor(parsedOptionsBuilder, os, bundlingEnv);
 
                 final var validationResult = optionsProcessor.validate();
 
diff --git a/src/jdk.jpackage/share/classes/jdk/jpackage/internal/cli/OptionsAnalyzer.java b/src/jdk.jpackage/share/classes/jdk/jpackage/internal/cli/OptionsAnalyzer.java
index 6c32a3d1569..fb1dd20df92 100644
--- a/src/jdk.jpackage/share/classes/jdk/jpackage/internal/cli/OptionsAnalyzer.java
+++ b/src/jdk.jpackage/share/classes/jdk/jpackage/internal/cli/OptionsAnalyzer.java
@@ -63,8 +63,8 @@ import jdk.jpackage.internal.model.BundleType;
  */
 final class OptionsAnalyzer {
 
-    OptionsAnalyzer(Options cmdline, BundlingEnvironment bundlingEnv) {
-        this(cmdline, getBundlingOperation(cmdline, OperatingSystem.current(), bundlingEnv), false);
+    OptionsAnalyzer(Options cmdline, OperatingSystem os, BundlingEnvironment bundlingEnv) {
+        this(cmdline, getBundlingOperation(cmdline, os, bundlingEnv), false);
     }
 
     OptionsAnalyzer(Options cmdline, StandardBundlingOperation bundlingOperation) {
@@ -291,17 +291,17 @@ final class OptionsAnalyzer {
                 return bundlingOperations.getFirst();
             } else {
                 // Multiple standard bundling operations produce the `bundleType` bundle type.
-                // Filter those that belong to the current OS
+                // Filter those that belong to the specified OS.
                 bundlingOperations = bundlingOperations.stream().filter(op -> {
-                    return op.os().equals(OperatingSystem.current());
+                    return op.os().equals(os);
                 }).toList();
 
                 if (bundlingOperations.isEmpty()) {
                     // jpackage internal error: none of the standard bundling operations produce
-                    // bundles of the `bundleType` on the current OS.
+                    // bundles of the `bundleType` on the specified OS.
                     throw new AssertionError(String.format(
                             "None of the standard bundling operations produce bundles of type [%s] on %s",
-                            bundleType, OperatingSystem.current()));
+                            bundleType, os));
                 } else if (bundlingOperations.size() == 1) {
                     return bundlingOperations.getFirst();
                 } else if (StandardBundlingOperation.MACOS_APP_IMAGE.containsAll(bundlingOperations)) {
diff --git a/src/jdk.jpackage/share/classes/jdk/jpackage/internal/cli/OptionsProcessor.java b/src/jdk.jpackage/share/classes/jdk/jpackage/internal/cli/OptionsProcessor.java
index 3c0eab77f8a..387c36ea416 100644
--- a/src/jdk.jpackage/share/classes/jdk/jpackage/internal/cli/OptionsProcessor.java
+++ b/src/jdk.jpackage/share/classes/jdk/jpackage/internal/cli/OptionsProcessor.java
@@ -62,8 +62,9 @@ import jdk.jpackage.internal.util.Result;
  */
 final class OptionsProcessor {
 
-    OptionsProcessor(OptionsBuilder optionsBuilder, CliBundlingEnvironment bundlingEnv) {
+    OptionsProcessor(OptionsBuilder optionsBuilder, OperatingSystem os, CliBundlingEnvironment bundlingEnv) {
         this.optionsBuilder = Objects.requireNonNull(optionsBuilder);
+        this.os = Objects.requireNonNull(os);
         this.bundlingEnv = Objects.requireNonNull(bundlingEnv);
     }
 
@@ -88,7 +89,7 @@ final class OptionsProcessor {
         final var untypedOptions = optionsBuilder.create();
 
         // Create command line structure analyzer.
-        final var analyzerResult = Result.of(() -> new OptionsAnalyzer(untypedOptions, bundlingEnv));
+        final var analyzerResult = Result.of(() -> new OptionsAnalyzer(untypedOptions, os, bundlingEnv));
         if (analyzerResult.hasErrors()) {
             // Failed to derive the bundling operation from the command line.
             allErrors.addAll(analyzerResult.mapErrors().errors());
@@ -419,6 +420,7 @@ final class OptionsProcessor {
 
 
     private final JOptSimpleOptionsBuilder.OptionsBuilder optionsBuilder;
+    private final OperatingSystem os;
     private final CliBundlingEnvironment bundlingEnv;
 
     private static final OptionValue<List<Options>> ADD_LAUNCHER_INTERNAL =
diff --git a/src/jdk.jpackage/share/classes/jdk/jpackage/internal/cli/StandardOption.java b/src/jdk.jpackage/share/classes/jdk/jpackage/internal/cli/StandardOption.java
index eca82da99aa..f554fc12ec6 100644
--- a/src/jdk.jpackage/share/classes/jdk/jpackage/internal/cli/StandardOption.java
+++ b/src/jdk.jpackage/share/classes/jdk/jpackage/internal/cli/StandardOption.java
@@ -434,6 +434,12 @@ public final class StandardOption {
 
     public static final OptionValue<BundlingOperationDescriptor> BUNDLING_OPERATION_DESCRIPTOR = OptionValue.create();
 
+    /**
+     * Debug option telling bundler to exit after the configuration phase is over,
+     * without running the packaging phase.
+     */
+    public static final OptionValue<Boolean> EXIT_AFTER_CONFIGURATION_PHASE = OptionValue.<Boolean>build().defaultValue(false).create();
+
     /**
      * Returns options configuring a launcher.
      *
diff --git a/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/AppImageFile.java b/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/AppImageFile.java
index 55b13a06620..2dcccc673a9 100644
--- a/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/AppImageFile.java
+++ b/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/AppImageFile.java
@@ -41,7 +41,6 @@ import javax.xml.stream.XMLStreamWriter;
 import javax.xml.xpath.XPath;
 import javax.xml.xpath.XPathExpressionException;
 import javax.xml.xpath.XPathFactory;
-import jdk.internal.util.OperatingSystem;
 import jdk.jpackage.internal.util.XmlUtils;
 import org.w3c.dom.Document;
 import org.w3c.dom.Element;
@@ -195,13 +194,16 @@ public record AppImageFile(String mainLauncherName, Optional<String> mainLaunche
     }
 
     private static String getPlatform() {
-        return PLATFORM_LABELS.get(OperatingSystem.current());
+        if (TKit.isLinux()) {
+            return "linux";
+        } else if (TKit.isWindows()) {
+            return "windows";
+        } else if (TKit.isOSX()) {
+            return "macOS";
+        } else {
+            throw new IllegalStateException();
+        }
     }
 
     private static final String FILENAME = ".jpackage.xml";
-
-    private static final Map<OperatingSystem, String> PLATFORM_LABELS = Map.of(
-            OperatingSystem.LINUX, "linux",
-            OperatingSystem.WINDOWS, "windows",
-            OperatingSystem.MACOS, "macOS");
 }
diff --git a/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/JavaTool.java b/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/JavaTool.java
index 0bbf71fe0cd..4ca4b918355 100644
--- a/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/JavaTool.java
+++ b/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/JavaTool.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2019, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2019, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -27,6 +27,7 @@ package jdk.jpackage.test;
 
 import java.nio.file.Path;
 import java.util.spi.ToolProvider;
+import jdk.internal.util.OperatingSystem;
 
 public enum JavaTool {
     JAVA, JAVAC, JPACKAGE, JAR, JLINK, JMOD, JSHELL;
@@ -50,7 +51,7 @@ public enum JavaTool {
 
     private Path relativePathInJavaHome() {
         Path path = Path.of("bin", toolName());
-        if (TKit.isWindows()) {
+        if (OperatingSystem.isWindows()) {
             path = path.getParent().resolve(path.getFileName().toString() + ".exe");
         }
         return path;
diff --git a/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/TKit.java b/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/TKit.java
index 88d11d75f45..db76309c292 100644
--- a/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/TKit.java
+++ b/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/TKit.java
@@ -77,6 +77,9 @@ import jdk.jpackage.internal.util.function.ThrowingUnaryOperator;
 
 public final class TKit {
 
+    private static final ScopedValue<State> STATE = ScopedValue.newInstance();
+    private static final State DEFAULT_STATE = State.build().initDefaults().mutable(false).create();
+
     public static final Path TEST_SRC_ROOT = Functional.identity(() -> {
         Path root = Path.of(System.getProperty("test.src"));
 
@@ -128,6 +131,15 @@ public final class TKit {
         }
     }
 
+    public static void withOperatingSystem(ThrowingRunnable<? extends Exception> action, OperatingSystem os) {
+        Objects.requireNonNull(action);
+        Objects.requireNonNull(os);
+
+        withState(action, stateBuilder -> {
+            stateBuilder.os(os);
+        });
+    }
+
     public static void withState(ThrowingRunnable<? extends Exception> action, Consumer<State.Builder> stateBuilderMutator) {
         Objects.requireNonNull(action);
         Objects.requireNonNull(stateBuilderMutator);
@@ -233,21 +245,25 @@ public final class TKit {
     }
 
     public static boolean isWindows() {
-        return OperatingSystem.isWindows();
+        return TKit.state().os == OperatingSystem.WINDOWS;
     }
 
     public static boolean isOSX() {
-        return OperatingSystem.isMacOS();
+        return TKit.state().os == OperatingSystem.MACOS;
     }
 
     public static boolean isLinux() {
-        return OperatingSystem.isLinux();
+        return TKit.state().os == OperatingSystem.LINUX;
     }
 
     public static boolean isLinuxAPT() {
         return isLinux() && Files.exists(Path.of("/usr/bin/apt-get"));
     }
 
+    public static boolean isMockingOperatingSystem() {
+        return TKit.state().os != OperatingSystem.current();
+    }
+
     private static String addTimestamp(String msg) {
         SimpleDateFormat sdf = new SimpleDateFormat("HH:mm:ss.SSS");
         Date time = new Date(System.currentTimeMillis());
@@ -1314,6 +1330,7 @@ public final class TKit {
     public static final class State {
 
         private State(
+                OperatingSystem os,
                 TestInstance currentTest,
                 PrintStream out,
                 PrintStream err,
@@ -1323,10 +1340,12 @@ public final class TKit {
                 boolean verboseJPackage,
                 boolean verboseTestSetup) {
 
+            Objects.requireNonNull(os);
             Objects.requireNonNull(out);
             Objects.requireNonNull(err);
             Objects.requireNonNull(properties);
 
+            this.os = os;
             this.currentTest = currentTest;
             this.out = out;
             this.err = err;
@@ -1371,6 +1390,7 @@ public final class TKit {
         static final class Builder {
 
             Builder initDefaults() {
+                os = null;
                 currentTest = null;
                 out = System.out;
                 err = System.err;
@@ -1403,6 +1423,7 @@ public final class TKit {
             }
 
             Builder initFrom(State state) {
+                os = state.os;
                 currentTest = state.currentTest;
                 out = state.out;
                 err = state.err;
@@ -1418,6 +1439,11 @@ public final class TKit {
                 return this;
             }
 
+            Builder os(OperatingSystem v) {
+                os = v;
+                return this;
+            }
+
             Builder currentTest(TestInstance v) {
                 currentTest = v;
                 return this;
@@ -1449,6 +1475,7 @@ public final class TKit {
 
             State create() {
                 return new State(
+                        Optional.ofNullable(os).orElseGet(OperatingSystem::current),
                         currentTest,
                         out,
                         err,
@@ -1459,6 +1486,7 @@ public final class TKit {
                         verboseTestSetup);
             }
 
+            private OperatingSystem os;
             private TestInstance currentTest;
             private PrintStream out;
             private PrintStream err;
@@ -1474,6 +1502,7 @@ public final class TKit {
         }
 
 
+        private OperatingSystem os;
         private final TestInstance currentTest;
         private final PrintStream out;
         private final PrintStream err;
@@ -1486,8 +1515,4 @@ public final class TKit {
         private final boolean verboseJPackage;
         private final boolean verboseTestSetup;
     }
-
-
-    private static final ScopedValue<State> STATE = ScopedValue.newInstance();
-    private static final State DEFAULT_STATE = State.build().initDefaults().mutable(false).create();
 }
diff --git a/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/stdmock/JPackageMockUtils.java b/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/stdmock/JPackageMockUtils.java
index 604bcd0711f..085102390ff 100644
--- a/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/stdmock/JPackageMockUtils.java
+++ b/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/stdmock/JPackageMockUtils.java
@@ -213,7 +213,7 @@ public final class JPackageMockUtils {
 
         var impl = new Main.Provider(runOnce(() -> {
             return createBundlingEnvironment(os);
-        }));
+        }), os);
 
         return new ToolProvider() {
 
diff --git a/test/jdk/tools/jpackage/junit/share/jdk.jpackage/jdk/jpackage/internal/AppImageFileTest.java b/test/jdk/tools/jpackage/junit/share/jdk.jpackage/jdk/jpackage/internal/AppImageFileTest.java
index 8fdcc96acff..85b15d77052 100644
--- a/test/jdk/tools/jpackage/junit/share/jdk.jpackage/jdk/jpackage/internal/AppImageFileTest.java
+++ b/test/jdk/tools/jpackage/junit/share/jdk.jpackage/jdk/jpackage/internal/AppImageFileTest.java
@@ -108,7 +108,9 @@ public class AppImageFileTest {
 
     @Test
     public void testNoSuchFile() throws IOException {
-        var ex = assertThrowsExactly(JPackageException.class, () -> AppImageFile.load(DUMMY_LAYOUT.resolveAt(tempFolder)));
+        var ex = assertThrowsExactly(JPackageException.class, () -> {
+            AppImageFile.load(DUMMY_LAYOUT.resolveAt(tempFolder), OperatingSystem.current());
+        });
         Assertions.assertEquals(I18N.format("error.missing-app-image-file", ".jpackage.xml", tempFolder), ex.getMessage());
         assertNull(ex.getCause());
     }
@@ -117,7 +119,9 @@ public class AppImageFileTest {
     public void testDirectory() throws IOException {
         Files.createDirectory(AppImageFile.getPathInAppImage(DUMMY_LAYOUT.resolveAt(tempFolder)));
 
-        var ex = assertThrowsExactly(JPackageException.class, () -> AppImageFile.load(DUMMY_LAYOUT.resolveAt(tempFolder)));
+        var ex = assertThrowsExactly(JPackageException.class, () -> {
+            AppImageFile.load(DUMMY_LAYOUT.resolveAt(tempFolder), OperatingSystem.current());
+        });
         Assertions.assertEquals(I18N.format("error.reading-app-image-file", ".jpackage.xml", tempFolder), ex.getMessage());
         assertNotNull(ex.getCause());
     }
@@ -131,7 +135,9 @@ public class AppImageFileTest {
         Files.writeString(appImageFile, "");
 
         try (var out = new FileOutputStream(appImageFile.toFile()); var lock = out.getChannel().lock()) {
-            var ex = assertThrowsExactly(JPackageException.class, () -> AppImageFile.load(DUMMY_LAYOUT.resolveAt(tempFolder)));
+            var ex = assertThrowsExactly(JPackageException.class, () -> {
+                AppImageFile.load(DUMMY_LAYOUT.resolveAt(tempFolder), OperatingSystem.current());
+            });
             Assertions.assertEquals(I18N.format("error.reading-app-image-file", ".jpackage.xml", tempFolder), ex.getMessage());
             assertNotNull(ex.getCause());
         }
@@ -237,7 +243,7 @@ public class AppImageFileTest {
             final var copy = toSupplier(() -> {
                 var layout = DUMMY_LAYOUT.resolveAt(dir);
                 new AppImageFile(app).save(layout);
-                return AppImageFile.load(layout);
+                return AppImageFile.load(layout, OperatingSystem.current());
             }).get();
 
             assertEquals(createExternalApplication(OperatingSystem.current()), copy);
@@ -638,7 +644,7 @@ public class AppImageFileTest {
 
     private static final ApplicationLayout DUMMY_LAYOUT = ApplicationLayout.build().setAll("").create();
 
-    private final static Map<OptionIdentifier, String> OPTIONS = Stream.of(AppImageFileOptionScope.values())
+    private static final Map<OptionIdentifier, String> OPTIONS = Stream.of(AppImageFileOptionScope.values())
             .flatMap(AppImageFileOptionScope::options)
             .collect(toMap(OptionValue::id, OptionValue::getName));
 
diff --git a/test/jdk/tools/jpackage/junit/share/jdk.jpackage/jdk/jpackage/internal/cli/MainTest.java b/test/jdk/tools/jpackage/junit/share/jdk.jpackage/jdk/jpackage/internal/cli/MainTest.java
index 1c06d592006..3f933093e97 100644
--- a/test/jdk/tools/jpackage/junit/share/jdk.jpackage/jdk/jpackage/internal/cli/MainTest.java
+++ b/test/jdk/tools/jpackage/junit/share/jdk.jpackage/jdk/jpackage/internal/cli/MainTest.java
@@ -461,7 +461,11 @@ public class MainTest extends JUnitAdapter {
             var stdout = new StringWriter();
             var stderr = new StringWriter();
 
-            var exitCode = Main.run(new PrintWriter(stdout), new PrintWriter(stderr), args);
+            var os = OperatingSystem.current();
+            var exitCode = Main.run(os, () -> {
+                CliBundlingEnvironment bundlingEnv = JPackageMockUtils.createBundlingEnvironment(os);
+                return bundlingEnv;
+            }, new PrintWriter(stdout), new PrintWriter(stderr), args);
 
             return new ExecutionResult(lines(stdout.toString()), lines(stderr.toString()), exitCode);
         }
diff --git a/test/jdk/tools/jpackage/junit/share/jdk.jpackage/jdk/jpackage/internal/cli/OptionsProcessorTest.java b/test/jdk/tools/jpackage/junit/share/jdk.jpackage/jdk/jpackage/internal/cli/OptionsProcessorTest.java
index 53b726d8f1a..499aab2f24a 100644
--- a/test/jdk/tools/jpackage/junit/share/jdk.jpackage/jdk/jpackage/internal/cli/OptionsProcessorTest.java
+++ b/test/jdk/tools/jpackage/junit/share/jdk.jpackage/jdk/jpackage/internal/cli/OptionsProcessorTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2025, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -664,7 +664,7 @@ public class OptionsProcessorTest {
 
             var optionsBuilder = Utils.buildParser(os, bundlingEnv).create().apply(stringArgs).orElseThrow();
 
-            var op = new OptionsProcessor(optionsBuilder, bundlingEnv);
+            var op = new OptionsProcessor(optionsBuilder, OperatingSystem.current(), bundlingEnv);
 
             Collection<Map<String, Object>> errors;
             if (expectedValidationErrorsOrdered) {
diff --git a/test/jdk/tools/jpackage/junit/share/jdk.jpackage/jdk/jpackage/internal/cli/OptionsValidationFailTest.java b/test/jdk/tools/jpackage/junit/share/jdk.jpackage/jdk/jpackage/internal/cli/OptionsValidationFailTest.java
index 9976a71ef3f..3381677cb61 100644
--- a/test/jdk/tools/jpackage/junit/share/jdk.jpackage/jdk/jpackage/internal/cli/OptionsValidationFailTest.java
+++ b/test/jdk/tools/jpackage/junit/share/jdk.jpackage/jdk/jpackage/internal/cli/OptionsValidationFailTest.java
@@ -105,7 +105,7 @@ public class OptionsValidationFailTest {
                     final var firstErr = errors.stream().findFirst().orElseThrow();
                     errorReporter.reportError(firstErr);
                 }).map(builder -> {
-                    var result = new OptionsProcessor(builder, bundlingEnv).validate();
+                    var result = new OptionsProcessor(builder, OperatingSystem.current(), bundlingEnv).validate();
                     if (result.hasValue()) {
                         return 0;
                     } else {

From 7f518deb2c6ac54867a266ce16023183e7ced053 Mon Sep 17 00:00:00 2001
From: Frederic Thevenet <fthevenet@openjdk.org>
Date: Wed, 4 Mar 2026 05:48:30 +0000
Subject: [PATCH 020/655] 8378584: (process) Investigate and fix Alpine errors
 in Basic.java ProcessBuilder test, and re-enable tests

Reviewed-by: stuefe
---
 test/jdk/java/lang/ProcessBuilder/Basic.java | 5 ++---
 1 file changed, 2 insertions(+), 3 deletions(-)

diff --git a/test/jdk/java/lang/ProcessBuilder/Basic.java b/test/jdk/java/lang/ProcessBuilder/Basic.java
index 7034174f85c..dd97de8fad8 100644
--- a/test/jdk/java/lang/ProcessBuilder/Basic.java
+++ b/test/jdk/java/lang/ProcessBuilder/Basic.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -33,7 +33,6 @@
  * @summary Basic tests for Process and Environment Variable code
  * @modules java.base/java.lang:open
  *          java.base/java.io:open
- * @requires !vm.musl
  * @requires vm.flagless
  * @library /test/lib
  * @run main/othervm/native/timeout=360 Basic
@@ -46,7 +45,7 @@
  * @modules java.base/java.lang:open
  *          java.base/java.io:open
  *          java.base/jdk.internal.misc
- * @requires (os.family == "linux" & !vm.musl)
+ * @requires (os.family == "linux")
  * @library /test/lib
  * @run main/othervm/timeout=300 -Djdk.lang.Process.launchMechanism=posix_spawn Basic
  */

From d9e256d3b2bb96ab079ccab51a5d3b32900aa632 Mon Sep 17 00:00:00 2001
From: Axel Boldt-Christmas <aboldtch@openjdk.org>
Date: Wed, 4 Mar 2026 06:11:02 +0000
Subject: [PATCH 021/655] 8372245: GTest globalDefinitions.format_specifiers
 cannot run without VM

Reviewed-by: kbarrett, iwalulya
---
 test/hotspot/gtest/utilities/test_globalDefinitions.cpp | 6 ++----
 1 file changed, 2 insertions(+), 4 deletions(-)

diff --git a/test/hotspot/gtest/utilities/test_globalDefinitions.cpp b/test/hotspot/gtest/utilities/test_globalDefinitions.cpp
index 6636efbba8e..b8b65ae8ca8 100644
--- a/test/hotspot/gtest/utilities/test_globalDefinitions.cpp
+++ b/test/hotspot/gtest/utilities/test_globalDefinitions.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2016, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2016, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -22,7 +22,6 @@
  */
 
 #include "cppstdlib/type_traits.hpp"
-#include "memory/resourceArea.hpp"
 #include "runtime/os.hpp"
 #include "utilities/align.hpp"
 #include "utilities/globalDefinitions.hpp"
@@ -220,10 +219,9 @@ TEST(globalDefinitions, array_size) {
 
 #define check_format(format, value, expected)                  \
   do {                                                         \
-    ResourceMark rm;                                           \
     stringStream out;                                          \
     out.print((format), (value));                              \
-    const char* result = out.as_string();                      \
+    const char* result = out.base();                           \
     EXPECT_STREQ((result), (expected)) << "Failed with"        \
         << " format '"   << (format)   << "'"                  \
         << " value '"    << (value);                           \

From 3cd0b99990ae50579e6f99c043beb1ab3f2f5e89 Mon Sep 17 00:00:00 2001
From: Axel Boldt-Christmas <aboldtch@openjdk.org>
Date: Wed, 4 Mar 2026 06:13:05 +0000
Subject: [PATCH 022/655] 8372248: GTest istream.coverage depends on
 istream.basic

Reviewed-by: kbarrett, iwalulya
---
 test/hotspot/gtest/utilities/test_istream.cpp | 13 +++++--------
 1 file changed, 5 insertions(+), 8 deletions(-)

diff --git a/test/hotspot/gtest/utilities/test_istream.cpp b/test/hotspot/gtest/utilities/test_istream.cpp
index c07450822af..643d8cf8fcf 100644
--- a/test/hotspot/gtest/utilities/test_istream.cpp
+++ b/test/hotspot/gtest/utilities/test_istream.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2023, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2023, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -305,16 +305,13 @@ static void istream_test_driver(const bool VERBOSE,
 }
 
 TEST_VM(istream, basic) {
-  const bool VERBOSE = false;
-  istream_test_driver(VERBOSE, false, false, false);
-}
-
-TEST_VM(istream, coverage) {
-  const bool VERBOSE = false;
+  const bool VERBOSE_TEST = false;
+  const bool VERBOSE_COVERAGE = false;
+  istream_test_driver(VERBOSE_TEST, false, false, false);
 #ifdef ASSERT
   istream_coverage_mode(0, cases, total, zeroes);
   if (cases == 0)  return;
-  if (VERBOSE || zeroes != 0)
+  if (VERBOSE_COVERAGE || zeroes != 0)
     istream_coverage_mode(-1, cases, total, zeroes);
   EXPECT_EQ(zeroes, 0) << "zeroes: " << zeroes << "/" << cases;
 #endif //ASSERT

From 39b1e9d839c0f0089565c55accdcab5337839fbf Mon Sep 17 00:00:00 2001
From: Axel Boldt-Christmas <aboldtch@openjdk.org>
Date: Wed, 4 Mar 2026 07:07:00 +0000
Subject: [PATCH 023/655] 8372247: OSX: Semaphore.trywait requires
 os::Bsd::clock_init

Reviewed-by: dholmes, kbarrett
---
 src/hotspot/os/bsd/semaphore_bsd.cpp | 44 +++++++++++++++++-----------
 1 file changed, 27 insertions(+), 17 deletions(-)

diff --git a/src/hotspot/os/bsd/semaphore_bsd.cpp b/src/hotspot/os/bsd/semaphore_bsd.cpp
index 827c955677e..c35712ff2da 100644
--- a/src/hotspot/os/bsd/semaphore_bsd.cpp
+++ b/src/hotspot/os/bsd/semaphore_bsd.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -81,27 +81,37 @@ bool OSXSemaphore::timedwait(int64_t millis) {
 
   // kernel semaphores take a relative timeout
   mach_timespec_t waitspec;
-  int secs = millis / MILLIUNITS;
-  int nsecs = millis_to_nanos(millis % MILLIUNITS);
-  waitspec.tv_sec = secs;
-  waitspec.tv_nsec = nsecs;
+  int64_t starttime;
+  const bool is_trywait = millis == 0;
 
-  int64_t starttime = os::javaTimeNanos();
+  if (!is_trywait) {
+    int secs = millis / MILLIUNITS;
+    int nsecs = millis_to_nanos(millis % MILLIUNITS);
+    waitspec.tv_sec = secs;
+    waitspec.tv_nsec = nsecs;
+
+    starttime = os::javaTimeNanos();
+  } else {
+    waitspec.tv_sec = 0;
+    waitspec.tv_nsec = 0;
+  }
 
   kr = semaphore_timedwait(_semaphore, waitspec);
   while (kr == KERN_ABORTED) {
-    // reduce the timeout and try again
-    int64_t totalwait = millis_to_nanos(millis);
-    int64_t current = os::javaTimeNanos();
-    int64_t passedtime = current - starttime;
+    if (!is_trywait) {
+      // reduce the timeout and try again
+      int64_t totalwait = millis_to_nanos(millis);
+      int64_t current = os::javaTimeNanos();
+      int64_t passedtime = current - starttime;
 
-    if (passedtime >= totalwait) {
-      waitspec.tv_sec = 0;
-      waitspec.tv_nsec = 0;
-    } else {
-      int64_t waittime = totalwait - (current - starttime);
-      waitspec.tv_sec = waittime / NANOSECS_PER_SEC;
-      waitspec.tv_nsec = waittime % NANOSECS_PER_SEC;
+      if (passedtime >= totalwait) {
+        waitspec.tv_sec = 0;
+        waitspec.tv_nsec = 0;
+      } else {
+        int64_t waittime = totalwait - (current - starttime);
+        waitspec.tv_sec = waittime / NANOSECS_PER_SEC;
+        waitspec.tv_nsec = waittime % NANOSECS_PER_SEC;
+      }
     }
 
     kr = semaphore_timedwait(_semaphore, waitspec);

From 58d2c1d47db8a7defe2c3319cfab943296cf34f1 Mon Sep 17 00:00:00 2001
From: Jan Lahoda <jlahoda@openjdk.org>
Date: Wed, 4 Mar 2026 07:17:26 +0000
Subject: [PATCH 024/655] 8371155: Type annotations on local variables are
 classified after the local var initializer has been type checked

Reviewed-by: vromero
---
 .../sun/tools/javac/code/TypeAnnotations.java |  94 +++++---
 .../com/sun/tools/javac/comp/Attr.java        |   5 +-
 .../TypeAnnotationsOnVariables.java           | 211 ++++++++++++++++++
 3 files changed, 283 insertions(+), 27 deletions(-)
 create mode 100644 test/langtools/tools/javac/annotations/typeAnnotations/TypeAnnotationsOnVariables.java

diff --git a/src/jdk.compiler/share/classes/com/sun/tools/javac/code/TypeAnnotations.java b/src/jdk.compiler/share/classes/com/sun/tools/javac/code/TypeAnnotations.java
index 86319f20c73..8eba79c7480 100644
--- a/src/jdk.compiler/share/classes/com/sun/tools/javac/code/TypeAnnotations.java
+++ b/src/jdk.compiler/share/classes/com/sun/tools/javac/code/TypeAnnotations.java
@@ -50,6 +50,7 @@ import com.sun.tools.javac.code.TypeAnnotationPosition.TypePathEntryKind;
 import com.sun.tools.javac.code.Symbol.VarSymbol;
 import com.sun.tools.javac.code.Symbol.MethodSymbol;
 import com.sun.tools.javac.code.Type.ModuleType;
+import com.sun.tools.javac.code.Type.UnionClassType;
 import com.sun.tools.javac.comp.Annotate;
 import com.sun.tools.javac.comp.Attr;
 import com.sun.tools.javac.comp.AttrContext;
@@ -61,6 +62,7 @@ import com.sun.tools.javac.tree.JCTree.JCAnnotatedType;
 import com.sun.tools.javac.tree.JCTree.JCAnnotation;
 import com.sun.tools.javac.tree.JCTree.JCArrayTypeTree;
 import com.sun.tools.javac.tree.JCTree.JCBlock;
+import com.sun.tools.javac.tree.JCTree.JCCatch;
 import com.sun.tools.javac.tree.JCTree.JCClassDecl;
 import com.sun.tools.javac.tree.JCTree.JCExpression;
 import com.sun.tools.javac.tree.JCTree.JCFieldAccess;
@@ -70,6 +72,7 @@ import com.sun.tools.javac.tree.JCTree.JCMethodDecl;
 import com.sun.tools.javac.tree.JCTree.JCMethodInvocation;
 import com.sun.tools.javac.tree.JCTree.JCNewArray;
 import com.sun.tools.javac.tree.JCTree.JCNewClass;
+import com.sun.tools.javac.tree.JCTree.JCTry;
 import com.sun.tools.javac.tree.JCTree.JCTypeApply;
 import com.sun.tools.javac.tree.JCTree.JCTypeIntersection;
 import com.sun.tools.javac.tree.JCTree.JCTypeParameter;
@@ -111,6 +114,7 @@ public class TypeAnnotations {
     final Symtab syms;
     final Annotate annotate;
     final Attr attr;
+    final Types types;
 
     @SuppressWarnings("this-escape")
     protected TypeAnnotations(Context context) {
@@ -120,6 +124,7 @@ public class TypeAnnotations {
         syms = Symtab.instance(context);
         annotate = Annotate.instance(context);
         attr = Attr.instance(context);
+        types = Types.instance(context);
     }
 
     /**
@@ -132,7 +137,24 @@ public class TypeAnnotations {
         annotate.afterTypes(() -> {
             JavaFileObject oldSource = log.useSource(env.toplevel.sourcefile);
             try {
-                new TypeAnnotationPositions(true).scan(tree);
+                new TypeAnnotationPositions(null, true).scan(tree);
+            } finally {
+                log.useSource(oldSource);
+            }
+        });
+    }
+
+    public void organizeTypeAnnotationsSignaturesForLocalVarType(final Env<AttrContext> env, final JCVariableDecl tree) {
+        annotate.afterTypes(() -> {
+            JavaFileObject oldSource = log.useSource(env.toplevel.sourcefile);
+            try {
+                TypeAnnotationPositions pos = new TypeAnnotationPositions(env.tree, true);
+                if (env.tree instanceof JCLambda) {
+                    pos.push(env.tree);
+                } else {
+                    pos.push(env.enclMethod);
+                }
+                pos.scan(tree);
             } finally {
                 log.useSource(oldSource);
             }
@@ -155,7 +177,7 @@ public class TypeAnnotations {
      * top-level blocks, and method bodies, and should be called from Attr.
      */
     public void organizeTypeAnnotationsBodies(JCClassDecl tree) {
-        new TypeAnnotationPositions(false).scan(tree);
+        new TypeAnnotationPositions(null, false).scan(tree);
     }
 
     public enum AnnotationType { DECLARATION, TYPE, NONE, BOTH }
@@ -265,9 +287,11 @@ public class TypeAnnotations {
 
     private class TypeAnnotationPositions extends TreeScanner {
 
+        private final JCTree contextTree;
         private final boolean sigOnly;
 
-        TypeAnnotationPositions(boolean sigOnly) {
+        TypeAnnotationPositions(JCTree contextTree, boolean sigOnly) {
+            this.contextTree = contextTree;
             this.sigOnly = sigOnly;
         }
 
@@ -455,14 +479,15 @@ public class TypeAnnotations {
                 return type.annotatedType(onlyTypeAnnotations);
             } else if (type.getKind() == TypeKind.UNION) {
                 // There is a TypeKind, but no TypeTag.
+                UnionClassType ut = (UnionClassType) type;
                 JCTypeUnion tutree = (JCTypeUnion)typetree;
                 JCExpression fst = tutree.alternatives.get(0);
                 Type res = typeWithAnnotations(fst, fst.type, annotations, onlyTypeAnnotations, pos);
                 fst.type = res;
-                // TODO: do we want to set res as first element in uct.alternatives?
-                // UnionClassType uct = (com.sun.tools.javac.code.Type.UnionClassType)type;
-                // Return the un-annotated union-type.
-                return type;
+                ListBuffer<Type> alternatives = new ListBuffer<>();
+                alternatives.add(res);
+                alternatives.addAll(ut.alternatives_field.tail);
+                return new UnionClassType((ClassType) ut.getLub(), alternatives.toList());
             } else {
                 Type enclTy = type;
                 Element enclEl = type.asElement();
@@ -1237,7 +1262,17 @@ public class TypeAnnotations {
             } else if (tree.sym == null) {
                 Assert.error("Visiting tree node before memberEnter");
             } else if (tree.sym.getKind() == ElementKind.PARAMETER) {
-                // Parameters are handled in visitMethodDef or visitLambda.
+                if (sigOnly) {
+                    if (contextTree instanceof JCCatch c && c.param == tree) {
+                        //exception "parameter":
+                        final TypeAnnotationPosition pos =
+                            TypeAnnotationPosition.exceptionParameter(currentLambda,
+                                                                      tree.pos);
+                        separateAnnotationsKinds(tree, tree.vartype, tree.sym.type, tree.sym, pos);
+                    } else {
+                        // (real) parameters are handled in visitMethodDef or visitLambda.
+                    }
+                }
             } else if (tree.sym.getKind() == ElementKind.FIELD) {
                 if (sigOnly) {
                     TypeAnnotationPosition pos =
@@ -1245,27 +1280,36 @@ public class TypeAnnotations {
                     separateAnnotationsKinds(tree, tree.vartype, tree.sym.type, tree.sym, pos);
                 }
             } else if (tree.sym.getKind() == ElementKind.LOCAL_VARIABLE) {
-                final TypeAnnotationPosition pos =
-                    TypeAnnotationPosition.localVariable(currentLambda,
-                                                         tree.pos);
-                if (!tree.declaredUsingVar()) {
-                    separateAnnotationsKinds(tree, tree.vartype, tree.sym.type, tree.sym, pos);
+                if (sigOnly && !tree.declaredUsingVar()) {
+                    if (contextTree instanceof JCTry t && t.resources.contains(tree)) {
+                        final TypeAnnotationPosition pos =
+                            TypeAnnotationPosition.resourceVariable(currentLambda,
+                                                                    tree.pos);
+                        separateAnnotationsKinds(tree, tree.vartype, tree.sym.type, tree.sym, pos);
+                    } else {
+                        final TypeAnnotationPosition pos =
+                            TypeAnnotationPosition.localVariable(currentLambda,
+                                                                 tree.pos);
+                        if (!tree.declaredUsingVar()) {
+                            separateAnnotationsKinds(tree, tree.vartype, tree.sym.type, tree.sym, pos);
+                        }
+                    }
                 }
             } else if (tree.sym.getKind() == ElementKind.BINDING_VARIABLE) {
-                final TypeAnnotationPosition pos =
-                    TypeAnnotationPosition.localVariable(currentLambda,
-                                                         tree.pos);
-                separateAnnotationsKinds(tree, tree.vartype, tree.sym.type, tree.sym, pos);
+                if (sigOnly) {
+                    final TypeAnnotationPosition pos =
+                        TypeAnnotationPosition.localVariable(currentLambda,
+                                                             tree.pos);
+                    separateAnnotationsKinds(tree, tree.vartype, tree.sym.type, tree.sym, pos);
+                }
             } else if (tree.sym.getKind() == ElementKind.EXCEPTION_PARAMETER) {
-                final TypeAnnotationPosition pos =
-                    TypeAnnotationPosition.exceptionParameter(currentLambda,
-                                                              tree.pos);
-                separateAnnotationsKinds(tree, tree.vartype, tree.sym.type, tree.sym, pos);
+                if (sigOnly) {
+                    Assert.error("Should not get variable kind: " + tree.sym.getKind());
+                }
             } else if (tree.sym.getKind() == ElementKind.RESOURCE_VARIABLE) {
-                final TypeAnnotationPosition pos =
-                    TypeAnnotationPosition.resourceVariable(currentLambda,
-                                                            tree.pos);
-                separateAnnotationsKinds(tree, tree.vartype, tree.sym.type, tree.sym, pos);
+                if (sigOnly) {
+                    Assert.error("Should not get variable kind: " + tree.sym.getKind());
+                }
             } else if (tree.sym.getKind() == ElementKind.ENUM_CONSTANT) {
                 // No type annotations can occur here.
             } else {
diff --git a/src/jdk.compiler/share/classes/com/sun/tools/javac/comp/Attr.java b/src/jdk.compiler/share/classes/com/sun/tools/javac/comp/Attr.java
index 83b684e1225..444530c7266 100644
--- a/src/jdk.compiler/share/classes/com/sun/tools/javac/comp/Attr.java
+++ b/src/jdk.compiler/share/classes/com/sun/tools/javac/comp/Attr.java
@@ -1281,6 +1281,7 @@ public class Attr extends JCTree.Visitor {
                 try {
                     annotate.blockAnnotations();
                     memberEnter.memberEnter(tree, env);
+                    typeAnnotations.organizeTypeAnnotationsSignaturesForLocalVarType(env, tree);
                 } finally {
                     annotate.unblockAnnotations();
                 }
@@ -4226,7 +4227,6 @@ public class Attr extends JCTree.Visitor {
         } else {
             type = resultInfo.pt;
         }
-        tree.type = tree.var.type = type;
         BindingSymbol v = new BindingSymbol(tree.var.mods.flags | tree.var.declKind.additionalSymbolFlags,
                                             tree.var.name, type, env.info.scope.owner);
         v.pos = tree.pos;
@@ -4244,7 +4244,8 @@ public class Attr extends JCTree.Visitor {
             annotate.queueScanTreeAndTypeAnnotate(tree.var.vartype, env, v);
         }
         annotate.flush();
-        result = tree.type;
+        typeAnnotations.organizeTypeAnnotationsSignaturesForLocalVarType(env, tree.var);
+        result = tree.type = tree.var.type = v.type;
         if (v.isUnnamedVariable()) {
             matchBindings = MatchBindingsComputer.EMPTY;
         } else {
diff --git a/test/langtools/tools/javac/annotations/typeAnnotations/TypeAnnotationsOnVariables.java b/test/langtools/tools/javac/annotations/typeAnnotations/TypeAnnotationsOnVariables.java
new file mode 100644
index 00000000000..2e68e18f8f7
--- /dev/null
+++ b/test/langtools/tools/javac/annotations/typeAnnotations/TypeAnnotationsOnVariables.java
@@ -0,0 +1,211 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+/*
+ * @test
+ * @bug 8371155
+ * @summary Verify type annotations on local-like variables are propagated to
+ *          their types at an appropriate time.
+ * @library /tools/lib
+ * @modules
+ *      jdk.compiler/com.sun.tools.javac.api
+ *      jdk.compiler/com.sun.tools.javac.main
+ * @build toolbox.ToolBox toolbox.JavacTask
+ * @run main TypeAnnotationsOnVariables
+ */
+
+import com.sun.source.tree.LambdaExpressionTree;
+import com.sun.source.tree.Tree;
+import com.sun.source.tree.VariableTree;
+import com.sun.source.util.TaskEvent;
+import com.sun.source.util.TaskListener;
+import com.sun.source.util.TreePathScanner;
+import com.sun.source.util.Trees;
+import java.nio.file.Files;
+import java.nio.file.Path;
+import java.nio.file.Paths;
+import java.util.ArrayList;
+import java.util.List;
+import java.util.stream.Collectors;
+import javax.lang.model.type.TypeKind;
+import javax.lang.model.type.TypeMirror;
+import javax.lang.model.type.UnionType;
+import toolbox.JavacTask;
+import toolbox.ToolBox;
+
+public class TypeAnnotationsOnVariables {
+
+    public static void main(String... args) throws Exception {
+        new TypeAnnotationsOnVariables().run();
+    }
+
+    ToolBox tb = new ToolBox();
+
+    void run() throws Exception {
+        typeAnnotationInConstantExpressionFieldInit(Paths.get("."));
+    }
+
+    void typeAnnotationInConstantExpressionFieldInit(Path base) throws Exception {
+        Path src = base.resolve("src");
+        Path classes = base.resolve("classes");
+        tb.writeJavaFiles(src,
+                          """
+                          import java.lang.annotation.ElementType;
+                          import java.lang.annotation.Target;
+                          import java.util.function.Supplier;
+
+                          class Test {
+                              @Target(ElementType.TYPE_USE)
+                              @interface TypeAnno { }
+
+                              @TypeAnno Supplier<String> r_f_i = () -> "r_f_i";
+                              static @TypeAnno Supplier<String> r_f_s = () -> "r_f_s";
+
+                              {
+                                  @TypeAnno Supplier<String> r_init_i = () -> "r_init_i";
+                              }
+
+                              static {
+                                  @TypeAnno Supplier<String> r_init_s = () -> "r_init_s";
+                              }
+
+                              void m() {
+                                  @TypeAnno Supplier<String> r_m_i = () -> "r_m_i";
+                              }
+
+                              static void g() {
+                                  @TypeAnno Supplier<String> r_g_s = () -> "r_g_s";
+                              }
+
+                              void h() {
+                                  t_cr(() -> "t_cr");
+                              }
+
+                              void i() {
+                                  t_no_cr((@TypeAnno Supplier<String>)() -> "t_no_cr");
+                              }
+
+                              void j() {
+                                  t_no_cr((java.io.Serializable & @TypeAnno Supplier<String>)() -> "t_no_cr");
+                              }
+
+                              void k() throws Throwable {
+                                  try (@TypeAnno AutoCloseable ac = () -> {}) {}
+                              }
+
+                              void l() {
+                                  try {
+                                  } catch (@TypeAnno Exception e1) {}
+                              }
+
+                              void n() {
+                                  try {
+                                  } catch (@TypeAnno final Exception e2) {}
+                              }
+
+                              void o() {
+                                  try {
+                                  } catch (@TypeAnno IllegalStateException | @TypeAnno NullPointerException | IllegalArgumentException e3) {}
+                              }
+
+                              void t_cr(@TypeAnno Supplier<String> r_p) { }
+                              void t_no_cr(@TypeAnno Supplier<String> r_p) { }
+                          }
+                          """);
+        Files.createDirectories(classes);
+        List<String> actual = new ArrayList<>();
+        new JavacTask(tb)
+                .options("-d", classes.toString())
+                .files(tb.findJavaFiles(src))
+                .callback(task -> {
+                    task.addTaskListener(new TaskListener() {
+                        @Override
+                        public void finished(TaskEvent e) {
+                            if (e.getKind() != TaskEvent.Kind.ANALYZE) {
+                                return ;
+                            }
+                            Trees trees = Trees.instance(task);
+                            new TreePathScanner<Void, Void>() {
+                                @Override
+                                public Void visitVariable(VariableTree node, Void p) {
+                                    actual.add(node.getName() + ": " + typeToString(trees.getTypeMirror(getCurrentPath())));
+                                    return super.visitVariable(node, p);
+                                }
+                                @Override
+                                public Void visitLambdaExpression(LambdaExpressionTree node, Void p) {
+                                    actual.add(treeToString(node)+ ": " + typeToString(trees.getTypeMirror(getCurrentPath())));
+                                    return super.visitLambdaExpression(node, p);
+                                }
+                            }.scan(e.getCompilationUnit(), null);
+                        }
+                    });
+                })
+                .run()
+                .writeAll();
+
+        List<String> expected = List.of(
+            "r_f_i: java.util.function.@Test.TypeAnno Supplier<java.lang.String>",
+            "()->\"r_f_i\": java.util.function.@Test.TypeAnno Supplier<java.lang.String>",
+            "r_f_s: java.util.function.@Test.TypeAnno Supplier<java.lang.String>",
+            "()->\"r_f_s\": java.util.function.@Test.TypeAnno Supplier<java.lang.String>",
+            "r_init_i: java.util.function.@Test.TypeAnno Supplier<java.lang.String>",
+            "()->\"r_init_i\": java.util.function.@Test.TypeAnno Supplier<java.lang.String>",
+            "r_init_s: java.util.function.@Test.TypeAnno Supplier<java.lang.String>",
+            "()->\"r_init_s\": java.util.function.@Test.TypeAnno Supplier<java.lang.String>",
+            "r_m_i: java.util.function.@Test.TypeAnno Supplier<java.lang.String>",
+            "()->\"r_m_i\": java.util.function.@Test.TypeAnno Supplier<java.lang.String>",
+            "r_g_s: java.util.function.@Test.TypeAnno Supplier<java.lang.String>",
+            "()->\"r_g_s\": java.util.function.@Test.TypeAnno Supplier<java.lang.String>",
+            "()->\"t_cr\": java.util.function.@Test.TypeAnno Supplier<java.lang.String>",
+            "()->\"t_no_cr\": java.util.function.@Test.TypeAnno Supplier<java.lang.String>",
+            "()->\"t_no_cr\": java.lang.Object&java.io.Serializable&java.util.function.@Test.TypeAnno Supplier<java.lang.String>",
+            "ac: java.lang.@Test.TypeAnno AutoCloseable",
+            "()->{ }: java.lang.@Test.TypeAnno AutoCloseable",
+            "e1: java.lang.@Test.TypeAnno Exception",
+            "e2: java.lang.@Test.TypeAnno Exception",
+            "e3: java.lang.@Test.TypeAnno IllegalStateException | java.lang.@Test.TypeAnno NullPointerException | java.lang.IllegalArgumentException",
+            "r_p: java.util.function.@Test.TypeAnno Supplier<java.lang.String>",
+            "r_p: java.util.function.@Test.TypeAnno Supplier<java.lang.String>"
+        );
+
+        actual.forEach(System.out::println);
+        if (!expected.equals(actual)) {
+            throw new AssertionError("Expected: " + expected + ", but got: " + actual);
+        }
+    }
+
+    static String typeToString(TypeMirror type) {
+        if (type != null && type.getKind() == TypeKind.UNION) {
+            return ((UnionType) type).getAlternatives().stream().map(t -> typeToString(t)).collect(Collectors.joining(" | "));
+        } else {
+            return String.valueOf(type);
+        }
+    }
+
+    static String treeToString(Tree tree) {
+        if (tree.toString().contains("\n")) {
+            System.err.println("!!!");
+        }
+        return String.valueOf(tree).replaceAll("\\R", " ");
+    }
+}

From f7918df73318892cf2330812669f9c263f513127 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Manuel=20H=C3=A4ssig?= <mhaessig@openjdk.org>
Date: Wed, 4 Mar 2026 07:40:44 +0000
Subject: [PATCH 025/655] 8378779: NBody demo test times out with C1 stress
 testing

Reviewed-by: epeter, dfenacci
---
 .../jtreg/compiler/gallery/TestParticleLife.java       | 10 +++++-----
 1 file changed, 5 insertions(+), 5 deletions(-)

diff --git a/test/hotspot/jtreg/compiler/gallery/TestParticleLife.java b/test/hotspot/jtreg/compiler/gallery/TestParticleLife.java
index e0fb6164acf..bb1eea927c7 100644
--- a/test/hotspot/jtreg/compiler/gallery/TestParticleLife.java
+++ b/test/hotspot/jtreg/compiler/gallery/TestParticleLife.java
@@ -91,7 +91,7 @@ public class TestParticleLife {
     ParticleLife.State state = new ParticleLife.State();
 
     @Test
-    @Warmup(100)
+    @Warmup(75)
     @IR(counts = {IRNode.REPLICATE_F,     "> 0",
                   IRNode.LOAD_VECTOR_F,   "> 0",
                   IRNode.SUB_VF,          "> 0",
@@ -109,7 +109,7 @@ public class TestParticleLife {
     }
 
     @Test
-    @Warmup(10)
+    @Warmup(2)
     @IR(counts = {IRNode.REPLICATE_F,        "= 0",
                   IRNode.LOAD_VECTOR_F,      "= 0",
                   IRNode.REPLICATE_I,        "= 0",
@@ -138,7 +138,7 @@ public class TestParticleLife {
     }
 
     @Test
-    @Warmup(10)
+    @Warmup(2)
     @IR(counts = {IRNode.REPLICATE_F,        "> 0",
                   IRNode.LOAD_VECTOR_F,      "> 0",
                   IRNode.REPLICATE_I,        "> 0",
@@ -164,7 +164,7 @@ public class TestParticleLife {
     }
 
     @Test
-    @Warmup(10)
+    @Warmup(2)
     @IR(counts = {IRNode.REPLICATE_F,        "> 0",
                   IRNode.LOAD_VECTOR_F,      "> 0",
                   IRNode.REPLICATE_I,        "= 0", // No gather operation
@@ -191,7 +191,7 @@ public class TestParticleLife {
 
 
     @Test
-    @Warmup(10)
+    @Warmup(2)
     @IR(counts = {IRNode.REPLICATE_F,        "> 0",
                   IRNode.LOAD_VECTOR_F,      "> 0",
                   IRNode.REPLICATE_I,        "> 0",

From 5ab9ddf5e2fa31caa0f62736aff96dd8c12e0177 Mon Sep 17 00:00:00 2001
From: Albert Mingkun Yang <ayang@openjdk.org>
Date: Wed, 4 Mar 2026 09:32:05 +0000
Subject: [PATCH 026/655] 8378138: G1: Assertion failure from
 G1CollectedHeap::block_start processing during error reporting

Co-authored-by: Yasumasa Suenaga <ysuenaga@openjdk.org>
Reviewed-by: ysuenaga, iwalulya
---
 src/hotspot/share/gc/g1/g1HeapRegion.inline.hpp | 6 ++++++
 1 file changed, 6 insertions(+)

diff --git a/src/hotspot/share/gc/g1/g1HeapRegion.inline.hpp b/src/hotspot/share/gc/g1/g1HeapRegion.inline.hpp
index 4f242b7a537..f92e37fee3c 100644
--- a/src/hotspot/share/gc/g1/g1HeapRegion.inline.hpp
+++ b/src/hotspot/share/gc/g1/g1HeapRegion.inline.hpp
@@ -42,6 +42,11 @@
 #include "utilities/globalDefinitions.hpp"
 
 inline HeapWord* G1HeapRegion::block_start(const void* addr) const {
+  if (is_young()) {
+    // We are here because of BlockLocationPrinter.
+    // Can be invoked in any context, so this region might not be parsable.
+    return nullptr;
+  }
   return block_start(addr, parsable_bottom_acquire());
 }
 
@@ -64,6 +69,7 @@ inline HeapWord* G1HeapRegion::advance_to_block_containing_addr(const void* addr
 
 inline HeapWord* G1HeapRegion::block_start(const void* addr, HeapWord* const pb) const {
   assert(addr >= bottom() && addr < top(), "invalid address");
+  assert(!is_young(), "Only non-young regions have BOT");
   HeapWord* first_block = _bot->block_start_reaching_into_card(addr);
   return advance_to_block_containing_addr(addr, pb, first_block);
 }

From f26b379b97301aca49dda9cb5dfe9a5472af7140 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Daniel=20Jeli=C5=84ski?= <djelinski@openjdk.org>
Date: Wed, 4 Mar 2026 09:49:24 +0000
Subject: [PATCH 027/655] 8378927:
 H3MultipleConnectionsToSameHost.java#with-continuations intermittent fails

Reviewed-by: syan, dfuchs
---
 .../http3/H3MultipleConnectionsToSameHost.java | 18 ++++++++++++------
 1 file changed, 12 insertions(+), 6 deletions(-)

diff --git a/test/jdk/java/net/httpclient/http3/H3MultipleConnectionsToSameHost.java b/test/jdk/java/net/httpclient/http3/H3MultipleConnectionsToSameHost.java
index 67ac821b6f7..f9ba35359bc 100644
--- a/test/jdk/java/net/httpclient/http3/H3MultipleConnectionsToSameHost.java
+++ b/test/jdk/java/net/httpclient/http3/H3MultipleConnectionsToSameHost.java
@@ -30,6 +30,9 @@
  * @build jdk.test.lib.net.SimpleSSLContext
  *        jdk.httpclient.test.lib.http2.Http2TestServer
  * @run junit/othervm/timeout=360 -XX:+CrashOnOutOfMemoryError
+ *                     -Djdk.httpclient.quic.idleTimeout=100000
+ *                     -Djdk.httpclient.keepalive.timeout.h3=100000
+ *                     -Djdk.test.server.quic.idleTimeout=100000
  *                     -Djdk.httpclient.quic.minPtoBackoffTime=60
  *                     -Djdk.httpclient.quic.maxPtoBackoffTime=90
  *                     -Djdk.httpclient.quic.maxPtoBackoff=10
@@ -53,6 +56,9 @@
  * @build jdk.test.lib.net.SimpleSSLContext
  *        jdk.httpclient.test.lib.http2.Http2TestServer
  * @run junit/othervm/timeout=360 -XX:+CrashOnOutOfMemoryError
+ *                     -Djdk.httpclient.quic.idleTimeout=100000
+ *                     -Djdk.httpclient.keepalive.timeout.h3=100000
+ *                     -Djdk.test.server.quic.idleTimeout=100000
  *                     -Djdk.httpclient.quic.minPtoBackoffTime=45
  *                     -Djdk.httpclient.quic.maxPtoBackoffTime=60
  *                     -Djdk.httpclient.quic.maxPtoBackoff=9
@@ -76,9 +82,9 @@
  * @build jdk.test.lib.net.SimpleSSLContext
  *        jdk.httpclient.test.lib.http2.Http2TestServer
  * @run junit/othervm/timeout=360 -XX:+CrashOnOutOfMemoryError
- *                     -Djdk.httpclient.quic.idleTimeout=120
- *                     -Djdk.httpclient.keepalive.timeout.h3=120
- *                     -Djdk.test.server.quic.idleTimeout=90
+ *                     -Djdk.httpclient.quic.idleTimeout=100000
+ *                     -Djdk.httpclient.keepalive.timeout.h3=100000
+ *                     -Djdk.test.server.quic.idleTimeout=100000
  *                     -Djdk.httpclient.quic.minPtoBackoffTime=60
  *                     -Djdk.httpclient.quic.maxPtoBackoffTime=120
  *                     -Djdk.httpclient.quic.maxPtoBackoff=9
@@ -101,9 +107,9 @@
  * @build jdk.test.lib.net.SimpleSSLContext
  *        jdk.httpclient.test.lib.http2.Http2TestServer
  * @run junit/othervm/timeout=360 -XX:+CrashOnOutOfMemoryError
- *                     -Djdk.httpclient.quic.idleTimeout=120
- *                     -Djdk.httpclient.keepalive.timeout.h3=120
- *                     -Djdk.test.server.quic.idleTimeout=90
+ *                     -Djdk.httpclient.quic.idleTimeout=100000
+ *                     -Djdk.httpclient.keepalive.timeout.h3=100000
+ *                     -Djdk.test.server.quic.idleTimeout=100000
  *                     -Djdk.httpclient.quic.minPtoBackoffTime=60
  *                     -Djdk.httpclient.quic.maxPtoBackoffTime=120
  *                     -Djdk.httpclient.quic.maxPtoBackoff=9

From d78a13a7cce07b28668ed88f209f94693f0e607f Mon Sep 17 00:00:00 2001
From: Kerem Kat <krk@openjdk.org>
Date: Wed, 4 Mar 2026 10:39:42 +0000
Subject: [PATCH 028/655] 8366138: Parse::jump_switch_ranges() could cause
 stack overflow when compiling huge switch statement

Reviewed-by: rasbold, dfenacci, mchevalier
---
 src/hotspot/share/opto/parse2.cpp             | 53 +++++++---
 .../compiler/c2/TestSwitchStackOverflow.java  | 99 +++++++++++++++++++
 2 files changed, 136 insertions(+), 16 deletions(-)
 create mode 100644 test/hotspot/jtreg/compiler/c2/TestSwitchStackOverflow.java

diff --git a/src/hotspot/share/opto/parse2.cpp b/src/hotspot/share/opto/parse2.cpp
index eac2b3e863a..7f41870ccea 100644
--- a/src/hotspot/share/opto/parse2.cpp
+++ b/src/hotspot/share/opto/parse2.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1998, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1998, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -966,12 +966,28 @@ void Parse::jump_switch_ranges(Node* key_val, SwitchRange *lo, SwitchRange *hi,
     _max_switch_depth = 0;
     _est_switch_depth = log2i_graceful((hi - lo + 1) - 1) + 1;
   }
+  SwitchRange* orig_lo = lo;
+  SwitchRange* orig_hi = hi;
 #endif
 
-  assert(lo <= hi, "must be a non-empty set of ranges");
-  if (lo == hi) {
-    jump_if_always_fork(lo->dest(), trim_ranges && lo->cnt() == 0);
-  } else {
+  // The lower-range processing is done iteratively to avoid O(N) stack depth
+  // when the profiling-based pivot repeatedly selects mid==lo (JDK-8366138).
+  // The upper-range processing remains recursive but is only reached for
+  // balanced splits, bounding its depth to O(log N).
+  // Termination: every iteration either exits or strictly decreases hi-lo:
+  //   lo == mid && mid < hi, increments lo
+  //   lo < mid <= hi, sets hi = mid - 1.
+  for (int depth = switch_depth;; depth++) {
+#ifndef PRODUCT
+    _max_switch_depth = MAX2(depth, _max_switch_depth);
+#endif
+
+    assert(lo <= hi, "must be a non-empty set of ranges");
+    if (lo == hi) {
+      jump_if_always_fork(lo->dest(), trim_ranges && lo->cnt() == 0);
+      break;
+    }
+
     assert(lo->hi() == (lo+1)->lo()-1, "contiguous ranges");
     assert(hi->lo() == (hi-1)->hi()+1, "contiguous ranges");
 
@@ -981,7 +997,12 @@ void Parse::jump_switch_ranges(Node* key_val, SwitchRange *lo, SwitchRange *hi,
     float total_cnt = sum_of_cnts(lo, hi);
 
     int nr = hi - lo + 1;
-    if (UseSwitchProfiling) {
+    // With total_cnt==0 the profiling pivot degenerates to mid==lo
+    // (0 >= 0/2), producing a linear chain of If nodes instead of a
+    // balanced tree. A balanced tree is strictly better here: all paths
+    // are cold, so a balanced split gives fewer comparisons at runtime
+    // and avoids pathological memory usage in the optimizer.
+    if (UseSwitchProfiling && total_cnt > 0) {
       // Don't keep the binary search tree balanced: pick up mid point
       // that split frequencies in half.
       float cnt = 0;
@@ -1002,7 +1023,7 @@ void Parse::jump_switch_ranges(Node* key_val, SwitchRange *lo, SwitchRange *hi,
       assert(nr != 2 || mid == hi,   "should pick higher of 2");
       assert(nr != 3 || mid == hi-1, "should pick middle of 3");
     }
-
+    assert(mid != nullptr, "mid must be set");
 
     Node *test_val = _gvn.intcon(mid == lo ? mid->hi() : mid->lo());
 
@@ -1025,7 +1046,7 @@ void Parse::jump_switch_ranges(Node* key_val, SwitchRange *lo, SwitchRange *hi,
         Node   *iffalse = _gvn.transform( new IfFalseNode(iff_lt) );
         { PreserveJVMState pjvms(this);
           set_control(iffalse);
-          jump_switch_ranges(key_val, mid+1, hi, switch_depth+1);
+          jump_switch_ranges(key_val, mid+1, hi, depth+1);
         }
         set_control(iftrue);
       }
@@ -1043,21 +1064,22 @@ void Parse::jump_switch_ranges(Node* key_val, SwitchRange *lo, SwitchRange *hi,
         Node *iffalse = _gvn.transform( new IfFalseNode(iff_ge) );
         { PreserveJVMState pjvms(this);
           set_control(iftrue);
-          jump_switch_ranges(key_val, mid == lo ? mid+1 : mid, hi, switch_depth+1);
+          jump_switch_ranges(key_val, mid == lo ? mid+1 : mid, hi, depth+1);
         }
         set_control(iffalse);
       }
     }
 
-    // in any case, process the lower range
+    // Process the lower range: iterate instead of recursing.
     if (mid == lo) {
       if (mid->is_singleton()) {
-        jump_switch_ranges(key_val, lo+1, hi, switch_depth+1);
+        lo++;
       } else {
         jump_if_always_fork(lo->dest(), trim_ranges && lo->cnt() == 0);
+        break;
       }
     } else {
-      jump_switch_ranges(key_val, lo, mid-1, switch_depth+1);
+      hi = mid - 1;
     }
   }
 
@@ -1072,23 +1094,22 @@ void Parse::jump_switch_ranges(Node* key_val, SwitchRange *lo, SwitchRange *hi,
   }
 
 #ifndef PRODUCT
-  _max_switch_depth = MAX2(switch_depth, _max_switch_depth);
   if (TraceOptoParse && Verbose && WizardMode && switch_depth == 0) {
     SwitchRange* r;
     int nsing = 0;
-    for( r = lo; r <= hi; r++ ) {
+    for (r = orig_lo; r <= orig_hi; r++) {
       if( r->is_singleton() )  nsing++;
     }
     tty->print(">>> ");
     _method->print_short_name();
     tty->print_cr(" switch decision tree");
     tty->print_cr("    %d ranges (%d singletons), max_depth=%d, est_depth=%d",
-                  (int) (hi-lo+1), nsing, _max_switch_depth, _est_switch_depth);
+                  (int) (orig_hi-orig_lo+1), nsing, _max_switch_depth, _est_switch_depth);
     if (_max_switch_depth > _est_switch_depth) {
       tty->print_cr("******** BAD SWITCH DEPTH ********");
     }
     tty->print("   ");
-    for( r = lo; r <= hi; r++ ) {
+    for (r = orig_lo; r <= orig_hi; r++) {
       r->print();
     }
     tty->cr();
diff --git a/test/hotspot/jtreg/compiler/c2/TestSwitchStackOverflow.java b/test/hotspot/jtreg/compiler/c2/TestSwitchStackOverflow.java
new file mode 100644
index 00000000000..adbfa537aed
--- /dev/null
+++ b/test/hotspot/jtreg/compiler/c2/TestSwitchStackOverflow.java
@@ -0,0 +1,99 @@
+/*
+ * Copyright Amazon.com Inc. or its affiliates. All Rights Reserved.
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+/**
+ * @test
+ * @bug 8366138
+ * @summary C2: jump_switch_ranges could cause stack overflow when compiling
+ *          huge switch statement with zero-count profiling data.
+ * @library /test/lib /
+ * @run main/othervm ${test.main.class}
+ * @run main/othervm -Xbatch -XX:CompileOnly=Test::test -XX:-DontCompileHugeMethods -XX:CompilerThreadStackSize=512 ${test.main.class}
+ * @run main/othervm -Xbatch -XX:CompileOnly=Test::test -XX:+DontCompileHugeMethods -XX:CompilerThreadStackSize=512 ${test.main.class}
+ */
+
+package compiler.c2;
+
+import java.util.stream.Stream;
+
+import compiler.lib.compile_framework.CompileFramework;
+import compiler.lib.template_framework.Template;
+import static compiler.lib.template_framework.Template.scope;
+
+public class TestSwitchStackOverflow {
+    // Template method exceeds HugeMethodLimit, hence -XX:-DontCompileHugeMethods.
+    // 5000 cases + CompilerThreadStackSize=512 reliably overflows without the fix.
+    static final int NUM_CASES = 5000;
+
+    // Generate a class with a large tableswitch method and a main that
+    // triggers recompilation with zero-count profiling data:
+    //   Phase 1: warm up with default-only path -> C2 compiles
+    //   Phase 2: hit a case -> triggers unstable_if deopt
+    //   Phase 3: recompile with all counts zero (except the default case)
+    static String generate() {
+        var caseTemplate = Template.make("i", (Integer i) -> scope(
+            """
+            case #i:
+                return #i;
+            """
+        ));
+        var test = Template.make(() -> scope(
+            """
+            public class Test {
+                static int test(int x) {
+                    switch (x) {
+                    """,
+                    Stream.iterate(0, i -> i + 1)
+                          .limit(NUM_CASES)
+                          .map(i -> caseTemplate.asToken(i))
+                          .toList(),
+                    """
+                        default: return -1;
+                    }
+                }
+
+                public static void main(String[] args) {
+                    for (int i = 0; i < 10_000; i++) {
+                        test(-1);
+                    }
+                    test(42);
+                    for (int i = 0; i < 10_000; i++) {
+                        test(-1);
+                    }
+                    System.out.println("Done");
+                }
+            }
+            """
+        ));
+
+        return test.render();
+    }
+
+    public static void main(String[] args) {
+        CompileFramework comp = new CompileFramework();
+        comp.addJavaSourceCode("Test", generate());
+        comp.compile();
+        comp.invoke("Test", "main", new Object[] { new String[0] });
+    }
+}

From 329e14b0744912293faa7769b22fa348cb1d10aa Mon Sep 17 00:00:00 2001
From: Kerem Kat <krk@openjdk.org>
Date: Wed, 4 Mar 2026 10:56:49 +0000
Subject: [PATCH 029/655] 8375688: C2: Missed Ideal optimization opportunity
 with VectorMaskToLong and -XX:+StressIncrementalInlining

Reviewed-by: qamai, dfenacci
---
 src/hotspot/share/opto/phaseX.cpp             |  10 +
 .../vectorapi/TestVectorMaskToLongStress.java | 180 ++++++++++++++++++
 2 files changed, 190 insertions(+)
 create mode 100644 test/hotspot/jtreg/compiler/vectorapi/TestVectorMaskToLongStress.java

diff --git a/src/hotspot/share/opto/phaseX.cpp b/src/hotspot/share/opto/phaseX.cpp
index 3cbbc114778..bc0bed31370 100644
--- a/src/hotspot/share/opto/phaseX.cpp
+++ b/src/hotspot/share/opto/phaseX.cpp
@@ -2725,6 +2725,16 @@ void PhaseIterGVN::add_users_of_use_to_worklist(Node* n, Node* use, Unique_Node_
       worklist.push(cmp);
     }
   }
+  // VectorMaskToLongNode::Ideal_MaskAll looks through VectorStoreMask
+  // to fold constant masks.
+  if (use_op == Op_VectorStoreMask) {
+    for (DUIterator_Fast i2max, i2 = use->fast_outs(i2max); i2 < i2max; i2++) {
+      Node* u = use->fast_out(i2);
+      if (u->Opcode() == Op_VectorMaskToLong) {
+        worklist.push(u);
+      }
+    }
+  }
 
   // From CastX2PNode::Ideal
   // CastX2P(AddX(x, y))
diff --git a/test/hotspot/jtreg/compiler/vectorapi/TestVectorMaskToLongStress.java b/test/hotspot/jtreg/compiler/vectorapi/TestVectorMaskToLongStress.java
new file mode 100644
index 00000000000..f9807754539
--- /dev/null
+++ b/test/hotspot/jtreg/compiler/vectorapi/TestVectorMaskToLongStress.java
@@ -0,0 +1,180 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+/*
+ * @test
+ * @bug 8375688
+ * @key randomness
+ * @library /test/lib /
+ * @summary VectorMaskToLong constant folding through VectorStoreMask must work under StressIncrementalInlining
+ * @modules jdk.incubator.vector
+ *
+ * @run driver ${test.main.class}
+ */
+
+package compiler.vectorapi;
+
+import compiler.lib.ir_framework.*;
+import jdk.incubator.vector.*;
+import jdk.test.lib.Asserts;
+
+/**
+ * Tests that VectorMaskToLongNode::Ideal_MaskAll folds constant masks even
+ * when StressIncrementalInlining randomizes the IGVN worklist order.
+ *
+ * Each test method does {@code VectorMask.fromLong(SPECIES, constant).toLong()}
+ * and asserts that VectorMaskToLong is folded away entirely (count = 0).
+ *
+ * Ideal_MaskAll looks through VectorStoreMask to inspect its input. Without the worklist
+ * propagation fix in PhaseIterGVN::add_users_of_use_to_worklist (JDK-8375688), VectorMaskToLong
+ * is not re-visited after VectorStoreMask's input becomes a recognized constant,
+ * leaving the fold opportunity missed.
+ *
+ * IR rules cover three hardware paths:
+ * - AVX-512/SVE/RVV: masks fold through MaskAll (correctness check only, VectorStoreMask
+ *   is not involved on these platforms)
+ * - AVX2 without AVX-512: masks go through VectorStoreMask, directly exercising the worklist fix
+ * - ASIMD without SVE: same VectorStoreMask path, on AArch64
+ *
+ * {@code @Check} methods verify correctness on all platforms, including those where no IR rule applies.
+ * Float/Double species are excluded because VectorMaskToLong fails to fold their masks
+ * due to an intervening VectorMaskCast (JDK-8377588).
+ */
+public class TestVectorMaskToLongStress {
+    static final VectorSpecies<Byte> B_SPECIES = ByteVector.SPECIES_MAX;
+    static final VectorSpecies<Short> S_SPECIES = ShortVector.SPECIES_MAX;
+    static final VectorSpecies<Integer> I_SPECIES = IntVector.SPECIES_MAX;
+    static final VectorSpecies<Long> L_SPECIES = LongVector.SPECIES_MAX;
+
+    // --- All-ones mask: fromLong(-1).toLong() should fold to a constant ---
+
+    @Test
+    @IR(counts = { IRNode.VECTOR_MASK_TO_LONG, "= 0" },
+        applyIfCPUFeatureOr = { "avx512", "true", "sve", "true", "rvv", "true" })
+    @IR(counts = { IRNode.VECTOR_MASK_TO_LONG, "= 0" },
+        applyIfCPUFeatureAnd = { "avx2", "true", "avx512", "false" })
+    @IR(counts = { IRNode.VECTOR_MASK_TO_LONG, "= 0" },
+        applyIfCPUFeatureAnd = { "asimd", "true", "sve", "false" })
+    public static long testAllOnesByte() {
+        return VectorMask.fromLong(B_SPECIES, -1L).toLong();
+    }
+
+    @Test
+    @IR(counts = { IRNode.VECTOR_MASK_TO_LONG, "= 0" },
+        applyIfCPUFeatureOr = { "avx512", "true", "sve", "true", "rvv", "true" })
+    @IR(counts = { IRNode.VECTOR_MASK_TO_LONG, "= 0" },
+        applyIfCPUFeatureAnd = { "avx2", "true", "avx512", "false" })
+    @IR(counts = { IRNode.VECTOR_MASK_TO_LONG, "= 0" },
+        applyIfCPUFeatureAnd = { "asimd", "true", "sve", "false" })
+    public static long testAllOnesShort() {
+        return VectorMask.fromLong(S_SPECIES, -1L).toLong();
+    }
+
+    @Test
+    @IR(counts = { IRNode.VECTOR_MASK_TO_LONG, "= 0" },
+        applyIfCPUFeatureOr = { "avx512", "true", "sve", "true", "rvv", "true" })
+    @IR(counts = { IRNode.VECTOR_MASK_TO_LONG, "= 0" },
+        applyIfCPUFeatureAnd = { "avx2", "true", "avx512", "false" })
+    @IR(counts = { IRNode.VECTOR_MASK_TO_LONG, "= 0" },
+        applyIfCPUFeatureAnd = { "asimd", "true", "sve", "false" })
+    public static long testAllOnesInt() {
+        return VectorMask.fromLong(I_SPECIES, -1L).toLong();
+    }
+
+    @Test
+    @IR(counts = { IRNode.VECTOR_MASK_TO_LONG, "= 0" },
+        applyIfCPUFeatureOr = { "avx512", "true", "sve", "true", "rvv", "true" })
+    @IR(counts = { IRNode.VECTOR_MASK_TO_LONG, "= 0" },
+        applyIfCPUFeatureAnd = { "avx2", "true", "avx512", "false" })
+    @IR(counts = { IRNode.VECTOR_MASK_TO_LONG, "= 0" },
+        applyIfCPUFeatureAnd = { "asimd", "true", "sve", "false" })
+    public static long testAllOnesLong() {
+        return VectorMask.fromLong(L_SPECIES, -1L).toLong();
+    }
+
+    // --- All-zeros mask: fromLong(0).toLong() should fold to a constant ---
+
+    @Test
+    @IR(counts = { IRNode.VECTOR_MASK_TO_LONG, "= 0" },
+        applyIfCPUFeatureOr = { "avx512", "true", "sve", "true", "rvv", "true" })
+    @IR(counts = { IRNode.VECTOR_MASK_TO_LONG, "= 0" },
+        applyIfCPUFeatureAnd = { "avx2", "true", "avx512", "false" })
+    @IR(counts = { IRNode.VECTOR_MASK_TO_LONG, "= 0" },
+        applyIfCPUFeatureAnd = { "asimd", "true", "sve", "false" })
+    public static long testAllZerosByte() {
+        return VectorMask.fromLong(B_SPECIES, 0L).toLong();
+    }
+
+    @Test
+    @IR(counts = { IRNode.VECTOR_MASK_TO_LONG, "= 0" },
+        applyIfCPUFeatureOr = { "avx512", "true", "sve", "true", "rvv", "true" })
+    @IR(counts = { IRNode.VECTOR_MASK_TO_LONG, "= 0" },
+        applyIfCPUFeatureAnd = { "avx2", "true", "avx512", "false" })
+    @IR(counts = { IRNode.VECTOR_MASK_TO_LONG, "= 0" },
+        applyIfCPUFeatureAnd = { "asimd", "true", "sve", "false" })
+    public static long testAllZerosInt() {
+        return VectorMask.fromLong(I_SPECIES, 0L).toLong();
+    }
+
+    // --- Verification ---
+
+    @Check(test = "testAllOnesByte")
+    public static void checkAllOnesByte(long result) {
+        Asserts.assertEquals(-1L >>> (64 - B_SPECIES.length()), result);
+    }
+
+    @Check(test = "testAllOnesShort")
+    public static void checkAllOnesShort(long result) {
+        Asserts.assertEquals(-1L >>> (64 - S_SPECIES.length()), result);
+    }
+
+    @Check(test = "testAllOnesInt")
+    public static void checkAllOnesInt(long result) {
+        Asserts.assertEquals(-1L >>> (64 - I_SPECIES.length()), result);
+    }
+
+    @Check(test = "testAllOnesLong")
+    public static void checkAllOnesLong(long result) {
+        Asserts.assertEquals(-1L >>> (64 - L_SPECIES.length()), result);
+    }
+
+    @Check(test = "testAllZerosByte")
+    public static void checkAllZerosByte(long result) {
+        Asserts.assertEquals(0L, result);
+    }
+
+    @Check(test = "testAllZerosInt")
+    public static void checkAllZerosInt(long result) {
+        Asserts.assertEquals(0L, result);
+    }
+
+    public static void main(String[] args) {
+        TestFramework testFramework = new TestFramework();
+        testFramework.addFlags("--add-modules=jdk.incubator.vector",
+                               "-XX:+IgnoreUnrecognizedVMOptions",
+                               "-XX:+StressIncrementalInlining",
+                               "-XX:CompileCommand=compileonly,compiler.vectorapi.TestVectorMaskToLongStress::*",
+                               "-XX:VerifyIterativeGVN=1110")
+                     .start();
+    }
+}

From a3b468cec3997c62a2f55302b0338aa0a2bb3055 Mon Sep 17 00:00:00 2001
From: Thomas Schatzl <tschatzl@openjdk.org>
Date: Wed, 4 Mar 2026 11:12:40 +0000
Subject: [PATCH 030/655] 8379119: G1: Move NoteStartOfMarkHRClosure out of
 global namespace

Reviewed-by: aboldtch, ayang
---
 src/hotspot/share/gc/g1/g1ConcurrentMark.cpp | 54 +++++++++-----------
 1 file changed, 25 insertions(+), 29 deletions(-)

diff --git a/src/hotspot/share/gc/g1/g1ConcurrentMark.cpp b/src/hotspot/share/gc/g1/g1ConcurrentMark.cpp
index ec5649f4fe2..074231a02d4 100644
--- a/src/hotspot/share/gc/g1/g1ConcurrentMark.cpp
+++ b/src/hotspot/share/gc/g1/g1ConcurrentMark.cpp
@@ -898,9 +898,26 @@ public:
 };
 
 class G1PreConcurrentStartTask::NoteStartOfMarkTask : public G1AbstractSubTask {
+
+  class NoteStartOfMarkHRClosure : public G1HeapRegionClosure {
+    G1ConcurrentMark* _cm;
+
+  public:
+    NoteStartOfMarkHRClosure() : G1HeapRegionClosure(), _cm(G1CollectedHeap::heap()->concurrent_mark()) { }
+
+    bool do_heap_region(G1HeapRegion* r) override {
+      if (r->is_old_or_humongous() && !r->is_collection_set_candidate() && !r->in_collection_set()) {
+        _cm->update_top_at_mark_start(r);
+      } else {
+        _cm->reset_top_at_mark_start(r);
+      }
+      return false;
+    }
+  } _region_cl;
+
   G1HeapRegionClaimer _claimer;
 public:
-  NoteStartOfMarkTask() : G1AbstractSubTask(G1GCPhaseTimes::NoteStartOfMark), _claimer(0) { }
+  NoteStartOfMarkTask() : G1AbstractSubTask(G1GCPhaseTimes::NoteStartOfMark), _region_cl(), _claimer(0) { }
 
   double worker_cost() const override {
     // The work done per region is very small, therefore we choose this magic number to cap the number
@@ -909,8 +926,13 @@ public:
     return _claimer.n_regions() / regions_per_thread;
   }
 
-  void set_max_workers(uint max_workers) override;
-  void do_work(uint worker_id) override;
+  void set_max_workers(uint max_workers) override {
+    _claimer.set_n_workers(max_workers);
+  }
+
+  void do_work(uint worker_id) override {
+    G1CollectedHeap::heap()->heap_region_par_iterate_from_worker_offset(&_region_cl, &_claimer, worker_id);
+  }
 };
 
 void G1PreConcurrentStartTask::ResetMarkingStateTask::do_work(uint worker_id) {
@@ -918,31 +940,6 @@ void G1PreConcurrentStartTask::ResetMarkingStateTask::do_work(uint worker_id) {
   _cm->reset();
 }
 
-class NoteStartOfMarkHRClosure : public G1HeapRegionClosure {
-  G1ConcurrentMark* _cm;
-
-public:
-  NoteStartOfMarkHRClosure() : G1HeapRegionClosure(), _cm(G1CollectedHeap::heap()->concurrent_mark()) { }
-
-  bool do_heap_region(G1HeapRegion* r) override {
-    if (r->is_old_or_humongous() && !r->is_collection_set_candidate() && !r->in_collection_set()) {
-      _cm->update_top_at_mark_start(r);
-    } else {
-      _cm->reset_top_at_mark_start(r);
-    }
-    return false;
-  }
-};
-
-void G1PreConcurrentStartTask::NoteStartOfMarkTask::do_work(uint worker_id) {
-  NoteStartOfMarkHRClosure start_cl;
-  G1CollectedHeap::heap()->heap_region_par_iterate_from_worker_offset(&start_cl, &_claimer, worker_id);
-}
-
-void G1PreConcurrentStartTask::NoteStartOfMarkTask::set_max_workers(uint max_workers) {
-  _claimer.set_n_workers(max_workers);
-}
-
 G1PreConcurrentStartTask::G1PreConcurrentStartTask(GCCause::Cause cause, G1ConcurrentMark* cm) :
   G1BatchedTask("Pre Concurrent Start", G1CollectedHeap::heap()->phase_times()) {
   add_serial_task(new ResetMarkingStateTask(cm));
@@ -962,7 +959,6 @@ void G1ConcurrentMark::pre_concurrent_start(GCCause::Cause cause) {
   _gc_tracer_cm->set_gc_cause(cause);
 }
 
-
 void G1ConcurrentMark::post_concurrent_mark_start() {
   // Start Concurrent Marking weak-reference discovery.
   ReferenceProcessor* rp = _g1h->ref_processor_cm();

From ff8b0ac048f6a6f75d1ad738d3354890d76d8128 Mon Sep 17 00:00:00 2001
From: Vicente Romero <vromero@openjdk.org>
Date: Wed, 4 Mar 2026 11:45:09 +0000
Subject: [PATCH 031/655] 8214934: Wrong type annotation offset on casts on
 expressions

Reviewed-by: jlahoda
---
 .../com/sun/tools/javac/comp/TransTypes.java  |  24 ++-
 .../IncorrectCastOffsetTest.java              | 175 ++++++++++++++++++
 2 files changed, 194 insertions(+), 5 deletions(-)
 create mode 100644 test/langtools/tools/javac/annotations/typeAnnotations/IncorrectCastOffsetTest.java

diff --git a/src/jdk.compiler/share/classes/com/sun/tools/javac/comp/TransTypes.java b/src/jdk.compiler/share/classes/com/sun/tools/javac/comp/TransTypes.java
index 862c02ea5f0..1229939c0bf 100644
--- a/src/jdk.compiler/share/classes/com/sun/tools/javac/comp/TransTypes.java
+++ b/src/jdk.compiler/share/classes/com/sun/tools/javac/comp/TransTypes.java
@@ -29,7 +29,6 @@ package com.sun.tools.javac.comp;
 import com.sun.source.tree.MemberReferenceTree.ReferenceMode;
 import com.sun.tools.javac.code.*;
 import com.sun.tools.javac.code.Attribute.TypeCompound;
-import com.sun.tools.javac.code.Source.Feature;
 import com.sun.tools.javac.code.Symbol.*;
 import com.sun.tools.javac.code.Type.TypeVar;
 import com.sun.tools.javac.jvm.Target;
@@ -49,8 +48,6 @@ import static com.sun.tools.javac.code.TypeTag.VOID;
 import static com.sun.tools.javac.comp.CompileStates.CompileState;
 import com.sun.tools.javac.tree.JCTree.JCBreak;
 
-import javax.lang.model.type.TypeKind;
-
 /** This pass translates Generic Java to conventional Java.
  *
  *  <p><b>This is NOT part of any supported API.
@@ -109,7 +106,9 @@ public class TransTypes extends TreeTranslator {
         if (!types.isSameType(tree.type, target)) {
             if (!resolve.isAccessible(env, target.tsym))
                 resolve.logAccessErrorInternal(env, tree, target);
-            tree = make.TypeCast(make.Type(target), tree).setType(target);
+            tree = explicitCastTP != null && types.isSameType(target, explicitCastTP) ?
+                    tree :
+                    make.TypeCast(make.Type(target), tree).setType(target);
         }
         make.pos = oldpos;
         return tree;
@@ -440,16 +439,29 @@ public class TransTypes extends TreeTranslator {
     /** Visitor argument: proto-type.
      */
     private Type pt;
+    /** we use this type to indicate that "upstream" there is an explicit cast to this type,
+     *  this way we can avoid generating redundant type casts. Redundant casts are not
+     *  innocuous as they can trump user provided ones and affect the offset
+     *  calculation of type annotations applied to the user provided type cast.
+     */
+    private Type explicitCastTP;
 
     /** Visitor method: perform a type translation on tree.
      */
     public <T extends JCTree> T translate(T tree, Type pt) {
+        return translate(tree, pt, pt == explicitCastTP ? explicitCastTP : null);
+    }
+
+    public <T extends JCTree> T translate(T tree, Type pt, Type castTP) {
         Type prevPt = this.pt;
+        Type prevCastPT = this.explicitCastTP;
         try {
             this.pt = pt;
+            this.explicitCastTP = castTP;
             return translate(tree);
         } finally {
             this.pt = prevPt;
+            this.explicitCastTP = prevCastPT;
         }
     }
 
@@ -1037,7 +1049,9 @@ public class TransTypes extends TreeTranslator {
         tree.clazz = translate(tree.clazz, null);
         Type originalTarget = tree.type;
         tree.type = erasure(tree.type);
-        JCExpression newExpression = translate(tree.expr, tree.type);
+        JCExpression newExpression = tree.clazz.hasTag(Tag.ANNOTATED_TYPE) ?
+                translate(tree.expr, tree.type, tree.type) :
+                translate(tree.expr, tree.type);
         if (newExpression != tree.expr) {
             JCTypeCast typeCast = newExpression.hasTag(Tag.TYPECAST)
                 ? (JCTypeCast) newExpression
diff --git a/test/langtools/tools/javac/annotations/typeAnnotations/IncorrectCastOffsetTest.java b/test/langtools/tools/javac/annotations/typeAnnotations/IncorrectCastOffsetTest.java
new file mode 100644
index 00000000000..f679926bcf4
--- /dev/null
+++ b/test/langtools/tools/javac/annotations/typeAnnotations/IncorrectCastOffsetTest.java
@@ -0,0 +1,175 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+/*
+ * @test
+ * @bug 8214934
+ * @summary Wrong type annotation offset on casts on expressions
+ * @library /tools/lib
+ * @modules jdk.compiler/com.sun.tools.javac.api
+ *          jdk.compiler/com.sun.tools.javac.main
+ *          jdk.jdeps/com.sun.tools.javap
+ * @build toolbox.ToolBox toolbox.JavapTask
+ * @run compile IncorrectCastOffsetTest.java
+ * @run main IncorrectCastOffsetTest
+ */
+
+import java.lang.annotation.ElementType;
+import java.lang.annotation.Target;
+import java.lang.annotation.Retention;
+import java.lang.annotation.RetentionPolicy;
+
+import java.nio.file.Path;
+import java.nio.file.Paths;
+
+import java.util.List;
+
+import toolbox.JavapTask;
+import toolbox.Task;
+import toolbox.ToolBox;
+
+public class IncorrectCastOffsetTest {
+    @Target(ElementType.TYPE_USE)
+    @Retention(RetentionPolicy.RUNTIME)
+    @interface TypeUse {}
+
+    @Target(ElementType.TYPE_USE)
+    @Retention(RetentionPolicy.RUNTIME)
+    @interface TypeUse2 {}
+
+    class AnnotatedCast1 {
+        private static String checkcast(boolean test, Object obj, Object obj2) {
+            return (@TypeUse String)(test ? obj : obj2);
+        }
+    }
+
+    class AnnotatedCast2 {
+        private static String checkcast(Object obj) {
+            return (@TypeUse String)(obj);
+        }
+    }
+
+    class AnnotatedCast3 {
+        private static String checkcast(boolean test, Object obj, Object obj2) {
+            return (@TypeUse @TypeUse2 String)(test ? obj : obj2);
+        }
+    }
+
+    class AnnotatedCast4 {
+        private static String checkcast(Object obj) {
+            return (@TypeUse String)(@TypeUse2 CharSequence)(obj);
+        }
+    }
+
+    ToolBox tb;
+
+    IncorrectCastOffsetTest() {
+        tb = new ToolBox();
+    }
+
+    public static void main(String args[]) {
+        IncorrectCastOffsetTest incorrectCastOffsetTest = new IncorrectCastOffsetTest();
+        incorrectCastOffsetTest.run();
+    }
+
+    void run() {
+        test("IncorrectCastOffsetTest$AnnotatedCast1.class",
+                /*
+                 * generated code:
+                 *  0: iload_0
+                 *  1: ifeq          8
+                 *  4: aload_1
+                 *  5: goto          9
+                 *  8: aload_2
+                 *  9: checkcast     #13                 // class java/lang/String
+                 * 12: areturn
+                 */
+                List.of(
+                        "RuntimeVisibleTypeAnnotations:",
+                        "0: #35(): CAST, offset=9, type_index=0"
+                )
+        );
+        test("IncorrectCastOffsetTest$AnnotatedCast2.class",
+                /*
+                 * generated code:
+                 *  0: aload_0
+                 *  1: checkcast     #13                 // class java/lang/String
+                 *  4: areturn
+                 */
+                List.of(
+                        "RuntimeVisibleTypeAnnotations:",
+                        "0: #31(): CAST, offset=1, type_index=0"
+                )
+        );
+        test("IncorrectCastOffsetTest$AnnotatedCast3.class",
+                /*
+                 * generated code:
+                 *  0: iload_0
+                 *  1: ifeq          8
+                 *  4: aload_1
+                 *  5: goto          9
+                 *  8: aload_2
+                 *  9: checkcast     #13                 // class java/lang/String
+                 * 12: areturn
+                 */
+                List.of(
+                        "RuntimeVisibleTypeAnnotations:",
+                        "0: #35(): CAST, offset=9, type_index=0",
+                        "IncorrectCastOffsetTest$TypeUse",
+                        "1: #36(): CAST, offset=9, type_index=0",
+                        "IncorrectCastOffsetTest$TypeUse2"
+                )
+        );
+        test("IncorrectCastOffsetTest$AnnotatedCast4.class",
+                /*
+                 * generated code:
+                 *  0: aload_0
+                 *  1: checkcast     #13                 // class java/lang/CharSequence
+                 *  4: checkcast     #15                 // class java/lang/String
+                 *  7: areturn
+                 */
+                List.of(
+                        "RuntimeVisibleTypeAnnotations:",
+                        "0: #33(): CAST, offset=4, type_index=0",
+                        "IncorrectCastOffsetTest$TypeUse",
+                        "#34(): CAST, offset=1, type_index=0",
+                        "IncorrectCastOffsetTest$TypeUse2"
+                )
+        );
+    }
+
+    void test(String clazz, List<String> expectedOutput) {
+        Path pathToClass = Paths.get(ToolBox.testClasses, clazz);
+        String javapOut = new JavapTask(tb)
+                .options("-v", "-p")
+                .classes(pathToClass.toString())
+                .run()
+                .getOutput(Task.OutputKind.DIRECT);
+
+        for (String expected : expectedOutput) {
+            if (!javapOut.contains(expected))
+                throw new AssertionError("unexpected output");
+        }
+    }
+
+}

From cb059a6b1b1686b7adcb2e88536060f4f7d47118 Mon Sep 17 00:00:00 2001
From: Matthias Baesken <mbaesken@openjdk.org>
Date: Wed, 4 Mar 2026 12:23:31 +0000
Subject: [PATCH 032/655] 8378836: Enable linktime-gc by default on Linux
 ppc64le

Reviewed-by: erikj, jwaters, mdoerr
---
 make/autoconf/jdk-options.m4 | 8 ++++++--
 1 file changed, 6 insertions(+), 2 deletions(-)

diff --git a/make/autoconf/jdk-options.m4 b/make/autoconf/jdk-options.m4
index 87d147d4f07..dafac618c59 100644
--- a/make/autoconf/jdk-options.m4
+++ b/make/autoconf/jdk-options.m4
@@ -103,8 +103,12 @@ AC_DEFUN_ONCE([JDKOPT_SETUP_JDK_OPTIONS],
   AC_SUBST(ENABLE_HEADLESS_ONLY)
 
   # should we linktime gc unused code sections in the JDK build ?
-  if test "x$OPENJDK_TARGET_OS" = "xlinux" && test "x$OPENJDK_TARGET_CPU" = xs390x; then
-    LINKTIME_GC_DEFAULT=true
+  if test "x$OPENJDK_TARGET_OS" = "xlinux"; then
+    if test "x$OPENJDK_TARGET_CPU" = "xs390x" || test "x$OPENJDK_TARGET_CPU" = "xppc64le"; then
+      LINKTIME_GC_DEFAULT=true
+    else
+      LINKTIME_GC_DEFAULT=false
+    fi
   else
     LINKTIME_GC_DEFAULT=false
   fi

From d8d543a5dccf126b23d79750c67424e454f97a7f Mon Sep 17 00:00:00 2001
From: Albert Mingkun Yang <ayang@openjdk.org>
Date: Wed, 4 Mar 2026 13:15:27 +0000
Subject: [PATCH 033/655] 8379121: G1: Remove redundant const_cast in
 g1BlockOffsetTable

Reviewed-by: tschatzl, aboldtch
---
 src/hotspot/share/gc/g1/g1BlockOffsetTable.cpp        | 4 ++--
 src/hotspot/share/gc/g1/g1BlockOffsetTable.inline.hpp | 2 +-
 2 files changed, 3 insertions(+), 3 deletions(-)

diff --git a/src/hotspot/share/gc/g1/g1BlockOffsetTable.cpp b/src/hotspot/share/gc/g1/g1BlockOffsetTable.cpp
index fd70796251d..7f0e5e86cd9 100644
--- a/src/hotspot/share/gc/g1/g1BlockOffsetTable.cpp
+++ b/src/hotspot/share/gc/g1/g1BlockOffsetTable.cpp
@@ -73,8 +73,8 @@ void G1BlockOffsetTable::set_offset_array(Atomic<uint8_t>* left, Atomic<uint8_t>
 
 #ifdef ASSERT
 void G1BlockOffsetTable::check_address(Atomic<uint8_t>* addr, const char* msg) const {
-  Atomic<uint8_t>* start_addr = const_cast<Atomic<uint8_t>*>(_offset_base + (uintptr_t(_reserved.start()) >> CardTable::card_shift()));
-  Atomic<uint8_t>* end_addr = const_cast<Atomic<uint8_t>*>(_offset_base + (uintptr_t(_reserved.end()) >> CardTable::card_shift()));
+  Atomic<uint8_t>* start_addr = _offset_base + (uintptr_t(_reserved.start()) >> CardTable::card_shift());
+  Atomic<uint8_t>* end_addr = _offset_base + (uintptr_t(_reserved.end()) >> CardTable::card_shift());
   assert(addr >= start_addr && addr <= end_addr,
          "%s - offset address: " PTR_FORMAT ", start address: " PTR_FORMAT ", end address: " PTR_FORMAT,
          msg, (p2i(addr)), (p2i(start_addr)), (p2i(end_addr)));
diff --git a/src/hotspot/share/gc/g1/g1BlockOffsetTable.inline.hpp b/src/hotspot/share/gc/g1/g1BlockOffsetTable.inline.hpp
index b707e310781..1236d24bb03 100644
--- a/src/hotspot/share/gc/g1/g1BlockOffsetTable.inline.hpp
+++ b/src/hotspot/share/gc/g1/g1BlockOffsetTable.inline.hpp
@@ -54,7 +54,7 @@ uint8_t G1BlockOffsetTable::offset_array(Atomic<uint8_t>* addr) const {
 inline Atomic<uint8_t>* G1BlockOffsetTable::entry_for_addr(const void* const p) const {
   assert(_reserved.contains(p),
          "out of bounds access to block offset table");
-  Atomic<uint8_t>* result = const_cast<Atomic<uint8_t>*>(&_offset_base[uintptr_t(p) >> CardTable::card_shift()]);
+  Atomic<uint8_t>* result = &_offset_base[uintptr_t(p) >> CardTable::card_shift()];
   return result;
 }
 

From 12af936ae47b8c3be9ff639ef550cb63a94f746e Mon Sep 17 00:00:00 2001
From: Kerem Kat <krk@openjdk.org>
Date: Wed, 4 Mar 2026 13:21:27 +0000
Subject: [PATCH 034/655] 8377986: C2: New method to add specific users to the
 worklist

Reviewed-by: qamai, mchevalier, dfenacci, bmaillard
---
 src/hotspot/share/opto/phaseX.cpp | 189 +++++++++++-------------------
 src/hotspot/share/opto/phaseX.hpp |   1 +
 2 files changed, 68 insertions(+), 122 deletions(-)

diff --git a/src/hotspot/share/opto/phaseX.cpp b/src/hotspot/share/opto/phaseX.cpp
index bc0bed31370..c77316e7d0b 100644
--- a/src/hotspot/share/opto/phaseX.cpp
+++ b/src/hotspot/share/opto/phaseX.cpp
@@ -360,6 +360,16 @@ NodeHash::~NodeHash() {
 }
 #endif
 
+// Add users of 'n' that match 'predicate' to worklist
+template <class Predicate>
+static void add_users_to_worklist_if(Unique_Node_List& worklist, const Node* n, Predicate predicate) {
+  for (DUIterator_Fast imax, i = n->fast_outs(imax); i < imax; i++) {
+    Node* u = n->fast_out(i);
+    if (predicate(u)) {
+      worklist.push(u);
+    }
+  }
+}
 
 //=============================================================================
 //------------------------------PhaseRemoveUseless-----------------------------
@@ -2298,12 +2308,7 @@ void PhaseIterGVN::remove_globally_dead_node( Node *dead ) {
               // A Load that directly follows an InitializeNode is
               // going away. The Stores that follow are candidates
               // again to be captured by the InitializeNode.
-              for (DUIterator_Fast jmax, j = in->fast_outs(jmax); j < jmax; j++) {
-                Node *n = in->fast_out(j);
-                if (n->is_Store()) {
-                  _worklist.push(n);
-                }
-              }
+              add_users_to_worklist_if(_worklist, in, [](Node* n) { return n->is_Store(); });
             }
           } // if (in != nullptr && in != C->top())
         } // for (uint i = 0; i < dead->req(); i++)
@@ -2559,41 +2564,29 @@ void PhaseIterGVN::add_users_of_use_to_worklist(Node* n, Node* use, Unique_Node_
   // If changed LShift inputs, check RShift/URShift users for
   // "(X << C) >> C" sign-ext and "(X << C) >>> C" zero-ext optimizations.
   if (use_op == Op_LShiftI || use_op == Op_LShiftL) {
-    for (DUIterator_Fast i2max, i2 = use->fast_outs(i2max); i2 < i2max; i2++) {
-      Node* u = use->fast_out(i2);
-      if (u->Opcode() == Op_RShiftI || u->Opcode() == Op_RShiftL ||
-          u->Opcode() == Op_URShiftI || u->Opcode() == Op_URShiftL) {
-        worklist.push(u);
-      }
-    }
+    add_users_to_worklist_if(worklist, use, [](Node* u) {
+      return u->Opcode() == Op_RShiftI || u->Opcode() == Op_RShiftL ||
+             u->Opcode() == Op_URShiftI || u->Opcode() == Op_URShiftL;
+    });
   }
   // If changed LShift inputs, check And users for shift and mask (And) operation
   if (use_op == Op_LShiftI || use_op == Op_LShiftL) {
-    for (DUIterator_Fast i2max, i2 = use->fast_outs(i2max); i2 < i2max; i2++) {
-      Node* u = use->fast_out(i2);
-      if (u->Opcode() == Op_AndI || u->Opcode() == Op_AndL) {
-        worklist.push(u);
-      }
-    }
+    add_users_to_worklist_if(worklist, use, [](Node* u) {
+      return u->Opcode() == Op_AndI || u->Opcode() == Op_AndL;
+    });
   }
   // If changed AddI/SubI inputs, check CmpU for range check optimization.
   if (use_op == Op_AddI || use_op == Op_SubI) {
-    for (DUIterator_Fast i2max, i2 = use->fast_outs(i2max); i2 < i2max; i2++) {
-      Node* u = use->fast_out(i2);
-      if (u->is_Cmp() && (u->Opcode() == Op_CmpU)) {
-        worklist.push(u);
-      }
-    }
+    add_users_to_worklist_if(worklist, use, [](Node* u) {
+      return u->Opcode() == Op_CmpU;
+    });
   }
   // If changed AndI/AndL inputs, check RShift/URShift users for "(x & mask) >> shift" optimization opportunity
   if (use_op == Op_AndI || use_op == Op_AndL) {
-    for (DUIterator_Fast i2max, i2 = use->fast_outs(i2max); i2 < i2max; i2++) {
-      Node* u = use->fast_out(i2);
-      if (u->Opcode() == Op_RShiftI || u->Opcode() == Op_RShiftL ||
-          u->Opcode() == Op_URShiftI || u->Opcode() == Op_URShiftL) {
-        worklist.push(u);
-      }
-    }
+    add_users_to_worklist_if(worklist, use, [](Node* u) {
+      return u->Opcode() == Op_RShiftI || u->Opcode() == Op_RShiftL ||
+             u->Opcode() == Op_URShiftI || u->Opcode() == Op_URShiftL;
+    });
   }
   // Check for redundant conversion patterns:
   // ConvD2L->ConvL2D->ConvD2L
@@ -2606,35 +2599,22 @@ void PhaseIterGVN::add_users_of_use_to_worklist(Node* n, Node* use, Unique_Node_
       use_op == Op_ConvI2F ||
       use_op == Op_ConvL2F ||
       use_op == Op_ConvF2I) {
-    for (DUIterator_Fast i2max, i2 = use->fast_outs(i2max); i2 < i2max; i2++) {
-      Node* u = use->fast_out(i2);
-      if ((use_op == Op_ConvL2D && u->Opcode() == Op_ConvD2L) ||
-          (use_op == Op_ConvI2F && u->Opcode() == Op_ConvF2I) ||
-          (use_op == Op_ConvL2F && u->Opcode() == Op_ConvF2L) ||
-          (use_op == Op_ConvF2I && u->Opcode() == Op_ConvI2F)) {
-        worklist.push(u);
-      }
-    }
+    add_users_to_worklist_if(worklist, use, [=](Node* u) {
+      return (use_op == Op_ConvL2D && u->Opcode() == Op_ConvD2L) ||
+             (use_op == Op_ConvI2F && u->Opcode() == Op_ConvF2I) ||
+             (use_op == Op_ConvL2F && u->Opcode() == Op_ConvF2L) ||
+             (use_op == Op_ConvF2I && u->Opcode() == Op_ConvI2F);
+    });
   }
   // ConvD2F::Ideal matches ConvD2F(SqrtD(ConvF2D(x))) => SqrtF(x).
   // Notify ConvD2F users of SqrtD when any input of the SqrtD changes.
   if (use_op == Op_SqrtD) {
-    for (DUIterator_Fast i2max, i2 = use->fast_outs(i2max); i2 < i2max; i2++) {
-      Node* u = use->fast_out(i2);
-      if (u->Opcode() == Op_ConvD2F) {
-        worklist.push(u);
-      }
-    }
+    add_users_to_worklist_if(worklist, use, [](Node* u) { return u->Opcode() == Op_ConvD2F; });
   }
   // ConvF2HF::Ideal matches ConvF2HF(binopF(ConvHF2F(...))) => FP16BinOp(...).
   // Notify ConvF2HF users of float binary ops when any input changes.
   if (Float16NodeFactory::is_float32_binary_oper(use_op)) {
-    for (DUIterator_Fast i2max, i2 = use->fast_outs(i2max); i2 < i2max; i2++) {
-      Node* u = use->fast_out(i2);
-      if (u->Opcode() == Op_ConvF2HF) {
-        worklist.push(u);
-      }
-    }
+    add_users_to_worklist_if(worklist, use, [](Node* u) { return u->Opcode() == Op_ConvF2HF; });
   }
   // If changed AddP inputs:
   // - check Stores for loop invariant, and
@@ -2642,33 +2622,21 @@ void PhaseIterGVN::add_users_of_use_to_worklist(Node* n, Node* use, Unique_Node_
   //   address expression flattening.
   if (use_op == Op_AddP) {
     bool offset_changed = n == use->in(AddPNode::Offset);
-    for (DUIterator_Fast i2max, i2 = use->fast_outs(i2max); i2 < i2max; i2++) {
-      Node* u = use->fast_out(i2);
-      if (u->is_Mem()) {
-        worklist.push(u);
-      } else if (offset_changed && u->is_AddP() && u->in(AddPNode::Offset)->is_Con()) {
-        worklist.push(u);
-      }
-    }
+    add_users_to_worklist_if(worklist, use, [=](Node* u) {
+      return u->is_Mem() ||
+             (offset_changed && u->is_AddP() && u->in(AddPNode::Offset)->is_Con());
+    });
   }
   // Check for "abs(0-x)" into "abs(x)" conversion
   if (use->is_Sub()) {
-    for (DUIterator_Fast i2max, i2 = use->fast_outs(i2max); i2 < i2max; i2++) {
-      Node* u = use->fast_out(i2);
-      if (u->Opcode() == Op_AbsD || u->Opcode() == Op_AbsF ||
-          u->Opcode() == Op_AbsL || u->Opcode() == Op_AbsI) {
-        worklist.push(u);
-      }
-    }
+    add_users_to_worklist_if(worklist, use, [](Node* u) {
+      return u->Opcode() == Op_AbsD || u->Opcode() == Op_AbsF ||
+             u->Opcode() == Op_AbsL || u->Opcode() == Op_AbsI;
+    });
   }
   // Check for Max/Min(A, Max/Min(B, C)) where A == B or A == C
   if (use->is_MinMax()) {
-    for (DUIterator_Fast i2max, i2 = use->fast_outs(i2max); i2 < i2max; i2++) {
-      Node* u = use->fast_out(i2);
-      if (u->is_MinMax()) {
-        worklist.push(u);
-      }
-    }
+    add_users_to_worklist_if(worklist, use, [](Node* u) { return u->is_MinMax(); });
   }
   auto enqueue_init_mem_projs = [&](ProjNode* proj) {
     add_users_to_worklist0(proj, worklist);
@@ -2707,12 +2675,9 @@ void PhaseIterGVN::add_users_of_use_to_worklist(Node* n, Node* use, Unique_Node_
       if (u->Opcode() == Op_LoadP && ut->isa_instptr()) {
         if (has_load_barrier_nodes) {
           // Search for load barriers behind the load
-          for (DUIterator_Fast i3max, i3 = u->fast_outs(i3max); i3 < i3max; i3++) {
-            Node* b = u->fast_out(i3);
-            if (bs->is_gc_barrier_node(b)) {
-              worklist.push(b);
-            }
-          }
+          add_users_to_worklist_if(worklist, u, [&](Node* b) {
+            return bs->is_gc_barrier_node(b);
+          });
         }
         worklist.push(u);
       }
@@ -2728,24 +2693,14 @@ void PhaseIterGVN::add_users_of_use_to_worklist(Node* n, Node* use, Unique_Node_
   // VectorMaskToLongNode::Ideal_MaskAll looks through VectorStoreMask
   // to fold constant masks.
   if (use_op == Op_VectorStoreMask) {
-    for (DUIterator_Fast i2max, i2 = use->fast_outs(i2max); i2 < i2max; i2++) {
-      Node* u = use->fast_out(i2);
-      if (u->Opcode() == Op_VectorMaskToLong) {
-        worklist.push(u);
-      }
-    }
+    add_users_to_worklist_if(worklist, use, [](Node* u) { return u->Opcode() == Op_VectorMaskToLong; });
   }
 
   // From CastX2PNode::Ideal
   // CastX2P(AddX(x, y))
   // CastX2P(SubX(x, y))
   if (use->Opcode() == Op_AddX || use->Opcode() == Op_SubX) {
-    for (DUIterator_Fast i2max, i2 = use->fast_outs(i2max); i2 < i2max; i2++) {
-      Node* u = use->fast_out(i2);
-      if (u->Opcode() == Op_CastX2P) {
-        worklist.push(u);
-      }
-    }
+    add_users_to_worklist_if(worklist, use, [](Node* u) { return u->Opcode() == Op_CastX2P; });
   }
 
   /* AndNode has a special handling when one of the operands is a LShiftNode:
@@ -2780,12 +2735,7 @@ void PhaseIterGVN::add_users_of_use_to_worklist(Node* n, Node* use, Unique_Node_
   // e.g., (x - y) + y -> x; x + (y - x) -> y.
   if (use_op == Op_SubI || use_op == Op_SubL) {
     const int add_op = (use_op == Op_SubI) ? Op_AddI : Op_AddL;
-    for (DUIterator_Fast i2max, i2 = use->fast_outs(i2max); i2 < i2max; i2++) {
-      Node* u = use->fast_out(i2);
-      if (u->Opcode() == add_op) {
-        worklist.push(u);
-      }
-    }
+    add_users_to_worklist_if(worklist, use, [=](Node* u) { return u->Opcode() == add_op; });
   }
 }
 
@@ -2970,6 +2920,10 @@ void PhaseCCP::dump_type_and_node(const Node* n, const Type* t) {
 }
 #endif
 
+bool PhaseCCP::not_bottom_type(Node* n) const {
+  return n->bottom_type() != type(n);
+}
+
 // We need to propagate the type change of 'n' to all its uses. Depending on the kind of node, additional nodes
 // (grandchildren or even further down) need to be revisited as their types could also be improved as a result
 // of the new type of 'n'. Push these nodes to the worklist.
@@ -2982,7 +2936,7 @@ void PhaseCCP::push_child_nodes_to_worklist(Unique_Node_List& worklist, Node* n)
 }
 
 void PhaseCCP::push_if_not_bottom_type(Unique_Node_List& worklist, Node* n) const {
-  if (n->bottom_type() != type(n)) {
+  if (not_bottom_type(n)) {
     worklist.push(n);
   }
 }
@@ -3005,9 +2959,9 @@ void PhaseCCP::push_more_uses(Unique_Node_List& worklist, Node* parent, const No
 // We must recheck Phis too if use is a Region.
 void PhaseCCP::push_phis(Unique_Node_List& worklist, const Node* use) const {
   if (use->is_Region()) {
-    for (DUIterator_Fast imax, i = use->fast_outs(imax); i < imax; i++) {
-      push_if_not_bottom_type(worklist, use->fast_out(i));
-    }
+    add_users_to_worklist_if(worklist, use, [&](Node* u) {
+      return not_bottom_type(u);
+    });
   }
 }
 
@@ -3034,14 +2988,11 @@ void PhaseCCP::push_catch(Unique_Node_List& worklist, const Node* use) {
 void PhaseCCP::push_cmpu(Unique_Node_List& worklist, const Node* use) const {
   uint use_op = use->Opcode();
   if (use_op == Op_AddI || use_op == Op_SubI) {
-    for (DUIterator_Fast imax, i = use->fast_outs(imax); i < imax; i++) {
-      Node* cmpu = use->fast_out(i);
-      const uint cmpu_opcode = cmpu->Opcode();
-      if (cmpu_opcode == Op_CmpU || cmpu_opcode == Op_CmpU3) {
-        // Got a CmpU or CmpU3 which might need the new type information from node n.
-        push_if_not_bottom_type(worklist, cmpu);
-      }
-    }
+    // Got a CmpU or CmpU3 which might need the new type information from node n.
+    add_users_to_worklist_if(worklist, use, [&](Node* u) {
+      uint op = u->Opcode();
+      return (op == Op_CmpU || op == Op_CmpU3) && not_bottom_type(u);
+    });
   }
 }
 
@@ -3130,12 +3081,9 @@ void PhaseCCP::push_loadp(Unique_Node_List& worklist, const Node* use) const {
 }
 
 void PhaseCCP::push_load_barrier(Unique_Node_List& worklist, const BarrierSetC2* barrier_set, const Node* use) {
-  for (DUIterator_Fast imax, i = use->fast_outs(imax); i < imax; i++) {
-    Node* barrier_node = use->fast_out(i);
-    if (barrier_set->is_gc_barrier_node(barrier_node)) {
-      worklist.push(barrier_node);
-    }
-  }
+  add_users_to_worklist_if(worklist, use, [&](Node* u) {
+    return barrier_set->is_gc_barrier_node(u);
+  });
 }
 
 // AndI/L::Value() optimizes patterns similar to (v << 2) & 3, or CON & 3 to zero if they are bitwise disjoint.
@@ -3171,12 +3119,9 @@ void PhaseCCP::push_and(Unique_Node_List& worklist, const Node* parent, const No
 void PhaseCCP::push_cast_ii(Unique_Node_List& worklist, const Node* parent, const Node* use) const {
   if (use->Opcode() == Op_CmpI && use->in(2) == parent) {
     Node* other_cmp_input = use->in(1);
-    for (DUIterator_Fast imax, i = other_cmp_input->fast_outs(imax); i < imax; i++) {
-      Node* cast_ii = other_cmp_input->fast_out(i);
-      if (cast_ii->is_CastII()) {
-        push_if_not_bottom_type(worklist, cast_ii);
-      }
-    }
+    add_users_to_worklist_if(worklist, other_cmp_input, [&](Node* u) {
+      return u->is_CastII() && not_bottom_type(u);
+    });
   }
 }
 
diff --git a/src/hotspot/share/opto/phaseX.hpp b/src/hotspot/share/opto/phaseX.hpp
index cd38f37ccf5..94890c250c4 100644
--- a/src/hotspot/share/opto/phaseX.hpp
+++ b/src/hotspot/share/opto/phaseX.hpp
@@ -652,6 +652,7 @@ class PhaseCCP : public PhaseIterGVN {
   Node* fetch_next_node(Unique_Node_List& worklist);
   static void dump_type_and_node(const Node* n, const Type* t) PRODUCT_RETURN;
 
+  bool not_bottom_type(Node* n) const;
   void push_child_nodes_to_worklist(Unique_Node_List& worklist, Node* n) const;
   void push_if_not_bottom_type(Unique_Node_List& worklist, Node* n) const;
   void push_more_uses(Unique_Node_List& worklist, Node* parent, const Node* use) const;

From 7c8f66c831e96d7ba6ffa0042130c556290761fc Mon Sep 17 00:00:00 2001
From: Coleen Phillimore <coleenp@openjdk.org>
Date: Wed, 4 Mar 2026 13:22:24 +0000
Subject: [PATCH 035/655] 8379041: Crash in
 ResolvedFieldEntry::assert_is_valid(): invalid put bytecode 0

Reviewed-by: matsaave, dholmes
---
 src/hotspot/share/oops/resolvedFieldEntry.cpp | 11 +++++++----
 1 file changed, 7 insertions(+), 4 deletions(-)

diff --git a/src/hotspot/share/oops/resolvedFieldEntry.cpp b/src/hotspot/share/oops/resolvedFieldEntry.cpp
index 49e9115ca9a..122ecf092d8 100644
--- a/src/hotspot/share/oops/resolvedFieldEntry.cpp
+++ b/src/hotspot/share/oops/resolvedFieldEntry.cpp
@@ -77,10 +77,13 @@ void ResolvedFieldEntry::assert_is_valid() const {
          "field offset out of range %d >= %d", field_offset(), instanceOopDesc::base_offset_in_bytes());
   assert(as_BasicType((TosState)tos_state()) != T_ILLEGAL, "tos_state is ILLEGAL");
   assert(_flags < (1 << (max_flag_shift + 1)), "flags are too large %d", _flags);
-  assert((get_code() == 0 || get_code() == Bytecodes::_getstatic || get_code() == Bytecodes::_getfield),
-         "invalid get bytecode %d", get_code());
-  assert((put_code() == 0 || put_code() == Bytecodes::_putstatic || put_code() == Bytecodes::_putfield),
-          "invalid put bytecode %d", put_code());
+
+  // Read each bytecode once.
+  volatile Bytecodes::Code g = (Bytecodes::Code)get_code();
+  assert(g == 0 || g == Bytecodes::_getstatic || g == Bytecodes::_getfield, "invalid get bytecode %d", g);
+
+  volatile Bytecodes::Code p = (Bytecodes::Code)put_code();
+  assert(p == 0 || p == Bytecodes::_putstatic || p == Bytecodes::_putfield, "invalid put bytecode %d", p);
 }
 #endif
 

From eb50630d9893970ed58034e878dfdc0ecf0961da Mon Sep 17 00:00:00 2001
From: Coleen Phillimore <coleenp@openjdk.org>
Date: Wed, 4 Mar 2026 13:57:22 +0000
Subject: [PATCH 036/655] 8379013: Remove some unused code in
 generateOopMap.cpp

Reviewed-by: matsaave, dholmes
---
 src/hotspot/share/interpreter/oopMapCache.cpp | 28 +----------
 src/hotspot/share/oops/generateOopMap.cpp     | 50 ++-----------------
 src/hotspot/share/oops/generateOopMap.hpp     | 41 ++-------------
 3 files changed, 8 insertions(+), 111 deletions(-)

diff --git a/src/hotspot/share/interpreter/oopMapCache.cpp b/src/hotspot/share/interpreter/oopMapCache.cpp
index 29d6825d3e5..3769a473e3d 100644
--- a/src/hotspot/share/interpreter/oopMapCache.cpp
+++ b/src/hotspot/share/interpreter/oopMapCache.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1997, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -78,15 +78,10 @@ class OopMapForCacheEntry: public GenerateOopMap {
   int               _stack_top;
 
   virtual bool report_results() const     { return false; }
-  virtual bool possible_gc_point          (BytecodeStream *bcs);
-  virtual void fill_stackmap_prolog       (int nof_gc_points);
-  virtual void fill_stackmap_epilog       ();
   virtual void fill_stackmap_for_opcodes  (BytecodeStream *bcs,
                                            CellTypeState* vars,
                                            CellTypeState* stack,
                                            int stack_top);
-  virtual void fill_init_vars             (GrowableArray<intptr_t> *init_vars);
-
  public:
   OopMapForCacheEntry(const methodHandle& method, int bci, OopMapCacheEntry *entry);
 
@@ -119,27 +114,6 @@ bool OopMapForCacheEntry::compute_map(Thread* current) {
   return true;
 }
 
-
-bool OopMapForCacheEntry::possible_gc_point(BytecodeStream *bcs) {
-  return false; // We are not reporting any result. We call result_for_basicblock directly
-}
-
-
-void OopMapForCacheEntry::fill_stackmap_prolog(int nof_gc_points) {
-  // Do nothing
-}
-
-
-void OopMapForCacheEntry::fill_stackmap_epilog() {
-  // Do nothing
-}
-
-
-void OopMapForCacheEntry::fill_init_vars(GrowableArray<intptr_t> *init_vars) {
-  // Do nothing
-}
-
-
 void OopMapForCacheEntry::fill_stackmap_for_opcodes(BytecodeStream *bcs,
                                                     CellTypeState* vars,
                                                     CellTypeState* stack,
diff --git a/src/hotspot/share/oops/generateOopMap.cpp b/src/hotspot/share/oops/generateOopMap.cpp
index 97d8bf3d526..db1e8b4548b 100644
--- a/src/hotspot/share/oops/generateOopMap.cpp
+++ b/src/hotspot/share/oops/generateOopMap.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1997, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -391,7 +391,6 @@ void CellTypeState::print(outputStream *os) {
 //
 
 void GenerateOopMap::initialize_bb() {
-  _gc_points = 0;
   _bb_count  = 0;
   _bb_hdr_bits.reinitialize(method()->code_size());
 }
@@ -409,7 +408,7 @@ void GenerateOopMap::bb_mark_fct(GenerateOopMap *c, int bci, int *data) {
 }
 
 
-void GenerateOopMap::mark_bbheaders_and_count_gc_points() {
+void GenerateOopMap::mark_bbheaders() {
   initialize_bb();
 
   bool fellThrough = false;  // False to get first BB marked.
@@ -445,9 +444,6 @@ void GenerateOopMap::mark_bbheaders_and_count_gc_points() {
       default:
         break;
     }
-
-    if (possible_gc_point(&bcs))
-      _gc_points++;
   }
 }
 
@@ -1051,9 +1047,6 @@ void GenerateOopMap::setup_method_entry_state() {
     // Initialize CellState type of arguments
     methodsig_to_effect(method()->signature(), method()->is_static(), vars());
 
-    // If some references must be pre-assigned to null, then set that up
-    initialize_vars();
-
     // This is the start state
     merge_state_into_bb(&_basic_blocks[0]);
 
@@ -1077,27 +1070,6 @@ void GenerateOopMap::update_basic_blocks(int bci, int delta,
   }
 }
 
-//
-// Initvars handling
-//
-
-void GenerateOopMap::initialize_vars() {
-  for (int k = 0; k < _init_vars->length(); k++)
-    _state[_init_vars->at(k)] = CellTypeState::make_slot_ref(k);
-}
-
-void GenerateOopMap::add_to_ref_init_set(int localNo) {
-
-  if (TraceNewOopMapGeneration)
-    tty->print_cr("Added init vars: %d", localNo);
-
-  // Is it already in the set?
-  if (_init_vars->contains(localNo) )
-    return;
-
-   _init_vars->append(localNo);
-}
-
 //
 // Interpreration code
 //
@@ -1672,7 +1644,6 @@ void GenerateOopMap::ppload(CellTypeState *out, int loc_no) {
         if (vcts.can_be_uninit()) {
           // It is a ref-uninit conflict (at least). If there are other
           // problems, we'll get them in the next round
-          add_to_ref_init_set(loc_no);
           vcts = out1;
         } else {
           // It wasn't a ref-uninit conflict. So must be a
@@ -2065,7 +2036,6 @@ GenerateOopMap::GenerateOopMap(const methodHandle& method) {
   // We have to initialize all variables here, that can be queried directly
   _method = method;
   _max_locals=0;
-  _init_vars = nullptr;
 
 #ifndef PRODUCT
   // If we are doing a detailed trace, include the regular trace information.
@@ -2095,7 +2065,6 @@ bool GenerateOopMap::compute_map(Thread* current) {
   _max_stack      = method()->max_stack();
   _has_exceptions = (method()->has_exception_handler());
   _nof_refval_conflicts = 0;
-  _init_vars      = new GrowableArray<intptr_t>(5);  // There are seldom more than 5 init_vars
   _report_result  = false;
   _report_result_for_send = false;
   _new_var_map    = nullptr;
@@ -2119,8 +2088,6 @@ bool GenerateOopMap::compute_map(Thread* current) {
   // if no code - do nothing
   // compiler needs info
   if (method()->code_size() == 0 || _max_locals + method()->max_stack() == 0) {
-    fill_stackmap_prolog(0);
-    fill_stackmap_epilog();
     return true;
   }
   // Step 1: Compute all jump targets and their return value
@@ -2129,7 +2096,7 @@ bool GenerateOopMap::compute_map(Thread* current) {
 
   // Step 2: Find all basic blocks and count GC points
   if (!_got_error)
-    mark_bbheaders_and_count_gc_points();
+    mark_bbheaders();
 
   // Step 3: Calculate stack maps
   if (!_got_error)
@@ -2186,9 +2153,6 @@ void GenerateOopMap::report_result() {
   // We now want to report the result of the parse
   _report_result = true;
 
-  // Prolog code
-  fill_stackmap_prolog(_gc_points);
-
    // Mark everything changed, then do one interpretation pass.
   for (int i = 0; i<_bb_count; i++) {
     if (_basic_blocks[i].is_reachable()) {
@@ -2197,14 +2161,6 @@ void GenerateOopMap::report_result() {
     }
   }
 
-  // Note: Since we are skipping dead-code when we are reporting results, then
-  // the no. of encountered gc-points might be fewer than the previously number
-  // we have counted. (dead-code is a pain - it should be removed before we get here)
-  fill_stackmap_epilog();
-
-  // Report initvars
-  fill_init_vars(_init_vars);
-
   _report_result = false;
 }
 
diff --git a/src/hotspot/share/oops/generateOopMap.hpp b/src/hotspot/share/oops/generateOopMap.hpp
index 0da3779d463..7c445887ee7 100644
--- a/src/hotspot/share/oops/generateOopMap.hpp
+++ b/src/hotspot/share/oops/generateOopMap.hpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1997, 2023, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -348,17 +348,15 @@ class GenerateOopMap {
 
   // Basicblock info
   BasicBlock *    _basic_blocks;             // Array of basicblock info
-  int             _gc_points;
   int             _bb_count;
   ResourceBitMap  _bb_hdr_bits;
 
   // Basicblocks methods
   void          initialize_bb               ();
-  void          mark_bbheaders_and_count_gc_points();
+  void          mark_bbheaders();
   bool          is_bb_header                (int bci) const   {
     return _bb_hdr_bits.at(bci);
   }
-  int           gc_points                   () const                          { return _gc_points; }
   int           bb_count                    () const                          { return _bb_count; }
   void          set_bbmark_bit              (int bci);
   BasicBlock *  get_basic_block_at          (int bci) const;
@@ -419,12 +417,6 @@ class GenerateOopMap {
 
   void  report_result                       ();
 
-  // Initvars
-  GrowableArray<intptr_t> * _init_vars;
-
-  void  initialize_vars                     ();
-  void  add_to_ref_init_set                 (int localNo);
-
   // Conflicts rewrite logic
   bool      _conflict;                      // True, if a conflict occurred during interpretation
   int       _nof_refval_conflicts;          // No. of conflicts that require rewrites
@@ -450,7 +442,7 @@ class GenerateOopMap {
   int  binsToHold                           (int no)                      { return  ((no+(BitsPerWord-1))/BitsPerWord); }
   char *state_vec_to_string                 (CellTypeState* vec, int len);
 
-  // Helper method. Can be used in subclasses to fx. calculate gc_points. If the current instruction
+  // Helper method. If the current instruction
   // is a control transfer, then calls the jmpFct all possible destinations.
   void  ret_jump_targets_do                 (BytecodeStream *bcs, jmpFct_t jmpFct, int varNo,int *data);
   bool  jump_targets_do                     (BytecodeStream *bcs, jmpFct_t jmpFct, int *data);
@@ -480,14 +472,7 @@ class GenerateOopMap {
   bool monitor_safe()                              { return _monitor_safe; }
 
   // Specialization methods. Intended use:
-  // - possible_gc_point must return true for every bci for which the stackmaps must be returned
-  // - fill_stackmap_prolog is called just before the result is reported. The arguments tells the estimated
-  //   number of gc points
   // - fill_stackmap_for_opcodes is called once for each bytecode index in order (0...code_length-1)
-  // - fill_stackmap_epilog is called after all results has been reported. Note: Since the algorithm does not report
-  //   stackmaps for deadcode, fewer gc_points might have been encountered than assumed during the epilog. It is the
-  //   responsibility of the subclass to count the correct number.
-  // - fill_init_vars are called once with the result of the init_vars computation
   //
   // All these methods are used during a call to: compute_map. Note: Non of the return results are valid
   // after compute_map returns, since all values are allocated as resource objects.
@@ -495,15 +480,10 @@ class GenerateOopMap {
   // All virtual method must be implemented in subclasses
   virtual bool allow_rewrites             () const                        { return false; }
   virtual bool report_results             () const                        { return true;  }
-  virtual bool report_init_vars           () const                        { return true;  }
-  virtual bool possible_gc_point          (BytecodeStream *bcs)           { ShouldNotReachHere(); return false; }
-  virtual void fill_stackmap_prolog       (int nof_gc_points)             { ShouldNotReachHere(); }
-  virtual void fill_stackmap_epilog       ()                              { ShouldNotReachHere(); }
   virtual void fill_stackmap_for_opcodes  (BytecodeStream *bcs,
                                            CellTypeState* vars,
                                            CellTypeState* stack,
                                            int stackTop)                  { ShouldNotReachHere(); }
-  virtual void fill_init_vars             (GrowableArray<intptr_t> *init_vars) { ShouldNotReachHere();; }
 };
 
 //
@@ -513,19 +493,12 @@ class GenerateOopMap {
 class ResolveOopMapConflicts: public GenerateOopMap {
  private:
 
-  bool _must_clear_locals;
-
   virtual bool report_results() const     { return false; }
-  virtual bool report_init_vars() const   { return true;  }
   virtual bool allow_rewrites() const     { return true;  }
-  virtual bool possible_gc_point          (BytecodeStream *bcs)           { return false; }
-  virtual void fill_stackmap_prolog       (int nof_gc_points)             {}
-  virtual void fill_stackmap_epilog       ()                              {}
   virtual void fill_stackmap_for_opcodes  (BytecodeStream *bcs,
                                            CellTypeState* vars,
                                            CellTypeState* stack,
                                            int stack_top)                 {}
-  virtual void fill_init_vars             (GrowableArray<intptr_t> *init_vars) { _must_clear_locals = init_vars->length() > 0; }
 
 #ifndef PRODUCT
   // Statistics
@@ -535,10 +508,9 @@ class ResolveOopMapConflicts: public GenerateOopMap {
 #endif
 
  public:
-  ResolveOopMapConflicts(const methodHandle& method) : GenerateOopMap(method) { _must_clear_locals = false; };
+  ResolveOopMapConflicts(const methodHandle& method) : GenerateOopMap(method) { }
 
   methodHandle do_potential_rewrite(TRAPS);
-  bool must_clear_locals() const { return _must_clear_locals; }
 };
 
 
@@ -549,16 +521,11 @@ class GeneratePairingInfo: public GenerateOopMap {
  private:
 
   virtual bool report_results() const     { return false; }
-  virtual bool report_init_vars() const   { return false; }
   virtual bool allow_rewrites() const     { return false;  }
-  virtual bool possible_gc_point          (BytecodeStream *bcs)           { return false; }
-  virtual void fill_stackmap_prolog       (int nof_gc_points)             {}
-  virtual void fill_stackmap_epilog       ()                              {}
   virtual void fill_stackmap_for_opcodes  (BytecodeStream *bcs,
                                            CellTypeState* vars,
                                            CellTypeState* stack,
                                            int stack_top)                 {}
-  virtual void fill_init_vars             (GrowableArray<intptr_t> *init_vars) {}
  public:
   GeneratePairingInfo(const methodHandle& method) : GenerateOopMap(method)       {};
 

From 3531c78dea58f1c33752685bd1a876162ec03825 Mon Sep 17 00:00:00 2001
From: Vicente Romero <vromero@openjdk.org>
Date: Wed, 4 Mar 2026 14:30:31 +0000
Subject: [PATCH 037/655] 8379196: delta apply fix for JDK-8214934

Reviewed-by: jlahoda
---
 .../com/sun/tools/javac/comp/TransTypes.java  |  24 +--
 .../IncorrectCastOffsetTest.java              | 175 ------------------
 2 files changed, 5 insertions(+), 194 deletions(-)
 delete mode 100644 test/langtools/tools/javac/annotations/typeAnnotations/IncorrectCastOffsetTest.java

diff --git a/src/jdk.compiler/share/classes/com/sun/tools/javac/comp/TransTypes.java b/src/jdk.compiler/share/classes/com/sun/tools/javac/comp/TransTypes.java
index 1229939c0bf..862c02ea5f0 100644
--- a/src/jdk.compiler/share/classes/com/sun/tools/javac/comp/TransTypes.java
+++ b/src/jdk.compiler/share/classes/com/sun/tools/javac/comp/TransTypes.java
@@ -29,6 +29,7 @@ package com.sun.tools.javac.comp;
 import com.sun.source.tree.MemberReferenceTree.ReferenceMode;
 import com.sun.tools.javac.code.*;
 import com.sun.tools.javac.code.Attribute.TypeCompound;
+import com.sun.tools.javac.code.Source.Feature;
 import com.sun.tools.javac.code.Symbol.*;
 import com.sun.tools.javac.code.Type.TypeVar;
 import com.sun.tools.javac.jvm.Target;
@@ -48,6 +49,8 @@ import static com.sun.tools.javac.code.TypeTag.VOID;
 import static com.sun.tools.javac.comp.CompileStates.CompileState;
 import com.sun.tools.javac.tree.JCTree.JCBreak;
 
+import javax.lang.model.type.TypeKind;
+
 /** This pass translates Generic Java to conventional Java.
  *
  *  <p><b>This is NOT part of any supported API.
@@ -106,9 +109,7 @@ public class TransTypes extends TreeTranslator {
         if (!types.isSameType(tree.type, target)) {
             if (!resolve.isAccessible(env, target.tsym))
                 resolve.logAccessErrorInternal(env, tree, target);
-            tree = explicitCastTP != null && types.isSameType(target, explicitCastTP) ?
-                    tree :
-                    make.TypeCast(make.Type(target), tree).setType(target);
+            tree = make.TypeCast(make.Type(target), tree).setType(target);
         }
         make.pos = oldpos;
         return tree;
@@ -439,29 +440,16 @@ public class TransTypes extends TreeTranslator {
     /** Visitor argument: proto-type.
      */
     private Type pt;
-    /** we use this type to indicate that "upstream" there is an explicit cast to this type,
-     *  this way we can avoid generating redundant type casts. Redundant casts are not
-     *  innocuous as they can trump user provided ones and affect the offset
-     *  calculation of type annotations applied to the user provided type cast.
-     */
-    private Type explicitCastTP;
 
     /** Visitor method: perform a type translation on tree.
      */
     public <T extends JCTree> T translate(T tree, Type pt) {
-        return translate(tree, pt, pt == explicitCastTP ? explicitCastTP : null);
-    }
-
-    public <T extends JCTree> T translate(T tree, Type pt, Type castTP) {
         Type prevPt = this.pt;
-        Type prevCastPT = this.explicitCastTP;
         try {
             this.pt = pt;
-            this.explicitCastTP = castTP;
             return translate(tree);
         } finally {
             this.pt = prevPt;
-            this.explicitCastTP = prevCastPT;
         }
     }
 
@@ -1049,9 +1037,7 @@ public class TransTypes extends TreeTranslator {
         tree.clazz = translate(tree.clazz, null);
         Type originalTarget = tree.type;
         tree.type = erasure(tree.type);
-        JCExpression newExpression = tree.clazz.hasTag(Tag.ANNOTATED_TYPE) ?
-                translate(tree.expr, tree.type, tree.type) :
-                translate(tree.expr, tree.type);
+        JCExpression newExpression = translate(tree.expr, tree.type);
         if (newExpression != tree.expr) {
             JCTypeCast typeCast = newExpression.hasTag(Tag.TYPECAST)
                 ? (JCTypeCast) newExpression
diff --git a/test/langtools/tools/javac/annotations/typeAnnotations/IncorrectCastOffsetTest.java b/test/langtools/tools/javac/annotations/typeAnnotations/IncorrectCastOffsetTest.java
deleted file mode 100644
index f679926bcf4..00000000000
--- a/test/langtools/tools/javac/annotations/typeAnnotations/IncorrectCastOffsetTest.java
+++ /dev/null
@@ -1,175 +0,0 @@
-/*
- * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
- * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
- *
- * This code is free software; you can redistribute it and/or modify it
- * under the terms of the GNU General Public License version 2 only, as
- * published by the Free Software Foundation.
- *
- * This code is distributed in the hope that it will be useful, but WITHOUT
- * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
- * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
- * version 2 for more details (a copy is included in the LICENSE file that
- * accompanied this code).
- *
- * You should have received a copy of the GNU General Public License version
- * 2 along with this work; if not, write to the Free Software Foundation,
- * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
- *
- * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
- * or visit www.oracle.com if you need additional information or have any
- * questions.
- */
-
-/*
- * @test
- * @bug 8214934
- * @summary Wrong type annotation offset on casts on expressions
- * @library /tools/lib
- * @modules jdk.compiler/com.sun.tools.javac.api
- *          jdk.compiler/com.sun.tools.javac.main
- *          jdk.jdeps/com.sun.tools.javap
- * @build toolbox.ToolBox toolbox.JavapTask
- * @run compile IncorrectCastOffsetTest.java
- * @run main IncorrectCastOffsetTest
- */
-
-import java.lang.annotation.ElementType;
-import java.lang.annotation.Target;
-import java.lang.annotation.Retention;
-import java.lang.annotation.RetentionPolicy;
-
-import java.nio.file.Path;
-import java.nio.file.Paths;
-
-import java.util.List;
-
-import toolbox.JavapTask;
-import toolbox.Task;
-import toolbox.ToolBox;
-
-public class IncorrectCastOffsetTest {
-    @Target(ElementType.TYPE_USE)
-    @Retention(RetentionPolicy.RUNTIME)
-    @interface TypeUse {}
-
-    @Target(ElementType.TYPE_USE)
-    @Retention(RetentionPolicy.RUNTIME)
-    @interface TypeUse2 {}
-
-    class AnnotatedCast1 {
-        private static String checkcast(boolean test, Object obj, Object obj2) {
-            return (@TypeUse String)(test ? obj : obj2);
-        }
-    }
-
-    class AnnotatedCast2 {
-        private static String checkcast(Object obj) {
-            return (@TypeUse String)(obj);
-        }
-    }
-
-    class AnnotatedCast3 {
-        private static String checkcast(boolean test, Object obj, Object obj2) {
-            return (@TypeUse @TypeUse2 String)(test ? obj : obj2);
-        }
-    }
-
-    class AnnotatedCast4 {
-        private static String checkcast(Object obj) {
-            return (@TypeUse String)(@TypeUse2 CharSequence)(obj);
-        }
-    }
-
-    ToolBox tb;
-
-    IncorrectCastOffsetTest() {
-        tb = new ToolBox();
-    }
-
-    public static void main(String args[]) {
-        IncorrectCastOffsetTest incorrectCastOffsetTest = new IncorrectCastOffsetTest();
-        incorrectCastOffsetTest.run();
-    }
-
-    void run() {
-        test("IncorrectCastOffsetTest$AnnotatedCast1.class",
-                /*
-                 * generated code:
-                 *  0: iload_0
-                 *  1: ifeq          8
-                 *  4: aload_1
-                 *  5: goto          9
-                 *  8: aload_2
-                 *  9: checkcast     #13                 // class java/lang/String
-                 * 12: areturn
-                 */
-                List.of(
-                        "RuntimeVisibleTypeAnnotations:",
-                        "0: #35(): CAST, offset=9, type_index=0"
-                )
-        );
-        test("IncorrectCastOffsetTest$AnnotatedCast2.class",
-                /*
-                 * generated code:
-                 *  0: aload_0
-                 *  1: checkcast     #13                 // class java/lang/String
-                 *  4: areturn
-                 */
-                List.of(
-                        "RuntimeVisibleTypeAnnotations:",
-                        "0: #31(): CAST, offset=1, type_index=0"
-                )
-        );
-        test("IncorrectCastOffsetTest$AnnotatedCast3.class",
-                /*
-                 * generated code:
-                 *  0: iload_0
-                 *  1: ifeq          8
-                 *  4: aload_1
-                 *  5: goto          9
-                 *  8: aload_2
-                 *  9: checkcast     #13                 // class java/lang/String
-                 * 12: areturn
-                 */
-                List.of(
-                        "RuntimeVisibleTypeAnnotations:",
-                        "0: #35(): CAST, offset=9, type_index=0",
-                        "IncorrectCastOffsetTest$TypeUse",
-                        "1: #36(): CAST, offset=9, type_index=0",
-                        "IncorrectCastOffsetTest$TypeUse2"
-                )
-        );
-        test("IncorrectCastOffsetTest$AnnotatedCast4.class",
-                /*
-                 * generated code:
-                 *  0: aload_0
-                 *  1: checkcast     #13                 // class java/lang/CharSequence
-                 *  4: checkcast     #15                 // class java/lang/String
-                 *  7: areturn
-                 */
-                List.of(
-                        "RuntimeVisibleTypeAnnotations:",
-                        "0: #33(): CAST, offset=4, type_index=0",
-                        "IncorrectCastOffsetTest$TypeUse",
-                        "#34(): CAST, offset=1, type_index=0",
-                        "IncorrectCastOffsetTest$TypeUse2"
-                )
-        );
-    }
-
-    void test(String clazz, List<String> expectedOutput) {
-        Path pathToClass = Paths.get(ToolBox.testClasses, clazz);
-        String javapOut = new JavapTask(tb)
-                .options("-v", "-p")
-                .classes(pathToClass.toString())
-                .run()
-                .getOutput(Task.OutputKind.DIRECT);
-
-        for (String expected : expectedOutput) {
-            if (!javapOut.contains(expected))
-                throw new AssertionError("unexpected output");
-        }
-    }
-
-}

From 4d2c537189cba77d3bbfab36ca3e1c3ceb7c603f Mon Sep 17 00:00:00 2001
From: Naoto Sato <naoto@openjdk.org>
Date: Wed, 4 Mar 2026 17:16:32 +0000
Subject: [PATCH 038/655] 8378992: Case folding cache should not look up code
 point U+0000

Reviewed-by: sherman, rriggs
---
 .../classes/jdk/internal/lang/CaseFolding.java.template   | 8 +++++++-
 1 file changed, 7 insertions(+), 1 deletion(-)

diff --git a/src/java.base/share/classes/jdk/internal/lang/CaseFolding.java.template b/src/java.base/share/classes/jdk/internal/lang/CaseFolding.java.template
index 24a183c8da0..24f48151f21 100644
--- a/src/java.base/share/classes/jdk/internal/lang/CaseFolding.java.template
+++ b/src/java.base/share/classes/jdk/internal/lang/CaseFolding.java.template
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2025, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -188,6 +188,12 @@ public final class CaseFolding {
     }
 
     private static long getDefined(int cp) {
+        // Exclude code point U+0000, which is guaranteed to have no
+        // case-folding mapping.
+        if (cp == 0) {
+            return -1;
+        }
+
         var hashes = CASE_FOLDING_HASHES;
         var length = CASE_FOLDING_CPS.length;  // hashed based on total defined.
         var hash = cp % length;

From 8b91537f109b22333c6008ba64cada9711534cd1 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Manuel=20H=C3=A4ssig?= <mhaessig@openjdk.org>
Date: Wed, 4 Mar 2026 17:17:31 +0000
Subject: [PATCH 039/655] 8379203: [BACKOUT] Remove some unused code in
 generateOopMap.cpp

Reviewed-by: liach, coleenp
---
 src/hotspot/share/interpreter/oopMapCache.cpp | 28 ++++++++++-
 src/hotspot/share/oops/generateOopMap.cpp     | 50 +++++++++++++++++--
 src/hotspot/share/oops/generateOopMap.hpp     | 41 +++++++++++++--
 3 files changed, 111 insertions(+), 8 deletions(-)

diff --git a/src/hotspot/share/interpreter/oopMapCache.cpp b/src/hotspot/share/interpreter/oopMapCache.cpp
index 3769a473e3d..29d6825d3e5 100644
--- a/src/hotspot/share/interpreter/oopMapCache.cpp
+++ b/src/hotspot/share/interpreter/oopMapCache.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1997, 2025, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -78,10 +78,15 @@ class OopMapForCacheEntry: public GenerateOopMap {
   int               _stack_top;
 
   virtual bool report_results() const     { return false; }
+  virtual bool possible_gc_point          (BytecodeStream *bcs);
+  virtual void fill_stackmap_prolog       (int nof_gc_points);
+  virtual void fill_stackmap_epilog       ();
   virtual void fill_stackmap_for_opcodes  (BytecodeStream *bcs,
                                            CellTypeState* vars,
                                            CellTypeState* stack,
                                            int stack_top);
+  virtual void fill_init_vars             (GrowableArray<intptr_t> *init_vars);
+
  public:
   OopMapForCacheEntry(const methodHandle& method, int bci, OopMapCacheEntry *entry);
 
@@ -114,6 +119,27 @@ bool OopMapForCacheEntry::compute_map(Thread* current) {
   return true;
 }
 
+
+bool OopMapForCacheEntry::possible_gc_point(BytecodeStream *bcs) {
+  return false; // We are not reporting any result. We call result_for_basicblock directly
+}
+
+
+void OopMapForCacheEntry::fill_stackmap_prolog(int nof_gc_points) {
+  // Do nothing
+}
+
+
+void OopMapForCacheEntry::fill_stackmap_epilog() {
+  // Do nothing
+}
+
+
+void OopMapForCacheEntry::fill_init_vars(GrowableArray<intptr_t> *init_vars) {
+  // Do nothing
+}
+
+
 void OopMapForCacheEntry::fill_stackmap_for_opcodes(BytecodeStream *bcs,
                                                     CellTypeState* vars,
                                                     CellTypeState* stack,
diff --git a/src/hotspot/share/oops/generateOopMap.cpp b/src/hotspot/share/oops/generateOopMap.cpp
index db1e8b4548b..97d8bf3d526 100644
--- a/src/hotspot/share/oops/generateOopMap.cpp
+++ b/src/hotspot/share/oops/generateOopMap.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1997, 2025, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -391,6 +391,7 @@ void CellTypeState::print(outputStream *os) {
 //
 
 void GenerateOopMap::initialize_bb() {
+  _gc_points = 0;
   _bb_count  = 0;
   _bb_hdr_bits.reinitialize(method()->code_size());
 }
@@ -408,7 +409,7 @@ void GenerateOopMap::bb_mark_fct(GenerateOopMap *c, int bci, int *data) {
 }
 
 
-void GenerateOopMap::mark_bbheaders() {
+void GenerateOopMap::mark_bbheaders_and_count_gc_points() {
   initialize_bb();
 
   bool fellThrough = false;  // False to get first BB marked.
@@ -444,6 +445,9 @@ void GenerateOopMap::mark_bbheaders() {
       default:
         break;
     }
+
+    if (possible_gc_point(&bcs))
+      _gc_points++;
   }
 }
 
@@ -1047,6 +1051,9 @@ void GenerateOopMap::setup_method_entry_state() {
     // Initialize CellState type of arguments
     methodsig_to_effect(method()->signature(), method()->is_static(), vars());
 
+    // If some references must be pre-assigned to null, then set that up
+    initialize_vars();
+
     // This is the start state
     merge_state_into_bb(&_basic_blocks[0]);
 
@@ -1070,6 +1077,27 @@ void GenerateOopMap::update_basic_blocks(int bci, int delta,
   }
 }
 
+//
+// Initvars handling
+//
+
+void GenerateOopMap::initialize_vars() {
+  for (int k = 0; k < _init_vars->length(); k++)
+    _state[_init_vars->at(k)] = CellTypeState::make_slot_ref(k);
+}
+
+void GenerateOopMap::add_to_ref_init_set(int localNo) {
+
+  if (TraceNewOopMapGeneration)
+    tty->print_cr("Added init vars: %d", localNo);
+
+  // Is it already in the set?
+  if (_init_vars->contains(localNo) )
+    return;
+
+   _init_vars->append(localNo);
+}
+
 //
 // Interpreration code
 //
@@ -1644,6 +1672,7 @@ void GenerateOopMap::ppload(CellTypeState *out, int loc_no) {
         if (vcts.can_be_uninit()) {
           // It is a ref-uninit conflict (at least). If there are other
           // problems, we'll get them in the next round
+          add_to_ref_init_set(loc_no);
           vcts = out1;
         } else {
           // It wasn't a ref-uninit conflict. So must be a
@@ -2036,6 +2065,7 @@ GenerateOopMap::GenerateOopMap(const methodHandle& method) {
   // We have to initialize all variables here, that can be queried directly
   _method = method;
   _max_locals=0;
+  _init_vars = nullptr;
 
 #ifndef PRODUCT
   // If we are doing a detailed trace, include the regular trace information.
@@ -2065,6 +2095,7 @@ bool GenerateOopMap::compute_map(Thread* current) {
   _max_stack      = method()->max_stack();
   _has_exceptions = (method()->has_exception_handler());
   _nof_refval_conflicts = 0;
+  _init_vars      = new GrowableArray<intptr_t>(5);  // There are seldom more than 5 init_vars
   _report_result  = false;
   _report_result_for_send = false;
   _new_var_map    = nullptr;
@@ -2088,6 +2119,8 @@ bool GenerateOopMap::compute_map(Thread* current) {
   // if no code - do nothing
   // compiler needs info
   if (method()->code_size() == 0 || _max_locals + method()->max_stack() == 0) {
+    fill_stackmap_prolog(0);
+    fill_stackmap_epilog();
     return true;
   }
   // Step 1: Compute all jump targets and their return value
@@ -2096,7 +2129,7 @@ bool GenerateOopMap::compute_map(Thread* current) {
 
   // Step 2: Find all basic blocks and count GC points
   if (!_got_error)
-    mark_bbheaders();
+    mark_bbheaders_and_count_gc_points();
 
   // Step 3: Calculate stack maps
   if (!_got_error)
@@ -2153,6 +2186,9 @@ void GenerateOopMap::report_result() {
   // We now want to report the result of the parse
   _report_result = true;
 
+  // Prolog code
+  fill_stackmap_prolog(_gc_points);
+
    // Mark everything changed, then do one interpretation pass.
   for (int i = 0; i<_bb_count; i++) {
     if (_basic_blocks[i].is_reachable()) {
@@ -2161,6 +2197,14 @@ void GenerateOopMap::report_result() {
     }
   }
 
+  // Note: Since we are skipping dead-code when we are reporting results, then
+  // the no. of encountered gc-points might be fewer than the previously number
+  // we have counted. (dead-code is a pain - it should be removed before we get here)
+  fill_stackmap_epilog();
+
+  // Report initvars
+  fill_init_vars(_init_vars);
+
   _report_result = false;
 }
 
diff --git a/src/hotspot/share/oops/generateOopMap.hpp b/src/hotspot/share/oops/generateOopMap.hpp
index 7c445887ee7..0da3779d463 100644
--- a/src/hotspot/share/oops/generateOopMap.hpp
+++ b/src/hotspot/share/oops/generateOopMap.hpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1997, 2023, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -348,15 +348,17 @@ class GenerateOopMap {
 
   // Basicblock info
   BasicBlock *    _basic_blocks;             // Array of basicblock info
+  int             _gc_points;
   int             _bb_count;
   ResourceBitMap  _bb_hdr_bits;
 
   // Basicblocks methods
   void          initialize_bb               ();
-  void          mark_bbheaders();
+  void          mark_bbheaders_and_count_gc_points();
   bool          is_bb_header                (int bci) const   {
     return _bb_hdr_bits.at(bci);
   }
+  int           gc_points                   () const                          { return _gc_points; }
   int           bb_count                    () const                          { return _bb_count; }
   void          set_bbmark_bit              (int bci);
   BasicBlock *  get_basic_block_at          (int bci) const;
@@ -417,6 +419,12 @@ class GenerateOopMap {
 
   void  report_result                       ();
 
+  // Initvars
+  GrowableArray<intptr_t> * _init_vars;
+
+  void  initialize_vars                     ();
+  void  add_to_ref_init_set                 (int localNo);
+
   // Conflicts rewrite logic
   bool      _conflict;                      // True, if a conflict occurred during interpretation
   int       _nof_refval_conflicts;          // No. of conflicts that require rewrites
@@ -442,7 +450,7 @@ class GenerateOopMap {
   int  binsToHold                           (int no)                      { return  ((no+(BitsPerWord-1))/BitsPerWord); }
   char *state_vec_to_string                 (CellTypeState* vec, int len);
 
-  // Helper method. If the current instruction
+  // Helper method. Can be used in subclasses to fx. calculate gc_points. If the current instruction
   // is a control transfer, then calls the jmpFct all possible destinations.
   void  ret_jump_targets_do                 (BytecodeStream *bcs, jmpFct_t jmpFct, int varNo,int *data);
   bool  jump_targets_do                     (BytecodeStream *bcs, jmpFct_t jmpFct, int *data);
@@ -472,7 +480,14 @@ class GenerateOopMap {
   bool monitor_safe()                              { return _monitor_safe; }
 
   // Specialization methods. Intended use:
+  // - possible_gc_point must return true for every bci for which the stackmaps must be returned
+  // - fill_stackmap_prolog is called just before the result is reported. The arguments tells the estimated
+  //   number of gc points
   // - fill_stackmap_for_opcodes is called once for each bytecode index in order (0...code_length-1)
+  // - fill_stackmap_epilog is called after all results has been reported. Note: Since the algorithm does not report
+  //   stackmaps for deadcode, fewer gc_points might have been encountered than assumed during the epilog. It is the
+  //   responsibility of the subclass to count the correct number.
+  // - fill_init_vars are called once with the result of the init_vars computation
   //
   // All these methods are used during a call to: compute_map. Note: Non of the return results are valid
   // after compute_map returns, since all values are allocated as resource objects.
@@ -480,10 +495,15 @@ class GenerateOopMap {
   // All virtual method must be implemented in subclasses
   virtual bool allow_rewrites             () const                        { return false; }
   virtual bool report_results             () const                        { return true;  }
+  virtual bool report_init_vars           () const                        { return true;  }
+  virtual bool possible_gc_point          (BytecodeStream *bcs)           { ShouldNotReachHere(); return false; }
+  virtual void fill_stackmap_prolog       (int nof_gc_points)             { ShouldNotReachHere(); }
+  virtual void fill_stackmap_epilog       ()                              { ShouldNotReachHere(); }
   virtual void fill_stackmap_for_opcodes  (BytecodeStream *bcs,
                                            CellTypeState* vars,
                                            CellTypeState* stack,
                                            int stackTop)                  { ShouldNotReachHere(); }
+  virtual void fill_init_vars             (GrowableArray<intptr_t> *init_vars) { ShouldNotReachHere();; }
 };
 
 //
@@ -493,12 +513,19 @@ class GenerateOopMap {
 class ResolveOopMapConflicts: public GenerateOopMap {
  private:
 
+  bool _must_clear_locals;
+
   virtual bool report_results() const     { return false; }
+  virtual bool report_init_vars() const   { return true;  }
   virtual bool allow_rewrites() const     { return true;  }
+  virtual bool possible_gc_point          (BytecodeStream *bcs)           { return false; }
+  virtual void fill_stackmap_prolog       (int nof_gc_points)             {}
+  virtual void fill_stackmap_epilog       ()                              {}
   virtual void fill_stackmap_for_opcodes  (BytecodeStream *bcs,
                                            CellTypeState* vars,
                                            CellTypeState* stack,
                                            int stack_top)                 {}
+  virtual void fill_init_vars             (GrowableArray<intptr_t> *init_vars) { _must_clear_locals = init_vars->length() > 0; }
 
 #ifndef PRODUCT
   // Statistics
@@ -508,9 +535,10 @@ class ResolveOopMapConflicts: public GenerateOopMap {
 #endif
 
  public:
-  ResolveOopMapConflicts(const methodHandle& method) : GenerateOopMap(method) { }
+  ResolveOopMapConflicts(const methodHandle& method) : GenerateOopMap(method) { _must_clear_locals = false; };
 
   methodHandle do_potential_rewrite(TRAPS);
+  bool must_clear_locals() const { return _must_clear_locals; }
 };
 
 
@@ -521,11 +549,16 @@ class GeneratePairingInfo: public GenerateOopMap {
  private:
 
   virtual bool report_results() const     { return false; }
+  virtual bool report_init_vars() const   { return false; }
   virtual bool allow_rewrites() const     { return false;  }
+  virtual bool possible_gc_point          (BytecodeStream *bcs)           { return false; }
+  virtual void fill_stackmap_prolog       (int nof_gc_points)             {}
+  virtual void fill_stackmap_epilog       ()                              {}
   virtual void fill_stackmap_for_opcodes  (BytecodeStream *bcs,
                                            CellTypeState* vars,
                                            CellTypeState* stack,
                                            int stack_top)                 {}
+  virtual void fill_init_vars             (GrowableArray<intptr_t> *init_vars) {}
  public:
   GeneratePairingInfo(const methodHandle& method) : GenerateOopMap(method)       {};
 

From 0fbf58d8ff4fae370d5a839e59cebf713a1f1e5a Mon Sep 17 00:00:00 2001
From: Liam Miller-Cushon <cushon@openjdk.org>
Date: Wed, 4 Mar 2026 17:33:32 +0000
Subject: [PATCH 040/655] 8372353: API to compute the byte length of a String
 encoded in a given Charset

Reviewed-by: rriggs, naoto, vyazici
---
 .../share/classes/java/lang/String.java       |  95 +++++++++++++-
 test/jdk/java/lang/String/Encodings.java      |   8 +-
 test/jdk/java/lang/String/Exceptions.java     |  13 +-
 test/jdk/sun/nio/cs/TestStringCoding.java     |  10 +-
 .../lang/foreign/StringLoopJmhBenchmark.java  | 122 ++++++++++++++++++
 5 files changed, 235 insertions(+), 13 deletions(-)
 create mode 100644 test/micro/org/openjdk/bench/java/lang/foreign/StringLoopJmhBenchmark.java

diff --git a/src/java.base/share/classes/java/lang/String.java b/src/java.base/share/classes/java/lang/String.java
index fc05febdb45..c6c08ed4473 100644
--- a/src/java.base/share/classes/java/lang/String.java
+++ b/src/java.base/share/classes/java/lang/String.java
@@ -1133,6 +1133,34 @@ public final class String
         return Arrays.copyOf(dst, dp);
     }
 
+    // This follows the implementation of encodeASCII and encode8859_1
+    private static int encodedLengthASCIIor8859_1(byte coder, byte[] val) {
+        if (coder == LATIN1) {
+            return val.length;
+        }
+        int len = val.length >> 1;
+        int dp = 0;
+        int sp = 0;
+        int sl = len;
+        while (sp < sl) {
+            char c = StringUTF16.getChar(val, sp);
+            if (c >= Character.MIN_HIGH_SURROGATE) {
+                break;
+            }
+            dp++;
+            sp++;
+        }
+        while (sp < sl) {
+            char c = StringUTF16.getChar(val, sp++);
+            if (Character.isHighSurrogate(c) && sp < sl &&
+                    Character.isLowSurrogate(StringUTF16.getChar(val, sp))) {
+                sp++;
+            }
+            dp++;
+        }
+        return dp;
+    }
+
     //------------------------------ utf8 ------------------------------------
 
     /**
@@ -1467,6 +1495,27 @@ public final class String
         return Arrays.copyOf(dst, dp);
     }
 
+    // This follows the implementation of encodeUTF8
+    private static int encodedLengthUTF8(byte coder, byte[] val) {
+        if (coder == UTF16) {
+            return encodedLengthUTF8_UTF16(val, null);
+        }
+        int positives = StringCoding.countPositives(val, 0, val.length);
+        if (positives == val.length) {
+            return positives;
+        }
+        int dp = positives;
+        for (int i = dp; i < val.length; i++) {
+            byte c = val[i];
+            if (c < 0) {
+                dp += 2;
+            } else {
+                dp++;
+            }
+        }
+        return dp;
+    }
+
     /**
      * {@return the byte array obtained by first decoding {@code val} with
      * UTF-16, and then encoding the result with UTF-8}
@@ -1484,11 +1533,8 @@ public final class String
         int sl = val.length >> 1;
         // UTF-8 encoded can be as much as 3 times the string length
         // For very large estimate, (as in overflow of 32 bit int), precompute the exact size
-        long allocLen = (sl * 3 < 0) ? computeSizeUTF8_UTF16(val, exClass) : sl * 3;
-        if (allocLen > (long)Integer.MAX_VALUE) {
-            throw new OutOfMemoryError("Required length exceeds implementation limit");
-        }
-        byte[] dst = new byte[(int) allocLen];
+        int allocLen = (sl * 3 < 0) ? encodedLengthUTF8_UTF16(val, exClass) : sl * 3;
+        byte[] dst = new byte[allocLen];
         while (sp < sl) {
             // ascii fast loop;
             char c = StringUTF16.getChar(val, sp);
@@ -1547,11 +1593,20 @@ public final class String
      * @param <E> The exception type parameter to enable callers to avoid
      *           having to declare the exception
      */
-    private static <E extends Exception> long computeSizeUTF8_UTF16(byte[] val, Class<E> exClass) throws E {
+    private static <E extends Exception> int encodedLengthUTF8_UTF16(byte[] val, Class<E> exClass) throws E {
         long dp = 0L;
         int sp = 0;
         int sl = val.length >> 1;
 
+        while (sp < sl) {
+            // ascii fast loop;
+            char c = StringUTF16.getChar(val, sp);
+            if (c >= '\u0080') {
+                break;
+            }
+            dp++;
+            sp++;
+        }
         while (sp < sl) {
             char c = StringUTF16.getChar(val, sp++);
             if (c < 0x80) {
@@ -1580,7 +1635,10 @@ public final class String
                 dp += 3;
             }
         }
-        return dp;
+        if (dp > (long)Integer.MAX_VALUE) {
+            throw new OutOfMemoryError("Required length exceeds implementation limit");
+        }
+        return (int) dp;
     }
 
     /**
@@ -2045,6 +2103,29 @@ public final class String
         return encode(Charset.defaultCharset(), coder(), value);
     }
 
+    /**
+     * {@return the length in bytes of this {@code String} encoded with the given {@link Charset}}
+     *
+     * <p>The returned length accounts for the replacement of malformed-input and unmappable-character
+     * sequences with the charset's default replacement byte array. The result will be the same value
+     * as {@link #getBytes(Charset) getBytes(cs).length}.
+     *
+     * @apiNote This method provides equivalent or better performance than {@link #getBytes(Charset)
+     *          getBytes(cs).length}.
+     *
+     * @param cs The {@link Charset} used to the compute the length
+     * @since 27
+     */
+    public int encodedLength(Charset cs) {
+        Objects.requireNonNull(cs);
+        if (cs == UTF_8.INSTANCE) {
+            return encodedLengthUTF8(coder, value);
+        } else if (cs == ISO_8859_1.INSTANCE || cs == US_ASCII.INSTANCE) {
+            return encodedLengthASCIIor8859_1(coder, value);
+        }
+        return getBytes(cs).length;
+    }
+
     boolean bytesCompatible(Charset charset, int srcIndex, int numChars) {
         if (isLatin1()) {
             if (charset == ISO_8859_1.INSTANCE) {
diff --git a/test/jdk/java/lang/String/Encodings.java b/test/jdk/java/lang/String/Encodings.java
index 4714815026e..7974157ede0 100644
--- a/test/jdk/java/lang/String/Encodings.java
+++ b/test/jdk/java/lang/String/Encodings.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1999, 2006, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1999, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -22,7 +22,7 @@
  */
 
 /* @test
- * @bug 4085160 4139951 5005831
+ * @bug 4085160 4139951 5005831 8372353
  * @summary Test that required character encodings are supported
  */
 
@@ -106,6 +106,10 @@ public class Encodings {
         if (!equals(bs, bytes))
             throw new Exception(charset + ": String.getBytes failed");
 
+        /* String.encodedLength(Charset charset) */
+        if (bs.length != str.encodedLength(charset))
+            throw new Exception(charset + ": String.encodedLength failed");
+
         // Calls to String.getBytes(Charset) shouldn't automatically
         // use the cached thread-local encoder.
         if (charset.name().equals("UTF-16BE")) {
diff --git a/test/jdk/java/lang/String/Exceptions.java b/test/jdk/java/lang/String/Exceptions.java
index 3ba7792f424..15ffe3eac20 100644
--- a/test/jdk/java/lang/String/Exceptions.java
+++ b/test/jdk/java/lang/String/Exceptions.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2002, 2006, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2002, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,7 +23,7 @@
 
 /**
  * @test
- * @bug 4472841 4703640 4705681 4705683 4833095 5005831
+ * @bug 4472841 4703640 4705681 4705683 4833095 5005831 8372353
  * @summary Verify that constructor exceptions are thrown as expected.
  */
 
@@ -397,6 +397,14 @@ public class Exceptions {
                 }});
     }
 
+    private static void encodedLength() {
+        System.out.println("encodedLength(Charset charset)");
+        tryCatch("  null", NullPointerException.class, new Runnable() {
+                public void run() {
+                    "foo".encodedLength((Charset)null);
+                }});
+    }
+
     private static void contentEquals() {
         System.out.println("contentEquals(StringBuffer sb)");
         tryCatch("  null", NullPointerException.class, new Runnable() {
@@ -640,6 +648,7 @@ public class Exceptions {
                               //   getBytes(Locale)
                               //   getBytes(String)
                               //   getBytes(Charset)
+        encodedLength();      // encodedLength(Charset)
         contentEquals();      // contentEquals(StringBuffer)
         compareTo();          // compareTo(String), compareTo(Object)
         compareToIgnoreCase();// compareToIgnoreCase(String)
diff --git a/test/jdk/sun/nio/cs/TestStringCoding.java b/test/jdk/sun/nio/cs/TestStringCoding.java
index d708ef180a2..b81ffb07d20 100644
--- a/test/jdk/sun/nio/cs/TestStringCoding.java
+++ b/test/jdk/sun/nio/cs/TestStringCoding.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2000, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2000, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -22,7 +22,7 @@
  */
 
 /* @test
- * @bug 6636323 6636319 7040220 7096080 7183053 8080248 8054307
+ * @bug 6636323 6636319 7040220 7096080 7183053 8080248 8054307 8372353
  * @summary Test if StringCoding and NIO result have the same de/encoding result
  * @library /test/lib
  * @modules java.base/sun.nio.cs
@@ -169,6 +169,12 @@ public class TestStringCoding {
         if (!Arrays.equals(baSC, baNIO)) {
             throw new RuntimeException("getBytes(cs) failed  -> " + cs.name());
         }
+        //encodedLength(cs);
+        int encodedLength = str.encodedLength(cs);
+        if (baSC.length != encodedLength) {
+            throw new RuntimeException(String.format("encodedLength failed (%d != %d) -> %s",
+                    baSC.length, encodedLength, cs.name()));
+        }
         return baSC;
     }
 
diff --git a/test/micro/org/openjdk/bench/java/lang/foreign/StringLoopJmhBenchmark.java b/test/micro/org/openjdk/bench/java/lang/foreign/StringLoopJmhBenchmark.java
new file mode 100644
index 00000000000..1733b73886e
--- /dev/null
+++ b/test/micro/org/openjdk/bench/java/lang/foreign/StringLoopJmhBenchmark.java
@@ -0,0 +1,122 @@
+/*
+ * Copyright (c) 2026, Google LLC. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+package org.openjdk.bench.java.lang.foreign;
+
+import java.nio.charset.StandardCharsets;
+import java.util.concurrent.TimeUnit;
+import org.openjdk.jmh.annotations.Benchmark;
+import org.openjdk.jmh.annotations.BenchmarkMode;
+import org.openjdk.jmh.annotations.Fork;
+import org.openjdk.jmh.annotations.Measurement;
+import org.openjdk.jmh.annotations.Mode;
+import org.openjdk.jmh.annotations.OutputTimeUnit;
+import org.openjdk.jmh.annotations.Param;
+import org.openjdk.jmh.annotations.Scope;
+import org.openjdk.jmh.annotations.Setup;
+import org.openjdk.jmh.annotations.Warmup;
+import org.openjdk.jmh.annotations.State;
+
+@Warmup(time = 1, timeUnit = TimeUnit.SECONDS)
+@Measurement(time = 1, timeUnit = TimeUnit.SECONDS)
+@Fork(1)
+@State(Scope.Benchmark)
+public class StringLoopJmhBenchmark {
+  @Param({"10", "100", "1000", "100000"})
+  int stringLength;
+
+  @Param({"ASCII", "LATIN1", "UTF16"})
+  String encoding;
+
+  String stringData;
+
+  @Setup
+  public void setUp() {
+    stringData = "";
+
+    // Character at the _end_ to affect if we hit
+    // - ASCII = compact strings and compatible with UTF-8
+    // - LATIN1 = compact strings but not compatible with UTF-8
+    // - UTF16 = 2-byte char storage and not compatible with UTF-8
+    String c;
+    if (encoding.equals("ASCII")) {
+      c = "a";
+    } else if (encoding.equals("LATIN1")) {
+      c = "\u00C4";
+    } else if (encoding.equals("UTF16")) {
+      c = "\u2603";
+    } else {
+      throw new IllegalArgumentException("Unknown encoding: " + encoding);
+    }
+
+    var stringDataBuilder = new StringBuilder(stringLength + 1);
+    while (stringDataBuilder.length() < stringLength) {
+      stringDataBuilder.append((char) (Math.random() * 26) + 'a');
+    }
+    stringData = stringDataBuilder.append(c).toString();
+  }
+
+  @Benchmark
+  public int utf8LenByLoop() {
+    final String s = stringData;
+    final int len = s.length();
+
+    // ASCII prefix strings.
+    int idx = 0;
+    for (char c; idx < len && (c = s.charAt(idx)) < 0x80; ++idx) {}
+
+    // Entire string was ASCII.
+    if (idx == len) {
+      return len;
+    }
+
+    int utf8Len = len;
+    for (char c; idx < len; ++idx) {
+      c = s.charAt(idx);
+      if (c < 0x80) {
+        utf8Len++;
+      } else if (c < 0x800) {
+        utf8Len += 2;
+      } else {
+        utf8Len += 3;
+        if (Character.isSurrogate(c)) {
+          int cp = Character.codePointAt(s, idx);
+          if (cp < Character.MIN_SUPPLEMENTARY_CODE_POINT) {
+            throw new RuntimeException("Unpaired surrogate");
+          }
+          idx++;
+        }
+      }
+    }
+    return utf8Len;
+  }
+
+  @Benchmark
+  public int getBytes() throws Exception {
+    return stringData.getBytes(StandardCharsets.UTF_8).length;
+  }
+
+  @Benchmark
+  public int encodedLength() throws Exception {
+    return stringData.encodedLength(StandardCharsets.UTF_8);
+  }
+}

From c52d7b7cbc89548c3e9cd68a29ff0cec04888b09 Mon Sep 17 00:00:00 2001
From: Brian Burkhalter <bpb@openjdk.org>
Date: Wed, 4 Mar 2026 18:50:13 +0000
Subject: [PATCH 041/655] 8378878: Refactor
 java/nio/channels/AsynchronousSocketChannel test to use JUnit

Reviewed-by: alanb
---
 .../CompletionHandlerRelease.java             | 28 ++++++++++---------
 1 file changed, 15 insertions(+), 13 deletions(-)

diff --git a/test/jdk/java/nio/channels/AsynchronousSocketChannel/CompletionHandlerRelease.java b/test/jdk/java/nio/channels/AsynchronousSocketChannel/CompletionHandlerRelease.java
index 7abbf064b40..962d7728a55 100644
--- a/test/jdk/java/nio/channels/AsynchronousSocketChannel/CompletionHandlerRelease.java
+++ b/test/jdk/java/nio/channels/AsynchronousSocketChannel/CompletionHandlerRelease.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,7 +23,7 @@
 
 /* @test
  * @bug 8202252
- * @run testng CompletionHandlerRelease
+ * @run junit CompletionHandlerRelease
  * @summary Verify that reference to CompletionHandler is cleared after use
  */
 
@@ -44,10 +44,12 @@ import java.util.concurrent.CountDownLatch;
 import java.util.concurrent.Executors;
 import java.util.concurrent.Future;
 
-import org.testng.annotations.AfterTest;
-import org.testng.annotations.BeforeTest;
-import org.testng.annotations.Test;
-import static org.testng.Assert.*;
+import org.junit.jupiter.api.AfterAll;
+import org.junit.jupiter.api.BeforeAll;
+import org.junit.jupiter.api.Test;
+
+import static org.junit.jupiter.api.Assertions.assertNull;
+import static org.junit.jupiter.api.Assertions.assertSame;
 
 public class CompletionHandlerRelease {
     @Test
@@ -132,16 +134,16 @@ public class CompletionHandlerRelease {
         }
     }
 
-    private AsynchronousChannelGroup GROUP;
+    private static AsynchronousChannelGroup GROUP;
 
-    @BeforeTest
-    void setup() throws IOException {
+    @BeforeAll
+    static void setup() throws IOException {
         GROUP = AsynchronousChannelGroup.withFixedThreadPool(2,
             Executors.defaultThreadFactory());
     }
 
-    @AfterTest
-    void cleanup() throws IOException {
+    @AfterAll
+    static void cleanup() throws IOException {
         GROUP.shutdownNow();
     }
 
@@ -199,13 +201,13 @@ public class CompletionHandlerRelease {
         }
     }
 
-    private void waitForRefToClear(Reference ref, ReferenceQueue queue)
+    private static void waitForRefToClear(Reference ref, ReferenceQueue queue)
         throws InterruptedException {
         Reference r;
         while ((r = queue.remove(20)) == null) {
             System.gc();
         }
-        assertEquals(r, ref);
+        assertSame(ref, r);
         assertNull(r.get());
     }
 }

From 9d1d0c6f0553c5f042351d1def385589015fefd6 Mon Sep 17 00:00:00 2001
From: Chen Liang <liach@openjdk.org>
Date: Wed, 4 Mar 2026 19:46:06 +0000
Subject: [PATCH 042/655] 8379166: Upstream redundant diffs fixed in Valhalla -
 Part 1

Reviewed-by: rriggs
---
 .../classes/java/io/ObjectInputStream.java    |  2 +-
 .../share/classes/java/lang/Boolean.java      |  4 ---
 .../share/classes/java/lang/Byte.java         |  1 -
 .../share/classes/java/lang/Class.java        |  9 ++++---
 .../share/classes/java/lang/Short.java        |  1 -
 .../java/lang/doc-files/ValueBased.html       | 22 ++++++++--------
 .../classes/java/lang/invoke/MemberName.java  | 25 ++++++++++---------
 .../java/lang/invoke/MethodHandleProxies.java |  2 +-
 .../classes/java/lang/reflect/Proxy.java      |  5 ++--
 .../share/classes/java/util/WeakHashMap.java  |  2 +-
 .../classfile/impl/DirectClassBuilder.java    |  1 -
 .../impl/verifier/VerificationTable.java      |  2 +-
 .../jdk/internal/jimage/ImageReader.java      |  1 +
 src/java.base/share/classes/module-info.java  |  9 +++----
 .../include/classfile_constants.h.template    |  2 +-
 15 files changed, 42 insertions(+), 46 deletions(-)

diff --git a/src/java.base/share/classes/java/io/ObjectInputStream.java b/src/java.base/share/classes/java/io/ObjectInputStream.java
index daed5f3cce5..cd6bd7683f7 100644
--- a/src/java.base/share/classes/java/io/ObjectInputStream.java
+++ b/src/java.base/share/classes/java/io/ObjectInputStream.java
@@ -2219,7 +2219,7 @@ public class ObjectInputStream
      * mechanism marks the record as having an exception.
      * Null is returned from readRecord and later the exception is thrown at
      * the exit of {@link #readObject(Class)}.
-     **/
+     */
     private Object readRecord(ObjectStreamClass desc) throws IOException {
         ObjectStreamClass.ClassDataSlot[] slots = desc.getClassDataLayout();
         if (slots.length != 1) {
diff --git a/src/java.base/share/classes/java/lang/Boolean.java b/src/java.base/share/classes/java/lang/Boolean.java
index 4c24e98a549..49ab80edfea 100644
--- a/src/java.base/share/classes/java/lang/Boolean.java
+++ b/src/java.base/share/classes/java/lang/Boolean.java
@@ -28,14 +28,10 @@ package java.lang;
 import jdk.internal.vm.annotation.IntrinsicCandidate;
 
 import java.lang.constant.Constable;
-import java.lang.constant.ConstantDesc;
 import java.lang.constant.ConstantDescs;
 import java.lang.constant.DynamicConstantDesc;
 import java.util.Optional;
 
-import static java.lang.constant.ConstantDescs.BSM_GET_STATIC_FINAL;
-import static java.lang.constant.ConstantDescs.CD_Boolean;
-
 /**
  * The {@code Boolean} class is the {@linkplain
  * java.lang##wrapperClass wrapper class} for values of the primitive
diff --git a/src/java.base/share/classes/java/lang/Byte.java b/src/java.base/share/classes/java/lang/Byte.java
index 0f3f7f40d05..c2c03e7a3c2 100644
--- a/src/java.base/share/classes/java/lang/Byte.java
+++ b/src/java.base/share/classes/java/lang/Byte.java
@@ -36,7 +36,6 @@ import java.util.Optional;
 
 import static java.lang.constant.ConstantDescs.BSM_EXPLICIT_CAST;
 import static java.lang.constant.ConstantDescs.CD_byte;
-import static java.lang.constant.ConstantDescs.CD_int;
 import static java.lang.constant.ConstantDescs.DEFAULT_NAME;
 
 /**
diff --git a/src/java.base/share/classes/java/lang/Class.java b/src/java.base/share/classes/java/lang/Class.java
index eab1993a2b4..8a2f722f3dd 100644
--- a/src/java.base/share/classes/java/lang/Class.java
+++ b/src/java.base/share/classes/java/lang/Class.java
@@ -224,9 +224,9 @@ public final class Class<T> implements java.io.Serializable,
                               AnnotatedElement,
                               TypeDescriptor.OfField<Class<?>>,
                               Constable {
-    private static final int ANNOTATION= 0x00002000;
-    private static final int ENUM      = 0x00004000;
-    private static final int SYNTHETIC = 0x00001000;
+    private static final int ANNOTATION = 0x00002000;
+    private static final int ENUM       = 0x00004000;
+    private static final int SYNTHETIC  = 0x00001000;
 
     private static native void registerNatives();
     static {
@@ -1390,6 +1390,7 @@ public final class Class<T> implements java.io.Serializable,
         // INNER_CLASS forbids. INNER_CLASS allows PRIVATE, PROTECTED,
         // and STATIC, which are not allowed on Location.CLASS.
         // Use getClassFileAccessFlags to expose SUPER status.
+        // Arrays need to use PRIVATE/PROTECTED from its component modifiers.
         var location = (isMemberClass() || isLocalClass() ||
                         isAnonymousClass() || isArray()) ?
             AccessFlag.Location.INNER_CLASS :
@@ -3779,7 +3780,7 @@ public final class Class<T> implements java.io.Serializable,
      * @since 1.8
      */
     public AnnotatedType[] getAnnotatedInterfaces() {
-         return TypeAnnotationParser.buildAnnotatedInterfaces(getRawTypeAnnotations(), getConstantPool(), this);
+        return TypeAnnotationParser.buildAnnotatedInterfaces(getRawTypeAnnotations(), getConstantPool(), this);
     }
 
     private native Class<?> getNestHost0();
diff --git a/src/java.base/share/classes/java/lang/Short.java b/src/java.base/share/classes/java/lang/Short.java
index 920500a7fa3..14f7a267165 100644
--- a/src/java.base/share/classes/java/lang/Short.java
+++ b/src/java.base/share/classes/java/lang/Short.java
@@ -35,7 +35,6 @@ import java.lang.constant.DynamicConstantDesc;
 import java.util.Optional;
 
 import static java.lang.constant.ConstantDescs.BSM_EXPLICIT_CAST;
-import static java.lang.constant.ConstantDescs.CD_int;
 import static java.lang.constant.ConstantDescs.CD_short;
 import static java.lang.constant.ConstantDescs.DEFAULT_NAME;
 
diff --git a/src/java.base/share/classes/java/lang/doc-files/ValueBased.html b/src/java.base/share/classes/java/lang/doc-files/ValueBased.html
index 6a935afe04b..3b860ce0534 100644
--- a/src/java.base/share/classes/java/lang/doc-files/ValueBased.html
+++ b/src/java.base/share/classes/java/lang/doc-files/ValueBased.html
@@ -30,35 +30,35 @@
 <body>
 <h1 id="ValueBased">{@index "Value-based Classes"}</h1>
 
-Some classes, such as <code>java.lang.Integer</code> and
-<code>java.time.LocalDate</code>, are <em>value-based</em>.
+Some classes, such as {@code java.lang.Integer} and
+{@code java.time.LocalDate}, are <em>value-based</em>.
 A value-based class has the following properties:
 <ul>
     <li>the class declares only final instance fields (though these may contain references
         to mutable objects);</li>
-    <li>the class's implementations of <code>equals</code>, <code>hashCode</code>,
-        and <code>toString</code> compute their results solely from the values
+    <li>the class's implementations of {@code equals}, {@code hashCode},
+        and {@code toString} compute their results solely from the values
         of the class's instance fields (and the members of the objects they
         reference), not from the instance's identity;</li>
     <li>the class's methods treat instances as <em>freely substitutable</em>
-        when equal, meaning that interchanging any two instances <code>x</code> and
-        <code>y</code> that are equal according to <code>equals()</code> produces no
+        when equal, meaning that interchanging any two instances {@code x} and
+        {@code y} that are equal according to {@code equals()} produces no
         visible change in the behavior of the class's methods;</li>
     <li>the class performs no synchronization using an instance's monitor;</li>
-    <li>the class does not declare (or has deprecated any) accessible constructors;</li>
+    <li>the class does not declare (or discourages use of) accessible constructors;</li>
     <li>the class does not provide any instance creation mechanism that promises
         a unique identity on each method call&mdash;in particular, any factory
         method's contract must allow for the possibility that if two independently-produced
-        instances are equal according to <code>equals()</code>, they may also be
-        equal according to <code>==</code>;</li>
-    <li>the class is final, and extends either <code>Object</code> or a hierarchy of
+        instances are equal according to {@code equals()}, they may also be
+        equal according to {@code ==};</li>
+    <li>the class is final, and extends either {@code Object} or a hierarchy of
         abstract classes that declare no instance fields or instance initializers
         and whose constructors are empty.</li>
 </ul>
 
 <p>When two instances of a value-based class are equal (according to `equals`), a program
     should not attempt to distinguish between their identities, whether directly via reference
-    equality or indirectly via an appeal to synchronization, identity hashing,
+    equality {@code ==} or indirectly via an appeal to synchronization, identity hashing,
     serialization, or any other identity-sensitive mechanism.</p>
 
 <p>Synchronization on instances of value-based classes is strongly discouraged,
diff --git a/src/java.base/share/classes/java/lang/invoke/MemberName.java b/src/java.base/share/classes/java/lang/invoke/MemberName.java
index 918d1b10791..d320ad11ade 100644
--- a/src/java.base/share/classes/java/lang/invoke/MemberName.java
+++ b/src/java.base/share/classes/java/lang/invoke/MemberName.java
@@ -408,11 +408,12 @@ final class MemberName implements Member, Cloneable {
     // let the rest (native, volatile, transient, etc.) be tested via Modifier.isFoo
 
     // unofficial modifier flags, used by HotSpot:
-    static final int BRIDGE    = 0x00000040;
-    static final int VARARGS   = 0x00000080;
-    static final int SYNTHETIC = 0x00001000;
-    static final int ANNOTATION= 0x00002000;
-    static final int ENUM      = 0x00004000;
+    static final int BRIDGE      = 0x00000040;
+    static final int VARARGS     = 0x00000080;
+    static final int SYNTHETIC   = 0x00001000;
+    static final int ANNOTATION  = 0x00002000;
+    static final int ENUM        = 0x00004000;
+
     /** Utility method to query the modifier flags of this member; returns false if the member is not a method. */
     public boolean isBridge() {
         return allFlagsSet(IS_METHOD | BRIDGE);
@@ -426,19 +427,19 @@ final class MemberName implements Member, Cloneable {
         return allFlagsSet(SYNTHETIC);
     }
 
-    static final String CONSTRUCTOR_NAME = "<init>";  // the ever-popular
+    static final String CONSTRUCTOR_NAME = "<init>";
 
     // modifiers exported by the JVM:
     static final int RECOGNIZED_MODIFIERS = 0xFFFF;
 
     // private flags, not part of RECOGNIZED_MODIFIERS:
     static final int
-            IS_METHOD        = MN_IS_METHOD,        // method (not constructor)
-            IS_CONSTRUCTOR   = MN_IS_CONSTRUCTOR,   // constructor
-            IS_FIELD         = MN_IS_FIELD,         // field
-            IS_TYPE          = MN_IS_TYPE,          // nested type
-            CALLER_SENSITIVE = MN_CALLER_SENSITIVE, // @CallerSensitive annotation detected
-            TRUSTED_FINAL    = MN_TRUSTED_FINAL;    // trusted final field
+            IS_METHOD             = MN_IS_METHOD,              // method (not constructor)
+            IS_CONSTRUCTOR        = MN_IS_CONSTRUCTOR,         // constructor
+            IS_FIELD              = MN_IS_FIELD,               // field
+            IS_TYPE               = MN_IS_TYPE,                // nested type
+            CALLER_SENSITIVE      = MN_CALLER_SENSITIVE,       // @CallerSensitive annotation detected
+            TRUSTED_FINAL         = MN_TRUSTED_FINAL;          // trusted final field
 
     static final int ALL_ACCESS = Modifier.PUBLIC | Modifier.PRIVATE | Modifier.PROTECTED;
     static final int ALL_KINDS = IS_METHOD | IS_CONSTRUCTOR | IS_FIELD | IS_TYPE;
diff --git a/src/java.base/share/classes/java/lang/invoke/MethodHandleProxies.java b/src/java.base/share/classes/java/lang/invoke/MethodHandleProxies.java
index 16f5c7e59b8..8dac21c8968 100644
--- a/src/java.base/share/classes/java/lang/invoke/MethodHandleProxies.java
+++ b/src/java.base/share/classes/java/lang/invoke/MethodHandleProxies.java
@@ -344,7 +344,7 @@ public final class MethodHandleProxies {
                         ClassLoaders.platformClassLoader() : loader)))
                         .build(proxyDesc, clb -> {
             clb.withSuperclass(CD_Object)
-               .withFlags(ACC_FINAL | ACC_SYNTHETIC)
+               .withFlags(ACC_SUPER | ACC_FINAL | ACC_SYNTHETIC)
                .withInterfaceSymbols(ifaceDesc)
                // static and instance fields
                .withField(TYPE_NAME, CD_Class, ACC_PRIVATE | ACC_STATIC | ACC_FINAL)
diff --git a/src/java.base/share/classes/java/lang/reflect/Proxy.java b/src/java.base/share/classes/java/lang/reflect/Proxy.java
index b811deb863d..6ce8e80cdca 100644
--- a/src/java.base/share/classes/java/lang/reflect/Proxy.java
+++ b/src/java.base/share/classes/java/lang/reflect/Proxy.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1999, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1999, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,6 +25,7 @@
 
 package java.lang.reflect;
 
+import java.lang.classfile.ClassFile;
 import java.lang.invoke.MethodHandle;
 import java.lang.invoke.MethodHandles;
 import java.lang.invoke.MethodType;
@@ -467,7 +468,7 @@ public class Proxy implements java.io.Serializable {
              * Generate the specified proxy class.
              */
             byte[] proxyClassFile = ProxyGenerator.generateProxyClass(loader, proxyName, interfaces,
-                                                                      context.accessFlags() | Modifier.FINAL);
+                                                                      context.accessFlags() | Modifier.FINAL | ClassFile.ACC_SUPER);
             try {
                 Class<?> pc = JLA.defineClass(loader, proxyName, proxyClassFile,
                                               null, "__dynamic_proxy__");
diff --git a/src/java.base/share/classes/java/util/WeakHashMap.java b/src/java.base/share/classes/java/util/WeakHashMap.java
index b5a27593840..1412d8f6ff9 100644
--- a/src/java.base/share/classes/java/util/WeakHashMap.java
+++ b/src/java.base/share/classes/java/util/WeakHashMap.java
@@ -25,8 +25,8 @@
 
 package java.util;
 
-import java.lang.ref.WeakReference;
 import java.lang.ref.ReferenceQueue;
+import java.lang.ref.WeakReference;
 import java.util.function.BiConsumer;
 import java.util.function.BiFunction;
 import java.util.function.Consumer;
diff --git a/src/java.base/share/classes/jdk/internal/classfile/impl/DirectClassBuilder.java b/src/java.base/share/classes/jdk/internal/classfile/impl/DirectClassBuilder.java
index 0e82c545359..79c623bc31d 100644
--- a/src/java.base/share/classes/jdk/internal/classfile/impl/DirectClassBuilder.java
+++ b/src/java.base/share/classes/jdk/internal/classfile/impl/DirectClassBuilder.java
@@ -168,7 +168,6 @@ public final class DirectClassBuilder
         this.sizeHint = sizeHint;
     }
 
-
     public byte[] build() {
 
         // The logic of this is very carefully ordered.  We want to avoid
diff --git a/src/java.base/share/classes/jdk/internal/classfile/impl/verifier/VerificationTable.java b/src/java.base/share/classes/jdk/internal/classfile/impl/verifier/VerificationTable.java
index 04276b8eeb8..eb3f5ee913d 100644
--- a/src/java.base/share/classes/jdk/internal/classfile/impl/verifier/VerificationTable.java
+++ b/src/java.base/share/classes/jdk/internal/classfile/impl/verifier/VerificationTable.java
@@ -321,7 +321,7 @@ class VerificationTable {
                 return frame;
             }
             int offset_delta = _stream.get_u2();
-            if (frame_type < SAME_LOCALS_1_STACK_ITEM_EXTENDED) {
+            if (frame_type <= RESERVED_END) {
                 _verifier.classError("reserved frame type");
             }
             if (frame_type == SAME_LOCALS_1_STACK_ITEM_EXTENDED) {
diff --git a/src/java.base/share/classes/jdk/internal/jimage/ImageReader.java b/src/java.base/share/classes/jdk/internal/jimage/ImageReader.java
index c36e265ee2f..4c358820166 100644
--- a/src/java.base/share/classes/jdk/internal/jimage/ImageReader.java
+++ b/src/java.base/share/classes/jdk/internal/jimage/ImageReader.java
@@ -821,6 +821,7 @@ public final class ImageReader implements AutoCloseable {
             this.children = Collections.unmodifiableList(children);
         }
     }
+
     /**
      * Resource node (e.g. a ".class" entry, or any other data resource).
      *
diff --git a/src/java.base/share/classes/module-info.java b/src/java.base/share/classes/module-info.java
index d20f6311bca..665b3a3b98d 100644
--- a/src/java.base/share/classes/module-info.java
+++ b/src/java.base/share/classes/module-info.java
@@ -135,7 +135,6 @@ module java.base {
     exports javax.security.auth.x500;
     exports javax.security.cert;
 
-
     // additional qualified exports may be inserted at build time
     // see make/gensrc/GenModuleInfo.gmk
 
@@ -147,11 +146,11 @@ module java.base {
         java.security.sasl;
     exports jdk.internal to
         jdk.incubator.vector;
-    // Note: all modules in the exported list participate in preview  features
-    // and therefore if they use preview features they do not need to be
-    // compiled with "--enable-preview".
+    // Note: all modules in the exported list participate in preview features,
+    // normal or reflective.  They do not need to be compiled with "--enable-preview"
+    // to use preview features and do not need to suppress "preview" warnings.
     // It is recommended for any modules that do participate that their
-    // module declaration be annotated with jdk.internal.javac.ParticipatesInPreview
+    // module declaration be annotated with jdk.internal.javac.ParticipatesInPreview.
     exports jdk.internal.javac to
         java.compiler,
         jdk.compiler;
diff --git a/src/java.base/share/native/include/classfile_constants.h.template b/src/java.base/share/native/include/classfile_constants.h.template
index fb022ec1fd4..4f96a0673ef 100644
--- a/src/java.base/share/native/include/classfile_constants.h.template
+++ b/src/java.base/share/native/include/classfile_constants.h.template
@@ -111,7 +111,7 @@ enum {
     JVM_CONSTANT_InvokeDynamic          = 18,
     JVM_CONSTANT_Module                 = 19,
     JVM_CONSTANT_Package                = 20,
-    JVM_CONSTANT_ExternalMax            = 20 
+    JVM_CONSTANT_ExternalMax            = 20
 };
 
 /* JVM_CONSTANT_MethodHandle subtypes */

From 08c8520b39083ec6354dc5df2f18c1f4c3588053 Mon Sep 17 00:00:00 2001
From: Patrick Strawderman <patrick@kilink.net>
Date: Wed, 4 Mar 2026 20:04:30 +0000
Subject: [PATCH 043/655] 8378698: Optimize Base64.Encoder#encodeToString

Reviewed-by: liach, rriggs
---
 .../share/classes/java/util/Base64.java       |  6 +-
 .../bench/java/util/Base64EncodeToString.java | 55 +++++++++++++++++++
 2 files changed, 59 insertions(+), 2 deletions(-)
 create mode 100644 test/micro/org/openjdk/bench/java/util/Base64EncodeToString.java

diff --git a/src/java.base/share/classes/java/util/Base64.java b/src/java.base/share/classes/java/util/Base64.java
index ed1a4a8d638..fd714050149 100644
--- a/src/java.base/share/classes/java/util/Base64.java
+++ b/src/java.base/share/classes/java/util/Base64.java
@@ -32,6 +32,8 @@ import java.io.OutputStream;
 import java.nio.ByteBuffer;
 
 import sun.nio.cs.ISO_8859_1;
+import jdk.internal.access.JavaLangAccess;
+import jdk.internal.access.SharedSecrets;
 import jdk.internal.util.Preconditions;
 import jdk.internal.vm.annotation.IntrinsicCandidate;
 
@@ -201,6 +203,7 @@ public final class Base64 {
      * @since   1.8
      */
     public static class Encoder {
+        private static final JavaLangAccess JLA = SharedSecrets.getJavaLangAccess();
 
         private final byte[] newline;
         private final int linemax;
@@ -344,10 +347,9 @@ public final class Base64 {
          *          the byte array to encode
          * @return  A String containing the resulting Base64 encoded characters
          */
-        @SuppressWarnings("deprecation")
         public String encodeToString(byte[] src) {
             byte[] encoded = encode(src);
-            return new String(encoded, 0, 0, encoded.length);
+            return JLA.uncheckedNewStringWithLatin1Bytes(encoded);
         }
 
         /**
diff --git a/test/micro/org/openjdk/bench/java/util/Base64EncodeToString.java b/test/micro/org/openjdk/bench/java/util/Base64EncodeToString.java
new file mode 100644
index 00000000000..5b259230341
--- /dev/null
+++ b/test/micro/org/openjdk/bench/java/util/Base64EncodeToString.java
@@ -0,0 +1,55 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+package org.openjdk.micro.bench.java.util;
+
+import org.openjdk.jmh.annotations.*;
+
+import java.util.Base64;
+import java.util.Random;
+import java.util.concurrent.TimeUnit;
+
+@State(Scope.Benchmark)
+@Warmup(iterations = 5, time = 2)
+@Measurement(iterations = 5, time = 2)
+@Fork(value = 2)
+@OutputTimeUnit(TimeUnit.MILLISECONDS)
+public class Base64EncodeToString {
+
+    private byte[] input;
+
+    @Param({"10", "100", "1000", "10000"})
+    private int inputSize;
+
+    @Setup
+    public void setup() {
+        Random r = new Random(1123);
+        input = new byte[inputSize];
+        r.nextBytes(input);
+    }
+
+    @Benchmark
+    public String testEncodeToString() {
+        return Base64.getEncoder().encodeToString(input);
+    }
+}
+

From 1f4a7bbb9d67fdaaf63a70d92df895aea41ad201 Mon Sep 17 00:00:00 2001
From: Kim Barrett <kbarrett@openjdk.org>
Date: Wed, 4 Mar 2026 22:42:19 +0000
Subject: [PATCH 044/655] 8379040: Remove inclusion of allocation.hpp from
 atomicAccess.hpp

Reviewed-by: iwalulya, dholmes
---
 src/hotspot/share/opto/phasetype.hpp       | 3 ++-
 src/hotspot/share/runtime/atomicAccess.hpp | 6 +++---
 src/hotspot/share/utilities/bitMap.hpp     | 3 ++-
 3 files changed, 7 insertions(+), 5 deletions(-)

diff --git a/src/hotspot/share/opto/phasetype.hpp b/src/hotspot/share/opto/phasetype.hpp
index f388dc6cdc6..ce432fbfc01 100644
--- a/src/hotspot/share/opto/phasetype.hpp
+++ b/src/hotspot/share/opto/phasetype.hpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2012, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2012, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,6 +25,7 @@
 #ifndef SHARE_OPTO_PHASETYPE_HPP
 #define SHARE_OPTO_PHASETYPE_HPP
 
+#include "memory/allocation.hpp"
 #include "utilities/bitMap.inline.hpp"
 #include "utilities/stringUtils.hpp"
 
diff --git a/src/hotspot/share/runtime/atomicAccess.hpp b/src/hotspot/share/runtime/atomicAccess.hpp
index c9a2dfb9383..46330cffdb2 100644
--- a/src/hotspot/share/runtime/atomicAccess.hpp
+++ b/src/hotspot/share/runtime/atomicAccess.hpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1999, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1999, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -26,7 +26,7 @@
 #define SHARE_RUNTIME_ATOMICACCESS_HPP
 
 #include "cppstdlib/type_traits.hpp"
-#include "memory/allocation.hpp"
+#include "memory/allStatic.hpp"
 #include "metaprogramming/enableIf.hpp"
 #include "metaprogramming/primitiveConversions.hpp"
 #include "runtime/orderAccess.hpp"
@@ -829,7 +829,7 @@ class AtomicAccess::PlatformBitops
 {};
 
 template <ScopedFenceType T>
-class ScopedFenceGeneral: public StackObj {
+class ScopedFenceGeneral {
  public:
   void prefix() {}
   void postfix() {}
diff --git a/src/hotspot/share/utilities/bitMap.hpp b/src/hotspot/share/utilities/bitMap.hpp
index 5ee462bbe47..17bf437ecae 100644
--- a/src/hotspot/share/utilities/bitMap.hpp
+++ b/src/hotspot/share/utilities/bitMap.hpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1997, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -30,6 +30,7 @@
 #include "utilities/globalDefinitions.hpp"
 
 // Forward decl;
+class Arena;
 class BitMapClosure;
 
 // Operations for bitmaps represented as arrays of unsigned integers.

From c9da76bf33a5e44eb238e3b29eda523e7754b7b6 Mon Sep 17 00:00:00 2001
From: Xiaohong Gong <xgong@openjdk.org>
Date: Thu, 5 Mar 2026 01:57:03 +0000
Subject: [PATCH 045/655] 8377449: Strengthen vector IR validation in
 TestVectorAlgorithms.java for AArch64

Reviewed-by: mhaessig, epeter
---
 .../vectorization/TestVectorAlgorithms.java   | 22 ++++++++++++-------
 1 file changed, 14 insertions(+), 8 deletions(-)

diff --git a/test/hotspot/jtreg/compiler/vectorization/TestVectorAlgorithms.java b/test/hotspot/jtreg/compiler/vectorization/TestVectorAlgorithms.java
index e02563c2fc2..785a6de30a0 100644
--- a/test/hotspot/jtreg/compiler/vectorization/TestVectorAlgorithms.java
+++ b/test/hotspot/jtreg/compiler/vectorization/TestVectorAlgorithms.java
@@ -272,8 +272,10 @@ public class TestVectorAlgorithms {
     @Test
     @IR(counts = {IRNode.ADD_VI,       "> 0",
                   IRNode.STORE_VECTOR, "> 0"},
-        applyIfCPUFeature = {"sse4.1", "true"})
-    // Note: also works with NEON/asimd, but only with TieredCompilation.
+        applyIfCPUFeatureOr = {"sse4.1", "true", "asimd", "true"},
+        applyIf = {"TieredCompilation", "true"})
+    // IR check only works with TieredCompilation. Needs to make it
+    // work with -XX:-TieredCompilation in future (see JDK-8378640).
     public Object iotaI_VectorAPI(int[] r) {
         return VectorAlgorithmsImpl.iotaI_VectorAPI(r);
     }
@@ -360,7 +362,7 @@ public class TestVectorAlgorithms {
     @IR(counts = {IRNode.LOAD_VECTOR_F,   "> 0",
                   IRNode.ADD_REDUCTION_V, "> 0",
                   IRNode.MUL_VF,          "> 0"},
-        applyIfCPUFeature = {"sse4.1", "true"},
+        applyIfCPUFeatureOr = {"sse4.1", "true", "asimd", "true"},
         applyIf = {"UseSuperWord", "true"})
     public float dotProductF_VectorAPI_naive(float[] a, float[] b) {
         return VectorAlgorithmsImpl.dotProductF_VectorAPI_naive(a, b);
@@ -370,7 +372,7 @@ public class TestVectorAlgorithms {
     @IR(counts = {IRNode.LOAD_VECTOR_F,   "> 0",
                   IRNode.ADD_REDUCTION_V, "> 0",
                   IRNode.MUL_VF,          "> 0"},
-        applyIfCPUFeature = {"sse4.1", "true"},
+        applyIfCPUFeatureOr = {"sse4.1", "true", "asimd", "true"},
         applyIf = {"UseSuperWord", "true"})
     public float dotProductF_VectorAPI_reduction_after_loop(float[] a, float[] b) {
         return VectorAlgorithmsImpl.dotProductF_VectorAPI_reduction_after_loop(a, b);
@@ -392,7 +394,8 @@ public class TestVectorAlgorithms {
                   IRNode.MUL_VI,           IRNode.VECTOR_SIZE_8, "> 0",
                   IRNode.ADD_VI,           IRNode.VECTOR_SIZE_8, "> 0",
                   IRNode.ADD_REDUCTION_VI,                       "> 0"},
-        applyIfCPUFeature = {"avx2", "true"})
+        applyIfCPUFeatureOr = {"avx2", "true", "sve", "true"},
+        applyIf = {"MaxVectorSize", ">=32"})
     public int hashCodeB_VectorAPI_v1(byte[] a) {
         return VectorAlgorithmsImpl.hashCodeB_VectorAPI_v1(a);
     }
@@ -402,7 +405,7 @@ public class TestVectorAlgorithms {
                   IRNode.MUL_VI,           "> 0",
                   IRNode.ADD_VI,           "> 0",
                   IRNode.ADD_REDUCTION_VI, "> 0"},
-        applyIfCPUFeature = {"avx2", "true"})
+        applyIfCPUFeatureOr = {"avx2", "true", "asimd", "true"})
     public int hashCodeB_VectorAPI_v2(byte[] a) {
         return VectorAlgorithmsImpl.hashCodeB_VectorAPI_v2(a);
     }
@@ -506,7 +509,7 @@ public class TestVectorAlgorithms {
                   IRNode.VECTOR_TEST,         "> 0",
                   IRNode.COMPRESS_VI,         "> 0",
                   IRNode.STORE_VECTOR_MASKED, "> 0"},
-        applyIfCPUFeature = {"avx2", "true"})
+        applyIfCPUFeatureOr = {"avx2", "true", "sve", "true"})
     public Object filterI_VectorAPI(int[] a, int[] r, int threshold) {
         return VectorAlgorithmsImpl.filterI_VectorAPI(a, r, threshold);
     }
@@ -526,7 +529,10 @@ public class TestVectorAlgorithms {
                   IRNode.OR_V_MASK,                 "> 0",
                   IRNode.ADD_VI,                    "> 0",
                   IRNode.ADD_REDUCTION_VI,          "> 0"},
-        applyIfCPUFeatureOr = {"avx512", "true", "sve", "true"})
+        applyIfCPUFeatureOr = {"avx512", "true", "sve", "true"},
+        applyIf = {"TieredCompilation", "true"})
+    // IR check only works with TieredCompilation. Needs to make it
+    // work with -XX:-TieredCompilation in future (see JDK-8378640).
     public int reduceAddIFieldsX4_VectorAPI(int[] oops, int[] mem) {
         return VectorAlgorithmsImpl.reduceAddIFieldsX4_VectorAPI(oops, mem);
     }

From c87ecaddfb32485b2ecaecc9284ce37b610ffffc Mon Sep 17 00:00:00 2001
From: Fredrik Bredberg <fbredberg@openjdk.org>
Date: Thu, 5 Mar 2026 09:23:21 +0000
Subject: [PATCH 046/655] 8379192: Use an initializer list in the ObjectWaiter
 constructor

Reviewed-by: coleenp, dholmes, aartemov
---
 src/hotspot/share/runtime/objectMonitor.cpp | 26 ++++++++++-----------
 1 file changed, 13 insertions(+), 13 deletions(-)

diff --git a/src/hotspot/share/runtime/objectMonitor.cpp b/src/hotspot/share/runtime/objectMonitor.cpp
index 8c6994c2152..91771772e2c 100644
--- a/src/hotspot/share/runtime/objectMonitor.cpp
+++ b/src/hotspot/share/runtime/objectMonitor.cpp
@@ -2541,19 +2541,19 @@ bool ObjectMonitor::try_spin(JavaThread* current) {
 // -----------------------------------------------------------------------------
 // wait_set management ...
 
-ObjectWaiter::ObjectWaiter(JavaThread* current) {
-  _next     = nullptr;
-  _prev     = nullptr;
-  _thread   = current;
-  _monitor  = nullptr;
-  _notifier_tid = 0;
-  _recursions = 0;
-  TState    = TS_RUN;
-  _is_wait  = false;
-  _at_reenter = false;
-  _interrupted = false;
-  _do_timed_park = false;
-  _active   = false;
+ObjectWaiter::ObjectWaiter(JavaThread* current)
+  : _next(nullptr),
+    _prev(nullptr),
+    _thread(current),
+    _monitor(nullptr),
+    _notifier_tid(0),
+    _recursions(0),
+    TState(TS_RUN),
+    _is_wait(false),
+    _at_reenter(false),
+    _interrupted(false),
+    _do_timed_park(false),
+    _active(false) {
 }
 
 const char* ObjectWaiter::getTStateName(ObjectWaiter::TStates state) {

From 28e8700f461cee6c80da15c71090eaf608b6f8fa Mon Sep 17 00:00:00 2001
From: David Briemann <dbriemann@openjdk.org>
Date: Thu, 5 Mar 2026 10:08:57 +0000
Subject: [PATCH 047/655] 8378675: PPC64: increase instruction cache line size

Reviewed-by: mdoerr
---
 src/hotspot/cpu/ppc/icache_ppc.cpp            |  8 +++-
 src/hotspot/cpu/ppc/icache_ppc.hpp            |  9 ++--
 src/hotspot/cpu/ppc/vm_version_ppc.cpp        | 39 +++++-----------
 src/hotspot/cpu/ppc/vm_version_ppc.hpp        |  7 ++-
 .../os_cpu/aix_ppc/vm_version_aix_ppc.cpp     | 36 +++++++++++++++
 .../os_cpu/linux_ppc/vm_version_linux_ppc.cpp | 44 +++++++++++++++++++
 6 files changed, 105 insertions(+), 38 deletions(-)
 create mode 100644 src/hotspot/os_cpu/aix_ppc/vm_version_aix_ppc.cpp
 create mode 100644 src/hotspot/os_cpu/linux_ppc/vm_version_linux_ppc.cpp

diff --git a/src/hotspot/cpu/ppc/icache_ppc.cpp b/src/hotspot/cpu/ppc/icache_ppc.cpp
index 05ad3c7a30d..f3d51bad18c 100644
--- a/src/hotspot/cpu/ppc/icache_ppc.cpp
+++ b/src/hotspot/cpu/ppc/icache_ppc.cpp
@@ -1,6 +1,6 @@
 /*
- * Copyright (c) 2000, 2025, Oracle and/or its affiliates. All rights reserved.
- * Copyright (c) 2012, 2018 SAP SE. All rights reserved.
+ * Copyright (c) 2000, 2026, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2012, 2026 SAP SE. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -24,6 +24,7 @@
  */
 
 #include "runtime/icache.hpp"
+#include "runtime/vm_version.hpp"
 
 // Use inline assembler to implement icache flush.
 int ICache::ppc64_flush_icache(address start, int lines, int magic) {
@@ -67,6 +68,9 @@ int ICache::ppc64_flush_icache(address start, int lines, int magic) {
 
 void ICacheStubGenerator::generate_icache_flush(ICache::flush_icache_stub_t* flush_icache_stub) {
 
+  guarantee(VM_Version::get_icache_line_size() >= ICache::line_size,
+            "processors with smaller cache line size are no longer supported");
+
   *flush_icache_stub = (ICache::flush_icache_stub_t)ICache::ppc64_flush_icache;
 
   // First call to flush itself.
diff --git a/src/hotspot/cpu/ppc/icache_ppc.hpp b/src/hotspot/cpu/ppc/icache_ppc.hpp
index d348cad1c72..024f706182a 100644
--- a/src/hotspot/cpu/ppc/icache_ppc.hpp
+++ b/src/hotspot/cpu/ppc/icache_ppc.hpp
@@ -1,6 +1,6 @@
 /*
- * Copyright (c) 2002, 2023, Oracle and/or its affiliates. All rights reserved.
- * Copyright (c) 2012, 2013 SAP SE. All rights reserved.
+ * Copyright (c) 2002, 2026, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2012, 2026 SAP SE. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -35,9 +35,8 @@ class ICache : public AbstractICache {
 
  public:
   enum {
-    // Actually, cache line size is 64, but keeping it as it is to be
-    // on the safe side on ALL PPC64 implementations.
-    log2_line_size = 5,
+    // Cache line size is 128 on all supported PPC64 implementations.
+    log2_line_size = 7,
     line_size      = 1 << log2_line_size
   };
 
diff --git a/src/hotspot/cpu/ppc/vm_version_ppc.cpp b/src/hotspot/cpu/ppc/vm_version_ppc.cpp
index 75feb389298..e471f5a6e4f 100644
--- a/src/hotspot/cpu/ppc/vm_version_ppc.cpp
+++ b/src/hotspot/cpu/ppc/vm_version_ppc.cpp
@@ -1,6 +1,6 @@
 /*
- * Copyright (c) 1997, 2025, Oracle and/or its affiliates. All rights reserved.
- * Copyright (c) 2012, 2025 SAP SE. All rights reserved.
+ * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2012, 2026 SAP SE. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -475,19 +475,12 @@ void VM_Version::print_features() {
 
 void VM_Version::determine_features() {
 #if defined(ABI_ELFv2)
-  // 1 InstWord per call for the blr instruction.
-  const int code_size = (num_features+1+2*1)*BytesPerInstWord;
+  const int code_size = (num_features + 1 /*blr*/) * BytesPerInstWord;
 #else
-  // 7 InstWords for each call (function descriptor + blr instruction).
-  const int code_size = (num_features+1+2*7)*BytesPerInstWord;
+  const int code_size = (num_features + 1 /*blr*/ + 6 /* fd */) * BytesPerInstWord;
 #endif
   int features = 0;
 
-  // create test area
-  enum { BUFFER_SIZE = 2*4*K }; // Needs to be >=2* max cache line size (cache line size can't exceed min page size).
-  char test_area[BUFFER_SIZE];
-  char *mid_of_test_area = &test_area[BUFFER_SIZE>>1];
-
   // Allocate space for the code.
   ResourceMark rm;
   CodeBuffer cb("detect_cpu_features", code_size, 0);
@@ -497,20 +490,13 @@ void VM_Version::determine_features() {
   _features = VM_Version::all_features_m;
 
   // Emit code.
-  void (*test)(address addr, uint64_t offset)=(void(*)(address addr, uint64_t offset))(void *)a->function_entry();
+  void (*test)() = (void(*)())(void *)a->function_entry();
   uint32_t *code = (uint32_t *)a->pc();
-  // Keep R3_ARG1 unmodified, it contains &field (see below).
-  // Keep R4_ARG2 unmodified, it contains offset = 0 (see below).
   a->mfdscr(R0);
   a->darn(R7);
   a->brw(R5, R6);
   a->blr();
 
-  // Emit function to set one cache line to zero. Emit function descriptor and get pointer to it.
-  void (*zero_cacheline_func_ptr)(char*) = (void(*)(char*))(void *)a->function_entry();
-  a->dcbz(R3_ARG1); // R3_ARG1 = addr
-  a->blr();
-
   uint32_t *code_end = (uint32_t *)a->pc();
   a->flush();
   _features = VM_Version::unknown_m;
@@ -522,18 +508,9 @@ void VM_Version::determine_features() {
     Disassembler::decode((u_char*)code, (u_char*)code_end, tty);
   }
 
-  // Measure cache line size.
-  memset(test_area, 0xFF, BUFFER_SIZE); // Fill test area with 0xFF.
-  (*zero_cacheline_func_ptr)(mid_of_test_area); // Call function which executes dcbz to the middle.
-  int count = 0; // count zeroed bytes
-  for (int i = 0; i < BUFFER_SIZE; i++) if (test_area[i] == 0) count++;
-  guarantee(is_power_of_2(count), "cache line size needs to be a power of 2");
-  _L1_data_cache_line_size = count;
-
   // Execute code. Illegal instructions will be replaced by 0 in the signal handler.
   VM_Version::_is_determine_features_test_running = true;
-  // We must align the first argument to 16 bytes because of the lqarx check.
-  (*test)(align_up((address)mid_of_test_area, 16), 0);
+  (*test)();
   VM_Version::_is_determine_features_test_running = false;
 
   // determine which instructions are legal.
@@ -550,6 +527,10 @@ void VM_Version::determine_features() {
   }
 
   _features = features;
+
+  _L1_data_cache_line_size = VM_Version::get_dcache_line_size();
+  assert(_L1_data_cache_line_size >= DEFAULT_CACHE_LINE_SIZE,
+         "processors with smaller cache line size are no longer supported");
 }
 
 // Power 8: Configure Data Stream Control Register.
diff --git a/src/hotspot/cpu/ppc/vm_version_ppc.hpp b/src/hotspot/cpu/ppc/vm_version_ppc.hpp
index 11dce83bed0..0f4eb3593a3 100644
--- a/src/hotspot/cpu/ppc/vm_version_ppc.hpp
+++ b/src/hotspot/cpu/ppc/vm_version_ppc.hpp
@@ -1,6 +1,6 @@
 /*
- * Copyright (c) 1997, 2025, Oracle and/or its affiliates. All rights reserved.
- * Copyright (c) 2012, 2025 SAP SE. All rights reserved.
+ * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2012, 2026 SAP SE. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -81,6 +81,9 @@ public:
   static uint64_t _dscr_val;
 
   static void initialize_cpu_information(void);
+
+  static int get_dcache_line_size();
+  static int get_icache_line_size();
 };
 
 #endif // CPU_PPC_VM_VERSION_PPC_HPP
diff --git a/src/hotspot/os_cpu/aix_ppc/vm_version_aix_ppc.cpp b/src/hotspot/os_cpu/aix_ppc/vm_version_aix_ppc.cpp
new file mode 100644
index 00000000000..8cc8b715201
--- /dev/null
+++ b/src/hotspot/os_cpu/aix_ppc/vm_version_aix_ppc.cpp
@@ -0,0 +1,36 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2026 SAP SE. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ *
+ */
+
+#include "runtime/vm_version.hpp"
+
+#include <sys/systemcfg.h>
+
+int VM_Version::get_dcache_line_size() {
+  return _system_configuration.dcache_line;
+}
+
+int VM_Version::get_icache_line_size() {
+  return _system_configuration.icache_line;
+}
diff --git a/src/hotspot/os_cpu/linux_ppc/vm_version_linux_ppc.cpp b/src/hotspot/os_cpu/linux_ppc/vm_version_linux_ppc.cpp
new file mode 100644
index 00000000000..d64340edf5c
--- /dev/null
+++ b/src/hotspot/os_cpu/linux_ppc/vm_version_linux_ppc.cpp
@@ -0,0 +1,44 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2026 SAP SE. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ *
+ */
+
+#include "runtime/vm_version.hpp"
+
+#include <unistd.h>
+
+int VM_Version::get_dcache_line_size() {
+  // This should work on all modern linux versions:
+  int size = sysconf(_SC_LEVEL1_DCACHE_LINESIZE);
+  // It may fail with very old linux / glibc versions. We use DEFAULT_CACHE_LINE_SIZE in this case.
+  // That is the correct value for all currently supported processors.
+  return (size <= 0) ? DEFAULT_CACHE_LINE_SIZE : size;
+}
+
+int VM_Version::get_icache_line_size() {
+  // This should work on all modern linux versions:
+  int size = sysconf(_SC_LEVEL1_ICACHE_LINESIZE);
+  // It may fail with very old linux / glibc versions. We use DEFAULT_CACHE_LINE_SIZE in this case.
+  // That is the correct value for all currently supported processors.
+  return (size <= 0) ? DEFAULT_CACHE_LINE_SIZE : size;
+}

From c9a0e365083a7868c49f082623d722e721838642 Mon Sep 17 00:00:00 2001
From: Ivan Walulya <iwalulya@openjdk.org>
Date: Thu, 5 Mar 2026 10:13:26 +0000
Subject: [PATCH 048/655] 8378376: DaCapo-h2-large regression after JDK-8238686

Reviewed-by: kbarrett, tschatzl
---
 src/hotspot/share/gc/g1/g1HeapSizingPolicy.cpp | 8 +++++++-
 src/hotspot/share/gc/shared/collectedHeap.hpp  | 2 +-
 2 files changed, 8 insertions(+), 2 deletions(-)

diff --git a/src/hotspot/share/gc/g1/g1HeapSizingPolicy.cpp b/src/hotspot/share/gc/g1/g1HeapSizingPolicy.cpp
index 4dd0a509bcd..1b9704e8ad3 100644
--- a/src/hotspot/share/gc/g1/g1HeapSizingPolicy.cpp
+++ b/src/hotspot/share/gc/g1/g1HeapSizingPolicy.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2016, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2016, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -366,6 +366,12 @@ static size_t target_heap_capacity(size_t used_bytes, uintx free_ratio) {
 }
 
 size_t G1HeapSizingPolicy::full_collection_resize_amount(bool& expand, size_t allocation_word_size) {
+  // User-requested Full GCs introduce GC load unrelated to heap size; reset CPU
+  // usage tracking so heap resizing heuristics are driven only by GC pressure.
+  if (GCCause::is_user_requested_gc(_g1h->gc_cause())) {
+    reset_cpu_usage_tracking_data();
+  }
+
   const size_t capacity_after_gc = _g1h->capacity();
   // Capacity, free and used after the GC counted as full regions to
   // include the waste in the following calculations.
diff --git a/src/hotspot/share/gc/shared/collectedHeap.hpp b/src/hotspot/share/gc/shared/collectedHeap.hpp
index f13c3ab7b6e..100866bb528 100644
--- a/src/hotspot/share/gc/shared/collectedHeap.hpp
+++ b/src/hotspot/share/gc/shared/collectedHeap.hpp
@@ -289,7 +289,7 @@ protected:
   DEBUG_ONLY(bool is_in_or_null(const void* p) const { return p == nullptr || is_in(p); })
 
   void set_gc_cause(GCCause::Cause v);
-  GCCause::Cause gc_cause() { return _gc_cause; }
+  GCCause::Cause gc_cause() const { return _gc_cause; }
 
   oop obj_allocate(Klass* klass, size_t size, TRAPS);
   virtual oop array_allocate(Klass* klass, size_t size, int length, bool do_zero, TRAPS);

From ec3b58b5e0c93c9e32a59dd1b65bd3b9dea6e12b Mon Sep 17 00:00:00 2001
From: Daniel Fuchs <dfuchs@openjdk.org>
Date: Thu, 5 Mar 2026 10:37:23 +0000
Subject: [PATCH 049/655] 8379162: AggregateRequestBodyTest.java intermittent
 fails "Connection closed by client peer: APPLICATION_ERROR"

Reviewed-by: jpai, syan, djelinski
---
 .../httpclient/AggregateRequestBodyTest.java  | 36 +++++++++++++------
 1 file changed, 25 insertions(+), 11 deletions(-)

diff --git a/test/jdk/java/net/httpclient/AggregateRequestBodyTest.java b/test/jdk/java/net/httpclient/AggregateRequestBodyTest.java
index 175e860c229..fb67cf02566 100644
--- a/test/jdk/java/net/httpclient/AggregateRequestBodyTest.java
+++ b/test/jdk/java/net/httpclient/AggregateRequestBodyTest.java
@@ -74,6 +74,7 @@ import static java.lang.System.out;
 import static java.net.http.HttpClient.Version.HTTP_1_1;
 import static java.net.http.HttpClient.Version.HTTP_2;
 import static java.net.http.HttpClient.Version.HTTP_3;
+import static java.net.http.HttpOption.H3_DISCOVERY;
 import static java.net.http.HttpOption.Http3DiscoveryMode.HTTP_3_URI_ONLY;
 
 import org.junit.jupiter.api.AfterAll;
@@ -81,7 +82,6 @@ import org.junit.jupiter.api.Assertions;
 import static org.junit.jupiter.api.Assertions.assertEquals;
 import static org.junit.jupiter.api.Assertions.assertFalse;
 import static org.junit.jupiter.api.Assertions.assertTrue;
-import static org.junit.jupiter.api.Assertions.assertThrows;
 
 import org.junit.jupiter.api.Assumptions;
 import org.junit.jupiter.api.BeforeAll;
@@ -219,7 +219,7 @@ public class AggregateRequestBodyTest implements HttpServerAdapters {
         int i = 0;
         for (boolean sameClient : List.of(false, true)) {
             for (URI uri : uris()) {
-                HttpClient.Version version = null;
+                final HttpClient.Version version;
                 if (uri.equals(http1URI) || uri.equals(https1URI)) version = HttpClient.Version.HTTP_1_1;
                 else if (uri.equals(http2URI) || uri.equals(https2URI)) version = HttpClient.Version.HTTP_2;
                 else if (uri.equals(http3URI)) version = HTTP_3;
@@ -295,7 +295,7 @@ public class AggregateRequestBodyTest implements HttpServerAdapters {
 
     static List<Long> lengths(long... lengths) {
         return LongStream.of(lengths)
-                .mapToObj(Long::valueOf)
+                .boxed()
                 .collect(Collectors.toList());
     }
 
@@ -446,7 +446,7 @@ public class AggregateRequestBodyTest implements HttpServerAdapters {
 
         @Override
         public void onComplete() {
-            resultCF.complete(items.stream().collect(Collectors.toUnmodifiableList()));
+            resultCF.complete(items.stream().toList());
         }
 
         public ByteBuffer take() {
@@ -552,7 +552,7 @@ public class AggregateRequestBodyTest implements HttpServerAdapters {
         subscriber.subscriptionCF.thenAccept(s -> s.request(Long.MAX_VALUE));
         if (errorPublisher.hasErrors()) {
             CompletionException ce = Assertions.assertThrows(CompletionException.class,
-                    () -> subscriber.resultCF.join());
+                    subscriber.resultCF::join);
             out.println(description + ": got expected " + ce);
             assertEquals(Exception.class, ce.getCause().getClass());
             assertEquals(result, stringFromBytes(subscriber.items.stream()) + "<error>");
@@ -600,7 +600,7 @@ public class AggregateRequestBodyTest implements HttpServerAdapters {
                 description.replace("null", "length(-1)"));
     }
 
-    private static final Throwable completionCause(CompletionException x) {
+    private static Throwable completionCause(CompletionException x) {
         while (x.getCause() instanceof CompletionException) {
             x = (CompletionException)x.getCause();
         }
@@ -618,7 +618,7 @@ public class AggregateRequestBodyTest implements HttpServerAdapters {
         publisher.subscribe(subscriber);
         Subscription subscription = subscriber.subscriptionCF.join();
         subscription.request(n);
-        CompletionException expected = Assertions.assertThrows(CE, () -> subscriber.resultCF.join());
+        CompletionException expected = Assertions.assertThrows(CE, subscriber.resultCF::join);
         Throwable cause = completionCause(expected);
         if (cause instanceof IllegalArgumentException) {
             System.out.printf("Got expected IAE for %d: %s%n", n, cause);
@@ -655,7 +655,7 @@ public class AggregateRequestBodyTest implements HttpServerAdapters {
         assertTrue(requestSubscriber1.resultCF().isDone());
         String result1 = stringFromBytes(list1.stream());
         assertEquals("Lorem ipsum dolor sit amet, consectetur adipiscing elit.", result1);
-        System.out.println("Got expected sentence with one request: \"%s\"".formatted(result1));
+        System.out.printf("Got expected sentence with one request: \"%s\"%n", result1);
 
         // Test that we can split our requests call any which way we want
         // (whether in the 'middle of a publisher' or at the boundaries.
@@ -824,7 +824,7 @@ public class AggregateRequestBodyTest implements HttpServerAdapters {
                         .toArray(HttpRequest.BodyPublisher[]::new)
                 );
 
-        HttpRequest request = HttpRequest.newBuilder(uri)
+        HttpRequest request = newRequestBuilder(uri)
                 .version(version)
                 .POST(publisher)
                 .build();
@@ -835,13 +835,21 @@ public class AggregateRequestBodyTest implements HttpServerAdapters {
             HttpResponse<String> response = client.send(request, BodyHandlers.ofString());
             int expectedResponse =  RESPONSE_CODE;
             if (response.statusCode() != expectedResponse)
-                throw new RuntimeException("wrong response code " + Integer.toString(response.statusCode()));
+                throw new RuntimeException("wrong response code " + response.statusCode());
             assertEquals(BODIES.stream().collect(Collectors.joining()), response.body());
         }
         if (!sameClient) client.close();
         System.out.println("test: DONE");
     }
 
+    private static HttpRequest.Builder newRequestBuilder(URI uri) {
+        var builder = HttpRequest.newBuilder(uri);
+        if (uri.getPath().contains("/http3/")) {
+            builder.setOption(H3_DISCOVERY, HTTP_3_URI_ONLY);
+        }
+        return builder;
+    }
+
     private static URI buildURI(String scheme, String path, int port) {
         return URIBuilder.newBuilder()
                 .scheme(scheme)
@@ -882,11 +890,17 @@ public class AggregateRequestBodyTest implements HttpServerAdapters {
         http3TestServer.start();
     }
 
+    private static void close(AutoCloseable closeable) throws Exception {
+        if (closeable == null) return;
+        out.println("Closing shared client " + closeable);
+        closeable.close();
+    }
+
     @AfterAll
     public static void teardown() throws Exception {
         String sharedClientName =
                 sharedClient == null ? null : sharedClient.toString();
-        sharedClient.close();
+        close(sharedClient);
         sharedClient = null;
         Thread.sleep(100);
         AssertionError fail = TRACKER.check(500);

From 8a9b63f76fd678c6883a51332aeb84846791ed5e Mon Sep 17 00:00:00 2001
From: Kerem Kat <krk@openjdk.org>
Date: Thu, 5 Mar 2026 11:05:01 +0000
Subject: [PATCH 050/655] 8378413: C2: Missed Ideal optimization opportunity in
 PhaseIterGVN for URShiftI  still exists

Reviewed-by: qamai, dlong
---
 src/hotspot/share/opto/mulnode.cpp            |  18 ++-
 .../c2/gvn/MissedURShiftIAddILShiftIdeal.java | 134 ++++++++++++++++++
 2 files changed, 148 insertions(+), 4 deletions(-)
 create mode 100644 test/hotspot/jtreg/compiler/c2/gvn/MissedURShiftIAddILShiftIdeal.java

diff --git a/src/hotspot/share/opto/mulnode.cpp b/src/hotspot/share/opto/mulnode.cpp
index 9bdaa3b9f34..cac9f1dcc37 100644
--- a/src/hotspot/share/opto/mulnode.cpp
+++ b/src/hotspot/share/opto/mulnode.cpp
@@ -1539,15 +1539,20 @@ Node* URShiftINode::Ideal(PhaseGVN* phase, bool can_reshape) {
   Node *add = in(1);
   if (in1_op == Op_AddI) {
     Node *lshl = add->in(1);
+    Node *y    = add->in(2);
+    if (lshl->Opcode() != Op_LShiftI) {
+      lshl = add->in(2);
+      y    = add->in(1);
+    }
     // Compare shift counts by value, not by node pointer, to also match a not-yet-normalized
     // negative constant (e.g. -1 vs 31)
     int lshl_con = 0;
     if (lshl->Opcode() == Op_LShiftI &&
         const_shift_count(phase, lshl, &lshl_con) &&
         (lshl_con & (BitsPerJavaInteger - 1)) == con) {
-      Node *y_z = phase->transform( new URShiftINode(add->in(2),in(2)) );
-      Node *sum = phase->transform( new AddINode( lshl->in(1), y_z ) );
-      return new AndINode( sum, phase->intcon(mask) );
+      Node *y_z = phase->transform(new URShiftINode(y, in(2)));
+      Node *sum = phase->transform(new AddINode(lshl->in(1), y_z));
+      return new AndINode(sum, phase->intcon(mask));
     }
   }
 
@@ -1699,13 +1704,18 @@ Node* URShiftLNode::Ideal(PhaseGVN* phase, bool can_reshape) {
   const TypeInt *t2 = phase->type(in(2))->isa_int();
   if (add->Opcode() == Op_AddL) {
     Node *lshl = add->in(1);
+    Node *y    = add->in(2);
+    if (lshl->Opcode() != Op_LShiftL) {
+      lshl = add->in(2);
+      y    = add->in(1);
+    }
     // Compare shift counts by value, not by node pointer, to also match a not-yet-normalized
     // negative constant (e.g. -1 vs 63)
     int lshl_con = 0;
     if (lshl->Opcode() == Op_LShiftL &&
         const_shift_count(phase, lshl, &lshl_con) &&
         (lshl_con & (BitsPerJavaLong - 1)) == con) {
-      Node* y_z = phase->transform(new URShiftLNode(add->in(2), in(2)));
+      Node* y_z = phase->transform(new URShiftLNode(y, in(2)));
       Node* sum = phase->transform(new AddLNode(lshl->in(1), y_z));
       return new AndLNode(sum, phase->longcon(mask));
     }
diff --git a/test/hotspot/jtreg/compiler/c2/gvn/MissedURShiftIAddILShiftIdeal.java b/test/hotspot/jtreg/compiler/c2/gvn/MissedURShiftIAddILShiftIdeal.java
new file mode 100644
index 00000000000..a1f4f011466
--- /dev/null
+++ b/test/hotspot/jtreg/compiler/c2/gvn/MissedURShiftIAddILShiftIdeal.java
@@ -0,0 +1,134 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+package compiler.c2.gvn;
+
+import compiler.lib.ir_framework.*;
+import jdk.test.lib.Asserts;
+import jdk.test.lib.Utils;
+import java.util.Random;
+
+/*
+ * @test
+ * @bug 8378413
+ * @key randomness
+ * @summary Verify that URShift{I,L}Node::Ideal optimizes ((x << C) + y) >>> C
+ *          regardless of Add input order, i.e. it is commutative w.r.t. the addition.
+ * @library /test/lib /
+ * @run driver ${test.main.class}
+ * @run driver ${test.main.class} -XX:+IgnoreUnrecognizedVMOptions -XX:+UnlockDiagnosticVMOptions
+ *              -XX:VerifyIterativeGVN=1110 -Xbatch -XX:CompileCommand=compileonly,${test.main.class}::*
+ */
+public class MissedURShiftIAddILShiftIdeal {
+
+    private static final Random RANDOM = Utils.getRandomInstance();
+
+    public static void main(String[] args) {
+        TestFramework.run();
+    }
+
+    @Run(test = {"testI", "testICommuted", "testIComputedY",
+                  "testL", "testLCommuted", "testLComputedY"})
+    public void runMethod() {
+        int xi = RANDOM.nextInt();
+        int yi = RANDOM.nextInt();
+        int ai = RANDOM.nextInt();
+        int bi = RANDOM.nextInt();
+        long xl = RANDOM.nextLong();
+        long yl = RANDOM.nextLong();
+        long al = RANDOM.nextLong();
+        long bl = RANDOM.nextLong();
+
+        assertResultI(xi, yi, ai, bi);
+        assertResultL(xl, yl, al, bl);
+    }
+
+    @DontCompile
+    public void assertResultI(int x, int y, int a, int b) {
+        Asserts.assertEQ(((x << 3) + y) >>> 3, testI(x, y));
+        Asserts.assertEQ((y + (x << 5)) >>> 5, testICommuted(x, y));
+        Asserts.assertEQ(((x << 7) + (a ^ b)) >>> 7, testIComputedY(x, a, b));
+    }
+
+    @DontCompile
+    public void assertResultL(long x, long y, long a, long b) {
+        Asserts.assertEQ(((x << 9) + y) >>> 9, testL(x, y));
+        Asserts.assertEQ((y + (x << 11)) >>> 11, testLCommuted(x, y));
+        Asserts.assertEQ(((x << 13) + (a ^ b)) >>> 13, testLComputedY(x, a, b));
+    }
+
+    @Test
+    // ((x << 3) + y) >>> 3  =>  (x + (y >>> 3)) & mask
+    @IR(counts = {IRNode.LSHIFT_I,  "0",
+                  IRNode.URSHIFT_I, "1",
+                  IRNode.AND_I,     "1"})
+    static int testI(int x, int y) {
+        return ((x << 3) + y) >>> 3;
+    }
+
+    @Test
+    // (y + (x << 5)) >>> 5  =>  (x + (y >>> 5)) & mask  (commuted Add)
+    @IR(counts = {IRNode.LSHIFT_I,  "0",
+                  IRNode.URSHIFT_I, "1",
+                  IRNode.AND_I,     "1"})
+    static int testICommuted(int x, int y) {
+        return (y + (x << 5)) >>> 5;
+    }
+
+    @Test
+    // ((x << 7) + (a ^ b)) >>> 7  =>  (x + ((a ^ b) >>> 7)) & mask
+    // Computed y (a ^ b) has higher _idx than LShift, so LShift stays in Add's in(1).
+    @IR(counts = {IRNode.LSHIFT_I,  "0",
+                  IRNode.URSHIFT_I, "1",
+                  IRNode.AND_I,     "1"})
+    static int testIComputedY(int x, int a, int b) {
+        return ((x << 7) + (a ^ b)) >>> 7;
+    }
+
+    @Test
+    // ((x << 9) + y) >>> 9  =>  (x + (y >>> 9)) & mask
+    @IR(counts = {IRNode.LSHIFT_L,  "0",
+                  IRNode.URSHIFT_L, "1",
+                  IRNode.AND_L,     "1"})
+    static long testL(long x, long y) {
+        return ((x << 9) + y) >>> 9;
+    }
+
+    @Test
+    // (y + (x << 11)) >>> 11  =>  (x + (y >>> 11)) & mask  (commuted Add)
+    @IR(counts = {IRNode.LSHIFT_L,  "0",
+                  IRNode.URSHIFT_L, "1",
+                  IRNode.AND_L,     "1"})
+    static long testLCommuted(long x, long y) {
+        return (y + (x << 11)) >>> 11;
+    }
+
+    @Test
+    // ((x << 13) + (a ^ b)) >>> 13  =>  (x + ((a ^ b) >>> 13)) & mask
+    // Computed y (a ^ b) has higher _idx than LShift, so LShift stays in Add's in(1).
+    @IR(counts = {IRNode.LSHIFT_L,  "0",
+                  IRNode.URSHIFT_L, "1",
+                  IRNode.AND_L,     "1"})
+    static long testLComputedY(long x, long a, long b) {
+        return ((x << 13) + (a ^ b)) >>> 13;
+    }
+}

From 97b78f04230452b675a31d8e37f300a2d31e62ed Mon Sep 17 00:00:00 2001
From: Eric Fang <erfang@openjdk.org>
Date: Thu, 5 Mar 2026 11:12:08 +0000
Subject: [PATCH 051/655] 8374349: [VectorAPI]: AArch64: Prefer merging mode
 SVE CPY instruction

Reviewed-by: aph
---
 src/hotspot/cpu/aarch64/assembler_aarch64.hpp |  8 +++----
 .../cpu/aarch64/c2_MacroAssembler_aarch64.cpp | 21 +++++++++++++++++++
 .../cpu/aarch64/c2_MacroAssembler_aarch64.hpp |  5 +++++
 .../cpu/aarch64/vm_version_aarch64.hpp        |  5 +++++
 4 files changed, 35 insertions(+), 4 deletions(-)

diff --git a/src/hotspot/cpu/aarch64/assembler_aarch64.hpp b/src/hotspot/cpu/aarch64/assembler_aarch64.hpp
index 19b3bb1a65b..67cf77989d2 100644
--- a/src/hotspot/cpu/aarch64/assembler_aarch64.hpp
+++ b/src/hotspot/cpu/aarch64/assembler_aarch64.hpp
@@ -3814,8 +3814,8 @@ public:
   }
 
 private:
-  void sve_cpy(FloatRegister Zd, SIMD_RegVariant T, PRegister Pg, int imm8,
-               bool isMerge, bool isFloat) {
+  void _sve_cpy(FloatRegister Zd, SIMD_RegVariant T, PRegister Pg, int imm8,
+                bool isMerge, bool isFloat) {
     starti;
     assert(T != Q, "invalid size");
     int sh = 0;
@@ -3839,11 +3839,11 @@ private:
 public:
   // SVE copy signed integer immediate to vector elements (predicated)
   void sve_cpy(FloatRegister Zd, SIMD_RegVariant T, PRegister Pg, int imm8, bool isMerge) {
-    sve_cpy(Zd, T, Pg, imm8, isMerge, /*isFloat*/false);
+    _sve_cpy(Zd, T, Pg, imm8, isMerge, /*isFloat*/false);
   }
   // SVE copy floating-point immediate to vector elements (predicated)
   void sve_cpy(FloatRegister Zd, SIMD_RegVariant T, PRegister Pg, double d) {
-    sve_cpy(Zd, T, Pg, checked_cast<uint8_t>(pack(d)), /*isMerge*/true, /*isFloat*/true);
+    _sve_cpy(Zd, T, Pg, checked_cast<uint8_t>(pack(d)), /*isMerge*/true, /*isFloat*/true);
   }
 
   // SVE conditionally select elements from two vectors
diff --git a/src/hotspot/cpu/aarch64/c2_MacroAssembler_aarch64.cpp b/src/hotspot/cpu/aarch64/c2_MacroAssembler_aarch64.cpp
index dc0b9eb9546..7aab7d389e1 100644
--- a/src/hotspot/cpu/aarch64/c2_MacroAssembler_aarch64.cpp
+++ b/src/hotspot/cpu/aarch64/c2_MacroAssembler_aarch64.cpp
@@ -2875,3 +2875,24 @@ void C2_MacroAssembler::vector_expand_sve(FloatRegister dst, FloatRegister src,
   // dst  = 00 87 00 65 00 43 00 21
   sve_tbl(dst, size, src, dst);
 }
+
+// Optimized SVE cpy (imm, zeroing) instruction.
+//
+// `movi; cpy(imm, merging)` and `cpy(imm, zeroing)` have the same
+// functionality, but test results show that `movi; cpy(imm, merging)` has
+// higher throughput on some microarchitectures. This would depend on
+// microarchitecture and so may vary between implementations.
+void C2_MacroAssembler::sve_cpy(FloatRegister dst, SIMD_RegVariant T,
+                                PRegister pg, int imm8, bool isMerge) {
+  if (VM_Version::prefer_sve_merging_mode_cpy() && !isMerge) {
+    // Generates a NEON instruction `movi V<dst>.2d, #0`.
+    // On AArch64, Z and V registers alias in the low 128 bits, so V<dst> is
+    // the low 128 bits of Z<dst>. A write to V<dst> also clears all bits of
+    // Z<dst> above 128, so this `movi` instruction effectively zeroes the
+    // entire Z<dst> register. According to the Arm Software Optimization
+    // Guide, `movi` is zero latency.
+    movi(dst, T2D, 0);
+    isMerge = true;
+  }
+  Assembler::sve_cpy(dst, T, pg, imm8, isMerge);
+}
diff --git a/src/hotspot/cpu/aarch64/c2_MacroAssembler_aarch64.hpp b/src/hotspot/cpu/aarch64/c2_MacroAssembler_aarch64.hpp
index 4f3a41da402..5c05832afbe 100644
--- a/src/hotspot/cpu/aarch64/c2_MacroAssembler_aarch64.hpp
+++ b/src/hotspot/cpu/aarch64/c2_MacroAssembler_aarch64.hpp
@@ -75,6 +75,8 @@
                                    unsigned vector_length_in_bytes);
 
  public:
+  using Assembler::sve_cpy;
+
   // jdk.internal.util.ArraysSupport.vectorizedHashCode
   address arrays_hashcode(Register ary, Register cnt, Register result, FloatRegister vdata0,
                           FloatRegister vdata1, FloatRegister vdata2, FloatRegister vdata3,
@@ -244,4 +246,7 @@
   void vector_expand_sve(FloatRegister dst, FloatRegister src, PRegister pg,
                          FloatRegister tmp1, FloatRegister tmp2, BasicType bt,
                          int vector_length_in_bytes);
+
+  void sve_cpy(FloatRegister dst, SIMD_RegVariant T, PRegister pg, int imm8,
+               bool isMerge);
 #endif // CPU_AARCH64_C2_MACROASSEMBLER_AARCH64_HPP
diff --git a/src/hotspot/cpu/aarch64/vm_version_aarch64.hpp b/src/hotspot/cpu/aarch64/vm_version_aarch64.hpp
index 0213872852b..e8681611234 100644
--- a/src/hotspot/cpu/aarch64/vm_version_aarch64.hpp
+++ b/src/hotspot/cpu/aarch64/vm_version_aarch64.hpp
@@ -55,6 +55,9 @@ protected:
   static int _max_supported_sve_vector_length;
   static bool _rop_protection;
   static uintptr_t _pac_mask;
+  // When _prefer_sve_merging_mode_cpy is true, `cpy (imm, zeroing)` is
+  // implemented as `movi; cpy(imm, merging)`.
+  static constexpr bool _prefer_sve_merging_mode_cpy = true;
 
   static SpinWait _spin_wait;
 
@@ -242,6 +245,8 @@ public:
 
   static bool use_rop_protection() { return _rop_protection; }
 
+  static bool prefer_sve_merging_mode_cpy() { return _prefer_sve_merging_mode_cpy; }
+
   // For common 64/128-bit unpredicated vector operations, we may prefer
   // emitting NEON instructions rather than the corresponding SVE instructions.
   static bool use_neon_for_vector(int vector_length_in_bytes) {

From fc77e3e9a2bedd3cefc98ca28516eb85ceefe2e5 Mon Sep 17 00:00:00 2001
From: Daniel Fuchs <dfuchs@openjdk.org>
Date: Thu, 5 Mar 2026 11:12:33 +0000
Subject: [PATCH 052/655] 8378599: Refactor tests under
 test/jdk/java/net/httpclient/whitebox from TestNG to JUnit

Reviewed-by: vyazici, syan
---
 .../httpclient/whitebox/AltSvcFrameTest.java  |  36 +++---
 .../whitebox/AltSvcRegistryTest.java          |  21 +--
 .../AuthenticationFilterTestDriver.java       |   4 +-
 .../whitebox/DefaultProxyDriver.java          |   4 +-
 .../httpclient/whitebox/DemandTestDriver.java |   4 +-
 .../httpclient/whitebox/FlowTestDriver.java   |   4 +-
 .../whitebox/FramesDecoderTestDriver.java     |   4 +-
 .../whitebox/Http1HeaderParserTestDriver.java |   4 +-
 .../whitebox/MinimalFutureTestDriver.java     |   4 +-
 .../whitebox/RawChannelTestDriver.java        |   6 +-
 .../whitebox/SSLEchoTubeTestDriver.java       |   4 +-
 .../whitebox/SSLFlowDelegateTestDriver.java   |   4 +-
 .../whitebox/SSLTubeTestDriver.java           |   4 +-
 .../whitebox/SelectorTestDriver.java          |   4 +-
 .../whitebox/WindowControllerTestDriver.java  |   4 +-
 .../whitebox/WrapperTestDriver.java           |   4 +-
 .../net/http/AbstractSSLTubeTest.java         |   6 +-
 .../net/http/AuthenticationFilterTest.java    |  61 ++++-----
 .../jdk/internal/net/http/DefaultProxy.java   |  33 ++---
 .../jdk/internal/net/http/FlowTest.java       |  16 +--
 .../net/http/Http1HeaderParserTest.java       |  47 +++----
 .../jdk/internal/net/http/RawChannelTest.java |  11 +-
 .../internal/net/http/SSLEchoTubeTest.java    |   6 +-
 .../net/http/SSLFlowDelegateTest.java         |  75 +++++------
 .../jdk/internal/net/http/SSLTubeTest.java    |  14 +-
 .../jdk/internal/net/http/SelectorTest.java   |   6 +-
 .../net/http/WindowControllerTest.java        | 121 +++++++++---------
 .../jdk/internal/net/http/WrapperTest.java    |   7 +-
 .../internal/net/http/common/DemandTest.java  |  63 +++++----
 .../net/http/common/MinimalFutureTest.java    |  15 +--
 .../net/http/frame/FramesDecoderTest.java     |  32 ++---
 31 files changed, 324 insertions(+), 304 deletions(-)

diff --git a/test/jdk/java/net/httpclient/whitebox/AltSvcFrameTest.java b/test/jdk/java/net/httpclient/whitebox/AltSvcFrameTest.java
index 589e5409044..b9e5f2d58fe 100644
--- a/test/jdk/java/net/httpclient/whitebox/AltSvcFrameTest.java
+++ b/test/jdk/java/net/httpclient/whitebox/AltSvcFrameTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2020, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -48,17 +48,19 @@ import jdk.internal.net.http.HttpClientAccess;
 import jdk.internal.net.http.common.HttpHeadersBuilder;
 import jdk.internal.net.http.frame.AltSvcFrame;
 import jdk.test.lib.net.SimpleSSLContext;
-import org.testng.annotations.BeforeTest;
-import org.testng.annotations.Test;
 import static java.net.http.HttpResponse.BodyHandlers.ofString;
 import static jdk.internal.net.http.AltServicesRegistry.AltService;
-import static org.testng.Assert.assertEquals;
-import static org.testng.Assert.assertFalse;
-import static org.testng.Assert.assertTrue;
+
+import org.junit.jupiter.api.AfterAll;
+import org.junit.jupiter.api.BeforeAll;
+import org.junit.jupiter.api.Test;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertFalse;
+import static org.junit.jupiter.api.Assertions.assertTrue;
 
 /*
  * @test
- * @summary This test verifies alt-svc registry updation for frames
+ * @summary This test verifies alt-svc registry updating for frames
  * @library /test/lib /test/jdk/java/net/httpclient/lib
  * @build java.net.http/jdk.internal.net.http.HttpClientAccess
  *        jdk.httpclient.test.lib.http2.Http2TestServer
@@ -82,7 +84,7 @@ import static org.testng.Assert.assertTrue;
  *          java.base/sun.net.www.http
  *          java.base/sun.net.www
  *          java.base/sun.net
- * @run testng/othervm
+ * @run junit/othervm
  *                    -Dtest.requiresHost=true
  *                   -Djdk.httpclient.HttpClient.log=headers
  *                   -Djdk.internal.httpclient.disableHostnameVerification
@@ -90,7 +92,6 @@ import static org.testng.Assert.assertTrue;
  *                    AltSvcFrameTest
  */
 
-
 public class AltSvcFrameTest {
 
     private static final String IGNORED_HOST = "www.should-be-ignored.com";
@@ -109,18 +110,23 @@ public class AltSvcFrameTest {
     static HttpClient client;
     private static final SSLContext server = SimpleSSLContext.findSSLContext();
 
-    @BeforeTest
-    public void setUp() throws Exception {
+    @BeforeAll
+    public static void setUp() throws Exception {
         getRegistry();
         https2Server = new Http2TestServer("localhost", true, server);
         https2Server.addHandler(new AltSvcFrameTestHandler(), "/");
         https2Server.setExchangeSupplier(AltSvcFrameTest.CFTHttp2TestExchange::new);
         https2Server.start();
         https2URI = "https://" + https2Server.serverAuthority() + "/";
-
-
     }
 
+    @AfterAll
+    public static void tearDown() {
+        if (client != null) client.close();
+        if (https2Server != null) https2Server.stop();
+    }
+
+
     static AltServicesRegistry getRegistry() {
         client = HttpClient.newBuilder()
                 .sslContext(server)
@@ -139,7 +145,7 @@ public class AltSvcFrameTest {
                 .GET()
                 .build();
         HttpResponse<String> response = client.send(request, ofString());
-        assertEquals(response.statusCode(), 200, "unexpected response code");
+        assertEquals(200, response.statusCode(), "unexpected response code");
         final List<AltService> services = registry.lookup(URI.create(https2URI), "h3").toList();
         System.out.println("Alt services in registry for  " + https2URI + " = " + services);
         final boolean hasExpectedAltSvc = services.stream().anyMatch(
@@ -158,7 +164,7 @@ public class AltSvcFrameTest {
                 .GET()
                 .build();
         HttpResponse<String> response = client.send(request, ofString());
-        assertEquals(response.statusCode(), 200, "unexpected response code");
+        assertEquals(200, response.statusCode(), "unexpected response code");
         final List<AltService> services = registry.lookup(
                 URI.create(FOO_BAR_ORIGIN), "h3").toList();
         System.out.println("Alt services in registry for  " + FOO_BAR_ORIGIN + " = " + services);
diff --git a/test/jdk/java/net/httpclient/whitebox/AltSvcRegistryTest.java b/test/jdk/java/net/httpclient/whitebox/AltSvcRegistryTest.java
index b853f715415..682082ba9f8 100644
--- a/test/jdk/java/net/httpclient/whitebox/AltSvcRegistryTest.java
+++ b/test/jdk/java/net/httpclient/whitebox/AltSvcRegistryTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2020, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -26,8 +26,6 @@ import jdk.internal.net.http.AltServicesRegistry;
 import jdk.test.lib.net.SimpleSSLContext;
 import jdk.httpclient.test.lib.common.HttpServerAdapters;
 import jdk.httpclient.test.lib.http2.Http2TestServer;
-import org.testng.annotations.BeforeTest;
-import org.testng.annotations.Test;
 
 import javax.net.ssl.SSLContext;
 import java.io.IOException;
@@ -46,6 +44,10 @@ import java.util.concurrent.Executors;
 import static jdk.internal.net.http.AltServicesRegistry.AltService;
 import static java.net.http.HttpResponse.BodyHandlers.ofString;
 
+import org.junit.jupiter.api.BeforeAll;
+import org.junit.jupiter.api.AfterAll;
+import org.junit.jupiter.api.Test;
+
 /*
  * @test
  * @summary This test verifies alt-svc registry updates
@@ -73,7 +75,7 @@ import static java.net.http.HttpResponse.BodyHandlers.ofString;
  *          java.base/sun.net.www
  *          java.base/sun.net
  *          java.base/jdk.internal.util
- * @run testng/othervm
+ * @run junit/othervm
  *                    -Dtest.requiresHost=true
  *                   -Djdk.httpclient.HttpClient.log=headers
  *                   -Djdk.internal.httpclient.disableHostnameVerification
@@ -81,7 +83,6 @@ import static java.net.http.HttpResponse.BodyHandlers.ofString;
  *                    AltSvcRegistryTest
  */
 
-
 public class AltSvcRegistryTest implements HttpServerAdapters {
 
     static HttpTestServer https2Server;
@@ -89,8 +90,8 @@ public class AltSvcRegistryTest implements HttpServerAdapters {
     static HttpClient client;
     private static final SSLContext server = SimpleSSLContext.findSSLContext();
 
-    @BeforeTest
-    public void setUp() throws Exception {
+    @BeforeAll
+    public static void setUp() throws Exception {
         getRegistry();
         final ExecutorService executor = Executors.newCachedThreadPool();
         https2Server = HttpServerAdapters.HttpTestServer.of(
@@ -98,8 +99,12 @@ public class AltSvcRegistryTest implements HttpServerAdapters {
         https2Server.addHandler(new AltSvcRegistryTestHandler("https", https2Server), "/");
         https2Server.start();
         https2URI = "https://" + https2Server.serverAuthority() + "/";
+    }
 
-
+    @AfterAll
+    public static void tearDown() {
+        if (client != null) client.close();
+        if (https2Server != null) https2Server.stop();
     }
 
     static AltServicesRegistry getRegistry() {
diff --git a/test/jdk/java/net/httpclient/whitebox/AuthenticationFilterTestDriver.java b/test/jdk/java/net/httpclient/whitebox/AuthenticationFilterTestDriver.java
index e932455e409..5808c380593 100644
--- a/test/jdk/java/net/httpclient/whitebox/AuthenticationFilterTestDriver.java
+++ b/test/jdk/java/net/httpclient/whitebox/AuthenticationFilterTestDriver.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -24,5 +24,5 @@
 /*
  * @test
  * @modules java.net.http/jdk.internal.net.http
- * @run testng java.net.http/jdk.internal.net.http.AuthenticationFilterTest
+ * @run junit java.net.http/jdk.internal.net.http.AuthenticationFilterTest
  */
diff --git a/test/jdk/java/net/httpclient/whitebox/DefaultProxyDriver.java b/test/jdk/java/net/httpclient/whitebox/DefaultProxyDriver.java
index 5c18fd84a0f..54127855386 100644
--- a/test/jdk/java/net/httpclient/whitebox/DefaultProxyDriver.java
+++ b/test/jdk/java/net/httpclient/whitebox/DefaultProxyDriver.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -27,7 +27,7 @@
  * @summary Verifies that the HTTP Client, by default, uses the system-wide
  * proxy selector, and that that selector supports the standard HTTP proxy
  * system properties.
- * @run testng/othervm
+ * @run junit/othervm
  *     -Dhttp.proxyHost=foo.proxy.com
  *     -Dhttp.proxyPort=9876
  *     -Dhttp.nonProxyHosts=*.direct.com
diff --git a/test/jdk/java/net/httpclient/whitebox/DemandTestDriver.java b/test/jdk/java/net/httpclient/whitebox/DemandTestDriver.java
index ea442878261..c8b793a289c 100644
--- a/test/jdk/java/net/httpclient/whitebox/DemandTestDriver.java
+++ b/test/jdk/java/net/httpclient/whitebox/DemandTestDriver.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2017, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2017, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -24,5 +24,5 @@
 /*
  * @test
  * @modules java.net.http/jdk.internal.net.http.common
- * @run testng java.net.http/jdk.internal.net.http.common.DemandTest
+ * @run junit java.net.http/jdk.internal.net.http.common.DemandTest
  */
diff --git a/test/jdk/java/net/httpclient/whitebox/FlowTestDriver.java b/test/jdk/java/net/httpclient/whitebox/FlowTestDriver.java
index c24a733db3b..4468b5d6eb6 100644
--- a/test/jdk/java/net/httpclient/whitebox/FlowTestDriver.java
+++ b/test/jdk/java/net/httpclient/whitebox/FlowTestDriver.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2016, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2016, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,5 +25,5 @@
  * @test
  * @compile/module=java.net.http ../../../../../../lib/jdk/test/lib/net/SimpleSSLContext.java
  * @modules java.net.http/jdk.internal.net.http
- * @run testng/timeout=480 java.net.http/jdk.internal.net.http.FlowTest
+ * @run junit/timeout=480 java.net.http/jdk.internal.net.http.FlowTest
  */
diff --git a/test/jdk/java/net/httpclient/whitebox/FramesDecoderTestDriver.java b/test/jdk/java/net/httpclient/whitebox/FramesDecoderTestDriver.java
index 9b3c8878669..7edc555d8a6 100644
--- a/test/jdk/java/net/httpclient/whitebox/FramesDecoderTestDriver.java
+++ b/test/jdk/java/net/httpclient/whitebox/FramesDecoderTestDriver.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,7 +25,7 @@
  * @test
  * @bug 8195823
  * @modules java.net.http/jdk.internal.net.http.frame
- * @run testng/othervm
+ * @run junit/othervm
  *       -Djdk.internal.httpclient.debug=true
  *       java.net.http/jdk.internal.net.http.frame.FramesDecoderTest
  */
diff --git a/test/jdk/java/net/httpclient/whitebox/Http1HeaderParserTestDriver.java b/test/jdk/java/net/httpclient/whitebox/Http1HeaderParserTestDriver.java
index b18142601a5..f3b9d410b51 100644
--- a/test/jdk/java/net/httpclient/whitebox/Http1HeaderParserTestDriver.java
+++ b/test/jdk/java/net/httpclient/whitebox/Http1HeaderParserTestDriver.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2017, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2017, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,5 +25,5 @@
  * @test
  * @bug 8195138
  * @modules java.net.http/jdk.internal.net.http
- * @run testng java.net.http/jdk.internal.net.http.Http1HeaderParserTest
+ * @run junit java.net.http/jdk.internal.net.http.Http1HeaderParserTest
  */
diff --git a/test/jdk/java/net/httpclient/whitebox/MinimalFutureTestDriver.java b/test/jdk/java/net/httpclient/whitebox/MinimalFutureTestDriver.java
index 316ca29e2a6..90fe6816adc 100644
--- a/test/jdk/java/net/httpclient/whitebox/MinimalFutureTestDriver.java
+++ b/test/jdk/java/net/httpclient/whitebox/MinimalFutureTestDriver.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -24,5 +24,5 @@
 /*
  * @test
  * @modules java.net.http/jdk.internal.net.http.common
- * @run testng java.net.http/jdk.internal.net.http.common.MinimalFutureTest
+ * @run junit java.net.http/jdk.internal.net.http.common.MinimalFutureTest
  */
diff --git a/test/jdk/java/net/httpclient/whitebox/RawChannelTestDriver.java b/test/jdk/java/net/httpclient/whitebox/RawChannelTestDriver.java
index ab44fba5ecd..7ca448b7892 100644
--- a/test/jdk/java/net/httpclient/whitebox/RawChannelTestDriver.java
+++ b/test/jdk/java/net/httpclient/whitebox/RawChannelTestDriver.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2016, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2016, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,10 +25,10 @@
  * @test
  * @bug 8151299 8164704
  * @modules java.net.http/jdk.internal.net.http
- * @run testng/othervm java.net.http/jdk.internal.net.http.RawChannelTest
+ * @run junit/othervm java.net.http/jdk.internal.net.http.RawChannelTest
  */
 // use
-//     @run testng/othervm -Dseed=6434511950803022575
+//     @run junit/othervm -Dseed=6434511950803022575
 //          java.net.http/jdk.internal.net.http.RawChannelTest
 // to reproduce a failure with a particular seed (e.g. 6434511950803022575)
 // if this test is observed failing with that seed
diff --git a/test/jdk/java/net/httpclient/whitebox/SSLEchoTubeTestDriver.java b/test/jdk/java/net/httpclient/whitebox/SSLEchoTubeTestDriver.java
index d641513b298..b4b3e59326d 100644
--- a/test/jdk/java/net/httpclient/whitebox/SSLEchoTubeTestDriver.java
+++ b/test/jdk/java/net/httpclient/whitebox/SSLEchoTubeTestDriver.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2017, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2017, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,7 +25,7 @@
  * @test
  * @compile/module=java.net.http ../../../../../../lib/jdk/test/lib/net/SimpleSSLContext.java
  * @modules java.net.http/jdk.internal.net.http
- * @run testng/othervm
+ * @run junit/othervm
  *      -Djdk.internal.httpclient.debug=true
  *      java.net.http/jdk.internal.net.http.SSLEchoTubeTest
  */
diff --git a/test/jdk/java/net/httpclient/whitebox/SSLFlowDelegateTestDriver.java b/test/jdk/java/net/httpclient/whitebox/SSLFlowDelegateTestDriver.java
index a49f53a844a..cb8e9801ca8 100644
--- a/test/jdk/java/net/httpclient/whitebox/SSLFlowDelegateTestDriver.java
+++ b/test/jdk/java/net/httpclient/whitebox/SSLFlowDelegateTestDriver.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2023, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2023, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -28,7 +28,7 @@
  *          downReader doesn't request any
  * @compile/module=java.net.http ../../../../../../lib/jdk/test/lib/net/SimpleSSLContext.java
  * @modules java.net.http/jdk.internal.net.http
- * @run testng/othervm  -Djdk.internal.httpclient.debug=true
+ * @run junit/othervm  -Djdk.internal.httpclient.debug=true
  *                      -Djavax.net.debug=ssl:handshake
  *                      java.net.http/jdk.internal.net.http.SSLFlowDelegateTest
  */
diff --git a/test/jdk/java/net/httpclient/whitebox/SSLTubeTestDriver.java b/test/jdk/java/net/httpclient/whitebox/SSLTubeTestDriver.java
index b1994777b14..2c73de26648 100644
--- a/test/jdk/java/net/httpclient/whitebox/SSLTubeTestDriver.java
+++ b/test/jdk/java/net/httpclient/whitebox/SSLTubeTestDriver.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2017, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2017, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,7 +25,7 @@
  * @test
  * @compile/module=java.net.http ../../../../../../lib/jdk/test/lib/net/SimpleSSLContext.java
  * @modules java.net.http/jdk.internal.net.http
- * @run testng/othervm
+ * @run junit/othervm
  *      -Djdk.internal.httpclient.debug=true
  *      java.net.http/jdk.internal.net.http.SSLTubeTest
  */
diff --git a/test/jdk/java/net/httpclient/whitebox/SelectorTestDriver.java b/test/jdk/java/net/httpclient/whitebox/SelectorTestDriver.java
index 226e644e903..54d66d04cff 100644
--- a/test/jdk/java/net/httpclient/whitebox/SelectorTestDriver.java
+++ b/test/jdk/java/net/httpclient/whitebox/SelectorTestDriver.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2016, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2016, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,5 +25,5 @@
  * @test
  * @bug 8151299 8164704
  * @modules java.net.http/jdk.internal.net.http
- * @run testng java.net.http/jdk.internal.net.http.SelectorTest
+ * @run junit java.net.http/jdk.internal.net.http.SelectorTest
  */
diff --git a/test/jdk/java/net/httpclient/whitebox/WindowControllerTestDriver.java b/test/jdk/java/net/httpclient/whitebox/WindowControllerTestDriver.java
index 7943bfceaa0..16ac4aaefb8 100644
--- a/test/jdk/java/net/httpclient/whitebox/WindowControllerTestDriver.java
+++ b/test/jdk/java/net/httpclient/whitebox/WindowControllerTestDriver.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -26,5 +26,5 @@
  * @bug 8207960
  * @modules java.net.http/jdk.internal.net.http
  * @summary Non-negative WINDOW_UPDATE increments may leave the stream window size negative
- * @run testng/othervm java.net.http/jdk.internal.net.http.WindowControllerTest
+ * @run junit/othervm java.net.http/jdk.internal.net.http.WindowControllerTest
  */
diff --git a/test/jdk/java/net/httpclient/whitebox/WrapperTestDriver.java b/test/jdk/java/net/httpclient/whitebox/WrapperTestDriver.java
index 7ea2b07e3a7..dfc808ff68b 100644
--- a/test/jdk/java/net/httpclient/whitebox/WrapperTestDriver.java
+++ b/test/jdk/java/net/httpclient/whitebox/WrapperTestDriver.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2016, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2016, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -24,5 +24,5 @@
 /*
  * @test
  * @modules java.net.http/jdk.internal.net.http
- * @run testng java.net.http/jdk.internal.net.http.WrapperTest
+ * @run junit java.net.http/jdk.internal.net.http.WrapperTest
  */
diff --git a/test/jdk/java/net/httpclient/whitebox/java.net.http/jdk/internal/net/http/AbstractSSLTubeTest.java b/test/jdk/java/net/httpclient/whitebox/java.net.http/jdk/internal/net/http/AbstractSSLTubeTest.java
index 944f8ae0872..699b537c980 100644
--- a/test/jdk/java/net/httpclient/whitebox/java.net.http/jdk/internal/net/http/AbstractSSLTubeTest.java
+++ b/test/jdk/java/net/httpclient/whitebox/java.net.http/jdk/internal/net/http/AbstractSSLTubeTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2017, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2017, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -26,17 +26,13 @@ package jdk.internal.net.http;
 import jdk.internal.net.http.common.FlowTube;
 import jdk.internal.net.http.common.SSLTube;
 import jdk.internal.net.http.common.Utils;
-import org.testng.annotations.Test;
 
 import javax.net.ssl.SSLContext;
 import javax.net.ssl.SSLEngine;
 import javax.net.ssl.SSLParameters;
-import java.io.FileInputStream;
 import java.io.IOException;
-import java.io.InputStream;
 import java.nio.ByteBuffer;
 import java.util.List;
-import java.util.StringTokenizer;
 import java.util.concurrent.CompletableFuture;
 import java.util.concurrent.CountDownLatch;
 import java.util.concurrent.ExecutorService;
diff --git a/test/jdk/java/net/httpclient/whitebox/java.net.http/jdk/internal/net/http/AuthenticationFilterTest.java b/test/jdk/java/net/httpclient/whitebox/java.net.http/jdk/internal/net/http/AuthenticationFilterTest.java
index 415caeb1196..2e9672e4725 100644
--- a/test/jdk/java/net/httpclient/whitebox/java.net.http/jdk/internal/net/http/AuthenticationFilterTest.java
+++ b/test/jdk/java/net/httpclient/whitebox/java.net.http/jdk/internal/net/http/AuthenticationFilterTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -24,9 +24,6 @@
 package jdk.internal.net.http;
 
 import jdk.internal.net.http.common.HttpHeadersBuilder;
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
-import org.testng.annotations.AfterClass;
 
 import java.lang.ref.Reference;
 import java.net.Authenticator;
@@ -55,12 +52,15 @@ import static java.util.stream.Collectors.joining;
 import static java.net.http.HttpClient.Version.HTTP_1_1;
 import static java.net.http.HttpClient.Version.HTTP_2;
 import static java.net.http.HttpClient.Builder.NO_PROXY;
-import static org.testng.Assert.*;
+
+import org.junit.jupiter.api.AfterAll;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
+import static org.junit.jupiter.api.Assertions.*;
 
 public class AuthenticationFilterTest {
 
-    @DataProvider(name = "uris")
-    public Object[][] responses() {
+    public static Object[][] responses() {
         return new Object[][] {
                 { "http://foo.com", HTTP_1_1, null },
                 { "http://foo.com", HTTP_2, null },
@@ -135,7 +135,8 @@ public class AuthenticationFilterTest {
         return s == null || s.isEmpty();
     }
 
-    @Test(dataProvider = "uris")
+    @ParameterizedTest
+    @MethodSource("responses")
     public void testAuthentication(String uri, Version v, String proxy) throws Exception {
         String test = format("testAuthentication: {\"%s\", %s, \"%s\"}", uri, v, proxy);
         try {
@@ -146,8 +147,8 @@ public class AuthenticationFilterTest {
         }
     }
 
-    @AfterClass
-    public void printDiagnostic() {
+    @AfterAll
+    public static void printDiagnostic() {
         if (FAILED.isEmpty()) {
             out.println("All tests passed");
             return;
@@ -183,7 +184,7 @@ public class AuthenticationFilterTest {
         HttpClientImpl client = facade.impl;
         AuthenticationFilter filter = new AuthenticationFilter();
 
-        assertEquals(authenticator.COUNTER.get(), 0);
+        assertEquals(0, authenticator.COUNTER.get());
 
         // Creates the first HttpRequestImpl, and call filter.request() with
         // it. The expectation is that the filter will not add any credentials,
@@ -202,7 +203,7 @@ public class AuthenticationFilterTest {
         HttpHeaders hdrs = req.getSystemHeadersBuilder().build();
         assertFalse(hdrs.firstValue(authorization(true)).isPresent());
         assertFalse(hdrs.firstValue(authorization(false)).isPresent());
-        assertEquals(authenticator.COUNTER.get(), 0);
+        assertEquals(0, authenticator.COUNTER.get());
 
         // Creates the Response to the first request, and call filter.response
         // with it. That response has a 401 or 407 status code.
@@ -221,9 +222,9 @@ public class AuthenticationFilterTest {
 
         out.println("Checking filter's response to "
                 + unauthorized + " from " + uri);
-        assertTrue(next != null, "next should not be null");
+        assertNotNull(next, "next should not be null");
         String[] up = check(reqURI, next.getSystemHeadersBuilder().build(), proxy);
-        assertEquals(authenticator.COUNTER.get(), 1);
+        assertEquals(1, authenticator.COUNTER.get());
 
         // Now simulate a new successful exchange to get the credentials in the cache
         // We first call filter.request with the request that was previously
@@ -241,8 +242,8 @@ public class AuthenticationFilterTest {
         HttpHeaders h = HttpHeaders.of(Collections.emptyMap(), ACCEPT_ALL);
         response = new Response(next, exchange,h, null, 200, v);
         next = filter.response(response);
-        assertTrue(next == null, "next should be null");
-        assertEquals(authenticator.COUNTER.get(), 1);
+        assertNull(next, "next should be null");
+        assertEquals(1, authenticator.COUNTER.get());
 
         // Now verify that the cache is used for the next request to the same server.
         // We're going to create a request to the same server by appending "/bar" to
@@ -270,7 +271,7 @@ public class AuthenticationFilterTest {
                 + " with proxy " + req2.proxy());
         String[] up2 = check(reqURI, req2.getSystemHeadersBuilder().build(), proxy);
         assertTrue(Arrays.deepEquals(up, up2), format("%s:%s != %s:%s", up2[0], up2[1], up[0], up[1]));
-        assertEquals(authenticator.COUNTER.get(), 1);
+        assertEquals(1, authenticator.COUNTER.get());
 
         // Now verify that the cache is not used if we send a request to a different server.
         // We're going to append ".bar" to the original request host name, and feed that
@@ -316,7 +317,7 @@ public class AuthenticationFilterTest {
                 java.util.stream.Stream.of(getAuthorization(h3, false))
                         .collect(joining(":")));
         assertFalse(h3.firstValue(authorization(false)).isPresent());
-        assertEquals(authenticator.COUNTER.get(), 1);
+        assertEquals(1, authenticator.COUNTER.get());
 
         // Now we will verify that credentials for proxies are not used for servers and
         // conversely.
@@ -365,7 +366,7 @@ public class AuthenticationFilterTest {
             String[] up4 = check(reqURI, h4, proxy);
             assertTrue(Arrays.deepEquals(up, up4),  format("%s:%s != %s:%s", up4[0], up4[1], up[0], up[1]));
         }
-        assertEquals(authenticator.COUNTER.get(), 1);
+        assertEquals(1, authenticator.COUNTER.get());
 
         if (proxy != null) {
             // Now if we were using a proxy, we're going to send the same request than
@@ -380,7 +381,7 @@ public class AuthenticationFilterTest {
             MultiExchange<?> multi5 = new MultiExchange<Void>(origReq5, req5, client,
                     HttpResponse.BodyHandlers.replacing(null), null);
             out.println("Simulating new request to " + reqURI + " with a proxy " + req5.proxy());
-            assertTrue(req5.proxy() == null, "req5.proxy() should be null");
+            assertNull(req5.proxy(), "req5.proxy() should be null");
             Exchange<?> exchange5 = new Exchange<>(req5, multi5);
             filter.request(req5, multi5);
             out.println("Check that filter has not added server credentials from cache for "
@@ -398,7 +399,7 @@ public class AuthenticationFilterTest {
                     java.util.stream.Stream.of(getAuthorization(h5, true))
                             .collect(joining(":")));
             assertFalse(h5.firstValue(authorization(true)).isPresent());
-            assertEquals(authenticator.COUNTER.get(), 1);
+            assertEquals(1, authenticator.COUNTER.get());
 
             // Now simulate a 401 response from the server
             HttpHeadersBuilder headers5Builder = new HttpHeadersBuilder();
@@ -410,11 +411,11 @@ public class AuthenticationFilterTest {
             out.println("Simulating " + unauthorized
                     + " response from " + uri);
             HttpRequestImpl next5 = filter.response(response5);
-            assertEquals(authenticator.COUNTER.get(), 2);
+            assertEquals(2, authenticator.COUNTER.get());
 
             out.println("Checking filter's response to "
                     + unauthorized + " from " + uri);
-            assertTrue(next5 != null, "next5 should not be null");
+            assertNotNull(next5, "next5 should not be null");
             String[] up5 = check(reqURI, next5.getSystemHeadersBuilder().build(), null);
 
             // now simulate a 200 response from the server
@@ -423,7 +424,7 @@ public class AuthenticationFilterTest {
             h = HttpHeaders.of(Map.of(), ACCEPT_ALL);
             response5 = new Response(next5, exchange5, h, null, 200, v);
             filter.response(response5);
-            assertEquals(authenticator.COUNTER.get(), 2);
+            assertEquals(2, authenticator.COUNTER.get());
 
             // now send the request again, with proxy this time, and it should have both
             // server auth and proxy auth
@@ -433,7 +434,7 @@ public class AuthenticationFilterTest {
             MultiExchange<?> multi6 = new MultiExchange<Void>(origReq6, req6, client,
                     HttpResponse.BodyHandlers.replacing(null), null);
             out.println("Simulating new request to " + reqURI + " with a proxy " + req6.proxy());
-            assertTrue(req6.proxy() != null, "req6.proxy() should not be null");
+            assertNotNull(req6.proxy(), "req6.proxy() should not be null");
             Exchange<?> exchange6 = new Exchange<>(req6, multi6);
             filter.request(req6, multi6);
             out.println("Check that filter has added server credentials from cache for "
@@ -444,7 +445,7 @@ public class AuthenticationFilterTest {
                     + reqURI + " (proxy: " + req6.proxy()  + ")");
             String[] up6 = check(reqURI, h6, proxy);
             assertTrue(Arrays.deepEquals(up, up6), format("%s:%s != %s:%s", up6[0], up6[1], up[0], up[1]));
-            assertEquals(authenticator.COUNTER.get(), 2);
+            assertEquals(2, authenticator.COUNTER.get());
         }
 
         if (proxy == null && uri.contains("x/y/z")) {
@@ -456,7 +457,7 @@ public class AuthenticationFilterTest {
             MultiExchange<?> multi7 = new MultiExchange<Void>(origReq7, req7, client,
                     HttpResponse.BodyHandlers.replacing(null), null);
             out.println("Simulating new request to " + reqURI7 + " with a proxy " + req7.proxy());
-            assertTrue(req7.proxy() == null, "req7.proxy() should be null");
+            assertNull(req7.proxy(), "req7.proxy() should be null");
             Exchange<?> exchange7 = new Exchange<>(req7, multi7);
             filter.request(req7, multi7);
             out.println("Check that filter has not added server credentials from cache for "
@@ -475,7 +476,7 @@ public class AuthenticationFilterTest {
                     java.util.stream.Stream.of(getAuthorization(h7, true))
                             .collect(joining(":")));
             assertFalse(h7.firstValue(authorization(true)).isPresent());
-            assertEquals(authenticator.COUNTER.get(), 1);
+            assertEquals(1, authenticator.COUNTER.get());
 
         }
 
@@ -516,7 +517,7 @@ public class AuthenticationFilterTest {
         out.println("user:password: " + u + ":" + p);
         String protocol = proxy != null ? "http" : reqURI.getScheme();
         String expectedUser = "u." + protocol;
-        assertEquals(u, expectedUser);
+        assertEquals(expectedUser, u);
         String host = proxy == null ? reqURI.getHost() :
                 proxy.substring(0, proxy.lastIndexOf(':'));
         int port = proxy == null ? reqURI.getPort()
@@ -524,7 +525,7 @@ public class AuthenticationFilterTest {
         String expectedPw = concat(requestorType(proxy!=null),
                 "basic", protocol, host,
                 port, "earth", reqURI.toURL());
-        assertEquals(p, expectedPw);
+        assertEquals(expectedPw, p);
         return new String[] {u, p};
     }
 
diff --git a/test/jdk/java/net/httpclient/whitebox/java.net.http/jdk/internal/net/http/DefaultProxy.java b/test/jdk/java/net/httpclient/whitebox/java.net.http/jdk/internal/net/http/DefaultProxy.java
index 96d08ae2c34..819b02e7fc7 100644
--- a/test/jdk/java/net/httpclient/whitebox/java.net.http/jdk/internal/net/http/DefaultProxy.java
+++ b/test/jdk/java/net/httpclient/whitebox/java.net.http/jdk/internal/net/http/DefaultProxy.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -29,8 +29,9 @@ import java.net.ProxySelector;
 import java.net.URI;
 import java.net.http.HttpClient;
 import java.util.List;
-import org.testng.annotations.Test;
-import static org.testng.Assert.assertEquals;
+
+import org.junit.jupiter.api.Test;
+import static org.junit.jupiter.api.Assertions.assertEquals;
 
 public class DefaultProxy {
 
@@ -42,7 +43,7 @@ public class DefaultProxy {
     public void testDefault() {
         ProxySelector ps = getProxySelector();
         System.out.println("HttpClientImpl proxySelector:" + ps);
-        assertEquals(ps, ProxySelector.getDefault());
+        assertEquals(ProxySelector.getDefault(), ps);
     }
 
     // From the test driver
@@ -56,21 +57,21 @@ public class DefaultProxy {
         URI uri = URI.create("http://foo.com/example.html");
         List<Proxy> plist = ps.select(uri);
         System.out.println("proxy list for " + uri + " : " + plist);
-        assertEquals(plist.size(), 1);
+        assertEquals(1, plist.size());
         Proxy proxy = plist.get(0);
-        assertEquals(proxy.type(), Proxy.Type.HTTP);
+        assertEquals(Proxy.Type.HTTP, proxy.type());
         InetSocketAddress expectedAddr =
                 InetSocketAddress.createUnresolved("foo.proxy.com", 9876);
-        assertEquals(proxy.address(), expectedAddr);
+        assertEquals(expectedAddr, proxy.address());
 
         // nonProxyHosts
         uri = URI.create("http://foo.direct.com/example.html");
         plist = ps.select(uri);
         System.out.println("proxy list for " + uri + " : " + plist);
-        assertEquals(plist.size(), 1);
+        assertEquals(1, plist.size());
         proxy = plist.get(0);
-        assertEquals(proxy.type(), Proxy.Type.DIRECT);
-        assertEquals(proxy.address(), null);
+        assertEquals(Proxy.Type.DIRECT, proxy.type());
+        assertEquals(null, proxy.address());
     }
 
     // From the test driver
@@ -83,21 +84,21 @@ public class DefaultProxy {
         URI uri = URI.create("https://foo.com/example.html");
         List<Proxy> plist = ps.select(uri);
         System.out.println("proxy list for " + uri + " : " + plist);
-        assertEquals(plist.size(), 1);
+        assertEquals(1, plist.size());
         Proxy proxy = plist.get(0);
-        assertEquals(proxy.type(), Proxy.Type.HTTP);
+        assertEquals(Proxy.Type.HTTP, proxy.type());
         InetSocketAddress expectedAddr =
                 InetSocketAddress.createUnresolved("secure.proxy.com", 5443);
-        assertEquals(proxy.address(), expectedAddr);
+        assertEquals(expectedAddr, proxy.address());
 
         // nonProxyHosts
         uri = URI.create("https://foo.direct.com/example.html");
         plist = ps.select(uri);
         System.out.println("proxy list for " + uri + " : " + plist);
-        assertEquals(plist.size(), 1);
+        assertEquals(1, plist.size());
         proxy = plist.get(0);
-        assertEquals(proxy.type(), Proxy.Type.DIRECT);
-        assertEquals(proxy.address(), null);
+        assertEquals(Proxy.Type.DIRECT, proxy.type());
+        assertEquals(null, proxy.address());
     }
 
 }
diff --git a/test/jdk/java/net/httpclient/whitebox/java.net.http/jdk/internal/net/http/FlowTest.java b/test/jdk/java/net/httpclient/whitebox/java.net.http/jdk/internal/net/http/FlowTest.java
index 3e9e967c061..cd05196b653 100644
--- a/test/jdk/java/net/httpclient/whitebox/java.net.http/jdk/internal/net/http/FlowTest.java
+++ b/test/jdk/java/net/httpclient/whitebox/java.net.http/jdk/internal/net/http/FlowTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2017, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2017, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -32,8 +32,6 @@ import java.net.InetSocketAddress;
 import java.net.Socket;
 import java.nio.ByteBuffer;
 import java.util.List;
-import java.util.Random;
-import java.util.StringTokenizer;
 import java.util.concurrent.BlockingQueue;
 import java.util.concurrent.CompletableFuture;
 import java.util.concurrent.CountDownLatch;
@@ -47,10 +45,10 @@ import java.util.concurrent.atomic.AtomicInteger;
 import java.util.concurrent.atomic.AtomicLong;
 import javax.net.ssl.*;
 import jdk.internal.net.http.common.Utils;
-import org.testng.annotations.Test;
 import jdk.internal.net.http.common.SSLFlowDelegate;
 
-@Test
+import org.junit.jupiter.api.Test;
+
 public class FlowTest extends AbstractRandomTest {
 
     private final SubmissionPublisher<List<ByteBuffer>> srcPublisher;
@@ -241,7 +239,7 @@ public class FlowTest extends AbstractRandomTest {
         private void clientReader() {
             try {
                 InputStream is = clientSock.getInputStream();
-                final int bufsize = FlowTest.randomRange(512, 16 * 1024);
+                final int bufsize = AbstractRandomTest.randomRange(512, 16 * 1024);
                 println("clientReader: bufsize = " + bufsize);
                 while (true) {
                     byte[] buf = new byte[bufsize];
@@ -315,8 +313,8 @@ public class FlowTest extends AbstractRandomTest {
         private final AtomicInteger loopCount = new AtomicInteger();
 
         public String monitor() {
-            return "serverLoopback: loopcount = " + loopCount.toString()
-                    + " clientRead: count = " + readCount.toString();
+            return "serverLoopback: loopcount = " + loopCount.get()
+                    + " clientRead: count = " + readCount.get();
         }
 
         // thread2
@@ -324,7 +322,7 @@ public class FlowTest extends AbstractRandomTest {
             try {
                 InputStream is = serverSock.getInputStream();
                 OutputStream os = serverSock.getOutputStream();
-                final int bufsize = FlowTest.randomRange(512, 16 * 1024);
+                final int bufsize = AbstractRandomTest.randomRange(512, 16 * 1024);
                 println("serverLoopback: bufsize = " + bufsize);
                 byte[] bb = new byte[bufsize];
                 while (true) {
diff --git a/test/jdk/java/net/httpclient/whitebox/java.net.http/jdk/internal/net/http/Http1HeaderParserTest.java b/test/jdk/java/net/httpclient/whitebox/java.net.http/jdk/internal/net/http/Http1HeaderParserTest.java
index 9bde9109095..a4c7b76aba8 100644
--- a/test/jdk/java/net/httpclient/whitebox/java.net.http/jdk/internal/net/http/Http1HeaderParserTest.java
+++ b/test/jdk/java/net/httpclient/whitebox/java.net.http/jdk/internal/net/http/Http1HeaderParserTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2017, 2020, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2017, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -36,22 +36,22 @@ import java.util.concurrent.atomic.AtomicBoolean;
 import java.util.concurrent.atomic.AtomicInteger;
 import java.util.stream.IntStream;
 import sun.net.www.MessageHeader;
-import org.testng.annotations.Test;
-import org.testng.annotations.DataProvider;
 import static java.lang.System.out;
 import static java.lang.String.format;
 import static java.nio.charset.StandardCharsets.ISO_8859_1;
 import static java.nio.charset.StandardCharsets.US_ASCII;
 import static java.util.stream.Collectors.toList;
-import static org.testng.Assert.*;
+
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
+import static org.junit.jupiter.api.Assertions.*;
 
 // Mostly verifies the "new" Http1HeaderParser returns the same results as the
 // tried and tested sun.net.www.MessageHeader.
 
 public class Http1HeaderParserTest {
 
-    @DataProvider(name = "responses")
-    public Object[][] responses() {
+    public static Object[][] responses() {
         List<String> responses = new ArrayList<>();
 
         String[] basic =
@@ -316,7 +316,8 @@ public class Http1HeaderParserTest {
     }
 
 
-    @Test(dataProvider = "responses")
+    @ParameterizedTest
+    @MethodSource("responses")
     public void verifyHeaders(String respString) throws Exception {
         System.out.println("\ntesting:\n\t" + respString
                 .replace("\r\n", "<CRLF>")
@@ -339,7 +340,7 @@ public class Http1HeaderParserTest {
         String statusLine1 = messageHeaderMap.get(null).get(0);
         String statusLine2 = decoder.statusLine();
         if (statusLine1.startsWith("HTTP")) {// skip the case where MH's messes up the status-line
-            assertEquals(statusLine2, statusLine1, "Status-line not equal");
+            assertEquals(statusLine1, statusLine2, "Status-line not equal");
         } else {
             assertTrue(statusLine2.startsWith("HTTP/1."), "Status-line not HTTP/1.");
         }
@@ -356,7 +357,7 @@ public class Http1HeaderParserTest {
         assertHeadersEqual(messageHeaderMap, decoderMap1,
                           "messageHeaderMap not equal to decoderMap1");
 
-        assertEquals(availableBytes, b.remaining(),
+        assertEquals(b.remaining(), availableBytes,
                 String.format("stream available (%d) not equal to remaining (%d)",
                         availableBytes, b.remaining()));
         // byte at a time
@@ -366,14 +367,13 @@ public class Http1HeaderParserTest {
                 .collect(toList());
         while (decoder.parse(buffers.remove(0)) != true);
         Map<String,List<String>> decoderMap2 = decoder.headers().map();
-        assertEquals(availableBytes, buffers.size(),
+        assertEquals(buffers.size(), availableBytes,
                      "stream available not equals to remaining buffers");
-        assertEquals(decoderMap1, decoderMap2, "decoder maps not equal");
+        assertEquals(decoderMap2, decoderMap1, "decoder maps not equal");
 
     }
 
-    @DataProvider(name = "errors")
-    public Object[][] errors() {
+    public static Object[][] errors() {
         List<String> responses = new ArrayList<>();
 
         // These responses are parsed, somewhat, by MessageHeaders but give
@@ -451,12 +451,15 @@ public class Http1HeaderParserTest {
         return responses.stream().map(p -> new Object[] { p }).toArray(Object[][]::new);
     }
 
-    @Test(dataProvider = "errors", expectedExceptions = ProtocolException.class)
+    @ParameterizedTest
+    @MethodSource("errors")
     public void errors(String respString) throws ProtocolException {
-        byte[] bytes = respString.getBytes(US_ASCII);
-        Http1HeaderParser decoder = new Http1HeaderParser();
-        ByteBuffer b = ByteBuffer.wrap(bytes);
-        decoder.parse(b);
+        assertThrows(ProtocolException.class, () -> {
+            byte[] bytes = respString.getBytes(US_ASCII);
+            Http1HeaderParser decoder = new Http1HeaderParser();
+            ByteBuffer b = ByteBuffer.wrap(bytes);
+            decoder.parse(b);
+        });
     }
 
     void assertHeadersEqual(Map<String,List<String>> expected,
@@ -466,7 +469,7 @@ public class Http1HeaderParserTest {
         if (expected.equals(actual))
             return;
 
-        assertEquals(expected.size(), actual.size(),
+        assertEquals(actual.size(), expected.size(),
                      format("%s. Expected size %d, actual size %s. %nexpected= %s,%n actual=%s.",
                             msg, expected.size(), actual.size(), mapToString(expected), mapToString(actual)));
 
@@ -479,7 +482,7 @@ public class Http1HeaderParserTest {
                 if (key.equalsIgnoreCase(other.getKey())) {
                     found = true;
                     List<String> otherValues = other.getValue();
-                    assertEquals(values.size(), otherValues.size(),
+                    assertEquals(otherValues.size(), values.size(),
                                  format("%s. Expected list size %d, actual size %s",
                                         msg, values.size(), otherValues.size()));
                     if (!(values.containsAll(otherValues) && otherValues.containsAll(values)))
@@ -508,11 +511,11 @@ public class Http1HeaderParserTest {
     public static void main(String... args) throws Exception  {
         Http1HeaderParserTest test = new Http1HeaderParserTest();
         int count = 0;
-        for (Object[] objs : test.responses()) {
+        for (Object[] objs : Http1HeaderParserTest.responses()) {
             out.println("Testing " + count++ + ", " + objs[0]);
             test.verifyHeaders((String) objs[0]);
         }
-        for (Object[] objs : test.errors()) {
+        for (Object[] objs : Http1HeaderParserTest.errors()) {
             out.println("Testing " + count++ + ", " + objs[0]);
             try {
                 test.errors((String) objs[0]);
diff --git a/test/jdk/java/net/httpclient/whitebox/java.net.http/jdk/internal/net/http/RawChannelTest.java b/test/jdk/java/net/httpclient/whitebox/java.net.http/jdk/internal/net/http/RawChannelTest.java
index f6bcdcb4d33..62ca237d2f1 100644
--- a/test/jdk/java/net/httpclient/whitebox/java.net.http/jdk/internal/net/http/RawChannelTest.java
+++ b/test/jdk/java/net/httpclient/whitebox/java.net.http/jdk/internal/net/http/RawChannelTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2017, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2017, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -47,10 +47,11 @@ import java.net.http.HttpResponse;
 import java.util.concurrent.atomic.AtomicReference;
 
 import jdk.internal.net.http.websocket.RawChannel;
-import org.testng.annotations.Test;
 import static java.net.http.HttpResponse.BodyHandlers.discarding;
 import static java.util.concurrent.TimeUnit.SECONDS;
-import static org.testng.Assert.assertEquals;
+
+import org.junit.jupiter.api.Test;
+import static org.junit.jupiter.api.Assertions.assertEquals;
 
 /*
  * This test exercises mechanics of _independent_ reads and writes on the
@@ -222,8 +223,8 @@ public class RawChannelTest {
                         closeChannel(chan);
                     });
             exit.await(); // All done, we need to compare results:
-            assertEquals(clientRead.get(), serverWritten.get());
-            assertEquals(serverRead.get(), clientWritten.get());
+            assertEquals(serverWritten.get(), clientRead.get());
+            assertEquals(clientWritten.get(), serverRead.get());
             Throwable serverError = testServer.failed.get();
             if (serverError != null) {
                 throw new AssertionError("TestServer failed: "
diff --git a/test/jdk/java/net/httpclient/whitebox/java.net.http/jdk/internal/net/http/SSLEchoTubeTest.java b/test/jdk/java/net/httpclient/whitebox/java.net.http/jdk/internal/net/http/SSLEchoTubeTest.java
index 2884b74eee5..4316a46a25c 100644
--- a/test/jdk/java/net/httpclient/whitebox/java.net.http/jdk/internal/net/http/SSLEchoTubeTest.java
+++ b/test/jdk/java/net/httpclient/whitebox/java.net.http/jdk/internal/net/http/SSLEchoTubeTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2017, 2022, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2017, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -28,7 +28,6 @@ import jdk.internal.net.http.common.FlowTube;
 import jdk.internal.net.http.common.SSLTube;
 import jdk.internal.net.http.common.SequentialScheduler;
 import jdk.internal.net.http.common.Utils;
-import org.testng.annotations.Test;
 
 import java.io.IOException;
 import java.nio.ByteBuffer;
@@ -44,7 +43,8 @@ import java.util.concurrent.atomic.AtomicBoolean;
 import java.util.concurrent.atomic.AtomicReference;
 import java.util.function.Consumer;
 
-@Test
+import org.junit.jupiter.api.Test;
+
 public class SSLEchoTubeTest extends AbstractSSLTubeTest {
 
     @Test
diff --git a/test/jdk/java/net/httpclient/whitebox/java.net.http/jdk/internal/net/http/SSLFlowDelegateTest.java b/test/jdk/java/net/httpclient/whitebox/java.net.http/jdk/internal/net/http/SSLFlowDelegateTest.java
index 6b031bdfa58..32511de173b 100644
--- a/test/jdk/java/net/httpclient/whitebox/java.net.http/jdk/internal/net/http/SSLFlowDelegateTest.java
+++ b/test/jdk/java/net/httpclient/whitebox/java.net.http/jdk/internal/net/http/SSLFlowDelegateTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2023, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2023, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -58,10 +58,11 @@ import jdk.internal.net.http.common.Logger;
 import jdk.internal.net.http.common.SSLFlowDelegate;
 import jdk.internal.net.http.common.SubscriberWrapper;
 import jdk.internal.net.http.common.Utils;
-import org.testng.Assert;
-import org.testng.annotations.AfterTest;
-import org.testng.annotations.BeforeTest;
-import org.testng.annotations.Test;
+
+import org.junit.jupiter.api.AfterAll;
+import org.junit.jupiter.api.BeforeAll;
+import org.junit.jupiter.api.Test;
+import static org.junit.jupiter.api.Assertions.*;
 
 // jtreg test definition for this test resides in SSLFlowDelegateTestDriver.java
 public class SSLFlowDelegateTest {
@@ -70,38 +71,38 @@ public class SSLFlowDelegateTest {
     private static final Random random = new Random();
     private static final byte DATA_BYTE = (byte) random.nextInt();
 
-    private ExecutorService executor;
-    private SSLParameters sslParams;
-    private SSLServerSocket sslServerSocket;
-    private SSLEngine clientEngine;
-    private CompletableFuture<Void> testCompletion;
+    private static ExecutorService executor;
+    private static SSLParameters sslParams;
+    private static SSLServerSocket sslServerSocket;
+    private static SSLEngine clientEngine;
+    private static CompletableFuture<Void> testCompletion;
 
-    @BeforeTest
-    public void beforeTest() throws Exception {
-        this.executor = Executors.newCachedThreadPool();
-        this.testCompletion = new CompletableFuture<>();
+    @BeforeAll
+    public static void beforeTest() throws Exception {
+        executor = Executors.newCachedThreadPool();
+        testCompletion = new CompletableFuture<>();
 
         final SSLParameters sp = new SSLParameters();
         sp.setApplicationProtocols(new String[]{ALPN});
-        this.sslParams = sp;
+        sslParams = sp;
 
         var sslContext = SimpleSSLContextWhiteboxAdapter.findSSLContext();
-        this.sslServerSocket = startServer(sslContext);
-        println(debugTag, "Server started at " + this.sslServerSocket.getInetAddress() + ":"
-                + this.sslServerSocket.getLocalPort());
+        sslServerSocket = startServer(sslContext);
+        println(debugTag, "Server started at " + sslServerSocket.getInetAddress() + ":"
+                + sslServerSocket.getLocalPort());
 
-        this.clientEngine = createClientEngine(sslContext);
+        clientEngine = createClientEngine(sslContext);
     }
 
-    @AfterTest
-    public void afterTest() throws Exception {
-        if (this.sslServerSocket != null) {
-            println(debugTag, "Closing server socket " + this.sslServerSocket);
-            this.sslServerSocket.close();
+    @AfterAll
+    public static void afterTest() throws Exception {
+        if (sslServerSocket != null) {
+            println(debugTag, "Closing server socket " + sslServerSocket);
+            sslServerSocket.close();
         }
-        if (this.executor != null) {
-            println(debugTag, "Shutting down the executor " + this.executor);
-            this.executor.shutdownNow();
+        if (executor != null) {
+            println(debugTag, "Shutting down the executor " + executor);
+            executor.shutdownNow();
         }
     }
 
@@ -117,30 +118,30 @@ public class SSLFlowDelegateTest {
         }
     }
 
-    private SSLServerSocket createSSLServerSocket(
+    private static SSLServerSocket createSSLServerSocket(
             final SSLContext ctx, final InetSocketAddress bindAddr) throws IOException {
         final SSLServerSocketFactory fac = ctx.getServerSocketFactory();
         final SSLServerSocket sslServerSocket = (SSLServerSocket) fac.createServerSocket();
         sslServerSocket.setReuseAddress(false);
-        sslServerSocket.setSSLParameters(this.sslParams);
+        sslServerSocket.setSSLParameters(sslParams);
         sslServerSocket.bind(bindAddr);
         return sslServerSocket;
     }
 
-    private SSLServerSocket startServer(final SSLContext ctx) throws Exception {
+    private static SSLServerSocket startServer(final SSLContext ctx) throws Exception {
         final SSLServerSocket sslServerSocket = createSSLServerSocket(ctx,
                 new InetSocketAddress(InetAddress.getLoopbackAddress(), 0));
         final Runnable serverResponsePusher = new ServerResponsePusher(sslServerSocket,
-                this.testCompletion);
+                testCompletion);
         final Thread serverThread = new Thread(serverResponsePusher, "serverResponsePusher");
         // start the thread which will accept() a socket connection and send data over it
         serverThread.start();
         return sslServerSocket;
     }
 
-    private SSLEngine createClientEngine(final SSLContext ctx) {
+    private static SSLEngine createClientEngine(final SSLContext ctx) {
         final SSLEngine clientEngine = ctx.createSSLEngine();
-        clientEngine.setSSLParameters(this.sslParams);
+        clientEngine.setSSLParameters(sslParams);
         clientEngine.setUseClientMode(true);
         return clientEngine;
     }
@@ -170,7 +171,7 @@ public class SSLFlowDelegateTest {
             // in various places in this test. If the "testCompletion" completes before
             // the "soleExpectedAppData" completes (typically due to some exception),
             // then we complete the "soleExpectedAppData" too.
-            this.testCompletion.whenComplete((r, t) -> {
+            testCompletion.whenComplete((r, t) -> {
                 if (soleExpectedAppData.isDone()) {
                     return;
                 }
@@ -221,7 +222,7 @@ public class SSLFlowDelegateTest {
             println(debugTag, "Waiting for handshake to complete");
             final String negotiatedALPN = sslFlowDelegate.alpn().join();
             println(debugTag, "handshake completed, with negotiated ALPN: " + negotiatedALPN);
-            Assert.assertEquals(negotiatedALPN, ALPN, "unexpected ALPN negotiated");
+            assertEquals(ALPN, negotiatedALPN, "unexpected ALPN negotiated");
             try {
                 // now wait for the initial (and the only) chunk of application data to be
                 // received by the AppResponseReceiver
@@ -254,7 +255,7 @@ public class SSLFlowDelegateTest {
 
     private void failTest(final CompletionException ce) {
         final Throwable cause = ce.getCause();
-        Assert.fail(cause.getMessage() == null ? "test failed" : cause.getMessage(), cause);
+        fail(cause.getMessage() == null ? "test failed" : cause.getMessage(), cause);
     }
 
     // uses reflection to get hold of the SSLFlowDelegate.reader.outputQ member field,
@@ -288,7 +289,7 @@ public class SSLFlowDelegateTest {
             }
             println(debugTag, "num unsolicited bytes so far = " + numUnsolicitated);
         }
-        Assert.assertEquals(numUnsolicitated, 0,
+        assertEquals(0, numUnsolicitated,
                 "SSLFlowDelegate has accumulated " + numUnsolicitated + " unsolicited bytes");
     }
 
diff --git a/test/jdk/java/net/httpclient/whitebox/java.net.http/jdk/internal/net/http/SSLTubeTest.java b/test/jdk/java/net/httpclient/whitebox/java.net.http/jdk/internal/net/http/SSLTubeTest.java
index ac6a235b8e2..bb8d583e07b 100644
--- a/test/jdk/java/net/httpclient/whitebox/java.net.http/jdk/internal/net/http/SSLTubeTest.java
+++ b/test/jdk/java/net/httpclient/whitebox/java.net.http/jdk/internal/net/http/SSLTubeTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2017, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2017, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -26,7 +26,6 @@ package jdk.internal.net.http;
 import jdk.internal.net.http.common.FlowTube;
 import jdk.internal.net.http.common.SSLFlowDelegate;
 import jdk.internal.net.http.common.Utils;
-import org.testng.annotations.Test;
 
 import javax.net.ssl.SSLContext;
 import javax.net.ssl.SSLParameters;
@@ -51,7 +50,8 @@ import java.util.concurrent.LinkedBlockingQueue;
 import java.util.concurrent.SubmissionPublisher;
 import java.util.concurrent.atomic.AtomicInteger;
 
-@Test
+import org.junit.jupiter.api.Test;
+
 public class SSLTubeTest extends AbstractSSLTubeTest {
 
     @Test
@@ -125,7 +125,7 @@ public class SSLTubeTest extends AbstractSSLTubeTest {
         private void clientReader() {
             try {
                 InputStream is = clientSock.getInputStream();
-                final int bufsize = randomRange(512, 16 * 1024);
+                final int bufsize = AbstractRandomTest.randomRange(512, 16 * 1024);
                 System.out.println("clientReader: bufsize = " + bufsize);
                 while (true) {
                     byte[] buf = new byte[bufsize];
@@ -137,7 +137,7 @@ public class SSLTubeTest extends AbstractSSLTubeTest {
                         allBytesReceived.await();
                         System.out.println("clientReader: closing publisher");
                         publisher.close();
-                        sleep(2000);
+                        AbstractSSLTubeTest.sleep(2000);
                         Utils.close(is, clientSock);
                         return;
                     }
@@ -206,13 +206,13 @@ public class SSLTubeTest extends AbstractSSLTubeTest {
             try {
                 InputStream is = serverSock.getInputStream();
                 OutputStream os = serverSock.getOutputStream();
-                final int bufsize = randomRange(512, 16 * 1024);
+                final int bufsize = AbstractRandomTest.randomRange(512, 16 * 1024);
                 System.out.println("serverLoopback: bufsize = " + bufsize);
                 byte[] bb = new byte[bufsize];
                 while (true) {
                     int n = is.read(bb);
                     if (n == -1) {
-                        sleep(2000);
+                        AbstractSSLTubeTest.sleep(2000);
                         is.close();
                         os.close();
                         serverSock.close();
diff --git a/test/jdk/java/net/httpclient/whitebox/java.net.http/jdk/internal/net/http/SelectorTest.java b/test/jdk/java/net/httpclient/whitebox/java.net.http/jdk/internal/net/http/SelectorTest.java
index 5b8da3b9979..3027df0436e 100644
--- a/test/jdk/java/net/httpclient/whitebox/java.net.http/jdk/internal/net/http/SelectorTest.java
+++ b/test/jdk/java/net/httpclient/whitebox/java.net.http/jdk/internal/net/http/SelectorTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2015, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2015, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -31,20 +31,20 @@ import java.util.concurrent.CountDownLatch;
 import java.util.concurrent.atomic.AtomicInteger;
 import java.net.http.HttpClient;
 import java.net.http.HttpResponse;
-import org.testng.annotations.Test;
 import jdk.internal.net.http.websocket.RawChannel;
 import static java.lang.System.out;
 import static java.nio.charset.StandardCharsets.US_ASCII;
 import static java.util.concurrent.TimeUnit.SECONDS;
 import static java.net.http.HttpResponse.BodyHandlers.discarding;
 
+import org.junit.jupiter.api.Test;
+
 /**
  * Whitebox test of selector mechanics. Currently only a simple test
  * setting one read and one write event is done. It checks that the
  * write event occurs first, followed by the read event and then no
  * further events occur despite the conditions actually still existing.
  */
-@Test
 public class SelectorTest {
 
     AtomicInteger counter = new AtomicInteger();
diff --git a/test/jdk/java/net/httpclient/whitebox/java.net.http/jdk/internal/net/http/WindowControllerTest.java b/test/jdk/java/net/httpclient/whitebox/java.net.http/jdk/internal/net/http/WindowControllerTest.java
index 0a94f471575..5df3b4227e6 100644
--- a/test/jdk/java/net/httpclient/whitebox/java.net.http/jdk/internal/net/http/WindowControllerTest.java
+++ b/test/jdk/java/net/httpclient/whitebox/java.net.http/jdk/internal/net/http/WindowControllerTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,92 +23,93 @@
 
 package jdk.internal.net.http;
 
-import org.testng.annotations.Test;
 import static jdk.internal.net.http.frame.SettingsFrame.DEFAULT_INITIAL_WINDOW_SIZE;
-import static org.testng.Assert.assertEquals;
-import static org.testng.Assert.assertThrows;
+
+import org.junit.jupiter.api.Test;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertThrows;
 
 public class WindowControllerTest {
 
     @Test
     public void testConnectionWindowOverflow() {
         WindowController wc = new WindowController();
-        assertEquals(wc.connectionWindowSize(), DEFAULT_INITIAL_WINDOW_SIZE);
-        assertEquals(wc.increaseConnectionWindow(Integer.MAX_VALUE), false);
-        assertEquals(wc.increaseConnectionWindow(Integer.MAX_VALUE), false);
-        assertEquals(wc.increaseConnectionWindow(Integer.MAX_VALUE), false);
-        assertEquals(wc.connectionWindowSize(), DEFAULT_INITIAL_WINDOW_SIZE);
+        assertEquals(DEFAULT_INITIAL_WINDOW_SIZE, wc.connectionWindowSize());
+        assertEquals(false, wc.increaseConnectionWindow(Integer.MAX_VALUE));
+        assertEquals(false, wc.increaseConnectionWindow(Integer.MAX_VALUE));
+        assertEquals(false, wc.increaseConnectionWindow(Integer.MAX_VALUE));
+        assertEquals(DEFAULT_INITIAL_WINDOW_SIZE, wc.connectionWindowSize());
 
         wc.registerStream(1, DEFAULT_INITIAL_WINDOW_SIZE);
         wc.tryAcquire(DEFAULT_INITIAL_WINDOW_SIZE - 1, 1, null);
-        assertEquals(wc.connectionWindowSize(), 1);
-        assertEquals(wc.increaseConnectionWindow(Integer.MAX_VALUE), false);
-        assertEquals(wc.increaseConnectionWindow(Integer.MAX_VALUE), false);
-        assertEquals(wc.increaseConnectionWindow(Integer.MAX_VALUE), false);
-        assertEquals(wc.connectionWindowSize(), 1);
+        assertEquals(1, wc.connectionWindowSize());
+        assertEquals(false, wc.increaseConnectionWindow(Integer.MAX_VALUE));
+        assertEquals(false, wc.increaseConnectionWindow(Integer.MAX_VALUE));
+        assertEquals(false, wc.increaseConnectionWindow(Integer.MAX_VALUE));
+        assertEquals(1, wc.connectionWindowSize());
 
         wc.increaseConnectionWindow(Integer.MAX_VALUE - 1 -1);
-        assertEquals(wc.connectionWindowSize(), Integer.MAX_VALUE - 1);
-        assertEquals(wc.increaseConnectionWindow(Integer.MAX_VALUE), false);
-        assertEquals(wc.increaseConnectionWindow(Integer.MAX_VALUE), false);
-        assertEquals(wc.increaseConnectionWindow(Integer.MAX_VALUE), false);
-        assertEquals(wc.connectionWindowSize(), Integer.MAX_VALUE - 1);
+        assertEquals(Integer.MAX_VALUE - 1, wc.connectionWindowSize());
+        assertEquals(false, wc.increaseConnectionWindow(Integer.MAX_VALUE));
+        assertEquals(false, wc.increaseConnectionWindow(Integer.MAX_VALUE));
+        assertEquals(false, wc.increaseConnectionWindow(Integer.MAX_VALUE));
+        assertEquals(Integer.MAX_VALUE - 1, wc.connectionWindowSize());
 
         wc.increaseConnectionWindow(1);
-        assertEquals(wc.connectionWindowSize(), Integer.MAX_VALUE);
-        assertEquals(wc.increaseConnectionWindow(1), false);
-        assertEquals(wc.increaseConnectionWindow(100), false);
-        assertEquals(wc.increaseConnectionWindow(Integer.MAX_VALUE), false);
-        assertEquals(wc.connectionWindowSize(), Integer.MAX_VALUE);
+        assertEquals(Integer.MAX_VALUE, wc.connectionWindowSize());
+        assertEquals(false, wc.increaseConnectionWindow(1));
+        assertEquals(false, wc.increaseConnectionWindow(100));
+        assertEquals(false, wc.increaseConnectionWindow(Integer.MAX_VALUE));
+        assertEquals(Integer.MAX_VALUE, wc.connectionWindowSize());
     }
 
     @Test
     public void testStreamWindowOverflow() {
         WindowController wc = new WindowController();
         wc.registerStream(1, DEFAULT_INITIAL_WINDOW_SIZE);
-        assertEquals(wc.increaseStreamWindow(Integer.MAX_VALUE, 1), false);
-        assertEquals(wc.increaseStreamWindow(Integer.MAX_VALUE, 1), false);
-        assertEquals(wc.increaseStreamWindow(Integer.MAX_VALUE, 1), false);
+        assertEquals(false, wc.increaseStreamWindow(Integer.MAX_VALUE, 1));
+        assertEquals(false, wc.increaseStreamWindow(Integer.MAX_VALUE, 1));
+        assertEquals(false, wc.increaseStreamWindow(Integer.MAX_VALUE, 1));
 
         wc.registerStream(3, DEFAULT_INITIAL_WINDOW_SIZE);
-        assertEquals(wc.increaseStreamWindow(100, 3), true);
-        assertEquals(wc.increaseStreamWindow(Integer.MAX_VALUE, 3), false);
-        assertEquals(wc.increaseStreamWindow(Integer.MAX_VALUE, 3), false);
+        assertEquals(true, wc.increaseStreamWindow(100, 3));
+        assertEquals(false, wc.increaseStreamWindow(Integer.MAX_VALUE, 3));
+        assertEquals(false, wc.increaseStreamWindow(Integer.MAX_VALUE, 3));
 
         wc.registerStream(5, 0);
-        assertEquals(wc.increaseStreamWindow(Integer.MAX_VALUE, 5), true);
-        assertEquals(wc.increaseStreamWindow(1, 5), false);
-        assertEquals(wc.increaseStreamWindow(1, 5), false);
-        assertEquals(wc.increaseStreamWindow(10, 5), false);
+        assertEquals(true, wc.increaseStreamWindow(Integer.MAX_VALUE, 5));
+        assertEquals(false, wc.increaseStreamWindow(1, 5));
+        assertEquals(false, wc.increaseStreamWindow(1, 5));
+        assertEquals(false, wc.increaseStreamWindow(10, 5));
 
         wc.registerStream(7, -1);
-        assertEquals(wc.increaseStreamWindow(Integer.MAX_VALUE, 7), true);
-        assertEquals(wc.increaseStreamWindow(1, 7), true);
-        assertEquals(wc.increaseStreamWindow(1, 7), false);
-        assertEquals(wc.increaseStreamWindow(10, 7), false);
+        assertEquals(true, wc.increaseStreamWindow(Integer.MAX_VALUE, 7));
+        assertEquals(true, wc.increaseStreamWindow(1, 7));
+        assertEquals(false, wc.increaseStreamWindow(1, 7));
+        assertEquals(false, wc.increaseStreamWindow(10, 7));
 
         wc.registerStream(9, -1);
-        assertEquals(wc.increaseStreamWindow(1, 9), true);
-        assertEquals(wc.increaseStreamWindow(1, 9), true);
-        assertEquals(wc.increaseStreamWindow(1, 9), true);
-        assertEquals(wc.increaseStreamWindow(10, 9), true);
-        assertEquals(wc.increaseStreamWindow(Integer.MAX_VALUE, 9), false);
+        assertEquals(true, wc.increaseStreamWindow(1, 9));
+        assertEquals(true, wc.increaseStreamWindow(1, 9));
+        assertEquals(true, wc.increaseStreamWindow(1, 9));
+        assertEquals(true, wc.increaseStreamWindow(10, 9));
+        assertEquals(false, wc.increaseStreamWindow(Integer.MAX_VALUE, 9));
 
         wc.registerStream(11, -10);
-        assertEquals(wc.increaseStreamWindow(1, 11), true);
-        assertEquals(wc.increaseStreamWindow(1, 11), true);
-        assertEquals(wc.increaseStreamWindow(1, 11), true);
-        assertEquals(wc.increaseStreamWindow(1, 11), true);
-        assertEquals(wc.increaseStreamWindow(1, 11), true);
-        assertEquals(wc.increaseStreamWindow(1, 11), true);
-        assertEquals(wc.increaseStreamWindow(1, 11), true);
-        assertEquals(wc.increaseStreamWindow(1, 11), true);
-        assertEquals(wc.increaseStreamWindow(1, 11), true);
-        assertEquals(wc.increaseStreamWindow(1, 11), true);
-        assertEquals(wc.increaseStreamWindow(1, 11), true);
-        assertEquals(wc.streamWindowSize(11), 1);
-        assertEquals(wc.increaseStreamWindow(Integer.MAX_VALUE, 11), false);
-        assertEquals(wc.streamWindowSize(11), 1);
+        assertEquals(true, wc.increaseStreamWindow(1, 11));
+        assertEquals(true, wc.increaseStreamWindow(1, 11));
+        assertEquals(true, wc.increaseStreamWindow(1, 11));
+        assertEquals(true, wc.increaseStreamWindow(1, 11));
+        assertEquals(true, wc.increaseStreamWindow(1, 11));
+        assertEquals(true, wc.increaseStreamWindow(1, 11));
+        assertEquals(true, wc.increaseStreamWindow(1, 11));
+        assertEquals(true, wc.increaseStreamWindow(1, 11));
+        assertEquals(true, wc.increaseStreamWindow(1, 11));
+        assertEquals(true, wc.increaseStreamWindow(1, 11));
+        assertEquals(true, wc.increaseStreamWindow(1, 11));
+        assertEquals(1, wc.streamWindowSize(11));
+        assertEquals(false, wc.increaseStreamWindow(Integer.MAX_VALUE, 11));
+        assertEquals(1, wc.streamWindowSize(11));
     }
 
     @Test
@@ -125,9 +126,9 @@ public class WindowControllerTest {
         wc.tryAcquire(51, 5 , null);
 
         wc.adjustActiveStreams(-200);
-        assertEquals(wc.streamWindowSize(1), -149);
-        assertEquals(wc.streamWindowSize(3), -150);
-        assertEquals(wc.streamWindowSize(5), -151);
+        assertEquals(-149, wc.streamWindowSize(1));
+        assertEquals(-150, wc.streamWindowSize(3));
+        assertEquals(-151, wc.streamWindowSize(5));
     }
 
     static final Class<InternalError> IE = InternalError.class;
diff --git a/test/jdk/java/net/httpclient/whitebox/java.net.http/jdk/internal/net/http/WrapperTest.java b/test/jdk/java/net/httpclient/whitebox/java.net.http/jdk/internal/net/http/WrapperTest.java
index 6dad2cc75b5..bc69c425678 100644
--- a/test/jdk/java/net/httpclient/whitebox/java.net.http/jdk/internal/net/http/WrapperTest.java
+++ b/test/jdk/java/net/httpclient/whitebox/java.net.http/jdk/internal/net/http/WrapperTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2017, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2017, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -27,11 +27,10 @@ import java.nio.ByteBuffer;
 import java.util.LinkedList;
 import java.util.List;
 import java.util.concurrent.*;
-import java.util.concurrent.atomic.*;
-import org.testng.annotations.Test;
 import jdk.internal.net.http.common.SubscriberWrapper;
 
-@Test
+import org.junit.jupiter.api.Test;
+
 public class WrapperTest {
     static final int LO_PRI = 1;
     static final int HI_PRI = 2;
diff --git a/test/jdk/java/net/httpclient/whitebox/java.net.http/jdk/internal/net/http/common/DemandTest.java b/test/jdk/java/net/httpclient/whitebox/java.net.http/jdk/internal/net/http/common/DemandTest.java
index 4ea604fd488..1ea72f472e9 100644
--- a/test/jdk/java/net/httpclient/whitebox/java.net.http/jdk/internal/net/http/common/DemandTest.java
+++ b/test/jdk/java/net/httpclient/whitebox/java.net.http/jdk/internal/net/http/common/DemandTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2017, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2017, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,15 +23,16 @@
 
 package jdk.internal.net.http.common;
 
-import org.testng.annotations.Test;
-
 import java.util.concurrent.CountDownLatch;
 import java.util.concurrent.CyclicBarrier;
 import java.util.concurrent.atomic.AtomicReference;
 
-import static org.testng.Assert.assertEquals;
-import static org.testng.Assert.assertFalse;
-import static org.testng.Assert.assertTrue;
+import org.junit.jupiter.api.Test;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertFalse;
+import static org.junit.jupiter.api.Assertions.assertNull;
+import static org.junit.jupiter.api.Assertions.assertTrue;
+import static org.junit.jupiter.api.Assertions.assertThrows;
 
 public class DemandTest {
 
@@ -59,53 +60,61 @@ public class DemandTest {
     public void test03() {
         Demand d = new Demand();
         d.increase(3);
-        assertEquals(d.decreaseAndGet(3), 3);
+        assertEquals(3, d.decreaseAndGet(3));
     }
 
     @Test
     public void test04() {
         Demand d = new Demand();
         d.increase(3);
-        assertEquals(d.decreaseAndGet(5), 3);
+        assertEquals(3, d.decreaseAndGet(5));
     }
 
     @Test
     public void test05() {
         Demand d = new Demand();
         d.increase(7);
-        assertEquals(d.decreaseAndGet(4), 4);
+        assertEquals(4, d.decreaseAndGet(4));
     }
 
     @Test
     public void test06() {
         Demand d = new Demand();
-        assertEquals(d.decreaseAndGet(3), 0);
+        assertEquals(0, d.decreaseAndGet(3));
     }
 
-    @Test(expectedExceptions = IllegalArgumentException.class)
+    @Test
     public void test07() {
-        Demand d = new Demand();
-        d.increase(0);
+        assertThrows(IllegalArgumentException.class, () -> {
+            Demand d = new Demand();
+            d.increase(0);
+        });
     }
 
-    @Test(expectedExceptions = IllegalArgumentException.class)
+    @Test
     public void test08() {
-        Demand d = new Demand();
-        d.increase(-1);
+        assertThrows(IllegalArgumentException.class, () -> {
+            Demand d = new Demand();
+            d.increase(-1);
+        });
     }
 
-    @Test(expectedExceptions = IllegalArgumentException.class)
+    @Test
     public void test09() {
-        Demand d = new Demand();
-        d.increase(10);
-        d.decreaseAndGet(0);
+        assertThrows(IllegalArgumentException.class, () -> {
+            Demand d = new Demand();
+            d.increase(10);
+            d.decreaseAndGet(0);
+        });
     }
 
-    @Test(expectedExceptions = IllegalArgumentException.class)
+    @Test
     public void test10() {
-        Demand d = new Demand();
-        d.increase(13);
-        d.decreaseAndGet(-3);
+        assertThrows(IllegalArgumentException.class, () -> {
+            Demand d = new Demand();
+            d.increase(13);
+            d.decreaseAndGet(-3);
+        });
     }
 
     @Test
@@ -169,7 +178,7 @@ public class DemandTest {
         assertTrue(d.isFulfilled());
     }
 
-    @Test(invocationCount = 32)
+    @Test
     public void test15() throws InterruptedException {
         int N = Math.max(2, Runtime.getRuntime().availableProcessors() + 1);
         int M = ((N + 1) * N) / 2; // 1 + 2 + 3 + ... N
@@ -187,7 +196,7 @@ public class DemandTest {
                     error.compareAndSet(null, e);
                 }
                 try {
-                    assertEquals(d.decreaseAndGet(j), j);
+                    assertEquals(j, d.decreaseAndGet(j));
                 } catch (Throwable t) {
                     error.compareAndSet(null, t);
                 } finally {
@@ -197,6 +206,6 @@ public class DemandTest {
         }
         stop.await();
         assertTrue(d.isFulfilled());
-        assertEquals(error.get(), null);
+        assertNull(error.get());
     }
 }
diff --git a/test/jdk/java/net/httpclient/whitebox/java.net.http/jdk/internal/net/http/common/MinimalFutureTest.java b/test/jdk/java/net/httpclient/whitebox/java.net.http/jdk/internal/net/http/common/MinimalFutureTest.java
index 01798a645a2..2c33f6f0018 100644
--- a/test/jdk/java/net/httpclient/whitebox/java.net.http/jdk/internal/net/http/common/MinimalFutureTest.java
+++ b/test/jdk/java/net/httpclient/whitebox/java.net.http/jdk/internal/net/http/common/MinimalFutureTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,19 +23,19 @@
 
 package jdk.internal.net.http.common;
 
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
-
 import java.util.concurrent.CompletableFuture;
 import java.util.concurrent.CompletionException;
 import java.util.concurrent.ExecutorService;
 import java.util.concurrent.Executors;
 
-import static org.testng.Assert.assertThrows;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
+import static org.junit.jupiter.api.Assertions.assertThrows;
 
 public class MinimalFutureTest {
 
-    @Test(dataProvider = "futures")
+    @ParameterizedTest
+    @MethodSource("futures")
     public void test(CompletableFuture<Object> mf) {
         ExecutorService executor = Executors.newSingleThreadExecutor();
         try {
@@ -134,8 +134,7 @@ public class MinimalFutureTest {
     }
 
 
-    @DataProvider(name = "futures")
-    public Object[][] futures() {
+    public static Object[][] futures() {
 
         MinimalFuture<Object> mf = new MinimalFuture<>();
         mf.completeExceptionally(new Throwable());
diff --git a/test/jdk/java/net/httpclient/whitebox/java.net.http/jdk/internal/net/http/frame/FramesDecoderTest.java b/test/jdk/java/net/httpclient/whitebox/java.net.http/jdk/internal/net/http/frame/FramesDecoderTest.java
index 3db439d1c00..e8acc95c1d2 100644
--- a/test/jdk/java/net/httpclient/whitebox/java.net.http/jdk/internal/net/http/frame/FramesDecoderTest.java
+++ b/test/jdk/java/net/httpclient/whitebox/java.net.http/jdk/internal/net/http/frame/FramesDecoderTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -27,15 +27,15 @@ import java.io.IOException;
 import java.nio.ByteBuffer;
 import java.util.ArrayList;
 import java.util.List;
-import org.testng.Assert;
-import org.testng.annotations.Test;
 import static java.lang.System.out;
 import static java.nio.charset.StandardCharsets.UTF_8;
-import static org.testng.Assert.*;
+
+import org.junit.jupiter.api.Test;
+import static org.junit.jupiter.api.Assertions.*;
 
 public class FramesDecoderTest {
 
-    abstract class TestFrameProcessor implements FramesDecoder.FrameProcessor {
+    abstract static class TestFrameProcessor implements FramesDecoder.FrameProcessor {
         protected volatile int count;
         public int numberOfFramesDecoded() { return count; }
     }
@@ -69,17 +69,17 @@ public class FramesDecoderTest {
                 assertTrue(frame instanceof DataFrame);
                 DataFrame dataFrame = (DataFrame) frame;
                 List<ByteBuffer> list = dataFrame.getData();
-                assertEquals(list.size(), 1);
+                assertEquals(1, list.size());
                 ByteBuffer data = list.get(0);
                 byte[] bytes = new byte[data.remaining()];
                 data.get(bytes);
                 if (count == 0) {
-                    assertEquals(new String(bytes, UTF_8), "XXXX");
+                    assertEquals("XXXX", new String(bytes, UTF_8));
                     out.println("First data received:" + data);
-                    assertEquals(data.position(), data.limit());  // since bytes read
-                    assertEquals(data.limit(), data.capacity());
+                    assertEquals(data.limit(), data.position());  // since bytes read
+                    assertEquals(data.capacity(), data.limit());
                 } else {
-                    assertEquals(new String(bytes, UTF_8), "YYYY");
+                    assertEquals("YYYY", new String(bytes, UTF_8));
                     out.println("Second data received:" + data);
                 }
                 count++;
@@ -89,7 +89,7 @@ public class FramesDecoderTest {
 
         out.println("Sending " + combined + " to decoder: ");
         decoder.decode(combined);
-        Assert.assertEquals(testFrameProcessor.numberOfFramesDecoded(), 2);
+        assertEquals(2, testFrameProcessor.numberOfFramesDecoded());
     }
 
 
@@ -119,15 +119,15 @@ public class FramesDecoderTest {
                 assertTrue(frame instanceof DataFrame);
                 DataFrame dataFrame = (DataFrame) frame;
                 List<ByteBuffer> list = dataFrame.getData();
-                assertEquals(list.size(), 1);
+                assertEquals(1, list.size());
                 ByteBuffer data = list.get(0);
                 byte[] bytes = new byte[data.remaining()];
                 data.get(bytes);
-                assertEquals(new String(bytes, UTF_8), "XXXX");
+                assertEquals("XXXX", new String(bytes, UTF_8));
                 out.println("First data received:" + data);
-                assertEquals(data.position(), data.limit());  // since bytes read
+                assertEquals(data.limit(), data.position());  // since bytes read
                 //assertNotEquals(data.limit(), data.capacity());
-                assertEquals(data.capacity(), 1024 - 9 /*frame header*/);
+                assertEquals(1024 - 9 /*frame header*/, data.capacity());
                 count++;
             }
         };
@@ -135,6 +135,6 @@ public class FramesDecoderTest {
 
         out.println("Sending " + combined + " to decoder: ");
         decoder.decode(combined);
-        Assert.assertEquals(testFrameProcessor.numberOfFramesDecoded(), 1);
+        assertEquals(1, testFrameProcessor.numberOfFramesDecoded());
     }
 }

From a0c0a3617936bb024ee7a9325b98a49ccaab5041 Mon Sep 17 00:00:00 2001
From: Daniel Fuchs <dfuchs@openjdk.org>
Date: Thu, 5 Mar 2026 11:12:58 +0000
Subject: [PATCH 053/655] 8378600: Refactor tests under
 test/jdk/java/net/httpclient/http2 from TestNG to JUnit

Reviewed-by: vyazici
---
 .../java/net/httpclient/http2/ErrorTest.java  |  4 +-
 .../httpclient/http2/FixedThreadPoolTest.java |  6 +-
 .../httpclient/http2/H2SelectorVTTest.java    | 10 +--
 .../httpclient/http2/ImplicitPushCancel.java  | 35 +++++----
 .../java/net/httpclient/http2/NoBodyTest.java | 10 +--
 .../net/httpclient/http2/PostPutTest.java     | 36 ++++-----
 .../http2/PushPromiseContinuation.java        | 49 ++++++------
 .../net/httpclient/http2/RedirectTest.java    |  7 +-
 .../java/net/httpclient/http2/ServerPush.java | 61 ++++++++-------
 .../http2/ServerPushWithDiffTypes.java        | 15 ++--
 .../java/net/httpclient/http2/SimpleGet.java  | 21 ++---
 .../http2/StreamFlowControlTest.java          | 78 ++++++++++---------
 .../httpclient/http2/TrailingHeadersTest.java | 49 ++++++------
 .../net/http/hpack/HeaderTableTest.java       |  6 +-
 14 files changed, 196 insertions(+), 191 deletions(-)

diff --git a/test/jdk/java/net/httpclient/http2/ErrorTest.java b/test/jdk/java/net/httpclient/http2/ErrorTest.java
index 6b36529b38f..0f3bafa571d 100644
--- a/test/jdk/java/net/httpclient/http2/ErrorTest.java
+++ b/test/jdk/java/net/httpclient/http2/ErrorTest.java
@@ -45,7 +45,7 @@
  *          java.net.http/jdk.internal.net.http.qpack.writers
  *          java.security.jgss
  * @modules java.base/jdk.internal.util
- * @run testng/othervm/timeout=60 -Djavax.net.debug=ssl -Djdk.httpclient.HttpClient.log=all ErrorTest
+ * @run junit/othervm/timeout=60 -Djavax.net.debug=ssl -Djdk.httpclient.HttpClient.log=all ErrorTest
  * @summary check exception thrown when bad TLS parameters selected
  */
 
@@ -67,7 +67,7 @@ import jdk.httpclient.test.lib.http2.Http2TestServer;
 import jdk.test.lib.net.SimpleSSLContext;
 import static java.net.http.HttpClient.Version.HTTP_2;
 
-import org.testng.annotations.Test;
+import org.junit.jupiter.api.Test;
 
 /**
  * When selecting an unacceptable cipher suite the TLS handshake will fail.
diff --git a/test/jdk/java/net/httpclient/http2/FixedThreadPoolTest.java b/test/jdk/java/net/httpclient/http2/FixedThreadPoolTest.java
index 2378b0b6982..d788d39b441 100644
--- a/test/jdk/java/net/httpclient/http2/FixedThreadPoolTest.java
+++ b/test/jdk/java/net/httpclient/http2/FixedThreadPoolTest.java
@@ -30,7 +30,7 @@
  *        jdk.test.lib.Asserts
  *        jdk.test.lib.Utils
  *        jdk.test.lib.net.SimpleSSLContext
- * @run testng/othervm -Djdk.httpclient.HttpClient.log=ssl,requests,responses,errors FixedThreadPoolTest
+ * @run junit/othervm -Djdk.httpclient.HttpClient.log=ssl,requests,responses,errors FixedThreadPoolTest
  */
 
 import java.net.*;
@@ -51,7 +51,7 @@ import static jdk.test.lib.Asserts.assertFileContentsEqual;
 import static jdk.test.lib.Utils.createTempFile;
 import static jdk.test.lib.Utils.createTempFileOfSize;
 
-import org.testng.annotations.Test;
+import org.junit.jupiter.api.Test;
 
 public class FixedThreadPoolTest implements HttpServerAdapters {
 
@@ -92,7 +92,7 @@ public class FixedThreadPoolTest implements HttpServerAdapters {
     }
 
     @Test
-    public static void test() throws Exception {
+    public void test() throws Exception {
         try {
             initialize();
             simpleTest(false);
diff --git a/test/jdk/java/net/httpclient/http2/H2SelectorVTTest.java b/test/jdk/java/net/httpclient/http2/H2SelectorVTTest.java
index 85d4012494a..7adfd57319c 100644
--- a/test/jdk/java/net/httpclient/http2/H2SelectorVTTest.java
+++ b/test/jdk/java/net/httpclient/http2/H2SelectorVTTest.java
@@ -38,7 +38,7 @@ import jdk.test.lib.net.SimpleSSLContext;
 import org.junit.jupiter.api.AfterAll;
 import org.junit.jupiter.api.BeforeAll;
 import org.junit.jupiter.api.Test;
-import org.junit.jupiter.api.Assertions;
+import static org.junit.jupiter.api.Assertions.assertEquals;
 
 import static java.net.http.HttpClient.Builder.NO_PROXY;
 import static java.net.http.HttpClient.Version.HTTP_2;
@@ -166,21 +166,21 @@ class H2SelectorVTTest implements HttpServerAdapters {
             final HttpRequest req1 = reqBuilder.copy().GET().build();
             System.out.println("\nIssuing request: " + req1);
             final HttpResponse<?> resp1 = client.send(req1, BodyHandlers.ofString());
-            Assertions.assertEquals(200, resp1.statusCode(), "unexpected response code for GET request");
+            assertEquals(200, resp1.statusCode(), "unexpected response code for GET request");
             assertSelectorThread(client);
 
             // POST
             final HttpRequest req2 = reqBuilder.copy().POST(BodyPublishers.ofString("foo")).build();
             System.out.println("\nIssuing request: " + req2);
             final HttpResponse<?> resp2 = client.send(req2, BodyHandlers.ofString());
-            Assertions.assertEquals(200, resp2.statusCode(), "unexpected response code for POST request");
+            assertEquals(200, resp2.statusCode(), "unexpected response code for POST request");
             assertSelectorThread(client);
 
             // HEAD
             final HttpRequest req3 = reqBuilder.copy().HEAD().build();
             System.out.println("\nIssuing request: " + req3);
             final HttpResponse<?> resp3 = client.send(req3, BodyHandlers.ofString());
-            Assertions.assertEquals(200, resp3.statusCode(), "unexpected response code for HEAD request");
+            assertEquals(200, resp3.statusCode(), "unexpected response code for HEAD request");
             assertSelectorThread(client);
         }
     }
@@ -219,6 +219,6 @@ class H2SelectorVTTest implements HttpServerAdapters {
             msg = "%s not found in %s".formatted(name, threads);
             System.out.printf("%s: %s%n", status, msg);
         }
-        Assertions.assertEquals(!isTCPSelectorThreadVirtual(), found, msg);
+        assertEquals(!isTCPSelectorThreadVirtual(), found, msg);
     }
 }
diff --git a/test/jdk/java/net/httpclient/http2/ImplicitPushCancel.java b/test/jdk/java/net/httpclient/http2/ImplicitPushCancel.java
index c75a62d0f42..5bcaf95c6fc 100644
--- a/test/jdk/java/net/httpclient/http2/ImplicitPushCancel.java
+++ b/test/jdk/java/net/httpclient/http2/ImplicitPushCancel.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2023, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,7 +25,7 @@
  * @test
  * @library /test/lib /test/jdk/java/net/httpclient/lib
  * @build jdk.test.lib.net.SimpleSSLContext jdk.httpclient.test.lib.http2.Http2TestServer
- * @run testng/othervm
+ * @run junit/othervm
  *      -Djdk.internal.httpclient.debug=true
  *      -Djdk.httpclient.HttpClient.log=errors,requests,responses,trace
  *      ImplicitPushCancel
@@ -51,15 +51,16 @@ import java.util.concurrent.ConcurrentMap;
 import jdk.httpclient.test.lib.http2.Http2TestServer;
 import jdk.httpclient.test.lib.http2.Http2TestExchange;
 import jdk.httpclient.test.lib.http2.Http2Handler;
-import org.testng.annotations.AfterTest;
-import org.testng.annotations.BeforeTest;
-import org.testng.annotations.Test;
 import static java.nio.charset.StandardCharsets.UTF_8;
-import static org.testng.Assert.assertEquals;
+
+import org.junit.jupiter.api.AfterAll;
+import org.junit.jupiter.api.BeforeAll;
+import org.junit.jupiter.api.Test;
+import static org.junit.jupiter.api.Assertions.assertEquals;
 
 public class ImplicitPushCancel {
 
-    static Map<String,String> PUSH_PROMISES = Map.of(
+    static final Map<String,String> PUSH_PROMISES = Map.of(
             "/x/y/z/1", "the first push promise body",
             "/x/y/z/2", "the second push promise body",
             "/x/y/z/3", "the third push promise body",
@@ -72,11 +73,11 @@ public class ImplicitPushCancel {
     );
     static final String MAIN_RESPONSE_BODY = "the main response body";
 
-    Http2TestServer server;
-    URI uri;
+    private static Http2TestServer server;
+    private static URI uri;
 
-    @BeforeTest
-    public void setup() throws Exception {
+    @BeforeAll
+    public static void setup() throws Exception {
         server = new Http2TestServer(false, 0);
         Http2Handler handler = new ServerPushHandler(MAIN_RESPONSE_BODY,
                                                      PUSH_PROMISES);
@@ -87,13 +88,13 @@ public class ImplicitPushCancel {
         uri = new URI("http://localhost:" + port + "/foo/a/b/c");
     }
 
-    @AfterTest
-    public void teardown() {
+    @AfterAll
+    public static void teardown() {
         server.stop();
     }
 
     static final <T> HttpResponse<T> assert200ResponseCode(HttpResponse<T> response) {
-        assertEquals(response.statusCode(), 200);
+        assertEquals(200, response.statusCode());
         return response;
     }
 
@@ -128,11 +129,11 @@ public class ImplicitPushCancel {
         promises.entrySet().stream().forEach(entry -> {
             HttpRequest request = entry.getKey();
             HttpResponse<String> response = entry.getValue().join();
-            assertEquals(response.statusCode(), 200);
+            assertEquals(200, response.statusCode());
             if (PUSH_PROMISES.containsKey(request.uri().getPath())) {
-                assertEquals(response.body(), PUSH_PROMISES.get(request.uri().getPath()));
+                assertEquals(PUSH_PROMISES.get(request.uri().getPath()), response.body());
             } else {
-                assertEquals(response.body(), MAIN_RESPONSE_BODY);
+                assertEquals(MAIN_RESPONSE_BODY, response.body());
             }
 
         } );
diff --git a/test/jdk/java/net/httpclient/http2/NoBodyTest.java b/test/jdk/java/net/httpclient/http2/NoBodyTest.java
index 3d30c54654a..2459c8eba4b 100644
--- a/test/jdk/java/net/httpclient/http2/NoBodyTest.java
+++ b/test/jdk/java/net/httpclient/http2/NoBodyTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2015, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2015, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -26,7 +26,7 @@
  * @bug 8087112
  * @library /test/lib /test/jdk/java/net/httpclient/lib
  * @build jdk.test.lib.net.SimpleSSLContext jdk.httpclient.test.lib.http2.Http2TestServer
- * @run testng/othervm -Djdk.httpclient.HttpClient.log=ssl,requests,responses,errors
+ * @run junit/othervm -Djdk.httpclient.HttpClient.log=ssl,requests,responses,errors
  *                     -Djdk.internal.httpclient.debug=true
  *                     NoBodyTest
  */
@@ -47,10 +47,10 @@ import jdk.httpclient.test.lib.http2.Http2TestServer;
 import jdk.httpclient.test.lib.http2.Http2TestExchange;
 import jdk.httpclient.test.lib.http2.Http2Handler;
 import jdk.test.lib.net.SimpleSSLContext;
-import org.testng.annotations.Test;
 import static java.net.http.HttpClient.Version.HTTP_2;
 
-@Test
+import org.junit.jupiter.api.Test;
+
 public class NoBodyTest {
     static int httpPort, httpsPort;
     static Http2TestServer httpServer, httpsServer;
@@ -86,7 +86,7 @@ public class NoBodyTest {
     }
 
     @Test
-    public static void runtest() throws Exception {
+    public void runtest() throws Exception {
         try {
             initialize();
             warmup(false);
diff --git a/test/jdk/java/net/httpclient/http2/PostPutTest.java b/test/jdk/java/net/httpclient/http2/PostPutTest.java
index 89b192f6171..84e86b556ca 100644
--- a/test/jdk/java/net/httpclient/http2/PostPutTest.java
+++ b/test/jdk/java/net/httpclient/http2/PostPutTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2023, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2023, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -28,7 +28,7 @@
  *          does not process any data. The client should read all data from the server and close the connection.
  * @library /test/jdk/java/net/httpclient/lib
  * @build jdk.httpclient.test.lib.http2.Http2TestServer
- * @run testng/othervm/timeout=50 -Djdk.httpclient.HttpClient.log=all
+ * @run junit/othervm/timeout=50 -Djdk.httpclient.HttpClient.log=all
  *                      PostPutTest
  */
 
@@ -36,11 +36,6 @@ import jdk.httpclient.test.lib.http2.Http2Handler;
 import jdk.httpclient.test.lib.http2.Http2TestExchange;
 import jdk.httpclient.test.lib.http2.Http2TestServer;
 
-import org.testng.annotations.AfterTest;
-import org.testng.annotations.BeforeTest;
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
-
 import java.io.IOException;
 import java.io.PrintStream;
 import java.net.URI;
@@ -51,19 +46,24 @@ import java.net.http.HttpResponse;
 import static java.net.http.HttpClient.Version.HTTP_2;
 import static java.net.http.HttpRequest.BodyPublishers.ofByteArray;
 
+import org.junit.jupiter.api.AfterAll;
+import org.junit.jupiter.api.BeforeAll;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
+
 public class PostPutTest {
 
-    Http2TestServer http2TestServer;
-    URI warmupURI, testHandlerBasicURI, testHandlerCloseBosURI, testHandleNegativeContentLengthURI;
+    private static Http2TestServer http2TestServer;
+    private static URI warmupURI, testHandlerBasicURI, testHandlerCloseBosURI, testHandleNegativeContentLengthURI;
     static PrintStream testLog = System.err;
 
     // As per jdk.internal.net.http.WindowController.DEFAULT_INITIAL_WINDOW_SIZE
-    final int DEFAULT_INITIAL_WINDOW_SIZE = (64 * 1024) - 1;
+    private static final int DEFAULT_INITIAL_WINDOW_SIZE = (64 * 1024) - 1;
     // Add on a small amount of arbitrary bytes to see if client hangs when receiving RST_STREAM
-    byte[] data = new byte[DEFAULT_INITIAL_WINDOW_SIZE + 10];
+    private static byte[] data = new byte[DEFAULT_INITIAL_WINDOW_SIZE + 10];
 
-    @BeforeTest
-    public void setup() throws Exception {
+    @BeforeAll
+    public static void setup() throws Exception {
         http2TestServer = new Http2TestServer(false, 0);
         http2TestServer.addHandler(new WarmupHandler(), "/Warmup");
         http2TestServer.addHandler(new TestHandlerBasic(), "/TestHandlerBasic");
@@ -81,15 +81,14 @@ public class PostPutTest {
         testLog.println("PostPutTest.setup(): testHandleNegativeContentLengthURI: " + testHandleNegativeContentLengthURI);
     }
 
-    @AfterTest
-    public void teardown() {
+    @AfterAll
+    public static void teardown() {
         testLog.println("PostPutTest.teardown(): Stopping server");
         http2TestServer.stop();
         data = null;
     }
 
-    @DataProvider(name = "variants")
-    public Object[][] variants() {
+    public static Object[][] variants() {
         HttpRequest over64kPost, over64kPut, over64kPostCloseBos, over64kPutCloseBos, over64kPostNegativeContentLength, over64kPutNegativeContentLength;
         over64kPost = HttpRequest.newBuilder().version(HTTP_2).POST(ofByteArray(data)).uri(testHandlerBasicURI).build();
         over64kPut = HttpRequest.newBuilder().version(HTTP_2).PUT(ofByteArray(data)).uri(testHandlerBasicURI).build();
@@ -117,7 +116,8 @@ public class PostPutTest {
                 .build();
     }
 
-    @Test(dataProvider = "variants")
+    @ParameterizedTest
+    @MethodSource("variants")
     public void testOver64kPUT(HttpRequest req, String testMessage) {
         testLog.println("PostPutTest: Performing test: " + testMessage);
         HttpClient hc = HttpClient.newBuilder().version(HTTP_2).build();
diff --git a/test/jdk/java/net/httpclient/http2/PushPromiseContinuation.java b/test/jdk/java/net/httpclient/http2/PushPromiseContinuation.java
index e9c6447e600..2d5b5dd4f4e 100644
--- a/test/jdk/java/net/httpclient/http2/PushPromiseContinuation.java
+++ b/test/jdk/java/net/httpclient/http2/PushPromiseContinuation.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2022, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2022, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -31,10 +31,9 @@
  * @build jdk.test.lib.net.SimpleSSLContext jdk.httpclient.test.lib.http2.Http2TestServer
  *        jdk.httpclient.test.lib.http2.BodyOutputStream
  *        jdk.httpclient.test.lib.http2.OutgoingPushPromise
- * @run testng/othervm PushPromiseContinuation
+ * @run junit/othervm PushPromiseContinuation
  */
 
-
 import javax.net.ssl.SSLSession;
 import java.io.ByteArrayInputStream;
 import java.io.IOException;
@@ -68,14 +67,13 @@ import jdk.internal.net.http.common.HttpHeadersBuilder;
 import jdk.internal.net.http.frame.ContinuationFrame;
 import jdk.internal.net.http.frame.HeaderFrame;
 
-import org.testng.TestException;
-import org.testng.annotations.AfterTest;
-import org.testng.annotations.BeforeMethod;
-import org.testng.annotations.BeforeTest;
-import org.testng.annotations.Test;
-
 import static java.nio.charset.StandardCharsets.UTF_8;
-import static org.testng.Assert.*;
+
+import org.junit.jupiter.api.AfterAll;
+import org.junit.jupiter.api.BeforeAll;
+import org.junit.jupiter.api.BeforeEach;
+import org.junit.jupiter.api.Test;
+import static org.junit.jupiter.api.Assertions.*;
 
 
 public class PushPromiseContinuation {
@@ -85,8 +83,8 @@ public class PushPromiseContinuation {
     static volatile int continuationCount;
     static final String mainPromiseBody = "Main Promise Body";
     static final String mainResponseBody = "Main Response Body";
-    Http2TestServer server;
-    URI uri;
+    private static Http2TestServer server;
+    private static URI uri;
 
     // Set up simple client-side push promise handler
     ConcurrentMap<HttpRequest, CompletableFuture<HttpResponse<String>>> pushPromiseMap = new ConcurrentHashMap<>();
@@ -95,13 +93,13 @@ public class PushPromiseContinuation {
         pushPromiseMap.put(pushRequest, acceptor.apply(s));
     };
 
-    @BeforeMethod
+    @BeforeEach
     public void beforeMethod() {
         pushPromiseMap = new ConcurrentHashMap<>();
     }
 
-    @BeforeTest
-    public void setup() throws Exception {
+    @BeforeAll
+    public static void setup() throws Exception {
         server = new Http2TestServer(false, 0);
         server.addHandler(new ServerPushHandler(), "/");
 
@@ -115,9 +113,8 @@ public class PushPromiseContinuation {
         uri = new URI("http://localhost:" + port + "/");
     }
 
-    @AfterTest
-    public void teardown() {
-        pushPromiseMap = null;
+    @AfterAll
+    public static void teardown() {
         server.stop();
     }
 
@@ -195,29 +192,29 @@ public class PushPromiseContinuation {
         CompletableFuture<HttpResponse<String>> cf =
                 client.sendAsync(hreq, HttpResponse.BodyHandlers.ofString(UTF_8), pph);
 
-        CompletionException t = expectThrows(CompletionException.class, () -> cf.join());
-        assertEquals(t.getCause().getClass(), ProtocolException.class,
+        CompletionException t = assertThrows(CompletionException.class, () -> cf.join());
+        assertEquals(ProtocolException.class, t.getCause().getClass(),
                 "Expected a ProtocolException but got " + t.getCause());
         System.err.println("Client received the following expected exception: " + t.getCause());
         faultyServer.stop();
     }
 
     private void verify(HttpResponse<String> resp) {
-        assertEquals(resp.statusCode(), 200);
-        assertEquals(resp.body(), mainResponseBody);
+        assertEquals(200, resp.statusCode());
+        assertEquals(mainResponseBody, resp.body());
         if (pushPromiseMap.size() > 1) {
             System.err.println(pushPromiseMap.entrySet());
-            throw new TestException("Results map size is greater than 1");
+            fail("Results map size is greater than 1");
         } else {
             // This will only iterate once
             for (HttpRequest r : pushPromiseMap.keySet()) {
                 HttpResponse<String> serverPushResp = pushPromiseMap.get(r).join();
                 // Received headers should be the same as the combined PushPromise
                 // frame headers combined with the Continuation frame headers
-                assertEquals(testHeaders, r.headers());
+                assertEquals(r.headers(), testHeaders);
                 // Check status code and push promise body are as expected
-                assertEquals(serverPushResp.statusCode(), 200);
-                assertEquals(serverPushResp.body(), mainPromiseBody);
+                assertEquals(200, serverPushResp.statusCode());
+                assertEquals(mainPromiseBody, serverPushResp.body());
             }
         }
     }
diff --git a/test/jdk/java/net/httpclient/http2/RedirectTest.java b/test/jdk/java/net/httpclient/http2/RedirectTest.java
index e2acd807bd5..201b56513f6 100644
--- a/test/jdk/java/net/httpclient/http2/RedirectTest.java
+++ b/test/jdk/java/net/httpclient/http2/RedirectTest.java
@@ -30,7 +30,7 @@
  *        jdk.httpclient.test.lib.http2.Http2RedirectHandler
  *        jdk.test.lib.Asserts
  *        jdk.test.lib.net.SimpleSSLContext
- * @run testng/othervm
+ * @run junit/othervm
  *      -Djdk.httpclient.HttpClient.log=frames,ssl,requests,responses,errors
  *      -Djdk.internal.httpclient.debug=true
  *      RedirectTest
@@ -52,9 +52,10 @@ import jdk.httpclient.test.lib.common.HttpServerAdapters;
 import jdk.httpclient.test.lib.http2.Http2TestServer;
 import jdk.httpclient.test.lib.http2.Http2TestExchange;
 import jdk.httpclient.test.lib.http2.Http2RedirectHandler;
-import org.testng.annotations.Test;
 import static java.net.http.HttpClient.Version.HTTP_2;
 
+import org.junit.jupiter.api.Test;
+
 public class RedirectTest implements HttpServerAdapters {
     static int httpPort;
     static HttpTestServer httpServer;
@@ -135,7 +136,7 @@ public class RedirectTest implements HttpServerAdapters {
     }
 
     @Test
-    public static void test() throws Exception {
+    public void test() throws Exception {
         try {
             initialize();
             simpleTest();
diff --git a/test/jdk/java/net/httpclient/http2/ServerPush.java b/test/jdk/java/net/httpclient/http2/ServerPush.java
index 7f9c82fb28b..d38b867132b 100644
--- a/test/jdk/java/net/httpclient/http2/ServerPush.java
+++ b/test/jdk/java/net/httpclient/http2/ServerPush.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2015, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2015, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -29,7 +29,7 @@
  * @build jdk.httpclient.test.lib.http2.Http2TestServer
  *        jdk.httpclient.test.lib.http2.PushHandler
  *        jdk.test.lib.Utils
- * @run testng/othervm
+ * @run junit/othervm
  *      -Djdk.httpclient.HttpClient.log=errors,requests,responses
  *      ServerPush
  */
@@ -48,13 +48,14 @@ import java.util.concurrent.*;
 import java.util.function.Consumer;
 import jdk.httpclient.test.lib.http2.Http2TestServer;
 import jdk.httpclient.test.lib.http2.PushHandler;
-import org.testng.annotations.AfterTest;
-import org.testng.annotations.BeforeTest;
-import org.testng.annotations.Test;
 
 import static java.nio.charset.StandardCharsets.UTF_8;
 import static jdk.test.lib.Utils.createTempFileOfSize;
-import static org.testng.Assert.*;
+
+import org.junit.jupiter.api.AfterAll;
+import org.junit.jupiter.api.BeforeAll;
+import org.junit.jupiter.api.Test;
+import static org.junit.jupiter.api.Assertions.*;
 
 public class ServerPush {
 
@@ -66,11 +67,11 @@ public class ServerPush {
 
     static Path tempFile;
 
-    Http2TestServer server;
-    URI uri;
+    private static Http2TestServer server;
+    private static URI uri;
 
-    @BeforeTest
-    public void setup() throws Exception {
+    @BeforeAll
+    public static void setup() throws Exception {
         tempFile = createTempFileOfSize(TEMP_FILE_PREFIX, null, FILE_SIZE);
         server = new Http2TestServer(false, 0);
         server.addHandler(new PushHandler(tempFile, LOOPS), "/");
@@ -82,8 +83,8 @@ public class ServerPush {
         uri = new URI("http://localhost:" + port + "/foo/a/b/c");
     }
 
-    @AfterTest
-    public void teardown() {
+    @AfterAll
+    public static void teardown() {
         server.stop();
     }
 
@@ -109,10 +110,10 @@ public class ServerPush {
         System.err.println("results.size: " + resultMap.size());
         for (HttpRequest r : resultMap.keySet()) {
             HttpResponse<String> response = resultMap.get(r).join();
-            assertEquals(response.statusCode(), 200);
-            assertEquals(response.body(), tempFileAsString);
+            assertEquals(200, response.statusCode());
+            assertEquals(tempFileAsString, response.body());
         }
-        assertEquals(resultMap.size(), LOOPS + 1);
+        assertEquals(LOOPS + 1, resultMap.size());
     }
 
     // Test 2 - of(...) populating the given Map, everything as a String
@@ -135,10 +136,10 @@ public class ServerPush {
         System.err.println("results.size: " + resultMap.size());
         for (HttpRequest r : resultMap.keySet()) {
             HttpResponse<String> response = resultMap.get(r).join();
-            assertEquals(response.statusCode(), 200);
-            assertEquals(response.body(), tempFileAsString);
+            assertEquals(200, response.statusCode());
+            assertEquals(tempFileAsString, response.body());
         }
-        assertEquals(resultMap.size(), LOOPS + 1);
+        assertEquals(LOOPS + 1, resultMap.size());
     }
 
     // --- Path ---
@@ -177,11 +178,11 @@ public class ServerPush {
 
         for (HttpRequest r : resultsMap.keySet()) {
             HttpResponse<Path> response = resultsMap.get(r).join();
-            assertEquals(response.statusCode(), 200);
+            assertEquals(200, response.statusCode());
             String fileAsString = new String(Files.readAllBytes(response.body()), UTF_8);
-            assertEquals(fileAsString, tempFileAsString);
+            assertEquals(tempFileAsString, fileAsString);
         }
-        assertEquals(resultsMap.size(),  LOOPS + 1);
+        assertEquals(LOOPS + 1, resultsMap.size());
     }
 
     // Test 4 - of(...) populating the given Map, everything as a Path
@@ -204,11 +205,11 @@ public class ServerPush {
 
         for (HttpRequest r : resultsMap.keySet()) {
             HttpResponse<Path> response = resultsMap.get(r).join();
-            assertEquals(response.statusCode(), 200);
+            assertEquals(200, response.statusCode());
             String fileAsString = new String(Files.readAllBytes(response.body()), UTF_8);
-            assertEquals(fileAsString, tempFileAsString);
+            assertEquals(tempFileAsString, fileAsString);
         }
-        assertEquals(resultsMap.size(),  LOOPS + 1);
+        assertEquals(LOOPS + 1, resultsMap.size());
     }
 
     // ---  Consumer<byte[]> ---
@@ -263,12 +264,12 @@ public class ServerPush {
 
         for (HttpRequest r : resultsMap.keySet()) {
             HttpResponse<Void> response = resultsMap.get(r).join();
-            assertEquals(response.statusCode(), 200);
+            assertEquals(200, response.statusCode());
             byte[] ba = byteArrayConsumerMap.get(r).getAccumulatedBytes();
             String result = new String(ba, UTF_8);
-            assertEquals(result, tempFileAsString);
+            assertEquals(tempFileAsString, result);
         }
-        assertEquals(resultsMap.size(), LOOPS + 1);
+        assertEquals(LOOPS + 1, resultsMap.size());
     }
 
     // Test 6 - of(...) populating the given Map, everything as a consumer of optional byte[]
@@ -301,11 +302,11 @@ public class ServerPush {
 
         for (HttpRequest r : resultsMap.keySet()) {
             HttpResponse<Void> response = resultsMap.get(r).join();
-            assertEquals(response.statusCode(), 200);
+            assertEquals(200, response.statusCode());
             byte[] ba = byteArrayConsumerMap.get(r).getAccumulatedBytes();
             String result = new String(ba, UTF_8);
-            assertEquals(result, tempFileAsString);
+            assertEquals(tempFileAsString, result);
         }
-        assertEquals(resultsMap.size(), LOOPS + 1);
+        assertEquals(LOOPS + 1, resultsMap.size());
     }
 }
diff --git a/test/jdk/java/net/httpclient/http2/ServerPushWithDiffTypes.java b/test/jdk/java/net/httpclient/http2/ServerPushWithDiffTypes.java
index 3e12a20c15e..9cf2a3f7ae2 100644
--- a/test/jdk/java/net/httpclient/http2/ServerPushWithDiffTypes.java
+++ b/test/jdk/java/net/httpclient/http2/ServerPushWithDiffTypes.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2023, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,7 +25,7 @@
  * @test
  * @library /test/lib /test/jdk/java/net/httpclient/lib
  * @build jdk.test.lib.net.SimpleSSLContext jdk.httpclient.test.lib.http2.Http2TestServer
- * @run testng/othervm
+ * @run junit/othervm
  *       -Djdk.internal.httpclient.debug=true
  *       -Djdk.httpclient.HttpClient.log=errors,requests,responses
  *       ServerPushWithDiffTypes
@@ -47,9 +47,10 @@ import jdk.httpclient.test.lib.http2.Http2TestServer;
 import jdk.httpclient.test.lib.http2.Http2TestExchange;
 import jdk.httpclient.test.lib.http2.Http2Handler;
 
-import org.testng.annotations.Test;
 import static java.nio.charset.StandardCharsets.UTF_8;
-import static org.testng.Assert.assertEquals;
+
+import org.junit.jupiter.api.Test;
+import static org.junit.jupiter.api.Assertions.assertEquals;
 
 public class ServerPushWithDiffTypes {
 
@@ -66,7 +67,7 @@ public class ServerPushWithDiffTypes {
     );
 
     @Test
-    public static void test() throws Exception {
+    public void test() throws Exception {
         Http2TestServer server = null;
         try {
             server = new Http2TestServer(false, 0);
@@ -93,7 +94,7 @@ public class ServerPushWithDiffTypes {
             results.put(request, cf);
             cf.join();
 
-            assertEquals(results.size(), PUSH_PROMISES.size() + 1);
+            assertEquals(PUSH_PROMISES.size() + 1, results.size());
 
             for (HttpRequest r : results.keySet()) {
                 URI u = r.uri();
@@ -116,7 +117,7 @@ public class ServerPushWithDiffTypes {
                 String expected = PUSH_PROMISES.get(r.uri().getPath());
                 if (expected == null)
                     expected = "the main response body";
-                assertEquals(result, expected);
+                assertEquals(expected, result);
             }
         } finally {
             server.stop();
diff --git a/test/jdk/java/net/httpclient/http2/SimpleGet.java b/test/jdk/java/net/httpclient/http2/SimpleGet.java
index 692a6583b63..5df3174f820 100644
--- a/test/jdk/java/net/httpclient/http2/SimpleGet.java
+++ b/test/jdk/java/net/httpclient/http2/SimpleGet.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2015, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2015, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -27,11 +27,11 @@
  * @library /test/lib /test/jdk/java/net/httpclient/lib
  * @build jdk.test.lib.net.SimpleSSLContext jdk.httpclient.test.lib.common.TestUtil
  *        jdk.httpclient.test.lib.http2.Http2TestServer
- * @run testng/othervm -XX:+CrashOnOutOfMemoryError SimpleGet
- * @run testng/othervm -XX:+CrashOnOutOfMemoryError
+ * @run junit/othervm -XX:+CrashOnOutOfMemoryError SimpleGet
+ * @run junit/othervm -XX:+CrashOnOutOfMemoryError
  *                     -Dsimpleget.repeat=1 -Dsimpleget.chunks=1 -Dsimpleget.requests=1000
  *                     SimpleGet
- * @run testng/othervm -Dsimpleget.requests=150
+ * @run junit/othervm -Dsimpleget.requests=150
  *                     -Dsimpleget.chunks=16384
  *                     -Djdk.httpclient.redirects.retrylimit=5
  *                     -Djdk.httpclient.HttpClient.log=errors
@@ -62,11 +62,12 @@ import javax.net.ssl.SSLContext;
 
 import jdk.httpclient.test.lib.common.HttpServerAdapters;
 import jdk.test.lib.net.SimpleSSLContext;
-import org.testng.Assert;
-import org.testng.annotations.Test;
 
 import static java.net.http.HttpClient.Version.HTTP_2;
 
+import org.junit.jupiter.api.Test;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+
 public class SimpleGet implements HttpServerAdapters {
     static HttpTestServer httpsServer;
     static HttpClient client = null;
@@ -117,11 +118,11 @@ public class SimpleGet implements HttpServerAdapters {
     }
 
     public static void main(String[] args) throws Exception {
-        test();
+        new SimpleGet().test();
     }
 
     @Test
-    public static void test() throws Exception {
+    public void test() throws Exception {
         try {
             long prestart = System.nanoTime();
             initialize();
@@ -132,7 +133,7 @@ public class SimpleGet implements HttpServerAdapters {
                     .GET().build();
             long start = System.nanoTime();
             var resp = client.send(request, BodyHandlers.ofByteArrayConsumer(b -> {}));
-            Assert.assertEquals(resp.statusCode(), 200);
+            assertEquals(200, resp.statusCode());
             long elapsed = System.nanoTime() - start;
             System.out.println("Stat: First request took: " + elapsed + " nanos (" + TimeUnit.NANOSECONDS.toMillis(elapsed) + " ms)");
             final int max = property("simpleget.requests", 50);
@@ -163,7 +164,7 @@ public class SimpleGet implements HttpServerAdapters {
                             + connections.size() + " connections");
                 }
             }
-            list.forEach((cf) -> Assert.assertEquals(cf.join().statusCode(), 200));
+            list.forEach((cf) -> assertEquals(200, cf.join().statusCode()));
         } catch (Throwable tt) {
             System.err.println("tt caught");
             tt.printStackTrace();
diff --git a/test/jdk/java/net/httpclient/http2/StreamFlowControlTest.java b/test/jdk/java/net/httpclient/http2/StreamFlowControlTest.java
index 3edf0b71305..a36fe29813c 100644
--- a/test/jdk/java/net/httpclient/http2/StreamFlowControlTest.java
+++ b/test/jdk/java/net/httpclient/http2/StreamFlowControlTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2024, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2024, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -26,7 +26,7 @@
  * @bug 8342075 8343855
  * @library /test/lib /test/jdk/java/net/httpclient/lib
  * @build jdk.httpclient.test.lib.http2.Http2TestServer jdk.test.lib.net.SimpleSSLContext
- * @run testng/othervm  -Djdk.internal.httpclient.debug=true
+ * @run junit/othervm  -Djdk.internal.httpclient.debug=true
  *                      -Djdk.httpclient.connectionWindowSize=65535
  *                      -Djdk.httpclient.windowsize=16384
  *                      StreamFlowControlTest
@@ -65,30 +65,30 @@ import jdk.internal.net.http.common.HttpHeadersBuilder;
 import jdk.internal.net.http.frame.SettingsFrame;
 import jdk.test.lib.Utils;
 import jdk.test.lib.net.SimpleSSLContext;
-import org.testng.annotations.AfterTest;
-import org.testng.annotations.BeforeTest;
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
 
 import static java.util.concurrent.TimeUnit.NANOSECONDS;
-import static org.testng.Assert.assertEquals;
-import static org.testng.Assert.fail;
+
+import org.junit.jupiter.api.AfterAll;
+import org.junit.jupiter.api.BeforeAll;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.fail;
 
 public class StreamFlowControlTest {
 
     private static final SSLContext sslContext = SimpleSSLContext.findSSLContext();
-    HttpTestServer http2TestServer;   // HTTP/2 ( h2c )
-    HttpTestServer https2TestServer;  // HTTP/2 ( h2  )
-    String http2URI;
-    String https2URI;
-    final AtomicInteger reqid = new AtomicInteger();
+    private static HttpTestServer http2TestServer;   // HTTP/2 ( h2c )
+    private static HttpTestServer https2TestServer;  // HTTP/2 ( h2  )
+    private static String http2URI;
+    private static String https2URI;
+    private static final AtomicInteger reqid = new AtomicInteger();
     final static int WINDOW =
             Integer.getInteger("jdk.httpclient.windowsize", 2 * 16 * 1024);
 
 
 
-    @DataProvider(name = "variants")
-    public Object[][] variants() {
+    public static Object[][] variants() {
         return new Object[][] {
                 { http2URI,  false },
                 { https2URI, false },
@@ -111,7 +111,8 @@ public class StreamFlowControlTest {
     }
 
 
-    @Test(dataProvider = "variants")
+    @ParameterizedTest
+    @MethodSource("variants")
     void test(String uri,
               boolean sameClient)
         throws Exception
@@ -142,7 +143,7 @@ public class StreamFlowControlTest {
                     if (sameClient) {
                         String key = response.headers().firstValue("X-Connection-Key").get();
                         if (label == null) label = key;
-                        assertEquals(key, label, "Unexpected key for " + query);
+                        assertEquals(label, key, "Unexpected key for " + query);
                     }
                     sent.join();
                     // we have to pull to get the exception, but slow enough
@@ -175,7 +176,8 @@ public class StreamFlowControlTest {
 
     }
 
-    @Test(dataProvider = "variants")
+    @ParameterizedTest
+    @MethodSource("variants")
     void testAsync(String uri,
                    boolean sameClient)
     {
@@ -207,7 +209,7 @@ public class StreamFlowControlTest {
                     if (sameClient) {
                         String key = response.headers().firstValue("X-Connection-Key").get();
                         if (label == null) label = key;
-                        assertEquals(key, label, "Unexpected key for " + query);
+                        assertEquals(label, key, "Unexpected key for " + query);
                     }
                     sent.join();
                     long wait = uri.startsWith("https://") ? 800 : 350;
@@ -264,38 +266,38 @@ public class StreamFlowControlTest {
         }
     }
 
-    @BeforeTest
-    public void setup() throws Exception {
-        var http2TestServer = new Http2TestServer("localhost", false, 0);
-        http2TestServer.addHandler(new Http2TestHandler(), "/http2/");
-        this.http2TestServer = HttpTestServer.of(http2TestServer);
-        http2URI = "http://" + this.http2TestServer.serverAuthority() + "/http2/x";
+    @BeforeAll
+    public static void setup() throws Exception {
+        var http2TestServerImpl = new Http2TestServer("localhost", false, 0);
+        http2TestServerImpl.addHandler(new Http2TestHandler(), "/http2/");
+        http2TestServer = HttpTestServer.of(http2TestServerImpl);
+        http2URI = "http://" + http2TestServer.serverAuthority() + "/http2/x";
 
-        var https2TestServer = new Http2TestServer("localhost", true, sslContext);
-        https2TestServer.addHandler(new Http2TestHandler(), "/https2/");
-        this.https2TestServer = HttpTestServer.of(https2TestServer);
-        this.https2TestServer.addHandler(new HttpHeadOrGetHandler(), "/https2/head/");
-        https2URI = "https://" + this.https2TestServer.serverAuthority() + "/https2/x";
-        String h2Head = "https://" + this.https2TestServer.serverAuthority() + "/https2/head/z";
+        var https2TestServerImpl = new Http2TestServer("localhost", true, sslContext);
+        https2TestServerImpl.addHandler(new Http2TestHandler(), "/https2/");
+        https2TestServer = HttpTestServer.of(https2TestServerImpl);
+        https2TestServer.addHandler(new HttpHeadOrGetHandler(), "/https2/head/");
+        https2URI = "https://" + https2TestServer.serverAuthority() + "/https2/x";
+        String h2Head = "https://" + https2TestServer.serverAuthority() + "/https2/head/z";
 
         // Override the default exchange supplier with a custom one to enable
         // particular test scenarios
-        http2TestServer.setExchangeSupplier(FCHttp2TestExchange::new);
-        https2TestServer.setExchangeSupplier(FCHttp2TestExchange::new);
+        http2TestServerImpl.setExchangeSupplier(FCHttp2TestExchange::new);
+        https2TestServerImpl.setExchangeSupplier(FCHttp2TestExchange::new);
 
-        this.http2TestServer.start();
-        this.https2TestServer.start();
+        http2TestServer.start();
+        https2TestServer.start();
 
         // warmup to eliminate delay due to SSL class loading and initialization.
         try (var client = HttpClient.newBuilder().sslContext(sslContext).build()) {
             var request = HttpRequest.newBuilder(URI.create(h2Head)).HEAD().build();
             var resp = client.send(request, BodyHandlers.discarding());
-            assertEquals(resp.statusCode(), 200);
+            assertEquals(200, resp.statusCode());
         }
     }
 
-    @AfterTest
-    public void teardown() throws Exception {
+    @AfterAll
+    public static void teardown() throws Exception {
         http2TestServer.stop();
         https2TestServer.stop();
     }
diff --git a/test/jdk/java/net/httpclient/http2/TrailingHeadersTest.java b/test/jdk/java/net/httpclient/http2/TrailingHeadersTest.java
index 9fa6f8b728e..9ea331d2d84 100644
--- a/test/jdk/java/net/httpclient/http2/TrailingHeadersTest.java
+++ b/test/jdk/java/net/httpclient/http2/TrailingHeadersTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2023, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2023, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -28,7 +28,7 @@
  * @bug 8296410
  * @library /test/jdk/java/net/httpclient/lib
  * @build jdk.httpclient.test.lib.http2.Http2TestServer
- * @run testng/othervm -Djdk.httpclient.HttpClient.log=all TrailingHeadersTest
+ * @run junit/othervm -Djdk.httpclient.HttpClient.log=all TrailingHeadersTest
  */
 
 import jdk.httpclient.test.lib.http2.OutgoingPushPromise;
@@ -36,11 +36,6 @@ import jdk.internal.net.http.common.HttpHeadersBuilder;
 import jdk.internal.net.http.frame.DataFrame;
 import jdk.internal.net.http.frame.HeaderFrame;
 import jdk.internal.net.http.frame.HeadersFrame;
-import org.testng.annotations.AfterTest;
-import org.testng.annotations.BeforeMethod;
-import org.testng.annotations.BeforeTest;
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
 
 import javax.net.ssl.SSLSession;
 import java.io.ByteArrayInputStream;
@@ -74,24 +69,30 @@ import jdk.httpclient.test.lib.http2.BodyOutputStream;
 
 import static java.net.http.HttpClient.Version.HTTP_2;
 import static java.nio.charset.StandardCharsets.UTF_8;
-import static org.testng.Assert.assertEquals;
+
+import org.junit.jupiter.api.AfterAll;
+import org.junit.jupiter.api.BeforeAll;
+import org.junit.jupiter.api.BeforeEach;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
+import static org.junit.jupiter.api.Assertions.assertEquals;
 
 public class TrailingHeadersTest {
 
-    Http2TestServer http2TestServer;
-    URI trailingURI, trailng1xxURI, trailingPushPromiseURI, warmupURI;
+    private static Http2TestServer http2TestServer;
+    private static URI trailingURI, trailng1xxURI, trailingPushPromiseURI, warmupURI;
     static PrintStream testLog = System.err;
 
     // Set up simple client-side push promise handler
-    ConcurrentMap<HttpRequest, CompletableFuture<HttpResponse<String>>> pushPromiseMap = new ConcurrentHashMap<>();
+    private static ConcurrentMap<HttpRequest, CompletableFuture<HttpResponse<String>>> pushPromiseMap = new ConcurrentHashMap<>();
 
-    @BeforeMethod
+    @BeforeEach
     public void beforeMethod() {
         pushPromiseMap = new ConcurrentHashMap<>();
     }
 
-    @BeforeTest
-    public void setup() throws Exception {
+    @BeforeAll
+    public static void setup() throws Exception {
         Properties props = new Properties();
         // For triggering trailing headers to send after Push Promise Response headers are sent
         props.setProperty("sendTrailingHeadersAfterPushPromise", "1");
@@ -119,12 +120,13 @@ public class TrailingHeadersTest {
         warmupURI = URI.create("http://" + http2TestServer.serverAuthority() + "/WarmupHandler");
     }
 
-    @AfterTest
-    public void teardown() {
+    @AfterAll
+    public static void teardown() {
         http2TestServer.stop();
     }
 
-    @Test(dataProvider = "httpRequests")
+    @ParameterizedTest
+    @MethodSource("uris")
     public void testTrailingHeaders(String description, HttpRequest hRequest, HttpResponse.PushPromiseHandler<String> pph) {
         testLog.println("testTrailingHeaders(): " + description);
         HttpClient httpClient = HttpClient.newBuilder().build();
@@ -134,7 +136,7 @@ public class TrailingHeadersTest {
         testLog.println("testTrailingHeaders(): Performing request: " + hRequest);
         HttpResponse<String> resp = cf.join();
 
-        assertEquals(resp.statusCode(), 200, "Status code of response should be 200");
+        assertEquals(200, resp.statusCode(), "Status code of response should be 200");
 
         // Verify Push Promise was successful if necessary
         if (pph != null)
@@ -144,14 +146,14 @@ public class TrailingHeadersTest {
     }
 
     private void verifyPushPromise()  {
-        assertEquals(pushPromiseMap.size(), 1, "Push Promise should not be greater than 1");
+        assertEquals(1, pushPromiseMap.size(), "Push Promise should not be greater than 1");
         // This will only iterate once
         for (HttpRequest r : pushPromiseMap.keySet()) {
             CompletableFuture<HttpResponse<String>> serverPushResp = pushPromiseMap.get(r);
             // Get the push promise HttpResponse result if present
             HttpResponse<String> resp = serverPushResp.join();
-            assertEquals(resp.body(), "Sample_Push_Data", "Unexpected Push Promise response body");
-            assertEquals(resp.statusCode(), 200, "Status code of Push Promise response should be 200");
+            assertEquals("Sample_Push_Data", resp.body(), "Unexpected Push Promise response body");
+            assertEquals(200, resp.statusCode(), "Status code of Push Promise response should be 200");
         }
     }
 
@@ -162,11 +164,10 @@ public class TrailingHeadersTest {
         httpClient.sendAsync(warmupReq, BodyHandlers.discarding()).join();
     }
 
-    @DataProvider(name = "httpRequests")
-    public Object[][] uris() {
+    public static Object[][] uris() {
         HttpResponse.PushPromiseHandler<String> pph = (initial, pushRequest, acceptor) -> {
             HttpResponse.BodyHandler<String> s = HttpResponse.BodyHandlers.ofString(UTF_8);
-            pushPromiseMap.put(pushRequest, acceptor.apply(s));
+            TrailingHeadersTest.pushPromiseMap.put(pushRequest, acceptor.apply(s));
         };
 
         HttpRequest httpGetTrailing = HttpRequest.newBuilder(trailingURI).version(HTTP_2)
diff --git a/test/jdk/java/net/httpclient/http2/java.net.http/jdk/internal/net/http/hpack/HeaderTableTest.java b/test/jdk/java/net/httpclient/http2/java.net.http/jdk/internal/net/http/hpack/HeaderTableTest.java
index 0eb1714da35..07e27a7f2fa 100644
--- a/test/jdk/java/net/httpclient/http2/java.net.http/jdk/internal/net/http/hpack/HeaderTableTest.java
+++ b/test/jdk/java/net/httpclient/http2/java.net.http/jdk/internal/net/http/hpack/HeaderTableTest.java
@@ -29,9 +29,9 @@ import java.util.HashSet;
 import java.util.Map;
 import java.util.Set;
 
-import org.junit.jupiter.api.Assertions;
-import static org.junit.jupiter.api.Assertions.assertEquals;
 import org.junit.jupiter.api.Test;
+import static org.junit.jupiter.api.Assertions.assertTrue;
+import static org.junit.jupiter.api.Assertions.assertEquals;
 
 public class HeaderTableTest extends SimpleHeaderTableTest {
 
@@ -76,7 +76,7 @@ public class HeaderTableTest extends SimpleHeaderTableTest {
             Set<Integer> expectedIndexes = indexes.get(hName);
             int actualMinimalIndex = table.indexOf(hName, "blah-blah");
 
-            Assertions.assertTrue(expectedIndexes.contains(-actualMinimalIndex));
+            assertTrue(expectedIndexes.contains(-actualMinimalIndex));
         });
     }
 

From dfea6eb9f84142aaa3e51181ea345e8575729ea2 Mon Sep 17 00:00:00 2001
From: Daniel Fuchs <dfuchs@openjdk.org>
Date: Thu, 5 Mar 2026 11:13:15 +0000
Subject: [PATCH 054/655] 8378598: Refactor tests under
 test/jdk/java/net/httpclient/websocket from TestNG to JUnit

Reviewed-by: vyazici
---
 .../java/net/httpclient/websocket/Abort.java  | 31 ++++----
 .../httpclient/websocket/AutomaticPong.java   | 32 +++++----
 .../websocket/BlowupOutputQueue.java          |  9 ++-
 .../websocket/HandshakeUrlEncodingTest.java   | 50 ++++++-------
 .../websocket/HeaderWriterDriver.java         |  4 +-
 .../httpclient/websocket/MaskerDriver.java    |  4 +-
 .../websocket/MessageQueueDriver.java         |  4 +-
 .../websocket/PendingBinaryPingClose.java     | 12 ++--
 .../websocket/PendingBinaryPongClose.java     | 12 ++--
 .../websocket/PendingOperations.java          | 12 ++--
 .../websocket/PendingPingBinaryClose.java     | 12 ++--
 .../websocket/PendingPingTextClose.java       | 12 ++--
 .../websocket/PendingPongBinaryClose.java     | 12 ++--
 .../websocket/PendingPongTextClose.java       | 12 ++--
 .../websocket/PendingTextPingClose.java       | 12 ++--
 .../websocket/PendingTextPongClose.java       | 12 ++--
 .../httpclient/websocket/ReaderDriver.java    |  6 +-
 .../httpclient/websocket/SecureSupport.java   | 11 +--
 .../net/httpclient/websocket/SendTest.java    | 16 ++---
 .../net/httpclient/websocket/Support.java     |  6 +-
 .../websocket/WSHandshakeExceptionTest.java   | 55 +++++++--------
 .../websocket/WebSocketBuilderTest.java       | 32 ++++-----
 .../websocket/WebSocketExtendedTest.java      | 70 ++++++++++---------
 .../websocket/WebSocketProxyTest.java         | 28 ++++----
 .../httpclient/websocket/WebSocketTest.java   | 42 ++++++-----
 .../net/http/websocket/HeaderWriterTest.java  |  9 +--
 .../net/http/websocket/MaskerTest.java        | 20 +++---
 .../net/http/websocket/MessageQueueTest.java  | 44 ++++++------
 .../net/http/websocket/ReaderTest.java        | 25 +++----
 .../websocket/security/WSSanityTest.java      | 37 +++++-----
 30 files changed, 333 insertions(+), 310 deletions(-)

diff --git a/test/jdk/java/net/httpclient/websocket/Abort.java b/test/jdk/java/net/httpclient/websocket/Abort.java
index 99c94de83f0..a6088f8cce2 100644
--- a/test/jdk/java/net/httpclient/websocket/Abort.java
+++ b/test/jdk/java/net/httpclient/websocket/Abort.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2019, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -24,12 +24,11 @@
 /*
  * @test
  * @build DummyWebSocketServer
- * @run testng/othervm
+ * @run junit/othervm
  *      -Djdk.internal.httpclient.websocket.debug=true
  *       Abort
  */
 
-import org.testng.annotations.Test;
 
 import java.io.IOException;
 import java.net.ProtocolException;
@@ -44,10 +43,12 @@ import java.util.concurrent.TimeoutException;
 
 import static java.net.http.HttpClient.newHttpClient;
 import static java.net.http.WebSocket.NORMAL_CLOSURE;
-import static org.testng.Assert.assertEquals;
-import static org.testng.Assert.assertThrows;
-import static org.testng.Assert.assertTrue;
-import static org.testng.Assert.fail;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertThrows;
+import static org.junit.jupiter.api.Assertions.assertTrue;
+import static org.junit.jupiter.api.Assertions.fail;
+import org.junit.jupiter.api.Test;
 
 public class Abort {
 
@@ -79,7 +80,7 @@ public class Abort {
                 TimeUnit.SECONDS.sleep(5);
                 List<MockListener.Invocation> inv = listener.invocationsSoFar();
                 // no more invocations after onOpen as WebSocket was aborted
-                assertEquals(inv, List.of(MockListener.Invocation.onOpen(webSocket)));
+                assertEquals(List.of(MockListener.Invocation.onOpen(webSocket)), inv);
             } finally {
                 webSocket.abort();
             }
@@ -119,7 +120,7 @@ public class Abort {
                 List<MockListener.Invocation> expected = List.of(
                         MockListener.Invocation.onOpen(webSocket),
                         MockListener.Invocation.onText(webSocket, "", true));
-                assertEquals(inv, expected);
+                assertEquals(expected, inv);
             } finally {
                 webSocket.abort();
             }
@@ -159,7 +160,7 @@ public class Abort {
                 List<MockListener.Invocation> expected = List.of(
                         MockListener.Invocation.onOpen(webSocket),
                         MockListener.Invocation.onBinary(webSocket, ByteBuffer.allocate(0), true));
-                assertEquals(inv, expected);
+                assertEquals(expected, inv);
             } finally {
                 webSocket.abort();
             }
@@ -198,7 +199,7 @@ public class Abort {
                 List<MockListener.Invocation> expected = List.of(
                         MockListener.Invocation.onOpen(webSocket),
                         MockListener.Invocation.onPing(webSocket, ByteBuffer.allocate(0)));
-                assertEquals(inv, expected);
+                assertEquals(expected, inv);
             } finally {
                 webSocket.abort();
             }
@@ -237,7 +238,7 @@ public class Abort {
                 List<MockListener.Invocation> expected = List.of(
                         MockListener.Invocation.onOpen(webSocket),
                         MockListener.Invocation.onPong(webSocket, ByteBuffer.allocate(0)));
-                assertEquals(inv, expected);
+                assertEquals(expected, inv);
             } finally {
                 webSocket.abort();
             }
@@ -277,7 +278,7 @@ public class Abort {
                 List<MockListener.Invocation> expected = List.of(
                         MockListener.Invocation.onOpen(webSocket),
                         MockListener.Invocation.onClose(webSocket, 1005, ""));
-                assertEquals(inv, expected);
+                assertEquals(expected, inv);
             } finally {
                 webSocket.abort();
             }
@@ -318,7 +319,7 @@ public class Abort {
                         MockListener.Invocation.onOpen(webSocket),
                         MockListener.Invocation.onError(webSocket, ProtocolException.class));
                 System.out.println("actual invocations:" + Arrays.toString(inv.toArray()));
-                assertEquals(inv, expected);
+                assertEquals(expected, inv);
             } finally {
                 webSocket.abort();
             }
@@ -396,7 +397,7 @@ public class Abort {
                         ws.abort();
                         assertTrue(ws.isInputClosed());
                         assertTrue(ws.isOutputClosed());
-                        assertEquals(ws.getSubprotocol(), "");
+                        assertEquals("", ws.getSubprotocol());
                     }
                     // at this point valid requests MUST be a no-op:
                     for (int j = 0; j < 3; j++) {
diff --git a/test/jdk/java/net/httpclient/websocket/AutomaticPong.java b/test/jdk/java/net/httpclient/websocket/AutomaticPong.java
index 1999781b82f..b438cb8e728 100644
--- a/test/jdk/java/net/httpclient/websocket/AutomaticPong.java
+++ b/test/jdk/java/net/httpclient/websocket/AutomaticPong.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -24,13 +24,11 @@
 /*
  * @test
  * @build DummyWebSocketServer
- * @run testng/othervm
+ * @run junit/othervm
  *      -Djdk.internal.httpclient.websocket.debug=true
  *       AutomaticPong
  */
 import jdk.internal.net.http.websocket.Frame;
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
 
 import java.io.IOException;
 import java.net.http.WebSocket;
@@ -39,10 +37,14 @@ import java.nio.charset.StandardCharsets;
 import java.util.List;
 
 import static java.net.http.HttpClient.newHttpClient;
-import static org.testng.Assert.assertEquals;
-import static org.testng.Assert.assertFalse;
-import static org.testng.Assert.assertTrue;
-import static org.testng.Assert.fail;
+
+import org.junit.jupiter.api.Test;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertFalse;
+import static org.junit.jupiter.api.Assertions.assertTrue;
+import static org.junit.jupiter.api.Assertions.fail;
 
 public class AutomaticPong {
     /*
@@ -86,7 +88,7 @@ public class AutomaticPong {
                         MockListener.Invocation.onPing(webSocket, hello),
                         MockListener.Invocation.onClose(webSocket, 1005, "")
                 );
-                assertEquals(actual, expected);
+                assertEquals(expected, actual);
             } finally {
                 webSocket.abort();
             }
@@ -104,7 +106,8 @@ public class AutomaticPong {
      *     b) the last Pong corresponds to the last Ping
      *     c) there are no unrelated Pongs
      */
-    @Test(dataProvider = "nPings")
+    @ParameterizedTest
+    @MethodSource("nPings")
     public void automaticPongs(int nPings) throws Exception {
         // big enough to not bother with resize
         ByteBuffer buffer = ByteBuffer.allocate(65536);
@@ -133,7 +136,7 @@ public class AutomaticPong {
                     .join();
             try {
                 List<MockListener.Invocation> inv = listener.invocations();
-                assertEquals(inv.size(), nPings + 2); // n * onPing + onOpen + onClose
+                assertEquals(nPings + 2, inv.size()); // n * onPing + onOpen + onClose
 
                 ByteBuffer data = server.read();
                 Frame.Reader reader = new Frame.Reader();
@@ -171,7 +174,7 @@ public class AutomaticPong {
                             closed = true;
                             return;
                         }
-                        assertEquals(value, Frame.Opcode.PONG);
+                        assertEquals(Frame.Opcode.PONG, value);
                     }
 
                     @Override
@@ -182,7 +185,7 @@ public class AutomaticPong {
                     @Override
                     public void payloadLen(long value) {
                         if (!closed)
-                            assertEquals(value, 4);
+                            assertEquals(4, value);
                     }
 
                     @Override
@@ -222,8 +225,7 @@ public class AutomaticPong {
     }
 
 
-    @DataProvider(name = "nPings")
-    public Object[][] nPings() {
+    public static Object[][] nPings() {
         return new Object[][]{{1}, {2}, {4}, {8}, {9}, {256}};
     }
 }
diff --git a/test/jdk/java/net/httpclient/websocket/BlowupOutputQueue.java b/test/jdk/java/net/httpclient/websocket/BlowupOutputQueue.java
index 7bf2564a04f..1865ca05e4f 100644
--- a/test/jdk/java/net/httpclient/websocket/BlowupOutputQueue.java
+++ b/test/jdk/java/net/httpclient/websocket/BlowupOutputQueue.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2022, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -24,14 +24,12 @@
 /*
  * @test
  * @build DummyWebSocketServer
- * @run testng/othervm
+ * @run junit/othervm
  *      -Djdk.internal.httpclient.debug=true
  *      -Djdk.internal.httpclient.websocket.debug=true
  *       BlowupOutputQueue
  */
 
-import org.testng.annotations.Test;
-
 import java.io.IOException;
 import java.net.http.WebSocket;
 import java.nio.ByteBuffer;
@@ -43,7 +41,8 @@ import java.util.concurrent.CountDownLatch;
 import java.util.concurrent.TimeUnit;
 import java.util.concurrent.TimeoutException;
 
-import static org.testng.Assert.assertFalse;
+import org.junit.jupiter.api.Test;
+import static org.junit.jupiter.api.Assertions.assertFalse;
 
 public class BlowupOutputQueue extends PendingOperations {
 
diff --git a/test/jdk/java/net/httpclient/websocket/HandshakeUrlEncodingTest.java b/test/jdk/java/net/httpclient/websocket/HandshakeUrlEncodingTest.java
index 25a6893ff13..6854cacbcc2 100644
--- a/test/jdk/java/net/httpclient/websocket/HandshakeUrlEncodingTest.java
+++ b/test/jdk/java/net/httpclient/websocket/HandshakeUrlEncodingTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2020, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -29,7 +29,7 @@
  * @build jdk.test.lib.net.SimpleSSLContext jdk.httpclient.test.lib.common.TestServerConfigurator
  * @modules java.net.http/jdk.internal.net.http.common
  *          jdk.httpserver
- * @run testng/othervm -Djdk.internal.httpclient.debug=true HandshakeUrlEncodingTest
+ * @run junit/othervm -Djdk.internal.httpclient.debug=true HandshakeUrlEncodingTest
  */
 
 import com.sun.net.httpserver.HttpHandler;
@@ -39,10 +39,6 @@ import com.sun.net.httpserver.HttpExchange;
 import jdk.httpclient.test.lib.common.TestServerConfigurator;
 import jdk.test.lib.net.SimpleSSLContext;
 import jdk.test.lib.net.URIBuilder;
-import org.testng.annotations.AfterTest;
-import org.testng.annotations.BeforeTest;
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
 
 import javax.net.ssl.SSLContext;
 import java.io.IOException;
@@ -58,20 +54,25 @@ import java.util.concurrent.CompletionException;
 import java.util.concurrent.ExecutionException;
 import java.util.concurrent.ExecutorService;
 import java.util.concurrent.Executors;
-
 import static java.net.http.HttpClient.Builder.NO_PROXY;
-import static org.testng.Assert.assertEquals;
-import static org.testng.Assert.assertNotNull;
-import static org.testng.Assert.fail;
 import static java.lang.System.out;
 
+import org.junit.jupiter.api.AfterAll;
+import org.junit.jupiter.api.BeforeAll;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertNotNull;
+import static org.junit.jupiter.api.Assertions.fail;
+
+
 public class HandshakeUrlEncodingTest {
 
     private static final SSLContext sslContext = SimpleSSLContext.findSSLContext();
-    HttpServer httpTestServer;
-    HttpsServer httpsTestServer;
-    String httpURI;
-    String httpsURI;
+    private static HttpServer httpTestServer;
+    private static HttpsServer httpsTestServer;
+    private static String httpURI;
+    private static String httpsURI;
 
     static String queryPart;
 
@@ -79,8 +80,7 @@ public class HandshakeUrlEncodingTest {
     // a shared executor helps reduce the amount of threads created by the test
     static final ExecutorService executor = Executors.newCachedThreadPool();
 
-    @DataProvider(name = "variants")
-    public Object[][] variants() {
+    public static Object[][] variants() {
         return new Object[][]{
             { httpURI,   false },
             { httpsURI,  false },
@@ -97,7 +97,8 @@ public class HandshakeUrlEncodingTest {
                          .build();
     }
 
-    @Test(dataProvider = "variants")
+    @ParameterizedTest
+    @MethodSource("variants")
     public void test(String uri, boolean sameClient) {
         HttpClient client = null;
         out.println("The url is " + uri);
@@ -119,22 +120,21 @@ public class HandshakeUrlEncodingTest {
                 final WebSocketHandshakeException wse = (WebSocketHandshakeException) t;
                 assertNotNull(wse.getResponse());
                 assertNotNull(wse.getResponse().uri());
-                assertNotNull(wse.getResponse().statusCode());
                 final String rawQuery = wse.getResponse().uri().getRawQuery();
                 final String expectedRawQuery = "&raw=abc+def/ghi=xyz&encoded=abc%2Bdef%2Fghi%3Dxyz";
-                assertEquals(rawQuery, expectedRawQuery);
+                assertEquals(expectedRawQuery, rawQuery);
                 final String body = (String) wse.getResponse().body();
                 final String expectedBody = "/?" + expectedRawQuery;
-                assertEquals(body, expectedBody);
+                assertEquals(expectedBody, body);
                 out.println("Status code is " + wse.getResponse().statusCode());
                 out.println("Response is " + wse.getResponse());
-                assertEquals(wse.getResponse().statusCode(), 400);
+                assertEquals(400, wse.getResponse().statusCode());
             }
         }
     }
 
-    @BeforeTest
-    public void setup() throws Exception {
+    @BeforeAll
+    public static void setup() throws Exception {
         InetSocketAddress sa = new InetSocketAddress(InetAddress.getLoopbackAddress(), 0);
         queryPart = "?&raw=abc+def/ghi=xyz&encoded=abc%2Bdef%2Fghi%3Dxyz";
         httpTestServer = HttpServer.create(sa, 10);
@@ -164,8 +164,8 @@ public class HandshakeUrlEncodingTest {
         httpsTestServer.start();
     }
 
-    @AfterTest
-    public void teardown() {
+    @AfterAll
+    public static void teardown() {
         httpTestServer.stop(0);
         httpsTestServer.stop(0);
         executor.shutdownNow();
diff --git a/test/jdk/java/net/httpclient/websocket/HeaderWriterDriver.java b/test/jdk/java/net/httpclient/websocket/HeaderWriterDriver.java
index 6293b1b6c71..75ae5423f00 100644
--- a/test/jdk/java/net/httpclient/websocket/HeaderWriterDriver.java
+++ b/test/jdk/java/net/httpclient/websocket/HeaderWriterDriver.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2016, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2016, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,7 +25,7 @@
  * @test
  * @bug 8159053
  * @modules java.net.http/jdk.internal.net.http.websocket:open
- * @run testng/othervm
+ * @run junit/othervm
  *      --add-reads java.net.http=ALL-UNNAMED
  *      java.net.http/jdk.internal.net.http.websocket.HeaderWriterTest
  */
diff --git a/test/jdk/java/net/httpclient/websocket/MaskerDriver.java b/test/jdk/java/net/httpclient/websocket/MaskerDriver.java
index b84ea1fff5c..e81417c25ef 100644
--- a/test/jdk/java/net/httpclient/websocket/MaskerDriver.java
+++ b/test/jdk/java/net/httpclient/websocket/MaskerDriver.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2016, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2016, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,7 +25,7 @@
  * @test
  * @bug 8159053
  * @modules java.net.http/jdk.internal.net.http.websocket:open
- * @run testng/othervm
+ * @run junit/othervm
  *      --add-reads java.net.http=ALL-UNNAMED
  *      java.net.http/jdk.internal.net.http.websocket.MaskerTest
  */
diff --git a/test/jdk/java/net/httpclient/websocket/MessageQueueDriver.java b/test/jdk/java/net/httpclient/websocket/MessageQueueDriver.java
index 9831bb59297..68a23d0be88 100644
--- a/test/jdk/java/net/httpclient/websocket/MessageQueueDriver.java
+++ b/test/jdk/java/net/httpclient/websocket/MessageQueueDriver.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,7 +25,7 @@
  * @test
  * @bug 8159053
  * @modules java.net.http/jdk.internal.net.http.websocket:open
- * @run testng/othervm
+ * @run junit/othervm
  *      --add-reads java.net.http=ALL-UNNAMED
  *      java.net.http/jdk.internal.net.http.websocket.MessageQueueTest
  */
diff --git a/test/jdk/java/net/httpclient/websocket/PendingBinaryPingClose.java b/test/jdk/java/net/httpclient/websocket/PendingBinaryPingClose.java
index 5a410251593..4a5ae315e91 100644
--- a/test/jdk/java/net/httpclient/websocket/PendingBinaryPingClose.java
+++ b/test/jdk/java/net/httpclient/websocket/PendingBinaryPingClose.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -24,28 +24,30 @@
 /*
  * @test
  * @build DummyWebSocketServer
- * @run testng/othervm
+ * @run junit/othervm
  *      -Djdk.httpclient.sendBufferSize=8192
  *      -Djdk.internal.httpclient.debug=true
  *      -Djdk.internal.httpclient.websocket.debug=true
  *       PendingBinaryPingClose
  */
 
-import org.testng.annotations.Test;
-
 import java.net.http.WebSocket;
 import java.nio.ByteBuffer;
 import java.util.concurrent.CompletableFuture;
 import java.util.concurrent.TimeUnit;
 import java.util.concurrent.TimeoutException;
 
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
+
 public class PendingBinaryPingClose extends PendingOperations {
 
     CompletableFuture<WebSocket> cfBinary;
     CompletableFuture<WebSocket> cfPing;
     CompletableFuture<WebSocket> cfClose;
 
-    @Test(dataProvider = "booleans")
+    @ParameterizedTest
+    @MethodSource("booleans")
     public void pendingBinaryPingClose(boolean last) throws Exception {
         repeatable(() -> {
             server = Support.notReadingServer();
diff --git a/test/jdk/java/net/httpclient/websocket/PendingBinaryPongClose.java b/test/jdk/java/net/httpclient/websocket/PendingBinaryPongClose.java
index bef3d258850..a8330faeb3f 100644
--- a/test/jdk/java/net/httpclient/websocket/PendingBinaryPongClose.java
+++ b/test/jdk/java/net/httpclient/websocket/PendingBinaryPongClose.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -24,28 +24,30 @@
 /*
  * @test
  * @build DummyWebSocketServer
- * @run testng/othervm
+ * @run junit/othervm
  *      -Djdk.httpclient.sendBufferSize=8192
  *      -Djdk.internal.httpclient.debug=true
  *      -Djdk.internal.httpclient.websocket.debug=true
  *       PendingBinaryPongClose
  */
 
-import org.testng.annotations.Test;
-
 import java.net.http.WebSocket;
 import java.nio.ByteBuffer;
 import java.util.concurrent.CompletableFuture;
 import java.util.concurrent.TimeUnit;
 import java.util.concurrent.TimeoutException;
 
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
+
 public class PendingBinaryPongClose extends PendingOperations {
 
     CompletableFuture<WebSocket> cfBinary;
     CompletableFuture<WebSocket> cfPong;
     CompletableFuture<WebSocket> cfClose;
 
-    @Test(dataProvider = "booleans")
+    @ParameterizedTest
+    @MethodSource("booleans")
     public void pendingBinaryPongClose(boolean last) throws Exception {
         repeatable(() -> {
             server = Support.notReadingServer();
diff --git a/test/jdk/java/net/httpclient/websocket/PendingOperations.java b/test/jdk/java/net/httpclient/websocket/PendingOperations.java
index b4d7d7e2222..32350a1ab41 100644
--- a/test/jdk/java/net/httpclient/websocket/PendingOperations.java
+++ b/test/jdk/java/net/httpclient/websocket/PendingOperations.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2020, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -21,9 +21,6 @@
  * questions.
  */
 
-import org.testng.annotations.AfterMethod;
-import org.testng.annotations.DataProvider;
-
 import java.io.IOException;
 import java.net.http.HttpClient;
 import java.net.http.WebSocket;
@@ -35,6 +32,8 @@ import java.util.function.BooleanSupplier;
 import static java.net.http.HttpClient.Builder.NO_PROXY;
 import static java.net.http.HttpClient.newBuilder;
 
+import org.junit.jupiter.api.AfterEach;
+
 /* Common infrastructure for tests that check pending operations */
 public class PendingOperations {
 
@@ -54,7 +53,7 @@ public class PendingOperations {
         return newBuilder().proxy(NO_PROXY).build();
     }
 
-    @AfterMethod
+    @AfterEach
     public void cleanup() {
         // make sure we have a trace both on System.out and System.err
         // to help with diagnosis.
@@ -85,8 +84,7 @@ public class PendingOperations {
         Support.assertNotDone(future);
     }
 
-    @DataProvider(name = "booleans")
-    public Object[][] booleans() {
+    public static Object[][] booleans() {
         return new Object[][]{{Boolean.TRUE}, {Boolean.FALSE}};
     }
 
diff --git a/test/jdk/java/net/httpclient/websocket/PendingPingBinaryClose.java b/test/jdk/java/net/httpclient/websocket/PendingPingBinaryClose.java
index c1c314395e8..e07ebe0d03a 100644
--- a/test/jdk/java/net/httpclient/websocket/PendingPingBinaryClose.java
+++ b/test/jdk/java/net/httpclient/websocket/PendingPingBinaryClose.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -24,7 +24,7 @@
 /*
  * @test
  * @build DummyWebSocketServer
- * @run testng/othervm
+ * @run junit/othervm
  *      -Djdk.httpclient.sendBufferSize=8192
  *       PendingPingBinaryClose
  */
@@ -33,21 +33,23 @@
 // *      -Djdk.internal.httpclient.debug=true
 // *      -Djdk.internal.httpclient.websocket.debug=true
 
-import org.testng.annotations.Test;
-
 import java.net.http.WebSocket;
 import java.nio.ByteBuffer;
 import java.util.concurrent.CompletableFuture;
 import java.util.concurrent.TimeUnit;
 import java.util.concurrent.TimeoutException;
 
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
+
 public class PendingPingBinaryClose extends PendingOperations {
 
     CompletableFuture<WebSocket> cfBinary;
     CompletableFuture<WebSocket> cfPing;
     CompletableFuture<WebSocket> cfClose;
 
-    @Test(dataProvider = "booleans")
+    @ParameterizedTest
+    @MethodSource("booleans")
     public void pendingPingBinaryClose(boolean last) throws Exception {
         repeatable( () -> {
             server = Support.notReadingServer();
diff --git a/test/jdk/java/net/httpclient/websocket/PendingPingTextClose.java b/test/jdk/java/net/httpclient/websocket/PendingPingTextClose.java
index 82666fafe67..eae01f804a4 100644
--- a/test/jdk/java/net/httpclient/websocket/PendingPingTextClose.java
+++ b/test/jdk/java/net/httpclient/websocket/PendingPingTextClose.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -24,7 +24,7 @@
 /*
  * @test
  * @build DummyWebSocketServer
- * @run testng/othervm
+ * @run junit/othervm
  *      -Djdk.httpclient.sendBufferSize=8192
  *       PendingPingTextClose
  */
@@ -33,14 +33,15 @@
 // *      -Djdk.internal.httpclient.debug=true
 // *      -Djdk.internal.httpclient.websocket.debug=true
 
-import org.testng.annotations.Test;
-
 import java.net.http.WebSocket;
 import java.nio.ByteBuffer;
 import java.util.concurrent.CompletableFuture;
 import java.util.concurrent.TimeUnit;
 import java.util.concurrent.TimeoutException;
 
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
+
 public class PendingPingTextClose extends PendingOperations {
 
     static boolean debug = false; // avoid too verbose output
@@ -48,7 +49,8 @@ public class PendingPingTextClose extends PendingOperations {
     CompletableFuture<WebSocket> cfPing;
     CompletableFuture<WebSocket> cfClose;
 
-    @Test(dataProvider = "booleans")
+    @ParameterizedTest
+    @MethodSource("booleans")
     public void pendingPingTextClose(boolean last) throws Exception {
         try {
             repeatable(() -> {
diff --git a/test/jdk/java/net/httpclient/websocket/PendingPongBinaryClose.java b/test/jdk/java/net/httpclient/websocket/PendingPongBinaryClose.java
index 0aa2f24c660..32640853b00 100644
--- a/test/jdk/java/net/httpclient/websocket/PendingPongBinaryClose.java
+++ b/test/jdk/java/net/httpclient/websocket/PendingPongBinaryClose.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -24,7 +24,7 @@
 /*
  * @test
  * @build DummyWebSocketServer
- * @run testng/othervm
+ * @run junit/othervm
  *      -Djdk.httpclient.sendBufferSize=8192
  *       PendingPongBinaryClose
  */
@@ -33,21 +33,23 @@
 // *      -Djdk.internal.httpclient.debug=true
 // *      -Djdk.internal.httpclient.websocket.debug=true
 
-import org.testng.annotations.Test;
-
 import java.net.http.WebSocket;
 import java.nio.ByteBuffer;
 import java.util.concurrent.CompletableFuture;
 import java.util.concurrent.TimeUnit;
 import java.util.concurrent.TimeoutException;
 
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
+
 public class PendingPongBinaryClose extends PendingOperations {
 
     CompletableFuture<WebSocket> cfBinary;
     CompletableFuture<WebSocket> cfPong;
     CompletableFuture<WebSocket> cfClose;
 
-    @Test(dataProvider = "booleans")
+    @ParameterizedTest
+    @MethodSource("booleans")
     public void pendingPongBinaryClose(boolean last) throws Exception {
         repeatable( () -> {
             server = Support.notReadingServer();
diff --git a/test/jdk/java/net/httpclient/websocket/PendingPongTextClose.java b/test/jdk/java/net/httpclient/websocket/PendingPongTextClose.java
index f919a6706ad..f4d6c84c2f5 100644
--- a/test/jdk/java/net/httpclient/websocket/PendingPongTextClose.java
+++ b/test/jdk/java/net/httpclient/websocket/PendingPongTextClose.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -24,7 +24,7 @@
 /*
  * @test
  * @build DummyWebSocketServer
- * @run testng/othervm
+ * @run junit/othervm
  *      -Djdk.httpclient.sendBufferSize=8192
  *       PendingPongTextClose
  */
@@ -33,21 +33,23 @@
 // *      -Djdk.internal.httpclient.debug=true
 // *      -Djdk.internal.httpclient.websocket.debug=true
 
-import org.testng.annotations.Test;
-
 import java.net.http.WebSocket;
 import java.nio.ByteBuffer;
 import java.util.concurrent.CompletableFuture;
 import java.util.concurrent.TimeUnit;
 import java.util.concurrent.TimeoutException;
 
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
+
 public class PendingPongTextClose extends PendingOperations {
 
     CompletableFuture<WebSocket> cfText;
     CompletableFuture<WebSocket> cfPong;
     CompletableFuture<WebSocket> cfClose;
 
-    @Test(dataProvider = "booleans")
+    @ParameterizedTest
+    @MethodSource("booleans")
     public void pendingPongTextClose(boolean last) throws Exception {
         repeatable( () -> {
             server = Support.notReadingServer();
diff --git a/test/jdk/java/net/httpclient/websocket/PendingTextPingClose.java b/test/jdk/java/net/httpclient/websocket/PendingTextPingClose.java
index 39c8bbdc444..76f12430804 100644
--- a/test/jdk/java/net/httpclient/websocket/PendingTextPingClose.java
+++ b/test/jdk/java/net/httpclient/websocket/PendingTextPingClose.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -24,15 +24,13 @@
 /*
  * @test
  * @build DummyWebSocketServer
- * @run testng/othervm
+ * @run junit/othervm
  *      -Djdk.internal.httpclient.debug=true
  *      -Djdk.internal.httpclient.websocket.debug=true
  *      -Djdk.httpclient.sendBufferSize=8192
  *       PendingTextPingClose
  */
 
-import org.testng.annotations.Test;
-
 import java.net.http.WebSocket;
 import java.nio.ByteBuffer;
 import java.nio.CharBuffer;
@@ -40,13 +38,17 @@ import java.util.concurrent.CompletableFuture;
 import java.util.concurrent.TimeUnit;
 import java.util.concurrent.TimeoutException;
 
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
+
 public class PendingTextPingClose extends PendingOperations {
 
     CompletableFuture<WebSocket> cfText;
     CompletableFuture<WebSocket> cfPing;
     CompletableFuture<WebSocket> cfClose;
 
-    @Test(dataProvider = "booleans")
+    @ParameterizedTest
+    @MethodSource("booleans")
     public void pendingTextPingClose(boolean last) throws Exception {
         repeatable(() -> {
             server = Support.notReadingServer();
diff --git a/test/jdk/java/net/httpclient/websocket/PendingTextPongClose.java b/test/jdk/java/net/httpclient/websocket/PendingTextPongClose.java
index 8fa90400760..a2a41a73d7b 100644
--- a/test/jdk/java/net/httpclient/websocket/PendingTextPongClose.java
+++ b/test/jdk/java/net/httpclient/websocket/PendingTextPongClose.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -24,15 +24,13 @@
 /*
  * @test
  * @build DummyWebSocketServer
- * @run testng/othervm
+ * @run junit/othervm
  *      -Djdk.internal.httpclient.debug=true
  *      -Djdk.internal.httpclient.websocket.debug=true
  *      -Djdk.httpclient.sendBufferSize=8192
  *       PendingTextPongClose
  */
 
-import org.testng.annotations.Test;
-
 import java.net.http.WebSocket;
 import java.nio.ByteBuffer;
 import java.nio.CharBuffer;
@@ -40,13 +38,17 @@ import java.util.concurrent.CompletableFuture;
 import java.util.concurrent.TimeUnit;
 import java.util.concurrent.TimeoutException;
 
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
+
 public class PendingTextPongClose extends PendingOperations {
 
     CompletableFuture<WebSocket> cfText;
     CompletableFuture<WebSocket> cfPong;
     CompletableFuture<WebSocket> cfClose;
 
-    @Test(dataProvider = "booleans")
+    @ParameterizedTest
+    @MethodSource("booleans")
     public void pendingTextPongClose(boolean last) throws Exception {
         repeatable(() -> {
             server = Support.notReadingServer();
diff --git a/test/jdk/java/net/httpclient/websocket/ReaderDriver.java b/test/jdk/java/net/httpclient/websocket/ReaderDriver.java
index 0b874792b4f..3e195be046d 100644
--- a/test/jdk/java/net/httpclient/websocket/ReaderDriver.java
+++ b/test/jdk/java/net/httpclient/websocket/ReaderDriver.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2016, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2016, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,6 +25,8 @@
  * @test
  * @bug 8159053
  * @modules java.net.http/jdk.internal.net.http.websocket:open
- * @run testng/othervm/timeout=240 --add-reads java.net.http=ALL-UNNAMED java.net.http/jdk.internal.net.http.websocket.ReaderTest
+ * @run junit/othervm/timeout=240
+ *          --add-reads java.net.http=ALL-UNNAMED
+ *          java.net.http/jdk.internal.net.http.websocket.ReaderTest
  */
 public final class ReaderDriver { }
diff --git a/test/jdk/java/net/httpclient/websocket/SecureSupport.java b/test/jdk/java/net/httpclient/websocket/SecureSupport.java
index 8b565768c29..41709d2fedb 100644
--- a/test/jdk/java/net/httpclient/websocket/SecureSupport.java
+++ b/test/jdk/java/net/httpclient/websocket/SecureSupport.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2020, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -22,18 +22,9 @@
  */
 
 import java.io.IOException;
-import java.net.Socket;
 import java.nio.ByteBuffer;
-import java.nio.channels.SocketChannel;
 import java.nio.charset.StandardCharsets;
 import java.util.Arrays;
-import java.util.concurrent.CompletableFuture;
-import java.util.concurrent.CompletionException;
-import java.util.concurrent.CompletionStage;
-import java.util.concurrent.TimeUnit;
-import java.util.concurrent.TimeoutException;
-
-import static org.testng.Assert.assertThrows;
 
 /**
  * Helper class to create instances of DummySecureWebSocketServer which
diff --git a/test/jdk/java/net/httpclient/websocket/SendTest.java b/test/jdk/java/net/httpclient/websocket/SendTest.java
index 39021131156..b3a433b5c29 100644
--- a/test/jdk/java/net/httpclient/websocket/SendTest.java
+++ b/test/jdk/java/net/httpclient/websocket/SendTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2019, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -24,22 +24,22 @@
 /*
  * @test
  * @build DummyWebSocketServer
- * @run testng/othervm
+ * @run junit/othervm
  *      -Djdk.internal.httpclient.websocket.debug=true
  *       SendTest
  */
 
-import org.testng.annotations.Test;
-
 import java.io.IOException;
 import java.net.http.WebSocket;
 
 import static java.net.http.HttpClient.Builder.NO_PROXY;
 import static java.net.http.HttpClient.newBuilder;
 import static java.net.http.WebSocket.NORMAL_CLOSURE;
-import static org.testng.Assert.assertEquals;
-import static org.testng.Assert.assertThrows;
-import static org.testng.Assert.assertTrue;
+
+import org.junit.jupiter.api.Test;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertThrows;
+import static org.junit.jupiter.api.Assertions.assertTrue;
 
 public class SendTest {
 
@@ -90,7 +90,7 @@ public class SendTest {
             try {
                 webSocket.sendClose(NORMAL_CLOSURE, "").join();
                 assertTrue(webSocket.isOutputClosed());
-                assertEquals(webSocket.getSubprotocol(), "");
+                assertEquals("", webSocket.getSubprotocol());
                 webSocket.request(1); // No exceptions must be thrown
             } finally {
                 webSocket.abort();
diff --git a/test/jdk/java/net/httpclient/websocket/Support.java b/test/jdk/java/net/httpclient/websocket/Support.java
index 1323ae35105..73f840ff7eb 100644
--- a/test/jdk/java/net/httpclient/websocket/Support.java
+++ b/test/jdk/java/net/httpclient/websocket/Support.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -32,8 +32,8 @@ import java.util.concurrent.CompletionStage;
 import java.util.concurrent.TimeUnit;
 import java.util.concurrent.TimeoutException;
 
-import static org.testng.Assert.assertThrows;
-import static org.testng.Assert.assertFalse;
+import static org.junit.jupiter.api.Assertions.assertThrows;
+import static org.junit.jupiter.api.Assertions.assertFalse;
 
 public class Support {
 
diff --git a/test/jdk/java/net/httpclient/websocket/WSHandshakeExceptionTest.java b/test/jdk/java/net/httpclient/websocket/WSHandshakeExceptionTest.java
index 90db79dc8ef..f28d84b2f20 100644
--- a/test/jdk/java/net/httpclient/websocket/WSHandshakeExceptionTest.java
+++ b/test/jdk/java/net/httpclient/websocket/WSHandshakeExceptionTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2017, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2017, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -29,7 +29,7 @@
  * @build jdk.test.lib.net.SimpleSSLContext jdk.httpclient.test.lib.common.TestServerConfigurator
  * @modules java.net.http/jdk.internal.net.http.common
  *          jdk.httpserver
- * @run testng/othervm -Djdk.internal.httpclient.debug=true WSHandshakeExceptionTest
+ * @run junit/othervm -Djdk.internal.httpclient.debug=true WSHandshakeExceptionTest
  */
 
 import com.sun.net.httpserver.HttpHandler;
@@ -37,8 +37,6 @@ import com.sun.net.httpserver.HttpServer;
 import com.sun.net.httpserver.HttpsServer;
 import com.sun.net.httpserver.HttpExchange;
 
-
-
 import java.io.IOException;
 import java.io.InputStream;
 import java.io.OutputStream;
@@ -49,10 +47,6 @@ import java.net.http.WebSocketHandshakeException;
 
 import jdk.httpclient.test.lib.common.TestServerConfigurator;
 import jdk.test.lib.net.SimpleSSLContext;
-import org.testng.annotations.AfterTest;
-import org.testng.annotations.BeforeTest;
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
 import javax.net.ssl.SSLContext;
 import java.net.InetSocketAddress;
 import java.net.URI;
@@ -62,29 +56,33 @@ import java.util.concurrent.ExecutorService;
 import java.util.concurrent.Executors;
 
 import static java.net.http.HttpClient.Builder.NO_PROXY;
-import static org.testng.Assert.assertEquals;
-import static org.testng.Assert.assertNotNull;
-import static org.testng.Assert.assertTrue;
-import static org.testng.Assert.fail;
 import static java.lang.System.out;
 
+import org.junit.jupiter.api.AfterAll;
+import org.junit.jupiter.api.BeforeAll;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertNotNull;
+import static org.junit.jupiter.api.Assertions.assertTrue;
+import static org.junit.jupiter.api.Assertions.fail;
+
 public class WSHandshakeExceptionTest {
 
     private static final SSLContext sslContext = SimpleSSLContext.findSSLContext();
-    HttpServer httpTestServer;         // HTTP/1.1    [ 2 servers ]
-    HttpsServer httpsTestServer;       // HTTPS/1.1
-    String httpURI;
-    String httpsURI;
-    String httpNonUtf8URI;
-    String httpsNonUtf8URI;
-    HttpClient sharedClient;
+    private static HttpServer httpTestServer;         // HTTP/1.1    [ 2 servers ]
+    private static HttpsServer httpsTestServer;       // HTTPS/1.1
+    private static String httpURI;
+    private static String httpsURI;
+    private static String httpNonUtf8URI;
+    private static String httpsNonUtf8URI;
+    private static HttpClient sharedClient;
 
     static final int ITERATION_COUNT = 4;
     // a shared executor helps reduce the amount of threads created by the test
     static final ExecutorService executor = Executors.newCachedThreadPool();
 
-    @DataProvider(name = "variants")
-    public Object[][] variants() {
+    public static Object[][] variants() {
         return new Object[][]{
                 { httpURI,           false },
                 { httpsURI,          false },
@@ -106,7 +104,8 @@ public class WSHandshakeExceptionTest {
                          .build();
     }
 
-    @Test(dataProvider = "variants")
+    @ParameterizedTest
+    @MethodSource("variants")
     public void test(String uri, boolean sameClient) {
         HttpClient client = sharedClient;
         boolean pause;
@@ -132,7 +131,7 @@ public class WSHandshakeExceptionTest {
                 WebSocketHandshakeException wse = (WebSocketHandshakeException) t;
                 assertNotNull(wse.getResponse());
                 assertNotNull(wse.getResponse().body());
-                assertEquals(wse.getResponse().body().getClass(), String.class);
+                assertEquals(String.class, wse.getResponse().body().getClass());
                 String body = (String)wse.getResponse().body();
                 out.println("Status code is " + wse.getResponse().statusCode());
                 out.println("Response is " + body);
@@ -145,7 +144,7 @@ public class WSHandshakeExceptionTest {
                     // default HttpServer 404 body expected
                     assertTrue(body.contains("404"));
                 }
-                assertEquals(wse.getResponse().statusCode(), 404);
+                assertEquals(404, wse.getResponse().statusCode());
             }
         }
     }
@@ -159,8 +158,8 @@ public class WSHandshakeExceptionTest {
         }
     }
 
-    @BeforeTest
-    public void setup() throws Exception {
+    @BeforeAll
+    public static void setup() throws Exception {
         // HTTP/1.1
         InetSocketAddress sa = new InetSocketAddress(InetAddress.getLoopbackAddress(), 0);
         httpTestServer = HttpServer.create(sa, 0);
@@ -178,8 +177,8 @@ public class WSHandshakeExceptionTest {
         httpsTestServer.start();
     }
 
-    @AfterTest
-    public void teardown() {
+    @AfterAll
+    public static void teardown() {
         sharedClient = null;
         gc(100);
         httpTestServer.stop(0);
diff --git a/test/jdk/java/net/httpclient/websocket/WebSocketBuilderTest.java b/test/jdk/java/net/httpclient/websocket/WebSocketBuilderTest.java
index b28b8f59875..beef8cb42a4 100644
--- a/test/jdk/java/net/httpclient/websocket/WebSocketBuilderTest.java
+++ b/test/jdk/java/net/httpclient/websocket/WebSocketBuilderTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2016, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2016, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -26,12 +26,9 @@
  * @bug 8159053
  * @build DummyWebSocketServer
  *        Support
- * @run testng/othervm WebSocketBuilderTest
+ * @run junit/othervm WebSocketBuilderTest
  */
 
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
-
 import java.net.URI;
 import java.net.http.HttpClient;
 import java.net.http.WebSocket;
@@ -42,7 +39,10 @@ import java.util.function.Function;
 import java.util.stream.Collectors;
 import java.util.stream.Stream;
 
-import static org.testng.Assert.assertThrows;
+import org.junit.jupiter.api.Test;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
+import static org.junit.jupiter.api.Assertions.assertThrows;
 
 /*
  * In some places in this test a new String is created out of a string literal.
@@ -98,7 +98,8 @@ public final class WebSocketBuilderTest {
                              .connectTimeout(null));
     }
 
-    @Test(dataProvider = "badURIs")
+    @ParameterizedTest
+    @MethodSource("badURIs")
     void illegalURI(URI uri) {
         WebSocket.Builder b = HttpClient.newHttpClient().newWebSocketBuilder();
         assertFails(IllegalArgumentException.class,
@@ -129,7 +130,8 @@ public final class WebSocketBuilderTest {
     // TODO: test for bad syntax headers
     // TODO: test for overwrites (subprotocols) and additions (headers)
 
-    @Test(dataProvider = "badSubprotocols")
+    @ParameterizedTest
+    @MethodSource("badSubprotocols")
     public void illegalSubprotocolsSyntax(String s) {
         WebSocket.Builder b = HttpClient.newHttpClient()
                 .newWebSocketBuilder()
@@ -138,7 +140,8 @@ public final class WebSocketBuilderTest {
                     b.buildAsync(VALID_URI, listener()));
     }
 
-    @Test(dataProvider = "duplicatingSubprotocols")
+    @ParameterizedTest
+    @MethodSource("duplicatingSubprotocols")
     public void illegalSubprotocolsDuplicates(String mostPreferred,
                                               String[] lesserPreferred) {
         WebSocket.Builder b = HttpClient.newHttpClient()
@@ -148,7 +151,8 @@ public final class WebSocketBuilderTest {
                     b.buildAsync(VALID_URI, listener()));
     }
 
-    @Test(dataProvider = "badConnectTimeouts")
+    @ParameterizedTest
+    @MethodSource("badConnectTimeouts")
     public void illegalConnectTimeout(Duration d) {
         WebSocket.Builder b = HttpClient.newHttpClient()
                 .newWebSocketBuilder()
@@ -157,8 +161,7 @@ public final class WebSocketBuilderTest {
                     b.buildAsync(VALID_URI, listener()));
     }
 
-    @DataProvider
-    public Object[][] badURIs() {
+    public static Object[][] badURIs() {
         return new Object[][]{
                 {URI.create("http://example.com")},
                 {URI.create("ftp://example.com")},
@@ -167,8 +170,7 @@ public final class WebSocketBuilderTest {
         };
     }
 
-    @DataProvider
-    public Object[][] badConnectTimeouts() {
+    public static Object[][] badConnectTimeouts() {
         return new Object[][]{
                 {Duration.ofDays(0)},
                 {Duration.ofDays(-1)},
@@ -188,7 +190,6 @@ public final class WebSocketBuilderTest {
 
     // https://tools.ietf.org/html/rfc7230#section-3.2.6
     // https://tools.ietf.org/html/rfc20
-    @DataProvider
     public static Object[][] badSubprotocols() {
         return new Object[][]{
                 {""},
@@ -215,7 +216,6 @@ public final class WebSocketBuilderTest {
         };
     }
 
-    @DataProvider
     public static Object[][] duplicatingSubprotocols() {
         return new Object[][]{
                 {"a.b.c", new String[]{"a.b.c"}},
diff --git a/test/jdk/java/net/httpclient/websocket/WebSocketExtendedTest.java b/test/jdk/java/net/httpclient/websocket/WebSocketExtendedTest.java
index 0099104e872..56474555235 100644
--- a/test/jdk/java/net/httpclient/websocket/WebSocketExtendedTest.java
+++ b/test/jdk/java/net/httpclient/websocket/WebSocketExtendedTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -24,7 +24,7 @@
 /*
  * @test
  * @bug 8159053
- * @run testng/othervm
+ * @run junit/othervm
  *      -Djdk.internal.httpclient.websocket.debug=true
  *      -Djdk.internal.httpclient.debug=true
  *      -Djdk.httpclient.websocket.writeBufferSize=1024
@@ -32,8 +32,6 @@
  */
 
 import jdk.internal.net.http.websocket.Frame;
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
 
 import java.io.IOException;
 import java.net.http.WebSocket;
@@ -43,8 +41,11 @@ import java.util.List;
 import java.util.Random;
 import static java.net.http.HttpClient.Builder.NO_PROXY;
 import static java.net.http.HttpClient.newBuilder;
-import static org.testng.Assert.assertEquals;
-import static org.testng.Assert.assertTrue;
+
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertTrue;
 
 
 /*
@@ -52,7 +53,7 @@ import static org.testng.Assert.assertTrue;
  * possible fragmentation.
  */
 public class WebSocketExtendedTest {
-// * run testng/othervm
+// * run junit/othervm
 // *      -Djdk.httpclient.websocket.writeBufferSize=16
 // *      -Djdk.httpclient.sendBufferSize=32 WebSocketTextTest
 
@@ -65,7 +66,8 @@ public class WebSocketExtendedTest {
 
     // FIXME ensure subsequent (sendText/Binary, false) only CONTINUATIONs
 
-    @Test(dataProvider = "binary")
+    @ParameterizedTest
+    @MethodSource("binary")
     public void binary(ByteBuffer expected) throws IOException, InterruptedException {
         try (DummyWebSocketServer server = new DummyWebSocketServer()) {
             server.open();
@@ -76,15 +78,16 @@ public class WebSocketExtendedTest {
             ws.sendBinary(expected.duplicate(), true).join();
             ws.abort();
             List<DummyWebSocketServer.DecodedFrame> frames = server.readFrames();
-            assertEquals(frames.size(), 1);
+            assertEquals(1, frames.size());
             DummyWebSocketServer.DecodedFrame f = frames.get(0);
             assertTrue(f.last());
-            assertEquals(f.opcode(), Frame.Opcode.BINARY);
-            assertEquals(f.data(), expected);
+            assertEquals(Frame.Opcode.BINARY, f.opcode());
+            assertEquals(expected, f.data());
         }
     }
 
-    @Test(dataProvider = "pingPong")
+    @ParameterizedTest
+    @MethodSource("pingPongSizes")
     public void ping(ByteBuffer expected) throws Exception {
         try (DummyWebSocketServer server = new DummyWebSocketServer()) {
             server.open();
@@ -95,17 +98,18 @@ public class WebSocketExtendedTest {
             ws.sendPing(expected.duplicate()).join();
             ws.abort();
             List<DummyWebSocketServer.DecodedFrame> frames = server.readFrames();
-            assertEquals(frames.size(), 1);
+            assertEquals(1, frames.size());
             DummyWebSocketServer.DecodedFrame f = frames.get(0);
-            assertEquals(f.opcode(), Frame.Opcode.PING);
+            assertEquals(Frame.Opcode.PING, f.opcode());
             ByteBuffer actual = ByteBuffer.allocate(expected.remaining());
             actual.put(f.data());
             actual.flip();
-            assertEquals(actual, expected);
+            assertEquals(expected, actual);
         }
     }
 
-    @Test(dataProvider = "pingPong")
+    @ParameterizedTest
+    @MethodSource("pingPongSizes")
     public void pong(ByteBuffer expected) throws Exception {
         try (DummyWebSocketServer server = new DummyWebSocketServer()) {
             server.open();
@@ -116,17 +120,18 @@ public class WebSocketExtendedTest {
             ws.sendPong(expected.duplicate()).join();
             ws.abort();
             List<DummyWebSocketServer.DecodedFrame> frames = server.readFrames();
-            assertEquals(frames.size(), 1);
+            assertEquals(1, frames.size());
             DummyWebSocketServer.DecodedFrame f = frames.get(0);
-            assertEquals(f.opcode(), Frame.Opcode.PONG);
+            assertEquals(Frame.Opcode.PONG, f.opcode());
             ByteBuffer actual = ByteBuffer.allocate(expected.remaining());
             actual.put(f.data());
             actual.flip();
-            assertEquals(actual, expected);
+            assertEquals(expected, actual);
         }
     }
 
-    @Test(dataProvider = "close")
+    @ParameterizedTest
+    @MethodSource("closeArguments")
     public void close(int statusCode, String reason) throws Exception {
         try (DummyWebSocketServer server = new DummyWebSocketServer()) {
             server.open();
@@ -137,18 +142,19 @@ public class WebSocketExtendedTest {
             ws.sendClose(statusCode, reason).join();
             ws.abort();
             List<DummyWebSocketServer.DecodedFrame> frames = server.readFrames();
-            assertEquals(frames.size(), 1);
+            assertEquals(1, frames.size());
             DummyWebSocketServer.DecodedFrame f = frames.get(0);
-            assertEquals(f.opcode(), Frame.Opcode.CLOSE);
+            assertEquals(Frame.Opcode.CLOSE, f.opcode());
             ByteBuffer actual = ByteBuffer.allocate(Frame.MAX_CONTROL_FRAME_PAYLOAD_LENGTH);
             actual.put(f.data());
             actual.flip();
-            assertEquals(actual.getChar(), statusCode);
-            assertEquals(StandardCharsets.UTF_8.decode(actual).toString(), reason);
+            assertEquals(statusCode, actual.getChar());
+            assertEquals(reason, StandardCharsets.UTF_8.decode(actual).toString());
         }
     }
 
-    @Test(dataProvider = "text")
+    @ParameterizedTest
+    @MethodSource("texts")
     public void text(String expected) throws Exception {
         try (DummyWebSocketServer server = new DummyWebSocketServer()) {
             server.open();
@@ -163,12 +169,11 @@ public class WebSocketExtendedTest {
             ByteBuffer actual = ByteBuffer.allocate(maxBytes);
             frames.stream().forEachOrdered(f -> actual.put(f.data()));
             actual.flip();
-            assertEquals(StandardCharsets.UTF_8.decode(actual).toString(), expected);
+            assertEquals(expected, StandardCharsets.UTF_8.decode(actual).toString());
         }
     }
 
-    @DataProvider(name = "pingPong")
-    public Object[][] pingPongSizes() {
+    public static Object[][] pingPongSizes() {
         return new Object[][]{
                 {bytes(  0)},
                 {bytes(  1)},
@@ -177,8 +182,7 @@ public class WebSocketExtendedTest {
         };
     }
 
-    @DataProvider(name = "close")
-    public Object[][] closeArguments() {
+    public static Object[][] closeArguments() {
         return new Object[][]{
                 {WebSocket.NORMAL_CLOSURE, utf8String( 0)},
                 {WebSocket.NORMAL_CLOSURE, utf8String( 1)},
@@ -216,16 +220,14 @@ public class WebSocketExtendedTest {
         return str.toString();
     }
 
-    @DataProvider(name = "text")
-    public Object[][] texts() {
+    public static Object[][] texts() {
         return new Object[][]{
                 {utf8String(   0)},
                 {utf8String(1024)},
         };
     }
 
-    @DataProvider(name = "binary")
-    public Object[][] binary() {
+    public static Object[][] binary() {
         return new Object[][]{
                 {bytes(   0)},
                 {bytes(1024)},
diff --git a/test/jdk/java/net/httpclient/websocket/WebSocketProxyTest.java b/test/jdk/java/net/httpclient/websocket/WebSocketProxyTest.java
index 46758b2fe6e..a410aa9fe75 100644
--- a/test/jdk/java/net/httpclient/websocket/WebSocketProxyTest.java
+++ b/test/jdk/java/net/httpclient/websocket/WebSocketProxyTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2019, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2019, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -28,7 +28,7 @@
  * @library /test/lib
  * @compile SecureSupport.java DummySecureWebSocketServer.java ../ProxyServer.java
  * @build jdk.test.lib.net.SimpleSSLContext WebSocketProxyTest
- * @run testng/othervm
+ * @run junit/othervm
  *         -Djdk.internal.httpclient.debug=true
  *         -Djdk.internal.httpclient.websocket.debug=true
  *         -Djdk.httpclient.HttpClient.log=errors,requests,headers
@@ -61,16 +61,18 @@ import java.util.function.Supplier;
 import java.util.stream.Collectors;
 
 import jdk.test.lib.net.SimpleSSLContext;
-import org.testng.annotations.BeforeMethod;
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
 
 import javax.net.ssl.SSLContext;
 
 import static java.net.http.HttpClient.newBuilder;
 import static java.nio.charset.StandardCharsets.UTF_8;
-import static org.testng.Assert.assertEquals;
-import static org.testng.FileAssert.fail;
+
+import org.junit.jupiter.api.BeforeEach;
+import org.junit.jupiter.api.Test;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.fail;
 
 public class WebSocketProxyTest {
 
@@ -132,8 +134,7 @@ public class WebSocketProxyTest {
             @Override public String toString() { return "AUTH_TUNNELING_PROXY_SERVER"; }
         };
 
-    @DataProvider(name = "servers")
-    public Object[][] servers() {
+    public static Object[][] servers() {
         return new Object[][] {
             { SERVER_WITH_CANNED_DATA,       TUNNELING_PROXY_SERVER      },
             { SERVER_WITH_CANNED_DATA,       AUTH_TUNNELING_PROXY_SERVER },
@@ -175,7 +176,8 @@ public class WebSocketProxyTest {
         return "%s and %s %s".formatted(actual, expected, message);
     }
 
-    @Test(dataProvider = "servers")
+    @ParameterizedTest
+    @MethodSource("servers")
     public void simpleAggregatingBinaryMessages
             (Function<int[],DummySecureWebSocketServer> serverSupplier,
              Supplier<ProxyServer> proxyServerSupplier)
@@ -263,7 +265,7 @@ public class WebSocketProxyTest {
                     .join();
 
             List<byte[]> a = actual.join();
-            assertEquals(ofBytes(a), ofBytes(expected), diagnose(a, expected));
+            assertEquals(ofBytes(expected), ofBytes(a), diagnose(a, expected));
         }
     }
 
@@ -359,7 +361,7 @@ public class WebSocketProxyTest {
             } catch (CompletionException expected) {
                 WebSocketHandshakeException e = (WebSocketHandshakeException)expected.getCause();
                 HttpResponse<?> response = e.getResponse();
-                assertEquals(response.statusCode(), 407);
+                assertEquals(407, response.statusCode());
             }
         }
     }
@@ -398,7 +400,7 @@ public class WebSocketProxyTest {
         }
     }
 
-    @BeforeMethod
+    @BeforeEach
     public void breakBetweenTests() {
         System.gc();
         try {Thread.sleep(100); } catch (InterruptedException x) { /* OK */ }
diff --git a/test/jdk/java/net/httpclient/websocket/WebSocketTest.java b/test/jdk/java/net/httpclient/websocket/WebSocketTest.java
index 43bcb054b7d..2b1df3d7e87 100644
--- a/test/jdk/java/net/httpclient/websocket/WebSocketTest.java
+++ b/test/jdk/java/net/httpclient/websocket/WebSocketTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -27,12 +27,10 @@
  * @library ../access
  * @build DummyWebSocketServer
  *        java.net.http/jdk.internal.net.http.HttpClientTimerAccess
- * @run testng/othervm
+ * @run junit/othervm
  *       WebSocketTest
  */
 
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
 
 import java.io.IOException;
 import java.net.Authenticator;
@@ -63,9 +61,13 @@ import static java.net.http.HttpClient.newBuilder;
 import static java.net.http.WebSocket.NORMAL_CLOSURE;
 import static java.nio.charset.StandardCharsets.UTF_8;
 import static jdk.internal.net.http.HttpClientTimerAccess.assertNoResponseTimerEventRegistrations;
-import static org.testng.Assert.assertEquals;
-import static org.testng.Assert.assertThrows;
-import static org.testng.Assert.fail;
+
+import org.junit.jupiter.api.Test;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertThrows;
+import static org.junit.jupiter.api.Assertions.fail;
 
 public class WebSocketTest {
 
@@ -264,8 +266,7 @@ public class WebSocketTest {
         }
     }
 
-    @DataProvider(name = "sequence")
-    public Object[][] data1() {
+    public static Object[][] data1() {
         int[] CLOSE = {
                 0x81, 0x00, // ""
                 0x82, 0x00, // []
@@ -292,7 +293,8 @@ public class WebSocketTest {
         };
     }
 
-    @Test(dataProvider = "sequence")
+    @ParameterizedTest
+    @MethodSource("data1")
     public void listenerSequentialOrder(int[] binary, long requestSize)
             throws IOException
     {
@@ -470,8 +472,7 @@ public class WebSocketTest {
             @Override public String toString() { return "AUTH_SERVER_WITH_CANNED_DATA"; }
         };
 
-    @DataProvider(name = "servers")
-    public Object[][] servers() {
+    public static Object[][] servers() {
         return new Object[][] {
             { SERVER_WITH_CANNED_DATA },
             { AUTH_SERVER_WITH_CANNED_DATA },
@@ -507,7 +508,8 @@ public class WebSocketTest {
         return "%s and %s %s".formatted(actual, expected, message);
     }
 
-    @Test(dataProvider = "servers")
+    @ParameterizedTest
+    @MethodSource("servers")
     public void simpleAggregatingBinaryMessages
             (Function<int[],DummyWebSocketServer> serverSupplier)
         throws IOException
@@ -600,14 +602,15 @@ public class WebSocketTest {
                     .join();
             try {
                 List<byte[]> a = actual.join();
-                assertEquals(ofBytes(a), ofBytes(expected), diagnose(a, expected));
+                assertEquals(ofBytes(expected), ofBytes(a), diagnose(a, expected));
             } finally {
                 webSocket.abort();
             }
         }
     }
 
-    @Test(dataProvider = "servers")
+    @ParameterizedTest
+    @MethodSource("servers")
     public void simpleAggregatingTextMessages
             (Function<int[],DummyWebSocketServer> serverSupplier)
         throws IOException
@@ -683,7 +686,7 @@ public class WebSocketTest {
                     .join();
             try {
                 List<String> a = actual.join();
-                assertEquals(a, expected);
+                assertEquals(expected, a);
             } finally {
                 webSocket.abort();
             }
@@ -694,7 +697,8 @@ public class WebSocketTest {
      * Exercises the scenario where requests for more messages are made prior to
      * completing the returned CompletionStage instances.
      */
-    @Test(dataProvider = "servers")
+    @ParameterizedTest
+    @MethodSource("servers")
     public void aggregatingTextMessages
         (Function<int[],DummyWebSocketServer> serverSupplier)
         throws IOException
@@ -784,7 +788,7 @@ public class WebSocketTest {
                     .join();
             try {
                 List<String> a = actual.join();
-                assertEquals(a, expected);
+                assertEquals(expected, a);
             } finally {
                 webSocket.abort();
             }
@@ -853,7 +857,7 @@ public class WebSocketTest {
             } catch (CompletionException expected) {
                 WebSocketHandshakeException e = (WebSocketHandshakeException)expected.getCause();
                 HttpResponse<?> response = e.getResponse();
-                assertEquals(response.statusCode(), 401);
+                assertEquals(401, response.statusCode());
             }
         }
     }
diff --git a/test/jdk/java/net/httpclient/websocket/java.net.http/jdk/internal/net/http/websocket/HeaderWriterTest.java b/test/jdk/java/net/httpclient/websocket/java.net.http/jdk/internal/net/http/websocket/HeaderWriterTest.java
index 0e55eaf521f..59a66591c93 100644
--- a/test/jdk/java/net/httpclient/websocket/java.net.http/jdk/internal/net/http/websocket/HeaderWriterTest.java
+++ b/test/jdk/java/net/httpclient/websocket/java.net.http/jdk/internal/net/http/websocket/HeaderWriterTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2016, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2016, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,7 +23,6 @@
 
 package jdk.internal.net.http.websocket;
 
-import org.testng.annotations.Test;
 import jdk.internal.net.http.websocket.Frame.HeaderWriter;
 import jdk.internal.net.http.websocket.Frame.Opcode;
 
@@ -32,10 +31,12 @@ import java.util.OptionalInt;
 
 import static java.util.OptionalInt.empty;
 import static java.util.OptionalInt.of;
-import static org.testng.Assert.assertEquals;
 import static jdk.internal.net.http.websocket.TestSupport.assertThrows;
 import static jdk.internal.net.http.websocket.TestSupport.forEachPermutation;
 
+import org.junit.jupiter.api.Test;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+
 public class HeaderWriterTest {
 
     private long cases, frames;
@@ -109,7 +110,7 @@ public class HeaderWriterTest {
                     ByteBuffer actual = ByteBuffer.allocate(Frame.MAX_HEADER_SIZE_BYTES + 2);
                     writer.write(actual);
                     actual.flip();
-                    assertEquals(actual, expected);
+                    assertEquals(expected, actual);
                 });
     }
 }
diff --git a/test/jdk/java/net/httpclient/websocket/java.net.http/jdk/internal/net/http/websocket/MaskerTest.java b/test/jdk/java/net/httpclient/websocket/java.net.http/jdk/internal/net/http/websocket/MaskerTest.java
index 7eb892f12ea..cb59b9f7213 100644
--- a/test/jdk/java/net/httpclient/websocket/java.net.http/jdk/internal/net/http/websocket/MaskerTest.java
+++ b/test/jdk/java/net/httpclient/websocket/java.net.http/jdk/internal/net/http/websocket/MaskerTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2016, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2016, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,17 +23,17 @@
 
 package jdk.internal.net.http.websocket;
 
-import org.testng.annotations.Test;
-
 import java.nio.ByteBuffer;
 import java.security.SecureRandom;
 import java.util.stream.IntStream;
 
-import static org.testng.Assert.assertEquals;
 import static jdk.internal.net.http.websocket.Frame.Masker.applyMask;
 import static jdk.internal.net.http.websocket.TestSupport.forEachBufferPartition;
 import static jdk.internal.net.http.websocket.TestSupport.fullCopy;
 
+import org.junit.jupiter.api.Test;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+
 public class MaskerTest {
 
     private static final SecureRandom random = new SecureRandom();
@@ -98,14 +98,14 @@ public class MaskerTest {
         int dstRemaining = dstCopy.remaining();
         int masked = Math.min(srcRemaining, dstRemaining);
         // 1. position check
-        assertEquals(src.position(), srcCopy.position() + masked);
-        assertEquals(dst.position(), dstCopy.position() + masked);
+        assertEquals(srcCopy.position() + masked, src.position());
+        assertEquals(dstCopy.position() + masked, dst.position());
         // 2. masking check
         src.position(srcCopy.position());
         dst.position(dstCopy.position());
         for (; src.hasRemaining() && dst.hasRemaining();
              offset = (offset + 1) & 3) {
-            assertEquals(dst.get(), src.get() ^ maskBytes[offset]);
+            assertEquals(src.get() ^ maskBytes[offset], dst.get());
         }
         // 3. corruption check
         // 3.1 src contents haven't changed
@@ -113,7 +113,7 @@ public class MaskerTest {
         int srcLimit = src.limit();
         src.clear();
         srcCopy.clear();
-        assertEquals(src, srcCopy);
+        assertEquals(srcCopy, src);
         src.limit(srcLimit).position(srcPosition); // restore src
         // 3.2 dst leading and trailing regions' contents haven't changed
         int dstPosition = dst.position();
@@ -122,11 +122,11 @@ public class MaskerTest {
         // leading
         dst.position(0).limit(dstInitialPosition);
         dstCopy.position(0).limit(dstInitialPosition);
-        assertEquals(dst, dstCopy);
+        assertEquals(dstCopy, dst);
         // trailing
         dst.limit(dst.capacity()).position(dstLimit);
         dstCopy.limit(dst.capacity()).position(dstLimit);
-        assertEquals(dst, dstCopy);
+        assertEquals(dstCopy, dst);
         // restore dst
         dst.position(dstPosition).limit(dstLimit);
         return offset;
diff --git a/test/jdk/java/net/httpclient/websocket/java.net.http/jdk/internal/net/http/websocket/MessageQueueTest.java b/test/jdk/java/net/httpclient/websocket/java.net.http/jdk/internal/net/http/websocket/MessageQueueTest.java
index 61503f0e235..73cab76df28 100644
--- a/test/jdk/java/net/httpclient/websocket/java.net.http/jdk/internal/net/http/websocket/MessageQueueTest.java
+++ b/test/jdk/java/net/httpclient/websocket/java.net.http/jdk/internal/net/http/websocket/MessageQueueTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,9 +23,6 @@
 
 package jdk.internal.net.http.websocket;
 
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
-
 import java.io.IOException;
 import java.nio.ByteBuffer;
 import java.nio.CharBuffer;
@@ -46,10 +43,14 @@ import java.util.function.BiConsumer;
 import java.util.function.Supplier;
 
 import static jdk.internal.net.http.websocket.MessageQueue.effectiveCapacityOf;
-import static org.testng.Assert.assertEquals;
-import static org.testng.Assert.assertFalse;
-import static org.testng.Assert.assertThrows;
-import static org.testng.Assert.assertTrue;
+
+import org.junit.jupiter.api.Test;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertFalse;
+import static org.junit.jupiter.api.Assertions.assertThrows;
+import static org.junit.jupiter.api.Assertions.assertTrue;
 
 /*
  * A unit test for MessageQueue. The test is aware of the details of the queue
@@ -59,7 +60,6 @@ public class MessageQueueTest {
 
     private static final Random r = new SecureRandom();
 
-    @DataProvider(name = "illegalCapacities")
     public static Object[][] illegalCapacities() {
         return new Object[][]{
                 new Object[]{Integer.MIN_VALUE},
@@ -69,17 +69,20 @@ public class MessageQueueTest {
         };
     }
 
-    @Test(dataProvider = "illegalCapacities")
+    @ParameterizedTest
+    @MethodSource("illegalCapacities")
     public void illegalCapacity(int n) {
         assertThrows(IllegalArgumentException.class, () -> new MessageQueue(n));
     }
 
-    @Test(dataProvider = "capacities")
+    @ParameterizedTest
+    @MethodSource("capacities")
     public void emptiness(int n) {
         assertTrue(new MessageQueue(n).isEmpty());
     }
 
-    @Test(dataProvider = "capacities")
+    @ParameterizedTest
+    @MethodSource("capacities")
     public void fullness(int n) throws IOException {
         MessageQueue q = new MessageQueue(n);
         int cap = effectiveCapacityOf(n);
@@ -97,7 +100,7 @@ public class MessageQueueTest {
         for (int i = 0; i < cap; i++) {
             Message expected = referenceQueue.remove();
             Message actual = new Remover().removeFrom(q);
-            assertEquals(actual, expected);
+            assertEquals(expected, actual);
         }
     }
 
@@ -144,7 +147,8 @@ public class MessageQueueTest {
                            action, future);
     }
 
-    @Test(dataProvider = "capacities")
+    @ParameterizedTest
+    @MethodSource("capacities")
     public void caterpillarWalk(int n) throws IOException {
 //        System.out.println("n: " + n);
         int cap = effectiveCapacityOf(n);
@@ -164,7 +168,7 @@ public class MessageQueueTest {
                 for (int i = 0; i < p; i++) {
                     Message expected = referenceQueue.remove();
                     Message actual = remover.removeFrom(q);
-                    assertEquals(actual, expected);
+                    assertEquals(expected, actual);
                 }
                 assertTrue(q.isEmpty());
             }
@@ -243,7 +247,7 @@ public class MessageQueueTest {
                     f.get();    // Just to check for exceptions
                 }
                 consumer.get(); // Waiting for consumer to collect all the messages
-                assertEquals(actualList.size(), expectedList.size());
+                assertEquals(expectedList.size(), actualList.size());
                 for (Message m : expectedList) {
                     assertTrue(actualList.remove(m));
                 }
@@ -257,7 +261,8 @@ public class MessageQueueTest {
         }
     }
 
-    @Test(dataProvider = "capacities")
+    @ParameterizedTest
+    @MethodSource("capacities")
     public void testSingleThreaded(int n) throws IOException {
         Queue<Message> referenceQueue = new LinkedList<>();
         MessageQueue q = new MessageQueue(n);
@@ -271,13 +276,12 @@ public class MessageQueueTest {
         for (int i = 0; i < cap; i++) {
             Message expected = referenceQueue.remove();
             Message actual = new Remover().removeFrom(q);
-            assertEquals(actual, expected);
+            assertEquals(expected, actual);
         }
         assertTrue(q.isEmpty());
     }
 
-    @DataProvider(name = "capacities")
-    public Object[][] capacities() {
+    public static Object[][] capacities() {
         return new Object[][]{
                 new Object[]{  1},
                 new Object[]{  2},
diff --git a/test/jdk/java/net/httpclient/websocket/java.net.http/jdk/internal/net/http/websocket/ReaderTest.java b/test/jdk/java/net/httpclient/websocket/java.net.http/jdk/internal/net/http/websocket/ReaderTest.java
index c53ac88f69c..c7b1ab80fbd 100644
--- a/test/jdk/java/net/httpclient/websocket/java.net.http/jdk/internal/net/http/websocket/ReaderTest.java
+++ b/test/jdk/java/net/httpclient/websocket/java.net.http/jdk/internal/net/http/websocket/ReaderTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2016, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2016, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,7 +23,6 @@
 
 package jdk.internal.net.http.websocket;
 
-import org.testng.annotations.Test;
 import jdk.internal.net.http.websocket.Frame.Opcode;
 
 import java.nio.ByteBuffer;
@@ -35,10 +34,12 @@ import java.util.function.IntUnaryOperator;
 
 import static java.util.OptionalInt.empty;
 import static java.util.OptionalInt.of;
-import static org.testng.Assert.assertEquals;
 import static jdk.internal.net.http.websocket.TestSupport.assertThrows;
 import static jdk.internal.net.http.websocket.TestSupport.forEachBufferPartition;
 
+import org.junit.jupiter.api.Test;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+
 public class ReaderTest {
 
     private long cases, frames;
@@ -128,15 +129,15 @@ public class ReaderTest {
                     for (ByteBuffer b : buffers) {
                         r.readFrame(b, c);
                     }
-                    assertEquals(fin, c.fin());
-                    assertEquals(rsv1, c.rsv1());
-                    assertEquals(rsv2, c.rsv2());
-                    assertEquals(rsv3, c.rsv3());
-                    assertEquals(opcode, c.opcode());
-                    assertEquals(mask.isPresent(), c.mask());
-                    assertEquals(payloadLen, c.payloadLen());
-                    assertEquals(mask, c.maskingKey());
-                    assertEquals(payloadLen == 0, c.isEndFrame());
+                    assertEquals(c.fin(), fin);
+                    assertEquals(c.rsv1(), rsv1);
+                    assertEquals(c.rsv2(), rsv2);
+                    assertEquals(c.rsv3(), rsv3);
+                    assertEquals(c.opcode(), opcode);
+                    assertEquals(c.mask(), mask.isPresent());
+                    assertEquals(c.payloadLen(), payloadLen);
+                    assertEquals(c.maskingKey(), mask);
+                    assertEquals(c.isEndFrame(), payloadLen == 0);
                 });
     }
 
diff --git a/test/jdk/java/net/httpclient/websocket/security/WSSanityTest.java b/test/jdk/java/net/httpclient/websocket/security/WSSanityTest.java
index 787486dbd84..c8e4faa1ad3 100644
--- a/test/jdk/java/net/httpclient/websocket/security/WSSanityTest.java
+++ b/test/jdk/java/net/httpclient/websocket/security/WSSanityTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2017, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2017, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,7 +25,7 @@
  * @test
  * @summary Basic sanity checks for WebSocket URI from the Builder
  * @compile ../DummyWebSocketServer.java ../../ProxyServer.java
- * @run testng/othervm WSSanityTest
+ * @run junit/othervm WSSanityTest
  */
 
 import java.io.IOException;
@@ -38,20 +38,21 @@ import java.net.URI;
 import java.util.List;
 import java.net.http.HttpClient;
 import java.net.http.WebSocket;
-import org.testng.annotations.AfterTest;
-import org.testng.annotations.BeforeTest;
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
-import static org.testng.Assert.*;
+
+import org.junit.jupiter.api.AfterAll;
+import org.junit.jupiter.api.BeforeAll;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
+import static org.junit.jupiter.api.Assertions.*;
 
 public class WSSanityTest {
 
-    URI wsURI;
-    DummyWebSocketServer webSocketServer;
-    InetSocketAddress proxyAddress;
+    private static URI wsURI;
+    private static DummyWebSocketServer webSocketServer;
+    private static InetSocketAddress proxyAddress;
 
-    @BeforeTest
-    public void setup() throws Exception {
+    @BeforeAll
+    public static void setup() throws Exception {
         ProxyServer proxyServer = new ProxyServer(0, true);
         proxyAddress = new InetSocketAddress(InetAddress.getLoopbackAddress(),
                                              proxyServer.getPort());
@@ -63,8 +64,8 @@ public class WSSanityTest {
         System.out.println("DummyWebSocketServer: " + wsURI);
     }
 
-    @AfterTest
-    public void teardown() {
+    @AfterAll
+    public static void teardown() {
         webSocketServer.close();
     }
 
@@ -75,8 +76,7 @@ public class WSSanityTest {
         T run() throws Exception;
     }
 
-    @DataProvider(name = "passingScenarios")
-    public Object[][] passingScenarios() {
+    public static Object[][] passingScenarios() {
         HttpClient noProxyClient = HttpClient.newHttpClient();
         return new Object[][]{
             { (ExceptionAction<?>)() -> {
@@ -146,14 +146,15 @@ public class WSSanityTest {
                  HttpClient client = HttpClient.newBuilder().proxy(ps).build();
                  client.newWebSocketBuilder()
                        .buildAsync(wsURI, noOpListener).get().abort();
-                 assertEquals(ps.count(), 1);  // ps.select only invoked once
+                 assertEquals(1, ps.count());  // ps.select only invoked once
                  return null; },
               "7" },
 
         };
     }
 
-    @Test(dataProvider = "passingScenarios")
+    @ParameterizedTest
+    @MethodSource("passingScenarios")
     public void testScenarios(ExceptionAction<?> action, String dataProviderId)
         throws Exception
     {

From 0668dab54568a08d49c8c10a7efc4d06ca191083 Mon Sep 17 00:00:00 2001
From: Volkan Yazici <vyazici@openjdk.org>
Date: Thu, 5 Mar 2026 12:26:37 +0000
Subject: [PATCH 055/655] 8379114: HttpServer path prefix matching incorrectly
 matches paths that are not slash-prefixed

Reviewed-by: dfuchs
---
 .../sun/net/httpserver/ContextList.java       |  51 +++----
 .../ContextPathMatcherPathPrefixTest.java     | 139 +++++++++++++++---
 .../ContextPathMatcherStringPrefixTest.java   |  40 ++---
 3 files changed, 162 insertions(+), 68 deletions(-)

diff --git a/src/jdk.httpserver/share/classes/sun/net/httpserver/ContextList.java b/src/jdk.httpserver/share/classes/sun/net/httpserver/ContextList.java
index 6393ca34798..14a07b3a677 100644
--- a/src/jdk.httpserver/share/classes/sun/net/httpserver/ContextList.java
+++ b/src/jdk.httpserver/share/classes/sun/net/httpserver/ContextList.java
@@ -186,38 +186,31 @@ class ContextList {
          */
         PATH_PREFIX((contextPath, requestPath) -> {
 
-            // Fast-path for `/`
-            if ("/".equals(contextPath)) {
+            // Does the request path prefix match?
+            if (!requestPath.startsWith(contextPath)) {
+                return false;
+            }
+
+            // Is it an exact match?
+            int contextPathLength = contextPath.length();
+            if (requestPath.length() == contextPathLength) {
                 return true;
             }
 
-            // Does the request path prefix match?
-            if (requestPath.startsWith(contextPath)) {
-
-                // Is it an exact match?
-                int contextPathLength = contextPath.length();
-                if (requestPath.length() == contextPathLength) {
-                    return true;
-                }
-
-                // Is it a path-prefix match?
-                assert contextPathLength > 0;
-                return
-                        // Case 1: The request path starts with the context
-                        // path, but the context path has an extra path
-                        // separator suffix. For instance, the context path is
-                        // `/foo/` and the request path is `/foo/bar`.
-                        contextPath.charAt(contextPathLength - 1) == '/' ||
-                                // Case 2: The request path starts with the
-                                // context path, but the request path has an
-                                // extra path separator suffix. For instance,
-                                // context path is `/foo` and the request path
-                                // is `/foo/` or `/foo/bar`.
-                                requestPath.charAt(contextPathLength) == '/';
-
-            }
-
-            return false;
+            // Is it a path-prefix match?
+            assert contextPathLength > 0;
+            return
+                    // Case 1: The request path starts with the context
+                    // path, but the context path has an extra path
+                    // separator suffix. For instance, the context path is
+                    // `/foo/` and the request path is `/foo/bar`.
+                    contextPath.charAt(contextPathLength - 1) == '/' ||
+                            // Case 2: The request path starts with the
+                            // context path, but the request path has an
+                            // extra path separator suffix. For instance,
+                            // context path is `/foo` and the request path
+                            // is `/foo/` or `/foo/bar`.
+                            requestPath.charAt(contextPathLength) == '/';
 
         });
 
diff --git a/test/jdk/com/sun/net/httpserver/ContextPathMatcherPathPrefixTest.java b/test/jdk/com/sun/net/httpserver/ContextPathMatcherPathPrefixTest.java
index e1cff62a45f..6b260636585 100644
--- a/test/jdk/com/sun/net/httpserver/ContextPathMatcherPathPrefixTest.java
+++ b/test/jdk/com/sun/net/httpserver/ContextPathMatcherPathPrefixTest.java
@@ -23,21 +23,30 @@
 
 import com.sun.net.httpserver.HttpHandler;
 import com.sun.net.httpserver.HttpServer;
+
+import java.io.BufferedReader;
 import java.io.IOException;
+import java.io.InputStream;
+import java.io.InputStreamReader;
+import java.io.OutputStream;
 import java.net.InetAddress;
 import java.net.InetSocketAddress;
-import java.net.URI;
+import java.net.Socket;
 import java.net.http.HttpClient;
-import java.net.http.HttpRequest;
-import java.net.http.HttpResponse;
+import java.nio.charset.Charset;
+import java.nio.charset.StandardCharsets;
 import java.util.Map;
+import java.util.regex.Matcher;
+import java.util.regex.Pattern;
 
 import static java.net.http.HttpClient.Builder.NO_PROXY;
 
 import org.junit.jupiter.api.AfterAll;
 
 import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertNotNull;
 import static org.junit.jupiter.api.Assertions.assertThrows;
+import static org.junit.jupiter.api.Assertions.assertTrue;
 
 import org.junit.jupiter.api.Test;
 
@@ -89,29 +98,88 @@ public class ContextPathMatcherPathPrefixTest {
 
     @Test
     void testContextPathAtRoot() throws Exception {
+        // Repeating all cases with both known (GET) and unknown (DOH) request methods to stress both paths
         try (var infra = new Infra("/")) {
-            infra.expect(200, "/foo", "/foo/", "/foo/bar", "/foobar");
+            // 200
+            infra.expect(200, "GET /foo");
+            infra.expect(200, "GET /foo/");
+            infra.expect(200, "GET /foo/bar");
+            infra.expect(200, "GET /foobar");
+            infra.expect(200, "DOH /foo");
+            infra.expect(200, "DOH /foo/");
+            infra.expect(200, "DOH /foo/bar");
+            infra.expect(200, "DOH /foobar");
+            // 404
+            infra.expect(404, "GET foo");
+            infra.expect(404, "GET *");
+            infra.expect(404, "GET ");
+            infra.expect(404, "DOH foo");
+            infra.expect(404, "DOH *");
+            infra.expect(404, "DOH ");
+            // 400
+            infra.expect(400, "GET");
+            infra.expect(400, "DOH");
         }
     }
 
     @Test
     void testContextPathAtSubDir() throws Exception {
+        // Repeating all cases with both known (GET) and unknown (DOH) request methods to stress both paths
         try (var infra = new Infra("/foo")) {
-            infra.expect(200, "/foo", "/foo/", "/foo/bar");
-            infra.expect(404, "/foobar");
+            // 200
+            infra.expect(200, "GET /foo");
+            infra.expect(200, "GET /foo/");
+            infra.expect(200, "GET /foo/bar");
+            infra.expect(200, "DOH /foo");
+            infra.expect(200, "DOH /foo/");
+            infra.expect(200, "DOH /foo/bar");
+            // 404
+            infra.expect(404, "GET /foobar"); // Differs from string prefix matching!
+            infra.expect(404, "GET foo");
+            infra.expect(404, "GET *");
+            infra.expect(404, "GET ");
+            infra.expect(404, "DOH /foobar"); // Differs from string prefix matching!
+            infra.expect(404, "DOH foo");
+            infra.expect(404, "DOH *");
+            infra.expect(404, "DOH ");
+            // 400
+            infra.expect(400, "GET");
+            infra.expect(400, "DOH");
         }
     }
 
     @Test
     void testContextPathAtSubDirWithTrailingSlash() throws Exception {
+        // Repeating all cases with both known (GET) and unknown (DOH) request methods to stress both paths
         try (var infra = new Infra("/foo/")) {
-            infra.expect(200, "/foo/", "/foo/bar");
-            infra.expect(404, "/foo", "/foobar");
+            // 200
+            infra.expect(200, "GET /foo/");
+            infra.expect(200, "GET /foo/bar");
+            infra.expect(200, "DOH /foo/");
+            infra.expect(200, "DOH /foo/bar");
+            // 404
+            infra.expect(404, "GET /foo");
+            infra.expect(404, "GET /foobar");
+            infra.expect(404, "GET foo");
+            infra.expect(404, "GET *");
+            infra.expect(404, "GET ");
+            infra.expect(404, "DOH /foo");
+            infra.expect(404, "DOH /foobar");
+            infra.expect(404, "DOH foo");
+            infra.expect(404, "DOH *");
+            infra.expect(404, "DOH ");
+            // 400
+            infra.expect(400, "GET");
+            infra.expect(400, "DOH");
         }
     }
 
     protected static final class Infra implements AutoCloseable {
 
+        /** Charset used for network and file I/O. */
+        private static final Charset CHARSET = StandardCharsets.US_ASCII;
+
+        /** Socket address the server will bind to. */
         private static final InetSocketAddress LO_SA_0 =
                 new InetSocketAddress(InetAddress.getLoopbackAddress(), 0);
 
@@ -128,22 +196,51 @@ public class ContextPathMatcherPathPrefixTest {
             this.contextPath = contextPath;
         }
 
-        protected void expect(int statusCode, String... requestPaths) throws Exception {
-            for (String requestPath : requestPaths) {
-                var requestURI = URI.create("http://%s:%s%s".formatted(
-                        server.getAddress().getHostString(),
-                        server.getAddress().getPort(),
-                        requestPath));
-                var request = HttpRequest.newBuilder(requestURI).build();
-                var response = CLIENT.send(request, HttpResponse.BodyHandlers.discarding());
-                assertEquals(
-                        statusCode, response.statusCode(),
-                        "unexpected status code " + Map.of(
-                                "contextPath", contextPath,
-                                "requestPath", requestPath));
+        protected void expect(int statusCode, String requestLinePrefix) {
+            try {
+                expect0(statusCode, requestLinePrefix);
+            } catch (Throwable exception) {
+                var extendedMessage = exception.getMessage() + " " + Map.of(
+                        "contextPath", contextPath,
+                        "requestLinePrefix", requestLinePrefix);
+                var extendedException = new RuntimeException(extendedMessage);
+                extendedException.setStackTrace(exception.getStackTrace());
+                throw extendedException;
             }
         }
 
+        private void expect0(int statusCode, String requestLinePrefix) throws IOException {
+
+            // Connect to the server
+            try (Socket socket = new Socket()) {
+                socket.connect(server.getAddress());
+
+                // Obtain the I/O streams
+                try (OutputStream outputStream = socket.getOutputStream();
+                     InputStream inputStream = socket.getInputStream();
+                     BufferedReader inputReader = new BufferedReader(new InputStreamReader(inputStream, CHARSET))) {
+
+                    // Write the request
+                    byte[] requestBytes = String
+                            // `Connection: close` is required for `BufferedReader::readLine` to work.
+                            .format("%s HTTP/1.1\r\nConnection: close\r\n\r\n", requestLinePrefix)
+                            .getBytes(CHARSET);
+                    outputStream.write(requestBytes);
+                    outputStream.flush();
+
+                    // Read the response status code
+                    String statusLine = inputReader.readLine();
+                    assertNotNull(statusLine, "Unexpected EOF while reading status line");
+                    Matcher statusLineMatcher = Pattern.compile("^HTTP/1\\.1 (\\d+) .+$").matcher(statusLine);
+                    assertTrue(statusLineMatcher.matches(), "Couldn't match status line: \"" + statusLine + "\"");
+                    assertEquals(statusCode, Integer.parseInt(statusLineMatcher.group(1)));
+
+                }
+
+            }
+
+        }
+
         @Override
         public void close() {
             server.stop(0);
diff --git a/test/jdk/com/sun/net/httpserver/ContextPathMatcherStringPrefixTest.java b/test/jdk/com/sun/net/httpserver/ContextPathMatcherStringPrefixTest.java
index 3f3008a8531..4faa1463e1b 100644
--- a/test/jdk/com/sun/net/httpserver/ContextPathMatcherStringPrefixTest.java
+++ b/test/jdk/com/sun/net/httpserver/ContextPathMatcherStringPrefixTest.java
@@ -36,28 +36,32 @@ import org.junit.jupiter.api.Test;
 
 class ContextPathMatcherStringPrefixTest extends ContextPathMatcherPathPrefixTest {
 
-    @Test
-    @Override
-    void testContextPathAtRoot() throws Exception {
-        try (var infra = new Infra("/")) {
-            infra.expect(200, "/foo", "/foo/", "/foo/bar", "/foobar");
-        }
-    }
-
     @Test
     @Override
     void testContextPathAtSubDir() throws Exception {
+        // Repeating all cases with both known (GET) and unknown (DOH) request methods to stress both paths
         try (var infra = new Infra("/foo")) {
-            infra.expect(200, "/foo", "/foo/", "/foo/bar", "/foobar");
-        }
-    }
-
-    @Test
-    @Override
-    void testContextPathAtSubDirWithTrailingSlash() throws Exception {
-        try (var infra = new Infra("/foo/")) {
-            infra.expect(200, "/foo/", "/foo/bar");
-            infra.expect(404, "/foo", "/foobar");
+            // 200
+            infra.expect(200, "GET /foo");
+            infra.expect(200, "GET /foo/");
+            infra.expect(200, "GET /foo/bar");
+            infra.expect(200, "GET /foobar");   // Differs from path prefix matching!
+            infra.expect(200, "DOH /foo");
+            infra.expect(200, "DOH /foo/");
+            infra.expect(200, "DOH /foo/bar");
+            infra.expect(200, "DOH /foobar");   // Differs from path prefix matching!
+            // 404
+            infra.expect(404, "GET /");
+            infra.expect(404, "GET foo");
+            infra.expect(404, "GET *");
+            infra.expect(404, "GET ");
+            infra.expect(404, "DOH /");
+            infra.expect(404, "DOH foo");
+            infra.expect(404, "DOH *");
+            infra.expect(404, "DOH ");
+            // 400
+            infra.expect(400, "GET");
+            infra.expect(400, "DOH");
         }
     }
 

From 4d9d2c352b9daa8bdecea5303f49f2496c127115 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Hannes=20Walln=C3=B6fer?= <hannesw@openjdk.org>
Date: Thu, 5 Mar 2026 14:15:08 +0000
Subject: [PATCH 056/655] 8284315: DocTrees.getElement is inconsistent with
 Elements.getTypeElement

Reviewed-by: jlahoda, vromero
---
 .../classes/com/sun/source/util/DocTrees.java |  25 +--
 .../com/sun/tools/javac/api/JavacTrees.java   | 142 +++++++++---------
 .../doclets/toolkit/util/CommentHelper.java   |   7 +-
 .../jdk/javadoc/internal/doclint/Checker.java |  12 +-
 .../javadoc/doclet/testSeeTag/TestSeeTag.java |  10 +-
 .../tools/doclint/ReferenceTest.java          |   2 +-
 .../langtools/tools/doclint/ReferenceTest.out |  14 +-
 .../tools/javac/doctree/ReferenceTest.java    |  78 ++++++++--
 8 files changed, 184 insertions(+), 106 deletions(-)

diff --git a/src/jdk.compiler/share/classes/com/sun/source/util/DocTrees.java b/src/jdk.compiler/share/classes/com/sun/source/util/DocTrees.java
index 45a452bd0dd..44d9bd89917 100644
--- a/src/jdk.compiler/share/classes/com/sun/source/util/DocTrees.java
+++ b/src/jdk.compiler/share/classes/com/sun/source/util/DocTrees.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2011, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2011, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -195,23 +195,30 @@ public abstract class DocTrees extends Trees {
 
     /**
      * Returns the language model element referred to by the leaf node of the given
-     * {@link DocTreePath}, or {@code null} if unknown.
+     * {@link DocTreePath}, or {@code null} if the leaf node of {@code path} does
+     * not refer to an element.
+     *
      * @param path the path for the tree node
-     * @return the element
+     * @return the referenced element, or null
+     * @see #getType(DocTreePath)
      */
     public abstract Element getElement(DocTreePath path);
 
     /**
      * Returns the language model type referred to by the leaf node of the given
-     * {@link DocTreePath}, or {@code null} if unknown. This method usually
-     * returns the same value as {@code getElement(path).asType()} for a
-     * {@code path} argument for which {@link #getElement(DocTreePath)} returns
-     * a non-null value, but may return a type that includes additional
-     * information, such as a parameterized generic type instead of a raw type.
+     * {@link DocTreePath}, or {@code null} if the leaf node of {@code path} does
+     * not refer to a type.
+     *
+     * <p>If {@link #getElement(DocTreePath)} returns a non-null value for a given {@code path}
+     * argument, this method usally returns the same value as {@code getElement(path).asType()}.
+     * However, there are cases where the returned type includes additional information,
+     * such as a parameterized generic type instead of a raw type. In other cases, such as with
+     * primitive or array types, the returned type may not have a corresponding element returned
+     * by {@code getElement(DocTreePath)}.</p>
      *
      * @param path the path for the tree node
      * @return the referenced type, or null
-     *
+     * @see #getElement(DocTreePath)
      * @since 15
      */
     public abstract TypeMirror getType(DocTreePath path);
diff --git a/src/jdk.compiler/share/classes/com/sun/tools/javac/api/JavacTrees.java b/src/jdk.compiler/share/classes/com/sun/tools/javac/api/JavacTrees.java
index 6bc5d358b6f..ecd7f5b101a 100644
--- a/src/jdk.compiler/share/classes/com/sun/tools/javac/api/JavacTrees.java
+++ b/src/jdk.compiler/share/classes/com/sun/tools/javac/api/JavacTrees.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2005, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2005, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -354,22 +354,28 @@ public class JavacTrees extends DocTrees {
         DocTree tree = path.getLeaf();
         if (tree instanceof DCReference dcReference) {
             JCTree qexpr = dcReference.qualifierExpression;
-            if (qexpr != null) {
+
+            // Forward references with explicit module name to getElement
+            if (qexpr != null && dcReference.moduleName == null) {
+
+                Env<AttrContext> env = getAttrContext(path.getTreePath());
                 Log.DeferredDiagnosticHandler deferredDiagnosticHandler = log.new DeferredDiagnosticHandler();
+                JavaFileObject prevSource = log.useSource(env.toplevel.sourcefile);
+
                 try {
-                    Env<AttrContext> env = getAttrContext(path.getTreePath());
-                    JavaFileObject prevSource = log.useSource(env.toplevel.sourcefile);
-                    try {
-                        Type t = attr.attribType(dcReference.qualifierExpression, env);
-                        if (t != null && !t.isErroneous()) {
+                    Type t = attr.attribType(dcReference.qualifierExpression, env);
+                    if (t != null && !t.isErroneous()) {
+                        if (dcReference.memberName != null) {
+                            Symbol sym = resolveMember(t, (Name) dcReference.memberName, dcReference, env);
+                            return sym == null ? null : sym.type;
+                        } else {
                             return t;
                         }
-                    } finally {
-                        log.useSource(prevSource);
                     }
                 } catch (Abort e) { // may be thrown by Check.completionError in case of bad class file
                     return null;
                 } finally {
+                    log.useSource(prevSource);
                     log.popDiagnosticHandler(deferredDiagnosticHandler);
                 }
             }
@@ -426,14 +432,12 @@ public class JavacTrees extends DocTrees {
                 memberName = (Name) ref.memberName;
             } else {
                 // Check if qualifierExpression is a type or package, using the methods javac provides.
-                // If no module name is given we check if qualifierExpression identifies a type.
-                // If that fails or we have a module name, use that to resolve qualifierExpression to
-                // a package or type.
-                Type t = ref.moduleName == null ? attr.attribType(ref.qualifierExpression, env) : null;
+                Type t = attr.attribType(ref.qualifierExpression, env);
 
-                if (t == null || t.isErroneous()) {
-                    JCCompilationUnit toplevel =
-                        treeMaker.TopLevel(List.nil());
+                if (t == null || t.isErroneous() ||
+                        (ref.moduleName != null && !mdlsym.equals(elements.getModuleOf(t.asElement())))) {
+
+                    JCCompilationUnit toplevel = treeMaker.TopLevel(List.nil());
                     toplevel.modle = mdlsym;
                     toplevel.packge = mdlsym.unnamedPackage;
                     Symbol sym = attr.attribIdent(ref.qualifierExpression, toplevel);
@@ -447,10 +451,6 @@ public class JavacTrees extends DocTrees {
                     if ((sym.kind == PCK || sym.kind == TYP) && sym.exists()) {
                         tsym = (TypeSymbol) sym;
                         memberName = (Name) ref.memberName;
-                        if (sym.kind == PCK && memberName != null) {
-                            //cannot refer to a package "member"
-                            return null;
-                        }
                     } else {
                         if (modules.modulesInitialized() && ref.moduleName == null && ref.memberName == null) {
                             // package/type does not exist, check if there is a matching module
@@ -470,64 +470,22 @@ public class JavacTrees extends DocTrees {
                         }
                     }
                 } else {
-                    Type e = t;
-                    // If this is an array type convert to element type
-                    while (e instanceof ArrayType arrayType)
-                        e = arrayType.elemtype;
-                    tsym = e.tsym;
+                    tsym = switch (t.getKind()) {
+                        case DECLARED, TYPEVAR, PACKAGE, MODULE -> t.tsym;
+                        default -> null;
+                    };
                     memberName = (Name) ref.memberName;
                 }
             }
 
             if (memberName == null) {
                 return tsym;
-            } else if (tsym == null || tsym.getKind() == ElementKind.PACKAGE || tsym.getKind() == ElementKind.MODULE) {
-                return null;  // Non-null member name in non-class context
-            }
-
-            if (tsym.type.isPrimitive()) {
+            } else if (tsym == null) {
                 return null;
             }
 
-            final List<Type> paramTypes;
-            if (ref.paramTypes == null)
-                paramTypes = null;
-            else {
-                ListBuffer<Type> lb = new ListBuffer<>();
-                for (List<JCTree> l = (List<JCTree>) ref.paramTypes; l.nonEmpty(); l = l.tail) {
-                    JCTree tree = l.head;
-                    Type t = attr.attribType(tree, env);
-                    lb.add(t);
-                }
-                paramTypes = lb.toList();
-            }
+            return resolveMember(tsym.type, memberName, ref, env);
 
-            ClassSymbol sym = (ClassSymbol) types.skipTypeVars(tsym.type, false).tsym;
-            boolean explicitType = ref.qualifierExpression != null;
-            Symbol msym = (memberName == sym.name)
-                    ? findConstructor(sym, paramTypes, true)
-                    : findMethod(sym, memberName, paramTypes, true, explicitType);
-
-            if (msym == null) {
-                msym = (memberName == sym.name)
-                        ? findConstructor(sym, paramTypes, false)
-                        : findMethod(sym, memberName, paramTypes, false, explicitType);
-            }
-
-            if (paramTypes != null) {
-                // explicit (possibly empty) arg list given, so cannot be a field
-                return msym;
-            }
-
-            VarSymbol vsym = (ref.paramTypes != null) ? null : findField(sym, memberName, explicitType);
-            // prefer a field over a method with no parameters
-            if (vsym != null &&
-                    (msym == null ||
-                        types.isSubtypeUnchecked(vsym.enclClass().asType(), msym.enclClass().asType()))) {
-                return vsym;
-            } else {
-                return msym;
-            }
         } catch (Abort e) { // may be thrown by Check.completionError in case of bad class file
             return null;
         } finally {
@@ -536,6 +494,54 @@ public class JavacTrees extends DocTrees {
         }
     }
 
+    private Symbol resolveMember(Type type, Name memberName, DCReference ref, Env<AttrContext> env) {
+
+        if (type.isPrimitive() || type.getKind() == TypeKind.PACKAGE || type.getKind() == TypeKind.MODULE) {
+            return null;
+        }
+
+        final List<Type> paramTypes;
+        if (ref.paramTypes == null)
+            paramTypes = null;
+        else {
+            ListBuffer<Type> lb = new ListBuffer<>();
+            for (List<JCTree> l = (List<JCTree>) ref.paramTypes; l.nonEmpty(); l = l.tail) {
+                JCTree tree = l.head;
+                Type t = attr.attribType(tree, env);
+                lb.add(t);
+            }
+            paramTypes = lb.toList();
+        }
+
+        // skipTypeVars conversion below is needed if type is itself a type variable
+        ClassSymbol sym = (ClassSymbol) types.skipTypeVars(type, false).tsym;
+        boolean explicitType = ref.qualifierExpression != null;
+        Symbol msym = (memberName == sym.name)
+                ? findConstructor(sym, paramTypes, true)
+                : findMethod(sym, memberName, paramTypes, true, explicitType);
+
+        if (msym == null) {
+            msym = (memberName == sym.name)
+                    ? findConstructor(sym, paramTypes, false)
+                    : findMethod(sym, memberName, paramTypes, false, explicitType);
+        }
+
+        if (paramTypes != null) {
+            // explicit (possibly empty) arg list given, so cannot be a field
+            return msym;
+        }
+
+        VarSymbol vsym = (ref.paramTypes != null) ? null : findField(sym, memberName, explicitType);
+        // prefer a field over a method with no parameters
+        if (vsym != null &&
+                (msym == null ||
+                    types.isSubtypeUnchecked(vsym.enclClass().asType(), msym.enclClass().asType()))) {
+            return vsym;
+        } else {
+            return msym;
+        }
+    }
+
     private Symbol attributeParamIdentifier(TreePath path, DCParam paramTag) {
         Symbol javadocSymbol = getElement(path);
         if (javadocSymbol == null)
diff --git a/src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclets/toolkit/util/CommentHelper.java b/src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclets/toolkit/util/CommentHelper.java
index 30aa86aea71..3d300b77073 100644
--- a/src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclets/toolkit/util/CommentHelper.java
+++ b/src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclets/toolkit/util/CommentHelper.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2015, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2015, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -136,10 +136,7 @@ public class CommentHelper {
             return null;
         }
         DocTrees doctrees = configuration.docEnv.getDocTrees();
-        // Workaround for JDK-8284193
-        // DocTrees.getElement(DocTreePath) returns javac-internal Symbols
-        var e = doctrees.getElement(docTreePath);
-        return e == null || e.getKind() == ElementKind.CLASS && e.asType().getKind() != TypeKind.DECLARED ? null : e;
+        return doctrees.getElement(docTreePath);
     }
 
     public TypeMirror getType(ReferenceTree rtree) {
diff --git a/src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclint/Checker.java b/src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclint/Checker.java
index b5399d0fef9..90b371a8a15 100644
--- a/src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclint/Checker.java
+++ b/src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclint/Checker.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2012, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2012, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -1006,11 +1006,11 @@ public class Checker extends DocTreePathScanner<Void, Void> {
     public Void visitReference(ReferenceTree tree, Void ignore) {
         // Exclude same-file anchor links from reference checks
         if (!tree.getSignature().startsWith("##")) {
-            Element e = env.trees.getElement(getCurrentPath());
-            if (e == null) {
-                reportBadReference(tree);
-            } else if ((inLink || inSee)
-                    && e.getKind() == ElementKind.CLASS && e.asType().getKind() != TypeKind.DECLARED) {
+            if (inLink || inSee) {
+                if (env.trees.getElement(getCurrentPath()) == null) {
+                    reportBadReference(tree);
+                }
+            } else if (env.trees.getType(getCurrentPath()) == null) {
                 reportBadReference(tree);
             }
         }
diff --git a/test/langtools/jdk/javadoc/doclet/testSeeTag/TestSeeTag.java b/test/langtools/jdk/javadoc/doclet/testSeeTag/TestSeeTag.java
index f3294f6647c..57854396cf4 100644
--- a/test/langtools/jdk/javadoc/doclet/testSeeTag/TestSeeTag.java
+++ b/test/langtools/jdk/javadoc/doclet/testSeeTag/TestSeeTag.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2002, 2023, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2002, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -24,6 +24,7 @@
 /*
  * @test
  * @bug      8017191 8182765 8200432 8239804 8250766 8262992 8281944 8307377
+ *           8284315
  * @summary  Javadoc is confused by at-link to imported classes outside of the set of generated packages
  * @library  /tools/lib ../../lib
  * @modules jdk.javadoc/jdk.javadoc.internal.tool
@@ -103,7 +104,12 @@ public class TestSeeTag extends JavadocTester {
                     <dt>See Also:</dt>
                     <dd>
                     <ul class="tag-list-long">
-                    <li><code>Object</code></li>
+                    <li>
+                    <details class="invalid-tag">
+                    <summary>invalid reference</summary>
+                    <pre><code>Object[]</code></pre>
+                    </details>
+                    </li>
                     <li>
                     <details class="invalid-tag">
                     <summary>invalid reference</summary>
diff --git a/test/langtools/tools/doclint/ReferenceTest.java b/test/langtools/tools/doclint/ReferenceTest.java
index ca677d64927..63512d1efc4 100644
--- a/test/langtools/tools/doclint/ReferenceTest.java
+++ b/test/langtools/tools/doclint/ReferenceTest.java
@@ -1,6 +1,6 @@
 /*
  * @test /nodynamiccopyright/
- * @bug 8004832 8020556 8002154 8200432 8177280
+ * @bug 8004832 8020556 8002154 8200432 8177280 8284315
  * @summary Add new doclint package
  * @modules jdk.javadoc/jdk.javadoc.internal.doclint
  * @build DocLintTester
diff --git a/test/langtools/tools/doclint/ReferenceTest.out b/test/langtools/tools/doclint/ReferenceTest.out
index 0b39ea20a41..4232f7b12ba 100644
--- a/test/langtools/tools/doclint/ReferenceTest.out
+++ b/test/langtools/tools/doclint/ReferenceTest.out
@@ -31,12 +31,24 @@ ReferenceTest.java:71: error: reference not found
 ReferenceTest.java:74: error: reference not found
      * @see not.Found<String>
             ^
+ReferenceTest.java:79: error: reference not found
+     * {@link java.lang.String[]}
+              ^
+ReferenceTest.java:80: error: reference not found
+     * {@link java.lang.String[]#equals}
+              ^
 ReferenceTest.java:81: error: reference not found
      * {@link not.Found[]}
               ^
+ReferenceTest.java:82: error: reference not found
+     * @see java.lang.String[]
+            ^
+ReferenceTest.java:83: error: reference not found
+     * @see java.lang.String[]#equals
+            ^
 ReferenceTest.java:84: error: reference not found
      * @see not.Found[]
             ^
-12 errors
+16 errors
 1 warning
 
diff --git a/test/langtools/tools/javac/doctree/ReferenceTest.java b/test/langtools/tools/javac/doctree/ReferenceTest.java
index 540cb9a6621..83a10ee4d20 100644
--- a/test/langtools/tools/javac/doctree/ReferenceTest.java
+++ b/test/langtools/tools/javac/doctree/ReferenceTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2012, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2012, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,7 +23,7 @@
 
 /*
  * @test
- * @bug 7021614 8278373 8164094 8371248
+ * @bug 7021614 8278373 8164094 8371248 8284315
  * @summary extend com.sun.source API to support parsing javadoc comments
  * @summary check references in at-see and {at-link} tags
  * @modules jdk.compiler
@@ -56,6 +56,7 @@ import javax.lang.model.element.ExecutableElement;
 import javax.lang.model.element.QualifiedNameable;
 import javax.lang.model.element.TypeElement;
 import javax.lang.model.type.DeclaredType;
+import javax.lang.model.type.TypeKind;
 import javax.lang.model.type.TypeMirror;
 import javax.tools.Diagnostic.Kind;
 
@@ -84,11 +85,14 @@ import javax.tools.Diagnostic.Kind;
  * {@link #trees Field}
  * {@link #getSupportedSourceVersion Method}
  * {@link #init(ProcessingEnvironment Method}
- * {@link double Class}
+ * {@link double type-only:double}
+ * {@link int type-only:int}
+ * {@link void type-only:void}
  * {@link double.NAN Bad}
  * {@link double#NAN Bad}
  * {@link double#double Bad}
  * {@link java.base/double Bad}
+ * {@link jdk.javadoc/double Bad}
  *
  * {@link List<String> Interface}
  * {@link List<String>.add Bad}
@@ -100,15 +104,20 @@ import javax.tools.Diagnostic.Kind;
  * {@link Map<String, String>.Entry<String, String>#getKey Method}
  * {@link Map<String, String>.Entry<String, String>#setValue(Object) Method}
  *
- * {@link java.base/java.util.List<String> Bad}
+ * {@link java.lang.String[] type-only:array}
+ * {@link java.lang.String[].length Bad}
+ * {@link java.lang.String[]#length type-only:int}
+ * {@link java.lang.String[]#length() Bad}
+ *
+ * {@link java.base/java.util.List<String> Interface}
  * {@link java.base/java.util.List<String>.add Bad}
- * {@link java.base/java.util.List<String>#add Bad}
- * {@link java.base/java.util.List<String>#add(Object) Bad}
- * {@link java.base/java.util.Map<String, String>.Entry Bad}
- * {@link java.base/java.util.Map<String, String>.Entry<String, String> Bad}
+ * {@link java.base/java.util.List<String>#add Method}
+ * {@link java.base/java.util.List<String>#add(Object) Method}
+ * {@link java.base/java.util.Map<String, String>.Entry Interface}
+ * {@link java.base/java.util.Map<String, String>.Entry<String, String> Interface}
  * {@link java.base/java.util.Map<String, String>.Entry<String, String>.getKey Bad}
- * {@link java.base/java.util.Map<String, String>.Entry<String, String>#getKey Bad}
- * {@link java.base/java.util.Map<String, String>.Entry<String, String>#setValue(Object) Bad}
+ * {@link java.base/java.util.Map<String, String>.Entry<String, String>#getKey Method}
+ * {@link java.base/java.util.Map<String, String>.Entry<String, String>#setValue(Object) Method}
  *
  * @see java.lang        Package
  * @see java.lang.ERROR  Bad
@@ -127,6 +136,14 @@ import javax.tools.Diagnostic.Kind;
  * @see java.lang.String#ERROR Bad
  * @see java.lang.String#equals(Object) Method
  *
+ * @see java.lang.String[] type-only:array
+ * @see java.lang.String[].length Bad
+ * @see java.lang.String[]#length type-only:int
+ * @see java.lang.String[]#length() Bad
+ *
+ * @see jdk.javadoc/jdk.javadoc.doclet.Doclet Interface
+ * @see jdk.compiler/jdk.javadoc.doclet.Doclet Bad
+ *
  * @see AbstractProcessor Class
  *
  * @see List#add(Object) Method
@@ -200,15 +217,23 @@ public class ReferenceTest extends AbstractProcessor {
             String sig = tree.getSignature();
 
             Element found = trees.getElement(new DocTreePath(getCurrentPath(), tree));
+            TypeMirror type = trees.getType(new DocTreePath(getCurrentPath(), tree));
+
             if (found == null) {
                 System.err.println(sig + " NOT FOUND");
             } else {
                 System.err.println(sig + " found " + found.getKind() + " " + found);
+                if (type == null) {
+                    error(tree, "Did not find type for element " + found);
+                } else if (!erasure(type).equals(erasure(found.asType()))) {
+                    error(tree, "Type " + erasure(type) + " does not match element " + erasure(found.asType()));
+                }
             }
 
             String expect = "UNKNOWN";
-            if (label.size() > 0 && label.get(0) instanceof TextTree)
-                expect = ((TextTree) label.get(0)).getBody();
+            if (!label.isEmpty() && label.getFirst() instanceof TextTree) {
+                expect = ((TextTree) label.getFirst()).getBody();
+            }
 
             if (expect.startsWith("signature:")) {
                 expect = expect.substring("signature:".length());
@@ -216,12 +241,25 @@ public class ReferenceTest extends AbstractProcessor {
                 String signature = found.getKind().name() + ":" + elementSignature(found);
 
                 if (!expect.equalsIgnoreCase(signature)) {
-                    error(tree, "Unexpected value found: " + signature +", expected: " + expect);
+                    error(tree, "Unexpected value found: " + signature + ", expected: " + expect);
+                }
+            } else if (expect.startsWith("type-only:")) {
+                expect = expect.substring("type-only:".length());
+                if (found != null) {
+                    error(tree, "Found element for type-only reference: " + found);
+                }
+                if (type == null) {
+                    error(tree, "Found no type, expected: " + expect);
+                } else if (!expect.equalsIgnoreCase(type.getKind().name())) {
+                    error(tree, "Found unexpected type: " + type + ", expected: " + expect);
                 }
             } else {
                 if (!expect.equalsIgnoreCase(found == null ? "bad" : found.getKind().name())) {
                     error(tree, "Unexpected value found: " + found +", expected: " + expect);
                 }
+                if (expect.equalsIgnoreCase("bad") && type != null) {
+                    error(tree, "Found unexpected type: " + type + ", expected none");
+                }
             }
         }
 
@@ -252,6 +290,12 @@ public class ReferenceTest extends AbstractProcessor {
             default -> throw new AssertionError("Unhandled type kind: " + type.getKind());
         };
     }
+
+    TypeMirror erasure(TypeMirror type) {
+        return type.getKind() == TypeKind.DECLARED
+                ? processingEnv.getTypeUtils().erasure(type)
+                : type;
+    }
 }
 
 /**
@@ -317,11 +361,17 @@ class ReferenceTestExtras {
      * @see #X         Field
      * @see #X()       Method
      * @see #m         Method
+     * @see X          Type_Parameter
+     * @see Y          Type_Parameter
+     * @see X#wait     Method
+     * @see X#wait()   Method
+     * @see Y#getSupportedSourceVersion   Method
+     * @see Y#init(ProcessingEnvironment) Method
      * @see Inner#X    Bad
      * @see Inner#X()  Bad
      * @see Inner#m    Bad
      */
-    interface Inner {}
+    interface Inner<X, Y extends ReferenceTest> {}
 }
 
 

From 2cb177d0babe1684362df975ad69ea31dc499d5b Mon Sep 17 00:00:00 2001
From: Boris Ulasevich <bulasevich@openjdk.org>
Date: Thu, 5 Mar 2026 16:10:44 +0000
Subject: [PATCH 057/655] 8371459: [REDO] AArch64: Use SHA3 GPR intrinsic where
 it's faster

Reviewed-by: phh, bperez
---
 src/hotspot/cpu/aarch64/globals_aarch64.hpp   |  2 +-
 .../cpu/aarch64/stubGenerator_aarch64.cpp     | 15 +++++-------
 .../cpu/aarch64/vm_version_aarch64.cpp        | 24 ++++++++++++++-----
 ...nsicsWithUseSHADisabledOnSupportedCPU.java |  4 ++--
 ...icsWithUseSHADisabledOnUnsupportedCPU.java |  2 +-
 .../intrinsics/sha/cli/DigestOptionsBase.java |  2 +-
 ...UseSHA3IntrinsicsOptionOnSupportedCPU.java |  5 +---
 .../GenericTestCaseForSupportedCPU.java       |  3 ++-
 .../GenericTestCaseForUnsupportedCPU.java     |  3 ++-
 .../sha/predicate/IntrinsicPredicates.java    |  6 +++++
 10 files changed, 40 insertions(+), 26 deletions(-)

diff --git a/src/hotspot/cpu/aarch64/globals_aarch64.hpp b/src/hotspot/cpu/aarch64/globals_aarch64.hpp
index a59e83c4b69..e6de2c798b1 100644
--- a/src/hotspot/cpu/aarch64/globals_aarch64.hpp
+++ b/src/hotspot/cpu/aarch64/globals_aarch64.hpp
@@ -95,7 +95,7 @@ define_pd_global(intx, InlineSmallCode,          1000);
           "Use simplest and shortest implementation for array equals")  \
   product(bool, UseSIMDForBigIntegerShiftIntrinsics, true,              \
           "Use SIMD instructions for left/right shift of BigInteger")   \
-  product(bool, UseSIMDForSHA3Intrinsic, true,                          \
+  product(bool, UseSIMDForSHA3Intrinsic, false,                         \
           "Use SIMD SHA3 instructions for SHA3 intrinsic")              \
   product(bool, AvoidUnalignedAccesses, false,                          \
           "Avoid generating unaligned memory accesses")                 \
diff --git a/src/hotspot/cpu/aarch64/stubGenerator_aarch64.cpp b/src/hotspot/cpu/aarch64/stubGenerator_aarch64.cpp
index a459a28b09e..21a1124a8ec 100644
--- a/src/hotspot/cpu/aarch64/stubGenerator_aarch64.cpp
+++ b/src/hotspot/cpu/aarch64/stubGenerator_aarch64.cpp
@@ -11876,16 +11876,13 @@ class StubGenerator: public StubCodeGenerator {
       StubRoutines::_sha512_implCompress   = generate_sha512_implCompress(StubId::stubgen_sha512_implCompress_id);
       StubRoutines::_sha512_implCompressMB = generate_sha512_implCompress(StubId::stubgen_sha512_implCompressMB_id);
     }
-    if (UseSHA3Intrinsics) {
-
+    if (UseSHA3Intrinsics && UseSIMDForSHA3Intrinsic) {
       StubRoutines::_double_keccak         = generate_double_keccak();
-      if (UseSIMDForSHA3Intrinsic) {
-         StubRoutines::_sha3_implCompress     = generate_sha3_implCompress(StubId::stubgen_sha3_implCompress_id);
-         StubRoutines::_sha3_implCompressMB   = generate_sha3_implCompress(StubId::stubgen_sha3_implCompressMB_id);
-      } else {
-         StubRoutines::_sha3_implCompress     = generate_sha3_implCompress_gpr(StubId::stubgen_sha3_implCompress_id);
-         StubRoutines::_sha3_implCompressMB   = generate_sha3_implCompress_gpr(StubId::stubgen_sha3_implCompressMB_id);
-      }
+      StubRoutines::_sha3_implCompress     = generate_sha3_implCompress(StubId::stubgen_sha3_implCompress_id);
+      StubRoutines::_sha3_implCompressMB   = generate_sha3_implCompress(StubId::stubgen_sha3_implCompressMB_id);
+    } else if (UseSHA3Intrinsics) {
+      StubRoutines::_sha3_implCompress     = generate_sha3_implCompress_gpr(StubId::stubgen_sha3_implCompress_id);
+      StubRoutines::_sha3_implCompressMB   = generate_sha3_implCompress_gpr(StubId::stubgen_sha3_implCompressMB_id);
     }
 
     if (UsePoly1305Intrinsics) {
diff --git a/src/hotspot/cpu/aarch64/vm_version_aarch64.cpp b/src/hotspot/cpu/aarch64/vm_version_aarch64.cpp
index 9b85733ed08..4423d9c5b58 100644
--- a/src/hotspot/cpu/aarch64/vm_version_aarch64.cpp
+++ b/src/hotspot/cpu/aarch64/vm_version_aarch64.cpp
@@ -365,16 +365,28 @@ void VM_Version::initialize() {
     FLAG_SET_DEFAULT(UseSHA256Intrinsics, false);
   }
 
-  if (UseSHA && VM_Version::supports_sha3()) {
-    // Auto-enable UseSHA3Intrinsics on hardware with performance benefit.
-    // Note that the evaluation of UseSHA3Intrinsics shows better performance
+  if (UseSHA) {
+    // No need to check VM_Version::supports_sha3(), since a fallback GPR intrinsic implementation is provided.
+    if (FLAG_IS_DEFAULT(UseSHA3Intrinsics)) {
+      FLAG_SET_DEFAULT(UseSHA3Intrinsics, true);
+    }
+  } else if (UseSHA3Intrinsics) {
+    // Matches the documented and tested behavior: the -UseSHA option disables all SHA intrinsics.
+    warning("UseSHA3Intrinsics requires that UseSHA is enabled.");
+    FLAG_SET_DEFAULT(UseSHA3Intrinsics, false);
+  }
+
+  if (UseSHA3Intrinsics && VM_Version::supports_sha3()) {
+    // Auto-enable UseSIMDForSHA3Intrinsic on hardware with performance benefit.
+    // Note that the evaluation of SHA3 extension Intrinsics shows better performance
     // on Apple and Qualcomm silicon but worse performance on Neoverse V1 and N2.
     if (_cpu == CPU_APPLE || _cpu == CPU_QUALCOMM) {  // Apple or Qualcomm silicon
-      if (FLAG_IS_DEFAULT(UseSHA3Intrinsics)) {
-        FLAG_SET_DEFAULT(UseSHA3Intrinsics, true);
+      if (FLAG_IS_DEFAULT(UseSIMDForSHA3Intrinsic)) {
+        FLAG_SET_DEFAULT(UseSIMDForSHA3Intrinsic, true);
       }
     }
-  } else if (UseSHA3Intrinsics && UseSIMDForSHA3Intrinsic) {
+  }
+  if (UseSHA3Intrinsics && UseSIMDForSHA3Intrinsic && !VM_Version::supports_sha3()) {
     warning("Intrinsics for SHA3-224, SHA3-256, SHA3-384 and SHA3-512 crypto hash functions not available on this CPU.");
     FLAG_SET_DEFAULT(UseSHA3Intrinsics, false);
   }
diff --git a/test/hotspot/jtreg/compiler/arguments/TestUseSHA3IntrinsicsWithUseSHADisabledOnSupportedCPU.java b/test/hotspot/jtreg/compiler/arguments/TestUseSHA3IntrinsicsWithUseSHADisabledOnSupportedCPU.java
index cf8000b7a21..10be61e98ec 100644
--- a/test/hotspot/jtreg/compiler/arguments/TestUseSHA3IntrinsicsWithUseSHADisabledOnSupportedCPU.java
+++ b/test/hotspot/jtreg/compiler/arguments/TestUseSHA3IntrinsicsWithUseSHADisabledOnSupportedCPU.java
@@ -52,7 +52,7 @@ public class TestUseSHA3IntrinsicsWithUseSHADisabledOnSupportedCPU {
     private static final String UNLOCK_DIAGNOSTIC = "-XX:+UnlockDiagnosticVMOptions";
 
     public static void main(String[] args) throws Throwable {
-        if (!IntrinsicPredicates.SHA3_INSTRUCTION_AVAILABLE.getAsBoolean()) {
+        if (!IntrinsicPredicates.SHA3_INTRINSIC_AVAILABLE.getAsBoolean()) {
             throw new SkippedException("Skipping... SHA3 intrinsics are not available on this platform.");
         }
 
@@ -111,7 +111,7 @@ public class TestUseSHA3IntrinsicsWithUseSHADisabledOnSupportedCPU {
     private static void testWarningWhenEnablingWithUseSHADisabled() throws Throwable {
         // A warning should be printed when trying to enable UseSHA3Intrinsics with -UseSHA
         CommandLineOptionTest.verifySameJVMStartup(
-            new String[] { WARNING_MESSAGE },  // Warning should appear
+            new String[] { "warning" },  // Warning should appear
             null,  // No unexpected output
             "JVM should start successfully",
             String.format("A warning should be printed when trying to enable %s while %s is disabled",
diff --git a/test/hotspot/jtreg/compiler/arguments/TestUseSHA3IntrinsicsWithUseSHADisabledOnUnsupportedCPU.java b/test/hotspot/jtreg/compiler/arguments/TestUseSHA3IntrinsicsWithUseSHADisabledOnUnsupportedCPU.java
index 1e0df1874b6..ebada79c877 100644
--- a/test/hotspot/jtreg/compiler/arguments/TestUseSHA3IntrinsicsWithUseSHADisabledOnUnsupportedCPU.java
+++ b/test/hotspot/jtreg/compiler/arguments/TestUseSHA3IntrinsicsWithUseSHADisabledOnUnsupportedCPU.java
@@ -51,7 +51,7 @@ public class TestUseSHA3IntrinsicsWithUseSHADisabledOnUnsupportedCPU {
     private static final String UNLOCK_DIAGNOSTIC = "-XX:+UnlockDiagnosticVMOptions";
 
     public static void main(String[] args) throws Throwable {
-        if (IntrinsicPredicates.SHA3_INSTRUCTION_AVAILABLE.getAsBoolean()) {
+        if (IntrinsicPredicates.SHA3_INTRINSIC_AVAILABLE.getAsBoolean()) {
             throw new SkippedException("Skipping... SHA3 intrinsics are available on this platform.");
         }
 
diff --git a/test/hotspot/jtreg/compiler/intrinsics/sha/cli/DigestOptionsBase.java b/test/hotspot/jtreg/compiler/intrinsics/sha/cli/DigestOptionsBase.java
index 22b3bba854c..b8a3896294b 100644
--- a/test/hotspot/jtreg/compiler/intrinsics/sha/cli/DigestOptionsBase.java
+++ b/test/hotspot/jtreg/compiler/intrinsics/sha/cli/DigestOptionsBase.java
@@ -122,7 +122,7 @@ public class DigestOptionsBase extends CommandLineOptionTest {
             case DigestOptionsBase.USE_SHA512_INTRINSICS_OPTION:
                 return IntrinsicPredicates.isSHA512IntrinsicAvailable();
             case DigestOptionsBase.USE_SHA3_INTRINSICS_OPTION:
-                return IntrinsicPredicates.SHA3_INSTRUCTION_AVAILABLE;
+                return IntrinsicPredicates.SHA3_INTRINSIC_AVAILABLE;
             default:
                 throw new Error("Unexpected option " + optionName);
         }
diff --git a/test/hotspot/jtreg/compiler/intrinsics/sha/cli/TestUseSHA3IntrinsicsOptionOnSupportedCPU.java b/test/hotspot/jtreg/compiler/intrinsics/sha/cli/TestUseSHA3IntrinsicsOptionOnSupportedCPU.java
index d3c0a4a8da7..c47591d75da 100644
--- a/test/hotspot/jtreg/compiler/intrinsics/sha/cli/TestUseSHA3IntrinsicsOptionOnSupportedCPU.java
+++ b/test/hotspot/jtreg/compiler/intrinsics/sha/cli/TestUseSHA3IntrinsicsOptionOnSupportedCPU.java
@@ -28,10 +28,7 @@
  * @summary Verify UseSHA3Intrinsics option processing on supported CPU.
  * @library /test/lib /
  * @requires vm.flagless
- * @requires os.arch == "aarch64" & os.family == "mac"
- * @comment sha3 is only implemented on AArch64 for now.
- *          UseSHA3Intrinsics is only auto-enabled on Apple silicon, because it
- *          may introduce performance regression on others. See JDK-8297092.
+ * @requires (os.arch == "aarch64" | os.arch == "amd64" | os.arch == "x86_64")
  *
  * @build jdk.test.whitebox.WhiteBox
  * @run driver jdk.test.lib.helpers.ClassFileInstaller jdk.test.whitebox.WhiteBox
diff --git a/test/hotspot/jtreg/compiler/intrinsics/sha/cli/testcases/GenericTestCaseForSupportedCPU.java b/test/hotspot/jtreg/compiler/intrinsics/sha/cli/testcases/GenericTestCaseForSupportedCPU.java
index 4b3914e75fd..f1c7069c317 100644
--- a/test/hotspot/jtreg/compiler/intrinsics/sha/cli/testcases/GenericTestCaseForSupportedCPU.java
+++ b/test/hotspot/jtreg/compiler/intrinsics/sha/cli/testcases/GenericTestCaseForSupportedCPU.java
@@ -80,7 +80,8 @@ public class GenericTestCaseForSupportedCPU extends
                 // Verify that if -XX:-UseSHA is passed to the JVM, it is not possible
                 // to enable the tested option and a warning is printed.
                 CommandLineOptionTest.verifySameJVMStartup(
-                        new String[] { DigestOptionsBase.getWarningForUnsupportedCPU(optionName) },
+                        new String[] { "warning: " }, // Accept any warning message, e.g. "requires that UseSHA is enabled"
+                                                      // or the common "not available on this CPU" message.
                         null,
                         shouldPassMessage,
                         String.format("Enabling option '%s' should not be possible and should result in a warning if %s was passed to JVM",
diff --git a/test/hotspot/jtreg/compiler/intrinsics/sha/cli/testcases/GenericTestCaseForUnsupportedCPU.java b/test/hotspot/jtreg/compiler/intrinsics/sha/cli/testcases/GenericTestCaseForUnsupportedCPU.java
index 85f6f280ccb..b2a0720e6e8 100644
--- a/test/hotspot/jtreg/compiler/intrinsics/sha/cli/testcases/GenericTestCaseForUnsupportedCPU.java
+++ b/test/hotspot/jtreg/compiler/intrinsics/sha/cli/testcases/GenericTestCaseForUnsupportedCPU.java
@@ -71,7 +71,8 @@ public class GenericTestCaseForUnsupportedCPU extends
             // a warning will occur in VM output if UseSHA is disabled.
             if (!optionName.equals(DigestOptionsBase.USE_SHA_OPTION)) {
                 CommandLineOptionTest.verifySameJVMStartup(
-                        new String[] { DigestOptionsBase.getWarningForUnsupportedCPU(optionName) },
+                        new String[] { "warning: " }, // Accept any warning message, e.g. "requires that UseSHA is enabled"
+                                                      // or the common "not available on this CPU" message.
                         null,
                         shouldPassMessage,
                         shouldPassMessage,
diff --git a/test/hotspot/jtreg/compiler/testlibrary/sha/predicate/IntrinsicPredicates.java b/test/hotspot/jtreg/compiler/testlibrary/sha/predicate/IntrinsicPredicates.java
index 0c53c36af1d..b088f58bb5b 100644
--- a/test/hotspot/jtreg/compiler/testlibrary/sha/predicate/IntrinsicPredicates.java
+++ b/test/hotspot/jtreg/compiler/testlibrary/sha/predicate/IntrinsicPredicates.java
@@ -109,6 +109,12 @@ public class IntrinsicPredicates {
               new OrPredicate(new CPUSpecificPredicate("amd64.*",   new String[] {"avx512f", "avx512bw"}, null),
                               new CPUSpecificPredicate("x86_64",    new String[] {"avx512f", "avx512bw"}, null)));
 
+    public static final BooleanSupplier SHA3_INTRINSIC_AVAILABLE
+            // AArch64 has both SHA3-based and GPR-based implementations of the SHA3 intrinsic. No need for the SHA3 capability.
+            = new OrPredicate(new CPUSpecificPredicate("aarch64.*", null, null),
+              new OrPredicate(new CPUSpecificPredicate("amd64.*",   new String[] {"avx512f", "avx512bw"}, null),
+                              new CPUSpecificPredicate("x86_64",    new String[] {"avx512f", "avx512bw"}, null)));
+
     public static final BooleanSupplier ANY_SHA_INSTRUCTION_AVAILABLE
             = new OrPredicate(IntrinsicPredicates.SHA1_INSTRUCTION_AVAILABLE,
               new OrPredicate(IntrinsicPredicates.SHA256_INSTRUCTION_AVAILABLE,

From 9bd99b9d68d998dbb0158ed9d31e64b499159856 Mon Sep 17 00:00:00 2001
From: Chris Plummer <cjplummer@openjdk.org>
Date: Thu, 5 Mar 2026 16:42:07 +0000
Subject: [PATCH 058/655] 8378854: Disable SA tests when ZGC is being used

Reviewed-by: ysuenaga, kevinw, syan, stefank
---
 test/hotspot/jtreg/ProblemList-zgc.txt        | 76 -------------------
 .../sa/TestHeapDumpForLargeArray.java         |  6 +-
 .../serviceability/sa/CDSJMapClstats.java     |  6 +-
 .../jtreg/serviceability/sa/ClhsdbAttach.java |  3 +-
 .../sa/ClhsdbAttachDifferentJVMs.java         |  3 +-
 .../serviceability/sa/ClhsdbCDSCore.java      |  3 +-
 .../sa/ClhsdbCDSJstackPrintAll.java           |  6 +-
 .../serviceability/sa/ClhsdbClasses.java      |  3 +-
 .../serviceability/sa/ClhsdbDumpclass.java    |  3 +-
 .../serviceability/sa/ClhsdbDumpheap.java     |  1 +
 .../jtreg/serviceability/sa/ClhsdbField.java  |  3 +-
 .../jtreg/serviceability/sa/ClhsdbFindPC.java | 10 ++-
 .../jtreg/serviceability/sa/ClhsdbFlags.java  |  3 +-
 .../serviceability/sa/ClhsdbHistory.java      |  3 +-
 .../serviceability/sa/ClhsdbInspect.java      |  1 +
 .../jtreg/serviceability/sa/ClhsdbJdis.java   |  3 +-
 .../jtreg/serviceability/sa/ClhsdbJhisto.java |  3 +-
 .../jtreg/serviceability/sa/ClhsdbJstack.java |  4 +-
 .../sa/ClhsdbJstackWithConcurrentLock.java    |  3 +-
 .../sa/ClhsdbJstackXcompStress.java           |  3 +-
 .../serviceability/sa/ClhsdbLongConstant.java |  3 +-
 .../jtreg/serviceability/sa/ClhsdbPmap.java   |  4 +-
 .../serviceability/sa/ClhsdbPrintAll.java     |  3 +-
 .../serviceability/sa/ClhsdbPrintAs.java      |  3 +-
 .../serviceability/sa/ClhsdbPrintStatics.java |  3 +-
 .../jtreg/serviceability/sa/ClhsdbPstack.java |  4 +-
 .../serviceability/sa/ClhsdbScanOops.java     |  6 +-
 .../jtreg/serviceability/sa/ClhsdbSource.java |  3 +-
 .../jtreg/serviceability/sa/ClhsdbSymbol.java |  3 +-
 .../sa/ClhsdbTestAllocationMerge.java         |  3 +-
 .../jtreg/serviceability/sa/ClhsdbThread.java |  3 +-
 .../sa/ClhsdbThreadContext.java               |  3 +-
 .../sa/ClhsdbVmStructsDump.java               |  3 +-
 .../jtreg/serviceability/sa/ClhsdbWhere.java  |  3 +-
 .../sa/DeadlockDetectionTest.java             |  3 +-
 .../sa/JhsdbThreadInfoTest.java               |  3 +-
 .../serviceability/sa/TestClassDump.java      |  3 +-
 .../sa/TestClhsdbJstackLock.java              |  3 +-
 .../sa/TestCpoolForInvokeDynamic.java         |  3 +-
 .../sa/TestDebugInfoDecode.java               |  3 +-
 .../serviceability/sa/TestDefaultMethods.java |  3 +-
 .../sa/TestHeapDumpForInvokeDynamic.java      |  3 +-
 .../sa/TestInstanceKlassSize.java             |  3 +-
 .../sa/TestInstanceKlassSizeForInterface.java |  3 +-
 .../serviceability/sa/TestIntConstant.java    |  3 +-
 .../sa/TestJhsdbJstackLineNumbers.java        |  3 +-
 .../sa/TestJhsdbJstackLock.java               |  3 +-
 .../sa/TestJhsdbJstackMixed.java              |  4 +-
 .../sa/TestJhsdbJstackMixedCore.java          |  4 +-
 .../TestJhsdbJstackMixedWithVDSOCallCore.java |  4 +-
 .../sa/TestJhsdbJstackMixedWithXComp.java     |  5 +-
 .../sa/TestJhsdbJstackPrintVMLocks.java       |  3 +-
 .../sa/TestJhsdbJstackUpcall.java             |  3 +-
 .../sa/TestJhsdbJstackWithVirtualThread.java  |  3 +-
 .../jtreg/serviceability/sa/TestJmapCore.java |  3 +-
 .../sa/TestJmapCoreMetaspace.java             |  3 +-
 .../sa/TestObjectAlignment.java               |  6 +-
 .../sa/TestObjectMonitorIterate.java          |  3 +-
 .../sa/TestRevPtrsForInvokeDynamic.java       |  3 +-
 .../jtreg/serviceability/sa/TestSysProps.java |  3 +-
 .../jtreg/serviceability/sa/TestType.java     |  3 +-
 .../serviceability/sa/UniqueVtableTest.java   |  3 +-
 .../sa/jmap-hprof/JMapHProfLargeHeapTest.java |  3 +-
 .../sadebugd/ClhsdbAttachToDebugServer.java   |  3 +-
 .../sadebugd/ClhsdbTestConnectArgument.java   |  3 +-
 .../sa/sadebugd/DebugdConnectTest.java        |  3 +-
 .../sa/sadebugd/DisableRegistryTest.java      |  3 +-
 .../sa/sadebugd/PmapOnDebugdTest.java         |  3 +-
 .../sa/sadebugd/RunCommandOnServerTest.java   |  3 +-
 .../sa/sadebugd/SADebugDTest.java             |  3 +-
 test/jdk/ProblemList-zgc.txt                  | 10 ---
 .../sun/tools/jhsdb/BasicLauncherTest.java    |  3 +-
 test/jdk/sun/tools/jhsdb/HeapDumpTest.java    |  3 +-
 .../jhsdb/HeapDumpTestWithActiveProcess.java  |  3 +-
 .../sun/tools/jhsdb/JShellHeapDumpTest.java   |  3 +-
 .../jdk/sun/tools/jhsdb/JStackStressTest.java |  3 +-
 .../jhsdb/heapconfig/JMapHeapConfigTest.java  |  3 +-
 77 files changed, 170 insertions(+), 167 deletions(-)

diff --git a/test/hotspot/jtreg/ProblemList-zgc.txt b/test/hotspot/jtreg/ProblemList-zgc.txt
index 3e52b7169df..8514ffce11c 100644
--- a/test/hotspot/jtreg/ProblemList-zgc.txt
+++ b/test/hotspot/jtreg/ProblemList-zgc.txt
@@ -27,82 +27,6 @@
 #
 #############################################################################
 
-# Quiet the majority of SA tests
-# We run serviceability/sa/TestUniverse.java as a sanity check for minimal functionality
-
-resourcehogs/serviceability/sa/TestHeapDumpForLargeArray.java 8307393   generic-all
-serviceability/sa/CDSJMapClstats.java                         8307393   generic-all
-serviceability/sa/ClhsdbAttach.java                           8307393   generic-all
-serviceability/sa/ClhsdbAttachDifferentJVMs.java              8307393   generic-all
-serviceability/sa/ClhsdbCDSCore.java                          8307393   generic-all
-serviceability/sa/ClhsdbCDSJstackPrintAll.java                8307393   generic-all
-serviceability/sa/ClhsdbClasses.java                          8307393   generic-all
-serviceability/sa/ClhsdbDumpclass.java                        8307393   generic-all
-serviceability/sa/ClhsdbDumpheap.java                         8307393   generic-all
-serviceability/sa/ClhsdbField.java                            8307393   generic-all
-serviceability/sa/ClhsdbFindPC.java#no-xcomp-core             8307393   generic-all
-serviceability/sa/ClhsdbFindPC.java#no-xcomp-process          8307393   generic-all
-serviceability/sa/ClhsdbFindPC.java#xcomp-core                8307393   generic-all
-serviceability/sa/ClhsdbFindPC.java#xcomp-process             8307393   generic-all
-serviceability/sa/ClhsdbFlags.java                            8307393   generic-all
-serviceability/sa/ClhsdbHistory.java                          8307393   generic-all
-serviceability/sa/ClhsdbInspect.java                          8307393   generic-all
-serviceability/sa/ClhsdbJdis.java                             8307393   generic-all
-serviceability/sa/ClhsdbJhisto.java                           8307393   generic-all
-serviceability/sa/ClhsdbJstack.java#id0                       8307393   generic-all
-serviceability/sa/ClhsdbJstack.java#id1                       8307393   generic-all
-serviceability/sa/ClhsdbJstackWithConcurrentLock.java         8307393   generic-all
-serviceability/sa/ClhsdbJstackXcompStress.java                8307393   generic-all
-serviceability/sa/ClhsdbLongConstant.java                     8307393   generic-all
-serviceability/sa/ClhsdbPmap.java#core                        8307393   generic-all
-serviceability/sa/ClhsdbPmap.java#process                     8307393   generic-all
-serviceability/sa/ClhsdbPrintAll.java                         8307393   generic-all
-serviceability/sa/ClhsdbPrintAs.java                          8307393   generic-all
-serviceability/sa/ClhsdbPrintStatics.java                     8307393   generic-all
-serviceability/sa/ClhsdbPstack.java#core                      8307393   generic-all
-serviceability/sa/ClhsdbPstack.java#process                   8307393   generic-all
-serviceability/sa/ClhsdbScanOops.java#parallel                8307393   generic-all
-serviceability/sa/ClhsdbScanOops.java#serial                  8307393   generic-all
-serviceability/sa/ClhsdbSource.java                           8307393   generic-all
-serviceability/sa/ClhsdbSymbol.java                           8307393   generic-all
-serviceability/sa/ClhsdbThread.java                           8307393   generic-all
-serviceability/sa/ClhsdbThreadContext.java                    8307393   generic-all
-serviceability/sa/ClhsdbVmStructsDump.java                    8307393   generic-all
-serviceability/sa/ClhsdbWhere.java                            8307393   generic-all
-serviceability/sa/DeadlockDetectionTest.java                  8307393   generic-all
-serviceability/sa/JhsdbThreadInfoTest.java                    8307393   generic-all
-serviceability/sa/TestClassDump.java                          8307393   generic-all
-serviceability/sa/TestClhsdbJstackLock.java                   8307393   generic-all
-serviceability/sa/TestCpoolForInvokeDynamic.java              8307393   generic-all
-serviceability/sa/TestDefaultMethods.java                     8307393   generic-all
-serviceability/sa/TestG1HeapRegion.java                       8307393   generic-all
-serviceability/sa/TestHeapDumpForInvokeDynamic.java           8307393   generic-all
-serviceability/sa/TestInstanceKlassSize.java                  8307393   generic-all
-serviceability/sa/TestInstanceKlassSizeForInterface.java      8307393   generic-all
-serviceability/sa/TestIntConstant.java                        8307393   generic-all
-serviceability/sa/TestJhsdbJstackLineNumbers.java             8307393   generic-all
-serviceability/sa/TestJhsdbJstackLock.java                    8307393   generic-all
-serviceability/sa/TestJhsdbJstackMixed.java                   8307393   generic-all
-serviceability/sa/TestJhsdbJstackPrintVMLocks.java            8307393   generic-all
-serviceability/sa/TestJhsdbJstackUpcall.java                  8307393   generic-all
-serviceability/sa/TestJmapCore.java                           8307393   generic-all
-serviceability/sa/TestJmapCoreMetaspace.java                  8307393   generic-all
-serviceability/sa/TestObjectAlignment.java                    8307393   generic-all
-serviceability/sa/TestObjectMonitorIterate.java               8307393   generic-all
-serviceability/sa/TestPrintMdo.java                           8307393   generic-all
-serviceability/sa/TestRevPtrsForInvokeDynamic.java            8307393   generic-all
-serviceability/sa/TestSysProps.java                           8307393   generic-all
-serviceability/sa/TestType.java                               8307393   generic-all
-serviceability/sa/UniqueVtableTest.java                       8307393   generic-all
-serviceability/sa/jmap-hprof/JMapHProfLargeHeapTest.java      8307393   generic-all
-serviceability/sa/sadebugd/ClhsdbAttachToDebugServer.java     8307393   generic-all
-serviceability/sa/sadebugd/ClhsdbTestConnectArgument.java     8307393   generic-all
-serviceability/sa/ClhsdbTestAllocationMerge.java              8307393   generic-all
-serviceability/sa/sadebugd/DebugdConnectTest.java             8307393   generic-all
-serviceability/sa/sadebugd/DisableRegistryTest.java           8307393   generic-all
-serviceability/sa/sadebugd/PmapOnDebugdTest.java              8307393   generic-all
-serviceability/sa/sadebugd/RunCommandOnServerTest.java        8307393   generic-all
-serviceability/sa/sadebugd/SADebugDTest.java                  8307393   generic-all
 
 vmTestbase/gc/gctests/MemoryEaterMT/MemoryEaterMT.java        8289582   windows-x64
 
diff --git a/test/hotspot/jtreg/resourcehogs/serviceability/sa/TestHeapDumpForLargeArray.java b/test/hotspot/jtreg/resourcehogs/serviceability/sa/TestHeapDumpForLargeArray.java
index 553b8fbac35..cf32880c182 100644
--- a/test/hotspot/jtreg/resourcehogs/serviceability/sa/TestHeapDumpForLargeArray.java
+++ b/test/hotspot/jtreg/resourcehogs/serviceability/sa/TestHeapDumpForLargeArray.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2017, 2020, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2017, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -35,7 +35,9 @@ import jdk.test.lib.Utils;
  * @test
  * @library /test/lib
  * @bug 8171084
- * @requires vm.hasSA & (vm.bits == "64" & os.maxMemory > 8g)
+ * @requires vm.hasSA
+ * @requires vm.gc != "Z"
+ * @requires vm.bits == "64" & os.maxMemory > 8g
  * @modules java.base/jdk.internal.misc
  *          jdk.hotspot.agent/sun.jvm.hotspot
  *          jdk.hotspot.agent/sun.jvm.hotspot.utilities
diff --git a/test/hotspot/jtreg/serviceability/sa/CDSJMapClstats.java b/test/hotspot/jtreg/serviceability/sa/CDSJMapClstats.java
index 4fd202a18da..8a9f148b3be 100644
--- a/test/hotspot/jtreg/serviceability/sa/CDSJMapClstats.java
+++ b/test/hotspot/jtreg/serviceability/sa/CDSJMapClstats.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,7 +25,9 @@
  * @test
  * @bug 8204308
  * @summary Test the jhsdb jmap -clstats command with CDS enabled
- * @requires vm.hasSA & vm.cds
+ * @requires vm.hasSA
+ * @requires vm.gc != "Z"
+ * @requires vm.cds
  * @library /test/lib
  * @run driver/timeout=2400 CDSJMapClstats
  */
diff --git a/test/hotspot/jtreg/serviceability/sa/ClhsdbAttach.java b/test/hotspot/jtreg/serviceability/sa/ClhsdbAttach.java
index 57cd535a430..6493a803e90 100644
--- a/test/hotspot/jtreg/serviceability/sa/ClhsdbAttach.java
+++ b/test/hotspot/jtreg/serviceability/sa/ClhsdbAttach.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2017, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2017, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -33,6 +33,7 @@ import jtreg.SkippedException;
  * @bug 8191658
  * @summary Test clhsdb attach, detach, reattach commands
  * @requires vm.hasSA
+ * @requires vm.gc != "Z"
  * @requires (os.arch != "riscv64" | !(vm.cpu.features ~= ".*qemu.*"))
  * @library /test/lib
  * @run main/othervm ClhsdbAttach
diff --git a/test/hotspot/jtreg/serviceability/sa/ClhsdbAttachDifferentJVMs.java b/test/hotspot/jtreg/serviceability/sa/ClhsdbAttachDifferentJVMs.java
index 09f90355e67..f6833d5379a 100644
--- a/test/hotspot/jtreg/serviceability/sa/ClhsdbAttachDifferentJVMs.java
+++ b/test/hotspot/jtreg/serviceability/sa/ClhsdbAttachDifferentJVMs.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2023, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2023, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -33,6 +33,7 @@ import jtreg.SkippedException;
  * @bug 8314679
  * @summary Test clhsdb attach, detach, and then attach to different JVM
  * @requires vm.hasSA
+ * @requires vm.gc != "Z"
  * @requires (os.arch != "riscv64" | !(vm.cpu.features ~= ".*qemu.*"))
  * @library /test/lib
  * @run main/othervm ClhsdbAttachDifferentJVMs
diff --git a/test/hotspot/jtreg/serviceability/sa/ClhsdbCDSCore.java b/test/hotspot/jtreg/serviceability/sa/ClhsdbCDSCore.java
index aa3b19c4fcf..ab5b73bf720 100644
--- a/test/hotspot/jtreg/serviceability/sa/ClhsdbCDSCore.java
+++ b/test/hotspot/jtreg/serviceability/sa/ClhsdbCDSCore.java
@@ -25,8 +25,9 @@
  * @test
  * @bug 8174994 8200613
  * @summary Test the clhsdb commands 'printall', 'jstack' on a CDS enabled corefile.
- * @requires vm.cds
  * @requires vm.hasSA
+ * @requires vm.gc != "Z"
+ * @requires vm.cds
  * @requires vm.flavor == "server"
  * @library /test/lib
  * @modules java.base/jdk.internal.misc
diff --git a/test/hotspot/jtreg/serviceability/sa/ClhsdbCDSJstackPrintAll.java b/test/hotspot/jtreg/serviceability/sa/ClhsdbCDSJstackPrintAll.java
index 4d01f9a26c8..c1e632782e2 100644
--- a/test/hotspot/jtreg/serviceability/sa/ClhsdbCDSJstackPrintAll.java
+++ b/test/hotspot/jtreg/serviceability/sa/ClhsdbCDSJstackPrintAll.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,7 +25,9 @@
  * @test
  * @bug 8174994
  * @summary Test the clhsdb commands 'jstack', 'printall', 'where' with CDS enabled
- * @requires vm.hasSA & vm.cds
+ * @requires vm.hasSA
+ * @requires vm.gc != "Z"
+ * @requires vm.cds
  * @library /test/lib
  * @run main/othervm/timeout=2400 -Xmx1g ClhsdbCDSJstackPrintAll
  */
diff --git a/test/hotspot/jtreg/serviceability/sa/ClhsdbClasses.java b/test/hotspot/jtreg/serviceability/sa/ClhsdbClasses.java
index 3193f03bbc7..c4d11d29ec1 100644
--- a/test/hotspot/jtreg/serviceability/sa/ClhsdbClasses.java
+++ b/test/hotspot/jtreg/serviceability/sa/ClhsdbClasses.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2020, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -33,6 +33,7 @@ import jtreg.SkippedException;
  * @bug 8242142
  * @summary Test clhsdb class and classes commands
  * @requires vm.hasSA
+ * @requires vm.gc != "Z"
  * @requires (os.arch != "riscv64" | !(vm.cpu.features ~= ".*qemu.*"))
  * @library /test/lib
  * @run main/othervm ClhsdbClasses
diff --git a/test/hotspot/jtreg/serviceability/sa/ClhsdbDumpclass.java b/test/hotspot/jtreg/serviceability/sa/ClhsdbDumpclass.java
index e45318e201d..49a3eb5615c 100644
--- a/test/hotspot/jtreg/serviceability/sa/ClhsdbDumpclass.java
+++ b/test/hotspot/jtreg/serviceability/sa/ClhsdbDumpclass.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2020, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -39,6 +39,7 @@ import jtreg.SkippedException;
  * @bug 8240990
  * @summary Test clhsdb dumpclass command
  * @requires vm.hasSA
+ * @requires vm.gc != "Z"
  * @requires (os.arch != "riscv64" | !(vm.cpu.features ~= ".*qemu.*"))
  * @library /test/lib
  * @run driver ClhsdbDumpclass
diff --git a/test/hotspot/jtreg/serviceability/sa/ClhsdbDumpheap.java b/test/hotspot/jtreg/serviceability/sa/ClhsdbDumpheap.java
index d9f856ab0a3..92ec1c5d160 100644
--- a/test/hotspot/jtreg/serviceability/sa/ClhsdbDumpheap.java
+++ b/test/hotspot/jtreg/serviceability/sa/ClhsdbDumpheap.java
@@ -43,6 +43,7 @@ import jtreg.SkippedException;
  * @bug 8240989
  * @summary Test clhsdb dumpheap command
  * @requires vm.hasSA
+ * @requires vm.gc != "Z"
  * @requires (os.arch != "riscv64" | !(vm.cpu.features ~= ".*qemu.*"))
  * @requires vm.compMode != "Xcomp"
  * @comment Running this test with -Xcomp is slow and therefore tends to cause
diff --git a/test/hotspot/jtreg/serviceability/sa/ClhsdbField.java b/test/hotspot/jtreg/serviceability/sa/ClhsdbField.java
index 7dc676f1f3a..1df35dccce3 100644
--- a/test/hotspot/jtreg/serviceability/sa/ClhsdbField.java
+++ b/test/hotspot/jtreg/serviceability/sa/ClhsdbField.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2017, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2017, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -32,6 +32,7 @@ import jtreg.SkippedException;
  * @bug 8191538
  * @summary Test clhsdb 'field' command
  * @requires vm.hasSA
+ * @requires vm.gc != "Z"
  * @requires (os.arch != "riscv64" | !(vm.cpu.features ~= ".*qemu.*"))
  * @library /test/lib
  * @run main/othervm ClhsdbField
diff --git a/test/hotspot/jtreg/serviceability/sa/ClhsdbFindPC.java b/test/hotspot/jtreg/serviceability/sa/ClhsdbFindPC.java
index 7ced4c9515b..1997e497af8 100644
--- a/test/hotspot/jtreg/serviceability/sa/ClhsdbFindPC.java
+++ b/test/hotspot/jtreg/serviceability/sa/ClhsdbFindPC.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2017, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2017, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -35,8 +35,9 @@ import jtreg.SkippedException;
  * @test id=xcomp-process
  * @bug 8193124
  * @summary Test the clhsdb 'findpc' command with Xcomp on live process
- * @requires vm.compMode != "Xcomp"
  * @requires vm.hasSA
+ * @requires vm.gc != "Z"
+ * @requires vm.compMode != "Xcomp"
  * @requires (os.arch != "riscv64" | !(vm.cpu.features ~= ".*qemu.*"))
  * @requires vm.compiler1.enabled
  * @requires vm.opt.DeoptimizeALot != true
@@ -48,8 +49,9 @@ import jtreg.SkippedException;
  * @test id=xcomp-core
  * @bug 8193124
  * @summary Test the clhsdb 'findpc' command with Xcomp on core file
- * @requires vm.compMode != "Xcomp"
  * @requires vm.hasSA
+ * @requires vm.gc != "Z"
+ * @requires vm.compMode != "Xcomp"
  * @requires vm.compiler1.enabled
  * @requires vm.opt.DeoptimizeALot != true
  * @library /test/lib
@@ -61,6 +63,7 @@ import jtreg.SkippedException;
  * @bug 8193124
  * @summary Test the clhsdb 'findpc' command w/o Xcomp on live process
  * @requires vm.hasSA
+ * @requires vm.gc != "Z"
  * @requires (os.arch != "riscv64" | !(vm.cpu.features ~= ".*qemu.*"))
  * @requires vm.compiler1.enabled
  * @library /test/lib
@@ -72,6 +75,7 @@ import jtreg.SkippedException;
  * @bug 8193124
  * @summary Test the clhsdb 'findpc' command w/o Xcomp on core file
  * @requires vm.hasSA
+ * @requires vm.gc != "Z"
  * @requires vm.compiler1.enabled
  * @library /test/lib
  * @run main/othervm/timeout=1920 ClhsdbFindPC false true
diff --git a/test/hotspot/jtreg/serviceability/sa/ClhsdbFlags.java b/test/hotspot/jtreg/serviceability/sa/ClhsdbFlags.java
index a19f3e1ca16..1c8cf7191dd 100644
--- a/test/hotspot/jtreg/serviceability/sa/ClhsdbFlags.java
+++ b/test/hotspot/jtreg/serviceability/sa/ClhsdbFlags.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2017, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2017, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -36,6 +36,7 @@ import jtreg.SkippedException;
  * @bug 8217845
  * @summary Test clhsdb flags command
  * @requires vm.hasSA
+ * @requires vm.gc != "Z"
  * @requires (os.arch != "riscv64" | !(vm.cpu.features ~= ".*qemu.*"))
  * @library /test/lib
  * @run driver ClhsdbFlags
diff --git a/test/hotspot/jtreg/serviceability/sa/ClhsdbHistory.java b/test/hotspot/jtreg/serviceability/sa/ClhsdbHistory.java
index e8416cbadd8..5dabb898936 100644
--- a/test/hotspot/jtreg/serviceability/sa/ClhsdbHistory.java
+++ b/test/hotspot/jtreg/serviceability/sa/ClhsdbHistory.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2021, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2021, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -36,6 +36,7 @@ import jtreg.SkippedException;
  * @bug 8217845
  * @summary Test clhsdb command line history support
  * @requires vm.hasSA
+ * @requires vm.gc != "Z"
  * @requires (os.arch != "riscv64" | !(vm.cpu.features ~= ".*qemu.*"))
  * @library /test/lib
  * @run main/othervm ClhsdbHistory
diff --git a/test/hotspot/jtreg/serviceability/sa/ClhsdbInspect.java b/test/hotspot/jtreg/serviceability/sa/ClhsdbInspect.java
index 553706e502d..c0c062223d4 100644
--- a/test/hotspot/jtreg/serviceability/sa/ClhsdbInspect.java
+++ b/test/hotspot/jtreg/serviceability/sa/ClhsdbInspect.java
@@ -26,6 +26,7 @@
  * @bug 8192985
  * @summary Test the clhsdb 'inspect' command
  * @requires vm.hasSA
+ * @requires vm.gc != "Z"
  * @requires (os.arch != "riscv64" | !(vm.cpu.features ~= ".*qemu.*"))
  * @library /test/lib
  * @run main/othervm/timeout=480 ClhsdbInspect
diff --git a/test/hotspot/jtreg/serviceability/sa/ClhsdbJdis.java b/test/hotspot/jtreg/serviceability/sa/ClhsdbJdis.java
index 756e45f68aa..6c0ff0e3dbe 100644
--- a/test/hotspot/jtreg/serviceability/sa/ClhsdbJdis.java
+++ b/test/hotspot/jtreg/serviceability/sa/ClhsdbJdis.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2017, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2017, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -26,6 +26,7 @@
  * @bug 8193124
  * @summary Test the clhsdb 'jdis' command
  * @requires vm.hasSA
+ * @requires vm.gc != "Z"
  * @requires (os.arch != "riscv64" | !(vm.cpu.features ~= ".*qemu.*"))
  * @library /test/lib
  * @run main/othervm ClhsdbJdis
diff --git a/test/hotspot/jtreg/serviceability/sa/ClhsdbJhisto.java b/test/hotspot/jtreg/serviceability/sa/ClhsdbJhisto.java
index ef30a97a026..a582b01e832 100644
--- a/test/hotspot/jtreg/serviceability/sa/ClhsdbJhisto.java
+++ b/test/hotspot/jtreg/serviceability/sa/ClhsdbJhisto.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2017, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2017, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -35,6 +35,7 @@ import jtreg.SkippedException;
  * @bug 8191658
  * @summary Test clhsdb jhisto command
  * @requires vm.hasSA
+ * @requires vm.gc != "Z"
  * @requires (os.arch != "riscv64" | !(vm.cpu.features ~= ".*qemu.*"))
  * @library /test/lib
  * @run main/othervm ClhsdbJhisto
diff --git a/test/hotspot/jtreg/serviceability/sa/ClhsdbJstack.java b/test/hotspot/jtreg/serviceability/sa/ClhsdbJstack.java
index 411664f195d..f066950cfc3 100644
--- a/test/hotspot/jtreg/serviceability/sa/ClhsdbJstack.java
+++ b/test/hotspot/jtreg/serviceability/sa/ClhsdbJstack.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2017, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2017, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -33,6 +33,7 @@ import jtreg.SkippedException;
  * @bug 8190198
  * @summary Test clhsdb Jstack command
  * @requires vm.hasSA
+ * @requires vm.gc != "Z"
  * @requires (os.arch != "riscv64" | !(vm.cpu.features ~= ".*qemu.*"))
  * @library /test/lib
  * @run main/othervm/timeout=480 ClhsdbJstack true
@@ -44,6 +45,7 @@ import jtreg.SkippedException;
  * @requires vm.compMode != "Xcomp"
  * @summary Test clhsdb Jstack command
  * @requires vm.hasSA
+ * @requires vm.gc != "Z"
  * @requires (os.arch != "riscv64" | !(vm.cpu.features ~= ".*qemu.*"))
  * @library /test/lib
  * @run main/othervm/timeout=480 ClhsdbJstack false
diff --git a/test/hotspot/jtreg/serviceability/sa/ClhsdbJstackWithConcurrentLock.java b/test/hotspot/jtreg/serviceability/sa/ClhsdbJstackWithConcurrentLock.java
index 64080b252c5..e3d586c9d8a 100644
--- a/test/hotspot/jtreg/serviceability/sa/ClhsdbJstackWithConcurrentLock.java
+++ b/test/hotspot/jtreg/serviceability/sa/ClhsdbJstackWithConcurrentLock.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2024, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2024, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -26,6 +26,7 @@
  * @bug 8324066
  * @summary Test the clhsdb 'jstack -l' command for printing concurrent lock information
  * @requires vm.hasSA
+ * @requires vm.gc != "Z"
  * @requires (os.arch != "riscv64" | !(vm.cpu.features ~= ".*qemu.*"))
  * @library /test/lib
  * @run main/othervm ClhsdbJstackWithConcurrentLock
diff --git a/test/hotspot/jtreg/serviceability/sa/ClhsdbJstackXcompStress.java b/test/hotspot/jtreg/serviceability/sa/ClhsdbJstackXcompStress.java
index 4b02c01119d..a24b401dc47 100644
--- a/test/hotspot/jtreg/serviceability/sa/ClhsdbJstackXcompStress.java
+++ b/test/hotspot/jtreg/serviceability/sa/ClhsdbJstackXcompStress.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2020, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
  * Copyright (c) 2019, Red Hat Inc. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
@@ -36,6 +36,7 @@ import jdk.test.lib.process.OutputAnalyzer;
  * @test
  * @bug 8196969
  * @requires vm.hasSA
+ * @requires vm.gc != "Z"
  * @requires (os.arch != "riscv64" | !(vm.cpu.features ~= ".*qemu.*"))
  * @requires vm.opt.DeoptimizeALot != true
  * @library /test/lib
diff --git a/test/hotspot/jtreg/serviceability/sa/ClhsdbLongConstant.java b/test/hotspot/jtreg/serviceability/sa/ClhsdbLongConstant.java
index fceb2097e46..7fd3eb23d02 100644
--- a/test/hotspot/jtreg/serviceability/sa/ClhsdbLongConstant.java
+++ b/test/hotspot/jtreg/serviceability/sa/ClhsdbLongConstant.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2017, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2017, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -26,6 +26,7 @@
  * @bug 8190198
  * @summary Test clhsdb longConstant command
  * @requires vm.hasSA
+ * @requires vm.gc != "Z"
  * @requires (os.arch != "riscv64" | !(vm.cpu.features ~= ".*qemu.*"))
  * @library /test/lib
  * @run main/othervm ClhsdbLongConstant
diff --git a/test/hotspot/jtreg/serviceability/sa/ClhsdbPmap.java b/test/hotspot/jtreg/serviceability/sa/ClhsdbPmap.java
index 5c0aa9457ae..885694f7abb 100644
--- a/test/hotspot/jtreg/serviceability/sa/ClhsdbPmap.java
+++ b/test/hotspot/jtreg/serviceability/sa/ClhsdbPmap.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2017, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2017, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -35,6 +35,7 @@ import jtreg.SkippedException;
  * @bug 8190198
  * @summary Test clhsdb pmap command on a live process
  * @requires vm.hasSA
+ * @requires vm.gc != "Z"
  * @requires (os.arch != "riscv64" | !(vm.cpu.features ~= ".*qemu.*"))
  * @library /test/lib
  * @run main/othervm ClhsdbPmap false
@@ -45,6 +46,7 @@ import jtreg.SkippedException;
  * @bug 8190198
  * @summary Test clhsdb pmap command on a core file
  * @requires vm.hasSA
+ * @requires vm.gc != "Z"
  * @library /test/lib
  * @run main/othervm/timeout=480 ClhsdbPmap true
  */
diff --git a/test/hotspot/jtreg/serviceability/sa/ClhsdbPrintAll.java b/test/hotspot/jtreg/serviceability/sa/ClhsdbPrintAll.java
index ac5ddf774e1..a62142c2c5c 100644
--- a/test/hotspot/jtreg/serviceability/sa/ClhsdbPrintAll.java
+++ b/test/hotspot/jtreg/serviceability/sa/ClhsdbPrintAll.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -32,6 +32,7 @@ import jtreg.SkippedException;
  * @bug 8175384
  * @summary Test clhsdb 'printall' command
  * @requires vm.hasSA
+ * @requires vm.gc != "Z"
  * @requires (os.arch != "riscv64" | !(vm.cpu.features ~= ".*qemu.*"))
  * @library /test/lib
  * @run main/othervm/timeout=2400 -Xmx2g ClhsdbPrintAll
diff --git a/test/hotspot/jtreg/serviceability/sa/ClhsdbPrintAs.java b/test/hotspot/jtreg/serviceability/sa/ClhsdbPrintAs.java
index 03ce8cd3048..c7e7e979b6d 100644
--- a/test/hotspot/jtreg/serviceability/sa/ClhsdbPrintAs.java
+++ b/test/hotspot/jtreg/serviceability/sa/ClhsdbPrintAs.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2017, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2017, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -26,6 +26,7 @@
  * @bug 8192985
  * @summary Test the clhsdb 'printas' command
  * @requires vm.hasSA
+ * @requires vm.gc != "Z"
  * @requires (os.arch != "riscv64" | !(vm.cpu.features ~= ".*qemu.*"))
  * @library /test/lib
  * @run main/othervm ClhsdbPrintAs
diff --git a/test/hotspot/jtreg/serviceability/sa/ClhsdbPrintStatics.java b/test/hotspot/jtreg/serviceability/sa/ClhsdbPrintStatics.java
index c6f83c06845..e68e3ca4c47 100644
--- a/test/hotspot/jtreg/serviceability/sa/ClhsdbPrintStatics.java
+++ b/test/hotspot/jtreg/serviceability/sa/ClhsdbPrintStatics.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2017, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2017, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -33,6 +33,7 @@ import jtreg.SkippedException;
  * @bug 8190198
  * @summary Test clhsdb printstatics command
  * @requires vm.hasSA
+ * @requires vm.gc != "Z"
  * @requires (os.arch != "riscv64" | !(vm.cpu.features ~= ".*qemu.*"))
  * @library /test/lib
  * @run main/othervm ClhsdbPrintStatics
diff --git a/test/hotspot/jtreg/serviceability/sa/ClhsdbPstack.java b/test/hotspot/jtreg/serviceability/sa/ClhsdbPstack.java
index 15d88400917..51738be3554 100644
--- a/test/hotspot/jtreg/serviceability/sa/ClhsdbPstack.java
+++ b/test/hotspot/jtreg/serviceability/sa/ClhsdbPstack.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2017, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2017, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -35,6 +35,7 @@ import jtreg.SkippedException;
  * @bug 8190198
  * @summary Test clhsdb pstack command on a live process
  * @requires vm.hasSA
+ * @requires vm.gc != "Z"
  * @requires (os.arch != "riscv64" | !(vm.cpu.features ~= ".*qemu.*"))
  * @library /test/lib
  * @run main/othervm ClhsdbPstack false
@@ -45,6 +46,7 @@ import jtreg.SkippedException;
  * @bug 8190198
  * @summary Test clhsdb pstack command on a core file
  * @requires vm.hasSA
+ * @requires vm.gc != "Z"
  * @library /test/lib
  * @run main/othervm/timeout=480 ClhsdbPstack true
  */
diff --git a/test/hotspot/jtreg/serviceability/sa/ClhsdbScanOops.java b/test/hotspot/jtreg/serviceability/sa/ClhsdbScanOops.java
index 3b2aefec664..89c033f333a 100644
--- a/test/hotspot/jtreg/serviceability/sa/ClhsdbScanOops.java
+++ b/test/hotspot/jtreg/serviceability/sa/ClhsdbScanOops.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2017, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2017, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,8 +25,8 @@
  * @test id=parallel
  * @bug 8192985
  * @summary Test the clhsdb 'scanoops' command
- * @requires vm.gc.Parallel
  * @requires vm.hasSA
+ * @requires vm.gc.Parallel
  * @requires (os.arch != "riscv64" | !(vm.cpu.features ~= ".*qemu.*"))
  * @library /test/lib
  * @run main/othervm/timeout=1200 ClhsdbScanOops UseParallelGC
@@ -36,8 +36,8 @@
  * @test id=serial
  * @bug 8192985
  * @summary Test the clhsdb 'scanoops' command
- * @requires vm.gc.Serial
  * @requires vm.hasSA
+ * @requires vm.gc.Serial
  * @requires (os.arch != "riscv64" | !(vm.cpu.features ~= ".*qemu.*"))
  * @library /test/lib
  * @run main/othervm/timeout=1200 ClhsdbScanOops UseSerialGC
diff --git a/test/hotspot/jtreg/serviceability/sa/ClhsdbSource.java b/test/hotspot/jtreg/serviceability/sa/ClhsdbSource.java
index c66e44aa213..8ec946e3ea1 100644
--- a/test/hotspot/jtreg/serviceability/sa/ClhsdbSource.java
+++ b/test/hotspot/jtreg/serviceability/sa/ClhsdbSource.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2017, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2017, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -36,6 +36,7 @@ import jtreg.SkippedException;
  * @bug 8192823
  * @summary Test clhsdb source command
  * @requires vm.hasSA
+ * @requires vm.gc != "Z"
  * @requires (os.arch != "riscv64" | !(vm.cpu.features ~= ".*qemu.*"))
  * @library /test/lib
  * @run main/othervm ClhsdbSource
diff --git a/test/hotspot/jtreg/serviceability/sa/ClhsdbSymbol.java b/test/hotspot/jtreg/serviceability/sa/ClhsdbSymbol.java
index fe26427d6ce..ca05ba1d33e 100644
--- a/test/hotspot/jtreg/serviceability/sa/ClhsdbSymbol.java
+++ b/test/hotspot/jtreg/serviceability/sa/ClhsdbSymbol.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2021, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2021, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -33,6 +33,7 @@ import java.util.Map;
  * @bug 8261095
  * @summary Test the clhsdb 'symbol' command on live process
  * @requires vm.hasSA
+ * @requires vm.gc != "Z"
  * @requires (os.arch != "riscv64" | !(vm.cpu.features ~= ".*qemu.*"))
  * @library /test/lib
  * @run main/othervm ClhsdbSymbol
diff --git a/test/hotspot/jtreg/serviceability/sa/ClhsdbTestAllocationMerge.java b/test/hotspot/jtreg/serviceability/sa/ClhsdbTestAllocationMerge.java
index d076e648d90..05054f31c51 100644
--- a/test/hotspot/jtreg/serviceability/sa/ClhsdbTestAllocationMerge.java
+++ b/test/hotspot/jtreg/serviceability/sa/ClhsdbTestAllocationMerge.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2024, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2024, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -30,6 +30,7 @@ import jtreg.SkippedException;
  * @bug 8318682
  * @summary Test clhsdb that decoding of AllocationMerge objects in debug info works correctly
  * @requires vm.hasSA
+ * @requires vm.gc != "Z"
  * @requires (os.arch != "riscv64" | !(vm.cpu.features ~= ".*qemu.*"))
  * @library /test/lib
  * @run main/othervm ClhsdbTestAllocationMerge
diff --git a/test/hotspot/jtreg/serviceability/sa/ClhsdbThread.java b/test/hotspot/jtreg/serviceability/sa/ClhsdbThread.java
index f72b51585f5..e9a0b611134 100644
--- a/test/hotspot/jtreg/serviceability/sa/ClhsdbThread.java
+++ b/test/hotspot/jtreg/serviceability/sa/ClhsdbThread.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -33,6 +33,7 @@ import jtreg.SkippedException;
  * @bug 8193352
  * @summary Test clhsdb 'thread' and 'threads' commands
  * @requires vm.hasSA
+ * @requires vm.gc != "Z"
  * @requires (os.arch != "riscv64" | !(vm.cpu.features ~= ".*qemu.*"))
  * @library /test/lib
  * @run main/othervm ClhsdbThread
diff --git a/test/hotspot/jtreg/serviceability/sa/ClhsdbThreadContext.java b/test/hotspot/jtreg/serviceability/sa/ClhsdbThreadContext.java
index 5c3092a139d..c452575b782 100644
--- a/test/hotspot/jtreg/serviceability/sa/ClhsdbThreadContext.java
+++ b/test/hotspot/jtreg/serviceability/sa/ClhsdbThreadContext.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2021, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2021, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -33,6 +33,7 @@ import jtreg.SkippedException;
  * @test
  * @summary Test clhsdb where command
  * @requires vm.hasSA
+ * @requires vm.gc != "Z"
  * @requires (os.arch != "riscv64" | !(vm.cpu.features ~= ".*qemu.*"))
  * @library /test/lib
  * @run main/othervm/timeout=480 ClhsdbThreadContext
diff --git a/test/hotspot/jtreg/serviceability/sa/ClhsdbVmStructsDump.java b/test/hotspot/jtreg/serviceability/sa/ClhsdbVmStructsDump.java
index 21db0e867a4..b00138e0c39 100644
--- a/test/hotspot/jtreg/serviceability/sa/ClhsdbVmStructsDump.java
+++ b/test/hotspot/jtreg/serviceability/sa/ClhsdbVmStructsDump.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2017, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2017, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -32,6 +32,7 @@ import jtreg.SkippedException;
  * @bug 8191538
  * @summary Test clhsdb 'vmstructsdump' command
  * @requires vm.hasSA
+ * @requires vm.gc != "Z"
  * @requires (os.arch != "riscv64" | !(vm.cpu.features ~= ".*qemu.*"))
  * @library /test/lib
  * @run main/othervm ClhsdbVmStructsDump
diff --git a/test/hotspot/jtreg/serviceability/sa/ClhsdbWhere.java b/test/hotspot/jtreg/serviceability/sa/ClhsdbWhere.java
index 4536d568212..971f30fd94f 100644
--- a/test/hotspot/jtreg/serviceability/sa/ClhsdbWhere.java
+++ b/test/hotspot/jtreg/serviceability/sa/ClhsdbWhere.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2017, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2017, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -33,6 +33,7 @@ import jtreg.SkippedException;
  * @bug 8190198
  * @summary Test clhsdb where command
  * @requires vm.hasSA
+ * @requires vm.gc != "Z"
  * @requires (os.arch != "riscv64" | !(vm.cpu.features ~= ".*qemu.*"))
  * @library /test/lib
  * @run main/othervm ClhsdbWhere
diff --git a/test/hotspot/jtreg/serviceability/sa/DeadlockDetectionTest.java b/test/hotspot/jtreg/serviceability/sa/DeadlockDetectionTest.java
index cf9c4dfc5a1..ada0003fba5 100644
--- a/test/hotspot/jtreg/serviceability/sa/DeadlockDetectionTest.java
+++ b/test/hotspot/jtreg/serviceability/sa/DeadlockDetectionTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2015, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2015, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,6 +25,7 @@
  * @test
  * @summary Test deadlock detection
  * @requires vm.hasSA
+ * @requires vm.gc != "Z"
  * @requires (os.arch != "riscv64" | !(vm.cpu.features ~= ".*qemu.*"))
  * @library /test/lib
  * @modules java.base/jdk.internal.misc
diff --git a/test/hotspot/jtreg/serviceability/sa/JhsdbThreadInfoTest.java b/test/hotspot/jtreg/serviceability/sa/JhsdbThreadInfoTest.java
index 75942f7113a..a13106b1401 100644
--- a/test/hotspot/jtreg/serviceability/sa/JhsdbThreadInfoTest.java
+++ b/test/hotspot/jtreg/serviceability/sa/JhsdbThreadInfoTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2017, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2017, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -30,6 +30,7 @@ import jdk.test.lib.Utils;
 /**
  * @test
  * @requires vm.hasSA
+ * @requires vm.gc != "Z"
  * @requires (os.arch != "riscv64" | !(vm.cpu.features ~= ".*qemu.*"))
  * @library /test/lib
  * @run driver JhsdbThreadInfoTest
diff --git a/test/hotspot/jtreg/serviceability/sa/TestClassDump.java b/test/hotspot/jtreg/serviceability/sa/TestClassDump.java
index c163d45e0ba..c415332291e 100644
--- a/test/hotspot/jtreg/serviceability/sa/TestClassDump.java
+++ b/test/hotspot/jtreg/serviceability/sa/TestClassDump.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2017, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2017, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -37,6 +37,7 @@ import jtreg.SkippedException;
  * @bug 8184982
  * @summary Test ClassDump tool
  * @requires vm.hasSA
+ * @requires vm.gc != "Z"
  * @requires (os.arch != "riscv64" | !(vm.cpu.features ~= ".*qemu.*"))
  * @library /test/lib
  * @run driver TestClassDump
diff --git a/test/hotspot/jtreg/serviceability/sa/TestClhsdbJstackLock.java b/test/hotspot/jtreg/serviceability/sa/TestClhsdbJstackLock.java
index a0a1051beca..8524b4cd489 100644
--- a/test/hotspot/jtreg/serviceability/sa/TestClhsdbJstackLock.java
+++ b/test/hotspot/jtreg/serviceability/sa/TestClhsdbJstackLock.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2017, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2017, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -33,6 +33,7 @@ import jtreg.SkippedException;
  * @test
  * @bug 8185796 8335743
  * @requires vm.hasSA
+ * @requires vm.gc != "Z"
  * @requires (os.arch != "riscv64" | !(vm.cpu.features ~= ".*qemu.*"))
  * @library /test/lib
  * @run main/othervm TestClhsdbJstackLock
diff --git a/test/hotspot/jtreg/serviceability/sa/TestCpoolForInvokeDynamic.java b/test/hotspot/jtreg/serviceability/sa/TestCpoolForInvokeDynamic.java
index b1f2148954c..2d6c208164a 100644
--- a/test/hotspot/jtreg/serviceability/sa/TestCpoolForInvokeDynamic.java
+++ b/test/hotspot/jtreg/serviceability/sa/TestCpoolForInvokeDynamic.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2016, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2016, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -46,6 +46,7 @@ import jdk.test.lib.Utils;
  * @test
  * @library /test/lib
  * @requires vm.hasSA
+ * @requires vm.gc != "Z"
  * @requires (os.arch != "riscv64" | !(vm.cpu.features ~= ".*qemu.*"))
  * @modules java.base/jdk.internal.misc
  *          jdk.hotspot.agent/sun.jvm.hotspot
diff --git a/test/hotspot/jtreg/serviceability/sa/TestDebugInfoDecode.java b/test/hotspot/jtreg/serviceability/sa/TestDebugInfoDecode.java
index eb59f6f9487..3d808da683d 100644
--- a/test/hotspot/jtreg/serviceability/sa/TestDebugInfoDecode.java
+++ b/test/hotspot/jtreg/serviceability/sa/TestDebugInfoDecode.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2024, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2024, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -38,6 +38,7 @@ import jdk.test.lib.SA.SATestUtils;
  * @bug 8318682
  * @summary Test decoding debug info for all nmethods in the code cache
  * @requires vm.hasSA
+ * @requires vm.gc != "Z"
  * @requires (os.arch != "riscv64" | !(vm.cpu.features ~= ".*qemu.*"))
  * @library /test/lib
  * @modules jdk.hotspot.agent/sun.jvm.hotspot
diff --git a/test/hotspot/jtreg/serviceability/sa/TestDefaultMethods.java b/test/hotspot/jtreg/serviceability/sa/TestDefaultMethods.java
index 3bbb6fcdf35..c8efec888ca 100644
--- a/test/hotspot/jtreg/serviceability/sa/TestDefaultMethods.java
+++ b/test/hotspot/jtreg/serviceability/sa/TestDefaultMethods.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2015, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2015, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -45,6 +45,7 @@ import jdk.test.lib.Utils;
  * @test
  * @library /test/lib
  * @requires vm.hasSA
+ * @requires vm.gc != "Z"
  * @requires (os.arch != "riscv64" | !(vm.cpu.features ~= ".*qemu.*"))
  * @modules java.base/jdk.internal.misc
  *          jdk.hotspot.agent/sun.jvm.hotspot
diff --git a/test/hotspot/jtreg/serviceability/sa/TestHeapDumpForInvokeDynamic.java b/test/hotspot/jtreg/serviceability/sa/TestHeapDumpForInvokeDynamic.java
index 418dc5ec5a0..8ed476a0a1f 100644
--- a/test/hotspot/jtreg/serviceability/sa/TestHeapDumpForInvokeDynamic.java
+++ b/test/hotspot/jtreg/serviceability/sa/TestHeapDumpForInvokeDynamic.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2016, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2016, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -37,6 +37,7 @@ import jdk.test.lib.hprof.HprofParser;
  * @test
  * @library /test/lib
  * @requires vm.hasSA
+ * @requires vm.gc != "Z"
  * @requires (os.arch != "riscv64" | !(vm.cpu.features ~= ".*qemu.*"))
  * @modules java.base/jdk.internal.misc
  *          jdk.hotspot.agent/sun.jvm.hotspot
diff --git a/test/hotspot/jtreg/serviceability/sa/TestInstanceKlassSize.java b/test/hotspot/jtreg/serviceability/sa/TestInstanceKlassSize.java
index 3dbfbecda73..d1ed4729d39 100644
--- a/test/hotspot/jtreg/serviceability/sa/TestInstanceKlassSize.java
+++ b/test/hotspot/jtreg/serviceability/sa/TestInstanceKlassSize.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2015, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2015, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -46,6 +46,7 @@ import java.util.*;
  * @test
  * @library /test/lib
  * @requires vm.hasSA
+ * @requires vm.gc != "Z"
  * @requires (os.arch != "riscv64" | !(vm.cpu.features ~= ".*qemu.*"))
  * @modules java.base/jdk.internal.misc
  *          jdk.hotspot.agent/sun.jvm.hotspot
diff --git a/test/hotspot/jtreg/serviceability/sa/TestInstanceKlassSizeForInterface.java b/test/hotspot/jtreg/serviceability/sa/TestInstanceKlassSizeForInterface.java
index a462ee30fb2..fd192212bc4 100644
--- a/test/hotspot/jtreg/serviceability/sa/TestInstanceKlassSizeForInterface.java
+++ b/test/hotspot/jtreg/serviceability/sa/TestInstanceKlassSizeForInterface.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2015, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2015, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -42,6 +42,7 @@ import jdk.test.lib.Utils;
  * @test
  * @library /test/lib
  * @requires vm.hasSA
+ * @requires vm.gc != "Z"
  * @requires (os.arch != "riscv64" | !(vm.cpu.features ~= ".*qemu.*"))
  * @modules java.base/jdk.internal.misc
  *          jdk.hotspot.agent/sun.jvm.hotspot
diff --git a/test/hotspot/jtreg/serviceability/sa/TestIntConstant.java b/test/hotspot/jtreg/serviceability/sa/TestIntConstant.java
index 2b41394b7a5..23e64452652 100644
--- a/test/hotspot/jtreg/serviceability/sa/TestIntConstant.java
+++ b/test/hotspot/jtreg/serviceability/sa/TestIntConstant.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2017, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2017, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -34,6 +34,7 @@ import jtreg.SkippedException;
  * @summary Test the 'intConstant' command of jhsdb clhsdb.
  * @bug 8190307
  * @requires vm.hasSA
+ * @requires vm.gc != "Z"
  * @requires (os.arch != "riscv64" | !(vm.cpu.features ~= ".*qemu.*"))
  * @library /test/lib
  * @run main/othervm TestIntConstant
diff --git a/test/hotspot/jtreg/serviceability/sa/TestJhsdbJstackLineNumbers.java b/test/hotspot/jtreg/serviceability/sa/TestJhsdbJstackLineNumbers.java
index 15b9aa9ccae..936532527d4 100644
--- a/test/hotspot/jtreg/serviceability/sa/TestJhsdbJstackLineNumbers.java
+++ b/test/hotspot/jtreg/serviceability/sa/TestJhsdbJstackLineNumbers.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2020, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -37,6 +37,7 @@ import jdk.test.lib.SA.SATestUtils;
  * @test
  * @bug 8214226 8243500
  * @requires vm.hasSA
+ * @requires vm.gc != "Z"
  * @requires os.arch=="amd64" | os.arch=="x86_64"
  * @requires os.family=="windows" | os.family == "linux" | os.family == "mac"
  * @requires vm.flagless
diff --git a/test/hotspot/jtreg/serviceability/sa/TestJhsdbJstackLock.java b/test/hotspot/jtreg/serviceability/sa/TestJhsdbJstackLock.java
index ac536523815..c9c85b3d25f 100644
--- a/test/hotspot/jtreg/serviceability/sa/TestJhsdbJstackLock.java
+++ b/test/hotspot/jtreg/serviceability/sa/TestJhsdbJstackLock.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2017, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2017, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -31,6 +31,7 @@ import jdk.test.lib.Utils;
  * @test
  * @bug 8185796 8335743
  * @requires vm.hasSA
+ * @requires vm.gc != "Z"
  * @requires (os.arch != "riscv64" | !(vm.cpu.features ~= ".*qemu.*"))
  * @library /test/lib
  * @run driver TestJhsdbJstackLock
diff --git a/test/hotspot/jtreg/serviceability/sa/TestJhsdbJstackMixed.java b/test/hotspot/jtreg/serviceability/sa/TestJhsdbJstackMixed.java
index e90418b1030..e3808aa6706 100644
--- a/test/hotspot/jtreg/serviceability/sa/TestJhsdbJstackMixed.java
+++ b/test/hotspot/jtreg/serviceability/sa/TestJhsdbJstackMixed.java
@@ -37,7 +37,9 @@ import jdk.test.lib.process.OutputAnalyzer;
  * @test
  * @key randomness
  * @bug 8208091 8374469 8377710
- * @requires (os.family == "linux" | os.family == "windows") & (vm.hasSA)
+ * @requires vm.hasSA
+ * @requires vm.gc != "Z"
+ * @requires (os.family == "linux" | os.family == "windows")
  * @requires (os.arch != "riscv64" | !(vm.cpu.features ~= ".*qemu.*"))
  * @library /test/lib
  * @run driver TestJhsdbJstackMixed
diff --git a/test/hotspot/jtreg/serviceability/sa/TestJhsdbJstackMixedCore.java b/test/hotspot/jtreg/serviceability/sa/TestJhsdbJstackMixedCore.java
index 84a62eb65e5..99232ed9813 100644
--- a/test/hotspot/jtreg/serviceability/sa/TestJhsdbJstackMixedCore.java
+++ b/test/hotspot/jtreg/serviceability/sa/TestJhsdbJstackMixedCore.java
@@ -38,7 +38,9 @@ import jtreg.SkippedException;
 /**
  * @test
  * @bug 8374482 8376264 8376284 8377395
- * @requires (os.family == "linux") & (vm.hasSA)
+ * @requires vm.hasSA
+ * @requires vm.gc != "Z"
+ * @requires os.family == "linux"
  * @requires os.arch == "amd64"
  * @library /test/lib
  * @run driver TestJhsdbJstackMixedCore
diff --git a/test/hotspot/jtreg/serviceability/sa/TestJhsdbJstackMixedWithVDSOCallCore.java b/test/hotspot/jtreg/serviceability/sa/TestJhsdbJstackMixedWithVDSOCallCore.java
index 84da46e272f..de512b93121 100644
--- a/test/hotspot/jtreg/serviceability/sa/TestJhsdbJstackMixedWithVDSOCallCore.java
+++ b/test/hotspot/jtreg/serviceability/sa/TestJhsdbJstackMixedWithVDSOCallCore.java
@@ -38,7 +38,9 @@ import jdk.test.lib.util.CoreUtils;
 /**
  * @test
  * @bug 8376269
- * @requires (os.family == "linux") & (vm.hasSA)
+ * @requires vm.hasSA
+ * @requires vm.gc != "Z"
+ * @requires os.family == "linux"
  * @requires os.arch == "amd64"
  * @library /test/lib
  * @run driver TestJhsdbJstackMixedWithVDSOCallCore
diff --git a/test/hotspot/jtreg/serviceability/sa/TestJhsdbJstackMixedWithXComp.java b/test/hotspot/jtreg/serviceability/sa/TestJhsdbJstackMixedWithXComp.java
index a26fc4532df..1ebf6c21a70 100644
--- a/test/hotspot/jtreg/serviceability/sa/TestJhsdbJstackMixedWithXComp.java
+++ b/test/hotspot/jtreg/serviceability/sa/TestJhsdbJstackMixedWithXComp.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2025, 2026, Oracle and/or its affiliates. All rights reserved.
  * Copyright (c) 2025, NTT DATA
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
@@ -36,6 +36,7 @@ import jdk.test.lib.process.OutputAnalyzer;
  * @test id=xcomp
  * @bug 8370176
  * @requires vm.hasSA
+ * @requires vm.gc != "Z"
  * @requires os.family == "linux"
  * @requires os.arch == "amd64"
  * @library /test/lib
@@ -46,6 +47,7 @@ import jdk.test.lib.process.OutputAnalyzer;
  * @test id=xcomp-preserve-frame-pointer
  * @bug 8370176
  * @requires vm.hasSA
+ * @requires vm.gc != "Z"
  * @requires os.family == "linux"
  * @requires os.arch == "amd64"
  * @library /test/lib
@@ -56,6 +58,7 @@ import jdk.test.lib.process.OutputAnalyzer;
  * @test id=xcomp-disable-tiered-compilation
  * @bug 8370176
  * @requires vm.hasSA
+ * @requires vm.gc != "Z"
  * @requires os.family == "linux"
  * @requires os.arch == "amd64"
  * @library /test/lib
diff --git a/test/hotspot/jtreg/serviceability/sa/TestJhsdbJstackPrintVMLocks.java b/test/hotspot/jtreg/serviceability/sa/TestJhsdbJstackPrintVMLocks.java
index b7b3c956441..f6580d71e05 100644
--- a/test/hotspot/jtreg/serviceability/sa/TestJhsdbJstackPrintVMLocks.java
+++ b/test/hotspot/jtreg/serviceability/sa/TestJhsdbJstackPrintVMLocks.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2024, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2024, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -31,6 +31,7 @@ import jtreg.SkippedException;
  * @test
  * @summary Test verifies that jstack --mixed prints information about VM locks
  * @requires vm.hasSA
+ * @requires vm.gc != "Z"
  * @requires (os.arch != "riscv64" | !(vm.cpu.features ~= ".*qemu.*"))
  * @library /test/lib
  * @build jdk.test.whitebox.WhiteBox
diff --git a/test/hotspot/jtreg/serviceability/sa/TestJhsdbJstackUpcall.java b/test/hotspot/jtreg/serviceability/sa/TestJhsdbJstackUpcall.java
index 1873672d2ce..e91910c3411 100644
--- a/test/hotspot/jtreg/serviceability/sa/TestJhsdbJstackUpcall.java
+++ b/test/hotspot/jtreg/serviceability/sa/TestJhsdbJstackUpcall.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2024, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2024, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -31,6 +31,7 @@ import jdk.test.lib.process.OutputAnalyzer;
  * @test
  * @bug 8339307
  * @requires vm.hasSA
+ * @requires vm.gc != "Z"
  * @requires (os.arch != "riscv64" | !(vm.cpu.features ~= ".*qemu.*"))
  * @library /test/lib
  * @run driver TestJhsdbJstackUpcall
diff --git a/test/hotspot/jtreg/serviceability/sa/TestJhsdbJstackWithVirtualThread.java b/test/hotspot/jtreg/serviceability/sa/TestJhsdbJstackWithVirtualThread.java
index 39b6e1ed609..55751c330b5 100644
--- a/test/hotspot/jtreg/serviceability/sa/TestJhsdbJstackWithVirtualThread.java
+++ b/test/hotspot/jtreg/serviceability/sa/TestJhsdbJstackWithVirtualThread.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2025, 2026, Oracle and/or its affiliates. All rights reserved.
  * Copyright (c) 2025, NTT DATA
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
@@ -37,6 +37,7 @@ import jdk.test.lib.process.OutputAnalyzer;
  * @test
  * @bug 8369505
  * @requires vm.hasSA
+ * @requires vm.gc != "Z"
  * @library /test/lib
  * @run driver TestJhsdbJstackWithVirtualThread
  */
diff --git a/test/hotspot/jtreg/serviceability/sa/TestJmapCore.java b/test/hotspot/jtreg/serviceability/sa/TestJmapCore.java
index 77258bd45b7..024b5e03c98 100644
--- a/test/hotspot/jtreg/serviceability/sa/TestJmapCore.java
+++ b/test/hotspot/jtreg/serviceability/sa/TestJmapCore.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,6 +25,7 @@
  * @test TestJmapCore
  * @summary Test verifies that jhsdb jmap could generate heap dump from core when heap is full
  * @requires vm.hasSA
+ * @requires vm.gc != "Z"
  * @requires !vm.asan
  * @library /test/lib
  * @run driver/timeout=480 TestJmapCore run heap
diff --git a/test/hotspot/jtreg/serviceability/sa/TestJmapCoreMetaspace.java b/test/hotspot/jtreg/serviceability/sa/TestJmapCoreMetaspace.java
index ec3c66476a6..372cd0246ac 100644
--- a/test/hotspot/jtreg/serviceability/sa/TestJmapCoreMetaspace.java
+++ b/test/hotspot/jtreg/serviceability/sa/TestJmapCoreMetaspace.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,6 +25,7 @@
  * @test TestJmapCoreMetaspace
  * @summary Test verifies that jhsdb jmap could generate heap dump from core when metaspace is full
  * @requires vm.hasSA
+ * @requires vm.gc != "Z"
  * @requires !vm.asan
  * @library /test/lib
  * @run driver/timeout=480 TestJmapCore run metaspace
diff --git a/test/hotspot/jtreg/serviceability/sa/TestObjectAlignment.java b/test/hotspot/jtreg/serviceability/sa/TestObjectAlignment.java
index 62fe2f5d7aa..081dbe1206c 100644
--- a/test/hotspot/jtreg/serviceability/sa/TestObjectAlignment.java
+++ b/test/hotspot/jtreg/serviceability/sa/TestObjectAlignment.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2022, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2022, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -38,7 +38,9 @@ import jdk.test.lib.Utils;
 /**
  * @test
  * @library /test/lib
- * @requires vm.hasSA & vm.bits == "64"
+ * @requires vm.hasSA
+ * @requires vm.gc != "Z"
+ * @requires vm.bits == "64"
  * @requires (os.arch != "riscv64" | !(vm.cpu.features ~= ".*qemu.*"))
  * @modules jdk.hotspot.agent/sun.jvm.hotspot
  *          jdk.hotspot.agent/sun.jvm.hotspot.runtime
diff --git a/test/hotspot/jtreg/serviceability/sa/TestObjectMonitorIterate.java b/test/hotspot/jtreg/serviceability/sa/TestObjectMonitorIterate.java
index 86a00285ee4..0448cc0788a 100644
--- a/test/hotspot/jtreg/serviceability/sa/TestObjectMonitorIterate.java
+++ b/test/hotspot/jtreg/serviceability/sa/TestObjectMonitorIterate.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2021, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2021, 2026, Oracle and/or its affiliates. All rights reserved.
  * Copyright (c) 2021, NTT DATA.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
@@ -38,6 +38,7 @@ import jdk.test.lib.SA.SATestUtils;
  * @bug 8259008
  * @library /test/lib
  * @requires vm.hasSA
+ * @requires vm.gc != "Z"
  * @requires (os.arch != "riscv64" | !(vm.cpu.features ~= ".*qemu.*"))
  * @modules jdk.hotspot.agent/sun.jvm.hotspot
  *          jdk.hotspot.agent/sun.jvm.hotspot.oops
diff --git a/test/hotspot/jtreg/serviceability/sa/TestRevPtrsForInvokeDynamic.java b/test/hotspot/jtreg/serviceability/sa/TestRevPtrsForInvokeDynamic.java
index 315c931d49e..8c5ce3ae3cd 100644
--- a/test/hotspot/jtreg/serviceability/sa/TestRevPtrsForInvokeDynamic.java
+++ b/test/hotspot/jtreg/serviceability/sa/TestRevPtrsForInvokeDynamic.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2017, 2023, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2017, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -41,6 +41,7 @@ import jdk.test.lib.Utils;
  * @test
  * @library /test/lib
  * @requires vm.hasSA
+ * @requires vm.gc != "Z"
  * @modules java.base/jdk.internal.misc
  *          jdk.hotspot.agent/sun.jvm.hotspot
  *          jdk.hotspot.agent/sun.jvm.hotspot.utilities
diff --git a/test/hotspot/jtreg/serviceability/sa/TestSysProps.java b/test/hotspot/jtreg/serviceability/sa/TestSysProps.java
index a591d009ecf..a2617f7f268 100644
--- a/test/hotspot/jtreg/serviceability/sa/TestSysProps.java
+++ b/test/hotspot/jtreg/serviceability/sa/TestSysProps.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2020, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -37,6 +37,7 @@ import jdk.test.lib.SA.SATestUtils;
  * @bug 8242165 8242162
  * @summary Test "jhsdb jinfo --sysprops", "jinfo -sysprops", and clhsdb "sysprops" commands
  * @requires vm.hasSA
+ * @requires vm.gc != "Z"
  * @requires (os.arch != "riscv64" | !(vm.cpu.features ~= ".*qemu.*"))
  * @library /test/lib
  * @run driver TestSysProps
diff --git a/test/hotspot/jtreg/serviceability/sa/TestType.java b/test/hotspot/jtreg/serviceability/sa/TestType.java
index c3326032b90..e5b90a3c2a9 100644
--- a/test/hotspot/jtreg/serviceability/sa/TestType.java
+++ b/test/hotspot/jtreg/serviceability/sa/TestType.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2017, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2017, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -34,6 +34,7 @@ import jtreg.SkippedException;
  * @summary Test the 'type' command of jhsdb clhsdb.
  * @bug 8190307
  * @requires vm.hasSA
+ * @requires vm.gc != "Z"
  * @requires (os.arch != "riscv64" | !(vm.cpu.features ~= ".*qemu.*"))
  * @library /test/lib
  * @run main/othervm TestType
diff --git a/test/hotspot/jtreg/serviceability/sa/UniqueVtableTest.java b/test/hotspot/jtreg/serviceability/sa/UniqueVtableTest.java
index 774fcee50ed..7792ec1a003 100644
--- a/test/hotspot/jtreg/serviceability/sa/UniqueVtableTest.java
+++ b/test/hotspot/jtreg/serviceability/sa/UniqueVtableTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2023, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2023, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -26,6 +26,7 @@
  *
  * @library /test/lib
  * @requires vm.hasSA
+ * @requires vm.gc != "Z"
  * @requires (os.arch != "riscv64" | !(vm.cpu.features ~= ".*qemu.*"))
  * @modules jdk.hotspot.agent/sun.jvm.hotspot
  *          jdk.hotspot.agent/sun.jvm.hotspot.debugger
diff --git a/test/hotspot/jtreg/serviceability/sa/jmap-hprof/JMapHProfLargeHeapTest.java b/test/hotspot/jtreg/serviceability/sa/jmap-hprof/JMapHProfLargeHeapTest.java
index a41ab71f4fa..6a7c519fedf 100644
--- a/test/hotspot/jtreg/serviceability/sa/jmap-hprof/JMapHProfLargeHeapTest.java
+++ b/test/hotspot/jtreg/serviceability/sa/jmap-hprof/JMapHProfLargeHeapTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2013, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2013, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -42,6 +42,7 @@ import jdk.test.lib.SA.SATestUtils;
  * @test
  * @bug 6313383
  * @requires vm.hasSA
+ * @requires vm.gc != "Z"
  * @requires (os.arch != "riscv64" | !(vm.cpu.features ~= ".*qemu.*"))
  * @summary Regression test for hprof export issue due to large heaps (>2G)
  * @library /test/lib
diff --git a/test/hotspot/jtreg/serviceability/sa/sadebugd/ClhsdbAttachToDebugServer.java b/test/hotspot/jtreg/serviceability/sa/sadebugd/ClhsdbAttachToDebugServer.java
index 57962e72c5c..ab211b70691 100644
--- a/test/hotspot/jtreg/serviceability/sa/sadebugd/ClhsdbAttachToDebugServer.java
+++ b/test/hotspot/jtreg/serviceability/sa/sadebugd/ClhsdbAttachToDebugServer.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2021, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2021, 2026, Oracle and/or its affiliates. All rights reserved.
  * Copyright (c) 2021 NTT DATA.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
@@ -36,6 +36,7 @@ import jtreg.SkippedException;
  * @bug 8262520
  * @summary Test clhsdb connect, detach, reattach commands
  * @requires vm.hasSA
+ * @requires vm.gc != "Z"
  * @requires (os.arch != "riscv64" | !(vm.cpu.features ~= ".*qemu.*"))
  * @requires os.family != "windows"
  * @library /test/lib
diff --git a/test/hotspot/jtreg/serviceability/sa/sadebugd/ClhsdbTestConnectArgument.java b/test/hotspot/jtreg/serviceability/sa/sadebugd/ClhsdbTestConnectArgument.java
index 109afa21841..2e07dfa63f0 100644
--- a/test/hotspot/jtreg/serviceability/sa/sadebugd/ClhsdbTestConnectArgument.java
+++ b/test/hotspot/jtreg/serviceability/sa/sadebugd/ClhsdbTestConnectArgument.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2021, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2021, 2026, Oracle and/or its affiliates. All rights reserved.
  * Copyright (c) 2021 NTT DATA.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
@@ -35,6 +35,7 @@ import jtreg.SkippedException;
  * @test
  * @bug 8263342
  * @requires vm.hasSA
+ * @requires vm.gc != "Z"
  * @requires (os.arch != "riscv64" | !(vm.cpu.features ~= ".*qemu.*"))
  * @requires os.family != "windows"
  * @library /test/lib
diff --git a/test/hotspot/jtreg/serviceability/sa/sadebugd/DebugdConnectTest.java b/test/hotspot/jtreg/serviceability/sa/sadebugd/DebugdConnectTest.java
index 285f57f8115..7576aa54bf0 100644
--- a/test/hotspot/jtreg/serviceability/sa/sadebugd/DebugdConnectTest.java
+++ b/test/hotspot/jtreg/serviceability/sa/sadebugd/DebugdConnectTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2019, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2019, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -26,6 +26,7 @@
  * @bug 8209790
  * @summary Checks ability for connecting to debug server (jstack, jmap, jinfo, jsnap)
  * @requires vm.hasSA
+ * @requires vm.gc != "Z"
  * @requires (os.arch != "riscv64" | !(vm.cpu.features ~= ".*qemu.*"))
  * @requires os.family != "windows"
  * @modules java.base/jdk.internal.misc
diff --git a/test/hotspot/jtreg/serviceability/sa/sadebugd/DisableRegistryTest.java b/test/hotspot/jtreg/serviceability/sa/sadebugd/DisableRegistryTest.java
index ae0774988a8..312e99c172c 100644
--- a/test/hotspot/jtreg/serviceability/sa/sadebugd/DisableRegistryTest.java
+++ b/test/hotspot/jtreg/serviceability/sa/sadebugd/DisableRegistryTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2021, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2021, 2026, Oracle and/or its affiliates. All rights reserved.
  * Copyright (c) 2021 NTT DATA.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
@@ -36,6 +36,7 @@ import jtreg.SkippedException;
  * @bug 8263636 8263635
  * @summary Test to use already started RMI registry
  * @requires vm.hasSA
+ * @requires vm.gc != "Z"
  * @requires (os.arch != "riscv64" | !(vm.cpu.features ~= ".*qemu.*"))
  * @requires os.family != "windows"
  * @library /test/lib
diff --git a/test/hotspot/jtreg/serviceability/sa/sadebugd/PmapOnDebugdTest.java b/test/hotspot/jtreg/serviceability/sa/sadebugd/PmapOnDebugdTest.java
index b1665634fb0..c27989e20ca 100644
--- a/test/hotspot/jtreg/serviceability/sa/sadebugd/PmapOnDebugdTest.java
+++ b/test/hotspot/jtreg/serviceability/sa/sadebugd/PmapOnDebugdTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2021, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2021, 2026, Oracle and/or its affiliates. All rights reserved.
  * Copyright (c) 2021 NTT DATA.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
@@ -34,6 +34,7 @@ import jtreg.SkippedException;
  * @test
  * @bug 8263670
  * @requires vm.hasSA
+ * @requires vm.gc != "Z"
  * @requires (os.arch != "riscv64" | !(vm.cpu.features ~= ".*qemu.*"))
  * @requires (os.family != "windows") & (os.family != "mac")
  * @library /test/lib
diff --git a/test/hotspot/jtreg/serviceability/sa/sadebugd/RunCommandOnServerTest.java b/test/hotspot/jtreg/serviceability/sa/sadebugd/RunCommandOnServerTest.java
index 9e725561341..5905d558c55 100644
--- a/test/hotspot/jtreg/serviceability/sa/sadebugd/RunCommandOnServerTest.java
+++ b/test/hotspot/jtreg/serviceability/sa/sadebugd/RunCommandOnServerTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2021, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2021, 2026, Oracle and/or its affiliates. All rights reserved.
  * Copyright (c) 2021 NTT DATA.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
@@ -37,6 +37,7 @@ import jtreg.SkippedException;
  * @bug 8265505
  * @summary Test clhsdb command which should be run on debugd server
  * @requires vm.hasSA
+ * @requires vm.gc != "Z"
  * @requires (os.arch != "riscv64" | !(vm.cpu.features ~= ".*qemu.*"))
  * @requires os.family != "windows"
  * @library /test/lib
diff --git a/test/hotspot/jtreg/serviceability/sa/sadebugd/SADebugDTest.java b/test/hotspot/jtreg/serviceability/sa/sadebugd/SADebugDTest.java
index 69f4c9eb454..166e45cc3b7 100644
--- a/test/hotspot/jtreg/serviceability/sa/sadebugd/SADebugDTest.java
+++ b/test/hotspot/jtreg/serviceability/sa/sadebugd/SADebugDTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2016, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2016, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -27,6 +27,7 @@
  * @summary Checks that the jshdb debugd utility successfully starts
  *          and tries to attach to a running process
  * @requires vm.hasSA
+ * @requires vm.gc != "Z"
  * @requires (os.arch != "riscv64" | !(vm.cpu.features ~= ".*qemu.*"))
  * @requires os.family != "windows"
  * @modules java.base/jdk.internal.misc
diff --git a/test/jdk/ProblemList-zgc.txt b/test/jdk/ProblemList-zgc.txt
index 065a52f9a83..a669f3e3abf 100644
--- a/test/jdk/ProblemList-zgc.txt
+++ b/test/jdk/ProblemList-zgc.txt
@@ -27,16 +27,6 @@
 #
 #############################################################################
 
-# Quiet all SA tests
-
-sun/tools/jhsdb/HeapDumpTest.java                  8307393   generic-all
-sun/tools/jhsdb/BasicLauncherTest.java             8307393   generic-all
-sun/tools/jhsdb/JStackStressTest.java              8307393   generic-all
-sun/tools/jhsdb/JShellHeapDumpTest.java            8307393   generic-all
-sun/tools/jhsdb/SAGetoptTest.java                  8307393   generic-all
-sun/tools/jhsdb/heapconfig/JMapHeapConfigTest.java 8307393   generic-all
-sun/tools/jhsdb/HeapDumpTestWithActiveProcess.java 8307393   generic-all
-
 com/sun/jdi/ThreadMemoryLeakTest.java              8307402   generic-all
 
 #############################################################################
diff --git a/test/jdk/sun/tools/jhsdb/BasicLauncherTest.java b/test/jdk/sun/tools/jhsdb/BasicLauncherTest.java
index 75f2af6db5a..412a811d219 100644
--- a/test/jdk/sun/tools/jhsdb/BasicLauncherTest.java
+++ b/test/jdk/sun/tools/jhsdb/BasicLauncherTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2015, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2015, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -26,6 +26,7 @@
  * @summary Basic test for jhsdb launcher
  * @library /test/lib
  * @requires vm.hasSA
+ * @requires vm.gc != "Z"
  * @build jdk.test.lib.apps.*
  * @run main/timeout=480 BasicLauncherTest
  */
diff --git a/test/jdk/sun/tools/jhsdb/HeapDumpTest.java b/test/jdk/sun/tools/jhsdb/HeapDumpTest.java
index c59e2b0e040..5ef1dadcb62 100644
--- a/test/jdk/sun/tools/jhsdb/HeapDumpTest.java
+++ b/test/jdk/sun/tools/jhsdb/HeapDumpTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2016, 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2016, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -26,6 +26,7 @@
  * @bug 8163346
  * @summary Test hashing of extended characters in Serviceability Agent.
  * @requires vm.hasSA
+ * @requires vm.gc != "Z"
  * @library /test/lib
  * @compile -encoding utf8 HeapDumpTest.java
  * @run main/timeout=240 HeapDumpTest
diff --git a/test/jdk/sun/tools/jhsdb/HeapDumpTestWithActiveProcess.java b/test/jdk/sun/tools/jhsdb/HeapDumpTestWithActiveProcess.java
index bd5a400225f..fffbe439f94 100644
--- a/test/jdk/sun/tools/jhsdb/HeapDumpTestWithActiveProcess.java
+++ b/test/jdk/sun/tools/jhsdb/HeapDumpTestWithActiveProcess.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2019, 2020, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2019, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,6 +25,7 @@
  * @test
  * @bug  8230731 8001227 8231635 8231634 8196969
  * @requires vm.hasSA
+ * @requires vm.gc != "Z"
  * @library /test/lib
  * @compile JShellHeapDumpTest.java
  * @run main/timeout=240 JShellHeapDumpTest nosleep
diff --git a/test/jdk/sun/tools/jhsdb/JShellHeapDumpTest.java b/test/jdk/sun/tools/jhsdb/JShellHeapDumpTest.java
index 6fbc96362a9..a9e5f7aeffe 100644
--- a/test/jdk/sun/tools/jhsdb/JShellHeapDumpTest.java
+++ b/test/jdk/sun/tools/jhsdb/JShellHeapDumpTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2019, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2019, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,6 +25,7 @@
  * @test
  * @bug 8225715
  * @requires vm.hasSA
+ * @requires vm.gc != "Z"
  * @library /test/lib
  * @compile JShellHeapDumpTest.java
  * @run main/timeout=240 JShellHeapDumpTest
diff --git a/test/jdk/sun/tools/jhsdb/JStackStressTest.java b/test/jdk/sun/tools/jhsdb/JStackStressTest.java
index 97945b6092b..a28cdf3be5a 100644
--- a/test/jdk/sun/tools/jhsdb/JStackStressTest.java
+++ b/test/jdk/sun/tools/jhsdb/JStackStressTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2021, 2023, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2021, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,6 +25,7 @@
  * @test
  * @bug 8262271
  * @requires vm.hasSA
+ * @requires vm.gc != "Z"
  * @library /test/lib
  * @run main/timeout=240 JStackStressTest
  */
diff --git a/test/jdk/sun/tools/jhsdb/heapconfig/JMapHeapConfigTest.java b/test/jdk/sun/tools/jhsdb/heapconfig/JMapHeapConfigTest.java
index 659eac2ee8f..b2c7ba0ef87 100644
--- a/test/jdk/sun/tools/jhsdb/heapconfig/JMapHeapConfigTest.java
+++ b/test/jdk/sun/tools/jhsdb/heapconfig/JMapHeapConfigTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2015, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2015, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -39,6 +39,7 @@ import jdk.test.lib.Utils;
  * @summary Unit test for jmap utility test heap configuration reader
  *
  * @requires vm.hasSA
+ * @requires vm.gc != "Z"
  * @library /test/lib
  * @modules java.management
  *          jdk.hotspot.agent/sun.jvm.hotspot

From 3d6856c251cb2476fe3d3139084d9c61c3835744 Mon Sep 17 00:00:00 2001
From: Joe Darcy <darcy@openjdk.org>
Date: Thu, 5 Mar 2026 17:25:54 +0000
Subject: [PATCH 059/655] 8374658: Consider use of "included" rather than
 "enclosed" in jx.a.p.Processor

Reviewed-by: vromero
---
 .../annotation/processing/Processor.java      | 25 ++++++++++---------
 1 file changed, 13 insertions(+), 12 deletions(-)

diff --git a/src/java.compiler/share/classes/javax/annotation/processing/Processor.java b/src/java.compiler/share/classes/javax/annotation/processing/Processor.java
index 4be159868fa..2f2a9b285f6 100644
--- a/src/java.compiler/share/classes/javax/annotation/processing/Processor.java
+++ b/src/java.compiler/share/classes/javax/annotation/processing/Processor.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2005, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2005, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -101,28 +101,29 @@ import javax.lang.model.SourceVersion;
  * supports, possibly an empty set.
  *
  * For a given round, the tool computes the set of annotation
- * interfaces that are present on the elements enclosed within the
- * root elements.  If there is at least one annotation interface
- * present, then as processors claim annotation interfaces, they are
- * removed from the set of unmatched annotation interfaces.  When the
- * set is empty or no more processors are available, the round has run
- * to completion.  If there are no annotation interfaces present,
- * annotation processing still occurs but only <i>universal
+ * interfaces that are present on the elements {@linkplain
+ * RoundEnvironment#getElementsAnnotatedWith(TypeElement) included}
+ * within the root elements.  If there is at least one annotation
+ * interface present, then as processors claim annotation interfaces,
+ * they are removed from the set of unmatched annotation interfaces.
+ * When the set is empty or no more processors are available, the
+ * round has run to completion.  If there are no annotation interfaces
+ * present, annotation processing still occurs but only <i>universal
  * processors</i> which support processing all annotation interfaces,
  * {@code "*"}, can claim the (empty) set of annotation interfaces.
  *
  * <p>An annotation interface is considered present if there is at least
- * one annotation of that interface present on an element enclosed within
+ * one annotation of that interface present on an element included within
  * the root elements of a round. For this purpose, a type parameter is
- * considered to be enclosed by its {@linkplain
+ * considered to be included by its {@linkplain
  * TypeParameterElement#getGenericElement generic
  * element}.
 
  * For this purpose, a package element is <em>not</em> considered to
- * enclose the top-level classes and interfaces within that
+ * include the top-level classes and interfaces within that
  * package. (A root element representing a package is created when a
  * {@code package-info} file is processed.) Likewise, for this
- * purpose, a module element is <em>not</em> considered to enclose the
+ * purpose, a module element is <em>not</em> considered to include the
  * packages within that module. (A root element representing a module
  * is created when a {@code module-info} file is processed.)
  *

From 3363a16c1d2725a0468e57690a3dcd27a0bf8a16 Mon Sep 17 00:00:00 2001
From: Sruthy Jayan <srutjay1@in.ibm.com>
Date: Thu, 5 Mar 2026 22:20:30 +0000
Subject: [PATCH 060/655] 8375045: Incorrect Interpretation of POSIX TZ
 Environment Variable on AIX

Reviewed-by: naoto
---
 .../unix/native/libjava/TimeZone_md.c         | 66 ++++++++++++-------
 1 file changed, 44 insertions(+), 22 deletions(-)

diff --git a/src/java.base/unix/native/libjava/TimeZone_md.c b/src/java.base/unix/native/libjava/TimeZone_md.c
index cd253edde60..39e7b726220 100644
--- a/src/java.base/unix/native/libjava/TimeZone_md.c
+++ b/src/java.base/unix/native/libjava/TimeZone_md.c
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1999, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1999, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -352,33 +352,15 @@ getPlatformTimeZoneID()
 }
 
 static char *
-mapPlatformToJavaTimezone(const char *java_home_dir, const char *tz) {
+getJavaTimezoneFromPlatform(const char *tz_buf, size_t tz_len, const char *mapfilename) {
     FILE *tzmapf;
-    char mapfilename[PATH_MAX + 1];
     char line[256];
     int linecount = 0;
-    char *tz_buf = NULL;
-    char *temp_tz = NULL;
     char *javatz = NULL;
-    size_t tz_len = 0;
 
-    /* On AIX, the TZ environment variable may end with a comma
-     * followed by modifier fields until early AIX6.1.
-     * This restriction has been removed from AIX7. */
-
-    tz_buf = strdup(tz);
-    tz_len = strlen(tz_buf);
-
-    /* Open tzmappings file, with buffer overrun check */
-    if ((strlen(java_home_dir) + 15) > PATH_MAX) {
-        jio_fprintf(stderr, "Path %s/lib/tzmappings exceeds maximum path length\n", java_home_dir);
-        goto tzerr;
-    }
-    strcpy(mapfilename, java_home_dir);
-    strcat(mapfilename, "/lib/tzmappings");
     if ((tzmapf = fopen(mapfilename, "r")) == NULL) {
         jio_fprintf(stderr, "can't open %s\n", mapfilename);
-        goto tzerr;
+        return NULL;
     }
 
     while (fgets(line, sizeof(line), tzmapf) != NULL) {
@@ -431,10 +413,50 @@ mapPlatformToJavaTimezone(const char *java_home_dir, const char *tz) {
             break;
         }
     }
+
     (void) fclose(tzmapf);
+    return javatz;
+}
+
+static char *
+mapPlatformToJavaTimezone(const char *java_home_dir, const char *tz) {
+    char mapfilename[PATH_MAX + 1];
+    char *tz_buf = NULL;
+    char *javatz = NULL;
+    char *temp_tz = NULL;
+    size_t tz_len = 0;
+
+    /* On AIX, the TZ environment variable may end with a comma
+     * followed by modifier fields until early AIX6.1.
+     * This restriction has been removed from AIX7. */
+
+    tz_buf = strdup(tz);
+    tz_len = strlen(tz_buf);
+
+    /* Open tzmappings file, with buffer overrun check */
+    if ((strlen(java_home_dir) + 15) > PATH_MAX) {
+        jio_fprintf(stderr, "Path %s/lib/tzmappings exceeds maximum path length\n", java_home_dir);
+        goto tzerr;
+    }
+    strcpy(mapfilename, java_home_dir);
+    strcat(mapfilename, "/lib/tzmappings");
+
+    // First attempt to find the Java timezone for the full tz string
+    javatz = getJavaTimezoneFromPlatform(tz_buf, tz_len, mapfilename);
+
+    // If no match was found, check for timezone with truncated value
+    if (javatz == NULL) {
+        temp_tz = strchr(tz, ',');
+        tz_len = (temp_tz == NULL) ? strlen(tz) : temp_tz - tz;
+        free((void *) tz_buf);
+        tz_buf = (char *)malloc(tz_len + 1);
+        memcpy(tz_buf, tz, tz_len);
+        tz_buf[tz_len] = '\0';
+        javatz = getJavaTimezoneFromPlatform(tz_buf, tz_len, mapfilename);
+    }
 
 tzerr:
-    if (tz_buf != NULL ) {
+    if (tz_buf != NULL) {
         free((void *) tz_buf);
     }
 

From f266079d26ffc1541e5d3146258f7d39188d1a84 Mon Sep 17 00:00:00 2001
From: Phil Race <prr@openjdk.org>
Date: Thu, 5 Mar 2026 23:54:52 +0000
Subject: [PATCH 061/655] 8378917: InputEvent checks for SystemClipboard access
 are unused

Reviewed-by: dmarkov, serb
---
 .../share/classes/java/awt/AWTEvent.java      | 15 +-----------
 .../classes/java/awt/event/InputEvent.java    | 23 +------------------
 .../share/classes/sun/awt/AWTAccessor.java    |  7 ------
 3 files changed, 2 insertions(+), 43 deletions(-)

diff --git a/src/java.desktop/share/classes/java/awt/AWTEvent.java b/src/java.desktop/share/classes/java/awt/AWTEvent.java
index d48fae68cbe..f365393ffb1 100644
--- a/src/java.desktop/share/classes/java/awt/AWTEvent.java
+++ b/src/java.desktop/share/classes/java/awt/AWTEvent.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1996, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1996, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -554,22 +554,9 @@ public abstract class AWTEvent extends EventObject {
      */
     void copyPrivateDataInto(AWTEvent that) {
         that.bdata = this.bdata;
-        // Copy canAccessSystemClipboard value from this into that.
-        if (this instanceof InputEvent && that instanceof InputEvent) {
-
-            AWTAccessor.InputEventAccessor accessor
-                    = AWTAccessor.getInputEventAccessor();
-
-            boolean b = accessor.canAccessSystemClipboard((InputEvent) this);
-            accessor.setCanAccessSystemClipboard((InputEvent) that, b);
-        }
         that.isSystemGenerated = this.isSystemGenerated;
     }
 
     void dispatched() {
-        if (this instanceof InputEvent) {
-            AWTAccessor.getInputEventAccessor().
-                    setCanAccessSystemClipboard((InputEvent) this, false);
-        }
     }
 } // class AWTEvent
diff --git a/src/java.desktop/share/classes/java/awt/event/InputEvent.java b/src/java.desktop/share/classes/java/awt/event/InputEvent.java
index 9f1172916df..7517ea810e3 100644
--- a/src/java.desktop/share/classes/java/awt/event/InputEvent.java
+++ b/src/java.desktop/share/classes/java/awt/event/InputEvent.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1996, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1996, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -309,13 +309,6 @@ public abstract sealed class InputEvent extends ComponentEvent
      */
     int modifiers;
 
-    /*
-     * A flag that indicates that this instance can be used to access
-     * the system clipboard.
-     * This should be false in a headless environment, true in a headful one.
-     */
-    private transient boolean canAccessSystemClipboard;
-
     static {
         /* ensure that the necessary native libraries are loaded */
         NativeLibLoader.loadLibraries();
@@ -328,15 +321,6 @@ public abstract sealed class InputEvent extends ComponentEvent
                     return InputEvent.getButtonDownMasks();
                 }
 
-                public boolean canAccessSystemClipboard(InputEvent event) {
-                    return event.canAccessSystemClipboard;
-                }
-
-                @Override
-                public void setCanAccessSystemClipboard(InputEvent event,
-                        boolean canAccessSystemClipboard) {
-                    event.canAccessSystemClipboard = canAccessSystemClipboard;
-                }
             });
     }
 
@@ -381,11 +365,6 @@ public abstract sealed class InputEvent extends ComponentEvent
         super(source, id);
         this.when = when;
         this.modifiers = modifiers;
-        canAccessSystemClipboard = canAccessSystemClipboard();
-    }
-
-    private boolean canAccessSystemClipboard() {
-        return !GraphicsEnvironment.isHeadless();
     }
 
     /**
diff --git a/src/java.desktop/share/classes/sun/awt/AWTAccessor.java b/src/java.desktop/share/classes/sun/awt/AWTAccessor.java
index c74219f7efa..f98118171b4 100644
--- a/src/java.desktop/share/classes/sun/awt/AWTAccessor.java
+++ b/src/java.desktop/share/classes/sun/awt/AWTAccessor.java
@@ -361,13 +361,6 @@ public final class AWTAccessor {
          * Accessor for InputEvent.getButtonDownMasks()
          */
         int[] getButtonDownMasks();
-
-        /*
-         * Accessor for InputEvent.canAccessSystemClipboard field
-         */
-        boolean canAccessSystemClipboard(InputEvent event);
-        void setCanAccessSystemClipboard(InputEvent event,
-                boolean canAccessSystemClipboard);
     }
 
     /**

From c2f6bd87c6d3520c03caf5be75d35eec91f100bb Mon Sep 17 00:00:00 2001
From: Alexey Semenyuk <asemenyuk@openjdk.org>
Date: Fri, 6 Mar 2026 01:08:49 +0000
Subject: [PATCH 062/655] 8379334: jpackage: fix bug in DottedVersion.greedy()
 function

Reviewed-by: almatvee
---
 .../internal/model/DottedVersion.java         |  86 ++++++++++----
 .../internal/model/DottedVersionTest.java     | 108 +++++++++++++++++-
 2 files changed, 172 insertions(+), 22 deletions(-)

diff --git a/src/jdk.jpackage/share/classes/jdk/jpackage/internal/model/DottedVersion.java b/src/jdk.jpackage/share/classes/jdk/jpackage/internal/model/DottedVersion.java
index b49cbb025e9..8071f182801 100644
--- a/src/jdk.jpackage/share/classes/jdk/jpackage/internal/model/DottedVersion.java
+++ b/src/jdk.jpackage/share/classes/jdk/jpackage/internal/model/DottedVersion.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2019, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2019, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -37,12 +37,11 @@ import java.util.stream.Stream;
 public final class DottedVersion {
 
     private DottedVersion(String version, boolean greedy) {
-        this.value = version;
         if (version.isEmpty()) {
             if (greedy) {
                 throw new IllegalArgumentException(I18N.getString("error.version-string-empty"));
             } else {
-                this.components = new BigInteger[0];
+                this.components = new Component[0];
                 this.suffix = "";
             }
         } else {
@@ -53,12 +52,12 @@ public final class DottedVersion {
                             if (!greedy) {
                                 return null;
                             } else {
-                                ds.throwException();
+                                throw ds.createException();
                             }
                         }
 
                         try {
-                            return new BigInteger(digits);
+                            return new Component(digits);
                         } catch (NumberFormatException ex) {
                             if (!greedy) {
                                 return null;
@@ -68,17 +67,25 @@ public final class DottedVersion {
                                         digits));
                             }
                         }
-                    }).takeWhile(Objects::nonNull).toArray(BigInteger[]::new);
+                    }).takeWhile(Objects::nonNull).toArray(Component[]::new);
             suffix = ds.getUnprocessedString();
             if (!suffix.isEmpty() && greedy) {
-                ds.throwException();
+                throw ds.createException();
             }
         }
     }
 
+    private DottedVersion(Component[] components, String suffix) {
+        this.components = components;
+        this.suffix = suffix;
+    }
+
     private static class DigitsSupplier {
 
         DigitsSupplier(String input) {
+            if (input.isEmpty()) {
+                throw new IllegalArgumentException();
+            }
             this.input = input;
         }
 
@@ -95,7 +102,7 @@ public final class DottedVersion {
                 } else {
                     var curStopAtDot = (chr == '.');
                     if (!curStopAtDot) {
-                        if (lastDotPos >= 0) {
+                        if (sb.isEmpty() && lastDotPos >= 0) {
                             cursor = lastDotPos;
                         } else {
                             cursor--;
@@ -112,11 +119,7 @@ public final class DottedVersion {
             }
 
             if (sb.isEmpty()) {
-                if (lastDotPos >= 0) {
-                    cursor = lastDotPos;
-                } else {
-                    cursor--;
-                }
+                cursor = lastDotPos;
             }
 
             stoped = true;
@@ -127,7 +130,7 @@ public final class DottedVersion {
             return input.substring(cursor);
         }
 
-        void throwException() {
+        IllegalArgumentException createException() {
             final String tail;
             if (lastDotPos >= 0) {
                 tail = input.substring(lastDotPos + 1);
@@ -143,7 +146,7 @@ public final class DottedVersion {
                 errMessage = MessageFormat.format(I18N.getString(
                         "error.version-string-invalid-component"), input, tail);
             }
-            throw new IllegalArgumentException(errMessage);
+            return new IllegalArgumentException(errMessage);
         }
 
         private int cursor;
@@ -211,9 +214,31 @@ public final class DottedVersion {
         return Arrays.deepEquals(this.components, other.components);
     }
 
+    public DottedVersion trim(int limit) {
+        if (limit < 0) {
+            throw new IllegalArgumentException();
+        } else if (limit >= components.length) {
+            return this;
+        } else {
+            return new DottedVersion(Arrays.copyOf(components, limit), suffix);
+        }
+    }
+
+    public DottedVersion pad(int limit) {
+        if (limit < 0) {
+            throw new IllegalArgumentException();
+        } else if (limit <= components.length) {
+            return this;
+        } else {
+            var newComponents = Arrays.copyOf(components, limit);
+            Arrays.fill(newComponents, components.length, newComponents.length, Component.ZERO);
+            return new DottedVersion(newComponents, suffix);
+        }
+    }
+
     @Override
     public String toString() {
-        return value;
+        return Stream.of(components).map(Component::toString).collect(Collectors.joining(".")) + suffix;
     }
 
     public String getUnprocessedSuffix() {
@@ -221,14 +246,35 @@ public final class DottedVersion {
     }
 
     public String toComponentsString() {
-        return Stream.of(components).map(BigInteger::toString).collect(Collectors.joining("."));
+        return Stream.of(components).map(Component::parsedValue).map(BigInteger::toString).collect(Collectors.joining("."));
+    }
+
+    public int getComponentsCount() {
+        return components.length;
     }
 
     public BigInteger[] getComponents() {
-        return components;
+        return Stream.of(components).map(Component::parsedValue).toArray(BigInteger[]::new);
     }
 
-    private final BigInteger[] components;
-    private final String value;
+    private record Component(BigInteger parsedValue, String strValue) {
+        Component {
+            Objects.requireNonNull(parsedValue);
+            Objects.requireNonNull(strValue);
+        }
+
+        Component(String strValue) {
+            this(new BigInteger(strValue), strValue);
+        }
+
+        @Override
+        public String toString() {
+            return strValue;
+        }
+
+        static final Component ZERO = new Component(BigInteger.ZERO, "0");
+    }
+
+    private final Component[] components;
     private final String suffix;
 }
diff --git a/test/jdk/tools/jpackage/junit/share/jdk.jpackage/jdk/jpackage/internal/model/DottedVersionTest.java b/test/jdk/tools/jpackage/junit/share/jdk.jpackage/jdk/jpackage/internal/model/DottedVersionTest.java
index 885ea31f726..df020f1a34c 100644
--- a/test/jdk/tools/jpackage/junit/share/jdk.jpackage/jdk/jpackage/internal/model/DottedVersionTest.java
+++ b/test/jdk/tools/jpackage/junit/share/jdk.jpackage/jdk/jpackage/internal/model/DottedVersionTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2019, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2019, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -32,8 +32,11 @@ import static org.junit.jupiter.api.Assertions.assertEquals;
 import static org.junit.jupiter.api.Assertions.assertFalse;
 import static org.junit.jupiter.api.Assertions.assertThrowsExactly;
 import static org.junit.jupiter.api.Assertions.assertTrue;
+import static org.junit.jupiter.api.Assertions.assertSame;
+import static org.junit.jupiter.api.Assertions.assertNotSame;
 import org.junit.jupiter.api.Test;
 import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.Arguments;
 import org.junit.jupiter.params.provider.EnumSource;
 import org.junit.jupiter.params.provider.MethodSource;
 
@@ -108,12 +111,113 @@ public class DottedVersionTest {
                 TestConfig.lazy("+1", "+1", 0, ""),
                 TestConfig.lazy("-1", "-1", 0, ""),
                 TestConfig.lazy("-0", "-0", 0, ""),
-                TestConfig.lazy("+0", "+0", 0, "")
+                TestConfig.lazy("+0", "+0", 0, ""),
+                TestConfig.lazy("+0", "+0", 0, ""),
+                TestConfig.lazy("1.2.3+ea", "+ea", 3, "1.2.3"),
+                TestConfig.lazy(".7", ".7", 0, ""),
+                TestConfig.lazy(".+7", ".+7", 0, "")
         ));
 
         return data;
     }
 
+    @ParameterizedTest
+    @MethodSource
+    public void testTrim(DottedVersion ver, String expectedStr, int limit) {
+        var expected = DottedVersion.lazy(expectedStr);
+        var actual = ver.trim(limit);
+        assertEquals(expected, actual);
+        if (limit >= ver.getComponents().length) {
+            assertSame(ver, actual);
+        } else {
+            assertNotSame(ver, actual);
+        }
+        assertEquals(expectedStr, actual.toString());
+    }
+
+    @ParameterizedTest
+    @MethodSource
+    public void testTrimNegative(DottedVersion ver, int limit) {
+        assertThrowsExactly(IllegalArgumentException.class, () -> {
+            ver.trim(limit);
+        });
+    }
+
+    private static Stream<Arguments> testTrim() {
+
+        var testCases = new ArrayList<Arguments>();
+
+        for (var suffix : List.of("", ".foo", "-ea", "+345")) {
+            testCases.addAll(List.of(
+                    Arguments.of("1.02.3" + suffix, "" + suffix, 0),
+                    Arguments.of("1.02.3" + suffix, "1" + suffix, 1),
+                    Arguments.of("1.02.3" + suffix, "1.02" + suffix, 2),
+                    Arguments.of("1.02.3" + suffix, "1.02.3" + suffix, 3),
+                    Arguments.of("1.02.3" + suffix, "1.02.3" + suffix, 4)
+            ));
+        }
+
+        return testCases.stream().map(DottedVersionTest::mapFirstStringToDottedVersion);
+    }
+
+    private static Stream<Arguments> testTrimNegative() {
+        return Stream.of(
+                Arguments.of("10.5.foo", -1)
+        ).map(DottedVersionTest::mapFirstStringToDottedVersion);
+    }
+
+    @ParameterizedTest
+    @MethodSource
+    public void testPad(DottedVersion ver, String expectedStr, int limit) {
+        var expected = DottedVersion.lazy(expectedStr);
+        var actual = ver.pad(limit);
+        assertEquals(expected, actual);
+        if (limit <= ver.getComponents().length) {
+            assertSame(ver, actual);
+        } else {
+            assertNotSame(ver, actual);
+        }
+        assertEquals(expectedStr, actual.toString());
+    }
+
+    @ParameterizedTest
+    @MethodSource
+    public void testPadNegative(DottedVersion ver, int limit) {
+        assertThrowsExactly(IllegalArgumentException.class, () -> {
+            ver.pad(limit);
+        });
+    }
+
+    private static Stream<Arguments> testPad() {
+
+        var testCases = new ArrayList<Arguments>();
+
+        for (var suffix : List.of("", ".foo", "-ea", "+345")) {
+            testCases.addAll(List.of(
+                    Arguments.of("" + suffix, "" + suffix, 0),
+                    Arguments.of("1.02.3" + suffix, "1.02.3" + suffix, 0),
+                    Arguments.of("" + suffix, "0" + suffix, 1),
+                    Arguments.of("1" + suffix, "1" + suffix, 1),
+                    Arguments.of("1" + suffix, "1.0" + suffix, 2),
+                    Arguments.of("1.02.3" + suffix, "1.02.3.0.0" + suffix, 5)
+            ));
+        }
+
+        return testCases.stream().map(DottedVersionTest::mapFirstStringToDottedVersion);
+    }
+
+    private static Stream<Arguments> testPadNegative() {
+        return Stream.of(
+                Arguments.of("10.5.foo", -1)
+        ).map(DottedVersionTest::mapFirstStringToDottedVersion);
+    }
+
+    private static Arguments mapFirstStringToDottedVersion(Arguments v) {
+        var objs = v.get();
+        objs[0] = DottedVersion.lazy((String)objs[0]);
+        return Arguments.of(objs);
+    }
+
     record InvalidVersionTestSpec(String version, String invalidComponent) {
         public InvalidVersionTestSpec {
             Objects.requireNonNull(version);

From 1a4825b2267ddeddd3772ecfb7ab2c9939cba632 Mon Sep 17 00:00:00 2001
From: Jayathirth D V <jdv@openjdk.org>
Date: Fri, 6 Mar 2026 01:12:55 +0000
Subject: [PATCH 063/655] 8379158: Update FreeType to 2.14.2

Reviewed-by: azvegint, prr, serb
---
 src/java.desktop/share/legal/freetype.md      |   2 +-
 .../include/freetype/config/ftoption.h        |   8 +-
 .../include/freetype/config/mac-support.h     |   2 +
 .../libfreetype/include/freetype/freetype.h   |  25 +-
 .../libfreetype/include/freetype/ftbdf.h      |  12 +-
 .../libfreetype/include/freetype/ftimage.h    |   2 +-
 .../libfreetype/include/freetype/ftlcdfil.h   |  10 +-
 .../libfreetype/include/freetype/ftparams.h   |   7 +-
 .../include/freetype/internal/cfftypes.h      |   4 +-
 .../include/freetype/internal/ftobjs.h        |  30 +-
 .../libfreetype/include/freetype/t1tables.h   |   4 +-
 .../native/libfreetype/src/autofit/afadjust.c |  13 +-
 .../native/libfreetype/src/autofit/afglobal.h |   4 +-
 .../native/libfreetype/src/autofit/aflatin.c  |  64 +++--
 .../native/libfreetype/src/autofit/afloader.c |  14 +-
 .../native/libfreetype/src/base/ftadvanc.c    |  66 +++--
 .../native/libfreetype/src/base/ftbitmap.c    |  18 +-
 .../native/libfreetype/src/base/ftglyph.c     |  15 +-
 .../native/libfreetype/src/base/ftlcdfil.c    | 271 +-----------------
 .../native/libfreetype/src/base/ftobjs.c      |  54 ++--
 .../native/libfreetype/src/base/ftutil.c      |   3 +-
 .../native/libfreetype/src/cff/cffdrivr.c     |   4 +-
 .../native/libfreetype/src/cff/cffload.c      |   4 +-
 .../native/libfreetype/src/cff/cffobjs.c      |   6 +-
 .../native/libfreetype/src/cff/cfftoken.h     |   4 +-
 .../native/libfreetype/src/cid/cidtoken.h     |   2 +-
 .../native/libfreetype/src/pshinter/pshalgo.c | 240 ++--------------
 .../native/libfreetype/src/pshinter/pshglob.c |  50 ++--
 .../native/libfreetype/src/sfnt/pngshim.c     |   5 +-
 .../native/libfreetype/src/sfnt/sfdriver.c    |   7 +-
 .../native/libfreetype/src/sfnt/sfwoff2.c     |  10 +-
 .../native/libfreetype/src/sfnt/ttcolr.c      |  10 +-
 .../native/libfreetype/src/sfnt/ttsbit.c      |  11 +-
 .../native/libfreetype/src/smooth/ftgrays.c   |   4 +-
 .../native/libfreetype/src/smooth/ftsmooth.c  | 165 ++++++++---
 .../native/libfreetype/src/truetype/ttgload.c |  11 +-
 .../native/libfreetype/src/truetype/ttgxvar.c |   6 +-
 .../libfreetype/src/truetype/ttinterp.c       |  16 +-
 .../libfreetype/src/truetype/ttinterp.h       |   2 +-
 .../native/libfreetype/src/truetype/ttobjs.c  |  23 +-
 .../native/libfreetype/src/type1/t1tokens.h   |   2 +-
 41 files changed, 400 insertions(+), 810 deletions(-)

diff --git a/src/java.desktop/share/legal/freetype.md b/src/java.desktop/share/legal/freetype.md
index cf2518df594..7259c27183f 100644
--- a/src/java.desktop/share/legal/freetype.md
+++ b/src/java.desktop/share/legal/freetype.md
@@ -1,4 +1,4 @@
-## The FreeType Project: Freetype v2.14.1
+## The FreeType Project: Freetype v2.14.2
 
 
 ### FreeType Notice
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/config/ftoption.h b/src/java.desktop/share/native/libfreetype/include/freetype/config/ftoption.h
index be7a4c50dc3..a0a1a410b68 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/config/ftoption.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/config/ftoption.h
@@ -759,7 +759,13 @@ FT_BEGIN_HEADER
   /**************************************************************************
    *
    * Define `TT_CONFIG_OPTION_BDF` if you want to include support for an
-   * embedded 'BDF~' table within SFNT-based bitmap formats.
+   * embedded 'BDF~' table within an SFNT-based `.otb` font file.  This table
+   * is an extension used by X11 to preserve BDF properties after conversion
+   * to SFNT containers.  See
+   *
+   *   https://fontforge.org/docs/techref/non-standard.html#non-standard-bdf
+   *
+   * for more details.
    */
 /* #define TT_CONFIG_OPTION_BDF */
 
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/config/mac-support.h b/src/java.desktop/share/native/libfreetype/include/freetype/config/mac-support.h
index d1b6a9898fd..bd350851d56 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/config/mac-support.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/config/mac-support.h
@@ -24,6 +24,7 @@
    *   This is the only necessary change, so it is defined here instead
    *   providing a new configuration file.
    */
+#ifdef FT_MACINTOSH
 #if defined( __APPLE__ ) || ( defined( __MWERKS__ ) && defined( macintosh ) )
   /* No Carbon frameworks for 64bit 10.4.x.                         */
   /* `AvailabilityMacros.h` is available since Mac OS X 10.2,       */
@@ -36,6 +37,7 @@
     ( MAC_OS_X_VERSION_MIN_REQUIRED <= MAC_OS_X_VERSION_10_4 )
 #undef FT_MACINTOSH
 #endif
+#endif  /* __APPLE__ ... */
 
 #elif defined( __SC__ ) || defined( __MRC__ )
   /* Classic MacOS compilers */
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/freetype.h b/src/java.desktop/share/native/libfreetype/include/freetype/freetype.h
index 1e249235882..e8a1b1e2f3e 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/freetype.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/freetype.h
@@ -4318,14 +4318,13 @@ FT_BEGIN_HEADER
    *     property `no-stem-darkening` provided by the 'autofit', 'cff',
    *     'type1', and 't1cid' modules; see @no-stem-darkening).
    *
-   *   * @FT_PARAM_TAG_LCD_FILTER_WEIGHTS (LCD filter weights, corresponding
-   *     to function @FT_Library_SetLcdFilterWeights).
-   *
    *   * @FT_PARAM_TAG_RANDOM_SEED (seed value for the CFF, Type~1, and CID
    *     'random' operator, corresponding to the `random-seed` property
    *     provided by the 'cff', 'type1', and 't1cid' modules; see
    *     @random-seed).
    *
+   *   * @FT_PARAM_TAG_LCD_FILTER_WEIGHTS (no longer supported).
+   *
    *   Pass `NULL` as `data` in @FT_Parameter for a given tag to reset the
    *   option and use the library or module default again.
    *
@@ -4352,25 +4351,17 @@ FT_BEGIN_HEADER
    *     FT_Bool              darken_stems = 1;
    *
    *     FT_Parameter         property2;
-   *     FT_LcdFiveTapFilter  custom_weight =
-   *                            { 0x11, 0x44, 0x56, 0x44, 0x11 };
-   *
-   *     FT_Parameter         property3;
    *     FT_Int32             random_seed = 314159265;
    *
-   *     FT_Parameter         properties[3] = { property1,
-   *                                            property2,
-   *                                            property3 };
+   *     FT_Parameter         properties[2] = { property1,
+   *                                            property2 };
    *
    *
    *     property1.tag  = FT_PARAM_TAG_STEM_DARKENING;
    *     property1.data = &darken_stems;
    *
-   *     property2.tag  = FT_PARAM_TAG_LCD_FILTER_WEIGHTS;
-   *     property2.data = custom_weight;
-   *
-   *     property3.tag  = FT_PARAM_TAG_RANDOM_SEED;
-   *     property3.data = &random_seed;
+   *     property2.tag  = FT_PARAM_TAG_RANDOM_SEED;
+   *     property2.data = &random_seed;
    *
    *     FT_Face_Properties( face, 3, properties );
    *   ```
@@ -4381,7 +4372,7 @@ FT_BEGIN_HEADER
    *     FT_Parameter  property;
    *
    *
-   *     property.tag  = FT_PARAM_TAG_LCD_FILTER_WEIGHTS;
+   *     property.tag  = FT_PARAM_TAG_STEM_DARKENING;
    *     property.data = NULL;
    *
    *     FT_Face_Properties( face, 1, &property );
@@ -5178,7 +5169,7 @@ FT_BEGIN_HEADER
    */
 #define FREETYPE_MAJOR  2
 #define FREETYPE_MINOR  14
-#define FREETYPE_PATCH  1
+#define FREETYPE_PATCH  2
 
 
   /**************************************************************************
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/ftbdf.h b/src/java.desktop/share/native/libfreetype/include/freetype/ftbdf.h
index faad25689c9..ab142249217 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/ftbdf.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/ftbdf.h
@@ -44,7 +44,8 @@ FT_BEGIN_HEADER
    *
    * @description:
    *   This section contains the declaration of functions specific to BDF and
-   *   PCF fonts.
+   *   PCF fonts.  They also work for SFNT bitmap fonts that contain a 'BDF~'
+   *   table like X11's `.otb` fonts.
    *
    */
 
@@ -151,7 +152,9 @@ FT_BEGIN_HEADER
    *   FreeType error code.  0~means success.
    *
    * @note:
-   *   This function only works with BDF faces, returning an error otherwise.
+   *   This function only works with BDF faces and SFNT fonts that have a
+   *   'BDF~' table, returning an error otherwise.  For the latter, a bitmap
+   *   strike size must be selected first.
    */
   FT_EXPORT( FT_Error )
   FT_Get_BDF_Charset_ID( FT_Face       face,
@@ -165,7 +168,7 @@ FT_BEGIN_HEADER
    *    FT_Get_BDF_Property
    *
    * @description:
-   *    Retrieve a BDF property from a BDF or PCF font file.
+   *    Retrieve a BDF property from a BDF or PCF font.
    *
    * @input:
    *    face ::
@@ -196,6 +199,9 @@ FT_BEGIN_HEADER
    *
    *   In case of error, `aproperty->type` is always set to
    *   @BDF_PROPERTY_TYPE_NONE.
+   *
+   *   This also works with SFNT fonts that have a 'BDF~' table, after a
+   *   bitmap strike size has been selected.
    */
   FT_EXPORT( FT_Error )
   FT_Get_BDF_Property( FT_Face           face,
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/ftimage.h b/src/java.desktop/share/native/libfreetype/include/freetype/ftimage.h
index b0a0172ef4f..a4dc724f349 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/ftimage.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/ftimage.h
@@ -875,7 +875,7 @@ FT_BEGIN_HEADER
    */
   typedef struct  FT_Span_
   {
-    short           x;
+    unsigned short  x;
     unsigned short  len;
     unsigned char   coverage;
 
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/ftlcdfil.h b/src/java.desktop/share/native/libfreetype/include/freetype/ftlcdfil.h
index a0a8e9da929..37bb5e1b8fb 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/ftlcdfil.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/ftlcdfil.h
@@ -145,16 +145,10 @@ FT_BEGIN_HEADER
    *
    *   FT_LCD_FILTER_LEGACY ::
    *   FT_LCD_FILTER_LEGACY1 ::
-   *     This filter corresponds to the original libXft color filter.  It
-   *     provides high contrast output but can exhibit really bad color
-   *     fringes if glyphs are not extremely well hinted to the pixel grid.
-   *     This filter is only provided for comparison purposes, and might be
-   *     disabled or stay unsupported in the future. The second value is
-   *     provided for compatibility with FontConfig, which historically used
-   *     different enumeration, sometimes incorrectly forwarded to FreeType.
+   *     The legacy libXft color filter is no longer supported and ignored.
    *
    * @since:
-   *   2.3.0 (`FT_LCD_FILTER_LEGACY1` since 2.6.2)
+   *   2.3.0
    */
   typedef enum  FT_LcdFilter_
   {
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/ftparams.h b/src/java.desktop/share/native/libfreetype/include/freetype/ftparams.h
index 2c09db1683e..94dcd6399a6 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/ftparams.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/ftparams.h
@@ -133,11 +133,8 @@ FT_BEGIN_HEADER
    *   FT_PARAM_TAG_LCD_FILTER_WEIGHTS
    *
    * @description:
-   *   An @FT_Parameter tag to be used with @FT_Face_Properties.  The
-   *   corresponding argument specifies the five LCD filter weights for a
-   *   given face (if using @FT_LOAD_TARGET_LCD, for example), overriding the
-   *   global default values or the values set up with
-   *   @FT_Library_SetLcdFilterWeights.
+   *   Overriding global LCD filter weights with custom values for a given
+   *   face is no longer supported and ignored.
    *
    * @since:
    *   2.8
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/internal/cfftypes.h b/src/java.desktop/share/native/libfreetype/include/freetype/internal/cfftypes.h
index 62335db4834..754122fa646 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/internal/cfftypes.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/internal/cfftypes.h
@@ -191,8 +191,8 @@ FT_BEGIN_HEADER
     FT_UInt    weight;
     FT_Bool    is_fixed_pitch;
     FT_Fixed   italic_angle;
-    FT_Fixed   underline_position;
-    FT_Fixed   underline_thickness;
+    FT_Short   underline_position;
+    FT_UShort  underline_thickness;
     FT_Int     paint_type;
     FT_Int     charstring_type;
     FT_Matrix  font_matrix;
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/internal/ftobjs.h b/src/java.desktop/share/native/libfreetype/include/freetype/internal/ftobjs.h
index 3db2fe28ffd..d4d7bc00fe9 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/internal/ftobjs.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/internal/ftobjs.h
@@ -365,11 +365,6 @@ FT_BEGIN_HEADER
    *     Value~0 means to use the font's value.  Value~-1 means to use the
    *     CFF driver's default.
    *
-   *   lcd_weights ::
-   *   lcd_filter_func ::
-   *     These fields specify the LCD filtering weights and callback function
-   *     for ClearType-style subpixel rendering.
-   *
    *   refcount ::
    *     A counter initialized to~1 at the time an @FT_Face structure is
    *     created.  @FT_Reference_Face increments this counter, and
@@ -391,11 +386,6 @@ FT_BEGIN_HEADER
     FT_Char              no_stem_darkening;
     FT_Int32             random_seed;
 
-#ifdef FT_CONFIG_OPTION_SUBPIXEL_RENDERING
-    FT_LcdFiveTapFilter      lcd_weights;      /* filter weights, if any */
-    FT_Bitmap_LcdFilterFunc  lcd_filter_func;  /* filtering callback     */
-#endif
-
     FT_Int  refcount;
 
   } FT_Face_InternalRec;
@@ -724,9 +714,9 @@ FT_BEGIN_HEADER
                               const FT_Vector*  origin );
 
   /* Allocate a new bitmap buffer in a glyph slot. */
+  /* Dimensions must be preset in advance.         */
   FT_BASE( FT_Error )
-  ft_glyphslot_alloc_bitmap( FT_GlyphSlot  slot,
-                             FT_ULong      size );
+  ft_glyphslot_alloc_bitmap( FT_GlyphSlot  slot );
 
 
   /* Set the bitmap buffer in a glyph slot to a given pointer.  The buffer */
@@ -889,10 +879,6 @@ FT_BEGIN_HEADER
    *   lcd_weights ::
    *     The LCD filter weights for ClearType-style subpixel rendering.
    *
-   *   lcd_filter_func ::
-   *     The LCD filtering callback function for for ClearType-style subpixel
-   *     rendering.
-   *
    *   lcd_geometry ::
    *     This array specifies LCD subpixel geometry and controls Harmony LCD
    *     rendering technique, alternative to ClearType.
@@ -926,7 +912,6 @@ FT_BEGIN_HEADER
 
 #ifdef FT_CONFIG_OPTION_SUBPIXEL_RENDERING
     FT_LcdFiveTapFilter      lcd_weights;      /* filter weights, if any */
-    FT_Bitmap_LcdFilterFunc  lcd_filter_func;  /* filtering callback     */
 #else
     FT_Vector                lcd_geometry[3];  /* RGB subpixel positions */
 #endif
@@ -995,17 +980,6 @@ FT_BEGIN_HEADER
 #endif /* !FT_CONFIG_OPTION_NO_DEFAULT_SYSTEM */
 
 
-  /* Define default raster's interface.  The default raster is located in  */
-  /* `src/base/ftraster.c'.                                                */
-  /*                                                                       */
-  /* Client applications can register new rasters through the              */
-  /* FT_Set_Raster() API.                                                  */
-
-#ifndef FT_NO_DEFAULT_RASTER
-  FT_EXPORT_VAR( FT_Raster_Funcs )  ft_default_raster;
-#endif
-
-
   /**************************************************************************
    *
    * @macro:
diff --git a/src/java.desktop/share/native/libfreetype/include/freetype/t1tables.h b/src/java.desktop/share/native/libfreetype/include/freetype/t1tables.h
index fc3c1706de5..fe769f607fa 100644
--- a/src/java.desktop/share/native/libfreetype/include/freetype/t1tables.h
+++ b/src/java.desktop/share/native/libfreetype/include/freetype/t1tables.h
@@ -92,7 +92,7 @@ FT_BEGIN_HEADER
     FT_String*  full_name;
     FT_String*  family_name;
     FT_String*  weight;
-    FT_Long     italic_angle;
+    FT_Fixed    italic_angle;
     FT_Bool     is_fixed_pitch;
     FT_Short    underline_position;
     FT_UShort   underline_thickness;
@@ -645,7 +645,7 @@ FT_BEGIN_HEADER
     PS_DICT_UNDERLINE_POSITION,     /* FT_Short   */
     PS_DICT_UNDERLINE_THICKNESS,    /* FT_UShort  */
     PS_DICT_FS_TYPE,                /* FT_UShort  */
-    PS_DICT_ITALIC_ANGLE,           /* FT_Long    */
+    PS_DICT_ITALIC_ANGLE,           /* FT_Fixed   */
 
     PS_DICT_MAX = PS_DICT_ITALIC_ANGLE
 
diff --git a/src/java.desktop/share/native/libfreetype/src/autofit/afadjust.c b/src/java.desktop/share/native/libfreetype/src/autofit/afadjust.c
index 6637cacfccf..a1aa45914d0 100644
--- a/src/java.desktop/share/native/libfreetype/src/autofit/afadjust.c
+++ b/src/java.desktop/share/native/libfreetype/src/autofit/afadjust.c
@@ -1405,7 +1405,8 @@
         FT_TRACE4(( "  " ));
         idx = HB_SET_VALUE_INVALID;
         while ( hb( set_next )( gsub_lookups, &idx ) )
-          if ( globals->gsub_lookups_single_alternate[idx] )
+          if ( idx < globals->gsub_lookup_count            &&
+               globals->gsub_lookups_single_alternate[idx] )
           {
             have_idx = TRUE;
             FT_TRACE4(( "  %u", idx ));
@@ -1428,9 +1429,17 @@
       idx = HB_SET_VALUE_INVALID;
       while ( hb( set_next )( gsub_lookups, &idx ) )
       {
-        FT_UInt32  offset = globals->gsub_lookups_single_alternate[idx];
+        FT_UInt32  offset;
 
 
+        /* HarfBuzz only validates lookup indices while   */
+        /* processing lookups, not while collecting them, */
+        /* so we have to do that by ourselves.            */
+        if ( idx < globals->gsub_lookup_count )
+          offset = globals->gsub_lookups_single_alternate[idx];
+        else
+          offset = 0;
+
         /* Put all substitutions into a single hash table.  Note that   */
         /* the hash values usually contain more than a single character */
         /* code; this can happen if different 'SingleSubst' subtables   */
diff --git a/src/java.desktop/share/native/libfreetype/src/autofit/afglobal.h b/src/java.desktop/share/native/libfreetype/src/autofit/afglobal.h
index 362f56e290b..dc061159492 100644
--- a/src/java.desktop/share/native/libfreetype/src/autofit/afglobal.h
+++ b/src/java.desktop/share/native/libfreetype/src/autofit/afglobal.h
@@ -116,7 +116,9 @@ FT_BEGIN_HEADER
 
     /* The GSUB table. */
     FT_Byte*         gsub;
-    /* Lookup offsets, with only SingleSubst and AlternateSubst non-NULL. */
+    /* An array of lookup offsets (of `gsub_lookup_count` elements), */
+    /* with only SingleSubst and AlternateSubst lookups non-NULL.    */
+    FT_UShort        gsub_lookup_count;
     FT_UInt32*       gsub_lookups_single_alternate;
 #endif
 
diff --git a/src/java.desktop/share/native/libfreetype/src/autofit/aflatin.c b/src/java.desktop/share/native/libfreetype/src/autofit/aflatin.c
index cb5667ff793..4a42d919474 100644
--- a/src/java.desktop/share/native/libfreetype/src/autofit/aflatin.c
+++ b/src/java.desktop/share/native/libfreetype/src/autofit/aflatin.c
@@ -3269,9 +3269,9 @@
           next_on = next_on->next;
 
         if ( next_on->y > p->y && prev_on->y > p->y )
-          measurement = p->y - min_y;
+          measurement = SUB_LONG( p->y, min_y );
         else if ( next_on->y < p->y && prev_on->y < p->y )
-          measurement = max_y - p->y;
+          measurement = SUB_LONG( max_y, p->y );
         else
           continue;
 
@@ -3309,11 +3309,14 @@
     p = first_point;
     do
     {
-      p     = p->next;
-      /* We adjust the height of the diacritic only, which means    */
-      /* we are never dealing with large numbers and can thus avoid */
-      /* `FT_MulFix`.                                               */
-      p->y  = ( ( p->y - min_y ) * target_height / height ) + min_y;
+      p    = p->next;
+      /* We adjust the height of the diacritic only, which means */
+      /* we are never dealing with (valid) large numbers and can */
+      /* thus avoid `FT_MulFix`.                                 */
+      p->y = ADD_LONG( MUL_LONG( SUB_LONG( p->y,
+                                           min_y ),
+                                 target_height ) / height,
+                       min_y );
 
     } while ( p != first_point );
 
@@ -3370,9 +3373,9 @@
           next_on = next_on->next;
 
         if ( next_on->y > p->y && prev_on->y > p->y )
-          measurement = p->y - min_y;
+          measurement = SUB_LONG( p->y, min_y );
         else if ( next_on->y < p->y && prev_on->y < p->y )
-          measurement = max_y - p->y;
+          measurement = SUB_LONG( max_y, p->y );
         else
           continue;
 
@@ -3403,8 +3406,11 @@
     p = first_point;
     do
     {
-      p     = p->next;
-      p->y  = ( ( p->y - max_y ) * target_height / height ) + max_y;
+      p    = p->next;
+      p->y = ADD_LONG( MUL_LONG( SUB_LONG( p->y,
+                                           max_y ),
+                                 target_height ) / height,
+                       max_y );
 
     } while ( p != first_point );
 
@@ -3462,9 +3468,9 @@
     } while ( p != first_point );
 
     /* Align bottom of the tilde to the grid. */
-    min_y_rounded = FT_PIX_ROUND( min_y );
-    delta         = min_y_rounded - min_y;
-    height        = max_y - min_y;
+    min_y_rounded = FT_PIX_ROUND_LONG( min_y );
+    delta         = SUB_LONG( min_y_rounded, min_y );
+    height        = SUB_LONG( max_y, min_y );
 
     /* If the tilde is less than 3 pixels tall, snap the center of it */
     /* to the grid instead of the bottom to improve readability.      */
@@ -3502,9 +3508,9 @@
 
     } while ( p != first_point );
 
-    max_y_rounded = FT_PIX_ROUND( max_y );
-    delta         = max_y_rounded - max_y;
-    height        = max_y - min_y;
+    max_y_rounded = FT_PIX_ROUND_LONG( max_y );
+    delta         = SUB_LONG( max_y_rounded, max_y );
+    height        = SUB_LONG( max_y, min_y );
 
     if ( height < 64 * 3 )
       delta -= ( FT_PIX_ROUND( height ) - height ) / 2;
@@ -3673,7 +3679,7 @@
 
       high_min_y  = hints->contour_y_minima[high_contour];
       high_max_y  = hints->contour_y_maxima[high_contour];
-      high_height = high_max_y - high_min_y;
+      high_height = SUB_LONG( high_max_y, high_min_y );
 
       if ( high_height > accent_height_limit )
       {
@@ -3705,7 +3711,7 @@
         /* We also check that the y minimum of the 'other' contour */
         /* is below the high contour to avoid potential false hits */
         /* with contours enclosed in the high one.                 */
-        distance = high_min_y - max_y;
+        distance = SUB_LONG( high_min_y, max_y );
         if ( distance < 64           &&
              distance < min_distance &&
              min_y < high_min_y      )
@@ -3724,14 +3730,14 @@
 
         tilde_min_y  = hints->contour_y_minima[tilde_contour];
         tilde_max_y  = hints->contour_y_maxima[tilde_contour];
-        tilde_height = tilde_max_y - tilde_min_y;
+        tilde_height = SUB_LONG( tilde_max_y, tilde_min_y);
 
         /* The vertical separation adjustment potentially undoes a */
         /* tilde center alignment.  If it would grid-align a tilde */
         /* less than 3 pixels in height, shift additionally to     */
         /* re-center the tilde.                                    */
 
-        pos = high_min_y + adjustment_amount;
+        pos = ADD_LONG( high_min_y, adjustment_amount );
         if ( adjust_below_top && is_top_tilde )
           pos += high_height;
 
@@ -3764,7 +3770,7 @@
       {
         /* Value 8 is heuristic. */
         FT_Pos  height_delta = high_height / 8;
-        FT_Pos  min_y_limit  = high_min_y - height_delta;
+        FT_Pos  min_y_limit  = SUB_LONG( high_min_y, height_delta );
 
 
         FT_TRACE4(( "    Pushing high contour %ld units up\n",
@@ -3784,7 +3790,7 @@
                       centering_adjustment ));
 
           af_move_contours_up( hints,
-                               min_y_limit + high_height,
+                               ADD_LONG( min_y_limit, high_height ),
                                centering_adjustment );
         }
       }
@@ -3838,7 +3844,7 @@
 
       low_min_y  = hints->contour_y_minima[low_contour];
       low_max_y  = hints->contour_y_maxima[low_contour];
-      low_height = low_max_y - low_min_y;
+      low_height = SUB_LONG( low_max_y, low_min_y );
 
       if ( low_height > accent_height_limit )
       {
@@ -3863,7 +3869,7 @@
         min_y = hints->contour_y_minima[contour];
         max_y = hints->contour_y_maxima[contour];
 
-        distance = min_y - low_max_y;
+        distance = SUB_LONG( min_y, low_max_y );
         if ( distance < 64           &&
              distance < min_distance &&
              max_y > low_max_y       )
@@ -3882,9 +3888,9 @@
 
         tilde_min_y  = hints->contour_y_minima[tilde_contour];
         tilde_max_y  = hints->contour_y_maxima[tilde_contour];
-        tilde_height = tilde_max_y - tilde_min_y;
+        tilde_height = SUB_LONG( tilde_max_y, tilde_min_y );
 
-        pos = low_max_y - adjustment_amount;
+        pos = SUB_LONG( low_max_y, adjustment_amount );
         if ( adjust_above_bottom && is_bottom_tilde )
           pos -= low_height;
 
@@ -3915,7 +3921,7 @@
            ( calculated_amount <= 66 || adjustment_amount <= 66 ) )
       {
         FT_Pos  height_delta = low_height / 8;
-        FT_Pos  max_y_limit  = low_max_y + height_delta;
+        FT_Pos  max_y_limit  = ADD_LONG( low_max_y, height_delta );
 
 
         FT_TRACE4(( "    Pushing low contour %ld units down\n",
@@ -3929,7 +3935,7 @@
                       centering_adjustment ));
 
           af_move_contours_down( hints,
-                                 max_y_limit - low_height,
+                                 SUB_LONG( max_y_limit, low_height ),
                                  centering_adjustment );
         }
       }
diff --git a/src/java.desktop/share/native/libfreetype/src/autofit/afloader.c b/src/java.desktop/share/native/libfreetype/src/autofit/afloader.c
index d84adc09679..4e2ac1f1ce3 100644
--- a/src/java.desktop/share/native/libfreetype/src/autofit/afloader.c
+++ b/src/java.desktop/share/native/libfreetype/src/autofit/afloader.c
@@ -524,16 +524,18 @@
 
       bbox.xMin = FT_PIX_FLOOR( bbox.xMin );
       bbox.yMin = FT_PIX_FLOOR( bbox.yMin );
-      bbox.xMax = FT_PIX_CEIL(  bbox.xMax );
-      bbox.yMax = FT_PIX_CEIL(  bbox.yMax );
+      bbox.xMax = FT_PIX_CEIL_LONG( bbox.xMax );
+      bbox.yMax = FT_PIX_CEIL_LONG( bbox.yMax );
 
-      slot->metrics.width        = bbox.xMax - bbox.xMin;
-      slot->metrics.height       = bbox.yMax - bbox.yMin;
+      slot->metrics.width        = SUB_LONG( bbox.xMax, bbox.xMin );
+      slot->metrics.height       = SUB_LONG( bbox.yMax, bbox.yMin );
       slot->metrics.horiBearingX = bbox.xMin;
       slot->metrics.horiBearingY = bbox.yMax;
 
-      slot->metrics.vertBearingX = FT_PIX_FLOOR( bbox.xMin + vvector.x );
-      slot->metrics.vertBearingY = FT_PIX_FLOOR( bbox.yMax + vvector.y );
+      slot->metrics.vertBearingX = FT_PIX_FLOOR( ADD_LONG( bbox.xMin,
+                                                           vvector.x ) );
+      slot->metrics.vertBearingY = FT_PIX_FLOOR( ADD_LONG( bbox.yMax,
+                                                           vvector.y ) );
 
       /* for mono-width fonts (like Andale, Courier, etc.) we need */
       /* to keep the original rounded advance width; ditto for     */
diff --git a/src/java.desktop/share/native/libfreetype/src/base/ftadvanc.c b/src/java.desktop/share/native/libfreetype/src/base/ftadvanc.c
index ff0fc510503..7b965c62d58 100644
--- a/src/java.desktop/share/native/libfreetype/src/base/ftadvanc.c
+++ b/src/java.desktop/share/native/libfreetype/src/base/ftadvanc.c
@@ -20,6 +20,7 @@
 
 #include <freetype/ftadvanc.h>
 #include <freetype/internal/ftobjs.h>
+#include <freetype/internal/ftcalc.h>
 
 
   static FT_Error
@@ -47,11 +48,43 @@
     /* (see `FT_Load_Glyph' implementation in src/base/ftobjs.c)        */
 
     for ( nn = 0; nn < count; nn++ )
-      advances[nn] = FT_MulDiv( advances[nn], scale, 64 );
+      advances[nn] = FT_MulFix( 1024 * advances[nn], scale );
 
     return FT_Err_Ok;
   }
 
+  /* loading (and hinting) to calculate the advances is slow  */
+  /* unless TrueType hdmx table is provided as an accelerator */
+  static FT_Error
+  ft_load_advances( FT_Face   face,
+                    FT_UInt   gindex,
+                    FT_UInt   count,
+                    FT_Int32  flags,
+                    FT_Fixed  *padvances )
+  {
+    FT_UInt   nn;
+    FT_Error  error   = FT_Err_Ok;
+    FT_Pos    factor  = flags & FT_LOAD_NO_SCALE ? 1 : 1024;
+    FT_Pos*   advance = flags & FT_LOAD_VERTICAL_LAYOUT
+                          ? &face->glyph->advance.y
+                          : &face->glyph->advance.x;
+
+
+    flags |= (FT_UInt32)FT_LOAD_ADVANCE_ONLY;
+
+    for ( nn = 0; nn < count; nn++ )
+    {
+      error = FT_Load_Glyph( face, gindex + nn, flags );
+      if ( error )
+        break;
+
+      /* scale from 26.6 to 16.16, unless NO_SCALE was requested */
+      padvances[nn] = *advance * factor;
+    }
+
+    return error;
+  }
+
 
    /* at the moment, we can perform fast advance retrieval only in */
    /* the following cases:                                         */
@@ -102,7 +135,10 @@
         return error;
     }
 
-    return FT_Get_Advances( face, gindex, 1, flags, padvance );
+    if ( flags & FT_ADVANCE_FLAG_FAST_ONLY )
+      return FT_THROW( Unimplemented_Feature );
+
+    return ft_load_advances( face, gindex, 1, flags, padvance );
   }
 
 
@@ -115,12 +151,9 @@
                    FT_Int32   flags,
                    FT_Fixed  *padvances )
   {
-    FT_Error  error = FT_Err_Ok;
-
     FT_Face_GetAdvancesFunc  func;
 
-    FT_UInt  num, end, nn;
-    FT_Int   factor;
+    FT_UInt  num, end;
 
 
     if ( !face )
@@ -140,6 +173,9 @@
     func = face->driver->clazz->get_advances;
     if ( func && LOAD_ADVANCE_FAST_CHECK( face, flags ) )
     {
+      FT_Error  error;
+
+
       error = func( face, start, count, flags, padvances );
       if ( !error )
         return ft_face_scale_advances_( face, padvances, count, flags );
@@ -148,26 +184,10 @@
         return error;
     }
 
-    error = FT_Err_Ok;
-
     if ( flags & FT_ADVANCE_FLAG_FAST_ONLY )
       return FT_THROW( Unimplemented_Feature );
 
-    flags |= (FT_UInt32)FT_LOAD_ADVANCE_ONLY;
-    factor = ( flags & FT_LOAD_NO_SCALE ) ? 1 : 1024;
-    for ( nn = 0; nn < count; nn++ )
-    {
-      error = FT_Load_Glyph( face, start + nn, flags );
-      if ( error )
-        break;
-
-      /* scale from 26.6 to 16.16, unless NO_SCALE was requested */
-      padvances[nn] = ( flags & FT_LOAD_VERTICAL_LAYOUT )
-                      ? face->glyph->advance.y * factor
-                      : face->glyph->advance.x * factor;
-    }
-
-    return error;
+    return ft_load_advances( face, start, count, flags, padvances );
   }
 
 
diff --git a/src/java.desktop/share/native/libfreetype/src/base/ftbitmap.c b/src/java.desktop/share/native/libfreetype/src/base/ftbitmap.c
index 2c8e44b905d..364f881e435 100644
--- a/src/java.desktop/share/native/libfreetype/src/base/ftbitmap.c
+++ b/src/java.desktop/share/native/libfreetype/src/base/ftbitmap.c
@@ -922,14 +922,7 @@
       target->pitch      = (int)final_width * 4;
       target->num_grays  = 256;
 
-      if ( FT_LONG_MAX / target->pitch < (int)target->rows )
-      {
-        FT_TRACE5(( "FT_Blend_Bitmap: target bitmap too large (%u x %u)\n",
-                     final_width, final_rows ));
-        return FT_THROW( Invalid_Argument );
-      }
-
-      if ( FT_ALLOC( target->buffer, target->pitch * (int)target->rows ) )
+      if ( FT_ALLOC_MULT( target->buffer, target->rows, target->pitch ) )
         return error;
 
       free_target_bitmap_on_error = 1;
@@ -950,16 +943,9 @@
 
       new_pitch = (int)final_width * 4;
 
-      if ( FT_LONG_MAX / new_pitch < (int)final_rows )
-      {
-        FT_TRACE5(( "FT_Blend_Bitmap: target bitmap too large (%u x %u)\n",
-                     final_width, final_rows ));
-        return FT_THROW( Invalid_Argument );
-      }
-
       /* TODO: provide an in-buffer solution for large bitmaps */
       /*       to avoid allocation of a new buffer             */
-      if ( FT_ALLOC( buffer, new_pitch * (int)final_rows ) )
+      if ( FT_ALLOC_MULT( buffer, final_rows, new_pitch ) )
         goto Error;
 
       /* copy data to new buffer */
diff --git a/src/java.desktop/share/native/libfreetype/src/base/ftglyph.c b/src/java.desktop/share/native/libfreetype/src/base/ftglyph.c
index 75babb1aa56..6138cfeec2c 100644
--- a/src/java.desktop/share/native/libfreetype/src/base/ftglyph.c
+++ b/src/java.desktop/share/native/libfreetype/src/base/ftglyph.c
@@ -62,7 +62,7 @@
                         FT_GlyphSlot  slot )
   {
     FT_BitmapGlyph  glyph   = (FT_BitmapGlyph)bitmap_glyph;
-    FT_Error        error   = FT_Err_Ok;
+    FT_Error        error;
     FT_Library      library = FT_GLYPH( glyph )->library;
 
 
@@ -75,17 +75,8 @@
     glyph->left = slot->bitmap_left;
     glyph->top  = slot->bitmap_top;
 
-    /* do lazy copying whenever possible */
-    if ( slot->internal->flags & FT_GLYPH_OWN_BITMAP )
-    {
-      glyph->bitmap          = slot->bitmap;
-      slot->internal->flags &= ~FT_GLYPH_OWN_BITMAP;
-    }
-    else
-    {
-      FT_Bitmap_Init( &glyph->bitmap );
-      error = FT_Bitmap_Copy( library, &slot->bitmap, &glyph->bitmap );
-    }
+    FT_Bitmap_Init( &glyph->bitmap );
+    error = FT_Bitmap_Copy( library, &slot->bitmap, &glyph->bitmap );
 
   Exit:
     return error;
diff --git a/src/java.desktop/share/native/libfreetype/src/base/ftlcdfil.c b/src/java.desktop/share/native/libfreetype/src/base/ftlcdfil.c
index d026da8b012..51c6fd48a1b 100644
--- a/src/java.desktop/share/native/libfreetype/src/base/ftlcdfil.c
+++ b/src/java.desktop/share/native/libfreetype/src/base/ftlcdfil.c
@@ -25,265 +25,28 @@
 
 #ifdef FT_CONFIG_OPTION_SUBPIXEL_RENDERING
 
-/* define USE_LEGACY to implement the legacy filter */
-#define  USE_LEGACY
-
-#define FT_SHIFTCLAMP( x )  ( x >>= 8, (FT_Byte)( x > 255 ? 255 : x ) )
-
-
-  /* add padding according to filter weights */
+  /* add padding sufficient for a 5-tap filter, */
+  /* which is 2/3 of a pixel                    */
   FT_BASE_DEF( void )
   ft_lcd_padding( FT_BBox*        cbox,
                   FT_GlyphSlot    slot,
                   FT_Render_Mode  mode )
   {
-    FT_Byte*                 lcd_weights;
-    FT_Bitmap_LcdFilterFunc  lcd_filter_func;
+    FT_UNUSED( slot );
 
-
-    /* Per-face LCD filtering takes priority if set up. */
-    if ( slot->face && slot->face->internal->lcd_filter_func )
+    if ( mode == FT_RENDER_MODE_LCD )
     {
-      lcd_weights     = slot->face->internal->lcd_weights;
-      lcd_filter_func = slot->face->internal->lcd_filter_func;
+      cbox->xMin -= 43;
+      cbox->xMax += 43;
     }
-    else
+    else if ( mode == FT_RENDER_MODE_LCD_V )
     {
-      lcd_weights     = slot->library->lcd_weights;
-      lcd_filter_func = slot->library->lcd_filter_func;
-    }
-
-    if ( lcd_filter_func == ft_lcd_filter_fir )
-    {
-      if ( mode == FT_RENDER_MODE_LCD )
-      {
-        cbox->xMin -= lcd_weights[0] ? 43 :
-                      lcd_weights[1] ? 22 : 0;
-        cbox->xMax += lcd_weights[4] ? 43 :
-                      lcd_weights[3] ? 22 : 0;
-      }
-      else if ( mode == FT_RENDER_MODE_LCD_V )
-      {
-        cbox->yMin -= lcd_weights[0] ? 43 :
-                      lcd_weights[1] ? 22 : 0;
-        cbox->yMax += lcd_weights[4] ? 43 :
-                      lcd_weights[3] ? 22 : 0;
-      }
+      cbox->yMin -= 43;
+      cbox->yMax += 43;
     }
   }
 
 
-  /* FIR filter used by the default and light filters */
-  FT_BASE_DEF( void )
-  ft_lcd_filter_fir( FT_Bitmap*           bitmap,
-                     FT_LcdFiveTapFilter  weights )
-  {
-    FT_UInt   width  = (FT_UInt)bitmap->width;
-    FT_UInt   height = (FT_UInt)bitmap->rows;
-    FT_Int    pitch  = bitmap->pitch;
-    FT_Byte*  origin = bitmap->buffer;
-    FT_Byte   mode   = bitmap->pixel_mode;
-
-
-    /* take care of bitmap flow */
-    if ( pitch > 0 && height > 0 )
-      origin += pitch * (FT_Int)( height - 1 );
-
-    /* horizontal in-place FIR filter */
-    if ( mode == FT_PIXEL_MODE_LCD && width >= 2 )
-    {
-      FT_Byte*  line = origin;
-
-
-      /* `fir' must be at least 32 bit wide, since the sum of */
-      /* the values in `weights' can exceed 0xFF              */
-
-      for ( ; height > 0; height--, line -= pitch )
-      {
-        FT_UInt  fir[5];
-        FT_UInt  val, xx;
-
-
-        val    = line[0];
-        fir[2] = weights[2] * val;
-        fir[3] = weights[3] * val;
-        fir[4] = weights[4] * val;
-
-        val    = line[1];
-        fir[1] = fir[2] + weights[1] * val;
-        fir[2] = fir[3] + weights[2] * val;
-        fir[3] = fir[4] + weights[3] * val;
-        fir[4] =          weights[4] * val;
-
-        for ( xx = 2; xx < width; xx++ )
-        {
-          val    = line[xx];
-          fir[0] = fir[1] + weights[0] * val;
-          fir[1] = fir[2] + weights[1] * val;
-          fir[2] = fir[3] + weights[2] * val;
-          fir[3] = fir[4] + weights[3] * val;
-          fir[4] =          weights[4] * val;
-
-          line[xx - 2] = FT_SHIFTCLAMP( fir[0] );
-        }
-
-        line[xx - 2] = FT_SHIFTCLAMP( fir[1] );
-        line[xx - 1] = FT_SHIFTCLAMP( fir[2] );
-      }
-    }
-
-    /* vertical in-place FIR filter */
-    else if ( mode == FT_PIXEL_MODE_LCD_V && height >= 2 )
-    {
-      FT_Byte*  column = origin;
-
-
-      for ( ; width > 0; width--, column++ )
-      {
-        FT_Byte*  col = column;
-        FT_UInt   fir[5];
-        FT_UInt   val, yy;
-
-
-        val    = col[0];
-        fir[2] = weights[2] * val;
-        fir[3] = weights[3] * val;
-        fir[4] = weights[4] * val;
-        col   -= pitch;
-
-        val    = col[0];
-        fir[1] = fir[2] + weights[1] * val;
-        fir[2] = fir[3] + weights[2] * val;
-        fir[3] = fir[4] + weights[3] * val;
-        fir[4] =          weights[4] * val;
-        col   -= pitch;
-
-        for ( yy = 2; yy < height; yy++, col -= pitch )
-        {
-          val    = col[0];
-          fir[0] = fir[1] + weights[0] * val;
-          fir[1] = fir[2] + weights[1] * val;
-          fir[2] = fir[3] + weights[2] * val;
-          fir[3] = fir[4] + weights[3] * val;
-          fir[4] =          weights[4] * val;
-
-          col[pitch * 2]  = FT_SHIFTCLAMP( fir[0] );
-        }
-
-        col[pitch * 2]  = FT_SHIFTCLAMP( fir[1] );
-        col[pitch]      = FT_SHIFTCLAMP( fir[2] );
-      }
-    }
-  }
-
-
-#ifdef USE_LEGACY
-
-  /* intra-pixel filter used by the legacy filter */
-  static void
-  _ft_lcd_filter_legacy( FT_Bitmap*      bitmap,
-                         FT_Byte*        weights )
-  {
-    FT_UInt   width  = (FT_UInt)bitmap->width;
-    FT_UInt   height = (FT_UInt)bitmap->rows;
-    FT_Int    pitch  = bitmap->pitch;
-    FT_Byte*  origin = bitmap->buffer;
-    FT_Byte   mode   = bitmap->pixel_mode;
-
-    static const unsigned int  filters[3][3] =
-    {
-      { 65538 * 9/13, 65538 * 1/6, 65538 * 1/13 },
-      { 65538 * 3/13, 65538 * 4/6, 65538 * 3/13 },
-      { 65538 * 1/13, 65538 * 1/6, 65538 * 9/13 }
-    };
-
-    FT_UNUSED( weights );
-
-
-    /* take care of bitmap flow */
-    if ( pitch > 0 && height > 0 )
-      origin += pitch * (FT_Int)( height - 1 );
-
-    /* horizontal in-place intra-pixel filter */
-    if ( mode == FT_PIXEL_MODE_LCD && width >= 3 )
-    {
-      FT_Byte*  line = origin;
-
-
-      for ( ; height > 0; height--, line -= pitch )
-      {
-        FT_UInt  xx;
-
-
-        for ( xx = 0; xx < width; xx += 3 )
-        {
-          FT_UInt  r, g, b;
-          FT_UInt  p;
-
-
-          p  = line[xx];
-          r  = filters[0][0] * p;
-          g  = filters[0][1] * p;
-          b  = filters[0][2] * p;
-
-          p  = line[xx + 1];
-          r += filters[1][0] * p;
-          g += filters[1][1] * p;
-          b += filters[1][2] * p;
-
-          p  = line[xx + 2];
-          r += filters[2][0] * p;
-          g += filters[2][1] * p;
-          b += filters[2][2] * p;
-
-          line[xx]     = (FT_Byte)( r / 65536 );
-          line[xx + 1] = (FT_Byte)( g / 65536 );
-          line[xx + 2] = (FT_Byte)( b / 65536 );
-        }
-      }
-    }
-    else if ( mode == FT_PIXEL_MODE_LCD_V && height >= 3 )
-    {
-      FT_Byte*  column = origin;
-
-
-      for ( ; width > 0; width--, column++ )
-      {
-        FT_Byte*  col = column - 2 * pitch;
-
-
-        for ( ; height > 0; height -= 3, col -= 3 * pitch )
-        {
-          FT_UInt  r, g, b;
-          FT_UInt  p;
-
-
-          p  = col[0];
-          r  = filters[0][0] * p;
-          g  = filters[0][1] * p;
-          b  = filters[0][2] * p;
-
-          p  = col[pitch];
-          r += filters[1][0] * p;
-          g += filters[1][1] * p;
-          b += filters[1][2] * p;
-
-          p  = col[pitch * 2];
-          r += filters[2][0] * p;
-          g += filters[2][1] * p;
-          b += filters[2][2] * p;
-
-          col[0]         = (FT_Byte)( r / 65536 );
-          col[pitch]     = (FT_Byte)( g / 65536 );
-          col[pitch * 2] = (FT_Byte)( b / 65536 );
-        }
-      }
-    }
-  }
-
-#endif /* USE_LEGACY */
-
-
   /* documentation in ftlcdfil.h */
 
   FT_EXPORT_DEF( FT_Error )
@@ -297,7 +60,6 @@
       return FT_THROW( Invalid_Argument );
 
     ft_memcpy( library->lcd_weights, weights, FT_LCD_FILTER_FIVE_TAPS );
-    library->lcd_filter_func = ft_lcd_filter_fir;
 
     return FT_Err_Ok;
   }
@@ -321,32 +83,23 @@
     switch ( filter )
     {
     case FT_LCD_FILTER_NONE:
-      library->lcd_filter_func = NULL;
+      ft_memset( library->lcd_weights,
+                 0,
+                 FT_LCD_FILTER_FIVE_TAPS );
       break;
 
     case FT_LCD_FILTER_DEFAULT:
       ft_memcpy( library->lcd_weights,
                  default_weights,
                  FT_LCD_FILTER_FIVE_TAPS );
-      library->lcd_filter_func = ft_lcd_filter_fir;
       break;
 
     case FT_LCD_FILTER_LIGHT:
       ft_memcpy( library->lcd_weights,
                  light_weights,
                  FT_LCD_FILTER_FIVE_TAPS );
-      library->lcd_filter_func = ft_lcd_filter_fir;
       break;
 
-#ifdef USE_LEGACY
-
-    case FT_LCD_FILTER_LEGACY:
-    case FT_LCD_FILTER_LEGACY1:
-      library->lcd_filter_func = _ft_lcd_filter_legacy;
-      break;
-
-#endif
-
     default:
       return FT_THROW( Invalid_Argument );
     }
diff --git a/src/java.desktop/share/native/libfreetype/src/base/ftobjs.c b/src/java.desktop/share/native/libfreetype/src/base/ftobjs.c
index cced4fed06b..323dd5efac2 100644
--- a/src/java.desktop/share/native/libfreetype/src/base/ftobjs.c
+++ b/src/java.desktop/share/native/libfreetype/src/base/ftobjs.c
@@ -524,12 +524,28 @@
     bitmap->rows       = (unsigned int)height;
     bitmap->pitch      = pitch;
 
-    if ( pbox.xMin < -0x8000 || pbox.xMax > 0x7FFF ||
-         pbox.yMin < -0x8000 || pbox.yMax > 0x7FFF )
+    /* Flag the bounding box size unsuitable for rendering. */
+    /* FT_Renderer modules should check the return value.   */
+    /* The limit is based on the ppem value when available. */
     {
-      FT_TRACE3(( "ft_glyphslot_preset_bitmap: [%ld %ld %ld %ld]\n",
-                  pbox.xMin, pbox.yMin, pbox.xMax, pbox.yMax ));
-      return 1;
+      FT_Face  face = slot->face;
+      FT_Pos   xlim = 0x8000;
+      FT_Pos   ylim = 0x8000;
+
+
+      if ( face )
+      {
+        xlim = FT_MIN( xlim, 10 * face->size->metrics.x_ppem );
+        ylim = FT_MIN( ylim, 10 * face->size->metrics.y_ppem );
+      }
+
+      if ( pbox.xMin < -xlim || pbox.xMax >= xlim ||
+           pbox.yMin < -ylim || pbox.yMax >= ylim )
+      {
+        FT_TRACE3(( "ft_glyphslot_preset_bitmap: [%ld %ld %ld %ld]\n",
+                    pbox.xMin, pbox.yMin, pbox.xMax, pbox.yMax ));
+        return 1;
+      }
     }
 
     return 0;
@@ -549,8 +565,7 @@
 
 
   FT_BASE_DEF( FT_Error )
-  ft_glyphslot_alloc_bitmap( FT_GlyphSlot  slot,
-                             FT_ULong      size )
+  ft_glyphslot_alloc_bitmap( FT_GlyphSlot  slot )
   {
     FT_Memory  memory = FT_FACE_MEMORY( slot->face );
     FT_Error   error;
@@ -561,7 +576,10 @@
     else
       slot->internal->flags |= FT_GLYPH_OWN_BITMAP;
 
-    FT_MEM_ALLOC( slot->bitmap.buffer, size );
+    /* dimensions must be preset */
+    FT_MEM_ALLOC_MULT( slot->bitmap.buffer,
+                       slot->bitmap.rows,
+                       slot->bitmap.pitch );
     return error;
   }
 
@@ -1413,7 +1431,10 @@
         if ( ( cur[0]->platform_id == TT_PLATFORM_MICROSOFT &&
                cur[0]->encoding_id == TT_MS_ID_UCS_4        )     ||
              ( cur[0]->platform_id == TT_PLATFORM_APPLE_UNICODE &&
-               cur[0]->encoding_id == TT_APPLE_ID_UNICODE_32    ) )
+               cur[0]->encoding_id == TT_APPLE_ID_UNICODE_32    ) ||
+             ( cur[0]->platform_id == TT_PLATFORM_APPLE_UNICODE &&
+               cur[0]->encoding_id == TT_APPLE_ID_FULL_UNICODE  &&
+               FT_Get_CMap_Format( cur[0] ) == 13               ) )
         {
           face->charmap = cur[0];
           return FT_Err_Ok;
@@ -2798,11 +2819,6 @@
       internal->refcount = 1;
 
       internal->no_stem_darkening = -1;
-
-#ifdef FT_CONFIG_OPTION_SUBPIXEL_RENDERING
-      /* Per-face filtering can only be set up by FT_Face_Properties */
-      internal->lcd_filter_func = NULL;
-#endif
     }
 
     if ( aface )
@@ -4032,18 +4048,8 @@
       }
       else if ( properties->tag == FT_PARAM_TAG_LCD_FILTER_WEIGHTS )
       {
-#ifdef FT_CONFIG_OPTION_SUBPIXEL_RENDERING
-        if ( properties->data )
-        {
-          ft_memcpy( face->internal->lcd_weights,
-                     properties->data,
-                     FT_LCD_FILTER_FIVE_TAPS );
-          face->internal->lcd_filter_func = ft_lcd_filter_fir;
-        }
-#else
         error = FT_THROW( Unimplemented_Feature );
         goto Exit;
-#endif
       }
       else if ( properties->tag == FT_PARAM_TAG_RANDOM_SEED )
       {
diff --git a/src/java.desktop/share/native/libfreetype/src/base/ftutil.c b/src/java.desktop/share/native/libfreetype/src/base/ftutil.c
index 0b7382627c5..f83c4394893 100644
--- a/src/java.desktop/share/native/libfreetype/src/base/ftutil.c
+++ b/src/java.desktop/share/native/libfreetype/src/base/ftutil.c
@@ -424,11 +424,10 @@
     while ( cur )
     {
       FT_ListNode  next = cur->next;
-      void*        data = cur->data;
 
 
       if ( destroy )
-        destroy( memory, data, user );
+        destroy( memory, cur->data, user );
 
       FT_FREE( cur );
       cur = next;
diff --git a/src/java.desktop/share/native/libfreetype/src/cff/cffdrivr.c b/src/java.desktop/share/native/libfreetype/src/cff/cffdrivr.c
index 0079ddd1950..44ff44aecbd 100644
--- a/src/java.desktop/share/native/libfreetype/src/cff/cffdrivr.c
+++ b/src/java.desktop/share/native/libfreetype/src/cff/cffdrivr.c
@@ -456,8 +456,8 @@
                                                          dict->weight );
       font_info->italic_angle        = dict->italic_angle;
       font_info->is_fixed_pitch      = dict->is_fixed_pitch;
-      font_info->underline_position  = (FT_Short)dict->underline_position;
-      font_info->underline_thickness = (FT_UShort)dict->underline_thickness;
+      font_info->underline_position  = dict->underline_position;
+      font_info->underline_thickness = dict->underline_thickness;
 
       cff->font_info = font_info;
     }
diff --git a/src/java.desktop/share/native/libfreetype/src/cff/cffload.c b/src/java.desktop/share/native/libfreetype/src/cff/cffload.c
index 326f885056f..39d662eb434 100644
--- a/src/java.desktop/share/native/libfreetype/src/cff/cffload.c
+++ b/src/java.desktop/share/native/libfreetype/src/cff/cffload.c
@@ -2014,8 +2014,8 @@
     /* set defaults */
     FT_ZERO( top );
 
-    top->underline_position  = -( 100L << 16 );
-    top->underline_thickness = 50L << 16;
+    top->underline_position  = -100;
+    top->underline_thickness = 50;
     top->charstring_type     = 2;
     top->font_matrix.xx      = 0x10000L;
     top->font_matrix.yy      = 0x10000L;
diff --git a/src/java.desktop/share/native/libfreetype/src/cff/cffobjs.c b/src/java.desktop/share/native/libfreetype/src/cff/cffobjs.c
index 1aeb908f4a1..9e00943a95d 100644
--- a/src/java.desktop/share/native/libfreetype/src/cff/cffobjs.c
+++ b/src/java.desktop/share/native/libfreetype/src/cff/cffobjs.c
@@ -846,10 +846,8 @@
           cffface->height = (FT_Short)( cffface->ascender -
                                         cffface->descender );
 
-        cffface->underline_position  =
-          (FT_Short)( dict->underline_position >> 16 );
-        cffface->underline_thickness =
-          (FT_Short)( dict->underline_thickness >> 16 );
+        cffface->underline_position  = (FT_Short)dict->underline_position;
+        cffface->underline_thickness = (FT_Short)dict->underline_thickness;
 
         /* retrieve font family & style name */
         if ( dict->family_name )
diff --git a/src/java.desktop/share/native/libfreetype/src/cff/cfftoken.h b/src/java.desktop/share/native/libfreetype/src/cff/cfftoken.h
index cc5aaa2867a..a7ee1cb3fe7 100644
--- a/src/java.desktop/share/native/libfreetype/src/cff/cfftoken.h
+++ b/src/java.desktop/share/native/libfreetype/src/cff/cfftoken.h
@@ -30,8 +30,8 @@
   CFF_FIELD_STRING  ( 4,     weight,              "Weight" )
   CFF_FIELD_BOOL    ( 0x101, is_fixed_pitch,      "isFixedPitch" )
   CFF_FIELD_FIXED   ( 0x102, italic_angle,        "ItalicAngle" )
-  CFF_FIELD_FIXED   ( 0x103, underline_position,  "UnderlinePosition" )
-  CFF_FIELD_FIXED   ( 0x104, underline_thickness, "UnderlineThickness" )
+  CFF_FIELD_NUM     ( 0x103, underline_position,  "UnderlinePosition" )
+  CFF_FIELD_NUM     ( 0x104, underline_thickness, "UnderlineThickness" )
   CFF_FIELD_NUM     ( 0x105, paint_type,          "PaintType" )
   CFF_FIELD_NUM     ( 0x106, charstring_type,     "CharstringType" )
   CFF_FIELD_CALLBACK( 0x107, font_matrix,         "FontMatrix" )
diff --git a/src/java.desktop/share/native/libfreetype/src/cid/cidtoken.h b/src/java.desktop/share/native/libfreetype/src/cid/cidtoken.h
index 25ba74fed94..d40ebfab86d 100644
--- a/src/java.desktop/share/native/libfreetype/src/cid/cidtoken.h
+++ b/src/java.desktop/share/native/libfreetype/src/cid/cidtoken.h
@@ -47,7 +47,7 @@
   T1_FIELD_STRING( "FullName",           full_name,           0 )
   T1_FIELD_STRING( "FamilyName",         family_name,         0 )
   T1_FIELD_STRING( "Weight",             weight,              0 )
-  T1_FIELD_NUM   ( "ItalicAngle",        italic_angle,        0 )
+  T1_FIELD_FIXED ( "ItalicAngle",        italic_angle,        0 )
   T1_FIELD_BOOL  ( "isFixedPitch",       is_fixed_pitch,      0 )
   T1_FIELD_NUM   ( "UnderlinePosition",  underline_position,  0 )
   T1_FIELD_NUM   ( "UnderlineThickness", underline_thickness, 0 )
diff --git a/src/java.desktop/share/native/libfreetype/src/pshinter/pshalgo.c b/src/java.desktop/share/native/libfreetype/src/pshinter/pshalgo.c
index ca30702321d..e053dba17b2 100644
--- a/src/java.desktop/share/native/libfreetype/src/pshinter/pshalgo.c
+++ b/src/java.desktop/share/native/libfreetype/src/pshinter/pshalgo.c
@@ -35,10 +35,6 @@
 #endif
 
 
-#define  COMPUTE_INFLEXS  /* compute inflection points to optimize `S' */
-                          /* and similar glyphs                        */
-
-
   /*************************************************************************/
   /*************************************************************************/
   /*****                                                               *****/
@@ -920,117 +916,6 @@
 #define  psh_corner_orientation  ft_corner_orientation
 
 
-#ifdef COMPUTE_INFLEXS
-
-  /* compute all inflex points in a given glyph */
-  static void
-  psh_glyph_compute_inflections( PSH_Glyph  glyph )
-  {
-    FT_UInt  n;
-
-
-    for ( n = 0; n < glyph->num_contours; n++ )
-    {
-      PSH_Point  first, start, end, before, after;
-      FT_Pos     in_x, in_y, out_x, out_y;
-      FT_Int     orient_prev, orient_cur;
-      FT_Int     finished = 0;
-
-
-      /* we need at least 4 points to create an inflection point */
-      if ( glyph->contours[n].count < 4 )
-        continue;
-
-      /* compute first segment in contour */
-      first = glyph->contours[n].start;
-
-      start = end = first;
-      do
-      {
-        end = end->next;
-        if ( end == first )
-          goto Skip;
-
-        in_x = end->org_u - start->org_u;
-        in_y = end->org_v - start->org_v;
-
-      } while ( in_x == 0 && in_y == 0 );
-
-      /* extend the segment start whenever possible */
-      before = start;
-      do
-      {
-        do
-        {
-          start  = before;
-          before = before->prev;
-          if ( before == first )
-            goto Skip;
-
-          out_x = start->org_u - before->org_u;
-          out_y = start->org_v - before->org_v;
-
-        } while ( out_x == 0 && out_y == 0 );
-
-        orient_prev = psh_corner_orientation( in_x, in_y, out_x, out_y );
-
-      } while ( orient_prev == 0 );
-
-      first = start;
-      in_x  = out_x;
-      in_y  = out_y;
-
-      /* now, process all segments in the contour */
-      do
-      {
-        /* first, extend current segment's end whenever possible */
-        after = end;
-        do
-        {
-          do
-          {
-            end   = after;
-            after = after->next;
-            if ( after == first )
-              finished = 1;
-
-            out_x = after->org_u - end->org_u;
-            out_y = after->org_v - end->org_v;
-
-          } while ( out_x == 0 && out_y == 0 );
-
-          orient_cur = psh_corner_orientation( in_x, in_y, out_x, out_y );
-
-        } while ( orient_cur == 0 );
-
-        if ( ( orient_cur ^ orient_prev ) < 0 )
-        {
-          do
-          {
-            psh_point_set_inflex( start );
-            start = start->next;
-          }
-          while ( start != end );
-
-          psh_point_set_inflex( start );
-        }
-
-        start       = end;
-        end         = after;
-        orient_prev = orient_cur;
-        in_x        = out_x;
-        in_y        = out_y;
-
-      } while ( !finished );
-
-    Skip:
-      ;
-    }
-  }
-
-#endif /* COMPUTE_INFLEXS */
-
-
   static void
   psh_glyph_done( PSH_Glyph  glyph )
   {
@@ -1258,11 +1143,6 @@
     glyph->outline = outline;
     glyph->globals = globals;
 
-#ifdef COMPUTE_INFLEXS
-    psh_glyph_load_points( glyph, 0 );
-    psh_glyph_compute_inflections( glyph );
-#endif /* COMPUTE_INFLEXS */
-
     /* now deal with hints tables */
     error = psh_hint_table_init( &glyph->hint_tables [0],
                                  &ps_hints->dimension[0].hints,
@@ -1285,122 +1165,47 @@
   }
 
 
-  /* compute all extrema in a glyph for a given dimension */
+  /* compute all extreme and inflection points */
+  /* in a glyph for a given dimension          */
   static void
   psh_glyph_compute_extrema( PSH_Glyph  glyph )
   {
     FT_UInt  n;
 
 
-    /* first of all, compute all local extrema */
     for ( n = 0; n < glyph->num_contours; n++ )
     {
-      PSH_Point  first = glyph->contours[n].start;
-      PSH_Point  point, before, after;
+      PSH_Point  first, point, before, after;
 
 
-      if ( glyph->contours[n].count == 0 )
+      /* we need at least 3 points to create an extremum */
+      if ( glyph->contours[n].count < 3 )
         continue;
 
-      point  = first;
-      before = point;
+      first = glyph->contours[n].start;
+      point = first->prev;
+      after = first;
 
       do
       {
-        before = before->prev;
-        if ( before == first )
-          goto Skip;
-
-      } while ( before->org_u == point->org_u );
-
-      first = point = before->next;
-
-      for (;;)
-      {
-        after = point;
-        do
-        {
-          after = after->next;
-          if ( after == first )
-            goto Next;
-
-        } while ( after->org_u == point->org_u );
-
-        if ( before->org_u < point->org_u )
-        {
-          if ( after->org_u < point->org_u )
-          {
-            /* local maximum */
-            goto Extremum;
-          }
-        }
-        else /* before->org_u > point->org_u */
-        {
-          if ( after->org_u > point->org_u )
-          {
-            /* local minimum */
-          Extremum:
-            do
-            {
-              psh_point_set_extremum( point );
-              point = point->next;
-
-            } while ( point != after );
-          }
-        }
-
-        before = after->prev;
+        before = point;
         point  = after;
+        after  = point->next;
 
-      } /* for  */
+        if ( ( before->org_u < point->org_u && point->org_u < after->org_u ) ||
+             ( before->org_u > point->org_u && point->org_u > after->org_u ) )
+          continue;
 
-    Next:
-      ;
-    }
+        /* otherwise this is either extremum or inflection point */
+        psh_point_set_extremum( point );
 
-    /* for each extremum, determine its direction along the */
-    /* orthogonal axis                                      */
-    for ( n = 0; n < glyph->num_points; n++ )
-    {
-      PSH_Point  point, before, after;
+        /* also note its direction */
+        if ( before->org_v < after->org_v )
+          psh_point_set_positive( point );
+        else if ( before->org_v > after->org_v )
+          psh_point_set_negative( point );
 
-
-      point  = &glyph->points[n];
-      before = point;
-      after  = point;
-
-      if ( psh_point_is_extremum( point ) )
-      {
-        do
-        {
-          before = before->prev;
-          if ( before == point )
-            goto Skip;
-
-        } while ( before->org_v == point->org_v );
-
-        do
-        {
-          after = after->next;
-          if ( after == point )
-            goto Skip;
-
-        } while ( after->org_v == point->org_v );
-      }
-
-      if ( before->org_v < point->org_v &&
-           after->org_v  > point->org_v )
-      {
-        psh_point_set_positive( point );
-      }
-      else if ( before->org_v > point->org_v &&
-                after->org_v  < point->org_v )
-      {
-        psh_point_set_negative( point );
-      }
-
-    Skip:
-      ;
+      } while ( after != first );
     }
   }
 
@@ -1836,8 +1641,7 @@
              point->dir_in != point->dir_out )
           continue;
 
-        if ( !psh_point_is_extremum( point ) &&
-             !psh_point_is_inflex( point )   )
+        if ( !psh_point_is_extremum( point ) )
           continue;
 
         point->flags &= ~PSH_POINT_SMOOTH;
diff --git a/src/java.desktop/share/native/libfreetype/src/pshinter/pshglob.c b/src/java.desktop/share/native/libfreetype/src/pshinter/pshglob.c
index 521a5ff6c5c..a772b66f309 100644
--- a/src/java.desktop/share/native/libfreetype/src/pshinter/pshglob.c
+++ b/src/java.desktop/share/native/libfreetype/src/pshinter/pshglob.c
@@ -376,36 +376,24 @@
     /* not.  We simply need to compare the vertical scale     */
     /* parameter to the raw bluescale value.  Here is why:    */
     /*                                                        */
-    /*   We need to suppress overshoots for all pointsizes.   */
-    /*   At 300dpi that satisfies:                            */
+    /* The specs explain how the bluescale is calculated      */
+    /* from the desired maximum rounded pointsize at 300 dpi  */
+    /* and assuming upem of 1000.                             */
     /*                                                        */
-    /*      pointsize < 240*bluescale + 0.49                  */
+    /*    bluescale = ( pointsize - 0.49 ) / 240              */
     /*                                                        */
-    /*   This corresponds to:                                 */
+    /* For unrounded pointsize in general terms               */
     /*                                                        */
-    /*      pixelsize < 1000*bluescale + 49/24                */
+    /*    bluescale = ( pointsize * dpi / 72 ) / upem         */
     /*                                                        */
-    /*      scale*EM_Size < 1000*bluescale + 49/24            */
+    /* which is                                               */
     /*                                                        */
-    /*   However, for normal Type 1 fonts, EM_Size is 1000!   */
-    /*   We thus only check:                                  */
+    /*    bluescale = pixelsize / upem                        */
     /*                                                        */
-    /*      scale < bluescale + 49/24000                      */
+    /* Therefore, the bluescale value can be used directly    */
+    /* as a scale limit, now that it is in comparable units   */
     /*                                                        */
-    /*   which we shorten to                                  */
-    /*                                                        */
-    /*      "scale < bluescale"                               */
-    /*                                                        */
-    /* Note that `blue_scale' is stored 1000 times its real   */
-    /* value, and that `scale' converts from font units to    */
-    /* fractional pixels.                                     */
-    /*                                                        */
-
-    /* 1000 / 64 = 125 / 8 */
-    if ( scale >= 0x20C49BAL )
-      blues->no_overshoots = FT_BOOL( scale < blues->blue_scale * 8 / 125 );
-    else
-      blues->no_overshoots = FT_BOOL( scale * 125 < blues->blue_scale * 8 );
+    blues->no_overshoots = FT_BOOL( scale < blues->blue_scale );
 
     /*                                                        */
     /*  The blue threshold is the font units distance under   */
@@ -420,8 +408,8 @@
       FT_Int  threshold = blues->blue_shift;
 
 
-      while ( threshold > 0 && FT_MulFix( threshold, scale ) > 32 )
-        threshold--;
+      if ( threshold > 0 && FT_MulFix( threshold, scale ) > 32 )
+        threshold = 32 * 0x10000L / scale;
 
       blues->blue_threshold = threshold;
     }
@@ -708,7 +696,6 @@
 
       /* limit the BlueScale value to `1 / max_of_blue_zone_heights' */
       {
-        FT_Fixed  max_scale;
         FT_Short  max_height = 1;
 
 
@@ -725,11 +712,12 @@
                                           priv->family_other_blues,
                                           max_height );
 
-        /* BlueScale is scaled 1000 times */
-        max_scale = FT_DivFix( 1000, max_height );
-        globals->blues.blue_scale = priv->blue_scale < max_scale
-                                      ? priv->blue_scale
-                                      : max_scale;
+        /* restrict BlueScale value that is amplified 1000-fold and */
+        /* rescale it to be comparable to the metrics scale         */
+        if ( FT_MulFix( max_height, priv->blue_scale ) < 1000 )
+          globals->blues.blue_scale = priv->blue_scale * 8 / 125;
+        else
+          globals->blues.blue_scale = 64 * 0x10000L / max_height;
       }
 
       globals->blues.blue_shift = priv->blue_shift;
diff --git a/src/java.desktop/share/native/libfreetype/src/sfnt/pngshim.c b/src/java.desktop/share/native/libfreetype/src/sfnt/pngshim.c
index 9df75dc3acc..24fb3455598 100644
--- a/src/java.desktop/share/native/libfreetype/src/sfnt/pngshim.c
+++ b/src/java.desktop/share/native/libfreetype/src/sfnt/pngshim.c
@@ -420,10 +420,7 @@
     if ( populate_map_and_metrics )
     {
       /* this doesn't overflow: 0x7FFF * 0x7FFF * 4 < 2^32 */
-      FT_ULong  size = map->rows * (FT_ULong)map->pitch;
-
-
-      error = ft_glyphslot_alloc_bitmap( slot, size );
+      error = ft_glyphslot_alloc_bitmap( slot );
       if ( error )
         goto DestroyExit;
     }
diff --git a/src/java.desktop/share/native/libfreetype/src/sfnt/sfdriver.c b/src/java.desktop/share/native/libfreetype/src/sfnt/sfdriver.c
index ec78247aa56..32291e23e36 100644
--- a/src/java.desktop/share/native/libfreetype/src/sfnt/sfdriver.c
+++ b/src/java.desktop/share/native/libfreetype/src/sfnt/sfdriver.c
@@ -1142,12 +1142,7 @@
     FT_Error         error;
 
 
-    /* XXX: I don't know whether this is correct, since
-     *      tt_face_find_bdf_prop only returns something correct if we have
-     *      previously selected a size that is listed in the BDF table.
-     *      Should we change the BDF table format to include single offsets
-     *      for `CHARSET_REGISTRY' and `CHARSET_ENCODING'?
-     */
+    /* We expect that a bitmap strike has been selected. */
     error = tt_face_find_bdf_prop( face, "CHARSET_REGISTRY", &registry );
     if ( !error )
     {
diff --git a/src/java.desktop/share/native/libfreetype/src/sfnt/sfwoff2.c b/src/java.desktop/share/native/libfreetype/src/sfnt/sfwoff2.c
index 5acbbaa2a77..41c233597b8 100644
--- a/src/java.desktop/share/native/libfreetype/src/sfnt/sfwoff2.c
+++ b/src/java.desktop/share/native/libfreetype/src/sfnt/sfwoff2.c
@@ -1043,7 +1043,6 @@
         FT_ULong   total_n_points = 0;
         FT_UShort  n_points_contour;
         FT_UInt    j;
-        FT_ULong   flag_size;
         FT_ULong   triplet_size;
         FT_ULong   triplet_bytes_used;
         FT_Bool    have_overlap  = FALSE;
@@ -1088,8 +1087,8 @@
         }
         substreams[N_POINTS_STREAM].offset = FT_STREAM_POS();
 
-        flag_size = total_n_points;
-        if ( flag_size > substreams[FLAG_STREAM].size )
+        points_size += total_n_points;
+        if ( points_size > substreams[FLAG_STREAM].size )
           goto Fail;
 
         flags_buf   = stream->base + substreams[FLAG_STREAM].offset;
@@ -1106,8 +1105,7 @@
         triplet_bytes_used = 0;
 
         /* Create array to store point information. */
-        points_size = total_n_points;
-        if ( FT_QNEW_ARRAY( points, points_size ) )
+        if ( FT_QNEW_ARRAY( points, total_n_points ) )
           goto Fail;
 
         if ( triplet_decode( flags_buf,
@@ -1118,7 +1116,7 @@
                              &triplet_bytes_used ) )
           goto Fail;
 
-        substreams[FLAG_STREAM].offset  += flag_size;
+        substreams[FLAG_STREAM].offset  += total_n_points;
         substreams[GLYPH_STREAM].offset += triplet_bytes_used;
 
         if ( FT_STREAM_SEEK( substreams[GLYPH_STREAM].offset ) ||
diff --git a/src/java.desktop/share/native/libfreetype/src/sfnt/ttcolr.c b/src/java.desktop/share/native/libfreetype/src/sfnt/ttcolr.c
index ad9ad6f2710..7929b7aaf4c 100644
--- a/src/java.desktop/share/native/libfreetype/src/sfnt/ttcolr.c
+++ b/src/java.desktop/share/native/libfreetype/src/sfnt/ttcolr.c
@@ -1749,7 +1749,6 @@
     FT_UInt  x, y;
     FT_Byte  b, g, r, alpha;
 
-    FT_ULong  size;
     FT_Byte*  src;
     FT_Byte*  dst;
 
@@ -1767,13 +1766,9 @@
       dstSlot->bitmap.pitch      = (int)dstSlot->bitmap.width * 4;
       dstSlot->bitmap.num_grays  = 256;
 
-      size = dstSlot->bitmap.rows * (unsigned int)dstSlot->bitmap.pitch;
-
-      error = ft_glyphslot_alloc_bitmap( dstSlot, size );
+      error = ft_glyphslot_alloc_bitmap( dstSlot );
       if ( error )
         return error;
-
-      FT_MEM_ZERO( dstSlot->bitmap.buffer, size );
     }
     else
     {
@@ -1805,8 +1800,7 @@
         FT_Byte*  q;
 
 
-        size  = rows * pitch;
-        if ( FT_ALLOC( buf, size ) )
+        if ( FT_ALLOC_MULT( buf, rows, pitch ) )
           return error;
 
         p = dstSlot->bitmap.buffer;
diff --git a/src/java.desktop/share/native/libfreetype/src/sfnt/ttsbit.c b/src/java.desktop/share/native/libfreetype/src/sfnt/ttsbit.c
index 9f9013bf39b..34e45619817 100644
--- a/src/java.desktop/share/native/libfreetype/src/sfnt/ttsbit.c
+++ b/src/java.desktop/share/native/libfreetype/src/sfnt/ttsbit.c
@@ -547,7 +547,6 @@
     FT_Error    error = FT_Err_Ok;
     FT_UInt     width, height;
     FT_Bitmap*  map = decoder->bitmap;
-    FT_ULong    size;
 
 
     if ( !decoder->metrics_loaded )
@@ -599,17 +598,11 @@
       goto Exit;
     }
 
-    size = map->rows * (FT_ULong)map->pitch;
-
-    /* check that there is no empty image */
-    if ( size == 0 )
-      goto Exit;     /* exit successfully! */
-
     if ( metrics_only )
       goto Exit;     /* only metrics are requested */
 
-    error = ft_glyphslot_alloc_bitmap( decoder->face->root.glyph, size );
-    if ( error )
+    error = ft_glyphslot_alloc_bitmap( decoder->face->root.glyph );
+    if ( error || !map->buffer )
       goto Exit;
 
     decoder->bitmap_allocated = 1;
diff --git a/src/java.desktop/share/native/libfreetype/src/smooth/ftgrays.c b/src/java.desktop/share/native/libfreetype/src/smooth/ftgrays.c
index 365fbad42ad..3c387aea0ac 100644
--- a/src/java.desktop/share/native/libfreetype/src/smooth/ftgrays.c
+++ b/src/java.desktop/share/native/libfreetype/src/smooth/ftgrays.c
@@ -1804,7 +1804,7 @@ typedef ptrdiff_t  FT_PtrDist;
           FT_FILL_RULE( coverage, cover, fill );
 
           span[n].coverage = (unsigned char)coverage;
-          span[n].x        = (short)x;
+          span[n].x        = (unsigned short)x;
           span[n].len      = (unsigned short)( cell->x - x );
 
           if ( ++n == FT_MAX_GRAY_SPANS )
@@ -1823,7 +1823,7 @@ typedef ptrdiff_t  FT_PtrDist;
           FT_FILL_RULE( coverage, area, fill );
 
           span[n].coverage = (unsigned char)coverage;
-          span[n].x        = (short)cell->x;
+          span[n].x        = (unsigned short)cell->x;
           span[n].len      = 1;
 
           if ( ++n == FT_MAX_GRAY_SPANS )
diff --git a/src/java.desktop/share/native/libfreetype/src/smooth/ftsmooth.c b/src/java.desktop/share/native/libfreetype/src/smooth/ftsmooth.c
index 21a6eca00ba..5a7a852a619 100644
--- a/src/java.desktop/share/native/libfreetype/src/smooth/ftsmooth.c
+++ b/src/java.desktop/share/native/libfreetype/src/smooth/ftsmooth.c
@@ -80,6 +80,7 @@
   {
     unsigned char*  origin;  /* pixmap origin at the bottom-left */
     int             pitch;   /* pitch to go down one row */
+    unsigned char   wght[5]; /* filtering weights */
 
   } TOrigin;
 
@@ -274,6 +275,32 @@
   }
 
 
+  /* This function applies a horizontal filter in direct rendering mode */
+  static void
+  ft_smooth_lcd_spans( int             y,
+                       int             count,
+                       const FT_Span*  spans,
+                       void*           target_ )   /* TOrigin* */
+  {
+    TOrigin*  target = (TOrigin*)target_;
+
+    unsigned char*  dst_line = target->origin - y * target->pitch - 2;
+    unsigned char*  dst;
+    unsigned short  w;
+
+
+    for ( ; count--; spans++ )
+      for ( dst = dst_line + spans->x, w = spans->len; w--; dst++ )
+      {
+        dst[0] += ( spans->coverage * target->wght[0] + 85 ) >> 8;
+        dst[1] += ( spans->coverage * target->wght[1] + 85 ) >> 8;
+        dst[2] += ( spans->coverage * target->wght[2] + 85 ) >> 8;
+        dst[3] += ( spans->coverage * target->wght[3] + 85 ) >> 8;
+        dst[4] += ( spans->coverage * target->wght[4] + 85 ) >> 8;
+      }
+  }
+
+
   static FT_Error
   ft_smooth_raster_lcd( FT_Renderer  render,
                         FT_Outline*  outline,
@@ -285,11 +312,47 @@
     FT_Vector*  vec;
 
     FT_Raster_Params  params;
+    TOrigin           target;
 
 
-    params.target = bitmap;
-    params.source = outline;
-    params.flags  = FT_RASTER_FLAG_AA;
+    if ( render->root.library->lcd_weights[2] )
+    {
+      /* Reject outlines that are too wide for 16-bit FT_Span.       */
+      /* Other limits are applied upstream with the same error code. */
+      if ( bitmap->width > 0x7FFF )
+        return FT_THROW( Raster_Overflow );
+
+      /* Set up direct rendering for instant filtering. */
+      params.source     = outline;
+      params.flags      = FT_RASTER_FLAG_AA | FT_RASTER_FLAG_DIRECT;
+      params.gray_spans = ft_smooth_lcd_spans;
+      params.user       = &target;
+
+      params.clip_box.xMin = 0;
+      params.clip_box.yMin = 0;
+      params.clip_box.xMax = bitmap->width;
+      params.clip_box.yMax = bitmap->rows;
+
+      if ( bitmap->pitch < 0 )
+        target.origin = bitmap->buffer;
+      else
+        target.origin = bitmap->buffer
+                        + ( bitmap->rows - 1 ) * (unsigned int)bitmap->pitch;
+
+      target.pitch = bitmap->pitch;
+
+      target.wght[0] = render->root.library->lcd_weights[0];
+      target.wght[1] = render->root.library->lcd_weights[1];
+      target.wght[2] = render->root.library->lcd_weights[2];
+      target.wght[3] = render->root.library->lcd_weights[3];
+      target.wght[4] = render->root.library->lcd_weights[4];
+    }
+    else
+    {
+      params.target = bitmap;
+      params.source = outline;
+      params.flags  = FT_RASTER_FLAG_AA;
+    }
 
     /* implode outline */
     for ( vec = points; vec < points_end; vec++ )
@@ -306,6 +369,32 @@
   }
 
 
+  /* This function applies a vertical filter in direct rendering mode */
+  static void
+  ft_smooth_lcdv_spans( int             y,
+                        int             count,
+                        const FT_Span*  spans,
+                        void*           target_ )   /* TOrigin* */
+  {
+    TOrigin*  target = (TOrigin*)target_;
+
+    int             pitch    = target->pitch;
+    unsigned char*  dst_line = target->origin - ( y + 2 ) * pitch;
+    unsigned char*  dst;
+    unsigned short  w;
+
+
+    for ( ; count--; spans++ )
+      for ( dst = dst_line + spans->x, w = spans->len; w--; dst++ )
+      {
+        dst[        0] += ( spans->coverage * target->wght[0] + 85 ) >> 8;
+        dst[    pitch] += ( spans->coverage * target->wght[1] + 85 ) >> 8;
+        dst[2 * pitch] += ( spans->coverage * target->wght[2] + 85 ) >> 8;
+        dst[3 * pitch] += ( spans->coverage * target->wght[3] + 85 ) >> 8;
+        dst[4 * pitch] += ( spans->coverage * target->wght[4] + 85 ) >> 8;
+      }
+  }
+
   static FT_Error
   ft_smooth_raster_lcdv( FT_Renderer  render,
                          FT_Outline*  outline,
@@ -317,11 +406,42 @@
     FT_Vector*  vec;
 
     FT_Raster_Params  params;
+    TOrigin           target;
 
 
-    params.target = bitmap;
-    params.source = outline;
-    params.flags  = FT_RASTER_FLAG_AA;
+    if ( render->root.library->lcd_weights[2] )
+    {
+      /* Set up direct rendering for instant filtering. */
+      params.source     = outline;
+      params.flags      = FT_RASTER_FLAG_AA | FT_RASTER_FLAG_DIRECT;
+      params.gray_spans = ft_smooth_lcdv_spans;
+      params.user       = &target;
+
+      params.clip_box.xMin = 0;
+      params.clip_box.yMin = 0;
+      params.clip_box.xMax = bitmap->width;
+      params.clip_box.yMax = bitmap->rows;
+
+      if ( bitmap->pitch < 0 )
+        target.origin = bitmap->buffer;
+      else
+        target.origin = bitmap->buffer
+                        + ( bitmap->rows - 1 ) * (unsigned int)bitmap->pitch;
+
+      target.pitch = bitmap->pitch;
+
+      target.wght[0] = render->root.library->lcd_weights[0];
+      target.wght[1] = render->root.library->lcd_weights[1];
+      target.wght[2] = render->root.library->lcd_weights[2];
+      target.wght[3] = render->root.library->lcd_weights[3];
+      target.wght[4] = render->root.library->lcd_weights[4];
+    }
+    else
+    {
+      params.target = bitmap;
+      params.source = outline;
+      params.flags  = FT_RASTER_FLAG_AA;
+    }
 
     /* implode outline */
     for ( vec = points; vec < points_end; vec++ )
@@ -494,12 +614,6 @@
     else
       y_shift += 64 * (FT_Int)bitmap->rows;
 
-    if ( origin )
-    {
-      x_shift += origin->x;
-      y_shift += origin->y;
-    }
-
     /* translate outline to render it into the bitmap */
     if ( x_shift || y_shift )
       FT_Outline_Translate( outline, x_shift, y_shift );
@@ -527,33 +641,6 @@
         error = ft_smooth_raster_lcd ( render, outline, bitmap );
       else if ( mode == FT_RENDER_MODE_LCD_V )
         error = ft_smooth_raster_lcdv( render, outline, bitmap );
-
-#ifdef FT_CONFIG_OPTION_SUBPIXEL_RENDERING
-
-      /* finally apply filtering */
-      {
-        FT_Byte*                 lcd_weights;
-        FT_Bitmap_LcdFilterFunc  lcd_filter_func;
-
-
-        /* Per-face LCD filtering takes priority if set up. */
-        if ( slot->face && slot->face->internal->lcd_filter_func )
-        {
-          lcd_weights     = slot->face->internal->lcd_weights;
-          lcd_filter_func = slot->face->internal->lcd_filter_func;
-        }
-        else
-        {
-          lcd_weights     = slot->library->lcd_weights;
-          lcd_filter_func = slot->library->lcd_filter_func;
-        }
-
-        if ( lcd_filter_func )
-          lcd_filter_func( bitmap, lcd_weights );
-      }
-
-#endif /* FT_CONFIG_OPTION_SUBPIXEL_RENDERING */
-
     }
 
   Exit:
diff --git a/src/java.desktop/share/native/libfreetype/src/truetype/ttgload.c b/src/java.desktop/share/native/libfreetype/src/truetype/ttgload.c
index e810ebfd550..4dd68ab1019 100644
--- a/src/java.desktop/share/native/libfreetype/src/truetype/ttgload.c
+++ b/src/java.desktop/share/native/libfreetype/src/truetype/ttgload.c
@@ -2217,6 +2217,10 @@
       exec = size->context;
 
 #ifdef TT_SUPPORT_SUBPIXEL_HINTING_MINIMAL
+      /* reset backward compatibility; note that */
+      /* the CVT program always runs without it  */
+      exec->backward_compatibility = 0;
+
       if ( driver->interpreter_version == TT_INTERPRETER_VERSION_40 )
       {
         grayscale = FALSE;
@@ -2253,9 +2257,7 @@
           return error;
       }
 
-      error = TT_Load_Context( exec, face, size );
-      if ( error )
-        return error;
+      TT_Load_Context( exec, face, size );
 
       /* check whether the cvt program has disabled hinting */
       if ( size->GS.instruct_control & 1 )
@@ -2283,8 +2285,7 @@
            mode != FT_RENDER_MODE_MONO                              &&
            !FT_IS_TRICKY( glyph->face )                             )
         exec->backward_compatibility = ( size->GS.instruct_control & 4 ) ^ 4;
-      else
-        exec->backward_compatibility = 0;
+
 #endif /* TT_SUPPORT_SUBPIXEL_HINTING_MINIMAL */
 
       loader->exec = exec;
diff --git a/src/java.desktop/share/native/libfreetype/src/truetype/ttgxvar.c b/src/java.desktop/share/native/libfreetype/src/truetype/ttgxvar.c
index 0732fcbae36..f8842795f14 100644
--- a/src/java.desktop/share/native/libfreetype/src/truetype/ttgxvar.c
+++ b/src/java.desktop/share/native/libfreetype/src/truetype/ttgxvar.c
@@ -697,11 +697,9 @@
       if ( long_words )
         per_region_size *= 2;
 
-      if ( FT_NEW_ARRAY( varData->deltaSet, per_region_size * item_count ) )
+      if ( FT_QALLOC_MULT( varData->deltaSet, item_count, per_region_size ) )
         goto Exit;
-      if ( FT_Stream_Read( stream,
-                           varData->deltaSet,
-                           per_region_size * item_count ) )
+      if ( FT_STREAM_READ( varData->deltaSet, item_count * per_region_size ) )
       {
         FT_TRACE2(( "deltaSet read failed." ));
         error = FT_THROW( Invalid_Table );
diff --git a/src/java.desktop/share/native/libfreetype/src/truetype/ttinterp.c b/src/java.desktop/share/native/libfreetype/src/truetype/ttinterp.c
index 7b26c9a9df2..f46cc77fe5f 100644
--- a/src/java.desktop/share/native/libfreetype/src/truetype/ttinterp.c
+++ b/src/java.desktop/share/native/libfreetype/src/truetype/ttinterp.c
@@ -272,7 +272,7 @@
    *
    *   Note that not all members of `TT_ExecContext` get initialized.
    */
-  FT_LOCAL_DEF( FT_Error )
+  FT_LOCAL_DEF( void )
   TT_Load_Context( TT_ExecContext  exec,
                    TT_Face         face,
                    TT_Size         size )
@@ -284,7 +284,7 @@
     exec->size = size;
 
     /* CVT and storage are not persistent in FreeType */
-    /* reset them after they might have been modifief */
+    /* reset them after they might have been modified */
     exec->storage = exec->stack   + exec->stackSize;
     exec->cvt     = exec->storage + exec->storeSize;
 
@@ -297,8 +297,6 @@
     exec->metrics    = *size->metrics;
 
     exec->twilight   = size->twilight;
-
-    return FT_Err_Ok;
   }
 
 
@@ -5457,11 +5455,11 @@
     /* single width cut-in test */
 
     /* |org_dist - single_width_value| < single_width_cutin */
-    if ( exc->GS.single_width_cutin > 0          &&
-         org_dist < exc->GS.single_width_value +
-                      exc->GS.single_width_cutin &&
-         org_dist > exc->GS.single_width_value -
-                      exc->GS.single_width_cutin )
+    if ( exc->GS.single_width_cutin > 0                    &&
+         org_dist < ADD_LONG( exc->GS.single_width_value,
+                              exc->GS.single_width_cutin ) &&
+         org_dist > SUB_LONG( exc->GS.single_width_value,
+                              exc->GS.single_width_cutin ) )
     {
       if ( org_dist >= 0 )
         org_dist = exc->GS.single_width_value;
diff --git a/src/java.desktop/share/native/libfreetype/src/truetype/ttinterp.h b/src/java.desktop/share/native/libfreetype/src/truetype/ttinterp.h
index 2e69d191890..5cdc8f59f1a 100644
--- a/src/java.desktop/share/native/libfreetype/src/truetype/ttinterp.h
+++ b/src/java.desktop/share/native/libfreetype/src/truetype/ttinterp.h
@@ -439,7 +439,7 @@ FT_BEGIN_HEADER
   FT_LOCAL( void )
   TT_Done_Context( TT_ExecContext  exec );
 
-  FT_LOCAL( FT_Error )
+  FT_LOCAL( void )
   TT_Load_Context( TT_ExecContext  exec,
                    TT_Face         face,
                    TT_Size         size );
diff --git a/src/java.desktop/share/native/libfreetype/src/truetype/ttobjs.c b/src/java.desktop/share/native/libfreetype/src/truetype/ttobjs.c
index fd0c0ad14f6..2aedbd842c1 100644
--- a/src/java.desktop/share/native/libfreetype/src/truetype/ttobjs.c
+++ b/src/java.desktop/share/native/libfreetype/src/truetype/ttobjs.c
@@ -884,9 +884,7 @@
     FT_Error        error;
 
 
-    error = TT_Load_Context( exec, face, size );
-    if ( error )
-      return error;
+    TT_Load_Context( exec, face, size );
 
     /* disable CVT and glyph programs coderange */
     TT_Clear_CodeRange( exec, tt_coderange_cvt );
@@ -952,9 +950,7 @@
     FT_ARRAY_ZERO( size->twilight.org, size->twilight.n_points );
     FT_ARRAY_ZERO( size->twilight.cur, size->twilight.n_points );
 
-    error = TT_Load_Context( exec, face, size );
-    if ( error )
-      return error;
+    TT_Load_Context( exec, face, size );
 
     /* clear storage area */
     FT_ARRAY_ZERO( exec->storage, exec->storeSize );
@@ -1043,13 +1039,15 @@
     if ( !exec )
       return FT_THROW( Could_Not_Find_Context );
 
+    size->context = exec;
+
     exec->pedantic_hinting = pedantic;
 
     exec->maxFDefs = maxp->maxFunctionDefs;
     exec->maxIDefs = maxp->maxInstructionDefs;
 
     if ( FT_NEW_ARRAY( exec->FDefs, exec->maxFDefs + exec->maxIDefs ) )
-      goto Exit;
+      goto Fail;
 
     exec->IDefs = exec->FDefs + exec->maxFDefs;
 
@@ -1068,7 +1066,7 @@
     if ( FT_NEW_ARRAY( exec->stack,
                        exec->stackSize +
                          (FT_Long)( exec->storeSize + exec->cvtSize ) ) )
-      goto Exit;
+      goto Fail;
 
     /* reserve twilight zone and set GS before fpgm is executed, */
     /* just in case, even though fpgm should not touch them      */
@@ -1079,11 +1077,10 @@
 
     error = tt_glyphzone_new( memory, n_twilight, 0, &size->twilight );
     if ( error )
-      goto Exit;
+      goto Fail;
 
     size->GS        = tt_default_graphics_state;
     size->cvt_ready = -1;
-    size->context   = exec;
 
     size->ttmetrics.rotated   = FALSE;
     size->ttmetrics.stretched = FALSE;
@@ -1099,10 +1096,8 @@
     error = tt_size_run_fpgm( size );
     return error;
 
-  Exit:
-    if ( error )
-      tt_size_done_bytecode( size );
-
+  Fail:
+    tt_size_done_bytecode( size );
     return error;
   }
 
diff --git a/src/java.desktop/share/native/libfreetype/src/type1/t1tokens.h b/src/java.desktop/share/native/libfreetype/src/type1/t1tokens.h
index c3736cd42c0..a526406a411 100644
--- a/src/java.desktop/share/native/libfreetype/src/type1/t1tokens.h
+++ b/src/java.desktop/share/native/libfreetype/src/type1/t1tokens.h
@@ -33,7 +33,7 @@
                    T1_FIELD_DICT_FONTDICT )
 
   /* we use pointers to detect modifications made by synthetic fonts */
-  T1_FIELD_NUM   ( "ItalicAngle",        italic_angle,
+  T1_FIELD_FIXED ( "ItalicAngle",        italic_angle,
                    T1_FIELD_DICT_FONTDICT )
   T1_FIELD_BOOL  ( "isFixedPitch",       is_fixed_pitch,
                    T1_FIELD_DICT_FONTDICT )

From c532dfff5332c27723c7d58cb86a4f8c34dfac1e Mon Sep 17 00:00:00 2001
From: Alexey Semenyuk <asemenyuk@openjdk.org>
Date: Fri, 6 Mar 2026 03:33:16 +0000
Subject: [PATCH 064/655] 8379348: jpackage will use wrong arch suffix for RPM
 bundle when running on Debian Linux

Reviewed-by: almatvee
---
 .../internal/LinuxBundlingEnvironment.java    |  24 ++-
 .../jpackage/internal/LinuxDebPackager.java   |   4 +-
 .../jpackage/internal/LinuxRpmPackager.java   |   4 +-
 .../jpackage/internal/PackageProperty.java    |  87 +++++-----
 .../resources/LinuxResources.properties       |   4 +-
 .../test/JPackageStringBundleTest.java        | 158 ++++++++++++++++++
 .../jdk/jpackage/test/JPackageCommand.java    |  83 ++++++++-
 .../jpackage/test/JPackageStringBundle.java   |  99 ++++++++++-
 .../jdk/jpackage/test/LinuxHelper.java        | 124 +++++++++-----
 .../jdk/jpackage/test/PropertyFinder.java     |  10 +-
 .../cli/OptionsValidationFailTest.excludes    |  12 +-
 .../jpackage/linux/LinuxResourceTest.java     |   9 +-
 test/jdk/tools/jpackage/share/ErrorTest.java  |   6 +-
 .../tools/jpackage/share/InstallDirTest.java  |   5 +-
 14 files changed, 507 insertions(+), 122 deletions(-)
 create mode 100644 test/jdk/tools/jpackage/helpers-test/jdk/jpackage/test/JPackageStringBundleTest.java

diff --git a/src/jdk.jpackage/linux/classes/jdk/jpackage/internal/LinuxBundlingEnvironment.java b/src/jdk.jpackage/linux/classes/jdk/jpackage/internal/LinuxBundlingEnvironment.java
index d6d9def9407..724aeabb4b3 100644
--- a/src/jdk.jpackage/linux/classes/jdk/jpackage/internal/LinuxBundlingEnvironment.java
+++ b/src/jdk.jpackage/linux/classes/jdk/jpackage/internal/LinuxBundlingEnvironment.java
@@ -33,6 +33,7 @@ import static jdk.jpackage.internal.cli.StandardBundlingOperation.CREATE_LINUX_R
 import static jdk.jpackage.internal.util.MemoizingSupplier.runOnce;
 
 import java.util.Map;
+import java.util.Objects;
 import java.util.Optional;
 import java.util.function.Supplier;
 import java.util.stream.Stream;
@@ -41,6 +42,7 @@ import jdk.jpackage.internal.cli.StandardBundlingOperation;
 import jdk.jpackage.internal.model.BundlingOperationDescriptor;
 import jdk.jpackage.internal.model.LinuxPackage;
 import jdk.jpackage.internal.model.PackageType;
+import jdk.jpackage.internal.model.StandardPackageType;
 import jdk.jpackage.internal.util.Result;
 
 public class LinuxBundlingEnvironment extends DefaultBundlingEnvironment {
@@ -55,11 +57,15 @@ public class LinuxBundlingEnvironment extends DefaultBundlingEnvironment {
             });
 
             Supplier<Result<LinuxDebSystemEnvironment>> debSysEnv = () -> {
-                return LinuxDebSystemEnvironment.create(sysEnv.get());
+                return LinuxDebSystemEnvironment.create(sysEnv.get().flatMap(v -> {
+                    return adjustPackageArch(v, StandardPackageType.LINUX_DEB);
+                }));
             };
 
             Supplier<Result<LinuxRpmSystemEnvironment>> rpmSysEnv = () -> {
-                return LinuxRpmSystemEnvironment.create(sysEnv.get());
+                return LinuxRpmSystemEnvironment.create(sysEnv.get().flatMap(v -> {
+                    return adjustPackageArch(v, StandardPackageType.LINUX_RPM);
+                }));
             };
 
             builder.defaultOperation(() -> {
@@ -107,6 +113,20 @@ public class LinuxBundlingEnvironment extends DefaultBundlingEnvironment {
         return new BuildEnvFromOptions().predefinedAppImageLayout(APPLICATION_LAYOUT);
     }
 
+    private static Result<LinuxSystemEnvironment> adjustPackageArch(LinuxSystemEnvironment sysEnv, StandardPackageType type) {
+        Objects.requireNonNull(sysEnv);
+        Objects.requireNonNull(type);
+        if (sysEnv.nativePackageType().equals(type)) {
+            return Result.of(() -> {
+                return sysEnv;
+            });
+        } else {
+            return LinuxPackageArch.create(type).map(arch -> {
+                return new LinuxSystemEnvironment.Stub(sysEnv.soLookupAvailable(), sysEnv.nativePackageType(), arch);
+            });
+        }
+    }
+
     private static final Map<PackageType, BundlingOperationDescriptor> DESCRIPTORS = Stream.of(
             CREATE_LINUX_DEB,
             CREATE_LINUX_RPM
diff --git a/src/jdk.jpackage/linux/classes/jdk/jpackage/internal/LinuxDebPackager.java b/src/jdk.jpackage/linux/classes/jdk/jpackage/internal/LinuxDebPackager.java
index 7c1f06f54a3..d46ec8865c8 100644
--- a/src/jdk.jpackage/linux/classes/jdk/jpackage/internal/LinuxDebPackager.java
+++ b/src/jdk.jpackage/linux/classes/jdk/jpackage/internal/LinuxDebPackager.java
@@ -104,7 +104,7 @@ final class LinuxDebPackager extends LinuxPackager<LinuxDebPackage> {
         List<String> cmdline = new ArrayList<>(List.of(
                 sysEnv.dpkgdeb().toString(), "-f", outputPackageFile().toString()));
 
-        properties.forEach(property -> cmdline.add(property.name));
+        properties.forEach(property -> cmdline.add(property.name()));
 
         Map<String, String> actualValues = Executor.of(cmdline)
                 .saveOutput(true)
@@ -116,7 +116,7 @@ final class LinuxDebPackager extends LinuxPackager<LinuxDebPackage> {
                                 components -> components[1]));
 
         for (var property : properties) {
-            Optional.ofNullable(property.verifyValue(actualValues.get(property.name))).ifPresent(errors::add);
+            Optional.ofNullable(property.verifyValue(actualValues.get(property.name()))).ifPresent(errors::add);
         }
 
         return errors;
diff --git a/src/jdk.jpackage/linux/classes/jdk/jpackage/internal/LinuxRpmPackager.java b/src/jdk.jpackage/linux/classes/jdk/jpackage/internal/LinuxRpmPackager.java
index e22b9c24fdd..8c3e8125e9b 100644
--- a/src/jdk.jpackage/linux/classes/jdk/jpackage/internal/LinuxRpmPackager.java
+++ b/src/jdk.jpackage/linux/classes/jdk/jpackage/internal/LinuxRpmPackager.java
@@ -112,12 +112,12 @@ final class LinuxRpmPackager extends LinuxPackager<LinuxRpmPackage> {
                         "APPLICATION_VERSION", specFileName),
                 new PackageProperty("Release", pkg.release().orElseThrow(),
                         "APPLICATION_RELEASE", specFileName),
-                new PackageProperty("Arch", pkg.arch(), null, specFileName));
+                new PackageProperty("Arch", pkg.arch(), specFileName));
 
         var actualValues = Executor.of(
                 sysEnv.rpm().toString(),
                 "-qp",
-                "--queryformat", properties.stream().map(e -> String.format("%%{%s}", e.name)).collect(joining("\\n")),
+                "--queryformat", properties.stream().map(e -> String.format("%%{%s}", e.name())).collect(joining("\\n")),
                 outputPackageFile().toString()
         ).saveOutput(true).executeExpectSuccess().getOutput();
 
diff --git a/src/jdk.jpackage/linux/classes/jdk/jpackage/internal/PackageProperty.java b/src/jdk.jpackage/linux/classes/jdk/jpackage/internal/PackageProperty.java
index 6b06190f891..e19e45cb5d4 100644
--- a/src/jdk.jpackage/linux/classes/jdk/jpackage/internal/PackageProperty.java
+++ b/src/jdk.jpackage/linux/classes/jdk/jpackage/internal/PackageProperty.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2019, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2019, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,52 +25,61 @@
 
 package jdk.jpackage.internal;
 
-import java.text.MessageFormat;
+import java.util.Objects;
+import java.util.Optional;
 import jdk.jpackage.internal.model.ConfigException;
 
-final class PackageProperty {
-    /**
-     * Constructor
-     *
-     * @param name property name
-     * @param expectedValue expected property value
-     * @param substString substitution string to be placed in resource file to
-     * be replaced with the expected property value by jpackage at package build
-     * time
-     * @param customResource name of custom resource from resource directory in
-     * which this package property can be set
-     */
-    PackageProperty(String name, String expectedValue, String substString,
-            String customResource) {
-        this.name = name;
-        this.expectedValue = expectedValue;
-        this.substString = substString;
-        this.customResource = customResource;
+/**
+ * Linux package property.
+ *
+ * @param name             the property name (e.g.: "Architecture", "Version")
+ * @param expectedValue    the expected value of the property
+ * @param subtrituteString the substitute string in the jpackage resource if
+ *                         applicable (e.g.: "APPLICATION_PACKAGE",
+ *                         "APPLICATION_VERSION")
+ * @param resourceName     the name of the custom resource file from the
+ *                         resource directory in which this package property can
+ *                         be set
+ */
+record PackageProperty(String name, String expectedValue, Optional<String> subtrituteString, String customResource) {
+
+    PackageProperty {
+        Objects.requireNonNull(name);
+        Objects.requireNonNull(expectedValue);
+        Objects.requireNonNull(subtrituteString);
+        Objects.requireNonNull(customResource);
+    }
+
+    PackageProperty(String name, String expectedValue, String subtrituteString, String resourceName) {
+        this(name, expectedValue, Optional.of(subtrituteString), resourceName);
+    }
+
+    PackageProperty(String name, String expectedValue, String resourceName) {
+        this(name, expectedValue, Optional.empty(), resourceName);
+    }
+
+    private String formatErrorMessage(String actualValue) {
+        Objects.requireNonNull(actualValue);
+        return I18N.format("error.unexpected-package-property",
+                name, expectedValue, actualValue, customResource);
+    }
+
+    private String formatAdvice(String actualValue) {
+        Objects.requireNonNull(actualValue);
+        return subtrituteString.map(ss -> {
+            return I18N.format("error.unexpected-package-property.advice", ss, actualValue, name, customResource);
+        }).orElseGet(() -> {
+            return I18N.format("error.unexpected-default-package-property.advice", name, customResource);
+        });
     }
 
     ConfigException verifyValue(String actualValue) {
+        Objects.requireNonNull(actualValue);
+
         if (expectedValue.equals(actualValue)) {
             return null;
         }
 
-        final String advice;
-        if (substString != null) {
-            advice = MessageFormat.format(I18N.getString(
-                    "error.unexpected-package-property.advice"), substString,
-                    actualValue, name, customResource);
-        } else {
-            advice = MessageFormat.format(I18N.getString(
-                    "error.unexpected-default-package-property.advice"), name,
-                    customResource);
-        }
-
-        return new ConfigException(MessageFormat.format(I18N.getString(
-                "error.unexpected-package-property"), name,
-                expectedValue, actualValue, customResource, substString), advice);
+        return new ConfigException(formatErrorMessage(actualValue), formatAdvice(actualValue));
     }
-
-    final String name;
-    private final String expectedValue;
-    private final String substString;
-    private final String customResource;
 }
diff --git a/src/jdk.jpackage/linux/classes/jdk/jpackage/internal/resources/LinuxResources.properties b/src/jdk.jpackage/linux/classes/jdk/jpackage/internal/resources/LinuxResources.properties
index 3aa0e0e92a0..1ab45d26a4c 100644
--- a/src/jdk.jpackage/linux/classes/jdk/jpackage/internal/resources/LinuxResources.properties
+++ b/src/jdk.jpackage/linux/classes/jdk/jpackage/internal/resources/LinuxResources.properties
@@ -58,6 +58,6 @@ message.rpm-ldd-not-available.advice=Install "glibc-common" RPM package to get l
 warning.foreign-app-image=Warning: app-image dir not generated by jpackage.
 message.not-default-bundler-no-dependencies-lookup={0} is not the default package type. Package dependencies will not be generated.
 
-error.unexpected-package-property=Expected value of "{0}" property is [{1}]. Actual value in output package is [{2}]. Looks like custom "{3}" file from resource directory contained hard coded value of "{0}" property
+error.unexpected-package-property=Expected value of "{0}" property is [{1}]. Actual value in output package is [{2}]. Looks like the value of "{0}" property is hardcoded in "{3}" file in the resource directory
 error.unexpected-package-property.advice=Use [{0}] pattern string instead of hard coded value [{1}] of {2} property in custom "{3}" file
-error.unexpected-default-package-property.advice=Don't explicitly set value of {0} property in custom "{1}" file
+error.unexpected-default-package-property.advice=Don''t explicitly set value of "{0}" property in custom "{1}" file
diff --git a/test/jdk/tools/jpackage/helpers-test/jdk/jpackage/test/JPackageStringBundleTest.java b/test/jdk/tools/jpackage/helpers-test/jdk/jpackage/test/JPackageStringBundleTest.java
new file mode 100644
index 00000000000..bf1eb2bdaec
--- /dev/null
+++ b/test/jdk/tools/jpackage/helpers-test/jdk/jpackage/test/JPackageStringBundleTest.java
@@ -0,0 +1,158 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+package jdk.jpackage.test;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertFalse;
+import static org.junit.jupiter.api.Assertions.assertThrowsExactly;
+import static org.junit.jupiter.api.Assertions.assertTrue;
+
+import java.text.MessageFormat;
+import java.util.ArrayList;
+import java.util.Collection;
+import java.util.List;
+import java.util.Objects;
+import java.util.function.Function;
+import java.util.regex.Pattern;
+import java.util.stream.Stream;
+import org.junit.jupiter.api.Test;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
+
+class JPackageStringBundleTest {
+
+    @Test
+    void test_cannedFormattedString() {
+        assertFalse(JPackageStringBundle.MAIN.cannedFormattedString("error.version-string-empty").getValue().isBlank());
+    }
+
+    @Test
+    void test_cannedFormattedStringAsPattern() {
+        var pred = JPackageStringBundle.MAIN.cannedFormattedStringAsPattern("error.version-string-empty", UNREACHABLE_FORMAT_ARG_MAPPER).asMatchPredicate();
+
+        var str = JPackageStringBundle.MAIN.cannedFormattedString("error.version-string-empty").getValue();
+        assertTrue(pred.test(str));
+        assertFalse(pred.test(str + str));
+    }
+
+    @Test
+    void test_cannedFormattedStringAsPattern_with_arg() {
+        var pred = JPackageStringBundle.MAIN.cannedFormattedStringAsPattern("message.error-header", DEFAULT_FORMAT_ARG_MAPPER, "foo").asMatchPredicate();
+
+        for (var err : List.of("foo", "bar", "", "Unexpected value")) {
+            var str = JPackageStringBundle.MAIN.cannedFormattedString("message.error-header", err).getValue();
+            assertTrue(pred.test(str));
+            assertFalse(pred.test(err));
+        }
+    }
+
+    @ParameterizedTest
+    @MethodSource
+    void test_cannedFormattedString_wrong_argument_count(CannedFormattedString cannedStr) {
+        assertThrowsExactly(IllegalArgumentException.class, cannedStr::getValue);
+    }
+
+    @Test
+    void test_cannedFormattedStringAsPattern_wrong_argument_count() {
+        assertThrowsExactly(IllegalArgumentException.class, () -> {
+            JPackageStringBundle.MAIN.cannedFormattedStringAsPattern("error.version-string-empty", UNREACHABLE_FORMAT_ARG_MAPPER, "foo");
+        });
+
+        assertThrowsExactly(IllegalArgumentException.class, () -> {
+            JPackageStringBundle.MAIN.cannedFormattedStringAsPattern("message.error-header", UNREACHABLE_FORMAT_ARG_MAPPER);
+        });
+
+        assertThrowsExactly(IllegalArgumentException.class, () -> {
+            JPackageStringBundle.MAIN.cannedFormattedStringAsPattern("message.error-header", UNREACHABLE_FORMAT_ARG_MAPPER, "foo", "bar");
+        });
+    }
+
+    @ParameterizedTest
+    @MethodSource
+    void test_toPattern(TestSpec test) {
+        var pattern = JPackageStringBundle.toPattern(new MessageFormat(test.formatter()), test.formatArgMapper(), test.args().toArray());
+        assertEquals(test.expectedPattern().toString(), pattern.toString());
+    }
+
+    private static Collection<CannedFormattedString> test_cannedFormattedString_wrong_argument_count() {
+        return List.of(
+                JPackageStringBundle.MAIN.cannedFormattedString("error.version-string-empty", "foo"),
+                JPackageStringBundle.MAIN.cannedFormattedString("message.error-header"),
+                JPackageStringBundle.MAIN.cannedFormattedString("message.error-header", "foo", "bar")
+        );
+    }
+
+    private static Collection<TestSpec> test_toPattern() {
+
+        var testCases = new ArrayList<TestSpec>();
+
+        testCases.addAll(List.of(
+                TestSpec.create("", Pattern.compile("")),
+                TestSpec.create("", Pattern.compile(""), "foo")
+        ));
+
+        for (List<Object> args : List.of(List.<Object>of(), List.<Object>of("foo"))) {
+            Stream.of(
+                    "Stop."
+            ).map(formatter -> {
+                return new TestSpec(formatter, args, Pattern.compile(Pattern.quote(formatter)));
+            }).forEach(testCases::add);
+        }
+
+        testCases.add(TestSpec.create("Hello {1} {0}{1}!", Pattern.compile("\\QHello \\E.*\\Q \\E.*.*\\Q!\\E"), "foo", "bar"));
+        testCases.add(TestSpec.create("Hello {1} {0}{0} {0}{0}{0} {0}", Pattern.compile("\\QHello \\E.*\\Q \\E.*\\Q \\E.*\\Q \\E.*"), "foo", "bar"));
+        testCases.add(TestSpec.create("{0}{0}", Pattern.compile(".*"), "foo"));
+
+        return testCases;
+    }
+
+    record TestSpec(String formatter, List<Object> args, Pattern expectedPattern) {
+        TestSpec {
+            Objects.requireNonNull(formatter);
+            Objects.requireNonNull(args);
+            Objects.requireNonNull(expectedPattern);
+        }
+
+        Function<Object, Pattern> formatArgMapper() {
+            if (Pattern.compile(Pattern.quote(formatter)).toString().equals(expectedPattern.toString())) {
+                return UNREACHABLE_FORMAT_ARG_MAPPER;
+            } else {
+                return DEFAULT_FORMAT_ARG_MAPPER;
+            }
+        }
+
+        static TestSpec create(String formatter, Pattern expectedPattern, Object... args) {
+            return new TestSpec(formatter, List.of(args), expectedPattern);
+        }
+    }
+
+    private static final Pattern DEFAULT_FORMAT_ARG_PATTERN = Pattern.compile(".*");
+
+    private static final Function<Object, Pattern> DEFAULT_FORMAT_ARG_MAPPER = _ -> {
+        return DEFAULT_FORMAT_ARG_PATTERN;
+    };
+
+    private static final Function<Object, Pattern> UNREACHABLE_FORMAT_ARG_MAPPER = _ -> {
+        throw new AssertionError();
+    };
+}
diff --git a/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/JPackageCommand.java b/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/JPackageCommand.java
index 251d95a1089..2e58ea7a0ab 100644
--- a/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/JPackageCommand.java
+++ b/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/JPackageCommand.java
@@ -43,7 +43,6 @@ import java.security.SecureRandom;
 import java.util.ArrayList;
 import java.util.Collection;
 import java.util.Collections;
-import java.util.Iterator;
 import java.util.List;
 import java.util.ListIterator;
 import java.util.Map;
@@ -245,7 +244,12 @@ public class JPackageCommand extends CommandArguments<JPackageCommand> {
     }
 
     public String version() {
-        return getArgumentValue("--app-version", () -> "1.0");
+        return PropertyFinder.findAppProperty(this,
+                PropertyFinder.cmdlineOptionWithValue("--app-version"),
+                PropertyFinder.appImageFile(appImageFile -> {
+                    return appImageFile.version();
+                })
+        ).orElse("1.0");
     }
 
     public String name() {
@@ -1050,6 +1054,10 @@ public class JPackageCommand extends CommandArguments<JPackageCommand> {
 
         final var directoriesAssert = new ReadOnlyPathsAssert(copy);
 
+        standardAssertOutputValidators().forEach(validator -> {
+            validator.applyTo(copy);
+        });
+
         Executor.Result result;
         if (expectedExitCode.isEmpty()) {
             result = copy.createExecutor().executeWithoutExitCodeCheck();
@@ -1064,7 +1072,7 @@ public class JPackageCommand extends CommandArguments<JPackageCommand> {
             ConfigFilesStasher.INSTANCE.accept(this);
         }
 
-        for (final var validator: validators) {
+        for (final var validator: copy.validators) {
             validator.accept(result);
         }
 
@@ -1375,10 +1383,38 @@ public class JPackageCommand extends CommandArguments<JPackageCommand> {
                 TKit.assertFileExists(cmd.appLayout().libapplauncher());
             }
         }),
+        LINUX_PACKAGE_ARCH(cmd -> {
+            if (TKit.isLinux() && !cmd.isImagePackageType()) {
+                var asserter = TKit.assertTextStream(LinuxUnexpectedBundleArchRegexp.VALUE).negate();
+                return Stream.of(true, false).map(stderr -> {
+                    var validator = new JPackageOutputValidator();
+                    if (stderr) {
+                        return validator.stderr();
+                    } else {
+                        return validator;
+                    }
+                }).map(validator -> {
+                    return validator.add(asserter);
+                }).toList();
+            } else {
+                return List.of();
+            }
+        }),
         ;
 
-        StandardAssert(Consumer<JPackageCommand> action) {
+        StandardAssert(
+                Consumer<JPackageCommand> action,
+                Function<JPackageCommand, Collection<JPackageOutputValidator>> outputValidatorsSupplier) {
             this.action = action;
+            this.outputValidatorsSupplier = outputValidatorsSupplier;
+        }
+
+        StandardAssert(Consumer<JPackageCommand> action) {
+            this(Objects.requireNonNull(action), null);
+        }
+
+        StandardAssert(Function<JPackageCommand, Collection<JPackageOutputValidator>> outputValidatorsSupplier) {
+            this(null, Objects.requireNonNull(outputValidatorsSupplier));
         }
 
         private static JPackageCommand convertFromRuntime(JPackageCommand cmd) {
@@ -1390,7 +1426,38 @@ public class JPackageCommand extends CommandArguments<JPackageCommand> {
             return copy;
         }
 
+        Stream<JPackageOutputValidator> outputValidators(JPackageCommand cmd) {
+            Objects.requireNonNull(cmd);
+            return Optional.ofNullable(outputValidatorsSupplier).map(v -> {
+                return v.apply(cmd);
+            }).stream().flatMap(Collection::stream);
+        }
+
+        void apply(JPackageCommand cmd) {
+            Objects.requireNonNull(cmd);
+            if (action != null) {
+                action.accept(cmd);
+            }
+        }
+
         private final Consumer<JPackageCommand> action;
+        private final Function<JPackageCommand, Collection<JPackageOutputValidator>> outputValidatorsSupplier;
+
+        private static final class LinuxUnexpectedBundleArchRegexp {
+            private static final Pattern ANY = Pattern.compile(".*");
+            private static final Pattern ARCHITECTURE_PROPERTY = Pattern.compile("Arch|Architecture");
+
+            static final Pattern VALUE = JPackageStringBundle.MAIN.cannedFormattedStringAsPattern("error.unexpected-package-property", arg -> {
+                return switch ((String)arg) {
+                    case "propertyName" -> {
+                        yield ARCHITECTURE_PROPERTY;
+                    }
+                    default -> {
+                        yield ANY;
+                    }
+                };
+            }, "propertyName", "expectedValue", "actualValue", "customResource");
+        }
     }
 
     public JPackageCommand setStandardAsserts(StandardAssert ... asserts) {
@@ -1407,11 +1474,17 @@ public class JPackageCommand extends CommandArguments<JPackageCommand> {
 
     JPackageCommand runStandardAsserts() {
         for (var standardAssert : standardAsserts.stream().sorted().toList()) {
-            standardAssert.action.accept(this);
+            standardAssert.apply(this);
         }
         return this;
     }
 
+    private List<JPackageOutputValidator> standardAssertOutputValidators() {
+        return standardAsserts.stream().sorted().flatMap(standardAssert -> {
+            return standardAssert.outputValidators(this);
+        }).toList();
+    }
+
     private boolean expectAppImageFile() {
         if (isRuntime()) {
             return false;
diff --git a/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/JPackageStringBundle.java b/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/JPackageStringBundle.java
index 9425b84472c..cd8ffd853b7 100644
--- a/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/JPackageStringBundle.java
+++ b/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/JPackageStringBundle.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2024, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2024, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,10 +23,16 @@
 
 package jdk.jpackage.test;
 
+import static jdk.jpackage.internal.util.function.ExceptionBox.toUnchecked;
+
 import java.lang.reflect.InvocationTargetException;
 import java.lang.reflect.Method;
 import java.text.MessageFormat;
-import static jdk.jpackage.internal.util.function.ExceptionBox.toUnchecked;
+import java.util.List;
+import java.util.Objects;
+import java.util.Optional;
+import java.util.function.Function;
+import java.util.regex.Pattern;
 
 public enum JPackageStringBundle {
 
@@ -56,18 +62,95 @@ public enum JPackageStringBundle {
     }
 
     private String getFormattedString(String key, Object[] args) {
-        var str = getString(key);
-        if (args.length != 0) {
-            return MessageFormat.format(str, args);
-        } else {
-            return str;
-        }
+        return new FormattedMessage(key, args).value();
     }
 
     public CannedFormattedString cannedFormattedString(String key, Object ... args) {
         return new CannedFormattedString(this::getFormattedString, key, args);
     }
 
+    public Pattern cannedFormattedStringAsPattern(String key, Function<Object, Pattern> formatArgMapper, Object ... args) {
+        var fm = new FormattedMessage(key, args);
+        return fm.messageFormat().map(mf -> {
+            return toPattern(mf, formatArgMapper, args);
+        }).orElseGet(() -> {
+            return Pattern.compile(Pattern.quote(fm.value()));
+        });
+    }
+
+    static Pattern toPattern(MessageFormat mf, Function<Object, Pattern> formatArgMapper, Object ... args) {
+        Objects.requireNonNull(mf);
+        Objects.requireNonNull(formatArgMapper);
+
+        var patternSb = new StringBuilder();
+        var runSb = new StringBuilder();
+
+        var it = mf.formatToCharacterIterator(args);
+        while (it.getIndex() < it.getEndIndex()) {
+            var runBegin = it.getRunStart();
+            var runEnd = it.getRunLimit();
+            if (runEnd < runBegin) {
+                throw new IllegalStateException();
+            }
+
+            var attrs = it.getAttributes();
+            if (attrs.isEmpty()) {
+                // Regular text run.
+                runSb.setLength(0);
+                it.setIndex(runBegin);
+                for (int counter = runEnd - runBegin; counter != 0; --counter) {
+                    runSb.append(it.current());
+                    it.next();
+                }
+                patternSb.append(Pattern.quote(runSb.toString()));
+            } else {
+                // Format run.
+                int argi = (Integer)attrs.get(MessageFormat.Field.ARGUMENT);
+                var arg = args[argi];
+                var pattern = Objects.requireNonNull(formatArgMapper.apply(arg));
+                patternSb.append(pattern.toString());
+                it.setIndex(runEnd);
+            }
+        }
+
+        return Pattern.compile(patternSb.toString());
+    }
+
+    private final class FormattedMessage {
+
+        FormattedMessage(String key, Object[] args) {
+            List.of(args).forEach(Objects::requireNonNull);
+
+            var formatter = getString(key);
+
+            var mf = new MessageFormat(formatter);
+            var formatCount = mf.getFormatsByArgumentIndex().length;
+            if (formatCount != args.length) {
+                throw new IllegalArgumentException(String.format(
+                        "Expected %d arguments for [%s] string, but given %d", formatCount, key, args.length));
+            }
+
+            if (formatCount == 0) {
+                this.mf = null;
+                value = formatter;
+            } else {
+                this.mf = mf;
+                value = mf.format(args);
+            }
+        }
+
+        String value() {
+            return value;
+        }
+
+        Optional<MessageFormat> messageFormat() {
+            return Optional.ofNullable(mf);
+        }
+
+        private final String value;
+        private final MessageFormat mf;
+    }
+
     private final Class<?> i18nClass;
     private final Method i18nClass_getString;
 }
diff --git a/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/LinuxHelper.java b/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/LinuxHelper.java
index 78562b2ed26..66462bedfd7 100644
--- a/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/LinuxHelper.java
+++ b/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/LinuxHelper.java
@@ -26,6 +26,7 @@ import static java.util.Collections.unmodifiableSortedSet;
 import static java.util.stream.Collectors.joining;
 import static java.util.stream.Collectors.toMap;
 import static java.util.stream.Collectors.toSet;
+import static jdk.jpackage.internal.util.MemoizingSupplier.runOnce;
 
 import java.io.IOException;
 import java.io.UncheckedIOException;
@@ -36,7 +37,6 @@ import java.nio.file.Path;
 import java.util.ArrayList;
 import java.util.Arrays;
 import java.util.Collection;
-import java.util.HashMap;
 import java.util.List;
 import java.util.Map;
 import java.util.Objects;
@@ -46,35 +46,34 @@ import java.util.TreeMap;
 import java.util.TreeSet;
 import java.util.function.Function;
 import java.util.function.Predicate;
+import java.util.function.Supplier;
 import java.util.regex.Matcher;
 import java.util.regex.Pattern;
 import java.util.stream.Stream;
+import jdk.internal.util.Architecture;
 import jdk.jpackage.internal.util.PathUtils;
+import jdk.jpackage.internal.util.Result;
 import jdk.jpackage.internal.util.function.ThrowingConsumer;
 import jdk.jpackage.test.LauncherShortcut.InvokeShortcutSpec;
 import jdk.jpackage.test.PackageTest.PackageHandlers;
 
 
 public final class LinuxHelper {
-    private static String getReleaseSuffix(JPackageCommand cmd) {
-        final String value;
-        final PackageType packageType = cmd.packageType();
-        switch (packageType) {
-            case LINUX_DEB:
-                value = Optional.ofNullable(cmd.getArgumentValue(
-                        "--linux-app-release", () -> null)).map(v -> "-" + v).orElse(
-                        "");
-                break;
 
-            case LINUX_RPM:
-                value = "-" + cmd.getArgumentValue("--linux-app-release",
-                        () -> "1");
-                break;
-
-            default:
-                value = null;
+    static String getReleaseSuffix(JPackageCommand cmd) {
+        cmd.verifyIsOfType(PackageType.LINUX);
+        var release = Optional.ofNullable(cmd.getArgumentValue("--linux-app-release"));
+        switch (cmd.packageType()) {
+            case LINUX_DEB -> {
+                return release.map(v -> "-" + v).orElse("");
+            }
+            case LINUX_RPM -> {
+                return "-" + release.orElse("1");
+            }
+            default -> {
+                throw new UnsupportedOperationException();
+            }
         }
-        return value;
     }
 
     public static String getPackageName(JPackageCommand cmd) {
@@ -333,10 +332,14 @@ public final class LinuxHelper {
         long packageSize = getInstalledPackageSizeKB(cmd);
         TKit.trace("InstalledPackageSize: " + packageSize);
         TKit.assertNotEquals(0, packageSize, String.format(
-                "Check installed size of [%s] package in not zero", packageName));
+                "Check installed size of [%s] package is not zero", packageName));
 
         final boolean checkPrerequisites;
-        if (cmd.isRuntime()) {
+        if (NativePackageType.VALUE != cmd.packageType()) {
+            // Alien packaging (DEB packaging on RPM Linux or RPM packaging on Debian).
+            // Don't validate required packages.
+            checkPrerequisites = false;
+        } else if (cmd.isRuntime()) {
             Path runtimeDir = cmd.appRuntimeDirectory();
             Set<Path> expectedCriticalRuntimePaths = CRITICAL_RUNTIME_FILES.stream().map(
                     runtimeDir::resolve).collect(toSet());
@@ -850,29 +853,7 @@ public final class LinuxHelper {
     }
 
     public static String getDefaultPackageArch(PackageType type) {
-        if (archs == null) {
-            archs = new HashMap<>();
-        }
-
-        String arch = archs.get(type);
-        if (arch == null) {
-            final Executor exec;
-            switch (type) {
-                case LINUX_DEB:
-                    exec = Executor.of("dpkg", "--print-architecture");
-                    break;
-
-                case LINUX_RPM:
-                    exec = Executor.of("rpmbuild", "--eval=%{_target_cpu}");
-                    break;
-
-                default:
-                    throw new UnsupportedOperationException();
-            }
-            arch = exec.executeAndGetFirstLineOfOutput();
-            archs.put(type, arch);
-        }
-        return arch;
+        return LinuxPackageArchitecture.get(type);
     }
 
     private static String getServiceUnitFileName(String packageName, String launcherName) {
@@ -960,7 +941,62 @@ public final class LinuxHelper {
     static final Set<Path> CRITICAL_RUNTIME_FILES = Set.of(Path.of(
             "lib/server/libjvm.so"));
 
-    private static Map<PackageType, String> archs;
+    private enum LinuxPackageArchitecture implements Supplier<String> {
+        RPM("rpmbuild", "--eval=%{_target_cpu}"),
+        DEB("dpkg", "--print-architecture"),
+        ;
+
+        LinuxPackageArchitecture(String... cmdline) {
+            this.cmdline = List.of(cmdline);
+        }
+
+        static String get(PackageType type) {
+            Objects.requireNonNull(type);
+            if (type.isSupported()) {
+                return ARCHS.get(type).get();
+            } else {
+                return Architecture.current().name().toLowerCase();
+            }
+        }
+
+        @Override
+        public String get() {
+            return Executor.of(cmdline).executeAndGetFirstLineOfOutput();
+        }
+
+        private final List<String> cmdline;
+
+        private static final Map<PackageType, Supplier<String>> ARCHS = Map.of(
+                PackageType.LINUX_RPM, runOnce(RPM),
+                PackageType.LINUX_DEB, runOnce(DEB));
+    }
+
+    private static final class NativePackageType {
+
+        static final PackageType VALUE;
+
+        private static boolean isDebian() {
+            // we are just going to run "dpkg -s coreutils" and assume Debian
+            // or derivative if no error is returned.
+            return Result.of(Executor.of("dpkg", "-s", "coreutils")::execute).hasValue();
+        }
+
+        private static boolean isRpm() {
+            // we are just going to run "rpm -q rpm" and assume RPM
+            // or derivative if no error is returned.
+            return Result.of(Executor.of("rpm", "-q", "rpm")::execute).hasValue();
+        }
+
+        static {
+            if (isDebian()) {
+                VALUE = PackageType.LINUX_DEB;
+            } else if (isRpm()) {
+                VALUE = PackageType.LINUX_RPM;
+            } else {
+                VALUE = null;
+            }
+        }
+    }
 
     private static final Pattern XDG_CMD_ICON_SIZE_PATTERN = Pattern.compile("\\s--size\\s+(\\d+)\\b");
 
diff --git a/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/PropertyFinder.java b/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/PropertyFinder.java
index 3d7ac490350..46425ceccbd 100644
--- a/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/PropertyFinder.java
+++ b/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/PropertyFinder.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2019, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2019, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -21,6 +21,7 @@
  * questions.
  */
 package jdk.jpackage.test;
+
 import static jdk.jpackage.test.AdditionalLauncher.getAdditionalLauncherProperties;
 
 import java.nio.file.Path;
@@ -66,8 +67,13 @@ final class PropertyFinder {
     }
 
     static <T> Finder<T> nop() {
+        return of(Optional.empty());
+    }
+
+    static <T> Finder<T> of(Optional<String> v) {
+        Objects.requireNonNull(v);
         return target -> {
-            return Optional.empty();
+            return v;
         };
     }
 
diff --git a/test/jdk/tools/jpackage/junit/share/jdk.jpackage/jdk/jpackage/internal/cli/OptionsValidationFailTest.excludes b/test/jdk/tools/jpackage/junit/share/jdk.jpackage/jdk/jpackage/internal/cli/OptionsValidationFailTest.excludes
index f86fb9a3897..32968db0606 100644
--- a/test/jdk/tools/jpackage/junit/share/jdk.jpackage/jdk/jpackage/internal/cli/OptionsValidationFailTest.excludes
+++ b/test/jdk/tools/jpackage/junit/share/jdk.jpackage/jdk/jpackage/internal/cli/OptionsValidationFailTest.excludes
@@ -28,16 +28,16 @@ ErrorTest.test(NATIVE; args-add=[--runtime-image, @@EMPTY_DIR@@]; errors=[messag
 ErrorTest.test(NATIVE; args-add=[--runtime-image, @@INVALID_MAC_RUNTIME_BUNDLE@@]; errors=[message.error-header+[error.invalid-runtime-image-missing-file, @@INVALID_MAC_RUNTIME_BUNDLE@@, Contents/Home/lib/**/libjli.dylib]])
 ErrorTest.test(NATIVE; args-add=[--runtime-image, @@INVALID_MAC_RUNTIME_IMAGE@@]; errors=[message.error-header+[error.invalid-runtime-image-missing-file, @@INVALID_MAC_RUNTIME_IMAGE@@, lib/**/libjli.dylib]])
 ErrorTest.test(WIN_EXE; app-desc=Hello; args-add=[--app-version, 1.2.3.4.5]; errors=[message.error-header+[error.msi-product-version-components, 1.2.3.4.5], message.advice-header+[error.version-string-wrong-format.advice]])
-ErrorTest.test(WIN_EXE; app-desc=Hello; args-add=[--app-version, 1.2.65536]; errors=[message.error-header+[error.msi-product-version-build-out-of-range, 1.2.65536], message.advice-header+[error.version-string-wrong-format.advice]])
-ErrorTest.test(WIN_EXE; app-desc=Hello; args-add=[--app-version, 1.256]; errors=[message.error-header+[error.msi-product-version-minor-out-of-range, 1.256], message.advice-header+[error.version-string-wrong-format.advice]])
+ErrorTest.test(WIN_EXE; app-desc=Hello; args-add=[--app-version, 1.2.65536]; errors=[message.error-header+[error.msi-product-version-build-out-of-range], message.advice-header+[error.version-string-wrong-format.advice]])
+ErrorTest.test(WIN_EXE; app-desc=Hello; args-add=[--app-version, 1.256]; errors=[message.error-header+[error.msi-product-version-minor-out-of-range], message.advice-header+[error.version-string-wrong-format.advice]])
 ErrorTest.test(WIN_EXE; app-desc=Hello; args-add=[--app-version, 1234]; errors=[message.error-header+[error.msi-product-version-components, 1234], message.advice-header+[error.version-string-wrong-format.advice]])
-ErrorTest.test(WIN_EXE; app-desc=Hello; args-add=[--app-version, 256.1]; errors=[message.error-header+[error.msi-product-version-major-out-of-range, 256.1], message.advice-header+[error.version-string-wrong-format.advice]])
+ErrorTest.test(WIN_EXE; app-desc=Hello; args-add=[--app-version, 256.1]; errors=[message.error-header+[error.msi-product-version-major-out-of-range], message.advice-header+[error.version-string-wrong-format.advice]])
 ErrorTest.test(WIN_EXE; app-desc=Hello; args-add=[--launcher-as-service]; errors=[message.error-header+[error.missing-service-installer], message.advice-header+[error.missing-service-installer.advice]])
 ErrorTest.test(WIN_MSI; app-desc=Hello; args-add=[--app-version, 1.2.3.4.5]; errors=[message.error-header+[error.msi-product-version-components, 1.2.3.4.5], message.advice-header+[error.version-string-wrong-format.advice]])
-ErrorTest.test(WIN_MSI; app-desc=Hello; args-add=[--app-version, 1.2.65536]; errors=[message.error-header+[error.msi-product-version-build-out-of-range, 1.2.65536], message.advice-header+[error.version-string-wrong-format.advice]])
-ErrorTest.test(WIN_MSI; app-desc=Hello; args-add=[--app-version, 1.256]; errors=[message.error-header+[error.msi-product-version-minor-out-of-range, 1.256], message.advice-header+[error.version-string-wrong-format.advice]])
+ErrorTest.test(WIN_MSI; app-desc=Hello; args-add=[--app-version, 1.2.65536]; errors=[message.error-header+[error.msi-product-version-build-out-of-range], message.advice-header+[error.version-string-wrong-format.advice]])
+ErrorTest.test(WIN_MSI; app-desc=Hello; args-add=[--app-version, 1.256]; errors=[message.error-header+[error.msi-product-version-minor-out-of-range], message.advice-header+[error.version-string-wrong-format.advice]])
 ErrorTest.test(WIN_MSI; app-desc=Hello; args-add=[--app-version, 1234]; errors=[message.error-header+[error.msi-product-version-components, 1234], message.advice-header+[error.version-string-wrong-format.advice]])
-ErrorTest.test(WIN_MSI; app-desc=Hello; args-add=[--app-version, 256.1]; errors=[message.error-header+[error.msi-product-version-major-out-of-range, 256.1], message.advice-header+[error.version-string-wrong-format.advice]])
+ErrorTest.test(WIN_MSI; app-desc=Hello; args-add=[--app-version, 256.1]; errors=[message.error-header+[error.msi-product-version-major-out-of-range], message.advice-header+[error.version-string-wrong-format.advice]])
 ErrorTest.test(WIN_MSI; app-desc=Hello; args-add=[--launcher-as-service]; errors=[message.error-header+[error.missing-service-installer], message.advice-header+[error.missing-service-installer.advice]])
 ErrorTest.test(args-add=[@foo]; errors=[message.error-header+[ERR_CannotParseOptions, foo]])
 ErrorTest.testMacSignWithoutIdentity(IMAGE; app-desc=Hello; args-add=[--mac-sign, --mac-signing-keychain, @@EMPTY_KEYCHAIN@@]; errors=[message.error-header+[error.cert.not.found, CODE_SIGN, EMPTY_KEYCHAIN]])
diff --git a/test/jdk/tools/jpackage/linux/LinuxResourceTest.java b/test/jdk/tools/jpackage/linux/LinuxResourceTest.java
index b82706fc2c2..503c4db77fb 100644
--- a/test/jdk/tools/jpackage/linux/LinuxResourceTest.java
+++ b/test/jdk/tools/jpackage/linux/LinuxResourceTest.java
@@ -30,6 +30,7 @@ import java.util.Objects;
 import jdk.jpackage.test.Annotations.Test;
 import jdk.jpackage.test.CannedFormattedString;
 import jdk.jpackage.test.JPackageCommand;
+import jdk.jpackage.test.JPackageCommand.StandardAssert;
 import jdk.jpackage.test.JPackageOutputValidator;
 import jdk.jpackage.test.LinuxHelper;
 import jdk.jpackage.test.PackageTest;
@@ -66,7 +67,7 @@ public class LinuxResourceTest {
 
             final var packageProp = property("Package", "dont-install-me");
             final var verProp = property("Version", "1.2.3-R2");
-            final var arhProp = property("Architecture", "bar");
+            final var archProp = property("Architecture", "bar");
 
             TKit.createTextFile(controlFile, List.of(
                     packageProp.format(),
@@ -74,13 +75,15 @@ public class LinuxResourceTest {
                     "Section: APPLICATION_SECTION",
                     "Maintainer: APPLICATION_MAINTAINER",
                     "Priority: optional",
-                    arhProp.format(),
+                    archProp.format(),
                     "Provides: dont-install-me",
                     "Description: APPLICATION_DESCRIPTION",
                     "Installed-Size: APPLICATION_INSTALLED_SIZE",
                     "Depends: PACKAGE_DEFAULT_DEPENDENCIES"
             ));
 
+            cmd.excludeStandardAsserts(StandardAssert.LINUX_PACKAGE_ARCH);
+
             new JPackageOutputValidator()
                     .expectMatchingStrings(MAIN.cannedFormattedString(
                             "message.using-custom-resource",
@@ -92,7 +95,7 @@ public class LinuxResourceTest {
 
             packageProp.expectedValue(LinuxHelper.getPackageName(cmd)).token("APPLICATION_PACKAGE").resourceDirFile(controlFile).validateOutput(cmd);
             verProp.expectedValue(cmd.version()).token("APPLICATION_VERSION_WITH_RELEASE").resourceDirFile(controlFile).validateOutput(cmd);
-            arhProp.expectedValue(LinuxHelper.getDefaultPackageArch(cmd.packageType())).token("APPLICATION_ARCH").resourceDirFile(controlFile).validateOutput(cmd);
+            archProp.expectedValue(LinuxHelper.getDefaultPackageArch(cmd.packageType())).token("APPLICATION_ARCH").resourceDirFile(controlFile).validateOutput(cmd);
         })
         .forTypes(PackageType.LINUX_RPM)
         .addInitializer(cmd -> {
diff --git a/test/jdk/tools/jpackage/share/ErrorTest.java b/test/jdk/tools/jpackage/share/ErrorTest.java
index 8bc7ba2521f..b325c02f039 100644
--- a/test/jdk/tools/jpackage/share/ErrorTest.java
+++ b/test/jdk/tools/jpackage/share/ErrorTest.java
@@ -945,13 +945,13 @@ public final class ErrorTest {
                             .error("error.msi-product-version-components", "1.2.3.4.5")
                             .advice("error.version-string-wrong-format.advice"),
                     testSpec().type(type).addArgs("--app-version", "256.1")
-                            .error("error.msi-product-version-major-out-of-range", "256.1")
+                            .error("error.msi-product-version-major-out-of-range")
                             .advice("error.version-string-wrong-format.advice"),
                     testSpec().type(type).addArgs("--app-version", "1.256")
-                            .error("error.msi-product-version-minor-out-of-range", "1.256")
+                            .error("error.msi-product-version-minor-out-of-range")
                             .advice("error.version-string-wrong-format.advice"),
                     testSpec().type(type).addArgs("--app-version", "1.2.65536")
-                            .error("error.msi-product-version-build-out-of-range", "1.2.65536")
+                            .error("error.msi-product-version-build-out-of-range")
                             .advice("error.version-string-wrong-format.advice")
             );
         }).flatMap(x -> x).map(TestSpec.Builder::create).toList());
diff --git a/test/jdk/tools/jpackage/share/InstallDirTest.java b/test/jdk/tools/jpackage/share/InstallDirTest.java
index 81d1fb3556e..4d5c1979190 100644
--- a/test/jdk/tools/jpackage/share/InstallDirTest.java
+++ b/test/jdk/tools/jpackage/share/InstallDirTest.java
@@ -102,10 +102,7 @@ public class InstallDirTest {
         .forTypes(PackageType.LINUX)
         .addInitializer(cmd -> {
             cmd.addArguments("--install-dir", installDir);
-            cmd.saveConsoleOutput(true);
-        })
-        .addBundleVerifier((cmd, result) -> {
-            cmd.validateErr(JPackageCommand.makeError("error.invalid-install-dir"));
+            cmd.validateErr(JPackageCommand.makeError("error.invalid-install-dir", installDir));
         })
         .run();
     }

From ad0f078669505686a9f294000bfe7f8bc1611a37 Mon Sep 17 00:00:00 2001
From: Alexey Semenyuk <asemenyuk@openjdk.org>
Date: Fri, 6 Mar 2026 03:51:59 +0000
Subject: [PATCH 065/655] 8379341: jpackage: consolidate modular app tests

Reviewed-by: almatvee
---
 .../tools/jpackage/share/ModularAppTest.java  | 336 ++++++++++++++++++
 .../tools/jpackage/share/ModulePathTest.java  | 144 --------
 .../tools/jpackage/share/ModulePathTest2.java |  74 ----
 .../tools/jpackage/share/ModulePathTest3.java | 130 -------
 .../jpackage/share/NoMPathRuntimeTest.java    | 133 -------
 5 files changed, 336 insertions(+), 481 deletions(-)
 create mode 100644 test/jdk/tools/jpackage/share/ModularAppTest.java
 delete mode 100644 test/jdk/tools/jpackage/share/ModulePathTest.java
 delete mode 100644 test/jdk/tools/jpackage/share/ModulePathTest2.java
 delete mode 100644 test/jdk/tools/jpackage/share/ModulePathTest3.java
 delete mode 100644 test/jdk/tools/jpackage/share/NoMPathRuntimeTest.java

diff --git a/test/jdk/tools/jpackage/share/ModularAppTest.java b/test/jdk/tools/jpackage/share/ModularAppTest.java
new file mode 100644
index 00000000000..b14d70cc8f3
--- /dev/null
+++ b/test/jdk/tools/jpackage/share/ModularAppTest.java
@@ -0,0 +1,336 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+
+import static jdk.jpackage.internal.util.MemoizingSupplier.runOnce;
+
+import java.io.IOException;
+import java.nio.file.Files;
+import java.nio.file.Path;
+import java.util.ArrayList;
+import java.util.Collection;
+import java.util.List;
+import java.util.Objects;
+import java.util.Optional;
+import java.util.stream.Stream;
+import javax.xml.xpath.XPathExpressionException;
+import jdk.internal.util.OperatingSystem;
+import jdk.jpackage.internal.util.MacBundle;
+import jdk.jpackage.internal.util.Slot;
+import jdk.jpackage.internal.util.TokenReplace;
+import jdk.jpackage.test.Annotations.Parameter;
+import jdk.jpackage.test.Annotations.ParameterSupplier;
+import jdk.jpackage.test.Annotations.Test;
+import jdk.jpackage.test.CannedFormattedString;
+import jdk.jpackage.test.Executor;
+import jdk.jpackage.test.HelloApp;
+import jdk.jpackage.test.JPackageCommand;
+import jdk.jpackage.test.JavaAppDesc;
+import jdk.jpackage.test.JavaTool;
+import jdk.jpackage.test.PackageType;
+import jdk.jpackage.test.TKit;
+
+
+/*
+ * @test
+ * @summary jpackage bundling modular app
+ * @library /test/jdk/tools/jpackage/helpers
+ * @build jdk.jpackage.test.*
+ * @compile -Xlint:all -Werror ModularAppTest.java
+ * @run main/othervm/timeout=360 -Xmx512m jdk.jpackage.test.Main
+ *  --jpt-run=ModularAppTest
+ */
+
+public final class ModularAppTest {
+
+    @Test
+    @ParameterSupplier
+    public void test(TestSpec spec) {
+        spec.run();
+    }
+
+    /**
+     * Test case for JDK-8233265. Adding modules in .jmod files for non-modular app
+     * results in unexpected jpackage failure.
+     */
+    @Test
+    @Parameter("Hello!")
+    @Parameter("com.foo/com.foo.ModuleApp")
+    public void test8233265(String mainAppDesc) throws IOException {
+        JPackageCommand cmd = JPackageCommand.helloAppImage(mainAppDesc);
+
+        // The test should make jpackage invoke jlink.
+        cmd.ignoreDefaultRuntime(true);
+
+        var modulePath = Optional.ofNullable(cmd.getArgumentValue("--module-path")).map(Path::of).orElseGet(() -> {
+            var newModulePath = TKit.createTempDirectory("input-modules");
+            cmd.addArguments("--module-path", newModulePath);
+            return newModulePath;
+        });
+
+        JavaAppDesc extraModule = JavaAppDesc.parse("x.jmod:com.x/com.x.Y");
+        HelloApp.createBundle(extraModule, modulePath);
+        cmd.addArguments("--add-modules", extraModule.moduleName());
+
+        cmd.executeAndAssertHelloAppImageCreated();
+    }
+
+    /**
+     * Test case for JDK-8248254. App's module in the predefined runtime directory;
+     * no "--module-path" option on the command line. jpackage should find the app's
+     * module in the predefined runtime.
+     */
+    @Test
+    @Parameter("IMAGE")
+    @Parameter(value = "MAC_BUNDLE", ifOS = OperatingSystem.MACOS)
+    public void test8248254(RuntimeType runtimeType) throws XPathExpressionException, IOException {
+
+        final var appDesc = JavaAppDesc.parse("me.mymodule/me.mymodule.Main");
+
+        new JPackageCommand()
+                .setDefaultAppName()
+                .setPackageType(PackageType.IMAGE)
+                .setDefaultInputOutput()
+                .removeArgumentWithValue("--input")
+                .addArguments("--module", appDesc.moduleName() + "/" + appDesc.className())
+                .setArgumentValue("--runtime-image", bakeModuleInRuntime(appDesc, runtimeType))
+                .executeAndAssertHelloAppImageCreated();
+    }
+
+    /**
+     * Test case for JDK-8261518. App's module is baked into the predefined runtime
+     * image with jlink; no "--module-path" option on the command line. If there is
+     * a non-modular jar in the current directory, jpackage used to throw.
+     */
+    @Test
+    @Parameter("IMAGE")
+    @Parameter(value = "MAC_BUNDLE", ifOS = OperatingSystem.MACOS)
+    public void test8261518(RuntimeType runtimeType) throws XPathExpressionException, IOException {
+
+        final var appDesc = JavaAppDesc.parse("com.foo/com.foo.main.Aloha");
+
+        final var fooJarDir = TKit.createTempDirectory("foo");
+
+        // Create "foo.jar" in dedicated directory.
+        HelloApp.createBundle(JavaAppDesc.parse("foo.jar:"), fooJarDir);
+
+        new JPackageCommand()
+                .setDefaultAppName()
+                .setPackageType(PackageType.IMAGE)
+                .setDefaultInputOutput()
+                .removeArgumentWithValue("--input")
+                .addArguments("--module", appDesc.moduleName() + "/" + appDesc.className())
+                .setArgumentValue("--runtime-image", bakeModuleInRuntime(appDesc, runtimeType).toAbsolutePath())
+                // Run jpackage in the directory with "foo.jar"
+                .setDirectory(fooJarDir).useToolProvider(false)
+                .executeAndAssertHelloAppImageCreated();
+    }
+
+    private static Path bakeModuleInRuntime(JavaAppDesc appDesc, RuntimeType runtimeType) throws IOException {
+
+        final var moduleOutputDir = TKit.createTempDirectory("modules");
+        HelloApp.createBundle(appDesc, moduleOutputDir);
+
+        final var workDir = TKit.createTempDirectory("runtime").resolve("data");
+        final Path jlinkOutputDir;
+        switch (runtimeType) {
+            case IMAGE -> {
+                jlinkOutputDir = workDir;
+            }
+            case MAC_BUNDLE -> {
+                var macBundle = new MacBundle(workDir);
+
+                // Create macOS bundle structure sufficient to pass jpackage validation.
+                Files.createDirectories(macBundle.homeDir().getParent());
+                Files.createDirectories(macBundle.macOsDir());
+                Files.createFile(macBundle.infoPlistFile());
+                jlinkOutputDir = macBundle.homeDir();
+            }
+            default -> {
+                throw new AssertionError();
+            }
+        }
+
+        // List of modules required for the test app.
+        final var modules = new String[] {
+            "java.base",
+            "java.desktop",
+            appDesc.moduleName()
+        };
+
+        new Executor()
+        .setToolProvider(JavaTool.JLINK)
+        .dumpOutput()
+        .addArguments(
+                "--add-modules", String.join(",", modules),
+                "--output", jlinkOutputDir.toString(),
+                "--module-path", moduleOutputDir.resolve(appDesc.jarFileName()).toString(),
+                "--strip-debug",
+                "--no-header-files",
+                "--no-man-pages",
+                "--strip-native-commands")
+        .execute();
+
+        return workDir;
+    }
+
+    enum RuntimeType {
+        IMAGE,
+        MAC_BUNDLE,
+        ;
+    }
+
+    record TestSpec(List<String> paths, String appDesc) {
+        TestSpec {
+            Objects.requireNonNull(paths);
+            Objects.requireNonNull(appDesc);
+            Objects.requireNonNull(JavaAppDesc.parse(appDesc).moduleName());
+        }
+
+        boolean isWithGoodPath() {
+            var isWithGoodPath = Slot.<Boolean>createEmpty();
+            paths.forEach(path -> {
+                ALL_TOKENS.applyTo(path, token -> {
+                    if (token.equals(Token.GOOD_DIR.token())) {
+                        isWithGoodPath.set(true);
+                    }
+                    return token;
+                });
+            });
+            return isWithGoodPath.find().isPresent();
+        }
+
+        void run() {
+            var emptyDir = runOnce(() -> {
+                return TKit.createTempDirectory("empty-dir");
+            });
+
+            var nonExistingDir = runOnce(() -> {
+                return TKit.withTempDirectory("non-existing-dir", x -> {});
+            });
+
+            var goodDir = runOnce(() -> {
+                return TKit.createTempDirectory("modules");
+            });
+
+            var theAppDesc = JavaAppDesc.parse(appDesc);
+
+            HelloApp.createBundle(theAppDesc, goodDir.get());
+
+            var cmd = new JPackageCommand()
+                    .setArgumentValue("--dest", TKit.workDir().resolve("output"))
+                    .setDefaultAppName()
+                    .setPackageType(PackageType.IMAGE)
+                    // Ignore runtime that can be set for all tests. Usually if default
+                    // runtime is set, it is fake one to save time on running jlink and
+                    // copying megabytes of data from Java home to application image.
+                    // We need proper runtime for this test.
+                    .ignoreDefaultRuntime(true)
+                    .addArguments("--module", String.join("/", theAppDesc.moduleName(), theAppDesc.className()));
+
+            if (TKit.isWindows()) {
+                cmd.addArguments("--win-console");
+            }
+
+            paths.stream().map(path -> {
+                return ALL_TOKENS.applyTo(path, token -> {
+                    return (switch (Token.valueOf(token.substring(2, token.length() - 2))) {
+                        case EMPTY_DIR -> {
+                            yield emptyDir;
+                        }
+                        case GOOD_DIR -> {
+                            yield goodDir;
+                        }
+                        case NON_EXISTING_DIR -> {
+                            yield nonExistingDir;
+                        }
+                        default -> {
+                            throw new AssertionError();
+                        }
+                    }).get();
+                });
+            }).<String>mapMulti((path, acc) -> {
+                acc.accept("--module-path");
+                acc.accept(path);
+            }).forEach(cmd::addArgument);
+
+            if (isWithGoodPath()) {
+                cmd.executeAndAssertHelloAppImageCreated();
+            } else {
+                final CannedFormattedString expectedErrorMessage;
+                if (paths.isEmpty()) {
+                    expectedErrorMessage = JPackageCommand.makeError(
+                            "ERR_MissingArgument2", "--runtime-image", "--module-path");
+                } else {
+                    expectedErrorMessage = JPackageCommand.makeError(
+                            "error.no-module-in-path", theAppDesc.moduleName());
+                }
+
+                cmd.validateErr(expectedErrorMessage).execute(1);
+            }
+        }
+
+        private static final TokenReplace ALL_TOKENS =
+                new TokenReplace(Stream.of(Token.values()).map(Token::token).toArray(String[]::new));
+    }
+
+    public static Collection<?> test() {
+
+        var testCases = new ArrayList<TestSpec>();
+
+        for (String appDesc : List.of(
+                "benvenuto.jar:com.jar.foo/com.jar.foo.Hello",
+                "benvenuto.jmod:com.jmod.foo/com.jmod.foo.JModHello"
+        )) {
+            Stream.<Stream<String>>of(
+                    Stream.<Token>of(Token.GOOD_DIR, Token.EMPTY_DIR, Token.NON_EXISTING_DIR).map(Token::token),
+                    Stream.<Token>of(Token.EMPTY_DIR, Token.NON_EXISTING_DIR, Token.GOOD_DIR).map(Token::token),
+                    Stream.<String>of(Token.GOOD_DIR.token() + "/a/b/c/d", Token.GOOD_DIR.token()),
+                    Stream.<String>of(),
+                    Stream.<Token>of(Token.EMPTY_DIR).map(Token::token)
+            ).map(Stream::toList).map(paths -> {
+                return new TestSpec(paths, appDesc);
+            }).forEach(testCases::add);
+        }
+
+        return testCases.stream().map(v -> {
+            return new Object[] {v};
+        }).toList();
+    }
+
+    enum Token {
+        GOOD_DIR,
+        EMPTY_DIR,
+        NON_EXISTING_DIR,
+        ;
+
+        String token() {
+            return makeToken(name());
+        }
+
+        private static String makeToken(String v) {
+            Objects.requireNonNull(v);
+            return String.format("@@%s@@", v);
+        }
+    }
+}
diff --git a/test/jdk/tools/jpackage/share/ModulePathTest.java b/test/jdk/tools/jpackage/share/ModulePathTest.java
deleted file mode 100644
index 583dd1eb0c4..00000000000
--- a/test/jdk/tools/jpackage/share/ModulePathTest.java
+++ /dev/null
@@ -1,144 +0,0 @@
-/*
- * Copyright (c) 2019, 2026, Oracle and/or its affiliates. All rights reserved.
- * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
- *
- * This code is free software; you can redistribute it and/or modify it
- * under the terms of the GNU General Public License version 2 only, as
- * published by the Free Software Foundation.
- *
- * This code is distributed in the hope that it will be useful, but WITHOUT
- * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
- * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
- * version 2 for more details (a copy is included in the LICENSE file that
- * accompanied this code).
- *
- * You should have received a copy of the GNU General Public License version
- * 2 along with this work; if not, write to the Free Software Foundation,
- * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
- *
- * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
- * or visit www.oracle.com if you need additional information or have any
- * questions.
- */
-
-
-import java.io.File;
-import java.io.IOException;
-import java.nio.file.Path;
-import java.util.Collection;
-import java.util.List;
-import java.util.function.Function;
-import java.util.stream.Collectors;
-import java.util.stream.Stream;
-import jdk.jpackage.test.CannedFormattedString;
-import jdk.jpackage.test.TKit;
-import jdk.jpackage.test.JavaAppDesc;
-import jdk.jpackage.test.HelloApp;
-import jdk.jpackage.test.JPackageCommand;
-import jdk.jpackage.test.JPackageStringBundle;
-import jdk.jpackage.test.PackageType;
-import jdk.jpackage.test.Annotations.Parameter;
-import jdk.jpackage.test.Annotations.Parameters;
-import jdk.jpackage.test.Annotations.Test;
-
-
-/*
- * @test
- * @summary jpackage with --module-path testing
- * @library /test/jdk/tools/jpackage/helpers
- * @build jdk.jpackage.test.*
- * @compile -Xlint:all -Werror ModulePathTest.java
- * @run main/othervm/timeout=360 -Xmx512m jdk.jpackage.test.Main
- *  --jpt-run=ModulePathTest
- */
-
-public final class ModulePathTest {
-
-    @Parameters
-    public static Collection<?> data() {
-        return List.of(new String[][]{
-            {GOOD_PATH, EMPTY_DIR, NON_EXISTING_DIR},
-            {EMPTY_DIR, NON_EXISTING_DIR, GOOD_PATH},
-            {GOOD_PATH + "/a/b/c/d", GOOD_PATH},
-            {String.join(File.pathSeparator, EMPTY_DIR, NON_EXISTING_DIR,
-                GOOD_PATH)},
-            {String.join(File.pathSeparator, EMPTY_DIR, NON_EXISTING_DIR),
-                String.join(File.pathSeparator, EMPTY_DIR, NON_EXISTING_DIR,
-                GOOD_PATH)},
-            {},
-            {EMPTY_DIR}
-        });
-    }
-
-    public ModulePathTest(String... modulePathArgs) {
-        this.modulePathArgs = List.of(modulePathArgs);
-    }
-
-    @Test
-    @Parameter("benvenuto.jar:com.jar.foo/com.jar.foo.Hello")
-    @Parameter("benvenuto.jmod:com.jmod.foo/com.jmod.foo.JModHello")
-    public void test(String javaAppDesc) throws IOException {
-        JavaAppDesc appDesc = JavaAppDesc.parse(javaAppDesc);
-
-        Path goodModulePath = TKit.createTempDirectory("modules");
-
-        HelloApp.createBundle(appDesc, goodModulePath);
-
-        JPackageCommand cmd = new JPackageCommand()
-                .setArgumentValue("--dest", TKit.workDir().resolve("output"))
-                .setDefaultAppName()
-                .setPackageType(PackageType.IMAGE);
-
-        if (TKit.isWindows()) {
-            cmd.addArguments("--win-console");
-        }
-
-        cmd.addArguments("--module", String.join("/", appDesc.moduleName(),
-                appDesc.className()));
-
-        // Ignore runtime that can be set for all tests. Usually if default
-        // runtime is set, it is fake one to save time on running jlink and
-        // copying megabytes of data from Java home to application image.
-        // We need proper runtime for this test.
-        cmd.ignoreDefaultRuntime(true);
-
-        Path emptyDir = TKit.createTempDirectory("empty-dir");
-        Path nonExistingDir = TKit.withTempDirectory("non-existing-dir", x -> {});
-
-        Function<String, String> substitute = str -> {
-            String v = str;
-            v = v.replace(GOOD_PATH, goodModulePath.toString());
-            v = v.replace(EMPTY_DIR, emptyDir.toString());
-            v = v.replace(NON_EXISTING_DIR, nonExistingDir.toString());
-            return v;
-        };
-
-        boolean withGoodPath = modulePathArgs.stream().anyMatch(
-                s -> s.contains(GOOD_PATH));
-
-        cmd.addArguments(modulePathArgs.stream().map(arg -> Stream.of(
-                "--module-path", substitute.apply(arg))).flatMap(s -> s).collect(
-                Collectors.toList()));
-
-        if (withGoodPath) {
-            cmd.executeAndAssertHelloAppImageCreated();
-        } else {
-            final CannedFormattedString expectedErrorMessage;
-            if (modulePathArgs.isEmpty()) {
-                expectedErrorMessage = JPackageCommand.makeError(
-                        "ERR_MissingArgument2", "--runtime-image", "--module-path");
-            } else {
-                expectedErrorMessage = JPackageCommand.makeError(
-                        "error.no-module-in-path", appDesc.moduleName());
-            }
-
-            cmd.validateErr(expectedErrorMessage).execute(1);
-        }
-    }
-
-    private final List<String> modulePathArgs;
-
-    private static final String GOOD_PATH = "@GoodPath@";
-    private static final String EMPTY_DIR = "@EmptyDir@";
-    private static final String NON_EXISTING_DIR = "@NonExistingDir@";
-}
diff --git a/test/jdk/tools/jpackage/share/ModulePathTest2.java b/test/jdk/tools/jpackage/share/ModulePathTest2.java
deleted file mode 100644
index b2cc674e7e9..00000000000
--- a/test/jdk/tools/jpackage/share/ModulePathTest2.java
+++ /dev/null
@@ -1,74 +0,0 @@
-/*
- * Copyright (c) 2019, 2025, Oracle and/or its affiliates. All rights reserved.
- * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
- *
- * This code is free software; you can redistribute it and/or modify it
- * under the terms of the GNU General Public License version 2 only, as
- * published by the Free Software Foundation.
- *
- * This code is distributed in the hope that it will be useful, but WITHOUT
- * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
- * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
- * version 2 for more details (a copy is included in the LICENSE file that
- * accompanied this code).
- *
- * You should have received a copy of the GNU General Public License version
- * 2 along with this work; if not, write to the Free Software Foundation,
- * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
- *
- * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
- * or visit www.oracle.com if you need additional information or have any
- * questions.
- */
-
-
-import java.io.IOException;
-import java.nio.file.Path;
-import jdk.jpackage.test.HelloApp;
-import jdk.jpackage.test.JavaAppDesc;
-import jdk.jpackage.test.Annotations.Test;
-import jdk.jpackage.test.Annotations.Parameter;
-import jdk.jpackage.test.JPackageCommand;
-import jdk.jpackage.test.TKit;
-
-
-/*
- * @test
- * @summary jpackage with --module-path testing
- * @library /test/jdk/tools/jpackage/helpers
- * @build jdk.jpackage.test.*
- * @compile -Xlint:all -Werror ModulePathTest2.java
- * @run main/othervm/timeout=360 -Xmx512m jdk.jpackage.test.Main
- *  --jpt-run=ModulePathTest2
- */
-
-public final class ModulePathTest2 {
-
-    /**
-     * Test case for JDK-8233265.
-     * Adding modules in .jmod files for non-modular app results in unexpected
-     * jpackage failure.
-     * @param mainAppDesc
-     */
-    @Test
-    @Parameter("Hello!")
-    @Parameter("com.foo/com.foo.ModuleApp")
-    public void test8233265(String mainAppDesc) throws IOException {
-        JPackageCommand cmd = JPackageCommand.helloAppImage(mainAppDesc);
-
-        // The test should make jpackage invoke jlink.
-        cmd.ignoreDefaultRuntime(true);
-
-        Path modulePath = cmd.getArgumentValue("--module-path", () -> null, Path::of);
-        if (modulePath == null) {
-            modulePath = TKit.createTempDirectory("input-modules");
-            cmd.addArguments("--module-path", modulePath);
-        }
-
-        JavaAppDesc extraModule = JavaAppDesc.parse("x.jmod:com.x/com.x.Y");
-        HelloApp.createBundle(extraModule, modulePath);
-        cmd.addArguments("--add-modules", extraModule.moduleName());
-
-        cmd.executeAndAssertHelloAppImageCreated();
-    }
-}
diff --git a/test/jdk/tools/jpackage/share/ModulePathTest3.java b/test/jdk/tools/jpackage/share/ModulePathTest3.java
deleted file mode 100644
index c3960c0d4c8..00000000000
--- a/test/jdk/tools/jpackage/share/ModulePathTest3.java
+++ /dev/null
@@ -1,130 +0,0 @@
-/*
- * Copyright (c) 2020, 2025, Oracle and/or its affiliates. All rights reserved.
- * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
- *
- * This code is free software; you can redistribute it and/or modify it
- * under the terms of the GNU General Public License version 2 only, as
- * published by the Free Software Foundation.
- *
- * This code is distributed in the hope that it will be useful, but WITHOUT
- * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
- * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
- * version 2 for more details (a copy is included in the LICENSE file that
- * accompanied this code).
- *
- * You should have received a copy of the GNU General Public License version
- * 2 along with this work; if not, write to the Free Software Foundation,
- * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
- *
- * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
- * or visit www.oracle.com if you need additional information or have any
- * questions.
- */
-
-
-import java.io.IOException;
-import java.nio.file.Files;
-import java.nio.file.Path;
-import java.util.ArrayList;
-import java.util.Collection;
-import java.util.List;
-import javax.xml.xpath.XPathExpressionException;
-import jdk.jpackage.test.AppImageFile;
-import jdk.jpackage.test.HelloApp;
-import jdk.jpackage.test.JavaAppDesc;
-import jdk.jpackage.test.Annotations.Test;
-import jdk.jpackage.test.Annotations.Parameters;
-import jdk.jpackage.test.Executor;
-import jdk.jpackage.test.JPackageCommand;
-import jdk.jpackage.test.JavaTool;
-import jdk.jpackage.test.PackageType;
-import jdk.jpackage.test.TKit;
-
-
-/*
- * @test
- * @summary jpackage for app's module linked in external runtime
- * @library /test/jdk/tools/jpackage/helpers
- * @build jdk.jpackage.test.*
- * @compile -Xlint:all -Werror ModulePathTest3.java
- * @run main/othervm/timeout=360 -Xmx512m jdk.jpackage.test.Main
- *  --jpt-run=ModulePathTest3
- */
-
-public final class ModulePathTest3 {
-
-    public ModulePathTest3(String jlinkOutputSubdir, String runtimeSubdir) {
-        this.jlinkOutputSubdir = Path.of(jlinkOutputSubdir);
-        this.runtimeSubdir = Path.of(runtimeSubdir);
-    }
-
-    /**
-     * Test case for JDK-8248254.
-     * App's module in runtime directory.
-     */
-    @Test
-    public void test8248254() throws XPathExpressionException, IOException {
-        testIt("me.mymodule/me.mymodule.Main");
-    }
-
-    private void testIt(String mainAppDesc) throws XPathExpressionException,
-            IOException {
-        final JavaAppDesc appDesc = JavaAppDesc.parse(mainAppDesc);
-        final Path moduleOutputDir = TKit.createTempDirectory("modules");
-        HelloApp.createBundle(appDesc, moduleOutputDir);
-
-        final Path workDir = TKit.createTempDirectory("runtime").resolve("data");
-        final Path jlinkOutputDir = workDir.resolve(jlinkOutputSubdir);
-        Files.createDirectories(jlinkOutputDir.getParent());
-
-        new Executor()
-        .setToolProvider(JavaTool.JLINK)
-        .dumpOutput()
-        .addArguments(
-                "--add-modules", appDesc.moduleName(),
-                "--output", jlinkOutputDir.toString(),
-                "--module-path", moduleOutputDir.resolve(appDesc.jarFileName()).toString(),
-                "--strip-debug",
-                "--no-header-files",
-                "--no-man-pages",
-                "--strip-native-commands")
-        .execute();
-
-        JPackageCommand cmd = new JPackageCommand()
-        .setDefaultAppName()
-        .setPackageType(PackageType.IMAGE)
-        .setDefaultInputOutput()
-        .removeArgumentWithValue("--input")
-        .addArguments("--module", appDesc.moduleName() + "/" + appDesc.className())
-        .setArgumentValue("--runtime-image", workDir.resolve(runtimeSubdir));
-
-        cmd.executeAndAssertHelloAppImageCreated();
-
-        if (appDesc.moduleVersion() != null) {
-            String actualVersion = AppImageFile.load(cmd.outputBundle()).version();
-            TKit.assertEquals(appDesc.moduleVersion(), actualVersion,
-                    "Check application version");
-        }
-    }
-
-    @Parameters
-    public static Collection<?> data() {
-        final List<String[]> paths = new ArrayList<>();
-        paths.add(new String[] { "", "" });
-        if (TKit.isOSX()) {
-            // On OSX jpackage should accept both runtime root and runtime home
-            // directories.
-            paths.add(new String[] { "Contents/Home", "" });
-        }
-
-        List<Object[]> data = new ArrayList<>();
-        for (var pathCfg : paths) {
-            data.add(new Object[] { pathCfg[0], pathCfg[1] });
-        }
-
-        return data;
-    }
-
-    private final Path jlinkOutputSubdir;
-    private final Path runtimeSubdir;
-}
diff --git a/test/jdk/tools/jpackage/share/NoMPathRuntimeTest.java b/test/jdk/tools/jpackage/share/NoMPathRuntimeTest.java
deleted file mode 100644
index 91679945925..00000000000
--- a/test/jdk/tools/jpackage/share/NoMPathRuntimeTest.java
+++ /dev/null
@@ -1,133 +0,0 @@
-/*
- * Copyright (c) 2020, 2025, Oracle and/or its affiliates. All rights reserved.
- * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
- *
- * This code is free software; you can redistribute it and/or modify it
- * under the terms of the GNU General Public License version 2 only, as
- * published by the Free Software Foundation.
- *
- * This code is distributed in the hope that it will be useful, but WITHOUT
- * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
- * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
- * version 2 for more details (a copy is included in the LICENSE file that
- * accompanied this code).
- *
- * You should have received a copy of the GNU General Public License version
- * 2 along with this work; if not, write to the Free Software Foundation,
- * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
- *
- * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
- * or visit www.oracle.com if you need additional information or have any
- * questions.
- */
-
-
-import java.io.IOException;
-import java.nio.file.Files;
-import java.util.Collection;
-import java.util.ArrayList;
-import java.util.List;
-import java.nio.file.Path;
-import jdk.jpackage.test.Annotations.Parameters;
-import jdk.jpackage.test.Annotations.Test;
-import jdk.jpackage.test.Executor;
-import jdk.jpackage.test.JPackageCommand;
-import jdk.jpackage.test.JavaAppDesc;
-import jdk.jpackage.test.JavaTool;
-import jdk.jpackage.test.TKit;
-import jdk.jpackage.test.HelloApp;
-
-
-/*
- * @test
- * @summary test '--runtime-image' option of jpackage
- * @library /test/jdk/tools/jpackage/helpers
- * @build jdk.jpackage.test.*
- * @compile -Xlint:all -Werror NoMPathRuntimeTest.java
- * @run main/othervm/timeout=360 -Xmx512m jdk.jpackage.test.Main
- *  --jpt-run=NoMPathRuntimeTest
- */
-
-public final class NoMPathRuntimeTest {
-
-    public NoMPathRuntimeTest(String jlinkOutputSubdir, String runtimeSubdir) {
-        this.jlinkOutputSubdir = Path.of(jlinkOutputSubdir);
-        this.runtimeSubdir = Path.of(runtimeSubdir);
-    }
-
-    @Test
-    public void test() throws IOException {
-        JavaAppDesc appDesc = JavaAppDesc.parse("com.foo/com.foo.main.Aloha");
-
-        JPackageCommand cmd = JPackageCommand.helloAppImage(appDesc);
-
-        // Build module jar.
-        cmd.executePrerequisiteActions();
-
-        final Path workDir = TKit.createTempDirectory("runtime").resolve("data");
-        final Path jlinkOutputDir = workDir.resolve(jlinkOutputSubdir);
-        Files.createDirectories(jlinkOutputDir.getParent());
-
-        // List of modules required for test app.
-        final var modules = new String[] {
-            "java.base",
-            "java.desktop"
-        };
-
-        Executor jlink = new Executor()
-        .setToolProvider(JavaTool.JLINK)
-        .dumpOutput()
-        .addArguments(
-                "--add-modules", String.join(",", modules),
-                "--output", jlinkOutputDir.toString(),
-                "--strip-debug",
-                "--no-header-files",
-                "--no-man-pages");
-
-        jlink.addArguments("--add-modules", appDesc.moduleName(),
-               "--module-path", Path.of(cmd.getArgumentValue("--module-path"))
-               .resolve("hello.jar").toString());
-
-        jlink.execute();
-
-        // non-modular jar in current dir caused error whe no module-path given
-        cmd.removeArgumentWithValue("--module-path");
-
-        cmd.setArgumentValue("--runtime-image", workDir.resolve(runtimeSubdir));
-        Path junkJar = null;
-        try {
-            // create a non-modular jar in the current directory
-            junkJar = HelloApp.createBundle(
-                    JavaAppDesc.parse("junk.jar:Hello"), Path.of("."));
-
-            cmd.executeAndAssertHelloAppImageCreated();
-        } finally {
-            if (junkJar != null) {
-                TKit.deleteIfExists(junkJar);
-            }
-        }
-
-    }
-
-    @Parameters
-    public static Collection<?> data() {
-
-        final List<String[]> paths = new ArrayList<>();
-        paths.add(new String[] { "", "" });
-        if (TKit.isOSX()) {
-            // On OSX jpackage should accept both runtime root and runtime home
-            // directories.
-            paths.add(new String[] { "Contents/Home", "" });
-        }
-
-        List<Object[]> data = new ArrayList<>();
-        for (var pathCfg : paths) {
-            data.add(new Object[] { pathCfg[0], pathCfg[1] });
-        }
-
-        return data;
-    }
-
-    private final Path jlinkOutputSubdir;
-    private final Path runtimeSubdir;
-}

From a1b4ad097e38d5769556814df84992f2d7aae83d Mon Sep 17 00:00:00 2001
From: Alexey Semenyuk <asemenyuk@openjdk.org>
Date: Fri, 6 Mar 2026 03:59:06 +0000
Subject: [PATCH 066/655] 8379345: jpackage: Fix issues in tests to improve
 their flexibility

Reviewed-by: almatvee
---
 .../helpers/jdk/jpackage/test/MacSign.java    |  81 ++++++++----
 .../jdk/jpackage/test/MacSignVerify.java      |   7 +-
 .../helpers/jdk/jpackage/test/TKit.java       |  20 ---
 .../jdk/jpackage/internal/cli/MainTest.java   |   1 +
 .../SigningRuntimeImagePackageTest.java       |   2 +-
 .../jpackage/share/FileAssociationsTest.java  |  12 +-
 .../jdk/tools/jpackage/share/LicenseTest.java | 119 ++++++++++--------
 .../jpackage/windows/WinInstallerUiTest.java  |  30 +++--
 8 files changed, 159 insertions(+), 113 deletions(-)

diff --git a/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/MacSign.java b/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/MacSign.java
index 20f7ac41eef..81e5da34140 100644
--- a/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/MacSign.java
+++ b/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/MacSign.java
@@ -67,6 +67,7 @@ import java.util.function.Supplier;
 import java.util.stream.Stream;
 import javax.naming.ldap.LdapName;
 import javax.naming.ldap.Rdn;
+import jdk.internal.util.OSVersion;
 import jdk.jpackage.internal.util.MemoizingSupplier;
 import jdk.jpackage.internal.util.function.ExceptionBox;
 import jdk.jpackage.internal.util.function.ThrowingConsumer;
@@ -233,7 +234,7 @@ import jdk.jpackage.internal.util.function.ThrowingSupplier;
  * An untrusted certificate can NOT be used with /usr/bin/codesign. Use
  *
  * <pre>
- * /usr/bin/security security add-trusted-cert -k foo.keychain cert.pem
+ * /usr/bin/security add-trusted-cert -k foo.keychain cert.pem
  * </pre>
  *
  * command to add trusted certificate from "cert.pem" file to "foo.keychain"
@@ -440,7 +441,21 @@ public final class MacSign {
         }
 
         Keychain unlock() {
-            createExecutor("unlock-keychain").execute();
+            var exec = createExecutor("unlock-keychain");
+
+            exec.execute();
+
+            if (UnlockKeychainWithOsascript.VALUE) {
+                exec = Executor.of("osascript")
+                        .addArguments(SIGN_UTILS_SCRIPT.toString(), "run-shell-script")
+                        .addArgument(Stream.concat(
+                                            Stream.of(exec.getExecutable().orElseThrow().toString()),
+                                            exec.getAllArguments().stream()
+                                    ).collect(joining(" ")));
+
+                exec.execute();
+            }
+
             return this;
         }
 
@@ -576,29 +591,43 @@ public final class MacSign {
         }
 
         private static CertificateStats create(KeychainWithCertsSpec spec) {
-            final var allCertificates = spec.keychain().findCertificates();
             final List<ResolvedCertificateRequest> allResolvedCertificateRequests = new ArrayList<>();
             final Map<X509Certificate, Exception> unmappedCertificates = new HashMap<>();
 
-            withTempDirectory(workDir -> {
-                for (final var cert : allCertificates) {
-                    ResolvedCertificateRequest resolvedCertificateRequest;
-                    try {
-                        resolvedCertificateRequest = new ResolvedCertificateRequest(cert);
-                    } catch (RuntimeException ex) {
-                        unmappedCertificates.put(cert, ExceptionBox.unbox(ex));
-                        continue;
-                    }
+            final Runnable workload = () -> {
+                final var allCertificates = spec.keychain().findCertificates();
+                withTempDirectory(workDir -> {
+                    for (final var cert : allCertificates) {
+                        ResolvedCertificateRequest resolvedCertificateRequest;
+                        try {
+                            resolvedCertificateRequest = new ResolvedCertificateRequest(cert);
+                        } catch (RuntimeException ex) {
+                            unmappedCertificates.put(cert, ExceptionBox.unbox(ex));
+                            continue;
+                        }
 
-                    if (spec.certificateRequests().stream().anyMatch(resolvedCertificateRequest.installed()::match)) {
-                        final var certFile = workDir.resolve(CertificateHash.of(cert).toString() + ".pem");
-                        final var verifyStatus = verifyCertificate(resolvedCertificateRequest, spec.keychain(), certFile);
-                        resolvedCertificateRequest = resolvedCertificateRequest.copyVerified(verifyStatus);
-                    }
+                        if (spec.certificateRequests().stream().anyMatch(resolvedCertificateRequest.installed()::match)) {
+                            final var certFile = workDir.resolve(CertificateHash.of(cert).toString() + ".pem");
+                            final var verifyStatus = verifyCertificate(resolvedCertificateRequest, spec.keychain(), certFile);
+                            resolvedCertificateRequest = resolvedCertificateRequest.copyVerified(verifyStatus);
+                        }
 
-                    allResolvedCertificateRequests.add(resolvedCertificateRequest);
-                }
-            });
+                        allResolvedCertificateRequests.add(resolvedCertificateRequest);
+                    }
+                });
+            };
+
+            // Starting from some macOS version, it is no longer necessary to have the keychain
+            // in the list of keychains when running the "/usr/bin/security verify-cert ..." command to verify its certificate(s).
+            // The exact version when they relaxed this constraint is unknown, but it is still required on Catalina 10.15.7.
+            // On Catalina, if the keychain is not in the list of keychains, "/usr/bin/security verify-cert ..." command
+            // executed on the certificates of this keychain returns "untrusted" result.
+            if (OSVersion.current().compareTo(new OSVersion(10, 16)) < 0) {
+                // macOS Catalina or older
+                withKeychains(spec).addToSearchList().run(workload);
+            } else {
+                workload.run();
+            }
 
             return new CertificateStats(allResolvedCertificateRequests,
                     List.copyOf(spec.certificateRequests()), unmappedCertificates);
@@ -1272,7 +1301,11 @@ public final class MacSign {
         for (final var quite : List.of(true, false)) {
             result = security("verify-cert", "-L", "-n",
                     quite ? "-q" : "-v",
-                    "-c", certFile.normalize().toString(),
+                    // Use "-r" option to verify the certificate against itself.
+                    // "-c" option works on newer macOS versions, but on older ones (at least on Catalina 10.15.7),
+                    // in case there are two self-signed certificates with the same name in the given keychain,
+                    // it links them in the certificate list and fails verification.
+                    "-r", certFile.normalize().toString(),
                     "-k", keychain.name(),
                     "-p", resolvedCertificateRequest.installed().type().verifyPolicy()).saveOutput(!quite).executeWithoutExitCodeCheck();
             if (result.getExitCode() == 0) {
@@ -1463,4 +1496,10 @@ public final class MacSign {
     // faketime is not a standard macOS command.
     // One way to get it is with Homebrew.
     private static final Path FAKETIME = Path.of(Optional.ofNullable(TKit.getConfigProperty("faketime")).orElse("/usr/local/bin/faketime"));
+
+    // Run the "/usr/bin/system unlock-keychain" command in Terminal.app if
+    // the current process runs in an SSH session and the OS version is macOS Catalina or older.
+    private static final class UnlockKeychainWithOsascript {
+        static final boolean VALUE = System.getenv("SSH_CONNECTION") != null && OSVersion.current().compareTo(new OSVersion(10, 16)) < 0;
+    }
 }
diff --git a/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/MacSignVerify.java b/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/MacSignVerify.java
index 01c510070be..404811ea0f8 100644
--- a/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/MacSignVerify.java
+++ b/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/MacSignVerify.java
@@ -93,8 +93,11 @@ public final class MacSignVerify {
         final var exec = Executor.of(
                 "/usr/bin/codesign",
                 "-d",
-                "--entitlements", "-",
-                "--xml", path.toString()).saveOutput().dumpOutput().binaryOutput();
+                // `--entitlements :-` will print entitlements as XML plist in the stdout and "Executable=..." message to the stderr.
+                // Prefer this option combination to `--entitlements - --xml` as
+                // the latter doesn't work on older macOS releases (Proved unsupported on Catalina 10.15.7).
+                "--entitlements", ":-",
+                path.toString()).saveOutput().dumpOutput().binaryOutput();
         final var result = exec.execute();
         var xml = result.byteStdout();
         if (xml.length == 0) {
diff --git a/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/TKit.java b/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/TKit.java
index db76309c292..04b828677ca 100644
--- a/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/TKit.java
+++ b/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/TKit.java
@@ -37,7 +37,6 @@ import java.nio.file.FileSystems;
 import java.nio.file.Files;
 import java.nio.file.LinkOption;
 import java.nio.file.Path;
-import java.nio.file.StandardCopyOption;
 import java.nio.file.StandardWatchEventKinds;
 import java.nio.file.WatchEvent;
 import java.nio.file.WatchKey;
@@ -606,25 +605,6 @@ public final class TKit {
         return JtregSkippedExceptionClass.INSTANCE.isInstance(t);
     }
 
-    public static Path createRelativePathCopy(final Path file) {
-        Path fileCopy = ThrowingSupplier.toSupplier(() -> {
-            Path localPath = createTempFile(file.getFileName());
-            Files.copy(file, localPath, StandardCopyOption.REPLACE_EXISTING);
-            return localPath;
-        }).get().toAbsolutePath().normalize();
-
-        final Path basePath = Path.of(".").toAbsolutePath().normalize();
-        try {
-            return basePath.relativize(fileCopy);
-        } catch (IllegalArgumentException ex) {
-            // May happen on Windows: java.lang.IllegalArgumentException: 'other' has different root
-            trace(String.format("Failed to relativize [%s] at [%s]", fileCopy,
-                    basePath));
-            printStackTrace(ex);
-        }
-        return file;
-    }
-
     public static void waitForFileCreated(Path fileToWaitFor,
             Duration timeout, Duration afterCreatedTimeout) throws IOException {
         waitForFileCreated(fileToWaitFor, timeout);
diff --git a/test/jdk/tools/jpackage/junit/share/jdk.jpackage/jdk/jpackage/internal/cli/MainTest.java b/test/jdk/tools/jpackage/junit/share/jdk.jpackage/jdk/jpackage/internal/cli/MainTest.java
index 3f933093e97..1b89d23c301 100644
--- a/test/jdk/tools/jpackage/junit/share/jdk.jpackage/jdk/jpackage/internal/cli/MainTest.java
+++ b/test/jdk/tools/jpackage/junit/share/jdk.jpackage/jdk/jpackage/internal/cli/MainTest.java
@@ -154,6 +154,7 @@ public class MainTest extends JUnitAdapter {
 
         JPackageCommand.helloAppImage()
                 .ignoreDefaultVerbose(true)
+                .ignoreDefaultRuntime(true)
                 .useToolProvider(jpackageToolProviderMock)
                 .execute(jpackageExitCode);
     }
diff --git a/test/jdk/tools/jpackage/macosx/SigningRuntimeImagePackageTest.java b/test/jdk/tools/jpackage/macosx/SigningRuntimeImagePackageTest.java
index 54021aa2a0b..11b466ed715 100644
--- a/test/jdk/tools/jpackage/macosx/SigningRuntimeImagePackageTest.java
+++ b/test/jdk/tools/jpackage/macosx/SigningRuntimeImagePackageTest.java
@@ -200,7 +200,7 @@ public class SigningRuntimeImagePackageTest {
         // This way we can test if jpackage keeps or replaces the signature of
         // the predefined runtime bundle when backing it in the pkg or dmg installer.
         return new SignKeyOptionWithKeychain(
-                SignKeyOption.Type.SIGN_KEY_USER_SHORT_NAME,
+                SignKeyOption.Type.SIGN_KEY_IDENTITY_APP_IMAGE,
                 SigningBase.StandardCertificateRequest.CODESIGN_ACME_TECH_LTD,
                 SigningBase.StandardKeychain.MAIN.keychain());
     }
diff --git a/test/jdk/tools/jpackage/share/FileAssociationsTest.java b/test/jdk/tools/jpackage/share/FileAssociationsTest.java
index c9bd690d73f..0af7e7a54ff 100644
--- a/test/jdk/tools/jpackage/share/FileAssociationsTest.java
+++ b/test/jdk/tools/jpackage/share/FileAssociationsTest.java
@@ -23,6 +23,8 @@
 
 import static java.util.Map.entry;
 
+import java.io.IOException;
+import java.nio.file.Files;
 import java.nio.file.Path;
 import java.util.List;
 import jdk.jpackage.test.Annotations.Parameter;
@@ -84,7 +86,7 @@ public class FileAssociationsTest {
     @Test
     @Parameter("true")
     @Parameter("false")
-    public static void test(boolean includeDescription) {
+    public static void test(boolean includeDescription) throws IOException {
         PackageTest packageTest = new PackageTest();
 
         // Not supported
@@ -96,10 +98,8 @@ public class FileAssociationsTest {
         }
         fa.applyTo(packageTest);
 
-        Path icon = TKit.TEST_SRC_ROOT.resolve(Path.of("resources", "icon"
-                + TKit.ICON_SUFFIX));
-
-        icon = TKit.createRelativePathCopy(icon);
+        var icon = TKit.createTempDirectory("icon-dir").resolve(ICON.getFileName());
+        Files.copy(ICON, icon);
 
         new FileAssociations("jptest2")
                 .setFilename("fa2")
@@ -151,4 +151,6 @@ public class FileAssociationsTest {
                 .addInitializer(JPackageCommand::setFakeRuntime)
                 .setExpectedExitCode(1);
     }
+
+    private static final Path ICON = TKit.TEST_SRC_ROOT.resolve(Path.of("resources", "icon" + TKit.ICON_SUFFIX));
 }
diff --git a/test/jdk/tools/jpackage/share/LicenseTest.java b/test/jdk/tools/jpackage/share/LicenseTest.java
index 9c2d1077584..bf4c26fe76a 100644
--- a/test/jdk/tools/jpackage/share/LicenseTest.java
+++ b/test/jdk/tools/jpackage/share/LicenseTest.java
@@ -21,21 +21,23 @@
  * questions.
  */
 
+import static jdk.internal.util.OperatingSystem.LINUX;
+
 import java.io.IOException;
 import java.nio.file.Files;
 import java.nio.file.Path;
-import java.util.List;
 import java.util.ArrayList;
 import java.util.Arrays;
+import java.util.List;
 import java.util.function.Function;
 import java.util.stream.Collectors;
-import static jdk.internal.util.OperatingSystem.LINUX;
+import jdk.jpackage.internal.util.Slot;
 import jdk.jpackage.test.Annotations.Test;
-import jdk.jpackage.test.JPackageCommand;
-import jdk.jpackage.test.PackageType;
-import jdk.jpackage.test.PackageTest;
-import jdk.jpackage.test.LinuxHelper;
 import jdk.jpackage.test.Executor;
+import jdk.jpackage.test.JPackageCommand;
+import jdk.jpackage.test.LinuxHelper;
+import jdk.jpackage.test.PackageTest;
+import jdk.jpackage.test.PackageType;
 import jdk.jpackage.test.TKit;
 
 /**
@@ -93,11 +95,7 @@ public class LicenseTest {
 
     @Test
     public static void testCommon() {
-        PackageTest test = new PackageTest().configureHelloApp()
-        .addInitializer(cmd -> {
-            cmd.addArguments("--license-file", TKit.createRelativePathCopy(
-                    LICENSE_FILE));
-        });
+        PackageTest test = new PackageTest().configureHelloApp().mutate(LicenseTest::setLicenseFile);
 
         initMacDmgLicenseVerifier(test.forTypes(PackageType.MAC_DMG));
         initLinuxLicenseVerifier(test.forTypes(PackageType.LINUX));
@@ -127,19 +125,16 @@ public class LicenseTest {
 
     @Test(ifOS = LINUX)
     public static void testCustomDebianCopyright() {
-        new CustomDebianCopyrightTest().run();
+        new CustomDebianCopyrightTest(false).run();
     }
 
     @Test(ifOS = LINUX)
     public static void testCustomDebianCopyrightSubst() {
-        new CustomDebianCopyrightTest().withSubstitution(true).run();
+        new CustomDebianCopyrightTest(true).run();
     }
 
     private static PackageTest initMacDmgLicenseVerifier(PackageTest test) {
-        return test
-        .addBundleVerifier(cmd -> {
-            verifyLicenseFileInDMGPackage(cmd);
-        });
+        return test.addBundleVerifier(LicenseTest::verifyLicenseFileInDMGPackage);
     }
 
     private static void verifyLicenseFileInDMGPackage(JPackageCommand cmd)
@@ -179,10 +174,9 @@ public class LicenseTest {
         PackageTest test = new PackageTest()
         .forTypes(PackageType.LINUX)
         .configureHelloApp()
+        .addInitializer(JPackageCommand::setFakeRuntime)
+        .mutate(LicenseTest::setLicenseFile)
         .addInitializer(cmd -> {
-            cmd.setFakeRuntime();
-            cmd.addArguments("--license-file", TKit.createRelativePathCopy(
-                    LICENSE_FILE));
             cmd.addArguments("--install-dir", installDir);
         });
 
@@ -191,6 +185,18 @@ public class LicenseTest {
         test.run();
     }
 
+    private static void setLicenseFile(PackageTest test) {
+        var inputLicenseFile = Slot.<Path>createEmpty();
+
+        test.addRunOnceInitializer(() -> {
+            var dir = TKit.createTempDirectory("license-dir");
+            inputLicenseFile.set(dir.resolve(LICENSE_FILE.getFileName()));
+            Files.copy(LICENSE_FILE, inputLicenseFile.get());
+        }).addInitializer(cmd -> {
+            cmd.setArgumentValue("--license-file", inputLicenseFile.get());
+        });
+    }
+
     private static Path rpmLicenseFile(JPackageCommand cmd) {
         final Path licenseRoot = Path.of(
                 new Executor()
@@ -296,12 +302,36 @@ public class LicenseTest {
         TKit.assertPathExists(licenseFile.getParent(), false);
     }
 
-    private static class CustomDebianCopyrightTest {
-        CustomDebianCopyrightTest() {
-            withSubstitution(false);
+    private record CustomDebianCopyrightTest(boolean withSubstitution) {
+
+        private String copyright() {
+            // Different values just to make easy to figure out from the test log which test was executed.
+            if (withSubstitution) {
+                return "Duke (C)";
+            } else {
+                return "Java (C)";
+            }
         }
 
-        private List<String> licenseFileText(String copyright, String licenseText) {
+        private String licenseText() {
+            // Different values just to make easy to figure out from the test log which test was executed.
+            if (withSubstitution) {
+                return "The quick brown fox\n jumps over the lazy dog";
+            } else {
+                return "How vexingly quick daft zebras jump!";
+            }
+        }
+
+        private String name() {
+            // Different values just to make easy to figure out from the test log which test was executed.
+            if (withSubstitution) {
+                return "CustomDebianCopyrightWithSubst";
+            } else {
+                return "CustomDebianCopyright";
+            }
+        }
+
+        static private List<String> licenseFileText(String copyright, String licenseText) {
             List<String> lines = new ArrayList<>(List.of(
                     String.format("Copyright=%s", copyright),
                     "Foo",
@@ -313,28 +343,14 @@ public class LicenseTest {
 
         private List<String> licenseFileText() {
             if (withSubstitution) {
-                return licenseFileText("APPLICATION_COPYRIGHT",
-                        "APPLICATION_LICENSE_TEXT");
+                return licenseFileText("APPLICATION_COPYRIGHT", "APPLICATION_LICENSE_TEXT");
             } else {
                 return expectedLicenseFileText();
             }
         }
 
         private List<String> expectedLicenseFileText() {
-            return licenseFileText(copyright, licenseText);
-        }
-
-        CustomDebianCopyrightTest withSubstitution(boolean v) {
-            withSubstitution = v;
-            // Different values just to make easy to figure out from the test log which test was executed.
-            if (v) {
-                copyright = "Duke (C)";
-                licenseText = "The quick brown fox\n jumps over the lazy dog";
-            } else {
-                copyright = "Java (C)";
-                licenseText = "How vexingly quick daft zebras jump!";
-            }
-            return this;
+            return licenseFileText(copyright(), licenseText());
         }
 
         void run() {
@@ -343,20 +359,19 @@ public class LicenseTest {
             .addInitializer(cmd -> {
                 // Create source license file.
                 Files.write(srcLicenseFile, List.of(
-                        licenseText.split("\\R", -1)));
+                        licenseText().split("\\R", -1)));
 
                 cmd.setFakeRuntime();
-                cmd.setArgumentValue("--name", String.format("%s%s",
-                        withSubstitution ? "CustomDebianCopyrightWithSubst" : "CustomDebianCopyright",
-                        cmd.name()));
+                cmd.setArgumentValue("--name", String.format("%s%s", name(), cmd.name()));
                 cmd.addArguments("--license-file", srcLicenseFile);
-                cmd.addArguments("--copyright", copyright);
-                cmd.addArguments("--resource-dir", RESOURCE_DIR);
+                cmd.addArguments("--copyright", copyright());
+
+                var resourceDir = TKit.createTempDirectory("resources");
+
+                cmd.addArguments("--resource-dir", resourceDir);
 
                 // Create copyright template file in a resource dir.
-                Files.createDirectories(RESOURCE_DIR);
-                Files.write(RESOURCE_DIR.resolve("copyright"),
-                        licenseFileText());
+                Files.write(resourceDir.resolve("copyright"), licenseFileText());
             })
             .addInstallVerifier(cmd -> {
                 Path installedLicenseFile = linuxLicenseFile(cmd);
@@ -368,12 +383,6 @@ public class LicenseTest {
             })
             .run();
         }
-
-        private boolean withSubstitution;
-        private String copyright;
-        private String licenseText;
-
-        private final Path RESOURCE_DIR = TKit.workDir().resolve("resources");
     }
 
     private static final Path LICENSE_FILE = TKit.TEST_SRC_ROOT.resolve(
diff --git a/test/jdk/tools/jpackage/windows/WinInstallerUiTest.java b/test/jdk/tools/jpackage/windows/WinInstallerUiTest.java
index 7dcf025a506..d6cebde6444 100644
--- a/test/jdk/tools/jpackage/windows/WinInstallerUiTest.java
+++ b/test/jdk/tools/jpackage/windows/WinInstallerUiTest.java
@@ -21,13 +21,15 @@
  * questions.
  */
 
+import java.nio.file.Files;
 import java.nio.file.Path;
 import java.util.ArrayList;
-import jdk.jpackage.test.PackageTest;
-import jdk.jpackage.test.JPackageCommand;
-import jdk.jpackage.test.Annotations.Test;
-import jdk.jpackage.test.Annotations.Parameters;
 import java.util.List;
+import jdk.jpackage.internal.util.Slot;
+import jdk.jpackage.test.Annotations.Parameters;
+import jdk.jpackage.test.Annotations.Test;
+import jdk.jpackage.test.JPackageCommand;
+import jdk.jpackage.test.PackageTest;
 import jdk.jpackage.test.PackageType;
 import jdk.jpackage.test.TKit;
 
@@ -108,11 +110,7 @@ public class WinInstallerUiTest {
         }
 
         if (withLicense) {
-            test.addInitializer(cmd -> {
-                cmd.addArguments("--license-file", TKit.createRelativePathCopy(
-                        TKit.TEST_SRC_ROOT.resolve(Path.of("resources",
-                                "license.txt"))));
-            });
+            setLicenseFile(test);
         }
 
         test.run();
@@ -133,7 +131,21 @@ public class WinInstallerUiTest {
         cmd.setArgumentValue("--name", sb.toString());
     }
 
+    private static void setLicenseFile(PackageTest test) {
+        var inputLicenseFile = Slot.<Path>createEmpty();
+
+        test.addRunOnceInitializer(() -> {
+            var dir = TKit.createTempDirectory("license-dir");
+            inputLicenseFile.set(dir.resolve(LICENSE_FILE.getFileName()));
+            Files.copy(LICENSE_FILE, inputLicenseFile.get());
+        }).addInitializer(cmd -> {
+            cmd.setArgumentValue("--license-file", inputLicenseFile.get());
+        });
+    }
+
     private final boolean withDirChooser;
     private final boolean withLicense;
     private final boolean withShortcutPrompt;
+
+    private static final Path LICENSE_FILE = TKit.TEST_SRC_ROOT.resolve(Path.of("resources", "license.txt"));
 }

From e6406641d78219f29d24de32ce3c7e6781dc283f Mon Sep 17 00:00:00 2001
From: Jatin Bhateja <jbhateja@openjdk.org>
Date: Fri, 6 Mar 2026 04:37:05 +0000
Subject: [PATCH 067/655] 8378758: [VectorAPI] Add Jtreg scalar operation
 wrappers for math operators and APIs

Reviewed-by: sherman
---
 .../incubator/vector/ByteVector128Tests.java  | 279 ++++++-----
 .../incubator/vector/ByteVector256Tests.java  | 279 ++++++-----
 .../incubator/vector/ByteVector512Tests.java  | 279 ++++++-----
 .../incubator/vector/ByteVector64Tests.java   | 279 ++++++-----
 .../incubator/vector/ByteVectorMaxTests.java  | 279 ++++++-----
 .../vector/DoubleVector128Tests.java          | 450 +++++++++++++-----
 .../vector/DoubleVector256Tests.java          | 450 +++++++++++++-----
 .../vector/DoubleVector512Tests.java          | 450 +++++++++++++-----
 .../incubator/vector/DoubleVector64Tests.java | 450 +++++++++++++-----
 .../vector/DoubleVectorMaxTests.java          | 450 +++++++++++++-----
 .../incubator/vector/FloatVector128Tests.java | 450 +++++++++++++-----
 .../incubator/vector/FloatVector256Tests.java | 450 +++++++++++++-----
 .../incubator/vector/FloatVector512Tests.java | 450 +++++++++++++-----
 .../incubator/vector/FloatVector64Tests.java  | 450 +++++++++++++-----
 .../incubator/vector/FloatVectorMaxTests.java | 450 +++++++++++++-----
 .../incubator/vector/IntVector128Tests.java   | 279 ++++++-----
 .../incubator/vector/IntVector256Tests.java   | 279 ++++++-----
 .../incubator/vector/IntVector512Tests.java   | 279 ++++++-----
 .../incubator/vector/IntVector64Tests.java    | 279 ++++++-----
 .../incubator/vector/IntVectorMaxTests.java   | 279 ++++++-----
 .../incubator/vector/LongVector128Tests.java  | 252 ++++++----
 .../incubator/vector/LongVector256Tests.java  | 252 ++++++----
 .../incubator/vector/LongVector512Tests.java  | 252 ++++++----
 .../incubator/vector/LongVector64Tests.java   | 252 ++++++----
 .../incubator/vector/LongVectorMaxTests.java  | 252 ++++++----
 .../incubator/vector/ShortVector128Tests.java | 279 ++++++-----
 .../incubator/vector/ShortVector256Tests.java | 279 ++++++-----
 .../incubator/vector/ShortVector512Tests.java | 279 ++++++-----
 .../incubator/vector/ShortVector64Tests.java  | 279 ++++++-----
 .../incubator/vector/ShortVectorMaxTests.java | 279 ++++++-----
 test/jdk/jdk/incubator/vector/gen-template.sh | 103 ++--
 .../Kernel-Reduction-Masked-op.template       |   2 +-
 .../templates/Kernel-Reduction-op.template    |   2 +-
 .../templates/Unit-Binary-op-math.template    |   2 +-
 .../templates/Unit-Compare-Broadcast.template |   8 +-
 .../templates/Unit-Miscellaneous.template     |  23 +-
 .../Unit-Reduction-Scalar-Masked-op.template  |   4 +-
 .../Unit-Reduction-Scalar-op.template         |   4 +-
 .../templates/Unit-Reduction-op.template      |  10 +-
 .../templates/Unit-Unary-op-math.template     |   2 +-
 .../vector/templates/Unit-header.template     | 220 ++++++++-
 41 files changed, 6779 insertions(+), 3546 deletions(-)

diff --git a/test/jdk/jdk/incubator/vector/ByteVector128Tests.java b/test/jdk/jdk/incubator/vector/ByteVector128Tests.java
index 91148fd5d66..ca6fa537ac4 100644
--- a/test/jdk/jdk/incubator/vector/ByteVector128Tests.java
+++ b/test/jdk/jdk/incubator/vector/ByteVector128Tests.java
@@ -1574,6 +1574,59 @@ public class ByteVector128Tests extends AbstractVectorTest {
         return a >= b;
     }
 
+    static byte firstNonZero(byte a, byte b) {
+        return Byte.compare(a, (byte) 0) != 0 ? a : b;
+    }
+
+    static byte scalar_or(byte a, byte b) {
+        return (byte)(a | b);
+    }
+
+    static byte scalar_and(byte a, byte b) {
+        return (byte)(a & b);
+    }
+
+    static byte scalar_xor(byte a, byte b) {
+        return (byte)(a ^ b);
+    }
+
+    static byte scalar_add(byte a, byte b) {
+        return (byte)(a + b);
+    }
+
+    static byte scalar_sub(byte a, byte b) {
+        return (byte)(a - b);
+    }
+
+    static byte scalar_mul(byte a, byte b) {
+        return (byte)(a * b);
+    }
+
+    static byte scalar_min(byte a, byte b) {
+        return (byte)(Math.min(a, b));
+    }
+
+    static byte scalar_max(byte a, byte b) {
+        return (byte)(Math.max(a, b));
+    }
+
+    static byte scalar_div(byte a, byte b) {
+        return (byte)(a / b);
+    }
+
+    static byte scalar_fma(byte a, byte b, byte c) {
+        return (byte)(Math.fma(a, b, c));
+    }
+
+    static byte scalar_abs(byte a) {
+        return (byte)(Math.abs(a));
+    }
+
+    static byte scalar_neg(byte a) {
+        return ((byte)-a);
+    }
+
+
     static boolean ult(byte a, byte b) {
         return Byte.compareUnsigned(a, b) < 0;
     }
@@ -1590,9 +1643,6 @@ public class ByteVector128Tests extends AbstractVectorTest {
         return Byte.compareUnsigned(a, b) >= 0;
     }
 
-    static byte firstNonZero(byte a, byte b) {
-        return Byte.compare(a, (byte) 0) != 0 ? a : b;
-    }
 
     @Test
     static void smokeTest1() {
@@ -1701,7 +1751,7 @@ public class ByteVector128Tests extends AbstractVectorTest {
     }
 
     static byte ADD(byte a, byte b) {
-        return (byte)(a + b);
+        return (byte)(scalar_add(a, b));
     }
 
     @Test(dataProvider = "byteBinaryOpProvider")
@@ -1722,7 +1772,7 @@ public class ByteVector128Tests extends AbstractVectorTest {
     }
 
     static byte add(byte a, byte b) {
-        return (byte)(a + b);
+        return (byte)(scalar_add(a, b));
     }
 
     @Test(dataProvider = "byteBinaryOpProvider")
@@ -1779,7 +1829,7 @@ public class ByteVector128Tests extends AbstractVectorTest {
     }
 
     static byte SUB(byte a, byte b) {
-        return (byte)(a - b);
+        return (byte)(scalar_sub(a, b));
     }
 
     @Test(dataProvider = "byteBinaryOpProvider")
@@ -1800,7 +1850,7 @@ public class ByteVector128Tests extends AbstractVectorTest {
     }
 
     static byte sub(byte a, byte b) {
-        return (byte)(a - b);
+        return (byte)(scalar_sub(a, b));
     }
 
     @Test(dataProvider = "byteBinaryOpProvider")
@@ -1857,7 +1907,7 @@ public class ByteVector128Tests extends AbstractVectorTest {
     }
 
     static byte MUL(byte a, byte b) {
-        return (byte)(a * b);
+        return (byte)(scalar_mul(a, b));
     }
 
     @Test(dataProvider = "byteBinaryOpProvider")
@@ -1878,7 +1928,7 @@ public class ByteVector128Tests extends AbstractVectorTest {
     }
 
     static byte mul(byte a, byte b) {
-        return (byte)(a * b);
+        return (byte)(scalar_mul(a, b));
     }
 
     @Test(dataProvider = "byteBinaryOpProvider")
@@ -2025,7 +2075,7 @@ public class ByteVector128Tests extends AbstractVectorTest {
     }
 
     static byte FIRST_NONZERO(byte a, byte b) {
-        return (byte)((a)!=0?a:b);
+        return (byte)(firstNonZero(a, b));
     }
 
     @Test(dataProvider = "byteBinaryOpProvider")
@@ -3239,7 +3289,7 @@ public class ByteVector128Tests extends AbstractVectorTest {
     }
 
     static byte MIN(byte a, byte b) {
-        return (byte)(Math.min(a, b));
+        return (byte)(scalar_min(a, b));
     }
 
     @Test(dataProvider = "byteBinaryOpProvider")
@@ -3260,7 +3310,7 @@ public class ByteVector128Tests extends AbstractVectorTest {
     }
 
     static byte min(byte a, byte b) {
-        return (byte)(Math.min(a, b));
+        return (byte)(scalar_min(a, b));
     }
 
     @Test(dataProvider = "byteBinaryOpProvider")
@@ -3279,7 +3329,7 @@ public class ByteVector128Tests extends AbstractVectorTest {
     }
 
     static byte MAX(byte a, byte b) {
-        return (byte)(Math.max(a, b));
+        return (byte)(scalar_max(a, b));
     }
 
     @Test(dataProvider = "byteBinaryOpProvider")
@@ -3300,7 +3350,7 @@ public class ByteVector128Tests extends AbstractVectorTest {
     }
 
     static byte max(byte a, byte b) {
-        return (byte)(Math.max(a, b));
+        return (byte)(scalar_max(a, b));
     }
 
     @Test(dataProvider = "byteBinaryOpProvider")
@@ -3668,7 +3718,7 @@ public class ByteVector128Tests extends AbstractVectorTest {
     static byte ANDReduce(byte[] a, int idx) {
         byte res = AND_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res &= a[i];
+            res = scalar_and(res, a[i]);
         }
 
         return res;
@@ -3677,7 +3727,7 @@ public class ByteVector128Tests extends AbstractVectorTest {
     static byte ANDReduceAll(byte[] a) {
         byte res = AND_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res &= ANDReduce(a, i);
+            res = scalar_and(res, ANDReduce(a, i));
         }
 
         return res;
@@ -3695,7 +3745,7 @@ public class ByteVector128Tests extends AbstractVectorTest {
                 ByteVector av = ByteVector.fromArray(SPECIES, a, i);
                 byte v = av.reduceLanes(VectorOperators.AND);
                 r[i] = v;
-                ra &= v;
+                ra = scalar_and(ra, v);
             }
         }
 
@@ -3708,20 +3758,20 @@ public class ByteVector128Tests extends AbstractVectorTest {
         byte[] a = fa.apply(SPECIES.length());
         byte id = AND_IDENTITY;
 
-        assertEquals((byte) (id & id), id,
+        assertEquals((byte) (scalar_and(id, id)), id,
                             "AND(AND_IDENTITY, AND_IDENTITY) != AND_IDENTITY");
 
         byte x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((byte) (id & x), x);
-                assertEquals((byte) (x & id), x);
+                assertEquals((byte) (scalar_and(id, x)), x);
+                assertEquals((byte) (scalar_and(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((byte) (id & x), x,
+            assertEquals((byte) (scalar_and(id, x)), x,
                                 "AND(AND_IDENTITY, " + x + ") != " + x);
-            assertEquals((byte) (x & id), x,
+            assertEquals((byte) (scalar_and(x, id)), x,
                                 "AND(" + x + ", AND_IDENTITY) != " + x);
         }
     }
@@ -3730,7 +3780,7 @@ public class ByteVector128Tests extends AbstractVectorTest {
         byte res = AND_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res &= a[i];
+                res = scalar_and(res, a[i]);
         }
 
         return res;
@@ -3739,7 +3789,7 @@ public class ByteVector128Tests extends AbstractVectorTest {
     static byte ANDReduceAllMasked(byte[] a, boolean[] mask) {
         byte res = AND_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res &= ANDReduceMasked(a, i, mask);
+            res = scalar_and(res, ANDReduceMasked(a, i, mask));
         }
 
         return res;
@@ -3759,7 +3809,7 @@ public class ByteVector128Tests extends AbstractVectorTest {
                 ByteVector av = ByteVector.fromArray(SPECIES, a, i);
                 byte v = av.reduceLanes(VectorOperators.AND, vmask);
                 r[i] = v;
-                ra &= v;
+                ra = scalar_and(ra, v);
             }
         }
 
@@ -3770,7 +3820,7 @@ public class ByteVector128Tests extends AbstractVectorTest {
     static byte ORReduce(byte[] a, int idx) {
         byte res = OR_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res |= a[i];
+            res = scalar_or(res, a[i]);
         }
 
         return res;
@@ -3779,7 +3829,7 @@ public class ByteVector128Tests extends AbstractVectorTest {
     static byte ORReduceAll(byte[] a) {
         byte res = OR_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res |= ORReduce(a, i);
+            res = scalar_or(res, ORReduce(a, i));
         }
 
         return res;
@@ -3797,7 +3847,7 @@ public class ByteVector128Tests extends AbstractVectorTest {
                 ByteVector av = ByteVector.fromArray(SPECIES, a, i);
                 byte v = av.reduceLanes(VectorOperators.OR);
                 r[i] = v;
-                ra |= v;
+                ra = scalar_or(ra, v);
             }
         }
 
@@ -3810,20 +3860,20 @@ public class ByteVector128Tests extends AbstractVectorTest {
         byte[] a = fa.apply(SPECIES.length());
         byte id = OR_IDENTITY;
 
-        assertEquals((byte) (id | id), id,
+        assertEquals((byte) (scalar_or(id, id)), id,
                             "OR(OR_IDENTITY, OR_IDENTITY) != OR_IDENTITY");
 
         byte x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((byte) (id | x), x);
-                assertEquals((byte) (x | id), x);
+                assertEquals((byte) (scalar_or(id, x)), x);
+                assertEquals((byte) (scalar_or(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((byte) (id | x), x,
+            assertEquals((byte) (scalar_or(id, x)), x,
                                 "OR(OR_IDENTITY, " + x + ") != " + x);
-            assertEquals((byte) (x | id), x,
+            assertEquals((byte) (scalar_or(x, id)), x,
                                 "OR(" + x + ", OR_IDENTITY) != " + x);
         }
     }
@@ -3832,7 +3882,7 @@ public class ByteVector128Tests extends AbstractVectorTest {
         byte res = OR_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res |= a[i];
+                res = scalar_or(res, a[i]);
         }
 
         return res;
@@ -3841,7 +3891,7 @@ public class ByteVector128Tests extends AbstractVectorTest {
     static byte ORReduceAllMasked(byte[] a, boolean[] mask) {
         byte res = OR_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res |= ORReduceMasked(a, i, mask);
+            res = scalar_or(res, ORReduceMasked(a, i, mask));
         }
 
         return res;
@@ -3861,7 +3911,7 @@ public class ByteVector128Tests extends AbstractVectorTest {
                 ByteVector av = ByteVector.fromArray(SPECIES, a, i);
                 byte v = av.reduceLanes(VectorOperators.OR, vmask);
                 r[i] = v;
-                ra |= v;
+                ra = scalar_or(ra, v);
             }
         }
 
@@ -3872,7 +3922,7 @@ public class ByteVector128Tests extends AbstractVectorTest {
     static byte XORReduce(byte[] a, int idx) {
         byte res = XOR_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res ^= a[i];
+            res = scalar_xor(res, a[i]);
         }
 
         return res;
@@ -3881,7 +3931,7 @@ public class ByteVector128Tests extends AbstractVectorTest {
     static byte XORReduceAll(byte[] a) {
         byte res = XOR_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res ^= XORReduce(a, i);
+            res = scalar_xor(res, XORReduce(a, i));
         }
 
         return res;
@@ -3899,7 +3949,7 @@ public class ByteVector128Tests extends AbstractVectorTest {
                 ByteVector av = ByteVector.fromArray(SPECIES, a, i);
                 byte v = av.reduceLanes(VectorOperators.XOR);
                 r[i] = v;
-                ra ^= v;
+                ra = scalar_xor(ra, v);
             }
         }
 
@@ -3912,20 +3962,20 @@ public class ByteVector128Tests extends AbstractVectorTest {
         byte[] a = fa.apply(SPECIES.length());
         byte id = XOR_IDENTITY;
 
-        assertEquals((byte) (id ^ id), id,
+        assertEquals((byte) (scalar_xor(id, id)), id,
                             "XOR(XOR_IDENTITY, XOR_IDENTITY) != XOR_IDENTITY");
 
         byte x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((byte) (id ^ x), x);
-                assertEquals((byte) (x ^ id), x);
+                assertEquals((byte) (scalar_xor(id, x)), x);
+                assertEquals((byte) (scalar_xor(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((byte) (id ^ x), x,
+            assertEquals((byte) (scalar_xor(id, x)), x,
                                 "XOR(XOR_IDENTITY, " + x + ") != " + x);
-            assertEquals((byte) (x ^ id), x,
+            assertEquals((byte) (scalar_xor(x, id)), x,
                                 "XOR(" + x + ", XOR_IDENTITY) != " + x);
         }
     }
@@ -3934,7 +3984,7 @@ public class ByteVector128Tests extends AbstractVectorTest {
         byte res = XOR_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res ^= a[i];
+                res = scalar_xor(res, a[i]);
         }
 
         return res;
@@ -3943,7 +3993,7 @@ public class ByteVector128Tests extends AbstractVectorTest {
     static byte XORReduceAllMasked(byte[] a, boolean[] mask) {
         byte res = XOR_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res ^= XORReduceMasked(a, i, mask);
+            res = scalar_xor(res, XORReduceMasked(a, i, mask));
         }
 
         return res;
@@ -3963,7 +4013,7 @@ public class ByteVector128Tests extends AbstractVectorTest {
                 ByteVector av = ByteVector.fromArray(SPECIES, a, i);
                 byte v = av.reduceLanes(VectorOperators.XOR, vmask);
                 r[i] = v;
-                ra ^= v;
+                ra = scalar_xor(ra, v);
             }
         }
 
@@ -3974,7 +4024,7 @@ public class ByteVector128Tests extends AbstractVectorTest {
     static byte ADDReduce(byte[] a, int idx) {
         byte res = ADD_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res += a[i];
+            res = scalar_add(res, a[i]);
         }
 
         return res;
@@ -3983,7 +4033,7 @@ public class ByteVector128Tests extends AbstractVectorTest {
     static byte ADDReduceAll(byte[] a) {
         byte res = ADD_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduce(a, i);
+            res = scalar_add(res, ADDReduce(a, i));
         }
 
         return res;
@@ -4001,7 +4051,7 @@ public class ByteVector128Tests extends AbstractVectorTest {
                 ByteVector av = ByteVector.fromArray(SPECIES, a, i);
                 byte v = av.reduceLanes(VectorOperators.ADD);
                 r[i] = v;
-                ra += v;
+                ra = scalar_add(ra, v);
             }
         }
 
@@ -4014,20 +4064,20 @@ public class ByteVector128Tests extends AbstractVectorTest {
         byte[] a = fa.apply(SPECIES.length());
         byte id = ADD_IDENTITY;
 
-        assertEquals((byte) (id + id), id,
+        assertEquals((byte) (scalar_add(id, id)), id,
                             "ADD(ADD_IDENTITY, ADD_IDENTITY) != ADD_IDENTITY");
 
         byte x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((byte) (id + x), x);
-                assertEquals((byte) (x + id), x);
+                assertEquals((byte) (scalar_add(id, x)), x);
+                assertEquals((byte) (scalar_add(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((byte) (id + x), x,
+            assertEquals((byte) (scalar_add(id, x)), x,
                                 "ADD(ADD_IDENTITY, " + x + ") != " + x);
-            assertEquals((byte) (x + id), x,
+            assertEquals((byte) (scalar_add(x, id)), x,
                                 "ADD(" + x + ", ADD_IDENTITY) != " + x);
         }
     }
@@ -4036,7 +4086,7 @@ public class ByteVector128Tests extends AbstractVectorTest {
         byte res = ADD_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res += a[i];
+                res = scalar_add(res, a[i]);
         }
 
         return res;
@@ -4045,7 +4095,7 @@ public class ByteVector128Tests extends AbstractVectorTest {
     static byte ADDReduceAllMasked(byte[] a, boolean[] mask) {
         byte res = ADD_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduceMasked(a, i, mask);
+            res = scalar_add(res, ADDReduceMasked(a, i, mask));
         }
 
         return res;
@@ -4065,7 +4115,7 @@ public class ByteVector128Tests extends AbstractVectorTest {
                 ByteVector av = ByteVector.fromArray(SPECIES, a, i);
                 byte v = av.reduceLanes(VectorOperators.ADD, vmask);
                 r[i] = v;
-                ra += v;
+                ra = scalar_add(ra, v);
             }
         }
 
@@ -4076,7 +4126,7 @@ public class ByteVector128Tests extends AbstractVectorTest {
     static byte MULReduce(byte[] a, int idx) {
         byte res = MUL_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res *= a[i];
+            res = scalar_mul(res, a[i]);
         }
 
         return res;
@@ -4085,7 +4135,7 @@ public class ByteVector128Tests extends AbstractVectorTest {
     static byte MULReduceAll(byte[] a) {
         byte res = MUL_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res *= MULReduce(a, i);
+            res = scalar_mul(res, MULReduce(a, i));
         }
 
         return res;
@@ -4103,7 +4153,7 @@ public class ByteVector128Tests extends AbstractVectorTest {
                 ByteVector av = ByteVector.fromArray(SPECIES, a, i);
                 byte v = av.reduceLanes(VectorOperators.MUL);
                 r[i] = v;
-                ra *= v;
+                ra = scalar_mul(ra, v);
             }
         }
 
@@ -4116,20 +4166,20 @@ public class ByteVector128Tests extends AbstractVectorTest {
         byte[] a = fa.apply(SPECIES.length());
         byte id = MUL_IDENTITY;
 
-        assertEquals((byte) (id * id), id,
+        assertEquals((byte) (scalar_mul(id, id)), id,
                             "MUL(MUL_IDENTITY, MUL_IDENTITY) != MUL_IDENTITY");
 
         byte x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((byte) (id * x), x);
-                assertEquals((byte) (x * id), x);
+                assertEquals((byte) (scalar_mul(id, x)), x);
+                assertEquals((byte) (scalar_mul(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((byte) (id * x), x,
+            assertEquals((byte) (scalar_mul(id, x)), x,
                                 "MUL(MUL_IDENTITY, " + x + ") != " + x);
-            assertEquals((byte) (x * id), x,
+            assertEquals((byte) (scalar_mul(x, id)), x,
                                 "MUL(" + x + ", MUL_IDENTITY) != " + x);
         }
     }
@@ -4138,7 +4188,7 @@ public class ByteVector128Tests extends AbstractVectorTest {
         byte res = MUL_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res *= a[i];
+                res = scalar_mul(res, a[i]);
         }
 
         return res;
@@ -4147,7 +4197,7 @@ public class ByteVector128Tests extends AbstractVectorTest {
     static byte MULReduceAllMasked(byte[] a, boolean[] mask) {
         byte res = MUL_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res *= MULReduceMasked(a, i, mask);
+            res = scalar_mul(res, MULReduceMasked(a, i, mask));
         }
 
         return res;
@@ -4167,7 +4217,7 @@ public class ByteVector128Tests extends AbstractVectorTest {
                 ByteVector av = ByteVector.fromArray(SPECIES, a, i);
                 byte v = av.reduceLanes(VectorOperators.MUL, vmask);
                 r[i] = v;
-                ra *= v;
+                ra = scalar_mul(ra, v);
             }
         }
 
@@ -4178,7 +4228,7 @@ public class ByteVector128Tests extends AbstractVectorTest {
     static byte MINReduce(byte[] a, int idx) {
         byte res = MIN_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res = (byte) Math.min(res, a[i]);
+            res = scalar_min(res, a[i]);
         }
 
         return res;
@@ -4187,7 +4237,7 @@ public class ByteVector128Tests extends AbstractVectorTest {
     static byte MINReduceAll(byte[] a) {
         byte res = MIN_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (byte) Math.min(res, MINReduce(a, i));
+            res = scalar_min(res, MINReduce(a, i));
         }
 
         return res;
@@ -4205,7 +4255,7 @@ public class ByteVector128Tests extends AbstractVectorTest {
                 ByteVector av = ByteVector.fromArray(SPECIES, a, i);
                 byte v = av.reduceLanes(VectorOperators.MIN);
                 r[i] = v;
-                ra = (byte) Math.min(ra, v);
+                ra = scalar_min(ra, v);
             }
         }
 
@@ -4218,20 +4268,20 @@ public class ByteVector128Tests extends AbstractVectorTest {
         byte[] a = fa.apply(SPECIES.length());
         byte id = MIN_IDENTITY;
 
-        assertEquals((byte) Math.min(id, id), id,
+        assertEquals(scalar_min(id, id), id,
                             "MIN(MIN_IDENTITY, MIN_IDENTITY) != MIN_IDENTITY");
 
         byte x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((byte) Math.min(id, x), x);
-                assertEquals((byte) Math.min(x, id), x);
+                assertEquals(scalar_min(id, x), x);
+                assertEquals(scalar_min(x, id), x);
             }
         } catch (AssertionError e) {
-            assertEquals((byte) Math.min(id, x), x,
+            assertEquals(scalar_min(id, x), x,
                                 "MIN(MIN_IDENTITY, " + x + ") != " + x);
-            assertEquals((byte) Math.min(x, id), x,
+            assertEquals(scalar_min(x, id), x,
                                 "MIN(" + x + ", MIN_IDENTITY) != " + x);
         }
     }
@@ -4240,7 +4290,7 @@ public class ByteVector128Tests extends AbstractVectorTest {
         byte res = MIN_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res = (byte) Math.min(res, a[i]);
+                res = scalar_min(res, a[i]);
         }
 
         return res;
@@ -4249,7 +4299,7 @@ public class ByteVector128Tests extends AbstractVectorTest {
     static byte MINReduceAllMasked(byte[] a, boolean[] mask) {
         byte res = MIN_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (byte) Math.min(res, MINReduceMasked(a, i, mask));
+            res = scalar_min(res, MINReduceMasked(a, i, mask));
         }
 
         return res;
@@ -4269,7 +4319,7 @@ public class ByteVector128Tests extends AbstractVectorTest {
                 ByteVector av = ByteVector.fromArray(SPECIES, a, i);
                 byte v = av.reduceLanes(VectorOperators.MIN, vmask);
                 r[i] = v;
-                ra = (byte) Math.min(ra, v);
+                ra = scalar_min(ra, v);
             }
         }
 
@@ -4280,7 +4330,7 @@ public class ByteVector128Tests extends AbstractVectorTest {
     static byte MAXReduce(byte[] a, int idx) {
         byte res = MAX_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res = (byte) Math.max(res, a[i]);
+            res = scalar_max(res, a[i]);
         }
 
         return res;
@@ -4289,7 +4339,7 @@ public class ByteVector128Tests extends AbstractVectorTest {
     static byte MAXReduceAll(byte[] a) {
         byte res = MAX_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (byte) Math.max(res, MAXReduce(a, i));
+            res = scalar_max(res, MAXReduce(a, i));
         }
 
         return res;
@@ -4307,7 +4357,7 @@ public class ByteVector128Tests extends AbstractVectorTest {
                 ByteVector av = ByteVector.fromArray(SPECIES, a, i);
                 byte v = av.reduceLanes(VectorOperators.MAX);
                 r[i] = v;
-                ra = (byte) Math.max(ra, v);
+                ra = scalar_max(ra, v);
             }
         }
 
@@ -4320,20 +4370,20 @@ public class ByteVector128Tests extends AbstractVectorTest {
         byte[] a = fa.apply(SPECIES.length());
         byte id = MAX_IDENTITY;
 
-        assertEquals((byte) Math.max(id, id), id,
+        assertEquals(scalar_max(id, id), id,
                             "MAX(MAX_IDENTITY, MAX_IDENTITY) != MAX_IDENTITY");
 
         byte x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((byte) Math.max(id, x), x);
-                assertEquals((byte) Math.max(x, id), x);
+                assertEquals(scalar_max(id, x), x);
+                assertEquals(scalar_max(x, id), x);
             }
         } catch (AssertionError e) {
-            assertEquals((byte) Math.max(id, x), x,
+            assertEquals(scalar_max(id, x), x,
                                 "MAX(MAX_IDENTITY, " + x + ") != " + x);
-            assertEquals((byte) Math.max(x, id), x,
+            assertEquals(scalar_max(x, id), x,
                                 "MAX(" + x + ", MAX_IDENTITY) != " + x);
         }
     }
@@ -4342,7 +4392,7 @@ public class ByteVector128Tests extends AbstractVectorTest {
         byte res = MAX_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res = (byte) Math.max(res, a[i]);
+                res = scalar_max(res, a[i]);
         }
 
         return res;
@@ -4351,7 +4401,7 @@ public class ByteVector128Tests extends AbstractVectorTest {
     static byte MAXReduceAllMasked(byte[] a, boolean[] mask) {
         byte res = MAX_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (byte) Math.max(res, MAXReduceMasked(a, i, mask));
+            res = scalar_max(res, MAXReduceMasked(a, i, mask));
         }
 
         return res;
@@ -4371,7 +4421,7 @@ public class ByteVector128Tests extends AbstractVectorTest {
                 ByteVector av = ByteVector.fromArray(SPECIES, a, i);
                 byte v = av.reduceLanes(VectorOperators.MAX, vmask);
                 r[i] = v;
-                ra = (byte) Math.max(ra, v);
+                ra = scalar_max(ra, v);
             }
         }
 
@@ -5404,7 +5454,7 @@ public class ByteVector128Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] < b[i]);
+                assertEquals(mv.laneIsSet(j), lt(a[i + j], b[i]));
             }
         }
     }
@@ -5424,7 +5474,7 @@ public class ByteVector128Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] < b[i]));
+                assertEquals(mv.laneIsSet(j), mask[j] && (lt(a[i + j], b[i])));
             }
         }
     }
@@ -5440,7 +5490,7 @@ public class ByteVector128Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] < (byte)((long)b[i]));
+                assertEquals(mv.laneIsSet(j), lt(a[i + j], (byte)((long)b[i])));
             }
         }
     }
@@ -5460,7 +5510,7 @@ public class ByteVector128Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] < (byte)((long)b[i])));
+                assertEquals(mv.laneIsSet(j), mask[j] && (lt(a[i + j], (byte)((long)b[i]))));
             }
         }
     }
@@ -5476,7 +5526,7 @@ public class ByteVector128Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] == b[i]);
+                assertEquals(mv.laneIsSet(j), eq(a[i + j], b[i]));
             }
         }
     }
@@ -5496,7 +5546,7 @@ public class ByteVector128Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] == b[i]));
+                assertEquals(mv.laneIsSet(j), mask[j] && (eq(a[i + j], b[i])));
             }
         }
     }
@@ -5512,7 +5562,7 @@ public class ByteVector128Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] == (byte)((long)b[i]));
+                assertEquals(mv.laneIsSet(j), eq(a[i + j], (byte)((long)b[i])));
             }
         }
     }
@@ -5532,7 +5582,7 @@ public class ByteVector128Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] == (byte)((long)b[i])));
+                assertEquals(mv.laneIsSet(j), mask[j] && (eq(a[i + j], (byte)((long)b[i]))));
             }
         }
     }
@@ -6244,11 +6294,11 @@ public class ByteVector128Tests extends AbstractVectorTest {
     }
 
     static byte NEG(byte a) {
-        return (byte)(-((byte)a));
+        return (byte)(scalar_neg((byte)a));
     }
 
     static byte neg(byte a) {
-        return (byte)(-((byte)a));
+        return (byte)(scalar_neg((byte)a));
     }
 
     @Test(dataProvider = "byteUnaryOpProvider")
@@ -6300,11 +6350,11 @@ public class ByteVector128Tests extends AbstractVectorTest {
     }
 
     static byte ABS(byte a) {
-        return (byte)(Math.abs((byte)a));
+        return (byte)(scalar_abs((byte)a));
     }
 
     static byte abs(byte a) {
-        return (byte)(Math.abs((byte)a));
+        return (byte)(scalar_abs((byte)a));
     }
 
     @Test(dataProvider = "byteUnaryOpProvider")
@@ -6795,7 +6845,7 @@ public class ByteVector128Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] < b[i]);
+                assertEquals(mv.laneIsSet(j), lt(a[i + j], b[i]));
             }
         }
     }
@@ -6811,7 +6861,7 @@ public class ByteVector128Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] == b[i]);
+                assertEquals(mv.laneIsSet(j), eq(a[i + j], b[i]));
             }
         }
     }
@@ -6891,7 +6941,7 @@ public class ByteVector128Tests extends AbstractVectorTest {
     static long ADDReduceLong(byte[] a, int idx) {
         byte res = 0;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res += a[i];
+            res = scalar_add(res, a[i]);
         }
 
         return (long)res;
@@ -6900,7 +6950,7 @@ public class ByteVector128Tests extends AbstractVectorTest {
     static long ADDReduceAllLong(byte[] a) {
         long res = 0;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduceLong(a, i);
+            res = (long)scalar_add((byte)res, (byte)ADDReduceLong(a, i));
         }
 
         return res;
@@ -6918,8 +6968,8 @@ public class ByteVector128Tests extends AbstractVectorTest {
         }
 
         ra = 0;
-        for (int i = 0; i < a.length; i ++) {
-            ra += r[i];
+        for (int i = 0; i < a.length; i++) {
+            ra = (long)scalar_add((byte)ra, (byte)r[i]);
         }
 
         assertReductionLongArraysEquals(r, ra, a,
@@ -6929,8 +6979,9 @@ public class ByteVector128Tests extends AbstractVectorTest {
     static long ADDReduceLongMasked(byte[] a, int idx, boolean[] mask) {
         byte res = 0;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            if(mask[i % SPECIES.length()])
-                res += a[i];
+            if (mask[i % SPECIES.length()]) {
+                res = scalar_add(res, a[i]);
+            }
         }
 
         return (long)res;
@@ -6939,7 +6990,7 @@ public class ByteVector128Tests extends AbstractVectorTest {
     static long ADDReduceAllLongMasked(byte[] a, boolean[] mask) {
         long res = 0;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduceLongMasked(a, i, mask);
+            res = (long)scalar_add((byte)res, (byte)ADDReduceLongMasked(a, i, mask));
         }
 
         return res;
@@ -6959,8 +7010,8 @@ public class ByteVector128Tests extends AbstractVectorTest {
         }
 
         ra = 0;
-        for (int i = 0; i < a.length; i ++) {
-            ra += r[i];
+        for (int i = 0; i < a.length; i++) {
+            ra = (long)scalar_add((byte)ra, (byte)r[i]);
         }
 
         assertReductionLongArraysEqualsMasked(r, ra, a, mask,
diff --git a/test/jdk/jdk/incubator/vector/ByteVector256Tests.java b/test/jdk/jdk/incubator/vector/ByteVector256Tests.java
index 1173a4b7783..5c32d4a7f74 100644
--- a/test/jdk/jdk/incubator/vector/ByteVector256Tests.java
+++ b/test/jdk/jdk/incubator/vector/ByteVector256Tests.java
@@ -1574,6 +1574,59 @@ public class ByteVector256Tests extends AbstractVectorTest {
         return a >= b;
     }
 
+    static byte firstNonZero(byte a, byte b) {
+        return Byte.compare(a, (byte) 0) != 0 ? a : b;
+    }
+
+    static byte scalar_or(byte a, byte b) {
+        return (byte)(a | b);
+    }
+
+    static byte scalar_and(byte a, byte b) {
+        return (byte)(a & b);
+    }
+
+    static byte scalar_xor(byte a, byte b) {
+        return (byte)(a ^ b);
+    }
+
+    static byte scalar_add(byte a, byte b) {
+        return (byte)(a + b);
+    }
+
+    static byte scalar_sub(byte a, byte b) {
+        return (byte)(a - b);
+    }
+
+    static byte scalar_mul(byte a, byte b) {
+        return (byte)(a * b);
+    }
+
+    static byte scalar_min(byte a, byte b) {
+        return (byte)(Math.min(a, b));
+    }
+
+    static byte scalar_max(byte a, byte b) {
+        return (byte)(Math.max(a, b));
+    }
+
+    static byte scalar_div(byte a, byte b) {
+        return (byte)(a / b);
+    }
+
+    static byte scalar_fma(byte a, byte b, byte c) {
+        return (byte)(Math.fma(a, b, c));
+    }
+
+    static byte scalar_abs(byte a) {
+        return (byte)(Math.abs(a));
+    }
+
+    static byte scalar_neg(byte a) {
+        return ((byte)-a);
+    }
+
+
     static boolean ult(byte a, byte b) {
         return Byte.compareUnsigned(a, b) < 0;
     }
@@ -1590,9 +1643,6 @@ public class ByteVector256Tests extends AbstractVectorTest {
         return Byte.compareUnsigned(a, b) >= 0;
     }
 
-    static byte firstNonZero(byte a, byte b) {
-        return Byte.compare(a, (byte) 0) != 0 ? a : b;
-    }
 
     @Test
     static void smokeTest1() {
@@ -1701,7 +1751,7 @@ public class ByteVector256Tests extends AbstractVectorTest {
     }
 
     static byte ADD(byte a, byte b) {
-        return (byte)(a + b);
+        return (byte)(scalar_add(a, b));
     }
 
     @Test(dataProvider = "byteBinaryOpProvider")
@@ -1722,7 +1772,7 @@ public class ByteVector256Tests extends AbstractVectorTest {
     }
 
     static byte add(byte a, byte b) {
-        return (byte)(a + b);
+        return (byte)(scalar_add(a, b));
     }
 
     @Test(dataProvider = "byteBinaryOpProvider")
@@ -1779,7 +1829,7 @@ public class ByteVector256Tests extends AbstractVectorTest {
     }
 
     static byte SUB(byte a, byte b) {
-        return (byte)(a - b);
+        return (byte)(scalar_sub(a, b));
     }
 
     @Test(dataProvider = "byteBinaryOpProvider")
@@ -1800,7 +1850,7 @@ public class ByteVector256Tests extends AbstractVectorTest {
     }
 
     static byte sub(byte a, byte b) {
-        return (byte)(a - b);
+        return (byte)(scalar_sub(a, b));
     }
 
     @Test(dataProvider = "byteBinaryOpProvider")
@@ -1857,7 +1907,7 @@ public class ByteVector256Tests extends AbstractVectorTest {
     }
 
     static byte MUL(byte a, byte b) {
-        return (byte)(a * b);
+        return (byte)(scalar_mul(a, b));
     }
 
     @Test(dataProvider = "byteBinaryOpProvider")
@@ -1878,7 +1928,7 @@ public class ByteVector256Tests extends AbstractVectorTest {
     }
 
     static byte mul(byte a, byte b) {
-        return (byte)(a * b);
+        return (byte)(scalar_mul(a, b));
     }
 
     @Test(dataProvider = "byteBinaryOpProvider")
@@ -2025,7 +2075,7 @@ public class ByteVector256Tests extends AbstractVectorTest {
     }
 
     static byte FIRST_NONZERO(byte a, byte b) {
-        return (byte)((a)!=0?a:b);
+        return (byte)(firstNonZero(a, b));
     }
 
     @Test(dataProvider = "byteBinaryOpProvider")
@@ -3239,7 +3289,7 @@ public class ByteVector256Tests extends AbstractVectorTest {
     }
 
     static byte MIN(byte a, byte b) {
-        return (byte)(Math.min(a, b));
+        return (byte)(scalar_min(a, b));
     }
 
     @Test(dataProvider = "byteBinaryOpProvider")
@@ -3260,7 +3310,7 @@ public class ByteVector256Tests extends AbstractVectorTest {
     }
 
     static byte min(byte a, byte b) {
-        return (byte)(Math.min(a, b));
+        return (byte)(scalar_min(a, b));
     }
 
     @Test(dataProvider = "byteBinaryOpProvider")
@@ -3279,7 +3329,7 @@ public class ByteVector256Tests extends AbstractVectorTest {
     }
 
     static byte MAX(byte a, byte b) {
-        return (byte)(Math.max(a, b));
+        return (byte)(scalar_max(a, b));
     }
 
     @Test(dataProvider = "byteBinaryOpProvider")
@@ -3300,7 +3350,7 @@ public class ByteVector256Tests extends AbstractVectorTest {
     }
 
     static byte max(byte a, byte b) {
-        return (byte)(Math.max(a, b));
+        return (byte)(scalar_max(a, b));
     }
 
     @Test(dataProvider = "byteBinaryOpProvider")
@@ -3668,7 +3718,7 @@ public class ByteVector256Tests extends AbstractVectorTest {
     static byte ANDReduce(byte[] a, int idx) {
         byte res = AND_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res &= a[i];
+            res = scalar_and(res, a[i]);
         }
 
         return res;
@@ -3677,7 +3727,7 @@ public class ByteVector256Tests extends AbstractVectorTest {
     static byte ANDReduceAll(byte[] a) {
         byte res = AND_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res &= ANDReduce(a, i);
+            res = scalar_and(res, ANDReduce(a, i));
         }
 
         return res;
@@ -3695,7 +3745,7 @@ public class ByteVector256Tests extends AbstractVectorTest {
                 ByteVector av = ByteVector.fromArray(SPECIES, a, i);
                 byte v = av.reduceLanes(VectorOperators.AND);
                 r[i] = v;
-                ra &= v;
+                ra = scalar_and(ra, v);
             }
         }
 
@@ -3708,20 +3758,20 @@ public class ByteVector256Tests extends AbstractVectorTest {
         byte[] a = fa.apply(SPECIES.length());
         byte id = AND_IDENTITY;
 
-        assertEquals((byte) (id & id), id,
+        assertEquals((byte) (scalar_and(id, id)), id,
                             "AND(AND_IDENTITY, AND_IDENTITY) != AND_IDENTITY");
 
         byte x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((byte) (id & x), x);
-                assertEquals((byte) (x & id), x);
+                assertEquals((byte) (scalar_and(id, x)), x);
+                assertEquals((byte) (scalar_and(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((byte) (id & x), x,
+            assertEquals((byte) (scalar_and(id, x)), x,
                                 "AND(AND_IDENTITY, " + x + ") != " + x);
-            assertEquals((byte) (x & id), x,
+            assertEquals((byte) (scalar_and(x, id)), x,
                                 "AND(" + x + ", AND_IDENTITY) != " + x);
         }
     }
@@ -3730,7 +3780,7 @@ public class ByteVector256Tests extends AbstractVectorTest {
         byte res = AND_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res &= a[i];
+                res = scalar_and(res, a[i]);
         }
 
         return res;
@@ -3739,7 +3789,7 @@ public class ByteVector256Tests extends AbstractVectorTest {
     static byte ANDReduceAllMasked(byte[] a, boolean[] mask) {
         byte res = AND_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res &= ANDReduceMasked(a, i, mask);
+            res = scalar_and(res, ANDReduceMasked(a, i, mask));
         }
 
         return res;
@@ -3759,7 +3809,7 @@ public class ByteVector256Tests extends AbstractVectorTest {
                 ByteVector av = ByteVector.fromArray(SPECIES, a, i);
                 byte v = av.reduceLanes(VectorOperators.AND, vmask);
                 r[i] = v;
-                ra &= v;
+                ra = scalar_and(ra, v);
             }
         }
 
@@ -3770,7 +3820,7 @@ public class ByteVector256Tests extends AbstractVectorTest {
     static byte ORReduce(byte[] a, int idx) {
         byte res = OR_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res |= a[i];
+            res = scalar_or(res, a[i]);
         }
 
         return res;
@@ -3779,7 +3829,7 @@ public class ByteVector256Tests extends AbstractVectorTest {
     static byte ORReduceAll(byte[] a) {
         byte res = OR_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res |= ORReduce(a, i);
+            res = scalar_or(res, ORReduce(a, i));
         }
 
         return res;
@@ -3797,7 +3847,7 @@ public class ByteVector256Tests extends AbstractVectorTest {
                 ByteVector av = ByteVector.fromArray(SPECIES, a, i);
                 byte v = av.reduceLanes(VectorOperators.OR);
                 r[i] = v;
-                ra |= v;
+                ra = scalar_or(ra, v);
             }
         }
 
@@ -3810,20 +3860,20 @@ public class ByteVector256Tests extends AbstractVectorTest {
         byte[] a = fa.apply(SPECIES.length());
         byte id = OR_IDENTITY;
 
-        assertEquals((byte) (id | id), id,
+        assertEquals((byte) (scalar_or(id, id)), id,
                             "OR(OR_IDENTITY, OR_IDENTITY) != OR_IDENTITY");
 
         byte x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((byte) (id | x), x);
-                assertEquals((byte) (x | id), x);
+                assertEquals((byte) (scalar_or(id, x)), x);
+                assertEquals((byte) (scalar_or(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((byte) (id | x), x,
+            assertEquals((byte) (scalar_or(id, x)), x,
                                 "OR(OR_IDENTITY, " + x + ") != " + x);
-            assertEquals((byte) (x | id), x,
+            assertEquals((byte) (scalar_or(x, id)), x,
                                 "OR(" + x + ", OR_IDENTITY) != " + x);
         }
     }
@@ -3832,7 +3882,7 @@ public class ByteVector256Tests extends AbstractVectorTest {
         byte res = OR_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res |= a[i];
+                res = scalar_or(res, a[i]);
         }
 
         return res;
@@ -3841,7 +3891,7 @@ public class ByteVector256Tests extends AbstractVectorTest {
     static byte ORReduceAllMasked(byte[] a, boolean[] mask) {
         byte res = OR_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res |= ORReduceMasked(a, i, mask);
+            res = scalar_or(res, ORReduceMasked(a, i, mask));
         }
 
         return res;
@@ -3861,7 +3911,7 @@ public class ByteVector256Tests extends AbstractVectorTest {
                 ByteVector av = ByteVector.fromArray(SPECIES, a, i);
                 byte v = av.reduceLanes(VectorOperators.OR, vmask);
                 r[i] = v;
-                ra |= v;
+                ra = scalar_or(ra, v);
             }
         }
 
@@ -3872,7 +3922,7 @@ public class ByteVector256Tests extends AbstractVectorTest {
     static byte XORReduce(byte[] a, int idx) {
         byte res = XOR_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res ^= a[i];
+            res = scalar_xor(res, a[i]);
         }
 
         return res;
@@ -3881,7 +3931,7 @@ public class ByteVector256Tests extends AbstractVectorTest {
     static byte XORReduceAll(byte[] a) {
         byte res = XOR_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res ^= XORReduce(a, i);
+            res = scalar_xor(res, XORReduce(a, i));
         }
 
         return res;
@@ -3899,7 +3949,7 @@ public class ByteVector256Tests extends AbstractVectorTest {
                 ByteVector av = ByteVector.fromArray(SPECIES, a, i);
                 byte v = av.reduceLanes(VectorOperators.XOR);
                 r[i] = v;
-                ra ^= v;
+                ra = scalar_xor(ra, v);
             }
         }
 
@@ -3912,20 +3962,20 @@ public class ByteVector256Tests extends AbstractVectorTest {
         byte[] a = fa.apply(SPECIES.length());
         byte id = XOR_IDENTITY;
 
-        assertEquals((byte) (id ^ id), id,
+        assertEquals((byte) (scalar_xor(id, id)), id,
                             "XOR(XOR_IDENTITY, XOR_IDENTITY) != XOR_IDENTITY");
 
         byte x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((byte) (id ^ x), x);
-                assertEquals((byte) (x ^ id), x);
+                assertEquals((byte) (scalar_xor(id, x)), x);
+                assertEquals((byte) (scalar_xor(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((byte) (id ^ x), x,
+            assertEquals((byte) (scalar_xor(id, x)), x,
                                 "XOR(XOR_IDENTITY, " + x + ") != " + x);
-            assertEquals((byte) (x ^ id), x,
+            assertEquals((byte) (scalar_xor(x, id)), x,
                                 "XOR(" + x + ", XOR_IDENTITY) != " + x);
         }
     }
@@ -3934,7 +3984,7 @@ public class ByteVector256Tests extends AbstractVectorTest {
         byte res = XOR_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res ^= a[i];
+                res = scalar_xor(res, a[i]);
         }
 
         return res;
@@ -3943,7 +3993,7 @@ public class ByteVector256Tests extends AbstractVectorTest {
     static byte XORReduceAllMasked(byte[] a, boolean[] mask) {
         byte res = XOR_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res ^= XORReduceMasked(a, i, mask);
+            res = scalar_xor(res, XORReduceMasked(a, i, mask));
         }
 
         return res;
@@ -3963,7 +4013,7 @@ public class ByteVector256Tests extends AbstractVectorTest {
                 ByteVector av = ByteVector.fromArray(SPECIES, a, i);
                 byte v = av.reduceLanes(VectorOperators.XOR, vmask);
                 r[i] = v;
-                ra ^= v;
+                ra = scalar_xor(ra, v);
             }
         }
 
@@ -3974,7 +4024,7 @@ public class ByteVector256Tests extends AbstractVectorTest {
     static byte ADDReduce(byte[] a, int idx) {
         byte res = ADD_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res += a[i];
+            res = scalar_add(res, a[i]);
         }
 
         return res;
@@ -3983,7 +4033,7 @@ public class ByteVector256Tests extends AbstractVectorTest {
     static byte ADDReduceAll(byte[] a) {
         byte res = ADD_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduce(a, i);
+            res = scalar_add(res, ADDReduce(a, i));
         }
 
         return res;
@@ -4001,7 +4051,7 @@ public class ByteVector256Tests extends AbstractVectorTest {
                 ByteVector av = ByteVector.fromArray(SPECIES, a, i);
                 byte v = av.reduceLanes(VectorOperators.ADD);
                 r[i] = v;
-                ra += v;
+                ra = scalar_add(ra, v);
             }
         }
 
@@ -4014,20 +4064,20 @@ public class ByteVector256Tests extends AbstractVectorTest {
         byte[] a = fa.apply(SPECIES.length());
         byte id = ADD_IDENTITY;
 
-        assertEquals((byte) (id + id), id,
+        assertEquals((byte) (scalar_add(id, id)), id,
                             "ADD(ADD_IDENTITY, ADD_IDENTITY) != ADD_IDENTITY");
 
         byte x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((byte) (id + x), x);
-                assertEquals((byte) (x + id), x);
+                assertEquals((byte) (scalar_add(id, x)), x);
+                assertEquals((byte) (scalar_add(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((byte) (id + x), x,
+            assertEquals((byte) (scalar_add(id, x)), x,
                                 "ADD(ADD_IDENTITY, " + x + ") != " + x);
-            assertEquals((byte) (x + id), x,
+            assertEquals((byte) (scalar_add(x, id)), x,
                                 "ADD(" + x + ", ADD_IDENTITY) != " + x);
         }
     }
@@ -4036,7 +4086,7 @@ public class ByteVector256Tests extends AbstractVectorTest {
         byte res = ADD_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res += a[i];
+                res = scalar_add(res, a[i]);
         }
 
         return res;
@@ -4045,7 +4095,7 @@ public class ByteVector256Tests extends AbstractVectorTest {
     static byte ADDReduceAllMasked(byte[] a, boolean[] mask) {
         byte res = ADD_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduceMasked(a, i, mask);
+            res = scalar_add(res, ADDReduceMasked(a, i, mask));
         }
 
         return res;
@@ -4065,7 +4115,7 @@ public class ByteVector256Tests extends AbstractVectorTest {
                 ByteVector av = ByteVector.fromArray(SPECIES, a, i);
                 byte v = av.reduceLanes(VectorOperators.ADD, vmask);
                 r[i] = v;
-                ra += v;
+                ra = scalar_add(ra, v);
             }
         }
 
@@ -4076,7 +4126,7 @@ public class ByteVector256Tests extends AbstractVectorTest {
     static byte MULReduce(byte[] a, int idx) {
         byte res = MUL_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res *= a[i];
+            res = scalar_mul(res, a[i]);
         }
 
         return res;
@@ -4085,7 +4135,7 @@ public class ByteVector256Tests extends AbstractVectorTest {
     static byte MULReduceAll(byte[] a) {
         byte res = MUL_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res *= MULReduce(a, i);
+            res = scalar_mul(res, MULReduce(a, i));
         }
 
         return res;
@@ -4103,7 +4153,7 @@ public class ByteVector256Tests extends AbstractVectorTest {
                 ByteVector av = ByteVector.fromArray(SPECIES, a, i);
                 byte v = av.reduceLanes(VectorOperators.MUL);
                 r[i] = v;
-                ra *= v;
+                ra = scalar_mul(ra, v);
             }
         }
 
@@ -4116,20 +4166,20 @@ public class ByteVector256Tests extends AbstractVectorTest {
         byte[] a = fa.apply(SPECIES.length());
         byte id = MUL_IDENTITY;
 
-        assertEquals((byte) (id * id), id,
+        assertEquals((byte) (scalar_mul(id, id)), id,
                             "MUL(MUL_IDENTITY, MUL_IDENTITY) != MUL_IDENTITY");
 
         byte x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((byte) (id * x), x);
-                assertEquals((byte) (x * id), x);
+                assertEquals((byte) (scalar_mul(id, x)), x);
+                assertEquals((byte) (scalar_mul(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((byte) (id * x), x,
+            assertEquals((byte) (scalar_mul(id, x)), x,
                                 "MUL(MUL_IDENTITY, " + x + ") != " + x);
-            assertEquals((byte) (x * id), x,
+            assertEquals((byte) (scalar_mul(x, id)), x,
                                 "MUL(" + x + ", MUL_IDENTITY) != " + x);
         }
     }
@@ -4138,7 +4188,7 @@ public class ByteVector256Tests extends AbstractVectorTest {
         byte res = MUL_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res *= a[i];
+                res = scalar_mul(res, a[i]);
         }
 
         return res;
@@ -4147,7 +4197,7 @@ public class ByteVector256Tests extends AbstractVectorTest {
     static byte MULReduceAllMasked(byte[] a, boolean[] mask) {
         byte res = MUL_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res *= MULReduceMasked(a, i, mask);
+            res = scalar_mul(res, MULReduceMasked(a, i, mask));
         }
 
         return res;
@@ -4167,7 +4217,7 @@ public class ByteVector256Tests extends AbstractVectorTest {
                 ByteVector av = ByteVector.fromArray(SPECIES, a, i);
                 byte v = av.reduceLanes(VectorOperators.MUL, vmask);
                 r[i] = v;
-                ra *= v;
+                ra = scalar_mul(ra, v);
             }
         }
 
@@ -4178,7 +4228,7 @@ public class ByteVector256Tests extends AbstractVectorTest {
     static byte MINReduce(byte[] a, int idx) {
         byte res = MIN_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res = (byte) Math.min(res, a[i]);
+            res = scalar_min(res, a[i]);
         }
 
         return res;
@@ -4187,7 +4237,7 @@ public class ByteVector256Tests extends AbstractVectorTest {
     static byte MINReduceAll(byte[] a) {
         byte res = MIN_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (byte) Math.min(res, MINReduce(a, i));
+            res = scalar_min(res, MINReduce(a, i));
         }
 
         return res;
@@ -4205,7 +4255,7 @@ public class ByteVector256Tests extends AbstractVectorTest {
                 ByteVector av = ByteVector.fromArray(SPECIES, a, i);
                 byte v = av.reduceLanes(VectorOperators.MIN);
                 r[i] = v;
-                ra = (byte) Math.min(ra, v);
+                ra = scalar_min(ra, v);
             }
         }
 
@@ -4218,20 +4268,20 @@ public class ByteVector256Tests extends AbstractVectorTest {
         byte[] a = fa.apply(SPECIES.length());
         byte id = MIN_IDENTITY;
 
-        assertEquals((byte) Math.min(id, id), id,
+        assertEquals(scalar_min(id, id), id,
                             "MIN(MIN_IDENTITY, MIN_IDENTITY) != MIN_IDENTITY");
 
         byte x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((byte) Math.min(id, x), x);
-                assertEquals((byte) Math.min(x, id), x);
+                assertEquals(scalar_min(id, x), x);
+                assertEquals(scalar_min(x, id), x);
             }
         } catch (AssertionError e) {
-            assertEquals((byte) Math.min(id, x), x,
+            assertEquals(scalar_min(id, x), x,
                                 "MIN(MIN_IDENTITY, " + x + ") != " + x);
-            assertEquals((byte) Math.min(x, id), x,
+            assertEquals(scalar_min(x, id), x,
                                 "MIN(" + x + ", MIN_IDENTITY) != " + x);
         }
     }
@@ -4240,7 +4290,7 @@ public class ByteVector256Tests extends AbstractVectorTest {
         byte res = MIN_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res = (byte) Math.min(res, a[i]);
+                res = scalar_min(res, a[i]);
         }
 
         return res;
@@ -4249,7 +4299,7 @@ public class ByteVector256Tests extends AbstractVectorTest {
     static byte MINReduceAllMasked(byte[] a, boolean[] mask) {
         byte res = MIN_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (byte) Math.min(res, MINReduceMasked(a, i, mask));
+            res = scalar_min(res, MINReduceMasked(a, i, mask));
         }
 
         return res;
@@ -4269,7 +4319,7 @@ public class ByteVector256Tests extends AbstractVectorTest {
                 ByteVector av = ByteVector.fromArray(SPECIES, a, i);
                 byte v = av.reduceLanes(VectorOperators.MIN, vmask);
                 r[i] = v;
-                ra = (byte) Math.min(ra, v);
+                ra = scalar_min(ra, v);
             }
         }
 
@@ -4280,7 +4330,7 @@ public class ByteVector256Tests extends AbstractVectorTest {
     static byte MAXReduce(byte[] a, int idx) {
         byte res = MAX_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res = (byte) Math.max(res, a[i]);
+            res = scalar_max(res, a[i]);
         }
 
         return res;
@@ -4289,7 +4339,7 @@ public class ByteVector256Tests extends AbstractVectorTest {
     static byte MAXReduceAll(byte[] a) {
         byte res = MAX_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (byte) Math.max(res, MAXReduce(a, i));
+            res = scalar_max(res, MAXReduce(a, i));
         }
 
         return res;
@@ -4307,7 +4357,7 @@ public class ByteVector256Tests extends AbstractVectorTest {
                 ByteVector av = ByteVector.fromArray(SPECIES, a, i);
                 byte v = av.reduceLanes(VectorOperators.MAX);
                 r[i] = v;
-                ra = (byte) Math.max(ra, v);
+                ra = scalar_max(ra, v);
             }
         }
 
@@ -4320,20 +4370,20 @@ public class ByteVector256Tests extends AbstractVectorTest {
         byte[] a = fa.apply(SPECIES.length());
         byte id = MAX_IDENTITY;
 
-        assertEquals((byte) Math.max(id, id), id,
+        assertEquals(scalar_max(id, id), id,
                             "MAX(MAX_IDENTITY, MAX_IDENTITY) != MAX_IDENTITY");
 
         byte x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((byte) Math.max(id, x), x);
-                assertEquals((byte) Math.max(x, id), x);
+                assertEquals(scalar_max(id, x), x);
+                assertEquals(scalar_max(x, id), x);
             }
         } catch (AssertionError e) {
-            assertEquals((byte) Math.max(id, x), x,
+            assertEquals(scalar_max(id, x), x,
                                 "MAX(MAX_IDENTITY, " + x + ") != " + x);
-            assertEquals((byte) Math.max(x, id), x,
+            assertEquals(scalar_max(x, id), x,
                                 "MAX(" + x + ", MAX_IDENTITY) != " + x);
         }
     }
@@ -4342,7 +4392,7 @@ public class ByteVector256Tests extends AbstractVectorTest {
         byte res = MAX_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res = (byte) Math.max(res, a[i]);
+                res = scalar_max(res, a[i]);
         }
 
         return res;
@@ -4351,7 +4401,7 @@ public class ByteVector256Tests extends AbstractVectorTest {
     static byte MAXReduceAllMasked(byte[] a, boolean[] mask) {
         byte res = MAX_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (byte) Math.max(res, MAXReduceMasked(a, i, mask));
+            res = scalar_max(res, MAXReduceMasked(a, i, mask));
         }
 
         return res;
@@ -4371,7 +4421,7 @@ public class ByteVector256Tests extends AbstractVectorTest {
                 ByteVector av = ByteVector.fromArray(SPECIES, a, i);
                 byte v = av.reduceLanes(VectorOperators.MAX, vmask);
                 r[i] = v;
-                ra = (byte) Math.max(ra, v);
+                ra = scalar_max(ra, v);
             }
         }
 
@@ -5404,7 +5454,7 @@ public class ByteVector256Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] < b[i]);
+                assertEquals(mv.laneIsSet(j), lt(a[i + j], b[i]));
             }
         }
     }
@@ -5424,7 +5474,7 @@ public class ByteVector256Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] < b[i]));
+                assertEquals(mv.laneIsSet(j), mask[j] && (lt(a[i + j], b[i])));
             }
         }
     }
@@ -5440,7 +5490,7 @@ public class ByteVector256Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] < (byte)((long)b[i]));
+                assertEquals(mv.laneIsSet(j), lt(a[i + j], (byte)((long)b[i])));
             }
         }
     }
@@ -5460,7 +5510,7 @@ public class ByteVector256Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] < (byte)((long)b[i])));
+                assertEquals(mv.laneIsSet(j), mask[j] && (lt(a[i + j], (byte)((long)b[i]))));
             }
         }
     }
@@ -5476,7 +5526,7 @@ public class ByteVector256Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] == b[i]);
+                assertEquals(mv.laneIsSet(j), eq(a[i + j], b[i]));
             }
         }
     }
@@ -5496,7 +5546,7 @@ public class ByteVector256Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] == b[i]));
+                assertEquals(mv.laneIsSet(j), mask[j] && (eq(a[i + j], b[i])));
             }
         }
     }
@@ -5512,7 +5562,7 @@ public class ByteVector256Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] == (byte)((long)b[i]));
+                assertEquals(mv.laneIsSet(j), eq(a[i + j], (byte)((long)b[i])));
             }
         }
     }
@@ -5532,7 +5582,7 @@ public class ByteVector256Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] == (byte)((long)b[i])));
+                assertEquals(mv.laneIsSet(j), mask[j] && (eq(a[i + j], (byte)((long)b[i]))));
             }
         }
     }
@@ -6244,11 +6294,11 @@ public class ByteVector256Tests extends AbstractVectorTest {
     }
 
     static byte NEG(byte a) {
-        return (byte)(-((byte)a));
+        return (byte)(scalar_neg((byte)a));
     }
 
     static byte neg(byte a) {
-        return (byte)(-((byte)a));
+        return (byte)(scalar_neg((byte)a));
     }
 
     @Test(dataProvider = "byteUnaryOpProvider")
@@ -6300,11 +6350,11 @@ public class ByteVector256Tests extends AbstractVectorTest {
     }
 
     static byte ABS(byte a) {
-        return (byte)(Math.abs((byte)a));
+        return (byte)(scalar_abs((byte)a));
     }
 
     static byte abs(byte a) {
-        return (byte)(Math.abs((byte)a));
+        return (byte)(scalar_abs((byte)a));
     }
 
     @Test(dataProvider = "byteUnaryOpProvider")
@@ -6795,7 +6845,7 @@ public class ByteVector256Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] < b[i]);
+                assertEquals(mv.laneIsSet(j), lt(a[i + j], b[i]));
             }
         }
     }
@@ -6811,7 +6861,7 @@ public class ByteVector256Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] == b[i]);
+                assertEquals(mv.laneIsSet(j), eq(a[i + j], b[i]));
             }
         }
     }
@@ -6891,7 +6941,7 @@ public class ByteVector256Tests extends AbstractVectorTest {
     static long ADDReduceLong(byte[] a, int idx) {
         byte res = 0;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res += a[i];
+            res = scalar_add(res, a[i]);
         }
 
         return (long)res;
@@ -6900,7 +6950,7 @@ public class ByteVector256Tests extends AbstractVectorTest {
     static long ADDReduceAllLong(byte[] a) {
         long res = 0;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduceLong(a, i);
+            res = (long)scalar_add((byte)res, (byte)ADDReduceLong(a, i));
         }
 
         return res;
@@ -6918,8 +6968,8 @@ public class ByteVector256Tests extends AbstractVectorTest {
         }
 
         ra = 0;
-        for (int i = 0; i < a.length; i ++) {
-            ra += r[i];
+        for (int i = 0; i < a.length; i++) {
+            ra = (long)scalar_add((byte)ra, (byte)r[i]);
         }
 
         assertReductionLongArraysEquals(r, ra, a,
@@ -6929,8 +6979,9 @@ public class ByteVector256Tests extends AbstractVectorTest {
     static long ADDReduceLongMasked(byte[] a, int idx, boolean[] mask) {
         byte res = 0;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            if(mask[i % SPECIES.length()])
-                res += a[i];
+            if (mask[i % SPECIES.length()]) {
+                res = scalar_add(res, a[i]);
+            }
         }
 
         return (long)res;
@@ -6939,7 +6990,7 @@ public class ByteVector256Tests extends AbstractVectorTest {
     static long ADDReduceAllLongMasked(byte[] a, boolean[] mask) {
         long res = 0;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduceLongMasked(a, i, mask);
+            res = (long)scalar_add((byte)res, (byte)ADDReduceLongMasked(a, i, mask));
         }
 
         return res;
@@ -6959,8 +7010,8 @@ public class ByteVector256Tests extends AbstractVectorTest {
         }
 
         ra = 0;
-        for (int i = 0; i < a.length; i ++) {
-            ra += r[i];
+        for (int i = 0; i < a.length; i++) {
+            ra = (long)scalar_add((byte)ra, (byte)r[i]);
         }
 
         assertReductionLongArraysEqualsMasked(r, ra, a, mask,
diff --git a/test/jdk/jdk/incubator/vector/ByteVector512Tests.java b/test/jdk/jdk/incubator/vector/ByteVector512Tests.java
index 02da1889dc8..094f3bbebdc 100644
--- a/test/jdk/jdk/incubator/vector/ByteVector512Tests.java
+++ b/test/jdk/jdk/incubator/vector/ByteVector512Tests.java
@@ -1574,6 +1574,59 @@ public class ByteVector512Tests extends AbstractVectorTest {
         return a >= b;
     }
 
+    static byte firstNonZero(byte a, byte b) {
+        return Byte.compare(a, (byte) 0) != 0 ? a : b;
+    }
+
+    static byte scalar_or(byte a, byte b) {
+        return (byte)(a | b);
+    }
+
+    static byte scalar_and(byte a, byte b) {
+        return (byte)(a & b);
+    }
+
+    static byte scalar_xor(byte a, byte b) {
+        return (byte)(a ^ b);
+    }
+
+    static byte scalar_add(byte a, byte b) {
+        return (byte)(a + b);
+    }
+
+    static byte scalar_sub(byte a, byte b) {
+        return (byte)(a - b);
+    }
+
+    static byte scalar_mul(byte a, byte b) {
+        return (byte)(a * b);
+    }
+
+    static byte scalar_min(byte a, byte b) {
+        return (byte)(Math.min(a, b));
+    }
+
+    static byte scalar_max(byte a, byte b) {
+        return (byte)(Math.max(a, b));
+    }
+
+    static byte scalar_div(byte a, byte b) {
+        return (byte)(a / b);
+    }
+
+    static byte scalar_fma(byte a, byte b, byte c) {
+        return (byte)(Math.fma(a, b, c));
+    }
+
+    static byte scalar_abs(byte a) {
+        return (byte)(Math.abs(a));
+    }
+
+    static byte scalar_neg(byte a) {
+        return ((byte)-a);
+    }
+
+
     static boolean ult(byte a, byte b) {
         return Byte.compareUnsigned(a, b) < 0;
     }
@@ -1590,9 +1643,6 @@ public class ByteVector512Tests extends AbstractVectorTest {
         return Byte.compareUnsigned(a, b) >= 0;
     }
 
-    static byte firstNonZero(byte a, byte b) {
-        return Byte.compare(a, (byte) 0) != 0 ? a : b;
-    }
 
     @Test
     static void smokeTest1() {
@@ -1701,7 +1751,7 @@ public class ByteVector512Tests extends AbstractVectorTest {
     }
 
     static byte ADD(byte a, byte b) {
-        return (byte)(a + b);
+        return (byte)(scalar_add(a, b));
     }
 
     @Test(dataProvider = "byteBinaryOpProvider")
@@ -1722,7 +1772,7 @@ public class ByteVector512Tests extends AbstractVectorTest {
     }
 
     static byte add(byte a, byte b) {
-        return (byte)(a + b);
+        return (byte)(scalar_add(a, b));
     }
 
     @Test(dataProvider = "byteBinaryOpProvider")
@@ -1779,7 +1829,7 @@ public class ByteVector512Tests extends AbstractVectorTest {
     }
 
     static byte SUB(byte a, byte b) {
-        return (byte)(a - b);
+        return (byte)(scalar_sub(a, b));
     }
 
     @Test(dataProvider = "byteBinaryOpProvider")
@@ -1800,7 +1850,7 @@ public class ByteVector512Tests extends AbstractVectorTest {
     }
 
     static byte sub(byte a, byte b) {
-        return (byte)(a - b);
+        return (byte)(scalar_sub(a, b));
     }
 
     @Test(dataProvider = "byteBinaryOpProvider")
@@ -1857,7 +1907,7 @@ public class ByteVector512Tests extends AbstractVectorTest {
     }
 
     static byte MUL(byte a, byte b) {
-        return (byte)(a * b);
+        return (byte)(scalar_mul(a, b));
     }
 
     @Test(dataProvider = "byteBinaryOpProvider")
@@ -1878,7 +1928,7 @@ public class ByteVector512Tests extends AbstractVectorTest {
     }
 
     static byte mul(byte a, byte b) {
-        return (byte)(a * b);
+        return (byte)(scalar_mul(a, b));
     }
 
     @Test(dataProvider = "byteBinaryOpProvider")
@@ -2025,7 +2075,7 @@ public class ByteVector512Tests extends AbstractVectorTest {
     }
 
     static byte FIRST_NONZERO(byte a, byte b) {
-        return (byte)((a)!=0?a:b);
+        return (byte)(firstNonZero(a, b));
     }
 
     @Test(dataProvider = "byteBinaryOpProvider")
@@ -3239,7 +3289,7 @@ public class ByteVector512Tests extends AbstractVectorTest {
     }
 
     static byte MIN(byte a, byte b) {
-        return (byte)(Math.min(a, b));
+        return (byte)(scalar_min(a, b));
     }
 
     @Test(dataProvider = "byteBinaryOpProvider")
@@ -3260,7 +3310,7 @@ public class ByteVector512Tests extends AbstractVectorTest {
     }
 
     static byte min(byte a, byte b) {
-        return (byte)(Math.min(a, b));
+        return (byte)(scalar_min(a, b));
     }
 
     @Test(dataProvider = "byteBinaryOpProvider")
@@ -3279,7 +3329,7 @@ public class ByteVector512Tests extends AbstractVectorTest {
     }
 
     static byte MAX(byte a, byte b) {
-        return (byte)(Math.max(a, b));
+        return (byte)(scalar_max(a, b));
     }
 
     @Test(dataProvider = "byteBinaryOpProvider")
@@ -3300,7 +3350,7 @@ public class ByteVector512Tests extends AbstractVectorTest {
     }
 
     static byte max(byte a, byte b) {
-        return (byte)(Math.max(a, b));
+        return (byte)(scalar_max(a, b));
     }
 
     @Test(dataProvider = "byteBinaryOpProvider")
@@ -3668,7 +3718,7 @@ public class ByteVector512Tests extends AbstractVectorTest {
     static byte ANDReduce(byte[] a, int idx) {
         byte res = AND_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res &= a[i];
+            res = scalar_and(res, a[i]);
         }
 
         return res;
@@ -3677,7 +3727,7 @@ public class ByteVector512Tests extends AbstractVectorTest {
     static byte ANDReduceAll(byte[] a) {
         byte res = AND_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res &= ANDReduce(a, i);
+            res = scalar_and(res, ANDReduce(a, i));
         }
 
         return res;
@@ -3695,7 +3745,7 @@ public class ByteVector512Tests extends AbstractVectorTest {
                 ByteVector av = ByteVector.fromArray(SPECIES, a, i);
                 byte v = av.reduceLanes(VectorOperators.AND);
                 r[i] = v;
-                ra &= v;
+                ra = scalar_and(ra, v);
             }
         }
 
@@ -3708,20 +3758,20 @@ public class ByteVector512Tests extends AbstractVectorTest {
         byte[] a = fa.apply(SPECIES.length());
         byte id = AND_IDENTITY;
 
-        assertEquals((byte) (id & id), id,
+        assertEquals((byte) (scalar_and(id, id)), id,
                             "AND(AND_IDENTITY, AND_IDENTITY) != AND_IDENTITY");
 
         byte x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((byte) (id & x), x);
-                assertEquals((byte) (x & id), x);
+                assertEquals((byte) (scalar_and(id, x)), x);
+                assertEquals((byte) (scalar_and(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((byte) (id & x), x,
+            assertEquals((byte) (scalar_and(id, x)), x,
                                 "AND(AND_IDENTITY, " + x + ") != " + x);
-            assertEquals((byte) (x & id), x,
+            assertEquals((byte) (scalar_and(x, id)), x,
                                 "AND(" + x + ", AND_IDENTITY) != " + x);
         }
     }
@@ -3730,7 +3780,7 @@ public class ByteVector512Tests extends AbstractVectorTest {
         byte res = AND_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res &= a[i];
+                res = scalar_and(res, a[i]);
         }
 
         return res;
@@ -3739,7 +3789,7 @@ public class ByteVector512Tests extends AbstractVectorTest {
     static byte ANDReduceAllMasked(byte[] a, boolean[] mask) {
         byte res = AND_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res &= ANDReduceMasked(a, i, mask);
+            res = scalar_and(res, ANDReduceMasked(a, i, mask));
         }
 
         return res;
@@ -3759,7 +3809,7 @@ public class ByteVector512Tests extends AbstractVectorTest {
                 ByteVector av = ByteVector.fromArray(SPECIES, a, i);
                 byte v = av.reduceLanes(VectorOperators.AND, vmask);
                 r[i] = v;
-                ra &= v;
+                ra = scalar_and(ra, v);
             }
         }
 
@@ -3770,7 +3820,7 @@ public class ByteVector512Tests extends AbstractVectorTest {
     static byte ORReduce(byte[] a, int idx) {
         byte res = OR_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res |= a[i];
+            res = scalar_or(res, a[i]);
         }
 
         return res;
@@ -3779,7 +3829,7 @@ public class ByteVector512Tests extends AbstractVectorTest {
     static byte ORReduceAll(byte[] a) {
         byte res = OR_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res |= ORReduce(a, i);
+            res = scalar_or(res, ORReduce(a, i));
         }
 
         return res;
@@ -3797,7 +3847,7 @@ public class ByteVector512Tests extends AbstractVectorTest {
                 ByteVector av = ByteVector.fromArray(SPECIES, a, i);
                 byte v = av.reduceLanes(VectorOperators.OR);
                 r[i] = v;
-                ra |= v;
+                ra = scalar_or(ra, v);
             }
         }
 
@@ -3810,20 +3860,20 @@ public class ByteVector512Tests extends AbstractVectorTest {
         byte[] a = fa.apply(SPECIES.length());
         byte id = OR_IDENTITY;
 
-        assertEquals((byte) (id | id), id,
+        assertEquals((byte) (scalar_or(id, id)), id,
                             "OR(OR_IDENTITY, OR_IDENTITY) != OR_IDENTITY");
 
         byte x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((byte) (id | x), x);
-                assertEquals((byte) (x | id), x);
+                assertEquals((byte) (scalar_or(id, x)), x);
+                assertEquals((byte) (scalar_or(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((byte) (id | x), x,
+            assertEquals((byte) (scalar_or(id, x)), x,
                                 "OR(OR_IDENTITY, " + x + ") != " + x);
-            assertEquals((byte) (x | id), x,
+            assertEquals((byte) (scalar_or(x, id)), x,
                                 "OR(" + x + ", OR_IDENTITY) != " + x);
         }
     }
@@ -3832,7 +3882,7 @@ public class ByteVector512Tests extends AbstractVectorTest {
         byte res = OR_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res |= a[i];
+                res = scalar_or(res, a[i]);
         }
 
         return res;
@@ -3841,7 +3891,7 @@ public class ByteVector512Tests extends AbstractVectorTest {
     static byte ORReduceAllMasked(byte[] a, boolean[] mask) {
         byte res = OR_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res |= ORReduceMasked(a, i, mask);
+            res = scalar_or(res, ORReduceMasked(a, i, mask));
         }
 
         return res;
@@ -3861,7 +3911,7 @@ public class ByteVector512Tests extends AbstractVectorTest {
                 ByteVector av = ByteVector.fromArray(SPECIES, a, i);
                 byte v = av.reduceLanes(VectorOperators.OR, vmask);
                 r[i] = v;
-                ra |= v;
+                ra = scalar_or(ra, v);
             }
         }
 
@@ -3872,7 +3922,7 @@ public class ByteVector512Tests extends AbstractVectorTest {
     static byte XORReduce(byte[] a, int idx) {
         byte res = XOR_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res ^= a[i];
+            res = scalar_xor(res, a[i]);
         }
 
         return res;
@@ -3881,7 +3931,7 @@ public class ByteVector512Tests extends AbstractVectorTest {
     static byte XORReduceAll(byte[] a) {
         byte res = XOR_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res ^= XORReduce(a, i);
+            res = scalar_xor(res, XORReduce(a, i));
         }
 
         return res;
@@ -3899,7 +3949,7 @@ public class ByteVector512Tests extends AbstractVectorTest {
                 ByteVector av = ByteVector.fromArray(SPECIES, a, i);
                 byte v = av.reduceLanes(VectorOperators.XOR);
                 r[i] = v;
-                ra ^= v;
+                ra = scalar_xor(ra, v);
             }
         }
 
@@ -3912,20 +3962,20 @@ public class ByteVector512Tests extends AbstractVectorTest {
         byte[] a = fa.apply(SPECIES.length());
         byte id = XOR_IDENTITY;
 
-        assertEquals((byte) (id ^ id), id,
+        assertEquals((byte) (scalar_xor(id, id)), id,
                             "XOR(XOR_IDENTITY, XOR_IDENTITY) != XOR_IDENTITY");
 
         byte x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((byte) (id ^ x), x);
-                assertEquals((byte) (x ^ id), x);
+                assertEquals((byte) (scalar_xor(id, x)), x);
+                assertEquals((byte) (scalar_xor(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((byte) (id ^ x), x,
+            assertEquals((byte) (scalar_xor(id, x)), x,
                                 "XOR(XOR_IDENTITY, " + x + ") != " + x);
-            assertEquals((byte) (x ^ id), x,
+            assertEquals((byte) (scalar_xor(x, id)), x,
                                 "XOR(" + x + ", XOR_IDENTITY) != " + x);
         }
     }
@@ -3934,7 +3984,7 @@ public class ByteVector512Tests extends AbstractVectorTest {
         byte res = XOR_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res ^= a[i];
+                res = scalar_xor(res, a[i]);
         }
 
         return res;
@@ -3943,7 +3993,7 @@ public class ByteVector512Tests extends AbstractVectorTest {
     static byte XORReduceAllMasked(byte[] a, boolean[] mask) {
         byte res = XOR_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res ^= XORReduceMasked(a, i, mask);
+            res = scalar_xor(res, XORReduceMasked(a, i, mask));
         }
 
         return res;
@@ -3963,7 +4013,7 @@ public class ByteVector512Tests extends AbstractVectorTest {
                 ByteVector av = ByteVector.fromArray(SPECIES, a, i);
                 byte v = av.reduceLanes(VectorOperators.XOR, vmask);
                 r[i] = v;
-                ra ^= v;
+                ra = scalar_xor(ra, v);
             }
         }
 
@@ -3974,7 +4024,7 @@ public class ByteVector512Tests extends AbstractVectorTest {
     static byte ADDReduce(byte[] a, int idx) {
         byte res = ADD_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res += a[i];
+            res = scalar_add(res, a[i]);
         }
 
         return res;
@@ -3983,7 +4033,7 @@ public class ByteVector512Tests extends AbstractVectorTest {
     static byte ADDReduceAll(byte[] a) {
         byte res = ADD_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduce(a, i);
+            res = scalar_add(res, ADDReduce(a, i));
         }
 
         return res;
@@ -4001,7 +4051,7 @@ public class ByteVector512Tests extends AbstractVectorTest {
                 ByteVector av = ByteVector.fromArray(SPECIES, a, i);
                 byte v = av.reduceLanes(VectorOperators.ADD);
                 r[i] = v;
-                ra += v;
+                ra = scalar_add(ra, v);
             }
         }
 
@@ -4014,20 +4064,20 @@ public class ByteVector512Tests extends AbstractVectorTest {
         byte[] a = fa.apply(SPECIES.length());
         byte id = ADD_IDENTITY;
 
-        assertEquals((byte) (id + id), id,
+        assertEquals((byte) (scalar_add(id, id)), id,
                             "ADD(ADD_IDENTITY, ADD_IDENTITY) != ADD_IDENTITY");
 
         byte x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((byte) (id + x), x);
-                assertEquals((byte) (x + id), x);
+                assertEquals((byte) (scalar_add(id, x)), x);
+                assertEquals((byte) (scalar_add(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((byte) (id + x), x,
+            assertEquals((byte) (scalar_add(id, x)), x,
                                 "ADD(ADD_IDENTITY, " + x + ") != " + x);
-            assertEquals((byte) (x + id), x,
+            assertEquals((byte) (scalar_add(x, id)), x,
                                 "ADD(" + x + ", ADD_IDENTITY) != " + x);
         }
     }
@@ -4036,7 +4086,7 @@ public class ByteVector512Tests extends AbstractVectorTest {
         byte res = ADD_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res += a[i];
+                res = scalar_add(res, a[i]);
         }
 
         return res;
@@ -4045,7 +4095,7 @@ public class ByteVector512Tests extends AbstractVectorTest {
     static byte ADDReduceAllMasked(byte[] a, boolean[] mask) {
         byte res = ADD_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduceMasked(a, i, mask);
+            res = scalar_add(res, ADDReduceMasked(a, i, mask));
         }
 
         return res;
@@ -4065,7 +4115,7 @@ public class ByteVector512Tests extends AbstractVectorTest {
                 ByteVector av = ByteVector.fromArray(SPECIES, a, i);
                 byte v = av.reduceLanes(VectorOperators.ADD, vmask);
                 r[i] = v;
-                ra += v;
+                ra = scalar_add(ra, v);
             }
         }
 
@@ -4076,7 +4126,7 @@ public class ByteVector512Tests extends AbstractVectorTest {
     static byte MULReduce(byte[] a, int idx) {
         byte res = MUL_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res *= a[i];
+            res = scalar_mul(res, a[i]);
         }
 
         return res;
@@ -4085,7 +4135,7 @@ public class ByteVector512Tests extends AbstractVectorTest {
     static byte MULReduceAll(byte[] a) {
         byte res = MUL_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res *= MULReduce(a, i);
+            res = scalar_mul(res, MULReduce(a, i));
         }
 
         return res;
@@ -4103,7 +4153,7 @@ public class ByteVector512Tests extends AbstractVectorTest {
                 ByteVector av = ByteVector.fromArray(SPECIES, a, i);
                 byte v = av.reduceLanes(VectorOperators.MUL);
                 r[i] = v;
-                ra *= v;
+                ra = scalar_mul(ra, v);
             }
         }
 
@@ -4116,20 +4166,20 @@ public class ByteVector512Tests extends AbstractVectorTest {
         byte[] a = fa.apply(SPECIES.length());
         byte id = MUL_IDENTITY;
 
-        assertEquals((byte) (id * id), id,
+        assertEquals((byte) (scalar_mul(id, id)), id,
                             "MUL(MUL_IDENTITY, MUL_IDENTITY) != MUL_IDENTITY");
 
         byte x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((byte) (id * x), x);
-                assertEquals((byte) (x * id), x);
+                assertEquals((byte) (scalar_mul(id, x)), x);
+                assertEquals((byte) (scalar_mul(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((byte) (id * x), x,
+            assertEquals((byte) (scalar_mul(id, x)), x,
                                 "MUL(MUL_IDENTITY, " + x + ") != " + x);
-            assertEquals((byte) (x * id), x,
+            assertEquals((byte) (scalar_mul(x, id)), x,
                                 "MUL(" + x + ", MUL_IDENTITY) != " + x);
         }
     }
@@ -4138,7 +4188,7 @@ public class ByteVector512Tests extends AbstractVectorTest {
         byte res = MUL_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res *= a[i];
+                res = scalar_mul(res, a[i]);
         }
 
         return res;
@@ -4147,7 +4197,7 @@ public class ByteVector512Tests extends AbstractVectorTest {
     static byte MULReduceAllMasked(byte[] a, boolean[] mask) {
         byte res = MUL_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res *= MULReduceMasked(a, i, mask);
+            res = scalar_mul(res, MULReduceMasked(a, i, mask));
         }
 
         return res;
@@ -4167,7 +4217,7 @@ public class ByteVector512Tests extends AbstractVectorTest {
                 ByteVector av = ByteVector.fromArray(SPECIES, a, i);
                 byte v = av.reduceLanes(VectorOperators.MUL, vmask);
                 r[i] = v;
-                ra *= v;
+                ra = scalar_mul(ra, v);
             }
         }
 
@@ -4178,7 +4228,7 @@ public class ByteVector512Tests extends AbstractVectorTest {
     static byte MINReduce(byte[] a, int idx) {
         byte res = MIN_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res = (byte) Math.min(res, a[i]);
+            res = scalar_min(res, a[i]);
         }
 
         return res;
@@ -4187,7 +4237,7 @@ public class ByteVector512Tests extends AbstractVectorTest {
     static byte MINReduceAll(byte[] a) {
         byte res = MIN_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (byte) Math.min(res, MINReduce(a, i));
+            res = scalar_min(res, MINReduce(a, i));
         }
 
         return res;
@@ -4205,7 +4255,7 @@ public class ByteVector512Tests extends AbstractVectorTest {
                 ByteVector av = ByteVector.fromArray(SPECIES, a, i);
                 byte v = av.reduceLanes(VectorOperators.MIN);
                 r[i] = v;
-                ra = (byte) Math.min(ra, v);
+                ra = scalar_min(ra, v);
             }
         }
 
@@ -4218,20 +4268,20 @@ public class ByteVector512Tests extends AbstractVectorTest {
         byte[] a = fa.apply(SPECIES.length());
         byte id = MIN_IDENTITY;
 
-        assertEquals((byte) Math.min(id, id), id,
+        assertEquals(scalar_min(id, id), id,
                             "MIN(MIN_IDENTITY, MIN_IDENTITY) != MIN_IDENTITY");
 
         byte x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((byte) Math.min(id, x), x);
-                assertEquals((byte) Math.min(x, id), x);
+                assertEquals(scalar_min(id, x), x);
+                assertEquals(scalar_min(x, id), x);
             }
         } catch (AssertionError e) {
-            assertEquals((byte) Math.min(id, x), x,
+            assertEquals(scalar_min(id, x), x,
                                 "MIN(MIN_IDENTITY, " + x + ") != " + x);
-            assertEquals((byte) Math.min(x, id), x,
+            assertEquals(scalar_min(x, id), x,
                                 "MIN(" + x + ", MIN_IDENTITY) != " + x);
         }
     }
@@ -4240,7 +4290,7 @@ public class ByteVector512Tests extends AbstractVectorTest {
         byte res = MIN_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res = (byte) Math.min(res, a[i]);
+                res = scalar_min(res, a[i]);
         }
 
         return res;
@@ -4249,7 +4299,7 @@ public class ByteVector512Tests extends AbstractVectorTest {
     static byte MINReduceAllMasked(byte[] a, boolean[] mask) {
         byte res = MIN_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (byte) Math.min(res, MINReduceMasked(a, i, mask));
+            res = scalar_min(res, MINReduceMasked(a, i, mask));
         }
 
         return res;
@@ -4269,7 +4319,7 @@ public class ByteVector512Tests extends AbstractVectorTest {
                 ByteVector av = ByteVector.fromArray(SPECIES, a, i);
                 byte v = av.reduceLanes(VectorOperators.MIN, vmask);
                 r[i] = v;
-                ra = (byte) Math.min(ra, v);
+                ra = scalar_min(ra, v);
             }
         }
 
@@ -4280,7 +4330,7 @@ public class ByteVector512Tests extends AbstractVectorTest {
     static byte MAXReduce(byte[] a, int idx) {
         byte res = MAX_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res = (byte) Math.max(res, a[i]);
+            res = scalar_max(res, a[i]);
         }
 
         return res;
@@ -4289,7 +4339,7 @@ public class ByteVector512Tests extends AbstractVectorTest {
     static byte MAXReduceAll(byte[] a) {
         byte res = MAX_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (byte) Math.max(res, MAXReduce(a, i));
+            res = scalar_max(res, MAXReduce(a, i));
         }
 
         return res;
@@ -4307,7 +4357,7 @@ public class ByteVector512Tests extends AbstractVectorTest {
                 ByteVector av = ByteVector.fromArray(SPECIES, a, i);
                 byte v = av.reduceLanes(VectorOperators.MAX);
                 r[i] = v;
-                ra = (byte) Math.max(ra, v);
+                ra = scalar_max(ra, v);
             }
         }
 
@@ -4320,20 +4370,20 @@ public class ByteVector512Tests extends AbstractVectorTest {
         byte[] a = fa.apply(SPECIES.length());
         byte id = MAX_IDENTITY;
 
-        assertEquals((byte) Math.max(id, id), id,
+        assertEquals(scalar_max(id, id), id,
                             "MAX(MAX_IDENTITY, MAX_IDENTITY) != MAX_IDENTITY");
 
         byte x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((byte) Math.max(id, x), x);
-                assertEquals((byte) Math.max(x, id), x);
+                assertEquals(scalar_max(id, x), x);
+                assertEquals(scalar_max(x, id), x);
             }
         } catch (AssertionError e) {
-            assertEquals((byte) Math.max(id, x), x,
+            assertEquals(scalar_max(id, x), x,
                                 "MAX(MAX_IDENTITY, " + x + ") != " + x);
-            assertEquals((byte) Math.max(x, id), x,
+            assertEquals(scalar_max(x, id), x,
                                 "MAX(" + x + ", MAX_IDENTITY) != " + x);
         }
     }
@@ -4342,7 +4392,7 @@ public class ByteVector512Tests extends AbstractVectorTest {
         byte res = MAX_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res = (byte) Math.max(res, a[i]);
+                res = scalar_max(res, a[i]);
         }
 
         return res;
@@ -4351,7 +4401,7 @@ public class ByteVector512Tests extends AbstractVectorTest {
     static byte MAXReduceAllMasked(byte[] a, boolean[] mask) {
         byte res = MAX_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (byte) Math.max(res, MAXReduceMasked(a, i, mask));
+            res = scalar_max(res, MAXReduceMasked(a, i, mask));
         }
 
         return res;
@@ -4371,7 +4421,7 @@ public class ByteVector512Tests extends AbstractVectorTest {
                 ByteVector av = ByteVector.fromArray(SPECIES, a, i);
                 byte v = av.reduceLanes(VectorOperators.MAX, vmask);
                 r[i] = v;
-                ra = (byte) Math.max(ra, v);
+                ra = scalar_max(ra, v);
             }
         }
 
@@ -5404,7 +5454,7 @@ public class ByteVector512Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] < b[i]);
+                assertEquals(mv.laneIsSet(j), lt(a[i + j], b[i]));
             }
         }
     }
@@ -5424,7 +5474,7 @@ public class ByteVector512Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] < b[i]));
+                assertEquals(mv.laneIsSet(j), mask[j] && (lt(a[i + j], b[i])));
             }
         }
     }
@@ -5440,7 +5490,7 @@ public class ByteVector512Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] < (byte)((long)b[i]));
+                assertEquals(mv.laneIsSet(j), lt(a[i + j], (byte)((long)b[i])));
             }
         }
     }
@@ -5460,7 +5510,7 @@ public class ByteVector512Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] < (byte)((long)b[i])));
+                assertEquals(mv.laneIsSet(j), mask[j] && (lt(a[i + j], (byte)((long)b[i]))));
             }
         }
     }
@@ -5476,7 +5526,7 @@ public class ByteVector512Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] == b[i]);
+                assertEquals(mv.laneIsSet(j), eq(a[i + j], b[i]));
             }
         }
     }
@@ -5496,7 +5546,7 @@ public class ByteVector512Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] == b[i]));
+                assertEquals(mv.laneIsSet(j), mask[j] && (eq(a[i + j], b[i])));
             }
         }
     }
@@ -5512,7 +5562,7 @@ public class ByteVector512Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] == (byte)((long)b[i]));
+                assertEquals(mv.laneIsSet(j), eq(a[i + j], (byte)((long)b[i])));
             }
         }
     }
@@ -5532,7 +5582,7 @@ public class ByteVector512Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] == (byte)((long)b[i])));
+                assertEquals(mv.laneIsSet(j), mask[j] && (eq(a[i + j], (byte)((long)b[i]))));
             }
         }
     }
@@ -6244,11 +6294,11 @@ public class ByteVector512Tests extends AbstractVectorTest {
     }
 
     static byte NEG(byte a) {
-        return (byte)(-((byte)a));
+        return (byte)(scalar_neg((byte)a));
     }
 
     static byte neg(byte a) {
-        return (byte)(-((byte)a));
+        return (byte)(scalar_neg((byte)a));
     }
 
     @Test(dataProvider = "byteUnaryOpProvider")
@@ -6300,11 +6350,11 @@ public class ByteVector512Tests extends AbstractVectorTest {
     }
 
     static byte ABS(byte a) {
-        return (byte)(Math.abs((byte)a));
+        return (byte)(scalar_abs((byte)a));
     }
 
     static byte abs(byte a) {
-        return (byte)(Math.abs((byte)a));
+        return (byte)(scalar_abs((byte)a));
     }
 
     @Test(dataProvider = "byteUnaryOpProvider")
@@ -6795,7 +6845,7 @@ public class ByteVector512Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] < b[i]);
+                assertEquals(mv.laneIsSet(j), lt(a[i + j], b[i]));
             }
         }
     }
@@ -6811,7 +6861,7 @@ public class ByteVector512Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] == b[i]);
+                assertEquals(mv.laneIsSet(j), eq(a[i + j], b[i]));
             }
         }
     }
@@ -6891,7 +6941,7 @@ public class ByteVector512Tests extends AbstractVectorTest {
     static long ADDReduceLong(byte[] a, int idx) {
         byte res = 0;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res += a[i];
+            res = scalar_add(res, a[i]);
         }
 
         return (long)res;
@@ -6900,7 +6950,7 @@ public class ByteVector512Tests extends AbstractVectorTest {
     static long ADDReduceAllLong(byte[] a) {
         long res = 0;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduceLong(a, i);
+            res = (long)scalar_add((byte)res, (byte)ADDReduceLong(a, i));
         }
 
         return res;
@@ -6918,8 +6968,8 @@ public class ByteVector512Tests extends AbstractVectorTest {
         }
 
         ra = 0;
-        for (int i = 0; i < a.length; i ++) {
-            ra += r[i];
+        for (int i = 0; i < a.length; i++) {
+            ra = (long)scalar_add((byte)ra, (byte)r[i]);
         }
 
         assertReductionLongArraysEquals(r, ra, a,
@@ -6929,8 +6979,9 @@ public class ByteVector512Tests extends AbstractVectorTest {
     static long ADDReduceLongMasked(byte[] a, int idx, boolean[] mask) {
         byte res = 0;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            if(mask[i % SPECIES.length()])
-                res += a[i];
+            if (mask[i % SPECIES.length()]) {
+                res = scalar_add(res, a[i]);
+            }
         }
 
         return (long)res;
@@ -6939,7 +6990,7 @@ public class ByteVector512Tests extends AbstractVectorTest {
     static long ADDReduceAllLongMasked(byte[] a, boolean[] mask) {
         long res = 0;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduceLongMasked(a, i, mask);
+            res = (long)scalar_add((byte)res, (byte)ADDReduceLongMasked(a, i, mask));
         }
 
         return res;
@@ -6959,8 +7010,8 @@ public class ByteVector512Tests extends AbstractVectorTest {
         }
 
         ra = 0;
-        for (int i = 0; i < a.length; i ++) {
-            ra += r[i];
+        for (int i = 0; i < a.length; i++) {
+            ra = (long)scalar_add((byte)ra, (byte)r[i]);
         }
 
         assertReductionLongArraysEqualsMasked(r, ra, a, mask,
diff --git a/test/jdk/jdk/incubator/vector/ByteVector64Tests.java b/test/jdk/jdk/incubator/vector/ByteVector64Tests.java
index ce671440d2e..e8ff81678cd 100644
--- a/test/jdk/jdk/incubator/vector/ByteVector64Tests.java
+++ b/test/jdk/jdk/incubator/vector/ByteVector64Tests.java
@@ -1574,6 +1574,59 @@ public class ByteVector64Tests extends AbstractVectorTest {
         return a >= b;
     }
 
+    static byte firstNonZero(byte a, byte b) {
+        return Byte.compare(a, (byte) 0) != 0 ? a : b;
+    }
+
+    static byte scalar_or(byte a, byte b) {
+        return (byte)(a | b);
+    }
+
+    static byte scalar_and(byte a, byte b) {
+        return (byte)(a & b);
+    }
+
+    static byte scalar_xor(byte a, byte b) {
+        return (byte)(a ^ b);
+    }
+
+    static byte scalar_add(byte a, byte b) {
+        return (byte)(a + b);
+    }
+
+    static byte scalar_sub(byte a, byte b) {
+        return (byte)(a - b);
+    }
+
+    static byte scalar_mul(byte a, byte b) {
+        return (byte)(a * b);
+    }
+
+    static byte scalar_min(byte a, byte b) {
+        return (byte)(Math.min(a, b));
+    }
+
+    static byte scalar_max(byte a, byte b) {
+        return (byte)(Math.max(a, b));
+    }
+
+    static byte scalar_div(byte a, byte b) {
+        return (byte)(a / b);
+    }
+
+    static byte scalar_fma(byte a, byte b, byte c) {
+        return (byte)(Math.fma(a, b, c));
+    }
+
+    static byte scalar_abs(byte a) {
+        return (byte)(Math.abs(a));
+    }
+
+    static byte scalar_neg(byte a) {
+        return ((byte)-a);
+    }
+
+
     static boolean ult(byte a, byte b) {
         return Byte.compareUnsigned(a, b) < 0;
     }
@@ -1590,9 +1643,6 @@ public class ByteVector64Tests extends AbstractVectorTest {
         return Byte.compareUnsigned(a, b) >= 0;
     }
 
-    static byte firstNonZero(byte a, byte b) {
-        return Byte.compare(a, (byte) 0) != 0 ? a : b;
-    }
 
     @Test
     static void smokeTest1() {
@@ -1701,7 +1751,7 @@ public class ByteVector64Tests extends AbstractVectorTest {
     }
 
     static byte ADD(byte a, byte b) {
-        return (byte)(a + b);
+        return (byte)(scalar_add(a, b));
     }
 
     @Test(dataProvider = "byteBinaryOpProvider")
@@ -1722,7 +1772,7 @@ public class ByteVector64Tests extends AbstractVectorTest {
     }
 
     static byte add(byte a, byte b) {
-        return (byte)(a + b);
+        return (byte)(scalar_add(a, b));
     }
 
     @Test(dataProvider = "byteBinaryOpProvider")
@@ -1779,7 +1829,7 @@ public class ByteVector64Tests extends AbstractVectorTest {
     }
 
     static byte SUB(byte a, byte b) {
-        return (byte)(a - b);
+        return (byte)(scalar_sub(a, b));
     }
 
     @Test(dataProvider = "byteBinaryOpProvider")
@@ -1800,7 +1850,7 @@ public class ByteVector64Tests extends AbstractVectorTest {
     }
 
     static byte sub(byte a, byte b) {
-        return (byte)(a - b);
+        return (byte)(scalar_sub(a, b));
     }
 
     @Test(dataProvider = "byteBinaryOpProvider")
@@ -1857,7 +1907,7 @@ public class ByteVector64Tests extends AbstractVectorTest {
     }
 
     static byte MUL(byte a, byte b) {
-        return (byte)(a * b);
+        return (byte)(scalar_mul(a, b));
     }
 
     @Test(dataProvider = "byteBinaryOpProvider")
@@ -1878,7 +1928,7 @@ public class ByteVector64Tests extends AbstractVectorTest {
     }
 
     static byte mul(byte a, byte b) {
-        return (byte)(a * b);
+        return (byte)(scalar_mul(a, b));
     }
 
     @Test(dataProvider = "byteBinaryOpProvider")
@@ -2025,7 +2075,7 @@ public class ByteVector64Tests extends AbstractVectorTest {
     }
 
     static byte FIRST_NONZERO(byte a, byte b) {
-        return (byte)((a)!=0?a:b);
+        return (byte)(firstNonZero(a, b));
     }
 
     @Test(dataProvider = "byteBinaryOpProvider")
@@ -3239,7 +3289,7 @@ public class ByteVector64Tests extends AbstractVectorTest {
     }
 
     static byte MIN(byte a, byte b) {
-        return (byte)(Math.min(a, b));
+        return (byte)(scalar_min(a, b));
     }
 
     @Test(dataProvider = "byteBinaryOpProvider")
@@ -3260,7 +3310,7 @@ public class ByteVector64Tests extends AbstractVectorTest {
     }
 
     static byte min(byte a, byte b) {
-        return (byte)(Math.min(a, b));
+        return (byte)(scalar_min(a, b));
     }
 
     @Test(dataProvider = "byteBinaryOpProvider")
@@ -3279,7 +3329,7 @@ public class ByteVector64Tests extends AbstractVectorTest {
     }
 
     static byte MAX(byte a, byte b) {
-        return (byte)(Math.max(a, b));
+        return (byte)(scalar_max(a, b));
     }
 
     @Test(dataProvider = "byteBinaryOpProvider")
@@ -3300,7 +3350,7 @@ public class ByteVector64Tests extends AbstractVectorTest {
     }
 
     static byte max(byte a, byte b) {
-        return (byte)(Math.max(a, b));
+        return (byte)(scalar_max(a, b));
     }
 
     @Test(dataProvider = "byteBinaryOpProvider")
@@ -3668,7 +3718,7 @@ public class ByteVector64Tests extends AbstractVectorTest {
     static byte ANDReduce(byte[] a, int idx) {
         byte res = AND_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res &= a[i];
+            res = scalar_and(res, a[i]);
         }
 
         return res;
@@ -3677,7 +3727,7 @@ public class ByteVector64Tests extends AbstractVectorTest {
     static byte ANDReduceAll(byte[] a) {
         byte res = AND_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res &= ANDReduce(a, i);
+            res = scalar_and(res, ANDReduce(a, i));
         }
 
         return res;
@@ -3695,7 +3745,7 @@ public class ByteVector64Tests extends AbstractVectorTest {
                 ByteVector av = ByteVector.fromArray(SPECIES, a, i);
                 byte v = av.reduceLanes(VectorOperators.AND);
                 r[i] = v;
-                ra &= v;
+                ra = scalar_and(ra, v);
             }
         }
 
@@ -3708,20 +3758,20 @@ public class ByteVector64Tests extends AbstractVectorTest {
         byte[] a = fa.apply(SPECIES.length());
         byte id = AND_IDENTITY;
 
-        assertEquals((byte) (id & id), id,
+        assertEquals((byte) (scalar_and(id, id)), id,
                             "AND(AND_IDENTITY, AND_IDENTITY) != AND_IDENTITY");
 
         byte x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((byte) (id & x), x);
-                assertEquals((byte) (x & id), x);
+                assertEquals((byte) (scalar_and(id, x)), x);
+                assertEquals((byte) (scalar_and(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((byte) (id & x), x,
+            assertEquals((byte) (scalar_and(id, x)), x,
                                 "AND(AND_IDENTITY, " + x + ") != " + x);
-            assertEquals((byte) (x & id), x,
+            assertEquals((byte) (scalar_and(x, id)), x,
                                 "AND(" + x + ", AND_IDENTITY) != " + x);
         }
     }
@@ -3730,7 +3780,7 @@ public class ByteVector64Tests extends AbstractVectorTest {
         byte res = AND_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res &= a[i];
+                res = scalar_and(res, a[i]);
         }
 
         return res;
@@ -3739,7 +3789,7 @@ public class ByteVector64Tests extends AbstractVectorTest {
     static byte ANDReduceAllMasked(byte[] a, boolean[] mask) {
         byte res = AND_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res &= ANDReduceMasked(a, i, mask);
+            res = scalar_and(res, ANDReduceMasked(a, i, mask));
         }
 
         return res;
@@ -3759,7 +3809,7 @@ public class ByteVector64Tests extends AbstractVectorTest {
                 ByteVector av = ByteVector.fromArray(SPECIES, a, i);
                 byte v = av.reduceLanes(VectorOperators.AND, vmask);
                 r[i] = v;
-                ra &= v;
+                ra = scalar_and(ra, v);
             }
         }
 
@@ -3770,7 +3820,7 @@ public class ByteVector64Tests extends AbstractVectorTest {
     static byte ORReduce(byte[] a, int idx) {
         byte res = OR_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res |= a[i];
+            res = scalar_or(res, a[i]);
         }
 
         return res;
@@ -3779,7 +3829,7 @@ public class ByteVector64Tests extends AbstractVectorTest {
     static byte ORReduceAll(byte[] a) {
         byte res = OR_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res |= ORReduce(a, i);
+            res = scalar_or(res, ORReduce(a, i));
         }
 
         return res;
@@ -3797,7 +3847,7 @@ public class ByteVector64Tests extends AbstractVectorTest {
                 ByteVector av = ByteVector.fromArray(SPECIES, a, i);
                 byte v = av.reduceLanes(VectorOperators.OR);
                 r[i] = v;
-                ra |= v;
+                ra = scalar_or(ra, v);
             }
         }
 
@@ -3810,20 +3860,20 @@ public class ByteVector64Tests extends AbstractVectorTest {
         byte[] a = fa.apply(SPECIES.length());
         byte id = OR_IDENTITY;
 
-        assertEquals((byte) (id | id), id,
+        assertEquals((byte) (scalar_or(id, id)), id,
                             "OR(OR_IDENTITY, OR_IDENTITY) != OR_IDENTITY");
 
         byte x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((byte) (id | x), x);
-                assertEquals((byte) (x | id), x);
+                assertEquals((byte) (scalar_or(id, x)), x);
+                assertEquals((byte) (scalar_or(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((byte) (id | x), x,
+            assertEquals((byte) (scalar_or(id, x)), x,
                                 "OR(OR_IDENTITY, " + x + ") != " + x);
-            assertEquals((byte) (x | id), x,
+            assertEquals((byte) (scalar_or(x, id)), x,
                                 "OR(" + x + ", OR_IDENTITY) != " + x);
         }
     }
@@ -3832,7 +3882,7 @@ public class ByteVector64Tests extends AbstractVectorTest {
         byte res = OR_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res |= a[i];
+                res = scalar_or(res, a[i]);
         }
 
         return res;
@@ -3841,7 +3891,7 @@ public class ByteVector64Tests extends AbstractVectorTest {
     static byte ORReduceAllMasked(byte[] a, boolean[] mask) {
         byte res = OR_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res |= ORReduceMasked(a, i, mask);
+            res = scalar_or(res, ORReduceMasked(a, i, mask));
         }
 
         return res;
@@ -3861,7 +3911,7 @@ public class ByteVector64Tests extends AbstractVectorTest {
                 ByteVector av = ByteVector.fromArray(SPECIES, a, i);
                 byte v = av.reduceLanes(VectorOperators.OR, vmask);
                 r[i] = v;
-                ra |= v;
+                ra = scalar_or(ra, v);
             }
         }
 
@@ -3872,7 +3922,7 @@ public class ByteVector64Tests extends AbstractVectorTest {
     static byte XORReduce(byte[] a, int idx) {
         byte res = XOR_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res ^= a[i];
+            res = scalar_xor(res, a[i]);
         }
 
         return res;
@@ -3881,7 +3931,7 @@ public class ByteVector64Tests extends AbstractVectorTest {
     static byte XORReduceAll(byte[] a) {
         byte res = XOR_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res ^= XORReduce(a, i);
+            res = scalar_xor(res, XORReduce(a, i));
         }
 
         return res;
@@ -3899,7 +3949,7 @@ public class ByteVector64Tests extends AbstractVectorTest {
                 ByteVector av = ByteVector.fromArray(SPECIES, a, i);
                 byte v = av.reduceLanes(VectorOperators.XOR);
                 r[i] = v;
-                ra ^= v;
+                ra = scalar_xor(ra, v);
             }
         }
 
@@ -3912,20 +3962,20 @@ public class ByteVector64Tests extends AbstractVectorTest {
         byte[] a = fa.apply(SPECIES.length());
         byte id = XOR_IDENTITY;
 
-        assertEquals((byte) (id ^ id), id,
+        assertEquals((byte) (scalar_xor(id, id)), id,
                             "XOR(XOR_IDENTITY, XOR_IDENTITY) != XOR_IDENTITY");
 
         byte x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((byte) (id ^ x), x);
-                assertEquals((byte) (x ^ id), x);
+                assertEquals((byte) (scalar_xor(id, x)), x);
+                assertEquals((byte) (scalar_xor(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((byte) (id ^ x), x,
+            assertEquals((byte) (scalar_xor(id, x)), x,
                                 "XOR(XOR_IDENTITY, " + x + ") != " + x);
-            assertEquals((byte) (x ^ id), x,
+            assertEquals((byte) (scalar_xor(x, id)), x,
                                 "XOR(" + x + ", XOR_IDENTITY) != " + x);
         }
     }
@@ -3934,7 +3984,7 @@ public class ByteVector64Tests extends AbstractVectorTest {
         byte res = XOR_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res ^= a[i];
+                res = scalar_xor(res, a[i]);
         }
 
         return res;
@@ -3943,7 +3993,7 @@ public class ByteVector64Tests extends AbstractVectorTest {
     static byte XORReduceAllMasked(byte[] a, boolean[] mask) {
         byte res = XOR_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res ^= XORReduceMasked(a, i, mask);
+            res = scalar_xor(res, XORReduceMasked(a, i, mask));
         }
 
         return res;
@@ -3963,7 +4013,7 @@ public class ByteVector64Tests extends AbstractVectorTest {
                 ByteVector av = ByteVector.fromArray(SPECIES, a, i);
                 byte v = av.reduceLanes(VectorOperators.XOR, vmask);
                 r[i] = v;
-                ra ^= v;
+                ra = scalar_xor(ra, v);
             }
         }
 
@@ -3974,7 +4024,7 @@ public class ByteVector64Tests extends AbstractVectorTest {
     static byte ADDReduce(byte[] a, int idx) {
         byte res = ADD_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res += a[i];
+            res = scalar_add(res, a[i]);
         }
 
         return res;
@@ -3983,7 +4033,7 @@ public class ByteVector64Tests extends AbstractVectorTest {
     static byte ADDReduceAll(byte[] a) {
         byte res = ADD_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduce(a, i);
+            res = scalar_add(res, ADDReduce(a, i));
         }
 
         return res;
@@ -4001,7 +4051,7 @@ public class ByteVector64Tests extends AbstractVectorTest {
                 ByteVector av = ByteVector.fromArray(SPECIES, a, i);
                 byte v = av.reduceLanes(VectorOperators.ADD);
                 r[i] = v;
-                ra += v;
+                ra = scalar_add(ra, v);
             }
         }
 
@@ -4014,20 +4064,20 @@ public class ByteVector64Tests extends AbstractVectorTest {
         byte[] a = fa.apply(SPECIES.length());
         byte id = ADD_IDENTITY;
 
-        assertEquals((byte) (id + id), id,
+        assertEquals((byte) (scalar_add(id, id)), id,
                             "ADD(ADD_IDENTITY, ADD_IDENTITY) != ADD_IDENTITY");
 
         byte x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((byte) (id + x), x);
-                assertEquals((byte) (x + id), x);
+                assertEquals((byte) (scalar_add(id, x)), x);
+                assertEquals((byte) (scalar_add(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((byte) (id + x), x,
+            assertEquals((byte) (scalar_add(id, x)), x,
                                 "ADD(ADD_IDENTITY, " + x + ") != " + x);
-            assertEquals((byte) (x + id), x,
+            assertEquals((byte) (scalar_add(x, id)), x,
                                 "ADD(" + x + ", ADD_IDENTITY) != " + x);
         }
     }
@@ -4036,7 +4086,7 @@ public class ByteVector64Tests extends AbstractVectorTest {
         byte res = ADD_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res += a[i];
+                res = scalar_add(res, a[i]);
         }
 
         return res;
@@ -4045,7 +4095,7 @@ public class ByteVector64Tests extends AbstractVectorTest {
     static byte ADDReduceAllMasked(byte[] a, boolean[] mask) {
         byte res = ADD_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduceMasked(a, i, mask);
+            res = scalar_add(res, ADDReduceMasked(a, i, mask));
         }
 
         return res;
@@ -4065,7 +4115,7 @@ public class ByteVector64Tests extends AbstractVectorTest {
                 ByteVector av = ByteVector.fromArray(SPECIES, a, i);
                 byte v = av.reduceLanes(VectorOperators.ADD, vmask);
                 r[i] = v;
-                ra += v;
+                ra = scalar_add(ra, v);
             }
         }
 
@@ -4076,7 +4126,7 @@ public class ByteVector64Tests extends AbstractVectorTest {
     static byte MULReduce(byte[] a, int idx) {
         byte res = MUL_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res *= a[i];
+            res = scalar_mul(res, a[i]);
         }
 
         return res;
@@ -4085,7 +4135,7 @@ public class ByteVector64Tests extends AbstractVectorTest {
     static byte MULReduceAll(byte[] a) {
         byte res = MUL_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res *= MULReduce(a, i);
+            res = scalar_mul(res, MULReduce(a, i));
         }
 
         return res;
@@ -4103,7 +4153,7 @@ public class ByteVector64Tests extends AbstractVectorTest {
                 ByteVector av = ByteVector.fromArray(SPECIES, a, i);
                 byte v = av.reduceLanes(VectorOperators.MUL);
                 r[i] = v;
-                ra *= v;
+                ra = scalar_mul(ra, v);
             }
         }
 
@@ -4116,20 +4166,20 @@ public class ByteVector64Tests extends AbstractVectorTest {
         byte[] a = fa.apply(SPECIES.length());
         byte id = MUL_IDENTITY;
 
-        assertEquals((byte) (id * id), id,
+        assertEquals((byte) (scalar_mul(id, id)), id,
                             "MUL(MUL_IDENTITY, MUL_IDENTITY) != MUL_IDENTITY");
 
         byte x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((byte) (id * x), x);
-                assertEquals((byte) (x * id), x);
+                assertEquals((byte) (scalar_mul(id, x)), x);
+                assertEquals((byte) (scalar_mul(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((byte) (id * x), x,
+            assertEquals((byte) (scalar_mul(id, x)), x,
                                 "MUL(MUL_IDENTITY, " + x + ") != " + x);
-            assertEquals((byte) (x * id), x,
+            assertEquals((byte) (scalar_mul(x, id)), x,
                                 "MUL(" + x + ", MUL_IDENTITY) != " + x);
         }
     }
@@ -4138,7 +4188,7 @@ public class ByteVector64Tests extends AbstractVectorTest {
         byte res = MUL_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res *= a[i];
+                res = scalar_mul(res, a[i]);
         }
 
         return res;
@@ -4147,7 +4197,7 @@ public class ByteVector64Tests extends AbstractVectorTest {
     static byte MULReduceAllMasked(byte[] a, boolean[] mask) {
         byte res = MUL_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res *= MULReduceMasked(a, i, mask);
+            res = scalar_mul(res, MULReduceMasked(a, i, mask));
         }
 
         return res;
@@ -4167,7 +4217,7 @@ public class ByteVector64Tests extends AbstractVectorTest {
                 ByteVector av = ByteVector.fromArray(SPECIES, a, i);
                 byte v = av.reduceLanes(VectorOperators.MUL, vmask);
                 r[i] = v;
-                ra *= v;
+                ra = scalar_mul(ra, v);
             }
         }
 
@@ -4178,7 +4228,7 @@ public class ByteVector64Tests extends AbstractVectorTest {
     static byte MINReduce(byte[] a, int idx) {
         byte res = MIN_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res = (byte) Math.min(res, a[i]);
+            res = scalar_min(res, a[i]);
         }
 
         return res;
@@ -4187,7 +4237,7 @@ public class ByteVector64Tests extends AbstractVectorTest {
     static byte MINReduceAll(byte[] a) {
         byte res = MIN_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (byte) Math.min(res, MINReduce(a, i));
+            res = scalar_min(res, MINReduce(a, i));
         }
 
         return res;
@@ -4205,7 +4255,7 @@ public class ByteVector64Tests extends AbstractVectorTest {
                 ByteVector av = ByteVector.fromArray(SPECIES, a, i);
                 byte v = av.reduceLanes(VectorOperators.MIN);
                 r[i] = v;
-                ra = (byte) Math.min(ra, v);
+                ra = scalar_min(ra, v);
             }
         }
 
@@ -4218,20 +4268,20 @@ public class ByteVector64Tests extends AbstractVectorTest {
         byte[] a = fa.apply(SPECIES.length());
         byte id = MIN_IDENTITY;
 
-        assertEquals((byte) Math.min(id, id), id,
+        assertEquals(scalar_min(id, id), id,
                             "MIN(MIN_IDENTITY, MIN_IDENTITY) != MIN_IDENTITY");
 
         byte x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((byte) Math.min(id, x), x);
-                assertEquals((byte) Math.min(x, id), x);
+                assertEquals(scalar_min(id, x), x);
+                assertEquals(scalar_min(x, id), x);
             }
         } catch (AssertionError e) {
-            assertEquals((byte) Math.min(id, x), x,
+            assertEquals(scalar_min(id, x), x,
                                 "MIN(MIN_IDENTITY, " + x + ") != " + x);
-            assertEquals((byte) Math.min(x, id), x,
+            assertEquals(scalar_min(x, id), x,
                                 "MIN(" + x + ", MIN_IDENTITY) != " + x);
         }
     }
@@ -4240,7 +4290,7 @@ public class ByteVector64Tests extends AbstractVectorTest {
         byte res = MIN_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res = (byte) Math.min(res, a[i]);
+                res = scalar_min(res, a[i]);
         }
 
         return res;
@@ -4249,7 +4299,7 @@ public class ByteVector64Tests extends AbstractVectorTest {
     static byte MINReduceAllMasked(byte[] a, boolean[] mask) {
         byte res = MIN_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (byte) Math.min(res, MINReduceMasked(a, i, mask));
+            res = scalar_min(res, MINReduceMasked(a, i, mask));
         }
 
         return res;
@@ -4269,7 +4319,7 @@ public class ByteVector64Tests extends AbstractVectorTest {
                 ByteVector av = ByteVector.fromArray(SPECIES, a, i);
                 byte v = av.reduceLanes(VectorOperators.MIN, vmask);
                 r[i] = v;
-                ra = (byte) Math.min(ra, v);
+                ra = scalar_min(ra, v);
             }
         }
 
@@ -4280,7 +4330,7 @@ public class ByteVector64Tests extends AbstractVectorTest {
     static byte MAXReduce(byte[] a, int idx) {
         byte res = MAX_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res = (byte) Math.max(res, a[i]);
+            res = scalar_max(res, a[i]);
         }
 
         return res;
@@ -4289,7 +4339,7 @@ public class ByteVector64Tests extends AbstractVectorTest {
     static byte MAXReduceAll(byte[] a) {
         byte res = MAX_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (byte) Math.max(res, MAXReduce(a, i));
+            res = scalar_max(res, MAXReduce(a, i));
         }
 
         return res;
@@ -4307,7 +4357,7 @@ public class ByteVector64Tests extends AbstractVectorTest {
                 ByteVector av = ByteVector.fromArray(SPECIES, a, i);
                 byte v = av.reduceLanes(VectorOperators.MAX);
                 r[i] = v;
-                ra = (byte) Math.max(ra, v);
+                ra = scalar_max(ra, v);
             }
         }
 
@@ -4320,20 +4370,20 @@ public class ByteVector64Tests extends AbstractVectorTest {
         byte[] a = fa.apply(SPECIES.length());
         byte id = MAX_IDENTITY;
 
-        assertEquals((byte) Math.max(id, id), id,
+        assertEquals(scalar_max(id, id), id,
                             "MAX(MAX_IDENTITY, MAX_IDENTITY) != MAX_IDENTITY");
 
         byte x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((byte) Math.max(id, x), x);
-                assertEquals((byte) Math.max(x, id), x);
+                assertEquals(scalar_max(id, x), x);
+                assertEquals(scalar_max(x, id), x);
             }
         } catch (AssertionError e) {
-            assertEquals((byte) Math.max(id, x), x,
+            assertEquals(scalar_max(id, x), x,
                                 "MAX(MAX_IDENTITY, " + x + ") != " + x);
-            assertEquals((byte) Math.max(x, id), x,
+            assertEquals(scalar_max(x, id), x,
                                 "MAX(" + x + ", MAX_IDENTITY) != " + x);
         }
     }
@@ -4342,7 +4392,7 @@ public class ByteVector64Tests extends AbstractVectorTest {
         byte res = MAX_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res = (byte) Math.max(res, a[i]);
+                res = scalar_max(res, a[i]);
         }
 
         return res;
@@ -4351,7 +4401,7 @@ public class ByteVector64Tests extends AbstractVectorTest {
     static byte MAXReduceAllMasked(byte[] a, boolean[] mask) {
         byte res = MAX_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (byte) Math.max(res, MAXReduceMasked(a, i, mask));
+            res = scalar_max(res, MAXReduceMasked(a, i, mask));
         }
 
         return res;
@@ -4371,7 +4421,7 @@ public class ByteVector64Tests extends AbstractVectorTest {
                 ByteVector av = ByteVector.fromArray(SPECIES, a, i);
                 byte v = av.reduceLanes(VectorOperators.MAX, vmask);
                 r[i] = v;
-                ra = (byte) Math.max(ra, v);
+                ra = scalar_max(ra, v);
             }
         }
 
@@ -5404,7 +5454,7 @@ public class ByteVector64Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] < b[i]);
+                assertEquals(mv.laneIsSet(j), lt(a[i + j], b[i]));
             }
         }
     }
@@ -5424,7 +5474,7 @@ public class ByteVector64Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] < b[i]));
+                assertEquals(mv.laneIsSet(j), mask[j] && (lt(a[i + j], b[i])));
             }
         }
     }
@@ -5440,7 +5490,7 @@ public class ByteVector64Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] < (byte)((long)b[i]));
+                assertEquals(mv.laneIsSet(j), lt(a[i + j], (byte)((long)b[i])));
             }
         }
     }
@@ -5460,7 +5510,7 @@ public class ByteVector64Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] < (byte)((long)b[i])));
+                assertEquals(mv.laneIsSet(j), mask[j] && (lt(a[i + j], (byte)((long)b[i]))));
             }
         }
     }
@@ -5476,7 +5526,7 @@ public class ByteVector64Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] == b[i]);
+                assertEquals(mv.laneIsSet(j), eq(a[i + j], b[i]));
             }
         }
     }
@@ -5496,7 +5546,7 @@ public class ByteVector64Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] == b[i]));
+                assertEquals(mv.laneIsSet(j), mask[j] && (eq(a[i + j], b[i])));
             }
         }
     }
@@ -5512,7 +5562,7 @@ public class ByteVector64Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] == (byte)((long)b[i]));
+                assertEquals(mv.laneIsSet(j), eq(a[i + j], (byte)((long)b[i])));
             }
         }
     }
@@ -5532,7 +5582,7 @@ public class ByteVector64Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] == (byte)((long)b[i])));
+                assertEquals(mv.laneIsSet(j), mask[j] && (eq(a[i + j], (byte)((long)b[i]))));
             }
         }
     }
@@ -6244,11 +6294,11 @@ public class ByteVector64Tests extends AbstractVectorTest {
     }
 
     static byte NEG(byte a) {
-        return (byte)(-((byte)a));
+        return (byte)(scalar_neg((byte)a));
     }
 
     static byte neg(byte a) {
-        return (byte)(-((byte)a));
+        return (byte)(scalar_neg((byte)a));
     }
 
     @Test(dataProvider = "byteUnaryOpProvider")
@@ -6300,11 +6350,11 @@ public class ByteVector64Tests extends AbstractVectorTest {
     }
 
     static byte ABS(byte a) {
-        return (byte)(Math.abs((byte)a));
+        return (byte)(scalar_abs((byte)a));
     }
 
     static byte abs(byte a) {
-        return (byte)(Math.abs((byte)a));
+        return (byte)(scalar_abs((byte)a));
     }
 
     @Test(dataProvider = "byteUnaryOpProvider")
@@ -6795,7 +6845,7 @@ public class ByteVector64Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] < b[i]);
+                assertEquals(mv.laneIsSet(j), lt(a[i + j], b[i]));
             }
         }
     }
@@ -6811,7 +6861,7 @@ public class ByteVector64Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] == b[i]);
+                assertEquals(mv.laneIsSet(j), eq(a[i + j], b[i]));
             }
         }
     }
@@ -6891,7 +6941,7 @@ public class ByteVector64Tests extends AbstractVectorTest {
     static long ADDReduceLong(byte[] a, int idx) {
         byte res = 0;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res += a[i];
+            res = scalar_add(res, a[i]);
         }
 
         return (long)res;
@@ -6900,7 +6950,7 @@ public class ByteVector64Tests extends AbstractVectorTest {
     static long ADDReduceAllLong(byte[] a) {
         long res = 0;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduceLong(a, i);
+            res = (long)scalar_add((byte)res, (byte)ADDReduceLong(a, i));
         }
 
         return res;
@@ -6918,8 +6968,8 @@ public class ByteVector64Tests extends AbstractVectorTest {
         }
 
         ra = 0;
-        for (int i = 0; i < a.length; i ++) {
-            ra += r[i];
+        for (int i = 0; i < a.length; i++) {
+            ra = (long)scalar_add((byte)ra, (byte)r[i]);
         }
 
         assertReductionLongArraysEquals(r, ra, a,
@@ -6929,8 +6979,9 @@ public class ByteVector64Tests extends AbstractVectorTest {
     static long ADDReduceLongMasked(byte[] a, int idx, boolean[] mask) {
         byte res = 0;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            if(mask[i % SPECIES.length()])
-                res += a[i];
+            if (mask[i % SPECIES.length()]) {
+                res = scalar_add(res, a[i]);
+            }
         }
 
         return (long)res;
@@ -6939,7 +6990,7 @@ public class ByteVector64Tests extends AbstractVectorTest {
     static long ADDReduceAllLongMasked(byte[] a, boolean[] mask) {
         long res = 0;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduceLongMasked(a, i, mask);
+            res = (long)scalar_add((byte)res, (byte)ADDReduceLongMasked(a, i, mask));
         }
 
         return res;
@@ -6959,8 +7010,8 @@ public class ByteVector64Tests extends AbstractVectorTest {
         }
 
         ra = 0;
-        for (int i = 0; i < a.length; i ++) {
-            ra += r[i];
+        for (int i = 0; i < a.length; i++) {
+            ra = (long)scalar_add((byte)ra, (byte)r[i]);
         }
 
         assertReductionLongArraysEqualsMasked(r, ra, a, mask,
diff --git a/test/jdk/jdk/incubator/vector/ByteVectorMaxTests.java b/test/jdk/jdk/incubator/vector/ByteVectorMaxTests.java
index c2d8188c090..c53710c3fdd 100644
--- a/test/jdk/jdk/incubator/vector/ByteVectorMaxTests.java
+++ b/test/jdk/jdk/incubator/vector/ByteVectorMaxTests.java
@@ -1580,6 +1580,59 @@ public class ByteVectorMaxTests extends AbstractVectorTest {
         return a >= b;
     }
 
+    static byte firstNonZero(byte a, byte b) {
+        return Byte.compare(a, (byte) 0) != 0 ? a : b;
+    }
+
+    static byte scalar_or(byte a, byte b) {
+        return (byte)(a | b);
+    }
+
+    static byte scalar_and(byte a, byte b) {
+        return (byte)(a & b);
+    }
+
+    static byte scalar_xor(byte a, byte b) {
+        return (byte)(a ^ b);
+    }
+
+    static byte scalar_add(byte a, byte b) {
+        return (byte)(a + b);
+    }
+
+    static byte scalar_sub(byte a, byte b) {
+        return (byte)(a - b);
+    }
+
+    static byte scalar_mul(byte a, byte b) {
+        return (byte)(a * b);
+    }
+
+    static byte scalar_min(byte a, byte b) {
+        return (byte)(Math.min(a, b));
+    }
+
+    static byte scalar_max(byte a, byte b) {
+        return (byte)(Math.max(a, b));
+    }
+
+    static byte scalar_div(byte a, byte b) {
+        return (byte)(a / b);
+    }
+
+    static byte scalar_fma(byte a, byte b, byte c) {
+        return (byte)(Math.fma(a, b, c));
+    }
+
+    static byte scalar_abs(byte a) {
+        return (byte)(Math.abs(a));
+    }
+
+    static byte scalar_neg(byte a) {
+        return ((byte)-a);
+    }
+
+
     static boolean ult(byte a, byte b) {
         return Byte.compareUnsigned(a, b) < 0;
     }
@@ -1596,9 +1649,6 @@ public class ByteVectorMaxTests extends AbstractVectorTest {
         return Byte.compareUnsigned(a, b) >= 0;
     }
 
-    static byte firstNonZero(byte a, byte b) {
-        return Byte.compare(a, (byte) 0) != 0 ? a : b;
-    }
 
     @Test
     static void smokeTest1() {
@@ -1707,7 +1757,7 @@ public class ByteVectorMaxTests extends AbstractVectorTest {
     }
 
     static byte ADD(byte a, byte b) {
-        return (byte)(a + b);
+        return (byte)(scalar_add(a, b));
     }
 
     @Test(dataProvider = "byteBinaryOpProvider")
@@ -1728,7 +1778,7 @@ public class ByteVectorMaxTests extends AbstractVectorTest {
     }
 
     static byte add(byte a, byte b) {
-        return (byte)(a + b);
+        return (byte)(scalar_add(a, b));
     }
 
     @Test(dataProvider = "byteBinaryOpProvider")
@@ -1785,7 +1835,7 @@ public class ByteVectorMaxTests extends AbstractVectorTest {
     }
 
     static byte SUB(byte a, byte b) {
-        return (byte)(a - b);
+        return (byte)(scalar_sub(a, b));
     }
 
     @Test(dataProvider = "byteBinaryOpProvider")
@@ -1806,7 +1856,7 @@ public class ByteVectorMaxTests extends AbstractVectorTest {
     }
 
     static byte sub(byte a, byte b) {
-        return (byte)(a - b);
+        return (byte)(scalar_sub(a, b));
     }
 
     @Test(dataProvider = "byteBinaryOpProvider")
@@ -1863,7 +1913,7 @@ public class ByteVectorMaxTests extends AbstractVectorTest {
     }
 
     static byte MUL(byte a, byte b) {
-        return (byte)(a * b);
+        return (byte)(scalar_mul(a, b));
     }
 
     @Test(dataProvider = "byteBinaryOpProvider")
@@ -1884,7 +1934,7 @@ public class ByteVectorMaxTests extends AbstractVectorTest {
     }
 
     static byte mul(byte a, byte b) {
-        return (byte)(a * b);
+        return (byte)(scalar_mul(a, b));
     }
 
     @Test(dataProvider = "byteBinaryOpProvider")
@@ -2031,7 +2081,7 @@ public class ByteVectorMaxTests extends AbstractVectorTest {
     }
 
     static byte FIRST_NONZERO(byte a, byte b) {
-        return (byte)((a)!=0?a:b);
+        return (byte)(firstNonZero(a, b));
     }
 
     @Test(dataProvider = "byteBinaryOpProvider")
@@ -3245,7 +3295,7 @@ public class ByteVectorMaxTests extends AbstractVectorTest {
     }
 
     static byte MIN(byte a, byte b) {
-        return (byte)(Math.min(a, b));
+        return (byte)(scalar_min(a, b));
     }
 
     @Test(dataProvider = "byteBinaryOpProvider")
@@ -3266,7 +3316,7 @@ public class ByteVectorMaxTests extends AbstractVectorTest {
     }
 
     static byte min(byte a, byte b) {
-        return (byte)(Math.min(a, b));
+        return (byte)(scalar_min(a, b));
     }
 
     @Test(dataProvider = "byteBinaryOpProvider")
@@ -3285,7 +3335,7 @@ public class ByteVectorMaxTests extends AbstractVectorTest {
     }
 
     static byte MAX(byte a, byte b) {
-        return (byte)(Math.max(a, b));
+        return (byte)(scalar_max(a, b));
     }
 
     @Test(dataProvider = "byteBinaryOpProvider")
@@ -3306,7 +3356,7 @@ public class ByteVectorMaxTests extends AbstractVectorTest {
     }
 
     static byte max(byte a, byte b) {
-        return (byte)(Math.max(a, b));
+        return (byte)(scalar_max(a, b));
     }
 
     @Test(dataProvider = "byteBinaryOpProvider")
@@ -3674,7 +3724,7 @@ public class ByteVectorMaxTests extends AbstractVectorTest {
     static byte ANDReduce(byte[] a, int idx) {
         byte res = AND_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res &= a[i];
+            res = scalar_and(res, a[i]);
         }
 
         return res;
@@ -3683,7 +3733,7 @@ public class ByteVectorMaxTests extends AbstractVectorTest {
     static byte ANDReduceAll(byte[] a) {
         byte res = AND_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res &= ANDReduce(a, i);
+            res = scalar_and(res, ANDReduce(a, i));
         }
 
         return res;
@@ -3701,7 +3751,7 @@ public class ByteVectorMaxTests extends AbstractVectorTest {
                 ByteVector av = ByteVector.fromArray(SPECIES, a, i);
                 byte v = av.reduceLanes(VectorOperators.AND);
                 r[i] = v;
-                ra &= v;
+                ra = scalar_and(ra, v);
             }
         }
 
@@ -3714,20 +3764,20 @@ public class ByteVectorMaxTests extends AbstractVectorTest {
         byte[] a = fa.apply(SPECIES.length());
         byte id = AND_IDENTITY;
 
-        assertEquals((byte) (id & id), id,
+        assertEquals((byte) (scalar_and(id, id)), id,
                             "AND(AND_IDENTITY, AND_IDENTITY) != AND_IDENTITY");
 
         byte x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((byte) (id & x), x);
-                assertEquals((byte) (x & id), x);
+                assertEquals((byte) (scalar_and(id, x)), x);
+                assertEquals((byte) (scalar_and(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((byte) (id & x), x,
+            assertEquals((byte) (scalar_and(id, x)), x,
                                 "AND(AND_IDENTITY, " + x + ") != " + x);
-            assertEquals((byte) (x & id), x,
+            assertEquals((byte) (scalar_and(x, id)), x,
                                 "AND(" + x + ", AND_IDENTITY) != " + x);
         }
     }
@@ -3736,7 +3786,7 @@ public class ByteVectorMaxTests extends AbstractVectorTest {
         byte res = AND_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res &= a[i];
+                res = scalar_and(res, a[i]);
         }
 
         return res;
@@ -3745,7 +3795,7 @@ public class ByteVectorMaxTests extends AbstractVectorTest {
     static byte ANDReduceAllMasked(byte[] a, boolean[] mask) {
         byte res = AND_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res &= ANDReduceMasked(a, i, mask);
+            res = scalar_and(res, ANDReduceMasked(a, i, mask));
         }
 
         return res;
@@ -3765,7 +3815,7 @@ public class ByteVectorMaxTests extends AbstractVectorTest {
                 ByteVector av = ByteVector.fromArray(SPECIES, a, i);
                 byte v = av.reduceLanes(VectorOperators.AND, vmask);
                 r[i] = v;
-                ra &= v;
+                ra = scalar_and(ra, v);
             }
         }
 
@@ -3776,7 +3826,7 @@ public class ByteVectorMaxTests extends AbstractVectorTest {
     static byte ORReduce(byte[] a, int idx) {
         byte res = OR_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res |= a[i];
+            res = scalar_or(res, a[i]);
         }
 
         return res;
@@ -3785,7 +3835,7 @@ public class ByteVectorMaxTests extends AbstractVectorTest {
     static byte ORReduceAll(byte[] a) {
         byte res = OR_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res |= ORReduce(a, i);
+            res = scalar_or(res, ORReduce(a, i));
         }
 
         return res;
@@ -3803,7 +3853,7 @@ public class ByteVectorMaxTests extends AbstractVectorTest {
                 ByteVector av = ByteVector.fromArray(SPECIES, a, i);
                 byte v = av.reduceLanes(VectorOperators.OR);
                 r[i] = v;
-                ra |= v;
+                ra = scalar_or(ra, v);
             }
         }
 
@@ -3816,20 +3866,20 @@ public class ByteVectorMaxTests extends AbstractVectorTest {
         byte[] a = fa.apply(SPECIES.length());
         byte id = OR_IDENTITY;
 
-        assertEquals((byte) (id | id), id,
+        assertEquals((byte) (scalar_or(id, id)), id,
                             "OR(OR_IDENTITY, OR_IDENTITY) != OR_IDENTITY");
 
         byte x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((byte) (id | x), x);
-                assertEquals((byte) (x | id), x);
+                assertEquals((byte) (scalar_or(id, x)), x);
+                assertEquals((byte) (scalar_or(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((byte) (id | x), x,
+            assertEquals((byte) (scalar_or(id, x)), x,
                                 "OR(OR_IDENTITY, " + x + ") != " + x);
-            assertEquals((byte) (x | id), x,
+            assertEquals((byte) (scalar_or(x, id)), x,
                                 "OR(" + x + ", OR_IDENTITY) != " + x);
         }
     }
@@ -3838,7 +3888,7 @@ public class ByteVectorMaxTests extends AbstractVectorTest {
         byte res = OR_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res |= a[i];
+                res = scalar_or(res, a[i]);
         }
 
         return res;
@@ -3847,7 +3897,7 @@ public class ByteVectorMaxTests extends AbstractVectorTest {
     static byte ORReduceAllMasked(byte[] a, boolean[] mask) {
         byte res = OR_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res |= ORReduceMasked(a, i, mask);
+            res = scalar_or(res, ORReduceMasked(a, i, mask));
         }
 
         return res;
@@ -3867,7 +3917,7 @@ public class ByteVectorMaxTests extends AbstractVectorTest {
                 ByteVector av = ByteVector.fromArray(SPECIES, a, i);
                 byte v = av.reduceLanes(VectorOperators.OR, vmask);
                 r[i] = v;
-                ra |= v;
+                ra = scalar_or(ra, v);
             }
         }
 
@@ -3878,7 +3928,7 @@ public class ByteVectorMaxTests extends AbstractVectorTest {
     static byte XORReduce(byte[] a, int idx) {
         byte res = XOR_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res ^= a[i];
+            res = scalar_xor(res, a[i]);
         }
 
         return res;
@@ -3887,7 +3937,7 @@ public class ByteVectorMaxTests extends AbstractVectorTest {
     static byte XORReduceAll(byte[] a) {
         byte res = XOR_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res ^= XORReduce(a, i);
+            res = scalar_xor(res, XORReduce(a, i));
         }
 
         return res;
@@ -3905,7 +3955,7 @@ public class ByteVectorMaxTests extends AbstractVectorTest {
                 ByteVector av = ByteVector.fromArray(SPECIES, a, i);
                 byte v = av.reduceLanes(VectorOperators.XOR);
                 r[i] = v;
-                ra ^= v;
+                ra = scalar_xor(ra, v);
             }
         }
 
@@ -3918,20 +3968,20 @@ public class ByteVectorMaxTests extends AbstractVectorTest {
         byte[] a = fa.apply(SPECIES.length());
         byte id = XOR_IDENTITY;
 
-        assertEquals((byte) (id ^ id), id,
+        assertEquals((byte) (scalar_xor(id, id)), id,
                             "XOR(XOR_IDENTITY, XOR_IDENTITY) != XOR_IDENTITY");
 
         byte x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((byte) (id ^ x), x);
-                assertEquals((byte) (x ^ id), x);
+                assertEquals((byte) (scalar_xor(id, x)), x);
+                assertEquals((byte) (scalar_xor(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((byte) (id ^ x), x,
+            assertEquals((byte) (scalar_xor(id, x)), x,
                                 "XOR(XOR_IDENTITY, " + x + ") != " + x);
-            assertEquals((byte) (x ^ id), x,
+            assertEquals((byte) (scalar_xor(x, id)), x,
                                 "XOR(" + x + ", XOR_IDENTITY) != " + x);
         }
     }
@@ -3940,7 +3990,7 @@ public class ByteVectorMaxTests extends AbstractVectorTest {
         byte res = XOR_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res ^= a[i];
+                res = scalar_xor(res, a[i]);
         }
 
         return res;
@@ -3949,7 +3999,7 @@ public class ByteVectorMaxTests extends AbstractVectorTest {
     static byte XORReduceAllMasked(byte[] a, boolean[] mask) {
         byte res = XOR_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res ^= XORReduceMasked(a, i, mask);
+            res = scalar_xor(res, XORReduceMasked(a, i, mask));
         }
 
         return res;
@@ -3969,7 +4019,7 @@ public class ByteVectorMaxTests extends AbstractVectorTest {
                 ByteVector av = ByteVector.fromArray(SPECIES, a, i);
                 byte v = av.reduceLanes(VectorOperators.XOR, vmask);
                 r[i] = v;
-                ra ^= v;
+                ra = scalar_xor(ra, v);
             }
         }
 
@@ -3980,7 +4030,7 @@ public class ByteVectorMaxTests extends AbstractVectorTest {
     static byte ADDReduce(byte[] a, int idx) {
         byte res = ADD_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res += a[i];
+            res = scalar_add(res, a[i]);
         }
 
         return res;
@@ -3989,7 +4039,7 @@ public class ByteVectorMaxTests extends AbstractVectorTest {
     static byte ADDReduceAll(byte[] a) {
         byte res = ADD_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduce(a, i);
+            res = scalar_add(res, ADDReduce(a, i));
         }
 
         return res;
@@ -4007,7 +4057,7 @@ public class ByteVectorMaxTests extends AbstractVectorTest {
                 ByteVector av = ByteVector.fromArray(SPECIES, a, i);
                 byte v = av.reduceLanes(VectorOperators.ADD);
                 r[i] = v;
-                ra += v;
+                ra = scalar_add(ra, v);
             }
         }
 
@@ -4020,20 +4070,20 @@ public class ByteVectorMaxTests extends AbstractVectorTest {
         byte[] a = fa.apply(SPECIES.length());
         byte id = ADD_IDENTITY;
 
-        assertEquals((byte) (id + id), id,
+        assertEquals((byte) (scalar_add(id, id)), id,
                             "ADD(ADD_IDENTITY, ADD_IDENTITY) != ADD_IDENTITY");
 
         byte x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((byte) (id + x), x);
-                assertEquals((byte) (x + id), x);
+                assertEquals((byte) (scalar_add(id, x)), x);
+                assertEquals((byte) (scalar_add(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((byte) (id + x), x,
+            assertEquals((byte) (scalar_add(id, x)), x,
                                 "ADD(ADD_IDENTITY, " + x + ") != " + x);
-            assertEquals((byte) (x + id), x,
+            assertEquals((byte) (scalar_add(x, id)), x,
                                 "ADD(" + x + ", ADD_IDENTITY) != " + x);
         }
     }
@@ -4042,7 +4092,7 @@ public class ByteVectorMaxTests extends AbstractVectorTest {
         byte res = ADD_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res += a[i];
+                res = scalar_add(res, a[i]);
         }
 
         return res;
@@ -4051,7 +4101,7 @@ public class ByteVectorMaxTests extends AbstractVectorTest {
     static byte ADDReduceAllMasked(byte[] a, boolean[] mask) {
         byte res = ADD_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduceMasked(a, i, mask);
+            res = scalar_add(res, ADDReduceMasked(a, i, mask));
         }
 
         return res;
@@ -4071,7 +4121,7 @@ public class ByteVectorMaxTests extends AbstractVectorTest {
                 ByteVector av = ByteVector.fromArray(SPECIES, a, i);
                 byte v = av.reduceLanes(VectorOperators.ADD, vmask);
                 r[i] = v;
-                ra += v;
+                ra = scalar_add(ra, v);
             }
         }
 
@@ -4082,7 +4132,7 @@ public class ByteVectorMaxTests extends AbstractVectorTest {
     static byte MULReduce(byte[] a, int idx) {
         byte res = MUL_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res *= a[i];
+            res = scalar_mul(res, a[i]);
         }
 
         return res;
@@ -4091,7 +4141,7 @@ public class ByteVectorMaxTests extends AbstractVectorTest {
     static byte MULReduceAll(byte[] a) {
         byte res = MUL_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res *= MULReduce(a, i);
+            res = scalar_mul(res, MULReduce(a, i));
         }
 
         return res;
@@ -4109,7 +4159,7 @@ public class ByteVectorMaxTests extends AbstractVectorTest {
                 ByteVector av = ByteVector.fromArray(SPECIES, a, i);
                 byte v = av.reduceLanes(VectorOperators.MUL);
                 r[i] = v;
-                ra *= v;
+                ra = scalar_mul(ra, v);
             }
         }
 
@@ -4122,20 +4172,20 @@ public class ByteVectorMaxTests extends AbstractVectorTest {
         byte[] a = fa.apply(SPECIES.length());
         byte id = MUL_IDENTITY;
 
-        assertEquals((byte) (id * id), id,
+        assertEquals((byte) (scalar_mul(id, id)), id,
                             "MUL(MUL_IDENTITY, MUL_IDENTITY) != MUL_IDENTITY");
 
         byte x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((byte) (id * x), x);
-                assertEquals((byte) (x * id), x);
+                assertEquals((byte) (scalar_mul(id, x)), x);
+                assertEquals((byte) (scalar_mul(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((byte) (id * x), x,
+            assertEquals((byte) (scalar_mul(id, x)), x,
                                 "MUL(MUL_IDENTITY, " + x + ") != " + x);
-            assertEquals((byte) (x * id), x,
+            assertEquals((byte) (scalar_mul(x, id)), x,
                                 "MUL(" + x + ", MUL_IDENTITY) != " + x);
         }
     }
@@ -4144,7 +4194,7 @@ public class ByteVectorMaxTests extends AbstractVectorTest {
         byte res = MUL_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res *= a[i];
+                res = scalar_mul(res, a[i]);
         }
 
         return res;
@@ -4153,7 +4203,7 @@ public class ByteVectorMaxTests extends AbstractVectorTest {
     static byte MULReduceAllMasked(byte[] a, boolean[] mask) {
         byte res = MUL_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res *= MULReduceMasked(a, i, mask);
+            res = scalar_mul(res, MULReduceMasked(a, i, mask));
         }
 
         return res;
@@ -4173,7 +4223,7 @@ public class ByteVectorMaxTests extends AbstractVectorTest {
                 ByteVector av = ByteVector.fromArray(SPECIES, a, i);
                 byte v = av.reduceLanes(VectorOperators.MUL, vmask);
                 r[i] = v;
-                ra *= v;
+                ra = scalar_mul(ra, v);
             }
         }
 
@@ -4184,7 +4234,7 @@ public class ByteVectorMaxTests extends AbstractVectorTest {
     static byte MINReduce(byte[] a, int idx) {
         byte res = MIN_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res = (byte) Math.min(res, a[i]);
+            res = scalar_min(res, a[i]);
         }
 
         return res;
@@ -4193,7 +4243,7 @@ public class ByteVectorMaxTests extends AbstractVectorTest {
     static byte MINReduceAll(byte[] a) {
         byte res = MIN_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (byte) Math.min(res, MINReduce(a, i));
+            res = scalar_min(res, MINReduce(a, i));
         }
 
         return res;
@@ -4211,7 +4261,7 @@ public class ByteVectorMaxTests extends AbstractVectorTest {
                 ByteVector av = ByteVector.fromArray(SPECIES, a, i);
                 byte v = av.reduceLanes(VectorOperators.MIN);
                 r[i] = v;
-                ra = (byte) Math.min(ra, v);
+                ra = scalar_min(ra, v);
             }
         }
 
@@ -4224,20 +4274,20 @@ public class ByteVectorMaxTests extends AbstractVectorTest {
         byte[] a = fa.apply(SPECIES.length());
         byte id = MIN_IDENTITY;
 
-        assertEquals((byte) Math.min(id, id), id,
+        assertEquals(scalar_min(id, id), id,
                             "MIN(MIN_IDENTITY, MIN_IDENTITY) != MIN_IDENTITY");
 
         byte x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((byte) Math.min(id, x), x);
-                assertEquals((byte) Math.min(x, id), x);
+                assertEquals(scalar_min(id, x), x);
+                assertEquals(scalar_min(x, id), x);
             }
         } catch (AssertionError e) {
-            assertEquals((byte) Math.min(id, x), x,
+            assertEquals(scalar_min(id, x), x,
                                 "MIN(MIN_IDENTITY, " + x + ") != " + x);
-            assertEquals((byte) Math.min(x, id), x,
+            assertEquals(scalar_min(x, id), x,
                                 "MIN(" + x + ", MIN_IDENTITY) != " + x);
         }
     }
@@ -4246,7 +4296,7 @@ public class ByteVectorMaxTests extends AbstractVectorTest {
         byte res = MIN_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res = (byte) Math.min(res, a[i]);
+                res = scalar_min(res, a[i]);
         }
 
         return res;
@@ -4255,7 +4305,7 @@ public class ByteVectorMaxTests extends AbstractVectorTest {
     static byte MINReduceAllMasked(byte[] a, boolean[] mask) {
         byte res = MIN_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (byte) Math.min(res, MINReduceMasked(a, i, mask));
+            res = scalar_min(res, MINReduceMasked(a, i, mask));
         }
 
         return res;
@@ -4275,7 +4325,7 @@ public class ByteVectorMaxTests extends AbstractVectorTest {
                 ByteVector av = ByteVector.fromArray(SPECIES, a, i);
                 byte v = av.reduceLanes(VectorOperators.MIN, vmask);
                 r[i] = v;
-                ra = (byte) Math.min(ra, v);
+                ra = scalar_min(ra, v);
             }
         }
 
@@ -4286,7 +4336,7 @@ public class ByteVectorMaxTests extends AbstractVectorTest {
     static byte MAXReduce(byte[] a, int idx) {
         byte res = MAX_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res = (byte) Math.max(res, a[i]);
+            res = scalar_max(res, a[i]);
         }
 
         return res;
@@ -4295,7 +4345,7 @@ public class ByteVectorMaxTests extends AbstractVectorTest {
     static byte MAXReduceAll(byte[] a) {
         byte res = MAX_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (byte) Math.max(res, MAXReduce(a, i));
+            res = scalar_max(res, MAXReduce(a, i));
         }
 
         return res;
@@ -4313,7 +4363,7 @@ public class ByteVectorMaxTests extends AbstractVectorTest {
                 ByteVector av = ByteVector.fromArray(SPECIES, a, i);
                 byte v = av.reduceLanes(VectorOperators.MAX);
                 r[i] = v;
-                ra = (byte) Math.max(ra, v);
+                ra = scalar_max(ra, v);
             }
         }
 
@@ -4326,20 +4376,20 @@ public class ByteVectorMaxTests extends AbstractVectorTest {
         byte[] a = fa.apply(SPECIES.length());
         byte id = MAX_IDENTITY;
 
-        assertEquals((byte) Math.max(id, id), id,
+        assertEquals(scalar_max(id, id), id,
                             "MAX(MAX_IDENTITY, MAX_IDENTITY) != MAX_IDENTITY");
 
         byte x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((byte) Math.max(id, x), x);
-                assertEquals((byte) Math.max(x, id), x);
+                assertEquals(scalar_max(id, x), x);
+                assertEquals(scalar_max(x, id), x);
             }
         } catch (AssertionError e) {
-            assertEquals((byte) Math.max(id, x), x,
+            assertEquals(scalar_max(id, x), x,
                                 "MAX(MAX_IDENTITY, " + x + ") != " + x);
-            assertEquals((byte) Math.max(x, id), x,
+            assertEquals(scalar_max(x, id), x,
                                 "MAX(" + x + ", MAX_IDENTITY) != " + x);
         }
     }
@@ -4348,7 +4398,7 @@ public class ByteVectorMaxTests extends AbstractVectorTest {
         byte res = MAX_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res = (byte) Math.max(res, a[i]);
+                res = scalar_max(res, a[i]);
         }
 
         return res;
@@ -4357,7 +4407,7 @@ public class ByteVectorMaxTests extends AbstractVectorTest {
     static byte MAXReduceAllMasked(byte[] a, boolean[] mask) {
         byte res = MAX_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (byte) Math.max(res, MAXReduceMasked(a, i, mask));
+            res = scalar_max(res, MAXReduceMasked(a, i, mask));
         }
 
         return res;
@@ -4377,7 +4427,7 @@ public class ByteVectorMaxTests extends AbstractVectorTest {
                 ByteVector av = ByteVector.fromArray(SPECIES, a, i);
                 byte v = av.reduceLanes(VectorOperators.MAX, vmask);
                 r[i] = v;
-                ra = (byte) Math.max(ra, v);
+                ra = scalar_max(ra, v);
             }
         }
 
@@ -5410,7 +5460,7 @@ public class ByteVectorMaxTests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] < b[i]);
+                assertEquals(mv.laneIsSet(j), lt(a[i + j], b[i]));
             }
         }
     }
@@ -5430,7 +5480,7 @@ public class ByteVectorMaxTests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] < b[i]));
+                assertEquals(mv.laneIsSet(j), mask[j] && (lt(a[i + j], b[i])));
             }
         }
     }
@@ -5446,7 +5496,7 @@ public class ByteVectorMaxTests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] < (byte)((long)b[i]));
+                assertEquals(mv.laneIsSet(j), lt(a[i + j], (byte)((long)b[i])));
             }
         }
     }
@@ -5466,7 +5516,7 @@ public class ByteVectorMaxTests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] < (byte)((long)b[i])));
+                assertEquals(mv.laneIsSet(j), mask[j] && (lt(a[i + j], (byte)((long)b[i]))));
             }
         }
     }
@@ -5482,7 +5532,7 @@ public class ByteVectorMaxTests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] == b[i]);
+                assertEquals(mv.laneIsSet(j), eq(a[i + j], b[i]));
             }
         }
     }
@@ -5502,7 +5552,7 @@ public class ByteVectorMaxTests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] == b[i]));
+                assertEquals(mv.laneIsSet(j), mask[j] && (eq(a[i + j], b[i])));
             }
         }
     }
@@ -5518,7 +5568,7 @@ public class ByteVectorMaxTests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] == (byte)((long)b[i]));
+                assertEquals(mv.laneIsSet(j), eq(a[i + j], (byte)((long)b[i])));
             }
         }
     }
@@ -5538,7 +5588,7 @@ public class ByteVectorMaxTests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] == (byte)((long)b[i])));
+                assertEquals(mv.laneIsSet(j), mask[j] && (eq(a[i + j], (byte)((long)b[i]))));
             }
         }
     }
@@ -6250,11 +6300,11 @@ public class ByteVectorMaxTests extends AbstractVectorTest {
     }
 
     static byte NEG(byte a) {
-        return (byte)(-((byte)a));
+        return (byte)(scalar_neg((byte)a));
     }
 
     static byte neg(byte a) {
-        return (byte)(-((byte)a));
+        return (byte)(scalar_neg((byte)a));
     }
 
     @Test(dataProvider = "byteUnaryOpProvider")
@@ -6306,11 +6356,11 @@ public class ByteVectorMaxTests extends AbstractVectorTest {
     }
 
     static byte ABS(byte a) {
-        return (byte)(Math.abs((byte)a));
+        return (byte)(scalar_abs((byte)a));
     }
 
     static byte abs(byte a) {
-        return (byte)(Math.abs((byte)a));
+        return (byte)(scalar_abs((byte)a));
     }
 
     @Test(dataProvider = "byteUnaryOpProvider")
@@ -6801,7 +6851,7 @@ public class ByteVectorMaxTests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] < b[i]);
+                assertEquals(mv.laneIsSet(j), lt(a[i + j], b[i]));
             }
         }
     }
@@ -6817,7 +6867,7 @@ public class ByteVectorMaxTests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] == b[i]);
+                assertEquals(mv.laneIsSet(j), eq(a[i + j], b[i]));
             }
         }
     }
@@ -6897,7 +6947,7 @@ public class ByteVectorMaxTests extends AbstractVectorTest {
     static long ADDReduceLong(byte[] a, int idx) {
         byte res = 0;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res += a[i];
+            res = scalar_add(res, a[i]);
         }
 
         return (long)res;
@@ -6906,7 +6956,7 @@ public class ByteVectorMaxTests extends AbstractVectorTest {
     static long ADDReduceAllLong(byte[] a) {
         long res = 0;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduceLong(a, i);
+            res = (long)scalar_add((byte)res, (byte)ADDReduceLong(a, i));
         }
 
         return res;
@@ -6924,8 +6974,8 @@ public class ByteVectorMaxTests extends AbstractVectorTest {
         }
 
         ra = 0;
-        for (int i = 0; i < a.length; i ++) {
-            ra += r[i];
+        for (int i = 0; i < a.length; i++) {
+            ra = (long)scalar_add((byte)ra, (byte)r[i]);
         }
 
         assertReductionLongArraysEquals(r, ra, a,
@@ -6935,8 +6985,9 @@ public class ByteVectorMaxTests extends AbstractVectorTest {
     static long ADDReduceLongMasked(byte[] a, int idx, boolean[] mask) {
         byte res = 0;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            if(mask[i % SPECIES.length()])
-                res += a[i];
+            if (mask[i % SPECIES.length()]) {
+                res = scalar_add(res, a[i]);
+            }
         }
 
         return (long)res;
@@ -6945,7 +6996,7 @@ public class ByteVectorMaxTests extends AbstractVectorTest {
     static long ADDReduceAllLongMasked(byte[] a, boolean[] mask) {
         long res = 0;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduceLongMasked(a, i, mask);
+            res = (long)scalar_add((byte)res, (byte)ADDReduceLongMasked(a, i, mask));
         }
 
         return res;
@@ -6965,8 +7016,8 @@ public class ByteVectorMaxTests extends AbstractVectorTest {
         }
 
         ra = 0;
-        for (int i = 0; i < a.length; i ++) {
-            ra += r[i];
+        for (int i = 0; i < a.length; i++) {
+            ra = (long)scalar_add((byte)ra, (byte)r[i]);
         }
 
         assertReductionLongArraysEqualsMasked(r, ra, a, mask,
diff --git a/test/jdk/jdk/incubator/vector/DoubleVector128Tests.java b/test/jdk/jdk/incubator/vector/DoubleVector128Tests.java
index 7b4b587b142..1457e5a51ca 100644
--- a/test/jdk/jdk/incubator/vector/DoubleVector128Tests.java
+++ b/test/jdk/jdk/incubator/vector/DoubleVector128Tests.java
@@ -1584,6 +1584,205 @@ relativeError));
         return Double.compare(a, (double) 0) != 0 ? a : b;
     }
 
+
+    static double scalar_add(double a, double b) {
+        return (double)(a + b);
+    }
+
+    static double scalar_sub(double a, double b) {
+        return (double)(a - b);
+    }
+
+    static double scalar_mul(double a, double b) {
+        return (double)(a * b);
+    }
+
+    static double scalar_min(double a, double b) {
+        return (double)(Math.min(a, b));
+    }
+
+    static double scalar_max(double a, double b) {
+        return (double)(Math.max(a, b));
+    }
+
+    static double scalar_div(double a, double b) {
+        return (double)(a / b);
+    }
+
+    static double scalar_fma(double a, double b, double c) {
+        return (double)(Math.fma(a, b, c));
+    }
+
+    static double scalar_abs(double a) {
+        return (double)(Math.abs(a));
+    }
+
+    static double scalar_neg(double a) {
+        return ((double)-a);
+    }
+
+    static double scalar_sin(double a) {
+        return (double)Math.sin((double)a);
+    }
+
+    static double scalar_exp(double a) {
+        return (double)Math.exp((double)a);
+    }
+
+    static double scalar_log1p(double a) {
+        return (double)Math.log1p((double)a);
+    }
+
+    static double scalar_log(double a) {
+        return (double)Math.log((double)a);
+    }
+
+    static double scalar_log10(double a) {
+        return (double)Math.log10((double)a);
+    }
+
+    static double scalar_expm1(double a) {
+        return (double)Math.expm1((double)a);
+    }
+
+    static double scalar_cos(double a) {
+        return (double)Math.cos((double)a);
+    }
+
+    static double scalar_tan(double a) {
+        return (double)Math.tan((double)a);
+    }
+
+    static double scalar_sinh(double a) {
+        return (double)Math.sinh((double)a);
+    }
+
+    static double scalar_cosh(double a) {
+        return (double)Math.cosh((double)a);
+    }
+
+    static double scalar_tanh(double a) {
+        return (double)Math.tanh((double)a);
+    }
+
+    static double scalar_asin(double a) {
+        return (double)Math.asin((double)a);
+    }
+
+    static double scalar_acos(double a) {
+        return (double)Math.acos((double)a);
+    }
+
+    static double scalar_atan(double a) {
+        return (double)Math.atan((double)a);
+    }
+
+    static double scalar_cbrt(double a) {
+        return (double)Math.cbrt((double)a);
+    }
+
+    static double scalar_sqrt(double a) {
+        return (double)Math.sqrt((double)a);
+    }
+
+    static double scalar_hypot(double a, double b) {
+        return (double)Math.hypot((double)a, (double)b);
+    }
+
+    static double scalar_pow(double a, double b) {
+        return (double)Math.pow((double)a, (double)b);
+    }
+
+    static double scalar_atan2(double a, double b) {
+        return (double)Math.atan2((double)a, (double)b);
+    }
+
+    static double strict_scalar_sin(double a) {
+        return (double)StrictMath.sin((double)a);
+    }
+
+    static double strict_scalar_exp(double a) {
+        return (double)StrictMath.exp((double)a);
+    }
+
+    static double strict_scalar_log1p(double a) {
+        return (double)StrictMath.log1p((double)a);
+    }
+
+    static double strict_scalar_log(double a) {
+        return (double)StrictMath.log((double)a);
+    }
+
+    static double strict_scalar_log10(double a) {
+        return (double)StrictMath.log10((double)a);
+    }
+
+    static double strict_scalar_expm1(double a) {
+        return (double)StrictMath.expm1((double)a);
+    }
+
+    static double strict_scalar_cos(double a) {
+        return (double)StrictMath.cos((double)a);
+    }
+
+    static double strict_scalar_tan(double a) {
+        return (double)StrictMath.tan((double)a);
+    }
+
+    static double strict_scalar_sinh(double a) {
+        return (double)StrictMath.sinh((double)a);
+    }
+
+    static double strict_scalar_cosh(double a) {
+        return (double)StrictMath.cosh((double)a);
+    }
+
+    static double strict_scalar_tanh(double a) {
+        return (double)StrictMath.tanh((double)a);
+    }
+
+    static double strict_scalar_asin(double a) {
+        return (double)StrictMath.asin((double)a);
+    }
+
+    static double strict_scalar_acos(double a) {
+        return (double)StrictMath.acos((double)a);
+    }
+
+    static double strict_scalar_atan(double a) {
+        return (double)StrictMath.atan((double)a);
+    }
+
+    static double strict_scalar_cbrt(double a) {
+        return (double)StrictMath.cbrt((double)a);
+    }
+
+    static double strict_scalar_sqrt(double a) {
+        return (double)StrictMath.sqrt((double)a);
+    }
+
+    static double strict_scalar_hypot(double a, double b) {
+        return (double)StrictMath.hypot((double)a, (double)b);
+    }
+
+    static double strict_scalar_pow(double a, double b) {
+        return (double)StrictMath.pow((double)a, (double)b);
+    }
+
+    static double strict_scalar_atan2(double a, double b) {
+        return (double)StrictMath.atan2((double)a, (double)b);
+    }
+
+    static boolean isNaN(double a) {
+        return Double.isNaN(a);
+    }
+    static boolean isFinite(double a) {
+        return Double.isFinite(a);
+    }
+    static boolean isInfinite(double a) {
+        return Double.isInfinite(a);
+    }
+
     @Test
     static void smokeTest1() {
         DoubleVector three = DoubleVector.broadcast(SPECIES, (byte)-3);
@@ -1677,7 +1876,7 @@ relativeError));
     }
 
     static double ADD(double a, double b) {
-        return (double)(a + b);
+        return (double)(scalar_add(a, b));
     }
 
     @Test(dataProvider = "doubleBinaryOpProvider")
@@ -1698,7 +1897,7 @@ relativeError));
     }
 
     static double add(double a, double b) {
-        return (double)(a + b);
+        return (double)(scalar_add(a, b));
     }
 
     @Test(dataProvider = "doubleBinaryOpProvider")
@@ -1755,7 +1954,7 @@ relativeError));
     }
 
     static double SUB(double a, double b) {
-        return (double)(a - b);
+        return (double)(scalar_sub(a, b));
     }
 
     @Test(dataProvider = "doubleBinaryOpProvider")
@@ -1776,7 +1975,7 @@ relativeError));
     }
 
     static double sub(double a, double b) {
-        return (double)(a - b);
+        return (double)(scalar_sub(a, b));
     }
 
     @Test(dataProvider = "doubleBinaryOpProvider")
@@ -1833,7 +2032,7 @@ relativeError));
     }
 
     static double MUL(double a, double b) {
-        return (double)(a * b);
+        return (double)(scalar_mul(a, b));
     }
 
     @Test(dataProvider = "doubleBinaryOpProvider")
@@ -1854,7 +2053,7 @@ relativeError));
     }
 
     static double mul(double a, double b) {
-        return (double)(a * b);
+        return (double)(scalar_mul(a, b));
     }
 
     @Test(dataProvider = "doubleBinaryOpProvider")
@@ -1911,7 +2110,7 @@ relativeError));
     }
 
     static double DIV(double a, double b) {
-        return (double)(a / b);
+        return (double)(scalar_div(a, b));
     }
 
     @Test(dataProvider = "doubleBinaryOpProvider")
@@ -1932,7 +2131,7 @@ relativeError));
     }
 
     static double div(double a, double b) {
-        return (double)(a / b);
+        return (double)(scalar_div(a, b));
     }
 
     @Test(dataProvider = "doubleBinaryOpProvider")
@@ -1989,7 +2188,7 @@ relativeError));
     }
 
     static double FIRST_NONZERO(double a, double b) {
-        return (double)(Double.doubleToLongBits(a)!=0?a:b);
+        return (double)(firstNonZero(a, b));
     }
 
     @Test(dataProvider = "doubleBinaryOpProvider")
@@ -2291,7 +2490,7 @@ relativeError));
     }
 
     static double MIN(double a, double b) {
-        return (double)(Math.min(a, b));
+        return (double)(scalar_min(a, b));
     }
 
     @Test(dataProvider = "doubleBinaryOpProvider")
@@ -2312,7 +2511,7 @@ relativeError));
     }
 
     static double min(double a, double b) {
-        return (double)(Math.min(a, b));
+        return (double)(scalar_min(a, b));
     }
 
     @Test(dataProvider = "doubleBinaryOpProvider")
@@ -2331,7 +2530,7 @@ relativeError));
     }
 
     static double MAX(double a, double b) {
-        return (double)(Math.max(a, b));
+        return (double)(scalar_max(a, b));
     }
 
     @Test(dataProvider = "doubleBinaryOpProvider")
@@ -2352,7 +2551,7 @@ relativeError));
     }
 
     static double max(double a, double b) {
-        return (double)(Math.max(a, b));
+        return (double)(scalar_max(a, b));
     }
 
     @Test(dataProvider = "doubleBinaryOpProvider")
@@ -2429,7 +2628,7 @@ relativeError));
     static double ADDReduce(double[] a, int idx) {
         double res = ADD_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res += a[i];
+            res = scalar_add(res, a[i]);
         }
 
         return res;
@@ -2438,7 +2637,7 @@ relativeError));
     static double ADDReduceAll(double[] a) {
         double res = ADD_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduce(a, i);
+            res = scalar_add(res, ADDReduce(a, i));
         }
 
         return res;
@@ -2456,7 +2655,7 @@ relativeError));
                 DoubleVector av = DoubleVector.fromArray(SPECIES, a, i);
                 double v = av.reduceLanes(VectorOperators.ADD);
                 r[i] = v;
-                ra += v;
+                ra = scalar_add(ra, v);
             }
         }
 
@@ -2469,20 +2668,20 @@ relativeError));
         double[] a = fa.apply(SPECIES.length());
         double id = ADD_IDENTITY;
 
-        assertEquals((double) (id + id), id,
+        assertEquals((double) (scalar_add(id, id)), id,
                             "ADD(ADD_IDENTITY, ADD_IDENTITY) != ADD_IDENTITY");
 
         double x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((double) (id + x), x);
-                assertEquals((double) (x + id), x);
+                assertEquals((double) (scalar_add(id, x)), x);
+                assertEquals((double) (scalar_add(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((double) (id + x), x,
+            assertEquals((double) (scalar_add(id, x)), x,
                                 "ADD(ADD_IDENTITY, " + x + ") != " + x);
-            assertEquals((double) (x + id), x,
+            assertEquals((double) (scalar_add(x, id)), x,
                                 "ADD(" + x + ", ADD_IDENTITY) != " + x);
         }
     }
@@ -2491,7 +2690,7 @@ relativeError));
         double res = ADD_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res += a[i];
+                res = scalar_add(res, a[i]);
         }
 
         return res;
@@ -2500,7 +2699,7 @@ relativeError));
     static double ADDReduceAllMasked(double[] a, boolean[] mask) {
         double res = ADD_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduceMasked(a, i, mask);
+            res = scalar_add(res, ADDReduceMasked(a, i, mask));
         }
 
         return res;
@@ -2520,7 +2719,7 @@ relativeError));
                 DoubleVector av = DoubleVector.fromArray(SPECIES, a, i);
                 double v = av.reduceLanes(VectorOperators.ADD, vmask);
                 r[i] = v;
-                ra += v;
+                ra = scalar_add(ra, v);
             }
         }
 
@@ -2531,7 +2730,7 @@ relativeError));
     static double MULReduce(double[] a, int idx) {
         double res = MUL_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res *= a[i];
+            res = scalar_mul(res, a[i]);
         }
 
         return res;
@@ -2540,7 +2739,7 @@ relativeError));
     static double MULReduceAll(double[] a) {
         double res = MUL_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res *= MULReduce(a, i);
+            res = scalar_mul(res, MULReduce(a, i));
         }
 
         return res;
@@ -2558,7 +2757,7 @@ relativeError));
                 DoubleVector av = DoubleVector.fromArray(SPECIES, a, i);
                 double v = av.reduceLanes(VectorOperators.MUL);
                 r[i] = v;
-                ra *= v;
+                ra = scalar_mul(ra, v);
             }
         }
 
@@ -2571,20 +2770,20 @@ relativeError));
         double[] a = fa.apply(SPECIES.length());
         double id = MUL_IDENTITY;
 
-        assertEquals((double) (id * id), id,
+        assertEquals((double) (scalar_mul(id, id)), id,
                             "MUL(MUL_IDENTITY, MUL_IDENTITY) != MUL_IDENTITY");
 
         double x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((double) (id * x), x);
-                assertEquals((double) (x * id), x);
+                assertEquals((double) (scalar_mul(id, x)), x);
+                assertEquals((double) (scalar_mul(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((double) (id * x), x,
+            assertEquals((double) (scalar_mul(id, x)), x,
                                 "MUL(MUL_IDENTITY, " + x + ") != " + x);
-            assertEquals((double) (x * id), x,
+            assertEquals((double) (scalar_mul(x, id)), x,
                                 "MUL(" + x + ", MUL_IDENTITY) != " + x);
         }
     }
@@ -2593,7 +2792,7 @@ relativeError));
         double res = MUL_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res *= a[i];
+                res = scalar_mul(res, a[i]);
         }
 
         return res;
@@ -2602,7 +2801,7 @@ relativeError));
     static double MULReduceAllMasked(double[] a, boolean[] mask) {
         double res = MUL_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res *= MULReduceMasked(a, i, mask);
+            res = scalar_mul(res, MULReduceMasked(a, i, mask));
         }
 
         return res;
@@ -2622,7 +2821,7 @@ relativeError));
                 DoubleVector av = DoubleVector.fromArray(SPECIES, a, i);
                 double v = av.reduceLanes(VectorOperators.MUL, vmask);
                 r[i] = v;
-                ra *= v;
+                ra = scalar_mul(ra, v);
             }
         }
 
@@ -2633,7 +2832,7 @@ relativeError));
     static double MINReduce(double[] a, int idx) {
         double res = MIN_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res = (double) Math.min(res, a[i]);
+            res = scalar_min(res, a[i]);
         }
 
         return res;
@@ -2642,7 +2841,7 @@ relativeError));
     static double MINReduceAll(double[] a) {
         double res = MIN_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (double) Math.min(res, MINReduce(a, i));
+            res = scalar_min(res, MINReduce(a, i));
         }
 
         return res;
@@ -2660,7 +2859,7 @@ relativeError));
                 DoubleVector av = DoubleVector.fromArray(SPECIES, a, i);
                 double v = av.reduceLanes(VectorOperators.MIN);
                 r[i] = v;
-                ra = (double) Math.min(ra, v);
+                ra = scalar_min(ra, v);
             }
         }
 
@@ -2673,20 +2872,20 @@ relativeError));
         double[] a = fa.apply(SPECIES.length());
         double id = MIN_IDENTITY;
 
-        assertEquals((double) Math.min(id, id), id,
+        assertEquals(scalar_min(id, id), id,
                             "MIN(MIN_IDENTITY, MIN_IDENTITY) != MIN_IDENTITY");
 
         double x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((double) Math.min(id, x), x);
-                assertEquals((double) Math.min(x, id), x);
+                assertEquals(scalar_min(id, x), x);
+                assertEquals(scalar_min(x, id), x);
             }
         } catch (AssertionError e) {
-            assertEquals((double) Math.min(id, x), x,
+            assertEquals(scalar_min(id, x), x,
                                 "MIN(MIN_IDENTITY, " + x + ") != " + x);
-            assertEquals((double) Math.min(x, id), x,
+            assertEquals(scalar_min(x, id), x,
                                 "MIN(" + x + ", MIN_IDENTITY) != " + x);
         }
     }
@@ -2695,7 +2894,7 @@ relativeError));
         double res = MIN_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res = (double) Math.min(res, a[i]);
+                res = scalar_min(res, a[i]);
         }
 
         return res;
@@ -2704,7 +2903,7 @@ relativeError));
     static double MINReduceAllMasked(double[] a, boolean[] mask) {
         double res = MIN_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (double) Math.min(res, MINReduceMasked(a, i, mask));
+            res = scalar_min(res, MINReduceMasked(a, i, mask));
         }
 
         return res;
@@ -2724,7 +2923,7 @@ relativeError));
                 DoubleVector av = DoubleVector.fromArray(SPECIES, a, i);
                 double v = av.reduceLanes(VectorOperators.MIN, vmask);
                 r[i] = v;
-                ra = (double) Math.min(ra, v);
+                ra = scalar_min(ra, v);
             }
         }
 
@@ -2735,7 +2934,7 @@ relativeError));
     static double MAXReduce(double[] a, int idx) {
         double res = MAX_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res = (double) Math.max(res, a[i]);
+            res = scalar_max(res, a[i]);
         }
 
         return res;
@@ -2744,7 +2943,7 @@ relativeError));
     static double MAXReduceAll(double[] a) {
         double res = MAX_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (double) Math.max(res, MAXReduce(a, i));
+            res = scalar_max(res, MAXReduce(a, i));
         }
 
         return res;
@@ -2762,7 +2961,7 @@ relativeError));
                 DoubleVector av = DoubleVector.fromArray(SPECIES, a, i);
                 double v = av.reduceLanes(VectorOperators.MAX);
                 r[i] = v;
-                ra = (double) Math.max(ra, v);
+                ra = scalar_max(ra, v);
             }
         }
 
@@ -2775,20 +2974,20 @@ relativeError));
         double[] a = fa.apply(SPECIES.length());
         double id = MAX_IDENTITY;
 
-        assertEquals((double) Math.max(id, id), id,
+        assertEquals(scalar_max(id, id), id,
                             "MAX(MAX_IDENTITY, MAX_IDENTITY) != MAX_IDENTITY");
 
         double x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((double) Math.max(id, x), x);
-                assertEquals((double) Math.max(x, id), x);
+                assertEquals(scalar_max(id, x), x);
+                assertEquals(scalar_max(x, id), x);
             }
         } catch (AssertionError e) {
-            assertEquals((double) Math.max(id, x), x,
+            assertEquals(scalar_max(id, x), x,
                                 "MAX(MAX_IDENTITY, " + x + ") != " + x);
-            assertEquals((double) Math.max(x, id), x,
+            assertEquals(scalar_max(x, id), x,
                                 "MAX(" + x + ", MAX_IDENTITY) != " + x);
         }
     }
@@ -2797,7 +2996,7 @@ relativeError));
         double res = MAX_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res = (double) Math.max(res, a[i]);
+                res = scalar_max(res, a[i]);
         }
 
         return res;
@@ -2806,7 +3005,7 @@ relativeError));
     static double MAXReduceAllMasked(double[] a, boolean[] mask) {
         double res = MAX_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (double) Math.max(res, MAXReduceMasked(a, i, mask));
+            res = scalar_max(res, MAXReduceMasked(a, i, mask));
         }
 
         return res;
@@ -2826,7 +3025,7 @@ relativeError));
                 DoubleVector av = DoubleVector.fromArray(SPECIES, a, i);
                 double v = av.reduceLanes(VectorOperators.MAX, vmask);
                 r[i] = v;
-                ra = (double) Math.max(ra, v);
+                ra = scalar_max(ra, v);
             }
         }
 
@@ -3038,7 +3237,7 @@ relativeError));
     }
 
     static boolean testIS_FINITE(double a) {
-        return Double.isFinite(a);
+        return isFinite(a);
     }
 
     @Test(dataProvider = "doubleTestOpProvider")
@@ -3079,7 +3278,7 @@ relativeError));
     }
 
     static boolean testIS_NAN(double a) {
-        return Double.isNaN(a);
+        return isNaN(a);
     }
 
     @Test(dataProvider = "doubleTestOpProvider")
@@ -3120,7 +3319,7 @@ relativeError));
     }
 
     static boolean testIS_INFINITE(double a) {
-        return Double.isInfinite(a);
+        return isInfinite(a);
     }
 
     @Test(dataProvider = "doubleTestOpProvider")
@@ -3461,7 +3660,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] < b[i]);
+                assertEquals(mv.laneIsSet(j), lt(a[i + j], b[i]));
             }
         }
     }
@@ -3481,7 +3680,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] < b[i]));
+                assertEquals(mv.laneIsSet(j), mask[j] && (lt(a[i + j], b[i])));
             }
         }
     }
@@ -3497,7 +3696,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] < (double)((long)b[i]));
+                assertEquals(mv.laneIsSet(j), lt(a[i + j], (double)((long)b[i])));
             }
         }
     }
@@ -3517,7 +3716,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] < (double)((long)b[i])));
+                assertEquals(mv.laneIsSet(j), mask[j] && (lt(a[i + j], (double)((long)b[i]))));
             }
         }
     }
@@ -3533,7 +3732,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] == b[i]);
+                assertEquals(mv.laneIsSet(j), eq(a[i + j], b[i]));
             }
         }
     }
@@ -3553,7 +3752,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] == b[i]));
+                assertEquals(mv.laneIsSet(j), mask[j] && (eq(a[i + j], b[i])));
             }
         }
     }
@@ -3569,7 +3768,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] == (double)((long)b[i]));
+                assertEquals(mv.laneIsSet(j), eq(a[i + j], (double)((long)b[i])));
             }
         }
     }
@@ -3589,7 +3788,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] == (double)((long)b[i])));
+                assertEquals(mv.laneIsSet(j), mask[j] && (eq(a[i + j], (double)((long)b[i]))));
             }
         }
     }
@@ -4089,11 +4288,11 @@ relativeError));
     }
 
     static double SIN(double a) {
-        return (double)(Math.sin((double)a));
+        return (double)(scalar_sin(a));
     }
 
     static double strictSIN(double a) {
-        return (double)(StrictMath.sin((double)a));
+        return (double)(strict_scalar_sin(a));
     }
 
     @Test(dataProvider = "doubleUnaryOpProvider")
@@ -4112,11 +4311,11 @@ relativeError));
     }
 
     static double EXP(double a) {
-        return (double)(Math.exp((double)a));
+        return (double)(scalar_exp(a));
     }
 
     static double strictEXP(double a) {
-        return (double)(StrictMath.exp((double)a));
+        return (double)(strict_scalar_exp(a));
     }
 
     @Test(dataProvider = "doubleUnaryOpProvider")
@@ -4135,11 +4334,11 @@ relativeError));
     }
 
     static double LOG1P(double a) {
-        return (double)(Math.log1p((double)a));
+        return (double)(scalar_log1p(a));
     }
 
     static double strictLOG1P(double a) {
-        return (double)(StrictMath.log1p((double)a));
+        return (double)(strict_scalar_log1p(a));
     }
 
     @Test(dataProvider = "doubleUnaryOpProvider")
@@ -4158,11 +4357,11 @@ relativeError));
     }
 
     static double LOG(double a) {
-        return (double)(Math.log((double)a));
+        return (double)(scalar_log(a));
     }
 
     static double strictLOG(double a) {
-        return (double)(StrictMath.log((double)a));
+        return (double)(strict_scalar_log(a));
     }
 
     @Test(dataProvider = "doubleUnaryOpProvider")
@@ -4181,11 +4380,11 @@ relativeError));
     }
 
     static double LOG10(double a) {
-        return (double)(Math.log10((double)a));
+        return (double)(scalar_log10(a));
     }
 
     static double strictLOG10(double a) {
-        return (double)(StrictMath.log10((double)a));
+        return (double)(strict_scalar_log10(a));
     }
 
     @Test(dataProvider = "doubleUnaryOpProvider")
@@ -4204,11 +4403,11 @@ relativeError));
     }
 
     static double EXPM1(double a) {
-        return (double)(Math.expm1((double)a));
+        return (double)(scalar_expm1(a));
     }
 
     static double strictEXPM1(double a) {
-        return (double)(StrictMath.expm1((double)a));
+        return (double)(strict_scalar_expm1(a));
     }
 
     @Test(dataProvider = "doubleUnaryOpProvider")
@@ -4227,11 +4426,11 @@ relativeError));
     }
 
     static double COS(double a) {
-        return (double)(Math.cos((double)a));
+        return (double)(scalar_cos(a));
     }
 
     static double strictCOS(double a) {
-        return (double)(StrictMath.cos((double)a));
+        return (double)(strict_scalar_cos(a));
     }
 
     @Test(dataProvider = "doubleUnaryOpProvider")
@@ -4250,11 +4449,11 @@ relativeError));
     }
 
     static double TAN(double a) {
-        return (double)(Math.tan((double)a));
+        return (double)(scalar_tan(a));
     }
 
     static double strictTAN(double a) {
-        return (double)(StrictMath.tan((double)a));
+        return (double)(strict_scalar_tan(a));
     }
 
     @Test(dataProvider = "doubleUnaryOpProvider")
@@ -4273,11 +4472,11 @@ relativeError));
     }
 
     static double SINH(double a) {
-        return (double)(Math.sinh((double)a));
+        return (double)(scalar_sinh(a));
     }
 
     static double strictSINH(double a) {
-        return (double)(StrictMath.sinh((double)a));
+        return (double)(strict_scalar_sinh(a));
     }
 
     @Test(dataProvider = "doubleUnaryOpProvider")
@@ -4296,11 +4495,11 @@ relativeError));
     }
 
     static double COSH(double a) {
-        return (double)(Math.cosh((double)a));
+        return (double)(scalar_cosh(a));
     }
 
     static double strictCOSH(double a) {
-        return (double)(StrictMath.cosh((double)a));
+        return (double)(strict_scalar_cosh(a));
     }
 
     @Test(dataProvider = "doubleUnaryOpProvider")
@@ -4319,11 +4518,11 @@ relativeError));
     }
 
     static double TANH(double a) {
-        return (double)(Math.tanh((double)a));
+        return (double)(scalar_tanh(a));
     }
 
     static double strictTANH(double a) {
-        return (double)(StrictMath.tanh((double)a));
+        return (double)(strict_scalar_tanh(a));
     }
 
     @Test(dataProvider = "doubleUnaryOpProvider")
@@ -4342,11 +4541,11 @@ relativeError));
     }
 
     static double ASIN(double a) {
-        return (double)(Math.asin((double)a));
+        return (double)(scalar_asin(a));
     }
 
     static double strictASIN(double a) {
-        return (double)(StrictMath.asin((double)a));
+        return (double)(strict_scalar_asin(a));
     }
 
     @Test(dataProvider = "doubleUnaryOpProvider")
@@ -4365,11 +4564,11 @@ relativeError));
     }
 
     static double ACOS(double a) {
-        return (double)(Math.acos((double)a));
+        return (double)(scalar_acos(a));
     }
 
     static double strictACOS(double a) {
-        return (double)(StrictMath.acos((double)a));
+        return (double)(strict_scalar_acos(a));
     }
 
     @Test(dataProvider = "doubleUnaryOpProvider")
@@ -4388,11 +4587,11 @@ relativeError));
     }
 
     static double ATAN(double a) {
-        return (double)(Math.atan((double)a));
+        return (double)(scalar_atan(a));
     }
 
     static double strictATAN(double a) {
-        return (double)(StrictMath.atan((double)a));
+        return (double)(strict_scalar_atan(a));
     }
 
     @Test(dataProvider = "doubleUnaryOpProvider")
@@ -4411,11 +4610,11 @@ relativeError));
     }
 
     static double CBRT(double a) {
-        return (double)(Math.cbrt((double)a));
+        return (double)(scalar_cbrt(a));
     }
 
     static double strictCBRT(double a) {
-        return (double)(StrictMath.cbrt((double)a));
+        return (double)(strict_scalar_cbrt(a));
     }
 
     @Test(dataProvider = "doubleUnaryOpProvider")
@@ -4434,11 +4633,11 @@ relativeError));
     }
 
     static double HYPOT(double a, double b) {
-        return (double)(Math.hypot((double)a, (double)b));
+        return (double)(scalar_hypot(a, b));
     }
 
     static double strictHYPOT(double a, double b) {
-        return (double)(StrictMath.hypot((double)a, (double)b));
+        return (double)(strict_scalar_hypot(a, b));
     }
 
     @Test(dataProvider = "doubleBinaryOpProvider")
@@ -4460,11 +4659,11 @@ relativeError));
 
 
     static double POW(double a, double b) {
-        return (double)(Math.pow((double)a, (double)b));
+        return (double)(scalar_pow(a, b));
     }
 
     static double strictPOW(double a, double b) {
-        return (double)(StrictMath.pow((double)a, (double)b));
+        return (double)(strict_scalar_pow(a, b));
     }
 
     @Test(dataProvider = "doubleBinaryOpProvider")
@@ -4486,11 +4685,11 @@ relativeError));
 
 
     static double pow(double a, double b) {
-        return (double)(Math.pow((double)a, (double)b));
+        return (double)(scalar_pow(a, b));
     }
 
     static double strictpow(double a, double b) {
-        return (double)(StrictMath.pow((double)a, (double)b));
+        return (double)(strict_scalar_pow(a, b));
     }
 
     @Test(dataProvider = "doubleBinaryOpProvider")
@@ -4512,11 +4711,11 @@ relativeError));
 
 
     static double ATAN2(double a, double b) {
-        return (double)(Math.atan2((double)a, (double)b));
+        return (double)(scalar_atan2(a, b));
     }
 
     static double strictATAN2(double a, double b) {
-        return (double)(StrictMath.atan2((double)a, (double)b));
+        return (double)(strict_scalar_atan2(a, b));
     }
 
     @Test(dataProvider = "doubleBinaryOpProvider")
@@ -4568,11 +4767,11 @@ relativeError));
 
 
     static double FMA(double a, double b, double c) {
-        return (double)(Math.fma(a, b, c));
+        return (double)(scalar_fma(a, b, c));
     }
 
     static double fma(double a, double b, double c) {
-        return (double)(Math.fma(a, b, c));
+        return (double)(scalar_fma(a, b, c));
     }
 
     @Test(dataProvider = "doubleTernaryOpProvider")
@@ -4792,11 +4991,11 @@ relativeError));
     }
 
     static double NEG(double a) {
-        return (double)(-((double)a));
+        return (double)(scalar_neg((double)a));
     }
 
     static double neg(double a) {
-        return (double)(-((double)a));
+        return (double)(scalar_neg((double)a));
     }
 
     @Test(dataProvider = "doubleUnaryOpProvider")
@@ -4848,11 +5047,11 @@ relativeError));
     }
 
     static double ABS(double a) {
-        return (double)(Math.abs((double)a));
+        return (double)(scalar_abs((double)a));
     }
 
     static double abs(double a) {
-        return (double)(Math.abs((double)a));
+        return (double)(scalar_abs((double)a));
     }
 
     @Test(dataProvider = "doubleUnaryOpProvider")
@@ -4904,11 +5103,11 @@ relativeError));
     }
 
     static double SQRT(double a) {
-        return (double)(Math.sqrt((double)a));
+        return (double)(scalar_sqrt(a));
     }
 
     static double sqrt(double a) {
-        return (double)(Math.sqrt((double)a));
+        return (double)(scalar_sqrt(a));
     }
 
     @Test(dataProvider = "doubleUnaryOpProvider")
@@ -5121,7 +5320,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] < b[i]);
+                assertEquals(mv.laneIsSet(j), lt(a[i + j], b[i]));
             }
         }
     }
@@ -5137,7 +5336,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] == b[i]);
+                assertEquals(mv.laneIsSet(j), eq(a[i + j], b[i]));
             }
         }
     }
@@ -5196,7 +5395,7 @@ relativeError));
     static long ADDReduceLong(double[] a, int idx) {
         double res = 0;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res += a[i];
+            res = scalar_add(res, a[i]);
         }
 
         return (long)res;
@@ -5205,7 +5404,7 @@ relativeError));
     static long ADDReduceAllLong(double[] a) {
         long res = 0;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduceLong(a, i);
+            res = (long)scalar_add((double)res, (double)ADDReduceLong(a, i));
         }
 
         return res;
@@ -5223,8 +5422,8 @@ relativeError));
         }
 
         ra = 0;
-        for (int i = 0; i < a.length; i ++) {
-            ra += r[i];
+        for (int i = 0; i < a.length; i++) {
+            ra = (long)scalar_add((double)ra, (double)r[i]);
         }
 
         assertReductionLongArraysEquals(r, ra, a,
@@ -5234,8 +5433,9 @@ relativeError));
     static long ADDReduceLongMasked(double[] a, int idx, boolean[] mask) {
         double res = 0;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            if(mask[i % SPECIES.length()])
-                res += a[i];
+            if (mask[i % SPECIES.length()]) {
+                res = scalar_add(res, a[i]);
+            }
         }
 
         return (long)res;
@@ -5244,7 +5444,7 @@ relativeError));
     static long ADDReduceAllLongMasked(double[] a, boolean[] mask) {
         long res = 0;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduceLongMasked(a, i, mask);
+            res = (long)scalar_add((double)res, (double)ADDReduceLongMasked(a, i, mask));
         }
 
         return res;
@@ -5264,8 +5464,8 @@ relativeError));
         }
 
         ra = 0;
-        for (int i = 0; i < a.length; i ++) {
-            ra += r[i];
+        for (int i = 0; i < a.length; i++) {
+            ra = (long)scalar_add((double)ra, (double)r[i]);
         }
 
         assertReductionLongArraysEqualsMasked(r, ra, a, mask,
diff --git a/test/jdk/jdk/incubator/vector/DoubleVector256Tests.java b/test/jdk/jdk/incubator/vector/DoubleVector256Tests.java
index 4d650d7b407..e417abe52e6 100644
--- a/test/jdk/jdk/incubator/vector/DoubleVector256Tests.java
+++ b/test/jdk/jdk/incubator/vector/DoubleVector256Tests.java
@@ -1584,6 +1584,205 @@ relativeError));
         return Double.compare(a, (double) 0) != 0 ? a : b;
     }
 
+
+    static double scalar_add(double a, double b) {
+        return (double)(a + b);
+    }
+
+    static double scalar_sub(double a, double b) {
+        return (double)(a - b);
+    }
+
+    static double scalar_mul(double a, double b) {
+        return (double)(a * b);
+    }
+
+    static double scalar_min(double a, double b) {
+        return (double)(Math.min(a, b));
+    }
+
+    static double scalar_max(double a, double b) {
+        return (double)(Math.max(a, b));
+    }
+
+    static double scalar_div(double a, double b) {
+        return (double)(a / b);
+    }
+
+    static double scalar_fma(double a, double b, double c) {
+        return (double)(Math.fma(a, b, c));
+    }
+
+    static double scalar_abs(double a) {
+        return (double)(Math.abs(a));
+    }
+
+    static double scalar_neg(double a) {
+        return ((double)-a);
+    }
+
+    static double scalar_sin(double a) {
+        return (double)Math.sin((double)a);
+    }
+
+    static double scalar_exp(double a) {
+        return (double)Math.exp((double)a);
+    }
+
+    static double scalar_log1p(double a) {
+        return (double)Math.log1p((double)a);
+    }
+
+    static double scalar_log(double a) {
+        return (double)Math.log((double)a);
+    }
+
+    static double scalar_log10(double a) {
+        return (double)Math.log10((double)a);
+    }
+
+    static double scalar_expm1(double a) {
+        return (double)Math.expm1((double)a);
+    }
+
+    static double scalar_cos(double a) {
+        return (double)Math.cos((double)a);
+    }
+
+    static double scalar_tan(double a) {
+        return (double)Math.tan((double)a);
+    }
+
+    static double scalar_sinh(double a) {
+        return (double)Math.sinh((double)a);
+    }
+
+    static double scalar_cosh(double a) {
+        return (double)Math.cosh((double)a);
+    }
+
+    static double scalar_tanh(double a) {
+        return (double)Math.tanh((double)a);
+    }
+
+    static double scalar_asin(double a) {
+        return (double)Math.asin((double)a);
+    }
+
+    static double scalar_acos(double a) {
+        return (double)Math.acos((double)a);
+    }
+
+    static double scalar_atan(double a) {
+        return (double)Math.atan((double)a);
+    }
+
+    static double scalar_cbrt(double a) {
+        return (double)Math.cbrt((double)a);
+    }
+
+    static double scalar_sqrt(double a) {
+        return (double)Math.sqrt((double)a);
+    }
+
+    static double scalar_hypot(double a, double b) {
+        return (double)Math.hypot((double)a, (double)b);
+    }
+
+    static double scalar_pow(double a, double b) {
+        return (double)Math.pow((double)a, (double)b);
+    }
+
+    static double scalar_atan2(double a, double b) {
+        return (double)Math.atan2((double)a, (double)b);
+    }
+
+    static double strict_scalar_sin(double a) {
+        return (double)StrictMath.sin((double)a);
+    }
+
+    static double strict_scalar_exp(double a) {
+        return (double)StrictMath.exp((double)a);
+    }
+
+    static double strict_scalar_log1p(double a) {
+        return (double)StrictMath.log1p((double)a);
+    }
+
+    static double strict_scalar_log(double a) {
+        return (double)StrictMath.log((double)a);
+    }
+
+    static double strict_scalar_log10(double a) {
+        return (double)StrictMath.log10((double)a);
+    }
+
+    static double strict_scalar_expm1(double a) {
+        return (double)StrictMath.expm1((double)a);
+    }
+
+    static double strict_scalar_cos(double a) {
+        return (double)StrictMath.cos((double)a);
+    }
+
+    static double strict_scalar_tan(double a) {
+        return (double)StrictMath.tan((double)a);
+    }
+
+    static double strict_scalar_sinh(double a) {
+        return (double)StrictMath.sinh((double)a);
+    }
+
+    static double strict_scalar_cosh(double a) {
+        return (double)StrictMath.cosh((double)a);
+    }
+
+    static double strict_scalar_tanh(double a) {
+        return (double)StrictMath.tanh((double)a);
+    }
+
+    static double strict_scalar_asin(double a) {
+        return (double)StrictMath.asin((double)a);
+    }
+
+    static double strict_scalar_acos(double a) {
+        return (double)StrictMath.acos((double)a);
+    }
+
+    static double strict_scalar_atan(double a) {
+        return (double)StrictMath.atan((double)a);
+    }
+
+    static double strict_scalar_cbrt(double a) {
+        return (double)StrictMath.cbrt((double)a);
+    }
+
+    static double strict_scalar_sqrt(double a) {
+        return (double)StrictMath.sqrt((double)a);
+    }
+
+    static double strict_scalar_hypot(double a, double b) {
+        return (double)StrictMath.hypot((double)a, (double)b);
+    }
+
+    static double strict_scalar_pow(double a, double b) {
+        return (double)StrictMath.pow((double)a, (double)b);
+    }
+
+    static double strict_scalar_atan2(double a, double b) {
+        return (double)StrictMath.atan2((double)a, (double)b);
+    }
+
+    static boolean isNaN(double a) {
+        return Double.isNaN(a);
+    }
+    static boolean isFinite(double a) {
+        return Double.isFinite(a);
+    }
+    static boolean isInfinite(double a) {
+        return Double.isInfinite(a);
+    }
+
     @Test
     static void smokeTest1() {
         DoubleVector three = DoubleVector.broadcast(SPECIES, (byte)-3);
@@ -1677,7 +1876,7 @@ relativeError));
     }
 
     static double ADD(double a, double b) {
-        return (double)(a + b);
+        return (double)(scalar_add(a, b));
     }
 
     @Test(dataProvider = "doubleBinaryOpProvider")
@@ -1698,7 +1897,7 @@ relativeError));
     }
 
     static double add(double a, double b) {
-        return (double)(a + b);
+        return (double)(scalar_add(a, b));
     }
 
     @Test(dataProvider = "doubleBinaryOpProvider")
@@ -1755,7 +1954,7 @@ relativeError));
     }
 
     static double SUB(double a, double b) {
-        return (double)(a - b);
+        return (double)(scalar_sub(a, b));
     }
 
     @Test(dataProvider = "doubleBinaryOpProvider")
@@ -1776,7 +1975,7 @@ relativeError));
     }
 
     static double sub(double a, double b) {
-        return (double)(a - b);
+        return (double)(scalar_sub(a, b));
     }
 
     @Test(dataProvider = "doubleBinaryOpProvider")
@@ -1833,7 +2032,7 @@ relativeError));
     }
 
     static double MUL(double a, double b) {
-        return (double)(a * b);
+        return (double)(scalar_mul(a, b));
     }
 
     @Test(dataProvider = "doubleBinaryOpProvider")
@@ -1854,7 +2053,7 @@ relativeError));
     }
 
     static double mul(double a, double b) {
-        return (double)(a * b);
+        return (double)(scalar_mul(a, b));
     }
 
     @Test(dataProvider = "doubleBinaryOpProvider")
@@ -1911,7 +2110,7 @@ relativeError));
     }
 
     static double DIV(double a, double b) {
-        return (double)(a / b);
+        return (double)(scalar_div(a, b));
     }
 
     @Test(dataProvider = "doubleBinaryOpProvider")
@@ -1932,7 +2131,7 @@ relativeError));
     }
 
     static double div(double a, double b) {
-        return (double)(a / b);
+        return (double)(scalar_div(a, b));
     }
 
     @Test(dataProvider = "doubleBinaryOpProvider")
@@ -1989,7 +2188,7 @@ relativeError));
     }
 
     static double FIRST_NONZERO(double a, double b) {
-        return (double)(Double.doubleToLongBits(a)!=0?a:b);
+        return (double)(firstNonZero(a, b));
     }
 
     @Test(dataProvider = "doubleBinaryOpProvider")
@@ -2291,7 +2490,7 @@ relativeError));
     }
 
     static double MIN(double a, double b) {
-        return (double)(Math.min(a, b));
+        return (double)(scalar_min(a, b));
     }
 
     @Test(dataProvider = "doubleBinaryOpProvider")
@@ -2312,7 +2511,7 @@ relativeError));
     }
 
     static double min(double a, double b) {
-        return (double)(Math.min(a, b));
+        return (double)(scalar_min(a, b));
     }
 
     @Test(dataProvider = "doubleBinaryOpProvider")
@@ -2331,7 +2530,7 @@ relativeError));
     }
 
     static double MAX(double a, double b) {
-        return (double)(Math.max(a, b));
+        return (double)(scalar_max(a, b));
     }
 
     @Test(dataProvider = "doubleBinaryOpProvider")
@@ -2352,7 +2551,7 @@ relativeError));
     }
 
     static double max(double a, double b) {
-        return (double)(Math.max(a, b));
+        return (double)(scalar_max(a, b));
     }
 
     @Test(dataProvider = "doubleBinaryOpProvider")
@@ -2429,7 +2628,7 @@ relativeError));
     static double ADDReduce(double[] a, int idx) {
         double res = ADD_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res += a[i];
+            res = scalar_add(res, a[i]);
         }
 
         return res;
@@ -2438,7 +2637,7 @@ relativeError));
     static double ADDReduceAll(double[] a) {
         double res = ADD_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduce(a, i);
+            res = scalar_add(res, ADDReduce(a, i));
         }
 
         return res;
@@ -2456,7 +2655,7 @@ relativeError));
                 DoubleVector av = DoubleVector.fromArray(SPECIES, a, i);
                 double v = av.reduceLanes(VectorOperators.ADD);
                 r[i] = v;
-                ra += v;
+                ra = scalar_add(ra, v);
             }
         }
 
@@ -2469,20 +2668,20 @@ relativeError));
         double[] a = fa.apply(SPECIES.length());
         double id = ADD_IDENTITY;
 
-        assertEquals((double) (id + id), id,
+        assertEquals((double) (scalar_add(id, id)), id,
                             "ADD(ADD_IDENTITY, ADD_IDENTITY) != ADD_IDENTITY");
 
         double x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((double) (id + x), x);
-                assertEquals((double) (x + id), x);
+                assertEquals((double) (scalar_add(id, x)), x);
+                assertEquals((double) (scalar_add(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((double) (id + x), x,
+            assertEquals((double) (scalar_add(id, x)), x,
                                 "ADD(ADD_IDENTITY, " + x + ") != " + x);
-            assertEquals((double) (x + id), x,
+            assertEquals((double) (scalar_add(x, id)), x,
                                 "ADD(" + x + ", ADD_IDENTITY) != " + x);
         }
     }
@@ -2491,7 +2690,7 @@ relativeError));
         double res = ADD_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res += a[i];
+                res = scalar_add(res, a[i]);
         }
 
         return res;
@@ -2500,7 +2699,7 @@ relativeError));
     static double ADDReduceAllMasked(double[] a, boolean[] mask) {
         double res = ADD_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduceMasked(a, i, mask);
+            res = scalar_add(res, ADDReduceMasked(a, i, mask));
         }
 
         return res;
@@ -2520,7 +2719,7 @@ relativeError));
                 DoubleVector av = DoubleVector.fromArray(SPECIES, a, i);
                 double v = av.reduceLanes(VectorOperators.ADD, vmask);
                 r[i] = v;
-                ra += v;
+                ra = scalar_add(ra, v);
             }
         }
 
@@ -2531,7 +2730,7 @@ relativeError));
     static double MULReduce(double[] a, int idx) {
         double res = MUL_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res *= a[i];
+            res = scalar_mul(res, a[i]);
         }
 
         return res;
@@ -2540,7 +2739,7 @@ relativeError));
     static double MULReduceAll(double[] a) {
         double res = MUL_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res *= MULReduce(a, i);
+            res = scalar_mul(res, MULReduce(a, i));
         }
 
         return res;
@@ -2558,7 +2757,7 @@ relativeError));
                 DoubleVector av = DoubleVector.fromArray(SPECIES, a, i);
                 double v = av.reduceLanes(VectorOperators.MUL);
                 r[i] = v;
-                ra *= v;
+                ra = scalar_mul(ra, v);
             }
         }
 
@@ -2571,20 +2770,20 @@ relativeError));
         double[] a = fa.apply(SPECIES.length());
         double id = MUL_IDENTITY;
 
-        assertEquals((double) (id * id), id,
+        assertEquals((double) (scalar_mul(id, id)), id,
                             "MUL(MUL_IDENTITY, MUL_IDENTITY) != MUL_IDENTITY");
 
         double x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((double) (id * x), x);
-                assertEquals((double) (x * id), x);
+                assertEquals((double) (scalar_mul(id, x)), x);
+                assertEquals((double) (scalar_mul(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((double) (id * x), x,
+            assertEquals((double) (scalar_mul(id, x)), x,
                                 "MUL(MUL_IDENTITY, " + x + ") != " + x);
-            assertEquals((double) (x * id), x,
+            assertEquals((double) (scalar_mul(x, id)), x,
                                 "MUL(" + x + ", MUL_IDENTITY) != " + x);
         }
     }
@@ -2593,7 +2792,7 @@ relativeError));
         double res = MUL_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res *= a[i];
+                res = scalar_mul(res, a[i]);
         }
 
         return res;
@@ -2602,7 +2801,7 @@ relativeError));
     static double MULReduceAllMasked(double[] a, boolean[] mask) {
         double res = MUL_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res *= MULReduceMasked(a, i, mask);
+            res = scalar_mul(res, MULReduceMasked(a, i, mask));
         }
 
         return res;
@@ -2622,7 +2821,7 @@ relativeError));
                 DoubleVector av = DoubleVector.fromArray(SPECIES, a, i);
                 double v = av.reduceLanes(VectorOperators.MUL, vmask);
                 r[i] = v;
-                ra *= v;
+                ra = scalar_mul(ra, v);
             }
         }
 
@@ -2633,7 +2832,7 @@ relativeError));
     static double MINReduce(double[] a, int idx) {
         double res = MIN_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res = (double) Math.min(res, a[i]);
+            res = scalar_min(res, a[i]);
         }
 
         return res;
@@ -2642,7 +2841,7 @@ relativeError));
     static double MINReduceAll(double[] a) {
         double res = MIN_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (double) Math.min(res, MINReduce(a, i));
+            res = scalar_min(res, MINReduce(a, i));
         }
 
         return res;
@@ -2660,7 +2859,7 @@ relativeError));
                 DoubleVector av = DoubleVector.fromArray(SPECIES, a, i);
                 double v = av.reduceLanes(VectorOperators.MIN);
                 r[i] = v;
-                ra = (double) Math.min(ra, v);
+                ra = scalar_min(ra, v);
             }
         }
 
@@ -2673,20 +2872,20 @@ relativeError));
         double[] a = fa.apply(SPECIES.length());
         double id = MIN_IDENTITY;
 
-        assertEquals((double) Math.min(id, id), id,
+        assertEquals(scalar_min(id, id), id,
                             "MIN(MIN_IDENTITY, MIN_IDENTITY) != MIN_IDENTITY");
 
         double x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((double) Math.min(id, x), x);
-                assertEquals((double) Math.min(x, id), x);
+                assertEquals(scalar_min(id, x), x);
+                assertEquals(scalar_min(x, id), x);
             }
         } catch (AssertionError e) {
-            assertEquals((double) Math.min(id, x), x,
+            assertEquals(scalar_min(id, x), x,
                                 "MIN(MIN_IDENTITY, " + x + ") != " + x);
-            assertEquals((double) Math.min(x, id), x,
+            assertEquals(scalar_min(x, id), x,
                                 "MIN(" + x + ", MIN_IDENTITY) != " + x);
         }
     }
@@ -2695,7 +2894,7 @@ relativeError));
         double res = MIN_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res = (double) Math.min(res, a[i]);
+                res = scalar_min(res, a[i]);
         }
 
         return res;
@@ -2704,7 +2903,7 @@ relativeError));
     static double MINReduceAllMasked(double[] a, boolean[] mask) {
         double res = MIN_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (double) Math.min(res, MINReduceMasked(a, i, mask));
+            res = scalar_min(res, MINReduceMasked(a, i, mask));
         }
 
         return res;
@@ -2724,7 +2923,7 @@ relativeError));
                 DoubleVector av = DoubleVector.fromArray(SPECIES, a, i);
                 double v = av.reduceLanes(VectorOperators.MIN, vmask);
                 r[i] = v;
-                ra = (double) Math.min(ra, v);
+                ra = scalar_min(ra, v);
             }
         }
 
@@ -2735,7 +2934,7 @@ relativeError));
     static double MAXReduce(double[] a, int idx) {
         double res = MAX_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res = (double) Math.max(res, a[i]);
+            res = scalar_max(res, a[i]);
         }
 
         return res;
@@ -2744,7 +2943,7 @@ relativeError));
     static double MAXReduceAll(double[] a) {
         double res = MAX_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (double) Math.max(res, MAXReduce(a, i));
+            res = scalar_max(res, MAXReduce(a, i));
         }
 
         return res;
@@ -2762,7 +2961,7 @@ relativeError));
                 DoubleVector av = DoubleVector.fromArray(SPECIES, a, i);
                 double v = av.reduceLanes(VectorOperators.MAX);
                 r[i] = v;
-                ra = (double) Math.max(ra, v);
+                ra = scalar_max(ra, v);
             }
         }
 
@@ -2775,20 +2974,20 @@ relativeError));
         double[] a = fa.apply(SPECIES.length());
         double id = MAX_IDENTITY;
 
-        assertEquals((double) Math.max(id, id), id,
+        assertEquals(scalar_max(id, id), id,
                             "MAX(MAX_IDENTITY, MAX_IDENTITY) != MAX_IDENTITY");
 
         double x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((double) Math.max(id, x), x);
-                assertEquals((double) Math.max(x, id), x);
+                assertEquals(scalar_max(id, x), x);
+                assertEquals(scalar_max(x, id), x);
             }
         } catch (AssertionError e) {
-            assertEquals((double) Math.max(id, x), x,
+            assertEquals(scalar_max(id, x), x,
                                 "MAX(MAX_IDENTITY, " + x + ") != " + x);
-            assertEquals((double) Math.max(x, id), x,
+            assertEquals(scalar_max(x, id), x,
                                 "MAX(" + x + ", MAX_IDENTITY) != " + x);
         }
     }
@@ -2797,7 +2996,7 @@ relativeError));
         double res = MAX_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res = (double) Math.max(res, a[i]);
+                res = scalar_max(res, a[i]);
         }
 
         return res;
@@ -2806,7 +3005,7 @@ relativeError));
     static double MAXReduceAllMasked(double[] a, boolean[] mask) {
         double res = MAX_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (double) Math.max(res, MAXReduceMasked(a, i, mask));
+            res = scalar_max(res, MAXReduceMasked(a, i, mask));
         }
 
         return res;
@@ -2826,7 +3025,7 @@ relativeError));
                 DoubleVector av = DoubleVector.fromArray(SPECIES, a, i);
                 double v = av.reduceLanes(VectorOperators.MAX, vmask);
                 r[i] = v;
-                ra = (double) Math.max(ra, v);
+                ra = scalar_max(ra, v);
             }
         }
 
@@ -3038,7 +3237,7 @@ relativeError));
     }
 
     static boolean testIS_FINITE(double a) {
-        return Double.isFinite(a);
+        return isFinite(a);
     }
 
     @Test(dataProvider = "doubleTestOpProvider")
@@ -3079,7 +3278,7 @@ relativeError));
     }
 
     static boolean testIS_NAN(double a) {
-        return Double.isNaN(a);
+        return isNaN(a);
     }
 
     @Test(dataProvider = "doubleTestOpProvider")
@@ -3120,7 +3319,7 @@ relativeError));
     }
 
     static boolean testIS_INFINITE(double a) {
-        return Double.isInfinite(a);
+        return isInfinite(a);
     }
 
     @Test(dataProvider = "doubleTestOpProvider")
@@ -3461,7 +3660,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] < b[i]);
+                assertEquals(mv.laneIsSet(j), lt(a[i + j], b[i]));
             }
         }
     }
@@ -3481,7 +3680,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] < b[i]));
+                assertEquals(mv.laneIsSet(j), mask[j] && (lt(a[i + j], b[i])));
             }
         }
     }
@@ -3497,7 +3696,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] < (double)((long)b[i]));
+                assertEquals(mv.laneIsSet(j), lt(a[i + j], (double)((long)b[i])));
             }
         }
     }
@@ -3517,7 +3716,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] < (double)((long)b[i])));
+                assertEquals(mv.laneIsSet(j), mask[j] && (lt(a[i + j], (double)((long)b[i]))));
             }
         }
     }
@@ -3533,7 +3732,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] == b[i]);
+                assertEquals(mv.laneIsSet(j), eq(a[i + j], b[i]));
             }
         }
     }
@@ -3553,7 +3752,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] == b[i]));
+                assertEquals(mv.laneIsSet(j), mask[j] && (eq(a[i + j], b[i])));
             }
         }
     }
@@ -3569,7 +3768,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] == (double)((long)b[i]));
+                assertEquals(mv.laneIsSet(j), eq(a[i + j], (double)((long)b[i])));
             }
         }
     }
@@ -3589,7 +3788,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] == (double)((long)b[i])));
+                assertEquals(mv.laneIsSet(j), mask[j] && (eq(a[i + j], (double)((long)b[i]))));
             }
         }
     }
@@ -4089,11 +4288,11 @@ relativeError));
     }
 
     static double SIN(double a) {
-        return (double)(Math.sin((double)a));
+        return (double)(scalar_sin(a));
     }
 
     static double strictSIN(double a) {
-        return (double)(StrictMath.sin((double)a));
+        return (double)(strict_scalar_sin(a));
     }
 
     @Test(dataProvider = "doubleUnaryOpProvider")
@@ -4112,11 +4311,11 @@ relativeError));
     }
 
     static double EXP(double a) {
-        return (double)(Math.exp((double)a));
+        return (double)(scalar_exp(a));
     }
 
     static double strictEXP(double a) {
-        return (double)(StrictMath.exp((double)a));
+        return (double)(strict_scalar_exp(a));
     }
 
     @Test(dataProvider = "doubleUnaryOpProvider")
@@ -4135,11 +4334,11 @@ relativeError));
     }
 
     static double LOG1P(double a) {
-        return (double)(Math.log1p((double)a));
+        return (double)(scalar_log1p(a));
     }
 
     static double strictLOG1P(double a) {
-        return (double)(StrictMath.log1p((double)a));
+        return (double)(strict_scalar_log1p(a));
     }
 
     @Test(dataProvider = "doubleUnaryOpProvider")
@@ -4158,11 +4357,11 @@ relativeError));
     }
 
     static double LOG(double a) {
-        return (double)(Math.log((double)a));
+        return (double)(scalar_log(a));
     }
 
     static double strictLOG(double a) {
-        return (double)(StrictMath.log((double)a));
+        return (double)(strict_scalar_log(a));
     }
 
     @Test(dataProvider = "doubleUnaryOpProvider")
@@ -4181,11 +4380,11 @@ relativeError));
     }
 
     static double LOG10(double a) {
-        return (double)(Math.log10((double)a));
+        return (double)(scalar_log10(a));
     }
 
     static double strictLOG10(double a) {
-        return (double)(StrictMath.log10((double)a));
+        return (double)(strict_scalar_log10(a));
     }
 
     @Test(dataProvider = "doubleUnaryOpProvider")
@@ -4204,11 +4403,11 @@ relativeError));
     }
 
     static double EXPM1(double a) {
-        return (double)(Math.expm1((double)a));
+        return (double)(scalar_expm1(a));
     }
 
     static double strictEXPM1(double a) {
-        return (double)(StrictMath.expm1((double)a));
+        return (double)(strict_scalar_expm1(a));
     }
 
     @Test(dataProvider = "doubleUnaryOpProvider")
@@ -4227,11 +4426,11 @@ relativeError));
     }
 
     static double COS(double a) {
-        return (double)(Math.cos((double)a));
+        return (double)(scalar_cos(a));
     }
 
     static double strictCOS(double a) {
-        return (double)(StrictMath.cos((double)a));
+        return (double)(strict_scalar_cos(a));
     }
 
     @Test(dataProvider = "doubleUnaryOpProvider")
@@ -4250,11 +4449,11 @@ relativeError));
     }
 
     static double TAN(double a) {
-        return (double)(Math.tan((double)a));
+        return (double)(scalar_tan(a));
     }
 
     static double strictTAN(double a) {
-        return (double)(StrictMath.tan((double)a));
+        return (double)(strict_scalar_tan(a));
     }
 
     @Test(dataProvider = "doubleUnaryOpProvider")
@@ -4273,11 +4472,11 @@ relativeError));
     }
 
     static double SINH(double a) {
-        return (double)(Math.sinh((double)a));
+        return (double)(scalar_sinh(a));
     }
 
     static double strictSINH(double a) {
-        return (double)(StrictMath.sinh((double)a));
+        return (double)(strict_scalar_sinh(a));
     }
 
     @Test(dataProvider = "doubleUnaryOpProvider")
@@ -4296,11 +4495,11 @@ relativeError));
     }
 
     static double COSH(double a) {
-        return (double)(Math.cosh((double)a));
+        return (double)(scalar_cosh(a));
     }
 
     static double strictCOSH(double a) {
-        return (double)(StrictMath.cosh((double)a));
+        return (double)(strict_scalar_cosh(a));
     }
 
     @Test(dataProvider = "doubleUnaryOpProvider")
@@ -4319,11 +4518,11 @@ relativeError));
     }
 
     static double TANH(double a) {
-        return (double)(Math.tanh((double)a));
+        return (double)(scalar_tanh(a));
     }
 
     static double strictTANH(double a) {
-        return (double)(StrictMath.tanh((double)a));
+        return (double)(strict_scalar_tanh(a));
     }
 
     @Test(dataProvider = "doubleUnaryOpProvider")
@@ -4342,11 +4541,11 @@ relativeError));
     }
 
     static double ASIN(double a) {
-        return (double)(Math.asin((double)a));
+        return (double)(scalar_asin(a));
     }
 
     static double strictASIN(double a) {
-        return (double)(StrictMath.asin((double)a));
+        return (double)(strict_scalar_asin(a));
     }
 
     @Test(dataProvider = "doubleUnaryOpProvider")
@@ -4365,11 +4564,11 @@ relativeError));
     }
 
     static double ACOS(double a) {
-        return (double)(Math.acos((double)a));
+        return (double)(scalar_acos(a));
     }
 
     static double strictACOS(double a) {
-        return (double)(StrictMath.acos((double)a));
+        return (double)(strict_scalar_acos(a));
     }
 
     @Test(dataProvider = "doubleUnaryOpProvider")
@@ -4388,11 +4587,11 @@ relativeError));
     }
 
     static double ATAN(double a) {
-        return (double)(Math.atan((double)a));
+        return (double)(scalar_atan(a));
     }
 
     static double strictATAN(double a) {
-        return (double)(StrictMath.atan((double)a));
+        return (double)(strict_scalar_atan(a));
     }
 
     @Test(dataProvider = "doubleUnaryOpProvider")
@@ -4411,11 +4610,11 @@ relativeError));
     }
 
     static double CBRT(double a) {
-        return (double)(Math.cbrt((double)a));
+        return (double)(scalar_cbrt(a));
     }
 
     static double strictCBRT(double a) {
-        return (double)(StrictMath.cbrt((double)a));
+        return (double)(strict_scalar_cbrt(a));
     }
 
     @Test(dataProvider = "doubleUnaryOpProvider")
@@ -4434,11 +4633,11 @@ relativeError));
     }
 
     static double HYPOT(double a, double b) {
-        return (double)(Math.hypot((double)a, (double)b));
+        return (double)(scalar_hypot(a, b));
     }
 
     static double strictHYPOT(double a, double b) {
-        return (double)(StrictMath.hypot((double)a, (double)b));
+        return (double)(strict_scalar_hypot(a, b));
     }
 
     @Test(dataProvider = "doubleBinaryOpProvider")
@@ -4460,11 +4659,11 @@ relativeError));
 
 
     static double POW(double a, double b) {
-        return (double)(Math.pow((double)a, (double)b));
+        return (double)(scalar_pow(a, b));
     }
 
     static double strictPOW(double a, double b) {
-        return (double)(StrictMath.pow((double)a, (double)b));
+        return (double)(strict_scalar_pow(a, b));
     }
 
     @Test(dataProvider = "doubleBinaryOpProvider")
@@ -4486,11 +4685,11 @@ relativeError));
 
 
     static double pow(double a, double b) {
-        return (double)(Math.pow((double)a, (double)b));
+        return (double)(scalar_pow(a, b));
     }
 
     static double strictpow(double a, double b) {
-        return (double)(StrictMath.pow((double)a, (double)b));
+        return (double)(strict_scalar_pow(a, b));
     }
 
     @Test(dataProvider = "doubleBinaryOpProvider")
@@ -4512,11 +4711,11 @@ relativeError));
 
 
     static double ATAN2(double a, double b) {
-        return (double)(Math.atan2((double)a, (double)b));
+        return (double)(scalar_atan2(a, b));
     }
 
     static double strictATAN2(double a, double b) {
-        return (double)(StrictMath.atan2((double)a, (double)b));
+        return (double)(strict_scalar_atan2(a, b));
     }
 
     @Test(dataProvider = "doubleBinaryOpProvider")
@@ -4568,11 +4767,11 @@ relativeError));
 
 
     static double FMA(double a, double b, double c) {
-        return (double)(Math.fma(a, b, c));
+        return (double)(scalar_fma(a, b, c));
     }
 
     static double fma(double a, double b, double c) {
-        return (double)(Math.fma(a, b, c));
+        return (double)(scalar_fma(a, b, c));
     }
 
     @Test(dataProvider = "doubleTernaryOpProvider")
@@ -4792,11 +4991,11 @@ relativeError));
     }
 
     static double NEG(double a) {
-        return (double)(-((double)a));
+        return (double)(scalar_neg((double)a));
     }
 
     static double neg(double a) {
-        return (double)(-((double)a));
+        return (double)(scalar_neg((double)a));
     }
 
     @Test(dataProvider = "doubleUnaryOpProvider")
@@ -4848,11 +5047,11 @@ relativeError));
     }
 
     static double ABS(double a) {
-        return (double)(Math.abs((double)a));
+        return (double)(scalar_abs((double)a));
     }
 
     static double abs(double a) {
-        return (double)(Math.abs((double)a));
+        return (double)(scalar_abs((double)a));
     }
 
     @Test(dataProvider = "doubleUnaryOpProvider")
@@ -4904,11 +5103,11 @@ relativeError));
     }
 
     static double SQRT(double a) {
-        return (double)(Math.sqrt((double)a));
+        return (double)(scalar_sqrt(a));
     }
 
     static double sqrt(double a) {
-        return (double)(Math.sqrt((double)a));
+        return (double)(scalar_sqrt(a));
     }
 
     @Test(dataProvider = "doubleUnaryOpProvider")
@@ -5121,7 +5320,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] < b[i]);
+                assertEquals(mv.laneIsSet(j), lt(a[i + j], b[i]));
             }
         }
     }
@@ -5137,7 +5336,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] == b[i]);
+                assertEquals(mv.laneIsSet(j), eq(a[i + j], b[i]));
             }
         }
     }
@@ -5196,7 +5395,7 @@ relativeError));
     static long ADDReduceLong(double[] a, int idx) {
         double res = 0;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res += a[i];
+            res = scalar_add(res, a[i]);
         }
 
         return (long)res;
@@ -5205,7 +5404,7 @@ relativeError));
     static long ADDReduceAllLong(double[] a) {
         long res = 0;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduceLong(a, i);
+            res = (long)scalar_add((double)res, (double)ADDReduceLong(a, i));
         }
 
         return res;
@@ -5223,8 +5422,8 @@ relativeError));
         }
 
         ra = 0;
-        for (int i = 0; i < a.length; i ++) {
-            ra += r[i];
+        for (int i = 0; i < a.length; i++) {
+            ra = (long)scalar_add((double)ra, (double)r[i]);
         }
 
         assertReductionLongArraysEquals(r, ra, a,
@@ -5234,8 +5433,9 @@ relativeError));
     static long ADDReduceLongMasked(double[] a, int idx, boolean[] mask) {
         double res = 0;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            if(mask[i % SPECIES.length()])
-                res += a[i];
+            if (mask[i % SPECIES.length()]) {
+                res = scalar_add(res, a[i]);
+            }
         }
 
         return (long)res;
@@ -5244,7 +5444,7 @@ relativeError));
     static long ADDReduceAllLongMasked(double[] a, boolean[] mask) {
         long res = 0;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduceLongMasked(a, i, mask);
+            res = (long)scalar_add((double)res, (double)ADDReduceLongMasked(a, i, mask));
         }
 
         return res;
@@ -5264,8 +5464,8 @@ relativeError));
         }
 
         ra = 0;
-        for (int i = 0; i < a.length; i ++) {
-            ra += r[i];
+        for (int i = 0; i < a.length; i++) {
+            ra = (long)scalar_add((double)ra, (double)r[i]);
         }
 
         assertReductionLongArraysEqualsMasked(r, ra, a, mask,
diff --git a/test/jdk/jdk/incubator/vector/DoubleVector512Tests.java b/test/jdk/jdk/incubator/vector/DoubleVector512Tests.java
index 534470e194c..d23b2bf1511 100644
--- a/test/jdk/jdk/incubator/vector/DoubleVector512Tests.java
+++ b/test/jdk/jdk/incubator/vector/DoubleVector512Tests.java
@@ -1584,6 +1584,205 @@ relativeError));
         return Double.compare(a, (double) 0) != 0 ? a : b;
     }
 
+
+    static double scalar_add(double a, double b) {
+        return (double)(a + b);
+    }
+
+    static double scalar_sub(double a, double b) {
+        return (double)(a - b);
+    }
+
+    static double scalar_mul(double a, double b) {
+        return (double)(a * b);
+    }
+
+    static double scalar_min(double a, double b) {
+        return (double)(Math.min(a, b));
+    }
+
+    static double scalar_max(double a, double b) {
+        return (double)(Math.max(a, b));
+    }
+
+    static double scalar_div(double a, double b) {
+        return (double)(a / b);
+    }
+
+    static double scalar_fma(double a, double b, double c) {
+        return (double)(Math.fma(a, b, c));
+    }
+
+    static double scalar_abs(double a) {
+        return (double)(Math.abs(a));
+    }
+
+    static double scalar_neg(double a) {
+        return ((double)-a);
+    }
+
+    static double scalar_sin(double a) {
+        return (double)Math.sin((double)a);
+    }
+
+    static double scalar_exp(double a) {
+        return (double)Math.exp((double)a);
+    }
+
+    static double scalar_log1p(double a) {
+        return (double)Math.log1p((double)a);
+    }
+
+    static double scalar_log(double a) {
+        return (double)Math.log((double)a);
+    }
+
+    static double scalar_log10(double a) {
+        return (double)Math.log10((double)a);
+    }
+
+    static double scalar_expm1(double a) {
+        return (double)Math.expm1((double)a);
+    }
+
+    static double scalar_cos(double a) {
+        return (double)Math.cos((double)a);
+    }
+
+    static double scalar_tan(double a) {
+        return (double)Math.tan((double)a);
+    }
+
+    static double scalar_sinh(double a) {
+        return (double)Math.sinh((double)a);
+    }
+
+    static double scalar_cosh(double a) {
+        return (double)Math.cosh((double)a);
+    }
+
+    static double scalar_tanh(double a) {
+        return (double)Math.tanh((double)a);
+    }
+
+    static double scalar_asin(double a) {
+        return (double)Math.asin((double)a);
+    }
+
+    static double scalar_acos(double a) {
+        return (double)Math.acos((double)a);
+    }
+
+    static double scalar_atan(double a) {
+        return (double)Math.atan((double)a);
+    }
+
+    static double scalar_cbrt(double a) {
+        return (double)Math.cbrt((double)a);
+    }
+
+    static double scalar_sqrt(double a) {
+        return (double)Math.sqrt((double)a);
+    }
+
+    static double scalar_hypot(double a, double b) {
+        return (double)Math.hypot((double)a, (double)b);
+    }
+
+    static double scalar_pow(double a, double b) {
+        return (double)Math.pow((double)a, (double)b);
+    }
+
+    static double scalar_atan2(double a, double b) {
+        return (double)Math.atan2((double)a, (double)b);
+    }
+
+    static double strict_scalar_sin(double a) {
+        return (double)StrictMath.sin((double)a);
+    }
+
+    static double strict_scalar_exp(double a) {
+        return (double)StrictMath.exp((double)a);
+    }
+
+    static double strict_scalar_log1p(double a) {
+        return (double)StrictMath.log1p((double)a);
+    }
+
+    static double strict_scalar_log(double a) {
+        return (double)StrictMath.log((double)a);
+    }
+
+    static double strict_scalar_log10(double a) {
+        return (double)StrictMath.log10((double)a);
+    }
+
+    static double strict_scalar_expm1(double a) {
+        return (double)StrictMath.expm1((double)a);
+    }
+
+    static double strict_scalar_cos(double a) {
+        return (double)StrictMath.cos((double)a);
+    }
+
+    static double strict_scalar_tan(double a) {
+        return (double)StrictMath.tan((double)a);
+    }
+
+    static double strict_scalar_sinh(double a) {
+        return (double)StrictMath.sinh((double)a);
+    }
+
+    static double strict_scalar_cosh(double a) {
+        return (double)StrictMath.cosh((double)a);
+    }
+
+    static double strict_scalar_tanh(double a) {
+        return (double)StrictMath.tanh((double)a);
+    }
+
+    static double strict_scalar_asin(double a) {
+        return (double)StrictMath.asin((double)a);
+    }
+
+    static double strict_scalar_acos(double a) {
+        return (double)StrictMath.acos((double)a);
+    }
+
+    static double strict_scalar_atan(double a) {
+        return (double)StrictMath.atan((double)a);
+    }
+
+    static double strict_scalar_cbrt(double a) {
+        return (double)StrictMath.cbrt((double)a);
+    }
+
+    static double strict_scalar_sqrt(double a) {
+        return (double)StrictMath.sqrt((double)a);
+    }
+
+    static double strict_scalar_hypot(double a, double b) {
+        return (double)StrictMath.hypot((double)a, (double)b);
+    }
+
+    static double strict_scalar_pow(double a, double b) {
+        return (double)StrictMath.pow((double)a, (double)b);
+    }
+
+    static double strict_scalar_atan2(double a, double b) {
+        return (double)StrictMath.atan2((double)a, (double)b);
+    }
+
+    static boolean isNaN(double a) {
+        return Double.isNaN(a);
+    }
+    static boolean isFinite(double a) {
+        return Double.isFinite(a);
+    }
+    static boolean isInfinite(double a) {
+        return Double.isInfinite(a);
+    }
+
     @Test
     static void smokeTest1() {
         DoubleVector three = DoubleVector.broadcast(SPECIES, (byte)-3);
@@ -1677,7 +1876,7 @@ relativeError));
     }
 
     static double ADD(double a, double b) {
-        return (double)(a + b);
+        return (double)(scalar_add(a, b));
     }
 
     @Test(dataProvider = "doubleBinaryOpProvider")
@@ -1698,7 +1897,7 @@ relativeError));
     }
 
     static double add(double a, double b) {
-        return (double)(a + b);
+        return (double)(scalar_add(a, b));
     }
 
     @Test(dataProvider = "doubleBinaryOpProvider")
@@ -1755,7 +1954,7 @@ relativeError));
     }
 
     static double SUB(double a, double b) {
-        return (double)(a - b);
+        return (double)(scalar_sub(a, b));
     }
 
     @Test(dataProvider = "doubleBinaryOpProvider")
@@ -1776,7 +1975,7 @@ relativeError));
     }
 
     static double sub(double a, double b) {
-        return (double)(a - b);
+        return (double)(scalar_sub(a, b));
     }
 
     @Test(dataProvider = "doubleBinaryOpProvider")
@@ -1833,7 +2032,7 @@ relativeError));
     }
 
     static double MUL(double a, double b) {
-        return (double)(a * b);
+        return (double)(scalar_mul(a, b));
     }
 
     @Test(dataProvider = "doubleBinaryOpProvider")
@@ -1854,7 +2053,7 @@ relativeError));
     }
 
     static double mul(double a, double b) {
-        return (double)(a * b);
+        return (double)(scalar_mul(a, b));
     }
 
     @Test(dataProvider = "doubleBinaryOpProvider")
@@ -1911,7 +2110,7 @@ relativeError));
     }
 
     static double DIV(double a, double b) {
-        return (double)(a / b);
+        return (double)(scalar_div(a, b));
     }
 
     @Test(dataProvider = "doubleBinaryOpProvider")
@@ -1932,7 +2131,7 @@ relativeError));
     }
 
     static double div(double a, double b) {
-        return (double)(a / b);
+        return (double)(scalar_div(a, b));
     }
 
     @Test(dataProvider = "doubleBinaryOpProvider")
@@ -1989,7 +2188,7 @@ relativeError));
     }
 
     static double FIRST_NONZERO(double a, double b) {
-        return (double)(Double.doubleToLongBits(a)!=0?a:b);
+        return (double)(firstNonZero(a, b));
     }
 
     @Test(dataProvider = "doubleBinaryOpProvider")
@@ -2291,7 +2490,7 @@ relativeError));
     }
 
     static double MIN(double a, double b) {
-        return (double)(Math.min(a, b));
+        return (double)(scalar_min(a, b));
     }
 
     @Test(dataProvider = "doubleBinaryOpProvider")
@@ -2312,7 +2511,7 @@ relativeError));
     }
 
     static double min(double a, double b) {
-        return (double)(Math.min(a, b));
+        return (double)(scalar_min(a, b));
     }
 
     @Test(dataProvider = "doubleBinaryOpProvider")
@@ -2331,7 +2530,7 @@ relativeError));
     }
 
     static double MAX(double a, double b) {
-        return (double)(Math.max(a, b));
+        return (double)(scalar_max(a, b));
     }
 
     @Test(dataProvider = "doubleBinaryOpProvider")
@@ -2352,7 +2551,7 @@ relativeError));
     }
 
     static double max(double a, double b) {
-        return (double)(Math.max(a, b));
+        return (double)(scalar_max(a, b));
     }
 
     @Test(dataProvider = "doubleBinaryOpProvider")
@@ -2429,7 +2628,7 @@ relativeError));
     static double ADDReduce(double[] a, int idx) {
         double res = ADD_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res += a[i];
+            res = scalar_add(res, a[i]);
         }
 
         return res;
@@ -2438,7 +2637,7 @@ relativeError));
     static double ADDReduceAll(double[] a) {
         double res = ADD_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduce(a, i);
+            res = scalar_add(res, ADDReduce(a, i));
         }
 
         return res;
@@ -2456,7 +2655,7 @@ relativeError));
                 DoubleVector av = DoubleVector.fromArray(SPECIES, a, i);
                 double v = av.reduceLanes(VectorOperators.ADD);
                 r[i] = v;
-                ra += v;
+                ra = scalar_add(ra, v);
             }
         }
 
@@ -2469,20 +2668,20 @@ relativeError));
         double[] a = fa.apply(SPECIES.length());
         double id = ADD_IDENTITY;
 
-        assertEquals((double) (id + id), id,
+        assertEquals((double) (scalar_add(id, id)), id,
                             "ADD(ADD_IDENTITY, ADD_IDENTITY) != ADD_IDENTITY");
 
         double x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((double) (id + x), x);
-                assertEquals((double) (x + id), x);
+                assertEquals((double) (scalar_add(id, x)), x);
+                assertEquals((double) (scalar_add(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((double) (id + x), x,
+            assertEquals((double) (scalar_add(id, x)), x,
                                 "ADD(ADD_IDENTITY, " + x + ") != " + x);
-            assertEquals((double) (x + id), x,
+            assertEquals((double) (scalar_add(x, id)), x,
                                 "ADD(" + x + ", ADD_IDENTITY) != " + x);
         }
     }
@@ -2491,7 +2690,7 @@ relativeError));
         double res = ADD_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res += a[i];
+                res = scalar_add(res, a[i]);
         }
 
         return res;
@@ -2500,7 +2699,7 @@ relativeError));
     static double ADDReduceAllMasked(double[] a, boolean[] mask) {
         double res = ADD_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduceMasked(a, i, mask);
+            res = scalar_add(res, ADDReduceMasked(a, i, mask));
         }
 
         return res;
@@ -2520,7 +2719,7 @@ relativeError));
                 DoubleVector av = DoubleVector.fromArray(SPECIES, a, i);
                 double v = av.reduceLanes(VectorOperators.ADD, vmask);
                 r[i] = v;
-                ra += v;
+                ra = scalar_add(ra, v);
             }
         }
 
@@ -2531,7 +2730,7 @@ relativeError));
     static double MULReduce(double[] a, int idx) {
         double res = MUL_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res *= a[i];
+            res = scalar_mul(res, a[i]);
         }
 
         return res;
@@ -2540,7 +2739,7 @@ relativeError));
     static double MULReduceAll(double[] a) {
         double res = MUL_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res *= MULReduce(a, i);
+            res = scalar_mul(res, MULReduce(a, i));
         }
 
         return res;
@@ -2558,7 +2757,7 @@ relativeError));
                 DoubleVector av = DoubleVector.fromArray(SPECIES, a, i);
                 double v = av.reduceLanes(VectorOperators.MUL);
                 r[i] = v;
-                ra *= v;
+                ra = scalar_mul(ra, v);
             }
         }
 
@@ -2571,20 +2770,20 @@ relativeError));
         double[] a = fa.apply(SPECIES.length());
         double id = MUL_IDENTITY;
 
-        assertEquals((double) (id * id), id,
+        assertEquals((double) (scalar_mul(id, id)), id,
                             "MUL(MUL_IDENTITY, MUL_IDENTITY) != MUL_IDENTITY");
 
         double x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((double) (id * x), x);
-                assertEquals((double) (x * id), x);
+                assertEquals((double) (scalar_mul(id, x)), x);
+                assertEquals((double) (scalar_mul(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((double) (id * x), x,
+            assertEquals((double) (scalar_mul(id, x)), x,
                                 "MUL(MUL_IDENTITY, " + x + ") != " + x);
-            assertEquals((double) (x * id), x,
+            assertEquals((double) (scalar_mul(x, id)), x,
                                 "MUL(" + x + ", MUL_IDENTITY) != " + x);
         }
     }
@@ -2593,7 +2792,7 @@ relativeError));
         double res = MUL_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res *= a[i];
+                res = scalar_mul(res, a[i]);
         }
 
         return res;
@@ -2602,7 +2801,7 @@ relativeError));
     static double MULReduceAllMasked(double[] a, boolean[] mask) {
         double res = MUL_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res *= MULReduceMasked(a, i, mask);
+            res = scalar_mul(res, MULReduceMasked(a, i, mask));
         }
 
         return res;
@@ -2622,7 +2821,7 @@ relativeError));
                 DoubleVector av = DoubleVector.fromArray(SPECIES, a, i);
                 double v = av.reduceLanes(VectorOperators.MUL, vmask);
                 r[i] = v;
-                ra *= v;
+                ra = scalar_mul(ra, v);
             }
         }
 
@@ -2633,7 +2832,7 @@ relativeError));
     static double MINReduce(double[] a, int idx) {
         double res = MIN_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res = (double) Math.min(res, a[i]);
+            res = scalar_min(res, a[i]);
         }
 
         return res;
@@ -2642,7 +2841,7 @@ relativeError));
     static double MINReduceAll(double[] a) {
         double res = MIN_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (double) Math.min(res, MINReduce(a, i));
+            res = scalar_min(res, MINReduce(a, i));
         }
 
         return res;
@@ -2660,7 +2859,7 @@ relativeError));
                 DoubleVector av = DoubleVector.fromArray(SPECIES, a, i);
                 double v = av.reduceLanes(VectorOperators.MIN);
                 r[i] = v;
-                ra = (double) Math.min(ra, v);
+                ra = scalar_min(ra, v);
             }
         }
 
@@ -2673,20 +2872,20 @@ relativeError));
         double[] a = fa.apply(SPECIES.length());
         double id = MIN_IDENTITY;
 
-        assertEquals((double) Math.min(id, id), id,
+        assertEquals(scalar_min(id, id), id,
                             "MIN(MIN_IDENTITY, MIN_IDENTITY) != MIN_IDENTITY");
 
         double x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((double) Math.min(id, x), x);
-                assertEquals((double) Math.min(x, id), x);
+                assertEquals(scalar_min(id, x), x);
+                assertEquals(scalar_min(x, id), x);
             }
         } catch (AssertionError e) {
-            assertEquals((double) Math.min(id, x), x,
+            assertEquals(scalar_min(id, x), x,
                                 "MIN(MIN_IDENTITY, " + x + ") != " + x);
-            assertEquals((double) Math.min(x, id), x,
+            assertEquals(scalar_min(x, id), x,
                                 "MIN(" + x + ", MIN_IDENTITY) != " + x);
         }
     }
@@ -2695,7 +2894,7 @@ relativeError));
         double res = MIN_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res = (double) Math.min(res, a[i]);
+                res = scalar_min(res, a[i]);
         }
 
         return res;
@@ -2704,7 +2903,7 @@ relativeError));
     static double MINReduceAllMasked(double[] a, boolean[] mask) {
         double res = MIN_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (double) Math.min(res, MINReduceMasked(a, i, mask));
+            res = scalar_min(res, MINReduceMasked(a, i, mask));
         }
 
         return res;
@@ -2724,7 +2923,7 @@ relativeError));
                 DoubleVector av = DoubleVector.fromArray(SPECIES, a, i);
                 double v = av.reduceLanes(VectorOperators.MIN, vmask);
                 r[i] = v;
-                ra = (double) Math.min(ra, v);
+                ra = scalar_min(ra, v);
             }
         }
 
@@ -2735,7 +2934,7 @@ relativeError));
     static double MAXReduce(double[] a, int idx) {
         double res = MAX_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res = (double) Math.max(res, a[i]);
+            res = scalar_max(res, a[i]);
         }
 
         return res;
@@ -2744,7 +2943,7 @@ relativeError));
     static double MAXReduceAll(double[] a) {
         double res = MAX_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (double) Math.max(res, MAXReduce(a, i));
+            res = scalar_max(res, MAXReduce(a, i));
         }
 
         return res;
@@ -2762,7 +2961,7 @@ relativeError));
                 DoubleVector av = DoubleVector.fromArray(SPECIES, a, i);
                 double v = av.reduceLanes(VectorOperators.MAX);
                 r[i] = v;
-                ra = (double) Math.max(ra, v);
+                ra = scalar_max(ra, v);
             }
         }
 
@@ -2775,20 +2974,20 @@ relativeError));
         double[] a = fa.apply(SPECIES.length());
         double id = MAX_IDENTITY;
 
-        assertEquals((double) Math.max(id, id), id,
+        assertEquals(scalar_max(id, id), id,
                             "MAX(MAX_IDENTITY, MAX_IDENTITY) != MAX_IDENTITY");
 
         double x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((double) Math.max(id, x), x);
-                assertEquals((double) Math.max(x, id), x);
+                assertEquals(scalar_max(id, x), x);
+                assertEquals(scalar_max(x, id), x);
             }
         } catch (AssertionError e) {
-            assertEquals((double) Math.max(id, x), x,
+            assertEquals(scalar_max(id, x), x,
                                 "MAX(MAX_IDENTITY, " + x + ") != " + x);
-            assertEquals((double) Math.max(x, id), x,
+            assertEquals(scalar_max(x, id), x,
                                 "MAX(" + x + ", MAX_IDENTITY) != " + x);
         }
     }
@@ -2797,7 +2996,7 @@ relativeError));
         double res = MAX_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res = (double) Math.max(res, a[i]);
+                res = scalar_max(res, a[i]);
         }
 
         return res;
@@ -2806,7 +3005,7 @@ relativeError));
     static double MAXReduceAllMasked(double[] a, boolean[] mask) {
         double res = MAX_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (double) Math.max(res, MAXReduceMasked(a, i, mask));
+            res = scalar_max(res, MAXReduceMasked(a, i, mask));
         }
 
         return res;
@@ -2826,7 +3025,7 @@ relativeError));
                 DoubleVector av = DoubleVector.fromArray(SPECIES, a, i);
                 double v = av.reduceLanes(VectorOperators.MAX, vmask);
                 r[i] = v;
-                ra = (double) Math.max(ra, v);
+                ra = scalar_max(ra, v);
             }
         }
 
@@ -3038,7 +3237,7 @@ relativeError));
     }
 
     static boolean testIS_FINITE(double a) {
-        return Double.isFinite(a);
+        return isFinite(a);
     }
 
     @Test(dataProvider = "doubleTestOpProvider")
@@ -3079,7 +3278,7 @@ relativeError));
     }
 
     static boolean testIS_NAN(double a) {
-        return Double.isNaN(a);
+        return isNaN(a);
     }
 
     @Test(dataProvider = "doubleTestOpProvider")
@@ -3120,7 +3319,7 @@ relativeError));
     }
 
     static boolean testIS_INFINITE(double a) {
-        return Double.isInfinite(a);
+        return isInfinite(a);
     }
 
     @Test(dataProvider = "doubleTestOpProvider")
@@ -3461,7 +3660,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] < b[i]);
+                assertEquals(mv.laneIsSet(j), lt(a[i + j], b[i]));
             }
         }
     }
@@ -3481,7 +3680,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] < b[i]));
+                assertEquals(mv.laneIsSet(j), mask[j] && (lt(a[i + j], b[i])));
             }
         }
     }
@@ -3497,7 +3696,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] < (double)((long)b[i]));
+                assertEquals(mv.laneIsSet(j), lt(a[i + j], (double)((long)b[i])));
             }
         }
     }
@@ -3517,7 +3716,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] < (double)((long)b[i])));
+                assertEquals(mv.laneIsSet(j), mask[j] && (lt(a[i + j], (double)((long)b[i]))));
             }
         }
     }
@@ -3533,7 +3732,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] == b[i]);
+                assertEquals(mv.laneIsSet(j), eq(a[i + j], b[i]));
             }
         }
     }
@@ -3553,7 +3752,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] == b[i]));
+                assertEquals(mv.laneIsSet(j), mask[j] && (eq(a[i + j], b[i])));
             }
         }
     }
@@ -3569,7 +3768,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] == (double)((long)b[i]));
+                assertEquals(mv.laneIsSet(j), eq(a[i + j], (double)((long)b[i])));
             }
         }
     }
@@ -3589,7 +3788,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] == (double)((long)b[i])));
+                assertEquals(mv.laneIsSet(j), mask[j] && (eq(a[i + j], (double)((long)b[i]))));
             }
         }
     }
@@ -4089,11 +4288,11 @@ relativeError));
     }
 
     static double SIN(double a) {
-        return (double)(Math.sin((double)a));
+        return (double)(scalar_sin(a));
     }
 
     static double strictSIN(double a) {
-        return (double)(StrictMath.sin((double)a));
+        return (double)(strict_scalar_sin(a));
     }
 
     @Test(dataProvider = "doubleUnaryOpProvider")
@@ -4112,11 +4311,11 @@ relativeError));
     }
 
     static double EXP(double a) {
-        return (double)(Math.exp((double)a));
+        return (double)(scalar_exp(a));
     }
 
     static double strictEXP(double a) {
-        return (double)(StrictMath.exp((double)a));
+        return (double)(strict_scalar_exp(a));
     }
 
     @Test(dataProvider = "doubleUnaryOpProvider")
@@ -4135,11 +4334,11 @@ relativeError));
     }
 
     static double LOG1P(double a) {
-        return (double)(Math.log1p((double)a));
+        return (double)(scalar_log1p(a));
     }
 
     static double strictLOG1P(double a) {
-        return (double)(StrictMath.log1p((double)a));
+        return (double)(strict_scalar_log1p(a));
     }
 
     @Test(dataProvider = "doubleUnaryOpProvider")
@@ -4158,11 +4357,11 @@ relativeError));
     }
 
     static double LOG(double a) {
-        return (double)(Math.log((double)a));
+        return (double)(scalar_log(a));
     }
 
     static double strictLOG(double a) {
-        return (double)(StrictMath.log((double)a));
+        return (double)(strict_scalar_log(a));
     }
 
     @Test(dataProvider = "doubleUnaryOpProvider")
@@ -4181,11 +4380,11 @@ relativeError));
     }
 
     static double LOG10(double a) {
-        return (double)(Math.log10((double)a));
+        return (double)(scalar_log10(a));
     }
 
     static double strictLOG10(double a) {
-        return (double)(StrictMath.log10((double)a));
+        return (double)(strict_scalar_log10(a));
     }
 
     @Test(dataProvider = "doubleUnaryOpProvider")
@@ -4204,11 +4403,11 @@ relativeError));
     }
 
     static double EXPM1(double a) {
-        return (double)(Math.expm1((double)a));
+        return (double)(scalar_expm1(a));
     }
 
     static double strictEXPM1(double a) {
-        return (double)(StrictMath.expm1((double)a));
+        return (double)(strict_scalar_expm1(a));
     }
 
     @Test(dataProvider = "doubleUnaryOpProvider")
@@ -4227,11 +4426,11 @@ relativeError));
     }
 
     static double COS(double a) {
-        return (double)(Math.cos((double)a));
+        return (double)(scalar_cos(a));
     }
 
     static double strictCOS(double a) {
-        return (double)(StrictMath.cos((double)a));
+        return (double)(strict_scalar_cos(a));
     }
 
     @Test(dataProvider = "doubleUnaryOpProvider")
@@ -4250,11 +4449,11 @@ relativeError));
     }
 
     static double TAN(double a) {
-        return (double)(Math.tan((double)a));
+        return (double)(scalar_tan(a));
     }
 
     static double strictTAN(double a) {
-        return (double)(StrictMath.tan((double)a));
+        return (double)(strict_scalar_tan(a));
     }
 
     @Test(dataProvider = "doubleUnaryOpProvider")
@@ -4273,11 +4472,11 @@ relativeError));
     }
 
     static double SINH(double a) {
-        return (double)(Math.sinh((double)a));
+        return (double)(scalar_sinh(a));
     }
 
     static double strictSINH(double a) {
-        return (double)(StrictMath.sinh((double)a));
+        return (double)(strict_scalar_sinh(a));
     }
 
     @Test(dataProvider = "doubleUnaryOpProvider")
@@ -4296,11 +4495,11 @@ relativeError));
     }
 
     static double COSH(double a) {
-        return (double)(Math.cosh((double)a));
+        return (double)(scalar_cosh(a));
     }
 
     static double strictCOSH(double a) {
-        return (double)(StrictMath.cosh((double)a));
+        return (double)(strict_scalar_cosh(a));
     }
 
     @Test(dataProvider = "doubleUnaryOpProvider")
@@ -4319,11 +4518,11 @@ relativeError));
     }
 
     static double TANH(double a) {
-        return (double)(Math.tanh((double)a));
+        return (double)(scalar_tanh(a));
     }
 
     static double strictTANH(double a) {
-        return (double)(StrictMath.tanh((double)a));
+        return (double)(strict_scalar_tanh(a));
     }
 
     @Test(dataProvider = "doubleUnaryOpProvider")
@@ -4342,11 +4541,11 @@ relativeError));
     }
 
     static double ASIN(double a) {
-        return (double)(Math.asin((double)a));
+        return (double)(scalar_asin(a));
     }
 
     static double strictASIN(double a) {
-        return (double)(StrictMath.asin((double)a));
+        return (double)(strict_scalar_asin(a));
     }
 
     @Test(dataProvider = "doubleUnaryOpProvider")
@@ -4365,11 +4564,11 @@ relativeError));
     }
 
     static double ACOS(double a) {
-        return (double)(Math.acos((double)a));
+        return (double)(scalar_acos(a));
     }
 
     static double strictACOS(double a) {
-        return (double)(StrictMath.acos((double)a));
+        return (double)(strict_scalar_acos(a));
     }
 
     @Test(dataProvider = "doubleUnaryOpProvider")
@@ -4388,11 +4587,11 @@ relativeError));
     }
 
     static double ATAN(double a) {
-        return (double)(Math.atan((double)a));
+        return (double)(scalar_atan(a));
     }
 
     static double strictATAN(double a) {
-        return (double)(StrictMath.atan((double)a));
+        return (double)(strict_scalar_atan(a));
     }
 
     @Test(dataProvider = "doubleUnaryOpProvider")
@@ -4411,11 +4610,11 @@ relativeError));
     }
 
     static double CBRT(double a) {
-        return (double)(Math.cbrt((double)a));
+        return (double)(scalar_cbrt(a));
     }
 
     static double strictCBRT(double a) {
-        return (double)(StrictMath.cbrt((double)a));
+        return (double)(strict_scalar_cbrt(a));
     }
 
     @Test(dataProvider = "doubleUnaryOpProvider")
@@ -4434,11 +4633,11 @@ relativeError));
     }
 
     static double HYPOT(double a, double b) {
-        return (double)(Math.hypot((double)a, (double)b));
+        return (double)(scalar_hypot(a, b));
     }
 
     static double strictHYPOT(double a, double b) {
-        return (double)(StrictMath.hypot((double)a, (double)b));
+        return (double)(strict_scalar_hypot(a, b));
     }
 
     @Test(dataProvider = "doubleBinaryOpProvider")
@@ -4460,11 +4659,11 @@ relativeError));
 
 
     static double POW(double a, double b) {
-        return (double)(Math.pow((double)a, (double)b));
+        return (double)(scalar_pow(a, b));
     }
 
     static double strictPOW(double a, double b) {
-        return (double)(StrictMath.pow((double)a, (double)b));
+        return (double)(strict_scalar_pow(a, b));
     }
 
     @Test(dataProvider = "doubleBinaryOpProvider")
@@ -4486,11 +4685,11 @@ relativeError));
 
 
     static double pow(double a, double b) {
-        return (double)(Math.pow((double)a, (double)b));
+        return (double)(scalar_pow(a, b));
     }
 
     static double strictpow(double a, double b) {
-        return (double)(StrictMath.pow((double)a, (double)b));
+        return (double)(strict_scalar_pow(a, b));
     }
 
     @Test(dataProvider = "doubleBinaryOpProvider")
@@ -4512,11 +4711,11 @@ relativeError));
 
 
     static double ATAN2(double a, double b) {
-        return (double)(Math.atan2((double)a, (double)b));
+        return (double)(scalar_atan2(a, b));
     }
 
     static double strictATAN2(double a, double b) {
-        return (double)(StrictMath.atan2((double)a, (double)b));
+        return (double)(strict_scalar_atan2(a, b));
     }
 
     @Test(dataProvider = "doubleBinaryOpProvider")
@@ -4568,11 +4767,11 @@ relativeError));
 
 
     static double FMA(double a, double b, double c) {
-        return (double)(Math.fma(a, b, c));
+        return (double)(scalar_fma(a, b, c));
     }
 
     static double fma(double a, double b, double c) {
-        return (double)(Math.fma(a, b, c));
+        return (double)(scalar_fma(a, b, c));
     }
 
     @Test(dataProvider = "doubleTernaryOpProvider")
@@ -4792,11 +4991,11 @@ relativeError));
     }
 
     static double NEG(double a) {
-        return (double)(-((double)a));
+        return (double)(scalar_neg((double)a));
     }
 
     static double neg(double a) {
-        return (double)(-((double)a));
+        return (double)(scalar_neg((double)a));
     }
 
     @Test(dataProvider = "doubleUnaryOpProvider")
@@ -4848,11 +5047,11 @@ relativeError));
     }
 
     static double ABS(double a) {
-        return (double)(Math.abs((double)a));
+        return (double)(scalar_abs((double)a));
     }
 
     static double abs(double a) {
-        return (double)(Math.abs((double)a));
+        return (double)(scalar_abs((double)a));
     }
 
     @Test(dataProvider = "doubleUnaryOpProvider")
@@ -4904,11 +5103,11 @@ relativeError));
     }
 
     static double SQRT(double a) {
-        return (double)(Math.sqrt((double)a));
+        return (double)(scalar_sqrt(a));
     }
 
     static double sqrt(double a) {
-        return (double)(Math.sqrt((double)a));
+        return (double)(scalar_sqrt(a));
     }
 
     @Test(dataProvider = "doubleUnaryOpProvider")
@@ -5121,7 +5320,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] < b[i]);
+                assertEquals(mv.laneIsSet(j), lt(a[i + j], b[i]));
             }
         }
     }
@@ -5137,7 +5336,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] == b[i]);
+                assertEquals(mv.laneIsSet(j), eq(a[i + j], b[i]));
             }
         }
     }
@@ -5196,7 +5395,7 @@ relativeError));
     static long ADDReduceLong(double[] a, int idx) {
         double res = 0;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res += a[i];
+            res = scalar_add(res, a[i]);
         }
 
         return (long)res;
@@ -5205,7 +5404,7 @@ relativeError));
     static long ADDReduceAllLong(double[] a) {
         long res = 0;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduceLong(a, i);
+            res = (long)scalar_add((double)res, (double)ADDReduceLong(a, i));
         }
 
         return res;
@@ -5223,8 +5422,8 @@ relativeError));
         }
 
         ra = 0;
-        for (int i = 0; i < a.length; i ++) {
-            ra += r[i];
+        for (int i = 0; i < a.length; i++) {
+            ra = (long)scalar_add((double)ra, (double)r[i]);
         }
 
         assertReductionLongArraysEquals(r, ra, a,
@@ -5234,8 +5433,9 @@ relativeError));
     static long ADDReduceLongMasked(double[] a, int idx, boolean[] mask) {
         double res = 0;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            if(mask[i % SPECIES.length()])
-                res += a[i];
+            if (mask[i % SPECIES.length()]) {
+                res = scalar_add(res, a[i]);
+            }
         }
 
         return (long)res;
@@ -5244,7 +5444,7 @@ relativeError));
     static long ADDReduceAllLongMasked(double[] a, boolean[] mask) {
         long res = 0;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduceLongMasked(a, i, mask);
+            res = (long)scalar_add((double)res, (double)ADDReduceLongMasked(a, i, mask));
         }
 
         return res;
@@ -5264,8 +5464,8 @@ relativeError));
         }
 
         ra = 0;
-        for (int i = 0; i < a.length; i ++) {
-            ra += r[i];
+        for (int i = 0; i < a.length; i++) {
+            ra = (long)scalar_add((double)ra, (double)r[i]);
         }
 
         assertReductionLongArraysEqualsMasked(r, ra, a, mask,
diff --git a/test/jdk/jdk/incubator/vector/DoubleVector64Tests.java b/test/jdk/jdk/incubator/vector/DoubleVector64Tests.java
index 7f9f8986f1f..d2aff0b7ea5 100644
--- a/test/jdk/jdk/incubator/vector/DoubleVector64Tests.java
+++ b/test/jdk/jdk/incubator/vector/DoubleVector64Tests.java
@@ -1584,6 +1584,205 @@ relativeError));
         return Double.compare(a, (double) 0) != 0 ? a : b;
     }
 
+
+    static double scalar_add(double a, double b) {
+        return (double)(a + b);
+    }
+
+    static double scalar_sub(double a, double b) {
+        return (double)(a - b);
+    }
+
+    static double scalar_mul(double a, double b) {
+        return (double)(a * b);
+    }
+
+    static double scalar_min(double a, double b) {
+        return (double)(Math.min(a, b));
+    }
+
+    static double scalar_max(double a, double b) {
+        return (double)(Math.max(a, b));
+    }
+
+    static double scalar_div(double a, double b) {
+        return (double)(a / b);
+    }
+
+    static double scalar_fma(double a, double b, double c) {
+        return (double)(Math.fma(a, b, c));
+    }
+
+    static double scalar_abs(double a) {
+        return (double)(Math.abs(a));
+    }
+
+    static double scalar_neg(double a) {
+        return ((double)-a);
+    }
+
+    static double scalar_sin(double a) {
+        return (double)Math.sin((double)a);
+    }
+
+    static double scalar_exp(double a) {
+        return (double)Math.exp((double)a);
+    }
+
+    static double scalar_log1p(double a) {
+        return (double)Math.log1p((double)a);
+    }
+
+    static double scalar_log(double a) {
+        return (double)Math.log((double)a);
+    }
+
+    static double scalar_log10(double a) {
+        return (double)Math.log10((double)a);
+    }
+
+    static double scalar_expm1(double a) {
+        return (double)Math.expm1((double)a);
+    }
+
+    static double scalar_cos(double a) {
+        return (double)Math.cos((double)a);
+    }
+
+    static double scalar_tan(double a) {
+        return (double)Math.tan((double)a);
+    }
+
+    static double scalar_sinh(double a) {
+        return (double)Math.sinh((double)a);
+    }
+
+    static double scalar_cosh(double a) {
+        return (double)Math.cosh((double)a);
+    }
+
+    static double scalar_tanh(double a) {
+        return (double)Math.tanh((double)a);
+    }
+
+    static double scalar_asin(double a) {
+        return (double)Math.asin((double)a);
+    }
+
+    static double scalar_acos(double a) {
+        return (double)Math.acos((double)a);
+    }
+
+    static double scalar_atan(double a) {
+        return (double)Math.atan((double)a);
+    }
+
+    static double scalar_cbrt(double a) {
+        return (double)Math.cbrt((double)a);
+    }
+
+    static double scalar_sqrt(double a) {
+        return (double)Math.sqrt((double)a);
+    }
+
+    static double scalar_hypot(double a, double b) {
+        return (double)Math.hypot((double)a, (double)b);
+    }
+
+    static double scalar_pow(double a, double b) {
+        return (double)Math.pow((double)a, (double)b);
+    }
+
+    static double scalar_atan2(double a, double b) {
+        return (double)Math.atan2((double)a, (double)b);
+    }
+
+    static double strict_scalar_sin(double a) {
+        return (double)StrictMath.sin((double)a);
+    }
+
+    static double strict_scalar_exp(double a) {
+        return (double)StrictMath.exp((double)a);
+    }
+
+    static double strict_scalar_log1p(double a) {
+        return (double)StrictMath.log1p((double)a);
+    }
+
+    static double strict_scalar_log(double a) {
+        return (double)StrictMath.log((double)a);
+    }
+
+    static double strict_scalar_log10(double a) {
+        return (double)StrictMath.log10((double)a);
+    }
+
+    static double strict_scalar_expm1(double a) {
+        return (double)StrictMath.expm1((double)a);
+    }
+
+    static double strict_scalar_cos(double a) {
+        return (double)StrictMath.cos((double)a);
+    }
+
+    static double strict_scalar_tan(double a) {
+        return (double)StrictMath.tan((double)a);
+    }
+
+    static double strict_scalar_sinh(double a) {
+        return (double)StrictMath.sinh((double)a);
+    }
+
+    static double strict_scalar_cosh(double a) {
+        return (double)StrictMath.cosh((double)a);
+    }
+
+    static double strict_scalar_tanh(double a) {
+        return (double)StrictMath.tanh((double)a);
+    }
+
+    static double strict_scalar_asin(double a) {
+        return (double)StrictMath.asin((double)a);
+    }
+
+    static double strict_scalar_acos(double a) {
+        return (double)StrictMath.acos((double)a);
+    }
+
+    static double strict_scalar_atan(double a) {
+        return (double)StrictMath.atan((double)a);
+    }
+
+    static double strict_scalar_cbrt(double a) {
+        return (double)StrictMath.cbrt((double)a);
+    }
+
+    static double strict_scalar_sqrt(double a) {
+        return (double)StrictMath.sqrt((double)a);
+    }
+
+    static double strict_scalar_hypot(double a, double b) {
+        return (double)StrictMath.hypot((double)a, (double)b);
+    }
+
+    static double strict_scalar_pow(double a, double b) {
+        return (double)StrictMath.pow((double)a, (double)b);
+    }
+
+    static double strict_scalar_atan2(double a, double b) {
+        return (double)StrictMath.atan2((double)a, (double)b);
+    }
+
+    static boolean isNaN(double a) {
+        return Double.isNaN(a);
+    }
+    static boolean isFinite(double a) {
+        return Double.isFinite(a);
+    }
+    static boolean isInfinite(double a) {
+        return Double.isInfinite(a);
+    }
+
     @Test
     static void smokeTest1() {
         DoubleVector three = DoubleVector.broadcast(SPECIES, (byte)-3);
@@ -1677,7 +1876,7 @@ relativeError));
     }
 
     static double ADD(double a, double b) {
-        return (double)(a + b);
+        return (double)(scalar_add(a, b));
     }
 
     @Test(dataProvider = "doubleBinaryOpProvider")
@@ -1698,7 +1897,7 @@ relativeError));
     }
 
     static double add(double a, double b) {
-        return (double)(a + b);
+        return (double)(scalar_add(a, b));
     }
 
     @Test(dataProvider = "doubleBinaryOpProvider")
@@ -1755,7 +1954,7 @@ relativeError));
     }
 
     static double SUB(double a, double b) {
-        return (double)(a - b);
+        return (double)(scalar_sub(a, b));
     }
 
     @Test(dataProvider = "doubleBinaryOpProvider")
@@ -1776,7 +1975,7 @@ relativeError));
     }
 
     static double sub(double a, double b) {
-        return (double)(a - b);
+        return (double)(scalar_sub(a, b));
     }
 
     @Test(dataProvider = "doubleBinaryOpProvider")
@@ -1833,7 +2032,7 @@ relativeError));
     }
 
     static double MUL(double a, double b) {
-        return (double)(a * b);
+        return (double)(scalar_mul(a, b));
     }
 
     @Test(dataProvider = "doubleBinaryOpProvider")
@@ -1854,7 +2053,7 @@ relativeError));
     }
 
     static double mul(double a, double b) {
-        return (double)(a * b);
+        return (double)(scalar_mul(a, b));
     }
 
     @Test(dataProvider = "doubleBinaryOpProvider")
@@ -1911,7 +2110,7 @@ relativeError));
     }
 
     static double DIV(double a, double b) {
-        return (double)(a / b);
+        return (double)(scalar_div(a, b));
     }
 
     @Test(dataProvider = "doubleBinaryOpProvider")
@@ -1932,7 +2131,7 @@ relativeError));
     }
 
     static double div(double a, double b) {
-        return (double)(a / b);
+        return (double)(scalar_div(a, b));
     }
 
     @Test(dataProvider = "doubleBinaryOpProvider")
@@ -1989,7 +2188,7 @@ relativeError));
     }
 
     static double FIRST_NONZERO(double a, double b) {
-        return (double)(Double.doubleToLongBits(a)!=0?a:b);
+        return (double)(firstNonZero(a, b));
     }
 
     @Test(dataProvider = "doubleBinaryOpProvider")
@@ -2291,7 +2490,7 @@ relativeError));
     }
 
     static double MIN(double a, double b) {
-        return (double)(Math.min(a, b));
+        return (double)(scalar_min(a, b));
     }
 
     @Test(dataProvider = "doubleBinaryOpProvider")
@@ -2312,7 +2511,7 @@ relativeError));
     }
 
     static double min(double a, double b) {
-        return (double)(Math.min(a, b));
+        return (double)(scalar_min(a, b));
     }
 
     @Test(dataProvider = "doubleBinaryOpProvider")
@@ -2331,7 +2530,7 @@ relativeError));
     }
 
     static double MAX(double a, double b) {
-        return (double)(Math.max(a, b));
+        return (double)(scalar_max(a, b));
     }
 
     @Test(dataProvider = "doubleBinaryOpProvider")
@@ -2352,7 +2551,7 @@ relativeError));
     }
 
     static double max(double a, double b) {
-        return (double)(Math.max(a, b));
+        return (double)(scalar_max(a, b));
     }
 
     @Test(dataProvider = "doubleBinaryOpProvider")
@@ -2429,7 +2628,7 @@ relativeError));
     static double ADDReduce(double[] a, int idx) {
         double res = ADD_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res += a[i];
+            res = scalar_add(res, a[i]);
         }
 
         return res;
@@ -2438,7 +2637,7 @@ relativeError));
     static double ADDReduceAll(double[] a) {
         double res = ADD_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduce(a, i);
+            res = scalar_add(res, ADDReduce(a, i));
         }
 
         return res;
@@ -2456,7 +2655,7 @@ relativeError));
                 DoubleVector av = DoubleVector.fromArray(SPECIES, a, i);
                 double v = av.reduceLanes(VectorOperators.ADD);
                 r[i] = v;
-                ra += v;
+                ra = scalar_add(ra, v);
             }
         }
 
@@ -2469,20 +2668,20 @@ relativeError));
         double[] a = fa.apply(SPECIES.length());
         double id = ADD_IDENTITY;
 
-        assertEquals((double) (id + id), id,
+        assertEquals((double) (scalar_add(id, id)), id,
                             "ADD(ADD_IDENTITY, ADD_IDENTITY) != ADD_IDENTITY");
 
         double x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((double) (id + x), x);
-                assertEquals((double) (x + id), x);
+                assertEquals((double) (scalar_add(id, x)), x);
+                assertEquals((double) (scalar_add(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((double) (id + x), x,
+            assertEquals((double) (scalar_add(id, x)), x,
                                 "ADD(ADD_IDENTITY, " + x + ") != " + x);
-            assertEquals((double) (x + id), x,
+            assertEquals((double) (scalar_add(x, id)), x,
                                 "ADD(" + x + ", ADD_IDENTITY) != " + x);
         }
     }
@@ -2491,7 +2690,7 @@ relativeError));
         double res = ADD_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res += a[i];
+                res = scalar_add(res, a[i]);
         }
 
         return res;
@@ -2500,7 +2699,7 @@ relativeError));
     static double ADDReduceAllMasked(double[] a, boolean[] mask) {
         double res = ADD_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduceMasked(a, i, mask);
+            res = scalar_add(res, ADDReduceMasked(a, i, mask));
         }
 
         return res;
@@ -2520,7 +2719,7 @@ relativeError));
                 DoubleVector av = DoubleVector.fromArray(SPECIES, a, i);
                 double v = av.reduceLanes(VectorOperators.ADD, vmask);
                 r[i] = v;
-                ra += v;
+                ra = scalar_add(ra, v);
             }
         }
 
@@ -2531,7 +2730,7 @@ relativeError));
     static double MULReduce(double[] a, int idx) {
         double res = MUL_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res *= a[i];
+            res = scalar_mul(res, a[i]);
         }
 
         return res;
@@ -2540,7 +2739,7 @@ relativeError));
     static double MULReduceAll(double[] a) {
         double res = MUL_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res *= MULReduce(a, i);
+            res = scalar_mul(res, MULReduce(a, i));
         }
 
         return res;
@@ -2558,7 +2757,7 @@ relativeError));
                 DoubleVector av = DoubleVector.fromArray(SPECIES, a, i);
                 double v = av.reduceLanes(VectorOperators.MUL);
                 r[i] = v;
-                ra *= v;
+                ra = scalar_mul(ra, v);
             }
         }
 
@@ -2571,20 +2770,20 @@ relativeError));
         double[] a = fa.apply(SPECIES.length());
         double id = MUL_IDENTITY;
 
-        assertEquals((double) (id * id), id,
+        assertEquals((double) (scalar_mul(id, id)), id,
                             "MUL(MUL_IDENTITY, MUL_IDENTITY) != MUL_IDENTITY");
 
         double x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((double) (id * x), x);
-                assertEquals((double) (x * id), x);
+                assertEquals((double) (scalar_mul(id, x)), x);
+                assertEquals((double) (scalar_mul(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((double) (id * x), x,
+            assertEquals((double) (scalar_mul(id, x)), x,
                                 "MUL(MUL_IDENTITY, " + x + ") != " + x);
-            assertEquals((double) (x * id), x,
+            assertEquals((double) (scalar_mul(x, id)), x,
                                 "MUL(" + x + ", MUL_IDENTITY) != " + x);
         }
     }
@@ -2593,7 +2792,7 @@ relativeError));
         double res = MUL_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res *= a[i];
+                res = scalar_mul(res, a[i]);
         }
 
         return res;
@@ -2602,7 +2801,7 @@ relativeError));
     static double MULReduceAllMasked(double[] a, boolean[] mask) {
         double res = MUL_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res *= MULReduceMasked(a, i, mask);
+            res = scalar_mul(res, MULReduceMasked(a, i, mask));
         }
 
         return res;
@@ -2622,7 +2821,7 @@ relativeError));
                 DoubleVector av = DoubleVector.fromArray(SPECIES, a, i);
                 double v = av.reduceLanes(VectorOperators.MUL, vmask);
                 r[i] = v;
-                ra *= v;
+                ra = scalar_mul(ra, v);
             }
         }
 
@@ -2633,7 +2832,7 @@ relativeError));
     static double MINReduce(double[] a, int idx) {
         double res = MIN_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res = (double) Math.min(res, a[i]);
+            res = scalar_min(res, a[i]);
         }
 
         return res;
@@ -2642,7 +2841,7 @@ relativeError));
     static double MINReduceAll(double[] a) {
         double res = MIN_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (double) Math.min(res, MINReduce(a, i));
+            res = scalar_min(res, MINReduce(a, i));
         }
 
         return res;
@@ -2660,7 +2859,7 @@ relativeError));
                 DoubleVector av = DoubleVector.fromArray(SPECIES, a, i);
                 double v = av.reduceLanes(VectorOperators.MIN);
                 r[i] = v;
-                ra = (double) Math.min(ra, v);
+                ra = scalar_min(ra, v);
             }
         }
 
@@ -2673,20 +2872,20 @@ relativeError));
         double[] a = fa.apply(SPECIES.length());
         double id = MIN_IDENTITY;
 
-        assertEquals((double) Math.min(id, id), id,
+        assertEquals(scalar_min(id, id), id,
                             "MIN(MIN_IDENTITY, MIN_IDENTITY) != MIN_IDENTITY");
 
         double x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((double) Math.min(id, x), x);
-                assertEquals((double) Math.min(x, id), x);
+                assertEquals(scalar_min(id, x), x);
+                assertEquals(scalar_min(x, id), x);
             }
         } catch (AssertionError e) {
-            assertEquals((double) Math.min(id, x), x,
+            assertEquals(scalar_min(id, x), x,
                                 "MIN(MIN_IDENTITY, " + x + ") != " + x);
-            assertEquals((double) Math.min(x, id), x,
+            assertEquals(scalar_min(x, id), x,
                                 "MIN(" + x + ", MIN_IDENTITY) != " + x);
         }
     }
@@ -2695,7 +2894,7 @@ relativeError));
         double res = MIN_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res = (double) Math.min(res, a[i]);
+                res = scalar_min(res, a[i]);
         }
 
         return res;
@@ -2704,7 +2903,7 @@ relativeError));
     static double MINReduceAllMasked(double[] a, boolean[] mask) {
         double res = MIN_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (double) Math.min(res, MINReduceMasked(a, i, mask));
+            res = scalar_min(res, MINReduceMasked(a, i, mask));
         }
 
         return res;
@@ -2724,7 +2923,7 @@ relativeError));
                 DoubleVector av = DoubleVector.fromArray(SPECIES, a, i);
                 double v = av.reduceLanes(VectorOperators.MIN, vmask);
                 r[i] = v;
-                ra = (double) Math.min(ra, v);
+                ra = scalar_min(ra, v);
             }
         }
 
@@ -2735,7 +2934,7 @@ relativeError));
     static double MAXReduce(double[] a, int idx) {
         double res = MAX_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res = (double) Math.max(res, a[i]);
+            res = scalar_max(res, a[i]);
         }
 
         return res;
@@ -2744,7 +2943,7 @@ relativeError));
     static double MAXReduceAll(double[] a) {
         double res = MAX_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (double) Math.max(res, MAXReduce(a, i));
+            res = scalar_max(res, MAXReduce(a, i));
         }
 
         return res;
@@ -2762,7 +2961,7 @@ relativeError));
                 DoubleVector av = DoubleVector.fromArray(SPECIES, a, i);
                 double v = av.reduceLanes(VectorOperators.MAX);
                 r[i] = v;
-                ra = (double) Math.max(ra, v);
+                ra = scalar_max(ra, v);
             }
         }
 
@@ -2775,20 +2974,20 @@ relativeError));
         double[] a = fa.apply(SPECIES.length());
         double id = MAX_IDENTITY;
 
-        assertEquals((double) Math.max(id, id), id,
+        assertEquals(scalar_max(id, id), id,
                             "MAX(MAX_IDENTITY, MAX_IDENTITY) != MAX_IDENTITY");
 
         double x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((double) Math.max(id, x), x);
-                assertEquals((double) Math.max(x, id), x);
+                assertEquals(scalar_max(id, x), x);
+                assertEquals(scalar_max(x, id), x);
             }
         } catch (AssertionError e) {
-            assertEquals((double) Math.max(id, x), x,
+            assertEquals(scalar_max(id, x), x,
                                 "MAX(MAX_IDENTITY, " + x + ") != " + x);
-            assertEquals((double) Math.max(x, id), x,
+            assertEquals(scalar_max(x, id), x,
                                 "MAX(" + x + ", MAX_IDENTITY) != " + x);
         }
     }
@@ -2797,7 +2996,7 @@ relativeError));
         double res = MAX_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res = (double) Math.max(res, a[i]);
+                res = scalar_max(res, a[i]);
         }
 
         return res;
@@ -2806,7 +3005,7 @@ relativeError));
     static double MAXReduceAllMasked(double[] a, boolean[] mask) {
         double res = MAX_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (double) Math.max(res, MAXReduceMasked(a, i, mask));
+            res = scalar_max(res, MAXReduceMasked(a, i, mask));
         }
 
         return res;
@@ -2826,7 +3025,7 @@ relativeError));
                 DoubleVector av = DoubleVector.fromArray(SPECIES, a, i);
                 double v = av.reduceLanes(VectorOperators.MAX, vmask);
                 r[i] = v;
-                ra = (double) Math.max(ra, v);
+                ra = scalar_max(ra, v);
             }
         }
 
@@ -3038,7 +3237,7 @@ relativeError));
     }
 
     static boolean testIS_FINITE(double a) {
-        return Double.isFinite(a);
+        return isFinite(a);
     }
 
     @Test(dataProvider = "doubleTestOpProvider")
@@ -3079,7 +3278,7 @@ relativeError));
     }
 
     static boolean testIS_NAN(double a) {
-        return Double.isNaN(a);
+        return isNaN(a);
     }
 
     @Test(dataProvider = "doubleTestOpProvider")
@@ -3120,7 +3319,7 @@ relativeError));
     }
 
     static boolean testIS_INFINITE(double a) {
-        return Double.isInfinite(a);
+        return isInfinite(a);
     }
 
     @Test(dataProvider = "doubleTestOpProvider")
@@ -3461,7 +3660,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] < b[i]);
+                assertEquals(mv.laneIsSet(j), lt(a[i + j], b[i]));
             }
         }
     }
@@ -3481,7 +3680,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] < b[i]));
+                assertEquals(mv.laneIsSet(j), mask[j] && (lt(a[i + j], b[i])));
             }
         }
     }
@@ -3497,7 +3696,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] < (double)((long)b[i]));
+                assertEquals(mv.laneIsSet(j), lt(a[i + j], (double)((long)b[i])));
             }
         }
     }
@@ -3517,7 +3716,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] < (double)((long)b[i])));
+                assertEquals(mv.laneIsSet(j), mask[j] && (lt(a[i + j], (double)((long)b[i]))));
             }
         }
     }
@@ -3533,7 +3732,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] == b[i]);
+                assertEquals(mv.laneIsSet(j), eq(a[i + j], b[i]));
             }
         }
     }
@@ -3553,7 +3752,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] == b[i]));
+                assertEquals(mv.laneIsSet(j), mask[j] && (eq(a[i + j], b[i])));
             }
         }
     }
@@ -3569,7 +3768,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] == (double)((long)b[i]));
+                assertEquals(mv.laneIsSet(j), eq(a[i + j], (double)((long)b[i])));
             }
         }
     }
@@ -3589,7 +3788,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] == (double)((long)b[i])));
+                assertEquals(mv.laneIsSet(j), mask[j] && (eq(a[i + j], (double)((long)b[i]))));
             }
         }
     }
@@ -4089,11 +4288,11 @@ relativeError));
     }
 
     static double SIN(double a) {
-        return (double)(Math.sin((double)a));
+        return (double)(scalar_sin(a));
     }
 
     static double strictSIN(double a) {
-        return (double)(StrictMath.sin((double)a));
+        return (double)(strict_scalar_sin(a));
     }
 
     @Test(dataProvider = "doubleUnaryOpProvider")
@@ -4112,11 +4311,11 @@ relativeError));
     }
 
     static double EXP(double a) {
-        return (double)(Math.exp((double)a));
+        return (double)(scalar_exp(a));
     }
 
     static double strictEXP(double a) {
-        return (double)(StrictMath.exp((double)a));
+        return (double)(strict_scalar_exp(a));
     }
 
     @Test(dataProvider = "doubleUnaryOpProvider")
@@ -4135,11 +4334,11 @@ relativeError));
     }
 
     static double LOG1P(double a) {
-        return (double)(Math.log1p((double)a));
+        return (double)(scalar_log1p(a));
     }
 
     static double strictLOG1P(double a) {
-        return (double)(StrictMath.log1p((double)a));
+        return (double)(strict_scalar_log1p(a));
     }
 
     @Test(dataProvider = "doubleUnaryOpProvider")
@@ -4158,11 +4357,11 @@ relativeError));
     }
 
     static double LOG(double a) {
-        return (double)(Math.log((double)a));
+        return (double)(scalar_log(a));
     }
 
     static double strictLOG(double a) {
-        return (double)(StrictMath.log((double)a));
+        return (double)(strict_scalar_log(a));
     }
 
     @Test(dataProvider = "doubleUnaryOpProvider")
@@ -4181,11 +4380,11 @@ relativeError));
     }
 
     static double LOG10(double a) {
-        return (double)(Math.log10((double)a));
+        return (double)(scalar_log10(a));
     }
 
     static double strictLOG10(double a) {
-        return (double)(StrictMath.log10((double)a));
+        return (double)(strict_scalar_log10(a));
     }
 
     @Test(dataProvider = "doubleUnaryOpProvider")
@@ -4204,11 +4403,11 @@ relativeError));
     }
 
     static double EXPM1(double a) {
-        return (double)(Math.expm1((double)a));
+        return (double)(scalar_expm1(a));
     }
 
     static double strictEXPM1(double a) {
-        return (double)(StrictMath.expm1((double)a));
+        return (double)(strict_scalar_expm1(a));
     }
 
     @Test(dataProvider = "doubleUnaryOpProvider")
@@ -4227,11 +4426,11 @@ relativeError));
     }
 
     static double COS(double a) {
-        return (double)(Math.cos((double)a));
+        return (double)(scalar_cos(a));
     }
 
     static double strictCOS(double a) {
-        return (double)(StrictMath.cos((double)a));
+        return (double)(strict_scalar_cos(a));
     }
 
     @Test(dataProvider = "doubleUnaryOpProvider")
@@ -4250,11 +4449,11 @@ relativeError));
     }
 
     static double TAN(double a) {
-        return (double)(Math.tan((double)a));
+        return (double)(scalar_tan(a));
     }
 
     static double strictTAN(double a) {
-        return (double)(StrictMath.tan((double)a));
+        return (double)(strict_scalar_tan(a));
     }
 
     @Test(dataProvider = "doubleUnaryOpProvider")
@@ -4273,11 +4472,11 @@ relativeError));
     }
 
     static double SINH(double a) {
-        return (double)(Math.sinh((double)a));
+        return (double)(scalar_sinh(a));
     }
 
     static double strictSINH(double a) {
-        return (double)(StrictMath.sinh((double)a));
+        return (double)(strict_scalar_sinh(a));
     }
 
     @Test(dataProvider = "doubleUnaryOpProvider")
@@ -4296,11 +4495,11 @@ relativeError));
     }
 
     static double COSH(double a) {
-        return (double)(Math.cosh((double)a));
+        return (double)(scalar_cosh(a));
     }
 
     static double strictCOSH(double a) {
-        return (double)(StrictMath.cosh((double)a));
+        return (double)(strict_scalar_cosh(a));
     }
 
     @Test(dataProvider = "doubleUnaryOpProvider")
@@ -4319,11 +4518,11 @@ relativeError));
     }
 
     static double TANH(double a) {
-        return (double)(Math.tanh((double)a));
+        return (double)(scalar_tanh(a));
     }
 
     static double strictTANH(double a) {
-        return (double)(StrictMath.tanh((double)a));
+        return (double)(strict_scalar_tanh(a));
     }
 
     @Test(dataProvider = "doubleUnaryOpProvider")
@@ -4342,11 +4541,11 @@ relativeError));
     }
 
     static double ASIN(double a) {
-        return (double)(Math.asin((double)a));
+        return (double)(scalar_asin(a));
     }
 
     static double strictASIN(double a) {
-        return (double)(StrictMath.asin((double)a));
+        return (double)(strict_scalar_asin(a));
     }
 
     @Test(dataProvider = "doubleUnaryOpProvider")
@@ -4365,11 +4564,11 @@ relativeError));
     }
 
     static double ACOS(double a) {
-        return (double)(Math.acos((double)a));
+        return (double)(scalar_acos(a));
     }
 
     static double strictACOS(double a) {
-        return (double)(StrictMath.acos((double)a));
+        return (double)(strict_scalar_acos(a));
     }
 
     @Test(dataProvider = "doubleUnaryOpProvider")
@@ -4388,11 +4587,11 @@ relativeError));
     }
 
     static double ATAN(double a) {
-        return (double)(Math.atan((double)a));
+        return (double)(scalar_atan(a));
     }
 
     static double strictATAN(double a) {
-        return (double)(StrictMath.atan((double)a));
+        return (double)(strict_scalar_atan(a));
     }
 
     @Test(dataProvider = "doubleUnaryOpProvider")
@@ -4411,11 +4610,11 @@ relativeError));
     }
 
     static double CBRT(double a) {
-        return (double)(Math.cbrt((double)a));
+        return (double)(scalar_cbrt(a));
     }
 
     static double strictCBRT(double a) {
-        return (double)(StrictMath.cbrt((double)a));
+        return (double)(strict_scalar_cbrt(a));
     }
 
     @Test(dataProvider = "doubleUnaryOpProvider")
@@ -4434,11 +4633,11 @@ relativeError));
     }
 
     static double HYPOT(double a, double b) {
-        return (double)(Math.hypot((double)a, (double)b));
+        return (double)(scalar_hypot(a, b));
     }
 
     static double strictHYPOT(double a, double b) {
-        return (double)(StrictMath.hypot((double)a, (double)b));
+        return (double)(strict_scalar_hypot(a, b));
     }
 
     @Test(dataProvider = "doubleBinaryOpProvider")
@@ -4460,11 +4659,11 @@ relativeError));
 
 
     static double POW(double a, double b) {
-        return (double)(Math.pow((double)a, (double)b));
+        return (double)(scalar_pow(a, b));
     }
 
     static double strictPOW(double a, double b) {
-        return (double)(StrictMath.pow((double)a, (double)b));
+        return (double)(strict_scalar_pow(a, b));
     }
 
     @Test(dataProvider = "doubleBinaryOpProvider")
@@ -4486,11 +4685,11 @@ relativeError));
 
 
     static double pow(double a, double b) {
-        return (double)(Math.pow((double)a, (double)b));
+        return (double)(scalar_pow(a, b));
     }
 
     static double strictpow(double a, double b) {
-        return (double)(StrictMath.pow((double)a, (double)b));
+        return (double)(strict_scalar_pow(a, b));
     }
 
     @Test(dataProvider = "doubleBinaryOpProvider")
@@ -4512,11 +4711,11 @@ relativeError));
 
 
     static double ATAN2(double a, double b) {
-        return (double)(Math.atan2((double)a, (double)b));
+        return (double)(scalar_atan2(a, b));
     }
 
     static double strictATAN2(double a, double b) {
-        return (double)(StrictMath.atan2((double)a, (double)b));
+        return (double)(strict_scalar_atan2(a, b));
     }
 
     @Test(dataProvider = "doubleBinaryOpProvider")
@@ -4568,11 +4767,11 @@ relativeError));
 
 
     static double FMA(double a, double b, double c) {
-        return (double)(Math.fma(a, b, c));
+        return (double)(scalar_fma(a, b, c));
     }
 
     static double fma(double a, double b, double c) {
-        return (double)(Math.fma(a, b, c));
+        return (double)(scalar_fma(a, b, c));
     }
 
     @Test(dataProvider = "doubleTernaryOpProvider")
@@ -4792,11 +4991,11 @@ relativeError));
     }
 
     static double NEG(double a) {
-        return (double)(-((double)a));
+        return (double)(scalar_neg((double)a));
     }
 
     static double neg(double a) {
-        return (double)(-((double)a));
+        return (double)(scalar_neg((double)a));
     }
 
     @Test(dataProvider = "doubleUnaryOpProvider")
@@ -4848,11 +5047,11 @@ relativeError));
     }
 
     static double ABS(double a) {
-        return (double)(Math.abs((double)a));
+        return (double)(scalar_abs((double)a));
     }
 
     static double abs(double a) {
-        return (double)(Math.abs((double)a));
+        return (double)(scalar_abs((double)a));
     }
 
     @Test(dataProvider = "doubleUnaryOpProvider")
@@ -4904,11 +5103,11 @@ relativeError));
     }
 
     static double SQRT(double a) {
-        return (double)(Math.sqrt((double)a));
+        return (double)(scalar_sqrt(a));
     }
 
     static double sqrt(double a) {
-        return (double)(Math.sqrt((double)a));
+        return (double)(scalar_sqrt(a));
     }
 
     @Test(dataProvider = "doubleUnaryOpProvider")
@@ -5121,7 +5320,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] < b[i]);
+                assertEquals(mv.laneIsSet(j), lt(a[i + j], b[i]));
             }
         }
     }
@@ -5137,7 +5336,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] == b[i]);
+                assertEquals(mv.laneIsSet(j), eq(a[i + j], b[i]));
             }
         }
     }
@@ -5196,7 +5395,7 @@ relativeError));
     static long ADDReduceLong(double[] a, int idx) {
         double res = 0;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res += a[i];
+            res = scalar_add(res, a[i]);
         }
 
         return (long)res;
@@ -5205,7 +5404,7 @@ relativeError));
     static long ADDReduceAllLong(double[] a) {
         long res = 0;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduceLong(a, i);
+            res = (long)scalar_add((double)res, (double)ADDReduceLong(a, i));
         }
 
         return res;
@@ -5223,8 +5422,8 @@ relativeError));
         }
 
         ra = 0;
-        for (int i = 0; i < a.length; i ++) {
-            ra += r[i];
+        for (int i = 0; i < a.length; i++) {
+            ra = (long)scalar_add((double)ra, (double)r[i]);
         }
 
         assertReductionLongArraysEquals(r, ra, a,
@@ -5234,8 +5433,9 @@ relativeError));
     static long ADDReduceLongMasked(double[] a, int idx, boolean[] mask) {
         double res = 0;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            if(mask[i % SPECIES.length()])
-                res += a[i];
+            if (mask[i % SPECIES.length()]) {
+                res = scalar_add(res, a[i]);
+            }
         }
 
         return (long)res;
@@ -5244,7 +5444,7 @@ relativeError));
     static long ADDReduceAllLongMasked(double[] a, boolean[] mask) {
         long res = 0;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduceLongMasked(a, i, mask);
+            res = (long)scalar_add((double)res, (double)ADDReduceLongMasked(a, i, mask));
         }
 
         return res;
@@ -5264,8 +5464,8 @@ relativeError));
         }
 
         ra = 0;
-        for (int i = 0; i < a.length; i ++) {
-            ra += r[i];
+        for (int i = 0; i < a.length; i++) {
+            ra = (long)scalar_add((double)ra, (double)r[i]);
         }
 
         assertReductionLongArraysEqualsMasked(r, ra, a, mask,
diff --git a/test/jdk/jdk/incubator/vector/DoubleVectorMaxTests.java b/test/jdk/jdk/incubator/vector/DoubleVectorMaxTests.java
index c4dda942e83..2684ae2d0c6 100644
--- a/test/jdk/jdk/incubator/vector/DoubleVectorMaxTests.java
+++ b/test/jdk/jdk/incubator/vector/DoubleVectorMaxTests.java
@@ -1590,6 +1590,205 @@ relativeError));
         return Double.compare(a, (double) 0) != 0 ? a : b;
     }
 
+
+    static double scalar_add(double a, double b) {
+        return (double)(a + b);
+    }
+
+    static double scalar_sub(double a, double b) {
+        return (double)(a - b);
+    }
+
+    static double scalar_mul(double a, double b) {
+        return (double)(a * b);
+    }
+
+    static double scalar_min(double a, double b) {
+        return (double)(Math.min(a, b));
+    }
+
+    static double scalar_max(double a, double b) {
+        return (double)(Math.max(a, b));
+    }
+
+    static double scalar_div(double a, double b) {
+        return (double)(a / b);
+    }
+
+    static double scalar_fma(double a, double b, double c) {
+        return (double)(Math.fma(a, b, c));
+    }
+
+    static double scalar_abs(double a) {
+        return (double)(Math.abs(a));
+    }
+
+    static double scalar_neg(double a) {
+        return ((double)-a);
+    }
+
+    static double scalar_sin(double a) {
+        return (double)Math.sin((double)a);
+    }
+
+    static double scalar_exp(double a) {
+        return (double)Math.exp((double)a);
+    }
+
+    static double scalar_log1p(double a) {
+        return (double)Math.log1p((double)a);
+    }
+
+    static double scalar_log(double a) {
+        return (double)Math.log((double)a);
+    }
+
+    static double scalar_log10(double a) {
+        return (double)Math.log10((double)a);
+    }
+
+    static double scalar_expm1(double a) {
+        return (double)Math.expm1((double)a);
+    }
+
+    static double scalar_cos(double a) {
+        return (double)Math.cos((double)a);
+    }
+
+    static double scalar_tan(double a) {
+        return (double)Math.tan((double)a);
+    }
+
+    static double scalar_sinh(double a) {
+        return (double)Math.sinh((double)a);
+    }
+
+    static double scalar_cosh(double a) {
+        return (double)Math.cosh((double)a);
+    }
+
+    static double scalar_tanh(double a) {
+        return (double)Math.tanh((double)a);
+    }
+
+    static double scalar_asin(double a) {
+        return (double)Math.asin((double)a);
+    }
+
+    static double scalar_acos(double a) {
+        return (double)Math.acos((double)a);
+    }
+
+    static double scalar_atan(double a) {
+        return (double)Math.atan((double)a);
+    }
+
+    static double scalar_cbrt(double a) {
+        return (double)Math.cbrt((double)a);
+    }
+
+    static double scalar_sqrt(double a) {
+        return (double)Math.sqrt((double)a);
+    }
+
+    static double scalar_hypot(double a, double b) {
+        return (double)Math.hypot((double)a, (double)b);
+    }
+
+    static double scalar_pow(double a, double b) {
+        return (double)Math.pow((double)a, (double)b);
+    }
+
+    static double scalar_atan2(double a, double b) {
+        return (double)Math.atan2((double)a, (double)b);
+    }
+
+    static double strict_scalar_sin(double a) {
+        return (double)StrictMath.sin((double)a);
+    }
+
+    static double strict_scalar_exp(double a) {
+        return (double)StrictMath.exp((double)a);
+    }
+
+    static double strict_scalar_log1p(double a) {
+        return (double)StrictMath.log1p((double)a);
+    }
+
+    static double strict_scalar_log(double a) {
+        return (double)StrictMath.log((double)a);
+    }
+
+    static double strict_scalar_log10(double a) {
+        return (double)StrictMath.log10((double)a);
+    }
+
+    static double strict_scalar_expm1(double a) {
+        return (double)StrictMath.expm1((double)a);
+    }
+
+    static double strict_scalar_cos(double a) {
+        return (double)StrictMath.cos((double)a);
+    }
+
+    static double strict_scalar_tan(double a) {
+        return (double)StrictMath.tan((double)a);
+    }
+
+    static double strict_scalar_sinh(double a) {
+        return (double)StrictMath.sinh((double)a);
+    }
+
+    static double strict_scalar_cosh(double a) {
+        return (double)StrictMath.cosh((double)a);
+    }
+
+    static double strict_scalar_tanh(double a) {
+        return (double)StrictMath.tanh((double)a);
+    }
+
+    static double strict_scalar_asin(double a) {
+        return (double)StrictMath.asin((double)a);
+    }
+
+    static double strict_scalar_acos(double a) {
+        return (double)StrictMath.acos((double)a);
+    }
+
+    static double strict_scalar_atan(double a) {
+        return (double)StrictMath.atan((double)a);
+    }
+
+    static double strict_scalar_cbrt(double a) {
+        return (double)StrictMath.cbrt((double)a);
+    }
+
+    static double strict_scalar_sqrt(double a) {
+        return (double)StrictMath.sqrt((double)a);
+    }
+
+    static double strict_scalar_hypot(double a, double b) {
+        return (double)StrictMath.hypot((double)a, (double)b);
+    }
+
+    static double strict_scalar_pow(double a, double b) {
+        return (double)StrictMath.pow((double)a, (double)b);
+    }
+
+    static double strict_scalar_atan2(double a, double b) {
+        return (double)StrictMath.atan2((double)a, (double)b);
+    }
+
+    static boolean isNaN(double a) {
+        return Double.isNaN(a);
+    }
+    static boolean isFinite(double a) {
+        return Double.isFinite(a);
+    }
+    static boolean isInfinite(double a) {
+        return Double.isInfinite(a);
+    }
+
     @Test
     static void smokeTest1() {
         DoubleVector three = DoubleVector.broadcast(SPECIES, (byte)-3);
@@ -1683,7 +1882,7 @@ relativeError));
     }
 
     static double ADD(double a, double b) {
-        return (double)(a + b);
+        return (double)(scalar_add(a, b));
     }
 
     @Test(dataProvider = "doubleBinaryOpProvider")
@@ -1704,7 +1903,7 @@ relativeError));
     }
 
     static double add(double a, double b) {
-        return (double)(a + b);
+        return (double)(scalar_add(a, b));
     }
 
     @Test(dataProvider = "doubleBinaryOpProvider")
@@ -1761,7 +1960,7 @@ relativeError));
     }
 
     static double SUB(double a, double b) {
-        return (double)(a - b);
+        return (double)(scalar_sub(a, b));
     }
 
     @Test(dataProvider = "doubleBinaryOpProvider")
@@ -1782,7 +1981,7 @@ relativeError));
     }
 
     static double sub(double a, double b) {
-        return (double)(a - b);
+        return (double)(scalar_sub(a, b));
     }
 
     @Test(dataProvider = "doubleBinaryOpProvider")
@@ -1839,7 +2038,7 @@ relativeError));
     }
 
     static double MUL(double a, double b) {
-        return (double)(a * b);
+        return (double)(scalar_mul(a, b));
     }
 
     @Test(dataProvider = "doubleBinaryOpProvider")
@@ -1860,7 +2059,7 @@ relativeError));
     }
 
     static double mul(double a, double b) {
-        return (double)(a * b);
+        return (double)(scalar_mul(a, b));
     }
 
     @Test(dataProvider = "doubleBinaryOpProvider")
@@ -1917,7 +2116,7 @@ relativeError));
     }
 
     static double DIV(double a, double b) {
-        return (double)(a / b);
+        return (double)(scalar_div(a, b));
     }
 
     @Test(dataProvider = "doubleBinaryOpProvider")
@@ -1938,7 +2137,7 @@ relativeError));
     }
 
     static double div(double a, double b) {
-        return (double)(a / b);
+        return (double)(scalar_div(a, b));
     }
 
     @Test(dataProvider = "doubleBinaryOpProvider")
@@ -1995,7 +2194,7 @@ relativeError));
     }
 
     static double FIRST_NONZERO(double a, double b) {
-        return (double)(Double.doubleToLongBits(a)!=0?a:b);
+        return (double)(firstNonZero(a, b));
     }
 
     @Test(dataProvider = "doubleBinaryOpProvider")
@@ -2297,7 +2496,7 @@ relativeError));
     }
 
     static double MIN(double a, double b) {
-        return (double)(Math.min(a, b));
+        return (double)(scalar_min(a, b));
     }
 
     @Test(dataProvider = "doubleBinaryOpProvider")
@@ -2318,7 +2517,7 @@ relativeError));
     }
 
     static double min(double a, double b) {
-        return (double)(Math.min(a, b));
+        return (double)(scalar_min(a, b));
     }
 
     @Test(dataProvider = "doubleBinaryOpProvider")
@@ -2337,7 +2536,7 @@ relativeError));
     }
 
     static double MAX(double a, double b) {
-        return (double)(Math.max(a, b));
+        return (double)(scalar_max(a, b));
     }
 
     @Test(dataProvider = "doubleBinaryOpProvider")
@@ -2358,7 +2557,7 @@ relativeError));
     }
 
     static double max(double a, double b) {
-        return (double)(Math.max(a, b));
+        return (double)(scalar_max(a, b));
     }
 
     @Test(dataProvider = "doubleBinaryOpProvider")
@@ -2435,7 +2634,7 @@ relativeError));
     static double ADDReduce(double[] a, int idx) {
         double res = ADD_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res += a[i];
+            res = scalar_add(res, a[i]);
         }
 
         return res;
@@ -2444,7 +2643,7 @@ relativeError));
     static double ADDReduceAll(double[] a) {
         double res = ADD_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduce(a, i);
+            res = scalar_add(res, ADDReduce(a, i));
         }
 
         return res;
@@ -2462,7 +2661,7 @@ relativeError));
                 DoubleVector av = DoubleVector.fromArray(SPECIES, a, i);
                 double v = av.reduceLanes(VectorOperators.ADD);
                 r[i] = v;
-                ra += v;
+                ra = scalar_add(ra, v);
             }
         }
 
@@ -2475,20 +2674,20 @@ relativeError));
         double[] a = fa.apply(SPECIES.length());
         double id = ADD_IDENTITY;
 
-        assertEquals((double) (id + id), id,
+        assertEquals((double) (scalar_add(id, id)), id,
                             "ADD(ADD_IDENTITY, ADD_IDENTITY) != ADD_IDENTITY");
 
         double x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((double) (id + x), x);
-                assertEquals((double) (x + id), x);
+                assertEquals((double) (scalar_add(id, x)), x);
+                assertEquals((double) (scalar_add(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((double) (id + x), x,
+            assertEquals((double) (scalar_add(id, x)), x,
                                 "ADD(ADD_IDENTITY, " + x + ") != " + x);
-            assertEquals((double) (x + id), x,
+            assertEquals((double) (scalar_add(x, id)), x,
                                 "ADD(" + x + ", ADD_IDENTITY) != " + x);
         }
     }
@@ -2497,7 +2696,7 @@ relativeError));
         double res = ADD_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res += a[i];
+                res = scalar_add(res, a[i]);
         }
 
         return res;
@@ -2506,7 +2705,7 @@ relativeError));
     static double ADDReduceAllMasked(double[] a, boolean[] mask) {
         double res = ADD_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduceMasked(a, i, mask);
+            res = scalar_add(res, ADDReduceMasked(a, i, mask));
         }
 
         return res;
@@ -2526,7 +2725,7 @@ relativeError));
                 DoubleVector av = DoubleVector.fromArray(SPECIES, a, i);
                 double v = av.reduceLanes(VectorOperators.ADD, vmask);
                 r[i] = v;
-                ra += v;
+                ra = scalar_add(ra, v);
             }
         }
 
@@ -2537,7 +2736,7 @@ relativeError));
     static double MULReduce(double[] a, int idx) {
         double res = MUL_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res *= a[i];
+            res = scalar_mul(res, a[i]);
         }
 
         return res;
@@ -2546,7 +2745,7 @@ relativeError));
     static double MULReduceAll(double[] a) {
         double res = MUL_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res *= MULReduce(a, i);
+            res = scalar_mul(res, MULReduce(a, i));
         }
 
         return res;
@@ -2564,7 +2763,7 @@ relativeError));
                 DoubleVector av = DoubleVector.fromArray(SPECIES, a, i);
                 double v = av.reduceLanes(VectorOperators.MUL);
                 r[i] = v;
-                ra *= v;
+                ra = scalar_mul(ra, v);
             }
         }
 
@@ -2577,20 +2776,20 @@ relativeError));
         double[] a = fa.apply(SPECIES.length());
         double id = MUL_IDENTITY;
 
-        assertEquals((double) (id * id), id,
+        assertEquals((double) (scalar_mul(id, id)), id,
                             "MUL(MUL_IDENTITY, MUL_IDENTITY) != MUL_IDENTITY");
 
         double x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((double) (id * x), x);
-                assertEquals((double) (x * id), x);
+                assertEquals((double) (scalar_mul(id, x)), x);
+                assertEquals((double) (scalar_mul(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((double) (id * x), x,
+            assertEquals((double) (scalar_mul(id, x)), x,
                                 "MUL(MUL_IDENTITY, " + x + ") != " + x);
-            assertEquals((double) (x * id), x,
+            assertEquals((double) (scalar_mul(x, id)), x,
                                 "MUL(" + x + ", MUL_IDENTITY) != " + x);
         }
     }
@@ -2599,7 +2798,7 @@ relativeError));
         double res = MUL_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res *= a[i];
+                res = scalar_mul(res, a[i]);
         }
 
         return res;
@@ -2608,7 +2807,7 @@ relativeError));
     static double MULReduceAllMasked(double[] a, boolean[] mask) {
         double res = MUL_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res *= MULReduceMasked(a, i, mask);
+            res = scalar_mul(res, MULReduceMasked(a, i, mask));
         }
 
         return res;
@@ -2628,7 +2827,7 @@ relativeError));
                 DoubleVector av = DoubleVector.fromArray(SPECIES, a, i);
                 double v = av.reduceLanes(VectorOperators.MUL, vmask);
                 r[i] = v;
-                ra *= v;
+                ra = scalar_mul(ra, v);
             }
         }
 
@@ -2639,7 +2838,7 @@ relativeError));
     static double MINReduce(double[] a, int idx) {
         double res = MIN_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res = (double) Math.min(res, a[i]);
+            res = scalar_min(res, a[i]);
         }
 
         return res;
@@ -2648,7 +2847,7 @@ relativeError));
     static double MINReduceAll(double[] a) {
         double res = MIN_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (double) Math.min(res, MINReduce(a, i));
+            res = scalar_min(res, MINReduce(a, i));
         }
 
         return res;
@@ -2666,7 +2865,7 @@ relativeError));
                 DoubleVector av = DoubleVector.fromArray(SPECIES, a, i);
                 double v = av.reduceLanes(VectorOperators.MIN);
                 r[i] = v;
-                ra = (double) Math.min(ra, v);
+                ra = scalar_min(ra, v);
             }
         }
 
@@ -2679,20 +2878,20 @@ relativeError));
         double[] a = fa.apply(SPECIES.length());
         double id = MIN_IDENTITY;
 
-        assertEquals((double) Math.min(id, id), id,
+        assertEquals(scalar_min(id, id), id,
                             "MIN(MIN_IDENTITY, MIN_IDENTITY) != MIN_IDENTITY");
 
         double x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((double) Math.min(id, x), x);
-                assertEquals((double) Math.min(x, id), x);
+                assertEquals(scalar_min(id, x), x);
+                assertEquals(scalar_min(x, id), x);
             }
         } catch (AssertionError e) {
-            assertEquals((double) Math.min(id, x), x,
+            assertEquals(scalar_min(id, x), x,
                                 "MIN(MIN_IDENTITY, " + x + ") != " + x);
-            assertEquals((double) Math.min(x, id), x,
+            assertEquals(scalar_min(x, id), x,
                                 "MIN(" + x + ", MIN_IDENTITY) != " + x);
         }
     }
@@ -2701,7 +2900,7 @@ relativeError));
         double res = MIN_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res = (double) Math.min(res, a[i]);
+                res = scalar_min(res, a[i]);
         }
 
         return res;
@@ -2710,7 +2909,7 @@ relativeError));
     static double MINReduceAllMasked(double[] a, boolean[] mask) {
         double res = MIN_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (double) Math.min(res, MINReduceMasked(a, i, mask));
+            res = scalar_min(res, MINReduceMasked(a, i, mask));
         }
 
         return res;
@@ -2730,7 +2929,7 @@ relativeError));
                 DoubleVector av = DoubleVector.fromArray(SPECIES, a, i);
                 double v = av.reduceLanes(VectorOperators.MIN, vmask);
                 r[i] = v;
-                ra = (double) Math.min(ra, v);
+                ra = scalar_min(ra, v);
             }
         }
 
@@ -2741,7 +2940,7 @@ relativeError));
     static double MAXReduce(double[] a, int idx) {
         double res = MAX_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res = (double) Math.max(res, a[i]);
+            res = scalar_max(res, a[i]);
         }
 
         return res;
@@ -2750,7 +2949,7 @@ relativeError));
     static double MAXReduceAll(double[] a) {
         double res = MAX_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (double) Math.max(res, MAXReduce(a, i));
+            res = scalar_max(res, MAXReduce(a, i));
         }
 
         return res;
@@ -2768,7 +2967,7 @@ relativeError));
                 DoubleVector av = DoubleVector.fromArray(SPECIES, a, i);
                 double v = av.reduceLanes(VectorOperators.MAX);
                 r[i] = v;
-                ra = (double) Math.max(ra, v);
+                ra = scalar_max(ra, v);
             }
         }
 
@@ -2781,20 +2980,20 @@ relativeError));
         double[] a = fa.apply(SPECIES.length());
         double id = MAX_IDENTITY;
 
-        assertEquals((double) Math.max(id, id), id,
+        assertEquals(scalar_max(id, id), id,
                             "MAX(MAX_IDENTITY, MAX_IDENTITY) != MAX_IDENTITY");
 
         double x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((double) Math.max(id, x), x);
-                assertEquals((double) Math.max(x, id), x);
+                assertEquals(scalar_max(id, x), x);
+                assertEquals(scalar_max(x, id), x);
             }
         } catch (AssertionError e) {
-            assertEquals((double) Math.max(id, x), x,
+            assertEquals(scalar_max(id, x), x,
                                 "MAX(MAX_IDENTITY, " + x + ") != " + x);
-            assertEquals((double) Math.max(x, id), x,
+            assertEquals(scalar_max(x, id), x,
                                 "MAX(" + x + ", MAX_IDENTITY) != " + x);
         }
     }
@@ -2803,7 +3002,7 @@ relativeError));
         double res = MAX_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res = (double) Math.max(res, a[i]);
+                res = scalar_max(res, a[i]);
         }
 
         return res;
@@ -2812,7 +3011,7 @@ relativeError));
     static double MAXReduceAllMasked(double[] a, boolean[] mask) {
         double res = MAX_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (double) Math.max(res, MAXReduceMasked(a, i, mask));
+            res = scalar_max(res, MAXReduceMasked(a, i, mask));
         }
 
         return res;
@@ -2832,7 +3031,7 @@ relativeError));
                 DoubleVector av = DoubleVector.fromArray(SPECIES, a, i);
                 double v = av.reduceLanes(VectorOperators.MAX, vmask);
                 r[i] = v;
-                ra = (double) Math.max(ra, v);
+                ra = scalar_max(ra, v);
             }
         }
 
@@ -3044,7 +3243,7 @@ relativeError));
     }
 
     static boolean testIS_FINITE(double a) {
-        return Double.isFinite(a);
+        return isFinite(a);
     }
 
     @Test(dataProvider = "doubleTestOpProvider")
@@ -3085,7 +3284,7 @@ relativeError));
     }
 
     static boolean testIS_NAN(double a) {
-        return Double.isNaN(a);
+        return isNaN(a);
     }
 
     @Test(dataProvider = "doubleTestOpProvider")
@@ -3126,7 +3325,7 @@ relativeError));
     }
 
     static boolean testIS_INFINITE(double a) {
-        return Double.isInfinite(a);
+        return isInfinite(a);
     }
 
     @Test(dataProvider = "doubleTestOpProvider")
@@ -3467,7 +3666,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] < b[i]);
+                assertEquals(mv.laneIsSet(j), lt(a[i + j], b[i]));
             }
         }
     }
@@ -3487,7 +3686,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] < b[i]));
+                assertEquals(mv.laneIsSet(j), mask[j] && (lt(a[i + j], b[i])));
             }
         }
     }
@@ -3503,7 +3702,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] < (double)((long)b[i]));
+                assertEquals(mv.laneIsSet(j), lt(a[i + j], (double)((long)b[i])));
             }
         }
     }
@@ -3523,7 +3722,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] < (double)((long)b[i])));
+                assertEquals(mv.laneIsSet(j), mask[j] && (lt(a[i + j], (double)((long)b[i]))));
             }
         }
     }
@@ -3539,7 +3738,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] == b[i]);
+                assertEquals(mv.laneIsSet(j), eq(a[i + j], b[i]));
             }
         }
     }
@@ -3559,7 +3758,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] == b[i]));
+                assertEquals(mv.laneIsSet(j), mask[j] && (eq(a[i + j], b[i])));
             }
         }
     }
@@ -3575,7 +3774,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] == (double)((long)b[i]));
+                assertEquals(mv.laneIsSet(j), eq(a[i + j], (double)((long)b[i])));
             }
         }
     }
@@ -3595,7 +3794,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] == (double)((long)b[i])));
+                assertEquals(mv.laneIsSet(j), mask[j] && (eq(a[i + j], (double)((long)b[i]))));
             }
         }
     }
@@ -4095,11 +4294,11 @@ relativeError));
     }
 
     static double SIN(double a) {
-        return (double)(Math.sin((double)a));
+        return (double)(scalar_sin(a));
     }
 
     static double strictSIN(double a) {
-        return (double)(StrictMath.sin((double)a));
+        return (double)(strict_scalar_sin(a));
     }
 
     @Test(dataProvider = "doubleUnaryOpProvider")
@@ -4118,11 +4317,11 @@ relativeError));
     }
 
     static double EXP(double a) {
-        return (double)(Math.exp((double)a));
+        return (double)(scalar_exp(a));
     }
 
     static double strictEXP(double a) {
-        return (double)(StrictMath.exp((double)a));
+        return (double)(strict_scalar_exp(a));
     }
 
     @Test(dataProvider = "doubleUnaryOpProvider")
@@ -4141,11 +4340,11 @@ relativeError));
     }
 
     static double LOG1P(double a) {
-        return (double)(Math.log1p((double)a));
+        return (double)(scalar_log1p(a));
     }
 
     static double strictLOG1P(double a) {
-        return (double)(StrictMath.log1p((double)a));
+        return (double)(strict_scalar_log1p(a));
     }
 
     @Test(dataProvider = "doubleUnaryOpProvider")
@@ -4164,11 +4363,11 @@ relativeError));
     }
 
     static double LOG(double a) {
-        return (double)(Math.log((double)a));
+        return (double)(scalar_log(a));
     }
 
     static double strictLOG(double a) {
-        return (double)(StrictMath.log((double)a));
+        return (double)(strict_scalar_log(a));
     }
 
     @Test(dataProvider = "doubleUnaryOpProvider")
@@ -4187,11 +4386,11 @@ relativeError));
     }
 
     static double LOG10(double a) {
-        return (double)(Math.log10((double)a));
+        return (double)(scalar_log10(a));
     }
 
     static double strictLOG10(double a) {
-        return (double)(StrictMath.log10((double)a));
+        return (double)(strict_scalar_log10(a));
     }
 
     @Test(dataProvider = "doubleUnaryOpProvider")
@@ -4210,11 +4409,11 @@ relativeError));
     }
 
     static double EXPM1(double a) {
-        return (double)(Math.expm1((double)a));
+        return (double)(scalar_expm1(a));
     }
 
     static double strictEXPM1(double a) {
-        return (double)(StrictMath.expm1((double)a));
+        return (double)(strict_scalar_expm1(a));
     }
 
     @Test(dataProvider = "doubleUnaryOpProvider")
@@ -4233,11 +4432,11 @@ relativeError));
     }
 
     static double COS(double a) {
-        return (double)(Math.cos((double)a));
+        return (double)(scalar_cos(a));
     }
 
     static double strictCOS(double a) {
-        return (double)(StrictMath.cos((double)a));
+        return (double)(strict_scalar_cos(a));
     }
 
     @Test(dataProvider = "doubleUnaryOpProvider")
@@ -4256,11 +4455,11 @@ relativeError));
     }
 
     static double TAN(double a) {
-        return (double)(Math.tan((double)a));
+        return (double)(scalar_tan(a));
     }
 
     static double strictTAN(double a) {
-        return (double)(StrictMath.tan((double)a));
+        return (double)(strict_scalar_tan(a));
     }
 
     @Test(dataProvider = "doubleUnaryOpProvider")
@@ -4279,11 +4478,11 @@ relativeError));
     }
 
     static double SINH(double a) {
-        return (double)(Math.sinh((double)a));
+        return (double)(scalar_sinh(a));
     }
 
     static double strictSINH(double a) {
-        return (double)(StrictMath.sinh((double)a));
+        return (double)(strict_scalar_sinh(a));
     }
 
     @Test(dataProvider = "doubleUnaryOpProvider")
@@ -4302,11 +4501,11 @@ relativeError));
     }
 
     static double COSH(double a) {
-        return (double)(Math.cosh((double)a));
+        return (double)(scalar_cosh(a));
     }
 
     static double strictCOSH(double a) {
-        return (double)(StrictMath.cosh((double)a));
+        return (double)(strict_scalar_cosh(a));
     }
 
     @Test(dataProvider = "doubleUnaryOpProvider")
@@ -4325,11 +4524,11 @@ relativeError));
     }
 
     static double TANH(double a) {
-        return (double)(Math.tanh((double)a));
+        return (double)(scalar_tanh(a));
     }
 
     static double strictTANH(double a) {
-        return (double)(StrictMath.tanh((double)a));
+        return (double)(strict_scalar_tanh(a));
     }
 
     @Test(dataProvider = "doubleUnaryOpProvider")
@@ -4348,11 +4547,11 @@ relativeError));
     }
 
     static double ASIN(double a) {
-        return (double)(Math.asin((double)a));
+        return (double)(scalar_asin(a));
     }
 
     static double strictASIN(double a) {
-        return (double)(StrictMath.asin((double)a));
+        return (double)(strict_scalar_asin(a));
     }
 
     @Test(dataProvider = "doubleUnaryOpProvider")
@@ -4371,11 +4570,11 @@ relativeError));
     }
 
     static double ACOS(double a) {
-        return (double)(Math.acos((double)a));
+        return (double)(scalar_acos(a));
     }
 
     static double strictACOS(double a) {
-        return (double)(StrictMath.acos((double)a));
+        return (double)(strict_scalar_acos(a));
     }
 
     @Test(dataProvider = "doubleUnaryOpProvider")
@@ -4394,11 +4593,11 @@ relativeError));
     }
 
     static double ATAN(double a) {
-        return (double)(Math.atan((double)a));
+        return (double)(scalar_atan(a));
     }
 
     static double strictATAN(double a) {
-        return (double)(StrictMath.atan((double)a));
+        return (double)(strict_scalar_atan(a));
     }
 
     @Test(dataProvider = "doubleUnaryOpProvider")
@@ -4417,11 +4616,11 @@ relativeError));
     }
 
     static double CBRT(double a) {
-        return (double)(Math.cbrt((double)a));
+        return (double)(scalar_cbrt(a));
     }
 
     static double strictCBRT(double a) {
-        return (double)(StrictMath.cbrt((double)a));
+        return (double)(strict_scalar_cbrt(a));
     }
 
     @Test(dataProvider = "doubleUnaryOpProvider")
@@ -4440,11 +4639,11 @@ relativeError));
     }
 
     static double HYPOT(double a, double b) {
-        return (double)(Math.hypot((double)a, (double)b));
+        return (double)(scalar_hypot(a, b));
     }
 
     static double strictHYPOT(double a, double b) {
-        return (double)(StrictMath.hypot((double)a, (double)b));
+        return (double)(strict_scalar_hypot(a, b));
     }
 
     @Test(dataProvider = "doubleBinaryOpProvider")
@@ -4466,11 +4665,11 @@ relativeError));
 
 
     static double POW(double a, double b) {
-        return (double)(Math.pow((double)a, (double)b));
+        return (double)(scalar_pow(a, b));
     }
 
     static double strictPOW(double a, double b) {
-        return (double)(StrictMath.pow((double)a, (double)b));
+        return (double)(strict_scalar_pow(a, b));
     }
 
     @Test(dataProvider = "doubleBinaryOpProvider")
@@ -4492,11 +4691,11 @@ relativeError));
 
 
     static double pow(double a, double b) {
-        return (double)(Math.pow((double)a, (double)b));
+        return (double)(scalar_pow(a, b));
     }
 
     static double strictpow(double a, double b) {
-        return (double)(StrictMath.pow((double)a, (double)b));
+        return (double)(strict_scalar_pow(a, b));
     }
 
     @Test(dataProvider = "doubleBinaryOpProvider")
@@ -4518,11 +4717,11 @@ relativeError));
 
 
     static double ATAN2(double a, double b) {
-        return (double)(Math.atan2((double)a, (double)b));
+        return (double)(scalar_atan2(a, b));
     }
 
     static double strictATAN2(double a, double b) {
-        return (double)(StrictMath.atan2((double)a, (double)b));
+        return (double)(strict_scalar_atan2(a, b));
     }
 
     @Test(dataProvider = "doubleBinaryOpProvider")
@@ -4574,11 +4773,11 @@ relativeError));
 
 
     static double FMA(double a, double b, double c) {
-        return (double)(Math.fma(a, b, c));
+        return (double)(scalar_fma(a, b, c));
     }
 
     static double fma(double a, double b, double c) {
-        return (double)(Math.fma(a, b, c));
+        return (double)(scalar_fma(a, b, c));
     }
 
     @Test(dataProvider = "doubleTernaryOpProvider")
@@ -4798,11 +4997,11 @@ relativeError));
     }
 
     static double NEG(double a) {
-        return (double)(-((double)a));
+        return (double)(scalar_neg((double)a));
     }
 
     static double neg(double a) {
-        return (double)(-((double)a));
+        return (double)(scalar_neg((double)a));
     }
 
     @Test(dataProvider = "doubleUnaryOpProvider")
@@ -4854,11 +5053,11 @@ relativeError));
     }
 
     static double ABS(double a) {
-        return (double)(Math.abs((double)a));
+        return (double)(scalar_abs((double)a));
     }
 
     static double abs(double a) {
-        return (double)(Math.abs((double)a));
+        return (double)(scalar_abs((double)a));
     }
 
     @Test(dataProvider = "doubleUnaryOpProvider")
@@ -4910,11 +5109,11 @@ relativeError));
     }
 
     static double SQRT(double a) {
-        return (double)(Math.sqrt((double)a));
+        return (double)(scalar_sqrt(a));
     }
 
     static double sqrt(double a) {
-        return (double)(Math.sqrt((double)a));
+        return (double)(scalar_sqrt(a));
     }
 
     @Test(dataProvider = "doubleUnaryOpProvider")
@@ -5127,7 +5326,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] < b[i]);
+                assertEquals(mv.laneIsSet(j), lt(a[i + j], b[i]));
             }
         }
     }
@@ -5143,7 +5342,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] == b[i]);
+                assertEquals(mv.laneIsSet(j), eq(a[i + j], b[i]));
             }
         }
     }
@@ -5202,7 +5401,7 @@ relativeError));
     static long ADDReduceLong(double[] a, int idx) {
         double res = 0;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res += a[i];
+            res = scalar_add(res, a[i]);
         }
 
         return (long)res;
@@ -5211,7 +5410,7 @@ relativeError));
     static long ADDReduceAllLong(double[] a) {
         long res = 0;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduceLong(a, i);
+            res = (long)scalar_add((double)res, (double)ADDReduceLong(a, i));
         }
 
         return res;
@@ -5229,8 +5428,8 @@ relativeError));
         }
 
         ra = 0;
-        for (int i = 0; i < a.length; i ++) {
-            ra += r[i];
+        for (int i = 0; i < a.length; i++) {
+            ra = (long)scalar_add((double)ra, (double)r[i]);
         }
 
         assertReductionLongArraysEquals(r, ra, a,
@@ -5240,8 +5439,9 @@ relativeError));
     static long ADDReduceLongMasked(double[] a, int idx, boolean[] mask) {
         double res = 0;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            if(mask[i % SPECIES.length()])
-                res += a[i];
+            if (mask[i % SPECIES.length()]) {
+                res = scalar_add(res, a[i]);
+            }
         }
 
         return (long)res;
@@ -5250,7 +5450,7 @@ relativeError));
     static long ADDReduceAllLongMasked(double[] a, boolean[] mask) {
         long res = 0;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduceLongMasked(a, i, mask);
+            res = (long)scalar_add((double)res, (double)ADDReduceLongMasked(a, i, mask));
         }
 
         return res;
@@ -5270,8 +5470,8 @@ relativeError));
         }
 
         ra = 0;
-        for (int i = 0; i < a.length; i ++) {
-            ra += r[i];
+        for (int i = 0; i < a.length; i++) {
+            ra = (long)scalar_add((double)ra, (double)r[i]);
         }
 
         assertReductionLongArraysEqualsMasked(r, ra, a, mask,
diff --git a/test/jdk/jdk/incubator/vector/FloatVector128Tests.java b/test/jdk/jdk/incubator/vector/FloatVector128Tests.java
index 51e6365b01b..151ea17a886 100644
--- a/test/jdk/jdk/incubator/vector/FloatVector128Tests.java
+++ b/test/jdk/jdk/incubator/vector/FloatVector128Tests.java
@@ -1601,6 +1601,205 @@ relativeError));
         return Float.compare(a, (float) 0) != 0 ? a : b;
     }
 
+
+    static float scalar_add(float a, float b) {
+        return (float)(a + b);
+    }
+
+    static float scalar_sub(float a, float b) {
+        return (float)(a - b);
+    }
+
+    static float scalar_mul(float a, float b) {
+        return (float)(a * b);
+    }
+
+    static float scalar_min(float a, float b) {
+        return (float)(Math.min(a, b));
+    }
+
+    static float scalar_max(float a, float b) {
+        return (float)(Math.max(a, b));
+    }
+
+    static float scalar_div(float a, float b) {
+        return (float)(a / b);
+    }
+
+    static float scalar_fma(float a, float b, float c) {
+        return (float)(Math.fma(a, b, c));
+    }
+
+    static float scalar_abs(float a) {
+        return (float)(Math.abs(a));
+    }
+
+    static float scalar_neg(float a) {
+        return ((float)-a);
+    }
+
+    static float scalar_sin(float a) {
+        return (float)Math.sin((double)a);
+    }
+
+    static float scalar_exp(float a) {
+        return (float)Math.exp((double)a);
+    }
+
+    static float scalar_log1p(float a) {
+        return (float)Math.log1p((double)a);
+    }
+
+    static float scalar_log(float a) {
+        return (float)Math.log((double)a);
+    }
+
+    static float scalar_log10(float a) {
+        return (float)Math.log10((double)a);
+    }
+
+    static float scalar_expm1(float a) {
+        return (float)Math.expm1((double)a);
+    }
+
+    static float scalar_cos(float a) {
+        return (float)Math.cos((double)a);
+    }
+
+    static float scalar_tan(float a) {
+        return (float)Math.tan((double)a);
+    }
+
+    static float scalar_sinh(float a) {
+        return (float)Math.sinh((double)a);
+    }
+
+    static float scalar_cosh(float a) {
+        return (float)Math.cosh((double)a);
+    }
+
+    static float scalar_tanh(float a) {
+        return (float)Math.tanh((double)a);
+    }
+
+    static float scalar_asin(float a) {
+        return (float)Math.asin((double)a);
+    }
+
+    static float scalar_acos(float a) {
+        return (float)Math.acos((double)a);
+    }
+
+    static float scalar_atan(float a) {
+        return (float)Math.atan((double)a);
+    }
+
+    static float scalar_cbrt(float a) {
+        return (float)Math.cbrt((double)a);
+    }
+
+    static float scalar_sqrt(float a) {
+        return (float)Math.sqrt((double)a);
+    }
+
+    static float scalar_hypot(float a, float b) {
+        return (float)Math.hypot((double)a, (double)b);
+    }
+
+    static float scalar_pow(float a, float b) {
+        return (float)Math.pow((double)a, (double)b);
+    }
+
+    static float scalar_atan2(float a, float b) {
+        return (float)Math.atan2((double)a, (double)b);
+    }
+
+    static float strict_scalar_sin(float a) {
+        return (float)StrictMath.sin((double)a);
+    }
+
+    static float strict_scalar_exp(float a) {
+        return (float)StrictMath.exp((double)a);
+    }
+
+    static float strict_scalar_log1p(float a) {
+        return (float)StrictMath.log1p((double)a);
+    }
+
+    static float strict_scalar_log(float a) {
+        return (float)StrictMath.log((double)a);
+    }
+
+    static float strict_scalar_log10(float a) {
+        return (float)StrictMath.log10((double)a);
+    }
+
+    static float strict_scalar_expm1(float a) {
+        return (float)StrictMath.expm1((double)a);
+    }
+
+    static float strict_scalar_cos(float a) {
+        return (float)StrictMath.cos((double)a);
+    }
+
+    static float strict_scalar_tan(float a) {
+        return (float)StrictMath.tan((double)a);
+    }
+
+    static float strict_scalar_sinh(float a) {
+        return (float)StrictMath.sinh((double)a);
+    }
+
+    static float strict_scalar_cosh(float a) {
+        return (float)StrictMath.cosh((double)a);
+    }
+
+    static float strict_scalar_tanh(float a) {
+        return (float)StrictMath.tanh((double)a);
+    }
+
+    static float strict_scalar_asin(float a) {
+        return (float)StrictMath.asin((double)a);
+    }
+
+    static float strict_scalar_acos(float a) {
+        return (float)StrictMath.acos((double)a);
+    }
+
+    static float strict_scalar_atan(float a) {
+        return (float)StrictMath.atan((double)a);
+    }
+
+    static float strict_scalar_cbrt(float a) {
+        return (float)StrictMath.cbrt((double)a);
+    }
+
+    static float strict_scalar_sqrt(float a) {
+        return (float)StrictMath.sqrt((double)a);
+    }
+
+    static float strict_scalar_hypot(float a, float b) {
+        return (float)StrictMath.hypot((double)a, (double)b);
+    }
+
+    static float strict_scalar_pow(float a, float b) {
+        return (float)StrictMath.pow((double)a, (double)b);
+    }
+
+    static float strict_scalar_atan2(float a, float b) {
+        return (float)StrictMath.atan2((double)a, (double)b);
+    }
+
+    static boolean isNaN(float a) {
+        return Float.isNaN(a);
+    }
+    static boolean isFinite(float a) {
+        return Float.isFinite(a);
+    }
+    static boolean isInfinite(float a) {
+        return Float.isInfinite(a);
+    }
+
     @Test
     static void smokeTest1() {
         FloatVector three = FloatVector.broadcast(SPECIES, (byte)-3);
@@ -1694,7 +1893,7 @@ relativeError));
     }
 
     static float ADD(float a, float b) {
-        return (float)(a + b);
+        return (float)(scalar_add(a, b));
     }
 
     @Test(dataProvider = "floatBinaryOpProvider")
@@ -1715,7 +1914,7 @@ relativeError));
     }
 
     static float add(float a, float b) {
-        return (float)(a + b);
+        return (float)(scalar_add(a, b));
     }
 
     @Test(dataProvider = "floatBinaryOpProvider")
@@ -1772,7 +1971,7 @@ relativeError));
     }
 
     static float SUB(float a, float b) {
-        return (float)(a - b);
+        return (float)(scalar_sub(a, b));
     }
 
     @Test(dataProvider = "floatBinaryOpProvider")
@@ -1793,7 +1992,7 @@ relativeError));
     }
 
     static float sub(float a, float b) {
-        return (float)(a - b);
+        return (float)(scalar_sub(a, b));
     }
 
     @Test(dataProvider = "floatBinaryOpProvider")
@@ -1850,7 +2049,7 @@ relativeError));
     }
 
     static float MUL(float a, float b) {
-        return (float)(a * b);
+        return (float)(scalar_mul(a, b));
     }
 
     @Test(dataProvider = "floatBinaryOpProvider")
@@ -1871,7 +2070,7 @@ relativeError));
     }
 
     static float mul(float a, float b) {
-        return (float)(a * b);
+        return (float)(scalar_mul(a, b));
     }
 
     @Test(dataProvider = "floatBinaryOpProvider")
@@ -1928,7 +2127,7 @@ relativeError));
     }
 
     static float DIV(float a, float b) {
-        return (float)(a / b);
+        return (float)(scalar_div(a, b));
     }
 
     @Test(dataProvider = "floatBinaryOpProvider")
@@ -1949,7 +2148,7 @@ relativeError));
     }
 
     static float div(float a, float b) {
-        return (float)(a / b);
+        return (float)(scalar_div(a, b));
     }
 
     @Test(dataProvider = "floatBinaryOpProvider")
@@ -2006,7 +2205,7 @@ relativeError));
     }
 
     static float FIRST_NONZERO(float a, float b) {
-        return (float)(Double.doubleToLongBits(a)!=0?a:b);
+        return (float)(firstNonZero(a, b));
     }
 
     @Test(dataProvider = "floatBinaryOpProvider")
@@ -2308,7 +2507,7 @@ relativeError));
     }
 
     static float MIN(float a, float b) {
-        return (float)(Math.min(a, b));
+        return (float)(scalar_min(a, b));
     }
 
     @Test(dataProvider = "floatBinaryOpProvider")
@@ -2329,7 +2528,7 @@ relativeError));
     }
 
     static float min(float a, float b) {
-        return (float)(Math.min(a, b));
+        return (float)(scalar_min(a, b));
     }
 
     @Test(dataProvider = "floatBinaryOpProvider")
@@ -2348,7 +2547,7 @@ relativeError));
     }
 
     static float MAX(float a, float b) {
-        return (float)(Math.max(a, b));
+        return (float)(scalar_max(a, b));
     }
 
     @Test(dataProvider = "floatBinaryOpProvider")
@@ -2369,7 +2568,7 @@ relativeError));
     }
 
     static float max(float a, float b) {
-        return (float)(Math.max(a, b));
+        return (float)(scalar_max(a, b));
     }
 
     @Test(dataProvider = "floatBinaryOpProvider")
@@ -2446,7 +2645,7 @@ relativeError));
     static float ADDReduce(float[] a, int idx) {
         float res = ADD_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res += a[i];
+            res = scalar_add(res, a[i]);
         }
 
         return res;
@@ -2455,7 +2654,7 @@ relativeError));
     static float ADDReduceAll(float[] a) {
         float res = ADD_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduce(a, i);
+            res = scalar_add(res, ADDReduce(a, i));
         }
 
         return res;
@@ -2473,7 +2672,7 @@ relativeError));
                 FloatVector av = FloatVector.fromArray(SPECIES, a, i);
                 float v = av.reduceLanes(VectorOperators.ADD);
                 r[i] = v;
-                ra += v;
+                ra = scalar_add(ra, v);
             }
         }
 
@@ -2486,20 +2685,20 @@ relativeError));
         float[] a = fa.apply(SPECIES.length());
         float id = ADD_IDENTITY;
 
-        assertEquals((float) (id + id), id,
+        assertEquals((float) (scalar_add(id, id)), id,
                             "ADD(ADD_IDENTITY, ADD_IDENTITY) != ADD_IDENTITY");
 
         float x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((float) (id + x), x);
-                assertEquals((float) (x + id), x);
+                assertEquals((float) (scalar_add(id, x)), x);
+                assertEquals((float) (scalar_add(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((float) (id + x), x,
+            assertEquals((float) (scalar_add(id, x)), x,
                                 "ADD(ADD_IDENTITY, " + x + ") != " + x);
-            assertEquals((float) (x + id), x,
+            assertEquals((float) (scalar_add(x, id)), x,
                                 "ADD(" + x + ", ADD_IDENTITY) != " + x);
         }
     }
@@ -2508,7 +2707,7 @@ relativeError));
         float res = ADD_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res += a[i];
+                res = scalar_add(res, a[i]);
         }
 
         return res;
@@ -2517,7 +2716,7 @@ relativeError));
     static float ADDReduceAllMasked(float[] a, boolean[] mask) {
         float res = ADD_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduceMasked(a, i, mask);
+            res = scalar_add(res, ADDReduceMasked(a, i, mask));
         }
 
         return res;
@@ -2537,7 +2736,7 @@ relativeError));
                 FloatVector av = FloatVector.fromArray(SPECIES, a, i);
                 float v = av.reduceLanes(VectorOperators.ADD, vmask);
                 r[i] = v;
-                ra += v;
+                ra = scalar_add(ra, v);
             }
         }
 
@@ -2548,7 +2747,7 @@ relativeError));
     static float MULReduce(float[] a, int idx) {
         float res = MUL_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res *= a[i];
+            res = scalar_mul(res, a[i]);
         }
 
         return res;
@@ -2557,7 +2756,7 @@ relativeError));
     static float MULReduceAll(float[] a) {
         float res = MUL_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res *= MULReduce(a, i);
+            res = scalar_mul(res, MULReduce(a, i));
         }
 
         return res;
@@ -2575,7 +2774,7 @@ relativeError));
                 FloatVector av = FloatVector.fromArray(SPECIES, a, i);
                 float v = av.reduceLanes(VectorOperators.MUL);
                 r[i] = v;
-                ra *= v;
+                ra = scalar_mul(ra, v);
             }
         }
 
@@ -2588,20 +2787,20 @@ relativeError));
         float[] a = fa.apply(SPECIES.length());
         float id = MUL_IDENTITY;
 
-        assertEquals((float) (id * id), id,
+        assertEquals((float) (scalar_mul(id, id)), id,
                             "MUL(MUL_IDENTITY, MUL_IDENTITY) != MUL_IDENTITY");
 
         float x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((float) (id * x), x);
-                assertEquals((float) (x * id), x);
+                assertEquals((float) (scalar_mul(id, x)), x);
+                assertEquals((float) (scalar_mul(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((float) (id * x), x,
+            assertEquals((float) (scalar_mul(id, x)), x,
                                 "MUL(MUL_IDENTITY, " + x + ") != " + x);
-            assertEquals((float) (x * id), x,
+            assertEquals((float) (scalar_mul(x, id)), x,
                                 "MUL(" + x + ", MUL_IDENTITY) != " + x);
         }
     }
@@ -2610,7 +2809,7 @@ relativeError));
         float res = MUL_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res *= a[i];
+                res = scalar_mul(res, a[i]);
         }
 
         return res;
@@ -2619,7 +2818,7 @@ relativeError));
     static float MULReduceAllMasked(float[] a, boolean[] mask) {
         float res = MUL_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res *= MULReduceMasked(a, i, mask);
+            res = scalar_mul(res, MULReduceMasked(a, i, mask));
         }
 
         return res;
@@ -2639,7 +2838,7 @@ relativeError));
                 FloatVector av = FloatVector.fromArray(SPECIES, a, i);
                 float v = av.reduceLanes(VectorOperators.MUL, vmask);
                 r[i] = v;
-                ra *= v;
+                ra = scalar_mul(ra, v);
             }
         }
 
@@ -2650,7 +2849,7 @@ relativeError));
     static float MINReduce(float[] a, int idx) {
         float res = MIN_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res = (float) Math.min(res, a[i]);
+            res = scalar_min(res, a[i]);
         }
 
         return res;
@@ -2659,7 +2858,7 @@ relativeError));
     static float MINReduceAll(float[] a) {
         float res = MIN_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (float) Math.min(res, MINReduce(a, i));
+            res = scalar_min(res, MINReduce(a, i));
         }
 
         return res;
@@ -2677,7 +2876,7 @@ relativeError));
                 FloatVector av = FloatVector.fromArray(SPECIES, a, i);
                 float v = av.reduceLanes(VectorOperators.MIN);
                 r[i] = v;
-                ra = (float) Math.min(ra, v);
+                ra = scalar_min(ra, v);
             }
         }
 
@@ -2690,20 +2889,20 @@ relativeError));
         float[] a = fa.apply(SPECIES.length());
         float id = MIN_IDENTITY;
 
-        assertEquals((float) Math.min(id, id), id,
+        assertEquals(scalar_min(id, id), id,
                             "MIN(MIN_IDENTITY, MIN_IDENTITY) != MIN_IDENTITY");
 
         float x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((float) Math.min(id, x), x);
-                assertEquals((float) Math.min(x, id), x);
+                assertEquals(scalar_min(id, x), x);
+                assertEquals(scalar_min(x, id), x);
             }
         } catch (AssertionError e) {
-            assertEquals((float) Math.min(id, x), x,
+            assertEquals(scalar_min(id, x), x,
                                 "MIN(MIN_IDENTITY, " + x + ") != " + x);
-            assertEquals((float) Math.min(x, id), x,
+            assertEquals(scalar_min(x, id), x,
                                 "MIN(" + x + ", MIN_IDENTITY) != " + x);
         }
     }
@@ -2712,7 +2911,7 @@ relativeError));
         float res = MIN_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res = (float) Math.min(res, a[i]);
+                res = scalar_min(res, a[i]);
         }
 
         return res;
@@ -2721,7 +2920,7 @@ relativeError));
     static float MINReduceAllMasked(float[] a, boolean[] mask) {
         float res = MIN_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (float) Math.min(res, MINReduceMasked(a, i, mask));
+            res = scalar_min(res, MINReduceMasked(a, i, mask));
         }
 
         return res;
@@ -2741,7 +2940,7 @@ relativeError));
                 FloatVector av = FloatVector.fromArray(SPECIES, a, i);
                 float v = av.reduceLanes(VectorOperators.MIN, vmask);
                 r[i] = v;
-                ra = (float) Math.min(ra, v);
+                ra = scalar_min(ra, v);
             }
         }
 
@@ -2752,7 +2951,7 @@ relativeError));
     static float MAXReduce(float[] a, int idx) {
         float res = MAX_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res = (float) Math.max(res, a[i]);
+            res = scalar_max(res, a[i]);
         }
 
         return res;
@@ -2761,7 +2960,7 @@ relativeError));
     static float MAXReduceAll(float[] a) {
         float res = MAX_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (float) Math.max(res, MAXReduce(a, i));
+            res = scalar_max(res, MAXReduce(a, i));
         }
 
         return res;
@@ -2779,7 +2978,7 @@ relativeError));
                 FloatVector av = FloatVector.fromArray(SPECIES, a, i);
                 float v = av.reduceLanes(VectorOperators.MAX);
                 r[i] = v;
-                ra = (float) Math.max(ra, v);
+                ra = scalar_max(ra, v);
             }
         }
 
@@ -2792,20 +2991,20 @@ relativeError));
         float[] a = fa.apply(SPECIES.length());
         float id = MAX_IDENTITY;
 
-        assertEquals((float) Math.max(id, id), id,
+        assertEquals(scalar_max(id, id), id,
                             "MAX(MAX_IDENTITY, MAX_IDENTITY) != MAX_IDENTITY");
 
         float x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((float) Math.max(id, x), x);
-                assertEquals((float) Math.max(x, id), x);
+                assertEquals(scalar_max(id, x), x);
+                assertEquals(scalar_max(x, id), x);
             }
         } catch (AssertionError e) {
-            assertEquals((float) Math.max(id, x), x,
+            assertEquals(scalar_max(id, x), x,
                                 "MAX(MAX_IDENTITY, " + x + ") != " + x);
-            assertEquals((float) Math.max(x, id), x,
+            assertEquals(scalar_max(x, id), x,
                                 "MAX(" + x + ", MAX_IDENTITY) != " + x);
         }
     }
@@ -2814,7 +3013,7 @@ relativeError));
         float res = MAX_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res = (float) Math.max(res, a[i]);
+                res = scalar_max(res, a[i]);
         }
 
         return res;
@@ -2823,7 +3022,7 @@ relativeError));
     static float MAXReduceAllMasked(float[] a, boolean[] mask) {
         float res = MAX_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (float) Math.max(res, MAXReduceMasked(a, i, mask));
+            res = scalar_max(res, MAXReduceMasked(a, i, mask));
         }
 
         return res;
@@ -2843,7 +3042,7 @@ relativeError));
                 FloatVector av = FloatVector.fromArray(SPECIES, a, i);
                 float v = av.reduceLanes(VectorOperators.MAX, vmask);
                 r[i] = v;
-                ra = (float) Math.max(ra, v);
+                ra = scalar_max(ra, v);
             }
         }
 
@@ -3055,7 +3254,7 @@ relativeError));
     }
 
     static boolean testIS_FINITE(float a) {
-        return Float.isFinite(a);
+        return isFinite(a);
     }
 
     @Test(dataProvider = "floatTestOpProvider")
@@ -3096,7 +3295,7 @@ relativeError));
     }
 
     static boolean testIS_NAN(float a) {
-        return Float.isNaN(a);
+        return isNaN(a);
     }
 
     @Test(dataProvider = "floatTestOpProvider")
@@ -3137,7 +3336,7 @@ relativeError));
     }
 
     static boolean testIS_INFINITE(float a) {
-        return Float.isInfinite(a);
+        return isInfinite(a);
     }
 
     @Test(dataProvider = "floatTestOpProvider")
@@ -3478,7 +3677,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] < b[i]);
+                assertEquals(mv.laneIsSet(j), lt(a[i + j], b[i]));
             }
         }
     }
@@ -3498,7 +3697,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] < b[i]));
+                assertEquals(mv.laneIsSet(j), mask[j] && (lt(a[i + j], b[i])));
             }
         }
     }
@@ -3514,7 +3713,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] < (float)((long)b[i]));
+                assertEquals(mv.laneIsSet(j), lt(a[i + j], (float)((long)b[i])));
             }
         }
     }
@@ -3534,7 +3733,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] < (float)((long)b[i])));
+                assertEquals(mv.laneIsSet(j), mask[j] && (lt(a[i + j], (float)((long)b[i]))));
             }
         }
     }
@@ -3550,7 +3749,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] == b[i]);
+                assertEquals(mv.laneIsSet(j), eq(a[i + j], b[i]));
             }
         }
     }
@@ -3570,7 +3769,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] == b[i]));
+                assertEquals(mv.laneIsSet(j), mask[j] && (eq(a[i + j], b[i])));
             }
         }
     }
@@ -3586,7 +3785,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] == (float)((long)b[i]));
+                assertEquals(mv.laneIsSet(j), eq(a[i + j], (float)((long)b[i])));
             }
         }
     }
@@ -3606,7 +3805,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] == (float)((long)b[i])));
+                assertEquals(mv.laneIsSet(j), mask[j] && (eq(a[i + j], (float)((long)b[i]))));
             }
         }
     }
@@ -4106,11 +4305,11 @@ relativeError));
     }
 
     static float SIN(float a) {
-        return (float)(Math.sin((double)a));
+        return (float)(scalar_sin(a));
     }
 
     static float strictSIN(float a) {
-        return (float)(StrictMath.sin((double)a));
+        return (float)(strict_scalar_sin(a));
     }
 
     @Test(dataProvider = "floatUnaryOpProvider")
@@ -4129,11 +4328,11 @@ relativeError));
     }
 
     static float EXP(float a) {
-        return (float)(Math.exp((double)a));
+        return (float)(scalar_exp(a));
     }
 
     static float strictEXP(float a) {
-        return (float)(StrictMath.exp((double)a));
+        return (float)(strict_scalar_exp(a));
     }
 
     @Test(dataProvider = "floatUnaryOpProvider")
@@ -4152,11 +4351,11 @@ relativeError));
     }
 
     static float LOG1P(float a) {
-        return (float)(Math.log1p((double)a));
+        return (float)(scalar_log1p(a));
     }
 
     static float strictLOG1P(float a) {
-        return (float)(StrictMath.log1p((double)a));
+        return (float)(strict_scalar_log1p(a));
     }
 
     @Test(dataProvider = "floatUnaryOpProvider")
@@ -4175,11 +4374,11 @@ relativeError));
     }
 
     static float LOG(float a) {
-        return (float)(Math.log((double)a));
+        return (float)(scalar_log(a));
     }
 
     static float strictLOG(float a) {
-        return (float)(StrictMath.log((double)a));
+        return (float)(strict_scalar_log(a));
     }
 
     @Test(dataProvider = "floatUnaryOpProvider")
@@ -4198,11 +4397,11 @@ relativeError));
     }
 
     static float LOG10(float a) {
-        return (float)(Math.log10((double)a));
+        return (float)(scalar_log10(a));
     }
 
     static float strictLOG10(float a) {
-        return (float)(StrictMath.log10((double)a));
+        return (float)(strict_scalar_log10(a));
     }
 
     @Test(dataProvider = "floatUnaryOpProvider")
@@ -4221,11 +4420,11 @@ relativeError));
     }
 
     static float EXPM1(float a) {
-        return (float)(Math.expm1((double)a));
+        return (float)(scalar_expm1(a));
     }
 
     static float strictEXPM1(float a) {
-        return (float)(StrictMath.expm1((double)a));
+        return (float)(strict_scalar_expm1(a));
     }
 
     @Test(dataProvider = "floatUnaryOpProvider")
@@ -4244,11 +4443,11 @@ relativeError));
     }
 
     static float COS(float a) {
-        return (float)(Math.cos((double)a));
+        return (float)(scalar_cos(a));
     }
 
     static float strictCOS(float a) {
-        return (float)(StrictMath.cos((double)a));
+        return (float)(strict_scalar_cos(a));
     }
 
     @Test(dataProvider = "floatUnaryOpProvider")
@@ -4267,11 +4466,11 @@ relativeError));
     }
 
     static float TAN(float a) {
-        return (float)(Math.tan((double)a));
+        return (float)(scalar_tan(a));
     }
 
     static float strictTAN(float a) {
-        return (float)(StrictMath.tan((double)a));
+        return (float)(strict_scalar_tan(a));
     }
 
     @Test(dataProvider = "floatUnaryOpProvider")
@@ -4290,11 +4489,11 @@ relativeError));
     }
 
     static float SINH(float a) {
-        return (float)(Math.sinh((double)a));
+        return (float)(scalar_sinh(a));
     }
 
     static float strictSINH(float a) {
-        return (float)(StrictMath.sinh((double)a));
+        return (float)(strict_scalar_sinh(a));
     }
 
     @Test(dataProvider = "floatUnaryOpProvider")
@@ -4313,11 +4512,11 @@ relativeError));
     }
 
     static float COSH(float a) {
-        return (float)(Math.cosh((double)a));
+        return (float)(scalar_cosh(a));
     }
 
     static float strictCOSH(float a) {
-        return (float)(StrictMath.cosh((double)a));
+        return (float)(strict_scalar_cosh(a));
     }
 
     @Test(dataProvider = "floatUnaryOpProvider")
@@ -4336,11 +4535,11 @@ relativeError));
     }
 
     static float TANH(float a) {
-        return (float)(Math.tanh((double)a));
+        return (float)(scalar_tanh(a));
     }
 
     static float strictTANH(float a) {
-        return (float)(StrictMath.tanh((double)a));
+        return (float)(strict_scalar_tanh(a));
     }
 
     @Test(dataProvider = "floatUnaryOpProvider")
@@ -4359,11 +4558,11 @@ relativeError));
     }
 
     static float ASIN(float a) {
-        return (float)(Math.asin((double)a));
+        return (float)(scalar_asin(a));
     }
 
     static float strictASIN(float a) {
-        return (float)(StrictMath.asin((double)a));
+        return (float)(strict_scalar_asin(a));
     }
 
     @Test(dataProvider = "floatUnaryOpProvider")
@@ -4382,11 +4581,11 @@ relativeError));
     }
 
     static float ACOS(float a) {
-        return (float)(Math.acos((double)a));
+        return (float)(scalar_acos(a));
     }
 
     static float strictACOS(float a) {
-        return (float)(StrictMath.acos((double)a));
+        return (float)(strict_scalar_acos(a));
     }
 
     @Test(dataProvider = "floatUnaryOpProvider")
@@ -4405,11 +4604,11 @@ relativeError));
     }
 
     static float ATAN(float a) {
-        return (float)(Math.atan((double)a));
+        return (float)(scalar_atan(a));
     }
 
     static float strictATAN(float a) {
-        return (float)(StrictMath.atan((double)a));
+        return (float)(strict_scalar_atan(a));
     }
 
     @Test(dataProvider = "floatUnaryOpProvider")
@@ -4428,11 +4627,11 @@ relativeError));
     }
 
     static float CBRT(float a) {
-        return (float)(Math.cbrt((double)a));
+        return (float)(scalar_cbrt(a));
     }
 
     static float strictCBRT(float a) {
-        return (float)(StrictMath.cbrt((double)a));
+        return (float)(strict_scalar_cbrt(a));
     }
 
     @Test(dataProvider = "floatUnaryOpProvider")
@@ -4451,11 +4650,11 @@ relativeError));
     }
 
     static float HYPOT(float a, float b) {
-        return (float)(Math.hypot((double)a, (double)b));
+        return (float)(scalar_hypot(a, b));
     }
 
     static float strictHYPOT(float a, float b) {
-        return (float)(StrictMath.hypot((double)a, (double)b));
+        return (float)(strict_scalar_hypot(a, b));
     }
 
     @Test(dataProvider = "floatBinaryOpProvider")
@@ -4477,11 +4676,11 @@ relativeError));
 
 
     static float POW(float a, float b) {
-        return (float)(Math.pow((double)a, (double)b));
+        return (float)(scalar_pow(a, b));
     }
 
     static float strictPOW(float a, float b) {
-        return (float)(StrictMath.pow((double)a, (double)b));
+        return (float)(strict_scalar_pow(a, b));
     }
 
     @Test(dataProvider = "floatBinaryOpProvider")
@@ -4503,11 +4702,11 @@ relativeError));
 
 
     static float pow(float a, float b) {
-        return (float)(Math.pow((double)a, (double)b));
+        return (float)(scalar_pow(a, b));
     }
 
     static float strictpow(float a, float b) {
-        return (float)(StrictMath.pow((double)a, (double)b));
+        return (float)(strict_scalar_pow(a, b));
     }
 
     @Test(dataProvider = "floatBinaryOpProvider")
@@ -4529,11 +4728,11 @@ relativeError));
 
 
     static float ATAN2(float a, float b) {
-        return (float)(Math.atan2((double)a, (double)b));
+        return (float)(scalar_atan2(a, b));
     }
 
     static float strictATAN2(float a, float b) {
-        return (float)(StrictMath.atan2((double)a, (double)b));
+        return (float)(strict_scalar_atan2(a, b));
     }
 
     @Test(dataProvider = "floatBinaryOpProvider")
@@ -4585,11 +4784,11 @@ relativeError));
 
 
     static float FMA(float a, float b, float c) {
-        return (float)(Math.fma(a, b, c));
+        return (float)(scalar_fma(a, b, c));
     }
 
     static float fma(float a, float b, float c) {
-        return (float)(Math.fma(a, b, c));
+        return (float)(scalar_fma(a, b, c));
     }
 
     @Test(dataProvider = "floatTernaryOpProvider")
@@ -4767,11 +4966,11 @@ relativeError));
     }
 
     static float NEG(float a) {
-        return (float)(-((float)a));
+        return (float)(scalar_neg((float)a));
     }
 
     static float neg(float a) {
-        return (float)(-((float)a));
+        return (float)(scalar_neg((float)a));
     }
 
     @Test(dataProvider = "floatUnaryOpProvider")
@@ -4823,11 +5022,11 @@ relativeError));
     }
 
     static float ABS(float a) {
-        return (float)(Math.abs((float)a));
+        return (float)(scalar_abs((float)a));
     }
 
     static float abs(float a) {
-        return (float)(Math.abs((float)a));
+        return (float)(scalar_abs((float)a));
     }
 
     @Test(dataProvider = "floatUnaryOpProvider")
@@ -4879,11 +5078,11 @@ relativeError));
     }
 
     static float SQRT(float a) {
-        return (float)(Math.sqrt((double)a));
+        return (float)(scalar_sqrt(a));
     }
 
     static float sqrt(float a) {
-        return (float)(Math.sqrt((double)a));
+        return (float)(scalar_sqrt(a));
     }
 
     @Test(dataProvider = "floatUnaryOpProvider")
@@ -5096,7 +5295,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] < b[i]);
+                assertEquals(mv.laneIsSet(j), lt(a[i + j], b[i]));
             }
         }
     }
@@ -5112,7 +5311,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] == b[i]);
+                assertEquals(mv.laneIsSet(j), eq(a[i + j], b[i]));
             }
         }
     }
@@ -5181,7 +5380,7 @@ relativeError));
     static long ADDReduceLong(float[] a, int idx) {
         float res = 0;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res += a[i];
+            res = scalar_add(res, a[i]);
         }
 
         return (long)res;
@@ -5190,7 +5389,7 @@ relativeError));
     static long ADDReduceAllLong(float[] a) {
         long res = 0;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduceLong(a, i);
+            res = (long)scalar_add((float)res, (float)ADDReduceLong(a, i));
         }
 
         return res;
@@ -5208,8 +5407,8 @@ relativeError));
         }
 
         ra = 0;
-        for (int i = 0; i < a.length; i ++) {
-            ra += r[i];
+        for (int i = 0; i < a.length; i++) {
+            ra = (long)scalar_add((float)ra, (float)r[i]);
         }
 
         assertReductionLongArraysEquals(r, ra, a,
@@ -5219,8 +5418,9 @@ relativeError));
     static long ADDReduceLongMasked(float[] a, int idx, boolean[] mask) {
         float res = 0;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            if(mask[i % SPECIES.length()])
-                res += a[i];
+            if (mask[i % SPECIES.length()]) {
+                res = scalar_add(res, a[i]);
+            }
         }
 
         return (long)res;
@@ -5229,7 +5429,7 @@ relativeError));
     static long ADDReduceAllLongMasked(float[] a, boolean[] mask) {
         long res = 0;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduceLongMasked(a, i, mask);
+            res = (long)scalar_add((float)res, (float)ADDReduceLongMasked(a, i, mask));
         }
 
         return res;
@@ -5249,8 +5449,8 @@ relativeError));
         }
 
         ra = 0;
-        for (int i = 0; i < a.length; i ++) {
-            ra += r[i];
+        for (int i = 0; i < a.length; i++) {
+            ra = (long)scalar_add((float)ra, (float)r[i]);
         }
 
         assertReductionLongArraysEqualsMasked(r, ra, a, mask,
diff --git a/test/jdk/jdk/incubator/vector/FloatVector256Tests.java b/test/jdk/jdk/incubator/vector/FloatVector256Tests.java
index b7d16ecc7f7..5315b69a5b6 100644
--- a/test/jdk/jdk/incubator/vector/FloatVector256Tests.java
+++ b/test/jdk/jdk/incubator/vector/FloatVector256Tests.java
@@ -1601,6 +1601,205 @@ relativeError));
         return Float.compare(a, (float) 0) != 0 ? a : b;
     }
 
+
+    static float scalar_add(float a, float b) {
+        return (float)(a + b);
+    }
+
+    static float scalar_sub(float a, float b) {
+        return (float)(a - b);
+    }
+
+    static float scalar_mul(float a, float b) {
+        return (float)(a * b);
+    }
+
+    static float scalar_min(float a, float b) {
+        return (float)(Math.min(a, b));
+    }
+
+    static float scalar_max(float a, float b) {
+        return (float)(Math.max(a, b));
+    }
+
+    static float scalar_div(float a, float b) {
+        return (float)(a / b);
+    }
+
+    static float scalar_fma(float a, float b, float c) {
+        return (float)(Math.fma(a, b, c));
+    }
+
+    static float scalar_abs(float a) {
+        return (float)(Math.abs(a));
+    }
+
+    static float scalar_neg(float a) {
+        return ((float)-a);
+    }
+
+    static float scalar_sin(float a) {
+        return (float)Math.sin((double)a);
+    }
+
+    static float scalar_exp(float a) {
+        return (float)Math.exp((double)a);
+    }
+
+    static float scalar_log1p(float a) {
+        return (float)Math.log1p((double)a);
+    }
+
+    static float scalar_log(float a) {
+        return (float)Math.log((double)a);
+    }
+
+    static float scalar_log10(float a) {
+        return (float)Math.log10((double)a);
+    }
+
+    static float scalar_expm1(float a) {
+        return (float)Math.expm1((double)a);
+    }
+
+    static float scalar_cos(float a) {
+        return (float)Math.cos((double)a);
+    }
+
+    static float scalar_tan(float a) {
+        return (float)Math.tan((double)a);
+    }
+
+    static float scalar_sinh(float a) {
+        return (float)Math.sinh((double)a);
+    }
+
+    static float scalar_cosh(float a) {
+        return (float)Math.cosh((double)a);
+    }
+
+    static float scalar_tanh(float a) {
+        return (float)Math.tanh((double)a);
+    }
+
+    static float scalar_asin(float a) {
+        return (float)Math.asin((double)a);
+    }
+
+    static float scalar_acos(float a) {
+        return (float)Math.acos((double)a);
+    }
+
+    static float scalar_atan(float a) {
+        return (float)Math.atan((double)a);
+    }
+
+    static float scalar_cbrt(float a) {
+        return (float)Math.cbrt((double)a);
+    }
+
+    static float scalar_sqrt(float a) {
+        return (float)Math.sqrt((double)a);
+    }
+
+    static float scalar_hypot(float a, float b) {
+        return (float)Math.hypot((double)a, (double)b);
+    }
+
+    static float scalar_pow(float a, float b) {
+        return (float)Math.pow((double)a, (double)b);
+    }
+
+    static float scalar_atan2(float a, float b) {
+        return (float)Math.atan2((double)a, (double)b);
+    }
+
+    static float strict_scalar_sin(float a) {
+        return (float)StrictMath.sin((double)a);
+    }
+
+    static float strict_scalar_exp(float a) {
+        return (float)StrictMath.exp((double)a);
+    }
+
+    static float strict_scalar_log1p(float a) {
+        return (float)StrictMath.log1p((double)a);
+    }
+
+    static float strict_scalar_log(float a) {
+        return (float)StrictMath.log((double)a);
+    }
+
+    static float strict_scalar_log10(float a) {
+        return (float)StrictMath.log10((double)a);
+    }
+
+    static float strict_scalar_expm1(float a) {
+        return (float)StrictMath.expm1((double)a);
+    }
+
+    static float strict_scalar_cos(float a) {
+        return (float)StrictMath.cos((double)a);
+    }
+
+    static float strict_scalar_tan(float a) {
+        return (float)StrictMath.tan((double)a);
+    }
+
+    static float strict_scalar_sinh(float a) {
+        return (float)StrictMath.sinh((double)a);
+    }
+
+    static float strict_scalar_cosh(float a) {
+        return (float)StrictMath.cosh((double)a);
+    }
+
+    static float strict_scalar_tanh(float a) {
+        return (float)StrictMath.tanh((double)a);
+    }
+
+    static float strict_scalar_asin(float a) {
+        return (float)StrictMath.asin((double)a);
+    }
+
+    static float strict_scalar_acos(float a) {
+        return (float)StrictMath.acos((double)a);
+    }
+
+    static float strict_scalar_atan(float a) {
+        return (float)StrictMath.atan((double)a);
+    }
+
+    static float strict_scalar_cbrt(float a) {
+        return (float)StrictMath.cbrt((double)a);
+    }
+
+    static float strict_scalar_sqrt(float a) {
+        return (float)StrictMath.sqrt((double)a);
+    }
+
+    static float strict_scalar_hypot(float a, float b) {
+        return (float)StrictMath.hypot((double)a, (double)b);
+    }
+
+    static float strict_scalar_pow(float a, float b) {
+        return (float)StrictMath.pow((double)a, (double)b);
+    }
+
+    static float strict_scalar_atan2(float a, float b) {
+        return (float)StrictMath.atan2((double)a, (double)b);
+    }
+
+    static boolean isNaN(float a) {
+        return Float.isNaN(a);
+    }
+    static boolean isFinite(float a) {
+        return Float.isFinite(a);
+    }
+    static boolean isInfinite(float a) {
+        return Float.isInfinite(a);
+    }
+
     @Test
     static void smokeTest1() {
         FloatVector three = FloatVector.broadcast(SPECIES, (byte)-3);
@@ -1694,7 +1893,7 @@ relativeError));
     }
 
     static float ADD(float a, float b) {
-        return (float)(a + b);
+        return (float)(scalar_add(a, b));
     }
 
     @Test(dataProvider = "floatBinaryOpProvider")
@@ -1715,7 +1914,7 @@ relativeError));
     }
 
     static float add(float a, float b) {
-        return (float)(a + b);
+        return (float)(scalar_add(a, b));
     }
 
     @Test(dataProvider = "floatBinaryOpProvider")
@@ -1772,7 +1971,7 @@ relativeError));
     }
 
     static float SUB(float a, float b) {
-        return (float)(a - b);
+        return (float)(scalar_sub(a, b));
     }
 
     @Test(dataProvider = "floatBinaryOpProvider")
@@ -1793,7 +1992,7 @@ relativeError));
     }
 
     static float sub(float a, float b) {
-        return (float)(a - b);
+        return (float)(scalar_sub(a, b));
     }
 
     @Test(dataProvider = "floatBinaryOpProvider")
@@ -1850,7 +2049,7 @@ relativeError));
     }
 
     static float MUL(float a, float b) {
-        return (float)(a * b);
+        return (float)(scalar_mul(a, b));
     }
 
     @Test(dataProvider = "floatBinaryOpProvider")
@@ -1871,7 +2070,7 @@ relativeError));
     }
 
     static float mul(float a, float b) {
-        return (float)(a * b);
+        return (float)(scalar_mul(a, b));
     }
 
     @Test(dataProvider = "floatBinaryOpProvider")
@@ -1928,7 +2127,7 @@ relativeError));
     }
 
     static float DIV(float a, float b) {
-        return (float)(a / b);
+        return (float)(scalar_div(a, b));
     }
 
     @Test(dataProvider = "floatBinaryOpProvider")
@@ -1949,7 +2148,7 @@ relativeError));
     }
 
     static float div(float a, float b) {
-        return (float)(a / b);
+        return (float)(scalar_div(a, b));
     }
 
     @Test(dataProvider = "floatBinaryOpProvider")
@@ -2006,7 +2205,7 @@ relativeError));
     }
 
     static float FIRST_NONZERO(float a, float b) {
-        return (float)(Double.doubleToLongBits(a)!=0?a:b);
+        return (float)(firstNonZero(a, b));
     }
 
     @Test(dataProvider = "floatBinaryOpProvider")
@@ -2308,7 +2507,7 @@ relativeError));
     }
 
     static float MIN(float a, float b) {
-        return (float)(Math.min(a, b));
+        return (float)(scalar_min(a, b));
     }
 
     @Test(dataProvider = "floatBinaryOpProvider")
@@ -2329,7 +2528,7 @@ relativeError));
     }
 
     static float min(float a, float b) {
-        return (float)(Math.min(a, b));
+        return (float)(scalar_min(a, b));
     }
 
     @Test(dataProvider = "floatBinaryOpProvider")
@@ -2348,7 +2547,7 @@ relativeError));
     }
 
     static float MAX(float a, float b) {
-        return (float)(Math.max(a, b));
+        return (float)(scalar_max(a, b));
     }
 
     @Test(dataProvider = "floatBinaryOpProvider")
@@ -2369,7 +2568,7 @@ relativeError));
     }
 
     static float max(float a, float b) {
-        return (float)(Math.max(a, b));
+        return (float)(scalar_max(a, b));
     }
 
     @Test(dataProvider = "floatBinaryOpProvider")
@@ -2446,7 +2645,7 @@ relativeError));
     static float ADDReduce(float[] a, int idx) {
         float res = ADD_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res += a[i];
+            res = scalar_add(res, a[i]);
         }
 
         return res;
@@ -2455,7 +2654,7 @@ relativeError));
     static float ADDReduceAll(float[] a) {
         float res = ADD_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduce(a, i);
+            res = scalar_add(res, ADDReduce(a, i));
         }
 
         return res;
@@ -2473,7 +2672,7 @@ relativeError));
                 FloatVector av = FloatVector.fromArray(SPECIES, a, i);
                 float v = av.reduceLanes(VectorOperators.ADD);
                 r[i] = v;
-                ra += v;
+                ra = scalar_add(ra, v);
             }
         }
 
@@ -2486,20 +2685,20 @@ relativeError));
         float[] a = fa.apply(SPECIES.length());
         float id = ADD_IDENTITY;
 
-        assertEquals((float) (id + id), id,
+        assertEquals((float) (scalar_add(id, id)), id,
                             "ADD(ADD_IDENTITY, ADD_IDENTITY) != ADD_IDENTITY");
 
         float x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((float) (id + x), x);
-                assertEquals((float) (x + id), x);
+                assertEquals((float) (scalar_add(id, x)), x);
+                assertEquals((float) (scalar_add(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((float) (id + x), x,
+            assertEquals((float) (scalar_add(id, x)), x,
                                 "ADD(ADD_IDENTITY, " + x + ") != " + x);
-            assertEquals((float) (x + id), x,
+            assertEquals((float) (scalar_add(x, id)), x,
                                 "ADD(" + x + ", ADD_IDENTITY) != " + x);
         }
     }
@@ -2508,7 +2707,7 @@ relativeError));
         float res = ADD_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res += a[i];
+                res = scalar_add(res, a[i]);
         }
 
         return res;
@@ -2517,7 +2716,7 @@ relativeError));
     static float ADDReduceAllMasked(float[] a, boolean[] mask) {
         float res = ADD_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduceMasked(a, i, mask);
+            res = scalar_add(res, ADDReduceMasked(a, i, mask));
         }
 
         return res;
@@ -2537,7 +2736,7 @@ relativeError));
                 FloatVector av = FloatVector.fromArray(SPECIES, a, i);
                 float v = av.reduceLanes(VectorOperators.ADD, vmask);
                 r[i] = v;
-                ra += v;
+                ra = scalar_add(ra, v);
             }
         }
 
@@ -2548,7 +2747,7 @@ relativeError));
     static float MULReduce(float[] a, int idx) {
         float res = MUL_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res *= a[i];
+            res = scalar_mul(res, a[i]);
         }
 
         return res;
@@ -2557,7 +2756,7 @@ relativeError));
     static float MULReduceAll(float[] a) {
         float res = MUL_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res *= MULReduce(a, i);
+            res = scalar_mul(res, MULReduce(a, i));
         }
 
         return res;
@@ -2575,7 +2774,7 @@ relativeError));
                 FloatVector av = FloatVector.fromArray(SPECIES, a, i);
                 float v = av.reduceLanes(VectorOperators.MUL);
                 r[i] = v;
-                ra *= v;
+                ra = scalar_mul(ra, v);
             }
         }
 
@@ -2588,20 +2787,20 @@ relativeError));
         float[] a = fa.apply(SPECIES.length());
         float id = MUL_IDENTITY;
 
-        assertEquals((float) (id * id), id,
+        assertEquals((float) (scalar_mul(id, id)), id,
                             "MUL(MUL_IDENTITY, MUL_IDENTITY) != MUL_IDENTITY");
 
         float x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((float) (id * x), x);
-                assertEquals((float) (x * id), x);
+                assertEquals((float) (scalar_mul(id, x)), x);
+                assertEquals((float) (scalar_mul(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((float) (id * x), x,
+            assertEquals((float) (scalar_mul(id, x)), x,
                                 "MUL(MUL_IDENTITY, " + x + ") != " + x);
-            assertEquals((float) (x * id), x,
+            assertEquals((float) (scalar_mul(x, id)), x,
                                 "MUL(" + x + ", MUL_IDENTITY) != " + x);
         }
     }
@@ -2610,7 +2809,7 @@ relativeError));
         float res = MUL_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res *= a[i];
+                res = scalar_mul(res, a[i]);
         }
 
         return res;
@@ -2619,7 +2818,7 @@ relativeError));
     static float MULReduceAllMasked(float[] a, boolean[] mask) {
         float res = MUL_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res *= MULReduceMasked(a, i, mask);
+            res = scalar_mul(res, MULReduceMasked(a, i, mask));
         }
 
         return res;
@@ -2639,7 +2838,7 @@ relativeError));
                 FloatVector av = FloatVector.fromArray(SPECIES, a, i);
                 float v = av.reduceLanes(VectorOperators.MUL, vmask);
                 r[i] = v;
-                ra *= v;
+                ra = scalar_mul(ra, v);
             }
         }
 
@@ -2650,7 +2849,7 @@ relativeError));
     static float MINReduce(float[] a, int idx) {
         float res = MIN_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res = (float) Math.min(res, a[i]);
+            res = scalar_min(res, a[i]);
         }
 
         return res;
@@ -2659,7 +2858,7 @@ relativeError));
     static float MINReduceAll(float[] a) {
         float res = MIN_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (float) Math.min(res, MINReduce(a, i));
+            res = scalar_min(res, MINReduce(a, i));
         }
 
         return res;
@@ -2677,7 +2876,7 @@ relativeError));
                 FloatVector av = FloatVector.fromArray(SPECIES, a, i);
                 float v = av.reduceLanes(VectorOperators.MIN);
                 r[i] = v;
-                ra = (float) Math.min(ra, v);
+                ra = scalar_min(ra, v);
             }
         }
 
@@ -2690,20 +2889,20 @@ relativeError));
         float[] a = fa.apply(SPECIES.length());
         float id = MIN_IDENTITY;
 
-        assertEquals((float) Math.min(id, id), id,
+        assertEquals(scalar_min(id, id), id,
                             "MIN(MIN_IDENTITY, MIN_IDENTITY) != MIN_IDENTITY");
 
         float x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((float) Math.min(id, x), x);
-                assertEquals((float) Math.min(x, id), x);
+                assertEquals(scalar_min(id, x), x);
+                assertEquals(scalar_min(x, id), x);
             }
         } catch (AssertionError e) {
-            assertEquals((float) Math.min(id, x), x,
+            assertEquals(scalar_min(id, x), x,
                                 "MIN(MIN_IDENTITY, " + x + ") != " + x);
-            assertEquals((float) Math.min(x, id), x,
+            assertEquals(scalar_min(x, id), x,
                                 "MIN(" + x + ", MIN_IDENTITY) != " + x);
         }
     }
@@ -2712,7 +2911,7 @@ relativeError));
         float res = MIN_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res = (float) Math.min(res, a[i]);
+                res = scalar_min(res, a[i]);
         }
 
         return res;
@@ -2721,7 +2920,7 @@ relativeError));
     static float MINReduceAllMasked(float[] a, boolean[] mask) {
         float res = MIN_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (float) Math.min(res, MINReduceMasked(a, i, mask));
+            res = scalar_min(res, MINReduceMasked(a, i, mask));
         }
 
         return res;
@@ -2741,7 +2940,7 @@ relativeError));
                 FloatVector av = FloatVector.fromArray(SPECIES, a, i);
                 float v = av.reduceLanes(VectorOperators.MIN, vmask);
                 r[i] = v;
-                ra = (float) Math.min(ra, v);
+                ra = scalar_min(ra, v);
             }
         }
 
@@ -2752,7 +2951,7 @@ relativeError));
     static float MAXReduce(float[] a, int idx) {
         float res = MAX_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res = (float) Math.max(res, a[i]);
+            res = scalar_max(res, a[i]);
         }
 
         return res;
@@ -2761,7 +2960,7 @@ relativeError));
     static float MAXReduceAll(float[] a) {
         float res = MAX_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (float) Math.max(res, MAXReduce(a, i));
+            res = scalar_max(res, MAXReduce(a, i));
         }
 
         return res;
@@ -2779,7 +2978,7 @@ relativeError));
                 FloatVector av = FloatVector.fromArray(SPECIES, a, i);
                 float v = av.reduceLanes(VectorOperators.MAX);
                 r[i] = v;
-                ra = (float) Math.max(ra, v);
+                ra = scalar_max(ra, v);
             }
         }
 
@@ -2792,20 +2991,20 @@ relativeError));
         float[] a = fa.apply(SPECIES.length());
         float id = MAX_IDENTITY;
 
-        assertEquals((float) Math.max(id, id), id,
+        assertEquals(scalar_max(id, id), id,
                             "MAX(MAX_IDENTITY, MAX_IDENTITY) != MAX_IDENTITY");
 
         float x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((float) Math.max(id, x), x);
-                assertEquals((float) Math.max(x, id), x);
+                assertEquals(scalar_max(id, x), x);
+                assertEquals(scalar_max(x, id), x);
             }
         } catch (AssertionError e) {
-            assertEquals((float) Math.max(id, x), x,
+            assertEquals(scalar_max(id, x), x,
                                 "MAX(MAX_IDENTITY, " + x + ") != " + x);
-            assertEquals((float) Math.max(x, id), x,
+            assertEquals(scalar_max(x, id), x,
                                 "MAX(" + x + ", MAX_IDENTITY) != " + x);
         }
     }
@@ -2814,7 +3013,7 @@ relativeError));
         float res = MAX_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res = (float) Math.max(res, a[i]);
+                res = scalar_max(res, a[i]);
         }
 
         return res;
@@ -2823,7 +3022,7 @@ relativeError));
     static float MAXReduceAllMasked(float[] a, boolean[] mask) {
         float res = MAX_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (float) Math.max(res, MAXReduceMasked(a, i, mask));
+            res = scalar_max(res, MAXReduceMasked(a, i, mask));
         }
 
         return res;
@@ -2843,7 +3042,7 @@ relativeError));
                 FloatVector av = FloatVector.fromArray(SPECIES, a, i);
                 float v = av.reduceLanes(VectorOperators.MAX, vmask);
                 r[i] = v;
-                ra = (float) Math.max(ra, v);
+                ra = scalar_max(ra, v);
             }
         }
 
@@ -3055,7 +3254,7 @@ relativeError));
     }
 
     static boolean testIS_FINITE(float a) {
-        return Float.isFinite(a);
+        return isFinite(a);
     }
 
     @Test(dataProvider = "floatTestOpProvider")
@@ -3096,7 +3295,7 @@ relativeError));
     }
 
     static boolean testIS_NAN(float a) {
-        return Float.isNaN(a);
+        return isNaN(a);
     }
 
     @Test(dataProvider = "floatTestOpProvider")
@@ -3137,7 +3336,7 @@ relativeError));
     }
 
     static boolean testIS_INFINITE(float a) {
-        return Float.isInfinite(a);
+        return isInfinite(a);
     }
 
     @Test(dataProvider = "floatTestOpProvider")
@@ -3478,7 +3677,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] < b[i]);
+                assertEquals(mv.laneIsSet(j), lt(a[i + j], b[i]));
             }
         }
     }
@@ -3498,7 +3697,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] < b[i]));
+                assertEquals(mv.laneIsSet(j), mask[j] && (lt(a[i + j], b[i])));
             }
         }
     }
@@ -3514,7 +3713,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] < (float)((long)b[i]));
+                assertEquals(mv.laneIsSet(j), lt(a[i + j], (float)((long)b[i])));
             }
         }
     }
@@ -3534,7 +3733,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] < (float)((long)b[i])));
+                assertEquals(mv.laneIsSet(j), mask[j] && (lt(a[i + j], (float)((long)b[i]))));
             }
         }
     }
@@ -3550,7 +3749,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] == b[i]);
+                assertEquals(mv.laneIsSet(j), eq(a[i + j], b[i]));
             }
         }
     }
@@ -3570,7 +3769,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] == b[i]));
+                assertEquals(mv.laneIsSet(j), mask[j] && (eq(a[i + j], b[i])));
             }
         }
     }
@@ -3586,7 +3785,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] == (float)((long)b[i]));
+                assertEquals(mv.laneIsSet(j), eq(a[i + j], (float)((long)b[i])));
             }
         }
     }
@@ -3606,7 +3805,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] == (float)((long)b[i])));
+                assertEquals(mv.laneIsSet(j), mask[j] && (eq(a[i + j], (float)((long)b[i]))));
             }
         }
     }
@@ -4106,11 +4305,11 @@ relativeError));
     }
 
     static float SIN(float a) {
-        return (float)(Math.sin((double)a));
+        return (float)(scalar_sin(a));
     }
 
     static float strictSIN(float a) {
-        return (float)(StrictMath.sin((double)a));
+        return (float)(strict_scalar_sin(a));
     }
 
     @Test(dataProvider = "floatUnaryOpProvider")
@@ -4129,11 +4328,11 @@ relativeError));
     }
 
     static float EXP(float a) {
-        return (float)(Math.exp((double)a));
+        return (float)(scalar_exp(a));
     }
 
     static float strictEXP(float a) {
-        return (float)(StrictMath.exp((double)a));
+        return (float)(strict_scalar_exp(a));
     }
 
     @Test(dataProvider = "floatUnaryOpProvider")
@@ -4152,11 +4351,11 @@ relativeError));
     }
 
     static float LOG1P(float a) {
-        return (float)(Math.log1p((double)a));
+        return (float)(scalar_log1p(a));
     }
 
     static float strictLOG1P(float a) {
-        return (float)(StrictMath.log1p((double)a));
+        return (float)(strict_scalar_log1p(a));
     }
 
     @Test(dataProvider = "floatUnaryOpProvider")
@@ -4175,11 +4374,11 @@ relativeError));
     }
 
     static float LOG(float a) {
-        return (float)(Math.log((double)a));
+        return (float)(scalar_log(a));
     }
 
     static float strictLOG(float a) {
-        return (float)(StrictMath.log((double)a));
+        return (float)(strict_scalar_log(a));
     }
 
     @Test(dataProvider = "floatUnaryOpProvider")
@@ -4198,11 +4397,11 @@ relativeError));
     }
 
     static float LOG10(float a) {
-        return (float)(Math.log10((double)a));
+        return (float)(scalar_log10(a));
     }
 
     static float strictLOG10(float a) {
-        return (float)(StrictMath.log10((double)a));
+        return (float)(strict_scalar_log10(a));
     }
 
     @Test(dataProvider = "floatUnaryOpProvider")
@@ -4221,11 +4420,11 @@ relativeError));
     }
 
     static float EXPM1(float a) {
-        return (float)(Math.expm1((double)a));
+        return (float)(scalar_expm1(a));
     }
 
     static float strictEXPM1(float a) {
-        return (float)(StrictMath.expm1((double)a));
+        return (float)(strict_scalar_expm1(a));
     }
 
     @Test(dataProvider = "floatUnaryOpProvider")
@@ -4244,11 +4443,11 @@ relativeError));
     }
 
     static float COS(float a) {
-        return (float)(Math.cos((double)a));
+        return (float)(scalar_cos(a));
     }
 
     static float strictCOS(float a) {
-        return (float)(StrictMath.cos((double)a));
+        return (float)(strict_scalar_cos(a));
     }
 
     @Test(dataProvider = "floatUnaryOpProvider")
@@ -4267,11 +4466,11 @@ relativeError));
     }
 
     static float TAN(float a) {
-        return (float)(Math.tan((double)a));
+        return (float)(scalar_tan(a));
     }
 
     static float strictTAN(float a) {
-        return (float)(StrictMath.tan((double)a));
+        return (float)(strict_scalar_tan(a));
     }
 
     @Test(dataProvider = "floatUnaryOpProvider")
@@ -4290,11 +4489,11 @@ relativeError));
     }
 
     static float SINH(float a) {
-        return (float)(Math.sinh((double)a));
+        return (float)(scalar_sinh(a));
     }
 
     static float strictSINH(float a) {
-        return (float)(StrictMath.sinh((double)a));
+        return (float)(strict_scalar_sinh(a));
     }
 
     @Test(dataProvider = "floatUnaryOpProvider")
@@ -4313,11 +4512,11 @@ relativeError));
     }
 
     static float COSH(float a) {
-        return (float)(Math.cosh((double)a));
+        return (float)(scalar_cosh(a));
     }
 
     static float strictCOSH(float a) {
-        return (float)(StrictMath.cosh((double)a));
+        return (float)(strict_scalar_cosh(a));
     }
 
     @Test(dataProvider = "floatUnaryOpProvider")
@@ -4336,11 +4535,11 @@ relativeError));
     }
 
     static float TANH(float a) {
-        return (float)(Math.tanh((double)a));
+        return (float)(scalar_tanh(a));
     }
 
     static float strictTANH(float a) {
-        return (float)(StrictMath.tanh((double)a));
+        return (float)(strict_scalar_tanh(a));
     }
 
     @Test(dataProvider = "floatUnaryOpProvider")
@@ -4359,11 +4558,11 @@ relativeError));
     }
 
     static float ASIN(float a) {
-        return (float)(Math.asin((double)a));
+        return (float)(scalar_asin(a));
     }
 
     static float strictASIN(float a) {
-        return (float)(StrictMath.asin((double)a));
+        return (float)(strict_scalar_asin(a));
     }
 
     @Test(dataProvider = "floatUnaryOpProvider")
@@ -4382,11 +4581,11 @@ relativeError));
     }
 
     static float ACOS(float a) {
-        return (float)(Math.acos((double)a));
+        return (float)(scalar_acos(a));
     }
 
     static float strictACOS(float a) {
-        return (float)(StrictMath.acos((double)a));
+        return (float)(strict_scalar_acos(a));
     }
 
     @Test(dataProvider = "floatUnaryOpProvider")
@@ -4405,11 +4604,11 @@ relativeError));
     }
 
     static float ATAN(float a) {
-        return (float)(Math.atan((double)a));
+        return (float)(scalar_atan(a));
     }
 
     static float strictATAN(float a) {
-        return (float)(StrictMath.atan((double)a));
+        return (float)(strict_scalar_atan(a));
     }
 
     @Test(dataProvider = "floatUnaryOpProvider")
@@ -4428,11 +4627,11 @@ relativeError));
     }
 
     static float CBRT(float a) {
-        return (float)(Math.cbrt((double)a));
+        return (float)(scalar_cbrt(a));
     }
 
     static float strictCBRT(float a) {
-        return (float)(StrictMath.cbrt((double)a));
+        return (float)(strict_scalar_cbrt(a));
     }
 
     @Test(dataProvider = "floatUnaryOpProvider")
@@ -4451,11 +4650,11 @@ relativeError));
     }
 
     static float HYPOT(float a, float b) {
-        return (float)(Math.hypot((double)a, (double)b));
+        return (float)(scalar_hypot(a, b));
     }
 
     static float strictHYPOT(float a, float b) {
-        return (float)(StrictMath.hypot((double)a, (double)b));
+        return (float)(strict_scalar_hypot(a, b));
     }
 
     @Test(dataProvider = "floatBinaryOpProvider")
@@ -4477,11 +4676,11 @@ relativeError));
 
 
     static float POW(float a, float b) {
-        return (float)(Math.pow((double)a, (double)b));
+        return (float)(scalar_pow(a, b));
     }
 
     static float strictPOW(float a, float b) {
-        return (float)(StrictMath.pow((double)a, (double)b));
+        return (float)(strict_scalar_pow(a, b));
     }
 
     @Test(dataProvider = "floatBinaryOpProvider")
@@ -4503,11 +4702,11 @@ relativeError));
 
 
     static float pow(float a, float b) {
-        return (float)(Math.pow((double)a, (double)b));
+        return (float)(scalar_pow(a, b));
     }
 
     static float strictpow(float a, float b) {
-        return (float)(StrictMath.pow((double)a, (double)b));
+        return (float)(strict_scalar_pow(a, b));
     }
 
     @Test(dataProvider = "floatBinaryOpProvider")
@@ -4529,11 +4728,11 @@ relativeError));
 
 
     static float ATAN2(float a, float b) {
-        return (float)(Math.atan2((double)a, (double)b));
+        return (float)(scalar_atan2(a, b));
     }
 
     static float strictATAN2(float a, float b) {
-        return (float)(StrictMath.atan2((double)a, (double)b));
+        return (float)(strict_scalar_atan2(a, b));
     }
 
     @Test(dataProvider = "floatBinaryOpProvider")
@@ -4585,11 +4784,11 @@ relativeError));
 
 
     static float FMA(float a, float b, float c) {
-        return (float)(Math.fma(a, b, c));
+        return (float)(scalar_fma(a, b, c));
     }
 
     static float fma(float a, float b, float c) {
-        return (float)(Math.fma(a, b, c));
+        return (float)(scalar_fma(a, b, c));
     }
 
     @Test(dataProvider = "floatTernaryOpProvider")
@@ -4767,11 +4966,11 @@ relativeError));
     }
 
     static float NEG(float a) {
-        return (float)(-((float)a));
+        return (float)(scalar_neg((float)a));
     }
 
     static float neg(float a) {
-        return (float)(-((float)a));
+        return (float)(scalar_neg((float)a));
     }
 
     @Test(dataProvider = "floatUnaryOpProvider")
@@ -4823,11 +5022,11 @@ relativeError));
     }
 
     static float ABS(float a) {
-        return (float)(Math.abs((float)a));
+        return (float)(scalar_abs((float)a));
     }
 
     static float abs(float a) {
-        return (float)(Math.abs((float)a));
+        return (float)(scalar_abs((float)a));
     }
 
     @Test(dataProvider = "floatUnaryOpProvider")
@@ -4879,11 +5078,11 @@ relativeError));
     }
 
     static float SQRT(float a) {
-        return (float)(Math.sqrt((double)a));
+        return (float)(scalar_sqrt(a));
     }
 
     static float sqrt(float a) {
-        return (float)(Math.sqrt((double)a));
+        return (float)(scalar_sqrt(a));
     }
 
     @Test(dataProvider = "floatUnaryOpProvider")
@@ -5096,7 +5295,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] < b[i]);
+                assertEquals(mv.laneIsSet(j), lt(a[i + j], b[i]));
             }
         }
     }
@@ -5112,7 +5311,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] == b[i]);
+                assertEquals(mv.laneIsSet(j), eq(a[i + j], b[i]));
             }
         }
     }
@@ -5181,7 +5380,7 @@ relativeError));
     static long ADDReduceLong(float[] a, int idx) {
         float res = 0;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res += a[i];
+            res = scalar_add(res, a[i]);
         }
 
         return (long)res;
@@ -5190,7 +5389,7 @@ relativeError));
     static long ADDReduceAllLong(float[] a) {
         long res = 0;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduceLong(a, i);
+            res = (long)scalar_add((float)res, (float)ADDReduceLong(a, i));
         }
 
         return res;
@@ -5208,8 +5407,8 @@ relativeError));
         }
 
         ra = 0;
-        for (int i = 0; i < a.length; i ++) {
-            ra += r[i];
+        for (int i = 0; i < a.length; i++) {
+            ra = (long)scalar_add((float)ra, (float)r[i]);
         }
 
         assertReductionLongArraysEquals(r, ra, a,
@@ -5219,8 +5418,9 @@ relativeError));
     static long ADDReduceLongMasked(float[] a, int idx, boolean[] mask) {
         float res = 0;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            if(mask[i % SPECIES.length()])
-                res += a[i];
+            if (mask[i % SPECIES.length()]) {
+                res = scalar_add(res, a[i]);
+            }
         }
 
         return (long)res;
@@ -5229,7 +5429,7 @@ relativeError));
     static long ADDReduceAllLongMasked(float[] a, boolean[] mask) {
         long res = 0;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduceLongMasked(a, i, mask);
+            res = (long)scalar_add((float)res, (float)ADDReduceLongMasked(a, i, mask));
         }
 
         return res;
@@ -5249,8 +5449,8 @@ relativeError));
         }
 
         ra = 0;
-        for (int i = 0; i < a.length; i ++) {
-            ra += r[i];
+        for (int i = 0; i < a.length; i++) {
+            ra = (long)scalar_add((float)ra, (float)r[i]);
         }
 
         assertReductionLongArraysEqualsMasked(r, ra, a, mask,
diff --git a/test/jdk/jdk/incubator/vector/FloatVector512Tests.java b/test/jdk/jdk/incubator/vector/FloatVector512Tests.java
index 17493778826..6a958511439 100644
--- a/test/jdk/jdk/incubator/vector/FloatVector512Tests.java
+++ b/test/jdk/jdk/incubator/vector/FloatVector512Tests.java
@@ -1601,6 +1601,205 @@ relativeError));
         return Float.compare(a, (float) 0) != 0 ? a : b;
     }
 
+
+    static float scalar_add(float a, float b) {
+        return (float)(a + b);
+    }
+
+    static float scalar_sub(float a, float b) {
+        return (float)(a - b);
+    }
+
+    static float scalar_mul(float a, float b) {
+        return (float)(a * b);
+    }
+
+    static float scalar_min(float a, float b) {
+        return (float)(Math.min(a, b));
+    }
+
+    static float scalar_max(float a, float b) {
+        return (float)(Math.max(a, b));
+    }
+
+    static float scalar_div(float a, float b) {
+        return (float)(a / b);
+    }
+
+    static float scalar_fma(float a, float b, float c) {
+        return (float)(Math.fma(a, b, c));
+    }
+
+    static float scalar_abs(float a) {
+        return (float)(Math.abs(a));
+    }
+
+    static float scalar_neg(float a) {
+        return ((float)-a);
+    }
+
+    static float scalar_sin(float a) {
+        return (float)Math.sin((double)a);
+    }
+
+    static float scalar_exp(float a) {
+        return (float)Math.exp((double)a);
+    }
+
+    static float scalar_log1p(float a) {
+        return (float)Math.log1p((double)a);
+    }
+
+    static float scalar_log(float a) {
+        return (float)Math.log((double)a);
+    }
+
+    static float scalar_log10(float a) {
+        return (float)Math.log10((double)a);
+    }
+
+    static float scalar_expm1(float a) {
+        return (float)Math.expm1((double)a);
+    }
+
+    static float scalar_cos(float a) {
+        return (float)Math.cos((double)a);
+    }
+
+    static float scalar_tan(float a) {
+        return (float)Math.tan((double)a);
+    }
+
+    static float scalar_sinh(float a) {
+        return (float)Math.sinh((double)a);
+    }
+
+    static float scalar_cosh(float a) {
+        return (float)Math.cosh((double)a);
+    }
+
+    static float scalar_tanh(float a) {
+        return (float)Math.tanh((double)a);
+    }
+
+    static float scalar_asin(float a) {
+        return (float)Math.asin((double)a);
+    }
+
+    static float scalar_acos(float a) {
+        return (float)Math.acos((double)a);
+    }
+
+    static float scalar_atan(float a) {
+        return (float)Math.atan((double)a);
+    }
+
+    static float scalar_cbrt(float a) {
+        return (float)Math.cbrt((double)a);
+    }
+
+    static float scalar_sqrt(float a) {
+        return (float)Math.sqrt((double)a);
+    }
+
+    static float scalar_hypot(float a, float b) {
+        return (float)Math.hypot((double)a, (double)b);
+    }
+
+    static float scalar_pow(float a, float b) {
+        return (float)Math.pow((double)a, (double)b);
+    }
+
+    static float scalar_atan2(float a, float b) {
+        return (float)Math.atan2((double)a, (double)b);
+    }
+
+    static float strict_scalar_sin(float a) {
+        return (float)StrictMath.sin((double)a);
+    }
+
+    static float strict_scalar_exp(float a) {
+        return (float)StrictMath.exp((double)a);
+    }
+
+    static float strict_scalar_log1p(float a) {
+        return (float)StrictMath.log1p((double)a);
+    }
+
+    static float strict_scalar_log(float a) {
+        return (float)StrictMath.log((double)a);
+    }
+
+    static float strict_scalar_log10(float a) {
+        return (float)StrictMath.log10((double)a);
+    }
+
+    static float strict_scalar_expm1(float a) {
+        return (float)StrictMath.expm1((double)a);
+    }
+
+    static float strict_scalar_cos(float a) {
+        return (float)StrictMath.cos((double)a);
+    }
+
+    static float strict_scalar_tan(float a) {
+        return (float)StrictMath.tan((double)a);
+    }
+
+    static float strict_scalar_sinh(float a) {
+        return (float)StrictMath.sinh((double)a);
+    }
+
+    static float strict_scalar_cosh(float a) {
+        return (float)StrictMath.cosh((double)a);
+    }
+
+    static float strict_scalar_tanh(float a) {
+        return (float)StrictMath.tanh((double)a);
+    }
+
+    static float strict_scalar_asin(float a) {
+        return (float)StrictMath.asin((double)a);
+    }
+
+    static float strict_scalar_acos(float a) {
+        return (float)StrictMath.acos((double)a);
+    }
+
+    static float strict_scalar_atan(float a) {
+        return (float)StrictMath.atan((double)a);
+    }
+
+    static float strict_scalar_cbrt(float a) {
+        return (float)StrictMath.cbrt((double)a);
+    }
+
+    static float strict_scalar_sqrt(float a) {
+        return (float)StrictMath.sqrt((double)a);
+    }
+
+    static float strict_scalar_hypot(float a, float b) {
+        return (float)StrictMath.hypot((double)a, (double)b);
+    }
+
+    static float strict_scalar_pow(float a, float b) {
+        return (float)StrictMath.pow((double)a, (double)b);
+    }
+
+    static float strict_scalar_atan2(float a, float b) {
+        return (float)StrictMath.atan2((double)a, (double)b);
+    }
+
+    static boolean isNaN(float a) {
+        return Float.isNaN(a);
+    }
+    static boolean isFinite(float a) {
+        return Float.isFinite(a);
+    }
+    static boolean isInfinite(float a) {
+        return Float.isInfinite(a);
+    }
+
     @Test
     static void smokeTest1() {
         FloatVector three = FloatVector.broadcast(SPECIES, (byte)-3);
@@ -1694,7 +1893,7 @@ relativeError));
     }
 
     static float ADD(float a, float b) {
-        return (float)(a + b);
+        return (float)(scalar_add(a, b));
     }
 
     @Test(dataProvider = "floatBinaryOpProvider")
@@ -1715,7 +1914,7 @@ relativeError));
     }
 
     static float add(float a, float b) {
-        return (float)(a + b);
+        return (float)(scalar_add(a, b));
     }
 
     @Test(dataProvider = "floatBinaryOpProvider")
@@ -1772,7 +1971,7 @@ relativeError));
     }
 
     static float SUB(float a, float b) {
-        return (float)(a - b);
+        return (float)(scalar_sub(a, b));
     }
 
     @Test(dataProvider = "floatBinaryOpProvider")
@@ -1793,7 +1992,7 @@ relativeError));
     }
 
     static float sub(float a, float b) {
-        return (float)(a - b);
+        return (float)(scalar_sub(a, b));
     }
 
     @Test(dataProvider = "floatBinaryOpProvider")
@@ -1850,7 +2049,7 @@ relativeError));
     }
 
     static float MUL(float a, float b) {
-        return (float)(a * b);
+        return (float)(scalar_mul(a, b));
     }
 
     @Test(dataProvider = "floatBinaryOpProvider")
@@ -1871,7 +2070,7 @@ relativeError));
     }
 
     static float mul(float a, float b) {
-        return (float)(a * b);
+        return (float)(scalar_mul(a, b));
     }
 
     @Test(dataProvider = "floatBinaryOpProvider")
@@ -1928,7 +2127,7 @@ relativeError));
     }
 
     static float DIV(float a, float b) {
-        return (float)(a / b);
+        return (float)(scalar_div(a, b));
     }
 
     @Test(dataProvider = "floatBinaryOpProvider")
@@ -1949,7 +2148,7 @@ relativeError));
     }
 
     static float div(float a, float b) {
-        return (float)(a / b);
+        return (float)(scalar_div(a, b));
     }
 
     @Test(dataProvider = "floatBinaryOpProvider")
@@ -2006,7 +2205,7 @@ relativeError));
     }
 
     static float FIRST_NONZERO(float a, float b) {
-        return (float)(Double.doubleToLongBits(a)!=0?a:b);
+        return (float)(firstNonZero(a, b));
     }
 
     @Test(dataProvider = "floatBinaryOpProvider")
@@ -2308,7 +2507,7 @@ relativeError));
     }
 
     static float MIN(float a, float b) {
-        return (float)(Math.min(a, b));
+        return (float)(scalar_min(a, b));
     }
 
     @Test(dataProvider = "floatBinaryOpProvider")
@@ -2329,7 +2528,7 @@ relativeError));
     }
 
     static float min(float a, float b) {
-        return (float)(Math.min(a, b));
+        return (float)(scalar_min(a, b));
     }
 
     @Test(dataProvider = "floatBinaryOpProvider")
@@ -2348,7 +2547,7 @@ relativeError));
     }
 
     static float MAX(float a, float b) {
-        return (float)(Math.max(a, b));
+        return (float)(scalar_max(a, b));
     }
 
     @Test(dataProvider = "floatBinaryOpProvider")
@@ -2369,7 +2568,7 @@ relativeError));
     }
 
     static float max(float a, float b) {
-        return (float)(Math.max(a, b));
+        return (float)(scalar_max(a, b));
     }
 
     @Test(dataProvider = "floatBinaryOpProvider")
@@ -2446,7 +2645,7 @@ relativeError));
     static float ADDReduce(float[] a, int idx) {
         float res = ADD_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res += a[i];
+            res = scalar_add(res, a[i]);
         }
 
         return res;
@@ -2455,7 +2654,7 @@ relativeError));
     static float ADDReduceAll(float[] a) {
         float res = ADD_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduce(a, i);
+            res = scalar_add(res, ADDReduce(a, i));
         }
 
         return res;
@@ -2473,7 +2672,7 @@ relativeError));
                 FloatVector av = FloatVector.fromArray(SPECIES, a, i);
                 float v = av.reduceLanes(VectorOperators.ADD);
                 r[i] = v;
-                ra += v;
+                ra = scalar_add(ra, v);
             }
         }
 
@@ -2486,20 +2685,20 @@ relativeError));
         float[] a = fa.apply(SPECIES.length());
         float id = ADD_IDENTITY;
 
-        assertEquals((float) (id + id), id,
+        assertEquals((float) (scalar_add(id, id)), id,
                             "ADD(ADD_IDENTITY, ADD_IDENTITY) != ADD_IDENTITY");
 
         float x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((float) (id + x), x);
-                assertEquals((float) (x + id), x);
+                assertEquals((float) (scalar_add(id, x)), x);
+                assertEquals((float) (scalar_add(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((float) (id + x), x,
+            assertEquals((float) (scalar_add(id, x)), x,
                                 "ADD(ADD_IDENTITY, " + x + ") != " + x);
-            assertEquals((float) (x + id), x,
+            assertEquals((float) (scalar_add(x, id)), x,
                                 "ADD(" + x + ", ADD_IDENTITY) != " + x);
         }
     }
@@ -2508,7 +2707,7 @@ relativeError));
         float res = ADD_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res += a[i];
+                res = scalar_add(res, a[i]);
         }
 
         return res;
@@ -2517,7 +2716,7 @@ relativeError));
     static float ADDReduceAllMasked(float[] a, boolean[] mask) {
         float res = ADD_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduceMasked(a, i, mask);
+            res = scalar_add(res, ADDReduceMasked(a, i, mask));
         }
 
         return res;
@@ -2537,7 +2736,7 @@ relativeError));
                 FloatVector av = FloatVector.fromArray(SPECIES, a, i);
                 float v = av.reduceLanes(VectorOperators.ADD, vmask);
                 r[i] = v;
-                ra += v;
+                ra = scalar_add(ra, v);
             }
         }
 
@@ -2548,7 +2747,7 @@ relativeError));
     static float MULReduce(float[] a, int idx) {
         float res = MUL_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res *= a[i];
+            res = scalar_mul(res, a[i]);
         }
 
         return res;
@@ -2557,7 +2756,7 @@ relativeError));
     static float MULReduceAll(float[] a) {
         float res = MUL_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res *= MULReduce(a, i);
+            res = scalar_mul(res, MULReduce(a, i));
         }
 
         return res;
@@ -2575,7 +2774,7 @@ relativeError));
                 FloatVector av = FloatVector.fromArray(SPECIES, a, i);
                 float v = av.reduceLanes(VectorOperators.MUL);
                 r[i] = v;
-                ra *= v;
+                ra = scalar_mul(ra, v);
             }
         }
 
@@ -2588,20 +2787,20 @@ relativeError));
         float[] a = fa.apply(SPECIES.length());
         float id = MUL_IDENTITY;
 
-        assertEquals((float) (id * id), id,
+        assertEquals((float) (scalar_mul(id, id)), id,
                             "MUL(MUL_IDENTITY, MUL_IDENTITY) != MUL_IDENTITY");
 
         float x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((float) (id * x), x);
-                assertEquals((float) (x * id), x);
+                assertEquals((float) (scalar_mul(id, x)), x);
+                assertEquals((float) (scalar_mul(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((float) (id * x), x,
+            assertEquals((float) (scalar_mul(id, x)), x,
                                 "MUL(MUL_IDENTITY, " + x + ") != " + x);
-            assertEquals((float) (x * id), x,
+            assertEquals((float) (scalar_mul(x, id)), x,
                                 "MUL(" + x + ", MUL_IDENTITY) != " + x);
         }
     }
@@ -2610,7 +2809,7 @@ relativeError));
         float res = MUL_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res *= a[i];
+                res = scalar_mul(res, a[i]);
         }
 
         return res;
@@ -2619,7 +2818,7 @@ relativeError));
     static float MULReduceAllMasked(float[] a, boolean[] mask) {
         float res = MUL_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res *= MULReduceMasked(a, i, mask);
+            res = scalar_mul(res, MULReduceMasked(a, i, mask));
         }
 
         return res;
@@ -2639,7 +2838,7 @@ relativeError));
                 FloatVector av = FloatVector.fromArray(SPECIES, a, i);
                 float v = av.reduceLanes(VectorOperators.MUL, vmask);
                 r[i] = v;
-                ra *= v;
+                ra = scalar_mul(ra, v);
             }
         }
 
@@ -2650,7 +2849,7 @@ relativeError));
     static float MINReduce(float[] a, int idx) {
         float res = MIN_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res = (float) Math.min(res, a[i]);
+            res = scalar_min(res, a[i]);
         }
 
         return res;
@@ -2659,7 +2858,7 @@ relativeError));
     static float MINReduceAll(float[] a) {
         float res = MIN_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (float) Math.min(res, MINReduce(a, i));
+            res = scalar_min(res, MINReduce(a, i));
         }
 
         return res;
@@ -2677,7 +2876,7 @@ relativeError));
                 FloatVector av = FloatVector.fromArray(SPECIES, a, i);
                 float v = av.reduceLanes(VectorOperators.MIN);
                 r[i] = v;
-                ra = (float) Math.min(ra, v);
+                ra = scalar_min(ra, v);
             }
         }
 
@@ -2690,20 +2889,20 @@ relativeError));
         float[] a = fa.apply(SPECIES.length());
         float id = MIN_IDENTITY;
 
-        assertEquals((float) Math.min(id, id), id,
+        assertEquals(scalar_min(id, id), id,
                             "MIN(MIN_IDENTITY, MIN_IDENTITY) != MIN_IDENTITY");
 
         float x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((float) Math.min(id, x), x);
-                assertEquals((float) Math.min(x, id), x);
+                assertEquals(scalar_min(id, x), x);
+                assertEquals(scalar_min(x, id), x);
             }
         } catch (AssertionError e) {
-            assertEquals((float) Math.min(id, x), x,
+            assertEquals(scalar_min(id, x), x,
                                 "MIN(MIN_IDENTITY, " + x + ") != " + x);
-            assertEquals((float) Math.min(x, id), x,
+            assertEquals(scalar_min(x, id), x,
                                 "MIN(" + x + ", MIN_IDENTITY) != " + x);
         }
     }
@@ -2712,7 +2911,7 @@ relativeError));
         float res = MIN_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res = (float) Math.min(res, a[i]);
+                res = scalar_min(res, a[i]);
         }
 
         return res;
@@ -2721,7 +2920,7 @@ relativeError));
     static float MINReduceAllMasked(float[] a, boolean[] mask) {
         float res = MIN_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (float) Math.min(res, MINReduceMasked(a, i, mask));
+            res = scalar_min(res, MINReduceMasked(a, i, mask));
         }
 
         return res;
@@ -2741,7 +2940,7 @@ relativeError));
                 FloatVector av = FloatVector.fromArray(SPECIES, a, i);
                 float v = av.reduceLanes(VectorOperators.MIN, vmask);
                 r[i] = v;
-                ra = (float) Math.min(ra, v);
+                ra = scalar_min(ra, v);
             }
         }
 
@@ -2752,7 +2951,7 @@ relativeError));
     static float MAXReduce(float[] a, int idx) {
         float res = MAX_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res = (float) Math.max(res, a[i]);
+            res = scalar_max(res, a[i]);
         }
 
         return res;
@@ -2761,7 +2960,7 @@ relativeError));
     static float MAXReduceAll(float[] a) {
         float res = MAX_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (float) Math.max(res, MAXReduce(a, i));
+            res = scalar_max(res, MAXReduce(a, i));
         }
 
         return res;
@@ -2779,7 +2978,7 @@ relativeError));
                 FloatVector av = FloatVector.fromArray(SPECIES, a, i);
                 float v = av.reduceLanes(VectorOperators.MAX);
                 r[i] = v;
-                ra = (float) Math.max(ra, v);
+                ra = scalar_max(ra, v);
             }
         }
 
@@ -2792,20 +2991,20 @@ relativeError));
         float[] a = fa.apply(SPECIES.length());
         float id = MAX_IDENTITY;
 
-        assertEquals((float) Math.max(id, id), id,
+        assertEquals(scalar_max(id, id), id,
                             "MAX(MAX_IDENTITY, MAX_IDENTITY) != MAX_IDENTITY");
 
         float x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((float) Math.max(id, x), x);
-                assertEquals((float) Math.max(x, id), x);
+                assertEquals(scalar_max(id, x), x);
+                assertEquals(scalar_max(x, id), x);
             }
         } catch (AssertionError e) {
-            assertEquals((float) Math.max(id, x), x,
+            assertEquals(scalar_max(id, x), x,
                                 "MAX(MAX_IDENTITY, " + x + ") != " + x);
-            assertEquals((float) Math.max(x, id), x,
+            assertEquals(scalar_max(x, id), x,
                                 "MAX(" + x + ", MAX_IDENTITY) != " + x);
         }
     }
@@ -2814,7 +3013,7 @@ relativeError));
         float res = MAX_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res = (float) Math.max(res, a[i]);
+                res = scalar_max(res, a[i]);
         }
 
         return res;
@@ -2823,7 +3022,7 @@ relativeError));
     static float MAXReduceAllMasked(float[] a, boolean[] mask) {
         float res = MAX_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (float) Math.max(res, MAXReduceMasked(a, i, mask));
+            res = scalar_max(res, MAXReduceMasked(a, i, mask));
         }
 
         return res;
@@ -2843,7 +3042,7 @@ relativeError));
                 FloatVector av = FloatVector.fromArray(SPECIES, a, i);
                 float v = av.reduceLanes(VectorOperators.MAX, vmask);
                 r[i] = v;
-                ra = (float) Math.max(ra, v);
+                ra = scalar_max(ra, v);
             }
         }
 
@@ -3055,7 +3254,7 @@ relativeError));
     }
 
     static boolean testIS_FINITE(float a) {
-        return Float.isFinite(a);
+        return isFinite(a);
     }
 
     @Test(dataProvider = "floatTestOpProvider")
@@ -3096,7 +3295,7 @@ relativeError));
     }
 
     static boolean testIS_NAN(float a) {
-        return Float.isNaN(a);
+        return isNaN(a);
     }
 
     @Test(dataProvider = "floatTestOpProvider")
@@ -3137,7 +3336,7 @@ relativeError));
     }
 
     static boolean testIS_INFINITE(float a) {
-        return Float.isInfinite(a);
+        return isInfinite(a);
     }
 
     @Test(dataProvider = "floatTestOpProvider")
@@ -3478,7 +3677,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] < b[i]);
+                assertEquals(mv.laneIsSet(j), lt(a[i + j], b[i]));
             }
         }
     }
@@ -3498,7 +3697,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] < b[i]));
+                assertEquals(mv.laneIsSet(j), mask[j] && (lt(a[i + j], b[i])));
             }
         }
     }
@@ -3514,7 +3713,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] < (float)((long)b[i]));
+                assertEquals(mv.laneIsSet(j), lt(a[i + j], (float)((long)b[i])));
             }
         }
     }
@@ -3534,7 +3733,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] < (float)((long)b[i])));
+                assertEquals(mv.laneIsSet(j), mask[j] && (lt(a[i + j], (float)((long)b[i]))));
             }
         }
     }
@@ -3550,7 +3749,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] == b[i]);
+                assertEquals(mv.laneIsSet(j), eq(a[i + j], b[i]));
             }
         }
     }
@@ -3570,7 +3769,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] == b[i]));
+                assertEquals(mv.laneIsSet(j), mask[j] && (eq(a[i + j], b[i])));
             }
         }
     }
@@ -3586,7 +3785,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] == (float)((long)b[i]));
+                assertEquals(mv.laneIsSet(j), eq(a[i + j], (float)((long)b[i])));
             }
         }
     }
@@ -3606,7 +3805,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] == (float)((long)b[i])));
+                assertEquals(mv.laneIsSet(j), mask[j] && (eq(a[i + j], (float)((long)b[i]))));
             }
         }
     }
@@ -4106,11 +4305,11 @@ relativeError));
     }
 
     static float SIN(float a) {
-        return (float)(Math.sin((double)a));
+        return (float)(scalar_sin(a));
     }
 
     static float strictSIN(float a) {
-        return (float)(StrictMath.sin((double)a));
+        return (float)(strict_scalar_sin(a));
     }
 
     @Test(dataProvider = "floatUnaryOpProvider")
@@ -4129,11 +4328,11 @@ relativeError));
     }
 
     static float EXP(float a) {
-        return (float)(Math.exp((double)a));
+        return (float)(scalar_exp(a));
     }
 
     static float strictEXP(float a) {
-        return (float)(StrictMath.exp((double)a));
+        return (float)(strict_scalar_exp(a));
     }
 
     @Test(dataProvider = "floatUnaryOpProvider")
@@ -4152,11 +4351,11 @@ relativeError));
     }
 
     static float LOG1P(float a) {
-        return (float)(Math.log1p((double)a));
+        return (float)(scalar_log1p(a));
     }
 
     static float strictLOG1P(float a) {
-        return (float)(StrictMath.log1p((double)a));
+        return (float)(strict_scalar_log1p(a));
     }
 
     @Test(dataProvider = "floatUnaryOpProvider")
@@ -4175,11 +4374,11 @@ relativeError));
     }
 
     static float LOG(float a) {
-        return (float)(Math.log((double)a));
+        return (float)(scalar_log(a));
     }
 
     static float strictLOG(float a) {
-        return (float)(StrictMath.log((double)a));
+        return (float)(strict_scalar_log(a));
     }
 
     @Test(dataProvider = "floatUnaryOpProvider")
@@ -4198,11 +4397,11 @@ relativeError));
     }
 
     static float LOG10(float a) {
-        return (float)(Math.log10((double)a));
+        return (float)(scalar_log10(a));
     }
 
     static float strictLOG10(float a) {
-        return (float)(StrictMath.log10((double)a));
+        return (float)(strict_scalar_log10(a));
     }
 
     @Test(dataProvider = "floatUnaryOpProvider")
@@ -4221,11 +4420,11 @@ relativeError));
     }
 
     static float EXPM1(float a) {
-        return (float)(Math.expm1((double)a));
+        return (float)(scalar_expm1(a));
     }
 
     static float strictEXPM1(float a) {
-        return (float)(StrictMath.expm1((double)a));
+        return (float)(strict_scalar_expm1(a));
     }
 
     @Test(dataProvider = "floatUnaryOpProvider")
@@ -4244,11 +4443,11 @@ relativeError));
     }
 
     static float COS(float a) {
-        return (float)(Math.cos((double)a));
+        return (float)(scalar_cos(a));
     }
 
     static float strictCOS(float a) {
-        return (float)(StrictMath.cos((double)a));
+        return (float)(strict_scalar_cos(a));
     }
 
     @Test(dataProvider = "floatUnaryOpProvider")
@@ -4267,11 +4466,11 @@ relativeError));
     }
 
     static float TAN(float a) {
-        return (float)(Math.tan((double)a));
+        return (float)(scalar_tan(a));
     }
 
     static float strictTAN(float a) {
-        return (float)(StrictMath.tan((double)a));
+        return (float)(strict_scalar_tan(a));
     }
 
     @Test(dataProvider = "floatUnaryOpProvider")
@@ -4290,11 +4489,11 @@ relativeError));
     }
 
     static float SINH(float a) {
-        return (float)(Math.sinh((double)a));
+        return (float)(scalar_sinh(a));
     }
 
     static float strictSINH(float a) {
-        return (float)(StrictMath.sinh((double)a));
+        return (float)(strict_scalar_sinh(a));
     }
 
     @Test(dataProvider = "floatUnaryOpProvider")
@@ -4313,11 +4512,11 @@ relativeError));
     }
 
     static float COSH(float a) {
-        return (float)(Math.cosh((double)a));
+        return (float)(scalar_cosh(a));
     }
 
     static float strictCOSH(float a) {
-        return (float)(StrictMath.cosh((double)a));
+        return (float)(strict_scalar_cosh(a));
     }
 
     @Test(dataProvider = "floatUnaryOpProvider")
@@ -4336,11 +4535,11 @@ relativeError));
     }
 
     static float TANH(float a) {
-        return (float)(Math.tanh((double)a));
+        return (float)(scalar_tanh(a));
     }
 
     static float strictTANH(float a) {
-        return (float)(StrictMath.tanh((double)a));
+        return (float)(strict_scalar_tanh(a));
     }
 
     @Test(dataProvider = "floatUnaryOpProvider")
@@ -4359,11 +4558,11 @@ relativeError));
     }
 
     static float ASIN(float a) {
-        return (float)(Math.asin((double)a));
+        return (float)(scalar_asin(a));
     }
 
     static float strictASIN(float a) {
-        return (float)(StrictMath.asin((double)a));
+        return (float)(strict_scalar_asin(a));
     }
 
     @Test(dataProvider = "floatUnaryOpProvider")
@@ -4382,11 +4581,11 @@ relativeError));
     }
 
     static float ACOS(float a) {
-        return (float)(Math.acos((double)a));
+        return (float)(scalar_acos(a));
     }
 
     static float strictACOS(float a) {
-        return (float)(StrictMath.acos((double)a));
+        return (float)(strict_scalar_acos(a));
     }
 
     @Test(dataProvider = "floatUnaryOpProvider")
@@ -4405,11 +4604,11 @@ relativeError));
     }
 
     static float ATAN(float a) {
-        return (float)(Math.atan((double)a));
+        return (float)(scalar_atan(a));
     }
 
     static float strictATAN(float a) {
-        return (float)(StrictMath.atan((double)a));
+        return (float)(strict_scalar_atan(a));
     }
 
     @Test(dataProvider = "floatUnaryOpProvider")
@@ -4428,11 +4627,11 @@ relativeError));
     }
 
     static float CBRT(float a) {
-        return (float)(Math.cbrt((double)a));
+        return (float)(scalar_cbrt(a));
     }
 
     static float strictCBRT(float a) {
-        return (float)(StrictMath.cbrt((double)a));
+        return (float)(strict_scalar_cbrt(a));
     }
 
     @Test(dataProvider = "floatUnaryOpProvider")
@@ -4451,11 +4650,11 @@ relativeError));
     }
 
     static float HYPOT(float a, float b) {
-        return (float)(Math.hypot((double)a, (double)b));
+        return (float)(scalar_hypot(a, b));
     }
 
     static float strictHYPOT(float a, float b) {
-        return (float)(StrictMath.hypot((double)a, (double)b));
+        return (float)(strict_scalar_hypot(a, b));
     }
 
     @Test(dataProvider = "floatBinaryOpProvider")
@@ -4477,11 +4676,11 @@ relativeError));
 
 
     static float POW(float a, float b) {
-        return (float)(Math.pow((double)a, (double)b));
+        return (float)(scalar_pow(a, b));
     }
 
     static float strictPOW(float a, float b) {
-        return (float)(StrictMath.pow((double)a, (double)b));
+        return (float)(strict_scalar_pow(a, b));
     }
 
     @Test(dataProvider = "floatBinaryOpProvider")
@@ -4503,11 +4702,11 @@ relativeError));
 
 
     static float pow(float a, float b) {
-        return (float)(Math.pow((double)a, (double)b));
+        return (float)(scalar_pow(a, b));
     }
 
     static float strictpow(float a, float b) {
-        return (float)(StrictMath.pow((double)a, (double)b));
+        return (float)(strict_scalar_pow(a, b));
     }
 
     @Test(dataProvider = "floatBinaryOpProvider")
@@ -4529,11 +4728,11 @@ relativeError));
 
 
     static float ATAN2(float a, float b) {
-        return (float)(Math.atan2((double)a, (double)b));
+        return (float)(scalar_atan2(a, b));
     }
 
     static float strictATAN2(float a, float b) {
-        return (float)(StrictMath.atan2((double)a, (double)b));
+        return (float)(strict_scalar_atan2(a, b));
     }
 
     @Test(dataProvider = "floatBinaryOpProvider")
@@ -4585,11 +4784,11 @@ relativeError));
 
 
     static float FMA(float a, float b, float c) {
-        return (float)(Math.fma(a, b, c));
+        return (float)(scalar_fma(a, b, c));
     }
 
     static float fma(float a, float b, float c) {
-        return (float)(Math.fma(a, b, c));
+        return (float)(scalar_fma(a, b, c));
     }
 
     @Test(dataProvider = "floatTernaryOpProvider")
@@ -4767,11 +4966,11 @@ relativeError));
     }
 
     static float NEG(float a) {
-        return (float)(-((float)a));
+        return (float)(scalar_neg((float)a));
     }
 
     static float neg(float a) {
-        return (float)(-((float)a));
+        return (float)(scalar_neg((float)a));
     }
 
     @Test(dataProvider = "floatUnaryOpProvider")
@@ -4823,11 +5022,11 @@ relativeError));
     }
 
     static float ABS(float a) {
-        return (float)(Math.abs((float)a));
+        return (float)(scalar_abs((float)a));
     }
 
     static float abs(float a) {
-        return (float)(Math.abs((float)a));
+        return (float)(scalar_abs((float)a));
     }
 
     @Test(dataProvider = "floatUnaryOpProvider")
@@ -4879,11 +5078,11 @@ relativeError));
     }
 
     static float SQRT(float a) {
-        return (float)(Math.sqrt((double)a));
+        return (float)(scalar_sqrt(a));
     }
 
     static float sqrt(float a) {
-        return (float)(Math.sqrt((double)a));
+        return (float)(scalar_sqrt(a));
     }
 
     @Test(dataProvider = "floatUnaryOpProvider")
@@ -5096,7 +5295,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] < b[i]);
+                assertEquals(mv.laneIsSet(j), lt(a[i + j], b[i]));
             }
         }
     }
@@ -5112,7 +5311,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] == b[i]);
+                assertEquals(mv.laneIsSet(j), eq(a[i + j], b[i]));
             }
         }
     }
@@ -5181,7 +5380,7 @@ relativeError));
     static long ADDReduceLong(float[] a, int idx) {
         float res = 0;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res += a[i];
+            res = scalar_add(res, a[i]);
         }
 
         return (long)res;
@@ -5190,7 +5389,7 @@ relativeError));
     static long ADDReduceAllLong(float[] a) {
         long res = 0;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduceLong(a, i);
+            res = (long)scalar_add((float)res, (float)ADDReduceLong(a, i));
         }
 
         return res;
@@ -5208,8 +5407,8 @@ relativeError));
         }
 
         ra = 0;
-        for (int i = 0; i < a.length; i ++) {
-            ra += r[i];
+        for (int i = 0; i < a.length; i++) {
+            ra = (long)scalar_add((float)ra, (float)r[i]);
         }
 
         assertReductionLongArraysEquals(r, ra, a,
@@ -5219,8 +5418,9 @@ relativeError));
     static long ADDReduceLongMasked(float[] a, int idx, boolean[] mask) {
         float res = 0;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            if(mask[i % SPECIES.length()])
-                res += a[i];
+            if (mask[i % SPECIES.length()]) {
+                res = scalar_add(res, a[i]);
+            }
         }
 
         return (long)res;
@@ -5229,7 +5429,7 @@ relativeError));
     static long ADDReduceAllLongMasked(float[] a, boolean[] mask) {
         long res = 0;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduceLongMasked(a, i, mask);
+            res = (long)scalar_add((float)res, (float)ADDReduceLongMasked(a, i, mask));
         }
 
         return res;
@@ -5249,8 +5449,8 @@ relativeError));
         }
 
         ra = 0;
-        for (int i = 0; i < a.length; i ++) {
-            ra += r[i];
+        for (int i = 0; i < a.length; i++) {
+            ra = (long)scalar_add((float)ra, (float)r[i]);
         }
 
         assertReductionLongArraysEqualsMasked(r, ra, a, mask,
diff --git a/test/jdk/jdk/incubator/vector/FloatVector64Tests.java b/test/jdk/jdk/incubator/vector/FloatVector64Tests.java
index 663a56dfe26..b06dff18194 100644
--- a/test/jdk/jdk/incubator/vector/FloatVector64Tests.java
+++ b/test/jdk/jdk/incubator/vector/FloatVector64Tests.java
@@ -1601,6 +1601,205 @@ relativeError));
         return Float.compare(a, (float) 0) != 0 ? a : b;
     }
 
+
+    static float scalar_add(float a, float b) {
+        return (float)(a + b);
+    }
+
+    static float scalar_sub(float a, float b) {
+        return (float)(a - b);
+    }
+
+    static float scalar_mul(float a, float b) {
+        return (float)(a * b);
+    }
+
+    static float scalar_min(float a, float b) {
+        return (float)(Math.min(a, b));
+    }
+
+    static float scalar_max(float a, float b) {
+        return (float)(Math.max(a, b));
+    }
+
+    static float scalar_div(float a, float b) {
+        return (float)(a / b);
+    }
+
+    static float scalar_fma(float a, float b, float c) {
+        return (float)(Math.fma(a, b, c));
+    }
+
+    static float scalar_abs(float a) {
+        return (float)(Math.abs(a));
+    }
+
+    static float scalar_neg(float a) {
+        return ((float)-a);
+    }
+
+    static float scalar_sin(float a) {
+        return (float)Math.sin((double)a);
+    }
+
+    static float scalar_exp(float a) {
+        return (float)Math.exp((double)a);
+    }
+
+    static float scalar_log1p(float a) {
+        return (float)Math.log1p((double)a);
+    }
+
+    static float scalar_log(float a) {
+        return (float)Math.log((double)a);
+    }
+
+    static float scalar_log10(float a) {
+        return (float)Math.log10((double)a);
+    }
+
+    static float scalar_expm1(float a) {
+        return (float)Math.expm1((double)a);
+    }
+
+    static float scalar_cos(float a) {
+        return (float)Math.cos((double)a);
+    }
+
+    static float scalar_tan(float a) {
+        return (float)Math.tan((double)a);
+    }
+
+    static float scalar_sinh(float a) {
+        return (float)Math.sinh((double)a);
+    }
+
+    static float scalar_cosh(float a) {
+        return (float)Math.cosh((double)a);
+    }
+
+    static float scalar_tanh(float a) {
+        return (float)Math.tanh((double)a);
+    }
+
+    static float scalar_asin(float a) {
+        return (float)Math.asin((double)a);
+    }
+
+    static float scalar_acos(float a) {
+        return (float)Math.acos((double)a);
+    }
+
+    static float scalar_atan(float a) {
+        return (float)Math.atan((double)a);
+    }
+
+    static float scalar_cbrt(float a) {
+        return (float)Math.cbrt((double)a);
+    }
+
+    static float scalar_sqrt(float a) {
+        return (float)Math.sqrt((double)a);
+    }
+
+    static float scalar_hypot(float a, float b) {
+        return (float)Math.hypot((double)a, (double)b);
+    }
+
+    static float scalar_pow(float a, float b) {
+        return (float)Math.pow((double)a, (double)b);
+    }
+
+    static float scalar_atan2(float a, float b) {
+        return (float)Math.atan2((double)a, (double)b);
+    }
+
+    static float strict_scalar_sin(float a) {
+        return (float)StrictMath.sin((double)a);
+    }
+
+    static float strict_scalar_exp(float a) {
+        return (float)StrictMath.exp((double)a);
+    }
+
+    static float strict_scalar_log1p(float a) {
+        return (float)StrictMath.log1p((double)a);
+    }
+
+    static float strict_scalar_log(float a) {
+        return (float)StrictMath.log((double)a);
+    }
+
+    static float strict_scalar_log10(float a) {
+        return (float)StrictMath.log10((double)a);
+    }
+
+    static float strict_scalar_expm1(float a) {
+        return (float)StrictMath.expm1((double)a);
+    }
+
+    static float strict_scalar_cos(float a) {
+        return (float)StrictMath.cos((double)a);
+    }
+
+    static float strict_scalar_tan(float a) {
+        return (float)StrictMath.tan((double)a);
+    }
+
+    static float strict_scalar_sinh(float a) {
+        return (float)StrictMath.sinh((double)a);
+    }
+
+    static float strict_scalar_cosh(float a) {
+        return (float)StrictMath.cosh((double)a);
+    }
+
+    static float strict_scalar_tanh(float a) {
+        return (float)StrictMath.tanh((double)a);
+    }
+
+    static float strict_scalar_asin(float a) {
+        return (float)StrictMath.asin((double)a);
+    }
+
+    static float strict_scalar_acos(float a) {
+        return (float)StrictMath.acos((double)a);
+    }
+
+    static float strict_scalar_atan(float a) {
+        return (float)StrictMath.atan((double)a);
+    }
+
+    static float strict_scalar_cbrt(float a) {
+        return (float)StrictMath.cbrt((double)a);
+    }
+
+    static float strict_scalar_sqrt(float a) {
+        return (float)StrictMath.sqrt((double)a);
+    }
+
+    static float strict_scalar_hypot(float a, float b) {
+        return (float)StrictMath.hypot((double)a, (double)b);
+    }
+
+    static float strict_scalar_pow(float a, float b) {
+        return (float)StrictMath.pow((double)a, (double)b);
+    }
+
+    static float strict_scalar_atan2(float a, float b) {
+        return (float)StrictMath.atan2((double)a, (double)b);
+    }
+
+    static boolean isNaN(float a) {
+        return Float.isNaN(a);
+    }
+    static boolean isFinite(float a) {
+        return Float.isFinite(a);
+    }
+    static boolean isInfinite(float a) {
+        return Float.isInfinite(a);
+    }
+
     @Test
     static void smokeTest1() {
         FloatVector three = FloatVector.broadcast(SPECIES, (byte)-3);
@@ -1694,7 +1893,7 @@ relativeError));
     }
 
     static float ADD(float a, float b) {
-        return (float)(a + b);
+        return (float)(scalar_add(a, b));
     }
 
     @Test(dataProvider = "floatBinaryOpProvider")
@@ -1715,7 +1914,7 @@ relativeError));
     }
 
     static float add(float a, float b) {
-        return (float)(a + b);
+        return (float)(scalar_add(a, b));
     }
 
     @Test(dataProvider = "floatBinaryOpProvider")
@@ -1772,7 +1971,7 @@ relativeError));
     }
 
     static float SUB(float a, float b) {
-        return (float)(a - b);
+        return (float)(scalar_sub(a, b));
     }
 
     @Test(dataProvider = "floatBinaryOpProvider")
@@ -1793,7 +1992,7 @@ relativeError));
     }
 
     static float sub(float a, float b) {
-        return (float)(a - b);
+        return (float)(scalar_sub(a, b));
     }
 
     @Test(dataProvider = "floatBinaryOpProvider")
@@ -1850,7 +2049,7 @@ relativeError));
     }
 
     static float MUL(float a, float b) {
-        return (float)(a * b);
+        return (float)(scalar_mul(a, b));
     }
 
     @Test(dataProvider = "floatBinaryOpProvider")
@@ -1871,7 +2070,7 @@ relativeError));
     }
 
     static float mul(float a, float b) {
-        return (float)(a * b);
+        return (float)(scalar_mul(a, b));
     }
 
     @Test(dataProvider = "floatBinaryOpProvider")
@@ -1928,7 +2127,7 @@ relativeError));
     }
 
     static float DIV(float a, float b) {
-        return (float)(a / b);
+        return (float)(scalar_div(a, b));
     }
 
     @Test(dataProvider = "floatBinaryOpProvider")
@@ -1949,7 +2148,7 @@ relativeError));
     }
 
     static float div(float a, float b) {
-        return (float)(a / b);
+        return (float)(scalar_div(a, b));
     }
 
     @Test(dataProvider = "floatBinaryOpProvider")
@@ -2006,7 +2205,7 @@ relativeError));
     }
 
     static float FIRST_NONZERO(float a, float b) {
-        return (float)(Double.doubleToLongBits(a)!=0?a:b);
+        return (float)(firstNonZero(a, b));
     }
 
     @Test(dataProvider = "floatBinaryOpProvider")
@@ -2308,7 +2507,7 @@ relativeError));
     }
 
     static float MIN(float a, float b) {
-        return (float)(Math.min(a, b));
+        return (float)(scalar_min(a, b));
     }
 
     @Test(dataProvider = "floatBinaryOpProvider")
@@ -2329,7 +2528,7 @@ relativeError));
     }
 
     static float min(float a, float b) {
-        return (float)(Math.min(a, b));
+        return (float)(scalar_min(a, b));
     }
 
     @Test(dataProvider = "floatBinaryOpProvider")
@@ -2348,7 +2547,7 @@ relativeError));
     }
 
     static float MAX(float a, float b) {
-        return (float)(Math.max(a, b));
+        return (float)(scalar_max(a, b));
     }
 
     @Test(dataProvider = "floatBinaryOpProvider")
@@ -2369,7 +2568,7 @@ relativeError));
     }
 
     static float max(float a, float b) {
-        return (float)(Math.max(a, b));
+        return (float)(scalar_max(a, b));
     }
 
     @Test(dataProvider = "floatBinaryOpProvider")
@@ -2446,7 +2645,7 @@ relativeError));
     static float ADDReduce(float[] a, int idx) {
         float res = ADD_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res += a[i];
+            res = scalar_add(res, a[i]);
         }
 
         return res;
@@ -2455,7 +2654,7 @@ relativeError));
     static float ADDReduceAll(float[] a) {
         float res = ADD_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduce(a, i);
+            res = scalar_add(res, ADDReduce(a, i));
         }
 
         return res;
@@ -2473,7 +2672,7 @@ relativeError));
                 FloatVector av = FloatVector.fromArray(SPECIES, a, i);
                 float v = av.reduceLanes(VectorOperators.ADD);
                 r[i] = v;
-                ra += v;
+                ra = scalar_add(ra, v);
             }
         }
 
@@ -2486,20 +2685,20 @@ relativeError));
         float[] a = fa.apply(SPECIES.length());
         float id = ADD_IDENTITY;
 
-        assertEquals((float) (id + id), id,
+        assertEquals((float) (scalar_add(id, id)), id,
                             "ADD(ADD_IDENTITY, ADD_IDENTITY) != ADD_IDENTITY");
 
         float x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((float) (id + x), x);
-                assertEquals((float) (x + id), x);
+                assertEquals((float) (scalar_add(id, x)), x);
+                assertEquals((float) (scalar_add(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((float) (id + x), x,
+            assertEquals((float) (scalar_add(id, x)), x,
                                 "ADD(ADD_IDENTITY, " + x + ") != " + x);
-            assertEquals((float) (x + id), x,
+            assertEquals((float) (scalar_add(x, id)), x,
                                 "ADD(" + x + ", ADD_IDENTITY) != " + x);
         }
     }
@@ -2508,7 +2707,7 @@ relativeError));
         float res = ADD_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res += a[i];
+                res = scalar_add(res, a[i]);
         }
 
         return res;
@@ -2517,7 +2716,7 @@ relativeError));
     static float ADDReduceAllMasked(float[] a, boolean[] mask) {
         float res = ADD_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduceMasked(a, i, mask);
+            res = scalar_add(res, ADDReduceMasked(a, i, mask));
         }
 
         return res;
@@ -2537,7 +2736,7 @@ relativeError));
                 FloatVector av = FloatVector.fromArray(SPECIES, a, i);
                 float v = av.reduceLanes(VectorOperators.ADD, vmask);
                 r[i] = v;
-                ra += v;
+                ra = scalar_add(ra, v);
             }
         }
 
@@ -2548,7 +2747,7 @@ relativeError));
     static float MULReduce(float[] a, int idx) {
         float res = MUL_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res *= a[i];
+            res = scalar_mul(res, a[i]);
         }
 
         return res;
@@ -2557,7 +2756,7 @@ relativeError));
     static float MULReduceAll(float[] a) {
         float res = MUL_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res *= MULReduce(a, i);
+            res = scalar_mul(res, MULReduce(a, i));
         }
 
         return res;
@@ -2575,7 +2774,7 @@ relativeError));
                 FloatVector av = FloatVector.fromArray(SPECIES, a, i);
                 float v = av.reduceLanes(VectorOperators.MUL);
                 r[i] = v;
-                ra *= v;
+                ra = scalar_mul(ra, v);
             }
         }
 
@@ -2588,20 +2787,20 @@ relativeError));
         float[] a = fa.apply(SPECIES.length());
         float id = MUL_IDENTITY;
 
-        assertEquals((float) (id * id), id,
+        assertEquals((float) (scalar_mul(id, id)), id,
                             "MUL(MUL_IDENTITY, MUL_IDENTITY) != MUL_IDENTITY");
 
         float x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((float) (id * x), x);
-                assertEquals((float) (x * id), x);
+                assertEquals((float) (scalar_mul(id, x)), x);
+                assertEquals((float) (scalar_mul(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((float) (id * x), x,
+            assertEquals((float) (scalar_mul(id, x)), x,
                                 "MUL(MUL_IDENTITY, " + x + ") != " + x);
-            assertEquals((float) (x * id), x,
+            assertEquals((float) (scalar_mul(x, id)), x,
                                 "MUL(" + x + ", MUL_IDENTITY) != " + x);
         }
     }
@@ -2610,7 +2809,7 @@ relativeError));
         float res = MUL_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res *= a[i];
+                res = scalar_mul(res, a[i]);
         }
 
         return res;
@@ -2619,7 +2818,7 @@ relativeError));
     static float MULReduceAllMasked(float[] a, boolean[] mask) {
         float res = MUL_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res *= MULReduceMasked(a, i, mask);
+            res = scalar_mul(res, MULReduceMasked(a, i, mask));
         }
 
         return res;
@@ -2639,7 +2838,7 @@ relativeError));
                 FloatVector av = FloatVector.fromArray(SPECIES, a, i);
                 float v = av.reduceLanes(VectorOperators.MUL, vmask);
                 r[i] = v;
-                ra *= v;
+                ra = scalar_mul(ra, v);
             }
         }
 
@@ -2650,7 +2849,7 @@ relativeError));
     static float MINReduce(float[] a, int idx) {
         float res = MIN_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res = (float) Math.min(res, a[i]);
+            res = scalar_min(res, a[i]);
         }
 
         return res;
@@ -2659,7 +2858,7 @@ relativeError));
     static float MINReduceAll(float[] a) {
         float res = MIN_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (float) Math.min(res, MINReduce(a, i));
+            res = scalar_min(res, MINReduce(a, i));
         }
 
         return res;
@@ -2677,7 +2876,7 @@ relativeError));
                 FloatVector av = FloatVector.fromArray(SPECIES, a, i);
                 float v = av.reduceLanes(VectorOperators.MIN);
                 r[i] = v;
-                ra = (float) Math.min(ra, v);
+                ra = scalar_min(ra, v);
             }
         }
 
@@ -2690,20 +2889,20 @@ relativeError));
         float[] a = fa.apply(SPECIES.length());
         float id = MIN_IDENTITY;
 
-        assertEquals((float) Math.min(id, id), id,
+        assertEquals(scalar_min(id, id), id,
                             "MIN(MIN_IDENTITY, MIN_IDENTITY) != MIN_IDENTITY");
 
         float x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((float) Math.min(id, x), x);
-                assertEquals((float) Math.min(x, id), x);
+                assertEquals(scalar_min(id, x), x);
+                assertEquals(scalar_min(x, id), x);
             }
         } catch (AssertionError e) {
-            assertEquals((float) Math.min(id, x), x,
+            assertEquals(scalar_min(id, x), x,
                                 "MIN(MIN_IDENTITY, " + x + ") != " + x);
-            assertEquals((float) Math.min(x, id), x,
+            assertEquals(scalar_min(x, id), x,
                                 "MIN(" + x + ", MIN_IDENTITY) != " + x);
         }
     }
@@ -2712,7 +2911,7 @@ relativeError));
         float res = MIN_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res = (float) Math.min(res, a[i]);
+                res = scalar_min(res, a[i]);
         }
 
         return res;
@@ -2721,7 +2920,7 @@ relativeError));
     static float MINReduceAllMasked(float[] a, boolean[] mask) {
         float res = MIN_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (float) Math.min(res, MINReduceMasked(a, i, mask));
+            res = scalar_min(res, MINReduceMasked(a, i, mask));
         }
 
         return res;
@@ -2741,7 +2940,7 @@ relativeError));
                 FloatVector av = FloatVector.fromArray(SPECIES, a, i);
                 float v = av.reduceLanes(VectorOperators.MIN, vmask);
                 r[i] = v;
-                ra = (float) Math.min(ra, v);
+                ra = scalar_min(ra, v);
             }
         }
 
@@ -2752,7 +2951,7 @@ relativeError));
     static float MAXReduce(float[] a, int idx) {
         float res = MAX_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res = (float) Math.max(res, a[i]);
+            res = scalar_max(res, a[i]);
         }
 
         return res;
@@ -2761,7 +2960,7 @@ relativeError));
     static float MAXReduceAll(float[] a) {
         float res = MAX_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (float) Math.max(res, MAXReduce(a, i));
+            res = scalar_max(res, MAXReduce(a, i));
         }
 
         return res;
@@ -2779,7 +2978,7 @@ relativeError));
                 FloatVector av = FloatVector.fromArray(SPECIES, a, i);
                 float v = av.reduceLanes(VectorOperators.MAX);
                 r[i] = v;
-                ra = (float) Math.max(ra, v);
+                ra = scalar_max(ra, v);
             }
         }
 
@@ -2792,20 +2991,20 @@ relativeError));
         float[] a = fa.apply(SPECIES.length());
         float id = MAX_IDENTITY;
 
-        assertEquals((float) Math.max(id, id), id,
+        assertEquals(scalar_max(id, id), id,
                             "MAX(MAX_IDENTITY, MAX_IDENTITY) != MAX_IDENTITY");
 
         float x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((float) Math.max(id, x), x);
-                assertEquals((float) Math.max(x, id), x);
+                assertEquals(scalar_max(id, x), x);
+                assertEquals(scalar_max(x, id), x);
             }
         } catch (AssertionError e) {
-            assertEquals((float) Math.max(id, x), x,
+            assertEquals(scalar_max(id, x), x,
                                 "MAX(MAX_IDENTITY, " + x + ") != " + x);
-            assertEquals((float) Math.max(x, id), x,
+            assertEquals(scalar_max(x, id), x,
                                 "MAX(" + x + ", MAX_IDENTITY) != " + x);
         }
     }
@@ -2814,7 +3013,7 @@ relativeError));
         float res = MAX_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res = (float) Math.max(res, a[i]);
+                res = scalar_max(res, a[i]);
         }
 
         return res;
@@ -2823,7 +3022,7 @@ relativeError));
     static float MAXReduceAllMasked(float[] a, boolean[] mask) {
         float res = MAX_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (float) Math.max(res, MAXReduceMasked(a, i, mask));
+            res = scalar_max(res, MAXReduceMasked(a, i, mask));
         }
 
         return res;
@@ -2843,7 +3042,7 @@ relativeError));
                 FloatVector av = FloatVector.fromArray(SPECIES, a, i);
                 float v = av.reduceLanes(VectorOperators.MAX, vmask);
                 r[i] = v;
-                ra = (float) Math.max(ra, v);
+                ra = scalar_max(ra, v);
             }
         }
 
@@ -3055,7 +3254,7 @@ relativeError));
     }
 
     static boolean testIS_FINITE(float a) {
-        return Float.isFinite(a);
+        return isFinite(a);
     }
 
     @Test(dataProvider = "floatTestOpProvider")
@@ -3096,7 +3295,7 @@ relativeError));
     }
 
     static boolean testIS_NAN(float a) {
-        return Float.isNaN(a);
+        return isNaN(a);
     }
 
     @Test(dataProvider = "floatTestOpProvider")
@@ -3137,7 +3336,7 @@ relativeError));
     }
 
     static boolean testIS_INFINITE(float a) {
-        return Float.isInfinite(a);
+        return isInfinite(a);
     }
 
     @Test(dataProvider = "floatTestOpProvider")
@@ -3478,7 +3677,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] < b[i]);
+                assertEquals(mv.laneIsSet(j), lt(a[i + j], b[i]));
             }
         }
     }
@@ -3498,7 +3697,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] < b[i]));
+                assertEquals(mv.laneIsSet(j), mask[j] && (lt(a[i + j], b[i])));
             }
         }
     }
@@ -3514,7 +3713,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] < (float)((long)b[i]));
+                assertEquals(mv.laneIsSet(j), lt(a[i + j], (float)((long)b[i])));
             }
         }
     }
@@ -3534,7 +3733,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] < (float)((long)b[i])));
+                assertEquals(mv.laneIsSet(j), mask[j] && (lt(a[i + j], (float)((long)b[i]))));
             }
         }
     }
@@ -3550,7 +3749,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] == b[i]);
+                assertEquals(mv.laneIsSet(j), eq(a[i + j], b[i]));
             }
         }
     }
@@ -3570,7 +3769,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] == b[i]));
+                assertEquals(mv.laneIsSet(j), mask[j] && (eq(a[i + j], b[i])));
             }
         }
     }
@@ -3586,7 +3785,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] == (float)((long)b[i]));
+                assertEquals(mv.laneIsSet(j), eq(a[i + j], (float)((long)b[i])));
             }
         }
     }
@@ -3606,7 +3805,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] == (float)((long)b[i])));
+                assertEquals(mv.laneIsSet(j), mask[j] && (eq(a[i + j], (float)((long)b[i]))));
             }
         }
     }
@@ -4106,11 +4305,11 @@ relativeError));
     }
 
     static float SIN(float a) {
-        return (float)(Math.sin((double)a));
+        return (float)(scalar_sin(a));
     }
 
     static float strictSIN(float a) {
-        return (float)(StrictMath.sin((double)a));
+        return (float)(strict_scalar_sin(a));
     }
 
     @Test(dataProvider = "floatUnaryOpProvider")
@@ -4129,11 +4328,11 @@ relativeError));
     }
 
     static float EXP(float a) {
-        return (float)(Math.exp((double)a));
+        return (float)(scalar_exp(a));
     }
 
     static float strictEXP(float a) {
-        return (float)(StrictMath.exp((double)a));
+        return (float)(strict_scalar_exp(a));
     }
 
     @Test(dataProvider = "floatUnaryOpProvider")
@@ -4152,11 +4351,11 @@ relativeError));
     }
 
     static float LOG1P(float a) {
-        return (float)(Math.log1p((double)a));
+        return (float)(scalar_log1p(a));
     }
 
     static float strictLOG1P(float a) {
-        return (float)(StrictMath.log1p((double)a));
+        return (float)(strict_scalar_log1p(a));
     }
 
     @Test(dataProvider = "floatUnaryOpProvider")
@@ -4175,11 +4374,11 @@ relativeError));
     }
 
     static float LOG(float a) {
-        return (float)(Math.log((double)a));
+        return (float)(scalar_log(a));
     }
 
     static float strictLOG(float a) {
-        return (float)(StrictMath.log((double)a));
+        return (float)(strict_scalar_log(a));
     }
 
     @Test(dataProvider = "floatUnaryOpProvider")
@@ -4198,11 +4397,11 @@ relativeError));
     }
 
     static float LOG10(float a) {
-        return (float)(Math.log10((double)a));
+        return (float)(scalar_log10(a));
     }
 
     static float strictLOG10(float a) {
-        return (float)(StrictMath.log10((double)a));
+        return (float)(strict_scalar_log10(a));
     }
 
     @Test(dataProvider = "floatUnaryOpProvider")
@@ -4221,11 +4420,11 @@ relativeError));
     }
 
     static float EXPM1(float a) {
-        return (float)(Math.expm1((double)a));
+        return (float)(scalar_expm1(a));
     }
 
     static float strictEXPM1(float a) {
-        return (float)(StrictMath.expm1((double)a));
+        return (float)(strict_scalar_expm1(a));
     }
 
     @Test(dataProvider = "floatUnaryOpProvider")
@@ -4244,11 +4443,11 @@ relativeError));
     }
 
     static float COS(float a) {
-        return (float)(Math.cos((double)a));
+        return (float)(scalar_cos(a));
     }
 
     static float strictCOS(float a) {
-        return (float)(StrictMath.cos((double)a));
+        return (float)(strict_scalar_cos(a));
     }
 
     @Test(dataProvider = "floatUnaryOpProvider")
@@ -4267,11 +4466,11 @@ relativeError));
     }
 
     static float TAN(float a) {
-        return (float)(Math.tan((double)a));
+        return (float)(scalar_tan(a));
     }
 
     static float strictTAN(float a) {
-        return (float)(StrictMath.tan((double)a));
+        return (float)(strict_scalar_tan(a));
     }
 
     @Test(dataProvider = "floatUnaryOpProvider")
@@ -4290,11 +4489,11 @@ relativeError));
     }
 
     static float SINH(float a) {
-        return (float)(Math.sinh((double)a));
+        return (float)(scalar_sinh(a));
     }
 
     static float strictSINH(float a) {
-        return (float)(StrictMath.sinh((double)a));
+        return (float)(strict_scalar_sinh(a));
     }
 
     @Test(dataProvider = "floatUnaryOpProvider")
@@ -4313,11 +4512,11 @@ relativeError));
     }
 
     static float COSH(float a) {
-        return (float)(Math.cosh((double)a));
+        return (float)(scalar_cosh(a));
     }
 
     static float strictCOSH(float a) {
-        return (float)(StrictMath.cosh((double)a));
+        return (float)(strict_scalar_cosh(a));
     }
 
     @Test(dataProvider = "floatUnaryOpProvider")
@@ -4336,11 +4535,11 @@ relativeError));
     }
 
     static float TANH(float a) {
-        return (float)(Math.tanh((double)a));
+        return (float)(scalar_tanh(a));
     }
 
     static float strictTANH(float a) {
-        return (float)(StrictMath.tanh((double)a));
+        return (float)(strict_scalar_tanh(a));
     }
 
     @Test(dataProvider = "floatUnaryOpProvider")
@@ -4359,11 +4558,11 @@ relativeError));
     }
 
     static float ASIN(float a) {
-        return (float)(Math.asin((double)a));
+        return (float)(scalar_asin(a));
     }
 
     static float strictASIN(float a) {
-        return (float)(StrictMath.asin((double)a));
+        return (float)(strict_scalar_asin(a));
     }
 
     @Test(dataProvider = "floatUnaryOpProvider")
@@ -4382,11 +4581,11 @@ relativeError));
     }
 
     static float ACOS(float a) {
-        return (float)(Math.acos((double)a));
+        return (float)(scalar_acos(a));
     }
 
     static float strictACOS(float a) {
-        return (float)(StrictMath.acos((double)a));
+        return (float)(strict_scalar_acos(a));
     }
 
     @Test(dataProvider = "floatUnaryOpProvider")
@@ -4405,11 +4604,11 @@ relativeError));
     }
 
     static float ATAN(float a) {
-        return (float)(Math.atan((double)a));
+        return (float)(scalar_atan(a));
     }
 
     static float strictATAN(float a) {
-        return (float)(StrictMath.atan((double)a));
+        return (float)(strict_scalar_atan(a));
     }
 
     @Test(dataProvider = "floatUnaryOpProvider")
@@ -4428,11 +4627,11 @@ relativeError));
     }
 
     static float CBRT(float a) {
-        return (float)(Math.cbrt((double)a));
+        return (float)(scalar_cbrt(a));
     }
 
     static float strictCBRT(float a) {
-        return (float)(StrictMath.cbrt((double)a));
+        return (float)(strict_scalar_cbrt(a));
     }
 
     @Test(dataProvider = "floatUnaryOpProvider")
@@ -4451,11 +4650,11 @@ relativeError));
     }
 
     static float HYPOT(float a, float b) {
-        return (float)(Math.hypot((double)a, (double)b));
+        return (float)(scalar_hypot(a, b));
     }
 
     static float strictHYPOT(float a, float b) {
-        return (float)(StrictMath.hypot((double)a, (double)b));
+        return (float)(strict_scalar_hypot(a, b));
     }
 
     @Test(dataProvider = "floatBinaryOpProvider")
@@ -4477,11 +4676,11 @@ relativeError));
 
 
     static float POW(float a, float b) {
-        return (float)(Math.pow((double)a, (double)b));
+        return (float)(scalar_pow(a, b));
     }
 
     static float strictPOW(float a, float b) {
-        return (float)(StrictMath.pow((double)a, (double)b));
+        return (float)(strict_scalar_pow(a, b));
     }
 
     @Test(dataProvider = "floatBinaryOpProvider")
@@ -4503,11 +4702,11 @@ relativeError));
 
 
     static float pow(float a, float b) {
-        return (float)(Math.pow((double)a, (double)b));
+        return (float)(scalar_pow(a, b));
     }
 
     static float strictpow(float a, float b) {
-        return (float)(StrictMath.pow((double)a, (double)b));
+        return (float)(strict_scalar_pow(a, b));
     }
 
     @Test(dataProvider = "floatBinaryOpProvider")
@@ -4529,11 +4728,11 @@ relativeError));
 
 
     static float ATAN2(float a, float b) {
-        return (float)(Math.atan2((double)a, (double)b));
+        return (float)(scalar_atan2(a, b));
     }
 
     static float strictATAN2(float a, float b) {
-        return (float)(StrictMath.atan2((double)a, (double)b));
+        return (float)(strict_scalar_atan2(a, b));
     }
 
     @Test(dataProvider = "floatBinaryOpProvider")
@@ -4585,11 +4784,11 @@ relativeError));
 
 
     static float FMA(float a, float b, float c) {
-        return (float)(Math.fma(a, b, c));
+        return (float)(scalar_fma(a, b, c));
     }
 
     static float fma(float a, float b, float c) {
-        return (float)(Math.fma(a, b, c));
+        return (float)(scalar_fma(a, b, c));
     }
 
     @Test(dataProvider = "floatTernaryOpProvider")
@@ -4767,11 +4966,11 @@ relativeError));
     }
 
     static float NEG(float a) {
-        return (float)(-((float)a));
+        return (float)(scalar_neg((float)a));
     }
 
     static float neg(float a) {
-        return (float)(-((float)a));
+        return (float)(scalar_neg((float)a));
     }
 
     @Test(dataProvider = "floatUnaryOpProvider")
@@ -4823,11 +5022,11 @@ relativeError));
     }
 
     static float ABS(float a) {
-        return (float)(Math.abs((float)a));
+        return (float)(scalar_abs((float)a));
     }
 
     static float abs(float a) {
-        return (float)(Math.abs((float)a));
+        return (float)(scalar_abs((float)a));
     }
 
     @Test(dataProvider = "floatUnaryOpProvider")
@@ -4879,11 +5078,11 @@ relativeError));
     }
 
     static float SQRT(float a) {
-        return (float)(Math.sqrt((double)a));
+        return (float)(scalar_sqrt(a));
     }
 
     static float sqrt(float a) {
-        return (float)(Math.sqrt((double)a));
+        return (float)(scalar_sqrt(a));
     }
 
     @Test(dataProvider = "floatUnaryOpProvider")
@@ -5096,7 +5295,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] < b[i]);
+                assertEquals(mv.laneIsSet(j), lt(a[i + j], b[i]));
             }
         }
     }
@@ -5112,7 +5311,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] == b[i]);
+                assertEquals(mv.laneIsSet(j), eq(a[i + j], b[i]));
             }
         }
     }
@@ -5181,7 +5380,7 @@ relativeError));
     static long ADDReduceLong(float[] a, int idx) {
         float res = 0;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res += a[i];
+            res = scalar_add(res, a[i]);
         }
 
         return (long)res;
@@ -5190,7 +5389,7 @@ relativeError));
     static long ADDReduceAllLong(float[] a) {
         long res = 0;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduceLong(a, i);
+            res = (long)scalar_add((float)res, (float)ADDReduceLong(a, i));
         }
 
         return res;
@@ -5208,8 +5407,8 @@ relativeError));
         }
 
         ra = 0;
-        for (int i = 0; i < a.length; i ++) {
-            ra += r[i];
+        for (int i = 0; i < a.length; i++) {
+            ra = (long)scalar_add((float)ra, (float)r[i]);
         }
 
         assertReductionLongArraysEquals(r, ra, a,
@@ -5219,8 +5418,9 @@ relativeError));
     static long ADDReduceLongMasked(float[] a, int idx, boolean[] mask) {
         float res = 0;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            if(mask[i % SPECIES.length()])
-                res += a[i];
+            if (mask[i % SPECIES.length()]) {
+                res = scalar_add(res, a[i]);
+            }
         }
 
         return (long)res;
@@ -5229,7 +5429,7 @@ relativeError));
     static long ADDReduceAllLongMasked(float[] a, boolean[] mask) {
         long res = 0;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduceLongMasked(a, i, mask);
+            res = (long)scalar_add((float)res, (float)ADDReduceLongMasked(a, i, mask));
         }
 
         return res;
@@ -5249,8 +5449,8 @@ relativeError));
         }
 
         ra = 0;
-        for (int i = 0; i < a.length; i ++) {
-            ra += r[i];
+        for (int i = 0; i < a.length; i++) {
+            ra = (long)scalar_add((float)ra, (float)r[i]);
         }
 
         assertReductionLongArraysEqualsMasked(r, ra, a, mask,
diff --git a/test/jdk/jdk/incubator/vector/FloatVectorMaxTests.java b/test/jdk/jdk/incubator/vector/FloatVectorMaxTests.java
index 9d272f43863..9b84e852c1c 100644
--- a/test/jdk/jdk/incubator/vector/FloatVectorMaxTests.java
+++ b/test/jdk/jdk/incubator/vector/FloatVectorMaxTests.java
@@ -1607,6 +1607,205 @@ relativeError));
         return Float.compare(a, (float) 0) != 0 ? a : b;
     }
 
+
+    static float scalar_add(float a, float b) {
+        return (float)(a + b);
+    }
+
+    static float scalar_sub(float a, float b) {
+        return (float)(a - b);
+    }
+
+    static float scalar_mul(float a, float b) {
+        return (float)(a * b);
+    }
+
+    static float scalar_min(float a, float b) {
+        return (float)(Math.min(a, b));
+    }
+
+    static float scalar_max(float a, float b) {
+        return (float)(Math.max(a, b));
+    }
+
+    static float scalar_div(float a, float b) {
+        return (float)(a / b);
+    }
+
+    static float scalar_fma(float a, float b, float c) {
+        return (float)(Math.fma(a, b, c));
+    }
+
+    static float scalar_abs(float a) {
+        return (float)(Math.abs(a));
+    }
+
+    static float scalar_neg(float a) {
+        return ((float)-a);
+    }
+
+    static float scalar_sin(float a) {
+        return (float)Math.sin((double)a);
+    }
+
+    static float scalar_exp(float a) {
+        return (float)Math.exp((double)a);
+    }
+
+    static float scalar_log1p(float a) {
+        return (float)Math.log1p((double)a);
+    }
+
+    static float scalar_log(float a) {
+        return (float)Math.log((double)a);
+    }
+
+    static float scalar_log10(float a) {
+        return (float)Math.log10((double)a);
+    }
+
+    static float scalar_expm1(float a) {
+        return (float)Math.expm1((double)a);
+    }
+
+    static float scalar_cos(float a) {
+        return (float)Math.cos((double)a);
+    }
+
+    static float scalar_tan(float a) {
+        return (float)Math.tan((double)a);
+    }
+
+    static float scalar_sinh(float a) {
+        return (float)Math.sinh((double)a);
+    }
+
+    static float scalar_cosh(float a) {
+        return (float)Math.cosh((double)a);
+    }
+
+    static float scalar_tanh(float a) {
+        return (float)Math.tanh((double)a);
+    }
+
+    static float scalar_asin(float a) {
+        return (float)Math.asin((double)a);
+    }
+
+    static float scalar_acos(float a) {
+        return (float)Math.acos((double)a);
+    }
+
+    static float scalar_atan(float a) {
+        return (float)Math.atan((double)a);
+    }
+
+    static float scalar_cbrt(float a) {
+        return (float)Math.cbrt((double)a);
+    }
+
+    static float scalar_sqrt(float a) {
+        return (float)Math.sqrt((double)a);
+    }
+
+    static float scalar_hypot(float a, float b) {
+        return (float)Math.hypot((double)a, (double)b);
+    }
+
+    static float scalar_pow(float a, float b) {
+        return (float)Math.pow((double)a, (double)b);
+    }
+
+    static float scalar_atan2(float a, float b) {
+        return (float)Math.atan2((double)a, (double)b);
+    }
+
+    static float strict_scalar_sin(float a) {
+        return (float)StrictMath.sin((double)a);
+    }
+
+    static float strict_scalar_exp(float a) {
+        return (float)StrictMath.exp((double)a);
+    }
+
+    static float strict_scalar_log1p(float a) {
+        return (float)StrictMath.log1p((double)a);
+    }
+
+    static float strict_scalar_log(float a) {
+        return (float)StrictMath.log((double)a);
+    }
+
+    static float strict_scalar_log10(float a) {
+        return (float)StrictMath.log10((double)a);
+    }
+
+    static float strict_scalar_expm1(float a) {
+        return (float)StrictMath.expm1((double)a);
+    }
+
+    static float strict_scalar_cos(float a) {
+        return (float)StrictMath.cos((double)a);
+    }
+
+    static float strict_scalar_tan(float a) {
+        return (float)StrictMath.tan((double)a);
+    }
+
+    static float strict_scalar_sinh(float a) {
+        return (float)StrictMath.sinh((double)a);
+    }
+
+    static float strict_scalar_cosh(float a) {
+        return (float)StrictMath.cosh((double)a);
+    }
+
+    static float strict_scalar_tanh(float a) {
+        return (float)StrictMath.tanh((double)a);
+    }
+
+    static float strict_scalar_asin(float a) {
+        return (float)StrictMath.asin((double)a);
+    }
+
+    static float strict_scalar_acos(float a) {
+        return (float)StrictMath.acos((double)a);
+    }
+
+    static float strict_scalar_atan(float a) {
+        return (float)StrictMath.atan((double)a);
+    }
+
+    static float strict_scalar_cbrt(float a) {
+        return (float)StrictMath.cbrt((double)a);
+    }
+
+    static float strict_scalar_sqrt(float a) {
+        return (float)StrictMath.sqrt((double)a);
+    }
+
+    static float strict_scalar_hypot(float a, float b) {
+        return (float)StrictMath.hypot((double)a, (double)b);
+    }
+
+    static float strict_scalar_pow(float a, float b) {
+        return (float)StrictMath.pow((double)a, (double)b);
+    }
+
+    static float strict_scalar_atan2(float a, float b) {
+        return (float)StrictMath.atan2((double)a, (double)b);
+    }
+
+    static boolean isNaN(float a) {
+        return Float.isNaN(a);
+    }
+    static boolean isFinite(float a) {
+        return Float.isFinite(a);
+    }
+    static boolean isInfinite(float a) {
+        return Float.isInfinite(a);
+    }
+
     @Test
     static void smokeTest1() {
         FloatVector three = FloatVector.broadcast(SPECIES, (byte)-3);
@@ -1700,7 +1899,7 @@ relativeError));
     }
 
     static float ADD(float a, float b) {
-        return (float)(a + b);
+        return (float)(scalar_add(a, b));
     }
 
     @Test(dataProvider = "floatBinaryOpProvider")
@@ -1721,7 +1920,7 @@ relativeError));
     }
 
     static float add(float a, float b) {
-        return (float)(a + b);
+        return (float)(scalar_add(a, b));
     }
 
     @Test(dataProvider = "floatBinaryOpProvider")
@@ -1778,7 +1977,7 @@ relativeError));
     }
 
     static float SUB(float a, float b) {
-        return (float)(a - b);
+        return (float)(scalar_sub(a, b));
     }
 
     @Test(dataProvider = "floatBinaryOpProvider")
@@ -1799,7 +1998,7 @@ relativeError));
     }
 
     static float sub(float a, float b) {
-        return (float)(a - b);
+        return (float)(scalar_sub(a, b));
     }
 
     @Test(dataProvider = "floatBinaryOpProvider")
@@ -1856,7 +2055,7 @@ relativeError));
     }
 
     static float MUL(float a, float b) {
-        return (float)(a * b);
+        return (float)(scalar_mul(a, b));
     }
 
     @Test(dataProvider = "floatBinaryOpProvider")
@@ -1877,7 +2076,7 @@ relativeError));
     }
 
     static float mul(float a, float b) {
-        return (float)(a * b);
+        return (float)(scalar_mul(a, b));
     }
 
     @Test(dataProvider = "floatBinaryOpProvider")
@@ -1934,7 +2133,7 @@ relativeError));
     }
 
     static float DIV(float a, float b) {
-        return (float)(a / b);
+        return (float)(scalar_div(a, b));
     }
 
     @Test(dataProvider = "floatBinaryOpProvider")
@@ -1955,7 +2154,7 @@ relativeError));
     }
 
     static float div(float a, float b) {
-        return (float)(a / b);
+        return (float)(scalar_div(a, b));
     }
 
     @Test(dataProvider = "floatBinaryOpProvider")
@@ -2012,7 +2211,7 @@ relativeError));
     }
 
     static float FIRST_NONZERO(float a, float b) {
-        return (float)(Double.doubleToLongBits(a)!=0?a:b);
+        return (float)(firstNonZero(a, b));
     }
 
     @Test(dataProvider = "floatBinaryOpProvider")
@@ -2314,7 +2513,7 @@ relativeError));
     }
 
     static float MIN(float a, float b) {
-        return (float)(Math.min(a, b));
+        return (float)(scalar_min(a, b));
     }
 
     @Test(dataProvider = "floatBinaryOpProvider")
@@ -2335,7 +2534,7 @@ relativeError));
     }
 
     static float min(float a, float b) {
-        return (float)(Math.min(a, b));
+        return (float)(scalar_min(a, b));
     }
 
     @Test(dataProvider = "floatBinaryOpProvider")
@@ -2354,7 +2553,7 @@ relativeError));
     }
 
     static float MAX(float a, float b) {
-        return (float)(Math.max(a, b));
+        return (float)(scalar_max(a, b));
     }
 
     @Test(dataProvider = "floatBinaryOpProvider")
@@ -2375,7 +2574,7 @@ relativeError));
     }
 
     static float max(float a, float b) {
-        return (float)(Math.max(a, b));
+        return (float)(scalar_max(a, b));
     }
 
     @Test(dataProvider = "floatBinaryOpProvider")
@@ -2452,7 +2651,7 @@ relativeError));
     static float ADDReduce(float[] a, int idx) {
         float res = ADD_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res += a[i];
+            res = scalar_add(res, a[i]);
         }
 
         return res;
@@ -2461,7 +2660,7 @@ relativeError));
     static float ADDReduceAll(float[] a) {
         float res = ADD_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduce(a, i);
+            res = scalar_add(res, ADDReduce(a, i));
         }
 
         return res;
@@ -2479,7 +2678,7 @@ relativeError));
                 FloatVector av = FloatVector.fromArray(SPECIES, a, i);
                 float v = av.reduceLanes(VectorOperators.ADD);
                 r[i] = v;
-                ra += v;
+                ra = scalar_add(ra, v);
             }
         }
 
@@ -2492,20 +2691,20 @@ relativeError));
         float[] a = fa.apply(SPECIES.length());
         float id = ADD_IDENTITY;
 
-        assertEquals((float) (id + id), id,
+        assertEquals((float) (scalar_add(id, id)), id,
                             "ADD(ADD_IDENTITY, ADD_IDENTITY) != ADD_IDENTITY");
 
         float x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((float) (id + x), x);
-                assertEquals((float) (x + id), x);
+                assertEquals((float) (scalar_add(id, x)), x);
+                assertEquals((float) (scalar_add(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((float) (id + x), x,
+            assertEquals((float) (scalar_add(id, x)), x,
                                 "ADD(ADD_IDENTITY, " + x + ") != " + x);
-            assertEquals((float) (x + id), x,
+            assertEquals((float) (scalar_add(x, id)), x,
                                 "ADD(" + x + ", ADD_IDENTITY) != " + x);
         }
     }
@@ -2514,7 +2713,7 @@ relativeError));
         float res = ADD_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res += a[i];
+                res = scalar_add(res, a[i]);
         }
 
         return res;
@@ -2523,7 +2722,7 @@ relativeError));
     static float ADDReduceAllMasked(float[] a, boolean[] mask) {
         float res = ADD_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduceMasked(a, i, mask);
+            res = scalar_add(res, ADDReduceMasked(a, i, mask));
         }
 
         return res;
@@ -2543,7 +2742,7 @@ relativeError));
                 FloatVector av = FloatVector.fromArray(SPECIES, a, i);
                 float v = av.reduceLanes(VectorOperators.ADD, vmask);
                 r[i] = v;
-                ra += v;
+                ra = scalar_add(ra, v);
             }
         }
 
@@ -2554,7 +2753,7 @@ relativeError));
     static float MULReduce(float[] a, int idx) {
         float res = MUL_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res *= a[i];
+            res = scalar_mul(res, a[i]);
         }
 
         return res;
@@ -2563,7 +2762,7 @@ relativeError));
     static float MULReduceAll(float[] a) {
         float res = MUL_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res *= MULReduce(a, i);
+            res = scalar_mul(res, MULReduce(a, i));
         }
 
         return res;
@@ -2581,7 +2780,7 @@ relativeError));
                 FloatVector av = FloatVector.fromArray(SPECIES, a, i);
                 float v = av.reduceLanes(VectorOperators.MUL);
                 r[i] = v;
-                ra *= v;
+                ra = scalar_mul(ra, v);
             }
         }
 
@@ -2594,20 +2793,20 @@ relativeError));
         float[] a = fa.apply(SPECIES.length());
         float id = MUL_IDENTITY;
 
-        assertEquals((float) (id * id), id,
+        assertEquals((float) (scalar_mul(id, id)), id,
                             "MUL(MUL_IDENTITY, MUL_IDENTITY) != MUL_IDENTITY");
 
         float x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((float) (id * x), x);
-                assertEquals((float) (x * id), x);
+                assertEquals((float) (scalar_mul(id, x)), x);
+                assertEquals((float) (scalar_mul(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((float) (id * x), x,
+            assertEquals((float) (scalar_mul(id, x)), x,
                                 "MUL(MUL_IDENTITY, " + x + ") != " + x);
-            assertEquals((float) (x * id), x,
+            assertEquals((float) (scalar_mul(x, id)), x,
                                 "MUL(" + x + ", MUL_IDENTITY) != " + x);
         }
     }
@@ -2616,7 +2815,7 @@ relativeError));
         float res = MUL_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res *= a[i];
+                res = scalar_mul(res, a[i]);
         }
 
         return res;
@@ -2625,7 +2824,7 @@ relativeError));
     static float MULReduceAllMasked(float[] a, boolean[] mask) {
         float res = MUL_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res *= MULReduceMasked(a, i, mask);
+            res = scalar_mul(res, MULReduceMasked(a, i, mask));
         }
 
         return res;
@@ -2645,7 +2844,7 @@ relativeError));
                 FloatVector av = FloatVector.fromArray(SPECIES, a, i);
                 float v = av.reduceLanes(VectorOperators.MUL, vmask);
                 r[i] = v;
-                ra *= v;
+                ra = scalar_mul(ra, v);
             }
         }
 
@@ -2656,7 +2855,7 @@ relativeError));
     static float MINReduce(float[] a, int idx) {
         float res = MIN_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res = (float) Math.min(res, a[i]);
+            res = scalar_min(res, a[i]);
         }
 
         return res;
@@ -2665,7 +2864,7 @@ relativeError));
     static float MINReduceAll(float[] a) {
         float res = MIN_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (float) Math.min(res, MINReduce(a, i));
+            res = scalar_min(res, MINReduce(a, i));
         }
 
         return res;
@@ -2683,7 +2882,7 @@ relativeError));
                 FloatVector av = FloatVector.fromArray(SPECIES, a, i);
                 float v = av.reduceLanes(VectorOperators.MIN);
                 r[i] = v;
-                ra = (float) Math.min(ra, v);
+                ra = scalar_min(ra, v);
             }
         }
 
@@ -2696,20 +2895,20 @@ relativeError));
         float[] a = fa.apply(SPECIES.length());
         float id = MIN_IDENTITY;
 
-        assertEquals((float) Math.min(id, id), id,
+        assertEquals(scalar_min(id, id), id,
                             "MIN(MIN_IDENTITY, MIN_IDENTITY) != MIN_IDENTITY");
 
         float x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((float) Math.min(id, x), x);
-                assertEquals((float) Math.min(x, id), x);
+                assertEquals(scalar_min(id, x), x);
+                assertEquals(scalar_min(x, id), x);
             }
         } catch (AssertionError e) {
-            assertEquals((float) Math.min(id, x), x,
+            assertEquals(scalar_min(id, x), x,
                                 "MIN(MIN_IDENTITY, " + x + ") != " + x);
-            assertEquals((float) Math.min(x, id), x,
+            assertEquals(scalar_min(x, id), x,
                                 "MIN(" + x + ", MIN_IDENTITY) != " + x);
         }
     }
@@ -2718,7 +2917,7 @@ relativeError));
         float res = MIN_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res = (float) Math.min(res, a[i]);
+                res = scalar_min(res, a[i]);
         }
 
         return res;
@@ -2727,7 +2926,7 @@ relativeError));
     static float MINReduceAllMasked(float[] a, boolean[] mask) {
         float res = MIN_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (float) Math.min(res, MINReduceMasked(a, i, mask));
+            res = scalar_min(res, MINReduceMasked(a, i, mask));
         }
 
         return res;
@@ -2747,7 +2946,7 @@ relativeError));
                 FloatVector av = FloatVector.fromArray(SPECIES, a, i);
                 float v = av.reduceLanes(VectorOperators.MIN, vmask);
                 r[i] = v;
-                ra = (float) Math.min(ra, v);
+                ra = scalar_min(ra, v);
             }
         }
 
@@ -2758,7 +2957,7 @@ relativeError));
     static float MAXReduce(float[] a, int idx) {
         float res = MAX_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res = (float) Math.max(res, a[i]);
+            res = scalar_max(res, a[i]);
         }
 
         return res;
@@ -2767,7 +2966,7 @@ relativeError));
     static float MAXReduceAll(float[] a) {
         float res = MAX_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (float) Math.max(res, MAXReduce(a, i));
+            res = scalar_max(res, MAXReduce(a, i));
         }
 
         return res;
@@ -2785,7 +2984,7 @@ relativeError));
                 FloatVector av = FloatVector.fromArray(SPECIES, a, i);
                 float v = av.reduceLanes(VectorOperators.MAX);
                 r[i] = v;
-                ra = (float) Math.max(ra, v);
+                ra = scalar_max(ra, v);
             }
         }
 
@@ -2798,20 +2997,20 @@ relativeError));
         float[] a = fa.apply(SPECIES.length());
         float id = MAX_IDENTITY;
 
-        assertEquals((float) Math.max(id, id), id,
+        assertEquals(scalar_max(id, id), id,
                             "MAX(MAX_IDENTITY, MAX_IDENTITY) != MAX_IDENTITY");
 
         float x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((float) Math.max(id, x), x);
-                assertEquals((float) Math.max(x, id), x);
+                assertEquals(scalar_max(id, x), x);
+                assertEquals(scalar_max(x, id), x);
             }
         } catch (AssertionError e) {
-            assertEquals((float) Math.max(id, x), x,
+            assertEquals(scalar_max(id, x), x,
                                 "MAX(MAX_IDENTITY, " + x + ") != " + x);
-            assertEquals((float) Math.max(x, id), x,
+            assertEquals(scalar_max(x, id), x,
                                 "MAX(" + x + ", MAX_IDENTITY) != " + x);
         }
     }
@@ -2820,7 +3019,7 @@ relativeError));
         float res = MAX_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res = (float) Math.max(res, a[i]);
+                res = scalar_max(res, a[i]);
         }
 
         return res;
@@ -2829,7 +3028,7 @@ relativeError));
     static float MAXReduceAllMasked(float[] a, boolean[] mask) {
         float res = MAX_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (float) Math.max(res, MAXReduceMasked(a, i, mask));
+            res = scalar_max(res, MAXReduceMasked(a, i, mask));
         }
 
         return res;
@@ -2849,7 +3048,7 @@ relativeError));
                 FloatVector av = FloatVector.fromArray(SPECIES, a, i);
                 float v = av.reduceLanes(VectorOperators.MAX, vmask);
                 r[i] = v;
-                ra = (float) Math.max(ra, v);
+                ra = scalar_max(ra, v);
             }
         }
 
@@ -3061,7 +3260,7 @@ relativeError));
     }
 
     static boolean testIS_FINITE(float a) {
-        return Float.isFinite(a);
+        return isFinite(a);
     }
 
     @Test(dataProvider = "floatTestOpProvider")
@@ -3102,7 +3301,7 @@ relativeError));
     }
 
     static boolean testIS_NAN(float a) {
-        return Float.isNaN(a);
+        return isNaN(a);
     }
 
     @Test(dataProvider = "floatTestOpProvider")
@@ -3143,7 +3342,7 @@ relativeError));
     }
 
     static boolean testIS_INFINITE(float a) {
-        return Float.isInfinite(a);
+        return isInfinite(a);
     }
 
     @Test(dataProvider = "floatTestOpProvider")
@@ -3484,7 +3683,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] < b[i]);
+                assertEquals(mv.laneIsSet(j), lt(a[i + j], b[i]));
             }
         }
     }
@@ -3504,7 +3703,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] < b[i]));
+                assertEquals(mv.laneIsSet(j), mask[j] && (lt(a[i + j], b[i])));
             }
         }
     }
@@ -3520,7 +3719,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] < (float)((long)b[i]));
+                assertEquals(mv.laneIsSet(j), lt(a[i + j], (float)((long)b[i])));
             }
         }
     }
@@ -3540,7 +3739,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] < (float)((long)b[i])));
+                assertEquals(mv.laneIsSet(j), mask[j] && (lt(a[i + j], (float)((long)b[i]))));
             }
         }
     }
@@ -3556,7 +3755,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] == b[i]);
+                assertEquals(mv.laneIsSet(j), eq(a[i + j], b[i]));
             }
         }
     }
@@ -3576,7 +3775,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] == b[i]));
+                assertEquals(mv.laneIsSet(j), mask[j] && (eq(a[i + j], b[i])));
             }
         }
     }
@@ -3592,7 +3791,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] == (float)((long)b[i]));
+                assertEquals(mv.laneIsSet(j), eq(a[i + j], (float)((long)b[i])));
             }
         }
     }
@@ -3612,7 +3811,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] == (float)((long)b[i])));
+                assertEquals(mv.laneIsSet(j), mask[j] && (eq(a[i + j], (float)((long)b[i]))));
             }
         }
     }
@@ -4112,11 +4311,11 @@ relativeError));
     }
 
     static float SIN(float a) {
-        return (float)(Math.sin((double)a));
+        return (float)(scalar_sin(a));
     }
 
     static float strictSIN(float a) {
-        return (float)(StrictMath.sin((double)a));
+        return (float)(strict_scalar_sin(a));
     }
 
     @Test(dataProvider = "floatUnaryOpProvider")
@@ -4135,11 +4334,11 @@ relativeError));
     }
 
     static float EXP(float a) {
-        return (float)(Math.exp((double)a));
+        return (float)(scalar_exp(a));
     }
 
     static float strictEXP(float a) {
-        return (float)(StrictMath.exp((double)a));
+        return (float)(strict_scalar_exp(a));
     }
 
     @Test(dataProvider = "floatUnaryOpProvider")
@@ -4158,11 +4357,11 @@ relativeError));
     }
 
     static float LOG1P(float a) {
-        return (float)(Math.log1p((double)a));
+        return (float)(scalar_log1p(a));
     }
 
     static float strictLOG1P(float a) {
-        return (float)(StrictMath.log1p((double)a));
+        return (float)(strict_scalar_log1p(a));
     }
 
     @Test(dataProvider = "floatUnaryOpProvider")
@@ -4181,11 +4380,11 @@ relativeError));
     }
 
     static float LOG(float a) {
-        return (float)(Math.log((double)a));
+        return (float)(scalar_log(a));
     }
 
     static float strictLOG(float a) {
-        return (float)(StrictMath.log((double)a));
+        return (float)(strict_scalar_log(a));
     }
 
     @Test(dataProvider = "floatUnaryOpProvider")
@@ -4204,11 +4403,11 @@ relativeError));
     }
 
     static float LOG10(float a) {
-        return (float)(Math.log10((double)a));
+        return (float)(scalar_log10(a));
     }
 
     static float strictLOG10(float a) {
-        return (float)(StrictMath.log10((double)a));
+        return (float)(strict_scalar_log10(a));
     }
 
     @Test(dataProvider = "floatUnaryOpProvider")
@@ -4227,11 +4426,11 @@ relativeError));
     }
 
     static float EXPM1(float a) {
-        return (float)(Math.expm1((double)a));
+        return (float)(scalar_expm1(a));
     }
 
     static float strictEXPM1(float a) {
-        return (float)(StrictMath.expm1((double)a));
+        return (float)(strict_scalar_expm1(a));
     }
 
     @Test(dataProvider = "floatUnaryOpProvider")
@@ -4250,11 +4449,11 @@ relativeError));
     }
 
     static float COS(float a) {
-        return (float)(Math.cos((double)a));
+        return (float)(scalar_cos(a));
     }
 
     static float strictCOS(float a) {
-        return (float)(StrictMath.cos((double)a));
+        return (float)(strict_scalar_cos(a));
     }
 
     @Test(dataProvider = "floatUnaryOpProvider")
@@ -4273,11 +4472,11 @@ relativeError));
     }
 
     static float TAN(float a) {
-        return (float)(Math.tan((double)a));
+        return (float)(scalar_tan(a));
     }
 
     static float strictTAN(float a) {
-        return (float)(StrictMath.tan((double)a));
+        return (float)(strict_scalar_tan(a));
     }
 
     @Test(dataProvider = "floatUnaryOpProvider")
@@ -4296,11 +4495,11 @@ relativeError));
     }
 
     static float SINH(float a) {
-        return (float)(Math.sinh((double)a));
+        return (float)(scalar_sinh(a));
     }
 
     static float strictSINH(float a) {
-        return (float)(StrictMath.sinh((double)a));
+        return (float)(strict_scalar_sinh(a));
     }
 
     @Test(dataProvider = "floatUnaryOpProvider")
@@ -4319,11 +4518,11 @@ relativeError));
     }
 
     static float COSH(float a) {
-        return (float)(Math.cosh((double)a));
+        return (float)(scalar_cosh(a));
     }
 
     static float strictCOSH(float a) {
-        return (float)(StrictMath.cosh((double)a));
+        return (float)(strict_scalar_cosh(a));
     }
 
     @Test(dataProvider = "floatUnaryOpProvider")
@@ -4342,11 +4541,11 @@ relativeError));
     }
 
     static float TANH(float a) {
-        return (float)(Math.tanh((double)a));
+        return (float)(scalar_tanh(a));
     }
 
     static float strictTANH(float a) {
-        return (float)(StrictMath.tanh((double)a));
+        return (float)(strict_scalar_tanh(a));
     }
 
     @Test(dataProvider = "floatUnaryOpProvider")
@@ -4365,11 +4564,11 @@ relativeError));
     }
 
     static float ASIN(float a) {
-        return (float)(Math.asin((double)a));
+        return (float)(scalar_asin(a));
     }
 
     static float strictASIN(float a) {
-        return (float)(StrictMath.asin((double)a));
+        return (float)(strict_scalar_asin(a));
     }
 
     @Test(dataProvider = "floatUnaryOpProvider")
@@ -4388,11 +4587,11 @@ relativeError));
     }
 
     static float ACOS(float a) {
-        return (float)(Math.acos((double)a));
+        return (float)(scalar_acos(a));
     }
 
     static float strictACOS(float a) {
-        return (float)(StrictMath.acos((double)a));
+        return (float)(strict_scalar_acos(a));
     }
 
     @Test(dataProvider = "floatUnaryOpProvider")
@@ -4411,11 +4610,11 @@ relativeError));
     }
 
     static float ATAN(float a) {
-        return (float)(Math.atan((double)a));
+        return (float)(scalar_atan(a));
     }
 
     static float strictATAN(float a) {
-        return (float)(StrictMath.atan((double)a));
+        return (float)(strict_scalar_atan(a));
     }
 
     @Test(dataProvider = "floatUnaryOpProvider")
@@ -4434,11 +4633,11 @@ relativeError));
     }
 
     static float CBRT(float a) {
-        return (float)(Math.cbrt((double)a));
+        return (float)(scalar_cbrt(a));
     }
 
     static float strictCBRT(float a) {
-        return (float)(StrictMath.cbrt((double)a));
+        return (float)(strict_scalar_cbrt(a));
     }
 
     @Test(dataProvider = "floatUnaryOpProvider")
@@ -4457,11 +4656,11 @@ relativeError));
     }
 
     static float HYPOT(float a, float b) {
-        return (float)(Math.hypot((double)a, (double)b));
+        return (float)(scalar_hypot(a, b));
     }
 
     static float strictHYPOT(float a, float b) {
-        return (float)(StrictMath.hypot((double)a, (double)b));
+        return (float)(strict_scalar_hypot(a, b));
     }
 
     @Test(dataProvider = "floatBinaryOpProvider")
@@ -4483,11 +4682,11 @@ relativeError));
 
 
     static float POW(float a, float b) {
-        return (float)(Math.pow((double)a, (double)b));
+        return (float)(scalar_pow(a, b));
     }
 
     static float strictPOW(float a, float b) {
-        return (float)(StrictMath.pow((double)a, (double)b));
+        return (float)(strict_scalar_pow(a, b));
     }
 
     @Test(dataProvider = "floatBinaryOpProvider")
@@ -4509,11 +4708,11 @@ relativeError));
 
 
     static float pow(float a, float b) {
-        return (float)(Math.pow((double)a, (double)b));
+        return (float)(scalar_pow(a, b));
     }
 
     static float strictpow(float a, float b) {
-        return (float)(StrictMath.pow((double)a, (double)b));
+        return (float)(strict_scalar_pow(a, b));
     }
 
     @Test(dataProvider = "floatBinaryOpProvider")
@@ -4535,11 +4734,11 @@ relativeError));
 
 
     static float ATAN2(float a, float b) {
-        return (float)(Math.atan2((double)a, (double)b));
+        return (float)(scalar_atan2(a, b));
     }
 
     static float strictATAN2(float a, float b) {
-        return (float)(StrictMath.atan2((double)a, (double)b));
+        return (float)(strict_scalar_atan2(a, b));
     }
 
     @Test(dataProvider = "floatBinaryOpProvider")
@@ -4591,11 +4790,11 @@ relativeError));
 
 
     static float FMA(float a, float b, float c) {
-        return (float)(Math.fma(a, b, c));
+        return (float)(scalar_fma(a, b, c));
     }
 
     static float fma(float a, float b, float c) {
-        return (float)(Math.fma(a, b, c));
+        return (float)(scalar_fma(a, b, c));
     }
 
     @Test(dataProvider = "floatTernaryOpProvider")
@@ -4773,11 +4972,11 @@ relativeError));
     }
 
     static float NEG(float a) {
-        return (float)(-((float)a));
+        return (float)(scalar_neg((float)a));
     }
 
     static float neg(float a) {
-        return (float)(-((float)a));
+        return (float)(scalar_neg((float)a));
     }
 
     @Test(dataProvider = "floatUnaryOpProvider")
@@ -4829,11 +5028,11 @@ relativeError));
     }
 
     static float ABS(float a) {
-        return (float)(Math.abs((float)a));
+        return (float)(scalar_abs((float)a));
     }
 
     static float abs(float a) {
-        return (float)(Math.abs((float)a));
+        return (float)(scalar_abs((float)a));
     }
 
     @Test(dataProvider = "floatUnaryOpProvider")
@@ -4885,11 +5084,11 @@ relativeError));
     }
 
     static float SQRT(float a) {
-        return (float)(Math.sqrt((double)a));
+        return (float)(scalar_sqrt(a));
     }
 
     static float sqrt(float a) {
-        return (float)(Math.sqrt((double)a));
+        return (float)(scalar_sqrt(a));
     }
 
     @Test(dataProvider = "floatUnaryOpProvider")
@@ -5102,7 +5301,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] < b[i]);
+                assertEquals(mv.laneIsSet(j), lt(a[i + j], b[i]));
             }
         }
     }
@@ -5118,7 +5317,7 @@ relativeError));
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] == b[i]);
+                assertEquals(mv.laneIsSet(j), eq(a[i + j], b[i]));
             }
         }
     }
@@ -5187,7 +5386,7 @@ relativeError));
     static long ADDReduceLong(float[] a, int idx) {
         float res = 0;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res += a[i];
+            res = scalar_add(res, a[i]);
         }
 
         return (long)res;
@@ -5196,7 +5395,7 @@ relativeError));
     static long ADDReduceAllLong(float[] a) {
         long res = 0;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduceLong(a, i);
+            res = (long)scalar_add((float)res, (float)ADDReduceLong(a, i));
         }
 
         return res;
@@ -5214,8 +5413,8 @@ relativeError));
         }
 
         ra = 0;
-        for (int i = 0; i < a.length; i ++) {
-            ra += r[i];
+        for (int i = 0; i < a.length; i++) {
+            ra = (long)scalar_add((float)ra, (float)r[i]);
         }
 
         assertReductionLongArraysEquals(r, ra, a,
@@ -5225,8 +5424,9 @@ relativeError));
     static long ADDReduceLongMasked(float[] a, int idx, boolean[] mask) {
         float res = 0;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            if(mask[i % SPECIES.length()])
-                res += a[i];
+            if (mask[i % SPECIES.length()]) {
+                res = scalar_add(res, a[i]);
+            }
         }
 
         return (long)res;
@@ -5235,7 +5435,7 @@ relativeError));
     static long ADDReduceAllLongMasked(float[] a, boolean[] mask) {
         long res = 0;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduceLongMasked(a, i, mask);
+            res = (long)scalar_add((float)res, (float)ADDReduceLongMasked(a, i, mask));
         }
 
         return res;
@@ -5255,8 +5455,8 @@ relativeError));
         }
 
         ra = 0;
-        for (int i = 0; i < a.length; i ++) {
-            ra += r[i];
+        for (int i = 0; i < a.length; i++) {
+            ra = (long)scalar_add((float)ra, (float)r[i]);
         }
 
         assertReductionLongArraysEqualsMasked(r, ra, a, mask,
diff --git a/test/jdk/jdk/incubator/vector/IntVector128Tests.java b/test/jdk/jdk/incubator/vector/IntVector128Tests.java
index ecdb23eb40d..d62f5d8df00 100644
--- a/test/jdk/jdk/incubator/vector/IntVector128Tests.java
+++ b/test/jdk/jdk/incubator/vector/IntVector128Tests.java
@@ -1531,6 +1531,59 @@ public class IntVector128Tests extends AbstractVectorTest {
         return a >= b;
     }
 
+    static int firstNonZero(int a, int b) {
+        return Integer.compare(a, (int) 0) != 0 ? a : b;
+    }
+
+    static int scalar_or(int a, int b) {
+        return (int)(a | b);
+    }
+
+    static int scalar_and(int a, int b) {
+        return (int)(a & b);
+    }
+
+    static int scalar_xor(int a, int b) {
+        return (int)(a ^ b);
+    }
+
+    static int scalar_add(int a, int b) {
+        return (int)(a + b);
+    }
+
+    static int scalar_sub(int a, int b) {
+        return (int)(a - b);
+    }
+
+    static int scalar_mul(int a, int b) {
+        return (int)(a * b);
+    }
+
+    static int scalar_min(int a, int b) {
+        return (int)(Math.min(a, b));
+    }
+
+    static int scalar_max(int a, int b) {
+        return (int)(Math.max(a, b));
+    }
+
+    static int scalar_div(int a, int b) {
+        return (int)(a / b);
+    }
+
+    static int scalar_fma(int a, int b, int c) {
+        return (int)(Math.fma(a, b, c));
+    }
+
+    static int scalar_abs(int a) {
+        return (int)(Math.abs(a));
+    }
+
+    static int scalar_neg(int a) {
+        return ((int)-a);
+    }
+
+
     static boolean ult(int a, int b) {
         return Integer.compareUnsigned(a, b) < 0;
     }
@@ -1547,9 +1600,6 @@ public class IntVector128Tests extends AbstractVectorTest {
         return Integer.compareUnsigned(a, b) >= 0;
     }
 
-    static int firstNonZero(int a, int b) {
-        return Integer.compare(a, (int) 0) != 0 ? a : b;
-    }
 
     @Test
     static void smokeTest1() {
@@ -1663,7 +1713,7 @@ public class IntVector128Tests extends AbstractVectorTest {
     }
 
     static int ADD(int a, int b) {
-        return (int)(a + b);
+        return (int)(scalar_add(a, b));
     }
 
     @Test(dataProvider = "intBinaryOpProvider")
@@ -1684,7 +1734,7 @@ public class IntVector128Tests extends AbstractVectorTest {
     }
 
     static int add(int a, int b) {
-        return (int)(a + b);
+        return (int)(scalar_add(a, b));
     }
 
     @Test(dataProvider = "intBinaryOpProvider")
@@ -1741,7 +1791,7 @@ public class IntVector128Tests extends AbstractVectorTest {
     }
 
     static int SUB(int a, int b) {
-        return (int)(a - b);
+        return (int)(scalar_sub(a, b));
     }
 
     @Test(dataProvider = "intBinaryOpProvider")
@@ -1762,7 +1812,7 @@ public class IntVector128Tests extends AbstractVectorTest {
     }
 
     static int sub(int a, int b) {
-        return (int)(a - b);
+        return (int)(scalar_sub(a, b));
     }
 
     @Test(dataProvider = "intBinaryOpProvider")
@@ -1819,7 +1869,7 @@ public class IntVector128Tests extends AbstractVectorTest {
     }
 
     static int MUL(int a, int b) {
-        return (int)(a * b);
+        return (int)(scalar_mul(a, b));
     }
 
     @Test(dataProvider = "intBinaryOpProvider")
@@ -1840,7 +1890,7 @@ public class IntVector128Tests extends AbstractVectorTest {
     }
 
     static int mul(int a, int b) {
-        return (int)(a * b);
+        return (int)(scalar_mul(a, b));
     }
 
     @Test(dataProvider = "intBinaryOpProvider")
@@ -1987,7 +2037,7 @@ public class IntVector128Tests extends AbstractVectorTest {
     }
 
     static int FIRST_NONZERO(int a, int b) {
-        return (int)((a)!=0?a:b);
+        return (int)(firstNonZero(a, b));
     }
 
     @Test(dataProvider = "intBinaryOpProvider")
@@ -3283,7 +3333,7 @@ public class IntVector128Tests extends AbstractVectorTest {
     }
 
     static int MIN(int a, int b) {
-        return (int)(Math.min(a, b));
+        return (int)(scalar_min(a, b));
     }
 
     @Test(dataProvider = "intBinaryOpProvider")
@@ -3304,7 +3354,7 @@ public class IntVector128Tests extends AbstractVectorTest {
     }
 
     static int min(int a, int b) {
-        return (int)(Math.min(a, b));
+        return (int)(scalar_min(a, b));
     }
 
     @Test(dataProvider = "intBinaryOpProvider")
@@ -3323,7 +3373,7 @@ public class IntVector128Tests extends AbstractVectorTest {
     }
 
     static int MAX(int a, int b) {
-        return (int)(Math.max(a, b));
+        return (int)(scalar_max(a, b));
     }
 
     @Test(dataProvider = "intBinaryOpProvider")
@@ -3344,7 +3394,7 @@ public class IntVector128Tests extends AbstractVectorTest {
     }
 
     static int max(int a, int b) {
-        return (int)(Math.max(a, b));
+        return (int)(scalar_max(a, b));
     }
 
     @Test(dataProvider = "intBinaryOpProvider")
@@ -3712,7 +3762,7 @@ public class IntVector128Tests extends AbstractVectorTest {
     static int ANDReduce(int[] a, int idx) {
         int res = AND_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res &= a[i];
+            res = scalar_and(res, a[i]);
         }
 
         return res;
@@ -3721,7 +3771,7 @@ public class IntVector128Tests extends AbstractVectorTest {
     static int ANDReduceAll(int[] a) {
         int res = AND_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res &= ANDReduce(a, i);
+            res = scalar_and(res, ANDReduce(a, i));
         }
 
         return res;
@@ -3739,7 +3789,7 @@ public class IntVector128Tests extends AbstractVectorTest {
                 IntVector av = IntVector.fromArray(SPECIES, a, i);
                 int v = av.reduceLanes(VectorOperators.AND);
                 r[i] = v;
-                ra &= v;
+                ra = scalar_and(ra, v);
             }
         }
 
@@ -3752,20 +3802,20 @@ public class IntVector128Tests extends AbstractVectorTest {
         int[] a = fa.apply(SPECIES.length());
         int id = AND_IDENTITY;
 
-        assertEquals((int) (id & id), id,
+        assertEquals((int) (scalar_and(id, id)), id,
                             "AND(AND_IDENTITY, AND_IDENTITY) != AND_IDENTITY");
 
         int x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((int) (id & x), x);
-                assertEquals((int) (x & id), x);
+                assertEquals((int) (scalar_and(id, x)), x);
+                assertEquals((int) (scalar_and(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((int) (id & x), x,
+            assertEquals((int) (scalar_and(id, x)), x,
                                 "AND(AND_IDENTITY, " + x + ") != " + x);
-            assertEquals((int) (x & id), x,
+            assertEquals((int) (scalar_and(x, id)), x,
                                 "AND(" + x + ", AND_IDENTITY) != " + x);
         }
     }
@@ -3774,7 +3824,7 @@ public class IntVector128Tests extends AbstractVectorTest {
         int res = AND_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res &= a[i];
+                res = scalar_and(res, a[i]);
         }
 
         return res;
@@ -3783,7 +3833,7 @@ public class IntVector128Tests extends AbstractVectorTest {
     static int ANDReduceAllMasked(int[] a, boolean[] mask) {
         int res = AND_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res &= ANDReduceMasked(a, i, mask);
+            res = scalar_and(res, ANDReduceMasked(a, i, mask));
         }
 
         return res;
@@ -3803,7 +3853,7 @@ public class IntVector128Tests extends AbstractVectorTest {
                 IntVector av = IntVector.fromArray(SPECIES, a, i);
                 int v = av.reduceLanes(VectorOperators.AND, vmask);
                 r[i] = v;
-                ra &= v;
+                ra = scalar_and(ra, v);
             }
         }
 
@@ -3814,7 +3864,7 @@ public class IntVector128Tests extends AbstractVectorTest {
     static int ORReduce(int[] a, int idx) {
         int res = OR_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res |= a[i];
+            res = scalar_or(res, a[i]);
         }
 
         return res;
@@ -3823,7 +3873,7 @@ public class IntVector128Tests extends AbstractVectorTest {
     static int ORReduceAll(int[] a) {
         int res = OR_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res |= ORReduce(a, i);
+            res = scalar_or(res, ORReduce(a, i));
         }
 
         return res;
@@ -3841,7 +3891,7 @@ public class IntVector128Tests extends AbstractVectorTest {
                 IntVector av = IntVector.fromArray(SPECIES, a, i);
                 int v = av.reduceLanes(VectorOperators.OR);
                 r[i] = v;
-                ra |= v;
+                ra = scalar_or(ra, v);
             }
         }
 
@@ -3854,20 +3904,20 @@ public class IntVector128Tests extends AbstractVectorTest {
         int[] a = fa.apply(SPECIES.length());
         int id = OR_IDENTITY;
 
-        assertEquals((int) (id | id), id,
+        assertEquals((int) (scalar_or(id, id)), id,
                             "OR(OR_IDENTITY, OR_IDENTITY) != OR_IDENTITY");
 
         int x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((int) (id | x), x);
-                assertEquals((int) (x | id), x);
+                assertEquals((int) (scalar_or(id, x)), x);
+                assertEquals((int) (scalar_or(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((int) (id | x), x,
+            assertEquals((int) (scalar_or(id, x)), x,
                                 "OR(OR_IDENTITY, " + x + ") != " + x);
-            assertEquals((int) (x | id), x,
+            assertEquals((int) (scalar_or(x, id)), x,
                                 "OR(" + x + ", OR_IDENTITY) != " + x);
         }
     }
@@ -3876,7 +3926,7 @@ public class IntVector128Tests extends AbstractVectorTest {
         int res = OR_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res |= a[i];
+                res = scalar_or(res, a[i]);
         }
 
         return res;
@@ -3885,7 +3935,7 @@ public class IntVector128Tests extends AbstractVectorTest {
     static int ORReduceAllMasked(int[] a, boolean[] mask) {
         int res = OR_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res |= ORReduceMasked(a, i, mask);
+            res = scalar_or(res, ORReduceMasked(a, i, mask));
         }
 
         return res;
@@ -3905,7 +3955,7 @@ public class IntVector128Tests extends AbstractVectorTest {
                 IntVector av = IntVector.fromArray(SPECIES, a, i);
                 int v = av.reduceLanes(VectorOperators.OR, vmask);
                 r[i] = v;
-                ra |= v;
+                ra = scalar_or(ra, v);
             }
         }
 
@@ -3916,7 +3966,7 @@ public class IntVector128Tests extends AbstractVectorTest {
     static int XORReduce(int[] a, int idx) {
         int res = XOR_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res ^= a[i];
+            res = scalar_xor(res, a[i]);
         }
 
         return res;
@@ -3925,7 +3975,7 @@ public class IntVector128Tests extends AbstractVectorTest {
     static int XORReduceAll(int[] a) {
         int res = XOR_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res ^= XORReduce(a, i);
+            res = scalar_xor(res, XORReduce(a, i));
         }
 
         return res;
@@ -3943,7 +3993,7 @@ public class IntVector128Tests extends AbstractVectorTest {
                 IntVector av = IntVector.fromArray(SPECIES, a, i);
                 int v = av.reduceLanes(VectorOperators.XOR);
                 r[i] = v;
-                ra ^= v;
+                ra = scalar_xor(ra, v);
             }
         }
 
@@ -3956,20 +4006,20 @@ public class IntVector128Tests extends AbstractVectorTest {
         int[] a = fa.apply(SPECIES.length());
         int id = XOR_IDENTITY;
 
-        assertEquals((int) (id ^ id), id,
+        assertEquals((int) (scalar_xor(id, id)), id,
                             "XOR(XOR_IDENTITY, XOR_IDENTITY) != XOR_IDENTITY");
 
         int x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((int) (id ^ x), x);
-                assertEquals((int) (x ^ id), x);
+                assertEquals((int) (scalar_xor(id, x)), x);
+                assertEquals((int) (scalar_xor(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((int) (id ^ x), x,
+            assertEquals((int) (scalar_xor(id, x)), x,
                                 "XOR(XOR_IDENTITY, " + x + ") != " + x);
-            assertEquals((int) (x ^ id), x,
+            assertEquals((int) (scalar_xor(x, id)), x,
                                 "XOR(" + x + ", XOR_IDENTITY) != " + x);
         }
     }
@@ -3978,7 +4028,7 @@ public class IntVector128Tests extends AbstractVectorTest {
         int res = XOR_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res ^= a[i];
+                res = scalar_xor(res, a[i]);
         }
 
         return res;
@@ -3987,7 +4037,7 @@ public class IntVector128Tests extends AbstractVectorTest {
     static int XORReduceAllMasked(int[] a, boolean[] mask) {
         int res = XOR_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res ^= XORReduceMasked(a, i, mask);
+            res = scalar_xor(res, XORReduceMasked(a, i, mask));
         }
 
         return res;
@@ -4007,7 +4057,7 @@ public class IntVector128Tests extends AbstractVectorTest {
                 IntVector av = IntVector.fromArray(SPECIES, a, i);
                 int v = av.reduceLanes(VectorOperators.XOR, vmask);
                 r[i] = v;
-                ra ^= v;
+                ra = scalar_xor(ra, v);
             }
         }
 
@@ -4018,7 +4068,7 @@ public class IntVector128Tests extends AbstractVectorTest {
     static int ADDReduce(int[] a, int idx) {
         int res = ADD_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res += a[i];
+            res = scalar_add(res, a[i]);
         }
 
         return res;
@@ -4027,7 +4077,7 @@ public class IntVector128Tests extends AbstractVectorTest {
     static int ADDReduceAll(int[] a) {
         int res = ADD_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduce(a, i);
+            res = scalar_add(res, ADDReduce(a, i));
         }
 
         return res;
@@ -4045,7 +4095,7 @@ public class IntVector128Tests extends AbstractVectorTest {
                 IntVector av = IntVector.fromArray(SPECIES, a, i);
                 int v = av.reduceLanes(VectorOperators.ADD);
                 r[i] = v;
-                ra += v;
+                ra = scalar_add(ra, v);
             }
         }
 
@@ -4058,20 +4108,20 @@ public class IntVector128Tests extends AbstractVectorTest {
         int[] a = fa.apply(SPECIES.length());
         int id = ADD_IDENTITY;
 
-        assertEquals((int) (id + id), id,
+        assertEquals((int) (scalar_add(id, id)), id,
                             "ADD(ADD_IDENTITY, ADD_IDENTITY) != ADD_IDENTITY");
 
         int x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((int) (id + x), x);
-                assertEquals((int) (x + id), x);
+                assertEquals((int) (scalar_add(id, x)), x);
+                assertEquals((int) (scalar_add(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((int) (id + x), x,
+            assertEquals((int) (scalar_add(id, x)), x,
                                 "ADD(ADD_IDENTITY, " + x + ") != " + x);
-            assertEquals((int) (x + id), x,
+            assertEquals((int) (scalar_add(x, id)), x,
                                 "ADD(" + x + ", ADD_IDENTITY) != " + x);
         }
     }
@@ -4080,7 +4130,7 @@ public class IntVector128Tests extends AbstractVectorTest {
         int res = ADD_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res += a[i];
+                res = scalar_add(res, a[i]);
         }
 
         return res;
@@ -4089,7 +4139,7 @@ public class IntVector128Tests extends AbstractVectorTest {
     static int ADDReduceAllMasked(int[] a, boolean[] mask) {
         int res = ADD_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduceMasked(a, i, mask);
+            res = scalar_add(res, ADDReduceMasked(a, i, mask));
         }
 
         return res;
@@ -4109,7 +4159,7 @@ public class IntVector128Tests extends AbstractVectorTest {
                 IntVector av = IntVector.fromArray(SPECIES, a, i);
                 int v = av.reduceLanes(VectorOperators.ADD, vmask);
                 r[i] = v;
-                ra += v;
+                ra = scalar_add(ra, v);
             }
         }
 
@@ -4120,7 +4170,7 @@ public class IntVector128Tests extends AbstractVectorTest {
     static int MULReduce(int[] a, int idx) {
         int res = MUL_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res *= a[i];
+            res = scalar_mul(res, a[i]);
         }
 
         return res;
@@ -4129,7 +4179,7 @@ public class IntVector128Tests extends AbstractVectorTest {
     static int MULReduceAll(int[] a) {
         int res = MUL_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res *= MULReduce(a, i);
+            res = scalar_mul(res, MULReduce(a, i));
         }
 
         return res;
@@ -4147,7 +4197,7 @@ public class IntVector128Tests extends AbstractVectorTest {
                 IntVector av = IntVector.fromArray(SPECIES, a, i);
                 int v = av.reduceLanes(VectorOperators.MUL);
                 r[i] = v;
-                ra *= v;
+                ra = scalar_mul(ra, v);
             }
         }
 
@@ -4160,20 +4210,20 @@ public class IntVector128Tests extends AbstractVectorTest {
         int[] a = fa.apply(SPECIES.length());
         int id = MUL_IDENTITY;
 
-        assertEquals((int) (id * id), id,
+        assertEquals((int) (scalar_mul(id, id)), id,
                             "MUL(MUL_IDENTITY, MUL_IDENTITY) != MUL_IDENTITY");
 
         int x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((int) (id * x), x);
-                assertEquals((int) (x * id), x);
+                assertEquals((int) (scalar_mul(id, x)), x);
+                assertEquals((int) (scalar_mul(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((int) (id * x), x,
+            assertEquals((int) (scalar_mul(id, x)), x,
                                 "MUL(MUL_IDENTITY, " + x + ") != " + x);
-            assertEquals((int) (x * id), x,
+            assertEquals((int) (scalar_mul(x, id)), x,
                                 "MUL(" + x + ", MUL_IDENTITY) != " + x);
         }
     }
@@ -4182,7 +4232,7 @@ public class IntVector128Tests extends AbstractVectorTest {
         int res = MUL_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res *= a[i];
+                res = scalar_mul(res, a[i]);
         }
 
         return res;
@@ -4191,7 +4241,7 @@ public class IntVector128Tests extends AbstractVectorTest {
     static int MULReduceAllMasked(int[] a, boolean[] mask) {
         int res = MUL_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res *= MULReduceMasked(a, i, mask);
+            res = scalar_mul(res, MULReduceMasked(a, i, mask));
         }
 
         return res;
@@ -4211,7 +4261,7 @@ public class IntVector128Tests extends AbstractVectorTest {
                 IntVector av = IntVector.fromArray(SPECIES, a, i);
                 int v = av.reduceLanes(VectorOperators.MUL, vmask);
                 r[i] = v;
-                ra *= v;
+                ra = scalar_mul(ra, v);
             }
         }
 
@@ -4222,7 +4272,7 @@ public class IntVector128Tests extends AbstractVectorTest {
     static int MINReduce(int[] a, int idx) {
         int res = MIN_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res = (int) Math.min(res, a[i]);
+            res = scalar_min(res, a[i]);
         }
 
         return res;
@@ -4231,7 +4281,7 @@ public class IntVector128Tests extends AbstractVectorTest {
     static int MINReduceAll(int[] a) {
         int res = MIN_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (int) Math.min(res, MINReduce(a, i));
+            res = scalar_min(res, MINReduce(a, i));
         }
 
         return res;
@@ -4249,7 +4299,7 @@ public class IntVector128Tests extends AbstractVectorTest {
                 IntVector av = IntVector.fromArray(SPECIES, a, i);
                 int v = av.reduceLanes(VectorOperators.MIN);
                 r[i] = v;
-                ra = (int) Math.min(ra, v);
+                ra = scalar_min(ra, v);
             }
         }
 
@@ -4262,20 +4312,20 @@ public class IntVector128Tests extends AbstractVectorTest {
         int[] a = fa.apply(SPECIES.length());
         int id = MIN_IDENTITY;
 
-        assertEquals((int) Math.min(id, id), id,
+        assertEquals(scalar_min(id, id), id,
                             "MIN(MIN_IDENTITY, MIN_IDENTITY) != MIN_IDENTITY");
 
         int x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((int) Math.min(id, x), x);
-                assertEquals((int) Math.min(x, id), x);
+                assertEquals(scalar_min(id, x), x);
+                assertEquals(scalar_min(x, id), x);
             }
         } catch (AssertionError e) {
-            assertEquals((int) Math.min(id, x), x,
+            assertEquals(scalar_min(id, x), x,
                                 "MIN(MIN_IDENTITY, " + x + ") != " + x);
-            assertEquals((int) Math.min(x, id), x,
+            assertEquals(scalar_min(x, id), x,
                                 "MIN(" + x + ", MIN_IDENTITY) != " + x);
         }
     }
@@ -4284,7 +4334,7 @@ public class IntVector128Tests extends AbstractVectorTest {
         int res = MIN_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res = (int) Math.min(res, a[i]);
+                res = scalar_min(res, a[i]);
         }
 
         return res;
@@ -4293,7 +4343,7 @@ public class IntVector128Tests extends AbstractVectorTest {
     static int MINReduceAllMasked(int[] a, boolean[] mask) {
         int res = MIN_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (int) Math.min(res, MINReduceMasked(a, i, mask));
+            res = scalar_min(res, MINReduceMasked(a, i, mask));
         }
 
         return res;
@@ -4313,7 +4363,7 @@ public class IntVector128Tests extends AbstractVectorTest {
                 IntVector av = IntVector.fromArray(SPECIES, a, i);
                 int v = av.reduceLanes(VectorOperators.MIN, vmask);
                 r[i] = v;
-                ra = (int) Math.min(ra, v);
+                ra = scalar_min(ra, v);
             }
         }
 
@@ -4324,7 +4374,7 @@ public class IntVector128Tests extends AbstractVectorTest {
     static int MAXReduce(int[] a, int idx) {
         int res = MAX_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res = (int) Math.max(res, a[i]);
+            res = scalar_max(res, a[i]);
         }
 
         return res;
@@ -4333,7 +4383,7 @@ public class IntVector128Tests extends AbstractVectorTest {
     static int MAXReduceAll(int[] a) {
         int res = MAX_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (int) Math.max(res, MAXReduce(a, i));
+            res = scalar_max(res, MAXReduce(a, i));
         }
 
         return res;
@@ -4351,7 +4401,7 @@ public class IntVector128Tests extends AbstractVectorTest {
                 IntVector av = IntVector.fromArray(SPECIES, a, i);
                 int v = av.reduceLanes(VectorOperators.MAX);
                 r[i] = v;
-                ra = (int) Math.max(ra, v);
+                ra = scalar_max(ra, v);
             }
         }
 
@@ -4364,20 +4414,20 @@ public class IntVector128Tests extends AbstractVectorTest {
         int[] a = fa.apply(SPECIES.length());
         int id = MAX_IDENTITY;
 
-        assertEquals((int) Math.max(id, id), id,
+        assertEquals(scalar_max(id, id), id,
                             "MAX(MAX_IDENTITY, MAX_IDENTITY) != MAX_IDENTITY");
 
         int x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((int) Math.max(id, x), x);
-                assertEquals((int) Math.max(x, id), x);
+                assertEquals(scalar_max(id, x), x);
+                assertEquals(scalar_max(x, id), x);
             }
         } catch (AssertionError e) {
-            assertEquals((int) Math.max(id, x), x,
+            assertEquals(scalar_max(id, x), x,
                                 "MAX(MAX_IDENTITY, " + x + ") != " + x);
-            assertEquals((int) Math.max(x, id), x,
+            assertEquals(scalar_max(x, id), x,
                                 "MAX(" + x + ", MAX_IDENTITY) != " + x);
         }
     }
@@ -4386,7 +4436,7 @@ public class IntVector128Tests extends AbstractVectorTest {
         int res = MAX_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res = (int) Math.max(res, a[i]);
+                res = scalar_max(res, a[i]);
         }
 
         return res;
@@ -4395,7 +4445,7 @@ public class IntVector128Tests extends AbstractVectorTest {
     static int MAXReduceAllMasked(int[] a, boolean[] mask) {
         int res = MAX_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (int) Math.max(res, MAXReduceMasked(a, i, mask));
+            res = scalar_max(res, MAXReduceMasked(a, i, mask));
         }
 
         return res;
@@ -4415,7 +4465,7 @@ public class IntVector128Tests extends AbstractVectorTest {
                 IntVector av = IntVector.fromArray(SPECIES, a, i);
                 int v = av.reduceLanes(VectorOperators.MAX, vmask);
                 r[i] = v;
-                ra = (int) Math.max(ra, v);
+                ra = scalar_max(ra, v);
             }
         }
 
@@ -5448,7 +5498,7 @@ public class IntVector128Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] < b[i]);
+                assertEquals(mv.laneIsSet(j), lt(a[i + j], b[i]));
             }
         }
     }
@@ -5468,7 +5518,7 @@ public class IntVector128Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] < b[i]));
+                assertEquals(mv.laneIsSet(j), mask[j] && (lt(a[i + j], b[i])));
             }
         }
     }
@@ -5484,7 +5534,7 @@ public class IntVector128Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] < (int)((long)b[i]));
+                assertEquals(mv.laneIsSet(j), lt(a[i + j], (int)((long)b[i])));
             }
         }
     }
@@ -5504,7 +5554,7 @@ public class IntVector128Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] < (int)((long)b[i])));
+                assertEquals(mv.laneIsSet(j), mask[j] && (lt(a[i + j], (int)((long)b[i]))));
             }
         }
     }
@@ -5520,7 +5570,7 @@ public class IntVector128Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] == b[i]);
+                assertEquals(mv.laneIsSet(j), eq(a[i + j], b[i]));
             }
         }
     }
@@ -5540,7 +5590,7 @@ public class IntVector128Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] == b[i]));
+                assertEquals(mv.laneIsSet(j), mask[j] && (eq(a[i + j], b[i])));
             }
         }
     }
@@ -5556,7 +5606,7 @@ public class IntVector128Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] == (int)((long)b[i]));
+                assertEquals(mv.laneIsSet(j), eq(a[i + j], (int)((long)b[i])));
             }
         }
     }
@@ -5576,7 +5626,7 @@ public class IntVector128Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] == (int)((long)b[i])));
+                assertEquals(mv.laneIsSet(j), mask[j] && (eq(a[i + j], (int)((long)b[i]))));
             }
         }
     }
@@ -6288,11 +6338,11 @@ public class IntVector128Tests extends AbstractVectorTest {
     }
 
     static int NEG(int a) {
-        return (int)(-((int)a));
+        return (int)(scalar_neg((int)a));
     }
 
     static int neg(int a) {
-        return (int)(-((int)a));
+        return (int)(scalar_neg((int)a));
     }
 
     @Test(dataProvider = "intUnaryOpProvider")
@@ -6344,11 +6394,11 @@ public class IntVector128Tests extends AbstractVectorTest {
     }
 
     static int ABS(int a) {
-        return (int)(Math.abs((int)a));
+        return (int)(scalar_abs((int)a));
     }
 
     static int abs(int a) {
-        return (int)(Math.abs((int)a));
+        return (int)(scalar_abs((int)a));
     }
 
     @Test(dataProvider = "intUnaryOpProvider")
@@ -6839,7 +6889,7 @@ public class IntVector128Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] < b[i]);
+                assertEquals(mv.laneIsSet(j), lt(a[i + j], b[i]));
             }
         }
     }
@@ -6855,7 +6905,7 @@ public class IntVector128Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] == b[i]);
+                assertEquals(mv.laneIsSet(j), eq(a[i + j], b[i]));
             }
         }
     }
@@ -6924,7 +6974,7 @@ public class IntVector128Tests extends AbstractVectorTest {
     static long ADDReduceLong(int[] a, int idx) {
         int res = 0;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res += a[i];
+            res = scalar_add(res, a[i]);
         }
 
         return (long)res;
@@ -6933,7 +6983,7 @@ public class IntVector128Tests extends AbstractVectorTest {
     static long ADDReduceAllLong(int[] a) {
         long res = 0;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduceLong(a, i);
+            res = (long)scalar_add((int)res, (int)ADDReduceLong(a, i));
         }
 
         return res;
@@ -6951,8 +7001,8 @@ public class IntVector128Tests extends AbstractVectorTest {
         }
 
         ra = 0;
-        for (int i = 0; i < a.length; i ++) {
-            ra += r[i];
+        for (int i = 0; i < a.length; i++) {
+            ra = (long)scalar_add((int)ra, (int)r[i]);
         }
 
         assertReductionLongArraysEquals(r, ra, a,
@@ -6962,8 +7012,9 @@ public class IntVector128Tests extends AbstractVectorTest {
     static long ADDReduceLongMasked(int[] a, int idx, boolean[] mask) {
         int res = 0;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            if(mask[i % SPECIES.length()])
-                res += a[i];
+            if (mask[i % SPECIES.length()]) {
+                res = scalar_add(res, a[i]);
+            }
         }
 
         return (long)res;
@@ -6972,7 +7023,7 @@ public class IntVector128Tests extends AbstractVectorTest {
     static long ADDReduceAllLongMasked(int[] a, boolean[] mask) {
         long res = 0;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduceLongMasked(a, i, mask);
+            res = (long)scalar_add((int)res, (int)ADDReduceLongMasked(a, i, mask));
         }
 
         return res;
@@ -6992,8 +7043,8 @@ public class IntVector128Tests extends AbstractVectorTest {
         }
 
         ra = 0;
-        for (int i = 0; i < a.length; i ++) {
-            ra += r[i];
+        for (int i = 0; i < a.length; i++) {
+            ra = (long)scalar_add((int)ra, (int)r[i]);
         }
 
         assertReductionLongArraysEqualsMasked(r, ra, a, mask,
diff --git a/test/jdk/jdk/incubator/vector/IntVector256Tests.java b/test/jdk/jdk/incubator/vector/IntVector256Tests.java
index 7100ebd1693..bb2d1d717f4 100644
--- a/test/jdk/jdk/incubator/vector/IntVector256Tests.java
+++ b/test/jdk/jdk/incubator/vector/IntVector256Tests.java
@@ -1531,6 +1531,59 @@ public class IntVector256Tests extends AbstractVectorTest {
         return a >= b;
     }
 
+    static int firstNonZero(int a, int b) {
+        return Integer.compare(a, (int) 0) != 0 ? a : b;
+    }
+
+    static int scalar_or(int a, int b) {
+        return (int)(a | b);
+    }
+
+    static int scalar_and(int a, int b) {
+        return (int)(a & b);
+    }
+
+    static int scalar_xor(int a, int b) {
+        return (int)(a ^ b);
+    }
+
+    static int scalar_add(int a, int b) {
+        return (int)(a + b);
+    }
+
+    static int scalar_sub(int a, int b) {
+        return (int)(a - b);
+    }
+
+    static int scalar_mul(int a, int b) {
+        return (int)(a * b);
+    }
+
+    static int scalar_min(int a, int b) {
+        return (int)(Math.min(a, b));
+    }
+
+    static int scalar_max(int a, int b) {
+        return (int)(Math.max(a, b));
+    }
+
+    static int scalar_div(int a, int b) {
+        return (int)(a / b);
+    }
+
+    static int scalar_fma(int a, int b, int c) {
+        return (int)(Math.fma(a, b, c));
+    }
+
+    static int scalar_abs(int a) {
+        return (int)(Math.abs(a));
+    }
+
+    static int scalar_neg(int a) {
+        return ((int)-a);
+    }
+
+
     static boolean ult(int a, int b) {
         return Integer.compareUnsigned(a, b) < 0;
     }
@@ -1547,9 +1600,6 @@ public class IntVector256Tests extends AbstractVectorTest {
         return Integer.compareUnsigned(a, b) >= 0;
     }
 
-    static int firstNonZero(int a, int b) {
-        return Integer.compare(a, (int) 0) != 0 ? a : b;
-    }
 
     @Test
     static void smokeTest1() {
@@ -1663,7 +1713,7 @@ public class IntVector256Tests extends AbstractVectorTest {
     }
 
     static int ADD(int a, int b) {
-        return (int)(a + b);
+        return (int)(scalar_add(a, b));
     }
 
     @Test(dataProvider = "intBinaryOpProvider")
@@ -1684,7 +1734,7 @@ public class IntVector256Tests extends AbstractVectorTest {
     }
 
     static int add(int a, int b) {
-        return (int)(a + b);
+        return (int)(scalar_add(a, b));
     }
 
     @Test(dataProvider = "intBinaryOpProvider")
@@ -1741,7 +1791,7 @@ public class IntVector256Tests extends AbstractVectorTest {
     }
 
     static int SUB(int a, int b) {
-        return (int)(a - b);
+        return (int)(scalar_sub(a, b));
     }
 
     @Test(dataProvider = "intBinaryOpProvider")
@@ -1762,7 +1812,7 @@ public class IntVector256Tests extends AbstractVectorTest {
     }
 
     static int sub(int a, int b) {
-        return (int)(a - b);
+        return (int)(scalar_sub(a, b));
     }
 
     @Test(dataProvider = "intBinaryOpProvider")
@@ -1819,7 +1869,7 @@ public class IntVector256Tests extends AbstractVectorTest {
     }
 
     static int MUL(int a, int b) {
-        return (int)(a * b);
+        return (int)(scalar_mul(a, b));
     }
 
     @Test(dataProvider = "intBinaryOpProvider")
@@ -1840,7 +1890,7 @@ public class IntVector256Tests extends AbstractVectorTest {
     }
 
     static int mul(int a, int b) {
-        return (int)(a * b);
+        return (int)(scalar_mul(a, b));
     }
 
     @Test(dataProvider = "intBinaryOpProvider")
@@ -1987,7 +2037,7 @@ public class IntVector256Tests extends AbstractVectorTest {
     }
 
     static int FIRST_NONZERO(int a, int b) {
-        return (int)((a)!=0?a:b);
+        return (int)(firstNonZero(a, b));
     }
 
     @Test(dataProvider = "intBinaryOpProvider")
@@ -3283,7 +3333,7 @@ public class IntVector256Tests extends AbstractVectorTest {
     }
 
     static int MIN(int a, int b) {
-        return (int)(Math.min(a, b));
+        return (int)(scalar_min(a, b));
     }
 
     @Test(dataProvider = "intBinaryOpProvider")
@@ -3304,7 +3354,7 @@ public class IntVector256Tests extends AbstractVectorTest {
     }
 
     static int min(int a, int b) {
-        return (int)(Math.min(a, b));
+        return (int)(scalar_min(a, b));
     }
 
     @Test(dataProvider = "intBinaryOpProvider")
@@ -3323,7 +3373,7 @@ public class IntVector256Tests extends AbstractVectorTest {
     }
 
     static int MAX(int a, int b) {
-        return (int)(Math.max(a, b));
+        return (int)(scalar_max(a, b));
     }
 
     @Test(dataProvider = "intBinaryOpProvider")
@@ -3344,7 +3394,7 @@ public class IntVector256Tests extends AbstractVectorTest {
     }
 
     static int max(int a, int b) {
-        return (int)(Math.max(a, b));
+        return (int)(scalar_max(a, b));
     }
 
     @Test(dataProvider = "intBinaryOpProvider")
@@ -3712,7 +3762,7 @@ public class IntVector256Tests extends AbstractVectorTest {
     static int ANDReduce(int[] a, int idx) {
         int res = AND_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res &= a[i];
+            res = scalar_and(res, a[i]);
         }
 
         return res;
@@ -3721,7 +3771,7 @@ public class IntVector256Tests extends AbstractVectorTest {
     static int ANDReduceAll(int[] a) {
         int res = AND_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res &= ANDReduce(a, i);
+            res = scalar_and(res, ANDReduce(a, i));
         }
 
         return res;
@@ -3739,7 +3789,7 @@ public class IntVector256Tests extends AbstractVectorTest {
                 IntVector av = IntVector.fromArray(SPECIES, a, i);
                 int v = av.reduceLanes(VectorOperators.AND);
                 r[i] = v;
-                ra &= v;
+                ra = scalar_and(ra, v);
             }
         }
 
@@ -3752,20 +3802,20 @@ public class IntVector256Tests extends AbstractVectorTest {
         int[] a = fa.apply(SPECIES.length());
         int id = AND_IDENTITY;
 
-        assertEquals((int) (id & id), id,
+        assertEquals((int) (scalar_and(id, id)), id,
                             "AND(AND_IDENTITY, AND_IDENTITY) != AND_IDENTITY");
 
         int x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((int) (id & x), x);
-                assertEquals((int) (x & id), x);
+                assertEquals((int) (scalar_and(id, x)), x);
+                assertEquals((int) (scalar_and(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((int) (id & x), x,
+            assertEquals((int) (scalar_and(id, x)), x,
                                 "AND(AND_IDENTITY, " + x + ") != " + x);
-            assertEquals((int) (x & id), x,
+            assertEquals((int) (scalar_and(x, id)), x,
                                 "AND(" + x + ", AND_IDENTITY) != " + x);
         }
     }
@@ -3774,7 +3824,7 @@ public class IntVector256Tests extends AbstractVectorTest {
         int res = AND_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res &= a[i];
+                res = scalar_and(res, a[i]);
         }
 
         return res;
@@ -3783,7 +3833,7 @@ public class IntVector256Tests extends AbstractVectorTest {
     static int ANDReduceAllMasked(int[] a, boolean[] mask) {
         int res = AND_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res &= ANDReduceMasked(a, i, mask);
+            res = scalar_and(res, ANDReduceMasked(a, i, mask));
         }
 
         return res;
@@ -3803,7 +3853,7 @@ public class IntVector256Tests extends AbstractVectorTest {
                 IntVector av = IntVector.fromArray(SPECIES, a, i);
                 int v = av.reduceLanes(VectorOperators.AND, vmask);
                 r[i] = v;
-                ra &= v;
+                ra = scalar_and(ra, v);
             }
         }
 
@@ -3814,7 +3864,7 @@ public class IntVector256Tests extends AbstractVectorTest {
     static int ORReduce(int[] a, int idx) {
         int res = OR_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res |= a[i];
+            res = scalar_or(res, a[i]);
         }
 
         return res;
@@ -3823,7 +3873,7 @@ public class IntVector256Tests extends AbstractVectorTest {
     static int ORReduceAll(int[] a) {
         int res = OR_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res |= ORReduce(a, i);
+            res = scalar_or(res, ORReduce(a, i));
         }
 
         return res;
@@ -3841,7 +3891,7 @@ public class IntVector256Tests extends AbstractVectorTest {
                 IntVector av = IntVector.fromArray(SPECIES, a, i);
                 int v = av.reduceLanes(VectorOperators.OR);
                 r[i] = v;
-                ra |= v;
+                ra = scalar_or(ra, v);
             }
         }
 
@@ -3854,20 +3904,20 @@ public class IntVector256Tests extends AbstractVectorTest {
         int[] a = fa.apply(SPECIES.length());
         int id = OR_IDENTITY;
 
-        assertEquals((int) (id | id), id,
+        assertEquals((int) (scalar_or(id, id)), id,
                             "OR(OR_IDENTITY, OR_IDENTITY) != OR_IDENTITY");
 
         int x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((int) (id | x), x);
-                assertEquals((int) (x | id), x);
+                assertEquals((int) (scalar_or(id, x)), x);
+                assertEquals((int) (scalar_or(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((int) (id | x), x,
+            assertEquals((int) (scalar_or(id, x)), x,
                                 "OR(OR_IDENTITY, " + x + ") != " + x);
-            assertEquals((int) (x | id), x,
+            assertEquals((int) (scalar_or(x, id)), x,
                                 "OR(" + x + ", OR_IDENTITY) != " + x);
         }
     }
@@ -3876,7 +3926,7 @@ public class IntVector256Tests extends AbstractVectorTest {
         int res = OR_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res |= a[i];
+                res = scalar_or(res, a[i]);
         }
 
         return res;
@@ -3885,7 +3935,7 @@ public class IntVector256Tests extends AbstractVectorTest {
     static int ORReduceAllMasked(int[] a, boolean[] mask) {
         int res = OR_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res |= ORReduceMasked(a, i, mask);
+            res = scalar_or(res, ORReduceMasked(a, i, mask));
         }
 
         return res;
@@ -3905,7 +3955,7 @@ public class IntVector256Tests extends AbstractVectorTest {
                 IntVector av = IntVector.fromArray(SPECIES, a, i);
                 int v = av.reduceLanes(VectorOperators.OR, vmask);
                 r[i] = v;
-                ra |= v;
+                ra = scalar_or(ra, v);
             }
         }
 
@@ -3916,7 +3966,7 @@ public class IntVector256Tests extends AbstractVectorTest {
     static int XORReduce(int[] a, int idx) {
         int res = XOR_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res ^= a[i];
+            res = scalar_xor(res, a[i]);
         }
 
         return res;
@@ -3925,7 +3975,7 @@ public class IntVector256Tests extends AbstractVectorTest {
     static int XORReduceAll(int[] a) {
         int res = XOR_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res ^= XORReduce(a, i);
+            res = scalar_xor(res, XORReduce(a, i));
         }
 
         return res;
@@ -3943,7 +3993,7 @@ public class IntVector256Tests extends AbstractVectorTest {
                 IntVector av = IntVector.fromArray(SPECIES, a, i);
                 int v = av.reduceLanes(VectorOperators.XOR);
                 r[i] = v;
-                ra ^= v;
+                ra = scalar_xor(ra, v);
             }
         }
 
@@ -3956,20 +4006,20 @@ public class IntVector256Tests extends AbstractVectorTest {
         int[] a = fa.apply(SPECIES.length());
         int id = XOR_IDENTITY;
 
-        assertEquals((int) (id ^ id), id,
+        assertEquals((int) (scalar_xor(id, id)), id,
                             "XOR(XOR_IDENTITY, XOR_IDENTITY) != XOR_IDENTITY");
 
         int x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((int) (id ^ x), x);
-                assertEquals((int) (x ^ id), x);
+                assertEquals((int) (scalar_xor(id, x)), x);
+                assertEquals((int) (scalar_xor(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((int) (id ^ x), x,
+            assertEquals((int) (scalar_xor(id, x)), x,
                                 "XOR(XOR_IDENTITY, " + x + ") != " + x);
-            assertEquals((int) (x ^ id), x,
+            assertEquals((int) (scalar_xor(x, id)), x,
                                 "XOR(" + x + ", XOR_IDENTITY) != " + x);
         }
     }
@@ -3978,7 +4028,7 @@ public class IntVector256Tests extends AbstractVectorTest {
         int res = XOR_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res ^= a[i];
+                res = scalar_xor(res, a[i]);
         }
 
         return res;
@@ -3987,7 +4037,7 @@ public class IntVector256Tests extends AbstractVectorTest {
     static int XORReduceAllMasked(int[] a, boolean[] mask) {
         int res = XOR_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res ^= XORReduceMasked(a, i, mask);
+            res = scalar_xor(res, XORReduceMasked(a, i, mask));
         }
 
         return res;
@@ -4007,7 +4057,7 @@ public class IntVector256Tests extends AbstractVectorTest {
                 IntVector av = IntVector.fromArray(SPECIES, a, i);
                 int v = av.reduceLanes(VectorOperators.XOR, vmask);
                 r[i] = v;
-                ra ^= v;
+                ra = scalar_xor(ra, v);
             }
         }
 
@@ -4018,7 +4068,7 @@ public class IntVector256Tests extends AbstractVectorTest {
     static int ADDReduce(int[] a, int idx) {
         int res = ADD_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res += a[i];
+            res = scalar_add(res, a[i]);
         }
 
         return res;
@@ -4027,7 +4077,7 @@ public class IntVector256Tests extends AbstractVectorTest {
     static int ADDReduceAll(int[] a) {
         int res = ADD_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduce(a, i);
+            res = scalar_add(res, ADDReduce(a, i));
         }
 
         return res;
@@ -4045,7 +4095,7 @@ public class IntVector256Tests extends AbstractVectorTest {
                 IntVector av = IntVector.fromArray(SPECIES, a, i);
                 int v = av.reduceLanes(VectorOperators.ADD);
                 r[i] = v;
-                ra += v;
+                ra = scalar_add(ra, v);
             }
         }
 
@@ -4058,20 +4108,20 @@ public class IntVector256Tests extends AbstractVectorTest {
         int[] a = fa.apply(SPECIES.length());
         int id = ADD_IDENTITY;
 
-        assertEquals((int) (id + id), id,
+        assertEquals((int) (scalar_add(id, id)), id,
                             "ADD(ADD_IDENTITY, ADD_IDENTITY) != ADD_IDENTITY");
 
         int x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((int) (id + x), x);
-                assertEquals((int) (x + id), x);
+                assertEquals((int) (scalar_add(id, x)), x);
+                assertEquals((int) (scalar_add(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((int) (id + x), x,
+            assertEquals((int) (scalar_add(id, x)), x,
                                 "ADD(ADD_IDENTITY, " + x + ") != " + x);
-            assertEquals((int) (x + id), x,
+            assertEquals((int) (scalar_add(x, id)), x,
                                 "ADD(" + x + ", ADD_IDENTITY) != " + x);
         }
     }
@@ -4080,7 +4130,7 @@ public class IntVector256Tests extends AbstractVectorTest {
         int res = ADD_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res += a[i];
+                res = scalar_add(res, a[i]);
         }
 
         return res;
@@ -4089,7 +4139,7 @@ public class IntVector256Tests extends AbstractVectorTest {
     static int ADDReduceAllMasked(int[] a, boolean[] mask) {
         int res = ADD_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduceMasked(a, i, mask);
+            res = scalar_add(res, ADDReduceMasked(a, i, mask));
         }
 
         return res;
@@ -4109,7 +4159,7 @@ public class IntVector256Tests extends AbstractVectorTest {
                 IntVector av = IntVector.fromArray(SPECIES, a, i);
                 int v = av.reduceLanes(VectorOperators.ADD, vmask);
                 r[i] = v;
-                ra += v;
+                ra = scalar_add(ra, v);
             }
         }
 
@@ -4120,7 +4170,7 @@ public class IntVector256Tests extends AbstractVectorTest {
     static int MULReduce(int[] a, int idx) {
         int res = MUL_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res *= a[i];
+            res = scalar_mul(res, a[i]);
         }
 
         return res;
@@ -4129,7 +4179,7 @@ public class IntVector256Tests extends AbstractVectorTest {
     static int MULReduceAll(int[] a) {
         int res = MUL_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res *= MULReduce(a, i);
+            res = scalar_mul(res, MULReduce(a, i));
         }
 
         return res;
@@ -4147,7 +4197,7 @@ public class IntVector256Tests extends AbstractVectorTest {
                 IntVector av = IntVector.fromArray(SPECIES, a, i);
                 int v = av.reduceLanes(VectorOperators.MUL);
                 r[i] = v;
-                ra *= v;
+                ra = scalar_mul(ra, v);
             }
         }
 
@@ -4160,20 +4210,20 @@ public class IntVector256Tests extends AbstractVectorTest {
         int[] a = fa.apply(SPECIES.length());
         int id = MUL_IDENTITY;
 
-        assertEquals((int) (id * id), id,
+        assertEquals((int) (scalar_mul(id, id)), id,
                             "MUL(MUL_IDENTITY, MUL_IDENTITY) != MUL_IDENTITY");
 
         int x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((int) (id * x), x);
-                assertEquals((int) (x * id), x);
+                assertEquals((int) (scalar_mul(id, x)), x);
+                assertEquals((int) (scalar_mul(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((int) (id * x), x,
+            assertEquals((int) (scalar_mul(id, x)), x,
                                 "MUL(MUL_IDENTITY, " + x + ") != " + x);
-            assertEquals((int) (x * id), x,
+            assertEquals((int) (scalar_mul(x, id)), x,
                                 "MUL(" + x + ", MUL_IDENTITY) != " + x);
         }
     }
@@ -4182,7 +4232,7 @@ public class IntVector256Tests extends AbstractVectorTest {
         int res = MUL_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res *= a[i];
+                res = scalar_mul(res, a[i]);
         }
 
         return res;
@@ -4191,7 +4241,7 @@ public class IntVector256Tests extends AbstractVectorTest {
     static int MULReduceAllMasked(int[] a, boolean[] mask) {
         int res = MUL_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res *= MULReduceMasked(a, i, mask);
+            res = scalar_mul(res, MULReduceMasked(a, i, mask));
         }
 
         return res;
@@ -4211,7 +4261,7 @@ public class IntVector256Tests extends AbstractVectorTest {
                 IntVector av = IntVector.fromArray(SPECIES, a, i);
                 int v = av.reduceLanes(VectorOperators.MUL, vmask);
                 r[i] = v;
-                ra *= v;
+                ra = scalar_mul(ra, v);
             }
         }
 
@@ -4222,7 +4272,7 @@ public class IntVector256Tests extends AbstractVectorTest {
     static int MINReduce(int[] a, int idx) {
         int res = MIN_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res = (int) Math.min(res, a[i]);
+            res = scalar_min(res, a[i]);
         }
 
         return res;
@@ -4231,7 +4281,7 @@ public class IntVector256Tests extends AbstractVectorTest {
     static int MINReduceAll(int[] a) {
         int res = MIN_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (int) Math.min(res, MINReduce(a, i));
+            res = scalar_min(res, MINReduce(a, i));
         }
 
         return res;
@@ -4249,7 +4299,7 @@ public class IntVector256Tests extends AbstractVectorTest {
                 IntVector av = IntVector.fromArray(SPECIES, a, i);
                 int v = av.reduceLanes(VectorOperators.MIN);
                 r[i] = v;
-                ra = (int) Math.min(ra, v);
+                ra = scalar_min(ra, v);
             }
         }
 
@@ -4262,20 +4312,20 @@ public class IntVector256Tests extends AbstractVectorTest {
         int[] a = fa.apply(SPECIES.length());
         int id = MIN_IDENTITY;
 
-        assertEquals((int) Math.min(id, id), id,
+        assertEquals(scalar_min(id, id), id,
                             "MIN(MIN_IDENTITY, MIN_IDENTITY) != MIN_IDENTITY");
 
         int x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((int) Math.min(id, x), x);
-                assertEquals((int) Math.min(x, id), x);
+                assertEquals(scalar_min(id, x), x);
+                assertEquals(scalar_min(x, id), x);
             }
         } catch (AssertionError e) {
-            assertEquals((int) Math.min(id, x), x,
+            assertEquals(scalar_min(id, x), x,
                                 "MIN(MIN_IDENTITY, " + x + ") != " + x);
-            assertEquals((int) Math.min(x, id), x,
+            assertEquals(scalar_min(x, id), x,
                                 "MIN(" + x + ", MIN_IDENTITY) != " + x);
         }
     }
@@ -4284,7 +4334,7 @@ public class IntVector256Tests extends AbstractVectorTest {
         int res = MIN_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res = (int) Math.min(res, a[i]);
+                res = scalar_min(res, a[i]);
         }
 
         return res;
@@ -4293,7 +4343,7 @@ public class IntVector256Tests extends AbstractVectorTest {
     static int MINReduceAllMasked(int[] a, boolean[] mask) {
         int res = MIN_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (int) Math.min(res, MINReduceMasked(a, i, mask));
+            res = scalar_min(res, MINReduceMasked(a, i, mask));
         }
 
         return res;
@@ -4313,7 +4363,7 @@ public class IntVector256Tests extends AbstractVectorTest {
                 IntVector av = IntVector.fromArray(SPECIES, a, i);
                 int v = av.reduceLanes(VectorOperators.MIN, vmask);
                 r[i] = v;
-                ra = (int) Math.min(ra, v);
+                ra = scalar_min(ra, v);
             }
         }
 
@@ -4324,7 +4374,7 @@ public class IntVector256Tests extends AbstractVectorTest {
     static int MAXReduce(int[] a, int idx) {
         int res = MAX_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res = (int) Math.max(res, a[i]);
+            res = scalar_max(res, a[i]);
         }
 
         return res;
@@ -4333,7 +4383,7 @@ public class IntVector256Tests extends AbstractVectorTest {
     static int MAXReduceAll(int[] a) {
         int res = MAX_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (int) Math.max(res, MAXReduce(a, i));
+            res = scalar_max(res, MAXReduce(a, i));
         }
 
         return res;
@@ -4351,7 +4401,7 @@ public class IntVector256Tests extends AbstractVectorTest {
                 IntVector av = IntVector.fromArray(SPECIES, a, i);
                 int v = av.reduceLanes(VectorOperators.MAX);
                 r[i] = v;
-                ra = (int) Math.max(ra, v);
+                ra = scalar_max(ra, v);
             }
         }
 
@@ -4364,20 +4414,20 @@ public class IntVector256Tests extends AbstractVectorTest {
         int[] a = fa.apply(SPECIES.length());
         int id = MAX_IDENTITY;
 
-        assertEquals((int) Math.max(id, id), id,
+        assertEquals(scalar_max(id, id), id,
                             "MAX(MAX_IDENTITY, MAX_IDENTITY) != MAX_IDENTITY");
 
         int x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((int) Math.max(id, x), x);
-                assertEquals((int) Math.max(x, id), x);
+                assertEquals(scalar_max(id, x), x);
+                assertEquals(scalar_max(x, id), x);
             }
         } catch (AssertionError e) {
-            assertEquals((int) Math.max(id, x), x,
+            assertEquals(scalar_max(id, x), x,
                                 "MAX(MAX_IDENTITY, " + x + ") != " + x);
-            assertEquals((int) Math.max(x, id), x,
+            assertEquals(scalar_max(x, id), x,
                                 "MAX(" + x + ", MAX_IDENTITY) != " + x);
         }
     }
@@ -4386,7 +4436,7 @@ public class IntVector256Tests extends AbstractVectorTest {
         int res = MAX_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res = (int) Math.max(res, a[i]);
+                res = scalar_max(res, a[i]);
         }
 
         return res;
@@ -4395,7 +4445,7 @@ public class IntVector256Tests extends AbstractVectorTest {
     static int MAXReduceAllMasked(int[] a, boolean[] mask) {
         int res = MAX_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (int) Math.max(res, MAXReduceMasked(a, i, mask));
+            res = scalar_max(res, MAXReduceMasked(a, i, mask));
         }
 
         return res;
@@ -4415,7 +4465,7 @@ public class IntVector256Tests extends AbstractVectorTest {
                 IntVector av = IntVector.fromArray(SPECIES, a, i);
                 int v = av.reduceLanes(VectorOperators.MAX, vmask);
                 r[i] = v;
-                ra = (int) Math.max(ra, v);
+                ra = scalar_max(ra, v);
             }
         }
 
@@ -5448,7 +5498,7 @@ public class IntVector256Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] < b[i]);
+                assertEquals(mv.laneIsSet(j), lt(a[i + j], b[i]));
             }
         }
     }
@@ -5468,7 +5518,7 @@ public class IntVector256Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] < b[i]));
+                assertEquals(mv.laneIsSet(j), mask[j] && (lt(a[i + j], b[i])));
             }
         }
     }
@@ -5484,7 +5534,7 @@ public class IntVector256Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] < (int)((long)b[i]));
+                assertEquals(mv.laneIsSet(j), lt(a[i + j], (int)((long)b[i])));
             }
         }
     }
@@ -5504,7 +5554,7 @@ public class IntVector256Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] < (int)((long)b[i])));
+                assertEquals(mv.laneIsSet(j), mask[j] && (lt(a[i + j], (int)((long)b[i]))));
             }
         }
     }
@@ -5520,7 +5570,7 @@ public class IntVector256Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] == b[i]);
+                assertEquals(mv.laneIsSet(j), eq(a[i + j], b[i]));
             }
         }
     }
@@ -5540,7 +5590,7 @@ public class IntVector256Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] == b[i]));
+                assertEquals(mv.laneIsSet(j), mask[j] && (eq(a[i + j], b[i])));
             }
         }
     }
@@ -5556,7 +5606,7 @@ public class IntVector256Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] == (int)((long)b[i]));
+                assertEquals(mv.laneIsSet(j), eq(a[i + j], (int)((long)b[i])));
             }
         }
     }
@@ -5576,7 +5626,7 @@ public class IntVector256Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] == (int)((long)b[i])));
+                assertEquals(mv.laneIsSet(j), mask[j] && (eq(a[i + j], (int)((long)b[i]))));
             }
         }
     }
@@ -6288,11 +6338,11 @@ public class IntVector256Tests extends AbstractVectorTest {
     }
 
     static int NEG(int a) {
-        return (int)(-((int)a));
+        return (int)(scalar_neg((int)a));
     }
 
     static int neg(int a) {
-        return (int)(-((int)a));
+        return (int)(scalar_neg((int)a));
     }
 
     @Test(dataProvider = "intUnaryOpProvider")
@@ -6344,11 +6394,11 @@ public class IntVector256Tests extends AbstractVectorTest {
     }
 
     static int ABS(int a) {
-        return (int)(Math.abs((int)a));
+        return (int)(scalar_abs((int)a));
     }
 
     static int abs(int a) {
-        return (int)(Math.abs((int)a));
+        return (int)(scalar_abs((int)a));
     }
 
     @Test(dataProvider = "intUnaryOpProvider")
@@ -6839,7 +6889,7 @@ public class IntVector256Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] < b[i]);
+                assertEquals(mv.laneIsSet(j), lt(a[i + j], b[i]));
             }
         }
     }
@@ -6855,7 +6905,7 @@ public class IntVector256Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] == b[i]);
+                assertEquals(mv.laneIsSet(j), eq(a[i + j], b[i]));
             }
         }
     }
@@ -6924,7 +6974,7 @@ public class IntVector256Tests extends AbstractVectorTest {
     static long ADDReduceLong(int[] a, int idx) {
         int res = 0;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res += a[i];
+            res = scalar_add(res, a[i]);
         }
 
         return (long)res;
@@ -6933,7 +6983,7 @@ public class IntVector256Tests extends AbstractVectorTest {
     static long ADDReduceAllLong(int[] a) {
         long res = 0;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduceLong(a, i);
+            res = (long)scalar_add((int)res, (int)ADDReduceLong(a, i));
         }
 
         return res;
@@ -6951,8 +7001,8 @@ public class IntVector256Tests extends AbstractVectorTest {
         }
 
         ra = 0;
-        for (int i = 0; i < a.length; i ++) {
-            ra += r[i];
+        for (int i = 0; i < a.length; i++) {
+            ra = (long)scalar_add((int)ra, (int)r[i]);
         }
 
         assertReductionLongArraysEquals(r, ra, a,
@@ -6962,8 +7012,9 @@ public class IntVector256Tests extends AbstractVectorTest {
     static long ADDReduceLongMasked(int[] a, int idx, boolean[] mask) {
         int res = 0;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            if(mask[i % SPECIES.length()])
-                res += a[i];
+            if (mask[i % SPECIES.length()]) {
+                res = scalar_add(res, a[i]);
+            }
         }
 
         return (long)res;
@@ -6972,7 +7023,7 @@ public class IntVector256Tests extends AbstractVectorTest {
     static long ADDReduceAllLongMasked(int[] a, boolean[] mask) {
         long res = 0;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduceLongMasked(a, i, mask);
+            res = (long)scalar_add((int)res, (int)ADDReduceLongMasked(a, i, mask));
         }
 
         return res;
@@ -6992,8 +7043,8 @@ public class IntVector256Tests extends AbstractVectorTest {
         }
 
         ra = 0;
-        for (int i = 0; i < a.length; i ++) {
-            ra += r[i];
+        for (int i = 0; i < a.length; i++) {
+            ra = (long)scalar_add((int)ra, (int)r[i]);
         }
 
         assertReductionLongArraysEqualsMasked(r, ra, a, mask,
diff --git a/test/jdk/jdk/incubator/vector/IntVector512Tests.java b/test/jdk/jdk/incubator/vector/IntVector512Tests.java
index 468d3b15efe..5ceba4e88ec 100644
--- a/test/jdk/jdk/incubator/vector/IntVector512Tests.java
+++ b/test/jdk/jdk/incubator/vector/IntVector512Tests.java
@@ -1531,6 +1531,59 @@ public class IntVector512Tests extends AbstractVectorTest {
         return a >= b;
     }
 
+    static int firstNonZero(int a, int b) {
+        return Integer.compare(a, (int) 0) != 0 ? a : b;
+    }
+
+    static int scalar_or(int a, int b) {
+        return (int)(a | b);
+    }
+
+    static int scalar_and(int a, int b) {
+        return (int)(a & b);
+    }
+
+    static int scalar_xor(int a, int b) {
+        return (int)(a ^ b);
+    }
+
+    static int scalar_add(int a, int b) {
+        return (int)(a + b);
+    }
+
+    static int scalar_sub(int a, int b) {
+        return (int)(a - b);
+    }
+
+    static int scalar_mul(int a, int b) {
+        return (int)(a * b);
+    }
+
+    static int scalar_min(int a, int b) {
+        return (int)(Math.min(a, b));
+    }
+
+    static int scalar_max(int a, int b) {
+        return (int)(Math.max(a, b));
+    }
+
+    static int scalar_div(int a, int b) {
+        return (int)(a / b);
+    }
+
+    static int scalar_fma(int a, int b, int c) {
+        return (int)(Math.fma(a, b, c));
+    }
+
+    static int scalar_abs(int a) {
+        return (int)(Math.abs(a));
+    }
+
+    static int scalar_neg(int a) {
+        return ((int)-a);
+    }
+
+
     static boolean ult(int a, int b) {
         return Integer.compareUnsigned(a, b) < 0;
     }
@@ -1547,9 +1600,6 @@ public class IntVector512Tests extends AbstractVectorTest {
         return Integer.compareUnsigned(a, b) >= 0;
     }
 
-    static int firstNonZero(int a, int b) {
-        return Integer.compare(a, (int) 0) != 0 ? a : b;
-    }
 
     @Test
     static void smokeTest1() {
@@ -1663,7 +1713,7 @@ public class IntVector512Tests extends AbstractVectorTest {
     }
 
     static int ADD(int a, int b) {
-        return (int)(a + b);
+        return (int)(scalar_add(a, b));
     }
 
     @Test(dataProvider = "intBinaryOpProvider")
@@ -1684,7 +1734,7 @@ public class IntVector512Tests extends AbstractVectorTest {
     }
 
     static int add(int a, int b) {
-        return (int)(a + b);
+        return (int)(scalar_add(a, b));
     }
 
     @Test(dataProvider = "intBinaryOpProvider")
@@ -1741,7 +1791,7 @@ public class IntVector512Tests extends AbstractVectorTest {
     }
 
     static int SUB(int a, int b) {
-        return (int)(a - b);
+        return (int)(scalar_sub(a, b));
     }
 
     @Test(dataProvider = "intBinaryOpProvider")
@@ -1762,7 +1812,7 @@ public class IntVector512Tests extends AbstractVectorTest {
     }
 
     static int sub(int a, int b) {
-        return (int)(a - b);
+        return (int)(scalar_sub(a, b));
     }
 
     @Test(dataProvider = "intBinaryOpProvider")
@@ -1819,7 +1869,7 @@ public class IntVector512Tests extends AbstractVectorTest {
     }
 
     static int MUL(int a, int b) {
-        return (int)(a * b);
+        return (int)(scalar_mul(a, b));
     }
 
     @Test(dataProvider = "intBinaryOpProvider")
@@ -1840,7 +1890,7 @@ public class IntVector512Tests extends AbstractVectorTest {
     }
 
     static int mul(int a, int b) {
-        return (int)(a * b);
+        return (int)(scalar_mul(a, b));
     }
 
     @Test(dataProvider = "intBinaryOpProvider")
@@ -1987,7 +2037,7 @@ public class IntVector512Tests extends AbstractVectorTest {
     }
 
     static int FIRST_NONZERO(int a, int b) {
-        return (int)((a)!=0?a:b);
+        return (int)(firstNonZero(a, b));
     }
 
     @Test(dataProvider = "intBinaryOpProvider")
@@ -3283,7 +3333,7 @@ public class IntVector512Tests extends AbstractVectorTest {
     }
 
     static int MIN(int a, int b) {
-        return (int)(Math.min(a, b));
+        return (int)(scalar_min(a, b));
     }
 
     @Test(dataProvider = "intBinaryOpProvider")
@@ -3304,7 +3354,7 @@ public class IntVector512Tests extends AbstractVectorTest {
     }
 
     static int min(int a, int b) {
-        return (int)(Math.min(a, b));
+        return (int)(scalar_min(a, b));
     }
 
     @Test(dataProvider = "intBinaryOpProvider")
@@ -3323,7 +3373,7 @@ public class IntVector512Tests extends AbstractVectorTest {
     }
 
     static int MAX(int a, int b) {
-        return (int)(Math.max(a, b));
+        return (int)(scalar_max(a, b));
     }
 
     @Test(dataProvider = "intBinaryOpProvider")
@@ -3344,7 +3394,7 @@ public class IntVector512Tests extends AbstractVectorTest {
     }
 
     static int max(int a, int b) {
-        return (int)(Math.max(a, b));
+        return (int)(scalar_max(a, b));
     }
 
     @Test(dataProvider = "intBinaryOpProvider")
@@ -3712,7 +3762,7 @@ public class IntVector512Tests extends AbstractVectorTest {
     static int ANDReduce(int[] a, int idx) {
         int res = AND_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res &= a[i];
+            res = scalar_and(res, a[i]);
         }
 
         return res;
@@ -3721,7 +3771,7 @@ public class IntVector512Tests extends AbstractVectorTest {
     static int ANDReduceAll(int[] a) {
         int res = AND_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res &= ANDReduce(a, i);
+            res = scalar_and(res, ANDReduce(a, i));
         }
 
         return res;
@@ -3739,7 +3789,7 @@ public class IntVector512Tests extends AbstractVectorTest {
                 IntVector av = IntVector.fromArray(SPECIES, a, i);
                 int v = av.reduceLanes(VectorOperators.AND);
                 r[i] = v;
-                ra &= v;
+                ra = scalar_and(ra, v);
             }
         }
 
@@ -3752,20 +3802,20 @@ public class IntVector512Tests extends AbstractVectorTest {
         int[] a = fa.apply(SPECIES.length());
         int id = AND_IDENTITY;
 
-        assertEquals((int) (id & id), id,
+        assertEquals((int) (scalar_and(id, id)), id,
                             "AND(AND_IDENTITY, AND_IDENTITY) != AND_IDENTITY");
 
         int x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((int) (id & x), x);
-                assertEquals((int) (x & id), x);
+                assertEquals((int) (scalar_and(id, x)), x);
+                assertEquals((int) (scalar_and(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((int) (id & x), x,
+            assertEquals((int) (scalar_and(id, x)), x,
                                 "AND(AND_IDENTITY, " + x + ") != " + x);
-            assertEquals((int) (x & id), x,
+            assertEquals((int) (scalar_and(x, id)), x,
                                 "AND(" + x + ", AND_IDENTITY) != " + x);
         }
     }
@@ -3774,7 +3824,7 @@ public class IntVector512Tests extends AbstractVectorTest {
         int res = AND_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res &= a[i];
+                res = scalar_and(res, a[i]);
         }
 
         return res;
@@ -3783,7 +3833,7 @@ public class IntVector512Tests extends AbstractVectorTest {
     static int ANDReduceAllMasked(int[] a, boolean[] mask) {
         int res = AND_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res &= ANDReduceMasked(a, i, mask);
+            res = scalar_and(res, ANDReduceMasked(a, i, mask));
         }
 
         return res;
@@ -3803,7 +3853,7 @@ public class IntVector512Tests extends AbstractVectorTest {
                 IntVector av = IntVector.fromArray(SPECIES, a, i);
                 int v = av.reduceLanes(VectorOperators.AND, vmask);
                 r[i] = v;
-                ra &= v;
+                ra = scalar_and(ra, v);
             }
         }
 
@@ -3814,7 +3864,7 @@ public class IntVector512Tests extends AbstractVectorTest {
     static int ORReduce(int[] a, int idx) {
         int res = OR_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res |= a[i];
+            res = scalar_or(res, a[i]);
         }
 
         return res;
@@ -3823,7 +3873,7 @@ public class IntVector512Tests extends AbstractVectorTest {
     static int ORReduceAll(int[] a) {
         int res = OR_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res |= ORReduce(a, i);
+            res = scalar_or(res, ORReduce(a, i));
         }
 
         return res;
@@ -3841,7 +3891,7 @@ public class IntVector512Tests extends AbstractVectorTest {
                 IntVector av = IntVector.fromArray(SPECIES, a, i);
                 int v = av.reduceLanes(VectorOperators.OR);
                 r[i] = v;
-                ra |= v;
+                ra = scalar_or(ra, v);
             }
         }
 
@@ -3854,20 +3904,20 @@ public class IntVector512Tests extends AbstractVectorTest {
         int[] a = fa.apply(SPECIES.length());
         int id = OR_IDENTITY;
 
-        assertEquals((int) (id | id), id,
+        assertEquals((int) (scalar_or(id, id)), id,
                             "OR(OR_IDENTITY, OR_IDENTITY) != OR_IDENTITY");
 
         int x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((int) (id | x), x);
-                assertEquals((int) (x | id), x);
+                assertEquals((int) (scalar_or(id, x)), x);
+                assertEquals((int) (scalar_or(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((int) (id | x), x,
+            assertEquals((int) (scalar_or(id, x)), x,
                                 "OR(OR_IDENTITY, " + x + ") != " + x);
-            assertEquals((int) (x | id), x,
+            assertEquals((int) (scalar_or(x, id)), x,
                                 "OR(" + x + ", OR_IDENTITY) != " + x);
         }
     }
@@ -3876,7 +3926,7 @@ public class IntVector512Tests extends AbstractVectorTest {
         int res = OR_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res |= a[i];
+                res = scalar_or(res, a[i]);
         }
 
         return res;
@@ -3885,7 +3935,7 @@ public class IntVector512Tests extends AbstractVectorTest {
     static int ORReduceAllMasked(int[] a, boolean[] mask) {
         int res = OR_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res |= ORReduceMasked(a, i, mask);
+            res = scalar_or(res, ORReduceMasked(a, i, mask));
         }
 
         return res;
@@ -3905,7 +3955,7 @@ public class IntVector512Tests extends AbstractVectorTest {
                 IntVector av = IntVector.fromArray(SPECIES, a, i);
                 int v = av.reduceLanes(VectorOperators.OR, vmask);
                 r[i] = v;
-                ra |= v;
+                ra = scalar_or(ra, v);
             }
         }
 
@@ -3916,7 +3966,7 @@ public class IntVector512Tests extends AbstractVectorTest {
     static int XORReduce(int[] a, int idx) {
         int res = XOR_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res ^= a[i];
+            res = scalar_xor(res, a[i]);
         }
 
         return res;
@@ -3925,7 +3975,7 @@ public class IntVector512Tests extends AbstractVectorTest {
     static int XORReduceAll(int[] a) {
         int res = XOR_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res ^= XORReduce(a, i);
+            res = scalar_xor(res, XORReduce(a, i));
         }
 
         return res;
@@ -3943,7 +3993,7 @@ public class IntVector512Tests extends AbstractVectorTest {
                 IntVector av = IntVector.fromArray(SPECIES, a, i);
                 int v = av.reduceLanes(VectorOperators.XOR);
                 r[i] = v;
-                ra ^= v;
+                ra = scalar_xor(ra, v);
             }
         }
 
@@ -3956,20 +4006,20 @@ public class IntVector512Tests extends AbstractVectorTest {
         int[] a = fa.apply(SPECIES.length());
         int id = XOR_IDENTITY;
 
-        assertEquals((int) (id ^ id), id,
+        assertEquals((int) (scalar_xor(id, id)), id,
                             "XOR(XOR_IDENTITY, XOR_IDENTITY) != XOR_IDENTITY");
 
         int x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((int) (id ^ x), x);
-                assertEquals((int) (x ^ id), x);
+                assertEquals((int) (scalar_xor(id, x)), x);
+                assertEquals((int) (scalar_xor(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((int) (id ^ x), x,
+            assertEquals((int) (scalar_xor(id, x)), x,
                                 "XOR(XOR_IDENTITY, " + x + ") != " + x);
-            assertEquals((int) (x ^ id), x,
+            assertEquals((int) (scalar_xor(x, id)), x,
                                 "XOR(" + x + ", XOR_IDENTITY) != " + x);
         }
     }
@@ -3978,7 +4028,7 @@ public class IntVector512Tests extends AbstractVectorTest {
         int res = XOR_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res ^= a[i];
+                res = scalar_xor(res, a[i]);
         }
 
         return res;
@@ -3987,7 +4037,7 @@ public class IntVector512Tests extends AbstractVectorTest {
     static int XORReduceAllMasked(int[] a, boolean[] mask) {
         int res = XOR_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res ^= XORReduceMasked(a, i, mask);
+            res = scalar_xor(res, XORReduceMasked(a, i, mask));
         }
 
         return res;
@@ -4007,7 +4057,7 @@ public class IntVector512Tests extends AbstractVectorTest {
                 IntVector av = IntVector.fromArray(SPECIES, a, i);
                 int v = av.reduceLanes(VectorOperators.XOR, vmask);
                 r[i] = v;
-                ra ^= v;
+                ra = scalar_xor(ra, v);
             }
         }
 
@@ -4018,7 +4068,7 @@ public class IntVector512Tests extends AbstractVectorTest {
     static int ADDReduce(int[] a, int idx) {
         int res = ADD_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res += a[i];
+            res = scalar_add(res, a[i]);
         }
 
         return res;
@@ -4027,7 +4077,7 @@ public class IntVector512Tests extends AbstractVectorTest {
     static int ADDReduceAll(int[] a) {
         int res = ADD_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduce(a, i);
+            res = scalar_add(res, ADDReduce(a, i));
         }
 
         return res;
@@ -4045,7 +4095,7 @@ public class IntVector512Tests extends AbstractVectorTest {
                 IntVector av = IntVector.fromArray(SPECIES, a, i);
                 int v = av.reduceLanes(VectorOperators.ADD);
                 r[i] = v;
-                ra += v;
+                ra = scalar_add(ra, v);
             }
         }
 
@@ -4058,20 +4108,20 @@ public class IntVector512Tests extends AbstractVectorTest {
         int[] a = fa.apply(SPECIES.length());
         int id = ADD_IDENTITY;
 
-        assertEquals((int) (id + id), id,
+        assertEquals((int) (scalar_add(id, id)), id,
                             "ADD(ADD_IDENTITY, ADD_IDENTITY) != ADD_IDENTITY");
 
         int x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((int) (id + x), x);
-                assertEquals((int) (x + id), x);
+                assertEquals((int) (scalar_add(id, x)), x);
+                assertEquals((int) (scalar_add(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((int) (id + x), x,
+            assertEquals((int) (scalar_add(id, x)), x,
                                 "ADD(ADD_IDENTITY, " + x + ") != " + x);
-            assertEquals((int) (x + id), x,
+            assertEquals((int) (scalar_add(x, id)), x,
                                 "ADD(" + x + ", ADD_IDENTITY) != " + x);
         }
     }
@@ -4080,7 +4130,7 @@ public class IntVector512Tests extends AbstractVectorTest {
         int res = ADD_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res += a[i];
+                res = scalar_add(res, a[i]);
         }
 
         return res;
@@ -4089,7 +4139,7 @@ public class IntVector512Tests extends AbstractVectorTest {
     static int ADDReduceAllMasked(int[] a, boolean[] mask) {
         int res = ADD_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduceMasked(a, i, mask);
+            res = scalar_add(res, ADDReduceMasked(a, i, mask));
         }
 
         return res;
@@ -4109,7 +4159,7 @@ public class IntVector512Tests extends AbstractVectorTest {
                 IntVector av = IntVector.fromArray(SPECIES, a, i);
                 int v = av.reduceLanes(VectorOperators.ADD, vmask);
                 r[i] = v;
-                ra += v;
+                ra = scalar_add(ra, v);
             }
         }
 
@@ -4120,7 +4170,7 @@ public class IntVector512Tests extends AbstractVectorTest {
     static int MULReduce(int[] a, int idx) {
         int res = MUL_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res *= a[i];
+            res = scalar_mul(res, a[i]);
         }
 
         return res;
@@ -4129,7 +4179,7 @@ public class IntVector512Tests extends AbstractVectorTest {
     static int MULReduceAll(int[] a) {
         int res = MUL_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res *= MULReduce(a, i);
+            res = scalar_mul(res, MULReduce(a, i));
         }
 
         return res;
@@ -4147,7 +4197,7 @@ public class IntVector512Tests extends AbstractVectorTest {
                 IntVector av = IntVector.fromArray(SPECIES, a, i);
                 int v = av.reduceLanes(VectorOperators.MUL);
                 r[i] = v;
-                ra *= v;
+                ra = scalar_mul(ra, v);
             }
         }
 
@@ -4160,20 +4210,20 @@ public class IntVector512Tests extends AbstractVectorTest {
         int[] a = fa.apply(SPECIES.length());
         int id = MUL_IDENTITY;
 
-        assertEquals((int) (id * id), id,
+        assertEquals((int) (scalar_mul(id, id)), id,
                             "MUL(MUL_IDENTITY, MUL_IDENTITY) != MUL_IDENTITY");
 
         int x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((int) (id * x), x);
-                assertEquals((int) (x * id), x);
+                assertEquals((int) (scalar_mul(id, x)), x);
+                assertEquals((int) (scalar_mul(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((int) (id * x), x,
+            assertEquals((int) (scalar_mul(id, x)), x,
                                 "MUL(MUL_IDENTITY, " + x + ") != " + x);
-            assertEquals((int) (x * id), x,
+            assertEquals((int) (scalar_mul(x, id)), x,
                                 "MUL(" + x + ", MUL_IDENTITY) != " + x);
         }
     }
@@ -4182,7 +4232,7 @@ public class IntVector512Tests extends AbstractVectorTest {
         int res = MUL_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res *= a[i];
+                res = scalar_mul(res, a[i]);
         }
 
         return res;
@@ -4191,7 +4241,7 @@ public class IntVector512Tests extends AbstractVectorTest {
     static int MULReduceAllMasked(int[] a, boolean[] mask) {
         int res = MUL_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res *= MULReduceMasked(a, i, mask);
+            res = scalar_mul(res, MULReduceMasked(a, i, mask));
         }
 
         return res;
@@ -4211,7 +4261,7 @@ public class IntVector512Tests extends AbstractVectorTest {
                 IntVector av = IntVector.fromArray(SPECIES, a, i);
                 int v = av.reduceLanes(VectorOperators.MUL, vmask);
                 r[i] = v;
-                ra *= v;
+                ra = scalar_mul(ra, v);
             }
         }
 
@@ -4222,7 +4272,7 @@ public class IntVector512Tests extends AbstractVectorTest {
     static int MINReduce(int[] a, int idx) {
         int res = MIN_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res = (int) Math.min(res, a[i]);
+            res = scalar_min(res, a[i]);
         }
 
         return res;
@@ -4231,7 +4281,7 @@ public class IntVector512Tests extends AbstractVectorTest {
     static int MINReduceAll(int[] a) {
         int res = MIN_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (int) Math.min(res, MINReduce(a, i));
+            res = scalar_min(res, MINReduce(a, i));
         }
 
         return res;
@@ -4249,7 +4299,7 @@ public class IntVector512Tests extends AbstractVectorTest {
                 IntVector av = IntVector.fromArray(SPECIES, a, i);
                 int v = av.reduceLanes(VectorOperators.MIN);
                 r[i] = v;
-                ra = (int) Math.min(ra, v);
+                ra = scalar_min(ra, v);
             }
         }
 
@@ -4262,20 +4312,20 @@ public class IntVector512Tests extends AbstractVectorTest {
         int[] a = fa.apply(SPECIES.length());
         int id = MIN_IDENTITY;
 
-        assertEquals((int) Math.min(id, id), id,
+        assertEquals(scalar_min(id, id), id,
                             "MIN(MIN_IDENTITY, MIN_IDENTITY) != MIN_IDENTITY");
 
         int x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((int) Math.min(id, x), x);
-                assertEquals((int) Math.min(x, id), x);
+                assertEquals(scalar_min(id, x), x);
+                assertEquals(scalar_min(x, id), x);
             }
         } catch (AssertionError e) {
-            assertEquals((int) Math.min(id, x), x,
+            assertEquals(scalar_min(id, x), x,
                                 "MIN(MIN_IDENTITY, " + x + ") != " + x);
-            assertEquals((int) Math.min(x, id), x,
+            assertEquals(scalar_min(x, id), x,
                                 "MIN(" + x + ", MIN_IDENTITY) != " + x);
         }
     }
@@ -4284,7 +4334,7 @@ public class IntVector512Tests extends AbstractVectorTest {
         int res = MIN_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res = (int) Math.min(res, a[i]);
+                res = scalar_min(res, a[i]);
         }
 
         return res;
@@ -4293,7 +4343,7 @@ public class IntVector512Tests extends AbstractVectorTest {
     static int MINReduceAllMasked(int[] a, boolean[] mask) {
         int res = MIN_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (int) Math.min(res, MINReduceMasked(a, i, mask));
+            res = scalar_min(res, MINReduceMasked(a, i, mask));
         }
 
         return res;
@@ -4313,7 +4363,7 @@ public class IntVector512Tests extends AbstractVectorTest {
                 IntVector av = IntVector.fromArray(SPECIES, a, i);
                 int v = av.reduceLanes(VectorOperators.MIN, vmask);
                 r[i] = v;
-                ra = (int) Math.min(ra, v);
+                ra = scalar_min(ra, v);
             }
         }
 
@@ -4324,7 +4374,7 @@ public class IntVector512Tests extends AbstractVectorTest {
     static int MAXReduce(int[] a, int idx) {
         int res = MAX_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res = (int) Math.max(res, a[i]);
+            res = scalar_max(res, a[i]);
         }
 
         return res;
@@ -4333,7 +4383,7 @@ public class IntVector512Tests extends AbstractVectorTest {
     static int MAXReduceAll(int[] a) {
         int res = MAX_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (int) Math.max(res, MAXReduce(a, i));
+            res = scalar_max(res, MAXReduce(a, i));
         }
 
         return res;
@@ -4351,7 +4401,7 @@ public class IntVector512Tests extends AbstractVectorTest {
                 IntVector av = IntVector.fromArray(SPECIES, a, i);
                 int v = av.reduceLanes(VectorOperators.MAX);
                 r[i] = v;
-                ra = (int) Math.max(ra, v);
+                ra = scalar_max(ra, v);
             }
         }
 
@@ -4364,20 +4414,20 @@ public class IntVector512Tests extends AbstractVectorTest {
         int[] a = fa.apply(SPECIES.length());
         int id = MAX_IDENTITY;
 
-        assertEquals((int) Math.max(id, id), id,
+        assertEquals(scalar_max(id, id), id,
                             "MAX(MAX_IDENTITY, MAX_IDENTITY) != MAX_IDENTITY");
 
         int x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((int) Math.max(id, x), x);
-                assertEquals((int) Math.max(x, id), x);
+                assertEquals(scalar_max(id, x), x);
+                assertEquals(scalar_max(x, id), x);
             }
         } catch (AssertionError e) {
-            assertEquals((int) Math.max(id, x), x,
+            assertEquals(scalar_max(id, x), x,
                                 "MAX(MAX_IDENTITY, " + x + ") != " + x);
-            assertEquals((int) Math.max(x, id), x,
+            assertEquals(scalar_max(x, id), x,
                                 "MAX(" + x + ", MAX_IDENTITY) != " + x);
         }
     }
@@ -4386,7 +4436,7 @@ public class IntVector512Tests extends AbstractVectorTest {
         int res = MAX_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res = (int) Math.max(res, a[i]);
+                res = scalar_max(res, a[i]);
         }
 
         return res;
@@ -4395,7 +4445,7 @@ public class IntVector512Tests extends AbstractVectorTest {
     static int MAXReduceAllMasked(int[] a, boolean[] mask) {
         int res = MAX_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (int) Math.max(res, MAXReduceMasked(a, i, mask));
+            res = scalar_max(res, MAXReduceMasked(a, i, mask));
         }
 
         return res;
@@ -4415,7 +4465,7 @@ public class IntVector512Tests extends AbstractVectorTest {
                 IntVector av = IntVector.fromArray(SPECIES, a, i);
                 int v = av.reduceLanes(VectorOperators.MAX, vmask);
                 r[i] = v;
-                ra = (int) Math.max(ra, v);
+                ra = scalar_max(ra, v);
             }
         }
 
@@ -5448,7 +5498,7 @@ public class IntVector512Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] < b[i]);
+                assertEquals(mv.laneIsSet(j), lt(a[i + j], b[i]));
             }
         }
     }
@@ -5468,7 +5518,7 @@ public class IntVector512Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] < b[i]));
+                assertEquals(mv.laneIsSet(j), mask[j] && (lt(a[i + j], b[i])));
             }
         }
     }
@@ -5484,7 +5534,7 @@ public class IntVector512Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] < (int)((long)b[i]));
+                assertEquals(mv.laneIsSet(j), lt(a[i + j], (int)((long)b[i])));
             }
         }
     }
@@ -5504,7 +5554,7 @@ public class IntVector512Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] < (int)((long)b[i])));
+                assertEquals(mv.laneIsSet(j), mask[j] && (lt(a[i + j], (int)((long)b[i]))));
             }
         }
     }
@@ -5520,7 +5570,7 @@ public class IntVector512Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] == b[i]);
+                assertEquals(mv.laneIsSet(j), eq(a[i + j], b[i]));
             }
         }
     }
@@ -5540,7 +5590,7 @@ public class IntVector512Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] == b[i]));
+                assertEquals(mv.laneIsSet(j), mask[j] && (eq(a[i + j], b[i])));
             }
         }
     }
@@ -5556,7 +5606,7 @@ public class IntVector512Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] == (int)((long)b[i]));
+                assertEquals(mv.laneIsSet(j), eq(a[i + j], (int)((long)b[i])));
             }
         }
     }
@@ -5576,7 +5626,7 @@ public class IntVector512Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] == (int)((long)b[i])));
+                assertEquals(mv.laneIsSet(j), mask[j] && (eq(a[i + j], (int)((long)b[i]))));
             }
         }
     }
@@ -6288,11 +6338,11 @@ public class IntVector512Tests extends AbstractVectorTest {
     }
 
     static int NEG(int a) {
-        return (int)(-((int)a));
+        return (int)(scalar_neg((int)a));
     }
 
     static int neg(int a) {
-        return (int)(-((int)a));
+        return (int)(scalar_neg((int)a));
     }
 
     @Test(dataProvider = "intUnaryOpProvider")
@@ -6344,11 +6394,11 @@ public class IntVector512Tests extends AbstractVectorTest {
     }
 
     static int ABS(int a) {
-        return (int)(Math.abs((int)a));
+        return (int)(scalar_abs((int)a));
     }
 
     static int abs(int a) {
-        return (int)(Math.abs((int)a));
+        return (int)(scalar_abs((int)a));
     }
 
     @Test(dataProvider = "intUnaryOpProvider")
@@ -6839,7 +6889,7 @@ public class IntVector512Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] < b[i]);
+                assertEquals(mv.laneIsSet(j), lt(a[i + j], b[i]));
             }
         }
     }
@@ -6855,7 +6905,7 @@ public class IntVector512Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] == b[i]);
+                assertEquals(mv.laneIsSet(j), eq(a[i + j], b[i]));
             }
         }
     }
@@ -6924,7 +6974,7 @@ public class IntVector512Tests extends AbstractVectorTest {
     static long ADDReduceLong(int[] a, int idx) {
         int res = 0;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res += a[i];
+            res = scalar_add(res, a[i]);
         }
 
         return (long)res;
@@ -6933,7 +6983,7 @@ public class IntVector512Tests extends AbstractVectorTest {
     static long ADDReduceAllLong(int[] a) {
         long res = 0;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduceLong(a, i);
+            res = (long)scalar_add((int)res, (int)ADDReduceLong(a, i));
         }
 
         return res;
@@ -6951,8 +7001,8 @@ public class IntVector512Tests extends AbstractVectorTest {
         }
 
         ra = 0;
-        for (int i = 0; i < a.length; i ++) {
-            ra += r[i];
+        for (int i = 0; i < a.length; i++) {
+            ra = (long)scalar_add((int)ra, (int)r[i]);
         }
 
         assertReductionLongArraysEquals(r, ra, a,
@@ -6962,8 +7012,9 @@ public class IntVector512Tests extends AbstractVectorTest {
     static long ADDReduceLongMasked(int[] a, int idx, boolean[] mask) {
         int res = 0;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            if(mask[i % SPECIES.length()])
-                res += a[i];
+            if (mask[i % SPECIES.length()]) {
+                res = scalar_add(res, a[i]);
+            }
         }
 
         return (long)res;
@@ -6972,7 +7023,7 @@ public class IntVector512Tests extends AbstractVectorTest {
     static long ADDReduceAllLongMasked(int[] a, boolean[] mask) {
         long res = 0;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduceLongMasked(a, i, mask);
+            res = (long)scalar_add((int)res, (int)ADDReduceLongMasked(a, i, mask));
         }
 
         return res;
@@ -6992,8 +7043,8 @@ public class IntVector512Tests extends AbstractVectorTest {
         }
 
         ra = 0;
-        for (int i = 0; i < a.length; i ++) {
-            ra += r[i];
+        for (int i = 0; i < a.length; i++) {
+            ra = (long)scalar_add((int)ra, (int)r[i]);
         }
 
         assertReductionLongArraysEqualsMasked(r, ra, a, mask,
diff --git a/test/jdk/jdk/incubator/vector/IntVector64Tests.java b/test/jdk/jdk/incubator/vector/IntVector64Tests.java
index 0715981e050..9d3849a2c04 100644
--- a/test/jdk/jdk/incubator/vector/IntVector64Tests.java
+++ b/test/jdk/jdk/incubator/vector/IntVector64Tests.java
@@ -1531,6 +1531,59 @@ public class IntVector64Tests extends AbstractVectorTest {
         return a >= b;
     }
 
+    static int firstNonZero(int a, int b) {
+        return Integer.compare(a, (int) 0) != 0 ? a : b;
+    }
+
+    static int scalar_or(int a, int b) {
+        return (int)(a | b);
+    }
+
+    static int scalar_and(int a, int b) {
+        return (int)(a & b);
+    }
+
+    static int scalar_xor(int a, int b) {
+        return (int)(a ^ b);
+    }
+
+    static int scalar_add(int a, int b) {
+        return (int)(a + b);
+    }
+
+    static int scalar_sub(int a, int b) {
+        return (int)(a - b);
+    }
+
+    static int scalar_mul(int a, int b) {
+        return (int)(a * b);
+    }
+
+    static int scalar_min(int a, int b) {
+        return (int)(Math.min(a, b));
+    }
+
+    static int scalar_max(int a, int b) {
+        return (int)(Math.max(a, b));
+    }
+
+    static int scalar_div(int a, int b) {
+        return (int)(a / b);
+    }
+
+    static int scalar_fma(int a, int b, int c) {
+        return (int)(Math.fma(a, b, c));
+    }
+
+    static int scalar_abs(int a) {
+        return (int)(Math.abs(a));
+    }
+
+    static int scalar_neg(int a) {
+        return ((int)-a);
+    }
+
+
     static boolean ult(int a, int b) {
         return Integer.compareUnsigned(a, b) < 0;
     }
@@ -1547,9 +1600,6 @@ public class IntVector64Tests extends AbstractVectorTest {
         return Integer.compareUnsigned(a, b) >= 0;
     }
 
-    static int firstNonZero(int a, int b) {
-        return Integer.compare(a, (int) 0) != 0 ? a : b;
-    }
 
     @Test
     static void smokeTest1() {
@@ -1663,7 +1713,7 @@ public class IntVector64Tests extends AbstractVectorTest {
     }
 
     static int ADD(int a, int b) {
-        return (int)(a + b);
+        return (int)(scalar_add(a, b));
     }
 
     @Test(dataProvider = "intBinaryOpProvider")
@@ -1684,7 +1734,7 @@ public class IntVector64Tests extends AbstractVectorTest {
     }
 
     static int add(int a, int b) {
-        return (int)(a + b);
+        return (int)(scalar_add(a, b));
     }
 
     @Test(dataProvider = "intBinaryOpProvider")
@@ -1741,7 +1791,7 @@ public class IntVector64Tests extends AbstractVectorTest {
     }
 
     static int SUB(int a, int b) {
-        return (int)(a - b);
+        return (int)(scalar_sub(a, b));
     }
 
     @Test(dataProvider = "intBinaryOpProvider")
@@ -1762,7 +1812,7 @@ public class IntVector64Tests extends AbstractVectorTest {
     }
 
     static int sub(int a, int b) {
-        return (int)(a - b);
+        return (int)(scalar_sub(a, b));
     }
 
     @Test(dataProvider = "intBinaryOpProvider")
@@ -1819,7 +1869,7 @@ public class IntVector64Tests extends AbstractVectorTest {
     }
 
     static int MUL(int a, int b) {
-        return (int)(a * b);
+        return (int)(scalar_mul(a, b));
     }
 
     @Test(dataProvider = "intBinaryOpProvider")
@@ -1840,7 +1890,7 @@ public class IntVector64Tests extends AbstractVectorTest {
     }
 
     static int mul(int a, int b) {
-        return (int)(a * b);
+        return (int)(scalar_mul(a, b));
     }
 
     @Test(dataProvider = "intBinaryOpProvider")
@@ -1987,7 +2037,7 @@ public class IntVector64Tests extends AbstractVectorTest {
     }
 
     static int FIRST_NONZERO(int a, int b) {
-        return (int)((a)!=0?a:b);
+        return (int)(firstNonZero(a, b));
     }
 
     @Test(dataProvider = "intBinaryOpProvider")
@@ -3283,7 +3333,7 @@ public class IntVector64Tests extends AbstractVectorTest {
     }
 
     static int MIN(int a, int b) {
-        return (int)(Math.min(a, b));
+        return (int)(scalar_min(a, b));
     }
 
     @Test(dataProvider = "intBinaryOpProvider")
@@ -3304,7 +3354,7 @@ public class IntVector64Tests extends AbstractVectorTest {
     }
 
     static int min(int a, int b) {
-        return (int)(Math.min(a, b));
+        return (int)(scalar_min(a, b));
     }
 
     @Test(dataProvider = "intBinaryOpProvider")
@@ -3323,7 +3373,7 @@ public class IntVector64Tests extends AbstractVectorTest {
     }
 
     static int MAX(int a, int b) {
-        return (int)(Math.max(a, b));
+        return (int)(scalar_max(a, b));
     }
 
     @Test(dataProvider = "intBinaryOpProvider")
@@ -3344,7 +3394,7 @@ public class IntVector64Tests extends AbstractVectorTest {
     }
 
     static int max(int a, int b) {
-        return (int)(Math.max(a, b));
+        return (int)(scalar_max(a, b));
     }
 
     @Test(dataProvider = "intBinaryOpProvider")
@@ -3712,7 +3762,7 @@ public class IntVector64Tests extends AbstractVectorTest {
     static int ANDReduce(int[] a, int idx) {
         int res = AND_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res &= a[i];
+            res = scalar_and(res, a[i]);
         }
 
         return res;
@@ -3721,7 +3771,7 @@ public class IntVector64Tests extends AbstractVectorTest {
     static int ANDReduceAll(int[] a) {
         int res = AND_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res &= ANDReduce(a, i);
+            res = scalar_and(res, ANDReduce(a, i));
         }
 
         return res;
@@ -3739,7 +3789,7 @@ public class IntVector64Tests extends AbstractVectorTest {
                 IntVector av = IntVector.fromArray(SPECIES, a, i);
                 int v = av.reduceLanes(VectorOperators.AND);
                 r[i] = v;
-                ra &= v;
+                ra = scalar_and(ra, v);
             }
         }
 
@@ -3752,20 +3802,20 @@ public class IntVector64Tests extends AbstractVectorTest {
         int[] a = fa.apply(SPECIES.length());
         int id = AND_IDENTITY;
 
-        assertEquals((int) (id & id), id,
+        assertEquals((int) (scalar_and(id, id)), id,
                             "AND(AND_IDENTITY, AND_IDENTITY) != AND_IDENTITY");
 
         int x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((int) (id & x), x);
-                assertEquals((int) (x & id), x);
+                assertEquals((int) (scalar_and(id, x)), x);
+                assertEquals((int) (scalar_and(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((int) (id & x), x,
+            assertEquals((int) (scalar_and(id, x)), x,
                                 "AND(AND_IDENTITY, " + x + ") != " + x);
-            assertEquals((int) (x & id), x,
+            assertEquals((int) (scalar_and(x, id)), x,
                                 "AND(" + x + ", AND_IDENTITY) != " + x);
         }
     }
@@ -3774,7 +3824,7 @@ public class IntVector64Tests extends AbstractVectorTest {
         int res = AND_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res &= a[i];
+                res = scalar_and(res, a[i]);
         }
 
         return res;
@@ -3783,7 +3833,7 @@ public class IntVector64Tests extends AbstractVectorTest {
     static int ANDReduceAllMasked(int[] a, boolean[] mask) {
         int res = AND_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res &= ANDReduceMasked(a, i, mask);
+            res = scalar_and(res, ANDReduceMasked(a, i, mask));
         }
 
         return res;
@@ -3803,7 +3853,7 @@ public class IntVector64Tests extends AbstractVectorTest {
                 IntVector av = IntVector.fromArray(SPECIES, a, i);
                 int v = av.reduceLanes(VectorOperators.AND, vmask);
                 r[i] = v;
-                ra &= v;
+                ra = scalar_and(ra, v);
             }
         }
 
@@ -3814,7 +3864,7 @@ public class IntVector64Tests extends AbstractVectorTest {
     static int ORReduce(int[] a, int idx) {
         int res = OR_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res |= a[i];
+            res = scalar_or(res, a[i]);
         }
 
         return res;
@@ -3823,7 +3873,7 @@ public class IntVector64Tests extends AbstractVectorTest {
     static int ORReduceAll(int[] a) {
         int res = OR_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res |= ORReduce(a, i);
+            res = scalar_or(res, ORReduce(a, i));
         }
 
         return res;
@@ -3841,7 +3891,7 @@ public class IntVector64Tests extends AbstractVectorTest {
                 IntVector av = IntVector.fromArray(SPECIES, a, i);
                 int v = av.reduceLanes(VectorOperators.OR);
                 r[i] = v;
-                ra |= v;
+                ra = scalar_or(ra, v);
             }
         }
 
@@ -3854,20 +3904,20 @@ public class IntVector64Tests extends AbstractVectorTest {
         int[] a = fa.apply(SPECIES.length());
         int id = OR_IDENTITY;
 
-        assertEquals((int) (id | id), id,
+        assertEquals((int) (scalar_or(id, id)), id,
                             "OR(OR_IDENTITY, OR_IDENTITY) != OR_IDENTITY");
 
         int x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((int) (id | x), x);
-                assertEquals((int) (x | id), x);
+                assertEquals((int) (scalar_or(id, x)), x);
+                assertEquals((int) (scalar_or(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((int) (id | x), x,
+            assertEquals((int) (scalar_or(id, x)), x,
                                 "OR(OR_IDENTITY, " + x + ") != " + x);
-            assertEquals((int) (x | id), x,
+            assertEquals((int) (scalar_or(x, id)), x,
                                 "OR(" + x + ", OR_IDENTITY) != " + x);
         }
     }
@@ -3876,7 +3926,7 @@ public class IntVector64Tests extends AbstractVectorTest {
         int res = OR_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res |= a[i];
+                res = scalar_or(res, a[i]);
         }
 
         return res;
@@ -3885,7 +3935,7 @@ public class IntVector64Tests extends AbstractVectorTest {
     static int ORReduceAllMasked(int[] a, boolean[] mask) {
         int res = OR_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res |= ORReduceMasked(a, i, mask);
+            res = scalar_or(res, ORReduceMasked(a, i, mask));
         }
 
         return res;
@@ -3905,7 +3955,7 @@ public class IntVector64Tests extends AbstractVectorTest {
                 IntVector av = IntVector.fromArray(SPECIES, a, i);
                 int v = av.reduceLanes(VectorOperators.OR, vmask);
                 r[i] = v;
-                ra |= v;
+                ra = scalar_or(ra, v);
             }
         }
 
@@ -3916,7 +3966,7 @@ public class IntVector64Tests extends AbstractVectorTest {
     static int XORReduce(int[] a, int idx) {
         int res = XOR_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res ^= a[i];
+            res = scalar_xor(res, a[i]);
         }
 
         return res;
@@ -3925,7 +3975,7 @@ public class IntVector64Tests extends AbstractVectorTest {
     static int XORReduceAll(int[] a) {
         int res = XOR_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res ^= XORReduce(a, i);
+            res = scalar_xor(res, XORReduce(a, i));
         }
 
         return res;
@@ -3943,7 +3993,7 @@ public class IntVector64Tests extends AbstractVectorTest {
                 IntVector av = IntVector.fromArray(SPECIES, a, i);
                 int v = av.reduceLanes(VectorOperators.XOR);
                 r[i] = v;
-                ra ^= v;
+                ra = scalar_xor(ra, v);
             }
         }
 
@@ -3956,20 +4006,20 @@ public class IntVector64Tests extends AbstractVectorTest {
         int[] a = fa.apply(SPECIES.length());
         int id = XOR_IDENTITY;
 
-        assertEquals((int) (id ^ id), id,
+        assertEquals((int) (scalar_xor(id, id)), id,
                             "XOR(XOR_IDENTITY, XOR_IDENTITY) != XOR_IDENTITY");
 
         int x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((int) (id ^ x), x);
-                assertEquals((int) (x ^ id), x);
+                assertEquals((int) (scalar_xor(id, x)), x);
+                assertEquals((int) (scalar_xor(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((int) (id ^ x), x,
+            assertEquals((int) (scalar_xor(id, x)), x,
                                 "XOR(XOR_IDENTITY, " + x + ") != " + x);
-            assertEquals((int) (x ^ id), x,
+            assertEquals((int) (scalar_xor(x, id)), x,
                                 "XOR(" + x + ", XOR_IDENTITY) != " + x);
         }
     }
@@ -3978,7 +4028,7 @@ public class IntVector64Tests extends AbstractVectorTest {
         int res = XOR_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res ^= a[i];
+                res = scalar_xor(res, a[i]);
         }
 
         return res;
@@ -3987,7 +4037,7 @@ public class IntVector64Tests extends AbstractVectorTest {
     static int XORReduceAllMasked(int[] a, boolean[] mask) {
         int res = XOR_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res ^= XORReduceMasked(a, i, mask);
+            res = scalar_xor(res, XORReduceMasked(a, i, mask));
         }
 
         return res;
@@ -4007,7 +4057,7 @@ public class IntVector64Tests extends AbstractVectorTest {
                 IntVector av = IntVector.fromArray(SPECIES, a, i);
                 int v = av.reduceLanes(VectorOperators.XOR, vmask);
                 r[i] = v;
-                ra ^= v;
+                ra = scalar_xor(ra, v);
             }
         }
 
@@ -4018,7 +4068,7 @@ public class IntVector64Tests extends AbstractVectorTest {
     static int ADDReduce(int[] a, int idx) {
         int res = ADD_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res += a[i];
+            res = scalar_add(res, a[i]);
         }
 
         return res;
@@ -4027,7 +4077,7 @@ public class IntVector64Tests extends AbstractVectorTest {
     static int ADDReduceAll(int[] a) {
         int res = ADD_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduce(a, i);
+            res = scalar_add(res, ADDReduce(a, i));
         }
 
         return res;
@@ -4045,7 +4095,7 @@ public class IntVector64Tests extends AbstractVectorTest {
                 IntVector av = IntVector.fromArray(SPECIES, a, i);
                 int v = av.reduceLanes(VectorOperators.ADD);
                 r[i] = v;
-                ra += v;
+                ra = scalar_add(ra, v);
             }
         }
 
@@ -4058,20 +4108,20 @@ public class IntVector64Tests extends AbstractVectorTest {
         int[] a = fa.apply(SPECIES.length());
         int id = ADD_IDENTITY;
 
-        assertEquals((int) (id + id), id,
+        assertEquals((int) (scalar_add(id, id)), id,
                             "ADD(ADD_IDENTITY, ADD_IDENTITY) != ADD_IDENTITY");
 
         int x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((int) (id + x), x);
-                assertEquals((int) (x + id), x);
+                assertEquals((int) (scalar_add(id, x)), x);
+                assertEquals((int) (scalar_add(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((int) (id + x), x,
+            assertEquals((int) (scalar_add(id, x)), x,
                                 "ADD(ADD_IDENTITY, " + x + ") != " + x);
-            assertEquals((int) (x + id), x,
+            assertEquals((int) (scalar_add(x, id)), x,
                                 "ADD(" + x + ", ADD_IDENTITY) != " + x);
         }
     }
@@ -4080,7 +4130,7 @@ public class IntVector64Tests extends AbstractVectorTest {
         int res = ADD_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res += a[i];
+                res = scalar_add(res, a[i]);
         }
 
         return res;
@@ -4089,7 +4139,7 @@ public class IntVector64Tests extends AbstractVectorTest {
     static int ADDReduceAllMasked(int[] a, boolean[] mask) {
         int res = ADD_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduceMasked(a, i, mask);
+            res = scalar_add(res, ADDReduceMasked(a, i, mask));
         }
 
         return res;
@@ -4109,7 +4159,7 @@ public class IntVector64Tests extends AbstractVectorTest {
                 IntVector av = IntVector.fromArray(SPECIES, a, i);
                 int v = av.reduceLanes(VectorOperators.ADD, vmask);
                 r[i] = v;
-                ra += v;
+                ra = scalar_add(ra, v);
             }
         }
 
@@ -4120,7 +4170,7 @@ public class IntVector64Tests extends AbstractVectorTest {
     static int MULReduce(int[] a, int idx) {
         int res = MUL_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res *= a[i];
+            res = scalar_mul(res, a[i]);
         }
 
         return res;
@@ -4129,7 +4179,7 @@ public class IntVector64Tests extends AbstractVectorTest {
     static int MULReduceAll(int[] a) {
         int res = MUL_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res *= MULReduce(a, i);
+            res = scalar_mul(res, MULReduce(a, i));
         }
 
         return res;
@@ -4147,7 +4197,7 @@ public class IntVector64Tests extends AbstractVectorTest {
                 IntVector av = IntVector.fromArray(SPECIES, a, i);
                 int v = av.reduceLanes(VectorOperators.MUL);
                 r[i] = v;
-                ra *= v;
+                ra = scalar_mul(ra, v);
             }
         }
 
@@ -4160,20 +4210,20 @@ public class IntVector64Tests extends AbstractVectorTest {
         int[] a = fa.apply(SPECIES.length());
         int id = MUL_IDENTITY;
 
-        assertEquals((int) (id * id), id,
+        assertEquals((int) (scalar_mul(id, id)), id,
                             "MUL(MUL_IDENTITY, MUL_IDENTITY) != MUL_IDENTITY");
 
         int x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((int) (id * x), x);
-                assertEquals((int) (x * id), x);
+                assertEquals((int) (scalar_mul(id, x)), x);
+                assertEquals((int) (scalar_mul(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((int) (id * x), x,
+            assertEquals((int) (scalar_mul(id, x)), x,
                                 "MUL(MUL_IDENTITY, " + x + ") != " + x);
-            assertEquals((int) (x * id), x,
+            assertEquals((int) (scalar_mul(x, id)), x,
                                 "MUL(" + x + ", MUL_IDENTITY) != " + x);
         }
     }
@@ -4182,7 +4232,7 @@ public class IntVector64Tests extends AbstractVectorTest {
         int res = MUL_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res *= a[i];
+                res = scalar_mul(res, a[i]);
         }
 
         return res;
@@ -4191,7 +4241,7 @@ public class IntVector64Tests extends AbstractVectorTest {
     static int MULReduceAllMasked(int[] a, boolean[] mask) {
         int res = MUL_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res *= MULReduceMasked(a, i, mask);
+            res = scalar_mul(res, MULReduceMasked(a, i, mask));
         }
 
         return res;
@@ -4211,7 +4261,7 @@ public class IntVector64Tests extends AbstractVectorTest {
                 IntVector av = IntVector.fromArray(SPECIES, a, i);
                 int v = av.reduceLanes(VectorOperators.MUL, vmask);
                 r[i] = v;
-                ra *= v;
+                ra = scalar_mul(ra, v);
             }
         }
 
@@ -4222,7 +4272,7 @@ public class IntVector64Tests extends AbstractVectorTest {
     static int MINReduce(int[] a, int idx) {
         int res = MIN_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res = (int) Math.min(res, a[i]);
+            res = scalar_min(res, a[i]);
         }
 
         return res;
@@ -4231,7 +4281,7 @@ public class IntVector64Tests extends AbstractVectorTest {
     static int MINReduceAll(int[] a) {
         int res = MIN_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (int) Math.min(res, MINReduce(a, i));
+            res = scalar_min(res, MINReduce(a, i));
         }
 
         return res;
@@ -4249,7 +4299,7 @@ public class IntVector64Tests extends AbstractVectorTest {
                 IntVector av = IntVector.fromArray(SPECIES, a, i);
                 int v = av.reduceLanes(VectorOperators.MIN);
                 r[i] = v;
-                ra = (int) Math.min(ra, v);
+                ra = scalar_min(ra, v);
             }
         }
 
@@ -4262,20 +4312,20 @@ public class IntVector64Tests extends AbstractVectorTest {
         int[] a = fa.apply(SPECIES.length());
         int id = MIN_IDENTITY;
 
-        assertEquals((int) Math.min(id, id), id,
+        assertEquals(scalar_min(id, id), id,
                             "MIN(MIN_IDENTITY, MIN_IDENTITY) != MIN_IDENTITY");
 
         int x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((int) Math.min(id, x), x);
-                assertEquals((int) Math.min(x, id), x);
+                assertEquals(scalar_min(id, x), x);
+                assertEquals(scalar_min(x, id), x);
             }
         } catch (AssertionError e) {
-            assertEquals((int) Math.min(id, x), x,
+            assertEquals(scalar_min(id, x), x,
                                 "MIN(MIN_IDENTITY, " + x + ") != " + x);
-            assertEquals((int) Math.min(x, id), x,
+            assertEquals(scalar_min(x, id), x,
                                 "MIN(" + x + ", MIN_IDENTITY) != " + x);
         }
     }
@@ -4284,7 +4334,7 @@ public class IntVector64Tests extends AbstractVectorTest {
         int res = MIN_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res = (int) Math.min(res, a[i]);
+                res = scalar_min(res, a[i]);
         }
 
         return res;
@@ -4293,7 +4343,7 @@ public class IntVector64Tests extends AbstractVectorTest {
     static int MINReduceAllMasked(int[] a, boolean[] mask) {
         int res = MIN_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (int) Math.min(res, MINReduceMasked(a, i, mask));
+            res = scalar_min(res, MINReduceMasked(a, i, mask));
         }
 
         return res;
@@ -4313,7 +4363,7 @@ public class IntVector64Tests extends AbstractVectorTest {
                 IntVector av = IntVector.fromArray(SPECIES, a, i);
                 int v = av.reduceLanes(VectorOperators.MIN, vmask);
                 r[i] = v;
-                ra = (int) Math.min(ra, v);
+                ra = scalar_min(ra, v);
             }
         }
 
@@ -4324,7 +4374,7 @@ public class IntVector64Tests extends AbstractVectorTest {
     static int MAXReduce(int[] a, int idx) {
         int res = MAX_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res = (int) Math.max(res, a[i]);
+            res = scalar_max(res, a[i]);
         }
 
         return res;
@@ -4333,7 +4383,7 @@ public class IntVector64Tests extends AbstractVectorTest {
     static int MAXReduceAll(int[] a) {
         int res = MAX_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (int) Math.max(res, MAXReduce(a, i));
+            res = scalar_max(res, MAXReduce(a, i));
         }
 
         return res;
@@ -4351,7 +4401,7 @@ public class IntVector64Tests extends AbstractVectorTest {
                 IntVector av = IntVector.fromArray(SPECIES, a, i);
                 int v = av.reduceLanes(VectorOperators.MAX);
                 r[i] = v;
-                ra = (int) Math.max(ra, v);
+                ra = scalar_max(ra, v);
             }
         }
 
@@ -4364,20 +4414,20 @@ public class IntVector64Tests extends AbstractVectorTest {
         int[] a = fa.apply(SPECIES.length());
         int id = MAX_IDENTITY;
 
-        assertEquals((int) Math.max(id, id), id,
+        assertEquals(scalar_max(id, id), id,
                             "MAX(MAX_IDENTITY, MAX_IDENTITY) != MAX_IDENTITY");
 
         int x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((int) Math.max(id, x), x);
-                assertEquals((int) Math.max(x, id), x);
+                assertEquals(scalar_max(id, x), x);
+                assertEquals(scalar_max(x, id), x);
             }
         } catch (AssertionError e) {
-            assertEquals((int) Math.max(id, x), x,
+            assertEquals(scalar_max(id, x), x,
                                 "MAX(MAX_IDENTITY, " + x + ") != " + x);
-            assertEquals((int) Math.max(x, id), x,
+            assertEquals(scalar_max(x, id), x,
                                 "MAX(" + x + ", MAX_IDENTITY) != " + x);
         }
     }
@@ -4386,7 +4436,7 @@ public class IntVector64Tests extends AbstractVectorTest {
         int res = MAX_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res = (int) Math.max(res, a[i]);
+                res = scalar_max(res, a[i]);
         }
 
         return res;
@@ -4395,7 +4445,7 @@ public class IntVector64Tests extends AbstractVectorTest {
     static int MAXReduceAllMasked(int[] a, boolean[] mask) {
         int res = MAX_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (int) Math.max(res, MAXReduceMasked(a, i, mask));
+            res = scalar_max(res, MAXReduceMasked(a, i, mask));
         }
 
         return res;
@@ -4415,7 +4465,7 @@ public class IntVector64Tests extends AbstractVectorTest {
                 IntVector av = IntVector.fromArray(SPECIES, a, i);
                 int v = av.reduceLanes(VectorOperators.MAX, vmask);
                 r[i] = v;
-                ra = (int) Math.max(ra, v);
+                ra = scalar_max(ra, v);
             }
         }
 
@@ -5448,7 +5498,7 @@ public class IntVector64Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] < b[i]);
+                assertEquals(mv.laneIsSet(j), lt(a[i + j], b[i]));
             }
         }
     }
@@ -5468,7 +5518,7 @@ public class IntVector64Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] < b[i]));
+                assertEquals(mv.laneIsSet(j), mask[j] && (lt(a[i + j], b[i])));
             }
         }
     }
@@ -5484,7 +5534,7 @@ public class IntVector64Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] < (int)((long)b[i]));
+                assertEquals(mv.laneIsSet(j), lt(a[i + j], (int)((long)b[i])));
             }
         }
     }
@@ -5504,7 +5554,7 @@ public class IntVector64Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] < (int)((long)b[i])));
+                assertEquals(mv.laneIsSet(j), mask[j] && (lt(a[i + j], (int)((long)b[i]))));
             }
         }
     }
@@ -5520,7 +5570,7 @@ public class IntVector64Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] == b[i]);
+                assertEquals(mv.laneIsSet(j), eq(a[i + j], b[i]));
             }
         }
     }
@@ -5540,7 +5590,7 @@ public class IntVector64Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] == b[i]));
+                assertEquals(mv.laneIsSet(j), mask[j] && (eq(a[i + j], b[i])));
             }
         }
     }
@@ -5556,7 +5606,7 @@ public class IntVector64Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] == (int)((long)b[i]));
+                assertEquals(mv.laneIsSet(j), eq(a[i + j], (int)((long)b[i])));
             }
         }
     }
@@ -5576,7 +5626,7 @@ public class IntVector64Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] == (int)((long)b[i])));
+                assertEquals(mv.laneIsSet(j), mask[j] && (eq(a[i + j], (int)((long)b[i]))));
             }
         }
     }
@@ -6288,11 +6338,11 @@ public class IntVector64Tests extends AbstractVectorTest {
     }
 
     static int NEG(int a) {
-        return (int)(-((int)a));
+        return (int)(scalar_neg((int)a));
     }
 
     static int neg(int a) {
-        return (int)(-((int)a));
+        return (int)(scalar_neg((int)a));
     }
 
     @Test(dataProvider = "intUnaryOpProvider")
@@ -6344,11 +6394,11 @@ public class IntVector64Tests extends AbstractVectorTest {
     }
 
     static int ABS(int a) {
-        return (int)(Math.abs((int)a));
+        return (int)(scalar_abs((int)a));
     }
 
     static int abs(int a) {
-        return (int)(Math.abs((int)a));
+        return (int)(scalar_abs((int)a));
     }
 
     @Test(dataProvider = "intUnaryOpProvider")
@@ -6839,7 +6889,7 @@ public class IntVector64Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] < b[i]);
+                assertEquals(mv.laneIsSet(j), lt(a[i + j], b[i]));
             }
         }
     }
@@ -6855,7 +6905,7 @@ public class IntVector64Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] == b[i]);
+                assertEquals(mv.laneIsSet(j), eq(a[i + j], b[i]));
             }
         }
     }
@@ -6924,7 +6974,7 @@ public class IntVector64Tests extends AbstractVectorTest {
     static long ADDReduceLong(int[] a, int idx) {
         int res = 0;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res += a[i];
+            res = scalar_add(res, a[i]);
         }
 
         return (long)res;
@@ -6933,7 +6983,7 @@ public class IntVector64Tests extends AbstractVectorTest {
     static long ADDReduceAllLong(int[] a) {
         long res = 0;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduceLong(a, i);
+            res = (long)scalar_add((int)res, (int)ADDReduceLong(a, i));
         }
 
         return res;
@@ -6951,8 +7001,8 @@ public class IntVector64Tests extends AbstractVectorTest {
         }
 
         ra = 0;
-        for (int i = 0; i < a.length; i ++) {
-            ra += r[i];
+        for (int i = 0; i < a.length; i++) {
+            ra = (long)scalar_add((int)ra, (int)r[i]);
         }
 
         assertReductionLongArraysEquals(r, ra, a,
@@ -6962,8 +7012,9 @@ public class IntVector64Tests extends AbstractVectorTest {
     static long ADDReduceLongMasked(int[] a, int idx, boolean[] mask) {
         int res = 0;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            if(mask[i % SPECIES.length()])
-                res += a[i];
+            if (mask[i % SPECIES.length()]) {
+                res = scalar_add(res, a[i]);
+            }
         }
 
         return (long)res;
@@ -6972,7 +7023,7 @@ public class IntVector64Tests extends AbstractVectorTest {
     static long ADDReduceAllLongMasked(int[] a, boolean[] mask) {
         long res = 0;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduceLongMasked(a, i, mask);
+            res = (long)scalar_add((int)res, (int)ADDReduceLongMasked(a, i, mask));
         }
 
         return res;
@@ -6992,8 +7043,8 @@ public class IntVector64Tests extends AbstractVectorTest {
         }
 
         ra = 0;
-        for (int i = 0; i < a.length; i ++) {
-            ra += r[i];
+        for (int i = 0; i < a.length; i++) {
+            ra = (long)scalar_add((int)ra, (int)r[i]);
         }
 
         assertReductionLongArraysEqualsMasked(r, ra, a, mask,
diff --git a/test/jdk/jdk/incubator/vector/IntVectorMaxTests.java b/test/jdk/jdk/incubator/vector/IntVectorMaxTests.java
index ad519b36dc9..6c671a81bf1 100644
--- a/test/jdk/jdk/incubator/vector/IntVectorMaxTests.java
+++ b/test/jdk/jdk/incubator/vector/IntVectorMaxTests.java
@@ -1537,6 +1537,59 @@ public class IntVectorMaxTests extends AbstractVectorTest {
         return a >= b;
     }
 
+    static int firstNonZero(int a, int b) {
+        return Integer.compare(a, (int) 0) != 0 ? a : b;
+    }
+
+    static int scalar_or(int a, int b) {
+        return (int)(a | b);
+    }
+
+    static int scalar_and(int a, int b) {
+        return (int)(a & b);
+    }
+
+    static int scalar_xor(int a, int b) {
+        return (int)(a ^ b);
+    }
+
+    static int scalar_add(int a, int b) {
+        return (int)(a + b);
+    }
+
+    static int scalar_sub(int a, int b) {
+        return (int)(a - b);
+    }
+
+    static int scalar_mul(int a, int b) {
+        return (int)(a * b);
+    }
+
+    static int scalar_min(int a, int b) {
+        return (int)(Math.min(a, b));
+    }
+
+    static int scalar_max(int a, int b) {
+        return (int)(Math.max(a, b));
+    }
+
+    static int scalar_div(int a, int b) {
+        return (int)(a / b);
+    }
+
+    static int scalar_fma(int a, int b, int c) {
+        return (int)(Math.fma(a, b, c));
+    }
+
+    static int scalar_abs(int a) {
+        return (int)(Math.abs(a));
+    }
+
+    static int scalar_neg(int a) {
+        return ((int)-a);
+    }
+
+
     static boolean ult(int a, int b) {
         return Integer.compareUnsigned(a, b) < 0;
     }
@@ -1553,9 +1606,6 @@ public class IntVectorMaxTests extends AbstractVectorTest {
         return Integer.compareUnsigned(a, b) >= 0;
     }
 
-    static int firstNonZero(int a, int b) {
-        return Integer.compare(a, (int) 0) != 0 ? a : b;
-    }
 
     @Test
     static void smokeTest1() {
@@ -1669,7 +1719,7 @@ public class IntVectorMaxTests extends AbstractVectorTest {
     }
 
     static int ADD(int a, int b) {
-        return (int)(a + b);
+        return (int)(scalar_add(a, b));
     }
 
     @Test(dataProvider = "intBinaryOpProvider")
@@ -1690,7 +1740,7 @@ public class IntVectorMaxTests extends AbstractVectorTest {
     }
 
     static int add(int a, int b) {
-        return (int)(a + b);
+        return (int)(scalar_add(a, b));
     }
 
     @Test(dataProvider = "intBinaryOpProvider")
@@ -1747,7 +1797,7 @@ public class IntVectorMaxTests extends AbstractVectorTest {
     }
 
     static int SUB(int a, int b) {
-        return (int)(a - b);
+        return (int)(scalar_sub(a, b));
     }
 
     @Test(dataProvider = "intBinaryOpProvider")
@@ -1768,7 +1818,7 @@ public class IntVectorMaxTests extends AbstractVectorTest {
     }
 
     static int sub(int a, int b) {
-        return (int)(a - b);
+        return (int)(scalar_sub(a, b));
     }
 
     @Test(dataProvider = "intBinaryOpProvider")
@@ -1825,7 +1875,7 @@ public class IntVectorMaxTests extends AbstractVectorTest {
     }
 
     static int MUL(int a, int b) {
-        return (int)(a * b);
+        return (int)(scalar_mul(a, b));
     }
 
     @Test(dataProvider = "intBinaryOpProvider")
@@ -1846,7 +1896,7 @@ public class IntVectorMaxTests extends AbstractVectorTest {
     }
 
     static int mul(int a, int b) {
-        return (int)(a * b);
+        return (int)(scalar_mul(a, b));
     }
 
     @Test(dataProvider = "intBinaryOpProvider")
@@ -1993,7 +2043,7 @@ public class IntVectorMaxTests extends AbstractVectorTest {
     }
 
     static int FIRST_NONZERO(int a, int b) {
-        return (int)((a)!=0?a:b);
+        return (int)(firstNonZero(a, b));
     }
 
     @Test(dataProvider = "intBinaryOpProvider")
@@ -3289,7 +3339,7 @@ public class IntVectorMaxTests extends AbstractVectorTest {
     }
 
     static int MIN(int a, int b) {
-        return (int)(Math.min(a, b));
+        return (int)(scalar_min(a, b));
     }
 
     @Test(dataProvider = "intBinaryOpProvider")
@@ -3310,7 +3360,7 @@ public class IntVectorMaxTests extends AbstractVectorTest {
     }
 
     static int min(int a, int b) {
-        return (int)(Math.min(a, b));
+        return (int)(scalar_min(a, b));
     }
 
     @Test(dataProvider = "intBinaryOpProvider")
@@ -3329,7 +3379,7 @@ public class IntVectorMaxTests extends AbstractVectorTest {
     }
 
     static int MAX(int a, int b) {
-        return (int)(Math.max(a, b));
+        return (int)(scalar_max(a, b));
     }
 
     @Test(dataProvider = "intBinaryOpProvider")
@@ -3350,7 +3400,7 @@ public class IntVectorMaxTests extends AbstractVectorTest {
     }
 
     static int max(int a, int b) {
-        return (int)(Math.max(a, b));
+        return (int)(scalar_max(a, b));
     }
 
     @Test(dataProvider = "intBinaryOpProvider")
@@ -3718,7 +3768,7 @@ public class IntVectorMaxTests extends AbstractVectorTest {
     static int ANDReduce(int[] a, int idx) {
         int res = AND_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res &= a[i];
+            res = scalar_and(res, a[i]);
         }
 
         return res;
@@ -3727,7 +3777,7 @@ public class IntVectorMaxTests extends AbstractVectorTest {
     static int ANDReduceAll(int[] a) {
         int res = AND_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res &= ANDReduce(a, i);
+            res = scalar_and(res, ANDReduce(a, i));
         }
 
         return res;
@@ -3745,7 +3795,7 @@ public class IntVectorMaxTests extends AbstractVectorTest {
                 IntVector av = IntVector.fromArray(SPECIES, a, i);
                 int v = av.reduceLanes(VectorOperators.AND);
                 r[i] = v;
-                ra &= v;
+                ra = scalar_and(ra, v);
             }
         }
 
@@ -3758,20 +3808,20 @@ public class IntVectorMaxTests extends AbstractVectorTest {
         int[] a = fa.apply(SPECIES.length());
         int id = AND_IDENTITY;
 
-        assertEquals((int) (id & id), id,
+        assertEquals((int) (scalar_and(id, id)), id,
                             "AND(AND_IDENTITY, AND_IDENTITY) != AND_IDENTITY");
 
         int x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((int) (id & x), x);
-                assertEquals((int) (x & id), x);
+                assertEquals((int) (scalar_and(id, x)), x);
+                assertEquals((int) (scalar_and(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((int) (id & x), x,
+            assertEquals((int) (scalar_and(id, x)), x,
                                 "AND(AND_IDENTITY, " + x + ") != " + x);
-            assertEquals((int) (x & id), x,
+            assertEquals((int) (scalar_and(x, id)), x,
                                 "AND(" + x + ", AND_IDENTITY) != " + x);
         }
     }
@@ -3780,7 +3830,7 @@ public class IntVectorMaxTests extends AbstractVectorTest {
         int res = AND_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res &= a[i];
+                res = scalar_and(res, a[i]);
         }
 
         return res;
@@ -3789,7 +3839,7 @@ public class IntVectorMaxTests extends AbstractVectorTest {
     static int ANDReduceAllMasked(int[] a, boolean[] mask) {
         int res = AND_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res &= ANDReduceMasked(a, i, mask);
+            res = scalar_and(res, ANDReduceMasked(a, i, mask));
         }
 
         return res;
@@ -3809,7 +3859,7 @@ public class IntVectorMaxTests extends AbstractVectorTest {
                 IntVector av = IntVector.fromArray(SPECIES, a, i);
                 int v = av.reduceLanes(VectorOperators.AND, vmask);
                 r[i] = v;
-                ra &= v;
+                ra = scalar_and(ra, v);
             }
         }
 
@@ -3820,7 +3870,7 @@ public class IntVectorMaxTests extends AbstractVectorTest {
     static int ORReduce(int[] a, int idx) {
         int res = OR_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res |= a[i];
+            res = scalar_or(res, a[i]);
         }
 
         return res;
@@ -3829,7 +3879,7 @@ public class IntVectorMaxTests extends AbstractVectorTest {
     static int ORReduceAll(int[] a) {
         int res = OR_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res |= ORReduce(a, i);
+            res = scalar_or(res, ORReduce(a, i));
         }
 
         return res;
@@ -3847,7 +3897,7 @@ public class IntVectorMaxTests extends AbstractVectorTest {
                 IntVector av = IntVector.fromArray(SPECIES, a, i);
                 int v = av.reduceLanes(VectorOperators.OR);
                 r[i] = v;
-                ra |= v;
+                ra = scalar_or(ra, v);
             }
         }
 
@@ -3860,20 +3910,20 @@ public class IntVectorMaxTests extends AbstractVectorTest {
         int[] a = fa.apply(SPECIES.length());
         int id = OR_IDENTITY;
 
-        assertEquals((int) (id | id), id,
+        assertEquals((int) (scalar_or(id, id)), id,
                             "OR(OR_IDENTITY, OR_IDENTITY) != OR_IDENTITY");
 
         int x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((int) (id | x), x);
-                assertEquals((int) (x | id), x);
+                assertEquals((int) (scalar_or(id, x)), x);
+                assertEquals((int) (scalar_or(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((int) (id | x), x,
+            assertEquals((int) (scalar_or(id, x)), x,
                                 "OR(OR_IDENTITY, " + x + ") != " + x);
-            assertEquals((int) (x | id), x,
+            assertEquals((int) (scalar_or(x, id)), x,
                                 "OR(" + x + ", OR_IDENTITY) != " + x);
         }
     }
@@ -3882,7 +3932,7 @@ public class IntVectorMaxTests extends AbstractVectorTest {
         int res = OR_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res |= a[i];
+                res = scalar_or(res, a[i]);
         }
 
         return res;
@@ -3891,7 +3941,7 @@ public class IntVectorMaxTests extends AbstractVectorTest {
     static int ORReduceAllMasked(int[] a, boolean[] mask) {
         int res = OR_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res |= ORReduceMasked(a, i, mask);
+            res = scalar_or(res, ORReduceMasked(a, i, mask));
         }
 
         return res;
@@ -3911,7 +3961,7 @@ public class IntVectorMaxTests extends AbstractVectorTest {
                 IntVector av = IntVector.fromArray(SPECIES, a, i);
                 int v = av.reduceLanes(VectorOperators.OR, vmask);
                 r[i] = v;
-                ra |= v;
+                ra = scalar_or(ra, v);
             }
         }
 
@@ -3922,7 +3972,7 @@ public class IntVectorMaxTests extends AbstractVectorTest {
     static int XORReduce(int[] a, int idx) {
         int res = XOR_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res ^= a[i];
+            res = scalar_xor(res, a[i]);
         }
 
         return res;
@@ -3931,7 +3981,7 @@ public class IntVectorMaxTests extends AbstractVectorTest {
     static int XORReduceAll(int[] a) {
         int res = XOR_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res ^= XORReduce(a, i);
+            res = scalar_xor(res, XORReduce(a, i));
         }
 
         return res;
@@ -3949,7 +3999,7 @@ public class IntVectorMaxTests extends AbstractVectorTest {
                 IntVector av = IntVector.fromArray(SPECIES, a, i);
                 int v = av.reduceLanes(VectorOperators.XOR);
                 r[i] = v;
-                ra ^= v;
+                ra = scalar_xor(ra, v);
             }
         }
 
@@ -3962,20 +4012,20 @@ public class IntVectorMaxTests extends AbstractVectorTest {
         int[] a = fa.apply(SPECIES.length());
         int id = XOR_IDENTITY;
 
-        assertEquals((int) (id ^ id), id,
+        assertEquals((int) (scalar_xor(id, id)), id,
                             "XOR(XOR_IDENTITY, XOR_IDENTITY) != XOR_IDENTITY");
 
         int x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((int) (id ^ x), x);
-                assertEquals((int) (x ^ id), x);
+                assertEquals((int) (scalar_xor(id, x)), x);
+                assertEquals((int) (scalar_xor(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((int) (id ^ x), x,
+            assertEquals((int) (scalar_xor(id, x)), x,
                                 "XOR(XOR_IDENTITY, " + x + ") != " + x);
-            assertEquals((int) (x ^ id), x,
+            assertEquals((int) (scalar_xor(x, id)), x,
                                 "XOR(" + x + ", XOR_IDENTITY) != " + x);
         }
     }
@@ -3984,7 +4034,7 @@ public class IntVectorMaxTests extends AbstractVectorTest {
         int res = XOR_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res ^= a[i];
+                res = scalar_xor(res, a[i]);
         }
 
         return res;
@@ -3993,7 +4043,7 @@ public class IntVectorMaxTests extends AbstractVectorTest {
     static int XORReduceAllMasked(int[] a, boolean[] mask) {
         int res = XOR_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res ^= XORReduceMasked(a, i, mask);
+            res = scalar_xor(res, XORReduceMasked(a, i, mask));
         }
 
         return res;
@@ -4013,7 +4063,7 @@ public class IntVectorMaxTests extends AbstractVectorTest {
                 IntVector av = IntVector.fromArray(SPECIES, a, i);
                 int v = av.reduceLanes(VectorOperators.XOR, vmask);
                 r[i] = v;
-                ra ^= v;
+                ra = scalar_xor(ra, v);
             }
         }
 
@@ -4024,7 +4074,7 @@ public class IntVectorMaxTests extends AbstractVectorTest {
     static int ADDReduce(int[] a, int idx) {
         int res = ADD_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res += a[i];
+            res = scalar_add(res, a[i]);
         }
 
         return res;
@@ -4033,7 +4083,7 @@ public class IntVectorMaxTests extends AbstractVectorTest {
     static int ADDReduceAll(int[] a) {
         int res = ADD_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduce(a, i);
+            res = scalar_add(res, ADDReduce(a, i));
         }
 
         return res;
@@ -4051,7 +4101,7 @@ public class IntVectorMaxTests extends AbstractVectorTest {
                 IntVector av = IntVector.fromArray(SPECIES, a, i);
                 int v = av.reduceLanes(VectorOperators.ADD);
                 r[i] = v;
-                ra += v;
+                ra = scalar_add(ra, v);
             }
         }
 
@@ -4064,20 +4114,20 @@ public class IntVectorMaxTests extends AbstractVectorTest {
         int[] a = fa.apply(SPECIES.length());
         int id = ADD_IDENTITY;
 
-        assertEquals((int) (id + id), id,
+        assertEquals((int) (scalar_add(id, id)), id,
                             "ADD(ADD_IDENTITY, ADD_IDENTITY) != ADD_IDENTITY");
 
         int x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((int) (id + x), x);
-                assertEquals((int) (x + id), x);
+                assertEquals((int) (scalar_add(id, x)), x);
+                assertEquals((int) (scalar_add(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((int) (id + x), x,
+            assertEquals((int) (scalar_add(id, x)), x,
                                 "ADD(ADD_IDENTITY, " + x + ") != " + x);
-            assertEquals((int) (x + id), x,
+            assertEquals((int) (scalar_add(x, id)), x,
                                 "ADD(" + x + ", ADD_IDENTITY) != " + x);
         }
     }
@@ -4086,7 +4136,7 @@ public class IntVectorMaxTests extends AbstractVectorTest {
         int res = ADD_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res += a[i];
+                res = scalar_add(res, a[i]);
         }
 
         return res;
@@ -4095,7 +4145,7 @@ public class IntVectorMaxTests extends AbstractVectorTest {
     static int ADDReduceAllMasked(int[] a, boolean[] mask) {
         int res = ADD_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduceMasked(a, i, mask);
+            res = scalar_add(res, ADDReduceMasked(a, i, mask));
         }
 
         return res;
@@ -4115,7 +4165,7 @@ public class IntVectorMaxTests extends AbstractVectorTest {
                 IntVector av = IntVector.fromArray(SPECIES, a, i);
                 int v = av.reduceLanes(VectorOperators.ADD, vmask);
                 r[i] = v;
-                ra += v;
+                ra = scalar_add(ra, v);
             }
         }
 
@@ -4126,7 +4176,7 @@ public class IntVectorMaxTests extends AbstractVectorTest {
     static int MULReduce(int[] a, int idx) {
         int res = MUL_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res *= a[i];
+            res = scalar_mul(res, a[i]);
         }
 
         return res;
@@ -4135,7 +4185,7 @@ public class IntVectorMaxTests extends AbstractVectorTest {
     static int MULReduceAll(int[] a) {
         int res = MUL_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res *= MULReduce(a, i);
+            res = scalar_mul(res, MULReduce(a, i));
         }
 
         return res;
@@ -4153,7 +4203,7 @@ public class IntVectorMaxTests extends AbstractVectorTest {
                 IntVector av = IntVector.fromArray(SPECIES, a, i);
                 int v = av.reduceLanes(VectorOperators.MUL);
                 r[i] = v;
-                ra *= v;
+                ra = scalar_mul(ra, v);
             }
         }
 
@@ -4166,20 +4216,20 @@ public class IntVectorMaxTests extends AbstractVectorTest {
         int[] a = fa.apply(SPECIES.length());
         int id = MUL_IDENTITY;
 
-        assertEquals((int) (id * id), id,
+        assertEquals((int) (scalar_mul(id, id)), id,
                             "MUL(MUL_IDENTITY, MUL_IDENTITY) != MUL_IDENTITY");
 
         int x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((int) (id * x), x);
-                assertEquals((int) (x * id), x);
+                assertEquals((int) (scalar_mul(id, x)), x);
+                assertEquals((int) (scalar_mul(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((int) (id * x), x,
+            assertEquals((int) (scalar_mul(id, x)), x,
                                 "MUL(MUL_IDENTITY, " + x + ") != " + x);
-            assertEquals((int) (x * id), x,
+            assertEquals((int) (scalar_mul(x, id)), x,
                                 "MUL(" + x + ", MUL_IDENTITY) != " + x);
         }
     }
@@ -4188,7 +4238,7 @@ public class IntVectorMaxTests extends AbstractVectorTest {
         int res = MUL_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res *= a[i];
+                res = scalar_mul(res, a[i]);
         }
 
         return res;
@@ -4197,7 +4247,7 @@ public class IntVectorMaxTests extends AbstractVectorTest {
     static int MULReduceAllMasked(int[] a, boolean[] mask) {
         int res = MUL_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res *= MULReduceMasked(a, i, mask);
+            res = scalar_mul(res, MULReduceMasked(a, i, mask));
         }
 
         return res;
@@ -4217,7 +4267,7 @@ public class IntVectorMaxTests extends AbstractVectorTest {
                 IntVector av = IntVector.fromArray(SPECIES, a, i);
                 int v = av.reduceLanes(VectorOperators.MUL, vmask);
                 r[i] = v;
-                ra *= v;
+                ra = scalar_mul(ra, v);
             }
         }
 
@@ -4228,7 +4278,7 @@ public class IntVectorMaxTests extends AbstractVectorTest {
     static int MINReduce(int[] a, int idx) {
         int res = MIN_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res = (int) Math.min(res, a[i]);
+            res = scalar_min(res, a[i]);
         }
 
         return res;
@@ -4237,7 +4287,7 @@ public class IntVectorMaxTests extends AbstractVectorTest {
     static int MINReduceAll(int[] a) {
         int res = MIN_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (int) Math.min(res, MINReduce(a, i));
+            res = scalar_min(res, MINReduce(a, i));
         }
 
         return res;
@@ -4255,7 +4305,7 @@ public class IntVectorMaxTests extends AbstractVectorTest {
                 IntVector av = IntVector.fromArray(SPECIES, a, i);
                 int v = av.reduceLanes(VectorOperators.MIN);
                 r[i] = v;
-                ra = (int) Math.min(ra, v);
+                ra = scalar_min(ra, v);
             }
         }
 
@@ -4268,20 +4318,20 @@ public class IntVectorMaxTests extends AbstractVectorTest {
         int[] a = fa.apply(SPECIES.length());
         int id = MIN_IDENTITY;
 
-        assertEquals((int) Math.min(id, id), id,
+        assertEquals(scalar_min(id, id), id,
                             "MIN(MIN_IDENTITY, MIN_IDENTITY) != MIN_IDENTITY");
 
         int x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((int) Math.min(id, x), x);
-                assertEquals((int) Math.min(x, id), x);
+                assertEquals(scalar_min(id, x), x);
+                assertEquals(scalar_min(x, id), x);
             }
         } catch (AssertionError e) {
-            assertEquals((int) Math.min(id, x), x,
+            assertEquals(scalar_min(id, x), x,
                                 "MIN(MIN_IDENTITY, " + x + ") != " + x);
-            assertEquals((int) Math.min(x, id), x,
+            assertEquals(scalar_min(x, id), x,
                                 "MIN(" + x + ", MIN_IDENTITY) != " + x);
         }
     }
@@ -4290,7 +4340,7 @@ public class IntVectorMaxTests extends AbstractVectorTest {
         int res = MIN_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res = (int) Math.min(res, a[i]);
+                res = scalar_min(res, a[i]);
         }
 
         return res;
@@ -4299,7 +4349,7 @@ public class IntVectorMaxTests extends AbstractVectorTest {
     static int MINReduceAllMasked(int[] a, boolean[] mask) {
         int res = MIN_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (int) Math.min(res, MINReduceMasked(a, i, mask));
+            res = scalar_min(res, MINReduceMasked(a, i, mask));
         }
 
         return res;
@@ -4319,7 +4369,7 @@ public class IntVectorMaxTests extends AbstractVectorTest {
                 IntVector av = IntVector.fromArray(SPECIES, a, i);
                 int v = av.reduceLanes(VectorOperators.MIN, vmask);
                 r[i] = v;
-                ra = (int) Math.min(ra, v);
+                ra = scalar_min(ra, v);
             }
         }
 
@@ -4330,7 +4380,7 @@ public class IntVectorMaxTests extends AbstractVectorTest {
     static int MAXReduce(int[] a, int idx) {
         int res = MAX_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res = (int) Math.max(res, a[i]);
+            res = scalar_max(res, a[i]);
         }
 
         return res;
@@ -4339,7 +4389,7 @@ public class IntVectorMaxTests extends AbstractVectorTest {
     static int MAXReduceAll(int[] a) {
         int res = MAX_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (int) Math.max(res, MAXReduce(a, i));
+            res = scalar_max(res, MAXReduce(a, i));
         }
 
         return res;
@@ -4357,7 +4407,7 @@ public class IntVectorMaxTests extends AbstractVectorTest {
                 IntVector av = IntVector.fromArray(SPECIES, a, i);
                 int v = av.reduceLanes(VectorOperators.MAX);
                 r[i] = v;
-                ra = (int) Math.max(ra, v);
+                ra = scalar_max(ra, v);
             }
         }
 
@@ -4370,20 +4420,20 @@ public class IntVectorMaxTests extends AbstractVectorTest {
         int[] a = fa.apply(SPECIES.length());
         int id = MAX_IDENTITY;
 
-        assertEquals((int) Math.max(id, id), id,
+        assertEquals(scalar_max(id, id), id,
                             "MAX(MAX_IDENTITY, MAX_IDENTITY) != MAX_IDENTITY");
 
         int x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((int) Math.max(id, x), x);
-                assertEquals((int) Math.max(x, id), x);
+                assertEquals(scalar_max(id, x), x);
+                assertEquals(scalar_max(x, id), x);
             }
         } catch (AssertionError e) {
-            assertEquals((int) Math.max(id, x), x,
+            assertEquals(scalar_max(id, x), x,
                                 "MAX(MAX_IDENTITY, " + x + ") != " + x);
-            assertEquals((int) Math.max(x, id), x,
+            assertEquals(scalar_max(x, id), x,
                                 "MAX(" + x + ", MAX_IDENTITY) != " + x);
         }
     }
@@ -4392,7 +4442,7 @@ public class IntVectorMaxTests extends AbstractVectorTest {
         int res = MAX_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res = (int) Math.max(res, a[i]);
+                res = scalar_max(res, a[i]);
         }
 
         return res;
@@ -4401,7 +4451,7 @@ public class IntVectorMaxTests extends AbstractVectorTest {
     static int MAXReduceAllMasked(int[] a, boolean[] mask) {
         int res = MAX_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (int) Math.max(res, MAXReduceMasked(a, i, mask));
+            res = scalar_max(res, MAXReduceMasked(a, i, mask));
         }
 
         return res;
@@ -4421,7 +4471,7 @@ public class IntVectorMaxTests extends AbstractVectorTest {
                 IntVector av = IntVector.fromArray(SPECIES, a, i);
                 int v = av.reduceLanes(VectorOperators.MAX, vmask);
                 r[i] = v;
-                ra = (int) Math.max(ra, v);
+                ra = scalar_max(ra, v);
             }
         }
 
@@ -5454,7 +5504,7 @@ public class IntVectorMaxTests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] < b[i]);
+                assertEquals(mv.laneIsSet(j), lt(a[i + j], b[i]));
             }
         }
     }
@@ -5474,7 +5524,7 @@ public class IntVectorMaxTests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] < b[i]));
+                assertEquals(mv.laneIsSet(j), mask[j] && (lt(a[i + j], b[i])));
             }
         }
     }
@@ -5490,7 +5540,7 @@ public class IntVectorMaxTests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] < (int)((long)b[i]));
+                assertEquals(mv.laneIsSet(j), lt(a[i + j], (int)((long)b[i])));
             }
         }
     }
@@ -5510,7 +5560,7 @@ public class IntVectorMaxTests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] < (int)((long)b[i])));
+                assertEquals(mv.laneIsSet(j), mask[j] && (lt(a[i + j], (int)((long)b[i]))));
             }
         }
     }
@@ -5526,7 +5576,7 @@ public class IntVectorMaxTests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] == b[i]);
+                assertEquals(mv.laneIsSet(j), eq(a[i + j], b[i]));
             }
         }
     }
@@ -5546,7 +5596,7 @@ public class IntVectorMaxTests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] == b[i]));
+                assertEquals(mv.laneIsSet(j), mask[j] && (eq(a[i + j], b[i])));
             }
         }
     }
@@ -5562,7 +5612,7 @@ public class IntVectorMaxTests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] == (int)((long)b[i]));
+                assertEquals(mv.laneIsSet(j), eq(a[i + j], (int)((long)b[i])));
             }
         }
     }
@@ -5582,7 +5632,7 @@ public class IntVectorMaxTests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] == (int)((long)b[i])));
+                assertEquals(mv.laneIsSet(j), mask[j] && (eq(a[i + j], (int)((long)b[i]))));
             }
         }
     }
@@ -6294,11 +6344,11 @@ public class IntVectorMaxTests extends AbstractVectorTest {
     }
 
     static int NEG(int a) {
-        return (int)(-((int)a));
+        return (int)(scalar_neg((int)a));
     }
 
     static int neg(int a) {
-        return (int)(-((int)a));
+        return (int)(scalar_neg((int)a));
     }
 
     @Test(dataProvider = "intUnaryOpProvider")
@@ -6350,11 +6400,11 @@ public class IntVectorMaxTests extends AbstractVectorTest {
     }
 
     static int ABS(int a) {
-        return (int)(Math.abs((int)a));
+        return (int)(scalar_abs((int)a));
     }
 
     static int abs(int a) {
-        return (int)(Math.abs((int)a));
+        return (int)(scalar_abs((int)a));
     }
 
     @Test(dataProvider = "intUnaryOpProvider")
@@ -6845,7 +6895,7 @@ public class IntVectorMaxTests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] < b[i]);
+                assertEquals(mv.laneIsSet(j), lt(a[i + j], b[i]));
             }
         }
     }
@@ -6861,7 +6911,7 @@ public class IntVectorMaxTests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] == b[i]);
+                assertEquals(mv.laneIsSet(j), eq(a[i + j], b[i]));
             }
         }
     }
@@ -6930,7 +6980,7 @@ public class IntVectorMaxTests extends AbstractVectorTest {
     static long ADDReduceLong(int[] a, int idx) {
         int res = 0;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res += a[i];
+            res = scalar_add(res, a[i]);
         }
 
         return (long)res;
@@ -6939,7 +6989,7 @@ public class IntVectorMaxTests extends AbstractVectorTest {
     static long ADDReduceAllLong(int[] a) {
         long res = 0;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduceLong(a, i);
+            res = (long)scalar_add((int)res, (int)ADDReduceLong(a, i));
         }
 
         return res;
@@ -6957,8 +7007,8 @@ public class IntVectorMaxTests extends AbstractVectorTest {
         }
 
         ra = 0;
-        for (int i = 0; i < a.length; i ++) {
-            ra += r[i];
+        for (int i = 0; i < a.length; i++) {
+            ra = (long)scalar_add((int)ra, (int)r[i]);
         }
 
         assertReductionLongArraysEquals(r, ra, a,
@@ -6968,8 +7018,9 @@ public class IntVectorMaxTests extends AbstractVectorTest {
     static long ADDReduceLongMasked(int[] a, int idx, boolean[] mask) {
         int res = 0;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            if(mask[i % SPECIES.length()])
-                res += a[i];
+            if (mask[i % SPECIES.length()]) {
+                res = scalar_add(res, a[i]);
+            }
         }
 
         return (long)res;
@@ -6978,7 +7029,7 @@ public class IntVectorMaxTests extends AbstractVectorTest {
     static long ADDReduceAllLongMasked(int[] a, boolean[] mask) {
         long res = 0;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduceLongMasked(a, i, mask);
+            res = (long)scalar_add((int)res, (int)ADDReduceLongMasked(a, i, mask));
         }
 
         return res;
@@ -6998,8 +7049,8 @@ public class IntVectorMaxTests extends AbstractVectorTest {
         }
 
         ra = 0;
-        for (int i = 0; i < a.length; i ++) {
-            ra += r[i];
+        for (int i = 0; i < a.length; i++) {
+            ra = (long)scalar_add((int)ra, (int)r[i]);
         }
 
         assertReductionLongArraysEqualsMasked(r, ra, a, mask,
diff --git a/test/jdk/jdk/incubator/vector/LongVector128Tests.java b/test/jdk/jdk/incubator/vector/LongVector128Tests.java
index 1d3af1684b9..49e2e1a0078 100644
--- a/test/jdk/jdk/incubator/vector/LongVector128Tests.java
+++ b/test/jdk/jdk/incubator/vector/LongVector128Tests.java
@@ -1547,6 +1547,59 @@ public class LongVector128Tests extends AbstractVectorTest {
         return a >= b;
     }
 
+    static long firstNonZero(long a, long b) {
+        return Long.compare(a, (long) 0) != 0 ? a : b;
+    }
+
+    static long scalar_or(long a, long b) {
+        return (long)(a | b);
+    }
+
+    static long scalar_and(long a, long b) {
+        return (long)(a & b);
+    }
+
+    static long scalar_xor(long a, long b) {
+        return (long)(a ^ b);
+    }
+
+    static long scalar_add(long a, long b) {
+        return (long)(a + b);
+    }
+
+    static long scalar_sub(long a, long b) {
+        return (long)(a - b);
+    }
+
+    static long scalar_mul(long a, long b) {
+        return (long)(a * b);
+    }
+
+    static long scalar_min(long a, long b) {
+        return (long)(Math.min(a, b));
+    }
+
+    static long scalar_max(long a, long b) {
+        return (long)(Math.max(a, b));
+    }
+
+    static long scalar_div(long a, long b) {
+        return (long)(a / b);
+    }
+
+    static long scalar_fma(long a, long b, long c) {
+        return (long)(Math.fma(a, b, c));
+    }
+
+    static long scalar_abs(long a) {
+        return (long)(Math.abs(a));
+    }
+
+    static long scalar_neg(long a) {
+        return ((long)-a);
+    }
+
+
     static boolean ult(long a, long b) {
         return Long.compareUnsigned(a, b) < 0;
     }
@@ -1563,9 +1616,6 @@ public class LongVector128Tests extends AbstractVectorTest {
         return Long.compareUnsigned(a, b) >= 0;
     }
 
-    static long firstNonZero(long a, long b) {
-        return Long.compare(a, (long) 0) != 0 ? a : b;
-    }
 
     @Test
     static void smokeTest1() {
@@ -1679,7 +1729,7 @@ public class LongVector128Tests extends AbstractVectorTest {
     }
 
     static long ADD(long a, long b) {
-        return (long)(a + b);
+        return (long)(scalar_add(a, b));
     }
 
     @Test(dataProvider = "longBinaryOpProvider")
@@ -1700,7 +1750,7 @@ public class LongVector128Tests extends AbstractVectorTest {
     }
 
     static long add(long a, long b) {
-        return (long)(a + b);
+        return (long)(scalar_add(a, b));
     }
 
     @Test(dataProvider = "longBinaryOpProvider")
@@ -1757,7 +1807,7 @@ public class LongVector128Tests extends AbstractVectorTest {
     }
 
     static long SUB(long a, long b) {
-        return (long)(a - b);
+        return (long)(scalar_sub(a, b));
     }
 
     @Test(dataProvider = "longBinaryOpProvider")
@@ -1778,7 +1828,7 @@ public class LongVector128Tests extends AbstractVectorTest {
     }
 
     static long sub(long a, long b) {
-        return (long)(a - b);
+        return (long)(scalar_sub(a, b));
     }
 
     @Test(dataProvider = "longBinaryOpProvider")
@@ -1835,7 +1885,7 @@ public class LongVector128Tests extends AbstractVectorTest {
     }
 
     static long MUL(long a, long b) {
-        return (long)(a * b);
+        return (long)(scalar_mul(a, b));
     }
 
     @Test(dataProvider = "longBinaryOpProvider")
@@ -1856,7 +1906,7 @@ public class LongVector128Tests extends AbstractVectorTest {
     }
 
     static long mul(long a, long b) {
-        return (long)(a * b);
+        return (long)(scalar_mul(a, b));
     }
 
     @Test(dataProvider = "longBinaryOpProvider")
@@ -2003,7 +2053,7 @@ public class LongVector128Tests extends AbstractVectorTest {
     }
 
     static long FIRST_NONZERO(long a, long b) {
-        return (long)((a)!=0?a:b);
+        return (long)(firstNonZero(a, b));
     }
 
     @Test(dataProvider = "longBinaryOpProvider")
@@ -3299,7 +3349,7 @@ public class LongVector128Tests extends AbstractVectorTest {
     }
 
     static long MIN(long a, long b) {
-        return (long)(Math.min(a, b));
+        return (long)(scalar_min(a, b));
     }
 
     @Test(dataProvider = "longBinaryOpProvider")
@@ -3320,7 +3370,7 @@ public class LongVector128Tests extends AbstractVectorTest {
     }
 
     static long min(long a, long b) {
-        return (long)(Math.min(a, b));
+        return (long)(scalar_min(a, b));
     }
 
     @Test(dataProvider = "longBinaryOpProvider")
@@ -3339,7 +3389,7 @@ public class LongVector128Tests extends AbstractVectorTest {
     }
 
     static long MAX(long a, long b) {
-        return (long)(Math.max(a, b));
+        return (long)(scalar_max(a, b));
     }
 
     @Test(dataProvider = "longBinaryOpProvider")
@@ -3360,7 +3410,7 @@ public class LongVector128Tests extends AbstractVectorTest {
     }
 
     static long max(long a, long b) {
-        return (long)(Math.max(a, b));
+        return (long)(scalar_max(a, b));
     }
 
     @Test(dataProvider = "longBinaryOpProvider")
@@ -3728,7 +3778,7 @@ public class LongVector128Tests extends AbstractVectorTest {
     static long ANDReduce(long[] a, int idx) {
         long res = AND_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res &= a[i];
+            res = scalar_and(res, a[i]);
         }
 
         return res;
@@ -3737,7 +3787,7 @@ public class LongVector128Tests extends AbstractVectorTest {
     static long ANDReduceAll(long[] a) {
         long res = AND_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res &= ANDReduce(a, i);
+            res = scalar_and(res, ANDReduce(a, i));
         }
 
         return res;
@@ -3755,7 +3805,7 @@ public class LongVector128Tests extends AbstractVectorTest {
                 LongVector av = LongVector.fromArray(SPECIES, a, i);
                 long v = av.reduceLanes(VectorOperators.AND);
                 r[i] = v;
-                ra &= v;
+                ra = scalar_and(ra, v);
             }
         }
 
@@ -3768,20 +3818,20 @@ public class LongVector128Tests extends AbstractVectorTest {
         long[] a = fa.apply(SPECIES.length());
         long id = AND_IDENTITY;
 
-        assertEquals((long) (id & id), id,
+        assertEquals((long) (scalar_and(id, id)), id,
                             "AND(AND_IDENTITY, AND_IDENTITY) != AND_IDENTITY");
 
         long x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((long) (id & x), x);
-                assertEquals((long) (x & id), x);
+                assertEquals((long) (scalar_and(id, x)), x);
+                assertEquals((long) (scalar_and(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((long) (id & x), x,
+            assertEquals((long) (scalar_and(id, x)), x,
                                 "AND(AND_IDENTITY, " + x + ") != " + x);
-            assertEquals((long) (x & id), x,
+            assertEquals((long) (scalar_and(x, id)), x,
                                 "AND(" + x + ", AND_IDENTITY) != " + x);
         }
     }
@@ -3790,7 +3840,7 @@ public class LongVector128Tests extends AbstractVectorTest {
         long res = AND_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res &= a[i];
+                res = scalar_and(res, a[i]);
         }
 
         return res;
@@ -3799,7 +3849,7 @@ public class LongVector128Tests extends AbstractVectorTest {
     static long ANDReduceAllMasked(long[] a, boolean[] mask) {
         long res = AND_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res &= ANDReduceMasked(a, i, mask);
+            res = scalar_and(res, ANDReduceMasked(a, i, mask));
         }
 
         return res;
@@ -3819,7 +3869,7 @@ public class LongVector128Tests extends AbstractVectorTest {
                 LongVector av = LongVector.fromArray(SPECIES, a, i);
                 long v = av.reduceLanes(VectorOperators.AND, vmask);
                 r[i] = v;
-                ra &= v;
+                ra = scalar_and(ra, v);
             }
         }
 
@@ -3830,7 +3880,7 @@ public class LongVector128Tests extends AbstractVectorTest {
     static long ORReduce(long[] a, int idx) {
         long res = OR_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res |= a[i];
+            res = scalar_or(res, a[i]);
         }
 
         return res;
@@ -3839,7 +3889,7 @@ public class LongVector128Tests extends AbstractVectorTest {
     static long ORReduceAll(long[] a) {
         long res = OR_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res |= ORReduce(a, i);
+            res = scalar_or(res, ORReduce(a, i));
         }
 
         return res;
@@ -3857,7 +3907,7 @@ public class LongVector128Tests extends AbstractVectorTest {
                 LongVector av = LongVector.fromArray(SPECIES, a, i);
                 long v = av.reduceLanes(VectorOperators.OR);
                 r[i] = v;
-                ra |= v;
+                ra = scalar_or(ra, v);
             }
         }
 
@@ -3870,20 +3920,20 @@ public class LongVector128Tests extends AbstractVectorTest {
         long[] a = fa.apply(SPECIES.length());
         long id = OR_IDENTITY;
 
-        assertEquals((long) (id | id), id,
+        assertEquals((long) (scalar_or(id, id)), id,
                             "OR(OR_IDENTITY, OR_IDENTITY) != OR_IDENTITY");
 
         long x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((long) (id | x), x);
-                assertEquals((long) (x | id), x);
+                assertEquals((long) (scalar_or(id, x)), x);
+                assertEquals((long) (scalar_or(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((long) (id | x), x,
+            assertEquals((long) (scalar_or(id, x)), x,
                                 "OR(OR_IDENTITY, " + x + ") != " + x);
-            assertEquals((long) (x | id), x,
+            assertEquals((long) (scalar_or(x, id)), x,
                                 "OR(" + x + ", OR_IDENTITY) != " + x);
         }
     }
@@ -3892,7 +3942,7 @@ public class LongVector128Tests extends AbstractVectorTest {
         long res = OR_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res |= a[i];
+                res = scalar_or(res, a[i]);
         }
 
         return res;
@@ -3901,7 +3951,7 @@ public class LongVector128Tests extends AbstractVectorTest {
     static long ORReduceAllMasked(long[] a, boolean[] mask) {
         long res = OR_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res |= ORReduceMasked(a, i, mask);
+            res = scalar_or(res, ORReduceMasked(a, i, mask));
         }
 
         return res;
@@ -3921,7 +3971,7 @@ public class LongVector128Tests extends AbstractVectorTest {
                 LongVector av = LongVector.fromArray(SPECIES, a, i);
                 long v = av.reduceLanes(VectorOperators.OR, vmask);
                 r[i] = v;
-                ra |= v;
+                ra = scalar_or(ra, v);
             }
         }
 
@@ -3932,7 +3982,7 @@ public class LongVector128Tests extends AbstractVectorTest {
     static long XORReduce(long[] a, int idx) {
         long res = XOR_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res ^= a[i];
+            res = scalar_xor(res, a[i]);
         }
 
         return res;
@@ -3941,7 +3991,7 @@ public class LongVector128Tests extends AbstractVectorTest {
     static long XORReduceAll(long[] a) {
         long res = XOR_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res ^= XORReduce(a, i);
+            res = scalar_xor(res, XORReduce(a, i));
         }
 
         return res;
@@ -3959,7 +4009,7 @@ public class LongVector128Tests extends AbstractVectorTest {
                 LongVector av = LongVector.fromArray(SPECIES, a, i);
                 long v = av.reduceLanes(VectorOperators.XOR);
                 r[i] = v;
-                ra ^= v;
+                ra = scalar_xor(ra, v);
             }
         }
 
@@ -3972,20 +4022,20 @@ public class LongVector128Tests extends AbstractVectorTest {
         long[] a = fa.apply(SPECIES.length());
         long id = XOR_IDENTITY;
 
-        assertEquals((long) (id ^ id), id,
+        assertEquals((long) (scalar_xor(id, id)), id,
                             "XOR(XOR_IDENTITY, XOR_IDENTITY) != XOR_IDENTITY");
 
         long x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((long) (id ^ x), x);
-                assertEquals((long) (x ^ id), x);
+                assertEquals((long) (scalar_xor(id, x)), x);
+                assertEquals((long) (scalar_xor(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((long) (id ^ x), x,
+            assertEquals((long) (scalar_xor(id, x)), x,
                                 "XOR(XOR_IDENTITY, " + x + ") != " + x);
-            assertEquals((long) (x ^ id), x,
+            assertEquals((long) (scalar_xor(x, id)), x,
                                 "XOR(" + x + ", XOR_IDENTITY) != " + x);
         }
     }
@@ -3994,7 +4044,7 @@ public class LongVector128Tests extends AbstractVectorTest {
         long res = XOR_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res ^= a[i];
+                res = scalar_xor(res, a[i]);
         }
 
         return res;
@@ -4003,7 +4053,7 @@ public class LongVector128Tests extends AbstractVectorTest {
     static long XORReduceAllMasked(long[] a, boolean[] mask) {
         long res = XOR_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res ^= XORReduceMasked(a, i, mask);
+            res = scalar_xor(res, XORReduceMasked(a, i, mask));
         }
 
         return res;
@@ -4023,7 +4073,7 @@ public class LongVector128Tests extends AbstractVectorTest {
                 LongVector av = LongVector.fromArray(SPECIES, a, i);
                 long v = av.reduceLanes(VectorOperators.XOR, vmask);
                 r[i] = v;
-                ra ^= v;
+                ra = scalar_xor(ra, v);
             }
         }
 
@@ -4034,7 +4084,7 @@ public class LongVector128Tests extends AbstractVectorTest {
     static long ADDReduce(long[] a, int idx) {
         long res = ADD_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res += a[i];
+            res = scalar_add(res, a[i]);
         }
 
         return res;
@@ -4043,7 +4093,7 @@ public class LongVector128Tests extends AbstractVectorTest {
     static long ADDReduceAll(long[] a) {
         long res = ADD_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduce(a, i);
+            res = scalar_add(res, ADDReduce(a, i));
         }
 
         return res;
@@ -4061,7 +4111,7 @@ public class LongVector128Tests extends AbstractVectorTest {
                 LongVector av = LongVector.fromArray(SPECIES, a, i);
                 long v = av.reduceLanes(VectorOperators.ADD);
                 r[i] = v;
-                ra += v;
+                ra = scalar_add(ra, v);
             }
         }
 
@@ -4074,20 +4124,20 @@ public class LongVector128Tests extends AbstractVectorTest {
         long[] a = fa.apply(SPECIES.length());
         long id = ADD_IDENTITY;
 
-        assertEquals((long) (id + id), id,
+        assertEquals((long) (scalar_add(id, id)), id,
                             "ADD(ADD_IDENTITY, ADD_IDENTITY) != ADD_IDENTITY");
 
         long x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((long) (id + x), x);
-                assertEquals((long) (x + id), x);
+                assertEquals((long) (scalar_add(id, x)), x);
+                assertEquals((long) (scalar_add(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((long) (id + x), x,
+            assertEquals((long) (scalar_add(id, x)), x,
                                 "ADD(ADD_IDENTITY, " + x + ") != " + x);
-            assertEquals((long) (x + id), x,
+            assertEquals((long) (scalar_add(x, id)), x,
                                 "ADD(" + x + ", ADD_IDENTITY) != " + x);
         }
     }
@@ -4096,7 +4146,7 @@ public class LongVector128Tests extends AbstractVectorTest {
         long res = ADD_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res += a[i];
+                res = scalar_add(res, a[i]);
         }
 
         return res;
@@ -4105,7 +4155,7 @@ public class LongVector128Tests extends AbstractVectorTest {
     static long ADDReduceAllMasked(long[] a, boolean[] mask) {
         long res = ADD_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduceMasked(a, i, mask);
+            res = scalar_add(res, ADDReduceMasked(a, i, mask));
         }
 
         return res;
@@ -4125,7 +4175,7 @@ public class LongVector128Tests extends AbstractVectorTest {
                 LongVector av = LongVector.fromArray(SPECIES, a, i);
                 long v = av.reduceLanes(VectorOperators.ADD, vmask);
                 r[i] = v;
-                ra += v;
+                ra = scalar_add(ra, v);
             }
         }
 
@@ -4136,7 +4186,7 @@ public class LongVector128Tests extends AbstractVectorTest {
     static long MULReduce(long[] a, int idx) {
         long res = MUL_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res *= a[i];
+            res = scalar_mul(res, a[i]);
         }
 
         return res;
@@ -4145,7 +4195,7 @@ public class LongVector128Tests extends AbstractVectorTest {
     static long MULReduceAll(long[] a) {
         long res = MUL_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res *= MULReduce(a, i);
+            res = scalar_mul(res, MULReduce(a, i));
         }
 
         return res;
@@ -4163,7 +4213,7 @@ public class LongVector128Tests extends AbstractVectorTest {
                 LongVector av = LongVector.fromArray(SPECIES, a, i);
                 long v = av.reduceLanes(VectorOperators.MUL);
                 r[i] = v;
-                ra *= v;
+                ra = scalar_mul(ra, v);
             }
         }
 
@@ -4176,20 +4226,20 @@ public class LongVector128Tests extends AbstractVectorTest {
         long[] a = fa.apply(SPECIES.length());
         long id = MUL_IDENTITY;
 
-        assertEquals((long) (id * id), id,
+        assertEquals((long) (scalar_mul(id, id)), id,
                             "MUL(MUL_IDENTITY, MUL_IDENTITY) != MUL_IDENTITY");
 
         long x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((long) (id * x), x);
-                assertEquals((long) (x * id), x);
+                assertEquals((long) (scalar_mul(id, x)), x);
+                assertEquals((long) (scalar_mul(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((long) (id * x), x,
+            assertEquals((long) (scalar_mul(id, x)), x,
                                 "MUL(MUL_IDENTITY, " + x + ") != " + x);
-            assertEquals((long) (x * id), x,
+            assertEquals((long) (scalar_mul(x, id)), x,
                                 "MUL(" + x + ", MUL_IDENTITY) != " + x);
         }
     }
@@ -4198,7 +4248,7 @@ public class LongVector128Tests extends AbstractVectorTest {
         long res = MUL_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res *= a[i];
+                res = scalar_mul(res, a[i]);
         }
 
         return res;
@@ -4207,7 +4257,7 @@ public class LongVector128Tests extends AbstractVectorTest {
     static long MULReduceAllMasked(long[] a, boolean[] mask) {
         long res = MUL_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res *= MULReduceMasked(a, i, mask);
+            res = scalar_mul(res, MULReduceMasked(a, i, mask));
         }
 
         return res;
@@ -4227,7 +4277,7 @@ public class LongVector128Tests extends AbstractVectorTest {
                 LongVector av = LongVector.fromArray(SPECIES, a, i);
                 long v = av.reduceLanes(VectorOperators.MUL, vmask);
                 r[i] = v;
-                ra *= v;
+                ra = scalar_mul(ra, v);
             }
         }
 
@@ -4238,7 +4288,7 @@ public class LongVector128Tests extends AbstractVectorTest {
     static long MINReduce(long[] a, int idx) {
         long res = MIN_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res = (long) Math.min(res, a[i]);
+            res = scalar_min(res, a[i]);
         }
 
         return res;
@@ -4247,7 +4297,7 @@ public class LongVector128Tests extends AbstractVectorTest {
     static long MINReduceAll(long[] a) {
         long res = MIN_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (long) Math.min(res, MINReduce(a, i));
+            res = scalar_min(res, MINReduce(a, i));
         }
 
         return res;
@@ -4265,7 +4315,7 @@ public class LongVector128Tests extends AbstractVectorTest {
                 LongVector av = LongVector.fromArray(SPECIES, a, i);
                 long v = av.reduceLanes(VectorOperators.MIN);
                 r[i] = v;
-                ra = (long) Math.min(ra, v);
+                ra = scalar_min(ra, v);
             }
         }
 
@@ -4278,20 +4328,20 @@ public class LongVector128Tests extends AbstractVectorTest {
         long[] a = fa.apply(SPECIES.length());
         long id = MIN_IDENTITY;
 
-        assertEquals((long) Math.min(id, id), id,
+        assertEquals(scalar_min(id, id), id,
                             "MIN(MIN_IDENTITY, MIN_IDENTITY) != MIN_IDENTITY");
 
         long x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((long) Math.min(id, x), x);
-                assertEquals((long) Math.min(x, id), x);
+                assertEquals(scalar_min(id, x), x);
+                assertEquals(scalar_min(x, id), x);
             }
         } catch (AssertionError e) {
-            assertEquals((long) Math.min(id, x), x,
+            assertEquals(scalar_min(id, x), x,
                                 "MIN(MIN_IDENTITY, " + x + ") != " + x);
-            assertEquals((long) Math.min(x, id), x,
+            assertEquals(scalar_min(x, id), x,
                                 "MIN(" + x + ", MIN_IDENTITY) != " + x);
         }
     }
@@ -4300,7 +4350,7 @@ public class LongVector128Tests extends AbstractVectorTest {
         long res = MIN_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res = (long) Math.min(res, a[i]);
+                res = scalar_min(res, a[i]);
         }
 
         return res;
@@ -4309,7 +4359,7 @@ public class LongVector128Tests extends AbstractVectorTest {
     static long MINReduceAllMasked(long[] a, boolean[] mask) {
         long res = MIN_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (long) Math.min(res, MINReduceMasked(a, i, mask));
+            res = scalar_min(res, MINReduceMasked(a, i, mask));
         }
 
         return res;
@@ -4329,7 +4379,7 @@ public class LongVector128Tests extends AbstractVectorTest {
                 LongVector av = LongVector.fromArray(SPECIES, a, i);
                 long v = av.reduceLanes(VectorOperators.MIN, vmask);
                 r[i] = v;
-                ra = (long) Math.min(ra, v);
+                ra = scalar_min(ra, v);
             }
         }
 
@@ -4340,7 +4390,7 @@ public class LongVector128Tests extends AbstractVectorTest {
     static long MAXReduce(long[] a, int idx) {
         long res = MAX_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res = (long) Math.max(res, a[i]);
+            res = scalar_max(res, a[i]);
         }
 
         return res;
@@ -4349,7 +4399,7 @@ public class LongVector128Tests extends AbstractVectorTest {
     static long MAXReduceAll(long[] a) {
         long res = MAX_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (long) Math.max(res, MAXReduce(a, i));
+            res = scalar_max(res, MAXReduce(a, i));
         }
 
         return res;
@@ -4367,7 +4417,7 @@ public class LongVector128Tests extends AbstractVectorTest {
                 LongVector av = LongVector.fromArray(SPECIES, a, i);
                 long v = av.reduceLanes(VectorOperators.MAX);
                 r[i] = v;
-                ra = (long) Math.max(ra, v);
+                ra = scalar_max(ra, v);
             }
         }
 
@@ -4380,20 +4430,20 @@ public class LongVector128Tests extends AbstractVectorTest {
         long[] a = fa.apply(SPECIES.length());
         long id = MAX_IDENTITY;
 
-        assertEquals((long) Math.max(id, id), id,
+        assertEquals(scalar_max(id, id), id,
                             "MAX(MAX_IDENTITY, MAX_IDENTITY) != MAX_IDENTITY");
 
         long x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((long) Math.max(id, x), x);
-                assertEquals((long) Math.max(x, id), x);
+                assertEquals(scalar_max(id, x), x);
+                assertEquals(scalar_max(x, id), x);
             }
         } catch (AssertionError e) {
-            assertEquals((long) Math.max(id, x), x,
+            assertEquals(scalar_max(id, x), x,
                                 "MAX(MAX_IDENTITY, " + x + ") != " + x);
-            assertEquals((long) Math.max(x, id), x,
+            assertEquals(scalar_max(x, id), x,
                                 "MAX(" + x + ", MAX_IDENTITY) != " + x);
         }
     }
@@ -4402,7 +4452,7 @@ public class LongVector128Tests extends AbstractVectorTest {
         long res = MAX_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res = (long) Math.max(res, a[i]);
+                res = scalar_max(res, a[i]);
         }
 
         return res;
@@ -4411,7 +4461,7 @@ public class LongVector128Tests extends AbstractVectorTest {
     static long MAXReduceAllMasked(long[] a, boolean[] mask) {
         long res = MAX_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (long) Math.max(res, MAXReduceMasked(a, i, mask));
+            res = scalar_max(res, MAXReduceMasked(a, i, mask));
         }
 
         return res;
@@ -4431,7 +4481,7 @@ public class LongVector128Tests extends AbstractVectorTest {
                 LongVector av = LongVector.fromArray(SPECIES, a, i);
                 long v = av.reduceLanes(VectorOperators.MAX, vmask);
                 r[i] = v;
-                ra = (long) Math.max(ra, v);
+                ra = scalar_max(ra, v);
             }
         }
 
@@ -5464,7 +5514,7 @@ public class LongVector128Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] < b[i]);
+                assertEquals(mv.laneIsSet(j), lt(a[i + j], b[i]));
             }
         }
     }
@@ -5484,7 +5534,7 @@ public class LongVector128Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] < b[i]));
+                assertEquals(mv.laneIsSet(j), mask[j] && (lt(a[i + j], b[i])));
             }
         }
     }
@@ -5501,7 +5551,7 @@ public class LongVector128Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] == b[i]);
+                assertEquals(mv.laneIsSet(j), eq(a[i + j], b[i]));
             }
         }
     }
@@ -5521,7 +5571,7 @@ public class LongVector128Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] == b[i]));
+                assertEquals(mv.laneIsSet(j), mask[j] && (eq(a[i + j], b[i])));
             }
         }
     }
@@ -6234,11 +6284,11 @@ public class LongVector128Tests extends AbstractVectorTest {
     }
 
     static long NEG(long a) {
-        return (long)(-((long)a));
+        return (long)(scalar_neg((long)a));
     }
 
     static long neg(long a) {
-        return (long)(-((long)a));
+        return (long)(scalar_neg((long)a));
     }
 
     @Test(dataProvider = "longUnaryOpProvider")
@@ -6290,11 +6340,11 @@ public class LongVector128Tests extends AbstractVectorTest {
     }
 
     static long ABS(long a) {
-        return (long)(Math.abs((long)a));
+        return (long)(scalar_abs((long)a));
     }
 
     static long abs(long a) {
-        return (long)(Math.abs((long)a));
+        return (long)(scalar_abs((long)a));
     }
 
     @Test(dataProvider = "longUnaryOpProvider")
@@ -6785,7 +6835,7 @@ public class LongVector128Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] < b[i]);
+                assertEquals(mv.laneIsSet(j), lt(a[i + j], b[i]));
             }
         }
     }
@@ -6801,7 +6851,7 @@ public class LongVector128Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] == b[i]);
+                assertEquals(mv.laneIsSet(j), eq(a[i + j], b[i]));
             }
         }
     }
diff --git a/test/jdk/jdk/incubator/vector/LongVector256Tests.java b/test/jdk/jdk/incubator/vector/LongVector256Tests.java
index a766abe920f..84c8da4e800 100644
--- a/test/jdk/jdk/incubator/vector/LongVector256Tests.java
+++ b/test/jdk/jdk/incubator/vector/LongVector256Tests.java
@@ -1547,6 +1547,59 @@ public class LongVector256Tests extends AbstractVectorTest {
         return a >= b;
     }
 
+    static long firstNonZero(long a, long b) {
+        return Long.compare(a, (long) 0) != 0 ? a : b;
+    }
+
+    static long scalar_or(long a, long b) {
+        return (long)(a | b);
+    }
+
+    static long scalar_and(long a, long b) {
+        return (long)(a & b);
+    }
+
+    static long scalar_xor(long a, long b) {
+        return (long)(a ^ b);
+    }
+
+    static long scalar_add(long a, long b) {
+        return (long)(a + b);
+    }
+
+    static long scalar_sub(long a, long b) {
+        return (long)(a - b);
+    }
+
+    static long scalar_mul(long a, long b) {
+        return (long)(a * b);
+    }
+
+    static long scalar_min(long a, long b) {
+        return (long)(Math.min(a, b));
+    }
+
+    static long scalar_max(long a, long b) {
+        return (long)(Math.max(a, b));
+    }
+
+    static long scalar_div(long a, long b) {
+        return (long)(a / b);
+    }
+
+    static long scalar_fma(long a, long b, long c) {
+        return (long)(Math.fma(a, b, c));
+    }
+
+    static long scalar_abs(long a) {
+        return (long)(Math.abs(a));
+    }
+
+    static long scalar_neg(long a) {
+        return ((long)-a);
+    }
+
+
     static boolean ult(long a, long b) {
         return Long.compareUnsigned(a, b) < 0;
     }
@@ -1563,9 +1616,6 @@ public class LongVector256Tests extends AbstractVectorTest {
         return Long.compareUnsigned(a, b) >= 0;
     }
 
-    static long firstNonZero(long a, long b) {
-        return Long.compare(a, (long) 0) != 0 ? a : b;
-    }
 
     @Test
     static void smokeTest1() {
@@ -1679,7 +1729,7 @@ public class LongVector256Tests extends AbstractVectorTest {
     }
 
     static long ADD(long a, long b) {
-        return (long)(a + b);
+        return (long)(scalar_add(a, b));
     }
 
     @Test(dataProvider = "longBinaryOpProvider")
@@ -1700,7 +1750,7 @@ public class LongVector256Tests extends AbstractVectorTest {
     }
 
     static long add(long a, long b) {
-        return (long)(a + b);
+        return (long)(scalar_add(a, b));
     }
 
     @Test(dataProvider = "longBinaryOpProvider")
@@ -1757,7 +1807,7 @@ public class LongVector256Tests extends AbstractVectorTest {
     }
 
     static long SUB(long a, long b) {
-        return (long)(a - b);
+        return (long)(scalar_sub(a, b));
     }
 
     @Test(dataProvider = "longBinaryOpProvider")
@@ -1778,7 +1828,7 @@ public class LongVector256Tests extends AbstractVectorTest {
     }
 
     static long sub(long a, long b) {
-        return (long)(a - b);
+        return (long)(scalar_sub(a, b));
     }
 
     @Test(dataProvider = "longBinaryOpProvider")
@@ -1835,7 +1885,7 @@ public class LongVector256Tests extends AbstractVectorTest {
     }
 
     static long MUL(long a, long b) {
-        return (long)(a * b);
+        return (long)(scalar_mul(a, b));
     }
 
     @Test(dataProvider = "longBinaryOpProvider")
@@ -1856,7 +1906,7 @@ public class LongVector256Tests extends AbstractVectorTest {
     }
 
     static long mul(long a, long b) {
-        return (long)(a * b);
+        return (long)(scalar_mul(a, b));
     }
 
     @Test(dataProvider = "longBinaryOpProvider")
@@ -2003,7 +2053,7 @@ public class LongVector256Tests extends AbstractVectorTest {
     }
 
     static long FIRST_NONZERO(long a, long b) {
-        return (long)((a)!=0?a:b);
+        return (long)(firstNonZero(a, b));
     }
 
     @Test(dataProvider = "longBinaryOpProvider")
@@ -3299,7 +3349,7 @@ public class LongVector256Tests extends AbstractVectorTest {
     }
 
     static long MIN(long a, long b) {
-        return (long)(Math.min(a, b));
+        return (long)(scalar_min(a, b));
     }
 
     @Test(dataProvider = "longBinaryOpProvider")
@@ -3320,7 +3370,7 @@ public class LongVector256Tests extends AbstractVectorTest {
     }
 
     static long min(long a, long b) {
-        return (long)(Math.min(a, b));
+        return (long)(scalar_min(a, b));
     }
 
     @Test(dataProvider = "longBinaryOpProvider")
@@ -3339,7 +3389,7 @@ public class LongVector256Tests extends AbstractVectorTest {
     }
 
     static long MAX(long a, long b) {
-        return (long)(Math.max(a, b));
+        return (long)(scalar_max(a, b));
     }
 
     @Test(dataProvider = "longBinaryOpProvider")
@@ -3360,7 +3410,7 @@ public class LongVector256Tests extends AbstractVectorTest {
     }
 
     static long max(long a, long b) {
-        return (long)(Math.max(a, b));
+        return (long)(scalar_max(a, b));
     }
 
     @Test(dataProvider = "longBinaryOpProvider")
@@ -3728,7 +3778,7 @@ public class LongVector256Tests extends AbstractVectorTest {
     static long ANDReduce(long[] a, int idx) {
         long res = AND_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res &= a[i];
+            res = scalar_and(res, a[i]);
         }
 
         return res;
@@ -3737,7 +3787,7 @@ public class LongVector256Tests extends AbstractVectorTest {
     static long ANDReduceAll(long[] a) {
         long res = AND_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res &= ANDReduce(a, i);
+            res = scalar_and(res, ANDReduce(a, i));
         }
 
         return res;
@@ -3755,7 +3805,7 @@ public class LongVector256Tests extends AbstractVectorTest {
                 LongVector av = LongVector.fromArray(SPECIES, a, i);
                 long v = av.reduceLanes(VectorOperators.AND);
                 r[i] = v;
-                ra &= v;
+                ra = scalar_and(ra, v);
             }
         }
 
@@ -3768,20 +3818,20 @@ public class LongVector256Tests extends AbstractVectorTest {
         long[] a = fa.apply(SPECIES.length());
         long id = AND_IDENTITY;
 
-        assertEquals((long) (id & id), id,
+        assertEquals((long) (scalar_and(id, id)), id,
                             "AND(AND_IDENTITY, AND_IDENTITY) != AND_IDENTITY");
 
         long x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((long) (id & x), x);
-                assertEquals((long) (x & id), x);
+                assertEquals((long) (scalar_and(id, x)), x);
+                assertEquals((long) (scalar_and(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((long) (id & x), x,
+            assertEquals((long) (scalar_and(id, x)), x,
                                 "AND(AND_IDENTITY, " + x + ") != " + x);
-            assertEquals((long) (x & id), x,
+            assertEquals((long) (scalar_and(x, id)), x,
                                 "AND(" + x + ", AND_IDENTITY) != " + x);
         }
     }
@@ -3790,7 +3840,7 @@ public class LongVector256Tests extends AbstractVectorTest {
         long res = AND_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res &= a[i];
+                res = scalar_and(res, a[i]);
         }
 
         return res;
@@ -3799,7 +3849,7 @@ public class LongVector256Tests extends AbstractVectorTest {
     static long ANDReduceAllMasked(long[] a, boolean[] mask) {
         long res = AND_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res &= ANDReduceMasked(a, i, mask);
+            res = scalar_and(res, ANDReduceMasked(a, i, mask));
         }
 
         return res;
@@ -3819,7 +3869,7 @@ public class LongVector256Tests extends AbstractVectorTest {
                 LongVector av = LongVector.fromArray(SPECIES, a, i);
                 long v = av.reduceLanes(VectorOperators.AND, vmask);
                 r[i] = v;
-                ra &= v;
+                ra = scalar_and(ra, v);
             }
         }
 
@@ -3830,7 +3880,7 @@ public class LongVector256Tests extends AbstractVectorTest {
     static long ORReduce(long[] a, int idx) {
         long res = OR_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res |= a[i];
+            res = scalar_or(res, a[i]);
         }
 
         return res;
@@ -3839,7 +3889,7 @@ public class LongVector256Tests extends AbstractVectorTest {
     static long ORReduceAll(long[] a) {
         long res = OR_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res |= ORReduce(a, i);
+            res = scalar_or(res, ORReduce(a, i));
         }
 
         return res;
@@ -3857,7 +3907,7 @@ public class LongVector256Tests extends AbstractVectorTest {
                 LongVector av = LongVector.fromArray(SPECIES, a, i);
                 long v = av.reduceLanes(VectorOperators.OR);
                 r[i] = v;
-                ra |= v;
+                ra = scalar_or(ra, v);
             }
         }
 
@@ -3870,20 +3920,20 @@ public class LongVector256Tests extends AbstractVectorTest {
         long[] a = fa.apply(SPECIES.length());
         long id = OR_IDENTITY;
 
-        assertEquals((long) (id | id), id,
+        assertEquals((long) (scalar_or(id, id)), id,
                             "OR(OR_IDENTITY, OR_IDENTITY) != OR_IDENTITY");
 
         long x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((long) (id | x), x);
-                assertEquals((long) (x | id), x);
+                assertEquals((long) (scalar_or(id, x)), x);
+                assertEquals((long) (scalar_or(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((long) (id | x), x,
+            assertEquals((long) (scalar_or(id, x)), x,
                                 "OR(OR_IDENTITY, " + x + ") != " + x);
-            assertEquals((long) (x | id), x,
+            assertEquals((long) (scalar_or(x, id)), x,
                                 "OR(" + x + ", OR_IDENTITY) != " + x);
         }
     }
@@ -3892,7 +3942,7 @@ public class LongVector256Tests extends AbstractVectorTest {
         long res = OR_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res |= a[i];
+                res = scalar_or(res, a[i]);
         }
 
         return res;
@@ -3901,7 +3951,7 @@ public class LongVector256Tests extends AbstractVectorTest {
     static long ORReduceAllMasked(long[] a, boolean[] mask) {
         long res = OR_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res |= ORReduceMasked(a, i, mask);
+            res = scalar_or(res, ORReduceMasked(a, i, mask));
         }
 
         return res;
@@ -3921,7 +3971,7 @@ public class LongVector256Tests extends AbstractVectorTest {
                 LongVector av = LongVector.fromArray(SPECIES, a, i);
                 long v = av.reduceLanes(VectorOperators.OR, vmask);
                 r[i] = v;
-                ra |= v;
+                ra = scalar_or(ra, v);
             }
         }
 
@@ -3932,7 +3982,7 @@ public class LongVector256Tests extends AbstractVectorTest {
     static long XORReduce(long[] a, int idx) {
         long res = XOR_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res ^= a[i];
+            res = scalar_xor(res, a[i]);
         }
 
         return res;
@@ -3941,7 +3991,7 @@ public class LongVector256Tests extends AbstractVectorTest {
     static long XORReduceAll(long[] a) {
         long res = XOR_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res ^= XORReduce(a, i);
+            res = scalar_xor(res, XORReduce(a, i));
         }
 
         return res;
@@ -3959,7 +4009,7 @@ public class LongVector256Tests extends AbstractVectorTest {
                 LongVector av = LongVector.fromArray(SPECIES, a, i);
                 long v = av.reduceLanes(VectorOperators.XOR);
                 r[i] = v;
-                ra ^= v;
+                ra = scalar_xor(ra, v);
             }
         }
 
@@ -3972,20 +4022,20 @@ public class LongVector256Tests extends AbstractVectorTest {
         long[] a = fa.apply(SPECIES.length());
         long id = XOR_IDENTITY;
 
-        assertEquals((long) (id ^ id), id,
+        assertEquals((long) (scalar_xor(id, id)), id,
                             "XOR(XOR_IDENTITY, XOR_IDENTITY) != XOR_IDENTITY");
 
         long x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((long) (id ^ x), x);
-                assertEquals((long) (x ^ id), x);
+                assertEquals((long) (scalar_xor(id, x)), x);
+                assertEquals((long) (scalar_xor(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((long) (id ^ x), x,
+            assertEquals((long) (scalar_xor(id, x)), x,
                                 "XOR(XOR_IDENTITY, " + x + ") != " + x);
-            assertEquals((long) (x ^ id), x,
+            assertEquals((long) (scalar_xor(x, id)), x,
                                 "XOR(" + x + ", XOR_IDENTITY) != " + x);
         }
     }
@@ -3994,7 +4044,7 @@ public class LongVector256Tests extends AbstractVectorTest {
         long res = XOR_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res ^= a[i];
+                res = scalar_xor(res, a[i]);
         }
 
         return res;
@@ -4003,7 +4053,7 @@ public class LongVector256Tests extends AbstractVectorTest {
     static long XORReduceAllMasked(long[] a, boolean[] mask) {
         long res = XOR_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res ^= XORReduceMasked(a, i, mask);
+            res = scalar_xor(res, XORReduceMasked(a, i, mask));
         }
 
         return res;
@@ -4023,7 +4073,7 @@ public class LongVector256Tests extends AbstractVectorTest {
                 LongVector av = LongVector.fromArray(SPECIES, a, i);
                 long v = av.reduceLanes(VectorOperators.XOR, vmask);
                 r[i] = v;
-                ra ^= v;
+                ra = scalar_xor(ra, v);
             }
         }
 
@@ -4034,7 +4084,7 @@ public class LongVector256Tests extends AbstractVectorTest {
     static long ADDReduce(long[] a, int idx) {
         long res = ADD_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res += a[i];
+            res = scalar_add(res, a[i]);
         }
 
         return res;
@@ -4043,7 +4093,7 @@ public class LongVector256Tests extends AbstractVectorTest {
     static long ADDReduceAll(long[] a) {
         long res = ADD_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduce(a, i);
+            res = scalar_add(res, ADDReduce(a, i));
         }
 
         return res;
@@ -4061,7 +4111,7 @@ public class LongVector256Tests extends AbstractVectorTest {
                 LongVector av = LongVector.fromArray(SPECIES, a, i);
                 long v = av.reduceLanes(VectorOperators.ADD);
                 r[i] = v;
-                ra += v;
+                ra = scalar_add(ra, v);
             }
         }
 
@@ -4074,20 +4124,20 @@ public class LongVector256Tests extends AbstractVectorTest {
         long[] a = fa.apply(SPECIES.length());
         long id = ADD_IDENTITY;
 
-        assertEquals((long) (id + id), id,
+        assertEquals((long) (scalar_add(id, id)), id,
                             "ADD(ADD_IDENTITY, ADD_IDENTITY) != ADD_IDENTITY");
 
         long x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((long) (id + x), x);
-                assertEquals((long) (x + id), x);
+                assertEquals((long) (scalar_add(id, x)), x);
+                assertEquals((long) (scalar_add(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((long) (id + x), x,
+            assertEquals((long) (scalar_add(id, x)), x,
                                 "ADD(ADD_IDENTITY, " + x + ") != " + x);
-            assertEquals((long) (x + id), x,
+            assertEquals((long) (scalar_add(x, id)), x,
                                 "ADD(" + x + ", ADD_IDENTITY) != " + x);
         }
     }
@@ -4096,7 +4146,7 @@ public class LongVector256Tests extends AbstractVectorTest {
         long res = ADD_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res += a[i];
+                res = scalar_add(res, a[i]);
         }
 
         return res;
@@ -4105,7 +4155,7 @@ public class LongVector256Tests extends AbstractVectorTest {
     static long ADDReduceAllMasked(long[] a, boolean[] mask) {
         long res = ADD_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduceMasked(a, i, mask);
+            res = scalar_add(res, ADDReduceMasked(a, i, mask));
         }
 
         return res;
@@ -4125,7 +4175,7 @@ public class LongVector256Tests extends AbstractVectorTest {
                 LongVector av = LongVector.fromArray(SPECIES, a, i);
                 long v = av.reduceLanes(VectorOperators.ADD, vmask);
                 r[i] = v;
-                ra += v;
+                ra = scalar_add(ra, v);
             }
         }
 
@@ -4136,7 +4186,7 @@ public class LongVector256Tests extends AbstractVectorTest {
     static long MULReduce(long[] a, int idx) {
         long res = MUL_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res *= a[i];
+            res = scalar_mul(res, a[i]);
         }
 
         return res;
@@ -4145,7 +4195,7 @@ public class LongVector256Tests extends AbstractVectorTest {
     static long MULReduceAll(long[] a) {
         long res = MUL_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res *= MULReduce(a, i);
+            res = scalar_mul(res, MULReduce(a, i));
         }
 
         return res;
@@ -4163,7 +4213,7 @@ public class LongVector256Tests extends AbstractVectorTest {
                 LongVector av = LongVector.fromArray(SPECIES, a, i);
                 long v = av.reduceLanes(VectorOperators.MUL);
                 r[i] = v;
-                ra *= v;
+                ra = scalar_mul(ra, v);
             }
         }
 
@@ -4176,20 +4226,20 @@ public class LongVector256Tests extends AbstractVectorTest {
         long[] a = fa.apply(SPECIES.length());
         long id = MUL_IDENTITY;
 
-        assertEquals((long) (id * id), id,
+        assertEquals((long) (scalar_mul(id, id)), id,
                             "MUL(MUL_IDENTITY, MUL_IDENTITY) != MUL_IDENTITY");
 
         long x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((long) (id * x), x);
-                assertEquals((long) (x * id), x);
+                assertEquals((long) (scalar_mul(id, x)), x);
+                assertEquals((long) (scalar_mul(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((long) (id * x), x,
+            assertEquals((long) (scalar_mul(id, x)), x,
                                 "MUL(MUL_IDENTITY, " + x + ") != " + x);
-            assertEquals((long) (x * id), x,
+            assertEquals((long) (scalar_mul(x, id)), x,
                                 "MUL(" + x + ", MUL_IDENTITY) != " + x);
         }
     }
@@ -4198,7 +4248,7 @@ public class LongVector256Tests extends AbstractVectorTest {
         long res = MUL_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res *= a[i];
+                res = scalar_mul(res, a[i]);
         }
 
         return res;
@@ -4207,7 +4257,7 @@ public class LongVector256Tests extends AbstractVectorTest {
     static long MULReduceAllMasked(long[] a, boolean[] mask) {
         long res = MUL_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res *= MULReduceMasked(a, i, mask);
+            res = scalar_mul(res, MULReduceMasked(a, i, mask));
         }
 
         return res;
@@ -4227,7 +4277,7 @@ public class LongVector256Tests extends AbstractVectorTest {
                 LongVector av = LongVector.fromArray(SPECIES, a, i);
                 long v = av.reduceLanes(VectorOperators.MUL, vmask);
                 r[i] = v;
-                ra *= v;
+                ra = scalar_mul(ra, v);
             }
         }
 
@@ -4238,7 +4288,7 @@ public class LongVector256Tests extends AbstractVectorTest {
     static long MINReduce(long[] a, int idx) {
         long res = MIN_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res = (long) Math.min(res, a[i]);
+            res = scalar_min(res, a[i]);
         }
 
         return res;
@@ -4247,7 +4297,7 @@ public class LongVector256Tests extends AbstractVectorTest {
     static long MINReduceAll(long[] a) {
         long res = MIN_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (long) Math.min(res, MINReduce(a, i));
+            res = scalar_min(res, MINReduce(a, i));
         }
 
         return res;
@@ -4265,7 +4315,7 @@ public class LongVector256Tests extends AbstractVectorTest {
                 LongVector av = LongVector.fromArray(SPECIES, a, i);
                 long v = av.reduceLanes(VectorOperators.MIN);
                 r[i] = v;
-                ra = (long) Math.min(ra, v);
+                ra = scalar_min(ra, v);
             }
         }
 
@@ -4278,20 +4328,20 @@ public class LongVector256Tests extends AbstractVectorTest {
         long[] a = fa.apply(SPECIES.length());
         long id = MIN_IDENTITY;
 
-        assertEquals((long) Math.min(id, id), id,
+        assertEquals(scalar_min(id, id), id,
                             "MIN(MIN_IDENTITY, MIN_IDENTITY) != MIN_IDENTITY");
 
         long x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((long) Math.min(id, x), x);
-                assertEquals((long) Math.min(x, id), x);
+                assertEquals(scalar_min(id, x), x);
+                assertEquals(scalar_min(x, id), x);
             }
         } catch (AssertionError e) {
-            assertEquals((long) Math.min(id, x), x,
+            assertEquals(scalar_min(id, x), x,
                                 "MIN(MIN_IDENTITY, " + x + ") != " + x);
-            assertEquals((long) Math.min(x, id), x,
+            assertEquals(scalar_min(x, id), x,
                                 "MIN(" + x + ", MIN_IDENTITY) != " + x);
         }
     }
@@ -4300,7 +4350,7 @@ public class LongVector256Tests extends AbstractVectorTest {
         long res = MIN_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res = (long) Math.min(res, a[i]);
+                res = scalar_min(res, a[i]);
         }
 
         return res;
@@ -4309,7 +4359,7 @@ public class LongVector256Tests extends AbstractVectorTest {
     static long MINReduceAllMasked(long[] a, boolean[] mask) {
         long res = MIN_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (long) Math.min(res, MINReduceMasked(a, i, mask));
+            res = scalar_min(res, MINReduceMasked(a, i, mask));
         }
 
         return res;
@@ -4329,7 +4379,7 @@ public class LongVector256Tests extends AbstractVectorTest {
                 LongVector av = LongVector.fromArray(SPECIES, a, i);
                 long v = av.reduceLanes(VectorOperators.MIN, vmask);
                 r[i] = v;
-                ra = (long) Math.min(ra, v);
+                ra = scalar_min(ra, v);
             }
         }
 
@@ -4340,7 +4390,7 @@ public class LongVector256Tests extends AbstractVectorTest {
     static long MAXReduce(long[] a, int idx) {
         long res = MAX_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res = (long) Math.max(res, a[i]);
+            res = scalar_max(res, a[i]);
         }
 
         return res;
@@ -4349,7 +4399,7 @@ public class LongVector256Tests extends AbstractVectorTest {
     static long MAXReduceAll(long[] a) {
         long res = MAX_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (long) Math.max(res, MAXReduce(a, i));
+            res = scalar_max(res, MAXReduce(a, i));
         }
 
         return res;
@@ -4367,7 +4417,7 @@ public class LongVector256Tests extends AbstractVectorTest {
                 LongVector av = LongVector.fromArray(SPECIES, a, i);
                 long v = av.reduceLanes(VectorOperators.MAX);
                 r[i] = v;
-                ra = (long) Math.max(ra, v);
+                ra = scalar_max(ra, v);
             }
         }
 
@@ -4380,20 +4430,20 @@ public class LongVector256Tests extends AbstractVectorTest {
         long[] a = fa.apply(SPECIES.length());
         long id = MAX_IDENTITY;
 
-        assertEquals((long) Math.max(id, id), id,
+        assertEquals(scalar_max(id, id), id,
                             "MAX(MAX_IDENTITY, MAX_IDENTITY) != MAX_IDENTITY");
 
         long x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((long) Math.max(id, x), x);
-                assertEquals((long) Math.max(x, id), x);
+                assertEquals(scalar_max(id, x), x);
+                assertEquals(scalar_max(x, id), x);
             }
         } catch (AssertionError e) {
-            assertEquals((long) Math.max(id, x), x,
+            assertEquals(scalar_max(id, x), x,
                                 "MAX(MAX_IDENTITY, " + x + ") != " + x);
-            assertEquals((long) Math.max(x, id), x,
+            assertEquals(scalar_max(x, id), x,
                                 "MAX(" + x + ", MAX_IDENTITY) != " + x);
         }
     }
@@ -4402,7 +4452,7 @@ public class LongVector256Tests extends AbstractVectorTest {
         long res = MAX_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res = (long) Math.max(res, a[i]);
+                res = scalar_max(res, a[i]);
         }
 
         return res;
@@ -4411,7 +4461,7 @@ public class LongVector256Tests extends AbstractVectorTest {
     static long MAXReduceAllMasked(long[] a, boolean[] mask) {
         long res = MAX_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (long) Math.max(res, MAXReduceMasked(a, i, mask));
+            res = scalar_max(res, MAXReduceMasked(a, i, mask));
         }
 
         return res;
@@ -4431,7 +4481,7 @@ public class LongVector256Tests extends AbstractVectorTest {
                 LongVector av = LongVector.fromArray(SPECIES, a, i);
                 long v = av.reduceLanes(VectorOperators.MAX, vmask);
                 r[i] = v;
-                ra = (long) Math.max(ra, v);
+                ra = scalar_max(ra, v);
             }
         }
 
@@ -5464,7 +5514,7 @@ public class LongVector256Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] < b[i]);
+                assertEquals(mv.laneIsSet(j), lt(a[i + j], b[i]));
             }
         }
     }
@@ -5484,7 +5534,7 @@ public class LongVector256Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] < b[i]));
+                assertEquals(mv.laneIsSet(j), mask[j] && (lt(a[i + j], b[i])));
             }
         }
     }
@@ -5501,7 +5551,7 @@ public class LongVector256Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] == b[i]);
+                assertEquals(mv.laneIsSet(j), eq(a[i + j], b[i]));
             }
         }
     }
@@ -5521,7 +5571,7 @@ public class LongVector256Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] == b[i]));
+                assertEquals(mv.laneIsSet(j), mask[j] && (eq(a[i + j], b[i])));
             }
         }
     }
@@ -6234,11 +6284,11 @@ public class LongVector256Tests extends AbstractVectorTest {
     }
 
     static long NEG(long a) {
-        return (long)(-((long)a));
+        return (long)(scalar_neg((long)a));
     }
 
     static long neg(long a) {
-        return (long)(-((long)a));
+        return (long)(scalar_neg((long)a));
     }
 
     @Test(dataProvider = "longUnaryOpProvider")
@@ -6290,11 +6340,11 @@ public class LongVector256Tests extends AbstractVectorTest {
     }
 
     static long ABS(long a) {
-        return (long)(Math.abs((long)a));
+        return (long)(scalar_abs((long)a));
     }
 
     static long abs(long a) {
-        return (long)(Math.abs((long)a));
+        return (long)(scalar_abs((long)a));
     }
 
     @Test(dataProvider = "longUnaryOpProvider")
@@ -6785,7 +6835,7 @@ public class LongVector256Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] < b[i]);
+                assertEquals(mv.laneIsSet(j), lt(a[i + j], b[i]));
             }
         }
     }
@@ -6801,7 +6851,7 @@ public class LongVector256Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] == b[i]);
+                assertEquals(mv.laneIsSet(j), eq(a[i + j], b[i]));
             }
         }
     }
diff --git a/test/jdk/jdk/incubator/vector/LongVector512Tests.java b/test/jdk/jdk/incubator/vector/LongVector512Tests.java
index 503bd7942f2..00d8c4b010a 100644
--- a/test/jdk/jdk/incubator/vector/LongVector512Tests.java
+++ b/test/jdk/jdk/incubator/vector/LongVector512Tests.java
@@ -1547,6 +1547,59 @@ public class LongVector512Tests extends AbstractVectorTest {
         return a >= b;
     }
 
+    static long firstNonZero(long a, long b) {
+        return Long.compare(a, (long) 0) != 0 ? a : b;
+    }
+
+    static long scalar_or(long a, long b) {
+        return (long)(a | b);
+    }
+
+    static long scalar_and(long a, long b) {
+        return (long)(a & b);
+    }
+
+    static long scalar_xor(long a, long b) {
+        return (long)(a ^ b);
+    }
+
+    static long scalar_add(long a, long b) {
+        return (long)(a + b);
+    }
+
+    static long scalar_sub(long a, long b) {
+        return (long)(a - b);
+    }
+
+    static long scalar_mul(long a, long b) {
+        return (long)(a * b);
+    }
+
+    static long scalar_min(long a, long b) {
+        return (long)(Math.min(a, b));
+    }
+
+    static long scalar_max(long a, long b) {
+        return (long)(Math.max(a, b));
+    }
+
+    static long scalar_div(long a, long b) {
+        return (long)(a / b);
+    }
+
+    static long scalar_fma(long a, long b, long c) {
+        return (long)(Math.fma(a, b, c));
+    }
+
+    static long scalar_abs(long a) {
+        return (long)(Math.abs(a));
+    }
+
+    static long scalar_neg(long a) {
+        return ((long)-a);
+    }
+
+
     static boolean ult(long a, long b) {
         return Long.compareUnsigned(a, b) < 0;
     }
@@ -1563,9 +1616,6 @@ public class LongVector512Tests extends AbstractVectorTest {
         return Long.compareUnsigned(a, b) >= 0;
     }
 
-    static long firstNonZero(long a, long b) {
-        return Long.compare(a, (long) 0) != 0 ? a : b;
-    }
 
     @Test
     static void smokeTest1() {
@@ -1679,7 +1729,7 @@ public class LongVector512Tests extends AbstractVectorTest {
     }
 
     static long ADD(long a, long b) {
-        return (long)(a + b);
+        return (long)(scalar_add(a, b));
     }
 
     @Test(dataProvider = "longBinaryOpProvider")
@@ -1700,7 +1750,7 @@ public class LongVector512Tests extends AbstractVectorTest {
     }
 
     static long add(long a, long b) {
-        return (long)(a + b);
+        return (long)(scalar_add(a, b));
     }
 
     @Test(dataProvider = "longBinaryOpProvider")
@@ -1757,7 +1807,7 @@ public class LongVector512Tests extends AbstractVectorTest {
     }
 
     static long SUB(long a, long b) {
-        return (long)(a - b);
+        return (long)(scalar_sub(a, b));
     }
 
     @Test(dataProvider = "longBinaryOpProvider")
@@ -1778,7 +1828,7 @@ public class LongVector512Tests extends AbstractVectorTest {
     }
 
     static long sub(long a, long b) {
-        return (long)(a - b);
+        return (long)(scalar_sub(a, b));
     }
 
     @Test(dataProvider = "longBinaryOpProvider")
@@ -1835,7 +1885,7 @@ public class LongVector512Tests extends AbstractVectorTest {
     }
 
     static long MUL(long a, long b) {
-        return (long)(a * b);
+        return (long)(scalar_mul(a, b));
     }
 
     @Test(dataProvider = "longBinaryOpProvider")
@@ -1856,7 +1906,7 @@ public class LongVector512Tests extends AbstractVectorTest {
     }
 
     static long mul(long a, long b) {
-        return (long)(a * b);
+        return (long)(scalar_mul(a, b));
     }
 
     @Test(dataProvider = "longBinaryOpProvider")
@@ -2003,7 +2053,7 @@ public class LongVector512Tests extends AbstractVectorTest {
     }
 
     static long FIRST_NONZERO(long a, long b) {
-        return (long)((a)!=0?a:b);
+        return (long)(firstNonZero(a, b));
     }
 
     @Test(dataProvider = "longBinaryOpProvider")
@@ -3299,7 +3349,7 @@ public class LongVector512Tests extends AbstractVectorTest {
     }
 
     static long MIN(long a, long b) {
-        return (long)(Math.min(a, b));
+        return (long)(scalar_min(a, b));
     }
 
     @Test(dataProvider = "longBinaryOpProvider")
@@ -3320,7 +3370,7 @@ public class LongVector512Tests extends AbstractVectorTest {
     }
 
     static long min(long a, long b) {
-        return (long)(Math.min(a, b));
+        return (long)(scalar_min(a, b));
     }
 
     @Test(dataProvider = "longBinaryOpProvider")
@@ -3339,7 +3389,7 @@ public class LongVector512Tests extends AbstractVectorTest {
     }
 
     static long MAX(long a, long b) {
-        return (long)(Math.max(a, b));
+        return (long)(scalar_max(a, b));
     }
 
     @Test(dataProvider = "longBinaryOpProvider")
@@ -3360,7 +3410,7 @@ public class LongVector512Tests extends AbstractVectorTest {
     }
 
     static long max(long a, long b) {
-        return (long)(Math.max(a, b));
+        return (long)(scalar_max(a, b));
     }
 
     @Test(dataProvider = "longBinaryOpProvider")
@@ -3728,7 +3778,7 @@ public class LongVector512Tests extends AbstractVectorTest {
     static long ANDReduce(long[] a, int idx) {
         long res = AND_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res &= a[i];
+            res = scalar_and(res, a[i]);
         }
 
         return res;
@@ -3737,7 +3787,7 @@ public class LongVector512Tests extends AbstractVectorTest {
     static long ANDReduceAll(long[] a) {
         long res = AND_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res &= ANDReduce(a, i);
+            res = scalar_and(res, ANDReduce(a, i));
         }
 
         return res;
@@ -3755,7 +3805,7 @@ public class LongVector512Tests extends AbstractVectorTest {
                 LongVector av = LongVector.fromArray(SPECIES, a, i);
                 long v = av.reduceLanes(VectorOperators.AND);
                 r[i] = v;
-                ra &= v;
+                ra = scalar_and(ra, v);
             }
         }
 
@@ -3768,20 +3818,20 @@ public class LongVector512Tests extends AbstractVectorTest {
         long[] a = fa.apply(SPECIES.length());
         long id = AND_IDENTITY;
 
-        assertEquals((long) (id & id), id,
+        assertEquals((long) (scalar_and(id, id)), id,
                             "AND(AND_IDENTITY, AND_IDENTITY) != AND_IDENTITY");
 
         long x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((long) (id & x), x);
-                assertEquals((long) (x & id), x);
+                assertEquals((long) (scalar_and(id, x)), x);
+                assertEquals((long) (scalar_and(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((long) (id & x), x,
+            assertEquals((long) (scalar_and(id, x)), x,
                                 "AND(AND_IDENTITY, " + x + ") != " + x);
-            assertEquals((long) (x & id), x,
+            assertEquals((long) (scalar_and(x, id)), x,
                                 "AND(" + x + ", AND_IDENTITY) != " + x);
         }
     }
@@ -3790,7 +3840,7 @@ public class LongVector512Tests extends AbstractVectorTest {
         long res = AND_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res &= a[i];
+                res = scalar_and(res, a[i]);
         }
 
         return res;
@@ -3799,7 +3849,7 @@ public class LongVector512Tests extends AbstractVectorTest {
     static long ANDReduceAllMasked(long[] a, boolean[] mask) {
         long res = AND_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res &= ANDReduceMasked(a, i, mask);
+            res = scalar_and(res, ANDReduceMasked(a, i, mask));
         }
 
         return res;
@@ -3819,7 +3869,7 @@ public class LongVector512Tests extends AbstractVectorTest {
                 LongVector av = LongVector.fromArray(SPECIES, a, i);
                 long v = av.reduceLanes(VectorOperators.AND, vmask);
                 r[i] = v;
-                ra &= v;
+                ra = scalar_and(ra, v);
             }
         }
 
@@ -3830,7 +3880,7 @@ public class LongVector512Tests extends AbstractVectorTest {
     static long ORReduce(long[] a, int idx) {
         long res = OR_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res |= a[i];
+            res = scalar_or(res, a[i]);
         }
 
         return res;
@@ -3839,7 +3889,7 @@ public class LongVector512Tests extends AbstractVectorTest {
     static long ORReduceAll(long[] a) {
         long res = OR_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res |= ORReduce(a, i);
+            res = scalar_or(res, ORReduce(a, i));
         }
 
         return res;
@@ -3857,7 +3907,7 @@ public class LongVector512Tests extends AbstractVectorTest {
                 LongVector av = LongVector.fromArray(SPECIES, a, i);
                 long v = av.reduceLanes(VectorOperators.OR);
                 r[i] = v;
-                ra |= v;
+                ra = scalar_or(ra, v);
             }
         }
 
@@ -3870,20 +3920,20 @@ public class LongVector512Tests extends AbstractVectorTest {
         long[] a = fa.apply(SPECIES.length());
         long id = OR_IDENTITY;
 
-        assertEquals((long) (id | id), id,
+        assertEquals((long) (scalar_or(id, id)), id,
                             "OR(OR_IDENTITY, OR_IDENTITY) != OR_IDENTITY");
 
         long x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((long) (id | x), x);
-                assertEquals((long) (x | id), x);
+                assertEquals((long) (scalar_or(id, x)), x);
+                assertEquals((long) (scalar_or(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((long) (id | x), x,
+            assertEquals((long) (scalar_or(id, x)), x,
                                 "OR(OR_IDENTITY, " + x + ") != " + x);
-            assertEquals((long) (x | id), x,
+            assertEquals((long) (scalar_or(x, id)), x,
                                 "OR(" + x + ", OR_IDENTITY) != " + x);
         }
     }
@@ -3892,7 +3942,7 @@ public class LongVector512Tests extends AbstractVectorTest {
         long res = OR_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res |= a[i];
+                res = scalar_or(res, a[i]);
         }
 
         return res;
@@ -3901,7 +3951,7 @@ public class LongVector512Tests extends AbstractVectorTest {
     static long ORReduceAllMasked(long[] a, boolean[] mask) {
         long res = OR_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res |= ORReduceMasked(a, i, mask);
+            res = scalar_or(res, ORReduceMasked(a, i, mask));
         }
 
         return res;
@@ -3921,7 +3971,7 @@ public class LongVector512Tests extends AbstractVectorTest {
                 LongVector av = LongVector.fromArray(SPECIES, a, i);
                 long v = av.reduceLanes(VectorOperators.OR, vmask);
                 r[i] = v;
-                ra |= v;
+                ra = scalar_or(ra, v);
             }
         }
 
@@ -3932,7 +3982,7 @@ public class LongVector512Tests extends AbstractVectorTest {
     static long XORReduce(long[] a, int idx) {
         long res = XOR_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res ^= a[i];
+            res = scalar_xor(res, a[i]);
         }
 
         return res;
@@ -3941,7 +3991,7 @@ public class LongVector512Tests extends AbstractVectorTest {
     static long XORReduceAll(long[] a) {
         long res = XOR_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res ^= XORReduce(a, i);
+            res = scalar_xor(res, XORReduce(a, i));
         }
 
         return res;
@@ -3959,7 +4009,7 @@ public class LongVector512Tests extends AbstractVectorTest {
                 LongVector av = LongVector.fromArray(SPECIES, a, i);
                 long v = av.reduceLanes(VectorOperators.XOR);
                 r[i] = v;
-                ra ^= v;
+                ra = scalar_xor(ra, v);
             }
         }
 
@@ -3972,20 +4022,20 @@ public class LongVector512Tests extends AbstractVectorTest {
         long[] a = fa.apply(SPECIES.length());
         long id = XOR_IDENTITY;
 
-        assertEquals((long) (id ^ id), id,
+        assertEquals((long) (scalar_xor(id, id)), id,
                             "XOR(XOR_IDENTITY, XOR_IDENTITY) != XOR_IDENTITY");
 
         long x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((long) (id ^ x), x);
-                assertEquals((long) (x ^ id), x);
+                assertEquals((long) (scalar_xor(id, x)), x);
+                assertEquals((long) (scalar_xor(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((long) (id ^ x), x,
+            assertEquals((long) (scalar_xor(id, x)), x,
                                 "XOR(XOR_IDENTITY, " + x + ") != " + x);
-            assertEquals((long) (x ^ id), x,
+            assertEquals((long) (scalar_xor(x, id)), x,
                                 "XOR(" + x + ", XOR_IDENTITY) != " + x);
         }
     }
@@ -3994,7 +4044,7 @@ public class LongVector512Tests extends AbstractVectorTest {
         long res = XOR_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res ^= a[i];
+                res = scalar_xor(res, a[i]);
         }
 
         return res;
@@ -4003,7 +4053,7 @@ public class LongVector512Tests extends AbstractVectorTest {
     static long XORReduceAllMasked(long[] a, boolean[] mask) {
         long res = XOR_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res ^= XORReduceMasked(a, i, mask);
+            res = scalar_xor(res, XORReduceMasked(a, i, mask));
         }
 
         return res;
@@ -4023,7 +4073,7 @@ public class LongVector512Tests extends AbstractVectorTest {
                 LongVector av = LongVector.fromArray(SPECIES, a, i);
                 long v = av.reduceLanes(VectorOperators.XOR, vmask);
                 r[i] = v;
-                ra ^= v;
+                ra = scalar_xor(ra, v);
             }
         }
 
@@ -4034,7 +4084,7 @@ public class LongVector512Tests extends AbstractVectorTest {
     static long ADDReduce(long[] a, int idx) {
         long res = ADD_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res += a[i];
+            res = scalar_add(res, a[i]);
         }
 
         return res;
@@ -4043,7 +4093,7 @@ public class LongVector512Tests extends AbstractVectorTest {
     static long ADDReduceAll(long[] a) {
         long res = ADD_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduce(a, i);
+            res = scalar_add(res, ADDReduce(a, i));
         }
 
         return res;
@@ -4061,7 +4111,7 @@ public class LongVector512Tests extends AbstractVectorTest {
                 LongVector av = LongVector.fromArray(SPECIES, a, i);
                 long v = av.reduceLanes(VectorOperators.ADD);
                 r[i] = v;
-                ra += v;
+                ra = scalar_add(ra, v);
             }
         }
 
@@ -4074,20 +4124,20 @@ public class LongVector512Tests extends AbstractVectorTest {
         long[] a = fa.apply(SPECIES.length());
         long id = ADD_IDENTITY;
 
-        assertEquals((long) (id + id), id,
+        assertEquals((long) (scalar_add(id, id)), id,
                             "ADD(ADD_IDENTITY, ADD_IDENTITY) != ADD_IDENTITY");
 
         long x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((long) (id + x), x);
-                assertEquals((long) (x + id), x);
+                assertEquals((long) (scalar_add(id, x)), x);
+                assertEquals((long) (scalar_add(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((long) (id + x), x,
+            assertEquals((long) (scalar_add(id, x)), x,
                                 "ADD(ADD_IDENTITY, " + x + ") != " + x);
-            assertEquals((long) (x + id), x,
+            assertEquals((long) (scalar_add(x, id)), x,
                                 "ADD(" + x + ", ADD_IDENTITY) != " + x);
         }
     }
@@ -4096,7 +4146,7 @@ public class LongVector512Tests extends AbstractVectorTest {
         long res = ADD_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res += a[i];
+                res = scalar_add(res, a[i]);
         }
 
         return res;
@@ -4105,7 +4155,7 @@ public class LongVector512Tests extends AbstractVectorTest {
     static long ADDReduceAllMasked(long[] a, boolean[] mask) {
         long res = ADD_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduceMasked(a, i, mask);
+            res = scalar_add(res, ADDReduceMasked(a, i, mask));
         }
 
         return res;
@@ -4125,7 +4175,7 @@ public class LongVector512Tests extends AbstractVectorTest {
                 LongVector av = LongVector.fromArray(SPECIES, a, i);
                 long v = av.reduceLanes(VectorOperators.ADD, vmask);
                 r[i] = v;
-                ra += v;
+                ra = scalar_add(ra, v);
             }
         }
 
@@ -4136,7 +4186,7 @@ public class LongVector512Tests extends AbstractVectorTest {
     static long MULReduce(long[] a, int idx) {
         long res = MUL_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res *= a[i];
+            res = scalar_mul(res, a[i]);
         }
 
         return res;
@@ -4145,7 +4195,7 @@ public class LongVector512Tests extends AbstractVectorTest {
     static long MULReduceAll(long[] a) {
         long res = MUL_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res *= MULReduce(a, i);
+            res = scalar_mul(res, MULReduce(a, i));
         }
 
         return res;
@@ -4163,7 +4213,7 @@ public class LongVector512Tests extends AbstractVectorTest {
                 LongVector av = LongVector.fromArray(SPECIES, a, i);
                 long v = av.reduceLanes(VectorOperators.MUL);
                 r[i] = v;
-                ra *= v;
+                ra = scalar_mul(ra, v);
             }
         }
 
@@ -4176,20 +4226,20 @@ public class LongVector512Tests extends AbstractVectorTest {
         long[] a = fa.apply(SPECIES.length());
         long id = MUL_IDENTITY;
 
-        assertEquals((long) (id * id), id,
+        assertEquals((long) (scalar_mul(id, id)), id,
                             "MUL(MUL_IDENTITY, MUL_IDENTITY) != MUL_IDENTITY");
 
         long x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((long) (id * x), x);
-                assertEquals((long) (x * id), x);
+                assertEquals((long) (scalar_mul(id, x)), x);
+                assertEquals((long) (scalar_mul(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((long) (id * x), x,
+            assertEquals((long) (scalar_mul(id, x)), x,
                                 "MUL(MUL_IDENTITY, " + x + ") != " + x);
-            assertEquals((long) (x * id), x,
+            assertEquals((long) (scalar_mul(x, id)), x,
                                 "MUL(" + x + ", MUL_IDENTITY) != " + x);
         }
     }
@@ -4198,7 +4248,7 @@ public class LongVector512Tests extends AbstractVectorTest {
         long res = MUL_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res *= a[i];
+                res = scalar_mul(res, a[i]);
         }
 
         return res;
@@ -4207,7 +4257,7 @@ public class LongVector512Tests extends AbstractVectorTest {
     static long MULReduceAllMasked(long[] a, boolean[] mask) {
         long res = MUL_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res *= MULReduceMasked(a, i, mask);
+            res = scalar_mul(res, MULReduceMasked(a, i, mask));
         }
 
         return res;
@@ -4227,7 +4277,7 @@ public class LongVector512Tests extends AbstractVectorTest {
                 LongVector av = LongVector.fromArray(SPECIES, a, i);
                 long v = av.reduceLanes(VectorOperators.MUL, vmask);
                 r[i] = v;
-                ra *= v;
+                ra = scalar_mul(ra, v);
             }
         }
 
@@ -4238,7 +4288,7 @@ public class LongVector512Tests extends AbstractVectorTest {
     static long MINReduce(long[] a, int idx) {
         long res = MIN_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res = (long) Math.min(res, a[i]);
+            res = scalar_min(res, a[i]);
         }
 
         return res;
@@ -4247,7 +4297,7 @@ public class LongVector512Tests extends AbstractVectorTest {
     static long MINReduceAll(long[] a) {
         long res = MIN_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (long) Math.min(res, MINReduce(a, i));
+            res = scalar_min(res, MINReduce(a, i));
         }
 
         return res;
@@ -4265,7 +4315,7 @@ public class LongVector512Tests extends AbstractVectorTest {
                 LongVector av = LongVector.fromArray(SPECIES, a, i);
                 long v = av.reduceLanes(VectorOperators.MIN);
                 r[i] = v;
-                ra = (long) Math.min(ra, v);
+                ra = scalar_min(ra, v);
             }
         }
 
@@ -4278,20 +4328,20 @@ public class LongVector512Tests extends AbstractVectorTest {
         long[] a = fa.apply(SPECIES.length());
         long id = MIN_IDENTITY;
 
-        assertEquals((long) Math.min(id, id), id,
+        assertEquals(scalar_min(id, id), id,
                             "MIN(MIN_IDENTITY, MIN_IDENTITY) != MIN_IDENTITY");
 
         long x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((long) Math.min(id, x), x);
-                assertEquals((long) Math.min(x, id), x);
+                assertEquals(scalar_min(id, x), x);
+                assertEquals(scalar_min(x, id), x);
             }
         } catch (AssertionError e) {
-            assertEquals((long) Math.min(id, x), x,
+            assertEquals(scalar_min(id, x), x,
                                 "MIN(MIN_IDENTITY, " + x + ") != " + x);
-            assertEquals((long) Math.min(x, id), x,
+            assertEquals(scalar_min(x, id), x,
                                 "MIN(" + x + ", MIN_IDENTITY) != " + x);
         }
     }
@@ -4300,7 +4350,7 @@ public class LongVector512Tests extends AbstractVectorTest {
         long res = MIN_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res = (long) Math.min(res, a[i]);
+                res = scalar_min(res, a[i]);
         }
 
         return res;
@@ -4309,7 +4359,7 @@ public class LongVector512Tests extends AbstractVectorTest {
     static long MINReduceAllMasked(long[] a, boolean[] mask) {
         long res = MIN_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (long) Math.min(res, MINReduceMasked(a, i, mask));
+            res = scalar_min(res, MINReduceMasked(a, i, mask));
         }
 
         return res;
@@ -4329,7 +4379,7 @@ public class LongVector512Tests extends AbstractVectorTest {
                 LongVector av = LongVector.fromArray(SPECIES, a, i);
                 long v = av.reduceLanes(VectorOperators.MIN, vmask);
                 r[i] = v;
-                ra = (long) Math.min(ra, v);
+                ra = scalar_min(ra, v);
             }
         }
 
@@ -4340,7 +4390,7 @@ public class LongVector512Tests extends AbstractVectorTest {
     static long MAXReduce(long[] a, int idx) {
         long res = MAX_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res = (long) Math.max(res, a[i]);
+            res = scalar_max(res, a[i]);
         }
 
         return res;
@@ -4349,7 +4399,7 @@ public class LongVector512Tests extends AbstractVectorTest {
     static long MAXReduceAll(long[] a) {
         long res = MAX_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (long) Math.max(res, MAXReduce(a, i));
+            res = scalar_max(res, MAXReduce(a, i));
         }
 
         return res;
@@ -4367,7 +4417,7 @@ public class LongVector512Tests extends AbstractVectorTest {
                 LongVector av = LongVector.fromArray(SPECIES, a, i);
                 long v = av.reduceLanes(VectorOperators.MAX);
                 r[i] = v;
-                ra = (long) Math.max(ra, v);
+                ra = scalar_max(ra, v);
             }
         }
 
@@ -4380,20 +4430,20 @@ public class LongVector512Tests extends AbstractVectorTest {
         long[] a = fa.apply(SPECIES.length());
         long id = MAX_IDENTITY;
 
-        assertEquals((long) Math.max(id, id), id,
+        assertEquals(scalar_max(id, id), id,
                             "MAX(MAX_IDENTITY, MAX_IDENTITY) != MAX_IDENTITY");
 
         long x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((long) Math.max(id, x), x);
-                assertEquals((long) Math.max(x, id), x);
+                assertEquals(scalar_max(id, x), x);
+                assertEquals(scalar_max(x, id), x);
             }
         } catch (AssertionError e) {
-            assertEquals((long) Math.max(id, x), x,
+            assertEquals(scalar_max(id, x), x,
                                 "MAX(MAX_IDENTITY, " + x + ") != " + x);
-            assertEquals((long) Math.max(x, id), x,
+            assertEquals(scalar_max(x, id), x,
                                 "MAX(" + x + ", MAX_IDENTITY) != " + x);
         }
     }
@@ -4402,7 +4452,7 @@ public class LongVector512Tests extends AbstractVectorTest {
         long res = MAX_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res = (long) Math.max(res, a[i]);
+                res = scalar_max(res, a[i]);
         }
 
         return res;
@@ -4411,7 +4461,7 @@ public class LongVector512Tests extends AbstractVectorTest {
     static long MAXReduceAllMasked(long[] a, boolean[] mask) {
         long res = MAX_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (long) Math.max(res, MAXReduceMasked(a, i, mask));
+            res = scalar_max(res, MAXReduceMasked(a, i, mask));
         }
 
         return res;
@@ -4431,7 +4481,7 @@ public class LongVector512Tests extends AbstractVectorTest {
                 LongVector av = LongVector.fromArray(SPECIES, a, i);
                 long v = av.reduceLanes(VectorOperators.MAX, vmask);
                 r[i] = v;
-                ra = (long) Math.max(ra, v);
+                ra = scalar_max(ra, v);
             }
         }
 
@@ -5464,7 +5514,7 @@ public class LongVector512Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] < b[i]);
+                assertEquals(mv.laneIsSet(j), lt(a[i + j], b[i]));
             }
         }
     }
@@ -5484,7 +5534,7 @@ public class LongVector512Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] < b[i]));
+                assertEquals(mv.laneIsSet(j), mask[j] && (lt(a[i + j], b[i])));
             }
         }
     }
@@ -5501,7 +5551,7 @@ public class LongVector512Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] == b[i]);
+                assertEquals(mv.laneIsSet(j), eq(a[i + j], b[i]));
             }
         }
     }
@@ -5521,7 +5571,7 @@ public class LongVector512Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] == b[i]));
+                assertEquals(mv.laneIsSet(j), mask[j] && (eq(a[i + j], b[i])));
             }
         }
     }
@@ -6234,11 +6284,11 @@ public class LongVector512Tests extends AbstractVectorTest {
     }
 
     static long NEG(long a) {
-        return (long)(-((long)a));
+        return (long)(scalar_neg((long)a));
     }
 
     static long neg(long a) {
-        return (long)(-((long)a));
+        return (long)(scalar_neg((long)a));
     }
 
     @Test(dataProvider = "longUnaryOpProvider")
@@ -6290,11 +6340,11 @@ public class LongVector512Tests extends AbstractVectorTest {
     }
 
     static long ABS(long a) {
-        return (long)(Math.abs((long)a));
+        return (long)(scalar_abs((long)a));
     }
 
     static long abs(long a) {
-        return (long)(Math.abs((long)a));
+        return (long)(scalar_abs((long)a));
     }
 
     @Test(dataProvider = "longUnaryOpProvider")
@@ -6785,7 +6835,7 @@ public class LongVector512Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] < b[i]);
+                assertEquals(mv.laneIsSet(j), lt(a[i + j], b[i]));
             }
         }
     }
@@ -6801,7 +6851,7 @@ public class LongVector512Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] == b[i]);
+                assertEquals(mv.laneIsSet(j), eq(a[i + j], b[i]));
             }
         }
     }
diff --git a/test/jdk/jdk/incubator/vector/LongVector64Tests.java b/test/jdk/jdk/incubator/vector/LongVector64Tests.java
index 6ca3c63054a..d4cdfe54ad2 100644
--- a/test/jdk/jdk/incubator/vector/LongVector64Tests.java
+++ b/test/jdk/jdk/incubator/vector/LongVector64Tests.java
@@ -1547,6 +1547,59 @@ public class LongVector64Tests extends AbstractVectorTest {
         return a >= b;
     }
 
+    static long firstNonZero(long a, long b) {
+        return Long.compare(a, (long) 0) != 0 ? a : b;
+    }
+
+    static long scalar_or(long a, long b) {
+        return (long)(a | b);
+    }
+
+    static long scalar_and(long a, long b) {
+        return (long)(a & b);
+    }
+
+    static long scalar_xor(long a, long b) {
+        return (long)(a ^ b);
+    }
+
+    static long scalar_add(long a, long b) {
+        return (long)(a + b);
+    }
+
+    static long scalar_sub(long a, long b) {
+        return (long)(a - b);
+    }
+
+    static long scalar_mul(long a, long b) {
+        return (long)(a * b);
+    }
+
+    static long scalar_min(long a, long b) {
+        return (long)(Math.min(a, b));
+    }
+
+    static long scalar_max(long a, long b) {
+        return (long)(Math.max(a, b));
+    }
+
+    static long scalar_div(long a, long b) {
+        return (long)(a / b);
+    }
+
+    static long scalar_fma(long a, long b, long c) {
+        return (long)(Math.fma(a, b, c));
+    }
+
+    static long scalar_abs(long a) {
+        return (long)(Math.abs(a));
+    }
+
+    static long scalar_neg(long a) {
+        return ((long)-a);
+    }
+
+
     static boolean ult(long a, long b) {
         return Long.compareUnsigned(a, b) < 0;
     }
@@ -1563,9 +1616,6 @@ public class LongVector64Tests extends AbstractVectorTest {
         return Long.compareUnsigned(a, b) >= 0;
     }
 
-    static long firstNonZero(long a, long b) {
-        return Long.compare(a, (long) 0) != 0 ? a : b;
-    }
 
     @Test
     static void smokeTest1() {
@@ -1679,7 +1729,7 @@ public class LongVector64Tests extends AbstractVectorTest {
     }
 
     static long ADD(long a, long b) {
-        return (long)(a + b);
+        return (long)(scalar_add(a, b));
     }
 
     @Test(dataProvider = "longBinaryOpProvider")
@@ -1700,7 +1750,7 @@ public class LongVector64Tests extends AbstractVectorTest {
     }
 
     static long add(long a, long b) {
-        return (long)(a + b);
+        return (long)(scalar_add(a, b));
     }
 
     @Test(dataProvider = "longBinaryOpProvider")
@@ -1757,7 +1807,7 @@ public class LongVector64Tests extends AbstractVectorTest {
     }
 
     static long SUB(long a, long b) {
-        return (long)(a - b);
+        return (long)(scalar_sub(a, b));
     }
 
     @Test(dataProvider = "longBinaryOpProvider")
@@ -1778,7 +1828,7 @@ public class LongVector64Tests extends AbstractVectorTest {
     }
 
     static long sub(long a, long b) {
-        return (long)(a - b);
+        return (long)(scalar_sub(a, b));
     }
 
     @Test(dataProvider = "longBinaryOpProvider")
@@ -1835,7 +1885,7 @@ public class LongVector64Tests extends AbstractVectorTest {
     }
 
     static long MUL(long a, long b) {
-        return (long)(a * b);
+        return (long)(scalar_mul(a, b));
     }
 
     @Test(dataProvider = "longBinaryOpProvider")
@@ -1856,7 +1906,7 @@ public class LongVector64Tests extends AbstractVectorTest {
     }
 
     static long mul(long a, long b) {
-        return (long)(a * b);
+        return (long)(scalar_mul(a, b));
     }
 
     @Test(dataProvider = "longBinaryOpProvider")
@@ -2003,7 +2053,7 @@ public class LongVector64Tests extends AbstractVectorTest {
     }
 
     static long FIRST_NONZERO(long a, long b) {
-        return (long)((a)!=0?a:b);
+        return (long)(firstNonZero(a, b));
     }
 
     @Test(dataProvider = "longBinaryOpProvider")
@@ -3299,7 +3349,7 @@ public class LongVector64Tests extends AbstractVectorTest {
     }
 
     static long MIN(long a, long b) {
-        return (long)(Math.min(a, b));
+        return (long)(scalar_min(a, b));
     }
 
     @Test(dataProvider = "longBinaryOpProvider")
@@ -3320,7 +3370,7 @@ public class LongVector64Tests extends AbstractVectorTest {
     }
 
     static long min(long a, long b) {
-        return (long)(Math.min(a, b));
+        return (long)(scalar_min(a, b));
     }
 
     @Test(dataProvider = "longBinaryOpProvider")
@@ -3339,7 +3389,7 @@ public class LongVector64Tests extends AbstractVectorTest {
     }
 
     static long MAX(long a, long b) {
-        return (long)(Math.max(a, b));
+        return (long)(scalar_max(a, b));
     }
 
     @Test(dataProvider = "longBinaryOpProvider")
@@ -3360,7 +3410,7 @@ public class LongVector64Tests extends AbstractVectorTest {
     }
 
     static long max(long a, long b) {
-        return (long)(Math.max(a, b));
+        return (long)(scalar_max(a, b));
     }
 
     @Test(dataProvider = "longBinaryOpProvider")
@@ -3728,7 +3778,7 @@ public class LongVector64Tests extends AbstractVectorTest {
     static long ANDReduce(long[] a, int idx) {
         long res = AND_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res &= a[i];
+            res = scalar_and(res, a[i]);
         }
 
         return res;
@@ -3737,7 +3787,7 @@ public class LongVector64Tests extends AbstractVectorTest {
     static long ANDReduceAll(long[] a) {
         long res = AND_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res &= ANDReduce(a, i);
+            res = scalar_and(res, ANDReduce(a, i));
         }
 
         return res;
@@ -3755,7 +3805,7 @@ public class LongVector64Tests extends AbstractVectorTest {
                 LongVector av = LongVector.fromArray(SPECIES, a, i);
                 long v = av.reduceLanes(VectorOperators.AND);
                 r[i] = v;
-                ra &= v;
+                ra = scalar_and(ra, v);
             }
         }
 
@@ -3768,20 +3818,20 @@ public class LongVector64Tests extends AbstractVectorTest {
         long[] a = fa.apply(SPECIES.length());
         long id = AND_IDENTITY;
 
-        assertEquals((long) (id & id), id,
+        assertEquals((long) (scalar_and(id, id)), id,
                             "AND(AND_IDENTITY, AND_IDENTITY) != AND_IDENTITY");
 
         long x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((long) (id & x), x);
-                assertEquals((long) (x & id), x);
+                assertEquals((long) (scalar_and(id, x)), x);
+                assertEquals((long) (scalar_and(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((long) (id & x), x,
+            assertEquals((long) (scalar_and(id, x)), x,
                                 "AND(AND_IDENTITY, " + x + ") != " + x);
-            assertEquals((long) (x & id), x,
+            assertEquals((long) (scalar_and(x, id)), x,
                                 "AND(" + x + ", AND_IDENTITY) != " + x);
         }
     }
@@ -3790,7 +3840,7 @@ public class LongVector64Tests extends AbstractVectorTest {
         long res = AND_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res &= a[i];
+                res = scalar_and(res, a[i]);
         }
 
         return res;
@@ -3799,7 +3849,7 @@ public class LongVector64Tests extends AbstractVectorTest {
     static long ANDReduceAllMasked(long[] a, boolean[] mask) {
         long res = AND_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res &= ANDReduceMasked(a, i, mask);
+            res = scalar_and(res, ANDReduceMasked(a, i, mask));
         }
 
         return res;
@@ -3819,7 +3869,7 @@ public class LongVector64Tests extends AbstractVectorTest {
                 LongVector av = LongVector.fromArray(SPECIES, a, i);
                 long v = av.reduceLanes(VectorOperators.AND, vmask);
                 r[i] = v;
-                ra &= v;
+                ra = scalar_and(ra, v);
             }
         }
 
@@ -3830,7 +3880,7 @@ public class LongVector64Tests extends AbstractVectorTest {
     static long ORReduce(long[] a, int idx) {
         long res = OR_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res |= a[i];
+            res = scalar_or(res, a[i]);
         }
 
         return res;
@@ -3839,7 +3889,7 @@ public class LongVector64Tests extends AbstractVectorTest {
     static long ORReduceAll(long[] a) {
         long res = OR_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res |= ORReduce(a, i);
+            res = scalar_or(res, ORReduce(a, i));
         }
 
         return res;
@@ -3857,7 +3907,7 @@ public class LongVector64Tests extends AbstractVectorTest {
                 LongVector av = LongVector.fromArray(SPECIES, a, i);
                 long v = av.reduceLanes(VectorOperators.OR);
                 r[i] = v;
-                ra |= v;
+                ra = scalar_or(ra, v);
             }
         }
 
@@ -3870,20 +3920,20 @@ public class LongVector64Tests extends AbstractVectorTest {
         long[] a = fa.apply(SPECIES.length());
         long id = OR_IDENTITY;
 
-        assertEquals((long) (id | id), id,
+        assertEquals((long) (scalar_or(id, id)), id,
                             "OR(OR_IDENTITY, OR_IDENTITY) != OR_IDENTITY");
 
         long x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((long) (id | x), x);
-                assertEquals((long) (x | id), x);
+                assertEquals((long) (scalar_or(id, x)), x);
+                assertEquals((long) (scalar_or(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((long) (id | x), x,
+            assertEquals((long) (scalar_or(id, x)), x,
                                 "OR(OR_IDENTITY, " + x + ") != " + x);
-            assertEquals((long) (x | id), x,
+            assertEquals((long) (scalar_or(x, id)), x,
                                 "OR(" + x + ", OR_IDENTITY) != " + x);
         }
     }
@@ -3892,7 +3942,7 @@ public class LongVector64Tests extends AbstractVectorTest {
         long res = OR_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res |= a[i];
+                res = scalar_or(res, a[i]);
         }
 
         return res;
@@ -3901,7 +3951,7 @@ public class LongVector64Tests extends AbstractVectorTest {
     static long ORReduceAllMasked(long[] a, boolean[] mask) {
         long res = OR_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res |= ORReduceMasked(a, i, mask);
+            res = scalar_or(res, ORReduceMasked(a, i, mask));
         }
 
         return res;
@@ -3921,7 +3971,7 @@ public class LongVector64Tests extends AbstractVectorTest {
                 LongVector av = LongVector.fromArray(SPECIES, a, i);
                 long v = av.reduceLanes(VectorOperators.OR, vmask);
                 r[i] = v;
-                ra |= v;
+                ra = scalar_or(ra, v);
             }
         }
 
@@ -3932,7 +3982,7 @@ public class LongVector64Tests extends AbstractVectorTest {
     static long XORReduce(long[] a, int idx) {
         long res = XOR_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res ^= a[i];
+            res = scalar_xor(res, a[i]);
         }
 
         return res;
@@ -3941,7 +3991,7 @@ public class LongVector64Tests extends AbstractVectorTest {
     static long XORReduceAll(long[] a) {
         long res = XOR_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res ^= XORReduce(a, i);
+            res = scalar_xor(res, XORReduce(a, i));
         }
 
         return res;
@@ -3959,7 +4009,7 @@ public class LongVector64Tests extends AbstractVectorTest {
                 LongVector av = LongVector.fromArray(SPECIES, a, i);
                 long v = av.reduceLanes(VectorOperators.XOR);
                 r[i] = v;
-                ra ^= v;
+                ra = scalar_xor(ra, v);
             }
         }
 
@@ -3972,20 +4022,20 @@ public class LongVector64Tests extends AbstractVectorTest {
         long[] a = fa.apply(SPECIES.length());
         long id = XOR_IDENTITY;
 
-        assertEquals((long) (id ^ id), id,
+        assertEquals((long) (scalar_xor(id, id)), id,
                             "XOR(XOR_IDENTITY, XOR_IDENTITY) != XOR_IDENTITY");
 
         long x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((long) (id ^ x), x);
-                assertEquals((long) (x ^ id), x);
+                assertEquals((long) (scalar_xor(id, x)), x);
+                assertEquals((long) (scalar_xor(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((long) (id ^ x), x,
+            assertEquals((long) (scalar_xor(id, x)), x,
                                 "XOR(XOR_IDENTITY, " + x + ") != " + x);
-            assertEquals((long) (x ^ id), x,
+            assertEquals((long) (scalar_xor(x, id)), x,
                                 "XOR(" + x + ", XOR_IDENTITY) != " + x);
         }
     }
@@ -3994,7 +4044,7 @@ public class LongVector64Tests extends AbstractVectorTest {
         long res = XOR_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res ^= a[i];
+                res = scalar_xor(res, a[i]);
         }
 
         return res;
@@ -4003,7 +4053,7 @@ public class LongVector64Tests extends AbstractVectorTest {
     static long XORReduceAllMasked(long[] a, boolean[] mask) {
         long res = XOR_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res ^= XORReduceMasked(a, i, mask);
+            res = scalar_xor(res, XORReduceMasked(a, i, mask));
         }
 
         return res;
@@ -4023,7 +4073,7 @@ public class LongVector64Tests extends AbstractVectorTest {
                 LongVector av = LongVector.fromArray(SPECIES, a, i);
                 long v = av.reduceLanes(VectorOperators.XOR, vmask);
                 r[i] = v;
-                ra ^= v;
+                ra = scalar_xor(ra, v);
             }
         }
 
@@ -4034,7 +4084,7 @@ public class LongVector64Tests extends AbstractVectorTest {
     static long ADDReduce(long[] a, int idx) {
         long res = ADD_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res += a[i];
+            res = scalar_add(res, a[i]);
         }
 
         return res;
@@ -4043,7 +4093,7 @@ public class LongVector64Tests extends AbstractVectorTest {
     static long ADDReduceAll(long[] a) {
         long res = ADD_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduce(a, i);
+            res = scalar_add(res, ADDReduce(a, i));
         }
 
         return res;
@@ -4061,7 +4111,7 @@ public class LongVector64Tests extends AbstractVectorTest {
                 LongVector av = LongVector.fromArray(SPECIES, a, i);
                 long v = av.reduceLanes(VectorOperators.ADD);
                 r[i] = v;
-                ra += v;
+                ra = scalar_add(ra, v);
             }
         }
 
@@ -4074,20 +4124,20 @@ public class LongVector64Tests extends AbstractVectorTest {
         long[] a = fa.apply(SPECIES.length());
         long id = ADD_IDENTITY;
 
-        assertEquals((long) (id + id), id,
+        assertEquals((long) (scalar_add(id, id)), id,
                             "ADD(ADD_IDENTITY, ADD_IDENTITY) != ADD_IDENTITY");
 
         long x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((long) (id + x), x);
-                assertEquals((long) (x + id), x);
+                assertEquals((long) (scalar_add(id, x)), x);
+                assertEquals((long) (scalar_add(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((long) (id + x), x,
+            assertEquals((long) (scalar_add(id, x)), x,
                                 "ADD(ADD_IDENTITY, " + x + ") != " + x);
-            assertEquals((long) (x + id), x,
+            assertEquals((long) (scalar_add(x, id)), x,
                                 "ADD(" + x + ", ADD_IDENTITY) != " + x);
         }
     }
@@ -4096,7 +4146,7 @@ public class LongVector64Tests extends AbstractVectorTest {
         long res = ADD_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res += a[i];
+                res = scalar_add(res, a[i]);
         }
 
         return res;
@@ -4105,7 +4155,7 @@ public class LongVector64Tests extends AbstractVectorTest {
     static long ADDReduceAllMasked(long[] a, boolean[] mask) {
         long res = ADD_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduceMasked(a, i, mask);
+            res = scalar_add(res, ADDReduceMasked(a, i, mask));
         }
 
         return res;
@@ -4125,7 +4175,7 @@ public class LongVector64Tests extends AbstractVectorTest {
                 LongVector av = LongVector.fromArray(SPECIES, a, i);
                 long v = av.reduceLanes(VectorOperators.ADD, vmask);
                 r[i] = v;
-                ra += v;
+                ra = scalar_add(ra, v);
             }
         }
 
@@ -4136,7 +4186,7 @@ public class LongVector64Tests extends AbstractVectorTest {
     static long MULReduce(long[] a, int idx) {
         long res = MUL_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res *= a[i];
+            res = scalar_mul(res, a[i]);
         }
 
         return res;
@@ -4145,7 +4195,7 @@ public class LongVector64Tests extends AbstractVectorTest {
     static long MULReduceAll(long[] a) {
         long res = MUL_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res *= MULReduce(a, i);
+            res = scalar_mul(res, MULReduce(a, i));
         }
 
         return res;
@@ -4163,7 +4213,7 @@ public class LongVector64Tests extends AbstractVectorTest {
                 LongVector av = LongVector.fromArray(SPECIES, a, i);
                 long v = av.reduceLanes(VectorOperators.MUL);
                 r[i] = v;
-                ra *= v;
+                ra = scalar_mul(ra, v);
             }
         }
 
@@ -4176,20 +4226,20 @@ public class LongVector64Tests extends AbstractVectorTest {
         long[] a = fa.apply(SPECIES.length());
         long id = MUL_IDENTITY;
 
-        assertEquals((long) (id * id), id,
+        assertEquals((long) (scalar_mul(id, id)), id,
                             "MUL(MUL_IDENTITY, MUL_IDENTITY) != MUL_IDENTITY");
 
         long x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((long) (id * x), x);
-                assertEquals((long) (x * id), x);
+                assertEquals((long) (scalar_mul(id, x)), x);
+                assertEquals((long) (scalar_mul(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((long) (id * x), x,
+            assertEquals((long) (scalar_mul(id, x)), x,
                                 "MUL(MUL_IDENTITY, " + x + ") != " + x);
-            assertEquals((long) (x * id), x,
+            assertEquals((long) (scalar_mul(x, id)), x,
                                 "MUL(" + x + ", MUL_IDENTITY) != " + x);
         }
     }
@@ -4198,7 +4248,7 @@ public class LongVector64Tests extends AbstractVectorTest {
         long res = MUL_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res *= a[i];
+                res = scalar_mul(res, a[i]);
         }
 
         return res;
@@ -4207,7 +4257,7 @@ public class LongVector64Tests extends AbstractVectorTest {
     static long MULReduceAllMasked(long[] a, boolean[] mask) {
         long res = MUL_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res *= MULReduceMasked(a, i, mask);
+            res = scalar_mul(res, MULReduceMasked(a, i, mask));
         }
 
         return res;
@@ -4227,7 +4277,7 @@ public class LongVector64Tests extends AbstractVectorTest {
                 LongVector av = LongVector.fromArray(SPECIES, a, i);
                 long v = av.reduceLanes(VectorOperators.MUL, vmask);
                 r[i] = v;
-                ra *= v;
+                ra = scalar_mul(ra, v);
             }
         }
 
@@ -4238,7 +4288,7 @@ public class LongVector64Tests extends AbstractVectorTest {
     static long MINReduce(long[] a, int idx) {
         long res = MIN_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res = (long) Math.min(res, a[i]);
+            res = scalar_min(res, a[i]);
         }
 
         return res;
@@ -4247,7 +4297,7 @@ public class LongVector64Tests extends AbstractVectorTest {
     static long MINReduceAll(long[] a) {
         long res = MIN_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (long) Math.min(res, MINReduce(a, i));
+            res = scalar_min(res, MINReduce(a, i));
         }
 
         return res;
@@ -4265,7 +4315,7 @@ public class LongVector64Tests extends AbstractVectorTest {
                 LongVector av = LongVector.fromArray(SPECIES, a, i);
                 long v = av.reduceLanes(VectorOperators.MIN);
                 r[i] = v;
-                ra = (long) Math.min(ra, v);
+                ra = scalar_min(ra, v);
             }
         }
 
@@ -4278,20 +4328,20 @@ public class LongVector64Tests extends AbstractVectorTest {
         long[] a = fa.apply(SPECIES.length());
         long id = MIN_IDENTITY;
 
-        assertEquals((long) Math.min(id, id), id,
+        assertEquals(scalar_min(id, id), id,
                             "MIN(MIN_IDENTITY, MIN_IDENTITY) != MIN_IDENTITY");
 
         long x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((long) Math.min(id, x), x);
-                assertEquals((long) Math.min(x, id), x);
+                assertEquals(scalar_min(id, x), x);
+                assertEquals(scalar_min(x, id), x);
             }
         } catch (AssertionError e) {
-            assertEquals((long) Math.min(id, x), x,
+            assertEquals(scalar_min(id, x), x,
                                 "MIN(MIN_IDENTITY, " + x + ") != " + x);
-            assertEquals((long) Math.min(x, id), x,
+            assertEquals(scalar_min(x, id), x,
                                 "MIN(" + x + ", MIN_IDENTITY) != " + x);
         }
     }
@@ -4300,7 +4350,7 @@ public class LongVector64Tests extends AbstractVectorTest {
         long res = MIN_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res = (long) Math.min(res, a[i]);
+                res = scalar_min(res, a[i]);
         }
 
         return res;
@@ -4309,7 +4359,7 @@ public class LongVector64Tests extends AbstractVectorTest {
     static long MINReduceAllMasked(long[] a, boolean[] mask) {
         long res = MIN_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (long) Math.min(res, MINReduceMasked(a, i, mask));
+            res = scalar_min(res, MINReduceMasked(a, i, mask));
         }
 
         return res;
@@ -4329,7 +4379,7 @@ public class LongVector64Tests extends AbstractVectorTest {
                 LongVector av = LongVector.fromArray(SPECIES, a, i);
                 long v = av.reduceLanes(VectorOperators.MIN, vmask);
                 r[i] = v;
-                ra = (long) Math.min(ra, v);
+                ra = scalar_min(ra, v);
             }
         }
 
@@ -4340,7 +4390,7 @@ public class LongVector64Tests extends AbstractVectorTest {
     static long MAXReduce(long[] a, int idx) {
         long res = MAX_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res = (long) Math.max(res, a[i]);
+            res = scalar_max(res, a[i]);
         }
 
         return res;
@@ -4349,7 +4399,7 @@ public class LongVector64Tests extends AbstractVectorTest {
     static long MAXReduceAll(long[] a) {
         long res = MAX_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (long) Math.max(res, MAXReduce(a, i));
+            res = scalar_max(res, MAXReduce(a, i));
         }
 
         return res;
@@ -4367,7 +4417,7 @@ public class LongVector64Tests extends AbstractVectorTest {
                 LongVector av = LongVector.fromArray(SPECIES, a, i);
                 long v = av.reduceLanes(VectorOperators.MAX);
                 r[i] = v;
-                ra = (long) Math.max(ra, v);
+                ra = scalar_max(ra, v);
             }
         }
 
@@ -4380,20 +4430,20 @@ public class LongVector64Tests extends AbstractVectorTest {
         long[] a = fa.apply(SPECIES.length());
         long id = MAX_IDENTITY;
 
-        assertEquals((long) Math.max(id, id), id,
+        assertEquals(scalar_max(id, id), id,
                             "MAX(MAX_IDENTITY, MAX_IDENTITY) != MAX_IDENTITY");
 
         long x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((long) Math.max(id, x), x);
-                assertEquals((long) Math.max(x, id), x);
+                assertEquals(scalar_max(id, x), x);
+                assertEquals(scalar_max(x, id), x);
             }
         } catch (AssertionError e) {
-            assertEquals((long) Math.max(id, x), x,
+            assertEquals(scalar_max(id, x), x,
                                 "MAX(MAX_IDENTITY, " + x + ") != " + x);
-            assertEquals((long) Math.max(x, id), x,
+            assertEquals(scalar_max(x, id), x,
                                 "MAX(" + x + ", MAX_IDENTITY) != " + x);
         }
     }
@@ -4402,7 +4452,7 @@ public class LongVector64Tests extends AbstractVectorTest {
         long res = MAX_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res = (long) Math.max(res, a[i]);
+                res = scalar_max(res, a[i]);
         }
 
         return res;
@@ -4411,7 +4461,7 @@ public class LongVector64Tests extends AbstractVectorTest {
     static long MAXReduceAllMasked(long[] a, boolean[] mask) {
         long res = MAX_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (long) Math.max(res, MAXReduceMasked(a, i, mask));
+            res = scalar_max(res, MAXReduceMasked(a, i, mask));
         }
 
         return res;
@@ -4431,7 +4481,7 @@ public class LongVector64Tests extends AbstractVectorTest {
                 LongVector av = LongVector.fromArray(SPECIES, a, i);
                 long v = av.reduceLanes(VectorOperators.MAX, vmask);
                 r[i] = v;
-                ra = (long) Math.max(ra, v);
+                ra = scalar_max(ra, v);
             }
         }
 
@@ -5464,7 +5514,7 @@ public class LongVector64Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] < b[i]);
+                assertEquals(mv.laneIsSet(j), lt(a[i + j], b[i]));
             }
         }
     }
@@ -5484,7 +5534,7 @@ public class LongVector64Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] < b[i]));
+                assertEquals(mv.laneIsSet(j), mask[j] && (lt(a[i + j], b[i])));
             }
         }
     }
@@ -5501,7 +5551,7 @@ public class LongVector64Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] == b[i]);
+                assertEquals(mv.laneIsSet(j), eq(a[i + j], b[i]));
             }
         }
     }
@@ -5521,7 +5571,7 @@ public class LongVector64Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] == b[i]));
+                assertEquals(mv.laneIsSet(j), mask[j] && (eq(a[i + j], b[i])));
             }
         }
     }
@@ -6234,11 +6284,11 @@ public class LongVector64Tests extends AbstractVectorTest {
     }
 
     static long NEG(long a) {
-        return (long)(-((long)a));
+        return (long)(scalar_neg((long)a));
     }
 
     static long neg(long a) {
-        return (long)(-((long)a));
+        return (long)(scalar_neg((long)a));
     }
 
     @Test(dataProvider = "longUnaryOpProvider")
@@ -6290,11 +6340,11 @@ public class LongVector64Tests extends AbstractVectorTest {
     }
 
     static long ABS(long a) {
-        return (long)(Math.abs((long)a));
+        return (long)(scalar_abs((long)a));
     }
 
     static long abs(long a) {
-        return (long)(Math.abs((long)a));
+        return (long)(scalar_abs((long)a));
     }
 
     @Test(dataProvider = "longUnaryOpProvider")
@@ -6785,7 +6835,7 @@ public class LongVector64Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] < b[i]);
+                assertEquals(mv.laneIsSet(j), lt(a[i + j], b[i]));
             }
         }
     }
@@ -6801,7 +6851,7 @@ public class LongVector64Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] == b[i]);
+                assertEquals(mv.laneIsSet(j), eq(a[i + j], b[i]));
             }
         }
     }
diff --git a/test/jdk/jdk/incubator/vector/LongVectorMaxTests.java b/test/jdk/jdk/incubator/vector/LongVectorMaxTests.java
index aef89af5893..597169b00f5 100644
--- a/test/jdk/jdk/incubator/vector/LongVectorMaxTests.java
+++ b/test/jdk/jdk/incubator/vector/LongVectorMaxTests.java
@@ -1553,6 +1553,59 @@ public class LongVectorMaxTests extends AbstractVectorTest {
         return a >= b;
     }
 
+    static long firstNonZero(long a, long b) {
+        return Long.compare(a, (long) 0) != 0 ? a : b;
+    }
+
+    static long scalar_or(long a, long b) {
+        return (long)(a | b);
+    }
+
+    static long scalar_and(long a, long b) {
+        return (long)(a & b);
+    }
+
+    static long scalar_xor(long a, long b) {
+        return (long)(a ^ b);
+    }
+
+    static long scalar_add(long a, long b) {
+        return (long)(a + b);
+    }
+
+    static long scalar_sub(long a, long b) {
+        return (long)(a - b);
+    }
+
+    static long scalar_mul(long a, long b) {
+        return (long)(a * b);
+    }
+
+    static long scalar_min(long a, long b) {
+        return (long)(Math.min(a, b));
+    }
+
+    static long scalar_max(long a, long b) {
+        return (long)(Math.max(a, b));
+    }
+
+    static long scalar_div(long a, long b) {
+        return (long)(a / b);
+    }
+
+    static long scalar_fma(long a, long b, long c) {
+        return (long)(Math.fma(a, b, c));
+    }
+
+    static long scalar_abs(long a) {
+        return (long)(Math.abs(a));
+    }
+
+    static long scalar_neg(long a) {
+        return ((long)-a);
+    }
+
+
     static boolean ult(long a, long b) {
         return Long.compareUnsigned(a, b) < 0;
     }
@@ -1569,9 +1622,6 @@ public class LongVectorMaxTests extends AbstractVectorTest {
         return Long.compareUnsigned(a, b) >= 0;
     }
 
-    static long firstNonZero(long a, long b) {
-        return Long.compare(a, (long) 0) != 0 ? a : b;
-    }
 
     @Test
     static void smokeTest1() {
@@ -1685,7 +1735,7 @@ public class LongVectorMaxTests extends AbstractVectorTest {
     }
 
     static long ADD(long a, long b) {
-        return (long)(a + b);
+        return (long)(scalar_add(a, b));
     }
 
     @Test(dataProvider = "longBinaryOpProvider")
@@ -1706,7 +1756,7 @@ public class LongVectorMaxTests extends AbstractVectorTest {
     }
 
     static long add(long a, long b) {
-        return (long)(a + b);
+        return (long)(scalar_add(a, b));
     }
 
     @Test(dataProvider = "longBinaryOpProvider")
@@ -1763,7 +1813,7 @@ public class LongVectorMaxTests extends AbstractVectorTest {
     }
 
     static long SUB(long a, long b) {
-        return (long)(a - b);
+        return (long)(scalar_sub(a, b));
     }
 
     @Test(dataProvider = "longBinaryOpProvider")
@@ -1784,7 +1834,7 @@ public class LongVectorMaxTests extends AbstractVectorTest {
     }
 
     static long sub(long a, long b) {
-        return (long)(a - b);
+        return (long)(scalar_sub(a, b));
     }
 
     @Test(dataProvider = "longBinaryOpProvider")
@@ -1841,7 +1891,7 @@ public class LongVectorMaxTests extends AbstractVectorTest {
     }
 
     static long MUL(long a, long b) {
-        return (long)(a * b);
+        return (long)(scalar_mul(a, b));
     }
 
     @Test(dataProvider = "longBinaryOpProvider")
@@ -1862,7 +1912,7 @@ public class LongVectorMaxTests extends AbstractVectorTest {
     }
 
     static long mul(long a, long b) {
-        return (long)(a * b);
+        return (long)(scalar_mul(a, b));
     }
 
     @Test(dataProvider = "longBinaryOpProvider")
@@ -2009,7 +2059,7 @@ public class LongVectorMaxTests extends AbstractVectorTest {
     }
 
     static long FIRST_NONZERO(long a, long b) {
-        return (long)((a)!=0?a:b);
+        return (long)(firstNonZero(a, b));
     }
 
     @Test(dataProvider = "longBinaryOpProvider")
@@ -3305,7 +3355,7 @@ public class LongVectorMaxTests extends AbstractVectorTest {
     }
 
     static long MIN(long a, long b) {
-        return (long)(Math.min(a, b));
+        return (long)(scalar_min(a, b));
     }
 
     @Test(dataProvider = "longBinaryOpProvider")
@@ -3326,7 +3376,7 @@ public class LongVectorMaxTests extends AbstractVectorTest {
     }
 
     static long min(long a, long b) {
-        return (long)(Math.min(a, b));
+        return (long)(scalar_min(a, b));
     }
 
     @Test(dataProvider = "longBinaryOpProvider")
@@ -3345,7 +3395,7 @@ public class LongVectorMaxTests extends AbstractVectorTest {
     }
 
     static long MAX(long a, long b) {
-        return (long)(Math.max(a, b));
+        return (long)(scalar_max(a, b));
     }
 
     @Test(dataProvider = "longBinaryOpProvider")
@@ -3366,7 +3416,7 @@ public class LongVectorMaxTests extends AbstractVectorTest {
     }
 
     static long max(long a, long b) {
-        return (long)(Math.max(a, b));
+        return (long)(scalar_max(a, b));
     }
 
     @Test(dataProvider = "longBinaryOpProvider")
@@ -3734,7 +3784,7 @@ public class LongVectorMaxTests extends AbstractVectorTest {
     static long ANDReduce(long[] a, int idx) {
         long res = AND_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res &= a[i];
+            res = scalar_and(res, a[i]);
         }
 
         return res;
@@ -3743,7 +3793,7 @@ public class LongVectorMaxTests extends AbstractVectorTest {
     static long ANDReduceAll(long[] a) {
         long res = AND_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res &= ANDReduce(a, i);
+            res = scalar_and(res, ANDReduce(a, i));
         }
 
         return res;
@@ -3761,7 +3811,7 @@ public class LongVectorMaxTests extends AbstractVectorTest {
                 LongVector av = LongVector.fromArray(SPECIES, a, i);
                 long v = av.reduceLanes(VectorOperators.AND);
                 r[i] = v;
-                ra &= v;
+                ra = scalar_and(ra, v);
             }
         }
 
@@ -3774,20 +3824,20 @@ public class LongVectorMaxTests extends AbstractVectorTest {
         long[] a = fa.apply(SPECIES.length());
         long id = AND_IDENTITY;
 
-        assertEquals((long) (id & id), id,
+        assertEquals((long) (scalar_and(id, id)), id,
                             "AND(AND_IDENTITY, AND_IDENTITY) != AND_IDENTITY");
 
         long x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((long) (id & x), x);
-                assertEquals((long) (x & id), x);
+                assertEquals((long) (scalar_and(id, x)), x);
+                assertEquals((long) (scalar_and(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((long) (id & x), x,
+            assertEquals((long) (scalar_and(id, x)), x,
                                 "AND(AND_IDENTITY, " + x + ") != " + x);
-            assertEquals((long) (x & id), x,
+            assertEquals((long) (scalar_and(x, id)), x,
                                 "AND(" + x + ", AND_IDENTITY) != " + x);
         }
     }
@@ -3796,7 +3846,7 @@ public class LongVectorMaxTests extends AbstractVectorTest {
         long res = AND_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res &= a[i];
+                res = scalar_and(res, a[i]);
         }
 
         return res;
@@ -3805,7 +3855,7 @@ public class LongVectorMaxTests extends AbstractVectorTest {
     static long ANDReduceAllMasked(long[] a, boolean[] mask) {
         long res = AND_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res &= ANDReduceMasked(a, i, mask);
+            res = scalar_and(res, ANDReduceMasked(a, i, mask));
         }
 
         return res;
@@ -3825,7 +3875,7 @@ public class LongVectorMaxTests extends AbstractVectorTest {
                 LongVector av = LongVector.fromArray(SPECIES, a, i);
                 long v = av.reduceLanes(VectorOperators.AND, vmask);
                 r[i] = v;
-                ra &= v;
+                ra = scalar_and(ra, v);
             }
         }
 
@@ -3836,7 +3886,7 @@ public class LongVectorMaxTests extends AbstractVectorTest {
     static long ORReduce(long[] a, int idx) {
         long res = OR_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res |= a[i];
+            res = scalar_or(res, a[i]);
         }
 
         return res;
@@ -3845,7 +3895,7 @@ public class LongVectorMaxTests extends AbstractVectorTest {
     static long ORReduceAll(long[] a) {
         long res = OR_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res |= ORReduce(a, i);
+            res = scalar_or(res, ORReduce(a, i));
         }
 
         return res;
@@ -3863,7 +3913,7 @@ public class LongVectorMaxTests extends AbstractVectorTest {
                 LongVector av = LongVector.fromArray(SPECIES, a, i);
                 long v = av.reduceLanes(VectorOperators.OR);
                 r[i] = v;
-                ra |= v;
+                ra = scalar_or(ra, v);
             }
         }
 
@@ -3876,20 +3926,20 @@ public class LongVectorMaxTests extends AbstractVectorTest {
         long[] a = fa.apply(SPECIES.length());
         long id = OR_IDENTITY;
 
-        assertEquals((long) (id | id), id,
+        assertEquals((long) (scalar_or(id, id)), id,
                             "OR(OR_IDENTITY, OR_IDENTITY) != OR_IDENTITY");
 
         long x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((long) (id | x), x);
-                assertEquals((long) (x | id), x);
+                assertEquals((long) (scalar_or(id, x)), x);
+                assertEquals((long) (scalar_or(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((long) (id | x), x,
+            assertEquals((long) (scalar_or(id, x)), x,
                                 "OR(OR_IDENTITY, " + x + ") != " + x);
-            assertEquals((long) (x | id), x,
+            assertEquals((long) (scalar_or(x, id)), x,
                                 "OR(" + x + ", OR_IDENTITY) != " + x);
         }
     }
@@ -3898,7 +3948,7 @@ public class LongVectorMaxTests extends AbstractVectorTest {
         long res = OR_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res |= a[i];
+                res = scalar_or(res, a[i]);
         }
 
         return res;
@@ -3907,7 +3957,7 @@ public class LongVectorMaxTests extends AbstractVectorTest {
     static long ORReduceAllMasked(long[] a, boolean[] mask) {
         long res = OR_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res |= ORReduceMasked(a, i, mask);
+            res = scalar_or(res, ORReduceMasked(a, i, mask));
         }
 
         return res;
@@ -3927,7 +3977,7 @@ public class LongVectorMaxTests extends AbstractVectorTest {
                 LongVector av = LongVector.fromArray(SPECIES, a, i);
                 long v = av.reduceLanes(VectorOperators.OR, vmask);
                 r[i] = v;
-                ra |= v;
+                ra = scalar_or(ra, v);
             }
         }
 
@@ -3938,7 +3988,7 @@ public class LongVectorMaxTests extends AbstractVectorTest {
     static long XORReduce(long[] a, int idx) {
         long res = XOR_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res ^= a[i];
+            res = scalar_xor(res, a[i]);
         }
 
         return res;
@@ -3947,7 +3997,7 @@ public class LongVectorMaxTests extends AbstractVectorTest {
     static long XORReduceAll(long[] a) {
         long res = XOR_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res ^= XORReduce(a, i);
+            res = scalar_xor(res, XORReduce(a, i));
         }
 
         return res;
@@ -3965,7 +4015,7 @@ public class LongVectorMaxTests extends AbstractVectorTest {
                 LongVector av = LongVector.fromArray(SPECIES, a, i);
                 long v = av.reduceLanes(VectorOperators.XOR);
                 r[i] = v;
-                ra ^= v;
+                ra = scalar_xor(ra, v);
             }
         }
 
@@ -3978,20 +4028,20 @@ public class LongVectorMaxTests extends AbstractVectorTest {
         long[] a = fa.apply(SPECIES.length());
         long id = XOR_IDENTITY;
 
-        assertEquals((long) (id ^ id), id,
+        assertEquals((long) (scalar_xor(id, id)), id,
                             "XOR(XOR_IDENTITY, XOR_IDENTITY) != XOR_IDENTITY");
 
         long x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((long) (id ^ x), x);
-                assertEquals((long) (x ^ id), x);
+                assertEquals((long) (scalar_xor(id, x)), x);
+                assertEquals((long) (scalar_xor(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((long) (id ^ x), x,
+            assertEquals((long) (scalar_xor(id, x)), x,
                                 "XOR(XOR_IDENTITY, " + x + ") != " + x);
-            assertEquals((long) (x ^ id), x,
+            assertEquals((long) (scalar_xor(x, id)), x,
                                 "XOR(" + x + ", XOR_IDENTITY) != " + x);
         }
     }
@@ -4000,7 +4050,7 @@ public class LongVectorMaxTests extends AbstractVectorTest {
         long res = XOR_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res ^= a[i];
+                res = scalar_xor(res, a[i]);
         }
 
         return res;
@@ -4009,7 +4059,7 @@ public class LongVectorMaxTests extends AbstractVectorTest {
     static long XORReduceAllMasked(long[] a, boolean[] mask) {
         long res = XOR_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res ^= XORReduceMasked(a, i, mask);
+            res = scalar_xor(res, XORReduceMasked(a, i, mask));
         }
 
         return res;
@@ -4029,7 +4079,7 @@ public class LongVectorMaxTests extends AbstractVectorTest {
                 LongVector av = LongVector.fromArray(SPECIES, a, i);
                 long v = av.reduceLanes(VectorOperators.XOR, vmask);
                 r[i] = v;
-                ra ^= v;
+                ra = scalar_xor(ra, v);
             }
         }
 
@@ -4040,7 +4090,7 @@ public class LongVectorMaxTests extends AbstractVectorTest {
     static long ADDReduce(long[] a, int idx) {
         long res = ADD_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res += a[i];
+            res = scalar_add(res, a[i]);
         }
 
         return res;
@@ -4049,7 +4099,7 @@ public class LongVectorMaxTests extends AbstractVectorTest {
     static long ADDReduceAll(long[] a) {
         long res = ADD_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduce(a, i);
+            res = scalar_add(res, ADDReduce(a, i));
         }
 
         return res;
@@ -4067,7 +4117,7 @@ public class LongVectorMaxTests extends AbstractVectorTest {
                 LongVector av = LongVector.fromArray(SPECIES, a, i);
                 long v = av.reduceLanes(VectorOperators.ADD);
                 r[i] = v;
-                ra += v;
+                ra = scalar_add(ra, v);
             }
         }
 
@@ -4080,20 +4130,20 @@ public class LongVectorMaxTests extends AbstractVectorTest {
         long[] a = fa.apply(SPECIES.length());
         long id = ADD_IDENTITY;
 
-        assertEquals((long) (id + id), id,
+        assertEquals((long) (scalar_add(id, id)), id,
                             "ADD(ADD_IDENTITY, ADD_IDENTITY) != ADD_IDENTITY");
 
         long x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((long) (id + x), x);
-                assertEquals((long) (x + id), x);
+                assertEquals((long) (scalar_add(id, x)), x);
+                assertEquals((long) (scalar_add(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((long) (id + x), x,
+            assertEquals((long) (scalar_add(id, x)), x,
                                 "ADD(ADD_IDENTITY, " + x + ") != " + x);
-            assertEquals((long) (x + id), x,
+            assertEquals((long) (scalar_add(x, id)), x,
                                 "ADD(" + x + ", ADD_IDENTITY) != " + x);
         }
     }
@@ -4102,7 +4152,7 @@ public class LongVectorMaxTests extends AbstractVectorTest {
         long res = ADD_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res += a[i];
+                res = scalar_add(res, a[i]);
         }
 
         return res;
@@ -4111,7 +4161,7 @@ public class LongVectorMaxTests extends AbstractVectorTest {
     static long ADDReduceAllMasked(long[] a, boolean[] mask) {
         long res = ADD_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduceMasked(a, i, mask);
+            res = scalar_add(res, ADDReduceMasked(a, i, mask));
         }
 
         return res;
@@ -4131,7 +4181,7 @@ public class LongVectorMaxTests extends AbstractVectorTest {
                 LongVector av = LongVector.fromArray(SPECIES, a, i);
                 long v = av.reduceLanes(VectorOperators.ADD, vmask);
                 r[i] = v;
-                ra += v;
+                ra = scalar_add(ra, v);
             }
         }
 
@@ -4142,7 +4192,7 @@ public class LongVectorMaxTests extends AbstractVectorTest {
     static long MULReduce(long[] a, int idx) {
         long res = MUL_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res *= a[i];
+            res = scalar_mul(res, a[i]);
         }
 
         return res;
@@ -4151,7 +4201,7 @@ public class LongVectorMaxTests extends AbstractVectorTest {
     static long MULReduceAll(long[] a) {
         long res = MUL_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res *= MULReduce(a, i);
+            res = scalar_mul(res, MULReduce(a, i));
         }
 
         return res;
@@ -4169,7 +4219,7 @@ public class LongVectorMaxTests extends AbstractVectorTest {
                 LongVector av = LongVector.fromArray(SPECIES, a, i);
                 long v = av.reduceLanes(VectorOperators.MUL);
                 r[i] = v;
-                ra *= v;
+                ra = scalar_mul(ra, v);
             }
         }
 
@@ -4182,20 +4232,20 @@ public class LongVectorMaxTests extends AbstractVectorTest {
         long[] a = fa.apply(SPECIES.length());
         long id = MUL_IDENTITY;
 
-        assertEquals((long) (id * id), id,
+        assertEquals((long) (scalar_mul(id, id)), id,
                             "MUL(MUL_IDENTITY, MUL_IDENTITY) != MUL_IDENTITY");
 
         long x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((long) (id * x), x);
-                assertEquals((long) (x * id), x);
+                assertEquals((long) (scalar_mul(id, x)), x);
+                assertEquals((long) (scalar_mul(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((long) (id * x), x,
+            assertEquals((long) (scalar_mul(id, x)), x,
                                 "MUL(MUL_IDENTITY, " + x + ") != " + x);
-            assertEquals((long) (x * id), x,
+            assertEquals((long) (scalar_mul(x, id)), x,
                                 "MUL(" + x + ", MUL_IDENTITY) != " + x);
         }
     }
@@ -4204,7 +4254,7 @@ public class LongVectorMaxTests extends AbstractVectorTest {
         long res = MUL_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res *= a[i];
+                res = scalar_mul(res, a[i]);
         }
 
         return res;
@@ -4213,7 +4263,7 @@ public class LongVectorMaxTests extends AbstractVectorTest {
     static long MULReduceAllMasked(long[] a, boolean[] mask) {
         long res = MUL_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res *= MULReduceMasked(a, i, mask);
+            res = scalar_mul(res, MULReduceMasked(a, i, mask));
         }
 
         return res;
@@ -4233,7 +4283,7 @@ public class LongVectorMaxTests extends AbstractVectorTest {
                 LongVector av = LongVector.fromArray(SPECIES, a, i);
                 long v = av.reduceLanes(VectorOperators.MUL, vmask);
                 r[i] = v;
-                ra *= v;
+                ra = scalar_mul(ra, v);
             }
         }
 
@@ -4244,7 +4294,7 @@ public class LongVectorMaxTests extends AbstractVectorTest {
     static long MINReduce(long[] a, int idx) {
         long res = MIN_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res = (long) Math.min(res, a[i]);
+            res = scalar_min(res, a[i]);
         }
 
         return res;
@@ -4253,7 +4303,7 @@ public class LongVectorMaxTests extends AbstractVectorTest {
     static long MINReduceAll(long[] a) {
         long res = MIN_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (long) Math.min(res, MINReduce(a, i));
+            res = scalar_min(res, MINReduce(a, i));
         }
 
         return res;
@@ -4271,7 +4321,7 @@ public class LongVectorMaxTests extends AbstractVectorTest {
                 LongVector av = LongVector.fromArray(SPECIES, a, i);
                 long v = av.reduceLanes(VectorOperators.MIN);
                 r[i] = v;
-                ra = (long) Math.min(ra, v);
+                ra = scalar_min(ra, v);
             }
         }
 
@@ -4284,20 +4334,20 @@ public class LongVectorMaxTests extends AbstractVectorTest {
         long[] a = fa.apply(SPECIES.length());
         long id = MIN_IDENTITY;
 
-        assertEquals((long) Math.min(id, id), id,
+        assertEquals(scalar_min(id, id), id,
                             "MIN(MIN_IDENTITY, MIN_IDENTITY) != MIN_IDENTITY");
 
         long x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((long) Math.min(id, x), x);
-                assertEquals((long) Math.min(x, id), x);
+                assertEquals(scalar_min(id, x), x);
+                assertEquals(scalar_min(x, id), x);
             }
         } catch (AssertionError e) {
-            assertEquals((long) Math.min(id, x), x,
+            assertEquals(scalar_min(id, x), x,
                                 "MIN(MIN_IDENTITY, " + x + ") != " + x);
-            assertEquals((long) Math.min(x, id), x,
+            assertEquals(scalar_min(x, id), x,
                                 "MIN(" + x + ", MIN_IDENTITY) != " + x);
         }
     }
@@ -4306,7 +4356,7 @@ public class LongVectorMaxTests extends AbstractVectorTest {
         long res = MIN_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res = (long) Math.min(res, a[i]);
+                res = scalar_min(res, a[i]);
         }
 
         return res;
@@ -4315,7 +4365,7 @@ public class LongVectorMaxTests extends AbstractVectorTest {
     static long MINReduceAllMasked(long[] a, boolean[] mask) {
         long res = MIN_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (long) Math.min(res, MINReduceMasked(a, i, mask));
+            res = scalar_min(res, MINReduceMasked(a, i, mask));
         }
 
         return res;
@@ -4335,7 +4385,7 @@ public class LongVectorMaxTests extends AbstractVectorTest {
                 LongVector av = LongVector.fromArray(SPECIES, a, i);
                 long v = av.reduceLanes(VectorOperators.MIN, vmask);
                 r[i] = v;
-                ra = (long) Math.min(ra, v);
+                ra = scalar_min(ra, v);
             }
         }
 
@@ -4346,7 +4396,7 @@ public class LongVectorMaxTests extends AbstractVectorTest {
     static long MAXReduce(long[] a, int idx) {
         long res = MAX_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res = (long) Math.max(res, a[i]);
+            res = scalar_max(res, a[i]);
         }
 
         return res;
@@ -4355,7 +4405,7 @@ public class LongVectorMaxTests extends AbstractVectorTest {
     static long MAXReduceAll(long[] a) {
         long res = MAX_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (long) Math.max(res, MAXReduce(a, i));
+            res = scalar_max(res, MAXReduce(a, i));
         }
 
         return res;
@@ -4373,7 +4423,7 @@ public class LongVectorMaxTests extends AbstractVectorTest {
                 LongVector av = LongVector.fromArray(SPECIES, a, i);
                 long v = av.reduceLanes(VectorOperators.MAX);
                 r[i] = v;
-                ra = (long) Math.max(ra, v);
+                ra = scalar_max(ra, v);
             }
         }
 
@@ -4386,20 +4436,20 @@ public class LongVectorMaxTests extends AbstractVectorTest {
         long[] a = fa.apply(SPECIES.length());
         long id = MAX_IDENTITY;
 
-        assertEquals((long) Math.max(id, id), id,
+        assertEquals(scalar_max(id, id), id,
                             "MAX(MAX_IDENTITY, MAX_IDENTITY) != MAX_IDENTITY");
 
         long x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((long) Math.max(id, x), x);
-                assertEquals((long) Math.max(x, id), x);
+                assertEquals(scalar_max(id, x), x);
+                assertEquals(scalar_max(x, id), x);
             }
         } catch (AssertionError e) {
-            assertEquals((long) Math.max(id, x), x,
+            assertEquals(scalar_max(id, x), x,
                                 "MAX(MAX_IDENTITY, " + x + ") != " + x);
-            assertEquals((long) Math.max(x, id), x,
+            assertEquals(scalar_max(x, id), x,
                                 "MAX(" + x + ", MAX_IDENTITY) != " + x);
         }
     }
@@ -4408,7 +4458,7 @@ public class LongVectorMaxTests extends AbstractVectorTest {
         long res = MAX_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res = (long) Math.max(res, a[i]);
+                res = scalar_max(res, a[i]);
         }
 
         return res;
@@ -4417,7 +4467,7 @@ public class LongVectorMaxTests extends AbstractVectorTest {
     static long MAXReduceAllMasked(long[] a, boolean[] mask) {
         long res = MAX_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (long) Math.max(res, MAXReduceMasked(a, i, mask));
+            res = scalar_max(res, MAXReduceMasked(a, i, mask));
         }
 
         return res;
@@ -4437,7 +4487,7 @@ public class LongVectorMaxTests extends AbstractVectorTest {
                 LongVector av = LongVector.fromArray(SPECIES, a, i);
                 long v = av.reduceLanes(VectorOperators.MAX, vmask);
                 r[i] = v;
-                ra = (long) Math.max(ra, v);
+                ra = scalar_max(ra, v);
             }
         }
 
@@ -5470,7 +5520,7 @@ public class LongVectorMaxTests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] < b[i]);
+                assertEquals(mv.laneIsSet(j), lt(a[i + j], b[i]));
             }
         }
     }
@@ -5490,7 +5540,7 @@ public class LongVectorMaxTests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] < b[i]));
+                assertEquals(mv.laneIsSet(j), mask[j] && (lt(a[i + j], b[i])));
             }
         }
     }
@@ -5507,7 +5557,7 @@ public class LongVectorMaxTests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] == b[i]);
+                assertEquals(mv.laneIsSet(j), eq(a[i + j], b[i]));
             }
         }
     }
@@ -5527,7 +5577,7 @@ public class LongVectorMaxTests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] == b[i]));
+                assertEquals(mv.laneIsSet(j), mask[j] && (eq(a[i + j], b[i])));
             }
         }
     }
@@ -6240,11 +6290,11 @@ public class LongVectorMaxTests extends AbstractVectorTest {
     }
 
     static long NEG(long a) {
-        return (long)(-((long)a));
+        return (long)(scalar_neg((long)a));
     }
 
     static long neg(long a) {
-        return (long)(-((long)a));
+        return (long)(scalar_neg((long)a));
     }
 
     @Test(dataProvider = "longUnaryOpProvider")
@@ -6296,11 +6346,11 @@ public class LongVectorMaxTests extends AbstractVectorTest {
     }
 
     static long ABS(long a) {
-        return (long)(Math.abs((long)a));
+        return (long)(scalar_abs((long)a));
     }
 
     static long abs(long a) {
-        return (long)(Math.abs((long)a));
+        return (long)(scalar_abs((long)a));
     }
 
     @Test(dataProvider = "longUnaryOpProvider")
@@ -6791,7 +6841,7 @@ public class LongVectorMaxTests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] < b[i]);
+                assertEquals(mv.laneIsSet(j), lt(a[i + j], b[i]));
             }
         }
     }
@@ -6807,7 +6857,7 @@ public class LongVectorMaxTests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] == b[i]);
+                assertEquals(mv.laneIsSet(j), eq(a[i + j], b[i]));
             }
         }
     }
diff --git a/test/jdk/jdk/incubator/vector/ShortVector128Tests.java b/test/jdk/jdk/incubator/vector/ShortVector128Tests.java
index 7cf49513620..85e7d715182 100644
--- a/test/jdk/jdk/incubator/vector/ShortVector128Tests.java
+++ b/test/jdk/jdk/incubator/vector/ShortVector128Tests.java
@@ -1565,6 +1565,59 @@ public class ShortVector128Tests extends AbstractVectorTest {
         return a >= b;
     }
 
+    static short firstNonZero(short a, short b) {
+        return Short.compare(a, (short) 0) != 0 ? a : b;
+    }
+
+    static short scalar_or(short a, short b) {
+        return (short)(a | b);
+    }
+
+    static short scalar_and(short a, short b) {
+        return (short)(a & b);
+    }
+
+    static short scalar_xor(short a, short b) {
+        return (short)(a ^ b);
+    }
+
+    static short scalar_add(short a, short b) {
+        return (short)(a + b);
+    }
+
+    static short scalar_sub(short a, short b) {
+        return (short)(a - b);
+    }
+
+    static short scalar_mul(short a, short b) {
+        return (short)(a * b);
+    }
+
+    static short scalar_min(short a, short b) {
+        return (short)(Math.min(a, b));
+    }
+
+    static short scalar_max(short a, short b) {
+        return (short)(Math.max(a, b));
+    }
+
+    static short scalar_div(short a, short b) {
+        return (short)(a / b);
+    }
+
+    static short scalar_fma(short a, short b, short c) {
+        return (short)(Math.fma(a, b, c));
+    }
+
+    static short scalar_abs(short a) {
+        return (short)(Math.abs(a));
+    }
+
+    static short scalar_neg(short a) {
+        return ((short)-a);
+    }
+
+
     static boolean ult(short a, short b) {
         return Short.compareUnsigned(a, b) < 0;
     }
@@ -1581,9 +1634,6 @@ public class ShortVector128Tests extends AbstractVectorTest {
         return Short.compareUnsigned(a, b) >= 0;
     }
 
-    static short firstNonZero(short a, short b) {
-        return Short.compare(a, (short) 0) != 0 ? a : b;
-    }
 
     @Test
     static void smokeTest1() {
@@ -1692,7 +1742,7 @@ public class ShortVector128Tests extends AbstractVectorTest {
     }
 
     static short ADD(short a, short b) {
-        return (short)(a + b);
+        return (short)(scalar_add(a, b));
     }
 
     @Test(dataProvider = "shortBinaryOpProvider")
@@ -1713,7 +1763,7 @@ public class ShortVector128Tests extends AbstractVectorTest {
     }
 
     static short add(short a, short b) {
-        return (short)(a + b);
+        return (short)(scalar_add(a, b));
     }
 
     @Test(dataProvider = "shortBinaryOpProvider")
@@ -1770,7 +1820,7 @@ public class ShortVector128Tests extends AbstractVectorTest {
     }
 
     static short SUB(short a, short b) {
-        return (short)(a - b);
+        return (short)(scalar_sub(a, b));
     }
 
     @Test(dataProvider = "shortBinaryOpProvider")
@@ -1791,7 +1841,7 @@ public class ShortVector128Tests extends AbstractVectorTest {
     }
 
     static short sub(short a, short b) {
-        return (short)(a - b);
+        return (short)(scalar_sub(a, b));
     }
 
     @Test(dataProvider = "shortBinaryOpProvider")
@@ -1848,7 +1898,7 @@ public class ShortVector128Tests extends AbstractVectorTest {
     }
 
     static short MUL(short a, short b) {
-        return (short)(a * b);
+        return (short)(scalar_mul(a, b));
     }
 
     @Test(dataProvider = "shortBinaryOpProvider")
@@ -1869,7 +1919,7 @@ public class ShortVector128Tests extends AbstractVectorTest {
     }
 
     static short mul(short a, short b) {
-        return (short)(a * b);
+        return (short)(scalar_mul(a, b));
     }
 
     @Test(dataProvider = "shortBinaryOpProvider")
@@ -2016,7 +2066,7 @@ public class ShortVector128Tests extends AbstractVectorTest {
     }
 
     static short FIRST_NONZERO(short a, short b) {
-        return (short)((a)!=0?a:b);
+        return (short)(firstNonZero(a, b));
     }
 
     @Test(dataProvider = "shortBinaryOpProvider")
@@ -3230,7 +3280,7 @@ public class ShortVector128Tests extends AbstractVectorTest {
     }
 
     static short MIN(short a, short b) {
-        return (short)(Math.min(a, b));
+        return (short)(scalar_min(a, b));
     }
 
     @Test(dataProvider = "shortBinaryOpProvider")
@@ -3251,7 +3301,7 @@ public class ShortVector128Tests extends AbstractVectorTest {
     }
 
     static short min(short a, short b) {
-        return (short)(Math.min(a, b));
+        return (short)(scalar_min(a, b));
     }
 
     @Test(dataProvider = "shortBinaryOpProvider")
@@ -3270,7 +3320,7 @@ public class ShortVector128Tests extends AbstractVectorTest {
     }
 
     static short MAX(short a, short b) {
-        return (short)(Math.max(a, b));
+        return (short)(scalar_max(a, b));
     }
 
     @Test(dataProvider = "shortBinaryOpProvider")
@@ -3291,7 +3341,7 @@ public class ShortVector128Tests extends AbstractVectorTest {
     }
 
     static short max(short a, short b) {
-        return (short)(Math.max(a, b));
+        return (short)(scalar_max(a, b));
     }
 
     @Test(dataProvider = "shortBinaryOpProvider")
@@ -3659,7 +3709,7 @@ public class ShortVector128Tests extends AbstractVectorTest {
     static short ANDReduce(short[] a, int idx) {
         short res = AND_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res &= a[i];
+            res = scalar_and(res, a[i]);
         }
 
         return res;
@@ -3668,7 +3718,7 @@ public class ShortVector128Tests extends AbstractVectorTest {
     static short ANDReduceAll(short[] a) {
         short res = AND_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res &= ANDReduce(a, i);
+            res = scalar_and(res, ANDReduce(a, i));
         }
 
         return res;
@@ -3686,7 +3736,7 @@ public class ShortVector128Tests extends AbstractVectorTest {
                 ShortVector av = ShortVector.fromArray(SPECIES, a, i);
                 short v = av.reduceLanes(VectorOperators.AND);
                 r[i] = v;
-                ra &= v;
+                ra = scalar_and(ra, v);
             }
         }
 
@@ -3699,20 +3749,20 @@ public class ShortVector128Tests extends AbstractVectorTest {
         short[] a = fa.apply(SPECIES.length());
         short id = AND_IDENTITY;
 
-        assertEquals((short) (id & id), id,
+        assertEquals((short) (scalar_and(id, id)), id,
                             "AND(AND_IDENTITY, AND_IDENTITY) != AND_IDENTITY");
 
         short x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((short) (id & x), x);
-                assertEquals((short) (x & id), x);
+                assertEquals((short) (scalar_and(id, x)), x);
+                assertEquals((short) (scalar_and(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((short) (id & x), x,
+            assertEquals((short) (scalar_and(id, x)), x,
                                 "AND(AND_IDENTITY, " + x + ") != " + x);
-            assertEquals((short) (x & id), x,
+            assertEquals((short) (scalar_and(x, id)), x,
                                 "AND(" + x + ", AND_IDENTITY) != " + x);
         }
     }
@@ -3721,7 +3771,7 @@ public class ShortVector128Tests extends AbstractVectorTest {
         short res = AND_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res &= a[i];
+                res = scalar_and(res, a[i]);
         }
 
         return res;
@@ -3730,7 +3780,7 @@ public class ShortVector128Tests extends AbstractVectorTest {
     static short ANDReduceAllMasked(short[] a, boolean[] mask) {
         short res = AND_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res &= ANDReduceMasked(a, i, mask);
+            res = scalar_and(res, ANDReduceMasked(a, i, mask));
         }
 
         return res;
@@ -3750,7 +3800,7 @@ public class ShortVector128Tests extends AbstractVectorTest {
                 ShortVector av = ShortVector.fromArray(SPECIES, a, i);
                 short v = av.reduceLanes(VectorOperators.AND, vmask);
                 r[i] = v;
-                ra &= v;
+                ra = scalar_and(ra, v);
             }
         }
 
@@ -3761,7 +3811,7 @@ public class ShortVector128Tests extends AbstractVectorTest {
     static short ORReduce(short[] a, int idx) {
         short res = OR_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res |= a[i];
+            res = scalar_or(res, a[i]);
         }
 
         return res;
@@ -3770,7 +3820,7 @@ public class ShortVector128Tests extends AbstractVectorTest {
     static short ORReduceAll(short[] a) {
         short res = OR_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res |= ORReduce(a, i);
+            res = scalar_or(res, ORReduce(a, i));
         }
 
         return res;
@@ -3788,7 +3838,7 @@ public class ShortVector128Tests extends AbstractVectorTest {
                 ShortVector av = ShortVector.fromArray(SPECIES, a, i);
                 short v = av.reduceLanes(VectorOperators.OR);
                 r[i] = v;
-                ra |= v;
+                ra = scalar_or(ra, v);
             }
         }
 
@@ -3801,20 +3851,20 @@ public class ShortVector128Tests extends AbstractVectorTest {
         short[] a = fa.apply(SPECIES.length());
         short id = OR_IDENTITY;
 
-        assertEquals((short) (id | id), id,
+        assertEquals((short) (scalar_or(id, id)), id,
                             "OR(OR_IDENTITY, OR_IDENTITY) != OR_IDENTITY");
 
         short x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((short) (id | x), x);
-                assertEquals((short) (x | id), x);
+                assertEquals((short) (scalar_or(id, x)), x);
+                assertEquals((short) (scalar_or(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((short) (id | x), x,
+            assertEquals((short) (scalar_or(id, x)), x,
                                 "OR(OR_IDENTITY, " + x + ") != " + x);
-            assertEquals((short) (x | id), x,
+            assertEquals((short) (scalar_or(x, id)), x,
                                 "OR(" + x + ", OR_IDENTITY) != " + x);
         }
     }
@@ -3823,7 +3873,7 @@ public class ShortVector128Tests extends AbstractVectorTest {
         short res = OR_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res |= a[i];
+                res = scalar_or(res, a[i]);
         }
 
         return res;
@@ -3832,7 +3882,7 @@ public class ShortVector128Tests extends AbstractVectorTest {
     static short ORReduceAllMasked(short[] a, boolean[] mask) {
         short res = OR_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res |= ORReduceMasked(a, i, mask);
+            res = scalar_or(res, ORReduceMasked(a, i, mask));
         }
 
         return res;
@@ -3852,7 +3902,7 @@ public class ShortVector128Tests extends AbstractVectorTest {
                 ShortVector av = ShortVector.fromArray(SPECIES, a, i);
                 short v = av.reduceLanes(VectorOperators.OR, vmask);
                 r[i] = v;
-                ra |= v;
+                ra = scalar_or(ra, v);
             }
         }
 
@@ -3863,7 +3913,7 @@ public class ShortVector128Tests extends AbstractVectorTest {
     static short XORReduce(short[] a, int idx) {
         short res = XOR_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res ^= a[i];
+            res = scalar_xor(res, a[i]);
         }
 
         return res;
@@ -3872,7 +3922,7 @@ public class ShortVector128Tests extends AbstractVectorTest {
     static short XORReduceAll(short[] a) {
         short res = XOR_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res ^= XORReduce(a, i);
+            res = scalar_xor(res, XORReduce(a, i));
         }
 
         return res;
@@ -3890,7 +3940,7 @@ public class ShortVector128Tests extends AbstractVectorTest {
                 ShortVector av = ShortVector.fromArray(SPECIES, a, i);
                 short v = av.reduceLanes(VectorOperators.XOR);
                 r[i] = v;
-                ra ^= v;
+                ra = scalar_xor(ra, v);
             }
         }
 
@@ -3903,20 +3953,20 @@ public class ShortVector128Tests extends AbstractVectorTest {
         short[] a = fa.apply(SPECIES.length());
         short id = XOR_IDENTITY;
 
-        assertEquals((short) (id ^ id), id,
+        assertEquals((short) (scalar_xor(id, id)), id,
                             "XOR(XOR_IDENTITY, XOR_IDENTITY) != XOR_IDENTITY");
 
         short x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((short) (id ^ x), x);
-                assertEquals((short) (x ^ id), x);
+                assertEquals((short) (scalar_xor(id, x)), x);
+                assertEquals((short) (scalar_xor(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((short) (id ^ x), x,
+            assertEquals((short) (scalar_xor(id, x)), x,
                                 "XOR(XOR_IDENTITY, " + x + ") != " + x);
-            assertEquals((short) (x ^ id), x,
+            assertEquals((short) (scalar_xor(x, id)), x,
                                 "XOR(" + x + ", XOR_IDENTITY) != " + x);
         }
     }
@@ -3925,7 +3975,7 @@ public class ShortVector128Tests extends AbstractVectorTest {
         short res = XOR_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res ^= a[i];
+                res = scalar_xor(res, a[i]);
         }
 
         return res;
@@ -3934,7 +3984,7 @@ public class ShortVector128Tests extends AbstractVectorTest {
     static short XORReduceAllMasked(short[] a, boolean[] mask) {
         short res = XOR_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res ^= XORReduceMasked(a, i, mask);
+            res = scalar_xor(res, XORReduceMasked(a, i, mask));
         }
 
         return res;
@@ -3954,7 +4004,7 @@ public class ShortVector128Tests extends AbstractVectorTest {
                 ShortVector av = ShortVector.fromArray(SPECIES, a, i);
                 short v = av.reduceLanes(VectorOperators.XOR, vmask);
                 r[i] = v;
-                ra ^= v;
+                ra = scalar_xor(ra, v);
             }
         }
 
@@ -3965,7 +4015,7 @@ public class ShortVector128Tests extends AbstractVectorTest {
     static short ADDReduce(short[] a, int idx) {
         short res = ADD_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res += a[i];
+            res = scalar_add(res, a[i]);
         }
 
         return res;
@@ -3974,7 +4024,7 @@ public class ShortVector128Tests extends AbstractVectorTest {
     static short ADDReduceAll(short[] a) {
         short res = ADD_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduce(a, i);
+            res = scalar_add(res, ADDReduce(a, i));
         }
 
         return res;
@@ -3992,7 +4042,7 @@ public class ShortVector128Tests extends AbstractVectorTest {
                 ShortVector av = ShortVector.fromArray(SPECIES, a, i);
                 short v = av.reduceLanes(VectorOperators.ADD);
                 r[i] = v;
-                ra += v;
+                ra = scalar_add(ra, v);
             }
         }
 
@@ -4005,20 +4055,20 @@ public class ShortVector128Tests extends AbstractVectorTest {
         short[] a = fa.apply(SPECIES.length());
         short id = ADD_IDENTITY;
 
-        assertEquals((short) (id + id), id,
+        assertEquals((short) (scalar_add(id, id)), id,
                             "ADD(ADD_IDENTITY, ADD_IDENTITY) != ADD_IDENTITY");
 
         short x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((short) (id + x), x);
-                assertEquals((short) (x + id), x);
+                assertEquals((short) (scalar_add(id, x)), x);
+                assertEquals((short) (scalar_add(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((short) (id + x), x,
+            assertEquals((short) (scalar_add(id, x)), x,
                                 "ADD(ADD_IDENTITY, " + x + ") != " + x);
-            assertEquals((short) (x + id), x,
+            assertEquals((short) (scalar_add(x, id)), x,
                                 "ADD(" + x + ", ADD_IDENTITY) != " + x);
         }
     }
@@ -4027,7 +4077,7 @@ public class ShortVector128Tests extends AbstractVectorTest {
         short res = ADD_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res += a[i];
+                res = scalar_add(res, a[i]);
         }
 
         return res;
@@ -4036,7 +4086,7 @@ public class ShortVector128Tests extends AbstractVectorTest {
     static short ADDReduceAllMasked(short[] a, boolean[] mask) {
         short res = ADD_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduceMasked(a, i, mask);
+            res = scalar_add(res, ADDReduceMasked(a, i, mask));
         }
 
         return res;
@@ -4056,7 +4106,7 @@ public class ShortVector128Tests extends AbstractVectorTest {
                 ShortVector av = ShortVector.fromArray(SPECIES, a, i);
                 short v = av.reduceLanes(VectorOperators.ADD, vmask);
                 r[i] = v;
-                ra += v;
+                ra = scalar_add(ra, v);
             }
         }
 
@@ -4067,7 +4117,7 @@ public class ShortVector128Tests extends AbstractVectorTest {
     static short MULReduce(short[] a, int idx) {
         short res = MUL_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res *= a[i];
+            res = scalar_mul(res, a[i]);
         }
 
         return res;
@@ -4076,7 +4126,7 @@ public class ShortVector128Tests extends AbstractVectorTest {
     static short MULReduceAll(short[] a) {
         short res = MUL_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res *= MULReduce(a, i);
+            res = scalar_mul(res, MULReduce(a, i));
         }
 
         return res;
@@ -4094,7 +4144,7 @@ public class ShortVector128Tests extends AbstractVectorTest {
                 ShortVector av = ShortVector.fromArray(SPECIES, a, i);
                 short v = av.reduceLanes(VectorOperators.MUL);
                 r[i] = v;
-                ra *= v;
+                ra = scalar_mul(ra, v);
             }
         }
 
@@ -4107,20 +4157,20 @@ public class ShortVector128Tests extends AbstractVectorTest {
         short[] a = fa.apply(SPECIES.length());
         short id = MUL_IDENTITY;
 
-        assertEquals((short) (id * id), id,
+        assertEquals((short) (scalar_mul(id, id)), id,
                             "MUL(MUL_IDENTITY, MUL_IDENTITY) != MUL_IDENTITY");
 
         short x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((short) (id * x), x);
-                assertEquals((short) (x * id), x);
+                assertEquals((short) (scalar_mul(id, x)), x);
+                assertEquals((short) (scalar_mul(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((short) (id * x), x,
+            assertEquals((short) (scalar_mul(id, x)), x,
                                 "MUL(MUL_IDENTITY, " + x + ") != " + x);
-            assertEquals((short) (x * id), x,
+            assertEquals((short) (scalar_mul(x, id)), x,
                                 "MUL(" + x + ", MUL_IDENTITY) != " + x);
         }
     }
@@ -4129,7 +4179,7 @@ public class ShortVector128Tests extends AbstractVectorTest {
         short res = MUL_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res *= a[i];
+                res = scalar_mul(res, a[i]);
         }
 
         return res;
@@ -4138,7 +4188,7 @@ public class ShortVector128Tests extends AbstractVectorTest {
     static short MULReduceAllMasked(short[] a, boolean[] mask) {
         short res = MUL_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res *= MULReduceMasked(a, i, mask);
+            res = scalar_mul(res, MULReduceMasked(a, i, mask));
         }
 
         return res;
@@ -4158,7 +4208,7 @@ public class ShortVector128Tests extends AbstractVectorTest {
                 ShortVector av = ShortVector.fromArray(SPECIES, a, i);
                 short v = av.reduceLanes(VectorOperators.MUL, vmask);
                 r[i] = v;
-                ra *= v;
+                ra = scalar_mul(ra, v);
             }
         }
 
@@ -4169,7 +4219,7 @@ public class ShortVector128Tests extends AbstractVectorTest {
     static short MINReduce(short[] a, int idx) {
         short res = MIN_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res = (short) Math.min(res, a[i]);
+            res = scalar_min(res, a[i]);
         }
 
         return res;
@@ -4178,7 +4228,7 @@ public class ShortVector128Tests extends AbstractVectorTest {
     static short MINReduceAll(short[] a) {
         short res = MIN_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (short) Math.min(res, MINReduce(a, i));
+            res = scalar_min(res, MINReduce(a, i));
         }
 
         return res;
@@ -4196,7 +4246,7 @@ public class ShortVector128Tests extends AbstractVectorTest {
                 ShortVector av = ShortVector.fromArray(SPECIES, a, i);
                 short v = av.reduceLanes(VectorOperators.MIN);
                 r[i] = v;
-                ra = (short) Math.min(ra, v);
+                ra = scalar_min(ra, v);
             }
         }
 
@@ -4209,20 +4259,20 @@ public class ShortVector128Tests extends AbstractVectorTest {
         short[] a = fa.apply(SPECIES.length());
         short id = MIN_IDENTITY;
 
-        assertEquals((short) Math.min(id, id), id,
+        assertEquals(scalar_min(id, id), id,
                             "MIN(MIN_IDENTITY, MIN_IDENTITY) != MIN_IDENTITY");
 
         short x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((short) Math.min(id, x), x);
-                assertEquals((short) Math.min(x, id), x);
+                assertEquals(scalar_min(id, x), x);
+                assertEquals(scalar_min(x, id), x);
             }
         } catch (AssertionError e) {
-            assertEquals((short) Math.min(id, x), x,
+            assertEquals(scalar_min(id, x), x,
                                 "MIN(MIN_IDENTITY, " + x + ") != " + x);
-            assertEquals((short) Math.min(x, id), x,
+            assertEquals(scalar_min(x, id), x,
                                 "MIN(" + x + ", MIN_IDENTITY) != " + x);
         }
     }
@@ -4231,7 +4281,7 @@ public class ShortVector128Tests extends AbstractVectorTest {
         short res = MIN_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res = (short) Math.min(res, a[i]);
+                res = scalar_min(res, a[i]);
         }
 
         return res;
@@ -4240,7 +4290,7 @@ public class ShortVector128Tests extends AbstractVectorTest {
     static short MINReduceAllMasked(short[] a, boolean[] mask) {
         short res = MIN_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (short) Math.min(res, MINReduceMasked(a, i, mask));
+            res = scalar_min(res, MINReduceMasked(a, i, mask));
         }
 
         return res;
@@ -4260,7 +4310,7 @@ public class ShortVector128Tests extends AbstractVectorTest {
                 ShortVector av = ShortVector.fromArray(SPECIES, a, i);
                 short v = av.reduceLanes(VectorOperators.MIN, vmask);
                 r[i] = v;
-                ra = (short) Math.min(ra, v);
+                ra = scalar_min(ra, v);
             }
         }
 
@@ -4271,7 +4321,7 @@ public class ShortVector128Tests extends AbstractVectorTest {
     static short MAXReduce(short[] a, int idx) {
         short res = MAX_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res = (short) Math.max(res, a[i]);
+            res = scalar_max(res, a[i]);
         }
 
         return res;
@@ -4280,7 +4330,7 @@ public class ShortVector128Tests extends AbstractVectorTest {
     static short MAXReduceAll(short[] a) {
         short res = MAX_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (short) Math.max(res, MAXReduce(a, i));
+            res = scalar_max(res, MAXReduce(a, i));
         }
 
         return res;
@@ -4298,7 +4348,7 @@ public class ShortVector128Tests extends AbstractVectorTest {
                 ShortVector av = ShortVector.fromArray(SPECIES, a, i);
                 short v = av.reduceLanes(VectorOperators.MAX);
                 r[i] = v;
-                ra = (short) Math.max(ra, v);
+                ra = scalar_max(ra, v);
             }
         }
 
@@ -4311,20 +4361,20 @@ public class ShortVector128Tests extends AbstractVectorTest {
         short[] a = fa.apply(SPECIES.length());
         short id = MAX_IDENTITY;
 
-        assertEquals((short) Math.max(id, id), id,
+        assertEquals(scalar_max(id, id), id,
                             "MAX(MAX_IDENTITY, MAX_IDENTITY) != MAX_IDENTITY");
 
         short x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((short) Math.max(id, x), x);
-                assertEquals((short) Math.max(x, id), x);
+                assertEquals(scalar_max(id, x), x);
+                assertEquals(scalar_max(x, id), x);
             }
         } catch (AssertionError e) {
-            assertEquals((short) Math.max(id, x), x,
+            assertEquals(scalar_max(id, x), x,
                                 "MAX(MAX_IDENTITY, " + x + ") != " + x);
-            assertEquals((short) Math.max(x, id), x,
+            assertEquals(scalar_max(x, id), x,
                                 "MAX(" + x + ", MAX_IDENTITY) != " + x);
         }
     }
@@ -4333,7 +4383,7 @@ public class ShortVector128Tests extends AbstractVectorTest {
         short res = MAX_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res = (short) Math.max(res, a[i]);
+                res = scalar_max(res, a[i]);
         }
 
         return res;
@@ -4342,7 +4392,7 @@ public class ShortVector128Tests extends AbstractVectorTest {
     static short MAXReduceAllMasked(short[] a, boolean[] mask) {
         short res = MAX_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (short) Math.max(res, MAXReduceMasked(a, i, mask));
+            res = scalar_max(res, MAXReduceMasked(a, i, mask));
         }
 
         return res;
@@ -4362,7 +4412,7 @@ public class ShortVector128Tests extends AbstractVectorTest {
                 ShortVector av = ShortVector.fromArray(SPECIES, a, i);
                 short v = av.reduceLanes(VectorOperators.MAX, vmask);
                 r[i] = v;
-                ra = (short) Math.max(ra, v);
+                ra = scalar_max(ra, v);
             }
         }
 
@@ -5395,7 +5445,7 @@ public class ShortVector128Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] < b[i]);
+                assertEquals(mv.laneIsSet(j), lt(a[i + j], b[i]));
             }
         }
     }
@@ -5415,7 +5465,7 @@ public class ShortVector128Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] < b[i]));
+                assertEquals(mv.laneIsSet(j), mask[j] && (lt(a[i + j], b[i])));
             }
         }
     }
@@ -5431,7 +5481,7 @@ public class ShortVector128Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] < (short)((long)b[i]));
+                assertEquals(mv.laneIsSet(j), lt(a[i + j], (short)((long)b[i])));
             }
         }
     }
@@ -5451,7 +5501,7 @@ public class ShortVector128Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] < (short)((long)b[i])));
+                assertEquals(mv.laneIsSet(j), mask[j] && (lt(a[i + j], (short)((long)b[i]))));
             }
         }
     }
@@ -5467,7 +5517,7 @@ public class ShortVector128Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] == b[i]);
+                assertEquals(mv.laneIsSet(j), eq(a[i + j], b[i]));
             }
         }
     }
@@ -5487,7 +5537,7 @@ public class ShortVector128Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] == b[i]));
+                assertEquals(mv.laneIsSet(j), mask[j] && (eq(a[i + j], b[i])));
             }
         }
     }
@@ -5503,7 +5553,7 @@ public class ShortVector128Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] == (short)((long)b[i]));
+                assertEquals(mv.laneIsSet(j), eq(a[i + j], (short)((long)b[i])));
             }
         }
     }
@@ -5523,7 +5573,7 @@ public class ShortVector128Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] == (short)((long)b[i])));
+                assertEquals(mv.laneIsSet(j), mask[j] && (eq(a[i + j], (short)((long)b[i]))));
             }
         }
     }
@@ -6235,11 +6285,11 @@ public class ShortVector128Tests extends AbstractVectorTest {
     }
 
     static short NEG(short a) {
-        return (short)(-((short)a));
+        return (short)(scalar_neg((short)a));
     }
 
     static short neg(short a) {
-        return (short)(-((short)a));
+        return (short)(scalar_neg((short)a));
     }
 
     @Test(dataProvider = "shortUnaryOpProvider")
@@ -6291,11 +6341,11 @@ public class ShortVector128Tests extends AbstractVectorTest {
     }
 
     static short ABS(short a) {
-        return (short)(Math.abs((short)a));
+        return (short)(scalar_abs((short)a));
     }
 
     static short abs(short a) {
-        return (short)(Math.abs((short)a));
+        return (short)(scalar_abs((short)a));
     }
 
     @Test(dataProvider = "shortUnaryOpProvider")
@@ -6786,7 +6836,7 @@ public class ShortVector128Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] < b[i]);
+                assertEquals(mv.laneIsSet(j), lt(a[i + j], b[i]));
             }
         }
     }
@@ -6802,7 +6852,7 @@ public class ShortVector128Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] == b[i]);
+                assertEquals(mv.laneIsSet(j), eq(a[i + j], b[i]));
             }
         }
     }
@@ -6871,7 +6921,7 @@ public class ShortVector128Tests extends AbstractVectorTest {
     static long ADDReduceLong(short[] a, int idx) {
         short res = 0;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res += a[i];
+            res = scalar_add(res, a[i]);
         }
 
         return (long)res;
@@ -6880,7 +6930,7 @@ public class ShortVector128Tests extends AbstractVectorTest {
     static long ADDReduceAllLong(short[] a) {
         long res = 0;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduceLong(a, i);
+            res = (long)scalar_add((short)res, (short)ADDReduceLong(a, i));
         }
 
         return res;
@@ -6898,8 +6948,8 @@ public class ShortVector128Tests extends AbstractVectorTest {
         }
 
         ra = 0;
-        for (int i = 0; i < a.length; i ++) {
-            ra += r[i];
+        for (int i = 0; i < a.length; i++) {
+            ra = (long)scalar_add((short)ra, (short)r[i]);
         }
 
         assertReductionLongArraysEquals(r, ra, a,
@@ -6909,8 +6959,9 @@ public class ShortVector128Tests extends AbstractVectorTest {
     static long ADDReduceLongMasked(short[] a, int idx, boolean[] mask) {
         short res = 0;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            if(mask[i % SPECIES.length()])
-                res += a[i];
+            if (mask[i % SPECIES.length()]) {
+                res = scalar_add(res, a[i]);
+            }
         }
 
         return (long)res;
@@ -6919,7 +6970,7 @@ public class ShortVector128Tests extends AbstractVectorTest {
     static long ADDReduceAllLongMasked(short[] a, boolean[] mask) {
         long res = 0;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduceLongMasked(a, i, mask);
+            res = (long)scalar_add((short)res, (short)ADDReduceLongMasked(a, i, mask));
         }
 
         return res;
@@ -6939,8 +6990,8 @@ public class ShortVector128Tests extends AbstractVectorTest {
         }
 
         ra = 0;
-        for (int i = 0; i < a.length; i ++) {
-            ra += r[i];
+        for (int i = 0; i < a.length; i++) {
+            ra = (long)scalar_add((short)ra, (short)r[i]);
         }
 
         assertReductionLongArraysEqualsMasked(r, ra, a, mask,
diff --git a/test/jdk/jdk/incubator/vector/ShortVector256Tests.java b/test/jdk/jdk/incubator/vector/ShortVector256Tests.java
index 5104e3724f7..df379b64e3a 100644
--- a/test/jdk/jdk/incubator/vector/ShortVector256Tests.java
+++ b/test/jdk/jdk/incubator/vector/ShortVector256Tests.java
@@ -1565,6 +1565,59 @@ public class ShortVector256Tests extends AbstractVectorTest {
         return a >= b;
     }
 
+    static short firstNonZero(short a, short b) {
+        return Short.compare(a, (short) 0) != 0 ? a : b;
+    }
+
+    static short scalar_or(short a, short b) {
+        return (short)(a | b);
+    }
+
+    static short scalar_and(short a, short b) {
+        return (short)(a & b);
+    }
+
+    static short scalar_xor(short a, short b) {
+        return (short)(a ^ b);
+    }
+
+    static short scalar_add(short a, short b) {
+        return (short)(a + b);
+    }
+
+    static short scalar_sub(short a, short b) {
+        return (short)(a - b);
+    }
+
+    static short scalar_mul(short a, short b) {
+        return (short)(a * b);
+    }
+
+    static short scalar_min(short a, short b) {
+        return (short)(Math.min(a, b));
+    }
+
+    static short scalar_max(short a, short b) {
+        return (short)(Math.max(a, b));
+    }
+
+    static short scalar_div(short a, short b) {
+        return (short)(a / b);
+    }
+
+    static short scalar_fma(short a, short b, short c) {
+        return (short)(Math.fma(a, b, c));
+    }
+
+    static short scalar_abs(short a) {
+        return (short)(Math.abs(a));
+    }
+
+    static short scalar_neg(short a) {
+        return ((short)-a);
+    }
+
+
     static boolean ult(short a, short b) {
         return Short.compareUnsigned(a, b) < 0;
     }
@@ -1581,9 +1634,6 @@ public class ShortVector256Tests extends AbstractVectorTest {
         return Short.compareUnsigned(a, b) >= 0;
     }
 
-    static short firstNonZero(short a, short b) {
-        return Short.compare(a, (short) 0) != 0 ? a : b;
-    }
 
     @Test
     static void smokeTest1() {
@@ -1692,7 +1742,7 @@ public class ShortVector256Tests extends AbstractVectorTest {
     }
 
     static short ADD(short a, short b) {
-        return (short)(a + b);
+        return (short)(scalar_add(a, b));
     }
 
     @Test(dataProvider = "shortBinaryOpProvider")
@@ -1713,7 +1763,7 @@ public class ShortVector256Tests extends AbstractVectorTest {
     }
 
     static short add(short a, short b) {
-        return (short)(a + b);
+        return (short)(scalar_add(a, b));
     }
 
     @Test(dataProvider = "shortBinaryOpProvider")
@@ -1770,7 +1820,7 @@ public class ShortVector256Tests extends AbstractVectorTest {
     }
 
     static short SUB(short a, short b) {
-        return (short)(a - b);
+        return (short)(scalar_sub(a, b));
     }
 
     @Test(dataProvider = "shortBinaryOpProvider")
@@ -1791,7 +1841,7 @@ public class ShortVector256Tests extends AbstractVectorTest {
     }
 
     static short sub(short a, short b) {
-        return (short)(a - b);
+        return (short)(scalar_sub(a, b));
     }
 
     @Test(dataProvider = "shortBinaryOpProvider")
@@ -1848,7 +1898,7 @@ public class ShortVector256Tests extends AbstractVectorTest {
     }
 
     static short MUL(short a, short b) {
-        return (short)(a * b);
+        return (short)(scalar_mul(a, b));
     }
 
     @Test(dataProvider = "shortBinaryOpProvider")
@@ -1869,7 +1919,7 @@ public class ShortVector256Tests extends AbstractVectorTest {
     }
 
     static short mul(short a, short b) {
-        return (short)(a * b);
+        return (short)(scalar_mul(a, b));
     }
 
     @Test(dataProvider = "shortBinaryOpProvider")
@@ -2016,7 +2066,7 @@ public class ShortVector256Tests extends AbstractVectorTest {
     }
 
     static short FIRST_NONZERO(short a, short b) {
-        return (short)((a)!=0?a:b);
+        return (short)(firstNonZero(a, b));
     }
 
     @Test(dataProvider = "shortBinaryOpProvider")
@@ -3230,7 +3280,7 @@ public class ShortVector256Tests extends AbstractVectorTest {
     }
 
     static short MIN(short a, short b) {
-        return (short)(Math.min(a, b));
+        return (short)(scalar_min(a, b));
     }
 
     @Test(dataProvider = "shortBinaryOpProvider")
@@ -3251,7 +3301,7 @@ public class ShortVector256Tests extends AbstractVectorTest {
     }
 
     static short min(short a, short b) {
-        return (short)(Math.min(a, b));
+        return (short)(scalar_min(a, b));
     }
 
     @Test(dataProvider = "shortBinaryOpProvider")
@@ -3270,7 +3320,7 @@ public class ShortVector256Tests extends AbstractVectorTest {
     }
 
     static short MAX(short a, short b) {
-        return (short)(Math.max(a, b));
+        return (short)(scalar_max(a, b));
     }
 
     @Test(dataProvider = "shortBinaryOpProvider")
@@ -3291,7 +3341,7 @@ public class ShortVector256Tests extends AbstractVectorTest {
     }
 
     static short max(short a, short b) {
-        return (short)(Math.max(a, b));
+        return (short)(scalar_max(a, b));
     }
 
     @Test(dataProvider = "shortBinaryOpProvider")
@@ -3659,7 +3709,7 @@ public class ShortVector256Tests extends AbstractVectorTest {
     static short ANDReduce(short[] a, int idx) {
         short res = AND_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res &= a[i];
+            res = scalar_and(res, a[i]);
         }
 
         return res;
@@ -3668,7 +3718,7 @@ public class ShortVector256Tests extends AbstractVectorTest {
     static short ANDReduceAll(short[] a) {
         short res = AND_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res &= ANDReduce(a, i);
+            res = scalar_and(res, ANDReduce(a, i));
         }
 
         return res;
@@ -3686,7 +3736,7 @@ public class ShortVector256Tests extends AbstractVectorTest {
                 ShortVector av = ShortVector.fromArray(SPECIES, a, i);
                 short v = av.reduceLanes(VectorOperators.AND);
                 r[i] = v;
-                ra &= v;
+                ra = scalar_and(ra, v);
             }
         }
 
@@ -3699,20 +3749,20 @@ public class ShortVector256Tests extends AbstractVectorTest {
         short[] a = fa.apply(SPECIES.length());
         short id = AND_IDENTITY;
 
-        assertEquals((short) (id & id), id,
+        assertEquals((short) (scalar_and(id, id)), id,
                             "AND(AND_IDENTITY, AND_IDENTITY) != AND_IDENTITY");
 
         short x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((short) (id & x), x);
-                assertEquals((short) (x & id), x);
+                assertEquals((short) (scalar_and(id, x)), x);
+                assertEquals((short) (scalar_and(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((short) (id & x), x,
+            assertEquals((short) (scalar_and(id, x)), x,
                                 "AND(AND_IDENTITY, " + x + ") != " + x);
-            assertEquals((short) (x & id), x,
+            assertEquals((short) (scalar_and(x, id)), x,
                                 "AND(" + x + ", AND_IDENTITY) != " + x);
         }
     }
@@ -3721,7 +3771,7 @@ public class ShortVector256Tests extends AbstractVectorTest {
         short res = AND_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res &= a[i];
+                res = scalar_and(res, a[i]);
         }
 
         return res;
@@ -3730,7 +3780,7 @@ public class ShortVector256Tests extends AbstractVectorTest {
     static short ANDReduceAllMasked(short[] a, boolean[] mask) {
         short res = AND_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res &= ANDReduceMasked(a, i, mask);
+            res = scalar_and(res, ANDReduceMasked(a, i, mask));
         }
 
         return res;
@@ -3750,7 +3800,7 @@ public class ShortVector256Tests extends AbstractVectorTest {
                 ShortVector av = ShortVector.fromArray(SPECIES, a, i);
                 short v = av.reduceLanes(VectorOperators.AND, vmask);
                 r[i] = v;
-                ra &= v;
+                ra = scalar_and(ra, v);
             }
         }
 
@@ -3761,7 +3811,7 @@ public class ShortVector256Tests extends AbstractVectorTest {
     static short ORReduce(short[] a, int idx) {
         short res = OR_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res |= a[i];
+            res = scalar_or(res, a[i]);
         }
 
         return res;
@@ -3770,7 +3820,7 @@ public class ShortVector256Tests extends AbstractVectorTest {
     static short ORReduceAll(short[] a) {
         short res = OR_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res |= ORReduce(a, i);
+            res = scalar_or(res, ORReduce(a, i));
         }
 
         return res;
@@ -3788,7 +3838,7 @@ public class ShortVector256Tests extends AbstractVectorTest {
                 ShortVector av = ShortVector.fromArray(SPECIES, a, i);
                 short v = av.reduceLanes(VectorOperators.OR);
                 r[i] = v;
-                ra |= v;
+                ra = scalar_or(ra, v);
             }
         }
 
@@ -3801,20 +3851,20 @@ public class ShortVector256Tests extends AbstractVectorTest {
         short[] a = fa.apply(SPECIES.length());
         short id = OR_IDENTITY;
 
-        assertEquals((short) (id | id), id,
+        assertEquals((short) (scalar_or(id, id)), id,
                             "OR(OR_IDENTITY, OR_IDENTITY) != OR_IDENTITY");
 
         short x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((short) (id | x), x);
-                assertEquals((short) (x | id), x);
+                assertEquals((short) (scalar_or(id, x)), x);
+                assertEquals((short) (scalar_or(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((short) (id | x), x,
+            assertEquals((short) (scalar_or(id, x)), x,
                                 "OR(OR_IDENTITY, " + x + ") != " + x);
-            assertEquals((short) (x | id), x,
+            assertEquals((short) (scalar_or(x, id)), x,
                                 "OR(" + x + ", OR_IDENTITY) != " + x);
         }
     }
@@ -3823,7 +3873,7 @@ public class ShortVector256Tests extends AbstractVectorTest {
         short res = OR_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res |= a[i];
+                res = scalar_or(res, a[i]);
         }
 
         return res;
@@ -3832,7 +3882,7 @@ public class ShortVector256Tests extends AbstractVectorTest {
     static short ORReduceAllMasked(short[] a, boolean[] mask) {
         short res = OR_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res |= ORReduceMasked(a, i, mask);
+            res = scalar_or(res, ORReduceMasked(a, i, mask));
         }
 
         return res;
@@ -3852,7 +3902,7 @@ public class ShortVector256Tests extends AbstractVectorTest {
                 ShortVector av = ShortVector.fromArray(SPECIES, a, i);
                 short v = av.reduceLanes(VectorOperators.OR, vmask);
                 r[i] = v;
-                ra |= v;
+                ra = scalar_or(ra, v);
             }
         }
 
@@ -3863,7 +3913,7 @@ public class ShortVector256Tests extends AbstractVectorTest {
     static short XORReduce(short[] a, int idx) {
         short res = XOR_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res ^= a[i];
+            res = scalar_xor(res, a[i]);
         }
 
         return res;
@@ -3872,7 +3922,7 @@ public class ShortVector256Tests extends AbstractVectorTest {
     static short XORReduceAll(short[] a) {
         short res = XOR_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res ^= XORReduce(a, i);
+            res = scalar_xor(res, XORReduce(a, i));
         }
 
         return res;
@@ -3890,7 +3940,7 @@ public class ShortVector256Tests extends AbstractVectorTest {
                 ShortVector av = ShortVector.fromArray(SPECIES, a, i);
                 short v = av.reduceLanes(VectorOperators.XOR);
                 r[i] = v;
-                ra ^= v;
+                ra = scalar_xor(ra, v);
             }
         }
 
@@ -3903,20 +3953,20 @@ public class ShortVector256Tests extends AbstractVectorTest {
         short[] a = fa.apply(SPECIES.length());
         short id = XOR_IDENTITY;
 
-        assertEquals((short) (id ^ id), id,
+        assertEquals((short) (scalar_xor(id, id)), id,
                             "XOR(XOR_IDENTITY, XOR_IDENTITY) != XOR_IDENTITY");
 
         short x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((short) (id ^ x), x);
-                assertEquals((short) (x ^ id), x);
+                assertEquals((short) (scalar_xor(id, x)), x);
+                assertEquals((short) (scalar_xor(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((short) (id ^ x), x,
+            assertEquals((short) (scalar_xor(id, x)), x,
                                 "XOR(XOR_IDENTITY, " + x + ") != " + x);
-            assertEquals((short) (x ^ id), x,
+            assertEquals((short) (scalar_xor(x, id)), x,
                                 "XOR(" + x + ", XOR_IDENTITY) != " + x);
         }
     }
@@ -3925,7 +3975,7 @@ public class ShortVector256Tests extends AbstractVectorTest {
         short res = XOR_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res ^= a[i];
+                res = scalar_xor(res, a[i]);
         }
 
         return res;
@@ -3934,7 +3984,7 @@ public class ShortVector256Tests extends AbstractVectorTest {
     static short XORReduceAllMasked(short[] a, boolean[] mask) {
         short res = XOR_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res ^= XORReduceMasked(a, i, mask);
+            res = scalar_xor(res, XORReduceMasked(a, i, mask));
         }
 
         return res;
@@ -3954,7 +4004,7 @@ public class ShortVector256Tests extends AbstractVectorTest {
                 ShortVector av = ShortVector.fromArray(SPECIES, a, i);
                 short v = av.reduceLanes(VectorOperators.XOR, vmask);
                 r[i] = v;
-                ra ^= v;
+                ra = scalar_xor(ra, v);
             }
         }
 
@@ -3965,7 +4015,7 @@ public class ShortVector256Tests extends AbstractVectorTest {
     static short ADDReduce(short[] a, int idx) {
         short res = ADD_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res += a[i];
+            res = scalar_add(res, a[i]);
         }
 
         return res;
@@ -3974,7 +4024,7 @@ public class ShortVector256Tests extends AbstractVectorTest {
     static short ADDReduceAll(short[] a) {
         short res = ADD_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduce(a, i);
+            res = scalar_add(res, ADDReduce(a, i));
         }
 
         return res;
@@ -3992,7 +4042,7 @@ public class ShortVector256Tests extends AbstractVectorTest {
                 ShortVector av = ShortVector.fromArray(SPECIES, a, i);
                 short v = av.reduceLanes(VectorOperators.ADD);
                 r[i] = v;
-                ra += v;
+                ra = scalar_add(ra, v);
             }
         }
 
@@ -4005,20 +4055,20 @@ public class ShortVector256Tests extends AbstractVectorTest {
         short[] a = fa.apply(SPECIES.length());
         short id = ADD_IDENTITY;
 
-        assertEquals((short) (id + id), id,
+        assertEquals((short) (scalar_add(id, id)), id,
                             "ADD(ADD_IDENTITY, ADD_IDENTITY) != ADD_IDENTITY");
 
         short x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((short) (id + x), x);
-                assertEquals((short) (x + id), x);
+                assertEquals((short) (scalar_add(id, x)), x);
+                assertEquals((short) (scalar_add(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((short) (id + x), x,
+            assertEquals((short) (scalar_add(id, x)), x,
                                 "ADD(ADD_IDENTITY, " + x + ") != " + x);
-            assertEquals((short) (x + id), x,
+            assertEquals((short) (scalar_add(x, id)), x,
                                 "ADD(" + x + ", ADD_IDENTITY) != " + x);
         }
     }
@@ -4027,7 +4077,7 @@ public class ShortVector256Tests extends AbstractVectorTest {
         short res = ADD_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res += a[i];
+                res = scalar_add(res, a[i]);
         }
 
         return res;
@@ -4036,7 +4086,7 @@ public class ShortVector256Tests extends AbstractVectorTest {
     static short ADDReduceAllMasked(short[] a, boolean[] mask) {
         short res = ADD_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduceMasked(a, i, mask);
+            res = scalar_add(res, ADDReduceMasked(a, i, mask));
         }
 
         return res;
@@ -4056,7 +4106,7 @@ public class ShortVector256Tests extends AbstractVectorTest {
                 ShortVector av = ShortVector.fromArray(SPECIES, a, i);
                 short v = av.reduceLanes(VectorOperators.ADD, vmask);
                 r[i] = v;
-                ra += v;
+                ra = scalar_add(ra, v);
             }
         }
 
@@ -4067,7 +4117,7 @@ public class ShortVector256Tests extends AbstractVectorTest {
     static short MULReduce(short[] a, int idx) {
         short res = MUL_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res *= a[i];
+            res = scalar_mul(res, a[i]);
         }
 
         return res;
@@ -4076,7 +4126,7 @@ public class ShortVector256Tests extends AbstractVectorTest {
     static short MULReduceAll(short[] a) {
         short res = MUL_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res *= MULReduce(a, i);
+            res = scalar_mul(res, MULReduce(a, i));
         }
 
         return res;
@@ -4094,7 +4144,7 @@ public class ShortVector256Tests extends AbstractVectorTest {
                 ShortVector av = ShortVector.fromArray(SPECIES, a, i);
                 short v = av.reduceLanes(VectorOperators.MUL);
                 r[i] = v;
-                ra *= v;
+                ra = scalar_mul(ra, v);
             }
         }
 
@@ -4107,20 +4157,20 @@ public class ShortVector256Tests extends AbstractVectorTest {
         short[] a = fa.apply(SPECIES.length());
         short id = MUL_IDENTITY;
 
-        assertEquals((short) (id * id), id,
+        assertEquals((short) (scalar_mul(id, id)), id,
                             "MUL(MUL_IDENTITY, MUL_IDENTITY) != MUL_IDENTITY");
 
         short x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((short) (id * x), x);
-                assertEquals((short) (x * id), x);
+                assertEquals((short) (scalar_mul(id, x)), x);
+                assertEquals((short) (scalar_mul(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((short) (id * x), x,
+            assertEquals((short) (scalar_mul(id, x)), x,
                                 "MUL(MUL_IDENTITY, " + x + ") != " + x);
-            assertEquals((short) (x * id), x,
+            assertEquals((short) (scalar_mul(x, id)), x,
                                 "MUL(" + x + ", MUL_IDENTITY) != " + x);
         }
     }
@@ -4129,7 +4179,7 @@ public class ShortVector256Tests extends AbstractVectorTest {
         short res = MUL_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res *= a[i];
+                res = scalar_mul(res, a[i]);
         }
 
         return res;
@@ -4138,7 +4188,7 @@ public class ShortVector256Tests extends AbstractVectorTest {
     static short MULReduceAllMasked(short[] a, boolean[] mask) {
         short res = MUL_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res *= MULReduceMasked(a, i, mask);
+            res = scalar_mul(res, MULReduceMasked(a, i, mask));
         }
 
         return res;
@@ -4158,7 +4208,7 @@ public class ShortVector256Tests extends AbstractVectorTest {
                 ShortVector av = ShortVector.fromArray(SPECIES, a, i);
                 short v = av.reduceLanes(VectorOperators.MUL, vmask);
                 r[i] = v;
-                ra *= v;
+                ra = scalar_mul(ra, v);
             }
         }
 
@@ -4169,7 +4219,7 @@ public class ShortVector256Tests extends AbstractVectorTest {
     static short MINReduce(short[] a, int idx) {
         short res = MIN_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res = (short) Math.min(res, a[i]);
+            res = scalar_min(res, a[i]);
         }
 
         return res;
@@ -4178,7 +4228,7 @@ public class ShortVector256Tests extends AbstractVectorTest {
     static short MINReduceAll(short[] a) {
         short res = MIN_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (short) Math.min(res, MINReduce(a, i));
+            res = scalar_min(res, MINReduce(a, i));
         }
 
         return res;
@@ -4196,7 +4246,7 @@ public class ShortVector256Tests extends AbstractVectorTest {
                 ShortVector av = ShortVector.fromArray(SPECIES, a, i);
                 short v = av.reduceLanes(VectorOperators.MIN);
                 r[i] = v;
-                ra = (short) Math.min(ra, v);
+                ra = scalar_min(ra, v);
             }
         }
 
@@ -4209,20 +4259,20 @@ public class ShortVector256Tests extends AbstractVectorTest {
         short[] a = fa.apply(SPECIES.length());
         short id = MIN_IDENTITY;
 
-        assertEquals((short) Math.min(id, id), id,
+        assertEquals(scalar_min(id, id), id,
                             "MIN(MIN_IDENTITY, MIN_IDENTITY) != MIN_IDENTITY");
 
         short x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((short) Math.min(id, x), x);
-                assertEquals((short) Math.min(x, id), x);
+                assertEquals(scalar_min(id, x), x);
+                assertEquals(scalar_min(x, id), x);
             }
         } catch (AssertionError e) {
-            assertEquals((short) Math.min(id, x), x,
+            assertEquals(scalar_min(id, x), x,
                                 "MIN(MIN_IDENTITY, " + x + ") != " + x);
-            assertEquals((short) Math.min(x, id), x,
+            assertEquals(scalar_min(x, id), x,
                                 "MIN(" + x + ", MIN_IDENTITY) != " + x);
         }
     }
@@ -4231,7 +4281,7 @@ public class ShortVector256Tests extends AbstractVectorTest {
         short res = MIN_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res = (short) Math.min(res, a[i]);
+                res = scalar_min(res, a[i]);
         }
 
         return res;
@@ -4240,7 +4290,7 @@ public class ShortVector256Tests extends AbstractVectorTest {
     static short MINReduceAllMasked(short[] a, boolean[] mask) {
         short res = MIN_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (short) Math.min(res, MINReduceMasked(a, i, mask));
+            res = scalar_min(res, MINReduceMasked(a, i, mask));
         }
 
         return res;
@@ -4260,7 +4310,7 @@ public class ShortVector256Tests extends AbstractVectorTest {
                 ShortVector av = ShortVector.fromArray(SPECIES, a, i);
                 short v = av.reduceLanes(VectorOperators.MIN, vmask);
                 r[i] = v;
-                ra = (short) Math.min(ra, v);
+                ra = scalar_min(ra, v);
             }
         }
 
@@ -4271,7 +4321,7 @@ public class ShortVector256Tests extends AbstractVectorTest {
     static short MAXReduce(short[] a, int idx) {
         short res = MAX_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res = (short) Math.max(res, a[i]);
+            res = scalar_max(res, a[i]);
         }
 
         return res;
@@ -4280,7 +4330,7 @@ public class ShortVector256Tests extends AbstractVectorTest {
     static short MAXReduceAll(short[] a) {
         short res = MAX_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (short) Math.max(res, MAXReduce(a, i));
+            res = scalar_max(res, MAXReduce(a, i));
         }
 
         return res;
@@ -4298,7 +4348,7 @@ public class ShortVector256Tests extends AbstractVectorTest {
                 ShortVector av = ShortVector.fromArray(SPECIES, a, i);
                 short v = av.reduceLanes(VectorOperators.MAX);
                 r[i] = v;
-                ra = (short) Math.max(ra, v);
+                ra = scalar_max(ra, v);
             }
         }
 
@@ -4311,20 +4361,20 @@ public class ShortVector256Tests extends AbstractVectorTest {
         short[] a = fa.apply(SPECIES.length());
         short id = MAX_IDENTITY;
 
-        assertEquals((short) Math.max(id, id), id,
+        assertEquals(scalar_max(id, id), id,
                             "MAX(MAX_IDENTITY, MAX_IDENTITY) != MAX_IDENTITY");
 
         short x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((short) Math.max(id, x), x);
-                assertEquals((short) Math.max(x, id), x);
+                assertEquals(scalar_max(id, x), x);
+                assertEquals(scalar_max(x, id), x);
             }
         } catch (AssertionError e) {
-            assertEquals((short) Math.max(id, x), x,
+            assertEquals(scalar_max(id, x), x,
                                 "MAX(MAX_IDENTITY, " + x + ") != " + x);
-            assertEquals((short) Math.max(x, id), x,
+            assertEquals(scalar_max(x, id), x,
                                 "MAX(" + x + ", MAX_IDENTITY) != " + x);
         }
     }
@@ -4333,7 +4383,7 @@ public class ShortVector256Tests extends AbstractVectorTest {
         short res = MAX_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res = (short) Math.max(res, a[i]);
+                res = scalar_max(res, a[i]);
         }
 
         return res;
@@ -4342,7 +4392,7 @@ public class ShortVector256Tests extends AbstractVectorTest {
     static short MAXReduceAllMasked(short[] a, boolean[] mask) {
         short res = MAX_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (short) Math.max(res, MAXReduceMasked(a, i, mask));
+            res = scalar_max(res, MAXReduceMasked(a, i, mask));
         }
 
         return res;
@@ -4362,7 +4412,7 @@ public class ShortVector256Tests extends AbstractVectorTest {
                 ShortVector av = ShortVector.fromArray(SPECIES, a, i);
                 short v = av.reduceLanes(VectorOperators.MAX, vmask);
                 r[i] = v;
-                ra = (short) Math.max(ra, v);
+                ra = scalar_max(ra, v);
             }
         }
 
@@ -5395,7 +5445,7 @@ public class ShortVector256Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] < b[i]);
+                assertEquals(mv.laneIsSet(j), lt(a[i + j], b[i]));
             }
         }
     }
@@ -5415,7 +5465,7 @@ public class ShortVector256Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] < b[i]));
+                assertEquals(mv.laneIsSet(j), mask[j] && (lt(a[i + j], b[i])));
             }
         }
     }
@@ -5431,7 +5481,7 @@ public class ShortVector256Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] < (short)((long)b[i]));
+                assertEquals(mv.laneIsSet(j), lt(a[i + j], (short)((long)b[i])));
             }
         }
     }
@@ -5451,7 +5501,7 @@ public class ShortVector256Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] < (short)((long)b[i])));
+                assertEquals(mv.laneIsSet(j), mask[j] && (lt(a[i + j], (short)((long)b[i]))));
             }
         }
     }
@@ -5467,7 +5517,7 @@ public class ShortVector256Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] == b[i]);
+                assertEquals(mv.laneIsSet(j), eq(a[i + j], b[i]));
             }
         }
     }
@@ -5487,7 +5537,7 @@ public class ShortVector256Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] == b[i]));
+                assertEquals(mv.laneIsSet(j), mask[j] && (eq(a[i + j], b[i])));
             }
         }
     }
@@ -5503,7 +5553,7 @@ public class ShortVector256Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] == (short)((long)b[i]));
+                assertEquals(mv.laneIsSet(j), eq(a[i + j], (short)((long)b[i])));
             }
         }
     }
@@ -5523,7 +5573,7 @@ public class ShortVector256Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] == (short)((long)b[i])));
+                assertEquals(mv.laneIsSet(j), mask[j] && (eq(a[i + j], (short)((long)b[i]))));
             }
         }
     }
@@ -6235,11 +6285,11 @@ public class ShortVector256Tests extends AbstractVectorTest {
     }
 
     static short NEG(short a) {
-        return (short)(-((short)a));
+        return (short)(scalar_neg((short)a));
     }
 
     static short neg(short a) {
-        return (short)(-((short)a));
+        return (short)(scalar_neg((short)a));
     }
 
     @Test(dataProvider = "shortUnaryOpProvider")
@@ -6291,11 +6341,11 @@ public class ShortVector256Tests extends AbstractVectorTest {
     }
 
     static short ABS(short a) {
-        return (short)(Math.abs((short)a));
+        return (short)(scalar_abs((short)a));
     }
 
     static short abs(short a) {
-        return (short)(Math.abs((short)a));
+        return (short)(scalar_abs((short)a));
     }
 
     @Test(dataProvider = "shortUnaryOpProvider")
@@ -6786,7 +6836,7 @@ public class ShortVector256Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] < b[i]);
+                assertEquals(mv.laneIsSet(j), lt(a[i + j], b[i]));
             }
         }
     }
@@ -6802,7 +6852,7 @@ public class ShortVector256Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] == b[i]);
+                assertEquals(mv.laneIsSet(j), eq(a[i + j], b[i]));
             }
         }
     }
@@ -6871,7 +6921,7 @@ public class ShortVector256Tests extends AbstractVectorTest {
     static long ADDReduceLong(short[] a, int idx) {
         short res = 0;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res += a[i];
+            res = scalar_add(res, a[i]);
         }
 
         return (long)res;
@@ -6880,7 +6930,7 @@ public class ShortVector256Tests extends AbstractVectorTest {
     static long ADDReduceAllLong(short[] a) {
         long res = 0;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduceLong(a, i);
+            res = (long)scalar_add((short)res, (short)ADDReduceLong(a, i));
         }
 
         return res;
@@ -6898,8 +6948,8 @@ public class ShortVector256Tests extends AbstractVectorTest {
         }
 
         ra = 0;
-        for (int i = 0; i < a.length; i ++) {
-            ra += r[i];
+        for (int i = 0; i < a.length; i++) {
+            ra = (long)scalar_add((short)ra, (short)r[i]);
         }
 
         assertReductionLongArraysEquals(r, ra, a,
@@ -6909,8 +6959,9 @@ public class ShortVector256Tests extends AbstractVectorTest {
     static long ADDReduceLongMasked(short[] a, int idx, boolean[] mask) {
         short res = 0;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            if(mask[i % SPECIES.length()])
-                res += a[i];
+            if (mask[i % SPECIES.length()]) {
+                res = scalar_add(res, a[i]);
+            }
         }
 
         return (long)res;
@@ -6919,7 +6970,7 @@ public class ShortVector256Tests extends AbstractVectorTest {
     static long ADDReduceAllLongMasked(short[] a, boolean[] mask) {
         long res = 0;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduceLongMasked(a, i, mask);
+            res = (long)scalar_add((short)res, (short)ADDReduceLongMasked(a, i, mask));
         }
 
         return res;
@@ -6939,8 +6990,8 @@ public class ShortVector256Tests extends AbstractVectorTest {
         }
 
         ra = 0;
-        for (int i = 0; i < a.length; i ++) {
-            ra += r[i];
+        for (int i = 0; i < a.length; i++) {
+            ra = (long)scalar_add((short)ra, (short)r[i]);
         }
 
         assertReductionLongArraysEqualsMasked(r, ra, a, mask,
diff --git a/test/jdk/jdk/incubator/vector/ShortVector512Tests.java b/test/jdk/jdk/incubator/vector/ShortVector512Tests.java
index 69dc6d8019f..ae5804c3688 100644
--- a/test/jdk/jdk/incubator/vector/ShortVector512Tests.java
+++ b/test/jdk/jdk/incubator/vector/ShortVector512Tests.java
@@ -1565,6 +1565,59 @@ public class ShortVector512Tests extends AbstractVectorTest {
         return a >= b;
     }
 
+    static short firstNonZero(short a, short b) {
+        return Short.compare(a, (short) 0) != 0 ? a : b;
+    }
+
+    static short scalar_or(short a, short b) {
+        return (short)(a | b);
+    }
+
+    static short scalar_and(short a, short b) {
+        return (short)(a & b);
+    }
+
+    static short scalar_xor(short a, short b) {
+        return (short)(a ^ b);
+    }
+
+    static short scalar_add(short a, short b) {
+        return (short)(a + b);
+    }
+
+    static short scalar_sub(short a, short b) {
+        return (short)(a - b);
+    }
+
+    static short scalar_mul(short a, short b) {
+        return (short)(a * b);
+    }
+
+    static short scalar_min(short a, short b) {
+        return (short)(Math.min(a, b));
+    }
+
+    static short scalar_max(short a, short b) {
+        return (short)(Math.max(a, b));
+    }
+
+    static short scalar_div(short a, short b) {
+        return (short)(a / b);
+    }
+
+    static short scalar_fma(short a, short b, short c) {
+        return (short)(Math.fma(a, b, c));
+    }
+
+    static short scalar_abs(short a) {
+        return (short)(Math.abs(a));
+    }
+
+    static short scalar_neg(short a) {
+        return ((short)-a);
+    }
+
+
     static boolean ult(short a, short b) {
         return Short.compareUnsigned(a, b) < 0;
     }
@@ -1581,9 +1634,6 @@ public class ShortVector512Tests extends AbstractVectorTest {
         return Short.compareUnsigned(a, b) >= 0;
     }
 
-    static short firstNonZero(short a, short b) {
-        return Short.compare(a, (short) 0) != 0 ? a : b;
-    }
 
     @Test
     static void smokeTest1() {
@@ -1692,7 +1742,7 @@ public class ShortVector512Tests extends AbstractVectorTest {
     }
 
     static short ADD(short a, short b) {
-        return (short)(a + b);
+        return (short)(scalar_add(a, b));
     }
 
     @Test(dataProvider = "shortBinaryOpProvider")
@@ -1713,7 +1763,7 @@ public class ShortVector512Tests extends AbstractVectorTest {
     }
 
     static short add(short a, short b) {
-        return (short)(a + b);
+        return (short)(scalar_add(a, b));
     }
 
     @Test(dataProvider = "shortBinaryOpProvider")
@@ -1770,7 +1820,7 @@ public class ShortVector512Tests extends AbstractVectorTest {
     }
 
     static short SUB(short a, short b) {
-        return (short)(a - b);
+        return (short)(scalar_sub(a, b));
     }
 
     @Test(dataProvider = "shortBinaryOpProvider")
@@ -1791,7 +1841,7 @@ public class ShortVector512Tests extends AbstractVectorTest {
     }
 
     static short sub(short a, short b) {
-        return (short)(a - b);
+        return (short)(scalar_sub(a, b));
     }
 
     @Test(dataProvider = "shortBinaryOpProvider")
@@ -1848,7 +1898,7 @@ public class ShortVector512Tests extends AbstractVectorTest {
     }
 
     static short MUL(short a, short b) {
-        return (short)(a * b);
+        return (short)(scalar_mul(a, b));
     }
 
     @Test(dataProvider = "shortBinaryOpProvider")
@@ -1869,7 +1919,7 @@ public class ShortVector512Tests extends AbstractVectorTest {
     }
 
     static short mul(short a, short b) {
-        return (short)(a * b);
+        return (short)(scalar_mul(a, b));
     }
 
     @Test(dataProvider = "shortBinaryOpProvider")
@@ -2016,7 +2066,7 @@ public class ShortVector512Tests extends AbstractVectorTest {
     }
 
     static short FIRST_NONZERO(short a, short b) {
-        return (short)((a)!=0?a:b);
+        return (short)(firstNonZero(a, b));
     }
 
     @Test(dataProvider = "shortBinaryOpProvider")
@@ -3230,7 +3280,7 @@ public class ShortVector512Tests extends AbstractVectorTest {
     }
 
     static short MIN(short a, short b) {
-        return (short)(Math.min(a, b));
+        return (short)(scalar_min(a, b));
     }
 
     @Test(dataProvider = "shortBinaryOpProvider")
@@ -3251,7 +3301,7 @@ public class ShortVector512Tests extends AbstractVectorTest {
     }
 
     static short min(short a, short b) {
-        return (short)(Math.min(a, b));
+        return (short)(scalar_min(a, b));
     }
 
     @Test(dataProvider = "shortBinaryOpProvider")
@@ -3270,7 +3320,7 @@ public class ShortVector512Tests extends AbstractVectorTest {
     }
 
     static short MAX(short a, short b) {
-        return (short)(Math.max(a, b));
+        return (short)(scalar_max(a, b));
     }
 
     @Test(dataProvider = "shortBinaryOpProvider")
@@ -3291,7 +3341,7 @@ public class ShortVector512Tests extends AbstractVectorTest {
     }
 
     static short max(short a, short b) {
-        return (short)(Math.max(a, b));
+        return (short)(scalar_max(a, b));
     }
 
     @Test(dataProvider = "shortBinaryOpProvider")
@@ -3659,7 +3709,7 @@ public class ShortVector512Tests extends AbstractVectorTest {
     static short ANDReduce(short[] a, int idx) {
         short res = AND_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res &= a[i];
+            res = scalar_and(res, a[i]);
         }
 
         return res;
@@ -3668,7 +3718,7 @@ public class ShortVector512Tests extends AbstractVectorTest {
     static short ANDReduceAll(short[] a) {
         short res = AND_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res &= ANDReduce(a, i);
+            res = scalar_and(res, ANDReduce(a, i));
         }
 
         return res;
@@ -3686,7 +3736,7 @@ public class ShortVector512Tests extends AbstractVectorTest {
                 ShortVector av = ShortVector.fromArray(SPECIES, a, i);
                 short v = av.reduceLanes(VectorOperators.AND);
                 r[i] = v;
-                ra &= v;
+                ra = scalar_and(ra, v);
             }
         }
 
@@ -3699,20 +3749,20 @@ public class ShortVector512Tests extends AbstractVectorTest {
         short[] a = fa.apply(SPECIES.length());
         short id = AND_IDENTITY;
 
-        assertEquals((short) (id & id), id,
+        assertEquals((short) (scalar_and(id, id)), id,
                             "AND(AND_IDENTITY, AND_IDENTITY) != AND_IDENTITY");
 
         short x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((short) (id & x), x);
-                assertEquals((short) (x & id), x);
+                assertEquals((short) (scalar_and(id, x)), x);
+                assertEquals((short) (scalar_and(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((short) (id & x), x,
+            assertEquals((short) (scalar_and(id, x)), x,
                                 "AND(AND_IDENTITY, " + x + ") != " + x);
-            assertEquals((short) (x & id), x,
+            assertEquals((short) (scalar_and(x, id)), x,
                                 "AND(" + x + ", AND_IDENTITY) != " + x);
         }
     }
@@ -3721,7 +3771,7 @@ public class ShortVector512Tests extends AbstractVectorTest {
         short res = AND_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res &= a[i];
+                res = scalar_and(res, a[i]);
         }
 
         return res;
@@ -3730,7 +3780,7 @@ public class ShortVector512Tests extends AbstractVectorTest {
     static short ANDReduceAllMasked(short[] a, boolean[] mask) {
         short res = AND_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res &= ANDReduceMasked(a, i, mask);
+            res = scalar_and(res, ANDReduceMasked(a, i, mask));
         }
 
         return res;
@@ -3750,7 +3800,7 @@ public class ShortVector512Tests extends AbstractVectorTest {
                 ShortVector av = ShortVector.fromArray(SPECIES, a, i);
                 short v = av.reduceLanes(VectorOperators.AND, vmask);
                 r[i] = v;
-                ra &= v;
+                ra = scalar_and(ra, v);
             }
         }
 
@@ -3761,7 +3811,7 @@ public class ShortVector512Tests extends AbstractVectorTest {
     static short ORReduce(short[] a, int idx) {
         short res = OR_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res |= a[i];
+            res = scalar_or(res, a[i]);
         }
 
         return res;
@@ -3770,7 +3820,7 @@ public class ShortVector512Tests extends AbstractVectorTest {
     static short ORReduceAll(short[] a) {
         short res = OR_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res |= ORReduce(a, i);
+            res = scalar_or(res, ORReduce(a, i));
         }
 
         return res;
@@ -3788,7 +3838,7 @@ public class ShortVector512Tests extends AbstractVectorTest {
                 ShortVector av = ShortVector.fromArray(SPECIES, a, i);
                 short v = av.reduceLanes(VectorOperators.OR);
                 r[i] = v;
-                ra |= v;
+                ra = scalar_or(ra, v);
             }
         }
 
@@ -3801,20 +3851,20 @@ public class ShortVector512Tests extends AbstractVectorTest {
         short[] a = fa.apply(SPECIES.length());
         short id = OR_IDENTITY;
 
-        assertEquals((short) (id | id), id,
+        assertEquals((short) (scalar_or(id, id)), id,
                             "OR(OR_IDENTITY, OR_IDENTITY) != OR_IDENTITY");
 
         short x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((short) (id | x), x);
-                assertEquals((short) (x | id), x);
+                assertEquals((short) (scalar_or(id, x)), x);
+                assertEquals((short) (scalar_or(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((short) (id | x), x,
+            assertEquals((short) (scalar_or(id, x)), x,
                                 "OR(OR_IDENTITY, " + x + ") != " + x);
-            assertEquals((short) (x | id), x,
+            assertEquals((short) (scalar_or(x, id)), x,
                                 "OR(" + x + ", OR_IDENTITY) != " + x);
         }
     }
@@ -3823,7 +3873,7 @@ public class ShortVector512Tests extends AbstractVectorTest {
         short res = OR_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res |= a[i];
+                res = scalar_or(res, a[i]);
         }
 
         return res;
@@ -3832,7 +3882,7 @@ public class ShortVector512Tests extends AbstractVectorTest {
     static short ORReduceAllMasked(short[] a, boolean[] mask) {
         short res = OR_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res |= ORReduceMasked(a, i, mask);
+            res = scalar_or(res, ORReduceMasked(a, i, mask));
         }
 
         return res;
@@ -3852,7 +3902,7 @@ public class ShortVector512Tests extends AbstractVectorTest {
                 ShortVector av = ShortVector.fromArray(SPECIES, a, i);
                 short v = av.reduceLanes(VectorOperators.OR, vmask);
                 r[i] = v;
-                ra |= v;
+                ra = scalar_or(ra, v);
             }
         }
 
@@ -3863,7 +3913,7 @@ public class ShortVector512Tests extends AbstractVectorTest {
     static short XORReduce(short[] a, int idx) {
         short res = XOR_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res ^= a[i];
+            res = scalar_xor(res, a[i]);
         }
 
         return res;
@@ -3872,7 +3922,7 @@ public class ShortVector512Tests extends AbstractVectorTest {
     static short XORReduceAll(short[] a) {
         short res = XOR_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res ^= XORReduce(a, i);
+            res = scalar_xor(res, XORReduce(a, i));
         }
 
         return res;
@@ -3890,7 +3940,7 @@ public class ShortVector512Tests extends AbstractVectorTest {
                 ShortVector av = ShortVector.fromArray(SPECIES, a, i);
                 short v = av.reduceLanes(VectorOperators.XOR);
                 r[i] = v;
-                ra ^= v;
+                ra = scalar_xor(ra, v);
             }
         }
 
@@ -3903,20 +3953,20 @@ public class ShortVector512Tests extends AbstractVectorTest {
         short[] a = fa.apply(SPECIES.length());
         short id = XOR_IDENTITY;
 
-        assertEquals((short) (id ^ id), id,
+        assertEquals((short) (scalar_xor(id, id)), id,
                             "XOR(XOR_IDENTITY, XOR_IDENTITY) != XOR_IDENTITY");
 
         short x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((short) (id ^ x), x);
-                assertEquals((short) (x ^ id), x);
+                assertEquals((short) (scalar_xor(id, x)), x);
+                assertEquals((short) (scalar_xor(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((short) (id ^ x), x,
+            assertEquals((short) (scalar_xor(id, x)), x,
                                 "XOR(XOR_IDENTITY, " + x + ") != " + x);
-            assertEquals((short) (x ^ id), x,
+            assertEquals((short) (scalar_xor(x, id)), x,
                                 "XOR(" + x + ", XOR_IDENTITY) != " + x);
         }
     }
@@ -3925,7 +3975,7 @@ public class ShortVector512Tests extends AbstractVectorTest {
         short res = XOR_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res ^= a[i];
+                res = scalar_xor(res, a[i]);
         }
 
         return res;
@@ -3934,7 +3984,7 @@ public class ShortVector512Tests extends AbstractVectorTest {
     static short XORReduceAllMasked(short[] a, boolean[] mask) {
         short res = XOR_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res ^= XORReduceMasked(a, i, mask);
+            res = scalar_xor(res, XORReduceMasked(a, i, mask));
         }
 
         return res;
@@ -3954,7 +4004,7 @@ public class ShortVector512Tests extends AbstractVectorTest {
                 ShortVector av = ShortVector.fromArray(SPECIES, a, i);
                 short v = av.reduceLanes(VectorOperators.XOR, vmask);
                 r[i] = v;
-                ra ^= v;
+                ra = scalar_xor(ra, v);
             }
         }
 
@@ -3965,7 +4015,7 @@ public class ShortVector512Tests extends AbstractVectorTest {
     static short ADDReduce(short[] a, int idx) {
         short res = ADD_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res += a[i];
+            res = scalar_add(res, a[i]);
         }
 
         return res;
@@ -3974,7 +4024,7 @@ public class ShortVector512Tests extends AbstractVectorTest {
     static short ADDReduceAll(short[] a) {
         short res = ADD_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduce(a, i);
+            res = scalar_add(res, ADDReduce(a, i));
         }
 
         return res;
@@ -3992,7 +4042,7 @@ public class ShortVector512Tests extends AbstractVectorTest {
                 ShortVector av = ShortVector.fromArray(SPECIES, a, i);
                 short v = av.reduceLanes(VectorOperators.ADD);
                 r[i] = v;
-                ra += v;
+                ra = scalar_add(ra, v);
             }
         }
 
@@ -4005,20 +4055,20 @@ public class ShortVector512Tests extends AbstractVectorTest {
         short[] a = fa.apply(SPECIES.length());
         short id = ADD_IDENTITY;
 
-        assertEquals((short) (id + id), id,
+        assertEquals((short) (scalar_add(id, id)), id,
                             "ADD(ADD_IDENTITY, ADD_IDENTITY) != ADD_IDENTITY");
 
         short x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((short) (id + x), x);
-                assertEquals((short) (x + id), x);
+                assertEquals((short) (scalar_add(id, x)), x);
+                assertEquals((short) (scalar_add(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((short) (id + x), x,
+            assertEquals((short) (scalar_add(id, x)), x,
                                 "ADD(ADD_IDENTITY, " + x + ") != " + x);
-            assertEquals((short) (x + id), x,
+            assertEquals((short) (scalar_add(x, id)), x,
                                 "ADD(" + x + ", ADD_IDENTITY) != " + x);
         }
     }
@@ -4027,7 +4077,7 @@ public class ShortVector512Tests extends AbstractVectorTest {
         short res = ADD_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res += a[i];
+                res = scalar_add(res, a[i]);
         }
 
         return res;
@@ -4036,7 +4086,7 @@ public class ShortVector512Tests extends AbstractVectorTest {
     static short ADDReduceAllMasked(short[] a, boolean[] mask) {
         short res = ADD_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduceMasked(a, i, mask);
+            res = scalar_add(res, ADDReduceMasked(a, i, mask));
         }
 
         return res;
@@ -4056,7 +4106,7 @@ public class ShortVector512Tests extends AbstractVectorTest {
                 ShortVector av = ShortVector.fromArray(SPECIES, a, i);
                 short v = av.reduceLanes(VectorOperators.ADD, vmask);
                 r[i] = v;
-                ra += v;
+                ra = scalar_add(ra, v);
             }
         }
 
@@ -4067,7 +4117,7 @@ public class ShortVector512Tests extends AbstractVectorTest {
     static short MULReduce(short[] a, int idx) {
         short res = MUL_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res *= a[i];
+            res = scalar_mul(res, a[i]);
         }
 
         return res;
@@ -4076,7 +4126,7 @@ public class ShortVector512Tests extends AbstractVectorTest {
     static short MULReduceAll(short[] a) {
         short res = MUL_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res *= MULReduce(a, i);
+            res = scalar_mul(res, MULReduce(a, i));
         }
 
         return res;
@@ -4094,7 +4144,7 @@ public class ShortVector512Tests extends AbstractVectorTest {
                 ShortVector av = ShortVector.fromArray(SPECIES, a, i);
                 short v = av.reduceLanes(VectorOperators.MUL);
                 r[i] = v;
-                ra *= v;
+                ra = scalar_mul(ra, v);
             }
         }
 
@@ -4107,20 +4157,20 @@ public class ShortVector512Tests extends AbstractVectorTest {
         short[] a = fa.apply(SPECIES.length());
         short id = MUL_IDENTITY;
 
-        assertEquals((short) (id * id), id,
+        assertEquals((short) (scalar_mul(id, id)), id,
                             "MUL(MUL_IDENTITY, MUL_IDENTITY) != MUL_IDENTITY");
 
         short x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((short) (id * x), x);
-                assertEquals((short) (x * id), x);
+                assertEquals((short) (scalar_mul(id, x)), x);
+                assertEquals((short) (scalar_mul(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((short) (id * x), x,
+            assertEquals((short) (scalar_mul(id, x)), x,
                                 "MUL(MUL_IDENTITY, " + x + ") != " + x);
-            assertEquals((short) (x * id), x,
+            assertEquals((short) (scalar_mul(x, id)), x,
                                 "MUL(" + x + ", MUL_IDENTITY) != " + x);
         }
     }
@@ -4129,7 +4179,7 @@ public class ShortVector512Tests extends AbstractVectorTest {
         short res = MUL_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res *= a[i];
+                res = scalar_mul(res, a[i]);
         }
 
         return res;
@@ -4138,7 +4188,7 @@ public class ShortVector512Tests extends AbstractVectorTest {
     static short MULReduceAllMasked(short[] a, boolean[] mask) {
         short res = MUL_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res *= MULReduceMasked(a, i, mask);
+            res = scalar_mul(res, MULReduceMasked(a, i, mask));
         }
 
         return res;
@@ -4158,7 +4208,7 @@ public class ShortVector512Tests extends AbstractVectorTest {
                 ShortVector av = ShortVector.fromArray(SPECIES, a, i);
                 short v = av.reduceLanes(VectorOperators.MUL, vmask);
                 r[i] = v;
-                ra *= v;
+                ra = scalar_mul(ra, v);
             }
         }
 
@@ -4169,7 +4219,7 @@ public class ShortVector512Tests extends AbstractVectorTest {
     static short MINReduce(short[] a, int idx) {
         short res = MIN_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res = (short) Math.min(res, a[i]);
+            res = scalar_min(res, a[i]);
         }
 
         return res;
@@ -4178,7 +4228,7 @@ public class ShortVector512Tests extends AbstractVectorTest {
     static short MINReduceAll(short[] a) {
         short res = MIN_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (short) Math.min(res, MINReduce(a, i));
+            res = scalar_min(res, MINReduce(a, i));
         }
 
         return res;
@@ -4196,7 +4246,7 @@ public class ShortVector512Tests extends AbstractVectorTest {
                 ShortVector av = ShortVector.fromArray(SPECIES, a, i);
                 short v = av.reduceLanes(VectorOperators.MIN);
                 r[i] = v;
-                ra = (short) Math.min(ra, v);
+                ra = scalar_min(ra, v);
             }
         }
 
@@ -4209,20 +4259,20 @@ public class ShortVector512Tests extends AbstractVectorTest {
         short[] a = fa.apply(SPECIES.length());
         short id = MIN_IDENTITY;
 
-        assertEquals((short) Math.min(id, id), id,
+        assertEquals(scalar_min(id, id), id,
                             "MIN(MIN_IDENTITY, MIN_IDENTITY) != MIN_IDENTITY");
 
         short x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((short) Math.min(id, x), x);
-                assertEquals((short) Math.min(x, id), x);
+                assertEquals(scalar_min(id, x), x);
+                assertEquals(scalar_min(x, id), x);
             }
         } catch (AssertionError e) {
-            assertEquals((short) Math.min(id, x), x,
+            assertEquals(scalar_min(id, x), x,
                                 "MIN(MIN_IDENTITY, " + x + ") != " + x);
-            assertEquals((short) Math.min(x, id), x,
+            assertEquals(scalar_min(x, id), x,
                                 "MIN(" + x + ", MIN_IDENTITY) != " + x);
         }
     }
@@ -4231,7 +4281,7 @@ public class ShortVector512Tests extends AbstractVectorTest {
         short res = MIN_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res = (short) Math.min(res, a[i]);
+                res = scalar_min(res, a[i]);
         }
 
         return res;
@@ -4240,7 +4290,7 @@ public class ShortVector512Tests extends AbstractVectorTest {
     static short MINReduceAllMasked(short[] a, boolean[] mask) {
         short res = MIN_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (short) Math.min(res, MINReduceMasked(a, i, mask));
+            res = scalar_min(res, MINReduceMasked(a, i, mask));
         }
 
         return res;
@@ -4260,7 +4310,7 @@ public class ShortVector512Tests extends AbstractVectorTest {
                 ShortVector av = ShortVector.fromArray(SPECIES, a, i);
                 short v = av.reduceLanes(VectorOperators.MIN, vmask);
                 r[i] = v;
-                ra = (short) Math.min(ra, v);
+                ra = scalar_min(ra, v);
             }
         }
 
@@ -4271,7 +4321,7 @@ public class ShortVector512Tests extends AbstractVectorTest {
     static short MAXReduce(short[] a, int idx) {
         short res = MAX_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res = (short) Math.max(res, a[i]);
+            res = scalar_max(res, a[i]);
         }
 
         return res;
@@ -4280,7 +4330,7 @@ public class ShortVector512Tests extends AbstractVectorTest {
     static short MAXReduceAll(short[] a) {
         short res = MAX_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (short) Math.max(res, MAXReduce(a, i));
+            res = scalar_max(res, MAXReduce(a, i));
         }
 
         return res;
@@ -4298,7 +4348,7 @@ public class ShortVector512Tests extends AbstractVectorTest {
                 ShortVector av = ShortVector.fromArray(SPECIES, a, i);
                 short v = av.reduceLanes(VectorOperators.MAX);
                 r[i] = v;
-                ra = (short) Math.max(ra, v);
+                ra = scalar_max(ra, v);
             }
         }
 
@@ -4311,20 +4361,20 @@ public class ShortVector512Tests extends AbstractVectorTest {
         short[] a = fa.apply(SPECIES.length());
         short id = MAX_IDENTITY;
 
-        assertEquals((short) Math.max(id, id), id,
+        assertEquals(scalar_max(id, id), id,
                             "MAX(MAX_IDENTITY, MAX_IDENTITY) != MAX_IDENTITY");
 
         short x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((short) Math.max(id, x), x);
-                assertEquals((short) Math.max(x, id), x);
+                assertEquals(scalar_max(id, x), x);
+                assertEquals(scalar_max(x, id), x);
             }
         } catch (AssertionError e) {
-            assertEquals((short) Math.max(id, x), x,
+            assertEquals(scalar_max(id, x), x,
                                 "MAX(MAX_IDENTITY, " + x + ") != " + x);
-            assertEquals((short) Math.max(x, id), x,
+            assertEquals(scalar_max(x, id), x,
                                 "MAX(" + x + ", MAX_IDENTITY) != " + x);
         }
     }
@@ -4333,7 +4383,7 @@ public class ShortVector512Tests extends AbstractVectorTest {
         short res = MAX_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res = (short) Math.max(res, a[i]);
+                res = scalar_max(res, a[i]);
         }
 
         return res;
@@ -4342,7 +4392,7 @@ public class ShortVector512Tests extends AbstractVectorTest {
     static short MAXReduceAllMasked(short[] a, boolean[] mask) {
         short res = MAX_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (short) Math.max(res, MAXReduceMasked(a, i, mask));
+            res = scalar_max(res, MAXReduceMasked(a, i, mask));
         }
 
         return res;
@@ -4362,7 +4412,7 @@ public class ShortVector512Tests extends AbstractVectorTest {
                 ShortVector av = ShortVector.fromArray(SPECIES, a, i);
                 short v = av.reduceLanes(VectorOperators.MAX, vmask);
                 r[i] = v;
-                ra = (short) Math.max(ra, v);
+                ra = scalar_max(ra, v);
             }
         }
 
@@ -5395,7 +5445,7 @@ public class ShortVector512Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] < b[i]);
+                assertEquals(mv.laneIsSet(j), lt(a[i + j], b[i]));
             }
         }
     }
@@ -5415,7 +5465,7 @@ public class ShortVector512Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] < b[i]));
+                assertEquals(mv.laneIsSet(j), mask[j] && (lt(a[i + j], b[i])));
             }
         }
     }
@@ -5431,7 +5481,7 @@ public class ShortVector512Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] < (short)((long)b[i]));
+                assertEquals(mv.laneIsSet(j), lt(a[i + j], (short)((long)b[i])));
             }
         }
     }
@@ -5451,7 +5501,7 @@ public class ShortVector512Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] < (short)((long)b[i])));
+                assertEquals(mv.laneIsSet(j), mask[j] && (lt(a[i + j], (short)((long)b[i]))));
             }
         }
     }
@@ -5467,7 +5517,7 @@ public class ShortVector512Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] == b[i]);
+                assertEquals(mv.laneIsSet(j), eq(a[i + j], b[i]));
             }
         }
     }
@@ -5487,7 +5537,7 @@ public class ShortVector512Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] == b[i]));
+                assertEquals(mv.laneIsSet(j), mask[j] && (eq(a[i + j], b[i])));
             }
         }
     }
@@ -5503,7 +5553,7 @@ public class ShortVector512Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] == (short)((long)b[i]));
+                assertEquals(mv.laneIsSet(j), eq(a[i + j], (short)((long)b[i])));
             }
         }
     }
@@ -5523,7 +5573,7 @@ public class ShortVector512Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] == (short)((long)b[i])));
+                assertEquals(mv.laneIsSet(j), mask[j] && (eq(a[i + j], (short)((long)b[i]))));
             }
         }
     }
@@ -6235,11 +6285,11 @@ public class ShortVector512Tests extends AbstractVectorTest {
     }
 
     static short NEG(short a) {
-        return (short)(-((short)a));
+        return (short)(scalar_neg((short)a));
     }
 
     static short neg(short a) {
-        return (short)(-((short)a));
+        return (short)(scalar_neg((short)a));
     }
 
     @Test(dataProvider = "shortUnaryOpProvider")
@@ -6291,11 +6341,11 @@ public class ShortVector512Tests extends AbstractVectorTest {
     }
 
     static short ABS(short a) {
-        return (short)(Math.abs((short)a));
+        return (short)(scalar_abs((short)a));
     }
 
     static short abs(short a) {
-        return (short)(Math.abs((short)a));
+        return (short)(scalar_abs((short)a));
     }
 
     @Test(dataProvider = "shortUnaryOpProvider")
@@ -6786,7 +6836,7 @@ public class ShortVector512Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] < b[i]);
+                assertEquals(mv.laneIsSet(j), lt(a[i + j], b[i]));
             }
         }
     }
@@ -6802,7 +6852,7 @@ public class ShortVector512Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] == b[i]);
+                assertEquals(mv.laneIsSet(j), eq(a[i + j], b[i]));
             }
         }
     }
@@ -6871,7 +6921,7 @@ public class ShortVector512Tests extends AbstractVectorTest {
     static long ADDReduceLong(short[] a, int idx) {
         short res = 0;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res += a[i];
+            res = scalar_add(res, a[i]);
         }
 
         return (long)res;
@@ -6880,7 +6930,7 @@ public class ShortVector512Tests extends AbstractVectorTest {
     static long ADDReduceAllLong(short[] a) {
         long res = 0;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduceLong(a, i);
+            res = (long)scalar_add((short)res, (short)ADDReduceLong(a, i));
         }
 
         return res;
@@ -6898,8 +6948,8 @@ public class ShortVector512Tests extends AbstractVectorTest {
         }
 
         ra = 0;
-        for (int i = 0; i < a.length; i ++) {
-            ra += r[i];
+        for (int i = 0; i < a.length; i++) {
+            ra = (long)scalar_add((short)ra, (short)r[i]);
         }
 
         assertReductionLongArraysEquals(r, ra, a,
@@ -6909,8 +6959,9 @@ public class ShortVector512Tests extends AbstractVectorTest {
     static long ADDReduceLongMasked(short[] a, int idx, boolean[] mask) {
         short res = 0;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            if(mask[i % SPECIES.length()])
-                res += a[i];
+            if (mask[i % SPECIES.length()]) {
+                res = scalar_add(res, a[i]);
+            }
         }
 
         return (long)res;
@@ -6919,7 +6970,7 @@ public class ShortVector512Tests extends AbstractVectorTest {
     static long ADDReduceAllLongMasked(short[] a, boolean[] mask) {
         long res = 0;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduceLongMasked(a, i, mask);
+            res = (long)scalar_add((short)res, (short)ADDReduceLongMasked(a, i, mask));
         }
 
         return res;
@@ -6939,8 +6990,8 @@ public class ShortVector512Tests extends AbstractVectorTest {
         }
 
         ra = 0;
-        for (int i = 0; i < a.length; i ++) {
-            ra += r[i];
+        for (int i = 0; i < a.length; i++) {
+            ra = (long)scalar_add((short)ra, (short)r[i]);
         }
 
         assertReductionLongArraysEqualsMasked(r, ra, a, mask,
diff --git a/test/jdk/jdk/incubator/vector/ShortVector64Tests.java b/test/jdk/jdk/incubator/vector/ShortVector64Tests.java
index dd9f7125853..5f84682f02f 100644
--- a/test/jdk/jdk/incubator/vector/ShortVector64Tests.java
+++ b/test/jdk/jdk/incubator/vector/ShortVector64Tests.java
@@ -1565,6 +1565,59 @@ public class ShortVector64Tests extends AbstractVectorTest {
         return a >= b;
     }
 
+    static short firstNonZero(short a, short b) {
+        return Short.compare(a, (short) 0) != 0 ? a : b;
+    }
+
+    static short scalar_or(short a, short b) {
+        return (short)(a | b);
+    }
+
+    static short scalar_and(short a, short b) {
+        return (short)(a & b);
+    }
+
+    static short scalar_xor(short a, short b) {
+        return (short)(a ^ b);
+    }
+
+    static short scalar_add(short a, short b) {
+        return (short)(a + b);
+    }
+
+    static short scalar_sub(short a, short b) {
+        return (short)(a - b);
+    }
+
+    static short scalar_mul(short a, short b) {
+        return (short)(a * b);
+    }
+
+    static short scalar_min(short a, short b) {
+        return (short)(Math.min(a, b));
+    }
+
+    static short scalar_max(short a, short b) {
+        return (short)(Math.max(a, b));
+    }
+
+    static short scalar_div(short a, short b) {
+        return (short)(a / b);
+    }
+
+    static short scalar_fma(short a, short b, short c) {
+        return (short)(Math.fma(a, b, c));
+    }
+
+    static short scalar_abs(short a) {
+        return (short)(Math.abs(a));
+    }
+
+    static short scalar_neg(short a) {
+        return ((short)-a);
+    }
+
+
     static boolean ult(short a, short b) {
         return Short.compareUnsigned(a, b) < 0;
     }
@@ -1581,9 +1634,6 @@ public class ShortVector64Tests extends AbstractVectorTest {
         return Short.compareUnsigned(a, b) >= 0;
     }
 
-    static short firstNonZero(short a, short b) {
-        return Short.compare(a, (short) 0) != 0 ? a : b;
-    }
 
     @Test
     static void smokeTest1() {
@@ -1692,7 +1742,7 @@ public class ShortVector64Tests extends AbstractVectorTest {
     }
 
     static short ADD(short a, short b) {
-        return (short)(a + b);
+        return (short)(scalar_add(a, b));
     }
 
     @Test(dataProvider = "shortBinaryOpProvider")
@@ -1713,7 +1763,7 @@ public class ShortVector64Tests extends AbstractVectorTest {
     }
 
     static short add(short a, short b) {
-        return (short)(a + b);
+        return (short)(scalar_add(a, b));
     }
 
     @Test(dataProvider = "shortBinaryOpProvider")
@@ -1770,7 +1820,7 @@ public class ShortVector64Tests extends AbstractVectorTest {
     }
 
     static short SUB(short a, short b) {
-        return (short)(a - b);
+        return (short)(scalar_sub(a, b));
     }
 
     @Test(dataProvider = "shortBinaryOpProvider")
@@ -1791,7 +1841,7 @@ public class ShortVector64Tests extends AbstractVectorTest {
     }
 
     static short sub(short a, short b) {
-        return (short)(a - b);
+        return (short)(scalar_sub(a, b));
     }
 
     @Test(dataProvider = "shortBinaryOpProvider")
@@ -1848,7 +1898,7 @@ public class ShortVector64Tests extends AbstractVectorTest {
     }
 
     static short MUL(short a, short b) {
-        return (short)(a * b);
+        return (short)(scalar_mul(a, b));
     }
 
     @Test(dataProvider = "shortBinaryOpProvider")
@@ -1869,7 +1919,7 @@ public class ShortVector64Tests extends AbstractVectorTest {
     }
 
     static short mul(short a, short b) {
-        return (short)(a * b);
+        return (short)(scalar_mul(a, b));
     }
 
     @Test(dataProvider = "shortBinaryOpProvider")
@@ -2016,7 +2066,7 @@ public class ShortVector64Tests extends AbstractVectorTest {
     }
 
     static short FIRST_NONZERO(short a, short b) {
-        return (short)((a)!=0?a:b);
+        return (short)(firstNonZero(a, b));
     }
 
     @Test(dataProvider = "shortBinaryOpProvider")
@@ -3230,7 +3280,7 @@ public class ShortVector64Tests extends AbstractVectorTest {
     }
 
     static short MIN(short a, short b) {
-        return (short)(Math.min(a, b));
+        return (short)(scalar_min(a, b));
     }
 
     @Test(dataProvider = "shortBinaryOpProvider")
@@ -3251,7 +3301,7 @@ public class ShortVector64Tests extends AbstractVectorTest {
     }
 
     static short min(short a, short b) {
-        return (short)(Math.min(a, b));
+        return (short)(scalar_min(a, b));
     }
 
     @Test(dataProvider = "shortBinaryOpProvider")
@@ -3270,7 +3320,7 @@ public class ShortVector64Tests extends AbstractVectorTest {
     }
 
     static short MAX(short a, short b) {
-        return (short)(Math.max(a, b));
+        return (short)(scalar_max(a, b));
     }
 
     @Test(dataProvider = "shortBinaryOpProvider")
@@ -3291,7 +3341,7 @@ public class ShortVector64Tests extends AbstractVectorTest {
     }
 
     static short max(short a, short b) {
-        return (short)(Math.max(a, b));
+        return (short)(scalar_max(a, b));
     }
 
     @Test(dataProvider = "shortBinaryOpProvider")
@@ -3659,7 +3709,7 @@ public class ShortVector64Tests extends AbstractVectorTest {
     static short ANDReduce(short[] a, int idx) {
         short res = AND_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res &= a[i];
+            res = scalar_and(res, a[i]);
         }
 
         return res;
@@ -3668,7 +3718,7 @@ public class ShortVector64Tests extends AbstractVectorTest {
     static short ANDReduceAll(short[] a) {
         short res = AND_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res &= ANDReduce(a, i);
+            res = scalar_and(res, ANDReduce(a, i));
         }
 
         return res;
@@ -3686,7 +3736,7 @@ public class ShortVector64Tests extends AbstractVectorTest {
                 ShortVector av = ShortVector.fromArray(SPECIES, a, i);
                 short v = av.reduceLanes(VectorOperators.AND);
                 r[i] = v;
-                ra &= v;
+                ra = scalar_and(ra, v);
             }
         }
 
@@ -3699,20 +3749,20 @@ public class ShortVector64Tests extends AbstractVectorTest {
         short[] a = fa.apply(SPECIES.length());
         short id = AND_IDENTITY;
 
-        assertEquals((short) (id & id), id,
+        assertEquals((short) (scalar_and(id, id)), id,
                             "AND(AND_IDENTITY, AND_IDENTITY) != AND_IDENTITY");
 
         short x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((short) (id & x), x);
-                assertEquals((short) (x & id), x);
+                assertEquals((short) (scalar_and(id, x)), x);
+                assertEquals((short) (scalar_and(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((short) (id & x), x,
+            assertEquals((short) (scalar_and(id, x)), x,
                                 "AND(AND_IDENTITY, " + x + ") != " + x);
-            assertEquals((short) (x & id), x,
+            assertEquals((short) (scalar_and(x, id)), x,
                                 "AND(" + x + ", AND_IDENTITY) != " + x);
         }
     }
@@ -3721,7 +3771,7 @@ public class ShortVector64Tests extends AbstractVectorTest {
         short res = AND_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res &= a[i];
+                res = scalar_and(res, a[i]);
         }
 
         return res;
@@ -3730,7 +3780,7 @@ public class ShortVector64Tests extends AbstractVectorTest {
     static short ANDReduceAllMasked(short[] a, boolean[] mask) {
         short res = AND_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res &= ANDReduceMasked(a, i, mask);
+            res = scalar_and(res, ANDReduceMasked(a, i, mask));
         }
 
         return res;
@@ -3750,7 +3800,7 @@ public class ShortVector64Tests extends AbstractVectorTest {
                 ShortVector av = ShortVector.fromArray(SPECIES, a, i);
                 short v = av.reduceLanes(VectorOperators.AND, vmask);
                 r[i] = v;
-                ra &= v;
+                ra = scalar_and(ra, v);
             }
         }
 
@@ -3761,7 +3811,7 @@ public class ShortVector64Tests extends AbstractVectorTest {
     static short ORReduce(short[] a, int idx) {
         short res = OR_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res |= a[i];
+            res = scalar_or(res, a[i]);
         }
 
         return res;
@@ -3770,7 +3820,7 @@ public class ShortVector64Tests extends AbstractVectorTest {
     static short ORReduceAll(short[] a) {
         short res = OR_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res |= ORReduce(a, i);
+            res = scalar_or(res, ORReduce(a, i));
         }
 
         return res;
@@ -3788,7 +3838,7 @@ public class ShortVector64Tests extends AbstractVectorTest {
                 ShortVector av = ShortVector.fromArray(SPECIES, a, i);
                 short v = av.reduceLanes(VectorOperators.OR);
                 r[i] = v;
-                ra |= v;
+                ra = scalar_or(ra, v);
             }
         }
 
@@ -3801,20 +3851,20 @@ public class ShortVector64Tests extends AbstractVectorTest {
         short[] a = fa.apply(SPECIES.length());
         short id = OR_IDENTITY;
 
-        assertEquals((short) (id | id), id,
+        assertEquals((short) (scalar_or(id, id)), id,
                             "OR(OR_IDENTITY, OR_IDENTITY) != OR_IDENTITY");
 
         short x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((short) (id | x), x);
-                assertEquals((short) (x | id), x);
+                assertEquals((short) (scalar_or(id, x)), x);
+                assertEquals((short) (scalar_or(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((short) (id | x), x,
+            assertEquals((short) (scalar_or(id, x)), x,
                                 "OR(OR_IDENTITY, " + x + ") != " + x);
-            assertEquals((short) (x | id), x,
+            assertEquals((short) (scalar_or(x, id)), x,
                                 "OR(" + x + ", OR_IDENTITY) != " + x);
         }
     }
@@ -3823,7 +3873,7 @@ public class ShortVector64Tests extends AbstractVectorTest {
         short res = OR_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res |= a[i];
+                res = scalar_or(res, a[i]);
         }
 
         return res;
@@ -3832,7 +3882,7 @@ public class ShortVector64Tests extends AbstractVectorTest {
     static short ORReduceAllMasked(short[] a, boolean[] mask) {
         short res = OR_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res |= ORReduceMasked(a, i, mask);
+            res = scalar_or(res, ORReduceMasked(a, i, mask));
         }
 
         return res;
@@ -3852,7 +3902,7 @@ public class ShortVector64Tests extends AbstractVectorTest {
                 ShortVector av = ShortVector.fromArray(SPECIES, a, i);
                 short v = av.reduceLanes(VectorOperators.OR, vmask);
                 r[i] = v;
-                ra |= v;
+                ra = scalar_or(ra, v);
             }
         }
 
@@ -3863,7 +3913,7 @@ public class ShortVector64Tests extends AbstractVectorTest {
     static short XORReduce(short[] a, int idx) {
         short res = XOR_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res ^= a[i];
+            res = scalar_xor(res, a[i]);
         }
 
         return res;
@@ -3872,7 +3922,7 @@ public class ShortVector64Tests extends AbstractVectorTest {
     static short XORReduceAll(short[] a) {
         short res = XOR_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res ^= XORReduce(a, i);
+            res = scalar_xor(res, XORReduce(a, i));
         }
 
         return res;
@@ -3890,7 +3940,7 @@ public class ShortVector64Tests extends AbstractVectorTest {
                 ShortVector av = ShortVector.fromArray(SPECIES, a, i);
                 short v = av.reduceLanes(VectorOperators.XOR);
                 r[i] = v;
-                ra ^= v;
+                ra = scalar_xor(ra, v);
             }
         }
 
@@ -3903,20 +3953,20 @@ public class ShortVector64Tests extends AbstractVectorTest {
         short[] a = fa.apply(SPECIES.length());
         short id = XOR_IDENTITY;
 
-        assertEquals((short) (id ^ id), id,
+        assertEquals((short) (scalar_xor(id, id)), id,
                             "XOR(XOR_IDENTITY, XOR_IDENTITY) != XOR_IDENTITY");
 
         short x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((short) (id ^ x), x);
-                assertEquals((short) (x ^ id), x);
+                assertEquals((short) (scalar_xor(id, x)), x);
+                assertEquals((short) (scalar_xor(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((short) (id ^ x), x,
+            assertEquals((short) (scalar_xor(id, x)), x,
                                 "XOR(XOR_IDENTITY, " + x + ") != " + x);
-            assertEquals((short) (x ^ id), x,
+            assertEquals((short) (scalar_xor(x, id)), x,
                                 "XOR(" + x + ", XOR_IDENTITY) != " + x);
         }
     }
@@ -3925,7 +3975,7 @@ public class ShortVector64Tests extends AbstractVectorTest {
         short res = XOR_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res ^= a[i];
+                res = scalar_xor(res, a[i]);
         }
 
         return res;
@@ -3934,7 +3984,7 @@ public class ShortVector64Tests extends AbstractVectorTest {
     static short XORReduceAllMasked(short[] a, boolean[] mask) {
         short res = XOR_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res ^= XORReduceMasked(a, i, mask);
+            res = scalar_xor(res, XORReduceMasked(a, i, mask));
         }
 
         return res;
@@ -3954,7 +4004,7 @@ public class ShortVector64Tests extends AbstractVectorTest {
                 ShortVector av = ShortVector.fromArray(SPECIES, a, i);
                 short v = av.reduceLanes(VectorOperators.XOR, vmask);
                 r[i] = v;
-                ra ^= v;
+                ra = scalar_xor(ra, v);
             }
         }
 
@@ -3965,7 +4015,7 @@ public class ShortVector64Tests extends AbstractVectorTest {
     static short ADDReduce(short[] a, int idx) {
         short res = ADD_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res += a[i];
+            res = scalar_add(res, a[i]);
         }
 
         return res;
@@ -3974,7 +4024,7 @@ public class ShortVector64Tests extends AbstractVectorTest {
     static short ADDReduceAll(short[] a) {
         short res = ADD_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduce(a, i);
+            res = scalar_add(res, ADDReduce(a, i));
         }
 
         return res;
@@ -3992,7 +4042,7 @@ public class ShortVector64Tests extends AbstractVectorTest {
                 ShortVector av = ShortVector.fromArray(SPECIES, a, i);
                 short v = av.reduceLanes(VectorOperators.ADD);
                 r[i] = v;
-                ra += v;
+                ra = scalar_add(ra, v);
             }
         }
 
@@ -4005,20 +4055,20 @@ public class ShortVector64Tests extends AbstractVectorTest {
         short[] a = fa.apply(SPECIES.length());
         short id = ADD_IDENTITY;
 
-        assertEquals((short) (id + id), id,
+        assertEquals((short) (scalar_add(id, id)), id,
                             "ADD(ADD_IDENTITY, ADD_IDENTITY) != ADD_IDENTITY");
 
         short x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((short) (id + x), x);
-                assertEquals((short) (x + id), x);
+                assertEquals((short) (scalar_add(id, x)), x);
+                assertEquals((short) (scalar_add(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((short) (id + x), x,
+            assertEquals((short) (scalar_add(id, x)), x,
                                 "ADD(ADD_IDENTITY, " + x + ") != " + x);
-            assertEquals((short) (x + id), x,
+            assertEquals((short) (scalar_add(x, id)), x,
                                 "ADD(" + x + ", ADD_IDENTITY) != " + x);
         }
     }
@@ -4027,7 +4077,7 @@ public class ShortVector64Tests extends AbstractVectorTest {
         short res = ADD_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res += a[i];
+                res = scalar_add(res, a[i]);
         }
 
         return res;
@@ -4036,7 +4086,7 @@ public class ShortVector64Tests extends AbstractVectorTest {
     static short ADDReduceAllMasked(short[] a, boolean[] mask) {
         short res = ADD_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduceMasked(a, i, mask);
+            res = scalar_add(res, ADDReduceMasked(a, i, mask));
         }
 
         return res;
@@ -4056,7 +4106,7 @@ public class ShortVector64Tests extends AbstractVectorTest {
                 ShortVector av = ShortVector.fromArray(SPECIES, a, i);
                 short v = av.reduceLanes(VectorOperators.ADD, vmask);
                 r[i] = v;
-                ra += v;
+                ra = scalar_add(ra, v);
             }
         }
 
@@ -4067,7 +4117,7 @@ public class ShortVector64Tests extends AbstractVectorTest {
     static short MULReduce(short[] a, int idx) {
         short res = MUL_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res *= a[i];
+            res = scalar_mul(res, a[i]);
         }
 
         return res;
@@ -4076,7 +4126,7 @@ public class ShortVector64Tests extends AbstractVectorTest {
     static short MULReduceAll(short[] a) {
         short res = MUL_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res *= MULReduce(a, i);
+            res = scalar_mul(res, MULReduce(a, i));
         }
 
         return res;
@@ -4094,7 +4144,7 @@ public class ShortVector64Tests extends AbstractVectorTest {
                 ShortVector av = ShortVector.fromArray(SPECIES, a, i);
                 short v = av.reduceLanes(VectorOperators.MUL);
                 r[i] = v;
-                ra *= v;
+                ra = scalar_mul(ra, v);
             }
         }
 
@@ -4107,20 +4157,20 @@ public class ShortVector64Tests extends AbstractVectorTest {
         short[] a = fa.apply(SPECIES.length());
         short id = MUL_IDENTITY;
 
-        assertEquals((short) (id * id), id,
+        assertEquals((short) (scalar_mul(id, id)), id,
                             "MUL(MUL_IDENTITY, MUL_IDENTITY) != MUL_IDENTITY");
 
         short x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((short) (id * x), x);
-                assertEquals((short) (x * id), x);
+                assertEquals((short) (scalar_mul(id, x)), x);
+                assertEquals((short) (scalar_mul(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((short) (id * x), x,
+            assertEquals((short) (scalar_mul(id, x)), x,
                                 "MUL(MUL_IDENTITY, " + x + ") != " + x);
-            assertEquals((short) (x * id), x,
+            assertEquals((short) (scalar_mul(x, id)), x,
                                 "MUL(" + x + ", MUL_IDENTITY) != " + x);
         }
     }
@@ -4129,7 +4179,7 @@ public class ShortVector64Tests extends AbstractVectorTest {
         short res = MUL_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res *= a[i];
+                res = scalar_mul(res, a[i]);
         }
 
         return res;
@@ -4138,7 +4188,7 @@ public class ShortVector64Tests extends AbstractVectorTest {
     static short MULReduceAllMasked(short[] a, boolean[] mask) {
         short res = MUL_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res *= MULReduceMasked(a, i, mask);
+            res = scalar_mul(res, MULReduceMasked(a, i, mask));
         }
 
         return res;
@@ -4158,7 +4208,7 @@ public class ShortVector64Tests extends AbstractVectorTest {
                 ShortVector av = ShortVector.fromArray(SPECIES, a, i);
                 short v = av.reduceLanes(VectorOperators.MUL, vmask);
                 r[i] = v;
-                ra *= v;
+                ra = scalar_mul(ra, v);
             }
         }
 
@@ -4169,7 +4219,7 @@ public class ShortVector64Tests extends AbstractVectorTest {
     static short MINReduce(short[] a, int idx) {
         short res = MIN_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res = (short) Math.min(res, a[i]);
+            res = scalar_min(res, a[i]);
         }
 
         return res;
@@ -4178,7 +4228,7 @@ public class ShortVector64Tests extends AbstractVectorTest {
     static short MINReduceAll(short[] a) {
         short res = MIN_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (short) Math.min(res, MINReduce(a, i));
+            res = scalar_min(res, MINReduce(a, i));
         }
 
         return res;
@@ -4196,7 +4246,7 @@ public class ShortVector64Tests extends AbstractVectorTest {
                 ShortVector av = ShortVector.fromArray(SPECIES, a, i);
                 short v = av.reduceLanes(VectorOperators.MIN);
                 r[i] = v;
-                ra = (short) Math.min(ra, v);
+                ra = scalar_min(ra, v);
             }
         }
 
@@ -4209,20 +4259,20 @@ public class ShortVector64Tests extends AbstractVectorTest {
         short[] a = fa.apply(SPECIES.length());
         short id = MIN_IDENTITY;
 
-        assertEquals((short) Math.min(id, id), id,
+        assertEquals(scalar_min(id, id), id,
                             "MIN(MIN_IDENTITY, MIN_IDENTITY) != MIN_IDENTITY");
 
         short x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((short) Math.min(id, x), x);
-                assertEquals((short) Math.min(x, id), x);
+                assertEquals(scalar_min(id, x), x);
+                assertEquals(scalar_min(x, id), x);
             }
         } catch (AssertionError e) {
-            assertEquals((short) Math.min(id, x), x,
+            assertEquals(scalar_min(id, x), x,
                                 "MIN(MIN_IDENTITY, " + x + ") != " + x);
-            assertEquals((short) Math.min(x, id), x,
+            assertEquals(scalar_min(x, id), x,
                                 "MIN(" + x + ", MIN_IDENTITY) != " + x);
         }
     }
@@ -4231,7 +4281,7 @@ public class ShortVector64Tests extends AbstractVectorTest {
         short res = MIN_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res = (short) Math.min(res, a[i]);
+                res = scalar_min(res, a[i]);
         }
 
         return res;
@@ -4240,7 +4290,7 @@ public class ShortVector64Tests extends AbstractVectorTest {
     static short MINReduceAllMasked(short[] a, boolean[] mask) {
         short res = MIN_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (short) Math.min(res, MINReduceMasked(a, i, mask));
+            res = scalar_min(res, MINReduceMasked(a, i, mask));
         }
 
         return res;
@@ -4260,7 +4310,7 @@ public class ShortVector64Tests extends AbstractVectorTest {
                 ShortVector av = ShortVector.fromArray(SPECIES, a, i);
                 short v = av.reduceLanes(VectorOperators.MIN, vmask);
                 r[i] = v;
-                ra = (short) Math.min(ra, v);
+                ra = scalar_min(ra, v);
             }
         }
 
@@ -4271,7 +4321,7 @@ public class ShortVector64Tests extends AbstractVectorTest {
     static short MAXReduce(short[] a, int idx) {
         short res = MAX_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res = (short) Math.max(res, a[i]);
+            res = scalar_max(res, a[i]);
         }
 
         return res;
@@ -4280,7 +4330,7 @@ public class ShortVector64Tests extends AbstractVectorTest {
     static short MAXReduceAll(short[] a) {
         short res = MAX_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (short) Math.max(res, MAXReduce(a, i));
+            res = scalar_max(res, MAXReduce(a, i));
         }
 
         return res;
@@ -4298,7 +4348,7 @@ public class ShortVector64Tests extends AbstractVectorTest {
                 ShortVector av = ShortVector.fromArray(SPECIES, a, i);
                 short v = av.reduceLanes(VectorOperators.MAX);
                 r[i] = v;
-                ra = (short) Math.max(ra, v);
+                ra = scalar_max(ra, v);
             }
         }
 
@@ -4311,20 +4361,20 @@ public class ShortVector64Tests extends AbstractVectorTest {
         short[] a = fa.apply(SPECIES.length());
         short id = MAX_IDENTITY;
 
-        assertEquals((short) Math.max(id, id), id,
+        assertEquals(scalar_max(id, id), id,
                             "MAX(MAX_IDENTITY, MAX_IDENTITY) != MAX_IDENTITY");
 
         short x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((short) Math.max(id, x), x);
-                assertEquals((short) Math.max(x, id), x);
+                assertEquals(scalar_max(id, x), x);
+                assertEquals(scalar_max(x, id), x);
             }
         } catch (AssertionError e) {
-            assertEquals((short) Math.max(id, x), x,
+            assertEquals(scalar_max(id, x), x,
                                 "MAX(MAX_IDENTITY, " + x + ") != " + x);
-            assertEquals((short) Math.max(x, id), x,
+            assertEquals(scalar_max(x, id), x,
                                 "MAX(" + x + ", MAX_IDENTITY) != " + x);
         }
     }
@@ -4333,7 +4383,7 @@ public class ShortVector64Tests extends AbstractVectorTest {
         short res = MAX_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res = (short) Math.max(res, a[i]);
+                res = scalar_max(res, a[i]);
         }
 
         return res;
@@ -4342,7 +4392,7 @@ public class ShortVector64Tests extends AbstractVectorTest {
     static short MAXReduceAllMasked(short[] a, boolean[] mask) {
         short res = MAX_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (short) Math.max(res, MAXReduceMasked(a, i, mask));
+            res = scalar_max(res, MAXReduceMasked(a, i, mask));
         }
 
         return res;
@@ -4362,7 +4412,7 @@ public class ShortVector64Tests extends AbstractVectorTest {
                 ShortVector av = ShortVector.fromArray(SPECIES, a, i);
                 short v = av.reduceLanes(VectorOperators.MAX, vmask);
                 r[i] = v;
-                ra = (short) Math.max(ra, v);
+                ra = scalar_max(ra, v);
             }
         }
 
@@ -5395,7 +5445,7 @@ public class ShortVector64Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] < b[i]);
+                assertEquals(mv.laneIsSet(j), lt(a[i + j], b[i]));
             }
         }
     }
@@ -5415,7 +5465,7 @@ public class ShortVector64Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] < b[i]));
+                assertEquals(mv.laneIsSet(j), mask[j] && (lt(a[i + j], b[i])));
             }
         }
     }
@@ -5431,7 +5481,7 @@ public class ShortVector64Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] < (short)((long)b[i]));
+                assertEquals(mv.laneIsSet(j), lt(a[i + j], (short)((long)b[i])));
             }
         }
     }
@@ -5451,7 +5501,7 @@ public class ShortVector64Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] < (short)((long)b[i])));
+                assertEquals(mv.laneIsSet(j), mask[j] && (lt(a[i + j], (short)((long)b[i]))));
             }
         }
     }
@@ -5467,7 +5517,7 @@ public class ShortVector64Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] == b[i]);
+                assertEquals(mv.laneIsSet(j), eq(a[i + j], b[i]));
             }
         }
     }
@@ -5487,7 +5537,7 @@ public class ShortVector64Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] == b[i]));
+                assertEquals(mv.laneIsSet(j), mask[j] && (eq(a[i + j], b[i])));
             }
         }
     }
@@ -5503,7 +5553,7 @@ public class ShortVector64Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] == (short)((long)b[i]));
+                assertEquals(mv.laneIsSet(j), eq(a[i + j], (short)((long)b[i])));
             }
         }
     }
@@ -5523,7 +5573,7 @@ public class ShortVector64Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] == (short)((long)b[i])));
+                assertEquals(mv.laneIsSet(j), mask[j] && (eq(a[i + j], (short)((long)b[i]))));
             }
         }
     }
@@ -6235,11 +6285,11 @@ public class ShortVector64Tests extends AbstractVectorTest {
     }
 
     static short NEG(short a) {
-        return (short)(-((short)a));
+        return (short)(scalar_neg((short)a));
     }
 
     static short neg(short a) {
-        return (short)(-((short)a));
+        return (short)(scalar_neg((short)a));
     }
 
     @Test(dataProvider = "shortUnaryOpProvider")
@@ -6291,11 +6341,11 @@ public class ShortVector64Tests extends AbstractVectorTest {
     }
 
     static short ABS(short a) {
-        return (short)(Math.abs((short)a));
+        return (short)(scalar_abs((short)a));
     }
 
     static short abs(short a) {
-        return (short)(Math.abs((short)a));
+        return (short)(scalar_abs((short)a));
     }
 
     @Test(dataProvider = "shortUnaryOpProvider")
@@ -6786,7 +6836,7 @@ public class ShortVector64Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] < b[i]);
+                assertEquals(mv.laneIsSet(j), lt(a[i + j], b[i]));
             }
         }
     }
@@ -6802,7 +6852,7 @@ public class ShortVector64Tests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] == b[i]);
+                assertEquals(mv.laneIsSet(j), eq(a[i + j], b[i]));
             }
         }
     }
@@ -6871,7 +6921,7 @@ public class ShortVector64Tests extends AbstractVectorTest {
     static long ADDReduceLong(short[] a, int idx) {
         short res = 0;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res += a[i];
+            res = scalar_add(res, a[i]);
         }
 
         return (long)res;
@@ -6880,7 +6930,7 @@ public class ShortVector64Tests extends AbstractVectorTest {
     static long ADDReduceAllLong(short[] a) {
         long res = 0;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduceLong(a, i);
+            res = (long)scalar_add((short)res, (short)ADDReduceLong(a, i));
         }
 
         return res;
@@ -6898,8 +6948,8 @@ public class ShortVector64Tests extends AbstractVectorTest {
         }
 
         ra = 0;
-        for (int i = 0; i < a.length; i ++) {
-            ra += r[i];
+        for (int i = 0; i < a.length; i++) {
+            ra = (long)scalar_add((short)ra, (short)r[i]);
         }
 
         assertReductionLongArraysEquals(r, ra, a,
@@ -6909,8 +6959,9 @@ public class ShortVector64Tests extends AbstractVectorTest {
     static long ADDReduceLongMasked(short[] a, int idx, boolean[] mask) {
         short res = 0;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            if(mask[i % SPECIES.length()])
-                res += a[i];
+            if (mask[i % SPECIES.length()]) {
+                res = scalar_add(res, a[i]);
+            }
         }
 
         return (long)res;
@@ -6919,7 +6970,7 @@ public class ShortVector64Tests extends AbstractVectorTest {
     static long ADDReduceAllLongMasked(short[] a, boolean[] mask) {
         long res = 0;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduceLongMasked(a, i, mask);
+            res = (long)scalar_add((short)res, (short)ADDReduceLongMasked(a, i, mask));
         }
 
         return res;
@@ -6939,8 +6990,8 @@ public class ShortVector64Tests extends AbstractVectorTest {
         }
 
         ra = 0;
-        for (int i = 0; i < a.length; i ++) {
-            ra += r[i];
+        for (int i = 0; i < a.length; i++) {
+            ra = (long)scalar_add((short)ra, (short)r[i]);
         }
 
         assertReductionLongArraysEqualsMasked(r, ra, a, mask,
diff --git a/test/jdk/jdk/incubator/vector/ShortVectorMaxTests.java b/test/jdk/jdk/incubator/vector/ShortVectorMaxTests.java
index 65234fb3173..5451ad6c50e 100644
--- a/test/jdk/jdk/incubator/vector/ShortVectorMaxTests.java
+++ b/test/jdk/jdk/incubator/vector/ShortVectorMaxTests.java
@@ -1571,6 +1571,59 @@ public class ShortVectorMaxTests extends AbstractVectorTest {
         return a >= b;
     }
 
+    static short firstNonZero(short a, short b) {
+        return Short.compare(a, (short) 0) != 0 ? a : b;
+    }
+
+    static short scalar_or(short a, short b) {
+        return (short)(a | b);
+    }
+
+    static short scalar_and(short a, short b) {
+        return (short)(a & b);
+    }
+
+    static short scalar_xor(short a, short b) {
+        return (short)(a ^ b);
+    }
+
+    static short scalar_add(short a, short b) {
+        return (short)(a + b);
+    }
+
+    static short scalar_sub(short a, short b) {
+        return (short)(a - b);
+    }
+
+    static short scalar_mul(short a, short b) {
+        return (short)(a * b);
+    }
+
+    static short scalar_min(short a, short b) {
+        return (short)(Math.min(a, b));
+    }
+
+    static short scalar_max(short a, short b) {
+        return (short)(Math.max(a, b));
+    }
+
+    static short scalar_div(short a, short b) {
+        return (short)(a / b);
+    }
+
+    static short scalar_fma(short a, short b, short c) {
+        return (short)(Math.fma(a, b, c));
+    }
+
+    static short scalar_abs(short a) {
+        return (short)(Math.abs(a));
+    }
+
+    static short scalar_neg(short a) {
+        return ((short)-a);
+    }
+
+
     static boolean ult(short a, short b) {
         return Short.compareUnsigned(a, b) < 0;
     }
@@ -1587,9 +1640,6 @@ public class ShortVectorMaxTests extends AbstractVectorTest {
         return Short.compareUnsigned(a, b) >= 0;
     }
 
-    static short firstNonZero(short a, short b) {
-        return Short.compare(a, (short) 0) != 0 ? a : b;
-    }
 
     @Test
     static void smokeTest1() {
@@ -1698,7 +1748,7 @@ public class ShortVectorMaxTests extends AbstractVectorTest {
     }
 
     static short ADD(short a, short b) {
-        return (short)(a + b);
+        return (short)(scalar_add(a, b));
     }
 
     @Test(dataProvider = "shortBinaryOpProvider")
@@ -1719,7 +1769,7 @@ public class ShortVectorMaxTests extends AbstractVectorTest {
     }
 
     static short add(short a, short b) {
-        return (short)(a + b);
+        return (short)(scalar_add(a, b));
     }
 
     @Test(dataProvider = "shortBinaryOpProvider")
@@ -1776,7 +1826,7 @@ public class ShortVectorMaxTests extends AbstractVectorTest {
     }
 
     static short SUB(short a, short b) {
-        return (short)(a - b);
+        return (short)(scalar_sub(a, b));
     }
 
     @Test(dataProvider = "shortBinaryOpProvider")
@@ -1797,7 +1847,7 @@ public class ShortVectorMaxTests extends AbstractVectorTest {
     }
 
     static short sub(short a, short b) {
-        return (short)(a - b);
+        return (short)(scalar_sub(a, b));
     }
 
     @Test(dataProvider = "shortBinaryOpProvider")
@@ -1854,7 +1904,7 @@ public class ShortVectorMaxTests extends AbstractVectorTest {
     }
 
     static short MUL(short a, short b) {
-        return (short)(a * b);
+        return (short)(scalar_mul(a, b));
     }
 
     @Test(dataProvider = "shortBinaryOpProvider")
@@ -1875,7 +1925,7 @@ public class ShortVectorMaxTests extends AbstractVectorTest {
     }
 
     static short mul(short a, short b) {
-        return (short)(a * b);
+        return (short)(scalar_mul(a, b));
     }
 
     @Test(dataProvider = "shortBinaryOpProvider")
@@ -2022,7 +2072,7 @@ public class ShortVectorMaxTests extends AbstractVectorTest {
     }
 
     static short FIRST_NONZERO(short a, short b) {
-        return (short)((a)!=0?a:b);
+        return (short)(firstNonZero(a, b));
     }
 
     @Test(dataProvider = "shortBinaryOpProvider")
@@ -3236,7 +3286,7 @@ public class ShortVectorMaxTests extends AbstractVectorTest {
     }
 
     static short MIN(short a, short b) {
-        return (short)(Math.min(a, b));
+        return (short)(scalar_min(a, b));
     }
 
     @Test(dataProvider = "shortBinaryOpProvider")
@@ -3257,7 +3307,7 @@ public class ShortVectorMaxTests extends AbstractVectorTest {
     }
 
     static short min(short a, short b) {
-        return (short)(Math.min(a, b));
+        return (short)(scalar_min(a, b));
     }
 
     @Test(dataProvider = "shortBinaryOpProvider")
@@ -3276,7 +3326,7 @@ public class ShortVectorMaxTests extends AbstractVectorTest {
     }
 
     static short MAX(short a, short b) {
-        return (short)(Math.max(a, b));
+        return (short)(scalar_max(a, b));
     }
 
     @Test(dataProvider = "shortBinaryOpProvider")
@@ -3297,7 +3347,7 @@ public class ShortVectorMaxTests extends AbstractVectorTest {
     }
 
     static short max(short a, short b) {
-        return (short)(Math.max(a, b));
+        return (short)(scalar_max(a, b));
     }
 
     @Test(dataProvider = "shortBinaryOpProvider")
@@ -3665,7 +3715,7 @@ public class ShortVectorMaxTests extends AbstractVectorTest {
     static short ANDReduce(short[] a, int idx) {
         short res = AND_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res &= a[i];
+            res = scalar_and(res, a[i]);
         }
 
         return res;
@@ -3674,7 +3724,7 @@ public class ShortVectorMaxTests extends AbstractVectorTest {
     static short ANDReduceAll(short[] a) {
         short res = AND_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res &= ANDReduce(a, i);
+            res = scalar_and(res, ANDReduce(a, i));
         }
 
         return res;
@@ -3692,7 +3742,7 @@ public class ShortVectorMaxTests extends AbstractVectorTest {
                 ShortVector av = ShortVector.fromArray(SPECIES, a, i);
                 short v = av.reduceLanes(VectorOperators.AND);
                 r[i] = v;
-                ra &= v;
+                ra = scalar_and(ra, v);
             }
         }
 
@@ -3705,20 +3755,20 @@ public class ShortVectorMaxTests extends AbstractVectorTest {
         short[] a = fa.apply(SPECIES.length());
         short id = AND_IDENTITY;
 
-        assertEquals((short) (id & id), id,
+        assertEquals((short) (scalar_and(id, id)), id,
                             "AND(AND_IDENTITY, AND_IDENTITY) != AND_IDENTITY");
 
         short x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((short) (id & x), x);
-                assertEquals((short) (x & id), x);
+                assertEquals((short) (scalar_and(id, x)), x);
+                assertEquals((short) (scalar_and(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((short) (id & x), x,
+            assertEquals((short) (scalar_and(id, x)), x,
                                 "AND(AND_IDENTITY, " + x + ") != " + x);
-            assertEquals((short) (x & id), x,
+            assertEquals((short) (scalar_and(x, id)), x,
                                 "AND(" + x + ", AND_IDENTITY) != " + x);
         }
     }
@@ -3727,7 +3777,7 @@ public class ShortVectorMaxTests extends AbstractVectorTest {
         short res = AND_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res &= a[i];
+                res = scalar_and(res, a[i]);
         }
 
         return res;
@@ -3736,7 +3786,7 @@ public class ShortVectorMaxTests extends AbstractVectorTest {
     static short ANDReduceAllMasked(short[] a, boolean[] mask) {
         short res = AND_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res &= ANDReduceMasked(a, i, mask);
+            res = scalar_and(res, ANDReduceMasked(a, i, mask));
         }
 
         return res;
@@ -3756,7 +3806,7 @@ public class ShortVectorMaxTests extends AbstractVectorTest {
                 ShortVector av = ShortVector.fromArray(SPECIES, a, i);
                 short v = av.reduceLanes(VectorOperators.AND, vmask);
                 r[i] = v;
-                ra &= v;
+                ra = scalar_and(ra, v);
             }
         }
 
@@ -3767,7 +3817,7 @@ public class ShortVectorMaxTests extends AbstractVectorTest {
     static short ORReduce(short[] a, int idx) {
         short res = OR_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res |= a[i];
+            res = scalar_or(res, a[i]);
         }
 
         return res;
@@ -3776,7 +3826,7 @@ public class ShortVectorMaxTests extends AbstractVectorTest {
     static short ORReduceAll(short[] a) {
         short res = OR_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res |= ORReduce(a, i);
+            res = scalar_or(res, ORReduce(a, i));
         }
 
         return res;
@@ -3794,7 +3844,7 @@ public class ShortVectorMaxTests extends AbstractVectorTest {
                 ShortVector av = ShortVector.fromArray(SPECIES, a, i);
                 short v = av.reduceLanes(VectorOperators.OR);
                 r[i] = v;
-                ra |= v;
+                ra = scalar_or(ra, v);
             }
         }
 
@@ -3807,20 +3857,20 @@ public class ShortVectorMaxTests extends AbstractVectorTest {
         short[] a = fa.apply(SPECIES.length());
         short id = OR_IDENTITY;
 
-        assertEquals((short) (id | id), id,
+        assertEquals((short) (scalar_or(id, id)), id,
                             "OR(OR_IDENTITY, OR_IDENTITY) != OR_IDENTITY");
 
         short x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((short) (id | x), x);
-                assertEquals((short) (x | id), x);
+                assertEquals((short) (scalar_or(id, x)), x);
+                assertEquals((short) (scalar_or(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((short) (id | x), x,
+            assertEquals((short) (scalar_or(id, x)), x,
                                 "OR(OR_IDENTITY, " + x + ") != " + x);
-            assertEquals((short) (x | id), x,
+            assertEquals((short) (scalar_or(x, id)), x,
                                 "OR(" + x + ", OR_IDENTITY) != " + x);
         }
     }
@@ -3829,7 +3879,7 @@ public class ShortVectorMaxTests extends AbstractVectorTest {
         short res = OR_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res |= a[i];
+                res = scalar_or(res, a[i]);
         }
 
         return res;
@@ -3838,7 +3888,7 @@ public class ShortVectorMaxTests extends AbstractVectorTest {
     static short ORReduceAllMasked(short[] a, boolean[] mask) {
         short res = OR_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res |= ORReduceMasked(a, i, mask);
+            res = scalar_or(res, ORReduceMasked(a, i, mask));
         }
 
         return res;
@@ -3858,7 +3908,7 @@ public class ShortVectorMaxTests extends AbstractVectorTest {
                 ShortVector av = ShortVector.fromArray(SPECIES, a, i);
                 short v = av.reduceLanes(VectorOperators.OR, vmask);
                 r[i] = v;
-                ra |= v;
+                ra = scalar_or(ra, v);
             }
         }
 
@@ -3869,7 +3919,7 @@ public class ShortVectorMaxTests extends AbstractVectorTest {
     static short XORReduce(short[] a, int idx) {
         short res = XOR_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res ^= a[i];
+            res = scalar_xor(res, a[i]);
         }
 
         return res;
@@ -3878,7 +3928,7 @@ public class ShortVectorMaxTests extends AbstractVectorTest {
     static short XORReduceAll(short[] a) {
         short res = XOR_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res ^= XORReduce(a, i);
+            res = scalar_xor(res, XORReduce(a, i));
         }
 
         return res;
@@ -3896,7 +3946,7 @@ public class ShortVectorMaxTests extends AbstractVectorTest {
                 ShortVector av = ShortVector.fromArray(SPECIES, a, i);
                 short v = av.reduceLanes(VectorOperators.XOR);
                 r[i] = v;
-                ra ^= v;
+                ra = scalar_xor(ra, v);
             }
         }
 
@@ -3909,20 +3959,20 @@ public class ShortVectorMaxTests extends AbstractVectorTest {
         short[] a = fa.apply(SPECIES.length());
         short id = XOR_IDENTITY;
 
-        assertEquals((short) (id ^ id), id,
+        assertEquals((short) (scalar_xor(id, id)), id,
                             "XOR(XOR_IDENTITY, XOR_IDENTITY) != XOR_IDENTITY");
 
         short x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((short) (id ^ x), x);
-                assertEquals((short) (x ^ id), x);
+                assertEquals((short) (scalar_xor(id, x)), x);
+                assertEquals((short) (scalar_xor(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((short) (id ^ x), x,
+            assertEquals((short) (scalar_xor(id, x)), x,
                                 "XOR(XOR_IDENTITY, " + x + ") != " + x);
-            assertEquals((short) (x ^ id), x,
+            assertEquals((short) (scalar_xor(x, id)), x,
                                 "XOR(" + x + ", XOR_IDENTITY) != " + x);
         }
     }
@@ -3931,7 +3981,7 @@ public class ShortVectorMaxTests extends AbstractVectorTest {
         short res = XOR_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res ^= a[i];
+                res = scalar_xor(res, a[i]);
         }
 
         return res;
@@ -3940,7 +3990,7 @@ public class ShortVectorMaxTests extends AbstractVectorTest {
     static short XORReduceAllMasked(short[] a, boolean[] mask) {
         short res = XOR_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res ^= XORReduceMasked(a, i, mask);
+            res = scalar_xor(res, XORReduceMasked(a, i, mask));
         }
 
         return res;
@@ -3960,7 +4010,7 @@ public class ShortVectorMaxTests extends AbstractVectorTest {
                 ShortVector av = ShortVector.fromArray(SPECIES, a, i);
                 short v = av.reduceLanes(VectorOperators.XOR, vmask);
                 r[i] = v;
-                ra ^= v;
+                ra = scalar_xor(ra, v);
             }
         }
 
@@ -3971,7 +4021,7 @@ public class ShortVectorMaxTests extends AbstractVectorTest {
     static short ADDReduce(short[] a, int idx) {
         short res = ADD_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res += a[i];
+            res = scalar_add(res, a[i]);
         }
 
         return res;
@@ -3980,7 +4030,7 @@ public class ShortVectorMaxTests extends AbstractVectorTest {
     static short ADDReduceAll(short[] a) {
         short res = ADD_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduce(a, i);
+            res = scalar_add(res, ADDReduce(a, i));
         }
 
         return res;
@@ -3998,7 +4048,7 @@ public class ShortVectorMaxTests extends AbstractVectorTest {
                 ShortVector av = ShortVector.fromArray(SPECIES, a, i);
                 short v = av.reduceLanes(VectorOperators.ADD);
                 r[i] = v;
-                ra += v;
+                ra = scalar_add(ra, v);
             }
         }
 
@@ -4011,20 +4061,20 @@ public class ShortVectorMaxTests extends AbstractVectorTest {
         short[] a = fa.apply(SPECIES.length());
         short id = ADD_IDENTITY;
 
-        assertEquals((short) (id + id), id,
+        assertEquals((short) (scalar_add(id, id)), id,
                             "ADD(ADD_IDENTITY, ADD_IDENTITY) != ADD_IDENTITY");
 
         short x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((short) (id + x), x);
-                assertEquals((short) (x + id), x);
+                assertEquals((short) (scalar_add(id, x)), x);
+                assertEquals((short) (scalar_add(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((short) (id + x), x,
+            assertEquals((short) (scalar_add(id, x)), x,
                                 "ADD(ADD_IDENTITY, " + x + ") != " + x);
-            assertEquals((short) (x + id), x,
+            assertEquals((short) (scalar_add(x, id)), x,
                                 "ADD(" + x + ", ADD_IDENTITY) != " + x);
         }
     }
@@ -4033,7 +4083,7 @@ public class ShortVectorMaxTests extends AbstractVectorTest {
         short res = ADD_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res += a[i];
+                res = scalar_add(res, a[i]);
         }
 
         return res;
@@ -4042,7 +4092,7 @@ public class ShortVectorMaxTests extends AbstractVectorTest {
     static short ADDReduceAllMasked(short[] a, boolean[] mask) {
         short res = ADD_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduceMasked(a, i, mask);
+            res = scalar_add(res, ADDReduceMasked(a, i, mask));
         }
 
         return res;
@@ -4062,7 +4112,7 @@ public class ShortVectorMaxTests extends AbstractVectorTest {
                 ShortVector av = ShortVector.fromArray(SPECIES, a, i);
                 short v = av.reduceLanes(VectorOperators.ADD, vmask);
                 r[i] = v;
-                ra += v;
+                ra = scalar_add(ra, v);
             }
         }
 
@@ -4073,7 +4123,7 @@ public class ShortVectorMaxTests extends AbstractVectorTest {
     static short MULReduce(short[] a, int idx) {
         short res = MUL_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res *= a[i];
+            res = scalar_mul(res, a[i]);
         }
 
         return res;
@@ -4082,7 +4132,7 @@ public class ShortVectorMaxTests extends AbstractVectorTest {
     static short MULReduceAll(short[] a) {
         short res = MUL_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res *= MULReduce(a, i);
+            res = scalar_mul(res, MULReduce(a, i));
         }
 
         return res;
@@ -4100,7 +4150,7 @@ public class ShortVectorMaxTests extends AbstractVectorTest {
                 ShortVector av = ShortVector.fromArray(SPECIES, a, i);
                 short v = av.reduceLanes(VectorOperators.MUL);
                 r[i] = v;
-                ra *= v;
+                ra = scalar_mul(ra, v);
             }
         }
 
@@ -4113,20 +4163,20 @@ public class ShortVectorMaxTests extends AbstractVectorTest {
         short[] a = fa.apply(SPECIES.length());
         short id = MUL_IDENTITY;
 
-        assertEquals((short) (id * id), id,
+        assertEquals((short) (scalar_mul(id, id)), id,
                             "MUL(MUL_IDENTITY, MUL_IDENTITY) != MUL_IDENTITY");
 
         short x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((short) (id * x), x);
-                assertEquals((short) (x * id), x);
+                assertEquals((short) (scalar_mul(id, x)), x);
+                assertEquals((short) (scalar_mul(x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals((short) (id * x), x,
+            assertEquals((short) (scalar_mul(id, x)), x,
                                 "MUL(MUL_IDENTITY, " + x + ") != " + x);
-            assertEquals((short) (x * id), x,
+            assertEquals((short) (scalar_mul(x, id)), x,
                                 "MUL(" + x + ", MUL_IDENTITY) != " + x);
         }
     }
@@ -4135,7 +4185,7 @@ public class ShortVectorMaxTests extends AbstractVectorTest {
         short res = MUL_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res *= a[i];
+                res = scalar_mul(res, a[i]);
         }
 
         return res;
@@ -4144,7 +4194,7 @@ public class ShortVectorMaxTests extends AbstractVectorTest {
     static short MULReduceAllMasked(short[] a, boolean[] mask) {
         short res = MUL_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res *= MULReduceMasked(a, i, mask);
+            res = scalar_mul(res, MULReduceMasked(a, i, mask));
         }
 
         return res;
@@ -4164,7 +4214,7 @@ public class ShortVectorMaxTests extends AbstractVectorTest {
                 ShortVector av = ShortVector.fromArray(SPECIES, a, i);
                 short v = av.reduceLanes(VectorOperators.MUL, vmask);
                 r[i] = v;
-                ra *= v;
+                ra = scalar_mul(ra, v);
             }
         }
 
@@ -4175,7 +4225,7 @@ public class ShortVectorMaxTests extends AbstractVectorTest {
     static short MINReduce(short[] a, int idx) {
         short res = MIN_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res = (short) Math.min(res, a[i]);
+            res = scalar_min(res, a[i]);
         }
 
         return res;
@@ -4184,7 +4234,7 @@ public class ShortVectorMaxTests extends AbstractVectorTest {
     static short MINReduceAll(short[] a) {
         short res = MIN_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (short) Math.min(res, MINReduce(a, i));
+            res = scalar_min(res, MINReduce(a, i));
         }
 
         return res;
@@ -4202,7 +4252,7 @@ public class ShortVectorMaxTests extends AbstractVectorTest {
                 ShortVector av = ShortVector.fromArray(SPECIES, a, i);
                 short v = av.reduceLanes(VectorOperators.MIN);
                 r[i] = v;
-                ra = (short) Math.min(ra, v);
+                ra = scalar_min(ra, v);
             }
         }
 
@@ -4215,20 +4265,20 @@ public class ShortVectorMaxTests extends AbstractVectorTest {
         short[] a = fa.apply(SPECIES.length());
         short id = MIN_IDENTITY;
 
-        assertEquals((short) Math.min(id, id), id,
+        assertEquals(scalar_min(id, id), id,
                             "MIN(MIN_IDENTITY, MIN_IDENTITY) != MIN_IDENTITY");
 
         short x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((short) Math.min(id, x), x);
-                assertEquals((short) Math.min(x, id), x);
+                assertEquals(scalar_min(id, x), x);
+                assertEquals(scalar_min(x, id), x);
             }
         } catch (AssertionError e) {
-            assertEquals((short) Math.min(id, x), x,
+            assertEquals(scalar_min(id, x), x,
                                 "MIN(MIN_IDENTITY, " + x + ") != " + x);
-            assertEquals((short) Math.min(x, id), x,
+            assertEquals(scalar_min(x, id), x,
                                 "MIN(" + x + ", MIN_IDENTITY) != " + x);
         }
     }
@@ -4237,7 +4287,7 @@ public class ShortVectorMaxTests extends AbstractVectorTest {
         short res = MIN_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res = (short) Math.min(res, a[i]);
+                res = scalar_min(res, a[i]);
         }
 
         return res;
@@ -4246,7 +4296,7 @@ public class ShortVectorMaxTests extends AbstractVectorTest {
     static short MINReduceAllMasked(short[] a, boolean[] mask) {
         short res = MIN_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (short) Math.min(res, MINReduceMasked(a, i, mask));
+            res = scalar_min(res, MINReduceMasked(a, i, mask));
         }
 
         return res;
@@ -4266,7 +4316,7 @@ public class ShortVectorMaxTests extends AbstractVectorTest {
                 ShortVector av = ShortVector.fromArray(SPECIES, a, i);
                 short v = av.reduceLanes(VectorOperators.MIN, vmask);
                 r[i] = v;
-                ra = (short) Math.min(ra, v);
+                ra = scalar_min(ra, v);
             }
         }
 
@@ -4277,7 +4327,7 @@ public class ShortVectorMaxTests extends AbstractVectorTest {
     static short MAXReduce(short[] a, int idx) {
         short res = MAX_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res = (short) Math.max(res, a[i]);
+            res = scalar_max(res, a[i]);
         }
 
         return res;
@@ -4286,7 +4336,7 @@ public class ShortVectorMaxTests extends AbstractVectorTest {
     static short MAXReduceAll(short[] a) {
         short res = MAX_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (short) Math.max(res, MAXReduce(a, i));
+            res = scalar_max(res, MAXReduce(a, i));
         }
 
         return res;
@@ -4304,7 +4354,7 @@ public class ShortVectorMaxTests extends AbstractVectorTest {
                 ShortVector av = ShortVector.fromArray(SPECIES, a, i);
                 short v = av.reduceLanes(VectorOperators.MAX);
                 r[i] = v;
-                ra = (short) Math.max(ra, v);
+                ra = scalar_max(ra, v);
             }
         }
 
@@ -4317,20 +4367,20 @@ public class ShortVectorMaxTests extends AbstractVectorTest {
         short[] a = fa.apply(SPECIES.length());
         short id = MAX_IDENTITY;
 
-        assertEquals((short) Math.max(id, id), id,
+        assertEquals(scalar_max(id, id), id,
                             "MAX(MAX_IDENTITY, MAX_IDENTITY) != MAX_IDENTITY");
 
         short x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals((short) Math.max(id, x), x);
-                assertEquals((short) Math.max(x, id), x);
+                assertEquals(scalar_max(id, x), x);
+                assertEquals(scalar_max(x, id), x);
             }
         } catch (AssertionError e) {
-            assertEquals((short) Math.max(id, x), x,
+            assertEquals(scalar_max(id, x), x,
                                 "MAX(MAX_IDENTITY, " + x + ") != " + x);
-            assertEquals((short) Math.max(x, id), x,
+            assertEquals(scalar_max(x, id), x,
                                 "MAX(" + x + ", MAX_IDENTITY) != " + x);
         }
     }
@@ -4339,7 +4389,7 @@ public class ShortVectorMaxTests extends AbstractVectorTest {
         short res = MAX_IDENTITY;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res = (short) Math.max(res, a[i]);
+                res = scalar_max(res, a[i]);
         }
 
         return res;
@@ -4348,7 +4398,7 @@ public class ShortVectorMaxTests extends AbstractVectorTest {
     static short MAXReduceAllMasked(short[] a, boolean[] mask) {
         short res = MAX_IDENTITY;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res = (short) Math.max(res, MAXReduceMasked(a, i, mask));
+            res = scalar_max(res, MAXReduceMasked(a, i, mask));
         }
 
         return res;
@@ -4368,7 +4418,7 @@ public class ShortVectorMaxTests extends AbstractVectorTest {
                 ShortVector av = ShortVector.fromArray(SPECIES, a, i);
                 short v = av.reduceLanes(VectorOperators.MAX, vmask);
                 r[i] = v;
-                ra = (short) Math.max(ra, v);
+                ra = scalar_max(ra, v);
             }
         }
 
@@ -5401,7 +5451,7 @@ public class ShortVectorMaxTests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] < b[i]);
+                assertEquals(mv.laneIsSet(j), lt(a[i + j], b[i]));
             }
         }
     }
@@ -5421,7 +5471,7 @@ public class ShortVectorMaxTests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] < b[i]));
+                assertEquals(mv.laneIsSet(j), mask[j] && (lt(a[i + j], b[i])));
             }
         }
     }
@@ -5437,7 +5487,7 @@ public class ShortVectorMaxTests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] < (short)((long)b[i]));
+                assertEquals(mv.laneIsSet(j), lt(a[i + j], (short)((long)b[i])));
             }
         }
     }
@@ -5457,7 +5507,7 @@ public class ShortVectorMaxTests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] < (short)((long)b[i])));
+                assertEquals(mv.laneIsSet(j), mask[j] && (lt(a[i + j], (short)((long)b[i]))));
             }
         }
     }
@@ -5473,7 +5523,7 @@ public class ShortVectorMaxTests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] == b[i]);
+                assertEquals(mv.laneIsSet(j), eq(a[i + j], b[i]));
             }
         }
     }
@@ -5493,7 +5543,7 @@ public class ShortVectorMaxTests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] == b[i]));
+                assertEquals(mv.laneIsSet(j), mask[j] && (eq(a[i + j], b[i])));
             }
         }
     }
@@ -5509,7 +5559,7 @@ public class ShortVectorMaxTests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] == (short)((long)b[i]));
+                assertEquals(mv.laneIsSet(j), eq(a[i + j], (short)((long)b[i])));
             }
         }
     }
@@ -5529,7 +5579,7 @@ public class ShortVectorMaxTests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] == (short)((long)b[i])));
+                assertEquals(mv.laneIsSet(j), mask[j] && (eq(a[i + j], (short)((long)b[i]))));
             }
         }
     }
@@ -6241,11 +6291,11 @@ public class ShortVectorMaxTests extends AbstractVectorTest {
     }
 
     static short NEG(short a) {
-        return (short)(-((short)a));
+        return (short)(scalar_neg((short)a));
     }
 
     static short neg(short a) {
-        return (short)(-((short)a));
+        return (short)(scalar_neg((short)a));
     }
 
     @Test(dataProvider = "shortUnaryOpProvider")
@@ -6297,11 +6347,11 @@ public class ShortVectorMaxTests extends AbstractVectorTest {
     }
 
     static short ABS(short a) {
-        return (short)(Math.abs((short)a));
+        return (short)(scalar_abs((short)a));
     }
 
     static short abs(short a) {
-        return (short)(Math.abs((short)a));
+        return (short)(scalar_abs((short)a));
     }
 
     @Test(dataProvider = "shortUnaryOpProvider")
@@ -6792,7 +6842,7 @@ public class ShortVectorMaxTests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] < b[i]);
+                assertEquals(mv.laneIsSet(j), lt(a[i + j], b[i]));
             }
         }
     }
@@ -6808,7 +6858,7 @@ public class ShortVectorMaxTests extends AbstractVectorTest {
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] == b[i]);
+                assertEquals(mv.laneIsSet(j), eq(a[i + j], b[i]));
             }
         }
     }
@@ -6877,7 +6927,7 @@ public class ShortVectorMaxTests extends AbstractVectorTest {
     static long ADDReduceLong(short[] a, int idx) {
         short res = 0;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res += a[i];
+            res = scalar_add(res, a[i]);
         }
 
         return (long)res;
@@ -6886,7 +6936,7 @@ public class ShortVectorMaxTests extends AbstractVectorTest {
     static long ADDReduceAllLong(short[] a) {
         long res = 0;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduceLong(a, i);
+            res = (long)scalar_add((short)res, (short)ADDReduceLong(a, i));
         }
 
         return res;
@@ -6904,8 +6954,8 @@ public class ShortVectorMaxTests extends AbstractVectorTest {
         }
 
         ra = 0;
-        for (int i = 0; i < a.length; i ++) {
-            ra += r[i];
+        for (int i = 0; i < a.length; i++) {
+            ra = (long)scalar_add((short)ra, (short)r[i]);
         }
 
         assertReductionLongArraysEquals(r, ra, a,
@@ -6915,8 +6965,9 @@ public class ShortVectorMaxTests extends AbstractVectorTest {
     static long ADDReduceLongMasked(short[] a, int idx, boolean[] mask) {
         short res = 0;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            if(mask[i % SPECIES.length()])
-                res += a[i];
+            if (mask[i % SPECIES.length()]) {
+                res = scalar_add(res, a[i]);
+            }
         }
 
         return (long)res;
@@ -6925,7 +6976,7 @@ public class ShortVectorMaxTests extends AbstractVectorTest {
     static long ADDReduceAllLongMasked(short[] a, boolean[] mask) {
         long res = 0;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduceLongMasked(a, i, mask);
+            res = (long)scalar_add((short)res, (short)ADDReduceLongMasked(a, i, mask));
         }
 
         return res;
@@ -6945,8 +6996,8 @@ public class ShortVectorMaxTests extends AbstractVectorTest {
         }
 
         ra = 0;
-        for (int i = 0; i < a.length; i ++) {
-            ra += r[i];
+        for (int i = 0; i < a.length; i++) {
+            ra = (long)scalar_add((short)ra, (short)r[i]);
         }
 
         assertReductionLongArraysEqualsMasked(r, ra, a, mask,
diff --git a/test/jdk/jdk/incubator/vector/gen-template.sh b/test/jdk/jdk/incubator/vector/gen-template.sh
index d2528b13b78..4e961e2f2b0 100644
--- a/test/jdk/jdk/incubator/vector/gen-template.sh
+++ b/test/jdk/jdk/incubator/vector/gen-template.sh
@@ -383,6 +383,7 @@ function gen_bool_reduction_op {
   gen_op_tmpl $bool_reduction_scalar "$@"
   gen_op_tmpl $bool_reduction_template "$@"
 }
+
 function gen_saturating_reduction_op {
   echo "Generating saturating reduction op $1 ($2)..."
   gen_op_tmpl $reduction_scalar_func "$@"
@@ -434,13 +435,13 @@ fi
 
 # ALU binary ops.
 # Here "ADD+add+withMask" says VectorOperator name is "ADD", and we have a dedicate method too named 'add', and add() is also available with mask variant.
-gen_binary_alu_op "ADD+add+withMask" "a + b"
-gen_binary_alu_op "SUB+sub+withMask" "a - b"
-gen_binary_alu_op "MUL+mul+withMask" "a \* b"
-gen_binary_alu_op "DIV+div+withMask" "a \/ b" "FP"
+gen_binary_alu_op "ADD+add+withMask" "scalar_add(a, b)"
+gen_binary_alu_op "SUB+sub+withMask" "scalar_sub(a, b)"
+gen_binary_alu_op "MUL+mul+withMask" "scalar_mul(a, b)"
+gen_binary_alu_op "DIV+div+withMask" "scalar_div(a, b)" "FP"
 gen_op_tmpl "Binary-op_bitwise-div" "DIV+div+withMask" "a \/ b" "BITWISE"
 gen_op_tmpl "Binary-Masked-op_bitwise-div" "DIV+div+withMask" "a \/ b" "BITWISE"
-gen_binary_alu_op "FIRST_NONZERO" "{#if[FP]?Double.doubleToLongBits}(a)!=0?a:b"
+gen_binary_alu_op "FIRST_NONZERO" "firstNonZero(a, b)"
 gen_binary_alu_op "AND+and"   "a \& b"  "BITWISE"
 gen_binary_alu_op "AND_NOT" "a \& ~b" "BITWISE"
 gen_binary_alu_op "OR+or"    "a | b"   "BITWISE"
@@ -449,16 +450,16 @@ gen_binary_alu_op "XOR"   "a ^ b"   "BITWISE"
 gen_binary_alu_op "COMPRESS_BITS" "\$Boxtype\$.compress(a, b)" "intOrLong"
 gen_binary_alu_op "EXPAND_BITS" "\$Boxtype\$.expand(a, b)" "intOrLong"
 # Generate the broadcast versions
-gen_binary_alu_bcst_op "add+withMask" "a + b"
-gen_binary_alu_bcst_op "sub+withMask" "a - b"
-gen_binary_alu_bcst_op "mul+withMask" "a \* b"
-gen_binary_alu_bcst_op "div+withMask" "a \/ b" "FP"
+gen_binary_alu_bcst_op "add+withMask" "scalar_add(a, b)"
+gen_binary_alu_bcst_op "sub+withMask" "scalar_sub(a, b)"
+gen_binary_alu_bcst_op "mul+withMask" "scalar_mul(a, b)"
+gen_binary_alu_bcst_op "div+withMask" "scalar_div(a, b)" "FP"
 gen_op_tmpl "Binary-Broadcast-op_bitwise-div" "div+withMask" "a \/ b" "BITWISE"
 gen_op_tmpl "Binary-Broadcast-Masked-op_bitwise-div" "div+withMask" "a \/ b" "BITWISE"
 gen_binary_alu_bcst_op "OR+or"    "a | b"   "BITWISE"
 gen_binary_alu_bcst_op "AND+and"    "a \& b"   "BITWISE"
 gen_binary_alu_bcst_long_op "OR"     "a | b"   "BITWISE"
-gen_binary_alu_bcst_long_op "ADD"    "a + b"
+gen_binary_alu_bcst_long_op "ADD"    "scalar_add(a, b)"
 
 # Shifts
 gen_binary_alu_op "LSHL" "(a << b)" "intOrLong"
@@ -494,30 +495,30 @@ gen_shift_cst_op  "ROR" "ROR_scalar(a, CONST_SHIFT)" "BITWISE"
 gen_shift_cst_op  "ROL" "ROL_scalar(a, CONST_SHIFT)" "BITWISE"
 
 # Binary operation with one memory operand
-gen_binary_alu_mem_op "MIN+min+withMask", "Math.min(a, b)"
-gen_binary_alu_mem_op "MAX+max+withMask", "Math.max(a, b)"
+gen_binary_alu_mem_op "MIN+min+withMask", "scalar_min(a, b)"
+gen_binary_alu_mem_op "MAX+max+withMask", "scalar_max(a, b)"
 
 # Masked reductions.
-gen_binary_op_no_masked "MIN+min" "Math.min(a, b)"
-gen_binary_op_no_masked "MAX+max" "Math.max(a, b)"
+gen_binary_op_no_masked "MIN+min" "scalar_min(a, b)"
+gen_binary_op_no_masked "MAX+max" "scalar_max(a, b)"
 gen_binary_op "UMIN" "VectorMath.minUnsigned(a, b)" "BITWISE"
 gen_binary_op "UMAX" "VectorMath.maxUnsigned(a, b)" "BITWISE"
 gen_saturating_binary_op "SADD" "VectorMath.addSaturating(a, b)" "BITWISE"
 gen_saturating_binary_op "SSUB" "VectorMath.subSaturating(a, b)" "BITWISE"
 gen_saturating_binary_op "SUADD" "VectorMath.addSaturatingUnsigned(a, b)" "BITWISE"
 gen_saturating_binary_op "SUSUB" "VectorMath.subSaturatingUnsigned(a, b)" "BITWISE"
-gen_binary_bcst_op_no_masked "MIN+min" "Math.min(a, b)"
-gen_binary_bcst_op_no_masked "MAX+max" "Math.max(a, b)"
+gen_binary_bcst_op_no_masked "MIN+min" "scalar_min(a, b)"
+gen_binary_bcst_op_no_masked "MAX+max" "scalar_max(a, b)"
 gen_saturating_binary_op_associative "SUADD" "VectorMath.addSaturatingUnsigned(a, b)" "BITWISE"
 
 # Reductions.
-gen_reduction_op "AND" "\&" "BITWISE" "AND_IDENTITY"
-gen_reduction_op "OR" "|" "BITWISE" "OR_IDENTITY"
-gen_reduction_op "XOR" "^" "BITWISE" "XOR_IDENTITY"
-gen_reduction_op "ADD" "+" "" "ADD_IDENTITY"
-gen_reduction_op "MUL" "*" "" "MUL_IDENTITY"
-gen_reduction_op_func "MIN" "(\$type\$) Math.min" "" "MIN_IDENTITY"
-gen_reduction_op_func "MAX" "(\$type\$) Math.max" "" "MAX_IDENTITY"
+gen_reduction_op "AND" "scalar_and" "BITWISE" "AND_IDENTITY"
+gen_reduction_op "OR" "scalar_or" "BITWISE" "OR_IDENTITY"
+gen_reduction_op "XOR" "scalar_xor" "BITWISE" "XOR_IDENTITY"
+gen_reduction_op "ADD" "scalar_add" "" "ADD_IDENTITY"
+gen_reduction_op "MUL" "scalar_mul" "" "MUL_IDENTITY"
+gen_reduction_op_func "MIN" "scalar_min" "" "MIN_IDENTITY"
+gen_reduction_op_func "MAX" "scalar_max" "" "MAX_IDENTITY"
 gen_reduction_op_func "UMIN" "(\$type\$) VectorMath.minUnsigned" "BITWISE" "UMIN_IDENTITY"
 gen_reduction_op_func "UMAX" "(\$type\$) VectorMath.maxUnsigned" "BITWISE" "UMAX_IDENTITY"
 gen_reduction_op_func "FIRST_NONZERO" "firstNonZero" "" "FIRST_NONZERO_IDENTITY"
@@ -535,9 +536,9 @@ gen_with_op "withLane" "" "" ""
 # Tests
 gen_op_tmpl $test_template "IS_DEFAULT" "bits(a)==0"
 gen_op_tmpl $test_template "IS_NEGATIVE" "bits(a)<0"
-gen_op_tmpl $test_template "IS_FINITE" "\$Boxtype\$.isFinite(a)" "FP"
-gen_op_tmpl $test_template "IS_NAN" "\$Boxtype\$.isNaN(a)" "FP"
-gen_op_tmpl $test_template "IS_INFINITE" "\$Boxtype\$.isInfinite(a)" "FP"
+gen_op_tmpl $test_template "IS_FINITE" "isFinite(a)" "FP"
+gen_op_tmpl $test_template "IS_NAN" "isNaN(a)" "FP"
+gen_op_tmpl $test_template "IS_INFINITE" "isInfinite(a)" "FP"
 
 # Compares
 gen_compare_op "LT+lt" "lt"
@@ -553,8 +554,8 @@ gen_compare_op "ULE" "ule" "BITWISE"
 gen_compare_op "UGE" "uge" "BITWISE"
 
 
-gen_compare_bcst_op "LT" "<"
-gen_compare_bcst_op "EQ" "=="
+gen_compare_bcst_op "LT" "lt"
+gen_compare_bcst_op "EQ" "eq"
 
 # Blend.
 gen_op_tmpl $blend "blend" ""
@@ -585,28 +586,28 @@ gen_op_tmpl $unslice1_template "unsliceBinary" ""
 gen_op_tmpl $unslice1_masked_template "unslice" ""
 
 # Math
-gen_op_tmpl $unary_math_template "SIN" "Math.sin((double)a)" "FP"
-gen_op_tmpl $unary_math_template "EXP" "Math.exp((double)a)" "FP"
-gen_op_tmpl $unary_math_template "LOG1P" "Math.log1p((double)a)" "FP"
-gen_op_tmpl $unary_math_template "LOG" "Math.log((double)a)" "FP"
-gen_op_tmpl $unary_math_template "LOG10" "Math.log10((double)a)" "FP"
-gen_op_tmpl $unary_math_template "EXPM1" "Math.expm1((double)a)" "FP"
-gen_op_tmpl $unary_math_template "COS" "Math.cos((double)a)" "FP"
-gen_op_tmpl $unary_math_template "TAN" "Math.tan((double)a)" "FP"
-gen_op_tmpl $unary_math_template "SINH" "Math.sinh((double)a)" "FP"
-gen_op_tmpl $unary_math_template "COSH" "Math.cosh((double)a)" "FP"
-gen_op_tmpl $unary_math_template "TANH" "Math.tanh((double)a)" "FP"
-gen_op_tmpl $unary_math_template "ASIN" "Math.asin((double)a)" "FP"
-gen_op_tmpl $unary_math_template "ACOS" "Math.acos((double)a)" "FP"
-gen_op_tmpl $unary_math_template "ATAN" "Math.atan((double)a)" "FP"
-gen_op_tmpl $unary_math_template "CBRT" "Math.cbrt((double)a)" "FP"
-gen_op_tmpl $binary_math_template "HYPOT" "Math.hypot((double)a, (double)b)" "FP"
-gen_op_tmpl $binary_math_template "POW+pow" "Math.pow((double)a, (double)b)" "FP"
-gen_op_tmpl $binary_math_template "ATAN2" "Math.atan2((double)a, (double)b)" "FP"
-gen_op_tmpl $binary_math_broadcast_template "POW+pow" "Math.pow((double)a, (double)b)" "FP"
+gen_op_tmpl $unary_math_template "SIN" "scalar_sin(a)" "FP"
+gen_op_tmpl $unary_math_template "EXP" "scalar_exp(a)" "FP"
+gen_op_tmpl $unary_math_template "LOG1P" "scalar_log1p(a)" "FP"
+gen_op_tmpl $unary_math_template "LOG" "scalar_log(a)" "FP"
+gen_op_tmpl $unary_math_template "LOG10" "scalar_log10(a)" "FP"
+gen_op_tmpl $unary_math_template "EXPM1" "scalar_expm1(a)" "FP"
+gen_op_tmpl $unary_math_template "COS" "scalar_cos(a)" "FP"
+gen_op_tmpl $unary_math_template "TAN" "scalar_tan(a)" "FP"
+gen_op_tmpl $unary_math_template "SINH" "scalar_sinh(a)" "FP"
+gen_op_tmpl $unary_math_template "COSH" "scalar_cosh(a)" "FP"
+gen_op_tmpl $unary_math_template "TANH" "scalar_tanh(a)" "FP"
+gen_op_tmpl $unary_math_template "ASIN" "scalar_asin(a)" "FP"
+gen_op_tmpl $unary_math_template "ACOS" "scalar_acos(a)" "FP"
+gen_op_tmpl $unary_math_template "ATAN" "scalar_atan(a)" "FP"
+gen_op_tmpl $unary_math_template "CBRT" "scalar_cbrt(a)" "FP"
+gen_op_tmpl $binary_math_template "HYPOT" "scalar_hypot(a, b)" "FP"
+gen_op_tmpl $binary_math_template "POW+pow" "scalar_pow(a, b)" "FP"
+gen_op_tmpl $binary_math_template "ATAN2" "scalar_atan2(a, b)" "FP"
+gen_op_tmpl $binary_math_broadcast_template "POW+pow" "scalar_pow(a, b)" "FP"
 
 # Ternary operations.
-gen_ternary_alu_op "FMA+fma" "Math.fma(a, b, c)" "FP"
+gen_ternary_alu_op "FMA+fma" "scalar_fma(a, b, c)" "FP"
 gen_ternary_alu_op "BITWISE_BLEND+bitwiseBlend" "(a\&~(c))|(b\&c)" "BITWISE"
 gen_ternary_alu_bcst_op "FMA" "Math.fma(a, b, c)" "FP"
 gen_ternary_alu_bcst_op "BITWISE_BLEND+bitwiseBlend" "(a\&~(c))|(b\&c)" "BITWISE"
@@ -614,11 +615,11 @@ gen_ternary_alu_double_bcst_op "FMA+fma" "Math.fma(a, b, c)" "FP"
 gen_ternary_alu_double_bcst_op "BITWISE_BLEND+bitwiseBlend" "(a\&~(c))|(b\&c)" "BITWISE"
 
 # Unary operations.
-gen_unary_alu_op "NEG+neg" "-((\$type\$)a)"
-gen_unary_alu_op "ABS+abs" "Math.abs((\$type\$)a)"
+gen_unary_alu_op "NEG+neg" "scalar_neg((\$type\$)a)"
+gen_unary_alu_op "ABS+abs" "scalar_abs((\$type\$)a)"
 gen_unary_alu_op "NOT+not" "~((\$type\$)a)" "BITWISE"
 gen_unary_alu_op "ZOMO" "(a==0?0:-1)" "BITWISE"
-gen_unary_alu_op "SQRT+sqrt" "Math.sqrt((double)a)" "FP"
+gen_unary_alu_op "SQRT+sqrt" "scalar_sqrt(a)" "FP"
 gen_unary_alu_op "BIT_COUNT" "\$Boxtype\$.bitCount(a)" "intOrLong"
 gen_unary_alu_op "BIT_COUNT" "Integer.bitCount((int)a \& 0xFF)" "byte"
 gen_unary_alu_op "BIT_COUNT" "Integer.bitCount((int)a \& 0xFFFF)" "short"
diff --git a/test/jdk/jdk/incubator/vector/templates/Kernel-Reduction-Masked-op.template b/test/jdk/jdk/incubator/vector/templates/Kernel-Reduction-Masked-op.template
index 82e20d594b6..73e02bf68dd 100644
--- a/test/jdk/jdk/incubator/vector/templates/Kernel-Reduction-Masked-op.template
+++ b/test/jdk/jdk/incubator/vector/templates/Kernel-Reduction-Masked-op.template
@@ -10,7 +10,7 @@
                 $abstractvectortype$ av = $abstractvectortype$.fromArray(SPECIES, a, i);
                 $type$ v = av.reduceLanes(VectorOperators.[[TEST]], vmask);
                 r[i] = v;
-                ra [[TEST_OP]]= v;
+                ra = [[TEST_OP]](ra, v);
             }
         }
 
diff --git a/test/jdk/jdk/incubator/vector/templates/Kernel-Reduction-op.template b/test/jdk/jdk/incubator/vector/templates/Kernel-Reduction-op.template
index 3edc2b27e3e..94fae420cdd 100644
--- a/test/jdk/jdk/incubator/vector/templates/Kernel-Reduction-op.template
+++ b/test/jdk/jdk/incubator/vector/templates/Kernel-Reduction-op.template
@@ -8,7 +8,7 @@
                 $abstractvectortype$ av = $abstractvectortype$.fromArray(SPECIES, a, i);
                 $type$ v = av.reduceLanes(VectorOperators.[[TEST]]);
                 r[i] = v;
-                ra [[TEST_OP]]= v;
+                ra = [[TEST_OP]](ra, v);
             }
         }
 
diff --git a/test/jdk/jdk/incubator/vector/templates/Unit-Binary-op-math.template b/test/jdk/jdk/incubator/vector/templates/Unit-Binary-op-math.template
index a3d44526db9..1866c28e2ba 100644
--- a/test/jdk/jdk/incubator/vector/templates/Unit-Binary-op-math.template
+++ b/test/jdk/jdk/incubator/vector/templates/Unit-Binary-op-math.template
@@ -4,7 +4,7 @@
     }
 
     static $type$ strict[[TEST]]($type$ a, $type$ b) {
-        return ($type$)(Strict[[TEST_OP]]);
+        return ($type$)(strict_[[TEST_OP]]);
     }
 
     @Test(dataProvider = "$type$BinaryOpProvider")
diff --git a/test/jdk/jdk/incubator/vector/templates/Unit-Compare-Broadcast.template b/test/jdk/jdk/incubator/vector/templates/Unit-Compare-Broadcast.template
index 92e612e8184..faae74426e7 100644
--- a/test/jdk/jdk/incubator/vector/templates/Unit-Compare-Broadcast.template
+++ b/test/jdk/jdk/incubator/vector/templates/Unit-Compare-Broadcast.template
@@ -10,7 +10,7 @@
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] [[TEST_OP]] b[i]);
+                assertEquals(mv.laneIsSet(j), [[TEST_OP]](a[i + j], b[i]));
             }
         }
     }
@@ -30,7 +30,7 @@
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] [[TEST_OP]] b[i]));
+                assertEquals(mv.laneIsSet(j), mask[j] && ([[TEST_OP]](a[i + j], b[i])));
             }
         }
     }
@@ -47,7 +47,7 @@
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] [[TEST_OP]] ($type$)((long)b[i]));
+                assertEquals(mv.laneIsSet(j), [[TEST_OP]](a[i + j], ($type$)((long)b[i])));
             }
         }
     }
@@ -67,7 +67,7 @@
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), mask[j] && (a[i + j] [[TEST_OP]] ($type$)((long)b[i])));
+                assertEquals(mv.laneIsSet(j), mask[j] && ([[TEST_OP]](a[i + j], ($type$)((long)b[i]))));
             }
         }
     }
diff --git a/test/jdk/jdk/incubator/vector/templates/Unit-Miscellaneous.template b/test/jdk/jdk/incubator/vector/templates/Unit-Miscellaneous.template
index 8411565628d..5ad7623d2c0 100644
--- a/test/jdk/jdk/incubator/vector/templates/Unit-Miscellaneous.template
+++ b/test/jdk/jdk/incubator/vector/templates/Unit-Miscellaneous.template
@@ -10,7 +10,7 @@
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] < b[i]);
+                assertEquals(mv.laneIsSet(j), lt(a[i + j], b[i]));
             }
         }
     }
@@ -26,7 +26,7 @@
 
             // Check results as part of computation.
             for (int j = 0; j < SPECIES.length(); j++) {
-                assertEquals(mv.laneIsSet(j), a[i + j] == b[i]);
+                assertEquals(mv.laneIsSet(j), eq(a[i + j], b[i]));
             }
         }
     }
@@ -123,7 +123,7 @@
     static long ADDReduceLong($type$[] a, int idx) {
         $type$ res = 0;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res += a[i];
+            res = scalar_add(res, a[i]);
         }
 
         return (long)res;
@@ -132,7 +132,7 @@
     static long ADDReduceAllLong($type$[] a) {
         long res = 0;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduceLong(a, i);
+            res = (long)scalar_add(($type$)res, ($type$)ADDReduceLong(a, i));
         }
 
         return res;
@@ -150,8 +150,8 @@
         }
 
         ra = 0;
-        for (int i = 0; i < a.length; i ++) {
-            ra += r[i];
+        for (int i = 0; i < a.length; i++) {
+            ra = (long)scalar_add(($type$)ra, ($type$)r[i]);
         }
 
         assertReductionLongArraysEquals(r, ra, a,
@@ -161,8 +161,9 @@
     static long ADDReduceLongMasked($type$[] a, int idx, boolean[] mask) {
         $type$ res = 0;
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            if(mask[i % SPECIES.length()])
-                res += a[i];
+            if (mask[i % SPECIES.length()]) {
+                res = scalar_add(res, a[i]);
+            }
         }
 
         return (long)res;
@@ -171,7 +172,7 @@
     static long ADDReduceAllLongMasked($type$[] a, boolean[] mask) {
         long res = 0;
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res += ADDReduceLongMasked(a, i, mask);
+            res = (long)scalar_add(($type$)res, ($type$)ADDReduceLongMasked(a, i, mask));
         }
 
         return res;
@@ -191,8 +192,8 @@
         }
 
         ra = 0;
-        for (int i = 0; i < a.length; i ++) {
-            ra += r[i];
+        for (int i = 0; i < a.length; i++) {
+            ra = (long)scalar_add(($type$)ra, ($type$)r[i]);
         }
 
         assertReductionLongArraysEqualsMasked(r, ra, a, mask,
diff --git a/test/jdk/jdk/incubator/vector/templates/Unit-Reduction-Scalar-Masked-op.template b/test/jdk/jdk/incubator/vector/templates/Unit-Reduction-Scalar-Masked-op.template
index ab383e61256..1565c9f3551 100644
--- a/test/jdk/jdk/incubator/vector/templates/Unit-Reduction-Scalar-Masked-op.template
+++ b/test/jdk/jdk/incubator/vector/templates/Unit-Reduction-Scalar-Masked-op.template
@@ -3,7 +3,7 @@
         $type$ res = [[TEST_INIT]];
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
             if (mask[i % SPECIES.length()])
-                res [[TEST_OP]]= a[i];
+                res = [[TEST_OP]](res, a[i]);
         }
 
         return res;
@@ -12,7 +12,7 @@
     static $type$ [[TEST]]ReduceAllMasked($type$[] a, boolean[] mask) {
         $type$ res = [[TEST_INIT]];
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res [[TEST_OP]]= [[TEST]]ReduceMasked(a, i, mask);
+            res = [[TEST_OP]](res, [[TEST]]ReduceMasked(a, i, mask));
         }
 
         return res;
diff --git a/test/jdk/jdk/incubator/vector/templates/Unit-Reduction-Scalar-op.template b/test/jdk/jdk/incubator/vector/templates/Unit-Reduction-Scalar-op.template
index 88586fa8129..63d154df112 100644
--- a/test/jdk/jdk/incubator/vector/templates/Unit-Reduction-Scalar-op.template
+++ b/test/jdk/jdk/incubator/vector/templates/Unit-Reduction-Scalar-op.template
@@ -2,7 +2,7 @@
     static $type$ [[TEST]]Reduce($type$[] a, int idx) {
         $type$ res = [[TEST_INIT]];
         for (int i = idx; i < (idx + SPECIES.length()); i++) {
-            res [[TEST_OP]]= a[i];
+            res = [[TEST_OP]](res, a[i]);
         }
 
         return res;
@@ -11,7 +11,7 @@
     static $type$ [[TEST]]ReduceAll($type$[] a) {
         $type$ res = [[TEST_INIT]];
         for (int i = 0; i < a.length; i += SPECIES.length()) {
-            res [[TEST_OP]]= [[TEST]]Reduce(a, i);
+            res = [[TEST_OP]](res, [[TEST]]Reduce(a, i));
         }
 
         return res;
diff --git a/test/jdk/jdk/incubator/vector/templates/Unit-Reduction-op.template b/test/jdk/jdk/incubator/vector/templates/Unit-Reduction-op.template
index 25ae3ba2f12..d82b5533c4f 100644
--- a/test/jdk/jdk/incubator/vector/templates/Unit-Reduction-op.template
+++ b/test/jdk/jdk/incubator/vector/templates/Unit-Reduction-op.template
@@ -15,20 +15,20 @@
         $type$[] a = fa.apply(SPECIES.length());
         $type$ id = [[TEST_INIT]];
 
-        assertEquals(($type$) (id [[TEST_OP]] id), id,
+        assertEquals(($type$) ([[TEST_OP]](id, id)), id,
                             "[[TEST]]([[TEST_INIT]], [[TEST_INIT]]) != [[TEST_INIT]]");
 
         $type$ x = 0;
         try {
             for (int i = 0; i < a.length; i++) {
                 x = a[i];
-                assertEquals(($type$) (id [[TEST_OP]] x), x);
-                assertEquals(($type$) (x [[TEST_OP]] id), x);
+                assertEquals(($type$) ([[TEST_OP]](id, x)), x);
+                assertEquals(($type$) ([[TEST_OP]](x, id)), x);
             }
         } catch (AssertionError e) {
-            assertEquals(($type$) (id [[TEST_OP]] x), x,
+            assertEquals(($type$) ([[TEST_OP]](id, x)), x,
                                 "[[TEST]]([[TEST_INIT]], " + x + ") != " + x);
-            assertEquals(($type$) (x [[TEST_OP]] id), x,
+            assertEquals(($type$) ([[TEST_OP]](x, id)), x,
                                 "[[TEST]](" + x + ", [[TEST_INIT]]) != " + x);
         }
     }
diff --git a/test/jdk/jdk/incubator/vector/templates/Unit-Unary-op-math.template b/test/jdk/jdk/incubator/vector/templates/Unit-Unary-op-math.template
index 52293d9f614..f6943a0b40b 100644
--- a/test/jdk/jdk/incubator/vector/templates/Unit-Unary-op-math.template
+++ b/test/jdk/jdk/incubator/vector/templates/Unit-Unary-op-math.template
@@ -4,7 +4,7 @@
     }
 
     static $type$ strict[[TEST]]($type$ a) {
-        return ($type$)(Strict[[TEST_OP]]);
+        return ($type$)(strict_[[TEST_OP]]);
     }
 
     @Test(dataProvider = "$type$UnaryOpProvider")
diff --git a/test/jdk/jdk/incubator/vector/templates/Unit-header.template b/test/jdk/jdk/incubator/vector/templates/Unit-header.template
index 00a7766492c..e1434dccb2b 100644
--- a/test/jdk/jdk/incubator/vector/templates/Unit-header.template
+++ b/test/jdk/jdk/incubator/vector/templates/Unit-header.template
@@ -1943,6 +1943,214 @@ relativeError));
     static boolean ge($type$ a, $type$ b) {
         return a >= b;
     }
+
+    static $type$ firstNonZero($type$ a, $type$ b) {
+        return $Wideboxtype$.compare(a, ($type$) 0) != 0 ? a : b;
+    }
+
+#if[BITWISE]
+    static $type$ scalar_or($type$ a, $type$ b) {
+        return ($type$)(a | b);
+    }
+
+    static $type$ scalar_and($type$ a, $type$ b) {
+        return ($type$)(a & b);
+    }
+
+    static $type$ scalar_xor($type$ a, $type$ b) {
+        return ($type$)(a ^ b);
+    }
+#end[BITWISE];
+
+    static $type$ scalar_add($type$ a, $type$ b) {
+        return ($type$)(a + b);
+    }
+
+    static $type$ scalar_sub($type$ a, $type$ b) {
+        return ($type$)(a - b);
+    }
+
+    static $type$ scalar_mul($type$ a, $type$ b) {
+        return ($type$)(a * b);
+    }
+
+    static $type$ scalar_min($type$ a, $type$ b) {
+        return ($type$)(Math.min(a, b));
+    }
+
+    static $type$ scalar_max($type$ a, $type$ b) {
+        return ($type$)(Math.max(a, b));
+    }
+
+    static $type$ scalar_div($type$ a, $type$ b) {
+        return ($type$)(a / b);
+    }
+
+    static $type$ scalar_fma($type$ a, $type$ b, $type$ c) {
+        return ($type$)(Math.fma(a, b, c));
+    }
+
+    static $type$ scalar_abs($type$ a) {
+        return ($type$)(Math.abs(a));
+    }
+
+    static $type$ scalar_neg($type$ a) {
+        return (($type$)-a);
+    }
+
+#if[!BITWISE]
+    static $type$ scalar_sin($type$ a) {
+        return ($type$)Math.sin((double)a);
+    }
+
+    static $type$ scalar_exp($type$ a) {
+        return ($type$)Math.exp((double)a);
+    }
+
+    static $type$ scalar_log1p($type$ a) {
+        return ($type$)Math.log1p((double)a);
+    }
+
+    static $type$ scalar_log($type$ a) {
+        return ($type$)Math.log((double)a);
+    }
+
+    static $type$ scalar_log10($type$ a) {
+        return ($type$)Math.log10((double)a);
+    }
+
+    static $type$ scalar_expm1($type$ a) {
+        return ($type$)Math.expm1((double)a);
+    }
+
+    static $type$ scalar_cos($type$ a) {
+        return ($type$)Math.cos((double)a);
+    }
+
+    static $type$ scalar_tan($type$ a) {
+        return ($type$)Math.tan((double)a);
+    }
+
+    static $type$ scalar_sinh($type$ a) {
+        return ($type$)Math.sinh((double)a);
+    }
+
+    static $type$ scalar_cosh($type$ a) {
+        return ($type$)Math.cosh((double)a);
+    }
+
+    static $type$ scalar_tanh($type$ a) {
+        return ($type$)Math.tanh((double)a);
+    }
+
+    static $type$ scalar_asin($type$ a) {
+        return ($type$)Math.asin((double)a);
+    }
+
+    static $type$ scalar_acos($type$ a) {
+        return ($type$)Math.acos((double)a);
+    }
+
+    static $type$ scalar_atan($type$ a) {
+        return ($type$)Math.atan((double)a);
+    }
+
+    static $type$ scalar_cbrt($type$ a) {
+        return ($type$)Math.cbrt((double)a);
+    }
+
+    static $type$ scalar_sqrt($type$ a) {
+        return ($type$)Math.sqrt((double)a);
+    }
+
+    static $type$ scalar_hypot($type$ a, $type$ b) {
+        return ($type$)Math.hypot((double)a, (double)b);
+    }
+
+    static $type$ scalar_pow($type$ a, $type$ b) {
+        return ($type$)Math.pow((double)a, (double)b);
+    }
+
+    static $type$ scalar_atan2($type$ a, $type$ b) {
+        return ($type$)Math.atan2((double)a, (double)b);
+    }
+
+    static $type$ strict_scalar_sin($type$ a) {
+        return ($type$)StrictMath.sin((double)a);
+    }
+
+    static $type$ strict_scalar_exp($type$ a) {
+        return ($type$)StrictMath.exp((double)a);
+    }
+
+    static $type$ strict_scalar_log1p($type$ a) {
+        return ($type$)StrictMath.log1p((double)a);
+    }
+
+    static $type$ strict_scalar_log($type$ a) {
+        return ($type$)StrictMath.log((double)a);
+    }
+
+    static $type$ strict_scalar_log10($type$ a) {
+        return ($type$)StrictMath.log10((double)a);
+    }
+
+    static $type$ strict_scalar_expm1($type$ a) {
+        return ($type$)StrictMath.expm1((double)a);
+    }
+
+    static $type$ strict_scalar_cos($type$ a) {
+        return ($type$)StrictMath.cos((double)a);
+    }
+
+    static $type$ strict_scalar_tan($type$ a) {
+        return ($type$)StrictMath.tan((double)a);
+    }
+
+    static $type$ strict_scalar_sinh($type$ a) {
+        return ($type$)StrictMath.sinh((double)a);
+    }
+
+    static $type$ strict_scalar_cosh($type$ a) {
+        return ($type$)StrictMath.cosh((double)a);
+    }
+
+    static $type$ strict_scalar_tanh($type$ a) {
+        return ($type$)StrictMath.tanh((double)a);
+    }
+
+    static $type$ strict_scalar_asin($type$ a) {
+        return ($type$)StrictMath.asin((double)a);
+    }
+
+    static $type$ strict_scalar_acos($type$ a) {
+        return ($type$)StrictMath.acos((double)a);
+    }
+
+    static $type$ strict_scalar_atan($type$ a) {
+        return ($type$)StrictMath.atan((double)a);
+    }
+
+    static $type$ strict_scalar_cbrt($type$ a) {
+        return ($type$)StrictMath.cbrt((double)a);
+    }
+
+    static $type$ strict_scalar_sqrt($type$ a) {
+        return ($type$)StrictMath.sqrt((double)a);
+    }
+
+    static $type$ strict_scalar_hypot($type$ a, $type$ b) {
+        return ($type$)StrictMath.hypot((double)a, (double)b);
+    }
+
+    static $type$ strict_scalar_pow($type$ a, $type$ b) {
+        return ($type$)StrictMath.pow((double)a, (double)b);
+    }
+
+    static $type$ strict_scalar_atan2($type$ a, $type$ b) {
+        return ($type$)StrictMath.atan2((double)a, (double)b);
+    }
+#end[!BITWISE]
 #if[!FP]
 
     static boolean ult($type$ a, $type$ b) {
@@ -1962,9 +2170,17 @@ relativeError));
     }
 #end[!FP]
 
-    static $type$ firstNonZero($type$ a, $type$ b) {
-        return $Boxtype$.compare(a, ($type$) 0) != 0 ? a : b;
+#if[FP]
+    static boolean isNaN($type$ a) {
+        return $Wideboxtype$.isNaN(a);
     }
+    static boolean isFinite($type$ a) {
+        return $Wideboxtype$.isFinite(a);
+    }
+    static boolean isInfinite($type$ a) {
+        return $Wideboxtype$.isInfinite(a);
+    }
+#end[FP]
 
     @Test
     static void smokeTest1() {

From 310d5a15628f7efde06e2680a92a979de3a233b5 Mon Sep 17 00:00:00 2001
From: Jatin Bhateja <jbhateja@openjdk.org>
Date: Fri, 6 Mar 2026 04:39:42 +0000
Subject: [PATCH 068/655] 8346256: Optimize UMIN/UMAX reduction operations for
 x86 targets

Reviewed-by: qamai, sviswanathan
---
 src/hotspot/cpu/x86/assembler_x86.cpp         |  7 +++
 src/hotspot/cpu/x86/assembler_x86.hpp         |  1 +
 src/hotspot/cpu/x86/c2_MacroAssembler_x86.cpp | 48 ++++++++++++++++++-
 src/hotspot/cpu/x86/x86.ad                    | 24 ++++++++++
 .../vectorapi/VectorUMinMaxReductionTest.java | 33 ++++++-------
 5 files changed, 95 insertions(+), 18 deletions(-)

diff --git a/src/hotspot/cpu/x86/assembler_x86.cpp b/src/hotspot/cpu/x86/assembler_x86.cpp
index 3c8defe62d9..38a28a6ec49 100644
--- a/src/hotspot/cpu/x86/assembler_x86.cpp
+++ b/src/hotspot/cpu/x86/assembler_x86.cpp
@@ -5442,6 +5442,13 @@ void Assembler::pmovsxwd(XMMRegister dst, XMMRegister src) {
   emit_int16(0x23, (0xC0 | encode));
 }
 
+void Assembler::pmovzxwd(XMMRegister dst, XMMRegister src) {
+  assert(VM_Version::supports_sse4_1(), "");
+  InstructionAttr attributes(AVX_128bit, /* rex_w */ false, /* legacy_mode */ false, /* no_mask_reg */ true, /* uses_vl */ true);
+  int encode = simd_prefix_and_encode(dst, xnoreg, src, VEX_SIMD_66, VEX_OPCODE_0F_38, &attributes);
+  emit_int16(0x33, (0xC0 | encode));
+}
+
 void Assembler::vpmovzxbw(XMMRegister dst, Address src, int vector_len) {
   assert(VM_Version::supports_avx(), "");
   InstructionMark im(this);
diff --git a/src/hotspot/cpu/x86/assembler_x86.hpp b/src/hotspot/cpu/x86/assembler_x86.hpp
index 97854f712cf..57a5e25d7a6 100644
--- a/src/hotspot/cpu/x86/assembler_x86.hpp
+++ b/src/hotspot/cpu/x86/assembler_x86.hpp
@@ -1965,6 +1965,7 @@ private:
   void pmovsxbq(XMMRegister dst, XMMRegister src);
   void pmovsxbw(XMMRegister dst, XMMRegister src);
   void pmovsxwd(XMMRegister dst, XMMRegister src);
+  void pmovzxwd(XMMRegister dst, XMMRegister src);
   void vpmovsxbd(XMMRegister dst, XMMRegister src, int vector_len);
   void vpmovsxbq(XMMRegister dst, XMMRegister src, int vector_len);
   void vpmovsxbw(XMMRegister dst, XMMRegister src, int vector_len);
diff --git a/src/hotspot/cpu/x86/c2_MacroAssembler_x86.cpp b/src/hotspot/cpu/x86/c2_MacroAssembler_x86.cpp
index a3ccc081b6b..5b5fb02967c 100644
--- a/src/hotspot/cpu/x86/c2_MacroAssembler_x86.cpp
+++ b/src/hotspot/cpu/x86/c2_MacroAssembler_x86.cpp
@@ -1729,6 +1729,24 @@ void C2_MacroAssembler::reduce_operation_128(BasicType typ, int opcode, XMMRegis
         default:            assert(false, "wrong type");
       }
       break;
+    case Op_UMinReductionV:
+      switch (typ) {
+        case T_BYTE:        vpminub(dst, dst, src, Assembler::AVX_128bit); break;
+        case T_SHORT:       vpminuw(dst, dst, src, Assembler::AVX_128bit); break;
+        case T_INT:         vpminud(dst, dst, src, Assembler::AVX_128bit); break;
+        case T_LONG:        evpminuq(dst, k0, dst, src, true, Assembler::AVX_128bit); break;
+        default:            assert(false, "wrong type");
+      }
+      break;
+    case Op_UMaxReductionV:
+      switch (typ) {
+        case T_BYTE:        vpmaxub(dst, dst, src, Assembler::AVX_128bit); break;
+        case T_SHORT:       vpmaxuw(dst, dst, src, Assembler::AVX_128bit); break;
+        case T_INT:         vpmaxud(dst, dst, src, Assembler::AVX_128bit); break;
+        case T_LONG:        evpmaxuq(dst, k0, dst, src, true, Assembler::AVX_128bit); break;
+        default:            assert(false, "wrong type");
+      }
+      break;
     case Op_AddReductionVF: addss(dst, src); break;
     case Op_AddReductionVD: addsd(dst, src); break;
     case Op_AddReductionVI:
@@ -1792,6 +1810,24 @@ void C2_MacroAssembler::reduce_operation_256(BasicType typ, int opcode, XMMRegis
         default:            assert(false, "wrong type");
       }
       break;
+    case Op_UMinReductionV:
+      switch (typ) {
+        case T_BYTE:        vpminub(dst, src1, src2, vector_len); break;
+        case T_SHORT:       vpminuw(dst, src1, src2, vector_len); break;
+        case T_INT:         vpminud(dst, src1, src2, vector_len); break;
+        case T_LONG:        evpminuq(dst, k0, src1, src2, true, vector_len); break;
+        default:            assert(false, "wrong type");
+      }
+      break;
+    case Op_UMaxReductionV:
+      switch (typ) {
+        case T_BYTE:        vpmaxub(dst, src1, src2, vector_len); break;
+        case T_SHORT:       vpmaxuw(dst, src1, src2, vector_len); break;
+        case T_INT:         vpmaxud(dst, src1, src2, vector_len); break;
+        case T_LONG:        evpmaxuq(dst, k0, src1, src2, true, vector_len); break;
+        default:            assert(false, "wrong type");
+      }
+      break;
     case Op_AddReductionVI:
       switch (typ) {
         case T_BYTE:        vpaddb(dst, src1, src2, vector_len); break;
@@ -2058,7 +2094,11 @@ void C2_MacroAssembler::reduce8B(int opcode, Register dst, Register src1, XMMReg
   psrldq(vtmp2, 1);
   reduce_operation_128(T_BYTE, opcode, vtmp1, vtmp2);
   movdl(vtmp2, src1);
-  pmovsxbd(vtmp1, vtmp1);
+  if (opcode == Op_UMinReductionV || opcode == Op_UMaxReductionV) {
+    pmovzxbd(vtmp1, vtmp1);
+  } else {
+    pmovsxbd(vtmp1, vtmp1);
+  }
   reduce_operation_128(T_INT, opcode, vtmp1, vtmp2);
   pextrb(dst, vtmp1, 0x0);
   movsbl(dst, dst);
@@ -2135,7 +2175,11 @@ void C2_MacroAssembler::reduce4S(int opcode, Register dst, Register src1, XMMReg
     reduce_operation_128(T_SHORT, opcode, vtmp1, vtmp2);
   }
   movdl(vtmp2, src1);
-  pmovsxwd(vtmp1, vtmp1);
+  if (opcode == Op_UMinReductionV || opcode == Op_UMaxReductionV) {
+    pmovzxwd(vtmp1, vtmp1);
+  } else {
+    pmovsxwd(vtmp1, vtmp1);
+  }
   reduce_operation_128(T_INT, opcode, vtmp1, vtmp2);
   pextrw(dst, vtmp1, 0x0);
   movswl(dst, dst);
diff --git a/src/hotspot/cpu/x86/x86.ad b/src/hotspot/cpu/x86/x86.ad
index 0ffa4c2031c..b155355c827 100644
--- a/src/hotspot/cpu/x86/x86.ad
+++ b/src/hotspot/cpu/x86/x86.ad
@@ -3341,6 +3341,18 @@ bool Matcher::match_rule_supported_vector(int opcode, int vlen, BasicType bt) {
         return false;
       }
       break;
+    case Op_UMinReductionV:
+    case Op_UMaxReductionV:
+      if (UseAVX == 0) {
+        return false;
+      }
+      if (bt == T_LONG && !VM_Version::supports_avx512vl()) {
+        return false;
+      }
+      if (UseAVX > 2 && size_in_bits == 512 && !VM_Version::supports_avx512vl()) {
+        return false;
+      }
+      break;
     case Op_MaxV:
     case Op_MinV:
       if (UseSSE < 4 && is_integral_type(bt)) {
@@ -19371,6 +19383,8 @@ instruct reductionI(rRegI dst, rRegI src1, legVec src2, legVec vtmp1, legVec vtm
   match(Set dst (XorReductionV  src1 src2));
   match(Set dst (MinReductionV  src1 src2));
   match(Set dst (MaxReductionV  src1 src2));
+  match(Set dst (UMinReductionV  src1 src2));
+  match(Set dst (UMaxReductionV  src1 src2));
   effect(TEMP vtmp1, TEMP vtmp2);
   format %{ "vector_reduction_int $dst,$src1,$src2 ; using $vtmp1, $vtmp2 as TEMP" %}
   ins_encode %{
@@ -19392,6 +19406,8 @@ instruct reductionL(rRegL dst, rRegL src1, legVec src2, legVec vtmp1, legVec vtm
   match(Set dst (XorReductionV  src1 src2));
   match(Set dst (MinReductionV  src1 src2));
   match(Set dst (MaxReductionV  src1 src2));
+  match(Set dst (UMinReductionV  src1 src2));
+  match(Set dst (UMaxReductionV  src1 src2));
   effect(TEMP vtmp1, TEMP vtmp2);
   format %{ "vector_reduction_long $dst,$src1,$src2 ; using $vtmp1, $vtmp2 as TEMP" %}
   ins_encode %{
@@ -19411,6 +19427,8 @@ instruct reductionL_avx512dq(rRegL dst, rRegL src1, vec src2, vec vtmp1, vec vtm
   match(Set dst (XorReductionV  src1 src2));
   match(Set dst (MinReductionV  src1 src2));
   match(Set dst (MaxReductionV  src1 src2));
+  match(Set dst (UMinReductionV  src1 src2));
+  match(Set dst (UMaxReductionV  src1 src2));
   effect(TEMP vtmp1, TEMP vtmp2);
   format %{ "vector_reduction_long $dst,$src1,$src2 ; using $vtmp1, $vtmp2 as TEMP" %}
   ins_encode %{
@@ -19639,6 +19657,8 @@ instruct reductionB(rRegI dst, rRegI src1, legVec src2, legVec vtmp1, legVec vtm
   match(Set dst (XorReductionV  src1 src2));
   match(Set dst (MinReductionV  src1 src2));
   match(Set dst (MaxReductionV  src1 src2));
+  match(Set dst (UMinReductionV  src1 src2));
+  match(Set dst (UMaxReductionV  src1 src2));
   effect(TEMP vtmp1, TEMP vtmp2);
   format %{ "vector_reduction_byte $dst,$src1,$src2 ; using $vtmp1, $vtmp2 as TEMP" %}
   ins_encode %{
@@ -19657,6 +19677,8 @@ instruct reductionB_avx512bw(rRegI dst, rRegI src1, vec src2, vec vtmp1, vec vtm
   match(Set dst (XorReductionV  src1 src2));
   match(Set dst (MinReductionV  src1 src2));
   match(Set dst (MaxReductionV  src1 src2));
+  match(Set dst (UMinReductionV  src1 src2));
+  match(Set dst (UMaxReductionV  src1 src2));
   effect(TEMP vtmp1, TEMP vtmp2);
   format %{ "vector_reduction_byte $dst,$src1,$src2 ; using $vtmp1, $vtmp2 as TEMP" %}
   ins_encode %{
@@ -19678,6 +19700,8 @@ instruct reductionS(rRegI dst, rRegI src1, legVec src2, legVec vtmp1, legVec vtm
   match(Set dst (XorReductionV  src1 src2));
   match(Set dst (MinReductionV  src1 src2));
   match(Set dst (MaxReductionV  src1 src2));
+  match(Set dst (UMinReductionV  src1 src2));
+  match(Set dst (UMaxReductionV  src1 src2));
   effect(TEMP vtmp1, TEMP vtmp2);
   format %{ "vector_reduction_short $dst,$src1,$src2 ; using $vtmp1, $vtmp2 as TEMP" %}
   ins_encode %{
diff --git a/test/hotspot/jtreg/compiler/vectorapi/VectorUMinMaxReductionTest.java b/test/hotspot/jtreg/compiler/vectorapi/VectorUMinMaxReductionTest.java
index 1c8cc34170e..4c753d91afd 100644
--- a/test/hotspot/jtreg/compiler/vectorapi/VectorUMinMaxReductionTest.java
+++ b/test/hotspot/jtreg/compiler/vectorapi/VectorUMinMaxReductionTest.java
@@ -1,4 +1,5 @@
 /*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
  * Copyright (c) 2026, NVIDIA CORPORATION & AFFILIATES. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
@@ -140,7 +141,7 @@ public class VectorUMinMaxReductionTest {
 
     @Test
     @IR(counts = {IRNode.UMIN_REDUCTION_V, "= 1"},
-        applyIfCPUFeature = {"asimd", "true"})
+        applyIfCPUFeatureOr = {"asimd", "true", "avx", "true"})
     public static void testByteUMin() {
         byte got = ByteVector.fromArray(B_SPECIES, ba, 0).reduceLanes(VectorOperators.UMIN);
         verifyByte(B_SPECIES, got, BYTE_UMIN_IDENTITY, VectorMath::minUnsigned, false);
@@ -148,7 +149,7 @@ public class VectorUMinMaxReductionTest {
 
     @Test
     @IR(counts = {IRNode.UMAX_REDUCTION_V, "= 1"},
-        applyIfCPUFeature = {"asimd", "true"})
+        applyIfCPUFeatureOr = {"asimd", "true", "avx", "true"})
     public static void testByteUMax() {
         byte got = ByteVector.fromArray(B_SPECIES, ba, 0).reduceLanes(VectorOperators.UMAX);
         verifyByte(B_SPECIES, got, BYTE_UMAX_IDENTITY, VectorMath::maxUnsigned, false);
@@ -156,7 +157,7 @@ public class VectorUMinMaxReductionTest {
 
     @Test
     @IR(counts = {IRNode.UMIN_REDUCTION_V, "= 1"},
-        applyIfCPUFeature = {"asimd", "true"})
+        applyIfCPUFeatureOr = {"asimd", "true", "avx", "true"})
     public static void testByteUMinMasked() {
         byte got = ByteVector.fromArray(B_SPECIES, ba, 0)
                              .reduceLanes(VectorOperators.UMIN,
@@ -166,7 +167,7 @@ public class VectorUMinMaxReductionTest {
 
     @Test
     @IR(counts = {IRNode.UMAX_REDUCTION_V, "= 1"},
-        applyIfCPUFeature = {"asimd", "true"})
+        applyIfCPUFeatureOr = {"asimd", "true", "avx", "true"})
     public static void testByteUMaxMasked() {
         byte got = ByteVector.fromArray(B_SPECIES, ba, 0)
                              .reduceLanes(VectorOperators.UMAX,
@@ -178,7 +179,7 @@ public class VectorUMinMaxReductionTest {
 
     @Test
     @IR(counts = {IRNode.UMIN_REDUCTION_V, "= 1"},
-        applyIfCPUFeature = {"asimd", "true"})
+        applyIfCPUFeatureOr = {"asimd", "true", "avx", "true"})
     public static void testShortUMin() {
         short got = ShortVector.fromArray(S_SPECIES, sa, 0).reduceLanes(VectorOperators.UMIN);
         verifyShort(S_SPECIES, got, SHORT_UMIN_IDENTITY, VectorMath::minUnsigned, false);
@@ -186,7 +187,7 @@ public class VectorUMinMaxReductionTest {
 
     @Test
     @IR(counts = {IRNode.UMAX_REDUCTION_V, "= 1"},
-        applyIfCPUFeature = {"asimd", "true"})
+        applyIfCPUFeatureOr = {"asimd", "true", "avx", "true"})
     public static void testShortUMax() {
         short got = ShortVector.fromArray(S_SPECIES, sa, 0).reduceLanes(VectorOperators.UMAX);
         verifyShort(S_SPECIES, got, SHORT_UMAX_IDENTITY, VectorMath::maxUnsigned, false);
@@ -194,7 +195,7 @@ public class VectorUMinMaxReductionTest {
 
     @Test
     @IR(counts = {IRNode.UMIN_REDUCTION_V, "= 1"},
-        applyIfCPUFeature = {"asimd", "true"})
+        applyIfCPUFeatureOr = {"asimd", "true", "avx", "true"})
     public static void testShortUMinMasked() {
         short got = ShortVector.fromArray(S_SPECIES, sa, 0)
                                .reduceLanes(VectorOperators.UMIN,
@@ -204,7 +205,7 @@ public class VectorUMinMaxReductionTest {
 
     @Test
     @IR(counts = {IRNode.UMAX_REDUCTION_V, "= 1"},
-        applyIfCPUFeature = {"asimd", "true"})
+        applyIfCPUFeatureOr = {"asimd", "true", "avx", "true"})
     public static void testShortUMaxMasked() {
         short got = ShortVector.fromArray(S_SPECIES, sa, 0)
                                .reduceLanes(VectorOperators.UMAX,
@@ -216,7 +217,7 @@ public class VectorUMinMaxReductionTest {
 
     @Test
     @IR(counts = {IRNode.UMIN_REDUCTION_V, "= 1"},
-        applyIfCPUFeature = {"asimd", "true"})
+        applyIfCPUFeatureOr = {"asimd", "true", "avx", "true"})
     public static void testIntUMin() {
         int got = IntVector.fromArray(I_SPECIES, ia, 0).reduceLanes(VectorOperators.UMIN);
         verifyInt(I_SPECIES, got, INT_UMIN_IDENTITY, VectorMath::minUnsigned, false);
@@ -224,7 +225,7 @@ public class VectorUMinMaxReductionTest {
 
     @Test
     @IR(counts = {IRNode.UMAX_REDUCTION_V, "= 1"},
-        applyIfCPUFeature = {"asimd", "true"})
+        applyIfCPUFeatureOr = {"asimd", "true", "avx", "true"})
     public static void testIntUMax() {
         int got = IntVector.fromArray(I_SPECIES, ia, 0).reduceLanes(VectorOperators.UMAX);
         verifyInt(I_SPECIES, got, INT_UMAX_IDENTITY, VectorMath::maxUnsigned, false);
@@ -232,7 +233,7 @@ public class VectorUMinMaxReductionTest {
 
     @Test
     @IR(counts = {IRNode.UMIN_REDUCTION_V, "= 1"},
-        applyIfCPUFeature = {"asimd", "true"})
+        applyIfCPUFeatureOr = {"asimd", "true", "avx", "true"})
     public static void testIntUMinMasked() {
         int got = IntVector.fromArray(I_SPECIES, ia, 0)
                            .reduceLanes(VectorOperators.UMIN,
@@ -242,7 +243,7 @@ public class VectorUMinMaxReductionTest {
 
     @Test
     @IR(counts = {IRNode.UMAX_REDUCTION_V, "= 1"},
-        applyIfCPUFeature = {"asimd", "true"})
+        applyIfCPUFeatureOr = {"asimd", "true", "avx", "true"})
     public static void testIntUMaxMasked() {
         int got = IntVector.fromArray(I_SPECIES, ia, 0)
                            .reduceLanes(VectorOperators.UMAX,
@@ -254,7 +255,7 @@ public class VectorUMinMaxReductionTest {
 
     @Test
     @IR(counts = {IRNode.UMIN_REDUCTION_V, "= 1"},
-        applyIfCPUFeature = {"asimd", "true"})
+        applyIfCPUFeatureOr = {"asimd", "true", "avx512vl", "true"})
     public static void testLongUMin() {
         long got = LongVector.fromArray(L_SPECIES, la, 0).reduceLanes(VectorOperators.UMIN);
         verifyLong(L_SPECIES, got, LONG_UMIN_IDENTITY, VectorMath::minUnsigned, false);
@@ -262,7 +263,7 @@ public class VectorUMinMaxReductionTest {
 
     @Test
     @IR(counts = {IRNode.UMAX_REDUCTION_V, "= 1"},
-        applyIfCPUFeature = {"asimd", "true"})
+        applyIfCPUFeatureOr = {"asimd", "true", "avx512vl", "true"})
     public static void testLongUMax() {
         long got = LongVector.fromArray(L_SPECIES, la, 0).reduceLanes(VectorOperators.UMAX);
         verifyLong(L_SPECIES, got, LONG_UMAX_IDENTITY, VectorMath::maxUnsigned, false);
@@ -270,7 +271,7 @@ public class VectorUMinMaxReductionTest {
 
     @Test
     @IR(counts = {IRNode.UMIN_REDUCTION_V, "= 1"},
-        applyIfCPUFeature = {"asimd", "true"})
+        applyIfCPUFeatureOr = {"asimd", "true", "avx512vl", "true"})
     public static void testLongUMinMasked() {
         long got = LongVector.fromArray(L_SPECIES, la, 0)
                              .reduceLanes(VectorOperators.UMIN,
@@ -280,7 +281,7 @@ public class VectorUMinMaxReductionTest {
 
     @Test
     @IR(counts = {IRNode.UMAX_REDUCTION_V, "= 1"},
-        applyIfCPUFeature = {"asimd", "true"})
+        applyIfCPUFeatureOr = {"asimd", "true", "avx512vl", "true"})
     public static void testLongUMaxMasked() {
         long got = LongVector.fromArray(L_SPECIES, la, 0)
                              .reduceLanes(VectorOperators.UMAX,

From a2ad0809899f4f31c4bead58bcb441451403d6e8 Mon Sep 17 00:00:00 2001
From: Christian Stein <cstein@openjdk.org>
Date: Fri, 6 Mar 2026 07:15:13 +0000
Subject: [PATCH 069/655] 8379326: Use JUnit in lib-test/jdk tests, here
 MethodTemplateTest

Reviewed-by: dfuchs, rriggs
---
 test/lib-test/TEST.ROOT                                   | 3 +++
 .../jdk/test/lib/jittester/MethodTemplateTest.java        | 8 ++++----
 2 files changed, 7 insertions(+), 4 deletions(-)

diff --git a/test/lib-test/TEST.ROOT b/test/lib-test/TEST.ROOT
index f23d38c1e66..33c9a9c2a43 100644
--- a/test/lib-test/TEST.ROOT
+++ b/test/lib-test/TEST.ROOT
@@ -31,6 +31,9 @@ keys=randomness
 # Minimum jtreg version
 requiredVersion=8.2.1+1
 
+# Prevent TestNG-based tests under this root, use @run junit actions instead
+disallowedActions=testng
+
 # Allow querying of various System properties in @requires clauses
 requires.extraPropDefns = ../jtreg-ext/requires/VMProps.java
 requires.extraPropDefns.bootlibs = ../lib/jdk/test/whitebox
diff --git a/test/lib-test/jdk/test/lib/jittester/MethodTemplateTest.java b/test/lib-test/jdk/test/lib/jittester/MethodTemplateTest.java
index 3cee24b4684..69751bc281c 100644
--- a/test/lib-test/jdk/test/lib/jittester/MethodTemplateTest.java
+++ b/test/lib-test/jdk/test/lib/jittester/MethodTemplateTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2025, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,8 +25,8 @@ package jdk.test.lib.jittester;
 
 import java.lang.reflect.Executable;
 
-import org.testng.annotations.Test;
-import static org.testng.Assert.*;
+import org.junit.jupiter.api.Test;
+import static org.junit.jupiter.api.Assertions.*;
 
 /*
  * @test
@@ -35,7 +35,7 @@ import static org.testng.Assert.*;
  * @library /test/lib
  *          /test/hotspot/jtreg/testlibrary/jittester/src
  *
- * @run testng jdk.test.lib.jittester.MethodTemplateTest
+ * @run junit jdk.test.lib.jittester.MethodTemplateTest
  */
 public class MethodTemplateTest {
 

From dc6f7014aa3791a5a6fd2b89ac19d88382c16da2 Mon Sep 17 00:00:00 2001
From: Matthias Baesken <mbaesken@openjdk.org>
Date: Fri, 6 Mar 2026 09:04:54 +0000
Subject: [PATCH 070/655] 8379202: Support linktime-gc on Linux with clang

Reviewed-by: jwaters, clanger, erikj
---
 make/autoconf/flags-cflags.m4  | 5 +++++
 make/autoconf/flags-ldflags.m4 | 4 ++++
 2 files changed, 9 insertions(+)

diff --git a/make/autoconf/flags-cflags.m4 b/make/autoconf/flags-cflags.m4
index 2d39d84f52e..ab9cd8be19b 100644
--- a/make/autoconf/flags-cflags.m4
+++ b/make/autoconf/flags-cflags.m4
@@ -578,6 +578,11 @@ AC_DEFUN([FLAGS_SETUP_CFLAGS_HELPER],
       TOOLCHAIN_CFLAGS_JDK_CONLY="-fno-strict-aliasing" # technically NOT for CXX
     fi
 
+    if test "x$ENABLE_LINKTIME_GC" = xtrue; then
+      TOOLCHAIN_CFLAGS_JDK="$TOOLCHAIN_CFLAGS_JDK -ffunction-sections -fdata-sections"
+      TOOLCHAIN_CFLAGS_JVM="$TOOLCHAIN_CFLAGS_JVM -ffunction-sections -fdata-sections"
+    fi
+
     if test "x$OPENJDK_TARGET_OS" = xaix; then
       TOOLCHAIN_CFLAGS_JVM="$TOOLCHAIN_CFLAGS_JVM -ffunction-sections -ftls-model -fno-math-errno"
       TOOLCHAIN_CFLAGS_JDK="-ffunction-sections -fsigned-char"
diff --git a/make/autoconf/flags-ldflags.m4 b/make/autoconf/flags-ldflags.m4
index 466ff1beaf4..7782735be25 100644
--- a/make/autoconf/flags-ldflags.m4
+++ b/make/autoconf/flags-ldflags.m4
@@ -80,6 +80,10 @@ AC_DEFUN([FLAGS_SETUP_LDFLAGS_HELPER],
       if test "x$CXX_IS_USER_SUPPLIED" = xfalse && test "x$CC_IS_USER_SUPPLIED" = xfalse; then
         UTIL_REQUIRE_TOOLCHAIN_PROGS(LLD, lld)
       fi
+
+      if test "x$ENABLE_LINKTIME_GC" = xtrue; then
+        BASIC_LDFLAGS_JDK_ONLY="$BASIC_LDFLAGS_JDK_ONLY -Wl,--gc-sections"
+      fi
     fi
     if test "x$OPENJDK_TARGET_OS" = xaix; then
       BASIC_LDFLAGS="-Wl,-b64 -Wl,-brtl -Wl,-bnorwexec -Wl,-blibpath:/usr/lib:lib -Wl,-bnoexpall \

From ca479be7470af4124d666d63f5cbef101c4db5d2 Mon Sep 17 00:00:00 2001
From: Daniel Gredler <dgredler@openjdk.org>
Date: Fri, 6 Mar 2026 10:21:14 +0000
Subject: [PATCH 071/655] 8379363: FontInfo improvements

Reviewed-by: prr, serb
---
 .../classes/sun/java2d/loops/FontInfo.java    | 22 +++++++------------
 1 file changed, 8 insertions(+), 14 deletions(-)

diff --git a/src/java.desktop/share/classes/sun/java2d/loops/FontInfo.java b/src/java.desktop/share/classes/sun/java2d/loops/FontInfo.java
index 09aa05b785e..10e10a4adde 100644
--- a/src/java.desktop/share/classes/sun/java2d/loops/FontInfo.java
+++ b/src/java.desktop/share/classes/sun/java2d/loops/FontInfo.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1999, 2016, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1999, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -26,6 +26,7 @@
 package sun.java2d.loops;
 
 import java.awt.Font;
+import java.util.Arrays;
 
 import sun.font.Font2D;
 import sun.font.FontStrike;
@@ -41,7 +42,7 @@ import sun.font.FontStrike;
  * time. I am reluctant to add the overhead of that machinery here without
  * a proven benefit.
  */
-public class FontInfo implements Cloneable {
+public final class FontInfo implements Cloneable {
     public Font font;
     public Font2D font2D;
     public FontStrike fontStrike;
@@ -56,15 +57,7 @@ public class FontInfo implements Cloneable {
     /* lcdSubPixPos is used if FM is ON for HRGB/HBGR LCD text mode */
     public boolean lcdSubPixPos;
 
-    public String mtx(double[] matrix) {
-        return ("["+
-                matrix[0]+", "+
-                matrix[1]+", "+
-                matrix[2]+", "+
-                matrix[3]+
-                "]");
-    }
-
+    @Override
     public Object clone() {
         try {
             return super.clone();
@@ -73,15 +66,16 @@ public class FontInfo implements Cloneable {
         }
     }
 
+    @Override
     public String toString() {
         return ("FontInfo["+
                 "font="+font+", "+
-                "devTx="+mtx(devTx)+", "+
-                "glyphTx="+mtx(glyphTx)+", "+
+                "devTx="+Arrays.toString(devTx)+", "+
+                "glyphTx="+Arrays.toString(glyphTx)+", "+
                 "pixelHeight="+pixelHeight+", "+
                 "origin=("+originX+","+originY+"), "+
                 "aaHint="+aaHint+", "+
-                "lcdRGBOrder="+(lcdRGBOrder ? "RGB" : "BGR")+
+                "lcdRGBOrder="+(lcdRGBOrder ? "RGB" : "BGR")+", "+
                 "lcdSubPixPos="+lcdSubPixPos+
                 "]");
     }

From 45fc141d29161e6957e95604a3a79dc6c0f7a830 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Markus=20Gr=C3=B6nlund?= <mgronlun@openjdk.org>
Date: Fri, 6 Mar 2026 10:23:33 +0000
Subject: [PATCH 072/655] 8379230: JFR: Do not store leak context edge idx in
 markWord

Reviewed-by: egahlin
---
 .../jfr/leakprofiler/chains/edgeStore.cpp     | 80 +++++++------------
 .../jfr/leakprofiler/chains/edgeStore.hpp     |  3 +-
 2 files changed, 31 insertions(+), 52 deletions(-)

diff --git a/src/hotspot/share/jfr/leakprofiler/chains/edgeStore.cpp b/src/hotspot/share/jfr/leakprofiler/chains/edgeStore.cpp
index 9aef92c4182..2c341f2385e 100644
--- a/src/hotspot/share/jfr/leakprofiler/chains/edgeStore.cpp
+++ b/src/hotspot/share/jfr/leakprofiler/chains/edgeStore.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2014, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2014, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -26,8 +26,10 @@
 #include "jfr/leakprofiler/chains/edgeUtils.hpp"
 #include "jfr/leakprofiler/sampling/objectSample.hpp"
 #include "jfr/leakprofiler/utilities/unifiedOopRef.inline.hpp"
+#include "jfr/recorder/service/jfrOptionSet.hpp"
 #include "oops/oop.inline.hpp"
 #include "runtime/safepoint.hpp"
+#include "utilities/resizableHashTable.hpp"
 
 StoredEdge::StoredEdge(const Edge* parent, UnifiedOopRef reference) : Edge(parent, reference), _gc_root_id(0), _skip_length(0) {}
 
@@ -216,84 +218,62 @@ bool EdgeStore::put_edges(StoredEdge** previous, const Edge** current, size_t li
   return nullptr == *current;
 }
 
-static GrowableArray<const StoredEdge*>* _leak_context_edges = nullptr;
+typedef ResizeableHashTable<uintptr_t, const StoredEdge*, AnyObj::C_HEAP, mtTracing> SampleToLeakContextEdgeMap;
+static SampleToLeakContextEdgeMap* _sample_to_leak_context_edge_map = nullptr;
 
 EdgeStore::EdgeStore() : _edges(new EdgeHashTable(this)) {}
 
 EdgeStore::~EdgeStore() {
   assert(_edges != nullptr, "invariant");
   delete _edges;
-  delete _leak_context_edges;
-  _leak_context_edges = nullptr;
+  delete _sample_to_leak_context_edge_map;
+  _sample_to_leak_context_edge_map = nullptr;
 }
 
-static int leak_context_edge_idx(const ObjectSample* sample) {
+static const StoredEdge* leak_context_edge(const ObjectSample* sample) {
   assert(sample != nullptr, "invariant");
-  return static_cast<int>(sample->object()->mark().value()) >> markWord::lock_bits;
+  assert(_sample_to_leak_context_edge_map != nullptr, "invariant");
+  const StoredEdge** edge = _sample_to_leak_context_edge_map->get(p2u(sample->object()));
+  return edge != nullptr ? *edge : nullptr;
 }
 
 bool EdgeStore::has_leak_context(const ObjectSample* sample) const {
-  const int idx = leak_context_edge_idx(sample);
-  if (idx == 0) {
-    return false;
-  }
-  assert(idx > 0, "invariant");
-  assert(_leak_context_edges != nullptr, "invariant");
-  assert(idx < _leak_context_edges->length(), "invariant");
-  assert(_leak_context_edges->at(idx) != nullptr, "invariant");
-  return true;
+  return _sample_to_leak_context_edge_map != nullptr && leak_context_edge(sample) != nullptr;
 }
 
 const StoredEdge* EdgeStore::get(const ObjectSample* sample) const {
   assert(sample != nullptr, "invariant");
-  if (_leak_context_edges != nullptr) {
+  if (_sample_to_leak_context_edge_map != nullptr) {
     assert(SafepointSynchronize::is_at_safepoint(), "invariant");
-    const int idx = leak_context_edge_idx(sample);
-    if (idx > 0) {
-      assert(idx < _leak_context_edges->length(), "invariant");
-      const StoredEdge* const edge =_leak_context_edges->at(idx);
-      assert(edge != nullptr, "invariant");
+    const StoredEdge* const edge = leak_context_edge(sample);
+    if (edge != nullptr) {
       return edge;
     }
   }
   return get(UnifiedOopRef::encode_in_native(sample->object_addr()));
 }
 
-#ifdef ASSERT
-// max_idx to ensure idx fit in lower 32-bits of markword together with lock bits.
-static constexpr const int max_idx =  right_n_bits(32 - markWord::lock_bits);
+static constexpr const unsigned max_map_size = max_jint >> 1;
 
-static void store_idx_precondition(oop sample_object, int idx) {
-  assert(sample_object != nullptr, "invariant");
-  assert(sample_object->mark().is_marked(), "invariant");
-  assert(idx > 0, "invariant");
-  assert(idx <= max_idx, "invariant");
-}
-#endif
-
-static void store_idx_in_markword(oop sample_object, int idx) {
-  DEBUG_ONLY(store_idx_precondition(sample_object, idx);)
-  const markWord idx_mark_word(sample_object->mark().value() | idx << markWord::lock_bits);
-  sample_object->set_mark(idx_mark_word);
-  assert(sample_object->mark().is_marked(), "must still be marked");
-}
-
-static const int initial_size = 64;
-
-static int save(const StoredEdge* edge) {
-  assert(edge != nullptr, "invariant");
-  if (_leak_context_edges == nullptr) {
-    _leak_context_edges = new (mtTracing) GrowableArray<const StoredEdge*>(initial_size, mtTracing);
-    _leak_context_edges->append(nullptr); // next idx now at 1, for disambiguation in markword.
+static inline unsigned map_size() {
+  assert(JfrOptionSet::old_object_queue_size() > 0, "invariant");
+  unsigned size = JfrOptionSet::old_object_queue_size();
+  size = round_up_power_of_2(size);
+  if (size < 1024) {
+    return 1024;
   }
-  return _leak_context_edges->append(edge);
+  size <<= 1;
+  return size >= max_map_size ? max_map_size : size;
 }
 
-// We associate the leak context edge with the leak candidate object by saving the
-// edge in an array and storing the array idx (shifted) into the markword of the candidate object.
 static void associate_with_candidate(const StoredEdge* leak_context_edge) {
   assert(leak_context_edge != nullptr, "invariant");
-  store_idx_in_markword(leak_context_edge->pointee(), save(leak_context_edge));
+  if (_sample_to_leak_context_edge_map == nullptr) {
+    const unsigned size = map_size();
+    _sample_to_leak_context_edge_map = new (mtTracing) SampleToLeakContextEdgeMap(size, size);
+  }
+  assert(_sample_to_leak_context_edge_map != nullptr, "invariant");
+  _sample_to_leak_context_edge_map->put(p2u(leak_context_edge->pointee()), leak_context_edge);
 }
 
 StoredEdge* EdgeStore::associate_leak_context_with_candidate(const Edge* edge) {
diff --git a/src/hotspot/share/jfr/leakprofiler/chains/edgeStore.hpp b/src/hotspot/share/jfr/leakprofiler/chains/edgeStore.hpp
index e920fd64ea9..460314854b7 100644
--- a/src/hotspot/share/jfr/leakprofiler/chains/edgeStore.hpp
+++ b/src/hotspot/share/jfr/leakprofiler/chains/edgeStore.hpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2014, 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2014, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -39,7 +39,6 @@ class StoredEdge : public Edge {
   size_t _skip_length;
 
  public:
-  StoredEdge();
   StoredEdge(const Edge* parent, UnifiedOopRef reference);
   StoredEdge(const Edge& edge);
   StoredEdge(const StoredEdge& edge);

From 374a94f447b5849afa217dbd83607225e984b378 Mon Sep 17 00:00:00 2001
From: Vicente Romero <vromero@openjdk.org>
Date: Fri, 6 Mar 2026 14:26:09 +0000
Subject: [PATCH 073/655] 8379201: Wrong type annotation offset on casts on
 expressions (redo)

Reviewed-by: jlahoda
---
 .../com/sun/tools/javac/comp/TransTypes.java  |  24 ++-
 .../IncorrectCastOffsetTest.java              | 178 ++++++++++++++++++
 2 files changed, 197 insertions(+), 5 deletions(-)
 create mode 100644 test/langtools/tools/javac/annotations/typeAnnotations/IncorrectCastOffsetTest.java

diff --git a/src/jdk.compiler/share/classes/com/sun/tools/javac/comp/TransTypes.java b/src/jdk.compiler/share/classes/com/sun/tools/javac/comp/TransTypes.java
index 862c02ea5f0..1229939c0bf 100644
--- a/src/jdk.compiler/share/classes/com/sun/tools/javac/comp/TransTypes.java
+++ b/src/jdk.compiler/share/classes/com/sun/tools/javac/comp/TransTypes.java
@@ -29,7 +29,6 @@ package com.sun.tools.javac.comp;
 import com.sun.source.tree.MemberReferenceTree.ReferenceMode;
 import com.sun.tools.javac.code.*;
 import com.sun.tools.javac.code.Attribute.TypeCompound;
-import com.sun.tools.javac.code.Source.Feature;
 import com.sun.tools.javac.code.Symbol.*;
 import com.sun.tools.javac.code.Type.TypeVar;
 import com.sun.tools.javac.jvm.Target;
@@ -49,8 +48,6 @@ import static com.sun.tools.javac.code.TypeTag.VOID;
 import static com.sun.tools.javac.comp.CompileStates.CompileState;
 import com.sun.tools.javac.tree.JCTree.JCBreak;
 
-import javax.lang.model.type.TypeKind;
-
 /** This pass translates Generic Java to conventional Java.
  *
  *  <p><b>This is NOT part of any supported API.
@@ -109,7 +106,9 @@ public class TransTypes extends TreeTranslator {
         if (!types.isSameType(tree.type, target)) {
             if (!resolve.isAccessible(env, target.tsym))
                 resolve.logAccessErrorInternal(env, tree, target);
-            tree = make.TypeCast(make.Type(target), tree).setType(target);
+            tree = explicitCastTP != null && types.isSameType(target, explicitCastTP) ?
+                    tree :
+                    make.TypeCast(make.Type(target), tree).setType(target);
         }
         make.pos = oldpos;
         return tree;
@@ -440,16 +439,29 @@ public class TransTypes extends TreeTranslator {
     /** Visitor argument: proto-type.
      */
     private Type pt;
+    /** we use this type to indicate that "upstream" there is an explicit cast to this type,
+     *  this way we can avoid generating redundant type casts. Redundant casts are not
+     *  innocuous as they can trump user provided ones and affect the offset
+     *  calculation of type annotations applied to the user provided type cast.
+     */
+    private Type explicitCastTP;
 
     /** Visitor method: perform a type translation on tree.
      */
     public <T extends JCTree> T translate(T tree, Type pt) {
+        return translate(tree, pt, pt == explicitCastTP ? explicitCastTP : null);
+    }
+
+    public <T extends JCTree> T translate(T tree, Type pt, Type castTP) {
         Type prevPt = this.pt;
+        Type prevCastPT = this.explicitCastTP;
         try {
             this.pt = pt;
+            this.explicitCastTP = castTP;
             return translate(tree);
         } finally {
             this.pt = prevPt;
+            this.explicitCastTP = prevCastPT;
         }
     }
 
@@ -1037,7 +1049,9 @@ public class TransTypes extends TreeTranslator {
         tree.clazz = translate(tree.clazz, null);
         Type originalTarget = tree.type;
         tree.type = erasure(tree.type);
-        JCExpression newExpression = translate(tree.expr, tree.type);
+        JCExpression newExpression = tree.clazz.hasTag(Tag.ANNOTATED_TYPE) ?
+                translate(tree.expr, tree.type, tree.type) :
+                translate(tree.expr, tree.type);
         if (newExpression != tree.expr) {
             JCTypeCast typeCast = newExpression.hasTag(Tag.TYPECAST)
                 ? (JCTypeCast) newExpression
diff --git a/test/langtools/tools/javac/annotations/typeAnnotations/IncorrectCastOffsetTest.java b/test/langtools/tools/javac/annotations/typeAnnotations/IncorrectCastOffsetTest.java
new file mode 100644
index 00000000000..7a00cf1c897
--- /dev/null
+++ b/test/langtools/tools/javac/annotations/typeAnnotations/IncorrectCastOffsetTest.java
@@ -0,0 +1,178 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+/*
+ * @test
+ * @bug 8214934 8379201
+ * @summary Wrong type annotation offset on casts on expressions
+ * @library /tools/lib
+ * @modules jdk.compiler/com.sun.tools.javac.api
+ *          jdk.compiler/com.sun.tools.javac.main
+ *          jdk.jdeps/com.sun.tools.javap
+ * @build toolbox.ToolBox toolbox.JavapTask
+ * @run compile -g:none IncorrectCastOffsetTest.java
+ * @run main IncorrectCastOffsetTest
+ */
+
+import java.lang.annotation.ElementType;
+import java.lang.annotation.Target;
+import java.lang.annotation.Retention;
+import java.lang.annotation.RetentionPolicy;
+
+import java.nio.file.Path;
+import java.nio.file.Paths;
+
+import java.util.List;
+
+import toolbox.JavapTask;
+import toolbox.Task;
+import toolbox.ToolBox;
+
+public class IncorrectCastOffsetTest {
+    @Target(ElementType.TYPE_USE)
+    @Retention(RetentionPolicy.RUNTIME)
+    @interface TypeUse {}
+
+    @Target(ElementType.TYPE_USE)
+    @Retention(RetentionPolicy.RUNTIME)
+    @interface TypeUse2 {}
+
+    class AnnotatedCast1 {
+        private static String checkcast(boolean test, Object obj, Object obj2) {
+            return (@TypeUse String)(test ? obj : obj2);
+        }
+    }
+
+    class AnnotatedCast2 {
+        private static String checkcast(Object obj) {
+            return (@TypeUse String)(obj);
+        }
+    }
+
+    class AnnotatedCast3 {
+        private static String checkcast(boolean test, Object obj, Object obj2) {
+            return (@TypeUse @TypeUse2 String)(test ? obj : obj2);
+        }
+    }
+
+    class AnnotatedCast4 {
+        private static String checkcast(Object obj) {
+            return (@TypeUse String)(@TypeUse2 CharSequence)(obj);
+        }
+    }
+
+    ToolBox tb;
+
+    IncorrectCastOffsetTest() {
+        tb = new ToolBox();
+    }
+
+    public static void main(String args[]) {
+        IncorrectCastOffsetTest incorrectCastOffsetTest = new IncorrectCastOffsetTest();
+        incorrectCastOffsetTest.run();
+    }
+
+    void run() {
+        test("IncorrectCastOffsetTest$AnnotatedCast1.class",
+                /*
+                 * generated code:
+                 *  0: iload_0
+                 *  1: ifeq          8
+                 *  4: aload_1
+                 *  5: goto          9
+                 *  8: aload_2
+                 *  9: checkcast     #13                 // class java/lang/String
+                 * 12: areturn
+                 */
+                List.of(
+                        "RuntimeVisibleTypeAnnotations:",
+                        "0: #24(): CAST, offset=9, type_index=0",
+                        "IncorrectCastOffsetTest$TypeUse"
+                )
+        );
+        test("IncorrectCastOffsetTest$AnnotatedCast2.class",
+                /*
+                 * generated code:
+                 *  0: aload_0
+                 *  1: checkcast     #13                 // class java/lang/String
+                 *  4: areturn
+                 */
+                List.of(
+                        "RuntimeVisibleTypeAnnotations:",
+                        "0: #23(): CAST, offset=1, type_index=0",
+                        "IncorrectCastOffsetTest$TypeUse"
+                )
+        );
+        test("IncorrectCastOffsetTest$AnnotatedCast3.class",
+                /*
+                 * generated code:
+                 *  0: iload_0
+                 *  1: ifeq          8
+                 *  4: aload_1
+                 *  5: goto          9
+                 *  8: aload_2
+                 *  9: checkcast     #13                 // class java/lang/String
+                 * 12: areturn
+                 */
+                List.of(
+                        "RuntimeVisibleTypeAnnotations:",
+                        "0: #24(): CAST, offset=9, type_index=0",
+                        "IncorrectCastOffsetTest$TypeUse",
+                        "1: #25(): CAST, offset=9, type_index=0",
+                        "IncorrectCastOffsetTest$TypeUse2"
+                )
+        );
+        test("IncorrectCastOffsetTest$AnnotatedCast4.class",
+                /*
+                 * generated code:
+                 *  0: aload_0
+                 *  1: checkcast     #13                 // class java/lang/CharSequence
+                 *  4: checkcast     #15                 // class java/lang/String
+                 *  7: areturn
+                 */
+                List.of(
+                        "RuntimeVisibleTypeAnnotations:",
+                        "0: #25(): CAST, offset=4, type_index=0",
+                        "IncorrectCastOffsetTest$TypeUse",
+                        "1: #26(): CAST, offset=1, type_index=0",
+                        "IncorrectCastOffsetTest$TypeUse2"
+                )
+        );
+    }
+
+    void test(String clazz, List<String> expectedOutput) {
+        Path pathToClass = Paths.get(ToolBox.testClasses, clazz);
+        String javapOut = new JavapTask(tb)
+                .options("-v", "-p")
+                .classes(pathToClass.toString())
+                .run()
+                .getOutput(Task.OutputKind.DIRECT);
+
+        for (String expected : expectedOutput) {
+            if (!javapOut.contains(expected)) {
+                throw new AssertionError("unexpected output");
+            }
+        }
+    }
+
+}

From b349f661ea5f14b258191134714a7e712c90ef3e Mon Sep 17 00:00:00 2001
From: Artur Barashev <abarashev@openjdk.org>
Date: Fri, 6 Mar 2026 14:27:53 +0000
Subject: [PATCH 074/655] 8379191: SunX509KeyManagerImpl alias chooser methods
 returns null for EC_EC

Reviewed-by: myankelevich, mullan
---
 .../ssl/X509KeyManagerCertChecking.java       |   6 +-
 .../X509KeyManager/SelfSignedCertKeyType.java | 131 ++++++++++++++++++
 2 files changed, 134 insertions(+), 3 deletions(-)
 create mode 100644 test/jdk/sun/security/ssl/X509KeyManager/SelfSignedCertKeyType.java

diff --git a/src/java.base/share/classes/sun/security/ssl/X509KeyManagerCertChecking.java b/src/java.base/share/classes/sun/security/ssl/X509KeyManagerCertChecking.java
index 6d26558847c..e0203128962 100644
--- a/src/java.base/share/classes/sun/security/ssl/X509KeyManagerCertChecking.java
+++ b/src/java.base/share/classes/sun/security/ssl/X509KeyManagerCertChecking.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -512,13 +512,13 @@ abstract class X509KeyManagerCertChecking extends X509ExtendedKeyManager {
                         chain[1].getPublicKey().getAlgorithm());
             } else {
                 // Check the signature algorithm of the certificate itself.
-                // Look for the "withRSA" in "SHA1withRSA", etc.
+                // Look for the "withEC" in "SHA256withECDSA", etc.
                 X509Certificate issuer = (X509Certificate) chain[0];
                 String sigAlgName =
                         issuer.getSigAlgName().toUpperCase(Locale.ENGLISH);
                 String pattern =
                         "WITH" + sigKeyAlgorithm.toUpperCase(Locale.ENGLISH);
-                return sigAlgName.endsWith(pattern);
+                return sigAlgName.contains(pattern);
             }
         }
     }
diff --git a/test/jdk/sun/security/ssl/X509KeyManager/SelfSignedCertKeyType.java b/test/jdk/sun/security/ssl/X509KeyManager/SelfSignedCertKeyType.java
new file mode 100644
index 00000000000..2395020de08
--- /dev/null
+++ b/test/jdk/sun/security/ssl/X509KeyManager/SelfSignedCertKeyType.java
@@ -0,0 +1,131 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+import static jdk.test.lib.Asserts.assertEquals;
+import static jdk.test.lib.Asserts.assertNotNull;
+
+import java.math.BigInteger;
+import java.security.KeyPair;
+import java.security.KeyPairGenerator;
+import java.security.KeyStore;
+import java.security.SecureRandom;
+import java.security.cert.Certificate;
+import java.security.cert.X509Certificate;
+import java.time.Instant;
+import java.time.temporal.ChronoUnit;
+import java.util.Date;
+import javax.net.ssl.KeyManagerFactory;
+import javax.net.ssl.X509ExtendedKeyManager;
+import jdk.test.lib.security.CertificateBuilder;
+
+/*
+ * @test
+ * @bug 8379191
+ * @summary SunX509KeyManagerImpl alias chooser methods returns null for EC_EC
+ * @modules java.base/sun.security.x509
+ *          java.base/sun.security.util
+ * @library /test/lib
+ * @run main SelfSignedCertKeyType SunX509
+ * @run main SelfSignedCertKeyType PKIX
+ */
+
+public class SelfSignedCertKeyType {
+
+    private static final String CERT_ALIAS = "testalias";
+    private static final String KEY_ALG = "EC";
+    private static final String KEY_TYPE = "EC_EC";
+    private static final String CERT_SIG_ALG = "SHA256withECDSA";
+
+    public static void main(String[] args) throws Exception {
+        if (args.length != 1) {
+            throw new RuntimeException("Wrong number of arguments");
+        }
+
+        X509ExtendedKeyManager km = getKeyManager(args[0]);
+
+        String serverAlias = km.chooseServerAlias(KEY_TYPE, null, null);
+        String engineServerAlias = km.chooseEngineServerAlias(
+                KEY_TYPE, null, null);
+        String clientAlias = km.chooseClientAlias(
+                new String[]{KEY_TYPE}, null, null);
+        String engineClientAlias = km.chooseEngineClientAlias(
+                new String[]{KEY_TYPE}, null, null);
+
+        for (String alias : new String[]{serverAlias,
+                engineServerAlias, clientAlias, engineClientAlias}) {
+            assertNotNull(alias);
+            assertEquals(CERT_ALIAS, normalizeAlias(alias));
+        }
+    }
+
+    // PKIX KeyManager adds a cache prefix to an alias.
+    private static String normalizeAlias(String alias) {
+        return alias.substring(alias.lastIndexOf(".") + 1);
+    }
+
+    // Returns a KeyManager with a single self-signed certificate.
+    private static X509ExtendedKeyManager getKeyManager(String kmAlg)
+            throws Exception {
+        KeyPair caKeys = KeyPairGenerator.getInstance(KEY_ALG)
+                .generateKeyPair();
+        X509Certificate trustedCert = createTrustedCert(caKeys);
+
+        // create a key store
+        KeyStore ks = KeyStore.getInstance("PKCS12");
+        ks.load(null, null);
+
+        // import the trusted cert
+        ks.setCertificateEntry("TLS Signer", trustedCert);
+
+        // generate certificate chain
+        Certificate[] chain = new Certificate[1];
+        chain[0] = trustedCert;
+
+        // import the key entry.
+        final char[] passphrase = "passphrase".toCharArray();
+        ks.setKeyEntry(CERT_ALIAS, caKeys.getPrivate(), passphrase, chain);
+
+        KeyManagerFactory kmf = KeyManagerFactory.getInstance(kmAlg);
+        kmf.init(ks, passphrase);
+
+        return (X509ExtendedKeyManager) kmf.getKeyManagers()[0];
+    }
+
+    private static X509Certificate createTrustedCert(KeyPair caKeys)
+            throws Exception {
+        return new CertificateBuilder()
+                .setSubjectName("O=CA-Org, L=Some-City, ST=Some-State, C=US")
+                .setPublicKey(caKeys.getPublic())
+                .setNotBefore(
+                        Date.from(Instant.now().minus(1, ChronoUnit.HOURS)))
+                .setNotAfter(Date.from(Instant.now().plus(1, ChronoUnit.HOURS)))
+                .setSerialNumber(BigInteger.valueOf(
+                        new SecureRandom().nextLong(1000000) + 1))
+                .addSubjectKeyIdExt(caKeys.getPublic())
+                .addAuthorityKeyIdExt(caKeys.getPublic())
+                .addKeyUsageExt(new boolean[]{
+                        true, true, true, true, true, true, true})
+                .addBasicConstraintsExt(true, true, 1)
+                .build(null, caKeys.getPrivate(), CERT_SIG_ALG);
+    }
+}

From 0aa52d633a72a240a22c55fb14d9e9744d2cd675 Mon Sep 17 00:00:00 2001
From: "Daniel D. Daugherty" <dcubed@openjdk.org>
Date: Fri, 6 Mar 2026 15:39:27 +0000
Subject: [PATCH 075/655] 8379371: Proposed cleanups for JDK-8373595 A new
 ObjectMonitorTable implementation

Reviewed-by: stefank, fbredberg
---
 src/hotspot/share/prims/jvmtiEnvBase.cpp      |  2 +-
 src/hotspot/share/runtime/deoptimization.cpp  |  2 +-
 .../share/runtime/lockStack.inline.hpp        |  4 +-
 src/hotspot/share/runtime/objectMonitor.cpp   |  2 +-
 .../share/runtime/objectMonitorTable.cpp      | 27 +++++-----
 .../share/runtime/objectMonitorTable.hpp      |  6 +--
 src/hotspot/share/runtime/synchronizer.cpp    | 52 +++++++++----------
 src/hotspot/share/runtime/synchronizer.hpp    | 14 ++---
 src/hotspot/share/runtime/vframe.cpp          |  4 +-
 src/hotspot/share/services/threadService.cpp  |  2 +-
 10 files changed, 58 insertions(+), 57 deletions(-)

diff --git a/src/hotspot/share/prims/jvmtiEnvBase.cpp b/src/hotspot/share/prims/jvmtiEnvBase.cpp
index 401bb4dfdb8..886c2da1dee 100644
--- a/src/hotspot/share/prims/jvmtiEnvBase.cpp
+++ b/src/hotspot/share/prims/jvmtiEnvBase.cpp
@@ -1529,7 +1529,7 @@ JvmtiEnvBase::get_object_monitor_usage(JavaThread* calling_thread, jobject objec
   GrowableArray<JavaThread*>* wantList = nullptr;
 
   ObjectMonitor* mon = mark.has_monitor()
-      ? ObjectSynchronizer::read_monitor(current_thread, hobj(), mark)
+      ? ObjectSynchronizer::read_monitor(hobj(), mark)
       : nullptr;
 
   if (mon != nullptr) {
diff --git a/src/hotspot/share/runtime/deoptimization.cpp b/src/hotspot/share/runtime/deoptimization.cpp
index 54a65358693..5fbe2842a2b 100644
--- a/src/hotspot/share/runtime/deoptimization.cpp
+++ b/src/hotspot/share/runtime/deoptimization.cpp
@@ -1686,7 +1686,7 @@ bool Deoptimization::relock_objects(JavaThread* thread, GrowableArray<MonitorInf
         assert(mon_info->owner()->is_locked(), "object must be locked now");
         assert(obj->mark().has_monitor(), "must be");
         assert(!deoptee_thread->lock_stack().contains(obj()), "must be");
-        assert(ObjectSynchronizer::read_monitor(thread, obj(), obj->mark())->has_owner(deoptee_thread), "must be");
+        assert(ObjectSynchronizer::read_monitor(obj(), obj->mark())->has_owner(deoptee_thread), "must be");
       }
     }
   }
diff --git a/src/hotspot/share/runtime/lockStack.inline.hpp b/src/hotspot/share/runtime/lockStack.inline.hpp
index 27eb07fcec8..a9ad3553db8 100644
--- a/src/hotspot/share/runtime/lockStack.inline.hpp
+++ b/src/hotspot/share/runtime/lockStack.inline.hpp
@@ -1,7 +1,7 @@
 /*
  * Copyright (c) 2022, Red Hat, Inc. All rights reserved.
  * Copyright Amazon.com Inc. or its affiliates. All Rights Reserved.
- * Copyright (c) 2024, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2024, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -254,7 +254,7 @@ inline void OMCache::set_monitor(ObjectMonitor *monitor) {
 
   oop obj = monitor->object_peek();
   assert(obj != nullptr, "must be alive");
-  assert(monitor == ObjectSynchronizer::get_monitor_from_table(JavaThread::current(), obj), "must exist in table");
+  assert(monitor == ObjectSynchronizer::get_monitor_from_table(obj), "must exist in table");
 
   OMCacheEntry to_insert = {obj, monitor};
 
diff --git a/src/hotspot/share/runtime/objectMonitor.cpp b/src/hotspot/share/runtime/objectMonitor.cpp
index 91771772e2c..cb69b82d767 100644
--- a/src/hotspot/share/runtime/objectMonitor.cpp
+++ b/src/hotspot/share/runtime/objectMonitor.cpp
@@ -854,7 +854,7 @@ bool ObjectMonitor::deflate_monitor(Thread* current) {
   }
 
   if (UseObjectMonitorTable) {
-    ObjectSynchronizer::deflate_monitor(current, obj, this);
+    ObjectSynchronizer::deflate_monitor(obj, this);
   } else if (obj != nullptr) {
     // Install the old mark word if nobody else has already done it.
     install_displaced_markword_in_object(obj);
diff --git a/src/hotspot/share/runtime/objectMonitorTable.cpp b/src/hotspot/share/runtime/objectMonitorTable.cpp
index 767f5de6897..8431b6dd0d4 100644
--- a/src/hotspot/share/runtime/objectMonitorTable.cpp
+++ b/src/hotspot/share/runtime/objectMonitorTable.cpp
@@ -46,7 +46,7 @@
 //
 // When you want to find a monitor associated with an object, you extract the
 // hash value of the object. Then calculate an index by taking the hash value
-// and bit-wise AND it with the capacity mask (e.g. size-1) of the OMT. Now
+// and bit-wise AND it with the capacity mask (i.e., size-1) of the OMT. Now
 // use that index into the OMT's array of pointers. If the pointer is non
 // null, check if it's a monitor pointer that is associated with the object.
 // If so you're done. If the pointer is non null, but associated with another
@@ -55,7 +55,7 @@
 // means that the monitor is simply not in the OMT.
 //
 // If the size of the pointer array is significantly larger than the number of
-// pointers in it, the chance of finding the monitor in the hash index
+// pointers in it, the chance of finding the monitor at the hash index
 // (without any further linear searching) is quite high. It is also straight
 // forward to generate C2 code for this, which for the fast path doesn't
 // contain any branching at all. See: C2_MacroAssembler::fast_lock().
@@ -69,10 +69,10 @@
 // old monitor pointers from the old table to the new.
 //
 // But since the OMT is a concurrent hash table and things needs to work for
-// other clients of the OMT while we grow it, it's gets a bit more
+// other clients of the OMT while we grow it, it gets a bit more
 // complicated.
 //
-// Both the new and (potentially several) old table(s) may exist at the same
+// The new and (potentially several) old table(s) may exist at the same
 // time. The newest is always called the "current", and the older ones are
 // singly linked using a "prev" pointer.
 //
@@ -82,7 +82,8 @@
 //
 // After that we start to go through all the indexes in the old table. If the
 // index is empty (the pointer is null) we put a "tombstone" into that index,
-// which will prevent any future concurrent insert ending up in that index.
+// which will prevent any future concurrent insert from ending up in that
+// index.
 //
 // If the index contains a monitor pointer, we insert that monitor pointer
 // into the OMT which can be considered as one generation newer. If the index
@@ -92,11 +93,11 @@
 // that is not null, not a tombstone and not removed, is considered to be a
 // pointer to a monitor.
 //
-// When all the monitor pointers from an old OMT has been transferred to the
+// When all the monitor pointers from an old OMT have been transferred to the
 // new OMT, the old table is unlinked.
 //
 // This copying from an old OMT to one generation newer OMT, will continue
-// until all the monitor pointers from old OMTs has been transferred to the
+// until all the monitor pointers from old OMTs have been transferred to the
 // newest "current" OMT.
 //
 // The memory for old, unlinked OMTs will be freed after a thread-local
@@ -255,7 +256,7 @@ public:
   }
 
   ObjectMonitor* prepare_insert(oop obj, intptr_t hash) {
-    // Acquire any tomb stones and relocations if prev transitioned to null.
+    // Acquire any tombstones and relocations if prev transitioned to null.
     Table* prev = AtomicAccess::load_acquire(&_prev);
     if (prev != nullptr) {
       ObjectMonitor* result = prev->prepare_insert(obj, hash);
@@ -273,7 +274,7 @@ public:
 
       if (entry == empty()) {
         // Found an empty slot to install the new monitor in.
-        // To avoid concurrent inserts succeeding, place a tomb stone here.
+        // To avoid concurrent inserts succeeding, place a tombstone here.
         Entry result = AtomicAccess::cmpxchg(bucket, entry, tombstone(), memory_order_relaxed);
         if (result == entry) {
           // Success! Nobody will try to insert here again, except reinsert from rehashing.
@@ -515,7 +516,7 @@ void ObjectMonitorTable::create() {
   _curr = new Table(128, nullptr);
 }
 
-ObjectMonitor* ObjectMonitorTable::monitor_get(Thread* current, oop obj) {
+ObjectMonitor* ObjectMonitorTable::monitor_get(oop obj) {
   const intptr_t hash = obj->mark().hash();
   Table* curr = AtomicAccess::load_acquire(&_curr);
   ObjectMonitor* monitor = curr->get(obj, hash);
@@ -562,7 +563,7 @@ ObjectMonitorTable::Table* ObjectMonitorTable::grow_table(Table* curr) {
   return result;
 }
 
-ObjectMonitor* ObjectMonitorTable::monitor_put_get(Thread* current, ObjectMonitor* monitor, oop obj) {
+ObjectMonitor* ObjectMonitorTable::monitor_put_get(ObjectMonitor* monitor, oop obj) {
   const intptr_t hash = obj->mark().hash();
   Table* curr = AtomicAccess::load_acquire(&_curr);
 
@@ -577,7 +578,7 @@ ObjectMonitor* ObjectMonitorTable::monitor_put_get(Thread* current, ObjectMonito
   }
 }
 
-void ObjectMonitorTable::remove_monitor_entry(Thread* current, ObjectMonitor* monitor) {
+void ObjectMonitorTable::remove_monitor_entry(ObjectMonitor* monitor) {
   oop obj = monitor->object_peek();
   if (obj == nullptr) {
     // Defer removal until subsequent rebuilding.
@@ -586,7 +587,7 @@ void ObjectMonitorTable::remove_monitor_entry(Thread* current, ObjectMonitor* mo
   const intptr_t hash = obj->mark().hash();
   Table* curr = AtomicAccess::load_acquire(&_curr);
   curr->remove(obj, curr->as_entry(monitor), hash);
-  assert(monitor_get(current, obj) != monitor, "should have been removed");
+  assert(monitor_get(obj) != monitor, "should have been removed");
 }
 
 // Before handshake; rehash and unlink tables.
diff --git a/src/hotspot/share/runtime/objectMonitorTable.hpp b/src/hotspot/share/runtime/objectMonitorTable.hpp
index e8e7c61c6fa..0a56b696069 100644
--- a/src/hotspot/share/runtime/objectMonitorTable.hpp
+++ b/src/hotspot/share/runtime/objectMonitorTable.hpp
@@ -61,11 +61,11 @@ public:
   } SpecialPointerValues;
 
   static void create();
-  static ObjectMonitor* monitor_get(Thread* current, oop obj);
-  static ObjectMonitor* monitor_put_get(Thread* current, ObjectMonitor* monitor, oop obj);
+  static ObjectMonitor* monitor_get(oop obj);
+  static ObjectMonitor* monitor_put_get(ObjectMonitor* monitor, oop obj);
   static void rebuild(GrowableArray<Table*>* delete_list);
   static void destroy(GrowableArray<Table*>* delete_list);
-  static void remove_monitor_entry(Thread* current, ObjectMonitor* monitor);
+  static void remove_monitor_entry(ObjectMonitor* monitor);
 
   // Compiler support
   static address current_table_address();
diff --git a/src/hotspot/share/runtime/synchronizer.cpp b/src/hotspot/share/runtime/synchronizer.cpp
index c93e1a65512..8ea5fe31145 100644
--- a/src/hotspot/share/runtime/synchronizer.cpp
+++ b/src/hotspot/share/runtime/synchronizer.cpp
@@ -350,7 +350,7 @@ bool ObjectSynchronizer::quick_notify(oopDesc* obj, JavaThread* current, bool al
   }
 
   if (mark.has_monitor()) {
-    ObjectMonitor* const mon = read_monitor(current, obj, mark);
+    ObjectMonitor* const mon = read_monitor(obj, mark);
     if (mon == nullptr) {
       // Racing with inflation/deflation go slow path
       return false;
@@ -485,7 +485,7 @@ ObjectLocker::ObjectLocker(Handle obj, TRAPS) : _thread(THREAD), _obj(obj),
       // otherwise just force other vthreads to preempt in case they try
       // to acquire this monitor.
       _skip_exit = !_thread->preemption_cancelled();
-      ObjectSynchronizer::read_monitor(_thread, _obj())->set_object_strong();
+      ObjectSynchronizer::read_monitor(_obj())->set_object_strong();
       _thread->set_pending_preempted_exception();
 
     }
@@ -502,7 +502,7 @@ void ObjectLocker::wait_uninterruptibly(TRAPS) {
   ObjectSynchronizer::waitUninterruptibly(_obj, 0, _thread);
   if (_thread->preempting()) {
     _skip_exit = true;
-    ObjectSynchronizer::read_monitor(_thread, _obj())->set_object_strong();
+    ObjectSynchronizer::read_monitor(_obj())->set_object_strong();
     _thread->set_pending_preempted_exception();
   }
 }
@@ -749,7 +749,7 @@ bool ObjectSynchronizer::current_thread_holds_lock(JavaThread* current,
   }
 
   while (mark.has_monitor()) {
-    ObjectMonitor* monitor = read_monitor(current, obj, mark);
+    ObjectMonitor* monitor = read_monitor(obj, mark);
     if (monitor != nullptr) {
       return monitor->is_entered(current) != 0;
     }
@@ -778,7 +778,7 @@ JavaThread* ObjectSynchronizer::get_lock_owner(ThreadsList * t_list, Handle h_ob
   }
 
   while (mark.has_monitor()) {
-    ObjectMonitor* monitor = read_monitor(Thread::current(), obj, mark);
+    ObjectMonitor* monitor = read_monitor(obj, mark);
     if (monitor != nullptr) {
       return Threads::owning_thread_from_monitor(t_list, monitor);
     }
@@ -1425,7 +1425,7 @@ void ObjectSynchronizer::chk_in_use_entry(ObjectMonitor* n, outputStream* out,
     return;
   }
 
-  ObjectMonitor* const obj_mon = read_monitor(Thread::current(), obj, mark);
+  ObjectMonitor* const obj_mon = read_monitor(obj, mark);
   if (n != obj_mon) {
     out->print_cr("ERROR: monitor=" INTPTR_FORMAT ": in-use monitor's "
                   "object does not refer to the same monitor: obj="
@@ -1471,8 +1471,8 @@ void ObjectSynchronizer::log_in_use_monitor_details(outputStream* out, bool log_
   out->flush();
 }
 
-ObjectMonitor* ObjectSynchronizer::get_or_insert_monitor_from_table(oop object, JavaThread* current, bool* inserted) {
-  ObjectMonitor* monitor = get_monitor_from_table(current, object);
+ObjectMonitor* ObjectSynchronizer::get_or_insert_monitor_from_table(oop object, bool* inserted) {
+  ObjectMonitor* monitor = get_monitor_from_table(object);
   if (monitor != nullptr) {
     *inserted = false;
     return monitor;
@@ -1482,7 +1482,7 @@ ObjectMonitor* ObjectSynchronizer::get_or_insert_monitor_from_table(oop object,
   alloced_monitor->set_anonymous_owner();
 
   // Try insert monitor
-  monitor = add_monitor(current, alloced_monitor, object);
+  monitor = add_monitor(alloced_monitor, object);
 
   *inserted = alloced_monitor == monitor;
   if (!*inserted) {
@@ -1522,7 +1522,7 @@ ObjectMonitor* ObjectSynchronizer::get_or_insert_monitor(oop object, JavaThread*
   EventJavaMonitorInflate event;
 
   bool inserted;
-  ObjectMonitor* monitor = get_or_insert_monitor_from_table(object, current, &inserted);
+  ObjectMonitor* monitor = get_or_insert_monitor_from_table(object, &inserted);
 
   if (inserted) {
     log_inflate(current, object, cause);
@@ -1538,7 +1538,7 @@ ObjectMonitor* ObjectSynchronizer::get_or_insert_monitor(oop object, JavaThread*
 }
 
 // Add the hashcode to the monitor to match the object and put it in the hashtable.
-ObjectMonitor* ObjectSynchronizer::add_monitor(JavaThread* current, ObjectMonitor* monitor, oop obj) {
+ObjectMonitor* ObjectSynchronizer::add_monitor(ObjectMonitor* monitor, oop obj) {
   assert(UseObjectMonitorTable, "must be");
   assert(obj == monitor->object(), "must be");
 
@@ -1546,14 +1546,14 @@ ObjectMonitor* ObjectSynchronizer::add_monitor(JavaThread* current, ObjectMonito
   assert(hash != 0, "must be set when claiming the object monitor");
   monitor->set_hash(hash);
 
-  return ObjectMonitorTable::monitor_put_get(current, monitor, obj);
+  return ObjectMonitorTable::monitor_put_get(monitor, obj);
 }
 
-void ObjectSynchronizer::remove_monitor(Thread* current, ObjectMonitor* monitor, oop obj) {
+void ObjectSynchronizer::remove_monitor(ObjectMonitor* monitor, oop obj) {
   assert(UseObjectMonitorTable, "must be");
   assert(monitor->object_peek() == obj, "must be, cleared objects are removed by is_dead");
 
-  ObjectMonitorTable::remove_monitor_entry(current, monitor);
+  ObjectMonitorTable::remove_monitor_entry(monitor);
 }
 
 void ObjectSynchronizer::deflate_mark_word(oop obj) {
@@ -1721,7 +1721,7 @@ bool ObjectSynchronizer::fast_lock_spin_enter(oop obj, LockStack& lock_stack, Ja
       return true;
     } else if (observed_deflation) {
       // Spin while monitor is being deflated.
-      ObjectMonitor* monitor = ObjectSynchronizer::read_monitor(current, obj, mark);
+      ObjectMonitor* monitor = ObjectSynchronizer::read_monitor(obj, mark);
       return monitor == nullptr || monitor->is_being_async_deflated();
     }
     // Else stop spinning.
@@ -1881,7 +1881,7 @@ void ObjectSynchronizer::exit(oop object, BasicLock* lock, JavaThread* current)
   if (UseObjectMonitorTable) {
     monitor = read_caches(current, lock, object);
     if (monitor == nullptr) {
-      monitor = get_monitor_from_table(current, object);
+      monitor = get_monitor_from_table(object);
     }
   } else {
     monitor = ObjectSynchronizer::read_monitor(mark);
@@ -1925,7 +1925,7 @@ ObjectMonitor* ObjectSynchronizer::inflate_locked_or_imse(oop obj, ObjectSynchro
     }
 
     assert(mark.has_monitor(), "must be");
-    ObjectMonitor* monitor = ObjectSynchronizer::read_monitor(current, obj, mark);
+    ObjectMonitor* monitor = ObjectSynchronizer::read_monitor(obj, mark);
     if (monitor != nullptr) {
       if (monitor->has_anonymous_owner()) {
         LockStack& lock_stack = current->lock_stack();
@@ -2087,7 +2087,7 @@ ObjectMonitor* ObjectSynchronizer::inflate_fast_locked_object(oop object, Object
     // contains a deflating monitor it must be anonymously owned.
     if (monitor->has_anonymous_owner()) {
       // The monitor must be anonymously owned if it was added
-      assert(monitor == get_monitor_from_table(current, object), "The monitor must be found");
+      assert(monitor == get_monitor_from_table(object), "The monitor must be found");
       // New fresh monitor
       break;
     }
@@ -2279,31 +2279,31 @@ ObjectMonitor* ObjectSynchronizer::inflate_and_enter(oop object, BasicLock* lock
   return monitor;
 }
 
-void ObjectSynchronizer::deflate_monitor(Thread* current, oop obj, ObjectMonitor* monitor) {
+void ObjectSynchronizer::deflate_monitor(oop obj, ObjectMonitor* monitor) {
   if (obj != nullptr) {
     deflate_mark_word(obj);
-    remove_monitor(current, monitor, obj);
+    remove_monitor(monitor, obj);
   }
 }
 
-ObjectMonitor* ObjectSynchronizer::get_monitor_from_table(Thread* current, oop obj) {
+ObjectMonitor* ObjectSynchronizer::get_monitor_from_table(oop obj) {
   assert(UseObjectMonitorTable, "must be");
-  return ObjectMonitorTable::monitor_get(current, obj);
+  return ObjectMonitorTable::monitor_get(obj);
 }
 
 ObjectMonitor* ObjectSynchronizer::read_monitor(markWord mark) {
   return mark.monitor();
 }
 
-ObjectMonitor* ObjectSynchronizer::read_monitor(Thread* current, oop obj) {
-  return ObjectSynchronizer::read_monitor(current, obj, obj->mark());
+ObjectMonitor* ObjectSynchronizer::read_monitor(oop obj) {
+  return ObjectSynchronizer::read_monitor(obj, obj->mark());
 }
 
-ObjectMonitor* ObjectSynchronizer::read_monitor(Thread* current, oop obj, markWord mark) {
+ObjectMonitor* ObjectSynchronizer::read_monitor(oop obj, markWord mark) {
   if (!UseObjectMonitorTable) {
     return read_monitor(mark);
   } else {
-    return ObjectSynchronizer::get_monitor_from_table(current, obj);
+    return ObjectSynchronizer::get_monitor_from_table(obj);
   }
 }
 
diff --git a/src/hotspot/share/runtime/synchronizer.hpp b/src/hotspot/share/runtime/synchronizer.hpp
index 97690b9c886..58d0e88a026 100644
--- a/src/hotspot/share/runtime/synchronizer.hpp
+++ b/src/hotspot/share/runtime/synchronizer.hpp
@@ -126,8 +126,8 @@ public:
   static const char* inflate_cause_name(const InflateCause cause);
 
   static ObjectMonitor* read_monitor(markWord mark);
-  static ObjectMonitor* read_monitor(Thread* current, oop obj);
-  static ObjectMonitor* read_monitor(Thread* current, oop obj, markWord mark);
+  static ObjectMonitor* read_monitor(oop obj);
+  static ObjectMonitor* read_monitor(oop obj, markWord mark);
 
   // Returns the identity hash value for an oop
   // NOTE: It may cause monitor inflation
@@ -209,11 +209,11 @@ public:
 
   static void handle_sync_on_value_based_class(Handle obj, JavaThread* locking_thread);
 
-  static ObjectMonitor* get_or_insert_monitor_from_table(oop object, JavaThread* current, bool* inserted);
+  static ObjectMonitor* get_or_insert_monitor_from_table(oop object, bool* inserted);
   static ObjectMonitor* get_or_insert_monitor(oop object, JavaThread* current, ObjectSynchronizer::InflateCause cause);
 
-  static ObjectMonitor* add_monitor(JavaThread* current, ObjectMonitor* monitor, oop obj);
-  static void remove_monitor(Thread* current, ObjectMonitor* monitor, oop obj);
+  static ObjectMonitor* add_monitor(ObjectMonitor* monitor, oop obj);
+  static void remove_monitor(ObjectMonitor* monitor, oop obj);
 
   static void deflate_mark_word(oop object);
 
@@ -239,9 +239,9 @@ public:
   static ObjectMonitor* inflate_fast_locked_object(oop object, ObjectSynchronizer::InflateCause cause, JavaThread* locking_thread, JavaThread* current);
   static ObjectMonitor* inflate_and_enter(oop object, BasicLock* lock, ObjectSynchronizer::InflateCause cause, JavaThread* locking_thread, JavaThread* current);
 
-  static void deflate_monitor(Thread* current, oop obj, ObjectMonitor* monitor);
+  static void deflate_monitor(oop obj, ObjectMonitor* monitor);
 
-  static ObjectMonitor* get_monitor_from_table(Thread* current, oop obj);
+  static ObjectMonitor* get_monitor_from_table(oop obj);
 
   static bool contains_monitor(Thread* current, ObjectMonitor* monitor);
 
diff --git a/src/hotspot/share/runtime/vframe.cpp b/src/hotspot/share/runtime/vframe.cpp
index 604ff1f751a..c9628255e45 100644
--- a/src/hotspot/share/runtime/vframe.cpp
+++ b/src/hotspot/share/runtime/vframe.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1997, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -248,7 +248,7 @@ void javaVFrame::print_lock_info_on(outputStream* st, bool is_virtual, int frame
           // The first stage of async deflation does not affect any field
           // used by this comparison so the ObjectMonitor* is usable here.
           if (mark.has_monitor()) {
-            ObjectMonitor* mon = ObjectSynchronizer::read_monitor(current, monitor->owner(), mark);
+            ObjectMonitor* mon = ObjectSynchronizer::read_monitor(monitor->owner(), mark);
             if (// if the monitor is null we must be in the process of locking
                 mon == nullptr ||
                 // we have marked ourself as pending on this monitor
diff --git a/src/hotspot/share/services/threadService.cpp b/src/hotspot/share/services/threadService.cpp
index 4f511075967..35c7de48d2e 100644
--- a/src/hotspot/share/services/threadService.cpp
+++ b/src/hotspot/share/services/threadService.cpp
@@ -1252,7 +1252,7 @@ private:
             // The first stage of async deflation does not affect any field
             // used by this comparison so the ObjectMonitor* is usable here.
             if (mark.has_monitor()) {
-              ObjectMonitor* mon = ObjectSynchronizer::read_monitor(current, monitor->owner(), mark);
+              ObjectMonitor* mon = ObjectSynchronizer::read_monitor(monitor->owner(), mark);
               if (// if the monitor is null we must be in the process of locking
                   mon == nullptr ||
                   // we have marked ourself as pending on this monitor

From ea4a1512456d29d05a634c14bb2beb65152ba1f4 Mon Sep 17 00:00:00 2001
From: Joe Darcy <darcy@openjdk.org>
Date: Fri, 6 Mar 2026 17:20:44 +0000
Subject: [PATCH 076/655] 8379156: Specify behavior of Types.asElement() on
 array types

Reviewed-by: hannesw, liach
---
 .../classes/javax/lang/model/util/Types.java    |  1 +
 .../model/util/types/TestAsElement.java         | 17 +++++++++++------
 2 files changed, 12 insertions(+), 6 deletions(-)

diff --git a/src/java.compiler/share/classes/javax/lang/model/util/Types.java b/src/java.compiler/share/classes/javax/lang/model/util/Types.java
index e7212a7e0be..f632135a899 100644
--- a/src/java.compiler/share/classes/javax/lang/model/util/Types.java
+++ b/src/java.compiler/share/classes/javax/lang/model/util/Types.java
@@ -74,6 +74,7 @@ public interface Types {
      * Types <em>without</em> corresponding elements include:
      * <ul>
      * <li>{@linkplain TypeKind#isPrimitive() primitive types}
+     * <li>{@linkplain TypeKind#ARRAY array types}
      * <li>{@linkplain TypeKind#EXECUTABLE executable types}
      * <li>{@linkplain TypeKind#NONE "none"} pseudo-types
      * <li>{@linkplain TypeKind#NULL null types}
diff --git a/test/langtools/tools/javac/processing/model/util/types/TestAsElement.java b/test/langtools/tools/javac/processing/model/util/types/TestAsElement.java
index 6ac714752c3..cc82c5adddd 100644
--- a/test/langtools/tools/javac/processing/model/util/types/TestAsElement.java
+++ b/test/langtools/tools/javac/processing/model/util/types/TestAsElement.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2023, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2023, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,7 +23,7 @@
 
 /*
  * @test
- * @bug 8300857
+ * @bug 8300857 8379156
  * @summary Test Types.asElement in cases specified to return null
  * @library /tools/javac/lib
  * @build   JavacTestingAbstractProcessor TestAsElement
@@ -55,18 +55,23 @@ public class TestAsElement extends JavacTestingAbstractProcessor {
     }
 
     private void testNullCases() {
-        // Test all primitive types
+        // Test all primitive types and arrays of primitive types
         for (TypeKind typeKind : TypeKind.values()) {
             if (typeKind.isPrimitive() ) {
-                expectNullAsElement(typeUtils.getPrimitiveType(typeKind));
+                var primType = typeUtils.getPrimitiveType(typeKind);
+                expectNullAsElement(primType);
+                expectNullAsElement(typeUtils.getArrayType(primType));
             }
         }
         expectNullAsElement(typeUtils.getNoType(TypeKind.VOID));
         expectNullAsElement(typeUtils.getNoType(TypeKind.NONE));
         expectNullAsElement(typeUtils.getNullType());
 
-        Element objectElement = eltUtils.getTypeElement("java.lang.Object");
-        expectNullAsElement(typeUtils.getWildcardType(objectElement.asType(), null));
+        Element    objectElement = eltUtils.getTypeElement("java.lang.Object");
+        TypeMirror objectType    = objectElement.asType();
+        expectNullAsElement(typeUtils.getWildcardType(objectType, null));
+        // check Object[]
+        expectNullAsElement(typeUtils.getArrayType(objectType));
 
         // Loop over the ExecutableTypes for Object's methods
         for(var methodElt : ElementFilter.methodsIn(objectElement.getEnclosedElements())) {

From 779970fb6fdae8b12ca29b4887d2812c50835653 Mon Sep 17 00:00:00 2001
From: Phil Race <prr@openjdk.org>
Date: Fri, 6 Mar 2026 17:57:32 +0000
Subject: [PATCH 077/655] 8373626: [asan] read past end of buffer in
 sun.awt.image.ImagingLib.convolveBI

Reviewed-by: jdv
---
 .../libmlib_image/mlib_ImageConv_16nw.c       | 116 +++++++++++++++---
 .../libmlib_image/mlib_ImageConv_32nw.c       |  59 +++++++--
 .../native/libmlib_image/mlib_ImageConv_8nw.c | 116 +++++++++++++++---
 .../libmlib_image/mlib_ImageConv_D64nw.c      |  56 +++++++--
 .../libmlib_image/mlib_ImageConv_F32nw.c      |  53 ++++++--
 .../libmlib_image/mlib_ImageConv_u16nw.c      | 116 +++++++++++++++---
 .../libmlib_image/mlib_c_ImageConvVersion.c   |   4 +-
 7 files changed, 425 insertions(+), 95 deletions(-)

diff --git a/src/java.desktop/share/native/libmlib_image/mlib_ImageConv_16nw.c b/src/java.desktop/share/native/libmlib_image/mlib_ImageConv_16nw.c
index 2e035d12453..26686e59b0b 100644
--- a/src/java.desktop/share/native/libmlib_image/mlib_ImageConv_16nw.c
+++ b/src/java.desktop/share/native/libmlib_image/mlib_ImageConv_16nw.c
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2000, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2000, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -286,13 +286,14 @@ static mlib_status mlib_ImageConv1xN(mlib_image       *dst,
         pk = k + off;
         sp = sl0;
 
-        k0 = pk[0]; k1 = pk[1]; k2 = pk[2]; k3 = pk[3];
-        p2 = sp[0]; p3 = sp[sll]; p4 = sp[2*sll];
-
         dp = dl;
         kh = n - off;
 
         if (kh == 4) {
+
+          k0 = pk[0]; k1 = pk[1]; k2 = pk[2]; k3 = pk[3];
+          p2 = sp[0]; p3 = sp[sll]; p4 = sp[2*sll];
+
           sp += 3*sll;
 
           for (j = 0; j <= (hsize - 2); j += 2) {
@@ -325,6 +326,10 @@ static mlib_status mlib_ImageConv1xN(mlib_image       *dst,
           }
 
         } else if (kh == 3) {
+
+          k0 = pk[0]; k1 = pk[1]; k2 = pk[2];
+          p2 = sp[0]; p3 = sp[sll];
+
           sp += 2*sll;
 
           for (j = 0; j <= (hsize - 2); j += 2) {
@@ -357,6 +362,10 @@ static mlib_status mlib_ImageConv1xN(mlib_image       *dst,
           }
 
         } else if (kh == 2) {
+
+          k0 = pk[0]; k1 = pk[1];
+          p2 = sp[0];
+
           sp += sll;
 
           for (j = 0; j <= (hsize - 2); j += 2) {
@@ -389,6 +398,9 @@ static mlib_status mlib_ImageConv1xN(mlib_image       *dst,
           }
 
         } else /* if (kh == 1) */ {
+
+          k0 = pk[0];
+
           for (j = 0; j < hsize; j++) {
             p0 = sp[0];
 
@@ -536,15 +548,14 @@ mlib_status CONV_FUNC(MxN)(mlib_image       *dst,
           sp = sl;
           dp = dl;
 
-          p2 = buff[0]; p3 = buff[1]; p4 = buff[2];
-          p5 = buff[3]; p6 = buff[4]; p7 = buff[5];
-
-          k0 = pk[0]; k1 = pk[1]; k2 = pk[2]; k3 = pk[3];
-          k4 = pk[4]; k5 = pk[5]; k6 = pk[6];
-          pk += kw;
-
           if (kw == 7) {
 
+            p2 = buff[0]; p3 = buff[1]; p4 = buff[2];
+            p5 = buff[3]; p6 = buff[4]; p7 = buff[5];
+
+            k0 = pk[0]; k1 = pk[1]; k2 = pk[2]; k3 = pk[3];
+            k4 = pk[4]; k5 = pk[5]; k6 = pk[6];
+
             if (l < (n - 1) || off < m) {
               for (i = 0; i <= (wid - 2); i += 2) {
                 p0 = p2; p1 = p3; p2 = p4; p3 = p5; p4 = p6; p5 = p7;
@@ -583,6 +594,12 @@ mlib_status CONV_FUNC(MxN)(mlib_image       *dst,
 
           } else if (kw == 6) {
 
+            p2 = buff[0]; p3 = buff[1]; p4 = buff[2];
+            p5 = buff[3]; p6 = buff[4];
+
+            k0 = pk[0]; k1 = pk[1]; k2 = pk[2]; k3 = pk[3];
+            k4 = pk[4]; k5 = pk[5];
+
             if (l < (n - 1) || off < m) {
               for (i = 0; i <= (wid - 2); i += 2) {
                 p0 = p2; p1 = p3; p2 = p4; p3 = p5; p4 = p6;
@@ -618,6 +635,12 @@ mlib_status CONV_FUNC(MxN)(mlib_image       *dst,
 
           } else if (kw == 5) {
 
+            p2 = buff[0]; p3 = buff[1]; p4 = buff[2];
+            p5 = buff[3];
+
+            k0 = pk[0]; k1 = pk[1]; k2 = pk[2]; k3 = pk[3];
+            k4 = pk[4];
+
             if (l < (n - 1) || off < m) {
               for (i = 0; i <= (wid - 2); i += 2) {
                 p0 = p2; p1 = p3; p2 = p4; p3 = p5;
@@ -653,6 +676,10 @@ mlib_status CONV_FUNC(MxN)(mlib_image       *dst,
 
           } else if (kw == 4) {
 
+            p2 = buff[0]; p3 = buff[1]; p4 = buff[2];
+
+            k0 = pk[0]; k1 = pk[1]; k2 = pk[2]; k3 = pk[3];
+
             if (l < (n - 1) || off < m) {
               for (i = 0; i <= (wid - 2); i += 2) {
                 p0 = p2; p1 = p3; p2 = p4;
@@ -688,6 +715,10 @@ mlib_status CONV_FUNC(MxN)(mlib_image       *dst,
 
           } else if (kw == 3) {
 
+            p2 = buff[0]; p3 = buff[1];
+
+            k0 = pk[0]; k1 = pk[1]; k2 = pk[2];
+
             if (l < (n - 1) || off < m) {
               for (i = 0; i <= (wid - 2); i += 2) {
                 p0 = p2; p1 = p3;
@@ -723,6 +754,10 @@ mlib_status CONV_FUNC(MxN)(mlib_image       *dst,
 
           } else /*if (kw == 2)*/ {
 
+            p2 = buff[0];
+
+            k0 = pk[0]; k1 = pk[1];
+
             if (l < (n - 1) || off < m) {
               for (i = 0; i <= (wid - 2); i += 2) {
                 p0 = p2;
@@ -756,6 +791,8 @@ mlib_status CONV_FUNC(MxN)(mlib_image       *dst,
               }
             }
           }
+
+          pk += kw;
         }
       }
 
@@ -882,17 +919,16 @@ mlib_status CONV_FUNC_I(MxN)(mlib_image       *dst,
             if (kw > MAX_KER) kw = kw/2;
           off += kw;
 
-          p2 = sp[0]; p3 = sp[chan1]; p4 = sp[chan2];
-          p5 = sp[chan2 + chan1]; p6 = sp[chan2 + chan2]; p7 = sp[5*chan1];
-
-          k0 = pk[0]; k1 = pk[1]; k2 = pk[2]; k3 = pk[3];
-          k4 = pk[4]; k5 = pk[5]; k6 = pk[6];
-          pk += kw;
-
-          sp += (kw - 1)*chan1;
-
           if (kw == 7) {
 
+            p2 = sp[0]; p3 = sp[chan1]; p4 = sp[chan2];
+            p5 = sp[chan2 + chan1]; p6 = sp[chan2 + chan2]; p7 = sp[5*chan1];
+
+            sp += (kw - 1)*chan1;
+
+            k0 = pk[0]; k1 = pk[1]; k2 = pk[2]; k3 = pk[3];
+            k4 = pk[4]; k5 = pk[5]; k6 = pk[6];
+
             if (l < (n - 1) || off < m) {
               for (i = 0; i <= (wid - 2); i += 2) {
                 p0 = p2; p1 = p3; p2 = p4; p3 = p5; p4 = p6; p5 = p7;
@@ -927,6 +963,14 @@ mlib_status CONV_FUNC_I(MxN)(mlib_image       *dst,
 
           } else if (kw == 6) {
 
+            p2 = sp[0]; p3 = sp[chan1]; p4 = sp[chan2];
+            p5 = sp[chan2 + chan1]; p6 = sp[chan2 + chan2];
+
+            sp += (kw - 1)*chan1;
+
+            k0 = pk[0]; k1 = pk[1]; k2 = pk[2]; k3 = pk[3];
+            k4 = pk[4]; k5 = pk[5];
+
             if (l < (n - 1) || off < m) {
               for (i = 0; i <= (wid - 2); i += 2) {
                 p0 = p2; p1 = p3; p2 = p4; p3 = p5; p4 = p6;
@@ -961,6 +1005,14 @@ mlib_status CONV_FUNC_I(MxN)(mlib_image       *dst,
 
           } else if (kw == 5) {
 
+            p2 = sp[0]; p3 = sp[chan1]; p4 = sp[chan2];
+            p5 = sp[chan2 + chan1];
+
+            sp += (kw - 1)*chan1;
+
+            k0 = pk[0]; k1 = pk[1]; k2 = pk[2]; k3 = pk[3];
+            k4 = pk[4];
+
             if (l < (n - 1) || off < m) {
               for (i = 0; i <= (wid - 2); i += 2) {
                 p0 = p2; p1 = p3; p2 = p4; p3 = p5;
@@ -995,6 +1047,12 @@ mlib_status CONV_FUNC_I(MxN)(mlib_image       *dst,
 
           } else if (kw == 4) {
 
+            p2 = sp[0]; p3 = sp[chan1]; p4 = sp[chan2];
+
+            sp += (kw - 1)*chan1;
+
+            k0 = pk[0]; k1 = pk[1]; k2 = pk[2]; k3 = pk[3];
+
             if (l < (n - 1) || off < m) {
               for (i = 0; i <= (wid - 2); i += 2) {
                 p0 = p2; p1 = p3; p2 = p4;
@@ -1029,6 +1087,12 @@ mlib_status CONV_FUNC_I(MxN)(mlib_image       *dst,
 
           } else if (kw == 3) {
 
+            p2 = sp[0]; p3 = sp[chan1];
+
+            sp += (kw - 1)*chan1;
+
+            k0 = pk[0]; k1 = pk[1]; k2 = pk[2];
+
             if (l < (n - 1) || off < m) {
               for (i = 0; i <= (wid - 2); i += 2) {
                 p0 = p2; p1 = p3;
@@ -1063,6 +1127,12 @@ mlib_status CONV_FUNC_I(MxN)(mlib_image       *dst,
 
           } else if (kw == 2) {
 
+            p2 = sp[0];
+
+            sp += (kw - 1)*chan1;
+
+            k0 = pk[0]; k1 = pk[1];
+
             if (l < (n - 1) || off < m) {
               for (i = 0; i <= (wid - 2); i += 2) {
                 p0 = p2;
@@ -1097,6 +1167,10 @@ mlib_status CONV_FUNC_I(MxN)(mlib_image       *dst,
 
           } else /*if (kw == 1)*/ {
 
+            k0 = pk[0];
+
+            sp += (kw - 1)*chan1;
+
             if (l < (n - 1) || off < m) {
               for (i = 0; i <= (wid - 2); i += 2) {
                 p0 = sp[0];
@@ -1127,6 +1201,8 @@ mlib_status CONV_FUNC_I(MxN)(mlib_image       *dst,
               }
             }
           }
+
+        pk += kw;
         }
       }
 
diff --git a/src/java.desktop/share/native/libmlib_image/mlib_ImageConv_32nw.c b/src/java.desktop/share/native/libmlib_image/mlib_ImageConv_32nw.c
index bb264d9dcd2..b2ee9742213 100644
--- a/src/java.desktop/share/native/libmlib_image/mlib_ImageConv_32nw.c
+++ b/src/java.desktop/share/native/libmlib_image/mlib_ImageConv_32nw.c
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2000, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2000, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -158,13 +158,14 @@ static mlib_status mlib_ImageConv1xN(mlib_image       *dst,
         pk = k + off;
         sp = sl0;
 
-        k0 = pk[0]; k1 = pk[1]; k2 = pk[2]; k3 = pk[3];
-        p2 = sp[0]; p3 = sp[sll]; p4 = sp[2*sll];
-
         dp = dl;
         kh = n - off;
 
         if (kh == 4) {
+
+          k0 = pk[0]; k1 = pk[1]; k2 = pk[2]; k3 = pk[3];
+          p2 = sp[0]; p3 = sp[sll]; p4 = sp[2*sll];
+
           sp += 3*sll;
 
           for (j = 0; j <= (hsize - 2); j += 2) {
@@ -195,6 +196,10 @@ static mlib_status mlib_ImageConv1xN(mlib_image       *dst,
           }
 
         } else if (kh == 3) {
+
+          k0 = pk[0]; k1 = pk[1]; k2 = pk[2];
+          p2 = sp[0]; p3 = sp[sll];
+
           sp += 2*sll;
 
           for (j = 0; j <= (hsize - 2); j += 2) {
@@ -225,6 +230,10 @@ static mlib_status mlib_ImageConv1xN(mlib_image       *dst,
           }
 
         } else if (kh == 2) {
+
+          k0 = pk[0]; k1 = pk[1];
+          p2 = sp[0];
+
           sp += sll;
 
           for (j = 0; j <= (hsize - 2); j += 2) {
@@ -255,6 +264,9 @@ static mlib_status mlib_ImageConv1xN(mlib_image       *dst,
           }
 
         } else /* if (kh == 1) */ {
+
+          k0 = pk[0];
+
           for (j = 0; j < hsize; j++) {
             p0 = sp[0];
 
@@ -400,15 +412,14 @@ mlib_status CONV_FUNC(MxN)(mlib_image       *dst,
           sp = sl;
           dp = dl;
 
-          p2 = buff[0]; p3 = buff[1]; p4 = buff[2];
-          p5 = buff[3]; p6 = buff[4]; p7 = buff[5];
-
-          k0 = pk[0]; k1 = pk[1]; k2 = pk[2]; k3 = pk[3];
-          k4 = pk[4]; k5 = pk[5]; k6 = pk[6];
-          pk += kw;
-
           if (kw == 7) {
 
+            p2 = buff[0]; p3 = buff[1]; p4 = buff[2];
+            p5 = buff[3]; p6 = buff[4]; p7 = buff[5];
+
+            k0 = pk[0]; k1 = pk[1]; k2 = pk[2]; k3 = pk[3];
+            k4 = pk[4]; k5 = pk[5]; k6 = pk[6];
+
             if (l < (n - 1) || off < m) {
               for (i = 0; i <= (wid - 2); i += 2) {
                 p0 = p2; p1 = p3; p2 = p4; p3 = p5; p4 = p6; p5 = p7;
@@ -444,6 +455,12 @@ mlib_status CONV_FUNC(MxN)(mlib_image       *dst,
 
           } else if (kw == 6) {
 
+            p2 = buff[0]; p3 = buff[1]; p4 = buff[2];
+            p5 = buff[3]; p6 = buff[4];
+
+            k0 = pk[0]; k1 = pk[1]; k2 = pk[2]; k3 = pk[3];
+            k4 = pk[4]; k5 = pk[5];
+
             if (l < (n - 1) || off < m) {
               for (i = 0; i <= (wid - 2); i += 2) {
                 p0 = p2; p1 = p3; p2 = p4; p3 = p5; p4 = p6;
@@ -479,6 +496,12 @@ mlib_status CONV_FUNC(MxN)(mlib_image       *dst,
 
           } else if (kw == 5) {
 
+            p2 = buff[0]; p3 = buff[1]; p4 = buff[2];
+            p5 = buff[3];
+
+            k0 = pk[0]; k1 = pk[1]; k2 = pk[2]; k3 = pk[3];
+            k4 = pk[4];
+
             if (l < (n - 1) || off < m) {
               for (i = 0; i <= (wid - 2); i += 2) {
                 p0 = p2; p1 = p3; p2 = p4; p3 = p5;
@@ -514,6 +537,10 @@ mlib_status CONV_FUNC(MxN)(mlib_image       *dst,
 
           } else if (kw == 4) {
 
+            p2 = buff[0]; p3 = buff[1]; p4 = buff[2];
+
+            k0 = pk[0]; k1 = pk[1]; k2 = pk[2]; k3 = pk[3];
+
             if (l < (n - 1) || off < m) {
               for (i = 0; i <= (wid - 2); i += 2) {
                 p0 = p2; p1 = p3; p2 = p4;
@@ -549,6 +576,10 @@ mlib_status CONV_FUNC(MxN)(mlib_image       *dst,
 
           } else if (kw == 3) {
 
+            p2 = buff[0]; p3 = buff[1];
+
+            k0 = pk[0]; k1 = pk[1]; k2 = pk[2];
+
             if (l < (n - 1) || off < m) {
               for (i = 0; i <= (wid - 2); i += 2) {
                 p0 = p2; p1 = p3;
@@ -584,6 +615,10 @@ mlib_status CONV_FUNC(MxN)(mlib_image       *dst,
 
           } else { /* kw == 2 */
 
+            p2 = buff[0];
+
+            k0 = pk[0]; k1 = pk[1];
+
             if (l < (n - 1) || off < m) {
               for (i = 0; i <= (wid - 2); i += 2) {
                 p0 = p2;
@@ -617,6 +652,8 @@ mlib_status CONV_FUNC(MxN)(mlib_image       *dst,
               }
             }
           }
+
+          pk += kw;
         }
       }
 
diff --git a/src/java.desktop/share/native/libmlib_image/mlib_ImageConv_8nw.c b/src/java.desktop/share/native/libmlib_image/mlib_ImageConv_8nw.c
index c144404b0f4..ce7cac00f72 100644
--- a/src/java.desktop/share/native/libmlib_image/mlib_ImageConv_8nw.c
+++ b/src/java.desktop/share/native/libmlib_image/mlib_ImageConv_8nw.c
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -287,13 +287,14 @@ static mlib_status mlib_ImageConv1xN(mlib_image       *dst,
         pk = k + off;
         sp = sl0;
 
-        k0 = pk[0]; k1 = pk[1]; k2 = pk[2]; k3 = pk[3];
-        p2 = sp[0]; p3 = sp[sll]; p4 = sp[2*sll];
-
         dp = dl;
         kh = n - off;
 
         if (kh == 4) {
+
+          k0 = pk[0]; k1 = pk[1]; k2 = pk[2]; k3 = pk[3];
+          p2 = sp[0]; p3 = sp[sll]; p4 = sp[2*sll];
+
           sp += 3*sll;
 
           for (j = 0; j <= (hsize - 2); j += 2) {
@@ -326,6 +327,10 @@ static mlib_status mlib_ImageConv1xN(mlib_image       *dst,
           }
 
         } else if (kh == 3) {
+
+          k0 = pk[0]; k1 = pk[1]; k2 = pk[2];
+          p2 = sp[0]; p3 = sp[sll];
+
           sp += 2*sll;
 
           for (j = 0; j <= (hsize - 2); j += 2) {
@@ -358,6 +363,10 @@ static mlib_status mlib_ImageConv1xN(mlib_image       *dst,
           }
 
         } else if (kh == 2) {
+
+          k0 = pk[0]; k1 = pk[1];
+          p2 = sp[0];
+
           sp += sll;
 
           for (j = 0; j <= (hsize - 2); j += 2) {
@@ -390,6 +399,9 @@ static mlib_status mlib_ImageConv1xN(mlib_image       *dst,
           }
 
         } else /* if (kh == 1) */ {
+
+          k0 = pk[0];
+
           for (j = 0; j < hsize; j++) {
             p0 = sp[0];
 
@@ -537,15 +549,14 @@ mlib_status CONV_FUNC(MxN)(mlib_image       *dst,
           sp = sl;
           dp = dl;
 
-          p2 = buff[0]; p3 = buff[1]; p4 = buff[2];
-          p5 = buff[3]; p6 = buff[4]; p7 = buff[5];
-
-          k0 = pk[0]; k1 = pk[1]; k2 = pk[2]; k3 = pk[3];
-          k4 = pk[4]; k5 = pk[5]; k6 = pk[6];
-          pk += kw;
-
           if (kw == 7) {
 
+            p2 = buff[0]; p3 = buff[1]; p4 = buff[2];
+            p5 = buff[3]; p6 = buff[4]; p7 = buff[5];
+
+            k0 = pk[0]; k1 = pk[1]; k2 = pk[2]; k3 = pk[3];
+            k4 = pk[4]; k5 = pk[5]; k6 = pk[6];
+
             if (l < (n - 1) || off < m) {
               for (i = 0; i <= (wid - 2); i += 2) {
                 p0 = p2; p1 = p3; p2 = p4; p3 = p5; p4 = p6; p5 = p7;
@@ -584,6 +595,12 @@ mlib_status CONV_FUNC(MxN)(mlib_image       *dst,
 
           } else if (kw == 6) {
 
+            p2 = buff[0]; p3 = buff[1]; p4 = buff[2];
+            p5 = buff[3]; p6 = buff[4];
+
+            k0 = pk[0]; k1 = pk[1]; k2 = pk[2]; k3 = pk[3];
+            k4 = pk[4]; k5 = pk[5];
+
             if (l < (n - 1) || off < m) {
               for (i = 0; i <= (wid - 2); i += 2) {
                 p0 = p2; p1 = p3; p2 = p4; p3 = p5; p4 = p6;
@@ -619,6 +636,12 @@ mlib_status CONV_FUNC(MxN)(mlib_image       *dst,
 
           } else if (kw == 5) {
 
+            p2 = buff[0]; p3 = buff[1]; p4 = buff[2];
+            p5 = buff[3];
+
+            k0 = pk[0]; k1 = pk[1]; k2 = pk[2]; k3 = pk[3];
+            k4 = pk[4];
+
             if (l < (n - 1) || off < m) {
               for (i = 0; i <= (wid - 2); i += 2) {
                 p0 = p2; p1 = p3; p2 = p4; p3 = p5;
@@ -654,6 +677,10 @@ mlib_status CONV_FUNC(MxN)(mlib_image       *dst,
 
           } else if (kw == 4) {
 
+            p2 = buff[0]; p3 = buff[1]; p4 = buff[2];
+
+            k0 = pk[0]; k1 = pk[1]; k2 = pk[2]; k3 = pk[3];
+
             if (l < (n - 1) || off < m) {
               for (i = 0; i <= (wid - 2); i += 2) {
                 p0 = p2; p1 = p3; p2 = p4;
@@ -689,6 +716,10 @@ mlib_status CONV_FUNC(MxN)(mlib_image       *dst,
 
           } else if (kw == 3) {
 
+            p2 = buff[0]; p3 = buff[1];
+
+            k0 = pk[0]; k1 = pk[1]; k2 = pk[2];
+
             if (l < (n - 1) || off < m) {
               for (i = 0; i <= (wid - 2); i += 2) {
                 p0 = p2; p1 = p3;
@@ -724,6 +755,10 @@ mlib_status CONV_FUNC(MxN)(mlib_image       *dst,
 
           } else /*if (kw == 2)*/ {
 
+            p2 = buff[0];
+
+            k0 = pk[0]; k1 = pk[1];
+
             if (l < (n - 1) || off < m) {
               for (i = 0; i <= (wid - 2); i += 2) {
                 p0 = p2;
@@ -757,6 +792,8 @@ mlib_status CONV_FUNC(MxN)(mlib_image       *dst,
               }
             }
           }
+
+          pk += kw;
         }
       }
 
@@ -883,17 +920,16 @@ mlib_status CONV_FUNC_I(MxN)(mlib_image       *dst,
             if (kw > MAX_KER) kw = kw/2;
           off += kw;
 
-          p2 = sp[0]; p3 = sp[chan1]; p4 = sp[chan2];
-          p5 = sp[chan2 + chan1]; p6 = sp[chan2 + chan2]; p7 = sp[5*chan1];
-
-          k0 = pk[0]; k1 = pk[1]; k2 = pk[2]; k3 = pk[3];
-          k4 = pk[4]; k5 = pk[5]; k6 = pk[6];
-          pk += kw;
-
-          sp += (kw - 1)*chan1;
-
           if (kw == 7) {
 
+            p2 = sp[0]; p3 = sp[chan1]; p4 = sp[chan2];
+            p5 = sp[chan2 + chan1]; p6 = sp[chan2 + chan2]; p7 = sp[5*chan1];
+
+            sp += (kw - 1)*chan1;
+
+            k0 = pk[0]; k1 = pk[1]; k2 = pk[2]; k3 = pk[3];
+            k4 = pk[4]; k5 = pk[5]; k6 = pk[6];
+
             if (l < (n - 1) || off < m) {
               for (i = 0; i <= (wid - 2); i += 2) {
                 p0 = p2; p1 = p3; p2 = p4; p3 = p5; p4 = p6; p5 = p7;
@@ -928,6 +964,14 @@ mlib_status CONV_FUNC_I(MxN)(mlib_image       *dst,
 
           } else if (kw == 6) {
 
+            p2 = sp[0]; p3 = sp[chan1]; p4 = sp[chan2];
+            p5 = sp[chan2 + chan1]; p6 = sp[chan2 + chan2];
+
+            sp += (kw - 1)*chan1;
+
+            k0 = pk[0]; k1 = pk[1]; k2 = pk[2]; k3 = pk[3];
+            k4 = pk[4]; k5 = pk[5];
+
             if (l < (n - 1) || off < m) {
               for (i = 0; i <= (wid - 2); i += 2) {
                 p0 = p2; p1 = p3; p2 = p4; p3 = p5; p4 = p6;
@@ -962,6 +1006,14 @@ mlib_status CONV_FUNC_I(MxN)(mlib_image       *dst,
 
           } else if (kw == 5) {
 
+            p2 = sp[0]; p3 = sp[chan1]; p4 = sp[chan2];
+            p5 = sp[chan2 + chan1];
+
+            sp += (kw - 1)*chan1;
+
+            k0 = pk[0]; k1 = pk[1]; k2 = pk[2]; k3 = pk[3];
+            k4 = pk[4];
+
             if (l < (n - 1) || off < m) {
               for (i = 0; i <= (wid - 2); i += 2) {
                 p0 = p2; p1 = p3; p2 = p4; p3 = p5;
@@ -996,6 +1048,12 @@ mlib_status CONV_FUNC_I(MxN)(mlib_image       *dst,
 
           } else if (kw == 4) {
 
+            p2 = sp[0]; p3 = sp[chan1]; p4 = sp[chan2];
+
+            sp += (kw - 1)*chan1;
+
+            k0 = pk[0]; k1 = pk[1]; k2 = pk[2]; k3 = pk[3];
+
             if (l < (n - 1) || off < m) {
               for (i = 0; i <= (wid - 2); i += 2) {
                 p0 = p2; p1 = p3; p2 = p4;
@@ -1030,6 +1088,12 @@ mlib_status CONV_FUNC_I(MxN)(mlib_image       *dst,
 
           } else if (kw == 3) {
 
+            p2 = sp[0]; p3 = sp[chan1];
+
+            sp += (kw - 1)*chan1;
+
+            k0 = pk[0]; k1 = pk[1]; k2 = pk[2];
+
             if (l < (n - 1) || off < m) {
               for (i = 0; i <= (wid - 2); i += 2) {
                 p0 = p2; p1 = p3;
@@ -1064,6 +1128,12 @@ mlib_status CONV_FUNC_I(MxN)(mlib_image       *dst,
 
           } else if (kw == 2) {
 
+            p2 = sp[0];
+
+            sp += (kw - 1)*chan1;
+
+            k0 = pk[0]; k1 = pk[1];
+
             if (l < (n - 1) || off < m) {
               for (i = 0; i <= (wid - 2); i += 2) {
                 p0 = p2;
@@ -1098,6 +1168,10 @@ mlib_status CONV_FUNC_I(MxN)(mlib_image       *dst,
 
           } else /*if (kw == 1)*/ {
 
+            k0 = pk[0];
+
+            sp += (kw - 1)*chan1;
+
             if (l < (n - 1) || off < m) {
               for (i = 0; i <= (wid - 2); i += 2) {
                 p0 = sp[0];
@@ -1128,6 +1202,8 @@ mlib_status CONV_FUNC_I(MxN)(mlib_image       *dst,
               }
             }
           }
+
+          pk += kw;
         }
       }
 
diff --git a/src/java.desktop/share/native/libmlib_image/mlib_ImageConv_D64nw.c b/src/java.desktop/share/native/libmlib_image/mlib_ImageConv_D64nw.c
index 54e11c64a49..389c1b52c1e 100644
--- a/src/java.desktop/share/native/libmlib_image/mlib_ImageConv_D64nw.c
+++ b/src/java.desktop/share/native/libmlib_image/mlib_ImageConv_D64nw.c
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2020, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -150,13 +150,14 @@ static mlib_status mlib_ImageConv1xN(mlib_image       *dst,
         pk = k + off;
         sp = sl0;
 
-        k0 = pk[0]; k1 = pk[1]; k2 = pk[2]; k3 = pk[3];
-        p2 = sp[0]; p3 = sp[sll]; p4 = sp[2*sll];
-
         dp = dl;
         kh = n - off;
 
         if (kh == 4) {
+
+          k0 = pk[0]; k1 = pk[1]; k2 = pk[2]; k3 = pk[3];
+          p2 = sp[0]; p3 = sp[sll]; p4 = sp[2*sll];
+
           sp += 3*sll;
 
           for (j = 0; j <= (hsize - 2); j += 2) {
@@ -184,6 +185,10 @@ static mlib_status mlib_ImageConv1xN(mlib_image       *dst,
           }
 
         } else if (kh == 3) {
+
+          k0 = pk[0]; k1 = pk[1]; k2 = pk[2];
+          p2 = sp[0]; p3 = sp[sll];
+
           sp += 2*sll;
 
           for (j = 0; j <= (hsize - 2); j += 2) {
@@ -211,6 +216,10 @@ static mlib_status mlib_ImageConv1xN(mlib_image       *dst,
           }
 
         } else if (kh == 2) {
+
+          k0 = pk[0]; k1 = pk[1];
+          p2 = sp[0];
+
           sp += sll;
 
           for (j = 0; j <= (hsize - 2); j += 2) {
@@ -238,6 +247,9 @@ static mlib_status mlib_ImageConv1xN(mlib_image       *dst,
           }
 
         } else /* if (kh == 1) */ {
+
+          k0 = pk[0];
+
           for (j = 0; j < hsize; j++) {
             p0 = sp[0];
 
@@ -322,17 +334,16 @@ mlib_status CONV_FUNC(MxN)(mlib_image       *dst,
           if (kw > 2*MAX_KER) kw = MAX_KER; else
             if (kw > MAX_KER) kw = kw/2;
 
-          p2 = sp0[0]; p3 = sp0[chan1]; p4 = sp0[chan2];
-          sp0 += chan3;
-          p5 = sp0[0]; p6 = sp0[chan1]; p7 = sp0[chan2];
-
-          k0 = pk[0]; k1 = pk[1]; k2 = pk[2]; k3 = pk[3];
-          k4 = pk[4]; k5 = pk[5]; k6 = pk[6];
-
           dp = dl;
 
           if (kw == 7) {
+
+            p2 = sp0[0]; p3 = sp0[chan1]; p4 = sp0[chan2];
+            sp0 += chan3;
+            p5 = sp0[0]; p6 = sp0[chan1]; p7 = sp0[chan2];
             sp = sp0 += chan3;
+            k0 = pk[0]; k1 = pk[1]; k2 = pk[2]; k3 = pk[3];
+            k4 = pk[4]; k5 = pk[5]; k6 = pk[6];
 
             if (pk == k) {
               for (i = 0; i <= (wid - 2); i += 2) {
@@ -362,7 +373,13 @@ mlib_status CONV_FUNC(MxN)(mlib_image       *dst,
             }
 
           } else if (kw == 6) {
+
+            p2 = sp0[0]; p3 = sp0[chan1]; p4 = sp0[chan2];
+            sp0 += chan3;
+            p5 = sp0[0]; p6 = sp0[chan1];
             sp = sp0 += chan2;
+            k0 = pk[0]; k1 = pk[1]; k2 = pk[2]; k3 = pk[3];
+            k4 = pk[4]; k5 = pk[5];
 
             if (pk == k) {
               for (i = 0; i <= (wid - 2); i += 2) {
@@ -392,7 +409,13 @@ mlib_status CONV_FUNC(MxN)(mlib_image       *dst,
             }
 
           } else if (kw == 5) {
+
+            p2 = sp0[0]; p3 = sp0[chan1]; p4 = sp0[chan2];
+            sp0 += chan3;
+            p5 = sp0[0];
             sp = sp0 += chan1;
+            k0 = pk[0]; k1 = pk[1]; k2 = pk[2]; k3 = pk[3];
+            k4 = pk[4];
 
             if (pk == k) {
               for (i = 0; i <= (wid - 2); i += 2) {
@@ -423,7 +446,10 @@ mlib_status CONV_FUNC(MxN)(mlib_image       *dst,
 
           } else if (kw == 4) {
 
+            p2 = sp0[0]; p3 = sp0[chan1]; p4 = sp0[chan2];
+            sp0 += chan3;
             sp = sp0;
+            k0 = pk[0]; k1 = pk[1]; k2 = pk[2]; k3 = pk[3];
 
             if (pk == k) {
               for (i = 0; i <= (wid - 2); i += 2) {
@@ -453,7 +479,11 @@ mlib_status CONV_FUNC(MxN)(mlib_image       *dst,
             }
 
           } else if (kw == 3) {
+
+            p2 = sp0[0]; p3 = sp0[chan1];
+            sp0 += chan3;
             sp = sp0 -= chan1;
+            k0 = pk[0]; k1 = pk[1]; k2 = pk[2];
 
             if (pk == k) {
               for (i = 0; i <= (wid - 2); i += 2) {
@@ -483,7 +513,11 @@ mlib_status CONV_FUNC(MxN)(mlib_image       *dst,
             }
 
           } else { /* kw == 2 */
+
+            p2 = sp0[0];
+            sp0 += chan3;
             sp = sp0 -= chan2;
+            k0 = pk[0]; k1 = pk[1];
 
             if (pk == k) {
               for (i = 0; i <= (wid - 2); i += 2) {
diff --git a/src/java.desktop/share/native/libmlib_image/mlib_ImageConv_F32nw.c b/src/java.desktop/share/native/libmlib_image/mlib_ImageConv_F32nw.c
index e87607ddf12..e6c68de5054 100644
--- a/src/java.desktop/share/native/libmlib_image/mlib_ImageConv_F32nw.c
+++ b/src/java.desktop/share/native/libmlib_image/mlib_ImageConv_F32nw.c
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2020, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -150,13 +150,14 @@ static mlib_status mlib_ImageConv1xN(mlib_image       *dst,
         pk = k + off;
         sp = sl0;
 
-        k0 = pk[0]; k1 = pk[1]; k2 = pk[2]; k3 = pk[3];
-        p2 = sp[0]; p3 = sp[sll]; p4 = sp[2*sll];
-
         dp = dl;
         kh = n - off;
 
         if (kh == 4) {
+
+          k0 = pk[0]; k1 = pk[1]; k2 = pk[2]; k3 = pk[3];
+          p2 = sp[0]; p3 = sp[sll]; p4 = sp[2*sll];
+
           sp += 3*sll;
 
           for (j = 0; j <= (hsize - 2); j += 2) {
@@ -184,6 +185,10 @@ static mlib_status mlib_ImageConv1xN(mlib_image       *dst,
           }
 
         } else if (kh == 3) {
+
+          k0 = pk[0]; k1 = pk[1]; k2 = pk[2];
+          p2 = sp[0]; p3 = sp[sll];
+
           sp += 2*sll;
 
           for (j = 0; j <= (hsize - 2); j += 2) {
@@ -211,6 +216,10 @@ static mlib_status mlib_ImageConv1xN(mlib_image       *dst,
           }
 
         } else if (kh == 2) {
+
+          k0 = pk[0]; k1 = pk[1];
+          p2 = sp[0];
+
           sp += sll;
 
           for (j = 0; j <= (hsize - 2); j += 2) {
@@ -238,6 +247,9 @@ static mlib_status mlib_ImageConv1xN(mlib_image       *dst,
           }
 
         } else /* if (kh == 1) */ {
+
+          k0 = pk[0];
+
           for (j = 0; j < hsize; j++) {
             p0 = sp[0];
 
@@ -322,17 +334,15 @@ mlib_status CONV_FUNC(MxN)(mlib_image       *dst,
           if (kw > 2*MAX_KER) kw = MAX_KER; else
             if (kw > MAX_KER) kw = kw/2;
 
-          p2 = sp0[0]; p3 = sp0[chan1]; p4 = sp0[chan2];
-          sp0 += chan3;
-          p5 = sp0[0]; p6 = sp0[chan1]; p7 = sp0[chan2];
-
-          k0 = pk[0]; k1 = pk[1]; k2 = pk[2]; k3 = pk[3];
-          k4 = pk[4]; k5 = pk[5]; k6 = pk[6];
-
           dp = dl;
 
           if (kw == 7) {
+            p2 = sp0[0]; p3 = sp0[chan1]; p4 = sp0[chan2];
+            sp0 += chan3;
+            p5 = sp0[0]; p6 = sp0[chan1]; p7 = sp0[chan2];
             sp = sp0 += chan3;
+            k0 = pk[0]; k1 = pk[1]; k2 = pk[2]; k3 = pk[3];
+            k4 = pk[4]; k5 = pk[5]; k6 = pk[6];
 
             if (pk == k) {
               for (i = 0; i <= (wid - 2); i += 2) {
@@ -362,7 +372,12 @@ mlib_status CONV_FUNC(MxN)(mlib_image       *dst,
             }
 
           } else if (kw == 6) {
+            p2 = sp0[0]; p3 = sp0[chan1]; p4 = sp0[chan2];
+            sp0 += chan3;
+            p5 = sp0[0]; p6 = sp0[chan1];
             sp = sp0 += chan2;
+            k0 = pk[0]; k1 = pk[1]; k2 = pk[2]; k3 = pk[3];
+            k4 = pk[4]; k5 = pk[5];
 
             if (pk == k) {
               for (i = 0; i <= (wid - 2); i += 2) {
@@ -392,7 +407,12 @@ mlib_status CONV_FUNC(MxN)(mlib_image       *dst,
             }
 
           } else if (kw == 5) {
+            p2 = sp0[0]; p3 = sp0[chan1]; p4 = sp0[chan2];
+            sp0 += chan3;
+            p5 = sp0[0];
             sp = sp0 += chan1;
+            k0 = pk[0]; k1 = pk[1]; k2 = pk[2]; k3 = pk[3];
+            k4 = pk[4];
 
             if (pk == k) {
               for (i = 0; i <= (wid - 2); i += 2) {
@@ -423,7 +443,10 @@ mlib_status CONV_FUNC(MxN)(mlib_image       *dst,
 
           } else if (kw == 4) {
 
+            p2 = sp0[0]; p3 = sp0[chan1]; p4 = sp0[chan2];
+            sp0 += chan3;
             sp = sp0;
+            k0 = pk[0]; k1 = pk[1]; k2 = pk[2]; k3 = pk[3];
 
             if (pk == k) {
               for (i = 0; i <= (wid - 2); i += 2) {
@@ -453,7 +476,11 @@ mlib_status CONV_FUNC(MxN)(mlib_image       *dst,
             }
 
           } else if (kw == 3) {
+
+            p2 = sp0[0]; p3 = sp0[chan1];
+            sp0 += chan3;
             sp = sp0 -= chan1;
+            k0 = pk[0]; k1 = pk[1]; k2 = pk[2];
 
             if (pk == k) {
               for (i = 0; i <= (wid - 2); i += 2) {
@@ -483,7 +510,11 @@ mlib_status CONV_FUNC(MxN)(mlib_image       *dst,
             }
 
           } else { /* kw == 2 */
+
+            p2 = sp0[0];
+            sp0 += chan3;
             sp = sp0 -= chan2;
+            k0 = pk[0]; k1 = pk[1];
 
             if (pk == k) {
               for (i = 0; i <= (wid - 2); i += 2) {
diff --git a/src/java.desktop/share/native/libmlib_image/mlib_ImageConv_u16nw.c b/src/java.desktop/share/native/libmlib_image/mlib_ImageConv_u16nw.c
index 49412c7d7ef..438531e2c07 100644
--- a/src/java.desktop/share/native/libmlib_image/mlib_ImageConv_u16nw.c
+++ b/src/java.desktop/share/native/libmlib_image/mlib_ImageConv_u16nw.c
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -286,13 +286,14 @@ static mlib_status mlib_ImageConv1xN(mlib_image       *dst,
         pk = k + off;
         sp = sl0;
 
-        k0 = pk[0]; k1 = pk[1]; k2 = pk[2]; k3 = pk[3];
-        p2 = sp[0]; p3 = sp[sll]; p4 = sp[2*sll];
-
         dp = dl;
         kh = n - off;
 
         if (kh == 4) {
+
+          k0 = pk[0]; k1 = pk[1]; k2 = pk[2]; k3 = pk[3];
+          p2 = sp[0]; p3 = sp[sll]; p4 = sp[2*sll];
+
           sp += 3*sll;
 
           for (j = 0; j <= (hsize - 2); j += 2) {
@@ -325,6 +326,10 @@ static mlib_status mlib_ImageConv1xN(mlib_image       *dst,
           }
 
         } else if (kh == 3) {
+
+          k0 = pk[0]; k1 = pk[1]; k2 = pk[2];
+          p2 = sp[0]; p3 = sp[sll];
+
           sp += 2*sll;
 
           for (j = 0; j <= (hsize - 2); j += 2) {
@@ -357,6 +362,10 @@ static mlib_status mlib_ImageConv1xN(mlib_image       *dst,
           }
 
         } else if (kh == 2) {
+
+          k0 = pk[0]; k1 = pk[1];
+          p2 = sp[0];
+
           sp += sll;
 
           for (j = 0; j <= (hsize - 2); j += 2) {
@@ -389,6 +398,9 @@ static mlib_status mlib_ImageConv1xN(mlib_image       *dst,
           }
 
         } else /* if (kh == 1) */ {
+
+          k0 = pk[0];
+
           for (j = 0; j < hsize; j++) {
             p0 = sp[0];
 
@@ -536,15 +548,14 @@ mlib_status CONV_FUNC(MxN)(mlib_image       *dst,
           sp = sl;
           dp = dl;
 
-          p2 = buff[0]; p3 = buff[1]; p4 = buff[2];
-          p5 = buff[3]; p6 = buff[4]; p7 = buff[5];
-
-          k0 = pk[0]; k1 = pk[1]; k2 = pk[2]; k3 = pk[3];
-          k4 = pk[4]; k5 = pk[5]; k6 = pk[6];
-          pk += kw;
-
           if (kw == 7) {
 
+            p2 = buff[0]; p3 = buff[1]; p4 = buff[2];
+            p5 = buff[3]; p6 = buff[4]; p7 = buff[5];
+
+            k0 = pk[0]; k1 = pk[1]; k2 = pk[2]; k3 = pk[3];
+            k4 = pk[4]; k5 = pk[5]; k6 = pk[6];
+
             if (l < (n - 1) || off < m) {
               for (i = 0; i <= (wid - 2); i += 2) {
                 p0 = p2; p1 = p3; p2 = p4; p3 = p5; p4 = p6; p5 = p7;
@@ -583,6 +594,12 @@ mlib_status CONV_FUNC(MxN)(mlib_image       *dst,
 
           } else if (kw == 6) {
 
+            p2 = buff[0]; p3 = buff[1]; p4 = buff[2];
+            p5 = buff[3]; p6 = buff[4];
+
+            k0 = pk[0]; k1 = pk[1]; k2 = pk[2]; k3 = pk[3];
+            k4 = pk[4]; k5 = pk[5];
+
             if (l < (n - 1) || off < m) {
               for (i = 0; i <= (wid - 2); i += 2) {
                 p0 = p2; p1 = p3; p2 = p4; p3 = p5; p4 = p6;
@@ -618,6 +635,12 @@ mlib_status CONV_FUNC(MxN)(mlib_image       *dst,
 
           } else if (kw == 5) {
 
+            p2 = buff[0]; p3 = buff[1]; p4 = buff[2];
+            p5 = buff[3];
+
+            k0 = pk[0]; k1 = pk[1]; k2 = pk[2]; k3 = pk[3];
+            k4 = pk[4];
+
             if (l < (n - 1) || off < m) {
               for (i = 0; i <= (wid - 2); i += 2) {
                 p0 = p2; p1 = p3; p2 = p4; p3 = p5;
@@ -653,6 +676,10 @@ mlib_status CONV_FUNC(MxN)(mlib_image       *dst,
 
           } else if (kw == 4) {
 
+            p2 = buff[0]; p3 = buff[1]; p4 = buff[2];
+
+            k0 = pk[0]; k1 = pk[1]; k2 = pk[2]; k3 = pk[3];
+
             if (l < (n - 1) || off < m) {
               for (i = 0; i <= (wid - 2); i += 2) {
                 p0 = p2; p1 = p3; p2 = p4;
@@ -688,6 +715,10 @@ mlib_status CONV_FUNC(MxN)(mlib_image       *dst,
 
           } else if (kw == 3) {
 
+            p2 = buff[0]; p3 = buff[1];
+
+            k0 = pk[0]; k1 = pk[1]; k2 = pk[2];
+
             if (l < (n - 1) || off < m) {
               for (i = 0; i <= (wid - 2); i += 2) {
                 p0 = p2; p1 = p3;
@@ -723,6 +754,10 @@ mlib_status CONV_FUNC(MxN)(mlib_image       *dst,
 
           } else /*if (kw == 2)*/ {
 
+            p2 = buff[0];
+
+            k0 = pk[0]; k1 = pk[1];
+
             if (l < (n - 1) || off < m) {
               for (i = 0; i <= (wid - 2); i += 2) {
                 p0 = p2;
@@ -756,6 +791,8 @@ mlib_status CONV_FUNC(MxN)(mlib_image       *dst,
               }
             }
           }
+
+          pk += kw;
         }
       }
 
@@ -882,17 +919,16 @@ mlib_status CONV_FUNC_I(MxN)(mlib_image       *dst,
             if (kw > MAX_KER) kw = kw/2;
           off += kw;
 
-          p2 = sp[0]; p3 = sp[chan1]; p4 = sp[chan2];
-          p5 = sp[chan2 + chan1]; p6 = sp[chan2 + chan2]; p7 = sp[5*chan1];
-
-          k0 = pk[0]; k1 = pk[1]; k2 = pk[2]; k3 = pk[3];
-          k4 = pk[4]; k5 = pk[5]; k6 = pk[6];
-          pk += kw;
-
-          sp += (kw - 1)*chan1;
-
           if (kw == 7) {
 
+            p2 = sp[0]; p3 = sp[chan1]; p4 = sp[chan2];
+            p5 = sp[chan2 + chan1]; p6 = sp[chan2 + chan2]; p7 = sp[5*chan1];
+
+            sp += (kw - 1)*chan1;
+
+            k0 = pk[0]; k1 = pk[1]; k2 = pk[2]; k3 = pk[3];
+            k4 = pk[4]; k5 = pk[5]; k6 = pk[6];
+
             if (l < (n - 1) || off < m) {
               for (i = 0; i <= (wid - 2); i += 2) {
                 p0 = p2; p1 = p3; p2 = p4; p3 = p5; p4 = p6; p5 = p7;
@@ -927,6 +963,14 @@ mlib_status CONV_FUNC_I(MxN)(mlib_image       *dst,
 
           } else if (kw == 6) {
 
+            p2 = sp[0]; p3 = sp[chan1]; p4 = sp[chan2];
+            p5 = sp[chan2 + chan1]; p6 = sp[chan2 + chan2];
+
+            sp += (kw - 1)*chan1;
+
+            k0 = pk[0]; k1 = pk[1]; k2 = pk[2]; k3 = pk[3];
+            k4 = pk[4]; k5 = pk[5];
+
             if (l < (n - 1) || off < m) {
               for (i = 0; i <= (wid - 2); i += 2) {
                 p0 = p2; p1 = p3; p2 = p4; p3 = p5; p4 = p6;
@@ -961,6 +1005,14 @@ mlib_status CONV_FUNC_I(MxN)(mlib_image       *dst,
 
           } else if (kw == 5) {
 
+            p2 = sp[0]; p3 = sp[chan1]; p4 = sp[chan2];
+            p5 = sp[chan2 + chan1];
+
+            sp += (kw - 1)*chan1;
+
+            k0 = pk[0]; k1 = pk[1]; k2 = pk[2]; k3 = pk[3];
+            k4 = pk[4];
+
             if (l < (n - 1) || off < m) {
               for (i = 0; i <= (wid - 2); i += 2) {
                 p0 = p2; p1 = p3; p2 = p4; p3 = p5;
@@ -995,6 +1047,12 @@ mlib_status CONV_FUNC_I(MxN)(mlib_image       *dst,
 
           } else if (kw == 4) {
 
+            p2 = sp[0]; p3 = sp[chan1]; p4 = sp[chan2];
+
+            sp += (kw - 1)*chan1;
+
+            k0 = pk[0]; k1 = pk[1]; k2 = pk[2]; k3 = pk[3];
+
             if (l < (n - 1) || off < m) {
               for (i = 0; i <= (wid - 2); i += 2) {
                 p0 = p2; p1 = p3; p2 = p4;
@@ -1029,6 +1087,12 @@ mlib_status CONV_FUNC_I(MxN)(mlib_image       *dst,
 
           } else if (kw == 3) {
 
+            p2 = sp[0]; p3 = sp[chan1];
+
+            sp += (kw - 1)*chan1;
+
+            k0 = pk[0]; k1 = pk[1]; k2 = pk[2];
+
             if (l < (n - 1) || off < m) {
               for (i = 0; i <= (wid - 2); i += 2) {
                 p0 = p2; p1 = p3;
@@ -1063,6 +1127,12 @@ mlib_status CONV_FUNC_I(MxN)(mlib_image       *dst,
 
           } else if (kw == 2) {
 
+            p2 = sp[0];
+
+            sp += (kw - 1)*chan1;
+
+            k0 = pk[0]; k1 = pk[1];
+
             if (l < (n - 1) || off < m) {
               for (i = 0; i <= (wid - 2); i += 2) {
                 p0 = p2;
@@ -1097,6 +1167,10 @@ mlib_status CONV_FUNC_I(MxN)(mlib_image       *dst,
 
           } else /*if (kw == 1)*/ {
 
+            k0 = pk[0];
+
+            sp += (kw - 1)*chan1;
+
             if (l < (n - 1) || off < m) {
               for (i = 0; i <= (wid - 2); i += 2) {
                 p0 = sp[0];
@@ -1127,6 +1201,8 @@ mlib_status CONV_FUNC_I(MxN)(mlib_image       *dst,
               }
             }
           }
+
+          pk += kw;
         }
       }
 
diff --git a/src/java.desktop/share/native/libmlib_image/mlib_c_ImageConvVersion.c b/src/java.desktop/share/native/libmlib_image/mlib_c_ImageConvVersion.c
index 5f8768fb180..b7e685609c9 100644
--- a/src/java.desktop/share/native/libmlib_image/mlib_c_ImageConvVersion.c
+++ b/src/java.desktop/share/native/libmlib_image/mlib_c_ImageConvVersion.c
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2020, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -51,7 +51,7 @@ mlib_s32 mlib_ImageConvVersion(mlib_s32 m,
                                mlib_s32 scale,
                                mlib_type type)
 {
-  mlib_d64 dscale = 1.0 / (1 << scale); /* 16 < scale <= 31 */
+  mlib_d64 dscale = 1.0 / (((mlib_s64)1) << scale); /* 16 < scale <= 31 */
 
   if (type == MLIB_BYTE) {
     if ((m * n * dscale * 32768.0) > MAX_U8)

From 784dd56ce2fbbbf4d94740e1ce0438907e59f575 Mon Sep 17 00:00:00 2001
From: Phil Race <prr@openjdk.org>
Date: Fri, 6 Mar 2026 18:02:16 +0000
Subject: [PATCH 078/655] 8378999: BeanContextSupport.add(Object) synchronizes
 on its argument

Reviewed-by: aivanov, serb
---
 .../beans/beancontext/BeanContextSupport.java | 133 +++++++++---------
 1 file changed, 63 insertions(+), 70 deletions(-)

diff --git a/src/java.desktop/share/classes/java/beans/beancontext/BeanContextSupport.java b/src/java.desktop/share/classes/java/beans/beancontext/BeanContextSupport.java
index 3aa77048f8f..884b36d4b12 100644
--- a/src/java.desktop/share/classes/java/beans/beancontext/BeanContextSupport.java
+++ b/src/java.desktop/share/classes/java/beans/beancontext/BeanContextSupport.java
@@ -422,42 +422,54 @@ public class      BeanContextSupport extends BeanContextChildSupport
             BeanContextChild cbcc  = getChildBeanContextChild(targetChild);
             BeanContextChild  bccp = null;
 
-            synchronized(targetChild) {
+            if (targetChild instanceof BeanContextProxy) {
+                bccp = ((BeanContextProxy)targetChild).getBeanContextProxy();
 
-                if (targetChild instanceof BeanContextProxy) {
-                    bccp = ((BeanContextProxy)targetChild).getBeanContextProxy();
+                if (bccp == null) throw new NullPointerException("BeanContextPeer.getBeanContextProxy()");
+            }
 
-                    if (bccp == null) throw new NullPointerException("BeanContextPeer.getBeanContextProxy()");
-                }
+            BCSChild bcsc  = createBCSChild(targetChild, bccp);
+            BCSChild pbcsc = null;
 
-                BCSChild bcsc  = createBCSChild(targetChild, bccp);
-                BCSChild pbcsc = null;
+            synchronized (children) {
+                children.put(targetChild, bcsc);
 
-                synchronized (children) {
-                    children.put(targetChild, bcsc);
+                if (bccp != null) children.put(bccp, pbcsc = createBCSChild(bccp, targetChild));
+            }
 
-                    if (bccp != null) children.put(bccp, pbcsc = createBCSChild(bccp, targetChild));
-                }
+            if (cbcc != null) synchronized(cbcc) {
+                try {
+                    cbcc.setBeanContext(getBeanContextPeer());
+                } catch (PropertyVetoException pve) {
 
-                if (cbcc != null) synchronized(cbcc) {
-                    try {
-                        cbcc.setBeanContext(getBeanContextPeer());
-                    } catch (PropertyVetoException pve) {
+                    synchronized (children) {
+                        children.remove(targetChild);
 
-                        synchronized (children) {
-                            children.remove(targetChild);
-
-                            if (bccp != null) children.remove(bccp);
-                        }
-
-                        throw new IllegalStateException();
+                        if (bccp != null) children.remove(bccp);
                     }
 
-                    cbcc.addPropertyChangeListener("beanContext", childPCL);
-                    cbcc.addVetoableChangeListener("beanContext", childVCL);
+                    throw new IllegalStateException();
                 }
 
-                Visibility v = getChildVisibility(targetChild);
+                cbcc.addPropertyChangeListener("beanContext", childPCL);
+                cbcc.addVetoableChangeListener("beanContext", childVCL);
+            }
+
+            Visibility v = getChildVisibility(targetChild);
+
+            if (v != null) {
+                if (okToUseGui)
+                    v.okToUseGui();
+                else
+                    v.dontUseGui();
+            }
+
+            if (getChildSerializable(targetChild) != null) serializable++;
+
+            childJustAddedHook(targetChild, bcsc);
+
+            if (bccp != null) {
+                v = getChildVisibility(bccp);
 
                 if (v != null) {
                     if (okToUseGui)
@@ -466,26 +478,9 @@ public class      BeanContextSupport extends BeanContextChildSupport
                         v.dontUseGui();
                 }
 
-                if (getChildSerializable(targetChild) != null) serializable++;
-
-                childJustAddedHook(targetChild, bcsc);
-
-                if (bccp != null) {
-                    v = getChildVisibility(bccp);
-
-                    if (v != null) {
-                        if (okToUseGui)
-                            v.okToUseGui();
-                        else
-                            v.dontUseGui();
-                    }
-
-                    if (getChildSerializable(bccp) != null) serializable++;
-
-                    childJustAddedHook(bccp, pbcsc);
-                }
-
+                if (getChildSerializable(bccp) != null) serializable++;
 
+                childJustAddedHook(bccp, pbcsc);
             }
 
             // The specification requires that we fire a notification of the change
@@ -536,42 +531,40 @@ public class      BeanContextSupport extends BeanContextChildSupport
             // we are required to notify the child that it is no longer nested here if
             // it implements java.beans.beancontext.BeanContextChild
 
-            synchronized(targetChild) {
-                if (callChildSetBC) {
-                    BeanContextChild cbcc = getChildBeanContextChild(targetChild);
-                    if (cbcc != null) synchronized(cbcc) {
-                        cbcc.removePropertyChangeListener("beanContext", childPCL);
-                        cbcc.removeVetoableChangeListener("beanContext", childVCL);
-
-                        try {
-                            cbcc.setBeanContext(null);
-                        } catch (PropertyVetoException pve1) {
-                            cbcc.addPropertyChangeListener("beanContext", childPCL);
-                            cbcc.addVetoableChangeListener("beanContext", childVCL);
-                            throw new IllegalStateException();
-                        }
+            if (callChildSetBC) {
+                BeanContextChild cbcc = getChildBeanContextChild(targetChild);
+                if (cbcc != null) synchronized(cbcc) {
+                    cbcc.removePropertyChangeListener("beanContext", childPCL);
+                    cbcc.removeVetoableChangeListener("beanContext", childVCL);
 
+                    try {
+                        cbcc.setBeanContext(null);
+                    } catch (PropertyVetoException pve1) {
+                        cbcc.addPropertyChangeListener("beanContext", childPCL);
+                        cbcc.addVetoableChangeListener("beanContext", childVCL);
+                        throw new IllegalStateException();
                     }
+
                 }
+            }
 
-                synchronized (children) {
-                    children.remove(targetChild);
+            synchronized (children) {
+                children.remove(targetChild);
 
-                    if (bcsc.isProxyPeer()) {
-                        pbcsc = children.get(peer = bcsc.getProxyPeer());
-                        children.remove(peer);
-                    }
+                if (bcsc.isProxyPeer()) {
+                    pbcsc = children.get(peer = bcsc.getProxyPeer());
+                    children.remove(peer);
                 }
+            }
 
-                if (getChildSerializable(targetChild) != null) serializable--;
+            if (getChildSerializable(targetChild) != null) serializable--;
 
-                childJustRemovedHook(targetChild, bcsc);
+            childJustRemovedHook(targetChild, bcsc);
 
-                if (peer != null) {
-                    if (getChildSerializable(peer) != null) serializable--;
+            if (peer != null) {
+                if (getChildSerializable(peer) != null) serializable--;
 
-                    childJustRemovedHook(peer, pbcsc);
-                }
+                childJustRemovedHook(peer, pbcsc);
             }
 
             fireChildrenRemoved(new BeanContextMembershipEvent(getBeanContextPeer(), peer == null ? new Object[] { targetChild } : new Object[] { targetChild, peer } ));

From 8ef39a22d855d1b1aaeb39549f6e8413f362338b Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Markus=20Gr=C3=B6nlund?= <mgronlun@openjdk.org>
Date: Sat, 7 Mar 2026 10:56:00 +0000
Subject: [PATCH 079/655] 8374490: Test
 jdk/jfr/event/runtime/TestSafepointEvents.java failed: Expected event
 'jdk.SafepointStateSynchronization' to be present

Reviewed-by: egahlin
---
 .../event/runtime/TestSafepointEvents.java    | 51 +++++++------------
 1 file changed, 19 insertions(+), 32 deletions(-)

diff --git a/test/jdk/jdk/jfr/event/runtime/TestSafepointEvents.java b/test/jdk/jdk/jfr/event/runtime/TestSafepointEvents.java
index 0dccbc4495a..022a9c27674 100644
--- a/test/jdk/jdk/jfr/event/runtime/TestSafepointEvents.java
+++ b/test/jdk/jdk/jfr/event/runtime/TestSafepointEvents.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2013, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2013, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,6 +23,7 @@
 package jdk.jfr.event.runtime;
 
 import static jdk.test.lib.Asserts.assertTrue;
+import static jdk.test.lib.Asserts.assertEquals;
 
 import java.nio.file.Paths;
 import java.time.Duration;
@@ -31,7 +32,6 @@ import java.util.*;
 import jdk.jfr.Recording;
 import jdk.jfr.consumer.RecordedEvent;
 
-import jdk.test.lib.Asserts;
 import jdk.test.lib.jfr.EventNames;
 import jdk.test.lib.jfr.Events;
 import jdk.test.whitebox.WhiteBox;
@@ -65,43 +65,30 @@ public class TestSafepointEvents {
         recording.stop();
 
         try {
-            // Verify that each event type was seen at least once
-            List<RecordedEvent> events = Events.fromRecording(recording);
-            for (String name : EVENT_NAMES) {
-                boolean found = false;
-                for (RecordedEvent event : events) {
-                    found = event.getEventType().getName().equals(name);
-                    if (found) {
-                        break;
-                    }
-                }
-                assertTrue(found, "Expected event from test [" + name + "]");
-            }
-
             // Collect all events grouped by safepoint id
             SortedMap<Long, Set<String>> safepointIds = new TreeMap<>();
-            for (RecordedEvent event : events) {
+            for (RecordedEvent event : Events.fromRecording(recording)) {
                 Long safepointId = event.getValue("safepointId");
-                if (!safepointIds.containsKey(safepointId)) {
-                    safepointIds.put(safepointId, new HashSet<>());
-                }
-                safepointIds.get(safepointId).add(event.getEventType().getName());
+                String eventName = event.getEventType().getName();
+                safepointIds.computeIfAbsent(safepointId, k -> new HashSet<>()).add(eventName);
             }
 
-            // The last safepoint may be related to stopping the recording and can thus be
-            // incomplete - so if there is more than one, ignore the last one
-            if (safepointIds.size() > 1) {
-                safepointIds.remove(safepointIds.lastKey());
-            }
-            Asserts.assertGreaterThanOrEqual(safepointIds.size(), 1, "At least 1 safepoint must have occured");
-
-            // Verify that each safepoint id has an occurence of every event type,
-            // this ensures that all events related to a given safepoint had the same id
-            for (Set<String> safepointEvents : safepointIds.values()) {
-                for (String name : EVENT_NAMES) {
-                    assertTrue(safepointEvents.contains(name), "Expected event '" + name + "' to be present");
+            // Select the first set that is complete.
+            Set<String> safepointEvents = null;
+            for (Long key : safepointIds.keySet()) {
+                safepointEvents = safepointIds.get(key);
+                if (safepointEvents.size() == EVENT_NAMES.length) {
+                    break;
                 }
             }
+            assertEquals(safepointEvents.size(), EVENT_NAMES.length,
+                "At least one safepoint id should map to a set containing an instance of each enabled event type.");
+
+            // Verify that the selected set contains an instance of each enabled event type.
+            for (String name : EVENT_NAMES) {
+                assertTrue(safepointEvents.contains(name), "Expected event '" + name + "' to be present");
+            }
+
         } catch (Throwable e) {
             recording.dump(Paths.get("failed.jfr"));
             throw e;

From 7e5acdc6fa0ca3993bc47bdbb90dc18eebea27b7 Mon Sep 17 00:00:00 2001
From: Jeremy Wood <jwood@openjdk.org>
Date: Sun, 8 Mar 2026 00:39:15 +0000
Subject: [PATCH 080/655] 8378057: CAccessibility roleKey and
 AWTAccessor.AccessibleBundleAccessor are Redundant

Reviewed-by: kizune, serb
---
 .../classes/sun/lwawt/macosx/CAccessibility.java   | 12 +++++++-----
 .../libawt_lwawt/awt/JavaAccessibilityUtilities.m  | 14 --------------
 2 files changed, 7 insertions(+), 19 deletions(-)

diff --git a/src/java.desktop/macosx/classes/sun/lwawt/macosx/CAccessibility.java b/src/java.desktop/macosx/classes/sun/lwawt/macosx/CAccessibility.java
index 494995735e6..636d8240a55 100644
--- a/src/java.desktop/macosx/classes/sun/lwawt/macosx/CAccessibility.java
+++ b/src/java.desktop/macosx/classes/sun/lwawt/macosx/CAccessibility.java
@@ -116,7 +116,9 @@ final class CAccessibility implements PropertyChangeListener {
         if (newValue instanceof Accessible) {
             AccessibleContext nvAC = ((Accessible) newValue).getAccessibleContext();
             AccessibleRole nvRole = nvAC.getAccessibleRole();
-            if (!ignoredRoles.contains(roleKey(nvRole))) {
+            String roleStr = nvRole == null ? null :
+                    AWTAccessor.getAccessibleBundleAccessor().getKey(nvRole);
+            if (!ignoredRoles.contains(roleStr)) {
                 focusChanged();
             }
         }
@@ -1034,8 +1036,10 @@ final class CAccessibility implements PropertyChangeListener {
                 // "ignored", and we should skip it and its descendants
                 if (isShowing(context)) {
                     final AccessibleRole role = context.getAccessibleRole();
-                    if (role != null && ignoredRoles != null &&
-                            ignoredRoles.contains(roleKey(role))) {
+                    String roleStr = role == null ? null :
+                            AWTAccessor.getAccessibleBundleAccessor().getKey(role);
+                    if (roleStr != null && ignoredRoles != null &&
+                            ignoredRoles.contains(roleStr)) {
                         // Get the child's unignored children.
                         _addChildren(child, whichChildren, false,
                                 childrenAndRoles, ChildrenOperations.COMMON);
@@ -1096,8 +1100,6 @@ final class CAccessibility implements PropertyChangeListener {
         return isShowing(parentContext);
     }
 
-    private static native String roleKey(AccessibleRole aRole);
-
     public static Object[] getChildren(final Accessible a, final Component c) {
         if (a == null) return null;
         return invokeAndWait(new Callable<Object[]>() {
diff --git a/src/java.desktop/macosx/native/libawt_lwawt/awt/JavaAccessibilityUtilities.m b/src/java.desktop/macosx/native/libawt_lwawt/awt/JavaAccessibilityUtilities.m
index bf66df162d1..fcd330940cc 100644
--- a/src/java.desktop/macosx/native/libawt_lwawt/awt/JavaAccessibilityUtilities.m
+++ b/src/java.desktop/macosx/native/libawt_lwawt/awt/JavaAccessibilityUtilities.m
@@ -325,20 +325,6 @@ static BOOL JavaAccessibilityIsSupportedAttribute(id element, NSString *attribut
     return [[element accessibilityAttributeNames] indexOfObject:attribute] != NSNotFound;
 }
 
-/*
- * Class:     sun_lwawt_macosx_CAccessibility
- * Method:    roleKey
- * Signature: (Ljavax/accessibility/AccessibleRole;)Ljava/lang/String;
- */
-JNIEXPORT jstring JNICALL Java_sun_lwawt_macosx_CAccessibility_roleKey
-(JNIEnv *env, jclass clz, jobject axRole)
-{
-    DECLARE_CLASS_RETURN(sjc_AccessibleRole, "javax/accessibility/AccessibleRole", NULL);
-    DECLARE_FIELD_RETURN(sjf_key, sjc_AccessibleRole, "key", "Ljava/lang/String;", NULL);
-    return (*env)->GetObjectField(env, axRole, sjf_key);
-}
-
-
 // errors from NSAccessibilityErrors
 void JavaAccessibilityRaiseSetAttributeToIllegalTypeException(const char *functionName, id element, NSString *attribute, id value)
 {

From b159addb80701eed6bc548accb6bee1f535b8e58 Mon Sep 17 00:00:00 2001
From: Kerem Kat <krk@openjdk.org>
Date: Sun, 8 Mar 2026 03:12:02 +0000
Subject: [PATCH 081/655] 8379231: Assembler::mov64 always emits 10-byte movabs
 even for small immediates

Reviewed-by: qamai, dlong
---
 src/hotspot/cpu/x86/macroAssembler_x86.cpp | 24 ++++++++++++++--------
 src/hotspot/cpu/x86/macroAssembler_x86.hpp |  3 +++
 2 files changed, 19 insertions(+), 8 deletions(-)

diff --git a/src/hotspot/cpu/x86/macroAssembler_x86.cpp b/src/hotspot/cpu/x86/macroAssembler_x86.cpp
index b54f6adc263..2d46a50d426 100644
--- a/src/hotspot/cpu/x86/macroAssembler_x86.cpp
+++ b/src/hotspot/cpu/x86/macroAssembler_x86.cpp
@@ -961,7 +961,7 @@ void MacroAssembler::call(AddressLiteral entry, Register rscratch) {
 void MacroAssembler::ic_call(address entry, jint method_index) {
   RelocationHolder rh = virtual_call_Relocation::spec(pc(), method_index);
   // Needs full 64-bit immediate for later patching.
-  mov64(rax, (int64_t)Universe::non_oop_word());
+  Assembler::mov64(rax, (int64_t)Universe::non_oop_word());
   call(AddressLiteral(entry, rh));
 }
 
@@ -1961,6 +1961,20 @@ void MacroAssembler::movflt(XMMRegister dst, AddressLiteral src, Register rscrat
   }
 }
 
+void MacroAssembler::mov64(Register dst, int64_t imm64) {
+  if (is_uimm32(imm64)) {
+    movl(dst, checked_cast<uint32_t>(imm64));
+  } else if (is_simm32(imm64)) {
+    movq(dst, checked_cast<int32_t>(imm64));
+  } else {
+    Assembler::mov64(dst, imm64);
+  }
+}
+
+void MacroAssembler::mov64(Register dst, int64_t imm64, relocInfo::relocType rtype, int format) {
+  Assembler::mov64(dst, imm64, rtype, format);
+}
+
 void MacroAssembler::movptr(Register dst, Register src) {
   movq(dst, src);
 }
@@ -1971,13 +1985,7 @@ void MacroAssembler::movptr(Register dst, Address src) {
 
 // src should NEVER be a real pointer. Use AddressLiteral for true pointers
 void MacroAssembler::movptr(Register dst, intptr_t src) {
-  if (is_uimm32(src)) {
-    movl(dst, checked_cast<uint32_t>(src));
-  } else if (is_simm32(src)) {
-    movq(dst, checked_cast<int32_t>(src));
-  } else {
-    mov64(dst, src);
-  }
+  mov64(dst, src);
 }
 
 void MacroAssembler::movptr(Address dst, Register src) {
diff --git a/src/hotspot/cpu/x86/macroAssembler_x86.hpp b/src/hotspot/cpu/x86/macroAssembler_x86.hpp
index 5c049f710e2..8469deaa8be 100644
--- a/src/hotspot/cpu/x86/macroAssembler_x86.hpp
+++ b/src/hotspot/cpu/x86/macroAssembler_x86.hpp
@@ -1869,6 +1869,9 @@ public:
   void mov_metadata(Register dst, Metadata* obj);
   void mov_metadata(Address  dst, Metadata* obj, Register rscratch);
 
+  void mov64(Register dst, int64_t imm64);
+  void mov64(Register dst, int64_t imm64, relocInfo::relocType rtype, int format);
+
   void movptr(Register     dst, Register       src);
   void movptr(Register     dst, Address        src);
   void movptr(Register     dst, AddressLiteral src);

From 8c4c8a16171187a4a1e9a95c04d20f2efd94145f Mon Sep 17 00:00:00 2001
From: Prasanta Sadhukhan <psadhukhan@openjdk.org>
Date: Mon, 9 Mar 2026 01:21:34 +0000
Subject: [PATCH 082/655] 8378417: Printing All pages results in NPE for 1.1
 PrintJob

Reviewed-by: prr, aivanov
---
 .../classes/sun/print/PrintJobDelegate.java   |  8 ++-
 .../classes/sun/awt/windows/WPrinterJob.java  |  4 +-
 .../awt/PrintJob/TestPrintNoException.java    | 61 +++++++++++++++++++
 .../java/awt/print/PrinterJob/PageRanges.java |  2 +-
 4 files changed, 70 insertions(+), 5 deletions(-)
 create mode 100644 test/jdk/java/awt/PrintJob/TestPrintNoException.java

diff --git a/src/java.desktop/share/classes/sun/print/PrintJobDelegate.java b/src/java.desktop/share/classes/sun/print/PrintJobDelegate.java
index 5a88d4b9d45..bca3301b5c9 100644
--- a/src/java.desktop/share/classes/sun/print/PrintJobDelegate.java
+++ b/src/java.desktop/share/classes/sun/print/PrintJobDelegate.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2000, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2000, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -526,8 +526,10 @@ public class PrintJobDelegate implements Printable, Runnable {
         }
 
         PageRanges range = (PageRanges)attributes.get(PageRanges.class);
-        int[][] members = range.getMembers();
-        jobAttributes.setPageRanges(members);
+        if (range != null) {
+            int[][] members = range.getMembers();
+            jobAttributes.setPageRanges(members);
+        }
 
         SheetCollate collation =
             (SheetCollate)attributes.get(SheetCollate.class);
diff --git a/src/java.desktop/windows/classes/sun/awt/windows/WPrinterJob.java b/src/java.desktop/windows/classes/sun/awt/windows/WPrinterJob.java
index 1da9db3a35b..b238921cb77 100644
--- a/src/java.desktop/windows/classes/sun/awt/windows/WPrinterJob.java
+++ b/src/java.desktop/windows/classes/sun/awt/windows/WPrinterJob.java
@@ -1734,7 +1734,9 @@ public final class WPrinterJob extends RasterPrinterJob
                 attributes.add(new PageRanges(from, to));
                 setPageRange(from, to);
             } else {
-                attributes.remove(PageRanges.class);
+                // Sets default values for PageRange attribute and setPageRange
+                attributes.add(new PageRanges(1,
+                                              Integer.MAX_VALUE));
                 setPageRange(Pageable.UNKNOWN_NUMBER_OF_PAGES,
                              Pageable.UNKNOWN_NUMBER_OF_PAGES);
             }
diff --git a/test/jdk/java/awt/PrintJob/TestPrintNoException.java b/test/jdk/java/awt/PrintJob/TestPrintNoException.java
new file mode 100644
index 00000000000..b54ac8de56b
--- /dev/null
+++ b/test/jdk/java/awt/PrintJob/TestPrintNoException.java
@@ -0,0 +1,61 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+import java.awt.Frame;
+import java.awt.JobAttributes;
+import java.awt.PrintJob;
+import java.awt.Robot;
+import java.awt.Toolkit;
+import java.awt.event.KeyEvent;
+
+/*
+ * @test
+ * @bug 8378417
+ * @key headful printer
+ * @summary Verifies No Exception is thrown when Printing "All" pages
+ * @run main TestPrintNoException
+ */
+
+public class TestPrintNoException {
+
+    public static void main(String[] args) throws Exception {
+        Robot robot = new Robot();
+        Thread t = new Thread (() -> {
+            robot.delay(5000);
+            robot.keyPress(KeyEvent.VK_ENTER);
+            robot.keyRelease(KeyEvent.VK_ENTER);
+            robot.waitForIdle();
+        });
+
+        Frame testFrame = new Frame("print");
+        try {
+            t.start();
+            PrintJob pj = Toolkit.getDefaultToolkit().getPrintJob(testFrame, null, null);
+            if (pj != null) {
+                pj.end();
+            }
+        } finally {
+            testFrame.dispose();
+        }
+    }
+}
diff --git a/test/jdk/java/awt/print/PrinterJob/PageRanges.java b/test/jdk/java/awt/print/PrinterJob/PageRanges.java
index 691357d5a3c..3a84725910c 100644
--- a/test/jdk/java/awt/print/PrinterJob/PageRanges.java
+++ b/test/jdk/java/awt/print/PrinterJob/PageRanges.java
@@ -23,7 +23,7 @@
 
 /*
  * @test
- * @bug 6575331 8297191 8373239
+ * @bug 6575331 8297191 8373239 8378417
  * @key printer
  * @summary The specified pages should be printed.
  * @library /java/awt/regtesthelpers

From b2728d0a4b1185efac73d18ee3ac3f928f6a0b42 Mon Sep 17 00:00:00 2001
From: Emanuel Peter <epeter@openjdk.org>
Date: Mon, 9 Mar 2026 07:26:02 +0000
Subject: [PATCH 083/655] 8376891: [VectorAlgorithms] add more if-conversion
 benchmarks and tests

Reviewed-by: qamai, psandoz, xgong, jbhateja
---
 .../vectorization/TestVectorAlgorithms.java   | 135 +++++++-
 .../vectorization/VectorAlgorithmsImpl.java   | 325 ++++++++++++++++-
 .../bench/vm/compiler/VectorAlgorithms.java   |  74 +++-
 .../vm/compiler/VectorAlgorithmsImpl.java     | 326 +++++++++++++++++-
 4 files changed, 815 insertions(+), 45 deletions(-)

diff --git a/test/hotspot/jtreg/compiler/vectorization/TestVectorAlgorithms.java b/test/hotspot/jtreg/compiler/vectorization/TestVectorAlgorithms.java
index 785a6de30a0..ed04950eb07 100644
--- a/test/hotspot/jtreg/compiler/vectorization/TestVectorAlgorithms.java
+++ b/test/hotspot/jtreg/compiler/vectorization/TestVectorAlgorithms.java
@@ -79,6 +79,12 @@ public class TestVectorAlgorithms {
 
     VectorAlgorithmsImpl.Data d;
 
+    // We should test with a wide range of probabilities, to ensure correctness,
+    // and also to ensure we get all branches compiled, so IR matching compiles
+    // also for branches that require a very extreme probability.
+    private static final float[] BRANCH_PROBABILITIES = new float[] {0f, 0.1f, 0.3f, 0.5f, 0.7f, 0.9f, 1f};
+    private static int branch_probabilities_idx = 0;
+
     public static void main(String[] args) {
         TestFramework framework = new TestFramework();
         framework.addFlags("--add-modules=jdk.incubator.vector",
@@ -133,16 +139,19 @@ public class TestVectorAlgorithms {
         testGroups.get("findMinIndexI").put("findMinIndexI_VectorAPI", i -> { return findMinIndexI_VectorAPI(d.aI); });
 
         testGroups.put("findI", new HashMap<String,TestFunction>());
-        testGroups.get("findI").put("findI_loop",      i -> { return findI_loop(d.aI, d.eI[i]); });
-        testGroups.get("findI").put("findI_VectorAPI", i -> { return findI_VectorAPI(d.aI, d.eI[i]); });
+        testGroups.get("findI").put("findI_loop",      i -> { return findI_loop(d.aI, d.eI_findI[i]); });
+        testGroups.get("findI").put("findI_VectorAPI", i -> { return findI_VectorAPI(d.aI, d.eI_findI[i]); });
 
         testGroups.put("reverseI", new HashMap<String,TestFunction>());
         testGroups.get("reverseI").put("reverseI_loop",      i -> { return reverseI_loop(d.aI, d.rI1); });
         testGroups.get("reverseI").put("reverseI_VectorAPI", i -> { return reverseI_VectorAPI(d.aI, d.rI2); });
 
         testGroups.put("filterI", new HashMap<String,TestFunction>());
-        testGroups.get("filterI").put("filterI_loop",      i -> { return filterI_loop(d.aI, d.rI1, d.eI[i]); });
-        testGroups.get("filterI").put("filterI_VectorAPI", i -> { return filterI_VectorAPI(d.aI, d.rI2, d.eI[i]); });
+        testGroups.get("filterI").put("filterI_loop",            i -> { return filterI_loop(d.aI_filterI, d.rI1, d.eI_filterI); });
+        testGroups.get("filterI").put("filterI_VectorAPI_v1",    i -> { return filterI_VectorAPI_v1(d.aI_filterI, d.rI2, d.eI_filterI); });
+        testGroups.get("filterI").put("filterI_VectorAPI_v2_l2", i -> { return filterI_VectorAPI_v2_l2(d.aI_filterI, d.rI3, d.eI_filterI); });
+        testGroups.get("filterI").put("filterI_VectorAPI_v2_l4", i -> { return filterI_VectorAPI_v2_l4(d.aI_filterI, d.rI4, d.eI_filterI); });
+        testGroups.get("filterI").put("filterI_VectorAPI_v2_l8", i -> { return filterI_VectorAPI_v2_l8(d.aI_filterI, d.rI5, d.eI_filterI); });
 
         testGroups.put("reduceAddIFieldsX4", new HashMap<String,TestFunction>());
         testGroups.get("reduceAddIFieldsX4").put("reduceAddIFieldsX4_loop",      i -> { return reduceAddIFieldsX4_loop(d.oopsX4, d.memX4); });
@@ -152,6 +161,17 @@ public class TestVectorAlgorithms {
         testGroups.get("lowerCaseB").put("lowerCaseB_loop",         i -> { return lowerCaseB_loop(d.strB, d.rB1); });
         testGroups.get("lowerCaseB").put("lowerCaseB_VectorAPI_v1", i -> { return lowerCaseB_VectorAPI_v1(d.strB, d.rB2); });
         testGroups.get("lowerCaseB").put("lowerCaseB_VectorAPI_v2", i -> { return lowerCaseB_VectorAPI_v2(d.strB, d.rB3); });
+
+        testGroups.put("conditionalSumB", new HashMap<String,TestFunction>());
+        testGroups.get("conditionalSumB").put("conditionalSumB_loop",         i -> { return conditionalSumB_loop(d.strB); });
+        testGroups.get("conditionalSumB").put("conditionalSumB_VectorAPI_v1", i -> { return conditionalSumB_VectorAPI_v1(d.strB); });
+        testGroups.get("conditionalSumB").put("conditionalSumB_VectorAPI_v2", i -> { return conditionalSumB_VectorAPI_v2(d.strB); });
+
+
+        testGroups.put("pieceWise2FunctionF", new HashMap<String,TestFunction>());
+        testGroups.get("pieceWise2FunctionF").put("pieceWise2FunctionF_loop",         _ -> { return pieceWise2FunctionF_loop(d.xF, d.rF1); });
+        testGroups.get("pieceWise2FunctionF").put("pieceWise2FunctionF_VectorAPI_v1", _ -> { return pieceWise2FunctionF_VectorAPI_v1(d.xF, d.rF2); });
+        testGroups.get("pieceWise2FunctionF").put("pieceWise2FunctionF_VectorAPI_v2", _ -> { return pieceWise2FunctionF_VectorAPI_v2(d.xF, d.rF3); });
     }
 
     @Warmup(100)
@@ -186,12 +206,21 @@ public class TestVectorAlgorithms {
                  "reverseI_loop",
                  "reverseI_VectorAPI",
                  "filterI_loop",
-                 "filterI_VectorAPI",
+                 "filterI_VectorAPI_v1",
+                 "filterI_VectorAPI_v2_l2",
+                 "filterI_VectorAPI_v2_l4",
+                 "filterI_VectorAPI_v2_l8",
                  "reduceAddIFieldsX4_loop",
                  "reduceAddIFieldsX4_VectorAPI",
                  "lowerCaseB_loop",
                  "lowerCaseB_VectorAPI_v1",
-                 "lowerCaseB_VectorAPI_v2"})
+                 "lowerCaseB_VectorAPI_v2",
+                 "conditionalSumB_loop",
+                 "conditionalSumB_VectorAPI_v1",
+                 "conditionalSumB_VectorAPI_v2",
+                 "pieceWise2FunctionF_loop",
+                 "pieceWise2FunctionF_VectorAPI_v1",
+                 "pieceWise2FunctionF_VectorAPI_v2"})
     public void runTests(RunInfo info) {
         // Repeat many times, so that we also have multiple iterations for post-warmup to potentially recompile
         int iters = info.isWarmUp() ? 1 : 20;
@@ -200,7 +229,9 @@ public class TestVectorAlgorithms {
             int size = 100_000 + RANDOM.nextInt(10_000);
             int seed = RANDOM.nextInt();
             int numXObjects = 10_000;
-            d = new VectorAlgorithmsImpl.Data(size, seed, numXObjects);
+            branch_probabilities_idx = (branch_probabilities_idx + 1) % BRANCH_PROBABILITIES.length;
+            float branchProbability = BRANCH_PROBABILITIES[branch_probabilities_idx];
+            d = new VectorAlgorithmsImpl.Data(size, seed, numXObjects, branchProbability);
 
             // Run all tests
             for (Map.Entry<String, Map<String,TestFunction>> group_entry : testGroups.entrySet()) {
@@ -510,8 +541,45 @@ public class TestVectorAlgorithms {
                   IRNode.COMPRESS_VI,         "> 0",
                   IRNode.STORE_VECTOR_MASKED, "> 0"},
         applyIfCPUFeatureOr = {"avx2", "true", "sve", "true"})
-    public Object filterI_VectorAPI(int[] a, int[] r, int threshold) {
-        return VectorAlgorithmsImpl.filterI_VectorAPI(a, r, threshold);
+    public Object filterI_VectorAPI_v1(int[] a, int[] r, int threshold) {
+        return VectorAlgorithmsImpl.filterI_VectorAPI_v1(a, r, threshold);
+    }
+
+    @Test
+    @IR(counts = {IRNode.LOAD_VECTOR_I, IRNode.VECTOR_SIZE_2, "> 0",
+                  IRNode.VECTOR_MASK_CMP,                     "= 0", // not implemented
+                  IRNode.VECTOR_TEST,                         "= 0", // not implemented
+                  IRNode.STORE_VECTOR,                        "> 0"},
+        applyIfCPUFeature = {"sse4.1", "true"})
+    // x86 seems to have a limitation with 2-element VectorStoreMask, this blocks intrinsification
+    @IR(counts = {IRNode.LOAD_VECTOR_I, IRNode.VECTOR_SIZE_2, "> 0",
+                  IRNode.VECTOR_MASK_CMP,                     "> 0",
+                  IRNode.VECTOR_TEST,                         "> 0",
+                  IRNode.STORE_VECTOR,                        "> 0"},
+        applyIfCPUFeatureOr = {"asimd", "true"})
+    public Object filterI_VectorAPI_v2_l2(int[] a, int[] r, int threshold) {
+        return VectorAlgorithmsImpl.filterI_VectorAPI_v2_l2(a, r, threshold);
+    }
+
+    @Test
+    @IR(counts = {IRNode.LOAD_VECTOR_I, IRNode.VECTOR_SIZE_4, "> 0",
+                  IRNode.VECTOR_MASK_CMP,                     "> 0",
+                  IRNode.VECTOR_TEST,                         "> 0",
+                  IRNode.STORE_VECTOR,                        "> 0"},
+        applyIfCPUFeatureOr = {"avx", "true", "asimd", "true"})
+    public Object filterI_VectorAPI_v2_l4(int[] a, int[] r, int threshold) {
+        return VectorAlgorithmsImpl.filterI_VectorAPI_v2_l4(a, r, threshold);
+    }
+
+    @Test
+    @IR(counts = {IRNode.LOAD_VECTOR_I, IRNode.VECTOR_SIZE_8, "> 0",
+                  IRNode.VECTOR_MASK_CMP,                     "> 0",
+                  IRNode.VECTOR_TEST,                         "> 0",
+                  IRNode.STORE_VECTOR,                        "> 0"},
+        applyIfCPUFeatureOr = {"avx2", "true"})
+    // Note: need 8int = 256bit vector. NEON only has 128bit.
+    public Object filterI_VectorAPI_v2_l8(int[] a, int[] r, int threshold) {
+        return VectorAlgorithmsImpl.filterI_VectorAPI_v2_l8(a, r, threshold);
     }
 
     @Test
@@ -559,4 +627,53 @@ public class TestVectorAlgorithms {
     public Object lowerCaseB_VectorAPI_v2(byte[] a, byte[] r) {
         return VectorAlgorithmsImpl.lowerCaseB_VectorAPI_v2(a, r);
     }
+
+    @Test
+    @IR(counts = {IRNode.LOAD_VECTOR_B, "= 0"})
+    // Currently does not vectorize, but might in the future.
+    public Object conditionalSumB_loop(byte[] a) {
+        return VectorAlgorithmsImpl.conditionalSumB_loop(a);
+    }
+
+    @Test
+    @IR(counts = {IRNode.LOAD_VECTOR_B, IRNode.VECTOR_SIZE + "min(max_int, max_byte)", "> 0",
+                  IRNode.ADD_VI,        IRNode.VECTOR_SIZE + "min(max_int, max_byte)", "> 0"},
+        applyIfCPUFeature = {"avx2", "true"})
+    // Note: we need at least a 256bit int vector. NEON only has 128bit.
+    public Object conditionalSumB_VectorAPI_v1(byte[] a) {
+        return VectorAlgorithmsImpl.conditionalSumB_VectorAPI_v1(a);
+    }
+
+    @Test
+    @IR(counts = {IRNode.LOAD_VECTOR_B, "> 0",
+                  IRNode.ADD_VI,        "> 0"},
+        applyIfCPUFeatureOr = {"sse4.1", "true", "asimd", "true"})
+    public Object conditionalSumB_VectorAPI_v2(byte[] a) {
+        return VectorAlgorithmsImpl.conditionalSumB_VectorAPI_v2(a);
+    }
+
+    @Test
+    @IR(counts = {IRNode.LOAD_VECTOR_F, "= 0"})
+    // Currently does not vectorize, but might in the future.
+    public Object pieceWise2FunctionF_loop(float[] a, float[] r) {
+        return VectorAlgorithmsImpl.pieceWise2FunctionF_loop(a, r);
+    }
+
+    @Test
+    @IR(counts = {IRNode.LOAD_VECTOR_F, "> 0",
+                  IRNode.MUL_VF,        "> 0",
+                  IRNode.SQRT_VF,       "> 0"},
+        applyIfCPUFeatureOr = {"avx2", "true", "asimd", "true"})
+    public Object pieceWise2FunctionF_VectorAPI_v1(float[] a, float[] r) {
+        return VectorAlgorithmsImpl.pieceWise2FunctionF_VectorAPI_v1(a, r);
+    }
+
+    @Test
+    @IR(counts = {IRNode.LOAD_VECTOR_F, "> 0",
+                  IRNode.MUL_VF,        "> 0",
+                  IRNode.SQRT_VF,       "> 0"},
+        applyIfCPUFeatureOr = {"avx2", "true", "asimd", "true"})
+    public Object pieceWise2FunctionF_VectorAPI_v2(float[] a, float[] r) {
+        return VectorAlgorithmsImpl.pieceWise2FunctionF_VectorAPI_v2(a, r);
+    }
 }
diff --git a/test/hotspot/jtreg/compiler/vectorization/VectorAlgorithmsImpl.java b/test/hotspot/jtreg/compiler/vectorization/VectorAlgorithmsImpl.java
index 2dfac704069..8276d90509f 100644
--- a/test/hotspot/jtreg/compiler/vectorization/VectorAlgorithmsImpl.java
+++ b/test/hotspot/jtreg/compiler/vectorization/VectorAlgorithmsImpl.java
@@ -36,6 +36,8 @@ public class VectorAlgorithmsImpl {
     private static final VectorSpecies<Integer> SPECIES_I    = IntVector.SPECIES_PREFERRED;
     private static final VectorSpecies<Integer> SPECIES_I512 = IntVector.SPECIES_512;
     private static final VectorSpecies<Integer> SPECIES_I256 = IntVector.SPECIES_256;
+    private static final VectorSpecies<Integer> SPECIES_I128 = IntVector.SPECIES_128;
+    private static final VectorSpecies<Integer> SPECIES_I64  = IntVector.SPECIES_64;
     private static final VectorSpecies<Byte> SPECIES_B       = ByteVector.SPECIES_PREFERRED;
     private static final VectorSpecies<Byte> SPECIES_B64     = ByteVector.SPECIES_64;
     private static final VectorSpecies<Float> SPECIES_F      = FloatVector.SPECIES_PREFERRED;
@@ -58,15 +60,31 @@ public class VectorAlgorithmsImpl {
         public int[] rI2;
         public int[] rI3;
         public int[] rI4;
-        public int[] eI;
+        public int[] rI5;
+
+        // Search element for "findI"
+        public int[] eI_findI;
         // The test has to use the same index into eI for all implementations. But in the
         // benchmark, we'd like to use random indices, so we use the index to advance through
         // the array.
-        public int eI_idx = 0;
+        public int eI_findI_idx = 0;
+
+        // Data and threshold eI value for "filterI".
+        // We create the data in a range, and then pick a threshold scaled to that range,
+        // so that the branch in the filter is branchProbability.
+        public int[] aI_filterI;
+        public int eI_filterI;
 
         public float[] aF;
         public float[] bF;
 
+        // Input for piece-wise functions.
+        // Uniform [0..1[ with probability p and Uniform [1..2[ with probability (1-p)
+        public float[] xF;
+        public float[] rF1;
+        public float[] rF2;
+        public float[] rF3;
+
         public byte[] aB;
         public byte[] strB;
         public byte[] rB1;
@@ -76,7 +94,7 @@ public class VectorAlgorithmsImpl {
         public int[] oopsX4;
         public int[] memX4;
 
-        public Data(int size, int seed, int numX4Objects) {
+        public Data(int size, int seed, int numX4Objects, float branchProbability) {
             Random random = new Random(seed);
 
             // int: one input array and multiple output arrays so different implementations can
@@ -86,14 +104,20 @@ public class VectorAlgorithmsImpl {
             rI2 = new int[size];
             rI3 = new int[size];
             rI4 = new int[size];
+            rI5 = new int[size];
             Arrays.setAll(aI, i -> random.nextInt());
 
             // Populate with some random values from aI, and some totally random values.
-            eI = new int[0x10000];
-            for (int i = 0; i < eI.length; i++) {
-                eI[i] = (random.nextInt(10) == 0) ? random.nextInt() : aI[random.nextInt(size)];
+            eI_findI = new int[0x10000];
+            for (int i = 0; i < eI_findI.length; i++) {
+                eI_findI[i] = (random.nextInt(10) == 0) ? random.nextInt() : aI[random.nextInt(size)];
             }
 
+            int filterI_range = 1000_000;
+            aI_filterI = new int[size];
+            Arrays.setAll(aI_filterI, i -> random.nextInt(filterI_range));
+            eI_filterI = (int)(filterI_range * (1.0f - branchProbability));
+
             // X4 oop setup.
             // oopsX4 holds "addresses" (i.e. indices), that point to the 16-byte objects in memX4.
             oopsX4 = new int[size];
@@ -117,14 +141,30 @@ public class VectorAlgorithmsImpl {
                 bF[i] = random.nextInt(32) - 16;
             }
 
+            xF = new float[size];
+            rF1 = new float[size];
+            rF2 = new float[size];
+            rF3 = new float[size];
+            for (int i = 0; i < size; i++) {
+                xF[i] = (random.nextFloat() < branchProbability)
+                        ? 0f + random.nextFloat()
+                        : 1f + random.nextFloat();
+            }
+
             // byte: just random data.
             aB = new byte[size];
-            strB = new byte[size];
             rB1 = new byte[size];
             rB2 = new byte[size];
             rB3 = new byte[size];
             random.nextBytes(aB);
-            random.nextBytes(strB); // TODO: special data!
+
+            // byte string: for lowerCase benchmark.
+            strB = new byte[size];
+            for (int i = 0; i < size; i++) {
+                strB[i] = (random.nextFloat() < branchProbability)
+                          ? (byte)(random.nextInt(16) + 'A')
+                          : (byte)(random.nextInt(16) + 'a');
+            }
         }
     }
 
@@ -651,13 +691,12 @@ public class VectorAlgorithmsImpl {
         return r;
     }
 
-    public static Object filterI_VectorAPI(int[] a, int[] r, int threshold) {
-        var thresholds = IntVector.broadcast(SPECIES_I, threshold);
+    public static Object filterI_VectorAPI_v1(int[] a, int[] r, int threshold) {
         int j = 0;
         int i = 0;
         for (; i < SPECIES_I.loopBound(a.length); i += SPECIES_I.length()) {
             IntVector v = IntVector.fromArray(SPECIES_I, a, i);
-            var mask = v.compare(VectorOperators.GE, thresholds);
+            var mask = v.compare(VectorOperators.GE, threshold);
             v = v.compress(mask);
             int trueCount = mask.trueCount();
             var prefixMask = mask.compress();
@@ -676,6 +715,98 @@ public class VectorAlgorithmsImpl {
         return r;
     }
 
+    // Idea: on platforms that do not support the "v1" solution with "compress" and
+    //       masked stores, we struggle to deal with the loop-carried dependency of j.
+    //       But we can still use dynamic uniformity to enable some vectorized performance.
+    public static Object filterI_VectorAPI_v2_l2(int[] a, int[] r, int threshold) {
+        int j = 0;
+        int i = 0;
+        for (; i < SPECIES_I64.loopBound(a.length); i += SPECIES_I64.length()) {
+            IntVector v = IntVector.fromArray(SPECIES_I64, a, i);
+            var mask = v.compare(VectorOperators.GE, threshold);
+            if (mask.allTrue()) {
+                v.intoArray(r, j);
+                j += 2;
+            } else if (mask.anyTrue()) {
+                if (mask.laneIsSet(0)) { r[j++] = v.lane(0); }
+                if (mask.laneIsSet(1)) { r[j++] = v.lane(1); }
+            } else {
+                // nothing
+            }
+        }
+        for (; i < a.length; i++) {
+            int ai = a[i];
+            if (ai >= threshold) {
+                r[j++] = ai;
+            }
+        }
+        // Just force the resulting length onto the same array.
+        r[r.length - 1] = j;
+        return r;
+    }
+
+    public static Object filterI_VectorAPI_v2_l4(int[] a, int[] r, int threshold) {
+        int j = 0;
+        int i = 0;
+        for (; i < SPECIES_I128.loopBound(a.length); i += SPECIES_I128.length()) {
+            IntVector v = IntVector.fromArray(SPECIES_I128, a, i);
+            var mask = v.compare(VectorOperators.GE, threshold);
+            if (mask.allTrue()) {
+                v.intoArray(r, j);
+                j += 4;
+            } else if (mask.anyTrue()) {
+                if (mask.laneIsSet(0)) { r[j++] = v.lane(0); }
+                if (mask.laneIsSet(1)) { r[j++] = v.lane(1); }
+                if (mask.laneIsSet(2)) { r[j++] = v.lane(2); }
+                if (mask.laneIsSet(3)) { r[j++] = v.lane(3); }
+            } else {
+                // nothing
+            }
+        }
+        for (; i < a.length; i++) {
+            int ai = a[i];
+            if (ai >= threshold) {
+                r[j++] = ai;
+            }
+        }
+        // Just force the resulting length onto the same array.
+        r[r.length - 1] = j;
+        return r;
+    }
+
+    public static Object filterI_VectorAPI_v2_l8(int[] a, int[] r, int threshold) {
+        int j = 0;
+        int i = 0;
+        for (; i < SPECIES_I256.loopBound(a.length); i += SPECIES_I256.length()) {
+            IntVector v = IntVector.fromArray(SPECIES_I256, a, i);
+            var mask = v.compare(VectorOperators.GE, threshold);
+            if (mask.allTrue()) {
+                v.intoArray(r, j);
+                j += 8;
+            } else if (mask.anyTrue()) {
+                if (mask.laneIsSet(0)) { r[j++] = v.lane(0); }
+                if (mask.laneIsSet(1)) { r[j++] = v.lane(1); }
+                if (mask.laneIsSet(2)) { r[j++] = v.lane(2); }
+                if (mask.laneIsSet(3)) { r[j++] = v.lane(3); }
+                if (mask.laneIsSet(4)) { r[j++] = v.lane(4); }
+                if (mask.laneIsSet(5)) { r[j++] = v.lane(5); }
+                if (mask.laneIsSet(6)) { r[j++] = v.lane(6); }
+                if (mask.laneIsSet(7)) { r[j++] = v.lane(7); }
+            } else {
+                // nothing
+            }
+        }
+        for (; i < a.length; i++) {
+            int ai = a[i];
+            if (ai >= threshold) {
+                r[j++] = ai;
+            }
+        }
+        // Just force the resulting length onto the same array.
+        r[r.length - 1] = j;
+        return r;
+    }
+
     // X4: ints simulate 4-byte oops.
     // oops: if non-zero (= non-null), every entry simulates a 4-byte oop, pointing into mem.
     // mem: an int array that simulates the memory.
@@ -771,4 +902,176 @@ public class VectorAlgorithmsImpl {
         }
         return r;
     }
+
+    public static int conditionalSumB_loop(byte[] a) {
+        int sum = 0;
+        for (int i = 0; i < a.length; i++) {
+            byte c = a[i];
+            if (c >= 'A' && c <= 'Z') {
+                sum += c;
+            }
+        }
+        return sum;
+    }
+
+    public static int conditionalSumB_VectorAPI_v1(byte[] a) {
+        return ConditionalSumB_VectorAPI_V1.compute(a);
+    }
+
+    private static class ConditionalSumB_VectorAPI_V1 {
+        // Pick I species to be a full vector, and the B vector a quarter its bit length.
+        // However, we have to get at least 64bits for the B vector, so at least 256bits
+        // for the int vector - a sad restriction by the currently very narrow range of
+        // supported shapes.
+        private static final int BITS_I = Math.max(256, IntVector.SPECIES_PREFERRED.vectorBitSize());
+        private static final int BITS_B = BITS_I / 4;
+        private static final VectorShape SHAPE_I = VectorShape.forBitSize(BITS_I);
+        private static final VectorShape SHAPE_B = VectorShape.forBitSize(BITS_B);
+        private static final VectorSpecies<Integer> SPECIES_I = SHAPE_I.withLanes(int.class);
+        private static final VectorSpecies<Byte>    SPECIES_B = SHAPE_B.withLanes(byte.class);
+
+        public static int compute(byte[] a) {
+            var zeroB = ByteVector.zero(SPECIES_B);
+            var accI = IntVector.zero(SPECIES_I);
+            int i;
+            for (i = 0; i < SPECIES_B.loopBound(a.length); i += SPECIES_B.length()) {
+                var vB = ByteVector.fromArray(SPECIES_B, a, i);
+                var maskA = vB.compare(VectorOperators.GE, (byte)'A');
+                var maskZ = vB.compare(VectorOperators.LE, (byte)'Z');
+                var mask = maskA.and(maskZ);
+                vB = zeroB.blend(vB, mask);
+                var vI = vB.castShape(SPECIES_I, 0);
+                accI = accI.add(vI);
+            }
+            int sum = accI.reduceLanes(VectorOperators.ADD);
+            for (; i < a.length; i++) {
+                byte c = a[i];
+                if (c >= 'A' && c <= 'Z') {
+                    sum += c;
+                }
+            }
+            return sum;
+        }
+    }
+
+    public static int conditionalSumB_VectorAPI_v2(byte[] a) {
+        return ConditionalSumB_VectorAPI_V2.compute(a);
+    }
+
+    private static class ConditionalSumB_VectorAPI_V2 {
+        // Pick B species to be a full vector, and use 4 I vectors of the same bit size.
+        private static final VectorSpecies<Byte>    SPECIES_B = ByteVector.SPECIES_PREFERRED;
+        private static final VectorSpecies<Integer> SPECIES_I = SPECIES_B.vectorShape().withLanes(int.class);
+
+        public static int compute(byte[] a) {
+            var zeroB = ByteVector.zero(SPECIES_B);
+            var accI = IntVector.zero(SPECIES_I);
+            int i;
+            for (i = 0; i < SPECIES_B.loopBound(a.length); i += SPECIES_B.length()) {
+                var vB = ByteVector.fromArray(SPECIES_B, a, i);
+                var maskA = vB.compare(VectorOperators.GE, (byte)'A');
+                var maskZ = vB.compare(VectorOperators.LE, (byte)'Z');
+                var mask = maskA.and(maskZ);
+                vB = zeroB.blend(vB, mask);
+                // When casting byte->int, we get 4x the bits, and split them into 4 parts.
+                var vI0 = vB.castShape(SPECIES_I, 0);
+                var vI1 = vB.castShape(SPECIES_I, 1);
+                var vI2 = vB.castShape(SPECIES_I, 2);
+                var vI3 = vB.castShape(SPECIES_I, 3);
+                accI = accI.add(vI0.add(vI1).add(vI2).add(vI3));
+            }
+            int sum = accI.reduceLanes(VectorOperators.ADD);
+            for (; i < a.length; i++) {
+                byte c = a[i];
+                if (c >= 'A' && c <= 'Z') {
+                    sum += c;
+                }
+            }
+            return sum;
+        }
+    }
+
+    public static float[] pieceWise2FunctionF_loop(float[] a, float[] r) {
+        for (int i = 0; i < a.length; i++) {
+            float ai = a[i];
+            if (ai < 1f) {
+                float a2 = ai * ai;
+                float a4 = a2 * a2;
+                float a8 = a4 * a4;
+                r[i] = a8;
+            } else {
+                float s2 = (float)Math.sqrt(ai);
+                float s4 = (float)Math.sqrt(s2);
+                float s8 = (float)Math.sqrt(s4);
+                r[i] = s8;
+            }
+        }
+        return r;
+    }
+
+    public static float[] pieceWise2FunctionF_VectorAPI_v1(float[] a, float[] r) {
+        int i;
+        for (i = 0; i < SPECIES_F.loopBound(a.length); i += SPECIES_F.length()) {
+            var ai = FloatVector.fromArray(SPECIES_F, a, i);
+            var mask = ai.compare(VectorOperators.LT, 1f);
+            var a2 = ai.lanewise(VectorOperators.MUL, ai);
+            var a4 = a2.lanewise(VectorOperators.MUL, a2);
+            var a8 = a4.lanewise(VectorOperators.MUL, a4);
+            var s2 = ai.lanewise(VectorOperators.SQRT);
+            var s4 = s2.lanewise(VectorOperators.SQRT);
+            var s8 = s4.lanewise(VectorOperators.SQRT);
+            var v = s8.blend(a8, mask);
+            v.intoArray(r, i);
+        }
+        for (; i < a.length; i++) {
+            float ai = a[i];
+            if (ai < 1f) {
+                float a2 = ai * ai;
+                float a4 = a2 * a2;
+                float a8 = a4 * a4;
+                r[i] = a8;
+            } else {
+                float s2 = (float)Math.sqrt(ai);
+                float s4 = (float)Math.sqrt(s2);
+                float s8 = (float)Math.sqrt(s4);
+                r[i] = s8;
+            }
+        }
+        return r;
+    }
+
+    public static float[] pieceWise2FunctionF_VectorAPI_v2(float[] a, float[] r) {
+        int i;
+        for (i = 0; i < SPECIES_F.loopBound(a.length); i += SPECIES_F.length()) {
+            var ai = FloatVector.fromArray(SPECIES_F, a, i);
+            var mask = ai.compare(VectorOperators.LT, 1f);
+            var a2 = ai.lanewise(VectorOperators.MUL, ai);
+            var a4 = a2.lanewise(VectorOperators.MUL, a2);
+            var a8 = a4.lanewise(VectorOperators.MUL, a4);
+            var v = a8;
+            // SQRT is expensive, so only call if it necessary
+            if (!mask.allTrue()) {
+                var s2 = ai.lanewise(VectorOperators.SQRT);
+                var s4 = s2.lanewise(VectorOperators.SQRT);
+                var s8 = s4.lanewise(VectorOperators.SQRT);
+                v = s8.blend(a8, mask);
+            }
+            v.intoArray(r, i);
+        }
+        for (; i < a.length; i++) {
+            float ai = a[i];
+            if (ai < 1f) {
+                float a2 = ai * ai;
+                float a4 = a2 * a2;
+                float a8 = a4 * a4;
+                r[i] = a8;
+            } else {
+                float s2 = (float)Math.sqrt(ai);
+                float s4 = (float)Math.sqrt(s2);
+                float s8 = (float)Math.sqrt(s4);
+                r[i] = s8;
+            }
+        }
+        return r;
+    }
 }
diff --git a/test/micro/org/openjdk/bench/vm/compiler/VectorAlgorithms.java b/test/micro/org/openjdk/bench/vm/compiler/VectorAlgorithms.java
index 911494cb022..f60dfcb2d7c 100644
--- a/test/micro/org/openjdk/bench/vm/compiler/VectorAlgorithms.java
+++ b/test/micro/org/openjdk/bench/vm/compiler/VectorAlgorithms.java
@@ -51,13 +51,20 @@ import org.openjdk.jmh.annotations.*;
 @State(Scope.Thread)
 @Warmup(iterations = 5, time = 1)
 @Measurement(iterations = 3, time = 1)
-@Fork(value = 5, jvmArgs = {"--add-modules=jdk.incubator.vector", "-XX:CompileCommand=inline,*VectorAlgorithmsImpl*::*"})
+@Fork(value = 1, jvmArgs = {"--add-modules=jdk.incubator.vector", "-XX:CompileCommand=inline,*VectorAlgorithmsImpl*::*"})
 public class VectorAlgorithms {
     @Param({"640000"})
     public int SIZE;
+    // Specifies the length of the arrays / number of elements in the container.
 
     @Param({"10000"})
     public int NUM_X_OBJECTS;
+    // Number of simulated "objects" in the "reduceAddIFieldsX4" benchmark.
+
+    @Param({"0.5"})
+    public float BRANCH_PROBABILITY;
+    // Branch probability for the following benchmarks:
+    // - filterI
 
     @Param({"0"})
     public int SEED;
@@ -66,7 +73,7 @@ public class VectorAlgorithms {
 
     @Setup
     public void init() {
-        d = new VectorAlgorithmsImpl.Data(SIZE, SEED, NUM_X_OBJECTS);
+        d = new VectorAlgorithmsImpl.Data(SIZE, SEED, NUM_X_OBJECTS, BRANCH_PROBABILITY);
     }
 
     // ------------------------------------------------------------------------------------------
@@ -208,15 +215,15 @@ public class VectorAlgorithms {
         // Every invocation should have a different value for e, so that
         // we don't get branch-prediction that is too good. And also so
         // that the position where we exit is more evenly distributed.
-        d.eI_idx = (d.eI_idx + 1) & 0xffff;
-        int e = d.eI[d.eI_idx];
+        d.eI_findI_idx = (d.eI_findI_idx + 1) & 0xffff;
+        int e = d.eI_findI[d.eI_findI_idx];
         return VectorAlgorithmsImpl.findI_loop(d.aI, e);
     }
 
     @Benchmark
     public int findI_VectorAPI() {
-        d.eI_idx = (d.eI_idx + 1) & 0xffff;
-        int e = d.eI[d.eI_idx];
+        d.eI_findI_idx = (d.eI_findI_idx + 1) & 0xffff;
+        int e = d.eI_findI[d.eI_findI_idx];
         return VectorAlgorithmsImpl.findI_VectorAPI(d.aI, e);
     }
 
@@ -235,16 +242,27 @@ public class VectorAlgorithms {
         // Every invocation should have a different value for e, so that
         // we don't get branch-prediction that is too good. And also so
         // That the length of the resulting data is more evenly distributed.
-        d.eI_idx = (d.eI_idx + 1) & 0xffff;
-        int e = d.eI[d.eI_idx];
-        return VectorAlgorithmsImpl.filterI_loop(d.aI, d.rI1, e);
+        return VectorAlgorithmsImpl.filterI_loop(d.aI_filterI, d.rI1, d.eI_filterI);
     }
 
     @Benchmark
-    public Object filterI_VectorAPI() {
-        d.eI_idx = (d.eI_idx + 1) & 0xffff;
-        int e = d.eI[d.eI_idx];
-        return VectorAlgorithmsImpl.filterI_VectorAPI(d.aI, d.rI1, e);
+    public Object filterI_VectorAPI_v1() {
+        return VectorAlgorithmsImpl.filterI_VectorAPI_v1(d.aI_filterI, d.rI1, d.eI_filterI);
+    }
+
+    @Benchmark
+    public Object filterI_VectorAPI_v2_l2() {
+        return VectorAlgorithmsImpl.filterI_VectorAPI_v2_l2(d.aI_filterI, d.rI1, d.eI_filterI);
+    }
+
+    @Benchmark
+    public Object filterI_VectorAPI_v2_l4() {
+        return VectorAlgorithmsImpl.filterI_VectorAPI_v2_l4(d.aI_filterI, d.rI1, d.eI_filterI);
+    }
+
+    @Benchmark
+    public Object filterI_VectorAPI_v2_l8() {
+        return VectorAlgorithmsImpl.filterI_VectorAPI_v2_l8(d.aI_filterI, d.rI1, d.eI_filterI);
     }
 
     @Benchmark
@@ -271,4 +289,34 @@ public class VectorAlgorithms {
     public Object lowerCaseB_VectorAPI_v2() {
         return VectorAlgorithmsImpl.lowerCaseB_VectorAPI_v2(d.strB, d.rB1);
     }
+
+    @Benchmark
+    public Object conditionalSumB_loop() {
+        return VectorAlgorithmsImpl.conditionalSumB_loop(d.strB);
+    }
+
+    @Benchmark
+    public Object conditionalSumB_VectorAPI_v1() {
+        return VectorAlgorithmsImpl.conditionalSumB_VectorAPI_v1(d.strB);
+    }
+
+    @Benchmark
+    public Object conditionalSumB_VectorAPI_v2() {
+        return VectorAlgorithmsImpl.conditionalSumB_VectorAPI_v2(d.strB);
+    }
+
+    @Benchmark
+    public float[] pieceWise2FunctionF_loop() {
+        return VectorAlgorithmsImpl.pieceWise2FunctionF_loop(d.xF, d.rF1);
+    }
+
+    @Benchmark
+    public float[] pieceWise2FunctionF_VectorAPI_v1() {
+        return VectorAlgorithmsImpl.pieceWise2FunctionF_VectorAPI_v1(d.xF, d.rF1);
+    }
+
+    @Benchmark
+    public float[] pieceWise2FunctionF_VectorAPI_v2() {
+        return VectorAlgorithmsImpl.pieceWise2FunctionF_VectorAPI_v2(d.xF, d.rF1);
+    }
 }
diff --git a/test/micro/org/openjdk/bench/vm/compiler/VectorAlgorithmsImpl.java b/test/micro/org/openjdk/bench/vm/compiler/VectorAlgorithmsImpl.java
index 5ab057329d3..3ae4ed81634 100644
--- a/test/micro/org/openjdk/bench/vm/compiler/VectorAlgorithmsImpl.java
+++ b/test/micro/org/openjdk/bench/vm/compiler/VectorAlgorithmsImpl.java
@@ -36,6 +36,8 @@ public class VectorAlgorithmsImpl {
     private static final VectorSpecies<Integer> SPECIES_I    = IntVector.SPECIES_PREFERRED;
     private static final VectorSpecies<Integer> SPECIES_I512 = IntVector.SPECIES_512;
     private static final VectorSpecies<Integer> SPECIES_I256 = IntVector.SPECIES_256;
+    private static final VectorSpecies<Integer> SPECIES_I128 = IntVector.SPECIES_128;
+    private static final VectorSpecies<Integer> SPECIES_I64  = IntVector.SPECIES_64;
     private static final VectorSpecies<Byte> SPECIES_B       = ByteVector.SPECIES_PREFERRED;
     private static final VectorSpecies<Byte> SPECIES_B64     = ByteVector.SPECIES_64;
     private static final VectorSpecies<Float> SPECIES_F      = FloatVector.SPECIES_PREFERRED;
@@ -58,15 +60,31 @@ public class VectorAlgorithmsImpl {
         public int[] rI2;
         public int[] rI3;
         public int[] rI4;
-        public int[] eI;
+        public int[] rI5;
+
+        // Search element for "findI"
+        public int[] eI_findI;
         // The test has to use the same index into eI for all implementations. But in the
         // benchmark, we'd like to use random indices, so we use the index to advance through
         // the array.
-        public int eI_idx = 0;
+        public int eI_findI_idx = 0;
+
+        // Data and threshold eI value for "filterI".
+        // We create the data in a range, and then pick a threshold scaled to that range,
+        // so that the branch in the filter is branchProbability.
+        public int[] aI_filterI;
+        public int eI_filterI;
 
         public float[] aF;
         public float[] bF;
 
+        // Input for piece-wise functions.
+        // Uniform [0..1[ with probability p and Uniform [1..2[ with probability (1-p)
+        public float[] xF;
+        public float[] rF1;
+        public float[] rF2;
+        public float[] rF3;
+
         public byte[] aB;
         public byte[] strB;
         public byte[] rB1;
@@ -76,7 +94,7 @@ public class VectorAlgorithmsImpl {
         public int[] oopsX4;
         public int[] memX4;
 
-        public Data(int size, int seed, int numX4Objects) {
+        public Data(int size, int seed, int numX4Objects, float branchProbability) {
             Random random = new Random(seed);
 
             // int: one input array and multiple output arrays so different implementations can
@@ -86,14 +104,20 @@ public class VectorAlgorithmsImpl {
             rI2 = new int[size];
             rI3 = new int[size];
             rI4 = new int[size];
+            rI5 = new int[size];
             Arrays.setAll(aI, i -> random.nextInt());
 
             // Populate with some random values from aI, and some totally random values.
-            eI = new int[0x10000];
-            for (int i = 0; i < eI.length; i++) {
-                eI[i] = (random.nextInt(10) == 0) ? random.nextInt() : aI[random.nextInt(size)];
+            eI_findI = new int[0x10000];
+            for (int i = 0; i < eI_findI.length; i++) {
+                eI_findI[i] = (random.nextInt(10) == 0) ? random.nextInt() : aI[random.nextInt(size)];
             }
 
+            int filterI_range = 1000_000;
+            aI_filterI = new int[size];
+            Arrays.setAll(aI_filterI, i -> random.nextInt(filterI_range));
+            eI_filterI = (int)(filterI_range * (1.0f - branchProbability));
+
             // X4 oop setup.
             // oopsX4 holds "addresses" (i.e. indices), that point to the 16-byte objects in memX4.
             oopsX4 = new int[size];
@@ -117,14 +141,30 @@ public class VectorAlgorithmsImpl {
                 bF[i] = random.nextInt(32) - 16;
             }
 
+            xF = new float[size];
+            rF1 = new float[size];
+            rF2 = new float[size];
+            rF3 = new float[size];
+            for (int i = 0; i < size; i++) {
+                xF[i] = (random.nextFloat() < branchProbability)
+                        ? 0f + random.nextFloat()
+                        : 1f + random.nextFloat();
+            }
+
             // byte: just random data.
             aB = new byte[size];
-            strB = new byte[size];
             rB1 = new byte[size];
             rB2 = new byte[size];
             rB3 = new byte[size];
             random.nextBytes(aB);
-            random.nextBytes(strB); // TODO: special data!
+
+            // byte string: for lowerCase benchmark.
+            strB = new byte[size];
+            for (int i = 0; i < size; i++) {
+                strB[i] = (random.nextFloat() < branchProbability)
+                          ? (byte)(random.nextInt(16) + 'A')
+                          : (byte)(random.nextInt(16) + 'a');
+            }
         }
     }
 
@@ -651,13 +691,12 @@ public class VectorAlgorithmsImpl {
         return r;
     }
 
-    public static Object filterI_VectorAPI(int[] a, int[] r, int threshold) {
-        var thresholds = IntVector.broadcast(SPECIES_I, threshold);
+    public static Object filterI_VectorAPI_v1(int[] a, int[] r, int threshold) {
         int j = 0;
         int i = 0;
         for (; i < SPECIES_I.loopBound(a.length); i += SPECIES_I.length()) {
             IntVector v = IntVector.fromArray(SPECIES_I, a, i);
-            var mask = v.compare(VectorOperators.GE, thresholds);
+            var mask = v.compare(VectorOperators.GE, threshold);
             v = v.compress(mask);
             int trueCount = mask.trueCount();
             var prefixMask = mask.compress();
@@ -676,6 +715,98 @@ public class VectorAlgorithmsImpl {
         return r;
     }
 
+    // Idea: on platforms that do not support the "v1" solution with "compress" and
+    //       masked stores, we struggle to deal with the loop-carried dependency of j.
+    //       But we can still use dynamic uniformity to enable some vectorized performance.
+    public static Object filterI_VectorAPI_v2_l2(int[] a, int[] r, int threshold) {
+        int j = 0;
+        int i = 0;
+        for (; i < SPECIES_I64.loopBound(a.length); i += SPECIES_I64.length()) {
+            IntVector v = IntVector.fromArray(SPECIES_I64, a, i);
+            var mask = v.compare(VectorOperators.GE, threshold);
+            if (mask.allTrue()) {
+                v.intoArray(r, j);
+                j += 2;
+            } else if (mask.anyTrue()) {
+                if (mask.laneIsSet(0)) { r[j++] = v.lane(0); }
+                if (mask.laneIsSet(1)) { r[j++] = v.lane(1); }
+            } else {
+                // nothing
+            }
+        }
+        for (; i < a.length; i++) {
+            int ai = a[i];
+            if (ai >= threshold) {
+                r[j++] = ai;
+            }
+        }
+        // Just force the resulting length onto the same array.
+        r[r.length - 1] = j;
+        return r;
+    }
+
+    public static Object filterI_VectorAPI_v2_l4(int[] a, int[] r, int threshold) {
+        int j = 0;
+        int i = 0;
+        for (; i < SPECIES_I128.loopBound(a.length); i += SPECIES_I128.length()) {
+            IntVector v = IntVector.fromArray(SPECIES_I128, a, i);
+            var mask = v.compare(VectorOperators.GE, threshold);
+            if (mask.allTrue()) {
+                v.intoArray(r, j);
+                j += 4;
+            } else if (mask.anyTrue()) {
+                if (mask.laneIsSet(0)) { r[j++] = v.lane(0); }
+                if (mask.laneIsSet(1)) { r[j++] = v.lane(1); }
+                if (mask.laneIsSet(2)) { r[j++] = v.lane(2); }
+                if (mask.laneIsSet(3)) { r[j++] = v.lane(3); }
+            } else {
+                // nothing
+            }
+        }
+        for (; i < a.length; i++) {
+            int ai = a[i];
+            if (ai >= threshold) {
+                r[j++] = ai;
+            }
+        }
+        // Just force the resulting length onto the same array.
+        r[r.length - 1] = j;
+        return r;
+    }
+
+    public static Object filterI_VectorAPI_v2_l8(int[] a, int[] r, int threshold) {
+        int j = 0;
+        int i = 0;
+        for (; i < SPECIES_I256.loopBound(a.length); i += SPECIES_I256.length()) {
+            IntVector v = IntVector.fromArray(SPECIES_I256, a, i);
+            var mask = v.compare(VectorOperators.GE, threshold);
+            if (mask.allTrue()) {
+                v.intoArray(r, j);
+                j += 8;
+            } else if (mask.anyTrue()) {
+                if (mask.laneIsSet(0)) { r[j++] = v.lane(0); }
+                if (mask.laneIsSet(1)) { r[j++] = v.lane(1); }
+                if (mask.laneIsSet(2)) { r[j++] = v.lane(2); }
+                if (mask.laneIsSet(3)) { r[j++] = v.lane(3); }
+                if (mask.laneIsSet(4)) { r[j++] = v.lane(4); }
+                if (mask.laneIsSet(5)) { r[j++] = v.lane(5); }
+                if (mask.laneIsSet(6)) { r[j++] = v.lane(6); }
+                if (mask.laneIsSet(7)) { r[j++] = v.lane(7); }
+            } else {
+                // nothing
+            }
+        }
+        for (; i < a.length; i++) {
+            int ai = a[i];
+            if (ai >= threshold) {
+                r[j++] = ai;
+            }
+        }
+        // Just force the resulting length onto the same array.
+        r[r.length - 1] = j;
+        return r;
+    }
+
     // X4: ints simulate 4-byte oops.
     // oops: if non-zero (= non-null), every entry simulates a 4-byte oop, pointing into mem.
     // mem: an int array that simulates the memory.
@@ -771,5 +902,176 @@ public class VectorAlgorithmsImpl {
         }
         return r;
     }
-}
 
+    public static int conditionalSumB_loop(byte[] a) {
+        int sum = 0;
+        for (int i = 0; i < a.length; i++) {
+            byte c = a[i];
+            if (c >= 'A' && c <= 'Z') {
+                sum += c;
+            }
+        }
+        return sum;
+    }
+
+    public static int conditionalSumB_VectorAPI_v1(byte[] a) {
+        return ConditionalSumB_VectorAPI_V1.compute(a);
+    }
+
+    private static class ConditionalSumB_VectorAPI_V1 {
+        // Pick I species to be a full vector, and the B vector a quarter its bit length.
+        // However, we have to get at least 64bits for the B vector, so at least 256bits
+        // for the int vector - a sad restriction by the currently very narrow range of
+        // supported shapes.
+        private static final int BITS_I = Math.max(256, IntVector.SPECIES_PREFERRED.vectorBitSize());
+        private static final int BITS_B = BITS_I / 4;
+        private static final VectorShape SHAPE_I = VectorShape.forBitSize(BITS_I);
+        private static final VectorShape SHAPE_B = VectorShape.forBitSize(BITS_B);
+        private static final VectorSpecies<Integer> SPECIES_I = SHAPE_I.withLanes(int.class);
+        private static final VectorSpecies<Byte>    SPECIES_B = SHAPE_B.withLanes(byte.class);
+
+        public static int compute(byte[] a) {
+            var zeroB = ByteVector.zero(SPECIES_B);
+            var accI = IntVector.zero(SPECIES_I);
+            int i;
+            for (i = 0; i < SPECIES_B.loopBound(a.length); i += SPECIES_B.length()) {
+                var vB = ByteVector.fromArray(SPECIES_B, a, i);
+                var maskA = vB.compare(VectorOperators.GE, (byte)'A');
+                var maskZ = vB.compare(VectorOperators.LE, (byte)'Z');
+                var mask = maskA.and(maskZ);
+                vB = zeroB.blend(vB, mask);
+                var vI = vB.castShape(SPECIES_I, 0);
+                accI = accI.add(vI);
+            }
+            int sum = accI.reduceLanes(VectorOperators.ADD);
+            for (; i < a.length; i++) {
+                byte c = a[i];
+                if (c >= 'A' && c <= 'Z') {
+                    sum += c;
+                }
+            }
+            return sum;
+        }
+    }
+
+    public static int conditionalSumB_VectorAPI_v2(byte[] a) {
+        return ConditionalSumB_VectorAPI_V2.compute(a);
+    }
+
+    private static class ConditionalSumB_VectorAPI_V2 {
+        // Pick B species to be a full vector, and use 4 I vectors of the same bit size.
+        private static final VectorSpecies<Byte>    SPECIES_B = ByteVector.SPECIES_PREFERRED;
+        private static final VectorSpecies<Integer> SPECIES_I = SPECIES_B.vectorShape().withLanes(int.class);
+
+        public static int compute(byte[] a) {
+            var zeroB = ByteVector.zero(SPECIES_B);
+            var accI = IntVector.zero(SPECIES_I);
+            int i;
+            for (i = 0; i < SPECIES_B.loopBound(a.length); i += SPECIES_B.length()) {
+                var vB = ByteVector.fromArray(SPECIES_B, a, i);
+                var maskA = vB.compare(VectorOperators.GE, (byte)'A');
+                var maskZ = vB.compare(VectorOperators.LE, (byte)'Z');
+                var mask = maskA.and(maskZ);
+                vB = zeroB.blend(vB, mask);
+                // When casting byte->int, we get 4x the bits, and split them into 4 parts.
+                var vI0 = vB.castShape(SPECIES_I, 0);
+                var vI1 = vB.castShape(SPECIES_I, 1);
+                var vI2 = vB.castShape(SPECIES_I, 2);
+                var vI3 = vB.castShape(SPECIES_I, 3);
+                accI = accI.add(vI0.add(vI1).add(vI2).add(vI3));
+            }
+            int sum = accI.reduceLanes(VectorOperators.ADD);
+            for (; i < a.length; i++) {
+                byte c = a[i];
+                if (c >= 'A' && c <= 'Z') {
+                    sum += c;
+                }
+            }
+            return sum;
+        }
+    }
+
+    public static float[] pieceWise2FunctionF_loop(float[] a, float[] r) {
+        for (int i = 0; i < a.length; i++) {
+            float ai = a[i];
+            if (ai < 1f) {
+                float a2 = ai * ai;
+                float a4 = a2 * a2;
+                float a8 = a4 * a4;
+                r[i] = a8;
+            } else {
+                float s2 = (float)Math.sqrt(ai);
+                float s4 = (float)Math.sqrt(s2);
+                float s8 = (float)Math.sqrt(s4);
+                r[i] = s8;
+            }
+        }
+        return r;
+    }
+
+    public static float[] pieceWise2FunctionF_VectorAPI_v1(float[] a, float[] r) {
+        int i;
+        for (i = 0; i < SPECIES_F.loopBound(a.length); i += SPECIES_F.length()) {
+            var ai = FloatVector.fromArray(SPECIES_F, a, i);
+            var mask = ai.compare(VectorOperators.LT, 1f);
+            var a2 = ai.lanewise(VectorOperators.MUL, ai);
+            var a4 = a2.lanewise(VectorOperators.MUL, a2);
+            var a8 = a4.lanewise(VectorOperators.MUL, a4);
+            var s2 = ai.lanewise(VectorOperators.SQRT);
+            var s4 = s2.lanewise(VectorOperators.SQRT);
+            var s8 = s4.lanewise(VectorOperators.SQRT);
+            var v = s8.blend(a8, mask);
+            v.intoArray(r, i);
+        }
+        for (; i < a.length; i++) {
+            float ai = a[i];
+            if (ai < 1f) {
+                float a2 = ai * ai;
+                float a4 = a2 * a2;
+                float a8 = a4 * a4;
+                r[i] = a8;
+            } else {
+                float s2 = (float)Math.sqrt(ai);
+                float s4 = (float)Math.sqrt(s2);
+                float s8 = (float)Math.sqrt(s4);
+                r[i] = s8;
+            }
+        }
+        return r;
+    }
+
+    public static float[] pieceWise2FunctionF_VectorAPI_v2(float[] a, float[] r) {
+        int i;
+        for (i = 0; i < SPECIES_F.loopBound(a.length); i += SPECIES_F.length()) {
+            var ai = FloatVector.fromArray(SPECIES_F, a, i);
+            var mask = ai.compare(VectorOperators.LT, 1f);
+            var a2 = ai.lanewise(VectorOperators.MUL, ai);
+            var a4 = a2.lanewise(VectorOperators.MUL, a2);
+            var a8 = a4.lanewise(VectorOperators.MUL, a4);
+            var v = a8;
+            // SQRT is expensive, so only call if it necessary
+            if (!mask.allTrue()) {
+                var s2 = ai.lanewise(VectorOperators.SQRT);
+                var s4 = s2.lanewise(VectorOperators.SQRT);
+                var s8 = s4.lanewise(VectorOperators.SQRT);
+                v = s8.blend(a8, mask);
+            }
+            v.intoArray(r, i);
+        }
+        for (; i < a.length; i++) {
+            float ai = a[i];
+            if (ai < 1f) {
+                float a2 = ai * ai;
+                float a4 = a2 * a2;
+                float a8 = a4 * a4;
+                r[i] = a8;
+            } else {
+                float s2 = (float)Math.sqrt(ai);
+                float s4 = (float)Math.sqrt(s2);
+                float s8 = (float)Math.sqrt(s4);
+                r[i] = s8;
+            }
+        }
+        return r;
+    }
+}

From c3dfceb90a616208880d6bc5a7e3098a493a25a8 Mon Sep 17 00:00:00 2001
From: Johny Jose <johny.jose@oracle.com>
Date: Mon, 9 Mar 2026 07:55:28 +0000
Subject: [PATCH 084/655] 8379035: (tz) Update Timezone Data to 2026a

Reviewed-by: coffeys, naoto
---
 src/java.base/share/data/tzdata/VERSION       |  2 +-
 src/java.base/share/data/tzdata/etcetera      |  3 +-
 src/java.base/share/data/tzdata/europe        | 74 +++++++++++++++++--
 src/java.base/share/data/tzdata/leapseconds   |  8 +-
 .../java/util/TimeZone/TimeZoneData/VERSION   |  2 +-
 5 files changed, 76 insertions(+), 13 deletions(-)

diff --git a/src/java.base/share/data/tzdata/VERSION b/src/java.base/share/data/tzdata/VERSION
index ce25e7653b0..a2974d757c8 100644
--- a/src/java.base/share/data/tzdata/VERSION
+++ b/src/java.base/share/data/tzdata/VERSION
@@ -21,4 +21,4 @@
 # or visit www.oracle.com if you need additional information or have any
 # questions.
 #
-tzdata2025c
+tzdata2026a
diff --git a/src/java.base/share/data/tzdata/etcetera b/src/java.base/share/data/tzdata/etcetera
index 41660b05dba..9b030fdb8d4 100644
--- a/src/java.base/share/data/tzdata/etcetera
+++ b/src/java.base/share/data/tzdata/etcetera
@@ -43,7 +43,8 @@
 # which load the "UTC" file to handle seconds properly.
 Zone	Etc/UTC		0	-	UTC
 
-# Functions like gmtime load the "GMT" file to handle leap seconds properly.
+# If leap second support is enabled, functions like gmtime
+# load the "GMT" file to handle leap seconds properly.
 # Vanguard section, which works with most .zi parsers.
 #Zone	GMT		0	-	GMT
 # Rearguard section, for TZUpdater 2.3.2 and earlier.
diff --git a/src/java.base/share/data/tzdata/europe b/src/java.base/share/data/tzdata/europe
index b82ca6f67bb..a66d40834cd 100644
--- a/src/java.base/share/data/tzdata/europe
+++ b/src/java.base/share/data/tzdata/europe
@@ -1064,9 +1064,19 @@ Zone Atlantic/Faroe	-0:27:04 -	LMT	1908 Jan 11 # Tórshavn
 
 # Greenland
 #
-# From Paul Eggert (2004-10-31):
+# From Paul Eggert (2026-01-22):
+# During World War II, Greenland was effectively independent of Denmark and
+# observed daylight saving time.  TIME, volume 37, page 23 (1941-04-21)
+# <https://time.com/archive/6770243/war-peace-greenlands-icy-mountains/> says,
+# "Penfield and West made their way to the U.S.'s most northerly consulate.
+# They were astonished to find that Greenlanders, with almost 24 hours of
+# sunlight a day during the summer, have daylight saving time."
+# As the details are unknown they are omitted from the data for now.
+#
 # During World War II, Germany maintained secret manned weather stations in
 # East Greenland and Franz Josef Land, but we don't know their time zones.
+# Also, they're likely out of scope for the database
+# as we lack resources to track every bit of military activity.
 # My source for this is Wilhelm Dege's book mentioned under Svalbard.
 #
 # From Paul Eggert (2017-12-10):
@@ -1980,7 +1990,6 @@ Zone	Europe/Malta	0:58:04 -	LMT	1893 Nov  2 # Valletta
 
 # From Stepan Golosunov (2016-03-07):
 # the act of the government of the Republic of Moldova Nr. 132 from 1990-05-04
-# http://lex.justice.md/viewdoc.php?action=view&view=doc&id=298782&lang=2
 # ... says that since 1990-05-06 on the territory of the Moldavian SSR
 # time would be calculated as the standard time of the second time belt
 # plus one hour of the "summer" time. To implement that clocks would be
@@ -2035,9 +2044,61 @@ Zone	Europe/Malta	0:58:04 -	LMT	1893 Nov  2 # Valletta
 # says the 2014-03-30 spring-forward transition was at 02:00 local time.
 # Guess that since 1997 Moldova has switched one hour before the EU.
 
+# From Heitor David Pinto (2026-02-22):
+# Soviet Moldovan resolution 132 of 1990 defined the summer time period from
+# the last Sunday in March at 2:00 to the last Sunday in September at 3:00,
+# matching the dates used in most of Europe at the time:
+# https://web.archive.org/web/20211107050832/http://lex.justice.md/viewdoc.php?action=view&view=doc&id=298782&lang=1
+#
+# It seems that in 1996 Moldova changed the end date to October like most of
+# Europe, but kept the transitions at 2:00 and 3:00 rather than 1:00 UTC,
+# which would have been locally 3:00 and 4:00....
+#
+# The notices in the Moldovan government website and broadcaster showed the
+# transitions at 2:00 and 3:00 until 2021:
+# 2015 https://old.gov.md/en/node/7304
+# 2016 https://old.gov.md/en/node/12587
+# 2017 https://old.gov.md/en/node/20654
+# 2017 https://old.gov.md/en/content/moldova-upholds-winter-time-night-28-29-october
+# 2018 https://old.gov.md/en/content/moldova-switch-summer-time
+# 2018 https://old.gov.md/en/content/cabinet-ministers-informs-about-switch-winter-time-28-october
+# 2019 https://old.gov.md/en/content/moldova-switch-summer-time-31-march
+# 2019 https://old.gov.md/en/node/31122
+# 2020 https://old.gov.md/en/node/32771
+# 2020 https://old.gov.md/en/node/34497
+# 2021 https://trm.md/ro/social/moldova-trece-in-aceasta-noapte-la-ora-de-vara
+# 2021 https://trm.md/en/social/republica-moldova-trece-la-ora-de-iarna1
+#
+# However, since 2022, the notices showed the transitions at 3:00 and 4:00,
+# matching the EU rule at 1:00 UTC:
+# 2022 https://trm.md/en/social/in-acest-weekend-republica-moldova-trece-la-ora-de-vara
+# 2022 https://old.gov.md/en/content/moldova-switch-winter-time
+# 2023 https://moldova1.md/p/6587/ora-de-vara-2023-cum-schimbam-acele-ceasornicelor-si-cand-trecem-la-ora-de-vara
+# 2023 https://old.gov.md/en/node/46662
+# 2024 https://moldova1.md/p/26535/republica-moldova-trece-la-ora-de-vara-in-acest-weekend
+# 2024 https://moldova1.md/p/37768/republica-moldova-trece-in-aceasta-noapte-la-ora-de-iarna
+# 2025 https://moldova1.md/p/46349/republica-moldova-trece-la-ora-de-vara-pe-30-martie-cum-ne-afecteaza-si-ce-recomanda-medicii
+# 2025 https://moldova1.md/p/60469/republica-moldova-trece-la-ora-de-iarna-ceasurile-se-dau-inapoi-cu-o-ora
+#
+# It seems that the changes to the end date and transition times were just
+# done in practice without formally changing the resolution. In late 2025, the
+# government said that the Soviet resolution was still in force, and proposed
+# a new resolution to replace it and formally establish the EU rule:
+# ... based on the notices, it seems that in practice Moldova already
+# uses the EU rule since 2022. This was also the year when Moldova applied to
+# join the EU.
+#
+# From Robert Bastian (2026-02-26):
+# This has been approved and published in the government gazette:
+# https://monitorul.gov.md/ro/monitorul/view/pdf/3234/part/2#page=27
+#
+# From Paul Eggert (2026-02-24):
+# Also see Svetlana Rudenko, "Moldova abandons the 'Soviet era'", Logos Press,
+# 2026-02-21 <https://logos-pres.md/en/news/moldova-abandons-the-soviet-era/>.
+
 # Rule	NAME	FROM	TO	-	IN	ON	AT	SAVE	LETTER/S
-Rule	Moldova	1997	max	-	Mar	lastSun	 2:00	1:00	S
-Rule	Moldova	1997	max	-	Oct	lastSun	 3:00	0	-
+Rule	Moldova	1997	2021	-	Mar	lastSun	 2:00	1:00	S
+Rule	Moldova	1997	2021	-	Oct	lastSun	 3:00	0	-
 
 # Zone	NAME		STDOFF	RULES	FORMAT	[UNTIL]
 Zone	Europe/Chisinau	1:55:20 -	LMT	1880
@@ -2050,7 +2111,8 @@ Zone	Europe/Chisinau	1:55:20 -	LMT	1880
 			2:00	Russia	EE%sT	1992
 			2:00	E-Eur	EE%sT	1997
 # See Romania commentary for the guessed 1997 transition to EU rules.
-			2:00	Moldova	EE%sT
+			2:00	Moldova	EE%sT	2022
+			2:00	EU	EE%sT
 
 # Poland
 
@@ -2436,7 +2498,7 @@ Zone Atlantic/Madeira	-1:07:36 -	LMT	1884        # Funchal
 # Nine O'clock <http://www.nineoclock.ro/POL/1778pol.html>
 # (1998-10-23) reports that the switch occurred at
 # 04:00 local time in fall 1998.  For lack of better info,
-# assume that Romania and Moldova switched to EU rules in 1997,
+# assume that Romania switched to EU rules in 1997,
 # the same year as Bulgaria.
 #
 # Rule	NAME	FROM	TO	-	IN	ON	AT	SAVE	LETTER/S
diff --git a/src/java.base/share/data/tzdata/leapseconds b/src/java.base/share/data/tzdata/leapseconds
index 9426b40f07e..d431a7d3607 100644
--- a/src/java.base/share/data/tzdata/leapseconds
+++ b/src/java.base/share/data/tzdata/leapseconds
@@ -93,7 +93,7 @@ Leap	2016	Dec	31	23:59:60	+	S
 # Any additional leap seconds will come after this.
 # This Expires line is commented out for now,
 # so that pre-2020a zic implementations do not reject this file.
-#Expires 2026	Jun	28	00:00:00
+#Expires 2026	Dec	28	00:00:00
 
 # Here are POSIX timestamps for the data in this file.
 # "#updated" gives the last time the leap seconds data changed
@@ -102,8 +102,8 @@ Leap	2016	Dec	31	23:59:60	+	S
 # "#expires" gives the first time this file might be wrong;
 # if this file was derived from the IERS leap-seconds.list,
 # this is typically a bit less than one year after "updated".
-#updated 1751846400 (2025-07-07 00:00:00 UTC)
-#expires 1782604800 (2026-06-28 00:00:00 UTC)
+#updated 1767698058 (2026-01-06 11:14:18 UTC)
+#expires 1798416000 (2026-12-28 00:00:00 UTC)
 
 #	Updated through IERS Bulletin C (https://hpiers.obspm.fr/iers/bul/bulc/bulletinc.dat)
-#	File expires on 28 June 2026
+#	File expires on 28 December 2026
diff --git a/test/jdk/java/util/TimeZone/TimeZoneData/VERSION b/test/jdk/java/util/TimeZone/TimeZoneData/VERSION
index 76d146afc71..2f72d7dbcb2 100644
--- a/test/jdk/java/util/TimeZone/TimeZoneData/VERSION
+++ b/test/jdk/java/util/TimeZone/TimeZoneData/VERSION
@@ -1 +1 @@
-tzdata2025c
+tzdata2026a

From 08198e7fd9d83973aba6f6da6ab985065244cccc Mon Sep 17 00:00:00 2001
From: Albert Mingkun Yang <ayang@openjdk.org>
Date: Mon, 9 Mar 2026 08:01:23 +0000
Subject: [PATCH 085/655] 8379297: Serial: Replace CSpaceCounters with
 HSpaceCounters

Reviewed-by: stefank, tschatzl
---
 .../share/gc/serial/cSpaceCounters.cpp        | 83 -------------------
 .../share/gc/serial/cSpaceCounters.hpp        | 62 --------------
 .../share/gc/serial/defNewGeneration.cpp      | 21 ++---
 .../share/gc/serial/defNewGeneration.hpp      |  9 +-
 .../share/gc/serial/tenuredGeneration.cpp     |  7 +-
 .../share/gc/serial/tenuredGeneration.hpp     |  4 +-
 6 files changed, 21 insertions(+), 165 deletions(-)
 delete mode 100644 src/hotspot/share/gc/serial/cSpaceCounters.cpp
 delete mode 100644 src/hotspot/share/gc/serial/cSpaceCounters.hpp

diff --git a/src/hotspot/share/gc/serial/cSpaceCounters.cpp b/src/hotspot/share/gc/serial/cSpaceCounters.cpp
deleted file mode 100644
index f6bcee99423..00000000000
--- a/src/hotspot/share/gc/serial/cSpaceCounters.cpp
+++ /dev/null
@@ -1,83 +0,0 @@
-/*
- * Copyright (c) 2002, 2025, Oracle and/or its affiliates. All rights reserved.
- * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
- *
- * This code is free software; you can redistribute it and/or modify it
- * under the terms of the GNU General Public License version 2 only, as
- * published by the Free Software Foundation.
- *
- * This code is distributed in the hope that it will be useful, but WITHOUT
- * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
- * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
- * version 2 for more details (a copy is included in the LICENSE file that
- * accompanied this code).
- *
- * You should have received a copy of the GNU General Public License version
- * 2 along with this work; if not, write to the Free Software Foundation,
- * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
- *
- * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
- * or visit www.oracle.com if you need additional information or have any
- * questions.
- *
- */
-
-#include "gc/serial/cSpaceCounters.hpp"
-#include "memory/allocation.inline.hpp"
-#include "memory/resourceArea.hpp"
-
-CSpaceCounters::CSpaceCounters(const char* name, int ordinal, size_t max_size,
-                               ContiguousSpace* s, GenerationCounters* gc)
-    : _space(s) {
-  if (UsePerfData) {
-    EXCEPTION_MARK;
-    ResourceMark rm;
-
-    const char* cns = PerfDataManager::name_space(gc->name_space(), "space",
-                                                  ordinal);
-
-    _name_space = NEW_C_HEAP_ARRAY(char, strlen(cns)+1, mtGC);
-    strcpy(_name_space, cns);
-
-    const char* cname = PerfDataManager::counter_name(_name_space, "name");
-    PerfDataManager::create_string_constant(SUN_GC, cname, name, CHECK);
-
-    cname = PerfDataManager::counter_name(_name_space, "maxCapacity");
-    _max_capacity = PerfDataManager::create_variable(SUN_GC, cname,
-                                                     PerfData::U_Bytes,
-                                                     (jlong)max_size,
-                                                     CHECK);
-
-    cname = PerfDataManager::counter_name(_name_space, "capacity");
-    _capacity = PerfDataManager::create_variable(SUN_GC, cname,
-                                                 PerfData::U_Bytes,
-                                                 _space->capacity(),
-                                                 CHECK);
-
-    cname = PerfDataManager::counter_name(_name_space, "used");
-    _used = PerfDataManager::create_variable(SUN_GC, cname, PerfData::U_Bytes,
-                                             _space->used(),
-                                             CHECK);
-
-    cname = PerfDataManager::counter_name(_name_space, "initCapacity");
-    PerfDataManager::create_constant(SUN_GC, cname, PerfData::U_Bytes,
-                                     _space->capacity(), CHECK);
-  }
-}
-
-CSpaceCounters::~CSpaceCounters() {
-  FREE_C_HEAP_ARRAY(char, _name_space);
-}
-
-void CSpaceCounters::update_capacity() {
-  _capacity->set_value(_space->capacity());
-}
-
-void CSpaceCounters::update_used() {
-  _used->set_value(_space->used());
-}
-
-void CSpaceCounters::update_all() {
-  update_used();
-  update_capacity();
-}
diff --git a/src/hotspot/share/gc/serial/cSpaceCounters.hpp b/src/hotspot/share/gc/serial/cSpaceCounters.hpp
deleted file mode 100644
index 22a51cbbd20..00000000000
--- a/src/hotspot/share/gc/serial/cSpaceCounters.hpp
+++ /dev/null
@@ -1,62 +0,0 @@
-/*
- * Copyright (c) 2002, 2025, Oracle and/or its affiliates. All rights reserved.
- * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
- *
- * This code is free software; you can redistribute it and/or modify it
- * under the terms of the GNU General Public License version 2 only, as
- * published by the Free Software Foundation.
- *
- * This code is distributed in the hope that it will be useful, but WITHOUT
- * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
- * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
- * version 2 for more details (a copy is included in the LICENSE file that
- * accompanied this code).
- *
- * You should have received a copy of the GNU General Public License version
- * 2 along with this work; if not, write to the Free Software Foundation,
- * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
- *
- * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
- * or visit www.oracle.com if you need additional information or have any
- * questions.
- *
- */
-
-#ifndef SHARE_GC_SERIAL_CSPACECOUNTERS_HPP
-#define SHARE_GC_SERIAL_CSPACECOUNTERS_HPP
-
-#include "gc/shared/generationCounters.hpp"
-#include "gc/shared/space.hpp"
-#include "runtime/perfData.hpp"
-
-// A CSpaceCounters is a holder class for performance counters
-// that track a space;
-
-class CSpaceCounters: public CHeapObj<mtGC> {
- private:
-  PerfVariable*      _capacity;
-  PerfVariable*      _used;
-  PerfVariable*      _max_capacity;
-
-  // Constant PerfData types don't need to retain a reference.
-  // However, it's a good idea to document them here.
-  // PerfConstant*     _size;
-
-  ContiguousSpace*     _space;
-  char*                _name_space;
-
- public:
-
-  CSpaceCounters(const char* name, int ordinal, size_t max_size,
-                 ContiguousSpace* s, GenerationCounters* gc);
-
-  ~CSpaceCounters();
-
-  void update_capacity();
-  void update_used();
-  void update_all();
-
-  const char* name_space() const        { return _name_space; }
-};
-
-#endif // SHARE_GC_SERIAL_CSPACECOUNTERS_HPP
diff --git a/src/hotspot/share/gc/serial/defNewGeneration.cpp b/src/hotspot/share/gc/serial/defNewGeneration.cpp
index 9ccc7b95529..225f15f785f 100644
--- a/src/hotspot/share/gc/serial/defNewGeneration.cpp
+++ b/src/hotspot/share/gc/serial/defNewGeneration.cpp
@@ -39,6 +39,7 @@
 #include "gc/shared/gcTimer.hpp"
 #include "gc/shared/gcTrace.hpp"
 #include "gc/shared/gcTraceTime.inline.hpp"
+#include "gc/shared/hSpaceCounters.hpp"
 #include "gc/shared/oopStorageSet.inline.hpp"
 #include "gc/shared/referencePolicy.hpp"
 #include "gc/shared/referenceProcessorPhaseTimes.hpp"
@@ -248,12 +249,12 @@ DefNewGeneration::DefNewGeneration(ReservedSpace rs,
       min_size, max_size, _virtual_space.committed_size());
   _gc_counters = new CollectorCounters(policy, 0);
 
-  _eden_counters = new CSpaceCounters("eden", 0, _max_eden_size, _eden_space,
-                                      _gen_counters);
-  _from_counters = new CSpaceCounters("s0", 1, _max_survivor_size, _from_space,
-                                      _gen_counters);
-  _to_counters = new CSpaceCounters("s1", 2, _max_survivor_size, _to_space,
-                                    _gen_counters);
+  _eden_counters = new HSpaceCounters(_gen_counters->name_space(), "eden", 0,
+                                      _max_eden_size, _eden_space->capacity());
+  _from_counters = new HSpaceCounters(_gen_counters->name_space(), "s0", 1,
+                                      _max_survivor_size, _from_space->capacity());
+  _to_counters = new HSpaceCounters(_gen_counters->name_space(), "s1", 2,
+                                    _max_survivor_size, _to_space->capacity());
 
   update_counters();
   _old_gen = nullptr;
@@ -319,7 +320,7 @@ void DefNewGeneration::swap_spaces() {
   _to_space          = s;
 
   if (UsePerfData) {
-    CSpaceCounters* c = _from_counters;
+    HSpaceCounters* c = _from_counters;
     _from_counters = _to_counters;
     _to_counters = c;
   }
@@ -821,9 +822,9 @@ void DefNewGeneration::gc_epilogue() {
 
 void DefNewGeneration::update_counters() {
   if (UsePerfData) {
-    _eden_counters->update_all();
-    _from_counters->update_all();
-    _to_counters->update_all();
+    _eden_counters->update_all(_eden_space->capacity(), _eden_space->used());
+    _from_counters->update_all(_from_space->capacity(), _from_space->used());
+    _to_counters->update_all(_to_space->capacity(), _to_space->used());
     _gen_counters->update_capacity(_virtual_space.committed_size());
   }
 }
diff --git a/src/hotspot/share/gc/serial/defNewGeneration.hpp b/src/hotspot/share/gc/serial/defNewGeneration.hpp
index e0c7b6bba37..98e599ffeaf 100644
--- a/src/hotspot/share/gc/serial/defNewGeneration.hpp
+++ b/src/hotspot/share/gc/serial/defNewGeneration.hpp
@@ -25,7 +25,6 @@
 #ifndef SHARE_GC_SERIAL_DEFNEWGENERATION_HPP
 #define SHARE_GC_SERIAL_DEFNEWGENERATION_HPP
 
-#include "gc/serial/cSpaceCounters.hpp"
 #include "gc/serial/generation.hpp"
 #include "gc/serial/tenuredGeneration.hpp"
 #include "gc/shared/ageTable.hpp"
@@ -38,7 +37,7 @@
 #include "utilities/stack.hpp"
 
 class ContiguousSpace;
-class CSpaceCounters;
+class HSpaceCounters;
 class OldGenScanClosure;
 class YoungGenScanClosure;
 class DefNewTracer;
@@ -102,9 +101,9 @@ class DefNewGeneration: public Generation {
 
   // Performance Counters
   GenerationCounters*  _gen_counters;
-  CSpaceCounters*      _eden_counters;
-  CSpaceCounters*      _from_counters;
-  CSpaceCounters*      _to_counters;
+  HSpaceCounters*      _eden_counters;
+  HSpaceCounters*      _from_counters;
+  HSpaceCounters*      _to_counters;
 
   // sizing information
   size_t               _max_eden_size;
diff --git a/src/hotspot/share/gc/serial/tenuredGeneration.cpp b/src/hotspot/share/gc/serial/tenuredGeneration.cpp
index f68847ed1a6..95a996a98c1 100644
--- a/src/hotspot/share/gc/serial/tenuredGeneration.cpp
+++ b/src/hotspot/share/gc/serial/tenuredGeneration.cpp
@@ -32,6 +32,7 @@
 #include "gc/shared/gcTimer.hpp"
 #include "gc/shared/gcTrace.hpp"
 #include "gc/shared/genArguments.hpp"
+#include "gc/shared/hSpaceCounters.hpp"
 #include "gc/shared/space.hpp"
 #include "gc/shared/spaceDecorator.hpp"
 #include "logging/log.hpp"
@@ -330,9 +331,9 @@ TenuredGeneration::TenuredGeneration(ReservedSpace rs,
 
   _gc_counters = new CollectorCounters("Serial full collection pauses", 1);
 
-  _space_counters = new CSpaceCounters(gen_name, 0,
+  _space_counters = new HSpaceCounters(_gen_counters->name_space(), gen_name, 0,
                                        _virtual_space.reserved_size(),
-                                       _the_space, _gen_counters);
+                                       _the_space->capacity());
 }
 
 void TenuredGeneration::gc_prologue() {
@@ -367,7 +368,7 @@ void TenuredGeneration::update_promote_stats() {
 
 void TenuredGeneration::update_counters() {
   if (UsePerfData) {
-    _space_counters->update_all();
+    _space_counters->update_all(_the_space->capacity(), _the_space->used());
     _gen_counters->update_capacity(_virtual_space.committed_size());
   }
 }
diff --git a/src/hotspot/share/gc/serial/tenuredGeneration.hpp b/src/hotspot/share/gc/serial/tenuredGeneration.hpp
index ff73ab72b2c..1e3576d5ae7 100644
--- a/src/hotspot/share/gc/serial/tenuredGeneration.hpp
+++ b/src/hotspot/share/gc/serial/tenuredGeneration.hpp
@@ -25,7 +25,6 @@
 #ifndef SHARE_GC_SERIAL_TENUREDGENERATION_HPP
 #define SHARE_GC_SERIAL_TENUREDGENERATION_HPP
 
-#include "gc/serial/cSpaceCounters.hpp"
 #include "gc/serial/generation.hpp"
 #include "gc/serial/serialBlockOffsetTable.hpp"
 #include "gc/shared/generationCounters.hpp"
@@ -34,6 +33,7 @@
 
 class CardTableRS;
 class ContiguousSpace;
+class HSpaceCounters;
 
 // TenuredGeneration models the heap containing old (promoted/tenured) objects
 // contained in a single contiguous space. This generation is covered by a card
@@ -68,7 +68,7 @@ class TenuredGeneration: public Generation {
   ContiguousSpace*    _the_space;       // Actual space holding objects
 
   GenerationCounters* _gen_counters;
-  CSpaceCounters*     _space_counters;
+  HSpaceCounters*     _space_counters;
 
   // Avg amount promoted; used for avoiding promotion undo
   // This class does not update deviations if the sample is zero.

From e22c95cd96f823f75e00396b9ce0701b0eb6c3d5 Mon Sep 17 00:00:00 2001
From: SendaoYan <syan@openjdk.org>
Date: Mon, 9 Mar 2026 08:50:25 +0000
Subject: [PATCH 086/655] 8378746: ZGC:
 jdk/jfr/event/gc/detailed/TestZRelocationSetGroupEvent.java intermittent OOME

Reviewed-by: stefank, ayang
---
 .../jfr/event/gc/detailed/TestZRelocationSetGroupEvent.java   | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/test/jdk/jdk/jfr/event/gc/detailed/TestZRelocationSetGroupEvent.java b/test/jdk/jdk/jfr/event/gc/detailed/TestZRelocationSetGroupEvent.java
index 29e1de24224..8ece7bf12d7 100644
--- a/test/jdk/jdk/jfr/event/gc/detailed/TestZRelocationSetGroupEvent.java
+++ b/test/jdk/jdk/jfr/event/gc/detailed/TestZRelocationSetGroupEvent.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2020, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -36,7 +36,7 @@ import jdk.test.lib.jfr.Events;
  * @requires vm.hasJFR & vm.gc.Z
  * @requires vm.flagless
  * @library /test/lib /test/jdk /test/hotspot/jtreg
- * @run main/othervm -XX:+UseZGC -Xmx32M jdk.jfr.event.gc.detailed.TestZRelocationSetGroupEvent
+ * @run main/othervm -XX:+UseZGC -Xmx64M jdk.jfr.event.gc.detailed.TestZRelocationSetGroupEvent
  */
 
 public class TestZRelocationSetGroupEvent {

From 321bf3f1fa04efb1c344fd93b59fea89587eecee Mon Sep 17 00:00:00 2001
From: Michael Reeves <michael.reeves077@gmail.com>
Date: Mon, 9 Mar 2026 09:10:19 +0000
Subject: [PATCH 087/655] 8372273: C2: Extend the refactoring for IGV printing
 to include rest of the node properties

Reviewed-by: chagedorn, snatarajan
---
 src/hotspot/share/opto/idealGraphPrinter.cpp | 109 +++++++++----------
 1 file changed, 54 insertions(+), 55 deletions(-)

diff --git a/src/hotspot/share/opto/idealGraphPrinter.cpp b/src/hotspot/share/opto/idealGraphPrinter.cpp
index 5070a9f00e1..563a914ea5c 100644
--- a/src/hotspot/share/opto/idealGraphPrinter.cpp
+++ b/src/hotspot/share/opto/idealGraphPrinter.cpp
@@ -40,16 +40,60 @@ class PrintProperties
 {
 private:
   IdealGraphPrinter* _printer;
+  void print_alias_properties(Node* node);
+  void print_escape_properties(Node* node);
 
 public:
   PrintProperties(IdealGraphPrinter* printer) : _printer(printer) {}
   void print_node_properties(Node* node);
+  void print_node_details(Node* node);
   void print_lrg_properties(const LRG& lrg, const char* buffer);
   void print_property(int flag, const char* name);
   void print_property(int flag, const char* name, const char* val);
   void print_property(int flag, const char* name, int val);
 };
 
+void PrintProperties::print_alias_properties(Node* node) {
+  const TypePtr* adr_type = node->adr_type();
+  Compile* C = _printer->C;
+  if (adr_type != nullptr && C->have_alias_type(adr_type)) {
+    Compile::AliasType* at = C->alias_type(adr_type);
+    if (at != nullptr) {
+      print_property(true, "alias_index", at->index());
+      // The value of at->field(), if present, is already dumped in the
+      // "source"/"destination" properties.
+      const Type* element = at->element();
+      if (element != nullptr) {
+        stringStream element_stream;
+        element->dump_on(&element_stream);
+        print_property(true, "alias_element", element_stream.freeze());
+      }
+      print_property(at->is_rewritable(), "alias_is_rewritable");
+      print_property(at->is_volatile(), "alias_is_volatile");
+      print_property(at->general_index() != at->index(), "alias_general_index", at->general_index());
+    }
+  }
+}
+
+void PrintProperties::print_escape_properties(Node* node) {
+  // Dump escape analysis state for relevant nodes.
+  if (node->is_Allocate()) {
+    AllocateNode* alloc = node->as_Allocate();
+    print_property(alloc->_is_scalar_replaceable, "is_scalar_replaceable");
+    print_property(alloc->_is_non_escaping, "is_non_escaping");
+    print_property(alloc->does_not_escape_thread(), "does_not_escape_thread");
+  }
+  if (node->is_SafePoint() && node->as_SafePoint()->has_ea_local_in_scope()) {
+    print_property(true, "has_ea_local_in_scope");
+  }
+  if (node->is_CallJava() && node->as_CallJava()->arg_escape()) {
+    print_property(true, "arg_escape");
+  }
+  if (node->is_Initialize() && node->as_Initialize()->does_not_escape()) {
+    print_property(true, "does_not_escape");
+  }
+}
+
 void PrintProperties::print_node_properties(Node* node) {
   const jushort flags = node->flags();
   print_property((flags & Node::Flag_is_Copy), "is_copy");
@@ -75,6 +119,15 @@ void PrintProperties::print_node_properties(Node* node) {
   }
 }
 
+void PrintProperties::print_node_details(Node* node) {
+  print_alias_properties(node);
+
+  print_escape_properties(node);
+
+  print_property(node->is_block_proj() != nullptr, "is_block_proj");
+  print_property(node->is_block_start(), "is_block_start");
+}
+
 void PrintProperties::print_lrg_properties(const LRG &lrg, const char *buffer) {
   print_property(true, "mask", buffer);
   print_property(true, "mask_size", lrg.mask_size());
@@ -651,61 +704,7 @@ void IdealGraphPrinter::visit_node(Node* n, bool edges) {
     assert(s2.size() < sizeof(buffer), "size in range");
     print_prop("dump_spec", buffer);
 
-    const TypePtr* adr_type = node->adr_type();
-    if (adr_type != nullptr && C->have_alias_type(adr_type)) {
-      Compile::AliasType* at = C->alias_type(adr_type);
-      if (at != nullptr) {
-        print_prop("alias_index", at->index());
-        // The value of at->field(), if present, is already dumped in the
-        // "source"/"destination" properties.
-        const Type* element = at->element();
-        if (element != nullptr) {
-          stringStream element_stream;
-          element->dump_on(&element_stream);
-          print_prop("alias_element", element_stream.freeze());
-        }
-        if (at->is_rewritable()) {
-          print_prop("alias_is_rewritable", "true");
-        }
-        if (at->is_volatile()) {
-          print_prop("alias_is_volatile", "true");
-        }
-        if (at->general_index() != at->index()) {
-          print_prop("alias_general_index", at->general_index());
-        }
-      }
-    }
-
-    if (node->is_block_proj()) {
-      print_prop("is_block_proj", "true");
-    }
-
-    if (node->is_block_start()) {
-      print_prop("is_block_start", "true");
-    }
-
-    // Dump escape analysis state for relevant nodes.
-    if (node->is_Allocate()) {
-      AllocateNode* alloc = node->as_Allocate();
-      if (alloc->_is_scalar_replaceable) {
-        print_prop("is_scalar_replaceable", "true");
-      }
-      if (alloc->_is_non_escaping) {
-        print_prop("is_non_escaping", "true");
-      }
-      if (alloc->does_not_escape_thread()) {
-        print_prop("does_not_escape_thread", "true");
-      }
-    }
-    if (node->is_SafePoint() && node->as_SafePoint()->has_ea_local_in_scope()) {
-      print_prop("has_ea_local_in_scope", "true");
-    }
-    if (node->is_CallJava() && node->as_CallJava()->arg_escape()) {
-      print_prop("arg_escape", "true");
-    }
-    if (node->is_Initialize() && node->as_Initialize()->does_not_escape()) {
-      print_prop("does_not_escape", "true");
-    }
+    print_node.print_node_details(node);
 
     const char *short_name = "short_name";
     if (strcmp(node->Name(), "Parm") == 0 && node->as_Proj()->_con >= TypeFunc::Parms) {

From d6943c532eeade593b17c7f14c136c20a3741e05 Mon Sep 17 00:00:00 2001
From: Albert Mingkun Yang <ayang@openjdk.org>
Date: Mon, 9 Mar 2026 09:10:41 +0000
Subject: [PATCH 088/655] 8379193: Incorrect build ID path in SATestUtils.java

Reviewed-by: kevinw, ysuenaga
---
 test/lib/jdk/test/lib/SA/SATestUtils.java | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/test/lib/jdk/test/lib/SA/SATestUtils.java b/test/lib/jdk/test/lib/SA/SATestUtils.java
index 50f5d71f1f1..754ef4c40dd 100644
--- a/test/lib/jdk/test/lib/SA/SATestUtils.java
+++ b/test/lib/jdk/test/lib/SA/SATestUtils.java
@@ -333,7 +333,7 @@ public class SATestUtils {
                                          .get();
                     String dir = buildID.substring(0, 2);
                     String file = buildID.substring(2);
-                    debuginfoPath = Path.of("/usr/lib/debug/.build_id", dir, file + ".debug");
+                    debuginfoPath = Path.of("/usr/lib/debug/.build-id", dir, file + ".debug");
                     exists = Files.exists(debuginfoPath);
                 } catch (NoSuchElementException _) {
                     // return null if vDSO not found.

From 7101a0507c48d22762c20df4dbff88b180fc0f74 Mon Sep 17 00:00:00 2001
From: Thomas Schatzl <tschatzl@openjdk.org>
Date: Mon, 9 Mar 2026 09:14:56 +0000
Subject: [PATCH 089/655] 8379404: G1: Hide ConcurrentMarkThread reference from
 outside ConcurrentMark

Reviewed-by: stefank, iwalulya
---
 src/hotspot/share/gc/g1/g1CollectedHeap.cpp  | 20 ++++----------
 src/hotspot/share/gc/g1/g1CollectedHeap.hpp  |  3 ---
 src/hotspot/share/gc/g1/g1ConcurrentMark.cpp | 28 +++++++++++++++++---
 src/hotspot/share/gc/g1/g1ConcurrentMark.hpp | 17 +++++++++---
 4 files changed, 42 insertions(+), 26 deletions(-)

diff --git a/src/hotspot/share/gc/g1/g1CollectedHeap.cpp b/src/hotspot/share/gc/g1/g1CollectedHeap.cpp
index 3f5d674c443..abc45254782 100644
--- a/src/hotspot/share/gc/g1/g1CollectedHeap.cpp
+++ b/src/hotspot/share/gc/g1/g1CollectedHeap.cpp
@@ -1652,21 +1652,13 @@ jint G1CollectedHeap::initialize() {
   return JNI_OK;
 }
 
-bool G1CollectedHeap::concurrent_mark_is_terminating() const {
-  assert(_cm != nullptr, "_cm must have been created");
-  assert(_cm->is_fully_initialized(), "thread must exist in order to check if mark is terminating");
-  return _cm->cm_thread()->should_terminate();
-}
-
 void G1CollectedHeap::stop() {
   // Stop all concurrent threads. We do this to make sure these threads
   // do not continue to execute and access resources (e.g. logging)
   // that are destroyed during shutdown.
   _cr->stop();
   _service_thread->stop();
-  if (_cm->is_fully_initialized()) {
-    _cm->cm_thread()->stop();
-  }
+  _cm->stop();
 }
 
 void G1CollectedHeap::safepoint_synchronize_begin() {
@@ -1857,12 +1849,12 @@ void G1CollectedHeap::increment_old_marking_cycles_completed(bool concurrent,
     record_whole_heap_examined_timestamp();
   }
 
-  // We need to clear the "in_progress" flag in the CM thread before
+  // We need to tell G1ConcurrentMark to update the state  before
   // we wake up any waiters (especially when ExplicitInvokesConcurrent
   // is set) so that if a waiter requests another System.gc() it doesn't
   // incorrectly see that a marking cycle is still in progress.
   if (concurrent) {
-    _cm->cm_thread()->set_idle();
+    _cm->notify_concurrent_cycle_completed();
   }
 
   // Notify threads waiting in System.gc() (with ExplicitGCInvokesConcurrent)
@@ -2565,11 +2557,9 @@ void G1CollectedHeap::start_concurrent_cycle(bool concurrent_operation_is_full_m
   assert(!_cm->in_progress(), "Can not start concurrent operation while in progress");
   MutexLocker x(G1CGC_lock, Mutex::_no_safepoint_check_flag);
   if (concurrent_operation_is_full_mark) {
-    _cm->post_concurrent_mark_start();
-    _cm->cm_thread()->start_full_mark();
+    _cm->start_full_concurrent_cycle();
   } else {
-    _cm->post_concurrent_undo_start();
-    _cm->cm_thread()->start_undo_mark();
+    _cm->start_undo_concurrent_cycle();
   }
   G1CGC_lock->notify();
 }
diff --git a/src/hotspot/share/gc/g1/g1CollectedHeap.hpp b/src/hotspot/share/gc/g1/g1CollectedHeap.hpp
index 8ff9d481000..7a4cde9001e 100644
--- a/src/hotspot/share/gc/g1/g1CollectedHeap.hpp
+++ b/src/hotspot/share/gc/g1/g1CollectedHeap.hpp
@@ -915,9 +915,6 @@ public:
   // specified by the policy object.
   jint initialize() override;
 
-  // Returns whether concurrent mark threads (and the VM) are about to terminate.
-  bool concurrent_mark_is_terminating() const;
-
   void safepoint_synchronize_begin() override;
   void safepoint_synchronize_end() override;
 
diff --git a/src/hotspot/share/gc/g1/g1ConcurrentMark.cpp b/src/hotspot/share/gc/g1/g1ConcurrentMark.cpp
index 074231a02d4..b4a5d673fd2 100644
--- a/src/hotspot/share/gc/g1/g1ConcurrentMark.cpp
+++ b/src/hotspot/share/gc/g1/g1ConcurrentMark.cpp
@@ -581,6 +581,11 @@ PartialArrayStateManager* G1ConcurrentMark::partial_array_state_manager() const
   return _partial_array_state_manager;
 }
 
+G1ConcurrentMarkThread* G1ConcurrentMark::cm_thread() const {
+  assert(is_fully_initialized(), "must be");
+  return _cm_thread;
+}
+
 void G1ConcurrentMark::reset() {
   _has_aborted.store_relaxed(false);
 
@@ -715,7 +720,6 @@ public:
 private:
   // Heap region closure used for clearing the _mark_bitmap.
   class G1ClearBitmapHRClosure : public G1HeapRegionClosure {
-  private:
     G1ConcurrentMark* _cm;
     G1CMBitMap* _bitmap;
     bool _suspendible; // If suspendible, do yield checks.
@@ -959,7 +963,7 @@ void G1ConcurrentMark::pre_concurrent_start(GCCause::Cause cause) {
   _gc_tracer_cm->set_gc_cause(cause);
 }
 
-void G1ConcurrentMark::post_concurrent_mark_start() {
+void G1ConcurrentMark::start_full_concurrent_cycle() {
   // Start Concurrent Marking weak-reference discovery.
   ReferenceProcessor* rp = _g1h->ref_processor_cm();
   rp->start_discovery(false /* always_clear */);
@@ -976,10 +980,26 @@ void G1ConcurrentMark::post_concurrent_mark_start() {
   // when marking is on. So, it's also called at the end of the
   // concurrent start pause to update the heap end, if the heap expands
   // during it. No need to call it here.
+
+  // Signal the thread to start work.
+  cm_thread()->start_full_mark();
 }
 
-void G1ConcurrentMark::post_concurrent_undo_start() {
+void G1ConcurrentMark::start_undo_concurrent_cycle() {
   root_regions()->cancel_scan();
+
+  // Signal the thread to start work.
+  cm_thread()->start_undo_mark();
+}
+
+void G1ConcurrentMark::notify_concurrent_cycle_completed() {
+  cm_thread()->set_idle();
+}
+
+void G1ConcurrentMark::stop() {
+  if (is_fully_initialized()) {
+    cm_thread()->stop();
+  }
 }
 
 /*
@@ -1943,7 +1963,7 @@ bool G1ConcurrentMark::concurrent_cycle_abort() {
   // has been signalled is already rare), and this work should be negligible compared
   // to actual full gc work.
 
-  if (!is_fully_initialized() || (!cm_thread()->in_progress() && !_g1h->concurrent_mark_is_terminating())) {
+  if (!is_fully_initialized() || (!cm_thread()->in_progress() && !cm_thread()->should_terminate())) {
     return false;
   }
 
diff --git a/src/hotspot/share/gc/g1/g1ConcurrentMark.hpp b/src/hotspot/share/gc/g1/g1ConcurrentMark.hpp
index 11da6dae5b3..8bd04437097 100644
--- a/src/hotspot/share/gc/g1/g1ConcurrentMark.hpp
+++ b/src/hotspot/share/gc/g1/g1ConcurrentMark.hpp
@@ -352,6 +352,7 @@ class G1ConcurrentMark : public CHeapObj<mtGC> {
   friend class G1CMRemarkTask;
   friend class G1CMRootRegionScanTask;
   friend class G1CMTask;
+  friend class G1ClearBitMapTask;
   friend class G1ConcurrentMarkThread;
 
   G1ConcurrentMarkThread* _cm_thread;     // The thread doing the work
@@ -524,6 +525,9 @@ class G1ConcurrentMark : public CHeapObj<mtGC> {
   Atomic<HeapWord*>* _top_at_rebuild_starts;
   // True when Remark pause selected regions for rebuilding.
   bool _needs_remembered_set_rebuild;
+
+  G1ConcurrentMarkThread* cm_thread() const;
+
 public:
   // To be called when an object is marked the first time, e.g. after a successful
   // mark_in_bitmap call. Updates various statistics data.
@@ -602,8 +606,6 @@ public:
                    G1RegionToSpaceMapper* bitmap_storage);
   ~G1ConcurrentMark();
 
-  G1ConcurrentMarkThread* cm_thread() { return _cm_thread; }
-
   G1CMBitMap* mark_bitmap() const { return (G1CMBitMap*)&_mark_bitmap; }
 
   // Calculates the number of concurrent GC threads to be used in the marking phase.
@@ -632,8 +634,15 @@ public:
   // These two methods do the work that needs to be done at the start and end of the
   // concurrent start pause.
   void pre_concurrent_start(GCCause::Cause cause);
-  void post_concurrent_mark_start();
-  void post_concurrent_undo_start();
+
+  // Start the particular type of concurrent cycle. After this call threads may be running.
+  void start_full_concurrent_cycle();
+  void start_undo_concurrent_cycle();
+
+  void notify_concurrent_cycle_completed();
+
+  // Stop active components/the concurrent mark thread.
+  void stop();
 
   // Scan all the root regions and mark everything reachable from
   // them.

From 695b83346f807e9bc2700ab412f1133957073c48 Mon Sep 17 00:00:00 2001
From: Saranya Natarajan <snatarajan@openjdk.org>
Date: Mon, 9 Mar 2026 09:19:28 +0000
Subject: [PATCH 090/655] 8377148: Remove obsolete functions
 Matcher::is_spillable_arg() and Matcher::interpreter_frame_pointer_reg()

Reviewed-by: dfenacci, rcastanedalo, mdoerr, fyang, amitkumar, mbaesken
---
 src/hotspot/cpu/aarch64/aarch64.ad  | 18 +++---------------
 src/hotspot/cpu/arm/arm.ad          | 11 +++--------
 src/hotspot/cpu/ppc/ppc.ad          | 18 +++---------------
 src/hotspot/cpu/riscv/riscv.ad      | 18 +++---------------
 src/hotspot/cpu/s390/s390.ad        | 20 ++++----------------
 src/hotspot/cpu/x86/x86.ad          | 16 ++--------------
 src/hotspot/share/adlc/adlparse.cpp | 10 +---------
 src/hotspot/share/adlc/adlparse.hpp |  3 +--
 src/hotspot/share/adlc/formsopt.cpp |  3 +--
 src/hotspot/share/adlc/formsopt.hpp |  3 +--
 src/hotspot/share/adlc/output_c.cpp | 10 +---------
 src/hotspot/share/opto/matcher.hpp  |  9 +++------
 12 files changed, 26 insertions(+), 113 deletions(-)

diff --git a/src/hotspot/cpu/aarch64/aarch64.ad b/src/hotspot/cpu/aarch64/aarch64.ad
index 9734c6845ea..51bb15e0f59 100644
--- a/src/hotspot/cpu/aarch64/aarch64.ad
+++ b/src/hotspot/cpu/aarch64/aarch64.ad
@@ -1,5 +1,5 @@
 //
-// Copyright (c) 2003, 2025, Oracle and/or its affiliates. All rights reserved.
+// Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
 // Copyright (c) 2014, 2024, Red Hat, Inc. All rights reserved.
 // Copyright 2025 Arm Limited and/or its affiliates.
 // DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
@@ -2467,11 +2467,8 @@ bool Matcher::is_generic_vector(MachOper* opnd)  {
   return opnd->opcode() == VREG;
 }
 
+#ifdef ASSERT
 // Return whether or not this register is ever used as an argument.
-// This function is used on startup to build the trampoline stubs in
-// generateOptoStub.  Registers not mentioned will be killed by the VM
-// call in the trampoline, and arguments in those registers not be
-// available to the callee.
 bool Matcher::can_be_java_arg(int reg)
 {
   return
@@ -2492,11 +2489,7 @@ bool Matcher::can_be_java_arg(int reg)
     reg ==  V6_num || reg == V6_H_num ||
     reg ==  V7_num || reg == V7_H_num;
 }
-
-bool Matcher::is_spillable_arg(int reg)
-{
-  return can_be_java_arg(reg);
-}
+#endif
 
 uint Matcher::int_pressure_limit()
 {
@@ -3814,11 +3807,6 @@ frame %{
   // Compiled code's Frame Pointer
   frame_pointer(R31);
 
-  // Interpreter stores its frame pointer in a register which is
-  // stored to the stack by I2CAdaptors.
-  // I2CAdaptors convert from interpreted java to compiled java.
-  interpreter_frame_pointer(R29);
-
   // Stack alignment requirement
   stack_alignment(StackAlignmentInBytes); // Alignment size in bytes (128-bit -> 16 bytes)
 
diff --git a/src/hotspot/cpu/arm/arm.ad b/src/hotspot/cpu/arm/arm.ad
index 606275d7666..87c609be5a7 100644
--- a/src/hotspot/cpu/arm/arm.ad
+++ b/src/hotspot/cpu/arm/arm.ad
@@ -1088,10 +1088,8 @@ bool Matcher::pd_clone_address_expressions(AddPNode* m, Matcher::MStack& mstack,
   return clone_base_plus_offset_address(m, mstack, address_visited);
 }
 
-// Return whether or not this register is ever used as an argument.  This
-// function is used on startup to build the trampoline stubs in generateOptoStub.
-// Registers not mentioned will be killed by the VM call in the trampoline, and
-// arguments in those registers not be available to the callee.
+#ifdef ASSERT
+// Return whether or not this register is ever used as an argument.
 bool Matcher::can_be_java_arg( int reg ) {
   if (reg == R_R0_num ||
       reg == R_R1_num ||
@@ -1102,10 +1100,7 @@ bool Matcher::can_be_java_arg( int reg ) {
       reg <= R_S13_num) return true;
   return false;
 }
-
-bool Matcher::is_spillable_arg( int reg ) {
-  return can_be_java_arg(reg);
-}
+#endif
 
 uint Matcher::int_pressure_limit()
 {
diff --git a/src/hotspot/cpu/ppc/ppc.ad b/src/hotspot/cpu/ppc/ppc.ad
index 4cb9f8820a0..7e3cd04171d 100644
--- a/src/hotspot/cpu/ppc/ppc.ad
+++ b/src/hotspot/cpu/ppc/ppc.ad
@@ -2412,10 +2412,8 @@ bool Matcher::is_generic_vector(MachOper* opnd)  {
   return false;
 }
 
-// Return whether or not this register is ever used as an argument. This
-// function is used on startup to build the trampoline stubs in generateOptoStub.
-// Registers not mentioned will be killed by the VM call in the trampoline, and
-// arguments in those registers not be available to the callee.
+#ifdef ASSERT
+// Return whether or not this register is ever used as an argument.
 bool Matcher::can_be_java_arg(int reg) {
   // We must include the virtual halves in order to get STDs and LDs
   // instead of STWs and LWs in the trampoline stubs.
@@ -2447,10 +2445,7 @@ bool Matcher::can_be_java_arg(int reg) {
 
   return false;
 }
-
-bool Matcher::is_spillable_arg(int reg) {
-  return can_be_java_arg(reg);
-}
+#endif
 
 uint Matcher::int_pressure_limit()
 {
@@ -3715,13 +3710,6 @@ frame %{
   // Compiled code's Frame Pointer.
   frame_pointer(R1); // R1_SP
 
-  // Interpreter stores its frame pointer in a register which is
-  // stored to the stack by I2CAdaptors. I2CAdaptors convert from
-  // interpreted java to compiled java.
-  //
-  // R14_state holds pointer to caller's cInterpreter.
-  interpreter_frame_pointer(R14); // R14_state
-
   stack_alignment(frame::alignment_in_bytes);
 
   // Number of outgoing stack slots killed above the
diff --git a/src/hotspot/cpu/riscv/riscv.ad b/src/hotspot/cpu/riscv/riscv.ad
index ed6e8db0606..54ea81683fc 100644
--- a/src/hotspot/cpu/riscv/riscv.ad
+++ b/src/hotspot/cpu/riscv/riscv.ad
@@ -1,5 +1,5 @@
 //
-// Copyright (c) 2003, 2025, Oracle and/or its affiliates. All rights reserved.
+// Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
 // Copyright (c) 2014, 2020, Red Hat Inc. All rights reserved.
 // Copyright (c) 2020, 2024, Huawei Technologies Co., Ltd. All rights reserved.
 // DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
@@ -2060,11 +2060,8 @@ bool Matcher::is_generic_vector(MachOper* opnd) {
   return false;
 }
 
+#ifdef ASSERT
 // Return whether or not this register is ever used as an argument.
-// This function is used on startup to build the trampoline stubs in
-// generateOptoStub.  Registers not mentioned will be killed by the VM
-// call in the trampoline, and arguments in those registers not be
-// available to the callee.
 bool Matcher::can_be_java_arg(int reg)
 {
   return
@@ -2085,11 +2082,7 @@ bool Matcher::can_be_java_arg(int reg)
     reg ==  F16_num || reg == F16_H_num ||
     reg ==  F17_num || reg == F17_H_num;
 }
-
-bool Matcher::is_spillable_arg(int reg)
-{
-  return can_be_java_arg(reg);
-}
+#endif
 
 uint Matcher::int_pressure_limit()
 {
@@ -2559,11 +2552,6 @@ frame %{
   // Compiled code's Frame Pointer
   frame_pointer(R2);
 
-  // Interpreter stores its frame pointer in a register which is
-  // stored to the stack by I2CAdaptors.
-  // I2CAdaptors convert from interpreted java to compiled java.
-  interpreter_frame_pointer(R8);
-
   // Stack alignment requirement
   stack_alignment(StackAlignmentInBytes); // Alignment size in bytes (128-bit -> 16 bytes)
 
diff --git a/src/hotspot/cpu/s390/s390.ad b/src/hotspot/cpu/s390/s390.ad
index 19bd3620228..1521edde40c 100644
--- a/src/hotspot/cpu/s390/s390.ad
+++ b/src/hotspot/cpu/s390/s390.ad
@@ -1,5 +1,5 @@
 //
-// Copyright (c) 2017, 2025, Oracle and/or its affiliates. All rights reserved.
+// Copyright (c) 2017, 2026, Oracle and/or its affiliates. All rights reserved.
 // Copyright (c) 2017, 2024 SAP SE. All rights reserved.
 // DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
 //
@@ -1890,10 +1890,8 @@ const int z_num_iarg_registers = sizeof(z_iarg_reg) / sizeof(z_iarg_reg[0]);
 
 const int z_num_farg_registers = sizeof(z_farg_reg) / sizeof(z_farg_reg[0]);
 
-// Return whether or not this register is ever used as an argument. This
-// function is used on startup to build the trampoline stubs in generateOptoStub.
-// Registers not mentioned will be killed by the VM call in the trampoline, and
-// arguments in those registers not be available to the callee.
+#ifdef ASSERT
+// Return whether or not this register is ever used as an argument.
 bool Matcher::can_be_java_arg(int reg) {
   // We return true for all registers contained in z_iarg_reg[] and
   // z_farg_reg[] and their virtual halves.
@@ -1917,10 +1915,7 @@ bool Matcher::can_be_java_arg(int reg) {
 
   return false;
 }
-
-bool Matcher::is_spillable_arg(int reg) {
-  return can_be_java_arg(reg);
-}
+#endif
 
 uint Matcher::int_pressure_limit()
 {
@@ -2606,13 +2601,6 @@ frame %{
   // z/Architecture stack pointer
   frame_pointer(Z_R15); // Z_SP
 
-  // Interpreter stores its frame pointer in a register which is
-  // stored to the stack by I2CAdaptors. I2CAdaptors convert from
-  // interpreted java to compiled java.
-  //
-  // Z_state holds pointer to caller's cInterpreter.
-  interpreter_frame_pointer(Z_R7); // Z_state
-
   // Use alignment_in_bytes instead of log_2_of_alignment_in_bits.
   stack_alignment(frame::alignment_in_bytes);
 
diff --git a/src/hotspot/cpu/x86/x86.ad b/src/hotspot/cpu/x86/x86.ad
index b155355c827..ed380105565 100644
--- a/src/hotspot/cpu/x86/x86.ad
+++ b/src/hotspot/cpu/x86/x86.ad
@@ -2726,11 +2726,8 @@ bool Matcher::is_short_branch_offset(int rule, int br_size, int offset) {
   return (-128 <= offset && offset <= 127);
 }
 
+#ifdef ASSERT
 // Return whether or not this register is ever used as an argument.
-// This function is used on startup to build the trampoline stubs in
-// generateOptoStub.  Registers not mentioned will be killed by the VM
-// call in the trampoline, and arguments in those registers not be
-// available to the callee.
 bool Matcher::can_be_java_arg(int reg)
 {
   return
@@ -2750,11 +2747,7 @@ bool Matcher::can_be_java_arg(int reg)
     reg == XMM6_num || reg == XMM6b_num ||
     reg == XMM7_num || reg == XMM7b_num;
 }
-
-bool Matcher::is_spillable_arg(int reg)
-{
-  return can_be_java_arg(reg);
-}
+#endif
 
 uint Matcher::int_pressure_limit()
 {
@@ -4691,11 +4684,6 @@ frame
   // Compiled code's Frame Pointer
   frame_pointer(RSP);
 
-  // Interpreter stores its frame pointer in a register which is
-  // stored to the stack by I2CAdaptors.
-  // I2CAdaptors convert from interpreted java to compiled java.
-  interpreter_frame_pointer(RBP);
-
   // Stack alignment requirement
   stack_alignment(StackAlignmentInBytes); // Alignment size in bytes (128-bit -> 16 bytes)
 
diff --git a/src/hotspot/share/adlc/adlparse.cpp b/src/hotspot/share/adlc/adlparse.cpp
index 356c24760e8..b49efa34be8 100644
--- a/src/hotspot/share/adlc/adlparse.cpp
+++ b/src/hotspot/share/adlc/adlparse.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1997, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -993,9 +993,6 @@ void ADLParser::frame_parse(void) {
       if (strcmp(token,"frame_pointer")==0) {
         frame_pointer_parse(frame, false);
       }
-      if (strcmp(token,"interpreter_frame_pointer")==0) {
-        interpreter_frame_pointer_parse(frame, false);
-      }
       if (strcmp(token,"inline_cache_reg")==0) {
         inline_cache_parse(frame, false);
       }
@@ -1119,11 +1116,6 @@ void ADLParser::frame_pointer_parse(FrameForm *frame, bool native) {
   else        { frame->_frame_pointer   = frame_pointer; }
 }
 
-//------------------------------interpreter_frame_pointer_parse----------------------------
-void ADLParser::interpreter_frame_pointer_parse(FrameForm *frame, bool native) {
-  frame->_interpreter_frame_pointer_reg = parse_one_arg("interpreter frame pointer entry");
-}
-
 //------------------------------inline_cache_parse-----------------------------
 void ADLParser::inline_cache_parse(FrameForm *frame, bool native) {
   frame->_inline_cache_reg = parse_one_arg("inline cache reg entry");
diff --git a/src/hotspot/share/adlc/adlparse.hpp b/src/hotspot/share/adlc/adlparse.hpp
index 02baec53262..89296193612 100644
--- a/src/hotspot/share/adlc/adlparse.hpp
+++ b/src/hotspot/share/adlc/adlparse.hpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1997, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -120,7 +120,6 @@ protected:
   // Parse the components of the frame section
   void sync_stack_slots_parse(FrameForm *frame);
   void frame_pointer_parse(FrameForm *frame, bool native);
-  void interpreter_frame_pointer_parse(FrameForm *frame, bool native);
   void inline_cache_parse(FrameForm *frame, bool native);
   void interpreter_arg_ptr_parse(FrameForm *frame, bool native);
   void interpreter_method_parse(FrameForm *frame, bool native);
diff --git a/src/hotspot/share/adlc/formsopt.cpp b/src/hotspot/share/adlc/formsopt.cpp
index fbd1043492e..091e34f40f4 100644
--- a/src/hotspot/share/adlc/formsopt.cpp
+++ b/src/hotspot/share/adlc/formsopt.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1998, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1998, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -476,7 +476,6 @@ void AllocClass::forms_do(FormClosure* f) {
 FrameForm::FrameForm() {
   _sync_stack_slots = nullptr;
   _inline_cache_reg = nullptr;
-  _interpreter_frame_pointer_reg = nullptr;
   _cisc_spilling_operand_name = nullptr;
   _frame_pointer = nullptr;
   _c_frame_pointer = nullptr;
diff --git a/src/hotspot/share/adlc/formsopt.hpp b/src/hotspot/share/adlc/formsopt.hpp
index 9e0c9db854d..087ab1e2653 100644
--- a/src/hotspot/share/adlc/formsopt.hpp
+++ b/src/hotspot/share/adlc/formsopt.hpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1998, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1998, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -347,7 +347,6 @@ public:
   // Public Data
   char *_sync_stack_slots;
   char *_inline_cache_reg;
-  char *_interpreter_frame_pointer_reg;
   char *_cisc_spilling_operand_name;
   char *_frame_pointer;
   char *_c_frame_pointer;
diff --git a/src/hotspot/share/adlc/output_c.cpp b/src/hotspot/share/adlc/output_c.cpp
index 9cbd6aaf66f..45b3d6bda63 100644
--- a/src/hotspot/share/adlc/output_c.cpp
+++ b/src/hotspot/share/adlc/output_c.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1998, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1998, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -4212,14 +4212,6 @@ void ArchDesc::buildFrameMethods(FILE *fp_cpp) {
   fprintf(fp_cpp,"int Matcher::inline_cache_reg_encode() {");
   fprintf(fp_cpp," return _regEncode[inline_cache_reg()]; }\n\n");
 
-  // Interpreter's Frame Pointer Register
-  fprintf(fp_cpp,"OptoReg::Name Matcher::interpreter_frame_pointer_reg() {");
-  if (_frame->_interpreter_frame_pointer_reg == nullptr)
-    fprintf(fp_cpp," return OptoReg::Bad; }\n\n");
-  else
-    fprintf(fp_cpp," return OptoReg::Name(%s_num); }\n\n",
-            _frame->_interpreter_frame_pointer_reg);
-
   // Frame Pointer definition
   /* CNC - I can not contemplate having a different frame pointer between
      Java and native code; makes my head hurt to think about it.
diff --git a/src/hotspot/share/opto/matcher.hpp b/src/hotspot/share/opto/matcher.hpp
index 9579af84f24..69e5ab354f1 100644
--- a/src/hotspot/share/opto/matcher.hpp
+++ b/src/hotspot/share/opto/matcher.hpp
@@ -221,12 +221,12 @@ public:
   // Convert a machine register to a machine register type, so-as to
   // properly match spill code.
   const int *_register_save_type;
+  #ifdef ASSERT
   // Maps from machine register to boolean; true if machine register can
   // be holding a call argument in some signature.
   static bool can_be_java_arg( int reg );
-  // Maps from machine register to boolean; true if machine register holds
-  // a spillable argument.
-  static bool is_spillable_arg( int reg );
+  #endif
+
   // Number of integer live ranges that constitute high register pressure
   static uint int_pressure_limit();
   // Number of float live ranges that constitute high register pressure
@@ -443,9 +443,6 @@ public:
   // The Method-klass-holder may be passed in the inline_cache_reg
   // and then expanded into the inline_cache_reg and a method_ptr register
 
-  // Interpreter's Frame Pointer Register
-  static OptoReg::Name  interpreter_frame_pointer_reg();
-
   // Java-Native calling convention
   // (what you use when intercalling between Java and C++ code)
 

From 996033a601bd89712a447cdbfefd854c59083edc Mon Sep 17 00:00:00 2001
From: Quan Anh Mai <qamai@openjdk.org>
Date: Mon, 9 Mar 2026 09:45:59 +0000
Subject: [PATCH 091/655] 8378625: C2: Refactor
 MemNode::detect_access_independence to a separate method

Reviewed-by: mhaessig, chagedorn, aseoane
---
 src/hotspot/share/opto/memnode.cpp | 361 +++++++++++++++--------------
 src/hotspot/share/opto/memnode.hpp |  42 ++++
 2 files changed, 233 insertions(+), 170 deletions(-)

diff --git a/src/hotspot/share/opto/memnode.cpp b/src/hotspot/share/opto/memnode.cpp
index 21ed15f9ec7..f7da9a96d34 100644
--- a/src/hotspot/share/opto/memnode.cpp
+++ b/src/hotspot/share/opto/memnode.cpp
@@ -582,7 +582,6 @@ bool MemNode::detect_ptr_independence(Node* p1, AllocateNode* a1,
   return false;
 }
 
-
 // Find an arraycopy ac that produces the memory state represented by parameter mem.
 // Return ac if
 // (a) can_see_stored_value=true  and ac must have set the value for this load or if
@@ -697,178 +696,32 @@ ArrayCopyNode* MemNode::find_array_copy_clone(Node* ld_alloc, Node* mem) const {
 // (Currently, only LoadNode::Ideal has steps (c), (d).  More later.)
 //
 Node* MemNode::find_previous_store(PhaseValues* phase) {
-  Node*         ctrl   = in(MemNode::Control);
-  Node*         adr    = in(MemNode::Address);
-  intptr_t      offset = 0;
-  Node*         base   = AddPNode::Ideal_base_and_offset(adr, phase, offset);
-  AllocateNode* alloc  = AllocateNode::Ideal_allocation(base);
+  AccessAnalyzer analyzer(phase, this);
 
-  const TypePtr* adr_type = this->adr_type();
-  if (adr_type == nullptr) {
-    // This means the access is dead
-    return phase->C->top();
-  } else if (adr_type->base() == TypePtr::AnyPtr) {
-    assert(adr_type->ptr() == TypePtr::Null, "MemNode should never access a wide memory");
-    // Give up, this will upset Compile::get_alias_index
-    return nullptr;
-  }
-
-  int alias_idx = phase->C->get_alias_index(adr_type);
-  assert(alias_idx != Compile::AliasIdxTop, "must not be a dead node");
-  assert(alias_idx != Compile::AliasIdxBot || !phase->C->do_aliasing(), "must not be a very wide access");
-
-  if (offset == Type::OffsetBot)
-    return nullptr;            // cannot unalias unless there are precise offsets
-
-  const bool adr_maybe_raw = check_if_adr_maybe_raw(adr);
-  const TypeOopPtr *addr_t = adr->bottom_type()->isa_oopptr();
-
-  intptr_t size_in_bytes = memory_size();
-
-  Node* mem = in(MemNode::Memory);   // start searching here...
-
-  int cnt = 50;             // Cycle limiter
-  for (;;) {                // While we can dance past unrelated stores...
-    if (--cnt < 0)  break;  // Caught in cycle or a complicated dance?
-
-    Node* prev = mem;
-    if (mem->is_Store()) {
-      Node* st_adr = mem->in(MemNode::Address);
-      intptr_t st_offset = 0;
-      Node* st_base = AddPNode::Ideal_base_and_offset(st_adr, phase, st_offset);
-      if (st_base == nullptr) {
-        // inscrutable pointer
-        break;
-      }
-
-      // If the bases are the same and the offsets are the same, it seems that this is the exact
-      // store we are looking for, the caller will check if the type of the store matches using
-      // MemNode::can_see_stored_value
-      if (st_base == base && st_offset == offset) {
-        return mem; // (b) found the store that this access observes
-      }
-
-      // If it is provable that the memory accessed by mem does not overlap the memory accessed by
-      // this, we may walk past mem.
-      // For raw accesses, 2 accesses are independent if they have the same base and the offsets
-      // say that they do not overlap.
-      // For heap accesses, 2 accesses are independent if either the bases are provably different
-      // at runtime or the offsets say that the accesses do not overlap.
-      if ((adr_maybe_raw || check_if_adr_maybe_raw(st_adr)) && st_base != base) {
-        // Raw accesses can only be provably independent if they have the same base
-        break;
-      }
-
-      // If the offsets say that the accesses do not overlap, then it is provable that mem and this
-      // do not overlap. For example, a LoadI from Object+8 is independent from a StoreL into
-      // Object+12, no matter what the bases are.
-      if (st_offset != offset && st_offset != Type::OffsetBot) {
-        const int MAX_STORE = MAX2(BytesPerLong, (int)MaxVectorSize);
-        assert(mem->as_Store()->memory_size() <= MAX_STORE, "");
-        if (st_offset >= offset + size_in_bytes ||
-            st_offset <= offset - MAX_STORE ||
-            st_offset <= offset - mem->as_Store()->memory_size()) {
-          // Success:  The offsets are provably independent.
-          // (You may ask, why not just test st_offset != offset and be done?
-          // The answer is that stores of different sizes can co-exist
-          // in the same sequence of RawMem effects.  We sometimes initialize
-          // a whole 'tile' of array elements with a single jint or jlong.)
-          mem = mem->in(MemNode::Memory);
-          continue; // (a) advance through the independent store
-        }
-      }
-
-      // Same base and overlapping offsets, it seems provable that the accesses overlap, give up
-      if (st_base == base) {
-        break;
-      }
-
-      // Try to prove that 2 different base nodes at compile time are different values at runtime
-      bool known_independent = false;
-      if (detect_ptr_independence(base, alloc, st_base, AllocateNode::Ideal_allocation(st_base), phase)) {
-        known_independent = true;
-      }
-
-      if (known_independent) {
-        mem = mem->in(MemNode::Memory);
-        continue; // (a) advance through the independent store
-      }
-    } else if (mem->is_Proj() && mem->in(0)->is_Initialize()) {
-      InitializeNode* st_init = mem->in(0)->as_Initialize();
-      AllocateNode*  st_alloc = st_init->allocation();
-      if (st_alloc == nullptr) {
-        break;              // something degenerated
-      }
-      bool known_identical = false;
-      bool known_independent = false;
-      if (alloc == st_alloc) {
-        known_identical = true;
-      } else if (alloc != nullptr) {
-        known_independent = true;
-      } else if (all_controls_dominate(this, st_alloc)) {
-        known_independent = true;
-      }
-
-      if (known_independent) {
-        // The bases are provably independent: Either they are
-        // manifestly distinct allocations, or else the control
-        // of this load dominates the store's allocation.
-        if (alias_idx == Compile::AliasIdxRaw) {
-          mem = st_alloc->in(TypeFunc::Memory);
-        } else {
-          mem = st_init->memory(alias_idx);
-        }
-        continue;           // (a) advance through independent store memory
-      }
-
-      // (b) at this point, if we are not looking at a store initializing
-      // the same allocation we are loading from, we lose.
-      if (known_identical) {
-        // From caller, can_see_stored_value will consult find_captured_store.
-        return mem;         // let caller handle steps (c), (d)
-      }
-
-    } else if (find_previous_arraycopy(phase, alloc, mem, false) != nullptr) {
-      if (prev != mem) {
-        // Found an arraycopy but it doesn't affect that load
-        continue;
-      }
-      // Found an arraycopy that may affect that load
-      return mem;
-    } else if (mem->is_MergeMem()) {
-      mem = mem->as_MergeMem()->memory_at(alias_idx);
-      continue;
-    } else if (addr_t != nullptr && addr_t->is_known_instance_field()) {
-      // Can't use optimize_simple_memory_chain() since it needs PhaseGVN.
-      if (mem->is_Proj() && mem->in(0)->is_Call()) {
-        // ArrayCopyNodes processed here as well.
-        CallNode *call = mem->in(0)->as_Call();
-        if (!call->may_modify(addr_t, phase)) {
-          mem = call->in(TypeFunc::Memory);
-          continue;         // (a) advance through independent call memory
-        }
-      } else if (mem->is_Proj() && mem->in(0)->is_MemBar()) {
-        ArrayCopyNode* ac = nullptr;
-        if (ArrayCopyNode::may_modify(addr_t, mem->in(0)->as_MemBar(), phase, ac)) {
-          break;
-        }
-        mem = mem->in(0)->in(TypeFunc::Memory);
-        continue;           // (a) advance through independent MemBar memory
-      } else if (mem->is_ClearArray()) {
-        if (ClearArrayNode::step_through(&mem, (uint)addr_t->instance_id(), phase)) {
-          // (the call updated 'mem' value)
-          continue;         // (a) advance through independent allocation memory
-        } else {
-          // Can not bypass initialization of the instance
-          // we are looking for.
-          return mem;
-        }
-      }
+  Node* mem = in(MemNode::Memory); // start searching here...
+  int cnt = 50;                    // Cycle limiter
+  for (;; cnt--) {
+    // While we can dance past unrelated stores...
+    if (phase->type(mem) == Type::TOP) {
+      // Encounter a dead node
+      return phase->C->top();
+    } else if (cnt <= 0) {
+      // Caught in cycle or a complicated dance?
+      return nullptr;
+    } else if (mem->is_Phi()) {
+      return nullptr;
     }
 
-    // Unless there is an explicit 'continue', we must bail out here,
-    // because 'mem' is an inscrutable memory state (e.g., a call).
-    break;
+    AccessAnalyzer::AccessIndependence independence = analyzer.detect_access_independence(mem);
+    if (independence.independent) {
+      // (a) advance through the independent store
+      mem = independence.mem;
+      assert(mem != nullptr, "must not be nullptr");
+    } else {
+      // (b) found the store that this access observes if this is not null
+      // Otherwise, give up if it is null
+      return independence.mem;
+    }
   }
 
   return nullptr;              // bail out
@@ -918,6 +771,174 @@ uint8_t MemNode::barrier_data(const Node* n) {
   return 0;
 }
 
+AccessAnalyzer::AccessAnalyzer(PhaseValues* phase, MemNode* n)
+  : _phase(phase), _n(n), _memory_size(n->memory_size()), _alias_idx(-1) {
+  Node* adr  = _n->in(MemNode::Address);
+  _offset    = 0;
+  _base      = AddPNode::Ideal_base_and_offset(adr, _phase, _offset);
+  _maybe_raw = MemNode::check_if_adr_maybe_raw(adr);
+  _alloc     = AllocateNode::Ideal_allocation(_base);
+  _adr_type = _n->adr_type();
+
+  if (_adr_type != nullptr && _adr_type->base() != TypePtr::AnyPtr) {
+    // Avoid the cases that will upset Compile::get_alias_index
+    _alias_idx = _phase->C->get_alias_index(_adr_type);
+    assert(_alias_idx != Compile::AliasIdxTop, "must not be a dead node");
+    assert(_alias_idx != Compile::AliasIdxBot || !phase->C->do_aliasing(), "must not be a very wide access");
+  }
+}
+
+// Decide whether the memory accessed by '_n' and 'other' may overlap. This function may be used
+// when we want to walk the memory graph to fold a load, or when we want to hoist a load above a
+// loop when there are no stores that may overlap with the load inside the loop.
+AccessAnalyzer::AccessIndependence AccessAnalyzer::detect_access_independence(Node* other) const {
+  assert(_phase->type(other) == Type::MEMORY, "must be a memory node %s", other->Name());
+  assert(!other->is_Phi(), "caller must handle Phi");
+
+  if (_adr_type == nullptr) {
+    // This means the access is dead
+    return {false, _phase->C->top()};
+  } else if (_adr_type->base() == TypePtr::AnyPtr) {
+    // An example for this case is an access into the memory address 0 performed using Unsafe
+    assert(_adr_type->ptr() == TypePtr::Null, "MemNode should never access a wide memory");
+    return {false, nullptr};
+  }
+
+  if (_offset == Type::OffsetBot) {
+    // cannot unalias unless there are precise offsets
+    return {false, nullptr};
+  }
+
+  const TypeOopPtr* adr_oop_type = _adr_type->isa_oopptr();
+  Node* prev = other;
+  if (other->is_Store()) {
+    Node* st_adr = other->in(MemNode::Address);
+    intptr_t st_offset = 0;
+    Node* st_base = AddPNode::Ideal_base_and_offset(st_adr, _phase, st_offset);
+    if (st_base == nullptr) {
+      // inscrutable pointer
+      return {false, nullptr};
+    }
+
+    // If the bases are the same and the offsets are the same, it seems that this is the exact
+    // store we are looking for, the caller will check if the type of the store matches using
+    // MemNode::can_see_stored_value
+    if (st_base == _base && st_offset == _offset) {
+      return {false, other};
+    }
+
+    // If it is provable that the memory accessed by 'other' does not overlap the memory accessed
+    // by '_n', we may walk past 'other'.
+    // For raw accesses, 2 accesses are independent if they have the same base and the offsets
+    // say that they do not overlap.
+    // For heap accesses, 2 accesses are independent if either the bases are provably different
+    // at runtime or the offsets say that the accesses do not overlap.
+    if ((_maybe_raw || MemNode::check_if_adr_maybe_raw(st_adr)) && st_base != _base) {
+      // Raw accesses can only be provably independent if they have the same base
+      return {false, nullptr};
+    }
+
+    // If the offsets say that the accesses do not overlap, then it is provable that 'other' and
+    // '_n' do not overlap. For example, a LoadI from Object+8 is independent from a StoreL into
+    // Object+12, no matter what the bases are.
+    if (st_offset != _offset && st_offset != Type::OffsetBot) {
+      const int MAX_STORE = MAX2(BytesPerLong, (int)MaxVectorSize);
+      assert(other->as_Store()->memory_size() <= MAX_STORE, "");
+      if (st_offset >= _offset + _memory_size ||
+          st_offset <= _offset - MAX_STORE ||
+          st_offset <= _offset - other->as_Store()->memory_size()) {
+        // Success:  The offsets are provably independent.
+        // (You may ask, why not just test st_offset != offset and be done?
+        // The answer is that stores of different sizes can co-exist
+        // in the same sequence of RawMem effects.  We sometimes initialize
+        // a whole 'tile' of array elements with a single jint or jlong.)
+        return {true, other->in(MemNode::Memory)};
+      }
+    }
+
+    // Same base and overlapping offsets, it seems provable that the accesses overlap, give up
+    if (st_base == _base) {
+      return {false, nullptr};
+    }
+
+    // Try to prove that 2 different base nodes at compile time are different values at runtime
+    bool known_independent = false;
+    if (MemNode::detect_ptr_independence(_base, _alloc, st_base, AllocateNode::Ideal_allocation(st_base), _phase)) {
+      known_independent = true;
+    }
+
+    if (known_independent) {
+      return {true, other->in(MemNode::Memory)};
+    }
+  } else if (other->is_Proj() && other->in(0)->is_Initialize()) {
+    InitializeNode* st_init = other->in(0)->as_Initialize();
+    AllocateNode* st_alloc = st_init->allocation();
+    if (st_alloc == nullptr) {
+      // Something degenerated
+      return {false, nullptr};
+    }
+    bool known_identical = false;
+    bool known_independent = false;
+    if (_alloc == st_alloc) {
+      known_identical = true;
+    } else if (_alloc != nullptr) {
+      known_independent = true;
+    } else if (MemNode::all_controls_dominate(_n, st_alloc)) {
+      known_independent = true;
+    }
+
+    if (known_independent) {
+      // The bases are provably independent: Either they are
+      // manifestly distinct allocations, or else the control
+      // of _n dominates the store's allocation.
+      if (_alias_idx == Compile::AliasIdxRaw) {
+        other = st_alloc->in(TypeFunc::Memory);
+      } else {
+        other = st_init->memory(_alias_idx);
+      }
+      return {true, other};
+    }
+
+    // If we are not looking at a store initializing the same
+    // allocation we are loading from, we lose.
+    if (known_identical) {
+      // From caller, can_see_stored_value will consult find_captured_store.
+      return {false, other};
+    }
+
+  } else if (_n->find_previous_arraycopy(_phase, _alloc, other, false) != nullptr) {
+    // Find an arraycopy that may or may not affect the MemNode
+    return {prev != other, other};
+  } else if (other->is_MergeMem()) {
+    return {true, other->as_MergeMem()->memory_at(_alias_idx)};
+  } else if (adr_oop_type != nullptr && adr_oop_type->is_known_instance_field()) {
+    // Can't use optimize_simple_memory_chain() since it needs PhaseGVN.
+    if (other->is_Proj() && other->in(0)->is_Call()) {
+      // ArrayCopyNodes processed here as well.
+      CallNode* call = other->in(0)->as_Call();
+      if (!call->may_modify(adr_oop_type, _phase)) {
+        return {true, call->in(TypeFunc::Memory)};
+      }
+    } else if (other->is_Proj() && other->in(0)->is_MemBar()) {
+      ArrayCopyNode* ac = nullptr;
+      if (!ArrayCopyNode::may_modify(adr_oop_type, other->in(0)->as_MemBar(), _phase, ac)) {
+        return {true, other->in(0)->in(TypeFunc::Memory)};
+      }
+    } else if (other->is_ClearArray()) {
+      if (ClearArrayNode::step_through(&other, (uint)adr_oop_type->instance_id(), _phase)) {
+        // (the call updated 'other' value)
+        return {true, other};
+      } else {
+        // Can not bypass initialization of the instance
+        // we are looking for.
+        return {false, other};
+      }
+    }
+  }
+
+  return {false, nullptr};
+}
+
 //=============================================================================
 // Should LoadNode::Ideal() attempt to remove control edges?
 bool LoadNode::can_remove_control() const {
diff --git a/src/hotspot/share/opto/memnode.hpp b/src/hotspot/share/opto/memnode.hpp
index 39b1ee88333..2f26c67f0a8 100644
--- a/src/hotspot/share/opto/memnode.hpp
+++ b/src/hotspot/share/opto/memnode.hpp
@@ -26,6 +26,7 @@
 #ifndef SHARE_OPTO_MEMNODE_HPP
 #define SHARE_OPTO_MEMNODE_HPP
 
+#include "memory/allocation.hpp"
 #include "opto/multnode.hpp"
 #include "opto/node.hpp"
 #include "opto/opcodes.hpp"
@@ -46,6 +47,8 @@ private:
   bool _unsafe_access;     // Access of unsafe origin.
   uint8_t _barrier_data;   // Bit field with barrier information
 
+  friend class AccessAnalyzer;
+
 protected:
 #ifdef ASSERT
   const TypePtr* _adr_type;     // What kind of memory is being addressed?
@@ -172,6 +175,45 @@ public:
 #endif
 };
 
+// Analyze a MemNode to try to prove that it is independent from other memory accesses
+class AccessAnalyzer : StackObj {
+private:
+  PhaseValues* const _phase;
+  MemNode* const _n;
+  Node* _base;
+  intptr_t _offset;
+  const int _memory_size;
+  bool _maybe_raw;
+  AllocateNode* _alloc;
+  const TypePtr* _adr_type;
+  int _alias_idx;
+
+public:
+  AccessAnalyzer(PhaseValues* phase, MemNode* n);
+
+  // The result of deciding whether a memory node 'other' writes into the memory which '_n'
+  // observes.
+  class AccessIndependence {
+  public:
+    // Whether 'other' writes into the memory which '_n' observes. This value is conservative, that
+    // is, it is only true when it is provable that the memory accessed by the nodes is
+    // non-overlapping.
+    bool independent;
+
+    // If 'independent' is true, this is the memory input of 'other' that corresponds to the memory
+    // location that '_n' observes. For example, if 'other' is a StoreNode, then 'mem' is its
+    // memory input, if 'other' is a MergeMemNode, then 'mem' is the memory input corresponding to
+    // the alias class of '_n'.
+    // If 'independent' is false,
+    // - 'mem' is non-nullptr if it seems that 'other' writes to the exact memory location '_n'
+    // observes.
+    // - 'mem' is nullptr otherwise.
+    Node* mem;
+  };
+
+  AccessIndependence detect_access_independence(Node* other) const;
+};
+
 //------------------------------LoadNode---------------------------------------
 // Load value; requires Memory and Address
 class LoadNode : public MemNode {

From f1be8208c8330c3d1ca745c92c91528ae8fa68fd Mon Sep 17 00:00:00 2001
From: Raffaello Giulietti <rgiulietti@openjdk.org>
Date: Mon, 9 Mar 2026 09:53:47 +0000
Subject: [PATCH 092/655] 8379195: Refactor Arrays TestNG tests to use JUnit

Reviewed-by: alanb
---
 .../jdk/java/util/Arrays/ArraysEqCmpTest.java | 133 ++++++++++--------
 test/jdk/java/util/Arrays/AsList.java         |  45 +++---
 test/jdk/java/util/Arrays/Correct.java        |  22 +--
 test/jdk/java/util/Arrays/SetAllTest.java     |  47 ++++---
 .../Arrays/SortingNearlySortedPrimitive.java  |  16 ++-
 .../util/Arrays/StreamAndSpliterator.java     |  17 ++-
 test/jdk/java/util/Arrays/TEST.properties     |   1 +
 .../Arrays/largeMemory/ParallelPrefix.java    |  76 +++++-----
 8 files changed, 182 insertions(+), 175 deletions(-)
 create mode 100644 test/jdk/java/util/Arrays/TEST.properties

diff --git a/test/jdk/java/util/Arrays/ArraysEqCmpTest.java b/test/jdk/java/util/Arrays/ArraysEqCmpTest.java
index a2bb9ce6a79..5e987746771 100644
--- a/test/jdk/java/util/Arrays/ArraysEqCmpTest.java
+++ b/test/jdk/java/util/Arrays/ArraysEqCmpTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2015, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2015, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,12 +25,9 @@
  * @test
  * @bug 8033148 8141409
  * @summary tests for array equals and compare
- * @run testng ArraysEqCmpTest
+ * @run junit ArraysEqCmpTest
 */
 
-import org.testng.Assert;
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
 
 import java.lang.invoke.MethodHandle;
 import java.lang.invoke.MethodHandles;
@@ -46,6 +43,13 @@ import java.util.function.BiFunction;
 import java.util.function.LongFunction;
 import java.util.stream.IntStream;
 
+import org.junit.jupiter.api.Assertions;
+import org.junit.jupiter.api.Test;
+import org.junit.jupiter.api.TestInstance;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
+
+@TestInstance(TestInstance.Lifecycle.PER_CLASS)
 public class ArraysEqCmpTest {
 
     // Maximum width in bits
@@ -588,7 +592,6 @@ public class ArraysEqCmpTest {
 
     static Object[][] arrayTypes;
 
-    @DataProvider
     public static Object[][] arrayTypesProvider() {
         if (arrayTypes == null) {
             arrayTypes = new Object[][]{
@@ -613,7 +616,6 @@ public class ArraysEqCmpTest {
 
     static Object[][] floatArrayTypes;
 
-    @DataProvider
     public static Object[][] floatArrayTypesProvider() {
         if (floatArrayTypes == null) {
             LongFunction<Object> bTof = rb -> Float.intBitsToFloat((int) rb);
@@ -629,7 +631,6 @@ public class ArraysEqCmpTest {
 
     static Object[][] objectArrayTypes;
 
-    @DataProvider
     public static Object[][] objectArrayTypesProvider() {
         if (objectArrayTypes == null) {
             LongFunction<Object> bTof = rb -> Float.intBitsToFloat((int) rb);
@@ -646,7 +647,6 @@ public class ArraysEqCmpTest {
 
     static Object[][] signedUnsignedArrayTypes;
 
-    @DataProvider
     public static Object[][] signedUnsignedArrayTypes() {
         if (signedUnsignedArrayTypes == null) {
             signedUnsignedArrayTypes = new Object[][]{
@@ -661,7 +661,8 @@ public class ArraysEqCmpTest {
 
     // Equality and comparison tests
 
-    @Test(dataProvider = "arrayTypesProvider")
+    @ParameterizedTest
+    @MethodSource("arrayTypesProvider")
     public void testArray(ArrayType<?> arrayType) {
         BiFunction<ArrayType<?>, Integer, Object> constructor = (at, s) -> {
             Object a = at.construct(s);
@@ -677,7 +678,8 @@ public class ArraysEqCmpTest {
         testArrayType(arrayType, constructor, cloner);
     }
 
-    @Test(dataProvider = "floatArrayTypesProvider")
+    @ParameterizedTest
+    @MethodSource("floatArrayTypesProvider")
     public void testPrimitiveFloatArray(
             ArrayType<?> arrayType,
             long canonicalNanRawBits, long nonCanonicalNanRawBits,
@@ -722,7 +724,8 @@ public class ArraysEqCmpTest {
         testArrayType(arrayType, canonicalNaNs, halfNonCanonicalNaNs);
     }
 
-    @Test(dataProvider = "objectArrayTypesProvider")
+    @ParameterizedTest
+    @MethodSource("objectArrayTypesProvider")
     public void testNullElementsInObjectArray(ArrayType<?> arrayType) {
         BiFunction<ArrayType<?>, Object, Object> cloner = ArrayType::copyOf;
 
@@ -752,11 +755,12 @@ public class ArraysEqCmpTest {
 
         Integer[] a = new Integer[]{null, 0};
         Integer[] b = new Integer[]{0, 0};
-        Assert.assertTrue(Arrays.compare(a, b) < 0);
-        Assert.assertTrue(Arrays.compare(b, a) > 0);
+        Assertions.assertTrue(Arrays.compare(a, b) < 0);
+        Assertions.assertTrue(Arrays.compare(b, a) > 0);
     }
 
-    @Test(dataProvider = "objectArrayTypesProvider")
+    @ParameterizedTest
+    @MethodSource("objectArrayTypesProvider")
     public void testSameRefElementsInObjectArray(ArrayType<?> arrayType) {
         BiFunction<ArrayType<?>, Object, Object> cloner = ArrayType::copyOf;
 
@@ -796,7 +800,8 @@ public class ArraysEqCmpTest {
                       cloner);
     }
 
-    @Test(dataProvider = "signedUnsignedArrayTypes")
+    @ParameterizedTest
+    @MethodSource("signedUnsignedArrayTypes")
     public void testSignedUnsignedArray(ArrayType<?> sat, ArrayType<?> uat) {
         BiFunction<ArrayType<?>, Integer, Object> constructor = (at, s) -> {
             Object a = at.construct(s);
@@ -824,8 +829,8 @@ public class ArraysEqCmpTest {
                             int sc = sat.compare(ac, aFrom, aTo, a, aFrom, aTo);
                             int uc = uat.compare(ac, aFrom, aTo, a, aFrom, aTo);
 
-                            Assert.assertTrue(sc < 0);
-                            Assert.assertTrue(uc > 0);
+                            Assertions.assertTrue(sc < 0);
+                            Assertions.assertTrue(uc > 0);
                         }
                     }
                 }
@@ -854,31 +859,31 @@ public class ArraysEqCmpTest {
                             Object bnr = at.copyOf(b, bFrom, bTo);
 
                             boolean eq = isEqual(at, a, aFrom, aTo, b, bFrom, bTo);
-                            Assert.assertEquals(at.equals(a, aFrom, aTo, b, bFrom, bTo), eq);
-                            Assert.assertEquals(at.equals(b, bFrom, bTo, a, aFrom, aTo), eq);
-                            Assert.assertEquals(at.equals(anr, bnr), eq);
-                            Assert.assertEquals(at.equals(bnr, anr), eq);
+                            Assertions.assertEquals(eq, at.equals(a, aFrom, aTo, b, bFrom, bTo));
+                            Assertions.assertEquals(eq, at.equals(b, bFrom, bTo, a, aFrom, aTo));
+                            Assertions.assertEquals(eq, at.equals(anr, bnr));
+                            Assertions.assertEquals(eq, at.equals(bnr, anr));
                             if (eq) {
-                                Assert.assertEquals(at.compare(a, aFrom, aTo, b, bFrom, bTo), 0);
-                                Assert.assertEquals(at.compare(b, bFrom, bTo, a, aFrom, aTo), 0);
-                                Assert.assertEquals(at.compare(anr, bnr), 0);
-                                Assert.assertEquals(at.compare(bnr, anr), 0);
+                                Assertions.assertEquals(0, at.compare(a, aFrom, aTo, b, bFrom, bTo));
+                                Assertions.assertEquals(0, at.compare(b, bFrom, bTo, a, aFrom, aTo));
+                                Assertions.assertEquals(0, at.compare(anr, bnr));
+                                Assertions.assertEquals(0, at.compare(bnr, anr));
 
-                                Assert.assertEquals(at.mismatch(a, aFrom, aTo, b, bFrom, bTo), -1);
-                                Assert.assertEquals(at.mismatch(b, bFrom, bTo, a, aFrom, aTo), -1);
-                                Assert.assertEquals(at.mismatch(anr, bnr), -1);
-                                Assert.assertEquals(at.mismatch(bnr, anr), -1);
+                                Assertions.assertEquals(-1, at.mismatch(a, aFrom, aTo, b, bFrom, bTo));
+                                Assertions.assertEquals(-1, at.mismatch(b, bFrom, bTo, a, aFrom, aTo));
+                                Assertions.assertEquals(-1, at.mismatch(anr, bnr));
+                                Assertions.assertEquals(-1, at.mismatch(bnr, anr));
                             }
                             else {
                                 int aCb = at.compare(a, aFrom, aTo, b, bFrom, bTo);
                                 int bCa = at.compare(b, bFrom, bTo, a, aFrom, aTo);
                                 int v = Integer.signum(aCb) * Integer.signum(bCa);
-                                Assert.assertTrue(v == -1);
+                                Assertions.assertTrue(v == -1);
 
                                 int anrCbnr = at.compare(anr, bnr);
                                 int bnrCanr = at.compare(bnr, anr);
-                                Assert.assertEquals(anrCbnr, aCb);
-                                Assert.assertEquals(bnrCanr, bCa);
+                                Assertions.assertEquals(aCb, anrCbnr);
+                                Assertions.assertEquals(bCa, bnrCanr);
 
 
                                 int aMb = at.mismatch(a, aFrom, aTo, b, bFrom, bTo);
@@ -886,18 +891,18 @@ public class ArraysEqCmpTest {
                                 int anrMbnr = at.mismatch(anr, bnr);
                                 int bnrManr = at.mismatch(bnr, anr);
 
-                                Assert.assertNotEquals(aMb, -1);
-                                Assert.assertEquals(aMb, bMa);
-                                Assert.assertNotEquals(anrMbnr, -1);
-                                Assert.assertEquals(anrMbnr, bnrManr);
-                                Assert.assertEquals(aMb, anrMbnr);
-                                Assert.assertEquals(bMa, bnrManr);
+                                Assertions.assertNotEquals(-1, aMb);
+                                Assertions.assertEquals(bMa, aMb);
+                                Assertions.assertNotEquals(-1, anrMbnr);
+                                Assertions.assertEquals(bnrManr, anrMbnr);
+                                Assertions.assertEquals(anrMbnr, aMb);
+                                Assertions.assertEquals(bnrManr, bMa);
 
                                 // Common or proper prefix
-                                Assert.assertTrue(at.equals(a, aFrom, aFrom + aMb, b, bFrom, bFrom + aMb));
+                                Assertions.assertTrue(at.equals(a, aFrom, aFrom + aMb, b, bFrom, bFrom + aMb));
                                 if (aMb < Math.min(aLength, bLength)) {
                                     // Common prefix
-                                    Assert.assertFalse(isEqual(at, a, aFrom + aMb, b, bFrom + aMb));
+                                    Assertions.assertFalse(isEqual(at, a, aFrom + aMb, b, bFrom + aMb));
                                 }
                             }
                         }
@@ -912,29 +917,29 @@ public class ArraysEqCmpTest {
                             Object acnr = at.copyOf(ac, aFrom, aTo);
                             Object anr = at.copyOf(a, aFrom, aTo);
 
-                            Assert.assertFalse(at.equals(ac, aFrom, aTo, a, aFrom, aTo));
-                            Assert.assertFalse(at.equals(acnr, anr));
+                            Assertions.assertFalse(at.equals(ac, aFrom, aTo, a, aFrom, aTo));
+                            Assertions.assertFalse(at.equals(acnr, anr));
 
                             int acCa = at.compare(ac, aFrom, aTo, a, aFrom, aTo);
                             int aCac = at.compare(a, aFrom, aTo, ac, aFrom, aTo);
                             int v = Integer.signum(acCa) * Integer.signum(aCac);
-                            Assert.assertTrue(v == -1);
+                            Assertions.assertTrue(v == -1);
 
                             int acnrCanr = at.compare(acnr, anr);
                             int anrCacnr = at.compare(anr, acnr);
-                            Assert.assertEquals(acnrCanr, acCa);
-                            Assert.assertEquals(anrCacnr, aCac);
+                            Assertions.assertEquals(acCa, acnrCanr);
+                            Assertions.assertEquals(aCac, anrCacnr);
 
 
                             int acMa = at.mismatch(ac, aFrom, aTo, a, aFrom, aTo);
                             int aMac = at.mismatch(a, aFrom, aTo, ac, aFrom, aTo);
-                            Assert.assertEquals(acMa, aMac);
-                            Assert.assertEquals(acMa, i - aFrom);
+                            Assertions.assertEquals(aMac, acMa);
+                            Assertions.assertEquals(i - aFrom, acMa);
 
                             int acnrManr = at.mismatch(acnr, anr);
                             int anrMacnr = at.mismatch(anr, acnr);
-                            Assert.assertEquals(acnrManr, anrMacnr);
-                            Assert.assertEquals(acnrManr, i - aFrom);
+                            Assertions.assertEquals(anrMacnr, acnrManr);
+                            Assertions.assertEquals(i - aFrom, acnrManr);
                         }
                     }
                 }
@@ -986,24 +991,26 @@ public class ArraysEqCmpTest {
 
     // Null array reference tests
 
-    @Test(dataProvider = "arrayTypesProvider")
+    @ParameterizedTest
+    @MethodSource("arrayTypesProvider")
     public void testNullArrayRefs(ArrayType<?> arrayType) {
         Object n = null;
         Object a = arrayType.construct(0);
 
-        Assert.assertTrue(arrayType.equals(n, n));
-        Assert.assertFalse(arrayType.equals(n, a));
-        Assert.assertFalse(arrayType.equals(a, n));
+        Assertions.assertTrue(arrayType.equals(n, n));
+        Assertions.assertFalse(arrayType.equals(n, a));
+        Assertions.assertFalse(arrayType.equals(a, n));
 
-        Assert.assertEquals(arrayType.compare(n, n), 0);
-        Assert.assertTrue(arrayType.compare(n, a) < 0);
-        Assert.assertTrue(arrayType.compare(a, n) > 0);
+        Assertions.assertEquals(0, arrayType.compare(n, n));
+        Assertions.assertTrue(arrayType.compare(n, a) < 0);
+        Assertions.assertTrue(arrayType.compare(a, n) > 0);
     }
 
 
     // Exception throwing tests
 
-    @Test(dataProvider = "arrayTypesProvider")
+    @ParameterizedTest
+    @MethodSource("arrayTypesProvider")
     public void testNPEs(ArrayType<?> arrayType) {
         Object[] values = new Object[]{null, arrayType.construct(0)};
 
@@ -1046,7 +1053,8 @@ public class ArraysEqCmpTest {
         }
     }
 
-    @Test(dataProvider = "arrayTypesProvider")
+    @ParameterizedTest
+    @MethodSource("arrayTypesProvider")
     public void testIAEs(ArrayType<?> arrayType) {
         List<Integer> values = Arrays.asList(0, 1);
 
@@ -1065,7 +1073,8 @@ public class ArraysEqCmpTest {
         }
     }
 
-    @Test(dataProvider = "arrayTypesProvider")
+    @ParameterizedTest
+    @MethodSource("arrayTypesProvider")
     public void testAIOBEs(ArrayType<?> arrayType) {
         List<Integer> froms = Arrays.asList(-1, 0);
 
@@ -1110,7 +1119,7 @@ public class ArraysEqCmpTest {
         catch (Throwable t) {
             caught = t;
         }
-        Assert.assertNotNull(caught);
-        Assert.assertTrue(expected.isInstance(caught));
+        Assertions.assertNotNull(caught);
+        Assertions.assertTrue(expected.isInstance(caught));
     }
 }
\ No newline at end of file
diff --git a/test/jdk/java/util/Arrays/AsList.java b/test/jdk/java/util/Arrays/AsList.java
index c64c473a822..b02f1dcbe68 100644
--- a/test/jdk/java/util/Arrays/AsList.java
+++ b/test/jdk/java/util/Arrays/AsList.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2016, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2016, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -21,11 +21,11 @@
  * questions.
  */
 
-/**
+/*
  * @test
  * @bug 8155600
  * @summary Tests for Arrays.asList()
- * @run testng AsList
+ * @run junit AsList
  */
 
 import java.util.Arrays;
@@ -33,46 +33,35 @@ import java.util.Iterator;
 import java.util.NoSuchElementException;
 import java.util.stream.IntStream;
 
-import org.testng.annotations.Test;
-import org.testng.annotations.DataProvider;
-import static org.testng.Assert.assertSame;
-import static org.testng.Assert.assertTrue;
-import static org.testng.Assert.assertFalse;
-import static org.testng.Assert.fail;
+import org.junit.jupiter.api.TestInstance;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
 
+import static org.junit.jupiter.api.Assertions.*;
+
+@TestInstance(TestInstance.Lifecycle.PER_CLASS)
 public class AsList {
     /*
      * Iterator contract test
      */
-    @Test(dataProvider = "Arrays")
+    @ParameterizedTest
+    @MethodSource("arrays")
     public void testIterator(Object[] array) {
         Iterator<Object> itr = Arrays.asList(array).iterator();
-        for (int i = 0; i < array.length; i++) {
+        for (Object o : array) {
             assertTrue(itr.hasNext());
             assertTrue(itr.hasNext()); // must be idempotent
-            assertSame(array[i], itr.next());
-            try {
-                itr.remove();
-                fail("Remove must throw");
-            } catch (UnsupportedOperationException ex) {
-                // expected
-            }
+            assertSame(o, itr.next());
+            assertThrows(UnsupportedOperationException.class, itr::remove);
         }
-        assertFalse(itr.hasNext());
         for (int i = 0; i < 3; i++) {
             assertFalse(itr.hasNext());
-            try {
-                itr.next();
-                fail("Next succeed when there's no data left");
-            } catch (NoSuchElementException ex) {
-                // expected
-            }
+            assertThrows(NoSuchElementException.class, itr::next);
         }
     }
 
-    @DataProvider(name = "Arrays")
     public static Object[][] arrays() {
-        Object[][] arrays = {
+        return new Object[][] {
             { new Object[] { } },
             { new Object[] { 1 } },
             { new Object[] { null } },
@@ -87,7 +76,5 @@ public class AsList {
             { new Object[] { "a", "a", "a", "a" } },
             { IntStream.range(0, 100).boxed().toArray() }
         };
-
-        return arrays;
     }
 }
diff --git a/test/jdk/java/util/Arrays/Correct.java b/test/jdk/java/util/Arrays/Correct.java
index f69ea9160ff..dce169bb0fc 100644
--- a/test/jdk/java/util/Arrays/Correct.java
+++ b/test/jdk/java/util/Arrays/Correct.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2002, 2014, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2002, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,17 +25,19 @@
  * @test
  * @bug 4726380 8037097
  * @summary Check that different sorts give equivalent results.
- * @run testng Correct
  * @key randomness
+ * @run junit Correct
  */
 
 import java.util.*;
 
-import org.testng.annotations.Test;
-import org.testng.annotations.DataProvider;
-import static org.testng.Assert.fail;
-import static org.testng.Assert.assertEquals;
+import org.junit.jupiter.api.Assertions;
+import org.junit.jupiter.api.Test;
+import org.junit.jupiter.api.TestInstance;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
 
+@TestInstance(TestInstance.Lifecycle.PER_CLASS)
 public class Correct {
 
     static final Random rnd = new Random();
@@ -50,11 +52,12 @@ public class Correct {
             Integer[] array2 = Arrays.copyOf(array1, array1.length);
             Arrays.sort(array1, array1.length/3, array1.length/2);
             stupidSort(array2, array2.length/3, array2.length/2);
-            assertEquals(array1, array2, "Arrays did not match. size=" + size);
+            Assertions.assertArrayEquals(array2, array1, "Arrays did not match. size=" + size);
         }
     }
 
-    @Test(dataProvider = "Comparators")
+    @ParameterizedTest
+    @MethodSource("comparators")
     public void testComparatorSort(Comparator<Integer> comparator) {
         for (int i=0; i<ITERATIONS; i++) {
             int size = rnd.nextInt(TEST_SIZE) + 1;
@@ -62,7 +65,7 @@ public class Correct {
             Integer[] array2 = Arrays.copyOf(array1, array1.length);
             Arrays.sort(array1, array1.length/3, array1.length/2, comparator);
             stupidSort(array2, array2.length/3, array2.length/2, comparator);
-            assertEquals(array1, array2, "Arrays did not match. size=" + size);
+            Assertions.assertArrayEquals(array2, array1, "Arrays did not match. size=" + size);
         }
     }
 
@@ -118,7 +121,6 @@ public class Correct {
         x[b] = t;
     }
 
-    @DataProvider(name = "Comparators", parallel = true)
     public static Iterator<Object[]> comparators() {
         Object[][] comparators = new Object[][] {
             new Object[] { Comparator.naturalOrder() },
diff --git a/test/jdk/java/util/Arrays/SetAllTest.java b/test/jdk/java/util/Arrays/SetAllTest.java
index 23a3578cf69..25a229d23d4 100644
--- a/test/jdk/java/util/Arrays/SetAllTest.java
+++ b/test/jdk/java/util/Arrays/SetAllTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2013, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2013, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,11 +25,9 @@
  * @test
  * @bug 8012650
  * @summary Unit test for setAll, parallelSetAll variants
- * @run testng SetAllTest
+ * @run junit SetAllTest
  */
 
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
 
 import java.util.Arrays;
 import java.util.function.IntFunction;
@@ -37,12 +35,15 @@ import java.util.function.IntToDoubleFunction;
 import java.util.function.IntToLongFunction;
 import java.util.function.IntUnaryOperator;
 
-import static org.testng.Assert.assertEquals;
-import static org.testng.Assert.assertTrue;
-import static org.testng.Assert.assertSame;
-import static org.testng.Assert.fail;
+import org.junit.jupiter.api.Assertions;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.fail;
+import org.junit.jupiter.api.Test;
+import org.junit.jupiter.api.TestInstance;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
 
-@Test
+@TestInstance(TestInstance.Lifecycle.PER_CLASS)
 public class SetAllTest {
     private static final IntFunction<String> toString = i -> "N" + Integer.valueOf(i);
     private static final IntFunction<String> fillString = i -> "X";
@@ -93,52 +94,51 @@ public class SetAllTest {
         { "fill", 3, fillDouble, new double[] { 3.14, 3.14, 3.14 }}
     };
 
-    @DataProvider(name="string")
     public Object[][] stringTests() { return stringData; }
 
-    @DataProvider(name="int")
     public Object[][] intTests() { return intData; }
 
-    @DataProvider(name="long")
     public Object[][] longTests() { return longData; }
 
-    @DataProvider(name="double")
     public Object[][] doubleTests() { return doubleData; }
 
-    @Test(dataProvider = "string")
+    @ParameterizedTest
+    @MethodSource("stringTests")
     public void testSetAllString(String name, int size, IntFunction<String> generator, String[] expected) {
         String[] result = new String[size];
         Arrays.setAll(result, generator);
-        assertEquals(result, expected, "setAll(String[], IntFunction<String>) case " + name + " failed.");
+        Assertions.assertArrayEquals(expected, result, "setAll(String[], IntFunction<String>) case " + name + " failed.");
 
         // ensure fresh array
         result = new String[size];
         Arrays.parallelSetAll(result, generator);
-        assertEquals(result, expected, "parallelSetAll(String[], IntFunction<String>) case " + name + " failed.");
+        Assertions.assertArrayEquals(expected, result, "parallelSetAll(String[], IntFunction<String>) case " + name + " failed.");
     }
 
-    @Test(dataProvider = "int")
+    @ParameterizedTest
+    @MethodSource("intTests")
     public void testSetAllInt(String name, int size, IntUnaryOperator generator, int[] expected) {
         int[] result = new int[size];
         Arrays.setAll(result, generator);
-        assertEquals(result, expected, "setAll(int[], IntUnaryOperator) case " + name + " failed.");
+        Assertions.assertArrayEquals(expected, result, "setAll(int[], IntUnaryOperator) case " + name + " failed.");
 
         // ensure fresh array
         result = new int[size];
         Arrays.parallelSetAll(result, generator);
-        assertEquals(result, expected, "parallelSetAll(int[], IntUnaryOperator) case " + name + " failed.");
+        Assertions.assertArrayEquals(expected, result, "parallelSetAll(int[], IntUnaryOperator) case " + name + " failed.");
     }
 
-    @Test(dataProvider = "long")
+    @ParameterizedTest
+    @MethodSource("longTests")
     public void testSetAllLong(String name, int size, IntToLongFunction generator, long[] expected) {
         long[] result = new long[size];
         Arrays.setAll(result, generator);
-        assertEquals(result, expected, "setAll(long[], IntToLongFunction) case " + name + " failed.");
+        Assertions.assertArrayEquals(expected, result, "setAll(long[], IntToLongFunction) case " + name + " failed.");
 
         // ensure fresh array
         result = new long[size];
         Arrays.parallelSetAll(result, generator);
-        assertEquals(result, expected, "parallelSetAll(long[], IntToLongFunction) case " + name + " failed.");
+        Assertions.assertArrayEquals(expected, result, "parallelSetAll(long[], IntToLongFunction) case " + name + " failed.");
     }
 
     private void assertDoubleArrayEquals(double[] actual, double[] expected, double delta, String msg) {
@@ -151,7 +151,8 @@ public class SetAllTest {
         }
     }
 
-    @Test(dataProvider = "double")
+    @ParameterizedTest
+    @MethodSource("doubleTests")
     public void testSetAllDouble(String name, int size, IntToDoubleFunction generator, double[] expected) {
         double[] result = new double[size];
         Arrays.setAll(result, generator);
diff --git a/test/jdk/java/util/Arrays/SortingNearlySortedPrimitive.java b/test/jdk/java/util/Arrays/SortingNearlySortedPrimitive.java
index b2c8d6ec45b..b9ad458688e 100644
--- a/test/jdk/java/util/Arrays/SortingNearlySortedPrimitive.java
+++ b/test/jdk/java/util/Arrays/SortingNearlySortedPrimitive.java
@@ -1,6 +1,6 @@
 /*
  * Copyright 2015 Goldman Sachs.
- * Copyright (c) 2015, 2016, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2015, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -30,11 +30,9 @@
  *          sorted and if so employs and optimizes merge sort rather than a
  *          Dual-Pivot QuickSort.
  *
- * @run testng SortingNearlySortedPrimitive
+ * @run junit SortingNearlySortedPrimitive
  */
 
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
 
 import java.util.ArrayList;
 import java.util.Arrays;
@@ -44,6 +42,12 @@ import java.util.function.IntFunction;
 import java.util.stream.IntStream;
 import java.util.stream.Stream;
 
+import org.junit.jupiter.api.Test;
+import org.junit.jupiter.api.TestInstance;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
+
+@TestInstance(TestInstance.Lifecycle.PER_CLASS)
 public class SortingNearlySortedPrimitive {
 
     static final int BASE = 3;
@@ -112,7 +116,6 @@ public class SortingNearlySortedPrimitive {
     }
 
 
-    @DataProvider(name = "shapes")
     public Object[][] createShapes() {
         Stream<List<Object>> baseCases = Stream.of(
                 List.of("hiZeroLowTest", (IntFunction<int[]>) this::hiZeroLowData),
@@ -141,7 +144,8 @@ public class SortingNearlySortedPrimitive {
         return nl.toArray();
     }
 
-    @Test(dataProvider = "shapes")
+    @ParameterizedTest
+    @MethodSource("createShapes")
     public void testShapes(String testName, IntFunction<int[]> dataMethod, int size) {
         int[] intSourceArray = dataMethod.apply(size);
 
diff --git a/test/jdk/java/util/Arrays/StreamAndSpliterator.java b/test/jdk/java/util/Arrays/StreamAndSpliterator.java
index c28b7c4d588..eaf0b02f369 100644
--- a/test/jdk/java/util/Arrays/StreamAndSpliterator.java
+++ b/test/jdk/java/util/Arrays/StreamAndSpliterator.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2014, 2017, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2014, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -21,21 +21,20 @@
  * questions.
  */
 
-/**
+/*
  * @test
  * @bug 8037857
  * @summary tests for stream and spliterator factory methods
- * @run testng StreamAndSpliterator
+ * @run junit StreamAndSpliterator
  */
 
-import org.testng.annotations.Test;
 
 import java.util.Arrays;
 import java.util.Spliterators;
 
-import org.testng.Assert.ThrowingRunnable;
-
-import static org.testng.Assert.assertThrows;
+import static org.junit.jupiter.api.Assertions.assertThrows;
+import org.junit.jupiter.api.Test;
+import org.junit.jupiter.api.function.Executable;
 
 public class StreamAndSpliterator {
     @Test
@@ -127,11 +126,11 @@ public class StreamAndSpliterator {
         assertThrowsAIOOB(() -> Spliterators.spliterator(new String[]{}, 0, 1, 0));
     }
 
-    void assertThrowsNPE(ThrowingRunnable r) {
+    void assertThrowsNPE(Executable r) {
         assertThrows(NullPointerException.class, r);
     }
 
-    void assertThrowsAIOOB(ThrowingRunnable r) {
+    void assertThrowsAIOOB(Executable r) {
         assertThrows(ArrayIndexOutOfBoundsException.class, r);
     }
 }
diff --git a/test/jdk/java/util/Arrays/TEST.properties b/test/jdk/java/util/Arrays/TEST.properties
new file mode 100644
index 00000000000..8e0b6e58824
--- /dev/null
+++ b/test/jdk/java/util/Arrays/TEST.properties
@@ -0,0 +1 @@
+disallowedActions=testng
diff --git a/test/jdk/java/util/Arrays/largeMemory/ParallelPrefix.java b/test/jdk/java/util/Arrays/largeMemory/ParallelPrefix.java
index 41bff170259..8ebf5453187 100644
--- a/test/jdk/java/util/Arrays/largeMemory/ParallelPrefix.java
+++ b/test/jdk/java/util/Arrays/largeMemory/ParallelPrefix.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2013, 2017, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2013, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -21,13 +21,12 @@
  * questions.
  */
 
-/**
+/*
  * @test
  * @bug 8014076 8025067
  * @summary unit test for Arrays.ParallelPrefix().
- * @author Tristan Yan
  * @modules java.management jdk.management
- * @run testng/othervm -Xms256m -Xmx1024m ParallelPrefix
+ * @run junit/othervm -Xms256m -Xmx1024m ParallelPrefix
  */
 
 import java.lang.management.ManagementFactory;
@@ -40,11 +39,16 @@ import java.util.function.LongBinaryOperator;
 import java.util.stream.IntStream;
 import java.util.stream.LongStream;
 import com.sun.management.OperatingSystemMXBean;
-import static org.testng.Assert.*;
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
-import org.testng.annotations.BeforeSuite;
 
+import static org.junit.jupiter.api.Assertions.*;
+import org.junit.jupiter.api.BeforeAll;
+import org.junit.jupiter.api.Test;
+import org.junit.jupiter.api.TestInstance;
+import org.junit.jupiter.api.function.Executable;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
+
+@TestInstance(TestInstance.Lifecycle.PER_CLASS)
 public class ParallelPrefix {
     //Array size less than MIN_PARTITION
     private static final int SMALL_ARRAY_SIZE = 1 << 3;
@@ -60,7 +64,7 @@ public class ParallelPrefix {
 
     private static int[] arraySizeCollection;
 
-    @BeforeSuite
+    @BeforeAll
     public static void setup() {
         java.lang.management.OperatingSystemMXBean bean =
                 ManagementFactory.getOperatingSystemMXBean();
@@ -90,7 +94,6 @@ public class ParallelPrefix {
         System.out.println("System memory is not large enough, remove large array size test");
     }
 
-    @DataProvider(name = "intSet")
     public static Object[][] intSet(){
         return genericData(size -> IntStream.range(0, size).toArray(),
                 new IntBinaryOperator[]{
@@ -98,7 +101,6 @@ public class ParallelPrefix {
                     Integer::min});
     }
 
-    @DataProvider(name = "longSet")
     public static Object[][] longSet(){
         return genericData(size -> LongStream.range(0, size).toArray(),
                 new LongBinaryOperator[]{
@@ -106,7 +108,6 @@ public class ParallelPrefix {
                     Long::min});
     }
 
-    @DataProvider(name = "doubleSet")
     public static Object[][] doubleSet(){
         return genericData(size -> IntStream.range(0, size).mapToDouble(i -> (double)i).toArray(),
                 new DoubleBinaryOperator[]{
@@ -114,7 +115,6 @@ public class ParallelPrefix {
                     Double::min});
     }
 
-    @DataProvider(name = "stringSet")
     public static Object[][] stringSet(){
         Function<Integer, String[]> stringsFunc = size ->
                 IntStream.range(0, size).mapToObj(Integer::toString).toArray(String[]::new);
@@ -142,7 +142,8 @@ public class ParallelPrefix {
         return data;
     }
 
-    @Test(dataProvider="intSet")
+    @ParameterizedTest
+    @MethodSource("intSet")
     public void testParallelPrefixForInt(int[] data, int fromIndex, int toIndex, IntBinaryOperator op) {
         int[] sequentialResult = data.clone();
         for (int index = fromIndex + 1; index < toIndex; index++) {
@@ -151,14 +152,15 @@ public class ParallelPrefix {
 
         int[] parallelResult = data.clone();
         Arrays.parallelPrefix(parallelResult, fromIndex, toIndex, op);
-        assertArraysEqual(parallelResult, sequentialResult);
+        assertArraysEqual(sequentialResult, parallelResult);
 
         int[] parallelRangeResult = Arrays.copyOfRange(data, fromIndex, toIndex);
         Arrays.parallelPrefix(parallelRangeResult, op);
-        assertArraysEqual(parallelRangeResult, Arrays.copyOfRange(sequentialResult, fromIndex, toIndex));
+        assertArraysEqual(Arrays.copyOfRange(sequentialResult, fromIndex, toIndex), parallelRangeResult);
     }
 
-    @Test(dataProvider="longSet")
+    @ParameterizedTest
+    @MethodSource("longSet")
     public void testParallelPrefixForLong(long[] data, int fromIndex, int toIndex, LongBinaryOperator op) {
         long[] sequentialResult = data.clone();
         for (int index = fromIndex + 1; index < toIndex; index++) {
@@ -167,14 +169,15 @@ public class ParallelPrefix {
 
         long[] parallelResult = data.clone();
         Arrays.parallelPrefix(parallelResult, fromIndex, toIndex, op);
-        assertArraysEqual(parallelResult, sequentialResult);
+        assertArraysEqual(sequentialResult, parallelResult);
 
         long[] parallelRangeResult = Arrays.copyOfRange(data, fromIndex, toIndex);
         Arrays.parallelPrefix(parallelRangeResult, op);
-        assertArraysEqual(parallelRangeResult, Arrays.copyOfRange(sequentialResult, fromIndex, toIndex));
+        assertArraysEqual(Arrays.copyOfRange(sequentialResult, fromIndex, toIndex), parallelRangeResult);
     }
 
-    @Test(dataProvider="doubleSet")
+    @ParameterizedTest
+    @MethodSource("doubleSet")
     public void testParallelPrefixForDouble(double[] data, int fromIndex, int toIndex, DoubleBinaryOperator op) {
         double[] sequentialResult = data.clone();
         for (int index = fromIndex + 1; index < toIndex; index++) {
@@ -183,14 +186,15 @@ public class ParallelPrefix {
 
         double[] parallelResult = data.clone();
         Arrays.parallelPrefix(parallelResult, fromIndex, toIndex, op);
-        assertArraysEqual(parallelResult, sequentialResult);
+        assertArraysEqual(sequentialResult, parallelResult);
 
         double[] parallelRangeResult = Arrays.copyOfRange(data, fromIndex, toIndex);
         Arrays.parallelPrefix(parallelRangeResult, op);
-        assertArraysEqual(parallelRangeResult, Arrays.copyOfRange(sequentialResult, fromIndex, toIndex));
+        assertArraysEqual(Arrays.copyOfRange(sequentialResult, fromIndex, toIndex), parallelRangeResult);
     }
 
-    @Test(dataProvider="stringSet")
+    @ParameterizedTest
+    @MethodSource("stringSet")
     public void testParallelPrefixForStringr(String[] data , int fromIndex, int toIndex, BinaryOperator<String> op) {
         String[] sequentialResult = data.clone();
         for (int index = fromIndex + 1; index < toIndex; index++) {
@@ -199,11 +203,11 @@ public class ParallelPrefix {
 
         String[] parallelResult = data.clone();
         Arrays.parallelPrefix(parallelResult, fromIndex, toIndex, op);
-        assertArraysEqual(parallelResult, sequentialResult);
+        assertArraysEqual(sequentialResult, parallelResult);
 
         String[] parallelRangeResult = Arrays.copyOfRange(data, fromIndex, toIndex);
         Arrays.parallelPrefix(parallelRangeResult, op);
-        assertArraysEqual(parallelRangeResult, Arrays.copyOfRange(sequentialResult, fromIndex, toIndex));
+        assertArraysEqual(Arrays.copyOfRange(sequentialResult, fromIndex, toIndex), parallelRangeResult);
     }
 
     @Test
@@ -258,48 +262,48 @@ public class ParallelPrefix {
 
     // "library" code
 
-    private void assertThrowsNPE(ThrowingRunnable r) {
+    private void assertThrowsNPE(Executable r) {
         assertThrows(NullPointerException.class, r);
     }
 
-    private void assertThrowsIAE(ThrowingRunnable r) {
+    private void assertThrowsIAE(Executable r) {
         assertThrows(IllegalArgumentException.class, r);
     }
 
-    private void assertThrowsAIOOB(ThrowingRunnable r) {
+    private void assertThrowsAIOOB(Executable r) {
         assertThrows(ArrayIndexOutOfBoundsException.class, r);
     }
 
-    static void assertArraysEqual(int[] actual, int[] expected) {
+    static void assertArraysEqual(int[] expected, int[] actual) {
         try {
-            assertEquals(actual, expected, "");
+            assertArrayEquals(expected, actual, "");
         } catch (AssertionError x) {
             throw new AssertionError(String.format("Expected:%s, actual:%s",
                     Arrays.toString(expected), Arrays.toString(actual)), x);
         }
     }
 
-    static void assertArraysEqual(long[] actual, long[] expected) {
+    static void assertArraysEqual(long[] expected, long[] actual) {
         try {
-            assertEquals(actual, expected, "");
+            assertArrayEquals(expected, actual, "");
         } catch (AssertionError x) {
             throw new AssertionError(String.format("Expected:%s, actual:%s",
                     Arrays.toString(expected), Arrays.toString(actual)), x);
         }
     }
 
-    static void assertArraysEqual(double[] actual, double[] expected) {
+    static void assertArraysEqual(double[] expected, double[] actual) {
         try {
-            assertEquals(actual, expected, "");
+            assertArrayEquals(expected, actual, "");
         } catch (AssertionError x) {
             throw new AssertionError(String.format("Expected:%s, actual:%s",
                     Arrays.toString(expected), Arrays.toString(actual)), x);
         }
     }
 
-    static void assertArraysEqual(String[] actual, String[] expected) {
+    static void assertArraysEqual(String[] expected, String[] actual) {
         try {
-            assertEquals(actual, expected, "");
+            assertArrayEquals(expected, actual, "");
         } catch (AssertionError x) {
             throw new AssertionError(String.format("Expected:%s, actual:%s",
                     Arrays.toString(expected), Arrays.toString(actual)), x);

From 23adf6adf09551e3d28b3db408ad2c78a79531f3 Mon Sep 17 00:00:00 2001
From: Daniel Fuchs <dfuchs@openjdk.org>
Date: Mon, 9 Mar 2026 10:25:49 +0000
Subject: [PATCH 093/655] 8378569: Refactor
 test/jdk/java/net/httpclient/http3/H3ErrorHandlingTest.java to use JUnit

Reviewed-by: jpai, djelinski
---
 test/jdk/java/net/httpclient/TEST.properties  |   4 +
 .../httpclient/http3/H3ErrorHandlingTest.java | 189 +++++++++---------
 .../http3/H3MalformedResponseTest.java        |   4 +-
 .../http3/H3MemoryHandlingTest.java           |   4 +-
 .../test/lib/quic/QuicServerHandler.java      |   4 +-
 .../test/lib/quic/QuicStandaloneServer.java   |   4 +-
 .../net/httpclient/quic/KeyUpdateTest.java    |   2 +-
 .../net/httpclient/quic/PacketLossTest.java   |   4 +-
 .../quic/QuicRequestResponseTest.java         |   2 +-
 .../quic/StatelessResetReceiptTest.java       |   8 +-
 .../quic/VersionNegotiationTest.java          |   2 +-
 11 files changed, 121 insertions(+), 106 deletions(-)

diff --git a/test/jdk/java/net/httpclient/TEST.properties b/test/jdk/java/net/httpclient/TEST.properties
index b79f7113952..77705d2f4f1 100644
--- a/test/jdk/java/net/httpclient/TEST.properties
+++ b/test/jdk/java/net/httpclient/TEST.properties
@@ -20,3 +20,7 @@ modules=java.base/jdk.internal.util \
         java.security.jgss \
         java.logging \
         jdk.httpserver
+
+# Prevent TestNG-based tests
+disallowedActions=testng
+
diff --git a/test/jdk/java/net/httpclient/http3/H3ErrorHandlingTest.java b/test/jdk/java/net/httpclient/http3/H3ErrorHandlingTest.java
index 44071ea566d..8dfef7417e3 100644
--- a/test/jdk/java/net/httpclient/http3/H3ErrorHandlingTest.java
+++ b/test/jdk/java/net/httpclient/http3/H3ErrorHandlingTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2024, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2024, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -35,13 +35,6 @@ import jdk.internal.net.quic.QuicVersion;
 import jdk.test.lib.net.SimpleSSLContext;
 import jdk.test.lib.net.URIBuilder;
 import jdk.test.lib.Utils;
-import org.testng.IRetryAnalyzer;
-import org.testng.ITestResult;
-import org.testng.annotations.AfterClass;
-import org.testng.annotations.BeforeClass;
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Ignore;
-import org.testng.annotations.Test;
 
 import javax.net.ssl.SSLContext;
 import java.io.IOException;
@@ -67,7 +60,14 @@ import java.util.concurrent.TimeUnit;
 import static java.net.http.HttpClient.Version.HTTP_3;
 import static java.net.http.HttpOption.Http3DiscoveryMode.HTTP_3_URI_ONLY;
 import static java.net.http.HttpOption.H3_DISCOVERY;
-import static org.testng.Assert.*;
+
+import org.junit.jupiter.api.AfterAll;
+import org.junit.jupiter.api.BeforeAll;
+import org.junit.jupiter.api.Disabled;
+import org.junit.jupiter.api.Test;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
+import static org.junit.jupiter.api.Assertions.*;
 
 /*
  * @test
@@ -82,17 +82,16 @@ import static org.testng.Assert.*;
  * @build jdk.test.lib.net.SimpleSSLContext
  *        jdk.httpclient.test.lib.common.HttpServerAdapters
  * @build java.net.http/jdk.internal.net.http.Http3ConnectionAccess
- * @run testng/othervm
+ * @run junit/othervm
  *              -Djdk.internal.httpclient.debug=true
  *              -Djdk.httpclient.HttpClient.log=requests,responses,errors H3ErrorHandlingTest
  */
 public class H3ErrorHandlingTest implements HttpServerAdapters {
 
     private static final SSLContext sslContext = SimpleSSLContext.findSSLContext();
-    private QuicStandaloneServer server;
-    private String requestURIBase;
+    private static QuicStandaloneServer server;
+    private static String requestURIBase;
 
-    @DataProvider
     public static Object[][] controlStreams() {
         // control / encoder / decoder
         return new Object[][] {{(byte)0}, {(byte)2}, {(byte)3}};
@@ -148,26 +147,22 @@ public class H3ErrorHandlingTest implements HttpServerAdapters {
         return result;
     }
 
-    @DataProvider
     public static Object[][] malformedSettingsFrames() {
         // 2-byte ID, 2-byte value
         byte[] settingsFrame = new byte[]{(byte)4,(byte)4,(byte)0x40, (byte)6, (byte)0x40, (byte)6};
         return chopFrame(settingsFrame, 1, 2, 3);
     }
 
-    @DataProvider
     public static Object[][] malformedCancelPushFrames() {
         byte[] cancelPush = new byte[]{(byte)3,(byte)2, (byte)0x40, (byte)0};
         return chopFrame(cancelPush, 0, 1, 3, 9);
     }
 
-    @DataProvider
     public static Object[][] malformedGoawayFrames() {
         byte[] goaway = new byte[]{(byte)7,(byte)2, (byte)0x40, (byte)0};
         return chopFrame(goaway, 0, 1, 3, 9);
     }
 
-    @DataProvider
     public static Object[][] malformedResponseHeadersFrames() {
         byte[] responseHeaders = HexFormat.of().parseHex(
                 "011a0000"+ // headers, length 26, section prefix
@@ -176,7 +171,6 @@ public class H3ErrorHandlingTest implements HttpServerAdapters {
         return chopFrame(responseHeaders, 0, 1, 4, 5, 6, 7);
     }
 
-    @DataProvider
     public static Object[][] truncatedResponseFrames() {
         byte[] response = HexFormat.of().parseHex(
                 "01030000"+ // headers, length 3, section prefix
@@ -187,7 +181,6 @@ public class H3ErrorHandlingTest implements HttpServerAdapters {
         return chopBytes(response, 1, 2, 3, 4, 6, 7, 9, 10);
     }
 
-    @DataProvider
     public static Object[][] truncatedControlFrames() {
         byte[] response = HexFormat.of().parseHex(
                 "00"+ // stream type: control
@@ -198,12 +191,10 @@ public class H3ErrorHandlingTest implements HttpServerAdapters {
         return chopBytes(response, 2, 3, 4, 6, 7, 9, 10);
     }
 
-    @DataProvider
     public static Object[][] malformedPushPromiseFrames() {
         return chopFrame(valid_push_promise, 0, 1, 2, 4, 5, 6);
     }
 
-    @DataProvider
     public static Object[][] invalidControlFrames() {
         // frames not valid on the server control stream (after settings)
         // all except cancel_push / goaway (max_push_id is client-only)
@@ -211,7 +202,6 @@ public class H3ErrorHandlingTest implements HttpServerAdapters {
                 {reserved1}, {reserved2}, {reserved3}, {reserved4}};
     }
 
-    @DataProvider
     public static Object[][] invalidResponseFrames() {
         // frames not valid on the response stream
         // all except headers / push_promise
@@ -220,7 +210,6 @@ public class H3ErrorHandlingTest implements HttpServerAdapters {
                 {reserved1}, {reserved2}, {reserved3}, {reserved4}};
     }
 
-    @DataProvider
     public static Object[][] invalidPushFrames() {
         // frames not valid on the push promise stream
         // all except headers
@@ -229,8 +218,8 @@ public class H3ErrorHandlingTest implements HttpServerAdapters {
                 {reserved1}, {reserved2}, {reserved3}, {reserved4}};
     }
 
-    @BeforeClass
-    public void beforeClass() throws Exception {
+    @BeforeAll
+    public static void beforeClass() throws Exception {
         server = QuicStandaloneServer.newBuilder()
                 .availableVersions(new QuicVersion[]{QuicVersion.QUIC_V1})
                 .sslContext(sslContext)
@@ -242,8 +231,8 @@ public class H3ErrorHandlingTest implements HttpServerAdapters {
                 .port(server.getAddress().getPort()).build().toString();
     }
 
-    @AfterClass
-    public void afterClass() throws Exception {
+    @AfterAll
+    public static void afterClass() throws Exception {
         if (server != null) {
             System.out.println("Stopping server " + server.getAddress());
             server.close();
@@ -256,7 +245,7 @@ public class H3ErrorHandlingTest implements HttpServerAdapters {
     @Test
     public void testNonSettingsFrame() throws Exception {
         CompletableFuture<TerminationCause> errorCF = new CompletableFuture<>();
-        server.addHandler((c,s)-> {
+        server.setHandler((c, s)-> {
             QuicSenderStream controlStream;
             controlStream = c.openNewLocalUniStream(Duration.ZERO).resultNow();
             var scheduler = SequentialScheduler.lockingScheduler(() -> {
@@ -274,10 +263,11 @@ public class H3ErrorHandlingTest implements HttpServerAdapters {
     /**
      * Server opens 2 control streams
      */
-    @Test(dataProvider = "controlStreams")
+    @ParameterizedTest
+    @MethodSource("controlStreams")
     public void testTwoControlStreams(byte type) throws Exception {
         CompletableFuture<TerminationCause> errorCF = new CompletableFuture<>();
-        server.addHandler((c,s)-> {
+        server.setHandler((c, s)-> {
 
             QuicSenderStream controlStream, controlStream2;
             controlStream = c.openNewLocalUniStream(Duration.ZERO).resultNow();
@@ -299,10 +289,11 @@ public class H3ErrorHandlingTest implements HttpServerAdapters {
     /**
      * Server closes control stream
      */
-    @Test(dataProvider = "controlStreams")
+    @ParameterizedTest
+    @MethodSource("controlStreams")
     public void testCloseControlStream(byte type) throws Exception {
         CompletableFuture<TerminationCause> errorCF = new CompletableFuture<>();
-        server.addHandler((c,s)-> {
+        server.setHandler((c, s)-> {
             QuicSenderStream controlStream;
             controlStream = c.openNewLocalUniStream(Duration.ZERO).resultNow();
             var controlscheduler = SequentialScheduler.lockingScheduler(() -> {});
@@ -315,26 +306,34 @@ public class H3ErrorHandlingTest implements HttpServerAdapters {
         triggerError(errorCF, Http3Error.H3_CLOSED_CRITICAL_STREAM);
     }
 
-    public static class RetryOnce implements IRetryAnalyzer {
-        boolean retried;
-
-        @Override
-        public boolean retry(ITestResult iTestResult) {
-            if (!retried) {
-                retried = true;
-                return true;
-            }
-            return false;
-        }
-    }
-
     /**
      * Server resets control stream
      */
-    @Test(dataProvider = "controlStreams", retryAnalyzer = RetryOnce.class)
+    @ParameterizedTest
+    @MethodSource("controlStreams")
     public void testResetControlStream(byte type) throws Exception {
+        try {
+            System.out.printf("testResetControlStream(%s) - first attempt%n", type);
+            System.err.printf("%ntestResetControlStream(%s) - first attempt%n", type);
+            testResetControlStreamImpl(type);
+            System.out.printf("testResetControlStream(%s) - first attempt succeeded!%n", type);
+            System.err.printf("%ntestResetControlStream(%s) - first attempt succeeded!%n", type);
+        } catch (Throwable t) {
+            System.out.printf("testResetControlStream(%s) - first attempt failed: %s%n",
+                    type, t);
+            System.err.printf("%ntestResetControlStream(%s) - first attempt failed: %s%n",
+                    type);
+            System.out.printf("testResetControlStream(%s) - retrying...%n", type);
+            System.err.printf("%ntestResetControlStream(%s) - retrying...%n", type);
+            testResetControlStreamImpl(type);
+            System.out.printf("testResetControlStream(%s) - retry succeeded!%n", type);
+            System.err.printf("%ntestResetControlStream(%s) - retry succeeded!%n", type);
+        }
+    }
+
+    private void testResetControlStreamImpl(byte type) throws Exception {
         CompletableFuture<TerminationCause> errorCF = new CompletableFuture<>();
-        server.addHandler((c,s)-> {
+        server.setHandler((c, s)-> {
             QuicSenderStream controlStream;
             controlStream = c.openNewLocalUniStream(Duration.ZERO).resultNow();
             var controlscheduler = SequentialScheduler.lockingScheduler(() -> {});
@@ -362,10 +361,11 @@ public class H3ErrorHandlingTest implements HttpServerAdapters {
     /**
      * Server sends unexpected frame on control stream
      */
-    @Test(dataProvider = "invalidControlFrames")
+    @ParameterizedTest
+    @MethodSource("invalidControlFrames")
     public void testUnexpectedControlFrame(byte[] frame) throws Exception {
         CompletableFuture<TerminationCause> errorCF = new CompletableFuture<>();
-        server.addHandler((c,s)-> {
+        server.setHandler((c, s)-> {
             QuicSenderStream controlStream;
             controlStream = c.openNewLocalUniStream(Duration.ZERO).resultNow();
             var scheduler = SequentialScheduler.lockingScheduler(() -> {
@@ -387,10 +387,11 @@ public class H3ErrorHandlingTest implements HttpServerAdapters {
     /**
      * Server sends malformed settings frame
      */
-    @Test(dataProvider = "malformedSettingsFrames")
+    @ParameterizedTest
+    @MethodSource("malformedSettingsFrames")
     public void testMalformedSettingsFrame(byte[] frame, int bytes) throws Exception {
         CompletableFuture<TerminationCause> errorCF = new CompletableFuture<>();
-        server.addHandler((c,s)-> {
+        server.setHandler((c, s)-> {
             QuicSenderStream controlStream;
             controlStream = c.openNewLocalUniStream(Duration.ZERO).resultNow();
             var scheduler = SequentialScheduler.lockingScheduler(() -> {
@@ -412,10 +413,11 @@ public class H3ErrorHandlingTest implements HttpServerAdapters {
     /**
      * Server sends malformed goaway frame
      */
-    @Test(dataProvider = "malformedGoawayFrames")
+    @ParameterizedTest
+    @MethodSource("malformedGoawayFrames")
     public void testMalformedGoawayFrame(byte[] frame, int bytes) throws Exception {
         CompletableFuture<TerminationCause> errorCF = new CompletableFuture<>();
-        server.addHandler((c,s)-> {
+        server.setHandler((c, s)-> {
             QuicSenderStream controlStream;
             controlStream = c.openNewLocalUniStream(Duration.ZERO).resultNow();
             var scheduler = SequentialScheduler.lockingScheduler(() -> {
@@ -437,10 +439,11 @@ public class H3ErrorHandlingTest implements HttpServerAdapters {
     /**
      * Server sends malformed cancel push frame
      */
-    @Test(dataProvider = "malformedCancelPushFrames")
+    @ParameterizedTest
+    @MethodSource("malformedCancelPushFrames")
     public void testMalformedCancelPushFrame(byte[] frame, int bytes) throws Exception {
         CompletableFuture<TerminationCause> errorCF = new CompletableFuture<>();
-        server.addHandler((c,s)-> {
+        server.setHandler((c, s)-> {
             QuicSenderStream controlStream;
             controlStream = c.openNewLocalUniStream(Duration.ZERO).resultNow();
             var scheduler = SequentialScheduler.lockingScheduler(() -> {
@@ -465,7 +468,7 @@ public class H3ErrorHandlingTest implements HttpServerAdapters {
     @Test
     public void testInvalidGoAwaySequence() throws Exception {
         CompletableFuture<TerminationCause> errorCF = new CompletableFuture<>();
-        server.addHandler((c,s)-> {
+        server.setHandler((c, s)-> {
             QuicSenderStream controlStream;
             controlStream = c.openNewLocalUniStream(Duration.ZERO).resultNow();
             var scheduler = SequentialScheduler.lockingScheduler(() -> {
@@ -487,7 +490,7 @@ public class H3ErrorHandlingTest implements HttpServerAdapters {
     @Test
     public void testInvalidGoAwayId() throws Exception {
         CompletableFuture<TerminationCause> errorCF = new CompletableFuture<>();
-        server.addHandler((c,s)-> {
+        server.setHandler((c, s)-> {
             QuicSenderStream controlStream;
             controlStream = c.openNewLocalUniStream(Duration.ZERO).resultNow();
             var scheduler = SequentialScheduler.lockingScheduler(() -> {
@@ -509,7 +512,7 @@ public class H3ErrorHandlingTest implements HttpServerAdapters {
     @Test
     public void testInvalidCancelPushId() throws Exception {
         CompletableFuture<TerminationCause> errorCF = new CompletableFuture<>();
-        server.addHandler((c,s)-> {
+        server.setHandler((c, s)-> {
             QuicSenderStream controlStream;
             controlStream = c.openNewLocalUniStream(Duration.ZERO).resultNow();
             var scheduler = SequentialScheduler.lockingScheduler(() -> {
@@ -529,10 +532,11 @@ public class H3ErrorHandlingTest implements HttpServerAdapters {
     /**
      * Server sends unexpected frame on push stream
      */
-    @Test(dataProvider = "invalidPushFrames")
+    @ParameterizedTest
+    @MethodSource("invalidPushFrames")
     public void testUnexpectedPushFrame(byte[] frame) throws Exception {
         CompletableFuture<TerminationCause> errorCF = new CompletableFuture<>();
-        server.addHandler((c,s)-> {
+        server.setHandler((c, s)-> {
             QuicSenderStream pushStream;
             pushStream = c.openNewLocalUniStream(Duration.ZERO).resultNow();
             var scheduler = SequentialScheduler.lockingScheduler(() -> {
@@ -556,10 +560,11 @@ public class H3ErrorHandlingTest implements HttpServerAdapters {
     /**
      * Server sends malformed frame on push stream
      */
-    @Test(dataProvider = "malformedResponseHeadersFrames")
+    @ParameterizedTest
+    @MethodSource("malformedResponseHeadersFrames")
     public void testMalformedPushStreamFrame(byte[] frame, int bytes) throws Exception {
         CompletableFuture<TerminationCause> errorCF = new CompletableFuture<>();
-        server.addHandler((c,s)-> {
+        server.setHandler((c, s)-> {
             QuicSenderStream pushStream;
             pushStream = c.openNewLocalUniStream(Duration.ZERO).resultNow();
             var scheduler = SequentialScheduler.lockingScheduler(() -> {
@@ -585,10 +590,11 @@ public class H3ErrorHandlingTest implements HttpServerAdapters {
     /**
      * Server sends malformed frame on push stream
      */
-    @Test(dataProvider = "malformedPushPromiseFrames")
+    @ParameterizedTest
+    @MethodSource("malformedPushPromiseFrames")
     public void testMalformedPushPromiseFrame(byte[] frame, int bytes) throws Exception {
         CompletableFuture<TerminationCause> errorCF = new CompletableFuture<>();
-        server.addHandler((c,s)-> {
+        server.setHandler((c, s)-> {
             // write PUSH_PROMISE frame
             s.outputStream().write(frame);
             // ignore the request stream; we're expecting the client to close the connection
@@ -605,7 +611,7 @@ public class H3ErrorHandlingTest implements HttpServerAdapters {
     @Test
     public void testDuplicatePushStream() throws Exception {
         CompletableFuture<TerminationCause> errorCF = new CompletableFuture<>();
-        server.addHandler((c,s)-> {
+        server.setHandler((c, s)-> {
             QuicSenderStream pushStream, pushStream2;
             pushStream = c.openNewLocalUniStream(Duration.ZERO).resultNow();
             pushStream2 = c.openNewLocalUniStream(Duration.ZERO).resultNow();
@@ -634,7 +640,7 @@ public class H3ErrorHandlingTest implements HttpServerAdapters {
     @Test
     public void testInvalidPushPromiseId() throws Exception {
         CompletableFuture<TerminationCause> errorCF = new CompletableFuture<>();
-        server.addHandler((c,s)-> {
+        server.setHandler((c, s)-> {
             // write PUSH_PROMISE frame
             s.outputStream().write(huge_id_push_promise);
             // ignore the request stream; we're expecting the client to close the connection
@@ -649,7 +655,7 @@ public class H3ErrorHandlingTest implements HttpServerAdapters {
     @Test
     public void testInvalidPushStreamId() throws Exception {
         CompletableFuture<TerminationCause> errorCF = new CompletableFuture<>();
-        server.addHandler((c,s)-> {
+        server.setHandler((c, s)-> {
             QuicSenderStream pushStream;
             pushStream = c.openNewLocalUniStream(Duration.ZERO).resultNow();
             var scheduler = SequentialScheduler.lockingScheduler(() -> {
@@ -669,10 +675,11 @@ public class H3ErrorHandlingTest implements HttpServerAdapters {
     /**
      * Server sends unexpected frame on response stream
      */
-    @Test(dataProvider = "invalidResponseFrames")
+    @ParameterizedTest
+    @MethodSource("invalidResponseFrames")
     public void testUnexpectedResponseFrame(byte[] frame) throws Exception {
         CompletableFuture<TerminationCause> errorCF = new CompletableFuture<>();
-        server.addHandler((c,s)-> {
+        server.setHandler((c, s)-> {
             s.outputStream().write(frame);
             // ignore the request stream; we're expecting the client to close the connection
             completeUponTermination(c, errorCF);
@@ -683,10 +690,11 @@ public class H3ErrorHandlingTest implements HttpServerAdapters {
     /**
      * Server sends malformed headers frame on response stream
      */
-    @Test(dataProvider = "malformedResponseHeadersFrames")
+    @ParameterizedTest
+    @MethodSource("malformedResponseHeadersFrames")
     public void testMalformedResponseFrame(byte[] frame, int bytes) throws Exception {
         CompletableFuture<TerminationCause> errorCF = new CompletableFuture<>();
-        server.addHandler((c,s)-> {
+        server.setHandler((c, s)-> {
             s.outputStream().write(frame);
             // ignore the request stream; we're expecting the client to close the connection
             completeUponTermination(c, errorCF);
@@ -699,10 +707,11 @@ public class H3ErrorHandlingTest implements HttpServerAdapters {
     /**
      * Server truncates a frame on the response stream
      */
-    @Test(dataProvider = "truncatedResponseFrames")
+    @ParameterizedTest
+    @MethodSource("truncatedResponseFrames")
     public void testTruncatedResponseFrame(byte[] frame, int bytes) throws Exception {
         CompletableFuture<TerminationCause> errorCF = new CompletableFuture<>();
-        server.addHandler((c,s)-> {
+        server.setHandler((c, s)-> {
             try (OutputStream outputStream = s.outputStream()) {
                 outputStream.write(frame);
             }
@@ -715,10 +724,11 @@ public class H3ErrorHandlingTest implements HttpServerAdapters {
     /**
      * Server truncates a frame on the control stream
      */
-    @Test(dataProvider = "truncatedControlFrames")
+    @ParameterizedTest
+    @MethodSource("truncatedControlFrames")
     public void testTruncatedControlFrame(byte[] frame, int bytes) throws Exception {
         CompletableFuture<TerminationCause> errorCF = new CompletableFuture<>();
-        server.addHandler((c,s)-> {
+        server.setHandler((c, s)-> {
             QuicSenderStream controlStream;
             controlStream = c.openNewLocalUniStream(Duration.ZERO).resultNow();
             var controlscheduler = SequentialScheduler.lockingScheduler(() -> {});
@@ -735,10 +745,11 @@ public class H3ErrorHandlingTest implements HttpServerAdapters {
     /**
      * Server truncates a frame on the push stream
      */
-    @Test(dataProvider = "truncatedResponseFrames")
+    @ParameterizedTest
+    @MethodSource("truncatedResponseFrames")
     public void testTruncatedPushStreamFrame(byte[] frame, int bytes) throws Exception {
         CompletableFuture<TerminationCause> errorCF = new CompletableFuture<>();
-        server.addHandler((c,s)-> {
+        server.setHandler((c, s)-> {
             QuicSenderStream pushStream;
             pushStream = c.openNewLocalUniStream(Duration.ZERO).resultNow();
             var scheduler = SequentialScheduler.lockingScheduler(() -> {
@@ -765,7 +776,7 @@ public class H3ErrorHandlingTest implements HttpServerAdapters {
     @Test
     public void testReservedSettingsFrames() throws Exception {
         CompletableFuture<TerminationCause> errorCF = new CompletableFuture<>();
-        server.addHandler((c,s)-> {
+        server.setHandler((c, s)-> {
             QuicSenderStream controlStream;
             controlStream = c.openNewLocalUniStream(Duration.ZERO).resultNow();
             var scheduler = SequentialScheduler.lockingScheduler(() -> {
@@ -785,7 +796,7 @@ public class H3ErrorHandlingTest implements HttpServerAdapters {
      */
     @Test
     public void testStatelessReset() throws Exception {
-        server.addHandler((c,s)-> {
+        server.setHandler((c, s)-> {
             // stateless reset
             QuicConnectionId localConnId = c.localConnectionId();
             ByteBuffer resetDatagram = c.endpoint().idFactory().statelessReset(localConnId.asReadOnlyBuffer(), 43);
@@ -819,10 +830,10 @@ public class H3ErrorHandlingTest implements HttpServerAdapters {
      * Server opens a bidi stream
      */
     @Test
-    @Ignore("BiDi streams are rejected by H3 client at QUIC level")
+    @Disabled("BiDi streams are rejected by H3 client at QUIC level")
     public void testBidiStream() throws Exception {
         CompletableFuture<TerminationCause> errorCF = new CompletableFuture<>();
-        server.addHandler((c,s)-> {
+        server.setHandler((c, s)-> {
             QuicSenderStream bidiStream;
             bidiStream = c.openNewLocalBidiStream(Duration.ZERO).resultNow();
             var scheduler = SequentialScheduler.lockingScheduler(() -> {
@@ -842,7 +853,7 @@ public class H3ErrorHandlingTest implements HttpServerAdapters {
      */
     @Test
     public void testConnectionCloseQUIC() throws Exception {
-        server.addHandler((c,s)-> {
+        server.setHandler((c, s)-> {
             TerminationCause tc = TerminationCause.forException(
                     new QuicTransportException("ignored", null, 0,
                             QuicTransportErrors.INTERNAL_ERROR)
@@ -859,7 +870,7 @@ public class H3ErrorHandlingTest implements HttpServerAdapters {
      */
     @Test
     public void testConnectionCloseCryptoQUIC() throws Exception {
-        server.addHandler((c,s)-> {
+        server.setHandler((c, s)-> {
             TerminationCause tc = TerminationCause.forException(
                     new QuicTransportException("ignored", null, 0,
                             QuicTransportErrors.CRYPTO_ERROR.from() + 80 /*Alert.INTERNAL_ERROR.id*/, null)
@@ -876,7 +887,7 @@ public class H3ErrorHandlingTest implements HttpServerAdapters {
      */
     @Test
     public void testConnectionCloseUnknownCryptoQUIC() throws Exception {
-        server.addHandler((c,s)-> {
+        server.setHandler((c, s)-> {
             TerminationCause tc = TerminationCause.forException(
                     new QuicTransportException("ignored", null, 0,
                             QuicTransportErrors.CRYPTO_ERROR.from() + 5, null)
@@ -893,7 +904,7 @@ public class H3ErrorHandlingTest implements HttpServerAdapters {
      */
     @Test
     public void testConnectionCloseUnknownQUIC() throws Exception {
-        server.addHandler((c,s)-> {
+        server.setHandler((c, s)-> {
             TerminationCause tc = TerminationCause.forException(
                     new QuicTransportException("ignored", null, 0,
                             QuicTransportErrors.CRYPTO_ERROR.to() + 1 /*0x200*/, null)
@@ -910,7 +921,7 @@ public class H3ErrorHandlingTest implements HttpServerAdapters {
      */
     @Test
     public void testConnectionCloseH3() throws Exception {
-        server.addHandler((c,s)-> {
+        server.setHandler((c, s)-> {
             TerminationCause tc = TerminationCause.appLayerClose(Http3Error.H3_EXCESSIVE_LOAD.code());
             tc.peerVisibleReason("testtest");
             c.connectionTerminator().terminate(tc);
@@ -924,7 +935,7 @@ public class H3ErrorHandlingTest implements HttpServerAdapters {
      */
     @Test
     public void testConnectionCloseH3Unknown() throws Exception {
-        server.addHandler((c,s)-> {
+        server.setHandler((c, s)-> {
             TerminationCause tc = TerminationCause.appLayerClose(0x1f21);
             tc.peerVisibleReason("testtest");
             c.connectionTerminator().terminate(tc);
@@ -974,7 +985,7 @@ public class H3ErrorHandlingTest implements HttpServerAdapters {
             System.out.println("Server reason: \"" + terminationCause.getPeerVisibleReason()+'"');
             final long actual = terminationCause.getCloseCode();
             // expected
-            assertEquals(actual, expected.code(), "Expected " + toHexString(expected) + " got 0x" + Long.toHexString(actual));
+            assertEquals(expected.code(), actual, "Expected " + toHexString(expected) + " got 0x" + Long.toHexString(actual));
         } finally {
             client.shutdownNow();
         }
@@ -1027,7 +1038,7 @@ public class H3ErrorHandlingTest implements HttpServerAdapters {
             System.out.println("Server reason: \"" + terminationCause.getPeerVisibleReason()+'"');
             final long actual = terminationCause.getCloseCode();
             // expected
-            assertEquals(actual, http3Error.code(), "Expected " + toHexString(http3Error) + " got 0x" + Long.toHexString(actual));
+            assertEquals(http3Error.code(), actual, "Expected " + toHexString(http3Error) + " got 0x" + Long.toHexString(actual));
         } finally {
             client.shutdownNow();
         }
diff --git a/test/jdk/java/net/httpclient/http3/H3MalformedResponseTest.java b/test/jdk/java/net/httpclient/http3/H3MalformedResponseTest.java
index 5ef45f8b230..eaab2711479 100644
--- a/test/jdk/java/net/httpclient/http3/H3MalformedResponseTest.java
+++ b/test/jdk/java/net/httpclient/http3/H3MalformedResponseTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2024, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2024, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -458,7 +458,7 @@ class H3MalformedResponseTest {
 
     private static BooleanSupplier configureServerResponse(byte[] serverResponseBytes) {
         var connectionTerminated = new AtomicBoolean();
-        SERVER.addHandler((c, s)-> {
+        SERVER.setHandler((c, s)-> {
             try (OutputStream outputStream = s.outputStream()) {
                 outputStream.write(serverResponseBytes);
             }
diff --git a/test/jdk/java/net/httpclient/http3/H3MemoryHandlingTest.java b/test/jdk/java/net/httpclient/http3/H3MemoryHandlingTest.java
index 2fcb7388f7b..0d107486fcd 100644
--- a/test/jdk/java/net/httpclient/http3/H3MemoryHandlingTest.java
+++ b/test/jdk/java/net/httpclient/http3/H3MemoryHandlingTest.java
@@ -109,7 +109,7 @@ public class H3MemoryHandlingTest implements HttpServerAdapters {
                         "00ffffffffffffffff"); // data, 2^62 - 1 bytes
         byte[] kilo = new byte[1024];
         final CompletableFuture<Boolean> serverAllWritesDone = new CompletableFuture<>();
-        server.addHandler((c,s)-> {
+        server.setHandler((c, s)-> {
             // verify that the connection stays open
             completeUponTermination(c, errorCF);
             try (OutputStream outputStream = s.outputStream()) {
@@ -154,7 +154,7 @@ public class H3MemoryHandlingTest implements HttpServerAdapters {
         byte[] kilo = new byte[1024];
         CountDownLatch writerBlocked = new CountDownLatch(1);
 
-        server.addHandler((c,s)-> {
+        server.setHandler((c, s)-> {
             // verify that the connection stays open
             completeUponTermination(c, errorCF);
             QuicBidiStream qs = s.underlyingBidiStream();
diff --git a/test/jdk/java/net/httpclient/lib/jdk/httpclient/test/lib/quic/QuicServerHandler.java b/test/jdk/java/net/httpclient/lib/jdk/httpclient/test/lib/quic/QuicServerHandler.java
index 886f15821a6..bef2e40137b 100644
--- a/test/jdk/java/net/httpclient/lib/jdk/httpclient/test/lib/quic/QuicServerHandler.java
+++ b/test/jdk/java/net/httpclient/lib/jdk/httpclient/test/lib/quic/QuicServerHandler.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2023, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2023, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -31,7 +31,7 @@ import jdk.internal.net.http.quic.streams.QuicBidiStream;
  * Used by server side application code to handle incoming Quic connections and streams associated
  * with those connections
  *
- * @see QuicStandaloneServer#addHandler(QuicServerHandler)
+ * @see QuicStandaloneServer#setHandler(QuicServerHandler)
  */
 // TODO: should we make this an abstract class instead of interface?
 public interface QuicServerHandler {
diff --git a/test/jdk/java/net/httpclient/lib/jdk/httpclient/test/lib/quic/QuicStandaloneServer.java b/test/jdk/java/net/httpclient/lib/jdk/httpclient/test/lib/quic/QuicStandaloneServer.java
index b1697064556..a7b5bb42ac2 100644
--- a/test/jdk/java/net/httpclient/lib/jdk/httpclient/test/lib/quic/QuicStandaloneServer.java
+++ b/test/jdk/java/net/httpclient/lib/jdk/httpclient/test/lib/quic/QuicStandaloneServer.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2023, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2023, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -64,7 +64,7 @@ public final class QuicStandaloneServer extends QuicServer {
         setConnectionAcceptor(QuicStandaloneServer::acceptIncoming);
     }
 
-    public void addHandler(final QuicServerHandler handler) {
+    public void setHandler(final QuicServerHandler handler) {
         this.handler = handler;
     }
 
diff --git a/test/jdk/java/net/httpclient/quic/KeyUpdateTest.java b/test/jdk/java/net/httpclient/quic/KeyUpdateTest.java
index d13b8d9b865..eaec0bc8b95 100644
--- a/test/jdk/java/net/httpclient/quic/KeyUpdateTest.java
+++ b/test/jdk/java/net/httpclient/quic/KeyUpdateTest.java
@@ -102,7 +102,7 @@ public class KeyUpdateTest {
                 .sslContext(sslContext)
                 .build();
         // add a handler which deals with incoming connections
-        server.addHandler(handler);
+        server.setHandler(handler);
         server.start();
         System.out.println("Server started at " + server.getAddress());
     }
diff --git a/test/jdk/java/net/httpclient/quic/PacketLossTest.java b/test/jdk/java/net/httpclient/quic/PacketLossTest.java
index 1f75e1feb95..a597c826e73 100644
--- a/test/jdk/java/net/httpclient/quic/PacketLossTest.java
+++ b/test/jdk/java/net/httpclient/quic/PacketLossTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2023, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2023, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -158,7 +158,7 @@ public class PacketLossTest {
 
     private static void startServer(final QuicStandaloneServer server) throws IOException {
         // add a handler which deals with incoming connections
-        server.addHandler(new EchoHandler(HELLO_MSG.length));
+        server.setHandler(new EchoHandler(HELLO_MSG.length));
         server.start();
         System.out.println("Server " + server.name() + " started at " + server.getAddress());
     }
diff --git a/test/jdk/java/net/httpclient/quic/QuicRequestResponseTest.java b/test/jdk/java/net/httpclient/quic/QuicRequestResponseTest.java
index 208e284cefd..2393ac7df12 100644
--- a/test/jdk/java/net/httpclient/quic/QuicRequestResponseTest.java
+++ b/test/jdk/java/net/httpclient/quic/QuicRequestResponseTest.java
@@ -73,7 +73,7 @@ public class QuicRequestResponseTest {
                 .sslContext(sslContext)
                 .build();
         // add a handler which deals with incoming connections
-        server.addHandler(new EchoHandler(HELLO_MSG.length));
+        server.setHandler(new EchoHandler(HELLO_MSG.length));
         server.start();
         System.out.println("Server started at " + server.getAddress());
     }
diff --git a/test/jdk/java/net/httpclient/quic/StatelessResetReceiptTest.java b/test/jdk/java/net/httpclient/quic/StatelessResetReceiptTest.java
index a20494095bd..9f7852740b4 100644
--- a/test/jdk/java/net/httpclient/quic/StatelessResetReceiptTest.java
+++ b/test/jdk/java/net/httpclient/quic/StatelessResetReceiptTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2024, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2024, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -128,7 +128,7 @@ public class StatelessResetReceiptTest {
     public void testActiveConnection() throws Exception {
         final CompletableFuture<QuicServerConnection> serverConnCF = new MinimalFuture<>();
         final NotifyingHandler handler = new NotifyingHandler(serverConnCF);
-        server.addHandler(handler);
+        server.setHandler(handler);
         try (final QuicClient client = createClient()) {
             // create a QUIC connection to the server
             final ClientConnection conn = ClientConnection.establishConnection(client,
@@ -162,7 +162,7 @@ public class StatelessResetReceiptTest {
     public void testClosingConnection() throws Exception {
         final CompletableFuture<QuicServerConnection> serverConnCF = new MinimalFuture<>();
         final NotifyingHandler handler = new NotifyingHandler(serverConnCF);
-        server.addHandler(handler);
+        server.setHandler(handler);
         try (final QuicClient client = createClient()) {
             // create a QUIC connection to the server
             final ClientConnection conn = ClientConnection.establishConnection(client,
@@ -215,7 +215,7 @@ public class StatelessResetReceiptTest {
     public void testDrainingConnection() throws Exception {
         final CompletableFuture<QuicServerConnection> serverConnCF = new MinimalFuture<>();
         final NotifyingHandler handler = new NotifyingHandler(serverConnCF);
-        server.addHandler(handler);
+        server.setHandler(handler);
         try (final QuicClient client = createClient()) {
             // create a QUIC connection to the server
             final ClientConnection conn = ClientConnection.establishConnection(client,
diff --git a/test/jdk/java/net/httpclient/quic/VersionNegotiationTest.java b/test/jdk/java/net/httpclient/quic/VersionNegotiationTest.java
index bd5bbae0170..6b40bf84a8e 100644
--- a/test/jdk/java/net/httpclient/quic/VersionNegotiationTest.java
+++ b/test/jdk/java/net/httpclient/quic/VersionNegotiationTest.java
@@ -126,7 +126,7 @@ public class VersionNegotiationTest {
                 .availableVersions(new QuicVersion[]{version})
                 .sslContext(sslContext)
                 .build();
-        server.addHandler(new ExceptionThrowingHandler());
+        server.setHandler(new ExceptionThrowingHandler());
         server.start();
         System.out.println("Quic server with version " + version + " started at " + server.getAddress());
         return server;

From 5e588085e9c333e9ad8e48dd7c60e665d30e278d Mon Sep 17 00:00:00 2001
From: Albert Mingkun Yang <ayang@openjdk.org>
Date: Mon, 9 Mar 2026 10:35:00 +0000
Subject: [PATCH 094/655] 8378744: Obsolete NewSizeThreadIncrease flag

Reviewed-by: tschatzl, iwalulya, sjohanss
---
 .../cpu/aarch64/c1_globals_aarch64.hpp        |   1 -
 .../cpu/aarch64/c2_globals_aarch64.hpp        |   1 -
 src/hotspot/cpu/arm/c1_globals_arm.hpp        |   1 -
 src/hotspot/cpu/arm/c2_globals_arm.hpp        |   1 -
 src/hotspot/cpu/ppc/c1_globals_ppc.hpp        |   1 -
 src/hotspot/cpu/ppc/c2_globals_ppc.hpp        |   1 -
 src/hotspot/cpu/riscv/c1_globals_riscv.hpp    |   1 -
 src/hotspot/cpu/riscv/c2_globals_riscv.hpp    |   1 -
 src/hotspot/cpu/s390/c1_globals_s390.hpp      |   1 -
 src/hotspot/cpu/s390/c2_globals_s390.hpp      |   1 -
 src/hotspot/cpu/x86/c1_globals_x86.hpp        |   1 -
 src/hotspot/cpu/x86/c2_globals_x86.hpp        |   1 -
 .../share/compiler/compilerDefinitions.cpp    |   3 -
 .../share/compiler/compiler_globals_pd.hpp    |   1 -
 .../share/gc/serial/defNewGeneration.cpp      |  40 +-----
 .../share/gc/serial/defNewGeneration.hpp      |   9 --
 src/hotspot/share/gc/shared/gc_globals.hpp    |   5 -
 src/hotspot/share/runtime/arguments.cpp       |   1 +
 .../arguments/TestNewSizeThreadIncrease.java  | 127 ------------------
 .../optionsvalidation/JVMOptionsUtils.java    |   3 -
 20 files changed, 2 insertions(+), 199 deletions(-)
 delete mode 100644 test/hotspot/jtreg/gc/arguments/TestNewSizeThreadIncrease.java

diff --git a/src/hotspot/cpu/aarch64/c1_globals_aarch64.hpp b/src/hotspot/cpu/aarch64/c1_globals_aarch64.hpp
index 938a64dd399..df013d9d1ee 100644
--- a/src/hotspot/cpu/aarch64/c1_globals_aarch64.hpp
+++ b/src/hotspot/cpu/aarch64/c1_globals_aarch64.hpp
@@ -42,7 +42,6 @@ define_pd_global(bool, TieredCompilation,            false);
 define_pd_global(intx, CompileThreshold,             1500 );
 
 define_pd_global(intx, OnStackReplacePercentage,     933  );
-define_pd_global(intx, NewSizeThreadIncrease,        4*K  );
 define_pd_global(size_t, InitialCodeCacheSize,       160*K);
 define_pd_global(size_t, ReservedCodeCacheSize,      32*M );
 define_pd_global(size_t, NonProfiledCodeHeapSize,    13*M );
diff --git a/src/hotspot/cpu/aarch64/c2_globals_aarch64.hpp b/src/hotspot/cpu/aarch64/c2_globals_aarch64.hpp
index a0dea3643a1..87ad9caaa45 100644
--- a/src/hotspot/cpu/aarch64/c2_globals_aarch64.hpp
+++ b/src/hotspot/cpu/aarch64/c2_globals_aarch64.hpp
@@ -47,7 +47,6 @@ define_pd_global(intx, ConditionalMoveLimit,         3);
 define_pd_global(intx, FreqInlineSize,               325);
 define_pd_global(intx, MinJumpTableSize,             10);
 define_pd_global(intx, InteriorEntryAlignment,       16);
-define_pd_global(intx, NewSizeThreadIncrease, ScaleForWordSize(4*K));
 define_pd_global(intx, LoopUnrollLimit,              60);
 define_pd_global(intx, LoopPercentProfileLimit,      10);
 // InitialCodeCacheSize derived from specjbb2000 run.
diff --git a/src/hotspot/cpu/arm/c1_globals_arm.hpp b/src/hotspot/cpu/arm/c1_globals_arm.hpp
index 1fe5f1a23ee..992cfd0e408 100644
--- a/src/hotspot/cpu/arm/c1_globals_arm.hpp
+++ b/src/hotspot/cpu/arm/c1_globals_arm.hpp
@@ -43,7 +43,6 @@ define_pd_global(bool, TieredCompilation,            false);
 define_pd_global(intx, CompileThreshold,             1500 );
 
 define_pd_global(intx, OnStackReplacePercentage,     933  );
-define_pd_global(size_t, NewSizeThreadIncrease,      4*K  );
 define_pd_global(size_t, InitialCodeCacheSize,       160*K);
 define_pd_global(size_t, ReservedCodeCacheSize,      32*M );
 define_pd_global(size_t, NonProfiledCodeHeapSize,    13*M );
diff --git a/src/hotspot/cpu/arm/c2_globals_arm.hpp b/src/hotspot/cpu/arm/c2_globals_arm.hpp
index 0849bd594f0..84abde5650b 100644
--- a/src/hotspot/cpu/arm/c2_globals_arm.hpp
+++ b/src/hotspot/cpu/arm/c2_globals_arm.hpp
@@ -47,7 +47,6 @@ define_pd_global(intx, ConditionalMoveLimit,         4);
 // C2 gets to use all the float/double registers
 define_pd_global(intx, FreqInlineSize,               175);
 define_pd_global(intx, InteriorEntryAlignment,       16);  // = CodeEntryAlignment
-define_pd_global(size_t, NewSizeThreadIncrease,      ScaleForWordSize(4*K));
 // The default setting 16/16 seems to work best.
 // (For _228_jack 16/16 is 2% better than 4/4, 16/4, 32/32, 32/16, or 16/32.)
 //define_pd_global(intx, OptoLoopAlignment,            16);  // = 4*wordSize
diff --git a/src/hotspot/cpu/ppc/c1_globals_ppc.hpp b/src/hotspot/cpu/ppc/c1_globals_ppc.hpp
index 77d9acd1cd1..7d2e44a88b6 100644
--- a/src/hotspot/cpu/ppc/c1_globals_ppc.hpp
+++ b/src/hotspot/cpu/ppc/c1_globals_ppc.hpp
@@ -52,7 +52,6 @@ define_pd_global(size_t,   CodeCacheExpansionSize,       32*K);
 define_pd_global(size_t,   CodeCacheMinBlockLength,      1);
 define_pd_global(size_t,   CodeCacheMinimumUseSpace,     400*K);
 define_pd_global(bool,     NeverActAsServerClassMachine, true);
-define_pd_global(size_t,   NewSizeThreadIncrease,        16*K);
 define_pd_global(size_t,   InitialCodeCacheSize,         160*K);
 #endif // !COMPILER2
 
diff --git a/src/hotspot/cpu/ppc/c2_globals_ppc.hpp b/src/hotspot/cpu/ppc/c2_globals_ppc.hpp
index caef322d4a1..eeff8d93dd4 100644
--- a/src/hotspot/cpu/ppc/c2_globals_ppc.hpp
+++ b/src/hotspot/cpu/ppc/c2_globals_ppc.hpp
@@ -47,7 +47,6 @@ define_pd_global(intx, ConditionalMoveLimit,         3);
 define_pd_global(intx, FreqInlineSize,               325);
 define_pd_global(intx, MinJumpTableSize,             10);
 define_pd_global(intx, InteriorEntryAlignment,       16);
-define_pd_global(size_t, NewSizeThreadIncrease,      ScaleForWordSize(4*K));
 define_pd_global(intx, RegisterCostAreaRatio,        16000);
 define_pd_global(intx, LoopUnrollLimit,              60);
 define_pd_global(intx, LoopPercentProfileLimit,      10);
diff --git a/src/hotspot/cpu/riscv/c1_globals_riscv.hpp b/src/hotspot/cpu/riscv/c1_globals_riscv.hpp
index b15bb5c23c3..00b92a0dec3 100644
--- a/src/hotspot/cpu/riscv/c1_globals_riscv.hpp
+++ b/src/hotspot/cpu/riscv/c1_globals_riscv.hpp
@@ -42,7 +42,6 @@ define_pd_global(bool, TieredCompilation,            false);
 define_pd_global(intx, CompileThreshold,             1500 );
 
 define_pd_global(intx, OnStackReplacePercentage,     933  );
-define_pd_global(intx, NewSizeThreadIncrease,        4*K  );
 define_pd_global(size_t, InitialCodeCacheSize,       160*K);
 define_pd_global(size_t, ReservedCodeCacheSize,      32*M );
 define_pd_global(size_t, NonProfiledCodeHeapSize,    13*M );
diff --git a/src/hotspot/cpu/riscv/c2_globals_riscv.hpp b/src/hotspot/cpu/riscv/c2_globals_riscv.hpp
index 648c24ee98b..afb4ae8fcdd 100644
--- a/src/hotspot/cpu/riscv/c2_globals_riscv.hpp
+++ b/src/hotspot/cpu/riscv/c2_globals_riscv.hpp
@@ -47,7 +47,6 @@ define_pd_global(intx, ConditionalMoveLimit,         3);
 define_pd_global(intx, FreqInlineSize,               325);
 define_pd_global(intx, MinJumpTableSize,             10);
 define_pd_global(intx, InteriorEntryAlignment,       16);
-define_pd_global(intx, NewSizeThreadIncrease, ScaleForWordSize(4*K));
 define_pd_global(intx, LoopUnrollLimit,              60);
 define_pd_global(intx, LoopPercentProfileLimit,      10);
 // InitialCodeCacheSize derived from specjbb2000 run.
diff --git a/src/hotspot/cpu/s390/c1_globals_s390.hpp b/src/hotspot/cpu/s390/c1_globals_s390.hpp
index 25e46cd1509..bd07dd87066 100644
--- a/src/hotspot/cpu/s390/c1_globals_s390.hpp
+++ b/src/hotspot/cpu/s390/c1_globals_s390.hpp
@@ -52,7 +52,6 @@ define_pd_global(size_t,   CodeCacheExpansionSize,       32*K);
 define_pd_global(size_t,   CodeCacheMinBlockLength,      1);
 define_pd_global(size_t,   CodeCacheMinimumUseSpace,     400*K);
 define_pd_global(bool,     NeverActAsServerClassMachine, true);
-define_pd_global(size_t,   NewSizeThreadIncrease,        16*K);
 define_pd_global(size_t,   InitialCodeCacheSize,         160*K);
 #endif // !COMPILER2
 
diff --git a/src/hotspot/cpu/s390/c2_globals_s390.hpp b/src/hotspot/cpu/s390/c2_globals_s390.hpp
index 125b317588d..068511be8f3 100644
--- a/src/hotspot/cpu/s390/c2_globals_s390.hpp
+++ b/src/hotspot/cpu/s390/c2_globals_s390.hpp
@@ -46,7 +46,6 @@ define_pd_global(intx, OnStackReplacePercentage,     140);
 define_pd_global(intx, ConditionalMoveLimit,         4);
 define_pd_global(intx, FreqInlineSize,               325);
 define_pd_global(intx, InteriorEntryAlignment,       4);
-define_pd_global(size_t, NewSizeThreadIncrease,      ScaleForWordSize(4*K));
 define_pd_global(intx, RegisterCostAreaRatio,        12000);
 define_pd_global(intx, LoopUnrollLimit,              60);
 define_pd_global(intx, LoopPercentProfileLimit,      10);
diff --git a/src/hotspot/cpu/x86/c1_globals_x86.hpp b/src/hotspot/cpu/x86/c1_globals_x86.hpp
index 978b233bb63..063a9185d53 100644
--- a/src/hotspot/cpu/x86/c1_globals_x86.hpp
+++ b/src/hotspot/cpu/x86/c1_globals_x86.hpp
@@ -41,7 +41,6 @@ define_pd_global(bool, TieredCompilation,              false);
 define_pd_global(intx, CompileThreshold,               1500 );
 
 define_pd_global(intx,   OnStackReplacePercentage,     933  );
-define_pd_global(size_t, NewSizeThreadIncrease,        4*K  );
 define_pd_global(size_t, InitialCodeCacheSize,         160*K);
 define_pd_global(size_t, ReservedCodeCacheSize,        32*M );
 define_pd_global(size_t, NonProfiledCodeHeapSize,      13*M );
diff --git a/src/hotspot/cpu/x86/c2_globals_x86.hpp b/src/hotspot/cpu/x86/c2_globals_x86.hpp
index 3f616cb4578..bc119693d32 100644
--- a/src/hotspot/cpu/x86/c2_globals_x86.hpp
+++ b/src/hotspot/cpu/x86/c2_globals_x86.hpp
@@ -46,7 +46,6 @@ define_pd_global(intx, FreqInlineSize,               325);
 define_pd_global(intx, MinJumpTableSize,             10);
 define_pd_global(intx, LoopPercentProfileLimit,      10);
 define_pd_global(intx,  InteriorEntryAlignment,      16);
-define_pd_global(size_t, NewSizeThreadIncrease,      ScaleForWordSize(4*K));
 define_pd_global(intx,  LoopUnrollLimit,             60);
 // InitialCodeCacheSize derived from specjbb2000 run.
 define_pd_global(size_t, InitialCodeCacheSize,       2496*K); // Integral multiple of CodeCacheExpansionSize
diff --git a/src/hotspot/share/compiler/compilerDefinitions.cpp b/src/hotspot/share/compiler/compilerDefinitions.cpp
index 9bd6e893bcd..b8244036835 100644
--- a/src/hotspot/share/compiler/compilerDefinitions.cpp
+++ b/src/hotspot/share/compiler/compilerDefinitions.cpp
@@ -447,9 +447,6 @@ void CompilerConfig::set_jvmci_specific_flags() {
       if (FLAG_IS_DEFAULT(InitialCodeCacheSize)) {
         FLAG_SET_DEFAULT(InitialCodeCacheSize, MAX2(16*M, InitialCodeCacheSize));
       }
-      if (FLAG_IS_DEFAULT(NewSizeThreadIncrease)) {
-        FLAG_SET_DEFAULT(NewSizeThreadIncrease, MAX2(4*K, NewSizeThreadIncrease));
-      }
       if (FLAG_IS_DEFAULT(Tier3DelayOn)) {
         // This effectively prevents the compile broker scheduling tier 2
         // (i.e., limited C1 profiling) compilations instead of tier 3
diff --git a/src/hotspot/share/compiler/compiler_globals_pd.hpp b/src/hotspot/share/compiler/compiler_globals_pd.hpp
index 6a87fdaaaf1..537a7f030fb 100644
--- a/src/hotspot/share/compiler/compiler_globals_pd.hpp
+++ b/src/hotspot/share/compiler/compiler_globals_pd.hpp
@@ -58,7 +58,6 @@ define_pd_global(bool, TieredCompilation,            false);
 define_pd_global(intx, CompileThreshold,             0);
 
 define_pd_global(intx,   OnStackReplacePercentage,   0);
-define_pd_global(size_t, NewSizeThreadIncrease,      4*K);
 define_pd_global(bool,   InlineClassNatives,         true);
 define_pd_global(bool,   InlineUnsafeOps,            true);
 define_pd_global(size_t, InitialCodeCacheSize,       160*K);
diff --git a/src/hotspot/share/gc/serial/defNewGeneration.cpp b/src/hotspot/share/gc/serial/defNewGeneration.cpp
index 225f15f785f..ec3726d1dce 100644
--- a/src/hotspot/share/gc/serial/defNewGeneration.cpp
+++ b/src/hotspot/share/gc/serial/defNewGeneration.cpp
@@ -349,38 +349,6 @@ void DefNewGeneration::expand_eden_by(size_t delta_bytes) {
   post_resize();
 }
 
-size_t DefNewGeneration::calculate_thread_increase_size(int threads_count) const {
-    size_t thread_increase_size = 0;
-    // Check an overflow at 'threads_count * NewSizeThreadIncrease'.
-    if (threads_count > 0 && NewSizeThreadIncrease <= max_uintx / threads_count) {
-      thread_increase_size = threads_count * NewSizeThreadIncrease;
-    }
-    return thread_increase_size;
-}
-
-size_t DefNewGeneration::adjust_for_thread_increase(size_t new_size_candidate,
-                                                    size_t new_size_before,
-                                                    size_t alignment,
-                                                    size_t thread_increase_size) const {
-  size_t desired_new_size = new_size_before;
-
-  if (NewSizeThreadIncrease > 0 && thread_increase_size > 0) {
-
-    // 1. Check an overflow at 'new_size_candidate + thread_increase_size'.
-    if (new_size_candidate <= max_uintx - thread_increase_size) {
-      new_size_candidate += thread_increase_size;
-
-      // 2. Check an overflow at 'align_up'.
-      size_t aligned_max = ((max_uintx - alignment) & ~(alignment-1));
-      if (new_size_candidate <= aligned_max) {
-        desired_new_size = align_up(new_size_candidate, alignment);
-      }
-    }
-  }
-
-  return desired_new_size;
-}
-
 size_t DefNewGeneration::calculate_desired_young_gen_bytes() const {
   size_t old_size = SerialHeap::heap()->old_gen()->capacity();
   size_t new_size_before = _virtual_space.committed_size();
@@ -392,14 +360,8 @@ size_t DefNewGeneration::calculate_desired_young_gen_bytes() const {
   // All space sizes must be multiples of Generation::GenGrain.
   size_t alignment = Generation::GenGrain;
 
-  int threads_count = Threads::number_of_non_daemon_threads();
-  size_t thread_increase_size = calculate_thread_increase_size(threads_count);
-
   size_t new_size_candidate = old_size / NewRatio;
-  // Compute desired new generation size based on NewRatio and NewSizeThreadIncrease
-  // and reverts to previous value if any overflow happens
-  size_t desired_new_size = adjust_for_thread_increase(new_size_candidate, new_size_before,
-                                                       alignment, thread_increase_size);
+  size_t desired_new_size = align_up(new_size_candidate, alignment);
 
   // Adjust new generation size
   desired_new_size = clamp(desired_new_size, min_new_size, max_new_size);
diff --git a/src/hotspot/share/gc/serial/defNewGeneration.hpp b/src/hotspot/share/gc/serial/defNewGeneration.hpp
index 98e599ffeaf..21241ec00ef 100644
--- a/src/hotspot/share/gc/serial/defNewGeneration.hpp
+++ b/src/hotspot/share/gc/serial/defNewGeneration.hpp
@@ -229,15 +229,6 @@ class DefNewGeneration: public Generation {
   // Initialize eden/from/to spaces.
   void init_spaces();
 
-  // Return adjusted new size for NewSizeThreadIncrease.
-  // If any overflow happens, revert to previous new size.
-  size_t adjust_for_thread_increase(size_t new_size_candidate,
-                                    size_t new_size_before,
-                                    size_t alignment,
-                                    size_t thread_increase_size) const;
-
-  size_t calculate_thread_increase_size(int threads_count) const;
-
 
   // Scavenge support
   void swap_spaces();
diff --git a/src/hotspot/share/gc/shared/gc_globals.hpp b/src/hotspot/share/gc/shared/gc_globals.hpp
index 65c970435e5..2fd062de648 100644
--- a/src/hotspot/share/gc/shared/gc_globals.hpp
+++ b/src/hotspot/share/gc/shared/gc_globals.hpp
@@ -480,11 +480,6 @@
           "Ratio of old/new generation sizes")                              \
           range(0, max_uintx-1)                                             \
                                                                             \
-  product_pd(size_t, NewSizeThreadIncrease,                                 \
-          "Additional size added to desired new generation size per "       \
-          "non-daemon thread (in bytes)")                                   \
-          range(0, max_uintx)                                               \
-                                                                            \
   product(uintx, QueuedAllocationWarningCount, 0,                           \
           "Number of times an allocation that queues behind a GC "          \
           "will retry before printing a warning")                           \
diff --git a/src/hotspot/share/runtime/arguments.cpp b/src/hotspot/share/runtime/arguments.cpp
index a1dae76f680..11c4853c388 100644
--- a/src/hotspot/share/runtime/arguments.cpp
+++ b/src/hotspot/share/runtime/arguments.cpp
@@ -553,6 +553,7 @@ static SpecialFlag const special_jvm_flags[] = {
   { "ParallelRefProcEnabled",       JDK_Version::jdk(26),  JDK_Version::jdk(27), JDK_Version::jdk(28) },
   { "ParallelRefProcBalancingEnabled", JDK_Version::jdk(26),  JDK_Version::jdk(27), JDK_Version::jdk(28) },
   { "MaxRAM",                       JDK_Version::jdk(26),  JDK_Version::jdk(27), JDK_Version::jdk(28) },
+  { "NewSizeThreadIncrease",        JDK_Version::undefined(), JDK_Version::jdk(27), JDK_Version::jdk(28) },
 
 #ifdef ASSERT
   { "DummyObsoleteTestFlag",        JDK_Version::undefined(), JDK_Version::jdk(18), JDK_Version::undefined() },
diff --git a/test/hotspot/jtreg/gc/arguments/TestNewSizeThreadIncrease.java b/test/hotspot/jtreg/gc/arguments/TestNewSizeThreadIncrease.java
deleted file mode 100644
index f885ef7e462..00000000000
--- a/test/hotspot/jtreg/gc/arguments/TestNewSizeThreadIncrease.java
+++ /dev/null
@@ -1,127 +0,0 @@
-/*
- * Copyright (c) 2015, 2025, Oracle and/or its affiliates. All rights reserved.
- * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
- *
- * This code is free software; you can redistribute it and/or modify it
- * under the terms of the GNU General Public License version 2 only, as
- * published by the Free Software Foundation.
- *
- * This code is distributed in the hope that it will be useful, but WITHOUT
- * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
- * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
- * version 2 for more details (a copy is included in the LICENSE file that
- * accompanied this code).
- *
- * You should have received a copy of the GNU General Public License version
- * 2 along with this work; if not, write to the Free Software Foundation,
- * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
- *
- * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
- * or visit www.oracle.com if you need additional information or have any
- * questions.
- */
-
-package gc.arguments;
-
-/*
- * @test TestNewSizeThreadIncrease
- * @bug 8144527
- * @summary Tests argument processing for NewSizeThreadIncrease
- * @library /test/lib
- * @library /
- * @requires vm.gc.Serial
- * @requires test.thread.factory == null
- * @modules java.base/jdk.internal.misc
- *          java.management
- * @run driver gc.arguments.TestNewSizeThreadIncrease
- */
-
-
-import jdk.test.lib.Platform;
-import jdk.test.lib.process.OutputAnalyzer;
-
-// Range of NewSizeThreadIncrease is 0 ~ max_uintx.
-// Total of 5 threads will be created (1 GCTest thread and 4 TestThread).
-public class TestNewSizeThreadIncrease {
-  static final String VALID_VALUE = "2097152"; // 2MB
-
-  // This value will make an overflow of 'thread count * NewSizeThreadIncrease' at DefNewGeneration::compute_new_size().
-  // = (max_uintx / 5) + 1, = (18446744073709551615 / 5) + 1
-  static String INVALID_VALUE_1 = "3689348814741910324";
-
-  // This string is contained when compute_new_size() expands or shrinks.
-  static final String LOG_NEWSIZE_CHANGED = "New generation size ";
-
-  public static void main(String[] args) throws Exception {
-    if (Platform.is32bit()) {
-      // (max_uintx / 5) + 1, 4294967295/5 + 1
-      INVALID_VALUE_1 = "858993460";
-    }
-
-    // New size will be applied as NewSizeThreadIncrease is small enough to expand.
-    runNewSizeThreadIncreaseTest(VALID_VALUE, true);
-
-    // New size will be ignored as 'thread count * NewSizeThreadIncrease' overflows.
-    runNewSizeThreadIncreaseTest(INVALID_VALUE_1, false);
-  }
-
-  static void runNewSizeThreadIncreaseTest(String expectedValue, boolean isNewsizeChanged) throws Exception {
-    OutputAnalyzer output = GCArguments.executeLimitedTestJava("-XX:+UseSerialGC",
-                                                               "-Xms96M",
-                                                               "-Xmx128M",
-                                                               "-XX:NewRatio=2",
-                                                               "-Xlog:gc+heap+ergo=debug",
-                                                               "-XX:NewSizeThreadIncrease="+expectedValue,
-                                                               GCTest.class.getName());
-
-    output.shouldHaveExitValue(0);
-
-    if (isNewsizeChanged) {
-      output.shouldContain(LOG_NEWSIZE_CHANGED);
-    } else {
-      output.shouldNotContain(LOG_NEWSIZE_CHANGED);
-    }
-  }
-
-  static class GCTest {
-
-    static final int MAX_THREADS_COUNT = 4;
-    static TestThread threads[] = new TestThread[MAX_THREADS_COUNT];
-
-    public static void main(String[] args) {
-
-      System.out.println("Creating garbage");
-
-      for (int i=0; i<MAX_THREADS_COUNT; i++) {
-        threads[i] = new TestThread();
-        threads[i].start();
-      }
-
-      System.gc();
-
-      for (int i=0; i<MAX_THREADS_COUNT; i++) {
-        threads[i].stopRunning();
-      }
-
-      System.out.println("Done");
-    }
-
-    private static class TestThread extends Thread {
-
-      volatile boolean isRunning = true;
-
-      public void run() {
-        while (isRunning == true) {
-          try {
-            Thread.sleep(10);
-          } catch (Throwable t) {
-          }
-        }
-      }
-
-      public void stopRunning() {
-        isRunning = false;
-      }
-    }
-  }
-}
diff --git a/test/hotspot/jtreg/runtime/CommandLine/OptionsValidation/common/optionsvalidation/JVMOptionsUtils.java b/test/hotspot/jtreg/runtime/CommandLine/OptionsValidation/common/optionsvalidation/JVMOptionsUtils.java
index ef74dc41846..617bf910108 100644
--- a/test/hotspot/jtreg/runtime/CommandLine/OptionsValidation/common/optionsvalidation/JVMOptionsUtils.java
+++ b/test/hotspot/jtreg/runtime/CommandLine/OptionsValidation/common/optionsvalidation/JVMOptionsUtils.java
@@ -218,9 +218,6 @@ public class JVMOptionsUtils {
                 option.addPrepend("-XX:+VerifyBeforeGC");
                 option.addPrepend("-XX:+VerifyAfterGC");
                 break;
-            case "NewSizeThreadIncrease":
-                option.addPrepend("-XX:+UseSerialGC");
-                break;
             case "SharedBaseAddress":
             case "SharedSymbolTableBucketSize":
                 option.addPrepend("-XX:+UnlockDiagnosticVMOptions");

From 2fc7bdcbd4d0f5888a130ab4f54fac9faec241a1 Mon Sep 17 00:00:00 2001
From: Kerem Kat <krk@openjdk.org>
Date: Mon, 9 Mar 2026 11:43:36 +0000
Subject: [PATCH 095/655] 8379411: Use TestFramework scenarios in 837841

Reviewed-by: qamai, dfenacci, chagedorn
---
 .../compiler/c2/gvn/MissedURShiftIAddILShiftIdeal.java | 10 +++++++---
 1 file changed, 7 insertions(+), 3 deletions(-)

diff --git a/test/hotspot/jtreg/compiler/c2/gvn/MissedURShiftIAddILShiftIdeal.java b/test/hotspot/jtreg/compiler/c2/gvn/MissedURShiftIAddILShiftIdeal.java
index a1f4f011466..dd446d8bb25 100644
--- a/test/hotspot/jtreg/compiler/c2/gvn/MissedURShiftIAddILShiftIdeal.java
+++ b/test/hotspot/jtreg/compiler/c2/gvn/MissedURShiftIAddILShiftIdeal.java
@@ -24,6 +24,7 @@ package compiler.c2.gvn;
 
 import compiler.lib.ir_framework.*;
 import jdk.test.lib.Asserts;
+import jdk.test.lib.Platform;
 import jdk.test.lib.Utils;
 import java.util.Random;
 
@@ -35,15 +36,18 @@ import java.util.Random;
  *          regardless of Add input order, i.e. it is commutative w.r.t. the addition.
  * @library /test/lib /
  * @run driver ${test.main.class}
- * @run driver ${test.main.class} -XX:+IgnoreUnrecognizedVMOptions -XX:+UnlockDiagnosticVMOptions
- *              -XX:VerifyIterativeGVN=1110 -Xbatch -XX:CompileCommand=compileonly,${test.main.class}::*
  */
 public class MissedURShiftIAddILShiftIdeal {
 
     private static final Random RANDOM = Utils.getRandomInstance();
 
     public static void main(String[] args) {
-        TestFramework.run();
+        var framework = new TestFramework();
+        framework.addScenarios(new Scenario(0));
+        if (Platform.isDebugBuild()) {
+            framework.addScenarios(new Scenario(1, "-XX:+IgnoreUnrecognizedVMOptions", "-XX:VerifyIterativeGVN=1110"));
+        }
+        framework.start();
     }
 
     @Run(test = {"testI", "testICommuted", "testIComputedY",

From e69fb7765af995be121bd0d7573a204312436183 Mon Sep 17 00:00:00 2001
From: April <me@aprl.pet>
Date: Mon, 9 Mar 2026 11:52:42 +0000
Subject: [PATCH 096/655] 8378177: AllowExtshm flag cleanup on AIX

Reviewed-by: mdoerr, stuefe
---
 src/hotspot/os/aix/globals_aix.hpp | 10 ---------
 src/hotspot/os/aix/os_aix.cpp      | 34 +++---------------------------
 src/hotspot/os/aix/os_aix.hpp      | 11 ----------
 3 files changed, 3 insertions(+), 52 deletions(-)

diff --git a/src/hotspot/os/aix/globals_aix.hpp b/src/hotspot/os/aix/globals_aix.hpp
index 473d7759063..adc189666ef 100644
--- a/src/hotspot/os/aix/globals_aix.hpp
+++ b/src/hotspot/os/aix/globals_aix.hpp
@@ -37,16 +37,6 @@
                          range,                                                     \
                          constraint)                                                \
                                                                                     \
-  /* Whether to allow the VM to run if EXTSHM=ON. EXTSHM is an environment */       \
-  /* variable used on AIX to activate certain hacks which allow more shm segments */\
-  /* for 32bit processes. For 64bit processes, it is pointless and may have */      \
-  /* harmful side effects (e.g. for some reasonn prevents allocation of 64k pages */\
-  /* via shmctl). */                                                                \
-  /* Per default we quit with an error if that variable is found; for certain */    \
-  /* customer scenarios, we may want to be able to run despite that variable. */    \
-  product(bool, AllowExtshm, false, DIAGNOSTIC,                                     \
-          "Allow VM to run with EXTSHM=ON.")                                        \
-                                                                                    \
   /*  Maximum expected size of the data segment. That correlates with the      */   \
   /*  maximum C Heap consumption we expect.                                    */   \
   /*  We need to leave "breathing space" for the data segment when             */   \
diff --git a/src/hotspot/os/aix/os_aix.cpp b/src/hotspot/os/aix/os_aix.cpp
index af743dc7484..7c08d6de2db 100644
--- a/src/hotspot/os/aix/os_aix.cpp
+++ b/src/hotspot/os/aix/os_aix.cpp
@@ -126,7 +126,6 @@ int mread_real_time(timebasestruct_t *t, size_t size_of_timebasestruct_t);
 
 // for multipage initialization error analysis (in 'g_multipage_error')
 #define ERROR_MP_OS_TOO_OLD                          100
-#define ERROR_MP_EXTSHM_ACTIVE                       101
 #define ERROR_MP_VMGETINFO_FAILED                    102
 #define ERROR_MP_VMGETINFO_CLAIMS_NO_SUPPORT_FOR_64K 103
 
@@ -178,9 +177,6 @@ uint32_t  os::Aix::_os_version = 0;
 // -1 = uninitialized, 0 - no, 1 - yes
 int       os::Aix::_xpg_sus_mode = -1;
 
-// -1 = uninitialized, 0 - no, 1 - yes
-int       os::Aix::_extshm = -1;
-
 ////////////////////////////////////////////////////////////////////////////////
 // local variables
 
@@ -1195,13 +1191,6 @@ void os::print_memory_info(outputStream* st) {
   const char* const ldr_cntrl = ::getenv("LDR_CNTRL");
   st->print_cr("  LDR_CNTRL=%s.", ldr_cntrl ? ldr_cntrl : "<unset>");
 
-  // Print out EXTSHM because it is an unsupported setting.
-  const char* const extshm = ::getenv("EXTSHM");
-  st->print_cr("  EXTSHM=%s.", extshm ? extshm : "<unset>");
-  if ( (strcmp(extshm, "on") == 0) || (strcmp(extshm, "ON") == 0) ) {
-    st->print_cr("  *** Unsupported! Please remove EXTSHM from your environment! ***");
-  }
-
   // Print out AIXTHREAD_GUARDPAGES because it affects the size of pthread stacks.
   const char* const aixthread_guardpages = ::getenv("AIXTHREAD_GUARDPAGES");
   st->print_cr("  AIXTHREAD_GUARDPAGES=%s.",
@@ -2133,8 +2122,6 @@ void os::init(void) {
 
   // datapsize = 64k. Data segment, thread stacks are 64k paged.
   // This normally means that we can allocate 64k pages dynamically.
-  // (There is one special case where this may be false: EXTSHM=on.
-  // but we decided to not support that mode).
   assert0(g_multipage_support.can_use_64K_pages || g_multipage_support.can_use_64K_mmap_pages);
   set_page_size(64*K);
 
@@ -2543,28 +2530,13 @@ void os::Aix::initialize_os_info() {
 void os::Aix::scan_environment() {
 
   char* p;
-  int rc;
 
-  // Warn explicitly if EXTSHM=ON is used. That switch changes how
-  // System V shared memory behaves. One effect is that page size of
-  // shared memory cannot be change dynamically, effectivly preventing
-  // large pages from working.
-  // This switch was needed on AIX 32bit, but on AIX 64bit the general
-  // recommendation is (in OSS notes) to switch it off.
+  // Reject EXTSHM=ON. That switch changes how System V shared memory behaves
+  // and prevents allocation of 64k pages for the heap.
   p = ::getenv("EXTSHM");
   trcVerbose("EXTSHM=%s.", p ? p : "<unset>");
   if (p && strcasecmp(p, "ON") == 0) {
-    _extshm = 1;
-    log_warning(os)("*** Unsupported mode! Please remove EXTSHM from your environment! ***");
-    if (!AllowExtshm) {
-      // We allow under certain conditions the user to continue. However, we want this
-      // to be a fatal error by default. On certain AIX systems, leaving EXTSHM=ON means
-      // that the VM is not able to allocate 64k pages for the heap.
-      // We do not want to run with reduced performance.
-      vm_exit_during_initialization("EXTSHM is ON. Please remove EXTSHM from your environment.");
-    }
-  } else {
-    _extshm = 0;
+    vm_exit_during_initialization("EXTSHM is ON. Please remove EXTSHM from your environment.");
   }
 
   // SPEC1170 behaviour: will change the behaviour of a number of POSIX APIs.
diff --git a/src/hotspot/os/aix/os_aix.hpp b/src/hotspot/os/aix/os_aix.hpp
index a30e2077fc2..e21d2cf81bb 100644
--- a/src/hotspot/os/aix/os_aix.hpp
+++ b/src/hotspot/os/aix/os_aix.hpp
@@ -49,11 +49,6 @@ class os::Aix {
   //  1 - SPEC1170 requested (XPG_SUS_ENV is ON)
   static int _xpg_sus_mode;
 
-  // -1 = uninitialized,
-  //  0 - EXTSHM=OFF or not set
-  //  1 - EXTSHM=ON
-  static int _extshm;
-
   static bool available_memory(physical_memory_size_type& value);
   static bool free_memory(physical_memory_size_type& value);
   static physical_memory_size_type physical_memory() { return _physical_memory; }
@@ -111,12 +106,6 @@ class os::Aix {
     return _xpg_sus_mode;
   }
 
-  // Returns true if EXTSHM=ON.
-  static bool extshm() {
-    assert(_extshm != -1, "not initialized");
-    return _extshm;
-  }
-
   // result struct for get_meminfo()
   struct meminfo_t {
 

From de47ffa92f6c4320eb1cc0e38894512487b98c71 Mon Sep 17 00:00:00 2001
From: Stefan Karlsson <stefank@openjdk.org>
Date: Mon, 9 Mar 2026 11:54:33 +0000
Subject: [PATCH 097/655] 8379394: Confine array dimension setting to the
 ArrayKlass constructor

Reviewed-by: coleenp, ayang
---
 src/hotspot/share/oops/arrayKlass.cpp     | 6 +++---
 src/hotspot/share/oops/arrayKlass.hpp     | 5 ++---
 src/hotspot/share/oops/objArrayKlass.cpp  | 3 +--
 src/hotspot/share/oops/typeArrayKlass.cpp | 2 +-
 src/hotspot/share/runtime/vmStructs.cpp   | 2 +-
 5 files changed, 8 insertions(+), 10 deletions(-)

diff --git a/src/hotspot/share/oops/arrayKlass.cpp b/src/hotspot/share/oops/arrayKlass.cpp
index 30a2bc5102a..8a73f58b46a 100644
--- a/src/hotspot/share/oops/arrayKlass.cpp
+++ b/src/hotspot/share/oops/arrayKlass.cpp
@@ -41,7 +41,7 @@
 #include "oops/oop.inline.hpp"
 #include "runtime/handles.inline.hpp"
 
-ArrayKlass::ArrayKlass() {
+ArrayKlass::ArrayKlass() : _dimension() {
   assert(CDSConfig::is_dumping_static_archive() || CDSConfig::is_using_archive(), "only for CDS");
 }
 
@@ -88,9 +88,9 @@ Method* ArrayKlass::uncached_lookup_method(const Symbol* name,
   return super()->uncached_lookup_method(name, signature, OverpassLookupMode::skip, private_mode);
 }
 
-ArrayKlass::ArrayKlass(Symbol* name, KlassKind kind) :
+ArrayKlass::ArrayKlass(int n, Symbol* name, KlassKind kind) :
   Klass(kind),
-  _dimension(1),
+  _dimension(n),
   _higher_dimension(nullptr),
   _lower_dimension(nullptr) {
   // Arrays don't add any new methods, so their vtable is the same size as
diff --git a/src/hotspot/share/oops/arrayKlass.hpp b/src/hotspot/share/oops/arrayKlass.hpp
index b9b100f18a8..738387c57b4 100644
--- a/src/hotspot/share/oops/arrayKlass.hpp
+++ b/src/hotspot/share/oops/arrayKlass.hpp
@@ -38,7 +38,7 @@ class ArrayKlass: public Klass {
  private:
   // If you add a new field that points to any metaspace object, you
   // must add this field to ArrayKlass::metaspace_pointers_do().
-  int      _dimension;         // This is n'th-dimensional array.
+  const int               _dimension;         // This is n'th-dimensional array.
   ObjArrayKlass* volatile _higher_dimension;  // Refers the (n+1)'th-dimensional array (if present).
   ArrayKlass* volatile    _lower_dimension;   // Refers the (n-1)'th-dimensional array (if present).
 
@@ -46,7 +46,7 @@ class ArrayKlass: public Klass {
   // Constructors
   // The constructor with the Symbol argument does the real array
   // initialization, the other is a dummy
-  ArrayKlass(Symbol* name, KlassKind kind);
+  ArrayKlass(int n, Symbol* name, KlassKind kind);
   ArrayKlass();
 
  public:
@@ -63,7 +63,6 @@ class ArrayKlass: public Klass {
 
   // Instance variables
   int dimension() const                 { return _dimension;      }
-  void set_dimension(int dimension)     { _dimension = dimension; }
 
   ObjArrayKlass* higher_dimension() const     { return _higher_dimension; }
   inline ObjArrayKlass* higher_dimension_acquire() const; // load with acquire semantics
diff --git a/src/hotspot/share/oops/objArrayKlass.cpp b/src/hotspot/share/oops/objArrayKlass.cpp
index 2bbe898adbd..fccd02f14e6 100644
--- a/src/hotspot/share/oops/objArrayKlass.cpp
+++ b/src/hotspot/share/oops/objArrayKlass.cpp
@@ -120,8 +120,7 @@ ObjArrayKlass* ObjArrayKlass::allocate_objArray_klass(ClassLoaderData* loader_da
   return oak;
 }
 
-ObjArrayKlass::ObjArrayKlass(int n, Klass* element_klass, Symbol* name) : ArrayKlass(name, Kind) {
-  set_dimension(n);
+ObjArrayKlass::ObjArrayKlass(int n, Klass* element_klass, Symbol* name) : ArrayKlass(n, name, Kind) {
   set_element_klass(element_klass);
 
   Klass* bk;
diff --git a/src/hotspot/share/oops/typeArrayKlass.cpp b/src/hotspot/share/oops/typeArrayKlass.cpp
index bdf37c7db49..7dbea9ce475 100644
--- a/src/hotspot/share/oops/typeArrayKlass.cpp
+++ b/src/hotspot/share/oops/typeArrayKlass.cpp
@@ -78,7 +78,7 @@ u2 TypeArrayKlass::compute_modifier_flags() const {
   return JVM_ACC_ABSTRACT | JVM_ACC_FINAL | JVM_ACC_PUBLIC;
 }
 
-TypeArrayKlass::TypeArrayKlass(BasicType type, Symbol* name) : ArrayKlass(name, Kind) {
+TypeArrayKlass::TypeArrayKlass(BasicType type, Symbol* name) : ArrayKlass(1, name, Kind) {
   set_layout_helper(array_layout_helper(type));
   assert(is_array_klass(), "sanity");
   assert(is_typeArray_klass(), "sanity");
diff --git a/src/hotspot/share/runtime/vmStructs.cpp b/src/hotspot/share/runtime/vmStructs.cpp
index a54fbc7e8ab..9796b990b2a 100644
--- a/src/hotspot/share/runtime/vmStructs.cpp
+++ b/src/hotspot/share/runtime/vmStructs.cpp
@@ -166,7 +166,7 @@
   volatile_nonstatic_field(oopDesc,            _metadata._klass,                              Klass*)                                \
   volatile_nonstatic_field(oopDesc,            _metadata._compressed_klass,                   narrowKlass)                           \
   static_field(BarrierSet,                     _barrier_set,                                  BarrierSet*)                           \
-  nonstatic_field(ArrayKlass,                  _dimension,                                    int)                                   \
+  nonstatic_field(ArrayKlass,                  _dimension,                                    const int)                             \
   volatile_nonstatic_field(ArrayKlass,         _higher_dimension,                             ObjArrayKlass*)                        \
   volatile_nonstatic_field(ArrayKlass,         _lower_dimension,                              ArrayKlass*)                           \
   nonstatic_field(BSMAttributeEntries,         _offsets,                                      Array<u4>*)                            \

From ba0708caddc70d5567dc20c3c58ddae6c275de4d Mon Sep 17 00:00:00 2001
From: Christian Stein <cstein@openjdk.org>
Date: Mon, 9 Mar 2026 12:08:14 +0000
Subject: [PATCH 098/655] 8379331: Remove modular transition support settings
 from TEST.ROOT files

Reviewed-by: jvernee, alanb
---
 test/docs/TEST.ROOT          | 5 -----
 test/hotspot/jtreg/TEST.ROOT | 5 -----
 test/jaxp/TEST.ROOT          | 5 -----
 test/jdk/TEST.ROOT           | 5 -----
 test/langtools/TEST.ROOT     | 5 -----
 5 files changed, 25 deletions(-)

diff --git a/test/docs/TEST.ROOT b/test/docs/TEST.ROOT
index 9a7e66b631c..11cba9c1c88 100644
--- a/test/docs/TEST.ROOT
+++ b/test/docs/TEST.ROOT
@@ -40,11 +40,6 @@ groups=TEST.groups
 # Minimum jtreg version
 requiredVersion=8.2.1+1
 
-# Use new module options
-useNewOptions=true
-
-# Use --patch-module instead of -Xmodule:
-useNewPatchModule=true
 
 # Path to libraries in the topmost test directory. This is needed so @library
 # does not need ../../ notation to reach them
diff --git a/test/hotspot/jtreg/TEST.ROOT b/test/hotspot/jtreg/TEST.ROOT
index d1c72b9768c..2a3d3eebbbd 100644
--- a/test/hotspot/jtreg/TEST.ROOT
+++ b/test/hotspot/jtreg/TEST.ROOT
@@ -113,8 +113,3 @@ requiredVersion=8.2.1+1
 # does not need ../../../ notation to reach them
 external.lib.roots = ../../../
 
-# Use new module options
-useNewOptions=true
-
-# Use --patch-module instead of -Xmodule:
-useNewPatchModule=true
diff --git a/test/jaxp/TEST.ROOT b/test/jaxp/TEST.ROOT
index aff3b769830..ddf29839e20 100644
--- a/test/jaxp/TEST.ROOT
+++ b/test/jaxp/TEST.ROOT
@@ -29,8 +29,3 @@ requiredVersion=8.2.1+1
 # does not need ../../ notation to reach them
 external.lib.roots = ../../
 
-# Use new module options
-useNewOptions=true
-
-# Use --patch-module instead of -Xmodule:
-useNewPatchModule=true
diff --git a/test/jdk/TEST.ROOT b/test/jdk/TEST.ROOT
index cc571deab20..0e339d29cea 100644
--- a/test/jdk/TEST.ROOT
+++ b/test/jdk/TEST.ROOT
@@ -129,8 +129,3 @@ requiredVersion=8.2.1+1
 # does not need ../../ notation to reach them
 external.lib.roots = ../../
 
-# Use new module options
-useNewOptions=true
-
-# Use --patch-module instead of -Xmodule:
-useNewPatchModule=true
diff --git a/test/langtools/TEST.ROOT b/test/langtools/TEST.ROOT
index 434cf91b0ec..c76f99d1396 100644
--- a/test/langtools/TEST.ROOT
+++ b/test/langtools/TEST.ROOT
@@ -17,11 +17,6 @@ groups=TEST.groups
 # Minimum jtreg version
 requiredVersion=8.2.1+1
 
-# Use new module options
-useNewOptions=true
-
-# Use --patch-module instead of -Xmodule:
-useNewPatchModule=true
 
 # Path to libraries in the topmost test directory. This is needed so @library
 # does not need ../../ notation to reach them

From 82430a7666f7ad876c023699d91947d127dd5db3 Mon Sep 17 00:00:00 2001
From: Maksim Gaidideev <maksim.gaidideev@oracle.com>
Date: Mon, 9 Mar 2026 12:46:43 +0000
Subject: [PATCH 099/655] 8360121: Add -XX:+StressLoopPeeling to CTW

Reviewed-by: mchevalier, chagedorn
---
 .../testlibrary/ctw/src/sun/hotspot/tools/ctw/CtwRunner.java   | 3 ++-
 1 file changed, 2 insertions(+), 1 deletion(-)

diff --git a/test/hotspot/jtreg/testlibrary/ctw/src/sun/hotspot/tools/ctw/CtwRunner.java b/test/hotspot/jtreg/testlibrary/ctw/src/sun/hotspot/tools/ctw/CtwRunner.java
index 11694f72837..d9facb13078 100644
--- a/test/hotspot/jtreg/testlibrary/ctw/src/sun/hotspot/tools/ctw/CtwRunner.java
+++ b/test/hotspot/jtreg/testlibrary/ctw/src/sun/hotspot/tools/ctw/CtwRunner.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2017, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2017, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -319,6 +319,7 @@ public class CtwRunner {
                 "-XX:+StressGCM",
                 "-XX:+StressIGVN",
                 "-XX:+StressCCP",
+                "-XX:+StressLoopPeeling",
                 "-XX:+StressMacroExpansion",
                 "-XX:+StressMacroElimination",
                 "-XX:+StressIncrementalInlining",

From e018cd60a09c37a1be749e7b45c25022e02f81c7 Mon Sep 17 00:00:00 2001
From: David Beaumont <david.beaumont@oracle.com>
Date: Mon, 9 Mar 2026 13:07:10 +0000
Subject: [PATCH 100/655] 8379441: Refactor jaxp/javax catalog tests to use
 JUnit

Reviewed-by: joehw, dfuchs
---
 .../catalog/CatalogReferCircularityTest.java  | 39 ++++++------
 .../catalog/DefaultFeaturesTest.java          | 32 +++-------
 .../functional/catalog/DeferFeatureTest.java  | 63 +++++++++----------
 .../catalog/DelegatePublicTest.java           | 26 ++++----
 .../catalog/DelegateSystemTest.java           | 26 ++++----
 .../functional/catalog/DelegateUriTest.java   | 28 ++++-----
 .../jaxp/functional/catalog/GroupTest.java    | 32 +++++-----
 .../functional/catalog/LoadCatalogTest.java   | 46 +++++++-------
 .../functional/catalog/NextCatalogTest.java   | 34 +++++-----
 .../functional/catalog/NormalizationTest.java | 31 ++++-----
 .../functional/catalog/PreferFeatureTest.java | 30 ++++-----
 .../jaxp/functional/catalog/PreferTest.java   | 18 +++---
 .../functional/catalog/PublicFamilyTest.java  | 19 +++---
 .../jaxp/functional/catalog/PublicTest.java   | 28 +++++----
 .../catalog/ResolveFeatureTest.java           | 39 +++++++-----
 .../functional/catalog/RewriteSystemTest.java | 26 ++++----
 .../functional/catalog/RewriteUriTest.java    | 28 +++++----
 .../catalog/SpecifyCatalogTest.java           | 24 ++++---
 .../functional/catalog/SystemFamilyTest.java  | 26 ++++----
 .../functional/catalog/SystemSuffixTest.java  | 26 ++++----
 .../jaxp/functional/catalog/SystemTest.java   | 28 +++++----
 .../functional/catalog/UriFamilyTest.java     | 28 +++++----
 .../functional/catalog/UriSuffixTest.java     | 28 +++++----
 .../xml/jaxp/functional/catalog/UriTest.java  | 30 ++++-----
 .../functional/catalog/UrnUnwrappingTest.java | 18 +++---
 .../catalog/ValidateCatalogTest.java          | 27 ++++----
 .../jaxp/libs/catalog/CatalogTestUtils.java   | 16 ++---
 .../jaxp/libs/catalog/ResolutionChecker.java  | 52 ++++-----------
 28 files changed, 412 insertions(+), 436 deletions(-)

diff --git a/test/jaxp/javax/xml/jaxp/functional/catalog/CatalogReferCircularityTest.java b/test/jaxp/javax/xml/jaxp/functional/catalog/CatalogReferCircularityTest.java
index 0447270d99a..c88827c1a39 100644
--- a/test/jaxp/javax/xml/jaxp/functional/catalog/CatalogReferCircularityTest.java
+++ b/test/jaxp/javax/xml/jaxp/functional/catalog/CatalogReferCircularityTest.java
@@ -23,18 +23,20 @@
 
 package catalog;
 
-import static catalog.CatalogTestUtils.catalogResolver;
+import org.junit.jupiter.api.Assertions;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.ValueSource;
 
 import javax.xml.catalog.CatalogException;
+import javax.xml.catalog.CatalogResolver;
 
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
+import static catalog.CatalogTestUtils.catalogResolver;
 
 /*
  * @test
  * @bug 8077931
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm catalog.CatalogReferCircularityTest
+ * @run junit/othervm catalog.CatalogReferCircularityTest
  * @summary Via nextCatalog entry, the catalog reference chain may be
  *          a (partial) closed circuit. For instance, a catalog may use itself
  *          as an additional catalog specified in its own nextCatalog entry.
@@ -42,22 +44,19 @@ import org.testng.annotations.Test;
  */
 public class CatalogReferCircularityTest {
 
-    @Test(dataProvider = "catalogName",
-            expectedExceptions = CatalogException.class)
+    @ParameterizedTest
+    @ValueSource(strings={
+            // This catalog defines itself as next catalog.
+            "catalogReferCircle-itself.xml",
+
+            // This catalog defines catalogReferCircle-right.xml as its next
+            // catalog. And catalogReferCircle-right.xml also defines
+            // catalogReferCircle-left.xml as its next catalog, too.
+            "catalogReferCircle-left.xml" })
     public void testReferCircularity(String catalogFile) {
-        catalogResolver(catalogFile).resolveEntity(null,
-                "http://remote/dtd/ghost/docGhost.dtd");
-    }
-
-    @DataProvider(name = "catalogName")
-    public Object[][] catalogName() {
-        return new Object[][] {
-                // This catalog defines itself as next catalog.
-                { "catalogReferCircle-itself.xml" },
-
-                // This catalog defines catalogReferCircle-right.xml as its next
-                // catalog. And catalogReferCircle-right.xml also defines
-                // catalogReferCircle-left.xml as its next catalog, too.
-                { "catalogReferCircle-left.xml" } };
+        CatalogResolver resolver = catalogResolver(catalogFile);
+        Assertions.assertThrows(
+                CatalogException.class,
+                () -> resolver.resolveEntity(null, "http://remote/dtd/ghost/docGhost.dtd"));
     }
 }
diff --git a/test/jaxp/javax/xml/jaxp/functional/catalog/DefaultFeaturesTest.java b/test/jaxp/javax/xml/jaxp/functional/catalog/DefaultFeaturesTest.java
index d76b56d7510..f17aa04ac76 100644
--- a/test/jaxp/javax/xml/jaxp/functional/catalog/DefaultFeaturesTest.java
+++ b/test/jaxp/javax/xml/jaxp/functional/catalog/DefaultFeaturesTest.java
@@ -23,42 +23,30 @@
 
 package catalog;
 
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
+
 import javax.xml.catalog.CatalogFeatures;
 import javax.xml.catalog.CatalogFeatures.Feature;
 
-import org.testng.Assert;
-import org.testng.annotations.BeforeClass;
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
+import static org.junit.jupiter.api.Assertions.assertEquals;
 
 /*
  * @test
  * @bug 8077931
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm catalog.DefaultFeaturesTest
+ * @run junit/othervm catalog.DefaultFeaturesTest
  * @summary This case tests if the default feature values are expected.
  */
 public class DefaultFeaturesTest {
-
-    private CatalogFeatures defaultFeature;
-
-    @BeforeClass
-    public void init() {
-        defaultFeature = CatalogFeatures.defaults();
-    }
-
-    @Test(dataProvider="feature-value")
+    @ParameterizedTest
+    @MethodSource("defaultFeaturesData")
     public void testDefaultFeatures(Feature feature, String expected) {
-        String featureValue = defaultFeature.get(feature);
-        if (expected != null) {
-            Assert.assertEquals(featureValue, expected);
-        } else {
-            Assert.assertNull(featureValue);
-        }
+        CatalogFeatures defaultFeature = CatalogFeatures.defaults();
+        assertEquals(expected, defaultFeature.get(feature));
     }
 
-    @DataProvider(name = "feature-value")
-    public Object[][] data() {
+    public static Object[][] defaultFeaturesData() {
         return new Object[][] {
                 { Feature.FILES, null },
                 { Feature.PREFER, CatalogTestUtils.PREFER_PUBLIC },
diff --git a/test/jaxp/javax/xml/jaxp/functional/catalog/DeferFeatureTest.java b/test/jaxp/javax/xml/jaxp/functional/catalog/DeferFeatureTest.java
index 2d5771557ad..36335cb586d 100644
--- a/test/jaxp/javax/xml/jaxp/functional/catalog/DeferFeatureTest.java
+++ b/test/jaxp/javax/xml/jaxp/functional/catalog/DeferFeatureTest.java
@@ -23,42 +23,43 @@
 
 package catalog;
 
-import static catalog.CatalogTestUtils.DEFER_FALSE;
-import static catalog.CatalogTestUtils.DEFER_TRUE;
-import static catalog.CatalogTestUtils.getCatalogPath;
-import static javax.xml.catalog.CatalogFeatures.Feature.DEFER;
-
-import java.lang.reflect.Method;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
 
 import javax.xml.catalog.Catalog;
 import javax.xml.catalog.CatalogException;
 import javax.xml.catalog.CatalogFeatures;
 import javax.xml.catalog.CatalogManager;
 import javax.xml.catalog.CatalogResolver;
+import java.lang.reflect.Method;
 
-import org.testng.Assert;
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
+import static catalog.CatalogTestUtils.DEFER_FALSE;
+import static catalog.CatalogTestUtils.DEFER_TRUE;
+import static catalog.CatalogTestUtils.getCatalogPath;
+import static javax.xml.catalog.CatalogFeatures.Feature.DEFER;
+import static org.junit.jupiter.api.Assertions.assertEquals;
 
 /*
  * @test
  * @bug 8077931 8176405
  * @library /javax/xml/jaxp/libs
  * @modules java.xml/javax.xml.catalog:open
- * @run testng/othervm catalog.DeferFeatureTest
+ * @run junit/othervm catalog.DeferFeatureTest
  * @summary This case tests whether the catalogs specified in delegateSystem,
  *          delegatePublic, delegateURI and nextCatalog entries are used lazily
  *          in resolution via defer feature.
  */
 public class DeferFeatureTest {
 
-    @Test(dataProvider = "catalog-countOfLoadedCatalogFile")
+    @ParameterizedTest
+    @MethodSource("deferData")
     public void testDeferFeature(Catalog catalog, int catalogCount)
             throws Exception {
-        Assert.assertEquals(loadedCatalogCount(catalog), catalogCount);
+        assertEquals(catalogCount, loadedCatalogCount(catalog));
     }
 
-    @Test(dataProvider = "testDeferFeatureByResolve")
+    @ParameterizedTest
+    @MethodSource("deferByResolveData")
     public void testDeferFeatureByResolve(Catalog catalog, int catalogCount)
             throws Exception {
         CatalogResolver cr = createResolver(catalog);
@@ -67,41 +68,39 @@ public class DeferFeatureTest {
             cr.resolveEntity("-//REMOTE//DTD ALICE DOCALICE", "http://remote/dtd/alice/");
         } catch (CatalogException ce) {}
 
-        Assert.assertEquals(loadedCatalogCount(catalog), catalogCount);
+        assertEquals(catalogCount, loadedCatalogCount(catalog));
     }
 
-    @DataProvider(name = "catalog-countOfLoadedCatalogFile")
-    public Object[][] data() {
-        return new Object[][]{
-            // By default, alternative catalogs are not loaded.
-            {createCatalog(CatalogFeatures.defaults()), 1},
-            // Alternative catalogs are not loaded when DEFER is set to true.
-            {createCatalog(createDeferFeature(DEFER_TRUE)), 1},
-            // The 3 alternative catalogs are pre-loaded along with the parent
-            //when DEFER is set to false.
-            {createCatalog(createDeferFeature(DEFER_FALSE)), 4}};
+    public static Object[][] deferData() {
+        return new Object[][] {
+                // By default, alternative catalogs are not loaded.
+                { createCatalog(CatalogFeatures.defaults()), 1 },
+                // Alternative catalogs are not loaded when DEFER is set to true.
+                { createCatalog(createDeferFeature(DEFER_TRUE)), 1 },
+                // The 3 alternative catalogs are pre-loaded along with the parent
+                //when DEFER is set to false.
+                { createCatalog(createDeferFeature(DEFER_FALSE)), 4 } };
     }
 
-    @DataProvider(name = "testDeferFeatureByResolve")
-    public Object[][] getData() {
-        return new Object[][]{
-            {createCatalog(createDeferFeature(DEFER_TRUE)), 4}
+    public static Object[][] deferByResolveData() {
+        return new Object[][] {
+                { createCatalog(createDeferFeature(DEFER_TRUE)), 4 }
         };
     }
 
-    private CatalogFeatures createDeferFeature(String defer) {
+    private static CatalogFeatures createDeferFeature(String defer) {
         return CatalogFeatures.builder().with(DEFER, defer).build();
     }
 
-    private Catalog createCatalog(CatalogFeatures feature) {
+    private static Catalog createCatalog(CatalogFeatures feature) {
         return CatalogManager.catalog(feature, getCatalogPath("deferFeature.xml"));
     }
 
-    private CatalogResolver createResolver(Catalog catalog) {
+    private static CatalogResolver createResolver(Catalog catalog) {
         return CatalogManager.catalogResolver(catalog);
     }
 
-    private int loadedCatalogCount(Catalog catalog) throws Exception {
+    private static int loadedCatalogCount(Catalog catalog) throws Exception {
         Method method = catalog.getClass().getDeclaredMethod("loadedCatalogCount");
         method.setAccessible(true);
         return (int) method.invoke(catalog);
diff --git a/test/jaxp/javax/xml/jaxp/functional/catalog/DelegatePublicTest.java b/test/jaxp/javax/xml/jaxp/functional/catalog/DelegatePublicTest.java
index 43c6bf42f44..579140825c2 100644
--- a/test/jaxp/javax/xml/jaxp/functional/catalog/DelegatePublicTest.java
+++ b/test/jaxp/javax/xml/jaxp/functional/catalog/DelegatePublicTest.java
@@ -23,32 +23,32 @@
 
 package catalog;
 
-import static catalog.CatalogTestUtils.catalogResolver;
-import static catalog.ResolutionChecker.checkPubIdResolution;
-import static catalog.ResolutionChecker.expectExceptionOnPubId;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
 
 import javax.xml.catalog.CatalogException;
 import javax.xml.catalog.CatalogResolver;
 
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
+import static catalog.CatalogTestUtils.catalogResolver;
+import static catalog.ResolutionChecker.checkPubIdResolution;
+import static catalog.ResolutionChecker.expectExceptionOnPubId;
 
 /*
  * @test
  * @bug 8077931
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm catalog.DelegatePublicTest
+ * @run junit/othervm catalog.DelegatePublicTest
  * @summary Get matched URIs from DelegatePublic entries.
  */
 public class DelegatePublicTest {
 
-    @Test(dataProvider = "publicId-matchedUri")
+    @ParameterizedTest
+    @MethodSource("dataOnMatch")
     public void testMatch(String publicId, String matchedUri) {
         checkPubIdResolution(createResolver(), publicId, matchedUri);
     }
 
-    @DataProvider(name = "publicId-matchedUri")
-    public Object[][] dataOnMatch() {
+    public static Object[][] dataOnMatch() {
         return new Object[][] {
                 // The matched URI of the specified public id is defined in
                 // a delegate catalog file of the current catalog file.
@@ -71,15 +71,15 @@ public class DelegatePublicTest {
                         "http://local/base/dtd/carl/docCarlPub.dtd" } };
     }
 
-    @Test(dataProvider = "publicId-expectedExceptionClass")
+    @ParameterizedTest
+    @MethodSource("dataOnException")
     public void testException(String publicId,
             Class<? extends Throwable> expectedExceptionClass) {
         expectExceptionOnPubId(createResolver(), publicId,
                 expectedExceptionClass);
     }
 
-    @DataProvider(name = "publicId-expectedExceptionClass")
-    public Object[][] dataOnException() {
+    public static Object[][] dataOnException() {
         return new Object[][] {
                 // The matched delegatePublic entry of the specified public id
                 // defines a non-existing delegate catalog file. That should
@@ -93,7 +93,7 @@ public class DelegatePublicTest {
                         CatalogException.class } };
     }
 
-    private CatalogResolver createResolver() {
+    private static CatalogResolver createResolver() {
         return catalogResolver("delegatePublic.xml");
     }
 }
diff --git a/test/jaxp/javax/xml/jaxp/functional/catalog/DelegateSystemTest.java b/test/jaxp/javax/xml/jaxp/functional/catalog/DelegateSystemTest.java
index 554d23776f9..27da1105b2c 100644
--- a/test/jaxp/javax/xml/jaxp/functional/catalog/DelegateSystemTest.java
+++ b/test/jaxp/javax/xml/jaxp/functional/catalog/DelegateSystemTest.java
@@ -23,32 +23,32 @@
 
 package catalog;
 
-import static catalog.CatalogTestUtils.catalogResolver;
-import static catalog.ResolutionChecker.checkSysIdResolution;
-import static catalog.ResolutionChecker.expectExceptionOnSysId;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
 
 import javax.xml.catalog.CatalogException;
 import javax.xml.catalog.CatalogResolver;
 
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
+import static catalog.CatalogTestUtils.catalogResolver;
+import static catalog.ResolutionChecker.checkSysIdResolution;
+import static catalog.ResolutionChecker.expectExceptionOnSysId;
 
 /*
  * @test
  * @bug 8077931
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm catalog.DelegateSystemTest
+ * @run junit/othervm catalog.DelegateSystemTest
  * @summary Get matched URIs from delegateSystem entries.
  */
 public class DelegateSystemTest {
 
-    @Test(dataProvider = "systemId-matchedUri")
+    @ParameterizedTest
+    @MethodSource("dataOnMatch")
     public void testMatch(String systemId, String matchedUri) {
         checkSysIdResolution(createResolver(), systemId, matchedUri);
     }
 
-    @DataProvider(name = "systemId-matchedUri")
-    public Object[][] dataOnMatch() {
+    public static Object[][] dataOnMatch() {
         return new Object[][] {
                 // The matched URI of the specified system id is defined in
                 // a delegate catalog file of the current catalog file.
@@ -71,15 +71,15 @@ public class DelegateSystemTest {
                         "http://local/base/dtd/carl/docCarlDS.dtd"} };
     }
 
-    @Test(dataProvider = "systemId-expectedExceptionClass")
+    @ParameterizedTest
+    @MethodSource("dataOnException")
     public void testException(String systemId,
             Class<? extends Throwable> expectedExceptionClass) {
         expectExceptionOnSysId(createResolver(), systemId,
                 expectedExceptionClass);
     }
 
-    @DataProvider(name = "systemId-expectedExceptionClass")
-    public Object[][] dataOnException() {
+    public static Object[][] dataOnException() {
         return new Object[][] {
                 // The matched delegateSystem entry of the specified system id
                 // defines a non-existing delegate catalog file. That should
@@ -93,7 +93,7 @@ public class DelegateSystemTest {
                         CatalogException.class } };
     }
 
-    private CatalogResolver createResolver() {
+    private static CatalogResolver createResolver() {
         return catalogResolver("delegateSystem.xml");
     }
 }
diff --git a/test/jaxp/javax/xml/jaxp/functional/catalog/DelegateUriTest.java b/test/jaxp/javax/xml/jaxp/functional/catalog/DelegateUriTest.java
index 2a92149a730..0175a99f938 100644
--- a/test/jaxp/javax/xml/jaxp/functional/catalog/DelegateUriTest.java
+++ b/test/jaxp/javax/xml/jaxp/functional/catalog/DelegateUriTest.java
@@ -23,32 +23,32 @@
 
 package catalog;
 
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
+
+import javax.xml.catalog.CatalogException;
+import javax.xml.catalog.CatalogResolver;
+
 import static catalog.CatalogTestUtils.catalogUriResolver;
 import static catalog.ResolutionChecker.checkUriResolution;
 import static catalog.ResolutionChecker.expectExceptionOnUri;
 
-import javax.xml.catalog.CatalogResolver;
-import javax.xml.catalog.CatalogException;
-
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
-
 /*
  * @test
  * @bug 8077931
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm catalog.DelegateUriTest
+ * @run junit/othervm catalog.DelegateUriTest
  * @summary Get matched URIs from delegateURI entries.
  */
 public class DelegateUriTest {
 
-    @Test(dataProvider = "uri-matchedUri")
+    @ParameterizedTest
+    @MethodSource("dataOnMatch")
     public void testMatch(String uri, String matchedUri) {
         checkUriResolution(createResolver(), uri, matchedUri);
     }
 
-    @DataProvider(name = "uri-matchedUri")
-    public Object[][] data() {
+    public static Object[][] dataOnMatch() {
         return new Object[][] {
                 // The matched URI of the specified URI reference is defined in
                 // a delegate catalog file of the current catalog file.
@@ -71,14 +71,14 @@ public class DelegateUriTest {
                         "http://local/base/dtd/carl/docCarlDU.dtd"} };
     }
 
-    @Test(dataProvider = "uri-expectedExceptionClass")
+    @ParameterizedTest
+    @MethodSource("dataOnException")
     public void testException(String uri,
             Class<? extends Throwable> expectedExceptionClass) {
         expectExceptionOnUri(createResolver(), uri, expectedExceptionClass);
     }
 
-    @DataProvider(name = "uri-expectedExceptionClass")
-    public Object[][] dataOnException() {
+    public static Object[][] dataOnException() {
         return new Object[][] {
                 // The matched delegateURI entry of the specified URI reference
                 // defines a non-existing delegate catalog file. That should
@@ -92,7 +92,7 @@ public class DelegateUriTest {
                         CatalogException.class } };
     }
 
-    private CatalogResolver createResolver() {
+    private static CatalogResolver createResolver() {
         return catalogUriResolver("delegateUri.xml");
     }
 }
diff --git a/test/jaxp/javax/xml/jaxp/functional/catalog/GroupTest.java b/test/jaxp/javax/xml/jaxp/functional/catalog/GroupTest.java
index 7516be7d560..37910c2b1f5 100644
--- a/test/jaxp/javax/xml/jaxp/functional/catalog/GroupTest.java
+++ b/test/jaxp/javax/xml/jaxp/functional/catalog/GroupTest.java
@@ -23,22 +23,22 @@
 
 package catalog;
 
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
+
+import javax.xml.catalog.CatalogResolver;
+
 import static catalog.CatalogTestUtils.catalogResolver;
 import static catalog.CatalogTestUtils.catalogUriResolver;
 import static catalog.ResolutionChecker.checkPubIdResolution;
 import static catalog.ResolutionChecker.checkSysIdResolution;
 import static catalog.ResolutionChecker.checkUriResolution;
 
-import javax.xml.catalog.CatalogResolver;
-
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
-
 /*
  * @test
  * @bug 8077931
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm catalog.GroupTest
+ * @run junit/othervm catalog.GroupTest
  * @summary Get matched URIs from system, public and uri entries respectively,
  *          and some of the entries are enclosed by group entries.
  */
@@ -46,13 +46,13 @@ public class GroupTest {
 
     private static final String CATALOG_GROUP = "group.xml";
 
-    @Test(dataProvider = "systemId-matchedUri")
+    @ParameterizedTest
+    @MethodSource("dataMatchSysId")
     public void testMatchOnSysId(String uri, String matchedUri) {
         checkSysIdResolution(createResolver(), uri, matchedUri);
     }
 
-    @DataProvider(name = "systemId-matchedUri")
-    public Object[][] dataOnSysId() {
+    public static Object[][] dataMatchSysId() {
         return new Object[][] {
                 // The matched URI of the specified system id is enclosed by a
                 // group entry.
@@ -72,13 +72,13 @@ public class GroupTest {
                         "http://local/base/dtd/docCarlSys1.dtd" } };
     }
 
-    @Test(dataProvider = "publicId-matchedUri")
+    @ParameterizedTest
+    @MethodSource("dataOnMatchPubId")
     public void testMatchOnPubId(String uri, String matchedUri) {
         checkPubIdResolution(createResolver(), uri, matchedUri);
     }
 
-    @DataProvider(name = "publicId-matchedUri")
-    public Object[][] dataOnPubId() {
+    public static Object[][] dataOnMatchPubId() {
         return new Object[][] {
                 // The matched URI of the specified public id is enclosed by a
                 // group entry.
@@ -98,13 +98,13 @@ public class GroupTest {
                         "http://local/base/dtd/docCarlPub1.dtd" } };
     }
 
-    @Test(dataProvider = "uri-matchedUri")
+    @ParameterizedTest
+    @MethodSource("dataOnMatchUri")
     public void testMatchOnUri(String uri, String matchedUri) {
         checkUriResolution(catalogUriResolver(CATALOG_GROUP), uri, matchedUri);
     }
 
-    @DataProvider(name = "uri-matchedUri")
-    public Object[][] dataOnUri() {
+    public static Object[][] dataOnMatchUri() {
         return new Object[][] {
                 // The matched URI of the specified URI reference is enclosed by
                 // a group entry.
@@ -124,7 +124,7 @@ public class GroupTest {
                         "http://local/base/dtd/docAliceURI.dtd" } };
     }
 
-    private CatalogResolver createResolver() {
+    private static CatalogResolver createResolver() {
         return catalogResolver(CATALOG_GROUP);
     }
 }
diff --git a/test/jaxp/javax/xml/jaxp/functional/catalog/LoadCatalogTest.java b/test/jaxp/javax/xml/jaxp/functional/catalog/LoadCatalogTest.java
index 6a5248b8f9f..481c2fa1f83 100644
--- a/test/jaxp/javax/xml/jaxp/functional/catalog/LoadCatalogTest.java
+++ b/test/jaxp/javax/xml/jaxp/functional/catalog/LoadCatalogTest.java
@@ -23,6 +23,12 @@
 
 package catalog;
 
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
+
+import javax.xml.catalog.CatalogException;
+import javax.xml.catalog.CatalogResolver;
+
 import static catalog.CatalogTestUtils.CATALOG_PUBLIC;
 import static catalog.CatalogTestUtils.CATALOG_SYSTEM;
 import static catalog.CatalogTestUtils.CATALOG_URI;
@@ -30,18 +36,13 @@ import static catalog.CatalogTestUtils.catalogResolver;
 import static catalog.CatalogTestUtils.catalogUriResolver;
 import static catalog.ResolutionChecker.checkSysIdResolution;
 import static catalog.ResolutionChecker.checkUriResolution;
-
-import javax.xml.catalog.CatalogException;
-import javax.xml.catalog.CatalogResolver;
-
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
+import static org.junit.jupiter.api.Assertions.assertThrows;
 
 /*
  * @test
  * @bug 8077931
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm catalog.LoadCatalogTest
+ * @run junit/othervm catalog.LoadCatalogTest
  * @summary When catalog resolver loads catalog files, the current catalog file
  *          and the catalog files specified by the nextCatalog entries may not
  *          accessible. This case tests how does the resolver handle this issue.
@@ -55,14 +56,14 @@ public class LoadCatalogTest {
     private static final String ID_ALICE_URI = "http://remote/dtd/uri/alice/docAlice.dtd";
     private static final String ID_DUMMY = "http://remote/dtd/doc.dtd";
 
-    @Test(dataProvider = "entityResolver")
+    @ParameterizedTest
+    @MethodSource("entityResolver")
     public void testMatchOnEntityResolver(CatalogResolver resolver) {
         checkSysIdResolution(resolver, ID_ALICE,
                 "http://local/dtd/docAliceSys.dtd");
     }
 
-    @DataProvider(name = "entityResolver")
-    public Object[][] entityResolver() {
+    public static Object[][] entityResolver() {
         return new Object[][] {
                 // This EntityResolver loads multiple catalog files one by one.
                 // All of the files are available.
@@ -75,14 +76,14 @@ public class LoadCatalogTest {
                         CATALOG_SYSTEM) } };
     }
 
-    @Test(dataProvider = "uriResolver")
+    @ParameterizedTest
+    @MethodSource("uriResolver")
     public void testMatchOnUriResolver(CatalogResolver resolver) {
         checkUriResolution(resolver, ID_ALICE_URI,
                 "http://local/dtd/docAliceURI.dtd");
     }
 
-    @DataProvider(name = "uriResolver")
-    public Object[][] uriResolver() {
+    public static Object[][] uriResolver() {
         return new Object[][] {
                 // This URIResolver loads multiple catalog files one by one.
                 // All of the files are available.
@@ -95,20 +96,21 @@ public class LoadCatalogTest {
                         CATALOG_URI) } };
     }
 
-    @Test(dataProvider = "catalogName",
-            expectedExceptions = CatalogException.class)
-    public void testExceptionOnEntityResolver(String[] catalogName) {
-        catalogResolver(catalogName).resolveEntity(null, ID_DUMMY);
+    @ParameterizedTest
+    @MethodSource("catalogName")
+    public void testException(String[] catalogName) {
+        CatalogResolver resolver = catalogResolver(catalogName);
+        assertThrows(CatalogException.class, () -> resolver.resolveEntity(null, ID_DUMMY));
     }
 
-    @Test(dataProvider = "catalogName",
-            expectedExceptions = CatalogException.class)
+    @ParameterizedTest
+    @MethodSource("catalogName")
     public void testExceptionOnUriResolver(String[] catalogName) {
-        catalogUriResolver(catalogName).resolve(ID_DUMMY, null);
+        CatalogResolver resolver = catalogUriResolver(catalogName);
+        assertThrows(CatalogException.class, () -> resolver.resolve(ID_DUMMY, null));
     }
 
-    @DataProvider(name = "catalogName")
-    public Object[][] catalogName() {
+    public static Object[][] catalogName() {
         return new Object[][] {
                 // This catalog file set includes null catalog files.
                 { (String[]) null },
diff --git a/test/jaxp/javax/xml/jaxp/functional/catalog/NextCatalogTest.java b/test/jaxp/javax/xml/jaxp/functional/catalog/NextCatalogTest.java
index d7e0711636d..ff56b86a500 100644
--- a/test/jaxp/javax/xml/jaxp/functional/catalog/NextCatalogTest.java
+++ b/test/jaxp/javax/xml/jaxp/functional/catalog/NextCatalogTest.java
@@ -23,22 +23,22 @@
 
 package catalog;
 
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
+
+import javax.xml.catalog.CatalogResolver;
+
 import static catalog.CatalogTestUtils.catalogResolver;
 import static catalog.CatalogTestUtils.catalogUriResolver;
 import static catalog.ResolutionChecker.checkPubIdResolution;
 import static catalog.ResolutionChecker.checkSysIdResolution;
 import static catalog.ResolutionChecker.checkUriResolution;
 
-import javax.xml.catalog.CatalogResolver;
-
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
-
 /*
  * @test
  * @bug 8077931
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm catalog.NextCatalogTest
+ * @run junit/othervm catalog.NextCatalogTest
  * @summary Get matched URIs from system, public and uri entries respectively,
  *          but some of the entries are defined in none-current catalog files.
  */
@@ -49,13 +49,13 @@ public class NextCatalogTest {
     private static final String CATALOG_NEXTCATALOGRIGHT
             = "nextCatalog-right.xml";
 
-    @Test(dataProvider = "systemId-matchedUri")
+    @ParameterizedTest
+    @MethodSource("dataOnSysId")
     public void testNextCatalogOnSysId(String sytemId, String matchedUri) {
         checkSysIdResolution(createEntityResolver(), sytemId, matchedUri);
     }
 
-    @DataProvider(name = "systemId-matchedUri")
-    public Object[][] dataOnSysId() {
+    public static Object[][] dataOnSysId() {
         return new Object[][] {
                 // This matched URI of the specified system id is defined in a
                 // next catalog file.
@@ -81,13 +81,13 @@ public class NextCatalogTest {
                         "http://local/base/dtd/docDuplicateLeftSys.dtd" } };
     }
 
-    @Test(dataProvider = "publicId-matchedUri")
+    @ParameterizedTest
+    @MethodSource("dataOnPubId")
     public void testNextCatalogOnPubId(String publicId, String matchedUri) {
         checkPubIdResolution(createEntityResolver(), publicId, matchedUri);
     }
 
-    @DataProvider(name = "publicId-matchedUri")
-    public Object[][] dataOnPubId() {
+    public static Object[][] dataOnPubId() {
         return new Object[][] {
                 // This matched URI of the specified public id is defined in a
                 // next catalog file.
@@ -113,13 +113,13 @@ public class NextCatalogTest {
                         "http://local/base/dtd/docDuplicateLeftPub.dtd" } };
     }
 
-    @Test(dataProvider = "uri-matchedUri")
+    @ParameterizedTest
+    @MethodSource("dataOnUri")
     public void testNextCatalogOnUri(String uri, String matchedUri) {
         checkUriResolution(createUriResolver(), uri, matchedUri);
     }
 
-    @DataProvider(name = "uri-matchedUri")
-    public Object[][] dataOnUri() {
+    public static Object[][] dataOnUri() {
         return new Object[][] {
                 // This matched URI of the specified URI reference is defined in
                 // a next catalog file.
@@ -145,12 +145,12 @@ public class NextCatalogTest {
                         "http://local/base/dtd/docDuplicateLeftURI.dtd" } };
     }
 
-    private CatalogResolver createEntityResolver() {
+    private static CatalogResolver createEntityResolver() {
         return catalogResolver(CATALOG_NEXTCATALOGLEFT,
                 CATALOG_NEXTCATALOGRIGHT);
     }
 
-    private CatalogResolver createUriResolver() {
+    private static CatalogResolver createUriResolver() {
         return catalogUriResolver(CATALOG_NEXTCATALOGLEFT,
                 CATALOG_NEXTCATALOGRIGHT);
     }
diff --git a/test/jaxp/javax/xml/jaxp/functional/catalog/NormalizationTest.java b/test/jaxp/javax/xml/jaxp/functional/catalog/NormalizationTest.java
index 74fc25e90c1..0a112fd7426 100644
--- a/test/jaxp/javax/xml/jaxp/functional/catalog/NormalizationTest.java
+++ b/test/jaxp/javax/xml/jaxp/functional/catalog/NormalizationTest.java
@@ -23,22 +23,22 @@
 
 package catalog;
 
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
+
+import javax.xml.catalog.CatalogResolver;
+
 import static catalog.CatalogTestUtils.catalogResolver;
 import static catalog.CatalogTestUtils.catalogUriResolver;
 import static catalog.ResolutionChecker.checkPubIdResolution;
 import static catalog.ResolutionChecker.checkSysIdResolution;
 import static catalog.ResolutionChecker.checkUriResolution;
 
-import javax.xml.catalog.CatalogResolver;
-
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
-
 /*
  * @test
  * @bug 8077931
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm catalog.NormalizationTest
+ * @run junit/othervm catalog.NormalizationTest
  * @summary Before matching identifiers and URI references, it has to normalize
  *          the passed identifiers and URI references. And then the catalog
  *          resolver uses the normalized stuff to search the counterparts in
@@ -48,23 +48,25 @@ public class NormalizationTest {
 
     private static final String CATALOG_NORMALIZATION = "normalization.xml";
 
-    @Test(dataProvider = "systemId_uri-matchedUri")
+    @ParameterizedTest
+    @MethodSource("dataOnSysIdAndUri")
     public void testNormalizationOnSysId(String sytemId, String matchedUri) {
         checkSysIdResolution(createEntityResolver(), sytemId, matchedUri);
     }
 
-    @Test(dataProvider = "publicId-matchedUri")
+    @ParameterizedTest
+    @MethodSource("dataOnPubId")
     public void testNormalizationOnPubId(String publicId, String matchedUri) {
         checkPubIdResolution(createEntityResolver(), publicId, matchedUri);
     }
 
-    @Test(dataProvider = "systemId_uri-matchedUri")
+    @ParameterizedTest
+    @MethodSource("dataOnSysIdAndUri")
     public void testNormalizationOnUri(String uri, String matchedUri) {
         checkUriResolution(createUriResolver(), uri, matchedUri);
     }
 
-    @DataProvider(name = "systemId_uri-matchedUri")
-    public Object[][] dataOnSysIdAndUri() {
+    public static Object[][] dataOnSysIdAndUri() {
         return new Object[][] {
                 // The specified system id/URI reference contains spaces. And
                 // the counterparts in system/uri entries also contain spaces.
@@ -85,8 +87,7 @@ public class NormalizationTest {
                         "http://local/base/dtd/docBobSys.dtd" } };
     }
 
-    @DataProvider(name = "publicId-matchedUri")
-    public Object[][] dataOnPubId() {
+    public static Object[][] dataOnPubId() {
         return new Object[][] {
                 // The specified public id contains spaces. And the counterparts
                 // in public entry also contains spaces.
@@ -103,11 +104,11 @@ public class NormalizationTest {
                         "http://local/base/dtd/docBobPub.dtd" } };
     }
 
-    private CatalogResolver createEntityResolver() {
+    private static CatalogResolver createEntityResolver() {
         return catalogResolver(CATALOG_NORMALIZATION);
     }
 
-    private CatalogResolver createUriResolver() {
+    private static CatalogResolver createUriResolver() {
         return catalogUriResolver(CATALOG_NORMALIZATION);
     }
 }
diff --git a/test/jaxp/javax/xml/jaxp/functional/catalog/PreferFeatureTest.java b/test/jaxp/javax/xml/jaxp/functional/catalog/PreferFeatureTest.java
index 85cb2505244..4f9cfcd1f82 100644
--- a/test/jaxp/javax/xml/jaxp/functional/catalog/PreferFeatureTest.java
+++ b/test/jaxp/javax/xml/jaxp/functional/catalog/PreferFeatureTest.java
@@ -23,38 +23,38 @@
 
 package catalog;
 
-import static catalog.CatalogTestUtils.PREFER_PUBLIC;
-import static catalog.CatalogTestUtils.PREFER_SYSTEM;
-import static catalog.CatalogTestUtils.catalogResolver;
-import static javax.xml.catalog.CatalogFeatures.Feature.PREFER;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
 
 import javax.xml.catalog.CatalogException;
 import javax.xml.catalog.CatalogFeatures;
 import javax.xml.catalog.CatalogResolver;
 
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
+import static catalog.CatalogTestUtils.PREFER_PUBLIC;
+import static catalog.CatalogTestUtils.PREFER_SYSTEM;
+import static catalog.CatalogTestUtils.catalogResolver;
+import static javax.xml.catalog.CatalogFeatures.Feature.PREFER;
+import static org.junit.jupiter.api.Assertions.assertThrows;
 
 /*
  * @test
  * @bug 8077931
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm catalog.PreferFeatureTest
+ * @run junit/othervm catalog.PreferFeatureTest
  * @summary This case tests how does the feature affect the catalog resolution,
  *          and tests the priority between this feature and attribute prefer
  *          in catalog file.
  */
 public class PreferFeatureTest {
 
-    @Test(dataProvider = "prefer-publicId-systemId",
-            expectedExceptions = CatalogException.class)
-    public void testPreferFeature(String prefer, String systemId,
-            String publicId) {
-        createResolver(prefer).resolveEntity(systemId, publicId);
+    @ParameterizedTest
+    @MethodSource("data")
+    public void testPreferFeature(String prefer, String systemId, String publicId) {
+        CatalogResolver resolver = createResolver(prefer);
+        assertThrows(CatalogException.class, () -> resolver.resolveEntity(systemId, publicId));
     }
 
-    @DataProvider(name = "prefer-publicId-systemId")
-    public Object[][] data() {
+    public static Object[][] data() {
         return new Object[][] {
                 // The feature prefer is system. There's a match for the
                 // specified public id, and no match for the specified system id.
@@ -72,7 +72,7 @@ public class PreferFeatureTest {
                          "http://remote/dtd/bob/docBobDummy.dtd"} };
     }
 
-    private CatalogResolver createResolver(String prefer) {
+    private static CatalogResolver createResolver(String prefer) {
         return catalogResolver(
                 CatalogFeatures.builder().with(PREFER, prefer).build(),
                 "preferFeature.xml");
diff --git a/test/jaxp/javax/xml/jaxp/functional/catalog/PreferTest.java b/test/jaxp/javax/xml/jaxp/functional/catalog/PreferTest.java
index 6bcbd140466..c358ff85c62 100644
--- a/test/jaxp/javax/xml/jaxp/functional/catalog/PreferTest.java
+++ b/test/jaxp/javax/xml/jaxp/functional/catalog/PreferTest.java
@@ -23,19 +23,19 @@
 
 package catalog;
 
-import static catalog.CatalogTestUtils.catalogResolver;
-import static catalog.ResolutionChecker.checkExtIdResolution;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
 
 import javax.xml.catalog.CatalogResolver;
 
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
+import static catalog.CatalogTestUtils.catalogResolver;
+import static catalog.ResolutionChecker.checkExtIdResolution;
 
 /*
  * @test
  * @bug 8077931
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm catalog.PreferTest
+ * @run junit/othervm catalog.PreferTest
  * @summary Get matched URIs from system and public family entries, which
  *          specify the prefer attribute. It tests how does the prefer attribute
  *          affect the resolution procedure. The test rule is based on OASIS
@@ -43,14 +43,14 @@ import org.testng.annotations.Test;
  */
 public class PreferTest {
 
-    @Test(dataProvider = "publicId-systemId-matchedUri")
+    @ParameterizedTest
+    @MethodSource("data")
     public void testPrefer(String publicId, String systemId,
             String expected) {
         checkExtIdResolution(createResolver(), publicId, systemId, expected);
     }
 
-    @DataProvider(name = "publicId-systemId-matchedUri")
-    public Object[][] data() {
+    public static Object[][] data() {
         return new Object[][] {
                 // The prefer attribute is public. Both of the specified public
                 // id and system id have matches in the catalog file. But
@@ -85,7 +85,7 @@ public class PreferTest {
                         "http://local/base/dtd/docBobSys.dtd" } };
     }
 
-    private CatalogResolver createResolver() {
+    private static CatalogResolver createResolver() {
         return catalogResolver("prefer.xml");
     }
 }
diff --git a/test/jaxp/javax/xml/jaxp/functional/catalog/PublicFamilyTest.java b/test/jaxp/javax/xml/jaxp/functional/catalog/PublicFamilyTest.java
index 42dc6bbe215..44a0d46537f 100644
--- a/test/jaxp/javax/xml/jaxp/functional/catalog/PublicFamilyTest.java
+++ b/test/jaxp/javax/xml/jaxp/functional/catalog/PublicFamilyTest.java
@@ -23,20 +23,21 @@
 
 package catalog;
 
-import static catalog.CatalogTestUtils.catalogResolver;
-import static catalog.ResolutionChecker.checkNoMatch;
-import static catalog.ResolutionChecker.checkPubIdResolution;
+import org.junit.jupiter.api.Test;
 
 import javax.xml.catalog.CatalogException;
 import javax.xml.catalog.CatalogResolver;
 
-import org.testng.annotations.Test;
+import static catalog.CatalogTestUtils.catalogResolver;
+import static catalog.ResolutionChecker.checkNoMatch;
+import static catalog.ResolutionChecker.checkPubIdResolution;
+import static org.junit.jupiter.api.Assertions.assertThrows;
 
 /*
  * @test
  * @bug 8077931
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm catalog.PublicFamilyTest
+ * @run junit/othervm catalog.PublicFamilyTest
  * @summary Get matched URIs from public and delegatePublic entries.
  *          It tests the resolution priorities among the public family entries.
  *          The test rule is based on OASIS Standard V1.1 section 7.1.2.
@@ -58,12 +59,12 @@ public class PublicFamilyTest {
     /*
      * If no match is found, a CatalogException should be thrown.
      */
-    @Test(expectedExceptions = CatalogException.class)
-    public void testNoMatched() {
-        checkNoMatch(createResolver());
+    @Test
+    public void testNoMatch() {
+        assertThrows(CatalogException.class, () -> checkNoMatch(createResolver()));
     }
 
-    private CatalogResolver createResolver() {
+    private static CatalogResolver createResolver() {
         return catalogResolver("publicFamily.xml");
     }
 }
diff --git a/test/jaxp/javax/xml/jaxp/functional/catalog/PublicTest.java b/test/jaxp/javax/xml/jaxp/functional/catalog/PublicTest.java
index d44dca87732..fe137eac6e9 100644
--- a/test/jaxp/javax/xml/jaxp/functional/catalog/PublicTest.java
+++ b/test/jaxp/javax/xml/jaxp/functional/catalog/PublicTest.java
@@ -23,33 +23,35 @@
 
 package catalog;
 
-import static catalog.CatalogTestUtils.CATALOG_PUBLIC;
-import static catalog.CatalogTestUtils.catalogResolver;
-import static catalog.ResolutionChecker.checkNoMatch;
-import static catalog.ResolutionChecker.checkPubIdResolution;
+import org.junit.jupiter.api.Test;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
 
 import javax.xml.catalog.CatalogException;
 import javax.xml.catalog.CatalogResolver;
 
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
+import static catalog.CatalogTestUtils.CATALOG_PUBLIC;
+import static catalog.CatalogTestUtils.catalogResolver;
+import static catalog.ResolutionChecker.checkNoMatch;
+import static catalog.ResolutionChecker.checkPubIdResolution;
+import static org.junit.jupiter.api.Assertions.assertThrows;
 
 /*
  * @test
  * @bug 8077931
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm catalog.PublicTest
+ * @run junit/othervm catalog.PublicTest
  * @summary Get matched URIs from public entries.
  */
 public class PublicTest {
 
-    @Test(dataProvider = "publicId-matchedUri")
+    @ParameterizedTest
+    @MethodSource("data")
     public void testPublic(String publicId, String matchedUri) {
         checkPubIdResolution(createResolver(), publicId, matchedUri);
     }
 
-    @DataProvider(name = "publicId-matchedUri")
-    public Object[][] data() {
+    public static Object[][] data() {
         return new Object[][] {
                 // The matched URI of the specified public id is defined in a
                 // public entry. The match is an absolute path.
@@ -80,12 +82,12 @@ public class PublicTest {
     /*
      * If no match is found, a CatalogException should be thrown.
      */
-    @Test(expectedExceptions = CatalogException.class)
+    @Test
     public void testNoMatch() {
-        checkNoMatch(createResolver());
+        assertThrows(CatalogException.class, () -> checkNoMatch(createResolver()));
     }
 
-    private CatalogResolver createResolver() {
+    private static CatalogResolver createResolver() {
         return catalogResolver(CATALOG_PUBLIC);
     }
 }
diff --git a/test/jaxp/javax/xml/jaxp/functional/catalog/ResolveFeatureTest.java b/test/jaxp/javax/xml/jaxp/functional/catalog/ResolveFeatureTest.java
index 0626e83bed9..a642f751a7f 100644
--- a/test/jaxp/javax/xml/jaxp/functional/catalog/ResolveFeatureTest.java
+++ b/test/jaxp/javax/xml/jaxp/functional/catalog/ResolveFeatureTest.java
@@ -23,6 +23,13 @@
 
 package catalog;
 
+import org.junit.jupiter.api.Test;
+
+import javax.xml.catalog.CatalogException;
+import javax.xml.catalog.CatalogFeatures;
+import javax.xml.catalog.CatalogFeatures.Feature;
+import javax.xml.catalog.CatalogResolver;
+
 import static catalog.CatalogTestUtils.CATALOG_SYSTEM;
 import static catalog.CatalogTestUtils.CATALOG_URI;
 import static catalog.CatalogTestUtils.RESOLVE_CONTINUE;
@@ -33,19 +40,13 @@ import static catalog.CatalogTestUtils.catalogUriResolver;
 import static catalog.ResolutionChecker.checkSysIdResolution;
 import static catalog.ResolutionChecker.checkUriResolution;
 import static javax.xml.catalog.CatalogFeatures.builder;
-
-import javax.xml.catalog.CatalogException;
-import javax.xml.catalog.CatalogFeatures;
-import javax.xml.catalog.CatalogFeatures.Feature;
-import javax.xml.catalog.CatalogResolver;
-
-import org.testng.annotations.Test;
+import static org.junit.jupiter.api.Assertions.assertThrows;
 
 /*
  * @test
  * @bug 8077931
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm catalog.ResolveFeatureTest
+ * @run junit/othervm catalog.ResolveFeatureTest
  * @summary This case tests how does resolve feature affect the catalog
  *          resolution.
  */
@@ -55,20 +56,24 @@ public class ResolveFeatureTest {
      * For strict external identifier resolution, if no match is found,
      * it should throw CatalogException.
      */
-    @Test(expectedExceptions = CatalogException.class)
+    @Test
     public void testStrictResolutionOnEntityResolver() {
-        createEntityResolver(RESOLVE_STRICT).resolveEntity(null,
-                "http://remote/dtd/alice/docAliceDummy.dtd");
+        CatalogResolver resolver = createEntityResolver(RESOLVE_STRICT);
+        assertThrows(
+                CatalogException.class,
+                () -> resolver.resolveEntity(null, "http://remote/dtd/alice/docAliceDummy.dtd"));
     }
 
     /*
      * For strict URI reference resolution, if no match is found,
      * it should throw CatalogException.
      */
-    @Test(expectedExceptions = CatalogException.class)
+    @Test
     public void testStrictResolutionOnUriResolver() {
-        createUriResolver(RESOLVE_STRICT).resolve(
-                "http://remote/dtd/alice/docAliceDummy.dtd", null);
+        CatalogResolver resolver = createUriResolver(RESOLVE_STRICT);
+        assertThrows(
+                CatalogException.class,
+                () -> resolver.resolve("http://remote/dtd/alice/docAliceDummy.dtd", null));
     }
 
     /*
@@ -115,15 +120,15 @@ public class ResolveFeatureTest {
                 "http://remote/dtd/carl/docCarlDummy.dtd", null);
     }
 
-    private CatalogResolver createEntityResolver(String resolve) {
+    private static CatalogResolver createEntityResolver(String resolve) {
         return catalogResolver(createFeature(resolve), CATALOG_SYSTEM);
     }
 
-    private CatalogResolver createUriResolver(String resolve) {
+    private static CatalogResolver createUriResolver(String resolve) {
         return catalogUriResolver(createFeature(resolve), CATALOG_URI);
     }
 
-    private CatalogFeatures createFeature(String resolve) {
+    private static CatalogFeatures createFeature(String resolve) {
         return builder().with(Feature.RESOLVE, resolve).build();
     }
 }
diff --git a/test/jaxp/javax/xml/jaxp/functional/catalog/RewriteSystemTest.java b/test/jaxp/javax/xml/jaxp/functional/catalog/RewriteSystemTest.java
index 647fccd49fb..6c6cc752b98 100644
--- a/test/jaxp/javax/xml/jaxp/functional/catalog/RewriteSystemTest.java
+++ b/test/jaxp/javax/xml/jaxp/functional/catalog/RewriteSystemTest.java
@@ -23,32 +23,34 @@
 
 package catalog;
 
-import static catalog.CatalogTestUtils.catalogResolver;
-import static catalog.ResolutionChecker.checkNoMatch;
-import static catalog.ResolutionChecker.checkSysIdResolution;
+import org.junit.jupiter.api.Test;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
 
 import javax.xml.catalog.CatalogException;
 import javax.xml.catalog.CatalogResolver;
 
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
+import static catalog.CatalogTestUtils.catalogResolver;
+import static catalog.ResolutionChecker.checkNoMatch;
+import static catalog.ResolutionChecker.checkSysIdResolution;
+import static org.junit.jupiter.api.Assertions.assertThrows;
 
 /*
  * @test
  * @bug 8077931
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm catalog.RewriteSystemTest
+ * @run junit/othervm catalog.RewriteSystemTest
  * @summary Get matched URIs from rewriteSystem entries.
  */
 public class RewriteSystemTest {
 
-    @Test(dataProvider = "systemId-matchedUri")
+    @ParameterizedTest
+    @MethodSource("dataOnMatch")
     public void testMatch(String systemId, String matchedUri) {
         checkSysIdResolution(createResolver(), systemId, matchedUri);
     }
 
-    @DataProvider(name = "systemId-matchedUri")
-    public Object[][] dataOnMatch() {
+    public static Object[][] dataOnMatch() {
         return new Object[][] {
                 // The matched URI of the specified system id is defined in a
                 // rewriteSystem entry. The match is an absolute path.
@@ -83,12 +85,12 @@ public class RewriteSystemTest {
     /*
      * If no match is found, a CatalogException should be thrown.
      */
-    @Test(expectedExceptions = CatalogException.class)
+    @Test
     public void testNoMatch() {
-        checkNoMatch(createResolver());
+        assertThrows(CatalogException.class, () -> checkNoMatch(createResolver()));
     }
 
-    private CatalogResolver createResolver() {
+    private static CatalogResolver createResolver() {
         return catalogResolver("rewriteSystem.xml");
     }
 }
diff --git a/test/jaxp/javax/xml/jaxp/functional/catalog/RewriteUriTest.java b/test/jaxp/javax/xml/jaxp/functional/catalog/RewriteUriTest.java
index d7b98b96f11..1498f866c11 100644
--- a/test/jaxp/javax/xml/jaxp/functional/catalog/RewriteUriTest.java
+++ b/test/jaxp/javax/xml/jaxp/functional/catalog/RewriteUriTest.java
@@ -23,32 +23,34 @@
 
 package catalog;
 
+import org.junit.jupiter.api.Test;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
+
+import javax.xml.catalog.CatalogException;
+import javax.xml.catalog.CatalogResolver;
+
 import static catalog.CatalogTestUtils.catalogUriResolver;
 import static catalog.ResolutionChecker.checkNoUriMatch;
 import static catalog.ResolutionChecker.checkUriResolution;
-
-import javax.xml.catalog.CatalogResolver;
-import javax.xml.catalog.CatalogException;
-
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
+import static org.junit.jupiter.api.Assertions.assertThrows;
 
 /*
  * @test
  * @bug 8077931
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm catalog.RewriteUriTest
+ * @run junit/othervm catalog.RewriteUriTest
  * @summary Get matched URIs from rewriteURI entries.
  */
 public class RewriteUriTest {
 
-    @Test(dataProvider = "uri-matchedUri")
+    @ParameterizedTest
+    @MethodSource("dataOnMatch")
     public void testMatch(String uri, String matchedUri) {
         checkUriResolution(createResolver(), uri, matchedUri);
     }
 
-    @DataProvider(name = "uri-matchedUri")
-    public Object[][] dataOnMatch() {
+    public static Object[][] dataOnMatch() {
         return new Object[][] {
                 // The matched URI of the specified URI reference is defined in
                 // a rewriteURI entry. The match is an absolute path.
@@ -83,12 +85,12 @@ public class RewriteUriTest {
     /*
      * If no match is found, a CatalogException should be thrown.
      */
-    @Test(expectedExceptions = CatalogException.class)
+    @Test
     public void testNoMatch() {
-        checkNoUriMatch(createResolver());
+        assertThrows(CatalogException.class, () -> checkNoUriMatch(createResolver()));
     }
 
-    private CatalogResolver createResolver() {
+    private static CatalogResolver createResolver() {
         return catalogUriResolver("rewriteUri.xml");
     }
 }
diff --git a/test/jaxp/javax/xml/jaxp/functional/catalog/SpecifyCatalogTest.java b/test/jaxp/javax/xml/jaxp/functional/catalog/SpecifyCatalogTest.java
index 61c59d4049c..d1795f6a45d 100644
--- a/test/jaxp/javax/xml/jaxp/functional/catalog/SpecifyCatalogTest.java
+++ b/test/jaxp/javax/xml/jaxp/functional/catalog/SpecifyCatalogTest.java
@@ -23,7 +23,10 @@
 
 package catalog;
 
-import static jaxp.library.JAXPTestUtilities.setSystemProperty;
+import org.junit.jupiter.api.Test;
+
+import javax.xml.catalog.CatalogFeatures;
+import javax.xml.catalog.CatalogResolver;
 
 import static catalog.CatalogTestUtils.FEATURE_FILES;
 import static catalog.CatalogTestUtils.catalogResolver;
@@ -31,19 +34,14 @@ import static catalog.CatalogTestUtils.catalogUriResolver;
 import static catalog.CatalogTestUtils.getCatalogPath;
 import static catalog.ResolutionChecker.checkSysIdResolution;
 import static catalog.ResolutionChecker.checkUriResolution;
-import static javax.xml.catalog.CatalogFeatures.builder;
 import static javax.xml.catalog.CatalogFeatures.Feature.FILES;
-
-import javax.xml.catalog.CatalogFeatures;
-import javax.xml.catalog.CatalogResolver;
-
-import org.testng.annotations.Test;
+import static javax.xml.catalog.CatalogFeatures.builder;
 
 /*
  * @test
  * @bug 8077931
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm catalog.SpecifyCatalogTest
+ * @run junit/othervm catalog.SpecifyCatalogTest
  * @summary This case tests how to specify the catalog files.
  */
 public class SpecifyCatalogTest {
@@ -77,7 +75,7 @@ public class SpecifyCatalogTest {
      */
     @Test
     public void specifyCatalogViaSysProps() {
-        setSystemProperty(FEATURE_FILES,
+        System.setProperty(FEATURE_FILES,
                 getCatalogPath("specifyCatalog-sysProps.xml").toASCIIString());
 
         checkResolutionOnEntityResolver(catalogResolver((String[]) null),
@@ -93,13 +91,13 @@ public class SpecifyCatalogTest {
                 "http://local/base/dtd/docAPIURI.dtd");
     }
 
-    private void checkResolutionOnEntityResolver(CatalogResolver resolver,
-            String matchedUri) {
+    private static void checkResolutionOnEntityResolver(CatalogResolver resolver,
+                                                        String matchedUri) {
         checkSysIdResolution(resolver, ID_SYS, matchedUri);
     }
 
-    private void checkResolutionOnUriResolver(CatalogResolver resolver,
-            String matchedUri) {
+    private static void checkResolutionOnUriResolver(CatalogResolver resolver,
+                                                     String matchedUri) {
         checkUriResolution(resolver, ID_URI, matchedUri);
     }
 
diff --git a/test/jaxp/javax/xml/jaxp/functional/catalog/SystemFamilyTest.java b/test/jaxp/javax/xml/jaxp/functional/catalog/SystemFamilyTest.java
index ec614332207..927aa65db66 100644
--- a/test/jaxp/javax/xml/jaxp/functional/catalog/SystemFamilyTest.java
+++ b/test/jaxp/javax/xml/jaxp/functional/catalog/SystemFamilyTest.java
@@ -23,21 +23,23 @@
 
 package catalog;
 
-import static catalog.CatalogTestUtils.catalogResolver;
-import static catalog.ResolutionChecker.checkNoMatch;
-import static catalog.ResolutionChecker.checkSysIdResolution;
+import org.junit.jupiter.api.Test;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
 
 import javax.xml.catalog.CatalogException;
 import javax.xml.catalog.CatalogResolver;
 
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
+import static catalog.CatalogTestUtils.catalogResolver;
+import static catalog.ResolutionChecker.checkNoMatch;
+import static catalog.ResolutionChecker.checkSysIdResolution;
+import static org.junit.jupiter.api.Assertions.assertThrows;
 
 /*
  * @test
  * @bug 8077931
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm catalog.SystemFamilyTest
+ * @run junit/othervm catalog.SystemFamilyTest
  * @summary Get matched URIs from system, rewriteSystem, systemSuffix and
  *          delegateSystem entries. It tests the resolution priorities among
  *          the system family entries. The test rule is based on OASIS
@@ -45,13 +47,13 @@ import org.testng.annotations.Test;
  */
 public class SystemFamilyTest {
 
-    @Test(dataProvider = "systemId-matchedUri")
+    @ParameterizedTest
+    @MethodSource("dataOnMatch")
     public void testMatch(String systemId, String matchedUri) {
         checkSysIdResolution(createResolver(), systemId, matchedUri);
     }
 
-    @DataProvider(name = "systemId-matchedUri")
-    public Object[][] dataOnMatch() {
+    public static Object[][] dataOnMatch() {
         return new Object[][] {
                 // The matched URI of the specified system id is defined in a
                 // system entry.
@@ -72,12 +74,12 @@ public class SystemFamilyTest {
     /*
      * If no match is found, a CatalogException should be thrown.
      */
-    @Test(expectedExceptions = CatalogException.class)
+    @Test
     public void testNoMatch() {
-        checkNoMatch(createResolver());
+        assertThrows(CatalogException.class, () -> checkNoMatch(createResolver()));
     }
 
-    private CatalogResolver createResolver() {
+    private static CatalogResolver createResolver() {
         return catalogResolver("systemFamily.xml");
     }
 }
diff --git a/test/jaxp/javax/xml/jaxp/functional/catalog/SystemSuffixTest.java b/test/jaxp/javax/xml/jaxp/functional/catalog/SystemSuffixTest.java
index 2a40b581654..6890cc2a4c8 100644
--- a/test/jaxp/javax/xml/jaxp/functional/catalog/SystemSuffixTest.java
+++ b/test/jaxp/javax/xml/jaxp/functional/catalog/SystemSuffixTest.java
@@ -23,32 +23,34 @@
 
 package catalog;
 
-import static catalog.CatalogTestUtils.catalogResolver;
-import static catalog.ResolutionChecker.checkNoMatch;
-import static catalog.ResolutionChecker.checkSysIdResolution;
+import org.junit.jupiter.api.Test;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
 
 import javax.xml.catalog.CatalogException;
 import javax.xml.catalog.CatalogResolver;
 
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
+import static catalog.CatalogTestUtils.catalogResolver;
+import static catalog.ResolutionChecker.checkNoMatch;
+import static catalog.ResolutionChecker.checkSysIdResolution;
+import static org.junit.jupiter.api.Assertions.assertThrows;
 
 /*
  * @test
  * @bug 8077931
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm catalog.SystemSuffixTest
+ * @run junit/othervm catalog.SystemSuffixTest
  * @summary Get matched URIs from systemSuffix entries.
  */
 public class SystemSuffixTest {
 
-    @Test(dataProvider = "systemId-matchedUri")
+    @ParameterizedTest
+    @MethodSource("dataOnMatch")
     public void testMatch(String systemId, String matchedUri) {
         checkSysIdResolution(createResolver(), systemId, matchedUri);
     }
 
-    @DataProvider(name = "systemId-matchedUri")
-    public Object[][] dataOnMatch() {
+    public static Object[][] dataOnMatch() {
         return new Object[][] {
                 // The matched URI of the specified system id is defined in a
                 // systemIdSuffix entry. The match is an absolute path.
@@ -83,12 +85,12 @@ public class SystemSuffixTest {
     /*
      * If no match is found, a CatalogException should be thrown.
      */
-    @Test(expectedExceptions = CatalogException.class)
+    @Test
     public void testNoMatch() {
-        checkNoMatch(createResolver());
+        assertThrows(CatalogException.class, () -> checkNoMatch(createResolver()));
     }
 
-    private CatalogResolver createResolver() {
+    private static CatalogResolver createResolver() {
         return catalogResolver("systemSuffix.xml");
     }
 }
diff --git a/test/jaxp/javax/xml/jaxp/functional/catalog/SystemTest.java b/test/jaxp/javax/xml/jaxp/functional/catalog/SystemTest.java
index 73c11340b29..53909c4bd5a 100644
--- a/test/jaxp/javax/xml/jaxp/functional/catalog/SystemTest.java
+++ b/test/jaxp/javax/xml/jaxp/functional/catalog/SystemTest.java
@@ -23,33 +23,35 @@
 
 package catalog;
 
-import static catalog.CatalogTestUtils.CATALOG_SYSTEM;
-import static catalog.CatalogTestUtils.catalogResolver;
-import static catalog.ResolutionChecker.checkNoMatch;
-import static catalog.ResolutionChecker.checkSysIdResolution;
+import org.junit.jupiter.api.Test;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
 
 import javax.xml.catalog.CatalogException;
 import javax.xml.catalog.CatalogResolver;
 
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
+import static catalog.CatalogTestUtils.CATALOG_SYSTEM;
+import static catalog.CatalogTestUtils.catalogResolver;
+import static catalog.ResolutionChecker.checkNoMatch;
+import static catalog.ResolutionChecker.checkSysIdResolution;
+import static org.junit.jupiter.api.Assertions.assertThrows;
 
 /*
  * @test
  * @bug 8077931
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm catalog.SystemTest
+ * @run junit/othervm catalog.SystemTest
  * @summary Get matched URIs from system entries.
  */
 public class SystemTest {
 
-    @Test(dataProvider = "systemId-matchedUri")
+    @ParameterizedTest
+    @MethodSource("dataOnMatch")
     public void testMatch(String systemId, String matchedUri) {
         checkSysIdResolution(createResolver(), systemId, matchedUri);
     }
 
-    @DataProvider(name = "systemId-matchedUri")
-    public Object[][] dataOnMatch() {
+    public static Object[][] dataOnMatch() {
         return new Object[][] {
                 // The matched URI of the specified system id is defined in a
                 // system entry. The match is an absolute path.
@@ -80,12 +82,12 @@ public class SystemTest {
     /*
      * If no match is found, a CatalogException should be thrown.
      */
-    @Test(expectedExceptions = CatalogException.class)
+    @Test
     public void testNoMatch() {
-        checkNoMatch(createResolver());
+        assertThrows(CatalogException.class, () -> checkNoMatch(createResolver()));
     }
 
-    private CatalogResolver createResolver() {
+    private static CatalogResolver createResolver() {
         return catalogResolver(CATALOG_SYSTEM);
     }
 }
diff --git a/test/jaxp/javax/xml/jaxp/functional/catalog/UriFamilyTest.java b/test/jaxp/javax/xml/jaxp/functional/catalog/UriFamilyTest.java
index 44c9afcfa13..36b8d98ee1f 100644
--- a/test/jaxp/javax/xml/jaxp/functional/catalog/UriFamilyTest.java
+++ b/test/jaxp/javax/xml/jaxp/functional/catalog/UriFamilyTest.java
@@ -23,21 +23,23 @@
 
 package catalog;
 
+import org.junit.jupiter.api.Test;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
+
+import javax.xml.catalog.CatalogException;
+import javax.xml.catalog.CatalogResolver;
+
 import static catalog.CatalogTestUtils.catalogUriResolver;
 import static catalog.ResolutionChecker.checkNoUriMatch;
 import static catalog.ResolutionChecker.checkUriResolution;
-
-import javax.xml.catalog.CatalogResolver;
-import javax.xml.catalog.CatalogException;
-
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
+import static org.junit.jupiter.api.Assertions.assertThrows;
 
 /*
  * @test
  * @bug 8077931
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm catalog.UriFamilyTest
+ * @run junit/othervm catalog.UriFamilyTest
  * @summary Get matched URIs from uri, rewriteURI, uriSuffix and delegateURI
  *          entries. It tests the resolution priorities among the uri family
  *          entries. The test rule is based on OASIS Standard V1.1 section
@@ -45,13 +47,13 @@ import org.testng.annotations.Test;
  */
 public class UriFamilyTest {
 
-    @Test(dataProvider = "uri-matchedUri")
+    @ParameterizedTest
+    @MethodSource("dataOnMatch")
     public void testMatch(String systemId, String matchedUri) {
         checkUriResolution(createResolver(), systemId, matchedUri);
     }
 
-    @DataProvider(name = "uri-matchedUri")
-    public Object[][] dataOnMatch() {
+    public static Object[][] dataOnMatch() {
         return new Object[][] {
                 // The matched URI of the specified URI reference is defined in
                 // a uri entry.
@@ -72,12 +74,12 @@ public class UriFamilyTest {
     /*
      * If no match is found, a CatalogException should be thrown.
      */
-    @Test(expectedExceptions = CatalogException.class)
+    @Test
     public void testNoMatch() {
-        checkNoUriMatch(createResolver());
+        assertThrows(CatalogException.class, () -> checkNoUriMatch(createResolver()));
     }
 
-    private CatalogResolver createResolver() {
+    private static CatalogResolver createResolver() {
         return catalogUriResolver("uriFamily.xml");
     }
 }
diff --git a/test/jaxp/javax/xml/jaxp/functional/catalog/UriSuffixTest.java b/test/jaxp/javax/xml/jaxp/functional/catalog/UriSuffixTest.java
index 8feadb03fa2..2bbe63a374a 100644
--- a/test/jaxp/javax/xml/jaxp/functional/catalog/UriSuffixTest.java
+++ b/test/jaxp/javax/xml/jaxp/functional/catalog/UriSuffixTest.java
@@ -23,32 +23,34 @@
 
 package catalog;
 
+import org.junit.jupiter.api.Test;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
+
+import javax.xml.catalog.CatalogException;
+import javax.xml.catalog.CatalogResolver;
+
 import static catalog.CatalogTestUtils.catalogUriResolver;
 import static catalog.ResolutionChecker.checkNoUriMatch;
 import static catalog.ResolutionChecker.checkUriResolution;
-
-import javax.xml.catalog.CatalogResolver;
-import javax.xml.catalog.CatalogException;
-
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
+import static org.junit.jupiter.api.Assertions.assertThrows;
 
 /*
  * @test
  * @bug 8077931
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm catalog.UriSuffixTest
+ * @run junit/othervm catalog.UriSuffixTest
  * @summary Get matched URIs from rewriteURI entries.
  */
 public class UriSuffixTest {
 
-    @Test(dataProvider = "uri-matchedUri")
+    @ParameterizedTest
+    @MethodSource("dataOnMatch")
     public void testMatch(String uri, String matchedUri) {
         checkUriResolution(createResolver(), uri, matchedUri);
     }
 
-    @DataProvider(name = "uri-matchedUri")
-    public Object[][] dataOnMatch() {
+    public static Object[][] dataOnMatch() {
         return new Object[][] {
                 // The matched URI of the specified URI reference is defined in
                 // a uriSuffix entry. The match is an absolute path.
@@ -83,12 +85,12 @@ public class UriSuffixTest {
     /*
      * If no match is found, a CatalogException should be thrown.
      */
-    @Test(expectedExceptions = CatalogException.class)
+    @Test
     public void testNoMatch() {
-        checkNoUriMatch(createResolver());
+        assertThrows(CatalogException.class, () -> checkNoUriMatch(createResolver()));
     }
 
-    private CatalogResolver createResolver() {
+    private static CatalogResolver createResolver() {
         return catalogUriResolver("uriSuffix.xml");
     }
 }
diff --git a/test/jaxp/javax/xml/jaxp/functional/catalog/UriTest.java b/test/jaxp/javax/xml/jaxp/functional/catalog/UriTest.java
index cf76eada5e7..651b2753713 100644
--- a/test/jaxp/javax/xml/jaxp/functional/catalog/UriTest.java
+++ b/test/jaxp/javax/xml/jaxp/functional/catalog/UriTest.java
@@ -23,35 +23,37 @@
 
 package catalog;
 
+import org.junit.jupiter.api.Test;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
+
+import javax.xml.catalog.CatalogException;
+import javax.xml.catalog.CatalogFeatures;
+import javax.xml.catalog.CatalogResolver;
+
 import static catalog.CatalogTestUtils.CATALOG_URI;
 import static catalog.CatalogTestUtils.RESOLVE_CONTINUE;
 import static catalog.CatalogTestUtils.catalogUriResolver;
 import static catalog.ResolutionChecker.checkNoUriMatch;
 import static catalog.ResolutionChecker.checkUriResolution;
-
-import javax.xml.catalog.CatalogResolver;
-import javax.xml.catalog.CatalogException;
-import javax.xml.catalog.CatalogFeatures;
-
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
+import static org.junit.jupiter.api.Assertions.assertThrows;
 
 /*
  * @test
  * @bug 8077931
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm catalog.UriTest
+ * @run junit/othervm catalog.UriTest
  * @summary Get matched URIs from uri entries.
  */
 public class UriTest {
 
-    @Test(dataProvider = "uri-matchedUri")
+    @ParameterizedTest
+    @MethodSource("dataOnMatch")
     public void testMatch(String uri, String matchedUri) {
         checkUriResolution(createResolver(), uri, matchedUri);
     }
 
-    @DataProvider(name = "uri-matchedUri")
-    public Object[][] dataOnMatch() {
+    public static Object[][] dataOnMatch() {
         return new Object[][] {
                 // The matched URI of the specified URI reference is defined in
                 // a uri entry. The match is an absolute path.
@@ -92,12 +94,12 @@ public class UriTest {
     /*
      * If no match is found, a CatalogException should be thrown.
      */
-    @Test(expectedExceptions = CatalogException.class)
+    @Test
     public void testNoMatch() {
-        checkNoUriMatch(createResolver());
+        assertThrows(CatalogException.class, () -> checkNoUriMatch(createResolver()));
     }
 
-    private CatalogResolver createResolver() {
+    private static CatalogResolver createResolver() {
         return catalogUriResolver(CATALOG_URI);
     }
 }
diff --git a/test/jaxp/javax/xml/jaxp/functional/catalog/UrnUnwrappingTest.java b/test/jaxp/javax/xml/jaxp/functional/catalog/UrnUnwrappingTest.java
index f3b99074e98..765e315bd6e 100644
--- a/test/jaxp/javax/xml/jaxp/functional/catalog/UrnUnwrappingTest.java
+++ b/test/jaxp/javax/xml/jaxp/functional/catalog/UrnUnwrappingTest.java
@@ -23,32 +23,32 @@
 
 package catalog;
 
-import static catalog.CatalogTestUtils.catalogResolver;
-import static catalog.ResolutionChecker.checkPubIdResolution;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
 
 import javax.xml.catalog.CatalogResolver;
 
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
+import static catalog.CatalogTestUtils.catalogResolver;
+import static catalog.ResolutionChecker.checkPubIdResolution;
 
 /*
  * @test
  * @bug 8077931
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm catalog.UrnUnwrappingTest
+ * @run junit/othervm catalog.UrnUnwrappingTest
  * @summary If the passed public identifier is started with "urn:publicid:",
  *          it has to be regarded as URN and normalized. And then the catalog
  *          resolver uses the normalized stuff to do matching.
  */
 public class UrnUnwrappingTest {
 
-    @Test(dataProvider = "urn-matchedUri")
+    @ParameterizedTest
+    @MethodSource("data")
     public void testUnwrapping(String urn, String matchedUri) {
         checkPubIdResolution(createResolver(), urn, matchedUri);
     }
 
-    @DataProvider(name = "urn-matchedUri")
-    public Object[][] data() {
+    public static Object[][] data() {
         return new Object[][] {
                 // The specified public id is URN format.
                 { "urn:publicid:-:REMOTE:DTD+ALICE+DOCALICE+XML:EN",
@@ -60,7 +60,7 @@ public class UrnUnwrappingTest {
                         "http://local/base/dtd/docBobPub.dtd" } };
     }
 
-    private CatalogResolver createResolver() {
+    private static CatalogResolver createResolver() {
         return catalogResolver("urnUnwrapping.xml");
     }
 }
diff --git a/test/jaxp/javax/xml/jaxp/functional/catalog/ValidateCatalogTest.java b/test/jaxp/javax/xml/jaxp/functional/catalog/ValidateCatalogTest.java
index 04676557ea4..c8316c085a2 100644
--- a/test/jaxp/javax/xml/jaxp/functional/catalog/ValidateCatalogTest.java
+++ b/test/jaxp/javax/xml/jaxp/functional/catalog/ValidateCatalogTest.java
@@ -23,22 +23,23 @@
 
 package catalog;
 
+import org.junit.jupiter.api.Test;
+
+import javax.xml.catalog.CatalogException;
+
 import static catalog.CatalogTestUtils.CATALOG_SYSTEM;
 import static catalog.CatalogTestUtils.CATALOG_URI;
 import static catalog.CatalogTestUtils.catalogResolver;
 import static catalog.CatalogTestUtils.catalogUriResolver;
 import static catalog.ResolutionChecker.checkSysIdResolution;
 import static catalog.ResolutionChecker.checkUriResolution;
-
-import javax.xml.catalog.CatalogException;
-
-import org.testng.annotations.Test;
+import static org.junit.jupiter.api.Assertions.assertThrows;
 
 /*
  * @test
  * @bug 8077931
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm catalog.ValidateCatalogTest
+ * @run junit/othervm catalog.ValidateCatalogTest
  * @summary A legal catalog file must be well-formed XML, the root element
  *          must be catalog, and the naming space of the root element must be
  *          urn:oasis:names:tc:entity:xmlns:xml:catalog.
@@ -52,36 +53,36 @@ public class ValidateCatalogTest {
      * EntityResolver tries to load catalog with wrong root,
      * it should throw CatalogException.
      */
-    @Test(expectedExceptions = CatalogException.class)
+    @Test
     public void validateWrongRootCatalogOnEntityResolver() {
-        catalogResolver(CATALOG_WRONGROOT);
+        assertThrows(CatalogException.class, () -> catalogResolver(CATALOG_WRONGROOT));
     }
 
     /*
      * URIResolver tries to load catalog with wrong root,
      * it should throw CatalogException.
      */
-    @Test(expectedExceptions = CatalogException.class)
+    @Test
     public void validateWrongRootCatalogOnUriResolver() {
-        catalogUriResolver(CATALOG_WRONGROOT);
+        assertThrows(CatalogException.class, () -> catalogUriResolver(CATALOG_WRONGROOT));
     }
 
     /*
      * EntityResolver tries to load malformed catalog,
      * it should throw RuntimeException.
      */
-    @Test(expectedExceptions = RuntimeException.class)
+    @Test
     public void validateMalformedCatalogOnEntityResolver() {
-        catalogResolver(CATALOG_MALFORMED);
+        assertThrows(RuntimeException.class, () -> catalogResolver(CATALOG_MALFORMED));
     }
 
     /*
      * UriResolver tries to load malformed catalog,
      * it should throw RuntimeException.
      */
-    @Test(expectedExceptions = RuntimeException.class)
+    @Test
     public void validateMalformedCatalogOnUriResolver() {
-        catalogUriResolver(CATALOG_MALFORMED);
+        assertThrows(RuntimeException.class, () -> catalogUriResolver(CATALOG_MALFORMED));
     }
 
     /*
diff --git a/test/jaxp/javax/xml/jaxp/libs/catalog/CatalogTestUtils.java b/test/jaxp/javax/xml/jaxp/libs/catalog/CatalogTestUtils.java
index 6253e26d6e4..a6ab94b9d7e 100644
--- a/test/jaxp/javax/xml/jaxp/libs/catalog/CatalogTestUtils.java
+++ b/test/jaxp/javax/xml/jaxp/libs/catalog/CatalogTestUtils.java
@@ -30,12 +30,10 @@ import java.nio.file.Files;
 import java.nio.file.Path;
 import java.nio.file.Paths;
 import java.util.Map;
-import java.util.stream.Collectors;
 import java.util.stream.Stream;
 import javax.xml.catalog.CatalogFeatures;
 import javax.xml.catalog.CatalogManager;
 import javax.xml.catalog.CatalogResolver;
-import jaxp.library.JAXPTestUtilities;
 
 /*
  * Utilities for testing XML Catalog API.
@@ -69,6 +67,9 @@ final class CatalogTestUtils {
     private static final String JAXP_PROPS = "jaxp.properties";
     private static final String JAXP_PROPS_BAK = JAXP_PROPS + ".bak";
 
+    private static final Path CATALOG_DIR =
+            Path.of(System.getProperty("test.src")).resolve("catalogFiles").normalize().toAbsolutePath();
+
     private CatalogTestUtils() { }
 
     /* ********** create resolver ********** */
@@ -109,19 +110,12 @@ final class CatalogTestUtils {
 
     // Gets the paths of the specified catalogs.
     private static URI[] getCatalogPaths(String... catalogNames) {
-        return catalogNames == null
-                ? null
-                : Stream.of(catalogNames).map(
-                        catalogName -> getCatalogPath(catalogName)).collect(
-                                Collectors.toList()).toArray(new URI[0]);
+        return Stream.of(catalogNames).map(CatalogTestUtils::getCatalogPath).toList().toArray(new URI[0]);
     }
 
     // Gets the paths of the specified catalogs.
     static URI getCatalogPath(String catalogName) {
-        return catalogName == null
-                ? null
-                : Paths.get(JAXPTestUtilities.getPathByClassName(CatalogTestUtils.class, "catalogFiles")
-                        + catalogName).toUri();
+        return CATALOG_DIR.resolve(catalogName).toUri();
     }
 
     /* ********** jaxp.properties ********** */
diff --git a/test/jaxp/javax/xml/jaxp/libs/catalog/ResolutionChecker.java b/test/jaxp/javax/xml/jaxp/libs/catalog/ResolutionChecker.java
index 81013a5a7bd..1e06a353c24 100644
--- a/test/jaxp/javax/xml/jaxp/libs/catalog/ResolutionChecker.java
+++ b/test/jaxp/javax/xml/jaxp/libs/catalog/ResolutionChecker.java
@@ -25,12 +25,13 @@ package catalog;
 
 import javax.xml.catalog.CatalogResolver;
 
-import org.testng.Assert;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertThrows;
 
 /*
  * Utilities for checking catalog resolution.
  */
-class ResolutionChecker {
+final class ResolutionChecker {
 
     /* ********** Checks normal resolution ********** */
 
@@ -38,8 +39,8 @@ class ResolutionChecker {
      * Checks the resolution result for specified external identifier.
      */
     static void checkExtIdResolution(CatalogResolver resolver,
-            String publicId, String systemId, String matchedUri) {
-        Assert.assertEquals(
+                                     String publicId, String systemId, String matchedUri) {
+        assertEquals(
                 resolver.resolveEntity(publicId, getNotSpecified(systemId)).getSystemId(),
                 matchedUri);
     }
@@ -65,8 +66,8 @@ class ResolutionChecker {
      * with the specified base location.
      */
     static void checkUriResolution(CatalogResolver resolver,
-            String href, String base, String matchedUri) {
-        Assert.assertEquals(resolver.resolve(href, base).getSystemId(),
+                                   String href, String base, String matchedUri) {
+        assertEquals(resolver.resolve(href, base).getSystemId(),
                 matchedUri);
     }
 
@@ -106,9 +107,9 @@ class ResolutionChecker {
     static <T extends Throwable> void expectExceptionOnExtId(
             CatalogResolver resolver, String publicId, String systemId,
             Class<T> expectedExceptionClass) {
-        expectThrows(expectedExceptionClass, () -> {
-            resolver.resolveEntity(publicId, getNotSpecified(systemId));
-        });
+        assertThrows(
+                expectedExceptionClass,
+                () -> resolver.resolveEntity(publicId, getNotSpecified(systemId)));
     }
 
     /*
@@ -140,9 +141,7 @@ class ResolutionChecker {
     static <T extends Throwable> void expectExceptionOnUri(
             CatalogResolver resolver, String href, String base,
             Class<T> expectedExceptionClass) {
-        expectThrows(expectedExceptionClass, () -> {
-            resolver.resolve(href, base);
-        });
+        assertThrows(expectedExceptionClass, () -> resolver.resolve(href, base));
     }
 
     /*
@@ -155,31 +154,6 @@ class ResolutionChecker {
         expectExceptionOnUri(resolver, href, null, expectedExceptionClass);
     }
 
-    // The TestNG distribution in current JTREG build doesn't support
-    // method Assert.expectThrows().
-    private static <T extends Throwable> T expectThrows(Class<T> throwableClass,
-            ThrowingRunnable runnable) {
-        try {
-            runnable.run();
-        } catch (Throwable t) {
-            if (throwableClass.isInstance(t)) {
-                return throwableClass.cast(t);
-            } else {
-                String mismatchMessage = String.format(
-                        "Expected %s to be thrown, but %s was thrown",
-                        throwableClass.getSimpleName(),
-                        t.getClass().getSimpleName());
-
-                throw new AssertionError(mismatchMessage, t);
-            }
-        }
-
-        String message = String.format(
-                "Expected %s to be thrown, but nothing was thrown",
-                throwableClass.getSimpleName());
-        throw new AssertionError(message);
-    }
-
     /*
      * SystemId can never be null in XML. For publicId tests, if systemId is null,
      * it will be considered as not-specified instead. A non-existent systemId
@@ -191,8 +165,4 @@ class ResolutionChecker {
         }
         return systemId;
     }
-
-    private interface ThrowingRunnable {
-        void run() throws Throwable;
-    }
 }

From 375f8216271b370740658c40e826ae47e13a07fb Mon Sep 17 00:00:00 2001
From: Weijun Wang <weijun@openjdk.org>
Date: Mon, 9 Mar 2026 13:54:11 +0000
Subject: [PATCH 101/655] 8379515: draft-ietf-lamps-kyber-certificates is now
 RFC 9935

Reviewed-by: mullan
---
 .../share/classes/sun/security/util/KeyChoices.java  |  4 ++--
 src/java.base/share/conf/security/java.security      |  2 +-
 .../security/provider/pqc/PrivateKeyEncodings.java   | 12 ++++++------
 3 files changed, 9 insertions(+), 9 deletions(-)

diff --git a/src/java.base/share/classes/sun/security/util/KeyChoices.java b/src/java.base/share/classes/sun/security/util/KeyChoices.java
index da3c611750e..00c4463d098 100644
--- a/src/java.base/share/classes/sun/security/util/KeyChoices.java
+++ b/src/java.base/share/classes/sun/security/util/KeyChoices.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2025, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -45,7 +45,7 @@ import java.util.function.BiFunction;
  * </pre>
  * This class supports reading, writing, and converting between them.
  * <p>
- * Current code follows draft-ietf-lamps-kyber-certificates-11 and RFC 9881.
+ * Current code follows RFC 9935 and RFC 9881.
  */
 public final class KeyChoices {
 
diff --git a/src/java.base/share/conf/security/java.security b/src/java.base/share/conf/security/java.security
index ef4d7285f51..d5d0488a004 100644
--- a/src/java.base/share/conf/security/java.security
+++ b/src/java.base/share/conf/security/java.security
@@ -1704,7 +1704,7 @@ com.sun.security.allowedAIALocations=
 #
 # PKCS #8 encoding format for newly created ML-KEM and ML-DSA private keys
 #
-# draft-ietf-lamps-kyber-certificates-11 and RFC 9881 define three possible formats for a private key:
+# RFC 9935 and RFC 9881 define three possible formats for a private key:
 # a seed (64 bytes for ML-KEM, 32 bytes for ML-DSA), an expanded private key,
 # or a sequence containing both.
 #
diff --git a/test/jdk/sun/security/provider/pqc/PrivateKeyEncodings.java b/test/jdk/sun/security/provider/pqc/PrivateKeyEncodings.java
index 25060d0b74e..39183eb9881 100644
--- a/test/jdk/sun/security/provider/pqc/PrivateKeyEncodings.java
+++ b/test/jdk/sun/security/provider/pqc/PrivateKeyEncodings.java
@@ -26,7 +26,7 @@
  * @bug 8347938
  * @library /test/lib
  * @summary ensure ML-KEM and ML-DSA encodings consistent with
- *      draft-ietf-lamps-kyber-certificates-11 and RFC 9881
+ *      RFC 9935 and RFC 9881
  * @modules java.base/com.sun.crypto.provider
  *          java.base/sun.security.pkcs
  *          java.base/sun.security.provider
@@ -62,17 +62,17 @@ import java.util.stream.Collectors;
 public class PrivateKeyEncodings {
 
     public static void main(String[] args) throws Exception {
-        // Example keys and certificates draft-ietf-lamps-kyber-certificates-11, Appendix B
-        // (https://datatracker.ietf.org/doc/html/draft-ietf-lamps-kyber-certificates-11#autoid-17)
-        // and RFC 9881, Appendix C.3
-        // (https://datatracker.ietf.org/doc/html/rfc9881#name-example-certificates)
+        // Example keys and certificates in RFC 9935, Appendix C
+        // (https://datatracker.ietf.org/doc/html/rfc9935#name-examples)
+        // and RFC 9881, Appendix C
+        // (https://datatracker.ietf.org/doc/html/rfc9881#name-examples)
         //
         // These data can be retrieved from the following GitHub releases:
         //   https://github.com/lamps-wg/kyber-certificates/releases/tag/draft-ietf-lamps-kyber-certificates-11
         //   https://github.com/lamps-wg/dilithium-certificates/releases/tag/draft-ietf-lamps-dilithium-certificates-13
         //
         // Although the release tags include "draft", these values are the
-        // same as those in the final RFC 9881.
+        // same as those in the final RFCs.
         try (var kemReader = RepositoryFileReader.of(RepositoryFileReader.KYBER_CERTIFICATES.class,
                     "kyber-certificates-draft-ietf-lamps-kyber-certificates-11/");
              var dsaReader = RepositoryFileReader.of(RepositoryFileReader.DILITHIUM_CERTIFICATES.class,

From b9e7ca9cff2b0d2fbffd64e1fe44b049bd0b8935 Mon Sep 17 00:00:00 2001
From: Viktor Klang <vklang@openjdk.org>
Date: Mon, 9 Mar 2026 14:12:03 +0000
Subject: [PATCH 102/655] 8375130: [BACKOUT] Scalability issue when submitting
 virtual threads with almost empty tasks

Reviewed-by: alanb
---
 .../java/util/concurrent/ForkJoinPool.java    | 629 +++++++++---------
 .../util/concurrent/forkjoin/Starvation.java  |  20 +-
 2 files changed, 326 insertions(+), 323 deletions(-)

diff --git a/src/java.base/share/classes/java/util/concurrent/ForkJoinPool.java b/src/java.base/share/classes/java/util/concurrent/ForkJoinPool.java
index f289186e0ad..e83a92e5e6f 100644
--- a/src/java.base/share/classes/java/util/concurrent/ForkJoinPool.java
+++ b/src/java.base/share/classes/java/util/concurrent/ForkJoinPool.java
@@ -560,70 +560,89 @@ public class ForkJoinPool extends AbstractExecutorService
      * access (which is usually needed anyway).
      *
      * Signalling. Signals (in signalWork) cause new or reactivated
-     * workers to scan for tasks.  SignalWork is invoked in two cases:
-     * (1) When a task is pushed onto an empty queue, and (2) When a
-     * worker takes a top-level task from a queue that has additional
-     * tasks. Together, these suffice in O(log(#threads)) steps to
-     * fully activate with at least enough workers, and ideally no
-     * more than required.  This ideal is unobtainable: Callers do not
-     * know whether another worker will finish its current task and
-     * poll for others without need of a signal (which is otherwise an
-     * advantage of work-stealing vs other schemes), and also must
-     * conservatively estimate the triggering conditions of emptiness
-     * or non-emptiness; all of which usually cause more activations
-     * than necessary (see below). (Method signalWork is also used as
-     * failsafe in case of Thread failures in deregisterWorker, to
-     * activate or create a new worker to replace them).
+     * workers to scan for tasks.  Method signalWork and its callers
+     * try to approximate the unattainable goal of having the right
+     * number of workers activated for the tasks at hand, but must err
+     * on the side of too many workers vs too few to avoid stalls:
      *
-     * Top-Level scheduling
-     * ====================
+     *  * If computations are purely tree structured, it suffices for
+     *    every worker to activate another when it pushes a task into
+     *    an empty queue, resulting in O(log(#threads)) steps to full
+     *    activation. Emptiness must be conservatively approximated,
+     *    which may result in unnecessary signals.  Also, to reduce
+     *    resource usages in some cases, at the expense of slower
+     *    startup in others, activation of an idle thread is preferred
+     *    over creating a new one, here and elsewhere.
+     *
+     *  * At the other extreme, if "flat" tasks (those that do not in
+     *    turn generate others) come in serially from only a single
+     *    producer, each worker taking a task from a queue should
+     *    propagate a signal if there are more tasks in that
+     *    queue. This is equivalent to, but generally faster than,
+     *    arranging the stealer take multiple tasks, re-pushing one or
+     *    more on its own queue, and signalling (because its queue is
+     *    empty), also resulting in logarithmic full activation
+     *    time. If tasks do not not engage in unbounded loops based on
+     *    the actions of other workers with unknown dependencies loop,
+     *    this form of proagation can be limited to one signal per
+     *    activation (phase change). We distinguish the cases by
+     *    further signalling only if the task is an InterruptibleTask
+     *    (see below), which are the only supported forms of task that
+     *    may do so.
+     *
+     * * Because we don't know about usage patterns (or most commonly,
+     *    mixtures), we use both approaches, which present even more
+     *    opportunities to over-signal. (Failure to distinguish these
+     *    cases in terms of submission methods was arguably an early
+     *    design mistake.)  Note that in either of these contexts,
+     *    signals may be (and often are) unnecessary because active
+     *    workers continue scanning after running tasks without the
+     *    need to be signalled (which is one reason work stealing is
+     *    often faster than alternatives), so additional workers
+     *    aren't needed.
+     *
+     * * For rapidly branching tasks that require full pool resources,
+     *   oversignalling is OK, because signalWork will soon have no
+     *   more workers to create or reactivate. But for others (mainly
+     *   externally submitted tasks), overprovisioning may cause very
+     *   noticeable slowdowns due to contention and resource
+     *   wastage. We reduce impact by deactivating workers when
+     *   queues don't have accessible tasks, but reactivating and
+     *   rescanning if other tasks remain.
+     *
+     * * Despite these, signal contention and overhead effects still
+     *   occur during ramp-up and ramp-down of small computations.
      *
      * Scanning. Method runWorker performs top-level scanning for (and
      * execution of) tasks by polling a pseudo-random permutation of
      * the array (by starting at a given index, and using a constant
      * cyclically exhaustive stride.)  It uses the same basic polling
      * method as WorkQueue.poll(), but restarts with a different
-     * permutation on each rescan.  The pseudorandom generator need
-     * not have high-quality statistical properties in the long
+     * permutation on each invocation.  The pseudorandom generator
+     * need not have high-quality statistical properties in the long
      * term. We use Marsaglia XorShifts, seeded with the Weyl sequence
-     * from ThreadLocalRandom probes, which are cheap and suffice.
+     * from ThreadLocalRandom probes, which are cheap and
+     * suffice. Each queue's polling attempts to avoid becoming stuck
+     * when other scanners/pollers stall.  Scans do not otherwise
+     * explicitly take into account core affinities, loads, cache
+     * localities, etc, However, they do exploit temporal locality
+     * (which usually approximates these) by preferring to re-poll
+     * from the same queue after a successful poll before trying
+     * others, which also reduces bookkeeping, cache traffic, and
+     * scanning overhead. But it also reduces fairness, which is
+     * partially counteracted by giving up on detected interference
+     * (which also reduces contention when too many workers try to
+     * take small tasks from the same queue).
      *
      * Deactivation. When no tasks are found by a worker in runWorker,
-     * it invokes deactivate, that first deactivates (to an IDLE
-     * phase).  Avoiding missed signals during deactivation requires a
-     * (conservative) rescan, reactivating if there may be tasks to
-     * poll. Because idle workers are often not yet blocked (parked),
-     * we use a WorkQueue field to advertise that a waiter actually
-     * needs unparking upon signal.
-     *
-     * When tasks are constructed as (recursive) DAGs, top-level
-     * scanning is usually infrequent, and doesn't encounter most
-     * of the following problems addressed by runWorker and awaitWork:
-     *
-     * Locality. Polls are organized into "runs", continuing until
-     * empty or contended, while also minimizing interference by
-     * postponing bookeeping to ends of runs. This may reduce
-     * fairness.
-     *
-     * Contention. When many workers try to poll few queues, they
-     * often collide, generating CAS failures and disrupting locality
-     * of workers already running their tasks. This also leads to
-     * stalls when tasks cannot be taken because other workers have
-     * not finished poll operations, which is detected by reading
-     * ahead in queue arrays. In both cases, workers restart scans in a
-     * way that approximates randomized backoff.
-     *
-     * Oversignalling. When many short top-level tasks are present in
-     * a small number of queues, the above signalling strategy may
-     * activate many more workers than needed, worsening locality and
-     * contention problems, while also generating more global
-     * contention (field ctl is CASed on every activation and
-     * deactivation). We filter out (both in runWorker and
-     * signalWork) attempted signals that are surely not needed
-     * because the signalled tasks are already taken.
-     *
-     * Shutdown and Quiescence
-     * =======================
+     * it tries to deactivate()), giving up (and rescanning) on "ctl"
+     * contention. To avoid missed signals during deactivation, the
+     * method rescans and reactivates if there may have been a missed
+     * signal during deactivation. To reduce false-alarm reactivations
+     * while doing so, we scan multiple times (analogously to method
+     * quiescent()) before trying to reactivate.  Because idle workers
+     * are often not yet blocked (parked), we use a WorkQueue field to
+     * advertise that a waiter actually needs unparking upon signal.
      *
      * Quiescence. Workers scan looking for work, giving up when they
      * don't find any, without being sure that none are available.
@@ -873,7 +892,9 @@ public class ForkJoinPool extends AbstractExecutorService
      * shutdown, runners are interrupted so they can cancel. Since
      * external joining callers never run these tasks, they must await
      * cancellation by others, which can occur along several different
-     * paths.
+     * paths. The inability to rely on caller-runs may also require
+     * extra signalling (resulting in scanning and contention) so is
+     * done only conditionally in methods push and runworker.
      *
      * Across these APIs, rules for reporting exceptions for tasks
      * with results accessed via join() differ from those via get(),
@@ -940,13 +961,9 @@ public class ForkJoinPool extends AbstractExecutorService
      * less-contended applications. To help arrange this, some
      * non-reference fields are declared as "long" even when ints or
      * shorts would suffice.  For class WorkQueue, an
-     * embedded @Contended isolates the very busy top index, along
-     * with status and bookkeeping fields written (mostly) by owners,
-     * that otherwise interfere with reading array and base
-     * fields. There are other variables commonly contributing to
-     * false-sharing-related performance issues (including fields of
-     * class Thread), but we can't do much about this except try to
-     * minimize access.
+     * embedded @Contended region segregates fields most heavily
+     * updated by owners from those most commonly read by stealers or
+     * other management.
      *
      * Initial sizing and resizing of WorkQueue arrays is an even more
      * delicate tradeoff because the best strategy systematically
@@ -955,11 +972,13 @@ public class ForkJoinPool extends AbstractExecutorService
      * direct false-sharing and indirect cases due to GC bookkeeping
      * (cardmarks etc), and reduce the number of resizes, which are
      * not especially fast because they require atomic transfers.
-     * Currently, arrays are initialized to be just large enough to
-     * avoid resizing in most tree-structured tasks, but grow rapidly
-     * until large.  (Maintenance note: any changes in fields, queues,
-     * or their uses, or JVM layout policies, must be accompanied by
-     * re-evaluation of these placement and sizing decisions.)
+     * Currently, arrays for workers are initialized to be just large
+     * enough to avoid resizing in most tree-structured tasks, but
+     * larger for external queues where both false-sharing problems
+     * and the need for resizing are more common. (Maintenance note:
+     * any changes in fields, queues, or their uses, or JVM layout
+     * policies, must be accompanied by re-evaluation of these
+     * placement and sizing decisions.)
      *
      * Style notes
      * ===========
@@ -1042,11 +1061,17 @@ public class ForkJoinPool extends AbstractExecutorService
     static final int DEFAULT_COMMON_MAX_SPARES = 256;
 
     /**
-     * Initial capacity of work-stealing queue array.
+     * Initial capacity of work-stealing queue array for workers.
      * Must be a power of two, at least 2. See above.
      */
     static final int INITIAL_QUEUE_CAPACITY = 1 << 6;
 
+    /**
+     * Initial capacity of work-stealing queue array for external queues.
+     * Must be a power of two, at least 2. See above.
+     */
+    static final int INITIAL_EXTERNAL_QUEUE_CAPACITY = 1 << 9;
+
     // conversions among short, int, long
     static final int  SMASK           = 0xffff;      // (unsigned) short bits
     static final long LMASK           = 0xffffffffL; // lower 32 bits of long
@@ -1186,11 +1211,11 @@ public class ForkJoinPool extends AbstractExecutorService
         @jdk.internal.vm.annotation.Contended("w")
         int stackPred;             // pool stack (ctl) predecessor link
         @jdk.internal.vm.annotation.Contended("w")
-        volatile int parking;      // nonzero if parked in awaitWork
-        @jdk.internal.vm.annotation.Contended("w")
         volatile int source;       // source queue id (or DROPPED)
         @jdk.internal.vm.annotation.Contended("w")
         int nsteals;               // number of steals from other queues
+        @jdk.internal.vm.annotation.Contended("w")
+        volatile int parking;      // nonzero if parked in awaitWork
 
         // Support for atomic operations
         private static final Unsafe U;
@@ -1223,11 +1248,11 @@ public class ForkJoinPool extends AbstractExecutorService
          */
         WorkQueue(ForkJoinWorkerThread owner, int id, int cfg,
                   boolean clearThreadLocals) {
+            array = new ForkJoinTask<?>[owner == null ?
+                                        INITIAL_EXTERNAL_QUEUE_CAPACITY :
+                                        INITIAL_QUEUE_CAPACITY];
+            this.owner = owner;
             this.config = (clearThreadLocals) ? cfg | CLEAR_TLS : cfg;
-            if ((this.owner = owner) == null) {
-                array = new ForkJoinTask<?>[INITIAL_QUEUE_CAPACITY];
-                phase = id | IDLE;
-            }
         }
 
         /**
@@ -1254,27 +1279,27 @@ public class ForkJoinPool extends AbstractExecutorService
          * @throws RejectedExecutionException if array could not be resized
          */
         final void push(ForkJoinTask<?> task, ForkJoinPool pool, boolean internal) {
-            int s = top, b = base, m, cap, room; ForkJoinTask<?>[] a, na;
-            if ((a = array) != null && (cap = a.length) > 0) { // else disabled
-                int k = (m = cap - 1) & s;
-                if ((room = m - (s - b)) >= 0) {
+            int s = top, b = base, m, cap, room; ForkJoinTask<?>[] a;
+            if ((a = array) != null && (cap = a.length) > 0 && // else disabled
+                task != null) {
+                int pk = task.noUserHelp() + 1;             // prev slot offset
+                if ((room = (m = cap - 1) - (s - b)) >= 0) {
                     top = s + 1;
-                    long pos = slotOffset(k);
+                    long pos = slotOffset(m & s);
                     if (!internal)
                         U.putReference(a, pos, task);       // inside lock
                     else
                         U.getAndSetReference(a, pos, task); // fully fenced
-                    if (room == 0 && (na = growArray(a, cap, s)) != null)
-                        k = ((a = na).length - 1) & s;      // resize
+                    if (room == 0)                          // resize
+                        growArray(a, cap, s);
                 }
                 if (!internal)
                     unlockPhase();
                 if (room < 0)
                     throw new RejectedExecutionException("Queue capacity exceeded");
-                if (pool != null &&
-                    (room == 0 ||
-                     U.getReferenceAcquire(a, slotOffset(m & (s - 1))) == null))
-                    pool.signalWork(a, k);    // may have appeared empty
+                if ((room == 0 || U.getReferenceAcquire(a, slotOffset(m & (s - pk))) == null) &&
+                    pool != null)
+                    pool.signalWork();   // may have appeared empty
             }
         }
 
@@ -1283,12 +1308,11 @@ public class ForkJoinPool extends AbstractExecutorService
          * @param a old array
          * @param cap old array capacity
          * @param s current top
-         * @return new array, or null on failure
          */
-        private ForkJoinTask<?>[] growArray(ForkJoinTask<?>[] a, int cap, int s) {
-            int newCap = (cap >= 1 << 16) ? cap << 1 : cap << 2;
-            ForkJoinTask<?>[] newArray = null;
+        private void growArray(ForkJoinTask<?>[] a, int cap, int s) {
+            int newCap = cap << 1;
             if (a != null && a.length == cap && cap > 0 && newCap > 0) {
+                ForkJoinTask<?>[] newArray = null;
                 try {
                     newArray = new ForkJoinTask<?>[newCap];
                 } catch (OutOfMemoryError ex) {
@@ -1305,45 +1329,34 @@ public class ForkJoinPool extends AbstractExecutorService
                     updateArray(newArray);           // fully fenced
                 }
             }
-            return newArray;
         }
 
         /**
-         * Takes next task, if one exists, in lifo order.
+         * Takes next task, if one exists, in order specified by mode,
+         * so acts as either local-pop or local-poll. Called only by owner.
+         * @param fifo nonzero if FIFO mode
          */
-        private ForkJoinTask<?> localPop() {
+        private ForkJoinTask<?> nextLocalTask(int fifo) {
             ForkJoinTask<?> t = null;
-            int s = top - 1, cap; long k; ForkJoinTask<?>[] a;
-            if ((a = array) != null && (cap = a.length) > 0 &&
-                U.getReference(a, k = slotOffset((cap - 1) & s)) != null &&
-                (t = (ForkJoinTask<?>)U.getAndSetReference(a, k, null)) != null)
-                updateTop(s);
-            return t;
-        }
-
-        /**
-         * Takes next task, if one exists, in fifo order.
-         */
-        private ForkJoinTask<?> localPoll() {
-            ForkJoinTask<?> t = null;
-            int p = top, cap; ForkJoinTask<?>[] a;
-            if ((a = array) != null && (cap = a.length) > 0) {
-                for (int b = base; p - b > 0; ) {
-                    int nb = b + 1;
-                    long k = slotOffset((cap - 1) & b);
-                    if (U.getReference(a, k) == null) {
-                        if (nb == p)
-                            break;          // else base is lagging
-                        while (b == (b = U.getIntAcquire(this, BASE)))
-                            Thread.onSpinWait(); // spin to reduce memory traffic
+            ForkJoinTask<?>[] a = array;
+            int b = base, p = top, cap;
+            if (p - b > 0 && a != null && (cap = a.length) > 0) {
+                for (int m = cap - 1, s, nb;;) {
+                    if (fifo == 0 || (nb = b + 1) == p) {
+                        if ((t = (ForkJoinTask<?>)U.getAndSetReference(
+                                 a, slotOffset(m & (s = p - 1)), null)) != null)
+                            updateTop(s);       // else lost race for only task
+                        break;
                     }
-                    else if ((t = (ForkJoinTask<?>)
-                              U.getAndSetReference(a, k, null)) != null) {
+                    if ((t = (ForkJoinTask<?>)U.getAndSetReference(
+                             a, slotOffset(m & b), null)) != null) {
                         updateBase(nb);
                         break;
                     }
-                    else
-                        b = base;
+                    while (b == (b = U.getIntAcquire(this, BASE)))
+                        Thread.onSpinWait();    // spin to reduce memory traffic
+                    if (p - b <= 0)
+                        break;
                 }
             }
             return t;
@@ -1351,9 +1364,10 @@ public class ForkJoinPool extends AbstractExecutorService
 
         /**
          * Takes next task, if one exists, using configured mode.
+         * (Always internal, never called for Common pool.)
          */
         final ForkJoinTask<?> nextLocalTask() {
-            return (config & FIFO) == 0 ? localPop() : localPoll();
+            return nextLocalTask(config & FIFO);
         }
 
         /**
@@ -1429,12 +1443,12 @@ public class ForkJoinPool extends AbstractExecutorService
         // specialized execution methods
 
         /**
-         * Runs the given task, as well as remaining local tasks
+         * Runs the given task, as well as remaining local tasks.
          */
         final void topLevelExec(ForkJoinTask<?> task, int fifo) {
             while (task != null) {
                 task.doExec();
-                task = (fifo != 0) ? localPoll() : localPop();
+                task = nextLocalTask(fifo);
             }
         }
 
@@ -1564,7 +1578,7 @@ public class ForkJoinPool extends AbstractExecutorService
          * Cancels all local tasks. Called only by owner.
          */
         final void cancelTasks() {
-            for (ForkJoinTask<?> t; (t = localPop()) != null; ) {
+            for (ForkJoinTask<?> t; (t = nextLocalTask(0)) != null; ) {
                 try {
                     t.cancel(false);
                 } catch (Throwable ignore) {
@@ -1766,8 +1780,7 @@ public class ForkJoinPool extends AbstractExecutorService
      * @param w caller's WorkQueue
      */
     final void registerWorker(WorkQueue w) {
-        if (w != null) {
-            w.array = new ForkJoinTask<?>[INITIAL_QUEUE_CAPACITY];
+        if (w != null && (runState & STOP) == 0L) {
             ThreadLocalRandom.localInit();
             int seed = w.stackPred = ThreadLocalRandom.getProbe();
             int phaseSeq = seed & ~((IDLE << 1) - 1); // initial phase tag
@@ -1845,18 +1858,17 @@ public class ForkJoinPool extends AbstractExecutorService
         }
         if ((tryTerminate(false, false) & STOP) == 0L &&
             phase != 0 && w != null && w.source != DROPPED) {
+            signalWork();                  // possibly replace
             w.cancelTasks();               // clean queue
-            signalWork(null, 0);           // possibly replace
         }
         if (ex != null)
             ForkJoinTask.rethrow(ex);
     }
 
     /**
-     * Releases an idle worker, or creates one if not enough exist,
-     * giving up if array a is nonnull and task at a[k] already taken.
+     * Releases an idle worker, or creates one if not enough exist.
      */
-    final void signalWork(ForkJoinTask<?>[] a, int k) {
+    final void signalWork() {
         int pc = parallelism;
         for (long c = ctl;;) {
             WorkQueue[] qs = queues;
@@ -1872,15 +1884,13 @@ public class ForkJoinPool extends AbstractExecutorService
             if (sp == 0) {
                 if ((short)(c >>> TC_SHIFT) >= pc)
                     break;
-                nc = ((c + TC_UNIT) & TC_MASK) | ac;
+                nc = ((c + TC_UNIT) & TC_MASK);
             }
             else if ((v = w) == null)
                 break;
             else
-                nc = (v.stackPred & LMASK) | (c & TC_MASK) | ac;
-            if (a != null && k < a.length && k >= 0 && a[k] == null)
-                break;
-            if (c == (c = ctl) && c == (c = compareAndExchangeCtl(c, nc))) {
+                nc = (v.stackPred & LMASK) | (c & TC_MASK);
+            if (c == (c = compareAndExchangeCtl(c, nc | ac))) {
                 if (v == null)
                     createWorker();
                 else {
@@ -1963,196 +1973,178 @@ public class ForkJoinPool extends AbstractExecutorService
      * @param w caller's WorkQueue (may be null on failed initialization)
      */
     final void runWorker(WorkQueue w) {
-        if (w != null && w.phase != 0) {                  // else unregistered
-            WorkQueue[] qs;
-            int r = w.stackPred;                          // seed from registerWorker
-            int fifo = (int)config & FIFO, rescans = 0, inactive = 0, taken = 0, n;
-            while ((runState & STOP) == 0L && (qs = queues) != null &&
-                   (n = qs.length) > 0) {
-                int i = r, step = (r >>> 16) | 1;
+        if (w != null) {
+            int phase = w.phase, r = w.stackPred;     // seed from registerWorker
+            int fifo = w.config & FIFO, nsteals = 0, src = -1;
+            for (;;) {
+                WorkQueue[] qs;
                 r ^= r << 13; r ^= r >>> 17; r ^= r << 5; // xorshift
-                scan: for (int j = n; j != 0; --j, i += step) {
-                    WorkQueue q; int qid;
-                    if ((q = qs[qid = i & (n - 1)]) != null) {
-                        ForkJoinTask<?>[] a; int cap;     // poll queue
-                        while ((a = q.array) != null && (cap = a.length) > 0) {
-                            int b, nb, nk; long bp; ForkJoinTask<?> t;
+                if ((runState & STOP) != 0L || (qs = queues) == null)
+                    break;
+                int n = qs.length, i = r, step = (r >>> 16) | 1;
+                boolean rescan = false;
+                scan: for (int l = n; l > 0; --l, i += step) {  // scan queues
+                    int j, cap; WorkQueue q; ForkJoinTask<?>[] a;
+                    if ((q = qs[j = i & (n - 1)]) != null &&
+                        (a = q.array) != null && (cap = a.length) > 0) {
+                        for (int m = cap - 1, pb = -1, b = q.base;;) {
+                            ForkJoinTask<?> t; long k;
                             t = (ForkJoinTask<?>)U.getReferenceAcquire(
-                                a, bp = slotOffset((cap - 1) & (b = q.base)));
-                            long np = slotOffset(nk = (nb = b + 1) & (cap - 1));
-                            if (q.base == b) {            // else inconsistent
-                                if (t == null) {
-                                    if (q.array == a) {   // else resized
-                                        if (rescans > 0)  // ran or stalled
-                                            break scan;
-                                        if (U.getReference(a, np) == null &&
-                                            (rescans >= 0 ||
-                                             (U.getReferenceAcquire(a, bp) == null &&
-                                              q.top == q.base)))
-                                            break;
-                                        rescans = 1;      // may be stalled
+                                a, k = slotOffset(m & b));
+                            if (b != (b = q.base) || t == null ||
+                                !U.compareAndSetReference(a, k, t, null)) {
+                                if (a[b & m] == null) {
+                                    if (rescan)           // end of run
+                                        break scan;
+                                    if (a[(b + 1) & m] == null &&
+                                        a[(b + 2) & m] == null) {
+                                        break;            // probably empty
                                     }
-                                }
-                                else if (inactive != 0) {
-                                    if ((inactive = tryReactivate(w)) != 0) {
-                                        rescans = 1;      // can't take yet
+                                    if (pb == (pb = b)) { // track progress
+                                        rescan = true;    // stalled; reorder scan
                                         break scan;
                                     }
                                 }
-                                else if (U.compareAndSetReference(a, bp, t, null)) {
-                                    q.base = nb;
-                                    Object nt = U.getReferenceAcquire(a, np);
-                                    w.source = qid;
-                                    rescans = 1;
-                                    ++taken;
-                                    if (nt != null &&     // confirm a[nk]
-                                        U.getReferenceAcquire(a, np) == nt)
-                                        signalWork(a, nk); // propagate
-                                    w.topLevelExec(t, fifo);
-                                }
+                            }
+                            else {
+                                boolean propagate;
+                                int nb = q.base = b + 1, prevSrc = src;
+                                w.nsteals = ++nsteals;
+                                w.source = src = j;       // volatile
+                                rescan = true;
+                                int nh = t.noUserHelp();
+                                if (propagate =
+                                    (prevSrc != src || nh != 0) && a[nb & m] != null)
+                                    signalWork();
+                                w.topLevelExec(t, fifo);
+                                if ((b = q.base) != nb && !propagate)
+                                    break scan;          // reduce interference
                             }
                         }
                     }
                 }
-                if (rescans >= 0)
-                    --rescans;
-                else if (inactive == 0) {
-                    if ((inactive = deactivate(w, taken)) != 0)
-                        taken = 0;
+                if (!rescan) {
+                    if (((phase = deactivate(w, phase)) & IDLE) != 0)
+                        break;
+                    src = -1;                            // re-enable propagation
                 }
-                else if (awaitWork(w) == 0)
-                    inactive = rescans = 0;
-                else
-                    break;
             }
         }
     }
 
     /**
-     * Tries to deactivate worker, keeping active on contention
+     * Deactivates and if necessary awaits signal or termination.
      *
-     * @param w the work queue
-     * @param taken number of stolen tasks since last deactivation
-     * @return nonzero if inactive
+     * @param w the worker
+     * @param phase current phase
+     * @return current phase, with IDLE set if worker should exit
      */
-    private int deactivate(WorkQueue w, int taken) {
-        int inactive = 0, phase;
-        if (w != null && (inactive = (phase = w.phase) & IDLE) == 0) {
-            long sp = (phase + (IDLE << 1)) & LMASK, pc, c;
-            w.phase = phase | IDLE;
-            w.stackPred = (int)(pc = ctl);    // set ctl stack link
-            if (!compareAndSetCtl(            // try to enqueue
-                    pc, c = ((pc - RC_UNIT) & UMASK) | sp))
-                w.phase = phase;              // back out on contention
-            else {
-                if (taken != 0) {
-                    w.nsteals += taken;
-                    if ((w.config & CLEAR_TLS) != 0 &&
-                        (Thread.currentThread() instanceof ForkJoinWorkerThread f))
-                        f.resetThreadLocals(); // (instanceof check always true)
-                }
-                if (((c & RC_MASK) == 0L && quiescent() > 0) || taken == 0)
-                    inactive = w.phase & IDLE; // check quiescent termination
-                else {                         // spin for approx 1 scan cost
-                    int tc = (short)(c >>> TC_SHIFT);
-                    int spins = Math.max((tc << 1) + tc, SPIN_WAITS);
-                    while ((inactive = w.phase & IDLE) != 0 && --spins != 0)
-                        Thread.onSpinWait();
-                }
-            }
-        }
-        return inactive;
-    }
+    private int deactivate(WorkQueue w, int phase) {
+        if (w == null)                        // currently impossible
+            return IDLE;
+        int p = phase | IDLE, activePhase = phase + (IDLE << 1);
+        long pc = ctl, qc = (activePhase & LMASK) | ((pc - RC_UNIT) & UMASK);
+        int sp = w.stackPred = (int)pc;       // set ctl stack link
+        w.phase = p;
+        if (!compareAndSetCtl(pc, qc))        // try to enqueue
+            return w.phase = phase;           // back out on possible signal
+        int ac = (short)(qc >>> RC_SHIFT), n; long e; WorkQueue[] qs;
+        if (((e = runState) & STOP) != 0L ||
+            ((e & SHUTDOWN) != 0L && ac == 0 && quiescent() > 0) ||
+            (qs = queues) == null || (n = qs.length) <= 0)
+            return IDLE;                      // terminating
 
-    /**
-     * Reactivates worker w if it is currently top of ctl stack
-     *
-     * @param w the work queue
-     * @return 0 if now active
-     */
-    private int tryReactivate(WorkQueue w) {
-        int inactive = 0;
-        if (w != null) {                         // always true; hoist checks
-            int sp = w.stackPred, phase, activePhase; long c;
-            if ((inactive = (phase = w.phase) & IDLE) != 0 &&
-                (int)(c = ctl) == (activePhase = phase + IDLE) &&
-                compareAndSetCtl(c, (sp & LMASK) | ((c + RC_UNIT) & UMASK))) {
-                w.phase = activePhase;
-                inactive = 0;
-            }
+        for (int prechecks = Math.min(ac, 2), // reactivation threshold
+             k = Math.max(n + (n << 1), SPIN_WAITS << 1);;) {
+            WorkQueue q; int cap; ForkJoinTask<?>[] a; long c;
+            if (w.phase == activePhase)
+                return activePhase;
+            if (--k < 0)
+                return awaitWork(w, p);       // block, drop, or exit
+            if ((q = qs[k & (n - 1)]) == null)
+                Thread.onSpinWait();
+            else if ((a = q.array) != null && (cap = a.length) > 0 &&
+                     a[q.base & (cap - 1)] != null && --prechecks < 0 &&
+                     (int)(c = ctl) == activePhase &&
+                     compareAndSetCtl(c, (sp & LMASK) | ((c + RC_UNIT) & UMASK)))
+                return w.phase = activePhase; // reactivate
         }
-        return inactive;
     }
 
     /**
      * Awaits signal or termination.
      *
      * @param w the work queue
-     * @return 0 if now active
+     * @param p current phase (known to be idle)
+     * @return current phase, with IDLE set if worker should exit
      */
-    private int awaitWork(WorkQueue w) {
-        int inactive = 0, phase;
-        if (w != null) {                          // always true; hoist checks
-            long waitTime = (w.source == INVALID_ID) ? 0L : keepAlive;
-            if ((inactive = (phase = w.phase) & IDLE) != 0) {
+    private int awaitWork(WorkQueue w, int p) {
+        if (w != null) {
+            ForkJoinWorkerThread t; long deadline;
+            if ((w.config & CLEAR_TLS) != 0 && (t = w.owner) != null)
+                t.resetThreadLocals();          // clear before reactivate
+            if ((ctl & RC_MASK) > 0L)
+                deadline = 0L;
+            else if ((deadline =
+                      (((w.source != INVALID_ID) ? keepAlive : TIMEOUT_SLOP)) +
+                      System.currentTimeMillis()) == 0L)
+                deadline = 1L;                 // avoid zero
+            int activePhase = p + IDLE;
+            if ((p = w.phase) != activePhase && (runState & STOP) == 0L) {
                 LockSupport.setCurrentBlocker(this);
-                int activePhase = phase + IDLE;
-                for (long deadline = 0L;;) {
-                    Thread.interrupted();         // clear status
+                w.parking = 1;                 // enable unpark
+                while ((p = w.phase) != activePhase) {
+                    boolean trimmable = false; int trim;
+                    Thread.interrupted();      // clear status
                     if ((runState & STOP) != 0L)
                         break;
-                    boolean trimmable = false;    // use timed wait if trimmable
-                    long d = 0L, c;
-                    if (((c = ctl) & RC_MASK) == 0L && (int)c == activePhase) {
-                        long now = System.currentTimeMillis();
-                        if (deadline == 0L)
-                            deadline = waitTime + now;
-                        if (deadline - now <= TIMEOUT_SLOP) {
-                            if (tryTrim(w, c, activePhase))
-                                break;
-                            continue;             // lost race to trim
-                        }
-                        d = deadline;
-                        trimmable = true;
+                    if (deadline != 0L) {
+                        if ((trim = tryTrim(w, p, deadline)) > 0)
+                            break;
+                        else if (trim < 0)
+                            deadline = 0L;
+                        else
+                            trimmable = true;
                     }
-                    w.parking = 1;                // enable unpark and recheck
-                    if ((inactive = w.phase & IDLE) != 0)
-                        U.park(trimmable, d);
-                    w.parking = 0;                // close unpark window
-                    if (inactive == 0 || (inactive = w.phase & IDLE) == 0)
-                        break;
+                    U.park(trimmable, deadline);
                 }
+                w.parking = 0;
                 LockSupport.setCurrentBlocker(null);
             }
         }
-        return inactive;
+        return p;
     }
 
     /**
      * Tries to remove and deregister worker after timeout, and release
-     * another to do the same unless new tasks are found.
+     * another to do the same.
+     * @return > 0: trimmed, < 0 : not trimmable, else 0
      */
-    private boolean tryTrim(WorkQueue w, long c, int activePhase) {
-        if (w != null) {
-            int vp, i; WorkQueue[] vs; WorkQueue v;
-            long nc = ((w.stackPred & LMASK) |
-                       ((RC_MASK & c) | (TC_MASK & (c - TC_UNIT))));
-            if (compareAndSetCtl(c, nc)) {
-                w.source = DROPPED;
-                w.phase = activePhase;
-                if ((vp = (int)nc) != 0 && (vs = queues) != null &&
-                    vs.length > (i = vp & SMASK) && (v = vs[i]) != null &&
-                    compareAndSetCtl(           // try to wake up next waiter
-                        nc, ((v.stackPred & LMASK) |
-                             ((UMASK & (nc + RC_UNIT)) | (nc & TC_MASK))))) {
-                    v.source = INVALID_ID;      // enable cascaded timeouts
-                    v.phase = vp;
-                    U.unpark(v.owner);
-                }
-                return true;
+    private int tryTrim(WorkQueue w, int phase, long deadline) {
+        long c, nc; int stat, activePhase, vp, i; WorkQueue[] vs; WorkQueue v;
+        if ((activePhase = phase + IDLE) != (int)(c = ctl) || w == null)
+            stat = -1;                      // no longer ctl top
+        else if (deadline - System.currentTimeMillis() >= TIMEOUT_SLOP)
+            stat = 0;                       // spurious wakeup
+        else if (!compareAndSetCtl(
+                     c, nc = ((w.stackPred & LMASK) | (RC_MASK & c) |
+                               (TC_MASK & (c - TC_UNIT)))))
+            stat = -1;                      // lost race to signaller
+        else {
+            stat = 1;
+            w.source = DROPPED;
+            w.phase = activePhase;
+            if ((vp = (int)nc) != 0 && (vs = queues) != null &&
+                vs.length > (i = vp & SMASK) && (v = vs[i]) != null &&
+                compareAndSetCtl(           // try to wake up next waiter
+                    nc, ((UMASK & (nc + RC_UNIT)) |
+                         (nc & TC_MASK) | (v.stackPred & LMASK)))) {
+                v.source = INVALID_ID;      // enable cascaded timeouts
+                v.phase = vp;
+                U.unpark(v.owner);
             }
         }
-        return false;
+        return stat;
     }
 
     /**
@@ -2569,35 +2561,52 @@ public class ForkJoinPool extends AbstractExecutorService
 
     /**
      * Finds and locks a WorkQueue for an external submitter, or
-     * throws RejectedExecutionException if shutdown
+     * throws RejectedExecutionException if shutdown or terminating.
+     * @param r current ThreadLocalRandom.getProbe() value
      * @param rejectOnShutdown true if RejectedExecutionException
-     *        should be thrown when shutdown
+     *        should be thrown when shutdown (else only if terminating)
      */
-    final WorkQueue externalSubmissionQueue(boolean rejectOnShutdown) {
-        int r;
-        if ((r = ThreadLocalRandom.getProbe()) == 0) {
-            ThreadLocalRandom.localInit();   // initialize caller's probe
+    private WorkQueue submissionQueue(int r, boolean rejectOnShutdown) {
+        int reuse;                                   // nonzero if prefer create
+        if ((reuse = r) == 0) {
+            ThreadLocalRandom.localInit();           // initialize caller's probe
             r = ThreadLocalRandom.getProbe();
         }
-        for (;;) {
-            WorkQueue q; WorkQueue[] qs; int n, id, i;
-            if ((qs = queues) == null || (n = qs.length) <= 0)
+        for (int probes = 0; ; ++probes) {
+            int n, i, id; WorkQueue[] qs; WorkQueue q;
+            if ((qs = queues) == null)
+                break;
+            if ((n = qs.length) <= 0)
                 break;
             if ((q = qs[i = (id = r & EXTERNAL_ID_MASK) & (n - 1)]) == null) {
-                WorkQueue newq = new WorkQueue(null, id, 0, false);
-                lockRunState();
-                if (qs[i] == null && queues == qs)
-                    q = qs[i] = newq;         // else lost race to install
+                WorkQueue w = new WorkQueue(null, id, 0, false);
+                w.phase = id;
+                boolean reject = ((lockRunState() & SHUTDOWN) != 0 &&
+                                  rejectOnShutdown);
+                if (!reject && queues == qs && qs[i] == null)
+                    q = qs[i] = w;                   // else lost race to install
                 unlockRunState();
-            }
-            if (q != null && q.tryLockPhase()) {
-                if (rejectOnShutdown && (runState & SHUTDOWN) != 0L) {
-                    q.unlockPhase();          // check while q lock held
+                if (q != null)
+                    return q;
+                if (reject)
                     break;
-                }
-                return q;
+                reuse = 0;
             }
-            r = ThreadLocalRandom.advanceProbe(r); // move
+            if (reuse == 0 || !q.tryLockPhase()) {   // move index
+                if (reuse == 0) {
+                    if (probes >= n >> 1)
+                        reuse = r;                   // stop prefering free slot
+                }
+                else if (q != null)
+                    reuse = 0;                       // probe on collision
+                r = ThreadLocalRandom.advanceProbe(r);
+            }
+            else if (rejectOnShutdown && (runState & SHUTDOWN) != 0L) {
+                q.unlockPhase();                     // check while q lock held
+                break;
+            }
+            else
+                return q;
         }
         throw new RejectedExecutionException();
     }
@@ -2611,12 +2620,24 @@ public class ForkJoinPool extends AbstractExecutorService
         }
         else {                     // find and lock queue
             internal = false;
-            q = externalSubmissionQueue(true);
+            q = submissionQueue(ThreadLocalRandom.getProbe(), true);
         }
         q.push(task, signalIfEmpty ? this : null, internal);
         return task;
     }
 
+    /**
+     * Returns queue for an external submission, bypassing call to
+     * submissionQueue if already established and unlocked.
+     */
+    final WorkQueue externalSubmissionQueue(boolean rejectOnShutdown) {
+        WorkQueue[] qs; WorkQueue q; int n;
+        int r = ThreadLocalRandom.getProbe();
+        return (((qs = queues) != null && (n = qs.length) > 0 &&
+                 (q = qs[r & EXTERNAL_ID_MASK & (n - 1)]) != null && r != 0 &&
+                 q.tryLockPhase()) ? q : submissionQueue(r, rejectOnShutdown));
+    }
+
     /**
      * Returns queue for an external thread, if one exists that has
      * possibly ever submitted to the given pool (nonzero probe), or
@@ -3295,7 +3316,7 @@ public class ForkJoinPool extends AbstractExecutorService
         if ((config & PRESET_SIZE) != 0)
             throw new UnsupportedOperationException("Cannot override System property");
         if ((prevSize = getAndSetParallelism(size)) < size)
-            signalWork(null, 0); // trigger worker activation
+            signalWork(); // trigger worker activation
         return prevSize;
     }
 
diff --git a/test/jdk/java/util/concurrent/forkjoin/Starvation.java b/test/jdk/java/util/concurrent/forkjoin/Starvation.java
index f3336a3c7e9..3db83688d45 100644
--- a/test/jdk/java/util/concurrent/forkjoin/Starvation.java
+++ b/test/jdk/java/util/concurrent/forkjoin/Starvation.java
@@ -28,7 +28,6 @@
  */
 import java.util.concurrent.Callable;
 import java.util.concurrent.ForkJoinPool;
-import java.util.concurrent.ForkJoinTask;
 import java.util.concurrent.atomic.AtomicInteger;
 
 public class Starvation {
@@ -43,7 +42,7 @@ public class Starvation {
             while (count.get() == c) Thread.onSpinWait();
             return null; }};
 
-    static void testSubmitExternalCallable() throws Exception {
+    public static void main(String[] args) throws Exception {
         try (var pool = new ForkJoinPool(2)) {
             for (int i = 0; i < 100_000; i++) {
                 var future1 = pool.submit(new AwaitCount(i));
@@ -54,21 +53,4 @@ public class Starvation {
             }
         }
     }
-
-    static void testSubmitAdaptedCallable() throws Exception {
-        try (var pool = new ForkJoinPool(2)) {
-            for (int i = 0; i < 100_000; i++) {
-                var future1 = pool.submit(new AwaitCount(i));
-                var future2 = pool.submit(ForkJoinTask.adapt(noop));
-                future2.get();
-                count.set(i + 1);
-                future1.get();
-            }
-        }
-    }
-
-    public static void main(String[] args) throws Exception {
-        testSubmitExternalCallable();
-        testSubmitAdaptedCallable();
-    }
 }

From a6c5216e5fcd947b40bb674d3659480f43ef6322 Mon Sep 17 00:00:00 2001
From: Coleen Phillimore <coleenp@openjdk.org>
Date: Mon, 9 Mar 2026 14:45:27 +0000
Subject: [PATCH 103/655] 8379233: [REDO] Remove some unused code in
 generateOopMap.cpp

Reviewed-by: matsaave, dholmes
---
 src/hotspot/share/interpreter/oopMapCache.cpp | 26 +--------------
 src/hotspot/share/oops/generateOopMap.cpp     | 23 ++-----------
 src/hotspot/share/oops/generateOopMap.hpp     | 33 +++----------------
 3 files changed, 8 insertions(+), 74 deletions(-)

diff --git a/src/hotspot/share/interpreter/oopMapCache.cpp b/src/hotspot/share/interpreter/oopMapCache.cpp
index 29d6825d3e5..d7c02296f33 100644
--- a/src/hotspot/share/interpreter/oopMapCache.cpp
+++ b/src/hotspot/share/interpreter/oopMapCache.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1997, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -78,14 +78,10 @@ class OopMapForCacheEntry: public GenerateOopMap {
   int               _stack_top;
 
   virtual bool report_results() const     { return false; }
-  virtual bool possible_gc_point          (BytecodeStream *bcs);
-  virtual void fill_stackmap_prolog       (int nof_gc_points);
-  virtual void fill_stackmap_epilog       ();
   virtual void fill_stackmap_for_opcodes  (BytecodeStream *bcs,
                                            CellTypeState* vars,
                                            CellTypeState* stack,
                                            int stack_top);
-  virtual void fill_init_vars             (GrowableArray<intptr_t> *init_vars);
 
  public:
   OopMapForCacheEntry(const methodHandle& method, int bci, OopMapCacheEntry *entry);
@@ -120,26 +116,6 @@ bool OopMapForCacheEntry::compute_map(Thread* current) {
 }
 
 
-bool OopMapForCacheEntry::possible_gc_point(BytecodeStream *bcs) {
-  return false; // We are not reporting any result. We call result_for_basicblock directly
-}
-
-
-void OopMapForCacheEntry::fill_stackmap_prolog(int nof_gc_points) {
-  // Do nothing
-}
-
-
-void OopMapForCacheEntry::fill_stackmap_epilog() {
-  // Do nothing
-}
-
-
-void OopMapForCacheEntry::fill_init_vars(GrowableArray<intptr_t> *init_vars) {
-  // Do nothing
-}
-
-
 void OopMapForCacheEntry::fill_stackmap_for_opcodes(BytecodeStream *bcs,
                                                     CellTypeState* vars,
                                                     CellTypeState* stack,
diff --git a/src/hotspot/share/oops/generateOopMap.cpp b/src/hotspot/share/oops/generateOopMap.cpp
index 97d8bf3d526..5e12c57676d 100644
--- a/src/hotspot/share/oops/generateOopMap.cpp
+++ b/src/hotspot/share/oops/generateOopMap.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1997, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -391,7 +391,6 @@ void CellTypeState::print(outputStream *os) {
 //
 
 void GenerateOopMap::initialize_bb() {
-  _gc_points = 0;
   _bb_count  = 0;
   _bb_hdr_bits.reinitialize(method()->code_size());
 }
@@ -409,7 +408,7 @@ void GenerateOopMap::bb_mark_fct(GenerateOopMap *c, int bci, int *data) {
 }
 
 
-void GenerateOopMap::mark_bbheaders_and_count_gc_points() {
+void GenerateOopMap::mark_bbheaders() {
   initialize_bb();
 
   bool fellThrough = false;  // False to get first BB marked.
@@ -445,9 +444,6 @@ void GenerateOopMap::mark_bbheaders_and_count_gc_points() {
       default:
         break;
     }
-
-    if (possible_gc_point(&bcs))
-      _gc_points++;
   }
 }
 
@@ -2119,8 +2115,6 @@ bool GenerateOopMap::compute_map(Thread* current) {
   // if no code - do nothing
   // compiler needs info
   if (method()->code_size() == 0 || _max_locals + method()->max_stack() == 0) {
-    fill_stackmap_prolog(0);
-    fill_stackmap_epilog();
     return true;
   }
   // Step 1: Compute all jump targets and their return value
@@ -2129,7 +2123,7 @@ bool GenerateOopMap::compute_map(Thread* current) {
 
   // Step 2: Find all basic blocks and count GC points
   if (!_got_error)
-    mark_bbheaders_and_count_gc_points();
+    mark_bbheaders();
 
   // Step 3: Calculate stack maps
   if (!_got_error)
@@ -2186,9 +2180,6 @@ void GenerateOopMap::report_result() {
   // We now want to report the result of the parse
   _report_result = true;
 
-  // Prolog code
-  fill_stackmap_prolog(_gc_points);
-
    // Mark everything changed, then do one interpretation pass.
   for (int i = 0; i<_bb_count; i++) {
     if (_basic_blocks[i].is_reachable()) {
@@ -2197,14 +2188,6 @@ void GenerateOopMap::report_result() {
     }
   }
 
-  // Note: Since we are skipping dead-code when we are reporting results, then
-  // the no. of encountered gc-points might be fewer than the previously number
-  // we have counted. (dead-code is a pain - it should be removed before we get here)
-  fill_stackmap_epilog();
-
-  // Report initvars
-  fill_init_vars(_init_vars);
-
   _report_result = false;
 }
 
diff --git a/src/hotspot/share/oops/generateOopMap.hpp b/src/hotspot/share/oops/generateOopMap.hpp
index 0da3779d463..783e295f08a 100644
--- a/src/hotspot/share/oops/generateOopMap.hpp
+++ b/src/hotspot/share/oops/generateOopMap.hpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1997, 2023, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -348,17 +348,15 @@ class GenerateOopMap {
 
   // Basicblock info
   BasicBlock *    _basic_blocks;             // Array of basicblock info
-  int             _gc_points;
   int             _bb_count;
   ResourceBitMap  _bb_hdr_bits;
 
   // Basicblocks methods
   void          initialize_bb               ();
-  void          mark_bbheaders_and_count_gc_points();
+  void          mark_bbheaders();
   bool          is_bb_header                (int bci) const   {
     return _bb_hdr_bits.at(bci);
   }
-  int           gc_points                   () const                          { return _gc_points; }
   int           bb_count                    () const                          { return _bb_count; }
   void          set_bbmark_bit              (int bci);
   BasicBlock *  get_basic_block_at          (int bci) const;
@@ -450,7 +448,7 @@ class GenerateOopMap {
   int  binsToHold                           (int no)                      { return  ((no+(BitsPerWord-1))/BitsPerWord); }
   char *state_vec_to_string                 (CellTypeState* vec, int len);
 
-  // Helper method. Can be used in subclasses to fx. calculate gc_points. If the current instruction
+  // Helper method. If the current instruction
   // is a control transfer, then calls the jmpFct all possible destinations.
   void  ret_jump_targets_do                 (BytecodeStream *bcs, jmpFct_t jmpFct, int varNo,int *data);
   bool  jump_targets_do                     (BytecodeStream *bcs, jmpFct_t jmpFct, int *data);
@@ -480,14 +478,7 @@ class GenerateOopMap {
   bool monitor_safe()                              { return _monitor_safe; }
 
   // Specialization methods. Intended use:
-  // - possible_gc_point must return true for every bci for which the stackmaps must be returned
-  // - fill_stackmap_prolog is called just before the result is reported. The arguments tells the estimated
-  //   number of gc points
   // - fill_stackmap_for_opcodes is called once for each bytecode index in order (0...code_length-1)
-  // - fill_stackmap_epilog is called after all results has been reported. Note: Since the algorithm does not report
-  //   stackmaps for deadcode, fewer gc_points might have been encountered than assumed during the epilog. It is the
-  //   responsibility of the subclass to count the correct number.
-  // - fill_init_vars are called once with the result of the init_vars computation
   //
   // All these methods are used during a call to: compute_map. Note: Non of the return results are valid
   // after compute_map returns, since all values are allocated as resource objects.
@@ -496,14 +487,10 @@ class GenerateOopMap {
   virtual bool allow_rewrites             () const                        { return false; }
   virtual bool report_results             () const                        { return true;  }
   virtual bool report_init_vars           () const                        { return true;  }
-  virtual bool possible_gc_point          (BytecodeStream *bcs)           { ShouldNotReachHere(); return false; }
-  virtual void fill_stackmap_prolog       (int nof_gc_points)             { ShouldNotReachHere(); }
-  virtual void fill_stackmap_epilog       ()                              { ShouldNotReachHere(); }
   virtual void fill_stackmap_for_opcodes  (BytecodeStream *bcs,
                                            CellTypeState* vars,
                                            CellTypeState* stack,
                                            int stackTop)                  { ShouldNotReachHere(); }
-  virtual void fill_init_vars             (GrowableArray<intptr_t> *init_vars) { ShouldNotReachHere();; }
 };
 
 //
@@ -513,19 +500,13 @@ class GenerateOopMap {
 class ResolveOopMapConflicts: public GenerateOopMap {
  private:
 
-  bool _must_clear_locals;
-
   virtual bool report_results() const     { return false; }
   virtual bool report_init_vars() const   { return true;  }
   virtual bool allow_rewrites() const     { return true;  }
-  virtual bool possible_gc_point          (BytecodeStream *bcs)           { return false; }
-  virtual void fill_stackmap_prolog       (int nof_gc_points)             {}
-  virtual void fill_stackmap_epilog       ()                              {}
   virtual void fill_stackmap_for_opcodes  (BytecodeStream *bcs,
                                            CellTypeState* vars,
                                            CellTypeState* stack,
                                            int stack_top)                 {}
-  virtual void fill_init_vars             (GrowableArray<intptr_t> *init_vars) { _must_clear_locals = init_vars->length() > 0; }
 
 #ifndef PRODUCT
   // Statistics
@@ -535,10 +516,8 @@ class ResolveOopMapConflicts: public GenerateOopMap {
 #endif
 
  public:
-  ResolveOopMapConflicts(const methodHandle& method) : GenerateOopMap(method) { _must_clear_locals = false; };
-
+  ResolveOopMapConflicts(const methodHandle& method) : GenerateOopMap(method) { }
   methodHandle do_potential_rewrite(TRAPS);
-  bool must_clear_locals() const { return _must_clear_locals; }
 };
 
 
@@ -551,14 +530,10 @@ class GeneratePairingInfo: public GenerateOopMap {
   virtual bool report_results() const     { return false; }
   virtual bool report_init_vars() const   { return false; }
   virtual bool allow_rewrites() const     { return false;  }
-  virtual bool possible_gc_point          (BytecodeStream *bcs)           { return false; }
-  virtual void fill_stackmap_prolog       (int nof_gc_points)             {}
-  virtual void fill_stackmap_epilog       ()                              {}
   virtual void fill_stackmap_for_opcodes  (BytecodeStream *bcs,
                                            CellTypeState* vars,
                                            CellTypeState* stack,
                                            int stack_top)                 {}
-  virtual void fill_init_vars             (GrowableArray<intptr_t> *init_vars) {}
  public:
   GeneratePairingInfo(const methodHandle& method) : GenerateOopMap(method)       {};
 

From 947d5b6a0205f1d6d516521693dd29d543dada08 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Daniel=20Lund=C3=A9n?= <dlunden@openjdk.org>
Date: Mon, 9 Mar 2026 15:20:20 +0000
Subject: [PATCH 104/655] 8376104: C2 crashes in PhiNode::Ideal(PhaseGVN*,
 bool) accessing NULL pointer

Co-authored-by: Roman Marchenko <rmarchenko@openjdk.org>
Reviewed-by: mhaessig, dfenacci, rcastanedalo
---
 src/hotspot/share/opto/cfgnode.cpp | 4 ++++
 1 file changed, 4 insertions(+)

diff --git a/src/hotspot/share/opto/cfgnode.cpp b/src/hotspot/share/opto/cfgnode.cpp
index c65bc391792..04061a60bad 100644
--- a/src/hotspot/share/opto/cfgnode.cpp
+++ b/src/hotspot/share/opto/cfgnode.cpp
@@ -2675,6 +2675,10 @@ Node *PhiNode::Ideal(PhaseGVN *phase, bool can_reshape) {
     for( uint i=1; i<req(); ++i ) {// For all paths in
       Node *ii = in(i);
       Node *new_in = MemNode::optimize_memory_chain(ii, at, nullptr, phase);
+      // MemNode::optimize_memory_chain above may kill us!
+      if (outcnt() == 0) {
+        return top;
+      }
       if (ii != new_in ) {
         set_req_X(i, new_in, phase);
         progress = this;

From a278ad8fff0404b47712a9b43938cd0edecc3c19 Mon Sep 17 00:00:00 2001
From: Joe Darcy <darcy@openjdk.org>
Date: Mon, 9 Mar 2026 15:20:35 +0000
Subject: [PATCH 105/655] 8379443: Correct build tags in some math tests

Reviewed-by: iris
---
 test/jdk/java/lang/Math/HypotTests.java           | 3 ++-
 test/jdk/java/lang/Math/IeeeRecommendedTests.java | 3 ++-
 test/jdk/java/lang/Math/IeeeRemainderTests.java   | 4 +++-
 3 files changed, 7 insertions(+), 3 deletions(-)

diff --git a/test/jdk/java/lang/Math/HypotTests.java b/test/jdk/java/lang/Math/HypotTests.java
index e09799e34a4..eee40ea6469 100644
--- a/test/jdk/java/lang/Math/HypotTests.java
+++ b/test/jdk/java/lang/Math/HypotTests.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2022, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,6 +25,7 @@
  * @test
  * @library /test/lib
  * @build jdk.test.lib.RandomFactory
+ * @build Tests
  * @run main HypotTests
  * @bug 4851638 4939441 8078672 8240632
  * @summary Tests for {Math, StrictMath}.hypot (use -Dseed=X to set PRNG seed)
diff --git a/test/jdk/java/lang/Math/IeeeRecommendedTests.java b/test/jdk/java/lang/Math/IeeeRecommendedTests.java
index 8570508ff44..3dfb70ab9af 100644
--- a/test/jdk/java/lang/Math/IeeeRecommendedTests.java
+++ b/test/jdk/java/lang/Math/IeeeRecommendedTests.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2022, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,6 +25,7 @@
  * @test
  * @library /test/lib
  * @build jdk.test.lib.RandomFactory
+ * @build Tests
  * @run main IeeeRecommendedTests
  * @bug 4860891 4826732 4780454 4939441 4826652 8078672
  * @summary Tests for IEEE 754[R] recommended functions and similar methods (use -Dseed=X to set PRNG seed)
diff --git a/test/jdk/java/lang/Math/IeeeRemainderTests.java b/test/jdk/java/lang/Math/IeeeRemainderTests.java
index 596310d8e42..8716be870c9 100644
--- a/test/jdk/java/lang/Math/IeeeRemainderTests.java
+++ b/test/jdk/java/lang/Math/IeeeRemainderTests.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2004, 2023, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2004, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -24,6 +24,8 @@
 /*
  * @test
  * @bug 8304028
+ * @build Tests
+ * @run main IeeeRemainderTests
  * @summary Tests for {Math, StrictMath}.IEEEremainder
  */
 

From 0d2f7f6216f2cf6b8cd18d8e0d51a1458097784f Mon Sep 17 00:00:00 2001
From: Leo Korinth <lkorinth@openjdk.org>
Date: Mon, 9 Mar 2026 15:57:33 +0000
Subject: [PATCH 106/655] 8377995: ZGC: Fix implicit narrowing conversion in
 zBitField

Reviewed-by: stefank, aboldtch
---
 src/hotspot/share/gc/z/zBitField.hpp | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/src/hotspot/share/gc/z/zBitField.hpp b/src/hotspot/share/gc/z/zBitField.hpp
index 9bec4e05594..b68f5b92ce1 100644
--- a/src/hotspot/share/gc/z/zBitField.hpp
+++ b/src/hotspot/share/gc/z/zBitField.hpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2017, 2022, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2017, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -74,7 +74,7 @@ public:
 
   static ContainerType encode(ValueType value) {
     assert(((ContainerType)value & (FieldMask << ValueShift)) == (ContainerType)value, "Invalid value");
-    return ((ContainerType)value >> ValueShift) << FieldShift;
+    return checked_cast<ContainerType>(((ContainerType)value >> ValueShift) << FieldShift);
   }
 };
 

From 7b0024adbb0678050f8755c543068916fdedf4d8 Mon Sep 17 00:00:00 2001
From: Ben Taylor <btaylor@openjdk.org>
Date: Mon, 9 Mar 2026 16:03:13 +0000
Subject: [PATCH 107/655] 8378804: Shenandoah: Convert remaining components to
 Atomic<T>

Reviewed-by: wkemper, xpeng
---
 .../share/gc/shenandoah/shenandoahCollectionSet.cpp    | 10 +++++-----
 .../share/gc/shenandoah/shenandoahCollectionSet.hpp    |  5 +++--
 .../share/gc/shenandoah/shenandoahController.cpp       |  4 ++--
 .../share/gc/shenandoah/shenandoahController.hpp       |  3 ++-
 .../gc/shenandoah/shenandoahHeapRegionCounters.cpp     |  5 ++---
 .../gc/shenandoah/shenandoahHeapRegionCounters.hpp     |  3 ++-
 .../share/gc/shenandoah/shenandoahNumberSeq.cpp        |  6 +++---
 .../share/gc/shenandoah/shenandoahNumberSeq.hpp        |  3 ++-
 .../share/gc/shenandoah/shenandoahRootProcessor.cpp    |  2 +-
 .../share/gc/shenandoah/shenandoahRootProcessor.hpp    |  3 ++-
 .../share/gc/shenandoah/shenandoahScanRemembered.cpp   |  2 +-
 .../share/gc/shenandoah/shenandoahScanRemembered.hpp   |  2 +-
 .../gc/shenandoah/shenandoahScanRemembered.inline.hpp  |  6 +++---
 .../share/gc/shenandoah/shenandoahTaskqueue.hpp        |  9 +++++----
 14 files changed, 34 insertions(+), 29 deletions(-)

diff --git a/src/hotspot/share/gc/shenandoah/shenandoahCollectionSet.cpp b/src/hotspot/share/gc/shenandoah/shenandoahCollectionSet.cpp
index c1c6b876d90..54ab7801ca9 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahCollectionSet.cpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahCollectionSet.cpp
@@ -136,7 +136,7 @@ void ShenandoahCollectionSet::clear() {
   _live = 0;
 
   _region_count = 0;
-  _current_index = 0;
+  _current_index.store_relaxed(0);
 
   _young_bytes_to_evacuate = 0;
   _young_bytes_to_promote = 0;
@@ -154,11 +154,11 @@ ShenandoahHeapRegion* ShenandoahCollectionSet::claim_next() {
   // before hitting the (potentially contended) atomic index.
 
   size_t max = _heap->num_regions();
-  size_t old = AtomicAccess::load(&_current_index);
+  size_t old = _current_index.load_relaxed();
 
   for (size_t index = old; index < max; index++) {
     if (is_in(index)) {
-      size_t cur = AtomicAccess::cmpxchg(&_current_index, old, index + 1, memory_order_relaxed);
+      size_t cur = _current_index.compare_exchange(old, index + 1, memory_order_relaxed);
       assert(cur >= old, "Always move forward");
       if (cur == old) {
         // Successfully moved the claim index, this is our region.
@@ -178,9 +178,9 @@ ShenandoahHeapRegion* ShenandoahCollectionSet::next() {
   assert(Thread::current()->is_VM_thread(), "Must be VMThread");
 
   size_t max = _heap->num_regions();
-  for (size_t index = _current_index; index < max; index++) {
+  for (size_t index = _current_index.load_relaxed(); index < max; index++) {
     if (is_in(index)) {
-      _current_index = index + 1;
+      _current_index.store_relaxed(index + 1);
       return _heap->get_region(index);
     }
   }
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahCollectionSet.hpp b/src/hotspot/share/gc/shenandoah/shenandoahCollectionSet.hpp
index c99271de1fb..87b4597c93f 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahCollectionSet.hpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahCollectionSet.hpp
@@ -32,6 +32,7 @@
 #include "memory/allocation.hpp"
 #include "memory/reservedSpace.hpp"
 #include "memory/virtualspace.hpp"
+#include "runtime/atomic.hpp"
 
 class ShenandoahCollectionSet : public CHeapObj<mtGC> {
   friend class ShenandoahHeap;
@@ -80,7 +81,7 @@ private:
   size_t                _old_available_bytes_collected;
 
   shenandoah_padding(0);
-  volatile size_t       _current_index;
+  Atomic<size_t>        _current_index;
   shenandoah_padding(1);
 
 public:
@@ -99,7 +100,7 @@ public:
   bool is_empty() const { return _region_count == 0; }
 
   void clear_current_index() {
-    _current_index = 0;
+    _current_index.store_relaxed(0);
   }
 
   inline bool is_in(ShenandoahHeapRegion* r) const;
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahController.cpp b/src/hotspot/share/gc/shenandoah/shenandoahController.cpp
index 220f3df8d4f..50aabad7d42 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahController.cpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahController.cpp
@@ -31,11 +31,11 @@
 
 
 void ShenandoahController::update_gc_id() {
-  AtomicAccess::inc(&_gc_id);
+  _gc_id.add_then_fetch((size_t)1);
 }
 
 size_t ShenandoahController::get_gc_id() {
-  return AtomicAccess::load(&_gc_id);
+  return _gc_id.load_relaxed();
 }
 
 void ShenandoahController::handle_alloc_failure(const ShenandoahAllocRequest& req, bool block) {
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahController.hpp b/src/hotspot/share/gc/shenandoah/shenandoahController.hpp
index b8ff4df4771..60b41a5fe99 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahController.hpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahController.hpp
@@ -29,6 +29,7 @@
 #include "gc/shared/gcCause.hpp"
 #include "gc/shenandoah/shenandoahAllocRequest.hpp"
 #include "gc/shenandoah/shenandoahSharedVariables.hpp"
+#include "runtime/atomic.hpp"
 
 /**
  * This interface exposes methods necessary for the heap to interact
@@ -38,7 +39,7 @@ class ShenandoahController: public ConcurrentGCThread {
 private:
   shenandoah_padding(0);
   // A monotonically increasing GC count.
-  volatile size_t _gc_id;
+  Atomic<size_t> _gc_id;
   shenandoah_padding(1);
 
 protected:
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahHeapRegionCounters.cpp b/src/hotspot/share/gc/shenandoah/shenandoahHeapRegionCounters.cpp
index aed3faef906..ff1e3368e87 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahHeapRegionCounters.cpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahHeapRegionCounters.cpp
@@ -32,7 +32,6 @@
 #include "gc/shenandoah/shenandoahHeapRegionSet.hpp"
 #include "logging/logStream.hpp"
 #include "memory/resourceArea.hpp"
-#include "runtime/atomicAccess.hpp"
 #include "runtime/perfData.inline.hpp"
 #include "utilities/defaultStream.hpp"
 
@@ -106,8 +105,8 @@ void ShenandoahHeapRegionCounters::write_snapshot(PerfLongVariable** regions,
 void ShenandoahHeapRegionCounters::update() {
   if (ShenandoahRegionSampling) {
     jlong current = nanos_to_millis(os::javaTimeNanos());
-    jlong last = _last_sample_millis;
-    if (current - last > ShenandoahRegionSamplingRate && AtomicAccess::cmpxchg(&_last_sample_millis, last, current) == last) {
+    jlong last = _last_sample_millis.load_relaxed();
+    if (current - last > ShenandoahRegionSamplingRate && _last_sample_millis.compare_exchange(last, current) == last) {
 
       ShenandoahHeap* heap = ShenandoahHeap::heap();
       _status->set_value(encode_heap_status(heap));
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahHeapRegionCounters.hpp b/src/hotspot/share/gc/shenandoah/shenandoahHeapRegionCounters.hpp
index 508b40e49a8..d50188bf70c 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahHeapRegionCounters.hpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahHeapRegionCounters.hpp
@@ -28,6 +28,7 @@
 
 #include "logging/logFileStreamOutput.hpp"
 #include "memory/allocation.hpp"
+#include "runtime/atomic.hpp"
 
 /**
  * This provides the following in JVMStat:
@@ -88,7 +89,7 @@ private:
   PerfLongVariable** _regions_data;
   PerfLongVariable* _timestamp;
   PerfLongVariable* _status;
-  volatile jlong _last_sample_millis;
+  Atomic<jlong> _last_sample_millis;
 
   void write_snapshot(PerfLongVariable** regions,
                       PerfLongVariable* ts,
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahNumberSeq.cpp b/src/hotspot/share/gc/shenandoah/shenandoahNumberSeq.cpp
index 32c63e9b186..1ddd8e1c032 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahNumberSeq.cpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahNumberSeq.cpp
@@ -198,11 +198,11 @@ void BinaryMagnitudeSeq::clear() {
   for (int c = 0; c < BitsPerSize_t; c++) {
     _mags[c] = 0;
   }
-  _sum = 0;
+  _sum.store_relaxed(0);
 }
 
 void BinaryMagnitudeSeq::add(size_t val) {
-  AtomicAccess::add(&_sum, val);
+  _sum.add_then_fetch(val);
 
   int mag = log2i_graceful(val) + 1;
 
@@ -237,7 +237,7 @@ size_t BinaryMagnitudeSeq::num() const {
 }
 
 size_t BinaryMagnitudeSeq::sum() const {
-  return _sum;
+  return _sum.load_relaxed();
 }
 
 int BinaryMagnitudeSeq::min_level() const {
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahNumberSeq.hpp b/src/hotspot/share/gc/shenandoah/shenandoahNumberSeq.hpp
index 68f3cfba97a..1a14f930174 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahNumberSeq.hpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahNumberSeq.hpp
@@ -25,6 +25,7 @@
 #ifndef SHARE_GC_SHENANDOAH_SHENANDOAHNUMBERSEQ_HPP
 #define SHARE_GC_SHENANDOAH_SHENANDOAHNUMBERSEQ_HPP
 
+#include "runtime/atomic.hpp"
 #include "utilities/numberSeq.hpp"
 
 // HDR sequence stores the low-resolution high-dynamic-range values.
@@ -59,7 +60,7 @@ public:
 // is not needed, it is preferred over HdrSeq.
 class BinaryMagnitudeSeq : public CHeapObj<mtGC> {
 private:
-  size_t  _sum;
+  Atomic<size_t> _sum;
   size_t* _mags;
 
 public:
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahRootProcessor.cpp b/src/hotspot/share/gc/shenandoah/shenandoahRootProcessor.cpp
index 9e6b1960708..7b68e6ac625 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahRootProcessor.cpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahRootProcessor.cpp
@@ -45,7 +45,7 @@ ShenandoahJavaThreadsIterator::ShenandoahJavaThreadsIterator(ShenandoahPhaseTimi
 }
 
 uint ShenandoahJavaThreadsIterator::claim() {
-  return AtomicAccess::fetch_then_add(&_claimed, _stride, memory_order_relaxed);
+  return _claimed.fetch_then_add(_stride, memory_order_relaxed);
 }
 
 void ShenandoahJavaThreadsIterator::threads_do(ThreadClosure* cl, uint worker_id) {
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahRootProcessor.hpp b/src/hotspot/share/gc/shenandoah/shenandoahRootProcessor.hpp
index 29d8c9fac2d..55367e706a2 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahRootProcessor.hpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahRootProcessor.hpp
@@ -33,6 +33,7 @@
 #include "gc/shenandoah/shenandoahSharedVariables.hpp"
 #include "gc/shenandoah/shenandoahUtils.hpp"
 #include "memory/iterator.hpp"
+#include "runtime/atomic.hpp"
 #include "runtime/threads.hpp"
 
 template <bool CONCURRENT>
@@ -73,7 +74,7 @@ private:
   ThreadsListHandle             _threads;
   uint const                    _length;
   uint const                    _stride;
-  volatile uint                 _claimed;
+  Atomic<uint>                  _claimed;
   ShenandoahPhaseTimings::Phase _phase;
 
   uint claim();
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahScanRemembered.cpp b/src/hotspot/share/gc/shenandoah/shenandoahScanRemembered.cpp
index 05af25f13ad..9e160d5b294 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahScanRemembered.cpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahScanRemembered.cpp
@@ -1024,7 +1024,7 @@ ShenandoahRegionChunkIterator::ShenandoahRegionChunkIterator(ShenandoahHeap* hea
 }
 
 void ShenandoahRegionChunkIterator::reset() {
-  _index = 0;
+  _index.store_relaxed(0);
 }
 
 ShenandoahReconstructRememberedSetTask::ShenandoahReconstructRememberedSetTask(ShenandoahRegionIterator* regions)
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahScanRemembered.hpp b/src/hotspot/share/gc/shenandoah/shenandoahScanRemembered.hpp
index c758873a040..c2c117e86e6 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahScanRemembered.hpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahScanRemembered.hpp
@@ -973,7 +973,7 @@ private:
   const size_t _total_chunks;
 
   shenandoah_padding(0);
-  volatile size_t _index;
+  Atomic<size_t> _index;
   shenandoah_padding(1);
 
   size_t _region_index[_maximum_groups];           // The region index for the first region spanned by this group
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahScanRemembered.inline.hpp b/src/hotspot/share/gc/shenandoah/shenandoahScanRemembered.inline.hpp
index e394daa68c0..3c82efee16c 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahScanRemembered.inline.hpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahScanRemembered.inline.hpp
@@ -380,14 +380,14 @@ ShenandoahScanRemembered::process_region_slice(ShenandoahHeapRegion *region, siz
 }
 
 inline bool ShenandoahRegionChunkIterator::has_next() const {
-  return _index < _total_chunks;
+  return _index.load_relaxed() < _total_chunks;
 }
 
 inline bool ShenandoahRegionChunkIterator::next(struct ShenandoahRegionChunk *assignment) {
-  if (_index >= _total_chunks) {
+  if (_index.load_relaxed() >= _total_chunks) {
     return false;
   }
-  size_t new_index = AtomicAccess::add(&_index, (size_t) 1, memory_order_relaxed);
+  size_t new_index = _index.add_then_fetch((size_t) 1, memory_order_relaxed);
   if (new_index > _total_chunks) {
     // First worker that hits new_index == _total_chunks continues, other
     // contending workers return false.
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahTaskqueue.hpp b/src/hotspot/share/gc/shenandoah/shenandoahTaskqueue.hpp
index 969edafbf75..42db0b2fd2c 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahTaskqueue.hpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahTaskqueue.hpp
@@ -30,6 +30,7 @@
 #include "gc/shared/taskTerminator.hpp"
 #include "gc/shenandoah/shenandoahPadding.hpp"
 #include "nmt/memTag.hpp"
+#include "runtime/atomic.hpp"
 #include "runtime/atomicAccess.hpp"
 #include "runtime/javaThread.hpp"
 #include "runtime/mutex.hpp"
@@ -306,7 +307,7 @@ template <class T, MemTag MT>
 class ParallelClaimableQueueSet: public GenericTaskQueueSet<T, MT> {
 private:
   shenandoah_padding(0);
-  volatile jint     _claimed_index;
+  Atomic<jint>      _claimed_index;
   shenandoah_padding(1);
 
   DEBUG_ONLY(uint   _reserved;  )
@@ -325,7 +326,7 @@ public:
   // reserve queues that not for parallel claiming
   void reserve(uint n) {
     assert(n <= size(), "Sanity");
-    _claimed_index = (jint)n;
+    _claimed_index.store_relaxed((jint)n);
     DEBUG_ONLY(_reserved = n;)
   }
 
@@ -336,11 +337,11 @@ template <class T, MemTag MT>
 T* ParallelClaimableQueueSet<T, MT>::claim_next() {
   jint size = (jint)GenericTaskQueueSet<T, MT>::size();
 
-  if (_claimed_index >= size) {
+  if (_claimed_index.load_relaxed() >= size) {
     return nullptr;
   }
 
-  jint index = AtomicAccess::add(&_claimed_index, 1, memory_order_relaxed);
+  jint index = _claimed_index.add_then_fetch(1, memory_order_relaxed);
 
   if (index <= size) {
     return GenericTaskQueueSet<T, MT>::queue((uint)index - 1);

From 9454f86cfbb1917f5ec97572b8e1bc75be759db4 Mon Sep 17 00:00:00 2001
From: Brian Burkhalter <bpb@openjdk.org>
Date: Mon, 9 Mar 2026 18:05:46 +0000
Subject: [PATCH 108/655] 8379154: Refactor Selector TestNG tests to use JUnit

Reviewed-by: alanb
---
 .../channels/SelectionKey/AtomicUpdates.java  |  72 ++++----
 .../channels/Selector/SelectWithConsumer.java | 173 +++++++++++-------
 .../nio/channels/Selector/UpdateReadyOps.java |  45 +++--
 .../TestDefaultImplementation.java            |  19 +-
 .../InheritedChannelTest.java                 |  31 ++--
 5 files changed, 190 insertions(+), 150 deletions(-)

diff --git a/test/jdk/java/nio/channels/SelectionKey/AtomicUpdates.java b/test/jdk/java/nio/channels/SelectionKey/AtomicUpdates.java
index 8e5bee51b71..e609530ff69 100644
--- a/test/jdk/java/nio/channels/SelectionKey/AtomicUpdates.java
+++ b/test/jdk/java/nio/channels/SelectionKey/AtomicUpdates.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,7 +23,7 @@
 
 /* @test
  * @bug 6350055
- * @run testng AtomicUpdates
+ * @run junit AtomicUpdates
  * @summary Unit test for SelectionKey interestOpsOr and interestOpsAnd
  */
 
@@ -37,15 +37,19 @@ import java.nio.channels.SelectionKey;
 import java.nio.channels.Selector;
 import java.nio.channels.ServerSocketChannel;
 import java.nio.channels.SocketChannel;
-import org.testng.annotations.Test;
+
+import org.junit.jupiter.api.Test;
 
 import static java.nio.channels.SelectionKey.OP_READ;
 import static java.nio.channels.SelectionKey.OP_WRITE;
 import static java.nio.channels.SelectionKey.OP_CONNECT;
 import static java.nio.channels.SelectionKey.OP_ACCEPT;
-import static org.testng.Assert.*;
 
-@Test
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertInstanceOf;
+import static org.junit.jupiter.api.Assertions.assertThrows;
+import static org.junit.jupiter.api.Assertions.fail;
+
 public class AtomicUpdates {
 
     private SelectionKey keyFor(SocketChannel sc) {
@@ -94,74 +98,69 @@ public class AtomicUpdates {
     }
 
     private void test(SelectionKey key) {
-        assertTrue(key.channel() instanceof SocketChannel);
+        assertInstanceOf(SocketChannel.class, key.channel());
         key.interestOps(0);
 
         // 0 -> 0
         int previous = key.interestOpsOr(0);
-        assertTrue(previous == 0);
-        assertTrue(key.interestOps() == 0);
+        assertEquals(0, previous);
+        assertEquals(0, key.interestOps());
 
         // 0 -> OP_CONNECT
         previous = key.interestOpsOr(OP_CONNECT);
-        assertTrue(previous == 0);
-        assertTrue(key.interestOps() == OP_CONNECT);
+        assertEquals(0, previous);
+        assertEquals(OP_CONNECT, key.interestOps());
 
         // OP_CONNECT -> OP_CONNECT
         previous = key.interestOpsOr(0);
-        assertTrue(previous == OP_CONNECT);
-        assertTrue(key.interestOps() == OP_CONNECT);
+        assertEquals(OP_CONNECT, previous);
+        assertEquals(OP_CONNECT, key.interestOps());
 
         // OP_CONNECT -> OP_CONNECT | OP_READ | OP_WRITE
         previous = key.interestOpsOr(OP_READ | OP_WRITE);
-        assertTrue(previous == OP_CONNECT);
-        assertTrue(key.interestOps() == (OP_CONNECT | OP_READ | OP_WRITE));
+        assertEquals(OP_CONNECT, previous);
+        assertEquals(OP_CONNECT | OP_READ | OP_WRITE, key.interestOps());
 
         // OP_CONNECT | OP_READ | OP_WRITE -> OP_CONNECT
         previous = key.interestOpsAnd(~(OP_READ | OP_WRITE));
-        assertTrue(previous == (OP_CONNECT | OP_READ | OP_WRITE));
-        assertTrue(key.interestOps() == OP_CONNECT);
+        assertEquals(OP_CONNECT | OP_READ | OP_WRITE, previous);
+        assertEquals(OP_CONNECT, key.interestOps());
 
         // OP_CONNECT -> 0
         previous = key.interestOpsAnd(~OP_CONNECT);
-        assertTrue(previous == OP_CONNECT);
-        assertTrue(key.interestOps() == 0);
+        assertEquals(OP_CONNECT, previous);
+        assertEquals(0, key.interestOps());
 
         // OP_READ | OP_WRITE -> OP_READ | OP_WRITE
         key.interestOps(OP_READ | OP_WRITE);
         previous = key.interestOpsAnd(~OP_ACCEPT);
-        assertTrue(previous == (OP_READ | OP_WRITE));
-        assertTrue(key.interestOps() == (OP_READ | OP_WRITE));
+        assertEquals(OP_READ | OP_WRITE, previous);
+        assertEquals(OP_READ | OP_WRITE, key.interestOps());
 
         // OP_READ | OP_WRITE -> 0
         previous = key.interestOpsAnd(0);
-        assertTrue(previous == (OP_READ | OP_WRITE));
-        assertTrue(key.interestOps() == 0);
+        assertEquals(OP_READ | OP_WRITE, previous);
+        assertEquals(0, key.interestOps());
 
         // 0 -> 0
         previous = key.interestOpsAnd(0);
-        assertTrue(previous == 0);
-        assertTrue(key.interestOps() == 0);
+        assertEquals(0, previous);
+        assertEquals(0, key.interestOps());
 
-        try {
-            key.interestOpsOr(OP_ACCEPT);
-            fail("IllegalArgumentException expected");
-        } catch (IllegalArgumentException expected) { }
+        assertThrows(IllegalArgumentException.class,
+                     () -> key.interestOpsOr(OP_ACCEPT));
 
         key.cancel();
-        try {
-            key.interestOpsOr(OP_READ);
-            fail("CancelledKeyException expected");
-        } catch (CancelledKeyException expected) { }
-        try {
-            key.interestOpsAnd(~OP_READ);
-            fail("CancelledKeyException expected");
-        } catch (CancelledKeyException expected) { }
+        assertThrows(CancelledKeyException.class,
+                     () -> key.interestOpsOr(OP_READ));
+        assertThrows(CancelledKeyException.class,
+                     () -> key.interestOpsAnd(~OP_READ));
     }
 
     /**
      * Test default implementation of interestOpsOr/interestOpsAnd
      */
+    @Test
     public void testDefaultImplementation() throws Exception {
         try (SocketChannel sc = SocketChannel.open()) {
             SelectionKey key = keyFor(sc);
@@ -172,6 +171,7 @@ public class AtomicUpdates {
     /**
      * Test the default provider implementation of SelectionKey.
      */
+    @Test
     public void testNioImplementation() throws Exception {
         try (SocketChannel sc = SocketChannel.open();
              Selector sel = Selector.open()) {
diff --git a/test/jdk/java/nio/channels/Selector/SelectWithConsumer.java b/test/jdk/java/nio/channels/Selector/SelectWithConsumer.java
index 1a2ada51bce..b90a68ffd04 100644
--- a/test/jdk/java/nio/channels/Selector/SelectWithConsumer.java
+++ b/test/jdk/java/nio/channels/Selector/SelectWithConsumer.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -24,12 +24,12 @@
 /* @test
  * @summary Unit test for Selector.select/selectNow(Consumer)
  * @bug 8199433 8208780
- * @run testng SelectWithConsumer
+ * @run junit SelectWithConsumer
  */
 
 /* @test
  * @requires (os.family == "windows")
- * @run testng/othervm -Djava.nio.channels.spi.SelectorProvider=sun.nio.ch.WindowsSelectorProvider SelectWithConsumer
+ * @run junit/othervm -Djava.nio.channels.spi.SelectorProvider=sun.nio.ch.WindowsSelectorProvider SelectWithConsumer
  */
 
 import java.io.Closeable;
@@ -49,11 +49,16 @@ import java.util.concurrent.TimeUnit;
 import java.util.concurrent.atomic.AtomicInteger;
 import static java.util.concurrent.TimeUnit.*;
 
-import org.testng.annotations.AfterTest;
-import org.testng.annotations.Test;
-import static org.testng.Assert.*;
+import org.junit.jupiter.api.AfterAll;
+import org.junit.jupiter.api.Test;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertFalse;
+import static org.junit.jupiter.api.Assertions.assertSame;
+import static org.junit.jupiter.api.Assertions.assertNotEquals;
+import static org.junit.jupiter.api.Assertions.assertThrows;
+import static org.junit.jupiter.api.Assertions.assertTrue;
 
-@Test
 public class SelectWithConsumer {
 
     /**
@@ -81,46 +86,47 @@ public class SelectWithConsumer {
         // select(Consumer)
         notifiedOps.set(0);
         int n = sel.select(k -> {
-            assertTrue(Thread.currentThread() == callerThread);
-            assertTrue(k == key);
+            assertSame(callerThread, Thread.currentThread());
+            assertSame(key, k);
             int readyOps = key.readyOps();
-            assertTrue((readyOps & interestOps) != 0);
-            assertTrue((readyOps & notifiedOps.get()) == 0);
+            assertNotEquals(0, readyOps & interestOps);
+            assertEquals(0, readyOps & notifiedOps.get());
             notifiedOps.set(notifiedOps.get() | readyOps);
         });
         assertTrue((n == 1) ^ (expectedOps == 0));
-        assertTrue(notifiedOps.get() == expectedOps);
+        assertEquals(expectedOps, notifiedOps.get());
 
         // select(Consumer, timeout)
         notifiedOps.set(0);
         n = sel.select(k -> {
-            assertTrue(Thread.currentThread() == callerThread);
-            assertTrue(k == key);
+            assertSame(callerThread, Thread.currentThread());
+            assertSame(key, k);
             int readyOps = key.readyOps();
-            assertTrue((readyOps & interestOps) != 0);
-            assertTrue((readyOps & notifiedOps.get()) == 0);
+            assertNotEquals(0, readyOps & interestOps);
+            assertEquals(0, readyOps & notifiedOps.get());
             notifiedOps.set(notifiedOps.get() | readyOps);
         }, 1000);
         assertTrue((n == 1) ^ (expectedOps == 0));
-        assertTrue(notifiedOps.get() == expectedOps);
+        assertEquals(expectedOps, notifiedOps.get());
 
         // selectNow(Consumer)
         notifiedOps.set(0);
         n = sel.selectNow(k -> {
-            assertTrue(Thread.currentThread() == callerThread);
-            assertTrue(k == key);
+            assertSame(callerThread, Thread.currentThread());
+            assertSame(key, k);
             int readyOps = key.readyOps();
-            assertTrue((readyOps & interestOps) != 0);
-            assertTrue((readyOps & notifiedOps.get()) == 0);
+            assertNotEquals(0, readyOps & interestOps);
+            assertEquals(0, readyOps & notifiedOps.get());
             notifiedOps.set(notifiedOps.get() | readyOps);
         });
         assertTrue((n == 1) ^ (expectedOps == 0));
-        assertTrue(notifiedOps.get() == expectedOps);
+        assertEquals(expectedOps, notifiedOps.get());
     }
 
     /**
      * Test that an action is performed when a channel is ready for reading.
      */
+    @Test
     public void testReadable() throws Exception {
         Pipe p = Pipe.open();
         try (Selector sel = Selector.open()) {
@@ -142,6 +148,7 @@ public class SelectWithConsumer {
     /**
      * Test that an action is performed when a channel is ready for writing.
      */
+    @Test
     public void testWritable() throws Exception {
         Pipe p = Pipe.open();
         try (Selector sel = Selector.open()) {
@@ -161,6 +168,7 @@ public class SelectWithConsumer {
      * Test that an action is performed when a channel is ready for both
      * reading and writing.
      */
+    @Test
     public void testReadableAndWriteable() throws Exception {
         ServerSocketChannel ssc = null;
         SocketChannel sc = null;
@@ -188,6 +196,7 @@ public class SelectWithConsumer {
     /**
      * Test that the action is called for two selected channels
      */
+    @Test
     public void testTwoChannels() throws Exception {
         Pipe p = Pipe.open();
         try (Selector sel = Selector.open()) {
@@ -217,8 +226,8 @@ public class SelectWithConsumer {
                 assertTrue(k == key1 || k == key2);
                 counter.incrementAndGet();
             });
-            assertTrue(n == 2);
-            assertTrue(counter.get() == 2);
+            assertEquals(2, n);
+            assertEquals(2, counter.get());
 
             // select(Consumer, timeout)
             counter.set(0);
@@ -226,8 +235,8 @@ public class SelectWithConsumer {
                 assertTrue(k == key1 || k == key2);
                 counter.incrementAndGet();
             }, 1000);
-            assertTrue(n == 2);
-            assertTrue(counter.get() == 2);
+            assertEquals(2, n);
+            assertEquals(2, counter.get());
 
             // selectNow(Consumer)
             counter.set(0);
@@ -235,8 +244,8 @@ public class SelectWithConsumer {
                 assertTrue(k == key1 || k == key2);
                 counter.incrementAndGet();
             });
-            assertTrue(n == 2);
-            assertTrue(counter.get() == 2);
+            assertEquals(2, n);
+            assertEquals(2, counter.get());
         } finally {
             closePipe(p);
         }
@@ -245,6 +254,7 @@ public class SelectWithConsumer {
     /**
      * Test calling select twice, the action should be invoked each time
      */
+    @Test
     public void testRepeatedSelect1() throws Exception {
         Pipe p = Pipe.open();
         try (Selector sel = Selector.open()) {
@@ -269,6 +279,7 @@ public class SelectWithConsumer {
      * Test calling select twice. An I/O operation is performed after the
      * first select so the channel will not be selected by the second select.
      */
+    @Test
     public void testRepeatedSelect2() throws Exception {
         Pipe p = Pipe.open();
         try (Selector sel = Selector.open()) {
@@ -301,6 +312,7 @@ public class SelectWithConsumer {
     /**
      * Test timeout
      */
+    @Test
     public void testTimeout() throws Exception {
         Pipe p = Pipe.open();
         try (Selector sel = Selector.open()) {
@@ -311,7 +323,7 @@ public class SelectWithConsumer {
             long start = millisTime();
             int n = sel.select(k -> assertTrue(false), 1000L);
             expectDuration(start, 500, Long.MAX_VALUE);
-            assertTrue(n == 0);
+            assertEquals(0, n);
         } finally {
             closePipe(p);
         }
@@ -320,12 +332,13 @@ public class SelectWithConsumer {
     /**
      * Test wakeup prior to select
      */
+    @Test
     public void testWakeupBeforeSelect() throws Exception {
         // select(Consumer)
         try (Selector sel = Selector.open()) {
             sel.wakeup();
             int n = sel.select(k -> assertTrue(false));
-            assertTrue(n == 0);
+            assertEquals(0, n);
         }
 
         // select(Consumer, timeout)
@@ -334,19 +347,20 @@ public class SelectWithConsumer {
             long start = millisTime();
             int n = sel.select(k -> assertTrue(false), 60*1000);
             expectDuration(start, 0, 20_000);
-            assertTrue(n == 0);
+            assertEquals(0, n);
         }
     }
 
     /**
      * Test wakeup during select
      */
+    @Test
     public void testWakeupDuringSelect() throws Exception {
         // select(Consumer)
         try (Selector sel = Selector.open()) {
             scheduleWakeup(sel, 1, SECONDS);
             int n = sel.select(k -> assertTrue(false));
-            assertTrue(n == 0);
+            assertEquals(0, n);
         }
 
         // select(Consumer, timeout)
@@ -355,19 +369,20 @@ public class SelectWithConsumer {
             long start = millisTime();
             int n = sel.select(k -> assertTrue(false), 60*1000);
             expectDuration(start, 0, 20_000);
-            assertTrue(n == 0);
+            assertEquals(0, n);
         }
     }
 
     /**
      * Test invoking select with interrupted status set
      */
+    @Test
     public void testInterruptBeforeSelect() throws Exception {
         // select(Consumer)
         try (Selector sel = Selector.open()) {
             Thread.currentThread().interrupt();
             int n = sel.select(k -> assertTrue(false));
-            assertTrue(n == 0);
+            assertEquals(0, n);
             assertTrue(Thread.currentThread().isInterrupted());
             assertTrue(sel.isOpen());
         } finally {
@@ -380,7 +395,7 @@ public class SelectWithConsumer {
             long start = millisTime();
             int n = sel.select(k -> assertTrue(false), 60*1000);
             expectDuration(start, 0, 20_000);
-            assertTrue(n == 0);
+            assertEquals(0, n);
             assertTrue(Thread.currentThread().isInterrupted());
             assertTrue(sel.isOpen());
         } finally {
@@ -391,12 +406,13 @@ public class SelectWithConsumer {
     /**
      * Test interrupt thread during select
      */
+    @Test
     public void testInterruptDuringSelect() throws Exception {
         // select(Consumer)
         try (Selector sel = Selector.open()) {
             scheduleInterrupt(Thread.currentThread(), 1, SECONDS);
             int n = sel.select(k -> assertTrue(false));
-            assertTrue(n == 0);
+            assertEquals(0, n);
             assertTrue(Thread.currentThread().isInterrupted());
             assertTrue(sel.isOpen());
         } finally {
@@ -407,7 +423,7 @@ public class SelectWithConsumer {
         try (Selector sel = Selector.open()) {
             scheduleInterrupt(Thread.currentThread(), 1, SECONDS);
             int n = sel.select(k -> assertTrue(false), 60*1000);
-            assertTrue(n == 0);
+            assertEquals(0, n);
             assertTrue(Thread.currentThread().isInterrupted());
             assertTrue(sel.isOpen());
         } finally {
@@ -418,34 +434,38 @@ public class SelectWithConsumer {
     /**
      * Test invoking select on a closed selector
      */
-    @Test(expectedExceptions = ClosedSelectorException.class)
+    @Test
     public void testClosedSelector1() throws Exception {
         Selector sel = Selector.open();
         sel.close();
-        sel.select(k -> assertTrue(false));
+        assertThrows(ClosedSelectorException.class,
+                     () -> sel.select(k -> assertTrue(false)));
     }
-    @Test(expectedExceptions = ClosedSelectorException.class)
+    @Test
     public void testClosedSelector2() throws Exception {
         Selector sel = Selector.open();
         sel.close();
-        sel.select(k -> assertTrue(false), 1000);
+        assertThrows(ClosedSelectorException.class,
+                     () -> sel.select(k -> assertTrue(false), 1000));
     }
-    @Test(expectedExceptions = ClosedSelectorException.class)
+    @Test
     public void testClosedSelector3() throws Exception {
         Selector sel = Selector.open();
         sel.close();
-        sel.selectNow(k -> assertTrue(false));
+        assertThrows(ClosedSelectorException.class,
+                     () -> sel.selectNow(k -> assertTrue(false)));
     }
 
     /**
      * Test closing selector while in a selection operation
      */
+    @Test
     public void testCloseDuringSelect() throws Exception {
         // select(Consumer)
         try (Selector sel = Selector.open()) {
             scheduleClose(sel, 3, SECONDS);
             int n = sel.select(k -> assertTrue(false));
-            assertTrue(n == 0);
+            assertEquals(0, n);
             assertFalse(sel.isOpen());
         }
 
@@ -458,7 +478,7 @@ public class SelectWithConsumer {
             long after = System.nanoTime();
             long selectDuration = (after - start) / 1000000;
             long scheduleDuration = (start - before) / 1000000;
-            assertTrue(n == 0);
+            assertEquals(0, n);
             assertTrue(selectDuration > 2000 && selectDuration < 10*1000,
                     "select took " + selectDuration + " ms schedule took " +
                     scheduleDuration + " ms");
@@ -469,7 +489,7 @@ public class SelectWithConsumer {
     /**
      * Test action closing selector
      */
-    @Test(expectedExceptions = ClosedSelectorException.class)
+    @Test
     public void testActionClosingSelector() throws Exception {
         Pipe p = Pipe.open();
         try (Selector sel = Selector.open()) {
@@ -482,12 +502,14 @@ public class SelectWithConsumer {
             sink.write(messageBuffer());
 
             // should relay ClosedSelectorException
-            sel.select(k -> {
-                assertTrue(k == key);
-                try {
-                    sel.close();
-                } catch (IOException ioe) { }
-            });
+            assertThrows(ClosedSelectorException.class,
+                () -> sel.select(k -> {
+                    assertTrue(k == key);
+                    try {
+                        sel.close();
+                    } catch (IOException ioe) { }
+                })
+            );
         } finally {
             closePipe(p);
         }
@@ -497,6 +519,7 @@ public class SelectWithConsumer {
      * Test that the action is invoked while synchronized on the selector and
      * its selected-key set.
      */
+    @Test
     public void testLocks() throws Exception {
         Pipe p = Pipe.open();
         try (Selector sel = Selector.open()) {
@@ -510,7 +533,7 @@ public class SelectWithConsumer {
 
             // select(Consumer)
             sel.select(k -> {
-                assertTrue(k == key);
+                assertSame(key, k);
                 assertTrue(Thread.holdsLock(sel));
                 assertFalse(Thread.holdsLock(sel.keys()));
                 assertTrue(Thread.holdsLock(sel.selectedKeys()));
@@ -518,7 +541,7 @@ public class SelectWithConsumer {
 
             // select(Consumer, timeout)
             sel.select(k -> {
-                assertTrue(k == key);
+                assertSame(key, k);
                 assertTrue(Thread.holdsLock(sel));
                 assertFalse(Thread.holdsLock(sel.keys()));
                 assertTrue(Thread.holdsLock(sel.selectedKeys()));
@@ -526,7 +549,7 @@ public class SelectWithConsumer {
 
             // selectNow(Consumer)
             sel.selectNow(k -> {
-                assertTrue(k == key);
+                assertSame(key, k);
                 assertTrue(Thread.holdsLock(sel));
                 assertFalse(Thread.holdsLock(sel.keys()));
                 assertTrue(Thread.holdsLock(sel.selectedKeys()));
@@ -540,6 +563,7 @@ public class SelectWithConsumer {
      * Test that selection operations remove cancelled keys from the selector's
      * key and selected-key sets.
      */
+    @Test
     public void testCancel() throws Exception {
         Pipe p = Pipe.open();
         try (Selector sel = Selector.open()) {
@@ -569,7 +593,7 @@ public class SelectWithConsumer {
             // cancel key1
             key1.cancel();
             int n = sel.selectNow(k -> assertTrue(k == key2));
-            assertTrue(n == 1);
+            assertEquals(1, n);
             assertFalse(sel.keys().contains(key1));
             assertTrue(sel.keys().contains(key2));
             assertFalse(sel.selectedKeys().contains(key1));
@@ -578,7 +602,7 @@ public class SelectWithConsumer {
             // cancel key2
             key2.cancel();
             n = sel.selectNow(k -> assertTrue(false));
-            assertTrue(n == 0);
+            assertEquals(0, n);
             assertFalse(sel.keys().contains(key1));
             assertFalse(sel.keys().contains(key2));
             assertFalse(sel.selectedKeys().contains(key1));
@@ -591,6 +615,7 @@ public class SelectWithConsumer {
     /**
      * Test an action invoking select()
      */
+    @Test
     public void testReentrantSelect1() throws Exception {
         Pipe p = Pipe.open();
         try (Selector sel = Selector.open()) {
@@ -611,7 +636,7 @@ public class SelectWithConsumer {
                 } catch (IllegalStateException expected) {
                 }
             });
-            assertTrue(n == 1);
+            assertEquals(1, n);
         } finally {
             closePipe(p);
         }
@@ -620,6 +645,7 @@ public class SelectWithConsumer {
     /**
      * Test an action invoking selectNow()
      */
+    @Test
     public void testReentrantSelect2() throws Exception {
         Pipe p = Pipe.open();
         try (Selector sel = Selector.open()) {
@@ -640,7 +666,7 @@ public class SelectWithConsumer {
                 } catch (IllegalStateException expected) {
                 }
             });
-            assertTrue(n == 1);
+            assertEquals(1, n);
         } finally {
             closePipe(p);
         }
@@ -649,6 +675,7 @@ public class SelectWithConsumer {
     /**
      * Test an action invoking select(Consumer)
      */
+    @Test
     public void testReentrantSelect3() throws Exception {
         Pipe p = Pipe.open();
         try (Selector sel = Selector.open()) {
@@ -669,7 +696,7 @@ public class SelectWithConsumer {
                 } catch (IllegalStateException expected) {
                 }
             });
-            assertTrue(n == 1);
+            assertEquals(1, n);
         } finally {
             closePipe(p);
         }
@@ -678,42 +705,46 @@ public class SelectWithConsumer {
     /**
      * Negative timeout
      */
-    @Test(expectedExceptions = IllegalArgumentException.class)
+    @Test
     public void testNegativeTimeout() throws Exception {
         try (Selector sel = Selector.open()) {
-            sel.select(k -> { }, -1L);
+            assertThrows(IllegalArgumentException.class,
+                         () -> sel.select(k -> { }, -1L));
         }
     }
 
     /**
      * Null action
      */
-    @Test(expectedExceptions = NullPointerException.class)
+    @Test
     public void testNull1() throws Exception {
         try (Selector sel = Selector.open()) {
-            sel.select(null);
+            assertThrows(NullPointerException.class,
+                         () -> sel.select(null));
         }
     }
-    @Test(expectedExceptions = NullPointerException.class)
+    @Test
     public void testNull2() throws Exception {
         try (Selector sel = Selector.open()) {
-            sel.select(null, 1000);
+            assertThrows(NullPointerException.class,
+                         () -> sel.select(null, 1000));
         }
     }
-    @Test(expectedExceptions = NullPointerException.class)
+    @Test
     public void testNull3() throws Exception {
         try (Selector sel = Selector.open()) {
-            sel.selectNow(null);
+            assertThrows(NullPointerException.class,
+                         () -> sel.selectNow(null));
         }
     }
 
 
     // -- support methods ---
 
-    private final ScheduledExecutorService POOL = Executors.newScheduledThreadPool(1);
+    private static final ScheduledExecutorService POOL = Executors.newScheduledThreadPool(1);
 
-    @AfterTest
-    void shutdownThreadPool() {
+    @AfterAll
+    static void shutdownThreadPool() {
         POOL.shutdown();
     }
 
diff --git a/test/jdk/java/nio/channels/Selector/UpdateReadyOps.java b/test/jdk/java/nio/channels/Selector/UpdateReadyOps.java
index 57a563c6a59..87b512fe495 100644
--- a/test/jdk/java/nio/channels/Selector/UpdateReadyOps.java
+++ b/test/jdk/java/nio/channels/Selector/UpdateReadyOps.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -22,7 +22,7 @@
  */
 
 /* @test
- * @run testng UpdateReadyOps
+ * @run junit UpdateReadyOps
  * @summary Test that the ready set from a selection operation is bitwise-disjoined
  *     into a key's ready set when the key is already in the selected-key set
  */
@@ -37,16 +37,19 @@ import java.nio.channels.Selector;
 import java.nio.channels.ServerSocketChannel;
 import java.nio.channels.SocketChannel;
 
-import org.testng.annotations.Test;
-import static org.testng.Assert.*;
+import org.junit.jupiter.api.Test;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertFalse;
+import static org.junit.jupiter.api.Assertions.assertTrue;
 
-@Test
 public class UpdateReadyOps {
 
     /**
      * Test that OP_WRITE is preserved when updating the ready set of a key in
      * the selected-key set to add OP_READ.
      */
+    @Test
     public void testOpWritePreserved() throws Exception {
         try (ConnectionPair pair = new ConnectionPair();
              Selector sel = Selector.open()) {
@@ -58,14 +61,14 @@ public class UpdateReadyOps {
             SelectionKey key = sc1.register(sel, SelectionKey.OP_WRITE);
 
             int updated = sel.select();
-            assertTrue(updated == 1);
+            assertEquals(1, updated);
             assertTrue(sel.selectedKeys().contains(key));
             assertFalse(key.isReadable());
             assertTrue(key.isWritable());
 
             // select again, should be no updates
             updated = sel.select();
-            assertTrue(updated == 0);
+            assertEquals(0, updated);
             assertTrue(sel.selectedKeys().contains(key));
             assertFalse(key.isReadable());
             assertTrue(key.isWritable());
@@ -78,16 +81,17 @@ public class UpdateReadyOps {
 
             key.interestOps(SelectionKey.OP_READ);
             updated = sel.select();
-            assertTrue(updated == 1);
-            assertTrue(sel.selectedKeys().size() == 1);
+            assertEquals(1, updated);
+            assertEquals(1, sel.selectedKeys().size());
             assertTrue(key.isReadable());
             assertTrue(key.isWritable());
-            assertTrue(key.readyOps() == (SelectionKey.OP_READ|SelectionKey.OP_WRITE));
+            assertEquals(SelectionKey.OP_READ|SelectionKey.OP_WRITE,
+                         key.readyOps());
 
             // select again, should be no updates
             updated = sel.select();
-            assertTrue(updated == 0);
-            assertTrue(sel.selectedKeys().size() == 1);
+            assertEquals(0, updated);
+            assertEquals(1, sel.selectedKeys().size());
             assertTrue(key.isReadable());
             assertTrue(key.isWritable());
         }
@@ -97,6 +101,7 @@ public class UpdateReadyOps {
      * Test that OP_READ is preserved when updating the ready set of a key in
      * the selected-key set to add OP_WRITE.
      */
+    @Test
     public void testOpReadPreserved() throws Exception {
         try (ConnectionPair pair = new ConnectionPair();
              Selector sel = Selector.open()) {
@@ -111,32 +116,32 @@ public class UpdateReadyOps {
             sc2.write(helloMessage());
 
             int updated = sel.select();
-            assertTrue(updated == 1);
-            assertTrue(sel.selectedKeys().size() == 1);
+            assertEquals(1, updated);
+            assertEquals(1, sel.selectedKeys().size());
             assertTrue(sel.selectedKeys().contains(key));
             assertTrue(key.isReadable());
             assertFalse(key.isWritable());
 
             // select again, should be no updates
             updated = sel.select();
-            assertTrue(updated == 0);
+            assertEquals(0, updated);
             assertTrue(sel.selectedKeys().contains(key));
             assertTrue(key.isReadable());
             assertFalse(key.isWritable());
 
             key.interestOps(SelectionKey.OP_WRITE);
             updated = sel.select();
-            assertTrue(updated == 1);
-            assertTrue(sel.selectedKeys().size() == 1);
+            assertEquals(1, updated);
+            assertEquals(1, sel.selectedKeys().size());
             assertTrue(sel.selectedKeys().contains(key));
             assertTrue(key.isReadable());
             assertTrue(key.isWritable());
-            assertTrue(key.readyOps() == (SelectionKey.OP_READ|SelectionKey.OP_WRITE));
+            assertEquals(SelectionKey.OP_READ|SelectionKey.OP_WRITE, key.readyOps());
 
             // select again, should be no updates
             updated = sel.select();
-            assertTrue(updated == 0);
-            assertTrue(sel.selectedKeys().size() == 1);
+            assertEquals(0, updated);
+            assertEquals(1, sel.selectedKeys().size());
             assertTrue(key.isReadable());
             assertTrue(key.isWritable());
         }
diff --git a/test/jdk/java/nio/channels/spi/SelectorProvider/TestDefaultImplementation.java b/test/jdk/java/nio/channels/spi/SelectorProvider/TestDefaultImplementation.java
index 6d402949982..e17b16dadc7 100644
--- a/test/jdk/java/nio/channels/spi/SelectorProvider/TestDefaultImplementation.java
+++ b/test/jdk/java/nio/channels/spi/SelectorProvider/TestDefaultImplementation.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2020, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,19 +25,22 @@
  * @test
  * @bug 8254692
  * @summary Basic test for java.nio.channels.spi.SelectorProvider.java default implementation
- * @run testng TestDefaultImplementation
+ * @run junit TestDefaultImplementation
  */
 
-import org.testng.annotations.Test;
-
 import java.io.IOException;
 import java.net.ProtocolFamily;
-import java.nio.channels.*;
+import java.nio.channels.DatagramChannel;
+import java.nio.channels.Pipe;
+import java.nio.channels.ServerSocketChannel;
+import java.nio.channels.SocketChannel;
 import java.nio.channels.spi.AbstractSelector;
 import java.nio.channels.spi.SelectorProvider;
 
-import static org.testng.Assert.assertNull;
-import static org.testng.Assert.assertThrows;
+import org.junit.jupiter.api.Test;
+
+import static org.junit.jupiter.api.Assertions.assertNull;
+import static org.junit.jupiter.api.Assertions.assertThrows;
 
 public class TestDefaultImplementation {
     static final Class<UnsupportedOperationException> UOE = UnsupportedOperationException.class;
@@ -67,4 +70,4 @@ public class TestDefaultImplementation {
         @Override public ServerSocketChannel openServerSocketChannel() { return null; }
         @Override public SocketChannel openSocketChannel() { return null; }
     }
-}
\ No newline at end of file
+}
diff --git a/test/jdk/java/nio/channels/spi/SelectorProvider/inheritedChannel/InheritedChannelTest.java b/test/jdk/java/nio/channels/spi/SelectorProvider/inheritedChannel/InheritedChannelTest.java
index 934bf509d88..897fc6236dc 100644
--- a/test/jdk/java/nio/channels/spi/SelectorProvider/inheritedChannel/InheritedChannelTest.java
+++ b/test/jdk/java/nio/channels/spi/SelectorProvider/inheritedChannel/InheritedChannelTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2017, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2017, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -36,7 +36,7 @@
  *        UnixSocketTest StateTest StateTestService EchoTest EchoService
  *        UnixDomainChannelTest CloseTest Launcher Util
  *        CheckIPv6Test CheckIPv6Service
- * @run testng/othervm/native InheritedChannelTest
+ * @run junit/othervm/native InheritedChannelTest
  * @key intermittent
  */
 
@@ -45,14 +45,16 @@ import java.nio.file.Paths;
 import java.util.ArrayList;
 import java.util.List;
 import java.util.Map;
+import java.util.stream.Stream;
 
 import jdk.test.lib.JDKToolFinder;
 import jdk.test.lib.Utils;
 import jdk.test.lib.process.ProcessTools;
 import jdk.test.lib.Platform;
 
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.Arguments;
+import org.junit.jupiter.params.provider.MethodSource;
 
 import static java.util.Arrays.asList;
 
@@ -64,19 +66,18 @@ public class InheritedChannelTest {
     private static final Path libraryPath
             = Paths.get(System.getProperty("java.library.path"));
 
-    @DataProvider
-    public Object[][] testCases() {
-        return new Object[][] {
-            { "UnixDomainChannelTest", List.of(UnixDomainChannelTest.class.getName())},
-            { "UnixSocketTest", List.of(UnixSocketTest.class.getName())},
-            { "StateTest", List.of(StateTest.class.getName(), "-Dtest.classes="+TEST_CLASSES)},
-            { "EchoTest",  List.of(EchoTest.class.getName())  },
-            { "CheckIPv6Test",  List.of(CheckIPv6Test.class.getName())  },
-            { "CloseTest", List.of(CloseTest.class.getName()) },
-        };
+    public static Stream<Arguments> testCases() {
+        return Stream.of
+            (Arguments.of( "UnixDomainChannelTest", List.of(UnixDomainChannelTest.class.getName())),
+             Arguments.of( "UnixSocketTest", List.of(UnixSocketTest.class.getName())),
+             Arguments.of( "StateTest", List.of(StateTest.class.getName(), "-Dtest.classes="+TEST_CLASSES)),
+             Arguments.of( "EchoTest", List.of(EchoTest.class.getName())),
+             Arguments.of( "CheckIPv6Test", List.of(CheckIPv6Test.class.getName())),
+             Arguments.of( "CloseTest", List.of(CloseTest.class.getName())));
     }
 
-    @Test(dataProvider = "testCases")
+    @ParameterizedTest
+    @MethodSource("testCases")
     public void test(String desc, List<String> opts) throws Throwable {
         String pathVar = Platform.sharedLibraryPathVariableName();
         System.out.println(pathVar + "=" + libraryPath);

From 6b921835124904f0fe6d807daab81a6d1b89b560 Mon Sep 17 00:00:00 2001
From: Brian Burkhalter <bpb@openjdk.org>
Date: Mon, 9 Mar 2026 18:06:14 +0000
Subject: [PATCH 109/655] 8378879: Refactor java/nio/channels/Channels TestNG
 tests to use JUnit

Reviewed-by: alanb
---
 .../nio/channels/Channels/EncodingTest.java   | 113 +++++++++---------
 .../nio/channels/Channels/ReadXBytes.java     |  76 ++++++------
 .../Channels/SocketChannelStreams.java        | 110 ++++++++++-------
 .../nio/channels/Channels/TransferTo.java     |  54 ++++-----
 .../nio/channels/Channels/TransferTo2.java    |  39 +++---
 .../nio/channels/Channels/TransferToBase.java |  14 +--
 .../Channels/TransferTo_2GB_transferFrom.java |   6 +-
 .../Channels/TransferTo_2GB_transferTo.java   |   6 +-
 8 files changed, 226 insertions(+), 192 deletions(-)

diff --git a/test/jdk/java/nio/channels/Channels/EncodingTest.java b/test/jdk/java/nio/channels/Channels/EncodingTest.java
index 1f2530ae41b..341439524c1 100644
--- a/test/jdk/java/nio/channels/Channels/EncodingTest.java
+++ b/test/jdk/java/nio/channels/Channels/EncodingTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2017, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2017, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -34,16 +34,21 @@ import java.nio.charset.Charset;
 import java.nio.charset.MalformedInputException;
 import java.nio.charset.StandardCharsets;
 import java.nio.file.Paths;
-import org.testng.Assert;
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
+import java.util.stream.Stream;
+
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.Arguments;
+import org.junit.jupiter.params.provider.MethodSource;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertThrows;
 
 /**
  * @test
  * @bug 8183743
  * @summary Test to verify the new overload method with Charset functions the same
  * as the existing method that takes a charset name.
- * @run testng EncodingTest
+ * @run junit EncodingTest
  */
 public class EncodingTest {
     static final int ITERATIONS = 2;
@@ -73,53 +78,50 @@ public class EncodingTest {
         }
     }
 
-    String testFile = Paths.get(USER_DIR, "channelsEncodingTest.txt").toString();
-    String testIllegalInput = Paths.get(USER_DIR, "channelsIllegalInputTest.txt").toString();
-    String testIllegalOutput = Paths.get(USER_DIR, "channelsIllegalOutputTest.txt").toString();
+    static String testFile = Paths.get(USER_DIR, "channelsEncodingTest.txt").toString();
+    static String testIllegalInput = Paths.get(USER_DIR, "channelsIllegalInputTest.txt").toString();
+    static String testIllegalOutput = Paths.get(USER_DIR, "channelsIllegalOutputTest.txt").toString();
 
 
     /*
      * DataProvider for read and write test.
      * Writes and reads with the same encoding
      */
-    @DataProvider(name = "writeAndRead")
-    public Object[][] getWRParameters() {
-        return new Object[][]{
-            {testFile, StandardCharsets.ISO_8859_1.name(), null,
-                StandardCharsets.ISO_8859_1.name(), StandardCharsets.ISO_8859_1},
-            {testFile, null, StandardCharsets.ISO_8859_1,
-                StandardCharsets.ISO_8859_1.name(), StandardCharsets.ISO_8859_1},
-            {testFile, StandardCharsets.UTF_8.name(), null,
-                StandardCharsets.UTF_8.name(), StandardCharsets.UTF_8},
-            {testFile, null, StandardCharsets.UTF_8,
-                StandardCharsets.UTF_8.name(), StandardCharsets.UTF_8}
-        };
+    public static Stream<Arguments> writeAndRead() {
+        return Stream.of
+            (Arguments.of(testFile, StandardCharsets.ISO_8859_1.name(), null,
+                          StandardCharsets.ISO_8859_1.name(), StandardCharsets.ISO_8859_1),
+             Arguments.of(testFile, null, StandardCharsets.ISO_8859_1,
+                          StandardCharsets.ISO_8859_1.name(), StandardCharsets.ISO_8859_1),
+             Arguments.of(testFile, StandardCharsets.UTF_8.name(), null,
+                          StandardCharsets.UTF_8.name(), StandardCharsets.UTF_8),
+             Arguments.of(testFile, null, StandardCharsets.UTF_8,
+                          StandardCharsets.UTF_8.name(), StandardCharsets.UTF_8)
+             );
     }
 
     /*
      * DataProvider for illegal input test
      * Writes the data in ISO8859 and reads with UTF8, expects MalformedInputException
      */
-    @DataProvider(name = "illegalInput")
-    public Object[][] getParameters() {
-        return new Object[][]{
-            {testIllegalInput, StandardCharsets.ISO_8859_1.name(), null, StandardCharsets.UTF_8.name(), null},
-            {testIllegalInput, StandardCharsets.ISO_8859_1.name(), null, null, StandardCharsets.UTF_8},
-            {testIllegalInput, null, StandardCharsets.ISO_8859_1, StandardCharsets.UTF_8.name(), null},
-            {testIllegalInput, null, StandardCharsets.ISO_8859_1, null, StandardCharsets.UTF_8},
-        };
+    public static Stream<Arguments> illegalInput() {
+        return Stream.of
+            (Arguments.of(testIllegalInput, StandardCharsets.ISO_8859_1.name(), null, StandardCharsets.UTF_8.name(), null),
+             Arguments.of(testIllegalInput, StandardCharsets.ISO_8859_1.name(), null, null, StandardCharsets.UTF_8),
+             Arguments.of(testIllegalInput, null, StandardCharsets.ISO_8859_1, StandardCharsets.UTF_8.name(), null),
+             Arguments.of(testIllegalInput, null, StandardCharsets.ISO_8859_1, null, StandardCharsets.UTF_8)
+             );
     }
 
     /*
      * DataProvider for illegal output test
      * Attemps to write some malformed chars, expects MalformedInputException
      */
-    @DataProvider(name = "illegalOutput")
-    public Object[][] getWriteParameters() {
-        return new Object[][]{
-            {testIllegalOutput, StandardCharsets.UTF_8.name(), null},
-            {testIllegalOutput, null, StandardCharsets.UTF_8}
-        };
+    public static Stream<Arguments> illegalOutput() {
+        return Stream.of
+            (Arguments.of(testIllegalOutput, StandardCharsets.UTF_8.name(), null),
+             Arguments.of(testIllegalOutput, null, StandardCharsets.UTF_8)
+             );
     }
 
     /**
@@ -140,7 +142,8 @@ public class EncodingTest {
      * @param charsetReader the charset for creating the reader
      * @throws Exception
      */
-    @Test(dataProvider = "writeAndRead")
+    @ParameterizedTest
+    @MethodSource("writeAndRead")
     public void testWriteAndRead(String file, String csnWriter, Charset charsetWriter,
             String csnReader, Charset charsetReader) throws Exception {
         writeToFile(data, file, csnWriter, charsetWriter);
@@ -148,7 +151,7 @@ public class EncodingTest {
         String result1 = readFileToString(file, csnReader, null);
         String result2 = readFileToString(file, null, charsetReader);
 
-        Assert.assertEquals(result1, result2);
+        assertEquals(result1, result2);
     }
 
     /**
@@ -162,11 +165,14 @@ public class EncodingTest {
      * @param charsetReader the charset for creating the reader
      * @throws Exception
      */
-    @Test(dataProvider = "illegalInput", expectedExceptions = MalformedInputException.class)
+    @ParameterizedTest
+    @MethodSource( "illegalInput")
     void testMalformedInput(String file, String csnWriter, Charset charsetWriter,
-            String csnReader, Charset charsetReader) throws Exception {
+                            String csnReader, Charset charsetReader)
+        throws Exception {
         writeToFile(data, file, csnWriter, charsetWriter);
-        readFileToString(file, csnReader, charsetReader);
+        assertThrows(MalformedInputException.class,
+                     () -> readFileToString(file, csnReader, charsetReader));
     }
 
     /**
@@ -178,23 +184,22 @@ public class EncodingTest {
      * @param charset the charset
      * @throws Exception
      */
-    @Test(dataProvider = "illegalOutput", expectedExceptions = MalformedInputException.class)
+    @ParameterizedTest
+    @MethodSource("illegalOutput")
     public void testMalformedOutput(String fileName, String csn, Charset charset)
-            throws Exception {
+        throws Exception {
         try (FileOutputStream fos = new FileOutputStream(fileName);
-                WritableByteChannel wbc = (WritableByteChannel) fos.getChannel();) {
-            Writer writer;
-            if (csn != null) {
-                writer = Channels.newWriter(wbc, csn);
-            } else {
-                writer = Channels.newWriter(wbc, charset);
-            }
-
-            for (int i = 0; i < ITERATIONS; i++) {
-                writer.write(illChars);
-            }
-            writer.flush();
-            writer.close();
+             WritableByteChannel wbc = (WritableByteChannel) fos.getChannel();) {
+            Charset cs = (csn != null) ? Charset.forName(csn) : charset;
+            Writer writer = Channels.newWriter(wbc, cs);
+            assertThrows(MalformedInputException.class, () -> {
+                try (writer) {
+                    for (int i = 0; i < ITERATIONS; i++) {
+                        writer.write(illChars);
+                    }
+                    writer.flush();
+                }
+            });
         }
     }
 
diff --git a/test/jdk/java/nio/channels/Channels/ReadXBytes.java b/test/jdk/java/nio/channels/Channels/ReadXBytes.java
index 1ea500f355d..4b296bb021e 100644
--- a/test/jdk/java/nio/channels/Channels/ReadXBytes.java
+++ b/test/jdk/java/nio/channels/Channels/ReadXBytes.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2021, 2022, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2021, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -30,7 +30,7 @@
  * @library /test/lib
  * @build jdk.test.lib.RandomFactory
  * @modules java.base/jdk.internal.util
- * @run testng/othervm/timeout=900 -Xmx12G ReadXBytes
+ * @run junit/othervm/timeout=900 -Xmx12g ReadXBytes
  * @key randomness
  */
 import java.io.File;
@@ -48,20 +48,24 @@ import java.nio.file.Files;
 import java.nio.file.Path;
 import java.util.List;
 import java.util.Random;
+import java.util.stream.IntStream;
 import jdk.internal.util.ArraysSupport;
 
 import static java.nio.file.StandardOpenOption.*;
 
 import jdk.test.lib.RandomFactory;
 
-import org.testng.Assert;
-import static org.testng.Assert.assertEquals;
-import static org.testng.Assert.assertNotNull;
-import static org.testng.Assert.assertThrows;
-import static org.testng.Assert.assertFalse;
-import static org.testng.Assert.assertTrue;
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
+import org.junit.jupiter.api.Test;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.Arguments;
+import org.junit.jupiter.params.provider.MethodSource;
+
+import static org.junit.jupiter.api.Assertions.assertArrayEquals;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertFalse;
+import static org.junit.jupiter.api.Assertions.assertNotNull;
+import static org.junit.jupiter.api.Assertions.assertThrows;
+import static org.junit.jupiter.api.Assertions.assertTrue;
 
 public class ReadXBytes {
 
@@ -193,7 +197,7 @@ public class ReadXBytes {
             (length, cis) -> {
                 byte[] bytes = cis.readAllBytes();
                 assertNotNull(bytes);
-                assertEquals(bytes.length, 0L);
+                assertEquals(0, bytes.length);
             }
         );
     }
@@ -206,7 +210,7 @@ public class ReadXBytes {
                 cis.skipNBytes(length);
                 byte[] bytes = cis.readAllBytes();
                 assertNotNull(bytes);
-                assertEquals(bytes.length, 0);
+                assertEquals(0, bytes.length);
             }
         );
     }
@@ -218,9 +222,9 @@ public class ReadXBytes {
             (length, cis, fis) -> {
                 byte[] cisBytes = cis.readAllBytes();
                 assertNotNull(cisBytes);
-                assertEquals(cisBytes.length, (long)length);
+                assertEquals(length, cisBytes.length);
                 byte[] fisBytes = fis.readAllBytes();
-                assertEquals(cisBytes, fisBytes);
+                assertArrayEquals(fisBytes, cisBytes);
             }
         );
     }
@@ -236,20 +240,19 @@ public class ReadXBytes {
         );
     }
 
-    // Provides an array of lengths
-    @DataProvider
-    public Object[][] lengthProvider() throws IOException {
-        return new Object[][] {
-            {1 + RAND.nextInt(1)},
-            {1 + RAND.nextInt(Byte.MAX_VALUE)},
-            {1 + RAND.nextInt(Short.MAX_VALUE)},
-            {1 + RAND.nextInt(1_000_000)},
-            {1 + RAND.nextInt(BIG_LENGTH)}
-        };
+    // Provides a stream of lengths
+    public static IntStream fileLengths() throws IOException {
+        return IntStream.of
+            (1 + RAND.nextInt(1),
+             1 + RAND.nextInt(Byte.MAX_VALUE),
+             1 + RAND.nextInt(Short.MAX_VALUE),
+             1 + RAND.nextInt(1_000_000),
+             1 + RAND.nextInt(BIG_LENGTH));
     }
 
     // Verifies readAllBytes() accuracy for random lengths and initial positions
-    @Test(dataProvider = "lengthProvider")
+    @ParameterizedTest
+    @MethodSource("fileLengths")
     public void readAllBytes(int len) throws IOException {
         dataTest(len, (length) -> createFileWithRandomContent(length),
             (length, cis, fis) -> {
@@ -257,10 +260,10 @@ public class ReadXBytes {
                 cis.skipNBytes(position);
                 byte[] cisBytes = cis.readAllBytes();
                 assertNotNull(cisBytes);
-                assertEquals(cisBytes.length, length - position);
+                assertEquals(length - position, cisBytes.length);
                 fis.skipNBytes(position);
                 byte[] fisBytes = fis.readAllBytes();
-                assertEquals(cisBytes, fisBytes);
+                assertArrayEquals(fisBytes, cisBytes);
             }
         );
     }
@@ -285,7 +288,7 @@ public class ReadXBytes {
             (length, cis) -> {
                 byte[] bytes = cis.readNBytes(1);
                 assertNotNull(bytes);
-                assertEquals(bytes.length, 0);
+                assertEquals(0, bytes.length);
             }
         );
     }
@@ -298,7 +301,7 @@ public class ReadXBytes {
                 cis.skipNBytes(length);
                 byte[] bytes = cis.readNBytes(1);
                 assertNotNull(bytes);
-                assertEquals(bytes.length, 0);
+                assertEquals(0, bytes.length);
             }
         );
     }
@@ -310,9 +313,9 @@ public class ReadXBytes {
             (length, cis, fis) -> {
                 byte[] cisBytes = cis.readNBytes(BIG_LENGTH);
                 assertNotNull(cisBytes);
-                assertEquals(cisBytes.length, (long)length);
+                assertEquals(length, cisBytes.length);
                 byte[] fisBytes = fis.readNBytes(BIG_LENGTH);
-                assertEquals(cisBytes, fisBytes);
+                assertArrayEquals(fisBytes, cisBytes);
             }
         );
     }
@@ -327,16 +330,17 @@ public class ReadXBytes {
                 cis.skipNBytes(BIG_LENGTH);
                 byte[] cisBytes = cis.readNBytes(n);
                 assertNotNull(cisBytes);
-                assertEquals(cisBytes.length, n);
+                assertEquals(n, cisBytes.length);
                 fis.skipNBytes(BIG_LENGTH);
                 byte[] fisBytes = fis.readNBytes(n);
-                assertEquals(cisBytes, fisBytes);
+                assertArrayEquals(fisBytes, cisBytes);
             }
         );
     }
 
     // Verifies readNBytes() accuracy for random lengths and initial positions
-    @Test(dataProvider = "lengthProvider")
+    @ParameterizedTest
+    @MethodSource("fileLengths")
     public void readNBytes(int len) throws IOException {
         dataTest(len, (length) -> createFileWithRandomContent(length),
             (length, cis, fis) -> {
@@ -346,10 +350,10 @@ public class ReadXBytes {
                 cis.skipNBytes(position);
                 byte[] cisBytes = cis.readNBytes(n);
                 assertNotNull(cisBytes);
-                assertEquals(cisBytes.length, n);
+                assertEquals(n, cisBytes.length);
                 fis.skipNBytes(position);
                 byte[] fisBytes = fis.readNBytes(n);
-                assertEquals(cisBytes, fisBytes);
+                assertArrayEquals(fisBytes, cisBytes);
             }
         );
     }
diff --git a/test/jdk/java/nio/channels/Channels/SocketChannelStreams.java b/test/jdk/java/nio/channels/Channels/SocketChannelStreams.java
index 519de1e725f..0eab36dc3ee 100644
--- a/test/jdk/java/nio/channels/Channels/SocketChannelStreams.java
+++ b/test/jdk/java/nio/channels/Channels/SocketChannelStreams.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2022, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2022, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,7 +25,7 @@
  * @bug 8279339 8371718
  * @summary Exercise InputStream/OutputStream returned by Channels.newXXXStream
  *    when channel is a SocketChannel
- * @run testng SocketChannelStreams
+ * @run junit SocketChannelStreams
  */
 
 import java.io.Closeable;
@@ -48,101 +48,112 @@ import java.util.concurrent.Future;
 import java.util.concurrent.ScheduledExecutorService;
 import java.util.concurrent.TimeUnit;
 
-import org.testng.annotations.*;
-import static org.testng.Assert.*;
+import org.junit.jupiter.api.AfterAll;
+import org.junit.jupiter.api.BeforeAll;
+import org.junit.jupiter.api.Test;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertFalse;
+import static org.junit.jupiter.api.Assertions.assertThrows;
 
-@Test
 public class SocketChannelStreams {
     // Maximum size of internal temporary buffer
     private static final int MAX_BUFFER_SIZE = 128*1024;
 
-    private ScheduledExecutorService executor;
+    private static ScheduledExecutorService executor;
 
-    @BeforeClass()
-    public void init() {
+    @BeforeAll()
+    public static void init() {
         executor = Executors.newSingleThreadScheduledExecutor();
     }
 
-    @AfterClass
-    public void finish() {
+    @AfterAll
+    public static void finish() {
         executor.shutdown();
     }
 
     /**
      * Test read when bytes are available.
      */
+    @Test
     public void testRead1() throws Exception {
         withConnection((sc, peer) -> {
             write(peer, 99);
             int n = Channels.newInputStream(sc).read();
-            assertEquals(n, 99);
+            assertEquals(99, n);
         });
     }
 
     /**
      * Test read blocking before bytes are available.
      */
+    @Test
     public void testRead2() throws Exception {
         withConnection((sc, peer) -> {
             scheduleWrite(peer, 99, 1000);
             int n = Channels.newInputStream(sc).read();
-            assertEquals(n, 99);
+            assertEquals(99, n);
         });
     }
 
     /**
      * Test read after peer has closed connection.
      */
+    @Test
     public void testRead3() throws Exception {
         withConnection((sc, peer) -> {
             peer.close();
             int n = Channels.newInputStream(sc).read();
-            assertEquals(n, -1);
+            assertEquals(-1, n);
         });
     }
 
     /**
      * Test read blocking before peer closes connection.
      */
+    @Test
     public void testRead4() throws Exception {
         withConnection((sc, peer) -> {
             scheduleClose(peer, 1000);
             int n = Channels.newInputStream(sc).read();
-            assertEquals(n, -1);
+            assertEquals(-1, n);
         });
     }
 
     /**
      * Test async close of channel when thread blocked in read.
      */
+    @Test
     public void testRead5() throws Exception {
         withConnection((sc, peer) -> {
             scheduleClose(sc, 2000);
             InputStream in = Channels.newInputStream(sc);
-            expectThrows(IOException.class, () -> in.read());
+            assertThrows(IOException.class, () -> in.read());
         });
     }
 
     /**
      * Test async close of input stream, when thread blocked in read.
      */
+    @Test
     public void testRead6() throws Exception {
         withConnection((sc, peer) -> {
             InputStream in = Channels.newInputStream(sc);
             scheduleClose(in, 2000);
-            expectThrows(IOException.class, () -> in.read());
+            assertThrows(IOException.class, () -> in.read());
         });
     }
 
     /**
      * Test interrupted status set before read.
      */
+    @Test
     public void testRead7() throws Exception {
         withConnection((sc, peer) -> {
             Thread.currentThread().interrupt();
             try {
                 InputStream in = Channels.newInputStream(sc);
-                expectThrows(IOException.class, () -> in.read());
+                assertThrows(IOException.class, () -> in.read());
             } finally {
                 Thread.interrupted();  // clear interrupt
             }
@@ -153,12 +164,13 @@ public class SocketChannelStreams {
     /**
      * Test interrupt of thread blocked in read.
      */
+    @Test
     public void testRead8() throws Exception {
         withConnection((sc, peer) -> {
             Future<?> interrupter = scheduleInterrupt(Thread.currentThread(), 2000);
             try {
                 InputStream in = Channels.newInputStream(sc);
-                expectThrows(IOException.class, () -> in.read());
+                assertThrows(IOException.class, () -> in.read());
             } finally {
                 interrupter.cancel(true);
                 Thread.interrupted();  // clear interrupt
@@ -170,35 +182,38 @@ public class SocketChannelStreams {
     /**
      * Test that read is untimed when SO_TIMEOUT is set on the Socket adaptor.
      */
+    @Test
     public void testRead9() throws Exception {
         withConnection((sc, peer) -> {
             sc.socket().setSoTimeout(100);
             scheduleWrite(peer, 99, 2000);
             // read should block until bytes are available
             int b = Channels.newInputStream(sc).read();
-            assertTrue(b == 99);
+            assertEquals(99, b);
         });
     }
 
     /**
      * Test write.
      */
+    @Test
     public void testWrite1() throws Exception {
         withConnection((sc, peer) -> {
             OutputStream out = Channels.newOutputStream(sc);
             out.write(99);
             int n = read(peer);
-            assertEquals(n, 99);
+            assertEquals(99, n);
         });
     }
 
     /**
      * Test async close of channel when thread blocked in write.
      */
+    @Test
     public void testWrite2() throws Exception {
         withConnection((sc, peer) -> {
             scheduleClose(sc, 2000);
-            expectThrows(IOException.class, () -> {
+            assertThrows(IOException.class, () -> {
                 OutputStream out = Channels.newOutputStream(sc);
                 byte[] data = new byte[64*1000];
                 while (true) {
@@ -211,11 +226,12 @@ public class SocketChannelStreams {
     /**
      * Test async close of output stream when thread blocked in write.
      */
+    @Test
     public void testWrite3() throws Exception {
         withConnection((sc, peer) -> {
             OutputStream out = Channels.newOutputStream(sc);
             scheduleClose(out, 2000);
-            expectThrows(IOException.class, () -> {
+            assertThrows(IOException.class, () -> {
                 byte[] data = new byte[64*1000];
                 while (true) {
                     out.write(data);
@@ -227,12 +243,13 @@ public class SocketChannelStreams {
     /**
      * Test interrupted status set before write.
      */
+    @Test
     public void testWrite4() throws Exception {
         withConnection((sc, peer) -> {
             Thread.currentThread().interrupt();
             try {
                 OutputStream out = Channels.newOutputStream(sc);
-                expectThrows(IOException.class, () -> out.write(99));
+                assertThrows(IOException.class, () -> out.write(99));
             } finally {
                 Thread.interrupted();  // clear interrupt
             }
@@ -243,11 +260,12 @@ public class SocketChannelStreams {
     /**
      * Test interrupt of thread blocked in write.
      */
+    @Test
     public void testWrite5() throws Exception {
         withConnection((sc, peer) -> {
             Future<?> interrupter = scheduleInterrupt(Thread.currentThread(), 2000);
             try {
-                expectThrows(IOException.class, () -> {
+                assertThrows(IOException.class, () -> {
                     OutputStream out = Channels.newOutputStream(sc);
                     byte[] data = new byte[64*1000];
                     while (true) {
@@ -266,6 +284,7 @@ public class SocketChannelStreams {
      * Test read when another thread is blocked in write. The read should
      * complete immediately.
      */
+    @Test
     public void testConcurrentReadWrite1() throws Exception {
         withConnection((sc, peer) -> {
             InputStream in = Channels.newInputStream(sc);
@@ -283,7 +302,7 @@ public class SocketChannelStreams {
             // test read, should not be blocked by writer thread
             write(peer, 99);
             int n = in.read();
-            assertEquals(n, 99);
+            assertEquals(99, n);
         });
     }
 
@@ -291,6 +310,7 @@ public class SocketChannelStreams {
      * Test read when another thread is blocked in write. The read should
      * block until bytes are available.
      */
+    @Test
     public void testConcurrentReadWrite2() throws Exception {
         withConnection((sc, peer) -> {
             InputStream in = Channels.newInputStream(sc);
@@ -308,13 +328,14 @@ public class SocketChannelStreams {
             // test read, should not be blocked by writer thread
             scheduleWrite(peer, 99, 500);
             int n = in.read();
-            assertEquals(n, 99);
+            assertEquals(99, n);
         });
     }
 
     /**
      * Test writing when another thread is blocked in read.
      */
+    @Test
     public void testConcurrentReadWrite3() throws Exception {
         withConnection((sc, peer) -> {
             InputStream in = Channels.newInputStream(sc);
@@ -329,74 +350,79 @@ public class SocketChannelStreams {
             // test write, should not be blocked by reader thread
             out.write(99);
             int n = read(peer);
-            assertEquals(n, 99);
+            assertEquals(99, n);
         });
     }
 
     /**
      * Test read/write when channel configured non-blocking.
      */
+    @Test
     public void testIllegalBlockingMode() throws Exception {
         withConnection((sc, peer) -> {
             InputStream in = Channels.newInputStream(sc);
             OutputStream out = Channels.newOutputStream(sc);
 
             sc.configureBlocking(false);
-            expectThrows(IllegalBlockingModeException.class, () -> in.read());
-            expectThrows(IllegalBlockingModeException.class, () -> out.write(99));
+            assertThrows(IllegalBlockingModeException.class, () -> in.read());
+            assertThrows(IllegalBlockingModeException.class, () -> out.write(99));
         });
     }
 
     /**
      * Test NullPointerException.
      */
+    @Test
     public void testNullPointerException() throws Exception {
         withConnection((sc, peer) -> {
             InputStream in = Channels.newInputStream(sc);
             OutputStream out = Channels.newOutputStream(sc);
 
-            expectThrows(NullPointerException.class, () -> in.read(null));
-            expectThrows(NullPointerException.class, () -> in.read(null, 0, 0));
+            assertThrows(NullPointerException.class, () -> in.read(null));
+            assertThrows(NullPointerException.class, () -> in.read(null, 0, 0));
 
-            expectThrows(NullPointerException.class, () -> out.write(null));
-            expectThrows(NullPointerException.class, () -> out.write(null, 0, 0));
+            assertThrows(NullPointerException.class, () -> out.write(null));
+            assertThrows(NullPointerException.class, () -> out.write(null, 0, 0));
         });
     }
 
     /**
      * Test IndexOutOfBoundsException.
      */
+    @Test
     public void testIndexOutOfBoundsException() throws Exception {
         withConnection((sc, peer) -> {
             InputStream in = Channels.newInputStream(sc);
             OutputStream out = Channels.newOutputStream(sc);
             byte[] ba = new byte[100];
 
-            expectThrows(IndexOutOfBoundsException.class, () -> in.read(ba, -1, 1));
-            expectThrows(IndexOutOfBoundsException.class, () -> in.read(ba, 0, -1));
-            expectThrows(IndexOutOfBoundsException.class, () -> in.read(ba, 0, 1000));
-            expectThrows(IndexOutOfBoundsException.class, () -> in.read(ba, 1, 100));
+            assertThrows(IndexOutOfBoundsException.class, () -> in.read(ba, -1, 1));
+            assertThrows(IndexOutOfBoundsException.class, () -> in.read(ba, 0, -1));
+            assertThrows(IndexOutOfBoundsException.class, () -> in.read(ba, 0, 1000));
+            assertThrows(IndexOutOfBoundsException.class, () -> in.read(ba, 1, 100));
 
-            expectThrows(IndexOutOfBoundsException.class, () -> out.write(ba, -1, 1));
-            expectThrows(IndexOutOfBoundsException.class, () -> out.write(ba, 0, -1));
-            expectThrows(IndexOutOfBoundsException.class, () -> out.write(ba, 0, 1000));
-            expectThrows(IndexOutOfBoundsException.class, () -> out.write(ba, 1, 100));
+            assertThrows(IndexOutOfBoundsException.class, () -> out.write(ba, -1, 1));
+            assertThrows(IndexOutOfBoundsException.class, () -> out.write(ba, 0, -1));
+            assertThrows(IndexOutOfBoundsException.class, () -> out.write(ba, 0, 1000));
+            assertThrows(IndexOutOfBoundsException.class, () -> out.write(ba, 1, 100));
         });
     }
 
     /**
      * Test that internal buffers have at most MAX_BUFFER_SIZE bytes remaining.
      */
+    @Test
     public void testReadLimit() throws IOException {
         InputStream in = Channels.newInputStream(new TestChannel());
         byte[] b = new byte[3*MAX_BUFFER_SIZE];
         int n = in.read(b, 0, b.length);
-        assertEquals(n, MAX_BUFFER_SIZE);
+        assertEquals(MAX_BUFFER_SIZE, n);
     }
 
     /**
      * Test that internal buffers have at most MAX_BUFFER_SIZE bytes remaining.
      */
+    @Test
     public void testWriteLimit() throws IOException {
         OutputStream out = Channels.newOutputStream(new TestChannel());
         byte[] b = new byte[3*MAX_BUFFER_SIZE];
diff --git a/test/jdk/java/nio/channels/Channels/TransferTo.java b/test/jdk/java/nio/channels/Channels/TransferTo.java
index b02bf7b3649..a9626978dbe 100644
--- a/test/jdk/java/nio/channels/Channels/TransferTo.java
+++ b/test/jdk/java/nio/channels/Channels/TransferTo.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2021, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2021, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -37,17 +37,20 @@ import java.nio.file.Path;
 import java.util.concurrent.CompletableFuture;
 import java.util.concurrent.ExecutionException;
 import java.util.concurrent.Future;
+import java.util.stream.Stream;
 
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
+import org.junit.jupiter.api.Test;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.Arguments;
+import org.junit.jupiter.params.provider.MethodSource;
 
-import static org.testng.Assert.assertThrows;
+import static org.junit.jupiter.api.Assertions.assertThrows;
 
 /*
  * @test
  * @library /test/lib
  * @build jdk.test.lib.RandomFactory
- * @run testng/othervm/timeout=720 TransferTo
+ * @run junit/othervm/timeout=720 TransferTo
  * @bug 8265891
  * @summary Tests whether sun.nio.ChannelInputStream.transferTo conforms to the
  *          InputStream.transferTo specification
@@ -59,41 +62,37 @@ public class TransferTo extends TransferToBase {
      * Provides test scenarios, i.e., combinations of input and output streams
      * to be tested.
      */
-    @DataProvider
-    public static Object[][] streamCombinations() {
-        return new Object[][] {
-            // tests FileChannel.transferTo(FileChannel) optimized case
-            {fileChannelInput(), fileChannelOutput()},
+    public static Stream<Arguments> streamCombinations() {
+        return Stream.of
+            (// tests FileChannel.transferTo(FileChannel) optimized case
+             Arguments.of(fileChannelInput(), fileChannelOutput()),
 
-            // tests FileChannel.transferTo(SelectableChannelOutput)
-            // optimized case
-            {fileChannelInput(), selectableChannelOutput()},
+             // tests FileChannel.transferTo(SelectableChannelOutput)
+             // optimized case
+             Arguments.of(fileChannelInput(), selectableChannelOutput()),
 
-            // tests FileChannel.transferTo(WritableByteChannelOutput)
-            // optimized case
-            {fileChannelInput(), writableByteChannelOutput()},
+             // tests FileChannel.transferTo(WritableByteChannelOutput)
+             // optimized case
+             Arguments.of(fileChannelInput(), writableByteChannelOutput()),
 
-            // tests InputStream.transferTo(OutputStream) default case
-            {readableByteChannelInput(), defaultOutput()}
-        };
+             // tests InputStream.transferTo(OutputStream) default case
+             Arguments.of(readableByteChannelInput(), defaultOutput()));
     }
 
     /*
      * Input streams to be tested.
      */
-    @DataProvider
-    public static Object[][] inputStreamProviders() {
-        return new Object[][] {
-                {fileChannelInput()},
-                {readableByteChannelInput()}
-        };
+    public static Stream<Arguments> inputStreamProviders() {
+        return Stream.of(Arguments.of(fileChannelInput()),
+                         Arguments.of(readableByteChannelInput()));
     }
 
     /*
      * Testing API compliance: input stream must throw NullPointerException
      * when parameter "out" is null.
      */
-    @Test(dataProvider = "inputStreamProviders")
+    @ParameterizedTest
+    @MethodSource("inputStreamProviders")
     public void testNullPointerException(InputStreamProvider inputStreamProvider) {
         assertNullPointerException(inputStreamProvider);
     }
@@ -102,7 +101,8 @@ public class TransferTo extends TransferToBase {
      * Testing API compliance: complete content of input stream must be
      * transferred to output stream.
      */
-    @Test(dataProvider = "streamCombinations")
+    @ParameterizedTest
+    @MethodSource("streamCombinations")
     public void testStreamContents(InputStreamProvider inputStreamProvider,
             OutputStreamProvider outputStreamProvider) throws Exception {
         assertStreamContents(inputStreamProvider, outputStreamProvider);
diff --git a/test/jdk/java/nio/channels/Channels/TransferTo2.java b/test/jdk/java/nio/channels/Channels/TransferTo2.java
index bd7e13c3a9b..0e02803c8d3 100644
--- a/test/jdk/java/nio/channels/Channels/TransferTo2.java
+++ b/test/jdk/java/nio/channels/Channels/TransferTo2.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2021, 2023, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2021, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,9 +25,11 @@ import java.io.OutputStream;
 import java.io.IOException;
 import java.nio.channels.Channels;
 import java.nio.channels.Pipe;
+import java.util.stream.Stream;
 
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.Arguments;
+import org.junit.jupiter.params.provider.MethodSource;
 
 import static java.lang.String.format;
 
@@ -35,7 +37,7 @@ import static java.lang.String.format;
  * @test
  * @library /test/lib
  * @build jdk.test.lib.RandomFactory
- * @run testng/othervm/timeout=180 TransferTo2
+ * @run junit/othervm/timeout=180 TransferTo2
  * @bug 8278268
  * @summary Tests FileChannel.transferFrom() optimized case
  * @key randomness
@@ -46,33 +48,29 @@ public class TransferTo2 extends TransferToBase {
      * Provides test scenarios, i.e., combinations of input and output streams
      * to be tested.
      */
-    @DataProvider
-    public static Object[][] streamCombinations() {
-        return new Object[][] {
-            // tests FileChannel.transferFrom(SelectableChannelOutput) optimized case
-            {selectableChannelInput(), fileChannelOutput()},
+    public static Stream<Arguments> streamCombinations() {
+        return Stream.of
+            (// tests FileChannel.transferFrom(SelectableChannelOutput) optimized case
+             Arguments.of(selectableChannelInput(), fileChannelOutput()),
 
-            // tests FileChannel.transferFrom(ReadableByteChannelInput) optimized case
-            {readableByteChannelInput(), fileChannelOutput()},
-        };
+             // tests FileChannel.transferFrom(ReadableByteChannelInput) optimized case
+             Arguments.of(readableByteChannelInput(), fileChannelOutput()));
     }
 
     /*
      * Input streams to be tested.
      */
-    @DataProvider
-    public static Object[][] inputStreamProviders() {
-        return new Object[][] {
-            {selectableChannelInput()},
-            {readableByteChannelInput()}
-        };
+    public static Stream<Arguments> inputStreamProviders() {
+        return Stream.of(Arguments.of(selectableChannelInput()),
+                         Arguments.of(readableByteChannelInput()));
     }
 
     /*
      * Testing API compliance: input stream must throw NullPointerException
      * when parameter "out" is null.
      */
-    @Test(dataProvider = "inputStreamProviders")
+    @ParameterizedTest
+    @MethodSource("inputStreamProviders")
     public void testNullPointerException(InputStreamProvider inputStreamProvider) {
         assertNullPointerException(inputStreamProvider);
     }
@@ -81,7 +79,8 @@ public class TransferTo2 extends TransferToBase {
      * Testing API compliance: complete content of input stream must be
      * transferred to output stream.
      */
-    @Test(dataProvider = "streamCombinations")
+    @ParameterizedTest
+    @MethodSource("streamCombinations")
     public void testStreamContents(InputStreamProvider inputStreamProvider,
             OutputStreamProvider outputStreamProvider) throws Exception {
         assertStreamContents(inputStreamProvider, outputStreamProvider);
diff --git a/test/jdk/java/nio/channels/Channels/TransferToBase.java b/test/jdk/java/nio/channels/Channels/TransferToBase.java
index 53ca283ae78..482fb1f262c 100644
--- a/test/jdk/java/nio/channels/Channels/TransferToBase.java
+++ b/test/jdk/java/nio/channels/Channels/TransferToBase.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2021, 2023, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2021, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -43,9 +43,9 @@ import jdk.test.lib.RandomFactory;
 import static java.lang.String.format;
 import static java.nio.file.StandardOpenOption.*;
 
-import static org.testng.Assert.assertEquals;
-import static org.testng.Assert.assertThrows;
-import static org.testng.Assert.assertTrue;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertThrows;
+import static org.junit.jupiter.api.Assertions.assertTrue;
 
 class TransferToBase {
     static final int MIN_SIZE      = 10_000;
@@ -88,7 +88,7 @@ class TransferToBase {
             long reported = in.transferTo(out);
             int count = inBytes.length - posIn;
 
-            assertEquals(reported, count, format("reported %d bytes but should report %d", reported, count));
+            assertEquals(count, reported);
 
             byte[] outBytes = recorder.get().get();
             assertTrue(Arrays.equals(inBytes, posIn, posIn + count, outBytes, posOut, posOut + count),
@@ -238,11 +238,11 @@ class TransferToBase {
 
                     // compare reported transferred bytes, must be 3 GB
                     // less the value of the initial position
-                    assertEquals(count, BYTES_WRITTEN - initPos);
+                    assertEquals(BYTES_WRITTEN - initPos, count);
                 }
 
                 // compare content of both files, failing if different
-                assertEquals(Files.mismatch(sourceFile, targetFile), -1);
+                assertEquals(-1, Files.mismatch(sourceFile, targetFile));
 
             } finally {
                  Files.delete(targetFile);
diff --git a/test/jdk/java/nio/channels/Channels/TransferTo_2GB_transferFrom.java b/test/jdk/java/nio/channels/Channels/TransferTo_2GB_transferFrom.java
index f57d6cca963..1dc17f6f5fc 100644
--- a/test/jdk/java/nio/channels/Channels/TransferTo_2GB_transferFrom.java
+++ b/test/jdk/java/nio/channels/Channels/TransferTo_2GB_transferFrom.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2021, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2021, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -30,13 +30,13 @@ import java.nio.file.Files;
 
 import static java.nio.file.StandardOpenOption.*;
 
-import org.testng.annotations.Test;
+import org.junit.jupiter.api.Test;
 
 /*
  * @test
  * @library /test/lib
  * @build jdk.test.lib.RandomFactory
- * @run testng/othervm/timeout=720 TransferTo_2GB_transferFrom
+ * @run junit/othervm/timeout=720 TransferTo_2GB_transferFrom
  * @bug 8278268
  * @summary Tests if ChannelInputStream.transferFrom correctly
  *     transfers 2GB+ using FileChannel.transferFrom(ReadableByteChannel).
diff --git a/test/jdk/java/nio/channels/Channels/TransferTo_2GB_transferTo.java b/test/jdk/java/nio/channels/Channels/TransferTo_2GB_transferTo.java
index fdd3bddb126..174b89bd988 100644
--- a/test/jdk/java/nio/channels/Channels/TransferTo_2GB_transferTo.java
+++ b/test/jdk/java/nio/channels/Channels/TransferTo_2GB_transferTo.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2021, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2021, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -29,13 +29,13 @@ import java.nio.file.Files;
 
 import static java.nio.file.StandardOpenOption.*;
 
-import org.testng.annotations.Test;
+import org.junit.jupiter.api.Test;
 
 /*
  * @test
  * @library /test/lib
  * @build jdk.test.lib.RandomFactory
- * @run testng/othervm/timeout=720 TransferTo_2GB_transferTo
+ * @run junit/othervm/timeout=720 TransferTo_2GB_transferTo
  * @bug 8265891
  * @summary Tests if ChannelInputStream.transferTo correctly
  *     transfers 2GB+ using FileChannel.transferTo(WritableByteChannel).

From 93634b5665c97c321294623627f542c264f63dc5 Mon Sep 17 00:00:00 2001
From: Brian Burkhalter <bpb@openjdk.org>
Date: Mon, 9 Mar 2026 18:06:35 +0000
Subject: [PATCH 110/655] 8379153: Refactor
 java/nio/channels/File{Channel,Lock} TestNG tests to use JUnit

Reviewed-by: alanb, dfuchs
---
 .../FileChannel/MapToMemorySegmentTest.java   | 17 ++---
 .../nio/channels/FileChannel/Transfer.java    | 63 ++++++++---------
 .../channels/FileChannel/Transfer4GBFile.java | 20 +++---
 .../FileChannel/TransferTo6GBFile.java        | 16 +++--
 .../java/nio/channels/FileLock/Overlaps.java  | 70 ++++++++++---------
 5 files changed, 91 insertions(+), 95 deletions(-)

diff --git a/test/jdk/java/nio/channels/FileChannel/MapToMemorySegmentTest.java b/test/jdk/java/nio/channels/FileChannel/MapToMemorySegmentTest.java
index de89e318fc3..bd2097176ca 100644
--- a/test/jdk/java/nio/channels/FileChannel/MapToMemorySegmentTest.java
+++ b/test/jdk/java/nio/channels/FileChannel/MapToMemorySegmentTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2022, 2023, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2022, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -24,7 +24,7 @@
 /* @test
  * @bug 8281412
  * @summary Test FileChannel::map to MemorySegment with custom file channel
- * @run testng/othervm MapToMemorySegmentTest
+ * @run junit/othervm MapToMemorySegmentTest
  */
 
 import java.io.File;
@@ -39,10 +39,10 @@ import java.nio.channels.ReadableByteChannel;
 import java.nio.channels.WritableByteChannel;
 import java.nio.file.Path;
 import java.nio.file.StandardOpenOption;
-import org.testng.annotations.Test;
 
-import static org.testng.Assert.assertTrue;
-import static org.testng.Assert.fail;
+import org.junit.jupiter.api.Test;
+
+import static org.junit.jupiter.api.Assertions.assertThrows;
 
 public class MapToMemorySegmentTest {
 
@@ -58,13 +58,14 @@ public class MapToMemorySegmentTest {
         }
     }
 
-    @Test(expectedExceptions = UnsupportedOperationException.class)
+    @Test
     public void testCustomFileChannel() throws IOException {
         var arena = Arena.ofConfined();
         var fc = FileChannel.open(tempPath, StandardOpenOption.WRITE, StandardOpenOption.READ);
         var fileChannel = new CustomFileChannel(fc);
-        try (arena; fileChannel){
-            fileChannel.map(FileChannel.MapMode.READ_WRITE, 1L, 10L, arena);
+        try (arena; fileChannel) {
+            assertThrows(UnsupportedOperationException.class,
+                         () -> fileChannel.map(FileChannel.MapMode.READ_WRITE, 1L, 10L, arena));
         }
     }
 
diff --git a/test/jdk/java/nio/channels/FileChannel/Transfer.java b/test/jdk/java/nio/channels/FileChannel/Transfer.java
index 51adba60b06..1afc38a61bd 100644
--- a/test/jdk/java/nio/channels/FileChannel/Transfer.java
+++ b/test/jdk/java/nio/channels/FileChannel/Transfer.java
@@ -27,7 +27,7 @@
  * @library ..
  * @library /test/lib
  * @build jdk.test.lib.RandomFactory
- * @run testng/timeout=300 Transfer
+ * @run junit/timeout=300 Transfer
  * @key randomness
  */
 
@@ -54,8 +54,13 @@ import java.util.concurrent.TimeUnit;
 
 import jdk.test.lib.RandomFactory;
 
-import org.testng.Assert;
-import org.testng.annotations.Test;
+import org.junit.jupiter.api.Test;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertFalse;
+import static org.junit.jupiter.api.Assertions.assertNotEquals;
+import static org.junit.jupiter.api.Assertions.assertThrows;
+import static org.junit.jupiter.api.Assertions.assertTrue;
 
 public class Transfer {
 
@@ -83,25 +88,22 @@ public class Transfer {
         long oldSourcePosition = sourceChannel.position();
 
         long bytesWritten = sinkChannel.transferFrom(sourceChannel, 0, 10);
-        if (bytesWritten != 10)
-            throw new RuntimeException("Transfer failed");
+        assertEquals(10, bytesWritten, "Transfer failed");
 
-        if (sourceChannel.position() == oldSourcePosition)
-            throw new RuntimeException("Source position didn't change");
+        assertNotEquals(oldSourcePosition, sourceChannel.position(),
+                        "Source position didn't change");
 
-        if (sinkChannel.position() != oldSinkPosition)
-            throw new RuntimeException("Sink position changed");
+        assertEquals(oldSinkPosition, sinkChannel.position(),
+                     "Sink position changed");
 
-        if (sinkChannel.size() != 10)
-            throw new RuntimeException("Unexpected sink size");
+        assertEquals(10, sinkChannel.size(), "Unexpected sink size");
 
         bytesWritten = sinkChannel.transferFrom(sourceChannel, 1000, 10);
 
-        if (bytesWritten > 10)
-            throw new RuntimeException("Wrote too many bytes");
+        assertFalse(bytesWritten > 10, "Wrote too many bytes");
 
-        if (sinkChannel.size() != 1000 + bytesWritten)
-            throw new RuntimeException("Unexpected sink size");
+        assertEquals(1000 + bytesWritten, sinkChannel.size(),
+                     "Unexpected sink size");
 
         sourceChannel.close();
         sinkChannel.close();
@@ -130,8 +132,7 @@ public class Transfer {
             int totalWritten = 0;
             while (totalWritten < size + 10) {
                 int written = sink.write(outgoingdata);
-                if (written < 0)
-                    throw new Exception("Write failed");
+                assertTrue(written >= 0, "Write failed");
                 totalWritten += written;
             }
 
@@ -143,14 +144,11 @@ public class Transfer {
 
             long bytesWritten = fc.transferFrom(source, 0, size);
             fc.force(true);
-            if (bytesWritten != size)
-                throw new RuntimeException("Transfer failed");
+            assertEquals(size, bytesWritten, "Transfer failed");
 
-            if (fc.position() != oldPosition)
-                throw new RuntimeException("Position changed");
+            assertEquals(oldPosition, fc.position(), "Position changed");
 
-            if (fc.size() != size)
-                throw new RuntimeException("Unexpected sink size "+ fc.size());
+            assertEquals(size, fc.size(), "Unexpected sink size "+ fc.size());
 
             fc.close();
             sink.close();
@@ -168,7 +166,7 @@ public class Transfer {
         CharSequence csq = "Reality is greater than the sum of its parts.";
         Files.writeString(source.toPath(), csq);
         final long length = csq.length();
-        Assert.assertEquals(source.length(), length);
+        assertEquals(length, source.length());
 
         File target = File.createTempFile("before", "after");
         target.deleteOnExit();
@@ -183,7 +181,7 @@ public class Transfer {
             long n = chSource.transferTo(length, 16385, chTarget);
 
             // At the end of the input so no bytes should be transferred
-            Assert.assertEquals(n, 0);
+            assertEquals(0, n);
         }
     }
 
@@ -251,8 +249,7 @@ public class Transfer {
 
         fc1.transferTo(0, srcData.length + 1, fc2);
 
-        if (fc2.size() > 4)
-            throw new Exception("xferTest03 failed");
+        assertFalse(fc2.size() > 4, "xferTest03 failed");
 
         fc1.close();
         fc2.close();
@@ -273,9 +270,7 @@ public class Transfer {
         while ((c = r.read()) != -1)
             sb.append((char)c);
         String contents = sb.toString();
-        if (! contents.equals(expected))
-            throw new Exception("expected: " + expected
-                                + ", got: " + contents);
+        assertEquals(expected, contents);
         r.close();
     }
 
@@ -301,8 +296,7 @@ public class Transfer {
             new RandomAccessFile(sink, "rw").getChannel();
         long n = sinkChannel.transferFrom(sourceChannel, 0L,
                                           sourceChannel.size()); // overflow
-        if (n != remaining)
-            throw new Exception("n == " + n + ", remaining == " + remaining);
+        assertEquals(remaining, n);
 
         sinkChannel.close();
         sourceChannel.close();
@@ -363,9 +357,8 @@ public class Transfer {
         FileChannel fc1 = new FileOutputStream(source).getChannel();
         FileChannel fc2 = new RandomAccessFile(target, "rw").getChannel();
         try {
-            fc2.transferFrom(fc1, 0L, 0);
-            throw new RuntimeException("NonReadableChannelException expected");
-        } catch (NonReadableChannelException expected) {
+            assertThrows(NonReadableChannelException.class,
+                         () -> fc2.transferFrom(fc1, 0L, 0));
         } finally {
             fc1.close();
             fc2.close();
diff --git a/test/jdk/java/nio/channels/FileChannel/Transfer4GBFile.java b/test/jdk/java/nio/channels/FileChannel/Transfer4GBFile.java
index b8c026c983c..0766f4ffb45 100644
--- a/test/jdk/java/nio/channels/FileChannel/Transfer4GBFile.java
+++ b/test/jdk/java/nio/channels/FileChannel/Transfer4GBFile.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2001, 2022, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2001, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,7 +25,7 @@
  * @bug 4638365
  * @summary Test FileChannel.transferFrom and transferTo for 4GB files
  * @build FileChannelUtils
- * @run testng/timeout=300 Transfer4GBFile
+ * @run junit/timeout=300 Transfer4GBFile
  */
 
 import java.io.BufferedWriter;
@@ -38,10 +38,12 @@ import java.nio.file.Files;
 import java.nio.file.Path;
 import java.util.concurrent.TimeUnit;
 
-import org.testng.annotations.Test;
+import org.junit.jupiter.api.Test;
 
 import static java.nio.file.StandardOpenOption.*;
 
+import static org.junit.jupiter.api.Assertions.assertEquals;
+
 public class Transfer4GBFile {
 
     private static PrintStream err = System.err;
@@ -71,10 +73,8 @@ public class Transfer4GBFile {
 
             long bytesWritten = sourceChannel.transferTo(testSize - 40, 10,
                     sinkChannel);
-            if (bytesWritten != 10) {
-                throw new RuntimeException("Transfer test 4 failed " +
-                        bytesWritten);
-            }
+            assertEquals(10, bytesWritten,
+                         "Transfer test 4 failed " + bytesWritten);
         }
 
         Files.delete(source);
@@ -112,10 +112,8 @@ public class Transfer4GBFile {
              FileChannel sinkChannel = FileChannel.open(sink, WRITE)) {
             long bytesWritten = sinkChannel.transferFrom(sourceChannel,
                     testSize - 40, 10);
-            if (bytesWritten != 10) {
-                throw new RuntimeException("Transfer test 5 failed " +
-                        bytesWritten);
-            }
+            assertEquals(10, bytesWritten,
+                         "Transfer test 5 failed " + bytesWritten);
         }
 
         Files.delete(source);
diff --git a/test/jdk/java/nio/channels/FileChannel/TransferTo6GBFile.java b/test/jdk/java/nio/channels/FileChannel/TransferTo6GBFile.java
index 9ca6df0c870..791a0718a75 100644
--- a/test/jdk/java/nio/channels/FileChannel/TransferTo6GBFile.java
+++ b/test/jdk/java/nio/channels/FileChannel/TransferTo6GBFile.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2001, 2022, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2001, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,7 +25,7 @@
  * @bug 6253145
  * @summary Test FileChannel.transferTo with file positions up to 8GB
  * @build FileChannelUtils
- * @run testng/timeout=300 TransferTo6GBFile
+ * @run junit/timeout=300 TransferTo6GBFile
  */
 
 import java.io.IOException;
@@ -40,10 +40,14 @@ import java.nio.file.Files;
 import java.nio.file.Path;
 import java.util.concurrent.TimeUnit;
 
-import org.testng.annotations.Test;
+import org.junit.jupiter.api.Test;
 
 import static java.nio.file.StandardOpenOption.*;
 
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertFalse;
+import static org.junit.jupiter.api.Assertions.assertTrue;
+
 public class TransferTo6GBFile {
 
     private static PrintStream err = System.err;
@@ -126,16 +130,14 @@ public class TransferTo6GBFile {
                     long nread = 0;
                     while (nread < count) {
                         int n = source.read(readbuf);
-                        if (n < 0)
-                            throw new RuntimeException("Premature EOF!");
+                        assertTrue(n >= 0, "Premature EOF!");
                         nread += n;
                     }
 
                     // check reply from echo server
                     readbuf.flip();
                     sendbuf.flip();
-                    if (!readbuf.equals(sendbuf))
-                        throw new RuntimeException("Echoed bytes do not match!");
+                    assertEquals(sendbuf, readbuf, "Echoed bytes do not match!");
                     readbuf.clear();
                     sendbuf.clear();
                 }
diff --git a/test/jdk/java/nio/channels/FileLock/Overlaps.java b/test/jdk/java/nio/channels/FileLock/Overlaps.java
index 64293e2996d..3e3b92ac67e 100644
--- a/test/jdk/java/nio/channels/FileLock/Overlaps.java
+++ b/test/jdk/java/nio/channels/FileLock/Overlaps.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2022, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2022, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,7 +25,7 @@
  * @test
  * @bug 5041655
  * @summary Verify FileLock.overlaps
- * @run testng Overlaps
+ * @run junit Overlaps
  */
 import java.io.IOException;
 import java.nio.ByteBuffer;
@@ -33,15 +33,18 @@ import java.nio.channels.FileChannel;
 import java.nio.channels.FileLock;
 import java.nio.file.Files;
 import java.nio.file.Path;
+import java.util.stream.Stream;
 
 import static java.lang.Boolean.*;
 import static java.nio.file.StandardOpenOption.*;
 
-import static org.testng.Assert.assertEquals;
-import org.testng.annotations.AfterClass;
-import org.testng.annotations.BeforeClass;
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
+import org.junit.jupiter.api.AfterAll;
+import org.junit.jupiter.api.BeforeAll;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.Arguments;
+import org.junit.jupiter.params.provider.MethodSource;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
 
 public class Overlaps {
     private static final long POS = 27;
@@ -49,47 +52,46 @@ public class Overlaps {
 
     private static FileChannel fc;
 
-    @BeforeClass
-    public void before() throws IOException {
+    @BeforeAll
+    public static void before() throws IOException {
         Path path = Files.createTempFile(Path.of("."), "foo", ".bar");
         fc = FileChannel.open(path, CREATE, WRITE, DELETE_ON_CLOSE);
         fc.position(POS);
         fc.write(ByteBuffer.wrap(new byte[(int)SIZE]));
     }
 
-    @AfterClass
-    public void after() throws IOException {
+    @AfterAll
+    public static void after() throws IOException {
         fc.close();
     }
 
-    @DataProvider
-    public Object[][] ranges() {
-        return new Object[][] {
-            {POS, SIZE, -1,-1, FALSE},
-            {POS, SIZE, 0, -1, FALSE},
-            {POS, SIZE, POS - 1, -1, FALSE},
-            {POS, SIZE, POS + SIZE/2, -1, FALSE},
-            {POS, SIZE, POS + SIZE, -1, FALSE},
-            {POS, SIZE, -1, POS, FALSE},
-            {POS, SIZE, -1, POS + SIZE/2, TRUE},
-            {POS, SIZE, POS - 2, 1, FALSE},
-            {POS, SIZE, POS + 1, 1, TRUE},
-            {POS, SIZE, POS + SIZE/2, 0, TRUE},
-            {POS, SIZE, Long.MAX_VALUE, 2, FALSE},
-            {POS, SIZE, POS + SIZE / 2, Long.MAX_VALUE, TRUE},
-            {POS, SIZE, 0, 0, TRUE},
-            {Long.MAX_VALUE - SIZE/2, 0, 0, SIZE, FALSE},
-            {Long.MAX_VALUE - SIZE/2, 0, Long.MAX_VALUE - SIZE/4, SIZE, TRUE},
-            {Long.MAX_VALUE - SIZE/2, 0, Long.MAX_VALUE - SIZE, 0, TRUE},
-            {Long.MAX_VALUE - SIZE, 0, Long.MAX_VALUE - SIZE/2, 0, TRUE}
-        };
+    public static Stream<Arguments> ranges() {
+        return Stream.of(
+            Arguments.of(POS, SIZE, -1, -1, FALSE),
+            Arguments.of(POS, SIZE, 0, -1, FALSE),
+            Arguments.of(POS, SIZE, POS - 1, -1, FALSE),
+            Arguments.of(POS, SIZE, POS + SIZE/2, -1, FALSE),
+            Arguments.of(POS, SIZE, POS + SIZE, -1, FALSE),
+            Arguments.of(POS, SIZE, -1, POS, FALSE),
+            Arguments.of(POS, SIZE, -1, POS + SIZE/2, TRUE),
+            Arguments.of(POS, SIZE, POS - 2, 1, FALSE),
+            Arguments.of(POS, SIZE, POS + 1, 1, TRUE),
+            Arguments.of(POS, SIZE, POS + SIZE/2, 0, TRUE),
+            Arguments.of(POS, SIZE, Long.MAX_VALUE, 2, FALSE),
+            Arguments.of(POS, SIZE, POS + SIZE / 2, Long.MAX_VALUE, TRUE),
+            Arguments.of(POS, SIZE, 0, 0, TRUE),
+            Arguments.of(Long.MAX_VALUE - SIZE/2, 0, 0, SIZE, FALSE),
+            Arguments.of(Long.MAX_VALUE - SIZE/2, 0, Long.MAX_VALUE - SIZE/4, SIZE, TRUE),
+            Arguments.of(Long.MAX_VALUE - SIZE/2, 0, Long.MAX_VALUE - SIZE, 0, TRUE),
+            Arguments.of(Long.MAX_VALUE - SIZE, 0, Long.MAX_VALUE - SIZE/2, 0, TRUE));
     }
 
-    @Test(dataProvider = "ranges")
+    @ParameterizedTest
+    @MethodSource("ranges")
     public void overlaps(long lockPos, long lockSize, long pos, long size,
         boolean overlaps) throws IOException {
         try (FileLock lock = fc.lock(lockPos, lockSize, false)) {
-            assertEquals(lock.overlaps(pos, size), overlaps);
+            assertEquals(overlaps, lock.overlaps(pos, size));
         }
     }
 }

From a95799d62fc0ec8e8fcdfd62813273c6896845ef Mon Sep 17 00:00:00 2001
From: Phil Race <prr@openjdk.org>
Date: Mon, 9 Mar 2026 19:32:47 +0000
Subject: [PATCH 111/655] 8379229: Remove AppContext from
 javax.swing.JComponent

Reviewed-by: psadhukhan, serb
---
 .../share/classes/javax/swing/JComponent.java |  62 ++++-------
 .../awt/dnd/BadSerializationTest/badAction    | Bin 3651 -> 3651 bytes
 .../java/awt/dnd/BadSerializationTest/good    | Bin 3457 -> 3651 bytes
 .../awt/dnd/BadSerializationTest/noEvents     | Bin 3160 -> 3160 bytes
 .../dnd/BadSerializationTest/nullComponent    | Bin 3470 -> 3470 bytes
 .../dnd/BadSerializationTest/nullDragSource   | Bin 3609 -> 3609 bytes
 .../awt/dnd/BadSerializationTest/nullOrigin   | Bin 3605 -> 3605 bytes
 .../swing/JComponent/8043610/bug8043610.java  | 102 ------------------
 8 files changed, 19 insertions(+), 145 deletions(-)
 delete mode 100644 test/jdk/javax/swing/JComponent/8043610/bug8043610.java

diff --git a/src/java.desktop/share/classes/javax/swing/JComponent.java b/src/java.desktop/share/classes/javax/swing/JComponent.java
index 6351522ab49..87d6a41c2b0 100644
--- a/src/java.desktop/share/classes/javax/swing/JComponent.java
+++ b/src/java.desktop/share/classes/javax/swing/JComponent.java
@@ -31,6 +31,7 @@ import java.awt.Color;
 import java.awt.Component;
 import java.awt.Container;
 import java.awt.Dimension;
+import java.awt.EventQueue;
 import java.awt.FocusTraversalPolicy;
 import java.awt.Font;
 import java.awt.FontMetrics;
@@ -261,16 +262,6 @@ public abstract class JComponent extends Container implements Serializable,
      */
     static boolean DEBUG_GRAPHICS_LOADED;
 
-    /**
-     * Key used to look up a value from the AppContext to determine the
-     * JComponent the InputVerifier is running for. That is, if
-     * AppContext.get(INPUT_VERIFIER_SOURCE_KEY) returns non-null, it
-     * indicates the EDT is calling into the InputVerifier from the
-     * returned component.
-     */
-    private static final Object INPUT_VERIFIER_SOURCE_KEY =
-            new StringBuilder("InputVerifierSourceKey");
-
     /* The following fields support set methods for the corresponding
      * java.awt.Component properties.
      */
@@ -414,8 +405,7 @@ public abstract class JComponent extends Container implements Serializable,
     /** ActionMap. */
     private ActionMap actionMap;
 
-    /** Key used to store the default locale in an AppContext **/
-    private static final String defaultLocale = "JComponent.defaultLocale";
+    private static volatile Locale defaultLocale;
 
     private static Component componentObtainingGraphicsFrom;
     private static Object componentObtainingGraphicsFromLock = new
@@ -2841,12 +2831,12 @@ public abstract class JComponent extends Container implements Serializable,
      * @since 1.4
      */
     public static Locale getDefaultLocale() {
-        Locale l = (Locale) SwingUtilities.appContextGet(defaultLocale);
-        if( l == null ) {
+        Locale l = defaultLocale;
+        if (l == null) {
             //REMIND(bcb) choosing the default value is more complicated
             //than this.
             l = Locale.getDefault();
-            JComponent.setDefaultLocale( l );
+            JComponent.setDefaultLocale(l);
         }
         return l;
     }
@@ -2865,8 +2855,8 @@ public abstract class JComponent extends Container implements Serializable,
      * @see #setLocale
      * @since 1.4
      */
-    public static void setDefaultLocale( Locale l ) {
-        SwingUtilities.appContextPut(defaultLocale, l);
+    public static void setDefaultLocale(Locale l) {
+        defaultLocale = l;
     }
 
 
@@ -3507,7 +3497,7 @@ public abstract class JComponent extends Container implements Serializable,
 
 
     // This class is used by the KeyboardState class to provide a single
-    // instance that can be stored in the AppContext.
+    // instance.
     static final class IntVector {
         int[] array = null;
         int count = 0;
@@ -3538,24 +3528,12 @@ public abstract class JComponent extends Container implements Serializable,
         }
     }
 
+    private static final IntVector intVector = new IntVector();
     @SuppressWarnings("serial")
     static class KeyboardState implements Serializable {
-        private static final Object keyCodesKey =
-            JComponent.KeyboardState.class;
-
-        // Get the array of key codes from the AppContext.
-        static IntVector getKeyCodeArray() {
-            IntVector iv =
-                (IntVector)SwingUtilities.appContextGet(keyCodesKey);
-            if (iv == null) {
-                iv = new IntVector();
-                SwingUtilities.appContextPut(keyCodesKey, iv);
-            }
-            return iv;
-        }
 
         static void registerKeyPressed(int keyCode) {
-            IntVector kca = getKeyCodeArray();
+            IntVector kca = intVector;
             int count = kca.size();
             int i;
             for(i=0;i<count;i++) {
@@ -3568,7 +3546,7 @@ public abstract class JComponent extends Container implements Serializable,
         }
 
         static void registerKeyReleased(int keyCode) {
-            IntVector kca = getKeyCodeArray();
+            IntVector kca = intVector;
             int count = kca.size();
             int i;
             for(i=0;i<count;i++) {
@@ -3580,7 +3558,7 @@ public abstract class JComponent extends Container implements Serializable,
         }
 
         static boolean keyIsPressed(int keyCode) {
-            IntVector kca = getKeyCodeArray();
+            IntVector kca = intVector;
             int count = kca.size();
             int i;
             for(i=0;i<count;i++) {
@@ -3621,6 +3599,8 @@ public abstract class JComponent extends Container implements Serializable,
       }
     }
 
+    static JComponent ivSourceComponent; // accessed only on EDT.
+
     static final sun.awt.RequestFocusController focusController =
         new sun.awt.RequestFocusController() {
             public boolean acceptRequestFocus(Component from, Component to,
@@ -3644,15 +3624,13 @@ public abstract class JComponent extends Container implements Serializable,
                 if (iv == null) {
                     return true;
                 } else {
-                    Object currentSource = SwingUtilities.appContextGet(
-                            INPUT_VERIFIER_SOURCE_KEY);
+                    JComponent currentSource = ivSourceComponent;
                     if (currentSource == jFocusOwner) {
                         // We're currently calling into the InputVerifier
                         // for this component, so allow the focus change.
                         return true;
                     }
-                    SwingUtilities.appContextPut(INPUT_VERIFIER_SOURCE_KEY,
-                                                 jFocusOwner);
+                    ivSourceComponent = jFocusOwner;
                     try {
                         return iv.shouldYieldFocus(jFocusOwner, target);
                     } finally {
@@ -3662,11 +3640,9 @@ public abstract class JComponent extends Container implements Serializable,
                             // we ensure that if the InputVerifier for
                             // currentSource does a requestFocus, we don't
                             // try and run the InputVerifier again.
-                            SwingUtilities.appContextPut(
-                                INPUT_VERIFIER_SOURCE_KEY, currentSource);
+                            ivSourceComponent = currentSource;
                         } else {
-                            SwingUtilities.appContextRemove(
-                                INPUT_VERIFIER_SOURCE_KEY);
+                            ivSourceComponent = null;
                         }
                     }
                 }
@@ -4939,7 +4915,7 @@ public abstract class JComponent extends Container implements Serializable,
             // which was causing some people grief.
             return;
         }
-        if (SunToolkit.isDispatchThreadForAppContext(this)) {
+        if (EventQueue.isDispatchThread()) {
             invalidate();
             RepaintManager.currentManager(this).addInvalidComponent(this);
         }
diff --git a/test/jdk/java/awt/dnd/BadSerializationTest/badAction b/test/jdk/java/awt/dnd/BadSerializationTest/badAction
index c02632cabfd9b9b4536e17eff67c8551fe23cff2..4556c2e5b1f44c9b5aaca19ec4efafd1704aab81 100644
GIT binary patch
delta 29
lcmX>sb692r8zYBi{;A-#hYyx*=3{i{WC{)59M1KI833h=3Yh=^

delta 29
lcmX>sb692r8zYDP+TDi)e`ihJ%*W`?$rKd2Ih^YaGXSW13a$VE

diff --git a/test/jdk/java/awt/dnd/BadSerializationTest/good b/test/jdk/java/awt/dnd/BadSerializationTest/good
index 523df353a1aad149c7110bb0c45d509c9a55d5cb..f5dd0e2cb5bd8cd009c2023c1b66bffdde19f74e 100644
GIT binary patch
delta 378
zcmZpaJ}k3=jgdn$|5WhW!w1VY^D*YKdFUtS=jtUE6y&7p<s_!*ITn^Cdgdmkr@AF3
zm*f{!ssvXSm!#%8=jY@X1r+61R2D54FuJ$9ua=2{(T9OG86;lFP{$xXc{zJ+eQ^<k
zNLFH5qF!Qoi5`+pySjuDy?v8Am>3u;K&q7(Ab`C90)YB-G2P*opI1_>;*wgFS(cg-
z>KT+;oL^d$oC*?t*M04dMT=N3$iN~7d61nIdc~8CId;effQ{w_kp(3TygsGLnJI}1
z?nQ}tDXA5cE7%Qq;V$?OR5O{MvqdB{xP*bBgn=nF4<u&{CN?kUOlLOG0kQQ#gdx<e
pAhuaSK?P7RBghg429StFK{1H3oNUKyEMQ$w0aRSh0+Or%0svF(bOrzb

delta 175
zcmX>s(<r@xjgiBC?e0T@zq2N9=3~rdn>?LUck&VT8rA|JD4x8P<B*C20|@Ydh=LLZ
zHkZuAoc#2P;zEWx21StIe`90g$rm|WM1n#~7#K<zn2Jh4a{6Fmb0$|hvw<dvtqme{
rLFNJhh;39*Pyy7>2r`6$0VHBl05;Zi5}&bvc|iqGT{#O#t^x=ErUEbA

diff --git a/test/jdk/java/awt/dnd/BadSerializationTest/noEvents b/test/jdk/java/awt/dnd/BadSerializationTest/noEvents
index a45ba168c71de59fcc1b27af7eee1cc081de77dc..fdf1125889fc3ab000cc035b2ccfcdcddd917c50 100644
GIT binary patch
delta 29
lcmca1aYJGQ8zYBi{;A-#hYyx*=3{i{WC{)59L~ka1OTUW3C{ok

delta 29
lcmca1aYJGQ8zYDP+TDi)e`ihJ%*W`?$rKd2Ih>1;2>_~N3FH6(

diff --git a/test/jdk/java/awt/dnd/BadSerializationTest/nullComponent b/test/jdk/java/awt/dnd/BadSerializationTest/nullComponent
index 63aee01cc2ce59e126e5d2cf3ad52040a7df9e2b..d5dfcada90cfec9e9a4758e4f7c527998929a453 100644
GIT binary patch
delta 29
lcmeB^?vvhdnu$X*|5WhW!w1VYUuJUWWC{)5EW=a82mrIU3j_cF

delta 29
lcmeB^?vvhdnu)`H?e0T@zq2N9zRcv#$rKd2S%#;G5dgNP3mE_a

diff --git a/test/jdk/java/awt/dnd/BadSerializationTest/nullDragSource b/test/jdk/java/awt/dnd/BadSerializationTest/nullDragSource
index a483f7106a8ad1779dfb54593277fbe2183fafea..efdfeb3ed20a4cff964f112ecb5507507efbaf77 100644
GIT binary patch
delta 29
lcmbO!GgD>*8zYBi{;A-#hYyx*=3{i{WC{)59L{x!833FI3L5|b

delta 29
lcmbO!GgD>*8zYDP+TDi)e`ihJ%*W`?$rKd2Ih^YdGXS3U3NQcw

diff --git a/test/jdk/java/awt/dnd/BadSerializationTest/nullOrigin b/test/jdk/java/awt/dnd/BadSerializationTest/nullOrigin
index 5af1996e74b38800dcfeb62184d0181e738fef40..17d9fd3a1a9f6a232a7c6a1b8fe56b9b1080c42c 100644
GIT binary patch
delta 29
lcmbO#GgW2-8zYBi{;A-#hYyx*=3{i{WC{)59L}|m833Cf3J(AP

delta 29
lcmbO#GgW2-8zYDP+TDi)e`ihJ%*W`?$rKd2Ih<=BGXS0r3M2pk

diff --git a/test/jdk/javax/swing/JComponent/8043610/bug8043610.java b/test/jdk/javax/swing/JComponent/8043610/bug8043610.java
deleted file mode 100644
index 7eb371d1a0e..00000000000
--- a/test/jdk/javax/swing/JComponent/8043610/bug8043610.java
+++ /dev/null
@@ -1,102 +0,0 @@
-/*
- * Copyright (c) 2014, 2017, Oracle and/or its affiliates. All rights reserved.
- * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
- *
- * This code is free software; you can redistribute it and/or modify it
- * under the terms of the GNU General Public License version 2 only, as
- * published by the Free Software Foundation.
- *
- * This code is distributed in the hope that it will be useful, but WITHOUT
- * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
- * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
- * version 2 for more details (a copy is included in the LICENSE file that
- * accompanied this code).
- *
- * You should have received a copy of the GNU General Public License version
- * 2 along with this work; if not, write to the Free Software Foundation,
- * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
- *
- * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
- * or visit www.oracle.com if you need additional information or have any
- * questions.
- */
-
-
-/**
- * @test
- * @key headful
- * @bug 8043610
- * @summary Tests that JComponent invalidate, revalidate and repaint methods could
- *          be called from any thread
- * @author Petr Pchelko
- * @modules java.desktop/sun.awt
- */
-
-import sun.awt.SunToolkit;
-
-import javax.swing.*;
-import java.awt.*;
-import java.util.concurrent.CountDownLatch;
-import java.util.concurrent.atomic.AtomicReference;
-
-public class bug8043610 {
-    private static volatile JFrame frame;
-    private static volatile JComponent component;
-
-    public static void main(String[] args) throws Exception {
-        ThreadGroup stubTG = new ThreadGroup(getRootThreadGroup(), "Stub Thread Group");
-        ThreadGroup swingTG = new ThreadGroup(getRootThreadGroup(), "SwingTG");
-        try {
-            Thread stubThread = new Thread(stubTG, SunToolkit::createNewAppContext);
-            stubThread.start();
-            stubThread.join();
-
-            CountDownLatch startSwingLatch = new CountDownLatch(1);
-            new Thread(swingTG, () -> {
-                SunToolkit.createNewAppContext();
-                SwingUtilities.invokeLater(() -> {
-                    frame = new JFrame();
-                    component = new JLabel("Test Text");
-                    frame.add(component);
-                    frame.setBounds(100, 100, 100, 100);
-                    frame.setVisible(true);
-                    startSwingLatch.countDown();
-                });
-            }).start();
-            startSwingLatch.await();
-
-            AtomicReference<Exception> caughtException = new AtomicReference<>();
-            Thread checkThread = new Thread(getRootThreadGroup(), () -> {
-                try {
-                    component.invalidate();
-                    component.revalidate();
-                    component.repaint(new Rectangle(0, 0, 0, 0));
-                } catch (Exception e) {
-                    caughtException.set(e);
-                }
-            });
-            checkThread.start();
-            checkThread.join();
-
-            if (caughtException.get() != null) {
-                throw new RuntimeException("Failed. Caught exception!", caughtException.get());
-            }
-        } finally {
-            new Thread(swingTG, () -> SwingUtilities.invokeLater(() -> {
-                if (frame != null) {
-                    frame.dispose();
-                }
-            })).start();
-        }
-    }
-
-    private static ThreadGroup getRootThreadGroup() {
-        ThreadGroup currentTG = Thread.currentThread().getThreadGroup();
-        ThreadGroup parentTG = currentTG.getParent();
-        while (parentTG != null) {
-            currentTG = parentTG;
-            parentTG = currentTG.getParent();
-        }
-        return currentTG;
-    }
-}

From 46a5ed9908eb3aeafa1eb95a28114199d4b4c1e3 Mon Sep 17 00:00:00 2001
From: Phil Race <prr@openjdk.org>
Date: Mon, 9 Mar 2026 19:33:03 +0000
Subject: [PATCH 112/655] 8379137: Remove AppContext from
 javax.swing.JOptionPane

Reviewed-by: serb, psadhukhan
---
 .../classes/javax/swing/JOptionPane.java      | 19 ++++++-------------
 1 file changed, 6 insertions(+), 13 deletions(-)

diff --git a/src/java.desktop/share/classes/javax/swing/JOptionPane.java b/src/java.desktop/share/classes/javax/swing/JOptionPane.java
index 707b9febf10..c41400b9b37 100644
--- a/src/java.desktop/share/classes/javax/swing/JOptionPane.java
+++ b/src/java.desktop/share/classes/javax/swing/JOptionPane.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1997, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -1656,7 +1656,7 @@ public class JOptionPane extends JComponent implements Accessible
         return getDesktopPaneForComponent(parentComponent.getParent());
     }
 
-    private static final Object sharedFrameKey = JOptionPane.class;
+    private static volatile Frame sharedRootFrame;
 
     /**
      * Sets the frame to use for class methods in which a frame is
@@ -1668,11 +1668,7 @@ public class JOptionPane extends JComponent implements Accessible
      * @param newRootFrame the default <code>Frame</code> to use
      */
     public static void setRootFrame(Frame newRootFrame) {
-        if (newRootFrame != null) {
-            SwingUtilities.appContextPut(sharedFrameKey, newRootFrame);
-        } else {
-            SwingUtilities.appContextRemove(sharedFrameKey);
-        }
+        sharedRootFrame = newRootFrame;
     }
 
     /**
@@ -1687,13 +1683,10 @@ public class JOptionPane extends JComponent implements Accessible
      * @see java.awt.GraphicsEnvironment#isHeadless
      */
     public static Frame getRootFrame() throws HeadlessException {
-        Frame sharedFrame =
-            (Frame)SwingUtilities.appContextGet(sharedFrameKey);
-        if (sharedFrame == null) {
-            sharedFrame = SwingUtilities.getSharedOwnerFrame();
-            SwingUtilities.appContextPut(sharedFrameKey, sharedFrame);
+        if (sharedRootFrame == null) {
+            sharedRootFrame = SwingUtilities.getSharedOwnerFrame();
         }
-        return sharedFrame;
+        return sharedRootFrame;
     }
 
     /**

From 6a8e9530fe914fb7a328ea41f7e57c8cb5e6e99d Mon Sep 17 00:00:00 2001
From: Kelvin Nilsen <kdnilsen@openjdk.org>
Date: Mon, 9 Mar 2026 21:58:50 +0000
Subject: [PATCH 113/655] 8379442: GenShen: Fix two errors introduced by 29039

Reviewed-by: xpeng, serb, wkemper
---
 .../gc/shenandoah/heuristics/shenandoahAdaptiveHeuristics.cpp   | 2 +-
 src/hotspot/share/gc/shenandoah/shenandoahFreeSet.cpp           | 2 +-
 2 files changed, 2 insertions(+), 2 deletions(-)

diff --git a/src/hotspot/share/gc/shenandoah/heuristics/shenandoahAdaptiveHeuristics.cpp b/src/hotspot/share/gc/shenandoah/heuristics/shenandoahAdaptiveHeuristics.cpp
index ac8b3ebdf37..a1aeb918553 100644
--- a/src/hotspot/share/gc/shenandoah/heuristics/shenandoahAdaptiveHeuristics.cpp
+++ b/src/hotspot/share/gc/shenandoah/heuristics/shenandoahAdaptiveHeuristics.cpp
@@ -739,7 +739,7 @@ size_t ShenandoahAdaptiveHeuristics::accelerated_consumption(double& acceleratio
       if (i > 0) {
         // first sample not included in weighted average because it has no weight.
         double sample_weight = x_array[i] - x_array[i-1];
-        weighted_y_sum = y_array[i] * sample_weight;
+        weighted_y_sum += y_array[i] * sample_weight;
         total_weight += sample_weight;
       }
       y_sum += y_array[i];
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahFreeSet.cpp b/src/hotspot/share/gc/shenandoah/shenandoahFreeSet.cpp
index c39e2e7bb79..d765f33fee0 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahFreeSet.cpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahFreeSet.cpp
@@ -2848,7 +2848,7 @@ size_t ShenandoahFreeSet::reserve_regions(size_t to_reserve, size_t to_reserve_o
                               _partitions.leftmost(ShenandoahFreeSetPartitionId::OldCollector),
                               _partitions.rightmost(ShenandoahFreeSetPartitionId::OldCollector));
           old_region_count++;
-          assert(ac = ShenandoahHeapRegion::region_size_bytes(), "Cannot move to old unless entire region is in alloc capacity");
+          assert(ac == ShenandoahHeapRegion::region_size_bytes(), "Cannot move to old unless entire region is in alloc capacity");
           mutator_allocatable_words -= ShenandoahHeapRegion::region_size_words();
           continue;
         }

From 6a061f9d2529117ad3e0fa7a2a58e5d8032a2ea2 Mon Sep 17 00:00:00 2001
From: Alexey Semenyuk <asemenyuk@openjdk.org>
Date: Mon, 9 Mar 2026 22:54:52 +0000
Subject: [PATCH 114/655] 8379426: [macos] jpackage: runtime bundle version
 suffix is out of sync with the version property in the Info.plist file

Reviewed-by: almatvee
---
 .../jpackage/internal/ActiveKeychainList.java | 144 ++++++++++
 .../internal/AppImageInfoPListFile.java       |  65 -----
 .../internal/MacApplicationBuilder.java       |  79 +++--
 .../jdk/jpackage/internal/MacFromOptions.java |  36 ++-
 .../internal/MacPackagingPipeline.java        |   2 +-
 .../jdk/jpackage/internal/TempKeychain.java   | 103 -------
 .../jpackage/internal/ApplicationBuilder.java |  31 ++
 .../jdk/jpackage/internal/Globals.java        |  19 ++
 .../jdk/jpackage/test/JPackageCommand.java    |  14 +-
 .../internal/ActiveKeychainListTest.java      | 269 ++++++++++++++++++
 .../jpackage/internal/MacDmgPackagerTest.java |   7 +-
 .../tools/jpackage/junit/macosx/junit.java    |  11 +
 test/jdk/tools/jpackage/share/ErrorTest.java  |   4 +-
 .../jpackage/share/RuntimePackageTest.java    |   9 +-
 14 files changed, 582 insertions(+), 211 deletions(-)
 create mode 100644 src/jdk.jpackage/macosx/classes/jdk/jpackage/internal/ActiveKeychainList.java
 delete mode 100644 src/jdk.jpackage/macosx/classes/jdk/jpackage/internal/AppImageInfoPListFile.java
 delete mode 100644 src/jdk.jpackage/macosx/classes/jdk/jpackage/internal/TempKeychain.java
 create mode 100644 test/jdk/tools/jpackage/junit/macosx/jdk.jpackage/jdk/jpackage/internal/ActiveKeychainListTest.java

diff --git a/src/jdk.jpackage/macosx/classes/jdk/jpackage/internal/ActiveKeychainList.java b/src/jdk.jpackage/macosx/classes/jdk/jpackage/internal/ActiveKeychainList.java
new file mode 100644
index 00000000000..ab41fc0a60e
--- /dev/null
+++ b/src/jdk.jpackage/macosx/classes/jdk/jpackage/internal/ActiveKeychainList.java
@@ -0,0 +1,144 @@
+/*
+ * Copyright (c) 2025, 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.  Oracle designates this
+ * particular file as subject to the "Classpath" exception as provided
+ * by Oracle in the LICENSE file that accompanied this code.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+package jdk.jpackage.internal;
+
+import java.io.Closeable;
+import java.io.IOException;
+import java.util.ArrayList;
+import java.util.List;
+import java.util.Objects;
+import java.util.Optional;
+import java.util.function.Consumer;
+import java.util.stream.Collectors;
+import java.util.stream.Stream;
+import jdk.internal.util.OSVersion;
+
+final class ActiveKeychainList implements Closeable {
+
+    static Optional<ActiveKeychainList> createForPlatform(List<Keychain> keychains) throws IOException {
+        if (!keychains.isEmpty() && Globals.instance().findBooleanProperty(ActiveKeychainList.class).orElseGet(ActiveKeychainList::isRequired)) {
+            return Optional.of(new ActiveKeychainList(keychains));
+        } else {
+            return Optional.empty();
+        }
+    }
+
+    static Optional<ActiveKeychainList> createForPlatform(Keychain... keychains) throws IOException {
+        return createForPlatform(List.of(keychains));
+    }
+
+    @SuppressWarnings("try")
+    static void withKeychains(Consumer<List<Keychain>> keychainConsumer, List<Keychain> keychains) throws IOException {
+        var keychainList = createForPlatform(keychains);
+        if (keychainList.isEmpty()) {
+            keychainConsumer.accept(keychains);
+        } else {
+            try (var kl = keychainList.get()) {
+                keychainConsumer.accept(keychains);
+            }
+        }
+    }
+
+    static void withKeychain(Consumer<Keychain> keychainConsumer, Keychain keychain) throws IOException {
+
+        Objects.requireNonNull(keychainConsumer);
+        withKeychains(keychains -> {
+            keychainConsumer.accept(keychains.getFirst());
+        }, List.of(keychain));
+    }
+
+    ActiveKeychainList(List<Keychain> requestedKeychains, List<Keychain> currentKeychains, boolean force) throws IOException {
+        this.requestedKeychains = List.copyOf(requestedKeychains);
+        this.oldKeychains = List.copyOf(currentKeychains);
+
+        final List<String> cmdline = new ArrayList<>(LIST_KEYCHAINS_CMD_PREFIX);
+        addKeychains(cmdline, oldKeychains);
+
+        if (force) {
+            this.currentKeychains = requestedKeychains;
+            restoreKeychainsCmd = List.copyOf(cmdline);
+            cmdline.subList(LIST_KEYCHAINS_CMD_PREFIX.size(), cmdline.size()).clear();
+            addKeychains(cmdline, requestedKeychains);
+        } else {
+            final var currentKeychainPaths = oldKeychains.stream().map(Keychain::path).toList();
+
+            final var missingKeychains = requestedKeychains.stream().filter(k -> {
+                return !currentKeychainPaths.contains(k.path());
+            }).toList();
+
+            if (missingKeychains.isEmpty()) {
+                this.currentKeychains = oldKeychains;
+                restoreKeychainsCmd = List.of();
+            } else {
+                this.currentKeychains = Stream.of(oldKeychains, missingKeychains)
+                        .flatMap(List::stream).collect(Collectors.toUnmodifiableList());
+                restoreKeychainsCmd = List.copyOf(cmdline);
+                addKeychains(cmdline, missingKeychains);
+            }
+        }
+
+        Executor.of(cmdline).executeExpectSuccess();
+    }
+
+    ActiveKeychainList(List<Keychain> keychains) throws IOException {
+        this(keychains, Keychain.listKeychains(), false);
+    }
+
+    List<Keychain> requestedKeychains() {
+        return requestedKeychains;
+    }
+
+    List<Keychain> currentKeychains() {
+        return currentKeychains;
+    }
+
+    List<Keychain> restoreKeychains() {
+        return oldKeychains;
+    }
+
+    @Override
+    public void close() throws IOException {
+        if (!restoreKeychainsCmd.isEmpty()) {
+            Executor.of(restoreKeychainsCmd).executeExpectSuccess();
+        }
+    }
+
+    private static void addKeychains(List<String> cmdline, List<Keychain> keychains) {
+        cmdline.addAll(keychains.stream().map(Keychain::asCliArg).toList());
+    }
+
+    private static boolean isRequired() {
+        // Required for OS X 10.12+
+        return 0 <= OSVersion.current().compareTo(new OSVersion(10, 12));
+    }
+
+    private final List<Keychain> requestedKeychains;
+    private final List<Keychain> currentKeychains;
+    private final List<Keychain> oldKeychains;
+    private final List<String> restoreKeychainsCmd;
+
+    private final static List<String> LIST_KEYCHAINS_CMD_PREFIX = List.of("/usr/bin/security", "list-keychains", "-s");
+}
diff --git a/src/jdk.jpackage/macosx/classes/jdk/jpackage/internal/AppImageInfoPListFile.java b/src/jdk.jpackage/macosx/classes/jdk/jpackage/internal/AppImageInfoPListFile.java
deleted file mode 100644
index 602e147a970..00000000000
--- a/src/jdk.jpackage/macosx/classes/jdk/jpackage/internal/AppImageInfoPListFile.java
+++ /dev/null
@@ -1,65 +0,0 @@
-/*
- * Copyright (c) 2025, 2026, Oracle and/or its affiliates. All rights reserved.
- * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
- *
- * This code is free software; you can redistribute it and/or modify it
- * under the terms of the GNU General Public License version 2 only, as
- * published by the Free Software Foundation.  Oracle designates this
- * particular file as subject to the "Classpath" exception as provided
- * by Oracle in the LICENSE file that accompanied this code.
- *
- * This code is distributed in the hope that it will be useful, but WITHOUT
- * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
- * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
- * version 2 for more details (a copy is included in the LICENSE file that
- * accompanied this code).
- *
- * You should have received a copy of the GNU General Public License version
- * 2 along with this work; if not, write to the Free Software Foundation,
- * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
- *
- * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
- * or visit www.oracle.com if you need additional information or have any
- * questions.
- */
-package jdk.jpackage.internal;
-
-import java.io.IOException;
-import java.nio.file.Files;
-import java.nio.file.Path;
-import jdk.jpackage.internal.model.DottedVersion;
-import jdk.jpackage.internal.util.PListReader;
-import org.xml.sax.SAXException;
-
-/**
- * Mandatory elements of Info.plist file of app image.
- */
-record AppImageInfoPListFile(String bundleIdentifier, String bundleName, String copyright,
-        DottedVersion shortVersion, DottedVersion bundleVersion, String category) {
-
-    static final class InvalidPlistFileException extends Exception {
-        InvalidPlistFileException(Throwable cause) {
-            super(cause);
-        }
-
-        private static final long serialVersionUID = 1L;
-    }
-
-    static AppImageInfoPListFile loadFromInfoPList(Path infoPListFile)
-            throws IOException, InvalidPlistFileException, SAXException {
-
-        final var plistReader = new PListReader(Files.readAllBytes(infoPListFile));
-
-        try {
-            return new AppImageInfoPListFile(
-                    plistReader.queryValue("CFBundleIdentifier"),
-                    plistReader.queryValue("CFBundleName"),
-                    plistReader.queryValue("NSHumanReadableCopyright"),
-                    DottedVersion.greedy(plistReader.queryValue("CFBundleShortVersionString")),
-                    DottedVersion.greedy(plistReader.queryValue("CFBundleVersion")),
-                    plistReader.queryValue("LSApplicationCategoryType"));
-        } catch (Exception ex) {
-            throw new InvalidPlistFileException(ex);
-        }
-    }
-}
diff --git a/src/jdk.jpackage/macosx/classes/jdk/jpackage/internal/MacApplicationBuilder.java b/src/jdk.jpackage/macosx/classes/jdk/jpackage/internal/MacApplicationBuilder.java
index 43590fb5e2c..cdccd488ed6 100644
--- a/src/jdk.jpackage/macosx/classes/jdk/jpackage/internal/MacApplicationBuilder.java
+++ b/src/jdk.jpackage/macosx/classes/jdk/jpackage/internal/MacApplicationBuilder.java
@@ -36,20 +36,24 @@ import java.util.stream.Stream;
 import jdk.jpackage.internal.model.AppImageLayout;
 import jdk.jpackage.internal.model.AppImageSigningConfig;
 import jdk.jpackage.internal.model.Application;
+import jdk.jpackage.internal.model.ApplicationLaunchers;
+import jdk.jpackage.internal.model.ExternalApplication;
+import jdk.jpackage.internal.model.JPackageException;
 import jdk.jpackage.internal.model.Launcher;
 import jdk.jpackage.internal.model.MacApplication;
 import jdk.jpackage.internal.model.MacApplicationMixin;
-import jdk.jpackage.internal.model.JPackageException;
+import jdk.jpackage.internal.util.PListReader;
+import jdk.jpackage.internal.util.Result;
 import jdk.jpackage.internal.util.RootedPath;
 
 final class MacApplicationBuilder {
 
-    MacApplicationBuilder(Application app) {
-        this.app = Objects.requireNonNull(app);
+    MacApplicationBuilder(ApplicationBuilder appBuilder) {
+        this.superBuilder = Objects.requireNonNull(appBuilder);
     }
 
     private MacApplicationBuilder(MacApplicationBuilder other) {
-        this(other.app);
+        this(other.superBuilder.copy());
         icon = other.icon;
         bundleName = other.bundleName;
         bundleIdentifier = other.bundleIdentifier;
@@ -94,18 +98,28 @@ final class MacApplicationBuilder {
         return this;
     }
 
+    Optional<ExternalApplication> externalApplication() {
+        return superBuilder.externalApplication();
+    }
+
+    Optional<ApplicationLaunchers> launchers() {
+        return superBuilder.launchers();
+    }
+
     MacApplication create() {
         if (externalInfoPlistFile != null) {
             return createCopyForExternalInfoPlistFile().create();
         }
 
+        var app = superBuilder.create();
+
         validateAppVersion(app);
         validateAppContentDirs(app);
 
         final var mixin = new MacApplicationMixin.Stub(
                 validatedIcon(),
-                validatedBundleName(),
-                validatedBundleIdentifier(),
+                validatedBundleName(app),
+                validatedBundleIdentifier(app),
                 validatedCategory(),
                 appStore,
                 createSigningConfig());
@@ -161,39 +175,58 @@ final class MacApplicationBuilder {
     }
 
     private MacApplicationBuilder createCopyForExternalInfoPlistFile() {
-        try {
-            final var plistFile = AppImageInfoPListFile.loadFromInfoPList(externalInfoPlistFile);
+        final var builder = new MacApplicationBuilder(this);
 
-            final var builder = new MacApplicationBuilder(this);
+        builder.externalInfoPlistFile(null);
 
-            builder.externalInfoPlistFile(null);
+        Result<PListReader> plistResult = Result.of(() -> {
+            return new PListReader(Files.readAllBytes(externalInfoPlistFile));
+        }, Exception.class);
 
+        plistResult.value().ifPresent(plist -> {
             if (builder.bundleName == null) {
-                builder.bundleName(plistFile.bundleName());
+                plist.findValue("CFBundleName").ifPresent(builder::bundleName);
             }
 
             if (builder.bundleIdentifier == null) {
-                builder.bundleIdentifier(plistFile.bundleIdentifier());
+                plist.findValue("CFBundleIdentifier").ifPresent(builder::bundleIdentifier);
             }
 
             if (builder.category == null) {
-                builder.category(plistFile.category());
+                plist.findValue("LSApplicationCategoryType").ifPresent(builder::category);
             }
 
-            return builder;
-        } catch (IOException ex) {
-            throw new UncheckedIOException(ex);
-        } catch (Exception ex) {
-            throw new JPackageException(
-                    I18N.format("error.invalid-app-image-plist-file", externalInfoPlistFile), ex);
-        }
+            if (builder.superBuilder.version().isEmpty()) {
+                plist.findValue("CFBundleVersion").ifPresent(builder.superBuilder::version);
+            }
+        });
+
+        plistResult.firstError().filter(_ -> {
+            // If we are building a runtime and the Info.plist file of the predefined
+            // runtime bundle is malformed or unavailable, ignore it.
+            return !superBuilder.isRuntime();
+        }).ifPresent(ex -> {
+            // We are building an application from the predefined app image and
+            // the Info.plist file in the predefined app image bundle is malformed or unavailable. Bail out.
+            switch (ex) {
+                case IOException ioex -> {
+                    throw new UncheckedIOException(ioex);
+                }
+                default -> {
+                    throw new JPackageException(
+                            I18N.format("error.invalid-app-image-plist-file", externalInfoPlistFile), ex);
+                }
+            }
+        });
+
+        return builder;
     }
 
     private Optional<AppImageSigningConfig> createSigningConfig() {
         return Optional.ofNullable(signingBuilder).map(AppImageSigningConfigBuilder::create);
     }
 
-    private String validatedBundleName() {
+    private String validatedBundleName(Application app) {
         final var value = Optional.ofNullable(bundleName).orElseGet(() -> {
             final var appName = app.name();
 // Commented out for backward compatibility
@@ -212,7 +245,7 @@ final class MacApplicationBuilder {
         return value;
     }
 
-    private String validatedBundleIdentifier() {
+    private String validatedBundleIdentifier(Application app) {
         final var value = Optional.ofNullable(bundleIdentifier).orElseGet(() -> {
             return app.mainLauncher()
                     .flatMap(Launcher::startupInfo)
@@ -255,7 +288,7 @@ final class MacApplicationBuilder {
     private Path externalInfoPlistFile;
     private AppImageSigningConfigBuilder signingBuilder;
 
-    private final Application app;
+    private final ApplicationBuilder superBuilder;
 
     private static final Defaults DEFAULTS = new Defaults("utilities");
 
diff --git a/src/jdk.jpackage/macosx/classes/jdk/jpackage/internal/MacFromOptions.java b/src/jdk.jpackage/macosx/classes/jdk/jpackage/internal/MacFromOptions.java
index 4cd4f386ad8..be9519c57a6 100644
--- a/src/jdk.jpackage/macosx/classes/jdk/jpackage/internal/MacFromOptions.java
+++ b/src/jdk.jpackage/macosx/classes/jdk/jpackage/internal/MacFromOptions.java
@@ -198,7 +198,7 @@ final class MacFromOptions {
         }
     }
 
-    private static ApplicationWithDetails createMacApplicationInternal(Options options) {
+    private static ApplicationBuilder createApplicationBuilder(Options options) {
 
         final var predefinedRuntimeLayout = PREDEFINED_RUNTIME_IMAGE.findIn(options)
                 .map(MacPackage::guessRuntimeLayout);
@@ -236,12 +236,30 @@ final class MacFromOptions {
 
         final var app = superAppBuilder.create();
 
-        final var appBuilder = new MacApplicationBuilder(app);
+        return superAppBuilder;
+    }
 
-        PREDEFINED_APP_IMAGE.findIn(options)
-                .map(MacBundle::new)
-                .map(MacBundle::infoPlistFile)
-                .ifPresent(appBuilder::externalInfoPlistFile);
+    private static ApplicationWithDetails createMacApplicationInternal(Options options) {
+
+        final var appBuilder = new MacApplicationBuilder(createApplicationBuilder(options));
+
+        if (OptionUtils.isRuntimeInstaller(options)) {
+            // Predefined runtime image, if specified, can be a macOS bundle or regular directory.
+            // Notify application builder with the path to the plist file in the predefined runtime image only if the file exists.
+            // If it doesn't, jpackage should keep going.
+            PREDEFINED_RUNTIME_IMAGE.findIn(options)
+                    .flatMap(MacBundle::fromPath)
+                    .map(MacBundle::infoPlistFile)
+                    .ifPresent(appBuilder::externalInfoPlistFile);
+        } else {
+            // Predefined app image, if specified, should always be a valid macOS bundle.
+            // Notify application builder with the path to the plist file in the predefined app image without checking if the file exists.
+            // If it doesn't, the builder should throw and jpackage should exit with error.
+            PREDEFINED_APP_IMAGE.findIn(options)
+                    .map(MacBundle::new)
+                    .map(MacBundle::infoPlistFile)
+                    .ifPresent(appBuilder::externalInfoPlistFile);
+        }
 
         ICON.ifPresentIn(options, appBuilder::icon);
         MAC_BUNDLE_NAME.ifPresentIn(options, appBuilder::bundleName);
@@ -252,7 +270,7 @@ final class MacFromOptions {
         final boolean appStore;
 
         if (PREDEFINED_APP_IMAGE.containsIn(options)) {
-            final var appImageFileOptions = superAppBuilder.externalApplication().orElseThrow().extra();
+            final var appImageFileOptions = appBuilder.externalApplication().orElseThrow().extra();
             appStore = MAC_APP_STORE.getFrom(appImageFileOptions);
         } else {
             appStore = MAC_APP_STORE.getFrom(options);
@@ -295,7 +313,7 @@ final class MacFromOptions {
                 signingBuilder.entitlementsResourceName("sandbox.plist");
             }
 
-            app.mainLauncher().flatMap(Launcher::startupInfo).ifPresentOrElse(
+            appBuilder.launchers().map(ApplicationLaunchers::mainLauncher).flatMap(Launcher::startupInfo).ifPresentOrElse(
                 signingBuilder::signingIdentifierPrefix,
                 () -> {
                     // Runtime installer does not have the main launcher, use
@@ -310,7 +328,7 @@ final class MacFromOptions {
             appBuilder.signingBuilder(signingBuilder);
         }
 
-        return new ApplicationWithDetails(appBuilder.create(), superAppBuilder.externalApplication());
+        return new ApplicationWithDetails(appBuilder.create(), appBuilder.externalApplication());
     }
 
     private static MacPackageBuilder createMacPackageBuilder(Options options, ApplicationWithDetails app, PackageType type) {
diff --git a/src/jdk.jpackage/macosx/classes/jdk/jpackage/internal/MacPackagingPipeline.java b/src/jdk.jpackage/macosx/classes/jdk/jpackage/internal/MacPackagingPipeline.java
index 4e63f6db178..d75b7d0b9cd 100644
--- a/src/jdk.jpackage/macosx/classes/jdk/jpackage/internal/MacPackagingPipeline.java
+++ b/src/jdk.jpackage/macosx/classes/jdk/jpackage/internal/MacPackagingPipeline.java
@@ -500,7 +500,7 @@ final class MacPackagingPipeline {
         };
 
         app.signingConfig().flatMap(AppImageSigningConfig::keychain).map(Keychain::new).ifPresentOrElse(keychain -> {
-            toBiConsumer(TempKeychain::withKeychain).accept(unused -> signAction.run(), keychain);
+            toBiConsumer(ActiveKeychainList::withKeychain).accept(unused -> signAction.run(), keychain);
         }, signAction);
     }
 
diff --git a/src/jdk.jpackage/macosx/classes/jdk/jpackage/internal/TempKeychain.java b/src/jdk.jpackage/macosx/classes/jdk/jpackage/internal/TempKeychain.java
deleted file mode 100644
index 2f616aafba1..00000000000
--- a/src/jdk.jpackage/macosx/classes/jdk/jpackage/internal/TempKeychain.java
+++ /dev/null
@@ -1,103 +0,0 @@
-/*
- * Copyright (c) 2025, 2026, Oracle and/or its affiliates. All rights reserved.
- * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
- *
- * This code is free software; you can redistribute it and/or modify it
- * under the terms of the GNU General Public License version 2 only, as
- * published by the Free Software Foundation.  Oracle designates this
- * particular file as subject to the "Classpath" exception as provided
- * by Oracle in the LICENSE file that accompanied this code.
- *
- * This code is distributed in the hope that it will be useful, but WITHOUT
- * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
- * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
- * version 2 for more details (a copy is included in the LICENSE file that
- * accompanied this code).
- *
- * You should have received a copy of the GNU General Public License version
- * 2 along with this work; if not, write to the Free Software Foundation,
- * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
- *
- * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
- * or visit www.oracle.com if you need additional information or have any
- * questions.
- */
-
-package jdk.jpackage.internal;
-
-import java.io.Closeable;
-import java.io.IOException;
-import java.io.UncheckedIOException;
-import java.util.ArrayList;
-import java.util.List;
-import java.util.Objects;
-import java.util.function.Consumer;
-import jdk.internal.util.OSVersion;
-
-final class TempKeychain implements Closeable {
-
-    static void withKeychains(Consumer<List<Keychain>> keychainConsumer, List<Keychain> keychains) {
-
-        keychains.forEach(Objects::requireNonNull);
-        if (keychains.isEmpty() || OSVersion.current().compareTo(new OSVersion(10, 12)) < 0) {
-            keychainConsumer.accept(keychains);
-        } else {
-            // we need this for OS X 10.12+
-            try (var tempKeychain = new TempKeychain(keychains)) {
-                keychainConsumer.accept(tempKeychain.keychains);
-            } catch (IOException ex) {
-                throw new UncheckedIOException(ex);
-            }
-        }
-    }
-
-    static void withKeychain(Consumer<Keychain> keychainConsumer, Keychain keychain) {
-
-        Objects.requireNonNull(keychainConsumer);
-        withKeychains(keychains -> {
-            keychainConsumer.accept(keychains.getFirst());
-        }, List.of(keychain));
-    }
-
-    TempKeychain(List<Keychain> keychains) throws IOException {
-        this.keychains = Objects.requireNonNull(keychains);
-
-        final var currentKeychains = Keychain.listKeychains();
-
-        final var currentKeychainPaths = currentKeychains.stream().map(Keychain::path).toList();
-
-        final var missingKeychains = keychains.stream().filter(k -> {
-            return !currentKeychainPaths.contains(k.path());
-        }).toList();
-
-        if (missingKeychains.isEmpty()) {
-            restoreKeychainsCmd = List.of();
-        } else {
-            List<String> args = new ArrayList<>();
-            args.add("/usr/bin/security");
-            args.add("list-keychains");
-            args.add("-s");
-            args.addAll(currentKeychains.stream().map(Keychain::asCliArg).toList());
-
-            restoreKeychainsCmd = List.copyOf(args);
-
-            args.addAll(missingKeychains.stream().map(Keychain::asCliArg).toList());
-
-            Executor.of(args).executeExpectSuccess();
-        }
-    }
-
-    List<Keychain> keychains() {
-        return keychains;
-    }
-
-    @Override
-    public void close() throws IOException {
-        if (!restoreKeychainsCmd.isEmpty()) {
-            Executor.of(restoreKeychainsCmd).executeExpectSuccess();
-        }
-    }
-
-    private final List<Keychain> keychains;
-    private final List<String> restoreKeychainsCmd;
-}
diff --git a/src/jdk.jpackage/share/classes/jdk/jpackage/internal/ApplicationBuilder.java b/src/jdk.jpackage/share/classes/jdk/jpackage/internal/ApplicationBuilder.java
index 9d5407524a8..ebfae9f8d4c 100644
--- a/src/jdk.jpackage/share/classes/jdk/jpackage/internal/ApplicationBuilder.java
+++ b/src/jdk.jpackage/share/classes/jdk/jpackage/internal/ApplicationBuilder.java
@@ -45,10 +45,32 @@ import jdk.jpackage.internal.model.LauncherIcon;
 import jdk.jpackage.internal.model.LauncherStartupInfo;
 import jdk.jpackage.internal.model.ResourceDirLauncherIcon;
 import jdk.jpackage.internal.model.RuntimeBuilder;
+import jdk.jpackage.internal.model.RuntimeLayout;
 import jdk.jpackage.internal.util.RootedPath;
 
 final class ApplicationBuilder {
 
+    ApplicationBuilder() {
+    }
+
+    ApplicationBuilder(ApplicationBuilder other) {
+        name = other.name;
+        description = other.description;
+        version = other.version;
+        vendor = other.vendor;
+        copyright = other.copyright;
+        appDirSources = other.appDirSources;
+        externalApp = other.externalApp;
+        contentDirSources = other.contentDirSources;
+        appImageLayout = other.appImageLayout;
+        runtimeBuilder = other.runtimeBuilder;
+        launchers = other.launchers;
+    }
+
+    ApplicationBuilder copy() {
+        return new ApplicationBuilder(this);
+    }
+
     Application create() {
         Objects.requireNonNull(appImageLayout);
 
@@ -103,6 +125,11 @@ final class ApplicationBuilder {
         return this;
     }
 
+    boolean isRuntime() {
+        return Optional.ofNullable(appImageLayout)
+                .orElseThrow(IllegalStateException::new) instanceof RuntimeLayout;
+    }
+
     ApplicationBuilder name(String v) {
         name = v;
         return this;
@@ -118,6 +145,10 @@ final class ApplicationBuilder {
         return this;
     }
 
+    Optional<String> version() {
+        return Optional.ofNullable(version);
+    }
+
     ApplicationBuilder vendor(String v) {
         vendor = v;
         return this;
diff --git a/src/jdk.jpackage/share/classes/jdk/jpackage/internal/Globals.java b/src/jdk.jpackage/share/classes/jdk/jpackage/internal/Globals.java
index d5c714d1a47..0128d050c25 100644
--- a/src/jdk.jpackage/share/classes/jdk/jpackage/internal/Globals.java
+++ b/src/jdk.jpackage/share/classes/jdk/jpackage/internal/Globals.java
@@ -25,6 +25,9 @@
 package jdk.jpackage.internal;
 
 import java.io.PrintWriter;
+import java.util.HashMap;
+import java.util.Map;
+import java.util.Objects;
 import java.util.Optional;
 import java.util.function.Supplier;
 
@@ -47,6 +50,21 @@ public final class Globals {
         return objectFactory(ObjectFactory.build(objectFactory).executorFactory(v).create());
     }
 
+    @SuppressWarnings("unchecked")
+    public <T> Optional<T> findProperty(Object key) {
+        return Optional.ofNullable((T)properties.get(Objects.requireNonNull(key)));
+    }
+
+    public Optional<Boolean> findBooleanProperty(Object key) {
+        return findProperty(key);
+    }
+
+    public <T> Globals setProperty(Object key, T value) {
+        checkMutable();
+        properties.compute(Objects.requireNonNull(key), (_, _) -> value);
+        return this;
+    }
+
     Log.Logger logger() {
         return logger;
     }
@@ -79,6 +97,7 @@ public final class Globals {
 
     private ObjectFactory objectFactory = ObjectFactory.DEFAULT;
     private final Log.Logger logger = new Log.Logger();
+    private final Map<Object, Object> properties = new HashMap<>();
 
     private static final ScopedValue<Globals> INSTANCE = ScopedValue.newInstance();
     private static final Globals DEFAULT = new Globals();
diff --git a/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/JPackageCommand.java b/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/JPackageCommand.java
index 2e58ea7a0ab..f68ac90d284 100644
--- a/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/JPackageCommand.java
+++ b/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/JPackageCommand.java
@@ -60,6 +60,7 @@ import java.util.spi.ToolProvider;
 import java.util.stream.Collectors;
 import java.util.stream.Stream;
 import java.util.stream.StreamSupport;
+import jdk.jpackage.internal.util.MacBundle;
 import jdk.jpackage.internal.util.function.ExceptionBox;
 import jdk.jpackage.internal.util.function.ThrowingConsumer;
 import jdk.jpackage.internal.util.function.ThrowingFunction;
@@ -245,7 +246,18 @@ public class JPackageCommand extends CommandArguments<JPackageCommand> {
 
     public String version() {
         return PropertyFinder.findAppProperty(this,
-                PropertyFinder.cmdlineOptionWithValue("--app-version"),
+                PropertyFinder.cmdlineOptionWithValue("--app-version").or(cmd -> {
+                    if (cmd.isRuntime() && PackageType.MAC.contains(cmd.packageType())) {
+                        // This is a macOS runtime bundle.
+                        var predefinedRuntimeBundle = MacBundle.fromPath(Path.of(cmd.getArgumentValue("--runtime-image")));
+                        if (predefinedRuntimeBundle.isPresent()) {
+                            // This is a macOS runtime bundle created from the predefined runtime bundle (not a predefined runtime directory).
+                            // The version of this bundle should be copied from the Info.plist file of the predefined runtime bundle.
+                            return MacHelper.readPList(predefinedRuntimeBundle.get().infoPlistFile()).findValue("CFBundleVersion");
+                        }
+                    }
+                    return Optional.empty();
+                }),
                 PropertyFinder.appImageFile(appImageFile -> {
                     return appImageFile.version();
                 })
diff --git a/test/jdk/tools/jpackage/junit/macosx/jdk.jpackage/jdk/jpackage/internal/ActiveKeychainListTest.java b/test/jdk/tools/jpackage/junit/macosx/jdk.jpackage/jdk/jpackage/internal/ActiveKeychainListTest.java
new file mode 100644
index 00000000000..2ff5317e60d
--- /dev/null
+++ b/test/jdk/tools/jpackage/junit/macosx/jdk.jpackage/jdk/jpackage/internal/ActiveKeychainListTest.java
@@ -0,0 +1,269 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+package jdk.jpackage.internal;
+
+import static jdk.jpackage.internal.util.function.ThrowingSupplier.toSupplier;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertTrue;
+
+import java.io.IOException;
+import java.util.ArrayList;
+import java.util.List;
+import java.util.Objects;
+import java.util.Optional;
+import java.util.function.Consumer;
+import jdk.jpackage.test.mock.CommandAction;
+import jdk.jpackage.test.mock.CommandActionSpec;
+import jdk.jpackage.test.mock.CommandActionSpecs;
+import jdk.jpackage.test.mock.CommandMockSpec;
+import jdk.jpackage.test.mock.MockIllegalStateException;
+import jdk.jpackage.test.mock.Script;
+import jdk.jpackage.test.stdmock.JPackageMockUtils;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.CsvSource;
+
+class ActiveKeychainListTest {
+
+    @ParameterizedTest
+    @CsvSource(value = {
+            "'','',''",
+            "a,'',a",
+            "'',a,a",
+            "a,a,a",
+            "abc,b,abc",
+            "abc,ba,abc",
+            "abc,bad,abcd",
+            "ac,b,acb"
+    })
+    void test_ctor_and_createForPlatform(String initial, String requested, String current) throws IOException {
+
+        var initialKeychains = parseKeychainList(initial);
+        var requestedKeychains = parseKeychainList(requested);
+
+        var securityMock = new SecurityKeychainListMock(true);
+        initialKeychains.stream().map(Keychain::name).forEach(securityMock.keychainNames()::add);
+
+        Globals.main(toSupplier(() -> {
+            securityMock.applyToGlobals();
+            Globals.instance().setProperty(ActiveKeychainList.class, false);
+
+            assertTrue(ActiveKeychainList.createForPlatform(requestedKeychains.toArray(Keychain[]::new)).isEmpty());
+
+            var akl = new ActiveKeychainList(List.copyOf(requestedKeychains));
+            try (akl) {
+                assertEquals(initialKeychains, akl.restoreKeychains());
+                assertEquals(requestedKeychains, akl.requestedKeychains());
+                assertEquals(parseKeychainList(current), akl.currentKeychains());
+                assertEquals(akl.currentKeychains(), securityMock.keychains());
+            }
+
+            assertEquals(initialKeychains, akl.restoreKeychains());
+            assertEquals(requestedKeychains, akl.requestedKeychains());
+            assertEquals(parseKeychainList(current), akl.currentKeychains());
+            assertEquals(initialKeychains, securityMock.keychains());
+
+            return 0;
+        }));
+    }
+
+    @ParameterizedTest
+    @CsvSource(value = {
+            "'','','',true",
+            "'','','',false",
+
+            "a,'','',true",
+            "a,'',a,false",
+
+            "'',a,a,true",
+            "'',a,a,false",
+
+            "a,a,a,true",
+            "a,a,a,false",
+
+            "abc,b,b,true",
+            "abc,b,abc,false",
+
+            "abc,ba,ba,true",
+            "abc,ba,abc,false",
+
+            "abc,bad,bad,true",
+            "abc,bad,abcd,false",
+
+            "ac,b,b,true",
+            "ac,b,acb,false"
+    })
+    void testCtorWithForced(String initial, String requested, String current, boolean forced) throws IOException {
+
+        var initialKeychains = parseKeychainList(initial);
+        var requestedKeychains = parseKeychainList(requested);
+
+        var securityMock = new SecurityKeychainListMock(forced);
+        securityMock.keychainNames().addAll(List.of("foo", "bar"));
+
+        Globals.main(toSupplier(() -> {
+            securityMock.applyToGlobals();
+
+            var akl = new ActiveKeychainList(List.copyOf(requestedKeychains), List.copyOf(initialKeychains), forced);
+            try (akl) {
+                assertEquals(initialKeychains, akl.restoreKeychains());
+                assertEquals(requestedKeychains, akl.requestedKeychains());
+                assertEquals(parseKeychainList(current), akl.currentKeychains());
+                assertEquals(akl.currentKeychains(), securityMock.keychains());
+            }
+
+            assertEquals(initialKeychains, akl.restoreKeychains());
+            assertEquals(requestedKeychains, akl.requestedKeychains());
+            assertEquals(parseKeychainList(current), akl.currentKeychains());
+            assertEquals(initialKeychains, securityMock.keychains());
+
+            return 0;
+        }));
+    }
+
+    @ParameterizedTest
+    @CsvSource(value = {
+            "'','',",
+            "a,'',",
+            "'',a,a",
+            "a,a,a",
+            "abc,b,abc",
+            "abc,ba,abc",
+            "abc,bad,abcd",
+            "ac,b,acb"
+    })
+    void test_withKeychain(String initial, String requested, String current) throws IOException {
+
+        var initialKeychains = parseKeychainList(initial);
+        var requestedKeychains = parseKeychainList(requested);
+
+        for (boolean isRequired : List.of(true, false)) {
+            var securityMock = new SecurityKeychainListMock(true);
+            initialKeychains.stream().map(Keychain::name).forEach(securityMock.keychainNames()::add);
+
+            Consumer<List<Keychain>> workload = keychains -> {
+                assertEquals(requestedKeychains, keychains);
+                if (isRequired && current != null) {
+                    assertEquals(parseKeychainList(current), securityMock.keychains());
+                } else {
+                    assertEquals(initialKeychains, securityMock.keychains());
+                }
+            };
+
+            Globals.main(toSupplier(() -> {
+                Globals.instance().setProperty(ActiveKeychainList.class, isRequired);
+
+                securityMock.applyToGlobals();
+                ActiveKeychainList.withKeychains(workload, requestedKeychains);
+
+                assertEquals(initialKeychains, securityMock.keychains());
+
+                if (requestedKeychains.size() == 1) {
+                    securityMock.applyToGlobals();
+                    ActiveKeychainList.withKeychain(keychain -> {
+                        workload.accept(List.of(keychain));
+                    }, requestedKeychains.getFirst());
+
+                    assertEquals(initialKeychains, securityMock.keychains());
+                }
+
+                return 0;
+            }));
+        }
+    }
+
+    /**
+     * Mocks "/usr/bin/security list-keychain" command.
+     */
+    record SecurityKeychainListMock(List<String> keychainNames, boolean isReadAllowed) implements CommandAction {
+
+        SecurityKeychainListMock {
+            Objects.requireNonNull(keychainNames);
+        }
+
+        SecurityKeychainListMock(boolean isReadAllowed) {
+            this(new ArrayList<>(), isReadAllowed);
+        }
+
+        List<Keychain> keychains() {
+            return keychainNames.stream().map(Keychain::new).toList();
+        }
+
+        void applyToGlobals() {
+            CommandActionSpec actionSpec = CommandActionSpec.create("/usr/bin/security", this);
+
+            var script = Script.build()
+                    .commandMockBuilderMutator(mockBuilder -> {
+                        // Limit the number of times the mock can be executed.
+                        // It should be one or twice.
+                        // Once, when ActiveKeychainList is constructed such that it doesn't read
+                        // the current active keychain list from the "/usr/bin/security" command, but takes it from the parameter.
+                        // Twice, when ActiveKeychainList is constructed such that it read
+                        // the current active keychain list from the "/usr/bin/security" command.
+                        mockBuilder.repeat(isReadAllowed ? 2 : 1);
+                    })
+                    // Replace "/usr/bin/security" with the mock bound to the keychain mock.
+                    .map(new CommandMockSpec(actionSpec.description(), "security-list-keychain", CommandActionSpecs.build().action(actionSpec).create()))
+                    .createLoop();
+
+            JPackageMockUtils.buildJPackage()
+                    .script(script)
+                    .listener(System.out::println)
+                    .applyToGlobals();
+        }
+
+        @Override
+        public Optional<Integer> run(Context context) throws Exception, MockIllegalStateException {
+            final var origContext = context;
+
+            if (!context.args().getFirst().equals("list-keychains")) {
+                throw origContext.unexpectedArguments();
+            }
+
+            context = context.shift();
+
+            if (context.args().isEmpty()) {
+                if (isReadAllowed) {
+                    keychainNames.stream().map(k -> {
+                        return new StringBuilder().append('"').append(k).append('"').toString();
+                    }).forEach(context::printlnOut);
+                } else {
+                    throw origContext.unexpectedArguments();
+                }
+            } else if (context.args().getFirst().equals("-s")) {
+                keychainNames.clear();
+                keychainNames.addAll(context.shift().args());
+            } else {
+                throw origContext.unexpectedArguments();
+            }
+
+            return Optional.of(0);
+        }
+    }
+
+    private static List<Keychain> parseKeychainList(String str) {
+        return str.chars().mapToObj(chr -> {
+            return new StringBuilder().append((char)chr).toString();
+        }).map(Keychain::new).toList();
+    }
+}
diff --git a/test/jdk/tools/jpackage/junit/macosx/jdk.jpackage/jdk/jpackage/internal/MacDmgPackagerTest.java b/test/jdk/tools/jpackage/junit/macosx/jdk.jpackage/jdk/jpackage/internal/MacDmgPackagerTest.java
index 0e4893c8a06..3b71d53e2db 100644
--- a/test/jdk/tools/jpackage/junit/macosx/jdk.jpackage/jdk/jpackage/internal/MacDmgPackagerTest.java
+++ b/test/jdk/tools/jpackage/junit/macosx/jdk.jpackage/jdk/jpackage/internal/MacDmgPackagerTest.java
@@ -175,13 +175,12 @@ public class MacDmgPackagerTest {
 
     private static void runPackagingMock(Path workDir, MacDmgSystemEnvironment sysEnv) {
 
-        var app = new ApplicationBuilder()
+        var appBuilder = new ApplicationBuilder()
                 .appImageLayout(MacPackagingPipeline.APPLICATION_LAYOUT)
                 .runtimeBuilder(createRuntimeBuilder())
-                .name("foo")
-                .create();
+                .name("foo");
 
-        var macApp = new MacApplicationBuilder(app).create();
+        var macApp = new MacApplicationBuilder(appBuilder).create();
 
         var macDmgPkg = new MacDmgPackageBuilder(new MacPackageBuilder(new PackageBuilder(macApp, MAC_DMG))).create();
 
diff --git a/test/jdk/tools/jpackage/junit/macosx/junit.java b/test/jdk/tools/jpackage/junit/macosx/junit.java
index 2253211add0..4ab05daf1ae 100644
--- a/test/jdk/tools/jpackage/junit/macosx/junit.java
+++ b/test/jdk/tools/jpackage/junit/macosx/junit.java
@@ -52,3 +52,14 @@
  *    jdk/jpackage/internal/MacDmgPackagerTest.java
  * @run junit jdk.jpackage/jdk.jpackage.internal.MacDmgPackagerTest
  */
+
+/* @test
+ * @summary Test ActiveKeychainListTest
+ * @requires (os.family == "mac")
+ * @library /test/jdk/tools/jpackage/helpers
+ * @build jdk.jpackage.test.mock.*
+ * @build jdk.jpackage.test.stdmock.*
+ * @compile/module=jdk.jpackage -Xlint:all -Werror
+ *    jdk/jpackage/internal/ActiveKeychainListTest.java
+ * @run junit jdk.jpackage/jdk.jpackage.internal.ActiveKeychainListTest
+ */
diff --git a/test/jdk/tools/jpackage/share/ErrorTest.java b/test/jdk/tools/jpackage/share/ErrorTest.java
index b325c02f039..db87263884b 100644
--- a/test/jdk/tools/jpackage/share/ErrorTest.java
+++ b/test/jdk/tools/jpackage/share/ErrorTest.java
@@ -140,11 +140,9 @@ public final class ErrorTest {
             var appImageDir = (Path)APP_IMAGE.expand(cmd).orElseThrow();
             // Replace the default Info.plist file with an empty one.
             var plistFile = new MacBundle(appImageDir).infoPlistFile();
-            TKit.trace(String.format("Create invalid plist file in [%s]", plistFile));
+            TKit.trace(String.format("Create invalid plist file [%s]", plistFile));
             createXml(plistFile, xml -> {
                 writePList(xml, toXmlConsumer(() -> {
-                    writeDict(xml, toXmlConsumer(() -> {
-                    }));
                 }));
             });
             return appImageDir;
diff --git a/test/jdk/tools/jpackage/share/RuntimePackageTest.java b/test/jdk/tools/jpackage/share/RuntimePackageTest.java
index 6cc668f94f9..a18efce62c6 100644
--- a/test/jdk/tools/jpackage/share/RuntimePackageTest.java
+++ b/test/jdk/tools/jpackage/share/RuntimePackageTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -86,7 +86,12 @@ public class RuntimePackageTest {
 
     @Test(ifOS = MACOS)
     public static void testFromBundle() {
-        init(MacHelper::createRuntimeBundle).run();
+        init(() -> {
+            return MacHelper.buildRuntimeBundle().mutator(cmd -> {
+                // Set custom version in the Info.plist file of the predefined runtime bundle.
+                cmd.addArguments("--app-version", "17.52");
+            }).create();
+        }).run();
     }
 
     @Test(ifOS = LINUX)

From 6808ba2e05b8dba6c28ee21d4c415a81a950f5c1 Mon Sep 17 00:00:00 2001
From: William Kemper <wkemper@openjdk.org>
Date: Tue, 10 Mar 2026 00:21:47 +0000
Subject: [PATCH 115/655] 8378293: GenShen: Simplify selection of aged regions

Reviewed-by: kdnilsen, ysr
---
 .../shenandoahGenerationalHeuristics.cpp      | 170 ++++++------------
 .../shenandoahGenerationalHeuristics.hpp      |  11 +-
 .../heuristics/shenandoahGlobalHeuristics.cpp |   2 +-
 .../heuristics/shenandoahHeuristics.cpp       |  33 ++--
 .../heuristics/shenandoahHeuristics.hpp       |   2 +
 .../heuristics/shenandoahYoungHeuristics.cpp  |  20 +--
 .../heuristics/shenandoahYoungHeuristics.hpp  |   3 +-
 .../gc/shenandoah/shenandoahCollectionSet.cpp |   1 -
 .../gc/shenandoah/shenandoahCollectionSet.hpp |  22 ---
 .../shenandoahCollectionSetPreselector.hpp    |  51 ------
 .../shenandoah/shenandoahInPlacePromoter.cpp  |  43 ++---
 .../shenandoah/shenandoahInPlacePromoter.hpp  |  67 ++++++-
 12 files changed, 160 insertions(+), 265 deletions(-)
 delete mode 100644 src/hotspot/share/gc/shenandoah/shenandoahCollectionSetPreselector.hpp

diff --git a/src/hotspot/share/gc/shenandoah/heuristics/shenandoahGenerationalHeuristics.cpp b/src/hotspot/share/gc/shenandoah/heuristics/shenandoahGenerationalHeuristics.cpp
index f3d31b8d0e1..4b665501d71 100644
--- a/src/hotspot/share/gc/shenandoah/heuristics/shenandoahGenerationalHeuristics.cpp
+++ b/src/hotspot/share/gc/shenandoah/heuristics/shenandoahGenerationalHeuristics.cpp
@@ -25,7 +25,6 @@
 
 #include "gc/shenandoah/heuristics/shenandoahGenerationalHeuristics.hpp"
 #include "gc/shenandoah/shenandoahCollectionSet.hpp"
-#include "gc/shenandoah/shenandoahCollectionSetPreselector.hpp"
 #include "gc/shenandoah/shenandoahCollectorPolicy.hpp"
 #include "gc/shenandoah/shenandoahGeneration.hpp"
 #include "gc/shenandoah/shenandoahGenerationalHeap.inline.hpp"
@@ -76,20 +75,19 @@ ShenandoahGenerationalHeuristics::ShenandoahGenerationalHeuristics(ShenandoahGen
 }
 
 void ShenandoahGenerationalHeuristics::choose_collection_set(ShenandoahCollectionSet* collection_set) {
-  ShenandoahHeap* heap = ShenandoahHeap::heap();
+  ShenandoahGenerationalHeap* heap = ShenandoahGenerationalHeap::heap();
+
+  assert(collection_set->is_empty(), "Collection set must be empty here");
 
   _add_regions_to_old = 0;
-
-  // Seed the collection set with resource area-allocated
-  // preselected regions, which are removed when we exit this scope.
-  ShenandoahCollectionSetPreselector preselector(collection_set, heap->num_regions());
+  ShenandoahInPlacePromotionPlanner in_place_promotions(heap);
 
   // Find the amount that will be promoted, regions that will be promoted in
   // place, and preselected older regions that will be promoted by evacuation.
-  compute_evacuation_budgets(heap);
+  compute_evacuation_budgets(in_place_promotions, heap);
 
   // Choose the collection set, including the regions preselected above for promotion into the old generation.
-  filter_regions(collection_set);
+  filter_regions(in_place_promotions, collection_set);
 
   // Even if collection_set->is_empty(), we want to adjust budgets, making reserves available to mutator.
   adjust_evacuation_budgets(heap, collection_set);
@@ -108,7 +106,8 @@ void ShenandoahGenerationalHeuristics::choose_collection_set(ShenandoahCollectio
   }
 }
 
-void ShenandoahGenerationalHeuristics::compute_evacuation_budgets(ShenandoahHeap* const heap) {
+void ShenandoahGenerationalHeuristics::compute_evacuation_budgets(ShenandoahInPlacePromotionPlanner& in_place_promotions,
+                                                                  ShenandoahHeap* const heap) {
   shenandoah_assert_generational();
 
   ShenandoahOldGeneration* const old_generation = heap->old_generation();
@@ -206,7 +205,7 @@ void ShenandoahGenerationalHeuristics::compute_evacuation_budgets(ShenandoahHeap
   // If is_global(), we let garbage-first heuristic determine cset membership.  Otherwise, we give priority
   // to tenurable regions by preselecting regions for promotion by evacuation (obtaining the live data to seed promoted_reserve).
   // This also identifies regions that will be promoted in place. These use the tenuring threshold.
-  const size_t consumed_by_advance_promotion = select_aged_regions(_generation->is_global()? 0: old_promo_reserve);
+  const size_t consumed_by_advance_promotion = select_aged_regions(in_place_promotions, _generation->is_global()? 0: old_promo_reserve);
   assert(consumed_by_advance_promotion <= old_promo_reserve, "Do not promote more than budgeted");
 
   // The young evacuation reserve can be no larger than young_unaffiliated.  Planning to evacuate into partially consumed
@@ -230,24 +229,21 @@ void ShenandoahGenerationalHeuristics::compute_evacuation_budgets(ShenandoahHeap
   // case of a GLOBAL gc.  During choose_collection_set() of GLOBAL, old will be expanded on demand.
 }
 
-void ShenandoahGenerationalHeuristics::filter_regions(ShenandoahCollectionSet* collection_set) {
-  assert(collection_set->is_empty(), "Must be empty");
-
+void ShenandoahGenerationalHeuristics::filter_regions(ShenandoahInPlacePromotionPlanner& in_place_promotions,
+                                                      ShenandoahCollectionSet* collection_set) {
   auto heap = ShenandoahGenerationalHeap::heap();
-  size_t region_size_bytes = ShenandoahHeapRegion::region_size_bytes();
-
+  const size_t region_size_bytes = ShenandoahHeapRegion::region_size_bytes();
 
   // Check all pinned regions have updated status before choosing the collection set.
   heap->assert_pinned_region_status(_generation);
 
   // Step 1. Build up the region candidates we care about, rejecting losers and accepting winners right away.
 
-  size_t num_regions = heap->num_regions();
+  const size_t num_regions = heap->num_regions();
 
   RegionData* candidates = _region_data;
 
   size_t cand_idx = 0;
-  size_t preselected_candidates = 0;
 
   size_t total_garbage = 0;
 
@@ -257,23 +253,12 @@ void ShenandoahGenerationalHeuristics::filter_regions(ShenandoahCollectionSet* c
   size_t free = 0;
   size_t free_regions = 0;
 
-  // This counts number of humongous regions that we intend to promote in this cycle.
-  size_t humongous_regions_promoted = 0;
-  // This counts number of regular regions that will be promoted in place.
-  size_t regular_regions_promoted_in_place = 0;
-  // This counts bytes of memory used by regular regions to be promoted in place.
-  size_t regular_regions_promoted_usage = 0;
-  // This counts bytes of memory free in regular regions to be promoted in place.
-  size_t regular_regions_promoted_free = 0;
-  // This counts bytes of garbage memory in regular regions to be promoted in place.
-  size_t regular_regions_promoted_garbage = 0;
-
   for (size_t i = 0; i < num_regions; i++) {
     ShenandoahHeapRegion* region = heap->get_region(i);
     if (!_generation->contains(region)) {
       continue;
     }
-    size_t garbage = region->garbage();
+    const size_t garbage = region->garbage();
     total_garbage += garbage;
     if (region->is_empty()) {
       free_regions++;
@@ -285,85 +270,48 @@ void ShenandoahGenerationalHeuristics::filter_regions(ShenandoahCollectionSet* c
         immediate_garbage += garbage;
         region->make_trash_immediate();
       } else {
-        bool is_candidate;
-        // This is our candidate for later consideration.
-        if (collection_set->is_preselected(i)) {
-          assert(heap->is_tenurable(region), "Preselection filter");
-          is_candidate = true;
-          preselected_candidates++;
-          // Set garbage value to maximum value to force this into the sorted collection set.
-          garbage = region_size_bytes;
+        if (collection_set->is_in(i)) {
+          assert(heap->is_tenurable(region), "Preselected region %zu must be tenurable", i);
         } else if (region->is_young() && heap->is_tenurable(region)) {
           // Note that for GLOBAL GC, region may be OLD, and OLD regions do not qualify for pre-selection
 
-          // This region is old enough to be promoted but it was not preselected, either because its garbage is below
-          // old garbage threshold so it will be promoted in place, or because there is not sufficient room
-          // in old gen to hold the evacuated copies of this region's live data.  In both cases, we choose not to
+          // This region is old enough to be promoted, but it was not preselected, either because its garbage is below
+          // old garbage threshold so it will be promoted in place, or because there is insufficient room
+          // in old gen to hold the evacuated copies of this region's live data.  In either case, we choose not to
           // place this region into the collection set.
-          if (region->get_top_before_promote() != nullptr) {
-            // Region was included for promotion-in-place
-            regular_regions_promoted_in_place++;
-            regular_regions_promoted_usage += region->used_before_promote();
-            regular_regions_promoted_free += region->free();
-            regular_regions_promoted_garbage += region->garbage();
-          }
-          is_candidate = false;
         } else {
-          is_candidate = true;
-        }
-        if (is_candidate) {
+          // This is our candidate for later consideration.
+          assert(region->get_top_before_promote() == nullptr, "Cannot add region %zu scheduled for in-place-promotion to the collection set", i);
           candidates[cand_idx].set_region_and_garbage(region, garbage);
           cand_idx++;
         }
       }
     } else if (region->is_humongous_start()) {
       // Reclaim humongous regions here, and count them as the immediate garbage
-#ifdef ASSERT
-      bool reg_live = region->has_live();
-      bool bm_live = _generation->complete_marking_context()->is_marked(cast_to_oop(region->bottom()));
-      assert(reg_live == bm_live,
-             "Humongous liveness and marks should agree. Region live: %s; Bitmap live: %s; Region Live Words: %zu",
-             BOOL_TO_STR(reg_live), BOOL_TO_STR(bm_live), region->get_live_data_words());
-#endif
+      DEBUG_ONLY(assert_humongous_mark_consistency(region));
       if (!region->has_live()) {
         heap->trash_humongous_region_at(region);
 
         // Count only the start. Continuations would be counted on "trash" path
         immediate_regions++;
         immediate_garbage += garbage;
-      } else {
-        if (region->is_young() && heap->is_tenurable(region)) {
-          oop obj = cast_to_oop(region->bottom());
-          size_t humongous_regions = ShenandoahHeapRegion::required_regions(obj->size() * HeapWordSize);
-          humongous_regions_promoted += humongous_regions;
-        }
       }
     } else if (region->is_trash()) {
-      // Count in just trashed collection set, during coalesced CM-with-UR
+      // Count in just trashed humongous continuation regions
       immediate_regions++;
       immediate_garbage += garbage;
     }
   }
-  heap->old_generation()->set_expected_humongous_region_promotions(humongous_regions_promoted);
-  heap->old_generation()->set_expected_regular_region_promotions(regular_regions_promoted_in_place);
-  log_info(gc, ergo)("Planning to promote in place %zu humongous regions and %zu"
-                     " regular regions, spanning a total of %zu used bytes",
-                     humongous_regions_promoted, regular_regions_promoted_in_place,
-                     humongous_regions_promoted * ShenandoahHeapRegion::region_size_bytes() +
-                     regular_regions_promoted_usage);
 
   // Step 2. Look back at garbage statistics, and decide if we want to collect anything,
   // given the amount of immediately reclaimable garbage. If we do, figure out the collection set.
+  assert(immediate_garbage <= total_garbage,
+         "Cannot have more immediate garbage than total garbage: " PROPERFMT " vs " PROPERFMT,
+         PROPERFMTARGS(immediate_garbage), PROPERFMTARGS(total_garbage));
 
-  assert (immediate_garbage <= total_garbage,
-          "Cannot have more immediate garbage than total garbage: %zu%s vs %zu%s",
-          byte_size_in_proper_unit(immediate_garbage), proper_unit_for_byte_size(immediate_garbage),
-          byte_size_in_proper_unit(total_garbage), proper_unit_for_byte_size(total_garbage));
-
-  size_t immediate_percent = (total_garbage == 0) ? 0 : (immediate_garbage * 100 / total_garbage);
-  bool doing_promote_in_place = (humongous_regions_promoted + regular_regions_promoted_in_place > 0);
-
-  if (doing_promote_in_place || (preselected_candidates > 0) || (immediate_percent <= ShenandoahImmediateThreshold)) {
+  const size_t immediate_percent = (total_garbage == 0) ? 0 : (immediate_garbage * 100 / total_garbage);
+  const bool has_preselected_regions = !collection_set->is_empty();
+  if (has_preselected_regions || (immediate_percent <= ShenandoahImmediateThreshold)) {
     // Call the subclasses to add young-gen regions into the collection set.
     choose_collection_set_from_regiondata(collection_set, candidates, cand_idx, immediate_garbage + free);
   }
@@ -376,15 +324,15 @@ void ShenandoahGenerationalHeuristics::filter_regions(ShenandoahCollectionSet* c
 
   ShenandoahTracer::report_evacuation_info(collection_set,
                                            free_regions,
-                                           humongous_regions_promoted,
-                                           regular_regions_promoted_in_place,
-                                           regular_regions_promoted_garbage,
-                                           regular_regions_promoted_free,
+                                           in_place_promotions.humongous_region_stats().count,
+                                           in_place_promotions.regular_region_stats().count,
+                                           in_place_promotions.regular_region_stats().garbage,
+                                           in_place_promotions.regular_region_stats().free,
                                            immediate_regions,
                                            immediate_garbage);
 }
 
-// Preselect for inclusion into the collection set all regions whose age is at or above tenure age and for which the
+// Select for inclusion into the collection set all regions whose age is at or above tenure age and for which the
 // garbage percentage exceeds a dynamically adjusted threshold (known as the old-garbage threshold percentage).  We
 // identify these regions by setting the appropriate entry of the collection set's preselected regions array to true.
 // All entries are initialized to false before calling this function.
@@ -400,15 +348,13 @@ void ShenandoahGenerationalHeuristics::filter_regions(ShenandoahCollectionSet* c
 // that this allows us to more accurately budget memory to hold the results of evacuation.  Memory for evacuation
 // of aged regions must be reserved in the old generation.  Memory for evacuation of all other regions must be
 // reserved in the young generation.
-size_t ShenandoahGenerationalHeuristics::select_aged_regions(const size_t old_promotion_reserve) {
+size_t ShenandoahGenerationalHeuristics::select_aged_regions(ShenandoahInPlacePromotionPlanner& in_place_promotions,
+                                                             const size_t old_promotion_reserve) {
 
   // There should be no regions configured for subsequent in-place-promotions carried over from the previous cycle.
   assert_no_in_place_promotions();
 
   auto const heap = ShenandoahGenerationalHeap::heap();
-  ShenandoahFreeSet* free_set = heap->free_set();
-  bool* const candidate_regions_for_promotion_by_copy = heap->collection_set()->preselected_regions();
-  ShenandoahMarkingContext* const ctx = heap->marking_context();
 
   size_t promo_potential = 0;
   size_t candidates = 0;
@@ -421,14 +367,21 @@ size_t ShenandoahGenerationalHeuristics::select_aged_regions(const size_t old_pr
   ResourceMark rm;
   AgedRegionData* sorted_regions = NEW_RESOURCE_ARRAY(AgedRegionData, num_regions);
 
-  ShenandoahInPlacePromotionPlanner in_place_promotions(heap);
-
   for (idx_t i = 0; i < num_regions; i++) {
     ShenandoahHeapRegion* const r = heap->get_region(i);
-    if (r->is_empty() || !r->has_live() || !r->is_young() || !r->is_regular()) {
-      // skip over regions that aren't regular young with some live data
+    if (r->is_empty() || !r->has_live() || !r->is_young()) {
+      // skip over regions that aren't young with some live data
       continue;
     }
+
+    if (!r->is_regular()) {
+      if (r->is_humongous() && heap->is_tenurable(r)) {
+        in_place_promotions.prepare(r);
+      }
+      // Nothing else to be done for humongous regions
+      continue;
+    }
+
     if (heap->is_tenurable(r)) {
       if (in_place_promotions.is_eligible(r)) {
         // We prefer to promote this region in place because it has a small amount of garbage and a large usage.
@@ -470,7 +423,7 @@ size_t ShenandoahGenerationalHeuristics::select_aged_regions(const size_t old_pr
     // Subsequent regions may be selected if they have smaller live data.
   }
 
-  in_place_promotions.update_free_set();
+  in_place_promotions.complete_planning();
 
   // Sort in increasing order according to live data bytes.  Note that candidates represents the number of regions
   // that qualify to be promoted by evacuation.
@@ -485,14 +438,14 @@ size_t ShenandoahGenerationalHeuristics::select_aged_regions(const size_t old_pr
       const size_t promotion_need = (size_t) (region_live_data * ShenandoahPromoEvacWaste);
       if (old_consumed + promotion_need <= old_promotion_reserve) {
         old_consumed += promotion_need;
-        candidate_regions_for_promotion_by_copy[region->index()] = true;
+        heap->collection_set()->add_region(region);
         selected_regions++;
         selected_live += region_live_data;
       } else {
         // We rejected this promotable region from the collection set because we had no room to hold its copy.
         // Add this region to promo potential for next GC.
         promo_potential += region_live_data;
-        assert(!candidate_regions_for_promotion_by_copy[region->index()], "Shouldn't be selected");
+        assert(!heap->collection_set()->is_in(region), "Region %zu shouldn't be in the collection set", region->index());
       }
       // We keep going even if one region is excluded from selection because we need to accumulate all eligible
       // regions that are not preselected into promo_potential
@@ -561,7 +514,7 @@ void ShenandoahGenerationalHeuristics::adjust_evacuation_budgets(ShenandoahHeap*
          young_evacuated_reserve_used, total_young_available);
   young_generation->set_evacuation_reserve(young_evacuated_reserve_used);
 
-  // We have not yet rebuilt the free set.  Some of the memory that is thought to be avaiable within old may no
+  // We have not yet rebuilt the free set.  Some of the memory that is thought to be available within old may no
   // longer be available if that memory had been free within regions that were selected for the collection set.
   // Make the necessary adjustments to old_available.
   size_t old_available =
@@ -640,24 +593,3 @@ void ShenandoahGenerationalHeuristics::adjust_evacuation_budgets(ShenandoahHeap*
   old_generation->set_promoted_reserve(total_promotion_reserve);
   old_generation->reset_promoted_expended();
 }
-
-size_t ShenandoahGenerationalHeuristics::add_preselected_regions_to_collection_set(ShenandoahCollectionSet* cset,
-                                                                                   const RegionData* data,
-                                                                                   size_t size) const {
-  // cur_young_garbage represents the amount of memory to be reclaimed from young-gen.  In the case that live objects
-  // are known to be promoted out of young-gen, we count this as cur_young_garbage because this memory is reclaimed
-  // from young-gen and becomes available to serve future young-gen allocation requests.
-  size_t cur_young_garbage = 0;
-  for (size_t idx = 0; idx < size; idx++) {
-    ShenandoahHeapRegion* r = data[idx].get_region();
-    if (cset->is_preselected(r->index())) {
-      assert(ShenandoahGenerationalHeap::heap()->is_tenurable(r), "Preselected regions must have tenure age");
-      // Entire region will be promoted, This region does not impact young-gen or old-gen evacuation reserve.
-      // This region has been pre-selected and its impact on promotion reserve is already accounted for.
-      cur_young_garbage += r->garbage();
-      cset->add_region(r);
-    }
-  }
-  return cur_young_garbage;
-}
-
diff --git a/src/hotspot/share/gc/shenandoah/heuristics/shenandoahGenerationalHeuristics.hpp b/src/hotspot/share/gc/shenandoah/heuristics/shenandoahGenerationalHeuristics.hpp
index da883d0d26f..248d0de5a26 100644
--- a/src/hotspot/share/gc/shenandoah/heuristics/shenandoahGenerationalHeuristics.hpp
+++ b/src/hotspot/share/gc/shenandoah/heuristics/shenandoahGenerationalHeuristics.hpp
@@ -27,6 +27,7 @@
 
 
 #include "gc/shenandoah/heuristics/shenandoahAdaptiveHeuristics.hpp"
+#include "gc/shenandoah/shenandoahInPlacePromoter.hpp"
 
 class ShenandoahGeneration;
 class ShenandoahHeap;
@@ -53,7 +54,7 @@ public:
 
 private:
   // Compute evacuation budgets prior to choosing collection set.
-  void compute_evacuation_budgets(ShenandoahHeap* const heap);
+  void compute_evacuation_budgets(ShenandoahInPlacePromotionPlanner& in_place_promotions, ShenandoahHeap* const heap);
 
   // Preselect for possible inclusion into the collection set exactly the most
   // garbage-dense regions, including those that satisfy criteria 1 & 2 below,
@@ -70,10 +71,10 @@ private:
   // regions, which are marked in the preselected_regions() indicator
   // array of the heap's collection set, which should be initialized
   // to false.
-  size_t select_aged_regions(const size_t old_promotion_reserve);
+  size_t select_aged_regions(ShenandoahInPlacePromotionPlanner& in_place_promotions, const size_t old_promotion_reserve);
 
   // Filter and sort remaining regions before adding to collection set.
-  void filter_regions(ShenandoahCollectionSet* collection_set);
+  void filter_regions(ShenandoahInPlacePromotionPlanner& in_place_promotions, ShenandoahCollectionSet* collection_set);
 
   // Adjust evacuation budgets after choosing collection set.  The argument regions_to_xfer
   // represents regions to be transferred to old based on decisions made in top_off_collection_set()
@@ -84,10 +85,6 @@ protected:
   ShenandoahGeneration* _generation;
 
   size_t _add_regions_to_old;
-
-  size_t add_preselected_regions_to_collection_set(ShenandoahCollectionSet* cset,
-                                                   const RegionData* data,
-                                                   size_t size) const;
 };
 
 
diff --git a/src/hotspot/share/gc/shenandoah/heuristics/shenandoahGlobalHeuristics.cpp b/src/hotspot/share/gc/shenandoah/heuristics/shenandoahGlobalHeuristics.cpp
index dd2ad28aa4b..142a6c3f047 100644
--- a/src/hotspot/share/gc/shenandoah/heuristics/shenandoahGlobalHeuristics.cpp
+++ b/src/hotspot/share/gc/shenandoah/heuristics/shenandoahGlobalHeuristics.cpp
@@ -127,7 +127,7 @@ void ShenandoahGlobalHeuristics::choose_global_collection_set(ShenandoahCollecti
   size_t cur_garbage = cur_young_garbage;
   for (size_t idx = 0; idx < size; idx++) {
     ShenandoahHeapRegion* r = data[idx].get_region();
-    assert(!cset->is_preselected(r->index()), "There should be no preselected regions during GLOBAL GC");
+    assert(!cset->is_in(r->index()), "Region (%zu) should not be in the collection set", r->index());
     bool add_region = false;
     size_t region_garbage = r->garbage();
     size_t new_garbage = cur_garbage + region_garbage;
diff --git a/src/hotspot/share/gc/shenandoah/heuristics/shenandoahHeuristics.cpp b/src/hotspot/share/gc/shenandoah/heuristics/shenandoahHeuristics.cpp
index 603e00c401d..895088381ee 100644
--- a/src/hotspot/share/gc/shenandoah/heuristics/shenandoahHeuristics.cpp
+++ b/src/hotspot/share/gc/shenandoah/heuristics/shenandoahHeuristics.cpp
@@ -122,13 +122,7 @@ void ShenandoahHeuristics::choose_collection_set(ShenandoahCollectionSet* collec
       }
     } else if (region->is_humongous_start()) {
       // Reclaim humongous regions here, and count them as the immediate garbage
-#ifdef ASSERT
-      bool reg_live = region->has_live();
-      bool bm_live = heap->global_generation()->complete_marking_context()->is_marked(cast_to_oop(region->bottom()));
-      assert(reg_live == bm_live,
-             "Humongous liveness and marks should agree. Region live: %s; Bitmap live: %s; Region Live Words: %zu",
-             BOOL_TO_STR(reg_live), BOOL_TO_STR(bm_live), region->get_live_data_words());
-#endif
+      DEBUG_ONLY(assert_humongous_mark_consistency(region));
       if (!region->has_live()) {
         heap->trash_humongous_region_at(region);
 
@@ -137,7 +131,7 @@ void ShenandoahHeuristics::choose_collection_set(ShenandoahCollectionSet* collec
         immediate_garbage += garbage;
       }
     } else if (region->is_trash()) {
-      // Count in just trashed collection set, during coalesced CM-with-UR
+      // Count in just trashed humongous continuation regions
       immediate_regions++;
       immediate_garbage += garbage;
     }
@@ -145,13 +139,11 @@ void ShenandoahHeuristics::choose_collection_set(ShenandoahCollectionSet* collec
 
   // Step 2. Look back at garbage statistics, and decide if we want to collect anything,
   // given the amount of immediately reclaimable garbage. If we do, figure out the collection set.
+  assert(immediate_garbage <= total_garbage,
+         "Cannot have more immediate garbage than total garbage: " PROPERFMT " vs " PROPERFMT,
+         PROPERFMTARGS(immediate_garbage), PROPERFMTARGS(total_garbage));
 
-  assert (immediate_garbage <= total_garbage,
-          "Cannot have more immediate garbage than total garbage: %zu%s vs %zu%s",
-          byte_size_in_proper_unit(immediate_garbage), proper_unit_for_byte_size(immediate_garbage),
-          byte_size_in_proper_unit(total_garbage),     proper_unit_for_byte_size(total_garbage));
-
-  size_t immediate_percent = (total_garbage == 0) ? 0 : (immediate_garbage * 100 / total_garbage);
+  const size_t immediate_percent = (total_garbage == 0) ? 0 : (immediate_garbage * 100 / total_garbage);
 
   if (immediate_percent <= ShenandoahImmediateThreshold) {
     choose_collection_set_from_regiondata(collection_set, candidates, cand_idx, immediate_garbage + free);
@@ -303,3 +295,16 @@ double ShenandoahHeuristics::elapsed_degenerated_cycle_time() const {
   double now = os::elapsedTime();
   return now - _precursor_cycle_start;
 }
+
+#ifdef ASSERT
+void ShenandoahHeuristics::assert_humongous_mark_consistency(ShenandoahHeapRegion* region) {
+  assert(region->is_humongous(), "Region %zu must be humongous", region->index());
+  const oop humongous_oop = cast_to_oop(region->bottom());
+  ShenandoahGeneration* generation = ShenandoahHeap::heap()->generation_for(region->affiliation());
+  const bool bm_live = generation->complete_marking_context()->is_marked(humongous_oop);
+  const bool reg_live = region->has_live();
+  assert(reg_live == bm_live,
+         "Humongous liveness and marks should agree. Region live: %s; Bitmap live: %s; Region Live Words: %zu",
+         BOOL_TO_STR(reg_live), BOOL_TO_STR(bm_live), region->get_live_data_words());
+}
+#endif
diff --git a/src/hotspot/share/gc/shenandoah/heuristics/shenandoahHeuristics.hpp b/src/hotspot/share/gc/shenandoah/heuristics/shenandoahHeuristics.hpp
index 5bfba4f52d5..9066cdfccac 100644
--- a/src/hotspot/share/gc/shenandoah/heuristics/shenandoahHeuristics.hpp
+++ b/src/hotspot/share/gc/shenandoah/heuristics/shenandoahHeuristics.hpp
@@ -285,6 +285,8 @@ public:
 
   // Format prefix and emit log message indicating a GC cycle hs been triggered
   void log_trigger(const char* fmt, ...) ATTRIBUTE_PRINTF(2, 3);
+
+  DEBUG_ONLY(static void assert_humongous_mark_consistency(ShenandoahHeapRegion* region));
 };
 
 #endif // SHARE_GC_SHENANDOAH_HEURISTICS_SHENANDOAHHEURISTICS_HPP
diff --git a/src/hotspot/share/gc/shenandoah/heuristics/shenandoahYoungHeuristics.cpp b/src/hotspot/share/gc/shenandoah/heuristics/shenandoahYoungHeuristics.cpp
index 09508a1163f..3779f969723 100644
--- a/src/hotspot/share/gc/shenandoah/heuristics/shenandoahYoungHeuristics.cpp
+++ b/src/hotspot/share/gc/shenandoah/heuristics/shenandoahYoungHeuristics.cpp
@@ -54,9 +54,7 @@ void ShenandoahYoungHeuristics::choose_collection_set_from_regiondata(Shenandoah
   // Better select garbage-first regions
   QuickSort::sort<RegionData>(data, size, compare_by_garbage);
 
-  size_t cur_young_garbage = add_preselected_regions_to_collection_set(cset, data, size);
-
-  choose_young_collection_set(cset, data, size, actual_free, cur_young_garbage);
+  choose_young_collection_set(cset, data, size, actual_free);
 
   // Especially when young-gen trigger is expedited in order to finish mixed evacuations, there may not be
   // enough consolidated garbage to make effective use of young-gen evacuation reserve.  If there is still
@@ -70,8 +68,7 @@ void ShenandoahYoungHeuristics::choose_collection_set_from_regiondata(Shenandoah
 
 void ShenandoahYoungHeuristics::choose_young_collection_set(ShenandoahCollectionSet* cset,
                                                             const RegionData* data,
-                                                            size_t size, size_t actual_free,
-                                                            size_t cur_young_garbage) const {
+                                                            size_t size, size_t actual_free) const {
 
   const auto heap = ShenandoahGenerationalHeap::heap();
 
@@ -82,23 +79,20 @@ void ShenandoahYoungHeuristics::choose_young_collection_set(ShenandoahCollection
   // This is young-gen collection or a mixed evacuation.
   // If this is mixed evacuation, the old-gen candidate regions have already been added.
   size_t cur_cset = 0;
+  size_t cur_young_garbage = cset->garbage();
   const size_t max_cset = (size_t) (heap->young_generation()->get_evacuation_reserve() / ShenandoahEvacWaste);
   const size_t free_target = (capacity * ShenandoahMinFreeThreshold) / 100 + max_cset;
   const size_t min_garbage = (free_target > actual_free) ? (free_target - actual_free) : 0;
 
-
   log_info(gc, ergo)(
-          "Adaptive CSet Selection for YOUNG. Max Evacuation: %zu%s, Actual Free: %zu%s.",
-          byte_size_in_proper_unit(max_cset), proper_unit_for_byte_size(max_cset),
-          byte_size_in_proper_unit(actual_free), proper_unit_for_byte_size(actual_free));
+          "Adaptive CSet Selection for YOUNG. Max Evacuation: " PROPERFMT ", Actual Free: " PROPERFMT,
+          PROPERFMTARGS(max_cset), PROPERFMTARGS(actual_free));
 
   for (size_t idx = 0; idx < size; idx++) {
     ShenandoahHeapRegion* r = data[idx].get_region();
-    if (cset->is_preselected(r->index())) {
-      continue;
-    }
+    assert(!cset->is_in(r), "Region %zu should not already be in the collection set", idx);
 
-    // Note that we do not add tenurable regions if they were not pre-selected.  They were not preselected
+    // Note that we do not add tenurable regions if they were not pre-selected.  They were not selected
     // because there is insufficient room in old-gen to hold their to-be-promoted live objects or because
     // they are to be promoted in place.
     if (!heap->is_tenurable(r)) {
diff --git a/src/hotspot/share/gc/shenandoah/heuristics/shenandoahYoungHeuristics.hpp b/src/hotspot/share/gc/shenandoah/heuristics/shenandoahYoungHeuristics.hpp
index b9d64059680..806cef673d5 100644
--- a/src/hotspot/share/gc/shenandoah/heuristics/shenandoahYoungHeuristics.hpp
+++ b/src/hotspot/share/gc/shenandoah/heuristics/shenandoahYoungHeuristics.hpp
@@ -49,8 +49,7 @@ public:
 private:
   void choose_young_collection_set(ShenandoahCollectionSet* cset,
                                    const RegionData* data,
-                                   size_t size, size_t actual_free,
-                                   size_t cur_young_garbage) const;
+                                   size_t size, size_t actual_free) const;
 
 };
 
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahCollectionSet.cpp b/src/hotspot/share/gc/shenandoah/shenandoahCollectionSet.cpp
index 54ab7801ca9..d2a489a15be 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahCollectionSet.cpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahCollectionSet.cpp
@@ -49,7 +49,6 @@ ShenandoahCollectionSet::ShenandoahCollectionSet(ShenandoahHeap* heap, ReservedS
   _live(0),
   _region_count(0),
   _old_garbage(0),
-  _preselected_regions(nullptr),
   _young_available_bytes_collected(0),
   _old_available_bytes_collected(0),
   _current_index(0) {
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahCollectionSet.hpp b/src/hotspot/share/gc/shenandoah/shenandoahCollectionSet.hpp
index 87b4597c93f..7722423709d 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahCollectionSet.hpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahCollectionSet.hpp
@@ -36,13 +36,6 @@
 
 class ShenandoahCollectionSet : public CHeapObj<mtGC> {
   friend class ShenandoahHeap;
-  friend class ShenandoahCollectionSetPreselector;
-
-  void establish_preselected(bool *preselected) {
-   assert(_preselected_regions == nullptr, "Over-writing");
-   _preselected_regions = preselected;
-  }
-  void abandon_preselected() { _preselected_regions = nullptr; }
 
 private:
   size_t const          _map_size;
@@ -67,11 +60,6 @@ private:
   // How many bytes of old garbage are present in a mixed collection set?
   size_t                _old_garbage;
 
-  // Points to array identifying which tenure-age regions have been preselected
-  // for inclusion in collection set. This field is only valid during brief
-  // spans of time while collection set is being constructed.
-  bool*                 _preselected_regions;
-
   // When a region having memory available to be allocated is added to the collection set, the region's available memory
   // should be subtracted from what's available.
   size_t                _young_available_bytes_collected;
@@ -132,16 +120,6 @@ public:
   // Returns the amount of garbage in old regions in the collection set.
   inline size_t get_old_garbage() const;
 
-  bool is_preselected(size_t region_idx) {
-    assert(_preselected_regions != nullptr, "Missing establish after abandon");
-    return _preselected_regions[region_idx];
-  }
-
-  bool* preselected_regions() {
-    assert(_preselected_regions != nullptr, "Null ptr");
-    return _preselected_regions;
-  }
-
   bool has_old_regions() const { return _has_old_regions; }
   size_t used()          const { return _used; }
   size_t live()          const { return _live; }
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahCollectionSetPreselector.hpp b/src/hotspot/share/gc/shenandoah/shenandoahCollectionSetPreselector.hpp
deleted file mode 100644
index b78259dd85b..00000000000
--- a/src/hotspot/share/gc/shenandoah/shenandoahCollectionSetPreselector.hpp
+++ /dev/null
@@ -1,51 +0,0 @@
-/*
- * Copyright Amazon.com Inc. or its affiliates. All Rights Reserved.
- * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
- *
- * This code is free software; you can redistribute it and/or modify it
- * under the terms of the GNU General Public License version 2 only, as
- * published by the Free Software Foundation.
- *
- * This code is distributed in the hope that it will be useful, but WITHOUT
- * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
- * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
- * version 2 for more details (a copy is included in the LICENSE file that
- * accompanied this code).
- *
- * You should have received a copy of the GNU General Public License version
- * 2 along with this work; if not, write to the Free Software Foundation,
- * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
- *
- * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
- * or visit www.oracle.com if you need additional information or have any
- * questions.
- *
- */
-
-#ifndef SHARE_GC_SHENANDOAH_SHENANDOAHCOLLECTIONSETPRESELECTOR_HPP
-#define SHARE_GC_SHENANDOAH_SHENANDOAHCOLLECTIONSETPRESELECTOR_HPP
-
-#include "gc/shenandoah/shenandoahCollectionSet.hpp"
-#include "memory/resourceArea.hpp"
-
-class ShenandoahCollectionSetPreselector : public StackObj {
-  ShenandoahCollectionSet* _cset;
-  bool* _pset;
-  ResourceMark _rm;
-
-public:
-  ShenandoahCollectionSetPreselector(ShenandoahCollectionSet* cset, size_t num_regions):
-    _cset(cset) {
-    _pset = NEW_RESOURCE_ARRAY(bool, num_regions);
-    for (unsigned int i = 0; i < num_regions; i++) {
-        _pset[i] = false;
-    }
-    _cset->establish_preselected(_pset);
-  }
-
-  ~ShenandoahCollectionSetPreselector() {
-    _cset->abandon_preselected();
-  }
-};
-
-#endif // SHARE_GC_SHENANDOAH_SHENANDOAHCOLLECTIONSETPRESELECTOR_HPP
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahInPlacePromoter.cpp b/src/hotspot/share/gc/shenandoah/shenandoahInPlacePromoter.cpp
index 83f4217df83..4a15401250c 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahInPlacePromoter.cpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahInPlacePromoter.cpp
@@ -26,38 +26,11 @@
 #include "gc/shenandoah/shenandoahFreeSet.hpp"
 #include "gc/shenandoah/shenandoahGenerationalHeap.inline.hpp"
 #include "gc/shenandoah/shenandoahHeap.inline.hpp"
-#include "gc/shenandoah/shenandoahHeapRegion.inline.hpp"
 #include "gc/shenandoah/shenandoahInPlacePromoter.hpp"
 #include "gc/shenandoah/shenandoahMarkingContext.hpp"
 #include "gc/shenandoah/shenandoahOldGeneration.hpp"
 #include "gc/shenandoah/shenandoahYoungGeneration.hpp"
 
-ShenandoahInPlacePromotionPlanner::RegionPromotions::RegionPromotions(ShenandoahFreeSet* free_set)
-  : _low_idx(free_set->max_regions())
-  , _high_idx(-1)
-  , _regions(0)
-  , _bytes(0)
-  , _free_set(free_set)
-{
-}
-
-void ShenandoahInPlacePromotionPlanner::RegionPromotions::increment(idx_t region_index, size_t remnant_bytes) {
-  if (region_index < _low_idx) {
-    _low_idx = region_index;
-  }
-  if (region_index > _high_idx) {
-    _high_idx = region_index;
-  }
-  _regions++;
-  _bytes += remnant_bytes;
-}
-
-void ShenandoahInPlacePromotionPlanner::RegionPromotions::update_free_set(ShenandoahFreeSetPartitionId partition_id) const {
-  if (_regions > 0) {
-    _free_set->shrink_interval_if_range_modifies_either_boundary(partition_id, _low_idx, _high_idx, _regions);
-  }
-}
-
 ShenandoahInPlacePromotionPlanner::ShenandoahInPlacePromotionPlanner(const ShenandoahGenerationalHeap* heap)
   : _old_garbage_threshold(ShenandoahHeapRegion::region_size_bytes() * heap->old_generation()->heuristics()->get_old_garbage_threshold() / 100)
   , _pip_used_threshold(ShenandoahHeapRegion::region_size_bytes() * ShenandoahGenerationalMinPIPUsage / 100)
@@ -86,6 +59,14 @@ void ShenandoahInPlacePromotionPlanner::prepare(ShenandoahHeapRegion* r) {
     return;
   }
 
+  if (r->is_humongous()) {
+    // Nothing else to do for humongous, we just update the stats and move on. The humongous regions
+    // themselves will be discovered and promoted by gc workers during evacuation.
+    _pip_humongous_stats.update(r);
+    return;
+  }
+
+  _pip_regular_stats.update(r);
   // No allocations from this region have been made during concurrent mark. It meets all the criteria
   // for in-place-promotion. Though we only need the value of top when we fill the end of the region,
   // we use this field to indicate that this region should be promoted in place during the evacuation
@@ -128,8 +109,14 @@ void ShenandoahInPlacePromotionPlanner::prepare(ShenandoahHeapRegion* r) {
   }
 }
 
-void ShenandoahInPlacePromotionPlanner::update_free_set() const {
+void ShenandoahInPlacePromotionPlanner::complete_planning() const {
   _heap->old_generation()->set_pad_for_promote_in_place(_pip_padding_bytes);
+  _heap->old_generation()->set_expected_humongous_region_promotions(_pip_humongous_stats.count);
+  _heap->old_generation()->set_expected_regular_region_promotions(_pip_regular_stats.count);
+  log_info(gc, ergo)("Planning to promote in place %zu humongous regions and %zu"
+                     " regular regions, spanning a total of %zu used bytes",
+                     _pip_humongous_stats.count, _pip_regular_stats.count,
+                     _pip_humongous_stats.usage + _pip_regular_stats.usage);
 
   if (_mutator_regions._regions + _collector_regions._regions > 0) {
     _free_set->account_for_pip_regions(_mutator_regions._regions, _mutator_regions._bytes,
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahInPlacePromoter.hpp b/src/hotspot/share/gc/shenandoah/shenandoahInPlacePromoter.hpp
index 939107dd3ac..2e7e19ee26e 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahInPlacePromoter.hpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahInPlacePromoter.hpp
@@ -25,16 +25,21 @@
 #ifndef SHARE_GC_SHENANDOAH_SHENANDOAHINPLACEPROMOTER_HPP
 #define SHARE_GC_SHENANDOAH_SHENANDOAHINPLACEPROMOTER_HPP
 
+#include "gc/shenandoah/shenandoahFreeSet.hpp"
+#include "gc/shenandoah/shenandoahHeapRegion.inline.hpp"
 #include "gc/shenandoah/shenandoahSimpleBitMap.hpp"
 
-class ShenandoahFreeSet;
 class ShenandoahMarkingContext;
 class ShenandoahGenerationalHeap;
-class ShenandoahHeapRegion;
 
+// This class is responsible for identifying regions that can be
+// promoted in place. It also prepares these regions by preventing
+// them from being used for allocations. Finally, it notifies the
+// freeset which regions are to be promoted in place.
 class ShenandoahInPlacePromotionPlanner {
   using idx_t = ShenandoahSimpleBitMap::idx_t;
 
+  // Used to inform free set of regions being promoted
   struct RegionPromotions {
     idx_t _low_idx;
     idx_t _high_idx;
@@ -42,9 +47,47 @@ class ShenandoahInPlacePromotionPlanner {
     size_t _bytes;
     ShenandoahFreeSet* _free_set;
 
-    explicit RegionPromotions(ShenandoahFreeSet* free_set);
-    void increment(idx_t region_index, size_t remnant_bytes);
-    void update_free_set(ShenandoahFreeSetPartitionId partition_id) const;
+    explicit RegionPromotions(ShenandoahFreeSet* free_set)
+      : _low_idx(free_set->max_regions())
+      , _high_idx(-1)
+      , _regions(0)
+      , _bytes(0)
+      , _free_set(free_set)
+    {
+    }
+
+    void increment(idx_t region_index, size_t remnant_bytes) {
+      if (region_index < _low_idx) {
+        _low_idx = region_index;
+      }
+      if (region_index > _high_idx) {
+        _high_idx = region_index;
+      }
+      _regions++;
+      _bytes += remnant_bytes;
+    }
+
+    void update_free_set(ShenandoahFreeSetPartitionId partition_id) const {
+      if (_regions > 0) {
+        _free_set->shrink_interval_if_range_modifies_either_boundary(partition_id, _low_idx, _high_idx, _regions);
+      }
+    }
+  };
+
+  // Used to track metrics about the regions being promoted in place
+  struct RegionPromotionStats {
+    size_t count;
+    size_t usage;
+    size_t free;
+    size_t garbage;
+
+    RegionPromotionStats() : count(0), usage(0), free(0), garbage(0) {}
+    void update(ShenandoahHeapRegion* region) {
+      count++;
+      usage += region->used();
+      free += region->free();
+      garbage += region->garbage();
+    }
   };
 
   const size_t _old_garbage_threshold;
@@ -60,6 +103,11 @@ class ShenandoahInPlacePromotionPlanner {
 
   // Tracks the padding of space above top in regions eligible for promotion in place
   size_t _pip_padding_bytes;
+
+  // Tracks stats for in place promotions
+  RegionPromotionStats _pip_regular_stats;
+  RegionPromotionStats _pip_humongous_stats;
+
 public:
   explicit ShenandoahInPlacePromotionPlanner(const ShenandoahGenerationalHeap* heap);
 
@@ -69,12 +117,17 @@ public:
   // Prepares the region for promotion by moving top to the end to prevent allocations
   void prepare(ShenandoahHeapRegion* region);
 
-  // Notifies the free set of in place promotions
-  void update_free_set() const;
+  // Notifies the free set and old generation of in place promotions
+  void complete_planning() const;
+
+  const RegionPromotionStats& regular_region_stats() const   { return _pip_regular_stats; }
+  const RegionPromotionStats& humongous_region_stats() const { return _pip_humongous_stats; }
 
   size_t old_garbage_threshold() const { return _old_garbage_threshold; }
 };
 
+// For regions that have been selected and prepared for promotion, this class
+// will perform the actual promotion.
 class ShenandoahInPlacePromoter {
   ShenandoahGenerationalHeap* _heap;
 public:

From 3e9fc5d49e52d79bcd2bb75068ff7efb31f768fd Mon Sep 17 00:00:00 2001
From: wuxinyang <wuxinyang@hygon.cn>
Date: Tue, 10 Mar 2026 02:15:25 +0000
Subject: [PATCH 116/655] 8376164: Optimize AES/ECB implementation using
 full-message intrinsic stub and parallel RoundKey addition

Reviewed-by: sviswanathan, semery
---
 src/hotspot/cpu/x86/stubGenerator_x86_64.hpp  |  15 +-
 .../cpu/x86/stubGenerator_x86_64_aes.cpp      | 200 +++++++++++++++++-
 2 files changed, 212 insertions(+), 3 deletions(-)

diff --git a/src/hotspot/cpu/x86/stubGenerator_x86_64.hpp b/src/hotspot/cpu/x86/stubGenerator_x86_64.hpp
index 36315535d16..64b56442c90 100644
--- a/src/hotspot/cpu/x86/stubGenerator_x86_64.hpp
+++ b/src/hotspot/cpu/x86/stubGenerator_x86_64.hpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -330,6 +330,19 @@ class StubGenerator: public StubCodeGenerator {
 
   void aesecb_decrypt(Register source_addr, Register dest_addr, Register key, Register len);
 
+  // Shared implementation for ECB/AES Encrypt and Decrypt, which does 4 blocks
+  // in a loop at a time to hide instruction latency. Set is_encrypt=true for
+  // encryption, false for decryption.
+  address generate_electronicCodeBook_AESCrypt_Parallel(bool is_encrypt);
+
+  // A version of ECB/AES Encrypt which does 4 blocks in a loop at a time
+  // to hide instruction latency
+  address generate_electronicCodeBook_encryptAESCrypt_Parallel();
+
+  // A version of ECB/AES Decrypt which does 4 blocks in a loop at a time
+  // to hide instruction latency
+  address generate_electronicCodeBook_decryptAESCrypt_Parallel();
+
   // Vector AES Galois Counter Mode implementation
   address generate_galoisCounterMode_AESCrypt();
   void aesgcm_encrypt(Register in, Register len, Register ct, Register out, Register key,
diff --git a/src/hotspot/cpu/x86/stubGenerator_x86_64_aes.cpp b/src/hotspot/cpu/x86/stubGenerator_x86_64_aes.cpp
index 24de32a6fe7..1fa80c9d967 100644
--- a/src/hotspot/cpu/x86/stubGenerator_x86_64_aes.cpp
+++ b/src/hotspot/cpu/x86/stubGenerator_x86_64_aes.cpp
@@ -1,5 +1,5 @@
 /*
-* Copyright (c) 2019, 2025, Intel Corporation. All rights reserved.
+* Copyright (c) 2019, 2026, Intel Corporation. All rights reserved.
 *
 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
 *
@@ -218,6 +218,8 @@ void StubGenerator::generate_aes_stubs() {
       StubRoutines::_galoisCounterMode_AESCrypt = generate_galoisCounterMode_AESCrypt();
     } else {
       StubRoutines::_cipherBlockChaining_decryptAESCrypt = generate_cipherBlockChaining_decryptAESCrypt_Parallel();
+      StubRoutines::_electronicCodeBook_encryptAESCrypt = generate_electronicCodeBook_encryptAESCrypt_Parallel();
+      StubRoutines::_electronicCodeBook_decryptAESCrypt = generate_electronicCodeBook_decryptAESCrypt_Parallel();
       if (VM_Version::supports_avx2()) {
           StubRoutines::_galoisCounterMode_AESCrypt = generate_avx2_galoisCounterMode_AESCrypt();
       }
@@ -1399,6 +1401,200 @@ address StubGenerator::generate_cipherBlockChaining_encryptAESCrypt() {
   return start;
 }
 
+// This is a version of ECB/AES Encrypt/Decrypt which does 4 blocks in a loop
+// at a time to hide instruction latency.
+//
+// For encryption (is_encrypt=true):
+//   pxor key[0], aesenc key[1..rounds-1], aesenclast key[rounds]
+// For decryption (is_encrypt=false):
+//   pxor key[1], aesdec key[2..rounds], aesdeclast key[0]
+//
+// Arguments:
+//
+// Inputs:
+//   c_rarg0   - source byte array address
+//   c_rarg1   - destination byte array address
+//   c_rarg2   - session key (Ke/Kd) in little endian int array
+//   c_rarg3   - input length (must be multiple of blocksize 16)
+//
+// Output:
+//   rax       - input length
+//
+address StubGenerator::generate_electronicCodeBook_AESCrypt_Parallel(bool is_encrypt) {
+  assert(UseAES, "need AES instructions and misaligned SSE support");
+  __ align(CodeEntryAlignment);
+  StubId stub_id = is_encrypt ? StubId::stubgen_electronicCodeBook_encryptAESCrypt_id
+                              : StubId::stubgen_electronicCodeBook_decryptAESCrypt_id;
+  StubCodeMark mark(this, stub_id);
+  address start = __ pc();
+
+  const Register from    = c_rarg0;  // source array address
+  const Register to      = c_rarg1;  // destination array address
+  const Register key     = c_rarg2;  // key array address
+  const Register len_reg = c_rarg3;  // src len (must be multiple of blocksize 16)
+  const Register pos     = rax;
+  const Register keylen  = r11;
+
+  const XMMRegister xmm_result0       = xmm0;
+  const XMMRegister xmm_result1       = xmm1;
+  const XMMRegister xmm_result2       = xmm2;
+  const XMMRegister xmm_result3       = xmm3;
+  const XMMRegister xmm_key_shuf_mask = xmm4;
+  const XMMRegister xmm_key_tmp       = xmm5;
+  // keys 0-9 pre-loaded into xmm6-xmm15
+  const int XMM_REG_NUM_KEY_FIRST = 6;
+  const int XMM_REG_NUM_KEY_LAST  = 15;
+  const XMMRegister xmm_key_first = as_XMMRegister(XMM_REG_NUM_KEY_FIRST);
+
+  // for key_128, key_192, key_256
+  const int ROUNDS[3] = {10, 12, 14};
+
+  Label L_exit;
+  Label L_loop4[3], L_single[3], L_done[3];
+
+#ifdef DoFour
+#undef DoFour
+#endif
+#ifdef DoOne
+#undef DoOne
+#endif
+
+#define DoFour(opc, reg)           \
+__ opc(xmm_result0, reg);         \
+__ opc(xmm_result1, reg);         \
+__ opc(xmm_result2, reg);         \
+__ opc(xmm_result3, reg);
+
+#define DoOne(opc, reg)            \
+__ opc(xmm_result0, reg);
+
+  __ enter(); // required for proper stackwalking of RuntimeStub frame
+  __ push(len_reg); // save original length for return value
+
+  __ movl(keylen, Address(key, arrayOopDesc::length_offset_in_bytes() - arrayOopDesc::base_offset_in_bytes(T_INT)));
+
+  __ movdqu(xmm_key_shuf_mask, ExternalAddress(key_shuffle_mask_addr()), r10 /*rscratch*/);
+  // load up xmm regs 6 thru 15 with keys 0x00 - 0x90
+  for (int rnum = XMM_REG_NUM_KEY_FIRST, offset = 0x00; rnum <= XMM_REG_NUM_KEY_LAST; rnum++, offset += 0x10) {
+    load_key(as_XMMRegister(rnum), key, offset, xmm_key_shuf_mask);
+  }
+  __ xorptr(pos, pos);
+
+  // key length could be only {11, 13, 15} * 4 = {44, 52, 60}
+  __ cmpl(keylen, 52);
+  __ jcc(Assembler::equal, L_loop4[1]);
+  __ cmpl(keylen, 60);
+  __ jcc(Assembler::equal, L_loop4[2]);
+
+  // k == 0: generate code for key_128
+  // k == 1: generate code for key_192
+  // k == 2: generate code for key_256
+  for (int k = 0; k < 3; ++k) {
+    __ align(OptoLoopAlignment);
+    __ BIND(L_loop4[k]);
+    __ cmpptr(len_reg, 4 * AESBlockSize);
+    __ jcc(Assembler::less, L_single[k]);
+
+    __ movdqu(xmm_result0, Address(from, pos, Address::times_1, 0 * AESBlockSize));
+    __ movdqu(xmm_result1, Address(from, pos, Address::times_1, 1 * AESBlockSize));
+    __ movdqu(xmm_result2, Address(from, pos, Address::times_1, 2 * AESBlockSize));
+    __ movdqu(xmm_result3, Address(from, pos, Address::times_1, 3 * AESBlockSize));
+
+    if (is_encrypt) {
+      DoFour(pxor, xmm_key_first);
+      for (int rnum = 1; rnum < 10; rnum++) {
+        DoFour(aesenc, as_XMMRegister(rnum + XMM_REG_NUM_KEY_FIRST));
+      }
+      for (int i = 10; i < ROUNDS[k]; i++) {
+        load_key(xmm_key_tmp, key, i * 0x10, xmm_key_shuf_mask);
+        DoFour(aesenc, xmm_key_tmp);
+      }
+      load_key(xmm_key_tmp, key, ROUNDS[k] * 0x10, xmm_key_shuf_mask);
+      DoFour(aesenclast, xmm_key_tmp);
+    } else {
+      DoFour(pxor, as_XMMRegister(1 + XMM_REG_NUM_KEY_FIRST));
+      for (int rnum = 2; rnum < 10; rnum++) {
+        DoFour(aesdec, as_XMMRegister(rnum + XMM_REG_NUM_KEY_FIRST));
+      }
+      for (int i = 10; i <= ROUNDS[k]; i++) {
+        load_key(xmm_key_tmp, key, i * 0x10, xmm_key_shuf_mask);
+        DoFour(aesdec, xmm_key_tmp);
+      }
+      DoFour(aesdeclast, xmm_key_first);
+    }
+
+    __ movdqu(Address(to, pos, Address::times_1, 0 * AESBlockSize), xmm_result0);
+    __ movdqu(Address(to, pos, Address::times_1, 1 * AESBlockSize), xmm_result1);
+    __ movdqu(Address(to, pos, Address::times_1, 2 * AESBlockSize), xmm_result2);
+    __ movdqu(Address(to, pos, Address::times_1, 3 * AESBlockSize), xmm_result3);
+
+    __ addptr(pos, 4 * AESBlockSize);
+    __ subptr(len_reg, 4 * AESBlockSize);
+    __ jmp(L_loop4[k]);
+
+    __ align(OptoLoopAlignment);
+    __ BIND(L_single[k]);
+    __ cmpptr(len_reg, AESBlockSize);
+    __ jcc(Assembler::less, L_done[k]);
+
+    __ movdqu(xmm_result0, Address(from, pos, Address::times_1, 0));
+
+    if (is_encrypt) {
+      DoOne(pxor, xmm_key_first);
+      for (int rnum = 1; rnum < 10; rnum++) {
+        DoOne(aesenc, as_XMMRegister(rnum + XMM_REG_NUM_KEY_FIRST));
+      }
+      for (int i = 10; i < ROUNDS[k]; i++) {
+        load_key(xmm_key_tmp, key, i * 0x10, xmm_key_shuf_mask);
+        DoOne(aesenc, xmm_key_tmp);
+      }
+      load_key(xmm_key_tmp, key, ROUNDS[k] * 0x10, xmm_key_shuf_mask);
+      DoOne(aesenclast, xmm_key_tmp);
+    } else {
+      DoOne(pxor, as_XMMRegister(1 + XMM_REG_NUM_KEY_FIRST));
+      for (int rnum = 2; rnum < 10; rnum++) {
+        DoOne(aesdec, as_XMMRegister(rnum + XMM_REG_NUM_KEY_FIRST));
+      }
+      for (int i = 10; i <= ROUNDS[k]; i++) {
+        load_key(xmm_key_tmp, key, i * 0x10, xmm_key_shuf_mask);
+        DoOne(aesdec, xmm_key_tmp);
+      }
+      DoOne(aesdeclast, xmm_key_first);
+    }
+
+    __ movdqu(Address(to, pos, Address::times_1, 0), xmm_result0);
+    __ addptr(pos, AESBlockSize);
+    __ subptr(len_reg, AESBlockSize);
+    __ jmp(L_single[k]);
+
+    __ BIND(L_done[k]);
+    if (k < 2) __ jmp(L_exit);
+  } //for key_128/192/256
+
+  __ BIND(L_exit);
+  // Clear all XMM registers holding sensitive key material before returning
+  __ pxor(xmm_key_tmp, xmm_key_tmp);
+  for (int rnum = XMM_REG_NUM_KEY_FIRST; rnum <= XMM_REG_NUM_KEY_LAST; rnum++) {
+    __ pxor(as_XMMRegister(rnum), as_XMMRegister(rnum));
+  }
+  __ pop(rax);
+  __ leave(); // required for proper stackwalking of RuntimeStub frame
+  __ ret(0);
+
+  return start;
+
+#undef DoFour
+#undef DoOne
+}
+
+address StubGenerator::generate_electronicCodeBook_encryptAESCrypt_Parallel() {
+  return generate_electronicCodeBook_AESCrypt_Parallel(true);
+}
+
+address StubGenerator::generate_electronicCodeBook_decryptAESCrypt_Parallel() {
+  return generate_electronicCodeBook_AESCrypt_Parallel(false);
+}
+
 // This is a version of CBC/AES Decrypt which does 4 blocks in a loop at a time
 // to hide instruction latency
 //
@@ -1493,7 +1689,7 @@ address StubGenerator::generate_cipherBlockChaining_decryptAESCrypt_Parallel() {
 __ opc(xmm_result0, src_reg);         \
 __ opc(xmm_result1, src_reg);         \
 __ opc(xmm_result2, src_reg);         \
-__ opc(xmm_result3, src_reg);         \
+__ opc(xmm_result3, src_reg);
 
   for (int k = 0; k < 3; ++k) {
     __ BIND(L_multiBlock_loopTopHead[k]);

From 9a26b4af34cd3e8690c5150da232eaa8bf3a82a6 Mon Sep 17 00:00:00 2001
From: Dingli Zhang <dzhang@openjdk.org>
Date: Tue, 10 Mar 2026 03:56:28 +0000
Subject: [PATCH 117/655] 8379372: Enable some vector algorithms IR matching
 tests for RISC-V

Reviewed-by: fyang
---
 .../vectorization/TestVectorAlgorithms.java   | 50 +++++++++----------
 1 file changed, 25 insertions(+), 25 deletions(-)

diff --git a/test/hotspot/jtreg/compiler/vectorization/TestVectorAlgorithms.java b/test/hotspot/jtreg/compiler/vectorization/TestVectorAlgorithms.java
index ed04950eb07..f11955bef86 100644
--- a/test/hotspot/jtreg/compiler/vectorization/TestVectorAlgorithms.java
+++ b/test/hotspot/jtreg/compiler/vectorization/TestVectorAlgorithms.java
@@ -262,11 +262,11 @@ public class TestVectorAlgorithms {
     @Test
     @IR(counts = {IRNode.REPLICATE_I,  "= 1",
                   IRNode.STORE_VECTOR, "> 0"},
-        applyIfCPUFeatureOr = {"sse4.1", "true", "asimd", "true"},
+        applyIfCPUFeatureOr = {"sse4.1", "true", "asimd", "true", "rvv", "true"},
         applyIfAnd = {"UseSuperWord", "true", "OptimizeFill", "false"})
     @IR(counts = {".*CallLeafNoFP.*jint_fill.*", "= 1"},
         phase = CompilePhase.BEFORE_MATCHING,
-        applyIfCPUFeatureOr = {"sse4.1", "true", "asimd", "true"},
+        applyIfCPUFeatureOr = {"sse4.1", "true", "asimd", "true", "rvv", "true"},
         applyIf = {"OptimizeFill", "true"})
     // By default, the fill intrinsic "jint_fill" is used, but we can disable
     // the detection of the fill loop, and then we auto vectorize.
@@ -277,7 +277,7 @@ public class TestVectorAlgorithms {
     @Test
     @IR(counts = {IRNode.REPLICATE_I,  "= 1",
                   IRNode.STORE_VECTOR, "> 0"},
-        applyIfCPUFeatureOr = {"sse4.1", "true", "asimd", "true"})
+        applyIfCPUFeatureOr = {"sse4.1", "true", "asimd", "true", "rvv", "true"})
     public Object fillI_VectorAPI(int[] r) {
         return VectorAlgorithmsImpl.fillI_VectorAPI(r);
     }
@@ -292,7 +292,7 @@ public class TestVectorAlgorithms {
     @Test
     @IR(counts = {IRNode.POPULATE_INDEX, "> 0",
                   IRNode.STORE_VECTOR,   "> 0"},
-        applyIfCPUFeatureOr = {"avx2", "true", "sve", "true"},
+        applyIfCPUFeatureOr = {"avx2", "true", "sve", "true", "rvv", "true"},
         applyIf = {"UseSuperWord", "true"})
     // Note: the Vector API example below can also vectorize for AVX,
     //       because it does not use a PopulateIndex.
@@ -303,7 +303,7 @@ public class TestVectorAlgorithms {
     @Test
     @IR(counts = {IRNode.ADD_VI,       "> 0",
                   IRNode.STORE_VECTOR, "> 0"},
-        applyIfCPUFeatureOr = {"sse4.1", "true", "asimd", "true"},
+        applyIfCPUFeatureOr = {"sse4.1", "true", "asimd", "true", "rvv", "true"},
         applyIf = {"TieredCompilation", "true"})
     // IR check only works with TieredCompilation. Needs to make it
     // work with -XX:-TieredCompilation in future (see JDK-8378640).
@@ -314,7 +314,7 @@ public class TestVectorAlgorithms {
     @Test
     @IR(counts = {IRNode.LOAD_VECTOR_I, "> 0",
                   IRNode.STORE_VECTOR,  "> 0"},
-        applyIfCPUFeatureOr = {"sse4.1", "true", "asimd", "true"},
+        applyIfCPUFeatureOr = {"sse4.1", "true", "asimd", "true", "rvv", "true"},
         applyIf = {"UseSuperWord", "true"})
     public Object copyI_loop(int[] a, int[] r) {
         return VectorAlgorithmsImpl.copyI_loop(a, r);
@@ -323,7 +323,7 @@ public class TestVectorAlgorithms {
     @Test
     @IR(counts = {IRNode.LOAD_VECTOR_I, "> 0",
                   IRNode.STORE_VECTOR,  "> 0"},
-        applyIfCPUFeatureOr = {"sse4.1", "true", "asimd", "true"})
+        applyIfCPUFeatureOr = {"sse4.1", "true", "asimd", "true", "rvv", "true"})
     public Object copyI_VectorAPI(int[] a, int[] r) {
         return VectorAlgorithmsImpl.copyI_VectorAPI(a, r);
     }
@@ -331,7 +331,7 @@ public class TestVectorAlgorithms {
     @Test
     @IR(counts = {".*CallLeafNoFP.*jint_disjoint_arraycopy.*", "= 1"},
         phase = CompilePhase.BEFORE_MATCHING,
-        applyIfCPUFeatureOr = {"sse4.1", "true", "asimd", "true"})
+        applyIfCPUFeatureOr = {"sse4.1", "true", "asimd", "true", "rvv", "true"})
     public Object copyI_System_arraycopy(int[] a, int[] r) {
         return VectorAlgorithmsImpl.copyI_System_arraycopy(a, r);
     }
@@ -340,7 +340,7 @@ public class TestVectorAlgorithms {
     @IR(counts = {IRNode.LOAD_VECTOR_I, "> 0",
                   IRNode.MUL_VI,        "> 0",
                   IRNode.STORE_VECTOR,  "> 0"},
-        applyIfCPUFeatureOr = {"sse4.1", "true", "asimd", "true"},
+        applyIfCPUFeatureOr = {"sse4.1", "true", "asimd", "true", "rvv", "true"},
         applyIf = {"UseSuperWord", "true"})
     public Object mapI_loop(int[] a, int[] r) {
         return VectorAlgorithmsImpl.mapI_loop(a, r);
@@ -350,7 +350,7 @@ public class TestVectorAlgorithms {
     @IR(counts = {IRNode.LOAD_VECTOR_I, "> 0",
                   IRNode.MUL_VI,        "> 0",
                   IRNode.STORE_VECTOR,  "> 0"},
-        applyIfCPUFeatureOr = {"sse4.1", "true", "asimd", "true"})
+        applyIfCPUFeatureOr = {"sse4.1", "true", "asimd", "true", "rvv", "true"})
     public Object mapI_VectorAPI(int[] a, int[] r) {
         return VectorAlgorithmsImpl.mapI_VectorAPI(a, r);
     }
@@ -359,7 +359,7 @@ public class TestVectorAlgorithms {
     @IR(counts = {IRNode.LOAD_VECTOR_I,    "> 0",
                   IRNode.ADD_REDUCTION_VI, "> 0",
                   IRNode.ADD_VI,           "> 0"},
-        applyIfCPUFeatureOr = {"sse4.1", "true", "asimd", "true"},
+        applyIfCPUFeatureOr = {"sse4.1", "true", "asimd", "true", "rvv", "true"},
         applyIf = {"UseSuperWord", "true"})
     public int reduceAddI_loop(int[] a) {
         return VectorAlgorithmsImpl.reduceAddI_loop(a);
@@ -373,7 +373,7 @@ public class TestVectorAlgorithms {
     @Test
     @IR(counts = {IRNode.LOAD_VECTOR_I,    "> 0",
                   IRNode.ADD_REDUCTION_VI, "> 0"}, // reduceLanes inside loop
-        applyIfCPUFeatureOr = {"sse4.1", "true", "asimd", "true"})
+        applyIfCPUFeatureOr = {"sse4.1", "true", "asimd", "true", "rvv", "true"})
     public int reduceAddI_VectorAPI_naive(int[] a) {
         return VectorAlgorithmsImpl.reduceAddI_VectorAPI_naive(a);
     }
@@ -393,7 +393,7 @@ public class TestVectorAlgorithms {
     @IR(counts = {IRNode.LOAD_VECTOR_F,   "> 0",
                   IRNode.ADD_REDUCTION_V, "> 0",
                   IRNode.MUL_VF,          "> 0"},
-        applyIfCPUFeatureOr = {"sse4.1", "true", "asimd", "true"},
+        applyIfCPUFeatureOr = {"sse4.1", "true", "asimd", "true", "rvv", "true"},
         applyIf = {"UseSuperWord", "true"})
     public float dotProductF_VectorAPI_naive(float[] a, float[] b) {
         return VectorAlgorithmsImpl.dotProductF_VectorAPI_naive(a, b);
@@ -403,7 +403,7 @@ public class TestVectorAlgorithms {
     @IR(counts = {IRNode.LOAD_VECTOR_F,   "> 0",
                   IRNode.ADD_REDUCTION_V, "> 0",
                   IRNode.MUL_VF,          "> 0"},
-        applyIfCPUFeatureOr = {"sse4.1", "true", "asimd", "true"},
+        applyIfCPUFeatureOr = {"sse4.1", "true", "asimd", "true", "rvv", "true"},
         applyIf = {"UseSuperWord", "true"})
     public float dotProductF_VectorAPI_reduction_after_loop(float[] a, float[] b) {
         return VectorAlgorithmsImpl.dotProductF_VectorAPI_reduction_after_loop(a, b);
@@ -425,7 +425,7 @@ public class TestVectorAlgorithms {
                   IRNode.MUL_VI,           IRNode.VECTOR_SIZE_8, "> 0",
                   IRNode.ADD_VI,           IRNode.VECTOR_SIZE_8, "> 0",
                   IRNode.ADD_REDUCTION_VI,                       "> 0"},
-        applyIfCPUFeatureOr = {"avx2", "true", "sve", "true"},
+        applyIfCPUFeatureOr = {"avx2", "true", "sve", "true", "rvv", "true"},
         applyIf = {"MaxVectorSize", ">=32"})
     public int hashCodeB_VectorAPI_v1(byte[] a) {
         return VectorAlgorithmsImpl.hashCodeB_VectorAPI_v1(a);
@@ -436,7 +436,7 @@ public class TestVectorAlgorithms {
                   IRNode.MUL_VI,           "> 0",
                   IRNode.ADD_VI,           "> 0",
                   IRNode.ADD_REDUCTION_VI, "> 0"},
-        applyIfCPUFeatureOr = {"avx2", "true", "asimd", "true"})
+        applyIfCPUFeatureOr = {"avx2", "true", "asimd", "true", "rvv", "true"})
     public int hashCodeB_VectorAPI_v2(byte[] a) {
         return VectorAlgorithmsImpl.hashCodeB_VectorAPI_v2(a);
     }
@@ -445,7 +445,7 @@ public class TestVectorAlgorithms {
     @IR(counts = {IRNode.LOAD_VECTOR_I,    "> 0",
                   IRNode.ADD_REDUCTION_VI, "> 0",
                   IRNode.ADD_VI,           "> 0"},
-        applyIfCPUFeatureOr = {"sse4.1", "true", "asimd", "true"})
+        applyIfCPUFeatureOr = {"sse4.1", "true", "asimd", "true", "rvv", "true"})
     public int reduceAddI_VectorAPI_reduction_after_loop(int[] a) {
         return VectorAlgorithmsImpl.reduceAddI_VectorAPI_reduction_after_loop(a);
     }
@@ -469,7 +469,7 @@ public class TestVectorAlgorithms {
                   IRNode.AND_VI,           "> 0",
                   IRNode.ADD_VI,           "> 0",
                   IRNode.STORE_VECTOR,     "> 0"},
-        applyIfCPUFeatureOr = {"sse4.1", "true", "asimd", "true"},
+        applyIfCPUFeatureOr = {"sse4.1", "true", "asimd", "true", "rvv", "true"},
         applyIf = {"MaxVectorSize", ">=64"})
     public Object scanAddI_VectorAPI_permute_add(int[] a, int[] r) {
         return VectorAlgorithmsImpl.scanAddI_VectorAPI_permute_add(a, r);
@@ -488,7 +488,7 @@ public class TestVectorAlgorithms {
                   IRNode.VECTOR_BLEND_I,  "> 0",
                   IRNode.MIN_REDUCTION_V, "> 0",
                   IRNode.ADD_VI,          "> 0"},
-        applyIfCPUFeatureOr = {"avx", "true", "asimd", "true"})
+        applyIfCPUFeatureOr = {"avx", "true", "asimd", "true", "rvv", "true"})
     public int findMinIndexI_VectorAPI(int[] a) {
         return VectorAlgorithmsImpl.findMinIndexI_VectorAPI(a);
     }
@@ -504,7 +504,7 @@ public class TestVectorAlgorithms {
     @IR(counts = {IRNode.LOAD_VECTOR_I,   "> 0",
                   IRNode.VECTOR_MASK_CMP, "> 0",
                   IRNode.VECTOR_TEST,     "> 0"},
-        applyIfCPUFeatureOr = {"avx", "true", "asimd", "true"})
+        applyIfCPUFeatureOr = {"avx", "true", "asimd", "true", "rvv", "true"})
     public int findI_VectorAPI(int[] a, int e) {
         return VectorAlgorithmsImpl.findI_VectorAPI(a, e);
     }
@@ -522,7 +522,7 @@ public class TestVectorAlgorithms {
                   IRNode.REARRANGE_VI,     "> 0",
                   IRNode.AND_VI,           "> 0",
                   IRNode.STORE_VECTOR,     "> 0"},
-        applyIfCPUFeatureOr = {"sse4.1", "true", "asimd", "true"})
+        applyIfCPUFeatureOr = {"sse4.1", "true", "asimd", "true", "rvv", "true"})
     public Object reverseI_VectorAPI(int[] a, int[] r) {
         return VectorAlgorithmsImpl.reverseI_VectorAPI(a, r);
     }
@@ -540,7 +540,7 @@ public class TestVectorAlgorithms {
                   IRNode.VECTOR_TEST,         "> 0",
                   IRNode.COMPRESS_VI,         "> 0",
                   IRNode.STORE_VECTOR_MASKED, "> 0"},
-        applyIfCPUFeatureOr = {"avx2", "true", "sve", "true"})
+        applyIfCPUFeatureOr = {"avx2", "true", "sve", "true", "rvv", "true"})
     public Object filterI_VectorAPI_v1(int[] a, int[] r, int threshold) {
         return VectorAlgorithmsImpl.filterI_VectorAPI_v1(a, r, threshold);
     }
@@ -597,7 +597,7 @@ public class TestVectorAlgorithms {
                   IRNode.OR_V_MASK,                 "> 0",
                   IRNode.ADD_VI,                    "> 0",
                   IRNode.ADD_REDUCTION_VI,          "> 0"},
-        applyIfCPUFeatureOr = {"avx512", "true", "sve", "true"},
+        applyIfCPUFeatureOr = {"avx512", "true", "sve", "true", "rvv", "true"},
         applyIf = {"TieredCompilation", "true"})
     // IR check only works with TieredCompilation. Needs to make it
     // work with -XX:-TieredCompilation in future (see JDK-8378640).
@@ -615,7 +615,7 @@ public class TestVectorAlgorithms {
     @Test
     @IR(counts = {IRNode.LOAD_VECTOR_B, "> 0",
                   IRNode.ADD_VB,        "> 0"},
-        applyIfCPUFeatureOr = {"sse4.1", "true", "asimd", "true"})
+        applyIfCPUFeatureOr = {"sse4.1", "true", "asimd", "true", "rvv", "true"})
     public Object lowerCaseB_VectorAPI_v1(byte[] a, byte[] r) {
         return VectorAlgorithmsImpl.lowerCaseB_VectorAPI_v1(a, r);
     }
@@ -623,7 +623,7 @@ public class TestVectorAlgorithms {
     @Test
     @IR(counts = {IRNode.LOAD_VECTOR_B, "> 0",
                   IRNode.ADD_VB,        "> 0"},
-        applyIfCPUFeatureOr = {"sse4.1", "true", "asimd", "true"})
+        applyIfCPUFeatureOr = {"sse4.1", "true", "asimd", "true", "rvv", "true"})
     public Object lowerCaseB_VectorAPI_v2(byte[] a, byte[] r) {
         return VectorAlgorithmsImpl.lowerCaseB_VectorAPI_v2(a, r);
     }

From 61a9c719835d46bcb447bb6855fe5bad12b77cf2 Mon Sep 17 00:00:00 2001
From: Roland Westrelin <roland@openjdk.org>
Date: Tue, 10 Mar 2026 09:35:35 +0000
Subject: [PATCH 118/655] 8379180: C2: assert((ptr->bottom_type() == Type::TOP)
 || ((base == Compile::current()->top()) ==
 (ptr->bottom_type()->make_ptr()->isa_oopptr() == nullptr))) failed: base
 input only needed for heap addresses

Reviewed-by: qamai, chagedorn
---
 src/hotspot/share/opto/macro.cpp              | 94 +++++++++----------
 .../c2/TestAllocatePrefetchStyle.java         | 44 +++++++++
 2 files changed, 91 insertions(+), 47 deletions(-)
 create mode 100644 test/hotspot/jtreg/compiler/c2/TestAllocatePrefetchStyle.java

diff --git a/src/hotspot/share/opto/macro.cpp b/src/hotspot/share/opto/macro.cpp
index ef38a511a88..510531c95cd 100644
--- a/src/hotspot/share/opto/macro.cpp
+++ b/src/hotspot/share/opto/macro.cpp
@@ -1818,81 +1818,81 @@ Node* PhaseMacroExpand::prefetch_allocation(Node* i_o, Node*& needgc_false,
                                         Node* old_eden_top, Node* new_eden_top,
                                         intx lines) {
    enum { fall_in_path = 1, pf_path = 2 };
-   if( UseTLAB && AllocatePrefetchStyle == 2 ) {
+   if (UseTLAB && AllocatePrefetchStyle == 2) {
       // Generate prefetch allocation with watermark check.
       // As an allocation hits the watermark, we will prefetch starting
       // at a "distance" away from watermark.
 
-      Node *pf_region = new RegionNode(3);
-      Node *pf_phi_rawmem = new PhiNode( pf_region, Type::MEMORY,
-                                                TypeRawPtr::BOTTOM );
+      Node* pf_region = new RegionNode(3);
+      Node* pf_phi_rawmem = new PhiNode(pf_region, Type::MEMORY,
+                                                TypeRawPtr::BOTTOM);
       // I/O is used for Prefetch
-      Node *pf_phi_abio = new PhiNode( pf_region, Type::ABIO );
+      Node* pf_phi_abio = new PhiNode(pf_region, Type::ABIO);
 
-      Node *thread = new ThreadLocalNode();
+      Node* thread = new ThreadLocalNode();
       transform_later(thread);
 
-      Node *eden_pf_adr = new AddPNode( top()/*not oop*/, thread,
-                   _igvn.MakeConX(in_bytes(JavaThread::tlab_pf_top_offset())) );
+      Node* eden_pf_adr = new AddPNode(top()/*not oop*/, thread,
+                   _igvn.MakeConX(in_bytes(JavaThread::tlab_pf_top_offset())));
       transform_later(eden_pf_adr);
 
-      Node *old_pf_wm = new LoadPNode(needgc_false,
+      Node* old_pf_wm = new LoadPNode(needgc_false,
                                    contended_phi_rawmem, eden_pf_adr,
                                    TypeRawPtr::BOTTOM, TypeRawPtr::BOTTOM,
                                    MemNode::unordered);
       transform_later(old_pf_wm);
 
       // check against new_eden_top
-      Node *need_pf_cmp = new CmpPNode( new_eden_top, old_pf_wm );
+      Node* need_pf_cmp = new CmpPNode(new_eden_top, old_pf_wm);
       transform_later(need_pf_cmp);
-      Node *need_pf_bol = new BoolNode( need_pf_cmp, BoolTest::ge );
+      Node* need_pf_bol = new BoolNode(need_pf_cmp, BoolTest::ge);
       transform_later(need_pf_bol);
-      IfNode *need_pf_iff = new IfNode( needgc_false, need_pf_bol,
-                                       PROB_UNLIKELY_MAG(4), COUNT_UNKNOWN );
+      IfNode* need_pf_iff = new IfNode(needgc_false, need_pf_bol,
+                                       PROB_UNLIKELY_MAG(4), COUNT_UNKNOWN);
       transform_later(need_pf_iff);
 
       // true node, add prefetchdistance
-      Node *need_pf_true = new IfTrueNode( need_pf_iff );
+      Node* need_pf_true = new IfTrueNode(need_pf_iff);
       transform_later(need_pf_true);
 
-      Node *need_pf_false = new IfFalseNode( need_pf_iff );
+      Node* need_pf_false = new IfFalseNode(need_pf_iff);
       transform_later(need_pf_false);
 
-      Node *new_pf_wmt = new AddPNode( top(), old_pf_wm,
-                                    _igvn.MakeConX(AllocatePrefetchDistance) );
-      transform_later(new_pf_wmt );
+      Node* new_pf_wmt = new AddPNode(top(), old_pf_wm,
+                                    _igvn.MakeConX(AllocatePrefetchDistance));
+      transform_later(new_pf_wmt);
       new_pf_wmt->set_req(0, need_pf_true);
 
-      Node *store_new_wmt = new StorePNode(need_pf_true,
+      Node* store_new_wmt = new StorePNode(need_pf_true,
                                        contended_phi_rawmem, eden_pf_adr,
                                        TypeRawPtr::BOTTOM, new_pf_wmt,
                                        MemNode::unordered);
       transform_later(store_new_wmt);
 
       // adding prefetches
-      pf_phi_abio->init_req( fall_in_path, i_o );
+      pf_phi_abio->init_req(fall_in_path, i_o);
 
-      Node *prefetch_adr;
-      Node *prefetch;
+      Node* prefetch_adr;
+      Node* prefetch;
       uint step_size = AllocatePrefetchStepSize;
       uint distance = 0;
 
-      for ( intx i = 0; i < lines; i++ ) {
-        prefetch_adr = new AddPNode( old_pf_wm, new_pf_wmt,
-                                            _igvn.MakeConX(distance) );
+      for (intx i = 0; i < lines; i++) {
+        prefetch_adr = new AddPNode(top(), new_pf_wmt,
+                                            _igvn.MakeConX(distance));
         transform_later(prefetch_adr);
-        prefetch = new PrefetchAllocationNode( i_o, prefetch_adr );
+        prefetch = new PrefetchAllocationNode(i_o, prefetch_adr);
         transform_later(prefetch);
         distance += step_size;
         i_o = prefetch;
       }
-      pf_phi_abio->set_req( pf_path, i_o );
+      pf_phi_abio->set_req(pf_path, i_o);
 
-      pf_region->init_req( fall_in_path, need_pf_false );
-      pf_region->init_req( pf_path, need_pf_true );
+      pf_region->init_req(fall_in_path, need_pf_false);
+      pf_region->init_req(pf_path, need_pf_true);
 
-      pf_phi_rawmem->init_req( fall_in_path, contended_phi_rawmem );
-      pf_phi_rawmem->init_req( pf_path, store_new_wmt );
+      pf_phi_rawmem->init_req(fall_in_path, contended_phi_rawmem);
+      pf_phi_rawmem->init_req(pf_path, store_new_wmt);
 
       transform_later(pf_region);
       transform_later(pf_phi_rawmem);
@@ -1901,7 +1901,7 @@ Node* PhaseMacroExpand::prefetch_allocation(Node* i_o, Node*& needgc_false,
       needgc_false = pf_region;
       contended_phi_rawmem = pf_phi_rawmem;
       i_o = pf_phi_abio;
-   } else if( UseTLAB && AllocatePrefetchStyle == 3 ) {
+   } else if (UseTLAB && AllocatePrefetchStyle == 3) {
       // Insert a prefetch instruction for each allocation.
       // This code is used to generate 1 prefetch instruction per cache line.
 
@@ -1910,7 +1910,7 @@ Node* PhaseMacroExpand::prefetch_allocation(Node* i_o, Node*& needgc_false,
       uint distance = AllocatePrefetchDistance;
 
       // Next cache address.
-      Node *cache_adr = new AddPNode(old_eden_top, old_eden_top,
+      Node* cache_adr = new AddPNode(top(), old_eden_top,
                                      _igvn.MakeConX(step_size + distance));
       transform_later(cache_adr);
       cache_adr = new CastP2XNode(needgc_false, cache_adr);
@@ -1924,36 +1924,36 @@ Node* PhaseMacroExpand::prefetch_allocation(Node* i_o, Node*& needgc_false,
       transform_later(cache_adr);
 
       // Prefetch
-      Node *prefetch = new PrefetchAllocationNode( contended_phi_rawmem, cache_adr );
+      Node* prefetch = new PrefetchAllocationNode(contended_phi_rawmem, cache_adr);
       prefetch->set_req(0, needgc_false);
       transform_later(prefetch);
       contended_phi_rawmem = prefetch;
-      Node *prefetch_adr;
+      Node* prefetch_adr;
       distance = step_size;
-      for ( intx i = 1; i < lines; i++ ) {
-        prefetch_adr = new AddPNode( cache_adr, cache_adr,
-                                            _igvn.MakeConX(distance) );
+      for (intx i = 1; i < lines; i++) {
+        prefetch_adr = new AddPNode(top(), cache_adr,
+                                            _igvn.MakeConX(distance));
         transform_later(prefetch_adr);
-        prefetch = new PrefetchAllocationNode( contended_phi_rawmem, prefetch_adr );
+        prefetch = new PrefetchAllocationNode(contended_phi_rawmem, prefetch_adr);
         transform_later(prefetch);
         distance += step_size;
         contended_phi_rawmem = prefetch;
       }
-   } else if( AllocatePrefetchStyle > 0 ) {
+   } else if (AllocatePrefetchStyle > 0) {
       // Insert a prefetch for each allocation only on the fast-path
-      Node *prefetch_adr;
-      Node *prefetch;
+      Node* prefetch_adr;
+      Node* prefetch;
       // Generate several prefetch instructions.
       uint step_size = AllocatePrefetchStepSize;
       uint distance = AllocatePrefetchDistance;
-      for ( intx i = 0; i < lines; i++ ) {
-        prefetch_adr = new AddPNode( top(), new_eden_top,
-                                            _igvn.MakeConX(distance) );
+      for (intx i = 0; i < lines; i++) {
+        prefetch_adr = new AddPNode(top(), new_eden_top,
+                                            _igvn.MakeConX(distance));
         transform_later(prefetch_adr);
-        prefetch = new PrefetchAllocationNode( i_o, prefetch_adr );
+        prefetch = new PrefetchAllocationNode(i_o, prefetch_adr);
         // Do not let it float too high, since if eden_top == eden_end,
         // both might be null.
-        if( i == 0 ) { // Set control for first prefetch, next follows it
+        if (i == 0) { // Set control for first prefetch, next follows it
           prefetch->init_req(0, needgc_false);
         }
         transform_later(prefetch);
diff --git a/test/hotspot/jtreg/compiler/c2/TestAllocatePrefetchStyle.java b/test/hotspot/jtreg/compiler/c2/TestAllocatePrefetchStyle.java
new file mode 100644
index 00000000000..53763302f90
--- /dev/null
+++ b/test/hotspot/jtreg/compiler/c2/TestAllocatePrefetchStyle.java
@@ -0,0 +1,44 @@
+/*
+ * Copyright (c) 2026 IBM Corporation. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+/*
+ * @test
+ * @bug 8379180
+ * @summary test AllocatePrefetchStyle
+ *
+ * @run main/othervm -Xbatch -XX:AllocatePrefetchStyle=2 compiler.c2.TestAllocatePrefetchStyle
+ * @run main/othervm -Xbatch -XX:AllocatePrefetchStyle=3 compiler.c2.TestAllocatePrefetchStyle
+ */
+package compiler.c2;
+
+public class TestAllocatePrefetchStyle {
+    public static void main(String[] args) {
+        for (int i = 0; i < 20_000; i++) {
+            test();
+        }
+    }
+
+    private static int[] test() {
+        return new int[10];
+    }
+}

From ce7a890fb434d15da51dd7e21847c4a4bbabf99f Mon Sep 17 00:00:00 2001
From: Thomas Schatzl <tschatzl@openjdk.org>
Date: Tue, 10 Mar 2026 10:16:29 +0000
Subject: [PATCH 119/655] 8379200: G1: Remove G1HeapRegion completion facility

Reviewed-by: ayang, iwalulya
---
 src/hotspot/share/gc/g1/g1CollectionSet.cpp   |  3 +--
 src/hotspot/share/gc/g1/g1ConcurrentMark.cpp  |  5 ----
 src/hotspot/share/gc/g1/g1HeapRegion.hpp      | 26 -------------------
 .../share/gc/g1/g1HeapRegionManager.cpp       |  2 --
 4 files changed, 1 insertion(+), 35 deletions(-)

diff --git a/src/hotspot/share/gc/g1/g1CollectionSet.cpp b/src/hotspot/share/gc/g1/g1CollectionSet.cpp
index abfddf860e6..39acaaab913 100644
--- a/src/hotspot/share/gc/g1/g1CollectionSet.cpp
+++ b/src/hotspot/share/gc/g1/g1CollectionSet.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2016, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2016, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -174,7 +174,6 @@ void G1CollectionSet::iterate(G1HeapRegionClosure* cl) const {
     G1HeapRegion* r = _g1h->region_at(_regions[i]);
     bool result = cl->do_heap_region(r);
     if (result) {
-      cl->set_incomplete();
       return;
     }
   }
diff --git a/src/hotspot/share/gc/g1/g1ConcurrentMark.cpp b/src/hotspot/share/gc/g1/g1ConcurrentMark.cpp
index b4a5d673fd2..a2114d8d6b6 100644
--- a/src/hotspot/share/gc/g1/g1ConcurrentMark.cpp
+++ b/src/hotspot/share/gc/g1/g1ConcurrentMark.cpp
@@ -817,10 +817,6 @@ public:
     SuspendibleThreadSetJoiner sts_join(_suspendible);
     G1CollectedHeap::heap()->heap_region_par_iterate_from_worker_offset(&_cl, &_hr_claimer, worker_id);
   }
-
-  bool is_complete() {
-    return _cl.is_complete();
-  }
 };
 
 void G1ConcurrentMark::clear_bitmap(WorkerThreads* workers, bool may_yield) {
@@ -835,7 +831,6 @@ void G1ConcurrentMark::clear_bitmap(WorkerThreads* workers, bool may_yield) {
 
   log_debug(gc, ergo)("Running %s with %u workers for %zu work units.", cl.name(), num_workers, num_chunks);
   workers->run_task(&cl, num_workers);
-  guarantee(may_yield || cl.is_complete(), "Must have completed iteration when not yielding.");
 }
 
 void G1ConcurrentMark::cleanup_for_next_mark() {
diff --git a/src/hotspot/share/gc/g1/g1HeapRegion.hpp b/src/hotspot/share/gc/g1/g1HeapRegion.hpp
index 2b4b640d52b..ec9cab26049 100644
--- a/src/hotspot/share/gc/g1/g1HeapRegion.hpp
+++ b/src/hotspot/share/gc/g1/g1HeapRegion.hpp
@@ -567,41 +567,15 @@ public:
 // G1HeapRegionClosure is used for iterating over regions.
 // Terminates the iteration when the "do_heap_region" method returns "true".
 class G1HeapRegionClosure : public StackObj {
-  friend class G1HeapRegionManager;
-  friend class G1CollectionSet;
-  friend class G1CollectionSetCandidates;
-
-  bool _is_complete;
-  void set_incomplete() { _is_complete = false; }
-
 public:
-  G1HeapRegionClosure(): _is_complete(true) {}
-
   // Typically called on each region until it returns true.
   virtual bool do_heap_region(G1HeapRegion* r) = 0;
-
-  // True after iteration if the closure was applied to all heap regions
-  // and returned "false" in all cases.
-  bool is_complete() { return _is_complete; }
 };
 
 class G1HeapRegionIndexClosure : public StackObj {
-  friend class G1HeapRegionManager;
-  friend class G1CollectionSet;
-  friend class G1CollectionSetCandidates;
-
-  bool _is_complete;
-  void set_incomplete() { _is_complete = false; }
-
 public:
-  G1HeapRegionIndexClosure(): _is_complete(true) {}
-
   // Typically called on each region until it returns true.
   virtual bool do_heap_region_index(uint region_index) = 0;
-
-  // True after iteration if the closure was applied to all heap regions
-  // and returned "false" in all cases.
-  bool is_complete() { return _is_complete; }
 };
 
 #endif // SHARE_GC_G1_G1HEAPREGION_HPP
diff --git a/src/hotspot/share/gc/g1/g1HeapRegionManager.cpp b/src/hotspot/share/gc/g1/g1HeapRegionManager.cpp
index fdd3b919590..3c0318827ef 100644
--- a/src/hotspot/share/gc/g1/g1HeapRegionManager.cpp
+++ b/src/hotspot/share/gc/g1/g1HeapRegionManager.cpp
@@ -511,7 +511,6 @@ void G1HeapRegionManager::iterate(G1HeapRegionClosure* blk) const {
     guarantee(at(i) != nullptr, "Tried to access region %u that has a null G1HeapRegion*", i);
     bool res = blk->do_heap_region(at(i));
     if (res) {
-      blk->set_incomplete();
       return;
     }
   }
@@ -526,7 +525,6 @@ void G1HeapRegionManager::iterate(G1HeapRegionIndexClosure* blk) const {
     }
     bool res = blk->do_heap_region_index(i);
     if (res) {
-      blk->set_incomplete();
       return;
     }
   }

From 66e192c6005fccaba07fbb41393ddd16fc9fad30 Mon Sep 17 00:00:00 2001
From: Alexey Ivanov <aivanov@openjdk.org>
Date: Tue, 10 Mar 2026 12:20:28 +0000
Subject: [PATCH 120/655] 8377602: Create automated test for PageRange

Reviewed-by: prr, psadhukhan, dmarkov
---
 .../awt/print/PrinterJob/PageRangesAuto.java  | 199 ++++++++++++++++++
 1 file changed, 199 insertions(+)
 create mode 100644 test/jdk/java/awt/print/PrinterJob/PageRangesAuto.java

diff --git a/test/jdk/java/awt/print/PrinterJob/PageRangesAuto.java b/test/jdk/java/awt/print/PrinterJob/PageRangesAuto.java
new file mode 100644
index 00000000000..8d50ef9c2c2
--- /dev/null
+++ b/test/jdk/java/awt/print/PrinterJob/PageRangesAuto.java
@@ -0,0 +1,199 @@
+/*
+ * Copyright (c) 2007, 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+import java.awt.Font;
+import java.awt.Graphics;
+import java.awt.print.PageFormat;
+import java.awt.print.Pageable;
+import java.awt.print.Printable;
+import java.awt.print.PrinterException;
+import java.awt.print.PrinterJob;
+import java.io.File;
+import java.util.ArrayList;
+import java.util.Arrays;
+import java.util.BitSet;
+import java.util.List;
+import java.util.stream.IntStream;
+
+import javax.print.attribute.HashPrintRequestAttributeSet;
+import javax.print.attribute.PrintRequestAttributeSet;
+import javax.print.attribute.standard.Destination;
+import javax.print.attribute.standard.PageRanges;
+
+/*
+ * @test
+ * @bug 6575331 8297191
+ * @key printer
+ * @summary Automatically verifies all the pages in a range are printed
+ * @run main PageRangesAuto
+ */
+public class PageRangesAuto implements Pageable, Printable {
+
+    private static final Font font = new Font(Font.SERIF, Font.PLAIN, 50);
+
+    private static final int MAX_PAGE = 10;
+
+    private static final int[][] ranges = {
+            {1, 1},
+            {1, MAX_PAGE},
+            {2, 3},
+            {3, 6},
+            {4, 7},
+            {7, 7},
+            {9, MAX_PAGE},
+            {MAX_PAGE, MAX_PAGE},
+    };
+
+    private enum Type {
+        PRINTABLE,
+        PAGEABLE
+    }
+
+    private final BitSet printedPages = new BitSet();
+
+    /**
+     * Configures a printer job and prints it.
+     * @param type the type of the interface tested
+     *             ({@code Printable} or {@code Pageable})
+     * @param pageRange the range of pages to print;
+     *                  if {@code null}, print all pages
+     * @return a bit set of printed page numbers
+     */
+    private static BitSet printJob(final Type type,
+                                   final PageRanges pageRange)
+            throws PrinterException {
+        final PageRangesAuto test = new PageRangesAuto();
+
+        final PrinterJob job = PrinterJob.getPrinterJob();
+        final String baseName = type.name().toLowerCase();
+
+        switch (type) {
+            case PRINTABLE -> job.setPrintable(test);
+            case PAGEABLE -> job.setPageable(test);
+        }
+
+        String fileName = pageRange == null
+                          ? baseName + "-all.pdf"
+                          : String.format("%s-%d-%d.pdf",
+                                          baseName,
+                                          pageRange.getMembers()[0][0],
+                                          pageRange.getMembers()[0][1]);
+
+        PrintRequestAttributeSet set = new HashPrintRequestAttributeSet();
+        set.add(new Destination(new File(fileName)
+                                        .toURI()));
+        if (pageRange != null) {
+            set.add(pageRange);
+        }
+
+        job.print(set);
+
+        return test.printedPages;
+    }
+
+    public static void main(String[] args) throws Exception {
+        final List<Error> errors = new ArrayList<>();
+
+        for (Type type : Type.values()) {
+            BitSet pages; // Printed pages
+
+            // Print all pages
+            System.out.println(type + " - all pages");
+            pages = printJob(type, null);
+            if (!IntStream.range(0, MAX_PAGE)
+                          .allMatch(pages::get)) {
+                errors.add(new Error("Not all pages printed in " + type + ": "
+                                     + pages));
+            }
+
+            // Print page range
+            for (int[] range : ranges) {
+                System.out.println(type + " - " + Arrays.toString(range));
+                pages = printJob(type, new PageRanges(range[0], range[1]));
+                if (!IntStream.range(range[0] - 1, range[1])
+                              .allMatch(pages::get)) {
+                    errors.add(new Error("Not all pages printed in " + type
+                                         + " within the range "
+                                         + Arrays.toString(range)
+                                         + ": " + pages));
+                }
+            }
+        }
+
+        if (!errors.isEmpty()) {
+            errors.forEach(System.err::println);
+            throw new RuntimeException("Errors detected: " + errors.size()
+                                       + ". - " + errors.getFirst());
+        }
+    }
+
+    @Override
+    public int print(Graphics g, PageFormat format, int pageIndex)
+            throws PrinterException {
+        printedPages.set(pageIndex);
+
+        final int pageNo = pageIndex + 1;
+        System.out.println("    test.printPage " + pageNo);
+        if (pageIndex >= MAX_PAGE) {
+            return NO_SUCH_PAGE;
+        }
+
+        g.setFont(font);
+        g.drawString("Page: " + pageNo,
+                     100, 150);
+
+        return PAGE_EXISTS;
+    }
+
+    @Override
+    public int getNumberOfPages() {
+        System.out.println("  test.getNumberOfPages = " + MAX_PAGE);
+        return MAX_PAGE;
+    }
+
+    @Override
+    public PageFormat getPageFormat(int pageIndex)
+            throws IndexOutOfBoundsException {
+        checkPageIndex(pageIndex);
+        return new PageFormat();
+    }
+
+    @Override
+    public Printable getPrintable(int pageIndex)
+            throws IndexOutOfBoundsException {
+        checkPageIndex(pageIndex);
+        System.out.println("  test.getPrintable(" + (pageIndex + 1) + ")");
+        return this;
+    }
+
+    private static void checkPageIndex(int pageIndex)
+            throws IndexOutOfBoundsException {
+        if (pageIndex < 0) {
+            throw new IndexOutOfBoundsException("pageIndex < 0");
+        }
+
+        if (pageIndex >= MAX_PAGE) {
+            throw new IndexOutOfBoundsException("pageIndex >= " + MAX_PAGE);
+        }
+    }
+}

From 6aae92e6f13f5964270c6ce5b54a14e98c1b6fe1 Mon Sep 17 00:00:00 2001
From: Fei Yang <fyang@openjdk.org>
Date: Tue, 10 Mar 2026 12:23:06 +0000
Subject: [PATCH 121/655] 8379564: Hotspot fails to build with gcc 14 after
 JDK-8378804

Reviewed-by: ysuenaga, stuefe
---
 src/hotspot/share/gc/shenandoah/shenandoahTaskqueue.hpp | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/src/hotspot/share/gc/shenandoah/shenandoahTaskqueue.hpp b/src/hotspot/share/gc/shenandoah/shenandoahTaskqueue.hpp
index 42db0b2fd2c..dbae1b35c6f 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahTaskqueue.hpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahTaskqueue.hpp
@@ -1,6 +1,6 @@
 /*
  * Copyright (c) 2016, 2024, Red Hat, Inc. All rights reserved.
- * Copyright (c) 2024, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2024, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -320,7 +320,7 @@ public:
     DEBUG_ONLY(_reserved = 0; )
   }
 
-  void clear_claimed() { _claimed_index = 0; }
+  void clear_claimed() { _claimed_index.store_relaxed(0); }
   T*   claim_next();
 
   // reserve queues that not for parallel claiming

From f95e8136b1f69d2c263d0126dcbc9dbc0a485352 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Joel=20Sikstr=C3=B6m?= <jsikstro@openjdk.org>
Date: Tue, 10 Mar 2026 12:37:39 +0000
Subject: [PATCH 122/655] 8379412: JfrJavaSupport::new_string should return
 early if pending exception

Reviewed-by: mgronlun
---
 src/hotspot/share/jfr/jni/jfrJavaSupport.cpp | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/src/hotspot/share/jfr/jni/jfrJavaSupport.cpp b/src/hotspot/share/jfr/jni/jfrJavaSupport.cpp
index 59a9d8a9090..a6e97ab227a 100644
--- a/src/hotspot/share/jfr/jni/jfrJavaSupport.cpp
+++ b/src/hotspot/share/jfr/jni/jfrJavaSupport.cpp
@@ -228,7 +228,7 @@ void JfrJavaSupport::new_object_global_ref(JfrJavaArguments* args, TRAPS) {
 jstring JfrJavaSupport::new_string(const char* c_str, TRAPS) {
   assert(c_str != nullptr, "invariant");
   DEBUG_ONLY(check_java_thread_in_vm(THREAD));
-  const oop result = java_lang_String::create_oop_from_str(c_str, THREAD);
+  const oop result = java_lang_String::create_oop_from_str(c_str, CHECK_NULL);
   return (jstring)local_jni_handle(result, THREAD);
 }
 

From bad59c55d98b2ef3b4a810e767577093b44764cd Mon Sep 17 00:00:00 2001
From: Roger Riggs <rriggs@openjdk.org>
Date: Tue, 10 Mar 2026 13:05:11 +0000
Subject: [PATCH 123/655] 8379437: Refactor ProcessBuilder and ProcessHandle
 tests to JUnit

Reviewed-by: jpai
---
 .../lang/ProcessBuilder/InheritIOTest.java    |  36 +++---
 .../lang/ProcessBuilder/ProcessReaperCCL.java |  17 ++-
 .../ProcessStartLoggingTest.java              |   5 +-
 .../lang/ProcessBuilder/ReaderWriterTest.java | 116 +++++++-----------
 test/jdk/java/lang/ProcessHandle/Basic.java   |  61 ++++-----
 .../jdk/java/lang/ProcessHandle/InfoTest.java |  94 +++++++-------
 .../java/lang/ProcessHandle/OnExitTest.java   |  64 ++++------
 .../jdk/java/lang/ProcessHandle/TreeTest.java | 109 ++++++++--------
 8 files changed, 215 insertions(+), 287 deletions(-)

diff --git a/test/jdk/java/lang/ProcessBuilder/InheritIOTest.java b/test/jdk/java/lang/ProcessBuilder/InheritIOTest.java
index a372eeefbf8..b3f52663a59 100644
--- a/test/jdk/java/lang/ProcessBuilder/InheritIOTest.java
+++ b/test/jdk/java/lang/ProcessBuilder/InheritIOTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2020, 2023, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,21 +23,22 @@
 
 /*
  * @test
- * @bug 8023130 8166026
  * @summary Unit test for java.lang.ProcessBuilder inheritance of standard output and standard error streams
+ * @bug 8023130 8166026
  * @requires vm.flagless
  * @library /test/lib
  * @build jdk.test.lib.process.*
- * @run testng InheritIOTest
+ * @run junit InheritIOTest
  */
 
 import java.util.List;
 import static java.lang.ProcessBuilder.Redirect.INHERIT;
 import jdk.test.lib.process.OutputAnalyzer;
 import jdk.test.lib.process.ProcessTools;
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
-import static org.testng.Assert.*;
+import static org.junit.jupiter.api.Assertions.*;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.Arguments;
+import org.junit.jupiter.params.provider.MethodSource;
 
 public class InheritIOTest {
 
@@ -45,25 +46,25 @@ public class InheritIOTest {
     private static final String EXPECTED_RESULT_STDOUT = "message";
     private static final String EXPECTED_RESULT_STDERR = EXIT_VALUE_TEMPLATE.formatted(0);
 
-    @DataProvider
-    public Object[][] testCases() {
-        return new Object[][]{
-             new Object[] { List.of("InheritIOTest$TestInheritIO", "printf", EXPECTED_RESULT_STDOUT) },
-             new Object[] { List.of("InheritIOTest$TestRedirectInherit", "printf", EXPECTED_RESULT_STDOUT) }
-        };
+    public static List<Arguments> testCases() {
+        return List.of(
+             Arguments.of(List.of("InheritIOTest$TestInheritIO", "printf", EXPECTED_RESULT_STDOUT)),
+             Arguments.of(List.of("InheritIOTest$TestRedirectInherit", "printf", EXPECTED_RESULT_STDOUT))
+        );
     }
 
-    @Test(dataProvider = "testCases")
+    @ParameterizedTest
+    @MethodSource("testCases")
     public void testInheritWithoutRedirect(List<String> arguments) throws Throwable {
         ProcessBuilder processBuilder = ProcessTools.createLimitedTestJavaProcessBuilder(arguments);
         OutputAnalyzer outputAnalyzer = ProcessTools.executeCommand(processBuilder);
         outputAnalyzer.shouldHaveExitValue(0);
-        assertEquals(outputAnalyzer.getStdout(), EXPECTED_RESULT_STDOUT);
-        assertEquals(outputAnalyzer.getStderr(), EXPECTED_RESULT_STDERR);
+        assertEquals(EXPECTED_RESULT_STDOUT, outputAnalyzer.getStdout());
+        assertEquals(EXPECTED_RESULT_STDERR, outputAnalyzer.getStderr());
     }
 
     public static class TestInheritIO {
-        public static void main(String args[]) throws Throwable {
+        public static void main(String[] args) throws Throwable {
             int err = new ProcessBuilder(args).inheritIO().start().waitFor();
             System.err.printf(EXIT_VALUE_TEMPLATE, err);
             System.exit(err);
@@ -71,7 +72,7 @@ public class InheritIOTest {
     }
 
     public static class TestRedirectInherit {
-        public static void main(String args[]) throws Throwable {
+        public static void main(String[] args) throws Throwable {
             int err = new ProcessBuilder(args)
                     .redirectInput(INHERIT)
                     .redirectOutput(INHERIT)
@@ -81,5 +82,4 @@ public class InheritIOTest {
             System.exit(err);
         }
     }
-
 }
diff --git a/test/jdk/java/lang/ProcessBuilder/ProcessReaperCCL.java b/test/jdk/java/lang/ProcessBuilder/ProcessReaperCCL.java
index 79593b014c3..605441cb996 100644
--- a/test/jdk/java/lang/ProcessBuilder/ProcessReaperCCL.java
+++ b/test/jdk/java/lang/ProcessBuilder/ProcessReaperCCL.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2022, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2022, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,9 +23,9 @@
 
 /*
  * @test
- * @bug 8269488
  * @summary verify that Process Reaper threads have a null CCL
- * @run testng ProcessReaperCCL
+ * @bug 8269488
+ * @run junit ProcessReaperCCL
  */
 
 import java.io.File;
@@ -34,14 +34,13 @@ import java.net.URLClassLoader;
 import java.util.List;
 import java.util.concurrent.CompletableFuture;
 
-import org.testng.Assert;
-import org.testng.annotations.Test;
-
+import org.junit.jupiter.api.Assertions;
+import org.junit.jupiter.api.Test;
 
 public class ProcessReaperCCL {
 
     @Test
-    static void test() throws Exception {
+    void test() throws Exception {
         // create a class loader
         File dir = new File(".");
         URL[] urls = new URL[] {dir.toURI().toURL()};
@@ -53,12 +52,12 @@ public class ProcessReaperCCL {
         Process p = pb.start();
         CompletableFuture<Process> cf = p.onExit();
         int exitValue = cf.get().exitValue();
-        Assert.assertEquals(exitValue, 0, "error exit value");
+        Assertions.assertEquals(0, exitValue, "error exit value");
 
         // Verify all "Process Reaper" threads have a null CCL
         for (Thread th : Thread.getAllStackTraces().keySet()) {
             if (th.getName().startsWith("process reaper")) {
-                Assert.assertEquals(th.getContextClassLoader(), null, "CCL not null");
+                Assertions.assertNull(th.getContextClassLoader(), "CCL not null");
             }
         }
     }
diff --git a/test/jdk/java/lang/ProcessBuilder/ProcessStartLoggingTest.java b/test/jdk/java/lang/ProcessBuilder/ProcessStartLoggingTest.java
index e9b2fa6b264..2f2bc3c3cee 100644
--- a/test/jdk/java/lang/ProcessBuilder/ProcessStartLoggingTest.java
+++ b/test/jdk/java/lang/ProcessBuilder/ProcessStartLoggingTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2023, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2023, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -34,8 +34,7 @@ import java.util.stream.Stream;
 import org.junit.jupiter.params.provider.Arguments;
 import org.junit.jupiter.params.provider.MethodSource;
 import org.junit.jupiter.params.ParameterizedTest;
-import static org.junit.jupiter.api.Assertions.assertEquals;
-import static org.junit.jupiter.api.Assertions.fail;
+import static org.junit.jupiter.api.Assertions.*;
 
 /*
  * @test
diff --git a/test/jdk/java/lang/ProcessBuilder/ReaderWriterTest.java b/test/jdk/java/lang/ProcessBuilder/ReaderWriterTest.java
index a73451417bf..6bff8d5e592 100644
--- a/test/jdk/java/lang/ProcessBuilder/ReaderWriterTest.java
+++ b/test/jdk/java/lang/ProcessBuilder/ReaderWriterTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2021, 2023, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2021, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -21,17 +21,10 @@
  * questions.
  */
 
-import static org.testng.Assert.*;
-
-import org.testng.Assert;
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
+import static org.junit.jupiter.api.Assertions.*;
 
 import jdk.test.lib.process.ProcessTools;
 
-import jdk.test.lib.hexdump.HexPrinter;
-import jdk.test.lib.hexdump.HexPrinter.Formatters;
-
 import java.io.BufferedReader;
 import java.io.BufferedWriter;
 import java.io.IOException;
@@ -42,20 +35,23 @@ import java.nio.file.Files;
 import java.nio.charset.Charset;
 import java.nio.charset.StandardCharsets;
 import java.nio.charset.UnsupportedCharsetException;
-import java.util.List;
-import java.util.Locale;
+import java.util.stream.Stream;
 
 import jtreg.SkippedException;
+import org.junit.jupiter.api.Test;
+import org.junit.jupiter.api.TestInstance;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.Arguments;
+import org.junit.jupiter.params.provider.MethodSource;
 
 /*
  * @test
  * @requires vm.flagless
  * @library /test/lib
- * @build jdk.test.lib.process.ProcessTools jdk.test.lib.hexdump.HexPrinter
- * @run testng ReaderWriterTest
+ * @build jdk.test.lib.process.ProcessTools
+ * @run junit ReaderWriterTest
  */
 
-@Test
 public class ReaderWriterTest {
 
     static final String ASCII = "ASCII: \u0000_A-Z_a-Z_\u007C_\u007D_\u007E_\u007F_;";
@@ -65,13 +61,12 @@ public class ReaderWriterTest {
     public static final String TESTCHARS = "OneWay: " + ASCII + ISO_8859_1 + FRACTIONS;
     public static final String ROUND_TRIP_TESTCHARS = "RoundTrip: " + ASCII + ISO_8859_1 + FRACTIONS;
 
-    @DataProvider(name="CharsetCases")
-    static Object[][] charsetCases() {
-        return new Object[][] {
-                {"UTF-8"},
-                {"ISO8859-1"},
-                {"US-ASCII"},
-        };
+    static Stream<Arguments> charsetCases() {
+        return Stream.of(
+                Arguments.of("UTF-8"),
+                Arguments.of("ISO8859-1"),
+                Arguments.of("US-ASCII")
+        );
     }
 
     /**
@@ -93,7 +88,7 @@ public class ReaderWriterTest {
             if (exitValue != 0)
                 System.out.println("exitValue: " + exitValue);
         } catch (InterruptedException ie) {
-            Assert.fail("waitFor interrupted");
+            fail("waitFor interrupted");
         }
     }
 
@@ -131,32 +126,28 @@ public class ReaderWriterTest {
             if (errType == 2 || errType == 3) {
                 pb.redirectErrorStream(true);
             }
-            Process p = pb.start();
-            // Output has been redirected to a null stream; success is IOException on the write
-            try {
+            try (Process p = pb.start()) {
+                // Output has been redirected to a null stream; success is IOException on the write
                 BufferedWriter wr = p.outputWriter();
-                wr.write("X");
-                wr.flush();
-                Assert.fail("writing to null stream should throw IOException");
-            } catch (IOException ioe) {
-                // Normal, A Null output stream is closed when created.
-            }
+                assertThrows(IOException.class, () -> {
+                    wr.write("X");
+                    wr.flush();
+                });
 
-            // InputReader should be empty; and at EOF
-            BufferedReader inputReader = p.inputReader();
-            int ch = inputReader.read();
-            Assert.assertEquals(ch, -1, "inputReader not at EOF: ch: " + (char)ch);
+                // InputReader should be empty; and at EOF
+                BufferedReader inputReader = p.inputReader();
+                int ch = inputReader.read();
+                assertEquals(-1, ch, "inputReader not at EOF: ch: " + (char) ch);
 
-            // InputReader should be empty; and at EOF
-            BufferedReader errorReader = p.errorReader();
-            ch = errorReader.read();
-            Assert.assertEquals(ch, -1, "errorReader not at EOF: ch: " + (char)ch);
+                // InputReader should be empty; and at EOF
+                BufferedReader errorReader = p.errorReader();
+                ch = errorReader.read();
+                assertEquals(-1, ch, "errorReader not at EOF: ch: " + (char) ch);
 
-            try {
                 int exitValue = p.waitFor();
                 if (exitValue != 0) System.out.println("exitValue: " + exitValue);
             } catch (InterruptedException ie) {
-                Assert.fail("waitFor interrupted");
+                fail("waitFor interrupted");
             }
         }
     }
@@ -181,7 +172,8 @@ public class ReaderWriterTest {
      *
      * @param encoding a charset name
      */
-    @Test(dataProvider = "CharsetCases", enabled = true)
+    @ParameterizedTest
+    @MethodSource("charsetCases")
     void testCase(String encoding) throws IOException {
         Charset cs = null;
         try {
@@ -221,32 +213,10 @@ public class ReaderWriterTest {
         ProcessBuilder pb = ProcessTools.createLimitedTestJavaProcessBuilder(
                 "ReaderWriterTest$ChildWithCharset");
 
-        Process p = pb.start();
-        try {
-            writeTestChars(p.outputWriter(null));
-            Assert.fail("Process.outputWriter(null) did not throw NPE");
-        } catch (NullPointerException npe) {
-            // expected, ignore
-        }
-        try {
-            checkReader(p.inputReader(null), null, "Out");
-            Assert.fail("Process.inputReader(null) did not throw NPE");
-        } catch (NullPointerException npe) {
-            // expected, ignore
-        }
-        try {
-            checkReader(p.errorReader(null), null, "Err");
-            Assert.fail("Process.errorReader(null) did not throw NPE");
-        } catch (NullPointerException npe) {
-            // expected, ignore
-        }
-
-        p.destroyForcibly();
-        try {
-            // Collect the exit status to cleanup after the process; but ignore it
-            p.waitFor();
-        } catch (InterruptedException ie) {
-            // Ignored
+        try (Process p = pb.start()) {
+            assertThrows(NullPointerException.class, () -> writeTestChars(p.outputWriter(null)));
+            assertThrows(NullPointerException.class, () -> checkReader(p.inputReader(null), null, "Out"));
+            assertThrows(NullPointerException.class, () -> checkReader(p.errorReader(null), null, "Err"));
         }
     }
 
@@ -272,7 +242,7 @@ public class ReaderWriterTest {
             var writer = p.outputWriter(cs);
             writer = p.outputWriter(cs);        // try again with same
             writer = p.outputWriter(otherCharset);  // this should throw
-            Assert.fail("Process.outputWriter(otherCharset) did not throw IllegalStateException");
+            fail("Process.outputWriter(otherCharset) did not throw IllegalStateException");
         } catch (IllegalStateException ile) {
             // expected, ignore
             System.out.println(ile);
@@ -281,7 +251,7 @@ public class ReaderWriterTest {
             var reader = p.inputReader(cs);
             reader = p.inputReader(cs);             // try again with same
             reader = p.inputReader(otherCharset);   // this should throw
-            Assert.fail("Process.inputReader(otherCharset) did not throw IllegalStateException");
+            fail("Process.inputReader(otherCharset) did not throw IllegalStateException");
         } catch (IllegalStateException ile) {
             // expected, ignore
             System.out.println(ile);
@@ -290,7 +260,7 @@ public class ReaderWriterTest {
             var reader = p.errorReader(cs);
             reader = p.errorReader(cs);             // try again with same
             reader = p.errorReader(otherCharset);   // this should throw
-            Assert.fail("Process.errorReader(otherCharset) did not throw IllegalStateException");
+            fail("Process.errorReader(otherCharset) did not throw IllegalStateException");
         } catch (IllegalStateException ile) {
             // expected, ignore
             System.out.println(ile);
@@ -320,13 +290,13 @@ public class ReaderWriterTest {
             String reencoded = cs.decode(bb).toString();
             if (!firstline.equals(reencoded))
                 diffStrings(firstline, reencoded);
-            assertEquals(firstline, reencoded, label + " Test Chars");
+            assertEquals(reencoded, firstline, label + " Test Chars");
 
             bb = cs.encode(ROUND_TRIP_TESTCHARS);
             reencoded = cs.decode(bb).toString();
             if (!secondline.equals(reencoded))
                 diffStrings(secondline, reencoded);
-            assertEquals(secondline, reencoded, label + " Round Trip Test Chars");
+            assertEquals(reencoded, secondline, label + " Round Trip Test Chars");
         }
     }
 
diff --git a/test/jdk/java/lang/ProcessHandle/Basic.java b/test/jdk/java/lang/ProcessHandle/Basic.java
index 09674814283..d0342b35a23 100644
--- a/test/jdk/java/lang/ProcessHandle/Basic.java
+++ b/test/jdk/java/lang/ProcessHandle/Basic.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2014, 2017, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2014, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -21,21 +21,22 @@
  * questions.
  */
 
-import static org.testng.Assert.assertEquals;
-import static org.testng.Assert.assertFalse;
-import static org.testng.Assert.assertTrue;
-import static org.testng.Assert.fail;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertFalse;
+import static org.junit.jupiter.api.Assertions.assertTrue;
+import static org.junit.jupiter.api.Assertions.fail;
 
 import java.io.IOException;
 import java.util.List;
 import java.util.Optional;
 import java.util.stream.Collectors;
 
-import org.testng.TestNG;
-import org.testng.annotations.Test;
+import org.junit.jupiter.api.Assertions;
+import org.junit.jupiter.api.Test;
 
 /*
  * @test
+ * @summary Basic tests for ProcessHandler
  * @library /test/lib
  * @modules java.base/jdk.internal.misc
  *          jdk.management
@@ -45,20 +46,18 @@ import org.testng.annotations.Test;
  *        jdk.test.lib.JDKToolLauncher
  *        jdk.test.lib.Platform
  *        jdk.test.lib.process.*
- * @run testng Basic
- * @summary Basic tests for ProcessHandler
- * @author Roger Riggs
+ * @run junit Basic
  */
 public class Basic {
     /**
      * Tests of ProcessHandle.current.
      */
     @Test
-    public static void test1() {
+    public void test1() {
         try {
             ProcessHandle self = ProcessHandle.current();
             ProcessHandle self1 = ProcessHandle.current();
-            assertEquals(self, self1); //, "get pid twice should be same %d: %d");
+            assertEquals(self1, self); //, "get pid twice should be same %d: %d");
         } finally {
             // Cleanup any left over processes
             ProcessHandle.current().children().forEach(ProcessHandle::destroy);
@@ -69,16 +68,16 @@ public class Basic {
      * Tests of ProcessHandle.get.
      */
     @Test
-    public static void test2() {
+    public void test2() {
         try {
             ProcessHandle self = ProcessHandle.current();
             long pid = self.pid();       // known native process id
             Optional<ProcessHandle> self1 = ProcessHandle.of(pid);
-            assertEquals(self1.get(), self,
+            assertEquals(self, self1.get(),
                     "ProcessHandle.of(x.pid()) should be equal pid() %d: %d");
 
             Optional<ProcessHandle> ph = ProcessHandle.of(pid);
-            assertEquals(pid, ph.get().pid());
+            assertEquals(ph.get().pid(), pid);
         } finally {
             // Cleanup any left over processes
             ProcessHandle.current().children().forEach(ProcessHandle::destroy);
@@ -86,7 +85,7 @@ public class Basic {
     }
 
     @Test
-    public static void test3() {
+    public void test3() {
         // Test can get parent of current
         ProcessHandle ph = ProcessHandle.current();
         try {
@@ -99,7 +98,7 @@ public class Basic {
     }
 
     @Test
-    public static void test4() {
+    public void test4() {
         try {
             Process p = new ProcessBuilder("sleep", "0").start();
             p.waitFor();
@@ -118,7 +117,7 @@ public class Basic {
     }
 
     @Test
-    public static void test5() {
+    public void test5() {
         // Always contains itself.
         ProcessHandle current = ProcessHandle.current();
         List<ProcessHandle> list = ProcessHandle.allProcesses().collect(Collectors.toList());
@@ -131,23 +130,17 @@ public class Basic {
         }
     }
 
-    @Test(expectedExceptions = IllegalStateException.class)
-    public static void test6() {
-        ProcessHandle.current().onExit();
+    @Test
+    public void test6() {
+        Assertions.assertThrows(IllegalStateException.class, () -> {
+            ProcessHandle.current().onExit();
+        });
     }
 
-    @Test(expectedExceptions = IllegalStateException.class)
-    public static void test7() {
-        ProcessHandle.current().destroyForcibly();
+    @Test
+    public void test7() {
+        Assertions.assertThrows(IllegalStateException.class, () -> {
+            ProcessHandle.current().destroyForcibly();
+        });
     }
-
-    // Main can be used to run the tests from the command line with only testng.jar.
-    @SuppressWarnings("raw_types")
-    public static void main(String[] args) {
-        Class<?>[] testclass = {TreeTest.class};
-        TestNG testng = new TestNG();
-        testng.setTestClasses(testclass);
-        testng.run();
-    }
-
 }
diff --git a/test/jdk/java/lang/ProcessHandle/InfoTest.java b/test/jdk/java/lang/ProcessHandle/InfoTest.java
index 38c86db3b91..ea2739e14a7 100644
--- a/test/jdk/java/lang/ProcessHandle/InfoTest.java
+++ b/test/jdk/java/lang/ProcessHandle/InfoTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2014, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2014, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -39,15 +39,15 @@ import java.util.Optional;
 import java.util.Random;
 import java.util.concurrent.TimeUnit;
 
-import org.testng.Assert;
-import org.testng.TestNG;
-import org.testng.annotations.Test;
 
 import jdk.test.lib.Platform;
 import jdk.test.lib.Utils;
+import org.junit.jupiter.api.Assertions;
+import org.junit.jupiter.api.Test;
 
 /*
  * @test
+ * @summary Functions of ProcessHandle.Info
  * @bug 8077350 8081566 8081567 8098852 8136597
  * @requires os.arch != "riscv64" | !(vm.cpu.features ~= ".*qemu.*")
  * @library /test/lib
@@ -59,8 +59,7 @@ import jdk.test.lib.Utils;
  *        jdk.test.lib.JDKToolLauncher
  *        jdk.test.lib.Platform
  *        jdk.test.lib.process.*
- * @run testng InfoTest
- * @summary Functions of ProcessHandle.Info
+ * @run junit InfoTest
  * @author Roger Riggs
  */
 
@@ -82,19 +81,11 @@ public class InfoTest {
         }
     }
 
-    // Main can be used to run the tests from the command line with only testng.jar.
-    public static void main(String[] args) {
-        Class<?>[] testclass = {InfoTest.class};
-        TestNG testng = new TestNG();
-        testng.setTestClasses(testclass);
-        testng.run();
-    }
-
     /**
      * Test that cputime used shows up in ProcessHandle.info
      */
     @Test
-    public static void test1() {
+    public void test1() {
         System.out.println("Note: when run in samevm mode the cputime of the " +
                 "test runner is included.");
         ProcessHandle self = ProcessHandle.current();
@@ -108,7 +99,7 @@ public class InfoTest {
         System.out.printf(" info: %s%n", info);
         Optional<Duration> totalCpu = info.totalCpuDuration();
         if (totalCpu.isPresent() && (totalCpu.get().compareTo(someCPU) < 0)) {
-            Assert.fail("reported cputime less than expected: " + someCPU + ", " +
+            Assertions.fail("reported cputime less than expected: " + someCPU + ", " +
                     "actual: " + info.totalCpuDuration());
         }
     }
@@ -117,7 +108,7 @@ public class InfoTest {
      * Spawn a child with arguments and check they are visible via the ProcessHandle.
      */
     @Test
-    public static void test2() {
+    public void test2() {
         try {
             long cpuLoopTime = 100;             // 100 ms
             String[] extraArgs = {"pid", "parent", "stdin"};
@@ -170,7 +161,7 @@ public class InfoTest {
                         String expected = Platform.isWindows() ? javaExe + ".exe" : javaExe;
                         Path expectedPath = Paths.get(expected);
                         Path actualPath = Paths.get(command.get());
-                        Assert.assertTrue(Files.isSameFile(expectedPath, actualPath),
+                        Assertions.assertTrue(Files.isSameFile(expectedPath, actualPath),
                                 "Command: expected: " + javaExe + ", actual: " + command.get());
                     }
 
@@ -179,22 +170,20 @@ public class InfoTest {
 
                         int offset = args.length - extraArgs.length;
                         for (int i = 0; i < extraArgs.length; i++) {
-                            Assert.assertEquals(args[offset + i], extraArgs[i],
+                            Assertions.assertEquals(extraArgs[i], args[offset + i],
                                                 "Actual argument mismatch, index: " + i);
                         }
 
                         // Now check that the first argument is not the same as the executed command
-                        if (args.length > 0) {
-                            Assert.assertNotEquals(args[0], command,
-                                    "First argument should not be the executable: args[0]: "
-                                            + args[0] + ", command: " + command);
-                        }
+                        Assertions.assertNotEquals(command, args[0],
+                                "First argument should not be the executable: args[0]: "
+                                        + args[0] + ", command: " + command);
                     }
 
                     if (command.isPresent() && info.arguments().isPresent()) {
                         // If both, 'command' and 'arguments' are present,
                         // 'commandLine' is just the concatenation of the two.
-                        Assert.assertTrue(info.commandLine().isPresent(),
+                        Assertions.assertTrue(info.commandLine().isPresent(),
                                           "commandLine() must be available");
 
                         String javaExe = System.getProperty("test.jdk") +
@@ -204,15 +193,15 @@ public class InfoTest {
                         String commandLine = info.commandLine().get();
                         String commandLineCmd = commandLine.split(" ")[0];
                         Path commandLineCmdPath = Paths.get(commandLineCmd);
-                        Assert.assertTrue(Files.isSameFile(commandLineCmdPath, expectedPath),
+                        Assertions.assertTrue(Files.isSameFile(commandLineCmdPath, expectedPath),
                                           "commandLine() should start with: " + expectedPath +
                                           " but starts with " + commandLineCmdPath);
 
-                        Assert.assertTrue(commandLine.contains(command.get()),
+                        Assertions.assertTrue(commandLine.contains(command.get()),
                                 "commandLine() must contain the command: " + command.get());
                         List<String> allArgs = p1.getArgs();
                         for (int i = 1; i < allArgs.size(); i++) {
-                            Assert.assertTrue(commandLine.contains(allArgs.get(i)),
+                            Assertions.assertTrue(commandLine.contains(allArgs.get(i)),
                                               "commandLine() must contain argument: " + allArgs.get(i));
                         }
                     } else if (info.commandLine().isPresent() &&
@@ -222,14 +211,14 @@ public class InfoTest {
                         String commandLine = info.commandLine().get();
                         String javaExe = "java" + (Platform.isWindows() ? ".exe" : "");
                         int pos = commandLine.indexOf(javaExe);
-                        Assert.assertTrue(pos > 0, "commandLine() should at least contain 'java'");
+                        Assertions.assertTrue(pos > 0, "commandLine() should at least contain 'java'");
 
                         pos += javaExe.length() + 1; // +1 for the space after the command
                         List<String> allArgs = p1.getArgs();
                         // First argument is the command - skip it here as we've already checked that.
                         for (int i = 1; (i < allArgs.size()) &&
                                         (pos + allArgs.get(i).length() < commandLine.length()); i++) {
-                            Assert.assertTrue(commandLine.contains(allArgs.get(i)),
+                            Assertions.assertTrue(commandLine.contains(allArgs.get(i)),
                                               "commandLine() must contain argument: " + allArgs.get(i));
                             pos += allArgs.get(i).length() + 1;
                         }
@@ -242,14 +231,14 @@ public class InfoTest {
                             System.out.printf(" info.totalCPU: %s, childCpuTime: %s, diff: %s%n",
                                     totalCPU.toNanos(), childCpuTime.toNanos(),
                                     childCpuTime.toNanos() - totalCPU.toNanos());
-                            Assert.assertTrue(checkEpsilon(childCpuTime, totalCPU, epsilon),
+                            Assertions.assertTrue(checkEpsilon(childCpuTime, totalCPU, epsilon),
                                     childCpuTime + " should be within " +
                                             epsilon + " of " + totalCPU);
                         }
-                        Assert.assertTrue(totalCPU.toNanos() > 0L,
+                        Assertions.assertTrue(totalCPU.toNanos() > 0L,
                                 "total cpu time expected > 0ms, actual: " + totalCPU);
                         long t = Utils.adjustTimeout(10L);  // Adjusted timeout seconds
-                        Assert.assertTrue(totalCPU.toNanos() < lastCpu.toNanos() + t * 1_000_000_000L,
+                        Assertions.assertTrue(totalCPU.toNanos() < lastCpu.toNanos() + t * 1_000_000_000L,
                                 "total cpu time expected < " + t
                                         + " seconds more than previous iteration, actual: "
                                         + (totalCPU.toNanos() - lastCpu.toNanos()));
@@ -258,18 +247,18 @@ public class InfoTest {
 
                     if (info.startInstant().isPresent()) {
                         Instant startTime = info.startInstant().get();
-                        Assert.assertTrue(startTime.isBefore(afterStart),
+                        Assertions.assertTrue(startTime.isBefore(afterStart),
                                 "startTime after process spawn completed"
                                         + startTime + " + > " + afterStart);
                     }
                 }
             }
             p1.sendAction("exit");
-            Assert.assertTrue(p1.waitFor(Utils.adjustTimeout(30L), TimeUnit.SECONDS),
+            Assertions.assertTrue(p1.waitFor(Utils.adjustTimeout(30L), TimeUnit.SECONDS),
                     "timeout waiting for process to terminate");
         } catch (IOException | InterruptedException ie) {
             ie.printStackTrace(System.out);
-            Assert.fail("unexpected exception", ie);
+            Assertions.fail("unexpected exception", ie);
         } finally {
             // Destroy any children that still exist
             ProcessUtil.destroyProcessTree(ProcessHandle.current());
@@ -280,7 +269,7 @@ public class InfoTest {
      * Spawn a child with arguments and check they are visible via the ProcessHandle.
      */
     @Test
-    public static void test3() {
+    public void test3() {
         try {
             for (long sleepTime : Arrays.asList(Utils.adjustTimeout(30), Utils.adjustTimeout(32))) {
                 Process p = spawn("sleep", String.valueOf(sleepTime));
@@ -302,22 +291,22 @@ public class InfoTest {
                         Path executable = Files.readSymbolicLink(Paths.get("/bin/sleep"));
                         expected = executable.getFileName().toString();
                     }
-                    Assert.assertTrue(command.endsWith(expected), "Command: expected: \'" +
+                    Assertions.assertTrue(command.endsWith(expected), "Command: expected: \'" +
                             expected + "\', actual: " + command);
 
                     // Verify the command exists and is executable
                     File exe = new File(command);
-                    Assert.assertTrue(exe.exists(), "command must exist: " + exe);
-                    Assert.assertTrue(exe.canExecute(), "command must be executable: " + exe);
+                    Assertions.assertTrue(exe.exists(), "command must exist: " + exe);
+                    Assertions.assertTrue(exe.canExecute(), "command must be executable: " + exe);
                 }
                 if (info.arguments().isPresent()) {
                     String[] args = info.arguments().get();
                     if (args.length > 0) {
-                        Assert.assertEquals(args[0], String.valueOf(sleepTime));
+                        Assertions.assertEquals(String.valueOf(sleepTime), args[0]);
                     }
                 }
                 p.destroy();
-                Assert.assertTrue(p.waitFor(Utils.adjustTimeout(30), TimeUnit.SECONDS),
+                Assertions.assertTrue(p.waitFor(Utils.adjustTimeout(30), TimeUnit.SECONDS),
                         "timeout waiting for process to terminate");
             }
         } catch (IOException | InterruptedException ex) {
@@ -332,7 +321,7 @@ public class InfoTest {
      * Cross check the cputime reported from java.management with that for the current process.
      */
     @Test
-    public static void test4() {
+    public void test4() {
         Duration myCputime1 = ProcessUtil.MXBeanCpuTime();
 
         if (Platform.isAix()) {
@@ -367,26 +356,26 @@ public class InfoTest {
                     Objects.toString(total2), myCputime2, myCputime2.minus(total2));
 
             Duration epsilon = Duration.ofMillis(200L);      // Epsilon is 200ms.
-            Assert.assertTrue(checkEpsilon(myCputime1, myCputime2, epsilon),
+            Assertions.assertTrue(checkEpsilon(myCputime1, myCputime2, epsilon),
                     myCputime1.toNanos() + " should be within " + epsilon
                             + " of " + myCputime2.toNanos());
-            Assert.assertTrue(checkEpsilon(total1, total2, epsilon),
+            Assertions.assertTrue(checkEpsilon(total1, total2, epsilon),
                     total1.toNanos() + " should be within " + epsilon
                             + " of " + total2.toNanos());
-            Assert.assertTrue(checkEpsilon(myCputime1, total1, epsilon),
+            Assertions.assertTrue(checkEpsilon(myCputime1, total1, epsilon),
                     myCputime1.toNanos() + " should be within " + epsilon
                             + " of " + total1.toNanos());
-            Assert.assertTrue(checkEpsilon(total1, myCputime2, epsilon),
+            Assertions.assertTrue(checkEpsilon(total1, myCputime2, epsilon),
                     total1.toNanos() + " should be within " + epsilon
                             + " of " + myCputime2.toNanos());
-            Assert.assertTrue(checkEpsilon(myCputime2, total2, epsilon),
+            Assertions.assertTrue(checkEpsilon(myCputime2, total2, epsilon),
                     myCputime2.toNanos() + " should be within " + epsilon
                             + " of " + total2.toNanos());
         }
     }
 
     @Test
-    public static void test5() {
+    public void test5() {
         ProcessHandle self = ProcessHandle.current();
         Random r = new Random();
         for (int i = 0; i < 30; i++) {
@@ -458,13 +447,12 @@ public class InfoTest {
             return;
         }
         String user = info.user().get();
-        Assert.assertNotNull(user, "User name");
+        Assertions.assertNotNull(user, "User name");
         if (Platform.isWindows() && "BUILTIN\\Administrators".equals(whoami)) {
             int bsi = user.lastIndexOf("\\");
-            Assert.assertEquals(bsi == -1 ? user : user.substring(bsi + 1),
-                    System.getProperty("user.name"), "User name");
+            Assertions.assertEquals(System.getProperty("user.name"), bsi == -1 ? user : user.substring(bsi + 1), "User name");
         } else {
-            Assert.assertEquals(user, whoami, "User name");
+            Assertions.assertEquals(whoami, user, "User name");
         }
     }
 }
diff --git a/test/jdk/java/lang/ProcessHandle/OnExitTest.java b/test/jdk/java/lang/ProcessHandle/OnExitTest.java
index 79c696efdfc..45c2b51e398 100644
--- a/test/jdk/java/lang/ProcessHandle/OnExitTest.java
+++ b/test/jdk/java/lang/ProcessHandle/OnExitTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2014, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2014, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -35,37 +35,27 @@ import java.util.concurrent.TimeUnit;
 import jdk.test.lib.Platform;
 import jdk.test.lib.Utils;
 
-import org.testng.annotations.Test;
-import org.testng.Assert;
-import org.testng.TestNG;
+import org.junit.jupiter.api.Assertions;
+import org.junit.jupiter.api.Test;
 
 /*
  * @test
+ * @summary Functions of Process.onExit and ProcessHandle.onExit
  * @bug 8333742
  * @requires vm.flagless
  * @library /test/lib
  * @modules jdk.management
  * @build jdk.test.lib.Utils
- * @run testng OnExitTest
- * @summary Functions of Process.onExit and ProcessHandle.onExit
- * @author Roger Riggs
+ * @run junit OnExitTest
  */
 
 public class OnExitTest extends ProcessUtil {
 
-    @SuppressWarnings("raw_types")
-    public static void main(String[] args) {
-        Class<?>[] testclass = { OnExitTest.class};
-        TestNG testng = new TestNG();
-        testng.setTestClasses(testclass);
-        testng.run();
-    }
-
     /**
      * Basic test of exitValue and onExit.
      */
     @Test
-    public static void test1() {
+    public void test1() {
         try {
             int[] exitValues = {0, 1, 10, 259};
             for (int value : exitValues) {
@@ -73,24 +63,24 @@ public class OnExitTest extends ProcessUtil {
                 if (value == 259 && !Platform.isWindows()) continue;
                 Process p = JavaChild.spawn("exit", Integer.toString(value));
                 CompletableFuture<Process> future = p.onExit();
-                future.thenAccept( (ph) -> {
+                future.thenAccept((ph) -> {
                     int actualExitValue = ph.exitValue();
                     printf(" javaChild done: %s, exitStatus: %d%n",
                             ph, actualExitValue);
-                    Assert.assertEquals(actualExitValue, value, "actualExitValue incorrect");
-                    Assert.assertEquals(ph, p, "Different Process passed to thenAccept");
+                    Assertions.assertEquals(value, actualExitValue, "actualExitValue incorrect");
+                    Assertions.assertEquals(p, ph, "Different Process passed to thenAccept");
                 });
 
                 Process h = future.get();
-                Assert.assertEquals(h, p);
-                Assert.assertEquals(p.exitValue(), value);
-                Assert.assertFalse(p.isAlive(), "Process should not be alive");
-                Assert.assertEquals(p.waitFor(), value);
-                Assert.assertTrue(p.waitFor(1, TimeUnit.MILLISECONDS),
+                Assertions.assertEquals(p, h);
+                Assertions.assertEquals(value, p.exitValue());
+                Assertions.assertFalse(p.isAlive(), "Process should not be alive");
+                Assertions.assertEquals(value, p.waitFor());
+                Assertions.assertTrue(p.waitFor(1, TimeUnit.MILLISECONDS),
                         "waitFor should return true");
             }
         } catch (IOException | InterruptedException | ExecutionException ex) {
-            Assert.fail(ex.getMessage(), ex);
+            Assertions.fail(ex.getMessage(), ex);
         } finally {
             destroyProcessTree(ProcessHandle.current());
         }
@@ -101,7 +91,7 @@ public class OnExitTest extends ProcessUtil {
      * Spawn 1 child to spawn 3 children each with 2 children.
      */
     @Test
-    public static void test2() {
+    public void test2() {
 
         // Please note (JDK-8284282):
         //
@@ -176,7 +166,7 @@ public class OnExitTest extends ProcessUtil {
             // Check that each of the spawned processes is included in the children
             List<ProcessHandle> remaining = new ArrayList<>(children);
             processes.forEach((p, parent) -> {
-                Assert.assertTrue(remaining.remove(p), "spawned process should have been in children");
+                Assertions.assertTrue(remaining.remove(p), "spawned process should have been in children");
             });
 
             // Remove Win32 system spawned conhost.exe processes
@@ -204,7 +194,7 @@ public class OnExitTest extends ProcessUtil {
             // Verify that all 9 exit handlers were called with the correct ProcessHandle
             processes.forEach((p, parent) -> {
                 ProcessHandle value = completions.get(p).getNow(null);
-                Assert.assertEquals(p, value, "onExit.get value expected: " + p
+                Assertions.assertEquals(value, p, "onExit.get value expected: " + p
                         + ", actual: " + value
                         + ": " + p.info());
             });
@@ -212,9 +202,9 @@ public class OnExitTest extends ProcessUtil {
             // Show the status of the original children
             children.forEach(p -> printProcess(p, "after onExit:"));
 
-            Assert.assertEquals(proc.isAlive(), false, "destroyed process is alive:: %s%n" + proc);
+            Assertions.assertFalse(proc.isAlive(), "destroyed process is alive:: %s%n" + proc);
         } catch (IOException | InterruptedException ex) {
-            Assert.fail(ex.getMessage());
+            Assertions.fail(ex.getMessage(), ex);
         } finally {
             if (procHandle != null) {
                 destroyProcessTree(procHandle);
@@ -231,7 +221,7 @@ public class OnExitTest extends ProcessUtil {
      * Check that (B) does not complete until (A) has exited.
      */
     @Test
-    public static void peerOnExitTest() {
+    public void peerOnExitTest() {
         String line = null;
         ArrayBlockingQueue<String> alines = new ArrayBlockingQueue<>(100);
         ArrayBlockingQueue<String> blines = new ArrayBlockingQueue<>(100);
@@ -265,9 +255,9 @@ public class OnExitTest extends ProcessUtil {
                 try {
                     line = blines.poll(5L, TimeUnit.SECONDS);
                 } catch (InterruptedException ie) {
-                    Assert.fail("interrupted", ie);
+                    Assertions.fail("interrupted", ie);
                 }
-                Assert.assertNull(line, "waitpid didn't wait");
+                Assertions.assertNull(line, "waitpid didn't wait");
 
                 A.toHandle().onExit().thenAccept(p -> {
                     System.out.printf(" A.toHandle().onExit().A info: %s, now: %s%n",
@@ -296,16 +286,16 @@ public class OnExitTest extends ProcessUtil {
                     split = getSplitLine(blines);
                 } while (!"waitpid".equals(split[1]));
 
-                Assert.assertEquals(split[2], "false",  "Process A should not be alive");
+                Assertions.assertEquals("false", split[2],  "Process A should not be alive");
 
                 B.sendAction("exit", 0L);
             } catch (IOException ioe) {
-                Assert.fail("unable to start JavaChild B", ioe);
+                Assertions.fail("unable to start JavaChild B", ioe);
             } finally {
                 B.destroyForcibly();
             }
         } catch (IOException ioe2) {
-            Assert.fail("unable to start JavaChild A", ioe2);
+            Assertions.fail("unable to start JavaChild A", ioe2);
         } finally {
             A.destroyForcibly();
         }
@@ -328,7 +318,7 @@ public class OnExitTest extends ProcessUtil {
             }
             return split;
         } catch (InterruptedException ie) {
-            Assert.fail("interrupted", ie);
+            Assertions.fail("interrupted", ie);
             return null;
         }
     }
diff --git a/test/jdk/java/lang/ProcessHandle/TreeTest.java b/test/jdk/java/lang/ProcessHandle/TreeTest.java
index cec880f1fef..567cfea2895 100644
--- a/test/jdk/java/lang/ProcessHandle/TreeTest.java
+++ b/test/jdk/java/lang/ProcessHandle/TreeTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2014, 2023, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2014, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -38,12 +38,12 @@ import java.util.stream.Collectors;
 import java.util.stream.Stream;
 
 import jdk.test.lib.Utils;
-import org.testng.Assert;
-import org.testng.TestNG;
-import org.testng.annotations.Test;
+import org.junit.jupiter.api.Assertions;
+import org.junit.jupiter.api.Test;
 
 /*
  * @test
+ * @summary Test counting and JavaChild.spawning and counting of Processes.
  * @requires vm.flagless
  * @library /test/lib
  * @modules java.base/jdk.internal.misc
@@ -54,25 +54,15 @@ import org.testng.annotations.Test;
  *        jdk.test.lib.JDKToolLauncher
  *        jdk.test.lib.Platform
  *        jdk.test.lib.process.*
- * @run testng/othervm TreeTest
- * @summary Test counting and JavaChild.spawning and counting of Processes.
+ * @run junit/othervm TreeTest
  * @author Roger Riggs
  */
 public class TreeTest extends ProcessUtil {
-    // Main can be used to run the tests from the command line with only testng.jar.
-    @SuppressWarnings("raw_types")
-    public static void main(String[] args) {
-        Class<?>[] testclass = {TreeTest.class};
-        TestNG testng = new TestNG();
-        testng.setTestClasses(testclass);
-        testng.run();
-    }
-
     /**
      * Test counting and spawning and counting of Processes.
      */
     @Test
-    public static void test1() {
+    public void test1() {
         final int MAXCHILDREN = 2;
         List<JavaChild> spawned = new ArrayList<>();
 
@@ -92,14 +82,14 @@ public class TreeTest extends ProcessUtil {
             spawned.stream()
                     .map(Process::toHandle)
                     .filter(p -> !initialChildren.contains(p))
-                    .forEach(p -> Assert.fail("Spawned process missing from children: " + p));
+                    .forEach(p -> Assertions.fail("Spawned process missing from children: " + p));
 
             // Send exit command to each spawned Process
             spawned.forEach(p -> {
                     try {
                         p.sendAction("exit", "");
                     } catch (IOException ex) {
-                        Assert.fail("IOException in sendAction", ex);
+                        Assertions.fail("IOException in sendAction", ex);
                     }
                 });
 
@@ -107,7 +97,7 @@ public class TreeTest extends ProcessUtil {
             spawned.forEach(p -> {
                     do {
                         try {
-                            Assert.assertEquals(p.waitFor(), 0, "exit status incorrect");
+                            Assertions.assertEquals(0, p.waitFor(), "exit status incorrect");
                             break;
                         } catch (InterruptedException  ex) {
                             continue; // Retry
@@ -118,7 +108,7 @@ public class TreeTest extends ProcessUtil {
             // Verify that ProcessHandle.isAlive sees each of them as not alive
             for (Process p : spawned) {
                 ProcessHandle ph = p.toHandle();
-                Assert.assertFalse(ph.isAlive(),
+                Assertions.assertFalse(ph.isAlive(),
                         "ProcessHandle.isAlive for exited process: " + ph);
             }
 
@@ -126,13 +116,13 @@ public class TreeTest extends ProcessUtil {
             final List<ProcessHandle> afterChildren = getChildren(self);
             spawned.stream()
                     .map(Process::toHandle)
-                    .filter(p -> afterChildren.contains(p))
-                    .forEach(p -> Assert.fail("Spawned process missing from children: " + p));
+                    .filter(afterChildren::contains)
+                    .forEach(p -> Assertions.fail("Spawned process missing from children: " + p));
 
         } catch (IOException ioe) {
-            Assert.fail("unable to spawn process", ioe);
+            Assertions.fail("unable to spawn process", ioe);
         } finally {
-            // Cleanup any left over processes
+            // Cleanup any leftover processes
             spawned.stream()
                     .map(Process::toHandle)
                     .filter(ProcessHandle::isAlive)
@@ -147,7 +137,7 @@ public class TreeTest extends ProcessUtil {
      * Test counting and spawning and counting of Processes.
      */
     @Test
-    public static void test2() {
+    public void test2() {
         try {
             ConcurrentHashMap<ProcessHandle, ProcessHandle> processes = new ConcurrentHashMap<>();
 
@@ -162,12 +152,12 @@ public class TreeTest extends ProcessUtil {
             ProcessHandle p1Handle = p1.toHandle();
             printf("  p1 pid: %d%n", p1.pid());
 
-            // Gather the PIDs from the output of the spawing process
+            // Gather the PIDs from the output of the spawning process
             p1.forEachOutputLine((s) -> {
                 String[] split = s.trim().split(" ");
                 if (split.length == 3 && split[1].equals("spawn")) {
-                    Long child = Long.valueOf(split[2]);
-                    Long parent = Long.valueOf(split[0].split(":")[0]);
+                    long child = Long.parseLong(split[2]);
+                    long parent = Long.parseLong(split[0].split(":")[0]);
                     processes.put(ProcessHandle.of(child).get(), ProcessHandle.of(parent).get());
                 }
             });
@@ -179,11 +169,11 @@ public class TreeTest extends ProcessUtil {
             List<ProcessHandle> subprocesses = waitForAllChildren(p1Handle, spawnNew);
             Optional<Instant> p1Start = p1Handle.info().startInstant();
             for (ProcessHandle ph : subprocesses) {
-                Assert.assertTrue(ph.isAlive(), "Child should be alive: " + ph);
+                Assertions.assertTrue(ph.isAlive(), "Child should be alive: " + ph);
                 // Verify each child was started after the parent
                 ph.info().startInstant()
                         .ifPresent(childStart -> p1Start.ifPresent(parentStart -> {
-                            Assert.assertFalse(childStart.isBefore(parentStart),
+                            Assertions.assertFalse(childStart.isBefore(parentStart),
                                     String.format("Child process started before parent: child: %s, parent: %s",
                                             childStart, parentStart));
                         }));
@@ -217,8 +207,8 @@ public class TreeTest extends ProcessUtil {
 
             // Verify that all spawned children show up in the descendants  List
             processes.forEach((p, parent) -> {
-                Assert.assertEquals(p.isAlive(), true, "Child should be alive: " + p);
-                Assert.assertTrue(descendants.contains(p), "Spawned child should be listed in descendants: " + p);
+                Assertions.assertTrue(p.isAlive(), "Child should be alive: " + p);
+                Assertions.assertTrue(descendants.contains(p), "Spawned child should be listed in descendants: " + p);
             });
 
             // Closing JavaChild's InputStream will cause all children to exit
@@ -228,13 +218,13 @@ public class TreeTest extends ProcessUtil {
                 try {
                     p.onExit().get();       // wait for the child to exit
                 } catch (ExecutionException e) {
-                    Assert.fail("waiting for process to exit", e);
+                    Assertions.fail("waiting for process to exit", e);
                 }
             }
             p1.waitFor();           // wait for spawned process to exit
 
             // Verify spawned processes are no longer alive
-            processes.forEach((ph, parent) -> Assert.assertFalse(ph.isAlive(),
+            processes.forEach((ph, parent) -> Assertions.assertFalse(ph.isAlive(),
                             "process should not be alive: " + ph));
         } catch (IOException | InterruptedException t) {
             t.printStackTrace();
@@ -250,7 +240,7 @@ public class TreeTest extends ProcessUtil {
      * After they exit they should no longer be listed by descendants.
      */
     @Test
-    public static void test3() {
+    public void test3() {
         ConcurrentHashMap<ProcessHandle, ProcessHandle> processes = new ConcurrentHashMap<>();
 
         try {
@@ -269,15 +259,15 @@ public class TreeTest extends ProcessUtil {
             p1.forEachOutputLine((s) -> {
                 String[] split = s.trim().split(" ");
                 if (split.length == 3 && split[1].equals("spawn")) {
-                    Long child = Long.valueOf(split[2]);
-                    Long parent = Long.valueOf(split[0].split(":")[0]);
+                    long child = Long.parseLong(split[2]);
+                    long parent = Long.parseLong(split[0].split(":")[0]);
                     processes.put(ProcessHandle.of(child).get(), ProcessHandle.of(parent).get());
                     spawnCount.countDown();
                 }
             });
 
             // Wait for all the subprocesses to be listed as started
-            Assert.assertTrue(spawnCount.await(Utils.adjustTimeout(30L), TimeUnit.SECONDS),
+            Assertions.assertTrue(spawnCount.await(Utils.adjustTimeout(30L), TimeUnit.SECONDS),
                     "Timeout waiting for processes to start");
 
             // Debugging; list descendants that are not expected in processes
@@ -290,17 +280,17 @@ public class TreeTest extends ProcessUtil {
                     .filter(ph -> !processes.containsKey(ph))
                     .forEach(ph1 -> ProcessUtil.printProcess(ph1, "Extra process: "));
                 ProcessUtil.logTaskList();
-                Assert.assertEquals(0, count, "Extra processes in descendants");
+                Assertions.assertEquals(0, count, "Extra processes in descendants");
             }
 
             // Verify that all spawned children are alive, show up in the descendants list
             // then destroy them
             processes.forEach((p, parent) -> {
-                Assert.assertEquals(p.isAlive(), true, "Child should be alive: " + p);
-                Assert.assertTrue(descendants.contains(p), "Spawned child should be listed in descendants: " + p);
+                Assertions.assertTrue(p.isAlive(), "Child should be alive: " + p);
+                Assertions.assertTrue(descendants.contains(p), "Spawned child should be listed in descendants: " + p);
                 p.destroyForcibly();
             });
-            Assert.assertEquals(processes.size(), newChildren, "Wrong number of children");
+            Assertions.assertEquals(newChildren, processes.size(), "Wrong number of children");
 
             // Wait for each of the processes to exit
             processes.forEach((p, parent) ->  {
@@ -317,21 +307,21 @@ public class TreeTest extends ProcessUtil {
                 }
                 printf("Timeout waiting for exit of pid %s, parent: %s, info: %s%n",
                         p, parent, p.info());
-                Assert.fail("Process still alive: " + p);
+                Assertions.fail("Process still alive: " + p);
             });
             p1.destroyForcibly();
             p1.waitFor();
 
             // Verify that none of the spawned children are still listed by descendants
             List<ProcessHandle> remaining = getDescendants(self);
-            Assert.assertFalse(remaining.remove(p1Handle), "Child p1 should have exited");
+            Assertions.assertFalse(remaining.remove(p1Handle), "Child p1 should have exited");
             remaining = remaining.stream().filter(processes::containsKey).collect(Collectors.toList());
-            Assert.assertEquals(remaining.size(), 0, "Subprocess(es) should have exited: " + remaining);
+            Assertions.assertEquals(0, remaining.size(), "Subprocess(es) should have exited: " + remaining);
 
         } catch (IOException ioe) {
-            Assert.fail("Spawn of subprocess failed", ioe);
+            Assertions.fail("Spawn of subprocess failed", ioe);
         } catch (InterruptedException inte) {
-            Assert.fail("InterruptedException", inte);
+            Assertions.fail("InterruptedException", inte);
         } finally {
             processes.forEach((p, parent) -> {
                 if (p.isAlive()) {
@@ -346,7 +336,7 @@ public class TreeTest extends ProcessUtil {
      * Test (Not really a test) that dumps the list of all Processes.
      */
     @Test
-    public static void test4() {
+    public void test4() {
         printf("    Parent     Child  Info%n");
         Stream<ProcessHandle> s = ProcessHandle.allProcesses();
         ProcessHandle[] processes = s.toArray(ProcessHandle[]::new);
@@ -384,7 +374,7 @@ public class TreeTest extends ProcessUtil {
             }
             printf("%s %7s, %7s, %s%n", indent, p_parent, p, info);
         }
-        Assert.assertFalse(fail, "Parents missing from all Processes");
+        Assertions.assertFalse(fail, "Parents missing from all Processes");
 
     }
 
@@ -392,7 +382,7 @@ public class TreeTest extends ProcessUtil {
      * A test for scale; launch a large number (14) of subprocesses.
      */
     @Test
-    public static void test5() {
+    public void test5() {
         ConcurrentHashMap<ProcessHandle, ProcessHandle> processes = new ConcurrentHashMap<>();
 
         int factor = 2;
@@ -421,15 +411,15 @@ public class TreeTest extends ProcessUtil {
             p1.forEachOutputLine((s) -> {
                 String[] split = s.trim().split(" ");
                 if (split.length == 3 && split[1].equals("spawn")) {
-                    Long child = Long.valueOf(split[2]);
-                    Long parent = Long.valueOf(split[0].split(":")[0]);
+                    long child = Long.parseLong(split[2]);
+                    long parent = Long.parseLong(split[0].split(":")[0]);
                     processes.put(ProcessHandle.of(child).get(), ProcessHandle.of(parent).get());
                     spawnCount.countDown();
                 }
             });
 
             // Wait for all the subprocesses to be listed as started
-            Assert.assertTrue(spawnCount.await(Utils.adjustTimeout(30L), TimeUnit.SECONDS),
+            Assertions.assertTrue(spawnCount.await(Utils.adjustTimeout(30L), TimeUnit.SECONDS),
                     "Timeout waiting for processes to start");
 
             // Debugging; list descendants that are not expected in processes
@@ -442,30 +432,29 @@ public class TreeTest extends ProcessUtil {
                     .filter(ph -> !processes.containsKey(ph))
                     .forEach(ph1 -> ProcessUtil.printProcess(ph1, "Extra process: "));
                 ProcessUtil.logTaskList();
-                Assert.assertEquals(0, count, "Extra processes in descendants");
+                Assertions.assertEquals(0, count, "Extra processes in descendants");
             }
 
             List<ProcessHandle> subprocesses = getChildren(p1Handle);
             printf(" children:  %s%n",
-                    subprocesses.stream().map(p -> p.pid())
+                    subprocesses.stream().map(ProcessHandle::pid)
                     .collect(Collectors.toList()));
 
-            Assert.assertEquals(getChildren(p1Handle).size(),
-                    factor, "expected direct children");
+            Assertions.assertEquals(factor, getChildren(p1Handle).size(), "expected direct children");
             count = getDescendants(p1Handle).size();
             long totalChildren = factor * factor * factor + factor * factor + factor;
-            Assert.assertTrue(count >= totalChildren,
+            Assertions.assertTrue(count >= totalChildren,
                     "expected at least " + totalChildren + ", actual: " + count);
 
             List<ProcessHandle> descSubprocesses = getDescendants(p1Handle);
             printf(" descendants:  %s%n",
-                    descSubprocesses.stream().map(p -> p.pid())
+                    descSubprocesses.stream().map(ProcessHandle::pid)
                     .collect(Collectors.toList()));
 
             p1.getOutputStream().close();  // Close stdin for the controlling p1
             p1.waitFor();
         } catch (InterruptedException | IOException ex) {
-            Assert.fail("Unexpected Exception", ex);
+            Assertions.fail("Unexpected Exception", ex);
         } finally {
             printf("Duration: %s%n", Duration.between(start, Instant.now()));
             if (p1 != null) {

From 4d42ce23f03ecf256ff4af66446a9b263e37a186 Mon Sep 17 00:00:00 2001
From: Matthias Baesken <mbaesken@openjdk.org>
Date: Tue, 10 Mar 2026 13:22:04 +0000
Subject: [PATCH 124/655] 8379499: [AIX] headless-only build of libjawt.so
 fails

Reviewed-by: mdoerr
---
 make/modules/java.desktop/lib/AwtLibraries.gmk | 5 ++++-
 1 file changed, 4 insertions(+), 1 deletion(-)

diff --git a/make/modules/java.desktop/lib/AwtLibraries.gmk b/make/modules/java.desktop/lib/AwtLibraries.gmk
index 8b6b50b9e62..1aa2578d2e2 100644
--- a/make/modules/java.desktop/lib/AwtLibraries.gmk
+++ b/make/modules/java.desktop/lib/AwtLibraries.gmk
@@ -1,5 +1,5 @@
 #
-# Copyright (c) 2011, 2025, Oracle and/or its affiliates. All rights reserved.
+# Copyright (c) 2011, 2026, Oracle and/or its affiliates. All rights reserved.
 # DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
 #
 # This code is free software; you can redistribute it and/or modify it
@@ -423,6 +423,9 @@ endif
 ifeq ($(call isTargetOs, linux)+$(ENABLE_HEADLESS_ONLY), true+true)
   LIBJAWT_CFLAGS += -DHEADLESS
 endif
+ifeq ($(call isTargetOs, aix)+$(ENABLE_HEADLESS_ONLY), true+true)
+  LIBJAWT_CFLAGS += -DHEADLESS
+endif
 
 ifeq ($(call isTargetOs, windows)+$(call isTargetCpu, x86), true+true)
   LIBJAWT_LIBS_windows := kernel32.lib

From 34fa46758dc12f82a9d0249ec62f1fad859af02c Mon Sep 17 00:00:00 2001
From: Sergey Bylokhov <serb@openjdk.org>
Date: Tue, 10 Mar 2026 15:02:17 +0000
Subject: [PATCH 125/655] 8379364: Shenandoah: Remove duplicate semicolons in
 GenShen code

Reviewed-by: wkemper
---
 .../heuristics/shenandoahAdaptiveHeuristics.cpp           | 2 +-
 .../heuristics/shenandoahGenerationalHeuristics.cpp       | 2 +-
 src/hotspot/share/gc/shenandoah/shenandoahFreeSet.cpp     | 8 ++++----
 .../gc/shenandoah/shenandoahGenerationalControlThread.cpp | 2 +-
 4 files changed, 7 insertions(+), 7 deletions(-)

diff --git a/src/hotspot/share/gc/shenandoah/heuristics/shenandoahAdaptiveHeuristics.cpp b/src/hotspot/share/gc/shenandoah/heuristics/shenandoahAdaptiveHeuristics.cpp
index a1aeb918553..6b327d7e4af 100644
--- a/src/hotspot/share/gc/shenandoah/heuristics/shenandoahAdaptiveHeuristics.cpp
+++ b/src/hotspot/share/gc/shenandoah/heuristics/shenandoahAdaptiveHeuristics.cpp
@@ -273,7 +273,7 @@ void ShenandoahAdaptiveHeuristics::add_gc_time(double timestamp, double gc_time)
 }
 
 double ShenandoahAdaptiveHeuristics::predict_gc_time(double timestamp_at_start) {
-  return _gc_time_m * timestamp_at_start + _gc_time_b + _gc_time_sd * _margin_of_error_sd;;
+  return _gc_time_m * timestamp_at_start + _gc_time_b + _gc_time_sd * _margin_of_error_sd;
 }
 
 void ShenandoahAdaptiveHeuristics::add_rate_to_acceleration_history(double timestamp, double rate) {
diff --git a/src/hotspot/share/gc/shenandoah/heuristics/shenandoahGenerationalHeuristics.cpp b/src/hotspot/share/gc/shenandoah/heuristics/shenandoahGenerationalHeuristics.cpp
index 4b665501d71..bcf4197f86d 100644
--- a/src/hotspot/share/gc/shenandoah/heuristics/shenandoahGenerationalHeuristics.cpp
+++ b/src/hotspot/share/gc/shenandoah/heuristics/shenandoahGenerationalHeuristics.cpp
@@ -509,7 +509,7 @@ void ShenandoahGenerationalHeuristics::adjust_evacuation_budgets(ShenandoahHeap*
   size_t young_evacuated = collection_set->get_live_bytes_in_untenurable_regions();
   size_t young_evacuated_reserve_used = (size_t) (ShenandoahEvacWaste * double(young_evacuated));
 
-  size_t total_young_available = young_generation->available_with_reserve() - _add_regions_to_old * region_size_bytes;;
+  size_t total_young_available = young_generation->available_with_reserve() - _add_regions_to_old * region_size_bytes;
   assert(young_evacuated_reserve_used <= total_young_available, "Cannot evacuate (%zu) more than is available in young (%zu)",
          young_evacuated_reserve_used, total_young_available);
   young_generation->set_evacuation_reserve(young_evacuated_reserve_used);
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahFreeSet.cpp b/src/hotspot/share/gc/shenandoah/shenandoahFreeSet.cpp
index d765f33fee0..a579d6d3694 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahFreeSet.cpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahFreeSet.cpp
@@ -348,7 +348,7 @@ void ShenandoahRegionPartitions::make_all_regions_unavailable() {
     _leftmosts[partition_id] = _max;
     _rightmosts[partition_id] = -1;
     _leftmosts_empty[partition_id] = _max;
-    _rightmosts_empty[partition_id] = -1;;
+    _rightmosts_empty[partition_id] = -1;
     _capacity[partition_id] = 0;
     _region_counts[partition_id] = 0;
     _empty_region_counts[partition_id] = 0;
@@ -445,7 +445,7 @@ void ShenandoahRegionPartitions::increase_humongous_waste(ShenandoahFreeSetParti
 
 size_t ShenandoahRegionPartitions::get_humongous_waste(ShenandoahFreeSetPartitionId which_partition) {
   assert (which_partition < NumPartitions, "Partition must be valid");
-  return _humongous_waste[int(which_partition)];;
+  return _humongous_waste[int(which_partition)];
 }
 
 void ShenandoahRegionPartitions::set_capacity_of(ShenandoahFreeSetPartitionId which_partition, size_t value) {
@@ -510,7 +510,7 @@ void ShenandoahRegionPartitions::decrease_available(ShenandoahFreeSetPartitionId
 
 size_t ShenandoahRegionPartitions::get_available(ShenandoahFreeSetPartitionId which_partition) {
   assert (which_partition < NumPartitions, "Partition must be valid");
-  return _available[int(which_partition)];;
+  return _available[int(which_partition)];
 }
 
 void ShenandoahRegionPartitions::increase_region_counts(ShenandoahFreeSetPartitionId which_partition, size_t regions) {
@@ -2799,7 +2799,7 @@ size_t ShenandoahFreeSet::reserve_regions(size_t to_reserve, size_t to_reserve_o
   size_t empty_regions_to_collector = 0;
   size_t empty_regions_to_old_collector = 0;
 
-  size_t old_collector_available = _partitions.available_in(ShenandoahFreeSetPartitionId::OldCollector);;
+  size_t old_collector_available = _partitions.available_in(ShenandoahFreeSetPartitionId::OldCollector);
   size_t collector_available = _partitions.available_in(ShenandoahFreeSetPartitionId::Collector);
 
   for (size_t i = _heap->num_regions(); i > 0; i--) {
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahGenerationalControlThread.cpp b/src/hotspot/share/gc/shenandoah/shenandoahGenerationalControlThread.cpp
index cc7547b8ac1..5f201a404d8 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahGenerationalControlThread.cpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahGenerationalControlThread.cpp
@@ -186,7 +186,7 @@ ShenandoahGenerationalControlThread::GCMode ShenandoahGenerationalControlThread:
   global_heuristics->record_requested_gc();
 
   if (ShenandoahCollectorPolicy::should_run_full_gc(request.cause)) {
-    return stw_full;;
+    return stw_full;
   } else {
     // Unload and clean up everything. Note that this is an _explicit_ request and so does not use
     // the same `should_unload_classes` call as the regulator's concurrent gc request.

From 59301499871bcaee3d79fa1d876630de52c89db8 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Joel=20Sikstr=C3=B6m?= <jsikstro@openjdk.org>
Date: Tue, 10 Mar 2026 15:02:36 +0000
Subject: [PATCH 126/655] 8379487: Dangling static ref to fallback error in
 libinstrument's JavaExceptions.c

Reviewed-by: cjplummer, kbarrett
---
 .../share/native/libinstrument/JavaExceptions.c | 17 ++++++++++++++---
 1 file changed, 14 insertions(+), 3 deletions(-)

diff --git a/src/java.instrument/share/native/libinstrument/JavaExceptions.c b/src/java.instrument/share/native/libinstrument/JavaExceptions.c
index 0a787ce4150..45c31e329d0 100644
--- a/src/java.instrument/share/native/libinstrument/JavaExceptions.c
+++ b/src/java.instrument/share/native/libinstrument/JavaExceptions.c
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2020, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -68,9 +68,20 @@ forceFallback(jthrowable potentialException) {
 jboolean
 initializeFallbackError(JNIEnv* jnienv) {
     jplis_assert(isSafeForJNICalls(jnienv));
-    sFallbackInternalError = createInternalError(jnienv, NULL);
+    jthrowable localRef = createInternalError(jnienv, NULL);
+    if (localRef == NULL) {
+        return JNI_FALSE;
+    }
+
+    jthrowable globalRef = (*jnienv)->NewGlobalRef(jnienv, localRef);
+    if (globalRef == NULL) {
+        return JNI_FALSE;
+    }
+
+    sFallbackInternalError = globalRef;
     jplis_assert(isSafeForJNICalls(jnienv));
-    return (sFallbackInternalError != NULL);
+
+    return JNI_TRUE;
 }
 
 

From e24a8f06e30a0889b1fb5689ac3d4180f90d25d4 Mon Sep 17 00:00:00 2001
From: Sergey Bylokhov <serb@openjdk.org>
Date: Tue, 10 Mar 2026 15:05:26 +0000
Subject: [PATCH 127/655] 8378201: [OGL] glXMakeContextCurrent() drops the
 buffers of the unbound drawable 8369561:
 sun/java2d/OpenGL/DrawBitmaskImage.java#id0: Incorrect color for first pixel
 (actual=ff000000)

Reviewed-by: prr, aivanov
---
 .../common/java2d/opengl/GLXSurfaceData.c     | 100 ++++++++++++-
 test/jdk/ProblemList.txt                      |   1 +
 .../sun/java2d/OpenGL/FlipCoexistTest.java    | 134 ++++++++++++++++++
 .../java2d/OpenGL/MultiWindowFillTest.java    | 122 ++++++++++++++++
 4 files changed, 352 insertions(+), 5 deletions(-)
 create mode 100644 test/jdk/sun/java2d/OpenGL/FlipCoexistTest.java
 create mode 100644 test/jdk/sun/java2d/OpenGL/MultiWindowFillTest.java

diff --git a/src/java.desktop/unix/native/common/java2d/opengl/GLXSurfaceData.c b/src/java.desktop/unix/native/common/java2d/opengl/GLXSurfaceData.c
index 8f264278d9f..0497dbf69fa 100644
--- a/src/java.desktop/unix/native/common/java2d/opengl/GLXSurfaceData.c
+++ b/src/java.desktop/unix/native/common/java2d/opengl/GLXSurfaceData.c
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -40,6 +40,8 @@
 
 #ifndef HEADLESS
 
+#include <X11/Xresource.h>
+
 extern LockFunc       OGLSD_Lock;
 extern GetRasInfoFunc OGLSD_GetRasInfo;
 extern UnlockFunc     OGLSD_Unlock;
@@ -50,6 +52,74 @@ extern void
 
 jboolean surfaceCreationFailed = JNI_FALSE;
 
+/**
+ * Per-Window GLXWindow entry with reference counting.
+ * Stored in an XContext keyed by the X Window XID.
+ */
+typedef struct {
+    GLXWindow glxWindow;
+    int       refCount;
+} GLXWindowRef;
+
+static XContext glxWindowContext;
+
+/**
+ * Gets or creates a shared GLXWindow for the given X Window.
+ * All callers are synchronized by the AWT lock.
+ */
+static GLXWindow acquireGLXWindow(Window window, GLXFBConfig fbconfig)
+{
+    if (glxWindowContext == 0) {
+        glxWindowContext = XUniqueContext();
+    }
+
+    XPointer data;
+    if (XFindContext(awt_display, window, glxWindowContext, &data) == 0) {
+        GLXWindowRef *ref = (GLXWindowRef *)data;
+        ref->refCount++;
+        return ref->glxWindow;
+    }
+
+    GLXWindow glxWin = j2d_glXCreateWindow(awt_display, fbconfig, window, NULL);
+    if (glxWin == 0) {
+        return 0;
+    }
+
+    GLXWindowRef *ref = malloc(sizeof(*ref));
+    if (ref == NULL) {
+        j2d_glXDestroyWindow(awt_display, glxWin);
+        return 0;
+    }
+    ref->glxWindow = glxWin;
+    ref->refCount = 1;
+    if (XSaveContext(awt_display, window, glxWindowContext, (XPointer)ref) != 0)
+    {
+        j2d_glXDestroyWindow(awt_display, glxWin);
+        free(ref);
+        return 0;
+    }
+    return glxWin;
+}
+
+/**
+ * Decrements the reference count for the GLXWindow associated with the given
+ * X Window. Destroys it when the count reaches zero.
+ * All callers are synchronized by the AWT lock.
+ */
+static void releaseGLXWindow(Window window)
+{
+    XPointer data;
+    if (XFindContext(awt_display, window, glxWindowContext, &data) != 0) {
+        return;
+    }
+    GLXWindowRef *ref = (GLXWindowRef *)data;
+    if (--ref->refCount <= 0) {
+        j2d_glXDestroyWindow(awt_display, ref->glxWindow);
+        XDeleteContext(awt_display, window, glxWindowContext);
+        free(ref);
+    }
+}
+
 #endif /* !HEADLESS */
 
 JNIEXPORT void JNICALL
@@ -74,7 +144,7 @@ Java_sun_java2d_opengl_GLXSurfaceData_initOps(JNIEnv *env, jobject glxsd,
     // later the graphicsConfig will be used for deallocation of oglsdo
     oglsdo->graphicsConfig = gc;
 
-    GLXSDOps *glxsdo = (GLXSDOps *)malloc(sizeof(GLXSDOps));
+    GLXSDOps *glxsdo = (GLXSDOps *)calloc(1, sizeof(GLXSDOps));
 
     if (glxsdo == NULL) {
         JNU_ThrowOutOfMemoryError(env, "creating native GLX ops");
@@ -125,8 +195,13 @@ Java_sun_java2d_opengl_GLXSurfaceData_initOps(JNIEnv *env, jobject glxsd,
 void
 OGLSD_DestroyOGLSurface(JNIEnv *env, OGLSDOps *oglsdo)
 {
+    GLXSDOps *glxsdo = (GLXSDOps *)oglsdo->privOps;
     J2dTraceLn(J2D_TRACE_INFO, "OGLSD_DestroyOGLSurface");
-    // X Window is free'd later by AWT code...
+    if (glxsdo != NULL && glxsdo->drawable != 0) {
+        releaseGLXWindow(glxsdo->window);
+        glxsdo->drawable = 0;
+        oglsdo->drawableType = OGLSD_UNDEFINED;
+    }
 }
 
 /**
@@ -296,6 +371,13 @@ OGLSD_InitOGLWindow(JNIEnv *env, OGLSDOps *oglsdo)
         return JNI_FALSE;
     }
 
+    glxsdo->drawable = acquireGLXWindow(window,
+                                        glxsdo->configData->glxInfo->fbconfig);
+    if (glxsdo->drawable == 0) {
+        J2dRlsTraceLn(J2D_TRACE_ERROR, "OGLSD_InitOGLWindow: GLXWindow is 0");
+        return JNI_FALSE;
+    }
+
     XGetWindowAttributes(awt_display, window, &attr);
     oglsdo->width = attr.width;
     oglsdo->height = attr.height;
@@ -304,7 +386,6 @@ OGLSD_InitOGLWindow(JNIEnv *env, OGLSDOps *oglsdo)
     oglsdo->isOpaque = JNI_TRUE;
     oglsdo->xOffset = 0;
     oglsdo->yOffset = 0;
-    glxsdo->drawable = window;
     glxsdo->xdrawable = window;
 
     J2dTraceLn(J2D_TRACE_VERBOSE, "  created window: w=%d h=%d",
@@ -333,7 +414,16 @@ OGLSD_SwapBuffers(JNIEnv *env, jlong window)
         return;
     }
 
-    j2d_glXSwapBuffers(awt_display, (Window)window);
+    XPointer data;
+    if (XFindContext(awt_display, (Window)window, glxWindowContext, &data) != 0)
+    {
+        J2dRlsTraceLn(J2D_TRACE_ERROR,
+                      "OGLSD_SwapBuffers: GLXWindow not found");
+        return;
+    }
+
+    GLXWindowRef *ref = (GLXWindowRef *)data;
+    j2d_glXSwapBuffers(awt_display, ref->glxWindow);
 }
 
 // needed by Mac OS X port, no-op on other platforms
diff --git a/test/jdk/ProblemList.txt b/test/jdk/ProblemList.txt
index 070f9b0ce03..62faf5b9b33 100644
--- a/test/jdk/ProblemList.txt
+++ b/test/jdk/ProblemList.txt
@@ -222,6 +222,7 @@ sun/awt/datatransfer/SuplementaryCharactersTransferTest.java 8011371 generic-all
 sun/awt/shell/ShellFolderMemoryLeak.java 8197794 windows-all
 sun/java2d/DirectX/OverriddenInsetsTest/OverriddenInsetsTest.java 8196102 generic-all
 sun/java2d/DirectX/RenderingToCachedGraphicsTest/RenderingToCachedGraphicsTest.java 8196180 windows-all,macosx-all
+sun/java2d/OpenGL/MultiWindowFillTest.java 8378506 macosx-all
 sun/java2d/OpenGL/OpaqueDest.java#id1 8367574 macosx-all
 sun/java2d/OpenGL/ScaleParamsOOB.java#id0 8377908 linux-all
 sun/java2d/SunGraphics2D/EmptyClipRenderingTest.java 8144029 macosx-all,linux-all
diff --git a/test/jdk/sun/java2d/OpenGL/FlipCoexistTest.java b/test/jdk/sun/java2d/OpenGL/FlipCoexistTest.java
new file mode 100644
index 00000000000..beb5da887b4
--- /dev/null
+++ b/test/jdk/sun/java2d/OpenGL/FlipCoexistTest.java
@@ -0,0 +1,134 @@
+/*
+ * Copyright Amazon.com Inc. or its affiliates. All Rights Reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+import java.awt.Color;
+import java.awt.Frame;
+import java.awt.Graphics;
+import java.awt.Point;
+import java.awt.Rectangle;
+import java.awt.Robot;
+import java.awt.image.BufferStrategy;
+import java.awt.image.BufferedImage;
+import java.io.File;
+
+import javax.imageio.ImageIO;
+
+/**
+ * @test
+ * @bug 8378201
+ * @key headful
+ * @summary Verifies that WINDOW and FLIP_BACKBUFFER surfaces sharing the same X
+ *          Window render and flip correctly
+ * @run main/othervm FlipCoexistTest
+ * @run main/othervm -Dsun.java2d.opengl=True FlipCoexistTest
+ */
+public final class FlipCoexistTest {
+
+    private static final int SIZE = 200;
+    private static final int TOLERANCE = 10;
+
+    public static void main(String[] args) throws Exception {
+        Frame f = new Frame("FlipCoexistTest");
+        try {
+            f.setUndecorated(true);
+            f.setSize(SIZE, SIZE);
+            f.setLocation(100, 100);
+            f.setVisible(true);
+
+            Robot robot = new Robot();
+            robot.waitForIdle();
+            robot.delay(1000);
+
+            int w = f.getWidth();
+            int h = f.getHeight();
+
+            // Fill window RED via direct render (WINDOW surface)
+            Graphics g = f.getGraphics();
+            g.setColor(Color.RED);
+            g.fillRect(0, 0, w, h);
+            g.dispose();
+            robot.waitForIdle();
+            robot.delay(500);
+
+            // Request flip if available, blit is also useful to cover
+            f.createBufferStrategy(2);
+            BufferStrategy bs = f.getBufferStrategy();
+
+            // Render BLUE to back buffer, do not flip yet
+            Graphics bg = bs.getDrawGraphics();
+            bg.setColor(Color.BLUE);
+            bg.fillRect(0, 0, w, h);
+            bg.dispose();
+
+            // Paint small GREEN rect via direct render
+            g = f.getGraphics();
+            g.setColor(Color.GREEN);
+            g.fillRect(0, 0, 10, 10);
+            g.dispose();
+            robot.waitForIdle();
+            robot.delay(500);
+
+            // GREEN rect must be visible
+            check(robot, f, 5, 5, Color.GREEN, "small rect");
+
+            // RED must survive the context round-trip
+            check(robot, f, w / 2, h / 2, Color.RED, "survived");
+
+            // Show back buffer, BLUE must appear
+            bs.show();
+
+            robot.waitForIdle();
+            robot.delay(500);
+            check(robot, f, w / 2, h / 2, Color.BLUE, "flip");
+        } finally {
+            f.dispose();
+        }
+    }
+
+    private static void check(Robot robot, Frame frame, int x, int y, Color exp,
+                              String desc)
+    {
+        Point loc = frame.getLocationOnScreen();
+        Color c = robot.getPixelColor(loc.x + x, loc.y + y);
+        if (!isAlmostEqual(c, exp)) {
+            saveImage(robot, frame, desc);
+            throw new RuntimeException("%s: %s != %s".formatted(desc, exp, c));
+        }
+    }
+
+    private static void saveImage(Robot r, Frame f, String name) {
+        try {
+            Rectangle rect = f.getBounds();
+            BufferedImage img = r.createScreenCapture(rect);
+            ImageIO.write(img, "png", new File(name + ".png"));
+        } catch (Exception e) {
+            e.printStackTrace();
+        }
+    }
+
+    private static boolean isAlmostEqual(Color c1, Color c2) {
+        return Math.abs(c1.getRed() - c2.getRed()) <= TOLERANCE
+                && Math.abs(c1.getGreen() - c2.getGreen()) <= TOLERANCE
+                && Math.abs(c1.getBlue() - c2.getBlue()) <= TOLERANCE;
+    }
+}
diff --git a/test/jdk/sun/java2d/OpenGL/MultiWindowFillTest.java b/test/jdk/sun/java2d/OpenGL/MultiWindowFillTest.java
new file mode 100644
index 00000000000..59c58d944d7
--- /dev/null
+++ b/test/jdk/sun/java2d/OpenGL/MultiWindowFillTest.java
@@ -0,0 +1,122 @@
+/*
+ * Copyright Amazon.com Inc. or its affiliates. All Rights Reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+import java.awt.Color;
+import java.awt.Frame;
+import java.awt.Graphics;
+import java.awt.Point;
+import java.awt.Rectangle;
+import java.awt.Robot;
+import java.awt.image.BufferedImage;
+import java.io.File;
+
+import javax.imageio.ImageIO;
+
+/**
+ * @test
+ * @bug 8378201
+ * @key headful
+ * @summary Verifies that window content survives a GL context switch to another
+ *          window and back
+ * @run main/othervm MultiWindowFillTest
+ * @run main/othervm -Dsun.java2d.opengl=True MultiWindowFillTest
+ */
+public final class MultiWindowFillTest {
+
+    private static final int SIZE = 100;
+    private static final int TOLERANCE = 10;
+
+    public static void main(String[] args) throws Exception {
+        Frame f1 = new Frame("f1");
+        Frame f2 = new Frame("f2");
+        try {
+            f1.setUndecorated(true);
+            f1.setSize(SIZE, SIZE);
+            f1.setLocation(100, 100);
+            f2.setUndecorated(true);
+            f2.setSize(SIZE, SIZE);
+            f2.setLocation(300, 100);
+
+            f1.setVisible(true);
+            f2.setVisible(true);
+
+            Robot robot = new Robot();
+            robot.waitForIdle();
+            robot.delay(1000);
+
+            int w = f1.getWidth();
+            int h = f1.getHeight();
+
+            // Fill both, initializes surfaces
+            fill(f1, Color.RED, w, h);
+            fill(f2, Color.BLUE, w, h);
+
+            // Touch both again
+            fill(f1, Color.RED, 2, 2);
+            fill(f2, Color.BLUE, 2, 2);
+
+            robot.waitForIdle();
+            robot.delay(1000);
+
+            check(robot, f1, w, h, Color.RED, "f1 red");
+            check(robot, f2, w, h, Color.BLUE, "f2 blue");
+        } finally {
+            f1.dispose();
+            f2.dispose();
+        }
+    }
+
+    private static void fill(Frame frame, Color c, int w, int h) {
+        Graphics g = frame.getGraphics();
+        g.setColor(c);
+        g.fillRect(0, 0, w, h);
+        g.dispose();
+    }
+
+    private static void check(Robot robot, Frame frame, int w, int h,
+                              Color exp, String desc)
+    {
+        Point loc = frame.getLocationOnScreen();
+        Color c = robot.getPixelColor(loc.x + w / 2, loc.y + h / 2);
+        if (!isAlmostEqual(c, exp)) {
+            saveImage(robot, frame, desc);
+            throw new RuntimeException("%s: %s != %s".formatted(desc, exp, c));
+        }
+    }
+
+    private static void saveImage(Robot r, Frame f, String name) {
+        try {
+            Rectangle rect = f.getBounds();
+            BufferedImage img = r.createScreenCapture(rect);
+            ImageIO.write(img, "png", new File(name + ".png"));
+        } catch (Exception e) {
+            e.printStackTrace();
+        }
+    }
+
+    private static boolean isAlmostEqual(Color c1, Color c2) {
+        return Math.abs(c1.getRed() - c2.getRed()) <= TOLERANCE
+                && Math.abs(c1.getGreen() - c2.getGreen()) <= TOLERANCE
+                && Math.abs(c1.getBlue() - c2.getBlue()) <= TOLERANCE;
+    }
+}

From 5aa115b569bb6617a67dbb5297a9ec0fd36a3390 Mon Sep 17 00:00:00 2001
From: Jaikiran Pai <jpai@openjdk.org>
Date: Tue, 10 Mar 2026 15:38:37 +0000
Subject: [PATCH 128/655] 8379622: Problemlist
 java/nio/channels/SocketChannel/OpenLeak.java and CloseDuringConnect.java on
 macos 26

Reviewed-by: alanb
---
 test/jdk/ProblemList.txt | 2 ++
 1 file changed, 2 insertions(+)

diff --git a/test/jdk/ProblemList.txt b/test/jdk/ProblemList.txt
index 62faf5b9b33..de1a0a49d1e 100644
--- a/test/jdk/ProblemList.txt
+++ b/test/jdk/ProblemList.txt
@@ -570,6 +570,8 @@ java/nio/channels/DatagramChannel/Unref.java                    8233437 generic-
 java/nio/channels/DatagramChannel/BasicMulticastTests.java      8144003 macosx-all
 java/nio/channels/DatagramChannel/MulticastSendReceiveTests.java 8144003 macosx-all
 java/nio/channels/DatagramChannel/Promiscuous.java              8144003 macosx-all
+java/nio/channels/SocketChannel/CloseDuringConnect.java         8375658 macosx-26.0,macosx-26.1,macosx-26.2,macosx-26.3
+java/nio/channels/SocketChannel/OpenLeak.java                   8375658 macosx-26.0,macosx-26.1,macosx-26.2,macosx-26.3
 
 ############################################################################
 

From 680503cf8201f5f2d1fd99df32716e66e92a0974 Mon Sep 17 00:00:00 2001
From: Volodymyr Paprotski <vpaprotski@openjdk.org>
Date: Tue, 10 Mar 2026 15:59:34 +0000
Subject: [PATCH 129/655] 8378470: Add future Intel family number

Reviewed-by: dholmes, sviswanathan
---
 src/hotspot/cpu/x86/vm_version_x86.hpp | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/src/hotspot/cpu/x86/vm_version_x86.hpp b/src/hotspot/cpu/x86/vm_version_x86.hpp
index e0a895737b7..9f0446df7c6 100644
--- a/src/hotspot/cpu/x86/vm_version_x86.hpp
+++ b/src/hotspot/cpu/x86/vm_version_x86.hpp
@@ -828,7 +828,7 @@ public:
   static uint32_t cpu_stepping()          { return _cpuid_info.cpu_stepping(); }
   static int  cpu_family()        { return _cpu;}
   static bool is_P6()             { return cpu_family() >= 6; }
-  static bool is_intel_server_family()    { return cpu_family() == 6 || cpu_family() == 19; }
+  static bool is_intel_server_family()    { return cpu_family() == 6 || cpu_family() == 18 || cpu_family() == 19; }
   static bool is_amd()            { assert_is_initialized(); return _cpuid_info.std_vendor_name_0 == 0x68747541; } // 'htuA'
   static bool is_hygon()          { assert_is_initialized(); return _cpuid_info.std_vendor_name_0 == 0x6F677948; } // 'ogyH'
   static bool is_amd_family()     { return is_amd() || is_hygon(); }

From d3158e71c6a0b5a78a04fc9a7e2d33174cb7fe49 Mon Sep 17 00:00:00 2001
From: Christian Stein <cstein@openjdk.org>
Date: Tue, 10 Mar 2026 16:05:04 +0000
Subject: [PATCH 130/655] 8379628: Refactor langtools/shellsupport/doc tests to
 use JUnit

Reviewed-by: hannesw
---
 .../doc/FullJavadocHelperTest.java            |  8 ++---
 .../doc/JavadocFormatterTest.java             |  9 +++---
 .../shellsupport/doc/JavadocHelperTest.java   | 31 ++++++++++++++-----
 3 files changed, 33 insertions(+), 15 deletions(-)

diff --git a/test/langtools/jdk/internal/shellsupport/doc/FullJavadocHelperTest.java b/test/langtools/jdk/internal/shellsupport/doc/FullJavadocHelperTest.java
index fcfd40b3292..5219b8e9080 100644
--- a/test/langtools/jdk/internal/shellsupport/doc/FullJavadocHelperTest.java
+++ b/test/langtools/jdk/internal/shellsupport/doc/FullJavadocHelperTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2017, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2017, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -30,19 +30,19 @@
  *          jdk.compiler/com.sun.tools.javac.main
  *          jdk.jshell/jdk.internal.shellsupport.doc
  * @build toolbox.ToolBox toolbox.JarTask toolbox.JavacTask
- * @run testng/timeout=900/othervm -Xmx1024m FullJavadocHelperTest
+ * @run junit/timeout=900/othervm -Xmx1024m FullJavadocHelperTest
  */
 
 import java.io.IOException;
 
-import org.testng.annotations.Test;
+import org.junit.jupiter.api.Test;
 
-@Test
 public class FullJavadocHelperTest {
 
     /*
      * Long-running test to retrieve doc comments for enclosed elements of all JDK classes.
      */
+    @Test
     public void testAllDocs() throws IOException {
         new JavadocHelperTest().retrieveDocComments(Boolean.TRUE::booleanValue);
     }
diff --git a/test/langtools/jdk/internal/shellsupport/doc/JavadocFormatterTest.java b/test/langtools/jdk/internal/shellsupport/doc/JavadocFormatterTest.java
index 153c010c33d..2ee326e26f9 100644
--- a/test/langtools/jdk/internal/shellsupport/doc/JavadocFormatterTest.java
+++ b/test/langtools/jdk/internal/shellsupport/doc/JavadocFormatterTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2015, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2015, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -27,21 +27,21 @@
  * @summary Test JavadocFormatter
  * @library /tools/lib
  * @modules jdk.jshell/jdk.internal.shellsupport.doc
- * @run testng JavadocFormatterTest
+ * @run junit JavadocFormatterTest
  */
 
 import java.util.Objects;
 
 import jdk.internal.shellsupport.doc.JavadocFormatter;
-import org.testng.annotations.Test;
+import org.junit.jupiter.api.Test;
 
-@Test
 public class JavadocFormatterTest {
 
     private static final String CODE_RESET = "\033[0m";
     private static final String CODE_HIGHLIGHT = "\033[1m";
     private static final String CODE_UNDERLINE = "\033[4m";
 
+    @Test
     public void testReflow() {
         String actual;
         String expected;
@@ -401,6 +401,7 @@ public class JavadocFormatterTest {
         }
     }
 
+    @Test
     public void testSpaceAtEndOfLine() {
         String header = "Class<?> Class<T>.forName(Module module, String name)";
         String javadoc = """
diff --git a/test/langtools/jdk/internal/shellsupport/doc/JavadocHelperTest.java b/test/langtools/jdk/internal/shellsupport/doc/JavadocHelperTest.java
index e82553a4cfe..4f739d38d3d 100644
--- a/test/langtools/jdk/internal/shellsupport/doc/JavadocHelperTest.java
+++ b/test/langtools/jdk/internal/shellsupport/doc/JavadocHelperTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2015, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2015, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -30,7 +30,7 @@
  *          jdk.compiler/com.sun.tools.javac.main
  *          jdk.jshell/jdk.internal.shellsupport.doc
  * @build toolbox.ToolBox toolbox.JarTask toolbox.JavacTask
- * @run testng JavadocHelperTest
+ * @run junit JavadocHelperTest
  * @key randomness
  */
 
@@ -69,13 +69,13 @@ import javax.tools.ToolProvider;
 
 import com.sun.source.util.JavacTask;
 import jdk.internal.shellsupport.doc.JavadocHelper;
-import org.testng.annotations.Test;
-import static org.testng.Assert.assertEquals;
-import static org.testng.Assert.assertTrue;
+import org.junit.jupiter.api.Test;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertTrue;
 
-@Test
 public class JavadocHelperTest {
 
+    @Test
     public void testJavadoc() throws Exception {
         doTestJavadoc("",
                       t -> t.getElements().getTypeElement("test.Super"),
@@ -93,6 +93,7 @@ public class JavadocHelperTest {
                       " @return value\n");
     }
 
+    @Test
     public void testInheritNoJavadoc() throws Exception {
         doTestJavadoc("",
                       getSubTest,
@@ -107,6 +108,7 @@ public class JavadocHelperTest {
                       " @return value\n");
     }
 
+    @Test
     public void testInheritFull() throws Exception {
         doTestJavadoc("    /**\n" +
                       "     * Prefix {@inheritDoc} suffix.\n" +
@@ -131,6 +133,7 @@ public class JavadocHelperTest {
                       " @return prefix value suffix\n");
     }
 
+    @Test
     public void testInheritMissingParam() throws Exception {
         doTestJavadoc("    /**\n" +
                       "     * Prefix {@inheritDoc} suffix.\n" +
@@ -154,6 +157,7 @@ public class JavadocHelperTest {
                       " @return prefix value suffix\n");
     }
 
+    @Test
     public void testInheritMissingFirstParam() throws Exception {
         doTestJavadoc("    /**\n" +
                       "     * Prefix {@inheritDoc} suffix.\n" +
@@ -177,6 +181,7 @@ public class JavadocHelperTest {
                       " @return prefix value suffix\n");
     }
 
+    @Test
     public void testInheritMissingThrows() throws Exception {
         doTestJavadoc("    /**\n" +
                       "     * Prefix {@inheritDoc} suffix.\n" +
@@ -200,6 +205,7 @@ public class JavadocHelperTest {
                       " @return prefix value suffix\n");
     }
 
+    @Test
     public void testInheritMissingReturn() throws Exception {
         doTestJavadoc("    /**\n" +
                       "     * Prefix {@inheritDoc} suffix.\n" +
@@ -223,6 +229,7 @@ public class JavadocHelperTest {
                       "@return value\n");
     }
 
+    @Test
     public void testInheritAllButOne() throws Exception {
         doTestJavadoc("    /**\n" +
                       "     * @throws IllegalArgumentException {@inheritDoc}\n" +
@@ -238,6 +245,7 @@ public class JavadocHelperTest {
                       "@return value\n");
     }
 
+    @Test
     public void testInheritEmpty() throws Exception {
         doTestJavadoc("    /**\n" +
                       "     */\n",
@@ -260,6 +268,7 @@ public class JavadocHelperTest {
                       "@return \n");
     }
 
+    @Test
     public void testEmptyValue() throws Exception {
         doTestJavadoc("    /**\n" +
                       "     */\n",
@@ -282,6 +291,7 @@ public class JavadocHelperTest {
                       "@return \n");
     }
 
+    @Test
     public void testShortComment() throws Exception {
         doTestJavadoc("    /**Test.*/\n",
                       getSubTest,
@@ -295,6 +305,7 @@ public class JavadocHelperTest {
                       "@return value\n");
     }
 
+    @Test
     public void testMarkdown() throws Exception {
         doTestJavadoc("""
                       /// Prefix {@inheritDoc} suffix.
@@ -328,6 +339,7 @@ public class JavadocHelperTest {
                       @return prefix value suffix""");
     }
 
+    @Test
     public void testMarkdown2() throws Exception {
         doTestJavadoc("""
                       /// {@inheritDoc}
@@ -352,6 +364,7 @@ public class JavadocHelperTest {
                       @since snc""");
     }
 
+    @Test
     public void testMarkdown3() throws Exception {
         doTestJavadoc("""
                       /// {@inheritDoc}
@@ -373,6 +386,7 @@ public class JavadocHelperTest {
                       """);
     }
 
+    @Test
     public void testMarkdown4() throws Exception {
         doTestJavadoc("""
                       /// {@inheritDoc}
@@ -397,6 +411,7 @@ public class JavadocHelperTest {
                       @since snc""");
     }
 
+    @Test
     public void testMarkdown5() throws Exception {
         doTestJavadoc("""
                       ///[define classes][java.lang.invoke.MethodHandles.Lookup#defineClass(byte\\[\\])]
@@ -417,6 +432,7 @@ public class JavadocHelperTest {
                        @since snc""");
     }
 
+    @Test
     public void testMarkdown6() throws Exception {
         doTestJavadoc("""
                       ///Text1 [define classes][java.lang.invoke.MethodHandles.Lookup#defineClass(byte\\[\\])]
@@ -503,7 +519,7 @@ public class JavadocHelperTest {
             try (JavadocHelper helper = JavadocHelper.create(task, Arrays.asList(srcZip))) {
                 String javadoc = helper.getResolvedDocComment(el);
 
-                assertEquals(javadoc, expectedJavadoc);
+                assertEquals(expectedJavadoc, javadoc);
             }
         }
     }
@@ -547,6 +563,7 @@ public class JavadocHelperTest {
      * Set the system property `seed` to a random seed to reproduce
      * a specific run of this test.
      */
+    @Test
     public void testRandomDocs() throws IOException {
         Random random = new Random(getSeed());
         // Run test on 2% of classes, which corresponds to ~ 140 classes

From 46b93a0aea0ac0ad7fa896eca5a43168c9da7ea8 Mon Sep 17 00:00:00 2001
From: Alex Menkov <amenkov@openjdk.org>
Date: Tue, 10 Mar 2026 18:07:41 +0000
Subject: [PATCH 131/655] 8248165: Missing whitespace in jdb  message printed
 when setting value of invalid type

Reviewed-by: cjplummer
---
 .../classes/com/sun/tools/example/debug/expr/LValue.java    | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/src/jdk.jdi/share/classes/com/sun/tools/example/debug/expr/LValue.java b/src/jdk.jdi/share/classes/com/sun/tools/example/debug/expr/LValue.java
index 3855d1bd51c..43b2c420147 100644
--- a/src/jdk.jdi/share/classes/com/sun/tools/example/debug/expr/LValue.java
+++ b/src/jdk.jdi/share/classes/com/sun/tools/example/debug/expr/LValue.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1998, 2022, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1998, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -73,11 +73,11 @@ abstract class LValue {
             setValue0(value);
         } catch (InvalidTypeException exc) {
             throw new ParseException(
-                "Attempt to set value of incorrect type" +
+                "Attempt to set value of incorrect type: " +
                 exc);
         } catch (ClassNotLoadedException exc) {
             throw new ParseException(
-                "Attempt to set value before " + exc.className() + " was loaded" +
+                "Attempt to set value before " + exc.className() + " was loaded: " +
                 exc);
         }
     }

From 760f4b60434648fc723c84611a1a9c32d5915c91 Mon Sep 17 00:00:00 2001
From: Naoto Sato <naoto@openjdk.org>
Date: Tue, 10 Mar 2026 18:40:02 +0000
Subject: [PATCH 132/655] 8379344: Compact the Unicode/CLDR version tables

Reviewed-by: alanb, jlu
---
 .../share/classes/java/lang/Character.java    | 48 ++++++++++++++++---
 .../java/util/spi/LocaleServiceProvider.java  | 36 ++++++++++----
 2 files changed, 68 insertions(+), 16 deletions(-)

diff --git a/src/java.base/share/classes/java/lang/Character.java b/src/java.base/share/classes/java/lang/Character.java
index 33284d86e2d..158c3126ab3 100644
--- a/src/java.base/share/classes/java/lang/Character.java
+++ b/src/java.base/share/classes/java/lang/Character.java
@@ -67,9 +67,13 @@ import static java.lang.constant.ConstantDescs.DEFAULT_NAME;
  * Character information is based on the Unicode Standard, version 17.0.
  * <p>
  * The Java platform has supported different versions of the Unicode
- * Standard over time. Upgrades to newer versions of the Unicode Standard
- * occurred in the following Java releases, each indicating the new version:
+ * Standard over time. The following tables list the version of Unicode used
+ * in each Java release. Unless otherwise specified, all update releases in a
+ * given Java release family use the same Unicode version.
  * <table class="striped">
+ * <!-- The expanded table should include the current Java release, followed
+ * by commonly used releases, with other releases listed in the details
+ * section -->
  * <caption style="display:none">Shows Java releases and supported Unicode versions</caption>
  * <thead>
  * <tr><th scope="col">Java release</th>
@@ -78,26 +82,56 @@ import static java.lang.constant.ConstantDescs.DEFAULT_NAME;
  * <tbody>
  * <tr><th scope="row" style="text-align:left">Java SE 26</th>
  *     <td>Unicode 17.0</td></tr>
+ * <tr><th scope="row" style="text-align:left">Java SE 25</th>
+ *     <td>Unicode 16.0</td></tr>
+ * <tr><th scope="row" style="text-align:left">Java SE 21</th>
+ *     <td>Unicode 15.0</td></tr>
+ * <tr><th scope="row" style="text-align:left">Java SE 17</th>
+ *     <td>Unicode 13.0</td></tr>
+ * <tr><th scope="row" style="text-align:left">Java SE 11</th>
+ *     <td>Unicode 10.0</td></tr>
+ * <tr><th scope="row" style="text-align:left">Java SE 8</th>
+ *     <td>Unicode 6.2</td></tr>
+ * </tbody>
+ * </table>
+ * <details>
+ * <summary>Show other Java releases</summary>
+ * <p>Java releases prior to Java SE 8 are listed only if they upgraded the
+ * Unicode version</p>
+ * <table class="striped">
+ * <caption style="display:none">Shows other Java releases and supported Unicode
+ * versions</caption>
+ * <thead>
+ * <tr><th scope="col">Java release</th>
+ *     <th scope="col">Unicode version</th></tr>
+ * </thead>
+ * <tbody>
  * <tr><th scope="row" style="text-align:left">Java SE 24</th>
  *     <td>Unicode 16.0</td></tr>
+ * <tr><th scope="row" style="text-align:left">Java SE 23</th>
+ *     <td>Unicode 15.1</td></tr>
  * <tr><th scope="row" style="text-align:left">Java SE 22</th>
  *     <td>Unicode 15.1</td></tr>
  * <tr><th scope="row" style="text-align:left">Java SE 20</th>
  *     <td>Unicode 15.0</td></tr>
  * <tr><th scope="row" style="text-align:left">Java SE 19</th>
  *     <td>Unicode 14.0</td></tr>
+ * <tr><th scope="row" style="text-align:left">Java SE 18</th>
+ *     <td>Unicode 13.0</td></tr>
+ * <tr><th scope="row" style="text-align:left">Java SE 16</th>
+ *     <td>Unicode 13.0</td></tr>
  * <tr><th scope="row" style="text-align:left">Java SE 15</th>
  *     <td>Unicode 13.0</td></tr>
+ * <tr><th scope="row" style="text-align:left">Java SE 14</th>
+ *     <td>Unicode 12.1</td></tr>
  * <tr><th scope="row" style="text-align:left">Java SE 13</th>
  *     <td>Unicode 12.1</td></tr>
  * <tr><th scope="row" style="text-align:left">Java SE 12</th>
  *     <td>Unicode 11.0</td></tr>
- * <tr><th scope="row" style="text-align:left">Java SE 11</th>
- *     <td>Unicode 10.0</td></tr>
+ * <tr><th scope="row" style="text-align:left">Java SE 10</th>
+ *     <td>Unicode 8.0</td></tr>
  * <tr><th scope="row" style="text-align:left">Java SE 9</th>
  *     <td>Unicode 8.0</td></tr>
- * <tr><th scope="row" style="text-align:left">Java SE 8</th>
- *     <td>Unicode 6.2</td></tr>
  * <tr><th scope="row" style="text-align:left">Java SE 7</th>
  *     <td>Unicode 6.0</td></tr>
  * <tr><th scope="row" style="text-align:left">Java SE 5.0</th>
@@ -110,6 +144,8 @@ import static java.lang.constant.ConstantDescs.DEFAULT_NAME;
  *     <td>Unicode 1.1.5</td></tr>
  * </tbody>
  * </table>
+ * </details>
+ * <p>
  * Variations from these base Unicode versions, such as recognized appendixes,
  * are documented elsewhere.
  * <h2><a id="unicode">Unicode Character Representations</a></h2>
diff --git a/src/java.base/share/classes/java/util/spi/LocaleServiceProvider.java b/src/java.base/share/classes/java/util/spi/LocaleServiceProvider.java
index 5e7b61e6c57..abb9f3aca38 100644
--- a/src/java.base/share/classes/java/util/spi/LocaleServiceProvider.java
+++ b/src/java.base/share/classes/java/util/spi/LocaleServiceProvider.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2005, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2005, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -166,7 +166,7 @@ import java.util.Locale;
  * <a href="http://cldr.unicode.org/">Common Locale Data Repository (CLDR)</a>
  * to implement locale-sensitive APIs in the {@code java.util} and
  * {@code java.text} packages. This locale data derives the set of locales
- * supported by the Java runtime environment. The following table lists the
+ * supported by the Java runtime environment. The following tables list the
  * version of CLDR used in each JDK release. Unless otherwise specified, all
  * update releases in a given JDK release family use the same CLDR version.
  * Note that the CLDR locale data are subject to change. Users should not assume
@@ -175,6 +175,9 @@ import java.util.Locale;
  * Refer to <a href="https://cldr.unicode.org/index/downloads">CLDR Releases</a>
  * for the deltas between their releases.
  * <table class="striped">
+ * <!-- The expanded table should include the current JDK release, followed
+ * by commonly used releases, with other releases listed in the details
+ * section -->
  * <caption style="display:none">JDK releases and supported CLDR versions</caption>
  * <thead>
  * <tr><th scope="col">JDK release</th>
@@ -185,22 +188,38 @@ import java.util.Locale;
  *     <td>CLDR 48</td></tr>
  * <tr><th scope="row" style="text-align:left">JDK 25</th>
  *     <td>CLDR 47</td></tr>
+ * <tr><th scope="row" style="text-align:left">JDK 21</th>
+ *     <td>CLDR 43</td></tr>
+ * <tr><th scope="row" style="text-align:left">JDK 17</th>
+ *     <td>CLDR 39</td></tr>
+ * <tr><th scope="row" style="text-align:left">JDK 11</th>
+ *     <td>CLDR 33</td></tr>
+ * <tr><th scope="row" style="text-align:left">JDK 8</th>
+ *     <td>CLDR 21.0.1</td></tr>
+ * </tbody>
+ * </table>
+ * <details>
+ * <summary>Show other JDK releases</summary>
+ * <table class="striped">
+ * <caption style="display:none">Other JDK releases and supported CLDR
+ * versions</caption>
+ * <thead>
+ * <tr><th scope="col">JDK release</th>
+ *     <th scope="col">CLDR version</th></tr>
+ * </thead>
+ * <tbody>
  * <tr><th scope="row" style="text-align:left">JDK 24</th>
  *     <td>CLDR 46</td></tr>
  * <tr><th scope="row" style="text-align:left">JDK 23</th>
  *     <td>CLDR 45</td></tr>
  * <tr><th scope="row" style="text-align:left">JDK 22</th>
  *     <td>CLDR 44</td></tr>
- * <tr><th scope="row" style="text-align:left">JDK 21</th>
- *     <td>CLDR 43</td></tr>
  * <tr><th scope="row" style="text-align:left">JDK 20</th>
  *     <td>CLDR 42</td></tr>
  * <tr><th scope="row" style="text-align:left">JDK 19</th>
  *     <td>CLDR 41</td></tr>
  * <tr><th scope="row" style="text-align:left">JDK 18</th>
  *     <td>CLDR 39</td></tr>
- * <tr><th scope="row" style="text-align:left">JDK 17</th>
- *     <td>CLDR 39</td></tr>
  * <tr><th scope="row" style="text-align:left">JDK 16</th>
  *     <td>CLDR 38</td></tr>
  * <tr><th scope="row" style="text-align:left">JDK 15</th>
@@ -211,16 +230,13 @@ import java.util.Locale;
  *     <td>CLDR 35.1</td></tr>
  * <tr><th scope="row" style="text-align:left">JDK 12</th>
  *     <td>CLDR 33</td></tr>
- * <tr><th scope="row" style="text-align:left">JDK 11</th>
- *     <td>CLDR 33</td></tr>
  * <tr><th scope="row" style="text-align:left">JDK 10</th>
  *     <td>CLDR 29</td></tr>
  * <tr><th scope="row" style="text-align:left">JDK 9</th>
  *     <td>CLDR 29</td></tr>
- * <tr><th scope="row" style="text-align:left">JDK 8</th>
- *     <td>CLDR 21.0.1</td></tr>
  * </tbody>
  * </table>
+ * </details>
  *
  * @since        1.6
  */

From 73b13f977bc3bd581883273508f54667b9fbfe5b Mon Sep 17 00:00:00 2001
From: Brian Burkhalter <bpb@openjdk.org>
Date: Tue, 10 Mar 2026 18:44:23 +0000
Subject: [PATCH 133/655] 8378808: Refactor java/nio/Buffer TestNG tests to use
 JUnit

Reviewed-by: alanb, liach
---
 test/jdk/java/nio/Buffer/BulkPutBuffer.java   | 178 +++++++----------
 test/jdk/java/nio/Buffer/ByteBufferViews.java |  87 +++++----
 test/jdk/java/nio/Buffer/Chars.java           |  30 +--
 .../java/nio/Buffer/EqualsCompareTest.java    | 184 ++++++++----------
 .../jdk/java/nio/Buffer/ReachabilityTest.java |  19 +-
 .../java/nio/MappedByteBuffer/ForceViews.java | 106 +++++-----
 6 files changed, 277 insertions(+), 327 deletions(-)

diff --git a/test/jdk/java/nio/Buffer/BulkPutBuffer.java b/test/jdk/java/nio/Buffer/BulkPutBuffer.java
index d1d10ebff87..85ebb624d0f 100644
--- a/test/jdk/java/nio/Buffer/BulkPutBuffer.java
+++ b/test/jdk/java/nio/Buffer/BulkPutBuffer.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2020, 2022, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -41,18 +41,22 @@ import java.util.Iterator;
 import java.util.List;
 import java.util.Map;
 import java.util.Random;
+import java.util.stream.Stream;
 
-import org.testng.Assert;
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
+import org.junit.jupiter.api.function.Executable;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.Arguments;
+import org.junit.jupiter.params.provider.MethodSource;
 
+import static org.junit.jupiter.api.Assertions.assertThrows;
+import static org.junit.jupiter.api.Assertions.assertTrue;
 
 /*
  * @test
  * @bug 8219014 8245121
  * @summary Ensure that a bulk put of a buffer into another is correct.
  * @compile BulkPutBuffer.java
- * @run testng/othervm BulkPutBuffer
+ * @run junit/othervm BulkPutBuffer
  */
 public class BulkPutBuffer {
     static final long SEED = System.nanoTime();
@@ -195,95 +199,64 @@ public class BulkPutBuffer {
                 nextType = lookup.findVirtual(MyRandom.class,
                      "next" + name, MethodType.methodType(elementType));
             } catch (IllegalAccessException | NoSuchMethodException e) {
-                throw new AssertionError(e);
+                throw new RuntimeException(e);
             }
         }
 
         Buffer create(int capacity) throws Throwable {
-
             Class<?> bufferType = typeToAttr.get(elementType).type;
+            if (bufferType == ByteBuffer.class || kind == BufferKind.DIRECT ||
+                kind == BufferKind.HEAP_VIEW) {
 
-            try {
-                if (bufferType == ByteBuffer.class ||
-                    kind == BufferKind.DIRECT || kind == BufferKind.HEAP_VIEW) {
-                    int len = capacity*typeToAttr.get(elementType).bytes;
-                    ByteBuffer bb = (ByteBuffer)allocBB.invoke(len);
-                    byte[] bytes = new byte[len];
-                    RND.nextBytes(bytes);
-                    bb.put(0, bytes);
-                    if (bufferType == ByteBuffer.class) {
-                        return (Buffer)bb;
-                    } else {
-                        bb.order(order);
-                        return (Buffer)asTypeBuffer.invoke(bb);
-                    }
-                } else if (bufferType == CharBuffer.class &&
-                    kind == BufferKind.STRING) {
-                    char[] array = new char[capacity];
-                    for (int i = 0; i < capacity; i++) {
-                        array[i] = RND.nextChar();
-                    }
-                    return CharBuffer.wrap(new String(array));
+                int len = capacity*typeToAttr.get(elementType).bytes;
+                ByteBuffer bb = (ByteBuffer)allocBB.invoke(len);
+                byte[] bytes = new byte[len];
+                RND.nextBytes(bytes);
+                bb.put(0, bytes);
+                if (bufferType == ByteBuffer.class) {
+                    return (Buffer)bb;
                 } else {
-                    Buffer buf = (Buffer)alloc.invoke(capacity);
-                    for (int i = 0; i < capacity; i++) {
-                        putAbs.invoke(buf, i, nextType.invoke(RND));
-                    }
-                    return buf;
+                    bb.order(order);
+                    return (Buffer)asTypeBuffer.invoke(bb);
                 }
-            } catch (Exception e) {
-                throw new AssertionError(e);
+            } else if (bufferType == CharBuffer.class &&
+                       kind == BufferKind.STRING) {
+                char[] array = new char[capacity];
+                for (int i = 0; i < capacity; i++) {
+                    array[i] = RND.nextChar();
+                }
+                return CharBuffer.wrap(new String(array));
+            } else {
+                Buffer buf = (Buffer)alloc.invoke(capacity);
+                for (int i = 0; i < capacity; i++) {
+                    putAbs.invoke(buf, i, nextType.invoke(RND));
+                }
+                return buf;
             }
         }
 
         void copy(Buffer src, int srcOff, Buffer dst, int dstOff, int length)
             throws Throwable {
-            try {
-                for (int i = 0; i < length; i++) {
-                    putAbs.invoke(dst, dstOff + i, getAbs.invoke(src, srcOff + i));
-                }
-            } catch (ReadOnlyBufferException ro) {
-                throw ro;
-            } catch (Exception e) {
-                throw new AssertionError(e);
+            for (int i = 0; i < length; i++) {
+                putAbs.invoke(dst, dstOff + i, getAbs.invoke(src, srcOff + i));
             }
         }
 
         Buffer asReadOnlyBuffer(Buffer buf) throws Throwable {
-            try {
-                return (Buffer)asReadOnlyBuffer.invoke(buf);
-            } catch (Exception e) {
-                throw new AssertionError(e);
-            }
+            return (Buffer)asReadOnlyBuffer.invoke(buf);
         }
 
         void put(Buffer src, int srcOff, Buffer dst, int dstOff, int length)
             throws Throwable {
-            try {
-                putBufAbs.invoke(dst, dstOff, src, srcOff, length);
-            } catch (ReadOnlyBufferException ro) {
-                throw ro;
-            } catch (Exception e) {
-                throw new AssertionError(e);
-            }
+            putBufAbs.invoke(dst, dstOff, src, srcOff, length);
         }
 
         void put(Buffer src, Buffer dst) throws Throwable {
-            try {
-                putBufRel.invoke(dst, src);
-            } catch (ReadOnlyBufferException ro) {
-                throw ro;
-            } catch (Exception e) {
-                throw new AssertionError(e);
-            }
+            putBufRel.invoke(dst, src);
         }
 
         boolean equals(Buffer src, Buffer dst) throws Throwable {
-            try {
-                return Boolean.class.cast(equals.invoke(dst, src));
-            } catch (Exception e) {
-                throw new AssertionError(e);
-            }
+            return Boolean.class.cast(equals.invoke(dst, src));
         }
     }
 
@@ -297,68 +270,58 @@ public class BulkPutBuffer {
         return proxies;
     }
 
-    @DataProvider
-    static Object[][] proxies() {
-        ArrayList<Object[]> args = new ArrayList<>();
+    static Stream<BufferProxy> proxies() {
+        List<BufferProxy> args = new ArrayList<BufferProxy>();
         for (Class<?> type : typeToAttr.keySet()) {
+
             List<BufferProxy> proxies = getProxies(type);
             for (BufferProxy proxy : proxies) {
-                args.add(new Object[] {proxy});
+                args.add(proxy);
             }
         }
-        return args.toArray(Object[][]::new);
+        return args.stream();
     }
 
-    @DataProvider
-    static Object[][] proxyPairs() {
-        List<Object[]> args = new ArrayList<>();
+    static Stream<Arguments> proxyPairs() {
+        List<Arguments> args = new ArrayList<Arguments>();
         for (Class<?> type : typeToAttr.keySet()) {
             List<BufferProxy> proxies = getProxies(type);
             for (BufferProxy proxy1 : proxies) {
                 for (BufferProxy proxy2 : proxies) {
-                    args.add(new Object[] {proxy1, proxy2});
+                    args.add(Arguments.of(proxy1, proxy2));
                 }
             }
         }
-        return args.toArray(Object[][]::new);
+        return args.stream();
     }
 
-    private static void expectThrows(Class<?> exClass, Assert.ThrowingRunnable r) {
-        try {
-            r.run();
-        } catch(Throwable e) {
-            if (e.getClass() != exClass && e.getCause().getClass() != exClass) {
-                throw new RuntimeException("Expected " + exClass +
-                "; got " + e.getCause().getClass(), e);
-            }
-        }
-    }
-
-    @Test(dataProvider = "proxies")
-    public static void testExceptions(BufferProxy bp) throws Throwable {
+    @ParameterizedTest
+    @MethodSource("proxies")
+    public void testExceptions(BufferProxy bp) throws Throwable {
         int cap = 27;
         Buffer buf = bp.create(cap);
 
-        expectThrows(IndexOutOfBoundsException.class,
+        assertThrows(IndexOutOfBoundsException.class,
             () -> bp.put(buf, -1, buf, 0, 1));
-        expectThrows(IndexOutOfBoundsException.class,
+        assertThrows(IndexOutOfBoundsException.class,
             () -> bp.put(buf, 0, buf, -1, 1));
-        expectThrows(IndexOutOfBoundsException.class,
+        assertThrows(IndexOutOfBoundsException.class,
             () -> bp.put(buf, 1, buf, 0, cap));
-        expectThrows(IndexOutOfBoundsException.class,
+        assertThrows(IndexOutOfBoundsException.class,
             () -> bp.put(buf, 0, buf, 1, cap));
-        expectThrows(IndexOutOfBoundsException.class,
+        assertThrows(IndexOutOfBoundsException.class,
             () -> bp.put(buf, 0, buf, 0, cap + 1));
-        expectThrows(IndexOutOfBoundsException.class,
+        assertThrows(IndexOutOfBoundsException.class,
             () -> bp.put(buf, 0, buf, 0, Integer.MAX_VALUE));
 
         Buffer rob = buf.isReadOnly() ? buf : bp.asReadOnlyBuffer(buf);
-        expectThrows(ReadOnlyBufferException.class,
+        assertThrows(ReadOnlyBufferException.class,
             () -> bp.put(buf, 0, rob, 0, cap));
     }
 
-    @Test(dataProvider = "proxies")
-    public static void testSelf(BufferProxy bp) throws Throwable {
+    @ParameterizedTest
+    @MethodSource("proxies")
+    public void testSelf(BufferProxy bp) throws Throwable {
         for (int i = 0; i < ITERATIONS; i++) {
             int cap = RND.nextInt(MAX_CAPACITY);
             Buffer buf = bp.create(cap);
@@ -371,7 +334,7 @@ public class BulkPutBuffer {
 
             Buffer lowerCopy = bp.create(lowerLength);
             if (lowerCopy.isReadOnly()) {
-                Assert.expectThrows(ReadOnlyBufferException.class,
+                assertThrows(ReadOnlyBufferException.class,
                     () -> bp.copy(lower, 0, lowerCopy, 0, lowerLength));
                 break;
             }
@@ -385,7 +348,7 @@ public class BulkPutBuffer {
             bp.put(lower, middle);
             middle.flip();
 
-            Assert.assertTrue(bp.equals(lowerCopy, middle),
+            assertTrue(bp.equals(lowerCopy, middle),
                 String.format("%d %s %d %d %d %d%n", SEED,
                     buf.getClass().getName(), cap,
                     lowerOffset, lowerLength, middleOffset));
@@ -395,15 +358,16 @@ public class BulkPutBuffer {
 
             bp.put(buf, lowerOffset, buf, middleOffset, lowerLength);
 
-            Assert.assertTrue(bp.equals(lowerCopy, middle),
+            assertTrue(bp.equals(lowerCopy, middle),
                 String.format("%d %s %d %d %d %d%n", SEED,
                     buf.getClass().getName(), cap,
                     lowerOffset, lowerLength, middleOffset));
         }
     }
 
-    @Test(dataProvider = "proxyPairs")
-    public static void testPairs(BufferProxy bp, BufferProxy sbp) throws Throwable {
+    @ParameterizedTest
+    @MethodSource("proxyPairs")
+    public void testPairs(BufferProxy bp, BufferProxy sbp) throws Throwable {
         for (int i = 0; i < ITERATIONS; i++) {
             int cap = Math.max(4, RND.nextInt(MAX_CAPACITY));
             int cap2 = cap/2;
@@ -426,7 +390,7 @@ public class BulkPutBuffer {
             src.limit(slim);
 
             if (buf.isReadOnly()) {
-                Assert.expectThrows(ReadOnlyBufferException.class,
+                assertThrows(ReadOnlyBufferException.class,
                     () -> bp.put(src, buf));
                 break;
             }
@@ -438,7 +402,7 @@ public class BulkPutBuffer {
             buf.reset();
             src.reset();
 
-            Assert.assertTrue(bp.equals(src, buf),
+            assertTrue(bp.equals(src, buf),
                 String.format("%d %s %d %d %d %s %d %d %d%n", SEED,
                     buf.getClass().getName(), cap, pos, lim,
                     src.getClass().getName(), scap, spos, slim));
@@ -452,7 +416,7 @@ public class BulkPutBuffer {
             buf.position(pos);
             buf.limit(lim);
 
-            Assert.assertTrue(bp.equals(src, buf),
+            assertTrue(bp.equals(src, buf),
                 String.format("%d %s %d %d %d %s %d %d %d%n", SEED,
                     buf.getClass().getName(), cap, pos, lim,
                     src.getClass().getName(), scap, spos, slim));
diff --git a/test/jdk/java/nio/Buffer/ByteBufferViews.java b/test/jdk/java/nio/Buffer/ByteBufferViews.java
index f0136939d53..17bd6af4033 100644
--- a/test/jdk/java/nio/Buffer/ByteBufferViews.java
+++ b/test/jdk/java/nio/Buffer/ByteBufferViews.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2016, 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2016, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -24,12 +24,9 @@
 /* @test
  * @summary Binary data and view tests for byte buffers
  * @bug 8159257 8258955
- * @run testng ByteBufferViews
+ * @run junit ByteBufferViews
  */
 
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
-
 import java.nio.Buffer;
 import java.nio.ByteBuffer;
 import java.nio.ByteOrder;
@@ -46,8 +43,15 @@ import java.util.function.IntFunction;
 import java.util.function.IntUnaryOperator;
 import java.util.function.UnaryOperator;
 import java.util.stream.Collectors;
+import java.util.stream.Stream;
 
-import static org.testng.Assert.*;
+import org.junit.jupiter.api.TestInstance;
+import org.junit.jupiter.api.TestInstance.Lifecycle;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.Arguments;
+import org.junit.jupiter.params.provider.MethodSource;
+
+import static org.junit.jupiter.api.Assertions.fail;
 
 public class ByteBufferViews {
     static final int SIZE = 32;
@@ -127,14 +131,15 @@ public class ByteBufferViews {
 
     // Creates a cross product of test arguments for
     // buffer allocator functions and buffer view functions
-    static Object[][] product(List<? extends Map.Entry<String, ?>> la,
-                              List<? extends Map.Entry<String, ?>> lb) {
+    static Stream<Arguments> product(List<? extends Map.Entry<String, ?>> la,
+                                     List<? extends Map.Entry<String, ?>> lb) {
         return la.stream().flatMap(lae -> lb.stream().
-                map(lbe -> List.of(
-                        lae.getKey() + " -> " + lbe.getKey(),
-                        lae.getValue(),
-                        lbe.getValue()).toArray()
-                )).toArray(Object[][]::new);
+                                   map(lbe -> Arguments.of
+                                       (
+                                        lae.getKey() + " -> " + lbe.getKey(),
+                                        lae.getValue(),
+                                        lbe.getValue())
+                                       ));
     }
 
     static void assertValues(int i, Object bValue, Object bbValue, ByteBuffer bb) {
@@ -167,8 +172,7 @@ public class ByteBufferViews {
     }
 
 
-    @DataProvider
-    public static Object[][] shortViewProvider() {
+    public static Stream<Arguments> shortBufferViews() {
         List<Map.Entry<String, Function<ByteBuffer, ShortBuffer>>> bfs = List.of(
                 Map.entry("bb.asShortBuffer()",
                           bb -> bb.asShortBuffer()),
@@ -186,7 +190,8 @@ public class ByteBufferViews {
         return product(BYTE_BUFFER_FUNCTIONS, bfs);
     }
 
-    @Test(dataProvider = "shortViewProvider")
+    @ParameterizedTest
+    @MethodSource("shortBufferViews")
     public void testShortGet(String desc, IntFunction<ByteBuffer> fbb,
                              Function<ByteBuffer, ShortBuffer> fbi) {
         ByteBuffer bb = allocate(fbb);
@@ -213,7 +218,8 @@ public class ByteBufferViews {
 
     }
 
-    @Test(dataProvider = "shortViewProvider")
+    @ParameterizedTest
+    @MethodSource("shortBufferViews")
     public void testShortPut(String desc, IntFunction<ByteBuffer> fbb,
                              Function<ByteBuffer, ShortBuffer> fbi) {
         ByteBuffer bbfilled = allocate(fbb);
@@ -271,8 +277,7 @@ public class ByteBufferViews {
         }
     }
 
-    @DataProvider
-    public static Object[][] charViewProvider() {
+    public static Stream<Arguments> charBufferViews() {
         List<Map.Entry<String, Function<ByteBuffer, CharBuffer>>> bfs = List.of(
                 Map.entry("bb.asCharBuffer()",
                           bb -> bb.asCharBuffer()),
@@ -290,7 +295,8 @@ public class ByteBufferViews {
         return product(BYTE_BUFFER_FUNCTIONS, bfs);
     }
 
-    @Test(dataProvider = "charViewProvider")
+    @ParameterizedTest
+    @MethodSource("charBufferViews")
     public void testCharGet(String desc, IntFunction<ByteBuffer> fbb,
                             Function<ByteBuffer, CharBuffer> fbi) {
         ByteBuffer bb = allocate(fbb);
@@ -317,7 +323,8 @@ public class ByteBufferViews {
 
     }
 
-    @Test(dataProvider = "charViewProvider")
+    @ParameterizedTest
+    @MethodSource("charBufferViews")
     public void testCharPut(String desc, IntFunction<ByteBuffer> fbb,
                             Function<ByteBuffer, CharBuffer> fbi) {
         ByteBuffer bbfilled = allocate(fbb);
@@ -368,8 +375,7 @@ public class ByteBufferViews {
     }
 
 
-    @DataProvider
-    public static Object[][] intViewProvider() {
+    public static Stream<Arguments> intBufferViews() {
         List<Map.Entry<String, Function<ByteBuffer, IntBuffer>>> bfs = List.of(
                 Map.entry("bb.asIntBuffer()",
                           bb -> bb.asIntBuffer()),
@@ -387,7 +393,8 @@ public class ByteBufferViews {
         return product(BYTE_BUFFER_FUNCTIONS, bfs);
     }
 
-    @Test(dataProvider = "intViewProvider")
+    @ParameterizedTest
+    @MethodSource("intBufferViews")
     public void testIntGet(String desc, IntFunction<ByteBuffer> fbb,
                            Function<ByteBuffer, IntBuffer> fbi) {
         ByteBuffer bb = allocate(fbb);
@@ -414,7 +421,8 @@ public class ByteBufferViews {
 
     }
 
-    @Test(dataProvider = "intViewProvider")
+    @ParameterizedTest
+    @MethodSource("intBufferViews")
     public void testIntPut(String desc, IntFunction<ByteBuffer> fbb,
                            Function<ByteBuffer, IntBuffer> fbi) {
         ByteBuffer bbfilled = allocate(fbb);
@@ -475,8 +483,7 @@ public class ByteBufferViews {
     }
 
 
-    @DataProvider
-    public static Object[][] longViewProvider() {
+    public static Stream<Arguments> longBufferViews() {
         List<Map.Entry<String, Function<ByteBuffer, LongBuffer>>> bfs = List.of(
                 Map.entry("bb.asLongBuffer()",
                           bb -> bb.asLongBuffer()),
@@ -494,7 +501,8 @@ public class ByteBufferViews {
         return product(BYTE_BUFFER_FUNCTIONS, bfs);
     }
 
-    @Test(dataProvider = "longViewProvider")
+    @ParameterizedTest
+    @MethodSource("longBufferViews")
     public void testLongGet(String desc, IntFunction<ByteBuffer> fbb,
                             Function<ByteBuffer, LongBuffer> fbi) {
         ByteBuffer bb = allocate(fbb);
@@ -521,7 +529,8 @@ public class ByteBufferViews {
 
     }
 
-    @Test(dataProvider = "longViewProvider")
+    @ParameterizedTest
+    @MethodSource("longBufferViews")
     public void testLongPut(String desc, IntFunction<ByteBuffer> fbb,
                             Function<ByteBuffer, LongBuffer> fbi) {
         ByteBuffer bbfilled = allocate(fbb);
@@ -587,9 +596,7 @@ public class ByteBufferViews {
         }
     }
 
-
-    @DataProvider
-    public static Object[][] floatViewProvider() {
+    public static Stream<Arguments> floatBufferViews() {
         List<Map.Entry<String, Function<ByteBuffer, FloatBuffer>>> bfs = List.of(
                 Map.entry("bb.asFloatBuffer()",
                           bb -> bb.asFloatBuffer()),
@@ -607,7 +614,8 @@ public class ByteBufferViews {
         return product(BYTE_BUFFER_FUNCTIONS, bfs);
     }
 
-    @Test(dataProvider = "floatViewProvider")
+    @ParameterizedTest
+    @MethodSource("floatBufferViews")
     public void testFloatGet(String desc, IntFunction<ByteBuffer> fbb,
                              Function<ByteBuffer, FloatBuffer> fbi) {
         ByteBuffer bb = allocate(fbb);
@@ -634,7 +642,8 @@ public class ByteBufferViews {
 
     }
 
-    @Test(dataProvider = "floatViewProvider")
+    @ParameterizedTest
+    @MethodSource("floatBufferViews")
     public void testFloatPut(String desc, IntFunction<ByteBuffer> fbb,
                              Function<ByteBuffer, FloatBuffer> fbi) {
         ByteBuffer bbfilled = allocate(fbb);
@@ -684,10 +693,7 @@ public class ByteBufferViews {
         return Float.intBitsToFloat(getIntFromBytes(bb, i));
     }
 
-
-
-    @DataProvider
-    public static Object[][] doubleViewProvider() {
+    public static Stream<Arguments> doubleBufferViews() {
         List<Map.Entry<String, Function<ByteBuffer, DoubleBuffer>>> bfs = List.of(
                 Map.entry("bb.asDoubleBuffer()",
                           bb -> bb.asDoubleBuffer()),
@@ -705,7 +711,7 @@ public class ByteBufferViews {
         return product(BYTE_BUFFER_FUNCTIONS, bfs);
     }
 
-    @Test(dataProvider = "doubleViewProvider")
+    @MethodSource("doubleBufferViews")
     public void testDoubleGet(String desc, IntFunction<ByteBuffer> fbb,
                               Function<ByteBuffer, DoubleBuffer> fbi) {
         ByteBuffer bb = allocate(fbb);
@@ -732,7 +738,8 @@ public class ByteBufferViews {
 
     }
 
-    @Test(dataProvider = "doubleViewProvider")
+    @ParameterizedTest
+    @MethodSource("doubleBufferViews")
     public void testDoublePut(String desc, IntFunction<ByteBuffer> fbb,
                               Function<ByteBuffer, DoubleBuffer> fbi) {
         ByteBuffer bbfilled = allocate(fbb);
diff --git a/test/jdk/java/nio/Buffer/Chars.java b/test/jdk/java/nio/Buffer/Chars.java
index 01b53ea2405..1b978eecb74 100644
--- a/test/jdk/java/nio/Buffer/Chars.java
+++ b/test/jdk/java/nio/Buffer/Chars.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2013, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2013, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,7 +25,7 @@
  * @test
  * @bug 8014854
  * @summary Exercises CharBuffer#chars on each of the CharBuffer types
- * @run testng Chars
+ * @run junit Chars
  * @key randomness
  */
 
@@ -35,11 +35,13 @@ import java.nio.CharBuffer;
 import java.util.ArrayList;
 import java.util.List;
 import java.util.Random;
+import java.util.stream.Stream;
 
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.Arguments;
+import org.junit.jupiter.params.provider.MethodSource;
 
-import static org.testng.Assert.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertEquals;
 
 public class Chars {
 
@@ -98,8 +100,7 @@ public class Chars {
         buffers.add(randomizeRange(cb.asReadOnlyBuffer()));
     }
 
-    @DataProvider(name = "charbuffers")
-    public Object[][] createCharBuffers() {
+    private static Stream<Arguments> createCharBuffers() {
         List<CharBuffer> buffers = new ArrayList<>();
 
         // heap
@@ -119,20 +120,21 @@ public class Chars {
         // read-only buffer backed by a CharSequence
         buffers.add(CharBuffer.wrap(randomize(CharBuffer.allocate(SIZE))));
 
-        Object[][] params = new Object[buffers.size()][];
+        List<Arguments> params = new ArrayList<Arguments>();
         for (int i = 0; i < buffers.size(); i++) {
             CharBuffer cb = buffers.get(i);
-            params[i] = new Object[] { cb.getClass().getName(), cb };
+            params.add((Arguments.of(cb.getClass().getName(), cb)));
         }
 
-        return params;
+        return params.stream();
     }
 
-    @Test(dataProvider = "charbuffers")
+    @ParameterizedTest
+    @MethodSource("createCharBuffers")
     public void testChars(String type, CharBuffer cb) {
-        System.out.format("%s position=%d, limit=%d%n", type, cb.position(), cb.limit());
+        System.err.format("%s position=%d, limit=%d%n", type, cb.position(), cb.limit());
         int expected = intSum(cb);
-        assertEquals(cb.chars().sum(), expected);
-        assertEquals(cb.chars().parallel().sum(), expected);
+        assertEquals(expected, cb.chars().sum());
+        assertEquals(expected, cb.chars().parallel().sum());
     }
 }
diff --git a/test/jdk/java/nio/Buffer/EqualsCompareTest.java b/test/jdk/java/nio/Buffer/EqualsCompareTest.java
index 03bd7c26a58..8c098767253 100644
--- a/test/jdk/java/nio/Buffer/EqualsCompareTest.java
+++ b/test/jdk/java/nio/Buffer/EqualsCompareTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2017, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2017, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -21,10 +21,6 @@
  * questions.
  */
 
-import org.testng.Assert;
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
-
 import java.io.IOException;
 import java.lang.invoke.MethodHandle;
 import java.lang.invoke.MethodHandles;
@@ -48,15 +44,25 @@ import java.util.Set;
 import java.util.function.BiFunction;
 import java.util.function.LongFunction;
 import java.util.stream.IntStream;
+import java.util.stream.Stream;
+
+import org.junit.jupiter.api.Test;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.Arguments;
+import org.junit.jupiter.params.provider.MethodSource;
 
 import static java.nio.charset.StandardCharsets.UTF_8;
 import static java.nio.file.StandardOpenOption.*;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertFalse;
+import static org.junit.jupiter.api.Assertions.assertNotEquals;
+import static org.junit.jupiter.api.Assertions.assertTrue;
 
 /*
  * @test
  * @bug 8193085 8199773
  * @summary tests for buffer equals and compare
- * @run testng EqualsCompareTest
+ * @run junit EqualsCompareTest
  */
 
 public class EqualsCompareTest {
@@ -446,89 +452,66 @@ public class EqualsCompareTest {
         }
     }
 
-    static Object[][] bufferTypes;
-
-    @DataProvider
-    public static Object[][] bufferTypesProvider() {
-        if (bufferTypes == null) {
-            bufferTypes = new Object[][]{
-                    {new BufferType.Bytes(BufferKind.HEAP)},
-                    {new BufferType.Bytes(BufferKind.DIRECT)},
-                    {new BufferType.Chars(BufferKind.HEAP)},
-                    {new BufferType.Chars(BufferKind.HEAP_VIEW)},
-                    {new BufferType.Chars(BufferKind.DIRECT)},
-                    {new BufferType.Shorts(BufferKind.HEAP)},
-                    {new BufferType.Shorts(BufferKind.HEAP_VIEW)},
-                    {new BufferType.Shorts(BufferKind.DIRECT)},
-                    {new BufferType.Ints(BufferKind.HEAP)},
-                    {new BufferType.Ints(BufferKind.HEAP_VIEW)},
-                    {new BufferType.Ints(BufferKind.DIRECT)},
-                    {new BufferType.Floats(BufferKind.HEAP)},
-                    {new BufferType.Floats(BufferKind.HEAP_VIEW)},
-                    {new BufferType.Floats(BufferKind.DIRECT)},
-                    {new BufferType.Longs(BufferKind.HEAP)},
-                    {new BufferType.Longs(BufferKind.HEAP_VIEW)},
-                    {new BufferType.Longs(BufferKind.DIRECT)},
-                    {new BufferType.Doubles(BufferKind.HEAP)},
-                    {new BufferType.Doubles(BufferKind.HEAP_VIEW)},
-                    {new BufferType.Doubles(BufferKind.DIRECT)},
-            };
-        }
-        return bufferTypes;
+    public static Stream<BufferType> bufferTypesSource() {
+        return Stream.of
+            (new BufferType.Bytes(BufferKind.HEAP),
+             new BufferType.Bytes(BufferKind.DIRECT),
+             new BufferType.Chars(BufferKind.HEAP),
+             new BufferType.Chars(BufferKind.HEAP_VIEW),
+             new BufferType.Chars(BufferKind.DIRECT),
+             new BufferType.Shorts(BufferKind.HEAP),
+             new BufferType.Shorts(BufferKind.HEAP_VIEW),
+             new BufferType.Shorts(BufferKind.DIRECT),
+             new BufferType.Ints(BufferKind.HEAP),
+             new BufferType.Ints(BufferKind.HEAP_VIEW),
+             new BufferType.Ints(BufferKind.DIRECT),
+             new BufferType.Floats(BufferKind.HEAP),
+             new BufferType.Floats(BufferKind.HEAP_VIEW),
+             new BufferType.Floats(BufferKind.DIRECT),
+             new BufferType.Longs(BufferKind.HEAP),
+             new BufferType.Longs(BufferKind.HEAP_VIEW),
+             new BufferType.Longs(BufferKind.DIRECT),
+             new BufferType.Doubles(BufferKind.HEAP),
+             new BufferType.Doubles(BufferKind.HEAP_VIEW),
+             new BufferType.Doubles(BufferKind.DIRECT));
     }
 
-
-    static Object[][] floatbufferTypes;
-
-    @DataProvider
-    public static Object[][] floatBufferTypesProvider() {
-        if (floatbufferTypes == null) {
+    public static Stream<Arguments> floatBufferTypesSource() {
             LongFunction<Object> bTof = rb -> Float.intBitsToFloat((int) rb);
             LongFunction<Object> bToD = Double::longBitsToDouble;
 
-            floatbufferTypes = new Object[][]{
-                    // canonical and non-canonical NaNs
-                    // If conversion is a signalling NaN it may be subject to conversion to a
-                    // quiet NaN on some processors, even if a copy is performed
-                    // The tests assume that if conversion occurs it does not convert to the
-                    // canonical NaN
-                    new Object[]{new BufferType.Floats(BufferKind.HEAP), 0x7fc00000L, 0x7f800001L, bTof},
-                    new Object[]{new BufferType.Floats(BufferKind.HEAP_VIEW), 0x7fc00000L, 0x7f800001L, bTof},
-                    new Object[]{new BufferType.Floats(BufferKind.DIRECT), 0x7fc00000L, 0x7f800001L, bTof},
-                    new Object[]{new BufferType.Doubles(BufferKind.HEAP), 0x7ff8000000000000L, 0x7ff0000000000001L, bToD},
-                    new Object[]{new BufferType.Doubles(BufferKind.HEAP_VIEW), 0x7ff8000000000000L, 0x7ff0000000000001L, bToD},
-                    new Object[]{new BufferType.Doubles(BufferKind.DIRECT), 0x7ff8000000000000L, 0x7ff0000000000001L, bToD},
+            return Stream.of
+                (// canonical and non-canonical NaNs
+                 // If conversion is a signalling NaN it may be subject to conversion to a
+                 // quiet NaN on some processors, even if a copy is performed
+                 // The tests assume that if conversion occurs it does not convert to the
+                 // canonical NaN
+                 Arguments.of(new BufferType.Floats(BufferKind.HEAP), 0x7fc00000L, 0x7f800001L, bTof),
+                 Arguments.of(new BufferType.Floats(BufferKind.HEAP_VIEW), 0x7fc00000L, 0x7f800001L, bTof),
+                 Arguments.of(new BufferType.Floats(BufferKind.DIRECT), 0x7fc00000L, 0x7f800001L, bTof),
+                 Arguments.of(new BufferType.Doubles(BufferKind.HEAP), 0x7ff8000000000000L, 0x7ff0000000000001L, bToD),
+                 Arguments.of(new BufferType.Doubles(BufferKind.HEAP_VIEW), 0x7ff8000000000000L, 0x7ff0000000000001L, bToD),
+                 Arguments.of(new BufferType.Doubles(BufferKind.DIRECT), 0x7ff8000000000000L, 0x7ff0000000000001L, bToD),
 
-                    // +0.0 and -0.0
-                    new Object[]{new BufferType.Floats(BufferKind.HEAP), 0x0L, 0x80000000L, bTof},
-                    new Object[]{new BufferType.Floats(BufferKind.HEAP_VIEW), 0x0L, 0x80000000L, bTof},
-                    new Object[]{new BufferType.Floats(BufferKind.DIRECT), 0x0L, 0x80000000L, bTof},
-                    new Object[]{new BufferType.Doubles(BufferKind.HEAP), 0x0L, 0x8000000000000000L, bToD},
-                    new Object[]{new BufferType.Doubles(BufferKind.HEAP_VIEW), 0x0L, 0x8000000000000000L, bToD},
-                    new Object[]{new BufferType.Doubles(BufferKind.DIRECT), 0x0L, 0x8000000000000000L, bToD},
-            };
-        }
-        return floatbufferTypes;
+                 // +0.0 and -0.0
+                 Arguments.of(new BufferType.Floats(BufferKind.HEAP), 0x0L, 0x80000000L, bTof),
+                 Arguments.of(new BufferType.Floats(BufferKind.HEAP_VIEW), 0x0L, 0x80000000L, bTof),
+                 Arguments.of(new BufferType.Floats(BufferKind.DIRECT), 0x0L, 0x80000000L, bTof),
+                 Arguments.of(new BufferType.Doubles(BufferKind.HEAP), 0x0L, 0x8000000000000000L, bToD),
+                 Arguments.of(new BufferType.Doubles(BufferKind.HEAP_VIEW), 0x0L, 0x8000000000000000L, bToD),
+                 Arguments.of(new BufferType.Doubles(BufferKind.DIRECT), 0x0L, 0x8000000000000000L, bToD));
     }
 
-
-    static Object[][] charBufferTypes;
-
-    @DataProvider
-    public static Object[][] charBufferTypesProvider() {
-        if (charBufferTypes == null) {
-            charBufferTypes = new Object[][]{
-                    {new BufferType.Chars(BufferKind.HEAP)},
-                    {new BufferType.Chars(BufferKind.HEAP_VIEW)},
-                    {new BufferType.Chars(BufferKind.DIRECT)},
-            };
-        }
-        return charBufferTypes;
+    public static Stream<Arguments> charBufferTypesSource() {
+        return Stream.of
+            (Arguments.of(new BufferType.Chars(BufferKind.HEAP)),
+             Arguments.of(new BufferType.Chars(BufferKind.HEAP_VIEW)),
+             Arguments.of(new BufferType.Chars(BufferKind.DIRECT)));
     }
 
-
     // Tests all primitive buffers
-    @Test(dataProvider = "bufferTypesProvider")
+    @ParameterizedTest
+    @MethodSource("bufferTypesSource")
     <E>
     void testBuffers(BufferType<Buffer, E> bufferType) {
         // Test with buffers of the same byte order (BE)
@@ -559,7 +542,8 @@ public class EqualsCompareTest {
     }
 
     // Tests float and double buffers with edge-case values (NaN, -0.0, +0.0)
-    @Test(dataProvider = "floatBufferTypesProvider")
+    @ParameterizedTest
+    @MethodSource("floatBufferTypesSource")
     public void testFloatBuffers(
             BufferType<Buffer, Float> bufferType,
             long rawBitsA, long rawBitsB,
@@ -596,17 +580,18 @@ public class EqualsCompareTest {
 
         // Sanity check
         int size = arraySizeFor(bufferType.elementType);
-        Assert.assertTrue(bufferType.pairWiseEquals(allAs.apply(bufferType, size),
-                                                    allBs.apply(bufferType, size)));
-        Assert.assertTrue(bufferType.equals(allAs.apply(bufferType, size),
-                                            allBs.apply(bufferType, size)));
+        assertTrue(bufferType.pairWiseEquals(allAs.apply(bufferType, size),
+                                             allBs.apply(bufferType, size)));
+        assertTrue(bufferType.equals(allAs.apply(bufferType, size),
+                                     allBs.apply(bufferType, size)));
 
         testBufferType(bufferType, allAs, allBs);
         testBufferType(bufferType, allAs, halfBs);
     }
 
     // Tests CharBuffer for region sources and CharSequence sources
-    @Test(dataProvider = "charBufferTypesProvider")
+    @ParameterizedTest
+    @MethodSource("charBufferTypesSource")
     public void testCharBuffers(BufferType.Chars charBufferType) {
 
         BiFunction<BufferType.Chars, Integer, CharBuffer> constructor = (at, s) -> {
@@ -623,7 +608,6 @@ public class EqualsCompareTest {
         testBufferType(charBufferType, constructor, constructorX);
     }
 
-
     <B extends Buffer, E, BT extends BufferType<B, E>>
     void testBufferType(BT bt,
                         BiFunction<BT, Integer, B> aConstructor,
@@ -652,26 +636,26 @@ public class EqualsCompareTest {
                                        : b;
 
                                 boolean eq = bt.pairWiseEquals(as, bs);
-                                Assert.assertEquals(bt.equals(as, bs), eq);
-                                Assert.assertEquals(bt.equals(bs, as), eq);
+                                assertEquals(eq, bt.equals(as, bs));
+                                assertEquals(eq, bt.equals(bs, as));
                                 if (eq) {
-                                    Assert.assertEquals(bt.compare(as, bs), 0);
-                                    Assert.assertEquals(bt.compare(bs, as), 0);
+                                    assertEquals(0, bt.compare(as, bs));
+                                    assertEquals(0, bt.compare(bs, as));
 
                                     // If buffers are equal, there shall be no mismatch
-                                    Assert.assertEquals(bt.mismatch(as, bs), -1);
-                                    Assert.assertEquals(bt.mismatch(bs, as), -1);
+                                    assertEquals(-1, bt.mismatch(as, bs));
+                                    assertEquals(-1, bt.mismatch(bs, as));
                                 }
                                 else {
                                     int aCb = bt.compare(as, bs);
                                     int bCa = bt.compare(bs, as);
                                     int v = Integer.signum(aCb) * Integer.signum(bCa);
-                                    Assert.assertTrue(v == -1);
+                                    assertEquals(-1, v);
 
                                     int aMs = bt.mismatch(as, bs);
                                     int bMs = bt.mismatch(bs, as);
-                                    Assert.assertNotEquals(aMs, -1);
-                                    Assert.assertEquals(aMs, bMs);
+                                    assertNotEquals(-1, aMs);
+                                    assertEquals(bMs, aMs);
                                 }
                             }
                         }
@@ -686,17 +670,17 @@ public class EqualsCompareTest {
                                 // Create common prefix with a length of i - aFrom
                                 bt.set(c, i, -1);
 
-                                Assert.assertFalse(bt.equals(c, a));
+                                assertFalse(bt.equals(c, a));
 
                                 int cCa = bt.compare(cs, as);
                                 int aCc = bt.compare(as, cs);
                                 int v = Integer.signum(cCa) * Integer.signum(aCc);
-                                Assert.assertTrue(v == -1);
+                                assertEquals(-1, v);
 
                                 int cMa = bt.mismatch(cs, as);
                                 int aMc = bt.mismatch(as, cs);
-                                Assert.assertEquals(cMa, aMc);
-                                Assert.assertEquals(cMa, i - aFrom);
+                                assertEquals(aMc, cMa);
+                                assertEquals(i - aFrom, cMa);
                             }
                         }
                     }
@@ -731,8 +715,8 @@ public class EqualsCompareTest {
         try (FileChannel fc = FileChannel.open(path, READ, DELETE_ON_CLOSE)) {
             MappedByteBuffer one = fc.map(FileChannel.MapMode.READ_ONLY, 0, bytes.length);
             ByteBuffer two = ByteBuffer.wrap(bytes);
-            Assert.assertEquals(one, two);
-            Assert.assertEquals(one.hashCode(), two.hashCode());
+            assertEquals(two, one);
+            assertEquals(two.hashCode(), one.hashCode());
         }
     }
 }
diff --git a/test/jdk/java/nio/Buffer/ReachabilityTest.java b/test/jdk/java/nio/Buffer/ReachabilityTest.java
index 2b0a2710b46..114077b3626 100644
--- a/test/jdk/java/nio/Buffer/ReachabilityTest.java
+++ b/test/jdk/java/nio/Buffer/ReachabilityTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -24,12 +24,9 @@
 /* @test
  * @bug 8208362
  * @summary Tests reachability from source to dependent direct byte buffers
- * @run testng ReachabilityTest
+ * @run junit ReachabilityTest
  */
 
-import org.testng.Assert;
-import org.testng.annotations.Test;
-
 import java.lang.ref.Reference;
 import java.lang.ref.ReferenceQueue;
 import java.lang.ref.WeakReference;
@@ -41,8 +38,14 @@ import java.util.Objects;
 import java.util.concurrent.CountDownLatch;
 import java.util.function.UnaryOperator;
 
+import org.junit.jupiter.api.Test;
+
 import static java.util.concurrent.TimeUnit.MILLISECONDS;
 
+import static org.junit.jupiter.api.Assertions.assertNotNull;
+import static org.junit.jupiter.api.Assertions.assertTrue;
+import static org.junit.jupiter.api.Assertions.fail;
+
 public class ReachabilityTest {
 
     @Test
@@ -98,13 +101,13 @@ public class ReachabilityTest {
                 }
             }
         } catch (InterruptedException unexpected) {
-            throw new AssertionError("unexpected InterruptedException");
+            fail("unexpected InterruptedException");
         }
 
         // Some or all of the intermediate values must be GC'ed
-        Assert.assertTrue(collected);
+        assertTrue(collected);
         // The root should never be GC'ed
-        Assert.assertNotNull(root.get());
+        assertNotNull(root.get());
 
         Reference.reachabilityFence(t);
     }
diff --git a/test/jdk/java/nio/MappedByteBuffer/ForceViews.java b/test/jdk/java/nio/MappedByteBuffer/ForceViews.java
index 57ddac28cdf..950b35dc0c3 100644
--- a/test/jdk/java/nio/MappedByteBuffer/ForceViews.java
+++ b/test/jdk/java/nio/MappedByteBuffer/ForceViews.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2021, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2021, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,46 +25,31 @@
  * @test
  * @bug 4833719
  * @summary Verify MappedByteBuffer force on compact, duplicate, and slice views
- * @run testng ForceViews
+ * @run junit ForceViews
  */
 import java.io.IOException;
 import java.nio.ByteBuffer;
 import java.nio.MappedByteBuffer;
 import java.nio.ReadOnlyBufferException;
 import java.nio.channels.FileChannel;
-import static java.nio.channels.FileChannel.MapMode.*;
 import java.nio.file.Path;
-import static java.nio.file.StandardOpenOption.*;
 import java.util.function.BiFunction;
+import java.util.stream.Stream;
 
-import org.testng.Assert;
-import org.testng.annotations.AfterTest;
-import org.testng.annotations.BeforeTest;
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
+import static java.nio.channels.FileChannel.MapMode.*;
+import static java.nio.file.StandardOpenOption.*;
+
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.Arguments;
+import org.junit.jupiter.params.provider.MethodSource;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
 
 public class ForceViews {
 
     static record Segment(int position, int length) {}
 
-    private FileChannel fc;
-
-    @BeforeTest(alwaysRun=true)
-    public void openChannel() throws IOException {
-        Path file = Path.of(".", "junk");
-        fc = FileChannel.open(file, CREATE_NEW, READ, WRITE, DELETE_ON_CLOSE);
-        ByteBuffer buf = ByteBuffer.wrap(new byte[1024]);
-        fc.write(buf);
-        fc.position(0);
-    }
-
-    @AfterTest(alwaysRun=true)
-    public void closeChannel() throws IOException {
-        fc.close();
-    }
-
-    @DataProvider
-    public Object[][] provider() throws IOException {
+    public static Stream<Arguments> provider() throws IOException {
         BiFunction<MappedByteBuffer,Segment,MappedByteBuffer> absSlice =
             (m, s) -> { return m.slice(s.position, s.length); };
         BiFunction<MappedByteBuffer,Segment,MappedByteBuffer> relSlice =
@@ -75,42 +60,47 @@ public class ForceViews {
         BiFunction<MappedByteBuffer,Segment,MappedByteBuffer> compact =
             (m, s) -> { return m.compact(); };
 
-        Object[][] result = new Object[][] {
-            {"Absolute slice", fc, 256, 512, 128, 128, 32, 32, absSlice},
-            {"Relative slice", fc, 256, 512, 0, 128, 32, 32, relSlice},
-            {"Duplicate", fc, 256, 512, 0, 256, 32, 32, duplicate},
-            {"Compact", fc, 256, 512, 0, 256, 32, 32, compact}
-        };
-
-        return result;
+        return Stream.of
+            (Arguments.of("Absolute slice", 256, 512, 128, 128, 32, 32, absSlice),
+             Arguments.of("Relative slice", 256, 512, 0, 128, 32, 32, relSlice),
+             Arguments.of("Duplicate", 256, 512, 0, 256, 32, 32, duplicate),
+             Arguments.of("Compact", 256, 512, 0, 256, 32, 32, compact));
     }
 
-    @Test(dataProvider = "provider")
-    public void test(String tst, FileChannel fc, int mapPosition, int mapLength,
-        int sliceIndex, int sliceLength, int regionOffset, int regionLength,
-        BiFunction<MappedByteBuffer,Segment,MappedByteBuffer> f)
+    @ParameterizedTest
+    @MethodSource("provider")
+    public void test(String tst, int mapPosition, int mapLength,
+                     int sliceIndex, int sliceLength, int regionOffset,
+                     int regionLength,
+                     BiFunction<MappedByteBuffer,Segment,MappedByteBuffer> f)
         throws Exception {
-        MappedByteBuffer mbb = fc.map(READ_WRITE, mapPosition, mapLength);
-        mbb = f.apply(mbb, new Segment(sliceIndex, sliceLength));
-        for (int i = regionOffset; i < regionOffset + regionLength; i++) {
-            mbb.put(i, (byte)i);
-        }
-        mbb.force(regionOffset, regionOffset + regionLength);
 
-        int fcPos = mapPosition + sliceIndex + regionOffset;
-        int mbbPos = regionOffset;
-        int length = regionLength;
+        Path file = Path.of(".", "junk");
+        try (FileChannel fc = FileChannel.open(file, CREATE, READ, WRITE, DELETE_ON_CLOSE)) {
+            fc.write(ByteBuffer.wrap(new byte[1024]));
+            fc.position(0);
 
-        ByteBuffer buf = ByteBuffer.allocate(length);
-        fc.position(fcPos);
-        fc.read(buf);
-        for (int i = 0; i < length; i++) {
-            int fcVal = buf.get(i);
-            int mbbVal = mbb.get(mbbPos + i);
-            int val = regionOffset + i;
-            Assert.assertTrue(fcVal == val && mbbVal == val,
-                String.format("%s: i %d, fcVal %d, mbbVal %d, val %d",
-                    tst, i, fcVal, mbbVal, val));
+            MappedByteBuffer mbb = fc.map(READ_WRITE, mapPosition, mapLength);
+            mbb = f.apply(mbb, new Segment(sliceIndex, sliceLength));
+            for (int i = regionOffset; i < regionOffset + regionLength; i++) {
+                mbb.put(i, (byte)i);
+            }
+            mbb.force(regionOffset, regionOffset + regionLength);
+
+            int fcPos = mapPosition + sliceIndex + regionOffset;
+            int mbbPos = regionOffset;
+            int length = regionLength;
+
+            ByteBuffer buf = ByteBuffer.allocate(length);
+            fc.position(fcPos);
+            fc.read(buf);
+            for (int i = 0; i < length; i++) {
+                int fcVal = buf.get(i);
+                int mbbVal = mbb.get(mbbPos + i);
+                int val = regionOffset + i;
+                assertEquals(val, fcVal);
+                assertEquals(val, mbbVal);
+            }
         }
     }
 }

From b9220c930a6e2b3de1fcfab97e09252310b3ff39 Mon Sep 17 00:00:00 2001
From: Joe Darcy <darcy@openjdk.org>
Date: Tue, 10 Mar 2026 19:08:08 +0000
Subject: [PATCH 134/655] 8379552: Correct build tags in
 StrictMath/PowTests.java

Reviewed-by: bpb
---
 test/jdk/java/lang/StrictMath/PowTests.java | 5 ++++-
 1 file changed, 4 insertions(+), 1 deletion(-)

diff --git a/test/jdk/java/lang/StrictMath/PowTests.java b/test/jdk/java/lang/StrictMath/PowTests.java
index 4b68c5bdcd6..90482b264fe 100644
--- a/test/jdk/java/lang/StrictMath/PowTests.java
+++ b/test/jdk/java/lang/StrictMath/PowTests.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -24,6 +24,9 @@
 /*
  * @test
  * @bug 8136874 8362376
+ * @build Tests
+ * @build PowTests
+ * @run main PowTests
  * @summary Tests for StrictMath.pow
  */
 

From e00d6d28e19f73146223154d4061fbec10107bd9 Mon Sep 17 00:00:00 2001
From: Phil Race <prr@openjdk.org>
Date: Tue, 10 Mar 2026 19:15:27 +0000
Subject: [PATCH 135/655] 8378899: Remove AppContext from java.awt.Toolkit
 implementation

Reviewed-by: dnguyen, serb
---
 .../share/classes/java/awt/Toolkit.java       | 45 +++----------------
 1 file changed, 6 insertions(+), 39 deletions(-)

diff --git a/src/java.desktop/share/classes/java/awt/Toolkit.java b/src/java.desktop/share/classes/java/awt/Toolkit.java
index 1ca5cdd8112..4fc9dc8e82d 100644
--- a/src/java.desktop/share/classes/java/awt/Toolkit.java
+++ b/src/java.desktop/share/classes/java/awt/Toolkit.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1995, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1995, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -72,7 +72,6 @@ import java.util.stream.Collectors;
 import javax.accessibility.AccessibilityProvider;
 
 import sun.awt.AWTAccessor;
-import sun.awt.AppContext;
 import sun.awt.HeadlessToolkit;
 import sun.awt.PeerEvent;
 import sun.awt.PlatformGraphicsInfo;
@@ -2046,8 +2045,6 @@ public abstract class Toolkit {
     @SuppressWarnings("serial")
     private static class DesktopPropertyChangeSupport extends PropertyChangeSupport {
 
-        private static final StringBuilder PROP_CHANGE_SUPPORT_KEY =
-                new StringBuilder("desktop property change support key");
         private final Object source;
 
         public DesktopPropertyChangeSupport(Object sourceBean) {
@@ -2055,16 +2052,14 @@ public abstract class Toolkit {
             source = sourceBean;
         }
 
+        private static PropertyChangeSupport pcs;
         @Override
         public synchronized void addPropertyChangeListener(
                 String propertyName,
                 PropertyChangeListener listener)
         {
-            PropertyChangeSupport pcs = (PropertyChangeSupport)
-                    AppContext.getAppContext().get(PROP_CHANGE_SUPPORT_KEY);
             if (null == pcs) {
                 pcs = new PropertyChangeSupport(source);
-                AppContext.getAppContext().put(PROP_CHANGE_SUPPORT_KEY, pcs);
             }
             pcs.addPropertyChangeListener(propertyName, listener);
         }
@@ -2074,8 +2069,6 @@ public abstract class Toolkit {
                 String propertyName,
                 PropertyChangeListener listener)
         {
-            PropertyChangeSupport pcs = (PropertyChangeSupport)
-                    AppContext.getAppContext().get(PROP_CHANGE_SUPPORT_KEY);
             if (null != pcs) {
                 pcs.removePropertyChangeListener(propertyName, listener);
             }
@@ -2084,8 +2077,6 @@ public abstract class Toolkit {
         @Override
         public synchronized PropertyChangeListener[] getPropertyChangeListeners()
         {
-            PropertyChangeSupport pcs = (PropertyChangeSupport)
-                    AppContext.getAppContext().get(PROP_CHANGE_SUPPORT_KEY);
             if (null != pcs) {
                 return pcs.getPropertyChangeListeners();
             } else {
@@ -2096,8 +2087,6 @@ public abstract class Toolkit {
         @Override
         public synchronized PropertyChangeListener[] getPropertyChangeListeners(String propertyName)
         {
-            PropertyChangeSupport pcs = (PropertyChangeSupport)
-                    AppContext.getAppContext().get(PROP_CHANGE_SUPPORT_KEY);
             if (null != pcs) {
                 return pcs.getPropertyChangeListeners(propertyName);
             } else {
@@ -2107,19 +2096,14 @@ public abstract class Toolkit {
 
         @Override
         public synchronized void addPropertyChangeListener(PropertyChangeListener listener) {
-            PropertyChangeSupport pcs = (PropertyChangeSupport)
-                    AppContext.getAppContext().get(PROP_CHANGE_SUPPORT_KEY);
             if (null == pcs) {
                 pcs = new PropertyChangeSupport(source);
-                AppContext.getAppContext().put(PROP_CHANGE_SUPPORT_KEY, pcs);
             }
             pcs.addPropertyChangeListener(listener);
         }
 
         @Override
         public synchronized void removePropertyChangeListener(PropertyChangeListener listener) {
-            PropertyChangeSupport pcs = (PropertyChangeSupport)
-                    AppContext.getAppContext().get(PROP_CHANGE_SUPPORT_KEY);
             if (null != pcs) {
                 pcs.removePropertyChangeListener(listener);
             }
@@ -2131,33 +2115,16 @@ public abstract class Toolkit {
          */
         @Override
         public void firePropertyChange(final PropertyChangeEvent evt) {
+            if (pcs == null) {
+                return;
+            }
             Object oldValue = evt.getOldValue();
             Object newValue = evt.getNewValue();
             String propertyName = evt.getPropertyName();
             if (oldValue != null && newValue != null && oldValue.equals(newValue)) {
                 return;
             }
-            Runnable updater = new Runnable() {
-                public void run() {
-                    PropertyChangeSupport pcs = (PropertyChangeSupport)
-                            AppContext.getAppContext().get(PROP_CHANGE_SUPPORT_KEY);
-                    if (null != pcs) {
-                        pcs.firePropertyChange(evt);
-                    }
-                }
-            };
-            final AppContext currentAppContext = AppContext.getAppContext();
-            for (AppContext appContext : AppContext.getAppContexts()) {
-                if (null == appContext || appContext.isDisposed()) {
-                    continue;
-                }
-                if (currentAppContext == appContext) {
-                    updater.run();
-                } else {
-                    final PeerEvent e = new PeerEvent(source, updater, PeerEvent.ULTIMATE_PRIORITY_EVENT);
-                    SunToolkit.postEvent(appContext, e);
-                }
-            }
+            pcs.firePropertyChange(evt);
         }
     }
 

From 08c0a787686df205f5a2d12b5b23b2a97f155090 Mon Sep 17 00:00:00 2001
From: Matias Saavedra Silva <matsaave@openjdk.org>
Date: Tue, 10 Mar 2026 20:48:52 +0000
Subject: [PATCH 136/655] 8378371: Default classlist not deterministic due to
 JIT activity

Reviewed-by: rriggs, liach, erikj
---
 make/GenerateLinkOptData.gmk                  |   4 +
 .../runtime/cds/DeterministicClasslist.java   | 111 ++++++++++++++++++
 2 files changed, 115 insertions(+)
 create mode 100644 test/hotspot/jtreg/runtime/cds/DeterministicClasslist.java

diff --git a/make/GenerateLinkOptData.gmk b/make/GenerateLinkOptData.gmk
index 6f6e1f29b4c..d615a34e71a 100644
--- a/make/GenerateLinkOptData.gmk
+++ b/make/GenerateLinkOptData.gmk
@@ -70,12 +70,15 @@ CLASSLIST_FILE_VM_OPTS = \
 
 # Save the stderr output of the command and print it along with stdout in case
 # something goes wrong.
+# The classlists must be generated with -Xint to avoid non-determinism
+# introduced by JIT compiled code
 $(CLASSLIST_FILE): $(INTERIM_IMAGE_DIR)/bin/java$(EXECUTABLE_SUFFIX) $(CLASSLIST_JAR)
 	$(call MakeDir, $(LINK_OPT_DIR))
 	$(call LogInfo, Generating $(patsubst $(OUTPUTDIR)/%, %, $@))
 	$(call LogInfo, Generating $(patsubst $(OUTPUTDIR)/%, %, $(JLI_TRACE_FILE)))
 	$(FIXPATH) $(INTERIM_IMAGE_DIR)/bin/java -XX:DumpLoadedClassList=$@.raw \
 	    $(CLASSLIST_FILE_VM_OPTS) \
+	    -Xint \
 	    -Xlog:aot=off \
 	    -Xlog:cds=off \
 	    -cp $(SUPPORT_OUTPUTDIR)/classlist.jar \
@@ -90,6 +93,7 @@ $(CLASSLIST_FILE): $(INTERIM_IMAGE_DIR)/bin/java$(EXECUTABLE_SUFFIX) $(CLASSLIST
 	    -XX:SharedClassListFile=$@.interim -XX:SharedArchiveFile=$@.jsa \
 	    -Djava.lang.invoke.MethodHandle.TRACE_RESOLVE=true \
 	    $(CLASSLIST_FILE_VM_OPTS) \
+	    -Xint \
 	    --module-path $(SUPPORT_OUTPUTDIR)/classlist.jar \
 	    -Xlog:aot=off \
 	    -Xlog:cds=off \
diff --git a/test/hotspot/jtreg/runtime/cds/DeterministicClasslist.java b/test/hotspot/jtreg/runtime/cds/DeterministicClasslist.java
new file mode 100644
index 00000000000..00f12a500a4
--- /dev/null
+++ b/test/hotspot/jtreg/runtime/cds/DeterministicClasslist.java
@@ -0,0 +1,111 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+/**
+ * @test
+ * @bug 8378371
+ * @summary The same JDK build should always generate the same classlist file (no randomness).
+ * @requires vm.cds & vm.flagless
+ * @library /test/lib ./appcds/
+ * @run driver DeterministicClasslist
+ */
+
+import java.io.BufferedReader;
+import java.io.File;
+import java.io.FileReader;
+import java.nio.file.Files;
+import java.nio.file.Path;
+import java.nio.file.Paths;
+import java.util.List;
+import java.util.Map;
+import java.util.Map.Entry;
+import jdk.test.lib.cds.CDSTestUtils;
+import jdk.test.lib.compiler.InMemoryJavaCompiler;
+import jdk.test.lib.helpers.ClassFileInstaller;
+
+
+public class DeterministicClasslist {
+
+    public static void compareClasslists(String base, String test) throws Exception {
+        File baseClasslistFile = new File(base);
+        File testClasslistFile = new File(test);
+
+        BufferedReader baseReader = new BufferedReader(new FileReader(baseClasslistFile));
+        BufferedReader testReader = new BufferedReader(new FileReader(testClasslistFile));
+
+        String baseLine, testLine;
+        while ((baseLine = baseReader.readLine()) != null) {
+            testLine = testReader.readLine();
+            // Skip constant pool entries
+            if (baseLine.contains("@cp")) {
+                continue;
+            }
+            if (!baseLine.equals(testLine)) {
+                System.out.println(baseLine + " vs " + testLine);
+                throw new RuntimeException("Classlists differ");
+            }
+        }
+    }
+
+    static Path findFile(String path) {
+        Path root = Paths.get(System.getProperty("test.root", "."));
+        // Move back to java root directory
+        root = root.getParent().getParent().getParent();
+
+        Path file = root.resolve(path);
+        if (Files.exists(file)) {
+            return file;
+        }
+
+        return null;
+    }
+
+    public static void main (String[] args) throws Exception {
+        String[] classlist = { "build/tools/classlist/HelloClasslist", "build/tools/classlist/HelloClasslist$1A", "build/tools/classlist/HelloClasslist$1B" };
+        String appClass = classlist[0];
+        String appJar;
+        String classDir = System.getProperty("test.classes");
+        String baseClasslist = "base.classlist";
+        String testClasslist = "test.classlist";
+
+        Path testPath = findFile("make/jdk/src/classes/build/tools/classlist/HelloClasslist.java");
+        if (testPath == null) {
+            throw new RuntimeException("Could not find HelloClasslist");
+        }
+
+        String source = Files.readString(testPath);
+        Map<String, byte[]> compiledClasses = InMemoryJavaCompiler.compile(Map.of(appClass, source));
+
+        for (Entry<String, byte[]> e : compiledClasses.entrySet()) {
+            ClassFileInstaller.writeClassToDisk(e.getKey(), e.getValue(), classDir);
+        }
+
+        JarBuilder.build("classlist", classlist);
+        appJar = TestCommon.getTestJar("classlist.jar");
+
+        CDSTestUtils.dumpClassList(baseClasslist, "-cp", appJar, "-Xint", appClass);
+        CDSTestUtils.dumpClassList(testClasslist, "-cp", appJar, "-Xint", appClass);
+
+        compareClasslists(baseClasslist, testClasslist);
+    }
+}

From bf28e03eeb9932ecc801b80631a43283fe525ddd Mon Sep 17 00:00:00 2001
From: Matias Saavedra Silva <matsaave@openjdk.org>
Date: Tue, 10 Mar 2026 20:52:14 +0000
Subject: [PATCH 137/655] 8374830: Improve Hotspot crash message in
 CDSTestUtils

Reviewed-by: dholmes, coleenp
---
 test/hotspot/jtreg/runtime/cds/TestCDSVMCrash.java | 6 +++---
 test/lib/jdk/test/lib/cds/CDSTestUtils.java        | 9 +++++++--
 2 files changed, 10 insertions(+), 5 deletions(-)

diff --git a/test/hotspot/jtreg/runtime/cds/TestCDSVMCrash.java b/test/hotspot/jtreg/runtime/cds/TestCDSVMCrash.java
index 4e40ae3645e..8241b0f9a2e 100644
--- a/test/hotspot/jtreg/runtime/cds/TestCDSVMCrash.java
+++ b/test/hotspot/jtreg/runtime/cds/TestCDSVMCrash.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2023, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2023, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -61,8 +61,8 @@ public class TestCDSVMCrash {
             CDSTestUtils.executeAndLog(pb, "cds_vm_crash");
             throw new Error("Expected VM to crash");
         } catch(RuntimeException e) {
-            if (!e.getMessage().equals("Hotspot crashed")) {
-                throw new Error("Expected message: Hotspot crashed");
+            if (!e.getMessage().contains("A fatal error has been detected")) {
+                throw new Error("Expected message: A fatal error has been detected");
             }
         }
         System.out.println("PASSED");
diff --git a/test/lib/jdk/test/lib/cds/CDSTestUtils.java b/test/lib/jdk/test/lib/cds/CDSTestUtils.java
index 13ac2e4e97a..1c51a693907 100644
--- a/test/lib/jdk/test/lib/cds/CDSTestUtils.java
+++ b/test/lib/jdk/test/lib/cds/CDSTestUtils.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2017, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2017, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -696,11 +696,16 @@ public class CDSTestUtils {
             System.out.println("[STDOUT]\n" + output.getStdout());
 
         if (output.getExitValue() != 0 && output.getStdout().contains("A fatal error has been detected")) {
-          throw new RuntimeException("Hotspot crashed");
+            throw new RuntimeException(getCrashMessage(output.getStdout()));
         }
         return output;
     }
 
+    static String getCrashMessage(String stdOut) {
+        int start = stdOut.indexOf("# A fatal error has been detected by the Java Runtime Environment:");
+        int end = stdOut.indexOf(".log", start) + 4;
+        return stdOut.substring(start, end);
+    }
 
     private static void writeFile(File file, String content) throws Exception {
         FileOutputStream fos = new FileOutputStream(file);

From e760171da8825c315869e16edc01c4e450aebb0a Mon Sep 17 00:00:00 2001
From: Matias Saavedra Silva <matsaave@openjdk.org>
Date: Tue, 10 Mar 2026 20:57:49 +0000
Subject: [PATCH 138/655] 8376521: Verifier: disallow acmp & ifnull on
 'uninitialized' types 8375483: Should set flagThisUninit whenever
 uninitializedThis is on the stack

Reviewed-by: liach, coleenp
---
 src/hotspot/share/classfile/verifier.cpp      |  4 +-
 .../classfile/impl/verifier/VerifierImpl.java |  8 +--
 .../share/native/libverify/check_code.c       |  5 +-
 .../runtime/verifier/UninitThisAcmp.jasm      | 43 +++++++++++
 .../runtime/verifier/UninitThisAcmpOld.jasm   | 41 +++++++++++
 .../runtime/verifier/UninitThisIfNull.jasm    | 42 +++++++++++
 .../runtime/verifier/UninitThisIfNullOld.jasm | 40 +++++++++++
 .../runtime/verifier/UninitializedAcmp.jasm   | 44 ++++++++++++
 .../verifier/UninitializedAcmpOld.jasm        | 41 +++++++++++
 .../runtime/verifier/UninitializedIfNull.jasm | 42 +++++++++++
 .../verifier/UninitializedIfNullOld.jasm      | 39 ++++++++++
 .../UninitializedThisVerificationTest.java    | 58 +++++++++++++++
 test/jdk/jdk/classfile/VerifierSelfTest.java  | 72 ++++++++++++++++++-
 13 files changed, 468 insertions(+), 11 deletions(-)
 create mode 100644 test/hotspot/jtreg/runtime/verifier/UninitThisAcmp.jasm
 create mode 100644 test/hotspot/jtreg/runtime/verifier/UninitThisAcmpOld.jasm
 create mode 100644 test/hotspot/jtreg/runtime/verifier/UninitThisIfNull.jasm
 create mode 100644 test/hotspot/jtreg/runtime/verifier/UninitThisIfNullOld.jasm
 create mode 100644 test/hotspot/jtreg/runtime/verifier/UninitializedAcmp.jasm
 create mode 100644 test/hotspot/jtreg/runtime/verifier/UninitializedAcmpOld.jasm
 create mode 100644 test/hotspot/jtreg/runtime/verifier/UninitializedIfNull.jasm
 create mode 100644 test/hotspot/jtreg/runtime/verifier/UninitializedIfNullOld.jasm
 create mode 100644 test/hotspot/jtreg/runtime/verifier/UninitializedThisVerificationTest.java

diff --git a/src/hotspot/share/classfile/verifier.cpp b/src/hotspot/share/classfile/verifier.cpp
index 76d09161fdd..48be24c20dc 100644
--- a/src/hotspot/share/classfile/verifier.cpp
+++ b/src/hotspot/share/classfile/verifier.cpp
@@ -1607,12 +1607,12 @@ void ClassVerifier::verify_method(const methodHandle& m, TRAPS) {
         case Bytecodes::_if_acmpeq :
         case Bytecodes::_if_acmpne :
           current_frame.pop_stack(
-            VerificationType::reference_check(), CHECK_VERIFY(this));
+            object_type(), CHECK_VERIFY(this));
           // fall through
         case Bytecodes::_ifnull :
         case Bytecodes::_ifnonnull :
           current_frame.pop_stack(
-            VerificationType::reference_check(), CHECK_VERIFY(this));
+            object_type(), CHECK_VERIFY(this));
           stackmap_table.check_jump_target
             (&current_frame, bcs.bci(), bcs.get_offset_s2(), CHECK_VERIFY(this));
           no_control_flow = false; break;
diff --git a/src/java.base/share/classes/jdk/internal/classfile/impl/verifier/VerifierImpl.java b/src/java.base/share/classes/jdk/internal/classfile/impl/verifier/VerifierImpl.java
index 07406b2ee7f..adc595813ee 100644
--- a/src/java.base/share/classes/jdk/internal/classfile/impl/verifier/VerifierImpl.java
+++ b/src/java.base/share/classes/jdk/internal/classfile/impl/verifier/VerifierImpl.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2022, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2022, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -1047,13 +1047,11 @@ public final class VerifierImpl {
                         no_control_flow = false; break;
                     case IF_ACMPEQ :
                     case IF_ACMPNE :
-                        current_frame.pop_stack(
-                            VerificationType.reference_check);
+                        current_frame.pop_stack(object_type());
                         // fall through
                     case IFNULL :
                     case IFNONNULL :
-                        current_frame.pop_stack(
-                            VerificationType.reference_check);
+                        current_frame.pop_stack(object_type());
                         target = bcs.dest();
                         stackmap_table.check_jump_target
                             (current_frame, target);
diff --git a/src/java.base/share/native/libverify/check_code.c b/src/java.base/share/native/libverify/check_code.c
index 5a8f50cd0a0..4830fedb97b 100644
--- a/src/java.base/share/native/libverify/check_code.c
+++ b/src/java.base/share/native/libverify/check_code.c
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1994, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1994, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -2162,8 +2162,7 @@ pop_stack(context_type *context, unsigned int inumber, stack_info_type *new_stac
                         break;
                     if (   (GET_ITEM_TYPE(top_type) == ITEM_NewObject
                             || (GET_ITEM_TYPE(top_type) == ITEM_InitObject))
-                        && ((opcode == JVM_OPC_astore) || (opcode == JVM_OPC_aload)
-                            || (opcode == JVM_OPC_ifnull) || (opcode == JVM_OPC_ifnonnull)))
+                        && ((opcode == JVM_OPC_astore) || (opcode == JVM_OPC_aload)))
                         break;
                     /* The 2nd edition VM of the specification allows field
                      * initializations before the superclass initializer,
diff --git a/test/hotspot/jtreg/runtime/verifier/UninitThisAcmp.jasm b/test/hotspot/jtreg/runtime/verifier/UninitThisAcmp.jasm
new file mode 100644
index 00000000000..c1729a78653
--- /dev/null
+++ b/test/hotspot/jtreg/runtime/verifier/UninitThisAcmp.jasm
@@ -0,0 +1,43 @@
+/*
+ * Copyright (c) 2025, 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+class UninitThisAcmp version 69:0
+{
+  public Method "<init>":"()V"
+    stack 2  locals 2
+  {
+         new               class java/lang/Object;
+         dup;
+         invokespecial     Method java/lang/Object."<init>":"()V";
+         astore_1;
+         aload_0;
+         aload_1;
+         if_acmpne         L14;
+         nop;
+  L14:   stack_frame_type  append;
+           locals_map      class java/lang/Object;
+         aload_0;
+         invokespecial     Method java/lang/Object."<init>":"()V";
+         return;
+  }
+} // end Class UninitThisAcmp
diff --git a/test/hotspot/jtreg/runtime/verifier/UninitThisAcmpOld.jasm b/test/hotspot/jtreg/runtime/verifier/UninitThisAcmpOld.jasm
new file mode 100644
index 00000000000..3bcc1e09b67
--- /dev/null
+++ b/test/hotspot/jtreg/runtime/verifier/UninitThisAcmpOld.jasm
@@ -0,0 +1,41 @@
+/*
+ * Copyright (c) 2025, 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+class UninitThisAcmpOld version 49:0
+{
+  public Method "<init>":"()V"
+    stack 2  locals 2
+  {
+         new               class java/lang/Object;
+         dup;
+         invokespecial     Method java/lang/Object."<init>":"()V";
+         astore_1;
+         aload_0;
+         aload_1;
+         if_acmpne         L14;
+         nop;
+  L14:   aload_0;
+         invokespecial     Method java/lang/Object."<init>":"()V";
+         return;
+  }
+} // end Class UninitThisAcmpOld
diff --git a/test/hotspot/jtreg/runtime/verifier/UninitThisIfNull.jasm b/test/hotspot/jtreg/runtime/verifier/UninitThisIfNull.jasm
new file mode 100644
index 00000000000..57a82a9f1e4
--- /dev/null
+++ b/test/hotspot/jtreg/runtime/verifier/UninitThisIfNull.jasm
@@ -0,0 +1,42 @@
+/*
+ * Copyright (c) 2025, 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+class UninitThisIfNull version 69:0
+{
+  public Method "<init>":"()V"
+    stack 2  locals 2
+  {
+         new               class java/lang/Object;
+         dup;
+         invokespecial     Method java/lang/Object."<init>":"()V";
+         astore_1;
+         aload_0;
+         ifnonnull         L14;
+         nop;
+  L14:   stack_frame_type  append;
+           locals_map      class java/lang/Object;
+         aload_0;
+         invokespecial     Method java/lang/Object."<init>":"()V";
+         return;
+  }
+} // end Class UninitThisIfNull
diff --git a/test/hotspot/jtreg/runtime/verifier/UninitThisIfNullOld.jasm b/test/hotspot/jtreg/runtime/verifier/UninitThisIfNullOld.jasm
new file mode 100644
index 00000000000..fbe96c2eef0
--- /dev/null
+++ b/test/hotspot/jtreg/runtime/verifier/UninitThisIfNullOld.jasm
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2025, 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+class UninitThisIfNullOld version 49:0
+{
+  public Method "<init>":"()V"
+    stack 2  locals 2
+  {
+         new               class java/lang/Object;
+         dup;
+         invokespecial     Method java/lang/Object."<init>":"()V";
+         astore_1;
+         aload_0;
+         ifnonnull         L14;
+         nop;
+  L14:   aload_0;
+         invokespecial     Method java/lang/Object."<init>":"()V";
+         return;
+  }
+} // end Class UninitThisIfNullOld
diff --git a/test/hotspot/jtreg/runtime/verifier/UninitializedAcmp.jasm b/test/hotspot/jtreg/runtime/verifier/UninitializedAcmp.jasm
new file mode 100644
index 00000000000..b8ce17cb16b
--- /dev/null
+++ b/test/hotspot/jtreg/runtime/verifier/UninitializedAcmp.jasm
@@ -0,0 +1,44 @@
+/*
+ * Copyright (c) 2025, 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+class UninitializedAcmp version 69:0
+{
+  Method       "<init>":"()V"
+    stack 5  locals 1
+  {
+         aload_0;
+         invokespecial     Method java/lang/Object."<init>":"()V";
+         aload_0;
+   L1:   new               class java/lang/Object;
+         dup;
+         dup;
+         dup;
+         if_acmpne         L18;
+         nop;
+  L18:   stack_frame_type  full;
+           locals_map      class UninitializedAcmp;
+           stack_map       class UninitializedAcmp, at L1, at L1;
+         invokespecial     Method java/lang/Object."<init>":"()V";
+         return;
+  }
+} // end Class UninitializedAcmp
diff --git a/test/hotspot/jtreg/runtime/verifier/UninitializedAcmpOld.jasm b/test/hotspot/jtreg/runtime/verifier/UninitializedAcmpOld.jasm
new file mode 100644
index 00000000000..d16cc5c6779
--- /dev/null
+++ b/test/hotspot/jtreg/runtime/verifier/UninitializedAcmpOld.jasm
@@ -0,0 +1,41 @@
+/*
+ * Copyright (c) 2025, 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+class UninitializedAcmpOld version 49:0
+{
+  Method       "<init>":"()V"
+    stack 5  locals 1
+  {
+         aload_0;
+         invokespecial     Method java/lang/Object."<init>":"()V";
+         aload_0;
+   L1:   new               class java/lang/Object;
+         dup;
+         dup;
+         dup;
+         if_acmpne         L18;
+         nop;
+  L18:   invokespecial     Method java/lang/Object."<init>":"()V";
+         return;
+  }
+} // end Class UninitializedAcmpOld
diff --git a/test/hotspot/jtreg/runtime/verifier/UninitializedIfNull.jasm b/test/hotspot/jtreg/runtime/verifier/UninitializedIfNull.jasm
new file mode 100644
index 00000000000..4e7251f073d
--- /dev/null
+++ b/test/hotspot/jtreg/runtime/verifier/UninitializedIfNull.jasm
@@ -0,0 +1,42 @@
+/*
+ * Copyright (c) 2025, 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+class UninitializedIfNull version 69:0
+{
+  Method       "<init>":"()V"
+    stack 3  locals 1
+  {
+         aload_0;
+         invokespecial     Method java/lang/Object."<init>":"()V";
+   L1:   new               class java/lang/Object;
+         dup;
+         dup;
+         ifnonnull         L18;
+         nop;
+  L18:   stack_frame_type  full;
+           locals_map      class UninitializedIfNull;
+           stack_map       at L1, at L1;
+         invokespecial     Method java/lang/Object."<init>":"()V";
+         return;
+  }
+} // end Class UninitializedIfNull
diff --git a/test/hotspot/jtreg/runtime/verifier/UninitializedIfNullOld.jasm b/test/hotspot/jtreg/runtime/verifier/UninitializedIfNullOld.jasm
new file mode 100644
index 00000000000..5bffba887a8
--- /dev/null
+++ b/test/hotspot/jtreg/runtime/verifier/UninitializedIfNullOld.jasm
@@ -0,0 +1,39 @@
+/*
+ * Copyright (c) 2025, 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+class UninitializedIfNullOld version 49:0
+{
+  Method       "<init>":"()V"
+    stack 3  locals 1
+  {
+         aload_0;
+         invokespecial     Method java/lang/Object."<init>":"()V";
+   L1:   new               class java/lang/Object;
+         dup;
+         dup;
+         ifnonnull         L18;
+         nop;
+  L18:   invokespecial     Method java/lang/Object."<init>":"()V";
+         return;
+  }
+} // end Class UninitializedIfNullOld
diff --git a/test/hotspot/jtreg/runtime/verifier/UninitializedThisVerificationTest.java b/test/hotspot/jtreg/runtime/verifier/UninitializedThisVerificationTest.java
new file mode 100644
index 00000000000..075e9f2058e
--- /dev/null
+++ b/test/hotspot/jtreg/runtime/verifier/UninitializedThisVerificationTest.java
@@ -0,0 +1,58 @@
+/*
+ * Copyright (c) 2025, 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+/*
+ * @test
+ * @bug 8366743
+ * @summary Test spec rules for uninitialized
+ * @compile UninitThisAcmp.jasm UninitThisIfNull.jasm
+ *          UninitializedIfNull.jasm UninitializedAcmp.jasm
+ *          UninitThisAcmpOld.jasm UninitThisIfNullOld.jasm
+ *          UninitializedAcmpOld.jasm UninitializedIfNullOld.jasm
+ * @run main/othervm -Xlog:verification UninitializedThisVerificationTest
+ */
+
+public class UninitializedThisVerificationTest {
+
+    public static void main(String[] args) throws Exception {
+        String[] testNames = { "UninitThisAcmp", "UninitThisIfNull",
+                               "UninitializedAcmp", "UninitializedIfNull",
+                               "UninitThisAcmpOld", "UninitThisIfNullOld",
+                               "UninitializedAcmpOld", "UninitializedIfNullOld" };
+        int fails = 0;
+        for (String test : testNames) {
+            System.out.println("Testing " + test);
+            try {
+                Class c = Class.forName(test);
+                System.out.println("Failed");
+                fails++;
+            } catch (java.lang.VerifyError e) {
+                System.out.println("Passed");
+            }
+        }
+
+        if (fails > 0) {
+            throw new RuntimeException("Failed: Expected VerifyError in " + fails + " tests");
+        }
+    }
+}
diff --git a/test/jdk/jdk/classfile/VerifierSelfTest.java b/test/jdk/jdk/classfile/VerifierSelfTest.java
index 7d1dae6f519..12458b1586e 100644
--- a/test/jdk/jdk/classfile/VerifierSelfTest.java
+++ b/test/jdk/jdk/classfile/VerifierSelfTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2022, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2022, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -37,12 +37,14 @@ import static java.lang.constant.ConstantDescs.*;
 
 import java.lang.constant.MethodTypeDesc;
 import java.lang.invoke.MethodHandleInfo;
+import java.lang.invoke.MethodHandles;
 import java.net.URI;
 import java.nio.file.FileSystem;
 import java.nio.file.FileSystems;
 import java.nio.file.Files;
 import java.nio.file.Path;
 import java.util.ArrayList;
+import java.util.Arrays;
 import java.util.LinkedList;
 import java.util.List;
 import java.util.Map;
@@ -59,6 +61,9 @@ import jdk.internal.classfile.impl.BufWriterImpl;
 import jdk.internal.classfile.impl.DirectClassBuilder;
 import jdk.internal.classfile.impl.UnboundAttribute;
 import org.junit.jupiter.api.Test;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.Arguments;
+import org.junit.jupiter.params.provider.MethodSource;
 
 import static org.junit.jupiter.api.Assertions.*;
 
@@ -418,6 +423,71 @@ class VerifierSelfTest {
         return lst;
     }
 
+    enum ComparisonInstruction {
+        IF_ACMPEQ(Opcode.IF_ACMPEQ, 2),
+        IF_ACMPNE(Opcode.IF_ACMPNE, 2),
+        IFNONNULL(Opcode.IFNONNULL, 1),
+        IFNULL(Opcode.IFNULL, 1);
+        final Opcode opcode;
+        final int argCount;
+        ComparisonInstruction(Opcode opcode, int argCount) {
+            this.opcode = opcode;
+            this.argCount = argCount;
+        }
+    }
+
+    enum UninitializeKind {
+        UNINITIALIZED, UNINITIALIZED_THIS
+    }
+
+    @ParameterizedTest
+    @MethodSource("uninitializedInBytecodeClasses")
+    public void testUninitializedInComparisons(ComparisonInstruction inst, UninitializeKind kind) throws Throwable {
+        var bytes = ClassFile.of(ClassFile.StackMapsOption.DROP_STACK_MAPS).build(ClassDesc.of("Test"), clb -> clb
+                .withMethodBody(INIT_NAME, MTD_void, 0, cob -> {
+                    StackMapFrameInfo.VerificationTypeInfo uninitializeInfo;
+                    if (kind == UninitializeKind.UNINITIALIZED) {
+                        uninitializeInfo = StackMapFrameInfo.UninitializedVerificationTypeInfo.of(cob.newBoundLabel());
+                        cob.new_(CD_Object);
+                    } else {
+                        uninitializeInfo = StackMapFrameInfo.SimpleVerificationTypeInfo.UNINITIALIZED_THIS;
+                        cob.aload(0);
+                    }
+
+                    // Stack: uninitializeInfo
+                    for (int i = 0; i < inst.argCount; i++) {
+                        cob.dup();
+                    }
+                    var dest = cob.newLabel();
+                    cob.branch(inst.opcode, dest)
+                       .nop()
+                       .labelBinding(dest)
+                       .with(StackMapTableAttribute.of(List.of(StackMapFrameInfo.of(dest,
+                               List.of(StackMapFrameInfo.SimpleVerificationTypeInfo.UNINITIALIZED_THIS),
+                               List.of(uninitializeInfo)))))
+                       .invokespecial(CD_Object, INIT_NAME, MTD_void);
+                    if (kind == UninitializeKind.UNINITIALIZED) {
+                        // still need to call super constructor
+                        cob.aload(0)
+                           .invokespecial(CD_Object, INIT_NAME, MTD_void);
+                    }
+                    cob.return_();
+                }));
+        var errors = ClassFile.of().verify(bytes);
+        assertNotEquals(List.of(), errors, () -> errors + " : " + ClassFile.of().parse(bytes).toDebugString());
+        var lookup = MethodHandles.lookup();
+        assertThrows(VerifyError.class, () -> lookup.defineHiddenClass(bytes, true)); // force JVM verification
+    }
+
+    public static Stream<Arguments> uninitializedInBytecodeClasses() {
+        return Arrays.stream(ComparisonInstruction.values())
+                .mapMulti((inst, sink) -> {
+                    for (var kind : UninitializeKind.values()) {
+                        sink.accept(Arguments.of(inst, kind));
+                    }
+                });
+    }
+
     @Test // JDK-8350029
     void testInvokeSpecialInterfacePatch() {
         var runClass = ClassDesc.of("Run");

From a4daabbbfa3184b0dcce1db73502f69f601978f0 Mon Sep 17 00:00:00 2001
From: Damon Nguyen <dnguyen@openjdk.org>
Date: Tue, 10 Mar 2026 22:13:37 +0000
Subject: [PATCH 139/655] 8237220: [macOS] AWT text test
 CorrectTextComponentSelectionTest.html sometimes fails

Reviewed-by: aivanov, prr, dmarkov
---
 test/jdk/ProblemList.txt                      |  1 -
 .../CorrectTextComponentSelectionTest.java    | 39 ++++++-------------
 2 files changed, 11 insertions(+), 29 deletions(-)

diff --git a/test/jdk/ProblemList.txt b/test/jdk/ProblemList.txt
index de1a0a49d1e..38ffe2ae963 100644
--- a/test/jdk/ProblemList.txt
+++ b/test/jdk/ProblemList.txt
@@ -758,7 +758,6 @@ java/awt/FileDialog/DefaultFocusOwner/DefaultFocusOwner.java 7187728 macosx-all,
 java/awt/FileDialog/DoubleActionESC.java 8356981 linux-all
 java/awt/print/PageFormat/Orient.java 8016055 macosx-all
 java/awt/TextArea/TextAreaCursorTest/HoveringAndDraggingTest.java 8024986 macosx-all,linux-all
-java/awt/TextComponent/CorrectTextComponentSelectionTest.java 8237220 macosx-all
 java/awt/TextComponent/SelectionAndCaretColor.java 7017622 linux-all
 java/awt/event/MouseEvent/SpuriousExitEnter/SpuriousExitEnter.java 8254841 macosx-all
 java/awt/FullScreen/TranslucentWindow/TranslucentWindow.java 8258103 linux-all
diff --git a/test/jdk/java/awt/TextComponent/CorrectTextComponentSelectionTest.java b/test/jdk/java/awt/TextComponent/CorrectTextComponentSelectionTest.java
index 9d3e6d85637..b2352dc04ff 100644
--- a/test/jdk/java/awt/TextComponent/CorrectTextComponentSelectionTest.java
+++ b/test/jdk/java/awt/TextComponent/CorrectTextComponentSelectionTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2005, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2005, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,9 +23,9 @@
 
 /*
  * @test
+ * @key headful
  * @bug 5100806
  * @summary TextArea.select(0,0) does not de-select the selected text properly
- * @key headful
  * @run main CorrectTextComponentSelectionTest
  */
 
@@ -38,7 +38,6 @@ import java.awt.Robot;
 import java.awt.TextArea;
 import java.awt.TextComponent;
 import java.awt.TextField;
-import java.lang.reflect.InvocationTargetException;
 
 public class CorrectTextComponentSelectionTest {
     static TextField tf = new TextField("TextField");
@@ -46,14 +45,11 @@ public class CorrectTextComponentSelectionTest {
     static Robot r;
     static Frame frame;
     static volatile Color color_center;
-    static volatile Point loc;
 
     public static void main(String[] args) throws Exception {
         try {
             r = new Robot();
-            EventQueue.invokeAndWait(() -> {
-                initialize();
-            });
+            EventQueue.invokeAndWait(() -> initialize());
             r.waitForIdle();
             r.delay(1000);
 
@@ -75,24 +71,13 @@ public class CorrectTextComponentSelectionTest {
 
         // We should place to the text components the long strings in order to
         // cover the components by the selection completely
-        String sf = "";
-        for (int i = 0; i < 50; i++) {
-            sf = sf + " ";
-        }
-        tf.setText(sf);
+        tf.setText(" ".repeat(50));
         // We check the color of the text component in order to find out the
         // bug reproducible situation
         tf.setForeground(Color.WHITE);
         tf.setBackground(Color.WHITE);
 
-        String sa = "";
-        for (int i = 0; i < 50; i++) {
-            for (int j = 0; j < 50; j++) {
-                sa = sa + " ";
-            }
-            sa = sa + "\n";
-        }
-        ta.setText(sa);
+        ta.setText((" ".repeat(50) + "\n").repeat(50));
         ta.setForeground(Color.WHITE);
         ta.setBackground(Color.WHITE);
 
@@ -111,26 +96,24 @@ public class CorrectTextComponentSelectionTest {
 
         r.waitForIdle();
         r.delay(100);
+
         EventQueue.invokeAndWait(() -> {
             tc.requestFocus();
             tc.selectAll();
             tc.select(0, 0);
         });
 
-        r.waitForIdle();
-        r.delay(100);
-        EventQueue.invokeAndWait(() -> {
-            loc = tc.getLocationOnScreen();
-        });
         r.waitForIdle();
         r.delay(100);
 
         EventQueue.invokeAndWait(() -> {
-            color_center = r.getPixelColor(loc.x + tc.getWidth() / 2, loc.y + tc.getHeight() / 2);
+            Point p = tc.getLocationOnScreen();
+            p.translate(tc.getWidth() / 2, tc.getHeight() / 2);
+            color_center = r.getPixelColor(p.x, p.y);
         });
 
-        System.out.println("Color of the text component (CENTER) =" + color_center);
-        System.out.println("White color=" + Color.WHITE);
+        System.out.println("Color of the text component (CENTER) = " + color_center);
+        System.out.println("White color = " + Color.WHITE);
 
         if (color_center.getRGB() != Color.WHITE.getRGB()) {
             throw new RuntimeException("Test Failed");

From 9d04c8a8af808afc8fc3162555030ad7faed5beb Mon Sep 17 00:00:00 2001
From: Alexey Semenyuk <asemenyuk@openjdk.org>
Date: Tue, 10 Mar 2026 23:46:53 +0000
Subject: [PATCH 140/655] 8379432: jpackage: Make default equals() in
 jdk.jpackage.test.CannedFormattedString class work as expected

Reviewed-by: almatvee
---
 .../jdk/jpackage/test/CannedArgumentTest.java | 39 ++++++++
 .../test/CannedFormattedStringTest.java       | 99 +++++++++++++++++++
 .../test/JPackageStringBundleTest.java        | 19 ++++
 .../jdk/jpackage/test/CannedArgument.java     | 30 ++++++
 .../jpackage/test/CannedFormattedString.java  | 60 +++++------
 .../jdk/jpackage/test/JPackageCommand.java    |  4 +-
 .../jpackage/test/JPackageStringBundle.java   | 11 ++-
 test/jdk/tools/jpackage/share/ErrorTest.java  |  2 +-
 8 files changed, 218 insertions(+), 46 deletions(-)
 create mode 100644 test/jdk/tools/jpackage/helpers-test/jdk/jpackage/test/CannedArgumentTest.java
 create mode 100644 test/jdk/tools/jpackage/helpers-test/jdk/jpackage/test/CannedFormattedStringTest.java

diff --git a/test/jdk/tools/jpackage/helpers-test/jdk/jpackage/test/CannedArgumentTest.java b/test/jdk/tools/jpackage/helpers-test/jdk/jpackage/test/CannedArgumentTest.java
new file mode 100644
index 00000000000..8653e9c7508
--- /dev/null
+++ b/test/jdk/tools/jpackage/helpers-test/jdk/jpackage/test/CannedArgumentTest.java
@@ -0,0 +1,39 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+package jdk.jpackage.test;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+
+import java.nio.file.Path;
+import jdk.jpackage.test.CannedFormattedStringTest.Formatter;
+import org.junit.jupiter.api.Test;
+
+class CannedArgumentTest {
+
+    @Test
+    void test_cannedAbsolutePath() {
+        var a = Formatter.MESSAGE_FORMAT.create("Current directory: {0}", CannedArgument.cannedAbsolutePath("foo"));
+        assertEquals("Current directory: " + Path.of("foo").toAbsolutePath(), a.getValue());
+        assertEquals("Current directory: {0}+[AbsolutePath(foo)]", a.toString());
+    }
+}
diff --git a/test/jdk/tools/jpackage/helpers-test/jdk/jpackage/test/CannedFormattedStringTest.java b/test/jdk/tools/jpackage/helpers-test/jdk/jpackage/test/CannedFormattedStringTest.java
new file mode 100644
index 00000000000..2e4ad9ab754
--- /dev/null
+++ b/test/jdk/tools/jpackage/helpers-test/jdk/jpackage/test/CannedFormattedStringTest.java
@@ -0,0 +1,99 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+package jdk.jpackage.test;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertNotEquals;
+import static org.junit.jupiter.api.Assertions.assertNotSame;
+
+import java.text.MessageFormat;
+import java.util.List;
+import java.util.function.BiFunction;
+import org.junit.jupiter.api.Test;
+
+class CannedFormattedStringTest {
+
+    @Test
+    void test_getValue() {
+        var a = Formatter.MESSAGE_FORMAT.create("Hello {0}! Bye {0}", "Duke");
+        assertEquals("Hello Duke! Bye Duke", a.getValue());
+        assertEquals("Hello {0}! Bye {0}+[Duke]", a.toString());
+
+        var b = Formatter.MESSAGE_FORMAT.create("Hello {0}! Bye {0}");
+        assertEquals("Hello {0}! Bye {0}", b.getValue());
+        assertEquals("Hello {0}! Bye {0}", b.toString());
+    }
+
+    @Test
+    void test_equals() {
+        var a = Formatter.MESSAGE_FORMAT.create("Hello {0}! Bye {0}", "Duke");
+        var b = Formatter.MESSAGE_FORMAT.create("Hello {0}! Bye {0}", "Duke");
+
+        assertEquals(a, b);
+
+        a = Formatter.MESSAGE_FORMAT.create("Hello {0}! Bye {0}", "Duke");
+        b = Formatter.MESSAGE_FORMAT.create("Hello {0}! Bye {0}", "Java");
+
+        assertNotEquals(a, b);
+    }
+
+    @Test
+    void test_addPrefix() {
+        var a = Formatter.MESSAGE_FORMAT.create("Hello {0}! Bye {0}", "Duke");
+        var b = a.addPrefix("{0} and {0}").addPrefix("They say: {0}");
+        var str = "Hello Duke! Bye Duke";
+        assertEquals(str, a.getValue());
+        assertEquals("They say: " + str + " and " + str, b.getValue());
+        assertEquals("They say: {0}+[{0} and {0}, Hello {0}! Bye {0}, Duke]", b.toString());
+
+        var c = a.addPrefix("{0} and {0}").addPrefix("They say: {0}");
+        assertEquals(c, b);
+        assertNotSame(b,  c);
+    }
+
+    @Test
+    void test_mapArgs() {
+        var a = Formatter.MESSAGE_FORMAT.create("Hello {0}! Bye {0}", "Duke");
+        var b = a.mapArgs(arg -> {
+            assertEquals("Duke", arg);
+            return "Java";
+        });
+
+        assertEquals("Hello Duke! Bye Duke", a.getValue());
+        assertEquals("Hello Java! Bye Java", b.getValue());
+    }
+
+    enum Formatter implements BiFunction<String, Object[], String> {
+        MESSAGE_FORMAT {
+            @Override
+            public String apply(String format, Object[] formatArgs) {
+                return MessageFormat.format(format, formatArgs);
+            }
+        },
+        ;
+
+        CannedFormattedString create(String format, Object ... formatArgs) {
+            return new CannedFormattedString(this, format, List.of(formatArgs));
+        }
+    }
+}
diff --git a/test/jdk/tools/jpackage/helpers-test/jdk/jpackage/test/JPackageStringBundleTest.java b/test/jdk/tools/jpackage/helpers-test/jdk/jpackage/test/JPackageStringBundleTest.java
index bf1eb2bdaec..0512d03b76a 100644
--- a/test/jdk/tools/jpackage/helpers-test/jdk/jpackage/test/JPackageStringBundleTest.java
+++ b/test/jdk/tools/jpackage/helpers-test/jdk/jpackage/test/JPackageStringBundleTest.java
@@ -24,6 +24,7 @@ package jdk.jpackage.test;
 
 import static org.junit.jupiter.api.Assertions.assertEquals;
 import static org.junit.jupiter.api.Assertions.assertFalse;
+import static org.junit.jupiter.api.Assertions.assertNotEquals;
 import static org.junit.jupiter.api.Assertions.assertThrowsExactly;
 import static org.junit.jupiter.api.Assertions.assertTrue;
 
@@ -46,6 +47,24 @@ class JPackageStringBundleTest {
         assertFalse(JPackageStringBundle.MAIN.cannedFormattedString("error.version-string-empty").getValue().isBlank());
     }
 
+    @Test
+    void test_cannedFormattedString_equals() {
+        var a = JPackageStringBundle.MAIN.cannedFormattedString("error.version-string-empty");
+        var b = JPackageStringBundle.MAIN.cannedFormattedString("error.version-string-empty");
+
+        assertEquals(a, b);
+
+        a = JPackageStringBundle.MAIN.cannedFormattedString("message.error-header", "foo");
+        b = JPackageStringBundle.MAIN.cannedFormattedString("message.error-header", "foo");
+
+        assertEquals(a, b);
+
+        a = JPackageStringBundle.MAIN.cannedFormattedString("message.error-header", "foo");
+        b = JPackageStringBundle.MAIN.cannedFormattedString("message.error-header", "bar");
+
+        assertNotEquals(a, b);
+    }
+
     @Test
     void test_cannedFormattedStringAsPattern() {
         var pred = JPackageStringBundle.MAIN.cannedFormattedStringAsPattern("error.version-string-empty", UNREACHABLE_FORMAT_ARG_MAPPER).asMatchPredicate();
diff --git a/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/CannedArgument.java b/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/CannedArgument.java
index b50d12ac4ec..346b172fa35 100644
--- a/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/CannedArgument.java
+++ b/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/CannedArgument.java
@@ -22,7 +22,37 @@
  */
 package jdk.jpackage.test;
 
+import java.nio.file.Path;
+import java.util.Objects;
+import java.util.function.Supplier;
+
 @FunctionalInterface
 public interface CannedArgument {
+
     public String getValue();
+
+    public static CannedArgument create(Supplier<Object> supplier, String label) {
+        Objects.requireNonNull(supplier);
+        Objects.requireNonNull(label);
+        return new CannedArgument() {
+
+            @Override
+            public String getValue() {
+                return supplier.get().toString();
+            }
+
+            @Override
+            public String toString( ) {
+                return label;
+            }
+        };
+    }
+
+    public static Object cannedAbsolutePath(Path v) {
+        return create(v::toAbsolutePath, String.format("AbsolutePath(%s)", v));
+    }
+
+    public static Object cannedAbsolutePath(String v) {
+        return cannedAbsolutePath(Path.of(v));
+    }
 }
diff --git a/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/CannedFormattedString.java b/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/CannedFormattedString.java
index 09f867da786..d5248ee2b17 100644
--- a/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/CannedFormattedString.java
+++ b/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/CannedFormattedString.java
@@ -22,55 +22,29 @@
  */
 package jdk.jpackage.test;
 
-import java.nio.file.Path;
 import java.util.Arrays;
 import java.util.List;
 import java.util.Objects;
 import java.util.function.BiFunction;
-import java.util.function.Supplier;
 import java.util.function.UnaryOperator;
 import java.util.stream.Stream;
 
-public record CannedFormattedString(BiFunction<String, Object[], String> formatter, String key, Object[] args) implements CannedArgument {
-
-    public static CannedArgument cannedArgument(Supplier<Object> supplier, String label) {
-        Objects.requireNonNull(supplier);
-        Objects.requireNonNull(label);
-        return new CannedArgument() {
-
-            @Override
-            public String getValue() {
-                return supplier.get().toString();
-            }
-
-            @Override
-            public String toString( ) {
-                return label;
-            }
-        };
-    }
-
-    public static Object cannedAbsolutePath(Path v) {
-        return cannedArgument(() -> v.toAbsolutePath(), String.format("AbsolutePath(%s)", v));
-    }
-
-    public static Object cannedAbsolutePath(String v) {
-        return cannedAbsolutePath(Path.of(v));
-    }
+public record CannedFormattedString(BiFunction<String, Object[], String> formatter, String key, List<Object> args) implements CannedArgument {
 
     public CannedFormattedString mapArgs(UnaryOperator<Object> mapper) {
-        return new CannedFormattedString(formatter, key, Stream.of(args).map(mapper).toArray());
+        return new CannedFormattedString(formatter, key, args.stream().map(mapper).toList());
     }
 
     public CannedFormattedString {
         Objects.requireNonNull(formatter);
         Objects.requireNonNull(key);
         Objects.requireNonNull(args);
-        List.of(args).forEach(Objects::requireNonNull);
+        args.forEach(Objects::requireNonNull);
     }
 
+    @Override
     public String getValue() {
-        return formatter.apply(key, Stream.of(args).map(arg -> {
+        return formatter.apply(key, args.stream().map(arg -> {
             if (arg instanceof CannedArgument cannedArg) {
                 return cannedArg.getValue();
             } else {
@@ -80,19 +54,29 @@ public record CannedFormattedString(BiFunction<String, Object[], String> formatt
     }
 
     public CannedFormattedString addPrefix(String prefixKey) {
-        Objects.requireNonNull(prefixKey);
-        return new CannedFormattedString((theKey, theArgs) -> {
-            var str = formatter.apply((String)theArgs[0], Arrays.copyOfRange(theArgs, 1, theArgs.length));
-            return formatter.apply(theKey, new Object[] {str});
-        }, prefixKey, Stream.concat(Stream.of(key), Stream.of(args)).toArray());
+        return new CannedFormattedString(
+                new AddPrefixFormatter(formatter), prefixKey, Stream.concat(Stream.of(key), args.stream()).toList());
     }
 
     @Override
     public String toString() {
-        if (args.length == 0) {
+        if (args.isEmpty()) {
             return String.format("%s", key);
         } else {
-            return String.format("%s+%s", key, List.of(args));
+            return String.format("%s+%s", key, args);
+        }
+    }
+
+    private record AddPrefixFormatter(BiFunction<String, Object[], String> formatter) implements BiFunction<String, Object[], String> {
+
+        AddPrefixFormatter {
+            Objects.requireNonNull(formatter);
+        }
+
+        @Override
+        public String apply(String format, Object[] formatArgs) {
+            var str = formatter.apply((String)formatArgs[0], Arrays.copyOfRange(formatArgs, 1, formatArgs.length));
+            return formatter.apply(format, new Object[] {str});
         }
     }
 }
diff --git a/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/JPackageCommand.java b/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/JPackageCommand.java
index f68ac90d284..67c0ba41e3f 100644
--- a/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/JPackageCommand.java
+++ b/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/JPackageCommand.java
@@ -966,13 +966,13 @@ public class JPackageCommand extends CommandArguments<JPackageCommand> {
     }
 
     public String getValue(CannedFormattedString str) {
-        return new CannedFormattedString(str.formatter(), str.key(), Stream.of(str.args()).map(arg -> {
+        return new CannedFormattedString(str.formatter(), str.key(), str.args().stream().map(arg -> {
             if (arg instanceof CannedArgument cannedArg) {
                 return cannedArg.value(this);
             } else {
                 return arg;
             }
-        }).toArray()).getValue();
+        }).toList()).getValue();
     }
 
     public JPackageCommand validateOut(CannedFormattedString... strings) {
diff --git a/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/JPackageStringBundle.java b/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/JPackageStringBundle.java
index cd8ffd853b7..dcf994a0e93 100644
--- a/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/JPackageStringBundle.java
+++ b/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/JPackageStringBundle.java
@@ -31,6 +31,7 @@ import java.text.MessageFormat;
 import java.util.List;
 import java.util.Objects;
 import java.util.Optional;
+import java.util.function.BiFunction;
 import java.util.function.Function;
 import java.util.regex.Pattern;
 
@@ -48,6 +49,9 @@ public enum JPackageStringBundle {
         } catch (ClassNotFoundException|NoSuchMethodException ex) {
             throw toUnchecked(ex);
         }
+        formatter = (String key, Object[] args) -> {
+            return new FormattedMessage(key, args).value();
+        };
     }
 
     /**
@@ -61,12 +65,8 @@ public enum JPackageStringBundle {
         }
     }
 
-    private String getFormattedString(String key, Object[] args) {
-        return new FormattedMessage(key, args).value();
-    }
-
     public CannedFormattedString cannedFormattedString(String key, Object ... args) {
-        return new CannedFormattedString(this::getFormattedString, key, args);
+        return new CannedFormattedString(formatter, key, List.of(args));
     }
 
     public Pattern cannedFormattedStringAsPattern(String key, Function<Object, Pattern> formatArgMapper, Object ... args) {
@@ -153,4 +153,5 @@ public enum JPackageStringBundle {
 
     private final Class<?> i18nClass;
     private final Method i18nClass_getString;
+    private final BiFunction<String, Object[], String> formatter;
 }
diff --git a/test/jdk/tools/jpackage/share/ErrorTest.java b/test/jdk/tools/jpackage/share/ErrorTest.java
index db87263884b..2797115b202 100644
--- a/test/jdk/tools/jpackage/share/ErrorTest.java
+++ b/test/jdk/tools/jpackage/share/ErrorTest.java
@@ -713,7 +713,7 @@ public final class ErrorTest {
 
    private static void testMacSignWithoutIdentityWithNewTKitState(TestSpec spec) {
         final Token keychainToken = spec.expectedMessages().stream().flatMap(cannedStr -> {
-            return Stream.of(cannedStr.args()).filter(Token.class::isInstance).map(Token.class::cast).filter(token -> {
+            return cannedStr.args().stream().filter(Token.class::isInstance).map(Token.class::cast).filter(token -> {
                 switch (token) {
                     case EMPTY_KEYCHAIN, KEYCHAIN_WITH_APP_IMAGE_CERT, KEYCHAIN_WITH_PKG_CERT -> {
                         return true;

From 8b8bb43396fe12992cd3ae1bfdff7c9c317bddbf Mon Sep 17 00:00:00 2001
From: Damon Nguyen <dnguyen@openjdk.org>
Date: Wed, 11 Mar 2026 00:22:01 +0000
Subject: [PATCH 141/655] 8379256: Update GIFlib to 6.1.1

Reviewed-by: prr, kizune
---
 src/java.desktop/share/legal/giflib.md        |   10 +-
 .../native/libsplashscreen/giflib/COPYING     |    2 +-
 .../native/libsplashscreen/giflib/dgif_lib.c  | 1875 +++++++++--------
 .../native/libsplashscreen/giflib/gif_err.c   |  156 +-
 .../native/libsplashscreen/giflib/gif_hash.h  |    7 +-
 .../native/libsplashscreen/giflib/gif_lib.h   |  102 +-
 .../libsplashscreen/giflib/gif_lib_private.h  |   48 +-
 .../native/libsplashscreen/giflib/gifalloc.c  |  590 +++---
 .../giflib/openbsd-reallocarray.c             |  105 +-
 9 files changed, 1461 insertions(+), 1434 deletions(-)

diff --git a/src/java.desktop/share/legal/giflib.md b/src/java.desktop/share/legal/giflib.md
index 5697dc7ca9a..ba2dbb00535 100644
--- a/src/java.desktop/share/legal/giflib.md
+++ b/src/java.desktop/share/legal/giflib.md
@@ -1,9 +1,9 @@
-## GIFLIB v5.2.2
+## GIFLIB v6.1.1
 
 ### GIFLIB License
 ```
 
-The GIFLIB distribution is Copyright (c) 1997  Eric S. Raymond
+= MIT LICENSE
 
 Permission is hereby granted, free of charge, to any person obtaining a copy
 of this software and associated documentation files (the "Software"), to deal
@@ -25,9 +25,15 @@ THE SOFTWARE.
 
 ---------------------------------
 The below applies to the following file(s):
+giflib/dgif_lib.c
+giflib/gifalloc.c
+giflib/gif_err.c
 giflib/openbsd-reallocarray.c
 
+Copyright (C) 1989 Gershon Elber
 Copyright (C) 2008 Otto Moerbeek <otto@drijf.net>
+Copyright (C) Eric S. Raymond <esr@thyrsus.com>
+
 SPDX-License-Identifier: MIT
 
 
diff --git a/src/java.desktop/share/native/libsplashscreen/giflib/COPYING b/src/java.desktop/share/native/libsplashscreen/giflib/COPYING
index b9c0b501260..92774a3b036 100644
--- a/src/java.desktop/share/native/libsplashscreen/giflib/COPYING
+++ b/src/java.desktop/share/native/libsplashscreen/giflib/COPYING
@@ -1,4 +1,4 @@
-The GIFLIB distribution is Copyright (c) 1997  Eric S. Raymond
+= MIT LICENSE
 
 Permission is hereby granted, free of charge, to any person obtaining a copy
 of this software and associated documentation files (the "Software"), to deal
diff --git a/src/java.desktop/share/native/libsplashscreen/giflib/dgif_lib.c b/src/java.desktop/share/native/libsplashscreen/giflib/dgif_lib.c
index 0b2860b4b50..2fa005ed20d 100644
--- a/src/java.desktop/share/native/libsplashscreen/giflib/dgif_lib.c
+++ b/src/java.desktop/share/native/libsplashscreen/giflib/dgif_lib.c
@@ -30,9 +30,9 @@ The functions here and in egif_lib.c are partitioned carefully so that
 if you only require one of read and write capability, only one of these
 two modules will be linked.  Preserve this property!
 
-SPDX-License-Identifier: MIT
-
 *****************************************************************************/
+// SPDX-License-Identifier: MIT
+// SPDX-FileCopyrightText: Copyright (C) Eric S. Raymond <esr@thyrsus.com>
 
 #include <fcntl.h>
 #include <limits.h>
@@ -55,11 +55,11 @@ SPDX-License-Identifier: MIT
 
 /* avoid extra function call in case we use fread (TVT) */
 static int InternalRead(GifFileType *gif, GifByteType *buf, int len) {
-    // fprintf(stderr, "### Read: %d\n", len);
-    return (((GifFilePrivateType *)gif->Private)->Read
-                ? ((GifFilePrivateType *)gif->Private)->Read(gif, buf, len)
-                : fread(buf, 1, len,
-                        ((GifFilePrivateType *)gif->Private)->File));
+        // fprintf(stderr, "### Read: %d\n", len);
+        return (((GifFilePrivateType *)gif->Private)->Read
+                    ? ((GifFilePrivateType *)gif->Private)->Read(gif, buf, len)
+                    : fread(buf, 1, len,
+                            ((GifFilePrivateType *)gif->Private)->File));
 }
 
 static int DGifGetWord(GifFileType *GifFile, GifWord *Word);
@@ -78,18 +78,18 @@ static int DGifBufferedInput(GifFileType *GifFile, GifByteType *Buf,
  info record.
 ******************************************************************************/
 GifFileType *DGifOpenFileName(const char *FileName, int *Error) {
-    int FileHandle;
-    GifFileType *GifFile;
+        int FileHandle;
+        GifFileType *GifFile;
 
-    if ((FileHandle = open(FileName, O_RDONLY)) == -1) {
-        if (Error != NULL) {
-            *Error = D_GIF_ERR_OPEN_FAILED;
+        if ((FileHandle = open(FileName, O_RDONLY)) == -1) {
+                if (Error != NULL) {
+                        *Error = D_GIF_ERR_OPEN_FAILED;
+                }
+                return NULL;
         }
-        return NULL;
-    }
 
-    GifFile = DGifOpenFileHandle(FileHandle, Error);
-    return GifFile;
+        GifFile = DGifOpenFileHandle(FileHandle, Error);
+        return GifFile;
 }
 
 /******************************************************************************
@@ -98,171 +98,171 @@ GifFileType *DGifOpenFileName(const char *FileName, int *Error) {
  info record.
 ******************************************************************************/
 GifFileType *DGifOpenFileHandle(int FileHandle, int *Error) {
-    char Buf[GIF_STAMP_LEN + 1];
-    GifFileType *GifFile;
-    GifFilePrivateType *Private;
-    FILE *f;
+        char Buf[GIF_STAMP_LEN + 1];
+        GifFileType *GifFile;
+        GifFilePrivateType *Private;
+        FILE *f;
 
-    GifFile = (GifFileType *)malloc(sizeof(GifFileType));
-    if (GifFile == NULL) {
-        if (Error != NULL) {
-            *Error = D_GIF_ERR_NOT_ENOUGH_MEM;
+        GifFile = (GifFileType *)malloc(sizeof(GifFileType));
+        if (GifFile == NULL) {
+                if (Error != NULL) {
+                        *Error = D_GIF_ERR_NOT_ENOUGH_MEM;
+                }
+                (void)close(FileHandle);
+                return NULL;
         }
-        (void)close(FileHandle);
-        return NULL;
-    }
 
-    /*@i1@*/ memset(GifFile, '\0', sizeof(GifFileType));
+        /*@i1@*/ memset(GifFile, '\0', sizeof(GifFileType));
 
-    /* Belt and suspenders, in case the null pointer isn't zero */
-    GifFile->SavedImages = NULL;
-    GifFile->SColorMap = NULL;
+        /* Belt and suspenders, in case the null pointer isn't zero */
+        GifFile->SavedImages = NULL;
+        GifFile->SColorMap = NULL;
 
-    Private = (GifFilePrivateType *)calloc(1, sizeof(GifFilePrivateType));
-    if (Private == NULL) {
-        if (Error != NULL) {
-            *Error = D_GIF_ERR_NOT_ENOUGH_MEM;
+        Private = (GifFilePrivateType *)calloc(1, sizeof(GifFilePrivateType));
+        if (Private == NULL) {
+                if (Error != NULL) {
+                        *Error = D_GIF_ERR_NOT_ENOUGH_MEM;
+                }
+                (void)close(FileHandle);
+                free((char *)GifFile);
+                return NULL;
         }
-        (void)close(FileHandle);
-        free((char *)GifFile);
-        return NULL;
-    }
 
-    /*@i1@*/ memset(Private, '\0', sizeof(GifFilePrivateType));
+        /*@i1@*/ memset(Private, '\0', sizeof(GifFilePrivateType));
 
 #ifdef _WIN32
-    _setmode(FileHandle, O_BINARY); /* Make sure it is in binary mode. */
+        _setmode(FileHandle, O_BINARY); /* Make sure it is in binary mode. */
 #endif                                  /* _WIN32 */
 
-    f = fdopen(FileHandle, "rb"); /* Make it into a stream: */
+        f = fdopen(FileHandle, "rb"); /* Make it into a stream: */
 
-    /*@-mustfreeonly@*/
-    GifFile->Private = (void *)Private;
-    Private->FileHandle = FileHandle;
-    Private->File = f;
-    Private->FileState = FILE_STATE_READ;
-    Private->Read = NULL;     /* don't use alternate input method (TVT) */
-    GifFile->UserData = NULL; /* TVT */
-    /*@=mustfreeonly@*/
+        /*@-mustfreeonly@*/
+        GifFile->Private = (void *)Private;
+        Private->FileHandle = FileHandle;
+        Private->File = f;
+        Private->FileState = FILE_STATE_READ;
+        Private->Read = NULL;     /* don't use alternate input method (TVT) */
+        GifFile->UserData = NULL; /* TVT */
+        /*@=mustfreeonly@*/
 
-    /* Let's see if this is a GIF file: */
-    /* coverity[check_return] */
-    if (InternalRead(GifFile, (unsigned char *)Buf, GIF_STAMP_LEN) !=
-        GIF_STAMP_LEN) {
-        if (Error != NULL) {
-            *Error = D_GIF_ERR_READ_FAILED;
+        /* Let's see if this is a GIF file: */
+        /* coverity[check_return] */
+        if (InternalRead(GifFile, (unsigned char *)Buf, GIF_STAMP_LEN) !=
+            GIF_STAMP_LEN) {
+                if (Error != NULL) {
+                        *Error = D_GIF_ERR_READ_FAILED;
+                }
+                (void)fclose(f);
+                free((char *)Private);
+                free((char *)GifFile);
+                return NULL;
         }
-        (void)fclose(f);
-        free((char *)Private);
-        free((char *)GifFile);
-        return NULL;
-    }
 
-    /* Check for GIF prefix at start of file */
-    Buf[GIF_STAMP_LEN] = 0;
-    if (strncmp(GIF_STAMP, Buf, GIF_VERSION_POS) != 0) {
-        if (Error != NULL) {
-            *Error = D_GIF_ERR_NOT_GIF_FILE;
+        /* Check for GIF prefix at start of file */
+        Buf[GIF_STAMP_LEN] = 0;
+        if (strncmp(GIF_STAMP, Buf, GIF_VERSION_POS) != 0) {
+                if (Error != NULL) {
+                        *Error = D_GIF_ERR_NOT_GIF_FILE;
+                }
+                (void)fclose(f);
+                free((char *)Private);
+                free((char *)GifFile);
+                return NULL;
         }
-        (void)fclose(f);
-        free((char *)Private);
-        free((char *)GifFile);
-        return NULL;
-    }
 
-    if (DGifGetScreenDesc(GifFile) == GIF_ERROR) {
-        (void)fclose(f);
-        free((char *)Private);
-        free((char *)GifFile);
-        return NULL;
-    }
+        if (DGifGetScreenDesc(GifFile) == GIF_ERROR) {
+                (void)fclose(f);
+                free((char *)Private);
+                free((char *)GifFile);
+                return NULL;
+        }
 
-    GifFile->Error = 0;
+        GifFile->Error = 0;
 
-    /* What version of GIF? */
-    Private->gif89 = (Buf[GIF_VERSION_POS + 1] == '9');
+        /* What version of GIF? */
+        Private->gif89 = (Buf[GIF_VERSION_POS + 1] == '9');
 
-    return GifFile;
+        return GifFile;
 }
 
 /******************************************************************************
  GifFileType constructor with user supplied input function (TVT)
 ******************************************************************************/
 GifFileType *DGifOpen(void *userData, InputFunc readFunc, int *Error) {
-    char Buf[GIF_STAMP_LEN + 1];
-    GifFileType *GifFile;
-    GifFilePrivateType *Private;
+        char Buf[GIF_STAMP_LEN + 1];
+        GifFileType *GifFile;
+        GifFilePrivateType *Private;
 
-    GifFile = (GifFileType *)malloc(sizeof(GifFileType));
-    if (GifFile == NULL) {
-        if (Error != NULL) {
-            *Error = D_GIF_ERR_NOT_ENOUGH_MEM;
+        GifFile = (GifFileType *)malloc(sizeof(GifFileType));
+        if (GifFile == NULL) {
+                if (Error != NULL) {
+                        *Error = D_GIF_ERR_NOT_ENOUGH_MEM;
+                }
+                return NULL;
         }
-        return NULL;
-    }
 
-    memset(GifFile, '\0', sizeof(GifFileType));
+        memset(GifFile, '\0', sizeof(GifFileType));
 
-    /* Belt and suspenders, in case the null pointer isn't zero */
-    GifFile->SavedImages = NULL;
-    GifFile->SColorMap = NULL;
+        /* Belt and suspenders, in case the null pointer isn't zero */
+        GifFile->SavedImages = NULL;
+        GifFile->SColorMap = NULL;
 
-    Private = (GifFilePrivateType *)calloc(1, sizeof(GifFilePrivateType));
-    if (!Private) {
-        if (Error != NULL) {
-            *Error = D_GIF_ERR_NOT_ENOUGH_MEM;
+        Private = (GifFilePrivateType *)calloc(1, sizeof(GifFilePrivateType));
+        if (!Private) {
+                if (Error != NULL) {
+                        *Error = D_GIF_ERR_NOT_ENOUGH_MEM;
+                }
+                free((char *)GifFile);
+                return NULL;
         }
-        free((char *)GifFile);
-        return NULL;
-    }
-    /*@i1@*/ memset(Private, '\0', sizeof(GifFilePrivateType));
+        /*@i1@*/ memset(Private, '\0', sizeof(GifFilePrivateType));
 
-    GifFile->Private = (void *)Private;
-    Private->FileHandle = 0;
-    Private->File = NULL;
-    Private->FileState = FILE_STATE_READ;
+        GifFile->Private = (void *)Private;
+        Private->FileHandle = 0;
+        Private->File = NULL;
+        Private->FileState = FILE_STATE_READ;
 
-    Private->Read = readFunc;     /* TVT */
-    GifFile->UserData = userData; /* TVT */
+        Private->Read = readFunc;     /* TVT */
+        GifFile->UserData = userData; /* TVT */
 
-    /* Lets see if this is a GIF file: */
-    /* coverity[check_return] */
-    if (InternalRead(GifFile, (unsigned char *)Buf, GIF_STAMP_LEN) !=
-        GIF_STAMP_LEN) {
-        if (Error != NULL) {
-            *Error = D_GIF_ERR_READ_FAILED;
+        /* Lets see if this is a GIF file: */
+        /* coverity[check_return] */
+        if (InternalRead(GifFile, (unsigned char *)Buf, GIF_STAMP_LEN) !=
+            GIF_STAMP_LEN) {
+                if (Error != NULL) {
+                        *Error = D_GIF_ERR_READ_FAILED;
+                }
+                free((char *)Private);
+                free((char *)GifFile);
+                return NULL;
         }
-        free((char *)Private);
-        free((char *)GifFile);
-        return NULL;
-    }
 
-    /* Check for GIF prefix at start of file */
-    Buf[GIF_STAMP_LEN] = '\0';
-    if (strncmp(GIF_STAMP, Buf, GIF_VERSION_POS) != 0) {
-        if (Error != NULL) {
-            *Error = D_GIF_ERR_NOT_GIF_FILE;
+        /* Check for GIF prefix at start of file */
+        Buf[GIF_STAMP_LEN] = '\0';
+        if (strncmp(GIF_STAMP, Buf, GIF_VERSION_POS) != 0) {
+                if (Error != NULL) {
+                        *Error = D_GIF_ERR_NOT_GIF_FILE;
+                }
+                free((char *)Private);
+                free((char *)GifFile);
+                return NULL;
         }
-        free((char *)Private);
-        free((char *)GifFile);
-        return NULL;
-    }
 
-    if (DGifGetScreenDesc(GifFile) == GIF_ERROR) {
-        free((char *)Private);
-        free((char *)GifFile);
-        if (Error != NULL) {
-            *Error = D_GIF_ERR_NO_SCRN_DSCR;
+        if (DGifGetScreenDesc(GifFile) == GIF_ERROR) {
+                free((char *)Private);
+                free((char *)GifFile);
+                if (Error != NULL) {
+                        *Error = D_GIF_ERR_NO_SCRN_DSCR;
+                }
+                return NULL;
         }
-        return NULL;
-    }
 
-    GifFile->Error = 0;
+        GifFile->Error = 0;
 
-    /* What version of GIF? */
-    Private->gif89 = (Buf[GIF_VERSION_POS + 1] == '9');
+        /* What version of GIF? */
+        Private->gif89 = (Buf[GIF_VERSION_POS + 1] == '9');
 
-    return GifFile;
+        return GifFile;
 }
 
 /******************************************************************************
@@ -270,180 +270,180 @@ GifFileType *DGifOpen(void *userData, InputFunc readFunc, int *Error) {
  this routine is called automatically from DGif file open routines.
 ******************************************************************************/
 int DGifGetScreenDesc(GifFileType *GifFile) {
-    int BitsPerPixel;
-    bool SortFlag;
-    GifByteType Buf[3];
-    GifFilePrivateType *Private = (GifFilePrivateType *)GifFile->Private;
+        int BitsPerPixel;
+        bool SortFlag;
+        GifByteType Buf[3];
+        GifFilePrivateType *Private = (GifFilePrivateType *)GifFile->Private;
 
-    if (!IS_READABLE(Private)) {
-        /* This file was NOT open for reading: */
-        GifFile->Error = D_GIF_ERR_NOT_READABLE;
-        return GIF_ERROR;
-    }
-
-    /* Put the screen descriptor into the file: */
-    if (DGifGetWord(GifFile, &GifFile->SWidth) == GIF_ERROR ||
-        DGifGetWord(GifFile, &GifFile->SHeight) == GIF_ERROR) {
-        return GIF_ERROR;
-    }
-
-    if (InternalRead(GifFile, Buf, 3) != 3) {
-        GifFile->Error = D_GIF_ERR_READ_FAILED;
-        GifFreeMapObject(GifFile->SColorMap);
-        GifFile->SColorMap = NULL;
-        return GIF_ERROR;
-    }
-    GifFile->SColorResolution = (((Buf[0] & 0x70) + 1) >> 4) + 1;
-    SortFlag = (Buf[0] & 0x08) != 0;
-    BitsPerPixel = (Buf[0] & 0x07) + 1;
-    GifFile->SBackGroundColor = Buf[1];
-    GifFile->AspectByte = Buf[2];
-    if (Buf[0] & 0x80) { /* Do we have global color map? */
-        int i;
-
-        GifFile->SColorMap = GifMakeMapObject(1 << BitsPerPixel, NULL);
-        if (GifFile->SColorMap == NULL) {
-            GifFile->Error = D_GIF_ERR_NOT_ENOUGH_MEM;
-            return GIF_ERROR;
+        if (!IS_READABLE(Private)) {
+                /* This file was NOT open for reading: */
+                GifFile->Error = D_GIF_ERR_NOT_READABLE;
+                return GIF_ERROR;
         }
 
-        /* Get the global color map: */
-        GifFile->SColorMap->SortFlag = SortFlag;
-        for (i = 0; i < GifFile->SColorMap->ColorCount; i++) {
-            /* coverity[check_return] */
-            if (InternalRead(GifFile, Buf, 3) != 3) {
+        /* Put the screen descriptor into the file: */
+        if (DGifGetWord(GifFile, &GifFile->SWidth) == GIF_ERROR ||
+            DGifGetWord(GifFile, &GifFile->SHeight) == GIF_ERROR) {
+                return GIF_ERROR;
+        }
+
+        if (InternalRead(GifFile, Buf, 3) != 3) {
+                GifFile->Error = D_GIF_ERR_READ_FAILED;
                 GifFreeMapObject(GifFile->SColorMap);
                 GifFile->SColorMap = NULL;
-                GifFile->Error = D_GIF_ERR_READ_FAILED;
                 return GIF_ERROR;
-            }
-            GifFile->SColorMap->Colors[i].Red = Buf[0];
-            GifFile->SColorMap->Colors[i].Green = Buf[1];
-            GifFile->SColorMap->Colors[i].Blue = Buf[2];
         }
-    } else {
-        GifFile->SColorMap = NULL;
-    }
+        GifFile->SColorResolution = (((Buf[0] & 0x70) + 1) >> 4) + 1;
+        SortFlag = (Buf[0] & 0x08) != 0;
+        BitsPerPixel = (Buf[0] & 0x07) + 1;
+        GifFile->SBackGroundColor = Buf[1];
+        GifFile->AspectByte = Buf[2];
+        if (Buf[0] & 0x80) { /* Do we have global color map? */
+                int i;
 
-    /*
-     * No check here for whether the background color is in range for the
-     * screen color map.  Possibly there should be.
-     */
+                GifFile->SColorMap = GifMakeMapObject(1 << BitsPerPixel, NULL);
+                if (GifFile->SColorMap == NULL) {
+                        GifFile->Error = D_GIF_ERR_NOT_ENOUGH_MEM;
+                        return GIF_ERROR;
+                }
 
-    return GIF_OK;
+                /* Get the global color map: */
+                GifFile->SColorMap->SortFlag = SortFlag;
+                for (i = 0; i < GifFile->SColorMap->ColorCount; i++) {
+                        /* coverity[check_return] */
+                        if (InternalRead(GifFile, Buf, 3) != 3) {
+                                GifFreeMapObject(GifFile->SColorMap);
+                                GifFile->SColorMap = NULL;
+                                GifFile->Error = D_GIF_ERR_READ_FAILED;
+                                return GIF_ERROR;
+                        }
+                        GifFile->SColorMap->Colors[i].Red = Buf[0];
+                        GifFile->SColorMap->Colors[i].Green = Buf[1];
+                        GifFile->SColorMap->Colors[i].Blue = Buf[2];
+                }
+        } else {
+                GifFile->SColorMap = NULL;
+        }
+
+        /*
+         * No check here for whether the background color is in range for the
+         * screen color map.  Possibly there should be.
+         */
+
+        return GIF_OK;
 }
 
 const char *DGifGetGifVersion(GifFileType *GifFile) {
-    GifFilePrivateType *Private = (GifFilePrivateType *)GifFile->Private;
+        GifFilePrivateType *Private = (GifFilePrivateType *)GifFile->Private;
 
-    if (Private->gif89) {
-        return GIF89_STAMP;
-    } else {
-        return GIF87_STAMP;
-    }
+        if (Private->gif89) {
+                return GIF89_STAMP;
+        } else {
+                return GIF87_STAMP;
+        }
 }
 
 /******************************************************************************
  This routine should be called before any attempt to read an image.
 ******************************************************************************/
 int DGifGetRecordType(GifFileType *GifFile, GifRecordType *Type) {
-    GifByteType Buf;
-    GifFilePrivateType *Private = (GifFilePrivateType *)GifFile->Private;
+        GifByteType Buf;
+        GifFilePrivateType *Private = (GifFilePrivateType *)GifFile->Private;
 
-    if (!IS_READABLE(Private)) {
-        /* This file was NOT open for reading: */
-        GifFile->Error = D_GIF_ERR_NOT_READABLE;
-        return GIF_ERROR;
-    }
+        if (!IS_READABLE(Private)) {
+                /* This file was NOT open for reading: */
+                GifFile->Error = D_GIF_ERR_NOT_READABLE;
+                return GIF_ERROR;
+        }
 
-    /* coverity[check_return] */
-    if (InternalRead(GifFile, &Buf, 1) != 1) {
-        GifFile->Error = D_GIF_ERR_READ_FAILED;
-        return GIF_ERROR;
-    }
+        /* coverity[check_return] */
+        if (InternalRead(GifFile, &Buf, 1) != 1) {
+                GifFile->Error = D_GIF_ERR_READ_FAILED;
+                return GIF_ERROR;
+        }
 
-    // fprintf(stderr, "### DGifGetRecordType: %02x\n", Buf);
-    switch (Buf) {
-    case DESCRIPTOR_INTRODUCER:
-        *Type = IMAGE_DESC_RECORD_TYPE;
-        break;
-    case EXTENSION_INTRODUCER:
-        *Type = EXTENSION_RECORD_TYPE;
-        break;
-    case TERMINATOR_INTRODUCER:
-        *Type = TERMINATE_RECORD_TYPE;
-        break;
-    default:
-        *Type = UNDEFINED_RECORD_TYPE;
-        GifFile->Error = D_GIF_ERR_WRONG_RECORD;
-        return GIF_ERROR;
-    }
+        // fprintf(stderr, "### DGifGetRecordType: %02x\n", Buf);
+        switch (Buf) {
+        case DESCRIPTOR_INTRODUCER:
+                *Type = IMAGE_DESC_RECORD_TYPE;
+                break;
+        case EXTENSION_INTRODUCER:
+                *Type = EXTENSION_RECORD_TYPE;
+                break;
+        case TERMINATOR_INTRODUCER:
+                *Type = TERMINATE_RECORD_TYPE;
+                break;
+        default:
+                *Type = UNDEFINED_RECORD_TYPE;
+                GifFile->Error = D_GIF_ERR_WRONG_RECORD;
+                return GIF_ERROR;
+        }
 
-    return GIF_OK;
+        return GIF_OK;
 }
 
 int DGifGetImageHeader(GifFileType *GifFile) {
-    unsigned int BitsPerPixel;
-    GifByteType Buf[3];
-    GifFilePrivateType *Private = (GifFilePrivateType *)GifFile->Private;
+        unsigned int BitsPerPixel;
+        GifByteType Buf[3];
+        GifFilePrivateType *Private = (GifFilePrivateType *)GifFile->Private;
 
-    if (!IS_READABLE(Private)) {
-        /* This file was NOT open for reading: */
-        GifFile->Error = D_GIF_ERR_NOT_READABLE;
-        return GIF_ERROR;
-    }
-
-    if (DGifGetWord(GifFile, &GifFile->Image.Left) == GIF_ERROR ||
-        DGifGetWord(GifFile, &GifFile->Image.Top) == GIF_ERROR ||
-        DGifGetWord(GifFile, &GifFile->Image.Width) == GIF_ERROR ||
-        DGifGetWord(GifFile, &GifFile->Image.Height) == GIF_ERROR) {
-        return GIF_ERROR;
-    }
-    if (InternalRead(GifFile, Buf, 1) != 1) {
-        GifFile->Error = D_GIF_ERR_READ_FAILED;
-        GifFreeMapObject(GifFile->Image.ColorMap);
-        GifFile->Image.ColorMap = NULL;
-        return GIF_ERROR;
-    }
-    BitsPerPixel = (Buf[0] & 0x07) + 1;
-    GifFile->Image.Interlace = (Buf[0] & 0x40) ? true : false;
-
-    /* Setup the colormap */
-    if (GifFile->Image.ColorMap) {
-        GifFreeMapObject(GifFile->Image.ColorMap);
-        GifFile->Image.ColorMap = NULL;
-    }
-    /* Does this image have local color map? */
-    if (Buf[0] & 0x80) {
-        unsigned int i;
-
-        GifFile->Image.ColorMap =
-            GifMakeMapObject(1 << BitsPerPixel, NULL);
-        if (GifFile->Image.ColorMap == NULL) {
-            GifFile->Error = D_GIF_ERR_NOT_ENOUGH_MEM;
-            return GIF_ERROR;
+        if (!IS_READABLE(Private)) {
+                /* This file was NOT open for reading: */
+                GifFile->Error = D_GIF_ERR_NOT_READABLE;
+                return GIF_ERROR;
         }
 
-        /* Get the image local color map: */
-        for (i = 0; i < GifFile->Image.ColorMap->ColorCount; i++) {
-            /* coverity[check_return] */
-            if (InternalRead(GifFile, Buf, 3) != 3) {
-                GifFreeMapObject(GifFile->Image.ColorMap);
+        if (DGifGetWord(GifFile, &GifFile->Image.Left) == GIF_ERROR ||
+            DGifGetWord(GifFile, &GifFile->Image.Top) == GIF_ERROR ||
+            DGifGetWord(GifFile, &GifFile->Image.Width) == GIF_ERROR ||
+            DGifGetWord(GifFile, &GifFile->Image.Height) == GIF_ERROR) {
+                return GIF_ERROR;
+        }
+        if (InternalRead(GifFile, Buf, 1) != 1) {
                 GifFile->Error = D_GIF_ERR_READ_FAILED;
+                GifFreeMapObject(GifFile->Image.ColorMap);
                 GifFile->Image.ColorMap = NULL;
                 return GIF_ERROR;
-            }
-            GifFile->Image.ColorMap->Colors[i].Red = Buf[0];
-            GifFile->Image.ColorMap->Colors[i].Green = Buf[1];
-            GifFile->Image.ColorMap->Colors[i].Blue = Buf[2];
         }
-    }
+        BitsPerPixel = (Buf[0] & 0x07) + 1;
+        GifFile->Image.Interlace = (Buf[0] & 0x40) ? true : false;
 
-    Private->PixelCount =
-        (long)GifFile->Image.Width * (long)GifFile->Image.Height;
+        /* Setup the colormap */
+        if (GifFile->Image.ColorMap) {
+                GifFreeMapObject(GifFile->Image.ColorMap);
+                GifFile->Image.ColorMap = NULL;
+        }
+        /* Does this image have local color map? */
+        if (Buf[0] & 0x80) {
+                unsigned int i;
 
-    /* Reset decompress algorithm parameters. */
-    return DGifSetupDecompress(GifFile);
+                GifFile->Image.ColorMap =
+                    GifMakeMapObject(1 << BitsPerPixel, NULL);
+                if (GifFile->Image.ColorMap == NULL) {
+                        GifFile->Error = D_GIF_ERR_NOT_ENOUGH_MEM;
+                        return GIF_ERROR;
+                }
+
+                /* Get the image local color map: */
+                for (i = 0; i < GifFile->Image.ColorMap->ColorCount; i++) {
+                        /* coverity[check_return] */
+                        if (InternalRead(GifFile, Buf, 3) != 3) {
+                                GifFreeMapObject(GifFile->Image.ColorMap);
+                                GifFile->Error = D_GIF_ERR_READ_FAILED;
+                                GifFile->Image.ColorMap = NULL;
+                                return GIF_ERROR;
+                        }
+                        GifFile->Image.ColorMap->Colors[i].Red = Buf[0];
+                        GifFile->Image.ColorMap->Colors[i].Green = Buf[1];
+                        GifFile->Image.ColorMap->Colors[i].Blue = Buf[2];
+                }
+        }
+
+        Private->PixelCount =
+            (long)GifFile->Image.Width * (long)GifFile->Image.Height;
+
+        /* Reset decompress algorithm parameters. */
+        return DGifSetupDecompress(GifFile);
 }
 
 /******************************************************************************
@@ -451,133 +451,135 @@ int DGifGetImageHeader(GifFileType *GifFile) {
  Note it is assumed the Image desc. header has been read.
 ******************************************************************************/
 int DGifGetImageDesc(GifFileType *GifFile) {
-    GifFilePrivateType *Private = (GifFilePrivateType *)GifFile->Private;
-    SavedImage *sp;
+        GifFilePrivateType *Private = (GifFilePrivateType *)GifFile->Private;
+        SavedImage *sp;
 
-    if (!IS_READABLE(Private)) {
-        /* This file was NOT open for reading: */
-        GifFile->Error = D_GIF_ERR_NOT_READABLE;
-        return GIF_ERROR;
-    }
-
-    if (DGifGetImageHeader(GifFile) == GIF_ERROR) {
-        return GIF_ERROR;
-    }
-
-    if (GifFile->SavedImages) {
-        SavedImage *new_saved_images = (SavedImage *)reallocarray(
-            GifFile->SavedImages, (GifFile->ImageCount + 1),
-            sizeof(SavedImage));
-        if (new_saved_images == NULL) {
-            GifFile->Error = D_GIF_ERR_NOT_ENOUGH_MEM;
-            return GIF_ERROR;
+        if (!IS_READABLE(Private)) {
+                /* This file was NOT open for reading: */
+                GifFile->Error = D_GIF_ERR_NOT_READABLE;
+                return GIF_ERROR;
         }
-        GifFile->SavedImages = new_saved_images;
-    } else {
-        if ((GifFile->SavedImages =
-                 (SavedImage *)malloc(sizeof(SavedImage))) == NULL) {
-            GifFile->Error = D_GIF_ERR_NOT_ENOUGH_MEM;
-            return GIF_ERROR;
+
+        if (DGifGetImageHeader(GifFile) == GIF_ERROR) {
+                return GIF_ERROR;
         }
-    }
 
-    sp = &GifFile->SavedImages[GifFile->ImageCount];
-    memcpy(&sp->ImageDesc, &GifFile->Image, sizeof(GifImageDesc));
-    if (GifFile->Image.ColorMap != NULL) {
-        sp->ImageDesc.ColorMap =
-            GifMakeMapObject(GifFile->Image.ColorMap->ColorCount,
-                             GifFile->Image.ColorMap->Colors);
-        if (sp->ImageDesc.ColorMap == NULL) {
-            GifFile->Error = D_GIF_ERR_NOT_ENOUGH_MEM;
-            return GIF_ERROR;
+        if (GifFile->SavedImages) {
+                SavedImage *new_saved_images = (SavedImage *)reallocarray(
+                    GifFile->SavedImages, (GifFile->ImageCount + 1),
+                    sizeof(SavedImage));
+                if (new_saved_images == NULL) {
+                        GifFile->Error = D_GIF_ERR_NOT_ENOUGH_MEM;
+                        return GIF_ERROR;
+                }
+                GifFile->SavedImages = new_saved_images;
+        } else {
+                if ((GifFile->SavedImages =
+                         (SavedImage *)malloc(sizeof(SavedImage))) == NULL) {
+                        GifFile->Error = D_GIF_ERR_NOT_ENOUGH_MEM;
+                        return GIF_ERROR;
+                }
         }
-    }
-    sp->RasterBits = (unsigned char *)NULL;
-    sp->ExtensionBlockCount = 0;
-    sp->ExtensionBlocks = (ExtensionBlock *)NULL;
 
-    GifFile->ImageCount++;
+        sp = &GifFile->SavedImages[GifFile->ImageCount];
+        memcpy(&sp->ImageDesc, &GifFile->Image, sizeof(GifImageDesc));
+        if (GifFile->Image.ColorMap != NULL) {
+                sp->ImageDesc.ColorMap =
+                    GifMakeMapObject(GifFile->Image.ColorMap->ColorCount,
+                                     GifFile->Image.ColorMap->Colors);
+                if (sp->ImageDesc.ColorMap == NULL) {
+                        GifFile->Error = D_GIF_ERR_NOT_ENOUGH_MEM;
+                        return GIF_ERROR;
+                }
+        }
+        sp->RasterBits = (unsigned char *)NULL;
+        sp->ExtensionBlockCount = 0;
+        sp->ExtensionBlocks = (ExtensionBlock *)NULL;
 
-    return GIF_OK;
+        GifFile->ImageCount++;
+
+        return GIF_OK;
 }
 
 /******************************************************************************
  Get one full scanned line (Line) of length LineLen from GIF file.
 ******************************************************************************/
 int DGifGetLine(GifFileType *GifFile, GifPixelType *Line, int LineLen) {
-    GifByteType *Dummy;
-    GifFilePrivateType *Private = (GifFilePrivateType *)GifFile->Private;
+        GifByteType *Dummy;
+        GifFilePrivateType *Private = (GifFilePrivateType *)GifFile->Private;
 
-    if (!IS_READABLE(Private)) {
-        /* This file was NOT open for reading: */
-        GifFile->Error = D_GIF_ERR_NOT_READABLE;
-        return GIF_ERROR;
-    }
-
-    if (!LineLen) {
-        LineLen = GifFile->Image.Width;
-    }
-
-    if ((Private->PixelCount -= LineLen) > 0xffff0000UL) {
-        GifFile->Error = D_GIF_ERR_DATA_TOO_BIG;
-        return GIF_ERROR;
-    }
-
-    if (DGifDecompressLine(GifFile, Line, LineLen) == GIF_OK) {
-        if (Private->PixelCount == 0) {
-            /* We probably won't be called any more, so let's clean
-             * up everything before we return: need to flush out all
-             * the rest of image until an empty block (size 0)
-             * detected. We use GetCodeNext.
-             */
-            do {
-                if (DGifGetCodeNext(GifFile, &Dummy) ==
-                    GIF_ERROR) {
-                    return GIF_ERROR;
-                }
-            } while (Dummy != NULL);
+        if (!IS_READABLE(Private)) {
+                /* This file was NOT open for reading: */
+                GifFile->Error = D_GIF_ERR_NOT_READABLE;
+                return GIF_ERROR;
+        }
+
+        if (!LineLen) {
+                LineLen = GifFile->Image.Width;
+        }
+
+        if (LineLen < 0 || Private->PixelCount < (unsigned long)LineLen) {
+                GifFile->Error = D_GIF_ERR_DATA_TOO_BIG;
+                return GIF_ERROR;
+        }
+        Private->PixelCount -= LineLen;
+
+        if (DGifDecompressLine(GifFile, Line, LineLen) == GIF_OK) {
+                if (Private->PixelCount == 0) {
+                        /* We probably won't be called any more, so let's clean
+                         * up everything before we return: need to flush out all
+                         * the rest of image until an empty block (size 0)
+                         * detected. We use GetCodeNext.
+                         */
+                        do {
+                                if (DGifGetCodeNext(GifFile, &Dummy) ==
+                                    GIF_ERROR) {
+                                        return GIF_ERROR;
+                                }
+                        } while (Dummy != NULL);
+                }
+                return GIF_OK;
+        } else {
+                return GIF_ERROR;
         }
-        return GIF_OK;
-    } else {
-        return GIF_ERROR;
-    }
 }
 
 /******************************************************************************
  Put one pixel (Pixel) into GIF file.
 ******************************************************************************/
 int DGifGetPixel(GifFileType *GifFile, GifPixelType Pixel) {
-    GifByteType *Dummy;
-    GifFilePrivateType *Private = (GifFilePrivateType *)GifFile->Private;
+        GifByteType *Dummy;
+        GifFilePrivateType *Private = (GifFilePrivateType *)GifFile->Private;
 
-    if (!IS_READABLE(Private)) {
-        /* This file was NOT open for reading: */
-        GifFile->Error = D_GIF_ERR_NOT_READABLE;
-        return GIF_ERROR;
-    }
-    if (--Private->PixelCount > 0xffff0000UL) {
-        GifFile->Error = D_GIF_ERR_DATA_TOO_BIG;
-        return GIF_ERROR;
-    }
-
-    if (DGifDecompressLine(GifFile, &Pixel, 1) == GIF_OK) {
-        if (Private->PixelCount == 0) {
-            /* We probably won't be called any more, so let's clean
-             * up everything before we return: need to flush out all
-             * the rest of image until an empty block (size 0)
-             * detected. We use GetCodeNext.
-             */
-            do {
-                if (DGifGetCodeNext(GifFile, &Dummy) ==
-                    GIF_ERROR) {
-                    return GIF_ERROR;
-                }
-            } while (Dummy != NULL);
+        if (!IS_READABLE(Private)) {
+                /* This file was NOT open for reading: */
+                GifFile->Error = D_GIF_ERR_NOT_READABLE;
+                return GIF_ERROR;
+        }
+        if (Private->PixelCount == 0) {
+                GifFile->Error = D_GIF_ERR_DATA_TOO_BIG;
+                return GIF_ERROR;
+        }
+        Private->PixelCount --;
+
+        if (DGifDecompressLine(GifFile, &Pixel, 1) == GIF_OK) {
+                if (Private->PixelCount == 0) {
+                        /* We probably won't be called any more, so let's clean
+                         * up everything before we return: need to flush out all
+                         * the rest of image until an empty block (size 0)
+                         * detected. We use GetCodeNext.
+                         */
+                        do {
+                                if (DGifGetCodeNext(GifFile, &Dummy) ==
+                                    GIF_ERROR) {
+                                        return GIF_ERROR;
+                                }
+                        } while (Dummy != NULL);
+                }
+                return GIF_OK;
+        } else {
+                return GIF_ERROR;
         }
-        return GIF_OK;
-    } else {
-        return GIF_ERROR;
-    }
 }
 
 /******************************************************************************
@@ -589,26 +591,26 @@ int DGifGetPixel(GifFileType *GifFile, GifPixelType Pixel) {
 ******************************************************************************/
 int DGifGetExtension(GifFileType *GifFile, int *ExtCode,
                      GifByteType **Extension) {
-    GifByteType Buf;
-    GifFilePrivateType *Private = (GifFilePrivateType *)GifFile->Private;
+        GifByteType Buf;
+        GifFilePrivateType *Private = (GifFilePrivateType *)GifFile->Private;
 
-    // fprintf(stderr, "### -> DGifGetExtension:\n");
-    if (!IS_READABLE(Private)) {
-        /* This file was NOT open for reading: */
-        GifFile->Error = D_GIF_ERR_NOT_READABLE;
-        return GIF_ERROR;
-    }
+        // fprintf(stderr, "### -> DGifGetExtension:\n");
+        if (!IS_READABLE(Private)) {
+                /* This file was NOT open for reading: */
+                GifFile->Error = D_GIF_ERR_NOT_READABLE;
+                return GIF_ERROR;
+        }
 
-    /* coverity[check_return] */
-    if (InternalRead(GifFile, &Buf, 1) != 1) {
-        GifFile->Error = D_GIF_ERR_READ_FAILED;
-        return GIF_ERROR;
-    }
-    *ExtCode = Buf;
-    // fprintf(stderr, "### <- DGifGetExtension: %02x, about to call
-    // next\n", Buf);
+        /* coverity[check_return] */
+        if (InternalRead(GifFile, &Buf, 1) != 1) {
+                GifFile->Error = D_GIF_ERR_READ_FAILED;
+                return GIF_ERROR;
+        }
+        *ExtCode = Buf;
+        // fprintf(stderr, "### <- DGifGetExtension: %02x, about to call
+        // next\n", Buf);
 
-    return DGifGetExtensionNext(GifFile, Extension);
+        return DGifGetExtensionNext(GifFile, Extension);
 }
 
 /******************************************************************************
@@ -617,31 +619,31 @@ int DGifGetExtension(GifFileType *GifFile, int *ExtCode,
  The Extension should NOT be freed by the user (not dynamically allocated).
 ******************************************************************************/
 int DGifGetExtensionNext(GifFileType *GifFile, GifByteType **Extension) {
-    GifByteType Buf;
-    GifFilePrivateType *Private = (GifFilePrivateType *)GifFile->Private;
+        GifByteType Buf;
+        GifFilePrivateType *Private = (GifFilePrivateType *)GifFile->Private;
 
-    // fprintf(stderr, "### -> DGifGetExtensionNext\n");
-    if (InternalRead(GifFile, &Buf, 1) != 1) {
-        GifFile->Error = D_GIF_ERR_READ_FAILED;
-        return GIF_ERROR;
-    }
-    // fprintf(stderr, "### DGifGetExtensionNext sees %d\n", Buf);
-
-    if (Buf > 0) {
-        *Extension = Private->Buf; /* Use private unused buffer. */
-        (*Extension)[0] =
-            Buf; /* Pascal strings notation (pos. 0 is len.). */
-                 /* coverity[tainted_data,check_return] */
-        if (InternalRead(GifFile, &((*Extension)[1]), Buf) != Buf) {
-            GifFile->Error = D_GIF_ERR_READ_FAILED;
-            return GIF_ERROR;
+        // fprintf(stderr, "### -> DGifGetExtensionNext\n");
+        if (InternalRead(GifFile, &Buf, 1) != 1) {
+                GifFile->Error = D_GIF_ERR_READ_FAILED;
+                return GIF_ERROR;
         }
-    } else {
-        *Extension = NULL;
-    }
-    // fprintf(stderr, "### <- DGifGetExtensionNext: %p\n", Extension);
+        // fprintf(stderr, "### DGifGetExtensionNext sees %d\n", Buf);
 
-    return GIF_OK;
+        if (Buf > 0) {
+                *Extension = Private->Buf; /* Use private unused buffer. */
+                (*Extension)[0] =
+                    Buf; /* Pascal strings notation (pos. 0 is len.). */
+                         /* coverity[tainted_data,check_return] */
+                if (InternalRead(GifFile, &((*Extension)[1]), Buf) != Buf) {
+                        GifFile->Error = D_GIF_ERR_READ_FAILED;
+                        return GIF_ERROR;
+                }
+        } else {
+                *Extension = NULL;
+        }
+        // fprintf(stderr, "### <- DGifGetExtensionNext: %p\n", Extension);
+
+        return GIF_OK;
 }
 
 /******************************************************************************
@@ -651,21 +653,21 @@ int DGifGetExtensionNext(GifFileType *GifFile, GifByteType **Extension) {
 int DGifExtensionToGCB(const size_t GifExtensionLength,
                        const GifByteType *GifExtension,
                        GraphicsControlBlock *GCB) {
-    if (GifExtensionLength != 4) {
-        return GIF_ERROR;
-    }
+        if (GifExtensionLength != 4) {
+                return GIF_ERROR;
+        }
 
-    GCB->DisposalMode = (GifExtension[0] >> 2) & 0x07;
-    GCB->UserInputFlag = (GifExtension[0] & 0x02) != 0;
-    GCB->DelayTime =
-        UNSIGNED_LITTLE_ENDIAN(GifExtension[1], GifExtension[2]);
-    if (GifExtension[0] & 0x01) {
-        GCB->TransparentColor = (int)GifExtension[3];
-    } else {
-        GCB->TransparentColor = NO_TRANSPARENT_COLOR;
-    }
+        GCB->DisposalMode = (GifExtension[0] >> 2) & 0x07;
+        GCB->UserInputFlag = (GifExtension[0] & 0x02) != 0;
+        GCB->DelayTime =
+            UNSIGNED_LITTLE_ENDIAN(GifExtension[1], GifExtension[2]);
+        if (GifExtension[0] & 0x01) {
+                GCB->TransparentColor = (int)GifExtension[3];
+        } else {
+                GCB->TransparentColor = NO_TRANSPARENT_COLOR;
+        }
 
-    return GIF_OK;
+        return GIF_OK;
 }
 
 /******************************************************************************
@@ -674,101 +676,101 @@ int DGifExtensionToGCB(const size_t GifExtensionLength,
 
 int DGifSavedExtensionToGCB(GifFileType *GifFile, int ImageIndex,
                             GraphicsControlBlock *GCB) {
-    int i;
+        int i;
 
-    if (ImageIndex < 0 || ImageIndex > GifFile->ImageCount - 1) {
-        return GIF_ERROR;
-    }
-
-    GCB->DisposalMode = DISPOSAL_UNSPECIFIED;
-    GCB->UserInputFlag = false;
-    GCB->DelayTime = 0;
-    GCB->TransparentColor = NO_TRANSPARENT_COLOR;
-
-    for (i = 0; i < GifFile->SavedImages[ImageIndex].ExtensionBlockCount;
-         i++) {
-        ExtensionBlock *ep =
-            &GifFile->SavedImages[ImageIndex].ExtensionBlocks[i];
-        if (ep->Function == GRAPHICS_EXT_FUNC_CODE) {
-            return DGifExtensionToGCB(ep->ByteCount, ep->Bytes,
-                                      GCB);
+        if (ImageIndex < 0 || ImageIndex > GifFile->ImageCount - 1) {
+                return GIF_ERROR;
         }
-    }
 
-    return GIF_ERROR;
+        GCB->DisposalMode = DISPOSAL_UNSPECIFIED;
+        GCB->UserInputFlag = false;
+        GCB->DelayTime = 0;
+        GCB->TransparentColor = NO_TRANSPARENT_COLOR;
+
+        for (i = 0; i < GifFile->SavedImages[ImageIndex].ExtensionBlockCount;
+             i++) {
+                ExtensionBlock *ep =
+                    &GifFile->SavedImages[ImageIndex].ExtensionBlocks[i];
+                if (ep->Function == GRAPHICS_EXT_FUNC_CODE) {
+                        return DGifExtensionToGCB(ep->ByteCount, ep->Bytes,
+                                                  GCB);
+                }
+        }
+
+        return GIF_ERROR;
 }
 
 /******************************************************************************
  This routine should be called last, to close the GIF file.
 ******************************************************************************/
 int DGifCloseFile(GifFileType *GifFile, int *ErrorCode) {
-    GifFilePrivateType *Private;
+        GifFilePrivateType *Private;
 
-    if (GifFile == NULL || GifFile->Private == NULL) {
-        return GIF_ERROR;
-    }
-
-    if (GifFile->Image.ColorMap) {
-        GifFreeMapObject(GifFile->Image.ColorMap);
-        GifFile->Image.ColorMap = NULL;
-    }
-
-    if (GifFile->SColorMap) {
-        GifFreeMapObject(GifFile->SColorMap);
-        GifFile->SColorMap = NULL;
-    }
-
-    if (GifFile->SavedImages) {
-        GifFreeSavedImages(GifFile);
-        GifFile->SavedImages = NULL;
-    }
-
-    GifFreeExtensions(&GifFile->ExtensionBlockCount,
-                      &GifFile->ExtensionBlocks);
-
-    Private = (GifFilePrivateType *)GifFile->Private;
-
-    if (!IS_READABLE(Private)) {
-        /* This file was NOT open for reading: */
-        if (ErrorCode != NULL) {
-            *ErrorCode = D_GIF_ERR_NOT_READABLE;
+        if (GifFile == NULL || GifFile->Private == NULL) {
+                return GIF_ERROR;
         }
+
+        if (GifFile->Image.ColorMap) {
+                GifFreeMapObject(GifFile->Image.ColorMap);
+                GifFile->Image.ColorMap = NULL;
+        }
+
+        if (GifFile->SColorMap) {
+                GifFreeMapObject(GifFile->SColorMap);
+                GifFile->SColorMap = NULL;
+        }
+
+        if (GifFile->SavedImages) {
+                GifFreeSavedImages(GifFile);
+                GifFile->SavedImages = NULL;
+        }
+
+        GifFreeExtensions(&GifFile->ExtensionBlockCount,
+                          &GifFile->ExtensionBlocks);
+
+        Private = (GifFilePrivateType *)GifFile->Private;
+
+        if (!IS_READABLE(Private)) {
+                /* This file was NOT open for reading: */
+                if (ErrorCode != NULL) {
+                        *ErrorCode = D_GIF_ERR_NOT_READABLE;
+                }
+                free((char *)GifFile->Private);
+                free(GifFile);
+                return GIF_ERROR;
+        }
+
+        if (Private->File && (fclose(Private->File) != 0)) {
+                if (ErrorCode != NULL) {
+                        *ErrorCode = D_GIF_ERR_CLOSE_FAILED;
+                }
+                free((char *)GifFile->Private);
+                free(GifFile);
+                return GIF_ERROR;
+        }
+
         free((char *)GifFile->Private);
         free(GifFile);
-        return GIF_ERROR;
-    }
-
-    if (Private->File && (fclose(Private->File) != 0)) {
         if (ErrorCode != NULL) {
-            *ErrorCode = D_GIF_ERR_CLOSE_FAILED;
+                *ErrorCode = D_GIF_SUCCEEDED;
         }
-        free((char *)GifFile->Private);
-        free(GifFile);
-        return GIF_ERROR;
-    }
-
-    free((char *)GifFile->Private);
-    free(GifFile);
-    if (ErrorCode != NULL) {
-        *ErrorCode = D_GIF_SUCCEEDED;
-    }
-    return GIF_OK;
+        return GIF_OK;
 }
 
 /******************************************************************************
  Get 2 bytes (word) from the given file:
 ******************************************************************************/
 static int DGifGetWord(GifFileType *GifFile, GifWord *Word) {
-    unsigned char c[2];
+        unsigned char c[2];
 
-    /* coverity[check_return] */
-    if (InternalRead(GifFile, c, 2) != 2) {
-        GifFile->Error = D_GIF_ERR_READ_FAILED;
-        return GIF_ERROR;
-    }
+        /* coverity[check_return] */
+        if (InternalRead(GifFile, c, 2) != 2) {
+                GifFile->Error = D_GIF_ERR_READ_FAILED;
+                return GIF_ERROR;
+        }
 
-    *Word = (GifWord)UNSIGNED_LITTLE_ENDIAN(c[0], c[1]);
-    return GIF_OK;
+        *Word = (GifWord)UNSIGNED_LITTLE_ENDIAN(c[0], c[1]);
+        return GIF_OK;
 }
 
 /******************************************************************************
@@ -779,17 +781,17 @@ static int DGifGetWord(GifFileType *GifFile, GifWord *Word) {
  The block should NOT be freed by the user (not dynamically allocated).
 ******************************************************************************/
 int DGifGetCode(GifFileType *GifFile, int *CodeSize, GifByteType **CodeBlock) {
-    GifFilePrivateType *Private = (GifFilePrivateType *)GifFile->Private;
+        GifFilePrivateType *Private = (GifFilePrivateType *)GifFile->Private;
 
-    if (!IS_READABLE(Private)) {
-        /* This file was NOT open for reading: */
-        GifFile->Error = D_GIF_ERR_NOT_READABLE;
-        return GIF_ERROR;
-    }
+        if (!IS_READABLE(Private)) {
+                /* This file was NOT open for reading: */
+                GifFile->Error = D_GIF_ERR_NOT_READABLE;
+                return GIF_ERROR;
+        }
 
-    *CodeSize = Private->BitsPerPixel;
+        *CodeSize = Private->BitsPerPixel;
 
-    return DGifGetCodeNext(GifFile, CodeBlock);
+        return DGifGetCodeNext(GifFile, CodeBlock);
 }
 
 /******************************************************************************
@@ -798,78 +800,78 @@ int DGifGetCode(GifFileType *GifFile, int *CodeSize, GifByteType **CodeBlock) {
  The block should NOT be freed by the user (not dynamically allocated).
 ******************************************************************************/
 int DGifGetCodeNext(GifFileType *GifFile, GifByteType **CodeBlock) {
-    GifByteType Buf;
-    GifFilePrivateType *Private = (GifFilePrivateType *)GifFile->Private;
+        GifByteType Buf;
+        GifFilePrivateType *Private = (GifFilePrivateType *)GifFile->Private;
 
-    /* coverity[tainted_data_argument] */
-    /* coverity[check_return] */
-    if (InternalRead(GifFile, &Buf, 1) != 1) {
-        GifFile->Error = D_GIF_ERR_READ_FAILED;
-        return GIF_ERROR;
-    }
-
-    /* coverity[lower_bounds] */
-    if (Buf > 0) {
-        *CodeBlock = Private->Buf; /* Use private unused buffer. */
-        (*CodeBlock)[0] =
-            Buf; /* Pascal strings notation (pos. 0 is len.). */
-                 /* coverity[tainted_data] */
-        if (InternalRead(GifFile, &((*CodeBlock)[1]), Buf) != Buf) {
-            GifFile->Error = D_GIF_ERR_READ_FAILED;
-            return GIF_ERROR;
+        /* coverity[tainted_data_argument] */
+        /* coverity[check_return] */
+        if (InternalRead(GifFile, &Buf, 1) != 1) {
+                GifFile->Error = D_GIF_ERR_READ_FAILED;
+                return GIF_ERROR;
         }
-    } else {
-        *CodeBlock = NULL;
-        Private->Buf[0] = 0; /* Make sure the buffer is empty! */
-        Private->PixelCount =
-            0; /* And local info. indicate image read. */
-    }
 
-    return GIF_OK;
+        /* coverity[lower_bounds] */
+        if (Buf > 0) {
+                *CodeBlock = Private->Buf; /* Use private unused buffer. */
+                (*CodeBlock)[0] =
+                    Buf; /* Pascal strings notation (pos. 0 is len.). */
+                         /* coverity[tainted_data] */
+                if (InternalRead(GifFile, &((*CodeBlock)[1]), Buf) != Buf) {
+                        GifFile->Error = D_GIF_ERR_READ_FAILED;
+                        return GIF_ERROR;
+                }
+        } else {
+                *CodeBlock = NULL;
+                Private->Buf[0] = 0; /* Make sure the buffer is empty! */
+                Private->PixelCount =
+                    0; /* And local info. indicate image read. */
+        }
+
+        return GIF_OK;
 }
 
 /******************************************************************************
  Setup the LZ decompression for this image:
 ******************************************************************************/
 static int DGifSetupDecompress(GifFileType *GifFile) {
-    int i, BitsPerPixel;
-    GifByteType CodeSize;
-    GifPrefixType *Prefix;
-    GifFilePrivateType *Private = (GifFilePrivateType *)GifFile->Private;
+        int i, BitsPerPixel;
+        GifByteType CodeSize;
+        GifPrefixType *Prefix;
+        GifFilePrivateType *Private = (GifFilePrivateType *)GifFile->Private;
 
-    /* coverity[check_return] */
-    if (InternalRead(GifFile, &CodeSize, 1) <
-        1) { /* Read Code size from file. */
-        GifFile->Error = D_GIF_ERR_READ_FAILED;
-        return GIF_ERROR; /* Failed to read Code size. */
-    }
-    BitsPerPixel = CodeSize;
+        /* coverity[check_return] */
+        if (InternalRead(GifFile, &CodeSize, 1) <
+            1) { /* Read Code size from file. */
+                GifFile->Error = D_GIF_ERR_READ_FAILED;
+                return GIF_ERROR; /* Failed to read Code size. */
+        }
+        BitsPerPixel = CodeSize;
 
-    /* this can only happen on a severely malformed GIF */
-    if (BitsPerPixel > 8) {
-        GifFile->Error =
-            D_GIF_ERR_READ_FAILED; /* somewhat bogus error code */
-        return GIF_ERROR;          /* Failed to read Code size. */
-    }
+        /* this can only happen on a severely malformed GIF */
+        if (BitsPerPixel > 8) {
+                GifFile->Error =
+                    D_GIF_ERR_READ_FAILED; /* somewhat bogus error code */
+                return GIF_ERROR;          /* Failed to read Code size. */
+        }
 
-    Private->Buf[0] = 0; /* Input Buffer empty. */
-    Private->BitsPerPixel = BitsPerPixel;
-    Private->ClearCode = (1 << BitsPerPixel);
-    Private->EOFCode = Private->ClearCode + 1;
-    Private->RunningCode = Private->EOFCode + 1;
-    Private->RunningBits = BitsPerPixel + 1; /* Number of bits per code. */
-    Private->MaxCode1 = 1 << Private->RunningBits; /* Max. code + 1. */
-    Private->StackPtr = 0; /* No pixels on the pixel stack. */
-    Private->LastCode = NO_SUCH_CODE;
-    Private->CrntShiftState = 0; /* No information in CrntShiftDWord. */
-    Private->CrntShiftDWord = 0;
+        Private->Buf[0] = 0; /* Input Buffer empty. */
+        Private->BitsPerPixel = BitsPerPixel;
+        Private->ClearCode = (1 << BitsPerPixel);
+        Private->EOFCode = Private->ClearCode + 1;
+        Private->RunningCode = Private->EOFCode + 1;
+        Private->RunningBits = BitsPerPixel + 1; /* Number of bits per code. */
+        Private->MaxCode1 = 1 << Private->RunningBits; /* Max. code + 1. */
+        Private->StackPtr = 0; /* No pixels on the pixel stack. */
+        Private->LastCode = NO_SUCH_CODE;
+        Private->CrntShiftState = 0; /* No information in CrntShiftDWord. */
+        Private->CrntShiftDWord = 0;
 
-    Prefix = Private->Prefix;
-    for (i = 0; i <= LZ_MAX_CODE; i++) {
-        Prefix[i] = NO_SUCH_CODE;
-    }
+        Prefix = Private->Prefix;
+        for (i = 0; i <= LZ_MAX_CODE; i++) {
+                Prefix[i] = NO_SUCH_CODE;
+        }
 
-    return GIF_OK;
+        return GIF_OK;
 }
 
 /******************************************************************************
@@ -880,147 +882,147 @@ static int DGifSetupDecompress(GifFileType *GifFile) {
 ******************************************************************************/
 static int DGifDecompressLine(GifFileType *GifFile, GifPixelType *Line,
                               int LineLen) {
-    int i = 0;
-    int j, CrntCode, EOFCode, ClearCode, CrntPrefix, LastCode, StackPtr;
-    GifByteType *Stack, *Suffix;
-    GifPrefixType *Prefix;
-    GifFilePrivateType *Private = (GifFilePrivateType *)GifFile->Private;
+        int i = 0;
+        int j, CrntCode, EOFCode, ClearCode, CrntPrefix, LastCode, StackPtr;
+        GifByteType *Stack, *Suffix;
+        GifPrefixType *Prefix;
+        GifFilePrivateType *Private = (GifFilePrivateType *)GifFile->Private;
 
-    StackPtr = Private->StackPtr;
-    Prefix = Private->Prefix;
-    Suffix = Private->Suffix;
-    Stack = Private->Stack;
-    EOFCode = Private->EOFCode;
-    ClearCode = Private->ClearCode;
-    LastCode = Private->LastCode;
+        StackPtr = Private->StackPtr;
+        Prefix = Private->Prefix;
+        Suffix = Private->Suffix;
+        Stack = Private->Stack;
+        EOFCode = Private->EOFCode;
+        ClearCode = Private->ClearCode;
+        LastCode = Private->LastCode;
 
-    if (StackPtr > LZ_MAX_CODE) {
-        return GIF_ERROR;
-    }
-
-    if (StackPtr != 0) {
-        /* Let pop the stack off before continueing to read the GIF
-         * file: */
-        while (StackPtr != 0 && i < LineLen) {
-            Line[i++] = Stack[--StackPtr];
-        }
-    }
-
-    while (i < LineLen) { /* Decode LineLen items. */
-        if (DGifDecompressInput(GifFile, &CrntCode) == GIF_ERROR) {
-            return GIF_ERROR;
+        if (StackPtr > LZ_MAX_CODE) {
+                return GIF_ERROR;
         }
 
-        if (CrntCode == EOFCode) {
-            /* Note however that usually we will not be here as we
-             * will stop decoding as soon as we got all the pixel,
-             * or EOF code will not be read at all, and
-             * DGifGetLine/Pixel clean everything.  */
-            GifFile->Error = D_GIF_ERR_EOF_TOO_SOON;
-            return GIF_ERROR;
-        } else if (CrntCode == ClearCode) {
-            /* We need to start over again: */
-            for (j = 0; j <= LZ_MAX_CODE; j++) {
-                Prefix[j] = NO_SUCH_CODE;
-            }
-            Private->RunningCode = Private->EOFCode + 1;
-            Private->RunningBits = Private->BitsPerPixel + 1;
-            Private->MaxCode1 = 1 << Private->RunningBits;
-            LastCode = Private->LastCode = NO_SUCH_CODE;
-        } else {
-            /* Its regular code - if in pixel range simply add it to
-             * output stream, otherwise trace to codes linked list
-             * until the prefix is in pixel range: */
-            if (CrntCode < ClearCode) {
-                /* This is simple - its pixel scalar, so add it
-                 * to output: */
-                Line[i++] = CrntCode;
-            } else {
-                /* Its a code to needed to be traced: trace the
-                 * linked list until the prefix is a pixel,
-                 * while pushing the suffix pixels on our stack.
-                 * If we done, pop the stack in reverse (thats
-                 * what stack is good for!) order to output.  */
-                if (Prefix[CrntCode] == NO_SUCH_CODE) {
-                    CrntPrefix = LastCode;
-
-                    /* Only allowed if CrntCode is exactly
-                     * the running code: In that case
-                     * CrntCode = XXXCode, CrntCode or the
-                     * prefix code is last code and the
-                     * suffix char is exactly the prefix of
-                     * last code! */
-                    if (CrntCode ==
-                        Private->RunningCode - 2) {
-                        Suffix[Private->RunningCode -
-                               2] = Stack[StackPtr++] =
-                            DGifGetPrefixChar(
-                                Prefix, LastCode,
-                                ClearCode);
-                    } else {
-                        Suffix[Private->RunningCode -
-                               2] = Stack[StackPtr++] =
-                            DGifGetPrefixChar(
-                                Prefix, CrntCode,
-                                ClearCode);
-                    }
-                } else {
-                    CrntPrefix = CrntCode;
-                }
-
-                /* Now (if image is O.K.) we should not get a
-                 * NO_SUCH_CODE during the trace. As we might
-                 * loop forever, in case of defective image, we
-                 * use StackPtr as loop counter and stop before
-                 * overflowing Stack[]. */
-                while (StackPtr < LZ_MAX_CODE &&
-                       CrntPrefix > ClearCode &&
-                       CrntPrefix <= LZ_MAX_CODE) {
-                    Stack[StackPtr++] = Suffix[CrntPrefix];
-                    CrntPrefix = Prefix[CrntPrefix];
-                }
-                if (StackPtr >= LZ_MAX_CODE ||
-                    CrntPrefix > LZ_MAX_CODE) {
-                    GifFile->Error = D_GIF_ERR_IMAGE_DEFECT;
-                    return GIF_ERROR;
-                }
-                /* Push the last character on stack: */
-                Stack[StackPtr++] = CrntPrefix;
-
-                /* Now lets pop all the stack into output: */
+        if (StackPtr != 0) {
+                /* Let pop the stack off before continueing to read the GIF
+                 * file: */
                 while (StackPtr != 0 && i < LineLen) {
-                    Line[i++] = Stack[--StackPtr];
+                        Line[i++] = Stack[--StackPtr];
                 }
-            }
-            if (LastCode != NO_SUCH_CODE &&
-                Private->RunningCode - 2 < (LZ_MAX_CODE + 1) &&
-                Prefix[Private->RunningCode - 2] == NO_SUCH_CODE) {
-                Prefix[Private->RunningCode - 2] = LastCode;
-
-                if (CrntCode == Private->RunningCode - 2) {
-                    /* Only allowed if CrntCode is exactly
-                     * the running code: In that case
-                     * CrntCode = XXXCode, CrntCode or the
-                     * prefix code is last code and the
-                     * suffix char is exactly the prefix of
-                     * last code! */
-                    Suffix[Private->RunningCode - 2] =
-                        DGifGetPrefixChar(Prefix, LastCode,
-                                          ClearCode);
-                } else {
-                    Suffix[Private->RunningCode - 2] =
-                        DGifGetPrefixChar(Prefix, CrntCode,
-                                          ClearCode);
-                }
-            }
-            LastCode = CrntCode;
         }
-    }
 
-    Private->LastCode = LastCode;
-    Private->StackPtr = StackPtr;
+        while (i < LineLen) { /* Decode LineLen items. */
+                if (DGifDecompressInput(GifFile, &CrntCode) == GIF_ERROR) {
+                        return GIF_ERROR;
+                }
 
-    return GIF_OK;
+                if (CrntCode == EOFCode) {
+                        /* Note however that usually we will not be here as we
+                         * will stop decoding as soon as we got all the pixel,
+                         * or EOF code will not be read at all, and
+                         * DGifGetLine/Pixel clean everything.  */
+                        GifFile->Error = D_GIF_ERR_EOF_TOO_SOON;
+                        return GIF_ERROR;
+                } else if (CrntCode == ClearCode) {
+                        /* We need to start over again: */
+                        for (j = 0; j <= LZ_MAX_CODE; j++) {
+                                Prefix[j] = NO_SUCH_CODE;
+                        }
+                        Private->RunningCode = Private->EOFCode + 1;
+                        Private->RunningBits = Private->BitsPerPixel + 1;
+                        Private->MaxCode1 = 1 << Private->RunningBits;
+                        LastCode = Private->LastCode = NO_SUCH_CODE;
+                } else {
+                        /* Its regular code - if in pixel range simply add it to
+                         * output stream, otherwise trace to codes linked list
+                         * until the prefix is in pixel range: */
+                        if (CrntCode < ClearCode) {
+                                /* This is simple - its pixel scalar, so add it
+                                 * to output: */
+                                Line[i++] = CrntCode;
+                        } else {
+                                /* Its a code to needed to be traced: trace the
+                                 * linked list until the prefix is a pixel,
+                                 * while pushing the suffix pixels on our stack.
+                                 * If we done, pop the stack in reverse (thats
+                                 * what stack is good for!) order to output.  */
+                                if (Prefix[CrntCode] == NO_SUCH_CODE) {
+                                        CrntPrefix = LastCode;
+
+                                        /* Only allowed if CrntCode is exactly
+                                         * the running code: In that case
+                                         * CrntCode = XXXCode, CrntCode or the
+                                         * prefix code is last code and the
+                                         * suffix char is exactly the prefix of
+                                         * last code! */
+                                        if (CrntCode ==
+                                            Private->RunningCode - 2) {
+                                                Suffix[Private->RunningCode -
+                                                       2] = Stack[StackPtr++] =
+                                                    DGifGetPrefixChar(
+                                                        Prefix, LastCode,
+                                                        ClearCode);
+                                        } else {
+                                                Suffix[Private->RunningCode -
+                                                       2] = Stack[StackPtr++] =
+                                                    DGifGetPrefixChar(
+                                                        Prefix, CrntCode,
+                                                        ClearCode);
+                                        }
+                                } else {
+                                        CrntPrefix = CrntCode;
+                                }
+
+                                /* Now (if image is O.K.) we should not get a
+                                 * NO_SUCH_CODE during the trace. As we might
+                                 * loop forever, in case of defective image, we
+                                 * use StackPtr as loop counter and stop before
+                                 * overflowing Stack[]. */
+                                while (StackPtr < LZ_MAX_CODE &&
+                                       CrntPrefix > ClearCode &&
+                                       CrntPrefix <= LZ_MAX_CODE) {
+                                        Stack[StackPtr++] = Suffix[CrntPrefix];
+                                        CrntPrefix = Prefix[CrntPrefix];
+                                }
+                                if (StackPtr >= LZ_MAX_CODE ||
+                                    CrntPrefix > LZ_MAX_CODE) {
+                                        GifFile->Error = D_GIF_ERR_IMAGE_DEFECT;
+                                        return GIF_ERROR;
+                                }
+                                /* Push the last character on stack: */
+                                Stack[StackPtr++] = CrntPrefix;
+
+                                /* Now lets pop all the stack into output: */
+                                while (StackPtr != 0 && i < LineLen) {
+                                        Line[i++] = Stack[--StackPtr];
+                                }
+                        }
+                        if (LastCode != NO_SUCH_CODE &&
+                            Private->RunningCode - 2 < (LZ_MAX_CODE + 1) &&
+                            Prefix[Private->RunningCode - 2] == NO_SUCH_CODE) {
+                                Prefix[Private->RunningCode - 2] = LastCode;
+
+                                if (CrntCode == Private->RunningCode - 2) {
+                                        /* Only allowed if CrntCode is exactly
+                                         * the running code: In that case
+                                         * CrntCode = XXXCode, CrntCode or the
+                                         * prefix code is last code and the
+                                         * suffix char is exactly the prefix of
+                                         * last code! */
+                                        Suffix[Private->RunningCode - 2] =
+                                            DGifGetPrefixChar(Prefix, LastCode,
+                                                              ClearCode);
+                                } else {
+                                        Suffix[Private->RunningCode - 2] =
+                                            DGifGetPrefixChar(Prefix, CrntCode,
+                                                              ClearCode);
+                                }
+                        }
+                        LastCode = CrntCode;
+                }
+        }
+
+        Private->LastCode = LastCode;
+        Private->StackPtr = StackPtr;
+
+        return GIF_OK;
 }
 
 /******************************************************************************
@@ -1031,15 +1033,15 @@ static int DGifDecompressLine(GifFileType *GifFile, GifPixelType *Line,
 ******************************************************************************/
 static int DGifGetPrefixChar(const GifPrefixType *Prefix, int Code,
                              int ClearCode) {
-    int i = 0;
+        int i = 0;
 
-    while (Code > ClearCode && i++ <= LZ_MAX_CODE) {
-        if (Code > LZ_MAX_CODE) {
-            return NO_SUCH_CODE;
+        while (Code > ClearCode && i++ <= LZ_MAX_CODE) {
+                if (Code > LZ_MAX_CODE) {
+                        return NO_SUCH_CODE;
+                }
+                Code = Prefix[Code];
         }
-        Code = Prefix[Code];
-    }
-    return Code;
+        return Code;
 }
 
 /******************************************************************************
@@ -1047,37 +1049,37 @@ static int DGifGetPrefixChar(const GifPrefixType *Prefix, int Code,
  (12bits), or to -1 if EOF code is returned.
 ******************************************************************************/
 int DGifGetLZCodes(GifFileType *GifFile, int *Code) {
-    GifByteType *CodeBlock;
-    GifFilePrivateType *Private = (GifFilePrivateType *)GifFile->Private;
+        GifByteType *CodeBlock;
+        GifFilePrivateType *Private = (GifFilePrivateType *)GifFile->Private;
 
-    if (!IS_READABLE(Private)) {
-        /* This file was NOT open for reading: */
-        GifFile->Error = D_GIF_ERR_NOT_READABLE;
-        return GIF_ERROR;
-    }
-
-    if (DGifDecompressInput(GifFile, Code) == GIF_ERROR) {
-        return GIF_ERROR;
-    }
-
-    if (*Code == Private->EOFCode) {
-        /* Skip rest of codes (hopefully only NULL terminating block):
-         */
-        do {
-            if (DGifGetCodeNext(GifFile, &CodeBlock) == GIF_ERROR) {
+        if (!IS_READABLE(Private)) {
+                /* This file was NOT open for reading: */
+                GifFile->Error = D_GIF_ERR_NOT_READABLE;
                 return GIF_ERROR;
-            }
-        } while (CodeBlock != NULL);
+        }
 
-        *Code = -1;
-    } else if (*Code == Private->ClearCode) {
-        /* We need to start over again: */
-        Private->RunningCode = Private->EOFCode + 1;
-        Private->RunningBits = Private->BitsPerPixel + 1;
-        Private->MaxCode1 = 1 << Private->RunningBits;
-    }
+        if (DGifDecompressInput(GifFile, Code) == GIF_ERROR) {
+                return GIF_ERROR;
+        }
 
-    return GIF_OK;
+        if (*Code == Private->EOFCode) {
+                /* Skip rest of codes (hopefully only NULL terminating block):
+                 */
+                do {
+                        if (DGifGetCodeNext(GifFile, &CodeBlock) == GIF_ERROR) {
+                                return GIF_ERROR;
+                        }
+                } while (CodeBlock != NULL);
+
+                *Code = -1;
+        } else if (*Code == Private->ClearCode) {
+                /* We need to start over again: */
+                Private->RunningCode = Private->EOFCode + 1;
+                Private->RunningBits = Private->BitsPerPixel + 1;
+                Private->MaxCode1 = 1 << Private->RunningBits;
+        }
+
+        return GIF_OK;
 }
 
 /******************************************************************************
@@ -1087,47 +1089,47 @@ int DGifGetLZCodes(GifFileType *GifFile, int *Code) {
  Returns GIF_OK if read successfully.
 ******************************************************************************/
 static int DGifDecompressInput(GifFileType *GifFile, int *Code) {
-    static const unsigned short CodeMasks[] = {
-        0x0000, 0x0001, 0x0003, 0x0007, 0x000f, 0x001f, 0x003f,
-        0x007f, 0x00ff, 0x01ff, 0x03ff, 0x07ff, 0x0fff};
+        static const unsigned short CodeMasks[] = {
+            0x0000, 0x0001, 0x0003, 0x0007, 0x000f, 0x001f, 0x003f,
+            0x007f, 0x00ff, 0x01ff, 0x03ff, 0x07ff, 0x0fff};
 
-    GifFilePrivateType *Private = (GifFilePrivateType *)GifFile->Private;
+        GifFilePrivateType *Private = (GifFilePrivateType *)GifFile->Private;
 
-    GifByteType NextByte;
+        GifByteType NextByte;
 
-    /* The image can't contain more than LZ_BITS per code. */
-    if (Private->RunningBits > LZ_BITS) {
-        GifFile->Error = D_GIF_ERR_IMAGE_DEFECT;
-        return GIF_ERROR;
-    }
-
-    while (Private->CrntShiftState < Private->RunningBits) {
-        /* Needs to get more bytes from input stream for next code: */
-        if (DGifBufferedInput(GifFile, Private->Buf, &NextByte) ==
-            GIF_ERROR) {
-            return GIF_ERROR;
+        /* The image can't contain more than LZ_BITS per code. */
+        if (Private->RunningBits > LZ_BITS) {
+                GifFile->Error = D_GIF_ERR_IMAGE_DEFECT;
+                return GIF_ERROR;
         }
-        Private->CrntShiftDWord |= ((unsigned long)NextByte)
-                                   << Private->CrntShiftState;
-        Private->CrntShiftState += 8;
-    }
-    *Code = Private->CrntShiftDWord & CodeMasks[Private->RunningBits];
 
-    Private->CrntShiftDWord >>= Private->RunningBits;
-    Private->CrntShiftState -= Private->RunningBits;
+        while (Private->CrntShiftState < Private->RunningBits) {
+                /* Needs to get more bytes from input stream for next code: */
+                if (DGifBufferedInput(GifFile, Private->Buf, &NextByte) ==
+                    GIF_ERROR) {
+                        return GIF_ERROR;
+                }
+                Private->CrntShiftDWord |= ((unsigned long)NextByte)
+                                           << Private->CrntShiftState;
+                Private->CrntShiftState += 8;
+        }
+        *Code = Private->CrntShiftDWord & CodeMasks[Private->RunningBits];
 
-    /* If code cannot fit into RunningBits bits, must raise its size. Note
-     * however that codes above 4095 are used for special signaling.
-     * If we're using LZ_BITS bits already and we're at the max code, just
-     * keep using the table as it is, don't increment Private->RunningCode.
-     */
-    if (Private->RunningCode < LZ_MAX_CODE + 2 &&
-        ++Private->RunningCode > Private->MaxCode1 &&
-        Private->RunningBits < LZ_BITS) {
-        Private->MaxCode1 <<= 1;
-        Private->RunningBits++;
-    }
-    return GIF_OK;
+        Private->CrntShiftDWord >>= Private->RunningBits;
+        Private->CrntShiftState -= Private->RunningBits;
+
+        /* If code cannot fit into RunningBits bits, must raise its size. Note
+         * however that codes above 4095 are used for special signaling.
+         * If we're using LZ_BITS bits already and we're at the max code, just
+         * keep using the table as it is, don't increment Private->RunningCode.
+         */
+        if (Private->RunningCode < LZ_MAX_CODE + 2 &&
+            ++Private->RunningCode > Private->MaxCode1 &&
+            Private->RunningBits < LZ_BITS) {
+                Private->MaxCode1 <<= 1;
+                Private->RunningBits++;
+        }
+        return GIF_OK;
 }
 
 /******************************************************************************
@@ -1138,34 +1140,34 @@ static int DGifDecompressInput(GifFileType *GifFile, int *Code) {
 ******************************************************************************/
 static int DGifBufferedInput(GifFileType *GifFile, GifByteType *Buf,
                              GifByteType *NextByte) {
-    if (Buf[0] == 0) {
-        /* Needs to read the next buffer - this one is empty: */
-        /* coverity[check_return] */
-        if (InternalRead(GifFile, Buf, 1) != 1) {
-            GifFile->Error = D_GIF_ERR_READ_FAILED;
-            return GIF_ERROR;
-        }
-        /* There shouldn't be any empty data blocks here as the LZW spec
-         * says the LZW termination code should come first.  Therefore
-         * we shouldn't be inside this routine at that point.
-         */
         if (Buf[0] == 0) {
-            GifFile->Error = D_GIF_ERR_IMAGE_DEFECT;
-            return GIF_ERROR;
+                /* Needs to read the next buffer - this one is empty: */
+                /* coverity[check_return] */
+                if (InternalRead(GifFile, Buf, 1) != 1) {
+                        GifFile->Error = D_GIF_ERR_READ_FAILED;
+                        return GIF_ERROR;
+                }
+                /* There shouldn't be any empty data blocks here as the LZW spec
+                 * says the LZW termination code should come first.  Therefore
+                 * we shouldn't be inside this routine at that point.
+                 */
+                if (Buf[0] == 0) {
+                        GifFile->Error = D_GIF_ERR_IMAGE_DEFECT;
+                        return GIF_ERROR;
+                }
+                if (InternalRead(GifFile, &Buf[1], Buf[0]) != Buf[0]) {
+                        GifFile->Error = D_GIF_ERR_READ_FAILED;
+                        return GIF_ERROR;
+                }
+                *NextByte = Buf[1];
+                Buf[1] = 2; /* We use now the second place as last char read! */
+                Buf[0]--;
+        } else {
+                *NextByte = Buf[Buf[1]++];
+                Buf[0]--;
         }
-        if (InternalRead(GifFile, &Buf[1], Buf[0]) != Buf[0]) {
-            GifFile->Error = D_GIF_ERR_READ_FAILED;
-            return GIF_ERROR;
-        }
-        *NextByte = Buf[1];
-        Buf[1] = 2; /* We use now the second place as last char read! */
-        Buf[0]--;
-    } else {
-        *NextByte = Buf[Buf[1]++];
-        Buf[0]--;
-    }
 
-    return GIF_OK;
+        return GIF_OK;
 }
 
 /******************************************************************************
@@ -1175,17 +1177,20 @@ static int DGifBufferedInput(GifFileType *GifFile, GifByteType *Buf,
  SavedImages may point to the spoilt image and null pointer buffers.
 *******************************************************************************/
 void DGifDecreaseImageCounter(GifFileType *GifFile) {
-    GifFile->ImageCount--;
-    if (GifFile->SavedImages[GifFile->ImageCount].RasterBits != NULL) {
-        free(GifFile->SavedImages[GifFile->ImageCount].RasterBits);
-    }
+        GifFile->ImageCount--;
+        if (GifFile->SavedImages[GifFile->ImageCount].RasterBits != NULL) {
+                free(GifFile->SavedImages[GifFile->ImageCount].RasterBits);
+        }
+        if (GifFile->SavedImages[GifFile->ImageCount].ImageDesc.ColorMap != NULL) {
+                GifFreeMapObject(GifFile->SavedImages[GifFile->ImageCount].ImageDesc.ColorMap);
+        }
 
-    // Realloc array according to the new image counter.
-    SavedImage *correct_saved_images = (SavedImage *)reallocarray(
-        GifFile->SavedImages, GifFile->ImageCount, sizeof(SavedImage));
-    if (correct_saved_images != NULL) {
-        GifFile->SavedImages = correct_saved_images;
-    }
+        // Realloc array according to the new image counter.
+        SavedImage *correct_saved_images = (SavedImage *)reallocarray(
+            GifFile->SavedImages, GifFile->ImageCount, sizeof(SavedImage));
+        if (correct_saved_images != NULL) {
+                GifFile->SavedImages = correct_saved_images;
+        }
 }
 
 /******************************************************************************
@@ -1194,143 +1199,143 @@ void DGifDecreaseImageCounter(GifFileType *GifFile) {
  first to initialize I/O.  Its inverse is EGifSpew().
 *******************************************************************************/
 int DGifSlurp(GifFileType *GifFile) {
-    size_t ImageSize;
-    GifRecordType RecordType;
-    SavedImage *sp;
-    GifByteType *ExtData;
-    int ExtFunction;
+        size_t ImageSize;
+        GifRecordType RecordType;
+        SavedImage *sp;
+        GifByteType *ExtData;
+        int ExtFunction;
 
-    GifFile->ExtensionBlocks = NULL;
-    GifFile->ExtensionBlockCount = 0;
+        GifFile->ExtensionBlocks = NULL;
+        GifFile->ExtensionBlockCount = 0;
 
-    do {
-        if (DGifGetRecordType(GifFile, &RecordType) == GIF_ERROR) {
-            return (GIF_ERROR);
-        }
+        do {
+                if (DGifGetRecordType(GifFile, &RecordType) == GIF_ERROR) {
+                        return (GIF_ERROR);
+                }
 
-        switch (RecordType) {
-        case IMAGE_DESC_RECORD_TYPE:
-            if (DGifGetImageDesc(GifFile) == GIF_ERROR) {
-                return (GIF_ERROR);
-            }
-
-            sp = &GifFile->SavedImages[GifFile->ImageCount - 1];
-            /* Allocate memory for the image */
-            if (sp->ImageDesc.Width <= 0 ||
-                sp->ImageDesc.Height <= 0 ||
-                sp->ImageDesc.Width >
-                    (INT_MAX / sp->ImageDesc.Height)) {
-                DGifDecreaseImageCounter(GifFile);
-                return GIF_ERROR;
-            }
-            ImageSize = sp->ImageDesc.Width * sp->ImageDesc.Height;
-
-            if (ImageSize > (SIZE_MAX / sizeof(GifPixelType))) {
-                DGifDecreaseImageCounter(GifFile);
-                return GIF_ERROR;
-            }
-            sp->RasterBits = (unsigned char *)reallocarray(
-                NULL, ImageSize, sizeof(GifPixelType));
-
-            if (sp->RasterBits == NULL) {
-                DGifDecreaseImageCounter(GifFile);
-                return GIF_ERROR;
-            }
-
-            if (sp->ImageDesc.Interlace) {
-                int i, j;
-                /*
-                 * The way an interlaced image should be read -
-                 * offsets and jumps...
-                 */
-                static const int InterlacedOffset[] = {0, 4, 2,
-                                                       1};
-                static const int InterlacedJumps[] = {8, 8, 4,
-                                                      2};
-                /* Need to perform 4 passes on the image */
-                for (i = 0; i < 4; i++) {
-                    for (j = InterlacedOffset[i];
-                         j < sp->ImageDesc.Height;
-                         j += InterlacedJumps[i]) {
-                        if (DGifGetLine(
-                                GifFile,
-                                sp->RasterBits +
-                                    j * sp->ImageDesc
-                                            .Width,
-                                sp->ImageDesc.Width) ==
-                            GIF_ERROR) {
-                            DGifDecreaseImageCounter(
-                                GifFile);
-                            return GIF_ERROR;
+                switch (RecordType) {
+                case IMAGE_DESC_RECORD_TYPE:
+                        if (DGifGetImageDesc(GifFile) == GIF_ERROR) {
+                                return (GIF_ERROR);
                         }
-                    }
+
+                        sp = &GifFile->SavedImages[GifFile->ImageCount - 1];
+                        /* Allocate memory for the image */
+                        if (sp->ImageDesc.Width <= 0 ||
+                            sp->ImageDesc.Height <= 0 ||
+                            sp->ImageDesc.Width >
+                                (INT_MAX / sp->ImageDesc.Height)) {
+                                DGifDecreaseImageCounter(GifFile);
+                                return GIF_ERROR;
+                        }
+                        ImageSize = sp->ImageDesc.Width * sp->ImageDesc.Height;
+
+                        if (ImageSize > (SIZE_MAX / sizeof(GifPixelType))) {
+                                DGifDecreaseImageCounter(GifFile);
+                                return GIF_ERROR;
+                        }
+                        sp->RasterBits = (unsigned char *)reallocarray(
+                            NULL, ImageSize, sizeof(GifPixelType));
+
+                        if (sp->RasterBits == NULL) {
+                                DGifDecreaseImageCounter(GifFile);
+                                return GIF_ERROR;
+                        }
+
+                        if (sp->ImageDesc.Interlace) {
+                                int i, j;
+                                /*
+                                 * The way an interlaced image should be read -
+                                 * offsets and jumps...
+                                 */
+                                static const int InterlacedOffset[] = {0, 4, 2,
+                                                                       1};
+                                static const int InterlacedJumps[] = {8, 8, 4,
+                                                                      2};
+                                /* Need to perform 4 passes on the image */
+                                for (i = 0; i < 4; i++) {
+                                        for (j = InterlacedOffset[i];
+                                             j < sp->ImageDesc.Height;
+                                             j += InterlacedJumps[i]) {
+                                                if (DGifGetLine(
+                                                        GifFile,
+                                                        sp->RasterBits +
+                                                            j * sp->ImageDesc
+                                                                    .Width,
+                                                        sp->ImageDesc.Width) ==
+                                                    GIF_ERROR) {
+                                                        DGifDecreaseImageCounter(
+                                                            GifFile);
+                                                        return GIF_ERROR;
+                                                }
+                                        }
+                                }
+                        } else {
+                                if (DGifGetLine(GifFile, sp->RasterBits,
+                                                ImageSize) == GIF_ERROR) {
+                                        DGifDecreaseImageCounter(GifFile);
+                                        return GIF_ERROR;
+                                }
+                        }
+
+                        if (GifFile->ExtensionBlocks) {
+                                sp->ExtensionBlocks = GifFile->ExtensionBlocks;
+                                sp->ExtensionBlockCount =
+                                    GifFile->ExtensionBlockCount;
+
+                                GifFile->ExtensionBlocks = NULL;
+                                GifFile->ExtensionBlockCount = 0;
+                        }
+                        break;
+
+                case EXTENSION_RECORD_TYPE:
+                        if (DGifGetExtension(GifFile, &ExtFunction, &ExtData) ==
+                            GIF_ERROR) {
+                                return (GIF_ERROR);
+                        }
+                        /* Create an extension block with our data */
+                        if (ExtData != NULL) {
+                                if (GifAddExtensionBlock(
+                                        &GifFile->ExtensionBlockCount,
+                                        &GifFile->ExtensionBlocks, ExtFunction,
+                                        ExtData[0], &ExtData[1]) == GIF_ERROR) {
+                                        return (GIF_ERROR);
+                                }
+                        }
+                        for (;;) {
+                                if (DGifGetExtensionNext(GifFile, &ExtData) ==
+                                    GIF_ERROR) {
+                                        return (GIF_ERROR);
+                                }
+                                if (ExtData == NULL) {
+                                        break;
+                                }
+                                /* Continue the extension block */
+                                if (GifAddExtensionBlock(
+                                        &GifFile->ExtensionBlockCount,
+                                        &GifFile->ExtensionBlocks,
+                                        CONTINUE_EXT_FUNC_CODE, ExtData[0],
+                                        &ExtData[1]) == GIF_ERROR) {
+                                        return (GIF_ERROR);
+                                }
+                        }
+                        break;
+
+                case TERMINATE_RECORD_TYPE:
+                        break;
+
+                default: /* Should be trapped by DGifGetRecordType */
+                        break;
                 }
-            } else {
-                if (DGifGetLine(GifFile, sp->RasterBits,
-                                ImageSize) == GIF_ERROR) {
-                    DGifDecreaseImageCounter(GifFile);
-                    return GIF_ERROR;
-                }
-            }
+        } while (RecordType != TERMINATE_RECORD_TYPE);
 
-            if (GifFile->ExtensionBlocks) {
-                sp->ExtensionBlocks = GifFile->ExtensionBlocks;
-                sp->ExtensionBlockCount =
-                    GifFile->ExtensionBlockCount;
-
-                GifFile->ExtensionBlocks = NULL;
-                GifFile->ExtensionBlockCount = 0;
-            }
-            break;
-
-        case EXTENSION_RECORD_TYPE:
-            if (DGifGetExtension(GifFile, &ExtFunction, &ExtData) ==
-                GIF_ERROR) {
+        /* Sanity check for corrupted file */
+        if (GifFile->ImageCount == 0) {
+                GifFile->Error = D_GIF_ERR_NO_IMAG_DSCR;
                 return (GIF_ERROR);
-            }
-            /* Create an extension block with our data */
-            if (ExtData != NULL) {
-                if (GifAddExtensionBlock(
-                        &GifFile->ExtensionBlockCount,
-                        &GifFile->ExtensionBlocks, ExtFunction,
-                        ExtData[0], &ExtData[1]) == GIF_ERROR) {
-                    return (GIF_ERROR);
-                }
-            }
-            for (;;) {
-                if (DGifGetExtensionNext(GifFile, &ExtData) ==
-                    GIF_ERROR) {
-                    return (GIF_ERROR);
-                }
-                if (ExtData == NULL) {
-                    break;
-                }
-                /* Continue the extension block */
-                if (GifAddExtensionBlock(
-                        &GifFile->ExtensionBlockCount,
-                        &GifFile->ExtensionBlocks,
-                        CONTINUE_EXT_FUNC_CODE, ExtData[0],
-                        &ExtData[1]) == GIF_ERROR) {
-                    return (GIF_ERROR);
-                }
-            }
-            break;
-
-        case TERMINATE_RECORD_TYPE:
-            break;
-
-        default: /* Should be trapped by DGifGetRecordType */
-            break;
         }
-    } while (RecordType != TERMINATE_RECORD_TYPE);
 
-    /* Sanity check for corrupted file */
-    if (GifFile->ImageCount == 0) {
-        GifFile->Error = D_GIF_ERR_NO_IMAG_DSCR;
-        return (GIF_ERROR);
-    }
-
-    return (GIF_OK);
+        return (GIF_OK);
 }
 
 /* end */
diff --git a/src/java.desktop/share/native/libsplashscreen/giflib/gif_err.c b/src/java.desktop/share/native/libsplashscreen/giflib/gif_err.c
index 3b6785f7c63..a3cc03b8865 100644
--- a/src/java.desktop/share/native/libsplashscreen/giflib/gif_err.c
+++ b/src/java.desktop/share/native/libsplashscreen/giflib/gif_err.c
@@ -26,9 +26,9 @@
 
 gif_err.c - handle error reporting for the GIF library.
 
-SPDX-License-Identifier: MIT
-
 ****************************************************************************/
+// SPDX-License-Identifier: MIT
+// SPDX-File-Copyright-Txt: (C) Copyright 1989 Gershon Elber
 
 #include <stdio.h>
 
@@ -39,83 +39,83 @@ SPDX-License-Identifier: MIT
  Return a string description of  the last GIF error
 *****************************************************************************/
 const char *GifErrorString(int ErrorCode) {
-    const char *Err;
+        const char *Err;
 
-    switch (ErrorCode) {
-    case E_GIF_ERR_OPEN_FAILED:
-        Err = "Failed to open given file";
-        break;
-    case E_GIF_ERR_WRITE_FAILED:
-        Err = "Failed to write to given file";
-        break;
-    case E_GIF_ERR_HAS_SCRN_DSCR:
-        Err = "Screen descriptor has already been set";
-        break;
-    case E_GIF_ERR_HAS_IMAG_DSCR:
-        Err = "Image descriptor is still active";
-        break;
-    case E_GIF_ERR_NO_COLOR_MAP:
-        Err = "Neither global nor local color map";
-        break;
-    case E_GIF_ERR_DATA_TOO_BIG:
-        Err = "Number of pixels bigger than width * height";
-        break;
-    case E_GIF_ERR_NOT_ENOUGH_MEM:
-        Err = "Failed to allocate required memory";
-        break;
-    case E_GIF_ERR_DISK_IS_FULL:
-        Err = "Write failed (disk full?)";
-        break;
-    case E_GIF_ERR_CLOSE_FAILED:
-        Err = "Failed to close given file";
-        break;
-    case E_GIF_ERR_NOT_WRITEABLE:
-        Err = "Given file was not opened for write";
-        break;
-    case D_GIF_ERR_OPEN_FAILED:
-        Err = "Failed to open given file";
-        break;
-    case D_GIF_ERR_READ_FAILED:
-        Err = "Failed to read from given file";
-        break;
-    case D_GIF_ERR_NOT_GIF_FILE:
-        Err = "Data is not in GIF format";
-        break;
-    case D_GIF_ERR_NO_SCRN_DSCR:
-        Err = "No screen descriptor detected";
-        break;
-    case D_GIF_ERR_NO_IMAG_DSCR:
-        Err = "No Image Descriptor detected";
-        break;
-    case D_GIF_ERR_NO_COLOR_MAP:
-        Err = "Neither global nor local color map";
-        break;
-    case D_GIF_ERR_WRONG_RECORD:
-        Err = "Wrong record type detected";
-        break;
-    case D_GIF_ERR_DATA_TOO_BIG:
-        Err = "Number of pixels bigger than width * height";
-        break;
-    case D_GIF_ERR_NOT_ENOUGH_MEM:
-        Err = "Failed to allocate required memory";
-        break;
-    case D_GIF_ERR_CLOSE_FAILED:
-        Err = "Failed to close given file";
-        break;
-    case D_GIF_ERR_NOT_READABLE:
-        Err = "Given file was not opened for read";
-        break;
-    case D_GIF_ERR_IMAGE_DEFECT:
-        Err = "Image is defective, decoding aborted";
-        break;
-    case D_GIF_ERR_EOF_TOO_SOON:
-        Err = "Image EOF detected before image complete";
-        break;
-    default:
-        Err = NULL;
-        break;
-    }
-    return Err;
+        switch (ErrorCode) {
+        case E_GIF_ERR_OPEN_FAILED:
+                Err = "Failed to open given file";
+                break;
+        case E_GIF_ERR_WRITE_FAILED:
+                Err = "Failed to write to given file";
+                break;
+        case E_GIF_ERR_HAS_SCRN_DSCR:
+                Err = "Screen descriptor has already been set";
+                break;
+        case E_GIF_ERR_HAS_IMAG_DSCR:
+                Err = "Image descriptor is still active";
+                break;
+        case E_GIF_ERR_NO_COLOR_MAP:
+                Err = "Neither global nor local color map";
+                break;
+        case E_GIF_ERR_DATA_TOO_BIG:
+                Err = "Number of pixels bigger than width * height";
+                break;
+        case E_GIF_ERR_NOT_ENOUGH_MEM:
+                Err = "Failed to allocate required memory";
+                break;
+        case E_GIF_ERR_DISK_IS_FULL:
+                Err = "Write failed (disk full?)";
+                break;
+        case E_GIF_ERR_CLOSE_FAILED:
+                Err = "Failed to close given file";
+                break;
+        case E_GIF_ERR_NOT_WRITEABLE:
+                Err = "Given file was not opened for write";
+                break;
+        case D_GIF_ERR_OPEN_FAILED:
+                Err = "Failed to open given file";
+                break;
+        case D_GIF_ERR_READ_FAILED:
+                Err = "Failed to read from given file";
+                break;
+        case D_GIF_ERR_NOT_GIF_FILE:
+                Err = "Data is not in GIF format";
+                break;
+        case D_GIF_ERR_NO_SCRN_DSCR:
+                Err = "No screen descriptor detected";
+                break;
+        case D_GIF_ERR_NO_IMAG_DSCR:
+                Err = "No Image Descriptor detected";
+                break;
+        case D_GIF_ERR_NO_COLOR_MAP:
+                Err = "Neither global nor local color map";
+                break;
+        case D_GIF_ERR_WRONG_RECORD:
+                Err = "Wrong record type detected";
+                break;
+        case D_GIF_ERR_DATA_TOO_BIG:
+                Err = "Number of pixels bigger than width * height";
+                break;
+        case D_GIF_ERR_NOT_ENOUGH_MEM:
+                Err = "Failed to allocate required memory";
+                break;
+        case D_GIF_ERR_CLOSE_FAILED:
+                Err = "Failed to close given file";
+                break;
+        case D_GIF_ERR_NOT_READABLE:
+                Err = "Given file was not opened for read";
+                break;
+        case D_GIF_ERR_IMAGE_DEFECT:
+                Err = "Image is defective, decoding aborted";
+                break;
+        case D_GIF_ERR_EOF_TOO_SOON:
+                Err = "Image EOF detected before image complete";
+                break;
+        default:
+                Err = NULL;
+                break;
+        }
+        return Err;
 }
 
 /* end */
diff --git a/src/java.desktop/share/native/libsplashscreen/giflib/gif_hash.h b/src/java.desktop/share/native/libsplashscreen/giflib/gif_hash.h
index bd00af64161..eb3cba3135f 100644
--- a/src/java.desktop/share/native/libsplashscreen/giflib/gif_hash.h
+++ b/src/java.desktop/share/native/libsplashscreen/giflib/gif_hash.h
@@ -26,9 +26,8 @@
 
 gif_hash.h - magfic constants and declarations for GIF LZW
 
-SPDX-License-Identifier: MIT
-
 ******************************************************************************/
+// SPDX-License-Identifier: MIT
 
 #ifndef _GIF_HASH_H_
 #define _GIF_HASH_H_
@@ -46,7 +45,7 @@ SPDX-License-Identifier: MIT
 
 /* The 32 bits of the long are divided into two parts for the key & code:   */
 /* 1. The code is 12 bits as our compression algorithm is limited to 12bits */
-/* 2. The key is 12 bits Prefix code + 8 bit new char or 20 bits.        */
+/* 2. The key is 12 bits Prefix code + 8 bit new char or 20 bits.           */
 /* The key is the upper 20 bits.  The code is the lower 12. */
 #define HT_GET_KEY(l) (l >> 12)
 #define HT_GET_CODE(l) (l & 0x0FFF)
@@ -54,7 +53,7 @@ SPDX-License-Identifier: MIT
 #define HT_PUT_CODE(l) (l & 0x0FFF)
 
 typedef struct GifHashTableType {
-    uint32_t HTable[HT_SIZE];
+        uint32_t HTable[HT_SIZE];
 } GifHashTableType;
 
 GifHashTableType *_InitHashTable(void);
diff --git a/src/java.desktop/share/native/libsplashscreen/giflib/gif_lib.h b/src/java.desktop/share/native/libsplashscreen/giflib/gif_lib.h
index 74a2e969c0d..5d9c3346090 100644
--- a/src/java.desktop/share/native/libsplashscreen/giflib/gif_lib.h
+++ b/src/java.desktop/share/native/libsplashscreen/giflib/gif_lib.h
@@ -37,9 +37,9 @@ SPDX-License-Identifier: MIT
 extern "C" {
 #endif /* __cplusplus */
 
-#define GIFLIB_MAJOR 5
-#define GIFLIB_MINOR 2
-#define GIFLIB_RELEASE 2
+#define GIFLIB_MAJOR 6
+#define GIFLIB_MINOR 1
+#define GIFLIB_RELEASE 1
 
 #define GIF_ERROR 0
 #define GIF_OK 1
@@ -60,26 +60,26 @@ typedef unsigned int GifPrefixType;
 typedef int GifWord;
 
 typedef struct GifColorType {
-    GifByteType Red, Green, Blue;
+        GifByteType Red, Green, Blue;
 } GifColorType;
 
 typedef struct ColorMapObject {
-    int ColorCount;
-    int BitsPerPixel;
-    bool SortFlag;
-    GifColorType *Colors; /* on malloc(3) heap */
+        int ColorCount;
+        int BitsPerPixel;
+        bool SortFlag;
+        GifColorType *Colors; /* on malloc(3) heap */
 } ColorMapObject;
 
 typedef struct GifImageDesc {
-    GifWord Left, Top, Width, Height; /* Current image dimensions. */
-    bool Interlace;                   /* Sequential/Interlaced lines. */
-    ColorMapObject *ColorMap;         /* The local color map */
+        GifWord Left, Top, Width, Height; /* Current image dimensions. */
+        bool Interlace;                   /* Sequential/Interlaced lines. */
+        ColorMapObject *ColorMap;         /* The local color map */
 } GifImageDesc;
 
 typedef struct ExtensionBlock {
-    int ByteCount;
-    GifByteType *Bytes;            /* on malloc(3) heap */
-    int Function;                  /* The block function code */
+        int ByteCount;
+        GifByteType *Bytes;            /* on malloc(3) heap */
+        int Function;                  /* The block function code */
 #define CONTINUE_EXT_FUNC_CODE 0x00    /* continuation subblock */
 #define COMMENT_EXT_FUNC_CODE 0xfe     /* comment */
 #define GRAPHICS_EXT_FUNC_CODE 0xf9    /* graphics control (GIF89) */
@@ -88,36 +88,36 @@ typedef struct ExtensionBlock {
 } ExtensionBlock;
 
 typedef struct SavedImage {
-    GifImageDesc ImageDesc;
-    GifByteType *RasterBits;         /* on malloc(3) heap */
-    int ExtensionBlockCount;         /* Count of extensions before image */
-    ExtensionBlock *ExtensionBlocks; /* Extensions before image */
+        GifImageDesc ImageDesc;
+        GifByteType *RasterBits;         /* on malloc(3) heap */
+        int ExtensionBlockCount;         /* Count of extensions before image */
+        ExtensionBlock *ExtensionBlocks; /* Extensions before image */
 } SavedImage;
 
 typedef struct GifFileType {
-    GifWord SWidth, SHeight;   /* Size of virtual canvas */
-    GifWord SColorResolution;  /* How many colors can we generate? */
-    GifWord SBackGroundColor;  /* Background color for virtual canvas */
-    GifByteType AspectByte;    /* Used to compute pixel aspect ratio */
-    ColorMapObject *SColorMap; /* Global colormap, NULL if nonexistent. */
-    int ImageCount;            /* Number of current image (both APIs) */
-    GifImageDesc Image;        /* Current image (low-level API) */
-    SavedImage *SavedImages;   /* Image sequence (high-level API) */
-    int ExtensionBlockCount;   /* Count extensions past last image */
-    ExtensionBlock *ExtensionBlocks; /* Extensions past last image */
-    int Error;                       /* Last error condition reported */
-    void *UserData;                  /* hook to attach user data (TVT) */
-    void *Private;                   /* Don't mess with this! */
+        GifWord SWidth, SHeight;   /* Size of virtual canvas */
+        GifWord SColorResolution;  /* How many colors can we generate? */
+        GifWord SBackGroundColor;  /* Background color for virtual canvas */
+        GifByteType AspectByte;    /* Used to compute pixel aspect ratio */
+        ColorMapObject *SColorMap; /* Global colormap, NULL if nonexistent. */
+        int ImageCount;            /* Number of current image (both APIs) */
+        GifImageDesc Image;        /* Current image (low-level API) */
+        SavedImage *SavedImages;   /* Image sequence (high-level API) */
+        int ExtensionBlockCount;   /* Count extensions past last image */
+        ExtensionBlock *ExtensionBlocks; /* Extensions past last image */
+        int Error;                       /* Last error condition reported */
+        void *UserData;                  /* hook to attach user data (TVT) */
+        void *Private;                   /* Don't mess with this! */
 } GifFileType;
 
 #define GIF_ASPECT_RATIO(n) ((n) + 15.0 / 64.0)
 
 typedef enum {
-    UNDEFINED_RECORD_TYPE,
-    SCREEN_DESC_RECORD_TYPE,
-    IMAGE_DESC_RECORD_TYPE, /* Begin with ',' */
-    EXTENSION_RECORD_TYPE,  /* Begin with '!' */
-    TERMINATE_RECORD_TYPE   /* Begin with ';' */
+        UNDEFINED_RECORD_TYPE,
+        SCREEN_DESC_RECORD_TYPE,
+        IMAGE_DESC_RECORD_TYPE, /* Begin with ',' */
+        EXTENSION_RECORD_TYPE,  /* Begin with '!' */
+        TERMINATE_RECORD_TYPE   /* Begin with ';' */
 } GifRecordType;
 
 /* func type to read gif data from arbitrary sources (TVT) */
@@ -133,14 +133,14 @@ typedef int (*OutputFunc)(GifFileType *, const GifByteType *, int);
 ******************************************************************************/
 
 typedef struct GraphicsControlBlock {
-    int DisposalMode;
+        int DisposalMode;
 #define DISPOSAL_UNSPECIFIED 0 /* No disposal specified. */
 #define DISPOSE_DO_NOT 1       /* Leave image in place */
 #define DISPOSE_BACKGROUND 2   /* Set area too background color */
 #define DISPOSE_PREVIOUS 3     /* Restore to previous content */
-    bool UserInputFlag;    /* User confirmation required before disposal */
-    int DelayTime;         /* pre-display delay in 0.01sec units */
-    int TransparentColor;  /* Palette index for transparency, -1 if none */
+        bool UserInputFlag;    /* User confirmation required before disposal */
+        int DelayTime;         /* pre-display delay in 0.01sec units */
+        int TransparentColor;  /* Palette index for transparency, -1 if none */
 #define NO_TRANSPARENT_COLOR -1
 } GraphicsControlBlock;
 
@@ -153,21 +153,21 @@ GifFileType *EGifOpenFileName(const char *GifFileName,
                               const bool GifTestExistence, int *Error);
 GifFileType *EGifOpenFileHandle(const int GifFileHandle, int *Error);
 GifFileType *EGifOpen(void *userPtr, OutputFunc writeFunc, int *Error);
-int EGifSpew(GifFileType *GifFile);
+int EGifSpew(GifFileType *GifFile, int *ErrorCode);
 const char *EGifGetGifVersion(GifFileType *GifFile); /* new in 5.x */
 int EGifCloseFile(GifFileType *GifFile, int *ErrorCode);
 
 #define E_GIF_SUCCEEDED 0
-#define E_GIF_ERR_OPEN_FAILED 1 /* And EGif possible errors. */
-#define E_GIF_ERR_WRITE_FAILED 2
-#define E_GIF_ERR_HAS_SCRN_DSCR 3
-#define E_GIF_ERR_HAS_IMAG_DSCR 4
-#define E_GIF_ERR_NO_COLOR_MAP 5
-#define E_GIF_ERR_DATA_TOO_BIG 6
-#define E_GIF_ERR_NOT_ENOUGH_MEM 7
-#define E_GIF_ERR_DISK_IS_FULL 8
-#define E_GIF_ERR_CLOSE_FAILED 9
-#define E_GIF_ERR_NOT_WRITEABLE 10
+#define E_GIF_ERR_OPEN_FAILED 201 /* And EGif possible errors. */
+#define E_GIF_ERR_WRITE_FAILED 202
+#define E_GIF_ERR_HAS_SCRN_DSCR 203
+#define E_GIF_ERR_HAS_IMAG_DSCR 204
+#define E_GIF_ERR_NO_COLOR_MAP 205
+#define E_GIF_ERR_DATA_TOO_BIG 206
+#define E_GIF_ERR_NOT_ENOUGH_MEM 207
+#define E_GIF_ERR_DISK_IS_FULL 208
+#define E_GIF_ERR_CLOSE_FAILED 209
+#define E_GIF_ERR_NOT_WRITEABLE 210
 
 /* These are legacy.  You probably do not want to call them directly */
 int EGifPutScreenDesc(GifFileType *GifFile, const int GifWidth,
diff --git a/src/java.desktop/share/native/libsplashscreen/giflib/gif_lib_private.h b/src/java.desktop/share/native/libsplashscreen/giflib/gif_lib_private.h
index f905e0d7b48..079d05898b4 100644
--- a/src/java.desktop/share/native/libsplashscreen/giflib/gif_lib_private.h
+++ b/src/java.desktop/share/native/libsplashscreen/giflib/gif_lib_private.h
@@ -60,30 +60,30 @@ SPDX-License-Identifier: MIT
 #define IS_WRITEABLE(Private) (Private->FileState & FILE_STATE_WRITE)
 
 typedef struct GifFilePrivateType {
-    GifWord FileState, FileHandle, /* Where all this data goes to! */
-        BitsPerPixel, /* Bits per pixel (Codes uses at least this + 1). */
-        ClearCode,    /* The CLEAR LZ code. */
-        EOFCode,      /* The EOF LZ code. */
-        RunningCode,  /* The next code algorithm can generate. */
-        RunningBits,  /* The number of bits required to represent
-                         RunningCode. */
-        MaxCode1, /* 1 bigger than max. possible code, in RunningBits bits.
-                   */
-        LastCode, /* The code before the current code. */
-        CrntCode, /* Current algorithm code. */
-        StackPtr, /* For character stack (see below). */
-        CrntShiftState;           /* Number of bits in CrntShiftDWord. */
-    unsigned long CrntShiftDWord; /* For bytes decomposition into codes. */
-    unsigned long PixelCount;     /* Number of pixels in image. */
-    FILE *File;                   /* File as stream. */
-    InputFunc Read;               /* function to read gif input (TVT) */
-    OutputFunc Write;             /* function to write gif output (MRB) */
-    GifByteType Buf[256];         /* Compressed input is buffered here. */
-    GifByteType Stack[LZ_MAX_CODE]; /* Decoded pixels are stacked here. */
-    GifByteType Suffix[LZ_MAX_CODE + 1]; /* So we can trace the codes. */
-    GifPrefixType Prefix[LZ_MAX_CODE + 1];
-    GifHashTableType *HashTable;
-    bool gif89;
+        GifWord FileState, FileHandle, /* Where all this data goes to! */
+            BitsPerPixel, /* Bits per pixel (Codes uses at least this + 1). */
+            ClearCode,    /* The CLEAR LZ code. */
+            EOFCode,      /* The EOF LZ code. */
+            RunningCode,  /* The next code algorithm can generate. */
+            RunningBits,  /* The number of bits required to represent
+                             RunningCode. */
+            MaxCode1, /* 1 bigger than max. possible code, in RunningBits bits.
+                       */
+            LastCode, /* The code before the current code. */
+            CrntCode, /* Current algorithm code. */
+            StackPtr, /* For character stack (see below). */
+            CrntShiftState;           /* Number of bits in CrntShiftDWord. */
+        unsigned long CrntShiftDWord; /* For bytes decomposition into codes. */
+        unsigned long PixelCount;     /* Number of pixels in image. */
+        FILE *File;                   /* File as stream. */
+        InputFunc Read;               /* function to read gif input (TVT) */
+        OutputFunc Write;             /* function to write gif output (MRB) */
+        GifByteType Buf[256];         /* Compressed input is buffered here. */
+        GifByteType Stack[LZ_MAX_CODE]; /* Decoded pixels are stacked here. */
+        GifByteType Suffix[LZ_MAX_CODE + 1]; /* So we can trace the codes. */
+        GifPrefixType Prefix[LZ_MAX_CODE + 1];
+        GifHashTableType *HashTable;
+        bool gif89;
 } GifFilePrivateType;
 
 #ifndef HAVE_REALLOCARRAY
diff --git a/src/java.desktop/share/native/libsplashscreen/giflib/gifalloc.c b/src/java.desktop/share/native/libsplashscreen/giflib/gifalloc.c
index 5aef3044558..aebf2d7662f 100644
--- a/src/java.desktop/share/native/libsplashscreen/giflib/gifalloc.c
+++ b/src/java.desktop/share/native/libsplashscreen/giflib/gifalloc.c
@@ -26,9 +26,9 @@
 
  GIF construction tools
 
-SPDX-License-Identifier: MIT
-
 ****************************************************************************/
+// SPDX-License-Identifier: MIT
+// SPDX-FileCopyrightText: Copyright (C) Eric S. Raymond <esr@thyrsus.com>
 
 #include <stdio.h>
 #include <stdlib.h>
@@ -45,14 +45,14 @@ SPDX-License-Identifier: MIT
 
 /* return smallest bitfield size n will fit in */
 int GifBitSize(int n) {
-    register int i;
+        register int i;
 
-    for (i = 1; i <= 8; i++) {
-        if ((1 << i) >= n) {
-            break;
+        for (i = 1; i <= 8; i++) {
+                if ((1 << i) >= n) {
+                        break;
+                }
         }
-    }
-    return (i);
+        return (i);
 }
 
 /******************************************************************************
@@ -64,64 +64,64 @@ int GifBitSize(int n) {
  * ColorMap if that pointer is non-NULL.
  */
 ColorMapObject *GifMakeMapObject(int ColorCount, const GifColorType *ColorMap) {
-    ColorMapObject *Object;
+        ColorMapObject *Object;
 
-    /*** FIXME: Our ColorCount has to be a power of two.  Is it necessary to
-     * make the user know that or should we automatically round up instead?
-     */
-    if (ColorCount != (1 << GifBitSize(ColorCount))) {
-        return ((ColorMapObject *)NULL);
-    }
+        /*** FIXME: Our ColorCount has to be a power of two.  Is it necessary to
+         * make the user know that or should we automatically round up instead?
+         */
+        if (ColorCount != (1 << GifBitSize(ColorCount))) {
+                return ((ColorMapObject *)NULL);
+        }
 
-    Object = (ColorMapObject *)malloc(sizeof(ColorMapObject));
-    if (Object == (ColorMapObject *)NULL) {
-        return ((ColorMapObject *)NULL);
-    }
+        Object = (ColorMapObject *)malloc(sizeof(ColorMapObject));
+        if (Object == (ColorMapObject *)NULL) {
+                return ((ColorMapObject *)NULL);
+        }
 
-    Object->Colors =
-        (GifColorType *)calloc(ColorCount, sizeof(GifColorType));
-    if (Object->Colors == (GifColorType *)NULL) {
-        free(Object);
-        return ((ColorMapObject *)NULL);
-    }
+        Object->Colors =
+            (GifColorType *)calloc(ColorCount, sizeof(GifColorType));
+        if (Object->Colors == (GifColorType *)NULL) {
+                free(Object);
+                return ((ColorMapObject *)NULL);
+        }
 
-    Object->ColorCount = ColorCount;
-    Object->BitsPerPixel = GifBitSize(ColorCount);
-    Object->SortFlag = false;
+        Object->ColorCount = ColorCount;
+        Object->BitsPerPixel = GifBitSize(ColorCount);
+        Object->SortFlag = false;
 
-    if (ColorMap != NULL) {
-        memcpy((char *)Object->Colors, (char *)ColorMap,
-               ColorCount * sizeof(GifColorType));
-    }
+        if (ColorMap != NULL) {
+                memcpy((char *)Object->Colors, (char *)ColorMap,
+                       ColorCount * sizeof(GifColorType));
+        }
 
-    return (Object);
+        return (Object);
 }
 
 /*******************************************************************************
  Free a color map object
 *******************************************************************************/
 void GifFreeMapObject(ColorMapObject *Object) {
-    if (Object != NULL) {
-        (void)free(Object->Colors);
-        (void)free(Object);
-    }
+        if (Object != NULL) {
+                (void)free(Object->Colors);
+                (void)free(Object);
+        }
 }
 
 #ifdef DEBUG
 void DumpColorMap(ColorMapObject *Object, FILE *fp) {
-    if (Object != NULL) {
-        int i, j, Len = Object->ColorCount;
+        if (Object != NULL) {
+                int i, j, Len = Object->ColorCount;
 
-        for (i = 0; i < Len; i += 4) {
-            for (j = 0; j < 4 && j < Len; j++) {
-                (void)fprintf(fp, "%3d: %02x %02x %02x   ",
-                              i + j, Object->Colors[i + j].Red,
-                              Object->Colors[i + j].Green,
-                              Object->Colors[i + j].Blue);
-            }
-            (void)fprintf(fp, "\n");
+                for (i = 0; i < Len; i += 4) {
+                        for (j = 0; j < 4 && j < Len; j++) {
+                                (void)fprintf(fp, "%3d: %02x %02x %02x   ",
+                                              i + j, Object->Colors[i + j].Red,
+                                              Object->Colors[i + j].Green,
+                                              Object->Colors[i + j].Blue);
+                        }
+                        (void)fprintf(fp, "\n");
+                }
         }
-    }
 }
 #endif /* DEBUG */
 
@@ -135,112 +135,112 @@ void DumpColorMap(ColorMapObject *Object, FILE *fp) {
 ColorMapObject *GifUnionColorMap(const ColorMapObject *ColorIn1,
                                  const ColorMapObject *ColorIn2,
                                  GifPixelType ColorTransIn2[]) {
-    int i, j, CrntSlot, RoundUpTo, NewGifBitSize;
-    ColorMapObject *ColorUnion;
-
-    /*
-     * We don't worry about duplicates within either color map; if
-     * the caller wants to resolve those, he can perform unions
-     * with an empty color map.
-     */
-
-    /* Allocate table which will hold the result for sure. */
-    ColorUnion = GifMakeMapObject(
-        MAX(ColorIn1->ColorCount, ColorIn2->ColorCount) * 2, NULL);
-
-    if (ColorUnion == NULL) {
-        return (NULL);
-    }
-
-    /*
-     * Copy ColorIn1 to ColorUnion.
-     */
-    for (i = 0; i < ColorIn1->ColorCount; i++) {
-        ColorUnion->Colors[i] = ColorIn1->Colors[i];
-    }
-    CrntSlot = ColorIn1->ColorCount;
-
-    /*
-     * Potentially obnoxious hack:
-     *
-     * Back CrntSlot down past all contiguous {0, 0, 0} slots at the end
-     * of table 1.  This is very useful if your display is limited to
-     * 16 colors.
-     */
-    while (ColorIn1->Colors[CrntSlot - 1].Red == 0 &&
-           ColorIn1->Colors[CrntSlot - 1].Green == 0 &&
-           ColorIn1->Colors[CrntSlot - 1].Blue == 0) {
-        CrntSlot--;
-    }
-
-    /* Copy ColorIn2 to ColorUnion (use old colors if they exist): */
-    for (i = 0; i < ColorIn2->ColorCount && CrntSlot <= 256; i++) {
-        /* Let's see if this color already exists: */
-        for (j = 0; j < ColorIn1->ColorCount; j++) {
-            if (memcmp(&ColorIn1->Colors[j], &ColorIn2->Colors[i],
-                       sizeof(GifColorType)) == 0) {
-                break;
-            }
-        }
-
-        if (j < ColorIn1->ColorCount) {
-            ColorTransIn2[i] = j; /* color exists in Color1 */
-        } else {
-            /* Color is new - copy it to a new slot: */
-            ColorUnion->Colors[CrntSlot] = ColorIn2->Colors[i];
-            ColorTransIn2[i] = CrntSlot++;
-        }
-    }
-
-    if (CrntSlot > 256) {
-        GifFreeMapObject(ColorUnion);
-        return ((ColorMapObject *)NULL);
-    }
-
-    NewGifBitSize = GifBitSize(CrntSlot);
-    RoundUpTo = (1 << NewGifBitSize);
-
-    if (RoundUpTo != ColorUnion->ColorCount) {
-        register GifColorType *Map = ColorUnion->Colors;
+        int i, j, CrntSlot, RoundUpTo, NewGifBitSize;
+        ColorMapObject *ColorUnion;
 
         /*
-         * Zero out slots up to next power of 2.
-         * We know these slots exist because of the way ColorUnion's
-         * start dimension was computed.
+         * We don't worry about duplicates within either color map; if
+         * the caller wants to resolve those, he can perform unions
+         * with an empty color map.
          */
-        for (j = CrntSlot; j < RoundUpTo; j++) {
-            Map[j].Red = Map[j].Green = Map[j].Blue = 0;
+
+        /* Allocate table which will hold the result for sure. */
+        ColorUnion = GifMakeMapObject(
+            MAX(ColorIn1->ColorCount, ColorIn2->ColorCount) * 2, NULL);
+
+        if (ColorUnion == NULL) {
+                return (NULL);
         }
 
-        /* perhaps we can shrink the map? */
-        if (RoundUpTo < ColorUnion->ColorCount) {
-            GifColorType *new_map = (GifColorType *)reallocarray(
-                Map, RoundUpTo, sizeof(GifColorType));
-            if (new_map == NULL) {
+        /*
+         * Copy ColorIn1 to ColorUnion.
+         */
+        for (i = 0; i < ColorIn1->ColorCount; i++) {
+                ColorUnion->Colors[i] = ColorIn1->Colors[i];
+        }
+        CrntSlot = ColorIn1->ColorCount;
+
+        /*
+         * Potentially obnoxious hack:
+         *
+         * Back CrntSlot down past all contiguous {0, 0, 0} slots at the end
+         * of table 1.  This is very useful if your display is limited to
+         * 16 colors.
+         */
+        while (ColorIn1->Colors[CrntSlot - 1].Red == 0 &&
+               ColorIn1->Colors[CrntSlot - 1].Green == 0 &&
+               ColorIn1->Colors[CrntSlot - 1].Blue == 0) {
+                CrntSlot--;
+        }
+
+        /* Copy ColorIn2 to ColorUnion (use old colors if they exist): */
+        for (i = 0; i < ColorIn2->ColorCount && CrntSlot <= 256; i++) {
+                /* Let's see if this color already exists: */
+                for (j = 0; j < ColorIn1->ColorCount; j++) {
+                        if (memcmp(&ColorIn1->Colors[j], &ColorIn2->Colors[i],
+                                   sizeof(GifColorType)) == 0) {
+                                break;
+                        }
+                }
+
+                if (j < ColorIn1->ColorCount) {
+                        ColorTransIn2[i] = j; /* color exists in Color1 */
+                } else {
+                        /* Color is new - copy it to a new slot: */
+                        ColorUnion->Colors[CrntSlot] = ColorIn2->Colors[i];
+                        ColorTransIn2[i] = CrntSlot++;
+                }
+        }
+
+        if (CrntSlot > 256) {
                 GifFreeMapObject(ColorUnion);
                 return ((ColorMapObject *)NULL);
-            }
-            ColorUnion->Colors = new_map;
         }
-    }
 
-    ColorUnion->ColorCount = RoundUpTo;
-    ColorUnion->BitsPerPixel = NewGifBitSize;
+        NewGifBitSize = GifBitSize(CrntSlot);
+        RoundUpTo = (1 << NewGifBitSize);
 
-    return (ColorUnion);
+        if (RoundUpTo != ColorUnion->ColorCount) {
+                register GifColorType *Map = ColorUnion->Colors;
+
+                /*
+                 * Zero out slots up to next power of 2.
+                 * We know these slots exist because of the way ColorUnion's
+                 * start dimension was computed.
+                 */
+                for (j = CrntSlot; j < RoundUpTo; j++) {
+                        Map[j].Red = Map[j].Green = Map[j].Blue = 0;
+                }
+
+                /* perhaps we can shrink the map? */
+                if (RoundUpTo < ColorUnion->ColorCount) {
+                        GifColorType *new_map = (GifColorType *)reallocarray(
+                            Map, RoundUpTo, sizeof(GifColorType));
+                        if (new_map == NULL) {
+                                GifFreeMapObject(ColorUnion);
+                                return ((ColorMapObject *)NULL);
+                        }
+                        ColorUnion->Colors = new_map;
+                }
+        }
+
+        ColorUnion->ColorCount = RoundUpTo;
+        ColorUnion->BitsPerPixel = NewGifBitSize;
+
+        return (ColorUnion);
 }
 
 /*******************************************************************************
  Apply a given color translation to the raster bits of an image
 *******************************************************************************/
 void GifApplyTranslation(SavedImage *Image, const GifPixelType Translation[]) {
-    register int i;
-    register int RasterSize =
-        Image->ImageDesc.Height * Image->ImageDesc.Width;
+        register int i;
+        register int RasterSize =
+            Image->ImageDesc.Height * Image->ImageDesc.Width;
 
-    for (i = 0; i < RasterSize; i++) {
-        Image->RasterBits[i] = Translation[Image->RasterBits[i]];
-    }
+        for (i = 0; i < RasterSize; i++) {
+                Image->RasterBits[i] = Translation[Image->RasterBits[i]];
+        }
 }
 
 /******************************************************************************
@@ -249,56 +249,56 @@ void GifApplyTranslation(SavedImage *Image, const GifPixelType Translation[]) {
 int GifAddExtensionBlock(int *ExtensionBlockCount,
                          ExtensionBlock **ExtensionBlocks, int Function,
                          unsigned int Len, unsigned char ExtData[]) {
-    ExtensionBlock *ep;
+        ExtensionBlock *ep;
 
-    if (*ExtensionBlocks == NULL) {
-        *ExtensionBlocks =
-            (ExtensionBlock *)malloc(sizeof(ExtensionBlock));
-    } else {
-        ExtensionBlock *ep_new = (ExtensionBlock *)reallocarray(
-            *ExtensionBlocks, (*ExtensionBlockCount + 1),
-            sizeof(ExtensionBlock));
-        if (ep_new == NULL) {
-            return (GIF_ERROR);
+        if (*ExtensionBlocks == NULL) {
+                *ExtensionBlocks =
+                    (ExtensionBlock *)malloc(sizeof(ExtensionBlock));
+        } else {
+                ExtensionBlock *ep_new = (ExtensionBlock *)reallocarray(
+                    *ExtensionBlocks, (*ExtensionBlockCount + 1),
+                    sizeof(ExtensionBlock));
+                if (ep_new == NULL) {
+                        return (GIF_ERROR);
+                }
+                *ExtensionBlocks = ep_new;
         }
-        *ExtensionBlocks = ep_new;
-    }
 
-    if (*ExtensionBlocks == NULL) {
-        return (GIF_ERROR);
-    }
+        if (*ExtensionBlocks == NULL) {
+                return (GIF_ERROR);
+        }
 
-    ep = &(*ExtensionBlocks)[(*ExtensionBlockCount)++];
+        ep = &(*ExtensionBlocks)[(*ExtensionBlockCount)++];
 
-    ep->Function = Function;
-    ep->ByteCount = Len;
-    ep->Bytes = (GifByteType *)malloc(ep->ByteCount);
-    if (ep->Bytes == NULL) {
-        return (GIF_ERROR);
-    }
+        ep->Function = Function;
+        ep->ByteCount = Len;
+        ep->Bytes = (GifByteType *)malloc(ep->ByteCount);
+        if (ep->Bytes == NULL) {
+                return (GIF_ERROR);
+        }
 
-    if (ExtData != NULL) {
-        memcpy(ep->Bytes, ExtData, Len);
-    }
+        if (ExtData != NULL) {
+                memcpy(ep->Bytes, ExtData, Len);
+        }
 
-    return (GIF_OK);
+        return (GIF_OK);
 }
 
 void GifFreeExtensions(int *ExtensionBlockCount,
                        ExtensionBlock **ExtensionBlocks) {
-    ExtensionBlock *ep;
+        ExtensionBlock *ep;
 
-    if (*ExtensionBlocks == NULL) {
-        return;
-    }
+        if (*ExtensionBlocks == NULL) {
+                return;
+        }
 
-    for (ep = *ExtensionBlocks;
-         ep < (*ExtensionBlocks + *ExtensionBlockCount); ep++) {
-        (void)free((char *)ep->Bytes);
-    }
-    (void)free((char *)*ExtensionBlocks);
-    *ExtensionBlocks = NULL;
-    *ExtensionBlockCount = 0;
+        for (ep = *ExtensionBlocks;
+             ep < (*ExtensionBlocks + *ExtensionBlockCount); ep++) {
+                (void)free((char *)ep->Bytes);
+        }
+        (void)free((char *)*ExtensionBlocks);
+        *ExtensionBlocks = NULL;
+        *ExtensionBlockCount = 0;
 }
 
 /******************************************************************************
@@ -309,37 +309,37 @@ void GifFreeExtensions(int *ExtensionBlockCount,
  * Frees the last image in the GifFile->SavedImages array
  */
 void FreeLastSavedImage(GifFileType *GifFile) {
-    SavedImage *sp;
+        SavedImage *sp;
 
-    if ((GifFile == NULL) || (GifFile->SavedImages == NULL)) {
-        return;
-    }
+        if ((GifFile == NULL) || (GifFile->SavedImages == NULL)) {
+                return;
+        }
 
-    /* Remove one SavedImage from the GifFile */
-    GifFile->ImageCount--;
-    sp = &GifFile->SavedImages[GifFile->ImageCount];
+        /* Remove one SavedImage from the GifFile */
+        GifFile->ImageCount--;
+        sp = &GifFile->SavedImages[GifFile->ImageCount];
 
-    /* Deallocate its Colormap */
-    if (sp->ImageDesc.ColorMap != NULL) {
-        GifFreeMapObject(sp->ImageDesc.ColorMap);
-        sp->ImageDesc.ColorMap = NULL;
-    }
+        /* Deallocate its Colormap */
+        if (sp->ImageDesc.ColorMap != NULL) {
+                GifFreeMapObject(sp->ImageDesc.ColorMap);
+                sp->ImageDesc.ColorMap = NULL;
+        }
 
-    /* Deallocate the image data */
-    if (sp->RasterBits != NULL) {
-        free((char *)sp->RasterBits);
-    }
+        /* Deallocate the image data */
+        if (sp->RasterBits != NULL) {
+                free((char *)sp->RasterBits);
+        }
 
-    /* Deallocate any extensions */
-    GifFreeExtensions(&sp->ExtensionBlockCount, &sp->ExtensionBlocks);
+        /* Deallocate any extensions */
+        GifFreeExtensions(&sp->ExtensionBlockCount, &sp->ExtensionBlocks);
 
-    /*** FIXME: We could realloc the GifFile->SavedImages structure but is
-     * there a point to it? Saves some memory but we'd have to do it every
-     * time.  If this is used in GifFreeSavedImages then it would be
-     * inefficient (The whole array is going to be deallocated.)  If we just
-     * use it when we want to free the last Image it's convenient to do it
-     * here.
-     */
+        /*** FIXME: We could realloc the GifFile->SavedImages structure but is
+         * there a point to it? Saves some memory but we'd have to do it every
+         * time.  If this is used in GifFreeSavedImages then it would be
+         * inefficient (The whole array is going to be deallocated.)  If we just
+         * use it when we want to free the last Image it's convenient to do it
+         * here.
+         */
 }
 
 /*
@@ -347,103 +347,121 @@ void FreeLastSavedImage(GifFileType *GifFile) {
  */
 SavedImage *GifMakeSavedImage(GifFileType *GifFile,
                               const SavedImage *CopyFrom) {
-    // cppcheck-suppress ctunullpointer
-    if (GifFile->SavedImages == NULL) {
-        GifFile->SavedImages = (SavedImage *)malloc(sizeof(SavedImage));
-    } else {
-        SavedImage *newSavedImages = (SavedImage *)reallocarray(
-            GifFile->SavedImages, (GifFile->ImageCount + 1),
-            sizeof(SavedImage));
-        if (newSavedImages == NULL) {
-            return ((SavedImage *)NULL);
-        }
-        GifFile->SavedImages = newSavedImages;
-    }
-    if (GifFile->SavedImages == NULL) {
-        return ((SavedImage *)NULL);
-    } else {
-        SavedImage *sp = &GifFile->SavedImages[GifFile->ImageCount++];
-
-        if (CopyFrom != NULL) {
-            memcpy((char *)sp, CopyFrom, sizeof(SavedImage));
-
-            /*
-             * Make our own allocated copies of the heap fields in
-             * the copied record.  This guards against potential
-             * aliasing problems.
-             */
-
-            /* first, the local color map */
-            if (CopyFrom->ImageDesc.ColorMap != NULL) {
-                sp->ImageDesc.ColorMap = GifMakeMapObject(
-                    CopyFrom->ImageDesc.ColorMap->ColorCount,
-                    CopyFrom->ImageDesc.ColorMap->Colors);
-                if (sp->ImageDesc.ColorMap == NULL) {
-                    FreeLastSavedImage(GifFile);
-                    return (SavedImage *)(NULL);
-                }
-            }
-
-            /* next, the raster */
-            sp->RasterBits = (unsigned char *)reallocarray(
-                NULL,
-                (CopyFrom->ImageDesc.Height *
-                 CopyFrom->ImageDesc.Width),
-                sizeof(GifPixelType));
-            if (sp->RasterBits == NULL) {
-                FreeLastSavedImage(GifFile);
-                return (SavedImage *)(NULL);
-            }
-            memcpy(sp->RasterBits, CopyFrom->RasterBits,
-                   sizeof(GifPixelType) *
-                       CopyFrom->ImageDesc.Height *
-                       CopyFrom->ImageDesc.Width);
-
-            /* finally, the extension blocks */
-            if (CopyFrom->ExtensionBlocks != NULL) {
-                sp->ExtensionBlocks =
-                    (ExtensionBlock *)reallocarray(
-                        NULL, CopyFrom->ExtensionBlockCount,
-                        sizeof(ExtensionBlock));
-                if (sp->ExtensionBlocks == NULL) {
-                    FreeLastSavedImage(GifFile);
-                    return (SavedImage *)(NULL);
-                }
-                memcpy(sp->ExtensionBlocks,
-                       CopyFrom->ExtensionBlocks,
-                       sizeof(ExtensionBlock) *
-                           CopyFrom->ExtensionBlockCount);
-            }
+        // cppcheck-suppress ctunullpointer
+        if (GifFile->SavedImages == NULL) {
+                GifFile->SavedImages = (SavedImage *)malloc(sizeof(SavedImage));
         } else {
-            memset((char *)sp, '\0', sizeof(SavedImage));
+                SavedImage *newSavedImages = (SavedImage *)reallocarray(
+                    GifFile->SavedImages, (GifFile->ImageCount + 1),
+                    sizeof(SavedImage));
+                if (newSavedImages == NULL) {
+                        return ((SavedImage *)NULL);
+                }
+                GifFile->SavedImages = newSavedImages;
         }
+        if (GifFile->SavedImages == NULL) {
+                return ((SavedImage *)NULL);
+        } else {
+                SavedImage *sp = &GifFile->SavedImages[GifFile->ImageCount++];
 
-        return (sp);
-    }
+                if (CopyFrom != NULL) {
+                        memcpy((char *)sp, CopyFrom, sizeof(SavedImage));
+
+                        /*
+                         * Make our own allocated copies of the heap fields in
+                         * the copied record.  This guards against potential
+                         * aliasing problems.
+                         */
+
+                        /* first, the local color map */
+                        if (CopyFrom->ImageDesc.ColorMap != NULL) {
+                                sp->ImageDesc.ColorMap = GifMakeMapObject(
+                                    CopyFrom->ImageDesc.ColorMap->ColorCount,
+                                    CopyFrom->ImageDesc.ColorMap->Colors);
+                                if (sp->ImageDesc.ColorMap == NULL) {
+                                        FreeLastSavedImage(GifFile);
+                                        return (SavedImage *)(NULL);
+                                }
+                        }
+
+                        /* next, the raster */
+                        sp->RasterBits = (unsigned char *)reallocarray(
+                            NULL,
+                            (CopyFrom->ImageDesc.Height *
+                             CopyFrom->ImageDesc.Width),
+                            sizeof(GifPixelType));
+                        if (sp->RasterBits == NULL) {
+                                FreeLastSavedImage(GifFile);
+                                return (SavedImage *)(NULL);
+                        }
+                        memcpy(sp->RasterBits, CopyFrom->RasterBits,
+                               sizeof(GifPixelType) *
+                                   CopyFrom->ImageDesc.Height *
+                                   CopyFrom->ImageDesc.Width);
+
+                        /* finally, the extension blocks */
+                        if (CopyFrom->ExtensionBlocks != NULL) {
+                                int k;
+                                sp->ExtensionBlocks =
+                                    (ExtensionBlock *)calloc(
+                                        CopyFrom->ExtensionBlockCount,
+                                        sizeof(ExtensionBlock));
+                                if (sp->ExtensionBlocks == NULL) {
+                                        FreeLastSavedImage(GifFile);
+                                        return (SavedImage *)(NULL);
+                                }
+                                for (k = 0; k < CopyFrom->ExtensionBlockCount;
+                                     k++) {
+                                        ExtensionBlock *dst =
+                                            &sp->ExtensionBlocks[k];
+                                        ExtensionBlock *src =
+                                            &CopyFrom->ExtensionBlocks[k];
+                                        dst->Function = src->Function;
+                                        dst->ByteCount = src->ByteCount;
+                                        if (src->ByteCount > 0) {
+                                                dst->Bytes =
+                                                    (GifByteType *)malloc(
+                                                        src->ByteCount);
+                                                if (dst->Bytes == NULL) {
+                                                        FreeLastSavedImage(
+                                                            GifFile);
+                                                        return (SavedImage *)(NULL);
+                                                }
+                                                memcpy(dst->Bytes, src->Bytes,
+                                                       src->ByteCount);
+                                        }
+                                }
+                        }
+                } else {
+                        memset((char *)sp, '\0', sizeof(SavedImage));
+                }
+
+                return (sp);
+        }
 }
 
 void GifFreeSavedImages(GifFileType *GifFile) {
-    SavedImage *sp;
+        SavedImage *sp;
 
-    if ((GifFile == NULL) || (GifFile->SavedImages == NULL)) {
-        return;
-    }
-    for (sp = GifFile->SavedImages;
-         sp < GifFile->SavedImages + GifFile->ImageCount; sp++) {
-        if (sp->ImageDesc.ColorMap != NULL) {
-            GifFreeMapObject(sp->ImageDesc.ColorMap);
-            sp->ImageDesc.ColorMap = NULL;
+        if ((GifFile == NULL) || (GifFile->SavedImages == NULL)) {
+                return;
         }
+        for (sp = GifFile->SavedImages;
+             sp < GifFile->SavedImages + GifFile->ImageCount; sp++) {
+                if (sp->ImageDesc.ColorMap != NULL) {
+                        GifFreeMapObject(sp->ImageDesc.ColorMap);
+                        sp->ImageDesc.ColorMap = NULL;
+                }
 
-        if (sp->RasterBits != NULL) {
-            free((char *)sp->RasterBits);
+                if (sp->RasterBits != NULL) {
+                        free((char *)sp->RasterBits);
+                }
+
+                GifFreeExtensions(&sp->ExtensionBlockCount,
+                                  &sp->ExtensionBlocks);
         }
-
-        GifFreeExtensions(&sp->ExtensionBlockCount,
-                          &sp->ExtensionBlocks);
-    }
-    free((char *)GifFile->SavedImages);
-    GifFile->SavedImages = NULL;
+        free((char *)GifFile->SavedImages);
+        GifFile->SavedImages = NULL;
 }
 
 /* end */
diff --git a/src/java.desktop/share/native/libsplashscreen/giflib/openbsd-reallocarray.c b/src/java.desktop/share/native/libsplashscreen/giflib/openbsd-reallocarray.c
index 7420af674c5..57504fceaa9 100644
--- a/src/java.desktop/share/native/libsplashscreen/giflib/openbsd-reallocarray.c
+++ b/src/java.desktop/share/native/libsplashscreen/giflib/openbsd-reallocarray.c
@@ -22,9 +22,8 @@
  * questions.
  */
 
-/*    $OpenBSD: reallocarray.c,v 1.1 2014/05/08 21:43:49 deraadt Exp $    */
 /*
- * Copyright (c) 2008 Otto Moerbeek <otto@drijf.net>
+ * SPDX-FileCopyrightText: Copyright (C) 2008 Otto Moerbeek <otto@drijf.net>
  * SPDX-License-Identifier: MIT
  */
 
@@ -44,55 +43,55 @@
 #define MUL_NO_OVERFLOW ((size_t)1 << (sizeof(size_t) * 4))
 
 void *openbsd_reallocarray(void *optr, size_t nmemb, size_t size) {
-    if ((nmemb >= MUL_NO_OVERFLOW || size >= MUL_NO_OVERFLOW) &&
-        nmemb > 0 && SIZE_MAX / nmemb < size) {
-        errno = ENOMEM;
-        return NULL;
-    }
-    /*
-     * Head off variations in realloc behavior on different
-     * platforms (reported by MarkR <mrogers6@users.sf.net>)
-     *
-     * The behaviour of reallocarray is implementation-defined if
-     * nmemb or size is zero. It can return NULL or non-NULL
-     * depending on the platform.
-     * https://www.securecoding.cert.org/confluence/display/c/MEM04-C.Beware+of+zero-lengthallocations
-     *
-     * Here are some extracts from realloc man pages on different platforms.
-     *
-     * void realloc( void memblock, size_t size );
-     *
-     * Windows:
-     *
-     * If there is not enough available memory to expand the block
-     * to the given size, the original block is left unchanged,
-     * and NULL is returned.  If size is zero, then the block
-     * pointed to by memblock is freed; the return value is NULL,
-     * and memblock is left pointing at a freed block.
-     *
-     * OpenBSD:
-     *
-     * If size or nmemb is equal to 0, a unique pointer to an
-     * access protected, zero sized object is returned. Access via
-     * this pointer will generate a SIGSEGV exception.
-     *
-     * Linux:
-     *
-     * If size was equal to 0, either NULL or a pointer suitable
-     * to be passed to free() is returned.
-     *
-     * OS X:
-     *
-     * If size is zero and ptr is not NULL, a new, minimum sized
-     * object is allocated and the original object is freed.
-     *
-     * It looks like images with zero width or height can trigger
-     * this, and fuzzing behaviour will differ by platform, so
-     * fuzzing on one platform may not detect zero-size allocation
-     * problems on other platforms.
-     */
-    if (size == 0 || nmemb == 0) {
-        return NULL;
-    }
-    return realloc(optr, size * nmemb);
+        if ((nmemb >= MUL_NO_OVERFLOW || size >= MUL_NO_OVERFLOW) &&
+            nmemb > 0 && SIZE_MAX / nmemb < size) {
+                errno = ENOMEM;
+                return NULL;
+        }
+        /*
+         * Head off variations in realloc behavior on different
+         * platforms (reported by MarkR <mrogers6@users.sf.net>)
+         *
+         * The behaviour of reallocarray is implementation-defined if
+         * nmemb or size is zero. It can return NULL or non-NULL
+         * depending on the platform.
+         * https://www.securecoding.cert.org/confluence/display/c/MEM04-C.Beware+of+zero-lengthallocations
+         *
+         * Here are some extracts from realloc man pages on different platforms.
+         *
+         * void realloc( void memblock, size_t size );
+         *
+         * Windows:
+         *
+         * If there is not enough available memory to expand the block
+         * to the given size, the original block is left unchanged,
+         * and NULL is returned.  If size is zero, then the block
+         * pointed to by memblock is freed; the return value is NULL,
+         * and memblock is left pointing at a freed block.
+         *
+         * OpenBSD:
+         *
+         * If size or nmemb is equal to 0, a unique pointer to an
+         * access protected, zero sized object is returned. Access via
+         * this pointer will generate a SIGSEGV exception.
+         *
+         * Linux:
+         *
+         * If size was equal to 0, either NULL or a pointer suitable
+         * to be passed to free() is returned.
+         *
+         * OS X:
+         *
+         * If size is zero and ptr is not NULL, a new, minimum sized
+         * object is allocated and the original object is freed.
+         *
+         * It looks like images with zero width or height can trigger
+         * this, and fuzzing behaviour will differ by platform, so
+         * fuzzing on one platform may not detect zero-size allocation
+         * problems on other platforms.
+         */
+        if (size == 0 || nmemb == 0) {
+                return NULL;
+        }
+        return realloc(optr, size * nmemb);
 }

From 58bf76adfd93303bdd78862ae3677b514754d34d Mon Sep 17 00:00:00 2001
From: Dingli Zhang <dzhang@openjdk.org>
Date: Wed, 11 Mar 2026 02:41:36 +0000
Subject: [PATCH 142/655] 8379464: Enable missing stack walking test via jtreg
 requires for RISC-V

Reviewed-by: fyang
---
 .../jtreg/runtime/ErrorHandling/StackWalkNativeToJava.java      | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/test/hotspot/jtreg/runtime/ErrorHandling/StackWalkNativeToJava.java b/test/hotspot/jtreg/runtime/ErrorHandling/StackWalkNativeToJava.java
index a964a61003a..1e29afe5ff8 100644
--- a/test/hotspot/jtreg/runtime/ErrorHandling/StackWalkNativeToJava.java
+++ b/test/hotspot/jtreg/runtime/ErrorHandling/StackWalkNativeToJava.java
@@ -33,7 +33,7 @@ import java.util.List;
  * @test StackWalkNativeToJava
  * @bug 8316309
  * @summary Check that walking the stack works fine when going from C++ frame to Java frame.
- * @requires os.arch=="amd64" | os.arch=="x86_64" | os.arch=="aarch64"
+ * @requires os.arch=="amd64" | os.arch=="x86_64" | os.arch=="aarch64" | os.arch=="riscv64"
  * @requires os.family != "windows"
  * @requires vm.flagless
  * @library /test/lib

From 20ae5279cb458733de07b5c1411c67ae7998fba4 Mon Sep 17 00:00:00 2001
From: Jaikiran Pai <jpai@openjdk.org>
Date: Wed, 11 Mar 2026 04:52:26 +0000
Subject: [PATCH 143/655] 8379477: Tests in test/jdk/com/sun/net/httpserver/
 may need to use othervm

Reviewed-by: vyazici
---
 .../sun/net/httpserver/TaskRejectedTest.java  | 32 ++++++++------
 test/jdk/com/sun/net/httpserver/Test13.java   | 44 +++++++++++--------
 test/jdk/com/sun/net/httpserver/Test7a.java   | 27 +++++-------
 test/jdk/com/sun/net/httpserver/Test8a.java   | 26 +++++------
 .../com/sun/net/httpserver/TestLogging.java   | 41 ++++++++++-------
 .../com/sun/net/httpserver/bugs/B6886436.java | 36 ++++++++-------
 .../com/sun/net/httpserver/bugs/B8211420.java | 32 ++++++++------
 .../httpserver/bugs/ExceptionKeepAlive.java   | 40 +++++++++--------
 .../bugs/FixedLengthInputStream.java          | 43 +++++++++---------
 .../bugs/HandlerConnectionClose.java          | 44 ++++++++++---------
 .../net/httpserver/bugs/HeadKeepAlive.java    | 40 +++++++++--------
 .../httpserver/bugs/TruncatedRequestBody.java | 32 +++++++++-----
 .../bugs/ZeroLengthOutputStream.java          | 41 +++++++++--------
 13 files changed, 257 insertions(+), 221 deletions(-)

diff --git a/test/jdk/com/sun/net/httpserver/TaskRejectedTest.java b/test/jdk/com/sun/net/httpserver/TaskRejectedTest.java
index 6b6d53fd3a3..109d28627dc 100644
--- a/test/jdk/com/sun/net/httpserver/TaskRejectedTest.java
+++ b/test/jdk/com/sun/net/httpserver/TaskRejectedTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -21,11 +21,6 @@
  * questions.
  */
 
-/**
- * @test
- * @bug 8169358
- * @summary  HttpServer does not close client connection when RejectedExecutionException occurs.
- */
 
 import com.sun.net.httpserver.HttpServer;
 
@@ -46,6 +41,14 @@ import java.util.logging.Level;
 import java.util.logging.Logger;
 import static com.sun.net.httpserver.HttpExchange.RSPBODY_EMPTY;
 
+/*
+ * @test
+ * @bug 8169358
+ * @summary  HttpServer does not close client connection when RejectedExecutionException occurs.
+ * @comment We use othervm because this test configures logging handlers
+ *          for the system wide "com.sun.net.httpserver" logger
+ * @run main/othervm ${test.main.class}
+ */
 public class TaskRejectedTest {
 
     private static final int BACKLOG = 0;
@@ -54,6 +57,15 @@ public class TaskRejectedTest {
 
     private static final int TIMEOUT = 10000; // 10 sec
 
+    private static final Logger logger = Logger.getLogger("com.sun.net.httpserver");
+
+    private static void setupLogging() {
+        final Handler consoleHandler = new ConsoleHandler();
+        consoleHandler.setLevel(Level.FINEST);
+        logger.setLevel(Level.FINEST);
+        logger.addHandler(consoleHandler);
+    }
+
     private static void runClient(InetSocketAddress listenAddr)
                                      throws MalformedURLException, IOException {
         URL url = new URL("http", listenAddr.getHostString(),
@@ -75,13 +87,7 @@ public class TaskRejectedTest {
     }
 
     public static void main(String[] args) throws Exception {
-        Logger logger = Logger.getLogger(
-                            HttpServer.class.getPackage().getName());
-        Handler consoleHandler = new ConsoleHandler();
-        consoleHandler.setLevel(Level.FINEST);
-        logger.setLevel(Level.FINEST);
-        logger.addHandler(consoleHandler);
-
+        setupLogging(); // merely for debugging
         Executor executor = Executors.newSingleThreadExecutor(r -> {
             throw new RejectedExecutionException("test");
         });
diff --git a/test/jdk/com/sun/net/httpserver/Test13.java b/test/jdk/com/sun/net/httpserver/Test13.java
index 0401dbce5a8..503b9e4430c 100644
--- a/test/jdk/com/sun/net/httpserver/Test13.java
+++ b/test/jdk/com/sun/net/httpserver/Test13.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2005, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2005, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -21,19 +21,6 @@
  * questions.
  */
 
-/*
- * @test
- * @bug 6270015
- * @library /test/lib
- * @build jdk.test.lib.Asserts
- *        jdk.test.lib.Utils
- *        jdk.test.lib.net.SimpleSSLContext
- *        jdk.test.lib.net.URIBuilder
- * @run main/othervm Test13
- * @run main/othervm -Djava.net.preferIPv6Addresses=true Test13
- * @summary Light weight HTTP server
- */
-
 import com.sun.net.httpserver.*;
 
 import java.nio.file.Files;
@@ -54,6 +41,20 @@ import static jdk.test.lib.Utils.createTempFileOfSize;
  *      - same as Test12, but with 64 threads
  */
 
+/*
+ * @test
+ * @bug 6270015
+ * @summary Light weight HTTP server
+ * @library /test/lib
+ * @build jdk.test.lib.Asserts
+ *        jdk.test.lib.Utils
+ *        jdk.test.lib.net.SimpleSSLContext
+ *        jdk.test.lib.net.URIBuilder
+ * @comment We use othervm because this test configures logging handlers
+ *          for the system wide "com.sun.net.httpserver" logger
+ * @run main/othervm ${test.main.class}
+ * @run main/othervm -Djava.net.preferIPv6Addresses=true ${test.main.class}
+ */
 public class Test13 extends Test {
 
     private static final String TEMP_FILE_PREFIX =
@@ -61,20 +62,25 @@ public class Test13 extends Test {
 
     private static final SSLContext ctx = SimpleSSLContext.findSSLContext();
 
+    private static final Logger logger = Logger.getLogger ("com.sun.net.httpserver");
+
     final static int NUM = 32; // was 32
 
     static boolean fail = false;
 
+    private static void setupLogging() {
+        final Handler handler = new ConsoleHandler();
+        handler.setLevel(Level.ALL);
+        logger.setLevel(Level.ALL);
+        logger.addHandler(handler);
+    }
+
     public static void main (String[] args) throws Exception {
         HttpServer s1 = null;
         HttpsServer s2 = null;
         ExecutorService executor=null;
         Path filePath = createTempFileOfSize(TEMP_FILE_PREFIX, null, 23);
-        Logger l = Logger.getLogger ("com.sun.net.httpserver");
-        Handler ha = new ConsoleHandler();
-        ha.setLevel(Level.ALL);
-        l.setLevel(Level.ALL);
-        l.addHandler(ha);
+        setupLogging(); // merely for debugging
         InetAddress loopback = InetAddress.getLoopbackAddress();
         try {
             System.out.print ("Test13: ");
diff --git a/test/jdk/com/sun/net/httpserver/Test7a.java b/test/jdk/com/sun/net/httpserver/Test7a.java
index 8bda4ae8348..832238b2b47 100644
--- a/test/jdk/com/sun/net/httpserver/Test7a.java
+++ b/test/jdk/com/sun/net/httpserver/Test7a.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2005, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2005, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -21,16 +21,6 @@
  * questions.
  */
 
-/**
- * @test
- * @bug 6270015
- * @library /test/lib
- * @build jdk.test.lib.net.SimpleSSLContext jdk.test.lib.net.URIBuilder
- * @run main/othervm Test7a
- * @run main/othervm -Djava.net.preferIPv6Addresses=true Test7a
- * @summary Light weight HTTP server
- */
-
 import com.sun.net.httpserver.*;
 
 import java.util.concurrent.*;
@@ -44,15 +34,18 @@ import static com.sun.net.httpserver.HttpExchange.RSPBODY_EMPTY;
 /**
  * Test POST large file via chunked encoding (large chunks)
  */
-
+/*
+ * @test
+ * @bug 6270015
+ * @summary Light weight HTTP server
+ * @library /test/lib
+ * @build jdk.test.lib.net.SimpleSSLContext jdk.test.lib.net.URIBuilder
+ * @run main/othervm ${test.main.class}
+ * @run main/othervm -Djava.net.preferIPv6Addresses=true ${test.main.class}
+ */
 public class Test7a extends Test {
 
     public static void main (String[] args) throws Exception {
-        //Logger log = Logger.getLogger ("com.sun.net.httpserver");
-        //log.setLevel (Level.FINE);
-        //ConsoleHandler h = new ConsoleHandler();
-        //h.setLevel (Level.ALL);
-        //log.addHandler (h);
         Handler handler = new Handler();
         InetAddress loopback = InetAddress.getLoopbackAddress();
         InetSocketAddress addr = new InetSocketAddress(loopback, 0);
diff --git a/test/jdk/com/sun/net/httpserver/Test8a.java b/test/jdk/com/sun/net/httpserver/Test8a.java
index 67f9c93172a..9d1525352cf 100644
--- a/test/jdk/com/sun/net/httpserver/Test8a.java
+++ b/test/jdk/com/sun/net/httpserver/Test8a.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2005, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2005, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -21,15 +21,6 @@
  * questions.
  */
 
-/**
- * @test
- * @bug 6270015
- * @library /test/lib
- * @build jdk.test.lib.net.SimpleSSLContext jdk.test.lib.net.URIBuilder
- * @run main/othervm Test8a
- * @run main/othervm -Djava.net.preferIPv6Addresses=true Test8a
- * @summary Light weight HTTP server
- */
 
 import com.sun.net.httpserver.*;
 
@@ -43,15 +34,18 @@ import jdk.test.lib.net.URIBuilder;
 /**
  * Test POST large file via fixed len encoding
  */
-
+/*
+ * @test
+ * @bug 6270015
+ * @summary Light weight HTTP server
+ * @library /test/lib
+ * @build jdk.test.lib.net.SimpleSSLContext jdk.test.lib.net.URIBuilder
+ * @run main/othervm ${test.main.class}
+ * @run main/othervm -Djava.net.preferIPv6Addresses=true ${test.main.class}
+ */
 public class Test8a extends Test {
 
     public static void main (String[] args) throws Exception {
-        //Logger log = Logger.getLogger ("com.sun.net.httpserver");
-        //ConsoleHandler h = new ConsoleHandler();
-        //h.setLevel (Level.INFO);
-        //log.addHandler (h);
-        //log.setLevel (Level.INFO);
         HttpsServer server = null;
         ExecutorService executor = null;
         try {
diff --git a/test/jdk/com/sun/net/httpserver/TestLogging.java b/test/jdk/com/sun/net/httpserver/TestLogging.java
index 8f4fbddcd42..3f201f90dd2 100644
--- a/test/jdk/com/sun/net/httpserver/TestLogging.java
+++ b/test/jdk/com/sun/net/httpserver/TestLogging.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2006, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2006, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -21,16 +21,6 @@
  * questions.
  */
 
-/*
- * @test
- * @bug 6422914
- * @library /test/lib
- * @build jdk.test.lib.Utils
- *        jdk.test.lib.net.URIBuilder
- * @summary change httpserver exception printouts
- * @run main TestLogging
- * @run main/othervm -Djava.net.preferIPv6Addresses=true TestLogging
- */
 
 import com.sun.net.httpserver.*;
 
@@ -45,27 +35,44 @@ import jdk.test.lib.net.URIBuilder;
 
 import static jdk.test.lib.Utils.createTempFileOfSize;
 
+/*
+ * @test
+ * @bug 6422914
+ * @summary change httpserver exception printouts
+ * @library /test/lib
+ * @build jdk.test.lib.Utils
+ *        jdk.test.lib.net.URIBuilder
+ * @comment We use othervm because this test configures logging handlers
+ *          for the system wide "com.sun.net.httpserver" logger
+ * @run main/othervm ${test.main.class}
+ * @run main/othervm -Djava.net.preferIPv6Addresses=true ${test.main.class}
+ */
 public class TestLogging extends Test {
 
     private static final String TEMP_FILE_PREFIX =
             HttpServer.class.getPackageName() + '-' + TestLogging.class.getSimpleName() + '-';
 
+    private static final Logger logger = Logger.getLogger("com.sun.net.httpserver");
+
+    private static void setupLogging() {
+        logger.setLevel(Level.ALL);
+        final Handler handler = new ConsoleHandler();
+        handler.setLevel(Level.ALL);
+        logger.addHandler(handler);
+    }
+
     public static void main (String[] args) throws Exception {
         HttpServer s1 = null;
         ExecutorService executor=null;
         Path filePath = createTempFileOfSize(TEMP_FILE_PREFIX, null, 0xBEEF);
         try {
             System.out.print ("Test9: ");
+            setupLogging();
             String root = filePath.getParent().toString();
             InetAddress loopback = InetAddress.getLoopbackAddress();
             InetSocketAddress addr = new InetSocketAddress(loopback, 0);
-            Logger logger = Logger.getLogger ("com.sun.net.httpserver");
-            logger.setLevel (Level.ALL);
-            Handler h1 = new ConsoleHandler ();
-            h1.setLevel (Level.ALL);
-            logger.addHandler (h1);
             s1 = HttpServer.create (addr, 0);
-            logger.info (root);
+            logger.info(root);
             HttpHandler h = new FileServerHandler (root);
             HttpContext c1 = s1.createContext ("/", h);
             executor = Executors.newCachedThreadPool();
diff --git a/test/jdk/com/sun/net/httpserver/bugs/B6886436.java b/test/jdk/com/sun/net/httpserver/bugs/B6886436.java
index 5081a81c4c1..c52bbcbdfce 100644
--- a/test/jdk/com/sun/net/httpserver/bugs/B6886436.java
+++ b/test/jdk/com/sun/net/httpserver/bugs/B6886436.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2009, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2009, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -21,15 +21,6 @@
  * questions.
  */
 
-/**
- * @test
- * @bug 6886436
- * @summary HttpServer should not send a body with 204 response.
- * @library /test/lib
- * @run main B6886436
- * @run main/othervm -Djava.net.preferIPv6Addresses=true B6886436
- */
-
 import com.sun.net.httpserver.*;
 
 import java.util.*;
@@ -40,14 +31,29 @@ import java.net.*;
 import jdk.test.lib.net.URIBuilder;
 import static com.sun.net.httpserver.HttpExchange.RSPBODY_CHUNKED;
 
+/*
+ * @test
+ * @bug 6886436
+ * @summary HttpServer should not send a body with 204 response.
+ * @library /test/lib
+ * @comment We use othervm because this test configures logging handlers
+ *          for the system wide "com.sun.net.httpserver" logger
+ * @run main/othervm ${test.main.class}
+ * @run main/othervm -Djava.net.preferIPv6Addresses=true ${test.main.class}
+ */
 public class B6886436 {
 
+    private static final Logger logger = Logger.getLogger ("com.sun.net.httpserver");
+
+    private static void setupLogging() {
+        final ConsoleHandler c = new ConsoleHandler();
+        c.setLevel(Level.WARNING);
+        logger.addHandler(c);
+        logger.setLevel(Level.WARNING);
+    }
+
     public static void main (String[] args) throws Exception {
-        Logger logger = Logger.getLogger ("com.sun.net.httpserver");
-        ConsoleHandler c = new ConsoleHandler();
-        c.setLevel (Level.WARNING);
-        logger.addHandler (c);
-        logger.setLevel (Level.WARNING);
+        setupLogging(); // merely for debugging
         Handler handler = new Handler();
         InetAddress loopback = InetAddress.getLoopbackAddress();
         InetSocketAddress addr = new InetSocketAddress (loopback, 0);
diff --git a/test/jdk/com/sun/net/httpserver/bugs/B8211420.java b/test/jdk/com/sun/net/httpserver/bugs/B8211420.java
index 297aed43bec..d7257ddc755 100644
--- a/test/jdk/com/sun/net/httpserver/bugs/B8211420.java
+++ b/test/jdk/com/sun/net/httpserver/bugs/B8211420.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -21,15 +21,6 @@
  * questions.
  */
 
-/**
- * @test
- * @bug 8211420
- * @library /test/lib
- * @run main/othervm B8211420
- * @run main/othervm -Djava.net.preferIPv6Addresses=true B8211420
- * @summary
- */
-
 import com.sun.net.httpserver.*;
 
 import java.util.*;
@@ -41,14 +32,29 @@ import java.net.*;
 import jdk.test.lib.net.URIBuilder;
 import static com.sun.net.httpserver.HttpExchange.RSPBODY_EMPTY;
 
+/*
+ * @test
+ * @bug 8211420
+ * @library /test/lib
+ * @comment We use othervm because this test configures logging handlers
+ *          for the system wide "com.sun.net.httpserver" logger
+ * @run main/othervm ${test.main.class}
+ * @run main/othervm -Djava.net.preferIPv6Addresses=true ${test.main.class}
+ * @summary
+ */
 public class B8211420 {
 
-    public static void main(String[] args) throws Exception {
-        Logger logger = Logger.getLogger("com.sun.net.httpserver");
-        ConsoleHandler c = new ConsoleHandler();
+    private static final Logger logger = Logger.getLogger("com.sun.net.httpserver");
+
+    private static void setupLogging() {
+        final ConsoleHandler c = new ConsoleHandler();
         c.setLevel(Level.WARNING);
         logger.addHandler(c);
         logger.setLevel(Level.WARNING);
+    }
+
+    public static void main(String[] args) throws Exception {
+        setupLogging(); // merely for debugging
         Handler handler = new Handler();
         InetAddress loopback = InetAddress.getLoopbackAddress();
         InetSocketAddress addr = new InetSocketAddress(loopback, 0);
diff --git a/test/jdk/com/sun/net/httpserver/bugs/ExceptionKeepAlive.java b/test/jdk/com/sun/net/httpserver/bugs/ExceptionKeepAlive.java
index 865e3b7509d..eba6aa67a8f 100644
--- a/test/jdk/com/sun/net/httpserver/bugs/ExceptionKeepAlive.java
+++ b/test/jdk/com/sun/net/httpserver/bugs/ExceptionKeepAlive.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2023, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2023, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -21,15 +21,6 @@
  * questions.
  */
 
-/**
- * @test
- * @bug 8219083
- * @summary Exceptions thrown from HttpHandler.handle should not close connection
- *          if response is completed
- * @library /test/lib
- * @run junit ExceptionKeepAlive
- */
-
 import com.sun.net.httpserver.HttpExchange;
 import com.sun.net.httpserver.HttpHandler;
 import com.sun.net.httpserver.HttpServer;
@@ -42,20 +33,35 @@ import java.net.InetAddress;
 import java.net.InetSocketAddress;
 import java.net.Proxy;
 import java.net.URL;
+import java.util.logging.ConsoleHandler;
 import java.util.logging.Handler;
 import java.util.logging.Level;
 import java.util.logging.Logger;
-import java.util.logging.SimpleFormatter;
-import java.util.logging.StreamHandler;
 
 import static org.junit.jupiter.api.Assertions.*;
 import static com.sun.net.httpserver.HttpExchange.RSPBODY_EMPTY;
 
-public class ExceptionKeepAlive
-{
+/*
+ * @test
+ * @bug 8219083
+ * @summary Exceptions thrown from HttpHandler.handle should not close connection
+ *          if response is completed
+ * @library /test/lib
+ * @comment We use othervm because this test configures logging handlers
+ *          for the system wide "com.sun.net.httpserver" logger
+ * @run junit/othervm ${test.main.class}
+ */
+public class ExceptionKeepAlive {
 
     public static final Logger LOGGER = Logger.getLogger("com.sun.net.httpserver");
 
+    private static void setupLogging() {
+        final Handler handler = new ConsoleHandler();
+        handler.setLevel(Level.FINEST);
+        LOGGER.setLevel(Level.FINEST);
+        LOGGER.addHandler(handler);
+    }
+
     @Test
     void test() throws IOException, InterruptedException {
         HttpServer httpServer = startHttpServer();
@@ -89,11 +95,7 @@ public class ExceptionKeepAlive
      * Http Server
      */
     HttpServer startHttpServer() throws IOException {
-        Handler outHandler = new StreamHandler(System.out,
-                                 new SimpleFormatter());
-        outHandler.setLevel(Level.FINEST);
-        LOGGER.setLevel(Level.FINEST);
-        LOGGER.addHandler(outHandler);
+        setupLogging(); // merely for debugging
         InetAddress loopback = InetAddress.getLoopbackAddress();
         HttpServer httpServer = HttpServer.create(new InetSocketAddress(loopback, 0), 0);
         httpServer.createContext("/", new MyHandler());
diff --git a/test/jdk/com/sun/net/httpserver/bugs/FixedLengthInputStream.java b/test/jdk/com/sun/net/httpserver/bugs/FixedLengthInputStream.java
index c2195b3568f..c4287f50c9a 100644
--- a/test/jdk/com/sun/net/httpserver/bugs/FixedLengthInputStream.java
+++ b/test/jdk/com/sun/net/httpserver/bugs/FixedLengthInputStream.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2008, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2008, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -21,25 +21,14 @@
  * questions.
  */
 
-/**
- * @test
- * @bug 6756771 6755625
- * @summary  com.sun.net.httpserver.HttpServer should handle POSTs larger than 2Gig
- * @library /test/lib
- * @run main FixedLengthInputStream
- * @run main/othervm -Djava.net.preferIPv6Addresses=true FixedLengthInputStream
- */
-
 import java.io.InputStream;
 import java.io.IOException;
 import java.io.OutputStream;
-import java.io.PrintStream;
 import java.net.InetAddress;
 import java.net.InetSocketAddress;
 import java.net.HttpURLConnection;
 import java.net.Proxy;
 import java.net.URL;
-import java.net.Socket;
 import java.util.logging.*;
 import com.sun.net.httpserver.HttpExchange;
 import com.sun.net.httpserver.HttpHandler;
@@ -47,10 +36,21 @@ import com.sun.net.httpserver.HttpServer;
 import jdk.test.lib.net.URIBuilder;
 import static com.sun.net.httpserver.HttpExchange.RSPBODY_EMPTY;
 
-public class FixedLengthInputStream
-{
+/*
+ * @test
+ * @bug 6756771 6755625
+ * @summary  com.sun.net.httpserver.HttpServer should handle POSTs larger than 2Gig
+ * @library /test/lib
+ * @comment We use othervm because this test configures logging handlers
+ *          for the system wide "com.sun.net.httpserver" logger
+ * @run main/othervm ${test.main.class}
+ * @run main/othervm -Djava.net.preferIPv6Addresses=true ${test.main.class}
+ */
+public class FixedLengthInputStream {
     static final long POST_SIZE = 4L * 1024L * 1024L * 1024L; // 4Gig
 
+    private static final Logger logger = Logger.getLogger("com.sun.net.httpserver");
+
     void test(String[] args) throws IOException {
         HttpServer httpServer = startHttpServer();
         int port = httpServer.getAddress().getPort();
@@ -89,18 +89,19 @@ public class FixedLengthInputStream
         }
     }
 
+    private static void setupLogging() {
+        final ConsoleHandler handler = new ConsoleHandler();
+        handler.setLevel(Level.FINEST);
+        logger.setLevel(Level.FINEST);
+        logger.addHandler(handler);
+    }
+
     /**
      * Http Server
      */
     HttpServer startHttpServer() throws IOException {
         if (debug) {
-            Logger logger =
-            Logger.getLogger("com.sun.net.httpserver");
-            Handler outHandler = new StreamHandler(System.out,
-                                     new SimpleFormatter());
-            outHandler.setLevel(Level.FINEST);
-            logger.setLevel(Level.FINEST);
-            logger.addHandler(outHandler);
+            setupLogging(); // merely for debugging
         }
         InetAddress loopback = InetAddress.getLoopbackAddress();
         HttpServer httpServer = HttpServer.create(new InetSocketAddress(loopback, 0), 0);
diff --git a/test/jdk/com/sun/net/httpserver/bugs/HandlerConnectionClose.java b/test/jdk/com/sun/net/httpserver/bugs/HandlerConnectionClose.java
index 372e941904e..215a189c7bf 100644
--- a/test/jdk/com/sun/net/httpserver/bugs/HandlerConnectionClose.java
+++ b/test/jdk/com/sun/net/httpserver/bugs/HandlerConnectionClose.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2019, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2019, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -21,15 +21,6 @@
  * questions.
  */
 
-/**
- * @test
- * @bug 8218554
- * @summary  test that the handler can request a connection close.
- * @library /test/lib
- * @build jdk.test.lib.net.SimpleSSLContext
- * @run main/othervm HandlerConnectionClose
- */
-
 import com.sun.net.httpserver.HttpExchange;
 import com.sun.net.httpserver.HttpHandler;
 import com.sun.net.httpserver.HttpServer;
@@ -49,22 +40,30 @@ import java.net.URL;
 import java.nio.charset.StandardCharsets;
 import java.util.List;
 import java.util.Locale;
+import java.util.logging.ConsoleHandler;
 import java.util.logging.Handler;
 import java.util.logging.Level;
 import java.util.logging.Logger;
-import java.util.logging.SimpleFormatter;
-import java.util.logging.StreamHandler;
 import jdk.test.lib.net.SimpleSSLContext;
 import javax.net.ssl.HttpsURLConnection;
 import javax.net.ssl.SSLContext;
 import javax.net.ssl.SSLSession;
 
-public class HandlerConnectionClose
-{
+/*
+ * @test
+ * @bug 8218554
+ * @summary  test that the handler can request a connection close.
+ * @library /test/lib
+ * @build jdk.test.lib.net.SimpleSSLContext
+ * @comment We use othervm because this test configures logging handlers
+ *          for the system wide "com.sun.net.httpserver" logger
+ * @run main/othervm ${test.main.class}
+ */
+public class HandlerConnectionClose {
     static final int ONEK = 1024;
     static final long POST_SIZE = ONEK * 1L;
     private static final SSLContext sslContext = SimpleSSLContext.findSSLContext();
-    Logger logger;
+    private static final Logger logger = Logger.getLogger("com.sun.net.httpserver");
 
     void test(String[] args) throws Exception {
 
@@ -341,17 +340,20 @@ public class HandlerConnectionClose
         }
     }
 
+    private static void setupLogging() {
+        final Handler handler = new ConsoleHandler();
+        handler.setLevel(Level.FINEST);
+        logger.setLevel(Level.FINEST);
+        logger.addHandler(handler);
+
+    }
+
     /**
      * Http Server
      */
     HttpServer startHttpServer(String protocol) throws IOException {
         if (debug) {
-            logger = Logger.getLogger("com.sun.net.httpserver");
-            Handler outHandler = new StreamHandler(System.out,
-                                     new SimpleFormatter());
-            outHandler.setLevel(Level.FINEST);
-            logger.setLevel(Level.FINEST);
-            logger.addHandler(outHandler);
+            setupLogging(); // merely for debugging
         }
 
         InetSocketAddress serverAddress = new InetSocketAddress(InetAddress.getLoopbackAddress(), 0);
diff --git a/test/jdk/com/sun/net/httpserver/bugs/HeadKeepAlive.java b/test/jdk/com/sun/net/httpserver/bugs/HeadKeepAlive.java
index 4d987ada173..c575fdfc810 100644
--- a/test/jdk/com/sun/net/httpserver/bugs/HeadKeepAlive.java
+++ b/test/jdk/com/sun/net/httpserver/bugs/HeadKeepAlive.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2023, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2023, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -21,14 +21,6 @@
  * questions.
  */
 
-/**
- * @test
- * @bug 8304963
- * @summary Connection should be reusable after HEAD request
- * @library /test/lib
- * @run junit HeadKeepAlive
- */
-
 import com.sun.net.httpserver.HttpExchange;
 import com.sun.net.httpserver.HttpHandler;
 import com.sun.net.httpserver.HttpServer;
@@ -41,19 +33,33 @@ import java.net.InetAddress;
 import java.net.InetSocketAddress;
 import java.net.Proxy;
 import java.net.URL;
+import java.util.logging.ConsoleHandler;
 import java.util.logging.Handler;
 import java.util.logging.Level;
 import java.util.logging.Logger;
-import java.util.logging.SimpleFormatter;
-import java.util.logging.StreamHandler;
 
 import static org.junit.jupiter.api.Assertions.*;
 import static com.sun.net.httpserver.HttpExchange.RSPBODY_EMPTY;
 
-public class HeadKeepAlive
-{
+/*
+ * @test
+ * @bug 8304963
+ * @summary Connection should be reusable after HEAD request
+ * @library /test/lib
+ * @comment We use othervm because this test configures logging handlers
+ *          for the system wide "com.sun.net.httpserver" logger
+ * @run junit/othervm ${test.main.class}
+ */
+public class HeadKeepAlive {
 
-    public static final Logger LOGGER = Logger.getLogger("com.sun.net.httpserver");
+    private static final Logger LOGGER = Logger.getLogger("com.sun.net.httpserver");
+
+    private static void setupLogging() {
+        final Handler handler = new ConsoleHandler();
+        handler.setLevel(Level.FINEST);
+        LOGGER.setLevel(Level.FINEST);
+        LOGGER.addHandler(handler);
+    }
 
     @Test
     void test() throws IOException, InterruptedException {
@@ -90,11 +96,7 @@ public class HeadKeepAlive
      * Http Server
      */
     HttpServer startHttpServer() throws IOException {
-        Handler outHandler = new StreamHandler(System.out,
-                                 new SimpleFormatter());
-        outHandler.setLevel(Level.FINEST);
-        LOGGER.setLevel(Level.FINEST);
-        LOGGER.addHandler(outHandler);
+        setupLogging(); // merely for debugging
         InetAddress loopback = InetAddress.getLoopbackAddress();
         HttpServer httpServer = HttpServer.create(new InetSocketAddress(loopback, 0), 0);
         httpServer.createContext("/", new MyHandler());
diff --git a/test/jdk/com/sun/net/httpserver/bugs/TruncatedRequestBody.java b/test/jdk/com/sun/net/httpserver/bugs/TruncatedRequestBody.java
index 824428755a4..95a3d1787df 100644
--- a/test/jdk/com/sun/net/httpserver/bugs/TruncatedRequestBody.java
+++ b/test/jdk/com/sun/net/httpserver/bugs/TruncatedRequestBody.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2017, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2017, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -21,11 +21,6 @@
  * questions.
  */
 
-/**
- * @test
- * @bug 8190793
- * @summary Httpserver does not detect truncated request body
- */
 
 import com.sun.net.httpserver.HttpContext;
 import com.sun.net.httpserver.HttpExchange;
@@ -46,12 +41,23 @@ import java.util.logging.Level;
 import java.util.logging.Logger;
 import static com.sun.net.httpserver.HttpExchange.RSPBODY_EMPTY;
 
+/*
+ * @test
+ * @bug 8190793
+ * @summary Httpserver does not detect truncated request body
+ * @comment We use othervm because this test configures logging handlers
+ *          for the system wide "com.sun.net.httpserver" logger
+ * @run main/othervm ${test.main.class}
+ */
 /*
  * Send two POST requests to the server which are both trucated
  * and socket closed. Server needs to detect this and throw an IOException
  * in getRequestBody().read(). Two variants for fixed length and chunked.
  */
 public class TruncatedRequestBody {
+
+    private static final Logger logger = Logger.getLogger("com.sun.net.httpserver");
+
     static volatile boolean error = false;
 
     static CountDownLatch latch = new CountDownLatch(2);
@@ -81,16 +87,18 @@ public class TruncatedRequestBody {
 
     }
 
+    private static void setupLogging() {
+        final ConsoleHandler h = new ConsoleHandler();
+        h.setLevel(Level.ALL);
+        logger.setLevel(Level.ALL);
+        logger.addHandler(h);
+    }
+
     /**
      * @param args the command line arguments
      */
     public static void main(String[] args) throws IOException, InterruptedException {
-        Logger logger = Logger.getLogger("com.sun.net.httpserver");
-        ConsoleHandler h = new ConsoleHandler();
-        h.setLevel(Level.ALL);
-        logger.setLevel(Level.ALL);
-        logger.addHandler(h);
-
+        setupLogging(); // merely for debugging
         InetAddress loopback = InetAddress.getLoopbackAddress();
         InetSocketAddress addr = new InetSocketAddress(loopback, 0);
         HttpServer server = HttpServer.create(addr, 10);
diff --git a/test/jdk/com/sun/net/httpserver/bugs/ZeroLengthOutputStream.java b/test/jdk/com/sun/net/httpserver/bugs/ZeroLengthOutputStream.java
index 33bbe0479db..0715800ead7 100644
--- a/test/jdk/com/sun/net/httpserver/bugs/ZeroLengthOutputStream.java
+++ b/test/jdk/com/sun/net/httpserver/bugs/ZeroLengthOutputStream.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2023, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2023, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -21,14 +21,6 @@
  * questions.
  */
 
-/**
- * @test
- * @bug 8219083
- * @summary HttpExchange.getResponseBody write and close should not throw
- *          even when response length is zero
- * @library /test/lib
- * @run junit ZeroLengthOutputStream
- */
 
 import com.sun.net.httpserver.HttpExchange;
 import com.sun.net.httpserver.HttpHandler;
@@ -44,19 +36,27 @@ import java.net.InetSocketAddress;
 import java.net.Proxy;
 import java.net.URL;
 import java.util.concurrent.CountDownLatch;
+import java.util.logging.ConsoleHandler;
 import java.util.logging.Handler;
 import java.util.logging.Level;
 import java.util.logging.Logger;
-import java.util.logging.SimpleFormatter;
-import java.util.logging.StreamHandler;
 
 import static org.junit.jupiter.api.Assertions.*;
 import static com.sun.net.httpserver.HttpExchange.RSPBODY_EMPTY;
 
-public class ZeroLengthOutputStream
-{
+/*
+ * @test
+ * @bug 8219083
+ * @summary HttpExchange.getResponseBody write and close should not throw
+ *          even when response length is zero
+ * @library /test/lib
+ * @comment We use othervm because this test configures logging handlers
+ *          for the system wide "com.sun.net.httpserver" logger
+ * @run junit/othervm ${test.main.class}
+ */
+public class ZeroLengthOutputStream {
 
-    public static final Logger LOGGER = Logger.getLogger("com.sun.net.httpserver");
+    private static final Logger LOGGER = Logger.getLogger("com.sun.net.httpserver");
     public volatile boolean closed;
     public CountDownLatch cdl = new CountDownLatch(1);
 
@@ -80,15 +80,18 @@ public class ZeroLengthOutputStream
         }
     }
 
+    private static void setupLogging() {
+        final Handler handler = new ConsoleHandler();
+        handler.setLevel(Level.FINEST);
+        LOGGER.setLevel(Level.FINEST);
+        LOGGER.addHandler(handler);
+    }
+
     /**
      * Http Server
      */
     HttpServer startHttpServer() throws IOException {
-        Handler outHandler = new StreamHandler(System.out,
-                                 new SimpleFormatter());
-        outHandler.setLevel(Level.FINEST);
-        LOGGER.setLevel(Level.FINEST);
-        LOGGER.addHandler(outHandler);
+        setupLogging(); // merely for debugging
         InetAddress loopback = InetAddress.getLoopbackAddress();
         HttpServer httpServer = HttpServer.create(new InetSocketAddress(loopback, 0), 0);
         httpServer.createContext("/flis/", new MyHandler());

From 5e8bba3ae7a2f5c61c56deb2072425b003d7d7c4 Mon Sep 17 00:00:00 2001
From: David Holmes <dholmes@openjdk.org>
Date: Wed, 11 Mar 2026 05:39:03 +0000
Subject: [PATCH 144/655] 8379456: Test
 jdk/jfr/event/runtime/TestVMInfoEvent.java now fails with
 java.lang.NoClassDefFoundError: java/lang/management/ManagementFactory

Reviewed-by: lmesnik
---
 test/jdk/jdk/jfr/event/runtime/TestVMInfoEvent.java | 1 +
 1 file changed, 1 insertion(+)

diff --git a/test/jdk/jdk/jfr/event/runtime/TestVMInfoEvent.java b/test/jdk/jdk/jfr/event/runtime/TestVMInfoEvent.java
index 8cbc6ea2bb8..ebee42b52df 100644
--- a/test/jdk/jdk/jfr/event/runtime/TestVMInfoEvent.java
+++ b/test/jdk/jdk/jfr/event/runtime/TestVMInfoEvent.java
@@ -40,6 +40,7 @@ import jdk.test.lib.jfr.Events;
 /**
  * @test
  * @modules java.base/jdk.internal.vm
+ * @modules java.management
  * @requires vm.flagless
  * @requires vm.gc == "Serial" | vm.gc == null
  * @requires vm.hasJFR

From a741e290c9cf95465447a913880d6b1ad45e6f9a Mon Sep 17 00:00:00 2001
From: Jan Lahoda <jlahoda@openjdk.org>
Date: Wed, 11 Mar 2026 07:15:25 +0000
Subject: [PATCH 145/655] 8379284: Avoid the need to keep obsolete preview
 feature constants until bootstrap JDK is upgraded

Reviewed-by: liach, erikj, jpai, vromero
---
 make/CompileInterimLangtools.gmk              | 25 ++---
 .../previewfeature/SetupPreviewFeature.java   | 93 +++++++++++++++++++
 .../jdk/internal/javac/PreviewFeature.java    | 21 +----
 3 files changed, 108 insertions(+), 31 deletions(-)
 create mode 100644 make/langtools/tools/previewfeature/SetupPreviewFeature.java

diff --git a/make/CompileInterimLangtools.gmk b/make/CompileInterimLangtools.gmk
index c7d1c3796f6..8254b8fc0a7 100644
--- a/make/CompileInterimLangtools.gmk
+++ b/make/CompileInterimLangtools.gmk
@@ -1,5 +1,5 @@
 #
-# Copyright (c) 2014, 2025, Oracle and/or its affiliates. All rights reserved.
+# Copyright (c) 2014, 2026, Oracle and/or its affiliates. All rights reserved.
 # DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
 #
 # This code is free software; you can redistribute it and/or modify it
@@ -68,17 +68,19 @@ java.compiler.interim_EXTRA_FILES := \
 TARGETS += $(BUILDTOOLS_OUTPUTDIR)/gensrc/java.compiler.interim/javax/tools/ToolProvider.java
 
 ################################################################################
-# Use the up-to-date PreviewFeature.java and NoPreview.java from the current
-# sources, instead of the versions from the boot JDK, as javac may be referring
-# to constants from the up-to-date versions.
+# Create a hybrid PreviewFeature.java that combines constants
+# from the current sources, as those can be used in javac APIs,  and from the
+# bootstrap JDK, as those can be used from bootstrap JDK classfiles.
 
-$(eval $(call SetupCopyFiles, COPY_PREVIEW_FEATURES, \
-    FILES := $(TOPDIR)/src/java.base/share/classes/jdk/internal/javac/PreviewFeature.java \
-        $(TOPDIR)/src/java.base/share/classes/jdk/internal/javac/NoPreview.java, \
-    DEST := $(BUILDTOOLS_OUTPUTDIR)/gensrc/java.base.interim/jdk/internal/javac/, \
-))
+$(BUILDTOOLS_OUTPUTDIR)/gensrc/java.base.interim/jdk/internal/javac/PreviewFeature.java: \
+    $(TOPDIR)/src/java.base/share/classes/jdk/internal/javac/PreviewFeature.java
+	$(call LogInfo, Generating $@)
+	$(JAVA) $(TOPDIR)/make/langtools/tools/previewfeature/SetupPreviewFeature.java \
+            $(TOPDIR)/src/java.base/share/classes/jdk/internal/javac/PreviewFeature.java \
+            $@
 
-TARGETS += $(COPY_PREVIEW_FEATURES)
+
+TARGETS += $(BUILDTOOLS_OUTPUTDIR)/gensrc/java.base.interim/jdk/internal/javac/PreviewFeature.java
 
 ################################################################################
 # Setup the rules to build interim langtools, which is compiled by the boot
@@ -123,7 +125,8 @@ define SetupInterimModule
   $1_DEPS_INTERIM := $$(addsuffix .interim, $$(filter \
       $$(INTERIM_LANGTOOLS_BASE_MODULES), $$(call FindTransitiveDepsForModule, $1)))
 
-  $$(BUILD_$1.interim): $$(foreach d, $$($1_DEPS_INTERIM), $$(BUILD_$$d)) $(COPY_PREVIEW_FEATURES)
+  $$(BUILD_$1.interim): $$(foreach d, $$($1_DEPS_INTERIM), $$(BUILD_$$d)) \
+      $(BUILDTOOLS_OUTPUTDIR)/gensrc/java.base.interim/jdk/internal/javac/PreviewFeature.java
 
   TARGETS += $$(BUILD_$1.interim)
 endef
diff --git a/make/langtools/tools/previewfeature/SetupPreviewFeature.java b/make/langtools/tools/previewfeature/SetupPreviewFeature.java
new file mode 100644
index 00000000000..2d5207f0e17
--- /dev/null
+++ b/make/langtools/tools/previewfeature/SetupPreviewFeature.java
@@ -0,0 +1,93 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.  Oracle designates this
+ * particular file as subject to the "Classpath" exception as provided
+ * by Oracle in the LICENSE file that accompanied this code.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+package previewfeature;
+
+import com.sun.source.util.JavacTask;
+import com.sun.source.util.Trees;
+import java.io.StringWriter;
+import java.lang.reflect.Field;
+import java.nio.file.Files;
+import java.nio.file.Path;
+import java.util.HashSet;
+import java.util.Set;
+import java.util.stream.Collectors;
+import javax.lang.model.element.ElementKind;
+import javax.tools.ToolProvider;
+
+/* Construct a hybrid PreviewFeature.Feature enum that includes constants both
+ * from the current JDK sources (so that they can be used in the javac API sources),
+ * and from the bootstrap JDK (so that they can be used in the bootstrap classfiles).
+ *
+ * This hybrid enum is only used for the interim javac.
+ */
+public class SetupPreviewFeature {
+    public static void main(String... args) throws Exception {
+        Class<?> runtimeFeature = Class.forName("jdk.internal.javac.PreviewFeature$Feature");
+        Set<String> constantsToAdd = new HashSet<>();
+        for (Field runtimeField : runtimeFeature.getDeclaredFields()) {
+            if (runtimeField.isEnumConstant()) {
+                constantsToAdd.add(runtimeField.getName());
+            }
+        }
+        var dummy = new StringWriter();
+        var compiler = ToolProvider.getSystemJavaCompiler();
+        var source = Path.of(args[0]);
+        try (var fm = compiler.getStandardFileManager(null, null, null)) {
+            JavacTask task =
+                    (JavacTask) compiler.getTask(dummy, null, null, null, null, fm.getJavaFileObjects(source));
+            task.analyze();
+            var sourceFeature = task.getElements()
+                                    .getTypeElement("jdk.internal.javac.PreviewFeature.Feature");
+            int insertPosition = -1;
+            for (var el : sourceFeature.getEnclosedElements()) {
+                if (el.getKind() == ElementKind.ENUM_CONSTANT) {
+                    constantsToAdd.remove(el.getSimpleName().toString());
+                    if (insertPosition == (-1)) {
+                        var trees = Trees.instance(task);
+                        var elPath = trees.getPath(el);
+                        insertPosition = (int) trees.getSourcePositions()
+                                                    .getStartPosition(elPath.getCompilationUnit(),
+                                                                      elPath.getLeaf());
+                    }
+                }
+            }
+            var target = Path.of(args[1]);
+            Files.createDirectories(target.getParent());
+            if (constantsToAdd.isEmpty()) {
+                Files.copy(source, target);
+            } else {
+                String sourceCode = Files.readString(source);
+                try (var out = Files.newBufferedWriter(target)) {
+                    out.write(sourceCode, 0, insertPosition);
+                    out.write(constantsToAdd.stream()
+                                            .collect(Collectors.joining(", ",
+                                                                        "/*compatibility constants:*/ ",
+                                                                        ",\n")));
+                    out.write(sourceCode, insertPosition, sourceCode.length() - insertPosition);
+                }
+            }
+        }
+    }
+}
\ No newline at end of file
diff --git a/src/java.base/share/classes/jdk/internal/javac/PreviewFeature.java b/src/java.base/share/classes/jdk/internal/javac/PreviewFeature.java
index 5942cefa2a1..a698440c15d 100644
--- a/src/java.base/share/classes/jdk/internal/javac/PreviewFeature.java
+++ b/src/java.base/share/classes/jdk/internal/javac/PreviewFeature.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2019, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2019, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -64,25 +64,6 @@ public @interface PreviewFeature {
      * Values should be annotated with the feature's {@code JEP}.
      */
     public enum Feature {
-        // The JDK build process involves creating an interim javac which is then
-        // used to compile the rest of the JDK. The jdk.internal.javac.PreviewFeature
-        // annotation from the current sources is used when compiling interim javac.
-        // That's because the javac APIs of the current sources may be annotated with
-        // this annotation and they may be using the enum constants of the current sources.
-        // Furthermore, when compiling interim javac, the class files from the bootstrap JDK get
-        // used and those may also contain the PreviewFeature annotation. However, they may be
-        // using the enum constants of the bootstrap JDK's PreviewFeature annotation.
-        // If javac sees an annotation with an unknown enum constant, it produces a warning,
-        // and that in turn fails the build.
-        // So, in the current sources, we need to preserve the PreviewFeature enum constants
-        // for as long as the interim javac build needs it. As a result, we retain PreviewFeature
-        // enum constants for preview features that are present in the bootstrap JDK.
-        // Older constants can be removed.
-        //
-        // For example, Class-File API became final in JDK 24. As soon as JDK 23 was dropped as
-        // the bootstrap JDK, the CLASSFILE_API enum constant became eligible for removal.
-
-        //---
         @JEP(number=525, title="Structured Concurrency", status="Sixth Preview")
         STRUCTURED_CONCURRENCY,
         @JEP(number = 526, title = "Lazy Constants", status = "Second Preview")

From 619fe63b5f112b9c7f3d2755504c70fd4bebade3 Mon Sep 17 00:00:00 2001
From: Anton Artemov <aartemov@openjdk.org>
Date: Wed, 11 Mar 2026 08:39:41 +0000
Subject: [PATCH 146/655] 8362239: Reconcile enter_internal and
 reenter_internal in the ObjectMonitor code

Reviewed-by: dholmes, fbredberg, coleenp, pchilanomate, dcubed
---
 src/hotspot/share/runtime/objectMonitor.cpp | 255 ++++++++------------
 src/hotspot/share/runtime/objectMonitor.hpp |   4 +-
 2 files changed, 102 insertions(+), 157 deletions(-)

diff --git a/src/hotspot/share/runtime/objectMonitor.cpp b/src/hotspot/share/runtime/objectMonitor.cpp
index cb69b82d767..94399088464 100644
--- a/src/hotspot/share/runtime/objectMonitor.cpp
+++ b/src/hotspot/share/runtime/objectMonitor.cpp
@@ -593,12 +593,15 @@ void ObjectMonitor::enter_with_contention_mark(JavaThread* current, ObjectMonito
     OSThreadContendState osts(current->osthread());
 
     assert(current->thread_state() == _thread_in_vm, "invariant");
+    ObjectWaiter node(current);
 
     for (;;) {
       ExitOnSuspend eos(this);
       {
         ThreadBlockInVMPreprocess<ExitOnSuspend> tbivs(current, eos, true /* allow_suspend */);
-        enter_internal(current);
+        if (!try_enter_fast(current, &node)) {
+          enter_internal(current, &node, false /* reenter_path */);
+        }
         current->set_current_pending_monitor(nullptr);
         // We can go to a safepoint at the end of this block. If we
         // do a thread dump during that safepoint, then this thread will show
@@ -942,14 +945,17 @@ const char* ObjectMonitor::is_busy_to_string(stringStream* ss) {
   return ss->base();
 }
 
-void ObjectMonitor::enter_internal(JavaThread* current) {
+bool ObjectMonitor::try_enter_fast(JavaThread* current, ObjectWaiter* current_node) {
+  assert(current != nullptr, "invariant");
   assert(current->thread_state() == _thread_blocked, "invariant");
+  assert(current_node != nullptr, "invariant");
+  assert(current_node->_thread == current, "invariant");
 
   // Try the lock - TATAS
   if (try_lock(current) == TryLockResult::Success) {
     assert(!has_successor(current), "invariant");
     assert(has_owner(current), "invariant");
-    return;
+    return true;
   }
 
   assert(InitDone, "Unexpectedly not initialized");
@@ -964,7 +970,7 @@ void ObjectMonitor::enter_internal(JavaThread* current) {
   if (try_spin(current)) {
     assert(has_owner(current), "invariant");
     assert(!has_successor(current), "invariant");
-    return;
+    return true;
   }
 
   // The Spin failed -- Enqueue and park the thread ...
@@ -973,54 +979,67 @@ void ObjectMonitor::enter_internal(JavaThread* current) {
 
   // Enqueue "current" on ObjectMonitor's _entry_list.
   //
-  // Node acts as a proxy for current.
+  // current_node acts as a proxy for current.
   // As an aside, if were to ever rewrite the synchronization code mostly
   // in Java, WaitNodes, ObjectMonitors, and Events would become 1st-class
   // Java objects.  This would avoid awkward lifecycle and liveness issues,
   // as well as eliminate a subset of ABA issues.
   // TODO: eliminate ObjectWaiter and enqueue either Threads or Events.
 
-  ObjectWaiter node(current);
   current->_ParkEvent->reset();
 
-  if (try_lock_or_add_to_entry_list(current, &node)) {
-    return; // We got the lock.
+  if (try_lock_or_add_to_entry_list(current, current_node)) {
+    return true; // We got the lock.
   }
+
   // This thread is now added to the _entry_list.
 
   // The lock might have been released while this thread was occupied queueing
   // itself onto _entry_list.  To close the race and avoid "stranding" and
-  // progress-liveness failure we must resample-retry _owner before parking.
+  // progress-liveness failure the caller must resample-retry _owner before parking.
   // Note the Dekker/Lamport duality: ST _entry_list; MEMBAR; LD Owner.
-  // In this case the ST-MEMBAR is accomplished with CAS().
-  //
-  // TODO: Defer all thread state transitions until park-time.
-  // Since state transitions are heavy and inefficient we'd like
-  // to defer the state transitions until absolutely necessary,
-  // and in doing so avoid some transitions ...
+  // In this case the ST-MEMBAR is accomplished with CAS() in try_lock_or_add_to_entry_list.
+  return false;
+}
+
+void ObjectMonitor::enter_internal(JavaThread* current, ObjectWaiter* current_node, bool reenter_path) {
+  assert(current != nullptr, "invariant");
+  assert(current->thread_state() == _thread_blocked, "invariant");
+  assert(current_node != nullptr, "invariant");
+  assert(current_node->_thread == current, "invariant");
 
   // If there are unmounted virtual threads ahead in the _entry_list we want
   // to do a timed-park instead to alleviate some deadlock cases where one
   // of them is picked as the successor but cannot run due to having run out
   // of carriers. This can happen, for example, if this is a pinned virtual
-  // thread currently loading or initializining a class, and all other carriers
+  // thread currently loading or initializing a class, and all other carriers
   // have a pinned vthread waiting for said class to be loaded/initialized.
   // Read counter *after* adding this thread to the _entry_list. Adding to
   // _entry_list uses Atomic::cmpxchg() which already provides a fence that
-  // prevents this load from floating up previous store.
+  // prevents this load from floating up past a previous store.
   // Note that we can have false positives where timed-park is not necessary.
-  bool do_timed_parked = has_unmounted_vthreads();
+  bool do_timed_park = has_unmounted_vthreads();
   jlong recheck_interval = 1;
 
   for (;;) {
+    ObjectWaiter::TStates v = current_node->TState;
+    guarantee(v == ObjectWaiter::TS_ENTER, "invariant");
 
     if (try_lock(current) == TryLockResult::Success) {
       break;
     }
     assert(!has_owner(current), "invariant");
 
+    if (reenter_path) {
+      // If try_lock failed, spin again - we expect the notifier to release the monitor quickly.
+      // Note that spin count may be zero so the above try_lock is necessary.
+      if (try_spin(current)) {
+        break;
+      }
+    }
+
     // park self
-    if (do_timed_parked) {
+    if (do_timed_park) {
       current->_ParkEvent->park(recheck_interval);
       // Increase the recheck_interval, but clamp the value.
       recheck_interval *= 8;
@@ -1031,125 +1050,6 @@ void ObjectMonitor::enter_internal(JavaThread* current) {
       current->_ParkEvent->park();
     }
 
-    if (try_lock(current) == TryLockResult::Success) {
-      break;
-    }
-
-    // The lock is still contested.
-
-    // Assuming this is not a spurious wakeup we'll normally find _succ == current.
-    // We can defer clearing _succ until after the spin completes
-    // try_spin() must tolerate being called with _succ == current.
-    // Try yet another round of adaptive spinning.
-    if (try_spin(current)) {
-      break;
-    }
-
-    // We can find that we were unpark()ed and redesignated _succ while
-    // we were spinning.  That's harmless.  If we iterate and call park(),
-    // park() will consume the event and return immediately and we'll
-    // just spin again.  This pattern can repeat, leaving _succ to simply
-    // spin on a CPU.
-
-    if (has_successor(current)) clear_successor();
-
-    // Invariant: after clearing _succ a thread *must* retry _owner before parking.
-    OrderAccess::fence();
-  }
-
-  // Egress :
-  // Current has acquired the lock -- Unlink current from the _entry_list.
-  unlink_after_acquire(current, &node);
-  if (has_successor(current)) {
-    clear_successor();
-    // Note that we don't need to do OrderAccess::fence() after clearing
-    // _succ here, since we own the lock.
-  }
-
-  // We've acquired ownership with CAS().
-  // CAS is serializing -- it has MEMBAR/FENCE-equivalent semantics.
-  // But since the CAS() this thread may have also stored into _succ
-  // or entry_list.  These meta-data updates must be visible __before
-  // this thread subsequently drops the lock.
-  // Consider what could occur if we didn't enforce this constraint --
-  // STs to monitor meta-data and user-data could reorder with (become
-  // visible after) the ST in exit that drops ownership of the lock.
-  // Some other thread could then acquire the lock, but observe inconsistent
-  // or old monitor meta-data and heap data.  That violates the JMM.
-  // To that end, the exit() operation must have at least STST|LDST
-  // "release" barrier semantics.  Specifically, there must be at least a
-  // STST|LDST barrier in exit() before the ST of null into _owner that drops
-  // the lock.   The barrier ensures that changes to monitor meta-data and data
-  // protected by the lock will be visible before we release the lock, and
-  // therefore before some other thread (CPU) has a chance to acquire the lock.
-  // See also: http://gee.cs.oswego.edu/dl/jmm/cookbook.html.
-  //
-  // Critically, any prior STs to _succ or entry_list must be visible before
-  // the ST of null into _owner in the *subsequent* (following) corresponding
-  // monitorexit.
-
-  return;
-}
-
-// reenter_internal() is a specialized inline form of the latter half of the
-// contended slow-path from enter_internal().  We use reenter_internal() only for
-// monitor reentry in wait().
-//
-// In the future we should reconcile enter_internal() and reenter_internal().
-
-void ObjectMonitor::reenter_internal(JavaThread* current, ObjectWaiter* currentNode) {
-  assert(current != nullptr, "invariant");
-  assert(current->thread_state() == _thread_blocked, "invariant");
-  assert(currentNode != nullptr, "invariant");
-  assert(currentNode->_thread == current, "invariant");
-  assert(_waiters > 0, "invariant");
-
-  // If there are unmounted virtual threads ahead in the _entry_list we want
-  // to do a timed-park instead to alleviate some deadlock cases where one
-  // of them is picked as the successor but cannot run due to having run out
-  // of carriers. This can happen, for example, if a mixed of unmounted and
-  // pinned vthreads taking up all the carriers are waiting for a class to be
-  // initialized, and the selected successor is one of the unmounted vthreads.
-  // Although this method is used for the "notification" case, it could be
-  // that this thread reached here without been added to the _entry_list yet.
-  // This can happen if it was interrupted or the wait timed-out at the same
-  // time. In that case we rely on currentNode->_do_timed_park, which will be
-  // read on the next loop iteration, after consuming the park permit set by
-  // the notifier in notify_internal.
-  // Note that we can have false positives where timed-park is not necessary.
-  bool do_timed_parked = has_unmounted_vthreads();
-  jlong recheck_interval = 1;
-
-  for (;;) {
-    ObjectWaiter::TStates v = currentNode->TState;
-    guarantee(v == ObjectWaiter::TS_ENTER, "invariant");
-    assert(!has_owner(current), "invariant");
-
-    // This thread has been notified so try to reacquire the lock.
-    if (try_lock(current) == TryLockResult::Success) {
-      break;
-    }
-
-    // If that fails, spin again.  Note that spin count may be zero so the above TryLock
-    // is necessary.
-    if (try_spin(current)) {
-        break;
-    }
-
-    {
-      OSThreadContendState osts(current->osthread());
-      if (do_timed_parked) {
-        current->_ParkEvent->park(recheck_interval);
-        // Increase the recheck_interval, but clamp the value.
-        recheck_interval *= 8;
-        if (recheck_interval > MAX_RECHECK_INTERVAL) {
-          recheck_interval = MAX_RECHECK_INTERVAL;
-        }
-      } else {
-        current->_ParkEvent->park();
-      }
-    }
-
     // Try again, but just so we distinguish between futile wakeups and
     // successful wakeups.  The following test isn't algorithmically
     // necessary, but it helps us maintain sensible statistics.
@@ -1159,25 +1059,68 @@ void ObjectMonitor::reenter_internal(JavaThread* current, ObjectWaiter* currentN
 
     // The lock is still contested.
 
-    // Assuming this is not a spurious wakeup we'll normally
-    // find that _succ == current.
-    if (has_successor(current)) clear_successor();
+    if (!reenter_path) {
+      // Assuming this is not a spurious wakeup we'll normally find _succ == current.
+      // We can defer clearing _succ until after the spin completes and
+      // try_spin() must tolerate being called with _succ == current.
+      // Try yet another round of adaptive spinning.
+      if (try_spin(current)) {
+        break;
+      }
+    }
 
-    // Invariant: after clearing _succ a contending thread
-    // *must* retry  _owner before parking.
+    // We can find that we were unpark()ed and redesignated _succ while
+    // we were spinning.  That's harmless.  If we iterate and call park(),
+    // park() will consume the event and return immediately and we'll
+    // just spin again.  This pattern can repeat, leaving _succ to simply
+    // spin on a CPU.
+
+    if (has_successor(current)) {
+      clear_successor();
+    }
+
+    // Invariant: after clearing _succ a thread *must* retry _owner before parking.
     OrderAccess::fence();
 
-    // See comment in notify_internal
-    do_timed_parked |= currentNode->_do_timed_park;
+    // Will only potentially change on the reenter path - see comment in notify_internal.
+    do_timed_park |= current_node->_do_timed_park;
   }
 
-  // Current has acquired the lock -- Unlink current from the _entry_list.
   assert(has_owner(current), "invariant");
-  unlink_after_acquire(current, currentNode);
-  if (has_successor(current)) clear_successor();
-  assert(!has_successor(current), "invariant");
-  currentNode->TState = ObjectWaiter::TS_RUN;
-  OrderAccess::fence();      // see comments at the end of enter_internal()
+
+  // Egress :
+  // Current has acquired the lock -- Unlink current from the _entry_list.
+  unlink_after_acquire(current, current_node);
+  if (has_successor(current)) {
+    clear_successor();
+    // Note that we don't need to do OrderAccess::fence() after clearing
+    // _succ here, since we own the lock.
+  }
+
+  // We've acquired ownership with CAS().
+  // CAS is serializing -- it has MEMBAR/FENCE-equivalent semantics.
+  // But since the CAS() this thread may have also stored into _succ
+  // or entry_list. These meta-data updates must be visible __before
+  // this thread subsequently drops the lock.
+  // Consider what could occur if we didn't enforce this constraint --
+  // STs to monitor meta-data and user-data could reorder with (become
+  // visible after) the ST in exit that drops ownership of the lock.
+  // Some other thread could then acquire the lock, but observe inconsistent
+  // or old monitor meta-data and heap data. That violates the JMM.
+  // To that end, the exit() operation must have at least STST|LDST
+  // "release" barrier semantics. Specifically, there must be at least a
+  // STST|LDST barrier in exit() before the ST of null into _owner that drops
+  // the lock. The barrier ensures that changes to monitor meta-data and data
+  // protected by the lock will be visible before we release the lock, and
+  // therefore before some other thread (CPU) has a chance to acquire the lock.
+  // See also: http://gee.cs.oswego.edu/dl/jmm/cookbook.html.
+  //
+  // Critically, any prior STs to _succ or entry_list must be visible before
+  // the ST of null into _owner in the *subsequent* (following) corresponding
+  // monitorexit.
+
+  current_node->TState = ObjectWaiter::TS_RUN;
+  return;
 }
 
 // This method is called from two places:
@@ -1971,7 +1914,9 @@ void ObjectMonitor::wait(jlong millis, bool interruptible, TRAPS) {
       ExitOnSuspend eos(this);
       {
         ThreadBlockInVMPreprocess<ExitOnSuspend> tbivs(current, eos, true /* allow_suspend */);
-        reenter_internal(current, &node);
+        assert( _waiters > 0, "invariant");
+        OSThreadContendState osts(current->osthread());
+        enter_internal(current, &node, true /* reenter_path */);
         // We can go to a safepoint at the end of this block. If we
         // do a thread dump during that safepoint, then this thread will show
         // as having "-locked" the monitor, but the OS and java.lang.Thread
@@ -2082,12 +2027,12 @@ bool ObjectMonitor::notify_internal(JavaThread* current) {
           // Wake up the thread to alleviate some deadlock cases where the successor
           // that will be picked up when this thread releases the monitor is an unmounted
           // virtual thread that cannot run due to having run out of carriers. Upon waking
-          // up, the thread will call reenter_internal() which will use timed-park in case
+          // up, the thread will call enter_internal(..., true) which will use timed-park in case
           // there is contention and there are still vthreads in the _entry_list.
           // If the target was interrupted or the wait timed-out at the same time, it could
-          // have reached reenter_internal and read a false value of has_unmounted_vthreads()
+          // have reached enter_internal and read a false value of has_unmounted_vthreads()
           // before we added it to the _entry_list above. To deal with that case, we set _do_timed_park
-          // which will be read by the target on the next loop iteration in reenter_internal.
+          // which will be read by the target on the next loop iteration in enter_internal.
           iterator->_do_timed_park = true;
           JavaThread* t = iterator->thread();
           t->_ParkEvent->unpark();
diff --git a/src/hotspot/share/runtime/objectMonitor.hpp b/src/hotspot/share/runtime/objectMonitor.hpp
index 8d9a481bf37..842aa1b374e 100644
--- a/src/hotspot/share/runtime/objectMonitor.hpp
+++ b/src/hotspot/share/runtime/objectMonitor.hpp
@@ -394,8 +394,8 @@ class ObjectMonitor : public CHeapObj<mtObjectMonitor> {
   bool      notify_internal(JavaThread* current);
   ObjectWaiter* dequeue_waiter();
   void      dequeue_specific_waiter(ObjectWaiter* waiter);
-  void      enter_internal(JavaThread* current);
-  void      reenter_internal(JavaThread* current, ObjectWaiter* current_node);
+  void      enter_internal(JavaThread* current, ObjectWaiter* current_node, bool reenter_path);
+  bool      try_enter_fast(JavaThread* current, ObjectWaiter* current_node);
   void      entry_list_build_dll(JavaThread* current);
   void      unlink_after_acquire(JavaThread* current, ObjectWaiter* current_node);
   ObjectWaiter* entry_list_tail(JavaThread* current);

From e74863249cad05d3afdd16d0d6e3107040c62e6a Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Paul=20H=C3=BCbner?= <phubner@openjdk.org>
Date: Wed, 11 Mar 2026 09:22:20 +0000
Subject: [PATCH 147/655] 8378559: Add setting of captured states like errno

Reviewed-by: jvernee, fbredberg
---
 .../cpu/aarch64/downcallLinker_aarch64.cpp    | 50 ++++++++++++++----
 src/hotspot/cpu/ppc/downcallLinker_ppc.cpp    | 47 +++++++++++++----
 .../cpu/riscv/downcallLinker_riscv.cpp        | 49 ++++++++++++++----
 src/hotspot/cpu/s390/downcallLinker_s390.cpp  | 45 ++++++++++++----
 src/hotspot/cpu/x86/downcallLinker_x86_64.cpp | 48 +++++++++++++----
 src/hotspot/share/prims/downcallLinker.cpp    | 37 ++++++++++----
 src/hotspot/share/prims/downcallLinker.hpp    |  7 +--
 .../classes/java/lang/foreign/Linker.java     | 32 +++++++-----
 .../native/libfallbackLinker/fallbackLinker.c | 43 ++++++++++++----
 .../TestCaptureCallState.java                 | 51 ++++++++++++-------
 .../capturecallstate/libCaptureCallState.c    | 14 ++++-
 11 files changed, 319 insertions(+), 104 deletions(-)

diff --git a/src/hotspot/cpu/aarch64/downcallLinker_aarch64.cpp b/src/hotspot/cpu/aarch64/downcallLinker_aarch64.cpp
index 65d448f908c..130d2949800 100644
--- a/src/hotspot/cpu/aarch64/downcallLinker_aarch64.cpp
+++ b/src/hotspot/cpu/aarch64/downcallLinker_aarch64.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2020, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
  * Copyright (c) 2019, Arm Limited. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
@@ -146,10 +146,10 @@ void DowncallLinker::StubGenerator::generate() {
 
   bool should_save_return_value = !_needs_return_buffer;
   RegSpiller out_reg_spiller(_output_registers);
-  int spill_offset = -1;
+  int out_spill_offset = -1;
 
   if (should_save_return_value) {
-    spill_offset = 0;
+    out_spill_offset = 0;
     // spill area can be shared with shadow space and out args,
     // since they are only used before the call,
     // and spill area is only used after.
@@ -174,6 +174,9 @@ void DowncallLinker::StubGenerator::generate() {
   // FP-> |                     |
   //      |---------------------| = frame_bottom_offset = frame_size
   //      | (optional)          |
+  //      | in_reg_spiller area |
+  //      |---------------------|
+  //      | (optional)          |
   //      | capture state buf   |
   //      |---------------------| = StubLocations::CAPTURED_STATE_BUFFER
   //      | (optional)          |
@@ -187,6 +190,19 @@ void DowncallLinker::StubGenerator::generate() {
   GrowableArray<VMStorage> out_regs = ForeignGlobals::replace_place_holders(_input_registers, locs);
   ArgumentShuffle arg_shuffle(filtered_java_regs, out_regs, shuffle_reg);
 
+  // Need to spill for state capturing runtime call.
+  // The area spilled into is distinct from the capture state buffer.
+  RegSpiller in_reg_spiller(out_regs);
+  int in_spill_offset = -1;
+  if (_captured_state_mask != 0) {
+    // The spill area cannot be shared with the out_spill since
+    // spilling needs to happen before the call. Allocate a new
+    // region in the stack for this spill space.
+    in_spill_offset = allocated_frame_size;
+    allocated_frame_size += in_reg_spiller.spill_size_bytes();
+  }
+
+
 #ifndef PRODUCT
   LogTarget(Trace, foreign, downcall) lt;
   if (lt.is_enabled()) {
@@ -228,6 +244,20 @@ void DowncallLinker::StubGenerator::generate() {
   arg_shuffle.generate(_masm, shuffle_reg, 0, _abi._shadow_space_bytes);
   __ block_comment("} argument shuffle");
 
+  if (_captured_state_mask != 0) {
+    assert(in_spill_offset != -1, "must be");
+    __ block_comment("{ load initial thread local");
+    in_reg_spiller.generate_spill(_masm, in_spill_offset);
+
+    // Copy the contents of the capture state buffer into thread local
+    __ ldr(c_rarg0, Address(sp, locs.data_offset(StubLocations::CAPTURED_STATE_BUFFER)));
+    __ movw(c_rarg1, _captured_state_mask);
+    __ rt_call(CAST_FROM_FN_PTR(address, DowncallLinker::capture_state_pre), tmp1);
+
+    in_reg_spiller.generate_fill(_masm, in_spill_offset);
+    __ block_comment("} load initial thread local");
+  }
+
   __ blr(as_Register(locs.get(StubLocations::TARGET_ADDRESS)));
   // this call is assumed not to have killed rthread
 
@@ -254,15 +284,15 @@ void DowncallLinker::StubGenerator::generate() {
     __ block_comment("{ save thread local");
 
     if (should_save_return_value) {
-      out_reg_spiller.generate_spill(_masm, spill_offset);
+      out_reg_spiller.generate_spill(_masm, out_spill_offset);
     }
 
     __ ldr(c_rarg0, Address(sp, locs.data_offset(StubLocations::CAPTURED_STATE_BUFFER)));
     __ movw(c_rarg1, _captured_state_mask);
-    __ rt_call(CAST_FROM_FN_PTR(address, DowncallLinker::capture_state), tmp1);
+    __ rt_call(CAST_FROM_FN_PTR(address, DowncallLinker::capture_state_post), tmp1);
 
     if (should_save_return_value) {
-      out_reg_spiller.generate_fill(_masm, spill_offset);
+      out_reg_spiller.generate_fill(_masm, out_spill_offset);
     }
 
     __ block_comment("} save thread local");
@@ -321,7 +351,7 @@ void DowncallLinker::StubGenerator::generate() {
 
     if (should_save_return_value) {
       // Need to save the native result registers around any runtime calls.
-      out_reg_spiller.generate_spill(_masm, spill_offset);
+      out_reg_spiller.generate_spill(_masm, out_spill_offset);
     }
 
     __ mov(c_rarg0, rthread);
@@ -330,7 +360,7 @@ void DowncallLinker::StubGenerator::generate() {
     __ blr(tmp1);
 
     if (should_save_return_value) {
-      out_reg_spiller.generate_fill(_masm, spill_offset);
+      out_reg_spiller.generate_fill(_masm, out_spill_offset);
     }
 
     __ b(L_after_safepoint_poll);
@@ -342,13 +372,13 @@ void DowncallLinker::StubGenerator::generate() {
     __ bind(L_reguard);
 
     if (should_save_return_value) {
-      out_reg_spiller.generate_spill(_masm, spill_offset);
+      out_reg_spiller.generate_spill(_masm, out_spill_offset);
     }
 
     __ rt_call(CAST_FROM_FN_PTR(address, SharedRuntime::reguard_yellow_pages), tmp1);
 
     if (should_save_return_value) {
-      out_reg_spiller.generate_fill(_masm, spill_offset);
+      out_reg_spiller.generate_fill(_masm, out_spill_offset);
     }
 
     __ b(L_after_reguard);
diff --git a/src/hotspot/cpu/ppc/downcallLinker_ppc.cpp b/src/hotspot/cpu/ppc/downcallLinker_ppc.cpp
index f12d25ac611..d149fc33ac3 100644
--- a/src/hotspot/cpu/ppc/downcallLinker_ppc.cpp
+++ b/src/hotspot/cpu/ppc/downcallLinker_ppc.cpp
@@ -1,6 +1,6 @@
 /*
  * Copyright (c) 2020, 2025 SAP SE. All rights reserved.
- * Copyright (c) 2020, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -135,10 +135,10 @@ void DowncallLinker::StubGenerator::generate() {
 
   bool should_save_return_value = !_needs_return_buffer;
   RegSpiller out_reg_spiller(_output_registers);
-  int spill_offset = -1;
+  int out_spill_offset = -1;
 
   if (should_save_return_value) {
-    spill_offset = frame::native_abi_reg_args_size;
+    out_spill_offset = frame::native_abi_reg_args_size;
     // Spill area can be shared with additional out args (>8),
     // since it is only used after the call.
     int frame_size_including_spill_area = frame::native_abi_reg_args_size + out_reg_spiller.spill_size_bytes();
@@ -170,6 +170,18 @@ void DowncallLinker::StubGenerator::generate() {
 
   ArgumentShuffle arg_shuffle(filtered_java_regs, out_regs, _abi._scratch1);
 
+  // Need to spill for state capturing runtime call.
+  // The area spilled into is distinct from the capture state buffer.
+  RegSpiller in_reg_spiller(out_regs);
+  int in_spill_offset = -1;
+  if (_captured_state_mask != 0) {
+    // The spill area cannot be shared with the out_spill since
+    // spilling needs to happen before the call. Allocate a new
+    // region in the stack for this spill space.
+    in_spill_offset = allocated_frame_size;
+    allocated_frame_size += in_reg_spiller.spill_size_bytes();
+  }
+
 #ifndef PRODUCT
   LogTarget(Trace, foreign, downcall) lt;
   if (lt.is_enabled()) {
@@ -211,6 +223,21 @@ void DowncallLinker::StubGenerator::generate() {
   arg_shuffle.generate(_masm, as_VMStorage(callerSP), frame::jit_out_preserve_size, frame::native_abi_minframe_size);
   __ block_comment("} argument shuffle");
 
+  if (_captured_state_mask != 0) {
+    assert(in_spill_offset != -1, "must be");
+    __ block_comment("{ load initial thread local");
+    in_reg_spiller.generate_spill(_masm, in_spill_offset);
+
+    // Copy the contents of the capture state buffer into thread local
+    __ load_const_optimized(call_target_address, CAST_FROM_FN_PTR(uint64_t, DowncallLinker::capture_state_pre), R0);
+    __ ld(R3_ARG1, locs.data_offset(StubLocations::CAPTURED_STATE_BUFFER), R1_SP);
+    __ load_const_optimized(R4_ARG2, _captured_state_mask, R0);
+    __ call_c(call_target_address);
+
+    in_reg_spiller.generate_fill(_masm, in_spill_offset);
+    __ block_comment("} load initial thread local");
+  }
+
   __ call_c(call_target_address);
 
   if (_needs_return_buffer) {
@@ -247,16 +274,16 @@ void DowncallLinker::StubGenerator::generate() {
     __ block_comment("{ save thread local");
 
     if (should_save_return_value) {
-      out_reg_spiller.generate_spill(_masm, spill_offset);
+      out_reg_spiller.generate_spill(_masm, out_spill_offset);
     }
 
-    __ load_const_optimized(call_target_address, CAST_FROM_FN_PTR(uint64_t, DowncallLinker::capture_state), R0);
+    __ load_const_optimized(call_target_address, CAST_FROM_FN_PTR(uint64_t, DowncallLinker::capture_state_post), R0);
     __ ld(R3_ARG1, locs.data_offset(StubLocations::CAPTURED_STATE_BUFFER), R1_SP);
     __ load_const_optimized(R4_ARG2, _captured_state_mask, R0);
     __ call_c(call_target_address);
 
     if (should_save_return_value) {
-      out_reg_spiller.generate_fill(_masm, spill_offset);
+      out_reg_spiller.generate_fill(_masm, out_spill_offset);
     }
 
     __ block_comment("} save thread local");
@@ -310,7 +337,7 @@ void DowncallLinker::StubGenerator::generate() {
 
     if (should_save_return_value) {
       // Need to save the native result registers around any runtime calls.
-      out_reg_spiller.generate_spill(_masm, spill_offset);
+      out_reg_spiller.generate_spill(_masm, out_spill_offset);
     }
 
     __ load_const_optimized(call_target_address, CAST_FROM_FN_PTR(uint64_t, JavaThread::check_special_condition_for_native_trans), R0);
@@ -318,7 +345,7 @@ void DowncallLinker::StubGenerator::generate() {
     __ call_c(call_target_address);
 
     if (should_save_return_value) {
-      out_reg_spiller.generate_fill(_masm, spill_offset);
+      out_reg_spiller.generate_fill(_masm, out_spill_offset);
     }
 
     __ b(L_after_safepoint_poll);
@@ -330,14 +357,14 @@ void DowncallLinker::StubGenerator::generate() {
     __ bind(L_reguard);
 
     if (should_save_return_value) {
-      out_reg_spiller.generate_spill(_masm, spill_offset);
+      out_reg_spiller.generate_spill(_masm, out_spill_offset);
     }
 
     __ load_const_optimized(call_target_address, CAST_FROM_FN_PTR(uint64_t, SharedRuntime::reguard_yellow_pages), R0);
     __ call_c(call_target_address);
 
     if (should_save_return_value) {
-      out_reg_spiller.generate_fill(_masm, spill_offset);
+      out_reg_spiller.generate_fill(_masm, out_spill_offset);
     }
 
     __ b(L_after_reguard);
diff --git a/src/hotspot/cpu/riscv/downcallLinker_riscv.cpp b/src/hotspot/cpu/riscv/downcallLinker_riscv.cpp
index cc685645ec5..f9d7ce78ff0 100644
--- a/src/hotspot/cpu/riscv/downcallLinker_riscv.cpp
+++ b/src/hotspot/cpu/riscv/downcallLinker_riscv.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2020, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
  * Copyright (c) 2020, 2023, Huawei Technologies Co., Ltd. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
@@ -140,10 +140,10 @@ void DowncallLinker::StubGenerator::generate() {
 
   bool should_save_return_value = !_needs_return_buffer;
   RegSpiller out_reg_spiller(_output_registers);
-  int spill_offset = -1;
+  int out_spill_offset = -1;
 
   if (should_save_return_value) {
-    spill_offset = 0;
+    out_spill_offset = 0;
     // spill area can be shared with shadow space and out args,
     // since they are only used before the call,
     // and spill area is only used after.
@@ -168,6 +168,9 @@ void DowncallLinker::StubGenerator::generate() {
   // FP-> |                     |
   //      |---------------------| = frame_bottom_offset = frame_size
   //      | (optional)          |
+  //      | in_reg_spiller area |
+  //      |---------------------|
+  //      | (optional)          |
   //      | capture state buf   |
   //      |---------------------| = StubLocations::CAPTURED_STATE_BUFFER
   //      | (optional)          |
@@ -181,6 +184,18 @@ void DowncallLinker::StubGenerator::generate() {
   GrowableArray<VMStorage> out_regs = ForeignGlobals::replace_place_holders(_input_registers, locs);
   ArgumentShuffle arg_shuffle(filtered_java_regs, out_regs, shuffle_reg);
 
+  // Need to spill for state capturing runtime call.
+  // The area spilled into is distinct from the capture state buffer.
+  RegSpiller in_reg_spiller(out_regs);
+  int in_spill_offset = -1;
+  if (_captured_state_mask != 0) {
+    // The spill area cannot be shared with the out_spill since
+    // spilling needs to happen before the call. Allocate a new
+    // region in the stack for this spill space.
+    in_spill_offset = allocated_frame_size;
+    allocated_frame_size += in_reg_spiller.spill_size_bytes();
+  }
+
 #ifndef PRODUCT
   LogTarget(Trace, foreign, downcall) lt;
   if (lt.is_enabled()) {
@@ -226,6 +241,20 @@ void DowncallLinker::StubGenerator::generate() {
   arg_shuffle.generate(_masm, shuffle_reg, 0, _abi._shadow_space_bytes);
   __ block_comment("} argument shuffle");
 
+  if (_captured_state_mask != 0) {
+    assert(in_spill_offset != -1, "must be");
+    __ block_comment("{ load initial thread local");
+    in_reg_spiller.generate_spill(_masm, in_spill_offset);
+
+    // Copy the contents of the capture state buffer into thread local
+    __ ld(c_rarg0, Address(sp, locs.data_offset(StubLocations::CAPTURED_STATE_BUFFER)));
+    __ mv(c_rarg1, _captured_state_mask);
+    __ rt_call(CAST_FROM_FN_PTR(address, DowncallLinker::capture_state_pre));
+
+    in_reg_spiller.generate_fill(_masm, in_spill_offset);
+    __ block_comment("} load initial thread local");
+  }
+
   __ jalr(as_Register(locs.get(StubLocations::TARGET_ADDRESS)));
   // this call is assumed not to have killed xthread
 
@@ -254,15 +283,15 @@ void DowncallLinker::StubGenerator::generate() {
     __ block_comment("{ save thread local");
 
     if (should_save_return_value) {
-      out_reg_spiller.generate_spill(_masm, spill_offset);
+      out_reg_spiller.generate_spill(_masm, out_spill_offset);
     }
 
     __ ld(c_rarg0, Address(sp, locs.data_offset(StubLocations::CAPTURED_STATE_BUFFER)));
     __ mv(c_rarg1, _captured_state_mask);
-    __ rt_call(CAST_FROM_FN_PTR(address, DowncallLinker::capture_state));
+    __ rt_call(CAST_FROM_FN_PTR(address, DowncallLinker::capture_state_post));
 
     if (should_save_return_value) {
-      out_reg_spiller.generate_fill(_masm, spill_offset);
+      out_reg_spiller.generate_fill(_masm, out_spill_offset);
     }
 
     __ block_comment("} save thread local");
@@ -319,7 +348,7 @@ void DowncallLinker::StubGenerator::generate() {
 
     if (should_save_return_value) {
       // Need to save the native result registers around any runtime calls.
-      out_reg_spiller.generate_spill(_masm, spill_offset);
+      out_reg_spiller.generate_spill(_masm, out_spill_offset);
     }
 
     __ mv(c_rarg0, xthread);
@@ -327,7 +356,7 @@ void DowncallLinker::StubGenerator::generate() {
     __ rt_call(CAST_FROM_FN_PTR(address, JavaThread::check_special_condition_for_native_trans));
 
     if (should_save_return_value) {
-      out_reg_spiller.generate_fill(_masm, spill_offset);
+      out_reg_spiller.generate_fill(_masm, out_spill_offset);
     }
     __ j(L_after_safepoint_poll);
     __ block_comment("} L_safepoint_poll_slow_path");
@@ -339,13 +368,13 @@ void DowncallLinker::StubGenerator::generate() {
 
     if (should_save_return_value) {
       // Need to save the native result registers around any runtime calls.
-      out_reg_spiller.generate_spill(_masm, spill_offset);
+      out_reg_spiller.generate_spill(_masm, out_spill_offset);
     }
 
     __ rt_call(CAST_FROM_FN_PTR(address, SharedRuntime::reguard_yellow_pages));
 
     if (should_save_return_value) {
-      out_reg_spiller.generate_fill(_masm, spill_offset);
+      out_reg_spiller.generate_fill(_masm, out_spill_offset);
     }
 
     __ j(L_after_reguard);
diff --git a/src/hotspot/cpu/s390/downcallLinker_s390.cpp b/src/hotspot/cpu/s390/downcallLinker_s390.cpp
index ccd8002da37..f1c41d05b5c 100644
--- a/src/hotspot/cpu/s390/downcallLinker_s390.cpp
+++ b/src/hotspot/cpu/s390/downcallLinker_s390.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2022, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2022, 2026, Oracle and/or its affiliates. All rights reserved.
  * Copyright (c) 2020, Red Hat, Inc. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
@@ -129,7 +129,7 @@ void DowncallLinker::StubGenerator::generate() {
 
   assert(!_needs_return_buffer, "unexpected needs_return_buffer");
   RegSpiller out_reg_spiller(_output_registers);
-  int spill_offset = allocated_frame_size;
+  int out_spill_offset = allocated_frame_size;
   allocated_frame_size += BytesPerWord;
 
   StubLocations locs;
@@ -153,6 +153,18 @@ void DowncallLinker::StubGenerator::generate() {
   GrowableArray<VMStorage> out_regs = ForeignGlobals::replace_place_holders(_input_registers, locs);
   ArgumentShuffle arg_shuffle(filtered_java_regs, out_regs, _abi._scratch1);
 
+  // Need to spill for state capturing runtime call.
+  // The area spilled into is distinct from the capture state buffer.
+  RegSpiller in_reg_spiller(out_regs);
+  int in_spill_offset = -1;
+  if (_captured_state_mask != 0) {
+    // The spill area cannot be shared with the out_spill since
+    // spilling needs to happen before the call. Allocate a new
+    // region in the stack for this spill space.
+    in_spill_offset = allocated_frame_size;
+    allocated_frame_size += in_reg_spiller.spill_size_bytes();
+  }
+
 #ifndef PRODUCT
   LogTarget(Trace, foreign, downcall) lt;
   if (lt.is_enabled()) {
@@ -192,6 +204,21 @@ void DowncallLinker::StubGenerator::generate() {
   arg_shuffle.generate(_masm, shuffle_reg, frame::z_jit_out_preserve_size, _abi._shadow_space_bytes);
   __ block_comment("} argument_shuffle");
 
+  if (_captured_state_mask != 0) {
+    assert(in_spill_offset != -1, "must be");
+    __ block_comment("{ load initial thread local");
+    in_reg_spiller.generate_spill(_masm, in_spill_offset);
+
+    // Copy the contents of the capture state buffer into thread local
+    __ load_const_optimized(call_target_address, CAST_FROM_FN_PTR(uint64_t, DowncallLinker::capture_state_pre));
+    __ z_lg(Z_ARG1, Address(Z_SP, locs.data_offset(StubLocations::CAPTURED_STATE_BUFFER)));
+    __ load_const_optimized(Z_ARG2, _captured_state_mask);
+    __ call(call_target_address);
+
+    in_reg_spiller.generate_fill(_masm, in_spill_offset);
+    __ block_comment("} load initial thread local");
+  }
+
   __ call(as_Register(locs.get(StubLocations::TARGET_ADDRESS)));
 
   //////////////////////////////////////////////////////////////////////////////
@@ -199,14 +226,14 @@ void DowncallLinker::StubGenerator::generate() {
   if (_captured_state_mask != 0) {
     __ block_comment("save_thread_local {");
 
-      out_reg_spiller.generate_spill(_masm, spill_offset);
+      out_reg_spiller.generate_spill(_masm, out_spill_offset);
 
-    __ load_const_optimized(call_target_address, CAST_FROM_FN_PTR(uint64_t, DowncallLinker::capture_state));
+    __ load_const_optimized(call_target_address, CAST_FROM_FN_PTR(uint64_t, DowncallLinker::capture_state_post));
     __ z_lg(Z_ARG1, Address(Z_SP, locs.data_offset(StubLocations::CAPTURED_STATE_BUFFER)));
     __ load_const_optimized(Z_ARG2, _captured_state_mask);
     __ call(call_target_address);
 
-      out_reg_spiller.generate_fill(_masm, spill_offset);
+      out_reg_spiller.generate_fill(_masm, out_spill_offset);
 
     __ block_comment("} save_thread_local");
   }
@@ -259,13 +286,13 @@ void DowncallLinker::StubGenerator::generate() {
     __ bind(L_safepoint_poll_slow_path);
 
       // Need to save the native result registers around any runtime calls.
-      out_reg_spiller.generate_spill(_masm, spill_offset);
+      out_reg_spiller.generate_spill(_masm, out_spill_offset);
 
     __ load_const_optimized(call_target_address, CAST_FROM_FN_PTR(uint64_t, JavaThread::check_special_condition_for_native_trans));
     __ z_lgr(Z_ARG1, Z_thread);
     __ call(call_target_address);
 
-      out_reg_spiller.generate_fill(_masm, spill_offset);
+      out_reg_spiller.generate_fill(_masm, out_spill_offset);
 
     __ z_bru(L_after_safepoint_poll);
     __ block_comment("} L_safepoint_poll_slow_path");
@@ -275,12 +302,12 @@ void DowncallLinker::StubGenerator::generate() {
     __ bind(L_reguard);
 
       // Need to save the native result registers around any runtime calls.
-      out_reg_spiller.generate_spill(_masm, spill_offset);
+      out_reg_spiller.generate_spill(_masm, out_spill_offset);
 
     __ load_const_optimized(call_target_address, CAST_FROM_FN_PTR(uint64_t, SharedRuntime::reguard_yellow_pages));
     __ call(call_target_address);
 
-      out_reg_spiller.generate_fill(_masm, spill_offset);
+      out_reg_spiller.generate_fill(_masm, out_spill_offset);
 
     __ z_bru(L_after_reguard);
 
diff --git a/src/hotspot/cpu/x86/downcallLinker_x86_64.cpp b/src/hotspot/cpu/x86/downcallLinker_x86_64.cpp
index c48940198ea..e3bf5f17fe9 100644
--- a/src/hotspot/cpu/x86/downcallLinker_x86_64.cpp
+++ b/src/hotspot/cpu/x86/downcallLinker_x86_64.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2020, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -145,10 +145,10 @@ void DowncallLinker::StubGenerator::generate() {
   // when we don't use a return buffer we need to spill the return value around our slow path calls
   bool should_save_return_value = !_needs_return_buffer;
   RegSpiller out_reg_spiller(_output_registers);
-  int spill_rsp_offset = -1;
+  int out_spill_rsp_offset = -1;
 
   if (should_save_return_value) {
-    spill_rsp_offset = 0;
+    out_spill_rsp_offset = 0;
     // spill area can be shared with shadow space and out args,
     // since they are only used before the call,
     // and spill area is only used after.
@@ -173,6 +173,9 @@ void DowncallLinker::StubGenerator::generate() {
   // FP-> |                     |
   //      |---------------------| = frame_bottom_offset = frame_size
   //      | (optional)          |
+  //      | in_reg_spiller area |
+  //      |---------------------|
+  //      | (optional)          |
   //      | capture state buf   |
   //      |---------------------| = StubLocations::CAPTURED_STATE_BUFFER
   //      | (optional)          |
@@ -188,6 +191,18 @@ void DowncallLinker::StubGenerator::generate() {
   VMStorage shuffle_reg = as_VMStorage(rbx);
   ArgumentShuffle arg_shuffle(filtered_java_regs, out_regs, shuffle_reg);
 
+  // Need to spill for state capturing runtime call.
+  // The area spilled into is distinct from the capture state buffer.
+  RegSpiller in_reg_spiller(out_regs);
+  int in_spill_rsp_offset = -1;
+  if (_captured_state_mask != 0) {
+    // The spill area cannot be shared with the shadow/out args space
+    // since spilling needs to happen before the call. Allocate a new
+    // region in the stack for this spill space.
+    in_spill_rsp_offset = allocated_frame_size;
+    allocated_frame_size += in_reg_spiller.spill_size_bytes();
+  }
+
 #ifndef PRODUCT
   LogTarget(Trace, foreign, downcall) lt;
   if (lt.is_enabled()) {
@@ -232,6 +247,19 @@ void DowncallLinker::StubGenerator::generate() {
   arg_shuffle.generate(_masm, shuffle_reg, 0, _abi._shadow_space_bytes);
   __ block_comment("} argument shuffle");
 
+  if (_captured_state_mask != 0) {
+    assert(in_spill_rsp_offset != -1, "must be");
+    __ block_comment("{ load initial thread local");
+    in_reg_spiller.generate_spill(_masm, in_spill_rsp_offset);
+
+    // Copy the contents of the capture state buffer into thread local
+    __ movptr(c_rarg0, Address(rsp, locs.data_offset(StubLocations::CAPTURED_STATE_BUFFER)));
+    __ movl(c_rarg1, _captured_state_mask);
+    runtime_call(_masm, CAST_FROM_FN_PTR(address, DowncallLinker::capture_state_pre));
+
+    in_reg_spiller.generate_fill(_masm, in_spill_rsp_offset);
+    __ block_comment("} load initial thread local");
+  }
   __ call(as_Register(locs.get(StubLocations::TARGET_ADDRESS)));
   assert(!_abi.is_volatile_reg(r15_thread), "Call assumed not to kill r15");
 
@@ -258,15 +286,15 @@ void DowncallLinker::StubGenerator::generate() {
     __ block_comment("{ save thread local");
 
     if (should_save_return_value) {
-      out_reg_spiller.generate_spill(_masm, spill_rsp_offset);
+      out_reg_spiller.generate_spill(_masm, out_spill_rsp_offset);
     }
 
     __ movptr(c_rarg0, Address(rsp, locs.data_offset(StubLocations::CAPTURED_STATE_BUFFER)));
     __ movl(c_rarg1, _captured_state_mask);
-    runtime_call(_masm, CAST_FROM_FN_PTR(address, DowncallLinker::capture_state));
+    runtime_call(_masm, CAST_FROM_FN_PTR(address, DowncallLinker::capture_state_post));
 
     if (should_save_return_value) {
-      out_reg_spiller.generate_fill(_masm, spill_rsp_offset);
+      out_reg_spiller.generate_fill(_masm, out_spill_rsp_offset);
     }
 
     __ block_comment("} save thread local");
@@ -319,14 +347,14 @@ void DowncallLinker::StubGenerator::generate() {
     __ bind(L_safepoint_poll_slow_path);
 
     if (should_save_return_value) {
-      out_reg_spiller.generate_spill(_masm, spill_rsp_offset);
+      out_reg_spiller.generate_spill(_masm, out_spill_rsp_offset);
     }
 
     __ mov(c_rarg0, r15_thread);
     runtime_call(_masm, CAST_FROM_FN_PTR(address, JavaThread::check_special_condition_for_native_trans));
 
     if (should_save_return_value) {
-      out_reg_spiller.generate_fill(_masm, spill_rsp_offset);
+      out_reg_spiller.generate_fill(_masm, out_spill_rsp_offset);
     }
 
     __ jmp(L_after_safepoint_poll);
@@ -338,13 +366,13 @@ void DowncallLinker::StubGenerator::generate() {
     __ bind(L_reguard);
 
     if (should_save_return_value) {
-      out_reg_spiller.generate_spill(_masm, spill_rsp_offset);
+      out_reg_spiller.generate_spill(_masm, out_spill_rsp_offset);
     }
 
     runtime_call(_masm, CAST_FROM_FN_PTR(address, SharedRuntime::reguard_yellow_pages));
 
     if (should_save_return_value) {
-      out_reg_spiller.generate_fill(_masm, spill_rsp_offset);
+      out_reg_spiller.generate_fill(_masm, out_spill_rsp_offset);
     }
 
     __ jmp(L_after_reguard);
diff --git a/src/hotspot/share/prims/downcallLinker.cpp b/src/hotspot/share/prims/downcallLinker.cpp
index 5dde825d75f..cbef9841652 100644
--- a/src/hotspot/share/prims/downcallLinker.cpp
+++ b/src/hotspot/share/prims/downcallLinker.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2022, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2022, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -30,15 +30,34 @@
 #include <Winsock2.h>
 #endif
 
+// keep in synch with jdk.internal.foreign.abi.CapturableState
+enum PreservableValues {
+  NONE = 0,
+  GET_LAST_ERROR = 1,
+  WSA_GET_LAST_ERROR = 1 << 1,
+  ERRNO = 1 << 2
+};
+
+// We call this from _thread_in_native, right before a downcall
+JVM_LEAF(void, DowncallLinker::capture_state_pre(int32_t* value_ptr, int captured_state_mask))
+#ifdef _WIN64
+  if (captured_state_mask & GET_LAST_ERROR) {
+    SetLastError(*value_ptr);
+  }
+  value_ptr++;
+  if (captured_state_mask & WSA_GET_LAST_ERROR) {
+    WSASetLastError(*value_ptr);
+    *value_ptr = WSAGetLastError();
+  }
+  value_ptr++;
+#endif
+  if (captured_state_mask & ERRNO) {
+    errno = *value_ptr;
+  }
+JVM_END
+
 // We call this from _thread_in_native, right after a downcall
-JVM_LEAF(void, DowncallLinker::capture_state(int32_t* value_ptr, int captured_state_mask))
-  // keep in synch with jdk.internal.foreign.abi.CapturableState
-  enum PreservableValues {
-    NONE = 0,
-    GET_LAST_ERROR = 1,
-    WSA_GET_LAST_ERROR = 1 << 1,
-    ERRNO = 1 << 2
-  };
+JVM_LEAF(void, DowncallLinker::capture_state_post(int32_t* value_ptr, int captured_state_mask))
 #ifdef _WIN64
   if (captured_state_mask & GET_LAST_ERROR) {
     *value_ptr = GetLastError();
diff --git a/src/hotspot/share/prims/downcallLinker.hpp b/src/hotspot/share/prims/downcallLinker.hpp
index 01ee5c56776..2c2cf053033 100644
--- a/src/hotspot/share/prims/downcallLinker.hpp
+++ b/src/hotspot/share/prims/downcallLinker.hpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2020, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -41,8 +41,9 @@ public:
                                          int captured_state_mask,
                                          bool needs_transition);
 
-  // This is defined as JVM_LEAF which adds the JNICALL modifier.
-  static void JNICALL capture_state(int32_t* value_ptr, int captured_state_mask);
+  // These are defined as JVM_LEAF which adds the JNICALL modifier.
+  static void JNICALL capture_state_pre(int32_t* value_ptr, int captured_state_mask);
+  static void JNICALL capture_state_post(int32_t* value_ptr, int captured_state_mask);
 
   class StubGenerator : public StubCodeGenerator {
     BasicType* _signature;
diff --git a/src/java.base/share/classes/java/lang/foreign/Linker.java b/src/java.base/share/classes/java/lang/foreign/Linker.java
index cfa03090299..1a7d33266aa 100644
--- a/src/java.base/share/classes/java/lang/foreign/Linker.java
+++ b/src/java.base/share/classes/java/lang/foreign/Linker.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2020, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -813,25 +813,28 @@ public sealed interface Linker permits AbstractLinker {
         }
 
         /**
-         * {@return a linker option used to save portions of the execution state
-         *          immediately after calling a foreign function associated with a
-         *          downcall method handle, before it can be overwritten by the Java
-         *          runtime, or read through conventional means}
+         * {@return a linker option used to initialize portions of the execution
+         *          state immediately before, and save portions of the execution
+         *          state immediately after calling a foreign function associated
+         *          with a downcall method handle, before it can be overwritten by the
+         *          Java runtime, or read through conventional means}
          * <p>
-         * Execution state is captured by a downcall method handle on invocation, by
-         * writing it to a native segment provided by the user to the downcall method
-         * handle. For this purpose, a downcall method handle linked with this option
-         * will feature an additional {@link MemorySegment} parameter directly following
-         * the target address, and optional {@link SegmentAllocator} parameters. This
-         * parameter, the <em>capture state segment</em>, represents the native segment
-         * into which the captured state is written.
+         * Execution state is initialized from, or saved to a native segment provided by
+         * the user to the downcall method handle. For this purpose, a downcall method
+         * handle linked with this option will feature an additional {@link MemorySegment}
+         * parameter directly following the target address, and optional {@link SegmentAllocator}
+         * parameters. This parameter, the <em>capture state segment</em>, represents the
+         * native segment from which the capture state is initialized, and into which the
+         * capture state is saved.
          * <p>
          * The capture state segment must have size and alignment compatible with the
          * layout returned by {@linkplain #captureStateLayout}. This layout is a struct
          * layout which has a named field for each captured value.
          * <p>
-         * Captured state can be retrieved from the capture state segment by constructing
-         * var handles from the {@linkplain #captureStateLayout capture state layout}.
+         * Captured state can be stored in, or retrieved from the capture state segment by
+         * constructing var handles from the {@linkplain #captureStateLayout capture state layout}.
+         * Some functions require this state the be initialized to a particular value before
+         * invoking the downcall.
          * <p>
          * The following example demonstrates the use of this linker option:
          * {@snippet lang = "java":
@@ -843,6 +846,7 @@ public sealed interface Linker permits AbstractLinker {
          * VarHandle errnoHandle = capturedStateLayout.varHandle(PathElement.groupElement("errno"));
          * try (Arena arena = Arena.ofConfined()) {
          *     MemorySegment capturedState = arena.allocate(capturedStateLayout);
+         *     errnoHandle.set(capturedState, 0L, 0); // set errno to 0
          *     handle.invoke(capturedState);
          *     int errno = (int) errnoHandle.get(capturedState, 0L);
          *     // use errno
diff --git a/src/java.base/share/native/libfallbackLinker/fallbackLinker.c b/src/java.base/share/native/libfallbackLinker/fallbackLinker.c
index 3f57a2b97cf..7519efd93bb 100644
--- a/src/java.base/share/native/libfallbackLinker/fallbackLinker.c
+++ b/src/java.base/share/native/libfallbackLinker/fallbackLinker.c
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2023, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2023, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -87,14 +87,32 @@ Java_jdk_internal_foreign_abi_fallback_LibFallback_ffi_1get_1struct_1offsets(JNI
   return ffi_get_struct_offsets((ffi_abi) abi, jlong_to_ptr(type), jlong_to_ptr(offsets));
 }
 
-static void do_capture_state(int32_t* value_ptr, int captured_state_mask) {
-    // keep in synch with jdk.internal.foreign.abi.CapturableState
-  enum PreservableValues {
-    NONE = 0,
-    GET_LAST_ERROR = 1,
-    WSA_GET_LAST_ERROR = 1 << 1,
-    ERRNO = 1 << 2
-  };
+// keep in synch with jdk.internal.foreign.abi.CapturableState
+enum PreservableValues {
+  NONE = 0,
+  GET_LAST_ERROR = 1,
+  WSA_GET_LAST_ERROR = 1 << 1,
+  ERRNO = 1 << 2
+};
+
+static void do_capture_state_pre(int32_t* value_ptr, int captured_state_mask) {
+#ifdef _WIN64
+  if (captured_state_mask & GET_LAST_ERROR) {
+    SetLastError(*value_ptr);
+  }
+  value_ptr++;
+  if (captured_state_mask & WSA_GET_LAST_ERROR) {
+    WSASetLastError(*value_ptr);
+    *value_ptr = WSAGetLastError();
+  }
+  value_ptr++;
+#endif
+  if (captured_state_mask & ERRNO) {
+    errno = *value_ptr;
+  }
+}
+
+static void do_capture_state_post(int32_t* value_ptr, int captured_state_mask) {
 #ifdef _WIN64
   if (captured_state_mask & GET_LAST_ERROR) {
     *value_ptr = GetLastError();
@@ -142,10 +160,15 @@ Java_jdk_internal_foreign_abi_fallback_LibFallback_doDowncall(JNIEnv* env, jclas
     }
   }
 
+  if (captured_state_mask != 0) {
+    // Copy the contents of the capture state buffer into thread local
+    do_capture_state_pre(captured_state_addr, captured_state_mask);
+  }
+
   ffi_call(jlong_to_ptr(cif), jlong_to_ptr(fn), jlong_to_ptr(rvalue), jlong_to_ptr(avalues));
 
   if (captured_state_mask != 0) {
-    do_capture_state(captured_state_addr, captured_state_mask);
+    do_capture_state_post(captured_state_addr, captured_state_mask);
   }
 
   if (heapBases != NULL) {
diff --git a/test/jdk/java/foreign/capturecallstate/TestCaptureCallState.java b/test/jdk/java/foreign/capturecallstate/TestCaptureCallState.java
index 2c69c5691b8..8ef5483bd82 100644
--- a/test/jdk/java/foreign/capturecallstate/TestCaptureCallState.java
+++ b/test/jdk/java/foreign/capturecallstate/TestCaptureCallState.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2022, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2022, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -73,7 +73,7 @@ public class TestCaptureCallState extends NativeTestHelper {
     }
 
     private record SaveValuesCase(String nativeTarget, FunctionDescriptor nativeDesc, String threadLocalName,
-                                  Consumer<Object> resultCheck, boolean critical) {}
+                                  Consumer<Object> resultCheck, boolean expectTestValue, boolean critical) {}
 
     @Test(dataProvider = "cases")
     public void testSavedThreadLocal(SaveValuesCase testCase) throws Throwable {
@@ -90,14 +90,21 @@ public class TestCaptureCallState extends NativeTestHelper {
 
         try (Arena arena = Arena.ofConfined()) {
             MemorySegment saveSeg = arena.allocate(capturedStateLayout);
+            // The existing value and the value that it should be overwritten with
+            int prevValue = 24;
             int testValue = 42;
+            errnoHandle.set(saveSeg, 0L, prevValue);
             boolean needsAllocator = testCase.nativeDesc().returnLayout().map(StructLayout.class::isInstance).orElse(false);
             Object result = needsAllocator
                 ? handle.invoke(arena, saveSeg, testValue)
                 : handle.invoke(saveSeg, testValue);
             testCase.resultCheck().accept(result);
             int savedErrno = (int) errnoHandle.get(saveSeg, 0L);
-            assertEquals(savedErrno, testValue);
+            if (testCase.expectTestValue()) {
+                assertEquals(savedErrno, testValue);
+            } else {
+                assertEquals(savedErrno, prevValue);
+            }
         }
     }
 
@@ -127,37 +134,45 @@ public class TestCaptureCallState extends NativeTestHelper {
 
         for (boolean critical : new boolean[]{ true, false }) {
             cases.add(new SaveValuesCase("set_errno_V", FunctionDescriptor.ofVoid(JAVA_INT),
-                    "errno", o -> {}, critical));
+                    "errno", o -> {}, true, critical));
+            cases.add(new SaveValuesCase("noset_errno_V", FunctionDescriptor.ofVoid(JAVA_INT),
+                    "errno", o -> {}, false, critical));
             cases.add(new SaveValuesCase("set_errno_I", FunctionDescriptor.of(JAVA_INT, JAVA_INT),
-                    "errno", o -> assertEquals((int) o, 42), critical));
+                    "errno", o -> assertEquals((int) o, 42), true, critical));
             cases.add(new SaveValuesCase("set_errno_D", FunctionDescriptor.of(JAVA_DOUBLE, JAVA_INT),
-                    "errno", o -> assertEquals((double) o, 42.0), critical));
+                    "errno", o -> assertEquals((double) o, 42.0), true, critical));
 
-            cases.add(structCase("SL", Map.of(JAVA_LONG.withName("x"), 42L), critical));
+            cases.add(structCase("SL", Map.of(JAVA_LONG.withName("x"), 42L), true, critical));
             cases.add(structCase("SLL", Map.of(JAVA_LONG.withName("x"), 42L,
-                    JAVA_LONG.withName("y"), 42L), critical));
+                    JAVA_LONG.withName("y"), 42L), true, critical));
             cases.add(structCase("SLLL", Map.of(JAVA_LONG.withName("x"), 42L,
                     JAVA_LONG.withName("y"), 42L,
-                    JAVA_LONG.withName("z"), 42L), critical));
-            cases.add(structCase("SD", Map.of(JAVA_DOUBLE.withName("x"), 42D), critical));
+                    JAVA_LONG.withName("z"), 42L), true, critical));
+            cases.add(structCase("SLLL", Map.of(JAVA_LONG.withName("x"), 42L,
+                    JAVA_LONG.withName("y"), 42L,
+                    JAVA_LONG.withName("z"), 42L), false, critical));
+            cases.add(structCase("SD", Map.of(JAVA_DOUBLE.withName("x"), 42D), true, critical));
             cases.add(structCase("SDD", Map.of(JAVA_DOUBLE.withName("x"), 42D,
-                    JAVA_DOUBLE.withName("y"), 42D), critical));
+                    JAVA_DOUBLE.withName("y"), 42D), true, critical));
             cases.add(structCase("SDDD", Map.of(JAVA_DOUBLE.withName("x"), 42D,
                     JAVA_DOUBLE.withName("y"), 42D,
-                    JAVA_DOUBLE.withName("z"), 42D), critical));
+                    JAVA_DOUBLE.withName("z"), 42D), true, critical));
 
             if (IS_WINDOWS) {
                 cases.add(new SaveValuesCase("SetLastError", FunctionDescriptor.ofVoid(JAVA_INT),
-                        "GetLastError", o -> {}, critical));
+                        "GetLastError", o -> {}, true, critical));
                 cases.add(new SaveValuesCase("WSASetLastError", FunctionDescriptor.ofVoid(JAVA_INT),
-                        "WSAGetLastError", o -> {}, critical));
+                        "WSAGetLastError", o -> {}, true, critical));
             }
         }
 
         return cases.stream().map(tc -> new Object[] {tc}).toArray(Object[][]::new);
     }
 
-    static SaveValuesCase structCase(String name, Map<MemoryLayout, Object> fields, boolean critical) {
+    static SaveValuesCase structCase(String name,
+                                     Map<MemoryLayout, Object> fields,
+                                     boolean expectTestValue,
+                                     boolean critical) {
         StructLayout layout = MemoryLayout.structLayout(fields.keySet().toArray(MemoryLayout[]::new));
 
         Consumer<Object> check = o -> {};
@@ -167,9 +182,9 @@ public class TestCaptureCallState extends NativeTestHelper {
             Object value = field.getValue();
             check = check.andThen(o -> assertEquals(fieldHandle.get(o, 0L), value));
         }
-
-        return new SaveValuesCase("set_errno_" + name, FunctionDescriptor.of(layout, JAVA_INT),
-                "errno", check, critical);
+        String prefix = expectTestValue ? "set_errno_" : "noset_errno_";
+        return new SaveValuesCase(prefix + name, FunctionDescriptor.of(layout, JAVA_INT),
+                "errno", check, expectTestValue, critical);
     }
 
     @DataProvider
diff --git a/test/jdk/java/foreign/capturecallstate/libCaptureCallState.c b/test/jdk/java/foreign/capturecallstate/libCaptureCallState.c
index d76c9d7beda..fe0d144cb5b 100644
--- a/test/jdk/java/foreign/capturecallstate/libCaptureCallState.c
+++ b/test/jdk/java/foreign/capturecallstate/libCaptureCallState.c
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2022, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2022, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -29,6 +29,10 @@ EXPORT void set_errno_V(int value) {
     errno = value;
 }
 
+EXPORT int noset_errno_V(int value) {
+    return 42;
+}
+
 EXPORT int set_errno_I(int value) {
     errno = value;
     return 42;
@@ -78,6 +82,14 @@ EXPORT struct SLLL set_errno_SLLL(int value) {
     return s;
 }
 
+EXPORT struct SLLL noset_errno_SLLL(int value) {
+    struct SLLL s;
+    s.x = 42;
+    s.y = 42;
+    s.z = 42;
+    return s;
+}
+
 struct SD {
     double x;
 };

From 256512147d4ecabfddf29f8391640743d63ebc21 Mon Sep 17 00:00:00 2001
From: Martin Doerr <mdoerr@openjdk.org>
Date: Wed, 11 Mar 2026 09:29:29 +0000
Subject: [PATCH 148/655] 8379448: [PPC64] Build without C2 broken after
 8373595

Reviewed-by: rrich, aboldtch, mbaesken, dbriemann
---
 .../ppc/gc/shared/barrierSetAssembler_ppc.cpp | 12 ++++----
 .../ppc/gc/shared/barrierSetAssembler_ppc.hpp | 10 +++++--
 .../shenandoahBarrierSetAssembler_ppc.cpp     | 14 ++++------
 .../shenandoahBarrierSetAssembler_ppc.hpp     |  7 ++---
 .../cpu/ppc/gc/z/zBarrierSetAssembler_ppc.cpp | 28 +++++++++----------
 .../cpu/ppc/gc/z/zBarrierSetAssembler_ppc.hpp |  6 ++--
 src/hotspot/cpu/ppc/macroAssembler_ppc.cpp    |  4 +--
 7 files changed, 41 insertions(+), 40 deletions(-)

diff --git a/src/hotspot/cpu/ppc/gc/shared/barrierSetAssembler_ppc.cpp b/src/hotspot/cpu/ppc/gc/shared/barrierSetAssembler_ppc.cpp
index 82d06f6c685..3692b247989 100644
--- a/src/hotspot/cpu/ppc/gc/shared/barrierSetAssembler_ppc.cpp
+++ b/src/hotspot/cpu/ppc/gc/shared/barrierSetAssembler_ppc.cpp
@@ -1,6 +1,6 @@
 /*
  * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
- * Copyright (c) 2018, 2025 SAP SE. All rights reserved.
+ * Copyright (c) 2018, 2026 SAP SE. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -179,6 +179,11 @@ void BarrierSetAssembler::try_resolve_jobject_in_native(MacroAssembler* masm, Re
   __ ld(dst, 0, dst);         // Resolve (untagged) jobject.
 }
 
+void BarrierSetAssembler::try_resolve_weak_handle(MacroAssembler* masm, Register obj, Register tmp, Label& slow_path) {
+  // Load the oop from the weak handle.
+  __ ld(obj, 0, obj);
+}
+
 void BarrierSetAssembler::nmethod_entry_barrier(MacroAssembler* masm, Register tmp) {
   BarrierSetNMethod* bs_nm = BarrierSet::barrier_set()->barrier_set_nmethod();
   assert_different_registers(tmp, R0);
@@ -275,11 +280,6 @@ OptoReg::Name BarrierSetAssembler::refine_register(const Node* node, OptoReg::Na
   return opto_reg;
 }
 
-void BarrierSetAssembler::try_resolve_weak_handle_in_c2(MacroAssembler* masm, Register obj, Register tmp, Label& slow_path) {
-  // Load the oop from the weak handle.
-  __ ld(obj, 0, obj);
-}
-
 #undef __
 #define __ _masm->
 
diff --git a/src/hotspot/cpu/ppc/gc/shared/barrierSetAssembler_ppc.hpp b/src/hotspot/cpu/ppc/gc/shared/barrierSetAssembler_ppc.hpp
index d78071f2ee0..8112542d761 100644
--- a/src/hotspot/cpu/ppc/gc/shared/barrierSetAssembler_ppc.hpp
+++ b/src/hotspot/cpu/ppc/gc/shared/barrierSetAssembler_ppc.hpp
@@ -1,6 +1,6 @@
 /*
  * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
- * Copyright (c) 2018, 2022 SAP SE. All rights reserved.
+ * Copyright (c) 2018, 2026 SAP SE. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -70,6 +70,12 @@ public:
   virtual void try_resolve_jobject_in_native(MacroAssembler* masm, Register dst, Register jni_env,
                                              Register obj, Register tmp, Label& slowpath);
 
+  // Can be used in nmethods including native wrappers.
+  // Attention: obj will only be valid until next safepoint (no SATB barrier).
+  // TODO: maybe rename to try_peek_weak_handle on all platforms (try: operation may fail, peek: obj is not kept alive)
+  // (other platforms currently use it for C2 only: try_resolve_weak_handle_in_c2)
+  virtual void try_resolve_weak_handle(MacroAssembler* masm, Register obj, Register tmp, Label& slow_path);
+
   virtual void barrier_stubs_init() {}
 
   virtual NMethodPatchingType nmethod_patching_type() { return NMethodPatchingType::stw_instruction_and_data_patch; }
@@ -81,8 +87,6 @@ public:
 
 #ifdef COMPILER2
   OptoReg::Name refine_register(const Node* node, OptoReg::Name opto_reg) const;
-  virtual void try_resolve_weak_handle_in_c2(MacroAssembler* masm, Register obj,
-                                             Register tmp, Label& slow_path);
 #endif // COMPILER2
 };
 
diff --git a/src/hotspot/cpu/ppc/gc/shenandoah/shenandoahBarrierSetAssembler_ppc.cpp b/src/hotspot/cpu/ppc/gc/shenandoah/shenandoahBarrierSetAssembler_ppc.cpp
index e1f0416d65d..8e99d23cc99 100644
--- a/src/hotspot/cpu/ppc/gc/shenandoah/shenandoahBarrierSetAssembler_ppc.cpp
+++ b/src/hotspot/cpu/ppc/gc/shenandoah/shenandoahBarrierSetAssembler_ppc.cpp
@@ -1,7 +1,7 @@
 /*
  * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
  * Copyright (c) 2018, 2025, Red Hat, Inc. All rights reserved.
- * Copyright (c) 2012, 2025 SAP SE. All rights reserved.
+ * Copyright (c) 2012, 2026 SAP SE. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -663,17 +663,16 @@ void ShenandoahBarrierSetAssembler::try_resolve_jobject_in_native(MacroAssembler
   __ block_comment("} try_resolve_jobject_in_native (shenandoahgc)");
 }
 
-#ifdef COMPILER2
-void ShenandoahBarrierSetAssembler::try_resolve_weak_handle_in_c2(MacroAssembler *masm, Register obj,
-                                                                  Register tmp, Label &slow_path) {
-  __ block_comment("try_resolve_weak_handle_in_c2 (shenandoahgc) {");
+void ShenandoahBarrierSetAssembler::try_resolve_weak_handle(MacroAssembler *masm, Register obj,
+                                                            Register tmp, Label &slow_path) {
+  __ block_comment("try_resolve_weak_handle (shenandoahgc) {");
 
   assert_different_registers(obj, tmp);
 
   Label done;
 
   // Resolve weak handle using the standard implementation.
-  BarrierSetAssembler::try_resolve_weak_handle_in_c2(masm, obj, tmp, slow_path);
+  BarrierSetAssembler::try_resolve_weak_handle(masm, obj, tmp, slow_path);
 
   // Check if the reference is null, and if it is, take the fast path.
   __ cmpdi(CR0, obj, 0);
@@ -686,9 +685,8 @@ void ShenandoahBarrierSetAssembler::try_resolve_weak_handle_in_c2(MacroAssembler
   __ bne(CR0, slow_path);
   __ bind(done);
 
-  __ block_comment("} try_resolve_weak_handle_in_c2 (shenandoahgc)");
+  __ block_comment("} try_resolve_weak_handle (shenandoahgc)");
 }
-#endif
 
 // Special shenandoah CAS implementation that handles false negatives due
 // to concurrent evacuation.  That is, the CAS operation is intended to succeed in
diff --git a/src/hotspot/cpu/ppc/gc/shenandoah/shenandoahBarrierSetAssembler_ppc.hpp b/src/hotspot/cpu/ppc/gc/shenandoah/shenandoahBarrierSetAssembler_ppc.hpp
index 672f8122bcb..58180c49642 100644
--- a/src/hotspot/cpu/ppc/gc/shenandoah/shenandoahBarrierSetAssembler_ppc.hpp
+++ b/src/hotspot/cpu/ppc/gc/shenandoah/shenandoahBarrierSetAssembler_ppc.hpp
@@ -1,7 +1,7 @@
 /*
  * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
  * Copyright (c) 2018, 2022, Red Hat, Inc. All rights reserved.
- * Copyright (c) 2012, 2022 SAP SE. All rights reserved.
+ * Copyright (c) 2012, 2026 SAP SE. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -122,9 +122,8 @@ public:
 
   virtual void try_resolve_jobject_in_native(MacroAssembler* masm, Register dst, Register jni_env,
                                              Register obj, Register tmp, Label& slowpath);
-#ifdef COMPILER2
-  virtual void try_resolve_weak_handle_in_c2(MacroAssembler* masm, Register obj, Register tmp, Label& slow_path);
-#endif
+
+  virtual void try_resolve_weak_handle(MacroAssembler* masm, Register obj, Register tmp, Label& slow_path);
 };
 
 #endif // CPU_PPC_GC_SHENANDOAH_SHENANDOAHBARRIERSETASSEMBLER_PPC_HPP
diff --git a/src/hotspot/cpu/ppc/gc/z/zBarrierSetAssembler_ppc.cpp b/src/hotspot/cpu/ppc/gc/z/zBarrierSetAssembler_ppc.cpp
index bfa3c87c179..3e74dfb88cb 100644
--- a/src/hotspot/cpu/ppc/gc/z/zBarrierSetAssembler_ppc.cpp
+++ b/src/hotspot/cpu/ppc/gc/z/zBarrierSetAssembler_ppc.cpp
@@ -1,6 +1,6 @@
 /*
  * Copyright (c) 2021, 2026, Oracle and/or its affiliates. All rights reserved.
- * Copyright (c) 2021, 2025 SAP SE. All rights reserved.
+ * Copyright (c) 2021, 2026 SAP SE. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -627,6 +627,19 @@ void ZBarrierSetAssembler::try_resolve_jobject_in_native(MacroAssembler* masm, R
   __ block_comment("} try_resolve_jobject_in_native (zgc)");
 }
 
+void ZBarrierSetAssembler::try_resolve_weak_handle(MacroAssembler* masm, Register obj, Register tmp, Label& slow_path) {
+  // Resolve weak handle using the standard implementation.
+  BarrierSetAssembler::try_resolve_weak_handle(masm, obj, tmp, slow_path);
+
+  // Check if the oop is bad, in which case we need to take the slow path.
+  __ relocate(barrier_Relocation::spec(), ZBarrierRelocationFormatMarkBadMask);
+  __ andi_(R0, obj, barrier_Relocation::unpatched);
+  __ bne(CR0, slow_path);
+
+  // Oop is okay, so we uncolor it.
+  __ srdi(obj, obj, ZPointerLoadShift);
+}
+
 #undef __
 
 #ifdef COMPILER1
@@ -950,19 +963,6 @@ void ZBarrierSetAssembler::generate_c2_store_barrier_stub(MacroAssembler* masm,
   __ b(*stub->continuation());
 }
 
-void ZBarrierSetAssembler::try_resolve_weak_handle_in_c2(MacroAssembler* masm, Register obj, Register tmp, Label& slow_path) {
-  // Resolve weak handle using the standard implementation.
-  BarrierSetAssembler::try_resolve_weak_handle_in_c2(masm, obj, tmp, slow_path);
-
-  // Check if the oop is bad, in which case we need to take the slow path.
-  __ relocate(barrier_Relocation::spec(), ZBarrierRelocationFormatMarkBadMask);
-  __ andi_(R0, obj, barrier_Relocation::unpatched);
-  __ bne(CR0, slow_path);
-
-  // Oop is okay, so we uncolor it.
-  __ srdi(obj, obj, ZPointerLoadShift);
-}
-
 #undef __
 #endif // COMPILER2
 
diff --git a/src/hotspot/cpu/ppc/gc/z/zBarrierSetAssembler_ppc.hpp b/src/hotspot/cpu/ppc/gc/z/zBarrierSetAssembler_ppc.hpp
index e31817370d9..655184cf6a3 100644
--- a/src/hotspot/cpu/ppc/gc/z/zBarrierSetAssembler_ppc.hpp
+++ b/src/hotspot/cpu/ppc/gc/z/zBarrierSetAssembler_ppc.hpp
@@ -1,6 +1,6 @@
 /*
  * Copyright (c) 2021, 2026, Oracle and/or its affiliates. All rights reserved.
- * Copyright (c) 2021, 2022 SAP SE. All rights reserved.
+ * Copyright (c) 2021, 2026 SAP SE. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -72,6 +72,8 @@ public:
   virtual void try_resolve_jobject_in_native(MacroAssembler* masm, Register dst, Register jni_env,
                                              Register obj, Register tmp, Label& slowpath);
 
+  virtual void try_resolve_weak_handle(MacroAssembler* masm, Register obj, Register tmp, Label& slow_path);
+
   virtual void check_oop(MacroAssembler *masm, Register obj, const char* msg);
 
   virtual NMethodPatchingType nmethod_patching_type() { return NMethodPatchingType::conc_instruction_and_data_patch; }
@@ -108,8 +110,6 @@ public:
   void generate_c2_load_barrier_stub(MacroAssembler* masm, ZLoadBarrierStubC2* stub) const;
 
   void generate_c2_store_barrier_stub(MacroAssembler* masm, ZStoreBarrierStubC2* stub) const;
-
-  void try_resolve_weak_handle_in_c2(MacroAssembler* masm, Register obj, Register tmp, Label& slow_path);
 #endif // COMPILER2
 
   void store_barrier_fast(MacroAssembler* masm,
diff --git a/src/hotspot/cpu/ppc/macroAssembler_ppc.cpp b/src/hotspot/cpu/ppc/macroAssembler_ppc.cpp
index 986dd335816..f3050cbabb4 100644
--- a/src/hotspot/cpu/ppc/macroAssembler_ppc.cpp
+++ b/src/hotspot/cpu/ppc/macroAssembler_ppc.cpp
@@ -1,6 +1,6 @@
 /*
  * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
- * Copyright (c) 2012, 2025 SAP SE. All rights reserved.
+ * Copyright (c) 2012, 2026 SAP SE. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -2800,7 +2800,7 @@ void MacroAssembler::compiler_fast_lock_object(ConditionRegister flag, Register
       // Check if object matches.
       ld(tmp3, in_bytes(ObjectMonitor::object_offset()), monitor);
       BarrierSetAssembler* bs_asm = BarrierSet::barrier_set()->barrier_set_assembler();
-      bs_asm->try_resolve_weak_handle_in_c2(this, tmp3, tmp2, slow_path);
+      bs_asm->try_resolve_weak_handle(this, tmp3, tmp2, slow_path);
       cmpd(CR0, tmp3, obj);
       bne(CR0, slow_path);
 

From acbd1febdd8662f857a0ff140e85d59ce80f6d6a Mon Sep 17 00:00:00 2001
From: Leo Korinth <lkorinth@openjdk.org>
Date: Wed, 11 Mar 2026 10:12:37 +0000
Subject: [PATCH 149/655] 8377658: Cleanup files for enabling conversion
 warnings for g1ConcurrentMark.cpp

Reviewed-by: stefank, tschatzl, jsjolen
---
 .../share/gc/g1/g1ConcurrentMarkThread.inline.hpp    |  4 ++--
 src/hotspot/share/gc/g1/g1RegionMarkStatsCache.hpp   |  2 +-
 src/hotspot/share/oops/bsmAttribute.hpp              | 12 ++++++------
 src/hotspot/share/oops/bsmAttribute.inline.hpp       |  4 ++--
 src/hotspot/share/oops/compressedKlass.hpp           |  4 ++--
 src/hotspot/share/oops/constantPool.hpp              |  6 +++---
 src/hotspot/share/oops/fieldInfo.hpp                 |  4 ++--
 7 files changed, 18 insertions(+), 18 deletions(-)

diff --git a/src/hotspot/share/gc/g1/g1ConcurrentMarkThread.inline.hpp b/src/hotspot/share/gc/g1/g1ConcurrentMarkThread.inline.hpp
index 254eaf62bb2..e80c5023405 100644
--- a/src/hotspot/share/gc/g1/g1ConcurrentMarkThread.inline.hpp
+++ b/src/hotspot/share/gc/g1/g1ConcurrentMarkThread.inline.hpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2001, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2001, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -32,7 +32,7 @@
 
   // Total virtual time so far.
 inline double G1ConcurrentMarkThread::total_mark_cpu_time_s() {
-  return os::thread_cpu_time(this) + worker_threads_cpu_time_s();
+  return static_cast<double>(os::thread_cpu_time(this)) + worker_threads_cpu_time_s();
 }
 
 // Marking virtual time so far
diff --git a/src/hotspot/share/gc/g1/g1RegionMarkStatsCache.hpp b/src/hotspot/share/gc/g1/g1RegionMarkStatsCache.hpp
index 4dcdd33846e..df76147f4b1 100644
--- a/src/hotspot/share/gc/g1/g1RegionMarkStatsCache.hpp
+++ b/src/hotspot/share/gc/g1/g1RegionMarkStatsCache.hpp
@@ -95,7 +95,7 @@ private:
   // Evict a given element of the statistics cache.
   void evict(uint idx);
 
-  size_t _num_cache_entries_mask;
+  const uint _num_cache_entries_mask;
 
   uint hash(uint idx) {
     return idx & _num_cache_entries_mask;
diff --git a/src/hotspot/share/oops/bsmAttribute.hpp b/src/hotspot/share/oops/bsmAttribute.hpp
index a28d2757fb0..32bc58b5b07 100644
--- a/src/hotspot/share/oops/bsmAttribute.hpp
+++ b/src/hotspot/share/oops/bsmAttribute.hpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1997, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -61,18 +61,18 @@ public:
     _argv_offset = 2
   };
 
-  int bootstrap_method_index() const {
+  u2 bootstrap_method_index() const {
     return _bootstrap_method_index;
   }
-  int argument_count() const {
+  u2 argument_count() const {
     return _argument_count;
   }
-  int argument(int n) const {
-    assert(checked_cast<u2>(n) < _argument_count, "oob");
+  u2 argument(u2 n) const {
+    assert(n < _argument_count, "oob");
     return argument_indexes()[n];
   }
 
-  void set_argument(int index, u2 value) {
+  void set_argument(u2 index, u2 value) {
     assert(index >= 0 && index < argument_count(), "invariant");
     argument_indexes()[index] = value;
   }
diff --git a/src/hotspot/share/oops/bsmAttribute.inline.hpp b/src/hotspot/share/oops/bsmAttribute.inline.hpp
index e678c280c26..8e048704e08 100644
--- a/src/hotspot/share/oops/bsmAttribute.inline.hpp
+++ b/src/hotspot/share/oops/bsmAttribute.inline.hpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -47,7 +47,7 @@ inline BSMAttributeEntry* BSMAttributeEntries::InsertionIterator::reserve_new_en
 
 inline void BSMAttributeEntry::copy_args_into(BSMAttributeEntry* entry) const {
   assert(entry->argument_count() == this->argument_count(), "must be same");
-  for (int i = 0; i < argument_count(); i++) {
+  for (u2 i = 0; i < argument_count(); i++) {
     entry->set_argument(i, this->argument(i));
   }
 }
diff --git a/src/hotspot/share/oops/compressedKlass.hpp b/src/hotspot/share/oops/compressedKlass.hpp
index 64b9fcf9c82..98a9eafdbf4 100644
--- a/src/hotspot/share/oops/compressedKlass.hpp
+++ b/src/hotspot/share/oops/compressedKlass.hpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2019, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2019, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -231,7 +231,7 @@ public:
   // Returns the alignment a Klass* is guaranteed to have.
   // Note: *Not* the same as 1 << shift ! Klass are always guaranteed to be at least 64-bit aligned,
   // so this will return 8 even if shift is 0.
-  static int klass_alignment_in_bytes() { return nth_bit(MAX2(3, _shift)); }
+  static int klass_alignment_in_bytes() { return static_cast<int>(nth_bit(MAX2(3, _shift))); }
   static int klass_alignment_in_words() { return klass_alignment_in_bytes() / BytesPerWord; }
 
   // Returns the highest possible narrowKlass value given the current Klass range
diff --git a/src/hotspot/share/oops/constantPool.hpp b/src/hotspot/share/oops/constantPool.hpp
index 6c519945f4d..b4cff2bbbe6 100644
--- a/src/hotspot/share/oops/constantPool.hpp
+++ b/src/hotspot/share/oops/constantPool.hpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1997, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -554,8 +554,8 @@ class ConstantPool : public Metadata {
   u2 bootstrap_argument_index_at(int cp_index, int j) {
     int bsmai = bootstrap_methods_attribute_index(cp_index);
     BSMAttributeEntry* bsme = bsm_attribute_entry(bsmai);
-    assert((uint)j < (uint)bsme->argument_count(), "oob");
-    return bsm_attribute_entry(bsmai)->argument(j);
+    assert(j < bsme->argument_count(), "oob");
+    return bsm_attribute_entry(bsmai)->argument(checked_cast<u2>(j));
   }
 
   // The following methods (name/signature/klass_ref_at, klass_ref_at_noresolve,
diff --git a/src/hotspot/share/oops/fieldInfo.hpp b/src/hotspot/share/oops/fieldInfo.hpp
index b6d9c4d34e5..88c982e9d1f 100644
--- a/src/hotspot/share/oops/fieldInfo.hpp
+++ b/src/hotspot/share/oops/fieldInfo.hpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2011, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2011, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -302,7 +302,7 @@ class FieldStatus {
 
   // boilerplate:
   u1 _flags;
-  static constexpr u1 flag_mask(FieldStatusBitPosition pos) { return (u1)1 << (int)pos; }
+  static constexpr u1 flag_mask(FieldStatusBitPosition pos) { return checked_cast<u1>(1 << pos); }
   bool test_flag(FieldStatusBitPosition pos) { return (_flags & flag_mask(pos)) != 0; }
   // this performs an atomic update on a live status byte!
   void update_flag(FieldStatusBitPosition pos, bool z);

From c904a0edae3d1807d4c6f13e41d5186caae71187 Mon Sep 17 00:00:00 2001
From: Aleksey Shipilev <shade@openjdk.org>
Date: Wed, 11 Mar 2026 11:14:59 +0000
Subject: [PATCH 150/655] 8378338: Shenandoah: Heap-used generic verification
 error after update-refs

Reviewed-by: wkemper
---
 src/hotspot/share/gc/shenandoah/shenandoahVerifier.cpp | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/src/hotspot/share/gc/shenandoah/shenandoahVerifier.cpp b/src/hotspot/share/gc/shenandoah/shenandoahVerifier.cpp
index 225339a3219..afef11640c9 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahVerifier.cpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahVerifier.cpp
@@ -1086,7 +1086,7 @@ void ShenandoahVerifier::verify_generic(ShenandoahGeneration* generation, Verify
           _verify_cset_disable,        // cset may be inconsistent
           _verify_liveness_disable,    // no reliable liveness data
           _verify_regions_disable,     // no reliable region data
-          _verify_size_exact,          // expect generation and heap sizes to match exactly
+          _verify_size_disable,        // no reliable sizing data
           _verify_gcstate_disable      // no data about gcstate
   );
 }

From 97f9060abec87a201a2858bde06595f500c871b6 Mon Sep 17 00:00:00 2001
From: Axel Boldt-Christmas <aboldtch@openjdk.org>
Date: Wed, 11 Mar 2026 13:24:20 +0000
Subject: [PATCH 151/655] 8379181: Convert ObjectMonitorTable to use Atomic<T>

Reviewed-by: kbarrett, tschatzl
---
 .../share/runtime/objectMonitorTable.cpp      | 111 +++++++++---------
 .../share/runtime/objectMonitorTable.hpp      |   3 +-
 2 files changed, 60 insertions(+), 54 deletions(-)

diff --git a/src/hotspot/share/runtime/objectMonitorTable.cpp b/src/hotspot/share/runtime/objectMonitorTable.cpp
index 8431b6dd0d4..1b79d1bf1c4 100644
--- a/src/hotspot/share/runtime/objectMonitorTable.cpp
+++ b/src/hotspot/share/runtime/objectMonitorTable.cpp
@@ -31,6 +31,7 @@
 #include "runtime/thread.hpp"
 #include "runtime/timerTrace.hpp"
 #include "runtime/trimNativeHeap.hpp"
+#include "utilities/debug.hpp"
 #include "utilities/globalDefinitions.hpp"
 
 // -----------------------------------------------------------------------------
@@ -117,17 +118,17 @@
 // requirements. Don't change it for fun, it might backfire.
 // -----------------------------------------------------------------------------
 
-ObjectMonitorTable::Table* volatile ObjectMonitorTable::_curr;
+Atomic<ObjectMonitorTable::Table*> ObjectMonitorTable::_curr;
 
 class ObjectMonitorTable::Table : public CHeapObj<mtObjectMonitor> {
   friend class ObjectMonitorTable;
 
   DEFINE_PAD_MINUS_SIZE(0, DEFAULT_CACHE_LINE_SIZE, 0);
   const size_t _capacity_mask;       // One less than its power-of-two capacity
-  Table* volatile _prev;             // Set while rehashing
-  Entry volatile* _buckets;          // The payload
+  Atomic<Table*> _prev;              // Set while rehashing
+  Atomic<Entry>* _buckets;           // The payload
   DEFINE_PAD_MINUS_SIZE(1, DEFAULT_CACHE_LINE_SIZE, sizeof(_capacity_mask) + sizeof(_prev) + sizeof(_buckets));
-  volatile size_t _items_count;
+  Atomic<size_t> _items_count;
   DEFINE_PAD_MINUS_SIZE(2, DEFAULT_CACHE_LINE_SIZE, sizeof(_items_count));
 
   static Entry as_entry(ObjectMonitor* monitor) {
@@ -156,11 +157,11 @@ class ObjectMonitorTable::Table : public CHeapObj<mtObjectMonitor> {
   // Make sure we leave space for previous versions to relocate too.
   bool try_inc_items_count() {
     for (;;) {
-      size_t population = AtomicAccess::load(&_items_count);
+      size_t population = _items_count.load_relaxed();
       if (should_grow(population)) {
         return false;
       }
-      if (AtomicAccess::cmpxchg(&_items_count, population, population + 1, memory_order_relaxed) == population) {
+      if (_items_count.compare_set(population, population + 1, memory_order_relaxed)) {
         return true;
       }
     }
@@ -171,31 +172,31 @@ class ObjectMonitorTable::Table : public CHeapObj<mtObjectMonitor> {
   }
 
   void inc_items_count() {
-    AtomicAccess::inc(&_items_count, memory_order_relaxed);
+    _items_count.add_then_fetch(1u, memory_order_relaxed);
   }
 
   void dec_items_count() {
-    AtomicAccess::dec(&_items_count, memory_order_relaxed);
+    _items_count.sub_then_fetch(1u, memory_order_relaxed);
   }
 
 public:
   Table(size_t capacity, Table* prev)
     : _capacity_mask(capacity - 1),
       _prev(prev),
-      _buckets(NEW_C_HEAP_ARRAY(Entry, capacity, mtObjectMonitor)),
+      _buckets(NEW_C_HEAP_ARRAY(Atomic<Entry>, capacity, mtObjectMonitor)),
       _items_count(0)
   {
     for (size_t i = 0; i < capacity; ++i) {
-      _buckets[i] = empty();
+      ::new (_buckets + i) Atomic<Entry>(empty());
     }
   }
 
   ~Table() {
-    FREE_C_HEAP_ARRAY(Entry, _buckets);
+    FREE_C_HEAP_ARRAY(Atomic<Entry>, _buckets);
   }
 
   Table* prev() {
-    return AtomicAccess::load(&_prev);
+    return _prev.load_relaxed();
   }
 
   size_t capacity() {
@@ -207,12 +208,12 @@ public:
   }
 
   bool should_grow() {
-    return should_grow(AtomicAccess::load(&_items_count));
+    return should_grow(_items_count.load_relaxed());
   }
 
   size_t total_items() {
-    size_t current_items = AtomicAccess::load(&_items_count);
-    Table* prev = AtomicAccess::load(&_prev);
+    size_t current_items = _items_count.load_relaxed();
+    Table* prev = _prev.load_relaxed();
     if (prev != nullptr) {
       return prev->total_items() + current_items;
     }
@@ -221,7 +222,7 @@ public:
 
   ObjectMonitor* get(oop obj, intptr_t hash) {
     // Acquire tombstones and relocations in case prev transitioned to null
-    Table* prev = AtomicAccess::load_acquire(&_prev);
+    Table* prev = _prev.load_acquire();
     if (prev != nullptr) {
       ObjectMonitor* result = prev->get(obj, hash);
       if (result != nullptr) {
@@ -233,8 +234,8 @@ public:
     size_t index = start_index;
 
     for (;;) {
-      Entry volatile* bucket = _buckets + index;
-      Entry entry = AtomicAccess::load_acquire(bucket);
+      Atomic<Entry>& bucket = _buckets[index];
+      Entry entry = bucket.load_acquire();
 
       if (entry == tombstone() || entry == empty()) {
         // Not found
@@ -257,7 +258,7 @@ public:
 
   ObjectMonitor* prepare_insert(oop obj, intptr_t hash) {
     // Acquire any tombstones and relocations if prev transitioned to null.
-    Table* prev = AtomicAccess::load_acquire(&_prev);
+    Table* prev = _prev.load_acquire();
     if (prev != nullptr) {
       ObjectMonitor* result = prev->prepare_insert(obj, hash);
       if (result != nullptr) {
@@ -269,13 +270,13 @@ public:
     size_t index = start_index;
 
     for (;;) {
-      Entry volatile* bucket = _buckets + index;
-      Entry entry = AtomicAccess::load_acquire(bucket);
+      Atomic<Entry>& bucket = _buckets[index];
+      Entry entry = bucket.load_acquire();
 
       if (entry == empty()) {
         // Found an empty slot to install the new monitor in.
         // To avoid concurrent inserts succeeding, place a tombstone here.
-        Entry result = AtomicAccess::cmpxchg(bucket, entry, tombstone(), memory_order_relaxed);
+        Entry result = bucket.compare_exchange(entry, tombstone(), memory_order_relaxed);
         if (result == entry) {
           // Success! Nobody will try to insert here again, except reinsert from rehashing.
           return nullptr;
@@ -300,7 +301,7 @@ public:
 
   ObjectMonitor* get_set(oop obj, Entry new_monitor, intptr_t hash) {
     // Acquire any tombstones and relocations if prev transitioned to null.
-    Table* prev = AtomicAccess::load_acquire(&_prev);
+    Table* prev = _prev.load_acquire();
     if (prev != nullptr) {
       // Sprinkle tombstones in previous tables to force concurrent inserters
       // to the latest table. We only really want to try inserting in the
@@ -315,14 +316,14 @@ public:
     size_t index = start_index;
 
     for (;;) {
-      Entry volatile* bucket = _buckets + index;
-      Entry entry = AtomicAccess::load_acquire(bucket);
+      Atomic<Entry>& bucket = _buckets[index];
+      Entry entry = bucket.load_acquire();
 
       if (entry == empty()) {
         // Empty slot to install the new monitor
         if (try_inc_items_count()) {
           // Succeeding in claiming an item.
-          Entry result = AtomicAccess::cmpxchg(bucket, entry, new_monitor, memory_order_acq_rel);
+          Entry result = bucket.compare_exchange(entry, new_monitor, memory_order_acq_rel);
           if (result == entry) {
             // Success - already incremented.
             return as_monitor(new_monitor);
@@ -334,7 +335,7 @@ public:
         } else {
           // Out of allowance; leaving place for rehashing to succeed.
           // To avoid concurrent inserts succeeding, place a tombstone here.
-          Entry result = AtomicAccess::cmpxchg(bucket, entry, tombstone(), memory_order_acq_rel);
+          Entry result = bucket.compare_exchange(entry, tombstone(), memory_order_acq_rel);
           if (result == entry) {
             // Success; nobody will try to insert here again, except reinsert from rehashing.
             return nullptr;
@@ -366,8 +367,8 @@ public:
     size_t index = start_index;
 
     for (;;) {
-      Entry volatile* bucket = _buckets + index;
-      Entry entry = AtomicAccess::load_acquire(bucket);
+      Atomic<Entry>& bucket = _buckets[index];
+      Entry entry = bucket.load_acquire();
 
       if (entry == empty()) {
         // The monitor does not exist in this table.
@@ -381,8 +382,8 @@ public:
 
       if (entry == old_monitor) {
         // Found matching entry; remove it
-        Entry result = AtomicAccess::cmpxchg(bucket, entry, removed(), memory_order_relaxed);
-        assert(result == entry, "should not fail");
+        bool result = bucket.compare_set(entry, removed(), memory_order_relaxed);
+        assert(result, "should not fail");
         break;
       }
 
@@ -395,8 +396,8 @@ public:
     // still not being a monitor, instead of flickering back to being there.
     // Only the deflation thread rebuilds and unlinks tables, so we do not need
     // any concurrency safe prev read below.
-    if (_prev != nullptr) {
-      _prev->remove(obj, old_monitor, hash);
+    if (_prev.load_relaxed() != nullptr) {
+      _prev.load_relaxed()->remove(obj, old_monitor, hash);
     }
   }
 
@@ -407,12 +408,12 @@ public:
     size_t index = start_index;
 
     for (;;) {
-      Entry volatile* bucket = _buckets + index;
-      Entry entry = AtomicAccess::load_acquire(bucket);
+      Atomic<Entry>& bucket = _buckets[index];
+      Entry entry = bucket.load_acquire();
 
       if (entry == empty()) {
         // Empty slot to install the new monitor.
-        Entry result = AtomicAccess::cmpxchg(bucket, entry, new_monitor, memory_order_acq_rel);
+        Entry result = bucket.compare_exchange(entry, new_monitor, memory_order_acq_rel);
         if (result == entry) {
           // Success - unconditionally increment.
           inc_items_count();
@@ -426,7 +427,7 @@ public:
       if (entry == tombstone()) {
         // A concurrent inserter did not get enough allowance in the table.
         // But reinsert always succeeds - we will take the spot.
-        Entry result = AtomicAccess::cmpxchg(bucket, entry, new_monitor, memory_order_acq_rel);
+        Entry result = bucket.compare_exchange(entry, new_monitor, memory_order_acq_rel);
         if (result == entry) {
           // Success - unconditionally increment.
           inc_items_count();
@@ -439,7 +440,7 @@ public:
 
       if (entry == removed()) {
         // A removed entry can be flipped back with reinsertion.
-        Entry result = AtomicAccess::cmpxchg(bucket, entry, new_monitor, memory_order_release);
+        Entry result = bucket.compare_exchange(entry, new_monitor, memory_order_release);
         if (result == entry) {
           // Success - but don't increment; the initial entry did that for us.
           return;
@@ -459,7 +460,7 @@ public:
   }
 
   void rebuild() {
-    Table* prev = _prev;
+    Table* prev = _prev.load_relaxed();
     if (prev == nullptr) {
       // Base case for recursion - no previous version.
       return;
@@ -477,12 +478,12 @@ public:
         ThreadBlockInVM tbivm(current);
       }
 
-      Entry volatile* bucket = prev->_buckets + index;
-      Entry entry = AtomicAccess::load_acquire(bucket);
+      Atomic<Entry>& bucket = prev->_buckets[index];
+      Entry entry = bucket.load_acquire();
 
       if (entry == empty()) {
         // Empty slot; put a tombstone there.
-        Entry result = AtomicAccess::cmpxchg(bucket, entry, tombstone(), memory_order_acq_rel);
+        Entry result = bucket.compare_exchange(entry, tombstone(), memory_order_acq_rel);
         if (result == empty()) {
           // Success; move to next entry.
           continue;
@@ -508,17 +509,17 @@ public:
     }
 
     // Unlink this table, releasing the tombstones and relocations.
-    AtomicAccess::release_store(&_prev, (Table*)nullptr);
+    _prev.release_store(nullptr);
   }
 };
 
 void ObjectMonitorTable::create() {
-  _curr = new Table(128, nullptr);
+  _curr.store_relaxed(new Table(128, nullptr));
 }
 
 ObjectMonitor* ObjectMonitorTable::monitor_get(oop obj) {
   const intptr_t hash = obj->mark().hash();
-  Table* curr = AtomicAccess::load_acquire(&_curr);
+  Table* curr = _curr.load_acquire();
   ObjectMonitor* monitor = curr->get(obj, hash);
   return monitor;
 }
@@ -526,7 +527,7 @@ ObjectMonitor* ObjectMonitorTable::monitor_get(oop obj) {
 // Returns a new table to try inserting into.
 ObjectMonitorTable::Table* ObjectMonitorTable::grow_table(Table* curr) {
   Table* result;
-  Table* new_table = AtomicAccess::load_acquire(&_curr);
+  Table* new_table = _curr.load_acquire();
   if (new_table != curr) {
     // Table changed; no need to try further
     return new_table;
@@ -537,14 +538,14 @@ ObjectMonitorTable::Table* ObjectMonitorTable::grow_table(Table* curr) {
     // attempt to allocate the new table.
     MonitorLocker ml(MonitorDeflation_lock, Mutex::_no_safepoint_check_flag);
 
-    new_table = AtomicAccess::load_acquire(&_curr);
+    new_table = _curr.load_acquire();
     if (new_table != curr) {
       // Table changed; no need to try further
       return new_table;
     }
 
     new_table = new Table(curr->capacity() << 1, curr);
-    result = AtomicAccess::cmpxchg(&_curr, curr, new_table, memory_order_acq_rel);
+    result = _curr.compare_exchange(curr, new_table, memory_order_acq_rel);
     if (result == curr) {
       log_info(monitorinflation)("Growing object monitor table (capacity: %zu)",
                                  new_table->capacity());
@@ -565,7 +566,7 @@ ObjectMonitorTable::Table* ObjectMonitorTable::grow_table(Table* curr) {
 
 ObjectMonitor* ObjectMonitorTable::monitor_put_get(ObjectMonitor* monitor, oop obj) {
   const intptr_t hash = obj->mark().hash();
-  Table* curr = AtomicAccess::load_acquire(&_curr);
+  Table* curr =  _curr.load_acquire();
 
   for (;;) {
     // Curr is the latest table and is reasonably loaded.
@@ -585,7 +586,7 @@ void ObjectMonitorTable::remove_monitor_entry(ObjectMonitor* monitor) {
     return;
   }
   const intptr_t hash = obj->mark().hash();
-  Table* curr = AtomicAccess::load_acquire(&_curr);
+  Table* curr =  _curr.load_acquire();
   curr->remove(obj, curr->as_entry(monitor), hash);
   assert(monitor_get(obj) != monitor, "should have been removed");
 }
@@ -620,13 +621,13 @@ void ObjectMonitorTable::rebuild(GrowableArray<Table*>* delete_list) {
     // given the growing threshold of 12.5%, it is impossible for the
     // tables to reach a load factor above 50%. Which is more than
     // enough to guarantee the function of this concurrent hash table.
-    Table* curr = AtomicAccess::load_acquire(&_curr);
+    Table* curr =  _curr.load_acquire();
     size_t need_to_accomodate = curr->total_items();
     size_t new_capacity = curr->should_grow(need_to_accomodate)
       ? curr->capacity() << 1
       : curr->capacity();
     new_table = new Table(new_capacity, curr);
-    Table* result = AtomicAccess::cmpxchg(&_curr, curr, new_table, memory_order_acq_rel);
+    Table* result = _curr.compare_exchange(curr, new_table, memory_order_acq_rel);
     if (result != curr) {
       // Somebody else racingly started rehashing. Delete the
       // new_table and treat somebody else's table as the new one.
@@ -653,7 +654,7 @@ void ObjectMonitorTable::destroy(GrowableArray<Table*>* delete_list) {
 }
 
 address ObjectMonitorTable::current_table_address() {
-  return (address)(&_curr);
+  return reinterpret_cast<address>(&_curr) + _curr.value_offset_in_bytes();
 }
 
 ByteSize ObjectMonitorTable::table_capacity_mask_offset() {
@@ -661,5 +662,9 @@ ByteSize ObjectMonitorTable::table_capacity_mask_offset() {
 }
 
 ByteSize ObjectMonitorTable::table_buckets_offset() {
+  // Assumptions made from the emitted code about the layout.
+  STATIC_ASSERT(sizeof(Atomic<Entry>) == sizeof(Entry*));
+  STATIC_ASSERT(Atomic<Entry>::value_offset_in_bytes() == 0);
+
   return byte_offset_of(Table, _buckets);
 }
diff --git a/src/hotspot/share/runtime/objectMonitorTable.hpp b/src/hotspot/share/runtime/objectMonitorTable.hpp
index 0a56b696069..1ec372883b2 100644
--- a/src/hotspot/share/runtime/objectMonitorTable.hpp
+++ b/src/hotspot/share/runtime/objectMonitorTable.hpp
@@ -27,6 +27,7 @@
 
 #include "memory/allStatic.hpp"
 #include "oops/oopsHierarchy.hpp"
+#include "runtime/atomic.hpp"
 #include "utilities/globalDefinitions.hpp"
 #include "utilities/sizes.hpp"
 
@@ -44,7 +45,7 @@ public:
   class Table;
 
 private:
-  static Table* volatile _curr;
+  static Atomic<Table*> _curr;
   static Table* grow_table(Table* curr);
 
   enum class Entry : uintptr_t {

From d4960980cc837cec26b33d40727fe05345b06ff2 Mon Sep 17 00:00:00 2001
From: Roland Westrelin <roland@openjdk.org>
Date: Wed, 11 Mar 2026 14:33:19 +0000
Subject: [PATCH 152/655] 8373143: C2: verify that adr_type and adr's type
 match in LoadNode::make and StoreNode::make

Reviewed-by: qamai, bmaillard
---
 src/hotspot/share/opto/arraycopynode.cpp  | 26 ++++++++++++++---
 src/hotspot/share/opto/buildOopMap.cpp    |  3 ++
 src/hotspot/share/opto/callnode.cpp       |  6 +++-
 src/hotspot/share/opto/library_call.cpp   |  3 +-
 src/hotspot/share/opto/macro.cpp          |  4 ++-
 src/hotspot/share/opto/macro.hpp          | 11 ++++----
 src/hotspot/share/opto/macroArrayCopy.cpp | 34 ++++++++++++-----------
 src/hotspot/share/opto/memnode.cpp        | 28 +++++++++++++++----
 src/hotspot/share/opto/memnode.hpp        |  8 ++++++
 9 files changed, 90 insertions(+), 33 deletions(-)

diff --git a/src/hotspot/share/opto/arraycopynode.cpp b/src/hotspot/share/opto/arraycopynode.cpp
index 4ee6107fe54..3b006ae6b11 100644
--- a/src/hotspot/share/opto/arraycopynode.cpp
+++ b/src/hotspot/share/opto/arraycopynode.cpp
@@ -426,7 +426,13 @@ Node* ArrayCopyNode::array_copy_forward(PhaseGVN *phase,
       for (int i = 1; i < count; i++) {
         Node* off  = phase->MakeConX(type2aelembytes(copy_type) * i);
         Node* next_src = phase->transform(new AddPNode(base_src,adr_src,off));
+        // We may have narrowed the type of next_src right before calling this method but because this runs with
+        // PhaseIterGVN::_delay_transform true, explicitly update the type of the AddP so it's consistent  with its
+        // base and load() picks the right memory slice.
+        phase->set_type(next_src, next_src->Value(phase));
         Node* next_dest = phase->transform(new AddPNode(base_dest,adr_dest,off));
+        // Same as above
+        phase->set_type(next_dest, next_dest->Value(phase));
         v = load(bs, phase, forward_ctl, mm, next_src, atp_src, value_type, copy_type);
         store(bs, phase, forward_ctl, mm, next_dest, atp_dest, v, value_type, copy_type);
       }
@@ -464,7 +470,12 @@ Node* ArrayCopyNode::array_copy_backward(PhaseGVN *phase,
       for (int i = count-1; i >= 1; i--) {
         Node* off  = phase->MakeConX(type2aelembytes(copy_type) * i);
         Node* next_src = phase->transform(new AddPNode(base_src,adr_src,off));
+        // We may have narrowed the type of next_src right before calling this method but because this runs with
+        // PhaseIterGVN::_delay_transform true, explicitly update the type of the AddP so it's consistent  with its
+        // base and store() picks the right memory slice.
+        phase->set_type(next_src, next_src->Value(phase));
         Node* next_dest = phase->transform(new AddPNode(base_dest,adr_dest,off));
+        phase->set_type(next_dest, next_dest->Value(phase));
         Node* v = load(bs, phase, backward_ctl, mm, next_src, atp_src, value_type, copy_type);
         store(bs, phase, backward_ctl, mm, next_dest, atp_dest, v, value_type, copy_type);
       }
@@ -592,6 +603,17 @@ Node *ArrayCopyNode::Ideal(PhaseGVN *phase, bool can_reshape) {
   const Type* value_type = nullptr;
   bool disjoint_bases = false;
 
+  Node* src = in(ArrayCopyNode::Src);
+  Node* dest = in(ArrayCopyNode::Dest);
+  // EA may have moved an input to a new slice. EA stores the new address types in the ArrayCopy node itself
+  // (_src_type/_dest_type). phase->type(src) and _src_type or phase->type(dest) and _dest_type may be different
+  // when this transformation runs if igvn hasn't had a chance to propagate the new types yet. Make sure the new
+  // types are taken into account so new Load/Store nodes are created on the right slice.
+  const TypePtr* atp_src = get_address_type(phase, _src_type, src);
+  const TypePtr* atp_dest = get_address_type(phase, _dest_type, dest);
+  phase->set_type(src, phase->type(src)->join_speculative(atp_src));
+  phase->set_type(dest, phase->type(dest)->join_speculative(atp_dest));
+
   if (!prepare_array_copy(phase, can_reshape,
                           adr_src, base_src, adr_dest, base_dest,
                           copy_type, value_type, disjoint_bases)) {
@@ -600,10 +622,6 @@ Node *ArrayCopyNode::Ideal(PhaseGVN *phase, bool can_reshape) {
     return nullptr;
   }
 
-  Node* src = in(ArrayCopyNode::Src);
-  Node* dest = in(ArrayCopyNode::Dest);
-  const TypePtr* atp_src = get_address_type(phase, _src_type, src);
-  const TypePtr* atp_dest = get_address_type(phase, _dest_type, dest);
   Node* in_mem = in(TypeFunc::Memory);
 
   if (can_reshape) {
diff --git a/src/hotspot/share/opto/buildOopMap.cpp b/src/hotspot/share/opto/buildOopMap.cpp
index 675113163e8..e3a94f78d9c 100644
--- a/src/hotspot/share/opto/buildOopMap.cpp
+++ b/src/hotspot/share/opto/buildOopMap.cpp
@@ -377,6 +377,9 @@ OopMap *OopFlow::build_oop_map( Node *n, int max_reg, PhaseRegAlloc *regalloc, i
               worklist.push(u);
             }
           }
+          if (m->is_SpillCopy()) {
+            worklist.push(m->in(1));
+          }
         }
       }
 #endif
diff --git a/src/hotspot/share/opto/callnode.cpp b/src/hotspot/share/opto/callnode.cpp
index 9b3d7b38d15..d4c832359d6 100644
--- a/src/hotspot/share/opto/callnode.cpp
+++ b/src/hotspot/share/opto/callnode.cpp
@@ -844,6 +844,10 @@ bool CallNode::may_modify(const TypeOopPtr* t_oop, PhaseValues* phase) {
       }
     }
     guarantee(dest != nullptr, "Call had only one ptr in, broken IR!");
+    if (phase->type(dest)->isa_rawptr()) {
+      // may happen for an arraycopy that initializes a newly allocated object. Conservatively return true;
+      return true;
+    }
     if (!dest->is_top() && may_modify_arraycopy_helper(phase->type(dest)->is_oopptr(), t_oop, phase)) {
       return true;
     }
@@ -1742,7 +1746,7 @@ Node *AllocateNode::make_ideal_mark(PhaseGVN* phase, Node* control, Node* mem) {
   if (UseCompactObjectHeaders) {
     Node* klass_node = in(AllocateNode::KlassNode);
     Node* proto_adr = phase->transform(new AddPNode(phase->C->top(), klass_node, phase->MakeConX(in_bytes(Klass::prototype_header_offset()))));
-    mark_node = LoadNode::make(*phase, control, mem, proto_adr, TypeRawPtr::BOTTOM, TypeX_X, TypeX_X->basic_type(), MemNode::unordered);
+    mark_node = LoadNode::make(*phase, control, mem, proto_adr, phase->type(proto_adr)->is_ptr(), TypeX_X, TypeX_X->basic_type(), MemNode::unordered);
   } else {
     // For now only enable fast locking for non-array types
     mark_node = phase->MakeConX(markWord::prototype().value());
diff --git a/src/hotspot/share/opto/library_call.cpp b/src/hotspot/share/opto/library_call.cpp
index 3627d06a87a..b3ee060d75f 100644
--- a/src/hotspot/share/opto/library_call.cpp
+++ b/src/hotspot/share/opto/library_call.cpp
@@ -3076,7 +3076,8 @@ bool LibraryCallKit::inline_native_vthread_start_transition(address funcAddr, co
   Node* global_disable_addr = makecon(TypeRawPtr::make((address)MountUnmountDisabler::global_vthread_transition_disable_count_address()));
   Node* global_disable = ideal.load(ideal.ctrl(), global_disable_addr, TypeInt::INT, T_INT, Compile::AliasIdxRaw, true /*require_atomic_access*/);
   Node* vt_disable_addr = basic_plus_adr(vt_oop, java_lang_Thread::vthread_transition_disable_count_offset());
-  Node* vt_disable = ideal.load(ideal.ctrl(), vt_disable_addr, TypeInt::INT, T_INT, Compile::AliasIdxRaw, true /*require_atomic_access*/);
+  const TypePtr* vt_disable_addr_t = _gvn.type(vt_disable_addr)->is_ptr();
+  Node* vt_disable = ideal.load(ideal.ctrl(), vt_disable_addr, TypeInt::INT, T_INT, C->get_alias_index(vt_disable_addr_t), true /*require_atomic_access*/);
   Node* disabled = _gvn.transform(new AddINode(global_disable, vt_disable));
 
   ideal.if_then(disabled, BoolTest::ne, ideal.ConI(0)); {
diff --git a/src/hotspot/share/opto/macro.cpp b/src/hotspot/share/opto/macro.cpp
index 510531c95cd..b9045ddcf4c 100644
--- a/src/hotspot/share/opto/macro.cpp
+++ b/src/hotspot/share/opto/macro.cpp
@@ -1313,7 +1313,9 @@ void PhaseMacroExpand::expand_allocate_common(
     initial_slow_test = nullptr;
   }
 
-  bool allocation_has_use = (alloc->result_cast() != nullptr);
+  // ArrayCopyNode right after an allocation operates on the raw result projection for the Allocate node so it's not
+  // safe to remove such an allocation even if it has no result cast.
+  bool allocation_has_use = (alloc->result_cast() != nullptr) || (alloc->initialization() != nullptr && alloc->initialization()->is_complete_with_arraycopy());
   if (!allocation_has_use) {
     InitializeNode* init = alloc->initialization();
     if (init != nullptr) {
diff --git a/src/hotspot/share/opto/macro.hpp b/src/hotspot/share/opto/macro.hpp
index 0f8d8fb5172..070bfbe1478 100644
--- a/src/hotspot/share/opto/macro.hpp
+++ b/src/hotspot/share/opto/macro.hpp
@@ -40,14 +40,15 @@ private:
 
 public:
   // Helper methods roughly modeled after GraphKit:
-  Node* basic_plus_adr(Node* base, int offset) {
-    return (offset == 0)? base: basic_plus_adr(base, MakeConX(offset));
+  Node* basic_plus_adr(Node* ptr, int offset, bool raw_base = false) {
+    return (offset == 0)? ptr: basic_plus_adr(ptr, MakeConX(offset), raw_base);
   }
   Node* basic_plus_adr(Node* base, Node* ptr, int offset) {
     return (offset == 0)? ptr: basic_plus_adr(base, ptr, MakeConX(offset));
   }
-  Node* basic_plus_adr(Node* base, Node* offset) {
-    return basic_plus_adr(base, base, offset);
+  Node* basic_plus_adr(Node* ptr, Node* offset, bool raw_base = false) {
+    Node* base = raw_base ? top() : ptr;
+    return basic_plus_adr(base, ptr, offset);
   }
   Node* basic_plus_adr(Node* base, Node* ptr, Node* offset) {
     Node* adr = new AddPNode(base, ptr, offset);
@@ -109,7 +110,7 @@ private:
 
   // More helper methods modeled after GraphKit for array copy
   void insert_mem_bar(Node** ctrl, Node** mem, int opcode, int alias_idx, Node* precedent = nullptr);
-  Node* array_element_address(Node* ary, Node* idx, BasicType elembt);
+  Node* array_element_address(Node* ary, Node* idx, BasicType elembt, bool raw_base);
   Node* ConvI2L(Node* offset);
 
   // helper methods modeled after LibraryCallKit for array copy
diff --git a/src/hotspot/share/opto/macroArrayCopy.cpp b/src/hotspot/share/opto/macroArrayCopy.cpp
index 0719ffc45a5..344561606b5 100644
--- a/src/hotspot/share/opto/macroArrayCopy.cpp
+++ b/src/hotspot/share/opto/macroArrayCopy.cpp
@@ -55,10 +55,10 @@ void PhaseMacroExpand::insert_mem_bar(Node** ctrl, Node** mem, int opcode, int a
   }
 }
 
-Node* PhaseMacroExpand::array_element_address(Node* ary, Node* idx, BasicType elembt) {
+Node* PhaseMacroExpand::array_element_address(Node* ary, Node* idx, BasicType elembt, bool raw_base) {
   uint shift  = exact_log2(type2aelembytes(elembt));
   uint header = arrayOopDesc::base_offset_in_bytes(elembt);
-  Node* base =  basic_plus_adr(ary, header);
+  Node* base =  basic_plus_adr(ary, header, raw_base);
 #ifdef _LP64
   // see comment in GraphKit::array_element_address
   int index_max = max_jint - 1;  // array size is max_jint, index is one less
@@ -67,7 +67,7 @@ Node* PhaseMacroExpand::array_element_address(Node* ary, Node* idx, BasicType el
 #endif
   Node* scale = new LShiftXNode(idx, intcon(shift));
   transform_later(scale);
-  return basic_plus_adr(ary, base, scale);
+  return basic_plus_adr(raw_base ? top() : ary, base, scale);
 }
 
 Node* PhaseMacroExpand::ConvI2L(Node* offset) {
@@ -379,6 +379,7 @@ Node* PhaseMacroExpand::generate_arraycopy(ArrayCopyNode *ac, AllocateArrayNode*
                                            bool disjoint_bases,
                                            bool length_never_negative,
                                            RegionNode* slow_region) {
+  Node* orig_dest = dest;
   if (slow_region == nullptr) {
     slow_region = new RegionNode(1);
     transform_later(slow_region);
@@ -411,6 +412,7 @@ Node* PhaseMacroExpand::generate_arraycopy(ArrayCopyNode *ac, AllocateArrayNode*
       assert(dest->is_CheckCastPP(), "sanity");
       assert(dest->in(0)->in(0) == init, "dest pinned");
       adr_type = TypeRawPtr::BOTTOM;  // all initializations are into raw memory
+      dest = dest->in(1); // writing to raw memory requires a raw base
       // From this point on, every exit path is responsible for
       // initializing any non-copied parts of the object to zero.
       // Also, if this flag is set we make sure that arraycopy interacts properly
@@ -771,7 +773,7 @@ Node* PhaseMacroExpand::generate_arraycopy(ArrayCopyNode *ac, AllocateArrayNode*
     local_mem = generate_slow_arraycopy(ac,
                                         &local_ctrl, local_mem, &local_io,
                                         adr_type,
-                                        src, src_offset, dest, dest_offset,
+                                        src, src_offset, orig_dest, dest_offset,
                                         copy_length, /*dest_uninitialized*/false);
 
     result_region->init_req(slow_call_path, local_ctrl);
@@ -839,7 +841,7 @@ Node* PhaseMacroExpand::generate_arraycopy(ArrayCopyNode *ac, AllocateArrayNode*
   _igvn.replace_node(_callprojs.fallthrough_catchproj, *ctrl);
 
 #ifdef ASSERT
-  const TypeOopPtr* dest_t = _igvn.type(dest)->is_oopptr();
+  const TypeOopPtr* dest_t = _igvn.type(orig_dest)->is_oopptr();
   if (dest_t->is_known_instance()) {
     ArrayCopyNode* ac = nullptr;
     assert(ArrayCopyNode::may_modify(dest_t, (*ctrl)->in(0)->as_MemBar(), &_igvn, ac), "dependency on arraycopy lost");
@@ -915,12 +917,12 @@ void PhaseMacroExpand::generate_clear_array(Node* ctrl, MergeMemNode* merge_mem,
   if (start_con >= 0 && end_con >= 0) {
     // Constant start and end.  Simple.
     mem = ClearArrayNode::clear_memory(ctrl, mem, dest,
-                                       start_con, end_con, false, &_igvn);
+                                       start_con, end_con, adr_type == TypeRawPtr::BOTTOM, &_igvn);
   } else if (start_con >= 0 && dest_size != top()) {
     // Constant start, pre-rounded end after the tail of the array.
     Node* end = dest_size;
     mem = ClearArrayNode::clear_memory(ctrl, mem, dest,
-                                       start_con, end, false, &_igvn);
+                                       start_con, end, adr_type == TypeRawPtr::BOTTOM, &_igvn);
   } else if (start_con >= 0 && slice_len != top()) {
     // Constant start, non-constant end.  End needs rounding up.
     // End offset = round_up(abase + ((slice_idx_con + slice_len) << scale), 8)
@@ -933,7 +935,7 @@ void PhaseMacroExpand::generate_clear_array(Node* ctrl, MergeMemNode* merge_mem,
     end = transform_later(new AddXNode(end, MakeConX(end_base)) );
     end = transform_later(new AndXNode(end, MakeConX(~end_round)) );
     mem = ClearArrayNode::clear_memory(ctrl, mem, dest,
-                                       start_con, end, false, &_igvn);
+                                       start_con, end, adr_type == TypeRawPtr::BOTTOM, &_igvn);
   } else if (start_con < 0 && dest_size != top()) {
     // Non-constant start, pre-rounded end after the tail of the array.
     // This is almost certainly a "round-to-end" operation.
@@ -960,14 +962,14 @@ void PhaseMacroExpand::generate_clear_array(Node* ctrl, MergeMemNode* merge_mem,
       if (bump_bit != 0) {
         // Store a zero to the immediately preceding jint:
         Node* x1 = transform_later(new AddXNode(start, MakeConX(-bump_bit)) );
-        Node* p1 = basic_plus_adr(dest, x1);
+        Node* p1 = basic_plus_adr(dest, x1, adr_type == TypeRawPtr::BOTTOM);
         mem = StoreNode::make(_igvn, ctrl, mem, p1, adr_type, intcon(0), T_INT, MemNode::unordered);
         mem = transform_later(mem);
       }
     }
     Node* end = dest_size; // pre-rounded
     mem = ClearArrayNode::clear_memory(ctrl, mem, dest,
-                                       start, end, false, &_igvn);
+                                       start, end, adr_type == TypeRawPtr::BOTTOM, &_igvn);
   } else {
     // Non-constant start, unrounded non-constant end.
     // (Nobody zeroes a random midsection of an array using this routine.)
@@ -1009,7 +1011,7 @@ bool PhaseMacroExpand::generate_block_arraycopy(Node** ctrl, MergeMemNode** mem,
     if (((src_off | dest_off) & (BytesPerLong-1)) == BytesPerInt &&
         ((src_off ^ dest_off) & (BytesPerLong-1)) == 0) {
       Node* sptr = basic_plus_adr(src,  src_off);
-      Node* dptr = basic_plus_adr(dest, dest_off);
+      Node* dptr = basic_plus_adr(dest, dest_off, adr_type == TypeRawPtr::BOTTOM);
       const TypePtr* s_adr_type = _igvn.type(sptr)->is_ptr();
       assert(s_adr_type->isa_aryptr(), "impossible slice");
       uint s_alias_idx = C->get_alias_index(s_adr_type);
@@ -1037,7 +1039,7 @@ bool PhaseMacroExpand::generate_block_arraycopy(Node** ctrl, MergeMemNode** mem,
 
   // Do this copy by giant steps.
   Node* sptr  = basic_plus_adr(src,  src_off);
-  Node* dptr  = basic_plus_adr(dest, dest_off);
+  Node* dptr  = basic_plus_adr(dest, dest_off, adr_type == TypeRawPtr::BOTTOM);
   Node* countx = dest_size;
   countx = transform_later(new SubXNode(countx, MakeConX(dest_off)));
   countx = transform_later(new URShiftXNode(countx, intcon(LogBytesPerLong)));
@@ -1134,8 +1136,8 @@ Node* PhaseMacroExpand::generate_checkcast_arraycopy(Node** ctrl, MergeMemNode**
   Node* check_offset = ConvI2X(transform_later(n3));
   Node* check_value  = dest_elem_klass;
 
-  Node* src_start  = array_element_address(src,  src_offset,  T_OBJECT);
-  Node* dest_start = array_element_address(dest, dest_offset, T_OBJECT);
+  Node* src_start  = array_element_address(src,  src_offset,  T_OBJECT, false);
+  Node* dest_start = array_element_address(dest, dest_offset, T_OBJECT, adr_type == TypeRawPtr::BOTTOM);
 
   const TypeFunc* call_type = OptoRuntime::checkcast_arraycopy_Type();
   Node* call = make_leaf_call(*ctrl, *mem, call_type, copyfunc_addr, "checkcast_arraycopy", adr_type,
@@ -1190,8 +1192,8 @@ void PhaseMacroExpand::generate_unchecked_arraycopy(Node** ctrl, MergeMemNode**
   Node* src_start  = src;
   Node* dest_start = dest;
   if (src_offset != nullptr || dest_offset != nullptr) {
-    src_start =  array_element_address(src, src_offset, basic_elem_type);
-    dest_start = array_element_address(dest, dest_offset, basic_elem_type);
+    src_start =  array_element_address(src, src_offset, basic_elem_type, false);
+    dest_start = array_element_address(dest, dest_offset, basic_elem_type, adr_type == TypeRawPtr::BOTTOM);
   }
 
   // Figure out which arraycopy runtime method to call.
diff --git a/src/hotspot/share/opto/memnode.cpp b/src/hotspot/share/opto/memnode.cpp
index f7da9a96d34..6cb14444f6b 100644
--- a/src/hotspot/share/opto/memnode.cpp
+++ b/src/hotspot/share/opto/memnode.cpp
@@ -1010,6 +1010,7 @@ bool LoadNode::is_immutable_value(Node* adr) {
 Node* LoadNode::make(PhaseGVN& gvn, Node* ctl, Node* mem, Node* adr, const TypePtr* adr_type, const Type* rt, BasicType bt, MemOrd mo,
                      ControlDependency control_dependency, bool require_atomic_access, bool unaligned, bool mismatched, bool unsafe, uint8_t barrier_data) {
   Compile* C = gvn.C;
+  assert(adr->is_top() || C->get_alias_index(gvn.type(adr)->is_ptr()) == C->get_alias_index(adr_type), "adr and adr_type must agree");
 
   // sanity check the alias category against the created node type
   assert(!(adr_type->isa_oopptr() &&
@@ -1411,8 +1412,12 @@ Node* LoadNode::convert_to_unsigned_load(PhaseGVN& gvn) {
       assert(false, "no unsigned variant: %s", Name());
       return nullptr;
   }
+  const Type* mem_t = gvn.type(in(MemNode::Address));
+  if (mem_t == Type::TOP) {
+    return gvn.C->top();
+  }
   return LoadNode::make(gvn, in(MemNode::Control), in(MemNode::Memory), in(MemNode::Address),
-                        raw_adr_type(), rt, bt, _mo, _control_dependency,
+                        mem_t->is_ptr(), rt, bt, _mo, _control_dependency,
                         false /*require_atomic_access*/, is_unaligned_access(), is_mismatched_access());
 }
 
@@ -1431,8 +1436,12 @@ Node* LoadNode::convert_to_signed_load(PhaseGVN& gvn) {
       assert(false, "no signed variant: %s", Name());
       return nullptr;
   }
+  const Type* mem_t = gvn.type(in(MemNode::Address));
+  if (mem_t == Type::TOP) {
+    return gvn.C->top();
+  }
   return LoadNode::make(gvn, in(MemNode::Control), in(MemNode::Memory), in(MemNode::Address),
-                        raw_adr_type(), rt, bt, _mo, _control_dependency,
+                        mem_t->is_ptr(), rt, bt, _mo, _control_dependency,
                         false /*require_atomic_access*/, is_unaligned_access(), is_mismatched_access());
 }
 
@@ -1459,8 +1468,12 @@ Node* LoadNode::convert_to_reinterpret_load(PhaseGVN& gvn, const Type* rt) {
   const int op = Opcode();
   bool require_atomic_access = (op == Op_LoadL && ((LoadLNode*)this)->require_atomic_access()) ||
                                (op == Op_LoadD && ((LoadDNode*)this)->require_atomic_access());
+  const Type* mem_t = gvn.type(in(MemNode::Address));
+  if (mem_t == Type::TOP) {
+    return gvn.C->top();
+  }
   return LoadNode::make(gvn, in(MemNode::Control), in(MemNode::Memory), in(MemNode::Address),
-                        raw_adr_type(), rt, bt, _mo, _control_dependency,
+                        mem_t->is_ptr(), rt, bt, _mo, _control_dependency,
                         require_atomic_access, is_unaligned_access(), is_mismatched);
 }
 
@@ -1482,8 +1495,12 @@ Node* StoreNode::convert_to_reinterpret_store(PhaseGVN& gvn, Node* val, const Ty
   const int op = Opcode();
   bool require_atomic_access = (op == Op_StoreL && ((StoreLNode*)this)->require_atomic_access()) ||
                                (op == Op_StoreD && ((StoreDNode*)this)->require_atomic_access());
+  const Type* mem_t = gvn.type(in(MemNode::Address));
+  if (mem_t == Type::TOP) {
+    return gvn.C->top();
+  }
   StoreNode* st = StoreNode::make(gvn, in(MemNode::Control), in(MemNode::Memory), in(MemNode::Address),
-                                  raw_adr_type(), val, bt, _mo, require_atomic_access);
+                                  mem_t->is_ptr(), val, bt, _mo, require_atomic_access);
 
   bool is_mismatched = is_mismatched_access();
   const TypeRawPtr* raw_type = gvn.type(in(MemNode::Memory))->isa_rawptr();
@@ -2778,6 +2795,7 @@ Node* LoadRangeNode::Identity(PhaseGVN* phase) {
 StoreNode* StoreNode::make(PhaseGVN& gvn, Node* ctl, Node* mem, Node* adr, const TypePtr* adr_type, Node* val, BasicType bt, MemOrd mo, bool require_atomic_access) {
   assert((mo == unordered || mo == release), "unexpected");
   Compile* C = gvn.C;
+  assert(adr_type == nullptr || adr->is_top() || C->get_alias_index(gvn.type(adr)->is_ptr()) == C->get_alias_index(adr_type), "adr and adr_type must agree");
   assert(C->get_alias_index(adr_type) != Compile::AliasIdxRaw ||
          ctl != nullptr, "raw memory operations should have control edge");
 
@@ -5070,7 +5088,7 @@ Node* InitializeNode::capture_store(StoreNode* st, intptr_t start,
     else
       ins_req(i, C->top());     // build a new edge
   }
-  Node* new_st = st->clone();
+  Node* new_st = st->clone_with_adr_type(TypeRawPtr::BOTTOM);
   BarrierSetC2* bs = BarrierSet::barrier_set()->barrier_set_c2();
   new_st->set_req(MemNode::Control, in(Control));
   new_st->set_req(MemNode::Memory,  prev_mem);
diff --git a/src/hotspot/share/opto/memnode.hpp b/src/hotspot/share/opto/memnode.hpp
index 2f26c67f0a8..30d44e82016 100644
--- a/src/hotspot/share/opto/memnode.hpp
+++ b/src/hotspot/share/opto/memnode.hpp
@@ -173,6 +173,14 @@ public:
   static void dump_adr_type(const TypePtr* adr_type, outputStream* st);
   virtual void dump_spec(outputStream *st) const;
 #endif
+
+  MemNode* clone_with_adr_type(const TypePtr* adr_type) const {
+    MemNode* new_node = clone()->as_Mem();
+#ifdef ASSERT
+    new_node->_adr_type = adr_type;
+#endif
+    return new_node;
+  }
 };
 
 // Analyze a MemNode to try to prove that it is independent from other memory accesses

From ef55947162c1853e453b79b66e2e971c8625a638 Mon Sep 17 00:00:00 2001
From: Matthias Baesken <mbaesken@openjdk.org>
Date: Wed, 11 Mar 2026 15:18:32 +0000
Subject: [PATCH 153/655] 8379416: AIX build fails if system (not GNU) date
 tool is in PATH

Reviewed-by: erikj, clanger
---
 make/autoconf/basic_tools.m4 | 6 +++++-
 1 file changed, 5 insertions(+), 1 deletion(-)

diff --git a/make/autoconf/basic_tools.m4 b/make/autoconf/basic_tools.m4
index 8e42f9205a4..66ef94d48a8 100644
--- a/make/autoconf/basic_tools.m4
+++ b/make/autoconf/basic_tools.m4
@@ -1,5 +1,5 @@
 #
-# Copyright (c) 2011, 2025, Oracle and/or its affiliates. All rights reserved.
+# Copyright (c) 2011, 2026, Oracle and/or its affiliates. All rights reserved.
 # DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
 #
 # This code is free software; you can redistribute it and/or modify it
@@ -369,6 +369,10 @@ AC_DEFUN_ONCE([BASIC_SETUP_COMPLEX_TOOLS],
     IS_GNU_DATE=yes
   else
     AC_MSG_RESULT([no])
+    # Likely at the AIX provided version of the date utility here, which is not compatible
+    if test "x$OPENJDK_TARGET_OS" = "xaix"; then
+      AC_MSG_ERROR([gnu date from AIX toolbox is required])
+    fi
     IS_GNU_DATE=no
   fi
   AC_SUBST(IS_GNU_DATE)

From 775f07e67190dc848cf4e466673090311d168015 Mon Sep 17 00:00:00 2001
From: "Daniel D. Daugherty" <dcubed@openjdk.org>
Date: Wed, 11 Mar 2026 16:37:46 +0000
Subject: [PATCH 154/655] 8379435: More proposed cleanups for JDK-8373595 A new
 ObjectMonitorTable implementation

Reviewed-by: coleenp, fbredberg
---
 .../share/runtime/objectMonitorTable.cpp      | 20 +++++++++----------
 1 file changed, 10 insertions(+), 10 deletions(-)

diff --git a/src/hotspot/share/runtime/objectMonitorTable.cpp b/src/hotspot/share/runtime/objectMonitorTable.cpp
index 1b79d1bf1c4..bc173992d7a 100644
--- a/src/hotspot/share/runtime/objectMonitorTable.cpp
+++ b/src/hotspot/share/runtime/objectMonitorTable.cpp
@@ -69,7 +69,7 @@
 // allocate a new table (twice as large as the old one), and then copy all the
 // old monitor pointers from the old table to the new.
 //
-// But since the OMT is a concurrent hash table and things needs to work for
+// But since the OMT is a concurrent hash table and things need to work for
 // other clients of the OMT while we grow it, it gets a bit more
 // complicated.
 //
@@ -125,7 +125,7 @@ class ObjectMonitorTable::Table : public CHeapObj<mtObjectMonitor> {
 
   DEFINE_PAD_MINUS_SIZE(0, DEFAULT_CACHE_LINE_SIZE, 0);
   const size_t _capacity_mask;       // One less than its power-of-two capacity
-  Atomic<Table*> _prev;              // Set while rehashing
+  Atomic<Table*> _prev;              // Set while growing/rebuilding
   Atomic<Entry>* _buckets;           // The payload
   DEFINE_PAD_MINUS_SIZE(1, DEFAULT_CACHE_LINE_SIZE, sizeof(_capacity_mask) + sizeof(_prev) + sizeof(_buckets));
   Atomic<size_t> _items_count;
@@ -251,8 +251,8 @@ public:
       assert(index != start_index, "invariant");
     }
 
-    // Rehashing could have started by now, but if a monitor has been inserted in a
-    // newer table, it was inserted after the get linearization point.
+    // Rebuilding could have started by now, but if a monitor has been inserted
+    // in a newer table, it was inserted after the get linearization point.
     return nullptr;
   }
 
@@ -278,7 +278,7 @@ public:
         // To avoid concurrent inserts succeeding, place a tombstone here.
         Entry result = bucket.compare_exchange(entry, tombstone(), memory_order_relaxed);
         if (result == entry) {
-          // Success! Nobody will try to insert here again, except reinsert from rehashing.
+          // Success! Nobody will try to insert here again, except reinsert from rebuilding.
           return nullptr;
         }
         entry = result;
@@ -333,11 +333,11 @@ public:
           dec_items_count();
           entry = result;
         } else {
-          // Out of allowance; leaving place for rehashing to succeed.
+          // Out of allowance; leave space for rebuilding to succeed.
           // To avoid concurrent inserts succeeding, place a tombstone here.
           Entry result = bucket.compare_exchange(entry, tombstone(), memory_order_acq_rel);
           if (result == entry) {
-            // Success; nobody will try to insert here again, except reinsert from rehashing.
+            // Success; nobody will try to insert here again, except reinsert from rebuilding.
             return nullptr;
           }
           entry = result;
@@ -558,7 +558,7 @@ ObjectMonitorTable::Table* ObjectMonitorTable::grow_table(Table* curr) {
     }
   }
 
-  // Somebody else started rehashing; restart in new table.
+  // Somebody else started rebuilding; restart in their new table.
   delete new_table;
 
   return result;
@@ -591,7 +591,7 @@ void ObjectMonitorTable::remove_monitor_entry(ObjectMonitor* monitor) {
   assert(monitor_get(obj) != monitor, "should have been removed");
 }
 
-// Before handshake; rehash and unlink tables.
+// Before handshake; rebuild and unlink tables.
 void ObjectMonitorTable::rebuild(GrowableArray<Table*>* delete_list) {
   Table* new_table;
   {
@@ -629,7 +629,7 @@ void ObjectMonitorTable::rebuild(GrowableArray<Table*>* delete_list) {
     new_table = new Table(new_capacity, curr);
     Table* result = _curr.compare_exchange(curr, new_table, memory_order_acq_rel);
     if (result != curr) {
-      // Somebody else racingly started rehashing. Delete the
+      // Somebody else racingly started rebuilding. Delete the
       // new_table and treat somebody else's table as the new one.
       delete new_table;
       new_table = result;

From c315d1cd2b0a09cfbd4b8263a0578537558be101 Mon Sep 17 00:00:00 2001
From: Alexey Semenyuk <asemenyuk@openjdk.org>
Date: Wed, 11 Mar 2026 16:39:57 +0000
Subject: [PATCH 155/655] 8357404: jpackage should attempt to get a package
 version from the JDK's release file if the --version option is not specified

Reviewed-by: almatvee
---
 .../jpackage/internal/LinuxFromOptions.java   |   17 +
 .../jdk/jpackage/internal/MacFromOptions.java |   11 +-
 .../jpackage/internal/ApplicationBuilder.java |   62 +-
 .../jdk/jpackage/internal/FromOptions.java    |   17 +-
 .../jdk/jpackage/internal/ModuleInfo.java     |   32 +-
 .../resources/MainResources.properties        |    2 +
 .../internal/util/RuntimeReleaseFile.java     |  130 +++
 .../jdk/jpackage/internal/WinFromOptions.java |   12 +-
 test/jdk/tools/jpackage/TEST.properties       |    2 +-
 .../jdk/jpackage/test/AppImageFile.java       |    3 +-
 .../jdk/jpackage/test/JPackageCommand.java    |  116 +-
 .../jdk/jpackage/test/PackageType.java        |   38 +-
 .../internal/model/DottedVersionTest.java     |   46 +-
 .../internal/util/RuntimeReleaseFileTest.java |  172 +++
 .../tools/jpackage/share/AppVersionTest.java  | 1027 ++++++++++++++++-
 .../jpackage/share/RuntimePackageTest.java    |   12 +-
 16 files changed, 1560 insertions(+), 139 deletions(-)
 create mode 100644 src/jdk.jpackage/share/classes/jdk/jpackage/internal/util/RuntimeReleaseFile.java
 create mode 100644 test/jdk/tools/jpackage/junit/share/jdk.jpackage/jdk/jpackage/internal/util/RuntimeReleaseFileTest.java

diff --git a/src/jdk.jpackage/linux/classes/jdk/jpackage/internal/LinuxFromOptions.java b/src/jdk.jpackage/linux/classes/jdk/jpackage/internal/LinuxFromOptions.java
index 0791c79c662..1f954036431 100644
--- a/src/jdk.jpackage/linux/classes/jdk/jpackage/internal/LinuxFromOptions.java
+++ b/src/jdk.jpackage/linux/classes/jdk/jpackage/internal/LinuxFromOptions.java
@@ -27,6 +27,7 @@ package jdk.jpackage.internal;
 import static jdk.jpackage.internal.FromOptions.buildApplicationBuilder;
 import static jdk.jpackage.internal.FromOptions.createPackageBuilder;
 import static jdk.jpackage.internal.LinuxPackagingPipeline.APPLICATION_LAYOUT;
+import static jdk.jpackage.internal.cli.StandardBundlingOperation.CREATE_LINUX_RPM;
 import static jdk.jpackage.internal.cli.StandardOption.LINUX_APP_CATEGORY;
 import static jdk.jpackage.internal.cli.StandardOption.LINUX_DEB_MAINTAINER_EMAIL;
 import static jdk.jpackage.internal.cli.StandardOption.LINUX_MENU_GROUP;
@@ -39,6 +40,7 @@ import static jdk.jpackage.internal.model.StandardPackageType.LINUX_DEB;
 import static jdk.jpackage.internal.model.StandardPackageType.LINUX_RPM;
 
 import jdk.jpackage.internal.cli.Options;
+import jdk.jpackage.internal.model.DottedVersion;
 import jdk.jpackage.internal.model.Launcher;
 import jdk.jpackage.internal.model.LinuxApplication;
 import jdk.jpackage.internal.model.LinuxDebPackage;
@@ -67,6 +69,10 @@ final class LinuxFromOptions {
 
         appBuilder.launchers().map(LinuxPackagingPipeline::normalizeShortcuts).ifPresent(appBuilder::launchers);
 
+        if (OptionUtils.bundlingOperation(options) == CREATE_LINUX_RPM) {
+            appBuilder.derivedVersionNormalizer(LinuxFromOptions::normalizeRpmVersion);
+        }
+
         return LinuxApplication.create(appBuilder.create());
     }
 
@@ -118,4 +124,15 @@ final class LinuxFromOptions {
         return pkgBuilder;
     }
 
+    private static String normalizeRpmVersion(String version) {
+        // RPM does not support "-" symbol in version. In some case
+        // we might have "-" from "release" file version.
+        // Normalize version if it has "-" symbols. All other supported version
+        // formats by "release" file should be supported by RPM.
+        if (version.contains("-")) {
+            return DottedVersion.lazy(version).toComponentsString();
+        }
+
+        return version;
+    }
 }
diff --git a/src/jdk.jpackage/macosx/classes/jdk/jpackage/internal/MacFromOptions.java b/src/jdk.jpackage/macosx/classes/jdk/jpackage/internal/MacFromOptions.java
index be9519c57a6..20dcbcf5742 100644
--- a/src/jdk.jpackage/macosx/classes/jdk/jpackage/internal/MacFromOptions.java
+++ b/src/jdk.jpackage/macosx/classes/jdk/jpackage/internal/MacFromOptions.java
@@ -31,7 +31,6 @@ import static jdk.jpackage.internal.MacRuntimeValidator.validateRuntimeHasJliLib
 import static jdk.jpackage.internal.MacRuntimeValidator.validateRuntimeHasNoBinDir;
 import static jdk.jpackage.internal.OptionUtils.isBundlingOperation;
 import static jdk.jpackage.internal.cli.StandardBundlingOperation.CREATE_MAC_PKG;
-import static jdk.jpackage.internal.cli.StandardBundlingOperation.SIGN_MAC_APP_IMAGE;
 import static jdk.jpackage.internal.cli.StandardOption.APPCLASS;
 import static jdk.jpackage.internal.cli.StandardOption.ICON;
 import static jdk.jpackage.internal.cli.StandardOption.MAC_APP_CATEGORY;
@@ -65,6 +64,7 @@ import jdk.jpackage.internal.cli.OptionValue;
 import jdk.jpackage.internal.cli.Options;
 import jdk.jpackage.internal.cli.StandardFaOption;
 import jdk.jpackage.internal.model.ApplicationLaunchers;
+import jdk.jpackage.internal.model.DottedVersion;
 import jdk.jpackage.internal.model.ExternalApplication;
 import jdk.jpackage.internal.model.FileAssociation;
 import jdk.jpackage.internal.model.Launcher;
@@ -234,7 +234,7 @@ final class MacFromOptions {
             superAppBuilder.launchers(new ApplicationLaunchers(MacLauncher.create(mainLauncher), launchers.additionalLaunchers()));
         }
 
-        final var app = superAppBuilder.create();
+        superAppBuilder.derivedVersionNormalizer(MacFromOptions::normalizeVersion);
 
         return superAppBuilder;
     }
@@ -389,4 +389,11 @@ final class MacFromOptions {
     private static boolean hasPkgInstallerSignIdentity(Options options) {
         return options.contains(MAC_SIGNING_KEY_NAME) || options.contains(MAC_INSTALLER_SIGN_IDENTITY);
     }
+
+    private static String normalizeVersion(String version) {
+        // macOS requires 1, 2 or 3 components version string.
+        // When reading from release file it can be 1 or 3 or maybe more.
+        // We will always normalize to 3 components if needed.
+        return DottedVersion.lazy(version).trim(3).toComponentsString();
+    }
 }
diff --git a/src/jdk.jpackage/share/classes/jdk/jpackage/internal/ApplicationBuilder.java b/src/jdk.jpackage/share/classes/jdk/jpackage/internal/ApplicationBuilder.java
index ebfae9f8d4c..0cca59f7c19 100644
--- a/src/jdk.jpackage/share/classes/jdk/jpackage/internal/ApplicationBuilder.java
+++ b/src/jdk.jpackage/share/classes/jdk/jpackage/internal/ApplicationBuilder.java
@@ -36,17 +36,20 @@ import java.util.Optional;
 import java.util.function.BiFunction;
 import java.util.function.Function;
 import java.util.function.Predicate;
+import java.util.function.UnaryOperator;
 import jdk.jpackage.internal.model.AppImageLayout;
 import jdk.jpackage.internal.model.Application;
 import jdk.jpackage.internal.model.ApplicationLaunchers;
 import jdk.jpackage.internal.model.ExternalApplication;
 import jdk.jpackage.internal.model.Launcher;
 import jdk.jpackage.internal.model.LauncherIcon;
+import jdk.jpackage.internal.model.LauncherModularStartupInfo;
 import jdk.jpackage.internal.model.LauncherStartupInfo;
 import jdk.jpackage.internal.model.ResourceDirLauncherIcon;
 import jdk.jpackage.internal.model.RuntimeBuilder;
 import jdk.jpackage.internal.model.RuntimeLayout;
 import jdk.jpackage.internal.util.RootedPath;
+import jdk.jpackage.internal.util.RuntimeReleaseFile;
 
 final class ApplicationBuilder {
 
@@ -65,6 +68,8 @@ final class ApplicationBuilder {
         appImageLayout = other.appImageLayout;
         runtimeBuilder = other.runtimeBuilder;
         launchers = other.launchers;
+        runtimeReleaseFile = other.runtimeReleaseFile;
+        derivedVersionNormalizer = other.derivedVersionNormalizer;
     }
 
     ApplicationBuilder copy() {
@@ -86,7 +91,7 @@ final class ApplicationBuilder {
         return new Application.Stub(
                 effectiveName,
                 Optional.ofNullable(description).orElse(effectiveName),
-                Optional.ofNullable(version).orElseGet(DEFAULTS::version),
+                validatedVersion(),
                 Optional.ofNullable(vendor).orElseGet(DEFAULTS::vendor),
                 Optional.ofNullable(copyright).orElseGet(DEFAULTS::copyright),
                 Optional.ofNullable(appDirSources).orElseGet(List::of),
@@ -147,6 +152,11 @@ final class ApplicationBuilder {
 
     Optional<String> version() {
         return Optional.ofNullable(version);
+        }
+
+    ApplicationBuilder runtimeReleaseFile(Path v) {
+        runtimeReleaseFile = v;
+        return this;
     }
 
     ApplicationBuilder vendor(String v) {
@@ -169,6 +179,54 @@ final class ApplicationBuilder {
         return this;
     }
 
+    ApplicationBuilder derivedVersionNormalizer(UnaryOperator<String> v) {
+        derivedVersionNormalizer = v;
+        return this;
+    }
+
+    private String validatedVersion() {
+        return Optional.ofNullable(version).or(() -> {
+            // Application version has not been specified explicitly. Derive it.
+            var derivedVersion = derivedVersion();
+            if (derivedVersionNormalizer != null) {
+                derivedVersion = derivedVersion.map(v -> {
+                    var mappedVersion = derivedVersionNormalizer.apply(v);
+                    if (!mappedVersion.equals(v)) {
+                        Log.verbose(I18N.format("message.version-normalized", mappedVersion, v));
+                    }
+                    return mappedVersion;
+                });
+            }
+            return derivedVersion;
+        }).orElseGet(DEFAULTS::version);
+    }
+
+    private Optional<String> derivedVersion() {
+        if (appImageLayout instanceof RuntimeLayout && runtimeReleaseFile != null) {
+            try {
+                var releaseVersion = new RuntimeReleaseFile(runtimeReleaseFile).getJavaVersion().toString();
+                Log.verbose(I18N.format("message.release-version", releaseVersion));
+                return Optional.of(releaseVersion);
+            } catch (Exception ex) {
+                Log.verbose(ex);
+                return Optional.empty();
+            }
+        } else if (launchers != null) {
+            return launchers.mainLauncher().startupInfo()
+                    .filter(LauncherModularStartupInfo.class::isInstance)
+                    .map(LauncherModularStartupInfo.class::cast)
+                    .flatMap(modularStartupInfo -> {
+                        var moduleVersion = modularStartupInfo.moduleVersion();
+                        moduleVersion.ifPresent(v -> {
+                            Log.verbose(I18N.format("message.module-version", v, modularStartupInfo.moduleName()));
+                        });
+                        return moduleVersion;
+                    });
+        } else {
+            return Optional.empty();
+        }
+    }
+
     static <T extends Launcher> ApplicationLaunchers normalizeIcons(
             ApplicationLaunchers appLaunchers, Optional<Path> resourceDir, BiFunction<T, Launcher, T> launcherOverrideCtor) {
 
@@ -333,6 +391,8 @@ final class ApplicationBuilder {
     private AppImageLayout appImageLayout;
     private RuntimeBuilder runtimeBuilder;
     private ApplicationLaunchers launchers;
+    private Path runtimeReleaseFile;
+    private UnaryOperator<String> derivedVersionNormalizer;
 
     private static final Defaults DEFAULTS = new Defaults(
             "1.0",
diff --git a/src/jdk.jpackage/share/classes/jdk/jpackage/internal/FromOptions.java b/src/jdk.jpackage/share/classes/jdk/jpackage/internal/FromOptions.java
index 4f590850328..4b4e6f9dbac 100644
--- a/src/jdk.jpackage/share/classes/jdk/jpackage/internal/FromOptions.java
+++ b/src/jdk.jpackage/share/classes/jdk/jpackage/internal/FromOptions.java
@@ -59,10 +59,10 @@ import jdk.jpackage.internal.model.Application;
 import jdk.jpackage.internal.model.ApplicationLaunchers;
 import jdk.jpackage.internal.model.ApplicationLayout;
 import jdk.jpackage.internal.model.Launcher;
-import jdk.jpackage.internal.model.LauncherModularStartupInfo;
 import jdk.jpackage.internal.model.PackageType;
 import jdk.jpackage.internal.model.RuntimeLayout;
 import jdk.jpackage.internal.util.RootedPath;
+import jdk.jpackage.internal.util.RuntimeReleaseFile;
 
 final class FromOptions {
 
@@ -212,19 +212,6 @@ final class FromOptions {
 
                 runtimeBuilderBuilder.modulePath(ensureBaseModuleInModulePath(MODULE_PATH.findIn(options).orElseGet(List::of)));
 
-                if (!APP_VERSION.containsIn(options)) {
-                    // Version is not specified explicitly. Try to get it from the app's module.
-                    launchers.mainLauncher().startupInfo().ifPresent(startupInfo -> {
-                        if (startupInfo instanceof LauncherModularStartupInfo modularStartupInfo) {
-                            modularStartupInfo.moduleVersion().ifPresent(moduleVersion -> {
-                                appBuilder.version(moduleVersion);
-                                Log.verbose(I18N.format("message.module-version",
-                                        moduleVersion, modularStartupInfo.moduleName()));
-                            });
-                        }
-                    });
-                }
-
                 predefinedRuntimeDirectory.ifPresentOrElse(runtimeBuilderBuilder::forRuntime, () -> {
                     final var startupInfos = launchers.asList().stream()
                             .map(Launcher::startupInfo)
@@ -239,6 +226,8 @@ final class FromOptions {
             }
         }
 
+        predefinedRuntimeDirectory.map(RuntimeReleaseFile::releaseFilePathInRuntime).ifPresent(appBuilder::runtimeReleaseFile);
+
         return appBuilder;
     }
 
diff --git a/src/jdk.jpackage/share/classes/jdk/jpackage/internal/ModuleInfo.java b/src/jdk.jpackage/share/classes/jdk/jpackage/internal/ModuleInfo.java
index 71d1a66659e..9555423db62 100644
--- a/src/jdk.jpackage/share/classes/jdk/jpackage/internal/ModuleInfo.java
+++ b/src/jdk.jpackage/share/classes/jdk/jpackage/internal/ModuleInfo.java
@@ -24,17 +24,13 @@
  */
 package jdk.jpackage.internal;
 
-import java.io.IOException;
-import java.io.Reader;
 import java.lang.module.ModuleDescriptor;
 import java.lang.module.ModuleReference;
 import java.net.URI;
-import java.nio.file.Files;
 import java.nio.file.Path;
-import java.util.List;
 import java.util.Objects;
 import java.util.Optional;
-import java.util.Properties;
+import jdk.jpackage.internal.util.RuntimeReleaseFile;
 
 record ModuleInfo(String name, Optional<String> version, Optional<String> mainClass, Optional<URI> location) {
 
@@ -56,30 +52,16 @@ record ModuleInfo(String name, Optional<String> version, Optional<String> mainCl
         // We can't extract info about version and main class of a module
         // linked in external runtime without running ModuleFinder in that
         // runtime. But this is too much work as the runtime might have been
-        // coocked without native launchers. So just make sure the module
-        // is linked in the runtime by simply analysing the data
+        // cooked without native launchers. So just make sure the module
+        // is linked in the runtime by simply analyzing the data
         // of `release` file.
 
-        final Path releaseFile = cookedRuntime.resolve("release");
-
-        try (Reader reader = Files.newBufferedReader(releaseFile)) {
-            Properties props = new Properties();
-            props.load(reader);
-            String moduleList = props.getProperty("MODULES");
-            if (moduleList == null) {
+        try {
+            var cookedRuntimeModules = RuntimeReleaseFile.loadFromRuntime(cookedRuntime).getModules();
+            if (!cookedRuntimeModules.contains(moduleName)) {
                 return Optional.empty();
             }
-
-            if ((moduleList.startsWith("\"") && moduleList.endsWith("\""))
-                    || (moduleList.startsWith("\'") && moduleList.endsWith(
-                    "\'"))) {
-                moduleList = moduleList.substring(1, moduleList.length() - 1);
-            }
-
-            if (!List.of(moduleList.split("\\s+")).contains(moduleName)) {
-                return Optional.empty();
-            }
-        } catch (IOException|IllegalArgumentException ex) {
+        } catch (Exception ex) {
             Log.verbose(ex);
             return Optional.empty();
         }
diff --git a/src/jdk.jpackage/share/classes/jdk/jpackage/internal/resources/MainResources.properties b/src/jdk.jpackage/share/classes/jdk/jpackage/internal/resources/MainResources.properties
index 233067d6457..02784a52acc 100644
--- a/src/jdk.jpackage/share/classes/jdk/jpackage/internal/resources/MainResources.properties
+++ b/src/jdk.jpackage/share/classes/jdk/jpackage/internal/resources/MainResources.properties
@@ -52,6 +52,8 @@ message.app-image-created=Succeeded in building output application image directo
 message.debug-working-directory=Kept working directory for debug: {0}
 
 message.module-version=Using version "{0}" from module "{1}" as application version
+message.release-version=Using version "{0}" from "release" file of the predefined runtime as a package version
+message.version-normalized=Using version "{0}" normalized to platform supported format from "{1}"
 
 message.error-header=Error: {0}
 message.advice-header=Advice to fix: {0}
diff --git a/src/jdk.jpackage/share/classes/jdk/jpackage/internal/util/RuntimeReleaseFile.java b/src/jdk.jpackage/share/classes/jdk/jpackage/internal/util/RuntimeReleaseFile.java
new file mode 100644
index 00000000000..e055417f391
--- /dev/null
+++ b/src/jdk.jpackage/share/classes/jdk/jpackage/internal/util/RuntimeReleaseFile.java
@@ -0,0 +1,130 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.  Oracle designates this
+ * particular file as subject to the "Classpath" exception as provided
+ * by Oracle in the LICENSE file that accompanied this code.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+package jdk.jpackage.internal.util;
+
+import java.io.IOException;
+import java.io.Reader;
+import java.nio.file.Files;
+import java.nio.file.Path;
+import java.util.List;
+import java.util.NoSuchElementException;
+import java.util.Optional;
+import java.util.Properties;
+
+public final class RuntimeReleaseFile {
+
+    public RuntimeReleaseFile(Path releaseFilePath) throws IOException {
+        // The implementation is based on the behavior of
+        // jdk.tools.jlink.internal.plugins.ReleaseInfoPlugin, which
+        // uses java.util.Properties to read/write the "release" file.
+        try (Reader reader = Files.newBufferedReader(releaseFilePath)) {
+            props = new Properties();
+            props.load(reader);
+        }
+    }
+
+    /**
+     * Returns path to the "runtime" file in the specified runtime directory.
+     *
+     * @param runtimeDir the path to a directory with the standard Java runtime
+     *                   structure
+     */
+    public static Path releaseFilePathInRuntime(Path runtimeDir) {
+        return runtimeDir.resolve("release");
+    }
+
+    /**
+     * Creates the instance form the "runtime" file in the specified runtime
+     * directory.
+     * <p>
+     * Uses {@link #releaseFilePathInRuntime(Path)} to get the path to the "runtime"
+     * file in the specified runtime directory.
+     *
+     * @param runtimeDir the path to a directory with the standard Java runtime
+     *                   structure
+     */
+    public static RuntimeReleaseFile loadFromRuntime(Path runtimeDir) throws IOException {
+        return new RuntimeReleaseFile(releaseFilePathInRuntime(runtimeDir));
+    }
+
+    /**
+     * Returns verbatim value of the property with the specified name or an empty
+     * {@code Optional} if there is no property with the specified name.
+     * <p>
+     * Property values in the "release" file are enclosed in double quotes.
+     * This method returns the value with the double quotes.
+     *
+     * @param propertyName the property name
+     */
+    public Optional<String> findRawProperty(String propertyName) {
+        return Optional.ofNullable(props.getProperty(propertyName));
+    }
+
+    /**
+     * Returns unquoted value of the property with the specified name or an empty
+     * {@code Optional} if there is no property with the specified name.
+     * <p>
+     * Property values in the "release" file are enclosed in double quotes. This
+     * method returns the value without the double quotes.
+     *
+     * @param propertyName the property name
+     */
+    public Optional<String> findProperty(String propertyName) {
+        return findRawProperty(propertyName).map(v -> {
+            if (v.charAt(0) == '"' && v.charAt(v.length() - 1) == '"') {
+                return v.substring(1, v.length() - 1);
+            } else {
+                return v;
+            }
+        });
+    }
+
+    /**
+     * Returns the value of the "JAVA_VERSION" property.
+     * <p>
+     * Will throw {@code NoSuchElementException} if there is no such property. Will
+     * use {@link Runtime.Version#parse(String)} method to parse version string. Any
+     * exception that it may yield will be passed to the caller verbatim.
+     *
+     * @throws NoSuchElementException if there is no such property
+     */
+    public Runtime.Version getJavaVersion() {
+        return findProperty("JAVA_VERSION").map(Runtime.Version::parse).orElseThrow(NoSuchElementException::new);
+    }
+
+    /**
+     * Returns the value of the "MODULES" property.
+     *
+     * @throws NoSuchElementException if there is no such property
+     */
+    public List<String> getModules() {
+        return findProperty("MODULES").map(v -> {
+            return List.of(v.split("\\s+"));
+        }).orElseThrow(NoSuchElementException::new);
+    }
+
+    private final Properties props;
+}
diff --git a/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/WinFromOptions.java b/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/WinFromOptions.java
index 6009e2f6724..f6080523e89 100644
--- a/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/WinFromOptions.java
+++ b/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/WinFromOptions.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2025, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -42,6 +42,7 @@ import static jdk.jpackage.internal.cli.StandardOption.WIN_UPGRADE_UUID;
 import static jdk.jpackage.internal.model.StandardPackageType.WIN_MSI;
 
 import jdk.jpackage.internal.cli.Options;
+import jdk.jpackage.internal.model.DottedVersion;
 import jdk.jpackage.internal.model.Launcher;
 import jdk.jpackage.internal.model.WinApplication;
 import jdk.jpackage.internal.model.WinExePackage;
@@ -73,6 +74,8 @@ final class WinFromOptions {
 
         appBuilder.launchers().map(WinPackagingPipeline::normalizeShortcuts).ifPresent(appBuilder::launchers);
 
+        appBuilder.derivedVersionNormalizer(WinFromOptions::normalizeVersion);
+
         return WinApplication.create(appBuilder.create());
     }
 
@@ -112,4 +115,11 @@ final class WinFromOptions {
 
         return pkgBuilder.create();
     }
+
+    private static String normalizeVersion(String version) {
+        // Windows requires between 2 and 4 components version string.
+        // When reading from release file it can be 1 or 3 or maybe more.
+        // One component will be normalized to 2 and more then 4 will be trim to 4.
+        return DottedVersion.lazy(version).trim(4).pad(2).toComponentsString();
+    }
 }
diff --git a/test/jdk/tools/jpackage/TEST.properties b/test/jdk/tools/jpackage/TEST.properties
index 5cc4aa7a1b9..99af197b989 100644
--- a/test/jdk/tools/jpackage/TEST.properties
+++ b/test/jdk/tools/jpackage/TEST.properties
@@ -8,7 +8,7 @@ requires.properties = \
     jpackage.test.SQETest \
     jpackage.test.MacSignTests
 
-maxOutputSize = 2000000
+maxOutputSize = 10000000
 
 # Run jpackage tests on windows platform sequentially.
 # Having "share" directory in the list affects tests on other platforms.
diff --git a/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/AppImageFile.java b/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/AppImageFile.java
index 2dcccc673a9..ce2cb6f6b57 100644
--- a/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/AppImageFile.java
+++ b/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/AppImageFile.java
@@ -26,6 +26,7 @@ import static java.util.stream.Collectors.toMap;
 import static jdk.jpackage.internal.util.function.ThrowingConsumer.toConsumer;
 import static jdk.jpackage.internal.util.function.ThrowingFunction.toFunction;
 import static jdk.jpackage.internal.util.function.ThrowingSupplier.toSupplier;
+import static jdk.jpackage.test.JPackageCommand.DEFAULT_VERSION;
 
 import java.io.IOException;
 import java.nio.file.Path;
@@ -65,7 +66,7 @@ public record AppImageFile(String mainLauncherName, Optional<String> mainLaunche
     }
 
     public AppImageFile(String mainLauncherName, Optional<String> mainLauncherClassName) {
-        this(mainLauncherName, mainLauncherClassName, "1.0", false, Map.of(mainLauncherName, Map.of()));
+        this(mainLauncherName, mainLauncherClassName, DEFAULT_VERSION, false, Map.of(mainLauncherName, Map.of()));
     }
 
     public AppImageFile(String mainLauncherName, String mainLauncherClassName) {
diff --git a/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/JPackageCommand.java b/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/JPackageCommand.java
index 67c0ba41e3f..6b1f67d50f4 100644
--- a/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/JPackageCommand.java
+++ b/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/JPackageCommand.java
@@ -43,6 +43,7 @@ import java.security.SecureRandom;
 import java.util.ArrayList;
 import java.util.Collection;
 import java.util.Collections;
+import java.util.HashMap;
 import java.util.List;
 import java.util.ListIterator;
 import java.util.Map;
@@ -60,7 +61,10 @@ import java.util.spi.ToolProvider;
 import java.util.stream.Collectors;
 import java.util.stream.Stream;
 import java.util.stream.StreamSupport;
+import jdk.jpackage.internal.model.DottedVersion;
 import jdk.jpackage.internal.util.MacBundle;
+import jdk.jpackage.internal.util.Result;
+import jdk.jpackage.internal.util.RuntimeReleaseFile;
 import jdk.jpackage.internal.util.function.ExceptionBox;
 import jdk.jpackage.internal.util.function.ThrowingConsumer;
 import jdk.jpackage.internal.util.function.ThrowingFunction;
@@ -102,6 +106,7 @@ public class JPackageCommand extends CommandArguments<JPackageCommand> {
         executeInDirectory = cmd.executeInDirectory;
         winMsiLogFile = cmd.winMsiLogFile;
         unpackedPackageDirectory = cmd.unpackedPackageDirectory;
+        explicitVersion = cmd.explicitVersion;
     }
 
     JPackageCommand createImmutableCopy() {
@@ -246,22 +251,100 @@ public class JPackageCommand extends CommandArguments<JPackageCommand> {
 
     public String version() {
         return PropertyFinder.findAppProperty(this,
-                PropertyFinder.cmdlineOptionWithValue("--app-version").or(cmd -> {
-                    if (cmd.isRuntime() && PackageType.MAC.contains(cmd.packageType())) {
-                        // This is a macOS runtime bundle.
-                        var predefinedRuntimeBundle = MacBundle.fromPath(Path.of(cmd.getArgumentValue("--runtime-image")));
-                        if (predefinedRuntimeBundle.isPresent()) {
-                            // This is a macOS runtime bundle created from the predefined runtime bundle (not a predefined runtime directory).
-                            // The version of this bundle should be copied from the Info.plist file of the predefined runtime bundle.
-                            return MacHelper.readPList(predefinedRuntimeBundle.get().infoPlistFile()).findValue("CFBundleVersion");
-                        }
-                    }
-                    return Optional.empty();
-                }),
+                PropertyFinder.<JPackageCommand>of(Optional.ofNullable(explicitVersion))
+                        .or(PropertyFinder.cmdlineOptionWithValue("--app-version"))
+                        .or(JPackageCommand::derivedVersion),
                 PropertyFinder.appImageFile(appImageFile -> {
                     return appImageFile.version();
                 })
-        ).orElse("1.0");
+        ).orElse(DEFAULT_VERSION);
+    }
+
+    private Optional<String> derivedVersion() {
+        if (isRuntime()) {
+            var predefinedRuntimePath = Path.of(getArgumentValue("--runtime-image"));
+            if (TKit.isOSX()) {
+                // This is a macOS runtime bundle.
+                return MacBundle.fromPath(predefinedRuntimePath).map(predefinedRuntimeBundle -> {
+                    return Result.<Optional<String>>of(() -> {
+                        // This is a macOS runtime bundle created from the predefined runtime bundle (not a predefined runtime directory).
+                        // The version of this bundle should be copied from the Info.plist file of the predefined runtime bundle.
+                        return MacHelper.readPList(predefinedRuntimeBundle.infoPlistFile()).findValue("CFBundleVersion");
+                    }).value().flatMap(x -> x).or(() -> {
+                        // Failed to read version from the Info.plist file of the predefined runtime bundle.
+                        // Try to read it from the "release" file of the predefined runtime directory.
+                        return normalizedVersionFromRuntimeReleaseFile(predefinedRuntimeBundle.homeDir());
+                    });
+                }).orElseGet(() -> {
+                    return normalizedVersionFromRuntimeReleaseFile(predefinedRuntimePath);
+                });
+            } else {
+                return normalizedVersionFromRuntimeReleaseFile(predefinedRuntimePath);
+            }
+        } else {
+            return Optional.empty();
+        }
+    }
+
+    private Optional<String> normalizedVersionFromRuntimeReleaseFile(Path runtimeDir) {
+        return Result.of(() -> {
+            return RuntimeReleaseFile.loadFromRuntime(runtimeDir).getJavaVersion().toString();
+        }, Exception.class).value().map(JPackageCommand::normalizeDerivedVersion).map(map -> {
+            return Objects.requireNonNull(map.get(packageType()));
+        });
+    }
+
+    public static Map<PackageType, String> normalizeDerivedVersion(String version) {
+        var dotted = DottedVersion.lazy(version);
+
+        var map = new HashMap<PackageType, String>();
+
+        // Linux
+        map.put(PackageType.LINUX_IMAGE, version);
+        map.put(PackageType.LINUX_DEB, version);
+        if (dotted.getUnprocessedSuffix().contains("-")) {
+            map.put(PackageType.LINUX_RPM, dotted.toComponentsString());
+        } else {
+            map.put(PackageType.LINUX_RPM, version);
+        }
+
+        // macOS
+        PackageType.ALL_MAC.forEach(type -> {
+            map.put(type, dotted.trim(3).pad(1).toComponentsString());
+        });
+
+        // Windows
+        PackageType.ALL_WINDOWS.forEach(type -> {
+            DottedVersion ver;
+            if (dotted.getComponentsCount() < 2) {
+                ver = dotted.pad(2);
+            } else {
+                ver = dotted.trim(4);
+            }
+            map.put(type, ver.toComponentsString());
+        });
+
+        map.put(PackageType.IMAGE, Objects.requireNonNull(map.get(PackageType.appImageForOS(PackageType.IMAGE.os()))));
+
+        return map;
+    }
+
+    /**
+     * Sets application version.
+     * <p>
+     * Use this method to explicitly set the application version. Normally, the
+     * application version can be derived from the command line, but sometimes, when
+     * jpackage derives it from other sources, the {@code JPackageCommand} class
+     * can't get it correctly. Use this method in these uncommon cases.
+     *
+     * @param v the application version or {@code null} to reset previously set
+     *          value
+     * @return this
+     */
+    public JPackageCommand version(String v) {
+        verifyMutable();
+        explicitVersion = v;
+        return this;
     }
 
     public String name() {
@@ -1930,6 +2013,7 @@ public class JPackageCommand extends CommandArguments<JPackageCommand> {
     private Path executeInDirectory;
     private Path winMsiLogFile;
     private Path unpackedPackageDirectory;
+    private String explicitVersion;
     private Set<ReadOnlyPathAssert> readOnlyPathAsserts = Set.of(ReadOnlyPathAssert.values());
     private Set<StandardAssert> standardAsserts = Set.of(StandardAssert.values());
     private List<Consumer<Executor.Result>> validators = new ArrayList<>();
@@ -1938,7 +2022,9 @@ public class JPackageCommand extends CommandArguments<JPackageCommand> {
         VALUE
     }
 
-    private static final Map<String, PackageType> PACKAGE_TYPES = Stream.of(PackageType.values()).collect(toMap(PackageType::getType, x -> x));
+    private static final Map<String, PackageType> PACKAGE_TYPES = Stream.of(PackageType.values()).filter(type -> {
+        return type.isNative() || type == PackageType.IMAGE;
+    }).collect(toMap(PackageType::getType, x -> x));
 
     // Set the property to the path of run-time image to speed up
     // building app images and platform bundles by avoiding running jlink.
@@ -1947,6 +2033,8 @@ public class JPackageCommand extends CommandArguments<JPackageCommand> {
     // `--runtime-image` parameter set.
     public static final Path DEFAULT_RUNTIME_IMAGE = Optional.ofNullable(TKit.getConfigProperty("runtime-image")).map(Path::of).orElse(null);
 
+    public final static String DEFAULT_VERSION = "1.0";
+
     // [HH:mm:ss.SSS]
     private static final Pattern TIMESTAMP_REGEXP = Pattern.compile(
             "^\\[\\d\\d:\\d\\d:\\d\\d.\\d\\d\\d\\] ");
diff --git a/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/PackageType.java b/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/PackageType.java
index 085e782ea40..df020d39fc8 100644
--- a/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/PackageType.java
+++ b/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/PackageType.java
@@ -48,16 +48,22 @@ public enum PackageType {
     LINUX_RPM(".rpm", OperatingSystem.LINUX),
     MAC_DMG(".dmg", OperatingSystem.MACOS),
     MAC_PKG(".pkg", OperatingSystem.MACOS),
-    IMAGE;
+    IMAGE(OperatingSystem.current()),
+    WIN_IMAGE(OperatingSystem.WINDOWS),
+    LINUX_IMAGE(OperatingSystem.LINUX),
+    MAC_IMAGE(OperatingSystem.MACOS),
+    ;
 
-    PackageType() {
+    PackageType(OperatingSystem os) {
+        this.os = Objects.requireNonNull(os);
         type  = "app-image";
         suffix = null;
-        supported = true;
-        enabled = true;
+        supported = (os == OperatingSystem.current());
+        enabled = supported;
     }
 
     PackageType(String packageName, String bundleSuffix, OperatingSystem os) {
+        this.os = Objects.requireNonNull(os);
         type  = Objects.requireNonNull(packageName);
         suffix = Objects.requireNonNull(bundleSuffix);
         supported = isSupported(new BundlingOperationDescriptor(os, type));
@@ -88,10 +94,29 @@ public enum PackageType {
         return enabled;
     }
 
+    public boolean isAppImage() {
+        return type.equals(IMAGE.type);
+    }
+
+    public boolean isNative() {
+        return !isAppImage();
+    }
+
     public String getType() {
         return type;
     }
 
+    public OperatingSystem os() {
+        return os;
+    }
+
+    public static PackageType appImageForOS(OperatingSystem os) {
+        Objects.requireNonNull(os);
+        return Stream.of(LINUX_IMAGE, MAC_IMAGE, WIN_IMAGE).filter(type -> {
+            return type.os() == os;
+        }).findFirst().orElseThrow();
+    }
+
     public static RuntimeException throwSkippedExceptionIfNativePackagingUnavailable() {
         if (NATIVE.stream().noneMatch(PackageType::isSupported)) {
             TKit.throwSkippedException("None of the native packagers supported in this environment");
@@ -115,6 +140,7 @@ public enum PackageType {
         return new LinkedHashSet<>(List.of(types));
     }
 
+    private final OperatingSystem os;
     private final String type;
     private final String suffix;
     private final boolean enabled;
@@ -126,6 +152,10 @@ public enum PackageType {
     public static final Set<PackageType> NATIVE = Stream.of(LINUX, WINDOWS, MAC)
             .flatMap(Collection::stream).collect(Collectors.toUnmodifiableSet());
 
+    public static final Set<PackageType> ALL_LINUX = orderedSet(LINUX_IMAGE, LINUX_DEB, LINUX_RPM);
+    public static final Set<PackageType> ALL_WINDOWS = orderedSet(WIN_IMAGE, WIN_MSI, WIN_EXE);
+    public static final Set<PackageType> ALL_MAC = orderedSet(MAC_IMAGE, MAC_DMG, MAC_PKG);
+
     private static final class Inner {
         private static final Set<String> DISABLED_PACKAGERS = Optional.ofNullable(
                 TKit.tokenizeConfigProperty("disabledPackagers")).orElse(
diff --git a/test/jdk/tools/jpackage/junit/share/jdk.jpackage/jdk/jpackage/internal/model/DottedVersionTest.java b/test/jdk/tools/jpackage/junit/share/jdk.jpackage/jdk/jpackage/internal/model/DottedVersionTest.java
index df020f1a34c..65f9c71a910 100644
--- a/test/jdk/tools/jpackage/junit/share/jdk.jpackage/jdk/jpackage/internal/model/DottedVersionTest.java
+++ b/test/jdk/tools/jpackage/junit/share/jdk.jpackage/jdk/jpackage/internal/model/DottedVersionTest.java
@@ -22,18 +22,19 @@
  */
 package jdk.jpackage.internal.model;
 
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertFalse;
+import static org.junit.jupiter.api.Assertions.assertNotSame;
+import static org.junit.jupiter.api.Assertions.assertSame;
+import static org.junit.jupiter.api.Assertions.assertThrowsExactly;
+import static org.junit.jupiter.api.Assertions.assertTrue;
+
 import java.text.MessageFormat;
 import java.util.ArrayList;
 import java.util.List;
 import java.util.Objects;
 import java.util.function.Function;
 import java.util.stream.Stream;
-import static org.junit.jupiter.api.Assertions.assertEquals;
-import static org.junit.jupiter.api.Assertions.assertFalse;
-import static org.junit.jupiter.api.Assertions.assertThrowsExactly;
-import static org.junit.jupiter.api.Assertions.assertTrue;
-import static org.junit.jupiter.api.Assertions.assertSame;
-import static org.junit.jupiter.api.Assertions.assertNotSame;
 import org.junit.jupiter.api.Test;
 import org.junit.jupiter.params.ParameterizedTest;
 import org.junit.jupiter.params.provider.Arguments;
@@ -54,14 +55,6 @@ public class DottedVersionTest {
             this(input, type.createVersion, "", expectedComponentCount, input);
         }
 
-        static TestConfig greedy(String input, int expectedComponentCount, String expectedToComponent) {
-            return new TestConfig(input, Type.GREEDY.createVersion, "", expectedComponentCount, expectedToComponent);
-        }
-
-        static TestConfig greedy(String input, int expectedComponentCount) {
-            return new TestConfig(input, Type.GREEDY.createVersion, "", expectedComponentCount, input);
-        }
-
         static TestConfig lazy(String input, String expectedSuffix, int expectedComponentCount, String expectedToComponent) {
             return new TestConfig(input, Type.LAZY.createVersion, expectedSuffix, expectedComponentCount, expectedToComponent);
         }
@@ -74,6 +67,7 @@ public class DottedVersionTest {
         assertEquals(cfg.expectedSuffix(), dv.getUnprocessedSuffix());
         assertEquals(cfg.expectedComponentCount(), dv.getComponents().length);
         assertEquals(cfg.expectedToComponent(), dv.toComponentsString());
+        assertEquals(dv.toString(), cfg.input());
     }
 
     private static List<TestConfig> testValid() {
@@ -123,7 +117,7 @@ public class DottedVersionTest {
 
     @ParameterizedTest
     @MethodSource
-    public void testTrim(DottedVersion ver, String expectedStr, int limit) {
+    public void test_trim(DottedVersion ver, String expectedStr, int limit) {
         var expected = DottedVersion.lazy(expectedStr);
         var actual = ver.trim(limit);
         assertEquals(expected, actual);
@@ -136,14 +130,14 @@ public class DottedVersionTest {
     }
 
     @ParameterizedTest
-    @MethodSource
-    public void testTrimNegative(DottedVersion ver, int limit) {
+    @MethodSource("test_trim_pad_negative")
+    public void test_trim_negative(DottedVersion ver, int limit) {
         assertThrowsExactly(IllegalArgumentException.class, () -> {
             ver.trim(limit);
         });
     }
 
-    private static Stream<Arguments> testTrim() {
+    private static Stream<Arguments> test_trim() {
 
         var testCases = new ArrayList<Arguments>();
 
@@ -160,15 +154,9 @@ public class DottedVersionTest {
         return testCases.stream().map(DottedVersionTest::mapFirstStringToDottedVersion);
     }
 
-    private static Stream<Arguments> testTrimNegative() {
-        return Stream.of(
-                Arguments.of("10.5.foo", -1)
-        ).map(DottedVersionTest::mapFirstStringToDottedVersion);
-    }
-
     @ParameterizedTest
     @MethodSource
-    public void testPad(DottedVersion ver, String expectedStr, int limit) {
+    public void test_pad(DottedVersion ver, String expectedStr, int limit) {
         var expected = DottedVersion.lazy(expectedStr);
         var actual = ver.pad(limit);
         assertEquals(expected, actual);
@@ -181,14 +169,14 @@ public class DottedVersionTest {
     }
 
     @ParameterizedTest
-    @MethodSource
-    public void testPadNegative(DottedVersion ver, int limit) {
+    @MethodSource("test_trim_pad_negative")
+    public void test_pad_negative(DottedVersion ver, int limit) {
         assertThrowsExactly(IllegalArgumentException.class, () -> {
             ver.pad(limit);
         });
     }
 
-    private static Stream<Arguments> testPad() {
+    private static Stream<Arguments> test_pad() {
 
         var testCases = new ArrayList<Arguments>();
 
@@ -206,7 +194,7 @@ public class DottedVersionTest {
         return testCases.stream().map(DottedVersionTest::mapFirstStringToDottedVersion);
     }
 
-    private static Stream<Arguments> testPadNegative() {
+    private static Stream<Arguments> test_trim_pad_negative() {
         return Stream.of(
                 Arguments.of("10.5.foo", -1)
         ).map(DottedVersionTest::mapFirstStringToDottedVersion);
diff --git a/test/jdk/tools/jpackage/junit/share/jdk.jpackage/jdk/jpackage/internal/util/RuntimeReleaseFileTest.java b/test/jdk/tools/jpackage/junit/share/jdk.jpackage/jdk/jpackage/internal/util/RuntimeReleaseFileTest.java
new file mode 100644
index 00000000000..097f63d51ab
--- /dev/null
+++ b/test/jdk/tools/jpackage/junit/share/jdk.jpackage/jdk/jpackage/internal/util/RuntimeReleaseFileTest.java
@@ -0,0 +1,172 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+package jdk.jpackage.internal.util;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertFalse;
+import static org.junit.jupiter.api.Assertions.assertThrows;
+import static org.junit.jupiter.api.Assertions.assertThrowsExactly;
+
+import java.io.IOException;
+import java.io.UncheckedIOException;
+import java.io.Writer;
+import java.lang.module.ModuleDescriptor;
+import java.lang.module.ModuleFinder;
+import java.lang.module.ModuleReference;
+import java.nio.file.Files;
+import java.nio.file.Path;
+import java.util.List;
+import java.util.Map;
+import java.util.NoSuchElementException;
+import java.util.Optional;
+import java.util.Properties;
+import org.junit.jupiter.api.Test;
+import org.junit.jupiter.api.io.TempDir;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.CsvSource;
+
+class RuntimeReleaseFileTest {
+
+    @Test
+    void test_invalid_input(@TempDir Path workdir) {
+        assertThrows(IOException.class, () -> {
+            new RuntimeReleaseFile(workdir);
+        });
+    }
+
+    @Test
+    void test_findRawProperty(@TempDir Path workdir) throws IOException {
+        var releaseFile = new RuntimeReleaseFile(createPropFile(workdir, Map.of("Name", "John", "Company", "\"Acme LTD\"")));
+
+        assertEquals(Optional.empty(), releaseFile.findRawProperty("foo"));
+        assertEquals(Optional.of("John"), releaseFile.findRawProperty("Name"));
+        assertEquals(Optional.of("\"Acme LTD\""), releaseFile.findRawProperty("Company"));
+    }
+
+    @Test
+    void test_findProperty(@TempDir Path workdir) throws IOException {
+        var releaseFile = new RuntimeReleaseFile(createPropFile(workdir, Map.of("Name", "John", "Company", "\"Acme LTD\"")));
+
+        assertEquals(Optional.empty(), releaseFile.findProperty("foo"));
+        assertEquals(Optional.of("John"), releaseFile.findProperty("Name"));
+        assertEquals(Optional.of("Acme LTD"), releaseFile.findProperty("Company"));
+    }
+
+    @ParameterizedTest
+    @CsvSource({
+        "foo, foo",
+        "\"foo\", foo",
+        "'foo', 'foo'",
+        "\"f\"o\"o\", f\"o\"o",
+        "\"foo, \"foo",
+        "foo\", foo\"",
+    })
+    void test_findProperty(String rawValue, String expectedValue, @TempDir Path workdir) throws IOException {
+        var releaseFile = new RuntimeReleaseFile(createPropFile(workdir, Map.of("FOO", rawValue)));
+
+        assertEquals(expectedValue, releaseFile.findProperty("FOO").orElseThrow());
+    }
+
+    @ParameterizedTest
+    @CsvSource({
+        "\"27.1.2\", 27.1.2",
+        "27.1.2, 27.1.2",
+        "\"27.1.2-ea\", 27.1.2-ea",
+        "27.1.2-ea, 27.1.2-ea",
+        "\"27.1.2+15\", 27.1.2+15",
+        "27.1.2+15, 27.1.2+15",
+    })
+    void test_getJavaVersion(String version, String expectedVersion, @TempDir Path workdir) throws IOException {
+        var releaseFile = new RuntimeReleaseFile(createPropFileWithValue(workdir, "JAVA_VERSION", version));
+
+        final var value = releaseFile.getJavaVersion();
+
+        assertEquals(expectedVersion, value.toString());
+    }
+
+    @ParameterizedTest
+    @CsvSource({
+        "\"7.1.2+foo\"",
+        "\"foo\"",
+        "\"\"",
+        "7.1.2+foo",
+        "foo",
+        "''"
+    })
+    void test_getJavaVersion_invalid(String version, @TempDir Path workdir) throws IOException {
+        var releaseFile = new RuntimeReleaseFile(createPropFileWithValue(workdir, "JAVA_VERSION", version));
+
+        var ex = assertThrows(RuntimeException.class, releaseFile::getJavaVersion);
+
+        assertFalse(NoSuchElementException.class.isInstance(ex));
+    }
+
+    @Test
+    void test_without_version(@TempDir Path workdir) throws IOException {
+        var releaseFile = new RuntimeReleaseFile(createPropFileWithValue(workdir, "JDK_VERSION", "\"27.1.2\""));
+
+        assertThrowsExactly(NoSuchElementException.class, releaseFile::getJavaVersion);
+    }
+
+    @Test
+    void test_getModules(@TempDir Path workdir) throws IOException {
+        var releaseFile = new RuntimeReleaseFile(createPropFileWithValue(workdir, "MODULES", "foo bar\t  buz  "));
+
+        assertEquals(List.of("foo", "bar", "buz"), releaseFile.getModules());
+    }
+
+    @Test
+    void test_current() throws IOException {
+        var releaseFile = new RuntimeReleaseFile(Path.of(System.getProperty("java.home")).resolve("release"));
+
+        final var expectedVersion = Runtime.version();
+        final var actualVersion = releaseFile.getJavaVersion();
+
+        assertEquals(expectedVersion.version(), actualVersion.version());
+
+        final var expectedModules = ModuleFinder.ofSystem().findAll().stream()
+                .map(ModuleReference::descriptor).map(ModuleDescriptor::name).sorted().toList();
+        final var actualModules = releaseFile.getModules().stream().sorted().toList();
+
+        assertEquals(expectedModules, actualModules);
+    }
+
+    private Path createPropFileWithValue(Path workdir, String name, String value) {
+        return createPropFile(workdir, Map.of(name, value));
+    }
+
+    private Path createPropFile(Path workdir, Map<String, String> input) {
+        Path releaseFile = workdir.resolve("foo");
+        Properties props = new Properties();
+        props.putAll(input);
+
+        try (Writer writer = Files.newBufferedWriter(releaseFile)) {
+            props.store(writer, null);
+        } catch (IOException ex) {
+            throw new UncheckedIOException(ex);
+        }
+
+        return releaseFile;
+    }
+}
diff --git a/test/jdk/tools/jpackage/share/AppVersionTest.java b/test/jdk/tools/jpackage/share/AppVersionTest.java
index ad96a9b9e0c..3b6ac5a9241 100644
--- a/test/jdk/tools/jpackage/share/AppVersionTest.java
+++ b/test/jdk/tools/jpackage/share/AppVersionTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2019, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2019, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -22,15 +22,50 @@
  */
 
 
+import static java.util.stream.Collectors.toUnmodifiableMap;
+import static java.util.stream.Collectors.toUnmodifiableSet;
+import static jdk.jpackage.internal.util.PListWriter.writeDict;
+import static jdk.jpackage.internal.util.PListWriter.writePList;
+import static jdk.jpackage.internal.util.XmlUtils.createXml;
+import static jdk.jpackage.internal.util.XmlUtils.toXmlConsumer;
+import static jdk.jpackage.test.JPackageCommand.DEFAULT_VERSION;
+import static jdk.jpackage.test.JPackageCommand.normalizeDerivedVersion;
+import static jdk.jpackage.test.JPackageCommand.RuntimeImageType.RUNTIME_TYPE_FAKE;
+
 import java.io.IOException;
-import java.util.Collection;
+import java.nio.file.Path;
 import java.util.ArrayList;
+import java.util.Collection;
+import java.util.Collections;
+import java.util.HashMap;
+import java.util.HashSet;
 import java.util.List;
-import javax.xml.xpath.XPathExpressionException;
-import jdk.jpackage.test.AppImageFile;
-import jdk.jpackage.test.Annotations.Parameters;
+import java.util.Map;
+import java.util.Objects;
+import java.util.Optional;
+import java.util.Set;
+import java.util.function.Consumer;
+import java.util.function.Predicate;
+import java.util.regex.Pattern;
+import java.util.stream.Stream;
+import jdk.internal.util.OperatingSystem;
+import jdk.jpackage.internal.util.MacBundle;
+import jdk.jpackage.internal.util.RuntimeReleaseFile;
+import jdk.jpackage.internal.util.Slot;
+import jdk.jpackage.test.Annotations.ParameterSupplier;
 import jdk.jpackage.test.Annotations.Test;
+import jdk.jpackage.test.AppImageFile;
+import jdk.jpackage.test.CannedFormattedString;
+import jdk.jpackage.test.ConfigurationTarget;
 import jdk.jpackage.test.JPackageCommand;
+import jdk.jpackage.test.JPackageCommand.StandardAssert;
+import jdk.jpackage.test.JPackageOutputValidator;
+import jdk.jpackage.test.JPackageStringBundle;
+import jdk.jpackage.test.JavaAppDesc;
+import jdk.jpackage.test.MacHelper;
+import jdk.jpackage.test.PackageTest;
+import jdk.jpackage.test.PackageType;
+import jdk.jpackage.test.RunnablePackageTest.Action;
 import jdk.jpackage.test.TKit;
 
 /*
@@ -45,54 +80,954 @@ import jdk.jpackage.test.TKit;
 
 public final class AppVersionTest {
 
-    @Parameters
-    public static Collection<?> input() {
-        List<Object[]> data = new ArrayList<>();
+    @Test
+    @ParameterSupplier
+    public static void testApp(AppTestSpec testSpec) {
 
-        data.addAll(List.of(new Object[][]{
-            // Default jpackage version
-            {"1.0", "Hello", null},
-            {"1.0", "com.other/com.other.Hello", null},
-            // Version should be picked from --app-version
-            {"3.1", "Hello", new String[]{"--app-version", "3.1"}},
-            {"3.2", "com.other/com.other.Hello", new String[]{"--app-version",
-                "3.2"}},
-            // Version should be picked from the last --app-version
-            {"3.3", "Hello", new String[]{"--app-version", "4", "--app-version",
-                "3.3"}},
-            {"7.8", "com.other/com.other.Hello", new String[]{"--app-version",
-                "4", "--app-version", "7.8"}},
-            // Pick version from jar
-            {"3.10.17", "com.other/com.other.Hello@3.10.17", null},
-            // Ignore version in jar if --app-version given
-            {"7.5.81", "com.other/com.other.Hello@3.10.17", new String[]{
-                "--app-version", "7.5.81"}}
-        }));
+        var moduleVersionSource = testSpec.findVersionSource(ModuleVersionSource.class);
 
-        return data;
-    }
+        ConfigurationTarget cfg;
+        if (testSpec.isImagePackageType()) {
+            var cmd = moduleVersionSource.map(ModuleVersionSource::appDesc)
+                    .map(JPackageCommand::helloAppImage)
+                    .orElseGet(JPackageCommand::helloAppImage);
+            cfg = new ConfigurationTarget(cmd);
+        } else {
+            var nativeTest = new PackageTest().forTypes(testSpec.spec().expected().keySet());
+            moduleVersionSource
+                    .map(ModuleVersionSource::appDesc)
+                    .ifPresentOrElse(nativeTest::configureHelloApp, nativeTest::configureHelloApp);
 
-    public AppVersionTest(String expectedVersion, String javaAppDesc,
-            String[] jpackageArgs) {
-        this.expectedVersion = expectedVersion;
-        this.javaAppDesc = javaAppDesc;
-        this.jpackageArgs = jpackageArgs;
+            cfg = new ConfigurationTarget(nativeTest);
+        }
+
+        cfg.addInitializer(JPackageCommand::setFakeRuntime);
+
+        cfg.addInitializer(testSpec::applyTo);
+
+        cfg.cmd().ifPresent(JPackageCommand::executeAndAssertHelloAppImageCreated);
+
+        testSpec.validateVersion(cfg);
+
+        cfg.test().ifPresent(pkg -> {
+            pkg.run(testSpec.spec().packageTestActions());
+        });
     }
 
     @Test
-    public void test() throws XPathExpressionException, IOException {
-        JPackageCommand cmd = JPackageCommand.helloAppImage(javaAppDesc);
-        if (jpackageArgs != null) {
-            cmd.addArguments(jpackageArgs);
-        }
-        cmd.executeAndAssertHelloAppImageCreated();
+    @ParameterSupplier
+    @ParameterSupplier(value = "testMacPredefinedRuntimeBundle", ifOS = OperatingSystem.MACOS)
+    public static void testRuntime(RuntimeTestSpec testSpec) {
 
-        String actualVersion = AppImageFile.load(cmd.outputBundle()).version();
-        TKit.assertEquals(expectedVersion, actualVersion,
-                "Check application version");
+        var predefinedRuntimeDir = Slot.<Path>createEmpty();
+        new PackageTest()
+        .forTypes(testSpec.spec().expected().keySet())
+        .addRunOnceInitializer(() -> {
+            predefinedRuntimeDir.set(testSpec.createRuntime());
+        })
+        .addInitializer(cmd -> {
+            cmd.removeArgumentWithValue("--input").setArgumentValue("--runtime-image", predefinedRuntimeDir.get());
+        })
+        .addInitializer(testSpec::applyTo)
+        .mutate(test -> {
+            testSpec.validateVersion(new ConfigurationTarget(test));
+        })
+        .run(testSpec.spec().packageTestActions());
     }
 
-    private final String expectedVersion;
-    private final String javaAppDesc;
-    private final String[] jpackageArgs;
+    public static Collection<?> testApp() {
+
+        List<AppTestSpec> testCases = new ArrayList<>();
+
+        for (var modular : List.of(true, false)) {
+            String appDesc;
+            if (modular) {
+                appDesc = "com.other/com.other.Hello";
+            } else {
+                appDesc = "Hello";
+            }
+
+            // Default version.
+            AppTestSpec.create(appDesc, TestSpec.build().expectDefaultVersion(), testCases::add);
+
+            // Pick version from the command line.
+            AppTestSpec.create(appDesc, TestSpec.build().versionFromCmdline("3.1"), testCases::add);
+        }
+
+        // Pick version from the modular jar.
+        AppTestSpec.create(TestSpec.build()
+                .versionFromAppModule("com.other/com.other.Hello@3.10.16"), testCases::add);
+
+        // Pick version from the command line, ignore version of the modular jar.
+        AppTestSpec.create(TestSpec.build()
+                .versionFromAppModule("com.other/com.other.Hello@3.10.18")
+                .versionFromCmdline("7.5.81"), testCases::add);
+
+        // Pick version from the modular jar. Apply package-specific normalization.
+        for (var ver : List.of(
+                "30.10.17.204.899-foo"
+        )) {
+            var versionSource = new ModuleVersionSource("com.other/com.other.Hello@" + ver);
+
+            var builder = TestSpec.build().versionSource(versionSource);
+            for (var e : TestSpec.Builder.getExpectedVersions(versionSource).entrySet()) {
+                builder.withTypes(e.getKey()).expect(e.getValue());
+            }
+
+            AppTestSpec.create(builder, testCases::add);
+        }
+
+        return testCases.stream().map(v -> {
+            return new Object[] {v};
+        }).toList();
+    }
+
+    public static Collection<?> testRuntime() {
+
+        List<RuntimeTestSpec> testCases = new ArrayList<>();
+
+        // Default version.
+        RuntimeTestSpec.create(TestSpec.build().expectDefaultVersion(), testCases::add);
+
+        // Pick version from the command line.
+        RuntimeTestSpec.create(TestSpec.build().versionFromCmdline("3.1"), testCases::add);
+
+        // Invalid versions.
+        for (var ver : List.of("foo", "", "17.21.3+foo")) {
+            RuntimeTestSpec.create(TestSpec.build().versionFromReleaseFile(ver).expectDefaultVersion(), testCases::add);
+        }
+
+        // Valid version values (see java.lang.Runtime.Version javadoc and https://openjdk.org/jeps/223)
+        for (var suffix : jep223VersionSuffixes()) {
+            for (var vnum : List.of("17", "17.1", "17.1.2", "17.1.2.3", "17.1.2.3.5")) {
+                var ver = new RuntimeReleaseFileVersionSource(vnum + suffix);
+
+                var builder = TestSpec.build().versionSource(ver);
+                for (var e : TestSpec.Builder.getExpectedVersions(ver).entrySet()) {
+                    builder.withTypes(e.getKey()).expect(e.getValue());
+                }
+
+                RuntimeTestSpec.create(builder, testCases::add);
+            }
+        }
+
+        return testCases.stream().map(v -> {
+            return new Object[] {v};
+        }).toList();
+    }
+
+    public static Collection<?> testMacPredefinedRuntimeBundle() {
+
+        List<RuntimeTestSpec> testCases = new ArrayList<>();
+
+        var appendTestCases = skipImagePackageType(testSpec -> {
+            for (var runtimeType : List.of(
+                    RuntimeType.MAC_BUNDLE_PLIST_FILE_MALFORMED,
+                    RuntimeType.MAC_BUNDLE_PLIST_WITHOUT_VERSION
+            )) {
+                testCases.add(new RuntimeTestSpec(runtimeType, testSpec));
+            }
+        });
+
+        // Invalid version.
+        TestSpec.build().versionFromReleaseFile("foo").expectDefaultVersion().create(appendTestCases);
+
+        // Valid versions.
+        for (var suffix : List.of("", "-foo")) {
+            for (var vnum : List.of("17", "17.1", "17.1.2", "17.1.2.3")) {
+                var ver = new RuntimeReleaseFileVersionSource(vnum + suffix);
+
+                var builder = TestSpec.build().versionSource(ver);
+                var allBundleTypes = TestSpec.Builder.getExpectedVersions(ver);
+                for (var bundleType : PackageType.MAC) {
+                    builder.withTypes(bundleType).expect(Objects.requireNonNull(allBundleTypes.get(bundleType)));
+                }
+
+                builder.create(appendTestCases);
+            }
+        }
+
+        return testCases.stream().map(v -> {
+            return new Object[] {v};
+        }).toList();
+    }
+
+    private static List<String> jep223VersionSuffixes() {
+        var suffixes = new HashSet<String>();
+        for (var pre : List.of("", "-ea")) {
+            for (var build : List.of("", "+5678")) {
+                for (var opt : List.of("", "-foo", "-12.UZ3")) {
+                    if (pre.isEmpty() && build.isEmpty() && !opt.isEmpty()) {
+                        suffixes.add("+" + opt);
+                    } else {
+                        suffixes.add(pre + build + opt);
+                    }
+                }
+            }
+        }
+        return suffixes.stream().sorted().peek(suffix -> {
+            // Validate version suffixes.
+            Runtime.Version.parse("11" + suffix);
+        }).toList();
+    }
+
+    enum Message {
+        VERSION_FROM_MODULE("message.module-version", "version", "module"),
+        VERSION_FROM_RELEASE_FILE("message.release-version", "version"),
+        VERSION_NORMALIZED("message.version-normalized", "version", "version"),
+        ;
+
+        Message(String key, Object ... args) {
+            this.key = Objects.requireNonNull(key);
+            this.args = args;
+        }
+
+        CannedFormattedString cannedFormattedString(Object ... args) {
+            return JPackageStringBundle.MAIN.cannedFormattedString(key, args);
+        }
+
+        TKit.TextStreamVerifier negateFind() {
+            var pattern = JPackageStringBundle.MAIN.cannedFormattedStringAsPattern(key, _ -> {
+                return Pattern.compile(".*");
+            }, args);
+            return TKit.assertTextStream(pattern).negate();
+        }
+
+        String key() {
+            return key;
+        }
+
+        private final String key;
+        private final Object[] args;
+    }
+
+    sealed interface VersionSource {
+        String version();
+
+        VersionSource copyWithVersion(String v);
+    }
+
+    enum DefaultVersionSource implements VersionSource {
+        INSTANCE;
+
+        @Override
+        public String version() {
+            return DEFAULT_VERSION;
+        }
+
+        @Override
+        public VersionSource copyWithVersion(String v) {
+            return this;
+        }
+    }
+
+    record ModuleVersionSource(String appDesc) implements VersionSource {
+
+        ModuleVersionSource {
+            Objects.requireNonNull(appDesc);
+            if (JavaAppDesc.parse(appDesc).moduleVersion() == null) {
+                throw new IllegalArgumentException();
+            }
+        }
+
+        @Override
+        public String version() {
+            return JavaAppDesc.parse(appDesc).moduleVersion();
+        }
+
+        @Override
+        public VersionSource copyWithVersion(String v) {
+            return new ModuleVersionSource(moduleName() + "@" + Objects.requireNonNull(v));
+        }
+
+        String moduleName() {
+            return JavaAppDesc.parse(appDesc).moduleName();
+        }
+
+        @Override
+        public String toString() {
+            return appDesc;
+        }
+    }
+
+    record CmdlineVersionSource(String version) implements VersionSource {
+
+        CmdlineVersionSource {
+            Objects.requireNonNull(version);
+        }
+
+        @Override
+        public VersionSource copyWithVersion(String v) {
+            return new CmdlineVersionSource(v);
+        }
+
+        @Override
+        public String toString() {
+            return String.format("--app-version=[%s]", version);
+        }
+    }
+
+    record RuntimeReleaseFileVersionSource(String version) implements VersionSource {
+
+        RuntimeReleaseFileVersionSource {
+            Objects.requireNonNull(version);
+        }
+
+        @Override
+        public VersionSource copyWithVersion(String v) {
+            return new RuntimeReleaseFileVersionSource(v);
+        }
+
+        @Override
+        public String toString() {
+            return String.format("JAVA_VERSION=[%s]", version);
+        }
+    }
+
+    record Expected(String version, List<CannedFormattedString> messages) {
+
+        Expected {
+            Objects.requireNonNull(version);
+            Objects.requireNonNull(messages);
+        }
+
+        void applyTo(JPackageCommand cmd) {
+            Objects.requireNonNull(cmd);
+            new JPackageOutputValidator().expectMatchingStrings(messages).matchTimestamps().stripTimestamps().applyTo(cmd);
+            cmd.version(version);
+
+            var expectMessageKeys = messages.stream().map(CannedFormattedString::key).toList();
+            Stream.of(Message.values()).filter(message -> {
+                return !expectMessageKeys.contains(message.key());
+            }).map(Message::negateFind).forEach(validator -> {
+                new JPackageOutputValidator().add(validator).applyTo(cmd);
+            });
+        }
+
+        @Override
+        public String toString() {
+            var sb = new StringBuilder();
+            sb.append(version);
+            if (!messages.isEmpty()) {
+                sb.append("; ").append(messages);
+            }
+            return sb.toString();
+        }
+
+        static Builder build() {
+            return new Builder();
+        }
+
+        static final class Builder {
+
+            Expected create() {
+                return new Expected(version, List.copyOf(messages));
+            }
+
+            Builder version(String v) {
+                version = v;
+                return this;
+            }
+
+            Builder messages(List<CannedFormattedString> v) {
+                messages.addAll(v);
+                return this;
+            }
+
+            Builder messages(CannedFormattedString... v) {
+                return messages(List.of(v));
+            }
+
+            Builder message(Message message, Object ... args) {
+                return messages(message.cannedFormattedString(args));
+            }
+
+            private String version;
+            private final List<CannedFormattedString> messages = new ArrayList<>();
+        }
+    }
+
+    record TestSpec(Collection<VersionSource> versions, Map<PackageType, Expected> expected) {
+
+        TestSpec {
+            Objects.requireNonNull(versions);
+            Objects.requireNonNull(expected);
+
+            if (expected.isEmpty()) {
+                throw new IllegalArgumentException();
+            }
+
+            if (expected.keySet().contains(PackageType.IMAGE) && !Collections.disjoint(expected.keySet(), PackageType.NATIVE)) {
+                throw new IllegalArgumentException("Mixing of native and app image packaging");
+            }
+
+            if (expected.keySet().stream().map(PackageType::os).distinct().count() != 1) {
+                throw new IllegalArgumentException("All package types must be for the same OS");
+            }
+        }
+
+        <T extends VersionSource> Optional<T> findVersionSource(Class<T> versionSourceType) {
+            Objects.requireNonNull(versionSourceType);
+            return versions.stream().filter(versionSourceType::isInstance).map(versionSourceType::cast).findFirst();
+        }
+
+        void applyTo(JPackageCommand cmd) {
+            Objects.requireNonNull(cmd);
+            findVersionSource(CmdlineVersionSource.class).ifPresent(ver -> {
+                cmd.setArgumentValue("--app-version", ver.version());
+            });
+            expected.get(cmd.packageType()).applyTo(cmd);
+        }
+
+        void validateVersion(ConfigurationTarget cfg) {
+            cfg.cmd().ifPresent(cmd -> {
+                var actualVersion = AppImageFile.load(cmd.outputBundle()).version();
+                TKit.assertEquals(expected.get(cmd.packageType()).version(), actualVersion, "Check application version");
+            });
+            cfg.test().ifPresent(test -> {
+                expected.entrySet().forEach(e -> {
+                    nativeBundleVersionPropertyName(e.getKey()).ifPresent(propertyName -> {
+                        test.forTypes(e.getKey(), _ -> {
+                            test.addBundlePropertyVerifier(propertyName, e.getValue().version());
+                        });
+                    });
+                });
+            });
+
+            if (os() == OperatingSystem.MACOS) {
+                cfg.addInstallVerifier(cmd -> {
+                    final var bundleRoot = cmd.isImagePackageType() ? cmd.outputBundle()
+                            : cmd.pathToUnpackedPackageFile(cmd.appInstallationDirectory());
+                    var plist = MacHelper.readPListFromAppImage(bundleRoot);
+                    var expectedVersion = expected.get(cmd.packageType()).version();
+                    for (var prop : List.of("CFBundleVersion", "CFBundleShortVersionString")) {
+                        TKit.assertEquals(expectedVersion, plist.queryValue(prop),
+                                String.format("Check the value of '%s' property in [%s] bundle", prop, bundleRoot));
+                    }
+                });
+            }
+        }
+
+        boolean isImagePackageType() {
+            return expected.keySet().contains(PackageType.IMAGE);
+        }
+
+        Action[] packageTestActions() {
+            if (os() == OperatingSystem.MACOS) {
+                return Action.CREATE_AND_UNPACK;
+            } else {
+                return new Action[] {Action.CREATE};
+            }
+        }
+
+        OperatingSystem os() {
+            return expected.keySet().iterator().next().os();
+        }
+
+        @Override
+        public String toString() {
+            var sb = new StringBuilder();
+
+            switch (versions.size()) {
+                case 0 -> {
+                }
+                case 1 -> {
+                    sb.append(versions.iterator().next()).append("; ");
+                }
+                default -> {
+                    sb.append("versions=").append(versions).append("; ");
+                }
+            }
+
+            sb.append("expect=");
+            if (expected.values().stream().distinct().count() == 1) {
+                sb.append(expected.keySet().stream().sorted().toList()).append(":");
+                sb.append(expected.values().iterator().next());
+            } else {
+                sb.append('[').append(expected).append(']');
+            }
+
+            return sb.toString();
+        }
+
+        private static Optional<String> nativeBundleVersionPropertyName(PackageType type) {
+            switch (type) {
+                case LINUX_DEB, LINUX_RPM -> {
+                    return Optional.of("Version");
+                }
+                case WIN_MSI -> {
+                    return Optional.of("ProductVersion");
+                }
+                default -> {
+                    return Optional.empty();
+                }
+            }
+        }
+
+        static Builder build() {
+            return new Builder();
+        }
+
+        static final class Builder {
+
+            Builder() {
+            }
+
+            Builder(Builder other) {
+                currentTypes = other.currentTypes;
+                currentExpectedVersion = other.currentExpectedVersion;
+                pendingCommit = other.pendingCommit;
+                versions.addAll(other.versions);
+                expected.putAll(other.expected);
+            }
+
+            Builder copy() {
+                return new Builder(this);
+            }
+
+            void create(Consumer<TestSpec> sink) {
+                Objects.requireNonNull(sink);
+                if (pendingCommit) {
+                    copy().expect(expectedVersion()).commit().create(sink);
+                } else {
+                    var types = expected.keySet();
+                    var copiedVersions = List.copyOf(versions);
+                    if (types.contains(PackageType.IMAGE) && !Collections.disjoint(types, PackageType.NATIVE)) {
+                        sink.accept(new TestSpec(copiedVersions, Map.of(PackageType.IMAGE, expected.get(PackageType.IMAGE))));
+                        var copy = new HashMap<>(expected);
+                        copy.remove(PackageType.IMAGE);
+                        sink.accept(new TestSpec(copiedVersions, copy));
+                    } else {
+                        new TestSpec(copiedVersions, Map.copyOf(expected));
+                    }
+                }
+            }
+
+            Builder versionSource(VersionSource v) {
+                if (Objects.requireNonNull(v) == DefaultVersionSource.INSTANCE) {
+                    throw new IllegalArgumentException();
+                }
+                versions.add(v);
+                pendingCommit = true;
+                return this;
+            }
+
+            Builder versionFromCmdline(String v) {
+                return versionSource(new CmdlineVersionSource(v));
+            }
+
+            Builder versionFromAppModule(String v) {
+                return versionSource(new ModuleVersionSource(v));
+            }
+
+            Builder versionFromReleaseFile(String v) {
+                return versionSource(new RuntimeReleaseFileVersionSource(v));
+            }
+
+            Builder expect(VersionSource v) {
+                currentExpectedVersion = v;
+                pendingCommit = true;
+                return this;
+            }
+
+            Builder expectDefaultVersion() {
+                return expect(DefaultVersionSource.INSTANCE);
+            }
+
+            Builder expectVersionFromCmdline(String v) {
+                return expect(new CmdlineVersionSource(v));
+            }
+
+            Builder expectVersionFromAppModule(String appDesc) {
+                return expect(new ModuleVersionSource(appDesc));
+            }
+
+            Builder expectVersionFromReleaseFile(String v) {
+                return expect(new RuntimeReleaseFileVersionSource(v));
+            }
+
+            Builder withTypes(Set<PackageType> types) {
+                if (types.isEmpty()) {
+                    types = ALL_TYPES;
+                }
+
+                if (!currentTypes.equals(types)) {
+                    commit();
+                    currentTypes = types;
+                }
+
+                return this;
+            }
+
+            Builder withTypes(PackageType ... types) {
+                return withTypes(Set.of(types));
+            }
+
+            static Map<PackageType, VersionSource> getExpectedVersions(VersionSource versionSource) {
+                var map = new HashMap<PackageType, VersionSource>(normalizeDerivedVersion(versionSource.version()).entrySet()
+                        .stream()
+                        .collect(toUnmodifiableMap(Map.Entry::getKey, e -> {
+                            return versionSource.copyWithVersion(e.getValue());
+                         })
+                ));
+
+                ALL_TYPES.forEach(type -> {
+                    map.putIfAbsent(type, DefaultVersionSource.INSTANCE);
+                });
+
+                return map;
+            }
+
+            private VersionSource expectedVersion() {
+                return Optional.ofNullable(currentExpectedVersion).or(() -> {
+                    return versions.stream().filter(CmdlineVersionSource.class::isInstance).findFirst();
+                }).or(() -> {
+                    if (versions.size() == 1) {
+                        return Optional.of(versions.getFirst());
+                    } else {
+                        return Optional.empty();
+                    }
+                }).orElseThrow(IllegalStateException::new);
+            }
+
+            private Builder commit() {
+                pendingCommit = false;
+
+                if (versions.isEmpty() && currentExpectedVersion == null) {
+                    // Nothing to commit.
+                    return this;
+                }
+
+                var filteredTypes = normalize(currentTypes);
+                if (filteredTypes.isEmpty()) {
+                    // Version configuration is not supported on the current OS.
+                    return this;
+                }
+
+                VersionSource expectedVersion = expectedVersion();
+
+                VersionSource versionSource;
+                if (expectedVersion == DefaultVersionSource.INSTANCE) {
+                    versionSource = expectedVersion;
+                } else {
+                    versionSource = versions.stream().filter(expectedVersion.getClass()::isInstance).findFirst().orElseThrow();
+                }
+
+                var expectedBuilder = Expected.build().version(expectedVersion.version());
+                switch (versionSource) {
+                    case ModuleVersionSource ver -> {
+                        expectedBuilder.message(Message.VERSION_FROM_MODULE, ver.version(), ver.moduleName());
+                    }
+                    case RuntimeReleaseFileVersionSource ver -> {
+                        expectedBuilder.message(Message.VERSION_FROM_RELEASE_FILE, ver.version());
+                    }
+                    default -> {
+                        // NOP
+                    }
+                }
+
+                if (!versionSource.version().equals(expectedVersion.version())) {
+                    expectedBuilder.message(Message.VERSION_NORMALIZED, expectedVersion.version(), versionSource.version());
+                }
+
+                var expectedValue = expectedBuilder.create();
+                filteredTypes.forEach(type -> {
+                    expected.put(type, expectedValue);
+                });
+
+                return this;
+            }
+
+            private static Set<PackageType> normalize(Collection<PackageType> types) {
+                return types.stream().filter(type -> {
+                    return type.os() == OperatingSystem.current();
+                })
+                // Filter out "exe" packaging as it is a duplicate of "msi" packaging and
+                // the testing lib can't validate properties of embedded msi file.
+                .filter(Predicate.isEqual(PackageType.WIN_EXE).negate())
+                .map(type -> {
+                    if (type.isAppImage()) {
+                        return PackageType.IMAGE;
+                    } else {
+                        return type;
+                    }
+                }).collect(toUnmodifiableSet());
+            }
+
+            private Set<PackageType> currentTypes = ALL_TYPES;
+            private VersionSource currentExpectedVersion;
+            private boolean pendingCommit;
+            private final List<VersionSource> versions = new ArrayList<>();
+            private final Map<PackageType, Expected> expected = new HashMap<>();
+
+            private final static Set<PackageType> ALL_TYPES = Set.of(PackageType.values());
+        }
+    }
+
+    record AppTestSpec(String appDesc, TestSpec spec) {
+
+        AppTestSpec {
+            Objects.requireNonNull(appDesc);
+            Objects.requireNonNull(spec);
+        }
+
+        AppTestSpec(TestSpec spec) {
+            this(spec.findVersionSource(ModuleVersionSource.class).orElseThrow().appDesc(), spec);
+        }
+
+        static void create(String appDesc, TestSpec.Builder specBuilder, Consumer<AppTestSpec> sink) {
+            Objects.requireNonNull(appDesc);
+            Objects.requireNonNull(sink);
+            specBuilder.create(spec -> {
+                sink.accept(new AppTestSpec(appDesc, spec));
+            });
+        }
+
+        static void create(TestSpec.Builder specBuilder, Consumer<AppTestSpec> sink) {
+            Objects.requireNonNull(sink);
+            specBuilder.create(spec -> {
+                sink.accept(new AppTestSpec(spec));
+            });
+        }
+
+        <T extends VersionSource> Optional<T> findVersionSource(Class<T> versionSourceType) {
+            return spec.findVersionSource(versionSourceType);
+        }
+
+        void applyTo(JPackageCommand cmd) {
+            spec.applyTo(cmd);
+        }
+
+        void validateVersion(ConfigurationTarget cfg) {
+            spec.validateVersion(cfg);
+        }
+
+        boolean isImagePackageType() {
+            return spec.isImagePackageType();
+        }
+
+        @Override
+        public String toString() {
+            var sb = new StringBuilder();
+            if (spec.findVersionSource(ModuleVersionSource.class).map(ModuleVersionSource::appDesc).filter(appDesc::equals).isEmpty()) {
+                sb.append("app-desc=").append(appDesc()).append("; ");
+            }
+            sb.append(spec);
+            return sb.toString();
+        }
+    }
+
+    /**
+     * Type of the predefined runtime.
+     */
+    enum RuntimeType {
+        /**
+         * A directory with the standard Java runtime structure.
+         */
+        IMAGE,
+        /**
+         * macOS bundle with valid Info.plist file.
+         */
+        MAC_BUNDLE,
+        /**
+         * macOS bundle with malformed Info.plist file.
+         */
+        MAC_BUNDLE_PLIST_FILE_MALFORMED,
+        /**
+         * macOS bundle with Info.plist file without version.
+         */
+        MAC_BUNDLE_PLIST_WITHOUT_VERSION,
+        ;
+    }
+
+    record RuntimeTestSpec(RuntimeType type, TestSpec spec) {
+
+        RuntimeTestSpec {
+            Objects.requireNonNull(type);
+            Objects.requireNonNull(spec);
+            if (spec.isImagePackageType()) {
+                throw new IllegalArgumentException();
+            }
+            if (type == RuntimeType.MAC_BUNDLE && spec.os() != OperatingSystem.MACOS) {
+                throw new IllegalArgumentException("Bundle runtime is supported for macOS native packaging only");
+            }
+        }
+
+        static void create(TestSpec.Builder specBuilder, Consumer<RuntimeTestSpec> sink) {
+            Objects.requireNonNull(sink);
+            specBuilder.create(skipImagePackageType(spec -> {
+                if (spec.os() != OperatingSystem.MACOS) {
+                    sink.accept(new RuntimeTestSpec(RuntimeType.IMAGE, spec));
+                } else {
+                    sink.accept(new RuntimeTestSpec(RuntimeType.IMAGE, spec));
+
+                    if (spec.findVersionSource(CmdlineVersionSource.class).isPresent()) {
+                        // Disable "AppVersionTest.testRuntime(mac_bundle; versions=[--app-version=[3.1], plist=[1.22.333]]; expect=[MAC_DMG, MAC_PKG]:3.1)" test for now
+                        // as it will fail because jpackage halfway ignores the "--app-version"
+                        // and any option in general that makes its way into the Info.plist file.
+                        // When building a runtime from the predefined runtime bundle,
+                        // jpackage copies the Info.plist file from the predefined runtime bundle into the output bundle verbatim.
+                        return;
+                    }
+
+                    var plistVersionSource = new InheritPListVersionSource(MAC_PREDEFINED_RUNTIME_BUNDLE_VERSION);
+                    var specBuilderCopy = specBuilder.copy().versionSource(plistVersionSource).withTypes(PackageType.ALL_MAC);
+                    if (spec.findVersionSource(CmdlineVersionSource.class).isEmpty()) {
+                        specBuilderCopy.expect(plistVersionSource);
+                    }
+                    specBuilderCopy.create(skipImagePackageType(augmentedSpec -> {
+                        sink.accept(new RuntimeTestSpec(RuntimeType.MAC_BUNDLE, augmentedSpec));
+                    }));
+                }
+            }));
+        }
+
+        <T extends VersionSource> Optional<T> findVersionSource(Class<T> versionSourceType) {
+            return spec.findVersionSource(versionSourceType);
+        }
+
+        void applyTo(JPackageCommand cmd) {
+            switch (type) {
+                case MAC_BUNDLE_PLIST_FILE_MALFORMED, MAC_BUNDLE_PLIST_WITHOUT_VERSION -> {
+                    // Don't validate signature of the output bundle. If the Info.plist file is malformed, it will fail with the error:
+                    //
+                    // [22:59:25.374] TRACE: Command [/usr/bin/codesign --verify --deep --strict --verbose=2 RuntimeAppVersionTest.jdk](6) exited with exit code 3 and the following output:
+                    // [22:59:25.375] TRACE: 2026-03-05 22:59:25.353 codesign[11351:61024] There was an error parsing the Info.plist for the bundle at URL <0x7f81e140ae70>: NSCocoaErrorDomain - 3840
+                    // [22:59:25.376] TRACE: 2026-03-05 22:59:25.370 codesign[11351:61024] There was an error parsing the Info.plist for the bundle at URL <0x7f81e1413b90>: NSCocoaErrorDomain - 3840
+                    // [22:59:25.376] TRACE: --prepared:RuntimeAppVersionTest.jdk/Contents/MacOS/libjli.dylib
+                    // [22:59:25.377] TRACE: --validated:RuntimeAppVersionTest.jdk/Contents/MacOS/libjli.dylib
+                    //
+                    cmd.excludeStandardAsserts(StandardAssert.MAC_BUNDLE_UNSIGNED_SIGNATURE);
+                    // This one will also fail.
+                    cmd.excludeStandardAsserts(StandardAssert.MAC_RUNTIME_PLIST_JDK_KEY);
+                }
+                default -> {
+                    // NOP
+                }
+            }
+            spec.applyTo(cmd);
+        }
+
+        void validateVersion(ConfigurationTarget cfg) {
+            switch (type) {
+                case MAC_BUNDLE_PLIST_FILE_MALFORMED, MAC_BUNDLE_PLIST_WITHOUT_VERSION -> {
+                    cfg.addInstallVerifier(cmd -> {
+                        final var bundleRoot = cmd.isImagePackageType() ? cmd.outputBundle()
+                                : cmd.pathToUnpackedPackageFile(cmd.appInstallationDirectory());
+                        final var infoPlist = new MacBundle(bundleRoot).infoPlistFile();
+                        TKit.assertFileExists(infoPlist);
+                        TKit.trace(String.format("Bundle version property in [%s] file is unavailable. Skip validation", infoPlist));
+                    });
+                }
+                default -> {
+                    spec.validateVersion(cfg);
+                }
+            }
+        }
+
+        Path createRuntime() throws IOException {
+            return createRuntime(type, findVersionSource(RuntimeReleaseFileVersionSource.class).map(VersionSource::version));
+        }
+
+        @Override
+        public String toString() {
+            return new StringBuilder().append(type.name().toLowerCase()).append("; ").append(spec).toString();
+        }
+
+        private record InheritPListVersionSource(String version) implements VersionSource {
+
+            InheritPListVersionSource {
+                Objects.requireNonNull(version);
+            }
+
+            @Override
+            public VersionSource copyWithVersion(String v) {
+                return new InheritPListVersionSource(v);
+            }
+
+            @Override
+            public String toString() {
+                return String.format("plist=[%s]", version);
+            }
+        }
+
+        private Path createRuntime(RuntimeType type, Optional<String> releaseFileVersion) throws IOException {
+            Objects.requireNonNull(type);
+            Objects.requireNonNull(releaseFileVersion);
+
+            Path predefinedRuntimeDir;
+            Path runtimeDir = switch (type) {
+                case IMAGE -> {
+                    predefinedRuntimeDir = JPackageCommand.createInputRuntimeImage(RUNTIME_TYPE_FAKE);
+                    yield predefinedRuntimeDir;
+                }
+                case MAC_BUNDLE -> {
+                    releaseFileVersion.ifPresent(ver -> {
+                        if (ver.equals(MAC_PREDEFINED_RUNTIME_BUNDLE_VERSION)) {
+                            // The value of `JAVA_VERSION` property in the "release" file of the runtime
+                            // and the value of the `CFBundleVersion` property in the plist file should be different
+                            // to test corner cases of version picking logic.
+                            throw new IllegalArgumentException();
+                        }
+                    });
+
+                    // Create macOS bundle with `MAC_PREDEFINED_RUNTIME_BUNDLE_VERSION` version.
+                    // The idea is to have different values of `JAVA_VERSION` property in the "release" file
+                    // of the runtime and the value of the `CFBundleVersion` property in the plist file.
+                    predefinedRuntimeDir = MacHelper.buildRuntimeBundle().type(RUNTIME_TYPE_FAKE).mutator(cmd -> {
+                        cmd.setArgumentValue("--app-version", MAC_PREDEFINED_RUNTIME_BUNDLE_VERSION);
+                    }).create();
+                    yield MacBundle.fromPath(predefinedRuntimeDir).orElseThrow().homeDir();
+                }
+                case MAC_BUNDLE_PLIST_FILE_MALFORMED, MAC_BUNDLE_PLIST_WITHOUT_VERSION -> {
+                    predefinedRuntimeDir = MacHelper.buildRuntimeBundle().type(RUNTIME_TYPE_FAKE).create();
+                    var plistFile = new MacBundle(predefinedRuntimeDir).infoPlistFile();
+
+                    switch (type) {
+                        case MAC_BUNDLE_PLIST_FILE_MALFORMED -> {
+                            TKit.trace(String.format("Create invalid plist file [%s]", plistFile));
+                        }
+                        case MAC_BUNDLE_PLIST_WITHOUT_VERSION -> {
+                            TKit.trace(String.format("Create empty plist file [%s]", plistFile));
+                        }
+                        default -> {
+                            throw new AssertionError();
+                        }
+                    }
+
+                    createXml(plistFile, xml -> {
+                        writePList(xml, toXmlConsumer(() -> {
+                            if (type == RuntimeType.MAC_BUNDLE_PLIST_WITHOUT_VERSION) {
+                                writeDict(xml, toXmlConsumer(() -> {
+                                }));
+                            }
+                        }));
+                    });
+                    yield MacBundle.fromPath(predefinedRuntimeDir).orElseThrow().homeDir();
+                }
+                default -> {
+                    throw new AssertionError();
+                }
+            };
+
+            releaseFileVersion.ifPresent(ver -> {
+                TKit.createPropertiesFile(
+                        RuntimeReleaseFile.releaseFilePathInRuntime(runtimeDir),
+                        Map.of("JAVA_VERSION", "\"" + ver + "\""));
+            });
+
+            return predefinedRuntimeDir;
+        }
+
+        final static String MAC_PREDEFINED_RUNTIME_BUNDLE_VERSION = "1.22.333";
+    }
+
+    private static Consumer<TestSpec> skipImagePackageType(Consumer<TestSpec> consumer) {
+        Objects.requireNonNull(consumer);
+        return spec -> {
+            if (!spec.isImagePackageType()) {
+                consumer.accept(spec);
+            }
+        };
+    }
 }
diff --git a/test/jdk/tools/jpackage/share/RuntimePackageTest.java b/test/jdk/tools/jpackage/share/RuntimePackageTest.java
index a18efce62c6..87fd3496ba5 100644
--- a/test/jdk/tools/jpackage/share/RuntimePackageTest.java
+++ b/test/jdk/tools/jpackage/share/RuntimePackageTest.java
@@ -23,6 +23,7 @@
 
 import static jdk.internal.util.OperatingSystem.LINUX;
 import static jdk.internal.util.OperatingSystem.MACOS;
+import static jdk.jpackage.test.JPackageCommand.DEFAULT_VERSION;
 import static jdk.jpackage.test.TKit.assertFalse;
 import static jdk.jpackage.test.TKit.assertTrue;
 
@@ -81,7 +82,16 @@ public class RuntimePackageTest {
 
     @Test
     public static void test() {
-        init().run();
+        init()
+        .addInitializer(cmd -> {
+            // JDK-8357404 enables jpackage to pick a version from the "release" file
+            // of the predefined runtime when bundling the runtime package.
+            // This makes the output of this test dependent on the version of the running JDK
+            // and will be an inconvenience for SQE testing.
+            // Explicitly specify the package version to fulfill expectations of SQE.
+            cmd.setArgumentValue("--app-version", DEFAULT_VERSION);
+        })
+        .run();
     }
 
     @Test(ifOS = MACOS)

From 30e569d206dbb87349927682f194f5ba1294e44d Mon Sep 17 00:00:00 2001
From: William Kemper <wkemper@openjdk.org>
Date: Wed, 11 Mar 2026 16:47:34 +0000
Subject: [PATCH 156/655] 8379021: Shenandoah: Speedup
 ShenandoahSimpleBitMapTest

Reviewed-by: shade
---
 .../gtest/gc/shenandoah/test_shenandoahMarkBitMap.cpp       | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/test/hotspot/gtest/gc/shenandoah/test_shenandoahMarkBitMap.cpp b/test/hotspot/gtest/gc/shenandoah/test_shenandoahMarkBitMap.cpp
index 3dbb7c62122..18cf3b3333f 100644
--- a/test/hotspot/gtest/gc/shenandoah/test_shenandoahMarkBitMap.cpp
+++ b/test/hotspot/gtest/gc/shenandoah/test_shenandoahMarkBitMap.cpp
@@ -165,8 +165,8 @@ public:
 
   static bool run_test() {
     ShenandoahHeap* heap = ShenandoahHeap::heap();
-    size_t heap_size = heap->max_capacity();
-    size_t heap_size_words = heap_size / HeapWordSize;
+    size_t test_heap_size = MIN2(32 * M, heap->max_capacity());
+    size_t heap_size_words = test_heap_size / HeapWordSize;
     HeapWord* my_heap_memory = heap->base();
     HeapWord* end_of_my_heap = my_heap_memory + heap_size_words;
     MemRegion heap_descriptor(my_heap_memory, heap_size_words);
@@ -175,7 +175,7 @@ public:
     _assertion_failures = 0;
 
     size_t bitmap_page_size = UseLargePages ? os::large_page_size() : os::vm_page_size();
-    size_t bitmap_size_orig = ShenandoahMarkBitMap::compute_size(heap_size);
+    size_t bitmap_size_orig = ShenandoahMarkBitMap::compute_size(test_heap_size);
     size_t bitmap_size = align_up(bitmap_size_orig, bitmap_page_size);
     size_t bitmap_word_size = (bitmap_size + HeapWordSize - 1) / HeapWordSize;
 

From 814b7f5d2a76288b6a8d6510a10c0241fdb727d0 Mon Sep 17 00:00:00 2001
From: Phil Race <prr@openjdk.org>
Date: Wed, 11 Mar 2026 17:54:32 +0000
Subject: [PATCH 157/655] 8378920: Remove AppContext from SequencedEvent

Reviewed-by: psadhukhan, tr
---
 .../classes/java/awt/SequencedEvent.java      |  43 +----
 .../MultipleContextsFunctionalTest.java       | 175 ------------------
 .../MultipleContextsUnitTest.java             | 167 -----------------
 3 files changed, 6 insertions(+), 379 deletions(-)
 delete mode 100644 test/jdk/java/awt/event/SequencedEvent/MultipleContextsFunctionalTest.java
 delete mode 100644 test/jdk/java/awt/event/SequencedEvent/MultipleContextsUnitTest.java

diff --git a/src/java.desktop/share/classes/java/awt/SequencedEvent.java b/src/java.desktop/share/classes/java/awt/SequencedEvent.java
index 13ec5317822..25fe72e1787 100644
--- a/src/java.desktop/share/classes/java/awt/SequencedEvent.java
+++ b/src/java.desktop/share/classes/java/awt/SequencedEvent.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2000, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2000, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -29,12 +29,11 @@ import java.io.Serial;
 import java.util.LinkedList;
 
 import sun.awt.AWTAccessor;
-import sun.awt.AppContext;
 import sun.awt.SunToolkit;
 
 /**
  * A mechanism for ensuring that a series of AWTEvents are executed in a
- * precise order, even across multiple AppContexts. The nested events will be
+ * precise order. The nested events will be
  * dispatched in the order in which their wrapping SequencedEvents were
  * constructed. The only exception to this rule is if the peer of the target of
  * the nested event was destroyed (with a call to Component.removeNotify)
@@ -57,7 +56,6 @@ class SequencedEvent extends AWTEvent implements ActiveEvent {
 
     private final AWTEvent nested;
     @SuppressWarnings("serial") // Not statically typed as Serializable
-    private AppContext appContext;
     private boolean disposed;
     private final LinkedList<AWTEvent> pendingEvents = new LinkedList<>();
 
@@ -145,7 +143,6 @@ class SequencedEvent extends AWTEvent implements ActiveEvent {
      * dispatched or disposed. If this method is invoked before all previous nested events
      * have been dispatched, then this method blocks until such a point is
      * reached.
-     * While waiting disposes nested events to disposed AppContext
      *
      * NOTE: Locking protocol.  Since dispose() can get EventQueue lock,
      * dispatch() shall never call dispose() while holding the lock on the list,
@@ -154,8 +151,6 @@ class SequencedEvent extends AWTEvent implements ActiveEvent {
      */
     public final void dispatch() {
         try {
-            appContext = AppContext.getAppContext();
-
             if (getFirst() != this) {
                 if (EventQueue.isDispatchThread()) {
                     if (Thread.currentThread() instanceof EventDispatchThread) {
@@ -201,19 +196,6 @@ class SequencedEvent extends AWTEvent implements ActiveEvent {
         }
     }
 
-    /**
-     * true only if event exists and nested source appContext is disposed.
-     */
-    private static final boolean isOwnerAppContextDisposed(SequencedEvent se) {
-        if (se != null) {
-            Object target = se.nested.getSource();
-            if (target instanceof Component) {
-                return ((Component)target).appContext.isDisposed();
-            }
-        }
-        return false;
-    }
-
     /**
      * Sequenced events are dispatched in order, so we cannot dispatch
      * until we are the first sequenced event in the queue (i.e. it's our
@@ -224,26 +206,13 @@ class SequencedEvent extends AWTEvent implements ActiveEvent {
         if (disposed) {
             return true;
         }
-        // getFirstWithContext can dispose this
-        return this == getFirstWithContext() || disposed;
+        return this == getFirst();
     }
 
     private static final synchronized SequencedEvent getFirst() {
         return list.getFirst();
     }
 
-    /* Disposes all events from disposed AppContext
-     * return first valid event
-     */
-    private static final SequencedEvent getFirstWithContext() {
-        SequencedEvent first = getFirst();
-        while(isOwnerAppContextDisposed(first)) {
-            first.dispose();
-            first = getFirst();
-        }
-        return first;
-    }
-
     /**
      * Disposes of this instance. This method is invoked once the nested event
      * has been dispatched and handled, or when the peer of the target of the
@@ -283,12 +252,12 @@ class SequencedEvent extends AWTEvent implements ActiveEvent {
           }
       }
         // Wake up waiting threads
-        if (next != null && next.appContext != null) {
-            SunToolkit.postEvent(next.appContext, new SentEvent());
+        if (next != null) {
+            SunToolkit.postEvent(new SentEvent());
         }
 
         for(AWTEvent e : pendingEvents) {
-            SunToolkit.postEvent(appContext, e);
+            SunToolkit.postEvent(e);
         }
     }
 }
diff --git a/test/jdk/java/awt/event/SequencedEvent/MultipleContextsFunctionalTest.java b/test/jdk/java/awt/event/SequencedEvent/MultipleContextsFunctionalTest.java
deleted file mode 100644
index 9af56ba044b..00000000000
--- a/test/jdk/java/awt/event/SequencedEvent/MultipleContextsFunctionalTest.java
+++ /dev/null
@@ -1,175 +0,0 @@
-/*
- * Copyright (c) 2018, 2022, Oracle and/or its affiliates. All rights reserved.
- * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
- *
- * This code is free software; you can redistribute it and/or modify it
- * under the terms of the GNU General Public License version 2 only, as
- * published by the Free Software Foundation.
- *
- * This code is distributed in the hope that it will be useful, but WITHOUT
- * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
- * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
- * version 2 for more details (a copy is included in the LICENSE file that
- * accompanied this code).
- *
- * You should have received a copy of the GNU General Public License version
- * 2 along with this work; if not, write to the Free Software Foundation,
- * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
- *
- * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
- * or visit www.oracle.com if you need additional information or have any
- * questions.
- */
-
-/**
- * @test
- * @bug 8204142
- * @key headful
- * @summary Deadlock when queueing SequencedEvent of different AppContexts
- * @author Laurent Bourges
- * @modules java.desktop/sun.awt
- * @run main/othervm/timeout=30 MultipleContextsFunctionalTest
- */
-
-import java.awt.BorderLayout;
-import java.awt.Dimension;
-import java.awt.event.ActionEvent;
-import java.awt.event.ActionListener;
-import java.util.List;
-import java.util.concurrent.CopyOnWriteArrayList;
-import java.util.concurrent.atomic.AtomicReference;
-import javax.swing.JButton;
-import javax.swing.JFrame;
-import javax.swing.JLabel;
-import javax.swing.SwingUtilities;
-import javax.swing.Timer;
-
-public final class MultipleContextsFunctionalTest {
-
-    private static final long serialVersionUID = 1L;
-
-    private static final int NUM_WINDOW = 2;
-    private static final int INTERVAL = 50;
-    private static final int MAX_TIME = 10000; // 10s
-    private static final int TOLERANCE = 10000;// 10s
-    private static final int CHECK_LAPSE = 100;
-    private static final int MAX_COUNT = MAX_TIME / INTERVAL;
-    private static final int EXPECTED = MAX_COUNT * NUM_WINDOW;
-    private static final List<TestWindow> WINDOWS = new CopyOnWriteArrayList<>();
-
-    public static void main(String[] args) {
-        for (int i = 0; i < NUM_WINDOW; i++) {
-            createWin(i);
-        }
-
-        int total = 0;
-        int waitingTime = MAX_TIME + TOLERANCE;
-        while (waitingTime > 0 && total != EXPECTED) {
-            try {
-                Thread.sleep(CHECK_LAPSE);
-            } catch (InterruptedException e) {
-                e.printStackTrace();
-            }
-            waitingTime -= CHECK_LAPSE;
-
-            total = 0;
-            for (TestWindow window : WINDOWS) {
-                total += window.getCounter();
-            }
-        }
-
-        // Failure if AWT hanging: assert
-        System.out.println("Total [" + total + "] - Expected [" + EXPECTED + "]");
-        if (total == EXPECTED) {
-            System.out.println("Test PASSED");
-            return;
-        }
-        System.out.println("Test FAILED");
-        Runtime.getRuntime().halt(-1);
-    }
-
-    private static void createWin(int tgNum) {
-        new Thread(new ThreadGroup("TG " + tgNum),
-                new Runnable() {
-            @Override
-            public void run() {
-                sun.awt.SunToolkit.createNewAppContext();
-
-                final AtomicReference<TestWindow> ref =
-                        new AtomicReference<TestWindow>();
-
-                SwingUtilities.invokeLater(new Runnable() {
-                    @Override
-                    public void run() {
-                        final TestWindow window = new TestWindow(tgNum);
-                        window.setVisible(true);
-                        ref.set(window);
-                        WINDOWS.add(window);
-                    }
-                });
-
-                // Wait for window to show
-                TestWindow window = ref.get();
-                while (window == null) {
-                    try {
-                        Thread.sleep(100);
-                    } catch (InterruptedException ie) {
-                        ie.printStackTrace();
-                    }
-                    window = ref.get();
-                }
-                window.enableTimer(true);
-            }
-        }).start();
-    }
-
-    private static final class TestWindow extends JFrame implements ActionListener {
-
-        private final JButton btn;
-        private volatile int counter = 0;
-        private final Timer t;
-
-        TestWindow(final int num) {
-            super("Test Window [" + num + "]");
-            setMinimumSize(new Dimension(300, 200));
-            setLocation(100 + 400 * (num - 1), 100);
-
-            setLayout(new BorderLayout());
-            JLabel textBlock = new JLabel("Lorem ipsum dolor sit amet...");
-            add(textBlock);
-
-            btn = new JButton("TEST");
-            add(btn, BorderLayout.SOUTH);
-
-            setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE);
-            pack();
-
-            t = new Timer(INTERVAL, this);
-            t.setRepeats(false);
-        }
-
-        @Override
-        public void actionPerformed(ActionEvent e) {
-            this.toFront();
-            btn.setText("TEST " + (++counter));
-            this.toBack();
-            if (counter < MAX_COUNT) {
-                enableTimer(true);
-            } else {
-                dispose();
-            }
-        }
-
-        void enableTimer(boolean enable) {
-            if (enable) {
-                t.start();
-            } else {
-                t.stop();
-            }
-        }
-
-        int getCounter() {
-            return counter;
-        }
-    }
-}
diff --git a/test/jdk/java/awt/event/SequencedEvent/MultipleContextsUnitTest.java b/test/jdk/java/awt/event/SequencedEvent/MultipleContextsUnitTest.java
deleted file mode 100644
index 8c7062f4abf..00000000000
--- a/test/jdk/java/awt/event/SequencedEvent/MultipleContextsUnitTest.java
+++ /dev/null
@@ -1,167 +0,0 @@
-/*
- * Copyright (c) 2018, 2020, Oracle and/or its affiliates. All rights reserved.
- * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
- *
- * This code is free software; you can redistribute it and/or modify it
- * under the terms of the GNU General Public License version 2 only, as
- * published by the Free Software Foundation.
- *
- * This code is distributed in the hope that it will be useful, but WITHOUT
- * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
- * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
- * version 2 for more details (a copy is included in the LICENSE file that
- * accompanied this code).
- *
- * You should have received a copy of the GNU General Public License version
- * 2 along with this work; if not, write to the Free Software Foundation,
- * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
- *
- * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
- * or visit www.oracle.com if you need additional information or have any
- * questions.
- */
-
-import java.awt.AWTEvent;
-import java.awt.event.InvocationEvent;
-import java.lang.reflect.Constructor;
-import java.util.concurrent.CountDownLatch;
-import java.util.concurrent.atomic.AtomicReference;
-
-import sun.awt.AppContext;
-import sun.awt.SunToolkit;
-
-/**
- * @test
- * @bug 8204142
- * @author Sergey Bylokhov
- * @key headful
- * @modules java.desktop/java.awt:open java.desktop/sun.awt
- * @run main/othervm/timeout=30 MultipleContextsUnitTest
- */
-public final class MultipleContextsUnitTest {
-
-    private static final int COUNT = 20;
-    private static final AppContext[] apps = new AppContext[COUNT];
-    private static final CountDownLatch go = new CountDownLatch(1);
-    private static final CountDownLatch end = new CountDownLatch(COUNT);
-
-    private static volatile int createSENumber = 0;
-    private static volatile int dispatchSENumber = 0;
-
-    public static void main(final String[] args) throws Exception {
-        for (int i = 0; i < COUNT; i++) {
-            Thread t = testThread(i);
-            t.start();
-            t.join();
-        }
-
-        for (AppContext app : apps) {
-            SunToolkit.postEvent(app, new InvocationEvent(new Object(), () -> {
-                try {
-                    go.await();
-                } catch (InterruptedException e) {
-                    throw new RuntimeException(e);
-                }
-            }));
-        }
-
-        // eventOne - created first, but posted last
-        AWTEvent eventOne = getSequencedEvent();
-        {
-            // eventTwo and eventThree - posted in the reverse order
-            AppContext app = apps[1];
-            AWTEvent eventTwo = getSequencedEvent();
-            AWTEvent eventThree = getSequencedEvent();
-            SunToolkit.postEvent(app, eventThree);
-            SunToolkit.postEvent(app, eventTwo);
-            SunToolkit.postEvent(app, new InvocationEvent(new Object(), () -> {
-                System.err.println(AppContext.getAppContext());
-                end.countDown();
-            }));
-        }
-
-        for (int i = 2; i < apps.length; i++) {
-            // eventTwo and eventThree - posted in the correct order
-            AppContext app = apps[i];
-
-            AWTEvent eventTwo = getSequencedEvent();
-            SunToolkit.postEvent(app, eventTwo);
-
-            AtomicReference<Boolean> called1 = new AtomicReference(false);
-            AtomicReference<Boolean> called2 = new AtomicReference(false);
-            int num1 = createSENumber;
-            SunToolkit.postEvent(app, new InvocationEvent(new Object(), () -> {
-                if (dispatchSENumber < num1) {
-                    throw new RuntimeException("Dispatched too early");
-                }
-                called1.set(true);
-                if (called2.get()) {
-                    throw new RuntimeException("Second event is called before first");
-                }
-            }));
-            AWTEvent eventThree = getSequencedEvent();
-            SunToolkit.postEvent(app, eventThree);
-            int num2 = createSENumber;
-            SunToolkit.postEvent(app, new InvocationEvent(new Object(), () -> {
-                if (dispatchSENumber < num2) {
-                    throw new RuntimeException("Dispatched too early");
-                }
-                called2.set(true);
-                if (!called1.get()) {
-                    throw new RuntimeException("First event is not called before second");
-                }
-                System.err.println(AppContext.getAppContext());
-                end.countDown();
-            }));
-        }
-
-
-
-        // eventOne should flush all EDT
-        SunToolkit.postEvent(apps[0], eventOne);
-        SunToolkit.postEvent(apps[0], new InvocationEvent(new Object(), () -> {
-            System.err.println(AppContext.getAppContext());
-            end.countDown();
-        }));
-
-        go.countDown();
-
-        System.err.println("Start to wait");
-        end.await();
-        System.err.println("End to wait");
-    }
-
-    private static Thread testThread(int index) {
-        final ThreadGroup group = new ThreadGroup("TG " + index);
-        return new Thread(group, () -> {
-            apps[index] = SunToolkit.createNewAppContext();
-        });
-    }
-
-    private static AWTEvent getSequencedEvent()
-    {
-        int num = createSENumber++;
-
-        InvocationEvent wrapMe = new InvocationEvent(new Object(), () -> {
-            if (num != dispatchSENumber++) {
-                System.err.println("num: " + num);
-                System.err.println("dispatchSENumber: " + dispatchSENumber);
-                throw new RuntimeException("Wrong order");
-            }
-        });
-
-        try {
-            /*
-             * SequencedEvent is a package private class, which cannot be instantiated
-             * by importing. So use reflection to create an instance.
-             */
-            Class<? extends AWTEvent> seqClass = (Class<? extends AWTEvent>) Class.forName("java.awt.SequencedEvent");
-            Constructor<? extends AWTEvent>
-                    seqConst = seqClass.getConstructor(AWTEvent.class);
-            seqConst.setAccessible(true);
-            return seqConst.newInstance(wrapMe);
-        } catch (Throwable err) {
-            throw new RuntimeException("Unable to instantiate SequencedEvent",err);
-        }
-    }
-}

From 39a25663e3c4b4fcc22b9aaa3bb89bf6ef6a01c2 Mon Sep 17 00:00:00 2001
From: Jan Lahoda <jlahoda@openjdk.org>
Date: Thu, 12 Mar 2026 06:19:05 +0000
Subject: [PATCH 158/655] 8378740: Suppressed warnings reported when implicit
 compilation is combined with annotation processing

Reviewed-by: liach, vromero, dbeaumont
---
 .../sun/tools/javac/main/JavaCompiler.java    |   4 +-
 .../APImplicitClassesWarnings.java            | 163 ++++++++++++++++++
 2 files changed, 165 insertions(+), 2 deletions(-)
 create mode 100644 test/langtools/tools/javac/implicitCompile/APImplicitClassesWarnings.java

diff --git a/src/jdk.compiler/share/classes/com/sun/tools/javac/main/JavaCompiler.java b/src/jdk.compiler/share/classes/com/sun/tools/javac/main/JavaCompiler.java
index 94292d9a348..269d2f5de62 100644
--- a/src/jdk.compiler/share/classes/com/sun/tools/javac/main/JavaCompiler.java
+++ b/src/jdk.compiler/share/classes/com/sun/tools/javac/main/JavaCompiler.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1999, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1999, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -823,9 +823,9 @@ public class JavaCompiler {
                 c, () -> diagFactory.fragment(Fragments.UserSelectedCompletionFailure), dcfh);
         }
         JavaFileObject filename = c.classfile;
-        JavaFileObject prev = log.useSource(filename);
 
         if (tree == null) {
+            JavaFileObject prev = log.useSource(filename);
             try {
                 tree = parse(filename, filename.getCharContent(false));
             } catch (IOException e) {
diff --git a/test/langtools/tools/javac/implicitCompile/APImplicitClassesWarnings.java b/test/langtools/tools/javac/implicitCompile/APImplicitClassesWarnings.java
new file mode 100644
index 00000000000..dc60c6cc78a
--- /dev/null
+++ b/test/langtools/tools/javac/implicitCompile/APImplicitClassesWarnings.java
@@ -0,0 +1,163 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+/*
+ * @test
+ * @bug 8378740
+ * @summary Verify warnings are properly suppressed for the combination of
+ *          annotation processing and implicit compilation
+ * @library /tools/lib
+ * @modules
+ *      jdk.compiler/com.sun.tools.javac.api
+ *      jdk.compiler/com.sun.tools.javac.main
+ * @build toolbox.ToolBox toolbox.JavacTask
+ * @run junit APImplicitClassesWarnings
+ */
+
+
+import java.nio.file.Files;
+import java.nio.file.Path;
+import java.nio.file.Paths;
+import java.util.List;
+import java.util.Set;
+import javax.annotation.processing.AbstractProcessor;
+import javax.annotation.processing.RoundEnvironment;
+import javax.annotation.processing.SupportedAnnotationTypes;
+import javax.lang.model.SourceVersion;
+import javax.lang.model.element.TypeElement;
+import org.junit.jupiter.api.BeforeEach;
+import org.junit.jupiter.api.Test;
+import org.junit.jupiter.api.TestInfo;
+import toolbox.JavacTask;
+import toolbox.Task;
+import toolbox.ToolBox;
+
+public class APImplicitClassesWarnings {
+
+    final ToolBox tb = new ToolBox();
+    Path base;
+
+    @Test
+    public void testCorrectSource() throws Exception {
+        Path src = base.resolve("src");
+        Path classes = base.resolve("classes");
+        tb.writeJavaFiles(src,
+                          """
+                          package test;
+
+                          @Deprecated(forRemoval=true)
+                          public class Depr {
+                          }
+                          """,
+                          """
+                          package test;
+                          public class Use {
+                              Implicit implicit;
+                              Depr depr;
+                          }
+                          """,
+                          """
+                          package test;
+                          public interface Implicit {}
+                          """);
+        Files.createDirectories(classes);
+
+        List<String> log = new JavacTask(tb)
+            .options("-d", classes.toString(),
+                     "-XDrawDiagnostics",
+                     "-implicit:class",
+                     "-sourcepath", src.toString())
+            .files(src.resolve("test").resolve("Depr.java"),
+                    src.resolve("test").resolve("Use.java"))
+            .processors(new ProcessorImpl())
+            .run()
+            .writeAll()
+            .getOutputLines(Task.OutputKind.DIRECT);
+
+        List<String> expected = List.of(
+            "Use.java:4:5: compiler.warn.has.been.deprecated.for.removal: test.Depr, test",
+            "Use.java:4:5: compiler.warn.has.been.deprecated.for.removal: test.Depr, test",
+            "Use.java:4:5: compiler.warn.has.been.deprecated.for.removal: test.Depr, test",
+            "3 warnings"
+        );
+
+        tb.checkEqual(expected, log);
+    }
+
+    @Test
+    public void testCorrectSuppress() throws Exception {
+        Path src = base.resolve("src");
+        Path classes = base.resolve("classes");
+        tb.writeJavaFiles(src,
+                          //note the added @SuppressWarnings("removal"):
+                          """
+                          package test;
+
+                          @Deprecated(forRemoval=true)
+                          public class Depr {
+                          }
+                          """,
+                          """
+                          package test;
+                          public class Use {
+                              Implicit implicit;
+                              @SuppressWarnings("removal")
+                              Depr depr;
+                          }
+                          """,
+                          """
+                          package test;
+                          public interface Implicit {}
+                          """);
+        Files.createDirectories(classes);
+
+        new JavacTask(tb)
+                .options("-d", classes.toString(),
+                         "-Werror",
+                         "-implicit:class",
+                         "-sourcepath", src.toString())
+                .files(src.resolve("test").resolve("Depr.java"),
+                       src.resolve("test").resolve("Use.java"))
+                .processors(new ProcessorImpl())
+                .run()
+                .writeAll();
+    }
+
+    @SupportedAnnotationTypes("*")
+    private static class ProcessorImpl extends AbstractProcessor {
+        @Override
+        public boolean process(Set<? extends TypeElement> annotations, RoundEnvironment roundEnv) {
+            return false;
+        }
+        @Override
+        public SourceVersion getSupportedSourceVersion() {
+            return SourceVersion.latest();
+        }
+    }
+
+    @BeforeEach
+    public void setUp(TestInfo info) {
+        base = Paths.get(".")
+                    .resolve(info.getTestMethod().orElseThrow().getName());
+    }
+}

From 26bb357fa2ffa5a919b4be4fdf732fd7b97b767e Mon Sep 17 00:00:00 2001
From: Jan Lahoda <jlahoda@openjdk.org>
Date: Thu, 12 Mar 2026 07:32:43 +0000
Subject: [PATCH 159/655] 8305250: Unnecessary "unknown enum constant" warning
 emitted by javac when dependency has optional annotations with enums

Reviewed-by: vromero
---
 .../com/sun/tools/javac/jvm/ClassReader.java  |  55 +++--
 .../tools/javac/resources/compiler.properties |   2 +
 .../tools/javac/annotations/6365854/test1.out |   2 -
 .../CrashOnUnknownTargetTypeTest.java         |   2 +-
 .../CrashOnUnknownTargetTypeTest.out          |   4 +-
 .../tools/javac/classreader/Annotations.java  | 220 ++++++++++++++++++
 6 files changed, 262 insertions(+), 23 deletions(-)
 create mode 100644 test/langtools/tools/javac/classreader/Annotations.java

diff --git a/src/jdk.compiler/share/classes/com/sun/tools/javac/jvm/ClassReader.java b/src/jdk.compiler/share/classes/com/sun/tools/javac/jvm/ClassReader.java
index b7bf48b4a12..017d740dc0a 100644
--- a/src/jdk.compiler/share/classes/com/sun/tools/javac/jvm/ClassReader.java
+++ b/src/jdk.compiler/share/classes/com/sun/tools/javac/jvm/ClassReader.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1999, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1999, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -69,6 +69,7 @@ import com.sun.tools.javac.util.*;
 import com.sun.tools.javac.util.ByteBuffer.UnderflowException;
 import com.sun.tools.javac.util.DefinedBy.Api;
 import com.sun.tools.javac.util.JCDiagnostic.Fragment;
+import com.sun.tools.javac.util.Log.DeferredDiagnosticHandler;
 
 import static com.sun.tools.javac.code.Flags.*;
 import static com.sun.tools.javac.code.Kinds.Kind.*;
@@ -2043,15 +2044,27 @@ public class ClassReader {
         }
 
         Attribute.Compound deproxyCompound(CompoundAnnotationProxy a) {
-            Type annotationType = resolvePossibleProxyType(a.type);
-            ListBuffer<Pair<Symbol.MethodSymbol,Attribute>> buf = new ListBuffer<>();
-            for (List<Pair<Name,Attribute>> l = a.values;
-                 l.nonEmpty();
-                 l = l.tail) {
-                MethodSymbol meth = findAccessMethod(annotationType, l.head.fst);
-                buf.append(new Pair<>(meth, deproxy(meth.type.getReturnType(), l.head.snd)));
+            DeferredDiagnosticHandler deferred = log.new DeferredDiagnosticHandler();
+            Type annotationType = syms.objectType;
+            try {
+                annotationType = resolvePossibleProxyType(a.type);
+                ListBuffer<Pair<Symbol.MethodSymbol,Attribute>> buf = new ListBuffer<>();
+                for (List<Pair<Name,Attribute>> l = a.values;
+                     l.nonEmpty();
+                     l = l.tail) {
+                    MethodSymbol meth = findAccessMethod(annotationType, l.head.fst);
+                    buf.append(new Pair<>(meth, deproxy(meth.type.getReturnType(), l.head.snd)));
+                }
+                return new Attribute.Compound(annotationType, buf.toList());
+            } finally {
+                if (!annotationType.tsym.type.hasTag(TypeTag.ERROR)) {
+                    //if the annotation type does not exists
+                    //throw away warnings reported while de-proxying the annotation,
+                    //as the annotation's library is probably missing from the classpath:
+                    deferred.reportDeferredDiagnostics();
+                }
+                log.popDiagnosticHandler(deferred);
             }
-            return new Attribute.Compound(annotationType, buf.toList());
         }
 
         MethodSymbol findAccessMethod(Type container, Name name) {
@@ -2146,15 +2159,21 @@ public class ClassReader {
                 failure = ex;
             }
             if (enumerator == null) {
-                if (failure != null) {
-                    log.warning(Warnings.UnknownEnumConstantReason(currentClassFile,
-                                                                   enumTypeSym,
-                                                                   proxy.enumerator,
-                                                                   failure.getDiagnostic()));
-                } else {
-                    log.warning(Warnings.UnknownEnumConstant(currentClassFile,
-                                                             enumTypeSym,
-                                                             proxy.enumerator));
+                // The enumerator wasn't found: emit a warning and recover
+                JavaFileObject prevSource = log.useSource(requestingOwner.classfile);
+                try {
+                    if (failure != null) {
+                        log.warning(LintWarnings.UnknownEnumConstantReason(currentClassFile,
+                                                                       enumTypeSym,
+                                                                       proxy.enumerator,
+                                                                       failure.getDiagnostic()));
+                    } else {
+                        log.warning(LintWarnings.UnknownEnumConstant(currentClassFile,
+                                                                 enumTypeSym,
+                                                                 proxy.enumerator));
+                    }
+                } finally {
+                    log.useSource(prevSource);
                 }
                 result = new Attribute.Enum(enumTypeSym.type,
                         new VarSymbol(0, proxy.enumerator, syms.botType, enumTypeSym));
diff --git a/src/jdk.compiler/share/classes/com/sun/tools/javac/resources/compiler.properties b/src/jdk.compiler/share/classes/com/sun/tools/javac/resources/compiler.properties
index 915d7f8a8d8..58a5333ce4c 100644
--- a/src/jdk.compiler/share/classes/com/sun/tools/javac/resources/compiler.properties
+++ b/src/jdk.compiler/share/classes/com/sun/tools/javac/resources/compiler.properties
@@ -2521,10 +2521,12 @@ compiler.err.cant.attach.type.annotations=\
     {3}
 
 # 0: file object, 1: symbol, 2: name
+# lint: classfile
 compiler.warn.unknown.enum.constant=\
     unknown enum constant {1}.{2}
 
 # 0: file object, 1: symbol, 2: name, 3: message segment
+# lint: classfile
 compiler.warn.unknown.enum.constant.reason=\
     unknown enum constant {1}.{2}\n\
     reason: {3}
diff --git a/test/langtools/tools/javac/annotations/6365854/test1.out b/test/langtools/tools/javac/annotations/6365854/test1.out
index c8bf69b095d..e69de29bb2d 100644
--- a/test/langtools/tools/javac/annotations/6365854/test1.out
+++ b/test/langtools/tools/javac/annotations/6365854/test1.out
@@ -1,2 +0,0 @@
-TestCore.class:-:-: compiler.warn.annotation.method.not.found.reason: test.annotation.TestAnnotation, test, (compiler.misc.class.file.not.found: test.annotation.TestAnnotation)
-1 warning
diff --git a/test/langtools/tools/javac/annotations/crashOnUnknownAttr/CrashOnUnknownTargetTypeTest.java b/test/langtools/tools/javac/annotations/crashOnUnknownAttr/CrashOnUnknownTargetTypeTest.java
index 7f5d49e38c9..d0c19c3ec09 100644
--- a/test/langtools/tools/javac/annotations/crashOnUnknownAttr/CrashOnUnknownTargetTypeTest.java
+++ b/test/langtools/tools/javac/annotations/crashOnUnknownAttr/CrashOnUnknownTargetTypeTest.java
@@ -3,7 +3,7 @@
  * @summary compiler is crashing with AssertionError for annotations with unknown target type
  * @bug 8296010
  * @build A
- * @compile/fail/ref=CrashOnUnknownTargetTypeTest.out -XDrawDiagnostics CrashOnUnknownTargetTypeTest.java
+ * @compile/fail/ref=CrashOnUnknownTargetTypeTest.out -XDrawDiagnostics -Xlint:classfile CrashOnUnknownTargetTypeTest.java
  */
 
 public class CrashOnUnknownTargetTypeTest {
diff --git a/test/langtools/tools/javac/annotations/crashOnUnknownAttr/CrashOnUnknownTargetTypeTest.out b/test/langtools/tools/javac/annotations/crashOnUnknownAttr/CrashOnUnknownTargetTypeTest.out
index 8e6925a0e0d..d46ea56acef 100644
--- a/test/langtools/tools/javac/annotations/crashOnUnknownAttr/CrashOnUnknownTargetTypeTest.out
+++ b/test/langtools/tools/javac/annotations/crashOnUnknownAttr/CrashOnUnknownTargetTypeTest.out
@@ -1,5 +1,5 @@
-- compiler.warn.unknown.enum.constant: ElementType.class, java.lang.annotation.ElementType, NO_SUCH
-- compiler.warn.unknown.enum.constant: String.class, java.lang.annotation.ElementType, NO_SUCH
+A.class:-:-: compiler.warn.unknown.enum.constant: ElementType.class, java.lang.annotation.ElementType, NO_SUCH
+A.class:-:-: compiler.warn.unknown.enum.constant: String.class, java.lang.annotation.ElementType, NO_SUCH
 CrashOnUnknownTargetTypeTest.java:10:5: compiler.err.annotation.unrecognized.attribute.name: A, NO_SUCH
 CrashOnUnknownTargetTypeTest.java:11:5: compiler.err.annotation.unrecognized.attribute.name: A, NO_SUCH
 CrashOnUnknownTargetTypeTest.java:12:14: compiler.err.annotation.unrecognized.attribute.name: A, NO_SUCH
diff --git a/test/langtools/tools/javac/classreader/Annotations.java b/test/langtools/tools/javac/classreader/Annotations.java
new file mode 100644
index 00000000000..30d0ae48b9a
--- /dev/null
+++ b/test/langtools/tools/javac/classreader/Annotations.java
@@ -0,0 +1,220 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+/*
+ * @test
+ * @bug 8305250
+ * @summary Check behavior w.r.t. annotations missing from the classpath.
+ * @library /tools/lib
+ * @modules jdk.compiler/com.sun.tools.javac.api
+ *          jdk.compiler/com.sun.tools.javac.main
+ * @build toolbox.ToolBox toolbox.JavacTask
+ * @run junit Annotations
+ */
+
+import java.nio.file.Files;
+import java.util.List;
+import java.nio.file.Path;
+
+import org.junit.jupiter.api.BeforeEach;
+import org.junit.jupiter.api.Test;
+import org.junit.jupiter.api.TestInfo;
+import toolbox.ToolBox;
+import toolbox.JavacTask;
+import toolbox.Task;
+
+public class Annotations {
+    private ToolBox tb = new ToolBox();
+    private Path base;
+
+    @Test
+    public void testParameterModifiersNotVisible() throws Exception {
+        Path ann = base.resolve("annotations");
+        Path annSrc = ann.resolve("src");
+        Path annClasses = ann.resolve("classes");
+
+        tb.writeJavaFiles(annSrc,
+                          """
+                          package annotations;
+                          public @interface Ann {
+                              public E e();
+                          }
+                          """,
+                          """
+                          package annotations;
+                          public enum E {
+                              A;
+                          }
+                          """);
+
+        Files.createDirectories(annClasses);
+
+        new JavacTask(tb)
+                .outdir(annClasses)
+                .files(tb.findJavaFiles(annSrc))
+                .run()
+                .writeAll();
+
+        Path lib = base.resolve("lib");
+        Path libSrc = lib.resolve("src");
+        Path libClasses = lib.resolve("classes");
+
+        tb.writeJavaFiles(libSrc,
+                          """
+                          package lib;
+                          import annotations.*;
+                          @Ann(e = E.A)
+                          public class Lib {
+                          }
+                          """);
+
+        Files.createDirectories(libClasses);
+
+        new JavacTask(tb)
+                .outdir(libClasses)
+                .classpath(annClasses)
+                .files(tb.findJavaFiles(libSrc))
+                .run()
+                .writeAll();
+
+        Path test = base.resolve("test");
+        Path testSrc = test.resolve("src");
+        Path testClasses = test.resolve("classes");
+
+        tb.writeJavaFiles(testSrc,
+                          """
+                          package test;
+                          import lib.*;
+                          public class Test {
+                              Lib l;
+                          }
+                          """);
+
+        Files.createDirectories(testClasses);
+
+        //annotations available, no errors/warnings:
+        new JavacTask(tb)
+                .outdir(testClasses)
+                .classpath(libClasses, annClasses)
+                .options("-Werror", "-Xlint:classfile")
+                .files(tb.findJavaFiles(testSrc))
+                .run()
+                .writeAll();
+
+        //annotation and enum missing, no errors/warnings:
+        new JavacTask(tb)
+                .outdir(testClasses)
+                .classpath(libClasses)
+                .options("-Werror", "-Xlint:classfile")
+                .files(tb.findJavaFiles(testSrc))
+                .run()
+                .writeAll();
+
+        tb.writeJavaFiles(annSrc,
+                          """
+                          package annotations;
+                          public enum E {
+                              B;
+                          }
+                          """);
+
+        Files.createDirectories(annClasses);
+
+        new JavacTask(tb)
+                .outdir(annClasses)
+                .files(tb.findJavaFiles(annSrc))
+                .run()
+                .writeAll();
+
+        List<String> log;
+
+        //enum missing the enum constant recorded in the classfile, report warning:
+        log = new JavacTask(tb)
+                .outdir(testClasses)
+                .classpath(libClasses, annClasses)
+                .options("-Xlint:classfile", "-XDrawDiagnostics")
+                .files(tb.findJavaFiles(testSrc))
+                .run()
+                .writeAll()
+                .getOutputLines(Task.OutputKind.DIRECT);
+
+        tb.checkEqual(log,
+                      List.of("Lib.class:-:-: compiler.warn.unknown.enum.constant: E.class, annotations.E, A",
+                              "1 warning"));
+
+        //enum is missing, but the annotation is not, report warning:
+        Files.delete(annClasses.resolve("annotations").resolve("E.class"));
+
+        log = new JavacTask(tb)
+                .outdir(testClasses)
+                .classpath(libClasses, annClasses)
+                .options("-Xlint:classfile", "-XDrawDiagnostics")
+                .files(tb.findJavaFiles(testSrc))
+                .run()
+                .writeAll()
+                .getOutputLines(Task.OutputKind.DIRECT);
+
+        tb.checkEqual(log,
+                      List.of("Lib.class:-:-: compiler.warn.unknown.enum.constant.reason: Ann.class, annotations.E, A, (compiler.misc.class.file.not.found: annotations.E)",
+                              "1 warning"));
+
+        tb.writeJavaFiles(annSrc,
+                          """
+                          package annotations;
+                          public @interface Ann {
+                              public E nue();
+                          }
+                          """,
+                          """
+                          package annotations;
+                          public enum E {
+                              A;
+                          }
+                          """);
+
+        new JavacTask(tb)
+                .outdir(annClasses)
+                .files(tb.findJavaFiles(annSrc))
+                .run()
+                .writeAll();
+
+        //enum is OK and the annotation exists, but the annotation is missing the required attribute method, report warning:
+        log = new JavacTask(tb)
+                .outdir(testClasses)
+                .classpath(libClasses, annClasses)
+                .options("-Xlint:classfile", "-XDrawDiagnostics")
+                .files(tb.findJavaFiles(testSrc))
+                .run()
+                .writeAll()
+                .getOutputLines(Task.OutputKind.DIRECT);
+
+        tb.checkEqual(log,
+                      List.of("Lib.class:-:-: compiler.warn.annotation.method.not.found: annotations.Ann, e",
+                              "1 warning"));
+    }
+
+    @BeforeEach
+    public void setup(TestInfo ti) {
+        base = Path.of(".").resolve(ti.getTestMethod().orElseThrow().getName());
+    }
+}

From 73424d14baa9e439f0825507233a7c2247894195 Mon Sep 17 00:00:00 2001
From: Albert Mingkun Yang <ayang@openjdk.org>
Date: Thu, 12 Mar 2026 08:31:43 +0000
Subject: [PATCH 160/655] 8379506: Parallel: Move Parallel specific flags to
 parallel_globals.hpp

Reviewed-by: tschatzl, phubner
---
 src/hotspot/os/linux/os_linux.cpp                  |  2 ++
 src/hotspot/share/gc/parallel/mutableNUMASpace.hpp |  1 +
 src/hotspot/share/gc/parallel/parallel_globals.hpp | 13 +++++++++++++
 src/hotspot/share/runtime/globals.hpp              | 13 -------------
 4 files changed, 16 insertions(+), 13 deletions(-)

diff --git a/src/hotspot/os/linux/os_linux.cpp b/src/hotspot/os/linux/os_linux.cpp
index 9c2fbab7535..17cd0d05f9a 100644
--- a/src/hotspot/os/linux/os_linux.cpp
+++ b/src/hotspot/os/linux/os_linux.cpp
@@ -4549,6 +4549,7 @@ void os::Linux::numa_init() {
     FLAG_SET_ERGO_IF_DEFAULT(UseNUMAInterleaving, true);
   }
 
+#if INCLUDE_PARALLELGC
   if (UseParallelGC && UseNUMA && UseLargePages && !can_commit_large_page_memory()) {
     // With static large pages we cannot uncommit a page, so there's no way
     // we can make the adaptive lgrp chunk resizing work. If the user specified both
@@ -4560,6 +4561,7 @@ void os::Linux::numa_init() {
       UseAdaptiveNUMAChunkSizing = false;
     }
   }
+#endif
 }
 
 void os::Linux::disable_numa(const char* reason, bool warning) {
diff --git a/src/hotspot/share/gc/parallel/mutableNUMASpace.hpp b/src/hotspot/share/gc/parallel/mutableNUMASpace.hpp
index 4b8bca430f8..36de38c34bb 100644
--- a/src/hotspot/share/gc/parallel/mutableNUMASpace.hpp
+++ b/src/hotspot/share/gc/parallel/mutableNUMASpace.hpp
@@ -26,6 +26,7 @@
 #define SHARE_GC_PARALLEL_MUTABLENUMASPACE_HPP
 
 #include "gc/parallel/mutableSpace.hpp"
+#include "gc/shared/gc_globals.hpp"
 #include "gc/shared/gcUtil.hpp"
 #include "runtime/globals.hpp"
 #include "utilities/growableArray.hpp"
diff --git a/src/hotspot/share/gc/parallel/parallel_globals.hpp b/src/hotspot/share/gc/parallel/parallel_globals.hpp
index 64e2effdeae..ba4a79f9254 100644
--- a/src/hotspot/share/gc/parallel/parallel_globals.hpp
+++ b/src/hotspot/share/gc/parallel/parallel_globals.hpp
@@ -31,6 +31,19 @@
                           product_pd,                                       \
                           range,                                            \
                           constraint)                                       \
+  product(uintx, NUMAChunkResizeWeight, 20,                                 \
+          "Percentage (0-100) used to weight the current sample when "      \
+          "computing exponentially decaying average for "                   \
+          "AdaptiveNUMAChunkSizing")                                        \
+          range(0, 100)                                                     \
+                                                                            \
+  product(size_t, NUMASpaceResizeRate, 1*G,                                 \
+          "Do not reallocate more than this amount per collection")         \
+          range(0, max_uintx)                                               \
+                                                                            \
+  product(bool, UseAdaptiveNUMAChunkSizing, true,                           \
+          "Enable adaptive chunk sizing for NUMA")                          \
+                                                                            \
   product(bool, UseMaximumCompactionOnSystemGC, true,                       \
           "Use maximum compaction in the Parallel Old garbage collector "   \
           "for a system GC")
diff --git a/src/hotspot/share/runtime/globals.hpp b/src/hotspot/share/runtime/globals.hpp
index 6d4b9908e1c..559071cae68 100644
--- a/src/hotspot/share/runtime/globals.hpp
+++ b/src/hotspot/share/runtime/globals.hpp
@@ -199,19 +199,6 @@ const int ObjectAlignmentInBytes = 8;
           "Granularity to use for NUMA interleaving on Windows OS")         \
           constraint(NUMAInterleaveGranularityConstraintFunc, AtParse)      \
                                                                             \
-  product(uintx, NUMAChunkResizeWeight, 20,                                 \
-          "Percentage (0-100) used to weight the current sample when "      \
-          "computing exponentially decaying average for "                   \
-          "AdaptiveNUMAChunkSizing")                                        \
-          range(0, 100)                                                     \
-                                                                            \
-  product(size_t, NUMASpaceResizeRate, 1*G,                                 \
-          "Do not reallocate more than this amount per collection")         \
-          range(0, max_uintx)                                               \
-                                                                            \
-  product(bool, UseAdaptiveNUMAChunkSizing, true,                           \
-          "Enable adaptive chunk sizing for NUMA")                          \
-                                                                            \
   product(bool, NUMAStats, false,                                           \
           "Print NUMA stats in detailed heap information")                  \
                                                                             \

From fd80329bfdbc023140376e396a02ad6dc0c5bf09 Mon Sep 17 00:00:00 2001
From: Quan Anh Mai <qamai@openjdk.org>
Date: Thu, 12 Mar 2026 08:39:41 +0000
Subject: [PATCH 161/655] 8379260: C2: Separate volatile barrier and full
 barrier

Reviewed-by: fyang, mdoerr, amitkumar, aph, dlong
---
 src/hotspot/cpu/aarch64/aarch64.ad      | 29 +++++++++++
 src/hotspot/cpu/arm/arm.ad              | 24 ++++++++++
 src/hotspot/cpu/ppc/ppc.ad              | 24 ++++++++++
 src/hotspot/cpu/riscv/riscv.ad          | 64 +++++++++++++++++++++++++
 src/hotspot/cpu/s390/s390.ad            | 18 +++++++
 src/hotspot/cpu/x86/x86.ad              | 30 ++++++++++++
 src/hotspot/share/adlc/formssel.cpp     |  2 +
 src/hotspot/share/opto/classes.hpp      |  2 +
 src/hotspot/share/opto/library_call.cpp |  4 +-
 src/hotspot/share/opto/memnode.cpp      |  2 +
 src/hotspot/share/opto/memnode.hpp      | 15 ++++++
 11 files changed, 212 insertions(+), 2 deletions(-)

diff --git a/src/hotspot/cpu/aarch64/aarch64.ad b/src/hotspot/cpu/aarch64/aarch64.ad
index 51bb15e0f59..3989c5a17f0 100644
--- a/src/hotspot/cpu/aarch64/aarch64.ad
+++ b/src/hotspot/cpu/aarch64/aarch64.ad
@@ -8024,6 +8024,21 @@ instruct membar_release_lock() %{
   ins_pipe(pipe_serial);
 %}
 
+instruct membar_storeload() %{
+  match(MemBarStoreLoad);
+  ins_cost(VOLATILE_REF_COST*100);
+
+  format %{ "MEMBAR-store-load\n\t"
+            "dmb ish" %}
+
+  ins_encode %{
+    __ block_comment("membar_storeload");
+    __ membar(Assembler::StoreLoad);
+  %}
+
+  ins_pipe(pipe_serial);
+%}
+
 instruct unnecessary_membar_volatile() %{
   predicate(unnecessary_volatile(n));
   match(MemBarVolatile);
@@ -8053,6 +8068,20 @@ instruct membar_volatile() %{
   ins_pipe(pipe_serial);
 %}
 
+instruct membar_full() %{
+  match(MemBarFull);
+  ins_cost(VOLATILE_REF_COST*100);
+
+  format %{ "membar_full\n\t"
+            "dmb ish" %}
+  ins_encode %{
+    __ block_comment("membar_full");
+    __ membar(Assembler::AnyAny);
+  %}
+
+  ins_pipe(pipe_serial);
+%}
+
 // ============================================================================
 // Cast/Convert Instructions
 
diff --git a/src/hotspot/cpu/arm/arm.ad b/src/hotspot/cpu/arm/arm.ad
index 87c609be5a7..7d0d31c1f79 100644
--- a/src/hotspot/cpu/arm/arm.ad
+++ b/src/hotspot/cpu/arm/arm.ad
@@ -4440,6 +4440,18 @@ instruct membar_release_lock() %{
   ins_pipe(empty);
 %}
 
+instruct membar_storeload() %{
+  match(MemBarStoreLoad);
+  ins_cost(4*MEMORY_REF_COST);
+
+  size(4);
+  format %{ "MEMBAR-storeload" %}
+  ins_encode %{
+    __ membar(MacroAssembler::StoreLoad, noreg);
+  %}
+  ins_pipe(long_memory_op);
+%}
+
 instruct membar_volatile() %{
   match(MemBarVolatile);
   ins_cost(4*MEMORY_REF_COST);
@@ -4463,6 +4475,18 @@ instruct unnecessary_membar_volatile() %{
   ins_pipe(empty);
 %}
 
+instruct membar_full() %{
+  match(MemBarFull);
+  ins_cost(4*MEMORY_REF_COST);
+
+  size(4);
+  format %{ "MEMBAR-full" %}
+  ins_encode %{
+    __ membar(MacroAssembler::StoreLoad, noreg);
+  %}
+  ins_pipe(long_memory_op);
+%}
+
 //----------Register Move Instructions-----------------------------------------
 
 // Cast Index to Pointer for unsafe natives
diff --git a/src/hotspot/cpu/ppc/ppc.ad b/src/hotspot/cpu/ppc/ppc.ad
index 7e3cd04171d..057015d3c39 100644
--- a/src/hotspot/cpu/ppc/ppc.ad
+++ b/src/hotspot/cpu/ppc/ppc.ad
@@ -7163,6 +7163,18 @@ instruct membar_release_lock() %{
   ins_pipe(pipe_class_default);
 %}
 
+instruct membar_storeload() %{
+  match(MemBarStoreLoad);
+  ins_cost(4*MEMORY_REF_COST);
+
+  format %{ "MEMBAR-store-load" %}
+  size(4);
+  ins_encode %{
+    __ fence();
+  %}
+  ins_pipe(pipe_class_default);
+%}
+
 instruct membar_volatile() %{
   match(MemBarVolatile);
   ins_cost(4*MEMORY_REF_COST);
@@ -7205,6 +7217,18 @@ instruct membar_volatile() %{
 //  ins_pipe(pipe_class_default);
 //%}
 
+instruct membar_full() %{
+  match(MemBarFull);
+  ins_cost(4*MEMORY_REF_COST);
+
+  format %{ "MEMBAR-full" %}
+  size(4);
+  ins_encode %{
+    __ fence();
+  %}
+  ins_pipe(pipe_class_default);
+%}
+
 instruct membar_CPUOrder() %{
   match(MemBarCPUOrder);
   ins_cost(0);
diff --git a/src/hotspot/cpu/riscv/riscv.ad b/src/hotspot/cpu/riscv/riscv.ad
index 54ea81683fc..e140052d168 100644
--- a/src/hotspot/cpu/riscv/riscv.ad
+++ b/src/hotspot/cpu/riscv/riscv.ad
@@ -8156,6 +8156,22 @@ instruct unnecessary_membar_rvtso() %{
   ins_pipe(real_empty);
 %}
 
+instruct membar_storeload_rvtso() %{
+  predicate(UseZtso);
+  match(MemBarStoreLoad);
+  ins_cost(VOLATILE_REF_COST);
+
+  format %{ "#@membar_storeload_rvtso\n\t"
+            "fence w, r"%}
+
+  ins_encode %{
+    __ block_comment("membar_storeload_rvtso");
+    __ membar(MacroAssembler::StoreLoad);
+  %}
+
+  ins_pipe(pipe_slow);
+%}
+
 instruct membar_volatile_rvtso() %{
   predicate(UseZtso);
   match(MemBarVolatile);
@@ -8186,6 +8202,22 @@ instruct unnecessary_membar_volatile_rvtso() %{
   ins_pipe(real_empty);
 %}
 
+instruct membar_full_rvtso() %{
+  predicate(UseZtso);
+  match(MemBarFull);
+  ins_cost(VOLATILE_REF_COST);
+
+  format %{ "#@membar_full_rvtso\n\t"
+            "fence rw, rw" %}
+
+  ins_encode %{
+    __ block_comment("membar_full_rvtso");
+    __ membar(MacroAssembler::AnyAny);
+  %}
+
+  ins_pipe(pipe_slow);
+%}
+
 // RVWMO
 
 instruct membar_aqcuire_rvwmo() %{
@@ -8235,6 +8267,22 @@ instruct membar_storestore_rvwmo() %{
   ins_pipe(pipe_serial);
 %}
 
+instruct membar_storeload_rvwmo() %{
+  predicate(!UseZtso);
+  match(MemBarStoreLoad);
+  ins_cost(VOLATILE_REF_COST);
+
+  format %{ "#@membar_storeload_rvwmo\n\t"
+            "fence w, r"%}
+
+  ins_encode %{
+    __ block_comment("membar_storeload_rvwmo");
+    __ membar(MacroAssembler::StoreLoad);
+  %}
+
+  ins_pipe(pipe_serial);
+%}
+
 instruct membar_volatile_rvwmo() %{
   predicate(!UseZtso);
   match(MemBarVolatile);
@@ -8279,6 +8327,22 @@ instruct unnecessary_membar_volatile_rvwmo() %{
   ins_pipe(real_empty);
 %}
 
+instruct membar_full_rvwmo() %{
+  predicate(!UseZtso);
+  match(MemBarFull);
+  ins_cost(VOLATILE_REF_COST);
+
+  format %{ "#@membar_full_rvwmo\n\t"
+            "fence rw, rw" %}
+
+  ins_encode %{
+    __ block_comment("membar_full_rvwmo");
+    __ membar(MacroAssembler::AnyAny);
+  %}
+
+  ins_pipe(pipe_serial);
+%}
+
 instruct spin_wait() %{
   predicate(UseZihintpause);
   match(OnSpinWait);
diff --git a/src/hotspot/cpu/s390/s390.ad b/src/hotspot/cpu/s390/s390.ad
index 1521edde40c..b9982c795cd 100644
--- a/src/hotspot/cpu/s390/s390.ad
+++ b/src/hotspot/cpu/s390/s390.ad
@@ -5239,6 +5239,15 @@ instruct membar_release_lock() %{
   ins_pipe(pipe_class_dummy);
 %}
 
+instruct membar_storeload() %{
+  match(MemBarStoreLoad);
+  ins_cost(4 * MEMORY_REF_COST);
+  size(2);
+  format %{ "MEMBAR-storeload" %}
+  ins_encode %{ __ z_fence(); %}
+  ins_pipe(pipe_class_dummy);
+%}
+
 instruct membar_volatile() %{
   match(MemBarVolatile);
   ins_cost(4 * MEMORY_REF_COST);
@@ -5258,6 +5267,15 @@ instruct unnecessary_membar_volatile() %{
   ins_pipe(pipe_class_dummy);
 %}
 
+instruct membar_full() %{
+  match(MemBarFull);
+  ins_cost(4 * MEMORY_REF_COST);
+  size(2);
+  format %{ "MEMBAR-full" %}
+  ins_encode %{ __ z_fence(); %}
+  ins_pipe(pipe_class_dummy);
+%}
+
 instruct membar_CPUOrder() %{
   match(MemBarCPUOrder);
   ins_cost(0);
diff --git a/src/hotspot/cpu/x86/x86.ad b/src/hotspot/cpu/x86/x86.ad
index ed380105565..8b90655c53c 100644
--- a/src/hotspot/cpu/x86/x86.ad
+++ b/src/hotspot/cpu/x86/x86.ad
@@ -8852,6 +8852,21 @@ instruct membar_release_lock()
   ins_pipe(empty);
 %}
 
+instruct membar_storeload(rFlagsReg cr) %{
+  match(MemBarStoreLoad);
+  effect(KILL cr);
+  ins_cost(400);
+
+  format %{
+    $$template
+    $$emit$$"lock addl [rsp + #0], 0\t! membar_storeload"
+  %}
+  ins_encode %{
+    __ membar(Assembler::StoreLoad);
+  %}
+  ins_pipe(pipe_slow);
+%}
+
 instruct membar_volatile(rFlagsReg cr) %{
   match(MemBarVolatile);
   effect(KILL cr);
@@ -8879,6 +8894,21 @@ instruct unnecessary_membar_volatile()
   ins_pipe(empty);
 %}
 
+instruct membar_full(rFlagsReg cr) %{
+  match(MemBarFull);
+  effect(KILL cr);
+  ins_cost(400);
+
+  format %{
+    $$template
+    $$emit$$"lock addl [rsp + #0], 0\t! membar_full"
+  %}
+  ins_encode %{
+    __ membar(Assembler::StoreLoad);
+  %}
+  ins_pipe(pipe_slow);
+%}
+
 instruct membar_storestore() %{
   match(MemBarStoreStore);
   match(StoreStoreFence);
diff --git a/src/hotspot/share/adlc/formssel.cpp b/src/hotspot/share/adlc/formssel.cpp
index 182587d2f2f..4dd2bff7c89 100644
--- a/src/hotspot/share/adlc/formssel.cpp
+++ b/src/hotspot/share/adlc/formssel.cpp
@@ -4276,7 +4276,9 @@ bool MatchRule::is_ideal_membar() const {
     !strcmp(_opType,"LoadFence" ) ||
     !strcmp(_opType,"StoreFence") ||
     !strcmp(_opType,"StoreStoreFence") ||
+    !strcmp(_opType,"MemBarStoreLoad") ||
     !strcmp(_opType,"MemBarVolatile") ||
+    !strcmp(_opType,"MemBarFull") ||
     !strcmp(_opType,"MemBarCPUOrder") ||
     !strcmp(_opType,"MemBarStoreStore") ||
     !strcmp(_opType,"OnSpinWait");
diff --git a/src/hotspot/share/opto/classes.hpp b/src/hotspot/share/opto/classes.hpp
index abd93fdd876..719b90ad6dd 100644
--- a/src/hotspot/share/opto/classes.hpp
+++ b/src/hotspot/share/opto/classes.hpp
@@ -239,8 +239,10 @@ macro(MemBarRelease)
 macro(StoreFence)
 macro(StoreStoreFence)
 macro(MemBarReleaseLock)
+macro(MemBarStoreLoad)
 macro(MemBarVolatile)
 macro(MemBarStoreStore)
+macro(MemBarFull)
 macro(MergeMem)
 macro(MinI)
 macro(MinL)
diff --git a/src/hotspot/share/opto/library_call.cpp b/src/hotspot/share/opto/library_call.cpp
index b3ee060d75f..8d3c5a98ea0 100644
--- a/src/hotspot/share/opto/library_call.cpp
+++ b/src/hotspot/share/opto/library_call.cpp
@@ -2900,7 +2900,7 @@ bool LibraryCallKit::inline_unsafe_fence(vmIntrinsics::ID id) {
       insert_mem_bar(Op_StoreStoreFence);
       return true;
     case vmIntrinsics::_fullFence:
-      insert_mem_bar(Op_MemBarVolatile);
+      insert_mem_bar(Op_MemBarFull);
       return true;
     default:
       fatal_unexpected_iid(id);
@@ -3070,7 +3070,7 @@ bool LibraryCallKit::inline_native_vthread_start_transition(address funcAddr, co
   Node* vt_addr = basic_plus_adr(vt_oop, java_lang_Thread::is_in_vthread_transition_offset());
   access_store_at(nullptr, jt_addr, _gvn.type(jt_addr)->is_ptr(), ideal.ConI(1), TypeInt::BOOL, T_BOOLEAN, IN_NATIVE | MO_UNORDERED);
   access_store_at(nullptr, vt_addr, _gvn.type(vt_addr)->is_ptr(), ideal.ConI(1), TypeInt::BOOL, T_BOOLEAN, IN_NATIVE | MO_UNORDERED);
-  insert_mem_bar(Op_MemBarVolatile);
+  insert_mem_bar(Op_MemBarStoreLoad);
   ideal.sync_kit(this);
 
   Node* global_disable_addr = makecon(TypeRawPtr::make((address)MountUnmountDisabler::global_vthread_transition_disable_count_address()));
diff --git a/src/hotspot/share/opto/memnode.cpp b/src/hotspot/share/opto/memnode.cpp
index 6cb14444f6b..85bc41e71b9 100644
--- a/src/hotspot/share/opto/memnode.cpp
+++ b/src/hotspot/share/opto/memnode.cpp
@@ -4349,7 +4349,9 @@ MemBarNode* MemBarNode::make(Compile* C, int opcode, int atp, Node* pn) {
   case Op_StoreStoreFence:   return new StoreStoreFenceNode(C, atp, pn);
   case Op_MemBarAcquireLock: return new MemBarAcquireLockNode(C, atp, pn);
   case Op_MemBarReleaseLock: return new MemBarReleaseLockNode(C, atp, pn);
+  case Op_MemBarStoreLoad:   return new MemBarStoreLoadNode(C, atp, pn);
   case Op_MemBarVolatile:    return new MemBarVolatileNode(C, atp, pn);
+  case Op_MemBarFull:        return new MemBarFullNode(C, atp, pn);
   case Op_MemBarCPUOrder:    return new MemBarCPUOrderNode(C, atp, pn);
   case Op_OnSpinWait:        return new OnSpinWaitNode(C, atp, pn);
   case Op_Initialize:        return new InitializeNode(C, atp, pn);
diff --git a/src/hotspot/share/opto/memnode.hpp b/src/hotspot/share/opto/memnode.hpp
index 30d44e82016..7fa238f574d 100644
--- a/src/hotspot/share/opto/memnode.hpp
+++ b/src/hotspot/share/opto/memnode.hpp
@@ -1321,6 +1321,13 @@ public:
   virtual int Opcode() const;
 };
 
+class MemBarStoreLoadNode : public MemBarNode {
+public:
+  MemBarStoreLoadNode(Compile* C, int alias_idx, Node* precedent)
+    : MemBarNode(C, alias_idx, precedent) {}
+  virtual int Opcode() const;
+};
+
 // Ordering between a volatile store and a following volatile load.
 // Requires multi-CPU visibility?
 class MemBarVolatileNode: public MemBarNode {
@@ -1330,6 +1337,14 @@ public:
   virtual int Opcode() const;
 };
 
+// A full barrier blocks all loads and stores from moving across it
+class MemBarFullNode : public MemBarNode {
+public:
+  MemBarFullNode(Compile* C, int alias_idx, Node* precedent)
+    : MemBarNode(C, alias_idx, precedent) {}
+  virtual int Opcode() const;
+};
+
 // Ordering within the same CPU.  Used to order unsafe memory references
 // inside the compiler when we lack alias info.  Not needed "outside" the
 // compiler because the CPU does all the ordering for us.

From c6afd3ced68d231a1d466bd62403409db9e8a96e Mon Sep 17 00:00:00 2001
From: Kerem Kat <krk@openjdk.org>
Date: Thu, 12 Mar 2026 09:24:55 +0000
Subject: [PATCH 162/655] 8379460: C2: Notify AddI/AddL to URShiftI/URShiftL
 users

Reviewed-by: qamai, dfenacci, mchevalier
---
 src/hotspot/share/opto/phaseX.cpp             |  7 ++
 .../c2/igvn/TestURShiftAddNotification.java   | 89 +++++++++++++++++++
 2 files changed, 96 insertions(+)
 create mode 100644 test/hotspot/jtreg/compiler/c2/igvn/TestURShiftAddNotification.java

diff --git a/src/hotspot/share/opto/phaseX.cpp b/src/hotspot/share/opto/phaseX.cpp
index c77316e7d0b..082746f80b7 100644
--- a/src/hotspot/share/opto/phaseX.cpp
+++ b/src/hotspot/share/opto/phaseX.cpp
@@ -2581,6 +2581,13 @@ void PhaseIterGVN::add_users_of_use_to_worklist(Node* n, Node* use, Unique_Node_
       return u->Opcode() == Op_CmpU;
     });
   }
+  // If changed AddI/AddL inputs, check URShift users for
+  // "((X << z) + Y) >>> z" optimization in URShift{I,L}Node::Ideal.
+  if (use_op == Op_AddI || use_op == Op_AddL) {
+    add_users_to_worklist_if(worklist, use, [](Node* u) {
+      return u->Opcode() == Op_URShiftI || u->Opcode() == Op_URShiftL;
+    });
+  }
   // If changed AndI/AndL inputs, check RShift/URShift users for "(x & mask) >> shift" optimization opportunity
   if (use_op == Op_AndI || use_op == Op_AndL) {
     add_users_to_worklist_if(worklist, use, [](Node* u) {
diff --git a/test/hotspot/jtreg/compiler/c2/igvn/TestURShiftAddNotification.java b/test/hotspot/jtreg/compiler/c2/igvn/TestURShiftAddNotification.java
new file mode 100644
index 00000000000..8ca192ea38b
--- /dev/null
+++ b/test/hotspot/jtreg/compiler/c2/igvn/TestURShiftAddNotification.java
@@ -0,0 +1,89 @@
+/*
+ * Copyright Amazon.com Inc. or its affiliates. All Rights Reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+package compiler.c2.igvn;
+
+import compiler.lib.ir_framework.*;
+import jdk.test.lib.Asserts;
+import jdk.test.lib.Platform;
+import jdk.test.lib.Utils;
+import java.util.Random;
+
+/*
+ * @test
+ * @bug 8379460
+ * @key randomness
+ * @summary When AddI/AddL inputs change during IGVN, URShift users must be re-added
+ *          to the IGVN worklist so they can re-check the ((X << z) + Y) >>> z optimization.
+ * @library /test/lib /
+ * @run driver ${test.main.class}
+ */
+public class TestURShiftAddNotification {
+
+    private static final Random RANDOM = Utils.getRandomInstance();
+
+    public static void main(String[] args) {
+        var framework = new TestFramework();
+        framework.addScenarios(new Scenario(0));
+        if (Platform.isDebugBuild()) {
+            framework.addScenarios(new Scenario(1, "-XX:VerifyIterativeGVN=1110"));
+        }
+        framework.start();
+    }
+
+    // The trick: a loop whose exit value is only known after loop optimization.
+    // During initial GVN, i is a Phi, so (x << C) * i stays as MulI — URShift
+    // can't see the LShiftI input through the MulI. After loop opts resolve
+    // i = 1, MulI identity-folds to LShiftI (same type, no cascade), and
+    // without the fix URShift is never re-notified about the new LShiftI input.
+
+    @Run(test = {"testI", "testL"})
+    public void runTests() {
+        int xi = RANDOM.nextInt();
+        int yi = RANDOM.nextInt();
+        long xl = RANDOM.nextLong();
+        long yl = RANDOM.nextLong();
+
+        Asserts.assertEQ(((xi << 3) + yi) >>> 3, testI(xi, yi));
+        Asserts.assertEQ(((xl << 9) + yl) >>> 9, testL(xl, yl));
+    }
+
+    @Test
+    @IR(failOn = {IRNode.LSHIFT_I, IRNode.MUL_I},
+        counts = {IRNode.URSHIFT_I, "1", IRNode.AND_I, "1"})
+    static int testI(int x, int y) {
+        int i;
+        for (i = -10; i < 1; i++) { }
+        int c = (x << 3) * i;
+        return (c + y) >>> 3;
+    }
+
+    @Test
+    @IR(failOn = {IRNode.LSHIFT_L, IRNode.MUL_L},
+        counts = {IRNode.URSHIFT_L, "1", IRNode.AND_L, "1"})
+    static long testL(long x, long y) {
+        int i;
+        for (i = -10; i < 1; i++) { }
+        long c = (x << 9) * i;
+        return (c + y) >>> 9;
+    }
+}

From bd2972d2b0c49925362df29962baa86259467fca Mon Sep 17 00:00:00 2001
From: Kuai Wei <kwei@openjdk.org>
Date: Thu, 12 Mar 2026 09:31:08 +0000
Subject: [PATCH 163/655] 8379502: Remove unused
 PhaseOutput::need_register_stack_bang()

Reviewed-by: chagedorn
---
 src/hotspot/share/opto/output.cpp | 9 ---------
 src/hotspot/share/opto/output.hpp | 1 -
 2 files changed, 10 deletions(-)

diff --git a/src/hotspot/share/opto/output.cpp b/src/hotspot/share/opto/output.cpp
index 136fc8ac864..edfd6189fb9 100644
--- a/src/hotspot/share/opto/output.cpp
+++ b/src/hotspot/share/opto/output.cpp
@@ -363,15 +363,6 @@ bool PhaseOutput::need_stack_bang(int frame_size_in_bytes) const {
            DEBUG_ONLY(|| true)));
 }
 
-bool PhaseOutput::need_register_stack_bang() const {
-  // Determine if we need to generate a register stack overflow check.
-  // This is only used on architectures which have split register
-  // and memory stacks.
-  // Bang if the method is not a stub function and has java calls
-  return (C->stub_function() == nullptr && C->has_java_calls());
-}
-
-
 // Compute the size of first NumberOfLoopInstrToAlign instructions at the top
 // of a loop. When aligning a loop we need to provide enough instructions
 // in cpu's fetch buffer to feed decoders. The loop alignment could be
diff --git a/src/hotspot/share/opto/output.hpp b/src/hotspot/share/opto/output.hpp
index 432ad3638b2..5cca59ea0e4 100644
--- a/src/hotspot/share/opto/output.hpp
+++ b/src/hotspot/share/opto/output.hpp
@@ -109,7 +109,6 @@ public:
   // Convert Nodes to instruction bits and pass off to the VM
   void Output();
   bool need_stack_bang(int frame_size_in_bytes) const;
-  bool need_register_stack_bang() const;
   void compute_loop_first_inst_sizes();
 
   void install_code(ciMethod*         target,

From 83f323d6fda09f95616de4b962415226259a0fd6 Mon Sep 17 00:00:00 2001
From: Amit Kumar <amitkumar@openjdk.org>
Date: Thu, 12 Mar 2026 09:59:04 +0000
Subject: [PATCH 164/655] 8379704: [s390x] Build without C2 broken after
 8373595

Reviewed-by: mdoerr, aph
---
 .../cpu/s390/gc/shared/barrierSetAssembler_s390.cpp    | 10 +++++-----
 .../cpu/s390/gc/shared/barrierSetAssembler_s390.hpp    |  7 +++++--
 src/hotspot/cpu/s390/macroAssembler_s390.cpp           |  4 ++--
 3 files changed, 12 insertions(+), 9 deletions(-)

diff --git a/src/hotspot/cpu/s390/gc/shared/barrierSetAssembler_s390.cpp b/src/hotspot/cpu/s390/gc/shared/barrierSetAssembler_s390.cpp
index 7617c7a49e8..9fac231df47 100644
--- a/src/hotspot/cpu/s390/gc/shared/barrierSetAssembler_s390.cpp
+++ b/src/hotspot/cpu/s390/gc/shared/barrierSetAssembler_s390.cpp
@@ -169,6 +169,11 @@ void BarrierSetAssembler::try_resolve_jobject_in_native(MacroAssembler* masm, Re
   __ z_lg(obj, 0, obj); // Resolve (untagged) jobject.
 }
 
+void BarrierSetAssembler::try_resolve_weak_handle(MacroAssembler* masm, Register obj, Register tmp, Label& slow_path) {
+  // Load the oop from the weak handle.
+  __ z_lg(obj, Address(obj));
+}
+
 void BarrierSetAssembler::nmethod_entry_barrier(MacroAssembler* masm) {
   BarrierSetNMethod* bs_nm = BarrierSet::barrier_set()->barrier_set_nmethod();
   __ align(4, __ offset() + OFFSET_TO_PATCHABLE_DATA); // must align the following block which requires atomic updates
@@ -206,11 +211,6 @@ OptoReg::Name BarrierSetAssembler::refine_register(const Node* node, OptoReg::Na
   return opto_reg;
 }
 
-void BarrierSetAssembler::try_resolve_weak_handle_in_c2(MacroAssembler* masm, Register obj, Register tmp, Label& slow_path) {
-  // Load the oop from the weak handle.
-  __ z_lg(obj, Address(obj));
-}
-
 #undef __
 #define __ _masm->
 
diff --git a/src/hotspot/cpu/s390/gc/shared/barrierSetAssembler_s390.hpp b/src/hotspot/cpu/s390/gc/shared/barrierSetAssembler_s390.hpp
index d5682450414..8e76ec2f4b4 100644
--- a/src/hotspot/cpu/s390/gc/shared/barrierSetAssembler_s390.hpp
+++ b/src/hotspot/cpu/s390/gc/shared/barrierSetAssembler_s390.hpp
@@ -58,6 +58,11 @@ public:
   virtual void try_resolve_jobject_in_native(MacroAssembler* masm, Register jni_env,
                                              Register obj, Register tmp, Label& slowpath);
 
+  // Can be used in nmethods including native wrappers.
+  // Attention: obj will only be valid until next safepoint (no SATB barrier).
+  // (other platforms currently use it for C2 only: try_resolve_weak_handle_in_c2)
+  virtual void try_resolve_weak_handle(MacroAssembler* masm, Register obj, Register tmp, Label& slow_path);
+
   virtual void nmethod_entry_barrier(MacroAssembler* masm);
 
   virtual void barrier_stubs_init() {}
@@ -65,8 +70,6 @@ public:
 #ifdef COMPILER2
   OptoReg::Name refine_register(const Node* node,
                                 OptoReg::Name opto_reg) const;
-  virtual void try_resolve_weak_handle_in_c2(MacroAssembler* masm, Register obj,
-                                             Register tmp, Label& slow_path);
 #endif // COMPILER2
 
   static const int OFFSET_TO_PATCHABLE_DATA_INSTRUCTION = 6 + 6 + 6; // iihf(6) + iilf(6) + lg(6)
diff --git a/src/hotspot/cpu/s390/macroAssembler_s390.cpp b/src/hotspot/cpu/s390/macroAssembler_s390.cpp
index 78779a9098a..6e132f895bd 100644
--- a/src/hotspot/cpu/s390/macroAssembler_s390.cpp
+++ b/src/hotspot/cpu/s390/macroAssembler_s390.cpp
@@ -1,7 +1,7 @@
 /*
  * Copyright (c) 2016, 2026, Oracle and/or its affiliates. All rights reserved.
  * Copyright (c) 2016, 2024 SAP SE. All rights reserved.
- * Copyright 2024 IBM Corporation. All rights reserved.
+ * Copyright 2024, 2026 IBM Corporation. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -6413,7 +6413,7 @@ void MacroAssembler::compiler_fast_lock_object(Register obj, Register box, Regis
       // Check if object matches.
       z_lg(tmp2, Address(tmp1_monitor, ObjectMonitor::object_offset()));
       BarrierSetAssembler* bs_asm = BarrierSet::barrier_set()->barrier_set_assembler();
-      bs_asm->try_resolve_weak_handle_in_c2(this, tmp2, Z_R0_scratch, slow_path);
+      bs_asm->try_resolve_weak_handle(this, tmp2, Z_R0_scratch, slow_path);
       z_cgr(obj, tmp2);
       z_brne(slow_path);
 

From 34a0235ed30141e92f064d30fe4378709ea0e135 Mon Sep 17 00:00:00 2001
From: Daniel Fuchs <dfuchs@openjdk.org>
Date: Thu, 12 Mar 2026 14:45:18 +0000
Subject: [PATCH 165/655] 8379548: java/util/logging/ParentLoggersTest.java
 failed with missing myParentLogger value

Reviewed-by: jpai
---
 .../classes/java/util/logging/LogManager.java | 82 +++++++++++--------
 .../java/util/logging/ParentLoggersTest.java  |  2 +-
 2 files changed, 47 insertions(+), 37 deletions(-)

diff --git a/src/java.logging/share/classes/java/util/logging/LogManager.java b/src/java.logging/share/classes/java/util/logging/LogManager.java
index 9c9c708a062..102f4bac6e4 100644
--- a/src/java.logging/share/classes/java/util/logging/LogManager.java
+++ b/src/java.logging/share/classes/java/util/logging/LogManager.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2000, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2000, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -736,41 +736,56 @@ public class LogManager {
                 logger.setLevel(level);
             }
 
-            // instantiation of the handler is done in the LogManager.addLogger
-            // implementation as a handler class may be only visible to LogManager
-            // subclass for the custom log manager case
-            processParentHandlers(logger, name, VisitedLoggers.NEVER);
+            // We need to make sure that loggers created by processParentHandlers
+            // will not be garbage collected before the child/parent
+            // pointers are updated. We use an ArrayList to temporarily
+            // store these loggers, until the parent/child relationship
+            // have been updated
+            final List<Logger> saved = new ArrayList<>();
+            try {
 
-            // Find the new node and its parent.
-            LogNode node = getNode(name);
-            node.loggerRef = ref;
-            Logger parent = null;
-            LogNode nodep = node.parent;
-            while (nodep != null) {
-                LoggerWeakRef nodeRef = nodep.loggerRef;
-                if (nodeRef != null) {
-                    parent = nodeRef.get();
-                    if (parent != null) {
-                        break;
+                // always return false, to make sure we process all loggers from
+                // root to child.
+                Predicate<Logger> visited = (l) -> saved.add(l) && false;
+
+                // instantiation of the handler is done in the LogManager.addLogger
+                // implementation as a handler class may be only visible to LogManager
+                // subclass for the custom log manager case
+                processParentHandlers(logger, name, visited);
+
+                // Find the new node and its parent.
+                LogNode node = getNode(name);
+                node.loggerRef = ref;
+                Logger parent = null;
+                LogNode nodep = node.parent;
+                while (nodep != null) {
+                    LoggerWeakRef nodeRef = nodep.loggerRef;
+                    if (nodeRef != null) {
+                        parent = nodeRef.get();
+                        if (parent != null) {
+                            break;
+                        }
                     }
+                    nodep = nodep.parent;
                 }
-                nodep = nodep.parent;
-            }
 
-            if (parent != null) {
-               logger.setParent(parent);
-            }
-            // Walk over the children and tell them we are their new parent.
-            node.walkAndSetParent(logger);
-            // new LogNode is ready so tell the LoggerWeakRef about it
-            ref.setNode(node);
+                if (parent != null) {
+                    logger.setParent(parent);
+                }
+                // Walk over the children and tell them we are their new parent.
+                node.walkAndSetParent(logger);
+                // new LogNode is ready so tell the LoggerWeakRef about it
+                ref.setNode(node);
 
-            // Do not publish 'ref' in namedLoggers before the logger tree
-            // is fully updated - because the named logger will be visible as
-            // soon as it is published in namedLoggers (findLogger takes
-            // benefit of the ConcurrentHashMap implementation of namedLoggers
-            // to avoid synchronizing on retrieval when that is possible).
-            namedLoggers.put(name, ref);
+                // Do not publish 'ref' in namedLoggers before the logger tree
+                // is fully updated - because the named logger will be visible as
+                // soon as it is published in namedLoggers (findLogger takes
+                // benefit of the ConcurrentHashMap implementation of namedLoggers
+                // to avoid synchronizing on retrieval when that is possible).
+                namedLoggers.put(name, ref);
+            } finally {
+                saved.clear();
+            }
             return true;
         }
 
@@ -1647,11 +1662,6 @@ public class LogManager {
         public void clear() {
             if (visited != null) visited.clear();
         }
-
-        // An object that considers that no logger has ever been visited.
-        // This is used when processParentHandlers is called from
-        // LoggerContext.addLocalLogger
-        static final VisitedLoggers NEVER = new VisitedLoggers(null);
     }
 
 
diff --git a/test/jdk/java/util/logging/ParentLoggersTest.java b/test/jdk/java/util/logging/ParentLoggersTest.java
index 8aae7e95d74..55a93249ca8 100644
--- a/test/jdk/java/util/logging/ParentLoggersTest.java
+++ b/test/jdk/java/util/logging/ParentLoggersTest.java
@@ -23,7 +23,7 @@
 
 /*
  * @test
- * @bug     6498300 8377457
+ * @bug     6498300 8377457 8379548
  *
  * @summary regression: parent loggers are not properly registered
  * @author  ss45998

From 8444fdae4afd99369a321bda95d1ee034f1835f6 Mon Sep 17 00:00:00 2001
From: Daniel Gredler <dgredler@openjdk.org>
Date: Thu, 12 Mar 2026 14:49:35 +0000
Subject: [PATCH 166/655] 8379778: SunGraphics2D improvements

Reviewed-by: avu, prr
---
 .../classes/sun/java2d/SunGraphics2D.java     | 153 +++---------------
 1 file changed, 25 insertions(+), 128 deletions(-)

diff --git a/src/java.desktop/share/classes/sun/java2d/SunGraphics2D.java b/src/java.desktop/share/classes/sun/java2d/SunGraphics2D.java
index 9815d657eee..891a15f24de 100644
--- a/src/java.desktop/share/classes/sun/java2d/SunGraphics2D.java
+++ b/src/java.desktop/share/classes/sun/java2d/SunGraphics2D.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1996, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1996, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -250,11 +250,6 @@ public final class SunGraphics2D
     private FontInfo glyphVectorFontInfo;
     private FontRenderContext glyphVectorFRC;
 
-    private static final int slowTextTransformMask =
-                            AffineTransform.TYPE_GENERAL_TRANSFORM
-                        |   AffineTransform.TYPE_MASK_ROTATION
-                        |   AffineTransform.TYPE_FLIP;
-
     static {
         if (PerformanceLogger.loggingEnabled()) {
             PerformanceLogger.setTime("SunGraphics2D static initialization");
@@ -453,13 +448,13 @@ public final class SunGraphics2D
      * or whether that shape must be "kept" unmodified.
      */
     Shape intersectShapes(Shape s1, Shape s2, boolean keep1, boolean keep2) {
-        if (s1 instanceof Rectangle && s2 instanceof Rectangle) {
-            return ((Rectangle) s1).intersection((Rectangle) s2);
+        if (s1 instanceof Rectangle r1 && s2 instanceof Rectangle r2) {
+            return r1.intersection(r2);
         }
-        if (s1 instanceof Rectangle2D) {
-            return intersectRectShape((Rectangle2D) s1, s2, keep1, keep2);
-        } else if (s2 instanceof Rectangle2D) {
-            return intersectRectShape((Rectangle2D) s2, s1, keep2, keep1);
+        if (s1 instanceof Rectangle2D r1) {
+            return intersectRectShape(r1, s2, keep1, keep2);
+        } else if (s2 instanceof Rectangle2D r2) {
+            return intersectRectShape(r2, s1, keep2, keep1);
         }
         return intersectByArea(s1, s2, keep1, keep2);
     }
@@ -473,8 +468,7 @@ public final class SunGraphics2D
      */
     Shape intersectRectShape(Rectangle2D r, Shape s,
                              boolean keep1, boolean keep2) {
-        if (s instanceof Rectangle2D) {
-            Rectangle2D r2 = (Rectangle2D) s;
+        if (s instanceof Rectangle2D r2) {
             Rectangle2D outrect;
             if (!keep1) {
                 outrect = r;
@@ -596,12 +590,10 @@ public final class SunGraphics2D
         }
 
         float ptSize = font.getSize2D();
-        int txFontType;
         AffineTransform devAt, textAt=null;
         if (font.isTransformed()) {
             textAt = font.getTransform();
             textAt.scale(ptSize, ptSize);
-            txFontType = textAt.getType();
             info.originX = (float)textAt.getTranslateX();
             info.originY = (float)textAt.getTranslateY();
             textAt.translate(-info.originX, -info.originY);
@@ -621,7 +613,6 @@ public final class SunGraphics2D
             }
             info.pixelHeight = (int)(Math.abs(scaley)+0.5);
         } else {
-            txFontType = AffineTransform.TYPE_IDENTITY;
             info.originX = info.originY = 0;
             if (transformState >= TRANSFORM_TRANSLATESCALE) {
                 transform.getMatrix(info.devTx = new double[4]);
@@ -783,18 +774,6 @@ public final class SunGraphics2D
         return info;
     }
 
-    public static boolean isRotated(double [] mtx) {
-        if ((mtx[0] == mtx[3]) &&
-            (mtx[1] == 0.0) &&
-            (mtx[2] == 0.0) &&
-            (mtx[0] > 0.0))
-        {
-            return false;
-        }
-
-        return true;
-    }
-
     public void setFont(Font font) {
         /* replacing the reference equality test font != this.font with
          * !font.equals(this.font) did not yield any measurable difference
@@ -944,8 +923,7 @@ public final class SunGraphics2D
         }
         int newCompState;
         CompositeType newCompType;
-        if (comp instanceof AlphaComposite) {
-            AlphaComposite alphacomp = (AlphaComposite) comp;
+        if (comp instanceof AlphaComposite alphacomp) {
             newCompType = CompositeType.forAlphaComposite(alphacomp);
             if (newCompType == CompositeType.SrcOverNoEa) {
                 if (paintState == PAINT_OPAQUECOLOR ||
@@ -1000,8 +978,8 @@ public final class SunGraphics2D
      * @see TexturePaint
      */
     public void setPaint(Paint paint) {
-        if (paint instanceof Color) {
-            setColor((Color) paint);
+        if (paint instanceof Color c) {
+            setColor(c);
             return;
         }
         if (paint == null || this.paint == paint) {
@@ -1162,8 +1140,8 @@ public final class SunGraphics2D
         }
         int saveStrokeState = strokeState;
         stroke = s;
-        if (s instanceof BasicStroke) {
-            validateBasicStroke((BasicStroke) s);
+        if (s instanceof BasicStroke bs) {
+            validateBasicStroke(bs);
         } else {
             strokeState = STROKE_CUSTOM;
         }
@@ -1193,11 +1171,10 @@ public final class SunGraphics2D
             throw new IllegalArgumentException
                 (hintValue+" is not compatible with "+hintKey);
         }
-        if (hintKey instanceof SunHints.Key) {
+        if (hintKey instanceof SunHints.Key sunKey) {
             boolean stateChanged;
             boolean textStateChanged = false;
             boolean recognized = true;
-            SunHints.Key sunKey = (SunHints.Key) hintKey;
             int newHint;
             if (sunKey == SunHints.KEY_TEXT_ANTIALIAS_LCD_CONTRAST) {
                 newHint = ((Integer)hintValue).intValue();
@@ -1297,7 +1274,6 @@ public final class SunGraphics2D
         hints.put(hintKey, hintValue);
     }
 
-
     /**
      * Returns the preferences for the rendering algorithms.
      * @param hintKey The category of hint to be set. The strings
@@ -1310,10 +1286,10 @@ public final class SunGraphics2D
         if (hints != null) {
             return hints.get(hintKey);
         }
-        if (!(hintKey instanceof SunHints.Key)) {
+        if (!(hintKey instanceof SunHints.Key shk)) {
             return null;
         }
-        int keyindex = ((SunHints.Key)hintKey).getIndex();
+        int keyindex = shk.getIndex();
         switch (keyindex) {
         case SunHints.INTKEY_RENDERING:
             return SunHints.Value.get(SunHints.INTKEY_RENDERING,
@@ -1822,8 +1798,8 @@ public final class SunGraphics2D
     public Rectangle getClipBounds(Rectangle r) {
         if (clipState != CLIP_DEVICE) {
             if (transformState <= TRANSFORM_INT_TRANSLATE) {
-                if (usrClip instanceof Rectangle) {
-                    r.setBounds((Rectangle) usrClip);
+                if (usrClip instanceof Rectangle usrClipRect) {
+                    r.setBounds(usrClipRect);
                 } else {
                     r.setFrame(usrClip.getBounds2D());
                 }
@@ -1970,8 +1946,7 @@ public final class SunGraphics2D
             r.translate(tx, ty);
             return r;
         }
-        if (s instanceof Rectangle2D) {
-            Rectangle2D rect = (Rectangle2D) s;
+        if (s instanceof Rectangle2D rect) {
             return new Rectangle2D.Double(rect.getX() + tx,
                                           rect.getY() + ty,
                                           rect.getWidth(),
@@ -1991,10 +1966,9 @@ public final class SunGraphics2D
             return null;
         }
 
-        if (clip instanceof Rectangle2D &&
+        if (clip instanceof Rectangle2D rect &&
             (tx.getType() & NON_RECTILINEAR_TRANSFORM_MASK) == 0)
         {
-            Rectangle2D rect = (Rectangle2D) clip;
             double[] matrix = new double[4];
             matrix[0] = rect.getX();
             matrix[1] = rect.getY();
@@ -2180,65 +2154,6 @@ public final class SunGraphics2D
         }
     }
 
-    /*
-    public void XcopyArea(int x, int y, int w, int h, int dx, int dy) {
-        Rectangle rect = new Rectangle(x, y, w, h);
-        rect = transformBounds(rect, transform);
-        Point2D    point = new Point2D.Float(dx, dy);
-        Point2D    root  = new Point2D.Float(0, 0);
-        point = transform.transform(point, point);
-        root  = transform.transform(root, root);
-        int fdx = (int)(point.getX()-root.getX());
-        int fdy = (int)(point.getY()-root.getY());
-
-        Rectangle r = getCompBounds().intersection(rect.getBounds());
-
-        if (r.isEmpty()) {
-            return;
-        }
-
-        // Begin Rasterizer for Clip Shape
-        boolean skipClip = true;
-        byte[] clipAlpha = null;
-
-        if (clipState == CLIP_SHAPE) {
-
-            int box[] = new int[4];
-
-            clipRegion.getBounds(box);
-            Rectangle devR = new Rectangle(box[0], box[1],
-                                           box[2] - box[0],
-                                           box[3] - box[1]);
-            if (!devR.isEmpty()) {
-                OutputManager mgr = getOutputManager();
-                RegionIterator ri = clipRegion.getIterator();
-                while (ri.nextYRange(box)) {
-                    int spany = box[1];
-                    int spanh = box[3] - spany;
-                    while (ri.nextXBand(box)) {
-                        int spanx = box[0];
-                        int spanw = box[2] - spanx;
-                        mgr.copyArea(this, null,
-                                     spanw, 0,
-                                     spanx, spany,
-                                     spanw, spanh,
-                                     fdx, fdy,
-                                     null);
-                    }
-                }
-            }
-            return;
-        }
-        // End Rasterizer for Clip Shape
-
-        getOutputManager().copyArea(this, null,
-                                    r.width, 0,
-                                    r.x, r.y, r.width,
-                                    r.height, fdx, fdy,
-                                    null);
-    }
-    */
-
     public void drawLine(int x1, int y1, int x2, int y2) {
         try {
             drawpipe.drawLine(this, x1, y1, x2, y2);
@@ -2465,8 +2380,8 @@ public final class SunGraphics2D
             if (paintState <= PAINT_ALPHACOLOR) {
                 validateColor();
             }
-            if (composite instanceof XORComposite) {
-                Color c = ((XORComposite) composite).getXorColor();
+            if (composite instanceof XORComposite xorComp) {
+                Color c = xorComp.getXorColor();
                 setComposite(new XORComposite(c, surfaceData));
             }
             validatePipe();
@@ -2668,8 +2583,7 @@ public final class SunGraphics2D
         }
 
         // BufferedImage case: use a simple drawImage call
-        if (img instanceof BufferedImage) {
-            BufferedImage bufImg = (BufferedImage)img;
+        if (img instanceof BufferedImage bufImg) {
             drawImage(bufImg,xform,null);
             return;
         }
@@ -2905,21 +2819,6 @@ public final class SunGraphics2D
         drawRenderedImage(rendering,reverseTransform);
     }
 
-
-
-    /*
-     * Transform the bounding box of the BufferedImage
-     */
-    protected Rectangle transformBounds(Rectangle rect,
-                                        AffineTransform tx) {
-        if (tx.isIdentity()) {
-            return rect;
-        }
-
-        Shape s = transformShape(tx, rect);
-        return s.getBounds();
-    }
-
     // text rendering methods
     public void drawString(String str, int x, int y) {
         if (str == null) {
@@ -3130,13 +3029,12 @@ public final class SunGraphics2D
                     invalidateTransform();
                 }
                 return result;
-            } else if (img instanceof MultiResolutionImage) {
+            } else if (img instanceof MultiResolutionImage mrImage) {
                 // get scaled destination image size
 
                 int width = img.getWidth(observer);
                 int height = img.getHeight(observer);
 
-                MultiResolutionImage mrImage = (MultiResolutionImage) img;
                 Image resolutionVariant = getResolutionVariant(mrImage, width, height,
                                                                dx1, dy1, dx2, dy2,
                                                                sx1, sy1, sx2, sy2,
@@ -3311,8 +3209,7 @@ public final class SunGraphics2D
         Image resolutionVariant
                 = img.getResolutionVariant(destImageWidth, destImageHeight);
 
-        if (resolutionVariant instanceof ToolkitImage
-                && ((ToolkitImage) resolutionVariant).hasError()) {
+        if (resolutionVariant instanceof ToolkitImage tki && tki.hasError()) {
             return null;
         }
 

From ebcfd7d62342c4c9da4d418b9e679d520ab1eb1e Mon Sep 17 00:00:00 2001
From: Mikhail Yankelevich <myankelevich@openjdk.org>
Date: Thu, 12 Mar 2026 17:33:52 +0000
Subject: [PATCH 167/655] 8378267: Test
 sun/security/util/HexDumpEncoderTests.java fails when unexpected warning
 appears

Reviewed-by: weijun
---
 .../security/util/HexDumpEncoderTests.java    | 53 ++++++++++++++-----
 1 file changed, 39 insertions(+), 14 deletions(-)

diff --git a/test/jdk/sun/security/util/HexDumpEncoderTests.java b/test/jdk/sun/security/util/HexDumpEncoderTests.java
index 9ff08cdb192..53f9001ae7a 100644
--- a/test/jdk/sun/security/util/HexDumpEncoderTests.java
+++ b/test/jdk/sun/security/util/HexDumpEncoderTests.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2025, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -27,6 +27,10 @@ import sun.security.util.HexDumpEncoder;
 
 import java.nio.charset.Charset;
 import java.nio.charset.StandardCharsets;
+import java.nio.file.Files;
+import java.nio.file.Path;
+import java.nio.file.Paths;
+import java.nio.file.StandardOpenOption;
 import java.util.Arrays;
 
 /*
@@ -38,7 +42,6 @@ import java.util.Arrays;
  */
 public class HexDumpEncoderTests {
 
-
     private static String[] getTestCommand(final String encoding) {
         return new String[]{
                 "--add-modules", "java.base",
@@ -54,24 +57,34 @@ public class HexDumpEncoderTests {
 
         final var resultIso = ProcessTools.executeTestJava(testCommandIso);
         resultIso.shouldHaveExitValue(0);
+        final String latin1ResultFromFile = Files.readString(
+                Path.of("ISO-8859-1.txt"));
 
-        // This will take all available StandardCharsets and test them all comparing to the ISO_8859_1
-        // Dome im parallel, as this is significantly faster
+        // This will take all available StandardCharsets and test them all
+        // comparing to the ISO_8859_1.
+        // Done im parallel, as this is significantly faster
         Arrays.stream(StandardCharsets.class.getDeclaredFields())
                 .parallel()
                 .forEach(field -> {
-                    if (java.lang.reflect.Modifier.isStatic(field.getModifiers())) {
+                    if (java.lang.reflect.Modifier
+                            .isStatic(field.getModifiers())) {
                         try {
-                            final var charset = (Charset) field.get(StandardCharsets.ISO_8859_1); // getting the charset to test
+                            // getting the charset to test
+                            final var charset = (Charset) field.get(null);
 
-                            final var testCommand = getTestCommand(charset.name());
+                            final var testCommand =
+                                    getTestCommand(charset.name());
 
-                            final var result = ProcessTools.executeTestJava(testCommand);
+                            final var result =
+                                    ProcessTools.executeTestJava(testCommand);
                             result.shouldHaveExitValue(0);
+                            final String resultFromFile = Files.readString(
+                                    Path.of(charset.name()+".txt"));
 
-                            // The outputs of the ISO encoding must be identical to the one tested
-                            Asserts.assertEquals(resultIso.getStdout(),
-                                    result.getStdout(),
+                            // The outputs of the ISO encoding must be identical
+                            // to the one tested
+                            Asserts.assertEquals(latin1ResultFromFile,
+                                    resultFromFile,
                                     "Encoding " + charset.name());
                         } catch (Exception e) {
                             throw new RuntimeException(e);
@@ -86,14 +99,26 @@ public class HexDumpEncoderTests {
          * This will test the encode and encode buffer functions at once,
          * as they are both representing the string in LATIN_1
          * <p>
-         * The output is put as a system.out
+         * The output is put to the file in scratch dir with corresponding
+         * encoding name
          */
         public static void main(String[] args) throws Exception {
 
             final var encoder = new HexDumpEncoder();
 
-            System.out.printf("\nCert Encoded With Encode Buffer: %s\n", encoder.encodeBuffer(new byte[100]));
-            System.out.printf("\nCert Encoded With Encode: %s\n", encoder.encode(new byte[100]));
+            final String encodeBufferResult =
+                    encoder.encodeBuffer(new byte[100]);
+            final String encodeResult = encoder.encode(new byte[100]);
+
+            final String content = String.format("""
+                            Cert Encoded With Encode Buffer: %s
+                            Cert Encoded With Encode: %s""",
+                    encodeBufferResult, encodeResult);
+            Files.writeString(
+                    Paths.get(Charset.defaultCharset().displayName() + ".txt"),
+                    content,
+                    StandardOpenOption.CREATE,
+                    StandardOpenOption.TRUNCATE_EXISTING);
         }
     }
 }

From a6f7089798238e2d0ba5ec168c19acf355403e3d Mon Sep 17 00:00:00 2001
From: Chen Liang <liach@openjdk.org>
Date: Thu, 12 Mar 2026 17:58:06 +0000
Subject: [PATCH 168/655] 8379799: Upstream redundant diffs fixed in Valhalla -
 langtool tests 1

Reviewed-by: vromero
---
 .../combo/tools/javac/combo/CompilationTestCase.java |  6 +++++-
 .../lib/combo/tools/javac/combo/Diagnostics.java     |  8 +++++++-
 .../tools/javac/combo/JavacTemplateTestBase.java     |  8 ++++++++
 .../BridgeShouldHaveNoInteriorAnnotationsTest.java   |  4 ++--
 test/langtools/tools/javac/diags/CheckExamples.java  | 12 +++++++++++-
 .../tools/javac/launcher/SourceLauncherTest.java     |  1 +
 .../tools/javac/patterns/BreakAndLoops.java          |  4 ++--
 .../tools/javac/preview/PreviewAutoSuppress.java     |  8 +++++---
 .../langtools/tools/javac/records/RecordReading.java |  3 +--
 .../tools/javac/recovery/ClassBlockExits.java        |  4 ++--
 test/langtools/tools/javap/T4975569.java             |  3 +--
 11 files changed, 45 insertions(+), 16 deletions(-)

diff --git a/test/langtools/lib/combo/tools/javac/combo/CompilationTestCase.java b/test/langtools/lib/combo/tools/javac/combo/CompilationTestCase.java
index 0760352e23b..c3aa92d1f37 100644
--- a/test/langtools/lib/combo/tools/javac/combo/CompilationTestCase.java
+++ b/test/langtools/lib/combo/tools/javac/combo/CompilationTestCase.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2019, 2023, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2019, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -112,6 +112,10 @@ public class CompilationTestCase extends JavacTemplateTestBase {
         assertCompile(expandMarkers(constructs), () -> assertCompileSucceededWithWarning(warning), false);
     }
 
+    protected void assertOKWithWarning(String warning, int numberOfTimes, String... constructs) {
+        assertCompile(expandMarkers(constructs), () -> assertCompileSucceededWithWarning(warning, numberOfTimes), false);
+    }
+
     protected void assertFail(String expectedDiag, String... constructs) {
         assertCompile(expandMarkers(constructs), () -> assertCompileFailed(expectedDiag), false);
     }
diff --git a/test/langtools/lib/combo/tools/javac/combo/Diagnostics.java b/test/langtools/lib/combo/tools/javac/combo/Diagnostics.java
index 47f496b5891..87ee54b375a 100644
--- a/test/langtools/lib/combo/tools/javac/combo/Diagnostics.java
+++ b/test/langtools/lib/combo/tools/javac/combo/Diagnostics.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2013, 2020, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2013, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -84,6 +84,12 @@ public class Diagnostics implements javax.tools.DiagnosticListener<JavaFileObjec
                     .anyMatch(d -> d.getCode().equals(key));
     }
 
+    public boolean containsWarningKey(String key, int numberOfWarnings) {
+        return diags.stream()
+                .filter(d -> d.getKind() == Diagnostic.Kind.WARNING || d.getKind() == Diagnostic.Kind.MANDATORY_WARNING)
+                .filter(d -> d.getCode().equals(key)).count() == numberOfWarnings;
+    }
+
     /** Get the error keys */
     public List<String> errorKeys() {
         return diags.stream()
diff --git a/test/langtools/lib/combo/tools/javac/combo/JavacTemplateTestBase.java b/test/langtools/lib/combo/tools/javac/combo/JavacTemplateTestBase.java
index ed5936210a8..3b4b67e7968 100644
--- a/test/langtools/lib/combo/tools/javac/combo/JavacTemplateTestBase.java
+++ b/test/langtools/lib/combo/tools/javac/combo/JavacTemplateTestBase.java
@@ -154,6 +154,14 @@ public abstract class JavacTemplateTestBase {
         }
     }
 
+    protected void assertCompileSucceededWithWarning(String warning, int numberOfWarnings) {
+        if (diags.errorsFound())
+            fail("Expected successful compilation");
+        if (!diags.containsWarningKey(warning, numberOfWarnings)) {
+            fail(String.format("Expected compilation warning with %s, found %s", warning, diags.keys()));
+        }
+    }
+
     /**
      * If the provided boolean is true, assert all previous compiles succeeded,
      * otherwise assert that a compile failed.
diff --git a/test/langtools/tools/javac/annotations/typeAnnotations/classfile/BridgeShouldHaveNoInteriorAnnotationsTest.java b/test/langtools/tools/javac/annotations/typeAnnotations/classfile/BridgeShouldHaveNoInteriorAnnotationsTest.java
index 0ec1a790d72..3426bfedd30 100644
--- a/test/langtools/tools/javac/annotations/typeAnnotations/classfile/BridgeShouldHaveNoInteriorAnnotationsTest.java
+++ b/test/langtools/tools/javac/annotations/typeAnnotations/classfile/BridgeShouldHaveNoInteriorAnnotationsTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2016, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2016, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -71,7 +71,7 @@ public class BridgeShouldHaveNoInteriorAnnotationsTest
     };
 
 
-    // Expected output can't be directly encoded into NestedLambdasCastedTest !!!
+    // Expected output can't be directly encoded into BridgeShouldHaveNoInteriorAnnotationsTest !!!
     static class OutputExpectedOnceHolder {
         public String[] outputs = {
             "0: #120(): CAST, offset=1, type_index=0, location=[TYPE_ARGUMENT(0)]",
diff --git a/test/langtools/tools/javac/diags/CheckExamples.java b/test/langtools/tools/javac/diags/CheckExamples.java
index 502f5fa8b88..7a188614080 100644
--- a/test/langtools/tools/javac/diags/CheckExamples.java
+++ b/test/langtools/tools/javac/diags/CheckExamples.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2010, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2010, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -45,12 +45,22 @@ import java.util.*;
 
 /**
  * Check invariants for a set of examples.
+ *
+ * READ THIS IF THIS TEST FAILS AFTER ADDING A NEW KEY TO 'compiler.properties':
+ * The 'examples' subdirectory contains a number of examples which provoke
+ * the reporting of most of the compiler message keys.
+ *
  * -- each example should exactly declare the keys that will be generated when
  *      it is run.
+ * -- this is done by the "// key:"-comment in each fine.
  * -- together, the examples should cover the set of resource keys in the
  *      compiler.properties bundle. A list of exceptions may be given in the
  *      not-yet.txt file. Entries on the not-yet.txt list should not be
  *      covered by examples.
+ * -- some keys are only reported by the compiler when specific options are
+ *      supplied. For the purposes of this test, this can be specified by a
+ *      comment e.g. like this: "// options: -Xlint:empty"
+ *
  * When new keys are added to the resource bundle, it is strongly recommended
  * that corresponding new examples be added here, if at all practical, instead
  * of simply and lazily being added to the not-yet.txt list.
diff --git a/test/langtools/tools/javac/launcher/SourceLauncherTest.java b/test/langtools/tools/javac/launcher/SourceLauncherTest.java
index c3c8fb19a1b..d0cf11a0327 100644
--- a/test/langtools/tools/javac/launcher/SourceLauncherTest.java
+++ b/test/langtools/tools/javac/launcher/SourceLauncherTest.java
@@ -670,6 +670,7 @@ public class SourceLauncherTest extends TestRunner {
         tb.writeJavaFiles(base, "public class Main { public static void main(String... args) {}}");
         String log = new JavaTask(tb)
                 .vmOptions("--source", "21")
+                .includeStandardOptions(false) // Do not inherit --enable-preview
                 .className(base.resolve("Main.java").toString())
                 .run(Task.Expect.SUCCESS)
                 .getOutput(Task.OutputKind.STDERR);
diff --git a/test/langtools/tools/javac/patterns/BreakAndLoops.java b/test/langtools/tools/javac/patterns/BreakAndLoops.java
index 31ad8908f53..777d5ae4f42 100644
--- a/test/langtools/tools/javac/patterns/BreakAndLoops.java
+++ b/test/langtools/tools/javac/patterns/BreakAndLoops.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2019, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2019, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -237,4 +237,4 @@ public class BreakAndLoops extends ComboInstance<BreakAndLoops> {
             return code;
         }
     }
-}
\ No newline at end of file
+}
diff --git a/test/langtools/tools/javac/preview/PreviewAutoSuppress.java b/test/langtools/tools/javac/preview/PreviewAutoSuppress.java
index 058ccdf0a2a..f2096aff648 100644
--- a/test/langtools/tools/javac/preview/PreviewAutoSuppress.java
+++ b/test/langtools/tools/javac/preview/PreviewAutoSuppress.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2021, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2021, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -44,6 +44,8 @@ import java.nio.file.Paths;
 import java.util.List;
 
 public class PreviewAutoSuppress extends TestRunner {
+    // Major version number (e.g. '27').
+    private static final String FEATURE_VERSION = String.valueOf(Runtime.version().feature());
 
     protected ToolBox tb;
 
@@ -83,7 +85,7 @@ public class PreviewAutoSuppress extends TestRunner {
         List<String> log = new JavacTask(tb, Task.Mode.CMDLINE)
                 .outdir(classes)
                 .options("--enable-preview",
-                         "-source", String.valueOf(Runtime.version().feature()),
+                         "-source", FEATURE_VERSION,
                          "-Xlint:preview",
                          "-XDforcePreview",
                          "-XDrawDiagnostics")
@@ -182,7 +184,7 @@ public class PreviewAutoSuppress extends TestRunner {
                          "--add-exports", "java.base/preview.api=ALL-UNNAMED",
                          "--enable-preview",
                          "-Xlint:preview",
-                         "-source", String.valueOf(Runtime.version().feature()),
+                         "-source", FEATURE_VERSION,
                          "-XDrawDiagnostics")
                 .files(tb.findJavaFiles(testSrc))
                 .run()
diff --git a/test/langtools/tools/javac/records/RecordReading.java b/test/langtools/tools/javac/records/RecordReading.java
index 6133a04fca9..e57a7f77ceb 100644
--- a/test/langtools/tools/javac/records/RecordReading.java
+++ b/test/langtools/tools/javac/records/RecordReading.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2020, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -31,7 +31,6 @@
  * @run main RecordReading
  */
 
-
 import java.io.IOException;
 import java.nio.file.Files;
 import java.nio.file.Path;
diff --git a/test/langtools/tools/javac/recovery/ClassBlockExits.java b/test/langtools/tools/javac/recovery/ClassBlockExits.java
index b1c54b456ae..3ac04cbe991 100644
--- a/test/langtools/tools/javac/recovery/ClassBlockExits.java
+++ b/test/langtools/tools/javac/recovery/ClassBlockExits.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2020, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -138,4 +138,4 @@ public class ClassBlockExits extends ComboInstance<ClassBlockExits> {
             return code;
         }
     }
-}
\ No newline at end of file
+}
diff --git a/test/langtools/tools/javap/T4975569.java b/test/langtools/tools/javap/T4975569.java
index c43598b41db..ce75ba84586 100644
--- a/test/langtools/tools/javap/T4975569.java
+++ b/test/langtools/tools/javap/T4975569.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2008, 2016, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2008, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -105,4 +105,3 @@ public class T4975569 {
     protected class Prot { }
     private class Priv { int i; }
 }
-

From 618a3feea9d46b38822a1d52b93ba2d12b34e000 Mon Sep 17 00:00:00 2001
From: Patricio Chilano Mateo <pchilanomate@openjdk.org>
Date: Thu, 12 Mar 2026 18:22:32 +0000
Subject: [PATCH 169/655] 8379795: Test SuspendResume3.java can timeout due to
 deadlock

Reviewed-by: dholmes, sspitsyn
---
 .../SuspendResume3/SuspendResume3.java        | 27 ++++++++++++++++++-
 1 file changed, 26 insertions(+), 1 deletion(-)

diff --git a/test/hotspot/jtreg/serviceability/jvmti/vthread/SuspendResume3/SuspendResume3.java b/test/hotspot/jtreg/serviceability/jvmti/vthread/SuspendResume3/SuspendResume3.java
index fbc9ff2d5b3..ae49ce29ed3 100644
--- a/test/hotspot/jtreg/serviceability/jvmti/vthread/SuspendResume3/SuspendResume3.java
+++ b/test/hotspot/jtreg/serviceability/jvmti/vthread/SuspendResume3/SuspendResume3.java
@@ -35,6 +35,11 @@ import java.time.Instant;
 import java.util.concurrent.CountDownLatch;
 import java.util.concurrent.Phaser;
 
+import java.lang.management.LockInfo;
+import java.lang.management.ManagementFactory;
+import java.lang.management.ThreadInfo;
+import java.lang.management.ThreadMXBean;
+
 import jvmti.JVMTIUtils;
 
 public class SuspendResume3 {
@@ -88,7 +93,12 @@ public class SuspendResume3 {
             w1Sync1.arriveAndAwaitAdvance();
             // Let worker2 block on monitor
             w2Sync1.arriveAndAwaitAdvance();
-            await(worker2, Thread.State.BLOCKED);
+            // Wait until worker2 blocks trying to acquire lock. We can't just check
+            // for a BLOCKED state because method arriveAndAwaitAdvance might involve
+            // extra class loading/initialization where worker2 could be seen as BLOCKED
+            // and thus be suspended below. If the main thread then tries to access those
+            // same classes before resuming worker2 the test would deadlock.
+            awaitBlockedOnLock(worker2);
 
             // Suspend worker2
             JVMTIUtils.suspendThread(worker2);
@@ -144,6 +154,21 @@ public class SuspendResume3 {
         }
     }
 
+    /**
+     * Waits for the given thread to block trying to acquire lock's monitor.
+     */
+    private void awaitBlockedOnLock(Thread thread) throws InterruptedException {
+        while (true) {
+            ThreadInfo threadInfo = ManagementFactory.getThreadMXBean().getThreadInfo(thread.threadId());
+            assertTrue(threadInfo != null, "getThreadInfo() failed");
+            LockInfo lockInfo = threadInfo.getLockInfo();
+            if (lockInfo != null && lockInfo.getIdentityHashCode() == System.identityHashCode(lock)) {
+                break;
+            }
+            Thread.sleep(10);
+        }
+    }
+
     private static void assertTrue(boolean condition, String msg) {
         if (!condition) {
             throw new RuntimeException(msg);

From e25969121e7da25f648473ebf169538b92e6e6b5 Mon Sep 17 00:00:00 2001
From: Phil Race <prr@openjdk.org>
Date: Thu, 12 Mar 2026 19:54:23 +0000
Subject: [PATCH 170/655] 8379937: NullActiveWindowOnFocusLost.java fails
 intermittently.

Reviewed-by: azvegint
---
 .../NullActiveWindowOnFocusLost.java          | 83 -------------------
 1 file changed, 83 deletions(-)
 delete mode 100644 test/jdk/java/awt/Focus/NullActiveWindowOnFocusLost/NullActiveWindowOnFocusLost.java

diff --git a/test/jdk/java/awt/Focus/NullActiveWindowOnFocusLost/NullActiveWindowOnFocusLost.java b/test/jdk/java/awt/Focus/NullActiveWindowOnFocusLost/NullActiveWindowOnFocusLost.java
deleted file mode 100644
index 0924413bec4..00000000000
--- a/test/jdk/java/awt/Focus/NullActiveWindowOnFocusLost/NullActiveWindowOnFocusLost.java
+++ /dev/null
@@ -1,83 +0,0 @@
-/*
- * Copyright (c) 2018, 2019, Oracle and/or its affiliates. All rights reserved.
- * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
- *
- * This code is free software; you can redistribute it and/or modify it
- * under the terms of the GNU General Public License version 2 only, as
- * published by the Free Software Foundation.
- *
- * This code is distributed in the hope that it will be useful, but WITHOUT
- * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
- * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
- * version 2 for more details (a copy is included in the LICENSE file that
- * accompanied this code).
- *
- * You should have received a copy of the GNU General Public License version
- * 2 along with this work; if not, write to the Free Software Foundation,
- * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
- *
- * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
- * or visit www.oracle.com if you need additional information or have any
- * questions.
- */
-
-import java.awt.Button;
-import java.awt.Frame;
-import java.util.concurrent.TimeUnit;
-
-import sun.awt.SunToolkit;
-
-/**
- * @test
- * @key headful
- * @bug 8211435
- * @modules java.desktop/sun.awt
- */
-public final class NullActiveWindowOnFocusLost {
-
-    private static volatile long endtime;
-    private static Throwable failed;
-
-    public static void main(final String[] args) throws Exception {
-        // Will run the test no more than 30 seconds
-        endtime = System.nanoTime() + TimeUnit.SECONDS.toNanos(30);
-        Thread.setDefaultUncaughtExceptionHandler((t, e) -> failed = e);
-
-        final Thread[] threads = new Thread[20];
-        for (int i = 0; i < threads.length; i++) {
-            threads[i] = testThread(i);
-        }
-        for (final Thread thread : threads) {
-            thread.start();
-        }
-        for (final Thread thread : threads) {
-            thread.join();
-        }
-        if (failed != null) {
-            failed.printStackTrace();
-            throw new RuntimeException(failed);
-        }
-    }
-
-    private static Thread testThread(int index) {
-        return new Thread(new ThreadGroup("TG " + index), () -> {
-            SunToolkit.createNewAppContext();
-            while (!isComplete()) {
-                final Frame frame = new Frame();
-                frame.setSize(300, 300);
-                frame.add(new Button("Button"));
-                frame.setLocationRelativeTo(null);
-                frame.setVisible(true);
-                try {
-                    Thread.sleep(index); // increase probability of the failure
-                } catch (InterruptedException ignored) {
-                }
-                frame.dispose();
-            }
-        });
-    }
-
-    private static boolean isComplete() {
-        return endtime - System.nanoTime() < 0 || failed != null;
-    }
-}

From d190c445c53537368b921af75494a1f38bf24f2c Mon Sep 17 00:00:00 2001
From: Naoto Sato <naoto@openjdk.org>
Date: Thu, 12 Mar 2026 20:37:41 +0000
Subject: [PATCH 171/655] 8379558: Test 
 java/util/ResourceBundle/modules/basic/BasicTest.java times out on
 windows-x64 in Xcomp mode

Reviewed-by: iris
---
 .../java/util/ResourceBundle/modules/basic/BasicTest.java   | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/test/jdk/java/util/ResourceBundle/modules/basic/BasicTest.java b/test/jdk/java/util/ResourceBundle/modules/basic/BasicTest.java
index c17c4622ecb..2dda740aaf9 100644
--- a/test/jdk/java/util/ResourceBundle/modules/basic/BasicTest.java
+++ b/test/jdk/java/util/ResourceBundle/modules/basic/BasicTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2015, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2015, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -43,7 +43,7 @@
  *        jdk.test.lib.compiler.CompilerUtils
  *        jdk.test.lib.process.ProcessTools
  *        ModuleTestUtil
- * @run junit BasicTest
+ * @run junit/timeout=200 BasicTest
  */
 
 import java.nio.file.Path;
@@ -206,4 +206,4 @@ public class BasicTest {
         assertEquals(exitCode, 0, "Create extra_modlocal.jar failed. "
                 + "Unexpected exit code: " + exitCode);
     }
-}
\ No newline at end of file
+}

From 579a3dfc7617f0b06defe9d55f5ae3c92819b0ba Mon Sep 17 00:00:00 2001
From: Alexey Semenyuk <asemenyuk@openjdk.org>
Date: Thu, 12 Mar 2026 22:43:12 +0000
Subject: [PATCH 172/655] 8379938: [macos] jpackage SigningPackageTest test
 doesn't create .pkg and .dmg bundles

Reviewed-by: almatvee
---
 test/jdk/tools/jpackage/macosx/SigningPackageTest.java | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/test/jdk/tools/jpackage/macosx/SigningPackageTest.java b/test/jdk/tools/jpackage/macosx/SigningPackageTest.java
index d1c17fb61cd..cc2e7026d72 100644
--- a/test/jdk/tools/jpackage/macosx/SigningPackageTest.java
+++ b/test/jdk/tools/jpackage/macosx/SigningPackageTest.java
@@ -65,7 +65,7 @@ import jdk.jpackage.test.PackageType;
  * @run main/othervm/timeout=720 -Xmx512m jdk.jpackage.test.Main
  *  --jpt-run=SigningPackageTest.test
  *  --jpt-space-subst=*
- *  --jpt-include=({--mac-signing-key-user-name:*CODESIGN},*{--mac-signing-key-user-name:*PKG},*MAC_DMG+MAC_PKG)
+ *  --jpt-include=({KEY_USER_NAME:*CODESIGN},*{KEY_USER_NAME:*PKG},*MAC_DMG+MAC_PKG)
  *  --jpt-before-run=SigningBase.verifySignTestEnvReady
  */
 

From 30be9c1cb25e119f3abfe1ab0be824a3320f7287 Mon Sep 17 00:00:00 2001
From: Sergey Bylokhov <serb@openjdk.org>
Date: Thu, 12 Mar 2026 23:46:46 +0000
Subject: [PATCH 173/655] 8378885: Add missing @Override annotations in
 "javax.print.attribute.standard" package part 2

Reviewed-by: prr
---
 .../classes/javax/print/attribute/standard/Media.java  |  5 ++++-
 .../javax/print/attribute/standard/MediaName.java      |  4 +++-
 .../print/attribute/standard/MediaPrintableArea.java   |  7 ++++++-
 .../javax/print/attribute/standard/MediaSize.java      |  5 ++++-
 .../javax/print/attribute/standard/MediaSizeName.java  |  4 +++-
 .../javax/print/attribute/standard/MediaTray.java      |  4 +++-
 .../attribute/standard/MultipleDocumentHandling.java   |  6 +++++-
 .../print/attribute/standard/NumberOfDocuments.java    |  5 ++++-
 .../attribute/standard/NumberOfInterveningJobs.java    |  5 ++++-
 .../javax/print/attribute/standard/NumberUp.java       |  5 ++++-
 .../print/attribute/standard/NumberUpSupported.java    |  5 ++++-
 .../print/attribute/standard/OrientationRequested.java |  7 ++++++-
 .../print/attribute/standard/OutputDeviceAssigned.java |  5 ++++-
 .../print/attribute/standard/PDLOverrideSupported.java |  6 +++++-
 .../javax/print/attribute/standard/PageRanges.java     |  5 ++++-
 .../javax/print/attribute/standard/PagesPerMinute.java |  5 ++++-
 .../print/attribute/standard/PagesPerMinuteColor.java  |  5 ++++-
 .../attribute/standard/PresentationDirection.java      |  6 +++++-
 .../javax/print/attribute/standard/PrintQuality.java   |  7 ++++++-
 .../javax/print/attribute/standard/PrinterInfo.java    |  5 ++++-
 .../attribute/standard/PrinterIsAcceptingJobs.java     |  6 +++++-
 .../print/attribute/standard/PrinterLocation.java      |  5 ++++-
 .../print/attribute/standard/PrinterMakeAndModel.java  |  5 ++++-
 .../attribute/standard/PrinterMessageFromOperator.java |  5 ++++-
 .../print/attribute/standard/PrinterMoreInfo.java      |  5 ++++-
 .../standard/PrinterMoreInfoManufacturer.java          |  5 ++++-
 .../javax/print/attribute/standard/PrinterName.java    |  5 ++++-
 .../print/attribute/standard/PrinterResolution.java    |  5 ++++-
 .../javax/print/attribute/standard/PrinterState.java   |  6 +++++-
 .../print/attribute/standard/PrinterStateReason.java   |  6 +++++-
 .../print/attribute/standard/PrinterStateReasons.java  | 10 +++++++++-
 .../javax/print/attribute/standard/PrinterURI.java     |  5 ++++-
 .../javax/print/attribute/standard/QueuedJobCount.java |  5 ++++-
 .../standard/ReferenceUriSchemesSupported.java         |  6 +++++-
 .../print/attribute/standard/RequestingUserName.java   |  5 ++++-
 .../javax/print/attribute/standard/Severity.java       |  6 +++++-
 .../javax/print/attribute/standard/SheetCollate.java   |  6 +++++-
 .../classes/javax/print/attribute/standard/Sides.java  |  6 +++++-
 38 files changed, 170 insertions(+), 38 deletions(-)

diff --git a/src/java.desktop/share/classes/javax/print/attribute/standard/Media.java b/src/java.desktop/share/classes/javax/print/attribute/standard/Media.java
index 6b62f1dbecd..0cb9a4c30c5 100644
--- a/src/java.desktop/share/classes/javax/print/attribute/standard/Media.java
+++ b/src/java.desktop/share/classes/javax/print/attribute/standard/Media.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2000, 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2000, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -89,6 +89,7 @@ public abstract class Media extends EnumSyntax
      * @return {@code true} if {@code object} is equivalent to this media
      *         attribute, {@code false} otherwise
      */
+    @Override
     public boolean equals(Object object) {
         return object instanceof Media other &&
                 object.getClass() == this.getClass() &&
@@ -105,6 +106,7 @@ public abstract class Media extends EnumSyntax
      * @return printing attribute class (category), an instance of class
      *         {@link Class java.lang.Class}
      */
+    @Override
     public final Class<? extends Attribute> getCategory() {
         return Media.class;
     }
@@ -118,6 +120,7 @@ public abstract class Media extends EnumSyntax
      *
      * @return attribute category name
      */
+    @Override
     public final String getName() {
         return "media";
     }
diff --git a/src/java.desktop/share/classes/javax/print/attribute/standard/MediaName.java b/src/java.desktop/share/classes/javax/print/attribute/standard/MediaName.java
index 9c1b4060a34..4adb2839759 100644
--- a/src/java.desktop/share/classes/javax/print/attribute/standard/MediaName.java
+++ b/src/java.desktop/share/classes/javax/print/attribute/standard/MediaName.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2000, 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2000, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -107,6 +107,7 @@ public class MediaName extends Media implements Attribute {
      *
      * @return the string table
      */
+    @Override
     protected String[] getStringTable()
     {
         return myStringTable.clone();
@@ -117,6 +118,7 @@ public class MediaName extends Media implements Attribute {
      *
      * @return the enumeration value table
      */
+    @Override
     protected EnumSyntax[] getEnumValueTable() {
         return (EnumSyntax[])myEnumValueTable.clone();
     }
diff --git a/src/java.desktop/share/classes/javax/print/attribute/standard/MediaPrintableArea.java b/src/java.desktop/share/classes/javax/print/attribute/standard/MediaPrintableArea.java
index 72a58f2b697..a9cc2bba195 100644
--- a/src/java.desktop/share/classes/javax/print/attribute/standard/MediaPrintableArea.java
+++ b/src/java.desktop/share/classes/javax/print/attribute/standard/MediaPrintableArea.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2000, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2000, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -241,6 +241,7 @@ public final class MediaPrintableArea
      * @return {@code true} if {@code object} is equivalent to this media
      *         margins attribute, {@code false} otherwise
      */
+    @Override
     public boolean equals(Object object) {
         boolean ret = false;
         if (object instanceof MediaPrintableArea) {
@@ -262,6 +263,7 @@ public final class MediaPrintableArea
      * @return printing attribute class (category), an instance of class
      *         {@link Class java.lang.Class}
      */
+    @Override
     public final Class<? extends Attribute> getCategory() {
         return MediaPrintableArea.class;
     }
@@ -277,6 +279,7 @@ public final class MediaPrintableArea
      *
      * @return attribute category name
      */
+    @Override
     public final String getName() {
         return "media-printable-area";
     }
@@ -304,6 +307,7 @@ public final class MediaPrintableArea
     /**
      * Returns a string version of this rectangular size attribute in mm.
      */
+    @Override
     public String toString() {
         return(toString(MM, "mm"));
     }
@@ -311,6 +315,7 @@ public final class MediaPrintableArea
     /**
      * Returns a hash code value for this attribute.
      */
+    @Override
     public int hashCode() {
         return x + 37*y + 43*w + 47*h;
     }
diff --git a/src/java.desktop/share/classes/javax/print/attribute/standard/MediaSize.java b/src/java.desktop/share/classes/javax/print/attribute/standard/MediaSize.java
index 6a8db3b94c2..57c0d305809 100644
--- a/src/java.desktop/share/classes/javax/print/attribute/standard/MediaSize.java
+++ b/src/java.desktop/share/classes/javax/print/attribute/standard/MediaSize.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2000, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2000, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -243,6 +243,7 @@ public class MediaSize extends Size2DSyntax implements Attribute {
      * @return {@code true} if {@code object} is equivalent to this media size
      *         attribute, {@code false} otherwise
      */
+    @Override
     public boolean equals(Object object) {
         return (super.equals(object) && object instanceof MediaSize);
     }
@@ -257,6 +258,7 @@ public class MediaSize extends Size2DSyntax implements Attribute {
      * @return printing attribute class (category), an instance of class
      *         {@link Class java.lang.Class}
      */
+    @Override
     public final Class<? extends Attribute> getCategory() {
         return MediaSize.class;
     }
@@ -270,6 +272,7 @@ public class MediaSize extends Size2DSyntax implements Attribute {
      *
      * @return attribute category name
      */
+    @Override
     public final String getName() {
         return "media-size";
     }
diff --git a/src/java.desktop/share/classes/javax/print/attribute/standard/MediaSizeName.java b/src/java.desktop/share/classes/javax/print/attribute/standard/MediaSizeName.java
index f9dde495610..52b60b046bf 100644
--- a/src/java.desktop/share/classes/javax/print/attribute/standard/MediaSizeName.java
+++ b/src/java.desktop/share/classes/javax/print/attribute/standard/MediaSizeName.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2000, 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2000, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -608,6 +608,7 @@ public class MediaSizeName extends Media {
     /**
      * Returns the string table for class {@code MediaSizeName}.
      */
+    @Override
     protected String[] getStringTable()
     {
         return myStringTable.clone();
@@ -616,6 +617,7 @@ public class MediaSizeName extends Media {
     /**
      * Returns the enumeration value table for class {@code MediaSizeName}.
      */
+    @Override
     protected EnumSyntax[] getEnumValueTable() {
         return (EnumSyntax[])myEnumValueTable.clone();
     }
diff --git a/src/java.desktop/share/classes/javax/print/attribute/standard/MediaTray.java b/src/java.desktop/share/classes/javax/print/attribute/standard/MediaTray.java
index 138aae6248a..bc20cbb8901 100644
--- a/src/java.desktop/share/classes/javax/print/attribute/standard/MediaTray.java
+++ b/src/java.desktop/share/classes/javax/print/attribute/standard/MediaTray.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2000, 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2000, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -132,6 +132,7 @@ public class MediaTray extends Media implements Attribute {
     /**
      * Returns the string table for class {@code MediaTray}.
      */
+    @Override
     protected String[] getStringTable()
     {
         return myStringTable.clone();
@@ -140,6 +141,7 @@ public class MediaTray extends Media implements Attribute {
     /**
      * Returns the enumeration value table for class {@code MediaTray}.
      */
+    @Override
     protected EnumSyntax[] getEnumValueTable() {
         return (EnumSyntax[])myEnumValueTable.clone();
     }
diff --git a/src/java.desktop/share/classes/javax/print/attribute/standard/MultipleDocumentHandling.java b/src/java.desktop/share/classes/javax/print/attribute/standard/MultipleDocumentHandling.java
index 6d12597c88a..4937f379684 100644
--- a/src/java.desktop/share/classes/javax/print/attribute/standard/MultipleDocumentHandling.java
+++ b/src/java.desktop/share/classes/javax/print/attribute/standard/MultipleDocumentHandling.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2000, 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2000, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -219,6 +219,7 @@ public class MultipleDocumentHandling extends EnumSyntax
     /**
      * Returns the string table for class {@code MultipleDocumentHandling}.
      */
+    @Override
     protected String[] getStringTable() {
         return myStringTable.clone();
     }
@@ -227,6 +228,7 @@ public class MultipleDocumentHandling extends EnumSyntax
      * Returns the enumeration value table for class
      * {@code MultipleDocumentHandling}.
      */
+    @Override
     protected EnumSyntax[] getEnumValueTable() {
         return (EnumSyntax[])myEnumValueTable.clone();
     }
@@ -242,6 +244,7 @@ public class MultipleDocumentHandling extends EnumSyntax
      * @return printing attribute class (category), an instance of class
      *         {@link Class java.lang.Class}
      */
+    @Override
     public final Class<? extends Attribute> getCategory() {
         return MultipleDocumentHandling.class;
     }
@@ -255,6 +258,7 @@ public class MultipleDocumentHandling extends EnumSyntax
      *
      * @return attribute category name
      */
+    @Override
     public final String getName() {
         return "multiple-document-handling";
     }
diff --git a/src/java.desktop/share/classes/javax/print/attribute/standard/NumberOfDocuments.java b/src/java.desktop/share/classes/javax/print/attribute/standard/NumberOfDocuments.java
index 18b8144fb89..901907620f9 100644
--- a/src/java.desktop/share/classes/javax/print/attribute/standard/NumberOfDocuments.java
+++ b/src/java.desktop/share/classes/javax/print/attribute/standard/NumberOfDocuments.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2000, 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2000, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -77,6 +77,7 @@ public final class NumberOfDocuments extends IntegerSyntax
      * @return {@code true} if {@code object} is equivalent to this number of
      *         documents attribute, {@code false} otherwise
      */
+    @Override
     public boolean equals(Object object) {
         return (super.equals (object) &&
                 object instanceof NumberOfDocuments);
@@ -92,6 +93,7 @@ public final class NumberOfDocuments extends IntegerSyntax
      * @return printing attribute class (category), an instance of class
      *         {@link Class java.lang.Class}
      */
+    @Override
     public final Class<? extends Attribute> getCategory() {
         return NumberOfDocuments.class;
     }
@@ -105,6 +107,7 @@ public final class NumberOfDocuments extends IntegerSyntax
      *
      * @return attribute category name
      */
+    @Override
     public final String getName() {
         return "number-of-documents";
     }
diff --git a/src/java.desktop/share/classes/javax/print/attribute/standard/NumberOfInterveningJobs.java b/src/java.desktop/share/classes/javax/print/attribute/standard/NumberOfInterveningJobs.java
index 54cb4b85e7a..480de3b1b47 100644
--- a/src/java.desktop/share/classes/javax/print/attribute/standard/NumberOfInterveningJobs.java
+++ b/src/java.desktop/share/classes/javax/print/attribute/standard/NumberOfInterveningJobs.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2000, 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2000, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -78,6 +78,7 @@ public final class NumberOfInterveningJobs extends IntegerSyntax
      * @return {@code true} if {@code object} is equivalent to this number of
      *         intervening jobs attribute, {@code false} otherwise
      */
+    @Override
     public boolean equals(Object object) {
         return (super.equals (object) &&
                 object instanceof NumberOfInterveningJobs);
@@ -93,6 +94,7 @@ public final class NumberOfInterveningJobs extends IntegerSyntax
      * @return printing attribute class (category), an instance of class
      *         {@link Class java.lang.Class}
      */
+    @Override
     public final Class<? extends Attribute> getCategory() {
         return NumberOfInterveningJobs.class;
     }
@@ -106,6 +108,7 @@ public final class NumberOfInterveningJobs extends IntegerSyntax
      *
      * @return attribute category name
      */
+    @Override
     public final String getName() {
         return "number-of-intervening-jobs";
     }
diff --git a/src/java.desktop/share/classes/javax/print/attribute/standard/NumberUp.java b/src/java.desktop/share/classes/javax/print/attribute/standard/NumberUp.java
index b3aabbc6cfd..0b019346c8e 100644
--- a/src/java.desktop/share/classes/javax/print/attribute/standard/NumberUp.java
+++ b/src/java.desktop/share/classes/javax/print/attribute/standard/NumberUp.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2000, 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2000, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -145,6 +145,7 @@ public final class NumberUp extends IntegerSyntax
      * @return {@code true} if {@code object} is equivalent to this number up
      *         attribute, {@code false} otherwise
      */
+    @Override
     public boolean equals(Object object) {
         return (super.equals(object) && object instanceof NumberUp);
     }
@@ -159,6 +160,7 @@ public final class NumberUp extends IntegerSyntax
      * @return printing attribute class (category), an instance of class
      *         {@link Class java.lang.Class}
      */
+    @Override
     public final Class<? extends Attribute> getCategory() {
         return NumberUp.class;
     }
@@ -171,6 +173,7 @@ public final class NumberUp extends IntegerSyntax
      *
      * @return attribute category name
      */
+    @Override
     public final String getName() {
         return "number-up";
     }
diff --git a/src/java.desktop/share/classes/javax/print/attribute/standard/NumberUpSupported.java b/src/java.desktop/share/classes/javax/print/attribute/standard/NumberUpSupported.java
index dfb79835e0f..cef65ed17a3 100644
--- a/src/java.desktop/share/classes/javax/print/attribute/standard/NumberUpSupported.java
+++ b/src/java.desktop/share/classes/javax/print/attribute/standard/NumberUpSupported.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2000, 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2000, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -136,6 +136,7 @@ public final class NumberUpSupported    extends SetOfIntegerSyntax
      * @return {@code true} if {@code object} is equivalent to this number up
      *         supported attribute, {@code false} otherwise
      */
+    @Override
     public boolean equals(Object object) {
         return (super.equals (object) &&
                 object instanceof NumberUpSupported);
@@ -151,6 +152,7 @@ public final class NumberUpSupported    extends SetOfIntegerSyntax
      * @return printing attribute class (category), an instance of class
      *         {@link Class java.lang.Class}
      */
+    @Override
     public final Class<? extends Attribute> getCategory() {
         return NumberUpSupported.class;
     }
@@ -164,6 +166,7 @@ public final class NumberUpSupported    extends SetOfIntegerSyntax
      *
      * @return attribute category name
      */
+    @Override
     public final String getName() {
         return "number-up-supported";
     }
diff --git a/src/java.desktop/share/classes/javax/print/attribute/standard/OrientationRequested.java b/src/java.desktop/share/classes/javax/print/attribute/standard/OrientationRequested.java
index 253adfe1ff1..00e3de4a1de 100644
--- a/src/java.desktop/share/classes/javax/print/attribute/standard/OrientationRequested.java
+++ b/src/java.desktop/share/classes/javax/print/attribute/standard/OrientationRequested.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2000, 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2000, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -150,6 +150,7 @@ public final class OrientationRequested extends EnumSyntax
     /**
      * Returns the string table for class {@code OrientationRequested}.
      */
+    @Override
     protected String[] getStringTable() {
         return myStringTable;
     }
@@ -158,6 +159,7 @@ public final class OrientationRequested extends EnumSyntax
      * Returns the enumeration value table for class
      * {@code OrientationRequested}.
      */
+    @Override
     protected EnumSyntax[] getEnumValueTable() {
         return myEnumValueTable;
     }
@@ -166,6 +168,7 @@ public final class OrientationRequested extends EnumSyntax
      * Returns the lowest integer value used by class
      * {@code OrientationRequested}.
      */
+    @Override
     protected int getOffset() {
         return 3;
     }
@@ -180,6 +183,7 @@ public final class OrientationRequested extends EnumSyntax
      * @return printing attribute class (category), an instance of class
      *         {@link Class java.lang.Class}
      */
+    @Override
     public final Class<? extends Attribute> getCategory() {
         return OrientationRequested.class;
     }
@@ -193,6 +197,7 @@ public final class OrientationRequested extends EnumSyntax
      *
      * @return attribute category name
      */
+    @Override
     public final String getName() {
         return "orientation-requested";
     }
diff --git a/src/java.desktop/share/classes/javax/print/attribute/standard/OutputDeviceAssigned.java b/src/java.desktop/share/classes/javax/print/attribute/standard/OutputDeviceAssigned.java
index c94a105e92d..bea5cd35060 100644
--- a/src/java.desktop/share/classes/javax/print/attribute/standard/OutputDeviceAssigned.java
+++ b/src/java.desktop/share/classes/javax/print/attribute/standard/OutputDeviceAssigned.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2000, 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2000, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -92,6 +92,7 @@ public final class OutputDeviceAssigned extends TextSyntax
      * @return {@code true} if {@code object} is equivalent to this output
      *         device assigned attribute, {@code false} otherwise
      */
+    @Override
     public boolean equals(Object object) {
         return (super.equals (object) &&
                 object instanceof OutputDeviceAssigned);
@@ -107,6 +108,7 @@ public final class OutputDeviceAssigned extends TextSyntax
      * @return printing attribute class (category), an instance of class
      *         {@link Class java.lang.Class}
      */
+    @Override
     public final Class<? extends Attribute> getCategory() {
         return OutputDeviceAssigned.class;
     }
@@ -120,6 +122,7 @@ public final class OutputDeviceAssigned extends TextSyntax
      *
      * @return attribute category name
      */
+    @Override
     public final String getName() {
         return "output-device-assigned";
     }
diff --git a/src/java.desktop/share/classes/javax/print/attribute/standard/PDLOverrideSupported.java b/src/java.desktop/share/classes/javax/print/attribute/standard/PDLOverrideSupported.java
index 46b9e8493d3..d9862ff633b 100644
--- a/src/java.desktop/share/classes/javax/print/attribute/standard/PDLOverrideSupported.java
+++ b/src/java.desktop/share/classes/javax/print/attribute/standard/PDLOverrideSupported.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2000, 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2000, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -97,6 +97,7 @@ public class PDLOverrideSupported extends EnumSyntax
     /**
      * Returns the string table for class {@code PDLOverrideSupported}.
      */
+    @Override
     protected String[] getStringTable() {
         return myStringTable.clone();
     }
@@ -105,6 +106,7 @@ public class PDLOverrideSupported extends EnumSyntax
      * Returns the enumeration value table for class
      * {@code PDLOverrideSupported}.
      */
+    @Override
     protected EnumSyntax[] getEnumValueTable() {
         return (EnumSyntax[])myEnumValueTable.clone();
     }
@@ -119,6 +121,7 @@ public class PDLOverrideSupported extends EnumSyntax
      * @return printing attribute class (category), an instance of class
      *         {@link Class java.lang.Class}
      */
+    @Override
     public final Class<? extends Attribute> getCategory() {
         return PDLOverrideSupported.class;
     }
@@ -132,6 +135,7 @@ public class PDLOverrideSupported extends EnumSyntax
      *
      * @return attribute category name
      */
+    @Override
     public final String getName() {
         return "pdl-override-supported";
     }
diff --git a/src/java.desktop/share/classes/javax/print/attribute/standard/PageRanges.java b/src/java.desktop/share/classes/javax/print/attribute/standard/PageRanges.java
index 3ba0fa8e07e..74325a3eb2f 100644
--- a/src/java.desktop/share/classes/javax/print/attribute/standard/PageRanges.java
+++ b/src/java.desktop/share/classes/javax/print/attribute/standard/PageRanges.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2000, 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2000, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -209,6 +209,7 @@ public final class PageRanges   extends SetOfIntegerSyntax
      * @return {@code true} if {@code object} is equivalent to this page ranges
      *         attribute, {@code false} otherwise
      */
+    @Override
     public boolean equals(Object object) {
         return (super.equals(object) && object instanceof PageRanges);
     }
@@ -223,6 +224,7 @@ public final class PageRanges   extends SetOfIntegerSyntax
      * @return printing attribute class (category), an instance of class
      *         {@link Class java.lang.Class}
      */
+    @Override
     public final Class<? extends Attribute> getCategory() {
         return PageRanges.class;
     }
@@ -235,6 +237,7 @@ public final class PageRanges   extends SetOfIntegerSyntax
      *
      * @return attribute category name
      */
+    @Override
     public final String getName() {
         return "page-ranges";
     }
diff --git a/src/java.desktop/share/classes/javax/print/attribute/standard/PagesPerMinute.java b/src/java.desktop/share/classes/javax/print/attribute/standard/PagesPerMinute.java
index 184339fb978..4d05663d1db 100644
--- a/src/java.desktop/share/classes/javax/print/attribute/standard/PagesPerMinute.java
+++ b/src/java.desktop/share/classes/javax/print/attribute/standard/PagesPerMinute.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2000, 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2000, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -78,6 +78,7 @@ public final class PagesPerMinute extends IntegerSyntax
      * @return {@code true} if {@code object} is equivalent to this pages per
      *         minute attribute, {@code false} otherwise
      */
+    @Override
     public boolean equals(Object object) {
         return (super.equals (object) &&
                 object instanceof PagesPerMinute);
@@ -93,6 +94,7 @@ public final class PagesPerMinute extends IntegerSyntax
      * @return printing attribute class (category), an instance of class
      *         {@link Class java.lang.Class}
      */
+    @Override
     public final Class<? extends Attribute> getCategory() {
         return PagesPerMinute.class;
     }
@@ -106,6 +108,7 @@ public final class PagesPerMinute extends IntegerSyntax
      *
      * @return attribute category name
      */
+    @Override
     public final String getName() {
         return "pages-per-minute";
     }
diff --git a/src/java.desktop/share/classes/javax/print/attribute/standard/PagesPerMinuteColor.java b/src/java.desktop/share/classes/javax/print/attribute/standard/PagesPerMinuteColor.java
index 32f15a4f165..0dc3d0c9420 100644
--- a/src/java.desktop/share/classes/javax/print/attribute/standard/PagesPerMinuteColor.java
+++ b/src/java.desktop/share/classes/javax/print/attribute/standard/PagesPerMinuteColor.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2000, 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2000, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -91,6 +91,7 @@ public final class PagesPerMinuteColor extends IntegerSyntax
      * @return {@code true} if {@code object} is equivalent to this pages per
      *         minute color attribute, {@code false} otherwise
      */
+    @Override
     public boolean equals(Object object) {
         return (super.equals(object) &&
                 object instanceof PagesPerMinuteColor);
@@ -106,6 +107,7 @@ public final class PagesPerMinuteColor extends IntegerSyntax
      * @return printing attribute class (category), an instance of class
      *         {@link Class java.lang.Class}
      */
+    @Override
     public final Class<? extends Attribute> getCategory() {
         return PagesPerMinuteColor.class;
     }
@@ -119,6 +121,7 @@ public final class PagesPerMinuteColor extends IntegerSyntax
      *
      * @return attribute category name
      */
+    @Override
     public final String getName() {
         return "pages-per-minute-color";
     }
diff --git a/src/java.desktop/share/classes/javax/print/attribute/standard/PresentationDirection.java b/src/java.desktop/share/classes/javax/print/attribute/standard/PresentationDirection.java
index d4ff8581a2d..c40b6f3390e 100644
--- a/src/java.desktop/share/classes/javax/print/attribute/standard/PresentationDirection.java
+++ b/src/java.desktop/share/classes/javax/print/attribute/standard/PresentationDirection.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2001, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2001, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -157,6 +157,7 @@ public final class PresentationDirection extends EnumSyntax
     /**
      * Returns the string table for class {@code PresentationDirection}.
      */
+    @Override
     protected String[] getStringTable() {
         return myStringTable;
     }
@@ -165,6 +166,7 @@ public final class PresentationDirection extends EnumSyntax
      * Returns the enumeration value table for class
      * {@code PresentationDirection}.
      */
+    @Override
     protected EnumSyntax[] getEnumValueTable() {
         return myEnumValueTable;
     }
@@ -179,6 +181,7 @@ public final class PresentationDirection extends EnumSyntax
      * @return printing attribute class (category), an instance of class
      *         {@link Class java.lang.Class}
      */
+    @Override
     public final Class<? extends Attribute> getCategory() {
         return PresentationDirection.class;
     }
@@ -192,6 +195,7 @@ public final class PresentationDirection extends EnumSyntax
      *
      * @return attribute category name
      */
+    @Override
     public final String getName() {
         return "presentation-direction";
     }
diff --git a/src/java.desktop/share/classes/javax/print/attribute/standard/PrintQuality.java b/src/java.desktop/share/classes/javax/print/attribute/standard/PrintQuality.java
index d00637fe23c..2e64522da7c 100644
--- a/src/java.desktop/share/classes/javax/print/attribute/standard/PrintQuality.java
+++ b/src/java.desktop/share/classes/javax/print/attribute/standard/PrintQuality.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2000, 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2000, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -100,6 +100,7 @@ public class PrintQuality extends EnumSyntax
     /**
      * Returns the string table for class {@code PrintQuality}.
      */
+    @Override
     protected String[] getStringTable() {
         return myStringTable.clone();
     }
@@ -107,6 +108,7 @@ public class PrintQuality extends EnumSyntax
     /**
      * Returns the enumeration value table for class {@code PrintQuality}.
      */
+    @Override
     protected EnumSyntax[] getEnumValueTable() {
         return (EnumSyntax[])myEnumValueTable.clone();
     }
@@ -114,6 +116,7 @@ public class PrintQuality extends EnumSyntax
     /**
      * Returns the lowest integer value used by class {@code PrintQuality}.
      */
+    @Override
     protected int getOffset() {
         return 3;
     }
@@ -128,6 +131,7 @@ public class PrintQuality extends EnumSyntax
      * @return printing attribute class (category), an instance of class
      *         {@link Class java.lang.Class}
      */
+    @Override
     public final Class<? extends Attribute> getCategory() {
         return PrintQuality.class;
     }
@@ -141,6 +145,7 @@ public class PrintQuality extends EnumSyntax
      *
      * @return attribute category name
      */
+    @Override
     public final String getName() {
         return "print-quality";
     }
diff --git a/src/java.desktop/share/classes/javax/print/attribute/standard/PrinterInfo.java b/src/java.desktop/share/classes/javax/print/attribute/standard/PrinterInfo.java
index 4d8d2cf0601..39b8759d34d 100644
--- a/src/java.desktop/share/classes/javax/print/attribute/standard/PrinterInfo.java
+++ b/src/java.desktop/share/classes/javax/print/attribute/standard/PrinterInfo.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2000, 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2000, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -87,6 +87,7 @@ public final class PrinterInfo extends TextSyntax
      * @return {@code true} if {@code object} is equivalent to this printer info
      *         attribute, {@code false} otherwise
      */
+    @Override
     public boolean equals(Object object) {
         return (super.equals(object) && object instanceof PrinterInfo);
     }
@@ -101,6 +102,7 @@ public final class PrinterInfo extends TextSyntax
      * @return printing attribute class (category), an instance of class
      *         {@link Class java.lang.Class}
      */
+    @Override
     public final Class<? extends Attribute> getCategory() {
         return PrinterInfo.class;
     }
@@ -114,6 +116,7 @@ public final class PrinterInfo extends TextSyntax
      *
      * @return attribute category name
      */
+    @Override
     public final String getName() {
         return "printer-info";
     }
diff --git a/src/java.desktop/share/classes/javax/print/attribute/standard/PrinterIsAcceptingJobs.java b/src/java.desktop/share/classes/javax/print/attribute/standard/PrinterIsAcceptingJobs.java
index 92e0d1fcfcd..f8a99d4db46 100644
--- a/src/java.desktop/share/classes/javax/print/attribute/standard/PrinterIsAcceptingJobs.java
+++ b/src/java.desktop/share/classes/javax/print/attribute/standard/PrinterIsAcceptingJobs.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2000, 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2000, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -100,6 +100,7 @@ public final class PrinterIsAcceptingJobs extends EnumSyntax
     /**
      * Returns the string table for class {@code PrinterIsAcceptingJobs}.
      */
+    @Override
     protected String[] getStringTable() {
         return myStringTable;
     }
@@ -108,6 +109,7 @@ public final class PrinterIsAcceptingJobs extends EnumSyntax
      * Returns the enumeration value table for class
      * {@code PrinterIsAcceptingJobs}.
      */
+    @Override
     protected EnumSyntax[] getEnumValueTable() {
         return myEnumValueTable;
     }
@@ -122,6 +124,7 @@ public final class PrinterIsAcceptingJobs extends EnumSyntax
      * @return printing attribute class (category), an instance of class
      *         {@link Class java.lang.Class}
      */
+    @Override
     public final Class<? extends Attribute> getCategory() {
         return PrinterIsAcceptingJobs.class;
     }
@@ -135,6 +138,7 @@ public final class PrinterIsAcceptingJobs extends EnumSyntax
      *
      * @return attribute category name
      */
+    @Override
     public final String getName() {
         return "printer-is-accepting-jobs";
     }
diff --git a/src/java.desktop/share/classes/javax/print/attribute/standard/PrinterLocation.java b/src/java.desktop/share/classes/javax/print/attribute/standard/PrinterLocation.java
index a0cfed406ce..c23112c79d2 100644
--- a/src/java.desktop/share/classes/javax/print/attribute/standard/PrinterLocation.java
+++ b/src/java.desktop/share/classes/javax/print/attribute/standard/PrinterLocation.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2000, 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2000, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -83,6 +83,7 @@ public final class PrinterLocation extends TextSyntax
      * @return {@code true} if {@code object} is equivalent to this printer
      *         location attribute, {@code false} otherwise
      */
+    @Override
     public boolean equals(Object object) {
         return (super.equals(object) && object instanceof PrinterLocation);
     }
@@ -97,6 +98,7 @@ public final class PrinterLocation extends TextSyntax
      * @return printing attribute class (category), an instance of class
      *         {@link Class java.lang.Class}
      */
+    @Override
     public final Class<? extends Attribute> getCategory() {
         return PrinterLocation.class;
     }
@@ -110,6 +112,7 @@ public final class PrinterLocation extends TextSyntax
      *
      * @return attribute category name
      */
+    @Override
     public final String getName() {
         return "printer-location";
     }
diff --git a/src/java.desktop/share/classes/javax/print/attribute/standard/PrinterMakeAndModel.java b/src/java.desktop/share/classes/javax/print/attribute/standard/PrinterMakeAndModel.java
index b5fe4a6ee95..eff34c8bd59 100644
--- a/src/java.desktop/share/classes/javax/print/attribute/standard/PrinterMakeAndModel.java
+++ b/src/java.desktop/share/classes/javax/print/attribute/standard/PrinterMakeAndModel.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2000, 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2000, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -82,6 +82,7 @@ public final class PrinterMakeAndModel extends TextSyntax
      * @return {@code true} if {@code object} is equivalent to this printer make
      *         and model attribute, {@code false} otherwise
      */
+    @Override
     public boolean equals(Object object) {
         return (super.equals(object) &&
                 object instanceof PrinterMakeAndModel);
@@ -97,6 +98,7 @@ public final class PrinterMakeAndModel extends TextSyntax
      * @return printing attribute class (category), an instance of class
      *         {@link Class java.lang.Class}
      */
+    @Override
     public final Class<? extends Attribute> getCategory() {
         return PrinterMakeAndModel.class;
     }
@@ -110,6 +112,7 @@ public final class PrinterMakeAndModel extends TextSyntax
      *
      * @return attribute category name
      */
+    @Override
     public final String getName() {
         return "printer-make-and-model";
     }
diff --git a/src/java.desktop/share/classes/javax/print/attribute/standard/PrinterMessageFromOperator.java b/src/java.desktop/share/classes/javax/print/attribute/standard/PrinterMessageFromOperator.java
index 9ce0a098b80..e125d4955b3 100644
--- a/src/java.desktop/share/classes/javax/print/attribute/standard/PrinterMessageFromOperator.java
+++ b/src/java.desktop/share/classes/javax/print/attribute/standard/PrinterMessageFromOperator.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2000, 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2000, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -95,6 +95,7 @@ public final class PrinterMessageFromOperator   extends TextSyntax
      * @return {@code true} if {@code object} is equivalent to this printer
      *         message from operator attribute, {@code false} otherwise
      */
+    @Override
     public boolean equals(Object object) {
         return (super.equals(object) &&
                 object instanceof PrinterMessageFromOperator);
@@ -110,6 +111,7 @@ public final class PrinterMessageFromOperator   extends TextSyntax
      * @return printing attribute class (category), an instance of class
      *         {@link Class java.lang.Class}
      */
+    @Override
     public final Class<? extends Attribute> getCategory() {
         return PrinterMessageFromOperator.class;
     }
@@ -123,6 +125,7 @@ public final class PrinterMessageFromOperator   extends TextSyntax
      *
      * @return attribute category name
      */
+    @Override
     public final String getName() {
         return "printer-message-from-operator";
     }
diff --git a/src/java.desktop/share/classes/javax/print/attribute/standard/PrinterMoreInfo.java b/src/java.desktop/share/classes/javax/print/attribute/standard/PrinterMoreInfo.java
index 501ffdb6cfb..7e94507cf8c 100644
--- a/src/java.desktop/share/classes/javax/print/attribute/standard/PrinterMoreInfo.java
+++ b/src/java.desktop/share/classes/javax/print/attribute/standard/PrinterMoreInfo.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2000, 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2000, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -88,6 +88,7 @@ public final class PrinterMoreInfo extends URISyntax
      * @return {@code true} if {@code object} is equivalent to this printer more
      *         info attribute, {@code false} otherwise
      */
+    @Override
     public boolean equals(Object object) {
         return (super.equals(object) &&
                 object instanceof PrinterMoreInfo);
@@ -103,6 +104,7 @@ public final class PrinterMoreInfo extends URISyntax
      * @return printing attribute class (category), an instance of class
      *         {@link Class java.lang.Class}
      */
+    @Override
     public final Class<? extends Attribute> getCategory() {
         return PrinterMoreInfo.class;
     }
@@ -116,6 +118,7 @@ public final class PrinterMoreInfo extends URISyntax
      *
      * @return attribute category name
      */
+    @Override
     public final String getName() {
         return "printer-more-info";
     }
diff --git a/src/java.desktop/share/classes/javax/print/attribute/standard/PrinterMoreInfoManufacturer.java b/src/java.desktop/share/classes/javax/print/attribute/standard/PrinterMoreInfoManufacturer.java
index b6f8b92fc83..be6952fa00b 100644
--- a/src/java.desktop/share/classes/javax/print/attribute/standard/PrinterMoreInfoManufacturer.java
+++ b/src/java.desktop/share/classes/javax/print/attribute/standard/PrinterMoreInfoManufacturer.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2000, 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2000, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -88,6 +88,7 @@ public final class PrinterMoreInfoManufacturer extends URISyntax
      * @return {@code true} if {@code object} is equivalent to this printer more
      *         info manufacturer attribute, {@code false} otherwise
      */
+    @Override
     public boolean equals(Object object) {
         return (super.equals(object) &&
                 object instanceof PrinterMoreInfoManufacturer);
@@ -103,6 +104,7 @@ public final class PrinterMoreInfoManufacturer extends URISyntax
      * @return printing attribute class (category), an instance of class
      *         {@link Class java.lang.Class}
      */
+    @Override
     public final Class<? extends Attribute> getCategory() {
         return PrinterMoreInfoManufacturer.class;
     }
@@ -116,6 +118,7 @@ public final class PrinterMoreInfoManufacturer extends URISyntax
      *
      * @return attribute category name
      */
+    @Override
     public final String getName() {
         return "printer-more-info-manufacturer";
     }
diff --git a/src/java.desktop/share/classes/javax/print/attribute/standard/PrinterName.java b/src/java.desktop/share/classes/javax/print/attribute/standard/PrinterName.java
index 9a066c5d005..019ef3c8911 100644
--- a/src/java.desktop/share/classes/javax/print/attribute/standard/PrinterName.java
+++ b/src/java.desktop/share/classes/javax/print/attribute/standard/PrinterName.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2000, 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2000, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -85,6 +85,7 @@ public final class PrinterName extends TextSyntax
      * @return {@code true} if {@code object} is equivalent to this printer name
      *         attribute, {@code false} otherwise
      */
+    @Override
     public boolean equals(Object object) {
         return (super.equals(object) && object instanceof PrinterName);
     }
@@ -99,6 +100,7 @@ public final class PrinterName extends TextSyntax
      * @return printing attribute class (category), an instance of class
      *         {@link Class java.lang.Class}
      */
+    @Override
     public final Class<? extends Attribute> getCategory() {
         return PrinterName.class;
     }
@@ -112,6 +114,7 @@ public final class PrinterName extends TextSyntax
      *
      * @return attribute category name
      */
+    @Override
     public final String getName() {
         return "printer-name";
     }
diff --git a/src/java.desktop/share/classes/javax/print/attribute/standard/PrinterResolution.java b/src/java.desktop/share/classes/javax/print/attribute/standard/PrinterResolution.java
index 3bba7feb751..a47d57209cd 100644
--- a/src/java.desktop/share/classes/javax/print/attribute/standard/PrinterResolution.java
+++ b/src/java.desktop/share/classes/javax/print/attribute/standard/PrinterResolution.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2000, 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2000, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -108,6 +108,7 @@ public final class PrinterResolution    extends ResolutionSyntax
      * @return {@code true} if {@code object} is equivalent to this printer
      *         resolution attribute, {@code false} otherwise
      */
+    @Override
     public boolean equals(Object object) {
         return (super.equals (object) &&
                 object instanceof PrinterResolution);
@@ -123,6 +124,7 @@ public final class PrinterResolution    extends ResolutionSyntax
      * @return printing attribute class (category), an instance of class
      *         {@link Class java.lang.Class}
      */
+    @Override
     public final Class<? extends Attribute> getCategory() {
         return PrinterResolution.class;
     }
@@ -136,6 +138,7 @@ public final class PrinterResolution    extends ResolutionSyntax
      *
      * @return attribute category name
      */
+    @Override
     public final String getName() {
         return "printer-resolution";
     }
diff --git a/src/java.desktop/share/classes/javax/print/attribute/standard/PrinterState.java b/src/java.desktop/share/classes/javax/print/attribute/standard/PrinterState.java
index 9cbb3da9473..f2c921360a4 100644
--- a/src/java.desktop/share/classes/javax/print/attribute/standard/PrinterState.java
+++ b/src/java.desktop/share/classes/javax/print/attribute/standard/PrinterState.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2000, 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2000, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -114,6 +114,7 @@ implements PrintServiceAttribute {
     /**
      * Returns the string table for class {@code PrinterState}.
      */
+    @Override
     protected String[] getStringTable() {
         return myStringTable;
     }
@@ -121,6 +122,7 @@ implements PrintServiceAttribute {
     /**
      * Returns the enumeration value table for class {@code PrinterState}.
      */
+    @Override
     protected EnumSyntax[] getEnumValueTable() {
         return myEnumValueTable;
     }
@@ -135,6 +137,7 @@ implements PrintServiceAttribute {
      * @return printing attribute class (category), an instance of class
      *         {@link Class java.lang.Class}
      */
+    @Override
     public final Class<? extends Attribute> getCategory() {
         return PrinterState.class;
     }
@@ -148,6 +151,7 @@ implements PrintServiceAttribute {
      *
      * @return attribute category name
      */
+    @Override
     public final String getName() {
         return "printer-state";
     }
diff --git a/src/java.desktop/share/classes/javax/print/attribute/standard/PrinterStateReason.java b/src/java.desktop/share/classes/javax/print/attribute/standard/PrinterStateReason.java
index 5c3b98ee127..8586713ed65 100644
--- a/src/java.desktop/share/classes/javax/print/attribute/standard/PrinterStateReason.java
+++ b/src/java.desktop/share/classes/javax/print/attribute/standard/PrinterStateReason.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2000, 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2000, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -403,6 +403,7 @@ public class PrinterStateReason extends EnumSyntax implements Attribute {
     /**
      * Returns the string table for class {@code PrinterStateReason}.
      */
+    @Override
     protected String[] getStringTable() {
         return myStringTable.clone();
     }
@@ -410,6 +411,7 @@ public class PrinterStateReason extends EnumSyntax implements Attribute {
     /**
      * Returns the enumeration value table for class {@code PrinterStateReason}.
      */
+    @Override
     protected EnumSyntax[] getEnumValueTable() {
         return (EnumSyntax[])myEnumValueTable.clone();
     }
@@ -424,6 +426,7 @@ public class PrinterStateReason extends EnumSyntax implements Attribute {
      * @return printing attribute class (category), an instance of class
      *         {@link Class java.lang.Class}
      */
+    @Override
     public final Class<? extends Attribute> getCategory() {
         return PrinterStateReason.class;
     }
@@ -437,6 +440,7 @@ public class PrinterStateReason extends EnumSyntax implements Attribute {
      *
      * @return attribute category name
      */
+    @Override
     public final String getName() {
         return "printer-state-reason";
     }
diff --git a/src/java.desktop/share/classes/javax/print/attribute/standard/PrinterStateReasons.java b/src/java.desktop/share/classes/javax/print/attribute/standard/PrinterStateReasons.java
index 8e46b145651..fca59ca4bba 100644
--- a/src/java.desktop/share/classes/javax/print/attribute/standard/PrinterStateReasons.java
+++ b/src/java.desktop/share/classes/javax/print/attribute/standard/PrinterStateReasons.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2000, 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2000, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -165,6 +165,7 @@ public final class PrinterStateReasons
      *         {@link Severity Severity}
      * @since 1.5
      */
+    @Override
     public Severity put(PrinterStateReason reason, Severity severity) {
         if (reason == null) {
             throw new NullPointerException("reason is null");
@@ -185,6 +186,7 @@ public final class PrinterStateReasons
      * @return printing attribute class (category), an instance of class
      *         {@link Class java.lang.Class}
      */
+    @Override
     public final Class<? extends Attribute> getCategory() {
         return PrinterStateReasons.class;
     }
@@ -198,6 +200,7 @@ public final class PrinterStateReasons
      *
      * @return attribute category name
      */
+    @Override
     public final String getName() {
         return "printer-state-reasons";
     }
@@ -240,6 +243,7 @@ public final class PrinterStateReasons
             myEntrySet = entrySet;
         }
 
+        @Override
         public int size() {
             int result = 0;
             for (PrinterStateReason ignored : this) {
@@ -248,6 +252,7 @@ public final class PrinterStateReasons
             return result;
         }
 
+        @Override
         public Iterator<PrinterStateReason> iterator() {
             return new PrinterStateReasonSetIterator(mySeverity,
                                                      myEntrySet.iterator());
@@ -276,10 +281,12 @@ public final class PrinterStateReasons
             }
         }
 
+        @Override
         public boolean hasNext() {
             return myEntry != null;
         }
 
+        @Override
         public PrinterStateReason next() {
             if (myEntry == null) {
                 throw new NoSuchElementException();
@@ -289,6 +296,7 @@ public final class PrinterStateReasons
             return result;
         }
 
+        @Override
         public void remove() {
             throw new UnsupportedOperationException();
         }
diff --git a/src/java.desktop/share/classes/javax/print/attribute/standard/PrinterURI.java b/src/java.desktop/share/classes/javax/print/attribute/standard/PrinterURI.java
index dfe0bc5cc1f..d6934aae172 100644
--- a/src/java.desktop/share/classes/javax/print/attribute/standard/PrinterURI.java
+++ b/src/java.desktop/share/classes/javax/print/attribute/standard/PrinterURI.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2001, 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2001, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -79,6 +79,7 @@ public final class PrinterURI extends URISyntax
      * @return {@code true} if {@code object} is equivalent to this
      *         {@code PrinterURI} attribute, {@code false} otherwise
      */
+    @Override
     public boolean equals(Object object) {
         return (super.equals(object) && object instanceof PrinterURI);
     }
@@ -93,6 +94,7 @@ public final class PrinterURI extends URISyntax
      * @return printing attribute class (category), an instance of class
      *         {@link Class java.lang.Class}
      */
+    @Override
     public final Class<? extends Attribute> getCategory() {
         return PrinterURI.class;
     }
@@ -106,6 +108,7 @@ public final class PrinterURI extends URISyntax
      *
      * @return attribute category name
      */
+    @Override
     public final String getName() {
         return "printer-uri";
     }
diff --git a/src/java.desktop/share/classes/javax/print/attribute/standard/QueuedJobCount.java b/src/java.desktop/share/classes/javax/print/attribute/standard/QueuedJobCount.java
index c56eeb35a83..e44ead9b7cf 100644
--- a/src/java.desktop/share/classes/javax/print/attribute/standard/QueuedJobCount.java
+++ b/src/java.desktop/share/classes/javax/print/attribute/standard/QueuedJobCount.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2000, 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2000, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -76,6 +76,7 @@ public final class QueuedJobCount extends IntegerSyntax
      * @return {@code true} if {@code object} is equivalent to this queued job
      *         count attribute, {@code false} otherwise
      */
+    @Override
     public boolean equals(Object object) {
         return (super.equals (object) &&
                object instanceof QueuedJobCount);
@@ -91,6 +92,7 @@ public final class QueuedJobCount extends IntegerSyntax
      * @return printing attribute class (category), an instance of class
      *         {@link Class java.lang.Class}
      */
+    @Override
     public final Class<? extends Attribute> getCategory() {
         return QueuedJobCount.class;
     }
@@ -104,6 +106,7 @@ public final class QueuedJobCount extends IntegerSyntax
      *
      * @return attribute category name
      */
+    @Override
     public final String getName() {
         return "queued-job-count";
     }
diff --git a/src/java.desktop/share/classes/javax/print/attribute/standard/ReferenceUriSchemesSupported.java b/src/java.desktop/share/classes/javax/print/attribute/standard/ReferenceUriSchemesSupported.java
index 9784742030b..426fe4db3c4 100644
--- a/src/java.desktop/share/classes/javax/print/attribute/standard/ReferenceUriSchemesSupported.java
+++ b/src/java.desktop/share/classes/javax/print/attribute/standard/ReferenceUriSchemesSupported.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2000, 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2000, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -154,6 +154,7 @@ public class ReferenceUriSchemesSupported
     /**
      * Returns the string table for class {@code ReferenceUriSchemesSupported}.
      */
+    @Override
     protected String[] getStringTable() {
         return myStringTable.clone();
     }
@@ -162,6 +163,7 @@ public class ReferenceUriSchemesSupported
      * Returns the enumeration value table for class
      * {@code ReferenceUriSchemesSupported}.
      */
+    @Override
     protected EnumSyntax[] getEnumValueTable() {
         return (EnumSyntax[])myEnumValueTable.clone();
     }
@@ -177,6 +179,7 @@ public class ReferenceUriSchemesSupported
      * @return printing attribute class (category), an instance of class
      *         {@link Class java.lang.Class}
      */
+    @Override
     public final Class<? extends Attribute> getCategory() {
         return ReferenceUriSchemesSupported.class;
     }
@@ -191,6 +194,7 @@ public class ReferenceUriSchemesSupported
      *
      * @return attribute category name
      */
+    @Override
     public final String getName() {
         return "reference-uri-schemes-supported";
     }
diff --git a/src/java.desktop/share/classes/javax/print/attribute/standard/RequestingUserName.java b/src/java.desktop/share/classes/javax/print/attribute/standard/RequestingUserName.java
index 1d233eb7602..c2efb2da1d6 100644
--- a/src/java.desktop/share/classes/javax/print/attribute/standard/RequestingUserName.java
+++ b/src/java.desktop/share/classes/javax/print/attribute/standard/RequestingUserName.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2000, 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2000, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -92,6 +92,7 @@ public final class RequestingUserName   extends TextSyntax
      * @return {@code true} if {@code object} is equivalent to this requesting
      *         user name attribute, {@code false} otherwise
      */
+    @Override
     public boolean equals(Object object) {
         return (super.equals(object) &&
                 object instanceof RequestingUserName);
@@ -107,6 +108,7 @@ public final class RequestingUserName   extends TextSyntax
      * @return printing attribute class (category), an instance of class
      *         {@link Class java.lang.Class}
      */
+    @Override
     public final Class<? extends Attribute> getCategory() {
         return RequestingUserName.class;
     }
@@ -120,6 +122,7 @@ public final class RequestingUserName   extends TextSyntax
      *
      * @return attribute category name
      */
+    @Override
     public final String getName() {
         return "requesting-user-name";
     }
diff --git a/src/java.desktop/share/classes/javax/print/attribute/standard/Severity.java b/src/java.desktop/share/classes/javax/print/attribute/standard/Severity.java
index 7543d4503a9..c217f12292f 100644
--- a/src/java.desktop/share/classes/javax/print/attribute/standard/Severity.java
+++ b/src/java.desktop/share/classes/javax/print/attribute/standard/Severity.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2000, 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2000, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -124,6 +124,7 @@ public final class Severity extends EnumSyntax implements Attribute {
     /**
      * Returns the string table for class {@code Severity}.
      */
+    @Override
     protected String[] getStringTable() {
         return myStringTable;
     }
@@ -131,6 +132,7 @@ public final class Severity extends EnumSyntax implements Attribute {
     /**
      * Returns the enumeration value table for class {@code Severity}.
      */
+    @Override
     protected EnumSyntax[] getEnumValueTable() {
         return myEnumValueTable;
     }
@@ -145,6 +147,7 @@ public final class Severity extends EnumSyntax implements Attribute {
      * @return printing attribute class (category), an instance of class
      *         {@link Class java.lang.Class}
      */
+    @Override
     public final Class<? extends Attribute> getCategory() {
         return Severity.class;
     }
@@ -157,6 +160,7 @@ public final class Severity extends EnumSyntax implements Attribute {
      *
      * @return attribute category name
      */
+    @Override
     public final String getName() {
         return "severity";
     }
diff --git a/src/java.desktop/share/classes/javax/print/attribute/standard/SheetCollate.java b/src/java.desktop/share/classes/javax/print/attribute/standard/SheetCollate.java
index 45ec5f5374b..1754a27c86f 100644
--- a/src/java.desktop/share/classes/javax/print/attribute/standard/SheetCollate.java
+++ b/src/java.desktop/share/classes/javax/print/attribute/standard/SheetCollate.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2000, 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2000, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -191,6 +191,7 @@ public final class SheetCollate extends EnumSyntax
     /**
      * Returns the string table for class {@code SheetCollate}.
      */
+    @Override
     protected String[] getStringTable() {
         return myStringTable;
     }
@@ -198,6 +199,7 @@ public final class SheetCollate extends EnumSyntax
     /**
      * Returns the enumeration value table for class {@code SheetCollate}.
      */
+    @Override
     protected EnumSyntax[] getEnumValueTable() {
         return myEnumValueTable;
     }
@@ -212,6 +214,7 @@ public final class SheetCollate extends EnumSyntax
      * @return printing attribute class (category), an instance of class
      *         {@link Class java.lang.Class}
      */
+    @Override
     public final Class<? extends Attribute> getCategory() {
         return SheetCollate.class;
     }
@@ -225,6 +228,7 @@ public final class SheetCollate extends EnumSyntax
      *
      * @return attribute category name
      */
+    @Override
     public final String getName() {
         return "sheet-collate";
     }
diff --git a/src/java.desktop/share/classes/javax/print/attribute/standard/Sides.java b/src/java.desktop/share/classes/javax/print/attribute/standard/Sides.java
index 86d421045b0..0321cd876de 100644
--- a/src/java.desktop/share/classes/javax/print/attribute/standard/Sides.java
+++ b/src/java.desktop/share/classes/javax/print/attribute/standard/Sides.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2000, 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2000, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -183,6 +183,7 @@ public final class Sides extends EnumSyntax
     /**
      * Returns the string table for class {@code Sides}.
      */
+    @Override
     protected String[] getStringTable() {
         return myStringTable;
     }
@@ -190,6 +191,7 @@ public final class Sides extends EnumSyntax
     /**
      * Returns the enumeration value table for class {@code Sides}.
      */
+    @Override
     protected EnumSyntax[] getEnumValueTable() {
         return myEnumValueTable;
     }
@@ -203,6 +205,7 @@ public final class Sides extends EnumSyntax
      * @return printing attribute class (category), an instance of class
      *         {@link Class java.lang.Class}
      */
+    @Override
     public final Class<? extends Attribute> getCategory() {
         return Sides.class;
     }
@@ -215,6 +218,7 @@ public final class Sides extends EnumSyntax
      *
      * @return attribute category name
      */
+    @Override
     public final String getName() {
         return "sides";
     }

From 6ff9545cbf5d4f2ce4983ff26469a7913d8ff8bb Mon Sep 17 00:00:00 2001
From: Kim Barrett <kbarrett@openjdk.org>
Date: Fri, 13 Mar 2026 01:19:08 +0000
Subject: [PATCH 174/655] 8379027: Convert utilities/exceptions to use
 Atomic<T>

Reviewed-by: dholmes, fbredberg
---
 .../linux_arm/atomicAccess_linux_arm.hpp      |  4 +-
 .../linux_arm/orderAccess_linux_arm.hpp       |  3 +-
 .../linux_s390/atomicAccess_linux_s390.hpp    |  6 +--
 .../atomicAccess_windows_aarch64.hpp          |  6 +--
 .../windows_x86/atomicAccess_windows_x86.hpp  |  4 +-
 .../share/interpreter/interpreterRuntime.cpp  |  6 +--
 src/hotspot/share/runtime/sharedRuntime.cpp   |  3 +-
 src/hotspot/share/utilities/exceptions.cpp    | 52 +++++++++++--------
 src/hotspot/share/utilities/exceptions.hpp    | 22 ++++----
 9 files changed, 55 insertions(+), 51 deletions(-)

diff --git a/src/hotspot/os_cpu/linux_arm/atomicAccess_linux_arm.hpp b/src/hotspot/os_cpu/linux_arm/atomicAccess_linux_arm.hpp
index 390207f9e5e..c03f5ed1c8b 100644
--- a/src/hotspot/os_cpu/linux_arm/atomicAccess_linux_arm.hpp
+++ b/src/hotspot/os_cpu/linux_arm/atomicAccess_linux_arm.hpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2008, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2008, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -26,8 +26,6 @@
 #define OS_CPU_LINUX_ARM_ATOMICACCESS_LINUX_ARM_HPP
 
 #include "memory/allStatic.hpp"
-#include "runtime/os.hpp"
-#include "runtime/vm_version.hpp"
 
 // Implementation of class AtomicAccess
 
diff --git a/src/hotspot/os_cpu/linux_arm/orderAccess_linux_arm.hpp b/src/hotspot/os_cpu/linux_arm/orderAccess_linux_arm.hpp
index 3bb357704fb..49c6942b8e0 100644
--- a/src/hotspot/os_cpu/linux_arm/orderAccess_linux_arm.hpp
+++ b/src/hotspot/os_cpu/linux_arm/orderAccess_linux_arm.hpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2008, 2020, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2008, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -27,7 +27,6 @@
 
 // Included in orderAccess.hpp header file.
 
-#include "runtime/os.hpp"
 #include "runtime/vm_version.hpp"
 
 // Implementation of class OrderAccess.
diff --git a/src/hotspot/os_cpu/linux_s390/atomicAccess_linux_s390.hpp b/src/hotspot/os_cpu/linux_s390/atomicAccess_linux_s390.hpp
index f3c1e8f1a2c..492ccf73bdf 100644
--- a/src/hotspot/os_cpu/linux_s390/atomicAccess_linux_s390.hpp
+++ b/src/hotspot/os_cpu/linux_s390/atomicAccess_linux_s390.hpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2016, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2016, 2026, Oracle and/or its affiliates. All rights reserved.
  * Copyright (c) 2016, 2019 SAP SE. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
@@ -26,10 +26,6 @@
 #ifndef OS_CPU_LINUX_S390_ATOMICACCESS_LINUX_S390_HPP
 #define OS_CPU_LINUX_S390_ATOMICACCESS_LINUX_S390_HPP
 
-#include "runtime/atomicAccess.hpp"
-#include "runtime/os.hpp"
-#include "runtime/vm_version.hpp"
-
 // Note that the compare-and-swap instructions on System z perform
 // a serialization function before the storage operand is fetched
 // and again after the operation is completed.
diff --git a/src/hotspot/os_cpu/windows_aarch64/atomicAccess_windows_aarch64.hpp b/src/hotspot/os_cpu/windows_aarch64/atomicAccess_windows_aarch64.hpp
index f8119654c50..9238043f7a4 100644
--- a/src/hotspot/os_cpu/windows_aarch64/atomicAccess_windows_aarch64.hpp
+++ b/src/hotspot/os_cpu/windows_aarch64/atomicAccess_windows_aarch64.hpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1999, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1999, 2026, Oracle and/or its affiliates. All rights reserved.
  * Copyright (c) 2020, Microsoft Corporation. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
@@ -27,9 +27,7 @@
 #define OS_CPU_WINDOWS_AARCH64_ATOMICACCESS_WINDOWS_AARCH64_HPP
 
 #include <intrin.h>
-#include "runtime/os.hpp"
-#include "runtime/vm_version.hpp"
-
+#include <windows.h>
 
 // As per atomicAccess.hpp all read-modify-write operations have to provide two-way
 // barriers semantics. The memory_order parameter is ignored - we always provide
diff --git a/src/hotspot/os_cpu/windows_x86/atomicAccess_windows_x86.hpp b/src/hotspot/os_cpu/windows_x86/atomicAccess_windows_x86.hpp
index aa78a401235..252411f62bc 100644
--- a/src/hotspot/os_cpu/windows_x86/atomicAccess_windows_x86.hpp
+++ b/src/hotspot/os_cpu/windows_x86/atomicAccess_windows_x86.hpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1999, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1999, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -26,7 +26,7 @@
 #define OS_CPU_WINDOWS_X86_ATOMICACCESS_WINDOWS_X86_HPP
 
 #include <intrin.h>
-#include "runtime/os.hpp"
+#include <windows.h>
 
 // Note that in MSVC, volatile memory accesses are explicitly
 // guaranteed to have acquire release semantics (w.r.t. compiler
diff --git a/src/hotspot/share/interpreter/interpreterRuntime.cpp b/src/hotspot/share/interpreter/interpreterRuntime.cpp
index e3cf5d589c2..59d5f29023c 100644
--- a/src/hotspot/share/interpreter/interpreterRuntime.cpp
+++ b/src/hotspot/share/interpreter/interpreterRuntime.cpp
@@ -55,7 +55,6 @@
 #include "prims/jvmtiExport.hpp"
 #include "prims/methodHandles.hpp"
 #include "prims/nativeLookup.hpp"
-#include "runtime/atomicAccess.hpp"
 #include "runtime/continuation.hpp"
 #include "runtime/deoptimization.hpp"
 #include "runtime/fieldDescriptor.inline.hpp"
@@ -75,6 +74,7 @@
 #include "utilities/checkedCast.hpp"
 #include "utilities/copy.hpp"
 #include "utilities/events.hpp"
+#include "utilities/exceptions.hpp"
 #if INCLUDE_JFR
 #include "jfr/jfr.inline.hpp"
 #endif
@@ -352,7 +352,7 @@ JRT_ENTRY(void, InterpreterRuntime::throw_StackOverflowError(JavaThread* current
                                  vmClasses::StackOverflowError_klass(),
                                  CHECK);
   // Increment counter for hs_err file reporting
-  AtomicAccess::inc(&Exceptions::_stack_overflow_errors);
+  Exceptions::increment_stack_overflow_errors();
   // Remove the ScopedValue bindings in case we got a StackOverflowError
   // while we were trying to manipulate ScopedValue bindings.
   current->clear_scopedValueBindings();
@@ -366,7 +366,7 @@ JRT_ENTRY(void, InterpreterRuntime::throw_delayed_StackOverflowError(JavaThread*
   java_lang_Throwable::set_message(exception(),
           Universe::delayed_stack_overflow_error_message());
   // Increment counter for hs_err file reporting
-  AtomicAccess::inc(&Exceptions::_stack_overflow_errors);
+  Exceptions::increment_stack_overflow_errors();
   // Remove the ScopedValue bindings in case we got a StackOverflowError
   // while we were trying to manipulate ScopedValue bindings.
   current->clear_scopedValueBindings();
diff --git a/src/hotspot/share/runtime/sharedRuntime.cpp b/src/hotspot/share/runtime/sharedRuntime.cpp
index ae3835dd344..917ff5b4545 100644
--- a/src/hotspot/share/runtime/sharedRuntime.cpp
+++ b/src/hotspot/share/runtime/sharedRuntime.cpp
@@ -82,6 +82,7 @@
 #include "utilities/copy.hpp"
 #include "utilities/dtrace.hpp"
 #include "utilities/events.hpp"
+#include "utilities/exceptions.hpp"
 #include "utilities/globalDefinitions.hpp"
 #include "utilities/hashTable.hpp"
 #include "utilities/macros.hpp"
@@ -931,7 +932,7 @@ void SharedRuntime::throw_StackOverflowError_common(JavaThread* current, bool de
   // bindings.
   current->clear_scopedValueBindings();
   // Increment counter for hs_err file reporting
-  AtomicAccess::inc(&Exceptions::_stack_overflow_errors);
+  Exceptions::increment_stack_overflow_errors();
   throw_and_post_jvmti_exception(current, exception);
 }
 
diff --git a/src/hotspot/share/utilities/exceptions.cpp b/src/hotspot/share/utilities/exceptions.cpp
index b54474ea6d6..4455ab801cb 100644
--- a/src/hotspot/share/utilities/exceptions.cpp
+++ b/src/hotspot/share/utilities/exceptions.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1998, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1998, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -32,7 +32,6 @@
 #include "memory/resourceArea.hpp"
 #include "memory/universe.hpp"
 #include "oops/oop.inline.hpp"
-#include "runtime/atomicAccess.hpp"
 #include "runtime/handles.inline.hpp"
 #include "runtime/init.hpp"
 #include "runtime/java.hpp"
@@ -203,7 +202,7 @@ void Exceptions::_throw(JavaThread* thread, const char* file, int line, Handle h
   }
 
   if (h_exception->is_a(vmClasses::LinkageError_klass())) {
-    AtomicAccess::inc(&_linkage_errors, memory_order_relaxed);
+    _linkage_errors.add_then_fetch(1, memory_order_relaxed);
   }
 
   assert(h_exception->is_a(vmClasses::Throwable_klass()), "exception is not a subclass of java/lang/Throwable");
@@ -268,6 +267,10 @@ void Exceptions::_throw_cause(JavaThread* thread, const char* file, int line, Sy
 }
 
 
+void Exceptions::increment_stack_overflow_errors() {
+  Exceptions::_stack_overflow_errors.add_then_fetch(1, memory_order_relaxed);
+}
+
 void Exceptions::throw_stack_overflow_exception(JavaThread* THREAD, const char* file, int line, const methodHandle& method) {
   Handle exception;
   if (!THREAD->has_pending_exception()) {
@@ -279,7 +282,7 @@ void Exceptions::throw_stack_overflow_exception(JavaThread* THREAD, const char*
       java_lang_Throwable::fill_in_stack_trace(exception, method);
     }
     // Increment counter for hs_err file reporting
-    AtomicAccess::inc(&Exceptions::_stack_overflow_errors, memory_order_relaxed);
+    increment_stack_overflow_errors();
   } else {
     // if prior exception, throw that one instead
     exception = Handle(THREAD, THREAD->pending_exception());
@@ -518,20 +521,20 @@ void Exceptions::wrap_dynamic_exception(bool is_indy, JavaThread* THREAD) {
 }
 
 // Exception counting for hs_err file
-volatile int Exceptions::_stack_overflow_errors = 0;
-volatile int Exceptions::_linkage_errors = 0;
-volatile int Exceptions::_out_of_memory_error_java_heap_errors = 0;
-volatile int Exceptions::_out_of_memory_error_metaspace_errors = 0;
-volatile int Exceptions::_out_of_memory_error_class_metaspace_errors = 0;
+Atomic<int> Exceptions::_stack_overflow_errors{0};
+Atomic<int> Exceptions::_linkage_errors{0};
+Atomic<int> Exceptions::_out_of_memory_error_java_heap_errors{0};
+Atomic<int> Exceptions::_out_of_memory_error_metaspace_errors{0};
+Atomic<int> Exceptions::_out_of_memory_error_class_metaspace_errors{0};
 
 void Exceptions::count_out_of_memory_exceptions(Handle exception) {
   if (Universe::is_out_of_memory_error_metaspace(exception())) {
-     AtomicAccess::inc(&_out_of_memory_error_metaspace_errors, memory_order_relaxed);
+    _out_of_memory_error_metaspace_errors.add_then_fetch(1, memory_order_relaxed);
   } else if (Universe::is_out_of_memory_error_class_metaspace(exception())) {
-     AtomicAccess::inc(&_out_of_memory_error_class_metaspace_errors, memory_order_relaxed);
+    _out_of_memory_error_class_metaspace_errors.add_then_fetch(1, memory_order_relaxed);
   } else {
-     // everything else reported as java heap OOM
-     AtomicAccess::inc(&_out_of_memory_error_java_heap_errors, memory_order_relaxed);
+    // everything else reported as java heap OOM
+    _out_of_memory_error_java_heap_errors.add_then_fetch(1, memory_order_relaxed);
   }
 }
 
@@ -542,19 +545,24 @@ static void print_oom_count(outputStream* st, const char *err, int count) {
 }
 
 bool Exceptions::has_exception_counts() {
-  return (_stack_overflow_errors + _out_of_memory_error_java_heap_errors +
-         _out_of_memory_error_metaspace_errors + _out_of_memory_error_class_metaspace_errors) > 0;
+  return (_stack_overflow_errors.load_relaxed() +
+          _out_of_memory_error_java_heap_errors.load_relaxed() +
+          _out_of_memory_error_metaspace_errors.load_relaxed() +
+          _out_of_memory_error_class_metaspace_errors.load_relaxed()) > 0;
 }
 
 void Exceptions::print_exception_counts_on_error(outputStream* st) {
-  print_oom_count(st, "java_heap_errors", _out_of_memory_error_java_heap_errors);
-  print_oom_count(st, "metaspace_errors", _out_of_memory_error_metaspace_errors);
-  print_oom_count(st, "class_metaspace_errors", _out_of_memory_error_class_metaspace_errors);
-  if (_stack_overflow_errors > 0) {
-    st->print_cr("StackOverflowErrors=%d", _stack_overflow_errors);
+  print_oom_count(st, "java_heap_errors",
+                  _out_of_memory_error_java_heap_errors.load_relaxed());
+  print_oom_count(st, "metaspace_errors",
+                  _out_of_memory_error_metaspace_errors.load_relaxed());
+  print_oom_count(st, "class_metaspace_errors",
+                  _out_of_memory_error_class_metaspace_errors.load_relaxed());
+  if (_stack_overflow_errors.load_relaxed() > 0) {
+    st->print_cr("StackOverflowErrors=%d", _stack_overflow_errors.load_relaxed());
   }
-  if (_linkage_errors > 0) {
-    st->print_cr("LinkageErrors=%d", _linkage_errors);
+  if (_linkage_errors.load_relaxed() > 0) {
+    st->print_cr("LinkageErrors=%d", _linkage_errors.load_relaxed());
   }
 }
 
diff --git a/src/hotspot/share/utilities/exceptions.hpp b/src/hotspot/share/utilities/exceptions.hpp
index e76a0041d20..0299dedf2e6 100644
--- a/src/hotspot/share/utilities/exceptions.hpp
+++ b/src/hotspot/share/utilities/exceptions.hpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1998, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1998, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -27,6 +27,7 @@
 
 #include "memory/allocation.hpp"
 #include "oops/oopsHierarchy.hpp"
+#include "runtime/atomic.hpp"
 #include "utilities/ostream.hpp"
 #include "utilities/sizes.hpp"
 
@@ -113,12 +114,16 @@ class Exceptions {
   static bool special_exception(JavaThread* thread, const char* file, int line, Handle exception, Symbol* name = nullptr, const char* message = nullptr);
 
   // Count out of memory errors that are interesting in error diagnosis
-  static volatile int _out_of_memory_error_java_heap_errors;
-  static volatile int _out_of_memory_error_metaspace_errors;
-  static volatile int _out_of_memory_error_class_metaspace_errors;
+  static Atomic<int> _out_of_memory_error_java_heap_errors;
+  static Atomic<int> _out_of_memory_error_metaspace_errors;
+  static Atomic<int> _out_of_memory_error_class_metaspace_errors;
 
   // Count linkage errors
-  static volatile int _linkage_errors;
+  static Atomic<int> _linkage_errors;
+
+  // Count stack overflow errors.
+  static Atomic<int> _stack_overflow_errors;
+
  public:
   // this enum is defined to indicate whether it is safe to
   // ignore the encoding scheme of the original message string.
@@ -179,10 +184,9 @@ class Exceptions {
 
   static void wrap_dynamic_exception(bool is_indy, JavaThread* thread);
 
-  // Exception counting for error files of interesting exceptions that may have
-  // caused a problem for the jvm
-  static volatile int _stack_overflow_errors;
-
+  // Exception counting of interesting exceptions that may have caused a
+  // problem for the JVM, for reporting in the hs_err file.
+  static void increment_stack_overflow_errors();
   static bool has_exception_counts();
   static void count_out_of_memory_exceptions(Handle exception);
   static void print_exception_counts_on_error(outputStream* st);

From c0f4b264079b497cadb47af92b6eca6e9ac4f625 Mon Sep 17 00:00:00 2001
From: Dingli Zhang <dzhang@openjdk.org>
Date: Fri, 13 Mar 2026 01:30:49 +0000
Subject: [PATCH 175/655] 8379710: Enable vector if-conversion IR matching
 tests for RISC-V

Reviewed-by: fyang
---
 .../compiler/vectorization/TestVectorAlgorithms.java   | 10 +++++-----
 1 file changed, 5 insertions(+), 5 deletions(-)

diff --git a/test/hotspot/jtreg/compiler/vectorization/TestVectorAlgorithms.java b/test/hotspot/jtreg/compiler/vectorization/TestVectorAlgorithms.java
index f11955bef86..2667ac59471 100644
--- a/test/hotspot/jtreg/compiler/vectorization/TestVectorAlgorithms.java
+++ b/test/hotspot/jtreg/compiler/vectorization/TestVectorAlgorithms.java
@@ -556,7 +556,7 @@ public class TestVectorAlgorithms {
                   IRNode.VECTOR_MASK_CMP,                     "> 0",
                   IRNode.VECTOR_TEST,                         "> 0",
                   IRNode.STORE_VECTOR,                        "> 0"},
-        applyIfCPUFeatureOr = {"asimd", "true"})
+        applyIfCPUFeatureOr = {"asimd", "true", "rvv", "true"})
     public Object filterI_VectorAPI_v2_l2(int[] a, int[] r, int threshold) {
         return VectorAlgorithmsImpl.filterI_VectorAPI_v2_l2(a, r, threshold);
     }
@@ -566,7 +566,7 @@ public class TestVectorAlgorithms {
                   IRNode.VECTOR_MASK_CMP,                     "> 0",
                   IRNode.VECTOR_TEST,                         "> 0",
                   IRNode.STORE_VECTOR,                        "> 0"},
-        applyIfCPUFeatureOr = {"avx", "true", "asimd", "true"})
+        applyIfCPUFeatureOr = {"avx", "true", "asimd", "true", "rvv", "true"})
     public Object filterI_VectorAPI_v2_l4(int[] a, int[] r, int threshold) {
         return VectorAlgorithmsImpl.filterI_VectorAPI_v2_l4(a, r, threshold);
     }
@@ -647,7 +647,7 @@ public class TestVectorAlgorithms {
     @Test
     @IR(counts = {IRNode.LOAD_VECTOR_B, "> 0",
                   IRNode.ADD_VI,        "> 0"},
-        applyIfCPUFeatureOr = {"sse4.1", "true", "asimd", "true"})
+        applyIfCPUFeatureOr = {"sse4.1", "true", "asimd", "true", "rvv", "true"})
     public Object conditionalSumB_VectorAPI_v2(byte[] a) {
         return VectorAlgorithmsImpl.conditionalSumB_VectorAPI_v2(a);
     }
@@ -663,7 +663,7 @@ public class TestVectorAlgorithms {
     @IR(counts = {IRNode.LOAD_VECTOR_F, "> 0",
                   IRNode.MUL_VF,        "> 0",
                   IRNode.SQRT_VF,       "> 0"},
-        applyIfCPUFeatureOr = {"avx2", "true", "asimd", "true"})
+        applyIfCPUFeatureOr = {"avx2", "true", "asimd", "true", "rvv", "true"})
     public Object pieceWise2FunctionF_VectorAPI_v1(float[] a, float[] r) {
         return VectorAlgorithmsImpl.pieceWise2FunctionF_VectorAPI_v1(a, r);
     }
@@ -672,7 +672,7 @@ public class TestVectorAlgorithms {
     @IR(counts = {IRNode.LOAD_VECTOR_F, "> 0",
                   IRNode.MUL_VF,        "> 0",
                   IRNode.SQRT_VF,       "> 0"},
-        applyIfCPUFeatureOr = {"avx2", "true", "asimd", "true"})
+        applyIfCPUFeatureOr = {"avx2", "true", "asimd", "true", "rvv", "true"})
     public Object pieceWise2FunctionF_VectorAPI_v2(float[] a, float[] r) {
         return VectorAlgorithmsImpl.pieceWise2FunctionF_VectorAPI_v2(a, r);
     }

From baf29eb3e51c7d0e4b391f97e26ef66508764318 Mon Sep 17 00:00:00 2001
From: Kim Barrett <kbarrett@openjdk.org>
Date: Fri, 13 Mar 2026 02:39:21 +0000
Subject: [PATCH 176/655] 8379024: Convert utilities/vmError to use Atomic<T>

Reviewed-by: dholmes, fbredberg
---
 src/hotspot/share/utilities/vmError.cpp | 76 ++++++++++++-------------
 src/hotspot/share/utilities/vmError.hpp | 19 ++++---
 2 files changed, 47 insertions(+), 48 deletions(-)

diff --git a/src/hotspot/share/utilities/vmError.cpp b/src/hotspot/share/utilities/vmError.cpp
index 6088eafbda4..e79c9cb694e 100644
--- a/src/hotspot/share/utilities/vmError.cpp
+++ b/src/hotspot/share/utilities/vmError.cpp
@@ -43,7 +43,6 @@
 #include "oops/compressedOops.hpp"
 #include "prims/whitebox.hpp"
 #include "runtime/arguments.hpp"
-#include "runtime/atomicAccess.hpp"
 #include "runtime/flags/jvmFlag.hpp"
 #include "runtime/frame.inline.hpp"
 #include "runtime/init.hpp"
@@ -86,12 +85,12 @@ bool              VMError::coredump_status;
 char              VMError::coredump_message[O_BUFLEN];
 int               VMError::_current_step;
 const char*       VMError::_current_step_info;
-volatile jlong    VMError::_reporting_start_time = -1;
-volatile bool     VMError::_reporting_did_timeout = false;
-volatile jlong    VMError::_step_start_time = -1;
-volatile bool     VMError::_step_did_timeout = false;
-volatile bool     VMError::_step_did_succeed = false;
-volatile intptr_t VMError::_first_error_tid = -1;
+Atomic<jlong>     VMError::_reporting_start_time{-1};
+Atomic<bool>      VMError::_reporting_did_timeout{false};
+Atomic<jlong>     VMError::_step_start_time{-1};
+Atomic<bool>      VMError::_step_did_timeout{false};
+Atomic<bool>      VMError::_step_did_succeed{false};
+Atomic<intptr_t>  VMError::_first_error_tid{-1};
 int               VMError::_id;
 const char*       VMError::_message;
 char              VMError::_detail_msg[1024];
@@ -105,8 +104,8 @@ int               VMError::_lineno;
 size_t            VMError::_size;
 const size_t      VMError::_reattempt_required_stack_headroom = 64 * K;
 const intptr_t    VMError::segfault_address = pd_segfault_address;
-Thread* volatile VMError::_handshake_timed_out_thread = nullptr;
-Thread* volatile VMError::_safepoint_timed_out_thread = nullptr;
+Atomic<Thread*>   VMError::_handshake_timed_out_thread{};
+Atomic<Thread*>   VMError::_safepoint_timed_out_thread{};
 
 // List of environment variables that should be reported in error log file.
 static const char* env_list[] = {
@@ -248,7 +247,7 @@ bool VMError::can_reattempt_step(const char* &stop_reason) {
     return false;
   }
 
-  if (_step_did_timeout) {
+  if (_step_did_timeout.load_relaxed()) {
     stop_reason = "Step time limit reached";
     return false;
   }
@@ -543,12 +542,12 @@ static void report_vm_version(outputStream* st, char* buf, int buflen) {
 
 // Returns true if at least one thread reported a fatal error and fatal error handling is in process.
 bool VMError::is_error_reported() {
-  return _first_error_tid != -1;
+  return _first_error_tid.load_relaxed() != -1;
 }
 
 // Returns true if the current thread reported a fatal error.
 bool VMError::is_error_reported_in_current_thread() {
-  return _first_error_tid == os::current_thread_id();
+  return _first_error_tid.load_relaxed() == os::current_thread_id();
 }
 
 // Helper, return current timestamp for timeout handling.
@@ -560,24 +559,24 @@ jlong VMError::get_current_timestamp() {
 
 void VMError::record_reporting_start_time() {
   const jlong now = get_current_timestamp();
-  AtomicAccess::store(&_reporting_start_time, now);
+  _reporting_start_time.store_relaxed(now);
 }
 
 jlong VMError::get_reporting_start_time() {
-  return AtomicAccess::load(&_reporting_start_time);
+  return _reporting_start_time.load_relaxed();
 }
 
 void VMError::record_step_start_time() {
   const jlong now = get_current_timestamp();
-  AtomicAccess::store(&_step_start_time, now);
+  _step_start_time.store_relaxed(now);
 }
 
 jlong VMError::get_step_start_time() {
-  return AtomicAccess::load(&_step_start_time);
+  return _step_start_time.load_relaxed();
 }
 
 void VMError::clear_step_start_time() {
-  return AtomicAccess::store(&_step_start_time, (jlong)0);
+  return _step_start_time.store_relaxed(0);
 }
 
 // This is the main function to report a fatal error. Only one thread can
@@ -612,31 +611,31 @@ void VMError::report(outputStream* st, bool _verbose) {
   const char* stop_reattempt_reason = nullptr;
 # define BEGIN                                             \
   if (_current_step == 0) {                                \
-    _step_did_succeed = false;                             \
+    _step_did_succeed.store_relaxed(false);                \
     _current_step = __LINE__;                              \
     {
       // [Begin logic]
 
 # define STEP_IF(s, cond)                                  \
     }                                                      \
-    _step_did_succeed = true;                              \
+    _step_did_succeed.store_relaxed(true);                 \
   }                                                        \
   if (_current_step < __LINE__) {                          \
-    _step_did_succeed = false;                             \
+    _step_did_succeed.store_relaxed(false);                \
     _current_step = __LINE__;                              \
     _current_step_info = s;                                \
     if ((cond)) {                                          \
       record_step_start_time();                            \
-      _step_did_timeout = false;
+      _step_did_timeout.store_relaxed(false);
       // [Step logic]
 
 # define STEP(s) STEP_IF(s, true)
 
 # define REATTEMPT_STEP_IF(s, cond)                        \
     }                                                      \
-    _step_did_succeed = true;                              \
+    _step_did_succeed.store_relaxed(true);                 \
   }                                                        \
-  if (_current_step < __LINE__ && !_step_did_succeed) {    \
+  if (_current_step < __LINE__ && !_step_did_succeed.load_relaxed()) { \
     _current_step = __LINE__;                              \
     _current_step_info = s;                                \
     const bool cond_value = (cond);                        \
@@ -650,7 +649,7 @@ void VMError::report(outputStream* st, bool _verbose) {
 
 # define END                                               \
     }                                                      \
-    _step_did_succeed = true;                              \
+    _step_did_succeed.store_relaxed(true);                 \
     clear_step_start_time();                               \
   }
 
@@ -1359,21 +1358,21 @@ void VMError::report(outputStream* st, bool _verbose) {
 void VMError::set_handshake_timed_out_thread(Thread* thread) {
   // Only preserve the first thread to time-out this way. The atomic operation ensures
   // visibility to the target thread.
-  AtomicAccess::replace_if_null(&_handshake_timed_out_thread, thread);
+  _handshake_timed_out_thread.compare_exchange(nullptr, thread);
 }
 
 void VMError::set_safepoint_timed_out_thread(Thread* thread) {
   // Only preserve the first thread to time-out this way. The atomic operation ensures
   // visibility to the target thread.
-  AtomicAccess::replace_if_null(&_safepoint_timed_out_thread, thread);
+  _safepoint_timed_out_thread.compare_exchange(nullptr, thread);
 }
 
 Thread* VMError::get_handshake_timed_out_thread() {
-  return AtomicAccess::load(&_handshake_timed_out_thread);
+  return _handshake_timed_out_thread.load_relaxed();
 }
 
 Thread* VMError::get_safepoint_timed_out_thread() {
-  return AtomicAccess::load(&_safepoint_timed_out_thread);
+  return _safepoint_timed_out_thread.load_relaxed();
 }
 
 // Report for the vm_info_cmd. This prints out the information above omitting
@@ -1708,8 +1707,7 @@ void VMError::report_and_die(int id, const char* message, const char* detail_fmt
   static bool log_done = false;         // done saving error log
 
   intptr_t mytid = os::current_thread_id();
-  if (_first_error_tid == -1 &&
-      AtomicAccess::cmpxchg(&_first_error_tid, (intptr_t)-1, mytid) == -1) {
+  if (_first_error_tid.compare_set(-1, mytid)) {
 
     if (SuppressFatalErrorMessage) {
       os::abort(CreateCoredumpOnCrash);
@@ -1756,7 +1754,7 @@ void VMError::report_and_die(int id, const char* message, const char* detail_fmt
   } else {
     // This is not the first error, see if it happened in a different thread
     // or in the same thread during error reporting.
-    if (_first_error_tid != mytid) {
+    if (_first_error_tid.load_relaxed() != mytid) {
       if (!SuppressFatalErrorMessage) {
         char msgbuf[64];
         jio_snprintf(msgbuf, sizeof(msgbuf),
@@ -1788,19 +1786,19 @@ void VMError::report_and_die(int id, const char* message, const char* detail_fmt
       st->cr();
 
       // Timeout handling.
-      if (_step_did_timeout) {
+      if (_step_did_timeout.load_relaxed()) {
         // The current step had a timeout. Lets continue reporting with the next step.
         st->print_raw("[timeout occurred during error reporting in step \"");
         st->print_raw(_current_step_info);
         st->print_cr("\"] after " INT64_FORMAT " s.",
                      (int64_t)
-                     ((get_current_timestamp() - _step_start_time) / TIMESTAMP_TO_SECONDS_FACTOR));
-      } else if (_reporting_did_timeout) {
+                     ((get_current_timestamp() - get_step_start_time()) / TIMESTAMP_TO_SECONDS_FACTOR));
+      } else if (_reporting_did_timeout.load_relaxed()) {
         // We hit ErrorLogTimeout. Reporting will stop altogether. Let's wrap things
         // up, the process is about to be stopped by the WatcherThread.
         st->print_cr("------ Timeout during error reporting after " INT64_FORMAT " s. ------",
                      (int64_t)
-                     ((get_current_timestamp() - _reporting_start_time) / TIMESTAMP_TO_SECONDS_FACTOR));
+                     ((get_current_timestamp() - get_reporting_start_time()) / TIMESTAMP_TO_SECONDS_FACTOR));
         st->flush();
         // Watcherthread is about to call os::die. Lets just wait.
         os::infinite_sleep();
@@ -2100,10 +2098,10 @@ bool VMError::check_timeout() {
     // Timestamp is stored in nanos.
     if (reporting_start_time > 0) {
       const jlong end = reporting_start_time + (jlong)ErrorLogTimeout * TIMESTAMP_TO_SECONDS_FACTOR;
-      if (end <= now && !_reporting_did_timeout) {
+      if (end <= now && !_reporting_did_timeout.load_relaxed()) {
         // We hit ErrorLogTimeout and we haven't interrupted the reporting
         // thread yet.
-        _reporting_did_timeout = true;
+        _reporting_did_timeout.store_relaxed(true);
         interrupt_reporting_thread();
         return true; // global timeout
       }
@@ -2119,10 +2117,10 @@ bool VMError::check_timeout() {
     const int max_step_timeout_secs = 5;
     const jlong timeout_duration = MAX2((jlong)max_step_timeout_secs, (jlong)ErrorLogTimeout * TIMESTAMP_TO_SECONDS_FACTOR / 4);
     const jlong end = step_start_time + timeout_duration;
-    if (end <= now && !_step_did_timeout) {
+    if (end <= now && !_step_did_timeout.load_relaxed()) {
       // The step timed out and we haven't interrupted the reporting
       // thread yet.
-      _step_did_timeout = true;
+      _step_did_timeout.store_relaxed(true);
       interrupt_reporting_thread();
       return false; // (Not a global timeout)
     }
diff --git a/src/hotspot/share/utilities/vmError.hpp b/src/hotspot/share/utilities/vmError.hpp
index 04cea6de47c..b46ba208788 100644
--- a/src/hotspot/share/utilities/vmError.hpp
+++ b/src/hotspot/share/utilities/vmError.hpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * Copyright (c) 2017, 2022 SAP SE. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
@@ -27,6 +27,7 @@
 #define SHARE_UTILITIES_VMERROR_HPP
 
 #include "memory/allStatic.hpp"
+#include "runtime/atomic.hpp"
 #include "utilities/globalDefinitions.hpp"
 #include "utilities/ostream.hpp"
 
@@ -73,7 +74,7 @@ class VMError : public AllStatic {
 
   // Thread id of the first error. We must be able to handle native thread,
   // so use thread id instead of Thread* to identify thread.
-  static volatile intptr_t _first_error_tid;
+  static Atomic<intptr_t> _first_error_tid;
 
   // Core dump status, false if we have been unable to write a core/minidump for some reason
   static bool coredump_status;
@@ -85,16 +86,16 @@ class VMError : public AllStatic {
 
   // Timeout handling:
   // Timestamp at which error reporting started; -1 if no error reporting in progress.
-  static volatile jlong _reporting_start_time;
+  static Atomic<jlong> _reporting_start_time;
   // Whether or not error reporting did timeout.
-  static volatile bool _reporting_did_timeout;
+  static Atomic<bool> _reporting_did_timeout;
   // Timestamp at which the last error reporting step started; -1 if no error reporting
   //   in progress.
-  static volatile jlong _step_start_time;
+  static Atomic<jlong> _step_start_time;
   // Whether or not the last error reporting step did timeout.
-  static volatile bool _step_did_timeout;
+  static Atomic<bool> _step_did_timeout;
   // Whether or not the last error reporting step did succeed.
-  static volatile bool _step_did_succeed;
+  static Atomic<bool> _step_did_succeed;
 
   // Install secondary signal handler to handle secondary faults during error reporting
   // (see VMError::crash_handler)
@@ -143,8 +144,8 @@ class VMError : public AllStatic {
   static void clear_step_start_time();
 
   // Handshake/safepoint timed out threads
-  static Thread* volatile _handshake_timed_out_thread;
-  static Thread* volatile _safepoint_timed_out_thread;
+  static Atomic<Thread*> _handshake_timed_out_thread;
+  static Atomic<Thread*> _safepoint_timed_out_thread;
 
   WINDOWS_ONLY([[noreturn]] static void raise_fail_fast(const void* exrecord, const void* context);)
 

From b5d1af1f026ada0d83f6b402b83fc6b4238ce4aa Mon Sep 17 00:00:00 2001
From: Kim Barrett <kbarrett@openjdk.org>
Date: Fri, 13 Mar 2026 02:43:09 +0000
Subject: [PATCH 177/655] 8379026: Convert utilities/events to use Atomic<T>

Reviewed-by: dholmes, fbredberg
---
 src/hotspot/share/utilities/events.cpp | 17 +++++++++--------
 src/hotspot/share/utilities/events.hpp |  5 +----
 2 files changed, 10 insertions(+), 12 deletions(-)

diff --git a/src/hotspot/share/utilities/events.cpp b/src/hotspot/share/utilities/events.cpp
index 6adb5311cb5..d2b8e7ba5da 100644
--- a/src/hotspot/share/utilities/events.cpp
+++ b/src/hotspot/share/utilities/events.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1997, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -26,14 +26,15 @@
 #include "memory/allocation.inline.hpp"
 #include "oops/instanceKlass.hpp"
 #include "oops/symbol.hpp"
-#include "runtime/atomicAccess.hpp"
+#include "runtime/atomic.hpp"
 #include "runtime/javaThread.hpp"
 #include "runtime/mutexLocker.hpp"
 #include "runtime/osThread.hpp"
 #include "runtime/timer.hpp"
 #include "utilities/events.hpp"
 
-EventLog* Events::_logs = nullptr;
+static Atomic<EventLog*> event_logs_list{};
+
 StringEventLog* Events::_messages = nullptr;
 StringEventLog* Events::_memprotect_messages = nullptr;
 StringEventLog* Events::_nmethod_flush_messages = nullptr;
@@ -51,15 +52,15 @@ EventLog::EventLog() {
   // but use lock free add because there are some events that are created later.
   EventLog* old_head;
   do {
-    old_head = AtomicAccess::load(&Events::_logs);
+    old_head = event_logs_list.load_relaxed();
     _next = old_head;
-  } while (AtomicAccess::cmpxchg(&Events::_logs, old_head, this) != old_head);
+  } while (!event_logs_list.compare_set(old_head, this));
 }
 
 // For each registered event logger, print out the current contents of
 // the buffer.
 void Events::print_all(outputStream* out, int max) {
-  EventLog* log = AtomicAccess::load(&Events::_logs);
+  EventLog* log = event_logs_list.load_relaxed();
   while (log != nullptr) {
     log->print_log_on(out, max);
     log = log->next();
@@ -68,7 +69,7 @@ void Events::print_all(outputStream* out, int max) {
 
 // Print a single event log specified by name.
 void Events::print_one(outputStream* out, const char* log_name, int max) {
-  EventLog* log = AtomicAccess::load(&Events::_logs);
+  EventLog* log = event_logs_list.load_relaxed();
   int num_printed = 0;
   while (log != nullptr) {
     if (log->matches_name_or_handle(log_name)) {
@@ -81,7 +82,7 @@ void Events::print_one(outputStream* out, const char* log_name, int max) {
   if (num_printed == 0) {
     out->print_cr("The name \"%s\" did not match any known event log. "
                   "Valid event log names are:", log_name);
-    EventLog* log = AtomicAccess::load(&Events::_logs);
+    EventLog* log = event_logs_list.load_relaxed();
     while (log != nullptr) {
       log->print_names(out);
       out->cr();
diff --git a/src/hotspot/share/utilities/events.hpp b/src/hotspot/share/utilities/events.hpp
index cbbed7232fb..0d1c08548ff 100644
--- a/src/hotspot/share/utilities/events.hpp
+++ b/src/hotspot/share/utilities/events.hpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1997, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -214,10 +214,7 @@ class ExceptionsEventLog : public ExtendedStringEventLog {
 
 
 class Events : AllStatic {
-  friend class EventLog;
-
  private:
-  static EventLog* _logs;
 
   // A log for generic messages that aren't well categorized.
   static StringEventLog* _messages;

From bd73864314eefcdf0a57d8a580e40de711f3cf26 Mon Sep 17 00:00:00 2001
From: SendaoYan <syan@openjdk.org>
Date: Fri, 13 Mar 2026 03:30:16 +0000
Subject: [PATCH 178/655] 8279196: Test:
 jdk/jfr/event/gc/stacktrace/TestG1OldAllocationPendingStackTrace.java timed
 out

Reviewed-by: tschatzl, ayang
---
 .../gc/stacktrace/TestG1OldAllocationPendingStackTrace.java   | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/test/jdk/jdk/jfr/event/gc/stacktrace/TestG1OldAllocationPendingStackTrace.java b/test/jdk/jdk/jfr/event/gc/stacktrace/TestG1OldAllocationPendingStackTrace.java
index 1346c36c04f..64389a0e921 100644
--- a/test/jdk/jdk/jfr/event/gc/stacktrace/TestG1OldAllocationPendingStackTrace.java
+++ b/test/jdk/jdk/jfr/event/gc/stacktrace/TestG1OldAllocationPendingStackTrace.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2015, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2015, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -29,7 +29,7 @@ package jdk.jfr.event.gc.stacktrace;
  *
  * @requires vm.gc == "null" | vm.gc == "G1"
  * @library /test/lib /test/jdk
- * @run main/othervm -XX:MaxNewSize=10M -Xmx128M -XX:+UseG1GC -Xlog:gc*
+ * @run main/othervm -XX:MaxNewSize=10M -Xmx64M -XX:+UseG1GC -Xlog:gc*
  *                   -XX:FlightRecorderOptions:stackdepth=256
  *                   jdk.jfr.event.gc.stacktrace.TestG1OldAllocationPendingStackTrace
  */

From d93204eaffd5bd79ef444055a4116f6b93a0bb85 Mon Sep 17 00:00:00 2001
From: Kim Barrett <kbarrett@openjdk.org>
Date: Fri, 13 Mar 2026 08:01:12 +0000
Subject: [PATCH 179/655] 8379025: Convert utilities/debug to use Atomic<T>

Reviewed-by: dholmes, fbredberg
---
 src/hotspot/share/utilities/debug.cpp | 16 ++++++++--------
 1 file changed, 8 insertions(+), 8 deletions(-)

diff --git a/src/hotspot/share/utilities/debug.cpp b/src/hotspot/share/utilities/debug.cpp
index 504b923237e..e8533e29460 100644
--- a/src/hotspot/share/utilities/debug.cpp
+++ b/src/hotspot/share/utilities/debug.cpp
@@ -40,7 +40,7 @@
 #include "nmt/memTracker.hpp"
 #include "oops/klass.inline.hpp"
 #include "oops/oop.inline.hpp"
-#include "runtime/atomicAccess.hpp"
+#include "runtime/atomic.hpp"
 #include "runtime/flags/flagSetting.hpp"
 #include "runtime/frame.inline.hpp"
 #include "runtime/handles.inline.hpp"
@@ -80,7 +80,7 @@
 static char g_dummy;
 char* g_assert_poison = &g_dummy;
 const char* g_assert_poison_read_only = &g_dummy;
-static intx g_asserting_thread = 0;
+static Atomic<intx> g_asserting_thread{0};
 #endif // CAN_SHOW_REGISTERS_ON_ASSERT
 
 int DebuggingContext::_enabled = 0; // Initially disabled.
@@ -193,7 +193,7 @@ void report_vm_error(const char* file, int line, const char* error_msg, const ch
   const void* siginfo = nullptr;
 
 #ifdef CAN_SHOW_REGISTERS_ON_ASSERT
-  if (os::current_thread_id() == g_asserting_thread) {
+  if (os::current_thread_id() == g_asserting_thread.load_relaxed()) {
     context = os::get_saved_assert_context(&siginfo);
   }
 #endif // CAN_SHOW_REGISTERS_ON_ASSERT
@@ -220,7 +220,7 @@ void report_fatal(VMErrorType error_type, const char* file, int line, const char
   const void* siginfo = nullptr;
 
 #ifdef CAN_SHOW_REGISTERS_ON_ASSERT
-  if (os::current_thread_id() == g_asserting_thread) {
+  if (os::current_thread_id() == g_asserting_thread.load_relaxed()) {
     context = os::get_saved_assert_context(&siginfo);
   }
 #endif // CAN_SHOW_REGISTERS_ON_ASSERT
@@ -265,15 +265,15 @@ void report_untested(const char* file, int line, const char* message) {
 }
 
 void report_java_out_of_memory(const char* message) {
-  static int out_of_memory_reported = 0;
+  static Atomic<bool> out_of_memory_reported{false};
 
   JFR_ONLY(Jfr::on_report_java_out_of_memory();)
 
   // A number of threads may attempt to report OutOfMemoryError at around the
   // same time. To avoid dumping the heap or executing the data collection
-  // commands multiple times we just do it once when the first threads reports
+  // commands multiple times we just do it once when the first thread that reports
   // the error.
-  if (AtomicAccess::cmpxchg(&out_of_memory_reported, 0, 1) == 0) {
+  if (out_of_memory_reported.compare_set(false, true)) {
     // create heap dump before OnOutOfMemoryError commands are executed
     if (HeapDumpOnOutOfMemoryError) {
       tty->print_cr("java.lang.OutOfMemoryError: %s", message);
@@ -813,7 +813,7 @@ bool handle_assert_poison_fault(const void* ucVoid) {
   if (ucVoid != nullptr) {
     // Save context.
     const intx my_tid = os::current_thread_id();
-    if (AtomicAccess::cmpxchg(&g_asserting_thread, (intx)0, my_tid) == 0) {
+    if (g_asserting_thread.compare_set(0, my_tid)) {
       os::save_assert_context(ucVoid);
     }
   }

From 8c4d27381cd06511e8efc572fffa02cf8a98c75b Mon Sep 17 00:00:00 2001
From: Kim Barrett <kbarrett@openjdk.org>
Date: Fri, 13 Mar 2026 08:05:20 +0000
Subject: [PATCH 180/655] 8379273: Convert miscellaneous utilities to use
 Atomic<T>

Reviewed-by: dholmes, fbredberg
---
 src/hotspot/share/utilities/filterQueue.hpp        |  8 ++++----
 src/hotspot/share/utilities/filterQueue.inline.hpp |  6 +++---
 src/hotspot/share/utilities/tableStatistics.cpp    | 11 +++++------
 src/hotspot/share/utilities/tableStatistics.hpp    |  7 ++++---
 src/hotspot/share/utilities/zipLibrary.cpp         |  9 +++++----
 5 files changed, 21 insertions(+), 20 deletions(-)

diff --git a/src/hotspot/share/utilities/filterQueue.hpp b/src/hotspot/share/utilities/filterQueue.hpp
index 141c40f09c8..ea47f07b7b8 100644
--- a/src/hotspot/share/utilities/filterQueue.hpp
+++ b/src/hotspot/share/utilities/filterQueue.hpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2020, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -26,7 +26,7 @@
 #define SHARE_UTILITIES_FILTERQUEUE_HPP
 
 #include "memory/allocation.hpp"
-#include "runtime/atomicAccess.hpp"
+#include "runtime/atomic.hpp"
 
 // The FilterQueue is FIFO with the ability to skip over queued items.
 // The skipping is controlled by using a filter when popping.
@@ -42,9 +42,9 @@ class FilterQueue {
     E                   _data;
   };
 
-  Node* _first;
+  Atomic<Node*> _first;
   Node* load_first() {
-    return AtomicAccess::load_acquire(&_first);
+    return _first.load_acquire();
   }
 
   static bool match_all(E d) { return true; }
diff --git a/src/hotspot/share/utilities/filterQueue.inline.hpp b/src/hotspot/share/utilities/filterQueue.inline.hpp
index 18b40b81c6c..7fa1bc94b7b 100644
--- a/src/hotspot/share/utilities/filterQueue.inline.hpp
+++ b/src/hotspot/share/utilities/filterQueue.inline.hpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2020, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -37,7 +37,7 @@ void FilterQueue<E>::push(E data) {
   while (true){
     head = load_first();
     insnode->_next = head;
-    if (AtomicAccess::cmpxchg(&_first, head, insnode) == head) {
+    if (_first.compare_set(head, insnode)) {
       break;
     }
     yield.wait();
@@ -91,7 +91,7 @@ E FilterQueue<E>::pop(MATCH_FUNC& match_func) {
 
     if (match_prev == nullptr) {
       // Working on first
-      if (AtomicAccess::cmpxchg(&_first, match, match->_next) == match) {
+      if (_first.compare_set(match, match->_next)) {
         E ret = match->_data;
         delete match;
         return ret;
diff --git a/src/hotspot/share/utilities/tableStatistics.cpp b/src/hotspot/share/utilities/tableStatistics.cpp
index 331652becd5..34d0969969a 100644
--- a/src/hotspot/share/utilities/tableStatistics.cpp
+++ b/src/hotspot/share/utilities/tableStatistics.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2019, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2019, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -22,7 +22,6 @@
  *
  */
 
-#include "runtime/atomicAccess.hpp"
 #include "runtime/os.hpp"
 #include "utilities/debug.hpp"
 #include "utilities/macros.hpp"
@@ -42,7 +41,7 @@ TableRateStatistics::~TableRateStatistics() { };
 void TableRateStatistics::add() {
 #if INCLUDE_JFR
   if (Jfr::is_recording()) {
-    AtomicAccess::inc(&_added_items);
+    _added_items.add_then_fetch(1u);
   }
 #endif
 }
@@ -50,7 +49,7 @@ void TableRateStatistics::add() {
 void TableRateStatistics::remove() {
 #if INCLUDE_JFR
   if (Jfr::is_recording()) {
-    AtomicAccess::inc(&_removed_items);
+    _removed_items.add_then_fetch(1u);
   }
 #endif
 }
@@ -61,8 +60,8 @@ void TableRateStatistics::stamp() {
   _added_items_stamp_prev = _added_items_stamp;
   _removed_items_stamp_prev = _removed_items_stamp;
 
-  _added_items_stamp = _added_items;
-  _removed_items_stamp = _removed_items;
+  _added_items_stamp = _added_items.load_relaxed();
+  _removed_items_stamp = _removed_items.load_relaxed();
 
   if (_time_stamp == 0) {
     _time_stamp = now - 1000000000;
diff --git a/src/hotspot/share/utilities/tableStatistics.hpp b/src/hotspot/share/utilities/tableStatistics.hpp
index d4fd3302922..95856114833 100644
--- a/src/hotspot/share/utilities/tableStatistics.hpp
+++ b/src/hotspot/share/utilities/tableStatistics.hpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2019, 2022, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2019, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -26,6 +26,7 @@
 #define SHARE_UTILITIES_TABLE_STATISTICS_HPP
 
 #include "memory/allocation.hpp"
+#include "runtime/atomic.hpp"
 #include "utilities/debug.hpp"
 #include "utilities/globalDefinitions.hpp"
 #include "utilities/numberSeq.hpp"
@@ -35,8 +36,8 @@ class TableRateStatistics : public CHeapObj<mtStatistics> {
   friend class TableStatistics;
 
 private:
-  volatile size_t _added_items;
-  volatile size_t _removed_items;
+  Atomic<size_t> _added_items;
+  Atomic<size_t> _removed_items;
 
   jlong _time_stamp;
   double _seconds_stamp;
diff --git a/src/hotspot/share/utilities/zipLibrary.cpp b/src/hotspot/share/utilities/zipLibrary.cpp
index 54875516a0f..ad6bb82d43f 100644
--- a/src/hotspot/share/utilities/zipLibrary.cpp
+++ b/src/hotspot/share/utilities/zipLibrary.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2023, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2023, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -24,6 +24,7 @@
 
 #include "jvm_io.h"
 #include "runtime/arguments.hpp"
+#include "runtime/atomic.hpp"
 #include "runtime/interfaceSupport.inline.hpp"
 #include "runtime/os.inline.hpp"
 #include "runtime/semaphore.inline.hpp"
@@ -50,10 +51,10 @@ static ZIP_GZip_InitParams_t ZIP_GZip_InitParams = nullptr;
 static ZIP_GZip_Fully_t ZIP_GZip_Fully = nullptr;
 
 static void* _zip_handle = nullptr;
-static bool _loaded = false;
+static Atomic<bool> _loaded{false};
 
 static inline bool is_loaded() {
-  return AtomicAccess::load_acquire(&_loaded);
+  return _loaded.load_acquire();
 }
 
 static inline bool not_loaded() {
@@ -111,7 +112,7 @@ static void load_zip_library(bool vm_exit_on_failure) {
   }
 
   store_function_pointers(&path[0], vm_exit_on_failure);
-  AtomicAccess::release_store(&_loaded, true);
+  _loaded.release_store(true);
   assert(is_loaded(), "invariant");
 }
 

From c9b78274643df4fdee315951365816ba860313c1 Mon Sep 17 00:00:00 2001
From: Anton Artemov <aartemov@openjdk.org>
Date: Fri, 13 Mar 2026 08:45:15 +0000
Subject: [PATCH 181/655] 8294152: AArch64: frame::id() and frame::is_older()
 broken for interpreted frames with large max_stack

Co-authored-by: Richard Reingruber <rrich@openjdk.org>
Reviewed-by: rrich, fbredberg, mdoerr, aboldtch, amitkumar, pchilanomate
---
 src/hotspot/cpu/aarch64/frame_aarch64.inline.hpp | 9 ++++++---
 src/hotspot/cpu/ppc/frame_ppc.inline.hpp         | 9 ++++++---
 src/hotspot/cpu/riscv/frame_riscv.inline.hpp     | 9 ++++++---
 src/hotspot/cpu/s390/frame_s390.hpp              | 4 ++--
 src/hotspot/cpu/s390/frame_s390.inline.hpp       | 6 +++---
 src/hotspot/cpu/x86/frame_x86.inline.hpp         | 9 ++++++---
 6 files changed, 29 insertions(+), 17 deletions(-)

diff --git a/src/hotspot/cpu/aarch64/frame_aarch64.inline.hpp b/src/hotspot/cpu/aarch64/frame_aarch64.inline.hpp
index cb53d8663ad..748ab0e0e2b 100644
--- a/src/hotspot/cpu/aarch64/frame_aarch64.inline.hpp
+++ b/src/hotspot/cpu/aarch64/frame_aarch64.inline.hpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1997, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
  * Copyright (c) 2014, Red Hat Inc. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
@@ -245,8 +245,8 @@ inline bool frame::equal(frame other) const {
 
 // Return unique id for this frame. The id must have a value where we can distinguish
 // identity and younger/older relationship. null represents an invalid (incomparable)
-// frame.
-inline intptr_t* frame::id(void) const { return unextended_sp(); }
+// frame. Should not be called for heap frames.
+inline intptr_t* frame::id(void) const { return real_fp(); }
 
 // Return true if the frame is older (less recent activation) than the frame represented by id
 inline bool frame::is_older(intptr_t* id) const   { assert(this->id() != nullptr && id != nullptr, "null frame id");
@@ -412,6 +412,9 @@ inline frame frame::sender(RegisterMap* map) const {
     StackWatermarkSet::on_iteration(map->thread(), result);
   }
 
+  // Calling frame::id() is currently not supported for heap frames.
+  assert(result._on_heap || this->_on_heap || result.is_older(this->id()), "Must be");
+
   return result;
 }
 
diff --git a/src/hotspot/cpu/ppc/frame_ppc.inline.hpp b/src/hotspot/cpu/ppc/frame_ppc.inline.hpp
index bb711f2d053..3c05f950d0c 100644
--- a/src/hotspot/cpu/ppc/frame_ppc.inline.hpp
+++ b/src/hotspot/cpu/ppc/frame_ppc.inline.hpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2000, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2000, 2026, Oracle and/or its affiliates. All rights reserved.
  * Copyright (c) 2012, 2025 SAP SE. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
@@ -137,10 +137,10 @@ inline frame::frame(intptr_t* sp, intptr_t* unextended_sp, intptr_t* fp, address
 
 // Return unique id for this frame. The id must have a value where we
 // can distinguish identity and younger/older relationship. null
-// represents an invalid (incomparable) frame.
+// represents an invalid (incomparable) frame. Should not be called for heap frames.
 inline intptr_t* frame::id(void) const {
   // Use _fp. _sp or _unextended_sp wouldn't be correct due to resizing.
-  return _fp;
+  return real_fp();
 }
 
 // Return true if this frame is older (less recent activation) than
@@ -319,6 +319,9 @@ inline frame frame::sender(RegisterMap* map) const {
     StackWatermarkSet::on_iteration(map->thread(), result);
   }
 
+  // Calling frame::id() is currently not supported for heap frames.
+  assert(result._on_heap || this->_on_heap || result.is_older(this->id()), "Must be");
+
   return result;
 }
 
diff --git a/src/hotspot/cpu/riscv/frame_riscv.inline.hpp b/src/hotspot/cpu/riscv/frame_riscv.inline.hpp
index 51a203c548c..d1841a347e9 100644
--- a/src/hotspot/cpu/riscv/frame_riscv.inline.hpp
+++ b/src/hotspot/cpu/riscv/frame_riscv.inline.hpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1997, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
  * Copyright (c) 2014, Red Hat Inc. All rights reserved.
  * Copyright (c) 2020, 2023, Huawei Technologies Co., Ltd. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
@@ -236,8 +236,8 @@ inline bool frame::equal(frame other) const {
 
 // Return unique id for this frame. The id must have a value where we can distinguish
 // identity and younger/older relationship. null represents an invalid (incomparable)
-// frame.
-inline intptr_t* frame::id(void) const { return unextended_sp(); }
+// frame. Should not be called for heap frames.
+inline intptr_t* frame::id(void) const { return real_fp(); }
 
 // Return true if the frame is older (less recent activation) than the frame represented by id
 inline bool frame::is_older(intptr_t* id) const   { assert(this->id() != nullptr && id != nullptr, "null frame id");
@@ -398,6 +398,9 @@ frame frame::sender(RegisterMap* map) const {
     StackWatermarkSet::on_iteration(map->thread(), result);
   }
 
+  // Calling frame::id() is currently not supported for heap frames.
+  assert(result._on_heap || this->_on_heap || result.is_older(this->id()), "Must be");
+
   return result;
 }
 
diff --git a/src/hotspot/cpu/s390/frame_s390.hpp b/src/hotspot/cpu/s390/frame_s390.hpp
index ad754706367..bcdeec43e1a 100644
--- a/src/hotspot/cpu/s390/frame_s390.hpp
+++ b/src/hotspot/cpu/s390/frame_s390.hpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2016, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2016, 2026, Oracle and/or its affiliates. All rights reserved.
  * Copyright (c) 2016, 2024 SAP SE. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
@@ -463,7 +463,7 @@
 
   // Accessors
 
-  inline intptr_t* fp() const { return _fp; }
+  inline intptr_t* fp() const { assert_absolute(); return _fp; }
 
  private:
 
diff --git a/src/hotspot/cpu/s390/frame_s390.inline.hpp b/src/hotspot/cpu/s390/frame_s390.inline.hpp
index dea0e72581f..6fcd36c57d1 100644
--- a/src/hotspot/cpu/s390/frame_s390.inline.hpp
+++ b/src/hotspot/cpu/s390/frame_s390.inline.hpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2016, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2016, 2026, Oracle and/or its affiliates. All rights reserved.
  * Copyright (c) 2016, 2024 SAP SE. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
@@ -133,10 +133,10 @@ inline void frame::interpreter_frame_set_monitors(BasicObjectLock* monitors) {
 
 // Return unique id for this frame. The id must have a value where we
 // can distinguish identity and younger/older relationship. null
-// represents an invalid (incomparable) frame.
+// represents an invalid (incomparable) frame. Should not be called for heap frames.
 inline intptr_t* frame::id(void) const {
   // Use _fp. _sp or _unextended_sp wouldn't be correct due to resizing.
-  return _fp;
+  return real_fp();
 }
 
 // Return true if this frame is older (less recent activation) than
diff --git a/src/hotspot/cpu/x86/frame_x86.inline.hpp b/src/hotspot/cpu/x86/frame_x86.inline.hpp
index dcd766545d3..3f3b951edc8 100644
--- a/src/hotspot/cpu/x86/frame_x86.inline.hpp
+++ b/src/hotspot/cpu/x86/frame_x86.inline.hpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1997, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -231,8 +231,8 @@ inline bool frame::equal(frame other) const {
 
 // Return unique id for this frame. The id must have a value where we can distinguish
 // identity and younger/older relationship. null represents an invalid (incomparable)
-// frame.
-inline intptr_t* frame::id(void) const { return unextended_sp(); }
+// frame. Should not be called for heap frames.
+inline intptr_t* frame::id(void) const { return real_fp(); }
 
 // Return true if the frame is older (less recent activation) than the frame represented by id
 inline bool frame::is_older(intptr_t* id) const   { assert(this->id() != nullptr && id != nullptr, "null frame id");
@@ -397,6 +397,9 @@ inline frame frame::sender(RegisterMap* map) const {
     StackWatermarkSet::on_iteration(map->thread(), result);
   }
 
+  // Calling frame::id() is currently not supported for heap frames.
+  assert(result._on_heap || this->_on_heap || result.is_older(this->id()), "Must be");
+
   return result;
 }
 

From 38e8a465421726540365366bf6f13c48bfe0719f Mon Sep 17 00:00:00 2001
From: Stefan Johansson <sjohanss@openjdk.org>
Date: Fri, 13 Mar 2026 08:53:59 +0000
Subject: [PATCH 182/655] 8378331: G1: WeakProcessor IsAlive and KeepAlive
 closures not handling humongous candidates correctly 8378336: G1:
 j.l.ref.Reference processor always keeps alive all humongous object referents

Reviewed-by: tschatzl, kbarrett, iwalulya
---
 .../share/gc/g1/g1CollectedHeap.inline.hpp    |  6 +-
 src/hotspot/share/gc/g1/g1YoungCollector.cpp  | 12 +---
 .../g1/TestEagerReclaimHumongousRegions.java  | 62 ++++++++++++-------
 .../humongousObjects/TestObjectCollected.java | 30 +++++++--
 4 files changed, 70 insertions(+), 40 deletions(-)

diff --git a/src/hotspot/share/gc/g1/g1CollectedHeap.inline.hpp b/src/hotspot/share/gc/g1/g1CollectedHeap.inline.hpp
index 8782b65b6f9..90e87607b87 100644
--- a/src/hotspot/share/gc/g1/g1CollectedHeap.inline.hpp
+++ b/src/hotspot/share/gc/g1/g1CollectedHeap.inline.hpp
@@ -47,9 +47,9 @@
 #include "utilities/bitMap.inline.hpp"
 
 inline bool G1STWIsAliveClosure::do_object_b(oop p) {
-  // An object is reachable if it is outside the collection set,
-  // or is inside and copied.
-  return !_g1h->is_in_cset(p) || p->is_forwarded();
+  // An object is reachable if it is outside the collection set and not a
+  // humongous candidate, or is inside and copied.
+  return !_g1h->is_in_cset_or_humongous_candidate(p) || p->is_forwarded();
 }
 
 inline JavaThread* const* G1JavaThreadsListClaimer::claim(uint& count) {
diff --git a/src/hotspot/share/gc/g1/g1YoungCollector.cpp b/src/hotspot/share/gc/g1/g1YoungCollector.cpp
index a9db9a7c269..a9a81f846af 100644
--- a/src/hotspot/share/gc/g1/g1YoungCollector.cpp
+++ b/src/hotspot/share/gc/g1/g1YoungCollector.cpp
@@ -896,17 +896,10 @@ public:
     assert(obj != nullptr, "the caller should have filtered out null values");
 
     const G1HeapRegionAttr region_attr =_g1h->region_attr(obj);
-    if (!region_attr.is_in_cset_or_humongous_candidate()) {
-      return;
-    }
+    assert(!region_attr.is_humongous_candidate(), "Humongous candidates should never be considered alive");
     if (region_attr.is_in_cset()) {
       assert(obj->is_forwarded(), "invariant" );
       *p = obj->forwardee();
-    } else {
-      assert(!obj->is_forwarded(), "invariant" );
-      assert(region_attr.is_humongous_candidate(),
-             "Only allowed G1HeapRegionAttr state is IsHumongous, but is %d", region_attr.type());
-     _g1h->set_humongous_is_live(obj);
     }
   }
 };
@@ -932,7 +925,8 @@ public:
   template <class T> void do_oop_work(T* p) {
     oop obj = RawAccess<>::oop_load(p);
 
-    if (_g1h->is_in_cset_or_humongous_candidate(obj)) {
+    assert(!_g1h->region_attr(obj).is_humongous_candidate(), "Humongous candidates should never be considered alive");
+    if (_g1h->is_in_cset(obj)) {
       // If the referent object has been forwarded (either copied
       // to a new location or to itself in the event of an
       // evacuation failure) then we need to update the reference
diff --git a/test/hotspot/jtreg/gc/g1/TestEagerReclaimHumongousRegions.java b/test/hotspot/jtreg/gc/g1/TestEagerReclaimHumongousRegions.java
index fd1924b9644..5637e578e8f 100644
--- a/test/hotspot/jtreg/gc/g1/TestEagerReclaimHumongousRegions.java
+++ b/test/hotspot/jtreg/gc/g1/TestEagerReclaimHumongousRegions.java
@@ -84,26 +84,19 @@ public class TestEagerReclaimHumongousRegions {
      * @param phase The phase during concurrent mark to reach before triggering a young garbage collection.
      * @return Returns the stdout of the VM.
      */
-    private static String runHelperVM(ObjectType type, ReferencePolicy refPolicy, AllocationTiming timing, String phase) throws Exception {
+    private static String runHelperVM(List<String> args, ObjectType type, ReferencePolicy refPolicy, AllocationTiming timing, String phase) throws Exception {
 
         boolean useTypeArray = (type == ObjectType.TYPE_ARRAY);
         boolean keepReference = (refPolicy == ReferencePolicy.KEEP);
         boolean allocateAfter = (timing == AllocationTiming.AFTER_MARK_START);
 
-        OutputAnalyzer output = ProcessTools.executeLimitedTestJava("-XX:+UseG1GC",
-                                                                    "-Xmx20M",
-                                                                    "-Xms20m",
-                                                                    "-XX:+UnlockDiagnosticVMOptions",
-                                                                    "-XX:+VerifyAfterGC",
-                                                                    "-Xbootclasspath/a:.",
-                                                                    "-Xlog:gc=debug,gc+humongous=debug",
-                                                                    "-XX:+UnlockDiagnosticVMOptions",
-                                                                    "-XX:+WhiteBoxAPI",
-                                                                    TestEagerReclaimHumongousRegionsClearMarkBitsRunner.class.getName(),
-                                                                    String.valueOf(useTypeArray),
-                                                                    String.valueOf(keepReference),
-                                                                    String.valueOf(allocateAfter),
-                                                                    phase);
+        args.add(TestEagerReclaimHumongousRegionsClearMarkBitsRunner.class.getName());
+        args.add(String.valueOf(useTypeArray));
+        args.add(String.valueOf(keepReference));
+        args.add(String.valueOf(allocateAfter));
+        args.add(phase);
+
+        OutputAnalyzer output = ProcessTools.executeLimitedTestJava(args);
 
         String log = output.getStdout();
         System.out.println(log);
@@ -111,19 +104,25 @@ public class TestEagerReclaimHumongousRegions {
         return log;
     }
 
+    private static List<String> testArgs() throws Exception {
+        return List.of("-XX:+UseG1GC",
+                       "-Xmx20M",
+                       "-Xms20m",
+                       "-XX:+UnlockDiagnosticVMOptions",
+                       "-XX:+VerifyAfterGC",
+                       "-Xbootclasspath/a:.",
+                       "-Xlog:gc=debug,gc+humongous=debug",
+                       "-XX:+UnlockDiagnosticVMOptions",
+                       "-XX:+WhiteBoxAPI");
+    }
+
     private static String boolToInt(boolean value) {
         return value ? "1" : "0";
     }
 
-    private static void runTest(ObjectType type,
-                                ReferencePolicy refPolicy,
-                                AllocationTiming timing,
-                                String phase,
-                                ExpectedState expected) throws Exception {
-        String log = runHelperVM(type, refPolicy, timing, phase);
-
+    private static void verifyLog(String log, AllocationTiming timing, ExpectedState expected) {
         // Find the log output indicating that the humongous object has been reclaimed, and marked and verify for the expected results.
-// [0.351s][debug][gc,humongous] GC(3) Humongous region 2 (object size 4194320 @ 0x00000000fee00000) remset 0 code roots 0 marked 1 pinned count 0 reclaim candidate 1 type array 1
+        // [0.351s][debug][gc,humongous] GC(3) Humongous region 2 (object size 4194320 @ 0x00000000fee00000) remset 0 code roots 0 marked 1 pinned count 0 reclaim candidate 1 type array 1
 
         // Now check the result of the reclaim attempt. We are interested in the last such message (as mentioned above, we might get two).
         String patternString = "gc,humongous.* marked (\\d) pin.*candidate (\\d)";
@@ -152,6 +151,23 @@ public class TestEagerReclaimHumongousRegions {
         Asserts.assertTrue(expected.reclaimed == reclaimed, "Wrong log output reclaiming humongous region");
     }
 
+    private static void runTest(ObjectType type,
+                                ReferencePolicy refPolicy,
+                                AllocationTiming timing,
+                                String phase,
+                                ExpectedState expected) throws Exception {
+        List<String> vmArgs = testArgs();
+
+        ArrayList<String> args = new ArrayList(vmArgs);
+        String log = runHelperVM(args, type, refPolicy, timing, phase);
+        verifyLog(log, timing, expected);
+
+        ArrayList<String> jfrArgs = new ArrayList(vmArgs);
+        jfrArgs.addLast("-XX:StartFlightRecording=settings=profile");
+        String jfrLog = runHelperVM(jfrArgs, type, refPolicy, timing, phase);
+        verifyLog(jfrLog, timing, expected);
+    }
+
     public static void main(String[] args) throws Exception {
         System.out.println("Tests checking eager reclaim for when the object is allocated before mark start.");
         runTest(ObjectType.TYPE_ARRAY, ReferencePolicy.DROP, AllocationTiming.BEFORE_MARK_START, WB.BEFORE_MARKING_COMPLETED, ExpectedState.MARKED_CANDIDATE_RECLAIMED);
diff --git a/test/hotspot/jtreg/gc/g1/humongousObjects/TestObjectCollected.java b/test/hotspot/jtreg/gc/g1/humongousObjects/TestObjectCollected.java
index b1ddecd7290..b3a30d8f2f4 100644
--- a/test/hotspot/jtreg/gc/g1/humongousObjects/TestObjectCollected.java
+++ b/test/hotspot/jtreg/gc/g1/humongousObjects/TestObjectCollected.java
@@ -44,8 +44,8 @@ import java.lang.ref.WeakReference;
  * @run driver jdk.test.lib.helpers.ClassFileInstaller jdk.test.whitebox.WhiteBox
  *
  * @run main/othervm -XX:+UseG1GC -XX:+UnlockDiagnosticVMOptions -XX:+UnlockExperimentalVMOptions
- *                   -XX:+WhiteBoxAPI -Xbootclasspath/a:. -Xms200m -Xmx200m -Xlog:gc
- *                   -XX:InitiatingHeapOccupancyPercent=100 -XX:G1HeapRegionSize=1M -Xlog:gc=info:file=TestObjectCollected.gc.log
+ *                   -XX:+WhiteBoxAPI -Xbootclasspath/a:. -Xms200m -Xmx200m -Xlog:gc,gc+humongous=debug
+ *                   -XX:InitiatingHeapOccupancyPercent=100 -XX:G1HeapRegionSize=1M -Xlog:gc,gc+humongous=debug:file=TestObjectCollected.gc.log
  *                    gc.g1.humongousObjects.TestObjectCollected
  */
 
@@ -103,12 +103,22 @@ public class TestObjectCollected {
             public Reference<byte[]> create() {
                 return new WeakReference<>(new byte[ALLOCATION_SIZE], referenceQueqe);
             }
+
+            @Override
+            public boolean expectCleared() {
+                return true;
+            }
         },
         SOFT {
             @Override
             public Reference<byte[]> create() {
                 return new SoftReference<>(new byte[ALLOCATION_SIZE], referenceQueqe);
             }
+
+            @Override
+            public boolean expectCleared() {
+                return false;
+            }
         };
 
         private static final ReferenceQueue<byte[]> referenceQueqe = new ReferenceQueue<>();
@@ -120,6 +130,11 @@ public class TestObjectCollected {
          * @return weak/soft reference on byte array of ALLOCATION_SIZE
          */
         public abstract Reference<byte[]> create();
+
+        /**
+         * For WeakReferences we expect the referent to always be cleared after GC.
+         */
+        public abstract boolean expectCleared();
     }
 
 
@@ -162,8 +177,13 @@ public class TestObjectCollected {
         isRegionFree = WHITE_BOX.g1BelongsToFreeRegion(adr);
 
         boolean isObjCollected = isRegionFree || !isRegionHumongous;
-
-        Asserts.assertEquals(isRefNulled, isObjCollected,
+        if (ref.expectCleared()) {
+            Asserts.assertEquals(isRefNulled, true,
+                "Reference.get() did not return null for a reference where it is expected");
+            Asserts.assertEquals(isObjCollected, true,
+                "The humonogus object was not collected as expected");
+        } else {
+            Asserts.assertEquals(isRefNulled, isObjCollected,
                 String.format("There is an inconsistensy between reference and white box "
                                 + "method behavior - one considers object referenced with "
                                 + "%s type collected and another doesn't!\n"
@@ -172,7 +192,7 @@ public class TestObjectCollected {
                         reference.getClass().getSimpleName(),
                         (isRefNulled ? "" : "not "),
                         (isObjCollected ? "" : " not")));
-
+        }
         System.out.println("Passed");
     }
 

From 2dd7a20bb39d31b819fab85673cd3b3ed5194e82 Mon Sep 17 00:00:00 2001
From: Casper Norrbin <cnorrbin@openjdk.org>
Date: Fri, 13 Mar 2026 09:30:49 +0000
Subject: [PATCH 183/655] 8369503: [Linux] Move machine-specific queries to the
 OSContainer layer

Reviewed-by: sgehwolf, phubner
---
 .../os/linux/cgroupSubsystem_linux.cpp        | 10 ++++--
 .../os/linux/cgroupSubsystem_linux.hpp        |  4 ++-
 src/hotspot/os/linux/cgroupUtil_linux.cpp     | 33 +++++++++----------
 src/hotspot/os/linux/cgroupUtil_linux.hpp     |  4 +--
 .../os/linux/cgroupV1Subsystem_linux.cpp      |  2 --
 .../os/linux/cgroupV2Subsystem_linux.cpp      |  2 --
 src/hotspot/os/linux/osContainer_linux.cpp    |  7 +++-
 .../runtime/test_cgroupSubsystem_linux.cpp    |  8 ++---
 8 files changed, 37 insertions(+), 33 deletions(-)

diff --git a/src/hotspot/os/linux/cgroupSubsystem_linux.cpp b/src/hotspot/os/linux/cgroupSubsystem_linux.cpp
index e49d070890e..13a005591fb 100644
--- a/src/hotspot/os/linux/cgroupSubsystem_linux.cpp
+++ b/src/hotspot/os/linux/cgroupSubsystem_linux.cpp
@@ -28,7 +28,6 @@
 #include "cgroupV2Subsystem_linux.hpp"
 #include "logging/log.hpp"
 #include "memory/allocation.hpp"
-#include "os_linux.hpp"
 #include "runtime/globals.hpp"
 #include "runtime/os.hpp"
 #include "utilities/globalDefinitions.hpp"
@@ -605,6 +604,11 @@ void CgroupSubsystemFactory::cleanup(CgroupInfo* cg_infos) {
   }
 }
 
+void CgroupSubsystem::adjust_controllers(physical_memory_size_type upper_mem_bound, int upper_cpu_bound) {
+  CgroupUtil::adjust_controller(memory_controller()->controller(), upper_mem_bound);
+  CgroupUtil::adjust_controller(cpu_controller()->controller(), upper_cpu_bound);
+}
+
 /* active_processor_count
  *
  * Calculate an appropriate number of active processors for the
@@ -631,7 +635,7 @@ void CgroupSubsystemFactory::cleanup(CgroupInfo* cg_infos) {
  * return:
  *    true if there were no errors. false otherwise.
  */
-bool CgroupSubsystem::active_processor_count(double& value) {
+bool CgroupSubsystem::active_processor_count(int (*cpu_bound_func)(), double& value) {
   // We use a cache with a timeout to avoid performing expensive
   // computations in the event this function is called frequently.
   // [See 8227006].
@@ -643,7 +647,7 @@ bool CgroupSubsystem::active_processor_count(double& value) {
     return true;
   }
 
-  int cpu_count = os::Linux::active_processor_count();
+  int cpu_count = cpu_bound_func();
   double result = -1;
   if (!CgroupUtil::processor_count(contrl->controller(), cpu_count, result)) {
     return false;
diff --git a/src/hotspot/os/linux/cgroupSubsystem_linux.hpp b/src/hotspot/os/linux/cgroupSubsystem_linux.hpp
index d083a9985c2..adde37e1c77 100644
--- a/src/hotspot/os/linux/cgroupSubsystem_linux.hpp
+++ b/src/hotspot/os/linux/cgroupSubsystem_linux.hpp
@@ -278,7 +278,7 @@ class CgroupMemoryController: public CHeapObj<mtInternal> {
 class CgroupSubsystem: public CHeapObj<mtInternal> {
   public:
     bool memory_limit_in_bytes(physical_memory_size_type upper_bound, physical_memory_size_type& value);
-    bool active_processor_count(double& value);
+    bool active_processor_count(int (*cpu_bound_func)(), double& value);
 
     virtual bool pids_max(uint64_t& value) = 0;
     virtual bool pids_current(uint64_t& value) = 0;
@@ -291,6 +291,8 @@ class CgroupSubsystem: public CHeapObj<mtInternal> {
     virtual CachingCgroupController<CgroupCpuController, double>* cpu_controller() = 0;
     virtual CgroupCpuacctController* cpuacct_controller() = 0;
 
+    void adjust_controllers(physical_memory_size_type upper_mem_bound, int upper_cpu_bound);
+
     bool cpu_quota(int& value);
     bool cpu_period(int& value);
     bool cpu_shares(int& value);
diff --git a/src/hotspot/os/linux/cgroupUtil_linux.cpp b/src/hotspot/os/linux/cgroupUtil_linux.cpp
index 570b335940b..f166f6cd5e4 100644
--- a/src/hotspot/os/linux/cgroupUtil_linux.cpp
+++ b/src/hotspot/os/linux/cgroupUtil_linux.cpp
@@ -24,7 +24,6 @@
  */
 
 #include "cgroupUtil_linux.hpp"
-#include "os_linux.hpp"
 
 bool CgroupUtil::processor_count(CgroupCpuController* cpu_ctrl, int upper_bound, double& value) {
   assert(upper_bound > 0, "upper bound of cpus must be positive");
@@ -82,7 +81,7 @@ double CgroupUtil::get_updated_cpu_limit(CgroupCpuController* cpu,
   return lowest;
 }
 
-void CgroupUtil::adjust_controller(CgroupMemoryController* mem) {
+void CgroupUtil::adjust_controller(CgroupMemoryController* mem, physical_memory_size_type upper_bound) {
   assert(mem->cgroup_path() != nullptr, "invariant");
   if (strstr(mem->cgroup_path(), "../") != nullptr) {
     log_warning(os, container)("Cgroup memory controller path at '%s' seems to have moved "
@@ -100,17 +99,16 @@ void CgroupUtil::adjust_controller(CgroupMemoryController* mem) {
   char* cg_path = os::strdup(orig);
   char* last_slash;
   assert(cg_path[0] == '/', "cgroup path must start with '/'");
-  physical_memory_size_type phys_mem = os::Linux::physical_memory();
   char* limit_cg_path = nullptr;
   physical_memory_size_type limit = value_unlimited;
-  physical_memory_size_type lowest_limit = phys_mem;
-  lowest_limit = get_updated_mem_limit(mem, lowest_limit, phys_mem);
-  physical_memory_size_type orig_limit = lowest_limit != phys_mem ? lowest_limit : phys_mem;
+  physical_memory_size_type lowest_limit = upper_bound;
+  lowest_limit = get_updated_mem_limit(mem, lowest_limit, upper_bound);
+  physical_memory_size_type orig_limit = lowest_limit != upper_bound ? lowest_limit : upper_bound;
   while ((last_slash = strrchr(cg_path, '/')) != cg_path) {
     *last_slash = '\0'; // strip path
     // update to shortened path and try again
     mem->set_subsystem_path(cg_path);
-    limit = get_updated_mem_limit(mem, lowest_limit, phys_mem);
+    limit = get_updated_mem_limit(mem, lowest_limit, upper_bound);
     if (limit < lowest_limit) {
       lowest_limit = limit;
       os::free(limit_cg_path); // handles nullptr
@@ -119,13 +117,13 @@ void CgroupUtil::adjust_controller(CgroupMemoryController* mem) {
   }
   // need to check limit at mount point
   mem->set_subsystem_path("/");
-  limit = get_updated_mem_limit(mem, lowest_limit, phys_mem);
+  limit = get_updated_mem_limit(mem, lowest_limit, upper_bound);
   if (limit < lowest_limit) {
     lowest_limit = limit;
     os::free(limit_cg_path); // handles nullptr
     limit_cg_path = os::strdup("/");
   }
-  assert(lowest_limit <= phys_mem, "limit must not exceed host memory");
+  assert(lowest_limit <= upper_bound, "limit must not exceed upper bound");
   if (lowest_limit != orig_limit) {
     // we've found a lower limit anywhere in the hierarchy,
     // set the path to the limit path
@@ -147,7 +145,7 @@ void CgroupUtil::adjust_controller(CgroupMemoryController* mem) {
   os::free(limit_cg_path);
 }
 
-void CgroupUtil::adjust_controller(CgroupCpuController* cpu) {
+void CgroupUtil::adjust_controller(CgroupCpuController* cpu, int upper_bound) {
   assert(cpu->cgroup_path() != nullptr, "invariant");
   if (strstr(cpu->cgroup_path(), "../") != nullptr) {
     log_warning(os, container)("Cgroup cpu controller path at '%s' seems to have moved "
@@ -165,17 +163,16 @@ void CgroupUtil::adjust_controller(CgroupCpuController* cpu) {
   char* cg_path = os::strdup(orig);
   char* last_slash;
   assert(cg_path[0] == '/', "cgroup path must start with '/'");
-  int host_cpus = os::Linux::active_processor_count();
-  int lowest_limit = host_cpus;
-  double cpus = get_updated_cpu_limit(cpu, lowest_limit, host_cpus);
-  int orig_limit = lowest_limit != host_cpus ? lowest_limit : host_cpus;
+  int lowest_limit = upper_bound;
+  double cpus = get_updated_cpu_limit(cpu, lowest_limit, upper_bound);
+  int orig_limit = lowest_limit != upper_bound ? lowest_limit : upper_bound;
   char* limit_cg_path = nullptr;
   while ((last_slash = strrchr(cg_path, '/')) != cg_path) {
     *last_slash = '\0'; // strip path
     // update to shortened path and try again
     cpu->set_subsystem_path(cg_path);
-    cpus = get_updated_cpu_limit(cpu, lowest_limit, host_cpus);
-    if (cpus != host_cpus && cpus < lowest_limit) {
+    cpus = get_updated_cpu_limit(cpu, lowest_limit, upper_bound);
+    if (cpus != upper_bound && cpus < lowest_limit) {
       lowest_limit = cpus;
       os::free(limit_cg_path); // handles nullptr
       limit_cg_path = os::strdup(cg_path);
@@ -183,8 +180,8 @@ void CgroupUtil::adjust_controller(CgroupCpuController* cpu) {
   }
   // need to check limit at mount point
   cpu->set_subsystem_path("/");
-  cpus = get_updated_cpu_limit(cpu, lowest_limit, host_cpus);
-  if (cpus != host_cpus && cpus < lowest_limit) {
+  cpus = get_updated_cpu_limit(cpu, lowest_limit, upper_bound);
+  if (cpus != upper_bound && cpus < lowest_limit) {
     lowest_limit = cpus;
     os::free(limit_cg_path); // handles nullptr
     limit_cg_path = os::strdup(cg_path);
diff --git a/src/hotspot/os/linux/cgroupUtil_linux.hpp b/src/hotspot/os/linux/cgroupUtil_linux.hpp
index 1fd2a7d872b..68585c22c2d 100644
--- a/src/hotspot/os/linux/cgroupUtil_linux.hpp
+++ b/src/hotspot/os/linux/cgroupUtil_linux.hpp
@@ -35,10 +35,10 @@ class CgroupUtil: AllStatic {
     static bool processor_count(CgroupCpuController* cpu, int upper_bound, double& value);
     // Given a memory controller, adjust its path to a point in the hierarchy
     // that represents the closest memory limit.
-    static void adjust_controller(CgroupMemoryController* m);
+    static void adjust_controller(CgroupMemoryController* m, physical_memory_size_type upper_bound);
     // Given a cpu controller, adjust its path to a point in the hierarchy
     // that represents the closest cpu limit.
-    static void adjust_controller(CgroupCpuController* c);
+    static void adjust_controller(CgroupCpuController* c, int upper_bound);
   private:
     static physical_memory_size_type get_updated_mem_limit(CgroupMemoryController* m,
                                                            physical_memory_size_type lowest,
diff --git a/src/hotspot/os/linux/cgroupV1Subsystem_linux.cpp b/src/hotspot/os/linux/cgroupV1Subsystem_linux.cpp
index c8f5a290c99..e42b7a13391 100644
--- a/src/hotspot/os/linux/cgroupV1Subsystem_linux.cpp
+++ b/src/hotspot/os/linux/cgroupV1Subsystem_linux.cpp
@@ -326,8 +326,6 @@ CgroupV1Subsystem::CgroupV1Subsystem(CgroupV1Controller* cpuset,
     _cpuset(cpuset),
     _cpuacct(cpuacct),
     _pids(pids) {
-  CgroupUtil::adjust_controller(memory);
-  CgroupUtil::adjust_controller(cpu);
   _memory = new CachingCgroupController<CgroupMemoryController, physical_memory_size_type>(memory);
   _cpu = new CachingCgroupController<CgroupCpuController, double>(cpu);
 }
diff --git a/src/hotspot/os/linux/cgroupV2Subsystem_linux.cpp b/src/hotspot/os/linux/cgroupV2Subsystem_linux.cpp
index 30e1affc646..edd80bb7427 100644
--- a/src/hotspot/os/linux/cgroupV2Subsystem_linux.cpp
+++ b/src/hotspot/os/linux/cgroupV2Subsystem_linux.cpp
@@ -154,8 +154,6 @@ CgroupV2Subsystem::CgroupV2Subsystem(CgroupV2MemoryController * memory,
                                      CgroupV2CpuacctController* cpuacct,
                                      CgroupV2Controller unified) :
                                      _unified(unified) {
-  CgroupUtil::adjust_controller(memory);
-  CgroupUtil::adjust_controller(cpu);
   _memory = new CachingCgroupController<CgroupMemoryController, physical_memory_size_type>(memory);
   _cpu = new CachingCgroupController<CgroupCpuController, double>(cpu);
   _cpuacct = cpuacct;
diff --git a/src/hotspot/os/linux/osContainer_linux.cpp b/src/hotspot/os/linux/osContainer_linux.cpp
index b46263efd99..da2cbf381e6 100644
--- a/src/hotspot/os/linux/osContainer_linux.cpp
+++ b/src/hotspot/os/linux/osContainer_linux.cpp
@@ -59,6 +59,11 @@ void OSContainer::init() {
   if (cgroup_subsystem == nullptr) {
     return; // Required subsystem files not found or other error
   }
+  // Adjust controller paths once subsystem is initialized
+  physical_memory_size_type phys_mem = os::Linux::physical_memory();
+  int host_cpus = os::Linux::active_processor_count();
+  cgroup_subsystem->adjust_controllers(phys_mem, host_cpus);
+
   /*
    * In order to avoid a false positive on is_containerized() on
    * Linux systems outside a container *and* to ensure compatibility
@@ -252,7 +257,7 @@ char * OSContainer::cpu_cpuset_memory_nodes() {
 
 bool OSContainer::active_processor_count(double& value) {
   assert(cgroup_subsystem != nullptr, "cgroup subsystem not available");
-  return cgroup_subsystem->active_processor_count(value);
+  return cgroup_subsystem->active_processor_count(&os::Linux::active_processor_count, value);
 }
 
 bool OSContainer::cpu_quota(int& value) {
diff --git a/test/hotspot/gtest/runtime/test_cgroupSubsystem_linux.cpp b/test/hotspot/gtest/runtime/test_cgroupSubsystem_linux.cpp
index 7a4f7bcb99e..69d04ae8883 100644
--- a/test/hotspot/gtest/runtime/test_cgroupSubsystem_linux.cpp
+++ b/test/hotspot/gtest/runtime/test_cgroupSubsystem_linux.cpp
@@ -479,7 +479,7 @@ TEST(cgroupTest, set_cgroupv1_subsystem_path_adjusted) {
   ccc->set_subsystem_path((char*)cpu.cgroup_path);
   EXPECT_TRUE(ccc->needs_hierarchy_adjustment());
 
-  CgroupUtil::adjust_controller(ccc);
+  CgroupUtil::adjust_controller(ccc, 1);
   ASSERT_STREQ(cpu.expected_path, ccc->subsystem_path());
   EXPECT_FALSE(ccc->needs_hierarchy_adjustment());
 
@@ -489,7 +489,7 @@ TEST(cgroupTest, set_cgroupv1_subsystem_path_adjusted) {
   cmc->set_subsystem_path((char*)memory.cgroup_path);
   EXPECT_TRUE(cmc->needs_hierarchy_adjustment());
 
-  CgroupUtil::adjust_controller(cmc);
+  CgroupUtil::adjust_controller(cmc, (physical_memory_size_type)1024);
   ASSERT_STREQ(memory.expected_path, cmc->subsystem_path());
   EXPECT_FALSE(cmc->needs_hierarchy_adjustment());
 }
@@ -512,7 +512,7 @@ TEST(cgroupTest, set_cgroupv2_subsystem_path_adjusted) {
                                                                           true /* read-only mount */));
   EXPECT_TRUE(ccc->needs_hierarchy_adjustment());
 
-  CgroupUtil::adjust_controller(ccc);
+  CgroupUtil::adjust_controller(ccc, 1);
   ASSERT_STREQ(cpu.expected_path, ccc->subsystem_path());
   EXPECT_FALSE(ccc->needs_hierarchy_adjustment());
 
@@ -521,7 +521,7 @@ TEST(cgroupTest, set_cgroupv2_subsystem_path_adjusted) {
                                                                                 true /* read-only mount */));
   EXPECT_TRUE(cmc->needs_hierarchy_adjustment());
 
-  CgroupUtil::adjust_controller(cmc);
+  CgroupUtil::adjust_controller(cmc, (physical_memory_size_type)1024);
   ASSERT_STREQ(memory.expected_path, cmc->subsystem_path());
   EXPECT_FALSE(cmc->needs_hierarchy_adjustment());
 }

From fec7229bc23cc404508848d666ad94a0554da619 Mon Sep 17 00:00:00 2001
From: Richard Reingruber <rrich@openjdk.org>
Date: Fri, 13 Mar 2026 09:52:52 +0000
Subject: [PATCH 184/655] 8379625: PPC: cleanup C2 OptoAssembly

Reviewed-by: mdoerr, dbriemann
---
 src/hotspot/cpu/ppc/ppc.ad | 46 +++++++++++++++++++-------------------
 1 file changed, 23 insertions(+), 23 deletions(-)

diff --git a/src/hotspot/cpu/ppc/ppc.ad b/src/hotspot/cpu/ppc/ppc.ad
index 057015d3c39..21fc12742ef 100644
--- a/src/hotspot/cpu/ppc/ppc.ad
+++ b/src/hotspot/cpu/ppc/ppc.ad
@@ -10336,7 +10336,7 @@ instruct cmovI_bso_stackSlotL(iRegIdst dst, flagsRegSrc crx, stackSlotL src) %{
 
   ins_variable_size_depending_on_alignment(true);
 
-  format %{ "cmovI   $crx, $dst, $src" %}
+  format %{ "CMOVI   $crx, $dst, $src" %}
   size(8);
   ins_encode( enc_cmove_bso_stackSlotL(dst, crx, src) );
   ins_pipe(pipe_class_default);
@@ -10349,7 +10349,7 @@ instruct cmovI_bso_reg(iRegIdst dst, flagsRegSrc crx, regD src) %{
 
   ins_variable_size_depending_on_alignment(true);
 
-  format %{ "cmovI   $crx, $dst, $src" %}
+  format %{ "CMOVI   $crx, $dst, $src" %}
   size(8);
   ins_encode( enc_cmove_bso_reg(dst, crx, src) );
   ins_pipe(pipe_class_default);
@@ -10361,7 +10361,7 @@ instruct cmovI_bso_reg_conLvalue0_Ex(iRegIdst dst, flagsRegSrc crx, regD src) %{
   effect(DEF dst, USE crx, USE src);
   predicate(false);
 
-  format %{ "CmovI   $dst, $crx, $src \t// postalloc expanded" %}
+  format %{ "CMOVI   $dst, $crx, $src \t// postalloc expanded" %}
   postalloc_expand %{
     //
     // replaces
@@ -10511,7 +10511,7 @@ instruct cmovL_bso_stackSlotL(iRegLdst dst, flagsRegSrc crx, stackSlotL src) %{
 
   ins_variable_size_depending_on_alignment(true);
 
-  format %{ "cmovL   $crx, $dst, $src" %}
+  format %{ "CMOVL   $crx, $dst, $src" %}
   size(8);
   ins_encode( enc_cmove_bso_stackSlotL(dst, crx, src) );
   ins_pipe(pipe_class_default);
@@ -10524,7 +10524,7 @@ instruct cmovL_bso_reg(iRegLdst dst, flagsRegSrc crx, regD src) %{
 
   ins_variable_size_depending_on_alignment(true);
 
-  format %{ "cmovL   $crx, $dst, $src" %}
+  format %{ "CMOVL   $crx, $dst, $src" %}
   size(8);
   ins_encode( enc_cmove_bso_reg(dst, crx, src) );
   ins_pipe(pipe_class_default);
@@ -10536,7 +10536,7 @@ instruct cmovL_bso_reg_conLvalue0_Ex(iRegLdst dst, flagsRegSrc crx, regD src) %{
   effect(DEF dst, USE crx, USE src);
   predicate(false);
 
-  format %{ "CmovL   $dst, $crx, $src \t// postalloc expanded" %}
+  format %{ "CMOVL   $dst, $crx, $src \t// postalloc expanded" %}
   postalloc_expand %{
     //
     // replaces
@@ -10737,9 +10737,9 @@ instruct convF2HF_reg_reg(iRegIdst dst, regF src, regF tmp) %{
   effect(TEMP tmp);
   ins_cost(3 * DEFAULT_COST);
   size(12);
-  format %{ "xscvdphp $tmp, $src\t# convert to half precision\n\t"
-            "mffprd $dst, $tmp\t# move result from $tmp to $dst\n\t"
-            "extsh $dst, $dst\t# make it a proper short"
+  format %{ "XSCVDPHP $tmp, $src\t# convert to half precision\n\t"
+            "MFFPRD $dst, $tmp\t# move result from $tmp to $dst\n\t"
+            "EXTSH $dst, $dst\t# make it a proper short"
   %}
   ins_encode %{
     __ f2hf($dst$$Register, $src$$FloatRegister, $tmp$$FloatRegister);
@@ -10751,8 +10751,8 @@ instruct convHF2F_reg_reg(regF dst, iRegIsrc src) %{
   match(Set dst (ConvHF2F src));
   ins_cost(2 * DEFAULT_COST);
   size(8);
-  format %{ "mtfprd $dst, $src\t# move source from $src to $dst\n\t"
-            "xscvhpdp $dst, $dst\t# convert from half precision"
+  format %{ "MTFPRD $dst, $src\t# move source from $src to $dst\n\t"
+            "XSCVHPDP $dst, $dst\t# convert from half precision"
   %}
   ins_encode %{
     __ hf2f($dst$$FloatRegister, $src$$Register);
@@ -11150,7 +11150,7 @@ instruct cmov_bns_less(flagsReg crx) %{
 
   ins_variable_size_depending_on_alignment(true);
 
-  format %{ "cmov    $crx" %}
+  format %{ "CMOV    $crx" %}
   size(12);
   ins_encode %{
     Label done;
@@ -11178,7 +11178,7 @@ instruct cmpF_reg_reg_Ex(flagsReg crx, regF src1, regF src2) %{
   match(Set crx (CmpF src1 src2));
   ins_cost(DEFAULT_COST+BRANCH_COST);
 
-  format %{ "CmpF    $crx, $src1, $src2 \t// postalloc expanded" %}
+  format %{ "CMPF    $crx, $src1, $src2 \t// postalloc expanded" %}
   postalloc_expand %{
     //
     // replaces
@@ -12336,7 +12336,7 @@ instruct minF(regF dst, regF src1, regF src2) %{
   predicate(PowerArchitecturePPC64 >= 9);
   ins_cost(DEFAULT_COST);
 
-  format %{ "MinF $dst, $src1, $src2" %}
+  format %{ "XSMINJDP $dst, $src1, $src2\t// MinF" %}
   size(4);
   ins_encode %{
     __ xsminjdp($dst$$FloatRegister->to_vsr(), $src1$$FloatRegister->to_vsr(), $src2$$FloatRegister->to_vsr());
@@ -12349,7 +12349,7 @@ instruct minD(regD dst, regD src1, regD src2) %{
   predicate(PowerArchitecturePPC64 >= 9);
   ins_cost(DEFAULT_COST);
 
-  format %{ "MinD $dst, $src1, $src2" %}
+  format %{ "XSMINJDP $dst, $src1, $src2\t// MinD" %}
   size(4);
   ins_encode %{
     __ xsminjdp($dst$$FloatRegister->to_vsr(), $src1$$FloatRegister->to_vsr(), $src2$$FloatRegister->to_vsr());
@@ -12362,7 +12362,7 @@ instruct maxF(regF dst, regF src1, regF src2) %{
   predicate(PowerArchitecturePPC64 >= 9);
   ins_cost(DEFAULT_COST);
 
-  format %{ "MaxF $dst, $src1, $src2" %}
+  format %{ "XSMAXJDP $dst, $src1, $src2\t// MaxF" %}
   size(4);
   ins_encode %{
     __ xsmaxjdp($dst$$FloatRegister->to_vsr(), $src1$$FloatRegister->to_vsr(), $src2$$FloatRegister->to_vsr());
@@ -12375,7 +12375,7 @@ instruct maxD(regD dst, regD src1, regD src2) %{
   predicate(PowerArchitecturePPC64 >= 9);
   ins_cost(DEFAULT_COST);
 
-  format %{ "MaxD $dst, $src1, $src2" %}
+  format %{ "XSMAXJDP $dst, $src1, $src2\t// MaxD" %}
   size(4);
   ins_encode %{
     __ xsmaxjdp($dst$$FloatRegister->to_vsr(), $src1$$FloatRegister->to_vsr(), $src2$$FloatRegister->to_vsr());
@@ -13905,7 +13905,7 @@ instruct vfma2D_neg2(vecX dst, vecX src1, vecX src2) %{
 instruct overflowAddL_reg_reg(flagsRegCR0 cr0, iRegLsrc op1, iRegLsrc op2) %{
   match(Set cr0 (OverflowAddL op1 op2));
 
-  format %{ "add_    $op1, $op2\t# overflow check long" %}
+  format %{ "ADD_    $op1, $op2\t# overflow check long" %}
   size(12);
   ins_encode %{
     __ li(R0, 0);
@@ -13918,7 +13918,7 @@ instruct overflowAddL_reg_reg(flagsRegCR0 cr0, iRegLsrc op1, iRegLsrc op2) %{
 instruct overflowSubL_reg_reg(flagsRegCR0 cr0, iRegLsrc op1, iRegLsrc op2) %{
   match(Set cr0 (OverflowSubL op1 op2));
 
-  format %{ "subfo_  R0, $op2, $op1\t# overflow check long" %}
+  format %{ "SUBFO_  R0, $op2, $op1\t# overflow check long" %}
   size(12);
   ins_encode %{
     __ li(R0, 0);
@@ -13931,7 +13931,7 @@ instruct overflowSubL_reg_reg(flagsRegCR0 cr0, iRegLsrc op1, iRegLsrc op2) %{
 instruct overflowNegL_reg(flagsRegCR0 cr0, immL_0 zero, iRegLsrc op2) %{
   match(Set cr0 (OverflowSubL zero op2));
 
-  format %{ "nego_   R0, $op2\t# overflow check long" %}
+  format %{ "NEGO_   R0, $op2\t# overflow check long" %}
   size(12);
   ins_encode %{
     __ li(R0, 0);
@@ -13944,7 +13944,7 @@ instruct overflowNegL_reg(flagsRegCR0 cr0, immL_0 zero, iRegLsrc op2) %{
 instruct overflowMulL_reg_reg(flagsRegCR0 cr0, iRegLsrc op1, iRegLsrc op2) %{
   match(Set cr0 (OverflowMulL op1 op2));
 
-  format %{ "mulldo_ R0, $op1, $op2\t# overflow check long" %}
+  format %{ "MULLDO_ R0, $op1, $op2\t# overflow check long" %}
   size(12);
   ins_encode %{
     __ li(R0, 0);
@@ -14321,7 +14321,7 @@ instruct ForwardExceptionjmp()
   match(ForwardException);
   ins_cost(CALL_COST);
 
-  format %{ "Jmp     forward_exception_stub" %}
+  format %{ "JMP     forward_exception_stub" %}
   ins_encode %{
     __ set_inst_mark();
     __ b64_patchable(StubRoutines::forward_exception_entry(), relocInfo::runtime_call_type);
@@ -14349,7 +14349,7 @@ instruct RethrowException() %{
   match(Rethrow);
   ins_cost(CALL_COST);
 
-  format %{ "Jmp     rethrow_stub" %}
+  format %{ "JMP     rethrow_stub" %}
   ins_encode %{
     __ set_inst_mark();
     __ b64_patchable((address)OptoRuntime::rethrow_stub(), relocInfo::runtime_call_type);

From 713664fa9315c07caef65aecf6eb6a9e266f1bf0 Mon Sep 17 00:00:00 2001
From: Christian Stein <cstein@openjdk.org>
Date: Fri, 13 Mar 2026 10:28:25 +0000
Subject: [PATCH 185/655] 8379804: Refactor jdk/com/sun tests to use JUnit

Reviewed-by: dfuchs
---
 .../provider/Cipher/KeyWrap/NISTWrapKAT.java  | 24 ++++++------
 .../KeyFactory/PBEKeyDestroyTest.java         | 36 ++++++++++--------
 .../sun/jndi/ldap/LdapPoolTimeoutTest.java    |  4 +-
 .../com/sun/jndi/ldap/LdapTimeoutTest.java    | 38 +++++++++----------
 .../jndi/ldap/NamingExceptionMessageTest.java | 21 +++++-----
 5 files changed, 64 insertions(+), 59 deletions(-)

diff --git a/test/jdk/com/sun/crypto/provider/Cipher/KeyWrap/NISTWrapKAT.java b/test/jdk/com/sun/crypto/provider/Cipher/KeyWrap/NISTWrapKAT.java
index a79f48196d1..09fd0c440a9 100644
--- a/test/jdk/com/sun/crypto/provider/Cipher/KeyWrap/NISTWrapKAT.java
+++ b/test/jdk/com/sun/crypto/provider/Cipher/KeyWrap/NISTWrapKAT.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2004, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2004, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -24,20 +24,21 @@
 /*
  * @test
  * @bug 5008156 8248268
- * @run testng NISTWrapKAT
+ * @run junit NISTWrapKAT
  * @summary Verify that the AES-Key-Wrap and AES-Key-Wrap-Pad ciphers
  * work as expected using NIST test vectors.
  * @author Valerie Peng
  */
 import java.security.Key;
 import java.security.AlgorithmParameters;
-import javax.crypto.*;
-import javax.crypto.spec.*;
+import javax.crypto.Cipher;
+import javax.crypto.SecretKey;
+import javax.crypto.spec.IvParameterSpec;
+import javax.crypto.spec.SecretKeySpec;
 import java.util.Arrays;
 import java.math.BigInteger;
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
-import org.testng.Assert;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
 
 public class NISTWrapKAT {
 
@@ -101,8 +102,7 @@ public class NISTWrapKAT {
         }
     }
 
-    @DataProvider
-    public Object[][] testData() {
+    static Object[][] testData() {
         return new Object[][] {
             { "AESWrap", KEK, 16, DATA, 16, KW_AES128_128 },
             { "AESWrap", KEK, 24, DATA, 16, KW_AES192_128 },
@@ -249,7 +249,8 @@ public class NISTWrapKAT {
         };
     }
 
-    @Test(dataProvider = "testData")
+    @ParameterizedTest
+    @MethodSource("testData")
     public void testKeyWrap(String algo, String key, int keyLen,
             String data, int dataLen, String expected) throws Exception {
         System.out.println("Testing " +  algo + " Cipher with wrapping " +
@@ -311,7 +312,8 @@ public class NISTWrapKAT {
         }
     }
 
-    @Test(dataProvider = "testData")
+    @ParameterizedTest
+    @MethodSource("testData")
     public void testEnc(String algo, String key, int keyLen, String data, int dataLen, String expected)
             throws Exception {
         System.out.println("Testing " +  algo + " Cipher with enc " +
diff --git a/test/jdk/com/sun/crypto/provider/KeyFactory/PBEKeyDestroyTest.java b/test/jdk/com/sun/crypto/provider/KeyFactory/PBEKeyDestroyTest.java
index da266c147fb..41a86ccec64 100644
--- a/test/jdk/com/sun/crypto/provider/KeyFactory/PBEKeyDestroyTest.java
+++ b/test/jdk/com/sun/crypto/provider/KeyFactory/PBEKeyDestroyTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2023, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2023, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -26,13 +26,17 @@
  * @bug 8312306
  * @summary Check the destroy()/isDestroyed() of the PBEKey impl from SunJCE
  * @library /test/lib
- * @run testng/othervm PBEKeyDestroyTest
+ * @run junit/othervm PBEKeyDestroyTest
  */
-import javax.crypto.*;
-import javax.crypto.spec.*;
+import javax.crypto.SecretKey;
+import javax.crypto.SecretKeyFactory;
+import javax.crypto.spec.PBEKeySpec;
 import java.nio.charset.StandardCharsets;
-import org.testng.Assert;
-import org.testng.annotations.Test;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertFalse;
+import static org.junit.jupiter.api.Assertions.assertNotEquals;
+import static org.junit.jupiter.api.Assertions.assertTrue;
+import org.junit.jupiter.api.Test;
 
 public class PBEKeyDestroyTest {
 
@@ -48,22 +52,22 @@ public class PBEKeyDestroyTest {
         SecretKey key2 = skf.generateSecret(keySpec);
 
         // should be equal
-        Assert.assertFalse(key1.isDestroyed());
-        Assert.assertFalse(key2.isDestroyed());
-        Assert.assertTrue(key1.equals(key2));
-        Assert.assertTrue(key2.equals(key1));
+        assertFalse(key1.isDestroyed());
+        assertFalse(key2.isDestroyed());
+        assertEquals(key1, key2);
+        assertEquals(key2, key1);
 
         // destroy key1
         key1.destroy();
-        Assert.assertTrue(key1.isDestroyed());
-        Assert.assertFalse(key1.equals(key2));
-        Assert.assertFalse(key2.equals(key1));
+        assertTrue(key1.isDestroyed());
+        assertNotEquals(key1, key2);
+        assertNotEquals(key2, key1);
 
         // also destroy key2
         key2.destroy();
-        Assert.assertTrue(key2.isDestroyed());
-        Assert.assertFalse(key1.equals(key2));
-        Assert.assertFalse(key2.equals(key1));
+        assertTrue(key2.isDestroyed());
+        assertNotEquals(key1, key2);
+        assertNotEquals(key2, key1);
 
         // call destroy again to make sure no unexpected exceptions
         key2.destroy();
diff --git a/test/jdk/com/sun/jndi/ldap/LdapPoolTimeoutTest.java b/test/jdk/com/sun/jndi/ldap/LdapPoolTimeoutTest.java
index b139f12da25..7d65298faa6 100644
--- a/test/jdk/com/sun/jndi/ldap/LdapPoolTimeoutTest.java
+++ b/test/jdk/com/sun/jndi/ldap/LdapPoolTimeoutTest.java
@@ -27,10 +27,10 @@
  * @summary Multi-threaded client timeout tests for ldap pool
  * @library /test/lib
  *          lib/
- * @run testng/othervm/timeout=480 LdapPoolTimeoutTest
+ * @run junit/othervm/timeout=480 LdapPoolTimeoutTest
  */
 
-import org.testng.annotations.Test;
+import org.junit.jupiter.api.Test;
 
 import javax.naming.Context;
 import javax.naming.NamingException;
diff --git a/test/jdk/com/sun/jndi/ldap/LdapTimeoutTest.java b/test/jdk/com/sun/jndi/ldap/LdapTimeoutTest.java
index 39bf24b9dbf..a4b032d0974 100644
--- a/test/jdk/com/sun/jndi/ldap/LdapTimeoutTest.java
+++ b/test/jdk/com/sun/jndi/ldap/LdapTimeoutTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2011, 2019, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2011, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,14 +25,17 @@
  * @test
  * @library /test/lib
  *          lib/
- * @run testng/othervm LdapTimeoutTest
+ * @run junit/othervm LdapTimeoutTest
  * @bug 7094377 8000487 6176036 7056489 8151678
  * @summary Timeout tests for ldap
  */
 
-import org.testng.Assert;
-import org.testng.annotations.BeforeTest;
-import org.testng.annotations.Test;
+import static org.junit.jupiter.api.Assertions.assertThrows;
+import static org.junit.jupiter.api.Assertions.assertTrue;
+
+import org.junit.jupiter.api.BeforeEach;
+import org.junit.jupiter.api.Test;
+import org.junit.jupiter.api.function.Executable;
 
 import javax.naming.Context;
 import javax.naming.NamingException;
@@ -60,8 +63,6 @@ import static java.lang.String.format;
 import static java.util.concurrent.TimeUnit.MILLISECONDS;
 import static java.util.concurrent.TimeUnit.NANOSECONDS;
 import static jdk.test.lib.Utils.adjustTimeout;
-import static org.testng.Assert.assertTrue;
-import static org.testng.Assert.expectThrows;
 
 public class LdapTimeoutTest {
 
@@ -90,7 +91,7 @@ public class LdapTimeoutTest {
         assert (2 * CONNECT_MILLIS + READ_MILLIS + TOLERANCE < INFINITY_MILLIS);
     }
 
-    @BeforeTest
+    @BeforeEach
     public void beforeTest() {
         startAuxiliaryDiagnosticOutput();
     }
@@ -98,11 +99,6 @@ public class LdapTimeoutTest {
     /*
      * These are timeout tests and they are run in parallel to reduce the total
      * amount of run time.
-     *
-     * Currently it doesn't seem possible to instruct JTREG to run TestNG test
-     * methods in parallel. That said, this JTREG test is still
-     * a "TestNG-flavored" test for the sake of having org.testng.Assert
-     * capability.
      */
     @Test
     public void test() throws Exception {
@@ -190,11 +186,11 @@ public class LdapTimeoutTest {
             env.put(Context.PROVIDER_URL, urlTo(server));
             server.start();
             server.starting().join();
-            Assert.ThrowingRunnable completion =
+            Executable completion =
                     () -> assertCompletion(CONNECT_MILLIS,
                                            2 * CONNECT_MILLIS + TOLERANCE,
                                            () -> new InitialDirContext(env));
-            NamingException e = expectThrows(NamingException.class, completion);
+            NamingException e = assertThrows(NamingException.class, completion);
             String msg = e.getMessage();
             assertTrue(msg != null && msg.contains("timeout")
                                && msg.contains(String.valueOf(CONNECT_MILLIS)),
@@ -214,11 +210,11 @@ public class LdapTimeoutTest {
             InitialDirContext ctx = new InitialDirContext(env);
             SearchControls scl = new SearchControls();
             scl.setSearchScope(SearchControls.SUBTREE_SCOPE);
-            Assert.ThrowingRunnable completion =
+            Executable completion =
                     () -> assertCompletion(READ_MILLIS,
                                            READ_MILLIS + TOLERANCE,
                                            () -> ctx.search("ou=People,o=JNDITutorial", "(objectClass=*)", scl));
-            NamingException e = expectThrows(NamingException.class, completion);
+            NamingException e = assertThrows(NamingException.class, completion);
             String msg = e.getMessage();
             assertTrue(msg != null && msg.contains("timeout")
                                && msg.contains(String.valueOf(READ_MILLIS)),
@@ -235,11 +231,11 @@ public class LdapTimeoutTest {
             env.put(Context.PROVIDER_URL, urlTo(server));
             server.start();
             server.starting().join();
-            Assert.ThrowingRunnable completion =
+            Executable completion =
                     () -> assertCompletion(CONNECT_MILLIS,
                                            2 * CONNECT_MILLIS + TOLERANCE,
                                            () -> new InitialDirContext(env));
-            NamingException e = expectThrows(NamingException.class, completion);
+            NamingException e = assertThrows(NamingException.class, completion);
             String msg = e.getMessage();
             assertTrue(msg != null && msg.contains("timeout")
                                && msg.contains(String.valueOf(CONNECT_MILLIS)),
@@ -261,11 +257,11 @@ public class LdapTimeoutTest {
             env.put(Context.PROVIDER_URL, urlTo(server));
             server.start();
             server.starting().join();
-            Assert.ThrowingRunnable completion =
+            Executable completion =
                     () -> assertCompletion(CONNECT_MILLIS,
                                            2 * CONNECT_MILLIS + TOLERANCE,
                                            () -> new InitialDirContext(env));
-            NamingException e = expectThrows(NamingException.class, completion);
+            NamingException e = assertThrows(NamingException.class, completion);
             String msg = e.getMessage();
             assertTrue(msg != null && msg.contains("timeout")
                                && msg.contains(String.valueOf(CONNECT_MILLIS)),
diff --git a/test/jdk/com/sun/jndi/ldap/NamingExceptionMessageTest.java b/test/jdk/com/sun/jndi/ldap/NamingExceptionMessageTest.java
index c165593ad5e..1250548b60a 100644
--- a/test/jdk/com/sun/jndi/ldap/NamingExceptionMessageTest.java
+++ b/test/jdk/com/sun/jndi/ldap/NamingExceptionMessageTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2020, 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -27,7 +27,7 @@
  * @summary Test that CommunicationException is thrown when connection is timed out or closed/cancelled,
  *  and it's text matches the failure reason.
  * @library /test/lib lib
- * @run testng NamingExceptionMessageTest
+ * @run junit NamingExceptionMessageTest
  */
 
 import javax.naming.CommunicationException;
@@ -45,8 +45,11 @@ import java.util.Hashtable;
 import java.util.concurrent.CountDownLatch;
 import java.util.concurrent.TimeUnit;
 
-import org.testng.annotations.Test;
-import org.testng.Assert;
+import org.junit.jupiter.api.Test;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertInstanceOf;
+import static org.junit.jupiter.api.Assertions.assertThrows;
+import static org.junit.jupiter.api.Assertions.assertTrue;
 import jdk.test.lib.net.URIBuilder;
 
 public class NamingExceptionMessageTest {
@@ -58,9 +61,9 @@ public class NamingExceptionMessageTest {
             ldapServer.awaitStartup();
             var env = ldapServer.getInitialLdapCtxEnvironment(TIMEOUT_VALUE);
             var communicationException =
-                    Assert.expectThrows(CommunicationException.class, () -> new InitialDirContext(env));
+                    assertThrows(CommunicationException.class, () -> new InitialDirContext(env));
             System.out.println("Got CommunicationException:" + communicationException);
-            Assert.assertEquals(communicationException.getMessage(), EXPECTED_TIMEOUT_MESSAGE);
+            assertEquals(EXPECTED_TIMEOUT_MESSAGE, communicationException.getMessage());
         }
     }
 
@@ -70,7 +73,7 @@ public class NamingExceptionMessageTest {
             ldapServer.start();
             ldapServer.awaitStartup();
             var env = ldapServer.getInitialLdapCtxEnvironment(0);
-            var namingException = Assert.expectThrows(NamingException.class, () -> new InitialDirContext(env));
+            var namingException = assertThrows(NamingException.class, () -> new InitialDirContext(env));
             if (namingException instanceof ServiceUnavailableException) {
                 // If naming exception is ServiceUnavailableException it could mean
                 // that the connection was closed on test server-side before LDAP client starts
@@ -78,11 +81,11 @@ public class NamingExceptionMessageTest {
                 System.out.println("Got ServiceUnavailableException: Test PASSED");
             } else {
                 // If exception is not ServiceUnavailableException, CommunicationException is expected
-                Assert.assertTrue(namingException instanceof CommunicationException);
+                assertInstanceOf(CommunicationException.class, namingException);
                 var communicationException = (CommunicationException) namingException;
                 System.out.println("Got CommunicationException:" + communicationException);
                 // Check exception message
-                Assert.assertEquals(communicationException.getMessage(), EXPECTED_CLOSURE_MESSAGE);
+                assertEquals(EXPECTED_CLOSURE_MESSAGE, communicationException.getMessage());
             }
         }
     }

From 1ea8ef92bcfac4f5c032b6d8bd5a5ba99a6abe2f Mon Sep 17 00:00:00 2001
From: Thomas Schatzl <tschatzl@openjdk.org>
Date: Fri, 13 Mar 2026 10:57:14 +0000
Subject: [PATCH 186/655] 8379781: G1: Full GC does not print partial array
 task stats

Reviewed-by: iwalulya, kbarrett
---
 src/hotspot/share/gc/g1/g1ConcurrentMark.cpp          | 4 ++--
 src/hotspot/share/gc/g1/g1FullCollector.cpp           | 8 +++++++-
 src/hotspot/share/gc/g1/g1FullGCMarker.hpp            | 1 +
 src/hotspot/share/gc/g1/g1ParScanThreadState.cpp      | 2 +-
 src/hotspot/share/gc/g1/g1YoungCollector.cpp          | 2 +-
 src/hotspot/share/gc/parallel/psCompactionManager.cpp | 4 ++--
 src/hotspot/share/gc/parallel/psPromotionManager.cpp  | 4 ++--
 src/hotspot/share/gc/shared/partialArrayTaskStats.cpp | 2 +-
 8 files changed, 17 insertions(+), 10 deletions(-)

diff --git a/src/hotspot/share/gc/g1/g1ConcurrentMark.cpp b/src/hotspot/share/gc/g1/g1ConcurrentMark.cpp
index a2114d8d6b6..33b21d8348d 100644
--- a/src/hotspot/share/gc/g1/g1ConcurrentMark.cpp
+++ b/src/hotspot/share/gc/g1/g1ConcurrentMark.cpp
@@ -682,14 +682,14 @@ void G1ConcurrentMark::set_concurrency_and_phase(uint active_tasks, bool concurr
 #if TASKQUEUE_STATS
 void G1ConcurrentMark::print_and_reset_taskqueue_stats() {
 
-  _task_queues->print_and_reset_taskqueue_stats("G1ConcurrentMark Oop Queue");
+  _task_queues->print_and_reset_taskqueue_stats("Concurrent Mark");
 
   auto get_pa_stats = [&](uint i) {
     return _tasks[i]->partial_array_task_stats();
   };
 
   PartialArrayTaskStats::log_set(_max_num_tasks, get_pa_stats,
-                                 "G1ConcurrentMark Partial Array Task Stats");
+                                 "Concurrent Mark Partial Array");
 
   for (uint i = 0; i < _max_num_tasks; ++i) {
     get_pa_stats(i)->reset();
diff --git a/src/hotspot/share/gc/g1/g1FullCollector.cpp b/src/hotspot/share/gc/g1/g1FullCollector.cpp
index e8498250f85..c835dd159a6 100644
--- a/src/hotspot/share/gc/g1/g1FullCollector.cpp
+++ b/src/hotspot/share/gc/g1/g1FullCollector.cpp
@@ -353,7 +353,13 @@ void G1FullCollector::phase1_mark_live_objects() {
     scope()->tracer()->report_object_count_after_gc(&_is_alive, _heap->workers());
   }
 #if TASKQUEUE_STATS
-  marking_task_queues()->print_and_reset_taskqueue_stats("Marking Task Queue");
+  marking_task_queues()->print_and_reset_taskqueue_stats("Full GC");
+
+  auto get_stats = [&](uint i) {
+    return marker(i)->partial_array_splitter().stats();
+  };
+  PartialArrayTaskStats::log_set(_num_workers, get_stats,
+                                 "Full GC Partial Array");
 #endif
 }
 
diff --git a/src/hotspot/share/gc/g1/g1FullGCMarker.hpp b/src/hotspot/share/gc/g1/g1FullGCMarker.hpp
index 5973cc841c5..82fe3655319 100644
--- a/src/hotspot/share/gc/g1/g1FullGCMarker.hpp
+++ b/src/hotspot/share/gc/g1/g1FullGCMarker.hpp
@@ -89,6 +89,7 @@ public:
   ~G1FullGCMarker();
 
   G1MarkTasksQueue* task_queue() { return &_task_queue; }
+  PartialArraySplitter& partial_array_splitter() { return _partial_array_splitter; }
 
   // Marking entry points
   template <class T> inline void mark_and_push(T* p);
diff --git a/src/hotspot/share/gc/g1/g1ParScanThreadState.cpp b/src/hotspot/share/gc/g1/g1ParScanThreadState.cpp
index 75a8ef1a336..cb857dc6eab 100644
--- a/src/hotspot/share/gc/g1/g1ParScanThreadState.cpp
+++ b/src/hotspot/share/gc/g1/g1ParScanThreadState.cpp
@@ -741,7 +741,7 @@ void G1ParScanThreadStateSet::print_partial_array_task_stats() {
     return state_for_worker(i)->partial_array_task_stats();
   };
   PartialArrayTaskStats::log_set(_num_workers, get_stats,
-                                 "Partial Array Task Stats");
+                                 "Young GC Partial Array");
 }
 
 #endif // TASKQUEUE_STATS
diff --git a/src/hotspot/share/gc/g1/g1YoungCollector.cpp b/src/hotspot/share/gc/g1/g1YoungCollector.cpp
index a9a81f846af..71a76a2e48b 100644
--- a/src/hotspot/share/gc/g1/g1YoungCollector.cpp
+++ b/src/hotspot/share/gc/g1/g1YoungCollector.cpp
@@ -1064,6 +1064,7 @@ void G1YoungCollector::post_evacuate_collection_set(G1EvacInfo* evacuation_info,
   allocator()->release_gc_alloc_regions(evacuation_info);
 
 #if TASKQUEUE_STATS
+  _g1h->task_queues()->print_and_reset_taskqueue_stats("Young GC");
   // Logging uses thread states, which are deleted by cleanup, so this must
   // be done before cleanup.
   per_thread_states->print_partial_array_task_stats();
@@ -1183,5 +1184,4 @@ void G1YoungCollector::collect() {
 
     policy()->record_young_collection_end(_concurrent_operation_is_full_mark, evacuation_alloc_failed(), _allocation_word_size);
   }
-  TASKQUEUE_STATS_ONLY(_g1h->task_queues()->print_and_reset_taskqueue_stats("Oop Queue");)
 }
diff --git a/src/hotspot/share/gc/parallel/psCompactionManager.cpp b/src/hotspot/share/gc/parallel/psCompactionManager.cpp
index b8ea47eeb09..0108f1a9762 100644
--- a/src/hotspot/share/gc/parallel/psCompactionManager.cpp
+++ b/src/hotspot/share/gc/parallel/psCompactionManager.cpp
@@ -203,13 +203,13 @@ void ParCompactionManager::remove_all_shadow_regions() {
 
 #if TASKQUEUE_STATS
 void ParCompactionManager::print_and_reset_taskqueue_stats() {
-  marking_stacks()->print_and_reset_taskqueue_stats("Marking Stacks");
+  marking_stacks()->print_and_reset_taskqueue_stats("Full GC");
 
   auto get_pa_stats = [&](uint i) {
     return _manager_array[i]->partial_array_task_stats();
   };
   PartialArrayTaskStats::log_set(ParallelGCThreads, get_pa_stats,
-                                 "Partial Array Task Stats");
+                                 "Full GC Partial Array");
   uint parallel_gc_threads = ParallelScavengeHeap::heap()->workers().max_workers();
   for (uint i = 0; i < parallel_gc_threads; ++i) {
     get_pa_stats(i)->reset();
diff --git a/src/hotspot/share/gc/parallel/psPromotionManager.cpp b/src/hotspot/share/gc/parallel/psPromotionManager.cpp
index d6208755374..39fcc5556c6 100644
--- a/src/hotspot/share/gc/parallel/psPromotionManager.cpp
+++ b/src/hotspot/share/gc/parallel/psPromotionManager.cpp
@@ -138,13 +138,13 @@ bool PSPromotionManager::post_scavenge(YoungGCTracer& gc_tracer) {
 #if TASKQUEUE_STATS
 
 void PSPromotionManager::print_and_reset_taskqueue_stats() {
-  stack_array_depth()->print_and_reset_taskqueue_stats("Oop Queue");
+  stack_array_depth()->print_and_reset_taskqueue_stats("Young GC");
 
   auto get_pa_stats = [&](uint i) {
     return manager_array(i)->partial_array_task_stats();
   };
   PartialArrayTaskStats::log_set(ParallelGCThreads, get_pa_stats,
-                                 "Partial Array Task Stats");
+                                 "Young GC Partial Array");
   for (uint i = 0; i < ParallelGCThreads; ++i) {
     get_pa_stats(i)->reset();
   }
diff --git a/src/hotspot/share/gc/shared/partialArrayTaskStats.cpp b/src/hotspot/share/gc/shared/partialArrayTaskStats.cpp
index ac8a380ec9a..090430963c6 100644
--- a/src/hotspot/share/gc/shared/partialArrayTaskStats.cpp
+++ b/src/hotspot/share/gc/shared/partialArrayTaskStats.cpp
@@ -64,7 +64,7 @@ static const char* const stats_hdr[] = {
 };
 
 void PartialArrayTaskStats::print_header(outputStream* s, const char* title) {
-  s->print_cr("%s:", title);
+  s->print_cr("GC Task Stats %s", title);
   for (uint i = 0; i < ARRAY_SIZE(stats_hdr); ++i) {
     s->print_cr("%s", stats_hdr[i]);
   }

From 28830e2155106a328382d1796c2071d2efee236e Mon Sep 17 00:00:00 2001
From: Erik Gahlin <egahlin@openjdk.org>
Date: Fri, 13 Mar 2026 13:29:11 +0000
Subject: [PATCH 187/655] 8379917: JFR: Method timing event can have incorrect
 minimum value

Reviewed-by: mgronlun
---
 .../share/classes/jdk/jfr/internal/tracing/TimedMethod.java | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/src/jdk.jfr/share/classes/jdk/jfr/internal/tracing/TimedMethod.java b/src/jdk.jfr/share/classes/jdk/jfr/internal/tracing/TimedMethod.java
index bd4f2262444..2651f5b473a 100644
--- a/src/jdk.jfr/share/classes/jdk/jfr/internal/tracing/TimedMethod.java
+++ b/src/jdk.jfr/share/classes/jdk/jfr/internal/tracing/TimedMethod.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2025, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -46,10 +46,10 @@ record TimedMethod(AtomicLong invocations, AtomicLong time, AtomicLong minimum,
             while (true) {
                 long max = maximum.get();
                 if (duration <= max) {
-                    return;
+                    break;
                 }
                 if (maximum.weakCompareAndSetVolatile(max, duration)) {
-                    return;
+                    break;
                 }
             }
         }

From a211b0442dc292c4aa6c98d4da03ceb19528dd2d Mon Sep 17 00:00:00 2001
From: Guanqiang Han <ghan@openjdk.org>
Date: Fri, 13 Mar 2026 14:59:03 +0000
Subject: [PATCH 188/655] 8378742: C2: constant folding for ModFloatingNode
 should be done in Value method

Reviewed-by: roland, vlivanov, mchevalier
---
 src/hotspot/share/opto/divnode.cpp            | 54 +++++++-----------
 src/hotspot/share/opto/divnode.hpp            |  4 +-
 .../compiler/c2/irTests/ModDNodeTests.java    | 54 +++++++++++++-----
 .../compiler/c2/irTests/ModFNodeTests.java    | 56 +++++++++++++------
 4 files changed, 99 insertions(+), 69 deletions(-)

diff --git a/src/hotspot/share/opto/divnode.cpp b/src/hotspot/share/opto/divnode.cpp
index ed72d8a11cf..c38e784a7af 100644
--- a/src/hotspot/share/opto/divnode.cpp
+++ b/src/hotspot/share/opto/divnode.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1997, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -1592,41 +1592,25 @@ const Type* ModDNode::get_result_if_constant(const Type* dividend, const Type* d
   return TypeD::make(jdouble_cast(xr));
 }
 
-Node* ModFloatingNode::Ideal(PhaseGVN* phase, bool can_reshape) {
-  if (can_reshape) {
-    PhaseIterGVN* igvn = phase->is_IterGVN();
-
-    // Either input is TOP ==> the result is TOP
-    const Type* dividend_type = phase->type(dividend());
-    const Type* divisor_type = phase->type(divisor());
-    if (dividend_type == Type::TOP || divisor_type == Type::TOP) {
-      return phase->C->top();
-    }
-    const Type* constant_result = get_result_if_constant(dividend_type, divisor_type);
-    if (constant_result != nullptr) {
-      return make_tuple_of_input_state_and_constant_result(igvn, constant_result);
-    }
+const Type* ModFloatingNode::Value(PhaseGVN* phase) const {
+  const Type* t = CallLeafPureNode::Value(phase);
+  if (t == Type::TOP) { return Type::TOP; }
+  const Type* dividend_type = phase->type(dividend());
+  const Type* divisor_type = phase->type(divisor());
+  if (dividend_type == Type::TOP || divisor_type == Type::TOP) {
+    return Type::TOP;
   }
-
-  return CallLeafPureNode::Ideal(phase, can_reshape);
-}
-
-/* Give a tuple node for ::Ideal to return, made of the input state (control to return addr)
- * and the given constant result. Idealization of projections will make sure to transparently
- * propagate the input state and replace the result by the said constant.
- */
-TupleNode* ModFloatingNode::make_tuple_of_input_state_and_constant_result(PhaseIterGVN* phase, const Type* con) const {
-  Node* con_node = phase->makecon(con);
-  TupleNode* tuple = TupleNode::make(
-      tf()->range(),
-      in(TypeFunc::Control),
-      in(TypeFunc::I_O),
-      in(TypeFunc::Memory),
-      in(TypeFunc::FramePtr),
-      in(TypeFunc::ReturnAdr),
-      con_node);
-
-  return tuple;
+  const Type* constant_result = get_result_if_constant(dividend_type, divisor_type);
+  if (constant_result != nullptr) {
+    const TypeTuple* tt = t->is_tuple();
+    uint cnt = tt->cnt();
+    uint param_cnt = cnt - TypeFunc::Parms;
+    const Type** fields = TypeTuple::fields(param_cnt);
+    fields[TypeFunc::Parms] = constant_result;
+    if (param_cnt > 1) { fields[TypeFunc::Parms + 1] = Type::HALF; }
+    return TypeTuple::make(cnt, fields);
+  }
+  return t;
 }
 
 //=============================================================================
diff --git a/src/hotspot/share/opto/divnode.hpp b/src/hotspot/share/opto/divnode.hpp
index 43432b271a4..2598429716f 100644
--- a/src/hotspot/share/opto/divnode.hpp
+++ b/src/hotspot/share/opto/divnode.hpp
@@ -175,8 +175,6 @@ public:
 
 // Base class for float and double modulus
 class ModFloatingNode : public CallLeafPureNode {
-  TupleNode* make_tuple_of_input_state_and_constant_result(PhaseIterGVN* phase, const Type* con) const;
-
 protected:
   virtual Node* dividend() const = 0;
   virtual Node* divisor() const = 0;
@@ -184,7 +182,7 @@ protected:
 
 public:
   ModFloatingNode(Compile* C, const TypeFunc* tf, address addr, const char* name);
-  Node* Ideal(PhaseGVN* phase, bool can_reshape) override;
+  const Type* Value(PhaseGVN* phase) const override;
 };
 
 // Float Modulus
diff --git a/test/hotspot/jtreg/compiler/c2/irTests/ModDNodeTests.java b/test/hotspot/jtreg/compiler/c2/irTests/ModDNodeTests.java
index 6b20b782923..ac427ea3831 100644
--- a/test/hotspot/jtreg/compiler/c2/irTests/ModDNodeTests.java
+++ b/test/hotspot/jtreg/compiler/c2/irTests/ModDNodeTests.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2024, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2024, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -29,7 +29,7 @@ import compiler.lib.ir_framework.*;
 
 /*
  * @test
- * @bug 8345766
+ * @bug 8345766 8378742
  * @key randomness
  * @summary Test that Ideal transformations of ModDNode are being performed as expected.
  * @library /test/lib /
@@ -37,6 +37,7 @@ import compiler.lib.ir_framework.*;
  */
 public class ModDNodeTests {
     public static final double q = Utils.getRandomInstance().nextDouble() * 100.0d;
+    public static volatile int volatileField;
 
     public static void main(String[] args) {
         TestFramework.run();
@@ -48,6 +49,7 @@ public class ModDNodeTests {
             "unusedResultAfterLoopOpt1",
             "unusedResultAfterLoopOpt2",
             "unusedResultAfterLoopOpt3",
+            "constantFoldInCCP"
     })
     public void runMethod() {
         Asserts.assertEQ(constant(), q % 72.0d % 30.0d);
@@ -61,6 +63,7 @@ public class ModDNodeTests {
         Asserts.assertEQ(unusedResultAfterLoopOpt1(1.1d, 2.2d), 0.d);
         Asserts.assertEQ(unusedResultAfterLoopOpt2(1.1d, 2.2d), 0.d);
         Asserts.assertEQ(unusedResultAfterLoopOpt3(1.1d, 2.2d), 0.d);
+        Asserts.assertEQ(constantFoldInCCP(), 4.0d);
     }
 
     // Note: we used to check for ConD nodes in the IR. But that is a bit brittle:
@@ -72,7 +75,7 @@ public class ModDNodeTests {
     @Test
     @IR(counts = {IRNode.MOD_D, "2"},
         phase = CompilePhase.AFTER_PARSING)
-    @IR(counts = {".*CallLeaf.*drem.*", "0"},
+    @IR(failOn = {".*CallLeaf.*drem.*"},
         phase = CompilePhase.BEFORE_MATCHING)
     public double constant() {
         // All constants available during parsing
@@ -84,7 +87,7 @@ public class ModDNodeTests {
         phase = CompilePhase.AFTER_PARSING)
     @IR(counts = {IRNode.MOD_D, "1"},
         phase = CompilePhase.PHASEIDEALLOOP1) // Only constant fold after some loop opts
-    @IR(counts = {".*CallLeaf.*drem.*", "0"},
+    @IR(failOn = {".*CallLeaf.*drem.*"},
         phase = CompilePhase.BEFORE_MATCHING)
     public double alsoConstant() {
         // Make sure value is only available after second loop opts round
@@ -102,7 +105,7 @@ public class ModDNodeTests {
         phase = CompilePhase.AFTER_PARSING)
     @IR(counts = {IRNode.MOD_D, "2"},
         phase = CompilePhase.PHASEIDEALLOOP1) // Only constant fold after some loop opts
-    @IR(counts = {".*CallLeaf.*drem.*", "0"},
+    @IR(failOn = {".*CallLeaf.*drem.*"},
         phase = CompilePhase.BEFORE_MATCHING)
     public double nanLeftConstant() {
         // Make sure value is only available after second loop opts round
@@ -120,7 +123,7 @@ public class ModDNodeTests {
         phase = CompilePhase.AFTER_PARSING)
     @IR(counts = {IRNode.MOD_D, "2"},
         phase = CompilePhase.PHASEIDEALLOOP1) // Only constant fold after some loop opts
-    @IR(counts = {".*CallLeaf.*drem.*", "0"},
+    @IR(failOn = {".*CallLeaf.*drem.*"},
         phase = CompilePhase.BEFORE_MATCHING)
     public double nanRightConstant() {
         // Make sure value is only available after second loop opts round
@@ -156,7 +159,7 @@ public class ModDNodeTests {
         phase = CompilePhase.AFTER_PARSING)
     @IR(counts = {IRNode.MOD_D, "0"},
         phase = CompilePhase.ITER_GVN1) // IGVN removes unused nodes
-    @IR(counts = {".*CallLeaf.*drem.*", "0"},
+    @IR(failOn = {".*CallLeaf.*drem.*"},
         phase = CompilePhase.BEFORE_MATCHING)
     public void unusedResult(double x, double y) {
         double unused = x % y;
@@ -165,9 +168,9 @@ public class ModDNodeTests {
     @Test
     @IR(counts = {IRNode.MOD_D, "1"},
         phase = CompilePhase.AFTER_PARSING)
-    @IR(counts = {IRNode.MOD_D, "0"},
+    @IR(failOn = {IRNode.MOD_D},
         phase = CompilePhase.ITER_GVN1) // IGVN removes unused nodes
-    @IR(counts = {".*CallLeaf.*drem.*", "0"},
+    @IR(failOn = {".*CallLeaf.*drem.*"},
         phase = CompilePhase.BEFORE_MATCHING)
     public void repeatedlyUnused(double x, double y) {
         double unused = 1.d;
@@ -185,9 +188,9 @@ public class ModDNodeTests {
         phase = CompilePhase.AFTER_PARSING)
     @IR(counts = {IRNode.MOD_D, "1"},
         phase = CompilePhase.ITER_GVN2)
-    @IR(counts = {IRNode.MOD_D, "0"},
+    @IR(failOn = {IRNode.MOD_D},
         phase = CompilePhase.BEFORE_MACRO_EXPANSION)
-    @IR(counts = {".*CallLeaf.*drem.*", "0"},
+    @IR(failOn = {".*CallLeaf.*drem.*"},
         phase = CompilePhase.BEFORE_MATCHING)
     public double unusedResultAfterLoopOpt1(double x, double y) {
         double unused = x % y;
@@ -210,9 +213,9 @@ public class ModDNodeTests {
         phase = CompilePhase.AFTER_PARSING)
     @IR(counts = {IRNode.MOD_D, "1"},
         phase = CompilePhase.AFTER_CLOOPS)
-    @IR(counts = {IRNode.MOD_D, "0"},
+    @IR(failOn = {IRNode.MOD_D},
         phase = CompilePhase.PHASEIDEALLOOP1)
-    @IR(counts = {".*CallLeaf.*drem.*", "0"},
+    @IR(failOn = {".*CallLeaf.*drem.*"},
         phase = CompilePhase.BEFORE_MATCHING)
     public double unusedResultAfterLoopOpt2(double x, double y) {
         int a = 77;
@@ -235,9 +238,9 @@ public class ModDNodeTests {
         phase = CompilePhase.AFTER_PARSING)
     @IR(counts = {IRNode.MOD_D, "2"},
         phase = CompilePhase.AFTER_CLOOPS) // drop the useless one
-    @IR(counts = {IRNode.MOD_D, "0"},
+    @IR(failOn = {IRNode.MOD_D},
         phase = CompilePhase.PHASEIDEALLOOP1) // drop the rest
-    @IR(counts = {".*CallLeaf.*drem.*", "0"},
+    @IR(failOn = {".*CallLeaf.*drem.*"},
         phase = CompilePhase.BEFORE_MATCHING)
     public double unusedResultAfterLoopOpt3(double x, double y) {
         double unused = x % y;
@@ -252,4 +255,25 @@ public class ModDNodeTests {
         int other = (b - 77) * (int)(x % y % 1.d);
         return (double)other;
     }
+
+    @Test
+    @IR(failOn = {IRNode.CMP_D},
+        phase = CompilePhase.CCP1)
+    @IR(failOn = {IRNode.MOD_D},
+        phase = CompilePhase.BEFORE_MACRO_EXPANSION)
+    public double constantFoldInCCP(){
+        int i;
+        for (i = 2; i < 4; i *= 2) {
+        }
+        int j;
+        for (j = 2; j < 4; j *= 2) {
+        }
+        volatileField = 42;
+        double v1 = (double) i / 2;
+        double v2 = j;
+        double v = v1 % v2;
+        for (; v < v2; v *= 2) {
+        }
+        return v;
+    }
 }
diff --git a/test/hotspot/jtreg/compiler/c2/irTests/ModFNodeTests.java b/test/hotspot/jtreg/compiler/c2/irTests/ModFNodeTests.java
index 2f69578c2f0..f703df3d04e 100644
--- a/test/hotspot/jtreg/compiler/c2/irTests/ModFNodeTests.java
+++ b/test/hotspot/jtreg/compiler/c2/irTests/ModFNodeTests.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2024, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2024, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -29,7 +29,7 @@ import compiler.lib.ir_framework.*;
 
 /*
  * @test
- * @bug 8345766
+ * @bug 8345766 8378742
  * @key randomness
  * @summary Test that Ideal transformations of ModFNode are being performed as expected.
  * @library /test/lib /
@@ -37,6 +37,7 @@ import compiler.lib.ir_framework.*;
  */
 public class ModFNodeTests {
     public static final float q = Utils.getRandomInstance().nextFloat() * 100.0f;
+    public static volatile int volatileField;
 
     public static void main(String[] args) {
         TestFramework.run();
@@ -48,6 +49,7 @@ public class ModFNodeTests {
             "unusedResultAfterLoopOpt1",
             "unusedResultAfterLoopOpt2",
             "unusedResultAfterLoopOpt3",
+            "constantFoldInCCP"
     })
     public void runMethod() {
         Asserts.assertEQ(constant(), q % 72.0f % 30.0f);
@@ -61,6 +63,7 @@ public class ModFNodeTests {
         Asserts.assertEQ(unusedResultAfterLoopOpt1(1.1f, 2.2f), 0.f);
         Asserts.assertEQ(unusedResultAfterLoopOpt2(1.1f, 2.2f), 0.f);
         Asserts.assertEQ(unusedResultAfterLoopOpt3(1.1f, 2.2f), 0.f);
+        Asserts.assertEQ(constantFoldInCCP(), 4.0f);
     }
 
     // Note: we used to check for ConF nodes in the IR. But that is a bit brittle:
@@ -72,7 +75,7 @@ public class ModFNodeTests {
     @Test
     @IR(counts = {IRNode.MOD_F, "2"},
         phase = CompilePhase.AFTER_PARSING)
-    @IR(counts = {".*CallLeaf.*frem.*", "0"},
+    @IR(failOn = {".*CallLeaf.*frem.*"},
         phase = CompilePhase.BEFORE_MATCHING)
     public float constant() {
         // All constants available during parsing
@@ -84,7 +87,7 @@ public class ModFNodeTests {
         phase = CompilePhase.AFTER_PARSING)
     @IR(counts = {IRNode.MOD_F, "1"},
         phase = CompilePhase.PHASEIDEALLOOP1) // Only constant fold after some loop opts
-    @IR(counts = {".*CallLeaf.*frem.*", "0"},
+    @IR(failOn = {".*CallLeaf.*frem.*"},
         phase = CompilePhase.BEFORE_MATCHING)
     public float alsoConstant() {
         // Make sure value is only available after second loop opts round
@@ -102,7 +105,7 @@ public class ModFNodeTests {
         phase = CompilePhase.AFTER_PARSING)
     @IR(counts = {IRNode.MOD_F, "2"},
         phase = CompilePhase.PHASEIDEALLOOP1) // Only constant fold after some loop opts
-    @IR(counts = {".*CallLeaf.*frem.*", "0"},
+    @IR(failOn = {".*CallLeaf.*frem.*"},
         phase = CompilePhase.BEFORE_MATCHING)
     public float nanLeftConstant() {
         // Make sure value is only available after second loop opts round
@@ -120,7 +123,7 @@ public class ModFNodeTests {
         phase = CompilePhase.AFTER_PARSING)
     @IR(counts = {IRNode.MOD_F, "2"},
         phase = CompilePhase.PHASEIDEALLOOP1) // Only constant fold after some loop opts
-    @IR(counts = {".*CallLeaf.*frem.*", "0"},
+    @IR(failOn = {".*CallLeaf.*frem.*"},
         phase = CompilePhase.BEFORE_MATCHING)
     public float nanRightConstant() {
         // Make sure value is only available after second loop opts round
@@ -154,9 +157,9 @@ public class ModFNodeTests {
     @Test
     @IR(counts = {IRNode.MOD_F, "1"},
         phase = CompilePhase.AFTER_PARSING)
-    @IR(counts = {IRNode.MOD_F, "0"},
+    @IR(failOn = {IRNode.MOD_F},
         phase = CompilePhase.ITER_GVN1) // IGVN removes unused nodes
-    @IR(counts = {".*CallLeaf.*frem.*", "0"},
+    @IR(failOn = {".*CallLeaf.*frem.*"},
         phase = CompilePhase.BEFORE_MATCHING)
     public void unusedResult(float x, float y) {
         float unused = x % y;
@@ -165,9 +168,9 @@ public class ModFNodeTests {
     @Test
     @IR(counts = {IRNode.MOD_F, "1"},
         phase = CompilePhase.AFTER_PARSING)
-    @IR(counts = {IRNode.MOD_F, "0"},
+    @IR(failOn = {IRNode.MOD_F},
         phase = CompilePhase.ITER_GVN1) // IGVN removes unused nodes
-    @IR(counts = {".*CallLeaf.*frem.*", "0"},
+    @IR(failOn = {".*CallLeaf.*frem.*"},
         phase = CompilePhase.BEFORE_MATCHING)
     public void repeatedlyUnused(float x, float y) {
         float unused = 1.f;
@@ -185,9 +188,9 @@ public class ModFNodeTests {
         phase = CompilePhase.AFTER_PARSING)
     @IR(counts = {IRNode.MOD_F, "1"},
         phase = CompilePhase.ITER_GVN2)
-    @IR(counts = {IRNode.MOD_F, "0"},
+    @IR(failOn = {IRNode.MOD_F},
         phase = CompilePhase.BEFORE_MACRO_EXPANSION)
-    @IR(counts = {".*CallLeaf.*frem.*", "0"},
+    @IR(failOn = {".*CallLeaf.*frem.*"},
         phase = CompilePhase.BEFORE_MATCHING)
     public float unusedResultAfterLoopOpt1(float x, float y) {
         float unused = x % y;
@@ -210,9 +213,9 @@ public class ModFNodeTests {
         phase = CompilePhase.AFTER_PARSING)
     @IR(counts = {IRNode.MOD_F, "1"},
         phase = CompilePhase.AFTER_CLOOPS)
-    @IR(counts = {IRNode.MOD_F, "0"},
+    @IR(failOn = {IRNode.MOD_F},
         phase = CompilePhase.PHASEIDEALLOOP1)
-    @IR(counts = {".*CallLeaf.*frem.*", "0"},
+    @IR(failOn = {".*CallLeaf.*frem.*"},
         phase = CompilePhase.BEFORE_MATCHING)
     public float unusedResultAfterLoopOpt2(float x, float y) {
         int a = 77;
@@ -235,9 +238,9 @@ public class ModFNodeTests {
         phase = CompilePhase.AFTER_PARSING)
     @IR(counts = {IRNode.MOD_F, "2"},
         phase = CompilePhase.AFTER_CLOOPS) // drop the useless one
-    @IR(counts = {IRNode.MOD_F, "0"},
+    @IR(failOn = {IRNode.MOD_F},
         phase = CompilePhase.PHASEIDEALLOOP1) // drop the rest
-    @IR(counts = {".*CallLeaf.*frem.*", "0"},
+    @IR(failOn = {".*CallLeaf.*frem.*"},
         phase = CompilePhase.BEFORE_MATCHING)
     public float unusedResultAfterLoopOpt3(float x, float y) {
         float unused = x % y;
@@ -252,4 +255,25 @@ public class ModFNodeTests {
         int other = (b - 77) * (int)(x % y % 1.f);
         return (float)other;
     }
+
+    @Test
+    @IR(failOn = {IRNode.CMP_F},
+        phase = CompilePhase.CCP1)
+    @IR(failOn = {IRNode.MOD_F},
+        phase = CompilePhase.BEFORE_MACRO_EXPANSION)
+    public float constantFoldInCCP(){
+        int i;
+        for (i = 2; i < 4; i *= 2) {
+        }
+        int j;
+        for (j = 2; j < 4; j *= 2) {
+        }
+        volatileField = 42;
+        float v1 = (float) i / 2;
+        float v2 = j;
+        float v = v1 % v2;
+        for (; v < v2; v *= 2) {
+        }
+        return v;
+    }
 }

From e9446e15546aa37e7550dac293a3ed6131f2b500 Mon Sep 17 00:00:00 2001
From: Ben Perez <bperez@openjdk.org>
Date: Fri, 13 Mar 2026 15:02:02 +0000
Subject: [PATCH 189/655] 8368841: X25519 implementation differs from the
 specification in RFC 7748

Reviewed-by: ascarpino, semery
---
 .../sun/security/ec/XDHPublicKeyImpl.java     |  9 +++-
 .../sun/security/ec/XECOperations.java        |  8 +++-
 test/jdk/sun/security/ec/xec/TestXDH.java     | 45 +++++++++++++----
 test/jdk/sun/security/ec/xec/TestXECOps.java  | 48 +++++++++++++++----
 test/lib/jdk/test/lib/Convert.java            | 22 +--------
 5 files changed, 89 insertions(+), 43 deletions(-)

diff --git a/src/java.base/share/classes/sun/security/ec/XDHPublicKeyImpl.java b/src/java.base/share/classes/sun/security/ec/XDHPublicKeyImpl.java
index e6f8961f412..e161880f883 100644
--- a/src/java.base/share/classes/sun/security/ec/XDHPublicKeyImpl.java
+++ b/src/java.base/share/classes/sun/security/ec/XDHPublicKeyImpl.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2023, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -54,7 +54,11 @@ public final class XDHPublicKeyImpl extends X509Key implements XECPublicKey {
 
         this.paramSpec = new NamedParameterSpec(params.getName());
         this.algid = new AlgorithmId(params.getOid());
-        this.u = u.mod(params.getP());
+
+        // RFC 7748 Section 5 requires the MSB of `u` to be zeroed for X25519
+        this.u = (params == XECParameters.X448) ?
+            u.mod(params.getP()) :
+            u.clearBit(255).mod(params.getP());
 
         byte[] u_arr = this.u.toByteArray();
         reverse(u_arr);
@@ -72,6 +76,7 @@ public final class XDHPublicKeyImpl extends X509Key implements XECPublicKey {
         XECParameters params =
             XECParameters.get(InvalidKeyException::new, algid);
         this.paramSpec = new NamedParameterSpec(params.getName());
+
         // construct the BigInteger representation
         byte[] u_arr = getKey().toByteArray();
         reverse(u_arr);
diff --git a/src/java.base/share/classes/sun/security/ec/XECOperations.java b/src/java.base/share/classes/sun/security/ec/XECOperations.java
index dd8aa482cc3..0ea39a10d40 100644
--- a/src/java.base/share/classes/sun/security/ec/XECOperations.java
+++ b/src/java.base/share/classes/sun/security/ec/XECOperations.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2022, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -89,7 +89,11 @@ public class XECOperations {
      */
     public byte[] encodedPointMultiply(byte[] k, BigInteger u) {
         pruneK(k);
-        ImmutableIntegerModuloP elemU = field.getElement(u);
+
+        ImmutableIntegerModuloP elemU = (params == XECParameters.X448) ?
+            field.getElement(u) :
+            field.getElement(u.clearBit(255));
+
         return pointMultiply(k, elemU).asByteArray(params.getBytes());
     }
 
diff --git a/test/jdk/sun/security/ec/xec/TestXDH.java b/test/jdk/sun/security/ec/xec/TestXDH.java
index a32da875fa5..30c3b433406 100644
--- a/test/jdk/sun/security/ec/xec/TestXDH.java
+++ b/test/jdk/sun/security/ec/xec/TestXDH.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,20 +23,32 @@
 
 /*
  * @test
- * @bug 8171277 8206915
+ * @bug 8171277 8206915 8368841
  * @summary Test XDH key agreement
  * @library /test/lib
- * @build jdk.test.lib.Convert
  * @run main TestXDH
  */
 
-import java.security.*;
-import java.security.spec.*;
-import javax.crypto.*;
+import java.math.BigInteger;
+import java.security.InvalidKeyException;
+import java.security.InvalidParameterException;
+import java.security.KeyFactory;
+import java.security.KeyPair;
+import java.security.KeyPairGenerator;
+import java.security.PublicKey;
+import java.security.PrivateKey;
+import java.security.spec.AlgorithmParameterSpec;
+import java.security.spec.InvalidKeySpecException;
+import java.security.spec.KeySpec;
+import java.security.spec.NamedParameterSpec;
+import java.security.spec.PKCS8EncodedKeySpec;
+import java.security.spec.X509EncodedKeySpec;
+import java.security.spec.XECPublicKeySpec;
+import java.security.spec.XECPrivateKeySpec;
+import javax.crypto.KeyAgreement;
 import java.util.Arrays;
 import java.util.HexFormat;
 
-import jdk.test.lib.Convert;
 import jdk.test.lib.hexdump.ASN1Formatter;
 import jdk.test.lib.hexdump.HexPrinter;
 
@@ -354,7 +366,6 @@ public class TestXDH {
             throw new RuntimeException("fail: expected=" + result + ", actual="
                 + HexFormat.of().withUpperCase().formatHex(sharedSecret));
         }
-
     }
 
     private static void runDiffieHellmanTest(String curveName, String a_pri,
@@ -365,9 +376,8 @@ public class TestXDH {
         KeySpec privateSpec = new XECPrivateKeySpec(paramSpec,
             HexFormat.of().parseHex(a_pri));
         PrivateKey privateKey = kf.generatePrivate(privateSpec);
-        boolean clearHighBit = curveName.equals("X25519");
         KeySpec publicSpec = new XECPublicKeySpec(paramSpec,
-            Convert.hexStringToBigInteger(clearHighBit, b_pub));
+            hexStringToBigInteger(b_pub));
         PublicKey publicKey = kf.generatePublic(publicSpec);
 
         byte[] encodedPrivateKey = privateKey.getEncoded();
@@ -394,6 +404,21 @@ public class TestXDH {
         }
     }
 
+    /*
+     * Converts a hexidecimal string to the corresponding little-endian
+     * number as a BigInteger
+     */
+    private static BigInteger hexStringToBigInteger(String str) {
+        BigInteger result = BigInteger.ZERO;
+        for (int i = 0; i < str.length() / 2; i++) {
+            int curVal = Character.digit(str.charAt(2 * i), 16);
+            curVal <<= 4;
+            curVal += Character.digit(str.charAt(2 * i + 1), 16);
+            result = result.add(BigInteger.valueOf(curVal).shiftLeft(8 * i));
+        }
+        return result;
+    }
+
     /*
      * Ensure that SunEC rejects parameters/points for the wrong curve
      * when the algorithm ID for a specific curve is specified.
diff --git a/test/jdk/sun/security/ec/xec/TestXECOps.java b/test/jdk/sun/security/ec/xec/TestXECOps.java
index cdbcf95fc0b..a7533b89c02 100644
--- a/test/jdk/sun/security/ec/xec/TestXECOps.java
+++ b/test/jdk/sun/security/ec/xec/TestXECOps.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2023, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -31,8 +31,9 @@
  * @run main TestXECOps
  */
 
-import sun.security.ec.*;
-
+import sun.security.ec.XECOperations;
+import sun.security.ec.XECParameters;
+import java.math.BigInteger;
 import java.security.spec.NamedParameterSpec;
 import java.util.*;
 import jdk.test.lib.Convert;
@@ -93,6 +94,7 @@ public class TestXECOps {
             XECParameters.get(RuntimeException::new, paramSpec);
         XECOperations ops = new XECOperations(settings);
 
+        // Test encodedPointMultiply(byte[] k, byte[] u)
         byte[] basePoint = Convert.byteToByteArray(settings.getBasePoint(),
             settings.getBytes());
         byte[] a = HexFormat.of().parseHex(a_str);
@@ -101,18 +103,29 @@ public class TestXECOps {
 
         byte[] a_copy = Arrays.copyOf(a, a.length);
         byte[] b_copy = Arrays.copyOf(b, b.length);
-        byte[] basePoint_copy = Arrays.copyOf(basePoint, basePoint.length);
 
         byte[] resultA = ops.encodedPointMultiply(b,
             ops.encodedPointMultiply(a, basePoint));
         byte[] resultB = ops.encodedPointMultiply(a_copy,
-            ops.encodedPointMultiply(b_copy, basePoint_copy));
+            ops.encodedPointMultiply(b_copy, basePoint));
         if (!Arrays.equals(resultA, expectedResult)) {
             throw new RuntimeException("fail");
         }
         if (!Arrays.equals(resultB, expectedResult)) {
             throw new RuntimeException("fail");
         }
+
+        // Test encodedPointMultiply(byte[] k, BigInteger u)
+        reverse(basePoint);
+        BigInteger bp = new BigInteger(1, basePoint);
+        byte[] c = HexFormat.of().parseHex(a_str);
+        byte[] d = HexFormat.of().parseHex(b_str);
+
+        byte[] res0 = ops.encodedPointMultiply(d,
+            ops.encodedPointMultiply(c, bp));
+        if (!Arrays.equals(res0, expectedResult)) {
+            throw new RuntimeException("bigint fail");
+        }
     }
 
     private void runTest(String opName, String k_in_str,
@@ -125,12 +138,31 @@ public class TestXECOps {
         NamedParameterSpec paramSpec = new NamedParameterSpec(opName);
         XECParameters settings =
             XECParameters.get(RuntimeException::new, paramSpec);
-        XECOperations ops = new XECOperations(settings);
-        byte[] u_out = ops.encodedPointMultiply(k_in, u_in);
 
-        if (!Arrays.equals(u_out, u_out_expected)) {
+        // Test encodedPointMultiply(byte[] k, byte[] u)
+        XECOperations ops = new XECOperations(settings);
+        byte[] res0 = ops.encodedPointMultiply(k_in, u_in);
+
+        if (!Arrays.equals(res0, u_out_expected)) {
             throw new RuntimeException("fail");
         }
+
+        // Test encodedPointMultiply(byte[] k, BigInteger u)
+        reverse(u_in);
+        BigInteger u = new BigInteger(1, u_in);
+        byte[] res1 = ops.encodedPointMultiply(k_in, u);
+
+        if (!Arrays.equals(res1, u_out_expected)) {
+            throw new RuntimeException("fail");
+        }
+    }
+
+    private static void reverse(byte[] array) {
+        for (int i = 0; i < array.length / 2; i++) {
+            byte temp = array[i];
+            array[i] = array[array.length - i - 1];
+            array[array.length - i - 1] = temp;
+        }
     }
 }
 
diff --git a/test/lib/jdk/test/lib/Convert.java b/test/lib/jdk/test/lib/Convert.java
index 7ed1112c94d..2738e04c2f0 100644
--- a/test/lib/jdk/test/lib/Convert.java
+++ b/test/lib/jdk/test/lib/Convert.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -41,26 +41,6 @@ public class Convert {
         return result;
     }
 
-    /*
-     * Convert a hexadecimal string to the corresponding little-ending number
-     * as a BigInteger. The clearHighBit argument determines whether the most
-     * significant bit of the highest byte should be set to 0 in the result.
-     */
-    public static
-    BigInteger hexStringToBigInteger(boolean clearHighBit, String str) {
-        BigInteger result = BigInteger.ZERO;
-        for (int i = 0; i < str.length() / 2; i++) {
-            int curVal = Character.digit(str.charAt(2 * i), 16);
-            curVal <<= 4;
-            curVal += Character.digit(str.charAt(2 * i + 1), 16);
-            if (clearHighBit && i == str.length() / 2 - 1) {
-                curVal &= 0x7F;
-            }
-            result = result.add(BigInteger.valueOf(curVal).shiftLeft(8 * i));
-        }
-        return result;
-    }
-
     private static EdECPoint byteArrayToEdPoint(byte[] arr) {
         byte msb = arr[arr.length - 1];
         boolean xOdd = (msb & 0x80) != 0;

From 92fafa4ae3a02bb35d69915342432a948b643c4b Mon Sep 17 00:00:00 2001
From: Anton Artemov <aartemov@openjdk.org>
Date: Fri, 13 Mar 2026 15:28:20 +0000
Subject: [PATCH 190/655] 8377603: Review worst-case testing of inverse
 hyperbolic methods

Reviewed-by: darcy
---
 test/jdk/java/lang/Math/HyperbolicTests.java  |  2 +-
 .../java/lang/StrictMath/HyperbolicTests.java | 25 +++++++++++++++++++
 2 files changed, 26 insertions(+), 1 deletion(-)

diff --git a/test/jdk/java/lang/Math/HyperbolicTests.java b/test/jdk/java/lang/Math/HyperbolicTests.java
index ac5526c1953..f45f0d25a48 100644
--- a/test/jdk/java/lang/Math/HyperbolicTests.java
+++ b/test/jdk/java/lang/Math/HyperbolicTests.java
@@ -2233,7 +2233,7 @@ public class HyperbolicTests {
     }
 
     /**
-     * Test accuracy of {Math, StrictMath}.tanh using quad precision
+     * Test accuracy of {Math, StrictMath}.atanh using quad precision
      * tanh implementation as the reference. There are additional tests.
      * The specified accuracy is 2.5 ulps.
      *
diff --git a/test/jdk/java/lang/StrictMath/HyperbolicTests.java b/test/jdk/java/lang/StrictMath/HyperbolicTests.java
index 4be1b350c1d..9eaed0a081a 100644
--- a/test/jdk/java/lang/StrictMath/HyperbolicTests.java
+++ b/test/jdk/java/lang/StrictMath/HyperbolicTests.java
@@ -595,6 +595,13 @@ public class HyperbolicTests {
                 {0x1.fffffffffff92p+1,  0x1.0c1f8a6e80edp+1},
                 {0x1.0108b83c4bbc8p-1,  0x1.ee9c256f3947ep-2},
                 {-0x1.c41e527b70f43p-3, -0x1.c0863c7dece22p-3},
+
+                // Julia worst case
+                {-0x1.02657ff36d5f3p-2, -0x1.ff75bb69b0bf6p-3},
+
+                // Empirical worst-case points in other libraries with
+                // larger worst-case errors than FDLIBM
+                {0x1.0ab3fc30267c2p-1, 0x1.ffd39fc024fbp-2},
         };
 
         for (double[] testCase: testCases) {
@@ -643,6 +650,15 @@ public class HyperbolicTests {
                 {0x1.ff66e0de4dc6fp+1023,   0x1.633cc2ae1c934p+9},
                 {0x1.f97ccb0aef314p+11,     0x1.1ff088806d82ep+3},
                 {0x1.fdf28623ef923p+1021,   0x1.628af341989dap+9},
+
+                // Julia worst case
+                {0x1.0001ff6afc4bap+0, 0x1.ffb5238940116p-8},
+
+                // Empirical worst-case points in other libraries with
+                // larger worst-case errors than FDLIBM
+                {0x1.0007fd4307b75p+0, 0x1.ffa704d280935p-7},
+                {0x1.071334daf83adp+0, 0x1.e063ca7176ffdp-3},
+                {0x1.1d7bc19163966p+0, 0x1.e6db4d68a00dcp-2},
         };
 
         for (double[] testCase: testCases) {
@@ -709,6 +725,15 @@ public class HyperbolicTests {
             {0x1.ffffffffffffep-2, 0x1.193ea7aad0309p-1},
             {0x1.ffffffffffffbp-1, 0x1.1e9067763b478p+4},
             {0x1.ffffffffffffep-1, 0x1.25e4f7b2737fap+4},
+
+            // Julia worst case
+            {-0x1.f97fabc0650c4p-4, -0x1.fc16bb2fd3672p-4},
+
+            // Empirical worst-case points in other libraries with
+            // larger worst-case errors than FDLIBM
+            {0x1.ffd834a270fp-10, 0x1.ffd85f432fed2p-10},
+            {-0x1.ffbe8dd88527fp-9, -0x1.ffbf38422c2dbp-9},
+            {-0x1.e7c1f36602014p-4, -0x1.ea153d6c96817p-4},
         };
 
         for (double[] testCase: testCases)

From 1b81d0ac1d2b28e5822665b179b3d7986f077e80 Mon Sep 17 00:00:00 2001
From: Ozan Cetin <ozanctn@amazon.com>
Date: Fri, 13 Mar 2026 15:46:41 +0000
Subject: [PATCH 191/655] 8379544: C2: URShiftI Ideal optimization opportunity
 for  - 3rd level notification required

Reviewed-by: qamai, dfenacci
---
 src/hotspot/share/opto/phaseX.cpp             | 13 ++++++
 .../c2/gvn/MissedURShiftIAddILShiftIdeal.java | 43 +++++++++++++++++--
 2 files changed, 53 insertions(+), 3 deletions(-)

diff --git a/src/hotspot/share/opto/phaseX.cpp b/src/hotspot/share/opto/phaseX.cpp
index 082746f80b7..29961e152b3 100644
--- a/src/hotspot/share/opto/phaseX.cpp
+++ b/src/hotspot/share/opto/phaseX.cpp
@@ -2588,6 +2588,19 @@ void PhaseIterGVN::add_users_of_use_to_worklist(Node* n, Node* use, Unique_Node_
       return u->Opcode() == Op_URShiftI || u->Opcode() == Op_URShiftL;
     });
   }
+  // If changed LShiftI/LShiftL inputs, check AddI/AddL users for their
+  // URShiftI/URShiftL users for "((x << z) + y) >>> z" optimization opportunity
+  // (see URShiftINode::Ideal). Handles the case where the LShift input changes.
+  if (use_op == Op_LShiftI || use_op == Op_LShiftL) {
+    for (DUIterator_Fast i2max, i2 = use->fast_outs(i2max); i2 < i2max; i2++) {
+      Node* add = use->fast_out(i2);
+      if (add->Opcode() == Op_AddI || add->Opcode() == Op_AddL) {
+        add_users_to_worklist_if(worklist, add, [](Node* u) {
+          return u->Opcode() == Op_URShiftI || u->Opcode() == Op_URShiftL;
+        });
+      }
+    }
+  }
   // If changed AndI/AndL inputs, check RShift/URShift users for "(x & mask) >> shift" optimization opportunity
   if (use_op == Op_AndI || use_op == Op_AndL) {
     add_users_to_worklist_if(worklist, use, [](Node* u) {
diff --git a/test/hotspot/jtreg/compiler/c2/gvn/MissedURShiftIAddILShiftIdeal.java b/test/hotspot/jtreg/compiler/c2/gvn/MissedURShiftIAddILShiftIdeal.java
index dd446d8bb25..a953ea3bcca 100644
--- a/test/hotspot/jtreg/compiler/c2/gvn/MissedURShiftIAddILShiftIdeal.java
+++ b/test/hotspot/jtreg/compiler/c2/gvn/MissedURShiftIAddILShiftIdeal.java
@@ -30,7 +30,7 @@ import java.util.Random;
 
 /*
  * @test
- * @bug 8378413
+ * @bug 8378413 8379544
  * @key randomness
  * @summary Verify that URShift{I,L}Node::Ideal optimizes ((x << C) + y) >>> C
  *          regardless of Add input order, i.e. it is commutative w.r.t. the addition.
@@ -50,8 +50,8 @@ public class MissedURShiftIAddILShiftIdeal {
         framework.start();
     }
 
-    @Run(test = {"testI", "testICommuted", "testIComputedY",
-                  "testL", "testLCommuted", "testLComputedY"})
+    @Run(test = {"testI", "testICommuted", "testIComputedY", "testIComputedX",
+                  "testL", "testLCommuted", "testLComputedY", "testLComputedX"})
     public void runMethod() {
         int xi = RANDOM.nextInt();
         int yi = RANDOM.nextInt();
@@ -71,6 +71,7 @@ public class MissedURShiftIAddILShiftIdeal {
         Asserts.assertEQ(((x << 3) + y) >>> 3, testI(x, y));
         Asserts.assertEQ((y + (x << 5)) >>> 5, testICommuted(x, y));
         Asserts.assertEQ(((x << 7) + (a ^ b)) >>> 7, testIComputedY(x, a, b));
+        Asserts.assertEQ((((a ^ b) << 19) + y) >>> 19, testIComputedX(a, b, y));
     }
 
     @DontCompile
@@ -78,6 +79,7 @@ public class MissedURShiftIAddILShiftIdeal {
         Asserts.assertEQ(((x << 9) + y) >>> 9, testL(x, y));
         Asserts.assertEQ((y + (x << 11)) >>> 11, testLCommuted(x, y));
         Asserts.assertEQ(((x << 13) + (a ^ b)) >>> 13, testLComputedY(x, a, b));
+        Asserts.assertEQ((((a ^ b) << 19) + y) >>> 19, testLComputedX(a, b, y));
     }
 
     @Test
@@ -135,4 +137,39 @@ public class MissedURShiftIAddILShiftIdeal {
     static long testLComputedY(long x, long a, long b) {
         return ((x << 13) + (a ^ b)) >>> 13;
     }
+
+    @Test
+    // (((a ^ b) << v) + y) >>> 19  =>  ((a ^ b) + (y >>> 19)) & mask
+    // v is only known to be 19 after loop optimization, so LShiftI's shift count
+    // changes mid-IGVN. URShiftI must be notified through AddI (Case 2).
+    @IR(counts = {IRNode.LSHIFT_I,  "0",
+                  IRNode.URSHIFT_I, "1",
+                  IRNode.AND_I,     "1"})
+    static int testIComputedX(int a, int b, int y) {
+        int u = 19;
+        int v = 0;
+        do {
+            u--;
+            v++;
+        } while (u > 0);
+        return (((a ^ b) << v) + y) >>> 19;
+    }
+
+    @Test
+    // (((a ^ b) << v) + y) >>> 19  =>  ((a ^ b) + (y >>> 19)) & mask
+    // v is only known to be 19 after loop optimization, so LShiftL's shift count
+    // changes mid-IGVN. URShiftL must be notified through AddL (Case 2).
+    @IR(counts = {IRNode.LSHIFT_L,  "0",
+                  IRNode.URSHIFT_L, "1",
+                  IRNode.AND_L,     "1"})
+    static long testLComputedX(long a, long b, long y) {
+        int u = 19;
+        int v = 0;
+        do {
+            u--;
+            v++;
+        } while (u > 0);
+        return (((a ^ b) << v) + y) >>> 19;
+    }
+
 }

From 06ea3858b1d031413e73b97e6e6edaa4c62142a6 Mon Sep 17 00:00:00 2001
From: Mahendra Chhipa <mchhipa@openjdk.org>
Date: Fri, 13 Mar 2026 15:55:19 +0000
Subject: [PATCH 192/655] 8379528: Add @required in open/test/jdk/:jdk_sctp
 test, as these are applicable only on linux platforms

Reviewed-by: mbaesken, syan
---
 test/jdk/com/sun/nio/sctp/SctpChannel/Bind.java                | 3 ++-
 test/jdk/com/sun/nio/sctp/SctpChannel/CloseDescriptors.java    | 2 +-
 test/jdk/com/sun/nio/sctp/SctpChannel/CommUp.java              | 3 ++-
 test/jdk/com/sun/nio/sctp/SctpChannel/Connect.java             | 3 ++-
 test/jdk/com/sun/nio/sctp/SctpChannel/Receive.java             | 3 ++-
 test/jdk/com/sun/nio/sctp/SctpChannel/ReceiveIntoDirect.java   | 3 ++-
 test/jdk/com/sun/nio/sctp/SctpChannel/Send.java                | 3 ++-
 test/jdk/com/sun/nio/sctp/SctpChannel/Shutdown.java            | 3 ++-
 test/jdk/com/sun/nio/sctp/SctpChannel/SocketOptionTests.java   | 3 ++-
 test/jdk/com/sun/nio/sctp/SctpMultiChannel/Branch.java         | 3 ++-
 .../com/sun/nio/sctp/SctpMultiChannel/CloseDescriptors.java    | 2 +-
 test/jdk/com/sun/nio/sctp/SctpMultiChannel/Send.java           | 3 ++-
 test/jdk/com/sun/nio/sctp/SctpMultiChannel/SendFailed.java     | 3 ++-
 .../com/sun/nio/sctp/SctpMultiChannel/SocketOptionTests.java   | 3 ++-
 test/jdk/com/sun/nio/sctp/SctpServerChannel/Accept.java        | 3 ++-
 .../com/sun/nio/sctp/SctpServerChannel/NonBlockingAccept.java  | 3 ++-
 16 files changed, 30 insertions(+), 16 deletions(-)

diff --git a/test/jdk/com/sun/nio/sctp/SctpChannel/Bind.java b/test/jdk/com/sun/nio/sctp/SctpChannel/Bind.java
index ff5ca00846c..a1eb2233b02 100644
--- a/test/jdk/com/sun/nio/sctp/SctpChannel/Bind.java
+++ b/test/jdk/com/sun/nio/sctp/SctpChannel/Bind.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2009, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2009, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,6 +23,7 @@
 
 /* @test
  * @bug 4927640
+ * @requires (os.family == "linux")
  * @library /test/lib
  * @summary Tests the SCTP protocol implementation
  * @author chegar
diff --git a/test/jdk/com/sun/nio/sctp/SctpChannel/CloseDescriptors.java b/test/jdk/com/sun/nio/sctp/SctpChannel/CloseDescriptors.java
index 5d62b88f23e..bf5872b06d3 100644
--- a/test/jdk/com/sun/nio/sctp/SctpChannel/CloseDescriptors.java
+++ b/test/jdk/com/sun/nio/sctp/SctpChannel/CloseDescriptors.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2021, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2021, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
diff --git a/test/jdk/com/sun/nio/sctp/SctpChannel/CommUp.java b/test/jdk/com/sun/nio/sctp/SctpChannel/CommUp.java
index 320e556f800..67a946c15d0 100644
--- a/test/jdk/com/sun/nio/sctp/SctpChannel/CommUp.java
+++ b/test/jdk/com/sun/nio/sctp/SctpChannel/CommUp.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2009, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2009, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,6 +23,7 @@
 
 /* @test
  * @bug 6863110
+ * @requires (os.family == "linux")
  * @library /test/lib
  * @summary Newly connected/accepted SctpChannel should fire OP_READ if registered with a Selector
  * @author chegar
diff --git a/test/jdk/com/sun/nio/sctp/SctpChannel/Connect.java b/test/jdk/com/sun/nio/sctp/SctpChannel/Connect.java
index 79b9453a595..699ef3d0971 100644
--- a/test/jdk/com/sun/nio/sctp/SctpChannel/Connect.java
+++ b/test/jdk/com/sun/nio/sctp/SctpChannel/Connect.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2009, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2009, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,6 +23,7 @@
 
 /* @test
  * @bug 4927640
+ * @requires (os.family == "linux")
  * @library /test/lib
  * @summary Tests the SCTP protocol implementation
  * @author chegar
diff --git a/test/jdk/com/sun/nio/sctp/SctpChannel/Receive.java b/test/jdk/com/sun/nio/sctp/SctpChannel/Receive.java
index 48eb413a9ca..896c339dcc0 100644
--- a/test/jdk/com/sun/nio/sctp/SctpChannel/Receive.java
+++ b/test/jdk/com/sun/nio/sctp/SctpChannel/Receive.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2009, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2009, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,6 +23,7 @@
 
 /* @test
  * @bug 4927640
+ * @requires (os.family == "linux")
  * @library /test/lib
  * @summary Tests the SCTP protocol implementation
  * @author chegar
diff --git a/test/jdk/com/sun/nio/sctp/SctpChannel/ReceiveIntoDirect.java b/test/jdk/com/sun/nio/sctp/SctpChannel/ReceiveIntoDirect.java
index 48d89c34ca4..1c52f83b972 100644
--- a/test/jdk/com/sun/nio/sctp/SctpChannel/ReceiveIntoDirect.java
+++ b/test/jdk/com/sun/nio/sctp/SctpChannel/ReceiveIntoDirect.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2014, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2014, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,6 +23,7 @@
 
 /* @test
  * @bug 8034181
+ * @requires (os.family == "linux")
  * @library /test/lib
  * @summary SIGBUS in SctpChannelImpl receive
  * @author chegar
diff --git a/test/jdk/com/sun/nio/sctp/SctpChannel/Send.java b/test/jdk/com/sun/nio/sctp/SctpChannel/Send.java
index 35a28f4eb38..a04205a9463 100644
--- a/test/jdk/com/sun/nio/sctp/SctpChannel/Send.java
+++ b/test/jdk/com/sun/nio/sctp/SctpChannel/Send.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2009, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2009, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,6 +23,7 @@
 
 /* @test
  * @bug 4927640
+ * @requires (os.family == "linux")
  * @library /test/lib
  * @summary Tests the SCTP protocol implementation
  * @author chegar
diff --git a/test/jdk/com/sun/nio/sctp/SctpChannel/Shutdown.java b/test/jdk/com/sun/nio/sctp/SctpChannel/Shutdown.java
index 0891851fe86..75f0fa9a724 100644
--- a/test/jdk/com/sun/nio/sctp/SctpChannel/Shutdown.java
+++ b/test/jdk/com/sun/nio/sctp/SctpChannel/Shutdown.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2009, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2009, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,6 +23,7 @@
 
 /* @test
  * @bug 4927640
+ * @requires (os.family == "linux")
  * @library /test/lib
  * @summary Tests the SCTP protocol implementation
  * @author chegar
diff --git a/test/jdk/com/sun/nio/sctp/SctpChannel/SocketOptionTests.java b/test/jdk/com/sun/nio/sctp/SctpChannel/SocketOptionTests.java
index 857efbb63f5..2e6192a0d0e 100644
--- a/test/jdk/com/sun/nio/sctp/SctpChannel/SocketOptionTests.java
+++ b/test/jdk/com/sun/nio/sctp/SctpChannel/SocketOptionTests.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2009, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2009, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,6 +23,7 @@
 
 /* @test
  * @bug 4927640
+ * @requires (os.family == "linux")
  * @library /test/lib
  * @summary Tests the SCTP protocol implementation
  * @author chegar
diff --git a/test/jdk/com/sun/nio/sctp/SctpMultiChannel/Branch.java b/test/jdk/com/sun/nio/sctp/SctpMultiChannel/Branch.java
index 9beb8c74c3e..199cbfc0fc1 100644
--- a/test/jdk/com/sun/nio/sctp/SctpMultiChannel/Branch.java
+++ b/test/jdk/com/sun/nio/sctp/SctpMultiChannel/Branch.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2009, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2009, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,6 +23,7 @@
 
 /* @test
  * @bug 4927640
+ * @requires (os.family == "linux")
  * @library /test/lib
  * @summary Tests the SCTP protocol implementation
  * @author chegar
diff --git a/test/jdk/com/sun/nio/sctp/SctpMultiChannel/CloseDescriptors.java b/test/jdk/com/sun/nio/sctp/SctpMultiChannel/CloseDescriptors.java
index fdafec80745..f6fffe700c5 100644
--- a/test/jdk/com/sun/nio/sctp/SctpMultiChannel/CloseDescriptors.java
+++ b/test/jdk/com/sun/nio/sctp/SctpMultiChannel/CloseDescriptors.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2021, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2021, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
diff --git a/test/jdk/com/sun/nio/sctp/SctpMultiChannel/Send.java b/test/jdk/com/sun/nio/sctp/SctpMultiChannel/Send.java
index 8fb551dd8f4..6f1b05e9db9 100644
--- a/test/jdk/com/sun/nio/sctp/SctpMultiChannel/Send.java
+++ b/test/jdk/com/sun/nio/sctp/SctpMultiChannel/Send.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2009, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2009, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,6 +23,7 @@
 
 /* @test
  * @bug 4927640
+ * @requires (os.family == "linux")
  * @library /test/lib
  * @summary Tests the SCTP protocol implementation
  * @author chegar
diff --git a/test/jdk/com/sun/nio/sctp/SctpMultiChannel/SendFailed.java b/test/jdk/com/sun/nio/sctp/SctpMultiChannel/SendFailed.java
index a64d4d58270..85db90279c0 100644
--- a/test/jdk/com/sun/nio/sctp/SctpMultiChannel/SendFailed.java
+++ b/test/jdk/com/sun/nio/sctp/SctpMultiChannel/SendFailed.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2015, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2015, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,6 +23,7 @@
 
 /* @test
  * @bug 8067846
+ * @requires (os.family == "linux")
  * @library /test/lib
  * @summary Test for send failed notification
  */
diff --git a/test/jdk/com/sun/nio/sctp/SctpMultiChannel/SocketOptionTests.java b/test/jdk/com/sun/nio/sctp/SctpMultiChannel/SocketOptionTests.java
index 3a681884b9a..5d782fcd4e7 100644
--- a/test/jdk/com/sun/nio/sctp/SctpMultiChannel/SocketOptionTests.java
+++ b/test/jdk/com/sun/nio/sctp/SctpMultiChannel/SocketOptionTests.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2009, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2009, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,6 +23,7 @@
 
 /* @test
  * @bug 4927640
+ * @requires (os.family == "linux")
  * @library /test/lib
  * @summary Tests the SCTP protocol implementation
  * @author chegar
diff --git a/test/jdk/com/sun/nio/sctp/SctpServerChannel/Accept.java b/test/jdk/com/sun/nio/sctp/SctpServerChannel/Accept.java
index c68bfd28945..84c010aaaf0 100644
--- a/test/jdk/com/sun/nio/sctp/SctpServerChannel/Accept.java
+++ b/test/jdk/com/sun/nio/sctp/SctpServerChannel/Accept.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2009, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2009, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,6 +23,7 @@
 
 /* @test
  * @bug 4927640
+ * @requires (os.family == "linux")
  * @library /test/lib
  * @summary Tests the SCTP protocol implementation
  * @author chegar
diff --git a/test/jdk/com/sun/nio/sctp/SctpServerChannel/NonBlockingAccept.java b/test/jdk/com/sun/nio/sctp/SctpServerChannel/NonBlockingAccept.java
index abf35bf779d..3c358e0a86d 100644
--- a/test/jdk/com/sun/nio/sctp/SctpServerChannel/NonBlockingAccept.java
+++ b/test/jdk/com/sun/nio/sctp/SctpServerChannel/NonBlockingAccept.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2009, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2009, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,6 +23,7 @@
 
 /* @test
  * @bug 4927640
+ * @requires (os.family == "linux")
  * @library /test/lib
  * @summary Tests the SCTP protocol implementation
  * @author chegar

From fdb129ad94b1125340d62766fa36bee4739917f0 Mon Sep 17 00:00:00 2001
From: Shawn Emery <semery@openjdk.org>
Date: Fri, 13 Mar 2026 16:34:30 +0000
Subject: [PATCH 193/655] 8378893: X25519 should utilize a larger limb size

Co-authored-by: Ferenc Rakoczi <ferenc.r.rakoczi@oracle.com>
Reviewed-by: ascarpino, bperez
---
 .../classes/build/tools/intpoly/FieldGen.java |  35 +-
 .../math/intpoly/IntegerPolynomial25519.java  | 531 ++++++++++++++++++
 .../util/math/TestIntegerModuloP.java         |   4 +-
 3 files changed, 535 insertions(+), 35 deletions(-)
 create mode 100644 src/java.base/share/classes/sun/security/util/math/intpoly/IntegerPolynomial25519.java

diff --git a/make/jdk/src/classes/build/tools/intpoly/FieldGen.java b/make/jdk/src/classes/build/tools/intpoly/FieldGen.java
index fcc45db0219..c29a315f368 100644
--- a/make/jdk/src/classes/build/tools/intpoly/FieldGen.java
+++ b/make/jdk/src/classes/build/tools/intpoly/FieldGen.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -34,36 +34,6 @@ import java.util.*;
 
 public class FieldGen {
 
-    static FieldParams Curve25519 = new FieldParams(
-            "IntegerPolynomial25519", 26, 10, 1, 255,
-            Arrays.asList(
-                    new Term(0, -19)
-            ),
-            Curve25519CrSequence(), simpleSmallCrSequence(10)
-    );
-
-    private static List<CarryReduce> Curve25519CrSequence() {
-        List<CarryReduce> result = new ArrayList<CarryReduce>();
-
-        // reduce(7,2)
-        result.add(new Reduce(17));
-        result.add(new Reduce(18));
-
-        // carry(8,2)
-        result.add(new Carry(8));
-        result.add(new Carry(9));
-
-        // reduce(0,7)
-        for (int i = 10; i < 17; i++) {
-            result.add(new Reduce(i));
-        }
-
-        // carry(0,9)
-        result.addAll(fullCarry(10));
-
-        return result;
-    }
-
     static FieldParams Curve448 = new FieldParams(
             "IntegerPolynomial448", 28, 16, 1, 448,
             Arrays.asList(
@@ -224,8 +194,7 @@ public class FieldGen {
     }
 
     static final FieldParams[] ALL_FIELDS = {
-            Curve25519, Curve448,
-            P256, P384, P521, O256, O384, O521, O25519, O448
+            Curve448, P256, P384, P521, O256, O384, O521, O25519, O448
     };
 
     public static class Term {
diff --git a/src/java.base/share/classes/sun/security/util/math/intpoly/IntegerPolynomial25519.java b/src/java.base/share/classes/sun/security/util/math/intpoly/IntegerPolynomial25519.java
new file mode 100644
index 00000000000..c8f23da417e
--- /dev/null
+++ b/src/java.base/share/classes/sun/security/util/math/intpoly/IntegerPolynomial25519.java
@@ -0,0 +1,531 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.  Oracle designates this
+ * particular file as subject to the "Classpath" exception as provided
+ * by Oracle in the LICENSE file that accompanied this code.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+package sun.security.util.math.intpoly;
+
+import java.math.BigInteger;
+
+public final class IntegerPolynomial25519 extends IntegerPolynomial {
+    private static final int BITS_PER_LIMB = 51;
+    private static final int NUM_LIMBS = 5;
+    private static final int MAX_ADDS = 1;
+    public static final BigInteger MODULUS = evaluateModulus();
+    private static final long CARRY_ADD = 1L << (BITS_PER_LIMB - 1);
+    private static final long LIMB_MASK = -1L >>> (64 - BITS_PER_LIMB);
+
+    public static final IntegerPolynomial25519 ONE =
+            new IntegerPolynomial25519();
+
+    private IntegerPolynomial25519() {
+        super(BITS_PER_LIMB, NUM_LIMBS, MAX_ADDS, MODULUS);
+    }
+
+    private static BigInteger evaluateModulus() {
+        BigInteger result = BigInteger.valueOf(2).pow(255);
+        result = result.subtract(BigInteger.valueOf(19));
+
+        return result;
+    }
+
+    /**
+     * Carry from a range of limb positions.
+     * Override for performance (unnesting).
+     *
+     * @param limbs [in|out] the limbs for carry operation.
+     * @param start [in] the starting position of carry.
+     * @param end [in] the ending position of carry.
+     */
+    @Override
+    protected void carry(long[] limbs, int start, int end) {
+        long carry;
+
+        for (int i = start; i < end; i++) {
+            carry = (limbs[i] + CARRY_ADD) >> BITS_PER_LIMB;
+            limbs[i] -= (carry << BITS_PER_LIMB);
+            limbs[i + 1] += carry;
+        }
+    }
+
+    /**
+     * Carry operation for all limb positions.
+     * Override for performance (unroll and unnesting).
+     *
+     * @param limbs [in|out] the limbs for carry operation.
+     */
+    @Override
+    protected void carry(long[] limbs) {
+        long carry = (limbs[0] + CARRY_ADD) >> BITS_PER_LIMB;
+        limbs[0] -= carry << BITS_PER_LIMB;
+        limbs[1] += carry;
+
+        carry = (limbs[1] + CARRY_ADD) >> BITS_PER_LIMB;
+        limbs[1] -= carry << BITS_PER_LIMB;
+        limbs[2] += carry;
+
+        carry = (limbs[2] + CARRY_ADD) >> BITS_PER_LIMB;
+        limbs[2] -= carry << BITS_PER_LIMB;
+        limbs[3] += carry;
+
+        carry = (limbs[3] + CARRY_ADD) >> BITS_PER_LIMB;
+        limbs[3] -= carry << BITS_PER_LIMB;
+        limbs[4] += carry;
+    }
+
+    /**
+     * Multiply limbs by scalar value.
+     * Superclass assumes that limb primitive radix > (bits per limb * 2)
+     *
+     * @param a [in|out] the limbs to multiply a carry operation. 'a' is
+     * assumed to be reduced.
+     * @param b [in] the scalar value to be muliplied with the limbs.
+     */
+    @Override
+    protected void multByInt(long[] a, long b) {
+        long aa0 = a[0];
+        long aa1 = a[1];
+        long aa2 = a[2];
+        long aa3 = a[3];
+        long aa4 = a[4];
+
+        long bb0 = b;
+
+        final long shift1 = 64 - BITS_PER_LIMB;
+        final long shift2 = BITS_PER_LIMB;
+
+        long d0;      // low digit from multiplication
+        long dd0;     // high digit from multiplication
+        // multiplication result digits for each column
+        long c0, c1, c2, c3, c4, c5;
+
+        // Row 0 - multiply by aa0
+        d0 = aa0 * bb0;
+        dd0 = Math.multiplyHigh(aa0, bb0) << shift1 | (d0 >>> shift2);
+        d0 &= LIMB_MASK;
+
+        c0 = d0;
+        c1 = dd0;
+
+        // Row 1 - multiply by aa1
+        d0 = aa1 * bb0;
+        dd0 = Math.multiplyHigh(aa1, bb0) << shift1 | (d0 >>> shift2);
+        d0 &= LIMB_MASK;
+
+        c1 += d0;
+        c2 = dd0;
+
+        // Row 2 - multiply by aa2
+        d0 = aa2 * bb0;
+        dd0 = Math.multiplyHigh(aa2, bb0) << shift1 | (d0 >>> shift2);
+        d0 &= LIMB_MASK;
+
+        c2 += d0;
+        c3 = dd0;
+
+        // Row 3 - multiply by aa3
+        d0 = aa3 * bb0;
+        dd0 = Math.multiplyHigh(aa3, bb0) << shift1 | (d0 >>> shift2);
+        d0 &= LIMB_MASK;
+
+        c3 += d0;
+        c4 = dd0;
+
+        // Row 4 - multiply by aa4
+        d0 = aa4 * bb0;
+        dd0 = Math.multiplyHigh(aa4, bb0) << shift1 | (d0 >>> shift2);
+        d0 &= LIMB_MASK;
+
+        c4 += d0;
+        c5 = dd0;
+
+        // Perform pseudo-Mersenne reduction
+        a[0] = c0 + (19 * c5);
+
+        a[1] = c1;
+        a[2] = c2;
+        a[3] = c3;
+        a[4] = c4;
+
+        reduce(a);
+    }
+
+    /**
+     * Carry in all positions and reduce high order limb.
+     *
+     * @param limbs [in|out] the limbs to carry and reduce.
+     */
+    protected void reduce(long[] limbs) {
+        long carry = (limbs[3] + CARRY_ADD) >> BITS_PER_LIMB;
+        limbs[3] -= carry << BITS_PER_LIMB;
+        limbs[4] += carry;
+
+        carry = (limbs[4] + CARRY_ADD) >> BITS_PER_LIMB;
+        limbs[4] -= carry << BITS_PER_LIMB;
+
+        limbs[0] += 19 * carry;
+
+        carry = (limbs[0] + CARRY_ADD) >> BITS_PER_LIMB;
+        limbs[0] -= carry << BITS_PER_LIMB;
+        limbs[1] += carry;
+
+        carry = (limbs[1] + CARRY_ADD) >> BITS_PER_LIMB;
+        limbs[1] -= carry << BITS_PER_LIMB;
+        limbs[2] += carry;
+
+        carry = (limbs[2] + CARRY_ADD) >> BITS_PER_LIMB;
+        limbs[2] -= carry << BITS_PER_LIMB;
+        limbs[3] += carry;
+
+        carry = (limbs[3] + CARRY_ADD) >> BITS_PER_LIMB;
+        limbs[3] -= carry << BITS_PER_LIMB;
+        limbs[4] += carry;
+    }
+
+    /**
+     * Reduces digit 'v' at limb position 'i' to a lower limb.
+     *
+     * @param limbs [in|out] the limbs to reduce in.
+     * @param v [in] the digit to reduce to the lower limb.
+     * @param i [in] the limbs to reduce from.
+     */
+    protected void reduceIn(long[] limbs, long v, int i) {
+        limbs[i - NUM_LIMBS] += 19 * v;
+    }
+
+    /**
+     * Carry from high order limb and reduce to the lower order limb.  Assumed
+     * to be called two times to propagate the carries.
+     *
+     * @param limbs [in|out] the limbs to fully carry and reduce.
+     */
+    protected void finalCarryReduceLast(long[] limbs) {
+        long carry = limbs[4] >> BITS_PER_LIMB;
+
+        limbs[4] -= carry << BITS_PER_LIMB;
+        limbs[0] += 19 * carry;
+    }
+
+    /**
+     * Multiply two limbs using a high/low digit technique that allows for
+     * larger limb sizes.  It is assumed that both limbs have already been
+     * reduced.
+     *
+     * @param a [in] the limb operand to multiply.
+     * @param b [in] the limb operand to multiply.
+     * @param r [out] the product of the limbs operands that is fully reduced.
+     */
+    protected void mult(long[] a, long[] b, long[] r) {
+        long aa0 = a[0];
+        long aa1 = a[1];
+        long aa2 = a[2];
+        long aa3 = a[3];
+        long aa4 = a[4];
+
+        long bb0 = b[0];
+        long bb1 = b[1];
+        long bb2 = b[2];
+        long bb3 = b[3];
+        long bb4 = b[4];
+
+        final long shift1 = 64 - BITS_PER_LIMB;
+        final long shift2 = BITS_PER_LIMB;
+
+        long d0, d1, d2, d3, d4;      // low digits from multiplication
+        long dd0, dd1, dd2, dd3, dd4; // high digits from multiplication
+        // multiplication result digits for each column
+        long c0, c1, c2, c3, c4, c5, c6, c7, c8, c9;
+
+        // Row 0 - multiply by aa0
+        d0 = aa0 * bb0;
+        dd0 = Math.multiplyHigh(aa0, bb0) << shift1 | (d0 >>> shift2);
+        d0 &= LIMB_MASK;
+
+        d1 = aa0 * bb1;
+        dd1 = Math.multiplyHigh(aa0, bb1) << shift1 | (d1 >>> shift2);
+        d1 &= LIMB_MASK;
+
+        d2 = aa0 * bb2;
+        dd2 = Math.multiplyHigh(aa0, bb2) << shift1 | (d2 >>> shift2);
+        d2 &= LIMB_MASK;
+
+        d3 = aa0 * bb3;
+        dd3 = Math.multiplyHigh(aa0, bb3) << shift1 | (d3 >>> shift2);
+        d3 &= LIMB_MASK;
+
+        d4 = aa0 * bb4;
+        dd4 = Math.multiplyHigh(aa0, bb4) << shift1 | (d4 >>> shift2);
+        d4 &= LIMB_MASK;
+
+        c0 = d0;
+        c1 = d1 + dd0;
+        c2 = d2 + dd1;
+        c3 = d3 + dd2;
+        c4 = d4 + dd3;
+        c5 = dd4;
+
+        // Row 1 - multiply by aa1
+        d0 = aa1 * bb0;
+        dd0 = Math.multiplyHigh(aa1, bb0) << shift1 | (d0 >>> shift2);
+        d0 &= LIMB_MASK;
+
+        d1 = aa1 * bb1;
+        dd1 = Math.multiplyHigh(aa1, bb1) << shift1 | (d1 >>> shift2);
+        d1 &= LIMB_MASK;
+
+        d2 = aa1 * bb2;
+        dd2 = Math.multiplyHigh(aa1, bb2) << shift1 | (d2 >>> shift2);
+        d2 &= LIMB_MASK;
+
+        d3 = aa1 * bb3;
+        dd3 = Math.multiplyHigh(aa1, bb3) << shift1 | (d3 >>> shift2);
+        d3 &= LIMB_MASK;
+
+        d4 = aa1 * bb4;
+        dd4 = Math.multiplyHigh(aa1, bb4) << shift1 | (d4 >>> shift2);
+        d4 &= LIMB_MASK;
+
+        c1 += d0;
+        c2 += d1 + dd0;
+        c3 += d2 + dd1;
+        c4 += d3 + dd2;
+        c5 += d4 + dd3;
+        c6 = dd4;
+
+        // Row 2 - multiply by aa2
+        d0 = aa2 * bb0;
+        dd0 = Math.multiplyHigh(aa2, bb0) << shift1 | (d0 >>> shift2);
+        d0 &= LIMB_MASK;
+
+        d1 = aa2 * bb1;
+        dd1 = Math.multiplyHigh(aa2, bb1) << shift1 | (d1 >>> shift2);
+        d1 &= LIMB_MASK;
+
+        d2 = aa2 * bb2;
+        dd2 = Math.multiplyHigh(aa2, bb2) << shift1 | (d2 >>> shift2);
+        d2 &= LIMB_MASK;
+
+        d3 = aa2 * bb3;
+        dd3 = Math.multiplyHigh(aa2, bb3) << shift1 | (d3 >>> shift2);
+        d3 &= LIMB_MASK;
+
+        d4 = aa2 * bb4;
+        dd4 = Math.multiplyHigh(aa2, bb4) << shift1 | (d4 >>> shift2);
+        d4 &= LIMB_MASK;
+
+        c2 += d0;
+        c3 += d1 + dd0;
+        c4 += d2 + dd1;
+        c5 += d3 + dd2;
+        c6 += d4 + dd3;
+        c7 = dd4;
+
+        // Row 3 - multiply by aa3
+        d0 = aa3 * bb0;
+        dd0 = Math.multiplyHigh(aa3, bb0) << shift1 | (d0 >>> shift2);
+        d0 &= LIMB_MASK;
+
+        d1 = aa3 * bb1;
+        dd1 = Math.multiplyHigh(aa3, bb1) << shift1 | (d1 >>> shift2);
+        d1 &= LIMB_MASK;
+
+        d2 = aa3 * bb2;
+        dd2 = Math.multiplyHigh(aa3, bb2) << shift1 | (d2 >>> shift2);
+        d2 &= LIMB_MASK;
+
+        d3 = aa3 * bb3;
+        dd3 = Math.multiplyHigh(aa3, bb3) << shift1 | (d3 >>> shift2);
+        d3 &= LIMB_MASK;
+
+        d4 = aa3 * bb4;
+        dd4 = Math.multiplyHigh(aa3, bb4) << shift1 | (d4 >>> shift2);
+        d4 &= LIMB_MASK;
+
+        c3 += d0;
+        c4 += d1 + dd0;
+        c5 += d2 + dd1;
+        c6 += d3 + dd2;
+        c7 += d4 + dd3;
+        c8 = dd4;
+
+        // Row 4 - multiply by aa4
+        d0 = aa4 * bb0;
+        dd0 = Math.multiplyHigh(aa4, bb0) << shift1 | (d0 >>> shift2);
+        d0 &= LIMB_MASK;
+
+        d1 = aa4 * bb1;
+        dd1 = Math.multiplyHigh(aa4, bb1) << shift1 | (d1 >>> shift2);
+        d1 &= LIMB_MASK;
+
+        d2 = aa4 * bb2;
+        dd2 = Math.multiplyHigh(aa4, bb2) << shift1 | (d2 >>> shift2);
+        d2 &= LIMB_MASK;
+
+        d3 = aa4 * bb3;
+        dd3 = Math.multiplyHigh(aa4, bb3) << shift1 | (d3 >>> shift2);
+        d3 &= LIMB_MASK;
+
+        d4 = aa4 * bb4;
+        dd4 = Math.multiplyHigh(aa4, bb4) << shift1 | (d4 >>> shift2);
+        d4 &= LIMB_MASK;
+
+        c4 += d0;
+        c5 += d1 + dd0;
+        c6 += d2 + dd1;
+        c7 += d3 + dd2;
+        c8 += d4 + dd3;
+        c9 = dd4;
+
+        // Perform pseudo-Mersenne reduction
+        r[0] = c0 + (19 * c5);
+        r[1] = c1 + (19 * c6);
+        r[2] = c2 + (19 * c7);
+        r[3] = c3 + (19 * c8);
+        r[4] = c4 + (19 * c9);
+
+        reduce(r);
+    }
+
+    /**
+     * Takes a single limb and squares it using a high/low digit technique that
+     * allows for larger limb sizes.  It is assumed that the limb input has
+     * already been reduced.
+     *
+     * @param a [in] the limb operand to square.
+     * @param r [out] the resulting square of the limb which is fully reduced.
+     */
+    protected void square(long[] a, long[] r) {
+        long aa0 = a[0];
+        long aa1 = a[1];
+        long aa2 = a[2];
+        long aa3 = a[3];
+        long aa4 = a[4];
+
+        final long shift1 = 64 - BITS_PER_LIMB;
+        final long shift2 = BITS_PER_LIMB;
+
+        long d0, d1, d2, d3, d4;      // low digits from multiplication
+        long dd0, dd1, dd2, dd3, dd4; // high digits from multiplication
+        // multiplication result digits for each column
+        long c0, c1, c2, c3, c4, c5, c6, c7, c8, c9;
+
+        // Row 0 - multiply by aa0
+        d0 = aa0 * aa0;
+        dd0 = Math.multiplyHigh(aa0, aa0) << shift1 | (d0 >>> shift2);
+        d0 &= LIMB_MASK;
+
+        d1 = aa0 * aa1;
+        dd1 = Math.multiplyHigh(aa0, aa1) << shift1 | (d1 >>> shift2);
+        d1 &= LIMB_MASK;
+
+        d2 = aa0 * aa2;
+        dd2 = Math.multiplyHigh(aa0, aa2) << shift1 | (d2 >>> shift2);
+        d2 &= LIMB_MASK;
+
+        d3 = aa0 * aa3;
+        dd3 = Math.multiplyHigh(aa0, aa3) << shift1 | (d3 >>> shift2);
+        d3 &= LIMB_MASK;
+
+        d4 = aa0 * aa4;
+        dd4 = Math.multiplyHigh(aa0, aa4) << shift1 | (d4 >>> shift2);
+        d4 &= LIMB_MASK;
+
+        c0 = d0;
+        c1 = (d1 << 1) + dd0;
+        c2 = (d2 + dd1) << 1;
+        c3 = (d3 + dd2) << 1;
+        c4 = (d4 + dd3) << 1;
+        c5 = dd4 << 1;
+
+        // Row 1 - multiply by aa1
+        d1 = aa1 * aa1;
+        dd1 = Math.multiplyHigh(aa1, aa1) << shift1 | (d1 >>> shift2);
+        d1 &= LIMB_MASK;
+
+        d2 = aa1 * aa2;
+        dd2 = Math.multiplyHigh(aa1, aa2) << shift1 | (d2 >>> shift2);
+        d2 &= LIMB_MASK;
+
+        d3 = aa1 * aa3;
+        dd3 = Math.multiplyHigh(aa1, aa3) << shift1 | (d3 >>> shift2);
+        d3 &= LIMB_MASK;
+
+        d4 = aa1 * aa4;
+        dd4 = Math.multiplyHigh(aa1, aa4) << shift1 | (d4 >>> shift2);
+        d4 &= LIMB_MASK;
+
+        c2 += d1;
+        c3 += (d2 << 1) + dd1;
+        c4 += (d3 + dd2) << 1;
+        c5 += (d4 + dd3) << 1;
+        c6 = dd4 << 1;
+
+        // Row 2 - multiply by aa2
+        d2 = aa2 * aa2;
+        dd2 = Math.multiplyHigh(aa2, aa2) << shift1 | (d2 >>> shift2);
+        d2 &= LIMB_MASK;
+
+        d3 = aa2 * aa3;
+        dd3 = Math.multiplyHigh(aa2, aa3) << shift1 | (d3 >>> shift2);
+        d3 &= LIMB_MASK;
+
+        d4 = aa2 * aa4;
+        dd4 = Math.multiplyHigh(aa2, aa4) << shift1 | (d4 >>> shift2);
+        d4 &= LIMB_MASK;
+
+        c4 += d2;
+        c5 += (d3 << 1) + dd2;
+        c6 += (d4 + dd3) << 1;
+        c7 = dd4 << 1;
+
+        // Row 3 - multiply by aa3
+        d3 = aa3 * aa3;
+        dd3 = Math.multiplyHigh(aa3, aa3) << shift1 | (d3 >>> shift2);
+        d3 &= LIMB_MASK;
+
+        d4 = aa3 * aa4;
+        dd4 = Math.multiplyHigh(aa3, aa4) << shift1 | (d4 >>> shift2);
+        d4 &= LIMB_MASK;
+
+        c6 += d3;
+        c7 += (d4 << 1) + dd3;
+        c8 = dd4 << 1;
+
+        // Row 4 - multiply by aa4
+        d4 = aa4 * aa4;
+        dd4 = Math.multiplyHigh(aa4, aa4) << shift1 | (d4 >>> shift2);
+        d4 &= LIMB_MASK;
+
+        c8 += d4;
+        c9 = dd4;
+
+        // Perform pseudo-Mersenne reduction
+        r[0] = c0 + (19 * c5);
+        r[1] = c1 + (19 * c6);
+        r[2] = c2 + (19 * c7);
+        r[3] = c3 + (19 * c8);
+        r[4] = c4 + (19 * c9);
+
+        reduce(r);
+    }
+}
diff --git a/test/jdk/sun/security/util/math/TestIntegerModuloP.java b/test/jdk/sun/security/util/math/TestIntegerModuloP.java
index e1c02365424..f2b73223efc 100644
--- a/test/jdk/sun/security/util/math/TestIntegerModuloP.java
+++ b/test/jdk/sun/security/util/math/TestIntegerModuloP.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2023, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -27,7 +27,7 @@
  * @summary Test proper operation of integer field arithmetic
  * @modules java.base/sun.security.util java.base/sun.security.util.math java.base/sun.security.util.math.intpoly
  * @build BigIntegerModuloP
- * @run main TestIntegerModuloP sun.security.util.math.intpoly.IntegerPolynomial25519 32 0
+ * @run main TestIntegerModuloP sun.security.util.math.intpoly.IntegerPolynomial25519 31 0
  */
 
  /*

From 9f2591d8cffd1b3496c956659e0ea12364696691 Mon Sep 17 00:00:00 2001
From: Naoto Sato <naoto@openjdk.org>
Date: Fri, 13 Mar 2026 18:37:04 +0000
Subject: [PATCH 194/655] 8379828: Remove ResourceBundle module tests with
 legacy ISO code property

Reviewed-by: jlu, iris
---
 .../modules/ModuleTestUtil.java               | 32 ++-----------------
 .../modules/basic/BasicTest.java              |  1 -
 2 files changed, 2 insertions(+), 31 deletions(-)

diff --git a/test/jdk/java/util/ResourceBundle/modules/ModuleTestUtil.java b/test/jdk/java/util/ResourceBundle/modules/ModuleTestUtil.java
index 24c6e181ccc..ec4c2355d18 100644
--- a/test/jdk/java/util/ResourceBundle/modules/ModuleTestUtil.java
+++ b/test/jdk/java/util/ResourceBundle/modules/ModuleTestUtil.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2019, 2023, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2019, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -28,8 +28,6 @@ import java.nio.file.Paths;
 import java.util.List;
 import java.util.stream.Stream;
 
-import jdk.test.lib.JDKToolLauncher;
-import jdk.test.lib.Utils;
 import jdk.test.lib.compiler.CompilerUtils;
 import jdk.test.lib.process.ProcessTools;
 
@@ -185,30 +183,4 @@ public class ModuleTestUtil {
             }
         }
     }
-
-    /**
-     * Run the module test with "useOldISOCodes=true".
-     *
-     * @param mp module path
-     * @param mn module name
-     * @param localeList locale list
-     */
-    public static void runModuleWithLegacyCode(String mp, String mn, List<String> localeList)
-            throws Throwable {
-        List<String> args = List.of(
-                "-ea", "-esa",
-                "-Djava.locale.useOldISOCodes=true",
-                "-p", mp,
-                "-m", mn);
-        // Build process (with VM flags)
-        ProcessBuilder pb = ProcessTools.createTestJavaProcessBuilder(
-                Stream.concat(args.stream(), localeList.stream()).toList());
-        // Evaluate process status
-        int exitCode = ProcessTools.executeCommand(pb).getExitValue();
-
-        if (exitCode != 0) {
-            throw new RuntimeException("Execution of the test failed. "
-                    + "Unexpected exit code: " + exitCode);
-        }
-    }
-}
\ No newline at end of file
+}
diff --git a/test/jdk/java/util/ResourceBundle/modules/basic/BasicTest.java b/test/jdk/java/util/ResourceBundle/modules/basic/BasicTest.java
index 2dda740aaf9..f3432a733b4 100644
--- a/test/jdk/java/util/ResourceBundle/modules/basic/BasicTest.java
+++ b/test/jdk/java/util/ResourceBundle/modules/basic/BasicTest.java
@@ -132,7 +132,6 @@ public class BasicTest {
         moduleList.forEach(mn -> ModuleTestUtil.prepareModule(srcPath, modPath,
                 mn, resFormat));
         ModuleTestUtil.runModule(modPath.toString(), MAIN, localeList);
-        ModuleTestUtil.runModuleWithLegacyCode(modPath.toString(), MAIN, localeList);
     }
 
     @Test

From 98520c029d27bd5e8b9e2113ac93f4adac164873 Mon Sep 17 00:00:00 2001
From: Frederic Thevenet <fthevenet@openjdk.org>
Date: Sat, 14 Mar 2026 11:21:12 +0000
Subject: [PATCH 195/655] 8378657: OutputAnalyzer should have a quiet mode

Reviewed-by: rriggs, stuefe
---
 .../jdk/test/lib/process/OutputAnalyzer.java  | 31 +++++++++++++++++--
 .../jdk/test/lib/process/OutputBuffer.java    | 20 +++++++++---
 2 files changed, 45 insertions(+), 6 deletions(-)

diff --git a/test/lib/jdk/test/lib/process/OutputAnalyzer.java b/test/lib/jdk/test/lib/process/OutputAnalyzer.java
index d8b3f470260..553e13b28ff 100644
--- a/test/lib/jdk/test/lib/process/OutputAnalyzer.java
+++ b/test/lib/jdk/test/lib/process/OutputAnalyzer.java
@@ -56,8 +56,23 @@ public final class OutputAnalyzer {
      * @throws IOException If an I/O error occurs.
      */
     public OutputAnalyzer(Process process, Charset cs) throws IOException {
-        buffer = OutputBuffer.of(process, cs);
+        this(process, cs, true);
     }
+
+    /**
+     * Create an OutputAnalyzer, a utility class for verifying output and exit
+     * value from a Process, with a configurable verbosity level.
+     *
+     * @param process Process to analyze
+     * @param cs The charset used to convert stdout/stderr from bytes to chars
+     *           or null for the default charset.
+     * @param verbose Set to false to limit logging to stdout.
+     * @throws IOException If an I/O error occurs.
+     */
+    public OutputAnalyzer(Process process, Charset cs, boolean verbose) throws IOException {
+        buffer = OutputBuffer.of(process, cs, verbose);
+    }
+
     /**
      * Create an OutputAnalyzer, a utility class for verifying output and exit
      * value from a Process
@@ -66,7 +81,19 @@ public final class OutputAnalyzer {
      * @throws IOException If an I/O error occurs.
      */
     public OutputAnalyzer(Process process) throws IOException {
-        buffer = OutputBuffer.of(process);
+        this(process, true);
+    }
+
+    /**
+     * Create an OutputAnalyzer, a utility class for verifying output and exit
+     * value from a Process, with a configurable verbosity level.
+     *
+     * @param process Process to analyze
+     * @param verbose Set to false to limit logging to stdout.
+     * @throws IOException If an I/O error occurs.
+     */
+    public OutputAnalyzer(Process process, boolean verbose) throws IOException {
+        buffer = OutputBuffer.of(process, verbose);
     }
 
     /**
diff --git a/test/lib/jdk/test/lib/process/OutputBuffer.java b/test/lib/jdk/test/lib/process/OutputBuffer.java
index 0390535bf89..57e00aa73c7 100644
--- a/test/lib/jdk/test/lib/process/OutputBuffer.java
+++ b/test/lib/jdk/test/lib/process/OutputBuffer.java
@@ -89,12 +89,20 @@ public interface OutputBuffer {
    */
   public long pid();
 
+  public static OutputBuffer of(Process p, boolean quiet) {
+    return of(p, null, quiet);
+  }
+
   public static OutputBuffer of(Process p, Charset cs) {
-    return new LazyOutputBuffer(p, cs);
+    return of(p, cs, false);
   }
 
   public static OutputBuffer of(Process p) {
-    return new LazyOutputBuffer(p, null);
+    return of(p, null, false);
+  }
+
+  public static OutputBuffer of(Process p, Charset cs, boolean quiet) {
+    return new LazyOutputBuffer(p, cs, quiet);
   }
 
   public static OutputBuffer of(String stdout, String stderr, int exitValue) {
@@ -130,19 +138,23 @@ public interface OutputBuffer {
       }
     }
 
+    private final boolean verbose;
     private final StreamTask outTask;
     private final StreamTask errTask;
     private final Process p;
     private volatile Integer exitValue; // null implies we don't yet know
 
     private final void logProgress(String state) {
+      if (verbose) {
         System.out.println("[" + Instant.now().toString() + "] " + state
-                           + " for process " + p.pid());
+                + " for process " + p.pid());
         System.out.flush();
+      }
     }
 
-    private LazyOutputBuffer(Process p, Charset cs) {
+    private LazyOutputBuffer(Process p, Charset cs, boolean verbose) {
       this.p = p;
+      this.verbose = verbose;
       logProgress("Gathering output");
       outTask = new StreamTask(p.getInputStream(), cs);
       errTask = new StreamTask(p.getErrorStream(), cs);

From 1606564eddfd17f74015e219cd5b754ec35bf0c8 Mon Sep 17 00:00:00 2001
From: Matthias Baesken <mbaesken@openjdk.org>
Date: Sat, 14 Mar 2026 14:06:38 +0000
Subject: [PATCH 196/655] 8379802: [AIX] unify DL_info struct and put it into a
 single header

Reviewed-by: mdoerr, clanger, erikj
---
 make/common/modules/LauncherCommon.gmk        |  8 ++-
 make/hotspot/lib/JvmFlags.gmk                 |  7 ++-
 .../modules/java.desktop/lib/AwtLibraries.gmk | 14 +++---
 src/hotspot/os/aix/porting_aix.hpp            | 20 +-------
 src/java.base/aix/native/include/dl_info.h    | 49 +++++++++++++++++++
 src/java.base/aix/native/libjli/java_md_aix.h |  9 +---
 .../aix/native/libawt/porting_aix.c           | 11 ++---
 .../aix/native/libawt/porting_aix.h           | 25 +---------
 8 files changed, 81 insertions(+), 62 deletions(-)
 create mode 100644 src/java.base/aix/native/include/dl_info.h

diff --git a/make/common/modules/LauncherCommon.gmk b/make/common/modules/LauncherCommon.gmk
index 7682ffbb95c..859494861b2 100644
--- a/make/common/modules/LauncherCommon.gmk
+++ b/make/common/modules/LauncherCommon.gmk
@@ -1,5 +1,5 @@
 #
-# Copyright (c) 2011, 2025, Oracle and/or its affiliates. All rights reserved.
+# Copyright (c) 2011, 2026, Oracle and/or its affiliates. All rights reserved.
 # DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
 #
 # This code is free software; you can redistribute it and/or modify it
@@ -35,8 +35,14 @@ include ProcessMarkdown.gmk
 include $(TOPDIR)/make/ToolsJdk.gmk
 
 LAUNCHER_SRC := $(TOPDIR)/src/java.base/share/native/launcher
+
+ifeq ($(call isTargetOs, aix), true)
+  ADD_PLATFORM_INCLUDE_DIR := -I$(TOPDIR)/src/java.base/aix/native/include
+endif
+
 LAUNCHER_CFLAGS += -I$(TOPDIR)/src/java.base/share/native/launcher \
     -I$(TOPDIR)/src/java.base/share/native/libjli \
+    $(ADD_PLATFORM_INCLUDE_DIR) \
     -I$(TOPDIR)/src/java.base/$(OPENJDK_TARGET_OS_TYPE)/native/libjli \
     -I$(TOPDIR)/src/java.base/$(OPENJDK_TARGET_OS)/native/libjli \
     #
diff --git a/make/hotspot/lib/JvmFlags.gmk b/make/hotspot/lib/JvmFlags.gmk
index 57b632ee532..27a96cc4865 100644
--- a/make/hotspot/lib/JvmFlags.gmk
+++ b/make/hotspot/lib/JvmFlags.gmk
@@ -1,5 +1,5 @@
 #
-# Copyright (c) 2013, 2025, Oracle and/or its affiliates. All rights reserved.
+# Copyright (c) 2013, 2026, Oracle and/or its affiliates. All rights reserved.
 # DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
 #
 # This code is free software; you can redistribute it and/or modify it
@@ -43,10 +43,15 @@ JVM_SRC_DIRS += $(call uniq, $(wildcard $(foreach d, $(JVM_SRC_ROOTS), \
     $(JVM_VARIANT_OUTPUTDIR)/gensrc
     #
 
+ifeq ($(call isTargetOs, aix), true)
+  ADD_PLATFORM_INCLUDE_DIR := -I$(TOPDIR)/src/java.base/aix/native/include
+endif
+
 JVM_CFLAGS_INCLUDES += \
     $(patsubst %,-I%,$(JVM_SRC_DIRS)) \
     -I$(TOPDIR)/src/hotspot/share/include \
     -I$(TOPDIR)/src/hotspot/os/$(HOTSPOT_TARGET_OS_TYPE)/include \
+    $(ADD_PLATFORM_INCLUDE_DIR) \
     -I$(SUPPORT_OUTPUTDIR)/modules_include/java.base \
     -I$(SUPPORT_OUTPUTDIR)/modules_include/java.base/$(OPENJDK_TARGET_OS_INCLUDE_SUBDIR) \
     -I$(TOPDIR)/src/java.base/share/native/libjimage \
diff --git a/make/modules/java.desktop/lib/AwtLibraries.gmk b/make/modules/java.desktop/lib/AwtLibraries.gmk
index 1aa2578d2e2..887dfab01df 100644
--- a/make/modules/java.desktop/lib/AwtLibraries.gmk
+++ b/make/modules/java.desktop/lib/AwtLibraries.gmk
@@ -99,14 +99,16 @@ ifeq ($(call isTargetOs, windows), true)
       $(TOPDIR)/src/$(MODULE)/windows/native/libawt/windows/awt.rc
 endif
 
-# This is the object file to provide the dladdr API, which is not
-# part of AIX. It occurs several times in the jdk code base.
-# Do not include it. When statically linking the java
-# launcher with all JDK and VM static libraries, we use the
-# --whole-archive linker option. The duplicate objects in different
-# static libraries cause linking errors due to duplicate symbols.
 ifeq ($(call isTargetOs, aix), true)
+  # This is the object file to provide the dladdr API, which is not
+  # part of AIX. It occurs several times in the jdk code base.
+  # Do not include it. When statically linking the java
+  # launcher with all JDK and VM static libraries, we use the
+  # --whole-archive linker option. The duplicate objects in different
+  # static libraries cause linking errors due to duplicate symbols.
   LIBAWT_STATIC_EXCLUDE_OBJS := porting_aix.o
+
+  LIBAWT_CFLAGS += -I$(TOPDIR)/src/java.base/aix/native/include
 endif
 
 # -fgcse-after-reload improves performance of MaskFill in Java2D by 20% for
diff --git a/src/hotspot/os/aix/porting_aix.hpp b/src/hotspot/os/aix/porting_aix.hpp
index a1a22d81471..0bd71079d0a 100644
--- a/src/hotspot/os/aix/porting_aix.hpp
+++ b/src/hotspot/os/aix/porting_aix.hpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2012, 2024 SAP SE. All rights reserved.
+ * Copyright (c) 2012, 2026 SAP SE. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -37,25 +37,9 @@
 // (see http://linux.die.net/man/3/dladdr)
 // dladdr(3) is not POSIX but a GNU extension, and is not available on AIX.
 //
-// Differences between AIX dladdr and Linux dladdr:
-//
-// 1) Dl_info.dli_fbase: can never work, is disabled.
-//   A loaded image on AIX is divided in multiple segments, at least two
-//   (text and data) but potentially also far more. This is because the loader may
-//   load each member into an own segment, as for instance happens with the libC.a
-// 2) Dl_info.dli_sname: This only works for code symbols (functions); for data, a
-//   zero-length string is returned ("").
-// 3) Dl_info.dli_saddr: For code, this will return the entry point of the function,
-//   not the function descriptor.
 
-typedef struct {
-  const char *dli_fname; // file path of loaded library
-  // void *dli_fbase;
-  const char *dli_sname; // symbol name; "" if not known
-  void *dli_saddr;       // address of *entry* of function; not function descriptor;
-} Dl_info;
+#include "dl_info.h"
 
-// Note: we export this to use it inside J2se too
 #ifdef __cplusplus
 extern "C"
 #endif
diff --git a/src/java.base/aix/native/include/dl_info.h b/src/java.base/aix/native/include/dl_info.h
new file mode 100644
index 00000000000..0ea10149300
--- /dev/null
+++ b/src/java.base/aix/native/include/dl_info.h
@@ -0,0 +1,49 @@
+/*
+ * Copyright (c) 1996, 2026, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2026 SAP SE. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.  Oracle designates this
+ * particular file as subject to the "Classpath" exception as provided
+ * by Oracle in the LICENSE file that accompanied this code.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+#ifndef AIX_INCLUDE_DL_INFO_H
+#define AIX_INCLUDE_DL_INFO_H
+
+/* struct for dladdr
+ * Differences between AIX dladdr and Linux dladdr:
+ *
+ * 1) Dl_info.dli_fbase: can never work, is not included in our struct
+ *   A loaded image on AIX is divided in multiple segments, at least two
+ *   (text and data) but potentially also far more. This is because the loader may
+ *   load each member into an own segment, as for instance happens with the libC.a
+ * 2) Dl_info.dli_sname: This only works for code symbols (functions); for data, a
+ *   zero-length string is returned ("").
+ * 3) Dl_info.dli_saddr: For code, this will return the entry point of the function,
+ *   not the function descriptor.
+ */
+
+typedef struct {
+  const char *dli_fname; /* file path of loaded library */
+  const char *dli_sname; /* symbol name; "" if not known */
+  void *dli_saddr;       /* address of *entry* of function; not function descriptor; */
+} Dl_info;
+
+#endif
diff --git a/src/java.base/aix/native/libjli/java_md_aix.h b/src/java.base/aix/native/libjli/java_md_aix.h
index d319a1d6353..d63030fc65e 100644
--- a/src/java.base/aix/native/libjli/java_md_aix.h
+++ b/src/java.base/aix/native/libjli/java_md_aix.h
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2016, 2018 SAP SE. All rights reserved.
+ * Copyright (c) 2016, 2026 SAP SE. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -37,12 +37,7 @@
  * in the hotspot implementation which is not available at this place, though.
  */
 
-typedef struct {
-  const char *dli_fname; /* file path of loaded library */
-  void *dli_fbase;       /* unsupported */
-  const char *dli_sname; /* unsupported */
-  void *dli_saddr;       /* unsupported */
-} Dl_info;
+#include "dl_info.h"
 
 int dladdr(void *addr, Dl_info *info);
 
diff --git a/src/java.desktop/aix/native/libawt/porting_aix.c b/src/java.desktop/aix/native/libawt/porting_aix.c
index b506ef5a44b..d8688c212d7 100644
--- a/src/java.desktop/aix/native/libawt/porting_aix.c
+++ b/src/java.desktop/aix/native/libawt/porting_aix.c
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2012, 2023 SAP SE. All rights reserved.
+ * Copyright (c) 2012, 2026 SAP SE. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -48,15 +48,14 @@ static int dladdr_dont_reload(void* addr, Dl_info* info) {
     if (addr >= p->ldinfo_textorg &&
         (char*)addr < (char*)(p->ldinfo_textorg) + p->ldinfo_textsize) {
       info->dli_fname = p->ldinfo_filename;
-      info->dli_fbase = p->ldinfo_textorg;
-      return 1; /* [sic] */
+      return 1;
     }
     if (!p->ldinfo_next) {
       break;
     }
     p = (struct ld_info*)(((char*)p) + p->ldinfo_next);
   }
-  return 0; /* [sic] */
+  return 0;
 }
 
 #ifdef __cplusplus
@@ -69,14 +68,14 @@ int dladdr(void *addr, Dl_info *info) {
     loaded = 1;
   }
   if (!addr) {
-    return 0;  /* [sic] */
+    return 0;
   }
   /* Address could be AIX function descriptor? */
   void* const addr0 = *( (void**) addr );
   int rc = dladdr_dont_reload(addr, info);
   if (rc == 0) {
     rc = dladdr_dont_reload(addr0, info);
-    if (rc == 0) { /* [sic] */
+    if (rc == 0) {
       fill_dll_info(); /* refill, maybe loadquery info is outdated */
       rc = dladdr_dont_reload(addr, info);
       if (rc == 0) {
diff --git a/src/java.desktop/aix/native/libawt/porting_aix.h b/src/java.desktop/aix/native/libawt/porting_aix.h
index 719bbaf224e..04d11590915 100644
--- a/src/java.desktop/aix/native/libawt/porting_aix.h
+++ b/src/java.desktop/aix/native/libawt/porting_aix.h
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2012, 2018 SAP SE. All rights reserved.
+ * Copyright (c) 2012, 2026 SAP SE. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -24,36 +24,15 @@
  *
  */
 
-/*
- * Header file to contain porting-relevant code which does not have a
- * home anywhere else.
- * This is initially based on hotspot/src/os/aix/vm/{loadlib,porting}_aix.{hpp,cpp}
- */
-
 /*
  * Aix' own version of dladdr().
  * This function tries to mimic dladdr(3) on Linux
  * (see http://linux.die.net/man/3/dladdr)
  * dladdr(3) is not POSIX but a GNU extension, and is not available on AIX.
  *
- * Differences between AIX dladdr and Linux dladdr:
- *
- * 1) Dl_info.dli_fbase: can never work, is disabled.
- *   A loaded image on AIX is divided in multiple segments, at least two
- *   (text and data) but potentially also far more. This is because the loader may
- *   load each member into an own segment, as for instance happens with the libC.a
- * 2) Dl_info.dli_sname: This only works for code symbols (functions); for data, a
- *   zero-length string is returned ("").
- * 3) Dl_info.dli_saddr: For code, this will return the entry point of the function,
- *   not the function descriptor.
  */
 
-typedef struct {
-  const char *dli_fname; /* file path of loaded library */
-  void *dli_fbase;       /* doesn't make sense on AIX */
-  const char *dli_sname; /* symbol name; "" if not known */
-  void *dli_saddr;       /* address of *entry* of function; not function descriptor; */
-} Dl_info;
+#include "dl_info.h"
 
 #ifdef __cplusplus
 extern "C"

From 7484701e18d801914b85bf95fe020e85ebae40cc Mon Sep 17 00:00:00 2001
From: Prasanta Sadhukhan <psadhukhan@openjdk.org>
Date: Mon, 16 Mar 2026 02:12:25 +0000
Subject: [PATCH 197/655] 8309041: Swingutilities2 methods requesting focus can
 have a Cause

Reviewed-by: tr, dnguyen
---
 .../share/classes/sun/swing/SwingUtilities2.java         | 9 +++++----
 1 file changed, 5 insertions(+), 4 deletions(-)

diff --git a/src/java.desktop/share/classes/sun/swing/SwingUtilities2.java b/src/java.desktop/share/classes/sun/swing/SwingUtilities2.java
index d552bc5c9f2..28b93ed1e2a 100644
--- a/src/java.desktop/share/classes/sun/swing/SwingUtilities2.java
+++ b/src/java.desktop/share/classes/sun/swing/SwingUtilities2.java
@@ -44,6 +44,7 @@ import java.awt.Rectangle;
 import java.awt.RenderingHints;
 import java.awt.Shape;
 import java.awt.Toolkit;
+import java.awt.event.FocusEvent;
 import java.awt.event.InputEvent;
 import java.awt.event.KeyEvent;
 import java.awt.event.MouseEvent;
@@ -795,7 +796,7 @@ public class SwingUtilities2 {
      */
     public static void adjustFocus(JComponent c) {
         if (!c.hasFocus() && c.isRequestFocusEnabled()) {
-            c.requestFocus();
+            c.requestFocus(FocusEvent.Cause.MOUSE_EVENT);
         }
     }
 
@@ -1646,7 +1647,7 @@ public class SwingUtilities2 {
                 FocusTraversalPolicy policy = container.getFocusTraversalPolicy();
                 Component comp = policy.getDefaultComponent(container);
                 if (comp!=null) {
-                    comp.requestFocus();
+                    comp.requestFocus(FocusEvent.Cause.TRAVERSAL);
                     return comp;
                 }
             }
@@ -1656,13 +1657,13 @@ public class SwingUtilities2 {
                 Component comp = policy.getComponentAfter(rootAncestor, container);
 
                 if (comp!=null && SwingUtilities.isDescendingFrom(comp, container)) {
-                    comp.requestFocus();
+                    comp.requestFocus(FocusEvent.Cause.TRAVERSAL);
                     return comp;
                 }
             }
         }
         if (component.isFocusable()) {
-            component.requestFocus();
+            component.requestFocus(FocusEvent.Cause.TRAVERSAL);
             return component;
         }
         return null;

From ef0235825a20c33d8d0c83a21d6981606b881d57 Mon Sep 17 00:00:00 2001
From: Tejesh R <tr@openjdk.org>
Date: Mon, 16 Mar 2026 05:45:42 +0000
Subject: [PATCH 198/655] 8354901:
 javax/swing/JTable/8236907/LastVisibleRow.java fails on macosx-aarch64 due to
 difference in before and after image comparison

Reviewed-by: serb, honkar
---
 .../swing/JTable/8236907/LastVisibleRow.java  | 51 ++++++++-----------
 1 file changed, 22 insertions(+), 29 deletions(-)

diff --git a/test/jdk/javax/swing/JTable/8236907/LastVisibleRow.java b/test/jdk/javax/swing/JTable/8236907/LastVisibleRow.java
index 8b60bf8beec..ebd563624cd 100644
--- a/test/jdk/javax/swing/JTable/8236907/LastVisibleRow.java
+++ b/test/jdk/javax/swing/JTable/8236907/LastVisibleRow.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2022, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2022, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -20,6 +20,7 @@
  * or visit www.oracle.com if you need additional information or have any
  * questions.
  */
+
 /*
  * @test
  * @key headful
@@ -59,11 +60,9 @@ public class LastVisibleRow {
         Point clkPoint;
         try {
             testRobot = new Robot();
-            SwingUtilities.invokeAndWait(new Runnable() {
-                public void run() {
-                    createAndShowGUI();
-                }
-            });
+            testRobot.setAutoWaitForIdle(true);
+            testRobot.setAutoDelay(30);
+            SwingUtilities.invokeAndWait(LastVisibleRow::createAndShowGUI);
             testRobot.delay(1000);
             testRobot.waitForIdle();
             BufferedImage bufferedImageBefore = testRobot.createScreenCapture(getCaptureRect());
@@ -73,7 +72,7 @@ public class LastVisibleRow {
             mouseEvents(clkPoint);
             testRobot.waitForIdle();
             clearSelect();
-            testRobot.delay(1000);
+            resetMousePos();
             testRobot.waitForIdle();
             BufferedImage bufferedImageAfter = testRobot.createScreenCapture(getCaptureRect());
 
@@ -137,43 +136,37 @@ public class LastVisibleRow {
         testRobot.delay(50);
     }
 
+    private static void resetMousePos() {
+        testRobot.mouseMove(50, 50);
+        testRobot.delay(50);
+    }
+
     // getMousePosition Actions for last row click
     private static Point getMousePosition() throws Exception {
         final Point[] clickPoint = new Point[1];
-        SwingUtilities.invokeAndWait(new Runnable() {
-            @Override
-            public void run() {
-                clickPoint[0] = getCellClickPoint(2, 0);
-            }
-        });
+        SwingUtilities.invokeAndWait((Runnable) () -> clickPoint[0] = getCellClickPoint(2, 0));
         return clickPoint[0];
     }
 
     // Clears the selected table row
     private static void clearSelect() throws Exception {
-        SwingUtilities.invokeAndWait(new Runnable() {
-            @Override
-            public void run() {
-                table.getSelectionModel().clearSelection();
-                table.setFocusable(false);
-            }
+        SwingUtilities.invokeAndWait((Runnable) () -> {
+            table.getSelectionModel().clearSelection();
+            table.setFocusable(false);
         });
     }
 
     // getCaptureRect Method - To Compute the Rectangle Area of last row
     private static Rectangle getCaptureRect() throws InterruptedException, InvocationTargetException {
         final Rectangle[] captureRect = new Rectangle[1];
-        SwingUtilities.invokeAndWait(new Runnable() {
-            @Override
-            public void run() {
-                Rectangle cellRect = table.getCellRect(2, 0, true);
-                Point point = new Point(cellRect.x, cellRect.y);
-                SwingUtilities.convertPointToScreen(point, table);
+        SwingUtilities.invokeAndWait((Runnable) () -> {
+            Rectangle cellRect = table.getCellRect(2, 0, true);
+            Point point = new Point(cellRect.x, cellRect.y);
+            SwingUtilities.convertPointToScreen(point, table);
 
-                captureRect[0] = new Rectangle(point.x+5, point.y+2,
-                        table.getColumnCount() * cellRect.width - 10,
-                        cellRect.height-2);
-            }
+            captureRect[0] = new Rectangle(point.x + 5, point.y + 2,
+                    table.getColumnCount() * cellRect.width - 10,
+                    cellRect.height - 2);
         });
         return captureRect[0];
     }

From f430f1d865cf069d407e9f41320a7cbd9470fd3a Mon Sep 17 00:00:00 2001
From: Emanuel Peter <epeter@openjdk.org>
Date: Mon, 16 Mar 2026 07:39:21 +0000
Subject: [PATCH 199/655] 8378968: C2 VectorAVX AVX2: wrong result, bad
 optimization in VectorLongToMaskNode::Ideal

Reviewed-by: jbhateja, vlivanov, kvn
---
 src/hotspot/share/opto/vectornode.cpp         |  27 +-
 src/hotspot/share/opto/vectornode.hpp         |  14 +-
 .../compiler/lib/ir_framework/IRNode.java     |  30 +-
 .../TestVectorLongToMaskNodeIdealization.java | 424 ++++++++++++++++++
 4 files changed, 465 insertions(+), 30 deletions(-)
 create mode 100644 test/hotspot/jtreg/compiler/vectorapi/TestVectorLongToMaskNodeIdealization.java

diff --git a/src/hotspot/share/opto/vectornode.cpp b/src/hotspot/share/opto/vectornode.cpp
index d332bf440f6..6012bdef86e 100644
--- a/src/hotspot/share/opto/vectornode.cpp
+++ b/src/hotspot/share/opto/vectornode.cpp
@@ -2020,26 +2020,21 @@ Node* VectorLongToMaskNode::Ideal(PhaseGVN* phase, bool can_reshape) {
   uint vlen = dst_type->length();
   const TypeVectMask* is_mask = dst_type->isa_vectmask();
 
+  // Pattern:      (VectorLongToMask (AndL (VectorMaskToLong src) mask))
+  // Replace with: (VectorMaskCast src)
+  //   The cast is needed if there are different mask types, and can be folded otherwise.
+  //   The mask has exactly the vlen first bits on: mask = (2 << vlen - 1)
   if (in(1)->Opcode() == Op_AndL &&
       in(1)->in(1)->Opcode() == Op_VectorMaskToLong &&
       in(1)->in(2)->bottom_type()->isa_long() &&
       in(1)->in(2)->bottom_type()->is_long()->is_con() &&
-      in(1)->in(2)->bottom_type()->is_long()->get_con() == ((1L << vlen) - 1)) {
-      // Different src/dst mask length represents a re-interpretation operation,
-      // we can however generate a mask casting operation if length matches.
-     Node* src = in(1)->in(1)->in(1);
-     if (is_mask == nullptr) {
-       if (src->Opcode() != Op_VectorStoreMask) {
-         return nullptr;
-       }
-       src = src->in(1);
-     }
-     const TypeVect* src_type = src->bottom_type()->is_vect();
-     if (src_type->length() == vlen &&
-         ((src_type->isa_vectmask() == nullptr && is_mask == nullptr) ||
-          (src_type->isa_vectmask() && is_mask))) {
-       return new VectorMaskCastNode(src, dst_type);
-     }
+      in(1)->in(2)->bottom_type()->is_long()->get_con() == ((1LL << vlen) - 1)) {
+    Node* src = in(1)->in(1)->in(1);
+    const TypeVect* src_type = src->bottom_type()->is_vect();
+    if (src_type->length() == vlen &&
+        ((src_type->isa_vectmask() == nullptr) == (is_mask == nullptr))) {
+      return new VectorMaskCastNode(src, dst_type);
+    }
   }
 
   // VectorLongToMask(-1/0) => MaskAll(-1/0)
diff --git a/src/hotspot/share/opto/vectornode.hpp b/src/hotspot/share/opto/vectornode.hpp
index f0d010ee735..dce43f92905 100644
--- a/src/hotspot/share/opto/vectornode.hpp
+++ b/src/hotspot/share/opto/vectornode.hpp
@@ -1798,13 +1798,23 @@ class VectorStoreMaskNode : public VectorNode {
   static VectorStoreMaskNode* make(PhaseGVN& gvn, Node* in, BasicType in_type, uint num_elem);
 };
 
-// Lane-wise type cast a vector mask to the given vector type. The vector length
-// of the input and output must be the same.
+// Lane-wise type cast a vector mask to the given vector type.
+// The vector length of the input and output must be the same.
+// We can only cast between:
+// - BVectMask and BVectMask (0x00/0x01)
+// - NVectMask and NVectMask (0x0..0/0xF..F of different bit lengths)
+// - PVectMask and PVectMask (specialized predicate/mask registers)
+// Casting N/PVectMask <-> BVectMask needs to be done by
+// VectorStoreMask and VectorLoadMask.
 class VectorMaskCastNode : public VectorNode {
  public:
   VectorMaskCastNode(Node* in, const TypeVect* vt) : VectorNode(in, vt) {
     const TypeVect* in_vt = in->bottom_type()->is_vect();
     assert(in_vt->length() == vt->length(), "vector length must match");
+    assert((in_vt->element_basic_type() == T_BOOLEAN) == (vt->element_basic_type() == T_BOOLEAN),
+           "Cast from/to BVectMask not allowed, use VectorLoadMask/VectorStoreMask instead");
+    assert((in_vt->isa_vectmask() == nullptr) == (vt->isa_vectmask() == nullptr),
+           "Both BVectMask, or both NVectMask, or both PVectMask");
   }
   Node* Identity(PhaseGVN* phase);
   virtual int Opcode() const;
diff --git a/test/hotspot/jtreg/compiler/lib/ir_framework/IRNode.java b/test/hotspot/jtreg/compiler/lib/ir_framework/IRNode.java
index 3508c06ad0a..1c59a03b4b0 100644
--- a/test/hotspot/jtreg/compiler/lib/ir_framework/IRNode.java
+++ b/test/hotspot/jtreg/compiler/lib/ir_framework/IRNode.java
@@ -117,13 +117,14 @@ public class IRNode {
     public static final String VECTOR_SIZE_32  = VECTOR_SIZE + "32";
     public static final String VECTOR_SIZE_64  = VECTOR_SIZE + "64";
 
-    private static final String TYPE_BYTE   = "B";
-    private static final String TYPE_CHAR   = "C";
-    private static final String TYPE_SHORT  = "S";
-    private static final String TYPE_INT    = "I";
-    private static final String TYPE_LONG   = "J";
-    private static final String TYPE_FLOAT  = "F";
-    private static final String TYPE_DOUBLE = "D";
+    private static final String TYPE_BYTE    = "B";
+    private static final String TYPE_CHAR    = "C";
+    private static final String TYPE_SHORT   = "S";
+    private static final String TYPE_INT     = "I";
+    private static final String TYPE_LONG    = "J";
+    private static final String TYPE_FLOAT   = "F";
+    private static final String TYPE_DOUBLE  = "D";
+    private static final String TYPE_BOOLEAN = "Z";
 
     /**
      * IR placeholder string to regex-for-compile-phase map.
@@ -1110,6 +1111,11 @@ public class IRNode {
         vectorNode(LOAD_VECTOR_D, "LoadVector", TYPE_DOUBLE);
     }
 
+    public static final String LOAD_VECTOR_Z = VECTOR_PREFIX + "LOAD_VECTOR_Z" + POSTFIX;
+    static {
+        vectorNode(LOAD_VECTOR_Z, "LoadVector", TYPE_BOOLEAN);
+    }
+
     public static final String LOAD_VECTOR_GATHER = PREFIX + "LOAD_VECTOR_GATHER" + POSTFIX;
     static {
         beforeMatchingNameRegex(LOAD_VECTOR_GATHER, "LoadVectorGather");
@@ -3512,11 +3518,11 @@ public class IRNode {
      */
     public static int getTypeSizeInBytes(String typeString) {
         return switch (typeString) {
-            case TYPE_BYTE              -> 1;
-            case TYPE_CHAR, TYPE_SHORT  -> 2;
-            case TYPE_INT, TYPE_FLOAT   -> 4;
-            case TYPE_LONG, TYPE_DOUBLE -> 8;
-            default                     -> 0;
+            case TYPE_BYTE, TYPE_BOOLEAN -> 1;
+            case TYPE_CHAR, TYPE_SHORT   -> 2;
+            case TYPE_INT, TYPE_FLOAT    -> 4;
+            case TYPE_LONG, TYPE_DOUBLE  -> 8;
+            default                      -> 0;
         };
     }
 
diff --git a/test/hotspot/jtreg/compiler/vectorapi/TestVectorLongToMaskNodeIdealization.java b/test/hotspot/jtreg/compiler/vectorapi/TestVectorLongToMaskNodeIdealization.java
new file mode 100644
index 00000000000..706e21554bb
--- /dev/null
+++ b/test/hotspot/jtreg/compiler/vectorapi/TestVectorLongToMaskNodeIdealization.java
@@ -0,0 +1,424 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+package compiler.vectorapi;
+
+import java.util.Arrays;
+import java.util.ArrayList;
+import java.util.List;
+import java.util.Set;
+import java.util.Random;
+
+import jdk.test.lib.Utils;
+
+import compiler.lib.ir_framework.*;
+import compiler.lib.verify.Verify;
+import jdk.incubator.vector.*;
+import compiler.lib.compile_framework.CompileFramework;
+
+import compiler.lib.template_framework.Template;
+import compiler.lib.template_framework.TemplateToken;
+import compiler.lib.template_framework.library.TestFrameworkClass;
+import compiler.lib.template_framework.library.PrimitiveType;
+import compiler.lib.template_framework.library.CodeGenerationDataNameType;
+import static compiler.lib.template_framework.Template.scope;
+import static compiler.lib.template_framework.Template.let;
+
+/*
+ * @test
+ * @bug 8277997 8378968
+ * @key randomness
+ * @summary Testing some optimizations in VectorLongToMaskNode::Ideal
+ *          For now: VectorMask.fromLong(.., mask.toLong())
+ * @modules jdk.incubator.vector
+ * @library /test/lib /
+ * @compile ../../compiler/lib/ir_framework/TestFramework.java
+ * @compile ../../compiler/lib/generators/Generators.java
+ * @compile ../../compiler/lib/verify/Verify.java
+ * @run driver ${test.main.class}
+ */
+public class TestVectorLongToMaskNodeIdealization {
+    private static final Random RANDOM = Utils.getRandomInstance();
+
+    static final long[] ONES_L = new long[64];
+    static { Arrays.fill(ONES_L, 1); }
+
+    static final boolean[] TRUES = new boolean[64];
+    static { Arrays.fill(TRUES, true); }
+
+    public static void main(String[] args) {
+        // Run some tests directly first.
+        TestFramework testFramework = new TestFramework();
+        testFramework.setDefaultWarmup(10000)
+                     .addFlags("--add-modules=jdk.incubator.vector")
+                     .start();
+
+        // Then also generate some random examples.
+        CompileFramework comp = new CompileFramework();
+        comp.addJavaSourceCode("compiler.vectorapi.templated.Templated", generate(comp));
+        comp.compile("--add-modules=jdk.incubator.vector");
+        comp.invoke("compiler.vectorapi.templated.Templated", "main", new Object[] {new String[] {
+            "--add-modules=jdk.incubator.vector",
+            "--add-opens", "jdk.incubator.vector/jdk.incubator.vector=ALL-UNNAMED",
+            "--add-opens", "java.base/java.lang=ALL-UNNAMED"
+        }});
+    }
+
+    // -------------------------------------------------------------------------------------
+    @Test
+    @IR(counts = {IRNode.REPLICATE_L,     IRNode.VECTOR_SIZE_4, "> 0",
+                  IRNode.REPLICATE_I,     IRNode.VECTOR_SIZE_4, "> 0",
+                  IRNode.VECTOR_MASK_CMP,                       "> 0",
+                  IRNode.VECTOR_LOAD_MASK,                      "> 0", // Not yet optimized away
+                  IRNode.VECTOR_STORE_MASK,                     "> 0", // Not yet optimized away
+                  IRNode.VECTOR_LONG_TO_MASK,                   "= 0", // Optimized away
+                  IRNode.VECTOR_MASK_TO_LONG,                   "= 0", // Optimized away
+                  IRNode.VECTOR_MASK_CAST,                      "> 0", // Not yet optimized away
+                  IRNode.VECTOR_BLEND_I,  IRNode.VECTOR_SIZE_4, "> 0",
+                  IRNode.XOR_VI,          IRNode.VECTOR_SIZE_4, "> 0",
+                  IRNode.STORE_VECTOR,                          "> 0"},
+                  applyIfCPUFeatureAnd = {"avx2", "true", "avx512", "false"})
+    @IR(counts = {IRNode.REPLICATE_L,     IRNode.VECTOR_SIZE_4, "> 0",
+                  IRNode.REPLICATE_I,     IRNode.VECTOR_SIZE_4, "> 0",
+                  IRNode.VECTOR_MASK_CMP,                       "> 0",
+                  IRNode.VECTOR_LOAD_MASK,                      "= 0", // Optimized away
+                  IRNode.VECTOR_STORE_MASK,                     "= 0", // Optimized away
+                  IRNode.VECTOR_LONG_TO_MASK,                   "= 0", // Optimized away
+                  IRNode.VECTOR_MASK_TO_LONG,                   "= 0", // Optimized away
+                  IRNode.VECTOR_MASK_CAST,                      "> 0", // Cast I->J
+                  IRNode.VECTOR_BLEND_I,                        "= 0", // Not needed
+                  IRNode.XOR_VI,          IRNode.VECTOR_SIZE_4, "> 0",
+                  IRNode.STORE_VECTOR,                          "> 0"},
+                  applyIfCPUFeature = {"avx512", "true"})
+    // This is the original reproducer for JDK-8378968, which failed on AVX2 with a wrong result.
+    public static Object test1() {
+        // There was a bug here with AVX2:
+        var ones = LongVector.broadcast(LongVector.SPECIES_256, 1);
+        var trues_L256 = ones.compare(VectorOperators.NE, 0);
+        // VectorMaskCmp #vectory<J,4>   -> (L-mask=0x0..0/0xF..F)
+
+        var trues_I128 = VectorMask.fromLong(IntVector.SPECIES_128, trues_L256.toLong());
+        // VectorStoreMask(L-mask to 0/1)
+        // VectorMaskToLong
+        // AndL(truncate)
+        // VectorLongToMask -> 0/1
+        //
+        // VectorLongToMaskNode::Ideal transforms this into:
+        // VectorMaskCmp #vectory<J,4>   -> (L-mask=0x0..0/0xF..F)
+        // VectorMaskCastNode -> (L-mask=0x0..0/0xF..F to 0/1)
+        //   But VectorMaskCastNode is not made for such mask conversion to boolean mask,
+        //   and so it wrongly produces a 0x00/0xFF byte mask, instead of bytes 0x00/01.
+        //   See: vector_mask_cast
+        //
+        // The correct transformation would have been to:
+        // VectorMaskCmp #vectory<J,4>   -> (L-mask=0x0..0/0xF..F)
+        // VectorStoreMask(L-mask to 0/1, i.e. 0x00/0x01 bytes)
+
+        var zeros = IntVector.zero(IntVector.SPECIES_128);
+        var m1s = zeros.lanewise(VectorOperators.NOT, trues_I128);
+        // The rest of the code is:
+        // VectorLoadMask (0/1 to I-mask=0x0..0/0xF..F)
+        //   It expects x=0x00/0x01 bytes, and does a subtraction 0-x to get values 0x00/0xFF
+        //   that are then widened to int-length.
+        //   But if it instead gets 0x00/0xFF, the subtraction produces 0x00/0x01 values, which
+        //   are widened to int 0x0..0/0..01 values.
+        //   See: load_vector_mask
+        // Blend, which expects I-mask (0x0..0/0xF..F)
+        //   It looks at the 7th (uppermost) bit of every byte to determine which byte is taken.
+        //   If it instead gets the 0x0..0/0x0..01 mask, it interprets both as "false".
+
+        int[] out = new int[64];
+        m1s.intoArray(out, 0);
+        return out;
+    }
+
+    static final Object GOLD_TEST1 = test1();
+
+    @Check(test = "test1")
+    public static void check_test1(Object out) {
+        Verify.checkEQ(GOLD_TEST1, out);
+    }
+    // -------------------------------------------------------------------------------------
+    @Test
+    @IR(counts = {IRNode.REPLICATE_L,     IRNode.VECTOR_SIZE_4, "> 0",
+                  IRNode.REPLICATE_I,     IRNode.VECTOR_SIZE_4, "> 0",
+                  IRNode.LOAD_VECTOR_L,   IRNode.VECTOR_SIZE_4, "> 0",
+                  IRNode.VECTOR_MASK_CMP,                       "> 0",
+                  IRNode.VECTOR_LOAD_MASK,                      "> 0", // Not yet optimized away
+                  IRNode.VECTOR_STORE_MASK,                     "> 0", // Not yet optimized away
+                  IRNode.VECTOR_LONG_TO_MASK,                   "= 0", // Optimized away
+                  IRNode.VECTOR_MASK_TO_LONG,                   "= 0", // Optimized away
+                  IRNode.VECTOR_MASK_CAST,                      "> 0", // Not yet optimized away: Cast Z->Z, see JDK-8379866
+                  IRNode.VECTOR_BLEND_I,  IRNode.VECTOR_SIZE_4, "> 0",
+                  IRNode.XOR_VI,          IRNode.VECTOR_SIZE_4, "> 0",
+                  IRNode.STORE_VECTOR,                          "> 0"},
+                  applyIfCPUFeatureAnd = {"avx2", "true", "avx512", "false"})
+    @IR(counts = {IRNode.REPLICATE_L,     IRNode.VECTOR_SIZE_4, "> 0",
+                  IRNode.REPLICATE_I,     IRNode.VECTOR_SIZE_4, "> 0",
+                  IRNode.LOAD_VECTOR_L,   IRNode.VECTOR_SIZE_4, "> 0",
+                  IRNode.VECTOR_MASK_CMP,                       "> 0",
+                  IRNode.VECTOR_LOAD_MASK,                      "= 0", // Optimized away
+                  IRNode.VECTOR_STORE_MASK,                     "= 0", // Optimized away
+                  IRNode.VECTOR_LONG_TO_MASK,                   "= 0", // Optimized away
+                  IRNode.VECTOR_MASK_TO_LONG,                   "= 0", // Optimized away
+                  IRNode.VECTOR_MASK_CAST,                      "> 0", // Cast I->J
+                  IRNode.VECTOR_BLEND_I,                        "= 0", // Not needed
+                  IRNode.XOR_VI,          IRNode.VECTOR_SIZE_4, "> 0",
+                  IRNode.STORE_VECTOR,                          "> 0"},
+                  applyIfCPUFeature = {"avx512", "true"})
+    // The original reproducer test1 could eventually constant-fold the comparison
+    // with zero and trues. So let's make sure we load the data from a mutable array.
+    public static Object test1b() {
+        // load instead of broadcast:
+        var ones = LongVector.fromArray(LongVector.SPECIES_256, ONES_L, 0);
+        var trues_L256 = ones.compare(VectorOperators.NE, 0);
+
+        var trues_I128 = VectorMask.fromLong(IntVector.SPECIES_128, trues_L256.toLong());
+
+        var zeros = IntVector.zero(IntVector.SPECIES_128);
+        var m1s = zeros.lanewise(VectorOperators.NOT, trues_I128);
+
+        int[] out = new int[64];
+        m1s.intoArray(out, 0);
+        return out;
+    }
+
+    static final Object GOLD_TEST1B = test1b();
+
+    @Check(test = "test1b")
+    public static void check_test1b(Object out) {
+        Verify.checkEQ(GOLD_TEST1B, out);
+    }
+    // -------------------------------------------------------------------------------------
+    @Test
+    @IR(counts = {IRNode.REPLICATE_L,     IRNode.VECTOR_SIZE_4, "= 0",
+                  IRNode.REPLICATE_I,     IRNode.VECTOR_SIZE_4, "> 0",
+                  IRNode.LOAD_VECTOR_Z,   IRNode.VECTOR_SIZE_4, "> 0",
+                  IRNode.VECTOR_MASK_CMP,                       "= 0",
+                  IRNode.VECTOR_LOAD_MASK,                      "> 0",
+                  IRNode.VECTOR_STORE_MASK,                     "= 0",
+                  IRNode.VECTOR_LONG_TO_MASK,                   "= 0", // Optimized away
+                  IRNode.VECTOR_MASK_TO_LONG,                   "= 0", // Optimized away
+                  IRNode.VECTOR_MASK_CAST,                      "> 0", // Not yet optimized Z->Z, see JDK-8379866
+                  IRNode.VECTOR_BLEND_I,  IRNode.VECTOR_SIZE_4, "> 0",
+                  IRNode.XOR_VI,          IRNode.VECTOR_SIZE_4, "> 0",
+                  IRNode.STORE_VECTOR,                          "> 0"},
+                  applyIfCPUFeatureAnd = {"avx2", "true", "avx512", "false"})
+    @IR(counts = {IRNode.REPLICATE_L,     IRNode.VECTOR_SIZE_4, "= 0",
+                  IRNode.REPLICATE_I,     IRNode.VECTOR_SIZE_4, "> 0",
+                  IRNode.LOAD_VECTOR_Z,   IRNode.VECTOR_SIZE_4, "> 0",
+                  IRNode.VECTOR_MASK_CMP,                       "= 0",
+                  IRNode.VECTOR_LOAD_MASK,                      "> 0",
+                  IRNode.VECTOR_STORE_MASK,                     "= 0",
+                  IRNode.VECTOR_LONG_TO_MASK,                   "= 0", // Optimized away
+                  IRNode.VECTOR_MASK_TO_LONG,                   "= 0", // Optimized away
+                  IRNode.VECTOR_MASK_CAST,                      "> 0", // Cast I->J
+                  IRNode.VECTOR_BLEND_I,                        "= 0", // Not needed
+                  IRNode.XOR_VI,          IRNode.VECTOR_SIZE_4, "> 0",
+                  IRNode.STORE_VECTOR,                          "> 0"},
+                  applyIfCPUFeature = {"avx512", "true"})
+    // And now let's try a case where we load the mask from boolean array, so we don't
+    // have the VectorStoreMask before the VectorMaskToLong.
+    public static Object test1c() {
+        // Load true mask from array directly.
+        var trues_L256 = VectorMask.fromArray(LongVector.SPECIES_256, TRUES, 0);
+
+        var trues_I128 = VectorMask.fromLong(IntVector.SPECIES_128, trues_L256.toLong());
+
+        var zeros = IntVector.zero(IntVector.SPECIES_128);
+        var m1s = zeros.lanewise(VectorOperators.NOT, trues_I128);
+
+        int[] out = new int[64];
+        m1s.intoArray(out, 0);
+        return out;
+    }
+
+    static final Object GOLD_TEST1C = test1c();
+
+    @Check(test = "test1c")
+    public static void check_test1c(Object out) {
+        Verify.checkEQ(GOLD_TEST1C, out);
+    }
+    // -------------------------------------------------------------------------------------
+
+    // TODO: we can refactor this away once JDK-8369699 is integrated.
+    record VectorType(PrimitiveType elementType, int length) {
+        String typeName() {
+            return switch(elementType.name()) {
+                case "byte"   -> "ByteVector";
+                case "short"  -> "ShortVector";
+                case "int"    -> "IntVector";
+                case "long"   -> "LongVector";
+                case "float"  -> "FloatVector";
+                case "double" -> "DoubleVector";
+                default       -> throw new UnsupportedOperationException("Not supported: " + elementType.name());
+            };
+        }
+
+        String speciesName() {
+            return typeName() + ".SPECIES_" + bitSize();
+        }
+
+        int bitSize() {
+            return elementType.byteSize() * length() * 8;
+        }
+    }
+
+    public static final List<VectorType> VECTOR_TYPES = List.of(
+        new VectorType(CodeGenerationDataNameType.bytes(), 8),
+        new VectorType(CodeGenerationDataNameType.bytes(), 16),
+        new VectorType(CodeGenerationDataNameType.bytes(), 32),
+        new VectorType(CodeGenerationDataNameType.bytes(), 64),
+        new VectorType(CodeGenerationDataNameType.shorts(), 4),
+        new VectorType(CodeGenerationDataNameType.shorts(), 8),
+        new VectorType(CodeGenerationDataNameType.shorts(), 16),
+        new VectorType(CodeGenerationDataNameType.shorts(), 32),
+        new VectorType(CodeGenerationDataNameType.ints(), 2),
+        new VectorType(CodeGenerationDataNameType.ints(), 4),
+        new VectorType(CodeGenerationDataNameType.ints(), 8),
+        new VectorType(CodeGenerationDataNameType.ints(), 16),
+        new VectorType(CodeGenerationDataNameType.longs(), 1),
+        new VectorType(CodeGenerationDataNameType.longs(), 2),
+        new VectorType(CodeGenerationDataNameType.longs(), 4),
+        new VectorType(CodeGenerationDataNameType.longs(), 8),
+        new VectorType(CodeGenerationDataNameType.floats(), 2),
+        new VectorType(CodeGenerationDataNameType.floats(), 4),
+        new VectorType(CodeGenerationDataNameType.floats(), 8),
+        new VectorType(CodeGenerationDataNameType.floats(), 16),
+        new VectorType(CodeGenerationDataNameType.doubles(), 1),
+        new VectorType(CodeGenerationDataNameType.doubles(), 2),
+        new VectorType(CodeGenerationDataNameType.doubles(), 4),
+        new VectorType(CodeGenerationDataNameType.doubles(), 8)
+    );
+
+    private static String generate(CompileFramework comp) {
+        // Create a list to collect all tests.
+        List<TemplateToken> tests = new ArrayList<>();
+
+        var testTemplate = Template.make("t1", "t2", (VectorType t1, VectorType t2) -> scope(
+            let("e1", t1.elementType()),
+            let("e2", t2.elementType()),
+            let("V1", t1.typeName()),
+            let("V2", t2.typeName()),
+            let("S1", t1.speciesName()),
+            let("S2", t2.speciesName()),
+            """
+            // ------------ $test -------------
+            @Test
+            @Warmup(10_000)
+            """,
+            // Now let's generate some IR rules.
+            // General Idea: if the lengths match, we can optimize. If the don't match, it is
+            //               a truncation/zero extension, and we don't optimize.
+            //
+            // TODO: length=64 leads the AndL mask to be all-ones, and fold away immediately.
+            //       We could eventually extend the optimization to handle that. See JDK-8379398.
+            //
+            // AVX512: expect vectorization in length range [4..64]
+            //         TODO: 2-element masks are currently not properly intrinsified, see JDK-8378589.
+            (t1.length() >= 4 && t2.length() >= 4)
+            ?(  (t1.length() == t2.length && t1.length() != 64)
+                ?   """
+                    @IR(counts = {IRNode.VECTOR_LONG_TO_MASK, "= 0",  // Optimized away
+                                  IRNode.VECTOR_MASK_TO_LONG, "= 0"}, // Optimized away
+                        applyIfCPUFeature = {"avx512", "true"})
+                    """
+                :   """
+                    @IR(counts = {IRNode.VECTOR_LONG_TO_MASK, "> 0",  // Cannot optimize
+                                  IRNode.VECTOR_MASK_TO_LONG, "> 0"}, // Cannot optimize
+                        applyIfCPUFeature = {"avx512", "true"})
+                    """)
+            :(   """
+                 // AVX512: at least one vector length not in range [4..64] -> no IR rule.
+                 """),
+            // AVX2: expect vectorization if: length >= 4 and bitSize <= 256
+            //       TODO: 2-element masks are currently not properly intrinsified, see JDK-8378589.
+            (t1.bitSize() <= 256 && t2.bitSize() <= 256 && t1.length() >= 4 && t2.length() >= 4)
+            ?(  (t1.length() == t2.length)
+                ?   """
+                    @IR(counts = {IRNode.VECTOR_LONG_TO_MASK, "= 0",  // Optimized away
+                                  IRNode.VECTOR_MASK_TO_LONG, "= 0"}, // Optimized away
+                        applyIfCPUFeatureAnd = {"avx2", "true", "avx512", "false"})
+                    """
+                :   """
+                    @IR(counts = {IRNode.VECTOR_LONG_TO_MASK, "> 0",  // Cannot optimize
+                                  IRNode.VECTOR_MASK_TO_LONG, "> 0"}, // Cannot optimize
+                        applyIfCPUFeatureAnd = {"avx2", "true", "avx512", "false"})
+                    """)
+            :(   """
+                 // AVX2: at least one vector length not: length >= 4 and bitSize <= 256 -> no IR rule.
+                 """),
+            """
+            public static Object $test() {
+                var inputs = #V1.fromArray(#S1, $INPUT, 0);
+                var mask1 = inputs.compare(VectorOperators.GT, 0);
+
+                var mask2 = VectorMask.fromLong(#S2, mask1.toLong());
+
+                var zeros = #V2.zero(#S2);
+                var m1s   = #V2.broadcast(#S2, -1);
+                var res = zeros.blend(m1s, mask2);
+
+                #e2[] out = new #e2[64];
+                res.intoArray(out, 0);
+                return out;
+            }
+
+            public static #e1[] $INPUT = new #e1[64];
+            """,
+            "static { for (int i = 0; i < $INPUT.length; i++) { $INPUT[i] = ",  t1.elementType().callLibraryRNG(), "; } }",
+            """
+            public static Object $GOLD = $test();
+
+            @Check(test = "$test")
+            public static void $check(Object val) {
+                Verify.checkEQ($GOLD, val);
+            }
+            """
+        ));
+
+        tests.add(PrimitiveType.generateLibraryRNG());
+
+        // It would take a bit long to cover all 20*20=400 combinations, but we can sample some:
+        for (int i = 0; i < 20; i++) {
+            VectorType t1 = VECTOR_TYPES.get(RANDOM.nextInt(VECTOR_TYPES.size()));
+            VectorType t2 = VECTOR_TYPES.get(RANDOM.nextInt(VECTOR_TYPES.size()));
+            tests.add(testTemplate.asToken(t1, t2));
+        }
+
+        // Create the test class, which runs all testTemplateTokens.
+        return TestFrameworkClass.render(
+            // package and class name.
+            "compiler.vectorapi.templated", "Templated",
+            // List of imports.
+            Set.of("compiler.lib.verify.*",
+                   "java.util.Random",
+                   "jdk.test.lib.Utils",
+                   "compiler.lib.generators.*",
+                   "jdk.incubator.vector.*"),
+            // classpath, so the Test VM has access to the compiled class files.
+            comp.getEscapedClassPathOfCompiledClasses(),
+            // The list of tests.
+            tests);
+    }
+}

From c04fe765a3bf952fdb6df526ee681395f2015def Mon Sep 17 00:00:00 2001
From: Dusan Balek <dusan.balek@oracle.com>
Date: Mon, 16 Mar 2026 07:47:26 +0000
Subject: [PATCH 200/655] 8378524: Compile-time constant generated through
 annotation processor is not usable in repeated annotation but fails
 compilation

Reviewed-by: jlahoda, vromero
---
 .../com/sun/tools/javac/comp/Annotate.java    |   1 -
 .../ComplexGeneratedInRepeating.java          | 221 ++++++++++++++++++
 2 files changed, 221 insertions(+), 1 deletion(-)
 create mode 100644 test/langtools/tools/javac/annotations/repeatingAnnotations/generatedInRepeating/ComplexGeneratedInRepeating.java

diff --git a/src/jdk.compiler/share/classes/com/sun/tools/javac/comp/Annotate.java b/src/jdk.compiler/share/classes/com/sun/tools/javac/comp/Annotate.java
index f865afe11fb..118d761573b 100644
--- a/src/jdk.compiler/share/classes/com/sun/tools/javac/comp/Annotate.java
+++ b/src/jdk.compiler/share/classes/com/sun/tools/javac/comp/Annotate.java
@@ -861,7 +861,6 @@ public class Annotate {
                 if (!chk.validateAnnotationDeferErrors(annoTree))
                     log.error(annoTree.pos(), Errors.DuplicateAnnotationInvalidRepeated(origAnnoType));
 
-                c = attributeAnnotation(annoTree, targetContainerType, ctx.env);
                 c.setSynthesized(true);
 
                 @SuppressWarnings("unchecked")
diff --git a/test/langtools/tools/javac/annotations/repeatingAnnotations/generatedInRepeating/ComplexGeneratedInRepeating.java b/test/langtools/tools/javac/annotations/repeatingAnnotations/generatedInRepeating/ComplexGeneratedInRepeating.java
new file mode 100644
index 00000000000..2ddb15a64ea
--- /dev/null
+++ b/test/langtools/tools/javac/annotations/repeatingAnnotations/generatedInRepeating/ComplexGeneratedInRepeating.java
@@ -0,0 +1,221 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+/*
+ * @test
+ * @bug 8378524
+ * @summary Check that repeating annotations whose attributes are not-yet-generated classes and their members work.
+ * @library /tools/lib
+ * @modules
+ *      jdk.compiler/com.sun.tools.javac.api
+ *      jdk.compiler/com.sun.tools.javac.main
+ * @build toolbox.ToolBox toolbox.JavacTask
+ * @run junit ComplexGeneratedInRepeating
+ */
+
+import java.io.IOException;
+import java.io.Writer;
+import java.nio.file.Files;
+import java.nio.file.Path;
+import java.nio.file.Paths;
+import java.util.List;
+import java.util.Set;
+import javax.annotation.processing.AbstractProcessor;
+import javax.annotation.processing.RoundEnvironment;
+import javax.annotation.processing.SupportedAnnotationTypes;
+import javax.lang.model.element.TypeElement;
+import toolbox.JavacTask;
+import toolbox.Task;
+import toolbox.ToolBox;
+
+import org.junit.jupiter.api.BeforeEach;
+import org.junit.jupiter.api.Test;
+import org.junit.jupiter.api.TestInfo;
+
+public class ComplexGeneratedInRepeating {
+
+    Path base;
+    ToolBox tb = new ToolBox();
+
+    @Test
+    void testMember() throws Exception {
+        Path classes = base.resolve("classes");
+        Files.createDirectories(classes);
+        new JavacTask(tb)
+                .options("-d", classes.toString())
+                .sources("""
+                         package test;
+
+                         import java.lang.annotation.Repeatable;
+
+                         @Rep(Constants.C)
+                         @Rep(Constants.C)
+                         public class Test {}
+
+                         @Repeatable(Reps.class)
+                         @interface Rep {
+                            int value();
+                         }
+                         @interface Reps {
+                            Rep[] value();
+                         }
+                         """)
+                .processors(new ProcessorImpl())
+                .run()
+                .writeAll();
+    }
+
+    @Test
+    void testUnresolvableMember() throws Exception {
+        Path classes = base.resolve("classes");
+        Files.createDirectories(classes);
+        List<String> out = new JavacTask(tb)
+                .options("-d", classes.toString(), "-XDrawDiagnostics", "-nowarn")
+                .sources("""
+                         package test;
+
+                         import java.lang.annotation.Repeatable;
+
+                         @Rep(Constants.C)
+                         @Rep(Constants.Unknown)
+                         public class Test {}
+
+                         @Repeatable(Reps.class)
+                         @interface Rep {
+                            int value();
+                         }
+                         @interface Reps {
+                            Rep[] value();
+                         }
+                         """)
+                .processors(new ProcessorImpl())
+                .run(Task.Expect.FAIL)
+                .writeAll()
+                .getOutputLines(Task.OutputKind.DIRECT);
+        tb.checkEqual(out, List.of(
+                "Test.java:6:15: compiler.err.cant.resolve.location: kindname.variable, Unknown, , , (compiler.misc.location: kindname.class, test.Constants, null)",
+                "1 error"));
+    }
+
+    @Test
+    void testIncompatibleMember() throws Exception {
+        Path classes = base.resolve("classes");
+        Files.createDirectories(classes);
+        List<String> out = new JavacTask(tb)
+                .options("-d", classes.toString(), "-XDrawDiagnostics", "-nowarn")
+                .sources("""
+                         package test;
+
+                         import java.lang.annotation.Repeatable;
+
+                         @Rep(Constants.C)
+                         @Rep(Constants.S)
+                         public class Test {}
+
+                         @Repeatable(Reps.class)
+                         @interface Rep {
+                            int value();
+                         }
+                         @interface Reps {
+                            Rep[] value();
+                         }
+                         """)
+                .processors(new ProcessorImpl())
+                .run(Task.Expect.FAIL)
+                .writeAll()
+                .getOutputLines(Task.OutputKind.DIRECT);
+        tb.checkEqual(out, List.of(
+                "Test.java:6:15: compiler.err.prob.found.req: (compiler.misc.inconvertible.types: java.lang.String, int)",
+                "1 error"));
+    }
+
+    @Test
+    void testAnnotation() throws Exception {
+        Path classes = base.resolve("classes");
+        Files.createDirectories(classes);
+        new JavacTask(tb)
+                .options("-d", classes.toString())
+                .sources("""
+                         package test;
+
+                         import java.lang.annotation.Repeatable;
+
+                         @Rep(@Ann(Constants.C))
+                         @Rep(@Ann(Constants.C))
+                         public class Test {}
+
+                         @Repeatable(Reps.class)
+                         @interface Rep {
+                            Ann value();
+                         }
+                         @interface Reps {
+                            Rep[] value();
+                         }
+                         """)
+                .processors(new ProcessorImpl())
+                .run()
+                .writeAll();
+    }
+
+    @SupportedAnnotationTypes("*")
+    private static class ProcessorImpl extends AbstractProcessor {
+
+        int round = 0;
+
+        @Override
+        public boolean process(Set<? extends TypeElement> annotations, RoundEnvironment roundEnv) {
+            if (round++ == 0) {
+                try (Writer w = processingEnv.getFiler().createSourceFile("test.Constants").openWriter()) {
+                    w.append("""
+                             package test;
+                             public class Constants {
+                                 public static final int C = 0;
+                                 public static final String S = "";
+                             }
+                             """);
+                } catch (IOException ex) {
+                    throw new IllegalStateException(ex);
+                }
+                try (Writer w = processingEnv.getFiler().createSourceFile("test.Ann").openWriter()) {
+                    w.append("""
+                             package test;
+                             public @interface Ann {
+                                int value();
+                             }
+                             """);
+                } catch (IOException ex) {
+                    throw new IllegalStateException(ex);
+                }
+            }
+            return false;
+        }
+    }
+
+    @BeforeEach
+    public void setUp(TestInfo info) {
+        base = Paths.get(".")
+                    .resolve(info.getTestMethod()
+                                 .orElseThrow()
+                                 .getName());
+    }
+}

From d3be157fd5f94502e73dd2bda35653a4ea95248d Mon Sep 17 00:00:00 2001
From: Fredrik Bredberg <fbredberg@openjdk.org>
Date: Mon, 16 Mar 2026 09:06:58 +0000
Subject: [PATCH 201/655] 8379457: Test EATests.java#id0 ERROR: monitor list
 errors: error_cnt=1

Reviewed-by: aartemov, aboldtch, dholmes
---
 src/hotspot/share/runtime/synchronizer.cpp | 6 +++++-
 1 file changed, 5 insertions(+), 1 deletion(-)

diff --git a/src/hotspot/share/runtime/synchronizer.cpp b/src/hotspot/share/runtime/synchronizer.cpp
index 8ea5fe31145..e3293f94eeb 100644
--- a/src/hotspot/share/runtime/synchronizer.cpp
+++ b/src/hotspot/share/runtime/synchronizer.cpp
@@ -1416,7 +1416,11 @@ void ObjectSynchronizer::chk_in_use_entry(ObjectMonitor* n, outputStream* out,
   }
 
   const markWord mark = obj->mark();
-  if (!mark.has_monitor()) {
+  // Note: When using ObjectMonitorTable we may observe an intermediate state,
+  // where the monitor is globally visible, but no thread has yet transitioned
+  // the markWord. To avoid reporting a false positive during this transition, we
+  // skip the `!mark.has_monitor()` test if we are using the ObjectMonitorTable.
+  if (!UseObjectMonitorTable && !mark.has_monitor()) {
     out->print_cr("ERROR: monitor=" INTPTR_FORMAT ": in-use monitor's "
                   "object does not think it has a monitor: obj="
                   INTPTR_FORMAT ", mark=" INTPTR_FORMAT, p2i(n),

From 3b8af308d7c403cfc81195562e74cea0fccec3f6 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Joel=20Sikstr=C3=B6m?= <jsikstro@openjdk.org>
Date: Mon, 16 Mar 2026 09:10:07 +0000
Subject: [PATCH 202/655] 8379665: Obsolete AlwaysActAsServerClassMachine and
 NeverActAsServerClassMachine

Reviewed-by: stefank, ayang, aboldtch
---
 .../cpu/aarch64/c1_globals_aarch64.hpp        |  1 -
 .../cpu/aarch64/c2_globals_aarch64.hpp        |  3 -
 src/hotspot/cpu/arm/c1_globals_arm.hpp        |  1 -
 src/hotspot/cpu/arm/c2_globals_arm.hpp        |  3 -
 src/hotspot/cpu/ppc/c1_globals_ppc.hpp        |  1 -
 src/hotspot/cpu/ppc/c2_globals_ppc.hpp        |  3 -
 src/hotspot/cpu/riscv/c1_globals_riscv.hpp    |  1 -
 src/hotspot/cpu/riscv/c2_globals_riscv.hpp    |  3 -
 src/hotspot/cpu/s390/c1_globals_s390.hpp      |  1 -
 src/hotspot/cpu/s390/c2_globals_s390.hpp      |  3 -
 src/hotspot/cpu/x86/c1_globals_x86.hpp        |  1 -
 src/hotspot/cpu/x86/c2_globals_x86.hpp        |  3 -
 .../share/compiler/compilerDefinitions.cpp    | 18 ++---
 .../share/compiler/compiler_globals_pd.hpp    |  7 --
 src/hotspot/share/gc/shared/gc_globals.hpp    |  6 --
 src/hotspot/share/runtime/arguments.cpp       |  4 +-
 src/hotspot/share/runtime/os.cpp              | 10 ---
 src/java.base/share/man/java.md               | 40 +++++------
 test/hotspot/gtest/runtime/test_globals.cpp   |  2 +-
 .../gc/arguments/TestSelectDefaultGC.java     | 70 -------------------
 .../jfr/event/compiler/TestCompilerPhase.java |  1 -
 .../test/lib/cli/CommandLineOptionTest.java   | 20 ------
 22 files changed, 27 insertions(+), 175 deletions(-)
 delete mode 100644 test/hotspot/jtreg/gc/arguments/TestSelectDefaultGC.java

diff --git a/src/hotspot/cpu/aarch64/c1_globals_aarch64.hpp b/src/hotspot/cpu/aarch64/c1_globals_aarch64.hpp
index df013d9d1ee..bb6b3ce907e 100644
--- a/src/hotspot/cpu/aarch64/c1_globals_aarch64.hpp
+++ b/src/hotspot/cpu/aarch64/c1_globals_aarch64.hpp
@@ -51,7 +51,6 @@ define_pd_global(bool, ProfileInterpreter,           false);
 define_pd_global(size_t, CodeCacheExpansionSize,     32*K );
 define_pd_global(size_t, CodeCacheMinBlockLength,    1);
 define_pd_global(size_t, CodeCacheMinimumUseSpace,   400*K);
-define_pd_global(bool, NeverActAsServerClassMachine, true );
 define_pd_global(bool, CICompileOSR,                 true );
 #endif // !COMPILER2
 define_pd_global(bool, UseTypeProfile,               false);
diff --git a/src/hotspot/cpu/aarch64/c2_globals_aarch64.hpp b/src/hotspot/cpu/aarch64/c2_globals_aarch64.hpp
index 87ad9caaa45..192461d1a61 100644
--- a/src/hotspot/cpu/aarch64/c2_globals_aarch64.hpp
+++ b/src/hotspot/cpu/aarch64/c2_globals_aarch64.hpp
@@ -74,9 +74,6 @@ define_pd_global(size_t, NonNMethodCodeHeapSize,     5*M );
 define_pd_global(size_t, CodeCacheMinBlockLength,    6);
 define_pd_global(size_t, CodeCacheMinimumUseSpace,   400*K);
 
-// Ergonomics related flags
-define_pd_global(bool, NeverActAsServerClassMachine, false);
-
 define_pd_global(bool,  TrapBasedRangeChecks,        false); // Not needed.
 
 #endif // CPU_AARCH64_C2_GLOBALS_AARCH64_HPP
diff --git a/src/hotspot/cpu/arm/c1_globals_arm.hpp b/src/hotspot/cpu/arm/c1_globals_arm.hpp
index 992cfd0e408..9db999e81b3 100644
--- a/src/hotspot/cpu/arm/c1_globals_arm.hpp
+++ b/src/hotspot/cpu/arm/c1_globals_arm.hpp
@@ -52,7 +52,6 @@ define_pd_global(bool, ProfileInterpreter,           false);
 define_pd_global(size_t, CodeCacheExpansionSize,     32*K );
 define_pd_global(size_t, CodeCacheMinBlockLength,    1);
 define_pd_global(size_t, CodeCacheMinimumUseSpace,   400*K);
-define_pd_global(bool, NeverActAsServerClassMachine, true);
 define_pd_global(bool, CICompileOSR,                 true );
 #endif // COMPILER2
 define_pd_global(bool, UseTypeProfile,               false);
diff --git a/src/hotspot/cpu/arm/c2_globals_arm.hpp b/src/hotspot/cpu/arm/c2_globals_arm.hpp
index 84abde5650b..34da47792ae 100644
--- a/src/hotspot/cpu/arm/c2_globals_arm.hpp
+++ b/src/hotspot/cpu/arm/c2_globals_arm.hpp
@@ -93,7 +93,4 @@ define_pd_global(size_t, CodeCacheMinimumUseSpace,   400*K);
 
 define_pd_global(bool,  TrapBasedRangeChecks,        false); // Not needed
 
-// Ergonomics related flags
-define_pd_global(bool, NeverActAsServerClassMachine, false);
-
 #endif // CPU_ARM_C2_GLOBALS_ARM_HPP
diff --git a/src/hotspot/cpu/ppc/c1_globals_ppc.hpp b/src/hotspot/cpu/ppc/c1_globals_ppc.hpp
index 7d2e44a88b6..c6fe15aac07 100644
--- a/src/hotspot/cpu/ppc/c1_globals_ppc.hpp
+++ b/src/hotspot/cpu/ppc/c1_globals_ppc.hpp
@@ -51,7 +51,6 @@ define_pd_global(size_t,   NonNMethodCodeHeapSize,       5*M );
 define_pd_global(size_t,   CodeCacheExpansionSize,       32*K);
 define_pd_global(size_t,   CodeCacheMinBlockLength,      1);
 define_pd_global(size_t,   CodeCacheMinimumUseSpace,     400*K);
-define_pd_global(bool,     NeverActAsServerClassMachine, true);
 define_pd_global(size_t,   InitialCodeCacheSize,         160*K);
 #endif // !COMPILER2
 
diff --git a/src/hotspot/cpu/ppc/c2_globals_ppc.hpp b/src/hotspot/cpu/ppc/c2_globals_ppc.hpp
index eeff8d93dd4..e4942fa1850 100644
--- a/src/hotspot/cpu/ppc/c2_globals_ppc.hpp
+++ b/src/hotspot/cpu/ppc/c2_globals_ppc.hpp
@@ -90,7 +90,4 @@ define_pd_global(size_t,   CodeCacheMinimumUseSpace,     400*K);
 
 define_pd_global(bool,     TrapBasedRangeChecks,          true);
 
-// Ergonomics related flags
-define_pd_global(bool,     NeverActAsServerClassMachine, false);
-
 #endif // CPU_PPC_C2_GLOBALS_PPC_HPP
diff --git a/src/hotspot/cpu/riscv/c1_globals_riscv.hpp b/src/hotspot/cpu/riscv/c1_globals_riscv.hpp
index 00b92a0dec3..b940393f063 100644
--- a/src/hotspot/cpu/riscv/c1_globals_riscv.hpp
+++ b/src/hotspot/cpu/riscv/c1_globals_riscv.hpp
@@ -51,7 +51,6 @@ define_pd_global(bool, ProfileInterpreter,           false);
 define_pd_global(size_t, CodeCacheExpansionSize,     32*K );
 define_pd_global(size_t, CodeCacheMinBlockLength,    1);
 define_pd_global(size_t, CodeCacheMinimumUseSpace,   400*K);
-define_pd_global(bool, NeverActAsServerClassMachine, true );
 define_pd_global(bool, CICompileOSR,                 true );
 #endif // !COMPILER2
 define_pd_global(bool, UseTypeProfile,               false);
diff --git a/src/hotspot/cpu/riscv/c2_globals_riscv.hpp b/src/hotspot/cpu/riscv/c2_globals_riscv.hpp
index afb4ae8fcdd..73ef97939ed 100644
--- a/src/hotspot/cpu/riscv/c2_globals_riscv.hpp
+++ b/src/hotspot/cpu/riscv/c2_globals_riscv.hpp
@@ -74,9 +74,6 @@ define_pd_global(size_t, NonNMethodCodeHeapSize,     5*M );
 define_pd_global(size_t, CodeCacheMinBlockLength,    6);
 define_pd_global(size_t, CodeCacheMinimumUseSpace,   400*K);
 
-// Ergonomics related flags
-define_pd_global(bool, NeverActAsServerClassMachine, false);
-
 define_pd_global(bool, TrapBasedRangeChecks,         false); // Not needed.
 
 #endif // CPU_RISCV_C2_GLOBALS_RISCV_HPP
diff --git a/src/hotspot/cpu/s390/c1_globals_s390.hpp b/src/hotspot/cpu/s390/c1_globals_s390.hpp
index bd07dd87066..64cc239800a 100644
--- a/src/hotspot/cpu/s390/c1_globals_s390.hpp
+++ b/src/hotspot/cpu/s390/c1_globals_s390.hpp
@@ -51,7 +51,6 @@ define_pd_global(size_t,   NonNMethodCodeHeapSize,       5*M);
 define_pd_global(size_t,   CodeCacheExpansionSize,       32*K);
 define_pd_global(size_t,   CodeCacheMinBlockLength,      1);
 define_pd_global(size_t,   CodeCacheMinimumUseSpace,     400*K);
-define_pd_global(bool,     NeverActAsServerClassMachine, true);
 define_pd_global(size_t,   InitialCodeCacheSize,         160*K);
 #endif // !COMPILER2
 
diff --git a/src/hotspot/cpu/s390/c2_globals_s390.hpp b/src/hotspot/cpu/s390/c2_globals_s390.hpp
index 068511be8f3..eee3a8588c3 100644
--- a/src/hotspot/cpu/s390/c2_globals_s390.hpp
+++ b/src/hotspot/cpu/s390/c2_globals_s390.hpp
@@ -78,7 +78,4 @@ define_pd_global(size_t, CodeCacheMinimumUseSpace,   400*K);
 
 define_pd_global(bool,  TrapBasedRangeChecks,        false); // Not needed on z/Architecture.
 
-// Ergonomics related flags
-define_pd_global(bool, NeverActAsServerClassMachine, false);
-
 #endif // CPU_S390_C2_GLOBALS_S390_HPP
diff --git a/src/hotspot/cpu/x86/c1_globals_x86.hpp b/src/hotspot/cpu/x86/c1_globals_x86.hpp
index 063a9185d53..bb75a31a77c 100644
--- a/src/hotspot/cpu/x86/c1_globals_x86.hpp
+++ b/src/hotspot/cpu/x86/c1_globals_x86.hpp
@@ -50,7 +50,6 @@ define_pd_global(bool,   ProfileInterpreter,           false);
 define_pd_global(size_t, CodeCacheExpansionSize,       32*K );
 define_pd_global(size_t, CodeCacheMinBlockLength,      1    );
 define_pd_global(size_t, CodeCacheMinimumUseSpace,     400*K);
-define_pd_global(bool,   NeverActAsServerClassMachine, true );
 define_pd_global(bool,   CICompileOSR,                 true );
 #endif // !COMPILER2
 define_pd_global(bool, UseTypeProfile,                 false);
diff --git a/src/hotspot/cpu/x86/c2_globals_x86.hpp b/src/hotspot/cpu/x86/c2_globals_x86.hpp
index bc119693d32..11d8c03d0ca 100644
--- a/src/hotspot/cpu/x86/c2_globals_x86.hpp
+++ b/src/hotspot/cpu/x86/c2_globals_x86.hpp
@@ -73,7 +73,4 @@ define_pd_global(size_t, CodeCacheMinimumUseSpace,   400*K);
 
 define_pd_global(bool,  TrapBasedRangeChecks,        false); // Not needed on x86.
 
-// Ergonomics related flags
-define_pd_global(bool, NeverActAsServerClassMachine, false);
-
 #endif // CPU_X86_C2_GLOBALS_X86_HPP
diff --git a/src/hotspot/share/compiler/compilerDefinitions.cpp b/src/hotspot/share/compiler/compilerDefinitions.cpp
index b8244036835..5b207334599 100644
--- a/src/hotspot/share/compiler/compilerDefinitions.cpp
+++ b/src/hotspot/share/compiler/compilerDefinitions.cpp
@@ -194,9 +194,6 @@ void CompilerConfig::set_client_emulation_mode_flags() {
   FLAG_SET_ERGO(EnableJVMCI, false);
   FLAG_SET_ERGO(UseJVMCICompiler, false);
 #endif
-  if (FLAG_IS_DEFAULT(NeverActAsServerClassMachine)) {
-    FLAG_SET_ERGO(NeverActAsServerClassMachine, true);
-  }
   if (FLAG_IS_DEFAULT(InitialCodeCacheSize)) {
     FLAG_SET_ERGO(InitialCodeCacheSize, 160*K);
   }
@@ -548,17 +545,10 @@ bool CompilerConfig::should_set_client_emulation_mode_flags() {
   return false;
 #endif
 
-  if (has_c1()) {
-    if (!is_compilation_mode_selected()) {
-      if (NeverActAsServerClassMachine) {
-        return true;
-      }
-    } else if (!has_c2() && !is_jvmci_compiler()) {
-      return true;
-    }
-  }
-
-  return false;
+  return has_c1() &&
+         is_compilation_mode_selected() &&
+         !has_c2() &&
+         !is_jvmci_compiler();
 }
 
 void CompilerConfig::ergo_initialize() {
diff --git a/src/hotspot/share/compiler/compiler_globals_pd.hpp b/src/hotspot/share/compiler/compiler_globals_pd.hpp
index 537a7f030fb..8ac4b53d6cd 100644
--- a/src/hotspot/share/compiler/compiler_globals_pd.hpp
+++ b/src/hotspot/share/compiler/compiler_globals_pd.hpp
@@ -69,13 +69,6 @@ define_pd_global(size_t, NonNMethodCodeHeapSize,     32*M);
 define_pd_global(size_t, CodeCacheExpansionSize,     32*K);
 define_pd_global(size_t, CodeCacheMinBlockLength,    1);
 define_pd_global(size_t, CodeCacheMinimumUseSpace,   200*K);
-#ifndef ZERO
-define_pd_global(bool, NeverActAsServerClassMachine, true);
-#else
-// Zero runs without compilers. Do not let this code to force
-// the GC mode and default heap settings.
-define_pd_global(bool, NeverActAsServerClassMachine, false);
-#endif
 #define CI_COMPILER_COUNT 0
 #else
 
diff --git a/src/hotspot/share/gc/shared/gc_globals.hpp b/src/hotspot/share/gc/shared/gc_globals.hpp
index 2fd062de648..66ca10f1fb6 100644
--- a/src/hotspot/share/gc/shared/gc_globals.hpp
+++ b/src/hotspot/share/gc/shared/gc_globals.hpp
@@ -256,12 +256,6 @@
           "before pushing a continuation entry")                            \
           range(1, INT_MAX/2)                                               \
                                                                             \
-  product_pd(bool, NeverActAsServerClassMachine,                            \
-          "(Deprecated) Never act like a server-class machine")             \
-                                                                            \
-  product(bool, AlwaysActAsServerClassMachine, false,                       \
-          "(Deprecated) Always act like a server-class machine")            \
-                                                                            \
   product(bool, AggressiveHeap, false,                                      \
           "(Deprecated) Optimize heap options for long-running memory "     \
           "intensive apps")                                                 \
diff --git a/src/hotspot/share/runtime/arguments.cpp b/src/hotspot/share/runtime/arguments.cpp
index 11c4853c388..449ac8e826c 100644
--- a/src/hotspot/share/runtime/arguments.cpp
+++ b/src/hotspot/share/runtime/arguments.cpp
@@ -537,8 +537,6 @@ static SpecialFlag const special_jvm_flags[] = {
   { "UseCompressedClassPointers",   JDK_Version::jdk(25),  JDK_Version::jdk(27), JDK_Version::undefined() },
 #endif
   { "AggressiveHeap",               JDK_Version::jdk(26),  JDK_Version::jdk(27), JDK_Version::jdk(28) },
-  { "NeverActAsServerClassMachine", JDK_Version::jdk(26),  JDK_Version::jdk(27), JDK_Version::jdk(28) },
-  { "AlwaysActAsServerClassMachine", JDK_Version::jdk(26),  JDK_Version::jdk(27), JDK_Version::jdk(28) },
   // --- Deprecated alias flags (see also aliased_jvm_flags) - sorted by obsolete_in then expired_in:
   { "CreateMinidumpOnCrash",        JDK_Version::jdk(9),  JDK_Version::undefined(), JDK_Version::undefined() },
 
@@ -554,6 +552,8 @@ static SpecialFlag const special_jvm_flags[] = {
   { "ParallelRefProcBalancingEnabled", JDK_Version::jdk(26),  JDK_Version::jdk(27), JDK_Version::jdk(28) },
   { "MaxRAM",                       JDK_Version::jdk(26),  JDK_Version::jdk(27), JDK_Version::jdk(28) },
   { "NewSizeThreadIncrease",        JDK_Version::undefined(), JDK_Version::jdk(27), JDK_Version::jdk(28) },
+  { "NeverActAsServerClassMachine", JDK_Version::jdk(26),  JDK_Version::jdk(27), JDK_Version::jdk(28) },
+  { "AlwaysActAsServerClassMachine", JDK_Version::jdk(26),  JDK_Version::jdk(27), JDK_Version::jdk(28) },
 
 #ifdef ASSERT
   { "DummyObsoleteTestFlag",        JDK_Version::undefined(), JDK_Version::jdk(18), JDK_Version::undefined() },
diff --git a/src/hotspot/share/runtime/os.cpp b/src/hotspot/share/runtime/os.cpp
index 16335f97fdb..8f7e4d3cb6d 100644
--- a/src/hotspot/share/runtime/os.cpp
+++ b/src/hotspot/share/runtime/os.cpp
@@ -1912,17 +1912,7 @@ void os::trace_page_sizes_for_requested_size(const char* str,
 // as was done for logical processors here, or replicate and
 // specialize this method for each platform.  (Or fix os to have
 // some inheritance structure and use subclassing.  Sigh.)
-// If you want some platform to always or never behave as a server
-// class machine, change the setting of AlwaysActAsServerClassMachine
-// and NeverActAsServerClassMachine in globals*.hpp.
 bool os::is_server_class_machine() {
-  // First check for the early returns
-  if (NeverActAsServerClassMachine) {
-    return false;
-  }
-  if (AlwaysActAsServerClassMachine) {
-    return true;
-  }
   // Then actually look at the machine
   bool  result                                    = false;
   const unsigned int server_processors            = 2;
diff --git a/src/java.base/share/man/java.md b/src/java.base/share/man/java.md
index 8cfccff5abe..18d64b3a4c2 100644
--- a/src/java.base/share/man/java.md
+++ b/src/java.base/share/man/java.md
@@ -2944,26 +2944,6 @@ they're used.
     the configuration of the computer (RAM and CPU). By default, the option
     is disabled and the heap sizes are configured less aggressively.
 
-[`-XX:+NeverActAsServerClassMachine`]{#-XX__NeverActAsServerClassMachine}
-:   Enable the "Client VM emulation" mode which only uses the C1 JIT compiler,
-    a 32Mb CodeCache and the Serial GC. The maximum amount of memory that the
-    JVM may use is set to 1GB by default. The string "emulated-client" is added
-    to the JVM version string.
-
-    By default the flag is set to `true` only on Windows in 32-bit mode and
-    `false` in all other cases.
-
-    The "Client VM emulation" mode will not be enabled if any of the following
-    flags are used on the command line:
-
-    ```
-    -XX:{+|-}TieredCompilation
-    -XX:CompilationMode=mode
-    -XX:TieredStopAtLevel=n
-    -XX:{+|-}EnableJVMCI
-    -XX:{+|-}UseJVMCICompiler
-    ```
-
 ## Obsolete Java Options
 
 These `java` options are still accepted but ignored, and a warning is issued
@@ -2976,6 +2956,26 @@ when they're used.
     396](https://openjdk.org/jeps/396) and made obsolete in JDK 17
     by [JEP 403](https://openjdk.org/jeps/403).
 
+[`-XX:+NeverActAsServerClassMachine`]{#-XX__NeverActAsServerClassMachine}
+:   Enabled the "Client VM emulation" mode, which used only the C1 JIT compiler,
+    a 32Mb CodeCache, and the Serial GC. The maximum amount of memory that the
+    JVM could use was set to 1GB by default. The string "emulated-client" was added
+    to the JVM version string.
+
+    By default the flag was set to `true` only on Windows in 32-bit mode and
+    `false` in all other cases.
+
+    The "Client VM emulation" mode was not enabled if any of the following
+    flags were used on the command line:
+
+    ```
+    -XX:{+|-}TieredCompilation
+    -XX:CompilationMode=mode
+    -XX:TieredStopAtLevel=n
+    -XX:{+|-}EnableJVMCI
+    -XX:{+|-}UseJVMCICompiler
+    ```
+
 ## Removed Java Options
 
 No documented java options have been removed in JDK @@VERSION_SPECIFICATION@@.
diff --git a/test/hotspot/gtest/runtime/test_globals.cpp b/test/hotspot/gtest/runtime/test_globals.cpp
index 9ef5bd6a5af..e88f930ff73 100644
--- a/test/hotspot/gtest/runtime/test_globals.cpp
+++ b/test/hotspot/gtest/runtime/test_globals.cpp
@@ -42,7 +42,7 @@
   } while (0)
 
 TEST_VM(FlagGuard, bool_flag) {
-  TEST_FLAG(AlwaysActAsServerClassMachine, bool, true);
+  TEST_FLAG(PrintCompilation, bool, true);
 }
 
 TEST_VM(FlagGuard, int_flag) {
diff --git a/test/hotspot/jtreg/gc/arguments/TestSelectDefaultGC.java b/test/hotspot/jtreg/gc/arguments/TestSelectDefaultGC.java
deleted file mode 100644
index a5e144bcd15..00000000000
--- a/test/hotspot/jtreg/gc/arguments/TestSelectDefaultGC.java
+++ /dev/null
@@ -1,70 +0,0 @@
-/*
- * Copyright (c) 2015, 2025, Oracle and/or its affiliates. All rights reserved.
- * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
- *
- * This code is free software; you can redistribute it and/or modify it
- * under the terms of the GNU General Public License version 2 only, as
- * published by the Free Software Foundation.
- *
- * This code is distributed in the hope that it will be useful, but WITHOUT
- * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
- * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
- * version 2 for more details (a copy is included in the LICENSE file that
- * accompanied this code).
- *
- * You should have received a copy of the GNU General Public License version
- * 2 along with this work; if not, write to the Free Software Foundation,
- * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
- *
- * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
- * or visit www.oracle.com if you need additional information or have any
- * questions.
- */
-
-package gc.arguments;
-
-/*
- * @test TestSelectDefaultGC
- * @summary Test selection of GC when no GC option is specified
- * @bug 8068582
- * @library /test/lib
- * @library /
- * @requires vm.gc.Serial & vm.gc.G1
- * @modules java.base/jdk.internal.misc
- *          java.management
- * @run driver gc.arguments.TestSelectDefaultGC
- */
-
-import jdk.test.lib.process.OutputAnalyzer;
-
-public class TestSelectDefaultGC {
-    public static void assertVMOption(OutputAnalyzer output, String option, boolean value) {
-        output.shouldMatch(" " + option + " .*=.* " + value + " ");
-    }
-
-    public static void testDefaultGC(boolean actAsServer) throws Exception {
-        // Start VM without specifying GC
-        OutputAnalyzer output = GCArguments.executeTestJava(
-            "-XX:" + (actAsServer ? "+" : "-") + "AlwaysActAsServerClassMachine",
-            "-XX:" + (actAsServer ? "-" : "+") + "NeverActAsServerClassMachine",
-            "-XX:+PrintFlagsFinal",
-            "-version");
-        output.shouldHaveExitValue(0);
-
-        final boolean isServer = actAsServer;
-
-        // Verify GC selection
-        // G1 is default for server class machines
-        assertVMOption(output, "UseG1GC",            isServer);
-        // Serial is default for non-server class machines
-        assertVMOption(output, "UseSerialGC",        !isServer);
-    }
-
-    public static void main(String[] args) throws Exception {
-        // Test server class machine
-        testDefaultGC(false);
-
-        // Test non-server class machine
-        testDefaultGC(true);
-    }
-}
diff --git a/test/jdk/jdk/jfr/event/compiler/TestCompilerPhase.java b/test/jdk/jdk/jfr/event/compiler/TestCompilerPhase.java
index 33884d448bf..0433e157f3d 100644
--- a/test/jdk/jdk/jfr/event/compiler/TestCompilerPhase.java
+++ b/test/jdk/jdk/jfr/event/compiler/TestCompilerPhase.java
@@ -42,7 +42,6 @@ import jdk.test.whitebox.WhiteBox;
  * @build jdk.test.whitebox.WhiteBox
  * @run driver jdk.test.lib.helpers.ClassFileInstaller jdk.test.whitebox.WhiteBox
  * @run main/othervm -Xbootclasspath/a:.
- *     -XX:-NeverActAsServerClassMachine
  *     -XX:+UnlockDiagnosticVMOptions -XX:+WhiteBoxAPI
  *     -XX:CompileOnly=jdk.jfr.event.compiler.TestCompilerPhase::dummyMethod
  *     -XX:+SegmentedCodeCache -Xbootclasspath/a:.
diff --git a/test/lib/jdk/test/lib/cli/CommandLineOptionTest.java b/test/lib/jdk/test/lib/cli/CommandLineOptionTest.java
index a9ae57bca71..48738d4a0da 100644
--- a/test/lib/jdk/test/lib/cli/CommandLineOptionTest.java
+++ b/test/lib/jdk/test/lib/cli/CommandLineOptionTest.java
@@ -201,10 +201,6 @@ public abstract class CommandLineOptionTest {
         if (!Platform.isStatic()) {
             finalOptions.add(CommandLineOptionTest.getVMTypeOption());
         }
-        String extraFlagForEmulated = CommandLineOptionTest.getVMTypeOptionForEmulated();
-        if (extraFlagForEmulated != null) {
-            finalOptions.add(extraFlagForEmulated);
-        }
         Collections.addAll(finalOptions, options);
 
         CommandLineOptionTest.verifyJVMStartup(expectedMessages,
@@ -401,10 +397,6 @@ public abstract class CommandLineOptionTest {
         if (!Platform.isStatic()) {
             finalOptions.add(CommandLineOptionTest.getVMTypeOption());
         }
-        String extraFlagForEmulated = CommandLineOptionTest.getVMTypeOptionForEmulated();
-        if (extraFlagForEmulated != null) {
-            finalOptions.add(extraFlagForEmulated);
-        }
         Collections.addAll(finalOptions, additionalVMOpts);
 
         CommandLineOptionTest.verifyOptionValue(optionName, expectedValue,
@@ -512,18 +504,6 @@ public abstract class CommandLineOptionTest {
         throw new RuntimeException("Unknown VM mode.");
     }
 
-    /**
-     * @return addtional VMoptions(Emulated related) required to start a new VM with the same type as current.
-     */
-    private static String getVMTypeOptionForEmulated() {
-        if (Platform.isServer() && !Platform.isEmulatedClient()) {
-            return "-XX:-NeverActAsServerClassMachine";
-        } else if (Platform.isEmulatedClient()) {
-            return "-XX:+NeverActAsServerClassMachine";
-        }
-        return null;
-    }
-
     private final BooleanSupplier predicate;
 
     /**

From caf7e840c330431b329edb06cbc3c4708f1a9822 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Manuel=20H=C3=A4ssig?= <mhaessig@openjdk.org>
Date: Mon, 16 Mar 2026 09:29:09 +0000
Subject: [PATCH 203/655] 8377541: C2: Memory Barrier IR nodes not eliminated
 for stable array element access

Reviewed-by: dfenacci, qamai, mchevalier, dlong
---
 src/hotspot/share/opto/graphKit.cpp           |  68 +++++++++++-
 src/hotspot/share/opto/graphKit.hpp           |  25 ++++-
 src/hotspot/share/opto/library_call.cpp       |  41 -------
 src/hotspot/share/opto/library_call.hpp       |  23 ----
 .../gcbarriers/TestZGCBarrierElision.java     |   5 +-
 .../stable/TestStableArrayMembars.java        | 105 ++++++++++++++++++
 6 files changed, 196 insertions(+), 71 deletions(-)
 create mode 100644 test/hotspot/jtreg/compiler/stable/TestStableArrayMembars.java

diff --git a/src/hotspot/share/opto/graphKit.cpp b/src/hotspot/share/opto/graphKit.cpp
index c969abb85bb..31da6fd0e2d 100644
--- a/src/hotspot/share/opto/graphKit.cpp
+++ b/src/hotspot/share/opto/graphKit.cpp
@@ -670,6 +670,48 @@ ciInstance* GraphKit::builtin_throw_exception(Deoptimization::DeoptReason reason
   }
 }
 
+GraphKit::SavedState::SavedState(GraphKit* kit) :
+  _kit(kit),
+  _sp(kit->sp()),
+  _jvms(kit->jvms()),
+  _map(kit->clone_map()),
+  _discarded(false)
+{
+  for (DUIterator_Fast imax, i = kit->control()->fast_outs(imax); i < imax; i++) {
+    Node* out = kit->control()->fast_out(i);
+    if (out->is_CFG()) {
+      _ctrl_succ.push(out);
+    }
+  }
+}
+
+GraphKit::SavedState::~SavedState() {
+  if (_discarded) {
+    _kit->destruct_map_clone(_map);
+    return;
+  }
+  _kit->jvms()->set_map(_map);
+  _kit->jvms()->set_sp(_sp);
+  _map->set_jvms(_kit->jvms());
+  _kit->set_map(_map);
+  _kit->set_sp(_sp);
+  for (DUIterator_Fast imax, i = _kit->control()->fast_outs(imax); i < imax; i++) {
+    Node* out = _kit->control()->fast_out(i);
+    if (out->is_CFG() && out->in(0) == _kit->control() && out != _kit->map() && !_ctrl_succ.member(out)) {
+      _kit->_gvn.hash_delete(out);
+      out->set_req(0, _kit->C->top());
+      _kit->C->record_for_igvn(out);
+      --i; --imax;
+      _kit->_gvn.hash_find_insert(out);
+    }
+  }
+}
+
+void GraphKit::SavedState::discard() {
+  _discarded = true;
+}
+
+
 //----------------------------PreserveJVMState---------------------------------
 PreserveJVMState::PreserveJVMState(GraphKit* kit, bool clone_map) {
   DEBUG_ONLY(kit->verify_map());
@@ -1678,13 +1720,22 @@ Node* GraphKit::access_load_at(Node* obj,   // containing obj
     return top(); // Dead path ?
   }
 
+  SavedState old_state(this);
   C2AccessValuePtr addr(adr, adr_type);
   C2ParseAccess access(this, decorators | C2_READ_ACCESS, bt, obj, addr);
+  Node* load;
   if (access.is_raw()) {
-    return _barrier_set->BarrierSetC2::load_at(access, val_type);
+    load = _barrier_set->BarrierSetC2::load_at(access, val_type);
   } else {
-    return _barrier_set->load_at(access, val_type);
+    load = _barrier_set->load_at(access, val_type);
   }
+
+  // Restore the previous state only if the load got folded to a constant
+  // and we can discard any barriers that might have been added.
+  if (load == nullptr || !load->is_Con()) {
+    old_state.discard();
+  }
+  return load;
 }
 
 Node* GraphKit::access_load(Node* adr,   // actual address to load val at
@@ -1695,13 +1746,22 @@ Node* GraphKit::access_load(Node* adr,   // actual address to load val at
     return top(); // Dead path ?
   }
 
+  SavedState old_state(this);
   C2AccessValuePtr addr(adr, adr->bottom_type()->is_ptr());
   C2ParseAccess access(this, decorators | C2_READ_ACCESS, bt, nullptr, addr);
+  Node* load;
   if (access.is_raw()) {
-    return _barrier_set->BarrierSetC2::load_at(access, val_type);
+    load = _barrier_set->BarrierSetC2::load_at(access, val_type);
   } else {
-    return _barrier_set->load_at(access, val_type);
+    load = _barrier_set->load_at(access, val_type);
   }
+
+  // Restore the previous state only if the load got folded to a constant
+  // and we can discard any barriers that might have been added.
+  if (load == nullptr || !load->is_Con()) {
+    old_state.discard();
+  }
+  return load;
 }
 
 Node* GraphKit::access_atomic_cmpxchg_val_at(Node* obj,
diff --git a/src/hotspot/share/opto/graphKit.hpp b/src/hotspot/share/opto/graphKit.hpp
index 0537d31ae36..dc691173f71 100644
--- a/src/hotspot/share/opto/graphKit.hpp
+++ b/src/hotspot/share/opto/graphKit.hpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2001, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2001, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -876,6 +876,29 @@ class GraphKit : public Phase {
   Node* box_vector(Node* in, const TypeInstPtr* vbox_type, BasicType elem_bt, int num_elem, bool deoptimize_on_exception = false);
   Node* unbox_vector(Node* in, const TypeInstPtr* vbox_type, BasicType elem_bt, int num_elem);
   Node* vector_shift_count(Node* cnt, int shift_op, BasicType bt, int num_elem);
+
+  // Helper class to support reverting to a previous parsing state.
+  // When an intrinsic makes changes before bailing out, it's necessary to restore the graph
+  // as it was. See JDK-8359344 for what can happen wrong. It's also not always possible to
+  // bailout before making changes because the bailing out decision might depend on new nodes
+  // (their types, for instance).
+  //
+  // So, if an intrinsic might cause this situation, one must start by saving the state in a
+  // SavedState by constructing it, and the state will be restored on destruction. If the
+  // intrinsic is not bailing out, one need to call discard to prevent restoring the old state.
+  class SavedState : public StackObj {
+    GraphKit* _kit;
+    int _sp;
+    JVMState* _jvms;
+    SafePointNode* _map;
+    Unique_Node_List _ctrl_succ;
+    bool _discarded;
+
+  public:
+    SavedState(GraphKit*);
+    ~SavedState();
+    void discard();
+  };
 };
 
 // Helper class to support building of control flow branches. Upon
diff --git a/src/hotspot/share/opto/library_call.cpp b/src/hotspot/share/opto/library_call.cpp
index 8d3c5a98ea0..501e35ae5cb 100644
--- a/src/hotspot/share/opto/library_call.cpp
+++ b/src/hotspot/share/opto/library_call.cpp
@@ -2393,47 +2393,6 @@ DecoratorSet LibraryCallKit::mo_decorator_for_access_kind(AccessKind kind) {
   }
 }
 
-LibraryCallKit::SavedState::SavedState(LibraryCallKit* kit) :
-  _kit(kit),
-  _sp(kit->sp()),
-  _jvms(kit->jvms()),
-  _map(kit->clone_map()),
-  _discarded(false)
-{
-  for (DUIterator_Fast imax, i = kit->control()->fast_outs(imax); i < imax; i++) {
-    Node* out = kit->control()->fast_out(i);
-    if (out->is_CFG()) {
-      _ctrl_succ.push(out);
-    }
-  }
-}
-
-LibraryCallKit::SavedState::~SavedState() {
-  if (_discarded) {
-    _kit->destruct_map_clone(_map);
-    return;
-  }
-  _kit->jvms()->set_map(_map);
-  _kit->jvms()->set_sp(_sp);
-  _map->set_jvms(_kit->jvms());
-  _kit->set_map(_map);
-  _kit->set_sp(_sp);
-  for (DUIterator_Fast imax, i = _kit->control()->fast_outs(imax); i < imax; i++) {
-    Node* out = _kit->control()->fast_out(i);
-    if (out->is_CFG() && out->in(0) == _kit->control() && out != _kit->map() && !_ctrl_succ.member(out)) {
-      _kit->_gvn.hash_delete(out);
-      out->set_req(0, _kit->C->top());
-      _kit->C->record_for_igvn(out);
-      --i; --imax;
-      _kit->_gvn.hash_find_insert(out);
-    }
-  }
-}
-
-void LibraryCallKit::SavedState::discard() {
-  _discarded = true;
-}
-
 bool LibraryCallKit::inline_unsafe_access(bool is_store, const BasicType type, const AccessKind kind, const bool unaligned) {
   if (callee()->is_static())  return false;  // caller must have the capability!
   DecoratorSet decorators = C2_UNSAFE_ACCESS;
diff --git a/src/hotspot/share/opto/library_call.hpp b/src/hotspot/share/opto/library_call.hpp
index 56141be2362..bd4b753d1cb 100644
--- a/src/hotspot/share/opto/library_call.hpp
+++ b/src/hotspot/share/opto/library_call.hpp
@@ -129,29 +129,6 @@ class LibraryCallKit : public GraphKit {
 
   virtual int reexecute_sp() { return _reexecute_sp; }
 
-  /* When an intrinsic makes changes before bailing out, it's necessary to restore the graph
-   * as it was. See JDK-8359344 for what can happen wrong. It's also not always possible to
-   * bailout before making changes because the bailing out decision might depend on new nodes
-   * (their types, for instance).
-   *
-   * So, if an intrinsic might cause this situation, one must start by saving the state in a
-   * SavedState by constructing it, and the state will be restored on destruction. If the
-   * intrinsic is not bailing out, one need to call discard to prevent restoring the old state.
-   */
-  class SavedState {
-    LibraryCallKit* _kit;
-    uint _sp;
-    JVMState* _jvms;
-    SafePointNode* _map;
-    Unique_Node_List _ctrl_succ;
-    bool _discarded;
-
-  public:
-    SavedState(LibraryCallKit*);
-    ~SavedState();
-    void discard();
-  };
-
   // Helper functions to inline natives
   Node* generate_guard(Node* test, RegionNode* region, float true_prob);
   Node* generate_slow_guard(Node* test, RegionNode* region);
diff --git a/test/hotspot/jtreg/compiler/gcbarriers/TestZGCBarrierElision.java b/test/hotspot/jtreg/compiler/gcbarriers/TestZGCBarrierElision.java
index ff20f750935..38aaee62045 100644
--- a/test/hotspot/jtreg/compiler/gcbarriers/TestZGCBarrierElision.java
+++ b/test/hotspot/jtreg/compiler/gcbarriers/TestZGCBarrierElision.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2023, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2023, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -251,7 +251,8 @@ class TestZGCCorrectBarrierElision {
 class TestZGCEffectiveBarrierElision {
 
     @Test
-    @IR(counts = { IRNode.Z_LOAD_P_WITH_BARRIER_FLAG, Common.ELIDED, "1" }, phase = CompilePhase.FINAL_CODE)
+    // C2 does not emit a field load during parsing, so it also does not emit any barriers.
+    @IR(failOn = { IRNode.Z_LOAD_P_WITH_BARRIER_FLAG, Common.ELIDED }, phase = CompilePhase.FINAL_CODE)
     static void testAllocateThenLoad() {
         Outer o1 = new Outer();
         Common.blackhole(o1);
diff --git a/test/hotspot/jtreg/compiler/stable/TestStableArrayMembars.java b/test/hotspot/jtreg/compiler/stable/TestStableArrayMembars.java
new file mode 100644
index 00000000000..9d7babddfb9
--- /dev/null
+++ b/test/hotspot/jtreg/compiler/stable/TestStableArrayMembars.java
@@ -0,0 +1,105 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+/*
+ * @test
+ * @bug 8377541
+ * @summary Test that membars are eliminated when loading from a stable array.
+ * @library /test/lib /
+ * @modules java.base/jdk.internal.misc
+ * @modules java.base/jdk.internal.vm.annotation
+ * @run driver ${test.main.class}
+ */
+
+package compiler.stable;
+
+import java.util.Objects;
+
+import jdk.internal.misc.Unsafe;
+import jdk.internal.vm.annotation.Stable;
+
+import compiler.lib.ir_framework.*;
+
+public class TestStableArrayMembars {
+
+    private static final Unsafe UNSAFE = Unsafe.getUnsafe();
+
+    public static void main(String[] args) {
+        TestFramework tf = new TestFramework();
+        tf.addTestClassesToBootClassPath();
+        tf.addFlags( "--add-exports=java.base/jdk.internal.misc=ALL-UNNAMED");
+        tf.start();
+    }
+
+    static final class LazyIntArray {
+        @Stable
+        private final Integer[] arr;
+
+        LazyIntArray() {
+            this.arr = new Integer[10];
+        }
+
+        @ForceInline
+        Integer get(int idx) {
+            Integer i = contentsAcquire(offsetFor(idx));
+            return i == null ? slowPath(arr, idx) : i;
+        }
+
+        @ForceInline
+        private Integer contentsAcquire(long offset) {
+            return (Integer) UNSAFE.getReferenceAcquire(arr, offset);
+        }
+
+        @ForceInline
+        private static long offsetFor(long index) {
+            return Unsafe.ARRAY_OBJECT_BASE_OFFSET + Unsafe.ARRAY_OBJECT_INDEX_SCALE * index;
+        }
+
+        static Integer slowPath(final Integer[] array, final int index) {
+            final long offset = offsetFor(index);
+            final Integer t = array[index];
+            if (t == null) {
+                final Integer newValue = Integer.valueOf(42);
+                Objects.requireNonNull(newValue);
+                set(array, index, newValue);
+
+                return newValue;
+            }
+            return t;
+        }
+
+        static void set(Integer[] array, int index, Integer newValue) {
+            if (array[index] == null) {
+                UNSAFE.putReferenceRelease(array, Unsafe.ARRAY_OBJECT_BASE_OFFSET + Unsafe.ARRAY_OBJECT_INDEX_SCALE * (long) index, newValue);
+            }
+        }
+    }
+
+    static final LazyIntArray la = new LazyIntArray();
+
+    @Test
+    @IR(failOn = { IRNode.LOAD, IRNode.MEMBAR })
+    static Integer test() {
+        return la.get(0);
+    }
+}

From c0aa411b3456ae71db775b8c7756ae1b8fa6da58 Mon Sep 17 00:00:00 2001
From: Dusan Balek <dusan.balek@oracle.com>
Date: Mon, 16 Mar 2026 12:07:04 +0000
Subject: [PATCH 204/655] 8378251: Extend word delimiters used in jshell

Reviewed-by: jlahoda
---
 .../jshell/tool/ConsoleIOContext.java         |  3 +-
 test/langtools/jdk/jshell/InputUITest.java    | 36 +++++++++++++++++--
 test/langtools/jdk/jshell/UITesting.java      |  6 +++-
 3 files changed, 40 insertions(+), 5 deletions(-)

diff --git a/src/jdk.jshell/share/classes/jdk/internal/jshell/tool/ConsoleIOContext.java b/src/jdk.jshell/share/classes/jdk/internal/jshell/tool/ConsoleIOContext.java
index 57d427c1774..32664504d20 100644
--- a/src/jdk.jshell/share/classes/jdk/internal/jshell/tool/ConsoleIOContext.java
+++ b/src/jdk.jshell/share/classes/jdk/internal/jshell/tool/ConsoleIOContext.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2015, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2015, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -181,6 +181,7 @@ class ConsoleIOContext extends IOContext {
 
         setupReader.accept(reader);
         reader.setOpt(Option.DISABLE_EVENT_EXPANSION);
+        reader.setVariable(LineReader.WORDCHARS, "_$");
 
         reader.setParser((line, cursor, context) -> {
             if (!ConsoleIOContext.this.allowIncompleteInputs && !repl.isComplete(line)) {
diff --git a/test/langtools/jdk/jshell/InputUITest.java b/test/langtools/jdk/jshell/InputUITest.java
index 1a420d2c345..6886e1302a2 100644
--- a/test/langtools/jdk/jshell/InputUITest.java
+++ b/test/langtools/jdk/jshell/InputUITest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2025, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,7 +23,7 @@
 
 /*
  * @test
- * @bug 8356165 8358552
+ * @bug 8356165 8358552 8378251
  * @summary Check user input works properly
  * @modules
  *     jdk.compiler/com.sun.tools.javac.api
@@ -99,4 +99,34 @@ public class InputUITest extends UITesting {
             waitOutput(out, patternQuote("==> 65"));
         }, false);
     }
-}
\ No newline at end of file
+
+    @Test
+    public void testAltBackspaceDeletesPreviousWord() throws Exception {
+        doRunTest((inputSink, out) -> {
+            inputSink.write("int x = 12 24" + ESC_DEL + "\n");
+            waitOutput(out, "int x = 12 24\u001B\\[2D\u001B\\[K\n" +
+                            "\u001B\\[\\?2004lx ==> 12\n" +
+                            "\u001B\\[\\?2004h" + PROMPT);
+            inputSink.write("System.in" + ESC_DEL + "out.println(x)\n");
+            waitOutput(out, "System.in\u001B\\[2D\u001B\\[Kout.println\\(x\\)\u001B\\[3D\u001B\\[3C\n" +
+                            "\u001B\\[\\?2004l12\n" +
+                            "\u001B\\[\\?2004h" + PROMPT);
+        }, false);
+    }
+
+    @Test
+    public void testAltDDeletesNextWord() throws Exception {
+        doRunTest((inputSink, out) -> {
+            inputSink.write("int x = 12 24" + ESC_B + ESC_D + "\n");
+            waitOutput(out, "int x = 12 24\u001B\\[2D\u001B\\[K\n" +
+                            "\u001B\\[\\?2004lx ==> 12\n" +
+                            "\u001B\\[\\?2004h" + PROMPT);
+            inputSink.write("System.in.println" + ESC_B + ESC_B + ESC_D +
+                            "out" + ESC_F + ESC_F + "(x)\n");
+            waitOutput(out, "System.in.println\u001B\\[7D\u001B\\[3D\u001B\\[2P" +
+                            "\u001B\\[1@o\u001B\\[1@u\u001B\\[1@t\u001B\\[C\u001B\\[7C\\(x\\)\u001B\\[3D\u001B\\[3C\n" +
+                            "\u001B\\[\\?2004l12\n" +
+                            "\u001B\\[\\?2004h" + PROMPT);
+        }, false);
+    }
+}
diff --git a/test/langtools/jdk/jshell/UITesting.java b/test/langtools/jdk/jshell/UITesting.java
index a1bd8f35dee..d63a8460889 100644
--- a/test/langtools/jdk/jshell/UITesting.java
+++ b/test/langtools/jdk/jshell/UITesting.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2017, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2017, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -53,6 +53,10 @@ public class UITesting {
     protected static final String UP = "\033[A";
     protected static final String DOWN = "\033[B";
     protected static final String CTRL_D = "\u0004";
+    protected static final String ESC_DEL = "\u001B\u007F"; // ESC + DEL (common Alt+Backspace)
+    protected static final String ESC_B = "\u001Bb"; // ESC + b (common Alt+b)
+    protected static final String ESC_F = "\u001Bf"; // ESC + f (common Alt+f)
+    protected static final String ESC_D = "\u001Bd"; // ESC + d (common Alt+d)
     private final boolean laxLineEndings;
 
     public UITesting() {

From 318646a6b4559e93722937c97329a9d710b59479 Mon Sep 17 00:00:00 2001
From: David Beaumont <dbeaumont@openjdk.org>
Date: Mon, 16 Mar 2026 13:17:53 +0000
Subject: [PATCH 205/655] 8379626: Refactor jaxp/functional/javax/xml tests to
 use JUnit

Reviewed-by: vyazici, joehw
---
 .../catalog/CatalogReferCircularityTest.java  |   6 +-
 .../xml/datatype/ptests/DurationTest.java     | 298 ++++++++--------
 .../ptests/FactoryNewInstanceTest.java        |  45 ++-
 .../ptests/XMLGregorianCalendarTest.java      | 172 ++++-----
 .../xml/parsers/ptests/DBFNamespaceTest.java  |  39 +-
 .../ptests/DocumentBuilderFactoryTest.java    | 131 +++----
 .../parsers/ptests/DocumentBuilderImpl01.java |  48 +--
 .../parsers/ptests/FactoryConfErrorTest.java  |  40 ++-
 .../ptests/SAXFactoryNewInstanceTest.java     |  35 +-
 .../xml/parsers/ptests/SAXParserFactTest.java |  24 +-
 .../xml/parsers/ptests/SAXParserTest.java     | 337 +++++++-----------
 .../xml/parsers/ptests/SAXParserTest02.java   |  76 ++--
 .../xml/parsers/ptests/SAXParserTest03.java   |  46 ++-
 .../XMLEventFactoryNewInstanceTest.java       |  52 +--
 .../XMLInputFactoryNewInstanceTest.java       |  52 +--
 .../XMLOutputFactoryNewInstanceTest.java      |  52 +--
 .../xml/transform/ptests/Bug6384418Test.java  |  15 +-
 .../xml/transform/ptests/DOMResultTest.java   |  45 +--
 .../transform/ptests/ErrorListenerTest.java   |  31 +-
 .../xml/transform/ptests/SAXSourceTest.java   |  32 +-
 .../xml/transform/ptests/SAXTFactoryTest.java | 164 ++++-----
 .../transform/ptests/StreamResultTest.java    |  32 +-
 .../transform/ptests/TfClearParamTest.java    |  37 +-
 .../xml/transform/ptests/TransformTest.java   |  78 ++--
 .../transform/ptests/TransformerExcpTest.java |  61 ++--
 .../ptests/TransformerFactoryTest.java        |  79 ++--
 .../xml/transform/ptests/TransformerTest.java |  52 ++-
 .../transform/ptests/TransformerTest02.java   |  31 +-
 .../transform/ptests/TransformerTest03.java   |  33 +-
 .../xml/transform/ptests/URIResolverTest.java | 122 ++-----
 .../ptests/othervm/TFCErrorTest.java          |  31 +-
 .../xml/transform/xmlfiles/out/saxtf008GF.out |  30 +-
 .../validation/ptests/SchemaFactoryTest.java  | 255 ++++++-------
 .../ptests/TypeInfoProviderTest.java          |  40 +--
 .../ptests/ValidatorHandlerTest.java          |  86 +++--
 .../xml/validation/ptests/ValidatorTest.java  | 112 +++---
 .../ptests/XPathEvaluationResultTest.java     |  75 +---
 .../xml/xpath/ptests/XPathExpressionTest.java | 282 +++++----------
 .../xml/xpath/ptests/XPathFactoryTest.java    | 107 +++---
 .../ptests/XPathFunctionResolverTest.java     |  22 +-
 .../javax/xml/xpath/ptests/XPathTest.java     | 289 +++++++--------
 .../isolatedjdk/catalog/PropertiesTest.java   |  42 +--
 .../javax/xml/parsers/ptests/MyCHandler.java  |  13 +-
 .../xml/parsers/ptests/ParserTestConst.java   |  21 +-
 .../ptests/TransformerTestConst.java          |  20 +-
 .../ptests/ValidationTestConst.java           |  22 +-
 .../xml/xpath/ptests/XPathTestConst.java      |  10 +-
 .../libs/jaxp/library/JAXPDataProvider.java   |  14 +-
 48 files changed, 1682 insertions(+), 2054 deletions(-)

diff --git a/test/jaxp/javax/xml/jaxp/functional/catalog/CatalogReferCircularityTest.java b/test/jaxp/javax/xml/jaxp/functional/catalog/CatalogReferCircularityTest.java
index c88827c1a39..612011f8eb6 100644
--- a/test/jaxp/javax/xml/jaxp/functional/catalog/CatalogReferCircularityTest.java
+++ b/test/jaxp/javax/xml/jaxp/functional/catalog/CatalogReferCircularityTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2015, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2015, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,7 +23,6 @@
 
 package catalog;
 
-import org.junit.jupiter.api.Assertions;
 import org.junit.jupiter.params.ParameterizedTest;
 import org.junit.jupiter.params.provider.ValueSource;
 
@@ -31,6 +30,7 @@ import javax.xml.catalog.CatalogException;
 import javax.xml.catalog.CatalogResolver;
 
 import static catalog.CatalogTestUtils.catalogResolver;
+import static org.junit.jupiter.api.Assertions.assertThrows;
 
 /*
  * @test
@@ -55,7 +55,7 @@ public class CatalogReferCircularityTest {
             "catalogReferCircle-left.xml" })
     public void testReferCircularity(String catalogFile) {
         CatalogResolver resolver = catalogResolver(catalogFile);
-        Assertions.assertThrows(
+        assertThrows(
                 CatalogException.class,
                 () -> resolver.resolveEntity(null, "http://remote/dtd/ghost/docGhost.dtd"));
     }
diff --git a/test/jaxp/javax/xml/jaxp/functional/javax/xml/datatype/ptests/DurationTest.java b/test/jaxp/javax/xml/jaxp/functional/javax/xml/datatype/ptests/DurationTest.java
index cb8f5c56048..83839033b62 100644
--- a/test/jaxp/javax/xml/jaxp/functional/javax/xml/datatype/ptests/DurationTest.java
+++ b/test/jaxp/javax/xml/jaxp/functional/javax/xml/datatype/ptests/DurationTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1999, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1999, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,52 +23,50 @@
 
 package javax.xml.datatype.ptests;
 
-import static javax.xml.datatype.DatatypeConstants.DAYS;
-import static javax.xml.datatype.DatatypeConstants.HOURS;
-import static javax.xml.datatype.DatatypeConstants.MINUTES;
-import static javax.xml.datatype.DatatypeConstants.MONTHS;
-import static javax.xml.datatype.DatatypeConstants.SECONDS;
-import static javax.xml.datatype.DatatypeConstants.YEARS;
-import static org.testng.Assert.assertEquals;
-import static org.testng.Assert.assertFalse;
-import static org.testng.Assert.assertTrue;
-
-import java.math.BigDecimal;
-import java.math.BigInteger;
-import java.util.Calendar;
-import java.util.function.Function;
+import org.junit.jupiter.api.BeforeAll;
+import org.junit.jupiter.api.Test;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
+import org.junit.jupiter.params.provider.ValueSource;
 
 import javax.xml.datatype.DatatypeConfigurationException;
 import javax.xml.datatype.DatatypeConstants;
 import javax.xml.datatype.DatatypeFactory;
 import javax.xml.datatype.Duration;
 import javax.xml.namespace.QName;
+import java.math.BigDecimal;
+import java.math.BigInteger;
+import java.util.Calendar;
+import java.util.function.Function;
 
-import org.testng.Assert;
-import org.testng.annotations.BeforeClass;
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
+import static javax.xml.datatype.DatatypeConstants.DAYS;
+import static javax.xml.datatype.DatatypeConstants.HOURS;
+import static javax.xml.datatype.DatatypeConstants.MINUTES;
+import static javax.xml.datatype.DatatypeConstants.MONTHS;
+import static javax.xml.datatype.DatatypeConstants.SECONDS;
+import static javax.xml.datatype.DatatypeConstants.YEARS;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertFalse;
+import static org.junit.jupiter.api.Assertions.assertNotEquals;
+import static org.junit.jupiter.api.Assertions.assertThrows;
+import static org.junit.jupiter.api.Assertions.assertTrue;
 
 /*
  * @test
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm javax.xml.datatype.ptests.DurationTest
+ * @run junit/othervm javax.xml.datatype.ptests.DurationTest
  * @summary Class containing the test cases for Duration.
  */
 public class DurationTest {
 
-    private DatatypeFactory datatypeFactory;
+    private static DatatypeFactory datatypeFactory = null;
 
-    /*
-     * Setup.
-     */
-    @BeforeClass
-    public void setup() throws DatatypeConfigurationException {
+    @BeforeAll
+    public static void setup() throws DatatypeConfigurationException {
         datatypeFactory = DatatypeFactory.newInstance();
     }
 
-    @DataProvider(name = "legal-number-duration")
-    public Object[][] getLegalNumberDuration() {
+    public static Object[][] getLegalNumberDuration() {
         return new Object[][] {
                 // is positive, year, month, day, hour, minute, second
                 { true, 1, 1, 1, 1, 1, 1 },
@@ -82,13 +80,13 @@ public class DurationTest {
      * Test for constructor Duration(boolean isPositive,int years,int months,
      * int days,int hours,int minutes,int seconds).
      */
-    @Test(dataProvider = "legal-number-duration")
+    @ParameterizedTest
+    @MethodSource("getLegalNumberDuration")
     public void checkNumberDurationPos(boolean isPositive, int years, int months, int days, int hours, int minutes, int seconds) {
         datatypeFactory.newDuration(isPositive, years, months, days, hours, minutes, seconds);
     }
 
-    @DataProvider(name = "illegal-number-duration")
-    public Object[][] getIllegalNumberDuration() {
+    public static Object[][] getIllegalNumberDuration() {
         return new Object[][] {
                 // is positive, year, month, day, hour, minute, second
                 { true, 1, 1, -1, 1, 1, 1 },
@@ -103,13 +101,15 @@ public class DurationTest {
      * int days,int hours,int minutes,int seconds), if any of the fields is
      * negative should throw IllegalArgumentException.
      */
-    @Test(expectedExceptions = IllegalArgumentException.class, dataProvider = "illegal-number-duration")
+    @ParameterizedTest
+    @MethodSource("getIllegalNumberDuration")
     public void checkDurationNumberNeg(boolean isPositive, int years, int months, int days, int hours, int minutes, int seconds) {
-        datatypeFactory.newDuration(isPositive, years, months, days, hours, minutes, seconds);
+        assertThrows(
+                IllegalArgumentException.class,
+                () -> datatypeFactory.newDuration(isPositive, years, months, days, hours, minutes, seconds));
     }
 
-    @DataProvider(name = "legal-bigint-duration")
-    public Object[][] getLegalBigIntegerDuration() {
+    public static Object[][] getLegalBigIntegerDuration() {
         return new Object[][] {
                 // is positive, year, month, day, hour, minute, second
                 { true, zero, zero, zero, zero, zero, new BigDecimal(zero) },
@@ -125,14 +125,14 @@ public class DurationTest {
      * years,BigInteger months, BigInteger days,BigInteger hours,BigInteger
      * minutes,BigDecimal seconds).
      */
-    @Test(dataProvider = "legal-bigint-duration")
+    @ParameterizedTest
+    @MethodSource("getLegalBigIntegerDuration")
     public void checkBigIntegerDurationPos(boolean isPositive, BigInteger years, BigInteger months, BigInteger days, BigInteger hours, BigInteger minutes,
             BigDecimal seconds) {
         datatypeFactory.newDuration(isPositive, years, months, days, hours, minutes, seconds);
     }
 
-    @DataProvider(name = "illegal-bigint-duration")
-    public Object[][] getIllegalBigIntegerDuration() {
+    public static Object[][] getIllegalBigIntegerDuration() {
         return new Object[][] {
                 // is positive, year, month, day, hour, minute, second
                 { true, null, null, null, null, null, null },
@@ -146,79 +146,66 @@ public class DurationTest {
      * minutes,BigDecimal seconds), if all the fields are null should throw
      * IllegalArgumentException.
      */
-    @Test(expectedExceptions = IllegalArgumentException.class, dataProvider = "illegal-bigint-duration")
-    public void checkBigIntegerDurationNeg(boolean isPositive, BigInteger years, BigInteger months, BigInteger days, BigInteger hours, BigInteger minutes,
-            BigDecimal seconds) {
-        datatypeFactory.newDuration(isPositive, years, months, days, hours, minutes, seconds);
-    }
-
-    @DataProvider(name = "legal-millisec-duration")
-    public Object[][] getLegalMilliSecondDuration() {
-        return new Object[][] { { 1000000 }, { 0 }, { Long.MAX_VALUE }, { Long.MIN_VALUE }
-
-        };
+    @ParameterizedTest
+    @MethodSource("getIllegalBigIntegerDuration")
+    public void checkBigIntegerDurationNeg(
+            boolean isPositive, BigInteger years, BigInteger months, BigInteger days, BigInteger hours, BigInteger minutes, BigDecimal seconds) {
+        assertThrows(IllegalArgumentException.class, () -> datatypeFactory.newDuration(isPositive, years, months, days, hours, minutes, seconds));
     }
 
     /*
      * Test for constructor Duration(long durationInMilliSeconds)
      */
-    @Test(dataProvider = "legal-millisec-duration")
+    @ParameterizedTest
+    @ValueSource(longs={ 1000000, 0, Long.MAX_VALUE, Long.MIN_VALUE })
     public void checkMilliSecondDuration(long millisec) {
         datatypeFactory.newDuration(millisec);
     }
 
-    @DataProvider(name = "legal-lexical-duration")
-    public Object[][] getLegalLexicalDuration() {
-        return new Object[][] { { "P1Y1M1DT1H1M1S" }, { "-P1Y1M1DT1H1M1S" } };
-    }
-
     /*
      * Test for constructor Duration(java.lang.String lexicalRepresentation)
      */
-    @Test(dataProvider = "legal-lexical-duration")
+    @ParameterizedTest
+    @ValueSource(strings={ "P1Y1M1DT1H1M1S", "-P1Y1M1DT1H1M1S" })
     public void checkLexicalDurationPos(String lexRepresentation) {
         datatypeFactory.newDuration(lexRepresentation);
     }
 
-    @DataProvider(name = "illegal-lexical-duration")
-    public Object[][] getIllegalLexicalDuration() {
-        return new Object[][] {
-                { null },
-                { "P1Y1M1DT1H1M1S " },
-                { " P1Y1M1DT1H1M1S" },
-                { "X1Y1M1DT1H1M1S" },
-                { "" },
-                { "P1Y2MT" } // The designator 'T' shall be absent if all of the time items are absent in "PnYnMnDTnHnMnS"
-        };
+    /*
+     * Test for constructor Duration(java.lang.String lexicalRepresentation),
+     * null should throw NullPointerException
+     */
+    @Test
+    public void checkLexicalDurationNull() {
+        assertThrows(NullPointerException.class, () -> datatypeFactory.newDuration(null));
     }
 
     /*
      * Test for constructor Duration(java.lang.String lexicalRepresentation),
-     * null should throw NullPointerException, invalid lex should throw
-     * IllegalArgumentException
+     * invalid lex should throw IllegalArgumentException
      */
-    @Test(expectedExceptions = { NullPointerException.class, IllegalArgumentException.class }, dataProvider = "illegal-lexical-duration")
+    @ParameterizedTest
+    @ValueSource(strings={ "P1Y1M1DT1H1M1S ", " P1Y1M1DT1H1M1S", "X1Y1M1DT1H1M1S", "", "P1Y2MT" })
     public void checkLexicalDurationNeg(String lexRepresentation) {
-        datatypeFactory.newDuration(lexRepresentation);
+        assertThrows(IllegalArgumentException.class, () -> datatypeFactory.newDuration(lexRepresentation));
     }
 
-    @DataProvider(name = "equal-duration")
-    public Object[][] getEqualDurations() {
+    public static Object[][] getEqualDurations() {
         return new Object[][] { { "P1Y1M1DT1H1M1S", "P1Y1M1DT1H1M1S" } };
     }
 
     /*
      * Test for compare() both durations valid and equal.
      */
-    @Test(dataProvider = "equal-duration")
+    @ParameterizedTest
+    @MethodSource("getEqualDurations")
     public void checkDurationEqual(String lexRepresentation1, String lexRepresentation2) {
         Duration duration1 = datatypeFactory.newDuration(lexRepresentation1);
         Duration duration2 = datatypeFactory.newDuration(lexRepresentation2);
-        assertTrue(duration1.equals(duration2));
+        assertEquals(duration1, duration2);
     }
 
-    @DataProvider(name = "greater-duration")
-    public Object[][] getGreaterDuration() {
+    public static Object[][] getGreaterDuration() {
         return new Object[][] {
                 { "P1Y1M1DT1H1M2S", "P1Y1M1DT1H1M1S" },
                 { "P1Y1M1DT1H1M1S", "-P1Y1M1DT1H1M2S" },
@@ -229,15 +216,15 @@ public class DurationTest {
     /*
      * Test for compare() both durations valid and lhs > rhs.
      */
-    @Test(dataProvider = "greater-duration")
+    @ParameterizedTest
+    @MethodSource("getGreaterDuration")
     public void checkDurationCompare(String lexRepresentation1, String lexRepresentation2) {
         Duration duration1 = datatypeFactory.newDuration(lexRepresentation1);
         Duration duration2 = datatypeFactory.newDuration(lexRepresentation2);
-        assertTrue(duration1.compare(duration2) == DatatypeConstants.GREATER);
+        assertEquals(DatatypeConstants.GREATER, duration1.compare(duration2));
     }
 
-    @DataProvider(name = "not-equal-duration")
-    public Object[][] getNotEqualDurations() {
+    public static Object[][] getNotEqualDurations() {
         return new Object[][] {
                 { "P1Y1M1DT1H1M1S", "-P1Y1M1DT1H1M1S" },
                 { "P2Y1M1DT1H1M1S", "P1Y1M1DT1H1M1S" } };
@@ -246,15 +233,15 @@ public class DurationTest {
     /*
      * Test for equals() both durations valid and lhs not equals rhs.
      */
-    @Test(dataProvider = "not-equal-duration")
+    @ParameterizedTest
+    @MethodSource("getNotEqualDurations")
     public void checkDurationNotEqual(String lexRepresentation1, String lexRepresentation2) {
         Duration duration1 = datatypeFactory.newDuration(lexRepresentation1);
         Duration duration2 = datatypeFactory.newDuration(lexRepresentation2);
-        Assert.assertNotEquals(duration1, duration2);
+        assertNotEquals(duration1, duration2);
     }
 
-    @DataProvider(name = "duration-sign")
-    public Object[][] getDurationAndSign() {
+    public static Object[][] getDurationAndSign() {
         return new Object[][] {
                 { "P0Y0M0DT0H0M0S", 0 },
                 { "P1Y0M0DT0H0M0S", 1 },
@@ -264,10 +251,11 @@ public class DurationTest {
     /*
      * Test for Duration.getSign().
      */
-    @Test(dataProvider = "duration-sign")
-    public void checkDurationSign(String lexRepresentation, int sign) {
+    @ParameterizedTest
+    @MethodSource("getDurationAndSign")
+    public void checkDurationSign(String lexRepresentation, int expectedSign) {
         Duration duration = datatypeFactory.newDuration(lexRepresentation);
-        assertEquals(duration.getSign(), sign);
+        assertEquals(expectedSign, duration.getSign());
     }
 
     /*
@@ -278,10 +266,9 @@ public class DurationTest {
         Duration durationPos = datatypeFactory.newDuration("P1Y0M0DT0H0M0S");
         Duration durationNeg = datatypeFactory.newDuration("-P1Y0M0DT0H0M0S");
 
-        assertEquals(durationPos.negate(), durationNeg);
-        assertEquals(durationNeg.negate(), durationPos);
-        assertEquals(durationPos.negate().negate(), durationPos);
-
+        assertEquals(durationNeg, durationPos.negate());
+        assertEquals(durationPos, durationNeg.negate());
+        assertEquals(durationPos, durationPos.negate().negate());
     }
 
     /*
@@ -342,24 +329,22 @@ public class DurationTest {
     /*
      * Test Duration.isSet(Field) throws NPE if the field parameter is null.
      */
-    @Test(expectedExceptions = NullPointerException.class)
     public void checkDurationIsSetNeg() {
         Duration duration = datatypeFactory.newDuration(true, 0, 0, 0, 0, 0, 0);
-        duration.isSet(null);
+        assertThrows(NullPointerException.class, () -> duration.isSet(null));
     }
 
     /*
      * Test for -getField(DatatypeConstants.Field) DatatypeConstants.Field is
      * null - throws NPE.
      */
-    @Test(expectedExceptions = NullPointerException.class)
+    @Test
     public void checkDurationGetFieldNeg() {
-        Duration duration67 = datatypeFactory.newDuration("P1Y1M1DT1H1M1S");
-        duration67.getField(null);
+        Duration duration = datatypeFactory.newDuration("P1Y1M1DT1H1M1S");
+        assertThrows(NullPointerException.class, () -> duration.getField(null));
     }
 
-    @DataProvider(name = "duration-fields")
-    public Object[][] getDurationAndFields() {
+    public static Object[][] getDurationAndFields() {
         return new Object[][] {
                 { "P1Y1M1DT1H1M1S", one, one, one, one, one, new BigDecimal(one) },
                 { "PT1M", null, null, null, null, one, null },
@@ -369,21 +354,21 @@ public class DurationTest {
     /*
      * Test for Duration.getField(DatatypeConstants.Field).
      */
-    @Test(dataProvider = "duration-fields")
+    @ParameterizedTest
+    @MethodSource("getDurationAndFields")
     public void checkDurationGetField(String lexRepresentation, BigInteger years, BigInteger months, BigInteger days, BigInteger hours, BigInteger minutes,
             BigDecimal seconds) {
         Duration duration = datatypeFactory.newDuration(lexRepresentation);
 
-        assertEquals(duration.getField(YEARS), years);
-        assertEquals(duration.getField(MONTHS), months);
-        assertEquals(duration.getField(DAYS), days);
-        assertEquals(duration.getField(HOURS), hours);
-        assertEquals(duration.getField(MINUTES), minutes);
-        assertEquals(duration.getField(SECONDS), seconds);
+        assertEquals(years, duration.getField(YEARS));
+        assertEquals(months, duration.getField(MONTHS));
+        assertEquals(days, duration.getField(DAYS));
+        assertEquals(hours, duration.getField(HOURS));
+        assertEquals(minutes, duration.getField(MINUTES));
+        assertEquals(seconds, duration.getField(SECONDS));
     }
 
-    @DataProvider(name = "number-string")
-    public Object[][] getNumberAndString() {
+    public static Object[][] getNumberAndString() {
         return new Object[][] {
                 // is positive, year, month, day, hour, minute, second, lexical
                 { true, 1, 1, 1, 1, 1, 1, "P1Y1M1DT1H1M1S" },
@@ -396,22 +381,22 @@ public class DurationTest {
     /*
      * Test for - toString().
      */
-    @Test(dataProvider = "number-string")
+    @ParameterizedTest
+    @MethodSource("getNumberAndString")
     public void checkDurationToString(boolean isPositive, int years, int months, int days, int hours, int minutes, int seconds, String lexical) {
-        Duration duration = datatypeFactory.newDuration(isPositive,  years,  months,  days,  hours,  minutes,  seconds);
-        assertEquals(duration.toString(), lexical);
+        Duration duration = datatypeFactory.newDuration(isPositive, years, months, days, hours, minutes, seconds);
+        assertEquals(lexical, duration.toString());
 
-        assertEquals(datatypeFactory.newDuration(duration.toString()), duration);
+        assertEquals(duration, datatypeFactory.newDuration(duration.toString()));
     }
 
-    @DataProvider(name = "duration-field")
-    public Object[][] getDurationAndField() {
-        Function<Duration, Integer> getyears = duration -> duration.getYears();
-        Function<Duration, Integer> getmonths = duration -> duration.getMonths();
-        Function<Duration, Integer> getdays = duration -> duration.getDays();
-        Function<Duration, Integer> gethours = duration -> duration.getHours();
-        Function<Duration, Integer> getminutes = duration -> duration.getMinutes();
-        Function<Duration, Integer> getseconds = duration -> duration.getSeconds();
+    public static Object[][] getDurationAndField() {
+        Function<Duration, Integer> getyears = Duration::getYears;
+        Function<Duration, Integer> getmonths = Duration::getMonths;
+        Function<Duration, Integer> getdays = Duration::getDays;
+        Function<Duration, Integer> gethours = Duration::getHours;
+        Function<Duration, Integer> getminutes = Duration::getMinutes;
+        Function<Duration, Integer> getseconds = Duration::getSeconds;
         return new Object[][] {
                 { "P1Y1M1DT1H1M1S", getyears, 1 },
                 { "P1M1DT1H1M1S", getyears, 0 },
@@ -431,10 +416,11 @@ public class DurationTest {
     /*
      * Test for Duration.getYears(), getMonths(), etc.
      */
-    @Test(dataProvider = "duration-field")
-    public void checkDurationGetOneField(String lexRepresentation, Function<Duration, Integer> getter, int value) {
+    @ParameterizedTest
+    @MethodSource("getDurationAndField")
+    public void checkDurationGetOneField(String lexRepresentation, Function<Duration, Integer> getter, int expectedValue) {
         Duration duration = datatypeFactory.newDuration(lexRepresentation);
-        assertEquals(getter.apply(duration).intValue(), value);
+        assertEquals(expectedValue, getter.apply(duration).intValue());
     }
 
     /*
@@ -443,7 +429,7 @@ public class DurationTest {
     @Test
     public void checkDurationGetSecondsField() {
         Duration duration85 = datatypeFactory.newDuration("P1Y1M1DT1H1M100000000S");
-        assertEquals((duration85.getField(SECONDS)).intValue(), 100000000);
+        assertEquals(100000000, (duration85.getField(SECONDS)).intValue());
     }
 
     /*
@@ -452,9 +438,9 @@ public class DurationTest {
      */
     @Test
     public void checkDurationGetTimeInMillis() {
-        Duration duration86 = datatypeFactory.newDuration("PT1M1S");
-        Calendar calendar86 = Calendar.getInstance();
-        assertEquals(duration86.getTimeInMillis(calendar86), 61000);
+        Duration duration = datatypeFactory.newDuration("PT1M1S");
+        Calendar calendar = Calendar.getInstance();
+        assertEquals(61000, duration.getTimeInMillis(calendar));
     }
 
     /*
@@ -462,15 +448,13 @@ public class DurationTest {
      * between startInstant and startInstant plus this Duration throws NPE if
      * startInstant parameter is null.
      */
-    @Test(expectedExceptions = NullPointerException.class)
+    @Test
     public void checkDurationGetTimeInMillisNeg() {
-        Duration duration87 = datatypeFactory.newDuration("PT1M1S");
-        Calendar calendar87 = null;
-        duration87.getTimeInMillis(calendar87);
+        Duration duration = datatypeFactory.newDuration("PT1M1S");
+        assertThrows(NullPointerException.class, () -> duration.getTimeInMillis((Calendar) null));
     }
 
-    @DataProvider(name = "duration-for-hash")
-    public Object[][] getDurationsForHash() {
+    public static Object[][] getDurationsForHash() {
         return new Object[][] {
                 { "P1Y1M1DT1H1M1S", "P1Y1M1DT1H1M1S" },
                 { "P1D", "PT24H" },
@@ -483,17 +467,17 @@ public class DurationTest {
      * Test for Duration.hashcode(). hashcode() should return same value for
      * some equal durations.
      */
-    @Test(dataProvider = "duration-for-hash")
+    @ParameterizedTest
+    @MethodSource("getDurationsForHash")
     public void checkDurationHashCode(String lexRepresentation1, String lexRepresentation2) {
         Duration duration1 = datatypeFactory.newDuration(lexRepresentation1);
         Duration duration2 = datatypeFactory.newDuration(lexRepresentation2);
         int hash1 = duration1.hashCode();
         int hash2 = duration2.hashCode();
-        assertTrue(hash1 == hash2, " generated hash1 : " + hash1 + " generated hash2 : " + hash2);
+        assertEquals(hash1, hash2, " generated hash1 : " + hash1 + " generated hash2 : " + hash2);
     }
 
-    @DataProvider(name = "duration-for-add")
-    public Object[][] getDurationsForAdd() {
+    public static Object[][] getDurationsForAdd() {
         return new Object[][] {
                 // initVal, addVal, resultVal
                 { "P1Y1M1DT1H1M1S", "P1Y1M1DT1H1M1S", "P2Y2M2DT2H2M2S" },
@@ -504,7 +488,8 @@ public class DurationTest {
     /*
      * Test for add(Duration rhs).
      */
-    @Test(dataProvider = "duration-for-add")
+    @ParameterizedTest
+    @MethodSource("getDurationsForAdd")
     public void checkDurationAdd(String initVal, String addVal, String result) {
         Duration durationInit = datatypeFactory.newDuration(initVal);
         Duration durationAdd = datatypeFactory.newDuration(addVal);
@@ -513,25 +498,32 @@ public class DurationTest {
         assertEquals(durationInit.add(durationAdd), durationResult);
     }
 
-    @DataProvider(name = "duration-for-addneg")
-    public Object[][] getDurationsForAddNeg() {
+    public static Object[][] getDurationsForAddNeg() {
         return new Object[][] {
                 // initVal, addVal
-                { "P1Y1M1DT1H1M1S", null },
                 { "P1Y", "-P1D" },
                 { "-P1Y", "P1D" }, };
     }
 
     /*
-     * Test for add(Duration rhs) 'rhs' is null , should throw NPE. "1 year" +
-     * "-1 day" or "-1 year" + "1 day" should throw IllegalStateException
+     * Test for add(Duration rhs).
+     * "1 year" + "-1 day" or "-1 year" + "1 day" should throw IllegalStateException
      */
-    @Test(expectedExceptions = { NullPointerException.class, IllegalStateException.class }, dataProvider = "duration-for-addneg")
+    @ParameterizedTest
+    @MethodSource("getDurationsForAddNeg")
     public void checkDurationAddNeg(String initVal, String addVal) {
         Duration durationInit = datatypeFactory.newDuration(initVal);
         Duration durationAdd = addVal == null ? null : datatypeFactory.newDuration(addVal);
+        assertThrows(IllegalStateException.class, () -> durationInit.add(durationAdd));
+    }
 
-        durationInit.add(durationAdd);
+    /*
+     * Test for add(Duration rhs) 'rhs' is null , should throw NPE.
+     */
+    @Test
+    public void checkDurationAddNull() {
+        Duration durationInit = datatypeFactory.newDuration("P1Y1M1DT1H1M1S");
+        assertThrows(NullPointerException.class, () -> durationInit.add(null));
     }
 
     /*
@@ -540,15 +532,14 @@ public class DurationTest {
      * Bug # 4972785 UnsupportedOperationException is expected
      *
      */
-    @Test(expectedExceptions = UnsupportedOperationException.class)
+    @Test
     public void checkDurationCompareLarge() {
         String duration1Lex = "P100000000000000000000D";
         String duration2Lex = "PT2400000000000000000000H";
 
         Duration duration1 = datatypeFactory.newDuration(duration1Lex);
         Duration duration2 = datatypeFactory.newDuration(duration2Lex);
-        duration1.compare(duration2);
-
+        assertThrows(UnsupportedOperationException.class, () -> duration1.compare(duration2));
     }
 
     /*
@@ -562,25 +553,24 @@ public class DurationTest {
         // DURATION
         Duration duration = datatypeFactory.newDuration("P1Y1M1DT1H1M1S");
         QName duration_xmlSchemaType = duration.getXMLSchemaType();
-        assertEquals(duration_xmlSchemaType, DatatypeConstants.DURATION, "Expected DatatypeConstants.DURATION, returned " + duration_xmlSchemaType.toString());
+        assertEquals(DatatypeConstants.DURATION, duration_xmlSchemaType, "Expected DatatypeConstants.DURATION, returned " + duration_xmlSchemaType.toString());
 
         // DURATION_DAYTIME
         Duration duration_dayTime = datatypeFactory.newDuration("P1DT1H1M1S");
         QName duration_dayTime_xmlSchemaType = duration_dayTime.getXMLSchemaType();
-        assertEquals(duration_dayTime_xmlSchemaType, DatatypeConstants.DURATION_DAYTIME, "Expected DatatypeConstants.DURATION_DAYTIME, returned "
+        assertEquals(DatatypeConstants.DURATION_DAYTIME, duration_dayTime_xmlSchemaType, "Expected DatatypeConstants.DURATION_DAYTIME, returned "
                 + duration_dayTime_xmlSchemaType.toString());
 
         // DURATION_YEARMONTH
         Duration duration_yearMonth = datatypeFactory.newDuration("P1Y1M");
         QName duration_yearMonth_xmlSchemaType = duration_yearMonth.getXMLSchemaType();
-        assertEquals(duration_yearMonth_xmlSchemaType, DatatypeConstants.DURATION_YEARMONTH, "Expected DatatypeConstants.DURATION_YEARMONTH, returned "
+        assertEquals(DatatypeConstants.DURATION_YEARMONTH, duration_yearMonth_xmlSchemaType, "Expected DatatypeConstants.DURATION_YEARMONTH, returned "
                 + duration_yearMonth_xmlSchemaType.toString());
 
     }
 
 
-    private final int undef = DatatypeConstants.FIELD_UNDEFINED;
-    private final BigInteger zero = BigInteger.ZERO;
-    private final BigInteger one = BigInteger.ONE;
-
+    private final static int undef = DatatypeConstants.FIELD_UNDEFINED;
+    private final static BigInteger zero = BigInteger.ZERO;
+    private final static BigInteger one = BigInteger.ONE;
 }
diff --git a/test/jaxp/javax/xml/jaxp/functional/javax/xml/datatype/ptests/FactoryNewInstanceTest.java b/test/jaxp/javax/xml/jaxp/functional/javax/xml/datatype/ptests/FactoryNewInstanceTest.java
index 7b75562bd87..642dfad6810 100644
--- a/test/jaxp/javax/xml/jaxp/functional/javax/xml/datatype/ptests/FactoryNewInstanceTest.java
+++ b/test/jaxp/javax/xml/jaxp/functional/javax/xml/datatype/ptests/FactoryNewInstanceTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1999, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1999, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,25 +23,27 @@
 
 package javax.xml.datatype.ptests;
 
-import static org.testng.Assert.assertNotNull;
-import static org.testng.Assert.assertNotSame;
-import static org.testng.Assert.assertSame;
-import static org.testng.Assert.assertEquals;
+import jaxp.library.JAXPDataProvider;
+import org.junit.jupiter.api.Test;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
 
 import javax.xml.datatype.DatatypeConfigurationException;
 import javax.xml.datatype.DatatypeFactory;
 import javax.xml.datatype.Duration;
 
-import jaxp.library.JAXPDataProvider;
-
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertNotNull;
+import static org.junit.jupiter.api.Assertions.assertNotSame;
+import static org.junit.jupiter.api.Assertions.assertSame;
+import static org.junit.jupiter.api.Assertions.assertThrows;
 
 /*
  * @test
  * @bug 8169778
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm javax.xml.datatype.ptests.FactoryNewInstanceTest
+ * @build jaxp.library.JAXPDataProvider
+ * @run junit/othervm javax.xml.datatype.ptests.FactoryNewInstanceTest
  * @summary Tests for DatatypeFactory.newInstance(factoryClassName , classLoader)
  */
 public class FactoryNewInstanceTest {
@@ -50,9 +52,11 @@ public class FactoryNewInstanceTest {
         "com.sun.org.apache.xerces.internal.jaxp.datatype.DatatypeFactoryImpl";
     private static final String DATATYPE_FACTORY_CLASSNAME = DEFAULT_IMPL_CLASS;
 
-    @DataProvider(name = "parameters")
-    public Object[][] getValidateParameters() {
-        return new Object[][] { { DATATYPE_FACTORY_CLASSNAME, null }, { DATATYPE_FACTORY_CLASSNAME, this.getClass().getClassLoader() } };
+    public static Object[][] getValidateParameters() {
+        return new Object[][] {
+                { DATATYPE_FACTORY_CLASSNAME, null },
+                { DATATYPE_FACTORY_CLASSNAME, FactoryNewInstanceTest.class.getClassLoader() },
+        };
     }
 
     /**
@@ -66,8 +70,8 @@ public class FactoryNewInstanceTest {
         DatatypeFactory dtf2 = DatatypeFactory.newInstance();
         assertNotSame(dtf1, dtf2, "same instance returned:");
         assertSame(dtf1.getClass(), dtf2.getClass(),
-                  "unexpected class mismatch for newDefaultInstance():");
-        assertEquals(dtf1.getClass().getName(), DEFAULT_IMPL_CLASS);
+                "unexpected class mismatch for newDefaultInstance():");
+        assertEquals(DEFAULT_IMPL_CLASS, dtf1.getClass().getName());
     }
 
     /*
@@ -76,7 +80,8 @@ public class FactoryNewInstanceTest {
      * implementation of javax.xml.datatype.DatatypeFactory , should return
      * newInstance of DatatypeFactory
      */
-    @Test(dataProvider = "parameters")
+    @ParameterizedTest
+    @MethodSource("getValidateParameters")
     public void testNewInstance(String factoryClassName, ClassLoader classLoader) throws DatatypeConfigurationException {
         DatatypeFactory dtf = DatatypeFactory.newInstance(DATATYPE_FACTORY_CLASSNAME, null);
         Duration duration = dtf.newDuration(true, 1, 1, 1, 1, 1, 1);
@@ -89,9 +94,11 @@ public class FactoryNewInstanceTest {
      * java.lang.ClassLoader classLoader) factoryClassName is null , should
      * throw DatatypeConfigurationException
      */
-    @Test(expectedExceptions = DatatypeConfigurationException.class, dataProvider = "new-instance-neg", dataProviderClass = JAXPDataProvider.class)
+    @ParameterizedTest
+    @MethodSource("jaxp.library.JAXPDataProvider#newInstanceNeg")
     public void testNewInstanceNeg(String factoryClassName, ClassLoader classLoader) throws DatatypeConfigurationException {
-        DatatypeFactory.newInstance(factoryClassName, classLoader);
+        assertThrows(
+                DatatypeConfigurationException.class,
+                () -> DatatypeFactory.newInstance(factoryClassName, classLoader));
     }
-
 }
diff --git a/test/jaxp/javax/xml/jaxp/functional/javax/xml/datatype/ptests/XMLGregorianCalendarTest.java b/test/jaxp/javax/xml/jaxp/functional/javax/xml/datatype/ptests/XMLGregorianCalendarTest.java
index d9df1a2cddd..8365f2f3ad5 100644
--- a/test/jaxp/javax/xml/jaxp/functional/javax/xml/datatype/ptests/XMLGregorianCalendarTest.java
+++ b/test/jaxp/javax/xml/jaxp/functional/javax/xml/datatype/ptests/XMLGregorianCalendarTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1999, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1999, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,56 +23,54 @@
 
 package javax.xml.datatype.ptests;
 
-import static java.util.Calendar.HOUR;
-import static java.util.Calendar.MINUTE;
-import static java.util.Calendar.YEAR;
-import static org.testng.Assert.assertEquals;
-import static org.testng.Assert.assertTrue;
-
-import java.util.GregorianCalendar;
-import java.util.Locale;
-import java.util.TimeZone;
+import org.junit.jupiter.api.BeforeEach;
+import org.junit.jupiter.api.Test;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
+import org.junit.jupiter.params.provider.ValueSource;
 
 import javax.xml.datatype.DatatypeConfigurationException;
 import javax.xml.datatype.DatatypeConstants;
 import javax.xml.datatype.DatatypeFactory;
 import javax.xml.datatype.Duration;
 import javax.xml.datatype.XMLGregorianCalendar;
+import java.util.GregorianCalendar;
+import java.util.Locale;
+import java.util.TimeZone;
 
-import org.testng.Assert;
-import org.testng.annotations.BeforeClass;
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
+import static java.util.Calendar.HOUR;
+import static java.util.Calendar.MINUTE;
+import static java.util.Calendar.YEAR;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertFalse;
+import static org.junit.jupiter.api.Assertions.assertNotNull;
+import static org.junit.jupiter.api.Assertions.assertThrows;
+import static org.junit.jupiter.api.Assertions.assertTrue;
 
 /*
  * @test
  * @bug 5049592 5041845 5048932 5064587 5040542 5049531 5049528
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm javax.xml.datatype.ptests.XMLGregorianCalendarTest
+ * @run junit/othervm javax.xml.datatype.ptests.XMLGregorianCalendarTest
  * @summary Class containing the test cases for XMLGregorianCalendar
  */
 public class XMLGregorianCalendarTest {
 
     private DatatypeFactory datatypeFactory;
 
-    @BeforeClass
+    @BeforeEach
     public void setup() throws DatatypeConfigurationException {
         datatypeFactory = DatatypeFactory.newInstance();
     }
 
-    @DataProvider(name = "valid-milliseconds")
-    public Object[][] getValidMilliSeconds() {
-        return new Object[][] { { 0 }, { 1 }, { 2 }, { 16 }, { 1000 }   };
-    }
-
     /*
      * Test DatatypeFactory.newXMLGregorianCalendar(..) with milliseconds > 1.
      *
      * Bug # 5049592
-     *
      */
-    @Test(dataProvider = "valid-milliseconds")
-    public void checkNewCalendar(int ms) {
+    @ParameterizedTest
+    @ValueSource(ints={ 0, 1, 2, 16, 1000 })
+    public void checkNewCalendar(int expectedMillis) {
         // valid milliseconds
         XMLGregorianCalendar calendar = datatypeFactory.newXMLGregorianCalendar(2004, // year
                 6, // month
@@ -80,12 +78,12 @@ public class XMLGregorianCalendarTest {
                 19, // hour
                 20, // minute
                 59, // second
-                ms, // milliseconds
+                expectedMillis, // milliseconds
                 840 // timezone
                 );
         // expected success
 
-        assertEquals(calendar.getMillisecond(), ms);
+        assertEquals(expectedMillis, calendar.getMillisecond());
     }
 
     /*
@@ -93,23 +91,19 @@ public class XMLGregorianCalendarTest {
      *
      * Bug # 5049592
      */
-    @Test(dataProvider = "valid-milliseconds")
-    public void checkNewTime(int ms) {
+    @ParameterizedTest
+    @ValueSource(ints={ 0, 1, 2, 16, 1000 })
+    public void checkNewTime(int expectedMillis) {
         // valid milliseconds
         XMLGregorianCalendar calendar2 = datatypeFactory.newXMLGregorianCalendarTime(19, // hour
                 20, // minute
                 59, // second
-                ms, // milliseconds
+                expectedMillis, // milliseconds
                 840 // timezone
                 );
         // expected success
 
-        assertEquals(calendar2.getMillisecond(), ms);
-    }
-
-    @DataProvider(name = "invalid-milliseconds")
-    public Object[][] getInvalidMilliSeconds() {
-        return new Object[][] { { -1 }, { 1001 } };
+        assertEquals(expectedMillis, calendar2.getMillisecond());
     }
 
     /*
@@ -119,18 +113,21 @@ public class XMLGregorianCalendarTest {
      * 1001.
      *
      */
-    @Test(expectedExceptions = IllegalArgumentException.class, dataProvider = "invalid-milliseconds")
-    public void checkNewCalendarNeg(int milliseconds) {
+    @ParameterizedTest
+    @ValueSource(ints={ -1, 1001 })
+    public void checkNewCalendarNeg(int invalidMilliseconds) {
         // invalid milliseconds
-        datatypeFactory.newXMLGregorianCalendar(2004, // year
-                6, // month
-                2, // day
-                19, // hour
-                20, // minute
-                59, // second
-                milliseconds, // milliseconds
-                840 // timezone
-                );
+        assertThrows(
+                IllegalArgumentException.class,
+                () -> datatypeFactory.newXMLGregorianCalendar(2004, // year
+                        6, // month
+                        2, // day
+                        19, // hour
+                        20, // minute
+                        59, // second
+                        invalidMilliseconds, // milliseconds
+                        840 // timezone
+                ));
     }
 
     /*
@@ -140,19 +137,21 @@ public class XMLGregorianCalendarTest {
      * 1001.
      *
      */
-    @Test(expectedExceptions = IllegalArgumentException.class, dataProvider = "invalid-milliseconds")
-    public void checkNewTimeNeg(int milliseconds) {
+    @ParameterizedTest
+    @ValueSource(ints={ -1, 1001 })
+    public void checkNewTimeNeg(int invalidMilliseconds) {
         // invalid milliseconds
-        datatypeFactory.newXMLGregorianCalendarTime(19, // hour
-                20, // minute
-                59, // second
-                milliseconds, // milliseconds
-                840 // timezone
-                );
+        assertThrows(
+                IllegalArgumentException.class,
+                () -> datatypeFactory.newXMLGregorianCalendarTime(19, // hour
+                        20, // minute
+                        59, // second
+                        invalidMilliseconds, // milliseconds
+                        840 // timezone
+                ));
     }
 
-    @DataProvider(name = "data-for-add")
-    public Object[][] getDataForAdd() {
+    public static Object[][] getDataForAdd() {
         return new Object[][] {
                 //calendar1, calendar2, duration
                 { "1999-12-31T00:00:00Z", "2000-01-01T00:00:00Z", "P1D" },
@@ -173,7 +172,8 @@ public class XMLGregorianCalendarTest {
      * Test XMLGregorianCalendar.add(Duration).
      *
      */
-    @Test(dataProvider = "data-for-add")
+    @ParameterizedTest
+    @MethodSource("getDataForAdd")
     public void checkAddDays(String cal1, String cal2, String dur) {
 
         XMLGregorianCalendar calendar1 = datatypeFactory.newXMLGregorianCalendar(cal1);
@@ -184,70 +184,51 @@ public class XMLGregorianCalendarTest {
         XMLGregorianCalendar calendar1Clone = (XMLGregorianCalendar)calendar1.clone();
 
         calendar1Clone.add(duration);
-        assertEquals(calendar1Clone, calendar2);
+        assertEquals(calendar2, calendar1Clone);
 
         calendar2.add(duration.negate());
-        assertEquals(calendar2, calendar1);
+        assertEquals(calendar1, calendar2);
 
     }
 
-    @DataProvider(name = "gMonth")
-    public Object[][] getGMonth() {
-        return new Object[][] {
-                { "2000-02" },
-                { "2000-03" },
-                { "2018-02" }};
-    }
     /*
      * Test XMLGregorianCalendar#isValid(). for gMonth
      *
      * Bug # 5041845
-     *
      */
-    @Test(dataProvider = "gMonth")
+    @ParameterizedTest
+    @ValueSource(strings={ "2000-02", "2000-03", "2018-02" })
     public void checkIsValid(String month) {
-
         XMLGregorianCalendar gMonth = datatypeFactory.newXMLGregorianCalendar(month);
         gMonth.setYear(null);
-        Assert.assertTrue(gMonth.isValid(), gMonth.toString() + " should isValid");
-
-    }
-
-    @DataProvider(name = "lexical01")
-    public Object[][] getLexicalRepresentForNormalize01() {
-        return new Object[][] { { "2000-01-16T12:00:00Z" }, { "2000-01-16T12:00:00" } };
+        assertTrue(gMonth.isValid(), gMonth + " should isValid");
     }
 
     /*
      * Test XMLGregorianCalendar#normalize(...).
      *
      * Bug # 5048932 XMLGregorianCalendar.normalize works
-     *
      */
-    @Test(dataProvider = "lexical01")
+    @ParameterizedTest
+    @ValueSource(strings={ "2000-01-16T12:00:00Z", "2000-01-16T12:00:00" })
     public void checkNormalize01(String lexical) {
         XMLGregorianCalendar lhs = datatypeFactory.newXMLGregorianCalendar(lexical);
         lhs.normalize();
     }
 
-    @DataProvider(name = "lexical02")
-    public Object[][] getLexicalRepresentForNormalize02() {
-        return new Object[][] { { "2000-01-16T00:00:00.01Z" }, { "2000-01-16T00:00:00.01" }, { "13:20:00" } };
-    }
-
     /*
      * Test XMLGregorianCalendar#normalize(...).
      *
      * Bug # 5064587 XMLGregorianCalendar.normalize shall not change timezone
-     *
      */
-    @Test(dataProvider = "lexical02")
+    @ParameterizedTest
+    @ValueSource(strings={ "2000-01-16T00:00:00.01Z", "2000-01-16T00:00:00.01", "13:20:00" })
     public void checkNormalize02(String lexical) {
         XMLGregorianCalendar orig = datatypeFactory.newXMLGregorianCalendar(lexical);
         XMLGregorianCalendar normalized = datatypeFactory.newXMLGregorianCalendar(lexical).normalize();
 
-        assertEquals(normalized.getTimezone(), orig.getTimezone());
-        assertEquals(normalized.getMillisecond(), orig.getMillisecond());
+        assertEquals(orig.getTimezone(), normalized.getTimezone());
+        assertEquals(orig.getMillisecond(), normalized.getMillisecond());
     }
 
     /*
@@ -291,8 +272,6 @@ public class XMLGregorianCalendarTest {
         int hour = calendar.get(HOUR);
 
         assertTrue((year == 2003 && hour == 2 && minute == 3), " expecting year == 2003, hour == 2, minute == 3" + ", result is year == " + year + ", hour == " + hour + ", minute == " + minute);
-
-
     }
 
     /*
@@ -311,8 +290,7 @@ public class XMLGregorianCalendarTest {
         calendar.toGregorianCalendar(TimeZone.getDefault(), Locale.getDefault(), null);
     }
 
-    @DataProvider(name = "calendar")
-    public Object[][] getXMLGregorianCalendarData() {
+    public static Object[][] getXMLGregorianCalendarData() {
         return new Object[][] {
                 // year, month, day, hour, minute, second
                 { 1970, 1, 1, 0, 0, 0 }, // DATETIME
@@ -332,10 +310,12 @@ public class XMLGregorianCalendarTest {
      * Bug # 5049528
      *
      */
-    @Test(dataProvider = "calendar")
+    @ParameterizedTest
+    @MethodSource("getXMLGregorianCalendarData")
     public void checkToStringPos(final int year, final int month, final int day, final int hour, final int minute, final int second) {
         XMLGregorianCalendar calendar = datatypeFactory.newXMLGregorianCalendar(year, month, day, hour, minute, second, undef, undef);
-        calendar.toString();
+        assertNotNull(calendar.toString());
+        assertFalse(calendar.toString().isEmpty());
     }
 
     /*
@@ -345,13 +325,13 @@ public class XMLGregorianCalendarTest {
      * if all parameters are undef
      *
      */
-    @Test(expectedExceptions = IllegalStateException.class)
+    @Test
     public void checkToStringNeg() {
         XMLGregorianCalendar calendar = datatypeFactory.newXMLGregorianCalendar(undef, undef, undef, undef, undef, undef, undef, undef);
         // expected to fail
-        calendar.toString();
+        assertThrows(IllegalStateException.class, calendar::toString);
     }
 
-    private final int undef = DatatypeConstants.FIELD_UNDEFINED;
+    private static final int undef = DatatypeConstants.FIELD_UNDEFINED;
 
 }
diff --git a/test/jaxp/javax/xml/jaxp/functional/javax/xml/parsers/ptests/DBFNamespaceTest.java b/test/jaxp/javax/xml/jaxp/functional/javax/xml/parsers/ptests/DBFNamespaceTest.java
index 8bf88ff09fc..6cf6e925a36 100644
--- a/test/jaxp/javax/xml/jaxp/functional/javax/xml/parsers/ptests/DBFNamespaceTest.java
+++ b/test/jaxp/javax/xml/jaxp/functional/javax/xml/parsers/ptests/DBFNamespaceTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1999, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1999, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,22 +23,21 @@
 
 package javax.xml.parsers.ptests;
 
-import static javax.xml.parsers.ptests.ParserTestConst.GOLDEN_DIR;
-import static javax.xml.parsers.ptests.ParserTestConst.XML_DIR;
-import static jaxp.library.JAXPTestUtilities.USER_DIR;
-import static jaxp.library.JAXPTestUtilities.compareWithGold;
-import static org.testng.Assert.assertTrue;
-
-import java.io.File;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
+import org.w3c.dom.Document;
 
 import javax.xml.parsers.DocumentBuilderFactory;
 import javax.xml.transform.TransformerFactory;
 import javax.xml.transform.dom.DOMSource;
 import javax.xml.transform.sax.SAXResult;
+import java.io.File;
+import java.nio.file.Files;
+import java.nio.file.Path;
 
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
-import org.w3c.dom.Document;
+import static javax.xml.parsers.ptests.ParserTestConst.GOLDEN_DIR;
+import static javax.xml.parsers.ptests.ParserTestConst.XML_DIR;
+import static org.junit.jupiter.api.Assertions.assertLinesMatch;
 
 /**
  * This tests DocumentBuilderFactory for namespace processing and no-namespace
@@ -47,7 +46,7 @@ import org.w3c.dom.Document;
 /*
  * @test
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm javax.xml.parsers.ptests.DBFNamespaceTest
+ * @run junit/othervm javax.xml.parsers.ptests.DBFNamespaceTest
  */
 public class DBFNamespaceTest {
 
@@ -56,15 +55,14 @@ public class DBFNamespaceTest {
      * @return a two-dimensional array contains factory, output file name and
      *         golden validate file name.
      */
-    @DataProvider(name = "input-provider")
-    public Object[][] getInput() {
+    public static Object[][] getInput() {
         DocumentBuilderFactory dbf1 = DocumentBuilderFactory.newInstance();
-        String outputfile1 = USER_DIR + "dbfnstest01.out";
+        String outputfile1 = "dbfnstest01.out";
         String goldfile1 = GOLDEN_DIR + "dbfnstest01GF.out";
 
         DocumentBuilderFactory dbf2 = DocumentBuilderFactory.newInstance();
         dbf2.setNamespaceAware(true);
-        String outputfile2 = USER_DIR + "dbfnstest02.out";
+        String outputfile2 = "dbfnstest02.out";
         String goldfile2 = GOLDEN_DIR + "dbfnstest02GF.out";
         return new Object[][] { { dbf1, outputfile1, goldfile1 }, { dbf2, outputfile2, goldfile2 } };
     }
@@ -77,12 +75,15 @@ public class DBFNamespaceTest {
      * @param goldfile golden validate file name.
      * @throws Exception If any errors occur.
      */
-    @Test(dataProvider = "input-provider")
+    @ParameterizedTest
+    @MethodSource("getInput")
     public void testNamespaceTest(DocumentBuilderFactory dbf, String outputfile,
             String goldfile) throws Exception {
         Document doc = dbf.newDocumentBuilder().parse(new File(XML_DIR, "namespace1.xml"));
         dummyTransform(doc, outputfile);
-        assertTrue(compareWithGold(goldfile, outputfile));
+        assertLinesMatch(
+                Files.readAllLines(Path.of(goldfile)),
+                Files.readAllLines(Path.of(outputfile)));
     }
 
     /**
@@ -90,8 +91,6 @@ public class DBFNamespaceTest {
      * invoke the callbacks through a ContentHandler. If namespace processing is
      * not chosen, namespaceURI in callbacks should be an empty string otherwise
      * it should be namespaceURI.
-     *
-     * @throws Exception If any errors occur.
      */
     private void dummyTransform(Document document, String fileName)
             throws Exception {
diff --git a/test/jaxp/javax/xml/jaxp/functional/javax/xml/parsers/ptests/DocumentBuilderFactoryTest.java b/test/jaxp/javax/xml/jaxp/functional/javax/xml/parsers/ptests/DocumentBuilderFactoryTest.java
index f21af74330d..044a1ed5de2 100644
--- a/test/jaxp/javax/xml/jaxp/functional/javax/xml/parsers/ptests/DocumentBuilderFactoryTest.java
+++ b/test/jaxp/javax/xml/jaxp/functional/javax/xml/parsers/ptests/DocumentBuilderFactoryTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1999, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1999, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,26 +23,16 @@
 
 package javax.xml.parsers.ptests;
 
-import static javax.xml.XMLConstants.W3C_XML_SCHEMA_NS_URI;
-import static javax.xml.parsers.ptests.ParserTestConst.GOLDEN_DIR;
-import static javax.xml.parsers.ptests.ParserTestConst.XML_DIR;
-import static jaxp.library.JAXPTestUtilities.USER_DIR;
-import static jaxp.library.JAXPTestUtilities.compareWithGold;
-import static jaxp.library.JAXPTestUtilities.filenameToURL;
-import static org.testng.Assert.assertEquals;
-import static org.testng.Assert.assertFalse;
-import static org.testng.Assert.assertNotNull;
-import static org.testng.Assert.assertNull;
-import static org.testng.Assert.assertTrue;
-import static org.testng.Assert.assertSame;
-import static org.testng.Assert.assertNotSame;
-
-import java.io.BufferedReader;
-import java.io.Closeable;
-import java.io.File;
-import java.io.FileInputStream;
-import java.io.FileNotFoundException;
-import java.io.FileReader;
+import jaxp.library.JAXPDataProvider;
+import org.junit.jupiter.api.Test;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
+import org.w3c.dom.Document;
+import org.w3c.dom.Element;
+import org.w3c.dom.NodeList;
+import org.xml.sax.InputSource;
+import org.xml.sax.SAXException;
+import org.xml.sax.helpers.DefaultHandler;
 
 import javax.xml.parsers.DocumentBuilder;
 import javax.xml.parsers.DocumentBuilderFactory;
@@ -54,17 +44,28 @@ import javax.xml.transform.Transformer;
 import javax.xml.transform.TransformerFactory;
 import javax.xml.transform.dom.DOMSource;
 import javax.xml.transform.sax.SAXResult;
+import java.io.BufferedReader;
+import java.io.Closeable;
+import java.io.File;
+import java.io.FileInputStream;
+import java.io.FileNotFoundException;
+import java.io.FileReader;
+import java.nio.file.Files;
+import java.nio.file.Path;
 
-import jaxp.library.JAXPDataProvider;
-
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
-import org.w3c.dom.Document;
-import org.w3c.dom.Element;
-import org.w3c.dom.NodeList;
-import org.xml.sax.InputSource;
-import org.xml.sax.SAXException;
-import org.xml.sax.helpers.DefaultHandler;
+import static javax.xml.XMLConstants.W3C_XML_SCHEMA_NS_URI;
+import static javax.xml.parsers.ptests.ParserTestConst.GOLDEN_DIR;
+import static javax.xml.parsers.ptests.ParserTestConst.XML_DIR;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertFalse;
+import static org.junit.jupiter.api.Assertions.assertInstanceOf;
+import static org.junit.jupiter.api.Assertions.assertLinesMatch;
+import static org.junit.jupiter.api.Assertions.assertNotNull;
+import static org.junit.jupiter.api.Assertions.assertNotSame;
+import static org.junit.jupiter.api.Assertions.assertNull;
+import static org.junit.jupiter.api.Assertions.assertSame;
+import static org.junit.jupiter.api.Assertions.assertThrows;
+import static org.junit.jupiter.api.Assertions.assertTrue;
 
 /**
  * @bug 8080907 8169778
@@ -73,7 +74,8 @@ import org.xml.sax.helpers.DefaultHandler;
 /*
  * @test
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm javax.xml.parsers.ptests.DocumentBuilderFactoryTest
+ * @build jaxp.library.JAXPDataProvider
+ * @run junit/othervm javax.xml.parsers.ptests.DocumentBuilderFactoryTest
  */
 public class DocumentBuilderFactoryTest {
 
@@ -93,9 +95,11 @@ public class DocumentBuilderFactoryTest {
      *
      * @return a data provider contains DocumentBuilderFactory instantiation parameters.
      */
-    @DataProvider(name = "parameters")
-    public Object[][] getValidateParameters() {
-        return new Object[][] { { DOCUMENT_BUILDER_FACTORY_CLASSNAME, null }, { DOCUMENT_BUILDER_FACTORY_CLASSNAME, this.getClass().getClassLoader() } };
+    public static Object[][] getValidateParameters() {
+        return new Object[][] {
+                { DOCUMENT_BUILDER_FACTORY_CLASSNAME, null },
+                { DOCUMENT_BUILDER_FACTORY_CLASSNAME, DocumentBuilderFactoryTest.class.getClassLoader() },
+        };
     }
 
     /**
@@ -109,8 +113,8 @@ public class DocumentBuilderFactoryTest {
         DocumentBuilderFactory dbf2 = DocumentBuilderFactory.newInstance();
         assertNotSame(dbf1, dbf2, "same instance returned:");
         assertSame(dbf1.getClass(), dbf2.getClass(),
-                  "unexpected class mismatch for newDefaultInstance():");
-        assertEquals(dbf1.getClass().getName(), DEFAULT_IMPL_CLASS);
+                "unexpected class mismatch for newDefaultInstance():");
+        assertEquals(DEFAULT_IMPL_CLASS, dbf1.getClass().getName());
     }
 
     /**
@@ -119,12 +123,9 @@ public class DocumentBuilderFactoryTest {
      * points to correct implementation of
      * javax.xml.parsers.DocumentBuilderFactory , should return newInstance of
      * DocumentBuilderFactory
-     *
-     * @param factoryClassName
-     * @param classLoader
-     * @throws ParserConfigurationException
      */
-    @Test(dataProvider = "parameters")
+    @ParameterizedTest
+    @MethodSource("getValidateParameters")
     public void testNewInstance(String factoryClassName, ClassLoader classLoader) throws ParserConfigurationException {
         DocumentBuilderFactory dbf = DocumentBuilderFactory.newInstance(factoryClassName, classLoader);
         DocumentBuilder builder = dbf.newDocumentBuilder();
@@ -135,13 +136,13 @@ public class DocumentBuilderFactoryTest {
      * test for DocumentBuilderFactory.newInstance(java.lang.String
      * factoryClassName, java.lang.ClassLoader classLoader) factoryClassName is
      * null , should throw FactoryConfigurationError
-     *
-     * @param factoryClassName
-     * @param classLoader
      */
-    @Test(expectedExceptions = FactoryConfigurationError.class, dataProvider = "new-instance-neg", dataProviderClass = JAXPDataProvider.class)
+    @ParameterizedTest
+    @MethodSource("jaxp.library.JAXPDataProvider#newInstanceNeg")
     public void testNewInstanceNeg(String factoryClassName, ClassLoader classLoader) {
-        DocumentBuilderFactory.newInstance(factoryClassName, classLoader);
+        assertThrows(
+                FactoryConfigurationError.class,
+                () -> DocumentBuilderFactory.newInstance(factoryClassName, classLoader));
     }
 
     /**
@@ -162,11 +163,11 @@ public class DocumentBuilderFactoryTest {
         assertFalse(eh.isErrorOccured());
     }
 
-    @DataProvider(name = "schema-source")
-    public Object[][] getSchemaSource() throws FileNotFoundException {
+    public static Object[][] getSchemaSource() throws FileNotFoundException {
         return new Object[][] {
                 { new FileInputStream(new File(XML_DIR, "test.xsd")) },
-                { new InputSource(filenameToURL(XML_DIR + "test.xsd")) } };
+                { new InputSource(Path.of(XML_DIR).resolve("test.xsd").toUri().toASCIIString()) },
+        };
     }
 
     /**
@@ -174,7 +175,8 @@ public class DocumentBuilderFactoryTest {
      * this case the schema source property is set.
      * @throws Exception If any errors occur.
      */
-    @Test(dataProvider = "schema-source")
+    @ParameterizedTest
+    @MethodSource("getSchemaSource")
     public void testCheckSchemaSupport2(Object schemaSource) throws Exception {
         try {
             DocumentBuilderFactory dbf = DocumentBuilderFactory.newInstance();
@@ -201,7 +203,8 @@ public class DocumentBuilderFactoryTest {
      * this case the schema source property is set.
      * @throws Exception If any errors occur.
      */
-    @Test(dataProvider = "schema-source")
+    @ParameterizedTest
+    @MethodSource("getSchemaSource")
     public void testCheckSchemaSupport3(Object schemaSource) throws Exception {
         try {
             SAXParserFactory spf = SAXParserFactory.newInstance();
@@ -236,7 +239,7 @@ public class DocumentBuilderFactoryTest {
         Document doc = docBuilder.parse(new File(XML_DIR, "DocumentBuilderFactory01.xml"));
         Element e = (Element) doc.getElementsByTagName("html").item(0);
         NodeList nl = e.getChildNodes();
-        assertEquals(nl.getLength(), 1);
+        assertEquals(1, nl.getLength());
     }
 
     /**
@@ -312,7 +315,7 @@ public class DocumentBuilderFactoryTest {
             Element e = (Element) doc.getElementsByTagName("title").item(0);
             NodeList nl = e.getChildNodes();
             assertTrue(dbf.isExpandEntityReferences());
-            assertEquals(nl.item(0).getNodeValue().trim().charAt(0), 'W');
+            assertEquals('W', nl.item(0).getNodeValue().trim().charAt(0));
         }
     }
 
@@ -331,7 +334,7 @@ public class DocumentBuilderFactoryTest {
         MyErrorHandler eh = MyErrorHandler.newInstance();
         db.setErrorHandler(eh);
         Document doc = db.parse(new File(XML_DIR, "DocumentBuilderFactory04.xml"));
-        assertTrue(doc instanceof Document);
+        assertInstanceOf(Document.class, doc);
         assertFalse(eh.isErrorOccured());
     }
 
@@ -350,7 +353,7 @@ public class DocumentBuilderFactoryTest {
             Element e = (Element) doc.getElementsByTagName("title").item(0);
             NodeList nl = e.getChildNodes();
             assertTrue(dbf.isExpandEntityReferences());
-            assertEquals(nl.item(0).getNodeValue().trim().charAt(0), 'W');
+            assertEquals('W', nl.item(0).getNodeValue().trim().charAt(0));
         }
     }
 
@@ -458,12 +461,12 @@ public class DocumentBuilderFactoryTest {
      * throw Sax Exception.
      * @throws Exception If any errors occur.
      */
-    @Test(expectedExceptions = SAXException.class)
+    @Test
     public void testCheckDocumentBuilderFactory14() throws Exception {
         // Accesing default working directory.
         DocumentBuilderFactory dbf = DocumentBuilderFactory.newInstance();
         DocumentBuilder docBuilder = dbf.newDocumentBuilder();
-        docBuilder.parse("");
+        assertThrows(SAXException.class, () -> docBuilder.parse(""));
     }
 
     /**
@@ -472,12 +475,12 @@ public class DocumentBuilderFactoryTest {
      * @throws Exception If any errors occur.
      *
      */
-    @Test(expectedExceptions = IllegalArgumentException.class)
+    @Test
     public void testCheckDocumentBuilderFactory15() throws Exception {
         DocumentBuilderFactory dbf = DocumentBuilderFactory.newInstance();
         DocumentBuilder docBuilder = dbf.newDocumentBuilder();
         String uri = null;
-        docBuilder.parse(uri);
+        assertThrows(IllegalArgumentException.class, () -> docBuilder.parse(uri));
     }
 
     /**
@@ -496,7 +499,7 @@ public class DocumentBuilderFactoryTest {
             Document doc = docBuilder.parse(fis);
             Element e = (Element) doc.getElementsByTagName("body").item(0);
             NodeList nl = e.getChildNodes();
-            assertEquals(nl.getLength(), 0);
+            assertEquals(0, nl.getLength());
         }
     }
 
@@ -531,7 +534,7 @@ public class DocumentBuilderFactoryTest {
     @Test
     public void testCheckElementContentWhitespace() throws Exception {
         String goldFile = GOLDEN_DIR + "dbfactory02GF.out";
-        String outputFile = USER_DIR + "dbfactory02.out";
+        String outputFile = "dbfactory02.out";
         MyErrorHandler eh = MyErrorHandler.newInstance();
         DocumentBuilderFactory dbf = DocumentBuilderFactory.newInstance();
         dbf.setValidating(true);
@@ -549,6 +552,8 @@ public class DocumentBuilderFactoryTest {
             saxResult.setHandler(handler);
             transformer.transform(domSource, saxResult);
         }
-        assertTrue(compareWithGold(goldFile, outputFile));
+        assertLinesMatch(
+                Files.readAllLines(Path.of(goldFile)),
+                Files.readAllLines(Path.of(outputFile)));
     }
 }
diff --git a/test/jaxp/javax/xml/jaxp/functional/javax/xml/parsers/ptests/DocumentBuilderImpl01.java b/test/jaxp/javax/xml/jaxp/functional/javax/xml/parsers/ptests/DocumentBuilderImpl01.java
index 4e9006f9f5b..8d265336bbd 100644
--- a/test/jaxp/javax/xml/jaxp/functional/javax/xml/parsers/ptests/DocumentBuilderImpl01.java
+++ b/test/jaxp/javax/xml/jaxp/functional/javax/xml/parsers/ptests/DocumentBuilderImpl01.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1999, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1999, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,23 +23,20 @@
 
 package javax.xml.parsers.ptests;
 
-import static javax.xml.parsers.ptests.ParserTestConst.XML_DIR;
-import static jaxp.library.JAXPTestUtilities.FILE_SEP;
-import static org.testng.Assert.assertFalse;
-import static org.testng.Assert.assertNotNull;
-
-import java.io.File;
-import java.io.FileInputStream;
-import java.io.FilePermission;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
+import org.xml.sax.EntityResolver;
+import org.xml.sax.InputSource;
 
 import javax.xml.parsers.DocumentBuilder;
 import javax.xml.parsers.DocumentBuilderFactory;
 import javax.xml.parsers.ParserConfigurationException;
+import java.io.File;
+import java.io.FileInputStream;
 
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
-import org.xml.sax.EntityResolver;
-import org.xml.sax.InputSource;
+import static javax.xml.parsers.ptests.ParserTestConst.XML_DIR;
+import static org.junit.jupiter.api.Assertions.assertFalse;
+import static org.junit.jupiter.api.Assertions.assertNotNull;
 
 /**
  * This checks for the methods of DocumentBuilder
@@ -47,7 +44,7 @@ import org.xml.sax.InputSource;
 /*
  * @test
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm javax.xml.parsers.ptests.DocumentBuilderImpl01
+ * @run junit/othervm javax.xml.parsers.ptests.DocumentBuilderImpl01
  */
 public class DocumentBuilderImpl01 implements EntityResolver {
     /**
@@ -57,8 +54,7 @@ public class DocumentBuilderImpl01 implements EntityResolver {
      * @throws ParserConfigurationException if a DocumentBuilder cannot be
      *         created which satisfies the configuration requested.
      */
-    @DataProvider(name = "builder-provider")
-    public Object[][] getBuilder() throws ParserConfigurationException {
+    public static Object[][] getBuilder() throws ParserConfigurationException {
         DocumentBuilderFactory dbf = DocumentBuilderFactory.newInstance();
         DocumentBuilder docBuilder = dbf.newDocumentBuilder();
         return new Object[][] { { docBuilder } };
@@ -69,7 +65,8 @@ public class DocumentBuilderImpl01 implements EntityResolver {
      * to return false because not setting the validation.
      * @param docBuilder document builder instance.
      */
-    @Test(dataProvider = "builder-provider")
+    @ParameterizedTest
+    @MethodSource("getBuilder")
     public void testCheckDocumentBuilderImpl01(DocumentBuilder docBuilder) {
         assertFalse(docBuilder.isValidating());
     }
@@ -78,7 +75,8 @@ public class DocumentBuilderImpl01 implements EntityResolver {
      * Test the default functionality of isNamespaceAware method.
      * @param docBuilder document builder instance.
      */
-    @Test(dataProvider = "builder-provider")
+    @ParameterizedTest
+    @MethodSource("getBuilder")
     public void testCheckDocumentBuilderImpl02(DocumentBuilder docBuilder) {
         assertFalse(docBuilder.isNamespaceAware());
     }
@@ -88,7 +86,8 @@ public class DocumentBuilderImpl01 implements EntityResolver {
      * @param docBuilder document builder instance.
      * @throws Exception If any errors occur.
      */
-    @Test(dataProvider = "builder-provider")
+    @ParameterizedTest
+    @MethodSource("getBuilder")
     public void testCheckDocumentBuilderImpl04(DocumentBuilder docBuilder)
             throws Exception {
         try (FileInputStream fis = new FileInputStream(new File(XML_DIR,
@@ -103,7 +102,8 @@ public class DocumentBuilderImpl01 implements EntityResolver {
      * @param docBuilder document builder instance.
      * @throws Exception If any errors occur.
      */
-    @Test(dataProvider = "builder-provider")
+    @ParameterizedTest
+    @MethodSource("getBuilder")
     public void testCheckDocumentBuilderImpl05(DocumentBuilder docBuilder)
             throws Exception {
         assertNotNull(docBuilder.parse(new File(XML_DIR,
@@ -115,13 +115,14 @@ public class DocumentBuilderImpl01 implements EntityResolver {
      * @param docBuilder document builder instance.
      * @throws Exception If any errors occur.
      */
-    @Test(dataProvider = "builder-provider")
+    @ParameterizedTest
+    @MethodSource("getBuilder")
     public void testCheckDocumentBuilderImpl06(DocumentBuilder docBuilder)
             throws Exception {
         try (FileInputStream fis = new FileInputStream(new File(XML_DIR,
                 "DocumentBuilderImpl02.xml"))) {
             assertNotNull(docBuilder.parse(fis, new File(XML_DIR).toURI()
-                    .toASCIIString() + FILE_SEP));
+                    .toASCIIString() + '/'));
         }
     }
 
@@ -129,7 +130,8 @@ public class DocumentBuilderImpl01 implements EntityResolver {
      * Test the setEntityResolver.
      * @param docBuilder document builder instance.
      */
-    @Test(dataProvider = "builder-provider")
+    @ParameterizedTest
+    @MethodSource("getBuilder")
     public void testCheckDocumentBuilderImpl07(DocumentBuilder docBuilder) {
         docBuilder.setEntityResolver(this);
         assertNotNull(resolveEntity("publicId", "http://www.myhost.com/today"));
diff --git a/test/jaxp/javax/xml/jaxp/functional/javax/xml/parsers/ptests/FactoryConfErrorTest.java b/test/jaxp/javax/xml/jaxp/functional/javax/xml/parsers/ptests/FactoryConfErrorTest.java
index 3bcc49d58b2..fe4288fc2b1 100644
--- a/test/jaxp/javax/xml/jaxp/functional/javax/xml/parsers/ptests/FactoryConfErrorTest.java
+++ b/test/jaxp/javax/xml/jaxp/functional/javax/xml/parsers/ptests/FactoryConfErrorTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1999, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1999, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,16 +23,17 @@
 
 package javax.xml.parsers.ptests;
 
-import static jaxp.library.JAXPTestUtilities.setSystemProperty;
-import static jaxp.library.JAXPTestUtilities.clearSystemProperty;
+import org.junit.jupiter.api.AfterAll;
+import org.junit.jupiter.api.BeforeAll;
+import org.junit.jupiter.api.Test;
+import org.junit.jupiter.api.parallel.Execution;
+import org.junit.jupiter.api.parallel.ExecutionMode;
 
 import javax.xml.parsers.DocumentBuilderFactory;
 import javax.xml.parsers.FactoryConfigurationError;
 import javax.xml.parsers.SAXParserFactory;
 
-import org.testng.annotations.AfterTest;
-import org.testng.annotations.BeforeTest;
-import org.testng.annotations.Test;
+import static org.junit.jupiter.api.Assertions.assertThrows;
 
 /**
  * Class containing the test cases for SAXParserFactory/DocumentBuilderFactory
@@ -41,45 +42,46 @@ import org.testng.annotations.Test;
 /*
  * @test
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm javax.xml.parsers.ptests.FactoryConfErrorTest
+ * @run junit/othervm javax.xml.parsers.ptests.FactoryConfErrorTest
  */
+@Execution(ExecutionMode.SAME_THREAD)
 public class FactoryConfErrorTest {
 
     /**
      * Set properties DocumentBuilderFactory and SAXParserFactory to invalid
      * value before any test run.
      */
-    @BeforeTest
-    public void setup() {
-        setSystemProperty("javax.xml.parsers.DocumentBuilderFactory", "xx");
-        setSystemProperty("javax.xml.parsers.SAXParserFactory", "xx");
+    @BeforeAll
+    public static void setup() {
+        System.setProperty("javax.xml.parsers.DocumentBuilderFactory", "xx");
+        System.setProperty("javax.xml.parsers.SAXParserFactory", "xx");
     }
 
     /**
      * Restore properties DocumentBuilderFactory and SAXParserFactory to default
      * value after all tests run.
      */
-    @AfterTest
-    public void cleanup() {
-        clearSystemProperty("javax.xml.parsers.DocumentBuilderFactory");
-        clearSystemProperty("javax.xml.parsers.SAXParserFactory");
+    @AfterAll
+    public static void cleanup() {
+        System.clearProperty("javax.xml.parsers.DocumentBuilderFactory");
+        System.clearProperty("javax.xml.parsers.SAXParserFactory");
     }
 
     /**
      * To test exception thrown if javax.xml.parsers.SAXParserFactory property
      * is invalid.
      */
-    @Test(expectedExceptions = FactoryConfigurationError.class)
+    @Test
     public void testNewInstance01() {
-        SAXParserFactory.newInstance();
+        assertThrows(FactoryConfigurationError.class, SAXParserFactory::newInstance);
     }
 
     /**
      * To test exception thrown if javax.xml.parsers.DocumentBuilderFactory is
      * invalid.
      */
-    @Test(expectedExceptions = FactoryConfigurationError.class)
+    @Test
     public void testNewInstance02() {
-        DocumentBuilderFactory.newInstance();
+        assertThrows(FactoryConfigurationError.class, DocumentBuilderFactory::newInstance);
     }
 }
diff --git a/test/jaxp/javax/xml/jaxp/functional/javax/xml/parsers/ptests/SAXFactoryNewInstanceTest.java b/test/jaxp/javax/xml/jaxp/functional/javax/xml/parsers/ptests/SAXFactoryNewInstanceTest.java
index 2b47bd6a3da..22fca5ec207 100644
--- a/test/jaxp/javax/xml/jaxp/functional/javax/xml/parsers/ptests/SAXFactoryNewInstanceTest.java
+++ b/test/jaxp/javax/xml/jaxp/functional/javax/xml/parsers/ptests/SAXFactoryNewInstanceTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1999, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1999, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,32 +23,35 @@
 
 package javax.xml.parsers.ptests;
 
-import static org.testng.Assert.assertNotNull;
+import jaxp.library.JAXPDataProvider;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
+import org.xml.sax.SAXException;
 
 import javax.xml.parsers.FactoryConfigurationError;
 import javax.xml.parsers.ParserConfigurationException;
 import javax.xml.parsers.SAXParser;
 import javax.xml.parsers.SAXParserFactory;
 
-import jaxp.library.JAXPDataProvider;
-
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
-import org.xml.sax.SAXException;
+import static org.junit.jupiter.api.Assertions.assertNotNull;
+import static org.junit.jupiter.api.Assertions.assertThrows;
 
 /*
  * @test
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm javax.xml.parsers.ptests.SAXFactoryNewInstanceTest
+ * @build jaxp.library.JAXPDataProvider
+ * @run junit/othervm javax.xml.parsers.ptests.SAXFactoryNewInstanceTest
  * @summary Tests for SAXParserFactory.newInstance(factoryClassName , classLoader)
  */
 public class SAXFactoryNewInstanceTest {
 
     private static final String SAXPARSER_FACTORY_CLASSNAME = "com.sun.org.apache.xerces.internal.jaxp.SAXParserFactoryImpl";
 
-    @DataProvider(name = "parameters")
-    public Object[][] getValidateParameters() {
-        return new Object[][] { { SAXPARSER_FACTORY_CLASSNAME, null }, { SAXPARSER_FACTORY_CLASSNAME, this.getClass().getClassLoader() } };
+    public static Object[][] getValidateParameters() {
+        return new Object[][] {
+                { SAXPARSER_FACTORY_CLASSNAME, null },
+                { SAXPARSER_FACTORY_CLASSNAME, SAXFactoryNewInstanceTest.class.getClassLoader() },
+        };
     }
 
     /*
@@ -57,7 +60,8 @@ public class SAXFactoryNewInstanceTest {
      * implementation of javax.xml.parsers.SAXParserFactory , should return
      * newInstance of SAXParserFactory
      */
-    @Test(dataProvider = "parameters")
+    @ParameterizedTest
+    @MethodSource("getValidateParameters")
     public void testNewInstance(String factoryClassName, ClassLoader classLoader) throws ParserConfigurationException, SAXException {
         SAXParserFactory spf = SAXParserFactory.newInstance(factoryClassName, classLoader);
         SAXParser sp = spf.newSAXParser();
@@ -69,9 +73,12 @@ public class SAXFactoryNewInstanceTest {
      * java.lang.ClassLoader classLoader) factoryClassName is null , should
      * throw FactoryConfigurationError
      */
-    @Test(expectedExceptions = FactoryConfigurationError.class, dataProvider = "new-instance-neg", dataProviderClass = JAXPDataProvider.class)
+    @ParameterizedTest
+    @MethodSource("jaxp.library.JAXPDataProvider#newInstanceNeg")
     public void testNewInstanceNeg(String factoryClassName, ClassLoader classLoader) {
-        SAXParserFactory.newInstance(factoryClassName, classLoader);
+        assertThrows(
+                FactoryConfigurationError.class,
+                () -> SAXParserFactory.newInstance(factoryClassName, classLoader));
     }
 
 }
diff --git a/test/jaxp/javax/xml/jaxp/functional/javax/xml/parsers/ptests/SAXParserFactTest.java b/test/jaxp/javax/xml/jaxp/functional/javax/xml/parsers/ptests/SAXParserFactTest.java
index 77134c58ac1..0f21dffcea7 100644
--- a/test/jaxp/javax/xml/jaxp/functional/javax/xml/parsers/ptests/SAXParserFactTest.java
+++ b/test/jaxp/javax/xml/jaxp/functional/javax/xml/parsers/ptests/SAXParserFactTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1999, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1999, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -22,15 +22,16 @@
  */
 
 package javax.xml.parsers.ptests;
-import static org.testng.Assert.assertFalse;
-import static org.testng.Assert.assertTrue;
-import static org.testng.Assert.assertNotSame;
-import static org.testng.Assert.assertSame;
-import static org.testng.Assert.assertEquals;
+
+import org.junit.jupiter.api.Test;
 
 import javax.xml.parsers.SAXParserFactory;
 
-import org.testng.annotations.Test;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertFalse;
+import static org.junit.jupiter.api.Assertions.assertNotSame;
+import static org.junit.jupiter.api.Assertions.assertSame;
+import static org.junit.jupiter.api.Assertions.assertTrue;
 
 /**
  * Class containing the test cases for SAXParserFactory API.
@@ -39,7 +40,7 @@ import org.testng.annotations.Test;
  * @test
  * @bug 8169778
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm javax.xml.parsers.ptests.SAXParserFactTest
+ * @run junit/othervm javax.xml.parsers.ptests.SAXParserFactTest
  */
 public class SAXParserFactTest {
 
@@ -55,16 +56,15 @@ public class SAXParserFactTest {
     /**
      * Test if newDefaultInstance() method returns an instance
      * of the expected factory.
-     * @throws Exception If any errors occur.
      */
     @Test
-    public void testDefaultInstance() throws Exception {
+    public void testDefaultInstance() {
         SAXParserFactory spf1 = SAXParserFactory.newDefaultInstance();
         SAXParserFactory spf2 = SAXParserFactory.newInstance();
         assertNotSame(spf1, spf2, "same instance returned:");
         assertSame(spf1.getClass(), spf2.getClass(),
-                  "unexpected class mismatch for newDefaultInstance():");
-        assertEquals(spf1.getClass().getName(), DEFAULT_IMPL_CLASS);
+                "unexpected class mismatch for newDefaultInstance():");
+        assertEquals(DEFAULT_IMPL_CLASS, spf1.getClass().getName());
     }
 
     /**
diff --git a/test/jaxp/javax/xml/jaxp/functional/javax/xml/parsers/ptests/SAXParserTest.java b/test/jaxp/javax/xml/jaxp/functional/javax/xml/parsers/ptests/SAXParserTest.java
index f828dbeea18..38f2e98e286 100644
--- a/test/jaxp/javax/xml/jaxp/functional/javax/xml/parsers/ptests/SAXParserTest.java
+++ b/test/jaxp/javax/xml/jaxp/functional/javax/xml/parsers/ptests/SAXParserTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1999, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1999, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,37 +23,45 @@
 
 package javax.xml.parsers.ptests;
 
-import java.io.File;
-import java.io.FileInputStream;
-import java.io.IOException;
-import java.util.PropertyPermission;
-import javax.xml.parsers.SAXParser;
-import javax.xml.parsers.SAXParserFactory;
-import static javax.xml.parsers.ptests.ParserTestConst.XML_DIR;
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
+import org.junit.jupiter.api.Test;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
 import org.xml.sax.HandlerBase;
 import org.xml.sax.InputSource;
 import org.xml.sax.SAXException;
 import org.xml.sax.helpers.DefaultHandler;
 
+import javax.xml.parsers.SAXParser;
+import javax.xml.parsers.SAXParserFactory;
+import java.io.File;
+import java.io.FileInputStream;
+import java.io.IOException;
+import java.io.InputStream;
+
+import static javax.xml.parsers.ptests.ParserTestConst.XML_DIR;
+import static org.junit.jupiter.api.Assertions.assertThrows;
+
 /**
  * Class contains the test cases for SAXParser API
  */
 /*
  * @test
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm javax.xml.parsers.ptests.SAXParserTest
+ * @run junit/othervm javax.xml.parsers.ptests.SAXParserTest
  */
 public class SAXParserTest {
+    private static final DefaultHandler DEFAULT_HANDLER = new DefaultHandler();
+
+    @SuppressWarnings("deprecation")
+    private static final HandlerBase HANDLER_BASE = new HandlerBase();
+
     /**
      * Provide SAXParser.
      *
      * @return a data provider contains a SAXParser instance.
      * @throws Exception If any errors occur.
      */
-    @DataProvider(name = "parser-provider")
-    public Object[][] getParser() throws Exception {
+    public static Object[][] getParser() throws Exception {
         SAXParserFactory spf = SAXParserFactory.newInstance();
         SAXParser saxparser = spf.newSAXParser();
         return new Object[][] { { saxparser } };
@@ -62,423 +70,332 @@ public class SAXParserTest {
     /**
      * Test case with FileInputStream null, parsing should fail and throw
      * IllegalArgumentException.
-     *
-     * @param saxparser a SAXParser instance.
-     * @throws Exception If any errors occur.
      */
-    @Test(expectedExceptions = IllegalArgumentException.class,
-            dataProvider = "parser-provider")
-    public void testParse01(SAXParser saxparser) throws Exception {
-        FileInputStream instream = null;
-        saxparser.parse(instream, new HandlerBase());
+    @ParameterizedTest
+    @MethodSource("getParser")
+    public void testParse01(SAXParser saxparser) {
+        assertThrows(IllegalArgumentException.class, () -> saxparser.parse((InputStream) null, HANDLER_BASE));
     }
 
     /**
      * Test with by setting URI as null, parsing should fail and throw
      * IllegalArgumentException.
-     *
-     * @param saxparser a SAXParser instance.
-     * @throws Exception If any errors occur.
      */
-    @Test(expectedExceptions = IllegalArgumentException.class,
-            dataProvider = "parser-provider")
-    public void testParse02(SAXParser saxparser) throws Exception {
-        String uri = null;
-        saxparser.parse(uri, new HandlerBase());
+    @ParameterizedTest
+    @MethodSource("getParser")
+    public void testParse02(SAXParser saxparser) {
+        assertThrows(IllegalArgumentException.class, () -> saxparser.parse((String) null, HANDLER_BASE));
     }
 
     /**
      * Test with non-existence URI, parsing should fail and throw IOException.
-     *
-     * @param saxparser a SAXParser instance.
-     * @throws Exception If any errors occur.
      */
-    @Test(expectedExceptions = { SAXException.class },
-            dataProvider = "parser-provider")
-    public void testParse03(SAXParser saxparser) throws Exception {
-        saxparser.parse("", new HandlerBase());
+    @ParameterizedTest
+    @MethodSource("getParser")
+    public void testParse03(SAXParser saxparser) {
+        assertThrows(SAXException.class, () -> saxparser.parse("", HANDLER_BASE));
     }
 
     /**
      * Test with File null, parsing should fail and throw
      * IllegalArgumentException.
-     *
-     * @param saxparser a SAXParser instance.
-     * @throws Exception If any errors occur.
      */
-    @Test(expectedExceptions = IllegalArgumentException.class,
-            dataProvider = "parser-provider")
-    public void testParse04(SAXParser saxparser) throws Exception {
-        File file = null;
-        saxparser.parse(file, new HandlerBase());
+    public void testParse04(SAXParser saxparser) {
+        assertThrows(IllegalArgumentException.class, () -> saxparser.parse((File) null, HANDLER_BASE));
     }
 
     /**
      * Test with empty string as File, parsing should fail and throw
      * SAXException.
-     *
-     * @param saxparser a SAXParser instance.
-     * @throws Exception If any errors occur.
      */
-    @Test(expectedExceptions = SAXException.class, dataProvider = "parser-provider")
-    public void testParse05(SAXParser saxparser) throws Exception {
-        saxparser.parse(new File(""), new HandlerBase());
+    @ParameterizedTest
+    @MethodSource("getParser")
+    public void testParse05(SAXParser saxparser) {
+        File file = new File("");
+        assertThrows(SAXException.class, () -> saxparser.parse(file, HANDLER_BASE));
     }
 
     /**
      * Test with input source null, parsing should fail and throw
      * IllegalArgumentException.
-     *
-     * @param saxparser a SAXParser instance.
-     * @throws Exception If any errors occur.
      */
-    @Test(expectedExceptions = IllegalArgumentException.class,
-            dataProvider = "parser-provider")
-    public void testParse06(SAXParser saxparser) throws Exception {
-        InputSource is = null;
-        saxparser.parse(is, new HandlerBase());
+    @ParameterizedTest
+    @MethodSource("getParser")
+    public void testParse06(SAXParser saxparser) {
+        assertThrows(IllegalArgumentException.class, () -> saxparser.parse((InputSource) null, HANDLER_BASE));
     }
 
     /**
      * Test with FileInputStream null, parsing should fail and throw
      * IllegalArgumentException.
-     *
-     * @param saxparser a SAXParser instance.
-     * @throws Exception If any errors occur.
      */
-    @Test(expectedExceptions = IllegalArgumentException.class,
-            dataProvider = "parser-provider")
-    public void testParse07(SAXParser saxparser) throws Exception {
-        FileInputStream instream = null;
-        saxparser.parse(instream, new DefaultHandler());
+    public void testParse07(SAXParser saxparser) {
+        assertThrows(IllegalArgumentException.class, () -> saxparser.parse((InputStream) null, DEFAULT_HANDLER));
     }
 
     /**
      * Test with URI null, parsing should fail and throw
      * IllegalArgumentException.
-     *
-     * @param saxparser a SAXParser instance.
-     * @throws Exception If any errors occur.
      */
-    @Test(expectedExceptions = IllegalArgumentException.class,
-            dataProvider = "parser-provider")
-    public void testParse08(SAXParser saxparser) throws Exception {
-        String uri = null;
-        saxparser.parse(uri, new DefaultHandler());
+    @ParameterizedTest
+    @MethodSource("getParser")
+    public void testParse08(SAXParser saxparser) {
+        assertThrows(IllegalArgumentException.class, () -> saxparser.parse((String) null, DEFAULT_HANDLER));
     }
 
     /**
      * Test with non-existence URI, parsing should fail and throw SAXException
      * or IOException.
-     *
-     * @param saxparser
-     *            a SAXParser instance.
-     * @throws Exception
-     *             If any errors occur.
      */
-    @Test(expectedExceptions = { SAXException.class, IOException.class }, dataProvider = "parser-provider")
-    public void testParse09(SAXParser saxparser) throws Exception {
-        saxparser.parse("no-such-file", new DefaultHandler());
+    @ParameterizedTest
+    @MethodSource("getParser")
+    public void testParse09(SAXParser saxparser) {
+        assertThrows(IOException.class, () -> saxparser.parse("no-such-file", DEFAULT_HANDLER));
     }
 
     /**
      * Test with empty string as File, parsing should fail and throw
      * SAXException.
-     *
-     * @param saxparser a SAXParser instance.
-     * @throws Exception If any errors occur.
      */
-    @Test(expectedExceptions = SAXException.class, dataProvider = "parser-provider")
-    public void testParse10(SAXParser saxparser) throws Exception {
+    @ParameterizedTest
+    @MethodSource("getParser")
+    public void testParse10(SAXParser saxparser) {
         File file = new File("");
-        saxparser.parse(file, new DefaultHandler());
+        assertThrows(SAXException.class, () -> saxparser.parse(file, DEFAULT_HANDLER));
     }
 
     /**
      * Test with File null, parsing should fail and throw
      * IllegalArgumentException.
-     *
-     * @param saxparser a SAXParser instance.
-     * @throws Exception If any errors occur.
      */
-    @Test(expectedExceptions = IllegalArgumentException.class,
-            dataProvider = "parser-provider")
-    public void testParse11(SAXParser saxparser) throws Exception {
-        saxparser.parse((File) null, new DefaultHandler());
+    @ParameterizedTest
+    @MethodSource("getParser")
+    public void testParse11(SAXParser saxparser) {
+        assertThrows(IllegalArgumentException.class, () -> saxparser.parse((File) null, DEFAULT_HANDLER));
     }
 
     /**
      * Test with input source null, parsing should fail and throw
      * IllegalArgumentException.
-     *
-     * @param saxparser a SAXParser instance.
-     * @throws Exception If any errors occur.
      */
-    @Test(expectedExceptions = IllegalArgumentException.class,
-            dataProvider = "parser-provider")
-    public void testParse12(SAXParser saxparser) throws Exception {
-        InputSource is = null;
-        saxparser.parse(is, new DefaultHandler());
+    @ParameterizedTest
+    @MethodSource("getParser")
+    public void testParse12(SAXParser saxparser) {
+        assertThrows(IllegalArgumentException.class, () -> saxparser.parse((InputSource) null, DEFAULT_HANDLER));
     }
 
     /**
      * Test with an error in XML file, parsing should fail and throw
      * SAXException.
-     *
-     * @param saxparser a SAXParser instance.
-     * @throws Exception If any errors occur.
      */
-    @Test(expectedExceptions = SAXException.class,
-            dataProvider = "parser-provider")
     public void testParse13(SAXParser saxparser) throws Exception {
         try (FileInputStream instream = new FileInputStream(new File(
                 XML_DIR, "invalid.xml"))) {
-            saxparser.parse(instream, new HandlerBase());
+            assertThrows(SAXException.class, () -> saxparser.parse(instream, HANDLER_BASE));
         }
     }
 
     /**
      * Test with a valid in XML file, parser should parse the XML document.
-     *
-     * @param saxparser a SAXParser instance.
-     * @throws Exception If any errors occur.
      */
-    @Test(dataProvider = "parser-provider")
+    @ParameterizedTest
+    @MethodSource("getParser")
     public void testParse14(SAXParser saxparser) throws Exception {
-        saxparser.parse(new File(XML_DIR, "parsertest.xml"),
-                new HandlerBase());
+        saxparser.parse(new File(XML_DIR, "parsertest.xml"), HANDLER_BASE);
     }
 
     /**
      * Test with valid input stream, parser should parse the XML document
      * successfully.
-     *
-     * @param saxparser a SAXParser instance.
-     * @throws Exception If any errors occur.
      */
-    @Test(dataProvider = "parser-provider")
+    @ParameterizedTest
+    @MethodSource("getParser")
     public void testParse15(SAXParser saxparser) throws Exception {
-        try (FileInputStream instream = new FileInputStream(new File(XML_DIR,
-                "correct.xml"))) {
-            saxparser.parse(instream, new HandlerBase());
+        try (FileInputStream instream = new FileInputStream(new File(XML_DIR, "correct.xml"))) {
+            saxparser.parse(instream, HANDLER_BASE);
         }
     }
 
     /**
      * Test with valid input source, parser should parse the XML document
      * successfully.
-     *
-     * @param saxparser a SAXParser instance.
-     * @throws Exception If any errors occur.
      */
-    @Test(dataProvider = "parser-provider")
+    @ParameterizedTest
+    @MethodSource("getParser")
     public void testParse16(SAXParser saxparser) throws Exception {
         try (FileInputStream instream = new FileInputStream(
                 new File(XML_DIR, "parsertest.xml"))) {
-            saxparser.parse(instream, new HandlerBase(),
+            saxparser.parse(instream, HANDLER_BASE,
                     new File(XML_DIR).toURI().toASCIIString());
         }
     }
 
     /**
      * Test with proper URI, parser should parse successfully.
-     *
-     * @param saxparser a SAXParser instance.
-     * @throws Exception If any errors occur.
      */
-    @Test(dataProvider = "parser-provider")
+    @ParameterizedTest
+    @MethodSource("getParser")
     public void testParse17(SAXParser saxparser) throws Exception {
         File file = new File(XML_DIR, "correct.xml");
-        saxparser.parse(file.toURI().toASCIIString(), new HandlerBase());
+        saxparser.parse(file.toURI().toASCIIString(), HANDLER_BASE);
     }
 
     /**
      * Test with XML file that has errors parsing should fail and throw
      * SAXException.
-     *
-     * @param saxparser a SAXParser instance.
-     * @throws Exception If any errors occur.
      */
-    @Test(expectedExceptions = SAXException.class,
-            dataProvider = "parser-provider")
-    public void testParse18(SAXParser saxparser) throws Exception {
-        saxparser.parse(new File(XML_DIR, "valid.xml"), new HandlerBase());
+    @ParameterizedTest
+    @MethodSource("getParser")
+    public void testParse18(SAXParser saxparser) {
+        File file = new File(XML_DIR, "valid.xml");
+        assertThrows(SAXException.class, () -> saxparser.parse(file, HANDLER_BASE));
     }
 
     /**
      * Test with XML file that has no errors Parser should successfully
      * parse the XML document.
-     *
-     * @param saxparser a SAXParser instance.
-     * @throws Exception If any errors occur.
      */
-    @Test(dataProvider = "parser-provider")
+    @ParameterizedTest
+    @MethodSource("getParser")
     public void testParse19(SAXParser saxparser) throws Exception {
-        saxparser.parse(new File(XML_DIR, "correct.xml"), new HandlerBase());
+        saxparser.parse(new File(XML_DIR, "correct.xml"), HANDLER_BASE);
     }
 
     /**
      * Test with input source attached an invalid XML, parsing should fail
      * and throw SAXException.
-     *
-     * @param saxparser a SAXParser instance.
-     * @throws Exception If any errors occur.
      */
-    @Test(expectedExceptions = SAXException.class,
-            dataProvider = "parser-provider")
+    @ParameterizedTest
+    @MethodSource("getParser")
     public void testParse20(SAXParser saxparser) throws Exception {
         try(FileInputStream instream = new FileInputStream(new File(XML_DIR,
                 "invalid.xml"))) {
-            saxparser.parse(new InputSource(instream), new HandlerBase());
+            InputSource is = new InputSource(instream);
+            assertThrows(SAXException.class, () -> saxparser.parse(is, HANDLER_BASE));
         }
     }
 
     /**
      * Test with input source attached an valid XML, parser should
      * successfully parse the XML document.
-     *
-     * @param saxparser a SAXParser instance.
-     * @throws Exception If any errors occur.
      */
-    @Test(dataProvider = "parser-provider")
+    @ParameterizedTest
+    @MethodSource("getParser")
     public void testParse21(SAXParser saxparser) throws Exception {
         try (FileInputStream instream = new FileInputStream(new File(XML_DIR,
                 "correct.xml"))) {
-            saxparser.parse(new InputSource(instream), new HandlerBase());
+            saxparser.parse(new InputSource(instream), HANDLER_BASE);
         }
     }
 
     /**
      * Test with an error in xml file, parsing should fail and throw
      * SAXException.
-     *
-     * @param saxparser a SAXParser instance.
-     * @throws Exception If any errors occur.
      */
-    @Test(expectedExceptions = SAXException.class,
-            dataProvider = "parser-provider")
+    @ParameterizedTest
+    @MethodSource("getParser")
     public void testParse22(SAXParser saxparser) throws Exception {
         try (FileInputStream instream = new FileInputStream(
                 new File(XML_DIR, "invalid.xml"))) {
-            saxparser.parse(instream, new DefaultHandler());
+            assertThrows(SAXException.class, () -> saxparser.parse(instream, DEFAULT_HANDLER));
         }
     }
 
     /**
      * Test with valid input stream, parser should parse the XML document
      * successfully.
-     *
-     * @param saxparser a SAXParser instance.
-     * @throws Exception If any errors occur.
      */
-    @Test(dataProvider = "parser-provider")
+    @ParameterizedTest
+    @MethodSource("getParser")
     public void testParse23(SAXParser saxparser) throws Exception {
-        DefaultHandler handler = new DefaultHandler();
-        saxparser.parse(new File(XML_DIR, "parsertest.xml"), handler);
+        saxparser.parse(new File(XML_DIR, "parsertest.xml"), DEFAULT_HANDLER);
     }
 
     /**
      * Test with valid input stream, parser should parse the XML document
      * successfully.
-     *
-     * @param saxparser a SAXParser instance.
-     * @throws Exception If any errors occur.
      */
-    @Test(dataProvider = "parser-provider")
+    @ParameterizedTest
+    @MethodSource("getParser")
     public void testParse24(SAXParser saxparser) throws Exception {
         try (FileInputStream instream = new FileInputStream(new File(XML_DIR,
                 "correct.xml"))) {
-            DefaultHandler handler = new DefaultHandler();
-            saxparser.parse(instream, handler);
+            saxparser.parse(instream, DEFAULT_HANDLER);
         }
     }
 
     /**
      * Test with valid input source, parser should parse the XML document
      * successfully.
-     *
-     * @param saxparser a SAXParser instance.
-     * @throws Exception If any errors occur.
      */
-    @Test(dataProvider = "parser-provider")
+    @ParameterizedTest
+    @MethodSource("getParser")
     public void testParse25(SAXParser saxparser) throws Exception {
         try (FileInputStream instream = new FileInputStream(
                 new File(XML_DIR, "parsertest.xml"))) {
-            saxparser.parse(instream, new DefaultHandler(),
-                new File(XML_DIR).toURI().toASCIIString());
+            saxparser.parse(instream, DEFAULT_HANDLER,
+                    new File(XML_DIR).toURI().toASCIIString());
         }
     }
 
     /**
      * Test with proper URI, parser should parse successfully.
-     *
-     * @param saxparser a SAXParser instance.
-     * @throws Exception If any errors occur.
      */
-    @Test(dataProvider = "parser-provider")
+    @ParameterizedTest
+    @MethodSource("getParser")
     public void testParse26(SAXParser saxparser) throws Exception {
         File file = new File(XML_DIR, "correct.xml");
-        saxparser.parse(file.toURI().toASCIIString(), new DefaultHandler());
+        saxparser.parse(file.toURI().toASCIIString(), DEFAULT_HANDLER);
     }
 
     /**
      * Test with XML file that has errors, parsing should fail and throw
      * SAXException.
-     *
-     * @param saxparser a SAXParser instance.
-     * @throws Exception If any errors occur.
      */
-    @Test(expectedExceptions = SAXException.class,
-            dataProvider = "parser-provider")
-    public void testParse27(SAXParser saxparser) throws Exception {
-        saxparser.parse(new File(XML_DIR, "valid.xml"), new DefaultHandler());
+    @ParameterizedTest
+    @MethodSource("getParser")
+    public void testParse27(SAXParser saxparser) {
+        File file = new File(XML_DIR, "valid.xml");
+        assertThrows(SAXException.class, () -> saxparser.parse(file, DEFAULT_HANDLER));
     }
 
     /**
      * Test with XML file that has no errors, parser should successfully
      * parse the XML document.
-     *
-     * @param saxparser a SAXParser instance.
-     * @throws Exception If any errors occur.
      */
-    @Test(dataProvider = "parser-provider")
+    @ParameterizedTest
+    @MethodSource("getParser")
     public void testParse28(SAXParser saxparser) throws Exception {
-        saxparser.parse(new File(XML_DIR, "correct.xml"), new DefaultHandler());
+        saxparser.parse(new File(XML_DIR, "correct.xml"), DEFAULT_HANDLER);
     }
 
     /**
      * Test with an invalid XML file, parser should throw SAXException.
-     *
-     * @param saxparser a SAXParser instance.
-     * @throws Exception If any errors occur.
      */
-    @Test(expectedExceptions = SAXException.class,
-            dataProvider = "parser-provider")
+    @ParameterizedTest
+    @MethodSource("getParser")
     public void testParse29(SAXParser saxparser) throws Exception {
         try (FileInputStream instream = new FileInputStream(
                 new File(XML_DIR, "invalid.xml"))) {
-            saxparser.parse(new InputSource(instream), new DefaultHandler());
+            InputSource is = new InputSource(instream);
+            assertThrows(SAXException.class, () -> saxparser.parse(is, DEFAULT_HANDLER));
         }
     }
 
     /**
      * Test case to parse an XML file that not use namespaces.
-     *
-     * @param saxparser a SAXParser instance.
-     * @throws Exception If any errors occur.
      */
-    @Test(dataProvider = "parser-provider")
+    @ParameterizedTest
+    @MethodSource("getParser")
     public void testParse30(SAXParser saxparser) throws Exception {
         try (FileInputStream instream = new FileInputStream(
                 new File(XML_DIR, "correct.xml"))) {
-            saxparser.parse(new InputSource(instream), new DefaultHandler());
+            saxparser.parse(new InputSource(instream), DEFAULT_HANDLER);
         }
     }
 
     /**
      * Test case to parse an XML file that uses namespaces.
-     *
-     * @throws Exception If any errors occur.
      */
     @Test
     public void testParse31() throws Exception {
@@ -486,7 +403,7 @@ public class SAXParserTest {
                 new File(XML_DIR, "ns4.xml"))) {
             SAXParserFactory spf = SAXParserFactory.newInstance();
             spf.setNamespaceAware(true);
-            spf.newSAXParser().parse(instream, new HandlerBase());
+            spf.newSAXParser().parse(instream, HANDLER_BASE);
         }
     }
 }
diff --git a/test/jaxp/javax/xml/jaxp/functional/javax/xml/parsers/ptests/SAXParserTest02.java b/test/jaxp/javax/xml/jaxp/functional/javax/xml/parsers/ptests/SAXParserTest02.java
index db02034e22c..2597bd975a5 100644
--- a/test/jaxp/javax/xml/jaxp/functional/javax/xml/parsers/ptests/SAXParserTest02.java
+++ b/test/jaxp/javax/xml/jaxp/functional/javax/xml/parsers/ptests/SAXParserTest02.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1999, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1999, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,28 +23,31 @@
 
 package javax.xml.parsers.ptests;
 
-import static org.testng.Assert.assertFalse;
-import static org.testng.Assert.assertNotNull;
-import static org.testng.Assert.assertNull;
-import static org.testng.Assert.assertTrue;
-
-import javax.xml.parsers.SAXParser;
-import javax.xml.parsers.SAXParserFactory;
-
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
+import org.junit.jupiter.api.Test;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
 import org.xml.sax.SAXException;
 import org.xml.sax.SAXNotSupportedException;
 import org.xml.sax.ext.DeclHandler;
 import org.xml.sax.ext.LexicalHandler;
 
+import javax.xml.parsers.SAXParser;
+import javax.xml.parsers.SAXParserFactory;
+
+import static org.junit.jupiter.api.Assertions.assertFalse;
+import static org.junit.jupiter.api.Assertions.assertInstanceOf;
+import static org.junit.jupiter.api.Assertions.assertNotNull;
+import static org.junit.jupiter.api.Assertions.assertNull;
+import static org.junit.jupiter.api.Assertions.assertThrows;
+import static org.junit.jupiter.api.Assertions.assertTrue;
+
 /**
  * Class contains the test cases for SAXParser API
  */
 /*
  * @test
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm javax.xml.parsers.ptests.SAXParserTest02
+ * @run junit/othervm javax.xml.parsers.ptests.SAXParserTest02
  */
 public class SAXParserTest02 {
     private static final String DOM_NODE = "http://xml.org/sax/properties/dom-node";
@@ -58,8 +61,7 @@ public class SAXParserTest02 {
      * @return a data provider contains a SAXParser instance.
      * @throws Exception If any errors occur.
      */
-    @DataProvider(name = "parser-provider")
-    public Object[][] getParser() throws Exception {
+    public static Object[][] getParser() throws Exception {
         SAXParserFactory spf = SAXParserFactory.newInstance();
         SAXParser saxparser = spf.newSAXParser();
         return new Object[][] { { saxparser } };
@@ -70,7 +72,8 @@ public class SAXParserTest02 {
      *
      * @param saxparser a SAXParser instance.
      */
-    @Test(dataProvider = "parser-provider")
+    @ParameterizedTest
+    @MethodSource("getParser")
     public void testValidate01(SAXParser saxparser) {
         assertFalse(saxparser.isValidating());
     }
@@ -78,8 +81,6 @@ public class SAXParserTest02 {
     /**
      * Test to test the functionality of setValidating and isValidating
      * methods.
-     *
-     * @throws Exception If any errors occur.
      */
     @Test
     public void testValidate02() throws Exception {
@@ -95,7 +96,8 @@ public class SAXParserTest02 {
      *
      * @param saxparser a SAXParser instance.
      */
-    @Test(dataProvider = "parser-provider")
+    @ParameterizedTest
+    @MethodSource("getParser")
     public void testNamespace01(SAXParser saxparser) {
         assertFalse(saxparser.isNamespaceAware());
     }
@@ -119,7 +121,8 @@ public class SAXParserTest02 {
      * @param saxparser a SAXParser instance.
      * @throws SAXException If any parse errors occur.
      */
-    @Test(dataProvider = "parser-provider")
+    @ParameterizedTest
+    @MethodSource("getParser")
     public void testParser01(SAXParser saxparser) throws SAXException {
         assertNotNull(saxparser.getParser());
     }
@@ -131,7 +134,8 @@ public class SAXParserTest02 {
      * @param saxparser a SAXParser instance.
      * @throws SAXException If any parse errors occur.
      */
-    @Test(dataProvider = "parser-provider")
+    @ParameterizedTest
+    @MethodSource("getParser")
     public void testXmlReader01(SAXParser saxparser) throws SAXException {
         assertNotNull(saxparser.getXMLReader());
     }
@@ -142,10 +146,10 @@ public class SAXParserTest02 {
      * @param saxparser a SAXParser instance.
      * @throws SAXException If any parse errors occur.
      */
-    @Test(expectedExceptions = SAXNotSupportedException.class,
-            dataProvider = "parser-provider")
-    public void testProperty01(SAXParser saxparser) throws SAXException {
-        saxparser.getProperty(XML_STRING);
+    @ParameterizedTest
+    @MethodSource("getParser")
+    public void testProperty01(SAXParser saxparser) {
+        assertThrows(SAXNotSupportedException.class, () -> saxparser.getProperty(XML_STRING));
     }
 
     /**
@@ -154,10 +158,10 @@ public class SAXParserTest02 {
      * @param saxparser a SAXParser instance.
      * @throws SAXException If any parse errors occur.
      */
-    @Test(expectedExceptions = SAXNotSupportedException.class,
-            dataProvider = "parser-provider")
-    public void testProperty02(SAXParser saxparser) throws SAXException {
-        saxparser.getProperty(DOM_NODE);
+    @ParameterizedTest
+    @MethodSource("getParser")
+    public void testProperty02(SAXParser saxparser) {
+        assertThrows(SAXNotSupportedException.class, () -> saxparser.getProperty(DOM_NODE));
     }
 
     /**
@@ -166,7 +170,8 @@ public class SAXParserTest02 {
      * @param saxparser a SAXParser instance.
      * @throws SAXException If any parse errors occur.
      */
-    @Test(dataProvider = "parser-provider")
+    @ParameterizedTest
+    @MethodSource("getParser")
     public void testProperty03(SAXParser saxparser) throws SAXException {
         assertNull(saxparser.getProperty(LEXICAL_HANDLER));
     }
@@ -177,7 +182,8 @@ public class SAXParserTest02 {
      * @param saxparser a SAXParser instance.
      * @throws SAXException If any parse errors occur.
      */
-    @Test(dataProvider = "parser-provider")
+    @ParameterizedTest
+    @MethodSource("getParser")
     public void testProperty04(SAXParser saxparser) throws SAXException {
         assertNull(saxparser.getProperty(DECL_HANDLER));
     }
@@ -188,11 +194,12 @@ public class SAXParserTest02 {
      * @param saxparser a SAXParser instance.
      * @throws SAXException If any parse errors occur.
      */
-    @Test(dataProvider = "parser-provider")
+    @ParameterizedTest
+    @MethodSource("getParser")
     public void testProperty05(SAXParser saxparser) throws SAXException {
         MyLexicalHandler myLexicalHandler = new MyLexicalHandler();
         saxparser.setProperty(LEXICAL_HANDLER, myLexicalHandler);
-        assertTrue(saxparser.getProperty(LEXICAL_HANDLER) instanceof LexicalHandler);
+        assertInstanceOf(LexicalHandler.class, saxparser.getProperty(LEXICAL_HANDLER));
     }
 
     /**
@@ -201,11 +208,12 @@ public class SAXParserTest02 {
      * @param saxparser a SAXParser instance.
      * @throws SAXException If any parse errors occur.
      */
-    @Test(dataProvider = "parser-provider")
+    @ParameterizedTest
+    @MethodSource("getParser")
     public void testProperty06(SAXParser saxparser) throws SAXException {
         MyDeclHandler myDeclHandler = new MyDeclHandler();
         saxparser.setProperty(DECL_HANDLER, myDeclHandler);
-        assertTrue(saxparser.getProperty(DECL_HANDLER) instanceof DeclHandler);
+        assertInstanceOf(DeclHandler.class, saxparser.getProperty(DECL_HANDLER));
     }
 
     /**
diff --git a/test/jaxp/javax/xml/jaxp/functional/javax/xml/parsers/ptests/SAXParserTest03.java b/test/jaxp/javax/xml/jaxp/functional/javax/xml/parsers/ptests/SAXParserTest03.java
index 47d202da7b8..61a270b67d5 100644
--- a/test/jaxp/javax/xml/jaxp/functional/javax/xml/parsers/ptests/SAXParserTest03.java
+++ b/test/jaxp/javax/xml/jaxp/functional/javax/xml/parsers/ptests/SAXParserTest03.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1999, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1999, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,19 +23,18 @@
 
 package javax.xml.parsers.ptests;
 
-import static javax.xml.parsers.ptests.ParserTestConst.XML_DIR;
-import static org.testng.Assert.assertFalse;
-import static org.testng.Assert.assertTrue;
-import static org.testng.Assert.fail;
-
-import java.io.File;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
+import org.xml.sax.SAXException;
 
 import javax.xml.parsers.SAXParser;
 import javax.xml.parsers.SAXParserFactory;
+import java.io.File;
 
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
-import org.xml.sax.SAXException;
+import static javax.xml.parsers.ptests.ParserTestConst.XML_DIR;
+import static org.junit.jupiter.api.Assertions.assertFalse;
+import static org.junit.jupiter.api.Assertions.assertThrows;
+import static org.junit.jupiter.api.Assertions.assertTrue;
 
 /**
  * Class contains the test cases for SAXParser API
@@ -43,7 +42,7 @@ import org.xml.sax.SAXException;
 /*
  * @test
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm javax.xml.parsers.ptests.SAXParserTest03
+ * @run junit/othervm javax.xml.parsers.ptests.SAXParserTest03
  */
 public class SAXParserTest03 {
 
@@ -52,8 +51,7 @@ public class SAXParserTest03 {
      *
      * @return a dimensional contains.
      */
-    @DataProvider(name = "input-provider")
-    public Object[][] getFactory() {
+    public static Object[][] getFactory() {
         SAXParserFactory spf = SAXParserFactory.newInstance();
         spf.setValidating(true);
         return new Object[][] { { spf, MyErrorHandler.newInstance() } };
@@ -67,7 +65,8 @@ public class SAXParserTest03 {
      * @param handler an error handler for capturing events.
      * @throws Exception If any errors occur.
      */
-    @Test(dataProvider = "input-provider")
+    @ParameterizedTest
+    @MethodSource("getFactory")
     public void testParseValidate01(SAXParserFactory spf, MyErrorHandler handler)
             throws Exception {
             spf.newSAXParser().parse(new File(XML_DIR, "parsertest.xml"), handler);
@@ -82,7 +81,8 @@ public class SAXParserTest03 {
      * @param handler an error handler for capturing events.
      * @throws Exception If any errors occur.
      */
-    @Test(dataProvider = "input-provider")
+    @ParameterizedTest
+    @MethodSource("getFactory")
     public void testParseValidate02(SAXParserFactory spf, MyErrorHandler handler)
             throws Exception {
             spf.setNamespaceAware(true);
@@ -99,17 +99,13 @@ public class SAXParserTest03 {
      * @param handler an error handler for capturing events.
      * @throws Exception If any errors occur.
      */
-    @Test(dataProvider = "input-provider")
+    @ParameterizedTest
+    @MethodSource("getFactory")
     public void testParseValidate03(SAXParserFactory spf, MyErrorHandler handler)
             throws Exception {
-        try {
-            spf.setNamespaceAware(true);
-            SAXParser saxparser = spf.newSAXParser();
-            saxparser.parse(new File(XML_DIR, "invalidns.xml"), handler);
-            fail("Expecting SAXException here");
-        } catch (SAXException e) {
-            assertTrue(handler.isErrorOccured());
-        }
+        spf.setNamespaceAware(true);
+        SAXParser saxparser = spf.newSAXParser();
+        assertThrows(SAXException.class, () -> saxparser.parse(new File(XML_DIR, "invalidns.xml"), handler));
+        assertTrue(handler.isErrorOccured());
     }
-
 }
diff --git a/test/jaxp/javax/xml/jaxp/functional/javax/xml/stream/ptests/XMLEventFactoryNewInstanceTest.java b/test/jaxp/javax/xml/jaxp/functional/javax/xml/stream/ptests/XMLEventFactoryNewInstanceTest.java
index b846524e0bf..36bf2d01c36 100644
--- a/test/jaxp/javax/xml/jaxp/functional/javax/xml/stream/ptests/XMLEventFactoryNewInstanceTest.java
+++ b/test/jaxp/javax/xml/jaxp/functional/javax/xml/stream/ptests/XMLEventFactoryNewInstanceTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1999, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1999, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,26 +23,25 @@
 
 package javax.xml.stream.ptests;
 
-import static jaxp.library.JAXPTestUtilities.setSystemProperty;
-import static jaxp.library.JAXPTestUtilities.clearSystemProperty;
-
-import static org.testng.Assert.assertNotNull;
-import static org.testng.Assert.assertNotSame;
-import static org.testng.Assert.assertSame;
-import static org.testng.Assert.assertEquals;
+import jaxp.library.JAXPDataProvider;
+import org.junit.jupiter.api.Test;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
 
 import javax.xml.stream.XMLEventFactory;
 
-import jaxp.library.JAXPDataProvider;
-
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertNotNull;
+import static org.junit.jupiter.api.Assertions.assertNotSame;
+import static org.junit.jupiter.api.Assertions.assertSame;
+import static org.junit.jupiter.api.Assertions.assertThrows;
 
 /*
  * @test
  * @bug 8169778
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm javax.xml.stream.ptests.XMLEventFactoryNewInstanceTest
+ * @build jaxp.library.JAXPDataProvider
+ * @run junit/othervm javax.xml.stream.ptests.XMLEventFactoryNewInstanceTest
  * @summary Tests for XMLEventFactory.newFactory(factoryId , classLoader)
  */
 public class XMLEventFactoryNewInstanceTest {
@@ -52,26 +51,25 @@ public class XMLEventFactoryNewInstanceTest {
     private static final String XMLEVENT_FACTORY_CLASSNAME = DEFAULT_IMPL_CLASS;
     private static final String XMLEVENT_FACTORY_ID = "javax.xml.stream.XMLEventFactory";
 
-    @DataProvider(name = "parameters")
-    public Object[][] getValidateParameters() {
+    public static Object[][] getValidateParameters() {
         return new Object[][] {
-            { XMLEVENT_FACTORY_ID, null },
-            { XMLEVENT_FACTORY_ID, this.getClass().getClassLoader() } };
+                { XMLEVENT_FACTORY_ID, null },
+                { XMLEVENT_FACTORY_ID, XMLEventFactoryNewInstanceTest.class.getClassLoader() },
+        };
     }
 
     /**
      * Test if newDefaultFactory() method returns an instance
      * of the expected factory.
-     * @throws Exception If any errors occur.
      */
     @Test
-    public void testDefaultInstance() throws Exception {
+    public void testDefaultInstance() {
         XMLEventFactory ef1 = XMLEventFactory.newDefaultFactory();
         XMLEventFactory ef2 = XMLEventFactory.newFactory();
         assertNotSame(ef1, ef2, "same instance returned:");
         assertSame(ef1.getClass(), ef2.getClass(),
-                  "unexpected class mismatch for newDefaultFactory():");
-        assertEquals(ef1.getClass().getName(), DEFAULT_IMPL_CLASS);
+                "unexpected class mismatch for newDefaultFactory():");
+        assertEquals(DEFAULT_IMPL_CLASS, ef1.getClass().getName());
     }
 
     /*
@@ -80,14 +78,15 @@ public class XMLEventFactoryNewInstanceTest {
      * implementation of javax.xml.stream.XMLEventFactory , should return
      * newInstance of XMLEventFactory
      */
-    @Test(dataProvider = "parameters")
+    @ParameterizedTest
+    @MethodSource("getValidateParameters")
     public void testNewFactory(String factoryId, ClassLoader classLoader) {
-        setSystemProperty(XMLEVENT_FACTORY_ID, XMLEVENT_FACTORY_CLASSNAME);
+        System.setProperty(XMLEVENT_FACTORY_ID, XMLEVENT_FACTORY_CLASSNAME);
         try {
             XMLEventFactory xef = XMLEventFactory.newFactory(factoryId, classLoader);
             assertNotNull(xef);
         } finally {
-            clearSystemProperty(XMLEVENT_FACTORY_ID);
+            System.clearProperty(XMLEVENT_FACTORY_ID);
         }
     }
 
@@ -96,9 +95,10 @@ public class XMLEventFactoryNewInstanceTest {
      * java.lang.ClassLoader classLoader) factoryClassName is null , should
      * throw NullPointerException
      */
-    @Test(expectedExceptions = NullPointerException.class, dataProvider = "new-instance-neg", dataProviderClass = JAXPDataProvider.class)
+    @ParameterizedTest
+    @MethodSource("jaxp.library.JAXPDataProvider#newInstanceNeg")
     public void testNewFactoryNeg(String factoryId, ClassLoader classLoader) {
-        XMLEventFactory.newFactory(null, null);
+        assertThrows(NullPointerException.class, () -> XMLEventFactory.newFactory(factoryId, classLoader));
     }
 
 }
diff --git a/test/jaxp/javax/xml/jaxp/functional/javax/xml/stream/ptests/XMLInputFactoryNewInstanceTest.java b/test/jaxp/javax/xml/jaxp/functional/javax/xml/stream/ptests/XMLInputFactoryNewInstanceTest.java
index ac6b009410c..fe1ef8d746e 100644
--- a/test/jaxp/javax/xml/jaxp/functional/javax/xml/stream/ptests/XMLInputFactoryNewInstanceTest.java
+++ b/test/jaxp/javax/xml/jaxp/functional/javax/xml/stream/ptests/XMLInputFactoryNewInstanceTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1999, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1999, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,26 +23,25 @@
 
 package javax.xml.stream.ptests;
 
-import static jaxp.library.JAXPTestUtilities.setSystemProperty;
-import static jaxp.library.JAXPTestUtilities.clearSystemProperty;
-
-import static org.testng.Assert.assertNotNull;
-import static org.testng.Assert.assertNotSame;
-import static org.testng.Assert.assertSame;
-import static org.testng.Assert.assertEquals;
+import jaxp.library.JAXPDataProvider;
+import org.junit.jupiter.api.Test;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
 
 import javax.xml.stream.XMLInputFactory;
 
-import jaxp.library.JAXPDataProvider;
-
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertNotNull;
+import static org.junit.jupiter.api.Assertions.assertNotSame;
+import static org.junit.jupiter.api.Assertions.assertSame;
+import static org.junit.jupiter.api.Assertions.assertThrows;
 
 /*
  * @test
  * @bug 8169778
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm javax.xml.stream.ptests.XMLInputFactoryNewInstanceTest
+ * @build jaxp.library.JAXPDataProvider
+ * @run junit/othervm javax.xml.stream.ptests.XMLInputFactoryNewInstanceTest
  * @summary Tests for XMLInputFactory.newFactory(factoryId , classLoader)
  */
 public class XMLInputFactoryNewInstanceTest {
@@ -52,26 +51,25 @@ public class XMLInputFactoryNewInstanceTest {
     private static final String XMLINPUT_FACTORY_CLASSNAME = DEFAULT_IMPL_CLASS;
     private static final String XMLINPUT_FACTORY_ID = "javax.xml.stream.XMLInputFactory";
 
-    @DataProvider(name = "parameters")
-    public Object[][] getValidateParameters() {
+    public static Object[][] getValidateParameters() {
         return new Object[][] {
-            { XMLINPUT_FACTORY_ID, null },
-            { XMLINPUT_FACTORY_ID, this.getClass().getClassLoader() } };
+                { XMLINPUT_FACTORY_ID, null },
+                { XMLINPUT_FACTORY_ID, XMLInputFactoryNewInstanceTest.class.getClassLoader() },
+        };
     }
 
     /**
      * Test if newDefaultFactory() method returns an instance
      * of the expected factory.
-     * @throws Exception If any errors occur.
      */
     @Test
-    public void testDefaultInstance() throws Exception {
+    public void testDefaultInstance() {
         XMLInputFactory if1 = XMLInputFactory.newDefaultFactory();
         XMLInputFactory if2 = XMLInputFactory.newFactory();
         assertNotSame(if1, if2, "same instance returned:");
         assertSame(if1.getClass(), if2.getClass(),
-                  "unexpected class mismatch for newDefaultFactory():");
-        assertEquals(if1.getClass().getName(), DEFAULT_IMPL_CLASS);
+                "unexpected class mismatch for newDefaultFactory():");
+        assertEquals(DEFAULT_IMPL_CLASS, if1.getClass().getName());
     }
 
     /*
@@ -80,14 +78,15 @@ public class XMLInputFactoryNewInstanceTest {
      * implementation of javax.xml.stream.XMLInputFactory , should return
      * newInstance of XMLInputFactory
      */
-    @Test(dataProvider = "parameters")
+    @ParameterizedTest
+    @MethodSource("getValidateParameters")
     public void testNewFactory(String factoryId, ClassLoader classLoader) {
-        setSystemProperty(XMLINPUT_FACTORY_ID, XMLINPUT_FACTORY_CLASSNAME);
+        System.setProperty(XMLINPUT_FACTORY_ID, XMLINPUT_FACTORY_CLASSNAME);
         try {
             XMLInputFactory xif = XMLInputFactory.newFactory(factoryId, classLoader);
             assertNotNull(xif);
         } finally {
-            clearSystemProperty(XMLINPUT_FACTORY_ID);
+            System.clearProperty(XMLINPUT_FACTORY_ID);
         }
     }
 
@@ -96,9 +95,10 @@ public class XMLInputFactoryNewInstanceTest {
      * java.lang.ClassLoader classLoader) factoryClassName is null , should
      * throw NullPointerException
      */
-    @Test(expectedExceptions = NullPointerException.class, dataProvider = "new-instance-neg", dataProviderClass = JAXPDataProvider.class)
+    @ParameterizedTest
+    @MethodSource("jaxp.library.JAXPDataProvider#newInstanceNeg")
     public void testNewFactoryNeg(String factoryId, ClassLoader classLoader) {
-        XMLInputFactory.newFactory(factoryId, classLoader);
+        assertThrows(NullPointerException.class, () -> XMLInputFactory.newFactory(factoryId, classLoader));
     }
 
 }
diff --git a/test/jaxp/javax/xml/jaxp/functional/javax/xml/stream/ptests/XMLOutputFactoryNewInstanceTest.java b/test/jaxp/javax/xml/jaxp/functional/javax/xml/stream/ptests/XMLOutputFactoryNewInstanceTest.java
index fa406024834..b531759f0f7 100644
--- a/test/jaxp/javax/xml/jaxp/functional/javax/xml/stream/ptests/XMLOutputFactoryNewInstanceTest.java
+++ b/test/jaxp/javax/xml/jaxp/functional/javax/xml/stream/ptests/XMLOutputFactoryNewInstanceTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2016, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2016, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,26 +23,25 @@
 
 package javax.xml.stream.ptests;
 
-import static jaxp.library.JAXPTestUtilities.setSystemProperty;
-import static jaxp.library.JAXPTestUtilities.clearSystemProperty;
-
-import static org.testng.Assert.assertNotNull;
-import static org.testng.Assert.assertNotSame;
-import static org.testng.Assert.assertSame;
-import static org.testng.Assert.assertEquals;
+import jaxp.library.JAXPDataProvider;
+import org.junit.jupiter.api.Test;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
 
 import javax.xml.stream.XMLOutputFactory;
 
-import jaxp.library.JAXPDataProvider;
-
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertNotNull;
+import static org.junit.jupiter.api.Assertions.assertNotSame;
+import static org.junit.jupiter.api.Assertions.assertSame;
+import static org.junit.jupiter.api.Assertions.assertThrows;
 
 /*
  * @test
  * @bug 8169778
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm javax.xml.stream.ptests.XMLOutputFactoryNewInstanceTest
+ * @build jaxp.library.JAXPDataProvider
+ * @run junit/othervm javax.xml.stream.ptests.XMLOutputFactoryNewInstanceTest
  * @summary Tests for XMLOutputFactory.newFactory(factoryId , classLoader)
  */
 public class XMLOutputFactoryNewInstanceTest {
@@ -52,26 +51,25 @@ public class XMLOutputFactoryNewInstanceTest {
     private static final String XMLOUTPUT_FACTORY_CLASSNAME = DEFAULT_IMPL_CLASS;
     private static final String XMLOUTPUT_FACTORY_ID = "javax.xml.stream.XMLOutputFactory";
 
-    @DataProvider(name = "parameters")
-    public Object[][] getValidateParameters() {
+    public static Object[][] getValidateParameters() {
         return new Object[][] {
-            { XMLOUTPUT_FACTORY_ID, null },
-            { XMLOUTPUT_FACTORY_ID, this.getClass().getClassLoader() } };
+                { XMLOUTPUT_FACTORY_ID, null },
+                { XMLOUTPUT_FACTORY_ID, XMLOutputFactoryNewInstanceTest.class.getClassLoader() },
+        };
     }
 
     /**
      * Test if newDefaultFactory() method returns an instance
      * of the expected factory.
-     * @throws Exception If any errors occur.
      */
     @Test
-    public void testDefaultInstance() throws Exception {
+    public void testDefaultInstance() {
         XMLOutputFactory of1 = XMLOutputFactory.newDefaultFactory();
         XMLOutputFactory of2 = XMLOutputFactory.newFactory();
         assertNotSame(of1, of2, "same instance returned:");
         assertSame(of1.getClass(), of2.getClass(),
-                  "unexpected class mismatch for newDefaultFactory():");
-        assertEquals(of1.getClass().getName(), DEFAULT_IMPL_CLASS);
+                "unexpected class mismatch for newDefaultFactory():");
+        assertEquals(DEFAULT_IMPL_CLASS, of1.getClass().getName());
     }
 
     /*
@@ -80,14 +78,15 @@ public class XMLOutputFactoryNewInstanceTest {
      * implementation of javax.xml.stream.XMLOutputFactory , should return
      * newInstance of XMLOutputFactory
      */
-    @Test(dataProvider = "parameters")
+    @ParameterizedTest
+    @MethodSource("getValidateParameters")
     public void testNewFactory(String factoryId, ClassLoader classLoader) {
-        setSystemProperty(XMLOUTPUT_FACTORY_ID, XMLOUTPUT_FACTORY_CLASSNAME);
+        System.setProperty(XMLOUTPUT_FACTORY_ID, XMLOUTPUT_FACTORY_CLASSNAME);
         try {
             XMLOutputFactory xif = XMLOutputFactory.newFactory(factoryId, classLoader);
             assertNotNull(xif);
         } finally {
-            clearSystemProperty(XMLOUTPUT_FACTORY_ID);
+            System.clearProperty(XMLOUTPUT_FACTORY_ID);
         }
     }
 
@@ -96,9 +95,10 @@ public class XMLOutputFactoryNewInstanceTest {
      * java.lang.ClassLoader classLoader) factoryClassName is null , should
      * throw NullPointerException
      */
-    @Test(expectedExceptions = NullPointerException.class, dataProvider = "new-instance-neg", dataProviderClass = JAXPDataProvider.class)
+    @ParameterizedTest
+    @MethodSource("jaxp.library.JAXPDataProvider#newInstanceNeg")
     public void testNewFactoryNeg(String factoryId, ClassLoader classLoader) {
-        XMLOutputFactory.newFactory(factoryId, classLoader);
+        assertThrows(NullPointerException.class, () -> XMLOutputFactory.newFactory(factoryId, classLoader));
     }
 
 }
diff --git a/test/jaxp/javax/xml/jaxp/functional/javax/xml/transform/ptests/Bug6384418Test.java b/test/jaxp/javax/xml/jaxp/functional/javax/xml/transform/ptests/Bug6384418Test.java
index cbe4cc59209..5023d675093 100644
--- a/test/jaxp/javax/xml/jaxp/functional/javax/xml/transform/ptests/Bug6384418Test.java
+++ b/test/jaxp/javax/xml/jaxp/functional/javax/xml/transform/ptests/Bug6384418Test.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1999, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1999, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,10 +23,8 @@
 
 package javax.xml.transform.ptests;
 
-import static javax.xml.transform.ptests.TransformerTestConst.XML_DIR;
-
-import java.io.ByteArrayOutputStream;
-import java.io.File;
+import org.junit.jupiter.api.Test;
+import org.w3c.dom.Document;
 
 import javax.xml.parsers.DocumentBuilder;
 import javax.xml.parsers.DocumentBuilderFactory;
@@ -35,15 +33,16 @@ import javax.xml.transform.TransformerFactory;
 import javax.xml.transform.dom.DOMSource;
 import javax.xml.transform.stream.StreamResult;
 import javax.xml.transform.stream.StreamSource;
+import java.io.ByteArrayOutputStream;
+import java.io.File;
 
-import org.testng.annotations.Test;
-import org.w3c.dom.Document;
+import static javax.xml.transform.ptests.TransformerTestConst.XML_DIR;
 
 /*
  * @test
  * @bug 6384418
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm javax.xml.transform.ptests.Bug6384418Test
+ * @run junit/othervm javax.xml.transform.ptests.Bug6384418Test
  * @summary verify the transforming won't throw any exception
  */
 public class Bug6384418Test {
diff --git a/test/jaxp/javax/xml/jaxp/functional/javax/xml/transform/ptests/DOMResultTest.java b/test/jaxp/javax/xml/jaxp/functional/javax/xml/transform/ptests/DOMResultTest.java
index b26537d22bf..9229c3feb10 100644
--- a/test/jaxp/javax/xml/jaxp/functional/javax/xml/transform/ptests/DOMResultTest.java
+++ b/test/jaxp/javax/xml/jaxp/functional/javax/xml/transform/ptests/DOMResultTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,23 +23,7 @@
 
 package javax.xml.transform.ptests;
 
-import static javax.xml.transform.ptests.TransformerTestConst.GOLDEN_DIR;
-import static javax.xml.transform.ptests.TransformerTestConst.XML_DIR;
-import static jaxp.library.JAXPTestUtilities.USER_DIR;
-import static jaxp.library.JAXPTestUtilities.compareWithGold;
-import static org.testng.Assert.assertTrue;
-
-import java.io.BufferedWriter;
-import java.io.FileWriter;
-import java.io.IOException;
-
-import javax.xml.transform.TransformerFactory;
-import javax.xml.transform.dom.DOMResult;
-import javax.xml.transform.sax.SAXSource;
-import javax.xml.transform.sax.SAXTransformerFactory;
-import javax.xml.transform.sax.TransformerHandler;
-
-import org.testng.annotations.Test;
+import org.junit.jupiter.api.Test;
 import org.w3c.dom.Attr;
 import org.w3c.dom.NamedNodeMap;
 import org.w3c.dom.Node;
@@ -48,6 +32,21 @@ import org.xml.sax.InputSource;
 import org.xml.sax.XMLReader;
 import org.xml.sax.helpers.XMLReaderFactory;
 
+import javax.xml.transform.TransformerFactory;
+import javax.xml.transform.dom.DOMResult;
+import javax.xml.transform.sax.SAXSource;
+import javax.xml.transform.sax.SAXTransformerFactory;
+import javax.xml.transform.sax.TransformerHandler;
+import java.io.BufferedWriter;
+import java.io.FileWriter;
+import java.io.IOException;
+import java.nio.file.Files;
+import java.nio.file.Path;
+
+import static javax.xml.transform.ptests.TransformerTestConst.GOLDEN_DIR;
+import static javax.xml.transform.ptests.TransformerTestConst.XML_DIR;
+import static org.junit.jupiter.api.Assertions.assertLinesMatch;
+
 /**
  * DOM parse on test file to be compared with golden output file. No Exception
  * is expected.
@@ -55,7 +54,7 @@ import org.xml.sax.helpers.XMLReaderFactory;
 /*
  * @test
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm javax.xml.transform.ptests.DOMResultTest
+ * @run junit/othervm javax.xml.transform.ptests.DOMResultTest
  */
 public class DOMResultTest {
     /**
@@ -64,8 +63,8 @@ public class DOMResultTest {
      */
     @Test
     public void testcase01() throws Exception {
-        String resultFile = USER_DIR  + "domresult01.out";
-        String goldFile = GOLDEN_DIR  + "domresult01GF.out";
+        String resultFile = "domresult01.out";
+        String goldFile = GOLDEN_DIR + "domresult01GF.out";
         String xsltFile = XML_DIR + "cities.xsl";
         String xmlFile = XML_DIR + "cities.xml";
 
@@ -86,7 +85,9 @@ public class DOMResultTest {
         try (BufferedWriter writer = new BufferedWriter(new FileWriter(resultFile))) {
             writeNodes(node, writer);
         }
-        assertTrue(compareWithGold(goldFile, resultFile));
+        assertLinesMatch(
+                Files.readAllLines(Path.of(goldFile)),
+                Files.readAllLines(Path.of(resultFile)));
     }
 
     /**
diff --git a/test/jaxp/javax/xml/jaxp/functional/javax/xml/transform/ptests/ErrorListenerTest.java b/test/jaxp/javax/xml/jaxp/functional/javax/xml/transform/ptests/ErrorListenerTest.java
index c591c18fb45..bc067cbcf33 100644
--- a/test/jaxp/javax/xml/jaxp/functional/javax/xml/transform/ptests/ErrorListenerTest.java
+++ b/test/jaxp/javax/xml/jaxp/functional/javax/xml/transform/ptests/ErrorListenerTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,19 +23,18 @@
 
 package javax.xml.transform.ptests;
 
-import static javax.xml.transform.ptests.TransformerTestConst.XML_DIR;
-import static org.testng.Assert.assertEquals;
-import static org.testng.Assert.fail;
-
-import java.io.File;
+import org.junit.jupiter.api.Test;
 
 import javax.xml.transform.ErrorListener;
 import javax.xml.transform.TransformerConfigurationException;
 import javax.xml.transform.TransformerException;
 import javax.xml.transform.TransformerFactory;
 import javax.xml.transform.stream.StreamSource;
+import java.io.File;
 
-import org.testng.annotations.Test;
+import static javax.xml.transform.ptests.TransformerTestConst.XML_DIR;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertThrows;
 
 /**
  * Class containing the test cases for ErrorListener interface
@@ -43,7 +42,7 @@ import org.testng.annotations.Test;
 /*
  * @test
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm javax.xml.transform.ptests.ErrorListenerTest
+ * @run junit/othervm javax.xml.transform.ptests.ErrorListenerTest
  */
 public class ErrorListenerTest implements ErrorListener {
     /**
@@ -63,15 +62,13 @@ public class ErrorListenerTest implements ErrorListener {
     @Test
     public void errorListener01() {
         ErrorListenerTest listener = new ErrorListenerTest();
-        try {
-            TransformerFactory tfactory = TransformerFactory.newInstance();
-            tfactory.setErrorListener (listener);
-            tfactory.newTransformer(new StreamSource(
-                                        new File(XML_DIR + "invalid.xsl")));
-            fail("Expect TransformerConfigurationException here");
-        } catch (TransformerConfigurationException ex) {
-            assertEquals(listener.status, ListenerStatus.FATAL);
-        }
+        TransformerFactory tfactory = TransformerFactory.newInstance();
+        tfactory.setErrorListener(listener);
+        StreamSource source = new StreamSource(new File(XML_DIR + "invalid.xsl"));
+        assertThrows(
+                TransformerConfigurationException.class,
+                () -> tfactory.newTransformer(source));
+        assertEquals(ListenerStatus.FATAL, listener.status);
     }
 
     /**
diff --git a/test/jaxp/javax/xml/jaxp/functional/javax/xml/transform/ptests/SAXSourceTest.java b/test/jaxp/javax/xml/jaxp/functional/javax/xml/transform/ptests/SAXSourceTest.java
index 3e50e8bb79e..851ed676f3a 100644
--- a/test/jaxp/javax/xml/jaxp/functional/javax/xml/transform/ptests/SAXSourceTest.java
+++ b/test/jaxp/javax/xml/jaxp/functional/javax/xml/transform/ptests/SAXSourceTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,22 +23,21 @@
 
 package javax.xml.transform.ptests;
 
-import static javax.xml.transform.ptests.TransformerTestConst.XML_DIR;
-import static org.testng.Assert.assertEquals;
-import static org.testng.Assert.assertNotNull;
-import static org.testng.Assert.assertNull;
-
-import java.io.File;
-import java.io.FileInputStream;
-import java.io.IOException;
+import org.junit.jupiter.api.Test;
+import org.xml.sax.InputSource;
 
 import javax.xml.parsers.DocumentBuilderFactory;
 import javax.xml.transform.dom.DOMSource;
 import javax.xml.transform.sax.SAXSource;
 import javax.xml.transform.stream.StreamSource;
+import java.io.File;
+import java.io.FileInputStream;
+import java.io.IOException;
 
-import org.testng.annotations.Test;
-import org.xml.sax.InputSource;
+import static javax.xml.transform.ptests.TransformerTestConst.XML_DIR;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertNotNull;
+import static org.junit.jupiter.api.Assertions.assertNull;
 
 
 /**
@@ -47,7 +46,7 @@ import org.xml.sax.InputSource;
 /*
  * @test
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm javax.xml.transform.ptests.SAXSourceTest
+ * @run junit/othervm javax.xml.transform.ptests.SAXSourceTest
  */
 public class SAXSourceTest {
     /**
@@ -57,8 +56,6 @@ public class SAXSourceTest {
 
     /**
      * Test obtaining a SAX InputSource object from a Source object.
-     *
-     * @throws IOException reading file error.
      */
     @Test
     public void source2inputsource01() throws IOException {
@@ -72,8 +69,6 @@ public class SAXSourceTest {
      * This test case tries to get InputSource from DOMSource using
      * sourceToInputSource method. It is not possible and hence null is
      * expected. This is a negative test case,
-     *
-     * @throws Exception If any errors occur.
      */
     @Test
     public void source2inputsource02() throws Exception {
@@ -87,8 +82,6 @@ public class SAXSourceTest {
      * This test case tries to get InputSource from SAXSource using
      * sourceToInputSource method. This will also check if the systemId
      * remained the same. This is a positive test case.
-     *
-     * @throws IOException reading file error.
      */
     @Test
     public void source2inputsource03() throws IOException {
@@ -97,8 +90,7 @@ public class SAXSourceTest {
             SAXSource saxSource =
                     new SAXSource(new InputSource(fis));
             saxSource.setSystemId(SYSTEM_ID);
-            assertEquals(SAXSource.sourceToInputSource(saxSource).getSystemId(),
-                    SYSTEM_ID);
+            assertEquals(SYSTEM_ID, SAXSource.sourceToInputSource(saxSource).getSystemId());
         }
     }
 }
diff --git a/test/jaxp/javax/xml/jaxp/functional/javax/xml/transform/ptests/SAXTFactoryTest.java b/test/jaxp/javax/xml/jaxp/functional/javax/xml/transform/ptests/SAXTFactoryTest.java
index 0e1eabfa8fe..9c12cb9f119 100644
--- a/test/jaxp/javax/xml/jaxp/functional/javax/xml/transform/ptests/SAXTFactoryTest.java
+++ b/test/jaxp/javax/xml/jaxp/functional/javax/xml/transform/ptests/SAXTFactoryTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,15 +23,14 @@
 
 package javax.xml.transform.ptests;
 
-import static javax.xml.transform.ptests.TransformerTestConst.GOLDEN_DIR;
-import static javax.xml.transform.ptests.TransformerTestConst.XML_DIR;
-import static jaxp.library.JAXPTestUtilities.USER_DIR;
-import static jaxp.library.JAXPTestUtilities.compareWithGold;
-import static org.testng.Assert.assertTrue;
-
-import java.io.File;
-import java.io.FileInputStream;
-import java.io.FileOutputStream;
+import org.junit.jupiter.api.Test;
+import org.w3c.dom.Document;
+import org.w3c.dom.Node;
+import org.xml.sax.InputSource;
+import org.xml.sax.SAXException;
+import org.xml.sax.XMLFilter;
+import org.xml.sax.XMLReader;
+import org.xml.sax.helpers.XMLReaderFactory;
 
 import javax.xml.parsers.DocumentBuilder;
 import javax.xml.parsers.DocumentBuilderFactory;
@@ -45,14 +44,17 @@ import javax.xml.transform.sax.TemplatesHandler;
 import javax.xml.transform.sax.TransformerHandler;
 import javax.xml.transform.stream.StreamResult;
 import javax.xml.transform.stream.StreamSource;
+import java.io.File;
+import java.io.FileInputStream;
+import java.io.FileOutputStream;
+import java.io.IOException;
+import java.nio.file.Files;
+import java.nio.file.Path;
 
-import org.testng.annotations.Test;
-import org.w3c.dom.Document;
-import org.w3c.dom.Node;
-import org.xml.sax.InputSource;
-import org.xml.sax.XMLFilter;
-import org.xml.sax.XMLReader;
-import org.xml.sax.helpers.XMLReaderFactory;
+import static javax.xml.transform.ptests.TransformerTestConst.GOLDEN_DIR;
+import static javax.xml.transform.ptests.TransformerTestConst.XML_DIR;
+import static org.junit.jupiter.api.Assertions.assertLinesMatch;
+import static org.junit.jupiter.api.Assertions.assertThrows;
 
 /**
  * Test newTransformerhandler() method which takes StreamSource as argument can
@@ -61,7 +63,7 @@ import org.xml.sax.helpers.XMLReaderFactory;
 /*
  * @test
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm javax.xml.transform.ptests.SAXTFactoryTest
+ * @run junit/othervm javax.xml.transform.ptests.SAXTFactoryTest
  */
 public class SAXTFactoryTest {
     /**
@@ -84,16 +86,14 @@ public class SAXTFactoryTest {
      * argument can be set to XMLReader. SAXSource has input XML file as its
      * input source. XMLReader has a transformer handler which write out the
      * result to output file. Test verifies output file is same as golden file.
-     *
-     * @throws Exception If any errors occur.
      */
     @Test
     public void testcase01() throws Exception {
-        String outputFile = USER_DIR + "saxtf001.out";
+        String outputFile = "saxtf001.out";
         String goldFile = GOLDEN_DIR + "saxtf001GF.out";
 
         try (FileOutputStream fos = new FileOutputStream(outputFile)) {
-            XMLReader reader = XMLReaderFactory.createXMLReader();
+            XMLReader reader = getXmlReader();
             SAXTransformerFactory saxTFactory
                     = (SAXTransformerFactory) TransformerFactory.newInstance();
             TransformerHandler handler = saxTFactory.newTransformerHandler(new StreamSource(XSLT_FILE));
@@ -102,7 +102,7 @@ public class SAXTFactoryTest {
             reader.setContentHandler(handler);
             reader.parse(XML_FILE);
         }
-        assertTrue(compareWithGold(goldFile, outputFile));
+        assertFileLines(goldFile, outputFile);
     }
 
     /**
@@ -110,17 +110,15 @@ public class SAXTFactoryTest {
      * argument can be set to XMLReader. SAXSource has input XML file as its
      * input source. XMLReader has a content handler which write out the result
      * to output file. Test verifies output file is same as golden file.
-     *
-     * @throws Exception If any errors occur.
      */
     @Test
     public void testcase02() throws Exception {
-        String outputFile = USER_DIR + "saxtf002.out";
+        String outputFile = "saxtf002.out";
         String goldFile = GOLDEN_DIR + "saxtf002GF.out";
 
         try (FileOutputStream fos = new FileOutputStream(outputFile);
-                FileInputStream fis = new FileInputStream(XSLT_FILE)) {
-            XMLReader reader = XMLReaderFactory.createXMLReader();
+             FileInputStream fis = new FileInputStream(XSLT_FILE)) {
+            XMLReader reader = getXmlReader();
             SAXTransformerFactory saxTFactory
                     = (SAXTransformerFactory) TransformerFactory.newInstance();
             SAXSource ss = new SAXSource();
@@ -132,18 +130,16 @@ public class SAXTFactoryTest {
             reader.setContentHandler(handler);
             reader.parse(XML_FILE);
         }
-        assertTrue(compareWithGold(goldFile, outputFile));
+        assertFileLines(goldFile, outputFile);
     }
 
     /**
      * Unit test for newTransformerhandler(Source). DcoumentBuilderFactory is
      * namespace awareness, DocumentBuilder parse xslt file as DOMSource.
-     *
-     * @throws Exception If any errors occur.
      */
     @Test
     public void testcase03() throws Exception {
-        String outputFile = USER_DIR + "saxtf003.out";
+        String outputFile = "saxtf003.out";
         String goldFile = GOLDEN_DIR + "saxtf003GF.out";
 
         try (FileOutputStream fos = new FileOutputStream(outputFile)) {
@@ -151,10 +147,9 @@ public class SAXTFactoryTest {
             dbf.setNamespaceAware(true);
             DocumentBuilder docBuilder = dbf.newDocumentBuilder();
             Document document = docBuilder.parse(new File(XSLT_FILE));
-            Node node = (Node)document;
-            DOMSource domSource= new DOMSource(node);
+            DOMSource domSource = new DOMSource(document);
 
-            XMLReader reader = XMLReaderFactory.createXMLReader();
+            XMLReader reader = getXmlReader();
             SAXTransformerFactory saxTFactory
                     = (SAXTransformerFactory)TransformerFactory.newInstance();
             TransformerHandler handler =
@@ -164,15 +159,13 @@ public class SAXTFactoryTest {
             reader.setContentHandler(handler);
             reader.parse(XML_FILE);
         }
-        assertTrue(compareWithGold(goldFile, outputFile));
+        assertFileLines(goldFile, outputFile);
     }
 
     /**
      * Negative test for newTransformerHandler when relative URI is in XML file.
-     *
-     * @throws Exception If any errors occur.
      */
-    @Test(expectedExceptions = TransformerConfigurationException.class)
+    @Test
     public void transformerHandlerTest04() throws Exception {
         DocumentBuilderFactory dbf = DocumentBuilderFactory.newInstance();
         dbf.setNamespaceAware(true);
@@ -180,31 +173,28 @@ public class SAXTFactoryTest {
         Document document = docBuilder.parse(new File(XSLT_INCL_FILE));
         DOMSource domSource= new DOMSource(document);
         SAXTransformerFactory saxTFactory
-                = (SAXTransformerFactory)TransformerFactory.newInstance();
-        saxTFactory.newTransformerHandler(domSource);
+                = (SAXTransformerFactory) TransformerFactory.newInstance();
+        assertThrows(TransformerConfigurationException.class, () -> saxTFactory.newTransformerHandler(domSource));
     }
 
     /**
      * Unit test for XMLReader parsing when relative URI is used in xsl file and
      * SystemId was set.
-     *
-     * @throws Exception If any errors occur.
      */
     @Test
     public void testcase05() throws Exception {
-        String outputFile = USER_DIR + "saxtf005.out";
+        String outputFile = "saxtf005.out";
         String goldFile = GOLDEN_DIR + "saxtf005GF.out";
 
         try (FileOutputStream fos = new FileOutputStream(outputFile)) {
-            XMLReader reader = XMLReaderFactory.createXMLReader();
+            XMLReader reader = getXmlReader();
             SAXTransformerFactory saxTFactory
                     = (SAXTransformerFactory)TransformerFactory.newInstance();
             DocumentBuilderFactory dbf = DocumentBuilderFactory.newInstance();
             dbf.setNamespaceAware(true);
             DocumentBuilder docBuilder = dbf.newDocumentBuilder();
             Document document = docBuilder.parse(new File(XSLT_INCL_FILE));
-            Node node = (Node)document;
-            DOMSource domSource= new DOMSource(node);
+            DOMSource domSource = new DOMSource(document);
 
             domSource.setSystemId("file:///" + XML_DIR);
 
@@ -216,28 +206,26 @@ public class SAXTFactoryTest {
             reader.setContentHandler(handler);
             reader.parse(XML_FILE);
         }
-        assertTrue(compareWithGold(goldFile, outputFile));
+        assertFileLines(goldFile, outputFile);
     }
 
     /**
      * Unit test newTransformerHandler with a DOMSource.
-     *
-     * @throws Exception If any errors occur.
      */
     @Test
     public void testcase06() throws Exception {
-        String outputFile = USER_DIR + "saxtf006.out";
+        String outputFile = "saxtf006.out";
         String goldFile = GOLDEN_DIR + "saxtf006GF.out";
 
         try (FileOutputStream fos = new FileOutputStream(outputFile)) {
-            XMLReader reader = XMLReaderFactory.createXMLReader();
+            XMLReader reader = getXmlReader();
             SAXTransformerFactory saxTFactory
                     = (SAXTransformerFactory)TransformerFactory.newInstance();
 
             DocumentBuilderFactory dbf = DocumentBuilderFactory.newInstance();
             dbf.setNamespaceAware(true);
             DocumentBuilder docBuilder = dbf.newDocumentBuilder();
-            Node node = (Node)docBuilder.parse(new File(XSLT_INCL_FILE));
+            Node node = docBuilder.parse(new File(XSLT_INCL_FILE));
 
             DOMSource domSource = new DOMSource(node, "file:///" + XML_DIR);
             TransformerHandler handler =
@@ -248,20 +236,19 @@ public class SAXTFactoryTest {
             reader.setContentHandler(handler);
             reader.parse(XML_FILE);
         }
-        assertTrue(compareWithGold(goldFile, outputFile));
+        assertFileLines(goldFile, outputFile);
     }
 
     /**
      * Test newTransformerHandler with a Template Handler.
-     *
-     * @throws Exception If any errors occur.
      */
+    @Test
     public void testcase08() throws Exception {
-        String outputFile = USER_DIR + "saxtf008.out";
+        String outputFile = "saxtf008.out";
         String goldFile = GOLDEN_DIR + "saxtf008GF.out";
 
         try (FileOutputStream fos = new FileOutputStream(outputFile)) {
-            XMLReader reader = XMLReaderFactory.createXMLReader();
+            XMLReader reader = getXmlReader();
             SAXTransformerFactory saxTFactory
                     = (SAXTransformerFactory)TransformerFactory.newInstance();
 
@@ -277,22 +264,20 @@ public class SAXTFactoryTest {
             reader.setContentHandler(tfhandler);
             reader.parse(XML_FILE);
         }
-        assertTrue(compareWithGold(goldFile, outputFile));
+        assertFileLines(goldFile, outputFile);
     }
 
     /**
      * Test newTransformerHandler with a Template Handler along with a relative
      * URI in the style-sheet file.
-     *
-     * @throws Exception If any errors occur.
      */
     @Test
     public void testcase09() throws Exception {
-        String outputFile = USER_DIR + "saxtf009.out";
+        String outputFile = "saxtf009.out";
         String goldFile = GOLDEN_DIR + "saxtf009GF.out";
 
         try (FileOutputStream fos = new FileOutputStream(outputFile)) {
-            XMLReader reader = XMLReaderFactory.createXMLReader();
+            XMLReader reader = getXmlReader();
             SAXTransformerFactory saxTFactory
                     = (SAXTransformerFactory)TransformerFactory.newInstance();
 
@@ -307,21 +292,19 @@ public class SAXTFactoryTest {
             reader.setContentHandler(tfhandler);
             reader.parse(XML_FILE);
         }
-        assertTrue(compareWithGold(goldFile, outputFile));
+        assertFileLines(goldFile, outputFile);
     }
 
     /**
      * Unit test for contentHandler setter/getter along reader as handler's
      * parent.
-     *
-     * @throws Exception If any errors occur.
      */
     @Test
     public void testcase10() throws Exception {
-        String outputFile = USER_DIR + "saxtf010.out";
+        String outputFile = "saxtf010.out";
         String goldFile = GOLDEN_DIR + "saxtf010GF.out";
         // The transformer will use a SAX parser as it's reader.
-        XMLReader reader = XMLReaderFactory.createXMLReader();
+        XMLReader reader = getXmlReader();
         SAXTransformerFactory saxTFactory
                 = (SAXTransformerFactory)TransformerFactory.newInstance();
         XMLFilter filter =
@@ -333,26 +316,23 @@ public class SAXTFactoryTest {
         // the content handler for the parser object (it's "parent"), and
         // will then call the parse method on the parser.
         filter.parse(new InputSource(XML_FILE));
-        assertTrue(compareWithGold(goldFile, outputFile));
+        assertFileLines(goldFile, outputFile);
     }
 
     /**
      * Unit test for contentHandler setter/getter with parent.
-     *
-     * @throws Exception If any errors occur.
      */
     @Test
     public void testcase11() throws Exception {
-        String outputFile = USER_DIR + "saxtf011.out";
+        String outputFile = "saxtf011.out";
         String goldFile = GOLDEN_DIR + "saxtf011GF.out";
         // The transformer will use a SAX parser as it's reader.
-        XMLReader reader = XMLReaderFactory.createXMLReader();
+        XMLReader reader = getXmlReader();
         DocumentBuilderFactory dbf = DocumentBuilderFactory.newInstance();
         dbf.setNamespaceAware(true);
         DocumentBuilder docBuilder = dbf.newDocumentBuilder();
         Document document = docBuilder.parse(new File(XSLT_FILE));
-        Node node = (Node)document;
-        DOMSource domSource= new DOMSource(node);
+        DOMSource domSource = new DOMSource(document);
 
         SAXTransformerFactory saxTFactory
                 = (SAXTransformerFactory)TransformerFactory.newInstance();
@@ -365,20 +345,18 @@ public class SAXTFactoryTest {
         // the content handler for the parser object (it's "parent"), and
         // will then call the parse method on the parser.
         filter.parse(new InputSource(XML_FILE));
-        assertTrue(compareWithGold(goldFile, outputFile));
+        assertFileLines(goldFile, outputFile);
     }
 
     /**
      * Unit test for contentHandler setter/getter.
-     *
-     * @throws Exception If any errors occur.
      */
     @Test
     public void testcase12() throws Exception {
-        String outputFile = USER_DIR + "saxtf012.out";
+        String outputFile = "saxtf012.out";
         String goldFile = GOLDEN_DIR + "saxtf012GF.out";
         // The transformer will use a SAX parser as it's reader.
-        XMLReader reader = XMLReaderFactory.createXMLReader();
+        XMLReader reader = getXmlReader();
 
         InputSource is = new InputSource(new FileInputStream(XSLT_FILE));
         SAXSource saxSource = new SAXSource();
@@ -394,27 +372,26 @@ public class SAXTFactoryTest {
         // the content handler for the parser object (it's "parent"), and
         // will then call the parse method on the parser.
         filter.parse(new InputSource(XML_FILE));
-        assertTrue(compareWithGold(goldFile, outputFile));
+        assertFileLines(goldFile, outputFile);
     }
 
     /**
      * Unit test for TemplatesHandler setter/getter.
-     *
-     * @throws Exception If any errors occur.
      */
     @Test
     public void testcase13() throws Exception {
-        String outputFile = USER_DIR + "saxtf013.out";
+        String outputFile = "saxtf013.out";
         String goldFile = GOLDEN_DIR + "saxtf013GF.out";
         try(FileInputStream fis = new FileInputStream(XML_FILE)) {
             // The transformer will use a SAX parser as it's reader.
-            XMLReader reader = XMLReaderFactory.createXMLReader();
+            XMLReader reader = getXmlReader();
 
             SAXTransformerFactory saxTFactory
                     = (SAXTransformerFactory) TransformerFactory.newInstance();
             TemplatesHandler thandler = saxTFactory.newTemplatesHandler();
-            // I have put this as it was complaining about systemid
-            thandler.setSystemId("file:///" + USER_DIR);
+            // Set the root directory as the ID so the handler can resolve relative paths.
+            String rootDirUri = Path.of(".").toAbsolutePath().toUri().toASCIIString();
+            thandler.setSystemId(rootDirUri);
 
             reader.setContentHandler(thandler);
             reader.parse(XSLT_FILE);
@@ -425,6 +402,17 @@ public class SAXTFactoryTest {
             filter.setContentHandler(new MyContentHandler(outputFile));
             filter.parse(new InputSource(fis));
         }
-        assertTrue(compareWithGold(goldFile, outputFile));
+        assertFileLines(goldFile, outputFile);
+    }
+
+    @SuppressWarnings("deprecation")
+    private static XMLReader getXmlReader() throws SAXException {
+        return XMLReaderFactory.createXMLReader();
+    }
+
+    private static void assertFileLines(String goldenFile, String actualFile) throws IOException {
+        assertLinesMatch(
+                Files.readAllLines(Path.of(goldenFile)),
+                Files.readAllLines(Path.of(actualFile)));
     }
 }
diff --git a/test/jaxp/javax/xml/jaxp/functional/javax/xml/transform/ptests/StreamResultTest.java b/test/jaxp/javax/xml/jaxp/functional/javax/xml/transform/ptests/StreamResultTest.java
index 6002e371523..abd15888493 100644
--- a/test/jaxp/javax/xml/jaxp/functional/javax/xml/transform/ptests/StreamResultTest.java
+++ b/test/jaxp/javax/xml/jaxp/functional/javax/xml/transform/ptests/StreamResultTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -22,15 +22,9 @@
  */
 package javax.xml.transform.ptests;
 
-import static javax.xml.transform.ptests.TransformerTestConst.XML_DIR;
-import static jaxp.library.JAXPTestUtilities.USER_DIR;
-import static jaxp.library.JAXPTestUtilities.failUnexpected;
-
-import java.io.File;
-import java.io.FileInputStream;
-import java.io.IOException;
-import java.util.Arrays;
-import java.util.Properties;
+import org.junit.jupiter.api.Test;
+import org.w3c.dom.Document;
+import org.xml.sax.SAXException;
 
 import javax.xml.parsers.DocumentBuilder;
 import javax.xml.parsers.DocumentBuilderFactory;
@@ -41,10 +35,14 @@ import javax.xml.transform.TransformerFactory;
 import javax.xml.transform.dom.DOMSource;
 import javax.xml.transform.stream.StreamResult;
 import javax.xml.transform.stream.StreamSource;
+import java.io.File;
+import java.io.FileInputStream;
+import java.io.IOException;
+import java.util.Arrays;
+import java.util.Properties;
 
-import org.testng.annotations.Test;
-import org.w3c.dom.Document;
-import org.xml.sax.SAXException;
+import static javax.xml.transform.ptests.TransformerTestConst.XML_DIR;
+import static org.junit.jupiter.api.Assertions.fail;
 
 /**
  * Test a StreamResult using a file name that contains URL characters that need
@@ -53,7 +51,7 @@ import org.xml.sax.SAXException;
 /*
  * @test
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm javax.xml.transform.ptests.StreamResultTest
+ * @run junit/othervm javax.xml.transform.ptests.StreamResultTest
  */
 public class StreamResultTest {
     /**
@@ -90,15 +88,15 @@ public class StreamResultTest {
                 DOMSource domSource = new DOMSource(document);
                 StreamSource streamSource = new StreamSource(new FileInputStream(xmlFile));
 
-                File streamResultFile = new File(USER_DIR + file);
+                File streamResultFile = new File(file);
                 StreamResult streamResult = new StreamResult(streamResultFile);
 
                 Transformer transformer = TransformerFactory.newInstance().newTransformer(domSource);
                 transformer.setOutputProperties(transformProperties);
                 transformer.transform(streamSource, streamResult);
             } catch (SAXException | IOException | ParserConfigurationException
-                    | TransformerException ex) {
-                failUnexpected(ex);
+                     | TransformerException ex) {
+                fail(ex);
             }
         });
     }
diff --git a/test/jaxp/javax/xml/jaxp/functional/javax/xml/transform/ptests/TfClearParamTest.java b/test/jaxp/javax/xml/jaxp/functional/javax/xml/transform/ptests/TfClearParamTest.java
index f647d4c0bf1..01dcf3e6b97 100644
--- a/test/jaxp/javax/xml/jaxp/functional/javax/xml/transform/ptests/TfClearParamTest.java
+++ b/test/jaxp/javax/xml/jaxp/functional/javax/xml/transform/ptests/TfClearParamTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -22,12 +22,10 @@
  */
 package javax.xml.transform.ptests;
 
-import static javax.xml.transform.ptests.TransformerTestConst.XML_DIR;
-import static org.testng.Assert.assertEquals;
-import static org.testng.Assert.assertNull;
-
-import java.io.File;
-import java.io.FileInputStream;
+import org.junit.jupiter.api.Test;
+import org.w3c.dom.Document;
+import org.w3c.dom.Node;
+import org.xml.sax.InputSource;
 
 import javax.xml.parsers.DocumentBuilder;
 import javax.xml.parsers.DocumentBuilderFactory;
@@ -37,11 +35,12 @@ import javax.xml.transform.TransformerFactory;
 import javax.xml.transform.dom.DOMSource;
 import javax.xml.transform.sax.SAXSource;
 import javax.xml.transform.stream.StreamSource;
+import java.io.File;
+import java.io.FileInputStream;
 
-import org.testng.annotations.Test;
-import org.w3c.dom.Document;
-import org.w3c.dom.Node;
-import org.xml.sax.InputSource;
+import static javax.xml.transform.ptests.TransformerTestConst.XML_DIR;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertNull;
 
 /**
  * Class containing the test cases for SAXParserFactory API
@@ -49,7 +48,7 @@ import org.xml.sax.InputSource;
 /*
  * @test
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm javax.xml.transform.ptests.TfClearParamTest
+ * @run junit/othervm javax.xml.transform.ptests.TfClearParamTest
  */
 public class TfClearParamTest {
     /**
@@ -82,7 +81,7 @@ public class TfClearParamTest {
     public void clear01() throws TransformerConfigurationException {
         Transformer transformer = TransformerFactory.newInstance().newTransformer();
         transformer.setParameter(LONG_PARAM_NAME, PARAM_VALUE);
-        assertEquals(transformer.getParameter(LONG_PARAM_NAME).toString(), PARAM_VALUE);
+        assertEquals(PARAM_VALUE, transformer.getParameter(LONG_PARAM_NAME).toString());
     }
 
     /**
@@ -124,9 +123,9 @@ public class TfClearParamTest {
     public void clear04() throws TransformerConfigurationException {
         Transformer transformer = TransformerFactory.newInstance().newTransformer();
 
-        int intObject = 5;
-        transformer.setParameter(SHORT_PARAM_NAME, intObject);
-        assertEquals(transformer.getParameter(SHORT_PARAM_NAME), intObject);
+        int expectedIntValue = 5;
+        transformer.setParameter(SHORT_PARAM_NAME, expectedIntValue);
+        assertEquals(expectedIntValue, transformer.getParameter(SHORT_PARAM_NAME));
     }
 
     /**
@@ -141,7 +140,7 @@ public class TfClearParamTest {
                 newTransformer(new StreamSource(new File(XSL_FILE)));
 
         transformer.setParameter(LONG_PARAM_NAME, PARAM_VALUE);
-        assertEquals(transformer.getParameter(LONG_PARAM_NAME), PARAM_VALUE);
+        assertEquals(PARAM_VALUE, transformer.getParameter(LONG_PARAM_NAME));
     }
 
     /**
@@ -172,7 +171,7 @@ public class TfClearParamTest {
 
             Transformer transformer = TransformerFactory.newInstance().newTransformer(saxSource);
             transformer.setParameter(LONG_PARAM_NAME, PARAM_VALUE);
-            assertEquals(transformer.getParameter(LONG_PARAM_NAME), PARAM_VALUE);
+            assertEquals(PARAM_VALUE, transformer.getParameter(LONG_PARAM_NAME));
         }
     }
 
@@ -212,7 +211,7 @@ public class TfClearParamTest {
         Transformer transformer = tfactory.newTransformer(domSource);
 
         transformer.setParameter(LONG_PARAM_NAME, PARAM_VALUE);
-        assertEquals(transformer.getParameter(LONG_PARAM_NAME), PARAM_VALUE);
+        assertEquals(PARAM_VALUE, transformer.getParameter(LONG_PARAM_NAME));
     }
 
     /**
diff --git a/test/jaxp/javax/xml/jaxp/functional/javax/xml/transform/ptests/TransformTest.java b/test/jaxp/javax/xml/jaxp/functional/javax/xml/transform/ptests/TransformTest.java
index 8666306669d..1d9600b330b 100644
--- a/test/jaxp/javax/xml/jaxp/functional/javax/xml/transform/ptests/TransformTest.java
+++ b/test/jaxp/javax/xml/jaxp/functional/javax/xml/transform/ptests/TransformTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1999, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1999, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,18 +23,19 @@
 
 package javax.xml.transform.ptests;
 
-import static javax.xml.transform.ptests.TransformerTestConst.XML_DIR;
-
-import java.io.BufferedWriter;
-import java.io.ByteArrayInputStream;
-import java.io.ByteArrayOutputStream;
-import java.io.IOException;
-import java.io.InputStream;
-import java.io.OutputStream;
-import java.io.OutputStreamWriter;
-import java.nio.file.Files;
-import java.nio.file.Paths;
-import java.util.function.Supplier;
+import org.junit.jupiter.api.BeforeAll;
+import org.junit.jupiter.api.TestInstance;
+import org.junit.jupiter.api.TestInstance.Lifecycle;
+import org.junit.jupiter.api.parallel.Execution;
+import org.junit.jupiter.api.parallel.ExecutionMode;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
+import org.w3c.dom.Document;
+import org.xml.sax.Attributes;
+import org.xml.sax.ContentHandler;
+import org.xml.sax.InputSource;
+import org.xml.sax.Locator;
+import org.xml.sax.SAXException;
 
 import javax.xml.parsers.DocumentBuilder;
 import javax.xml.parsers.DocumentBuilderFactory;
@@ -56,30 +57,33 @@ import javax.xml.transform.stax.StAXResult;
 import javax.xml.transform.stax.StAXSource;
 import javax.xml.transform.stream.StreamResult;
 import javax.xml.transform.stream.StreamSource;
+import java.io.BufferedWriter;
+import java.io.ByteArrayInputStream;
+import java.io.ByteArrayOutputStream;
+import java.io.IOException;
+import java.io.InputStream;
+import java.io.OutputStream;
+import java.io.OutputStreamWriter;
+import java.nio.file.Files;
+import java.nio.file.Paths;
+import java.util.function.Supplier;
 
-import org.testng.annotations.BeforeClass;
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
-import org.w3c.dom.Document;
-import org.xml.sax.Attributes;
-import org.xml.sax.ContentHandler;
-import org.xml.sax.InputSource;
-import org.xml.sax.Locator;
-import org.xml.sax.SAXException;
+import static javax.xml.transform.ptests.TransformerTestConst.XML_DIR;
 
 /*
  * @test
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm javax.xml.transform.ptests.TransformTest
+ * @run junit/othervm javax.xml.transform.ptests.TransformTest
  * @summary Tests for variable combination of Transformer.transform(Source, Result)
  */
-@Test(singleThreaded = true)
+@TestInstance(Lifecycle.PER_CLASS)
+@Execution(ExecutionMode.SAME_THREAD)
 public class TransformTest {
 
     /*
      * Initialize the share objects.
      */
-    @BeforeClass
+    @BeforeAll
     public void setup() throws Exception {
         ifac = XMLInputFactory.newInstance();
         ofac = XMLOutputFactory.newInstance();
@@ -95,7 +99,6 @@ public class TransformTest {
         xmlDoc = db.parse(xmlInputStream());
     }
 
-    @DataProvider(name = "input-provider")
     public Object[][] prepareTestCombination() throws Exception {
 
         Supplier<Source> staxStreamSource = () -> new StAXSource(getXMLStreamReader());
@@ -160,7 +163,8 @@ public class TransformTest {
     /*
      * run Transformer.transform(Source, Result)
      */
-    @Test(dataProvider = "input-provider")
+    @ParameterizedTest
+    @MethodSource("prepareTestCombination")
     public void testTransform(Supplier<Source> src, Supplier<Result> res, Transformer transformer) throws Throwable {
         try {
             transformer.transform(src.get(), res.get());
@@ -257,7 +261,7 @@ public class TransformTest {
         public void setDocumentLocator(Locator locator) {
         }
 
-        public void startDocument() throws SAXException {
+        public void startDocument() {
             String str = "startDocument";
             try {
                 bWriter.write(str, 0, str.length());
@@ -267,7 +271,7 @@ public class TransformTest {
             }
         }
 
-        public void endDocument() throws SAXException {
+        public void endDocument() {
             String str = "endDocument";
             try {
                 bWriter.write(str, 0, str.length());
@@ -279,7 +283,7 @@ public class TransformTest {
             }
         }
 
-        public void startPrefixMapping(String prefix, String uri) throws SAXException {
+        public void startPrefixMapping(String prefix, String uri) {
             String str = "startPrefixMapping: " + prefix + ", " + uri;
             try {
                 bWriter.write(str, 0, str.length());
@@ -289,7 +293,7 @@ public class TransformTest {
             }
         }
 
-        public void endPrefixMapping(String prefix) throws SAXException {
+        public void endPrefixMapping(String prefix) {
             String str = "endPrefixMapping: " + prefix;
             try {
                 bWriter.write(str, 0, str.length());
@@ -299,7 +303,7 @@ public class TransformTest {
             }
         }
 
-        public void startElement(String namespaceURI, String localName, String qName, Attributes atts) throws SAXException {
+        public void startElement(String namespaceURI, String localName, String qName, Attributes atts) {
             StringBuilder str = new StringBuilder("startElement: ").append(namespaceURI).append(", ").append(namespaceURI).append(", ").append(qName).append(" : ");
             int n = atts.getLength();
             for (int i = 0; i < n; i++) {
@@ -314,7 +318,7 @@ public class TransformTest {
             }
         }
 
-        public void endElement(String namespaceURI, String localName, String qName) throws SAXException {
+        public void endElement(String namespaceURI, String localName, String qName) {
             String str = "endElement: " + namespaceURI + ", " + namespaceURI + ", " + qName;
             try {
                 bWriter.write(str, 0, str.length());
@@ -325,7 +329,7 @@ public class TransformTest {
 
         }
 
-        public void characters(char ch[], int start, int length) throws SAXException {
+        public void characters(char ch[], int start, int length) {
             String str = new String(ch, start, length);
             try {
                 bWriter.write(str, 0, str.length());
@@ -335,7 +339,7 @@ public class TransformTest {
             }
         }
 
-        public void ignorableWhitespace(char ch[], int start, int length) throws SAXException {
+        public void ignorableWhitespace(char ch[], int start, int length) {
             String str = "ignorableWhitespace";
             try {
                 bWriter.write(str, 0, str.length());
@@ -345,7 +349,7 @@ public class TransformTest {
             }
         }
 
-        public void processingInstruction(String target, String data) throws SAXException {
+        public void processingInstruction(String target, String data) {
             String str = "processingInstruction: " + target + ", " + target;
             try {
                 bWriter.write(str, 0, str.length());
@@ -355,7 +359,7 @@ public class TransformTest {
             }
         }
 
-        public void skippedEntity(String name) throws SAXException {
+        public void skippedEntity(String name) {
             String str = "skippedEntity: " + name;
             try {
                 bWriter.write(str, 0, str.length());
diff --git a/test/jaxp/javax/xml/jaxp/functional/javax/xml/transform/ptests/TransformerExcpTest.java b/test/jaxp/javax/xml/jaxp/functional/javax/xml/transform/ptests/TransformerExcpTest.java
index 8907b7afd55..25b715864dd 100644
--- a/test/jaxp/javax/xml/jaxp/functional/javax/xml/transform/ptests/TransformerExcpTest.java
+++ b/test/jaxp/javax/xml/jaxp/functional/javax/xml/transform/ptests/TransformerExcpTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -22,21 +22,21 @@
  */
 package javax.xml.transform.ptests;
 
-import static javax.xml.transform.ptests.TransformerTestConst.XML_DIR;
-import static org.testng.Assert.assertEquals;
-import static org.testng.Assert.assertNotNull;
-import static org.testng.Assert.assertNull;
-import static org.testng.Assert.fail;
-
-import java.io.File;
+import org.junit.jupiter.api.Test;
 
 import javax.xml.transform.Transformer;
+import javax.xml.transform.TransformerConfigurationException;
 import javax.xml.transform.TransformerException;
 import javax.xml.transform.TransformerFactory;
 import javax.xml.transform.sax.SAXResult;
 import javax.xml.transform.stream.StreamSource;
+import java.io.File;
 
-import org.testng.annotations.Test;
+import static javax.xml.transform.ptests.TransformerTestConst.XML_DIR;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertNotNull;
+import static org.junit.jupiter.api.Assertions.assertNull;
+import static org.junit.jupiter.api.Assertions.assertThrows;
 
 /**
  *  Basic test for TransformerException specification.
@@ -44,31 +44,28 @@ import org.testng.annotations.Test;
 /*
  * @test
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm javax.xml.transform.ptests.TransformerExcpTest
+ * @run junit/othervm javax.xml.transform.ptests.TransformerExcpTest
  */
 public class TransformerExcpTest {
     /**
      * Transform an unformatted style-sheet file. TransformerException is thrown.
      */
     @Test
-    public void tfexception() {
-        try {
-            // invalid.xsl has well-formedness error. Therefore transform throws
-            // TransformerException
-            StreamSource streamSource
-                    = new StreamSource(new File(XML_DIR + "invalid.xsl"));
-            TransformerFactory tFactory = TransformerFactory.newInstance();
-            Transformer transformer = tFactory.newTransformer(streamSource);
-            transformer.transform(
-                    new StreamSource(new File(XML_DIR + "cities.xml")),
-                    new SAXResult());
-            fail("TransformerException is not thrown as expected");
-        } catch (TransformerException e) {
-            assertNotNull(e.getCause());
-            assertNotNull(e.getException());
-            assertNull(e.getLocationAsString());
-            assertEquals(e.getMessageAndLocation(),e.getMessage());
-        }
+    public void tfexception() throws TransformerConfigurationException {
+        // invalid.xsl has well-formedness error. Therefore transform throws
+        // TransformerException
+        StreamSource streamSource
+                = new StreamSource(new File(XML_DIR + "invalid.xsl"));
+        TransformerFactory tFactory = TransformerFactory.newInstance();
+
+        TransformerException e = assertThrows(
+                TransformerException.class,
+                () -> tFactory.newTransformer(streamSource));
+
+        assertNotNull(e.getCause());
+        assertNotNull(e.getException());
+        assertNull(e.getLocationAsString());
+        assertEquals(e.getMessageAndLocation(), e.getMessage());
     }
 
 
@@ -77,20 +74,20 @@ public class TransformerExcpTest {
      * TransformerException(Throwable), initCause should throw
      * IllegalStateException
      */
-    @Test(expectedExceptions = IllegalStateException.class)
+    @Test
     public void tfexception06() {
         TransformerException te = new TransformerException(new Throwable());
-        te.initCause(null);
+        assertThrows(IllegalStateException.class, () -> te.initCause(null));
     }
 
     /**
      * Spec says, "if the throwable was created with TransformerException(String,
      * Throwable), initCause should throw IllegalStateException
      */
-    @Test(expectedExceptions = IllegalStateException.class)
+    @Test
     public void tfexception07() {
         TransformerException te = new TransformerException("MyMessage", new Throwable());
-        te.initCause(null);
+        assertThrows(IllegalStateException.class, () -> te.initCause(null));
     }
 
     /**
diff --git a/test/jaxp/javax/xml/jaxp/functional/javax/xml/transform/ptests/TransformerFactoryTest.java b/test/jaxp/javax/xml/jaxp/functional/javax/xml/transform/ptests/TransformerFactoryTest.java
index 8223319aa0a..b53fe298005 100644
--- a/test/jaxp/javax/xml/jaxp/functional/javax/xml/transform/ptests/TransformerFactoryTest.java
+++ b/test/jaxp/javax/xml/jaxp/functional/javax/xml/transform/ptests/TransformerFactoryTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -22,18 +22,11 @@
  */
 package javax.xml.transform.ptests;
 
-import static javax.xml.transform.ptests.TransformerTestConst.GOLDEN_DIR;
-import static javax.xml.transform.ptests.TransformerTestConst.XML_DIR;
-import static jaxp.library.JAXPTestUtilities.USER_DIR;
-import static jaxp.library.JAXPTestUtilities.compareWithGold;
-import static org.testng.Assert.assertNotNull;
-import static org.testng.Assert.assertTrue;
-import static org.testng.Assert.assertNotSame;
-import static org.testng.Assert.assertSame;
-import static org.testng.Assert.assertEquals;
-
-import java.io.FileInputStream;
-import java.io.FileOutputStream;
+import jaxp.library.JAXPDataProvider;
+import org.junit.jupiter.api.Test;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
+import org.w3c.dom.Document;
 
 import javax.xml.parsers.DocumentBuilder;
 import javax.xml.parsers.DocumentBuilderFactory;
@@ -44,12 +37,19 @@ import javax.xml.transform.TransformerFactory;
 import javax.xml.transform.TransformerFactoryConfigurationError;
 import javax.xml.transform.dom.DOMSource;
 import javax.xml.transform.stream.StreamResult;
+import java.io.FileInputStream;
+import java.io.FileOutputStream;
+import java.nio.file.Files;
+import java.nio.file.Path;
 
-import jaxp.library.JAXPDataProvider;
-
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
-import org.w3c.dom.Document;
+import static javax.xml.transform.ptests.TransformerTestConst.GOLDEN_DIR;
+import static javax.xml.transform.ptests.TransformerTestConst.XML_DIR;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertLinesMatch;
+import static org.junit.jupiter.api.Assertions.assertNotNull;
+import static org.junit.jupiter.api.Assertions.assertNotSame;
+import static org.junit.jupiter.api.Assertions.assertSame;
+import static org.junit.jupiter.api.Assertions.assertThrows;
 
 /**
  * Class containing the test cases for TransformerFactory API's
@@ -59,7 +59,8 @@ import org.w3c.dom.Document;
  * @test
  * @bug 8169778
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm javax.xml.transform.ptests.TransformerFactoryTest
+ * @build jaxp.library.JAXPDataProvider
+ * @run junit/othervm javax.xml.transform.ptests.TransformerFactoryTest
  */
 public class TransformerFactoryTest {
     /**
@@ -78,24 +79,25 @@ public class TransformerFactoryTest {
      *
      * @return a data provider contains TransformerFactory instantiation parameters.
      */
-    @DataProvider(name = "parameters")
-    public Object[][] getValidateParameters() {
-        return new Object[][] { { TRANSFORMER_FACTORY_CLASSNAME, null }, { TRANSFORMER_FACTORY_CLASSNAME, this.getClass().getClassLoader() } };
+    public static Object[][] getValidateParameters() {
+        return new Object[][] {
+                { TRANSFORMER_FACTORY_CLASSNAME, null },
+                { TRANSFORMER_FACTORY_CLASSNAME, TransformerFactoryTest.class.getClassLoader() },
+        };
     }
 
     /**
      * Test if newDefaultInstance() method returns an instance
      * of the expected factory.
-     * @throws Exception If any errors occur.
      */
     @Test
-    public void testDefaultInstance() throws Exception {
+    public void testDefaultInstance() {
         TransformerFactory tf1 = TransformerFactory.newDefaultInstance();
         TransformerFactory tf2 = TransformerFactory.newInstance();
         assertNotSame(tf1, tf2, "same instance returned:");
         assertSame(tf1.getClass(), tf2.getClass(),
-                  "unexpected class mismatch for newDefaultInstance():");
-        assertEquals(tf1.getClass().getName(), DEFAULT_IMPL_CLASS);
+                "unexpected class mismatch for newDefaultInstance():");
+        assertEquals(DEFAULT_IMPL_CLASS, tf1.getClass().getName());
     }
 
     /**
@@ -104,12 +106,9 @@ public class TransformerFactoryTest {
      * points to correct implementation of
      * javax.xml.transform.TransformerFactory , should return newInstance of
      * TransformerFactory
-     *
-     * @param factoryClassName
-     * @param classLoader
-     * @throws TransformerConfigurationException
      */
-    @Test(dataProvider = "parameters")
+    @ParameterizedTest
+    @MethodSource("getValidateParameters")
     public void testNewInstance(String factoryClassName, ClassLoader classLoader) throws TransformerConfigurationException {
         TransformerFactory tf = TransformerFactory.newInstance(factoryClassName, classLoader);
         Transformer transformer = tf.newTransformer();
@@ -120,13 +119,13 @@ public class TransformerFactoryTest {
      * Test for TransformerFactory.newInstance(java.lang.String
      * factoryClassName, java.lang.ClassLoader classLoader) factoryClassName is
      * null , should throw TransformerFactoryConfigurationError
-     *
-     * @param factoryClassName
-     * @param classLoader
      */
-    @Test(expectedExceptions = TransformerFactoryConfigurationError.class, dataProvider = "new-instance-neg", dataProviderClass = JAXPDataProvider.class)
+    @ParameterizedTest
+    @MethodSource("jaxp.library.JAXPDataProvider#newInstanceNeg")
     public void testNewInstanceNeg(String factoryClassName, ClassLoader classLoader) {
-        TransformerFactory.newInstance(factoryClassName, classLoader);
+        assertThrows(
+                TransformerFactoryConfigurationError.class,
+                () -> TransformerFactory.newInstance(factoryClassName, classLoader));
     }
 
     /**
@@ -134,12 +133,10 @@ public class TransformerFactoryTest {
      * of TransformerFactory.
      * The style sheet returned is then copied to an tfactory01.out
      * It will then be verified to see if it matches the golden files.
-     *
-     * @throws Exception If any errors occur.
      */
     @Test
     public void tfactory01() throws Exception {
-        String outputFile = USER_DIR + "tfactory01.out";
+        String outputFile = "tfactory01.out";
         String goldFile = GOLDEN_DIR + "tfactory01GF.out";
         String xmlFile = XML_DIR + "TransformerFactoryTest.xml";
         String xmlURI = "file:///" + XML_DIR;
@@ -160,6 +157,8 @@ public class TransformerFactoryTest {
             Transformer t = tFactory.newTransformer();
             t.transform(s, streamResult);
         }
-        assertTrue(compareWithGold(goldFile, outputFile));
+        assertLinesMatch(
+                Files.readAllLines(Path.of(goldFile)),
+                Files.readAllLines(Path.of(outputFile)));
     }
 }
diff --git a/test/jaxp/javax/xml/jaxp/functional/javax/xml/transform/ptests/TransformerTest.java b/test/jaxp/javax/xml/jaxp/functional/javax/xml/transform/ptests/TransformerTest.java
index f940f268ff4..6a779cc05e0 100644
--- a/test/jaxp/javax/xml/jaxp/functional/javax/xml/transform/ptests/TransformerTest.java
+++ b/test/jaxp/javax/xml/jaxp/functional/javax/xml/transform/ptests/TransformerTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -22,14 +22,9 @@
  */
 package javax.xml.transform.ptests;
 
-import static javax.xml.transform.ptests.TransformerTestConst.XML_DIR;
-import static org.testng.Assert.assertEquals;
-import static org.testng.Assert.assertNotNull;
-import static org.testng.Assert.assertTrue;
-
-import java.io.File;
-import java.io.FileInputStream;
-import java.util.Properties;
+import org.junit.jupiter.api.Test;
+import org.w3c.dom.Document;
+import org.xml.sax.InputSource;
 
 import javax.xml.parsers.DocumentBuilder;
 import javax.xml.parsers.DocumentBuilderFactory;
@@ -41,10 +36,14 @@ import javax.xml.transform.TransformerFactory;
 import javax.xml.transform.dom.DOMSource;
 import javax.xml.transform.sax.SAXSource;
 import javax.xml.transform.stream.StreamSource;
+import java.io.File;
+import java.io.FileInputStream;
+import java.util.Properties;
 
-import org.testng.annotations.Test;
-import org.w3c.dom.Document;
-import org.xml.sax.InputSource;
+import static javax.xml.transform.ptests.TransformerTestConst.XML_DIR;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertInstanceOf;
+import static org.junit.jupiter.api.Assertions.assertNotNull;
 
 /**
  * Basic test cases for Transformer API
@@ -52,7 +51,7 @@ import org.xml.sax.InputSource;
 /*
  * @test
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm javax.xml.transform.ptests.TransformerTest
+ * @run junit/othervm javax.xml.transform.ptests.TransformerTest
  */
 public class TransformerTest {
     /**
@@ -90,8 +89,6 @@ public class TransformerTest {
 
     /**
      * This tests if newTransformer(DOMSource) method returns Transformer.
-     *
-     * @throws Exception If any errors occur.
      */
     @Test
     public void transformer03() throws Exception {
@@ -109,8 +106,6 @@ public class TransformerTest {
 
     /**
      * This tests set/get ErrorListener methods of Transformer.
-     *
-     * @throws Exception If any errors occur.
      */
     @Test
     public void transformer04() throws Exception {
@@ -124,13 +119,11 @@ public class TransformerTest {
                 .newTransformer(domSource);
         transformer.setErrorListener(new MyErrorListener());
         assertNotNull(transformer.getErrorListener());
-        assertTrue(transformer.getErrorListener() instanceof MyErrorListener);
+        assertInstanceOf(MyErrorListener.class, transformer.getErrorListener());
     }
 
     /**
      * This tests getOutputProperties() method of Transformer.
-     *
-     * @throws Exception If any errors occur.
      */
     @Test
     public void transformer05() throws Exception {
@@ -144,18 +137,16 @@ public class TransformerTest {
                 newTransformer(domSource);
         Properties prop = transformer.getOutputProperties();
 
-        assertEquals(prop.getProperty("indent"), "yes");
-        assertEquals(prop.getProperty("method"), "xml");
-        assertEquals(prop.getProperty("encoding"), "UTF-8");
-        assertEquals(prop.getProperty("standalone"), "no");
-        assertEquals(prop.getProperty("version"), "1.0");
-        assertEquals(prop.getProperty("omit-xml-declaration"), "no");
+        assertEquals("yes", prop.getProperty("indent"));
+        assertEquals("xml", prop.getProperty("method"));
+        assertEquals("UTF-8", prop.getProperty("encoding"));
+        assertEquals("no", prop.getProperty("standalone"));
+        assertEquals("1.0", prop.getProperty("version"));
+        assertEquals("no", prop.getProperty("omit-xml-declaration"));
     }
 
     /**
      * This tests getOutputProperty() method of Transformer.
-     *
-     * @throws Exception If any errors occur.
      */
     @Test
     public void transformer06() throws Exception {
@@ -168,7 +159,7 @@ public class TransformerTest {
         DOMSource domSource = new DOMSource(document);
 
         Transformer transformer = tfactory.newTransformer(domSource);
-        assertEquals(transformer.getOutputProperty("method"), "xml");
+        assertEquals("xml", transformer.getOutputProperty("method"));
     }
 }
 
@@ -199,8 +190,7 @@ class MyErrorListener implements ErrorListener {
      * @param e exception of a fatal error.
      */
     @Override
-    public void fatalError (TransformerException e) throws
-                TransformerException {
+    public void fatalError(TransformerException e) {
         System.out.println(" In fatal");
     }
 }
diff --git a/test/jaxp/javax/xml/jaxp/functional/javax/xml/transform/ptests/TransformerTest02.java b/test/jaxp/javax/xml/jaxp/functional/javax/xml/transform/ptests/TransformerTest02.java
index a9391b02866..0b7a9a85f09 100644
--- a/test/jaxp/javax/xml/jaxp/functional/javax/xml/transform/ptests/TransformerTest02.java
+++ b/test/jaxp/javax/xml/jaxp/functional/javax/xml/transform/ptests/TransformerTest02.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -22,15 +22,7 @@
  */
 package javax.xml.transform.ptests;
 
-import static javax.xml.transform.ptests.TransformerTestConst.GOLDEN_DIR;
-import static javax.xml.transform.ptests.TransformerTestConst.XML_DIR;
-import static jaxp.library.JAXPTestUtilities.USER_DIR;
-import static jaxp.library.JAXPTestUtilities.compareWithGold;
-import static org.testng.Assert.assertTrue;
-
-import java.io.File;
-import java.io.FileInputStream;
-import java.io.FileOutputStream;
+import org.junit.jupiter.api.Test;
 
 import javax.xml.parsers.DocumentBuilderFactory;
 import javax.xml.transform.Transformer;
@@ -38,8 +30,15 @@ import javax.xml.transform.TransformerFactory;
 import javax.xml.transform.dom.DOMSource;
 import javax.xml.transform.stream.StreamResult;
 import javax.xml.transform.stream.StreamSource;
+import java.io.File;
+import java.io.FileInputStream;
+import java.io.FileOutputStream;
+import java.nio.file.Files;
+import java.nio.file.Path;
 
-import org.testng.annotations.Test;
+import static javax.xml.transform.ptests.TransformerTestConst.GOLDEN_DIR;
+import static javax.xml.transform.ptests.TransformerTestConst.XML_DIR;
+import static org.junit.jupiter.api.Assertions.assertLinesMatch;
 
 
 /**
@@ -49,17 +48,15 @@ import org.testng.annotations.Test;
 /*
  * @test
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm javax.xml.transform.ptests.TransformerTest02
+ * @run junit/othervm javax.xml.transform.ptests.TransformerTest02
  */
 public class TransformerTest02 {
     /**
      * Unit test for transform(StreamSource, StreamResult).
-     *
-     * @throws Exception If any errors occur.
      */
     @Test
     public void testcase01() throws Exception {
-        String outputFile = USER_DIR + "transformer02.out";
+        String outputFile = "transformer02.out";
         String goldFile = GOLDEN_DIR + "transformer02GF.out";
         String xsltFile = XML_DIR + "cities.xsl";
         String xmlFile = XML_DIR + "cities.xml";
@@ -79,6 +76,8 @@ public class TransformerTest02 {
             transformer.setOutputProperty("indent", "no");
             transformer.transform(streamSource, streamResult);
         }
-        assertTrue(compareWithGold(goldFile, outputFile));
+        assertLinesMatch(
+                Files.readAllLines(Path.of(goldFile)),
+                Files.readAllLines(Path.of(outputFile)));
     }
 }
diff --git a/test/jaxp/javax/xml/jaxp/functional/javax/xml/transform/ptests/TransformerTest03.java b/test/jaxp/javax/xml/jaxp/functional/javax/xml/transform/ptests/TransformerTest03.java
index 4cdd2e606f1..18e5033b0f0 100644
--- a/test/jaxp/javax/xml/jaxp/functional/javax/xml/transform/ptests/TransformerTest03.java
+++ b/test/jaxp/javax/xml/jaxp/functional/javax/xml/transform/ptests/TransformerTest03.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -22,16 +22,7 @@
  */
 package javax.xml.transform.ptests;
 
-import static javax.xml.transform.ptests.TransformerTestConst.GOLDEN_DIR;
-import static javax.xml.transform.ptests.TransformerTestConst.XML_DIR;
-import static jaxp.library.JAXPTestUtilities.USER_DIR;
-import static jaxp.library.JAXPTestUtilities.compareWithGold;
-import static org.testng.Assert.assertTrue;
-
-import java.io.File;
-import java.io.FileInputStream;
-import java.io.FileOutputStream;
-import java.util.Properties;
+import org.junit.jupiter.api.Test;
 
 import javax.xml.parsers.DocumentBuilderFactory;
 import javax.xml.transform.Transformer;
@@ -39,8 +30,16 @@ import javax.xml.transform.TransformerFactory;
 import javax.xml.transform.dom.DOMSource;
 import javax.xml.transform.stream.StreamResult;
 import javax.xml.transform.stream.StreamSource;
+import java.io.File;
+import java.io.FileInputStream;
+import java.io.FileOutputStream;
+import java.nio.file.Files;
+import java.nio.file.Path;
+import java.util.Properties;
 
-import org.testng.annotations.Test;
+import static javax.xml.transform.ptests.TransformerTestConst.GOLDEN_DIR;
+import static javax.xml.transform.ptests.TransformerTestConst.XML_DIR;
+import static org.junit.jupiter.api.Assertions.assertLinesMatch;
 
 /**
  * Here Properties Object is populated with required properties.A transformer
@@ -51,17 +50,15 @@ import org.testng.annotations.Test;
 /*
  * @test
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm javax.xml.transform.ptests.TransformerTest03
+ * @run junit/othervm javax.xml.transform.ptests.TransformerTest03
  */
 public class TransformerTest03 {
     /**
      * Test for Transformer.setOutputProperties method.
-     *
-     * @throws Exception If any errors occur.
      */
     @Test
     public void testcase01() throws Exception {
-        String outputFile = USER_DIR + "transformer03.out";
+        String outputFile = "transformer03.out";
         String goldFile = GOLDEN_DIR + "transformer03GF.out";
         String xsltFile = XML_DIR + "cities.xsl";
         String xmlFile = XML_DIR + "cities.xml";
@@ -88,6 +85,8 @@ public class TransformerTest03 {
             transformer.setOutputProperties(properties);
             transformer.transform(new StreamSource(fis), new StreamResult(fos));
         }
-        assertTrue(compareWithGold(goldFile, outputFile));
+        assertLinesMatch(
+                Files.readAllLines(Path.of(goldFile)),
+                Files.readAllLines(Path.of(outputFile)));
     }
 }
diff --git a/test/jaxp/javax/xml/jaxp/functional/javax/xml/transform/ptests/URIResolverTest.java b/test/jaxp/javax/xml/jaxp/functional/javax/xml/transform/ptests/URIResolverTest.java
index 0d642b67129..3db6bec77ae 100644
--- a/test/jaxp/javax/xml/jaxp/functional/javax/xml/transform/ptests/URIResolverTest.java
+++ b/test/jaxp/javax/xml/jaxp/functional/javax/xml/transform/ptests/URIResolverTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -22,12 +22,9 @@
  */
 package javax.xml.transform.ptests;
 
-import static javax.xml.transform.ptests.TransformerTestConst.XML_DIR;
-import static org.testng.Assert.assertEquals;
-import static org.testng.Assert.assertNotNull;
-
-import java.io.File;
-import java.io.FileInputStream;
+import org.junit.jupiter.api.Test;
+import org.w3c.dom.Document;
+import org.xml.sax.InputSource;
 
 import javax.xml.parsers.DocumentBuilder;
 import javax.xml.parsers.DocumentBuilderFactory;
@@ -39,10 +36,12 @@ import javax.xml.transform.dom.DOMSource;
 import javax.xml.transform.sax.SAXSource;
 import javax.xml.transform.stream.StreamResult;
 import javax.xml.transform.stream.StreamSource;
+import java.io.File;
+import java.io.FileInputStream;
 
-import org.testng.annotations.Test;
-import org.w3c.dom.Document;
-import org.xml.sax.InputSource;
+import static javax.xml.transform.ptests.TransformerTestConst.XML_DIR;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertNotNull;
 
 /**
  * URIResolver should be invoked when transform happens.
@@ -50,9 +49,9 @@ import org.xml.sax.InputSource;
 /*
  * @test
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm javax.xml.transform.ptests.URIResolverTest
+ * @run junit/othervm javax.xml.transform.ptests.URIResolverTest
  */
-public class URIResolverTest implements URIResolver {
+public class URIResolverTest {
     /**
      * System ID constant.
      */
@@ -73,60 +72,29 @@ public class URIResolverTest implements URIResolver {
      */
     private final static String XSL_TEMP_FILE = "temp/cities.xsl";
 
-    /**
-     * expected HREF.
-     */
-    private final String validateHref;
-
-    /**
-     * expected Base URI.
-     */
-    private final String validateBase;
-
-    /**
-     * Default constructor for testng invocation.
-     */
-    public URIResolverTest(){
-        validateHref = null;
-        validateBase = null;
-    }
-
-    /**
-     * Constructor for setting expected Href and expected Base URI.
-     * @param validateHref expected Href
-     * @param validateBase expected Base URI
-     */
-    public URIResolverTest(String validateHref, String validateBase){
-        this.validateHref = validateHref;
-        this.validateBase = validateBase;
-    }
-
-    /**
-     * Called by the processor when it encounters an xsl:include, xsl:import,
-     * or document() function.
-     * @param href An href attribute, which may be relative or absolute.
-     * @param base The base URI against which the first argument will be made
-     * absolute if the absolute URI is required.
-     * @return null always.
-     */
-    @Override
-    public Source resolve(String href, String base) {
-        assertEquals(href, validateHref);
-        assertEquals(base, validateBase);
-        return null;
+    record TestResolver(String expectedHref, String expectedBase) implements URIResolver {
+        /**
+         * Called by the processor when it encounters an xsl:include, xsl:import,
+         * or document() function.
+         */
+        @Override
+        public Source resolve(String href, String base) {
+            assertEquals(expectedHref, href);
+            assertEquals(expectedBase, base);
+            // Return null if the href cannot be resolved.
+            return null;
+        }
     }
 
     /**
      * This is to test the URIResolver.resolve() method when a transformer is
      * created using StreamSource. style-sheet file has xsl:include in it.
-     *
-     * @throws Exception If any errors occur.
      */
     @Test
-    public static void resolver01() throws Exception {
+    public void resolver01() throws Exception {
         try (FileInputStream fis = new FileInputStream(XSL_INCLUDE_FILE)) {
             TransformerFactory tfactory = TransformerFactory.newInstance();
-            URIResolverTest resolver = new URIResolverTest(XSL_TEMP_FILE, SYSTEM_ID);
+            TestResolver resolver = new TestResolver(XSL_TEMP_FILE, SYSTEM_ID);
             tfactory.setURIResolver(resolver);
 
             StreamSource streamSource = new StreamSource(fis);
@@ -138,13 +106,11 @@ public class URIResolverTest implements URIResolver {
     /**
      * This is to test the URIResolver.resolve() method when a transformer is
      * created using DOMSource. style-sheet file has xsl:include in it.
-     *
-     * @throws Exception If any errors occur.
      */
     @Test
-    public static void resolver02() throws Exception {
+    public void resolver02() throws Exception {
         TransformerFactory tfactory = TransformerFactory.newInstance();
-        URIResolverTest resolver = new URIResolverTest(XSL_TEMP_FILE, SYSTEM_ID);
+        TestResolver resolver = new TestResolver(XSL_TEMP_FILE, SYSTEM_ID);
         tfactory.setURIResolver(resolver);
 
         DocumentBuilderFactory dbf = DocumentBuilderFactory.newInstance();
@@ -159,13 +125,11 @@ public class URIResolverTest implements URIResolver {
     /**
      * This is to test the URIResolver.resolve() method when a transformer is
      * created using SAXSource. style-sheet file has xsl:include in it.
-     *
-     * @throws Exception If any errors occur.
      */
     @Test
-    public static void resolver03() throws Exception {
-        try (FileInputStream fis = new FileInputStream(XSL_INCLUDE_FILE)){
-            URIResolverTest resolver = new URIResolverTest(XSL_TEMP_FILE, SYSTEM_ID);
+    public void resolver03() throws Exception {
+        try (FileInputStream fis = new FileInputStream(XSL_INCLUDE_FILE)) {
+            TestResolver resolver = new TestResolver(XSL_TEMP_FILE, SYSTEM_ID);
             TransformerFactory tfactory = TransformerFactory.newInstance();
             tfactory.setURIResolver(resolver);
             InputSource is = new InputSource(fis);
@@ -178,13 +142,11 @@ public class URIResolverTest implements URIResolver {
     /**
      * This is to test the URIResolver.resolve() method when a transformer is
      * created using StreamSource. style-sheet file has xsl:import in it.
-     *
-     * @throws Exception If any errors occur.
      */
     @Test
-    public static void resolver04() throws Exception {
+    public void resolver04() throws Exception {
         try (FileInputStream fis = new FileInputStream(XSL_IMPORT_FILE)) {
-            URIResolverTest resolver = new URIResolverTest(XSL_TEMP_FILE, SYSTEM_ID);
+            TestResolver resolver = new TestResolver(XSL_TEMP_FILE, SYSTEM_ID);
             TransformerFactory tfactory = TransformerFactory.newInstance();
             tfactory.setURIResolver(resolver);
             StreamSource streamSource = new StreamSource(fis);
@@ -196,12 +158,10 @@ public class URIResolverTest implements URIResolver {
     /**
      * This is to test the URIResolver.resolve() method when a transformer is
      * created using DOMSource. style-sheet file has xsl:import in it.
-     *
-     * @throws Exception If any errors occur.
      */
     @Test
-    public static void resolver05() throws Exception {
-        URIResolverTest resolver = new URIResolverTest(XSL_TEMP_FILE, SYSTEM_ID);
+    public void resolver05() throws Exception {
+        TestResolver resolver = new TestResolver(XSL_TEMP_FILE, SYSTEM_ID);
         TransformerFactory tfactory = TransformerFactory.newInstance();
         tfactory.setURIResolver(resolver);
         DocumentBuilderFactory dbf = DocumentBuilderFactory.newInstance();
@@ -215,13 +175,11 @@ public class URIResolverTest implements URIResolver {
     /**
      * This is to test the URIResolver.resolve() method when a transformer is
      * created using SAXSource. style-sheet file has xsl:import in it.
-     *
-     * @throws Exception If any errors occur.
      */
     @Test
-    public static void resolver06() throws Exception {
-        try (FileInputStream fis = new FileInputStream(XSL_IMPORT_FILE)){
-            URIResolverTest resolver = new URIResolverTest(XSL_TEMP_FILE, SYSTEM_ID);
+    public void resolver06() throws Exception {
+        try (FileInputStream fis = new FileInputStream(XSL_IMPORT_FILE)) {
+            TestResolver resolver = new TestResolver(XSL_TEMP_FILE, SYSTEM_ID);
             TransformerFactory tfactory = TransformerFactory.newInstance();
             tfactory.setURIResolver(resolver);
             InputSource is = new InputSource(fis);
@@ -234,13 +192,11 @@ public class URIResolverTest implements URIResolver {
     /**
      * This is to test the URIResolver.resolve() method when there is an error
      * in the file.
-     *
-     * @throws Exception If any errors occur.
      */
     @Test
-    public static void docResolver01() throws Exception {
+    public void docResolver01() throws Exception {
         try (FileInputStream fis = new FileInputStream(XML_DIR + "doctest.xsl")) {
-            URIResolverTest resolver = new URIResolverTest("temp/colors.xml", SYSTEM_ID);
+            TestResolver resolver = new TestResolver("temp/colors.xml", SYSTEM_ID);
             StreamSource streamSource = new StreamSource(fis);
             streamSource.setSystemId(SYSTEM_ID);
 
diff --git a/test/jaxp/javax/xml/jaxp/functional/javax/xml/transform/ptests/othervm/TFCErrorTest.java b/test/jaxp/javax/xml/jaxp/functional/javax/xml/transform/ptests/othervm/TFCErrorTest.java
index 41a528ce1d2..31fa2960250 100644
--- a/test/jaxp/javax/xml/jaxp/functional/javax/xml/transform/ptests/othervm/TFCErrorTest.java
+++ b/test/jaxp/javax/xml/jaxp/functional/javax/xml/transform/ptests/othervm/TFCErrorTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2015, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2015, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -22,14 +22,13 @@
  */
 package javax.xml.transform.ptests.othervm;
 
-import static jaxp.library.JAXPTestUtilities.setSystemProperty;
-
-import static org.testng.Assert.fail;
+import org.junit.jupiter.api.Test;
 
 import javax.xml.transform.TransformerFactory;
 import javax.xml.transform.TransformerFactoryConfigurationError;
 
-import org.testng.annotations.Test;
+import static org.junit.jupiter.api.Assertions.assertInstanceOf;
+import static org.junit.jupiter.api.Assertions.assertThrows;
 
 /**
  * Negative test for set invalid TransformerFactory property.
@@ -37,17 +36,21 @@ import org.testng.annotations.Test;
 /*
  * @test
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm javax.xml.transform.ptests.othervm.TFCErrorTest
+ * @run junit/othervm javax.xml.transform.ptests.othervm.TFCErrorTest
  */
 public class TFCErrorTest {
-    @Test(expectedExceptions = ClassNotFoundException.class)
-    public void tfce01() throws Exception {
-        try{
-            setSystemProperty("javax.xml.transform.TransformerFactory","xx");
-            TransformerFactory.newInstance();
-            fail("Expect TransformerFactoryConfigurationError here");
-        } catch (TransformerFactoryConfigurationError expected) {
-            throw expected.getException();
+    private static final String TRANSFORMER_FACTORY = "javax.xml.transform.TransformerFactory";
+
+    @Test
+    public void tfce01() {
+        System.setProperty(TRANSFORMER_FACTORY, "xx");
+        try {
+            TransformerFactoryConfigurationError e = assertThrows(
+                    TransformerFactoryConfigurationError.class,
+                    TransformerFactory::newInstance);
+            assertInstanceOf(ClassNotFoundException.class, e.getException());
+        } finally {
+            System.clearProperty(TRANSFORMER_FACTORY);
         }
     }
 }
diff --git a/test/jaxp/javax/xml/jaxp/functional/javax/xml/transform/xmlfiles/out/saxtf008GF.out b/test/jaxp/javax/xml/jaxp/functional/javax/xml/transform/xmlfiles/out/saxtf008GF.out
index 1fc9136a82b..4e646319c6e 100644
--- a/test/jaxp/javax/xml/jaxp/functional/javax/xml/transform/xmlfiles/out/saxtf008GF.out
+++ b/test/jaxp/javax/xml/jaxp/functional/javax/xml/transform/xmlfiles/out/saxtf008GF.out
@@ -1,17 +1,17 @@
 <?xml version="1.0" encoding="UTF-8"?><countries>
-<country name="France">
-<city>Paris</city>
-<city>Nice</city>
-<city>Lyon</city>
-</country>
-<country name="Italia">
-<city>Roma</city>
-<city>Milano</city>
-<city>Firenze</city>
-<city>Napoli</city>
-</country>
-<country name="Espana">
-<city>Madrid</city>
-<city>Barcelona</city>
-</country>
+    <country name="France">
+        <city>Paris</city>
+        <city>Nice</city>
+        <city>Lyon</city>
+    </country>
+    <country name="Italia">
+        <city>Roma</city>
+        <city>Milano</city>
+        <city>Firenze</city>
+        <city>Napoli</city>
+    </country>
+    <country name="Espana">
+        <city>Madrid</city>
+        <city>Barcelona</city>
+    </country>
 </countries>
diff --git a/test/jaxp/javax/xml/jaxp/functional/javax/xml/validation/ptests/SchemaFactoryTest.java b/test/jaxp/javax/xml/jaxp/functional/javax/xml/validation/ptests/SchemaFactoryTest.java
index d9721883870..dc5acdfe1a3 100644
--- a/test/jaxp/javax/xml/jaxp/functional/javax/xml/validation/ptests/SchemaFactoryTest.java
+++ b/test/jaxp/javax/xml/jaxp/functional/javax/xml/validation/ptests/SchemaFactoryTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1999, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1999, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -22,23 +22,22 @@
  */
 package javax.xml.validation.ptests;
 
-import static javax.xml.XMLConstants.W3C_XML_SCHEMA_NS_URI;
-import static javax.xml.validation.ptests.ValidationTestConst.XML_DIR;
-import static org.testng.Assert.assertNotNull;
-import static org.testng.Assert.assertNull;
-import static org.testng.Assert.assertSame;
-import static org.testng.Assert.assertTrue;
-import static org.testng.Assert.assertFalse;
-import static org.testng.Assert.assertNotSame;
-import static org.testng.Assert.assertEquals;
-
-import java.io.ByteArrayInputStream;
-import java.io.File;
-import java.io.IOException;
-import java.io.InputStream;
-import java.net.URL;
-import java.nio.file.Files;
-import java.nio.file.Paths;
+import jaxp.library.JAXPDataProvider;
+import org.junit.jupiter.api.BeforeAll;
+import org.junit.jupiter.api.Test;
+import org.junit.jupiter.api.TestInstance;
+import org.junit.jupiter.api.TestInstance.Lifecycle;
+import org.junit.jupiter.api.parallel.Execution;
+import org.junit.jupiter.api.parallel.ExecutionMode;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
+import org.w3c.dom.Document;
+import org.xml.sax.ErrorHandler;
+import org.xml.sax.InputSource;
+import org.xml.sax.SAXException;
+import org.xml.sax.SAXNotRecognizedException;
+import org.xml.sax.SAXNotSupportedException;
+import org.xml.sax.SAXParseException;
 
 import javax.xml.parsers.DocumentBuilder;
 import javax.xml.parsers.DocumentBuilderFactory;
@@ -52,31 +51,38 @@ import javax.xml.transform.stax.StAXSource;
 import javax.xml.transform.stream.StreamSource;
 import javax.xml.validation.Schema;
 import javax.xml.validation.SchemaFactory;
+import java.io.ByteArrayInputStream;
+import java.io.File;
+import java.io.IOException;
+import java.io.InputStream;
+import java.net.URL;
+import java.nio.file.Files;
+import java.nio.file.Paths;
 
-import jaxp.library.JAXPDataProvider;
-
-import org.testng.annotations.BeforeClass;
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
-import org.w3c.dom.Document;
-import org.xml.sax.ErrorHandler;
-import org.xml.sax.InputSource;
-import org.xml.sax.SAXException;
-import org.xml.sax.SAXNotRecognizedException;
-import org.xml.sax.SAXNotSupportedException;
-import org.xml.sax.SAXParseException;
+import static javax.xml.XMLConstants.W3C_XML_SCHEMA_NS_URI;
+import static javax.xml.validation.ptests.ValidationTestConst.XML_DIR;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertFalse;
+import static org.junit.jupiter.api.Assertions.assertNotNull;
+import static org.junit.jupiter.api.Assertions.assertNotSame;
+import static org.junit.jupiter.api.Assertions.assertNull;
+import static org.junit.jupiter.api.Assertions.assertSame;
+import static org.junit.jupiter.api.Assertions.assertThrows;
+import static org.junit.jupiter.api.Assertions.assertTrue;
 
 /*
  * @test
  * @bug 8080907 8169778
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm javax.xml.validation.ptests.SchemaFactoryTest
+ * @build jaxp.library.JAXPDataProvider
+ * @run junit/othervm javax.xml.validation.ptests.SchemaFactoryTest
  * @summary Class containing the test cases for SchemaFactory
  */
-@Test(singleThreaded = true)
+@Execution(ExecutionMode.SAME_THREAD)
+@TestInstance(Lifecycle.PER_CLASS)
 public class SchemaFactoryTest {
 
-    @BeforeClass
+    @BeforeAll
     public void setup() throws SAXException, IOException, ParserConfigurationException {
         sf = newSchemaFactory();
         assertNotNull(sf);
@@ -96,7 +102,6 @@ public class SchemaFactoryTest {
     }
 
 
-    @DataProvider(name = "parameters")
     public Object[][] getValidateParameters() {
         return new Object[][] { { W3C_XML_SCHEMA_NS_URI, SCHEMA_FACTORY_CLASSNAME, null },
                 { W3C_XML_SCHEMA_NS_URI, SCHEMA_FACTORY_CLASSNAME, this.getClass().getClassLoader() } };
@@ -105,16 +110,15 @@ public class SchemaFactoryTest {
     /**
      * Test if newDefaultInstance() method returns an instance
      * of the expected factory.
-     * @throws Exception If any errors occur.
      */
     @Test
-    public void testDefaultInstance() throws Exception {
+    public void testDefaultInstance() {
         SchemaFactory sf1 = SchemaFactory.newDefaultInstance();
         SchemaFactory sf2 = SchemaFactory.newInstance(W3C_XML_SCHEMA_NS_URI);
         assertNotSame(sf1, sf2, "same instance returned:");
         assertSame(sf1.getClass(), sf2.getClass(),
-                  "unexpected class mismatch for newDefaultInstance():");
-        assertEquals(sf1.getClass().getName(), DEFAULT_IMPL_CLASS);
+                "unexpected class mismatch for newDefaultInstance():");
+        assertEquals(DEFAULT_IMPL_CLASS, sf1.getClass().getName());
         assertTrue(sf1.isSchemaLanguageSupported(W3C_XML_SCHEMA_NS_URI),
                    "isSchemaLanguageSupported(W3C_XML_SCHEMA_NS_URI):");
         assertFalse(sf1.isSchemaLanguageSupported(UNRECOGNIZED_NAME),
@@ -128,9 +132,10 @@ public class SchemaFactoryTest {
      * javax.xml.validation.SchemaFactory , should return newInstance of
      * SchemaFactory
      */
-    @Test(dataProvider = "parameters")
+    @ParameterizedTest
+    @MethodSource("getValidateParameters")
     public void testNewInstance(String schemaLanguage, String factoryClassName, ClassLoader classLoader) throws SAXException {
-        SchemaFactory sf = SchemaFactory.newInstance(W3C_XML_SCHEMA_NS_URI, SCHEMA_FACTORY_CLASSNAME, null);
+        SchemaFactory sf = SchemaFactory.newInstance(schemaLanguage, factoryClassName, classLoader);
         Schema schema = sf.newSchema();
         assertNotNull(schema);
     }
@@ -140,10 +145,12 @@ public class SchemaFactoryTest {
      * java.lang.String factoryClassName, java.lang.ClassLoader classLoader)
      * factoryClassName is null , should throw IllegalArgumentException
      */
-    @Test(expectedExceptions = IllegalArgumentException.class, dataProvider = "new-instance-neg", dataProviderClass = JAXPDataProvider.class)
+    @ParameterizedTest
+    @MethodSource("jaxp.library.JAXPDataProvider#newInstanceNeg")
     public void testNewInstanceWithNullFactoryClassName(String factoryClassName, ClassLoader classLoader) {
-
-        SchemaFactory.newInstance(W3C_XML_SCHEMA_NS_URI, factoryClassName, classLoader);
+        assertThrows(
+                IllegalArgumentException.class,
+                () -> SchemaFactory.newInstance(W3C_XML_SCHEMA_NS_URI, factoryClassName, classLoader));
     }
 
     /*
@@ -151,9 +158,11 @@ public class SchemaFactoryTest {
      * java.lang.String factoryClassName, java.lang.ClassLoader classLoader)
      * schemaLanguage is null , should throw NPE
      */
-    @Test(expectedExceptions = NullPointerException.class)
+    @Test
     public void testNewInstanceWithNullSchemaLanguage() {
-        SchemaFactory.newInstance(null, SCHEMA_FACTORY_CLASSNAME, this.getClass().getClassLoader());
+        assertThrows(
+                NullPointerException.class,
+                () -> SchemaFactory.newInstance(null, SCHEMA_FACTORY_CLASSNAME, this.getClass().getClassLoader()));
     }
 
     /*
@@ -161,15 +170,17 @@ public class SchemaFactoryTest {
      * java.lang.String factoryClassName, java.lang.ClassLoader classLoader)
      * schemaLanguage is empty , should throw IllegalArgumentException
      */
-    @Test(expectedExceptions = IllegalArgumentException.class)
+    @Test
     public void testNewInstanceWithEmptySchemaLanguage() {
-        SchemaFactory.newInstance("", SCHEMA_FACTORY_CLASSNAME, this.getClass().getClassLoader());
+        assertThrows(
+                IllegalArgumentException.class,
+                () -> SchemaFactory.newInstance("", SCHEMA_FACTORY_CLASSNAME, this.getClass().getClassLoader()));
     }
 
 
-    @Test(expectedExceptions = SAXParseException.class)
-    public void testNewSchemaDefault() throws SAXException, IOException {
-        validate(sf.newSchema());
+    @Test
+    public void testNewSchemaDefault() {
+        assertThrows(SAXParseException.class, () -> validate(sf.newSchema()));
     }
 
     @Test
@@ -177,12 +188,11 @@ public class SchemaFactoryTest {
         validate(sf.newSchema(new File(XML_DIR + "test.xsd")));
     }
 
-    @Test(expectedExceptions = NullPointerException.class)
-    public void testNewSchemaWithNullFile() throws SAXException {
-        sf.newSchema((File) null);
+    @Test
+    public void testNewSchemaWithNullFile() {
+        assertThrows(NullPointerException.class, () -> sf.newSchema((File) null));
     }
 
-    @DataProvider(name = "valid-source")
     public Object[][] getValidSource() throws XMLStreamException {
         return new Object[][] {
                 { streamSource(xsd1) },
@@ -193,43 +203,42 @@ public class SchemaFactoryTest {
 
     }
 
-    @Test(dataProvider = "valid-source")
+    @ParameterizedTest
+    @MethodSource("getValidSource")
     public void testNewSchemaWithValidSource(Source schema) throws SAXException, IOException {
         validate(sf.newSchema(schema));
     }
 
-    @DataProvider(name = "invalid-source")
-    public Object[][] getInvalidSource() {
+    public static Object[][] getInvalidSource() {
         return new Object[][] {
                 { nullStreamSource() },
                 { nullSaxSource() } };
     }
 
-    @Test(dataProvider = "invalid-source", expectedExceptions = SAXParseException.class)
-    public void testNewSchemaWithInvalidSource(Source schema) throws SAXException {
-        sf.newSchema(schema);
+    @ParameterizedTest
+    @MethodSource("getInvalidSource")
+    public void testNewSchemaWithInvalidSource(Source schema) {
+        assertThrows(SAXParseException.class, () -> sf.newSchema(schema));
     }
 
-    @Test(expectedExceptions = NullPointerException.class)
-    public void testNewSchemaWithNullSource() throws SAXException {
-        sf.newSchema((Source)null);
+    @Test
+    public void testNewSchemaWithNullSource() {
+        assertThrows(NullPointerException.class, () -> sf.newSchema((Source) null));
     }
 
-    @DataProvider(name = "valid-sources")
     public Object[][] getValidSources() {
         return new Object[][] {
                 { streamSource(xsd1), streamSource(xsd2) },
                 { saxSource(xsd1), saxSource(xsd2) },
                 { domSource(xsdDoc1), domSource(xsdDoc2) } };
-
     }
 
-    @Test(dataProvider = "valid-sources")
+    @ParameterizedTest
+    @MethodSource("getValidSources")
     public void testNewSchemaWithValidSourceArray(Source schema1, Source schema2) throws SAXException, IOException {
         validate(sf.newSchema(new Source[] { schema1, schema2 }));
     }
 
-    @DataProvider(name = "invalid-sources")
     public Object[][] getInvalidSources() {
         return new Object[][] {
                 { streamSource(xsd1), nullStreamSource() },
@@ -238,12 +247,12 @@ public class SchemaFactoryTest {
                 { nullSaxSource(), nullSaxSource() } };
     }
 
-    @Test(dataProvider = "invalid-sources", expectedExceptions = SAXParseException.class)
-    public void testNewSchemaWithInvalidSourceArray(Source schema1, Source schema2) throws SAXException {
-        sf.newSchema(new Source[] { schema1, schema2 });
+    @ParameterizedTest
+    @MethodSource("getInvalidSources")
+    public void testNewSchemaWithInvalidSourceArray(Source schema1, Source schema2) {
+        assertThrows(SAXParseException.class, () -> sf.newSchema(new Source[] { schema1, schema2 }));
     }
 
-    @DataProvider(name = "null-sources")
     public Object[][] getNullSources() {
         return new Object[][] {
                 { new Source[] { domSource(xsdDoc1), null } },
@@ -252,14 +261,15 @@ public class SchemaFactoryTest {
 
     }
 
-    @Test(dataProvider = "null-sources", expectedExceptions = NullPointerException.class)
-    public void testNewSchemaWithNullSourceArray(Source[] schemas) throws SAXException {
-        sf.newSchema(schemas);
+    @ParameterizedTest
+    @MethodSource("getNullSources")
+    public void testNewSchemaWithNullSourceArray(Source[] schemas) {
+        assertThrows(NullPointerException.class, () -> sf.newSchema(schemas));
     }
 
-    @Test(expectedExceptions = NullPointerException.class)
-    public void testNewSchemaWithNullUrl() throws SAXException {
-        sf.newSchema((URL) null);
+    @Test
+    public void testNewSchemaWithNullUrl() {
+        assertThrows(NullPointerException.class, () -> sf.newSchema((URL) null));
     }
 
 
@@ -270,70 +280,66 @@ public class SchemaFactoryTest {
 
         ErrorHandler handler = new MyErrorHandler();
         sf.setErrorHandler(handler);
-        assertSame(sf.getErrorHandler(), handler);
+        assertSame(handler, sf.getErrorHandler());
 
         sf.setErrorHandler(null);
         assertNull(sf.getErrorHandler());
     }
 
-    @Test(expectedExceptions = SAXNotRecognizedException.class)
-    public void testGetUnrecognizedProperty() throws SAXNotRecognizedException, SAXNotSupportedException {
+    @Test
+    public void testGetUnrecognizedProperty() {
         SchemaFactory sf = newSchemaFactory();
-        sf.getProperty(UNRECOGNIZED_NAME);
-
+        assertThrows(SAXNotRecognizedException.class, () -> sf.getProperty(UNRECOGNIZED_NAME));
     }
 
-    @Test(expectedExceptions = SAXNotRecognizedException.class)
-    public void testSetUnrecognizedProperty() throws SAXNotRecognizedException, SAXNotSupportedException {
+    @Test
+    public void testSetUnrecognizedProperty() {
         SchemaFactory sf = newSchemaFactory();
-        sf.setProperty(UNRECOGNIZED_NAME, "test");
+        assertThrows(SAXNotRecognizedException.class, () -> sf.setProperty(UNRECOGNIZED_NAME, "test"));
     }
 
-    @Test(expectedExceptions = NullPointerException.class)
-    public void testGetNullProperty() throws SAXNotRecognizedException, SAXNotSupportedException {
+    @Test
+    public void testGetNullProperty() {
         SchemaFactory sf = newSchemaFactory();
         assertNotNull(sf);
-        sf.getProperty(null);
-
+        assertThrows(NullPointerException.class, () -> sf.getProperty(null));
     }
 
-    @Test(expectedExceptions = NullPointerException.class)
-    public void testSetNullProperty() throws SAXNotRecognizedException, SAXNotSupportedException {
+    @Test
+    public void testSetNullProperty() {
         SchemaFactory sf = newSchemaFactory();
         assertNotNull(sf);
-        sf.setProperty(null, "test");
+        assertThrows(NullPointerException.class, () -> sf.setProperty(null, "test"));
     }
 
-    @Test(expectedExceptions = SAXNotRecognizedException.class)
-    public void testGetUnrecognizedFeature() throws SAXNotRecognizedException, SAXNotSupportedException {
+    @Test
+    public void testGetUnrecognizedFeature() {
         SchemaFactory sf = newSchemaFactory();
-        sf.getFeature(UNRECOGNIZED_NAME);
+        assertThrows(SAXNotRecognizedException.class, () -> sf.getFeature(UNRECOGNIZED_NAME));
 
     }
 
-    @Test(expectedExceptions = SAXNotRecognizedException.class)
-    public void testSetUnrecognizedFeature() throws SAXNotRecognizedException, SAXNotSupportedException {
+    @Test
+    public void testSetUnrecognizedFeature() {
         SchemaFactory sf = newSchemaFactory();
-        sf.setFeature(UNRECOGNIZED_NAME, true);
+        assertThrows(SAXNotRecognizedException.class, () -> sf.setFeature(UNRECOGNIZED_NAME, true));
     }
 
-    @Test(expectedExceptions = NullPointerException.class)
-    public void testGetNullFeature() throws SAXNotRecognizedException, SAXNotSupportedException {
+    @Test
+    public void testGetNullFeature() {
         SchemaFactory sf = newSchemaFactory();
         assertNotNull(sf);
-        sf.getFeature(null);
-
+        assertThrows(NullPointerException.class, () -> sf.getFeature(null));
     }
 
-    @Test(expectedExceptions = NullPointerException.class)
-    public void testSetNullFeature() throws SAXNotRecognizedException, SAXNotSupportedException {
+    @Test
+    public void testSetNullFeature() {
         SchemaFactory sf = newSchemaFactory();
         assertNotNull(sf);
-        sf.setFeature(null, true);
+        assertThrows(NullPointerException.class, () -> sf.setFeature(null, true));
     }
 
-    @DataProvider(name = "source-feature")
-    public Object[][] getSourceFeature() {
+    public static Object[][] getSourceFeature() {
         return new Object[][] {
                 { StreamSource.FEATURE },
                 { SAXSource.FEATURE },
@@ -346,7 +352,8 @@ public class SchemaFactoryTest {
      * Return true for each of the JAXP Source features to indicate that this
      * SchemaFactory supports all of the built-in JAXP Source types.
      */
-    @Test(dataProvider = "source-feature")
+    @ParameterizedTest
+    @MethodSource("getSourceFeature")
     public void testSourceFeatureGet(String sourceFeature) throws Exception {
         assertTrue(newSchemaFactory().getFeature(sourceFeature));
     }
@@ -355,46 +362,52 @@ public class SchemaFactoryTest {
      * JAXP Source features are read-only because this SchemaFactory always
      * supports all JAXP Source types.
      */
-    @Test(dataProvider = "source-feature", expectedExceptions = SAXNotSupportedException.class)
-    public void testSourceFeatureSet(String sourceFeature) throws Exception {
-        newSchemaFactory().setFeature(sourceFeature, false);
+    @ParameterizedTest
+    @MethodSource("getSourceFeature")
+    public void testSourceFeatureSet(String sourceFeature) {
+        assertThrows(
+                SAXNotSupportedException.class,
+                () -> newSchemaFactory().setFeature(sourceFeature, false));
     }
 
-    @Test(expectedExceptions = IllegalArgumentException.class)
+    @Test
     public void testInvalidSchemaLanguage() {
         final String INVALID_SCHEMA_LANGUAGE = "http://relaxng.org/ns/structure/1.0";
-        SchemaFactory.newInstance(INVALID_SCHEMA_LANGUAGE);
+        assertThrows(
+                IllegalArgumentException.class,
+                () -> SchemaFactory.newInstance(INVALID_SCHEMA_LANGUAGE));
     }
 
-    @Test(expectedExceptions = NullPointerException.class)
+    @Test
     public void testNullSchemaLanguage() {
-        SchemaFactory.newInstance(null);
+        assertThrows(NullPointerException.class, () -> SchemaFactory.newInstance(null));
     }
 
     private void validate(Schema schema) throws SAXException, IOException {
         schema.newValidator().validate(new StreamSource(new ByteArrayInputStream(xml)));
     }
-    private InputStream newInputStream(byte[] xsd) {
+
+    private static InputStream newInputStream(byte[] xsd) {
         return new ByteArrayInputStream(xsd);
     }
 
-    private Source streamSource(byte[] xsd) {
+    private static Source streamSource(byte[] xsd) {
         return new StreamSource(newInputStream(xsd));
     }
 
-    private Source nullStreamSource() {
+    private static Source nullStreamSource() {
         return new StreamSource((InputStream) null);
     }
 
-    private Source saxSource(byte[] xsd) {
+    private static Source saxSource(byte[] xsd) {
         return new SAXSource(new InputSource(newInputStream(xsd)));
     }
 
-    private Source nullSaxSource() {
+    private static Source nullSaxSource() {
         return new SAXSource(new InputSource((InputStream) null));
     }
 
-    private Source domSource(Document xsdDoc) {
+    private static Source domSource(Document xsdDoc) {
         return new DOMSource(xsdDoc);
     }
 
diff --git a/test/jaxp/javax/xml/jaxp/functional/javax/xml/validation/ptests/TypeInfoProviderTest.java b/test/jaxp/javax/xml/jaxp/functional/javax/xml/validation/ptests/TypeInfoProviderTest.java
index b8c7a2d54e7..d4802728b5b 100644
--- a/test/jaxp/javax/xml/jaxp/functional/javax/xml/validation/ptests/TypeInfoProviderTest.java
+++ b/test/jaxp/javax/xml/jaxp/functional/javax/xml/validation/ptests/TypeInfoProviderTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1999, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1999, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -22,15 +22,12 @@
  */
 package javax.xml.validation.ptests;
 
-import static javax.xml.XMLConstants.W3C_XML_SCHEMA_NS_URI;
-import static javax.xml.validation.ptests.ValidationTestConst.XML_DIR;
-import static jaxp.library.JAXPTestUtilities.filenameToURL;
-import static org.testng.Assert.assertEquals;
-import static org.testng.Assert.assertFalse;
-import static org.testng.Assert.assertTrue;
-
-import java.io.File;
-import java.io.IOException;
+import org.junit.jupiter.api.Test;
+import org.xml.sax.Attributes;
+import org.xml.sax.InputSource;
+import org.xml.sax.SAXException;
+import org.xml.sax.XMLReader;
+import org.xml.sax.helpers.DefaultHandler;
 
 import javax.xml.parsers.ParserConfigurationException;
 import javax.xml.parsers.SAXParserFactory;
@@ -38,18 +35,20 @@ import javax.xml.validation.Schema;
 import javax.xml.validation.SchemaFactory;
 import javax.xml.validation.TypeInfoProvider;
 import javax.xml.validation.ValidatorHandler;
+import java.io.File;
+import java.io.IOException;
+import java.nio.file.Path;
 
-import org.testng.annotations.Test;
-import org.xml.sax.Attributes;
-import org.xml.sax.InputSource;
-import org.xml.sax.SAXException;
-import org.xml.sax.XMLReader;
-import org.xml.sax.helpers.DefaultHandler;
+import static javax.xml.XMLConstants.W3C_XML_SCHEMA_NS_URI;
+import static javax.xml.validation.ptests.ValidationTestConst.XML_DIR;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertFalse;
+import static org.junit.jupiter.api.Assertions.assertTrue;
 
 /*
  * @test
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm javax.xml.validation.ptests.TypeInfoProviderTest
+ * @run junit/othervm javax.xml.validation.ptests.TypeInfoProviderTest
  * @summary test ValidatorHandler.getTypeInfoProvider()
  */
 public class TypeInfoProviderTest {
@@ -65,7 +64,8 @@ public class TypeInfoProviderTest {
         MyDefaultHandler myDefaultHandler = new MyDefaultHandler();
         validatorHandler.setContentHandler(myDefaultHandler);
 
-        InputSource is = new InputSource(filenameToURL(XML_DIR + "shiporder11.xml"));
+        String xmlPathUri = Path.of(XML_DIR).resolve("shiporder11.xml").toUri().toASCIIString();
+        InputSource is = new InputSource(xmlPathUri);
 
         SAXParserFactory parserFactory = SAXParserFactory.newInstance();
         parserFactory.setNamespaceAware(true);
@@ -77,13 +77,13 @@ public class TypeInfoProviderTest {
 
     private class MyDefaultHandler extends DefaultHandler {
 
-        public void startElement(String namespaceURI, String localName, String qName, Attributes atts) throws SAXException {
+        public void startElement(String namespaceURI, String localName, String qName, Attributes atts) {
             TypeInfoProvider typeInfoProvider = validatorHandler.getTypeInfoProvider();
             int index = atts.getIndex("orderid");
             if (index != -1) {
                 System.out.println(" Index " + index);
                 System.out.println(" ElementType " + typeInfoProvider.getElementTypeInfo().getTypeName());
-                assertEquals(typeInfoProvider.getAttributeTypeInfo(index).getTypeName(), "string");
+                assertEquals("string", typeInfoProvider.getAttributeTypeInfo(index).getTypeName());
                 assertTrue(typeInfoProvider.isSpecified(index));
                 assertFalse(typeInfoProvider.isIdAttribute(index));
             }
diff --git a/test/jaxp/javax/xml/jaxp/functional/javax/xml/validation/ptests/ValidatorHandlerTest.java b/test/jaxp/javax/xml/jaxp/functional/javax/xml/validation/ptests/ValidatorHandlerTest.java
index 2bbed60ba37..b6c66070417 100644
--- a/test/jaxp/javax/xml/jaxp/functional/javax/xml/validation/ptests/ValidatorHandlerTest.java
+++ b/test/jaxp/javax/xml/jaxp/functional/javax/xml/validation/ptests/ValidatorHandlerTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1999, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1999, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -22,37 +22,39 @@
  */
 package javax.xml.validation.ptests;
 
-import static javax.xml.XMLConstants.W3C_XML_SCHEMA_NS_URI;
-import static javax.xml.validation.ptests.ValidationTestConst.XML_DIR;
-import static org.testng.Assert.assertFalse;
-import static org.testng.Assert.assertNotNull;
-import static org.testng.Assert.assertNull;
-import static org.testng.Assert.assertSame;
-import static org.testng.Assert.assertTrue;
-
-import java.io.File;
-
-import javax.xml.validation.Schema;
-import javax.xml.validation.SchemaFactory;
-import javax.xml.validation.ValidatorHandler;
-
-import org.testng.annotations.BeforeClass;
-import org.testng.annotations.Test;
+import org.junit.jupiter.api.Test;
+import org.junit.jupiter.api.TestInstance;
 import org.xml.sax.ContentHandler;
 import org.xml.sax.ErrorHandler;
 import org.xml.sax.SAXException;
 import org.xml.sax.SAXNotRecognizedException;
 import org.xml.sax.SAXNotSupportedException;
 import org.xml.sax.helpers.DefaultHandler;
+import org.junit.jupiter.api.BeforeAll;
+
+import javax.xml.validation.Schema;
+import javax.xml.validation.SchemaFactory;
+import javax.xml.validation.ValidatorHandler;
+import java.io.File;
+
+import static javax.xml.XMLConstants.W3C_XML_SCHEMA_NS_URI;
+import static javax.xml.validation.ptests.ValidationTestConst.XML_DIR;
+import static org.junit.jupiter.api.Assertions.assertFalse;
+import static org.junit.jupiter.api.Assertions.assertNotNull;
+import static org.junit.jupiter.api.Assertions.assertNull;
+import static org.junit.jupiter.api.Assertions.assertSame;
+import static org.junit.jupiter.api.Assertions.assertThrows;
+import static org.junit.jupiter.api.Assertions.assertTrue;
 
 /*
  * @test
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm javax.xml.validation.ptests.ValidatorHandlerTest
+ * @run junit/othervm javax.xml.validation.ptests.ValidatorHandlerTest
  * @summary Class containing the test cases for ValidatorHandler API
  */
+@TestInstance(TestInstance.Lifecycle.PER_CLASS)
 public class ValidatorHandlerTest {
-    @BeforeClass
+    @BeforeAll
     public void setup() throws SAXException {
         schema = SchemaFactory.newInstance(W3C_XML_SCHEMA_NS_URI).newSchema(new File(XML_DIR + "test.xsd"));
 
@@ -66,60 +68,57 @@ public class ValidatorHandlerTest {
 
         ErrorHandler handler = new MyErrorHandler();
         validatorHandler.setErrorHandler(handler);
-        assertSame(validatorHandler.getErrorHandler(), handler);
-
+        assertSame(handler, validatorHandler.getErrorHandler());
     }
 
-    @Test(expectedExceptions = SAXNotRecognizedException.class)
-    public void testGetUnrecognizedProperty() throws SAXNotRecognizedException, SAXNotSupportedException {
+    @Test
+    public void testGetUnrecognizedProperty() {
         ValidatorHandler validatorHandler = getValidatorHandler();
-        validatorHandler.getProperty(FEATURE_NAME);
-
+        assertThrows(SAXNotRecognizedException.class, () -> validatorHandler.getProperty(FEATURE_NAME));
     }
 
-    @Test(expectedExceptions = SAXNotRecognizedException.class)
-    public void testSetUnrecognizedProperty() throws SAXNotRecognizedException, SAXNotSupportedException {
+    @Test
+    public void testSetUnrecognizedProperty() {
         ValidatorHandler validatorHandler = getValidatorHandler();
-        validatorHandler.setProperty(FEATURE_NAME, "test");
+        assertThrows(SAXNotRecognizedException.class, () -> validatorHandler.setProperty(FEATURE_NAME, "test"));
     }
 
-    @Test(expectedExceptions = NullPointerException.class)
-    public void testGetNullProperty() throws SAXNotRecognizedException, SAXNotSupportedException {
+    @Test
+    public void testGetNullProperty() {
         ValidatorHandler validatorHandler = getValidatorHandler();
         assertNotNull(validatorHandler);
-        validatorHandler.getProperty(null);
+        assertThrows(NullPointerException.class, () -> validatorHandler.getProperty(null));
 
     }
 
-    @Test(expectedExceptions = NullPointerException.class)
-    public void testSetNullProperty() throws SAXNotRecognizedException, SAXNotSupportedException {
+    @Test
+    public void testSetNullProperty() {
         ValidatorHandler validatorHandler = getValidatorHandler();
         assertNotNull(validatorHandler);
-        validatorHandler.setProperty(null, "test");
+        assertThrows(NullPointerException.class, () -> validatorHandler.setProperty(null, "test"));
     }
 
+    @Test
     public void testFeature() throws SAXNotRecognizedException, SAXNotSupportedException {
         ValidatorHandler validatorHandler = getValidatorHandler();
         assertFalse(validatorHandler.getFeature(FEATURE_NAME), "The feature should be false by default.");
 
         validatorHandler.setFeature(FEATURE_NAME, true);
         assertTrue(validatorHandler.getFeature(FEATURE_NAME), "The feature should be false by default.");
-
     }
 
-    @Test(expectedExceptions = NullPointerException.class)
-    public void testGetNullFeature() throws SAXNotRecognizedException, SAXNotSupportedException {
+    @Test
+    public void testGetNullFeature() {
         ValidatorHandler validatorHandler = getValidatorHandler();
         assertNotNull(validatorHandler);
-        validatorHandler.getFeature(null);
-
+        assertThrows(NullPointerException.class, () -> validatorHandler.getFeature(null));
     }
 
-    @Test(expectedExceptions = NullPointerException.class)
-    public void testSetNullFeature() throws SAXNotRecognizedException, SAXNotSupportedException {
+    @Test
+    public void testSetNullFeature() {
         ValidatorHandler validatorHandler = getValidatorHandler();
         assertNotNull(validatorHandler);
-        validatorHandler.setFeature(null, true);
+        assertThrows(NullPointerException.class, () -> validatorHandler.setFeature(null, true));
     }
 
     @Test
@@ -129,11 +128,10 @@ public class ValidatorHandlerTest {
 
         ContentHandler handler = new DefaultHandler();
         validatorHandler.setContentHandler(handler);
-        assertSame(validatorHandler.getContentHandler(), handler);
+        assertSame(handler, validatorHandler.getContentHandler());
 
         validatorHandler.setContentHandler(null);
         assertNull(validatorHandler.getContentHandler());
-
     }
 
     private ValidatorHandler getValidatorHandler() {
diff --git a/test/jaxp/javax/xml/jaxp/functional/javax/xml/validation/ptests/ValidatorTest.java b/test/jaxp/javax/xml/jaxp/functional/javax/xml/validation/ptests/ValidatorTest.java
index 6dbd38a7fa1..f2cbeb1ebeb 100644
--- a/test/jaxp/javax/xml/jaxp/functional/javax/xml/validation/ptests/ValidatorTest.java
+++ b/test/jaxp/javax/xml/jaxp/functional/javax/xml/validation/ptests/ValidatorTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1999, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1999, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -22,15 +22,18 @@
  */
 package javax.xml.validation.ptests;
 
-import static javax.xml.XMLConstants.W3C_XML_SCHEMA_NS_URI;
-import static javax.xml.validation.ptests.ValidationTestConst.XML_DIR;
-import static jaxp.library.JAXPTestUtilities.filenameToURL;
-import static org.testng.Assert.assertNotNull;
-import static org.testng.Assert.assertNull;
-import static org.testng.Assert.assertSame;
-
-import java.io.File;
-import java.io.IOException;
+import org.junit.jupiter.api.BeforeAll;
+import org.junit.jupiter.api.Test;
+import org.junit.jupiter.api.TestInstance;
+import org.junit.jupiter.api.TestInstance.Lifecycle;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
+import org.w3c.dom.Document;
+import org.xml.sax.ErrorHandler;
+import org.xml.sax.InputSource;
+import org.xml.sax.SAXException;
+import org.xml.sax.SAXNotRecognizedException;
+import org.xml.sax.helpers.DefaultHandler;
 
 import javax.xml.parsers.DocumentBuilderFactory;
 import javax.xml.parsers.ParserConfigurationException;
@@ -44,33 +47,33 @@ import javax.xml.transform.stream.StreamSource;
 import javax.xml.validation.Schema;
 import javax.xml.validation.SchemaFactory;
 import javax.xml.validation.Validator;
+import java.io.File;
+import java.io.IOException;
+import java.nio.file.Paths;
 
-import org.testng.annotations.BeforeClass;
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
-import org.w3c.dom.Document;
-import org.xml.sax.ErrorHandler;
-import org.xml.sax.InputSource;
-import org.xml.sax.SAXException;
-import org.xml.sax.SAXNotRecognizedException;
-import org.xml.sax.SAXNotSupportedException;
-import org.xml.sax.helpers.DefaultHandler;
+import static javax.xml.XMLConstants.W3C_XML_SCHEMA_NS_URI;
+import static javax.xml.validation.ptests.ValidationTestConst.XML_DIR;
+import static org.junit.jupiter.api.Assertions.assertNotNull;
+import static org.junit.jupiter.api.Assertions.assertNull;
+import static org.junit.jupiter.api.Assertions.assertSame;
+import static org.junit.jupiter.api.Assertions.assertThrows;
 
 /*
  * @test
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm javax.xml.validation.ptests.ValidatorTest
+ * @run junit/othervm javax.xml.validation.ptests.ValidatorTest
  * @summary Class containing the test cases for Validator API
  */
+@TestInstance(Lifecycle.PER_CLASS)
 public class ValidatorTest {
 
-    @BeforeClass
+    @BeforeAll
     public void setup() throws SAXException, IOException, ParserConfigurationException {
         schema = SchemaFactory.newInstance(W3C_XML_SCHEMA_NS_URI).newSchema(new File(XML_DIR + "test.xsd"));
 
         assertNotNull(schema);
 
-        xmlFileUri = filenameToURL(XML_DIR + "test.xml");
+        xmlFileUri = Paths.get(XML_DIR).resolve("test.xml").toUri().toASCIIString();
 
         DocumentBuilderFactory dbf = DocumentBuilderFactory.newInstance();
         dbf.setNamespaceAware(true);
@@ -84,11 +87,11 @@ public class ValidatorTest {
         validator.validate(getStreamSource());
     }
 
-    @Test(expectedExceptions = NullPointerException.class)
-    public void testValidateNullSource() throws SAXException, IOException {
+    @Test
+    public void testValidateNullSource() {
         Validator validator = getValidator();
         assertNotNull(validator);
-        validator.validate(null);
+        assertThrows(NullPointerException.class, () -> validator.validate(null));
     }
 
     @Test
@@ -98,11 +101,10 @@ public class ValidatorTest {
 
         ErrorHandler mh = new MyErrorHandler();
         validator.setErrorHandler(mh);
-        assertSame(validator.getErrorHandler(), mh);
+        assertSame(mh, validator.getErrorHandler());
 
     }
 
-    @DataProvider(name = "source-result")
     public Object[][] getSourceAndResult() {
         return new Object[][] {
                 { getStreamSource(), null },
@@ -112,66 +114,65 @@ public class ValidatorTest {
                 { getDOMSource(), null } };
     }
 
-    @Test(dataProvider = "source-result")
+    @ParameterizedTest
+    @MethodSource("getSourceAndResult")
     public void testValidateWithResult(Source source, Result result) throws SAXException, IOException {
         Validator validator = getValidator();
         validator.validate(source, result);
     }
 
-    @Test(expectedExceptions = SAXNotRecognizedException.class)
-    public void testGetUnrecognizedProperty() throws SAXNotRecognizedException, SAXNotSupportedException {
+    @Test
+    public void testGetUnrecognizedProperty() {
         Validator validator = getValidator();
-        validator.getProperty(UNRECOGNIZED_NAME);
+        assertThrows(SAXNotRecognizedException.class, () -> validator.getProperty(UNRECOGNIZED_NAME));
 
     }
 
-    @Test(expectedExceptions = SAXNotRecognizedException.class)
-    public void testSetUnrecognizedProperty() throws SAXNotRecognizedException, SAXNotSupportedException {
+    @Test
+    public void testSetUnrecognizedProperty() {
         Validator validator = getValidator();
-        validator.setProperty(UNRECOGNIZED_NAME, "test");
+        assertThrows(SAXNotRecognizedException.class, () -> validator.setProperty(UNRECOGNIZED_NAME, "test"));
     }
 
-    @Test(expectedExceptions = NullPointerException.class)
-    public void testGetNullProperty() throws SAXNotRecognizedException, SAXNotSupportedException {
+    @Test
+    public void testGetNullProperty() {
         Validator validator = getValidator();
         assertNotNull(validator);
-        validator.getProperty(null);
-
+        assertThrows(NullPointerException.class, () -> validator.getProperty(null));
     }
 
-    @Test(expectedExceptions = NullPointerException.class)
-    public void testSetNullProperty() throws SAXNotRecognizedException, SAXNotSupportedException {
+    @Test
+    public void testSetNullProperty() {
         Validator validator = getValidator();
         assertNotNull(validator);
-        validator.setProperty(null, "test");
+        assertThrows(NullPointerException.class, () -> validator.setProperty(null, "test"));
     }
 
-    @Test(expectedExceptions = SAXNotRecognizedException.class)
-    public void testGetUnrecognizedFeature() throws SAXNotRecognizedException, SAXNotSupportedException {
+    @Test
+    public void testGetUnrecognizedFeature() {
         Validator validator = getValidator();
-        validator.getFeature(UNRECOGNIZED_NAME);
+        assertThrows(SAXNotRecognizedException.class, () -> validator.getFeature(UNRECOGNIZED_NAME));
 
     }
 
-    @Test(expectedExceptions = SAXNotRecognizedException.class)
-    public void testSetUnrecognizedFeature() throws SAXNotRecognizedException, SAXNotSupportedException {
+    @Test
+    public void testSetUnrecognizedFeature() {
         Validator validator = getValidator();
-        validator.setFeature(UNRECOGNIZED_NAME, true);
+        assertThrows(SAXNotRecognizedException.class, () -> validator.setFeature(UNRECOGNIZED_NAME, true));
     }
 
-    @Test(expectedExceptions = NullPointerException.class)
-    public void testGetNullFeature() throws SAXNotRecognizedException, SAXNotSupportedException {
+    @Test
+    public void testGetNullFeature() {
         Validator validator = getValidator();
         assertNotNull(validator);
-        validator.getFeature(null);
-
+        assertThrows(NullPointerException.class, () -> validator.getFeature(null));
     }
 
-    @Test(expectedExceptions = NullPointerException.class)
-    public void testSetNullFeature() throws SAXNotRecognizedException, SAXNotSupportedException {
+    @Test
+    public void testSetNullFeature() {
         Validator validator = getValidator();
         assertNotNull(validator);
-        validator.setFeature(null, true);
+        assertThrows(NullPointerException.class, () -> validator.setFeature(null, true));
     }
 
     private Validator getValidator() {
@@ -204,5 +205,4 @@ public class ValidatorTest {
     private String xmlFileUri;
     private Schema schema;
     private Document xmlDoc;
-
 }
diff --git a/test/jaxp/javax/xml/jaxp/functional/javax/xml/xpath/ptests/XPathEvaluationResultTest.java b/test/jaxp/javax/xml/jaxp/functional/javax/xml/xpath/ptests/XPathEvaluationResultTest.java
index 5daf8adcfa6..81a9fdfa099 100644
--- a/test/jaxp/javax/xml/jaxp/functional/javax/xml/xpath/ptests/XPathEvaluationResultTest.java
+++ b/test/jaxp/javax/xml/jaxp/functional/javax/xml/xpath/ptests/XPathEvaluationResultTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2020, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,34 +23,32 @@
 
 package javax.xml.xpath.ptests;
 
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
 import org.w3c.dom.Node;
 
 import javax.xml.namespace.QName;
 import javax.xml.xpath.XPathConstants;
 import javax.xml.xpath.XPathEvaluationResult;
 import javax.xml.xpath.XPathNodes;
-import java.math.BigDecimal;
-import java.math.BigInteger;
-import java.util.concurrent.atomic.AtomicInteger;
-import java.util.concurrent.atomic.AtomicLong;
 
-import static org.testng.Assert.*;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertNotNull;
 
 /*
  * @test
  * @bug 8183266
  * @summary verifies the specification of the XPathEvaluationResult API
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm javax.xml.xpath.ptests.XPathEvaluationResultTest
+ * @run junit/othervm javax.xml.xpath.ptests.XPathEvaluationResultTest
  */
 public class XPathEvaluationResultTest {
 
     /*
      * Test getQNameType returns QName type for supported types and Number subtypes
      */
-    @Test(dataProvider = "supportedTypes")
+    @ParameterizedTest
+    @MethodSource("getSupportedTypes")
     public void testQNameTypeSupportedTypes(QName expectedQName, Class<?> type) {
         QName qName = XPathEvaluationResult.XPathResultType.getQNameType(type);
         assertNotNull(qName);
@@ -60,53 +58,16 @@ public class XPathEvaluationResultTest {
     /*
      * Test getQNameType returns null when type is not supported
      */
-    @Test(dataProvider = "unsupportedTypes")
-    public void testQNameTypeUnsupportedTypes(Class<?> type) {
-        QName qName = XPathEvaluationResult.XPathResultType.getQNameType(type);
-        assertNull(qName);
-    }
-
-    /*
-     * Test getQNameType is null safe
-     */
-    @Test
-    public void testQNameTypeNullType() {
-        QName qName = XPathEvaluationResult.XPathResultType.getQNameType(null);
-        assertNull(qName);
-    }
-
-    /*
-     * DataProvider: Class types supported
-     */
-    @DataProvider(name = "supportedTypes")
-    public Object[][] getSupportedTypes() {
-        return new Object[][]{
-                {XPathConstants.STRING, String.class},
-                {XPathConstants.BOOLEAN, Boolean.class},
-                {XPathConstants.NODESET, XPathNodes.class},
-                {XPathConstants.NODE, Node.class},
-                {XPathConstants.NUMBER, Long.class},
-                {XPathConstants.NUMBER, Integer.class},
-                {XPathConstants.NUMBER, Double.class},
-                {XPathConstants.NUMBER, Number.class}
-        };
-    }
-
-    /*
-     * DataProvider: Class types not supported
-     */
-    @DataProvider(name = "unsupportedTypes")
-    public Object[][] getUnsupportedTypes() {
-        return new Object[][]{
-                new Object[]{AtomicInteger.class},
-                new Object[]{AtomicLong.class},
-                new Object[]{BigDecimal.class},
-                new Object[]{BigInteger.class},
-                new Object[]{Byte.class},
-                new Object[]{Float.class},
-                new Object[]{Short.class},
-                new Object[]{Character.class},
-                new Object[]{StringBuilder.class},
+    public static Object[][] getSupportedTypes() {
+        return new Object[][] {
+                { XPathConstants.STRING, String.class },
+                { XPathConstants.BOOLEAN, Boolean.class },
+                { XPathConstants.NODESET, XPathNodes.class },
+                { XPathConstants.NODE, Node.class },
+                { XPathConstants.NUMBER, Long.class },
+                { XPathConstants.NUMBER, Integer.class },
+                { XPathConstants.NUMBER, Double.class },
+                { XPathConstants.NUMBER, Number.class }
         };
     }
 }
diff --git a/test/jaxp/javax/xml/jaxp/functional/javax/xml/xpath/ptests/XPathExpressionTest.java b/test/jaxp/javax/xml/jaxp/functional/javax/xml/xpath/ptests/XPathExpressionTest.java
index c63b161aae9..bdd21937504 100644
--- a/test/jaxp/javax/xml/jaxp/functional/javax/xml/xpath/ptests/XPathExpressionTest.java
+++ b/test/jaxp/javax/xml/jaxp/functional/javax/xml/xpath/ptests/XPathExpressionTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,32 +23,33 @@
 
 package javax.xml.xpath.ptests;
 
+import org.junit.jupiter.api.BeforeEach;
+import org.junit.jupiter.api.Test;
+import org.w3c.dom.Attr;
+import org.w3c.dom.Document;
+import org.w3c.dom.NodeList;
+import org.xml.sax.InputSource;
+
+import javax.xml.XMLConstants;
+import javax.xml.namespace.QName;
+import javax.xml.parsers.DocumentBuilderFactory;
+import javax.xml.xpath.XPath;
+import javax.xml.xpath.XPathExpression;
+import javax.xml.xpath.XPathExpressionException;
+import javax.xml.xpath.XPathFactory;
+import java.io.InputStream;
+import java.nio.file.Files;
+import java.nio.file.Path;
+import java.nio.file.Paths;
+
 import static javax.xml.xpath.XPathConstants.BOOLEAN;
 import static javax.xml.xpath.XPathConstants.NODE;
 import static javax.xml.xpath.XPathConstants.NODESET;
 import static javax.xml.xpath.XPathConstants.NUMBER;
 import static javax.xml.xpath.XPathConstants.STRING;
 import static javax.xml.xpath.ptests.XPathTestConst.XML_DIR;
-import static org.testng.Assert.assertEquals;
-
-import java.io.InputStream;
-import java.nio.file.Files;
-import java.nio.file.Path;
-import java.nio.file.Paths;
-
-import javax.xml.XMLConstants;
-import javax.xml.namespace.QName;
-import javax.xml.parsers.DocumentBuilderFactory;
-import javax.xml.xpath.XPath;
-import javax.xml.xpath.XPathExpressionException;
-import javax.xml.xpath.XPathFactory;
-
-import org.testng.annotations.BeforeTest;
-import org.testng.annotations.Test;
-import org.w3c.dom.Attr;
-import org.w3c.dom.Document;
-import org.w3c.dom.NodeList;
-import org.xml.sax.InputSource;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertThrows;
 
 /**
  * Class containing the test cases for XPathExpression API.
@@ -56,7 +57,7 @@ import org.xml.sax.InputSource;
 /*
  * @test
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm javax.xml.xpath.ptests.XPathExpressionTest
+ * @run junit/othervm javax.xml.xpath.ptests.XPathExpressionTest
  */
 public class XPathExpressionTest {
     /**
@@ -77,7 +78,7 @@ public class XPathExpressionTest {
     /**
      * XML File Path.
      */
-    private static final Path XML_PATH = Paths.get(XML_DIR + "widgets.xml");
+    private static final Path XML_PATH = XML_DIR.resolve("widgets.xml");
 
     /**
      * An expression name which locate at "/widgets/widget[@name='a']/@quantity"
@@ -93,7 +94,7 @@ public class XPathExpressionTest {
      * Create Document object and XPath object for every time
      * @throws Exception If any errors occur.
      */
-    @BeforeTest
+    @BeforeEach
     public void setup() throws Exception {
         document = DocumentBuilderFactory.newInstance().newDocumentBuilder().parse(XML_PATH.toFile());
         xpath = XPathFactory.newInstance().newXPath();
@@ -102,303 +103,190 @@ public class XPathExpressionTest {
     /**
      * Test for evaluate(java.lang.Object item,QName returnType)throws
      * XPathExpressionException.
-     *
-     * @throws XPathExpressionException If the expression cannot be evaluated.
      */
     @Test
     public void testCheckXPathExpression01() throws XPathExpressionException {
-        assertEquals(xpath.compile(EXPRESSION_NAME_A).
-                evaluate(document, STRING), "6");
+        assertEquals("6", xpath.compile(EXPRESSION_NAME_A).
+                evaluate(document, STRING));
     }
 
     /**
      * evaluate(java.lang.Object item,QName returnType) throws NPE if input
      * source is null.
-     *
-     * @throws XPathExpressionException If the expression cannot be evaluated.
      */
-    @Test(expectedExceptions = NullPointerException.class)
+    @Test
     public void testCheckXPathExpression02() throws XPathExpressionException {
-        xpath.compile(EXPRESSION_NAME_A).evaluate(null, STRING);
+        XPathExpression expr = xpath.compile(EXPRESSION_NAME_A);
+        assertThrows(NullPointerException.class, () -> expr.evaluate(null, STRING));
     }
 
     /**
      * evaluate(java.lang.Object item,QName returnType) throws NPE if returnType
      * is null.
-     *
-     * @throws XPathExpressionException If the expression cannot be evaluated.
      */
-    @Test(expectedExceptions = NullPointerException.class)
+    @Test
     public void testCheckXPathExpression03() throws XPathExpressionException {
-        xpath.compile(EXPRESSION_NAME_A).evaluate(document, null);
+        XPathExpression expr = xpath.compile(EXPRESSION_NAME_A);
+        assertThrows(NullPointerException.class, () -> expr.evaluate(document, null));
     }
 
     /**
      * Test for method evaluate(java.lang.Object item,QName returnType).If a
      * request is made to evaluate the expression in the absence of a context
      * item, simple expressions, such as "1+1", can be evaluated.
-     *
-     * @throws XPathExpressionException If the expression cannot be evaluated.
      */
     @Test
     public void testCheckXPathExpression04() throws XPathExpressionException {
-        assertEquals(xpath.compile("1+1").evaluate(document, STRING), "2");
+        assertEquals("2", xpath.compile("1+1").evaluate(document, STRING));
     }
 
     /**
      * evaluate(java.lang.Object item,QName returnType) throws IAE If returnType
      * is not one of the types defined in XPathConstants.
-     *
-     * @throws XPathExpressionException If the expression cannot be evaluated.
      */
-    @Test(expectedExceptions = IllegalArgumentException.class)
+    @Test
     public void testCheckXPathExpression05() throws XPathExpressionException {
-        xpath.compile(EXPRESSION_NAME_A).evaluate(document, TEST_QNAME);
+        XPathExpression expr = xpath.compile(EXPRESSION_NAME_A);
+        assertThrows(IllegalArgumentException.class, () -> expr.evaluate(document, TEST_QNAME));
     }
 
     /**
      * evaluate(java.lang.Object item,QName returnType) return correct boolean
      * value if returnType is Boolean.
-     *
-     * @throws XPathExpressionException If the expression cannot be evaluated.
      */
     @Test
     public void testCheckXPathExpression06() throws XPathExpressionException {
-        assertEquals(xpath.compile(EXPRESSION_NAME_A).
-                evaluate(document, BOOLEAN), true);
+        assertEquals(true, xpath.compile(EXPRESSION_NAME_A).
+                evaluate(document, BOOLEAN));
     }
 
     /**
      * evaluate(java.lang.Object item,QName returnType) return correct boolean
      * value if returnType is Boolean.
-     *
-     * @throws XPathExpressionException If the expression cannot be evaluated.
      */
     @Test
     public void testCheckXPathExpression07() throws XPathExpressionException {
-        assertEquals(xpath.compile(EXPRESSION_NAME_B).
-            evaluate(document, BOOLEAN), false);
+        assertEquals(false, xpath.compile(EXPRESSION_NAME_B).
+                evaluate(document, BOOLEAN));
     }
 
     /**
      * evaluate(java.lang.Object item,QName returnType) return correct number
      * value when return type is Double.
-     *
-     * @throws XPathExpressionException If the expression cannot be evaluated.
      */
     @Test
     public void testCheckXPathExpression08() throws XPathExpressionException {
-        assertEquals(xpath.compile(EXPRESSION_NAME_A).
-            evaluate(document, NUMBER), 6d);
+        assertEquals(6d, xpath.compile(EXPRESSION_NAME_A).
+                evaluate(document, NUMBER));
     }
 
     /**
      * evaluate(java.lang.Object item,QName returnType) evaluate an attribute
      * value which returnType is Node.
-     *
-     * @throws XPathExpressionException If the expression cannot be evaluated.
      */
     @Test
     public void testCheckXPathExpression09() throws XPathExpressionException {
         Attr attr = (Attr) xpath.compile(EXPRESSION_NAME_A).
                 evaluate(document, NODE);
-        assertEquals(attr.getValue(), "6");
+        assertEquals("6", attr.getValue());
     }
 
     /**
      * evaluate(java.lang.Object item,QName returnType) evaluate an attribute
      * value which returnType is NodeList.
-     *
-     * @throws XPathExpressionException If the expression cannot be evaluated.
      */
     @Test
     public void testCheckXPathExpression10() throws XPathExpressionException {
         NodeList nodeList = (NodeList) xpath.compile(EXPRESSION_NAME_A).
                 evaluate(document, NODESET);
         Attr attr = (Attr) nodeList.item(0);
-        assertEquals(attr.getValue(), "6");
+        assertEquals("6", attr.getValue());
     }
 
     /**
      * Test for evaluate(java.lang.Object item) when returnType is left off of
      * the XPath.evaluate method, all expressions are evaluated to a String
      * value.
-     *
-     * @throws XPathExpressionException If the expression cannot be evaluated.
      */
     @Test
     public void testCheckXPathExpression11() throws XPathExpressionException {
-        assertEquals(xpath.compile(EXPRESSION_NAME_A).evaluate(document), "6");
-    }
-
-    /**
-     * evaluate(java.lang.Object item) throws NPE if expression is null.
-     *
-     * @throws XPathExpressionException If the expression cannot be evaluated.
-     */
-    @Test(expectedExceptions = NullPointerException.class)
-    public void testCheckXPathExpression12() throws XPathExpressionException {
-        xpath.compile(null).evaluate(document);
+        assertEquals("6", xpath.compile(EXPRESSION_NAME_A).evaluate(document));
     }
 
     /**
      * evaluate(java.lang.Object item) when a request is made to evaluate the
      * expression in the absence of a context item, simple expressions, such as
      * "1+1", can be evaluated.
-     *
-     * @throws XPathExpressionException If the expression cannot be evaluated.
      */
     @Test
     public void testCheckXPathExpression13() throws XPathExpressionException {
-        assertEquals(xpath.compile("1+1").evaluate(document), "2");
+        assertEquals("2", xpath.compile("1+1").evaluate(document));
     }
 
     /**
      * evaluate(java.lang.Object item) throws NPE if document is null.
-     *
-     * @throws XPathExpressionException If the expression cannot be evaluated.
      */
-    @Test(expectedExceptions = NullPointerException.class)
+    @Test
     public void testCheckXPathExpression14() throws XPathExpressionException {
-        xpath.compile(EXPRESSION_NAME_A).evaluate(null);
+        XPathExpression expr = xpath.compile(EXPRESSION_NAME_A);
+        assertThrows(NullPointerException.class, () -> expr.evaluate(null));
     }
 
     /**
      * valuate(InputSource source) return a string value if return type is
      * String.
-     *
-     * @throws Exception If any errors occur.
      */
     @Test
     public void testCheckXPathExpression15() throws Exception {
         try (InputStream is = Files.newInputStream(XML_PATH)) {
-            assertEquals(xpath.compile(EXPRESSION_NAME_A).
-                    evaluate(new InputSource(is)), "6");
+            assertEquals("6", xpath.compile(EXPRESSION_NAME_A).
+                    evaluate(new InputSource(is)));
         }
     }
 
     /**
      * evaluate(InputSource source) throws NPE if input source is null.
-     *
-     * @throws XPathExpressionException If the expression cannot be evaluated.
      */
-    @Test(expectedExceptions = NullPointerException.class)
+    @Test
     public void testCheckXPathExpression16() throws XPathExpressionException {
-        xpath.compile(EXPRESSION_NAME_A).evaluate(null);
-    }
-
-    /**
-     * evaluate(InputSource source) throws NPE if expression is null.
-     *
-     * @throws Exception If any errors occur.
-     */
-    @Test(expectedExceptions = NullPointerException.class)
-    public void testCheckXPathExpression17() throws Exception {
-        try (InputStream is = Files.newInputStream(XML_PATH)) {
-            xpath.compile(null).evaluate(new InputSource(is));
-        }
-    }
-
-    /**
-     * evaluate(InputSource source) throws XPathExpressionException if
-     * returnType is String junk characters.
-     *
-     * @throws Exception If any errors occur.
-     */
-    @Test(expectedExceptions = XPathExpressionException.class)
-    public void testCheckXPathExpression18() throws Exception {
-        try (InputStream is = Files.newInputStream(XML_PATH)) {
-            xpath.compile("-*&").evaluate(new InputSource(is));
-        }
-    }
-
-    /**
-     * evaluate(InputSource source) throws XPathExpressionException if
-     * expression is a blank string " ".
-     *
-     * @throws Exception If any errors occur.
-     */
-    @Test(expectedExceptions = XPathExpressionException.class)
-    public void testCheckXPathExpression19() throws Exception {
-        try (InputStream is = Files.newInputStream(XML_PATH)) {
-            xpath.compile(" ").evaluate(new InputSource(is));
-        }
+        XPathExpression expr = xpath.compile(EXPRESSION_NAME_A);
+        assertThrows(NullPointerException.class, () -> expr.evaluate(null));
     }
 
     /**
      * Test for evaluate(InputSource source,QName returnType) returns a string
      * value if returnType is String.
-     *
-     * @throws Exception If any errors occur.
      */
     @Test
     public void testCheckXPathExpression20() throws Exception {
         try (InputStream is = Files.newInputStream(XML_PATH)) {
-            assertEquals(xpath.compile(EXPRESSION_NAME_A).
-                evaluate(new InputSource(is), STRING), "6");
+            assertEquals("6", xpath.compile(EXPRESSION_NAME_A).
+                    evaluate(new InputSource(is), STRING));
         }
     }
 
     /**
      * evaluate(InputSource source,QName returnType) throws NPE if source is
      * null.
-     *
-     * @throws XPathExpressionException If the expression cannot be evaluated.
      */
-    @Test(expectedExceptions = NullPointerException.class)
+    @Test
     public void testCheckXPathExpression21() throws XPathExpressionException {
-        xpath.compile(EXPRESSION_NAME_A).evaluate(null, STRING);
-    }
-
-    /**
-     * evaluate(InputSource source,QName returnType) throws NPE if expression is
-     * null.
-     *
-     * @throws Exception If any errors occur.
-     */
-    @Test(expectedExceptions = NullPointerException.class)
-    public void testCheckXPathExpression22() throws Exception {
-        try (InputStream is = Files.newInputStream(XML_PATH)) {
-            xpath.compile(null).evaluate(new InputSource(is), STRING);
-        }
+        XPathExpression expr = xpath.compile(EXPRESSION_NAME_A);
+        assertThrows(NullPointerException.class, () -> expr.evaluate(null, STRING));
     }
 
     /**
      * evaluate(InputSource source,QName returnType) throws NPE if returnType is
      * null.
-     *
-     * @throws Exception If any errors occur.
      */
-    @Test(expectedExceptions = NullPointerException.class)
+    @Test
     public void testCheckXPathExpression23() throws Exception {
         try (InputStream is = Files.newInputStream(XML_PATH)) {
-            xpath.compile(EXPRESSION_NAME_A).evaluate(new InputSource(is), null);
-        }
-    }
-
-    /**
-     * evaluate(InputSource source,QName returnType) throws
-     * XPathExpressionException if expression is junk characters.
-     *
-     * @throws Exception If any errors occur.
-     */
-    @Test(expectedExceptions = XPathExpressionException.class)
-    public void testCheckXPathExpression24() throws Exception {
-        try (InputStream is = Files.newInputStream(XML_PATH)) {
-            xpath.compile("-*&").evaluate(new InputSource(is), STRING);
-        }
-    }
-
-    /**
-     * evaluate(InputSource source,QName returnType) throws
-     * XPathExpressionException if expression is blank " ".
-     *
-     * @throws Exception If any errors occur.
-     */
-    @Test(expectedExceptions = XPathExpressionException.class)
-    public void testCheckXPathExpression25() throws Exception {
-        try (InputStream is = Files.newInputStream(XML_PATH)) {
-            xpath.compile(" ").evaluate(new InputSource(is), STRING);
+            XPathExpression expr = xpath.compile(EXPRESSION_NAME_A);
+            InputSource source = new InputSource(is);
+            assertThrows(
+                    NullPointerException.class,
+                    () -> expr.evaluate(source, null));
         }
     }
 
@@ -406,85 +294,75 @@ public class XPathExpressionTest {
      * evaluate(InputSource source,QName returnType) throws
      * IllegalArgumentException if returnType is not one of the types defined
      * in XPathConstants.
-     *
-     * @throws Exception If any errors occur.
      */
-    @Test(expectedExceptions = IllegalArgumentException.class)
+    @Test
     public void testCheckXPathExpression26() throws Exception {
         try (InputStream is = Files.newInputStream(XML_PATH)) {
-            xpath.compile(EXPRESSION_NAME_A).evaluate(new InputSource(is), TEST_QNAME);
+            XPathExpression expr = xpath.compile(EXPRESSION_NAME_A);
+            InputSource source = new InputSource(is);
+            assertThrows(IllegalArgumentException.class, () -> expr.evaluate(source, TEST_QNAME));
         }
     }
 
     /**
      * evaluate(InputSource source,QName returnType) return a correct boolean
      * value if returnType is Boolean.
-     *
-     * @throws Exception If any errors occur.
      */
     @Test
     public void testCheckXPathExpression27() throws Exception {
         try (InputStream is = Files.newInputStream(XML_PATH)) {
-            assertEquals(xpath.compile(EXPRESSION_NAME_A).
-                evaluate(new InputSource(is), BOOLEAN), true);
+            assertEquals(true, xpath.compile(EXPRESSION_NAME_A).
+                    evaluate(new InputSource(is), BOOLEAN));
         }
     }
 
     /**
      * evaluate(InputSource source,QName returnType) return a correct boolean
      * value if returnType is Boolean.
-     *
-     * @throws Exception If any errors occur.
      */
     @Test
     public void testCheckXPathExpression28() throws Exception {
         try (InputStream is = Files.newInputStream(XML_PATH)) {
-            assertEquals(xpath.compile(EXPRESSION_NAME_B).
-                evaluate(new InputSource(is), BOOLEAN), false);
+            assertEquals(false, xpath.compile(EXPRESSION_NAME_B).
+                    evaluate(new InputSource(is), BOOLEAN));
         }
     }
 
     /**
      * evaluate(InputSource source,QName returnType) return a correct number
      * value if returnType is Number.
-     *
-     * @throws Exception If any errors occur.
      */
     @Test
     public void testCheckXPathExpression29() throws Exception {
         try (InputStream is = Files.newInputStream(XML_PATH)) {
-            assertEquals(xpath.compile(EXPRESSION_NAME_A).
-                evaluate(new InputSource(is), NUMBER), 6d);
+            assertEquals(6d, xpath.compile(EXPRESSION_NAME_A).
+                    evaluate(new InputSource(is), NUMBER));
         }
     }
 
     /**
      * Test for evaluate(InputSource source,QName returnType) returns a node if
      * returnType is Node.
-     *
-     * @throws Exception If any errors occur.
      */
     @Test
     public void testCheckXPathExpression30() throws Exception {
         try (InputStream is = Files.newInputStream(XML_PATH)) {
             Attr attr = (Attr) xpath.compile(EXPRESSION_NAME_A).
-                evaluate(new InputSource(is), NODE);
-            assertEquals(attr.getValue(), "6");
+                    evaluate(new InputSource(is), NODE);
+            assertEquals("6", attr.getValue());
         }
     }
 
     /**
      * Test for evaluate(InputSource source,QName returnType) return a node list
      * if returnType is NodeList.
-     *
-     * @throws Exception If any errors occur.
      */
     @Test
     public void testCheckXPathExpression31() throws Exception {
         try (InputStream is = Files.newInputStream(XML_PATH)) {
             NodeList nodeList = (NodeList) xpath.compile(EXPRESSION_NAME_A).
-                evaluate(new InputSource(is), NODESET);
-            assertEquals(((Attr) nodeList.item(0)).getValue(), "6");
+                    evaluate(new InputSource(is), NODESET);
+            assertEquals("6", ((Attr) nodeList.item(0)).getValue());
         }
     }
 }
diff --git a/test/jaxp/javax/xml/jaxp/functional/javax/xml/xpath/ptests/XPathFactoryTest.java b/test/jaxp/javax/xml/jaxp/functional/javax/xml/xpath/ptests/XPathFactoryTest.java
index 561c6923eda..3c276f24908 100644
--- a/test/jaxp/javax/xml/jaxp/functional/javax/xml/xpath/ptests/XPathFactoryTest.java
+++ b/test/jaxp/javax/xml/jaxp/functional/javax/xml/xpath/ptests/XPathFactoryTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,23 +23,24 @@
 
 package javax.xml.xpath.ptests;
 
-import static javax.xml.xpath.XPathConstants.DOM_OBJECT_MODEL;
-import static javax.xml.xpath.XPathFactory.DEFAULT_OBJECT_MODEL_URI;
-import static org.testng.Assert.assertNotNull;
-import static org.testng.Assert.assertNotSame;
-import static org.testng.Assert.assertSame;
-import static org.testng.Assert.assertEquals;
-import static org.testng.Assert.assertTrue;
-import static org.testng.Assert.assertFalse;
+import jaxp.library.JAXPDataProvider;
+import org.junit.jupiter.api.Test;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
 
 import javax.xml.xpath.XPath;
 import javax.xml.xpath.XPathFactory;
 import javax.xml.xpath.XPathFactoryConfigurationException;
 
-import jaxp.library.JAXPDataProvider;
-
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
+import static javax.xml.xpath.XPathConstants.DOM_OBJECT_MODEL;
+import static javax.xml.xpath.XPathFactory.DEFAULT_OBJECT_MODEL_URI;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertFalse;
+import static org.junit.jupiter.api.Assertions.assertNotNull;
+import static org.junit.jupiter.api.Assertions.assertNotSame;
+import static org.junit.jupiter.api.Assertions.assertSame;
+import static org.junit.jupiter.api.Assertions.assertThrows;
+import static org.junit.jupiter.api.Assertions.assertTrue;
 
 /**
  * Class containing the test cases for XPathFactory API.
@@ -48,7 +49,8 @@ import org.testng.annotations.Test;
  * @test
  * @bug 8169778
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm javax.xml.xpath.ptests.XPathFactoryTest
+ * @build jaxp.library.JAXPDataProvider
+ * @run junit/othervm javax.xml.xpath.ptests.XPathFactoryTest
  */
 public class XPathFactoryTest {
     /**
@@ -78,9 +80,11 @@ public class XPathFactoryTest {
      *
      * @return a data provider contains XPathFactory instantiation parameters.
      */
-    @DataProvider(name = "parameters")
-    public Object[][] getValidateParameters() {
-        return new Object[][] { { VALID_URL, XPATH_FACTORY_CLASSNAME, null }, { VALID_URL, XPATH_FACTORY_CLASSNAME, this.getClass().getClassLoader() } };
+    public static Object[][] getValidateParameters() {
+        return new Object[][] {
+                { VALID_URL, XPATH_FACTORY_CLASSNAME, null },
+                { VALID_URL, XPATH_FACTORY_CLASSNAME, XPathFactoryTest.class.getClassLoader() },
+        };
     }
 
     /**
@@ -94,8 +98,8 @@ public class XPathFactoryTest {
         XPathFactory xpf2 = XPathFactory.newInstance(DEFAULT_OBJECT_MODEL_URI);
         assertNotSame(xpf1, xpf2, "same instance returned:");
         assertSame(xpf1.getClass(), xpf2.getClass(),
-                  "unexpected class mismatch for newDefaultInstance():");
-        assertEquals(xpf1.getClass().getName(), DEFAULT_IMPL_CLASS);
+                "unexpected class mismatch for newDefaultInstance():");
+        assertEquals(DEFAULT_IMPL_CLASS, xpf1.getClass().getName());
         assertTrue(xpf1.isObjectModelSupported(DEFAULT_OBJECT_MODEL_URI),
                    "isObjectModelSupported(DEFAULT_OBJECT_MODEL_URI):");
         assertFalse(xpf1.isObjectModelSupported(INVALID_URL),
@@ -107,13 +111,9 @@ public class XPathFactoryTest {
      * factoryClassName, java.lang.ClassLoader classLoader) factoryClassName
      * points to correct implementation of javax.xml.xpath.XPathFactory , should
      * return newInstance of XPathFactory
-     *
-     * @param uri
-     * @param factoryClassName
-     * @param classLoader
-     * @throws XPathFactoryConfigurationException
      */
-    @Test(dataProvider = "parameters")
+    @ParameterizedTest
+    @MethodSource("getValidateParameters")
     public void testNewInstance(String uri, String factoryClassName, ClassLoader classLoader) throws XPathFactoryConfigurationException {
         XPathFactory xpf = XPathFactory.newInstance(uri, factoryClassName, classLoader);
         XPath xpath = xpf.newXPath();
@@ -123,39 +123,34 @@ public class XPathFactoryTest {
     /**
      * Test for XPathFactory.newInstance(java.lang.String uri, java.lang.String
      * factoryClassName, java.lang.ClassLoader classLoader)
-     *
-     * @param factoryClassName
-     * @param classLoader
-     * @throws XPathFactoryConfigurationException
-     *             is expected when factoryClassName is null
      */
-    @Test(expectedExceptions = XPathFactoryConfigurationException.class, dataProvider = "new-instance-neg", dataProviderClass = JAXPDataProvider.class)
-    public void testNewInstanceWithNullFactoryClassName(String factoryClassName, ClassLoader classLoader) throws XPathFactoryConfigurationException {
-        XPathFactory.newInstance(VALID_URL, factoryClassName, classLoader);
+    @ParameterizedTest
+    @MethodSource("jaxp.library.JAXPDataProvider#newInstanceNeg")
+    public void testNewInstanceWithNullFactoryClassName(String factoryClassName, ClassLoader classLoader) {
+        assertThrows(
+                XPathFactoryConfigurationException.class,
+                () -> XPathFactory.newInstance(VALID_URL, factoryClassName, classLoader));
     }
 
     /**
      * Test for XPathFactory.newInstance(java.lang.String uri, java.lang.String
      * factoryClassName, java.lang.ClassLoader classLoader) uri is null , should
      * throw NPE
-     *
-     * @throws XPathFactoryConfigurationException
      */
-    @Test(expectedExceptions = NullPointerException.class)
-    public void testNewInstanceWithNullUri() throws XPathFactoryConfigurationException {
-        XPathFactory.newInstance(null, XPATH_FACTORY_CLASSNAME, this.getClass().getClassLoader());
+    @Test
+    public void testNewInstanceWithNullUri() {
+        assertThrows(
+                NullPointerException.class,
+                () -> XPathFactory.newInstance(null, XPATH_FACTORY_CLASSNAME, this.getClass().getClassLoader()));
     }
 
     /**
      * Test for XPathFactory.newInstance(java.lang.String uri, java.lang.String
      * factoryClassName, java.lang.ClassLoader classLoader)
-     *
-     * @throws IllegalArgumentException
-     *             is expected when uri is empty
      */
-    @Test(expectedExceptions = IllegalArgumentException.class)
-    public void testNewInstanceWithEmptyUri() throws XPathFactoryConfigurationException {
-        XPathFactory.newInstance("", XPATH_FACTORY_CLASSNAME, this.getClass().getClassLoader());
+    @Test
+    public void testNewInstanceWithEmptyUri() {
+        assertThrows(IllegalArgumentException.class, () -> XPathFactory.newInstance("", XPATH_FACTORY_CLASSNAME, this.getClass().getClassLoader()));
     }
 
     /**
@@ -169,24 +164,20 @@ public class XPathFactoryTest {
     /**
      * XPathFactory.newInstance(String uri) throws NPE if uri is null.
      *
-     * @throws XPathFactoryConfigurationException If the specified object model
-    *          is unavailable, or if there is a configuration error.
      */
-    @Test(expectedExceptions = NullPointerException.class)
-    public void testCheckXPathFactory02() throws XPathFactoryConfigurationException {
-        XPathFactory.newInstance(null);
+    @Test
+    public void testCheckXPathFactory02() {
+        assertThrows(NullPointerException.class, () -> XPathFactory.newInstance(null));
     }
 
     /**
      * XPathFactory.newInstance(String uri) throws XPFCE if uri is just a blank
      * string.
      *
-     * @throws XPathFactoryConfigurationException If the specified object model
-    *          is unavailable, or if there is a configuration error.
      */
-    @Test(expectedExceptions = XPathFactoryConfigurationException.class)
-    public void testCheckXPathFactory03() throws XPathFactoryConfigurationException {
-        XPathFactory.newInstance(" ");
+    @Test
+    public void testCheckXPathFactory03() {
+        assertThrows(XPathFactoryConfigurationException.class, () -> XPathFactory.newInstance(" "));
     }
 
     /**
@@ -205,12 +196,10 @@ public class XPathFactoryTest {
      * Test for constructor - XPathFactory.newInstance(String uri) with invalid
      * url - "http://java.sun.com/jaxp/xpath/dom1".
      *
-     * @throws XPathFactoryConfigurationException If the specified object model
-    *          is unavailable, or if there is a configuration error.
      */
-    @Test(expectedExceptions = XPathFactoryConfigurationException.class)
-    public void testCheckXPathFactory05() throws XPathFactoryConfigurationException {
-        XPathFactory.newInstance(INVALID_URL);
+    @Test
+    public void testCheckXPathFactory05() {
+        assertThrows(XPathFactoryConfigurationException.class, () -> XPathFactory.newInstance(INVALID_URL));
     }
 
     /**
diff --git a/test/jaxp/javax/xml/jaxp/functional/javax/xml/xpath/ptests/XPathFunctionResolverTest.java b/test/jaxp/javax/xml/jaxp/functional/javax/xml/xpath/ptests/XPathFunctionResolverTest.java
index 07d439e5aa8..f74540d8f68 100644
--- a/test/jaxp/javax/xml/jaxp/functional/javax/xml/xpath/ptests/XPathFunctionResolverTest.java
+++ b/test/jaxp/javax/xml/jaxp/functional/javax/xml/xpath/ptests/XPathFunctionResolverTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,14 +23,15 @@
 
 package javax.xml.xpath.ptests;
 
-import static org.testng.Assert.assertEquals;
+import org.junit.jupiter.api.BeforeEach;
+import org.junit.jupiter.api.Test;
 
 import javax.xml.xpath.XPath;
 import javax.xml.xpath.XPathExpressionException;
 import javax.xml.xpath.XPathFactory;
 
-import org.testng.annotations.BeforeTest;
-import org.testng.annotations.Test;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertThrows;
 
 /**
  * Class containing the test cases for XPathFunctionResolver.
@@ -38,7 +39,7 @@ import org.testng.annotations.Test;
 /*
  * @test
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm javax.xml.xpath.ptests.XPathFunctionResolverTest
+ * @run junit/othervm javax.xml.xpath.ptests.XPathFunctionResolverTest
  */
 public class XPathFunctionResolverTest {
     /**
@@ -50,7 +51,7 @@ public class XPathFunctionResolverTest {
      * Create XPath object before every test. Make sure function resolver has
      * been set for XPath object.
      */
-    @BeforeTest
+    @BeforeEach
     public void setup() {
         xpath = XPathFactory.newInstance().newXPath();
         if (xpath.getXPathFunctionResolver() == null) {
@@ -65,17 +66,16 @@ public class XPathFunctionResolverTest {
      */
     @Test
     public void testCheckXPathFunctionResolver01() throws XPathExpressionException {
-        assertEquals(xpath.evaluate("round(1.7)", (Object)null), "2");
+        assertEquals("2", xpath.evaluate("round(1.7)", (Object) null));
     }
 
     /**
      * Test for resolveFunction(QName functionName,int arity); evaluate throws
      * NPE if functionName  is null.
      *
-     * @throws XPathExpressionException If the expression cannot be evaluated.
      */
-    @Test(expectedExceptions = NullPointerException.class)
-    public void testCheckXPathFunctionResolver02() throws XPathExpressionException {
-        assertEquals(xpath.evaluate(null, "5"), "2");
+    @Test
+    public void testCheckXPathFunctionResolver02() {
+        assertThrows(NullPointerException.class, () -> xpath.evaluate(null, "5"));
     }
 }
diff --git a/test/jaxp/javax/xml/jaxp/functional/javax/xml/xpath/ptests/XPathTest.java b/test/jaxp/javax/xml/jaxp/functional/javax/xml/xpath/ptests/XPathTest.java
index e2eb0d6a03a..7bbfaae6b76 100644
--- a/test/jaxp/javax/xml/jaxp/functional/javax/xml/xpath/ptests/XPathTest.java
+++ b/test/jaxp/javax/xml/jaxp/functional/javax/xml/xpath/ptests/XPathTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,21 +23,12 @@
 
 package javax.xml.xpath.ptests;
 
-import static javax.xml.xpath.XPathConstants.BOOLEAN;
-import static javax.xml.xpath.XPathConstants.NODE;
-import static javax.xml.xpath.XPathConstants.NODESET;
-import static javax.xml.xpath.XPathConstants.NUMBER;
-import static javax.xml.xpath.XPathConstants.STRING;
-import static javax.xml.xpath.ptests.XPathTestConst.XML_DIR;
-import static org.testng.AssertJUnit.assertEquals;
-import static org.testng.AssertJUnit.assertNotNull;
-import static org.testng.AssertJUnit.assertNull;
-
-import java.io.InputStream;
-import java.nio.file.Files;
-import java.nio.file.Path;
-import java.nio.file.Paths;
-import java.util.Iterator;
+import org.junit.jupiter.api.BeforeEach;
+import org.junit.jupiter.api.Test;
+import org.w3c.dom.Attr;
+import org.w3c.dom.Document;
+import org.w3c.dom.NodeList;
+import org.xml.sax.InputSource;
 
 import javax.xml.XMLConstants;
 import javax.xml.namespace.NamespaceContext;
@@ -46,13 +37,21 @@ import javax.xml.parsers.DocumentBuilderFactory;
 import javax.xml.xpath.XPath;
 import javax.xml.xpath.XPathExpressionException;
 import javax.xml.xpath.XPathFactory;
+import java.io.InputStream;
+import java.nio.file.Files;
+import java.nio.file.Path;
+import java.util.Iterator;
 
-import org.testng.annotations.BeforeTest;
-import org.testng.annotations.Test;
-import org.w3c.dom.Attr;
-import org.w3c.dom.Document;
-import org.w3c.dom.NodeList;
-import org.xml.sax.InputSource;
+import static javax.xml.xpath.XPathConstants.BOOLEAN;
+import static javax.xml.xpath.XPathConstants.NODE;
+import static javax.xml.xpath.XPathConstants.NODESET;
+import static javax.xml.xpath.XPathConstants.NUMBER;
+import static javax.xml.xpath.XPathConstants.STRING;
+import static javax.xml.xpath.ptests.XPathTestConst.XML_DIR;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertNotNull;
+import static org.junit.jupiter.api.Assertions.assertNull;
+import static org.junit.jupiter.api.Assertions.assertThrows;
 
 /**
  * Class containing the test cases for XPath API.
@@ -60,7 +59,7 @@ import org.xml.sax.InputSource;
 /*
  * @test
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm javax.xml.xpath.ptests.XPathTest
+ * @run junit/othervm javax.xml.xpath.ptests.XPathTest
  */
 public class XPathTest {
     /**
@@ -81,7 +80,7 @@ public class XPathTest {
     /**
      * XML File Path.
      */
-    private static final Path XML_PATH = Paths.get(XML_DIR + "widgets.xml");
+    private static final Path XML_PATH = XML_DIR.resolve("widgets.xml");
 
     /**
      * An expression name which locate at "/widgets/widget[@name='a']/@quantity"
@@ -97,7 +96,7 @@ public class XPathTest {
      * Create Document object and XPath object for every time
      * @throws Exception If any errors occur.
      */
-    @BeforeTest
+    @BeforeEach
     public void setup() throws Exception {
         document = DocumentBuilderFactory.newInstance().newDocumentBuilder().parse(XML_PATH.toFile());
         xpath = XPathFactory.newInstance().newXPath();
@@ -111,7 +110,7 @@ public class XPathTest {
      */
     @Test
     public void testCheckXPath01() throws XPathExpressionException {
-        assertEquals(xpath.evaluate(EXPRESSION_NAME_A, document, STRING), "6");
+        assertEquals("6", xpath.evaluate(EXPRESSION_NAME_A, document, STRING));
     }
 
 
@@ -123,7 +122,7 @@ public class XPathTest {
      */
     @Test
     public void testCheckXPath02() throws XPathExpressionException {
-        assertEquals(xpath.compile(EXPRESSION_NAME_A).evaluate(document, STRING), "6");
+        assertEquals("6", xpath.compile(EXPRESSION_NAME_A).evaluate(document, STRING));
     }
 
     /**
@@ -135,40 +134,37 @@ public class XPathTest {
      */
     @Test
     public void testCheckXPath03() throws XPathExpressionException {
-        assertEquals(xpath.evaluate(EXPRESSION_NAME_A, document), "6");
+        assertEquals("6", xpath.evaluate(EXPRESSION_NAME_A, document));
     }
 
     /**
      * Test for XPath.compile(java.lang.String expression). If expression is
      * null, should throw NPE.
      *
-     * @throws XPathExpressionException If the expression cannot be evaluated.
      */
-    @Test(expectedExceptions = NullPointerException.class)
-    public void testCheckXPath04() throws XPathExpressionException {
-        xpath.compile(null);
+    @Test
+    public void testCheckXPath04() {
+        assertThrows(NullPointerException.class, () -> xpath.compile(null));
     }
 
     /**
      * Test for XPath.compile(java.lang.String expression). If expression cannot
      * be compiled junk characters, should throw XPathExpressionException.
      *
-     * @throws XPathExpressionException If the expression cannot be evaluated.
      */
-    @Test(expectedExceptions = XPathExpressionException.class)
-    public void testCheckXPath05() throws XPathExpressionException {
-        xpath.compile("-*&");
+    @Test
+    public void testCheckXPath05() {
+        assertThrows(XPathExpressionException.class, () -> xpath.compile("-*&"));
     }
 
     /**
      * Test for XPath.compile(java.lang.String expression). If expression is
      * blank, should throw XPathExpressionException
      *
-     * @throws XPathExpressionException If the expression cannot be evaluated.
      */
-    @Test(expectedExceptions = XPathExpressionException.class)
-    public void testCheckXPath06() throws XPathExpressionException {
-        xpath.compile(" ");
+    @Test
+    public void testCheckXPath06() {
+        assertThrows(XPathExpressionException.class, () -> xpath.compile(" "));
     }
 
     /**
@@ -179,7 +175,7 @@ public class XPathTest {
      */
     @Test
     public void testCheckXPath07() throws XPathExpressionException {
-        assertEquals(xpath.compile(EXPRESSION_NAME_B).evaluate(document, STRING), "");
+        assertEquals("", xpath.compile(EXPRESSION_NAME_B).evaluate(document, STRING));
     }
 
 
@@ -187,33 +183,30 @@ public class XPathTest {
      * Test for XPath.evaluate(java.lang.String expression, java.lang.Object
      * item, QName returnType). If String expression is null, should throw NPE.
      *
-     * @throws XPathExpressionException If the expression cannot be evaluated.
      */
-    @Test(expectedExceptions = NullPointerException.class)
-    public void testCheckXPath08() throws XPathExpressionException {
-        xpath.evaluate(null, document, STRING);
+    @Test
+    public void testCheckXPath08() {
+        assertThrows(NullPointerException.class, () -> xpath.evaluate(null, document, STRING));
     }
 
     /**
      * Test for XPath.evaluate(java.lang.String expression, java.lang.Object
      * item, QName returnType). If item is null, should throw NPE.
      *
-     * @throws XPathExpressionException If the expression cannot be evaluated.
      */
-    @Test(expectedExceptions = NullPointerException.class)
-    public void testCheckXPath09() throws XPathExpressionException {
-        xpath.evaluate(EXPRESSION_NAME_A, null, STRING);
+    @Test
+    public void testCheckXPath09() {
+        assertThrows(NullPointerException.class, () -> xpath.evaluate(EXPRESSION_NAME_A, null, STRING));
     }
 
     /**
      * Test for XPath.evaluate(java.lang.String expression, java.lang.Object
      * item, QName returnType). If returnType is null, should throw NPE.
      *
-     * @throws XPathExpressionException If the expression cannot be evaluated.
      */
-    @Test(expectedExceptions = NullPointerException.class)
-    public void testCheckXPath10() throws XPathExpressionException {
-        xpath.evaluate(EXPRESSION_NAME_A, document, null);
+    @Test
+    public void testCheckXPath10() {
+        assertThrows(NullPointerException.class, () -> xpath.evaluate(EXPRESSION_NAME_A, document, null));
     }
 
     /**
@@ -226,7 +219,7 @@ public class XPathTest {
      */
     @Test
     public void testCheckXPath11() throws XPathExpressionException {
-        assertEquals(xpath.evaluate("1+1", document, STRING), "2");
+        assertEquals("2", xpath.evaluate("1+1", document, STRING));
     }
 
     /**
@@ -234,11 +227,10 @@ public class XPathTest {
      * returnType) throws XPathExpressionException if expression is a empty
      * string "".
      *
-     * @throws XPathExpressionException If the expression cannot be evaluated.
      */
-    @Test(expectedExceptions = XPathExpressionException.class)
-    public void testCheckXPath12() throws XPathExpressionException {
-        xpath.evaluate("", document, STRING);
+    @Test
+    public void testCheckXPath12() {
+        assertThrows(XPathExpressionException.class, () -> xpath.evaluate("", document, STRING));
     }
 
     /**
@@ -246,11 +238,10 @@ public class XPathTest {
      * returnType) throws IllegalArgumentException if returnType is not one of
      * the types defined in XPathConstants.
      *
-     * @throws XPathExpressionException If the expression cannot be evaluated.
      */
-    @Test(expectedExceptions = IllegalArgumentException.class)
-    public void testCheckXPath13() throws XPathExpressionException {
-        xpath.evaluate(EXPRESSION_NAME_A, document, TEST_QNAME);
+    @Test
+    public void testCheckXPath13() {
+        assertThrows(IllegalArgumentException.class, () -> xpath.evaluate(EXPRESSION_NAME_A, document, TEST_QNAME));
     }
 
     /**
@@ -261,7 +252,7 @@ public class XPathTest {
      */
     @Test
     public void testCheckXPath14() throws XPathExpressionException {
-        assertEquals(xpath.evaluate(EXPRESSION_NAME_A, document, BOOLEAN), true);
+        assertEquals(true, xpath.evaluate(EXPRESSION_NAME_A, document, BOOLEAN));
     }
 
     /**
@@ -273,7 +264,7 @@ public class XPathTest {
      */
     @Test
     public void testCheckXPath15() throws XPathExpressionException {
-        assertEquals(xpath.evaluate(EXPRESSION_NAME_B, document, BOOLEAN), false);
+        assertEquals(false, xpath.evaluate(EXPRESSION_NAME_B, document, BOOLEAN));
     }
 
     /**
@@ -284,7 +275,7 @@ public class XPathTest {
      */
     @Test
     public void testCheckXPath16() throws XPathExpressionException {
-        assertEquals(xpath.evaluate(EXPRESSION_NAME_A, document, NUMBER), 6d);
+        assertEquals(6d, xpath.evaluate(EXPRESSION_NAME_A, document, NUMBER));
     }
 
 
@@ -296,7 +287,7 @@ public class XPathTest {
      */
     @Test
     public void testCheckXPath17() throws XPathExpressionException {
-        assertEquals(((Attr)xpath.evaluate(EXPRESSION_NAME_A, document, NODE)).getValue(), "6");
+        assertEquals("6", ((Attr) xpath.evaluate(EXPRESSION_NAME_A, document, NODE)).getValue());
     }
 
     /**
@@ -308,19 +299,18 @@ public class XPathTest {
      */
     @Test
     public void testCheckXPath18() throws XPathExpressionException {
-        NodeList nodeList = (NodeList)xpath.evaluate(EXPRESSION_NAME_A, document, NODESET);
-        assertEquals(((Attr) nodeList.item(0)).getValue(), "6");
+        NodeList nodeList = (NodeList) xpath.evaluate(EXPRESSION_NAME_A, document, NODESET);
+        assertEquals("6", ((Attr) nodeList.item(0)).getValue());
     }
 
     /**
      * Test for XPath.evaluate(java.lang.String expression, java.lang.Object
      * item). If expression is null, should throw NPE.
      *
-     * @throws XPathExpressionException If the expression cannot be evaluated.
      */
-    @Test(expectedExceptions = NullPointerException.class)
-    public void testCheckXPath19() throws XPathExpressionException {
-        xpath.evaluate(null, document);
+    @Test
+    public void testCheckXPath19() {
+        assertThrows(NullPointerException.class, () -> xpath.evaluate(null, document));
     }
 
     /**
@@ -332,30 +322,27 @@ public class XPathTest {
      */
     @Test
     public void testCheckXPath20() throws XPathExpressionException {
-        assertEquals(xpath.evaluate("1+1", document), "2");
+        assertEquals("2", xpath.evaluate("1+1", document));
     }
 
     /**
      * XPath.evaluate(java.lang.String expression, java.lang.Object item) throws
      * NPE if InputSource is null.
      *
-     * @throws XPathExpressionException If the expression cannot be evaluated.
      */
-    @Test(expectedExceptions = NullPointerException.class)
-    public void testCheckXPath21() throws XPathExpressionException {
-        xpath.evaluate(EXPRESSION_NAME_A, null);
+    @Test
+    public void testCheckXPath21() {
+        assertThrows(NullPointerException.class, () -> xpath.evaluate(EXPRESSION_NAME_A, null));
     }
 
     /**
      * XPath.evaluate(java.lang.String expression, InputSource source) return
      * correct value by looking for Node.
-     *
-     * @throws Exception If any errors occur.
      */
     @Test
     public void testCheckXPath22() throws Exception {
         try (InputStream is = Files.newInputStream(XML_PATH)) {
-            assertEquals(xpath.evaluate(EXPRESSION_NAME_A, new InputSource(is)), "6");
+            assertEquals("6", xpath.evaluate(EXPRESSION_NAME_A, new InputSource(is)));
         }
     }
 
@@ -363,23 +350,20 @@ public class XPathTest {
      * XPath.evaluate(java.lang.String expression, InputSource source) throws
      * NPE if InputSource is null.
      *
-     * @throws XPathExpressionException If the expression cannot be evaluated.
      */
-    @Test(expectedExceptions = NullPointerException.class)
-    public void testCheckXPath23() throws XPathExpressionException {
-        xpath.evaluate(EXPRESSION_NAME_A, null);
+    @Test
+    public void testCheckXPath23() {
+        assertThrows(NullPointerException.class, () -> xpath.evaluate(EXPRESSION_NAME_A, null));
     }
 
     /**
      * XPath.evaluate(java.lang.String expression, InputSource source) throws
      * NPE if String expression is null.
-     *
-     * @throws Exception If any errors occur.
      */
-    @Test(expectedExceptions = NullPointerException.class)
+    @Test
     public void testCheckXPath24() throws Exception {
         try (InputStream is = Files.newInputStream(XML_PATH)) {
-            xpath.evaluate(null, new InputSource(is));
+            assertThrows(NullPointerException.class, () -> xpath.evaluate(null, new InputSource(is)));
         }
     }
 
@@ -387,39 +371,33 @@ public class XPathTest {
      * Test for XPath.evaluate(java.lang.String expression, InputSource source).
      * If expression is junk characters, expression cannot be evaluated, should
      * throw XPathExpressionException.
-     *
-     * @throws Exception If any errors occur.
      */
-    @Test(expectedExceptions = XPathExpressionException.class)
+    @Test
     public void testCheckXPath25() throws Exception {
         try (InputStream is = Files.newInputStream(XML_PATH)) {
-            xpath.evaluate("-*&", new InputSource(is));
+            assertThrows(XPathExpressionException.class, () -> xpath.evaluate("-*&", new InputSource(is)));
         }
     }
 
     /**
      * XPath.evaluate(java.lang.String expression, InputSource source) throws
      * XPathExpressionException if expression is blank " ".
-     *
-     * @throws Exception If any errors occur.
      */
-    @Test(expectedExceptions = XPathExpressionException.class)
+    @Test
     public void testCheckXPath26() throws Exception {
         try (InputStream is = Files.newInputStream(XML_PATH)) {
-            xpath.evaluate(" ", new InputSource(is));
+            assertThrows(XPathExpressionException.class, () -> xpath.evaluate(" ", new InputSource(is)));
         }
     }
 
     /**
      * XPath.evaluate(java.lang.String expression, InputSource source, QName
      * returnType) returns correct string value which return type is String.
-     *
-     * @throws Exception If any errors occur.
      */
     @Test
     public void testCheckXPath27() throws Exception {
         try (InputStream is = Files.newInputStream(XML_PATH)) {
-            assertEquals(xpath.evaluate(EXPRESSION_NAME_A, new InputSource(is), STRING), "6");
+            assertEquals("6", xpath.evaluate(EXPRESSION_NAME_A, new InputSource(is), STRING));
         }
     }
 
@@ -427,62 +405,53 @@ public class XPathTest {
      * XPath.evaluate(java.lang.String expression, InputSource source, QName
      * returnType) throws NPE if source is null.
      *
-     * @throws XPathExpressionException If the expression cannot be evaluated.
      */
-    @Test(expectedExceptions = NullPointerException.class)
-    public void testCheckXPath28() throws XPathExpressionException {
-        xpath.evaluate(EXPRESSION_NAME_A, null, STRING);
+    @Test
+    public void testCheckXPath28() {
+        assertThrows(NullPointerException.class, () -> xpath.evaluate(EXPRESSION_NAME_A, null, STRING));
     }
 
     /**
      * XPath.evaluate(java.lang.String expression, InputSource source, QName
      * returnType) throws NPE if expression is null.
-     *
-     * @throws Exception If any errors occur.
      */
-    @Test(expectedExceptions = NullPointerException.class)
+    @Test
     public void testCheckXPath29() throws Exception {
         try (InputStream is = Files.newInputStream(XML_PATH)) {
-            xpath.evaluate(null, new InputSource(is), STRING);
+            assertThrows(NullPointerException.class, () -> xpath.evaluate(null, new InputSource(is), STRING));
         }
     }
 
     /**
      * XPath.evaluate(java.lang.String expression, InputSource source,
      * QName returnType) throws NPE if returnType is null.
-     *
-     * @throws Exception If any errors occur.
      */
-    @Test(expectedExceptions = NullPointerException.class)
+    @Test
     public void testCheckXPath30() throws Exception {
         try (InputStream is = Files.newInputStream(XML_PATH)) {
-            xpath.evaluate(EXPRESSION_NAME_A, new InputSource(is), null);
+            assertThrows(NullPointerException.class, () -> xpath.evaluate(EXPRESSION_NAME_A, new InputSource(is), null));
         }
     }
 
     /**
      * XPath.evaluate(java.lang.String expression, InputSource source, QName
      * returnType) throws XPathExpressionException if expression is junk characters.
-     *
-     * @throws Exception If any errors occur.
      */
-    @Test(expectedExceptions = XPathExpressionException.class)
+    @Test
     public void testCheckXPath31() throws Exception {
         try (InputStream is = Files.newInputStream(XML_PATH)) {
-            xpath.evaluate("-*&", new InputSource(is), STRING);
+            assertThrows(XPathExpressionException.class, () -> xpath.evaluate("-*&", new InputSource(is), STRING));
         }
     }
 
     /**
      * XPath.evaluate(java.lang.String expression, InputSource source, QName
      * returnType) throws XPathExpressionException if expression is blank " ".
-     *
-     * @throws Exception If any errors occur.
      */
-    @Test(expectedExceptions = XPathExpressionException.class)
+    @Test
     public void testCheckXPath32() throws Exception {
         try (InputStream is = Files.newInputStream(XML_PATH)) {
-            xpath.evaluate(" ", new InputSource(is), STRING);
+            assertThrows(XPathExpressionException.class, () -> xpath.evaluate(" ", new InputSource(is), STRING));
         }
     }
 
@@ -490,84 +459,72 @@ public class XPathTest {
      * XPath.evaluate(java.lang.String expression, InputSource source,
      * QName returnType) throws IllegalArgumentException if returnType is not
      * one of the types defined in XPathConstants.
-     *
-     * @throws Exception If any errors occur.
      */
-    @Test(expectedExceptions = IllegalArgumentException.class)
+    @Test
     public void testCheckXPath33() throws Exception {
         try (InputStream is = Files.newInputStream(XML_PATH)) {
-            xpath.evaluate(EXPRESSION_NAME_A, new InputSource(is), TEST_QNAME);
+            assertThrows(IllegalArgumentException.class, () -> xpath.evaluate(EXPRESSION_NAME_A, new InputSource(is), TEST_QNAME));
         }
     }
 
     /**
      * XPath.evaluate(java.lang.String expression, InputSource source,
      * QName returnType) return correct boolean value if return type is Boolean.
-     *
-     * @throws Exception If any errors occur.
      */
     @Test
     public void testCheckXPath34() throws Exception {
         try (InputStream is = Files.newInputStream(XML_PATH)) {
-            assertEquals(xpath.evaluate(EXPRESSION_NAME_A, new InputSource(is),
-                BOOLEAN), true);
+            assertEquals(true, xpath.evaluate(EXPRESSION_NAME_A, new InputSource(is),
+                    BOOLEAN));
         }
     }
 
     /**
      * XPath.evaluate(java.lang.String expression, InputSource source,
      * QName returnType) return correct boolean value if return type is Boolean.
-     *
-     * @throws Exception If any errors occur.
      */
     @Test
     public void testCheckXPath35() throws Exception {
         try (InputStream is = Files.newInputStream(XML_PATH)) {
-            assertEquals(xpath.evaluate(EXPRESSION_NAME_B, new InputSource(is),
-                BOOLEAN), false);
+            assertEquals(false, xpath.evaluate(EXPRESSION_NAME_B, new InputSource(is),
+                    BOOLEAN));
         }
     }
 
     /**
      * XPath.evaluate(java.lang.String expression, InputSource source,
      * QName returnType) return correct number value if return type is Number.
-     *
-     * @throws Exception If any errors occur.
      */
     @Test
     public void testCheckXPath36() throws Exception {
         try (InputStream is = Files.newInputStream(XML_PATH)) {
-            assertEquals(xpath.evaluate(EXPRESSION_NAME_A, new InputSource(is),
-                NUMBER), 6d);
+            assertEquals(6d, xpath.evaluate(EXPRESSION_NAME_A, new InputSource(is),
+                    NUMBER));
         }
     }
 
     /**
      * XPath.evaluate(java.lang.String expression, InputSource source,
      * QName returnType) return correct string value if return type is Node.
-     *
-     * @throws Exception If any errors occur.
      */
     @Test
     public void testCheckXPath37() throws Exception {
         try (InputStream is = Files.newInputStream(XML_PATH)) {
-            assertEquals(((Attr)xpath.evaluate(EXPRESSION_NAME_A,
-                new InputSource(is), NODE)).getValue(), "6");
+            assertEquals("6", ((Attr) xpath.evaluate(EXPRESSION_NAME_A,
+                    new InputSource(is), NODE)).getValue());
         }
     }
 
     /**
      * Test for XPath.evaluate(java.lang.String expression, InputSource source,
      * QName returnType) which return type is NodeList.
-     *
-     * @throws Exception If any errors occur.
      */
     @Test
     public void testCheckXPath38() throws Exception {
         try (InputStream is = Files.newInputStream(XML_PATH)) {
-            NodeList nodeList = (NodeList)xpath.evaluate(EXPRESSION_NAME_A,
-                new InputSource(is), NODESET);
-            assertEquals(((Attr) nodeList.item(0)).getValue(), "6");
+            NodeList nodeList = (NodeList) xpath.evaluate(EXPRESSION_NAME_A,
+                    new InputSource(is), NODESET);
+            assertEquals("6", ((Attr) nodeList.item(0)).getValue());
         }
     }
 
@@ -575,57 +532,49 @@ public class XPathTest {
      * Test for XPath.evaluate(java.lang.String expression, InputSource iSource,
      * QName returnType). If return type is Boolean, should return false as
      * expression is not successful in evaluating to any result.
-     *
-     * @throws Exception If any errors occur.
      */
     @Test
     public void testCheckXPath52() throws Exception {
         try (InputStream is = Files.newInputStream(XML_PATH)) {
-            assertEquals(xpath.evaluate(EXPRESSION_NAME_B, new InputSource(is),
-                BOOLEAN), false);
+            assertEquals(false, xpath.evaluate(EXPRESSION_NAME_B, new InputSource(is),
+                    BOOLEAN));
         }
     }
 
     /**
      * XPath.evaluate(java.lang.String expression, InputSource iSource, QName
      * returnType) returns correct number value which return type is Number.
-     *
-     * @throws Exception If any errors occur.
      */
     @Test
     public void testCheckXPath53() throws Exception {
         try (InputStream is = Files.newInputStream(XML_PATH)) {
-            assertEquals(xpath.evaluate(EXPRESSION_NAME_A, new InputSource(is),
-                NUMBER), 6d);
+            assertEquals(6d, xpath.evaluate(EXPRESSION_NAME_A, new InputSource(is),
+                    NUMBER));
         }
     }
 
     /**
      * XPath.evaluate(java.lang.String expression, InputSource iSource, QName
      * returnType) returns a node value if returnType is Node.
-     *
-     * @throws Exception If any errors occur.
      */
     @Test
     public void testCheckXPath54() throws Exception {
         try (InputStream is = Files.newInputStream(XML_PATH)) {
-            assertEquals(((Attr)xpath.evaluate(EXPRESSION_NAME_A,
-                new InputSource(is), NODE)).getValue(), "6");
+            assertEquals("6", ((Attr) xpath.evaluate(EXPRESSION_NAME_A,
+                    new InputSource(is), NODE)).getValue());
         }
     }
 
     /**
      * XPath.evaluate(java.lang.String expression, InputSource iSource, QName
      * returnType) returns a node list if returnType is NodeList.
-     *
-     * @throws Exception If any errors occur.
      */
     @Test
     public void testCheckXPath55() throws Exception {
         try (InputStream is = Files.newInputStream(XML_PATH)) {
-            NodeList nodeList = (NodeList)xpath.evaluate(EXPRESSION_NAME_A,
-                new InputSource(is), NODESET);
-            assertEquals(((Attr) nodeList.item(0)).getValue(), "6");
+            NodeList nodeList = (NodeList) xpath.evaluate(EXPRESSION_NAME_A,
+                    new InputSource(is), NODESET);
+            assertEquals("6", ((Attr) nodeList.item(0)).getValue());
         }
     }
 
@@ -647,18 +596,18 @@ public class XPathTest {
      */
     @Test
     public void testCheckXPath57() {
-        MyNamespaceContext myNamespaceContext = new MyNamespaceContext();
-        xpath.setNamespaceContext(myNamespaceContext);
-        assertEquals(xpath.getNamespaceContext(), myNamespaceContext);
+        MyNamespaceContext expectedNamespaceContext = new MyNamespaceContext();
+        xpath.setNamespaceContext(expectedNamespaceContext);
+        assertEquals(expectedNamespaceContext, xpath.getNamespaceContext());
     }
 
     /**
      * Test for XPath.setNamespaceContext(NamespaceContext nsContext) Establish
      * a namespace context. NullPointerException is thrown if nsContext is null.
      */
-    @Test(expectedExceptions = NullPointerException.class)
+    @Test
     public void testCheckXPath58() {
-        xpath.setNamespaceContext(null);
+        assertThrows(NullPointerException.class, () -> xpath.setNamespaceContext(null));
     }
 
     /**
@@ -685,9 +634,9 @@ public class XPathTest {
      * Test for XPath.setXPathFunctionResolver(XPathFunctionResolver resolver).
      * set resolver as null, should throw NPE.
      */
-    @Test(expectedExceptions = NullPointerException.class)
+    @Test
     public void testCheckXPath61() {
-        xpath.setXPathFunctionResolver(null);
+        assertThrows(NullPointerException.class, () -> xpath.setXPathFunctionResolver(null));
     }
 
     /**
@@ -714,9 +663,9 @@ public class XPathTest {
      * Test for XPath.setXPathVariableResolver(XPathVariableResolver resolver).
      * Set resolver as null, should throw NPE.
      */
-    @Test(expectedExceptions = NullPointerException.class)
+    @Test
     public void testCheckXPath64() {
-        xpath.setXPathVariableResolver(null);
+        assertThrows(NullPointerException.class, () -> xpath.setXPathVariableResolver(null));
     }
 
     /**
diff --git a/test/jaxp/javax/xml/jaxp/isolatedjdk/catalog/PropertiesTest.java b/test/jaxp/javax/xml/jaxp/isolatedjdk/catalog/PropertiesTest.java
index 3c871d703bf..c6e6e2a6745 100644
--- a/test/jaxp/javax/xml/jaxp/isolatedjdk/catalog/PropertiesTest.java
+++ b/test/jaxp/javax/xml/jaxp/isolatedjdk/catalog/PropertiesTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2015, 2017, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2015, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,6 +23,19 @@
 
 package catalog;
 
+import org.junit.jupiter.api.Test;
+
+import javax.xml.catalog.CatalogResolver;
+import java.io.BufferedReader;
+import java.io.IOException;
+import java.io.InputStreamReader;
+import java.nio.file.Paths;
+import java.util.ArrayList;
+import java.util.Arrays;
+import java.util.HashMap;
+import java.util.List;
+import java.util.Map;
+
 import static catalog.CatalogTestUtils.DEFER_FALSE;
 import static catalog.CatalogTestUtils.FEATURE_DEFER;
 import static catalog.CatalogTestUtils.FEATURE_FILES;
@@ -36,27 +49,14 @@ import static catalog.CatalogTestUtils.createPropsContent;
 import static catalog.CatalogTestUtils.deleteJAXPProps;
 import static catalog.CatalogTestUtils.generateJAXPProps;
 import static catalog.CatalogTestUtils.getCatalogPath;
-
-import java.io.BufferedReader;
-import java.io.IOException;
-import java.io.InputStreamReader;
-import java.nio.file.Paths;
-import java.util.ArrayList;
-import java.util.Arrays;
-import java.util.HashMap;
-import java.util.List;
-import java.util.Map;
-
-import javax.xml.catalog.CatalogResolver;
-
-import org.testng.Assert;
-import org.testng.annotations.Test;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertNotNull;
 
 /*
  * @test
  * @library /javax/xml/jaxp/libs /javax/xml/jaxp/isolatedjdk
  * @run shell/timeout=600 ../IsolatedJDK.sh JAXP_PROPS
- * @run testng catalog.PropertiesTest
+ * @run junit catalog.PropertiesTest
  * @run shell/timeout=600 ../IsolatedJDK.sh JAXP_PROPS remove
  * @summary This test case tests if the properties FILES, DEFER, PREFER,
  *          RESOLVE in jaxp.properties and system properties are used.
@@ -75,11 +75,11 @@ public class PropertiesTest {
     public void test() throws Exception {
         // get required properties and do some assertions
         String javaclasspath = System.getProperty("java.class.path");
-        Assert.assertNotNull(javaclasspath, "Test class path is null");
+        assertNotNull(javaclasspath, "Test class path is null");
         String testclasspath = System.getProperty("test.class.path");
-        Assert.assertNotNull(testclasspath, "Test class path is null");
+        assertNotNull(testclasspath, "Test class path is null");
         String testsourcepath = System.getProperty("test.src");
-        Assert.assertNotNull(testsourcepath, "Test source path is null");
+        assertNotNull(testsourcepath, "Test source path is null");
 
         // start the child process
         List<String> testCall = new ArrayList<>(6);
@@ -123,7 +123,7 @@ public class PropertiesTest {
         // trace exit value and assert 0
         int exitValue = test.exitValue();
         System.out.println("Process Exit code: " + exitValue);
-        Assert.assertEquals(exitValue, 0, "PropertiesTest returned nonzero exit code.");
+        assertEquals(0, exitValue, "PropertiesTest returned nonzero exit code.");
     }
 
     public static void main(String[] args) throws Exception {
diff --git a/test/jaxp/javax/xml/jaxp/libs/javax/xml/parsers/ptests/MyCHandler.java b/test/jaxp/javax/xml/jaxp/libs/javax/xml/parsers/ptests/MyCHandler.java
index c43390d43b9..9a32b0a1ac1 100644
--- a/test/jaxp/javax/xml/jaxp/libs/javax/xml/parsers/ptests/MyCHandler.java
+++ b/test/jaxp/javax/xml/jaxp/libs/javax/xml/parsers/ptests/MyCHandler.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1999, 2015, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1999, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -22,22 +22,23 @@
  */
 package javax.xml.parsers.ptests;
 
-import java.io.BufferedWriter;
-import java.io.File;
-import java.io.FileWriter;
-import java.io.IOException;
-import static jaxp.library.JAXPTestUtilities.ERROR_MSG_HEADER;
 import org.xml.sax.Attributes;
 import org.xml.sax.Locator;
 import org.xml.sax.helpers.DefaultHandler;
 import org.xml.sax.helpers.LocatorImpl;
 
+import java.io.BufferedWriter;
+import java.io.File;
+import java.io.FileWriter;
+import java.io.IOException;
+
 /**
  * Customized DefaultHandler which writes output document when methods are
  * called by Transformer. Test may use output document to compare with golden
  * file for verification.
  */
 class MyCHandler extends DefaultHandler implements AutoCloseable {
+    private static final String ERROR_MSG_HEADER = "Unexcepted exception thrown:";
 
     private final BufferedWriter bWriter;
     private final Locator locator = new LocatorImpl();
diff --git a/test/jaxp/javax/xml/jaxp/libs/javax/xml/parsers/ptests/ParserTestConst.java b/test/jaxp/javax/xml/jaxp/libs/javax/xml/parsers/ptests/ParserTestConst.java
index ac50221fec8..dc5ea806c9d 100644
--- a/test/jaxp/javax/xml/jaxp/libs/javax/xml/parsers/ptests/ParserTestConst.java
+++ b/test/jaxp/javax/xml/jaxp/libs/javax/xml/parsers/ptests/ParserTestConst.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2014, 2015, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2014, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -22,25 +22,28 @@
  */
 package javax.xml.parsers.ptests;
 
-import static jaxp.library.JAXPTestUtilities.FILE_SEP;
-import static jaxp.library.JAXPTestUtilities.getPathByClassName;
-
+import java.io.File;
+import java.nio.file.Path;
 
 /**
  * Utility interface which includes final variables of XML, golden file
  * directories.
  */
 public class ParserTestConst {
+    private static final Path SRC_ROOT = Path.of(System.getProperty("test.src")).toAbsolutePath();
+
+    private static String forwardSlashDir(Path p) {
+        // Convention in these tests is to include trailing '/' in directory strings.
+        return p.toString().replace(File.separatorChar, '/') + '/';
+    }
+
     /**
      * XML source file directory.
      */
-    public static final String XML_DIR = getPathByClassName(ParserTestConst.class,
-            ".." + FILE_SEP + "xmlfiles");
-
+    public static final String XML_DIR = forwardSlashDir(SRC_ROOT.resolveSibling("xmlfiles"));
 
     /**
      * Golden validation files directory.
      */
-    public static final String GOLDEN_DIR = getPathByClassName(ParserTestConst.class,
-            ".." + FILE_SEP + "xmlfiles" + FILE_SEP + "out");
+    public static final String GOLDEN_DIR = XML_DIR + "out/";
 }
diff --git a/test/jaxp/javax/xml/jaxp/libs/javax/xml/transform/ptests/TransformerTestConst.java b/test/jaxp/javax/xml/jaxp/libs/javax/xml/transform/ptests/TransformerTestConst.java
index 5f119360432..23c2a73a3b2 100644
--- a/test/jaxp/javax/xml/jaxp/libs/javax/xml/transform/ptests/TransformerTestConst.java
+++ b/test/jaxp/javax/xml/jaxp/libs/javax/xml/transform/ptests/TransformerTestConst.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2015, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -22,23 +22,27 @@
  */
 package javax.xml.transform.ptests;
 
-import static jaxp.library.JAXPTestUtilities.FILE_SEP;
-import static jaxp.library.JAXPTestUtilities.getPathByClassName;
+import java.io.File;
+import java.nio.file.Path;
 
 /**
  * This is the Base test class provide basic support for JAXP functional test
  */
 public class TransformerTestConst {
+    private static final Path SRC_ROOT = Path.of(System.getProperty("test.src")).toAbsolutePath();
+
+    private static String forwardSlashDir(Path p) {
+        // Convention in these tests is to include trailing '/' in directory strings.
+        return p.toString().replace(File.separatorChar, '/') + '/';
+    }
+
     /**
      * XML source file directory.
      */
-    public static final String XML_DIR = getPathByClassName(TransformerTestConst.class,
-            ".." + FILE_SEP + "xmlfiles");
-
+    public static final String XML_DIR = forwardSlashDir(SRC_ROOT.resolveSibling("xmlfiles"));
 
     /**
      * Golden validation files directory.
      */
-    public static final String GOLDEN_DIR = getPathByClassName(TransformerTestConst.class,
-            ".." + FILE_SEP + "xmlfiles" + FILE_SEP + "out");
+    public static final String GOLDEN_DIR = XML_DIR + "out/";
 }
diff --git a/test/jaxp/javax/xml/jaxp/libs/javax/xml/validation/ptests/ValidationTestConst.java b/test/jaxp/javax/xml/jaxp/libs/javax/xml/validation/ptests/ValidationTestConst.java
index 50f4c86d0e5..f8c6aba18d3 100644
--- a/test/jaxp/javax/xml/jaxp/libs/javax/xml/validation/ptests/ValidationTestConst.java
+++ b/test/jaxp/javax/xml/jaxp/libs/javax/xml/validation/ptests/ValidationTestConst.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2015, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2015, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -22,22 +22,22 @@
  */
 package javax.xml.validation.ptests;
 
-import static jaxp.library.JAXPTestUtilities.FILE_SEP;
-import static jaxp.library.JAXPTestUtilities.getPathByClassName;
+import java.io.File;
+import java.nio.file.Path;
 
 /**
  * This class defines the path constant
  */
 public class ValidationTestConst {
+    private static final Path SRC_ROOT = Path.of(System.getProperty("test.src")).toAbsolutePath();
+
+    private static String forwardSlashDir(Path p) {
+        // Convention in these tests is to include trailing '/' in directory strings.
+        return p.toString().replace(File.separatorChar, '/') + '/';
+    }
+
     /**
      * XML source file directory.
      */
-    public static final String XML_DIR = getPathByClassName(ValidationTestConst.class,
-            ".." + FILE_SEP + "xmlfiles");
-
-    /**
-     * Golden validation files directory.
-     */
-    public static final String GOLDEN_DIR = getPathByClassName(ValidationTestConst.class,
-            ".." + FILE_SEP + "xmlfiles" + FILE_SEP + "out");
+    public static final String XML_DIR = forwardSlashDir(SRC_ROOT.resolveSibling("xmlfiles"));
 }
diff --git a/test/jaxp/javax/xml/jaxp/libs/javax/xml/xpath/ptests/XPathTestConst.java b/test/jaxp/javax/xml/jaxp/libs/javax/xml/xpath/ptests/XPathTestConst.java
index 605dada1656..cfbb4a869df 100644
--- a/test/jaxp/javax/xml/jaxp/libs/javax/xml/xpath/ptests/XPathTestConst.java
+++ b/test/jaxp/javax/xml/jaxp/libs/javax/xml/xpath/ptests/XPathTestConst.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2015, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -22,16 +22,16 @@
  */
 package javax.xml.xpath.ptests;
 
-import static jaxp.library.JAXPTestUtilities.FILE_SEP;
-import static jaxp.library.JAXPTestUtilities.getPathByClassName;
+import java.nio.file.Path;
 
 /**
  * This is the Base test class provide basic support for XPath functional test
  */
 public class XPathTestConst {
+    private static final Path SRC_ROOT = Path.of(System.getProperty("test.src")).toAbsolutePath();
+
     /**
      * XML source file directory.
      */
-    public static final String XML_DIR = getPathByClassName(XPathTestConst.class,
-            ".." + FILE_SEP + "xmlfiles");
+    public static final Path XML_DIR = SRC_ROOT.resolveSibling("xmlfiles");
 }
diff --git a/test/jaxp/javax/xml/jaxp/libs/jaxp/library/JAXPDataProvider.java b/test/jaxp/javax/xml/jaxp/libs/jaxp/library/JAXPDataProvider.java
index d09c3d78b0b..9f925334895 100644
--- a/test/jaxp/javax/xml/jaxp/libs/jaxp/library/JAXPDataProvider.java
+++ b/test/jaxp/javax/xml/jaxp/libs/jaxp/library/JAXPDataProvider.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2015, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2015, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,16 +23,14 @@
 
 package jaxp.library;
 
-import org.testng.annotations.DataProvider;
-
 /**
  * Provide invalid parameters for negative testing Factory.newInstance.
  */
 public class JAXPDataProvider {
-
-    @DataProvider(name = "new-instance-neg")
-    public static Object[][] getNewInstanceNeg() {
-        return new Object[][] { { null, null }, { null, JAXPDataProvider.class.getClassLoader() } };
+    public static Object[][] newInstanceNeg() {
+        return new Object[][] {
+                { null, null },
+                { null, JAXPDataProvider.class.getClassLoader() },
+        };
     }
-
 }

From 2240ff41795d1de76aab1ce69758fcbd827208de Mon Sep 17 00:00:00 2001
From: Thomas Stuefe <stuefe@openjdk.org>
Date: Mon, 16 Mar 2026 13:31:38 +0000
Subject: [PATCH 206/655] 8379967: (process) Improve ProcessBuilder error
 reporting

Reviewed-by: mbaesken, rriggs
---
 make/modules/java.base/Launcher.gmk           |   3 +-
 .../unix/native/jspawnhelper/jspawnhelper.c   |  77 ++++++----
 .../unix/native/libjava/ProcessImpl_md.c      |  46 ++++--
 src/java.base/unix/native/libjava/childproc.c | 140 ++++++++++++------
 src/java.base/unix/native/libjava/childproc.h |   7 -
 .../native/libjava/childproc_errorcodes.c     |  63 ++++++++
 .../native/libjava/childproc_errorcodes.h     | 117 +++++++++++++++
 .../lang/ProcessBuilder/InvalidWorkDir.java   |  62 ++++++++
 .../ProcessBuilder/JspawnhelperWarnings.java  |  46 ++++--
 9 files changed, 455 insertions(+), 106 deletions(-)
 create mode 100644 src/java.base/unix/native/libjava/childproc_errorcodes.c
 create mode 100644 src/java.base/unix/native/libjava/childproc_errorcodes.h
 create mode 100644 test/jdk/java/lang/ProcessBuilder/InvalidWorkDir.java

diff --git a/make/modules/java.base/Launcher.gmk b/make/modules/java.base/Launcher.gmk
index 3a3920acb12..bfae0925c07 100644
--- a/make/modules/java.base/Launcher.gmk
+++ b/make/modules/java.base/Launcher.gmk
@@ -95,7 +95,8 @@ ifeq ($(call isTargetOsType, unix), true)
       CFLAGS := $(VERSION_CFLAGS), \
       EXTRA_HEADER_DIRS := libjava, \
       EXTRA_OBJECT_FILES := \
-          $(SUPPORT_OUTPUTDIR)/native/$(MODULE)/libjava/childproc$(OBJ_SUFFIX), \
+          $(SUPPORT_OUTPUTDIR)/native/$(MODULE)/libjava/childproc$(OBJ_SUFFIX) \
+          $(SUPPORT_OUTPUTDIR)/native/$(MODULE)/libjava/childproc_errorcodes$(OBJ_SUFFIX), \
       LD_SET_ORIGIN := false, \
       OUTPUT_DIR := $(SUPPORT_OUTPUTDIR)/modules_libs/$(MODULE), \
   ))
diff --git a/src/java.base/unix/native/jspawnhelper/jspawnhelper.c b/src/java.base/unix/native/jspawnhelper/jspawnhelper.c
index d2302d0c2e7..f26d0d618e3 100644
--- a/src/java.base/unix/native/jspawnhelper/jspawnhelper.c
+++ b/src/java.base/unix/native/jspawnhelper/jspawnhelper.c
@@ -34,6 +34,7 @@
 #include <sys/stat.h>
 
 #include "childproc.h"
+#include "childproc_errorcodes.h"
 
 extern int errno;
 
@@ -41,36 +42,34 @@ extern int errno;
     void *mptr; \
     mptr = malloc (Y); \
     if (mptr == 0) { \
-        error (fdout, ERR_MALLOC); \
+        sendErrorCodeAndExit (fdout, ESTEP_JSPAWN_ALLOC_FAILED, (int)Y, errno); \
     } \
     X = mptr; \
 }
 
-#define ERR_MALLOC 1
-#define ERR_PIPE 2
-#define ERR_ARGS 3
-
 #ifndef VERSION_STRING
 #error VERSION_STRING must be defined
 #endif
 
-void error (int fd, int err) {
-    if (write (fd, &err, sizeof(err)) != sizeof(err)) {
-        /* Not sure what to do here. I have no one to speak to. */
-        exit(0x80 + err);
+/* Attempts to send an error code to the parent (which may or may not
+ * work depending on whether the fail pipe exists); then exits with an
+ * error code corresponding to the fail step. */
+void sendErrorCodeAndExit(int failpipe_fd, int step, int hint, int errno_) {
+    errcode_t errcode;
+    buildErrorCode(&errcode, step, hint, errno_);
+    if (failpipe_fd == -1 || !sendErrorCode(failpipe_fd, errcode)) {
+        /* Write error code to stdout, in the hope someone reads this. */
+        printf("jspawnhelper fail: " ERRCODE_FORMAT "\n", ERRCODE_FORMAT_ARGS(errcode));
     }
-    exit (1);
+    exit(exitCodeFromErrorCode(errcode));
 }
 
-void shutItDown() {
-    fprintf(stdout, "jspawnhelper version %s\n", VERSION_STRING);
-    fprintf(stdout, "This command is not for general use and should ");
-    fprintf(stdout, "only be run as the result of a call to\n");
-    fprintf(stdout, "ProcessBuilder.start() or Runtime.exec() in a java ");
-    fprintf(stdout, "application\n");
-    fflush(stdout);
-    _exit(1);
-}
+static const char* usageErrorText =
+    "jspawnhelper version " VERSION_STRING "\n"
+    "This command is not for general use and should "
+    "only be run as the result of a call to\n"
+    "ProcessBuilder.start() or Runtime.exec() in a java "
+    "application\n";
 
 /*
  * read the following off the pipefd
@@ -84,22 +83,31 @@ void initChildStuff (int fdin, int fdout, ChildStuff *c) {
     int bufsize, offset=0;
     int magic;
     int res;
+    const int step = ESTEP_JSPAWN_RCV_CHILDSTUFF_COMM_FAIL;
+    int substep = 0;
 
     res = readFully (fdin, &magic, sizeof(magic));
-    if (res != 4 || magic != magicNumber()) {
-        error (fdout, ERR_PIPE);
+    if (res != 4) {
+        sendErrorCodeAndExit(fdout, step, substep, errno);
+    }
+
+    substep ++;
+    if (magic != magicNumber()) {
+        sendErrorCodeAndExit(fdout, step, substep, errno);
     }
 
 #ifdef DEBUG
     jtregSimulateCrash(0, 5);
 #endif
 
+    substep ++;
     if (readFully (fdin, c, sizeof(*c)) != sizeof(*c)) {
-        error (fdout, ERR_PIPE);
+        sendErrorCodeAndExit(fdout, step, substep, errno);
     }
 
+    substep ++;
     if (readFully (fdin, &sp, sizeof(sp)) != sizeof(sp)) {
-        error (fdout, ERR_PIPE);
+        sendErrorCodeAndExit(fdout, step, substep, errno);
     }
 
     bufsize = sp.argvBytes + sp.envvBytes +
@@ -107,8 +115,9 @@ void initChildStuff (int fdin, int fdout, ChildStuff *c) {
 
     ALLOC(buf, bufsize);
 
+    substep++;
     if (readFully (fdin, buf, bufsize) != bufsize) {
-        error (fdout, ERR_PIPE);
+        sendErrorCodeAndExit(fdout, step, substep, errno);
     }
 
     /* Initialize argv[] */
@@ -150,25 +159,29 @@ int main(int argc, char *argv[]) {
 #endif
 
     if (argc != 3) {
-        fprintf(stdout, "Incorrect number of arguments: %d\n", argc);
-        shutItDown();
+        printf("Incorrect number of arguments: %d\n", argc);
+        puts(usageErrorText);
+        sendErrorCodeAndExit(-1, ESTEP_JSPAWN_ARG_ERROR, 0, 0);
     }
 
     if (strcmp(argv[1], VERSION_STRING) != 0) {
-        fprintf(stdout, "Incorrect Java version: %s\n", argv[1]);
-        shutItDown();
+        printf("Incorrect Java version: %s\n", argv[1]);
+        puts(usageErrorText);
+        sendErrorCodeAndExit(-1, ESTEP_JSPAWN_VERSION_ERROR, 0, 0);
     }
 
     r = sscanf (argv[2], "%d:%d:%d", &fdinr, &fdinw, &fdout);
     if (r == 3 && fcntl(fdinr, F_GETFD) != -1 && fcntl(fdinw, F_GETFD) != -1) {
         fstat(fdinr, &buf);
         if (!S_ISFIFO(buf.st_mode)) {
-            fprintf(stdout, "Incorrect input pipe\n");
-            shutItDown();
+            printf("Incorrect input pipe\n");
+            puts(usageErrorText);
+            sendErrorCodeAndExit(-1, ESTEP_JSPAWN_NOT_A_PIPE, fdinr, errno);
         }
     } else {
-        fprintf(stdout, "Incorrect FD array data: %s\n", argv[2]);
-        shutItDown();
+        printf("Incorrect FD array data: %s\n", argv[2]);
+        puts(usageErrorText);
+        sendErrorCodeAndExit(-1, ESTEP_JSPAWN_NOT_A_PIPE, fdinr, errno);
     }
 
     // Close the writing end of the pipe we use for reading from the parent.
diff --git a/src/java.base/unix/native/libjava/ProcessImpl_md.c b/src/java.base/unix/native/libjava/ProcessImpl_md.c
index 12597fbb650..29522f3c822 100644
--- a/src/java.base/unix/native/libjava/ProcessImpl_md.c
+++ b/src/java.base/unix/native/libjava/ProcessImpl_md.c
@@ -47,6 +47,7 @@
 #include <spawn.h>
 
 #include "childproc.h"
+#include "childproc_errorcodes.h"
 
 /*
  *
@@ -678,7 +679,6 @@ Java_java_lang_ProcessImpl_forkAndExec(JNIEnv *env,
                                        jintArray std_fds,
                                        jboolean redirectErrorStream)
 {
-    int errnum;
     int resultPid = -1;
     int in[2], out[2], err[2], fail[2], childenv[2];
     jint *fds = NULL;
@@ -782,9 +782,11 @@ Java_java_lang_ProcessImpl_forkAndExec(JNIEnv *env,
     }
     close(fail[1]); fail[1] = -1; /* See: WhyCantJohnnyExec  (childproc.c)  */
 
+    errcode_t errcode;
+
     /* If we expect the child to ping aliveness, wait for it. */
     if (c->sendAlivePing) {
-        switch(readFully(fail[0], &errnum, sizeof(errnum))) {
+        switch(readFully(fail[0], &errcode, sizeof(errcode))) {
         case 0: /* First exec failed; */
             {
                 int tmpStatus = 0;
@@ -792,13 +794,15 @@ Java_java_lang_ProcessImpl_forkAndExec(JNIEnv *env,
                 throwExitCause(env, p, tmpStatus, c->mode);
                 goto Catch;
             }
-        case sizeof(errnum):
-            if (errnum != CHILD_IS_ALIVE) {
-                /* This can happen if the spawn helper encounters an error
-                 * before or during the handshake with the parent. */
-                throwInternalIOException(env, 0,
-                                         "Bad code from spawn helper (Failed to exec spawn helper)",
-                                         c->mode);
+        case sizeof(errcode):
+            if (errcode.step != ESTEP_CHILD_ALIVE) {
+                /* This can happen if the child process encounters an error
+                 * before or during initial handshake with the parent. */
+                char msg[256];
+                snprintf(msg, sizeof(msg),
+                         "Bad early code from spawn helper " ERRCODE_FORMAT " (Failed to exec spawn helper)",
+                         ERRCODE_FORMAT_ARGS(errcode));
+                throwInternalIOException(env, 0, msg, c->mode);
                 goto Catch;
             }
             break;
@@ -808,11 +812,29 @@ Java_java_lang_ProcessImpl_forkAndExec(JNIEnv *env,
         }
     }
 
-    switch (readFully(fail[0], &errnum, sizeof(errnum))) {
+    switch (readFully(fail[0], &errcode, sizeof(errcode))) {
     case 0: break; /* Exec succeeded */
-    case sizeof(errnum):
+    case sizeof(errcode):
+        /* Always reap first! */
         waitpid(resultPid, NULL, 0);
-        throwIOException(env, errnum, "Exec failed");
+        /* Most of these errors are implementation errors and should result in an internal IOE, but
+         * a few can be caused by bad user input and need to be communicated to the end user. */
+        switch(errcode.step) {
+        case ESTEP_CHDIR_FAIL:
+            throwIOException(env, errcode.errno_, "Failed to access working directory");
+            break;
+        case ESTEP_EXEC_FAIL:
+            throwIOException(env, errcode.errno_, "Exec failed");
+            break;
+        default: {
+            /* Probably implementation error */
+            char msg[256];
+            snprintf(msg, sizeof(msg),
+                     "Bad code from spawn helper " ERRCODE_FORMAT " (Failed to exec spawn helper)",
+                     ERRCODE_FORMAT_ARGS(errcode));
+            throwInternalIOException(env, 0, msg, c->mode);
+        }
+        };
         goto Catch;
     default:
         throwInternalIOException(env, errno, "Read failed", c->mode);
diff --git a/src/java.base/unix/native/libjava/childproc.c b/src/java.base/unix/native/libjava/childproc.c
index 9c6334e52d2..a45674e3f82 100644
--- a/src/java.base/unix/native/libjava/childproc.c
+++ b/src/java.base/unix/native/libjava/childproc.c
@@ -34,16 +34,27 @@
 #include <limits.h>
 
 #include "childproc.h"
+#include "childproc_errorcodes.h"
 #include "jni_util.h"
 
 const char * const *parentPathv;
 
-static int
-restartableDup2(int fd_from, int fd_to)
+/* All functions taking an errcode_t* as output behave the same: upon error, they populate
+ * errcode_t::hint and errcode_t::errno, but leave errcode_t::step as ESTEP_UNKNOWN since
+ * this information will be provided by the outer caller */
+
+static bool
+restartableDup2(int fd_from, int fd_to, errcode_t* errcode)
 {
     int err;
     RESTARTABLE(dup2(fd_from, fd_to), err);
-    return err;
+    if (err == -1) {
+        /* use fd_to (the destination descriptor) as hint: it is a bit more telling
+         * than fd_from in our case */
+        buildErrorCode(errcode, ESTEP_UNKNOWN, fd_to, errno);
+        return false;
+    }
+    return true;
 }
 
 int
@@ -52,6 +63,16 @@ closeSafely(int fd)
     return (fd == -1) ? 0 : close(fd);
 }
 
+/* Like closeSafely, but sets errcode (hint = fd, errno) on error and returns false */
+static bool
+closeSafely2(int fd, errcode_t* errcode) {
+    if (closeSafely(fd) == -1) {
+        buildErrorCode(errcode, ESTEP_UNKNOWN, fd, errno);
+        return false;
+    }
+    return true;
+}
+
 int
 markCloseOnExec(int fd)
 {
@@ -128,15 +149,19 @@ markDescriptorsCloseOnExec(void)
     return 0;
 }
 
-static int
-moveDescriptor(int fd_from, int fd_to)
+static bool
+moveDescriptor(int fd_from, int fd_to, errcode_t* errcode)
 {
     if (fd_from != fd_to) {
-        if ((restartableDup2(fd_from, fd_to) == -1) ||
-            (close(fd_from) == -1))
-            return -1;
+        if (!restartableDup2(fd_from, fd_to, errcode)) {
+            return false;
+        }
+        if (close(fd_from) == -1) {
+            buildErrorCode(errcode, ESTEP_UNKNOWN, fd_from, errno);
+            return false;
+        }
     }
-    return 0;
+    return true;
 }
 
 int
@@ -367,15 +392,16 @@ int
 childProcess(void *arg)
 {
     const ChildStuff* p = (const ChildStuff*) arg;
-    int fail_pipe_fd = p->fail[1];
 
-    if (p->sendAlivePing) {
-        /* Child shall signal aliveness to parent at the very first
-         * moment. */
-        int code = CHILD_IS_ALIVE;
-        if (writeFully(fail_pipe_fd, &code, sizeof(code)) != sizeof(code)) {
-            goto WhyCantJohnnyExec;
-        }
+    int fail_pipe_fd = p->fail[1];
+    /* error information for WhyCantJohnnyExec */
+    errcode_t errcode;
+
+    /* Child shall signal aliveness to parent at the very first
+     * moment. */
+    if (p->sendAlivePing && !sendAlivePing(fail_pipe_fd)) {
+        buildErrorCode(&errcode, ESTEP_SENDALIVE_FAIL, fail_pipe_fd, errno);
+        goto WhyCantJohnnyExec;
     }
 
 #ifdef DEBUG
@@ -384,34 +410,49 @@ childProcess(void *arg)
     /* Close the parent sides of the pipes.
        Closing pipe fds here is redundant, since markDescriptorsCloseOnExec()
        would do it anyways, but a little paranoia is a good thing. */
-    if ((closeSafely(p->in[1])   == -1) ||
-        (closeSafely(p->out[0])  == -1) ||
-        (closeSafely(p->err[0])  == -1) ||
-        (closeSafely(p->childenv[0])  == -1) ||
-        (closeSafely(p->childenv[1])  == -1) ||
-        (closeSafely(p->fail[0]) == -1))
+    if (!closeSafely2(p->in[1], &errcode)  ||
+        !closeSafely2(p->out[0], &errcode) ||
+        !closeSafely2(p->err[0], &errcode) ||
+        !closeSafely2(p->childenv[0], &errcode) ||
+        !closeSafely2(p->childenv[1], &errcode) ||
+        !closeSafely2(p->fail[0], &errcode))
+    {
+        errcode.step = ESTEP_PIPECLOSE_FAIL;
         goto WhyCantJohnnyExec;
+    }
 
     /* Give the child sides of the pipes the right fileno's. */
     /* Note: it is possible for in[0] == 0 */
-    if ((moveDescriptor(p->in[0] != -1 ?  p->in[0] : p->fds[0],
-                        STDIN_FILENO) == -1) ||
-        (moveDescriptor(p->out[1]!= -1 ? p->out[1] : p->fds[1],
-                        STDOUT_FILENO) == -1))
+    if (!moveDescriptor(p->in[0] != -1 ?  p->in[0] : p->fds[0],
+                                STDIN_FILENO, &errcode)) {
+        errcode.step = ESTEP_DUP2_STDIN_FAIL;
         goto WhyCantJohnnyExec;
-
-    if (p->redirectErrorStream) {
-        if ((closeSafely(p->err[1]) == -1) ||
-            (restartableDup2(STDOUT_FILENO, STDERR_FILENO) == -1))
-            goto WhyCantJohnnyExec;
-    } else {
-        if (moveDescriptor(p->err[1] != -1 ? p->err[1] : p->fds[2],
-                           STDERR_FILENO) == -1)
-            goto WhyCantJohnnyExec;
     }
 
-    if (moveDescriptor(fail_pipe_fd, FAIL_FILENO) == -1)
+    if (!moveDescriptor(p->out[1] != -1 ?  p->out[1] : p->fds[1],
+                                STDOUT_FILENO, &errcode)) {
+        errcode.step = ESTEP_DUP2_STDOUT_FAIL;
         goto WhyCantJohnnyExec;
+    }
+
+    if (p->redirectErrorStream) {
+        if (!closeSafely2(p->err[1], &errcode) ||
+            !restartableDup2(STDOUT_FILENO, STDERR_FILENO, &errcode)) {
+            errcode.step = ESTEP_DUP2_STDERR_REDIRECT_FAIL;
+            goto WhyCantJohnnyExec;
+        }
+    } else {
+        if (!moveDescriptor(p->err[1] != -1 ? p->err[1] : p->fds[2],
+                                    STDERR_FILENO, &errcode)) {
+            errcode.step = ESTEP_DUP2_STDERR_REDIRECT_FAIL;
+            goto WhyCantJohnnyExec;
+        }
+    }
+
+    if (!moveDescriptor(fail_pipe_fd, FAIL_FILENO, &errcode)) {
+        errcode.step = ESTEP_DUP2_FAILPIPE_FAIL;
+        goto WhyCantJohnnyExec;
+    }
 
     /* We moved the fail pipe fd */
     fail_pipe_fd = FAIL_FILENO;
@@ -424,14 +465,19 @@ childProcess(void *arg)
     if (markDescriptorsCloseOnExec() == -1) { /* failed,  close the old way */
         int max_fd = (int)sysconf(_SC_OPEN_MAX);
         int fd;
-        for (fd = STDERR_FILENO + 1; fd < max_fd; fd++)
-            if (markCloseOnExec(fd) == -1 && errno != EBADF)
+        for (fd = STDERR_FILENO + 1; fd < max_fd; fd++) {
+            if (markCloseOnExec(fd) == -1 && errno != EBADF) {
+                buildErrorCode(&errcode, ESTEP_CLOEXEC_FAIL, fd, errno);
                 goto WhyCantJohnnyExec;
+            }
+        }
     }
 
     /* change to the new working directory */
-    if (p->pdir != NULL && chdir(p->pdir) < 0)
+    if (p->pdir != NULL && chdir(p->pdir) < 0) {
+        buildErrorCode(&errcode, ESTEP_CHDIR_FAIL, 0, errno);
         goto WhyCantJohnnyExec;
+    }
 
     // Reset any mask signals from parent, but not in VFORK mode
     if (p->mode != MODE_VFORK) {
@@ -442,28 +488,32 @@ childProcess(void *arg)
 
     // Children should be started with default signal disposition for SIGPIPE
     if (signal(SIGPIPE, SIG_DFL) == SIG_ERR) {
+        buildErrorCode(&errcode, ESTEP_SET_SIGPIPE, 0, errno);
         goto WhyCantJohnnyExec;
     }
 
     JDK_execvpe(p->mode, p->argv[0], p->argv, p->envv);
 
+    /* Still here. Hmm. */
+    buildErrorCode(&errcode, ESTEP_EXEC_FAIL, 0, errno);
+
  WhyCantJohnnyExec:
     /* We used to go to an awful lot of trouble to predict whether the
      * child would fail, but there is no reliable way to predict the
      * success of an operation without *trying* it, and there's no way
      * to try a chdir or exec in the parent.  Instead, all we need is a
      * way to communicate any failure back to the parent.  Easy; we just
-     * send the errno back to the parent over a pipe in case of failure.
+     * send the errorcode back to the parent over a pipe in case of failure.
      * The tricky thing is, how do we communicate the *success* of exec?
      * We use FD_CLOEXEC together with the fact that a read() on a pipe
      * yields EOF when the write ends (we have two of them!) are closed.
      */
-    {
-        int errnum = errno;
-        writeFully(fail_pipe_fd, &errnum, sizeof(errnum));
+    if (!sendErrorCode(fail_pipe_fd, errcode)) {
+        printf("childproc fail: " ERRCODE_FORMAT "\n", ERRCODE_FORMAT_ARGS(errcode));
     }
+    int exitcode = exitCodeFromErrorCode(errcode);
     close(fail_pipe_fd);
-    _exit(-1);
+    _exit(exitcode);
     return 0;  /* Suppress warning "no return value from function" */
 }
 
diff --git a/src/java.base/unix/native/libjava/childproc.h b/src/java.base/unix/native/libjava/childproc.h
index 974fac3bddd..4271c786635 100644
--- a/src/java.base/unix/native/libjava/childproc.h
+++ b/src/java.base/unix/native/libjava/childproc.h
@@ -107,13 +107,6 @@ typedef struct _SpawnInfo {
     int parentPathvBytes; /* total number of bytes in parentPathv array */
 } SpawnInfo;
 
-/* If ChildStuff.sendAlivePing is true, child shall signal aliveness to
- * the parent the moment it gains consciousness, before any subsequent
- * pre-exec errors could happen.
- * This code must fit into an int and not be a valid errno value on any of
- * our platforms. */
-#define CHILD_IS_ALIVE      65535
-
 /**
  * The cached and split version of the JDK's effective PATH.
  * (We don't support putenv("PATH=...") in native code)
diff --git a/src/java.base/unix/native/libjava/childproc_errorcodes.c b/src/java.base/unix/native/libjava/childproc_errorcodes.c
new file mode 100644
index 00000000000..4dc8e927616
--- /dev/null
+++ b/src/java.base/unix/native/libjava/childproc_errorcodes.c
@@ -0,0 +1,63 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.  Oracle designates this
+ * particular file as subject to the "Classpath" exception as provided
+ * by Oracle in the LICENSE file that accompanied this code.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+#include <assert.h>
+#include <stdbool.h>
+
+#include <unistd.h>
+#include "childproc.h"
+#include "childproc_errorcodes.h"
+
+void buildErrorCode(errcode_t* errcode, int step, int hint, int errno_) {
+    errcode_t e;
+
+    assert(step < (1 << 8));
+    e.step = step;
+
+    assert(errno_ < (1 << 8));
+    e.errno_ = errno_;
+
+    const int maxhint = (1 << 16);
+    e.hint = hint < maxhint ? hint : maxhint;
+
+    (*errcode) = e;
+}
+
+int exitCodeFromErrorCode(errcode_t errcode) {
+    /* We use the fail step number as exit code, but avoid 0 and 1
+     * and try to avoid the [128..256) range since that one is used by
+     * shells to codify abnormal kills by signal. */
+    return 0x10 + errcode.step;
+}
+
+bool sendErrorCode(int fd, errcode_t errcode) {
+    return writeFully(fd, &errcode, sizeof(errcode)) == sizeof(errcode);
+}
+
+bool sendAlivePing(int fd) {
+    errcode_t errcode;
+    buildErrorCode(&errcode, ESTEP_CHILD_ALIVE, getpid(), 0);
+    return sendErrorCode(fd, errcode);
+}
diff --git a/src/java.base/unix/native/libjava/childproc_errorcodes.h b/src/java.base/unix/native/libjava/childproc_errorcodes.h
new file mode 100644
index 00000000000..8379db4ad2b
--- /dev/null
+++ b/src/java.base/unix/native/libjava/childproc_errorcodes.h
@@ -0,0 +1,117 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.  Oracle designates this
+ * particular file as subject to the "Classpath" exception as provided
+ * by Oracle in the LICENSE file that accompanied this code.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+#ifndef CHILDPROC_ERRORCODES_H
+#define CHILDPROC_ERRORCODES_H
+
+#include <sys/types.h>
+#include <stdbool.h>
+
+typedef struct errcode_t_ {
+    unsigned step : 8;
+    unsigned hint : 16;
+    unsigned errno_ : 8;
+} errcode_t;
+
+/* Helper macros for printing an errcode_t */
+#define ERRCODE_FORMAT "(%u-%u-%u)"
+#define ERRCODE_FORMAT_ARGS(errcode) errcode.step, errcode.hint, errcode.errno_
+
+
+/* Builds up an error code.
+ * Note:
+ * - hint will be capped at 2^16
+ * - both step and errno_ must fit into 8 bits. */
+void buildErrorCode(errcode_t* errcode, int step, int hint, int errno_);
+
+/* Sends an error code down a pipe. Returns true if sent successfully. */
+bool sendErrorCode(int fd, errcode_t errcode);
+
+/* Build an exit code for an errcode (used as child process exit code
+ * in addition to the errcode being sent to parent). */
+int exitCodeFromErrorCode(errcode_t errcode);
+
+/* Sends alive ping down a pipe. Returns true if sent successfully. */
+bool sendAlivePing(int fd);
+
+#define ESTEP_UNKNOWN               0
+
+/* not an error code, but an "I am alive" ping from the child.
+ * hint is child pid, errno is 0. */
+#define ESTEP_CHILD_ALIVE           255
+
+/* JspawnHelper */
+#define ESTEP_JSPAWN_ARG_ERROR                  1
+#define ESTEP_JSPAWN_VERSION_ERROR              2
+
+/* Checking file descriptor setup
+ * hint is the (16-bit-capped) fd number */
+#define ESTEP_JSPAWN_INVALID_FD                 3
+#define ESTEP_JSPAWN_NOT_A_PIPE                 4
+
+/* Allocation fail in jspawnhelper.
+ * hint is the (16-bit-capped) fail size */
+#define ESTEP_JSPAWN_ALLOC_FAILED               5
+
+/* Receiving Childstuff from parent, communication error.
+ * hint is the substep. */
+#define ESTEP_JSPAWN_RCV_CHILDSTUFF_COMM_FAIL   6
+
+/* Expand if needed ... */
+
+/* childproc() */
+
+/* Failed to send aliveness ping
+ * hint is the (16-bit-capped) fd. */
+#define ESTEP_SENDALIVE_FAIL                    10
+
+/* Failed to close a pipe in fork mode
+ * hint is the (16-bit-capped) fd. */
+#define ESTEP_PIPECLOSE_FAIL                    11
+
+/* Failed to dup2 a file descriptor in fork mode.
+ * hint is the (16-bit-capped) fd_to (!) */
+#define ESTEP_DUP2_STDIN_FAIL                   13
+#define ESTEP_DUP2_STDOUT_FAIL                  14
+#define ESTEP_DUP2_STDERR_REDIRECT_FAIL         15
+#define ESTEP_DUP2_STDERR_FAIL                  16
+#define ESTEP_DUP2_FAILPIPE_FAIL                17
+
+/* Failed to mark a file descriptor as CLOEXEC
+ * hint is the (16-bit-capped) fd */
+#define ESTEP_CLOEXEC_FAIL                      18
+
+/* Failed to chdir into the target working directory */
+#define ESTEP_CHDIR_FAIL                        19
+
+/* Failed to change signal disposition for SIGPIPE to default */
+#define ESTEP_SET_SIGPIPE                       20
+
+/* Expand if needed ... */
+
+/* All modes: exec() failed */
+#define ESTEP_EXEC_FAIL                         30
+
+#endif /* CHILDPROC_MD_H */
diff --git a/test/jdk/java/lang/ProcessBuilder/InvalidWorkDir.java b/test/jdk/java/lang/ProcessBuilder/InvalidWorkDir.java
new file mode 100644
index 00000000000..310ecf03f97
--- /dev/null
+++ b/test/jdk/java/lang/ProcessBuilder/InvalidWorkDir.java
@@ -0,0 +1,62 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+/**
+ * @test id=FORK
+ * @bug 8379967
+ * @summary Check that passing an invalid work dir yields a corresponding IOE text.
+ * @requires (os.family != "windows")
+ * @requires vm.flagless
+ * @library /test/lib
+ * @run main/othervm -Xmx64m -Djdk.lang.Process.launchMechanism=FORK InvalidWorkDir
+ */
+
+/**
+ * @test id=POSIX_SPAWN
+ * @bug 8379967
+ * @summary Check that passing an invalid work dir yields a corresponding IOE text.
+ * @requires (os.family != "windows")
+ * @requires vm.flagless
+ * @library /test/lib
+ * @run main/othervm -Xmx64m -Djdk.lang.Process.launchMechanism=FORK InvalidWorkDir
+ */
+
+import jdk.test.lib.process.OutputAnalyzer;
+
+import java.io.File;
+import java.io.IOException;
+
+public class InvalidWorkDir {
+
+    public static void main(String[] args) {
+        ProcessBuilder bld = new ProcessBuilder("ls").directory(new File("./doesnotexist"));
+        try(Process p = bld.start()) {
+            throw new RuntimeException("IOE expected");
+        } catch (IOException e) {
+            if (!e.getMessage().matches(".*Failed to access working directory.*No such file or directory.*")) {
+                throw new RuntimeException(String.format("got IOE but with different text (%s)", e.getMessage()));
+            }
+        }
+    }
+
+}
diff --git a/test/jdk/java/lang/ProcessBuilder/JspawnhelperWarnings.java b/test/jdk/java/lang/ProcessBuilder/JspawnhelperWarnings.java
index d9896f16e00..cb2d504951d 100644
--- a/test/jdk/java/lang/ProcessBuilder/JspawnhelperWarnings.java
+++ b/test/jdk/java/lang/ProcessBuilder/JspawnhelperWarnings.java
@@ -22,11 +22,19 @@
  */
 
 /*
- * @test
- * @bug 8325567 8325621
+ * @test id=badargs
+ * @bug 8325567 8325621 8379967
  * @requires (os.family == "linux") | (os.family == "aix") | (os.family == "mac")
  * @library /test/lib
- * @run driver JspawnhelperWarnings
+ * @run driver JspawnhelperWarnings badargs
+ */
+
+/*
+ * @test id=badversion
+ * @bug 8325567 8325621 8379967
+ * @requires (os.family == "linux") | (os.family == "aix") | (os.family == "mac")
+ * @library /test/lib
+ * @run driver JspawnhelperWarnings badversion
  */
 
 import java.nio.file.Paths;
@@ -36,6 +44,13 @@ import jdk.test.lib.process.ProcessTools;
 
 public class JspawnhelperWarnings {
 
+    // See childproc_errorcodes.h
+    static final int ESTEP_JSPAWN_ARG_ERROR = 1;
+    static final int ESTEP_JSPAWN_VERSION_ERROR = 2;
+
+    // See exitCodeFromErrorCode() in childproc_errorcodes.c
+    static final int EXITCODE_OFFSET = 0x10;
+
     private static void tryWithNArgs(int nArgs) throws Exception {
         System.out.println("Running jspawnhelper with " + nArgs + " args");
         String[] args = new String[nArgs + 1];
@@ -43,7 +58,8 @@ public class JspawnhelperWarnings {
         args[0] = Paths.get(System.getProperty("java.home"), "lib", "jspawnhelper").toString();
         Process p = ProcessTools.startProcess("jspawnhelper", new ProcessBuilder(args));
         OutputAnalyzer oa = new OutputAnalyzer(p);
-        oa.shouldHaveExitValue(1);
+        oa.shouldHaveExitValue(EXITCODE_OFFSET + ESTEP_JSPAWN_ARG_ERROR);
+        oa.shouldContain("jspawnhelper fail: (1-0-0)");
         oa.shouldContain("This command is not for general use");
         if (nArgs != 2) {
             oa.shouldContain("Incorrect number of arguments");
@@ -59,16 +75,28 @@ public class JspawnhelperWarnings {
         args[2] = "1:1:1";
         Process p = ProcessTools.startProcess("jspawnhelper", new ProcessBuilder(args));
         OutputAnalyzer oa = new OutputAnalyzer(p);
-        oa.shouldHaveExitValue(1);
+        oa.shouldHaveExitValue(EXITCODE_OFFSET + ESTEP_JSPAWN_VERSION_ERROR);
+        oa.shouldContain("jspawnhelper fail: (2-0-0)");
         oa.shouldContain("This command is not for general use");
         oa.shouldContain("Incorrect Java version: wrongVersion");
     }
 
     public static void main(String[] args) throws Exception {
-        for (int nArgs = 0; nArgs < 10; nArgs++) {
-            tryWithNArgs(nArgs);
+        if (args.length != 1) {
+            throw new RuntimeException("test argument error");
+        }
+        switch (args[0]) {
+            case "badargs" -> {
+                for (int nArgs = 0; nArgs < 10; nArgs++) {
+                    if (nArgs != 2) {
+                        tryWithNArgs(nArgs);
+                    }
+                }
+            }
+            case "badversion" -> {
+                testVersion();
+            }
+            default -> throw new RuntimeException("test argument error");
         }
-
-        testVersion();
     }
 }

From c7438a92a7cc368f2629744191dbd51d104d3be1 Mon Sep 17 00:00:00 2001
From: Alexander Zvegintsev <azvegint@openjdk.org>
Date: Mon, 16 Mar 2026 14:10:19 +0000
Subject: [PATCH 207/655] 8376050:
 awt/event/MouseEvent/AltGraphModifierTest/AltGraphModifierTest.java fails on
 Ubuntu

Reviewed-by: dmarkov, serb, aivanov, honkar
---
 src/java.desktop/unix/classes/sun/awt/X11/XToolkit.java   | 8 ++++++--
 .../AltGraphModifierTest/AltGraphModifierTest.java        | 4 ++--
 2 files changed, 8 insertions(+), 4 deletions(-)

diff --git a/src/java.desktop/unix/classes/sun/awt/X11/XToolkit.java b/src/java.desktop/unix/classes/sun/awt/X11/XToolkit.java
index 78cd4a7e57d..5dcd1b763e1 100644
--- a/src/java.desktop/unix/classes/sun/awt/X11/XToolkit.java
+++ b/src/java.desktop/unix/classes/sun/awt/X11/XToolkit.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2002, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2002, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -1770,7 +1770,11 @@ public final class XToolkit extends UNIXToolkit implements Runnable {
         final int altL = keysymToPrimaryKeycode(XKeySymConstants.XK_Alt_L);
         final int altR = keysymToPrimaryKeycode(XKeySymConstants.XK_Alt_R);
         final int numLock = keysymToPrimaryKeycode(XKeySymConstants.XK_Num_Lock);
-        final int modeSwitch = keysymToPrimaryKeycode(XKeySymConstants.XK_Mode_switch);
+        int modeSwitchTmp = keysymToPrimaryKeycode(XKeySymConstants.XK_Mode_switch);
+        if (modeSwitchTmp == 0) {
+            modeSwitchTmp = keysymToPrimaryKeycode(XKeySymConstants.XK_ISO_Level3_Shift);
+        }
+        final int modeSwitch = modeSwitchTmp;
         final int shiftLock = keysymToPrimaryKeycode(XKeySymConstants.XK_Shift_Lock);
         final int capsLock  = keysymToPrimaryKeycode(XKeySymConstants.XK_Caps_Lock);
 
diff --git a/test/jdk/java/awt/event/MouseEvent/AltGraphModifierTest/AltGraphModifierTest.java b/test/jdk/java/awt/event/MouseEvent/AltGraphModifierTest/AltGraphModifierTest.java
index c8730b28964..615e2cdd6af 100644
--- a/test/jdk/java/awt/event/MouseEvent/AltGraphModifierTest/AltGraphModifierTest.java
+++ b/test/jdk/java/awt/event/MouseEvent/AltGraphModifierTest/AltGraphModifierTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2015, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2015, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,7 +23,7 @@
 
 /*
  * @test
- * @bug 8041928 8158616
+ * @bug 8041928 8158616 8376050
  * @requires (os.family != "mac")
  * @summary Confirm that the Alt-Gr Modifier bit is set correctly.
  * @library /java/awt/regtesthelpers

From e0fa3d2f8182fa4178b8ab3a532fbc4ea82e9bb8 Mon Sep 17 00:00:00 2001
From: Kangcheng Xu <kxu@openjdk.org>
Date: Mon, 16 Mar 2026 14:11:27 +0000
Subject: [PATCH 208/655] 8353290: C2: Refactor
 PhaseIdealLoop::is_counted_loop()

Reviewed-by: chagedorn, roland
---
 src/hotspot/share/opto/loopnode.cpp           | 1297 ++++++++++-------
 src/hotspot/share/opto/loopnode.hpp           |  268 +++-
 src/hotspot/share/opto/loopopts.cpp           |   62 +-
 .../TestStressLongCountedLoopLimitChecks.java |  117 ++
 4 files changed, 1118 insertions(+), 626 deletions(-)
 create mode 100644 test/hotspot/jtreg/compiler/loopopts/TestStressLongCountedLoopLimitChecks.java

diff --git a/src/hotspot/share/opto/loopnode.cpp b/src/hotspot/share/opto/loopnode.cpp
index d68505836d4..1523372e64c 100644
--- a/src/hotspot/share/opto/loopnode.cpp
+++ b/src/hotspot/share/opto/loopnode.cpp
@@ -375,17 +375,20 @@ IdealLoopTree* PhaseIdealLoop::create_outer_strip_mined_loop(Node* init_control,
   return outer_ilt;
 }
 
-void PhaseIdealLoop::insert_loop_limit_check_predicate(ParsePredicateSuccessProj* loop_limit_check_parse_proj,
-                                                       Node* cmp_limit, Node* bol) {
+
+void CountedLoopConverter::insert_loop_limit_check_predicate(const ParsePredicateSuccessProj* loop_limit_check_parse_proj,
+                                                             Node* bol) const {
   assert(loop_limit_check_parse_proj->in(0)->is_ParsePredicate(), "must be parse predicate");
-  Node* new_predicate_proj = create_new_if_for_predicate(loop_limit_check_parse_proj, nullptr,
-                                                         Deoptimization::Reason_loop_limit_check,
-                                                         Op_If);
+  Node* new_predicate_proj = _phase->create_new_if_for_predicate(loop_limit_check_parse_proj, nullptr,
+                                                                 Deoptimization::Reason_loop_limit_check,
+                                                                 Op_If);
+
+  PhaseIterGVN& igvn = _phase->igvn();
   Node* iff = new_predicate_proj->in(0);
-  cmp_limit = _igvn.register_new_node_with_optimizer(cmp_limit);
-  bol = _igvn.register_new_node_with_optimizer(bol);
-  set_subtree_ctrl(bol, false);
-  _igvn.replace_input_of(iff, 1, bol);
+  Node* cmp_limit = igvn.register_new_node_with_optimizer(bol->in(1));
+  bol = igvn.register_new_node_with_optimizer(bol);
+  _phase->set_subtree_ctrl(bol, false);
+  igvn.replace_input_of(iff, 1, bol);
 
 #ifndef PRODUCT
   // report that the loop predication has been actually performed
@@ -397,14 +400,38 @@ void PhaseIdealLoop::insert_loop_limit_check_predicate(ParsePredicateSuccessProj
 #endif
 }
 
-Node* PhaseIdealLoop::loop_exit_control(Node* x, IdealLoopTree* loop) {
+void CountedLoopConverter::insert_stride_overflow_limit_check() const {
+  const jlong stride_con = _structure.stride_con();
+
+  jlong adjusted_stride_con = (stride_con > 0
+                             ? max_signed_integer(_iv_bt)
+                             : min_signed_integer(_iv_bt)) - _structure.final_limit_correction();
+  Node* cmp_limit = CmpNode::make(_structure.limit(),
+                                  _phase->igvn().integercon(adjusted_stride_con, _iv_bt), _iv_bt);
+  Node* bol = new BoolNode(cmp_limit, stride_con > 0 ? BoolTest::le : BoolTest::ge);
+
+  insert_loop_limit_check_predicate(_head->in(LoopNode::EntryControl)->as_IfTrue(), bol);
+}
+
+void CountedLoopConverter::insert_init_trip_limit_check() const {
+  const jlong stride_con = _structure.stride_con();
+
+  Node* cmp_limit = CmpNode::make(_structure.phi()->in(LoopNode::EntryControl), _structure.limit(), _iv_bt);
+  Node* bol = new BoolNode(cmp_limit, stride_con > 0 ? BoolTest::lt : BoolTest::gt);
+
+  insert_loop_limit_check_predicate(_head->in(LoopNode::EntryControl)->as_IfTrue(), bol);
+}
+
+Node* PhaseIdealLoop::loop_exit_control(const IdealLoopTree* loop) const {
+  Node* head = loop->_head;
+
   // Counted loop head must be a good RegionNode with only 3 not null
   // control input edges: Self, Entry, LoopBack.
-  if (x->in(LoopNode::Self) == nullptr || x->req() != 3 || loop->_irreducible) {
+  if (head->in(LoopNode::Self) == nullptr || head->req() != 3 || loop->_irreducible) {
     return nullptr;
   }
-  Node *init_control = x->in(LoopNode::EntryControl);
-  Node *back_control = x->in(LoopNode::LoopBackControl);
+  Node* init_control = head->in(LoopNode::EntryControl);
+  Node* back_control = head->in(LoopNode::LoopBackControl);
   if (init_control == nullptr || back_control == nullptr) {   // Partially dead
     return nullptr;
   }
@@ -437,77 +464,7 @@ Node* PhaseIdealLoop::loop_exit_control(Node* x, IdealLoopTree* loop) {
   return iftrue;
 }
 
-Node* PhaseIdealLoop::loop_exit_test(Node* back_control, IdealLoopTree* loop, Node*& incr, Node*& limit, BoolTest::mask& bt, float& cl_prob) {
-  Node* iftrue = back_control;
-  uint iftrue_op = iftrue->Opcode();
-  Node* iff = iftrue->in(0);
-  BoolNode* test = iff->in(1)->as_Bool();
-  bt = test->_test._test;
-  cl_prob = iff->as_If()->_prob;
-  if (iftrue_op == Op_IfFalse) {
-    bt = BoolTest(bt).negate();
-    cl_prob = 1.0 - cl_prob;
-  }
-  // Get backedge compare
-  Node* cmp = test->in(1);
-  if (!cmp->is_Cmp()) {
-    return nullptr;
-  }
-
-  // Find the trip-counter increment & limit.  Limit must be loop invariant.
-  incr  = cmp->in(1);
-  limit = cmp->in(2);
-
-  // ---------
-  // need 'loop()' test to tell if limit is loop invariant
-  // ---------
-
-  if (!ctrl_is_member(loop, incr)) { // Swapped trip counter and limit?
-    Node* tmp = incr;            // Then reverse order into the CmpI
-    incr = limit;
-    limit = tmp;
-    bt = BoolTest(bt).commute(); // And commute the exit test
-  }
-  if (ctrl_is_member(loop, limit)) { // Limit must be loop-invariant
-    return nullptr;
-  }
-  if (!ctrl_is_member(loop, incr)) { // Trip counter must be loop-variant
-    return nullptr;
-  }
-  return cmp;
-}
-
-Node* PhaseIdealLoop::loop_iv_incr(Node* incr, Node* x, IdealLoopTree* loop, Node*& phi_incr) {
-  if (incr->is_Phi()) {
-    if (incr->as_Phi()->region() != x || incr->req() != 3) {
-      return nullptr; // Not simple trip counter expression
-    }
-    phi_incr = incr;
-    incr = phi_incr->in(LoopNode::LoopBackControl); // Assume incr is on backedge of Phi
-    if (!ctrl_is_member(loop, incr)) { // Trip counter must be loop-variant
-      return nullptr;
-    }
-  }
-  return incr;
-}
-
-Node* PhaseIdealLoop::loop_iv_stride(Node* incr, Node*& xphi) {
-  assert(incr->Opcode() == Op_AddI || incr->Opcode() == Op_AddL, "caller resp.");
-  // Get merge point
-  xphi = incr->in(1);
-  Node *stride = incr->in(2);
-  if (!stride->is_Con()) {     // Oops, swap these
-    if (!xphi->is_Con()) {     // Is the other guy a constant?
-      return nullptr;          // Nope, unknown stride, bail out
-    }
-    Node *tmp = xphi;          // 'incr' is commutative, so ok to swap
-    xphi = stride;
-    stride = tmp;
-  }
-  return stride;
-}
-
-PhiNode* PhaseIdealLoop::loop_iv_phi(Node* xphi, Node* phi_incr, Node* x) {
+PhiNode* PhaseIdealLoop::loop_iv_phi(const Node* xphi, const Node* phi_incr, const Node* head) {
   if (!xphi->is_Phi()) {
     return nullptr; // Too much math on the trip counter
   }
@@ -517,44 +474,31 @@ PhiNode* PhaseIdealLoop::loop_iv_phi(Node* xphi, Node* phi_incr, Node* x) {
   PhiNode *phi = xphi->as_Phi();
 
   // Phi must be of loop header; backedge must wrap to increment
-  if (phi->region() != x) {
+  if (phi->region() != head) {
     return nullptr;
   }
   return phi;
 }
 
-static int check_stride_overflow(jlong final_correction, const TypeInteger* limit_t, BasicType bt) {
+CountedLoopConverter::StrideOverflowState CountedLoopConverter::check_stride_overflow(jlong final_correction,
+                                                                                      const TypeInteger* limit_t,
+                                                                                      BasicType bt) {
   if (final_correction > 0) {
     if (limit_t->lo_as_long() > (max_signed_integer(bt) - final_correction)) {
-      return -1;
+      return Overflow;
     }
     if (limit_t->hi_as_long() > (max_signed_integer(bt) - final_correction)) {
-      return 1;
+      return RequireLimitCheck;
     }
   } else {
     if (limit_t->hi_as_long() < (min_signed_integer(bt) - final_correction)) {
-      return -1;
+      return Overflow;
     }
     if (limit_t->lo_as_long() < (min_signed_integer(bt) - final_correction)) {
-      return 1;
+      return RequireLimitCheck;
     }
   }
-  return 0;
-}
-
-static bool condition_stride_ok(BoolTest::mask bt, jlong stride_con) {
-  // If the condition is inverted and we will be rolling
-  // through MININT to MAXINT, then bail out.
-  if (bt == BoolTest::eq || // Bail out, but this loop trips at most twice!
-      // Odd stride
-      (bt == BoolTest::ne && stride_con != 1 && stride_con != -1) ||
-      // Count down loop rolls through MAXINT
-      ((bt == BoolTest::le || bt == BoolTest::lt) && stride_con < 0) ||
-      // Count up loop rolls through MININT
-      ((bt == BoolTest::ge || bt == BoolTest::gt) && stride_con > 0)) {
-    return false; // Bail out
-  }
-  return true;
+  return NoOverflow;
 }
 
 Node* PhaseIdealLoop::loop_nest_replace_iv(Node* iv_to_replace, Node* inner_iv, Node* outer_phi, Node* inner_head,
@@ -647,10 +591,10 @@ void PhaseIdealLoop::add_parse_predicate(Deoptimization::DeoptReason reason, Nod
 // Find a safepoint node that dominates the back edge. We need a
 // SafePointNode so we can use its jvm state to create empty
 // predicates.
-static bool no_side_effect_since_safepoint(Compile* C, Node* x, Node* mem, MergeMemNode* mm, PhaseIdealLoop* phase) {
+static bool no_side_effect_since_safepoint(Compile* C, const Node* head, const Node* mem, MergeMemNode* mm, const PhaseIdealLoop* phase) {
   SafePointNode* safepoint = nullptr;
-  for (DUIterator_Fast imax, i = x->fast_outs(imax); i < imax; i++) {
-    Node* u = x->fast_out(i);
+  for (DUIterator_Fast imax, i = head->fast_outs(imax); i < imax; i++) {
+    Node* u = head->fast_out(i);
     if (u->is_memory_phi()) {
       Node* m = u->in(LoopNode::LoopBackControl);
       if (u->adr_type() == TypePtr::BOTTOM) {
@@ -700,14 +644,14 @@ static bool no_side_effect_since_safepoint(Compile* C, Node* x, Node* mem, Merge
   return true;
 }
 
-SafePointNode* PhaseIdealLoop::find_safepoint(Node* back_control, Node* x, IdealLoopTree* loop) {
+SafePointNode* PhaseIdealLoop::find_safepoint(Node* back_control, const Node* head, const IdealLoopTree* loop) {
   IfNode* exit_test = back_control->in(0)->as_If();
   SafePointNode* safepoint = nullptr;
   if (exit_test->in(0)->is_SafePoint() && exit_test->in(0)->outcnt() == 1) {
     safepoint = exit_test->in(0)->as_SafePoint();
   } else {
     Node* c = back_control;
-    while (c != x && c->Opcode() != Op_SafePoint) {
+    while (c != head && c->Opcode() != Op_SafePoint) {
       c = idom(c);
     }
 
@@ -746,7 +690,7 @@ SafePointNode* PhaseIdealLoop::find_safepoint(Node* back_control, Node* x, Ideal
       }
     }
 #endif
-    if (!no_side_effect_since_safepoint(C, x, mem, mm, this)) {
+    if (!no_side_effect_since_safepoint(C, head, mem, mm, this)) {
       safepoint = nullptr;
     } else {
       assert(mm == nullptr|| _igvn.transform(mm) == mem->as_MergeMem()->base_memory(), "all memory state should have been processed");
@@ -1744,51 +1688,275 @@ LoopNode* PhaseIdealLoop::create_inner_head(IdealLoopTree* loop, BaseCountedLoop
 }
 
 #ifdef ASSERT
-void PhaseIdealLoop::check_counted_loop_shape(IdealLoopTree* loop, Node* x, BasicType bt) {
-  Node* back_control = loop_exit_control(x, loop);
+void PhaseIdealLoop::check_counted_loop_shape(IdealLoopTree* loop, Node* head, BasicType bt) {
+  Node* back_control = loop_exit_control(loop);
   assert(back_control != nullptr, "no back control");
 
-  BoolTest::mask mask = BoolTest::illegal;
-  float cl_prob = 0;
-  Node* incr = nullptr;
-  Node* limit = nullptr;
+  LoopExitTest exit_test(back_control, loop, this);
+  exit_test.build();
+  assert(exit_test.is_valid_with_bt(bt), "no exit test");
 
-  Node* cmp = loop_exit_test(back_control, loop, incr, limit, mask, cl_prob);
-  assert(cmp != nullptr && cmp->Opcode() == Op_Cmp(bt), "no exit test");
+  LoopIVIncr iv_incr(head, loop);
+  iv_incr.build(exit_test.incr());
+  assert(iv_incr.is_valid_with_bt(bt), "no incr");
 
-  Node* phi_incr = nullptr;
-  incr = loop_iv_incr(incr, x, loop, phi_incr);
-  assert(incr != nullptr && incr->Opcode() == Op_Add(bt), "no incr");
+  LoopIVStride stride = LoopIVStride(bt);
+  stride.build(iv_incr.incr());
+  assert(stride.is_valid(), "no stride");
 
-  Node* xphi = nullptr;
-  Node* stride = loop_iv_stride(incr, xphi);
+  PhiNode* phi = loop_iv_phi(stride.xphi(), iv_incr.phi_incr(), head);
+  assert(phi != nullptr && phi->in(LoopNode::LoopBackControl) == iv_incr.incr(), "No phi");
 
-  assert(stride != nullptr, "no stride");
+  assert(stride.compute_non_zero_stride_con(exit_test.mask(), bt) != 0, "illegal condition");
 
-  PhiNode* phi = loop_iv_phi(xphi, phi_incr, x);
-
-  assert(phi != nullptr && phi->in(LoopNode::LoopBackControl) == incr, "No phi");
-
-  jlong stride_con = stride->get_integer_as_long(bt);
-
-  assert(condition_stride_ok(mask, stride_con), "illegal condition");
-
-  assert(mask != BoolTest::ne, "unexpected condition");
-  assert(phi_incr == nullptr, "bad loop shape");
-  assert(cmp->in(1) == incr, "bad exit test shape");
+  assert(exit_test.mask() != BoolTest::ne, "unexpected condition");
+  assert(iv_incr.phi_incr() == nullptr, "bad loop shape");
+  assert(exit_test.cmp()->in(1) == iv_incr.incr(), "bad exit test shape");
 
   // Safepoint on backedge not supported
-  assert(x->in(LoopNode::LoopBackControl)->Opcode() != Op_SafePoint, "no safepoint on backedge");
+  assert(head->in(LoopNode::LoopBackControl)->Opcode() != Op_SafePoint, "no safepoint on backedge");
 }
 #endif
 
+void PhaseIdealLoop::LoopExitTest::build() {
+  _is_valid = false;
+
+  const Node* iftrue = _back_control;
+  uint iftrue_op = iftrue->Opcode();
+  Node* iff = iftrue->in(0);
+  BoolNode* test = iff->in(1)->as_Bool();
+  _mask = test->_test._test;
+  _cl_prob = iff->as_If()->_prob;
+  if (iftrue_op == Op_IfFalse) {
+    _mask = BoolTest(_mask).negate();
+    _cl_prob = 1.0f - _cl_prob;
+  }
+  // Get backedge compare
+  _cmp = test->in(1);
+  if (!_cmp->is_Cmp()) {
+    return;
+  }
+
+  // Find the trip-counter increment & limit. Limit must be loop invariant.
+  _incr  = _cmp->in(1);
+  _limit = _cmp->in(2);
+
+  // ---------
+  // need 'loop()' test to tell if limit is loop invariant
+  // ---------
+
+  if (_loop->is_invariant(_incr)) { // Swapped trip counter and limit?
+    swap(_incr, _limit);   // Then reverse order into the CmpI
+    _mask = BoolTest(_mask).commute(); // And commute the exit test
+  }
+
+  if (!_loop->is_invariant(_limit)) { // Limit must be loop-invariant
+     return;
+  }
+  if (_loop->is_invariant(_incr)) { // Trip counter must be loop-variant
+    return;
+  }
+
+  _is_valid = true;
+}
+
+// Canonicalize the loop condition if it is 'ne'.
+void PhaseIdealLoop::LoopExitTest::canonicalize_mask(jlong stride_con) {
+  if (_mask != BoolTest::ne) {
+    return;
+  }
+
+  assert(stride_con == 1 || stride_con == -1, "simple increment only - checked in CountedLoopConverter");
+
+  if (stride_con == 1) {
+    // 'ne' can be replaced with 'lt' only when init < limit.
+    // This is ensured by the inserted predicate in CountedLoopConverter
+    _mask = BoolTest::lt;
+  } else {
+    // 'ne' can be replaced with 'gt' only when init > limit.
+    // This is ensured by the inserted predicate in CountedLoopConverter.
+    _mask = BoolTest::gt;
+  }
+}
+
+void PhaseIdealLoop::LoopIVIncr::build(Node* old_incr) {
+  _is_valid = false;
+
+  Node* incr = old_incr;
+  // Trip-counter increment must be commutative & associative.
+  if (incr->is_Phi()) {
+    if (incr->as_Phi()->region() != _head || incr->req() != 3) {
+      return; // Not simple trip counter expression
+    }
+    Node* phi_incr = incr;
+    Node* back_control = phi_incr->in(LoopNode::LoopBackControl); // Assume incr is on backedge of Phi
+    if (_loop->_phase->ctrl_is_member(_loop, back_control)) { // Trip counter must be loop-variant
+      _incr = back_control;
+      _phi_incr = phi_incr;
+      _is_valid = true;
+      return;
+    }
+  }
+  _incr = incr;
+  _phi_incr = nullptr;
+
+  _is_valid = true;
+}
+
+void PhaseIdealLoop::LoopIVStride::build(const Node* incr) {
+  _is_valid = false;
+
+  assert(incr->Opcode() == Op_AddI || incr->Opcode() == Op_AddL, "caller resp.");
+  // Get merge point
+  _xphi = incr->in(1);
+  _stride_node = incr->in(2);
+  if (!_stride_node->is_Con()) { // Oops, swap these
+    if (!_xphi->is_Con()) {      // Is the other guy a constant?
+      return;                    // Nope, unknown stride, bail out
+    }
+    swap(_xphi, _stride_node); // 'incr' is commutative, so ok to swap
+  }
+
+  // Iteratively uncast the loop induction variable
+  // until no more CastII/CastLL nodes are found.
+  while (_xphi->Opcode() == Op_Cast(_iv_bt)) {
+    _xphi = _xphi->in(1);
+  }
+
+  _is_valid = true;
+}
+
+jlong PhaseIdealLoop::LoopIVStride::compute_non_zero_stride_con(const BoolTest::mask mask, const BasicType iv_bt) const {
+  jlong stride_con = stride_node()->get_integer_as_long(iv_bt);
+  assert(stride_con != 0, "missed some peephole opt"); // stride constant can never be 0!
+
+  // If the condition is inverted and we will be rolling
+  // through MININT to MAXINT, then bail out.
+  if (mask == BoolTest::eq || // Bail out, but this loop trips at most twice!
+      // Odd stride
+      (mask == BoolTest::ne && stride_con != 1 && stride_con != -1) ||
+      // Count down loop rolls through MAXINT
+      ((mask == BoolTest::le || mask == BoolTest::lt) && stride_con < 0) ||
+      // Count up loop rolls through MININT
+      ((mask == BoolTest::ge || mask == BoolTest::gt) && stride_con > 0)) {
+    return 0; // Bail out with sentinel = 0
+  }
+
+  // Bail out if the stride is too big.
+  if (stride_con == min_signed_integer(iv_bt) || (ABS(stride_con) > max_signed_integer(iv_bt) / 2)) {
+    return 0; // Bail out with sentinel = 0
+  }
+
+  return stride_con;
+}
+
+void CountedLoopConverter::LoopStructure::build() {
+  _is_valid = false;
+
+  if (_back_control == nullptr) {
+    return;
+  }
+
+  _exit_test.build();
+  if (!_exit_test.is_valid_with_bt(_iv_bt)) {
+    return; // Avoid pointer & float & 64-bit compares
+  }
+
+  Node* incr = _exit_test.incr();
+  if (_exit_test.incr()->Opcode() == Op_Cast(_iv_bt)) {
+    incr = incr->in(1);
+  }
+
+  _iv_incr.build(incr);
+  if (!_iv_incr.is_valid()) {
+    return;
+  }
+
+  _truncated_increment.build(_iv_incr.incr());
+  if (!_truncated_increment.is_valid()) {
+    return; // Funny increment opcode
+  }
+  assert(_truncated_increment.incr()->Opcode() == Op_Add(_iv_bt), "wrong increment code");
+
+  _stride.build(_truncated_increment.incr());
+  if (!_stride.is_valid()) {
+    return;
+  }
+
+  _phi = PhaseIdealLoop::loop_iv_phi(_stride.xphi(), _iv_incr.phi_incr(), _head);
+  if (_phi == nullptr ||
+      (_truncated_increment.outer_trunc() == nullptr && _phi->in(LoopNode::LoopBackControl) != _truncated_increment.incr()) ||
+      (_truncated_increment.outer_trunc() != nullptr && _phi->in(LoopNode::LoopBackControl) != _truncated_increment.outer_trunc())) {
+    return;
+  }
+
+  Node* safepoint = _back_control->in(0)->in(0);
+  if (_loop->_child != nullptr) {
+    if (safepoint->Opcode() == Op_SafePoint) {
+      _safepoint = safepoint->as_SafePoint();
+    } else {
+      _safepoint = nullptr;
+    }
+  } else {
+    _safepoint = _phase->find_safepoint(_back_control, _head, _loop);
+  }
+
+  _is_valid = true;
+}
+
+// We need to canonicalize the loop exit check by using different values for adjusted_limit:
+// (LE1) iv_post_i < limit: Already canonicalized. We can directly use limit as adjusted_limit.
+//           -> adjusted_limit = limit.
+// (LE2) iv_post_i <= limit:
+//           iv_post_i < limit + 1
+//           -> adjusted limit = limit + 1
+// (LE3) iv_pre_i < limit:
+//           iv_pre_i + stride < limit + stride
+//           iv_post_i < limit + stride
+//           -> adjusted_limit = limit + stride
+// (LE4) iv_pre_i <= limit:
+//           iv_pre_i < limit + 1
+//           iv_pre_i + stride < limit + stride + 1
+//           iv_post_i < limit + stride + 1
+//           -> adjusted_limit = limit + stride + 1
+//
+// Note that:
+//     (AL) limit <= adjusted_limit.
+jlong CountedLoopConverter::LoopStructure::final_limit_correction() const {
+  const jlong stride_con = _stride.compute_non_zero_stride_con(_exit_test.mask(), _iv_bt);
+
+  // Accounting for (LE3) and (LE4) where we use pre-incremented phis in the loop exit check.
+  const jlong limit_correction_for_pre_iv_exit_check = _iv_incr.phi_incr() != nullptr ? stride_con : 0;
+
+  // Accounting for (LE2) and (LE4) where we use <= or >= in the loop exit check.
+  const jlong limit_correction_for_le_ge_exit_check = _exit_test.should_include_limit()
+                                                        ? (stride_con > 0 ? 1 : -1)
+                                                        : 0;
+
+  const jlong limit_correction = limit_correction_for_pre_iv_exit_check + limit_correction_for_le_ge_exit_check;
+  const jlong canonicalized_correction = stride_con + (stride_con > 0 ? -1 : 1);
+
+  return canonicalized_correction + limit_correction; // final_correction
+}
+
 #ifdef ASSERT
-// convert an int counted loop to a long counted to stress handling of
-// long counted loops
-bool PhaseIdealLoop::convert_to_long_loop(Node* cmp, Node* phi, IdealLoopTree* loop) {
+bool CountedLoopConverter::should_stress_long_counted_loop() {
+  assert(_checked_for_counted_loop, "must check for counted loop before stressing");
+
+  return StressLongCountedLoop > 0 &&
+      _iv_bt == T_INT &&
+      !_head->as_Loop()->is_loop_nest_inner_loop() &&
+      _structure.truncated_increment().trunc_type() == TypeInt::INT; // Only stress an int loop (i.e., not char, byte or short)
+}
+
+// Convert an int counted loop to a long counted to stress handling of long counted loops. Returns true upon success.
+bool CountedLoopConverter::stress_long_counted_loop() {
+  assert(should_stress_long_counted_loop(), "stress condition not satisfied");
+
+  PhaseIterGVN* igvn = &_phase->igvn();
   Unique_Node_List iv_nodes;
   Node_List old_new;
-  iv_nodes.push(cmp);
+  iv_nodes.push(_structure.exit_test().cmp());
   bool failed = false;
 
   for (uint i = 0; i < iv_nodes.size() && !failed; i++) {
@@ -1818,12 +1986,12 @@ bool PhaseIdealLoop::convert_to_long_loop(Node* cmp, Node* phi, IdealLoopTree* l
         fatal("unexpected");
     }
 
-    for (uint i = 1; i < n->req(); i++) {
-      Node* in = n->in(i);
+    for (uint j = 1; j < n->req(); j++) {
+      Node* in = n->in(j);
       if (in == nullptr) {
         continue;
       }
-      if (ctrl_is_member(loop, in)) {
+      if (_loop->is_member(_phase->get_loop(_phase->get_ctrl(in)))) {
         iv_nodes.push(in);
       }
     }
@@ -1834,243 +2002,142 @@ bool PhaseIdealLoop::convert_to_long_loop(Node* cmp, Node* phi, IdealLoopTree* l
       Node* n = iv_nodes.at(i);
       Node* clone = old_new[n->_idx];
       if (clone != nullptr) {
-        _igvn.remove_dead_node(clone);
+        igvn->remove_dead_node(clone);
       }
     }
     return false;
   }
 
+  // Make sure we have loop limit checks in place to preserve overflows behaviour after casting to long.
+  if (_should_insert_stride_overflow_limit_check) {
+    insert_stride_overflow_limit_check();
+  }
+
+  if (_should_insert_init_trip_limit_check) {
+    insert_init_trip_limit_check();
+  }
+
   for (uint i = 0; i < iv_nodes.size(); i++) {
     Node* n = iv_nodes.at(i);
     Node* clone = old_new[n->_idx];
-    for (uint i = 1; i < n->req(); i++) {
-      Node* in = n->in(i);
+    for (uint j = 1; j < n->req(); j++) {
+      Node* in = n->in(j);
       if (in == nullptr) {
         continue;
       }
       Node* in_clone = old_new[in->_idx];
       if (in_clone == nullptr) {
-        assert(_igvn.type(in)->isa_int(), "");
+        assert(igvn->type(in)->isa_int(), "");
         in_clone = new ConvI2LNode(in);
-        _igvn.register_new_node_with_optimizer(in_clone);
-        set_subtree_ctrl(in_clone, false);
+        igvn->register_new_node_with_optimizer(in_clone);
+        _phase->set_subtree_ctrl(in_clone, false);
       }
       if (in_clone->in(0) == nullptr) {
-        in_clone->set_req(0, C->top());
-        clone->set_req(i, in_clone);
+        in_clone->set_req(0, _phase->C->top());
+        clone->set_req(j, in_clone);
         in_clone->set_req(0, nullptr);
       } else {
-        clone->set_req(i, in_clone);
+        clone->set_req(j, in_clone);
       }
     }
-    _igvn.register_new_node_with_optimizer(clone);
+    igvn->register_new_node_with_optimizer(clone);
   }
-  set_ctrl(old_new[phi->_idx], phi->in(0));
+  _phase->set_ctrl(old_new[_structure.phi()->_idx], _structure.phi()->in(0));
 
   for (uint i = 0; i < iv_nodes.size(); i++) {
     Node* n = iv_nodes.at(i);
     Node* clone = old_new[n->_idx];
-    set_subtree_ctrl(clone, false);
+    _phase->set_subtree_ctrl(clone, false);
     Node* m = n->Opcode() == Op_CmpI ? clone : nullptr;
-    for (DUIterator_Fast imax, i = n->fast_outs(imax); i < imax; i++) {
-      Node* u = n->fast_out(i);
+    for (DUIterator_Fast imax, j = n->fast_outs(imax); j < imax; j++) {
+      Node* u = n->fast_out(j);
       if (iv_nodes.member(u)) {
         continue;
       }
       if (m == nullptr) {
         m = new ConvL2INode(clone);
-        _igvn.register_new_node_with_optimizer(m);
-        set_subtree_ctrl(m, false);
+        igvn->register_new_node_with_optimizer(m);
+        _phase->set_subtree_ctrl(m, false);
       }
-      _igvn.rehash_node_delayed(u);
-      int nb = u->replace_edge(n, m, &_igvn);
-      --i, imax -= nb;
+      igvn->rehash_node_delayed(u);
+      int nb = u->replace_edge(n, m, igvn);
+      --j, imax -= nb;
     }
   }
   return true;
 }
 #endif
 
-//------------------------------is_counted_loop--------------------------------
-bool PhaseIdealLoop::is_counted_loop(Node* x, IdealLoopTree*& loop, BasicType iv_bt) {
-  PhaseGVN *gvn = &_igvn;
+bool PhaseIdealLoop::try_convert_to_counted_loop(Node* head, IdealLoopTree*& loop, const BasicType iv_bt) {
+  CountedLoopConverter converter(this, head, loop, iv_bt);
+  if (converter.is_counted_loop()) {
+#ifdef ASSERT
+    // Stress by converting int counted loops to long counted loops
+    if (converter.should_stress_long_counted_loop() && converter.stress_long_counted_loop()) {
+      return false;
+    }
+#endif
 
-  Node* back_control = loop_exit_control(x, loop);
-  if (back_control == nullptr) {
+    loop = converter.convert();
+    return true;
+  }
+
+  return false;
+}
+
+bool CountedLoopConverter::is_counted_loop() {
+  PhaseIterGVN* igvn = &_phase->igvn();
+
+  _structure.build();
+  if (!_structure.is_valid()) {
     return false;
   }
 
-  BoolTest::mask bt = BoolTest::illegal;
-  float cl_prob = 0;
-  Node* incr = nullptr;
-  Node* limit = nullptr;
-  Node* cmp = loop_exit_test(back_control, loop, incr, limit, bt, cl_prob);
-  if (cmp == nullptr || cmp->Opcode() != Op_Cmp(iv_bt)) {
-    return false; // Avoid pointer & float & 64-bit compares
-  }
+  // =================================================
+  // ---- Is the loop trip counted? ----
 
-  // Trip-counter increment must be commutative & associative.
-  if (incr->Opcode() == Op_Cast(iv_bt)) {
-    incr = incr->in(1);
-  }
-
-  Node* phi_incr = nullptr;
-  incr = loop_iv_incr(incr, x, loop, phi_incr);
-  if (incr == nullptr) {
+  // Check trip counter will end up higher than the limit
+  if (_structure.is_infinite_loop()) {
     return false;
   }
 
-  Node* trunc1 = nullptr;
-  Node* trunc2 = nullptr;
-  const TypeInteger* iv_trunc_t = nullptr;
-  Node* orig_incr = incr;
-  if (!(incr = CountedLoopNode::match_incr_with_optional_truncation(incr, &trunc1, &trunc2, &iv_trunc_t, iv_bt))) {
-    return false; // Funny increment opcode
-  }
-  assert(incr->Opcode() == Op_Add(iv_bt), "wrong increment code");
-
-  Node* xphi = nullptr;
-  Node* stride = loop_iv_stride(incr, xphi);
-
-  if (stride == nullptr) {
-    return false;
-  }
-
-  // Iteratively uncast the loop induction variable
-  // until no more CastII/CastLL nodes are found.
-  while (xphi->Opcode() == Op_Cast(iv_bt)) {
-    xphi = xphi->in(1);
-  }
-
   // Stride must be constant
-  jlong stride_con = stride->get_integer_as_long(iv_bt);
-  assert(stride_con != 0, "missed some peephole opt");
-
-  PhiNode* phi = loop_iv_phi(xphi, phi_incr, x);
-
-  if (phi == nullptr ||
-      (trunc1 == nullptr && phi->in(LoopNode::LoopBackControl) != incr) ||
-      (trunc1 != nullptr && phi->in(LoopNode::LoopBackControl) != trunc1)) {
+  const jlong stride_con = _structure.stride_con();
+  if (stride_con == 0) {
     return false;
   }
 
-  Node* iftrue = back_control;
-  uint iftrue_op = iftrue->Opcode();
-  Node* iff = iftrue->in(0);
-  BoolNode* test = iff->in(1)->as_Bool();
-
-  const TypeInteger* limit_t = gvn->type(limit)->is_integer(iv_bt);
-  if (trunc1 != nullptr) {
-    // When there is a truncation, we must be sure that after the truncation
-    // the trip counter will end up higher than the limit, otherwise we are looking
-    // at an endless loop. Can happen with range checks.
-
-    // Example:
-    // int i = 0;
-    // while (true)
-    //    sum + = array[i];
-    //    i++;
-    //    i = i && 0x7fff;
-    //  }
-    //
-    // If the array is shorter than 0x8000 this exits through a AIOOB
-    //  - Counted loop transformation is ok
-    // If the array is longer then this is an endless loop
-    //  - No transformation can be done.
-
-    const TypeInteger* incr_t = gvn->type(orig_incr)->is_integer(iv_bt);
-    if (limit_t->hi_as_long() > incr_t->hi_as_long()) {
-      // if the limit can have a higher value than the increment (before the phi)
-      return false;
-    }
-  }
-
-  Node *init_trip = phi->in(LoopNode::EntryControl);
-
-  // If iv trunc type is smaller than int, check for possible wrap.
-  if (!TypeInteger::bottom(iv_bt)->higher_equal(iv_trunc_t)) {
-    assert(trunc1 != nullptr, "must have found some truncation");
-
-    // Get a better type for the phi (filtered thru if's)
-    const TypeInteger* phi_ft = filtered_type(phi);
-
-    // Can iv take on a value that will wrap?
-    //
-    // Ensure iv's limit is not within "stride" of the wrap value.
-    //
-    // Example for "short" type
-    //    Truncation ensures value is in the range -32768..32767 (iv_trunc_t)
-    //    If the stride is +10, then the last value of the induction
-    //    variable before the increment (phi_ft->_hi) must be
-    //    <= 32767 - 10 and (phi_ft->_lo) must be >= -32768 to
-    //    ensure no truncation occurs after the increment.
-
-    if (stride_con > 0) {
-      if (iv_trunc_t->hi_as_long() - phi_ft->hi_as_long() < stride_con ||
-          iv_trunc_t->lo_as_long() > phi_ft->lo_as_long()) {
-        return false;  // truncation may occur
-      }
-    } else if (stride_con < 0) {
-      if (iv_trunc_t->lo_as_long() - phi_ft->lo_as_long() > stride_con ||
-          iv_trunc_t->hi_as_long() < phi_ft->hi_as_long()) {
-        return false;  // truncation may occur
-      }
-    }
-    // No possibility of wrap so truncation can be discarded
-    // Promote iv type to Int
-  } else {
-    assert(trunc1 == nullptr && trunc2 == nullptr, "no truncation for int");
-  }
-
-  if (!condition_stride_ok(bt, stride_con)) {
+  // Check iv type can be promoted to int for short/char/byte loops
+  if (has_truncation_wrap(_structure.truncated_increment(), _structure.phi(), stride_con)) {
     return false;
   }
 
-  const TypeInteger* init_t = gvn->type(init_trip)->is_integer(iv_bt);
-
-  if (stride_con > 0) {
-    if (init_t->lo_as_long() > max_signed_integer(iv_bt) - stride_con) {
-      return false; // cyclic loop
-    }
-  } else {
-    if (init_t->hi_as_long() < min_signed_integer(iv_bt) - stride_con) {
-      return false; // cyclic loop
-    }
-  }
-
-  if (phi_incr != nullptr && bt != BoolTest::ne) {
-    // check if there is a possibility of IV overflowing after the first increment
-    if (stride_con > 0) {
-      if (init_t->hi_as_long() > max_signed_integer(iv_bt) - stride_con) {
-        return false;
-      }
-    } else {
-      if (init_t->lo_as_long() < min_signed_integer(iv_bt) - stride_con) {
-        return false;
-      }
-    }
+  // Check iv is not overflowing
+  Node* init_trip = _structure.phi()->in(LoopNode::EntryControl);
+  const TypeInteger* init_t = igvn->type(init_trip)->is_integer(_iv_bt);
+  if (is_iv_overflowing(init_t, stride_con, _structure.iv_incr().phi_incr(), _structure.exit_test().mask())) {
+    return false;
   }
 
   // =================================================
   // ---- SUCCESS!   Found A Trip-Counted Loop!  -----
-  //
 
-  if (x->Opcode() == Op_Region) {
-    // x has not yet been transformed to Loop or LongCountedLoop.
+  if (_head->Opcode() == Op_Region) {
+    // head has not yet been transformed to Loop or LongCountedLoop.
     // This should only happen if we are inside an infinite loop.
     // It happens like this:
     //   build_loop_tree -> do not attach infinite loop and nested loops
     //   beautify_loops  -> does not transform the infinite and nested loops to LoopNode, because not attached yet
     //   build_loop_tree -> find and attach infinite and nested loops
     //   counted_loop    -> nested Regions are not yet transformed to LoopNodes, we land here
-    assert(x->as_Region()->is_in_infinite_subgraph(),
-           "x can only be a Region and not Loop if inside infinite loop");
+    assert(_head->as_Region()->is_in_infinite_subgraph(),
+           "head can only be a Region and not Loop if inside infinite loop");
     // Come back later when Region is transformed to LoopNode
     return false;
   }
 
-  assert(x->Opcode() == Op_Loop || x->Opcode() == Op_LongCountedLoop, "regular loops only");
-  C->print_method(PHASE_BEFORE_CLOOPS, 3, x);
+  assert(_head->Opcode() == Op_Loop || _head->Opcode() == Op_LongCountedLoop, "regular loops only");
+  _phase->C->print_method(PHASE_BEFORE_CLOOPS, 3, _head);
 
   // ===================================================
   // We can only convert this loop to a counted loop if we can guarantee that the iv phi will never overflow at runtime.
@@ -2123,23 +2190,10 @@ bool PhaseIdealLoop::is_counted_loop(Node* x, IdealLoopTree*& loop, BasicType iv
   // When converting a loop to a counted loop, we want to have a canonicalized loop exit check of the form:
   //     iv_post_i < adjusted_limit
   //
-  // If that is not the case, we need to canonicalize the loop exit check by using different values for adjusted_limit:
-  // (LE1) iv_post_i < limit: Already canonicalized. We can directly use limit as adjusted_limit.
-  //           -> adjusted_limit = limit.
-  // (LE2) iv_post_i <= limit:
-  //           iv_post_i < limit + 1
-  //           -> adjusted limit = limit + 1
-  // (LE3) iv_pre_i < limit:
-  //           iv_pre_i + stride < limit + stride
-  //           iv_post_i < limit + stride
-  //           -> adjusted_limit = limit + stride
-  // (LE4) iv_pre_i <= limit:
-  //           iv_pre_i < limit + 1
-  //           iv_pre_i + stride < limit + stride + 1
-  //           iv_post_i < limit + stride + 1
-  //           -> adjusted_limit = limit + stride + 1
+  // If that is not the case, we need to canonicalize the loop exit check by using different values for adjusted_limit
+  // (see LoopStructure::final_limit_correction()).
   //
-  // Note that:
+  // Note that after canonicalization:
   //     (AL) limit <= adjusted_limit.
   //
   // The following loop invariant has to hold for counted loops with n iterations (i.e. loop exit check true after n-th
@@ -2259,78 +2313,63 @@ bool PhaseIdealLoop::is_counted_loop(Node* x, IdealLoopTree*& loop, BasicType iv
   //            there is no overflow of the iv phi after the first iteration. In this case, we don't need to check (ii)
   //            again and can skip the predicate.
 
-  // Check (vi) and bail out if the stride is too big.
-  if (stride_con == min_signed_integer(iv_bt) || (ABS(stride_con) > max_signed_integer(iv_bt) / 2)) {
-    return false;
+  const TypeInteger* limit_t = igvn->type(_structure.limit())->is_integer(_iv_bt);
+  StrideOverflowState stride_overflow_state = check_stride_overflow(_structure.final_limit_correction(), limit_t, _iv_bt);
+
+  Node* init_control = _head->in(LoopNode::EntryControl);
+  const Predicates predicates(init_control);
+  const PredicateBlock* loop_limit_check_predicate_block = predicates.loop_limit_check_predicate_block();
+
+  if (stride_overflow_state == Overflow) {
+    return false; // Bailout: integer overflow is certain.
   }
 
-  // Accounting for (LE3) and (LE4) where we use pre-incremented phis in the loop exit check.
-  const jlong limit_correction_for_pre_iv_exit_check = (phi_incr != nullptr) ? stride_con : 0;
-
-  // Accounting for (LE2) and (LE4) where we use <= or >= in the loop exit check.
-  const bool includes_limit = (bt == BoolTest::le || bt == BoolTest::ge);
-  const jlong limit_correction_for_le_ge_exit_check = (includes_limit ? (stride_con > 0 ? 1 : -1) : 0);
-
-  const jlong limit_correction = limit_correction_for_pre_iv_exit_check + limit_correction_for_le_ge_exit_check;
-  const jlong canonicalized_correction = stride_con + (stride_con > 0 ? -1 : 1);
-  const jlong final_correction = canonicalized_correction + limit_correction;
-
-  int sov = check_stride_overflow(final_correction, limit_t, iv_bt);
-  Node* init_control = x->in(LoopNode::EntryControl);
-
-  // If sov==0, limit's type always satisfies the condition, for
+  // If stride_overflow_state == NO_OVERFLOW, limit's type always satisfies the condition, for
   // example, when it is an array length.
-  if (sov != 0) {
-    if (sov < 0) {
-      return false;  // Bailout: integer overflow is certain.
-    }
+
+  _should_insert_stride_overflow_limit_check = false;
+  if (stride_overflow_state == RequireLimitCheck) {
     // (1) Loop Limit Check Predicate is required because we could not statically prove that
     //     limit + final_correction = adjusted_limit - 1 + stride <= max_int
-    assert(!x->as_Loop()->is_loop_nest_inner_loop(), "loop was transformed");
-    const Predicates predicates(init_control);
-    const PredicateBlock* loop_limit_check_predicate_block = predicates.loop_limit_check_predicate_block();
+    assert(!_head->as_Loop()->is_loop_nest_inner_loop(), "loop was transformed");
     if (!loop_limit_check_predicate_block->has_parse_predicate()) {
       // The Loop Limit Check Parse Predicate is not generated if this method trapped here before.
 #ifdef ASSERT
       if (TraceLoopLimitCheck) {
         tty->print("Missing Loop Limit Check Parse Predicate:");
-        loop->dump_head();
-        x->dump(1);
+        _loop->dump_head();
+        _head->dump(1);
       }
 #endif
       return false;
     }
 
     ParsePredicateNode* loop_limit_check_parse_predicate = loop_limit_check_predicate_block->parse_predicate();
-    if (!is_dominator(get_ctrl(limit), loop_limit_check_parse_predicate->in(0))) {
+    if (!_phase->is_dominator(_phase->get_ctrl(_structure.limit()), loop_limit_check_parse_predicate->in(0))) {
       return false;
     }
 
-    Node* cmp_limit;
-    Node* bol;
-
-    if (stride_con > 0) {
-      cmp_limit = CmpNode::make(limit, _igvn.integercon(max_signed_integer(iv_bt) - final_correction, iv_bt), iv_bt);
-      bol = new BoolNode(cmp_limit, BoolTest::le);
-    } else {
-      cmp_limit = CmpNode::make(limit, _igvn.integercon(min_signed_integer(iv_bt) - final_correction, iv_bt), iv_bt);
-      bol = new BoolNode(cmp_limit, BoolTest::ge);
-    }
-
-    insert_loop_limit_check_predicate(init_control->as_IfTrue(), cmp_limit, bol);
+    _should_insert_stride_overflow_limit_check = true;
   }
 
   // (2.3)
   const bool init_plus_stride_could_overflow =
-          (stride_con > 0 && init_t->hi_as_long() > max_signed_integer(iv_bt) - stride_con) ||
-          (stride_con < 0 && init_t->lo_as_long() < min_signed_integer(iv_bt) - stride_con);
-  // (2.1)
-  const bool init_gte_limit = (stride_con > 0 && init_t->hi_as_long() >= limit_t->lo_as_long()) ||
-                              (stride_con < 0 && init_t->lo_as_long() <= limit_t->hi_as_long());
+      (stride_con > 0 && init_t->hi_as_long() > max_signed_integer(_iv_bt) - stride_con) ||
+      (stride_con < 0 && init_t->lo_as_long() < min_signed_integer(_iv_bt) - stride_con);
 
+  // (2.1)
+  const bool init_gte_limit =
+      (stride_con > 0 && init_t->hi_as_long() >= limit_t->lo_as_long()) ||
+      (stride_con < 0 && init_t->lo_as_long() <= limit_t->hi_as_long());
+
+  _should_insert_init_trip_limit_check = false;
   if (init_gte_limit && // (2.1)
-     ((bt == BoolTest::ne || init_plus_stride_could_overflow) && // (2.3)
-      !has_dominating_loop_limit_check(init_trip, limit, stride_con, iv_bt, init_control))) { // (2.2)
+      ((_structure.exit_test().mask() == BoolTest::ne || init_plus_stride_could_overflow) && // (2.3)
+          !has_dominating_loop_limit_check(init_trip,
+                                           _structure.limit(),
+                                           stride_con,
+                                           _iv_bt,
+                                           init_control))) { // (2.2)
     // (2) Iteration Loop Limit Check Predicate is required because neither (2.1), (2.2), nor (2.3) holds.
     // We use the following condition:
     // - stride > 0: init < limit
@@ -2340,15 +2379,13 @@ bool PhaseIdealLoop::is_counted_loop(Node* x, IdealLoopTree*& loop, BasicType iv
     // a requirement). We transform the loop exit check by using a less-than-operator. By doing so, we must always
     // check that init < limit. Otherwise, we could have a different number of iterations at runtime.
 
-    const Predicates predicates(init_control);
-    const PredicateBlock* loop_limit_check_predicate_block = predicates.loop_limit_check_predicate_block();
     if (!loop_limit_check_predicate_block->has_parse_predicate()) {
       // The Loop Limit Check Parse Predicate is not generated if this method trapped here before.
 #ifdef ASSERT
       if (TraceLoopLimitCheck) {
         tty->print("Missing Loop Limit Check Parse Predicate:");
-        loop->dump_head();
-        x->dump(1);
+        _loop->dump_head();
+        _head->dump(1);
       }
 #endif
       return false;
@@ -2356,81 +2393,188 @@ bool PhaseIdealLoop::is_counted_loop(Node* x, IdealLoopTree*& loop, BasicType iv
 
     ParsePredicateNode* loop_limit_check_parse_predicate = loop_limit_check_predicate_block->parse_predicate();
     Node* parse_predicate_entry = loop_limit_check_parse_predicate->in(0);
-    if (!is_dominator(get_ctrl(limit), parse_predicate_entry) ||
-        !is_dominator(get_ctrl(init_trip), parse_predicate_entry)) {
+    if (!_phase->is_dominator(_phase->get_ctrl(_structure.limit()), parse_predicate_entry) ||
+        !_phase->is_dominator(_phase->get_ctrl(init_trip), parse_predicate_entry)) {
       return false;
     }
 
-    Node* cmp_limit;
-    Node* bol;
-
-    if (stride_con > 0) {
-      cmp_limit = CmpNode::make(init_trip, limit, iv_bt);
-      bol = new BoolNode(cmp_limit, BoolTest::lt);
-    } else {
-      cmp_limit = CmpNode::make(init_trip, limit, iv_bt);
-      bol = new BoolNode(cmp_limit, BoolTest::gt);
-    }
-
-    insert_loop_limit_check_predicate(init_control->as_IfTrue(), cmp_limit, bol);
+    _should_insert_init_trip_limit_check = true;
   }
 
-  if (bt == BoolTest::ne) {
-    // Now we need to canonicalize the loop condition if it is 'ne'.
-    assert(stride_con == 1 || stride_con == -1, "simple increment only - checked before");
-    if (stride_con > 0) {
-      // 'ne' can be replaced with 'lt' only when init < limit. This is ensured by the inserted predicate above.
-      bt = BoolTest::lt;
-    } else {
-      assert(stride_con < 0, "must be");
-      // 'ne' can be replaced with 'gt' only when init > limit. This is ensured by the inserted predicate above.
-      bt = BoolTest::gt;
-    }
+  _structure.exit_test().canonicalize_mask(stride_con);
+
+  if (is_safepoint_invalid(_structure.sfpt())) {
+    return false;
   }
 
-  Node* sfpt = nullptr;
-  if (loop->_child == nullptr) {
-    sfpt = find_safepoint(back_control, x, loop);
+#ifdef ASSERT
+  _checked_for_counted_loop = true;
+#endif
+
+  return true;
+}
+
+bool CountedLoopConverter::is_iv_overflowing(const TypeInteger* init_t, jlong stride_con, Node* phi_increment,
+                                             BoolTest::mask mask) const {
+  if (stride_con > 0) {
+    if (init_t->lo_as_long() > max_signed_integer(_iv_bt) - stride_con) {
+      return true; // cyclic loop
+    }
   } else {
-    sfpt = iff->in(0);
-    if (sfpt->Opcode() != Op_SafePoint) {
-      sfpt = nullptr;
+    if (init_t->hi_as_long() < min_signed_integer(_iv_bt) - stride_con) {
+      return true; // cyclic loop
     }
   }
 
-  if (x->in(LoopNode::LoopBackControl)->Opcode() == Op_SafePoint) {
-    Node* backedge_sfpt = x->in(LoopNode::LoopBackControl);
-    if (((iv_bt == T_INT && LoopStripMiningIter != 0) ||
-         iv_bt == T_LONG) &&
+  if (phi_increment != nullptr && mask != BoolTest::ne) {
+    // check if there is a possibility of IV overflowing after the first increment
+    if (stride_con > 0) {
+      if (init_t->hi_as_long() > max_signed_integer(_iv_bt) - stride_con) {
+        return true;
+      }
+    } else {
+      if (init_t->lo_as_long() < min_signed_integer(_iv_bt) - stride_con) {
+        return true;
+      }
+    }
+  }
+
+  return false;
+}
+
+bool CountedLoopConverter::LoopStructure::is_infinite_loop() const {
+  PhaseIterGVN& igvn = _phase->igvn();
+  const TypeInteger* limit_t = igvn.type(limit())->is_integer(_iv_bt);
+
+  if (_truncated_increment.outer_trunc() != nullptr) {
+    // When there is a truncation, we must be sure that after the truncation
+    // the trip counter will end up higher than the limit, otherwise we are looking
+    // at an endless loop. Can happen with range checks.
+
+    // Example:
+    // int i = 0;
+    // while (true) {
+    //   sum + = array[i];
+    //   i++;
+    //   i = i && 0x7fff;
+    // }
+    //
+    // If the array is shorter than 0x8000 this exits through an AIOOB
+    //  - Counted loop transformation is ok
+    // If the array is longer then this is an endless loop
+    //  - No transformation can be done.
+
+    const TypeInteger* incr_t = igvn.type(_iv_incr.incr())->is_integer(_iv_bt);
+    if (limit_t->hi_as_long() > incr_t->hi_as_long()) {
+      // if the limit can have a higher value than the increment (before the phi)
+      return true;
+    }
+  }
+
+  return false;
+}
+
+bool CountedLoopConverter::has_truncation_wrap(const TruncatedIncrement& truncation, Node* phi, jlong stride_con) {
+  // If iv trunc type is smaller than int (i.e., short/char/byte), check for possible wrap.
+  if (!TypeInteger::bottom(_iv_bt)->higher_equal(truncation.trunc_type())) {
+    assert(truncation.outer_trunc() != nullptr, "must have found some truncation");
+
+    // Get a better type for the phi (filtered thru if's)
+    const TypeInteger* phi_ft = filtered_type(phi);
+
+    // Can iv take on a value that will wrap?
+    //
+    // Ensure iv's limit is not within "stride" of the wrap value.
+    //
+    // Example for "short" type
+    //    Truncation ensures value is in the range -32768..32767 (iv_trunc_t)
+    //    If the stride is +10, then the last value of the induction
+    //    variable before the increment (phi_ft->_hi) must be
+    //    <= 32767 - 10 and (phi_ft->_lo) must be >= -32768 to
+    //    ensure no truncation occurs after the increment.
+
+    if (stride_con > 0) {
+      if (truncation.trunc_type()->hi_as_long() - phi_ft->hi_as_long() < stride_con ||
+          truncation.trunc_type()->lo_as_long() > phi_ft->lo_as_long()) {
+        return true;  // truncation may occur
+      }
+    } else if (stride_con < 0) {
+      if (truncation.trunc_type()->lo_as_long() - phi_ft->lo_as_long() > stride_con ||
+          truncation.trunc_type()->hi_as_long() < phi_ft->hi_as_long()) {
+        return true;  // truncation may occur
+      }
+    }
+
+    // No possibility of wrap so truncation can be discarded
+    // Promote iv type to Int
+  } else {
+    assert(Type::equals(truncation.trunc_type(), TypeInt::INT) || Type::equals(truncation.trunc_type(), TypeLong::LONG),
+           "unexpected truncation type");
+    assert(truncation.outer_trunc() == nullptr && truncation.inner_trunc() == nullptr, "no truncation for int");
+  }
+
+  return false;
+}
+
+SafePointNode* CountedLoopConverter::find_safepoint(Node* iftrue) {
+  Node* iff = iftrue->in(0);
+
+  if (_loop->_child == nullptr) {
+    return _phase->find_safepoint(iftrue, _head, _loop);
+  }
+
+  Node* sfpt = iff->in(0);
+  if (sfpt->Opcode() == Op_SafePoint) {
+    return sfpt->as_SafePoint();
+  }
+  return nullptr;
+}
+
+bool CountedLoopConverter::is_safepoint_invalid(SafePointNode* sfpt) const {
+  if (_head->in(LoopNode::LoopBackControl)->Opcode() == Op_SafePoint) {
+    if (((_iv_bt == T_INT && LoopStripMiningIter != 0) ||
+        _iv_bt == T_LONG) &&
         sfpt == nullptr) {
       // Leaving the safepoint on the backedge and creating a
       // CountedLoop will confuse optimizations. We can't move the
       // safepoint around because its jvm state wouldn't match a new
       // location. Give up on that loop.
-      return false;
-    }
-    if (is_deleteable_safept(backedge_sfpt)) {
-      replace_node_and_forward_ctrl(backedge_sfpt, iftrue);
-      if (loop->_safepts != nullptr) {
-        loop->_safepts->yank(backedge_sfpt);
-      }
-      loop->_tail = iftrue;
+      return true;
     }
   }
 
+  return false;
+}
 
+IdealLoopTree* CountedLoopConverter::convert() {
 #ifdef ASSERT
-  if (iv_bt == T_INT &&
-      !x->as_Loop()->is_loop_nest_inner_loop() &&
-      StressLongCountedLoop > 0 &&
-      trunc1 == nullptr &&
-      convert_to_long_loop(cmp, phi, loop)) {
-    return false;
-  }
+  assert(_checked_for_counted_loop, "must check for counted loop before conversion");
 #endif
 
-  Node* adjusted_limit = limit;
-  if (phi_incr != nullptr) {
+  PhaseIterGVN* igvn = &_phase->igvn();
+
+  if (_should_insert_stride_overflow_limit_check) {
+    insert_stride_overflow_limit_check();
+  }
+
+  if (_should_insert_init_trip_limit_check) {
+    insert_init_trip_limit_check();
+  }
+
+  Node* back_control = _phase->loop_exit_control(_loop);
+  if (_head->in(LoopNode::LoopBackControl)->Opcode() == Op_SafePoint) {
+    Node* backedge_sfpt = _head->in(LoopNode::LoopBackControl);
+    if (_phase->is_deleteable_safept(backedge_sfpt)) {
+      _phase->replace_node_and_forward_ctrl(backedge_sfpt, back_control);
+      if (_loop->_safepts != nullptr) {
+        _loop->_safepts->yank(backedge_sfpt);
+      }
+      _loop->_tail = back_control;
+    }
+  }
+
+  Node* adjusted_limit = _structure.limit();
+  if (_structure.iv_incr().phi_incr() != nullptr) {
     // If compare points directly to the phi we need to adjust
     // the compare so that it points to the incr. Limit have
     // to be adjusted to keep trip count the same and we
@@ -2440,128 +2584,147 @@ bool PhaseIdealLoop::is_counted_loop(Node* x, IdealLoopTree*& loop, BasicType iv
     // is converted to
     //   i = init; do {} while(++i < limit+1);
     //
-    adjusted_limit = gvn->transform(AddNode::make(limit, stride, iv_bt));
+    adjusted_limit = igvn->transform(AddNode::make(_structure.limit(), _structure.stride().stride_node(), _iv_bt));
   }
 
-  if (includes_limit) {
+  BoolTest::mask mask = _structure.exit_test().mask();
+  if (_structure.exit_test().should_include_limit()) {
     // The limit check guaranties that 'limit <= (max_jint - stride)' so
     // we can convert 'i <= limit' to 'i < limit+1' since stride != 0.
-    //
-    Node* one = (stride_con > 0) ? gvn->integercon( 1, iv_bt) : gvn->integercon(-1, iv_bt);
-    adjusted_limit = gvn->transform(AddNode::make(adjusted_limit, one, iv_bt));
-    if (bt == BoolTest::le)
-      bt = BoolTest::lt;
-    else if (bt == BoolTest::ge)
-      bt = BoolTest::gt;
-    else
+    Node* one = (_structure.stride_con() > 0) ? igvn->integercon(1, _iv_bt) : igvn->integercon(-1, _iv_bt);
+    adjusted_limit = igvn->transform(AddNode::make(adjusted_limit, one, _iv_bt));
+    if (mask == BoolTest::le) {
+      mask = BoolTest::lt;
+    } else if (mask == BoolTest::ge) {
+      mask = BoolTest::gt;
+    } else {
       ShouldNotReachHere();
+    }
   }
-  set_subtree_ctrl(adjusted_limit, false);
+  _phase->set_subtree_ctrl(adjusted_limit, false);
 
   // Build a canonical trip test.
   // Clone code, as old values may be in use.
-  incr = incr->clone();
-  incr->set_req(1,phi);
-  incr->set_req(2,stride);
-  incr = _igvn.register_new_node_with_optimizer(incr);
-  set_early_ctrl(incr, false);
-  _igvn.rehash_node_delayed(phi);
-  phi->set_req_X( LoopNode::LoopBackControl, incr, &_igvn );
+  Node* incr = _structure.truncated_increment().incr()->clone();
+  incr->set_req(1, _structure.phi());
+  incr->set_req(2, _structure.stride().stride_node());
+  incr = igvn->register_new_node_with_optimizer(incr);
+  _phase->set_early_ctrl(incr, false);
+  igvn->rehash_node_delayed(_structure.phi());
+  _structure.phi()->set_req_X(LoopNode::LoopBackControl, incr, igvn);
 
   // If phi type is more restrictive than Int, raise to
   // Int to prevent (almost) infinite recursion in igvn
   // which can only handle integer types for constants or minint..maxint.
-  if (!TypeInteger::bottom(iv_bt)->higher_equal(phi->bottom_type())) {
-    Node* nphi = PhiNode::make(phi->in(0), phi->in(LoopNode::EntryControl), TypeInteger::bottom(iv_bt));
+  Node* phi = _structure.phi();
+  if (!TypeInteger::bottom(_iv_bt)->higher_equal(phi->bottom_type())) {
+    Node* nphi =
+        PhiNode::make(phi->in(0), phi->in(LoopNode::EntryControl), TypeInteger::bottom(_iv_bt));
     nphi->set_req(LoopNode::LoopBackControl, phi->in(LoopNode::LoopBackControl));
-    nphi = _igvn.register_new_node_with_optimizer(nphi);
-    set_ctrl(nphi, get_ctrl(phi));
-    _igvn.replace_node(phi, nphi);
+    nphi = igvn->register_new_node_with_optimizer(nphi);
+    _phase->set_ctrl(nphi, _phase->get_ctrl(phi));
+    igvn->replace_node(phi, nphi);
     phi = nphi->as_Phi();
   }
-  cmp = cmp->clone();
-  cmp->set_req(1,incr);
-  cmp->set_req(2, adjusted_limit);
-  cmp = _igvn.register_new_node_with_optimizer(cmp);
-  set_ctrl(cmp, iff->in(0));
 
-  test = test->clone()->as_Bool();
-  (*(BoolTest*)&test->_test)._test = bt;
-  test->set_req(1,cmp);
-  _igvn.register_new_node_with_optimizer(test);
-  set_ctrl(test, iff->in(0));
+  Node* iftrue = back_control;
+  const uint iftrue_op = iftrue->Opcode();
+  Node* iff = iftrue->in(0);
+
+  // Replace the old CmpNode with new adjusted_limit
+  Node* new_cmp = _structure.exit_test().cmp()->clone();
+  new_cmp->set_req(1, incr);
+  new_cmp->set_req(2, adjusted_limit);
+  new_cmp = igvn->register_new_node_with_optimizer(new_cmp);
+  _phase->set_ctrl(new_cmp, iff->in(0));
+
+  // Replace the old BoolNode with new CmpNode
+  BoolNode* new_test = iff->in(1)->clone()->as_Bool();
+  const_cast<BoolTest*>(&new_test->_test)->_test = mask; // Yes, it's a const, but it's a newly cloned node so we should be fine.
+  new_test->set_req(1, new_cmp);
+  igvn->register_new_node_with_optimizer(new_test);
+  _phase->set_ctrl(new_test, iff->in(0));
 
   // Replace the old IfNode with a new LoopEndNode
-  Node *lex = _igvn.register_new_node_with_optimizer(BaseCountedLoopEndNode::make(iff->in(0), test, cl_prob, iff->as_If()->_fcnt, iv_bt));
-  IfNode *le = lex->as_If();
-  uint dd = dom_depth(iff);
-  set_idom(le, le->in(0), dd); // Update dominance for loop exit
-  set_loop(le, loop);
+  Node* loop_end = igvn->register_new_node_with_optimizer(BaseCountedLoopEndNode::make(iff->in(0),
+                                                                                  new_test,
+                                                                                  _structure.exit_test().cl_prob(),
+                                                                                  iff->as_If()->_fcnt,
+                                                                                  _iv_bt));
+  IfNode* loop_end_exit = loop_end->as_If();
+  const uint dd = _phase->dom_depth(iff);
+  _phase->set_idom(loop_end_exit, loop_end_exit->in(0), dd); // Update dominance for loop exit
+  _phase->set_loop(loop_end_exit, _loop);
 
   // Get the loop-exit control
-  Node *iffalse = iff->as_If()->proj_out(!(iftrue_op == Op_IfTrue));
+  Node* iffalse = iff->as_If()->proj_out(!(iftrue_op == Op_IfTrue));
 
   // Need to swap loop-exit and loop-back control?
   if (iftrue_op == Op_IfFalse) {
-    Node *ift2=_igvn.register_new_node_with_optimizer(new IfTrueNode (le));
-    Node *iff2=_igvn.register_new_node_with_optimizer(new IfFalseNode(le));
+    Node* ift2 = igvn->register_new_node_with_optimizer(new IfTrueNode(loop_end_exit));
+    Node* iff2 = igvn->register_new_node_with_optimizer(new IfFalseNode(loop_end_exit));
 
-    loop->_tail = back_control = ift2;
-    set_loop(ift2, loop);
-    set_loop(iff2, get_loop(iffalse));
+    _loop->_tail = back_control = ift2;
+    _phase->set_loop(ift2, _loop);
+    _phase->set_loop(iff2, _phase->get_loop(iffalse));
 
     // Lazy update of 'get_ctrl' mechanism.
-    replace_node_and_forward_ctrl(iffalse, iff2);
-    replace_node_and_forward_ctrl(iftrue,  ift2);
+    _phase->replace_node_and_forward_ctrl(iffalse, iff2);
+    _phase->replace_node_and_forward_ctrl(iftrue,  ift2);
 
     // Swap names
     iffalse = iff2;
-    iftrue  = ift2;
+    iftrue = ift2;
   } else {
-    _igvn.rehash_node_delayed(iffalse);
-    _igvn.rehash_node_delayed(iftrue);
-    iffalse->set_req_X( 0, le, &_igvn );
-    iftrue ->set_req_X( 0, le, &_igvn );
+    igvn->rehash_node_delayed(iffalse);
+    igvn->rehash_node_delayed(iftrue);
+    iffalse->set_req_X(0, loop_end_exit, igvn);
+    iftrue->set_req_X(0, loop_end_exit, igvn);
   }
 
-  set_idom(iftrue,  le, dd+1);
-  set_idom(iffalse, le, dd+1);
+  _phase->set_idom(iftrue, loop_end_exit, dd + 1);
+  _phase->set_idom(iffalse, loop_end_exit, dd + 1);
   assert(iff->outcnt() == 0, "should be dead now");
-  replace_node_and_forward_ctrl(iff, le); // fix 'get_ctrl'
+  _phase->replace_node_and_forward_ctrl(iff, loop_end_exit); // fix 'get_ctrl'
 
+  Node* init_control = _head->in(LoopNode::EntryControl);
   Node* entry_control = init_control;
-  bool strip_mine_loop = iv_bt == T_INT &&
-                         loop->_child == nullptr &&
-                         sfpt != nullptr &&
-                         !loop->_has_call &&
-                         is_deleteable_safept(sfpt);
+  bool strip_mine_loop = _iv_bt == T_INT &&
+                         _loop->_child == nullptr &&
+                         _structure.sfpt() != nullptr &&
+                         !_loop->_has_call &&
+                         _phase->is_deleteable_safept(_structure.sfpt());
   IdealLoopTree* outer_ilt = nullptr;
   if (strip_mine_loop) {
-    outer_ilt = create_outer_strip_mined_loop(init_control, loop, cl_prob, le->_fcnt,
-                                              entry_control, iffalse);
+    outer_ilt = _phase->create_outer_strip_mined_loop(init_control,
+                                                      _loop,
+                                                      _structure.exit_test().cl_prob(),
+                                                      loop_end_exit->_fcnt,
+                                                      entry_control,
+                                                      iffalse);
   }
 
   // Now setup a new CountedLoopNode to replace the existing LoopNode
-  BaseCountedLoopNode *l = BaseCountedLoopNode::make(entry_control, back_control, iv_bt);
-  l->set_unswitch_count(x->as_Loop()->unswitch_count()); // Preserve
+  BaseCountedLoopNode* l = BaseCountedLoopNode::make(entry_control, back_control, _iv_bt);
+  l->set_unswitch_count(_head->as_Loop()->unswitch_count()); // Preserve
   // The following assert is approximately true, and defines the intention
   // of can_be_counted_loop.  It fails, however, because phase->type
   // is not yet initialized for this loop and its parts.
   //assert(l->can_be_counted_loop(this), "sanity");
-  _igvn.register_new_node_with_optimizer(l);
-  set_loop(l, loop);
-  loop->_head = l;
+  igvn->register_new_node_with_optimizer(l);
+  _phase->set_loop(l, _loop);
+  _loop->_head = l;
   // Fix all data nodes placed at the old loop head.
   // Uses the lazy-update mechanism of 'get_ctrl'.
-  replace_node_and_forward_ctrl(x, l);
-  set_idom(l, entry_control, dom_depth(entry_control) + 1);
+  _phase->replace_node_and_forward_ctrl(_head, l);
+  _phase->set_idom(l, entry_control, _phase->dom_depth(entry_control) + 1);
 
-  if (iv_bt == T_INT && (LoopStripMiningIter == 0 || strip_mine_loop)) {
+  if (_iv_bt == T_INT && (LoopStripMiningIter == 0 || strip_mine_loop)) {
     // Check for immediately preceding SafePoint and remove
-    if (sfpt != nullptr && (strip_mine_loop || is_deleteable_safept(sfpt))) {
+    if (_structure.sfpt() != nullptr && (strip_mine_loop || _phase->is_deleteable_safept(_structure.sfpt()))) {
       if (strip_mine_loop) {
         Node* outer_le = outer_ilt->_tail->in(0);
-        Node* sfpt_clone = sfpt->clone();
+        Node* sfpt_clone = _structure.sfpt()->clone();
         sfpt_clone->set_req(0, iffalse);
         outer_le->set_req(0, sfpt_clone);
 
@@ -2570,40 +2733,42 @@ bool PhaseIdealLoop::is_counted_loop(Node* x, IdealLoopTree*& loop, BasicType iv
           // Polling load should be pinned outside inner loop.
           Node* new_polladdr = polladdr->clone();
           new_polladdr->set_req(0, iffalse);
-          _igvn.register_new_node_with_optimizer(new_polladdr, polladdr);
-          set_ctrl(new_polladdr, iffalse);
+          igvn->register_new_node_with_optimizer(new_polladdr, polladdr);
+          _phase->set_ctrl(new_polladdr, iffalse);
           sfpt_clone->set_req(TypeFunc::Parms, new_polladdr);
         }
         // When this code runs, loop bodies have not yet been populated.
         const bool body_populated = false;
-        register_control(sfpt_clone, outer_ilt, iffalse, body_populated);
-        set_idom(outer_le, sfpt_clone, dom_depth(sfpt_clone));
+        _phase->register_control(sfpt_clone, outer_ilt, iffalse, body_populated);
+        _phase->set_idom(outer_le, sfpt_clone, _phase->dom_depth(sfpt_clone));
       }
-      replace_node_and_forward_ctrl(sfpt, sfpt->in(TypeFunc::Control));
-      if (loop->_safepts != nullptr) {
-        loop->_safepts->yank(sfpt);
+      _phase->replace_node_and_forward_ctrl(_structure.sfpt(), _structure.sfpt()->in(TypeFunc::Control));
+      if (_loop->_safepts != nullptr) {
+        _loop->_safepts->yank(_structure.sfpt());
       }
     }
   }
 
 #ifdef ASSERT
-  assert(l->is_valid_counted_loop(iv_bt), "counted loop shape is messed up");
-  assert(l == loop->_head && l->phi() == phi && l->loopexit_or_null() == lex, "" );
+  assert(l->is_valid_counted_loop(_iv_bt), "counted loop shape is messed up");
+  assert(l == _loop->_head && l->phi() == phi && l->loopexit_or_null() == loop_end, "" );
 #endif
+
 #ifndef PRODUCT
   if (TraceLoopOpts) {
     tty->print("Counted      ");
-    loop->dump_head();
+    _loop->dump_head();
   }
 #endif
 
-  C->print_method(PHASE_AFTER_CLOOPS, 3, l);
-
   // Capture bounds of the loop in the induction variable Phi before
   // subsequent transformation (iteration splitting) obscures the
   // bounds
-  l->phi()->as_Phi()->set_type(l->phi()->Value(&_igvn));
+  l->phi()->as_Phi()->set_type(l->phi()->Value(igvn));
 
+  _phase->C->print_method(PHASE_AFTER_CLOOPS, 3, l);
+
+  IdealLoopTree* loop = _loop;
   if (strip_mine_loop) {
     l->mark_strip_mined();
     l->verify_strip_mined(1);
@@ -2612,21 +2777,24 @@ bool PhaseIdealLoop::is_counted_loop(Node* x, IdealLoopTree*& loop, BasicType iv
   }
 
 #ifndef PRODUCT
-  if (x->as_Loop()->is_loop_nest_inner_loop() && iv_bt == T_LONG) {
+  if (_head->as_Loop()->is_loop_nest_inner_loop() && _iv_bt == T_LONG) {
     AtomicAccess::inc(&_long_loop_counted_loops);
   }
 #endif
-  if (iv_bt == T_LONG && x->as_Loop()->is_loop_nest_outer_loop()) {
+
+  if (_iv_bt == T_LONG && _head->as_Loop()->is_loop_nest_outer_loop()) {
     l->mark_loop_nest_outer_loop();
   }
 
-  return true;
+  return loop;
 }
 
 // Check if there is a dominating loop limit check of the form 'init < limit' starting at the loop entry.
 // If there is one, then we do not need to create an additional Loop Limit Check Predicate.
-bool PhaseIdealLoop::has_dominating_loop_limit_check(Node* init_trip, Node* limit, const jlong stride_con,
-                                                     const BasicType iv_bt, Node* loop_entry) {
+bool CountedLoopConverter::has_dominating_loop_limit_check(Node* init_trip, Node* limit, const jlong stride_con,
+                                                           const BasicType iv_bt, Node* loop_entry) const {
+  PhaseIterGVN& _igvn = _phase->igvn();
+
   // Eagerly call transform() on the Cmp and Bool node to common them up if possible. This is required in order to
   // successfully find a dominated test with the If node below.
   Node* cmp_limit;
@@ -2649,8 +2817,8 @@ bool PhaseIdealLoop::has_dominating_loop_limit_check(Node* init_trip, Node* limi
   const bool found_dominating_test = dominated_iff != nullptr && dominated_iff->is_ConI();
 
   // Kill the If with its projections again in the next IGVN round by cutting it off from the graph.
-  _igvn.replace_input_of(iff, 0, C->top());
-  _igvn.replace_input_of(iff, 1, C->top());
+  _igvn.replace_input_of(iff, 0, _phase->C->top());
+  _igvn.replace_input_of(iff, 1, _phase->C->top());
   return found_dominating_test;
 }
 
@@ -2953,24 +3121,23 @@ Node* LoopLimitNode::Identity(PhaseGVN* phase) {
   return this;
 }
 
-//=============================================================================
-//----------------------match_incr_with_optional_truncation--------------------
 // Match increment with optional truncation:
 // CHAR: (i+1)&0x7fff, BYTE: ((i+1)<<8)>>8, or SHORT: ((i+1)<<16)>>16
-// Return null for failure. Success returns the increment node.
-Node* CountedLoopNode::match_incr_with_optional_truncation(Node* expr, Node** trunc1, Node** trunc2,
-                                                           const TypeInteger** trunc_type,
-                                                           BasicType bt) {
-  // Quick cutouts:
-  if (expr == nullptr || expr->req() != 3)  return nullptr;
+void CountedLoopConverter::TruncatedIncrement::build(Node* expr) {
+  _is_valid = false;
 
-  Node *t1 = nullptr;
-  Node *t2 = nullptr;
+  // Quick cutouts:
+  if (expr == nullptr || expr->req() != 3) {
+    return;
+  }
+
+  Node* t1 = nullptr;
+  Node* t2 = nullptr;
   Node* n1 = expr;
   int   n1op = n1->Opcode();
-  const TypeInteger* trunc_t = TypeInteger::bottom(bt);
+  const TypeInteger* trunc_t = TypeInteger::bottom(_bt);
 
-  if (bt == T_INT) {
+  if (_bt == T_INT) {
     // Try to strip (n1 & M) or (n1 << N >> N) from n1.
     if (n1op == Op_AndI &&
         n1->in(2)->is_Con() &&
@@ -3002,15 +3169,14 @@ Node* CountedLoopNode::match_incr_with_optional_truncation(Node* expr, Node** tr
   }
 
   // If (maybe after stripping) it is an AddI, we won:
-  if (n1op == Op_Add(bt)) {
-    *trunc1 = t1;
-    *trunc2 = t2;
-    *trunc_type = trunc_t;
-    return n1;
-  }
+  if (n1op == Op_Add(_bt)) {
+    _incr = n1;
+    _outer_trunc = t1;
+    _inner_trunc = t2;
+    _trunc_type = trunc_t;
 
-  // failed
-  return nullptr;
+    _is_valid = true;
+  }
 }
 
 IfNode* CountedLoopNode::find_multiversion_if_from_multiversion_fast_main_loop() {
@@ -3662,18 +3828,18 @@ Node *OuterStripMinedLoopEndNode::Ideal(PhaseGVN *phase, bool can_reshape) {
 //         i = ?
 //       } while ( i < 10)
 //
-const TypeInt* PhaseIdealLoop::filtered_type( Node *n, Node* n_ctrl) {
+const TypeInt* CountedLoopConverter::filtered_type(Node* n, Node* n_ctrl) {
   assert(n && n->bottom_type()->is_int(), "must be int");
   const TypeInt* filtered_t = nullptr;
   if (!n->is_Phi()) {
-    assert(n_ctrl != nullptr || n_ctrl == C->top(), "valid control");
+    assert(n_ctrl != nullptr || n_ctrl == _phase->C->top(), "valid control");
     filtered_t = filtered_type_from_dominators(n, n_ctrl);
 
   } else {
     Node* phi    = n->as_Phi();
     Node* region = phi->in(0);
     assert(n_ctrl == nullptr || n_ctrl == region, "ctrl parameter must be region");
-    if (region && region != C->top()) {
+    if (region && region != _phase->C->top()) {
       for (uint i = 1; i < phi->req(); i++) {
         Node* val   = phi->in(i);
         Node* use_c = region->in(i);
@@ -3688,7 +3854,7 @@ const TypeInt* PhaseIdealLoop::filtered_type( Node *n, Node* n_ctrl) {
       }
     }
   }
-  const TypeInt* n_t = _igvn.type(n)->is_int();
+  const TypeInt* n_t = _phase->igvn().type(n)->is_int();
   if (filtered_t != nullptr) {
     n_t = n_t->join(filtered_t)->is_int();
   }
@@ -3698,22 +3864,22 @@ const TypeInt* PhaseIdealLoop::filtered_type( Node *n, Node* n_ctrl) {
 
 //------------------------------filtered_type_from_dominators--------------------------------
 // Return a possibly more restrictive type for val based on condition control flow of dominators
-const TypeInt* PhaseIdealLoop::filtered_type_from_dominators( Node* val, Node *use_ctrl) {
+const TypeInt* CountedLoopConverter::filtered_type_from_dominators(Node* val, Node* use_ctrl) {
   if (val->is_Con()) {
      return val->bottom_type()->is_int();
   }
   uint if_limit = 10; // Max number of dominating if's visited
   const TypeInt* rtn_t = nullptr;
 
-  if (use_ctrl && use_ctrl != C->top()) {
-    Node* val_ctrl = get_ctrl(val);
-    uint val_dom_depth = dom_depth(val_ctrl);
+  if (use_ctrl && use_ctrl != _phase->C->top()) {
+    Node* val_ctrl = _phase->get_ctrl(val);
+    uint val_dom_depth = _phase->dom_depth(val_ctrl);
     Node* pred = use_ctrl;
     uint if_cnt = 0;
     while (if_cnt < if_limit) {
       if ((pred->Opcode() == Op_IfTrue || pred->Opcode() == Op_IfFalse)) {
         if_cnt++;
-        const TypeInt* if_t = IfNode::filtered_int_type(&_igvn, val, pred);
+        const TypeInt* if_t = IfNode::filtered_int_type(&_phase->igvn(), val, pred);
         if (if_t != nullptr) {
           if (rtn_t == nullptr) {
             rtn_t = if_t;
@@ -3722,12 +3888,12 @@ const TypeInt* PhaseIdealLoop::filtered_type_from_dominators( Node* val, Node *u
           }
         }
       }
-      pred = idom(pred);
-      if (pred == nullptr || pred == C->top()) {
+      pred = _phase->idom(pred);
+      if (pred == nullptr || pred == _phase->C->top()) {
         break;
       }
       // Stop if going beyond definition block of val
-      if (dom_depth(pred) < val_dom_depth) {
+      if (_phase->dom_depth(pred) < val_dom_depth) {
         break;
       }
     }
@@ -4335,7 +4501,7 @@ void IdealLoopTree::check_safepts(VectorSet &visited, Node_List &stack) {
 
 //---------------------------is_deleteable_safept----------------------------
 // Is safept not required by an outer loop?
-bool PhaseIdealLoop::is_deleteable_safept(Node* sfpt) {
+bool PhaseIdealLoop::is_deleteable_safept(Node* sfpt) const {
   assert(sfpt->Opcode() == Op_SafePoint, "");
   IdealLoopTree* lp = get_loop(sfpt)->_parent;
   while (lp != nullptr) {
@@ -4553,9 +4719,7 @@ void IdealLoopTree::counted_loop( PhaseIdealLoop *phase ) {
   }
 
   IdealLoopTree* loop = this;
-  if (_head->is_CountedLoop() ||
-      phase->is_counted_loop(_head, loop, T_INT)) {
-
+  if (_head->is_CountedLoop() || phase->try_convert_to_counted_loop(_head, loop, T_INT)) {
     if (LoopStripMiningIter == 0 || _head->as_CountedLoop()->is_strip_mined()) {
       // Indicate we do not need a safepoint here
       _has_sfpt = 1;
@@ -4567,8 +4731,7 @@ void IdealLoopTree::counted_loop( PhaseIdealLoop *phase ) {
 
     // Look for induction variables
     phase->replace_parallel_iv(this);
-  } else if (_head->is_LongCountedLoop() ||
-             phase->is_counted_loop(_head, loop, T_LONG)) {
+  } else if (_head->is_LongCountedLoop() || phase->try_convert_to_counted_loop(_head, loop, T_LONG)) {
     remove_safepoints(phase, true);
   } else {
     assert(!_head->is_Loop() || !_head->as_Loop()->is_loop_nest_inner_loop(), "transformation to counted loop should not fail");
@@ -5373,9 +5536,15 @@ int PhaseIdealLoop::_loop_invokes=0;// Count of PhaseIdealLoop invokes
 int PhaseIdealLoop::_loop_work=0; // Sum of PhaseIdealLoop x unique
 volatile int PhaseIdealLoop::_long_loop_candidates=0; // Number of long loops seen
 volatile int PhaseIdealLoop::_long_loop_nests=0; // Number of long loops successfully transformed to a nest
-volatile int PhaseIdealLoop::_long_loop_counted_loops=0; // Number of long loops successfully transformed to a counted loop
+// Number of long loops successfully transformed to a counted loop
+volatile int CountedLoopConverter::_long_loop_counted_loops = 0;
 void PhaseIdealLoop::print_statistics() {
-  tty->print_cr("PhaseIdealLoop=%d, sum _unique=%d, long loops=%d/%d/%d", _loop_invokes, _loop_work, _long_loop_counted_loops, _long_loop_nests, _long_loop_candidates);
+  tty->print_cr("PhaseIdealLoop=%d, sum _unique=%d, long loops=%d/%d/%d",
+                _loop_invokes,
+                _loop_work,
+                CountedLoopConverter::_long_loop_counted_loops,
+                _long_loop_nests,
+                _long_loop_candidates);
 }
 #endif
 
diff --git a/src/hotspot/share/opto/loopnode.hpp b/src/hotspot/share/opto/loopnode.hpp
index 986cfdaa3f1..6667c71511c 100644
--- a/src/hotspot/share/opto/loopnode.hpp
+++ b/src/hotspot/share/opto/loopnode.hpp
@@ -273,11 +273,6 @@ public:
   CountedLoopEndNode* loopexit() const { return (CountedLoopEndNode*) BaseCountedLoopNode::loopexit(); }
   int   stride_con() const;
 
-  // Match increment with optional truncation
-  static Node*
-  match_incr_with_optional_truncation(Node* expr, Node** trunc1, Node** trunc2, const TypeInteger** trunc_type,
-                                      BasicType bt);
-
   // A 'main' loop has a pre-loop and a post-loop.  The 'main' loop
   // can run short a few iterations and may start a few iterations in.
   // It will be RCE'd and unrolled and aligned.
@@ -1029,8 +1024,6 @@ private:
   void rewire_old_target_loop_entry_dependency_to_new_entry(CountedLoopNode* target_loop_head,
                                                             const Node* old_target_loop_entry,
                                                             uint node_index_before_new_assertion_predicate_nodes);
-  void insert_loop_limit_check_predicate(ParsePredicateSuccessProj* loop_limit_check_parse_proj, Node* cmp_limit,
-                                         Node* bol);
   void log_loop_tree();
 
 public:
@@ -1294,7 +1287,7 @@ public:
   void recompute_dom_depth();
 
   // Is safept not required by an outer loop?
-  bool is_deleteable_safept(Node* sfpt);
+  bool is_deleteable_safept(Node* sfpt) const;
 
   // Replace parallel induction variable (parallel to trip counter)
   void replace_parallel_iv(IdealLoopTree *loop);
@@ -1345,21 +1338,109 @@ public:
   // Per-Node transform
   virtual Node* transform(Node* n) { return nullptr; }
 
-  Node* loop_exit_control(Node* x, IdealLoopTree* loop);
-  Node* loop_exit_test(Node* back_control, IdealLoopTree* loop, Node*& incr, Node*& limit, BoolTest::mask& bt, float& cl_prob);
-  Node* loop_iv_incr(Node* incr, Node* x, IdealLoopTree* loop, Node*& phi_incr);
-  Node* loop_iv_stride(Node* incr, Node*& xphi);
-  PhiNode* loop_iv_phi(Node* xphi, Node* phi_incr, Node* x);
+  Node* loop_exit_control(const IdealLoopTree* loop) const;
 
-  bool is_counted_loop(Node* x, IdealLoopTree*&loop, BasicType iv_bt);
+  class LoopExitTest {
+    bool _is_valid;
+
+    const Node* _back_control;
+    const IdealLoopTree* _loop;
+    PhaseIdealLoop* _phase;
+
+    Node* _cmp;
+    Node* _incr;
+    Node* _limit;
+    BoolTest::mask _mask;
+    float _cl_prob;
+
+  public:
+    LoopExitTest(const Node* back_control, const IdealLoopTree* loop, PhaseIdealLoop* phase) :
+      _is_valid(false),
+      _back_control(back_control),
+      _loop(loop),
+      _phase(phase),
+      _cmp(nullptr),
+      _incr(nullptr),
+      _limit(nullptr),
+      _mask(BoolTest::illegal),
+      _cl_prob(0.0f) {}
+
+    void build();
+    void canonicalize_mask(jlong stride_con);
+
+    bool is_valid_with_bt(BasicType bt) const {
+      return _is_valid && _cmp != nullptr && _cmp->Opcode() == Op_Cmp(bt);
+    }
+
+    bool should_include_limit() const { return _mask == BoolTest::le || _mask == BoolTest::ge; }
+
+    CmpNode* cmp() const { return _cmp->as_Cmp(); }
+    Node* incr() const { return _incr; }
+    Node* limit() const { return _limit; }
+    BoolTest::mask mask() const { return _mask; }
+    float cl_prob() const { return _cl_prob; }
+  };
+
+  class LoopIVIncr {
+    bool _is_valid;
+
+    const Node* _head;
+    const IdealLoopTree* _loop;
+
+    Node* _incr;
+    Node* _phi_incr;
+
+  public:
+    LoopIVIncr(const Node* head, const IdealLoopTree* loop) :
+      _is_valid(false),
+      _head(head),
+      _loop(loop),
+      _incr(nullptr),
+      _phi_incr(nullptr) {}
+
+    void build(Node* old_incr);
+
+    bool is_valid() const { return _is_valid; }
+    bool is_valid_with_bt(const BasicType bt) const {
+      return _is_valid && _incr->Opcode() == Op_Add(bt);
+    }
+
+    Node* incr() const { return _incr; }
+    Node* phi_incr() const { return _phi_incr; }
+  };
+
+  class LoopIVStride {
+    bool _is_valid;
+
+    BasicType _iv_bt;
+    Node* _stride_node;
+    Node* _xphi;
+
+  public:
+    LoopIVStride(BasicType iv_bt) :
+      _is_valid(false),
+      _iv_bt(iv_bt),
+      _stride_node(nullptr),
+      _xphi(nullptr) {}
+
+    void build(const Node* incr);
+
+    bool is_valid() const { return _is_valid && _stride_node != nullptr; }
+    Node* stride_node() const { return _stride_node; }
+    Node* xphi() const { return _xphi; }
+
+    jlong compute_non_zero_stride_con(BoolTest::mask mask, BasicType iv_bt) const;
+  };
+
+  static PhiNode* loop_iv_phi(const Node* xphi, const Node* phi_incr, const Node* head);
+
+  bool try_convert_to_counted_loop(Node* head, IdealLoopTree*& loop, BasicType iv_bt);
 
   Node* loop_nest_replace_iv(Node* iv_to_replace, Node* inner_iv, Node* outer_phi, Node* inner_head, BasicType bt);
   bool create_loop_nest(IdealLoopTree* loop, Node_List &old_new);
-#ifdef ASSERT
-  bool convert_to_long_loop(Node* cmp, Node* phi, IdealLoopTree* loop);
-#endif
+
   void add_parse_predicate(Deoptimization::DeoptReason reason, Node* inner_head, IdealLoopTree* loop, SafePointNode* sfpt);
-  SafePointNode* find_safepoint(Node* back_control, Node* x, IdealLoopTree* loop);
+  SafePointNode* find_safepoint(Node* back_control, const Node* head, const IdealLoopTree* loop);
 
   void add_parse_predicates(IdealLoopTree* outer_ilt, LoopNode* inner_head, SafePointNode* cloned_sfpt);
 
@@ -1496,8 +1577,6 @@ public:
   Node* clone_nodes_with_same_ctrl(Node* start_node, ProjNode* old_uncommon_proj, Node* new_uncommon_proj);
   void fix_cloned_data_node_controls(const ProjNode* orig, Node* new_uncommon_proj,
                                      const OrigToNewHashtable& orig_to_clone);
-  bool has_dominating_loop_limit_check(Node* init_trip, Node* limit, jlong stride_con, BasicType iv_bt,
-                                       Node* loop_entry);
 
  public:
   void register_control(Node* n, IdealLoopTree *loop, Node* pred, bool update_body = true);
@@ -1755,12 +1834,6 @@ public:
                        Node*& shift, Node*& offset);
 
 private:
-  // Return a type based on condition control flow
-  const TypeInt* filtered_type( Node *n, Node* n_ctrl);
-  const TypeInt* filtered_type( Node *n ) { return filtered_type(n, nullptr); }
- // Helpers for filtered type
-  const TypeInt* filtered_type_from_dominators( Node* val, Node *val_ctrl);
-
   // Helper functions
   Node *spinup( Node *iff, Node *new_false, Node *new_true, Node *region, Node *phi, small_cache *cache );
   Node *find_use_block( Node *use, Node *def, Node *old_false, Node *new_false, Node *old_true, Node *new_true );
@@ -1889,7 +1962,6 @@ public:
   static int _loop_work;        // Sum of PhaseIdealLoop x _unique
   static volatile int _long_loop_candidates;
   static volatile int _long_loop_nests;
-  static volatile int _long_loop_counted_loops;
 #endif
 
 #ifdef ASSERT
@@ -1901,7 +1973,7 @@ public:
 
   void rpo(Node* start, Node_Stack &stk, VectorSet &visited, Node_List &rpo_list) const;
 
-  void check_counted_loop_shape(IdealLoopTree* loop, Node* x, BasicType bt) NOT_DEBUG_RETURN;
+  void check_counted_loop_shape(IdealLoopTree* loop, Node* head, BasicType bt) NOT_DEBUG_RETURN;
 
   LoopNode* create_inner_head(IdealLoopTree* loop, BaseCountedLoopNode* head, IfNode* exit_test);
 
@@ -1979,6 +2051,146 @@ public:
   ConNode* zerocon(BasicType bt);
 };
 
+class CountedLoopConverter {
+  friend class PhaseIdealLoop;
+
+  // Match increment with optional truncation
+  class TruncatedIncrement {
+    bool _is_valid;
+
+    BasicType _bt;
+
+    Node* _incr;
+    Node* _outer_trunc;
+    Node* _inner_trunc;
+    const TypeInteger* _trunc_type;
+
+  public:
+    TruncatedIncrement(BasicType bt) :
+      _is_valid(false),
+      _bt(bt),
+      _incr(nullptr),
+      _outer_trunc(nullptr),
+      _inner_trunc(nullptr),
+      _trunc_type(nullptr) {}
+
+    void build(Node* expr);
+
+    bool is_valid() const { return _is_valid; }
+    Node* incr() const { return _incr; }
+
+    // Optional truncation for: CHAR: (i+1)&0x7fff, BYTE: ((i+1)<<8)>>8, or SHORT: ((i+1)<<16)>>16
+    Node* outer_trunc() const { return _outer_trunc; } // the outermost truncating node (either the & or the final >>)
+    Node* inner_trunc() const { return _inner_trunc; } // the inner truncating node, if applicable (the << in a <</>> pair)
+    const TypeInteger* trunc_type() const { return _trunc_type; }
+  };
+
+  class LoopStructure {
+    bool _is_valid;
+
+    const Node* _head;
+    const IdealLoopTree* _loop;
+    PhaseIdealLoop* _phase;
+    BasicType _iv_bt;
+
+    Node* _back_control;
+    PhaseIdealLoop::LoopExitTest _exit_test;
+    PhaseIdealLoop::LoopIVIncr _iv_incr;
+    TruncatedIncrement _truncated_increment;
+    PhaseIdealLoop::LoopIVStride _stride;
+    PhiNode* _phi;
+    SafePointNode* _safepoint;
+
+  public:
+    LoopStructure(const Node* head, const IdealLoopTree* loop, PhaseIdealLoop* phase, const BasicType iv_bt) :
+      _is_valid(false),
+      _head(head),
+      _loop(loop),
+      _phase(phase),
+      _iv_bt(iv_bt),
+      _back_control(_phase->loop_exit_control(_loop)),
+      _exit_test(_back_control, _loop, _phase),
+      _iv_incr(_head, _loop),
+      _truncated_increment(_iv_bt),
+      _stride(PhaseIdealLoop::LoopIVStride(_iv_bt)),
+      _phi(nullptr),
+      _safepoint(nullptr) {}
+
+    void build();
+
+    jlong final_limit_correction() const; // compute adjusted loop limit correction
+    bool is_infinite_loop() const;
+
+    bool is_valid() const { return _is_valid; }
+
+    Node* back_control() const { return _back_control; }
+    PhaseIdealLoop::LoopExitTest& exit_test() { return _exit_test; }
+    PhaseIdealLoop::LoopIVIncr& iv_incr() { return _iv_incr; }
+    TruncatedIncrement& truncated_increment() { return _truncated_increment; }
+    PhaseIdealLoop::LoopIVStride& stride() { return _stride; }
+    PhiNode* phi() const { return _phi; }
+    SafePointNode* sfpt() const { return _safepoint; }
+    jlong stride_con() const { return _stride.compute_non_zero_stride_con(_exit_test.mask(), _iv_bt); }
+    Node* limit() const { return _exit_test.limit(); }
+  };
+
+  PhaseIdealLoop* const _phase;
+  Node* const _head;
+  IdealLoopTree* const _loop;
+  const BasicType _iv_bt;
+
+  LoopStructure _structure;
+  bool _should_insert_stride_overflow_limit_check = false;
+  bool _should_insert_init_trip_limit_check = false;
+
+  DEBUG_ONLY(bool _checked_for_counted_loop = false;)
+
+  // stats for PhaseIdealLoop::print_statistics()
+  static volatile int _long_loop_counted_loops;
+
+  // Return a type based on condition control flow
+  const TypeInt* filtered_type(Node* n, Node* n_ctrl);
+  const TypeInt* filtered_type(Node* n) { return filtered_type(n, nullptr); }
+  // Helpers for filtered type
+  const TypeInt* filtered_type_from_dominators(Node* val, Node* val_ctrl);
+
+  void insert_loop_limit_check_predicate(const ParsePredicateSuccessProj* loop_limit_check_parse_proj, Node* bol) const;
+  void insert_stride_overflow_limit_check() const;
+  void insert_init_trip_limit_check() const;
+  bool has_dominating_loop_limit_check(Node* init_trip, Node* limit, jlong stride_con, BasicType iv_bt,
+                                       Node* loop_entry) const;
+
+  bool is_iv_overflowing(const TypeInteger* init_t, jlong stride_con, Node* phi_increment, BoolTest::mask mask) const;
+  bool has_truncation_wrap(const TruncatedIncrement& truncation, Node* phi, jlong stride_con);
+  SafePointNode* find_safepoint(Node* iftrue);
+  bool is_safepoint_invalid(SafePointNode* sfpt) const;
+
+ public:
+  CountedLoopConverter(PhaseIdealLoop* phase, Node* head, IdealLoopTree* loop, const BasicType iv_bt)
+      : _phase(phase),
+        _head(head),
+        _loop(loop),
+        _iv_bt(iv_bt),
+        _structure(LoopStructure(_head, _loop, _phase, _iv_bt)) {
+    assert(phase != nullptr, "must be"); // Fail early if mandatory parameters are null.
+    assert(head != nullptr, "must be");
+    assert(loop != nullptr, "must be");
+    assert(iv_bt == T_INT || iv_bt == T_LONG, "either int or long loops");
+  }
+
+  bool is_counted_loop();
+  IdealLoopTree* convert();
+
+  DEBUG_ONLY(bool should_stress_long_counted_loop();)
+  DEBUG_ONLY(bool stress_long_counted_loop();)
+
+  enum StrideOverflowState {
+    Overflow          = -1,
+    NoOverflow        = 0,
+    RequireLimitCheck = 1
+  };
+  static StrideOverflowState check_stride_overflow(jlong final_correction, const TypeInteger* limit_t, BasicType bt);
+};
 
 class AutoNodeBudget : public StackObj
 {
diff --git a/src/hotspot/share/opto/loopopts.cpp b/src/hotspot/share/opto/loopopts.cpp
index 862cb7067ec..a21fa43b30c 100644
--- a/src/hotspot/share/opto/loopopts.cpp
+++ b/src/hotspot/share/opto/loopopts.cpp
@@ -2829,8 +2829,6 @@ void PhaseIdealLoop::clone_loop_body(const Node_List& body, Node_List &old_new,
 // with an optional truncation (left-shift followed by a right-shift)
 // of the add. Returns zero if not an iv.
 int PhaseIdealLoop::stride_of_possible_iv(Node* iff) {
-  Node* trunc1 = nullptr;
-  Node* trunc2 = nullptr;
   const TypeInteger* ttype = nullptr;
   if (!iff->is_If() || iff->in(1) == nullptr || !iff->in(1)->is_Bool()) {
     return 0;
@@ -2851,23 +2849,23 @@ int PhaseIdealLoop::stride_of_possible_iv(Node* iff) {
     Node* phi = cmp1;
     for (uint i = 1; i < phi->req(); i++) {
       Node* in = phi->in(i);
-      Node* add = CountedLoopNode::match_incr_with_optional_truncation(in,
-                                &trunc1, &trunc2, &ttype, T_INT);
-      if (add && add->in(1) == phi) {
-        add2 = add->in(2);
+      CountedLoopConverter::TruncatedIncrement add(T_INT);
+      add.build(in);
+      if (add.is_valid() && add.incr()->in(1) == phi) {
+        add2 = add.incr()->in(2);
         break;
       }
     }
   } else {
     // (If (Bool (CmpX addtrunc:(Optional-trunc((AddI (Phi ...addtrunc...) add2)) )))
     Node* addtrunc = cmp1;
-    Node* add = CountedLoopNode::match_incr_with_optional_truncation(addtrunc,
-                                &trunc1, &trunc2, &ttype, T_INT);
-    if (add && add->in(1)->is_Phi()) {
-      Node* phi = add->in(1);
+    CountedLoopConverter::TruncatedIncrement add(T_INT);
+    add.build(addtrunc);
+    if (add.is_valid() && add.incr()->in(1)->is_Phi()) {
+      Node* phi = add.incr()->in(1);
       for (uint i = 1; i < phi->req(); i++) {
         if (phi->in(i) == addtrunc) {
-          add2 = add->in(2);
+          add2 = add.incr()->in(2);
           break;
         }
       }
@@ -4294,54 +4292,50 @@ bool PhaseIdealLoop::duplicate_loop_backedge(IdealLoopTree *loop, Node_List &old
 #endif //ASSERT
   {
     // Is the shape of the loop that of a counted loop...
-    Node* back_control = loop_exit_control(head, loop);
+    Node* back_control = loop_exit_control(loop);
     if (back_control == nullptr) {
       return false;
     }
 
-    BoolTest::mask bt = BoolTest::illegal;
-    float cl_prob = 0;
-    Node* incr = nullptr;
-    Node* limit = nullptr;
-    Node* cmp = loop_exit_test(back_control, loop, incr, limit, bt, cl_prob);
-    if (cmp == nullptr || cmp->Opcode() != Op_CmpI) {
+    LoopExitTest loop_exit(back_control, loop, this);
+    loop_exit.build();
+    if (!loop_exit.is_valid_with_bt(T_INT)) {
       return false;
     }
 
+    const Node* loop_incr = loop_exit.incr();
+
     // With an extra phi for the candidate iv?
     // Or the region node is the loop head
-    if (!incr->is_Phi() || incr->in(0) == head) {
+    if (!loop_incr->is_Phi() || loop_incr->in(0) == head) {
       return false;
     }
 
     PathFrequency pf(head, this);
-    region = incr->in(0);
+    region = loop_incr->in(0);
 
     // Go over all paths for the extra phi's region and see if that
     // path is frequent enough and would match the expected iv shape
     // if the extra phi is removed
     inner = 0;
-    for (uint i = 1; i < incr->req(); ++i) {
-      Node* in = incr->in(i);
-      Node* trunc1 = nullptr;
-      Node* trunc2 = nullptr;
-      const TypeInteger* iv_trunc_t = nullptr;
-      Node* orig_in = in;
-      if (!(in = CountedLoopNode::match_incr_with_optional_truncation(in, &trunc1, &trunc2, &iv_trunc_t, T_INT))) {
+    for (uint i = 1; i < loop_incr->req(); ++i) {
+      CountedLoopConverter::TruncatedIncrement increment(T_INT);
+      increment.build(loop_incr->in(i));
+      if (!increment.is_valid()) {
         continue;
       }
-      assert(in->Opcode() == Op_AddI, "wrong increment code");
-      Node* xphi = nullptr;
-      Node* stride = loop_iv_stride(in, xphi);
+      assert(increment.incr()->Opcode() == Op_AddI, "wrong increment code");
 
-      if (stride == nullptr) {
+      LoopIVStride stride = LoopIVStride(T_INT);
+      stride.build(increment.incr());
+      if (!stride.is_valid()) {
         continue;
       }
 
-      PhiNode* phi = loop_iv_phi(xphi, nullptr, head);
+      PhiNode* phi = loop_iv_phi(stride.xphi(), nullptr, head);
       if (phi == nullptr ||
-          (trunc1 == nullptr && phi->in(LoopNode::LoopBackControl) != incr) ||
-          (trunc1 != nullptr && phi->in(LoopNode::LoopBackControl) != trunc1)) {
+          (increment.outer_trunc() == nullptr && phi->in(LoopNode::LoopBackControl) != loop_exit.incr()) ||
+          (increment.outer_trunc() != nullptr && phi->in(LoopNode::LoopBackControl) != increment.outer_trunc())) {
         return false;
       }
 
diff --git a/test/hotspot/jtreg/compiler/loopopts/TestStressLongCountedLoopLimitChecks.java b/test/hotspot/jtreg/compiler/loopopts/TestStressLongCountedLoopLimitChecks.java
new file mode 100644
index 00000000000..fd0143acdb6
--- /dev/null
+++ b/test/hotspot/jtreg/compiler/loopopts/TestStressLongCountedLoopLimitChecks.java
@@ -0,0 +1,117 @@
+/*
+ * Copyright (c) 2026 IBM and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+package compiler.loopopts;
+
+import jdk.test.lib.Asserts;
+import jdk.test.lib.process.OutputAnalyzer;
+import jdk.test.lib.process.ProcessTools;
+
+import java.io.IOException;
+import java.util.Arrays;
+import java.util.stream.Stream;
+
+/**
+ * @test
+ * @bug 8353290
+ * @summary test loop limit checks are inserted when stressing int counted loops to long counted loops
+ * @library /test/lib
+ * @requires vm.debug == true
+ * @run driver compiler.loopopts.TestStressLongCountedLoopLimitChecks
+ */
+public class TestStressLongCountedLoopLimitChecks {
+    public static void main(String[] args) throws Exception {
+        test(BasicLauncher.class, 1, "-XX:StressLongCountedLoop=0");
+        test(BasicLauncher.class, 1, "-XX:StressLongCountedLoop=2000000");
+
+        test(LargeStrideLauncher.class, 2, "-XX:StressLongCountedLoop=0");
+        test(LargeStrideLauncher.class, 2, "-XX:StressLongCountedLoop=2000000");
+    }
+
+    private static void test(Class launcher, int limitChecks, String... flags) throws IOException {
+        ProcessBuilder pb = ProcessTools.createLimitedTestJavaProcessBuilder(
+                Stream.concat(Arrays.stream(flags), Stream.of(
+                        "-XX:+IgnoreUnrecognizedVMOptions",
+                        "-XX:+TraceLoopLimitCheck",
+                        "-XX:CompileOnly=" + launcher.getName() + "::test*",
+                        "-Xcomp",
+                        launcher.getName()
+                )).toList()
+        );
+
+        OutputAnalyzer analyzer = new OutputAnalyzer(pb.start());
+        analyzer.shouldHaveExitValue(0);
+
+        analyzer.outputTo(System.out);
+        analyzer.errorTo(System.err);
+
+        Asserts.assertEQ(
+                limitChecks,
+                (int) analyzer.asLines().stream().filter(
+                        l -> l.trim().matches("Counted Loop Limit Check generated:")
+                ).count(),
+                "wrong numbers of loop limit checks"
+        );
+    }
+
+    public static class BasicLauncher {
+        static int x, y, z;
+
+        public static void main(String[] args) throws Exception {
+            test();
+        }
+
+        static void test() {
+            int i = x; // Any int
+            do {
+                x += y;
+                i++; // Could overflow and thus we need a Loop Limit Check Predicate "i < z"
+            } while (i < z);
+        }
+    }
+
+    public static class LargeStrideLauncher {
+        static final int STRIDE = 100_000;
+
+        public static void main(String[] args) throws Exception {
+            Asserts.assertEQ(10_000_000L / STRIDE, test(0, 10_000_000), "loop not stopped");
+            Asserts.assertEQ(-1L, test(0, Integer.MAX_VALUE), "loop stopped prematurely");
+        }
+
+        static long ONE = 1; // Just so the compiler doesn't try to IV replace the whole thing
+
+        public static long test(int init, int limit) {
+            final int stride = 100_000;
+
+            long iterations = 0;
+            for (int i = init; i < limit; i += 100000) {
+                iterations += ONE;
+
+                if (iterations > (limit / stride) + 1) { // No it's not stopping, as we should expect.
+                    return -1;
+                }
+            }
+            return iterations; // Possibly stopping prematurely.
+        }
+    }
+}

From 02bce505eebd255c7b53a23dbc2b5d745573b5b1 Mon Sep 17 00:00:00 2001
From: Simon Tooke <stooke@openjdk.org>
Date: Mon, 16 Mar 2026 14:41:59 +0000
Subject: [PATCH 209/655] 8377456: GetObjectSizeIntrinsicsTest.java,
 ARRAY_HEADER_SIZE wrong for 32-bit

Reviewed-by: stuefe
---
 test/jdk/java/lang/instrument/GetObjectSizeIntrinsicsTest.java | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/test/jdk/java/lang/instrument/GetObjectSizeIntrinsicsTest.java b/test/jdk/java/lang/instrument/GetObjectSizeIntrinsicsTest.java
index 1e473ccd974..44276a9f7f5 100644
--- a/test/jdk/java/lang/instrument/GetObjectSizeIntrinsicsTest.java
+++ b/test/jdk/java/lang/instrument/GetObjectSizeIntrinsicsTest.java
@@ -315,7 +315,7 @@ public class GetObjectSizeIntrinsicsTest extends ASimpleInstrumentationTestCase
     static final int LARGE_OBJ_ARRAY_SIZE = (4096/(int)REF_SIZE)*1024*1024 + 1024;
 
     static final boolean CCP = WhiteBox.getWhiteBox().getBooleanVMFlag("UseCompressedClassPointers");
-    static final int ARRAY_HEADER_SIZE = CCP ? 16 : (Platform.is64bit() ? 20 : 16);
+    static final int ARRAY_HEADER_SIZE = CCP ? 16 : (Platform.is64bit() ? 20 : 12);
 
     final String mode;
 

From 3ddfdd94d92135e2038f48913a4c3e0f9754049b Mon Sep 17 00:00:00 2001
From: Robert Toyonaga <rtoyonag@redhat.com>
Date: Mon, 16 Mar 2026 14:42:39 +0000
Subject: [PATCH 210/655] 8353567: Tighten NMT lock scope in os::release_memory
 and os::uncommit_memory

Reviewed-by: azafari, stuefe
---
 src/hotspot/os/posix/perfMemory_posix.cpp     | 15 ++------
 src/hotspot/os/windows/perfMemory_windows.cpp | 13 +++----
 src/hotspot/share/gc/z/zNMT.cpp               |  6 ++--
 src/hotspot/share/nmt/memTracker.hpp          |  3 +-
 src/hotspot/share/nmt/threadStackTracker.cpp  |  3 +-
 src/hotspot/share/runtime/os.cpp              | 34 ++++---------------
 6 files changed, 19 insertions(+), 55 deletions(-)

diff --git a/src/hotspot/os/posix/perfMemory_posix.cpp b/src/hotspot/os/posix/perfMemory_posix.cpp
index d9bde6fa825..b8be77c5e05 100644
--- a/src/hotspot/os/posix/perfMemory_posix.cpp
+++ b/src/hotspot/os/posix/perfMemory_posix.cpp
@@ -1084,18 +1084,9 @@ static char* mmap_create_shared(size_t size) {
 // release a named shared memory region that was mmap-ed.
 //
 static void unmap_shared(char* addr, size_t bytes) {
-  int res;
-  if (MemTracker::enabled()) {
-    MemTracker::NmtVirtualMemoryLocker nvml;
-    res = ::munmap(addr, bytes);
-    if (res == 0) {
-      MemTracker::record_virtual_memory_release(addr, bytes);
-    }
-  } else {
-    res = ::munmap(addr, bytes);
-  }
-  if (res != 0) {
-    log_info(os)("os::release_memory failed (" PTR_FORMAT ", %zu)", p2i(addr), bytes);
+  MemTracker::record_virtual_memory_release(addr, bytes);
+  if (::munmap(addr, bytes) != 0) {
+    fatal("os::release_memory failed (" PTR_FORMAT ", %zu)", p2i(addr), bytes);
   }
 }
 
diff --git a/src/hotspot/os/windows/perfMemory_windows.cpp b/src/hotspot/os/windows/perfMemory_windows.cpp
index f54a2b52cca..dad2804f18a 100644
--- a/src/hotspot/os/windows/perfMemory_windows.cpp
+++ b/src/hotspot/os/windows/perfMemory_windows.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2001, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2001, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -1682,12 +1682,7 @@ void PerfMemory::detach(char* addr, size_t bytes) {
     return;
   }
 
-  if (MemTracker::enabled()) {
-    // it does not go through os api, the operation has to record from here
-    MemTracker::NmtVirtualMemoryLocker nvml;
-    remove_file_mapping(addr);
-    MemTracker::record_virtual_memory_release(addr, bytes);
-  } else {
-    remove_file_mapping(addr);
-  }
+  // it does not go through os api, the operation has to record from here
+  MemTracker::record_virtual_memory_release(addr, bytes);
+  remove_file_mapping(addr);
 }
diff --git a/src/hotspot/share/gc/z/zNMT.cpp b/src/hotspot/share/gc/z/zNMT.cpp
index 1019bcfdd96..b82afac47bc 100644
--- a/src/hotspot/share/gc/z/zNMT.cpp
+++ b/src/hotspot/share/gc/z/zNMT.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2023, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2023, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -45,9 +45,7 @@ void ZNMT::unreserve(zaddress_unsafe start, size_t size) {
 
   if (MemTracker::enabled()) {
     // We are the owner of the reserved memory, and any failure to unreserve
-    // are fatal, so so we don't need to hold a lock while unreserving memory.
-
-    MemTracker::NmtVirtualMemoryLocker nvml;
+    // are fatal, so we don't need to hold a lock while unreserving memory.
 
     // The current NMT implementation does not support unreserving a memory
     // region that was built up from smaller memory reservations. Workaround
diff --git a/src/hotspot/share/nmt/memTracker.hpp b/src/hotspot/share/nmt/memTracker.hpp
index d9ebf4dc30e..6b5b6affa14 100644
--- a/src/hotspot/share/nmt/memTracker.hpp
+++ b/src/hotspot/share/nmt/memTracker.hpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2013, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2013, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -140,6 +140,7 @@ class MemTracker : AllStatic {
     assert_post_init();
     if (!enabled()) return;
     if (addr != nullptr) {
+      NmtVirtualMemoryLocker nvml;
       VirtualMemoryTracker::Instance::remove_released_region((address)addr, size);
     }
   }
diff --git a/src/hotspot/share/nmt/threadStackTracker.cpp b/src/hotspot/share/nmt/threadStackTracker.cpp
index 3e649d882c4..6fb17c93782 100644
--- a/src/hotspot/share/nmt/threadStackTracker.cpp
+++ b/src/hotspot/share/nmt/threadStackTracker.cpp
@@ -1,6 +1,6 @@
 /*
  * Copyright (c) 2019, 2024, Red Hat, Inc. All rights reserved.
- * Copyright (c) 2024, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2024, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -60,7 +60,6 @@ void ThreadStackTracker::delete_thread_stack(void* base, size_t size) {
   assert(base != nullptr, "Should have been filtered");
   align_thread_stack_boundaries_inward(base, size);
 
-  MemTracker::NmtVirtualMemoryLocker nvml;
   MemTracker::record_virtual_memory_release((address)base, size);
   _thread_count--;
 }
diff --git a/src/hotspot/share/runtime/os.cpp b/src/hotspot/share/runtime/os.cpp
index 8f7e4d3cb6d..129f8f76e73 100644
--- a/src/hotspot/share/runtime/os.cpp
+++ b/src/hotspot/share/runtime/os.cpp
@@ -2302,24 +2302,13 @@ void os::uncommit_memory(char* addr, size_t bytes, bool executable) {
   log_debug(os, map)("Uncommitted " RANGEFMT, RANGEFMTARGS(addr, bytes));
 }
 
-// The scope of NmtVirtualMemoryLocker covers both pd_release_memory and record_virtual_memory_release because
-// these operations must happen atomically to avoid races causing NMT to fall out os sync with the OS reality.
-// We do not have the same lock protection for pd_reserve_memory and record_virtual_memory_reserve.
-// We assume that there is some external synchronization that prevents a region from being released
-// before it is finished being reserved.
+// pd_release_memory is called outside the protection of the NMT lock.
+// Until pd_release_memory is called, The OS is unable to give away the about-to-be-released range to another thread.
+// So there is no risk of another thread re-reserving the range before this function is done with it.
 void os::release_memory(char* addr, size_t bytes) {
   assert_nonempty_range(addr, bytes);
-  bool res;
-  if (MemTracker::enabled()) {
-    MemTracker::NmtVirtualMemoryLocker nvml;
-    res = pd_release_memory(addr, bytes);
-    if (res) {
-      MemTracker::record_virtual_memory_release(addr, bytes);
-    }
-  } else {
-    res = pd_release_memory(addr, bytes);
-  }
-  if (!res) {
+  MemTracker::record_virtual_memory_release(addr, bytes);
+  if (!pd_release_memory(addr, bytes)) {
     fatal("Failed to release " RANGEFMT, RANGEFMTARGS(addr, bytes));
   }
   log_debug(os, map)("Released " RANGEFMT, RANGEFMTARGS(addr, bytes));
@@ -2392,17 +2381,8 @@ char* os::map_memory(int fd, const char* file_name, size_t file_offset,
 }
 
 void os::unmap_memory(char *addr, size_t bytes) {
-  bool result;
-  if (MemTracker::enabled()) {
-    MemTracker::NmtVirtualMemoryLocker nvml;
-    result = pd_unmap_memory(addr, bytes);
-    if (result) {
-      MemTracker::record_virtual_memory_release(addr, bytes);
-    }
-  } else {
-    result = pd_unmap_memory(addr, bytes);
-  }
-  if (!result) {
+  MemTracker::record_virtual_memory_release(addr, bytes);
+  if (!pd_unmap_memory(addr, bytes)) {
     fatal("Failed to unmap memory " RANGEFMT, RANGEFMTARGS(addr, bytes));
   }
 }

From 7695b1f9c25921c25af3a37c70c3830b2c9cd41d Mon Sep 17 00:00:00 2001
From: Brian Burkhalter <bpb@openjdk.org>
Date: Mon, 16 Mar 2026 16:01:23 +0000
Subject: [PATCH 211/655] 8379155: Refactor Files TestNG tests to use JUnit

Reviewed-by: alanb
---
 .../java/nio/file/Files/BytesAndLines.java    | 147 +++++-----
 .../nio/file/Files/CallWithInterruptSet.java  |  28 +-
 .../jdk/java/nio/file/Files/CopyProcFile.java |  48 ++--
 .../nio/file/Files/CreateDirectories.java     |  22 +-
 test/jdk/java/nio/file/Files/Mismatch.java    | 251 +++++++++---------
 .../java/nio/file/Files/ReadWriteString.java  | 226 ++++++++--------
 .../nio/file/Files/SetLastModifiedTime.java   |  53 ++--
 test/jdk/java/nio/file/Files/StreamTest.java  | 165 ++++++------
 test/jdk/java/nio/file/Files/SubstDrive.java  |  99 ++++---
 .../nio/file/Files/walkFileTree/FindTest.java |  20 +-
 .../jdk/java/nio/file/spi/TestDelegation.java |  87 +++---
 11 files changed, 580 insertions(+), 566 deletions(-)

diff --git a/test/jdk/java/nio/file/Files/BytesAndLines.java b/test/jdk/java/nio/file/Files/BytesAndLines.java
index ca486ab87fc..1d51021e786 100644
--- a/test/jdk/java/nio/file/Files/BytesAndLines.java
+++ b/test/jdk/java/nio/file/Files/BytesAndLines.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2011, 2013, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2011, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -24,38 +24,47 @@
 /* @test
  * @bug 7006126 8020669 8024788 8019526
  * @build BytesAndLines PassThroughFileSystem
- * @run testng BytesAndLines
+ * @run junit BytesAndLines
  * @summary Unit test for methods for Files readAllBytes, readAllLines and
  *     and write methods.
  * @key randomness
  */
 
-import java.nio.ByteBuffer;
-import java.nio.CharBuffer;
-import java.nio.file.Files;
-import java.nio.file.Path;
-import java.nio.file.Paths;
-import java.nio.file.OpenOption;
-import static java.nio.file.StandardOpenOption.*;
+import java.io.IOException;
 import java.nio.charset.Charset;
 import java.nio.charset.CharacterCodingException;
 import java.nio.charset.MalformedInputException;
 import java.nio.charset.UnmappableCharacterException;
-import static java.nio.charset.StandardCharsets.*;
+import java.nio.ByteBuffer;
+import java.nio.CharBuffer;
+import java.nio.file.Files;
+import java.nio.file.OpenOption;
+import java.nio.file.Path;
+import java.nio.file.Paths;
 import java.util.Arrays;
 import java.util.ArrayList;
 import java.util.Collections;
 import java.util.List;
 import java.util.Random;
 import java.util.concurrent.Callable;
-import java.io.IOException;
 
-import org.testng.annotations.AfterClass;
-import org.testng.annotations.BeforeClass;
-import org.testng.annotations.Test;
-import static org.testng.Assert.*;
+import static java.nio.charset.StandardCharsets.*;
+import static java.nio.file.StandardOpenOption.*;
+
+import org.junit.jupiter.api.AfterAll;
+import org.junit.jupiter.api.BeforeAll;
+import org.junit.jupiter.api.Test;
+import org.junit.jupiter.api.condition.EnabledOnOs;
+import org.junit.jupiter.api.condition.OS;
+
+import static org.junit.jupiter.api.Assertions.assertArrayEquals;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertLinesMatch;
+import static org.junit.jupiter.api.Assertions.assertSame;
+import static org.junit.jupiter.api.Assertions.assertThrows;
+import static org.junit.jupiter.api.Assertions.assertTrue;
+import static org.junit.jupiter.api.Assertions.fail;
 
-@Test(groups = "unit")
 public class BytesAndLines {
 
     // data for text files
@@ -66,15 +75,15 @@ public class BytesAndLines {
     private static Random RAND = new Random();
 
     // file used by most tests
-    private Path tmpfile;
+    private static Path tmpfile;
 
-    @BeforeClass
-    void setup() throws IOException {
+    @BeforeAll
+    static void setup() throws IOException {
         tmpfile = Files.createTempFile("blah", null);
     }
 
-    @AfterClass
-    void cleanup() throws IOException {
+    @AfterAll
+    static void cleanup() throws IOException {
         Files.deleteIfExists(tmpfile);
     }
 
@@ -90,6 +99,7 @@ public class BytesAndLines {
     /**
      * Exercise NullPointerException
      */
+    @Test
     public void testNulls() {
         Path file = Paths.get("foo");
         byte[] bytes = new byte[100];
@@ -118,18 +128,13 @@ public class BytesAndLines {
     }
 
     private void checkNullPointerException(Callable<?> c) {
-        try {
-            c.call();
-            fail("NullPointerException expected");
-        } catch (NullPointerException ignore) {
-        } catch (Exception e) {
-            fail(e + " not expected");
-        }
+        assertThrows(NullPointerException.class, () -> c.call());
     }
 
     /**
      * Exercise Files.readAllBytes(Path) on varied file sizes
      */
+    @Test
     public void testReadAllBytes() throws IOException {
         int size = 0;
         while (size <= 16*1024) {
@@ -145,7 +150,7 @@ public class BytesAndLines {
 
         // check expected bytes are read
         byte[] read = Files.readAllBytes(tmpfile);
-        assertTrue(Arrays.equals(read, expected), "Bytes read not the same as written");
+        assertArrayEquals(expected, read, "Bytes read not the same as written");
     }
 
     /**
@@ -153,13 +158,14 @@ public class BytesAndLines {
      * special because file sizes are reported as 0 even though the file
      * has content.
      */
+    @Test
+    @EnabledOnOs(OS.LINUX)
     public void testReadAllBytesOnProcFS() throws IOException {
         // read from procfs
-        if (System.getProperty("os.name").equals("Linux")) {
-            Path statFile = Paths.get("/proc/self/stat");
-            byte[] data = Files.readAllBytes(statFile);
-            assertTrue(data.length > 0, "Files.readAllBytes('" + statFile + "') failed to read");
-        }
+        Path statFile = Paths.get("/proc/self/stat");
+        byte[] data = Files.readAllBytes(statFile);
+        assertTrue(data.length > 0,
+                   "Files.readAllBytes('" + statFile + "') failed to read");
     }
 
     /**
@@ -167,6 +173,7 @@ public class BytesAndLines {
      * because readAllBytes was originally implemented to use FileChannel
      * and so may not be supported by custom file system providers.
      */
+    @Test
     public void testReadAllBytesOnCustomFS() throws IOException {
         Path myfile = PassThroughFileSystem.create().getPath("myfile");
         try {
@@ -175,7 +182,7 @@ public class BytesAndLines {
                 byte[] b1 = genBytes(size);
                 Files.write(myfile, b1);
                 byte[] b2 = Files.readAllBytes(myfile);
-                assertTrue(Arrays.equals(b1, b2), "bytes not equal");
+                assertArrayEquals(b1, b2, "bytes not equal");
                 size += 512;
             }
         } finally {
@@ -186,6 +193,7 @@ public class BytesAndLines {
     /**
      * Exercise Files.write(Path, byte[], OpenOption...) on various sizes
      */
+    @Test
     public void testWriteBytes() throws IOException {
         int size = 0;
         while (size < 16*1024) {
@@ -198,10 +206,10 @@ public class BytesAndLines {
     private void testWriteBytes(int size, boolean append) throws IOException {
         byte[] bytes = genBytes(size);
         Path result = Files.write(tmpfile, bytes);
-        assertTrue(result == tmpfile);
+        assertSame(tmpfile, result);
         if (append) {
             Files.write(tmpfile, bytes, APPEND);
-            assertTrue(Files.size(tmpfile) == size*2);
+            assertEquals(size*2, Files.size(tmpfile));
         }
 
         byte[] expected;
@@ -214,12 +222,13 @@ public class BytesAndLines {
         }
 
         byte[] read = Files.readAllBytes(tmpfile);
-        assertTrue(Arrays.equals(read, expected), "Bytes read not the same as written");
+        assertArrayEquals(expected, read, "Bytes read not the same as written");
     }
 
     /**
      * Exercise Files.readAllLines(Path, Charset)
      */
+    @Test
     public void testReadAllLines() throws IOException {
         // zero lines
         Files.write(tmpfile, new byte[0]);
@@ -230,23 +239,22 @@ public class BytesAndLines {
         byte[] hi = { (byte)'h', (byte)'i' };
         Files.write(tmpfile, hi);
         lines = Files.readAllLines(tmpfile, US_ASCII);
-        assertTrue(lines.size() == 1, "One line expected");
-        assertTrue(lines.get(0).equals("hi"), "'Hi' expected");
+        assertEquals(1, lines.size(), "One line expected");
+        assertEquals("hi", lines.get(0), "'Hi' expected");
 
         // two lines using platform's line separator
         List<String> expected = Arrays.asList("hi", "there");
         Files.write(tmpfile, expected, US_ASCII);
         assertTrue(Files.size(tmpfile) > 0, "File is empty");
         lines = Files.readAllLines(tmpfile, US_ASCII);
-        assertTrue(lines.equals(expected), "Unexpected lines");
+        assertLinesMatch(expected, lines, "Unexpected lines");
 
         // MalformedInputException
         byte[] bad = { (byte)0xff, (byte)0xff };
         Files.write(tmpfile, bad);
-        try {
-            Files.readAllLines(tmpfile, US_ASCII);
-            fail("MalformedInputException expected");
-        } catch (MalformedInputException ignore) { }
+        assertThrows(MalformedInputException.class,
+                     () -> Files.readAllLines(tmpfile, US_ASCII),
+                     "MalformedInputException expected");
     }
 
     /**
@@ -254,24 +262,27 @@ public class BytesAndLines {
      * is special because file sizes are reported as 0 even though the file
      * has content.
      */
+    @Test
+    @EnabledOnOs(OS.LINUX)
     public void testReadAllLinesOnProcFS() throws IOException {
-        if (System.getProperty("os.name").equals("Linux")) {
-            Path statFile = Paths.get("/proc/self/stat");
-            List<String> lines = Files.readAllLines(statFile);
-            assertTrue(lines.size() > 0, "Files.readAllLines('" + statFile + "') failed to read");
-        }
+        Path statFile = Paths.get("/proc/self/stat");
+        List<String> lines = Files.readAllLines(statFile);
+        assertTrue(lines.size() > 0,
+                   "Files.readAllLines('" + statFile + "') failed to read");
     }
 
     /**
      * Exercise Files.readAllLines(Path)
      */
+    @Test
     public void testReadAllLinesUTF8() throws IOException {
         Files.write(tmpfile, encodeAsUTF8(EN_STRING + "\n" + JA_STRING));
 
         List<String> lines = Files.readAllLines(tmpfile);
-        assertTrue(lines.size() == 2, "Read " + lines.size() + " lines instead of 2");
-        assertTrue(lines.get(0).equals(EN_STRING));
-        assertTrue(lines.get(1).equals(JA_STRING));
+        assertEquals(2, lines.size(),
+                     "Read " + lines.size() + " lines instead of 2");
+        assertEquals(EN_STRING, lines.get(0));
+        assertEquals(JA_STRING, lines.get(1));
 
         // a sample of malformed sequences
         testReadAllLinesMalformedUTF8((byte)0xFF); // one-byte sequence
@@ -284,57 +295,55 @@ public class BytesAndLines {
         ByteBuffer bb = UTF_8.newEncoder().encode(CharBuffer.wrap(s));
         byte[] result = new byte[bb.limit()];
         bb.get(result);
-        assertTrue(bb.remaining() == 0);
+        assertEquals(0, bb.remaining());
         return result;
     }
 
     private void testReadAllLinesMalformedUTF8(byte... bytes) throws IOException {
         Files.write(tmpfile, bytes);
-        try {
-            Files.readAllLines(tmpfile);
-            fail("MalformedInputException expected");
-        } catch (MalformedInputException ignore) { }
+        assertThrows(MalformedInputException.class,
+                     () -> Files.readAllLines(tmpfile));
     }
 
     /**
      * Exercise Files.write(Path, Iterable<? extends CharSequence>, Charset, OpenOption...)
      */
+    @Test
     public void testWriteLines() throws IOException {
         // zero lines
         Path result = Files.write(tmpfile, Collections.<String>emptyList(), US_ASCII);
-        assert(Files.size(tmpfile) == 0);
-        assert(result == tmpfile);
+        assertEquals(0, Files.size(tmpfile));
+        assertSame(tmpfile, result);
 
         // two lines
         List<String> lines = Arrays.asList("hi", "there");
         Files.write(tmpfile, lines, US_ASCII);
         List<String> actual = Files.readAllLines(tmpfile, US_ASCII);
-        assertTrue(actual.equals(lines), "Unexpected lines");
+        assertLinesMatch(lines, actual, "Unexpected lines");
 
         // append two lines
         Files.write(tmpfile, lines, US_ASCII, APPEND);
         List<String> expected = new ArrayList<>();
         expected.addAll(lines);
         expected.addAll(lines);
-        assertTrue(expected.size() == 4, "List should have 4 elements");
+        assertEquals(4, expected.size());
         actual = Files.readAllLines(tmpfile, US_ASCII);
-        assertTrue(actual.equals(expected), "Unexpected lines");
+        assertLinesMatch(expected, actual, "Unexpected lines");
 
         // UnmappableCharacterException
-        try {
-            String s = "\u00A0\u00A1";
-            Files.write(tmpfile, Arrays.asList(s), US_ASCII);
-            fail("UnmappableCharacterException expected");
-        } catch (UnmappableCharacterException ignore) { }
+        String s = "\u00A0\u00A1";
+        assertThrows(UnmappableCharacterException.class,
+                     () -> Files.write(tmpfile, Arrays.asList(s), US_ASCII));
     }
 
     /**
      * Exercise Files.write(Path, Iterable<? extends CharSequence>, OpenOption...)
      */
+    @Test
     public void testWriteLinesUTF8() throws IOException {
         List<String> lines = Arrays.asList(EN_STRING, JA_STRING);
         Files.write(tmpfile, lines);
         List<String> actual = Files.readAllLines(tmpfile, UTF_8);
-        assertTrue(actual.equals(lines), "Unexpected lines");
+        assertLinesMatch(lines, actual, "Unexpected lines");
     }
 }
diff --git a/test/jdk/java/nio/file/Files/CallWithInterruptSet.java b/test/jdk/java/nio/file/Files/CallWithInterruptSet.java
index 3d7bfd2c518..59d6a6a7ecb 100644
--- a/test/jdk/java/nio/file/Files/CallWithInterruptSet.java
+++ b/test/jdk/java/nio/file/Files/CallWithInterruptSet.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -24,22 +24,24 @@
 /*
  * @test
  * @bug 8205612
- * @run testng CallWithInterruptSet
+ * @run junit CallWithInterruptSet
  * @summary Test invoking Files methods with the interrupted status set
  */
 
-import java.io.InputStream;
-import java.io.OutputStream;
-import java.io.IOException;
 import java.io.BufferedReader;
 import java.io.BufferedWriter;
+import java.io.InputStream;
+import java.io.IOException;
+import java.io.OutputStream;
 import java.io.Reader;
 import java.io.Writer;
 import java.nio.file.Files;
 import java.nio.file.Path;
 
-import org.testng.annotations.Test;
-import static org.testng.Assert.*;
+import org.junit.jupiter.api.Test;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertTrue;
 
 public class CallWithInterruptSet {
 
@@ -49,7 +51,7 @@ public class CallWithInterruptSet {
         Thread.currentThread().interrupt();
         try {
             byte[] bytes = Files.readAllBytes(file);
-            assertTrue(bytes.length == 100);
+            assertEquals(100, bytes.length);
         } finally {
             assertTrue(Thread.interrupted());  // clear interrupt
         }
@@ -76,7 +78,7 @@ public class CallWithInterruptSet {
         } finally {
             assertTrue(Thread.interrupted());  // clear interrupt
         }
-        assertTrue(Files.size(file) == 10);
+        assertEquals(10, Files.size(file));
     }
 
     @Test
@@ -86,7 +88,7 @@ public class CallWithInterruptSet {
         Thread.currentThread().interrupt();
         try {
             String msg = Files.readString(file);
-            assertEquals(msg, "hello");
+            assertEquals("hello", msg);
         } finally {
             assertTrue(Thread.interrupted());  // clear interrupt
         }
@@ -102,7 +104,7 @@ public class CallWithInterruptSet {
             assertTrue(Thread.interrupted());  // clear interrupt
         }
         String msg = Files.readString(file);
-        assertEquals(msg, "hello");
+        assertEquals("hello", msg);
     }
 
     @Test
@@ -112,7 +114,7 @@ public class CallWithInterruptSet {
         Thread.currentThread().interrupt();
         try (BufferedReader reader = Files.newBufferedReader(file)) {
             String msg = reader.readLine();
-            assertEquals(msg, "hello");
+            assertEquals("hello", msg);
         } finally {
             assertTrue(Thread.interrupted());  // clear interrupt
         }
@@ -128,7 +130,7 @@ public class CallWithInterruptSet {
             assertTrue(Thread.interrupted());  // clear interrupt
         }
         String msg = Files.readString(file);
-        assertEquals(msg, "hello");
+        assertEquals("hello", msg);
     }
 
     private Path mkfile() throws IOException {
diff --git a/test/jdk/java/nio/file/Files/CopyProcFile.java b/test/jdk/java/nio/file/Files/CopyProcFile.java
index 892ac6b0eb4..c187aaed861 100644
--- a/test/jdk/java/nio/file/Files/CopyProcFile.java
+++ b/test/jdk/java/nio/file/Files/CopyProcFile.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2022, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2022, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -33,20 +33,23 @@ import java.nio.file.Path;
 import java.util.ArrayList;
 import java.util.List;
 import java.util.function.ToLongBiFunction;
+import java.util.stream.Stream;
 import static java.nio.file.StandardOpenOption.*;
 
-import org.testng.Assert;
-import org.testng.annotations.AfterTest;
-import org.testng.annotations.BeforeTest;
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
+import org.junit.jupiter.api.AfterAll;
+import org.junit.jupiter.api.BeforeAll;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.Arguments;
+import org.junit.jupiter.params.provider.MethodSource;
+
+import static org.junit.jupiter.api.Assertions.*;
 
 /*
  * @test
  * @bug 8293502
  * @requires (os.family == "linux")
  * @summary Ensure that copying from a file in /proc works
- * @run testng/othervm CopyProcFile
+ * @run junit/othervm CopyProcFile
  */
 public class CopyProcFile {
     static final String SOURCE = "/proc/version";
@@ -112,8 +115,8 @@ public class CopyProcFile {
         }
     }
 
-    @BeforeTest(alwaysRun=true)
-    public void createBufferedCopy() throws IOException {
+    @BeforeAll
+    public static void createBufferedCopy() throws IOException {
         System.out.printf("Using source file \"%s\"%n", SOURCE);
         try {
             theSize = bufferedCopy(SOURCE, BUFFERED_COPY);
@@ -129,8 +132,8 @@ public class CopyProcFile {
         }
     }
 
-    @AfterTest(alwaysRun=true)
-    public void deleteBufferedCopy() {
+    @AfterAll
+    public static void deleteBufferedCopy() {
         try {
             Files.delete(Path.of(BUFFERED_COPY));
         } catch (IOException ignore) {}
@@ -148,18 +151,17 @@ public class CopyProcFile {
         }
     }
 
-    @DataProvider
-    static Object[][] functions() throws IOException {
-        List<Object[]> funcs = new ArrayList<>();
-        funcs.add(new Object[] {new FHolder((s, d) -> copy(s, d))});
-        funcs.add(new Object[] {new FHolder((s, d) -> transferToIO(s, d))});
-        funcs.add(new Object[] {new FHolder((s, d) -> transferToNIO(s, d))});
-        funcs.add(new Object[] {new FHolder((s, d) -> transferFrom(s, d))});
-        return funcs.toArray(Object[][]::new);
+    static Stream<FHolder> functions() throws IOException {
+        return Stream.of
+            (new FHolder((s, d) -> copy(s, d)),
+             new FHolder((s, d) -> transferToIO(s, d)),
+             new FHolder((s, d) -> transferToNIO(s, d)),
+             new FHolder((s, d) -> transferFrom(s, d)));
     }
 
-    @Test(dataProvider = "functions")
-    public static void testCopyAndTransfer(FHolder f) throws IOException {
+    @ParameterizedTest
+    @MethodSource("functions")
+    public void testCopyAndTransfer(FHolder f) throws IOException {
         try {
             long size = f.apply(SOURCE, TARGET);
             if (size != theSize) {
@@ -168,9 +170,7 @@ public class CopyProcFile {
             }
             long mismatch = Files.mismatch(Path.of(BUFFERED_COPY),
                                            Path.of(TARGET));
-            if (mismatch != -1) {
-                throw new RuntimeException("Target does not match copy");
-            }
+            assertEquals(-1, mismatch, "Target does not match copy");
         } finally {
             try {
                 Files.delete(Path.of(TARGET));
diff --git a/test/jdk/java/nio/file/Files/CreateDirectories.java b/test/jdk/java/nio/file/Files/CreateDirectories.java
index fc5a5025955..9912b442cfd 100644
--- a/test/jdk/java/nio/file/Files/CreateDirectories.java
+++ b/test/jdk/java/nio/file/Files/CreateDirectories.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2022, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2022, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -26,16 +26,18 @@ import java.nio.file.FileAlreadyExistsException;
 import java.nio.file.Files;
 import java.nio.file.Path;
 
-import static org.testng.Assert.*;
-import org.testng.SkipException;
-import org.testng.annotations.Test;
+import org.junit.jupiter.api.Test;
+
+import org.junit.jupiter.api.Assumptions;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertTrue;
 
 /*
  * @test
  * @bug 8032220 8293792 8307976
  * @summary Test java.nio.file.Files.createDirectories method
  * @library ..
- * @run testng CreateDirectories
+ * @run junit CreateDirectories
  */
 public class CreateDirectories {
 
@@ -46,12 +48,10 @@ public class CreateDirectories {
     public void testSymlinkDir() throws Exception {
         // create a temp dir as the "root" in which we will run our tests.
         final Path top = TestUtil.createTemporaryDirectory();
-        if (!TestUtil.supportsSymbolicLinks(top)) {
-            System.out.println("Skipping tests since symbolic links isn't " +
-                    "supported under directory "+ top);
-            throw new SkipException("Symbolic links not supported");
-        }
-        System.out.println("Running tests under directory " + top.toAbsolutePath());
+        Assumptions.assumeTrue(TestUtil.supportsSymbolicLinks(top),
+            "Skipping as symbolic links are not supported under in " + top);
+        System.err.println("Running tests under directory " +
+                           top.toAbsolutePath());
         final Path fooDir = Files.createDirectory(top.resolve("foo"));
         assertTrue(Files.isDirectory(fooDir),
                 fooDir + " was expected to be a directory but wasn't");
diff --git a/test/jdk/java/nio/file/Files/Mismatch.java b/test/jdk/java/nio/file/Files/Mismatch.java
index 8746f448ad0..0d0446ed96e 100644
--- a/test/jdk/java/nio/file/Files/Mismatch.java
+++ b/test/jdk/java/nio/file/Files/Mismatch.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -21,12 +21,6 @@
  * questions.
  */
 
-import org.testng.Assert;
-import org.testng.annotations.AfterClass;
-import org.testng.annotations.BeforeClass;
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
-
 import java.io.File;
 import java.io.IOException;
 import java.nio.charset.StandardCharsets;
@@ -36,13 +30,23 @@ import java.nio.file.Path;
 import java.nio.file.Paths;
 import java.nio.file.spi.FileSystemProvider;
 import java.util.Map;
+import java.util.stream.Stream;
+
+import org.junit.jupiter.api.AfterAll;
+import org.junit.jupiter.api.BeforeAll;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.Arguments;
+import org.junit.jupiter.params.provider.MethodSource;
 
 import static java.nio.file.StandardCopyOption.REPLACE_EXISTING;
 
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertThrows;
+
 /* @test
  * @bug 8202285
  * @build Mismatch
- * @run testng Mismatch
+ * @run junit Mismatch
  * @summary Unit test for the Files.mismatch method.
  */
 public class Mismatch {
@@ -55,29 +59,28 @@ public class Mismatch {
     private static final Map<String, String> ZIPFS_MAP = Map.of("create", "true");
 
     // temporary test directory where all test files will be created
-    Path testDir;
+    static Path testDir;
 
-    @BeforeClass
-    void setup() throws IOException {
+    @BeforeAll
+    static void setup() throws IOException {
         testDir = Files.createTempDirectory("testMismatch");
     }
 
-    @AfterClass
-    void cleanup() throws IOException {
+    @AfterAll
+    static void cleanup() throws IOException {
         // clean up files created under the test directory
         Files.walk(testDir).map(Path::toFile).forEach(File::delete);
         Files.deleteIfExists(testDir);
     }
 
     /*
-     * DataProvider for mismatch test. Provides the following fields:
+     * MethodSource for mismatch test. Provides the following fields:
      * path1 -- the path to a file
      * path2 -- the path to another file
      * expected -- expected result of the mismatch method
      * note -- a note about the test
      */
-    @DataProvider(name = "testMismatch")
-    public Object[][] getDataForMismatch() throws IOException {
+    public static Stream<Arguments> getDataForMismatch() throws IOException {
         // an non-existent file
         Path foo = Paths.get("nonexistentfile");
 
@@ -147,151 +150,148 @@ public class Mismatch {
         Path test1065000m532500 = createASCIIFile(testDir, "test1065000m532500", size, size >> 1, '%');
         Path test1065000m1064999 = createASCIIFile(testDir, "test1065000m1064999", size, 1064999, '$');
 
-        return new Object[][]{
-            // Spec Case 1: the two paths locate the same file , even if one does not exist
-            {foo, foo, MISMATCH_NO, "Same file, no mismatch"},
-            {test1024a, test1024a, MISMATCH_NO, "Same file, no mismatch"},
+        return Stream.of
+            (// Spec Case 1: the two paths locate the same file , even if one does not exist
+             Arguments.of(foo, foo, MISMATCH_NO, "Same file, no mismatch"),
+             Arguments.of(test1024a, test1024a, MISMATCH_NO, "Same file, no mismatch"),
 
-            // Spec Case 2:  The two files are the same size, and every byte in the first file
-            // is identical to the corresponding byte in the second file.
-            {test0a, test0b, MISMATCH_NO, "Sizes == 0, no mismatch"},
-            {test147a, test147b, MISMATCH_NO, "size = 147 < buffer = 8192, no mismatch"},
-            {test1024a, test1024b, MISMATCH_NO, "size = 1024 < buffer = 8192, no mismatch"},
-            {test8192a, test8192b, MISMATCH_NO, "size = 8192 = buffer = 8192, no mismatch"},
-            {test65536a, test65536b, MISMATCH_NO, "read 8 * full buffer, no mismatch"},
-            {test70025a, test70025b, MISMATCH_NO, "read 8 * full buffer plus a partial buffer, no mismatch"},
+             // Spec Case 2:  The two files are the same size, and every byte in the first file
+             // is identical to the corresponding byte in the second file.
+             Arguments.of(test0a, test0b, MISMATCH_NO, "Sizes == 0, no mismatch"),
+             Arguments.of(test147a, test147b, MISMATCH_NO, "size = 147 < buffer = 8192, no mismatch"),
+             Arguments.of(test1024a, test1024b, MISMATCH_NO, "size = 1024 < buffer = 8192, no mismatch"),
+             Arguments.of(test8192a, test8192b, MISMATCH_NO, "size = 8192 = buffer = 8192, no mismatch"),
+             Arguments.of(test65536a, test65536b, MISMATCH_NO, "read 8 * full buffer, no mismatch"),
+             Arguments.of(test70025a, test70025b, MISMATCH_NO, "read 8 * full buffer plus a partial buffer, no mismatch"),
 
 
-            /**
-             * Spec Case 3: the value returned is the position of the first mismatched byte
-             * Impl: the impl uses a buffer 8192. The testcases below covers a range of files
-             * with sizes <= and > the buffer size. The last buffer is either full or partially full.
-            */
+             /*
+              * Spec Case 3: the value returned is the position of the first mismatched byte
+              * Impl: the impl uses a buffer 8192. The testcases below covers a range of files
+              * with sizes <= and > the buffer size. The last buffer is either full or partially full.
+              */
 
-            // edge case, one of the file sizes is zero
-            // also covers Spec Case 4 and 6
-            {test147a, test147m0, 0, "mismatch = 0 (at the beginning)"},
-            {test65536m0, test65536a, 0, "mismatch = 0 (at the beginning)"},
+             // edge case, one of the file sizes is zero
+             // also covers Spec Case 4 and 6
+             Arguments.of(test147a, test147m0, 0, "mismatch = 0 (at the beginning)"),
+             Arguments.of(test65536m0, test65536a, 0, "mismatch = 0 (at the beginning)"),
 
-            /**
-             * Compares files of equal sizes
-            */
-            // small files
-            {test147a, test147m70, 70, "read one partial buffer, mismatch = 70"},
-            {test147a, test147m146, 146, "read one partial buffer, mismatch = 146 (end)"},
-            {test1024a, test1024m512, 512, "read one partial buffer, mismatch = 512"},
-            {test1024a, test1024m1023, 1023, "read one partial buffer, mismatch = 1023 (end)"},
+             /*
+              * Compares files of equal sizes
+              */
+             // small files
+             Arguments.of(test147a, test147m70, 70, "read one partial buffer, mismatch = 70"),
+             Arguments.of(test147a, test147m146, 146, "read one partial buffer, mismatch = 146 (end)"),
+             Arguments.of(test1024a, test1024m512, 512, "read one partial buffer, mismatch = 512"),
+             Arguments.of(test1024a, test1024m1023, 1023, "read one partial buffer, mismatch = 1023 (end)"),
 
-            // file size >= Impl's Buffer Size
-            {test8192a, test8192m4096, 4096, "read one buffer, mismatch = 4096 "},
-            {test8192a, test8192m8191, 8191, "read one buffer, mismatch = 8191 (at the end)"},
+             // file size >= Impl's Buffer Size
+             Arguments.of(test8192a, test8192m4096, 4096, "read one buffer, mismatch = 4096 "),
+             Arguments.of(test8192a, test8192m8191, 8191, "read one buffer, mismatch = 8191 (at the end)"),
 
-            // file size = n * Impl's Buffer Size
-            {test65536a, test65536m32768, 32768, "read through half of the file, mismatch = 32768"},
-            {test65536a, test65536m65535, 65535, "read through the whole file, mismatch = 65535 (at the end)"},
+             // file size = n * Impl's Buffer Size
+             Arguments.of(test65536a, test65536m32768, 32768, "read through half of the file, mismatch = 32768"),
+             Arguments.of(test65536a, test65536m65535, 65535, "read through the whole file, mismatch = 65535 (at the end)"),
 
-            // file size = n * Impl's Buffer Size + x
-            {test70025a, test70025m8400, 8400, "mismatch in the 2nd buffer, mismatch = 8400"},
-            {test70025a, test70025m35000, 35000, "read about half of the file, mismatch = 35000"},
-            {test70025a, test70025m70024, 70024, "read through the whole file, mismatch = 70024 (at the end)"},
+             // file size = n * Impl's Buffer Size + x
+             Arguments.of(test70025a, test70025m8400, 8400, "mismatch in the 2nd buffer, mismatch = 8400"),
+             Arguments.of(test70025a, test70025m35000, 35000, "read about half of the file, mismatch = 35000"),
+             Arguments.of(test70025a, test70025m70024, 70024, "read through the whole file, mismatch = 70024 (at the end)"),
 
-            /**
-             * Compares files of unequal sizes
-            */
-            {test8192m8191, test70025m35000, 8191, "mismatch at the end of the 1st file/buffer, mismatch = 8191"},
-            {test65536m32768, test70025m8400, 8400, "mismatch in the 2nd buffer, mismatch = 8400"},
-            {test70025m70024, test1065000m532500, 70024, "mismatch at the end of the 1st file, mismatch = 70024"},
+             /*
+              * Compares files of unequal sizes
+              */
+             Arguments.of(test8192m8191, test70025m35000, 8191, "mismatch at the end of the 1st file/buffer, mismatch = 8191"),
+             Arguments.of(test65536m32768, test70025m8400, 8400, "mismatch in the 2nd buffer, mismatch = 8400"),
+             Arguments.of(test70025m70024, test1065000m532500, 70024, "mismatch at the end of the 1st file, mismatch = 70024"),
 
-            /**
-             * Spec Case 4:  returns the size of the smaller file (in bytes) when the files are
-             * different sizes and every byte of the smaller file is identical to the corresponding
-             * byte of the larger file.
-             * Impl: similar to case 3, covers a range of file sizes
-            */
-            {test147a, test1024a, 147, "mismatch is the length of the smaller file: 147"},
-            {test1024a, test8192a, 1024, "mismatch is the length of the smaller file: 1024"},
-            {test1024a, test65536a, 1024, "mismatch is the length of the smaller file: 1024"},
-            {test8192a, test65536a, 8192, "mismatch is the length of the smaller file: 8192"},
-            {test70025a, test65536a, 65536, "mismatch is the length of the smaller file: 65536"},
-            {test1048576a, test1065000m1064999, 1048576, "mismatch is the length of the smaller file: 1048576"},
+             /*
+              * Spec Case 4:  returns the size of the smaller file (in bytes) when the files are
+              * different sizes and every byte of the smaller file is identical to the corresponding
+              * byte of the larger file.
+              * Impl: similar to case 3, covers a range of file sizes
+              */
+             Arguments.of(test147a, test1024a, 147, "mismatch is the length of the smaller file: 147"),
+             Arguments.of(test1024a, test8192a, 1024, "mismatch is the length of the smaller file: 1024"),
+             Arguments.of(test1024a, test65536a, 1024, "mismatch is the length of the smaller file: 1024"),
+             Arguments.of(test8192a, test65536a, 8192, "mismatch is the length of the smaller file: 8192"),
+             Arguments.of(test70025a, test65536a, 65536, "mismatch is the length of the smaller file: 65536"),
+             Arguments.of(test1048576a, test1065000m1064999, 1048576, "mismatch is the length of the smaller file: 1048576"),
 
-            // Spec Case 5: This method is always reflexive (for Path f , mismatch(f,f) returns -1L)
-            // See tests for Spec Case 1.
+             // Spec Case 5: This method is always reflexive (for Path f , mismatch(f,f) returns -1L)
+             // See tests for Spec Case 1.
 
-            // Spec Case 6: If the file system and files remain static, then this method is symmetric
-            // (for two Paths f and g, mismatch(f,g) will return the same value as mismatch(g,f)).
-            // The following tests are selected from tests for Spec Case 3 with the order of
-            // file paths switched, the returned values are the same as those for Case 3:
-            {test147m70, test147a, 70, "read one partial buffer, mismatch = 70"},
-            {test147m146, test147a, 146, "read one partial buffer, mismatch = 146 (end)"},
-            {test1024m512, test1024a, 512, "read one partial buffer, mismatch = 512"},
-            {test1024m1023, test1024a, 1023, "read one partial buffer, mismatch = 1023 (end)"},
+             // Spec Case 6: If the file system and files remain static, then this method is symmetric
+             // (for two Paths f and g, mismatch(f,g) will return the same value as mismatch(g,f)).
+             // The following tests are selected from tests for Spec Case 3 with the order of
+             // file paths switched, the returned values are the same as those for Case 3:
+             Arguments.of(test147m70, test147a, 70, "read one partial buffer, mismatch = 70"),
+             Arguments.of(test147m146, test147a, 146, "read one partial buffer, mismatch = 146 (end)"),
+             Arguments.of(test1024m512, test1024a, 512, "read one partial buffer, mismatch = 512"),
+             Arguments.of(test1024m1023, test1024a, 1023, "read one partial buffer, mismatch = 1023 (end)"),
 
-            {test70025m35000, test8192m8191, 8191, "mismatch at the end of the 1st file/buffer, mismatch = 8191"},
-            {test70025m8400, test65536m32768, 8400, "mismatch in the 2nd buffer, mismatch = 8400"},
-            {test1065000m532500, test70025m70024, 70024, "mismatch at the end of the 1st file, mismatch = 70024"},
-        };
+             Arguments.of(test70025m35000, test8192m8191, 8191, "mismatch at the end of the 1st file/buffer, mismatch = 8191"),
+             Arguments.of(test70025m8400, test65536m32768, 8400, "mismatch in the 2nd buffer, mismatch = 8400"),
+             Arguments.of(test1065000m532500, test70025m70024, 70024, "mismatch at the end of the 1st file, mismatch = 70024")
+             );
     }
 
     /*
-     * DataProvider for mismatch tests involving ZipFS using a few test cases selected
+     * MethodSource for mismatch tests involving ZipFS using a few test cases selected
      * from those of the original mismatch tests.
      */
-    @DataProvider(name = "testMismatchZipfs")
-    public Object[][] getDataForMismatchZipfs() throws IOException {
+    public static Stream<Arguments> getDataForMismatchZipfs() throws IOException {
         Path test1200 = createASCIIFile(testDir, "test1200", 1200, -1, ' ');
         Path test9500 = createASCIIFile(testDir, "test9500", 9500, -1, ' ');
         Path test9500m4200 = createASCIIFile(testDir, "test9500m4200", 9500, 4200, '!');
         Path test80025 = createASCIIFile(testDir, "test80025", 80025, -1, ' ');
         Path test1028500 = createASCIIFile(testDir, "test1028500", 1028500, -1, ' ');
-        return new Object[][]{
-            {test1200, test1200, MISMATCH_NO, "Compares the file and its copy in zip, no mismatch"},
-            {test9500, test9500m4200, 4200,
-                "Compares a copy of test9500m4200 in zip with test9500, shall return 4200"},
-            {test80025, test1028500, 80025, "mismatch is the length of the smaller file: 80025"},
-        };
+        return Stream.of
+            (
+             Arguments.of(test1200, test1200, MISMATCH_NO, "Compares the file and its copy in zip, no mismatch"),
+             Arguments.of(test9500, test9500m4200, 4200,
+                          "Compares a copy of test9500m4200 in zip with test9500, shall return 4200"),
+             Arguments.of(test80025, test1028500, 80025,
+                          "mismatch is the length of the smaller file: 80025")
+             );
     }
 
     /*
-     * DataProvider for verifying null handling.
+     * MethodSource for verifying null handling.
      */
-    @DataProvider(name = "testFileNull")
-    public Object[][] getDataForNull() throws IOException {
+    public static Stream<Arguments> getDataForNull() throws IOException {
         Path test = createASCIIFile(testDir, "testNonNull", 2200, -1, ' ');
-        return new Object[][]{
-            {(Path)null, (Path)null},
-            {(Path)null, test},
-            {test, (Path)null},
-        };
+        return Stream.of(Arguments.of((Path)null, (Path)null),
+                         Arguments.of((Path)null, test),
+                         Arguments.of(test, (Path)null));
     }
 
     /*
-     * DataProvider for verifying how the mismatch method handles the situation
+     * MethodSource for verifying how the mismatch method handles the situation
      * when one or both files do not exist.
      */
-    @DataProvider(name = "testFileNotExist")
-    public Object[][] getDataForFileNotExist() throws IOException {
+    public static Stream<Arguments> getDataForFileNotExist() throws IOException {
         Path test = createASCIIFile(testDir, "testFileNotExist", 3200, -1, ' ');
-        return new Object[][]{
-            {Paths.get("foo"), Paths.get("bar")},
-            {Paths.get("foo"), test},
-            {test, Paths.get("bar")},
-        };
+        return Stream.of
+            (Arguments.of(Paths.get("foo"), Paths.get("bar")),
+             Arguments.of("foo", test),
+             Arguments.of(test, Paths.get("bar")));
     }
 
     /**
-     * Tests the mismatch method. Refer to the dataProvider testMismatch for more
-     * details about the cases.
+     * Tests the mismatch method. Refer to the dataProvider getDataForNull for
+     * more details about the cases.
      * @param path the path to a file
      * @param path2 the path to another file
      * @param expected the expected result
      * @param msg the message about the test
      * @throws IOException if the test fails
      */
-    @Test(dataProvider = "testMismatch", priority = 0)
+    @ParameterizedTest
+    @MethodSource("getDataForMismatch")
     public void testMismatch(Path path, Path path2, long expected, String msg)
         throws IOException {
-        Assert.assertEquals(Files.mismatch(path, path2), expected, msg);
+        assertEquals(expected, Files.mismatch(path, path2), msg);
     }
 
     /**
@@ -302,7 +302,8 @@ public class Mismatch {
      * @param msg the message about the test
      * @throws IOException if the test fails
      */
-    @Test(dataProvider = "testMismatchZipfs", priority = 1)
+    @ParameterizedTest
+    @MethodSource("getDataForMismatchZipfs")
     public void testMismatchZipfs(Path path, Path path2, long expected, String msg)
         throws IOException {
         Path zipPath = Paths.get(testDir.toString(), "TestWithFSZip.zip");
@@ -311,9 +312,9 @@ public class Mismatch {
             Files.copy(path, copy, REPLACE_EXISTING);
 
             if (path2 == null) {
-                Assert.assertEquals(Files.mismatch(copy, path), expected, msg);
+                assertEquals(expected, Files.mismatch(copy, path), msg);
             } else {
-                Assert.assertEquals(Files.mismatch(copy, path2), expected, msg);
+                assertEquals(expected, Files.mismatch(copy, path2), msg);
             }
         }
     }
@@ -324,9 +325,11 @@ public class Mismatch {
      * @param path2 the path to another file
      * @throws NullPointerException as expected
      */
-    @Test(dataProvider = "testFileNull", priority = 2, expectedExceptions = NullPointerException.class)
+    @ParameterizedTest
+    @MethodSource("getDataForNull")
     public void testMismatchNull(Path path, Path path2) throws Exception {
-        long result = Files.mismatch(path, path2);
+        assertThrows(NullPointerException.class,
+                     () -> Files.mismatch(path, path2));
     }
 
     /**
@@ -335,9 +338,11 @@ public class Mismatch {
      * @param path2 the path to another file
      * @throws IOException as expected
      */
-    @Test(dataProvider = "testFileNotExist", priority = 2, expectedExceptions = IOException.class)
+    @ParameterizedTest
+    @MethodSource("getDataForFileNotExist")
     public void testMismatchNotExist(Path path, Path path2) throws IOException {
-        long result = Files.mismatch(path, path2);
+        assertThrows(IOException.class,
+                     () -> {long result = Files.mismatch(path, path2);});
     }
 
     /**
diff --git a/test/jdk/java/nio/file/Files/ReadWriteString.java b/test/jdk/java/nio/file/Files/ReadWriteString.java
index 8b5241fa1cf..3510f41e979 100644
--- a/test/jdk/java/nio/file/Files/ReadWriteString.java
+++ b/test/jdk/java/nio/file/Files/ReadWriteString.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -27,6 +27,21 @@ import java.nio.charset.Charset;
 import java.nio.charset.CharacterCodingException;
 import java.nio.charset.MalformedInputException;
 import java.nio.charset.UnmappableCharacterException;
+import java.nio.file.Files;
+import java.nio.file.OpenOption;
+import java.nio.file.Path;
+import java.nio.file.Paths;
+import java.util.Arrays;
+import java.util.Random;
+import java.util.concurrent.Callable;
+import java.util.stream.Stream;
+
+import org.junit.jupiter.api.BeforeAll;
+import org.junit.jupiter.api.Test;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.Arguments;
+import org.junit.jupiter.params.provider.MethodSource;
+
 import static java.nio.charset.StandardCharsets.ISO_8859_1;
 import static java.nio.charset.StandardCharsets.US_ASCII;
 import static java.nio.charset.StandardCharsets.UTF_8;
@@ -36,36 +51,31 @@ import static java.nio.charset.StandardCharsets.UTF_16LE;
 import static java.nio.charset.StandardCharsets.UTF_32;
 import static java.nio.charset.StandardCharsets.UTF_32BE;
 import static java.nio.charset.StandardCharsets.UTF_32LE;
-import java.nio.file.Files;
-import java.nio.file.OpenOption;
-import java.nio.file.Path;
-import java.nio.file.Paths;
+
 import static java.nio.file.StandardOpenOption.APPEND;
 import static java.nio.file.StandardOpenOption.CREATE;
-import java.util.Arrays;
-import java.util.Random;
-import java.util.concurrent.Callable;
-import static org.testng.Assert.assertEquals;
-import static org.testng.Assert.assertTrue;
-import static org.testng.Assert.fail;
-import org.testng.annotations.BeforeClass;
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
+
+import static org.junit.jupiter.api.Assertions.assertArrayEquals;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertInstanceOf;
+import static org.junit.jupiter.api.Assertions.assertSame;
+import static org.junit.jupiter.api.Assertions.assertThrows;
+import static org.junit.jupiter.api.Assertions.assertTrue;
+import static org.junit.jupiter.api.Assertions.fail;
 
 /* @test
  * @bug 8201276 8205058 8209576 8287541 8288589 8325590
  * @build ReadWriteString PassThroughFileSystem
- * @run testng ReadWriteString
+ * @run junit ReadWriteString
  * @summary Unit test for methods for Files readString and write methods.
  * @key randomness
  * @modules jdk.charsets
  */
-@Test(groups = "readwrite")
 public class ReadWriteString {
 
     // data for text files
-    final String TEXT_UNICODE = "\u201CHello\u201D";
-    final String TEXT_ASCII = "ABCDEFGHIJKLMNOPQRSTUVWXYZ\n abcdefghijklmnopqrstuvwxyz\n 1234567890\n";
+    final static String TEXT_UNICODE = "\u201CHello\u201D";
+    final static String TEXT_ASCII = "ABCDEFGHIJKLMNOPQRSTUVWXYZ\n abcdefghijklmnopqrstuvwxyz\n 1234567890\n";
     final static String TEXT_PERSON_CART_WHEELING = "\ud83e\udd38";
     private static final String JA_STRING = "\u65e5\u672c\u8a9e\u6587\u5b57\u5217";
     private static final Charset WINDOWS_1252 = Charset.forName("windows-1252");
@@ -85,96 +95,85 @@ public class ReadWriteString {
             return baos.toByteArray();
         } catch (IOException ex) {
             // in case it happens, fail the test
-            throw new RuntimeException(ex);
+            fail(ex);
+            return null; // appease the compiler
         }
     }
 
     // file used by testReadWrite, testReadString and testWriteString
-    private Path[] testFiles = new Path[3];
+    private static Path[] testFiles = new Path[3];
 
     /*
-     * DataProvider for malformed write test. Provides the following fields:
+     * MethodSource for malformed write test. Provides the following fields:
      * file path, malformed input string, charset
      */
-    @DataProvider(name = "malformedWrite")
-    public Object[][] getMalformedWrite() throws IOException {
+    public static Stream<Arguments> getMalformedWrite() throws IOException {
         Path path = Files.createFile(Path.of("malformedWrite"));
-        return new Object[][]{
-            {path, "\ud800", null},  //the default Charset is UTF_8
-            {path, "\u00A0\u00A1", US_ASCII},
-            {path, "\ud800", UTF_8},
-            {path, JA_STRING, ISO_8859_1},
-            {path, "\u041e", WINDOWS_1252}, // cyrillic capital letter O
-            {path, "\u091c", WINDOWS_31J}, // devanagari letter ja
-        };
+        return Stream.of
+            (Arguments.of(path, "\ud800", null),  //the default Charset is UTF_8
+             Arguments.of(path, "\u00A0\u00A1", US_ASCII),
+             Arguments.of(path, "\ud800", UTF_8),
+             Arguments.of(path, JA_STRING, ISO_8859_1),
+             Arguments.of(path, "\u041e", WINDOWS_1252), // cyrillic capital letter O
+             Arguments.of(path, "\u091c", WINDOWS_31J)); // devanagari letter ja
     }
 
     /*
-     * DataProvider for illegal input test
+     * MethodSource for illegal input test
      * Writes the data in ISO8859 and reads with UTF_8, expects MalformedInputException
      */
-    @DataProvider(name = "illegalInput")
-    public Object[][] getIllegalInput() throws IOException {
+    public static Stream<Arguments> getIllegalInput() throws IOException {
         Path path = Files.createFile(Path.of("illegalInput"));
-        return new Object[][]{
-            {path, data, ISO_8859_1, null},
-            {path, data, ISO_8859_1, UTF_8}
-        };
+        return Stream.of(Arguments.of(path, data, ISO_8859_1, null),
+                         Arguments.of(path, data, ISO_8859_1, UTF_8));
     }
 
     /*
-     * DataProvider for illegal input bytes test
+     * MethodSource for illegal input bytes test
      */
-    @DataProvider(name = "illegalInputBytes")
-    public Object[][] getIllegalInputBytes() throws IOException {
-        return new Object[][]{
-            {new byte[] {(byte)0x00, (byte)0x20, (byte)0x00}, UTF_16, MalformedInputException.class},
-            {new byte[] {-50}, UTF_16, MalformedInputException.class},
-            {new byte[] {(byte)0x81}, WINDOWS_1252, UnmappableCharacterException.class}, // unused in Cp1252
-            {new byte[] {(byte)0x81, (byte)0xff}, WINDOWS_31J, UnmappableCharacterException.class}, // invalid trailing byte
-        };
+    public static Stream<Arguments> getIllegalInputBytes() throws IOException {
+        return Stream.of
+            (Arguments.of(new byte[] {(byte)0x00, (byte)0x20, (byte)0x00}, UTF_16, MalformedInputException.class),
+             Arguments.of(new byte[] {-50}, UTF_16, MalformedInputException.class),
+             Arguments.of(new byte[] {(byte)0x81}, WINDOWS_1252, UnmappableCharacterException.class), // unused in Cp1252
+             Arguments.of(new byte[] {(byte)0x81, (byte)0xff}, WINDOWS_31J, UnmappableCharacterException.class)); // invalid trailing byte
     }
 
     /*
-     * DataProvider for writeString test
+     * MethodSource for writeString test
      * Writes the data using both the existing and new method and compares the results.
      */
-    @DataProvider(name = "testWriteString")
-    public Object[][] getWriteString() {
-
-        return new Object[][]{
-            {testFiles[1], testFiles[2], TEXT_ASCII, US_ASCII, null},
-            {testFiles[1], testFiles[2], TEXT_ASCII, US_ASCII, US_ASCII},
-            {testFiles[1], testFiles[2], TEXT_UNICODE, UTF_8, null},
-            {testFiles[1], testFiles[2], TEXT_UNICODE, UTF_8, UTF_8}
-        };
+    public static Stream<Arguments> getWriteString() {
+        return Stream.of
+            (Arguments.of(testFiles[1], testFiles[2], TEXT_ASCII, US_ASCII, null),
+             Arguments.of(testFiles[1], testFiles[2], TEXT_ASCII, US_ASCII, US_ASCII),
+             Arguments.of(testFiles[1], testFiles[2], TEXT_UNICODE, UTF_8, null),
+             Arguments.of(testFiles[1], testFiles[2], TEXT_UNICODE, UTF_8, UTF_8));
     }
 
     /*
-     * DataProvider for readString test
+     * MethodSource for readString test
      * Reads the file using both the existing and new method and compares the results.
      */
-    @DataProvider(name = "testReadString")
-    public Object[][] getReadString() {
-        return new Object[][]{
-            {testFiles[1], TEXT_ASCII, US_ASCII, US_ASCII},
-            {testFiles[1], TEXT_ASCII, US_ASCII, UTF_8},
-            {testFiles[1], TEXT_UNICODE, UTF_8, null},
-            {testFiles[1], TEXT_UNICODE, UTF_8, UTF_8},
-            {testFiles[1], TEXT_ASCII, US_ASCII, ISO_8859_1},
-            {testFiles[1], TEXT_PERSON_CART_WHEELING, UTF_16, UTF_16},
-            {testFiles[1], TEXT_PERSON_CART_WHEELING, UTF_16BE, UTF_16BE},
-            {testFiles[1], TEXT_PERSON_CART_WHEELING, UTF_16LE, UTF_16LE},
-            {testFiles[1], TEXT_PERSON_CART_WHEELING, UTF_32, UTF_32},
-            {testFiles[1], TEXT_PERSON_CART_WHEELING, UTF_32BE, UTF_32BE},
-            {testFiles[1], TEXT_PERSON_CART_WHEELING, UTF_32LE, UTF_32LE},
-            {testFiles[1], TEXT_PERSON_CART_WHEELING, WINDOWS_1252, WINDOWS_1252},
-            {testFiles[1], TEXT_PERSON_CART_WHEELING, WINDOWS_31J, WINDOWS_31J}
-        };
+    public static Stream<Arguments> getReadString() {
+        return Stream.of
+            (Arguments.of(testFiles[1], TEXT_ASCII, US_ASCII, US_ASCII),
+             Arguments.of(testFiles[1], TEXT_ASCII, US_ASCII, UTF_8),
+             Arguments.of(testFiles[1], TEXT_UNICODE, UTF_8, null),
+             Arguments.of(testFiles[1], TEXT_UNICODE, UTF_8, UTF_8),
+             Arguments.of(testFiles[1], TEXT_ASCII, US_ASCII, ISO_8859_1),
+             Arguments.of(testFiles[1], TEXT_PERSON_CART_WHEELING, UTF_16, UTF_16),
+             Arguments.of(testFiles[1], TEXT_PERSON_CART_WHEELING, UTF_16BE, UTF_16BE),
+             Arguments.of(testFiles[1], TEXT_PERSON_CART_WHEELING, UTF_16LE, UTF_16LE),
+             Arguments.of(testFiles[1], TEXT_PERSON_CART_WHEELING, UTF_32, UTF_32),
+             Arguments.of(testFiles[1], TEXT_PERSON_CART_WHEELING, UTF_32BE, UTF_32BE),
+             Arguments.of(testFiles[1], TEXT_PERSON_CART_WHEELING, UTF_32LE, UTF_32LE),
+             Arguments.of(testFiles[1], TEXT_PERSON_CART_WHEELING, WINDOWS_1252, WINDOWS_1252),
+             Arguments.of(testFiles[1], TEXT_PERSON_CART_WHEELING, WINDOWS_31J, WINDOWS_31J));
     }
 
-    @BeforeClass
-    void setup() throws IOException {
+    @BeforeAll
+    static void setup() throws IOException {
         testFiles[0] = Files.createFile(Path.of("readWriteString"));
         testFiles[1] = Files.createFile(Path.of("writeString_file1"));
         testFiles[2] = Files.createFile(Path.of("writeString_file2"));
@@ -225,7 +224,8 @@ public class ReadWriteString {
      * This method compares the results written by the existing write method and
      * the writeString method added since 11.
      */
-    @Test(dataProvider = "testWriteString")
+    @ParameterizedTest
+    @MethodSource("getWriteString")
     public void testWriteString(Path path, Path path2, String text, Charset cs, Charset cs2) throws IOException {
         Files.write(path, text.getBytes(cs));
 
@@ -237,14 +237,15 @@ public class ReadWriteString {
         }
         byte[] bytes = Files.readAllBytes(path);
         byte[] bytes2 = Files.readAllBytes(path2);
-        assertTrue((Arrays.compare(bytes, bytes2) == 0), "The bytes should be the same");
+        assertArrayEquals(bytes2, bytes, "The bytes should be the same");
     }
 
     /**
      * Verifies that the readString method added since 11 behaves the same as
      * constructing a string from the existing readAllBytes method.
      */
-    @Test(dataProvider = "testReadString")
+    @ParameterizedTest
+    @MethodSource("getReadString")
     public void testReadString(Path path, String text, Charset cs, Charset cs2) throws IOException {
         Files.write(path, text.getBytes(cs));
         String str = new String(Files.readAllBytes(path), cs);
@@ -252,7 +253,7 @@ public class ReadWriteString {
         // readString @since 11
         String str2 = (cs2 == null) ? Files.readString(path) :
                                       Files.readString(path, cs2);
-        assertTrue((str.equals(str2)), "The strings should be the same");
+        assertEquals(str, str2, "The strings should be the same");
     }
 
     /**
@@ -264,13 +265,17 @@ public class ReadWriteString {
      * @param cs the Charset
      * @throws IOException if the input is malformed
      */
-    @Test(dataProvider = "malformedWrite", expectedExceptions = UnmappableCharacterException.class)
+    @ParameterizedTest
+    @MethodSource("getMalformedWrite")
     public void testMalformedWrite(Path path, String s, Charset cs) throws IOException {
-        if (cs == null) {
-            Files.writeString(path, s);
-        } else {
-            Files.writeString(path, s, cs);
-        }
+        assertThrows(UnmappableCharacterException.class,
+                     () -> {
+                         if (cs == null) {
+                             Files.writeString(path, s);
+                         } else {
+                             Files.writeString(path, s, cs);
+                         }
+                     });
     }
 
     /**
@@ -283,15 +288,19 @@ public class ReadWriteString {
      * @param csRead the Charset to use for reading the file
      * @throws IOException when the Charset used for reading the file is incorrect
      */
-    @Test(dataProvider = "illegalInput", expectedExceptions = MalformedInputException.class)
+    @ParameterizedTest
+    @MethodSource("getIllegalInput")
     public void testMalformedRead(Path path, byte[] data, Charset csWrite, Charset csRead) throws IOException {
         String temp = new String(data, csWrite);
         Files.writeString(path, temp, csWrite);
-        if (csRead == null) {
-            Files.readString(path);
-        } else {
-            Files.readString(path, csRead);
-        }
+        assertThrows(MalformedInputException.class,
+                     () -> {
+                         if (csRead == null) {
+                             Files.readString(path);
+                         } else {
+                             Files.readString(path, csRead);
+                         }
+                     });
     }
 
     /**
@@ -303,20 +312,19 @@ public class ReadWriteString {
      * @param expected exception class
      * @throws IOException when the Charset used for reading the file is incorrect
      */
-    @Test(dataProvider = "illegalInputBytes")
+    @ParameterizedTest
+    @MethodSource("getIllegalInputBytes")
     public void testMalformedReadBytes(byte[] data, Charset csRead, Class<CharacterCodingException> expected)
             throws IOException {
         Path path = Path.of("illegalInputBytes");
         Files.write(path, data);
         try {
             Files.readString(path, csRead);
-        } catch (MalformedInputException | UnmappableCharacterException e) {
-            if (expected.isInstance(e)) {
-                // success
-                return;
-            }
+        } catch (MalformedInputException e) {
+            assertInstanceOf(MalformedInputException.class, e);
+        } catch (UnmappableCharacterException e) {
+            assertInstanceOf(UnmappableCharacterException.class, e);
         }
-        throw new RuntimeException("An instance of " + expected + " should be thrown");
     }
 
     // Verify File.readString with UTF16 to confirm proper string length and contents.
@@ -326,22 +334,16 @@ public class ReadWriteString {
         String original = "🤸";    // "\ud83e\udd38";
         Files.writeString(testFiles[0], original, UTF_16);
         String actual = Files.readString(testFiles[0], UTF_16);
-        if (!actual.equals(original)) {
+        if (!original.equals(actual)) {
             System.out.printf("expected (%s), was (%s)\n", original, actual);
             System.out.printf("expected UTF_16 bytes: %s\n", Arrays.toString(original.getBytes(UTF_16)));
             System.out.printf("actual UTF_16 bytes: %s\n", Arrays.toString(actual.getBytes(UTF_16)));
         }
-        assertEquals(actual, original, "Round trip string mismatch with multi-byte encoding");
+        assertEquals(original, actual, "Round trip string mismatch with multi-byte encoding");
     }
 
     private void checkNullPointerException(Callable<?> c) {
-        try {
-            c.call();
-            fail("NullPointerException expected");
-        } catch (NullPointerException ignore) {
-        } catch (Exception e) {
-            fail(e + " not expected");
-        }
+        assertThrows(NullPointerException.class, () -> c.call());
     }
 
     private void testReadWrite(int size, Charset cs, boolean append) throws IOException {
@@ -355,14 +357,14 @@ public class ReadWriteString {
         }
 
         //System.out.println(result.toUri().toASCIIString());
-        assertTrue(result == testFiles[0]);
+        assertSame(result, testFiles[0]);
         if (append) {
             if (cs == null) {
                 Files.writeString(testFiles[0], str, APPEND);
             } else {
                 Files.writeString(testFiles[0], str, cs, APPEND);
             }
-            assertTrue(Files.size(testFiles[0]) == size * 2);
+            assertEquals(size * 2, Files.size(testFiles[0]));
         }
 
 
@@ -379,7 +381,7 @@ public class ReadWriteString {
             read = Files.readString(result, cs);
         }
 
-        assertTrue(read.equals(expected), "String read not the same as written");
+        assertEquals(expected, read, "String read not the same as written");
     }
 
     static final char[] CHARS = "abcdefghijklmnopqrstuvwxyz \r\n".toCharArray();
diff --git a/test/jdk/java/nio/file/Files/SetLastModifiedTime.java b/test/jdk/java/nio/file/Files/SetLastModifiedTime.java
index d06b78b2922..c4e5547fb14 100644
--- a/test/jdk/java/nio/file/Files/SetLastModifiedTime.java
+++ b/test/jdk/java/nio/file/Files/SetLastModifiedTime.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2014, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2014, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -27,19 +27,20 @@ import java.nio.file.Path;
 import java.nio.file.Paths;
 import java.nio.file.attribute.FileTime;
 
-import org.testng.annotations.Test;
-import org.testng.annotations.AfterClass;
-import org.testng.annotations.BeforeClass;
+import org.junit.jupiter.api.Test;
+import org.junit.jupiter.api.AfterAll;
+import org.junit.jupiter.api.BeforeAll;
 
-import static org.testng.Assert.assertEquals;
-import static org.testng.Assert.assertTrue;
-import static org.testng.Assert.assertFalse;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertSame;
+import static org.junit.jupiter.api.Assertions.assertThrows;
+import static org.junit.jupiter.api.Assertions.assertTrue;
 
 /**
  * @test
  * @bug 4313887 8062949 8191872
  * @library ..
- * @run testng SetLastModifiedTime
+ * @run junit SetLastModifiedTime
  * @summary Unit test for Files.setLastModifiedTime
  */
 
@@ -47,13 +48,13 @@ public class SetLastModifiedTime {
 
     static Path testDir;
 
-    @BeforeClass
-    void createTestDirectory() throws Exception {
+    @BeforeAll
+    static void createTestDirectory() throws Exception {
         testDir = TestUtil.createTemporaryDirectory();
     }
 
-    @AfterClass
-    void removeTestDirectory() throws Exception {
+    @AfterAll
+    static void removeTestDirectory() throws Exception {
         TestUtil.removeAll(testDir);
     }
 
@@ -65,12 +66,12 @@ public class SetLastModifiedTime {
         FileTime zero = FileTime.fromMillis(0L);
 
         Path result = Files.setLastModifiedTime(path, zero);
-        assertTrue(result == path);
-        assertEquals(Files.getLastModifiedTime(path), zero);
+        assertSame(path, result);
+        assertEquals(zero, Files.getLastModifiedTime(path));
 
         result = Files.setLastModifiedTime(path, now);
-        assertTrue(result == path);
-        assertEquals(Files.getLastModifiedTime(path), now);
+        assertSame(path, result);
+        assertEquals(now, Files.getLastModifiedTime(path));
     }
 
     @Test
@@ -100,20 +101,14 @@ public class SetLastModifiedTime {
         Path path = Paths.get("foo");
         FileTime zero = FileTime.fromMillis(0L);
 
-        try {
-            Files.setLastModifiedTime(null, zero);
-            assertTrue(false);
-        } catch (NullPointerException expected) { }
+        assertThrows(NullPointerException.class,
+                     () -> Files.setLastModifiedTime(null, zero));
 
-        try {
-            Files.setLastModifiedTime(path, null);
-            assertTrue(false);
-        } catch (NullPointerException expected) { }
+        assertThrows(NullPointerException.class,
+                     () -> Files.setLastModifiedTime(path, null));
 
-        try {
-            Files.setLastModifiedTime(null, null);
-            assertTrue(false);
-        } catch (NullPointerException expected) { }
+        assertThrows(NullPointerException.class,
+                     () -> Files.setLastModifiedTime(null, null));
     }
 
     @Test
@@ -127,7 +122,7 @@ public class SetLastModifiedTime {
         long nioTime = Files.getLastModifiedTime(path).toMillis();
         assertTrue(ioTime == timeMillis || ioTime == 1000*(timeMillis/1000),
             "File.lastModified() not in {time, 1000*(time/1000)}");
-        assertEquals(nioTime, ioTime,
+        assertEquals(ioTime, nioTime,
             "File.lastModified() != Files.getLastModifiedTime().toMillis()");
     }
 }
diff --git a/test/jdk/java/nio/file/Files/StreamTest.java b/test/jdk/java/nio/file/Files/StreamTest.java
index 0c93a622322..e9e6195ec0a 100644
--- a/test/jdk/java/nio/file/Files/StreamTest.java
+++ b/test/jdk/java/nio/file/Files/StreamTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2013, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2013, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,7 +25,7 @@
  * @bug 8006884 8019526 8132539
  * @library ..
  * @build PassThroughFileSystem FaultyFileSystem
- * @run testng StreamTest
+ * @run junit StreamTest
  * @summary Unit test for java.nio.file.Files methods that return a Stream
  */
 
@@ -35,9 +35,9 @@ import java.nio.charset.Charset;
 import java.nio.charset.MalformedInputException;
 import java.nio.file.DirectoryIteratorException;
 import java.nio.file.DirectoryStream;
+import java.nio.file.Files;
 import java.nio.file.FileSystemLoopException;
 import java.nio.file.FileVisitOption;
-import java.nio.file.Files;
 import java.nio.file.NoSuchFileException;
 import java.nio.file.Path;
 import java.nio.file.Paths;
@@ -51,14 +51,23 @@ import java.util.Set;
 import java.util.TreeSet;
 import java.util.concurrent.Callable;
 import java.util.function.BiPredicate;
-import java.util.stream.Stream;
 import java.util.stream.Collectors;
-import org.testng.annotations.AfterClass;
-import org.testng.annotations.BeforeClass;
-import org.testng.annotations.Test;
-import static org.testng.Assert.*;
+import java.util.stream.Stream;
+
+import org.junit.jupiter.api.AfterAll;
+import org.junit.jupiter.api.BeforeAll;
+import org.junit.jupiter.api.Test;
+import org.junit.jupiter.api.condition.EnabledOnOs;
+import org.junit.jupiter.api.condition.OS;
+
+import static org.junit.jupiter.api.Assertions.assertArrayEquals;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertInstanceOf;
+import static org.junit.jupiter.api.Assertions.assertNotEquals;
+import static org.junit.jupiter.api.Assertions.assertThrows;
+import static org.junit.jupiter.api.Assertions.assertTrue;
+import static org.junit.jupiter.api.Assertions.fail;
 
-@Test(groups = "unit")
 public class StreamTest {
     /**
      * Default test folder
@@ -77,8 +86,8 @@ public class StreamTest {
     static Path[] all;
     static Path[] allFollowLinks;
 
-    @BeforeClass
-    void setupTestFolder() throws IOException {
+    @BeforeAll
+    static void setupTestFolder() throws IOException {
         testFolder = TestUtil.createTemporaryDirectory();
         supportsSymbolicLinks = TestUtil.supportsSymbolicLinks(testFolder);
         TreeSet<Path> set = new TreeSet<>();
@@ -133,53 +142,57 @@ public class StreamTest {
         allFollowLinks = set.toArray(new Path[0]);
     }
 
-    @AfterClass
-    void cleanupTestFolder() throws IOException {
+    @AfterAll
+    static void cleanupTestFolder() throws IOException {
         TestUtil.removeAll(testFolder);
     }
 
+    @Test
     public void testBasic() {
         try (Stream<Path> s = Files.list(testFolder)) {
             Object[] actual = s.sorted().toArray();
-            assertEquals(actual, level1);
+            assertArrayEquals(level1, actual);
         } catch (IOException ioe) {
             fail("Unexpected IOException");
         }
 
         try (Stream<Path> s = Files.list(testFolder.resolve("empty"))) {
             int count = s.mapToInt(p -> 1).reduce(0, Integer::sum);
-            assertEquals(count, 0, "Expect empty stream.");
+            assertEquals(0, count, "Expect empty stream.");
         } catch (IOException ioe) {
             fail("Unexpected IOException");
         }
     }
 
+    @Test
     public void testWalk() {
         try (Stream<Path> s = Files.walk(testFolder)) {
             Object[] actual = s.sorted().toArray();
-            assertEquals(actual, all);
+            assertArrayEquals(all, actual);
         } catch (IOException ioe) {
             fail("Unexpected IOException");
         }
     }
 
+    @Test
     public void testWalkOneLevel() {
         try (Stream<Path> s = Files.walk(testFolder, 1)) {
             Object[] actual = s.filter(path -> ! path.equals(testFolder))
                                .sorted()
                                .toArray();
-            assertEquals(actual, level1);
+            assertArrayEquals(level1, actual);
         } catch (IOException ioe) {
             fail("Unexpected IOException");
         }
     }
 
+    @Test
     public void testWalkFollowLink() {
         // If link is not supported, the directory structure won't have link.
         // We still want to test the behavior with FOLLOW_LINKS option.
         try (Stream<Path> s = Files.walk(testFolder, FileVisitOption.FOLLOW_LINKS)) {
             Object[] actual = s.sorted().toArray();
-            assertEquals(actual, allFollowLinks);
+            assertArrayEquals(allFollowLinks, actual);
         } catch (IOException ioe) {
             fail("Unexpected IOException");
         }
@@ -211,6 +224,7 @@ public class StreamTest {
         }
     }
 
+    @Test
     public void testWalkFollowLinkLoop() {
         if (!supportsSymbolicLinks) {
             return;
@@ -257,6 +271,7 @@ public class StreamTest {
                     dir2.resolve(Paths.get("lnDir", "lnDir2")));
             validateFileSystemLoopException(linkdir,
                     linkdir.resolve(Paths.get("lnDir2", "lnDir")));
+            Files.delete(cause);
         } catch(IOException ioe) {
             fail("Unexpected IOException " + ioe);
         }
@@ -280,44 +295,46 @@ public class StreamTest {
         }
     }
 
+    @Test
     public void testFind() throws IOException {
         PathBiPredicate pred = new PathBiPredicate((path, attrs) -> true);
 
         try (Stream<Path> s = Files.find(testFolder, Integer.MAX_VALUE, pred)) {
             Set<Path> result = s.collect(Collectors.toCollection(TreeSet::new));
-            assertEquals(pred.visited(), all);
-            assertEquals(result.toArray(new Path[0]), pred.visited());
+            assertArrayEquals(all, pred.visited());
+            assertArrayEquals(pred.visited(), result.toArray(new Path[0]));
         }
 
         pred = new PathBiPredicate((path, attrs) -> attrs.isSymbolicLink());
         try (Stream<Path> s = Files.find(testFolder, Integer.MAX_VALUE, pred)) {
             s.forEach(path -> assertTrue(Files.isSymbolicLink(path)));
-            assertEquals(pred.visited(), all);
+            assertArrayEquals(all, pred.visited());
         }
 
         pred = new PathBiPredicate((path, attrs) ->
             path.getFileName().toString().startsWith("e"));
         try (Stream<Path> s = Files.find(testFolder, Integer.MAX_VALUE, pred)) {
             s.forEach(path -> assertEquals(path.getFileName().toString(), "empty"));
-            assertEquals(pred.visited(), all);
+            assertArrayEquals(all, pred.visited());
         }
 
         pred = new PathBiPredicate((path, attrs) ->
             path.getFileName().toString().startsWith("l") && attrs.isRegularFile());
         try (Stream<Path> s = Files.find(testFolder, Integer.MAX_VALUE, pred)) {
             s.forEach(path -> fail("Expect empty stream"));
-            assertEquals(pred.visited(), all);
+            assertArrayEquals(all, pred.visited());
         }
     }
 
     // Test borrowed from BytesAndLines
+    @Test
     public void testLines() throws IOException {
         final Charset US_ASCII = Charset.forName("US-ASCII");
         Path tmpfile = Files.createTempFile("blah", "txt");
 
         try {
             // zero lines
-            assertTrue(Files.size(tmpfile) == 0, "File should be empty");
+            assertEquals(0, Files.size(tmpfile), "File should be empty");
             try (Stream<String> s = Files.lines(tmpfile)) {
                 checkLines(s, Collections.emptyList());
             }
@@ -367,31 +384,21 @@ public class StreamTest {
 
     private void checkLines(Stream<String> s, List<String> expected) {
         List<String> lines = s.collect(Collectors.toList());
-        assertTrue(lines.size() == expected.size(), "Unexpected number of lines");
+        assertEquals(expected.size(), lines.size(), "Unexpected number of lines");
         assertTrue(lines.equals(expected), "Unexpected content");
     }
 
     private void checkMalformedInputException(Stream<String> s) {
-        try {
-            List<String> lines = s.collect(Collectors.toList());
-            fail("UncheckedIOException expected");
-        } catch (UncheckedIOException ex) {
-            IOException cause = ex.getCause();
-            assertTrue(cause instanceof MalformedInputException,
-                "MalformedInputException expected");
-        }
+            assertThrows(UncheckedIOException.class,
+                         () -> s.collect(Collectors.toList()),
+                         "MalformedInputException expected");
     }
 
     private void checkNullPointerException(Callable<?> c) {
-        try {
-            c.call();
-            fail("NullPointerException expected");
-        } catch (NullPointerException ignore) {
-        } catch (Exception e) {
-            fail(e + " not expected");
-        }
+        assertThrows(NullPointerException.class, () -> c.call());
     }
 
+    @Test
     public void testDirectoryIteratorException() throws IOException {
         Path dir = testFolder.resolve("dir2");
         Path trigger = dir.resolve("DirectoryIteratorException");
@@ -404,22 +411,21 @@ public class StreamTest {
             Path fakeRoot = fs.getRoot();
             try {
                 try (Stream<Path> s = Files.list(fakeRoot)) {
-                    s.forEach(path -> assertEquals(path.getFileName().toString(), "DirectoryIteratorException"));
+                    s.forEach(path -> assertEquals("DirectoryIteratorException", path.getFileName().toString()));
                 }
             } catch (UncheckedIOException uioe) {
                 fail("Unexpected exception.");
             }
 
             fsp.setFaultyMode(true);
-            try {
-                try (DirectoryStream<Path> ds = Files.newDirectoryStream(fakeRoot)) {
-                    Iterator<Path> itor = ds.iterator();
-                    while (itor.hasNext()) {
-                        itor.next();
-                    }
-                }
-                fail("Shoule throw DirectoryIteratorException");
-            } catch (DirectoryIteratorException die) {
+            try (DirectoryStream<Path> ds = Files.newDirectoryStream(fakeRoot)) {
+                Iterator<Path> itor = ds.iterator();
+                assertThrows(DirectoryIteratorException.class,
+                             () -> {
+                                 while (itor.hasNext()) {
+                                     itor.next();
+                                 }
+                             });
             }
 
             try {
@@ -427,7 +433,8 @@ public class StreamTest {
                     s.forEach(path -> fail("should not get here"));
                 }
             } catch (UncheckedIOException uioe) {
-                assertTrue(uioe.getCause() instanceof FaultyFileSystem.FaultyException);
+                assertInstanceOf(FaultyFileSystem.FaultyException.class,
+                                 uioe.getCause());
             } catch (DirectoryIteratorException die) {
                 fail("Should have been converted into UncheckedIOException.");
             }
@@ -440,6 +447,7 @@ public class StreamTest {
         }
     }
 
+    @Test
     public void testUncheckedIOException() throws IOException {
         Path triggerFile = testFolder.resolve(Paths.get("dir2", "IOException"));
         Files.createFile(triggerFile);
@@ -454,21 +462,22 @@ public class StreamTest {
             Path fakeRoot = fs.getRoot();
             try (Stream<Path> s = Files.list(fakeRoot.resolve("dir2"))) {
                 // only one file
-                s.forEach(path -> assertEquals(path.getFileName().toString(), "IOException"));
+                s.forEach(path -> assertEquals("IOException", path.getFileName().toString()));
             }
 
             try (Stream<Path> s = Files.walk(fakeRoot.resolve("empty"))) {
                 String[] result = s.map(path -> path.getFileName().toString())
                                    .toArray(String[]::new);
                 // ordered as depth-first
-                assertEquals(result, new String[] { "empty", "IOException", "file"});
+                assertArrayEquals(new String[] { "empty", "IOException", "file"}, result);
             }
 
             fsp.setFaultyMode(true);
             try (Stream<Path> s = Files.list(fakeRoot.resolve("dir2"))) {
                 s.forEach(path -> fail("should have caused exception"));
             } catch (UncheckedIOException uioe) {
-                assertTrue(uioe.getCause() instanceof FaultyFileSystem.FaultyException);
+                assertInstanceOf(FaultyFileSystem.FaultyException.class,
+                                 uioe.getCause());
             }
 
             try (Stream<Path> s = Files.walk(fakeRoot.resolve("empty"))) {
@@ -476,7 +485,8 @@ public class StreamTest {
                                    .toArray(String[]::new);
                 fail("should not reach here due to IOException");
             } catch (UncheckedIOException uioe) {
-                assertTrue(uioe.getCause() instanceof FaultyFileSystem.FaultyException);
+                assertInstanceOf(FaultyFileSystem.FaultyException.class,
+                                 uioe.getCause());
             }
 
             try (Stream<Path> s = Files.walk(
@@ -486,7 +496,7 @@ public class StreamTest {
                                    .toArray(String[]::new);
                 fail("should not reach here due to IOException");
             } catch (IOException ioe) {
-                assertTrue(ioe instanceof FaultyFileSystem.FaultyException);
+                assertInstanceOf(FaultyFileSystem.FaultyException.class, ioe);
             } catch (UncheckedIOException ex) {
                 fail("Top level should be repored as is");
             }
@@ -500,52 +510,47 @@ public class StreamTest {
         }
     }
 
+    @Test
     public void testConstructException() {
         try (Stream<String> s = Files.lines(testFolder.resolve("notExist"), Charset.forName("UTF-8"))) {
-            s.forEach(l -> fail("File is not even exist!"));
+            s.forEach(l -> fail("File does not even exist!"));
         } catch (IOException ioe) {
-            assertTrue(ioe instanceof NoSuchFileException);
+            assertInstanceOf(NoSuchFileException.class, ioe);
         }
     }
 
+    @Test
     public void testClosedStream() throws IOException {
         try (Stream<Path> s = Files.list(testFolder)) {
             s.close();
-            Object[] actual = s.sorted().toArray();
-            fail("Operate on closed stream should throw IllegalStateException");
-        } catch (IllegalStateException ex) {
-            // expected
+            assertThrows(IllegalStateException.class,
+                         () -> s.sorted().toArray());
         }
 
         try (Stream<Path> s = Files.walk(testFolder)) {
             s.close();
-            Object[] actual = s.sorted().toArray();
-            fail("Operate on closed stream should throw IllegalStateException");
-        } catch (IllegalStateException ex) {
-            // expected
+            assertThrows(IllegalStateException.class,
+                         () -> s.sorted().toArray());
         }
 
         try (Stream<Path> s = Files.find(testFolder, Integer.MAX_VALUE,
                     (p, attr) -> true)) {
             s.close();
-            Object[] actual = s.sorted().toArray();
-            fail("Operate on closed stream should throw IllegalStateException");
-        } catch (IllegalStateException ex) {
-            // expected
+            assertThrows(IllegalStateException.class,
+                         () -> s.sorted().toArray());
         }
     }
 
+    @Test
+    @EnabledOnOs(OS.LINUX)
     public void testProcFile() throws IOException {
-        if (System.getProperty("os.name").equals("Linux")) {
-            Path path = Paths.get("/proc/cpuinfo");
-            if (Files.exists(path)) {
-                String NEW_LINE = System.getProperty("line.separator");
-                String s =
-                    Files.lines(path).collect(Collectors.joining(NEW_LINE));
-                if (s.length() == 0) {
-                    fail("Files.lines(\"" + path + "\") returns no data");
-                }
-            }
+        Path path = Paths.get("/proc/cpuinfo");
+        if (Files.exists(path)) {
+            String NEW_LINE = System.getProperty("line.separator");
+            String s =
+                Files.lines(path).collect(Collectors.joining(NEW_LINE));
+            assertNotEquals(0, s.length(),
+                            "Files.lines(\"" + path + "\") returns no data");
         }
     }
 }
diff --git a/test/jdk/java/nio/file/Files/SubstDrive.java b/test/jdk/java/nio/file/Files/SubstDrive.java
index 94fdeadcef3..fd21b9f007e 100644
--- a/test/jdk/java/nio/file/Files/SubstDrive.java
+++ b/test/jdk/java/nio/file/Files/SubstDrive.java
@@ -1,6 +1,6 @@
 /*
  * Copyright (c) 2020 Microsoft Corporation. All rights reserved.
- * Copyright (c) 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2024, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,32 +23,35 @@
  *
  */
 
+import java.io.ByteArrayOutputStream;
+import java.io.IOException;
+import java.io.PrintStream;
+import java.io.UnsupportedEncodingException;
+import java.nio.charset.StandardCharsets;
+import java.nio.file.*;
 import java.util.Map;
 import java.util.Optional;
 import java.util.stream.Stream;
-import java.io.IOException;
-import java.io.UnsupportedEncodingException;
-import java.io.ByteArrayOutputStream;
-import java.io.PrintStream;
-import java.nio.charset.StandardCharsets;
-import java.nio.file.*;
-
-import static org.testng.Assert.*;
-import org.testng.annotations.BeforeClass;
-import org.testng.annotations.AfterClass;
-import org.testng.annotations.AfterMethod;
-import org.testng.annotations.Test;
-import org.testng.SkipException;
 
 import jdk.test.lib.process.ProcessTools;
 import jdk.test.lib.process.OutputAnalyzer;
 
+import org.junit.jupiter.api.BeforeAll;
+import org.junit.jupiter.api.AfterAll;
+import org.junit.jupiter.api.AfterEach;
+import org.junit.jupiter.api.Assumptions;
+import org.junit.jupiter.api.Test;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertFalse;
+import static org.junit.jupiter.api.Assertions.assertTrue;
+
 /* @test
  * @summary Test Files' public APIs with drives created using the subst command on Windows.
  * @requires (os.family == "windows")
  * @library /test/lib ..
  * @build SubstDrive
- * @run testng SubstDrive
+ * @run junit SubstDrive
  */
 public class SubstDrive {
 
@@ -62,26 +65,24 @@ public class SubstDrive {
      *        deleted when the test finishes.
      *      + Find a drive that is available for use with subst.
      */
-    @BeforeClass
-    public void setup() throws IOException {
+    @BeforeAll
+    public static void setup() throws IOException {
         TEST_TEMP_DIRECTORY = Files.createTempDirectory("tmp");
-        System.out.printf("Test directory is at %s\n", TEST_TEMP_DIRECTORY);
+        System.err.printf("Test directory is at %s\n", TEST_TEMP_DIRECTORY);
 
         Optional<Path> substDrive = findAvailableDrive(TEST_TEMP_DIRECTORY);
-        if (!substDrive.isPresent()) {
-            throw new SkipException(
-                "Could not find any available drive to use with subst, skipping the tests");
-        }
+        Assumptions.assumeTrue(substDrive.isPresent(),
+                               "Could not find any available drive to use with subst");
         SUBST_DRIVE = substDrive.get();
-        System.out.printf("Using drive %s\n with subst", SUBST_DRIVE);
+        System.err.printf("Using drive %s\n with subst", SUBST_DRIVE);
     }
 
     /**
      * Delete the root temporary directory together with all of its contents
      * when all tests finish.
      */
-    @AfterClass
-    public void removeRootTempDirectory() throws IOException {
+    @AfterAll
+    public static void removeRootTempDirectory() throws IOException {
         TestUtil.removeAll(TEST_TEMP_DIRECTORY);
     }
 
@@ -90,7 +91,7 @@ public class SubstDrive {
      * unmap the drive after every test so that subsequent ones can reuse
      * the drive.
      */
-    @AfterMethod
+    @AfterEach
     public void deleteSubstDrive() throws IOException {
         Stream<String> substitutedDrives = substFindMappedDrives();
         // Only delete `SUBST_DRIVE` if it is currently being substituted
@@ -114,7 +115,7 @@ public class SubstDrive {
         assertTrue(Files.exists(p));
 
         Files.writeString(p, fileContents);
-        assertEquals(Files.readString(p), fileContents);
+        assertEquals(fileContents, Files.readString(p));
     }
 
     /**
@@ -193,7 +194,7 @@ public class SubstDrive {
 
         Map<String, Object> attr1 = Files.readAttributes(SUBST_DRIVE, "*");
         Map<String, Object> attr2 = Files.readAttributes(tempDirectory, "*");
-        assertEquals(attr1, attr2);
+        assertEquals(attr2, attr1);
     }
 
     /**
@@ -287,19 +288,19 @@ public class SubstDrive {
         Path tempFile = Path.of(SUBST_DRIVE.toString(), "test.txt");
         String contents = "Hello world!";
         Files.writeString(tempFile, contents);
-        assertEquals(Files.readString(tempFile), contents);
+        assertEquals(contents, Files.readString(tempFile));
 
         Path link = Path.of(SUBST_DRIVE.toString(), "link");
         Files.createSymbolicLink(link, tempFile);
 
-        assertEquals(Files.readString(link), contents);
-        assertEquals(Files.isExecutable(link), Files.isExecutable(tempFile));
-        assertEquals(Files.isReadable(link), Files.isReadable(tempFile));
-        assertEquals(Files.isDirectory(link), Files.isDirectory(tempFile));
-        assertEquals(Files.isHidden(link), Files.isHidden(tempFile));
-        assertEquals(Files.isRegularFile(link), Files.isRegularFile(tempFile));
-        assertEquals(Files.isWritable(link), Files.isWritable(tempFile));
-        assertEquals(Files.getOwner(link), Files.getOwner(tempFile));
+        assertEquals(contents, Files.readString(link));
+        assertEquals(Files.isExecutable(tempFile), Files.isExecutable(link));
+        assertEquals(Files.isReadable(tempFile), Files.isReadable(link));
+        assertEquals(Files.isDirectory(tempFile), Files.isDirectory(link));
+        assertEquals(Files.isHidden(tempFile), Files.isHidden(link));
+        assertEquals(Files.isRegularFile(tempFile), Files.isRegularFile(link));
+        assertEquals(Files.isWritable(tempFile), Files.isWritable(link));
+        assertEquals(Files.getOwner(tempFile), Files.getOwner(link));
     }
 
     /**
@@ -319,16 +320,15 @@ public class SubstDrive {
 
         substCreate(SUBST_DRIVE, tempLink);
 
-        assertEquals(
-            Files.readAttributes(SUBST_DRIVE, "*"),
-            Files.readAttributes(tempDirectory, "*"));
+        assertTrue(Files.readAttributes(tempDirectory, "*")
+                   .equals(Files.readAttributes(SUBST_DRIVE, "*")));
 
         assertTrue(Files.isWritable(SUBST_DRIVE));
 
         Path tempFile = Files.createTempFile(SUBST_DRIVE, "prefix", "suffix");
         String contents = "Hello world!";
         Files.writeString(tempFile, contents);
-        assertEquals(Files.readString(tempFile), contents);
+        assertEquals(contents, Files.readString(tempFile));
 
         Path tempDirectory2 = Files.createTempDirectory(TEST_TEMP_DIRECTORY, "tmp");
         Path copy = Path.of(tempDirectory2.toString(), "copied");
@@ -341,7 +341,7 @@ public class SubstDrive {
         Files.move(tempFile, cut);
         assertTrue(Files.notExists(tempFile));
         assertTrue(Files.exists(cut));
-        assertEquals(Files.readString(cut), contents);
+        assertEquals(contents, Files.readString(cut));
     }
 
     /**
@@ -361,9 +361,8 @@ public class SubstDrive {
 
         substCreate(SUBST_DRIVE, tempLink);
 
-        assertEquals(
-            Files.readAttributes(SUBST_DRIVE, "*"),
-            Files.readAttributes(tempDirectory, "*"));
+        assertTrue(Files.readAttributes(tempDirectory, "*")
+                   .equals(Files.readAttributes(SUBST_DRIVE, "*")));
 
         assertTrue(Files.isWritable(SUBST_DRIVE));
     }
@@ -372,7 +371,7 @@ public class SubstDrive {
      * Run a command and optionally prints stdout contents to
      * `customOutputStream`.
      */
-    private void runCmd(ProcessBuilder pb, PrintStream customOutputStream) {
+    private static void runCmd(ProcessBuilder pb, PrintStream customOutputStream) {
         try {
             PrintStream ps = customOutputStream != null ?
                                     customOutputStream :
@@ -383,8 +382,8 @@ public class SubstDrive {
 
             int exitCode = outputAnalyzer.getExitValue();
             assertEquals(
-                exitCode /* actual value */,
                 0        /* expected value */,
+                exitCode /* actual value */,
                 String.format(
                     "Command `%s` failed with exit code %d",
                     pb.command(),
@@ -402,7 +401,7 @@ public class SubstDrive {
      * For reference, see:
      * https://docs.microsoft.com/en-us/windows-server/administration/windows-commands/subst
      */
-    private void substCreate(Path drive, Path path) {
+    private static void substCreate(Path drive, Path path) {
         runCmd(
             new ProcessBuilder(
                 "cmd", "/c", "subst", drive.toString(), path.toString()),
@@ -414,7 +413,7 @@ public class SubstDrive {
      * For reference, see:
      * https://docs.microsoft.com/en-us/windows-server/administration/windows-commands/subst
      */
-    private void substDelete(Path drive) throws IOException {
+    private static void substDelete(Path drive) throws IOException {
         runCmd(
             new ProcessBuilder(
                 "cmd", "/c", "subst", drive.toString(), "/D"),
@@ -454,7 +453,7 @@ public class SubstDrive {
      * subst can fail if the drive to be mapped already exists. The method returns
      * a drive that is available.
      */
-    private Optional<Path> findAvailableDrive(Path tempDirectory) {
+    private static Optional<Path> findAvailableDrive(Path tempDirectory) {
         for (char letter = 'Z'; letter >= 'A'; letter--) {
             try {
                 Path p = Path.of(letter + ":");
diff --git a/test/jdk/java/nio/file/Files/walkFileTree/FindTest.java b/test/jdk/java/nio/file/Files/walkFileTree/FindTest.java
index 9fb16a7b14c..beacee44bbb 100644
--- a/test/jdk/java/nio/file/Files/walkFileTree/FindTest.java
+++ b/test/jdk/java/nio/file/Files/walkFileTree/FindTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2012, 2017, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2012, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -34,15 +34,15 @@
  *        jdk.test.lib.Platform
  *        jdk.test.lib.process.*
  *        CreateFileTree
- * @run testng/othervm -Djava.io.tmpdir=. FindTest
+ * @run junit/othervm -Djava.io.tmpdir=. FindTest
  */
 
 import java.io.IOException;
+import java.nio.file.Files;
 import java.nio.file.FileSystemLoopException;
 import java.nio.file.FileVisitOption;
-import java.nio.file.FileVisitResult;
 import java.nio.file.FileVisitor;
-import java.nio.file.Files;
+import java.nio.file.FileVisitResult;
 import java.nio.file.Path;
 import java.nio.file.attribute.BasicFileAttributes;
 import java.util.ArrayList;
@@ -56,11 +56,11 @@ import java.util.stream.Collectors;
 import jdk.test.lib.process.OutputAnalyzer;
 import jdk.test.lib.process.ProcessTools;
 
-import org.testng.annotations.BeforeClass;
-import org.testng.annotations.Test;
+import org.junit.jupiter.api.BeforeAll;
+import org.junit.jupiter.api.Test;
 
-import static org.testng.Assert.assertEquals;
-import static org.testng.Assert.assertTrue;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertTrue;
 
 public class FindTest {
 
@@ -69,7 +69,7 @@ public class FindTest {
     private static Path top;
     private static String TOP;
 
-    @BeforeClass
+    @BeforeAll
     public static void createFileTree() throws Exception {
         top = CreateFileTree.create();
         TOP = top.toAbsolutePath().toString();
@@ -107,7 +107,7 @@ public class FindTest {
             throws IOException {
         List<String> expectedList = Arrays.asList(expected.getStdout()
                                           .split(System.lineSeparator()));
-        assertEquals(actual.size(), expectedList.size());
+        assertEquals(expectedList.size(), actual.size());
         assertTrue(actual.removeAll(expectedList));
     }
 
diff --git a/test/jdk/java/nio/file/spi/TestDelegation.java b/test/jdk/java/nio/file/spi/TestDelegation.java
index 0b9bc9de7f7..f09b636c156 100644
--- a/test/jdk/java/nio/file/spi/TestDelegation.java
+++ b/test/jdk/java/nio/file/spi/TestDelegation.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2022, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2022, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -21,11 +21,6 @@
  * questions.
  */
 
-import org.testng.annotations.BeforeClass;
-import org.testng.annotations.BeforeMethod;
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
-
 import java.io.IOException;
 import java.net.URI;
 import java.nio.file.*;
@@ -34,26 +29,34 @@ import java.util.ArrayList;
 import java.util.HashMap;
 import java.util.List;
 import java.util.Map;
+import java.util.stream.Stream;
 
-import static org.testng.AssertJUnit.assertEquals;
+import org.junit.jupiter.api.BeforeAll;
+import org.junit.jupiter.api.BeforeEach;
+import org.junit.jupiter.api.Test;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.Arguments;
+import org.junit.jupiter.params.provider.MethodSource;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
 
 /**
  * @test
  * @summary Verifies that a FileSystemProvider's implementation of the exists
  * and readAttributesIfExists methods are invoked
  * @compile testfsp/testfsp/TestProvider.java
- * @run testng TestDelegation
+ * @run junit TestDelegation
  */
 public class TestDelegation {
 
     // Non-existent Path to be used by the test
-    private Path nonExistentFile;
+    private static Path nonExistentFile;
     // Path to Temp directory used by the test
-    private Path tempDirectory;
+    private static Path tempDirectory;
     // Valid file Path used by the test
-    private Path fileThatExists;
+    private static Path fileThatExists;
     // The FileSystemProvider used by the test
-    private MyProvider myProvider;
+    private static MyProvider myProvider;
 
     /**
      * Create the FileSystemProvider, the FileSystem and
@@ -61,8 +64,8 @@ public class TestDelegation {
      *
      * @throws IOException if an error occurs
      */
-    @BeforeClass
-    public void setup() throws IOException {
+    @BeforeAll
+    public static void setup() throws IOException {
         myProvider = new MyProvider();
         FileSystem fs = myProvider.getFileSystem(URI.create("/"));
         // Path to Current Working Directory
@@ -73,7 +76,7 @@ public class TestDelegation {
     }
 
     /**
-     * DataProvider that is used to test Files::exists. The DataProvider's
+     * MethodSource that is used to test Files::exists. The Arguments'
      * elements are:
      * <UL>
      *     <li>Path to validate</li>
@@ -81,17 +84,14 @@ public class TestDelegation {
      * </UL>
      * @return The test parameter data
      */
-    @DataProvider
-    private Object[][] testExists() {
-        return new Object[][]{
-                {tempDirectory, true},
-                {fileThatExists, true},
-                {nonExistentFile, false}
-        };
+    private static Stream<Arguments> testExists() {
+        return Stream.of(Arguments.of(tempDirectory, true),
+                         Arguments.of(fileThatExists, true),
+                         Arguments.of(nonExistentFile, false));
     }
 
     /**
-     * DataProvider that is used to test Files::isDirectory. The DataProvider's
+     * MethodSource that is used to test Files::isDirectory. The Arguments'
      * elements are:
      * <UL>
      *     <li>Path to validate</li>
@@ -99,16 +99,13 @@ public class TestDelegation {
      * </UL>
      * @return The test parameter data
      */
-    @DataProvider
-    private Object[][] testIsDirectory() {
-        return new Object[][]{
-                {tempDirectory, true},
-                {fileThatExists, false},
-                {nonExistentFile, false}
-        };
+    private static Stream<Arguments> testIsDirectory() {
+        return Stream.of(Arguments.of(tempDirectory, true),
+                         Arguments.of(fileThatExists, false),
+                         Arguments.of(nonExistentFile, false));
     }
     /**
-     * DataProvider that is used to test Files::isRegularFile. The DataProvider's
+     * MethodSource that is used to test Files::isRegularFile. The MethodSource's
      * elements are:
      * <UL>
      *     <li>Path to validate</li>
@@ -116,19 +113,16 @@ public class TestDelegation {
      * </UL>
      * @return The test parameter data
      */
-    @DataProvider
-    private Object[][] testIsRegularFile() {
-        return new Object[][]{
-                {tempDirectory, false},
-                {fileThatExists, true},
-                {nonExistentFile, false}
-        };
+    private static Stream<Arguments> testIsRegularFile() {
+        return Stream.of(Arguments.of(tempDirectory, false),
+                         Arguments.of(fileThatExists, true),
+                         Arguments.of(nonExistentFile, false));
     }
 
     /**
      * Clear our Map prior to each test run
      */
-    @BeforeMethod
+    @BeforeEach
     public void resetParams() {
         myProvider.resetCalls();
     }
@@ -140,9 +134,10 @@ public class TestDelegation {
      * @param p      the path to the file to test
      * @param exists does the path exist
      */
-    @Test(dataProvider = "testExists")
+    @ParameterizedTest
+    @MethodSource("testExists")
     public void testExists(Path p, boolean exists) {
-        assertEquals(Files.exists(p), exists);
+        assertEquals(exists, Files.exists(p));
         // We should only have called exists once
         assertEquals(1, myProvider.findCall("exists").size());
         assertEquals(0, myProvider.findCall("readAttributesIfExists").size());
@@ -155,9 +150,10 @@ public class TestDelegation {
      * @param p      the path to the file to test
      * @param isDir  is the path a directory
      */
-    @Test(dataProvider = "testIsDirectory")
+    @ParameterizedTest
+    @MethodSource("testIsDirectory")
     public void testIsDirectory(Path p, boolean isDir) {
-        assertEquals(Files.isDirectory(p), isDir);
+        assertEquals(isDir, Files.isDirectory(p));
         // We should only have called readAttributesIfExists once
         assertEquals(0, myProvider.findCall("exists").size());
         assertEquals(1, myProvider.findCall("readAttributesIfExists").size());
@@ -170,9 +166,10 @@ public class TestDelegation {
      * @param p      the path to the file to test
      * @param isFile is the path a regular file
      */
-    @Test(dataProvider = "testIsRegularFile")
+    @ParameterizedTest
+    @MethodSource("testIsRegularFile")
     public void testIsRegularFile(Path p, boolean isFile) {
-        assertEquals(Files.isRegularFile(p), isFile);
+        assertEquals(isFile, Files.isRegularFile(p));
         // We should only have called readAttributesIfExists once
         assertEquals(0, myProvider.findCall("exists").size());
         assertEquals(1, myProvider.findCall("readAttributesIfExists").size());

From 9dc3f488b4da333f436fcdddb92b34ec9dbbb925 Mon Sep 17 00:00:00 2001
From: Mohamed Issa <missa@openjdk.org>
Date: Mon, 16 Mar 2026 19:21:05 +0000
Subject: [PATCH 212/655] 8380079: Add separate flag for platforms on which
 copy and clear operations are faster with AVX3Threshold set to 0

Reviewed-by: kvn, asmehra, sviswanathan
---
 src/hotspot/cpu/x86/globals_x86.hpp           | 15 ++++++++++--
 src/hotspot/cpu/x86/macroAssembler_x86.cpp    | 13 +++++------
 src/hotspot/cpu/x86/stubGenerator_x86_64.hpp  |  4 ++--
 .../cpu/x86/stubGenerator_x86_64_adler.cpp    |  2 +-
 .../x86/stubGenerator_x86_64_arraycopy.cpp    | 20 ++++++++--------
 src/hotspot/cpu/x86/vm_version_x86.cpp        | 23 ++++++++++---------
 src/hotspot/cpu/x86/vm_version_x86.hpp        |  2 --
 .../flags/jvmFlagConstraintsCompiler.cpp      | 11 +++++++++
 .../flags/jvmFlagConstraintsCompiler.hpp      |  1 +
 9 files changed, 55 insertions(+), 36 deletions(-)

diff --git a/src/hotspot/cpu/x86/globals_x86.hpp b/src/hotspot/cpu/x86/globals_x86.hpp
index 4f5b6d31e75..084793dc262 100644
--- a/src/hotspot/cpu/x86/globals_x86.hpp
+++ b/src/hotspot/cpu/x86/globals_x86.hpp
@@ -168,16 +168,27 @@ define_pd_global(intx, InitArrayShortSize, 8*BytesPerLong);
           "Perform Ecore Optimization")                                     \
                                                                             \
   /* Minimum array size in bytes to use AVX512 intrinsics */                \
-  /* for copy, inflate and fill which don't bail out early based on any */  \
+  /* for inflate and fill which don't bail out early based on any */        \
   /* condition. When this value is set to zero compare operations like */   \
   /* compare, vectorizedMismatch, compress can also use AVX512 intrinsics.*/\
   product(int, AVX3Threshold, 4096, DIAGNOSTIC,                             \
              "Minimum array size in bytes to use AVX512 intrinsics"         \
-             "for copy, inflate and fill. When this value is set as zero"   \
+             "for inflate and fill. When this value is set as zero"         \
              "compare operations can also use AVX512 intrinsics.")          \
              range(0, max_jint)                                             \
              constraint(AVX3ThresholdConstraintFunc,AfterErgo)              \
                                                                             \
+  /* Minimum array size in bytes to use AVX512 intrinsics */                \
+  /* for copy and fill which don't bail out early based on any */           \
+  /* condition. When this value is set to zero clear operations that */     \
+  /* work on memory blocks can also use AVX512 intrinsics. */               \
+  product(int, CopyAVX3Threshold, 4096, DIAGNOSTIC,                         \
+             "Minimum array size in bytes to use AVX512 intrinsics"         \
+             "for copy and fill. When this value is set as zero"            \
+             "clear operations can also use AVX512 intrinsics.")            \
+             range(0, max_jint)                                             \
+             constraint(CopyAVX3ThresholdConstraintFunc,AfterErgo)          \
+                                                                            \
   product(bool, IntelJccErratumMitigation, true, DIAGNOSTIC,                \
              "Turn off JVM mitigations related to Intel micro code "        \
              "mitigations for the Intel JCC erratum")                       \
diff --git a/src/hotspot/cpu/x86/macroAssembler_x86.cpp b/src/hotspot/cpu/x86/macroAssembler_x86.cpp
index 2d46a50d426..1d77be26bd9 100644
--- a/src/hotspot/cpu/x86/macroAssembler_x86.cpp
+++ b/src/hotspot/cpu/x86/macroAssembler_x86.cpp
@@ -5820,7 +5820,7 @@ void MacroAssembler::xmm_clear_mem(Register base, Register cnt, Register rtmp, X
   // cnt - number of qwords (8-byte words).
   // base - start address, qword aligned.
   Label L_zero_64_bytes, L_loop, L_sloop, L_tail, L_end;
-  bool use64byteVector = (MaxVectorSize == 64) && (VM_Version::avx3_threshold() == 0);
+  bool use64byteVector = (MaxVectorSize == 64) && (CopyAVX3Threshold == 0);
   if (use64byteVector) {
     vpxor(xtmp, xtmp, xtmp, AVX_512bit);
   } else if (MaxVectorSize >= 32) {
@@ -5884,7 +5884,7 @@ void MacroAssembler::xmm_clear_mem(Register base, Register cnt, Register rtmp, X
 // Clearing constant sized memory using YMM/ZMM registers.
 void MacroAssembler::clear_mem(Register base, int cnt, Register rtmp, XMMRegister xtmp, KRegister mask) {
   assert(UseAVX > 2 && VM_Version::supports_avx512vl(), "");
-  bool use64byteVector = (MaxVectorSize > 32) && (VM_Version::avx3_threshold() == 0);
+  bool use64byteVector = (MaxVectorSize > 32) && (CopyAVX3Threshold == 0);
 
   int vector64_count = (cnt & (~0x7)) >> 3;
   cnt = cnt & 0x7;
@@ -6109,8 +6109,8 @@ void MacroAssembler::generate_fill(BasicType t, bool aligned,
           // Fill 64-byte chunks
           Label L_fill_64_bytes_loop_avx3, L_check_fill_64_bytes_avx2;
 
-          // If number of bytes to fill < VM_Version::avx3_threshold(), perform fill using AVX2
-          cmpptr(count, VM_Version::avx3_threshold());
+          // If number of bytes to fill < CopyAVX3Threshold, perform fill using AVX2
+          cmpptr(count, CopyAVX3Threshold);
           jccb(Assembler::below, L_check_fill_64_bytes_avx2);
 
           vpbroadcastd(xtmp, xtmp, Assembler::AVX_512bit);
@@ -9483,7 +9483,6 @@ void MacroAssembler::generate_fill_avx3(BasicType type, Register to, Register va
   Label L_fill_zmm_sequence;
 
   int shift = -1;
-  int avx3threshold = VM_Version::avx3_threshold();
   switch(type) {
     case T_BYTE:  shift = 0;
       break;
@@ -9499,10 +9498,10 @@ void MacroAssembler::generate_fill_avx3(BasicType type, Register to, Register va
       fatal("Unhandled type: %s\n", type2name(type));
   }
 
-  if ((avx3threshold != 0)  || (MaxVectorSize == 32)) {
+  if ((CopyAVX3Threshold != 0)  || (MaxVectorSize == 32)) {
 
     if (MaxVectorSize == 64) {
-      cmpq(count, avx3threshold >> shift);
+      cmpq(count, CopyAVX3Threshold >> shift);
       jcc(Assembler::greater, L_fill_zmm_sequence);
     }
 
diff --git a/src/hotspot/cpu/x86/stubGenerator_x86_64.hpp b/src/hotspot/cpu/x86/stubGenerator_x86_64.hpp
index 64b56442c90..332add6dcd4 100644
--- a/src/hotspot/cpu/x86/stubGenerator_x86_64.hpp
+++ b/src/hotspot/cpu/x86/stubGenerator_x86_64.hpp
@@ -166,12 +166,12 @@ class StubGenerator: public StubCodeGenerator {
   // - If target supports AVX3 features (BW+VL+F) then implementation uses 32 byte vectors (YMMs)
   //   for both special cases (various small block sizes) and aligned copy loop. This is the
   //   default configuration.
-  // - If copy length is above AVX3Threshold, then implementation use 64 byte vectors (ZMMs)
+  // - If copy length is above CopyAVX3Threshold, then implementation use 64 byte vectors (ZMMs)
   //   for main copy loop (and subsequent tail) since bulk of the cycles will be consumed in it.
   // - If user forces MaxVectorSize=32 then above 4096 bytes its seen that REP MOVs shows a
   //   better performance for disjoint copies. For conjoint/backward copy vector based
   //   copy performs better.
-  // - If user sets AVX3Threshold=0, then special cases for small blocks sizes operate over
+  // - If user sets CopyAVX3Threshold=0, then special cases for small blocks sizes operate over
   //   64 byte vector registers (ZMMs).
 
   address generate_disjoint_copy_avx3_masked(StubId stub_id, address* entry);
diff --git a/src/hotspot/cpu/x86/stubGenerator_x86_64_adler.cpp b/src/hotspot/cpu/x86/stubGenerator_x86_64_adler.cpp
index 2799997a761..1d3e7afde1d 100644
--- a/src/hotspot/cpu/x86/stubGenerator_x86_64_adler.cpp
+++ b/src/hotspot/cpu/x86/stubGenerator_x86_64_adler.cpp
@@ -144,7 +144,7 @@ address StubGenerator::generate_updateBytesAdler32() {
   __ align32();
   if (VM_Version::supports_avx512vl()) {
     // AVX2 performs better for smaller inputs because of leaner post loop reduction sequence..
-    __ cmpl(s, MAX2(128, VM_Version::avx3_threshold()));
+    __ cmpl(s, MAX2(128, CopyAVX3Threshold));
     __ jcc(Assembler::belowEqual, SLOOP1A_AVX2);
     __ lea(end, Address(s, data, Address::times_1, - (2*CHUNKSIZE -1)));
 
diff --git a/src/hotspot/cpu/x86/stubGenerator_x86_64_arraycopy.cpp b/src/hotspot/cpu/x86/stubGenerator_x86_64_arraycopy.cpp
index d53fafafdb4..01e004b7b43 100644
--- a/src/hotspot/cpu/x86/stubGenerator_x86_64_arraycopy.cpp
+++ b/src/hotspot/cpu/x86/stubGenerator_x86_64_arraycopy.cpp
@@ -511,12 +511,12 @@ void StubGenerator::copy_bytes_backward(Register from, Register dest,
 // - If target supports AVX3 features (BW+VL+F) then implementation uses 32 byte vectors (YMMs)
 //   for both special cases (various small block sizes) and aligned copy loop. This is the
 //   default configuration.
-// - If copy length is above AVX3Threshold, then implementation use 64 byte vectors (ZMMs)
+// - If copy length is above CopyAVX3Threshold, then implementation use 64 byte vectors (ZMMs)
 //   for main copy loop (and subsequent tail) since bulk of the cycles will be consumed in it.
 // - If user forces MaxVectorSize=32 then above 4096 bytes its seen that REP MOVs shows a
 //   better performance for disjoint copies. For conjoint/backward copy vector based
 //   copy performs better.
-// - If user sets AVX3Threshold=0, then special cases for small blocks sizes operate over
+// - If user sets CopyAVX3Threshold=0, then special cases for small blocks sizes operate over
 //   64 byte vector registers (ZMMs).
 
 // Inputs:
@@ -575,8 +575,7 @@ address StubGenerator::generate_disjoint_copy_avx3_masked(StubId stub_id, addres
   StubCodeMark mark(this, stub_id);
   address start = __ pc();
 
-  int avx3threshold = VM_Version::avx3_threshold();
-  bool use64byteVector = (MaxVectorSize > 32) && (avx3threshold == 0);
+  bool use64byteVector = (MaxVectorSize > 32) && (CopyAVX3Threshold == 0);
   const int large_threshold = 2621440; // 2.5 MB
   Label L_main_loop, L_main_loop_64bytes, L_tail, L_tail64, L_exit, L_entry;
   Label L_repmovs, L_main_pre_loop, L_main_pre_loop_64bytes, L_pre_main_post_64;
@@ -647,7 +646,7 @@ address StubGenerator::generate_disjoint_copy_avx3_masked(StubId stub_id, addres
       __ cmpq(temp2, large_threshold);
       __ jcc(Assembler::greaterEqual, L_copy_large);
     }
-    if (avx3threshold != 0) {
+    if (CopyAVX3Threshold != 0) {
       __ cmpq(count, threshold[shift]);
       if (MaxVectorSize == 64) {
         // Copy using 64 byte vectors.
@@ -659,7 +658,7 @@ address StubGenerator::generate_disjoint_copy_avx3_masked(StubId stub_id, addres
       }
     }
 
-    if ((MaxVectorSize < 64)  || (avx3threshold != 0)) {
+    if ((MaxVectorSize < 64)  || (CopyAVX3Threshold != 0)) {
       // Partial copy to make dst address 32 byte aligned.
       __ movq(temp2, to);
       __ andq(temp2, 31);
@@ -913,8 +912,7 @@ address StubGenerator::generate_conjoint_copy_avx3_masked(StubId stub_id, addres
   StubCodeMark mark(this, stub_id);
   address start = __ pc();
 
-  int avx3threshold = VM_Version::avx3_threshold();
-  bool use64byteVector = (MaxVectorSize > 32) && (avx3threshold == 0);
+  bool use64byteVector = (MaxVectorSize > 32) && (CopyAVX3Threshold == 0);
 
   Label L_main_pre_loop, L_main_pre_loop_64bytes, L_pre_main_post_64;
   Label L_main_loop, L_main_loop_64bytes, L_tail, L_tail64, L_exit, L_entry;
@@ -979,12 +977,12 @@ address StubGenerator::generate_conjoint_copy_avx3_masked(StubId stub_id, addres
     // PRE-MAIN-POST loop for aligned copy.
     __ BIND(L_entry);
 
-    if ((MaxVectorSize > 32) && (avx3threshold != 0)) {
+    if ((MaxVectorSize > 32) && (CopyAVX3Threshold != 0)) {
       __ cmpq(temp1, threshold[shift]);
       __ jcc(Assembler::greaterEqual, L_pre_main_post_64);
     }
 
-    if ((MaxVectorSize < 64)  || (avx3threshold != 0)) {
+    if ((MaxVectorSize < 64)  || (CopyAVX3Threshold != 0)) {
       // Partial copy to make dst address 32 byte aligned.
       __ leaq(temp2, Address(to, temp1, (Address::ScaleFactor)(shift), 0));
       __ andq(temp2, 31);
@@ -1199,7 +1197,7 @@ void StubGenerator::arraycopy_avx3_special_cases_conjoint(XMMRegister xmm, KRegi
                                                            bool use64byteVector, Label& L_entry, Label& L_exit) {
   Label L_entry_64, L_entry_96, L_entry_128;
   Label L_entry_160, L_entry_192;
-  bool avx3 = (MaxVectorSize > 32) && (VM_Version::avx3_threshold() == 0);
+  bool avx3 = (MaxVectorSize > 32) && (CopyAVX3Threshold == 0);
 
   int size_mat[][6] = {
   /* T_BYTE */ {32 , 64,  96 , 128 , 160 , 192 },
diff --git a/src/hotspot/cpu/x86/vm_version_x86.cpp b/src/hotspot/cpu/x86/vm_version_x86.cpp
index b352de77d6f..a800feea0a8 100644
--- a/src/hotspot/cpu/x86/vm_version_x86.cpp
+++ b/src/hotspot/cpu/x86/vm_version_x86.cpp
@@ -1967,6 +1967,18 @@ void VM_Version::get_processor_features() {
   if (FLAG_IS_DEFAULT(UseCopySignIntrinsic)) {
       FLAG_SET_DEFAULT(UseCopySignIntrinsic, true);
   }
+  // CopyAVX3Threshold is the threshold at which 64-byte instructions are used
+  // for implementing the array copy and clear operations.
+  // The Intel platforms that supports the serialize instruction
+  // have improved implementation of 64-byte load/stores and so the default
+  // threshold is set to 0 for these platforms.
+  if (FLAG_IS_DEFAULT(CopyAVX3Threshold)) {
+    if (is_intel() && is_intel_server_family() && supports_serialize()) {
+      FLAG_SET_DEFAULT(CopyAVX3Threshold, 0);
+    } else {
+      FLAG_SET_DEFAULT(CopyAVX3Threshold, AVX3Threshold);
+    }
+  }
 }
 
 void VM_Version::print_platform_virtualization_info(outputStream* st) {
@@ -2122,17 +2134,6 @@ bool VM_Version::is_intel_darkmont() {
   return is_intel() && is_intel_server_family() && (_model == 0xCC || _model == 0xDD);
 }
 
-// avx3_threshold() sets the threshold at which 64-byte instructions are used
-// for implementing the array copy and clear operations.
-// The Intel platforms that supports the serialize instruction
-// has improved implementation of 64-byte load/stores and so the default
-// threshold is set to 0 for these platforms.
-int VM_Version::avx3_threshold() {
-  return (is_intel_server_family() &&
-          supports_serialize() &&
-          FLAG_IS_DEFAULT(AVX3Threshold)) ? 0 : AVX3Threshold;
-}
-
 void VM_Version::clear_apx_test_state() {
   clear_apx_test_state_stub();
 }
diff --git a/src/hotspot/cpu/x86/vm_version_x86.hpp b/src/hotspot/cpu/x86/vm_version_x86.hpp
index 9f0446df7c6..a42558a8023 100644
--- a/src/hotspot/cpu/x86/vm_version_x86.hpp
+++ b/src/hotspot/cpu/x86/vm_version_x86.hpp
@@ -958,8 +958,6 @@ public:
 
   static bool is_intel_darkmont();
 
-  static int avx3_threshold();
-
   static bool is_intel_tsc_synched_at_init();
 
   static void insert_features_names(VM_Version::VM_Features features, stringStream& ss);
diff --git a/src/hotspot/share/runtime/flags/jvmFlagConstraintsCompiler.cpp b/src/hotspot/share/runtime/flags/jvmFlagConstraintsCompiler.cpp
index 444ce321759..36eece6f013 100644
--- a/src/hotspot/share/runtime/flags/jvmFlagConstraintsCompiler.cpp
+++ b/src/hotspot/share/runtime/flags/jvmFlagConstraintsCompiler.cpp
@@ -274,6 +274,17 @@ JVMFlag::Error AVX3ThresholdConstraintFunc(int value, bool verbose) {
   return JVMFlag::SUCCESS;
 }
 
+JVMFlag::Error CopyAVX3ThresholdConstraintFunc(int value, bool verbose) {
+  if (value != 0 && !is_power_of_2(value)) {
+    JVMFlag::printError(verbose,
+                        "CopyAVX3Threshold ( %d ) must be 0 or "
+                        "a power of two value between 0 and MAX_INT\n", value);
+    return JVMFlag::VIOLATES_CONSTRAINT;
+  }
+
+  return JVMFlag::SUCCESS;
+}
+
 JVMFlag::Error ArraycopySrcPrefetchDistanceConstraintFunc(uintx value, bool verbose) {
   if (value >= 4032) {
     JVMFlag::printError(verbose,
diff --git a/src/hotspot/share/runtime/flags/jvmFlagConstraintsCompiler.hpp b/src/hotspot/share/runtime/flags/jvmFlagConstraintsCompiler.hpp
index cf785800cfc..45e91058e0b 100644
--- a/src/hotspot/share/runtime/flags/jvmFlagConstraintsCompiler.hpp
+++ b/src/hotspot/share/runtime/flags/jvmFlagConstraintsCompiler.hpp
@@ -46,6 +46,7 @@
   f(uintx, ArraycopyDstPrefetchDistanceConstraintFunc)  \
   f(uintx, ArraycopySrcPrefetchDistanceConstraintFunc)  \
   f(int,   AVX3ThresholdConstraintFunc)                 \
+  f(int,   CopyAVX3ThresholdConstraintFunc)             \
   f(uint,  TypeProfileLevelConstraintFunc)              \
   f(uint,  VerifyIterativeGVNConstraintFunc)            \
   f(intx,  InitArrayShortSizeConstraintFunc)            \

From 8d11b977def8356b6fd8504562538d2af88c082b Mon Sep 17 00:00:00 2001
From: Erik Gahlin <egahlin@openjdk.org>
Date: Mon, 16 Mar 2026 22:20:04 +0000
Subject: [PATCH 213/655] =?UTF-8?q?8380037:=20JFR:=20Don=E2=80=99t=20forma?=
 =?UTF-8?q?t=20identifiers=20as=20numbers?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

Reviewed-by: mgronlun
---
 src/jdk.jfr/share/classes/jdk/jfr/internal/query/Field.java  | 5 ++++-
 .../share/classes/jdk/jfr/internal/query/FieldBuilder.java   | 3 ++-
 .../share/classes/jdk/jfr/internal/query/FieldFormatter.java | 4 ++--
 3 files changed, 8 insertions(+), 4 deletions(-)

diff --git a/src/jdk.jfr/share/classes/jdk/jfr/internal/query/Field.java b/src/jdk.jfr/share/classes/jdk/jfr/internal/query/Field.java
index b7fc4381670..f9c2ab351bf 100644
--- a/src/jdk.jfr/share/classes/jdk/jfr/internal/query/Field.java
+++ b/src/jdk.jfr/share/classes/jdk/jfr/internal/query/Field.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2025, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -118,6 +118,9 @@ final class Field {
     // An integral type (byte, short, int, long)
     boolean integralType;
 
+    // An integral type that should be treated like a symbol, e.g. PID.
+    boolean identifier;
+
     // A java.time.Duration
     boolean timespan;
 
diff --git a/src/jdk.jfr/share/classes/jdk/jfr/internal/query/FieldBuilder.java b/src/jdk.jfr/share/classes/jdk/jfr/internal/query/FieldBuilder.java
index 64791b1976a..8d0b3371c7d 100644
--- a/src/jdk.jfr/share/classes/jdk/jfr/internal/query/FieldBuilder.java
+++ b/src/jdk.jfr/share/classes/jdk/jfr/internal/query/FieldBuilder.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2023, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2023, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -274,6 +274,7 @@ final class FieldBuilder {
         case "int", "long", "short", "byte":
             field.integralType = true;
             field.alignLeft = false;
+            field.identifier = fieldName.equals("id") || fieldName.endsWith("Id") || field.label.endsWith("Identifier");
             break;
         case "float", "double":
             field.fractionalType = true;
diff --git a/src/jdk.jfr/share/classes/jdk/jfr/internal/query/FieldFormatter.java b/src/jdk.jfr/share/classes/jdk/jfr/internal/query/FieldFormatter.java
index 989e2231eb1..ec032ce9f34 100644
--- a/src/jdk.jfr/share/classes/jdk/jfr/internal/query/FieldFormatter.java
+++ b/src/jdk.jfr/share/classes/jdk/jfr/internal/query/FieldFormatter.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2023, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2023, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -165,7 +165,7 @@ public class FieldFormatter {
                 return object + " Hz";
             }
         }
-        if (object instanceof Number number) {
+        if (object instanceof Number number && !field.identifier) {
             return ValueFormatter.formatNumber(number);
         }
         return object.toString();

From 921da0a9734d9fae2e7b0e129d2cc6949ad0b5a6 Mon Sep 17 00:00:00 2001
From: Ioi Lam <iklam@openjdk.org>
Date: Tue, 17 Mar 2026 01:28:03 +0000
Subject: [PATCH 214/655] 8378211: Test ChangedJarFile.java failed: missing
 "timestamp has changed"

Reviewed-by: dholmes, liach
---
 .../jtreg/runtime/cds/appcds/aotCache/ChangedJarFile.java       | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/test/hotspot/jtreg/runtime/cds/appcds/aotCache/ChangedJarFile.java b/test/hotspot/jtreg/runtime/cds/appcds/aotCache/ChangedJarFile.java
index a717b267347..e86defdf816 100644
--- a/test/hotspot/jtreg/runtime/cds/appcds/aotCache/ChangedJarFile.java
+++ b/test/hotspot/jtreg/runtime/cds/appcds/aotCache/ChangedJarFile.java
@@ -59,7 +59,7 @@ public class ChangedJarFile {
             tester.productionRun(new String[] {"-XX:AOTMode=auto", "-Xlog:aot"},
                                  new String[] {"jarHasChanged"});
         out.shouldMatch("This file is not the one used while building the " +
-                        "AOT cache: '.*app.jar', timestamp has changed, size has changed");
+                        "AOT cache: '.*app.jar',.* size has changed");
     }
 
     static class Tester extends CDSAppTester {

From 3e231755a03e75a29b66aaa32784397cf5022da1 Mon Sep 17 00:00:00 2001
From: Dingli Zhang <dzhang@openjdk.org>
Date: Tue, 17 Mar 2026 02:41:24 +0000
Subject: [PATCH 215/655] 8380083: Enable some vector mask cast IR matching
 tests for RISC-V

Reviewed-by: fyang
---
 .../vectorapi/VectorMaskCastIdentityTest.java |  6 ++--
 .../vectorapi/VectorMaskCastTest.java         | 28 +++++++++----------
 2 files changed, 17 insertions(+), 17 deletions(-)

diff --git a/test/hotspot/jtreg/compiler/vectorapi/VectorMaskCastIdentityTest.java b/test/hotspot/jtreg/compiler/vectorapi/VectorMaskCastIdentityTest.java
index be9d8e6390c..e4f166f510a 100644
--- a/test/hotspot/jtreg/compiler/vectorapi/VectorMaskCastIdentityTest.java
+++ b/test/hotspot/jtreg/compiler/vectorapi/VectorMaskCastIdentityTest.java
@@ -50,7 +50,7 @@ public class VectorMaskCastIdentityTest {
     }
 
     @Test
-    @IR(counts = { IRNode.VECTOR_MASK_CAST, "= 2" }, applyIfCPUFeatureOr = {"asimd", "true"})
+    @IR(counts = { IRNode.VECTOR_MASK_CAST, "= 2" }, applyIfCPUFeatureOr = {"asimd", "true", "rvv", "true"})
     public static int testTwoCastToDifferentType() {
         // The types before and after the two casts are not the same, so the cast cannot be eliminated.
         VectorMask<Float> mFloat64 = VectorMask.fromArray(FloatVector.SPECIES_64, mr, 0);
@@ -84,7 +84,7 @@ public class VectorMaskCastIdentityTest {
     }
 
     @Test
-    @IR(counts = { IRNode.VECTOR_MASK_CAST, "= 0" }, applyIfCPUFeatureOr = {"avx2", "true", "asimd", "true"})
+    @IR(counts = { IRNode.VECTOR_MASK_CAST, "= 0" }, applyIfCPUFeatureOr = {"avx2", "true", "asimd", "true", "rvv", "true"})
     public static int testTwoCastToSameType() {
         // The types before and after the two casts are the same, so the cast will be eliminated.
         VectorMask<Integer> mInt128 = VectorMask.fromArray(IntVector.SPECIES_128, mr, 0);
@@ -101,7 +101,7 @@ public class VectorMaskCastIdentityTest {
     }
 
     @Test
-    @IR(counts = { IRNode.VECTOR_MASK_CAST, "= 1" }, applyIfCPUFeatureOr = {"avx2", "true", "asimd", "true"})
+    @IR(counts = { IRNode.VECTOR_MASK_CAST, "= 1" }, applyIfCPUFeatureOr = {"avx2", "true", "asimd", "true", "rvv", "true"})
     public static int testOneCastToDifferentType() {
         // The types before and after the only cast are different, the cast will not be eliminated.
         VectorMask<Float> mFloat128 = VectorMask.fromArray(FloatVector.SPECIES_128, mr, 0).not();
diff --git a/test/hotspot/jtreg/compiler/vectorapi/VectorMaskCastTest.java b/test/hotspot/jtreg/compiler/vectorapi/VectorMaskCastTest.java
index 25594d5caf9..1f346cffd2f 100644
--- a/test/hotspot/jtreg/compiler/vectorapi/VectorMaskCastTest.java
+++ b/test/hotspot/jtreg/compiler/vectorapi/VectorMaskCastTest.java
@@ -74,7 +74,7 @@ public class VectorMaskCastTest {
 
     // Byte
     @Test
-    @IR(counts = { IRNode.VECTOR_MASK_CAST, "> 0" }, applyIfCPUFeatureOr = {"avx2", "true", "asimd", "true"})
+    @IR(counts = { IRNode.VECTOR_MASK_CAST, "> 0" }, applyIfCPUFeatureOr = {"avx2", "true", "asimd", "true", "rvv", "true"})
     public static VectorMask<Short> testByte64ToShort128(VectorMask<Byte> v) {
         return v.cast(ShortVector.SPECIES_128);
     }
@@ -201,7 +201,7 @@ public class VectorMaskCastTest {
 
     // Short
     @Test
-    @IR(counts = { IRNode.VECTOR_MASK_CAST, "> 0" }, applyIfCPUFeatureOr = {"avx2", "true", "asimd", "true"})
+    @IR(counts = { IRNode.VECTOR_MASK_CAST, "> 0" }, applyIfCPUFeatureOr = {"avx2", "true", "asimd", "true", "rvv", "true"})
     public static VectorMask<Integer> testShort64ToInt128(VectorMask<Short> v) {
         return v.cast(IntVector.SPECIES_128);
     }
@@ -215,7 +215,7 @@ public class VectorMaskCastTest {
     }
 
     @Test
-    @IR(counts = { IRNode.VECTOR_MASK_CAST, "> 0" }, applyIfCPUFeatureOr = {"avx2", "true", "asimd", "true"})
+    @IR(counts = { IRNode.VECTOR_MASK_CAST, "> 0" }, applyIfCPUFeatureOr = {"avx2", "true", "asimd", "true", "rvv", "true"})
     public static VectorMask<Float> testShort64ToFloat128(VectorMask<Short> v) {
         return v.cast(FloatVector.SPECIES_128);
     }
@@ -257,7 +257,7 @@ public class VectorMaskCastTest {
     }
 
     @Test
-    @IR(counts = { IRNode.VECTOR_MASK_CAST, "> 0" }, applyIfCPUFeatureOr = {"avx2", "true", "asimd", "true"})
+    @IR(counts = { IRNode.VECTOR_MASK_CAST, "> 0" }, applyIfCPUFeatureOr = {"avx2", "true", "asimd", "true", "rvv", "true"})
     public static VectorMask<Byte> testShort128ToByte64(VectorMask<Short> v) {
         return v.cast(ByteVector.SPECIES_64);
     }
@@ -384,7 +384,7 @@ public class VectorMaskCastTest {
 
     // Int
     @Test
-    @IR(counts = { IRNode.VECTOR_MASK_CAST, "> 0" }, applyIfCPUFeature = {"asimd", "true"})
+    @IR(counts = { IRNode.VECTOR_MASK_CAST, "> 0" }, applyIfCPUFeatureOr = {"asimd", "true", "rvv", "true"})
     public static VectorMask<Long> testInt64ToLong128(VectorMask<Integer> v) {
         return v.cast(LongVector.SPECIES_128);
     }
@@ -398,7 +398,7 @@ public class VectorMaskCastTest {
     }
 
     @Test
-    @IR(counts = { IRNode.VECTOR_MASK_CAST, "> 0" }, applyIfCPUFeature = {"asimd", "true"})
+    @IR(counts = { IRNode.VECTOR_MASK_CAST, "> 0" }, applyIfCPUFeatureOr = {"asimd", "true", "rvv", "true"})
     public static VectorMask<Double> testInt64ToDouble128(VectorMask<Integer> v) {
         return v.cast(DoubleVector.SPECIES_128);
     }
@@ -412,7 +412,7 @@ public class VectorMaskCastTest {
     }
 
     @Test
-    @IR(counts = { IRNode.VECTOR_MASK_CAST, "> 0" }, applyIfCPUFeatureOr = {"avx2", "true", "asimd", "true"})
+    @IR(counts = { IRNode.VECTOR_MASK_CAST, "> 0" }, applyIfCPUFeatureOr = {"avx2", "true", "asimd", "true", "rvv", "true"})
     public static VectorMask<Short> testInt128ToShort64(VectorMask<Integer> v) {
         return v.cast(ShortVector.SPECIES_64);
     }
@@ -539,7 +539,7 @@ public class VectorMaskCastTest {
 
     // Float
     @Test
-    @IR(counts = { IRNode.VECTOR_MASK_CAST, "> 0" }, applyIfCPUFeature = {"asimd", "true"})
+    @IR(counts = { IRNode.VECTOR_MASK_CAST, "> 0" }, applyIfCPUFeatureOr = {"asimd", "true", "rvv", "true"})
     public static VectorMask<Long> testFloat64ToLong128(VectorMask<Float> v) {
         return v.cast(LongVector.SPECIES_128);
     }
@@ -553,7 +553,7 @@ public class VectorMaskCastTest {
     }
 
     @Test
-    @IR(counts = { IRNode.VECTOR_MASK_CAST, "> 0" }, applyIfCPUFeature = {"asimd", "true"})
+    @IR(counts = { IRNode.VECTOR_MASK_CAST, "> 0" }, applyIfCPUFeatureOr = {"asimd", "true", "rvv", "true"})
     public static VectorMask<Double> testFloat64ToDouble128(VectorMask<Float> v) {
         return v.cast(DoubleVector.SPECIES_128);
     }
@@ -567,7 +567,7 @@ public class VectorMaskCastTest {
     }
 
     @Test
-    @IR(counts = { IRNode.VECTOR_MASK_CAST, "> 0" }, applyIfCPUFeatureOr = {"avx2", "true", "asimd", "true"})
+    @IR(counts = { IRNode.VECTOR_MASK_CAST, "> 0" }, applyIfCPUFeatureOr = {"avx2", "true", "asimd", "true", "rvv", "true"})
     public static VectorMask<Short> testFloat128ToShort64(VectorMask<Float> v) {
         return v.cast(ShortVector.SPECIES_64);
     }
@@ -694,7 +694,7 @@ public class VectorMaskCastTest {
 
     // Long
     @Test
-    @IR(counts = { IRNode.VECTOR_MASK_CAST, "> 0" }, applyIfCPUFeature = {"asimd", "true"})
+    @IR(counts = { IRNode.VECTOR_MASK_CAST, "> 0" }, applyIfCPUFeatureOr = {"asimd", "true", "rvv", "true"})
     public static VectorMask<Integer> testLong128ToInt64(VectorMask<Long> v) {
         return v.cast(IntVector.SPECIES_64);
     }
@@ -708,7 +708,7 @@ public class VectorMaskCastTest {
     }
 
     @Test
-    @IR(counts = { IRNode.VECTOR_MASK_CAST, "> 0" }, applyIfCPUFeature = {"asimd", "true"})
+    @IR(counts = { IRNode.VECTOR_MASK_CAST, "> 0" }, applyIfCPUFeatureOr = {"asimd", "true", "rvv", "true"})
     public static VectorMask<Float> testLong128ToFloat64(VectorMask<Long> v) {
         return v.cast(FloatVector.SPECIES_64);
     }
@@ -821,7 +821,7 @@ public class VectorMaskCastTest {
 
     // Double
     @Test
-    @IR(counts = { IRNode.VECTOR_MASK_CAST, "> 0" }, applyIfCPUFeature = {"asimd", "true"})
+    @IR(counts = { IRNode.VECTOR_MASK_CAST, "> 0" }, applyIfCPUFeatureOr = {"asimd", "true", "rvv", "true"})
     public static VectorMask<Integer> testDouble128ToInt64(VectorMask<Double> v) {
         return v.cast(IntVector.SPECIES_64);
     }
@@ -835,7 +835,7 @@ public class VectorMaskCastTest {
     }
 
     @Test
-    @IR(counts = { IRNode.VECTOR_MASK_CAST, "> 0" }, applyIfCPUFeature = {"asimd", "true"})
+    @IR(counts = { IRNode.VECTOR_MASK_CAST, "> 0" }, applyIfCPUFeatureOr = {"asimd", "true", "rvv", "true"})
     public static VectorMask<Float> testDouble128ToFloat64(VectorMask<Double> v) {
         return v.cast(FloatVector.SPECIES_64);
     }

From a1e4621b30e08c8b20bd4542e4f1655aeb0ec576 Mon Sep 17 00:00:00 2001
From: Ioi Lam <iklam@openjdk.org>
Date: Tue, 17 Mar 2026 05:58:33 +0000
Subject: [PATCH 216/655] 8378152: Upstream AOT heap object improvements from
 Leyden repo

Reviewed-by: jrose, kvn
---
 src/hotspot/share/cds/aotMappedHeapWriter.cpp |  52 +++---
 src/hotspot/share/cds/aotMappedHeapWriter.hpp |  18 +-
 .../share/cds/aotReferenceObjSupport.cpp      |   2 +-
 .../share/cds/aotStreamedHeapWriter.cpp       |  22 +--
 .../share/cds/aotStreamedHeapWriter.hpp       |   2 -
 src/hotspot/share/cds/cdsHeapVerifier.hpp     |   2 +-
 src/hotspot/share/cds/heapShared.cpp          | 154 +++++++++++++++---
 src/hotspot/share/cds/heapShared.hpp          |  35 ++--
 src/hotspot/share/classfile/stringTable.cpp   |   2 +-
 9 files changed, 185 insertions(+), 104 deletions(-)

diff --git a/src/hotspot/share/cds/aotMappedHeapWriter.cpp b/src/hotspot/share/cds/aotMappedHeapWriter.cpp
index 64c0e3c40e8..2e21a1d15d8 100644
--- a/src/hotspot/share/cds/aotMappedHeapWriter.cpp
+++ b/src/hotspot/share/cds/aotMappedHeapWriter.cpp
@@ -64,6 +64,11 @@ HeapRootSegments AOTMappedHeapWriter::_heap_root_segments;
 address AOTMappedHeapWriter::_requested_bottom;
 address AOTMappedHeapWriter::_requested_top;
 
+static size_t _num_strings = 0;
+static size_t _string_bytes = 0;
+static size_t _num_packages = 0;
+static size_t _num_protection_domains = 0;
+
 GrowableArrayCHeap<AOTMappedHeapWriter::NativePointerInfo, mtClassShared>* AOTMappedHeapWriter::_native_pointers;
 GrowableArrayCHeap<oop, mtClassShared>* AOTMappedHeapWriter::_source_objs;
 GrowableArrayCHeap<AOTMappedHeapWriter::HeapObjOrder, mtClassShared>* AOTMappedHeapWriter::_source_objs_order;
@@ -71,8 +76,6 @@ GrowableArrayCHeap<AOTMappedHeapWriter::HeapObjOrder, mtClassShared>* AOTMappedH
 AOTMappedHeapWriter::BufferOffsetToSourceObjectTable*
 AOTMappedHeapWriter::_buffer_offset_to_source_obj_table = nullptr;
 
-DumpedInternedStrings *AOTMappedHeapWriter::_dumped_interned_strings = nullptr;
-
 typedef HashTable<
       size_t,    // offset of a filler from AOTMappedHeapWriter::buffer_bottom()
       size_t,    // size of this filler (in bytes)
@@ -87,7 +90,6 @@ void AOTMappedHeapWriter::init() {
     Universe::heap()->collect(GCCause::_java_lang_system_gc);
 
     _buffer_offset_to_source_obj_table = new (mtClassShared) BufferOffsetToSourceObjectTable(/*size (prime)*/36137, /*max size*/1 * M);
-    _dumped_interned_strings = new (mtClass)DumpedInternedStrings(INITIAL_TABLE_SIZE, MAX_TABLE_SIZE);
     _fillers = new (mtClassShared) FillersTable();
     _requested_bottom = nullptr;
     _requested_top = nullptr;
@@ -141,9 +143,6 @@ int AOTMappedHeapWriter::narrow_oop_shift() {
 void AOTMappedHeapWriter::delete_tables_with_raw_oops() {
   delete _source_objs;
   _source_objs = nullptr;
-
-  delete _dumped_interned_strings;
-  _dumped_interned_strings = nullptr;
 }
 
 void AOTMappedHeapWriter::add_source_obj(oop src_obj) {
@@ -181,25 +180,6 @@ bool AOTMappedHeapWriter::is_too_large_to_archive(size_t size) {
   }
 }
 
-// Keep track of the contents of the archived interned string table. This table
-// is used only by CDSHeapVerifier.
-void AOTMappedHeapWriter::add_to_dumped_interned_strings(oop string) {
-  assert_at_safepoint(); // DumpedInternedStrings uses raw oops
-  assert(!is_string_too_large_to_archive(string), "must be");
-  bool created;
-  _dumped_interned_strings->put_if_absent(string, true, &created);
-  if (created) {
-    // Prevent string deduplication from changing the value field to
-    // something not in the archive.
-    java_lang_String::set_deduplication_forbidden(string);
-    _dumped_interned_strings->maybe_grow();
-  }
-}
-
-bool AOTMappedHeapWriter::is_dumped_interned_string(oop o) {
-  return _dumped_interned_strings->get(o) != nullptr;
-}
-
 // Various lookup functions between source_obj, buffered_obj and requested_obj
 bool AOTMappedHeapWriter::is_in_requested_range(oop o) {
   assert(_requested_bottom != nullptr, "do not call before _requested_bottom is initialized");
@@ -430,6 +410,7 @@ void AOTMappedHeapWriter::copy_source_objs_to_buffer(GrowableArrayCHeap<oop, mtC
     assert(info != nullptr, "must be");
     size_t buffer_offset = copy_one_source_obj_to_buffer(src_obj);
     info->set_buffer_offset(buffer_offset);
+    assert(buffer_offset <= 0x7fffffff, "sanity");
 
     OopHandle handle(Universe::vm_global(), src_obj);
     _buffer_offset_to_source_obj_table->put_when_absent(buffer_offset, handle);
@@ -442,6 +423,9 @@ void AOTMappedHeapWriter::copy_source_objs_to_buffer(GrowableArrayCHeap<oop, mtC
 
   log_info(aot)("Size of heap region = %zu bytes, %d objects, %d roots, %d native ptrs",
                 _buffer_used, _source_objs->length() + 1, roots->length(), _num_native_ptrs);
+  log_info(aot)("   strings            = %8zu (%zu bytes)", _num_strings, _string_bytes);
+  log_info(aot)("   packages           = %8zu", _num_packages);
+  log_info(aot)("   protection domains = %8zu", _num_protection_domains);
 }
 
 size_t AOTMappedHeapWriter::filler_array_byte_size(int length) {
@@ -530,7 +514,25 @@ void update_buffered_object_field(address buffered_obj, int field_offset, T valu
   *field_addr = value;
 }
 
+void AOTMappedHeapWriter::update_stats(oop src_obj) {
+  if (java_lang_String::is_instance(src_obj)) {
+    _num_strings ++;
+    _string_bytes += src_obj->size() * HeapWordSize;
+    _string_bytes += java_lang_String::value(src_obj)->size() * HeapWordSize;
+  } else {
+    Klass* k = src_obj->klass();
+    Symbol* name = k->name();
+    if (name->equals("java/lang/NamedPackage") || name->equals("java/lang/Package")) {
+      _num_packages ++;
+    } else if (name->equals("java/security/ProtectionDomain")) {
+      _num_protection_domains ++;
+    }
+  }
+}
+
 size_t AOTMappedHeapWriter::copy_one_source_obj_to_buffer(oop src_obj) {
+  update_stats(src_obj);
+
   assert(!is_too_large_to_archive(src_obj), "already checked");
   size_t byte_size = src_obj->size() * HeapWordSize;
   assert(byte_size > 0, "no zero-size objects");
diff --git a/src/hotspot/share/cds/aotMappedHeapWriter.hpp b/src/hotspot/share/cds/aotMappedHeapWriter.hpp
index 7481e7922a0..2420e68d9fe 100644
--- a/src/hotspot/share/cds/aotMappedHeapWriter.hpp
+++ b/src/hotspot/share/cds/aotMappedHeapWriter.hpp
@@ -40,20 +40,6 @@
 class MemRegion;
 
 #if INCLUDE_CDS_JAVA_HEAP
-class DumpedInternedStrings :
-  public ResizeableHashTable<oop, bool,
-                           AnyObj::C_HEAP,
-                           mtClassShared,
-                           HeapShared::string_oop_hash>
-{
-public:
-  DumpedInternedStrings(unsigned size, unsigned max_size) :
-    ResizeableHashTable<oop, bool,
-                                AnyObj::C_HEAP,
-                                mtClassShared,
-                                HeapShared::string_oop_hash>(size, max_size) {}
-};
-
 class AOTMappedHeapWriter : AllStatic {
   friend class HeapShared;
   friend class AOTMappedHeapLoader;
@@ -131,7 +117,6 @@ private:
 
   static GrowableArrayCHeap<NativePointerInfo, mtClassShared>* _native_pointers;
   static GrowableArrayCHeap<oop, mtClassShared>* _source_objs;
-  static DumpedInternedStrings *_dumped_interned_strings;
 
   // We sort _source_objs_order to minimize the number of bits in ptrmap and oopmap.
   // See comments near the body of AOTMappedHeapWriter::compare_objs_by_oop_fields().
@@ -190,6 +175,7 @@ private:
   static void copy_roots_to_buffer(GrowableArrayCHeap<oop, mtClassShared>* roots);
   static void copy_source_objs_to_buffer(GrowableArrayCHeap<oop, mtClassShared>* roots);
   static size_t copy_one_source_obj_to_buffer(oop src_obj);
+  static void update_stats(oop src_obj);
 
   static void maybe_fill_gc_region_gap(size_t required_byte_size);
   static size_t filler_array_byte_size(int length);
@@ -227,8 +213,6 @@ public:
   static bool is_too_large_to_archive(size_t size);
   static bool is_too_large_to_archive(oop obj);
   static bool is_string_too_large_to_archive(oop string);
-  static bool is_dumped_interned_string(oop o);
-  static void add_to_dumped_interned_strings(oop string);
   static void write(GrowableArrayCHeap<oop, mtClassShared>*, AOTMappedHeapInfo* heap_info);
   static address requested_address();  // requested address of the lowest achived heap object
   static size_t get_filler_size_at(address buffered_addr);
diff --git a/src/hotspot/share/cds/aotReferenceObjSupport.cpp b/src/hotspot/share/cds/aotReferenceObjSupport.cpp
index 0c27c8ce5f0..2d5fc8c7f21 100644
--- a/src/hotspot/share/cds/aotReferenceObjSupport.cpp
+++ b/src/hotspot/share/cds/aotReferenceObjSupport.cpp
@@ -96,7 +96,7 @@ class KeepAliveObjectsTable : public HashTable<oop, bool,
     36137, // prime number
     AnyObj::C_HEAP,
     mtClassShared,
-    HeapShared::oop_hash> {};
+    HeapShared::oop_address_hash> {};
 
 static KeepAliveObjectsTable* _keep_alive_objs_table;
 static OopHandle _keep_alive_objs_array;
diff --git a/src/hotspot/share/cds/aotStreamedHeapWriter.cpp b/src/hotspot/share/cds/aotStreamedHeapWriter.cpp
index f52532b2f2a..ad363f21fdb 100644
--- a/src/hotspot/share/cds/aotStreamedHeapWriter.cpp
+++ b/src/hotspot/share/cds/aotStreamedHeapWriter.cpp
@@ -242,20 +242,6 @@ void AOTStreamedHeapWriter::copy_roots_max_dfs_to_buffer(int roots_length) {
   }
 }
 
-static bool is_interned_string(oop obj) {
-  if (!java_lang_String::is_instance(obj)) {
-    return false;
-  }
-
-  ResourceMark rm;
-  int len;
-  jchar* name = java_lang_String::as_unicode_string_or_null(obj, len);
-  if (name == nullptr) {
-    fatal("Insufficient memory for dumping");
-  }
-  return StringTable::lookup(name, len) == obj;
-}
-
 static BitMap::idx_t bit_idx_for_buffer_offset(size_t buffer_offset) {
   if (UseCompressedOops) {
     return BitMap::idx_t(buffer_offset / sizeof(narrowOop));
@@ -264,10 +250,6 @@ static BitMap::idx_t bit_idx_for_buffer_offset(size_t buffer_offset) {
   }
 }
 
-bool AOTStreamedHeapWriter::is_dumped_interned_string(oop obj) {
-  return is_interned_string(obj) && HeapShared::get_cached_oop_info(obj) != nullptr;
-}
-
 void AOTStreamedHeapWriter::copy_source_objs_to_buffer(GrowableArrayCHeap<oop, mtClassShared>* roots) {
   for (int i = 0; i < _source_objs->length(); i++) {
     oop src_obj = _source_objs->at(i);
@@ -325,7 +307,7 @@ size_t AOTStreamedHeapWriter::copy_one_source_obj_to_buffer(oop src_obj) {
 
   ensure_buffer_space(new_used);
 
-  if (is_interned_string(src_obj)) {
+  if (HeapShared::is_interned_string(src_obj)) {
     java_lang_String::hash_code(src_obj);                   // Sets the hash code field(s)
     java_lang_String::set_deduplication_forbidden(src_obj); // Allows faster interning at runtime
     assert(java_lang_String::hash_is_set(src_obj), "hash must be set");
@@ -402,7 +384,7 @@ void AOTStreamedHeapWriter::update_header_for_buffered_addr(address buffered_add
     mw = mw.copy_set_hash(src_hash);
   }
 
-  if (is_interned_string(src_obj)) {
+  if (HeapShared::is_interned_string(src_obj)) {
     // Mark the mark word of interned string so the loader knows to link these to
     // the string table at runtime.
     mw = mw.set_marked();
diff --git a/src/hotspot/share/cds/aotStreamedHeapWriter.hpp b/src/hotspot/share/cds/aotStreamedHeapWriter.hpp
index ab5aec0327b..c3cc9f2c092 100644
--- a/src/hotspot/share/cds/aotStreamedHeapWriter.hpp
+++ b/src/hotspot/share/cds/aotStreamedHeapWriter.hpp
@@ -148,8 +148,6 @@ public:
     return size_t(buffered_addr) - size_t(buffer_bottom());
   }
 
-  static bool is_dumped_interned_string(oop obj);
-
   static size_t source_obj_to_buffered_offset(oop src_obj);
   static address source_obj_to_buffered_addr(oop src_obj);
 
diff --git a/src/hotspot/share/cds/cdsHeapVerifier.hpp b/src/hotspot/share/cds/cdsHeapVerifier.hpp
index 7f1bdb1d249..f8e090801bb 100644
--- a/src/hotspot/share/cds/cdsHeapVerifier.hpp
+++ b/src/hotspot/share/cds/cdsHeapVerifier.hpp
@@ -53,7 +53,7 @@ class CDSHeapVerifier : public KlassClosure {
       15889, // prime number
       AnyObj::C_HEAP,
       mtClassShared,
-      HeapShared::oop_hash> _table;
+      HeapShared::oop_address_hash> _table;
 
   GrowableArray<const char**> _exclusions;
   GrowableArray<oop> _shared_secret_accessors;
diff --git a/src/hotspot/share/cds/heapShared.cpp b/src/hotspot/share/cds/heapShared.cpp
index 0c0f70eac0a..8cab56dda8d 100644
--- a/src/hotspot/share/cds/heapShared.cpp
+++ b/src/hotspot/share/cds/heapShared.cpp
@@ -175,23 +175,39 @@ oop HeapShared::CachedOopInfo::orig_referrer() const {
   return _orig_referrer.resolve();
 }
 
-unsigned HeapShared::oop_hash(oop const& p) {
+// This is a simple hashing of the oop's address. This function is used
+// while copying the oops into the AOT heap region. We don't want to
+// have any side effects during the copying, so we avoid calling
+// p->identity_hash() which can update the object header.
+unsigned HeapShared::oop_address_hash(oop const& p) {
   assert(SafepointSynchronize::is_at_safepoint() ||
          JavaThread::current()->is_in_no_safepoint_scope(), "sanity");
-  // Do not call p->identity_hash() as that will update the
-  // object header.
   return primitive_hash(cast_from_oop<intptr_t>(p));
 }
 
-unsigned int HeapShared::oop_handle_hash_raw(const OopHandle& oh) {
-  return oop_hash(oh.resolve());
-}
-
-unsigned int HeapShared::oop_handle_hash(const OopHandle& oh) {
+// About the hashcode in the cached objects:
+// - If a source object has a hashcode, it must be copied into the cache.
+//   That's because some cached hashtables are laid out using this hashcode.
+// - If a source object doesn't have a hashcode, we avoid computing it while
+//   copying the objects into the cache. This will allow the hashcode to be
+//   dynamically and randomly computed in each production, which generally
+//   desirable to make the hashcodes more random between runs.
+unsigned HeapShared::archived_object_cache_hash(OopHandle const& oh) {
   oop o = oh.resolve();
   if (o == nullptr) {
     return 0;
+  }
+  if (!_use_identity_hash_for_archived_object_cache) {
+    // This is called while we are copying the objects. Don't call o->identity_hash()
+    // as that will update the object header.
+    return oop_address_hash(o);
   } else {
+    // This is called after all objects are copied. It's OK to update
+    // the object's hashcode.
+    //
+    // This may be called after we have left the AOT dumping safepoint.
+    // Objects in archived_object_cache() may be moved by the GC, so we
+    // can't use the address of o for computing the hash.
     return o->identity_hash();
   }
 }
@@ -271,6 +287,12 @@ void HeapShared::prepare_for_archiving(TRAPS) {
 
 HeapShared::ArchivedObjectCache* HeapShared::_archived_object_cache = nullptr;
 
+// Controls the hashing method for the _archived_object_cache.
+// Changes from false to true once, after all objects are copied,
+// inside make_archived_object_cache_gc_safe().
+// See archived_object_cache_hash() for more details.
+bool HeapShared::_use_identity_hash_for_archived_object_cache = false;
+
 bool HeapShared::is_archived_heap_in_use() {
   if (HeapShared::is_loading()) {
     if (HeapShared::is_loading_streaming_mode()) {
@@ -384,9 +406,8 @@ void HeapShared::materialize_thread_object() {
   }
 }
 
-void HeapShared::add_to_dumped_interned_strings(oop string) {
+void HeapShared::archive_interned_string(oop string) {
   assert(HeapShared::is_writing_mapping_mode(), "Only used by this mode");
-  AOTMappedHeapWriter::add_to_dumped_interned_strings(string);
   bool success = archive_reachable_objects_from(1, _dump_time_special_subgraph, string);
   assert(success, "shared strings array must not point to arrays or strings that are too large to archive");
 }
@@ -404,6 +425,24 @@ void HeapShared::finalize_initialization(FileMapInfo* static_mapinfo) {
   }
 }
 
+void HeapShared::make_archived_object_cache_gc_safe() {
+  ArchivedObjectCache* new_cache = new (mtClass)ArchivedObjectCache(INITIAL_TABLE_SIZE, MAX_TABLE_SIZE);
+
+  // It's safe to change the behavior of the hash function now, because iterate_all()
+  // doesn't call the hash function.
+  //  See archived_object_cache_hash() for more details.
+  assert(_use_identity_hash_for_archived_object_cache == false, "happens only once");
+  _use_identity_hash_for_archived_object_cache = true;
+
+  // Copy all CachedOopInfo into a new table using a different hashing algorithm
+  archived_object_cache()->iterate_all([&] (OopHandle oh, CachedOopInfo info) {
+      new_cache->put_when_absent(oh, info);
+    });
+
+  destroy_archived_object_cache();
+  _archived_object_cache = new_cache;
+}
+
 HeapShared::CachedOopInfo* HeapShared::get_cached_oop_info(oop obj) {
   OopHandle oh(Universe::vm_global(), obj);
   CachedOopInfo* result = _archived_object_cache->get(oh);
@@ -417,14 +456,53 @@ bool HeapShared::has_been_archived(oop obj) {
 }
 
 int HeapShared::append_root(oop obj) {
+  assert(SafepointSynchronize::is_at_safepoint(), "sanity");
   assert(CDSConfig::is_dumping_heap(), "dump-time only");
-  if (obj != nullptr) {
-    assert(has_been_archived(obj), "must be");
-  }
-  // No GC should happen since we aren't scanning _pending_roots.
-  assert(Thread::current() == (Thread*)VMThread::vm_thread(), "should be in vm thread");
+  assert(_pending_roots != nullptr, "sanity");
 
-  return _pending_roots->append(obj);
+  if (obj == nullptr) {
+    assert(_pending_roots->at(0) == nullptr, "root index 0 always maps to null");
+    return 0;
+  } else if (CDSConfig::is_dumping_aot_linked_classes()) {
+    // The AOT compiler may refer the same obj many times, so we
+    // should use the same index for this oop to avoid excessive entries
+    // in the roots array.
+    CachedOopInfo* obj_info = get_cached_oop_info(obj);
+    assert(obj_info != nullptr, "must be archived");
+
+    if (obj_info->root_index() > 0) {
+      return obj_info->root_index();
+    } else {
+      assert(obj_info->root_index() < 0, "must not be zero");
+      int i = _pending_roots->append(obj);
+      obj_info->set_root_index(i);
+      return i;
+    }
+  } else {
+    return _pending_roots->append(obj);
+  }
+}
+
+int HeapShared::get_root_index(oop obj) {
+  if (java_lang_Class::is_instance(obj)) {
+    obj = scratch_java_mirror(obj);
+  }
+
+  CachedOopInfo* obj_info = get_cached_oop_info(obj);
+  const char* error = nullptr;
+  if (obj_info == nullptr) {
+    error = "Not a cached oop";
+  } else if (obj_info->root_index() < 0) {
+    error = "Not a cached oop root";
+  } else {
+    return obj_info->root_index();
+  }
+
+  ResourceMark rm;
+  log_debug(aot, codecache, oops)("%s: " INTPTR_FORMAT " (%s)", error,
+                                  cast_from_oop<uintptr_t>(obj),
+                                  obj->klass()->external_name());
+  return -1;
 }
 
 oop HeapShared::get_root(int index, bool clear) {
@@ -453,6 +531,13 @@ void HeapShared::finish_materialize_objects() {
 }
 
 void HeapShared::clear_root(int index) {
+  if (CDSConfig::is_using_aot_linked_classes()) {
+    // When AOT linked classes are in use, all roots will be in use all
+    // the time, there's no benefit for clearing the roots. Also, we
+    // can't clear the roots as they can be shared.
+    return;
+  }
+
   assert(index >= 0, "sanity");
   assert(CDSConfig::is_using_archive(), "must be");
   if (is_archived_heap_in_use()) {
@@ -600,9 +685,10 @@ objArrayOop HeapShared::scratch_resolved_references(ConstantPool* src) {
   return (objArrayOop)_scratch_objects_table->get_oop(src);
 }
 
- void HeapShared::init_dumping() {
-   _scratch_objects_table = new (mtClass)MetaspaceObjToOopHandleTable();
-   _pending_roots = new GrowableArrayCHeap<oop, mtClassShared>(500);
+void HeapShared::init_dumping() {
+  _scratch_objects_table = new (mtClass)MetaspaceObjToOopHandleTable();
+  _pending_roots = new GrowableArrayCHeap<oop, mtClassShared>(500);
+  _pending_roots->append(nullptr); // root index 0 represents a null oop
 }
 
 void HeapShared::init_scratch_objects_for_basic_type_mirrors(TRAPS) {
@@ -883,6 +969,11 @@ void HeapShared::write_heap(AOTMappedHeapInfo* mapped_heap_info, AOTStreamedHeap
 
   ArchiveBuilder::OtherROAllocMark mark;
   write_subgraph_info_table();
+
+  delete _pending_roots;
+  _pending_roots = nullptr;
+
+  make_archived_object_cache_gc_safe();
 }
 
 void HeapShared::scan_java_mirror(oop orig_mirror) {
@@ -1911,6 +2002,11 @@ void HeapShared::verify_subgraph_from(oop orig_obj) {
 void HeapShared::verify_reachable_objects_from(oop obj) {
   _num_total_verifications ++;
   if (java_lang_Class::is_instance(obj)) {
+    Klass* k = java_lang_Class::as_Klass(obj);
+    if (RegeneratedClasses::has_been_regenerated(k)) {
+      k = RegeneratedClasses::get_regenerated_object(k);
+      obj = k->java_mirror();
+    }
     obj = scratch_java_mirror(obj);
     assert(obj != nullptr, "must be");
   }
@@ -2264,12 +2360,22 @@ void HeapShared::archive_object_subgraphs(ArchivableStaticFieldInfo fields[],
 #endif
 }
 
-bool HeapShared::is_dumped_interned_string(oop o) {
-  if (is_writing_mapping_mode()) {
-    return AOTMappedHeapWriter::is_dumped_interned_string(o);
-  } else {
-    return AOTStreamedHeapWriter::is_dumped_interned_string(o);
+bool HeapShared::is_interned_string(oop obj) {
+  if (!java_lang_String::is_instance(obj)) {
+    return false;
   }
+
+  ResourceMark rm;
+  int len = 0;
+  jchar* name = java_lang_String::as_unicode_string_or_null(obj, len);
+  if (name == nullptr) {
+    fatal("Insufficient memory for dumping");
+  }
+  return StringTable::lookup(name, len) == obj;
+}
+
+bool HeapShared::is_dumped_interned_string(oop o) {
+  return is_interned_string(o) && has_been_archived(o);
 }
 
 // These tables should be used only within the CDS safepoint, so
diff --git a/src/hotspot/share/cds/heapShared.hpp b/src/hotspot/share/cds/heapShared.hpp
index 2cb330160e4..92f41784268 100644
--- a/src/hotspot/share/cds/heapShared.hpp
+++ b/src/hotspot/share/cds/heapShared.hpp
@@ -40,7 +40,6 @@
 #include "utilities/hashTable.hpp"
 
 #if INCLUDE_CDS_JAVA_HEAP
-class DumpedInternedStrings;
 class FileMapInfo;
 class KlassSubGraphInfo;
 class MetaspaceObjToOopHandleTable;
@@ -176,7 +175,7 @@ public:
   static void initialize_streaming() NOT_CDS_JAVA_HEAP_RETURN;
   static void enable_gc() NOT_CDS_JAVA_HEAP_RETURN;
   static void materialize_thread_object() NOT_CDS_JAVA_HEAP_RETURN;
-  static void add_to_dumped_interned_strings(oop string) NOT_CDS_JAVA_HEAP_RETURN;
+  static void archive_interned_string(oop string);
   static void finalize_initialization(FileMapInfo* static_mapinfo) NOT_CDS_JAVA_HEAP_RETURN;
 
 private:
@@ -195,13 +194,8 @@ private:
   static void print_stats();
 public:
   static void debug_trace();
-  static unsigned oop_hash(oop const& p);
-  static unsigned oop_handle_hash(OopHandle const& oh);
-  static unsigned oop_handle_hash_raw(OopHandle const& oh);
+  static unsigned oop_address_hash(oop const& p);
   static bool oop_handle_equals(const OopHandle& a, const OopHandle& b);
-  static unsigned string_oop_hash(oop const& string) {
-    return java_lang_String::hash_code(string);
-  }
 
   class CopyKlassSubGraphInfoToArchive;
 
@@ -217,27 +211,37 @@ public:
 
     // One or more fields in this object are pointing to MetaspaceObj
     bool _has_native_pointers;
+
+    // >= 0 if this oop has been append to the list of roots
+    int _root_index;
   public:
     CachedOopInfo(OopHandle orig_referrer, bool has_oop_pointers)
       : _orig_referrer(orig_referrer),
         _buffer_offset(0),
         _has_oop_pointers(has_oop_pointers),
-        _has_native_pointers(false) {}
+        _has_native_pointers(false),
+        _root_index(-1) {}
     oop orig_referrer() const;
     void set_buffer_offset(size_t offset) { _buffer_offset = offset; }
     size_t buffer_offset()          const { return _buffer_offset;   }
     bool has_oop_pointers()         const { return _has_oop_pointers; }
     bool has_native_pointers()      const { return _has_native_pointers; }
     void set_has_native_pointers()        { _has_native_pointers = true; }
+    int  root_index()               const { return _root_index; }
+    void set_root_index(int i)            { _root_index = i; }
   };
 
 private:
   static const int INITIAL_TABLE_SIZE = 15889; // prime number
   static const int MAX_TABLE_SIZE     = 1000000;
+  static bool _use_identity_hash_for_archived_object_cache;
+
+  static unsigned archived_object_cache_hash(OopHandle const& oh);
+
   typedef ResizeableHashTable<OopHandle, CachedOopInfo,
       AnyObj::C_HEAP,
       mtClassShared,
-      HeapShared::oop_handle_hash_raw,
+      HeapShared::archived_object_cache_hash,
       HeapShared::oop_handle_equals> ArchivedObjectCache;
   static ArchivedObjectCache* _archived_object_cache;
 
@@ -297,7 +301,7 @@ private:
   typedef ResizeableHashTable<oop, bool,
       AnyObj::C_HEAP,
       mtClassShared,
-      HeapShared::oop_hash> SeenObjectsTable;
+      HeapShared::oop_address_hash> SeenObjectsTable;
 
   static SeenObjectsTable *_seen_objects_table;
 
@@ -394,6 +398,7 @@ private:
     delete _archived_object_cache;
     _archived_object_cache = nullptr;
   }
+  static void make_archived_object_cache_gc_safe();
   static ArchivedObjectCache* archived_object_cache() {
     return _archived_object_cache;
   }
@@ -406,6 +411,7 @@ private:
                                              KlassSubGraphInfo* subgraph_info,
                                              oop orig_obj);
 
+  static bool is_interned_string(oop obj);
   static bool is_dumped_interned_string(oop o);
 
   // Scratch objects for archiving Klass::java_mirror()
@@ -437,6 +443,11 @@ private:
   // Dump-time only. Returns the index of the root, which can be used at run time to read
   // the root using get_root(index, ...).
   static int append_root(oop obj);
+
+  // AOT-compile time only.
+  // Returns -1 if obj is not in the heap root set.
+  static int get_root_index(oop obj) NOT_CDS_JAVA_HEAP_RETURN_(-1);
+
   static GrowableArrayCHeap<oop, mtClassShared>* pending_roots() { return _pending_roots; }
 
   // Dump-time and runtime
@@ -445,9 +456,7 @@ private:
 
   // Run-time only
   static void clear_root(int index);
-
   static void get_segment_indexes(int index, int& segment_index, int& internal_index);
-
   static void setup_test_class(const char* test_class_name) PRODUCT_RETURN;
 #endif // INCLUDE_CDS_JAVA_HEAP
 
diff --git a/src/hotspot/share/classfile/stringTable.cpp b/src/hotspot/share/classfile/stringTable.cpp
index 2b8b7780a41..c3f60487b9c 100644
--- a/src/hotspot/share/classfile/stringTable.cpp
+++ b/src/hotspot/share/classfile/stringTable.cpp
@@ -946,7 +946,7 @@ void StringTable::init_shared_table() {
       //   so we are all good.
       // - If there's a reference to it, we will report an error inside HeapShared.cpp and
       //   dumping will fail.
-      HeapShared::add_to_dumped_interned_strings(string);
+      HeapShared::archive_interned_string(string);
     }
     n++;
     return true;

From b0831572e2cd9dbff9ee2abcdf81a493ddcecc7e Mon Sep 17 00:00:00 2001
From: Kieran Farrell <kfarrell@openjdk.org>
Date: Tue, 17 Mar 2026 06:00:32 +0000
Subject: [PATCH 217/655] 8359706: Add file descriptor count to VM.info

Reviewed-by: kevinw, stuefe
---
 src/hotspot/os/aix/os_aix.cpp               |  4 ++
 src/hotspot/os/bsd/os_bsd.cpp               | 44 +++++++++++++++++++++
 src/hotspot/os/bsd/os_bsd.hpp               |  2 +
 src/hotspot/os/linux/os_linux.cpp           | 34 ++++++++++++++++
 src/hotspot/os/windows/os_windows.cpp       |  4 ++
 src/hotspot/share/runtime/os.hpp            |  3 ++
 src/hotspot/share/utilities/vmError.cpp     |  9 +++++
 test/jdk/sun/tools/jcmd/TestJcmdSanity.java |  6 ++-
 8 files changed, 105 insertions(+), 1 deletion(-)

diff --git a/src/hotspot/os/aix/os_aix.cpp b/src/hotspot/os/aix/os_aix.cpp
index 7c08d6de2db..3cad24d388c 100644
--- a/src/hotspot/os/aix/os_aix.cpp
+++ b/src/hotspot/os/aix/os_aix.cpp
@@ -2667,3 +2667,7 @@ void os::print_memory_mappings(char* addr, size_t bytes, outputStream* st) {}
 void os::jfr_report_memory_info() {}
 
 #endif // INCLUDE_JFR
+
+void os::print_open_file_descriptors(outputStream* st) {
+  // File descriptor counting not implemented on AIX
+}
diff --git a/src/hotspot/os/bsd/os_bsd.cpp b/src/hotspot/os/bsd/os_bsd.cpp
index 29ebe65e0db..207968a7a59 100644
--- a/src/hotspot/os/bsd/os_bsd.cpp
+++ b/src/hotspot/os/bsd/os_bsd.cpp
@@ -76,6 +76,7 @@
 # include <fcntl.h>
 # include <fenv.h>
 # include <inttypes.h>
+# include <mach/mach.h>
 # include <poll.h>
 # include <pthread.h>
 # include <pwd.h>
@@ -102,6 +103,7 @@
 #endif
 
 #ifdef __APPLE__
+  #include <libproc.h>
   #include <mach/task_info.h>
   #include <mach-o/dyld.h>
 #endif
@@ -2596,3 +2598,45 @@ bool os::pd_dll_unload(void* libhandle, char* ebuf, int ebuflen) {
 
   return res;
 } // end: os::pd_dll_unload()
+
+void os::print_open_file_descriptors(outputStream* st) {
+#ifdef __APPLE__
+  char buf[1024 * sizeof(struct proc_fdinfo)];
+  os::Bsd::print_open_file_descriptors(st, buf, sizeof(buf));
+#else
+  st->print_cr("Open File Descriptors: unknown");
+#endif
+}
+
+void os::Bsd::print_open_file_descriptors(outputStream* st, char* buf, size_t buflen) {
+#ifdef __APPLE__
+  pid_t my_pid;
+
+  // ensure the scratch buffer is big enough for at least one FD info struct
+  assert(buflen >= sizeof(struct proc_fdinfo));
+  kern_return_t kres = pid_for_task(mach_task_self(), &my_pid);
+  if (kres != KERN_SUCCESS) {
+    st->print_cr("Open File Descriptors: unknown");
+    return;
+  }
+  size_t max_fds = buflen / sizeof(struct proc_fdinfo);
+  struct proc_fdinfo* fds = reinterpret_cast<struct proc_fdinfo*>(buf);
+
+  // fill our buffer with FD info, up to the available buffer size
+  int res = proc_pidinfo(my_pid, PROC_PIDLISTFDS, 0, fds, max_fds * sizeof(struct proc_fdinfo));
+  if (res <= 0) {
+    st->print_cr("Open File Descriptors: unknown");
+    return;
+  }
+
+  // print lower threshold if count exceeds buffer size
+  int nfiles = res / sizeof(struct proc_fdinfo);
+  if ((size_t)nfiles >= max_fds) {
+    st->print_cr("Open File Descriptors: > %zu", max_fds);
+    return;
+  }
+  st->print_cr("Open File Descriptors: %d", nfiles);
+#else
+  st->print_cr("Open File Descriptors: unknown");
+#endif
+}
\ No newline at end of file
diff --git a/src/hotspot/os/bsd/os_bsd.hpp b/src/hotspot/os/bsd/os_bsd.hpp
index da73211b9a7..e87a680b2d2 100644
--- a/src/hotspot/os/bsd/os_bsd.hpp
+++ b/src/hotspot/os/bsd/os_bsd.hpp
@@ -123,6 +123,8 @@ class os::Bsd {
   static int get_node_by_cpu(int cpu_id);
 
   static void print_uptime_info(outputStream* st);
+  static void print_open_file_descriptors(outputStream* st, char* buf, size_t buflen);
+  static void print_open_file_descriptors(outputStream* st);
 };
 
 #endif // OS_BSD_OS_BSD_HPP
diff --git a/src/hotspot/os/linux/os_linux.cpp b/src/hotspot/os/linux/os_linux.cpp
index 17cd0d05f9a..5e911ce0f44 100644
--- a/src/hotspot/os/linux/os_linux.cpp
+++ b/src/hotspot/os/linux/os_linux.cpp
@@ -83,6 +83,7 @@
 #endif
 
 # include <ctype.h>
+# include <dirent.h>
 # include <dlfcn.h>
 # include <endian.h>
 # include <errno.h>
@@ -113,6 +114,7 @@
 # include <sys/types.h>
 # include <sys/utsname.h>
 # include <syscall.h>
+# include <time.h>
 # include <unistd.h>
 #ifdef __GLIBC__
 # include <malloc.h>
@@ -2161,6 +2163,8 @@ void os::print_os_info(outputStream* st) {
 
   os::Posix::print_rlimit_info(st);
 
+  os::print_open_file_descriptors(st);
+
   os::Posix::print_load_average(st);
   st->cr();
 
@@ -5429,3 +5433,33 @@ bool os::pd_dll_unload(void* libhandle, char* ebuf, int ebuflen) {
 
   return res;
 } // end: os::pd_dll_unload()
+
+void os::print_open_file_descriptors(outputStream* st) {
+  DIR* dirp = opendir("/proc/self/fd");
+  int fds = 0;
+  struct dirent* dentp;
+  const jlong TIMEOUT_NS = 50000000L;  // 50 ms in nanoseconds
+  bool timed_out = false;
+
+  // limit proc file read to 50ms
+  jlong start = os::javaTimeNanos();
+  assert(dirp != nullptr, "No proc fs?");
+  while ((dentp = readdir(dirp)) != nullptr && !timed_out) {
+    if (isdigit(dentp->d_name[0])) fds++;
+    if (fds % 100 == 0) {
+      jlong now = os::javaTimeNanos();
+      if ((now - start) > TIMEOUT_NS) {
+        timed_out = true;
+      }
+    }
+  }
+
+  closedir(dirp);
+  if (timed_out) {
+    st->print_cr("Open File Descriptors: > %d", fds);
+  } else {
+    st->print_cr("Open File Descriptors: %d", fds);
+  }
+}
+
+
diff --git a/src/hotspot/os/windows/os_windows.cpp b/src/hotspot/os/windows/os_windows.cpp
index 76f47640e5a..01162ef930d 100644
--- a/src/hotspot/os/windows/os_windows.cpp
+++ b/src/hotspot/os/windows/os_windows.cpp
@@ -6276,6 +6276,10 @@ const void* os::get_saved_assert_context(const void** sigInfo) {
   return nullptr;
 }
 
+void os::print_open_file_descriptors(outputStream* st) {
+  // File descriptor counting not supported on Windows.
+}
+
 /*
  * Windows/x64 does not use stack frames the way expected by Java:
  * [1] in most cases, there is no frame pointer. All locals are addressed via RSP
diff --git a/src/hotspot/share/runtime/os.hpp b/src/hotspot/share/runtime/os.hpp
index e185188384f..d0544cb5b51 100644
--- a/src/hotspot/share/runtime/os.hpp
+++ b/src/hotspot/share/runtime/os.hpp
@@ -893,6 +893,9 @@ class os: AllStatic {
   static void print_date_and_time(outputStream* st, char* buf, size_t buflen);
   static void print_elapsed_time(outputStream* st, double time);
 
+  // Prints the number of open file descriptors for the current process
+  static void print_open_file_descriptors(outputStream* st);
+
   static void print_user_info(outputStream* st);
   static void print_active_locale(outputStream* st);
 
diff --git a/src/hotspot/share/utilities/vmError.cpp b/src/hotspot/share/utilities/vmError.cpp
index e79c9cb694e..48fae6868ab 100644
--- a/src/hotspot/share/utilities/vmError.cpp
+++ b/src/hotspot/share/utilities/vmError.cpp
@@ -1329,6 +1329,13 @@ void VMError::report(outputStream* st, bool _verbose) {
   STEP_IF("printing OS information", _verbose)
     os::print_os_info(st);
     st->cr();
+#ifdef __APPLE__
+    // Avoid large stack allocation on Mac for FD count during signal-handling.
+    os::Bsd::print_open_file_descriptors(st, buf, sizeof(buf));
+    st->cr();
+#else
+    os::print_open_file_descriptors(st);
+#endif
 
   STEP_IF("printing CPU info", _verbose)
     os::print_cpu_info(st, buf, sizeof(buf));
@@ -1550,6 +1557,8 @@ void VMError::print_vm_info(outputStream* st) {
 
   os::print_os_info(st);
   st->cr();
+  os::print_open_file_descriptors(st);
+  st->cr();
 
   // STEP("printing CPU info")
 
diff --git a/test/jdk/sun/tools/jcmd/TestJcmdSanity.java b/test/jdk/sun/tools/jcmd/TestJcmdSanity.java
index 92f73597ce6..559b6b7d5a4 100644
--- a/test/jdk/sun/tools/jcmd/TestJcmdSanity.java
+++ b/test/jdk/sun/tools/jcmd/TestJcmdSanity.java
@@ -33,7 +33,6 @@ import java.util.List;
 import jdk.test.lib.process.OutputAnalyzer;
 import jdk.test.lib.process.ProcessTools;
 import jdk.test.lib.Platform;
-import jdk.test.lib.Utils;
 
 /*
  * @test
@@ -182,5 +181,10 @@ public class TestJcmdSanity {
           output.shouldNotContain("*** Handler was modified!");
           output.shouldNotContain("*** Expected: "); // e.g. *** Expected: javaSignalHandler in ...
         }
+
+        // Should find file descriptor counting on Mac and Linux
+        if (Platform.isLinux() || Platform.isOSX()) {
+            output.shouldMatch("Open File Descriptors: \\d+");
+        }
     }
 }

From 3a109f49feb19f313632be6a2aa24ba7d9b7269b Mon Sep 17 00:00:00 2001
From: David Holmes <dholmes@openjdk.org>
Date: Tue, 17 Mar 2026 07:18:40 +0000
Subject: [PATCH 218/655] 8380236: macOS build is broken by JDK-8359706

Reviewed-by: kbarrett
---
 src/hotspot/os/bsd/os_bsd.cpp | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/src/hotspot/os/bsd/os_bsd.cpp b/src/hotspot/os/bsd/os_bsd.cpp
index 207968a7a59..a4d9a2197a5 100644
--- a/src/hotspot/os/bsd/os_bsd.cpp
+++ b/src/hotspot/os/bsd/os_bsd.cpp
@@ -2613,7 +2613,7 @@ void os::Bsd::print_open_file_descriptors(outputStream* st, char* buf, size_t bu
   pid_t my_pid;
 
   // ensure the scratch buffer is big enough for at least one FD info struct
-  assert(buflen >= sizeof(struct proc_fdinfo));
+  precond(buflen >= sizeof(struct proc_fdinfo));
   kern_return_t kres = pid_for_task(mach_task_self(), &my_pid);
   if (kres != KERN_SUCCESS) {
     st->print_cr("Open File Descriptors: unknown");
@@ -2639,4 +2639,4 @@ void os::Bsd::print_open_file_descriptors(outputStream* st, char* buf, size_t bu
 #else
   st->print_cr("Open File Descriptors: unknown");
 #endif
-}
\ No newline at end of file
+}

From 0b17e0093d35972db7c228098d991a684ab6f07f Mon Sep 17 00:00:00 2001
From: Harshit Dhiman <harshitdhiman1402@gmail.com>
Date: Tue, 17 Mar 2026 09:25:00 +0000
Subject: [PATCH 219/655] 8347396: Efficient TypeFunc creations

Reviewed-by: dlong, vlivanov, adinn
---
 .../share/gc/shared/c2/barrierSetC2.cpp       | 12 +++++-
 .../share/gc/shared/c2/barrierSetC2.hpp       |  6 +++
 .../shenandoah/c2/shenandoahBarrierSetC2.cpp  | 40 ++++++++++++++++---
 .../shenandoah/c2/shenandoahBarrierSetC2.hpp  |  9 +++++
 src/hotspot/share/opto/type.cpp               |  8 ++++
 5 files changed, 67 insertions(+), 8 deletions(-)

diff --git a/src/hotspot/share/gc/shared/c2/barrierSetC2.cpp b/src/hotspot/share/gc/shared/c2/barrierSetC2.cpp
index 53577bad1d8..ad7fc31dc09 100644
--- a/src/hotspot/share/gc/shared/c2/barrierSetC2.cpp
+++ b/src/hotspot/share/gc/shared/c2/barrierSetC2.cpp
@@ -813,7 +813,10 @@ Node* BarrierSetC2::obj_allocate(PhaseMacroExpand* macro, Node* mem, Node* toobi
   return old_tlab_top;
 }
 
-static const TypeFunc* clone_type() {
+const TypeFunc* BarrierSetC2::_clone_type_Type = nullptr;
+
+void BarrierSetC2::make_clone_type() {
+  assert(BarrierSetC2::_clone_type_Type == nullptr, "should be");
   // Create input type (domain)
   int argcnt = NOT_LP64(3) LP64_ONLY(4);
   const Type** const domain_fields = TypeTuple::fields(argcnt);
@@ -829,7 +832,12 @@ static const TypeFunc* clone_type() {
   const Type** const range_fields = TypeTuple::fields(0);
   const TypeTuple* const range = TypeTuple::make(TypeFunc::Parms + 0, range_fields);
 
-  return TypeFunc::make(domain, range);
+  BarrierSetC2::_clone_type_Type = TypeFunc::make(domain, range);
+}
+
+inline const TypeFunc* BarrierSetC2::clone_type() {
+  assert(BarrierSetC2::_clone_type_Type != nullptr, "should be initialized");
+  return BarrierSetC2::_clone_type_Type;
 }
 
 #define XTOP LP64_ONLY(COMMA phase->top())
diff --git a/src/hotspot/share/gc/shared/c2/barrierSetC2.hpp b/src/hotspot/share/gc/shared/c2/barrierSetC2.hpp
index 7b9cb985cff..a486a88c48f 100644
--- a/src/hotspot/share/gc/shared/c2/barrierSetC2.hpp
+++ b/src/hotspot/share/gc/shared/c2/barrierSetC2.hpp
@@ -270,6 +270,9 @@ public:
 // various GC barrier sets inherit from the BarrierSetC2 class to sprinkle
 // barriers into the accesses.
 class BarrierSetC2: public CHeapObj<mtGC> {
+private:
+  static const TypeFunc* _clone_type_Type;
+
 protected:
   virtual void resolve_address(C2Access& access) const;
   virtual Node* store_at_resolved(C2Access& access, C2AccessValue& val) const;
@@ -379,6 +382,9 @@ public:
 
   static int arraycopy_payload_base_offset(bool is_array);
 
+  static void make_clone_type();
+  static const TypeFunc* clone_type();
+
 #ifndef PRODUCT
   virtual void dump_barrier_data(const MachNode* mach, outputStream* st) const {
     st->print("%x", mach->barrier_data());
diff --git a/src/hotspot/share/gc/shenandoah/c2/shenandoahBarrierSetC2.cpp b/src/hotspot/share/gc/shenandoah/c2/shenandoahBarrierSetC2.cpp
index fdfde866cd7..1947c75314e 100644
--- a/src/hotspot/share/gc/shenandoah/c2/shenandoahBarrierSetC2.cpp
+++ b/src/hotspot/share/gc/shenandoah/c2/shenandoahBarrierSetC2.cpp
@@ -519,7 +519,33 @@ void ShenandoahBarrierSetC2::post_barrier(GraphKit* kit,
 
 #undef __
 
-const TypeFunc* ShenandoahBarrierSetC2::write_barrier_pre_Type() {
+const TypeFunc* ShenandoahBarrierSetC2::_write_barrier_pre_Type              = nullptr;
+const TypeFunc* ShenandoahBarrierSetC2::_clone_barrier_Type                  = nullptr;
+const TypeFunc* ShenandoahBarrierSetC2::_load_reference_barrier_Type         = nullptr;
+
+inline const TypeFunc* ShenandoahBarrierSetC2::write_barrier_pre_Type() {
+  assert(ShenandoahBarrierSetC2::_write_barrier_pre_Type != nullptr, "should be initialized");
+  return ShenandoahBarrierSetC2::_write_barrier_pre_Type;
+}
+
+inline const TypeFunc* ShenandoahBarrierSetC2::clone_barrier_Type() {
+  assert(ShenandoahBarrierSetC2::_clone_barrier_Type != nullptr, "should be initialized");
+  return ShenandoahBarrierSetC2::_clone_barrier_Type;
+}
+
+const TypeFunc* ShenandoahBarrierSetC2::load_reference_barrier_Type() {
+  assert(ShenandoahBarrierSetC2::_load_reference_barrier_Type != nullptr, "should be initialized");
+  return ShenandoahBarrierSetC2::_load_reference_barrier_Type;
+}
+
+void ShenandoahBarrierSetC2::init() {
+  ShenandoahBarrierSetC2::make_write_barrier_pre_Type();
+  ShenandoahBarrierSetC2::make_clone_barrier_Type();
+  ShenandoahBarrierSetC2::make_load_reference_barrier_Type();
+}
+
+void ShenandoahBarrierSetC2::make_write_barrier_pre_Type() {
+  assert(ShenandoahBarrierSetC2::_write_barrier_pre_Type == nullptr, "should be");
   const Type **fields = TypeTuple::fields(1);
   fields[TypeFunc::Parms+0] = TypeInstPtr::NOTNULL; // original field value
   const TypeTuple *domain = TypeTuple::make(TypeFunc::Parms+1, fields);
@@ -528,10 +554,11 @@ const TypeFunc* ShenandoahBarrierSetC2::write_barrier_pre_Type() {
   fields = TypeTuple::fields(0);
   const TypeTuple *range = TypeTuple::make(TypeFunc::Parms+0, fields);
 
-  return TypeFunc::make(domain, range);
+  ShenandoahBarrierSetC2::_write_barrier_pre_Type = TypeFunc::make(domain, range);
 }
 
-const TypeFunc* ShenandoahBarrierSetC2::clone_barrier_Type() {
+void ShenandoahBarrierSetC2::make_clone_barrier_Type() {
+  assert(ShenandoahBarrierSetC2::_clone_barrier_Type == nullptr, "should be");
   const Type **fields = TypeTuple::fields(1);
   fields[TypeFunc::Parms+0] = TypeOopPtr::NOTNULL; // src oop
   const TypeTuple *domain = TypeTuple::make(TypeFunc::Parms+1, fields);
@@ -540,10 +567,11 @@ const TypeFunc* ShenandoahBarrierSetC2::clone_barrier_Type() {
   fields = TypeTuple::fields(0);
   const TypeTuple *range = TypeTuple::make(TypeFunc::Parms+0, fields);
 
-  return TypeFunc::make(domain, range);
+  ShenandoahBarrierSetC2::_clone_barrier_Type = TypeFunc::make(domain, range);
 }
 
-const TypeFunc* ShenandoahBarrierSetC2::load_reference_barrier_Type() {
+void ShenandoahBarrierSetC2::make_load_reference_barrier_Type() {
+  assert(ShenandoahBarrierSetC2::_load_reference_barrier_Type == nullptr, "should be");
   const Type **fields = TypeTuple::fields(2);
   fields[TypeFunc::Parms+0] = TypeOopPtr::BOTTOM; // original field value
   fields[TypeFunc::Parms+1] = TypeRawPtr::BOTTOM; // original load address
@@ -555,7 +583,7 @@ const TypeFunc* ShenandoahBarrierSetC2::load_reference_barrier_Type() {
   fields[TypeFunc::Parms+0] = TypeOopPtr::BOTTOM;
   const TypeTuple *range = TypeTuple::make(TypeFunc::Parms+1, fields);
 
-  return TypeFunc::make(domain, range);
+  ShenandoahBarrierSetC2::_load_reference_barrier_Type = TypeFunc::make(domain, range);
 }
 
 Node* ShenandoahBarrierSetC2::store_at_resolved(C2Access& access, C2AccessValue& val) const {
diff --git a/src/hotspot/share/gc/shenandoah/c2/shenandoahBarrierSetC2.hpp b/src/hotspot/share/gc/shenandoah/c2/shenandoahBarrierSetC2.hpp
index dd9e9bcc1a5..108eaa0998b 100644
--- a/src/hotspot/share/gc/shenandoah/c2/shenandoahBarrierSetC2.hpp
+++ b/src/hotspot/share/gc/shenandoah/c2/shenandoahBarrierSetC2.hpp
@@ -82,6 +82,13 @@ private:
 
   static bool clone_needs_barrier(Node* src, PhaseGVN& gvn);
 
+  static const TypeFunc* _write_barrier_pre_Type;
+  static const TypeFunc* _clone_barrier_Type;
+  static const TypeFunc* _load_reference_barrier_Type;
+  static void make_write_barrier_pre_Type();
+  static void make_clone_barrier_Type();
+  static void make_load_reference_barrier_Type();
+
 protected:
   virtual Node* load_at_resolved(C2Access& access, const Type* val_type) const;
   virtual Node* store_at_resolved(C2Access& access, C2AccessValue& val) const;
@@ -106,6 +113,8 @@ public:
   static const TypeFunc* write_barrier_pre_Type();
   static const TypeFunc* clone_barrier_Type();
   static const TypeFunc* load_reference_barrier_Type();
+  static void init();
+
   virtual bool has_load_barrier_nodes() const { return true; }
 
   // This is the entry-point for the backend to perform accesses through the Access API.
diff --git a/src/hotspot/share/opto/type.cpp b/src/hotspot/share/opto/type.cpp
index 1a0872ee0e6..aab2ea3cd3b 100644
--- a/src/hotspot/share/opto/type.cpp
+++ b/src/hotspot/share/opto/type.cpp
@@ -49,6 +49,9 @@
 #include "utilities/ostream.hpp"
 #include "utilities/powerOfTwo.hpp"
 #include "utilities/stringUtils.hpp"
+#if INCLUDE_SHENANDOAHGC
+#include "gc/shenandoah/c2/shenandoahBarrierSetC2.hpp"
+#endif // INCLUDE_SHENANDOAHGC
 
 // Portions of code courtesy of Clifford Click
 
@@ -732,6 +735,11 @@ void Type::Initialize_shared(Compile* current) {
   mreg2type[Op_VecY] = TypeVect::VECTY;
   mreg2type[Op_VecZ] = TypeVect::VECTZ;
 
+#if INCLUDE_SHENANDOAHGC
+  ShenandoahBarrierSetC2::init();
+#endif //INCLUDE_SHENANDOAHGC
+
+  BarrierSetC2::make_clone_type();
   LockNode::initialize_lock_Type();
   ArrayCopyNode::initialize_arraycopy_Type();
   OptoRuntime::initialize_types();

From da85cafd796655c13e75e8bf49159386605285d5 Mon Sep 17 00:00:00 2001
From: Brian Burkhalter <bpb@openjdk.org>
Date: Tue, 17 Mar 2026 16:11:38 +0000
Subject: [PATCH 220/655] 8380198: Convert java/util/prefs/PrefsSpiTest.java to
 JUnit

Reviewed-by: jlu
---
 test/jdk/java/util/prefs/PrefsSpiTest.java | 39 +++++++++++-----------
 1 file changed, 20 insertions(+), 19 deletions(-)

diff --git a/test/jdk/java/util/prefs/PrefsSpiTest.java b/test/jdk/java/util/prefs/PrefsSpiTest.java
index 0369c60cae2..08fff81a552 100644
--- a/test/jdk/java/util/prefs/PrefsSpiTest.java
+++ b/test/jdk/java/util/prefs/PrefsSpiTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -28,7 +28,7 @@
  * @library /test/lib
  * @build jdk.test.lib.util.JarUtils jdk.test.lib.process.*
  *        PrefsSpi StubPreferencesFactory StubPreferences
- * @run testng PrefsSpiTest
+ * @run junit PrefsSpiTest
  */
 
 import java.io.File;
@@ -36,16 +36,13 @@ import java.nio.file.Files;
 import java.nio.file.Path;
 import java.util.ArrayList;
 import java.util.List;
+import java.util.stream.Stream;
 
 import jdk.test.lib.JDKToolFinder;
 import jdk.test.lib.Utils;
 import jdk.test.lib.process.ProcessTools;
 import jdk.test.lib.util.JarUtils;
 
-import org.testng.annotations.BeforeClass;
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
-
 import static java.nio.file.StandardCopyOption.REPLACE_EXISTING;
 import static java.nio.file.StandardOpenOption.CREATE;
 import static java.util.Arrays.asList;
@@ -53,14 +50,19 @@ import static java.util.Arrays.asList;
 import static jdk.test.lib.Utils.TEST_CLASSES;
 import static jdk.test.lib.Utils.TEST_CLASS_PATH;
 
+import org.junit.jupiter.api.BeforeAll;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.Arguments;
+import org.junit.jupiter.params.provider.MethodSource;
+
 public class PrefsSpiTest {
 
     private static final Path SPIJAR = Path.of("extDir", "PrefsSpi.jar");
     private static final String SPIJAR_CP = TEST_CLASS_PATH
             + File.pathSeparator + SPIJAR.toString();
 
-    @BeforeClass
-    public void initialize() throws Exception {
+    @BeforeAll
+    public static void initialize() throws Exception {
         Path xdir = Path.of("jarDir");
 
         Path config = xdir.resolve("META-INF/services/java.util.prefs.PreferencesFactory");
@@ -77,19 +79,18 @@ public class PrefsSpiTest {
         JarUtils.createJarFile(SPIJAR, xdir);
     }
 
-    @DataProvider
-    public Object[][] testCases() {
-        return new Object[][]{
-            // CLI options,                        runtime arguments
-            {List.of("-cp", SPIJAR_CP,
-                     "-Djava.util.prefs.PreferencesFactory=StubPreferencesFactory"),
-                                                   "StubPreferences"},
-            {List.of("-cp", TEST_CLASS_PATH),      "java.util.prefs.*"},
-            {List.of("-cp", SPIJAR_CP),            "StubPreferences"}
-        };
+    public static Stream<Arguments> testCases() {
+        return Stream.of
+            (// CLI options,             runtime arguments
+             Arguments.of(List.of("-cp", SPIJAR_CP,
+                 "-Djava.util.prefs.PreferencesFactory=StubPreferencesFactory"),
+                 "StubPreferences"),
+             Arguments.of(List.of("-cp", TEST_CLASS_PATH), "java.util.prefs.*"),
+             Arguments.of(List.of("-cp", SPIJAR_CP), "StubPreferences"));
     }
 
-    @Test(dataProvider = "testCases")
+    @ParameterizedTest
+    @MethodSource("testCases")
     public void testProvider(List<String> opts, String pattern) throws Throwable {
         List<String> args = new ArrayList<>();
         args.add(JDKToolFinder.getJDKTool("java"));

From 773c375f1813afb0acf6bd1731eac39d5a43d0b4 Mon Sep 17 00:00:00 2001
From: Brian Burkhalter <bpb@openjdk.org>
Date: Tue, 17 Mar 2026 16:12:02 +0000
Subject: [PATCH 221/655] 8380221: Change jdk/nio/Basic.java to use JUnit

Reviewed-by: jlu, alanb
---
 test/jdk/jdk/nio/Basic.java | 81 +++++++++++++++++++++----------------
 1 file changed, 46 insertions(+), 35 deletions(-)

diff --git a/test/jdk/jdk/nio/Basic.java b/test/jdk/jdk/nio/Basic.java
index 02fcfbc4a4d..68f8f00e309 100644
--- a/test/jdk/jdk/nio/Basic.java
+++ b/test/jdk/jdk/nio/Basic.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,7 +25,7 @@
  * @test
  * @bug 8198372
  * @modules jdk.net java.base/sun.nio.ch:+open
- * @run testng Basic
+ * @run junit Basic
  * @summary Basic tests for jdk.nio.Channels
  */
 
@@ -48,10 +48,14 @@ import jdk.nio.Channels.SelectableChannelCloser;
 
 import sun.nio.ch.IOUtil;
 
-import org.testng.annotations.Test;
-import static org.testng.Assert.*;
+import org.junit.jupiter.api.Test;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertFalse;
+import static org.junit.jupiter.api.Assertions.assertSame;
+import static org.junit.jupiter.api.Assertions.assertThrows;
+import static org.junit.jupiter.api.Assertions.assertTrue;
+import static org.junit.jupiter.api.Assertions.fail;
 
-@Test
 public class Basic {
 
     /**
@@ -119,6 +123,7 @@ public class Basic {
     /**
      * Basic test of channel registered with Selector
      */
+    @Test
     public void testSelect() throws IOException {
         Selector sel = Selector.open();
         try (Connection connection = Connection.open()) {
@@ -131,7 +136,7 @@ public class Basic {
             ch.configureBlocking(false);
             SelectionKey key = ch.register(sel, SelectionKey.OP_READ);
             int n = sel.selectNow();
-            assertTrue(n == 0);
+            assertEquals(0, n);
 
             // write bytes to other end of connection
             SocketChannel peer = connection.channel2();
@@ -141,7 +146,7 @@ public class Basic {
 
             // channel should be selected
             n = sel.select();
-            assertTrue(n == 1);
+            assertEquals(1, n);
             assertTrue(sel.selectedKeys().contains(key));
             assertTrue(key.isReadable());
             assertFalse(key.isWritable());
@@ -150,7 +155,7 @@ public class Basic {
             // change interest set for writing, channel should be selected
             key.interestOps(SelectionKey.OP_WRITE);
             n = sel.select();
-            assertTrue(n == 1);
+            assertEquals(1, n);
             assertTrue(sel.selectedKeys().contains(key));
             assertTrue(key.isWritable());
             assertFalse(key.isReadable());
@@ -159,7 +164,7 @@ public class Basic {
             // change interest set for reading + writing, channel should be selected
             key.interestOps(SelectionKey.OP_READ | SelectionKey.OP_WRITE);
             n = sel.select();
-            assertTrue(n == 1);
+            assertEquals(1, n);
             assertTrue(sel.selectedKeys().contains(key));
             assertTrue(key.isWritable());
             assertTrue(key.isReadable());
@@ -168,7 +173,7 @@ public class Basic {
             // change interest set to 0 to deregister, channel should not be selected
             key.interestOps(0);
             n = sel.selectNow();
-            assertTrue(n == 0);
+            assertEquals(0, n);
 
         } finally {
             sel.close();
@@ -178,6 +183,7 @@ public class Basic {
     /**
      * Test that the SelectableChannelCloser implCloseChannel method is invoked.
      */
+    @Test
     public void testImplCloseChannel() throws IOException {
         try (Connection connection = Connection.open()) {
             FileDescriptor fd = getFD(connection.channel1());
@@ -189,11 +195,11 @@ public class Basic {
                 ch.close();
 
                 // implCloseChannel should been invoked once
-                assertTrue(closer.closeCount == 1);
-                assertTrue(closer.invokedToClose == ch);
+                assertEquals(1, closer.closeCount);
+                assertSame(ch, closer.invokedToClose);
 
                 // implReleaseChannel should not have been invoked
-                assertTrue(closer.releaseCount == 0);
+                assertEquals(0, closer.releaseCount);
             }
         }
     }
@@ -201,6 +207,7 @@ public class Basic {
     /**
      * Test that the SelectableChannelCloser implReleaseChannel method is invoked.
      */
+    @Test
     public void testImplReleaseChannel() throws IOException {
         Selector sel = Selector.open();
         try (Connection connection = Connection.open()) {
@@ -217,50 +224,53 @@ public class Basic {
             ch.close();
 
             // implCloseChannel should have been invoked
-            assertTrue(closer.closeCount == 1);
-            assertTrue(closer.invokedToClose == ch);
+            assertEquals(1, closer.closeCount);
+            assertSame(ch, closer.invokedToClose);
 
             // implReleaseChannel should not have been invoked
-            assertTrue(closer.releaseCount == 0);
+            assertEquals(0, closer.releaseCount);
 
             // flush the selector
             sel.selectNow();
 
             // implReleaseChannel should have been invoked
-            assertTrue(closer.releaseCount == 1);
-            assertTrue(closer.invokedToRelease == ch);
+            assertEquals(1, closer.releaseCount);
+            assertSame(ch, closer.invokedToRelease);
 
         } finally {
             sel.close();
         }
     }
 
-    @Test(expectedExceptions = IllegalArgumentException.class)
+    @Test
     public void testInvalidFileDescriptor() throws IOException {
         FileDescriptor fd = IOUtil.newFD(-1);
-        Channels.readWriteSelectableChannel(fd, new SelectableChannelCloser() {
-            @Override
-            public void implCloseChannel(SelectableChannel sc) { }
-            @Override
-            public void implReleaseChannel(SelectableChannel sc) { }
-        });
+        assertThrows
+            (IllegalArgumentException.class,
+             () -> Channels.readWriteSelectableChannel(fd, new SelectableChannelCloser() {
+                     @Override
+                     public void implCloseChannel(SelectableChannel sc) { }
+                     @Override
+                     public void implReleaseChannel(SelectableChannel sc) { }}));
     }
 
-    @Test(expectedExceptions = NullPointerException.class)
+    @Test
     public void testNullFileDescriptor() throws IOException {
-        Channels.readWriteSelectableChannel(null, new SelectableChannelCloser() {
-            @Override
-            public void implCloseChannel(SelectableChannel sc) { }
-            @Override
-            public void implReleaseChannel(SelectableChannel sc) { }
-        });
+        assertThrows
+            (NullPointerException.class,
+             () -> Channels.readWriteSelectableChannel(null, new SelectableChannelCloser() {
+                     @Override
+                     public void implCloseChannel(SelectableChannel sc) { }
+                     @Override
+                     public void implReleaseChannel(SelectableChannel sc) { }}));
     }
 
-    @Test(expectedExceptions = NullPointerException.class)
+    @Test
     public void testNullCloser() throws IOException {
         try (Connection connection = Connection.open()) {
             FileDescriptor fd = getFD(connection.channel1());
-            Channels.readWriteSelectableChannel(fd, null);
+            assertThrows(NullPointerException.class,
+                         () -> Channels.readWriteSelectableChannel(fd, null));
         }
     }
 
@@ -271,7 +281,8 @@ public class Basic {
             f.setAccessible(true);
             return (FileDescriptor) f.get(sc);
         } catch (Exception e) {
-            throw new Error(e);
+            fail(e);
+            return null; // appease compiler
         }
     }
 }

From 9394749f9e788fc538a7876e338e536aa296b70c Mon Sep 17 00:00:00 2001
From: Leo Korinth <lkorinth@openjdk.org>
Date: Tue, 17 Mar 2026 16:16:56 +0000
Subject: [PATCH 222/655] 8377769: Only use large pages sizes that have any
 pages configured

Reviewed-by: ayang, stefank
---
 src/hotspot/os/linux/hugepages.cpp | 26 +++++++++++++++++++++++---
 src/hotspot/os/linux/hugepages.hpp |  6 +++++-
 src/hotspot/os/linux/os_linux.cpp  | 10 +++++-----
 src/hotspot/share/runtime/os.hpp   |  2 +-
 4 files changed, 34 insertions(+), 10 deletions(-)

diff --git a/src/hotspot/os/linux/hugepages.cpp b/src/hotspot/os/linux/hugepages.cpp
index 5472c093d3f..a78f355c179 100644
--- a/src/hotspot/os/linux/hugepages.cpp
+++ b/src/hotspot/os/linux/hugepages.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2005, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2005, 2026, Oracle and/or its affiliates. All rights reserved.
  * Copyright (c) 2011, 2024, Red Hat Inc. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
@@ -35,13 +35,18 @@
 #include <dirent.h>
 
 ExplicitHugePageSupport::ExplicitHugePageSupport() :
-  _initialized(false), _pagesizes(), _default_hugepage_size(SIZE_MAX), _inconsistent(false) {}
+  _initialized(false), _pagesizes(), _pre_allocated_pagesizes(), _default_hugepage_size(SIZE_MAX), _inconsistent(false) {}
 
 os::PageSizes ExplicitHugePageSupport::pagesizes() const {
   assert(_initialized, "Not initialized");
   return _pagesizes;
 }
 
+os::PageSizes ExplicitHugePageSupport::pre_allocated_pagesizes() const {
+  assert(_initialized, "Not initialized");
+  return _pre_allocated_pagesizes;
+}
+
 size_t ExplicitHugePageSupport::default_hugepage_size() const {
   assert(_initialized, "Not initialized");
   return _default_hugepage_size;
@@ -129,6 +134,20 @@ static os::PageSizes scan_hugepages() {
   return pagesizes;
 }
 
+static os::PageSizes filter_pre_allocated_hugepages(os::PageSizes pagesizes) {
+  os::PageSizes pre_allocated{};
+  char filename[PATH_MAX];
+  for (size_t ps = pagesizes.smallest(); ps != 0; ps = pagesizes.next_larger(ps)) {
+    os::snprintf_checked(filename, sizeof(filename), "%s/hugepages-%zukB/nr_hugepages", sys_hugepages, ps / K);
+    size_t pages;
+    bool read_success = read_number_file(filename, &pages);
+    if (read_success && pages > 0) {
+      pre_allocated.add(ps);
+    }
+  }
+  return pre_allocated;
+}
+
 void ExplicitHugePageSupport::print_on(outputStream* os) {
   if (_initialized) {
     os->print_cr("Explicit hugepage support:");
@@ -148,13 +167,14 @@ void ExplicitHugePageSupport::scan_os() {
   _default_hugepage_size = scan_default_hugepagesize();
   if (_default_hugepage_size > 0) {
     _pagesizes = scan_hugepages();
+    _pre_allocated_pagesizes = filter_pre_allocated_hugepages(_pagesizes);
     // See https://www.kernel.org/doc/Documentation/vm/hugetlbpage.txt: /proc/meminfo should match
     // /sys/kernel/mm/hugepages/hugepages-xxxx. However, we may run on a broken kernel (e.g. on WSL)
     // that only exposes /proc/meminfo but not /sys/kernel/mm/hugepages. In that case, we are not
     // sure about the state of hugepage support by the kernel, so we won't use explicit hugepages.
     if (!_pagesizes.contains(_default_hugepage_size)) {
       log_info(pagesize)("Unexpected configuration: default pagesize (%zu) "
-                         "has no associated directory in /sys/kernel/mm/hugepages..", _default_hugepage_size);
+                         "has no associated directory in /sys/kernel/mm/hugepages.", _default_hugepage_size);
       _inconsistent = true;
     }
   }
diff --git a/src/hotspot/os/linux/hugepages.hpp b/src/hotspot/os/linux/hugepages.hpp
index efd27c55fd6..5c190feae97 100644
--- a/src/hotspot/os/linux/hugepages.hpp
+++ b/src/hotspot/os/linux/hugepages.hpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2005, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2005, 2026, Oracle and/or its affiliates. All rights reserved.
  * Copyright (c) 2011, 2024, Red Hat Inc. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
@@ -47,6 +47,9 @@ class ExplicitHugePageSupport {
   // in /sys/kernel/mm/hugepages/hugepage-xxx)
   os::PageSizes _pagesizes;
 
+  // Above pages filtered for where the contents of file nr_hugepages was larger than zero
+  os::PageSizes _pre_allocated_pagesizes;
+
   // Contains the default hugepage. The "default hugepage size" is the one that
   // - is marked in /proc/meminfo as "Hugepagesize"
   // - is the size one gets when using mmap(MAP_HUGETLB) when omitting size specifiers like MAP_HUGE_SHIFT)
@@ -61,6 +64,7 @@ public:
   void scan_os();
 
   os::PageSizes pagesizes() const;
+  os::PageSizes pre_allocated_pagesizes() const;
   size_t default_hugepage_size() const;
   void print_on(outputStream* os);
 
diff --git a/src/hotspot/os/linux/os_linux.cpp b/src/hotspot/os/linux/os_linux.cpp
index 5e911ce0f44..7bde0ae08c9 100644
--- a/src/hotspot/os/linux/os_linux.cpp
+++ b/src/hotspot/os/linux/os_linux.cpp
@@ -3819,7 +3819,7 @@ static int hugetlbfs_page_size_flag(size_t page_size) {
 
 static bool hugetlbfs_sanity_check(size_t page_size) {
   const os::PageSizes page_sizes = HugePages::explicit_hugepage_info().pagesizes();
-  assert(page_sizes.contains(page_size), "Invalid page sizes passed");
+  assert(page_sizes.contains(page_size), "Invalid page sizes passed (%zu)", page_size);
 
   // Include the page size flag to ensure we sanity check the correct page size.
   int flags = MAP_ANONYMOUS | MAP_PRIVATE | MAP_HUGETLB | hugetlbfs_page_size_flag(page_size);
@@ -4066,10 +4066,10 @@ void os::Linux::large_page_init() {
 
     _large_page_size = large_page_size;
 
-    // Populate _page_sizes with large page sizes less than or equal to
-    // _large_page_size.
-    for (size_t page_size = _large_page_size; page_size != 0;
-           page_size = all_large_pages.next_smaller(page_size)) {
+    // Populate _page_sizes with _large_page_size (default large page size) even if not pre-allocated.
+    // Then, populate _page_sizes with all smaller large page sizes that have been pre-allocated.
+    os::PageSizes pre_allocated = HugePages::explicit_hugepage_info().pre_allocated_pagesizes();
+    for (size_t page_size = _large_page_size; page_size != 0; page_size = pre_allocated.next_smaller(page_size)) {
       _page_sizes.add(page_size);
     }
   }
diff --git a/src/hotspot/share/runtime/os.hpp b/src/hotspot/share/runtime/os.hpp
index d0544cb5b51..76041f256a9 100644
--- a/src/hotspot/share/runtime/os.hpp
+++ b/src/hotspot/share/runtime/os.hpp
@@ -454,7 +454,7 @@ class os: AllStatic {
   static size_t align_down_vm_page_size(size_t size) { return align_down(size, os::vm_page_size()); }
 
   // The set of page sizes which the VM is allowed to use (may be a subset of
-  //  the page sizes actually available on the platform).
+  // the page sizes actually available on the platform).
   static const PageSizes& page_sizes() { return _page_sizes; }
 
   // Returns the page size to use for a region of memory.

From ee90f00b3b38b7cf4da340deb48f04bdaee22710 Mon Sep 17 00:00:00 2001
From: Ioi Lam <iklam@openjdk.org>
Date: Tue, 17 Mar 2026 17:21:16 +0000
Subject: [PATCH 223/655] 8376822: UseCompactObjectHeaders: fill Klass
 alignment gaps in AOT cache

Reviewed-by: jsjolen, asmehra
---
 src/hotspot/share/cds/aotMapLogger.cpp        |  52 +++--
 src/hotspot/share/cds/aotMapLogger.hpp        |   7 +-
 src/hotspot/share/cds/archiveBuilder.cpp      |  35 +---
 src/hotspot/share/cds/archiveUtils.cpp        | 185 +++++++++++++++++-
 src/hotspot/share/cds/archiveUtils.hpp        |  18 ++
 src/hotspot/share/cds/dumpAllocStats.cpp      |  14 +-
 src/hotspot/share/cds/dumpAllocStats.hpp      |  11 +-
 src/hotspot/share/utilities/rbTree.hpp        |   7 +-
 .../jtreg/runtime/cds/MetaspaceAllocGaps.java |  73 +++++++
 9 files changed, 324 insertions(+), 78 deletions(-)
 create mode 100644 test/hotspot/jtreg/runtime/cds/MetaspaceAllocGaps.java

diff --git a/src/hotspot/share/cds/aotMapLogger.cpp b/src/hotspot/share/cds/aotMapLogger.cpp
index fa769aee1bf..98336ff9b1f 100644
--- a/src/hotspot/share/cds/aotMapLogger.cpp
+++ b/src/hotspot/share/cds/aotMapLogger.cpp
@@ -98,8 +98,8 @@ void AOTMapLogger::dumptime_log(ArchiveBuilder* builder, FileMapInfo* mapinfo,
   DumpRegion* rw_region = &builder->_rw_region;
   DumpRegion* ro_region = &builder->_ro_region;
 
-  dumptime_log_metaspace_region("rw region", rw_region, &builder->_rw_src_objs);
-  dumptime_log_metaspace_region("ro region", ro_region, &builder->_ro_src_objs);
+  dumptime_log_metaspace_region("rw region", rw_region, &builder->_rw_src_objs, &builder->_ro_src_objs);
+  dumptime_log_metaspace_region("ro region", ro_region, &builder->_rw_src_objs, &builder->_ro_src_objs);
 
   address bitmap_end = address(bitmap + bitmap_size_in_bytes);
   log_region_range("bitmap", address(bitmap), bitmap_end, nullptr);
@@ -122,17 +122,6 @@ void AOTMapLogger::dumptime_log(ArchiveBuilder* builder, FileMapInfo* mapinfo,
 class AOTMapLogger::RuntimeGatherArchivedMetaspaceObjs : public UniqueMetaspaceClosure {
   GrowableArrayCHeap<ArchivedObjInfo, mtClass> _objs;
 
-  static int compare_objs_by_addr(ArchivedObjInfo* a, ArchivedObjInfo* b) {
-    intx diff = a->_src_addr - b->_src_addr;
-    if (diff < 0) {
-      return -1;
-    } else if (diff == 0) {
-      return 0;
-    } else {
-      return 1;
-    }
-  }
-
 public:
   GrowableArrayCHeap<ArchivedObjInfo, mtClass>* objs() { return &_objs; }
 
@@ -152,7 +141,7 @@ public:
 
   void finish() {
     UniqueMetaspaceClosure::finish();
-    _objs.sort(compare_objs_by_addr);
+    _objs.sort(compare_by_address);
   }
 }; // AOTMapLogger::RuntimeGatherArchivedMetaspaceObjs
 
@@ -203,24 +192,47 @@ void AOTMapLogger::runtime_log(FileMapInfo* mapinfo, GrowableArrayCHeap<Archived
 }
 
 void AOTMapLogger::dumptime_log_metaspace_region(const char* name, DumpRegion* region,
-                                                 const ArchiveBuilder::SourceObjList* src_objs) {
+                                                 const ArchiveBuilder::SourceObjList* rw_objs,
+                                                 const ArchiveBuilder::SourceObjList* ro_objs) {
   address region_base = address(region->base());
   address region_top  = address(region->top());
   log_region_range(name, region_base, region_top, region_base + _buffer_to_requested_delta);
   if (log_is_enabled(Debug, aot, map)) {
     GrowableArrayCHeap<ArchivedObjInfo, mtClass> objs;
-    for (int i = 0; i < src_objs->objs()->length(); i++) {
-      ArchiveBuilder::SourceObjInfo* src_info = src_objs->at(i);
+    // With -XX:+UseCompactObjectHeaders, it's possible for small objects (including some from
+    // ro_objs) to be allocated in the gaps in the RW region.
+    collect_metaspace_objs(&objs, region_base, region_top, rw_objs);
+    collect_metaspace_objs(&objs, region_base, region_top, ro_objs);
+    objs.sort(compare_by_address);
+    log_metaspace_objects_impl(address(region->base()), address(region->end()), &objs, 0, objs.length());
+  }
+}
+
+void AOTMapLogger::collect_metaspace_objs(GrowableArrayCHeap<ArchivedObjInfo, mtClass>* objs,
+                                          address region_base, address region_top ,
+                                          const ArchiveBuilder::SourceObjList* src_objs) {
+  for (int i = 0; i < src_objs->objs()->length(); i++) {
+    ArchiveBuilder::SourceObjInfo* src_info = src_objs->at(i);
+    address buf_addr = src_info->buffered_addr();
+    if (region_base <= buf_addr && buf_addr < region_top) {
       ArchivedObjInfo info;
       info._src_addr = src_info->source_addr();
-      info._buffered_addr = src_info->buffered_addr();
+      info._buffered_addr = buf_addr;
       info._requested_addr = info._buffered_addr + _buffer_to_requested_delta;
       info._bytes = src_info->size_in_bytes();
       info._type = src_info->type();
-      objs.append(info);
+      objs->append(info);
     }
+  }
+}
 
-    log_metaspace_objects_impl(address(region->base()), address(region->end()), &objs, 0, objs.length());
+int AOTMapLogger::compare_by_address(ArchivedObjInfo* a, ArchivedObjInfo* b) {
+  if (a->_buffered_addr < b->_buffered_addr) {
+    return -1;
+  } else if (a->_buffered_addr > b->_buffered_addr) {
+    return 1;
+  } else {
+    return 0;
   }
 }
 
diff --git a/src/hotspot/share/cds/aotMapLogger.hpp b/src/hotspot/share/cds/aotMapLogger.hpp
index f495ed97f40..0a89f1e5012 100644
--- a/src/hotspot/share/cds/aotMapLogger.hpp
+++ b/src/hotspot/share/cds/aotMapLogger.hpp
@@ -127,7 +127,12 @@ private:
   static void runtime_log(FileMapInfo* mapinfo, GrowableArrayCHeap<ArchivedObjInfo, mtClass>* objs);
   static void runtime_log_metaspace_regions(FileMapInfo* mapinfo, GrowableArrayCHeap<ArchivedObjInfo, mtClass>* objs);
   static void dumptime_log_metaspace_region(const char* name, DumpRegion* region,
-                                            const ArchiveBuilder::SourceObjList* src_objs);
+                                            const ArchiveBuilder::SourceObjList* rw_objs,
+                                            const ArchiveBuilder::SourceObjList* ro_objs);
+  static void collect_metaspace_objs(GrowableArrayCHeap<ArchivedObjInfo, mtClass>* objs,
+                                     address region_base, address region_top ,
+                                     const ArchiveBuilder::SourceObjList* src_objs);
+  static int compare_by_address(ArchivedObjInfo* a, ArchivedObjInfo* b);
 
   // Common code for dumptime/runtime
   static void log_file_header(FileMapInfo* mapinfo);
diff --git a/src/hotspot/share/cds/archiveBuilder.cpp b/src/hotspot/share/cds/archiveBuilder.cpp
index 0ea5d6c6ecb..b2d6600e44f 100644
--- a/src/hotspot/share/cds/archiveBuilder.cpp
+++ b/src/hotspot/share/cds/archiveBuilder.cpp
@@ -627,6 +627,7 @@ void ArchiveBuilder::dump_ro_metadata() {
   start_dump_region(&_ro_region);
   make_shallow_copies(&_ro_region, &_ro_src_objs);
   RegeneratedClasses::record_regenerated_objects();
+  DumpRegion::report_gaps(&_alloc_stats);
 }
 
 void ArchiveBuilder::make_shallow_copies(DumpRegion *dump_region,
@@ -639,33 +640,10 @@ void ArchiveBuilder::make_shallow_copies(DumpRegion *dump_region,
 
 void ArchiveBuilder::make_shallow_copy(DumpRegion *dump_region, SourceObjInfo* src_info) {
   address src = src_info->source_addr();
-  int bytes = src_info->size_in_bytes(); // word-aligned
-  size_t alignment = SharedSpaceObjectAlignment; // alignment for the dest pointer
+  int bytes = src_info->size_in_bytes();
+  char* dest = dump_region->allocate_metaspace_obj(bytes, src, src_info->type(),
+                                                   src_info->read_only(), &_alloc_stats);
 
-  char* oldtop = dump_region->top();
-  if (src_info->type() == MetaspaceClosureType::ClassType) {
-    // Allocate space for a pointer directly in front of the future InstanceKlass, so
-    // we can do a quick lookup from InstanceKlass* -> RunTimeClassInfo*
-    // without building another hashtable. See RunTimeClassInfo::get_for()
-    // in systemDictionaryShared.cpp.
-    Klass* klass = (Klass*)src;
-    if (klass->is_instance_klass()) {
-      SystemDictionaryShared::validate_before_archiving(InstanceKlass::cast(klass));
-      dump_region->allocate(sizeof(address));
-    }
-#ifdef _LP64
-    // More strict alignments needed for UseCompressedClassPointers
-    if (UseCompressedClassPointers) {
-      alignment = nth_bit(ArchiveBuilder::precomputed_narrow_klass_shift());
-    }
-#endif
-  } else if (src_info->type() == MetaspaceClosureType::SymbolType) {
-    // Symbols may be allocated by using AllocateHeap, so their sizes
-    // may be less than size_in_bytes() indicates.
-    bytes = ((Symbol*)src)->byte_size();
-  }
-
-  char* dest = dump_region->allocate(bytes, alignment);
   memcpy(dest, src, bytes);
 
   // Update the hash of buffered sorted symbols for static dump so that the symbols have deterministic contents
@@ -692,11 +670,6 @@ void ArchiveBuilder::make_shallow_copy(DumpRegion *dump_region, SourceObjInfo* s
 
   log_trace(aot)("Copy: " PTR_FORMAT " ==> " PTR_FORMAT " %d", p2i(src), p2i(dest), bytes);
   src_info->set_buffered_addr((address)dest);
-
-  char* newtop = dump_region->top();
-  _alloc_stats.record(src_info->type(), int(newtop - oldtop), src_info->read_only());
-
-  DEBUG_ONLY(_alloc_stats.verify((int)dump_region->used(), src_info->read_only()));
 }
 
 // This is used by code that hand-assembles data structures, such as the LambdaProxyClassKey, that are
diff --git a/src/hotspot/share/cds/archiveUtils.cpp b/src/hotspot/share/cds/archiveUtils.cpp
index ea9bde8eb8d..f79b1e134e8 100644
--- a/src/hotspot/share/cds/archiveUtils.cpp
+++ b/src/hotspot/share/cds/archiveUtils.cpp
@@ -30,6 +30,7 @@
 #include "cds/cdsConfig.hpp"
 #include "cds/classListParser.hpp"
 #include "cds/classListWriter.hpp"
+#include "cds/dumpAllocStats.hpp"
 #include "cds/dynamicArchive.hpp"
 #include "cds/filemap.hpp"
 #include "cds/heapShared.hpp"
@@ -46,6 +47,7 @@
 #include "utilities/debug.hpp"
 #include "utilities/formatBuffer.hpp"
 #include "utilities/globalDefinitions.hpp"
+#include "utilities/rbTree.inline.hpp"
 #include "utilities/spinYield.hpp"
 
 CHeapBitMap* ArchivePtrMarker::_ptrmap = nullptr;
@@ -116,13 +118,17 @@ void ArchivePtrMarker::mark_pointer(address* ptr_loc) {
 
   if (ptr_base() <= ptr_loc && ptr_loc < ptr_end()) {
     address value = *ptr_loc;
-    // We don't want any pointer that points to very bottom of the archive, otherwise when
-    // AOTMetaspace::default_base_address()==0, we can't distinguish between a pointer
-    // to nothing (null) vs a pointer to an objects that happens to be at the very bottom
-    // of the archive.
-    assert(value != (address)ptr_base(), "don't point to the bottom of the archive");
-
     if (value != nullptr) {
+      // We don't want any pointer that points to very bottom of the AOT metaspace, otherwise
+      // when AOTMetaspace::default_base_address()==0, we can't distinguish between a pointer
+      // to nothing (null) vs a pointer to an objects that happens to be at the very bottom
+      // of the AOT metaspace.
+      //
+      // This should never happen because the protection zone prevents any valid objects from
+      // being allocated at the bottom of the AOT metaspace.
+      assert(AOTMetaspace::protection_zone_size() > 0, "must be");
+      assert(ArchiveBuilder::current()->any_to_offset(value) > 0, "cannot point to bottom of AOT metaspace");
+
       assert(uintx(ptr_loc) % sizeof(intptr_t) == 0, "pointers must be stored in aligned addresses");
       size_t idx = ptr_loc - ptr_base();
       if (_ptrmap->size() <= idx) {
@@ -130,7 +136,6 @@ void ArchivePtrMarker::mark_pointer(address* ptr_loc) {
       }
       assert(idx < _ptrmap->size(), "must be");
       _ptrmap->set_bit(idx);
-      //tty->print_cr("Marking pointer [" PTR_FORMAT "] -> " PTR_FORMAT " @ %5zu", p2i(ptr_loc), p2i(*ptr_loc), idx);
     }
   }
 }
@@ -144,7 +149,6 @@ void ArchivePtrMarker::clear_pointer(address* ptr_loc) {
   size_t idx = ptr_loc - ptr_base();
   assert(idx < _ptrmap->size(), "cannot clear pointers that have not been marked");
   _ptrmap->clear_bit(idx);
-  //tty->print_cr("Clearing pointer [" PTR_FORMAT "] -> " PTR_FORMAT " @ %5zu", p2i(ptr_loc), p2i(*ptr_loc), idx);
 }
 
 class ArchivePtrBitmapCleaner: public BitMapClosure {
@@ -249,16 +253,179 @@ void DumpRegion::commit_to(char* newtop) {
                  which, commit, _vs->actual_committed_size(), _vs->high());
 }
 
+// Basic allocation. Any alignment gaps will be wasted.
 char* DumpRegion::allocate(size_t num_bytes, size_t alignment) {
   // Always align to at least minimum alignment
   alignment = MAX2(SharedSpaceObjectAlignment, alignment);
   char* p = (char*)align_up(_top, alignment);
-  char* newtop = p + align_up(num_bytes, (size_t)SharedSpaceObjectAlignment);
+  char* newtop = p + align_up(num_bytes, SharedSpaceObjectAlignment);
   expand_top_to(newtop);
   memset(p, 0, newtop - p);
   return p;
 }
 
+class DumpRegion::AllocGap {
+  size_t _gap_bytes;   // size of this gap in bytes
+  char* _gap_bottom;   // must be SharedSpaceObjectAlignment aligned
+public:
+  size_t gap_bytes() const { return _gap_bytes; }
+  char* gap_bottom() const { return _gap_bottom; }
+
+  AllocGap(size_t bytes, char* bottom) : _gap_bytes(bytes), _gap_bottom(bottom) {
+    precond(is_aligned(gap_bytes(), SharedSpaceObjectAlignment));
+    precond(is_aligned(gap_bottom(), SharedSpaceObjectAlignment));
+  }
+};
+
+struct DumpRegion::AllocGapCmp {
+  static RBTreeOrdering cmp(AllocGap a, AllocGap b) {
+    RBTreeOrdering order = rbtree_primitive_cmp(a.gap_bytes(), b.gap_bytes());
+    if (order == RBTreeOrdering::EQ) {
+      order = rbtree_primitive_cmp(a.gap_bottom(), b.gap_bottom());
+    }
+    return order;
+  }
+};
+
+struct Empty {};
+using AllocGapNode = RBNode<DumpRegion::AllocGap, Empty>;
+
+class DumpRegion::AllocGapTree : public RBTreeCHeap<AllocGap, Empty, AllocGapCmp, mtClassShared> {
+public:
+  size_t add_gap(char* gap_bottom, char* gap_top) {
+    precond(gap_bottom < gap_top);
+    size_t gap_bytes = pointer_delta(gap_top, gap_bottom, 1);
+    precond(gap_bytes > 0);
+
+    _total_gap_bytes += gap_bytes;
+
+    AllocGap gap(gap_bytes, gap_bottom); // constructor checks alignment
+    AllocGapNode* node = allocate_node(gap, Empty{});
+    insert(gap, node);
+
+    log_trace(aot, alloc)("adding a gap of %zu bytes @ %p (total = %zu) in %zu blocks", gap_bytes, gap_bottom, _total_gap_bytes, size());
+    return gap_bytes;
+  }
+
+  char* allocate_from_gap(size_t num_bytes) {
+    // The gaps are sorted in ascending order of their sizes. When two gaps have the same
+    // size, the one with a lower gap_bottom comes first.
+    //
+    // Find the first gap that's big enough, with the lowest gap_bottom.
+    AllocGap target(num_bytes, nullptr);
+    AllocGapNode* node = closest_ge(target);
+    if (node == nullptr) {
+      return nullptr; // Didn't find any usable gap.
+    }
+
+    size_t gap_bytes = node->key().gap_bytes();
+    char* gap_bottom = node->key().gap_bottom();
+    char* result = gap_bottom;
+    precond(is_aligned(result, SharedSpaceObjectAlignment));
+
+    remove(node);
+
+    precond(_total_gap_bytes >= num_bytes);
+    _total_gap_bytes -= num_bytes;
+    _total_gap_bytes_used += num_bytes;
+    _total_gap_allocs++;
+    DEBUG_ONLY(node = nullptr); // Don't use it anymore!
+
+    precond(gap_bytes >= num_bytes);
+    if (gap_bytes > num_bytes) {
+      gap_bytes -= num_bytes;
+      gap_bottom += num_bytes;
+
+      AllocGap gap(gap_bytes, gap_bottom); // constructor checks alignment
+      AllocGapNode* new_node = allocate_node(gap, Empty{});
+      insert(gap, new_node);
+    }
+    log_trace(aot, alloc)("%zu bytes @ %p in a gap of %zu bytes (used gaps %zu times, remain gap = %zu bytes in %zu blocks)",
+                          num_bytes, result, gap_bytes, _total_gap_allocs, _total_gap_bytes, size());
+    return result;
+  }
+};
+
+size_t DumpRegion::_total_gap_bytes = 0;
+size_t DumpRegion::_total_gap_bytes_used = 0;
+size_t DumpRegion::_total_gap_allocs = 0;
+DumpRegion::AllocGapTree DumpRegion::_gap_tree;
+
+// Alignment gaps happen only for the RW space. Collect the gaps into the _gap_tree so they can be
+// used for future small object allocation.
+char* DumpRegion::allocate_metaspace_obj(size_t num_bytes, address src, MetaspaceClosureType type, bool read_only, DumpAllocStats* stats) {
+  num_bytes = align_up(num_bytes, SharedSpaceObjectAlignment);
+  size_t alignment = SharedSpaceObjectAlignment; // alignment for the dest pointer
+  bool is_class = (type == MetaspaceClosureType::ClassType);
+  bool is_instance_class = is_class && ((Klass*)src)->is_instance_klass();
+
+#ifdef _LP64
+  // More strict alignments needed for UseCompressedClassPointers
+  if (is_class && UseCompressedClassPointers) {
+    size_t klass_alignment = checked_cast<size_t>(nth_bit(ArchiveBuilder::precomputed_narrow_klass_shift()));
+    alignment = MAX2(alignment, klass_alignment);
+    precond(is_aligned(alignment, SharedSpaceObjectAlignment));
+  }
+#endif
+
+  if (alignment == SharedSpaceObjectAlignment && type != MetaspaceClosureType::SymbolType) {
+    // The addresses of Symbols must be in the same order as they are in ArchiveBuilder::SourceObjList.
+    // If we put them in gaps, their order will change.
+    //
+    // We have enough small objects that all gaps are usually filled.
+    char* p = _gap_tree.allocate_from_gap(num_bytes);
+    if (p != nullptr) {
+      // Already memset to 0 when adding the gap
+      stats->record(type, checked_cast<int>(num_bytes), /*read_only=*/false); // all gaps are from RW space (for classes)
+      return p;
+    }
+  }
+
+  // Reserve space for a pointer directly in front of the buffered InstanceKlass, so
+  // we can do a quick lookup from InstanceKlass* -> RunTimeClassInfo*
+  // without building another hashtable. See RunTimeClassInfo::get_for()
+  // in systemDictionaryShared.cpp.
+  const size_t RuntimeClassInfoPtrSize = is_instance_class ? sizeof(address) : 0;
+
+  if (is_class && !is_aligned(top() + RuntimeClassInfoPtrSize, alignment)) {
+    // We need to add a gap to align the buffered Klass. Save the gap for future small allocations.
+    assert(read_only == false, "only gaps in RW region are reusable");
+    char* gap_bottom = top();
+    char* gap_top = align_up(gap_bottom + RuntimeClassInfoPtrSize, alignment) - RuntimeClassInfoPtrSize;
+    size_t gap_bytes = _gap_tree.add_gap(gap_bottom, gap_top);
+    allocate(gap_bytes);
+  }
+
+  char* oldtop = top();
+  if (is_instance_class) {
+    SystemDictionaryShared::validate_before_archiving((InstanceKlass*)src);
+    allocate(RuntimeClassInfoPtrSize);
+  }
+
+  precond(is_aligned(top(), alignment));
+  char* result = allocate(num_bytes);
+  log_trace(aot, alloc)("%zu bytes @ %p", num_bytes, result);
+  stats->record(type, pointer_delta_as_int(top(), oldtop), read_only); // includes RuntimeClassInfoPtrSize for classes
+
+  return result;
+}
+
+// Usually we have no gaps left.
+void DumpRegion::report_gaps(DumpAllocStats* stats) {
+  _gap_tree.visit_in_order([&](const AllocGapNode* node) {
+        stats->record_gap(checked_cast<int>(node->key().gap_bytes()));
+        return true;
+      });
+  if (_gap_tree.size() > 0) {
+    log_warning(aot)("Unexpected %zu gaps (%zu bytes) for Klass alignment",
+                     _gap_tree.size(), _total_gap_bytes);
+  }
+  if (_total_gap_allocs > 0) {
+    log_info(aot)("Allocated %zu objects of %zu bytes in gaps (remain = %zu bytes)",
+                  _total_gap_allocs, _total_gap_bytes_used, _total_gap_bytes);
+  }
+}
+
 void DumpRegion::append_intptr_t(intptr_t n, bool need_to_mark) {
   assert(is_aligned(_top, sizeof(intptr_t)), "bad alignment");
   intptr_t *p = (intptr_t*)_top;
diff --git a/src/hotspot/share/cds/archiveUtils.hpp b/src/hotspot/share/cds/archiveUtils.hpp
index e5d1efa5eab..84ad8e6bdf3 100644
--- a/src/hotspot/share/cds/archiveUtils.hpp
+++ b/src/hotspot/share/cds/archiveUtils.hpp
@@ -28,7 +28,9 @@
 #include "cds/cds_globals.hpp"
 #include "cds/serializeClosure.hpp"
 #include "logging/log.hpp"
+#include "memory/allocation.hpp"
 #include "memory/metaspace.hpp"
+#include "memory/metaspaceClosureType.hpp"
 #include "memory/virtualspace.hpp"
 #include "runtime/nonJavaThread.hpp"
 #include "runtime/semaphore.hpp"
@@ -37,6 +39,7 @@
 #include "utilities/macros.hpp"
 
 class BootstrapInfo;
+class DumpAllocStats;
 class ReservedSpace;
 class VirtualSpace;
 
@@ -159,6 +162,18 @@ private:
 
   void commit_to(char* newtop);
 
+public:
+  // Allocation gaps (due to Klass alignment)
+  class AllocGapTree;
+  class AllocGap;
+  struct AllocGapCmp;
+
+private:
+  static AllocGapTree _gap_tree;
+  static size_t _total_gap_bytes;
+  static size_t _total_gap_bytes_used;
+  static size_t _total_gap_allocs;
+
 public:
   DumpRegion(const char* name)
     : _name(name), _base(nullptr), _top(nullptr), _end(nullptr),
@@ -167,6 +182,7 @@ public:
 
   char* expand_top_to(char* newtop);
   char* allocate(size_t num_bytes, size_t alignment = 0);
+  char* allocate_metaspace_obj(size_t num_bytes, address src, MetaspaceClosureType type, bool read_only, DumpAllocStats* stats);
 
   void append_intptr_t(intptr_t n, bool need_to_mark = false) NOT_CDS_RETURN;
 
@@ -191,6 +207,8 @@ public:
   bool contains(char* p) {
     return base() <= p && p < top();
   }
+
+  static void report_gaps(DumpAllocStats* stats);
 };
 
 // Closure for serializing initialization data out to a data area to be
diff --git a/src/hotspot/share/cds/dumpAllocStats.cpp b/src/hotspot/share/cds/dumpAllocStats.cpp
index 5f324566103..ddd4bac6086 100644
--- a/src/hotspot/share/cds/dumpAllocStats.cpp
+++ b/src/hotspot/share/cds/dumpAllocStats.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2020, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -129,15 +129,3 @@ void DumpAllocStats::print_stats(int ro_all, int rw_all) {
                                                                   _bytes [RW][MethodTrainingDataType]);
 
 }
-
-#ifdef ASSERT
-void DumpAllocStats::verify(int expected_byte_size, bool read_only) const {
-  int bytes = 0;
-  const int what = (int)(read_only ? RO : RW);
-  for (int type = 0; type < int(_number_of_types); type ++) {
-    bytes += _bytes[what][type];
-  }
-  assert(bytes == expected_byte_size, "counter mismatch (%s: %d vs %d)",
-         (read_only ? "RO" : "RW"), bytes, expected_byte_size);
-}
-#endif // ASSERT
diff --git a/src/hotspot/share/cds/dumpAllocStats.hpp b/src/hotspot/share/cds/dumpAllocStats.hpp
index 4553f0f6a01..4daef9195a6 100644
--- a/src/hotspot/share/cds/dumpAllocStats.hpp
+++ b/src/hotspot/share/cds/dumpAllocStats.hpp
@@ -41,6 +41,7 @@ public:
   f(StringHashentry) \
   f(StringBucket) \
   f(CppVTables) \
+  f(Gap) \
   f(Other)
 
 #define DUMPED_TYPE_DECLARE(name) name ## Type,
@@ -111,12 +112,19 @@ public:
     _bytes [which][t] += byte_size;
   }
 
+  void record_gap(int byte_size) {
+    _counts[RW][GapType] += 1;
+    _bytes [RW][GapType] += byte_size;
+  }
+
   void record_other_type(int byte_size, bool read_only) {
     int which = (read_only) ? RO : RW;
+    _counts[which][OtherType] += 1;
     _bytes [which][OtherType] += byte_size;
   }
 
   void record_cpp_vtables(int byte_size) {
+    _counts[RW][CppVTablesType] += 1;
     _bytes[RW][CppVTablesType] += byte_size;
   }
 
@@ -145,9 +153,6 @@ public:
   }
 
   void print_stats(int ro_all, int rw_all);
-
-  DEBUG_ONLY(void verify(int expected_byte_size, bool read_only) const);
-
 };
 
 #endif // SHARE_CDS_DUMPALLOCSTATS_HPP
diff --git a/src/hotspot/share/utilities/rbTree.hpp b/src/hotspot/share/utilities/rbTree.hpp
index c522d787466..9c04ccbe9ab 100644
--- a/src/hotspot/share/utilities/rbTree.hpp
+++ b/src/hotspot/share/utilities/rbTree.hpp
@@ -429,7 +429,12 @@ public:
   void free(void* ptr);
 };
 
-
+template <typename T>
+RBTreeOrdering rbtree_primitive_cmp(T a, T b) { // handy function
+  if (a < b) return RBTreeOrdering::LT;
+  if (a > b) return RBTreeOrdering::GT;
+  return RBTreeOrdering::EQ;
+}
 
 template <typename K, typename V, typename COMPARATOR, MemTag mem_tag, AllocFailType strategy = AllocFailStrategy::EXIT_OOM>
 using RBTreeCHeap = RBTree<K, V, COMPARATOR, RBTreeCHeapAllocator<mem_tag, strategy>>;
diff --git a/test/hotspot/jtreg/runtime/cds/MetaspaceAllocGaps.java b/test/hotspot/jtreg/runtime/cds/MetaspaceAllocGaps.java
new file mode 100644
index 00000000000..65459263e36
--- /dev/null
+++ b/test/hotspot/jtreg/runtime/cds/MetaspaceAllocGaps.java
@@ -0,0 +1,73 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+/**
+ * @test
+ * @requires vm.cds
+ * @requires vm.flagless
+ * @requires vm.bits == 64
+ * @bug 8376822
+ * @summary Allocation gaps in the RW region caused by -XX:+UseCompactObjectHeaders should be reused
+ * @library /test/lib
+ * @build MetaspaceAllocGaps
+ * @run driver jdk.test.lib.helpers.ClassFileInstaller -jar hello.jar Hello
+ * @run driver MetaspaceAllocGaps
+ */
+
+import jdk.test.lib.cds.SimpleCDSAppTester;
+import jdk.test.lib.helpers.ClassFileInstaller;
+import jdk.test.lib.process.OutputAnalyzer;
+
+public class MetaspaceAllocGaps {
+    public static void main(String[] args) throws Exception {
+        String appJar = ClassFileInstaller.getJarPath("hello.jar");
+        for (int i = 0; i < 2; i++) {
+            String compressedOops = "-XX:" + (i == 0 ? "-" : "+") + "UseCompressedOops";
+            SimpleCDSAppTester.of("MetaspaceAllocGaps" + i)
+                .addVmArgs("-Xlog:aot=debug,aot+alloc=trace",
+                           "-XX:+UseCompactObjectHeaders")
+                .classpath(appJar)
+                .appCommandLine("Hello")
+                .setTrainingChecker((OutputAnalyzer out) -> {
+                    // Typically all gaps should be filled. If not, we probably have a regression in C++ class ArchiveUtils.
+                    //
+                    // [0.422s][debug][aot ] Detailed metadata info (excluding heap region):
+                    // [...]
+                    // [0.422s][debug][aot ] Gap : 0 0 0.0 | 0 0 0.0 | 0 0 0.0 <<< look for this pattern
+                    out.shouldMatch("Allocated [1-9][0-9]+ objects of [1-9][0-9]+ bytes in gaps .remain = 0 bytes")
+                       .shouldMatch("debug.* Gap .*0[.]0.*0[.]0.*0[.]0")
+                       .shouldNotMatch("Unexpected .* gaps .* for Klass alignment");
+                })
+                .setProductionChecker((OutputAnalyzer out) -> {
+                    out.shouldContain("HelloWorld");
+                })
+                .runAOTWorkflow();
+        }
+    }
+}
+
+class Hello {
+    public static void main(String[] args) {
+        System.out.println("HelloWorld");
+    }
+}

From 00c1f4b6248e116c8839b1fb19ce20182711667a Mon Sep 17 00:00:00 2001
From: Ioi Lam <iklam@openjdk.org>
Date: Tue, 17 Mar 2026 20:33:44 +0000
Subject: [PATCH 224/655] 8377512: AOT cache creation fails with invalid native
 pointer

Reviewed-by: kvn, jrose, liach
---
 .../share/cds/aotConstantPoolResolver.cpp     | 55 ++++++++++++++++++-
 .../share/cds/aotConstantPoolResolver.hpp     |  7 ++-
 src/hotspot/share/cds/aotMappedHeapWriter.cpp | 10 +++-
 src/hotspot/share/oops/cpCache.cpp            | 26 +++++++--
 .../cds/appcds/aotCache/ExcludedClasses.java  | 48 +++++++++++++++-
 5 files changed, 132 insertions(+), 14 deletions(-)

diff --git a/src/hotspot/share/cds/aotConstantPoolResolver.cpp b/src/hotspot/share/cds/aotConstantPoolResolver.cpp
index 93145940955..f1a704d4bee 100644
--- a/src/hotspot/share/cds/aotConstantPoolResolver.cpp
+++ b/src/hotspot/share/cds/aotConstantPoolResolver.cpp
@@ -81,6 +81,7 @@ bool AOTConstantPoolResolver::is_resolution_deterministic(ConstantPool* cp, int
 bool AOTConstantPoolResolver::is_class_resolution_deterministic(InstanceKlass* cp_holder, Klass* resolved_class) {
   assert(!is_in_archivebuilder_buffer(cp_holder), "sanity");
   assert(!is_in_archivebuilder_buffer(resolved_class), "sanity");
+  assert_at_safepoint(); // try_add_candidate() is called below and requires to be at safepoint.
 
   if (resolved_class->is_instance_klass()) {
     InstanceKlass* ik = InstanceKlass::cast(resolved_class);
@@ -346,7 +347,15 @@ void AOTConstantPoolResolver::maybe_resolve_fmi_ref(InstanceKlass* ik, Method* m
     break;
 
   case Bytecodes::_invokehandle:
-    InterpreterRuntime::cds_resolve_invokehandle(raw_index, cp, CHECK);
+    if (CDSConfig::is_dumping_method_handles()) {
+      ResolvedMethodEntry* method_entry = cp->resolved_method_entry_at(raw_index);
+      int cp_index = method_entry->constant_pool_index();
+      Symbol* sig = cp->uncached_signature_ref_at(cp_index);
+      Klass* k;
+      if (check_methodtype_signature(cp(), sig, &k, true)) {
+        InterpreterRuntime::cds_resolve_invokehandle(raw_index, cp, CHECK);
+      }
+    }
     break;
 
   default:
@@ -400,7 +409,7 @@ void AOTConstantPoolResolver::preresolve_indy_cp_entries(JavaThread* current, In
 // Check the MethodType signatures used by parameters to the indy BSMs. Make sure we don't
 // use types that have been excluded, or else we might end up creating MethodTypes that cannot be stored
 // in the AOT cache.
-bool AOTConstantPoolResolver::check_methodtype_signature(ConstantPool* cp, Symbol* sig, Klass** return_type_ret) {
+bool AOTConstantPoolResolver::check_methodtype_signature(ConstantPool* cp, Symbol* sig, Klass** return_type_ret, bool is_invokehandle) {
   ResourceMark rm;
   for (SignatureStream ss(sig); !ss.is_done(); ss.next()) {
     if (ss.is_reference()) {
@@ -413,11 +422,18 @@ bool AOTConstantPoolResolver::check_methodtype_signature(ConstantPool* cp, Symbo
       if (SystemDictionaryShared::should_be_excluded(k)) {
         if (log_is_enabled(Warning, aot, resolve)) {
           ResourceMark rm;
-          log_warning(aot, resolve)("Cannot aot-resolve Lambda proxy because %s is excluded", k->external_name());
+          log_warning(aot, resolve)("Cannot aot-resolve %s because %s is excluded",
+                                    is_invokehandle ? "invokehandle" : "Lambda proxy",
+                                    k->external_name());
         }
         return false;
       }
 
+      // cp->pool_holder() must be able to resolve k in production run
+      precond(CDSConfig::is_dumping_aot_linked_classes());
+      precond(SystemDictionaryShared::is_builtin_loader(cp->pool_holder()->class_loader_data()));
+      precond(SystemDictionaryShared::is_builtin_loader(k->class_loader_data()));
+
       if (ss.at_return_type() && return_type_ret != nullptr) {
         *return_type_ret = k;
       }
@@ -475,11 +491,44 @@ bool AOTConstantPoolResolver::check_lambda_metafactory_methodhandle_arg(Constant
     return false;
   }
 
+  // klass and sigature of the method (no need to check the method name)
   Symbol* sig = cp->method_handle_signature_ref_at(mh_index);
+  Symbol* klass_name = cp->klass_name_at(cp->method_handle_klass_index_at(mh_index));
+
   if (log_is_enabled(Debug, aot, resolve)) {
     ResourceMark rm;
     log_debug(aot, resolve)("Checking MethodType of MethodHandle for LambdaMetafactory BSM arg %d: %s", arg_i, sig->as_C_string());
   }
+
+  {
+    Klass* k = find_loaded_class(Thread::current(), cp->pool_holder()->class_loader(), klass_name);
+    if (k == nullptr) {
+      // Dumping AOT cache: all classes should have been loaded by FinalImageRecipes::load_all_classes(). k must have
+      // been a class that was excluded when FinalImageRecipes recorded all classes at the end of the training run.
+      //
+      // Dumping static CDS archive: all classes in the classlist have already been loaded, before we resolve
+      // constants. k must have been a class that was excluded when the classlist was written
+      // at the end of the training run.
+      if (log_is_enabled(Warning, aot, resolve)) {
+        ResourceMark rm;
+        log_warning(aot, resolve)("Cannot aot-resolve Lambda proxy because %s is not loaded", klass_name->as_C_string());
+      }
+      return false;
+    }
+    if (SystemDictionaryShared::should_be_excluded(k)) {
+      if (log_is_enabled(Warning, aot, resolve)) {
+        ResourceMark rm;
+        log_warning(aot, resolve)("Cannot aot-resolve Lambda proxy because %s is excluded", k->external_name());
+      }
+      return false;
+    }
+
+    // cp->pool_holder() must be able to resolve k in production run
+    precond(CDSConfig::is_dumping_aot_linked_classes());
+    precond(SystemDictionaryShared::is_builtin_loader(cp->pool_holder()->class_loader_data()));
+    precond(SystemDictionaryShared::is_builtin_loader(k->class_loader_data()));
+  }
+
   return check_methodtype_signature(cp, sig);
 }
 
diff --git a/src/hotspot/share/cds/aotConstantPoolResolver.hpp b/src/hotspot/share/cds/aotConstantPoolResolver.hpp
index e49d9d1ad0b..ecf2ac27061 100644
--- a/src/hotspot/share/cds/aotConstantPoolResolver.hpp
+++ b/src/hotspot/share/cds/aotConstantPoolResolver.hpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2022, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2022, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -74,7 +74,10 @@ class AOTConstantPoolResolver :  AllStatic {
   static void maybe_resolve_fmi_ref(InstanceKlass* ik, Method* m, Bytecodes::Code bc, int raw_index,
                                     GrowableArray<bool>* resolve_fmi_list, TRAPS);
 
-  static bool check_methodtype_signature(ConstantPool* cp, Symbol* sig, Klass** return_type_ret = nullptr);
+public:
+  static bool check_methodtype_signature(ConstantPool* cp, Symbol* sig, Klass** return_type_ret = nullptr, bool is_invokehandle = false);
+
+private:
   static bool check_lambda_metafactory_signature(ConstantPool* cp, Symbol* sig);
   static bool check_lambda_metafactory_methodtype_arg(ConstantPool* cp, int bsms_attribute_index, int arg_i);
   static bool check_lambda_metafactory_methodhandle_arg(ConstantPool* cp, int bsms_attribute_index, int arg_i);
diff --git a/src/hotspot/share/cds/aotMappedHeapWriter.cpp b/src/hotspot/share/cds/aotMappedHeapWriter.cpp
index 2e21a1d15d8..3456c845938 100644
--- a/src/hotspot/share/cds/aotMappedHeapWriter.cpp
+++ b/src/hotspot/share/cds/aotMappedHeapWriter.cpp
@@ -898,8 +898,14 @@ void AOTMappedHeapWriter::compute_ptrmap(AOTMappedHeapInfo* heap_info) {
       native_ptr = RegeneratedClasses::get_regenerated_object(native_ptr);
     }
 
-    guarantee(ArchiveBuilder::current()->has_been_archived((address)native_ptr),
-              "Metadata %p should have been archived", native_ptr);
+    if (!ArchiveBuilder::current()->has_been_archived((address)native_ptr)) {
+      ResourceMark rm;
+      LogStreamHandle(Error, aot) log;
+      log.print("Marking native pointer for oop %p (type = %s, offset = %d)",
+                cast_from_oop<void*>(src_obj), src_obj->klass()->external_name(), field_offset);
+      src_obj->print_on(&log);
+      fatal("Metadata %p should have been archived", native_ptr);
+    }
 
     address buffered_native_ptr = ArchiveBuilder::current()->get_buffered_addr((address)native_ptr);
     address requested_native_ptr = ArchiveBuilder::current()->to_requested(buffered_native_ptr);
diff --git a/src/hotspot/share/oops/cpCache.cpp b/src/hotspot/share/oops/cpCache.cpp
index 34d7aa10299..edb5f6714c0 100644
--- a/src/hotspot/share/oops/cpCache.cpp
+++ b/src/hotspot/share/oops/cpCache.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1998, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1998, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -568,6 +568,8 @@ bool ConstantPoolCache::can_archive_resolved_method(ConstantPool* src_cp, Resolv
     return false;
   }
 
+  int cp_index = method_entry->constant_pool_index();
+
   if (!method_entry->is_resolved(Bytecodes::_invokevirtual)) {
     if (method_entry->method() == nullptr) {
       rejection_reason = "(method entry is not resolved)";
@@ -577,9 +579,24 @@ bool ConstantPoolCache::can_archive_resolved_method(ConstantPool* src_cp, Resolv
       rejection_reason = "(corresponding stub is generated on demand during method resolution)";
       return false; // FIXME: corresponding stub is generated on demand during method resolution (see LinkResolver::resolve_static_call).
     }
-    if (method_entry->is_resolved(Bytecodes::_invokehandle) && !CDSConfig::is_dumping_method_handles()) {
-      rejection_reason = "(not dumping method handles)";
-      return false;
+    if (method_entry->is_resolved(Bytecodes::_invokehandle)) {
+      if (!CDSConfig::is_dumping_method_handles()) {
+        rejection_reason = "(not dumping method handles)";
+        return false;
+      }
+
+      Symbol* sig = constant_pool()->uncached_signature_ref_at(cp_index);
+      Klass* k;
+      if (!AOTConstantPoolResolver::check_methodtype_signature(constant_pool(), sig, &k, true)) {
+        // invokehandles that were resolved in the training run should have been filtered in
+        // AOTConstantPoolResolver::maybe_resolve_fmi_ref so we shouldn't come to here.
+        //
+        // If we come here it's because the AOT assembly phase has executed an invokehandle
+        // that uses an excluded type like jdk.jfr.Event. This should not happen because the
+        // AOT assembly phase should execute only a very limited set of Java code.
+        ResourceMark rm;
+        fatal("AOT assembly phase must not resolve any invokehandles whose signatures include an excluded type");
+      }
     }
     if (method_entry->method()->is_method_handle_intrinsic() && !CDSConfig::is_dumping_method_handles()) {
       rejection_reason = "(not dumping intrinsic method handles)";
@@ -587,7 +604,6 @@ bool ConstantPoolCache::can_archive_resolved_method(ConstantPool* src_cp, Resolv
     }
   }
 
-  int cp_index = method_entry->constant_pool_index();
   assert(src_cp->tag_at(cp_index).is_method() || src_cp->tag_at(cp_index).is_interface_method(), "sanity");
 
   if (!AOTConstantPoolResolver::is_resolution_deterministic(src_cp, cp_index)) {
diff --git a/test/hotspot/jtreg/runtime/cds/appcds/aotCache/ExcludedClasses.java b/test/hotspot/jtreg/runtime/cds/appcds/aotCache/ExcludedClasses.java
index 9a9524eb2f1..728428afef2 100644
--- a/test/hotspot/jtreg/runtime/cds/appcds/aotCache/ExcludedClasses.java
+++ b/test/hotspot/jtreg/runtime/cds/appcds/aotCache/ExcludedClasses.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2023, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2023, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -32,6 +32,7 @@
  * @run driver jdk.test.lib.helpers.ClassFileInstaller -jar app.jar
  *                 TestApp
  *                 TestApp$Foo
+ *                 TestApp$Foo$A
  *                 TestApp$Foo$Bar
  *                 TestApp$Foo$ShouldBeExcluded
  *                 TestApp$Foo$ShouldBeExcludedChild
@@ -43,6 +44,8 @@
  */
 
 import java.io.File;
+import java.lang.invoke.MethodHandle;
+import java.lang.invoke.MethodHandles;
 import java.lang.reflect.Array;
 import java.lang.reflect.InvocationHandler;
 import java.lang.reflect.Method;
@@ -165,6 +168,8 @@ class TestApp {
             long start = System.currentTimeMillis();
             while (System.currentTimeMillis() - start < 1000) {
                 lambdaHotSpot();
+                lambdaHotSpot2();
+                invokeHandleHotSpot();
                 s.hotSpot2();
                 b.hotSpot3();
                 Taz.hotSpot4();
@@ -207,12 +212,52 @@ class TestApp {
             }
         }
 
+        interface A {
+            Object get();
+        }
+
+        // Lambdas that refer to excluded classes should not be AOT-resolved
+        static void lambdaHotSpot2() {
+            long start = System.currentTimeMillis();
+            A a = ShouldBeExcluded::new;
+            while (System.currentTimeMillis() - start < 20) {
+                Object obj = (ShouldBeExcluded)a.get();
+            }
+        }
+
+        static void invokeHandleHotSpot() {
+            try {
+                invokeHandleHotSpotImpl();
+            } catch (Throwable t) {
+                throw new RuntimeException("Unexpected", t);
+            }
+        }
+
+        static void invokeHandleHotSpotImpl() throws Throwable {
+            MethodHandle constructorHandle =
+                MethodHandles.lookup().unreflectConstructor(ShouldBeExcluded.class.getConstructor());
+            long start = System.currentTimeMillis();
+            while (System.currentTimeMillis() - start < 20) {
+                // The JVM rewrites this to:
+                // invokehandle  <java/lang/invoke/MethodHandle.invoke()LShouldBeExcluded;>
+                //
+                // The AOT cache must not contain a java.lang.invoke.MethodType that refers to the
+                // ShouldBeExcluded class.
+                ShouldBeExcluded o = (ShouldBeExcluded)constructorHandle.invoke();
+                if (o.getClass() != ShouldBeExcluded.class) {
+                    throw new RuntimeException("Unexpected object: " + o);
+                }
+            }
+        }
+
         static void doit(Runnable r) {
             r.run();
         }
 
         // All subclasses of jdk.jfr.Event are excluded from the CDS archive.
         static class ShouldBeExcluded extends jdk.jfr.Event {
+            public ShouldBeExcluded() {}
+
             int f = (int)(System.currentTimeMillis()) + 123;
             int m() {
                 return f + 456;
@@ -275,4 +320,3 @@ class TestApp {
         }
     }
 }
-

From 8378d289104a60faa0c9ee048dc299fa7ea2c06e Mon Sep 17 00:00:00 2001
From: David Holmes <dholmes@openjdk.org>
Date: Tue, 17 Mar 2026 20:43:22 +0000
Subject: [PATCH 225/655] 8379481: Recent JNI methods are missing DTrace probes

Reviewed-by: kbarrett, iklam, jwaters
---
 src/hotspot/os/posix/dtrace/hotspot_jni.d       |  4 +++-
 src/hotspot/share/prims/jni.cpp                 | 15 ++++++++++-----
 src/hotspot/share/utilities/dtrace_disabled.hpp | 16 +++++++++-------
 3 files changed, 22 insertions(+), 13 deletions(-)

diff --git a/src/hotspot/os/posix/dtrace/hotspot_jni.d b/src/hotspot/os/posix/dtrace/hotspot_jni.d
index c5676921b37..1937769dcb2 100644
--- a/src/hotspot/os/posix/dtrace/hotspot_jni.d
+++ b/src/hotspot/os/posix/dtrace/hotspot_jni.d
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2005, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2005, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -366,6 +366,8 @@ provider hotspot_jni {
   probe IsInstanceOf__return(uintptr_t);
   probe IsSameObject__entry(void*, void*, void*);
   probe IsSameObject__return(uintptr_t);
+  probe IsVirtualThread__entry(void*, void*);
+  probe IsVirtualThread__return(uintptr_t);
   probe MonitorEnter__entry(void*, void*);
   probe MonitorEnter__return(uint32_t);
   probe MonitorExit__entry(void*, void*);
diff --git a/src/hotspot/share/prims/jni.cpp b/src/hotspot/share/prims/jni.cpp
index 2297ce9b790..85207fddf29 100644
--- a/src/hotspot/share/prims/jni.cpp
+++ b/src/hotspot/share/prims/jni.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1997, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
  * Copyright (c) 2012, 2024 Red Hat, Inc.
  * Copyright (c) 2021, Azul Systems, Inc. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
@@ -3129,16 +3129,21 @@ JNI_END
 
 
 JNI_ENTRY(jobject, jni_GetModule(JNIEnv* env, jclass clazz))
-  return Modules::get_module(clazz, THREAD);
+  HOTSPOT_JNI_GETMODULE_ENTRY(env, clazz);
+  jobject ret = Modules::get_module(clazz, THREAD);
+  HOTSPOT_JNI_GETMODULE_RETURN(ret);
+  return ret;
 JNI_END
 
 JNI_ENTRY(jboolean, jni_IsVirtualThread(JNIEnv* env, jobject obj))
+  HOTSPOT_JNI_ISVIRTUALTHREAD_ENTRY(env, obj);
+  jboolean ret = JNI_FALSE;
   oop thread_obj = JNIHandles::resolve_external_guard(obj);
   if (thread_obj != nullptr && thread_obj->is_a(vmClasses::BaseVirtualThread_klass())) {
-    return JNI_TRUE;
-  } else {
-    return JNI_FALSE;
+    ret = JNI_TRUE;
   }
+  HOTSPOT_JNI_ISVIRTUALTHREAD_RETURN(ret);
+  return ret;
 JNI_END
 
 
diff --git a/src/hotspot/share/utilities/dtrace_disabled.hpp b/src/hotspot/share/utilities/dtrace_disabled.hpp
index 6cbd79326ac..99d7cbb2f75 100644
--- a/src/hotspot/share/utilities/dtrace_disabled.hpp
+++ b/src/hotspot/share/utilities/dtrace_disabled.hpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2011, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2011, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -683,6 +683,10 @@
 #define HOTSPOT_JNI_GETMETHODID_ENTRY_ENABLED()  0
 #define HOTSPOT_JNI_GETMETHODID_RETURN(arg0)
 #define HOTSPOT_JNI_GETMETHODID_RETURN_ENABLED()  0
+#define HOTSPOT_JNI_GETMODULE_ENTRY(arg0, arg1)
+#define HOTSPOT_JNI_GETMODULE_ENTRY_ENABLED()  0
+#define HOTSPOT_JNI_GETMODULE_RETURN(arg0)
+#define HOTSPOT_JNI_GETMODULE_RETURN_ENABLED()  0
 #define HOTSPOT_JNI_GETOBJECTARRAYELEMENT_ENTRY(arg0, arg1, arg2)
 #define HOTSPOT_JNI_GETOBJECTARRAYELEMENT_ENTRY_ENABLED()  0
 #define HOTSPOT_JNI_GETOBJECTARRAYELEMENT_RETURN(arg0)
@@ -811,6 +815,10 @@
 #define HOTSPOT_JNI_ISSAMEOBJECT_ENTRY_ENABLED()  0
 #define HOTSPOT_JNI_ISSAMEOBJECT_RETURN(arg0)
 #define HOTSPOT_JNI_ISSAMEOBJECT_RETURN_ENABLED()  0
+#define HOTSPOT_JNI_ISVIRTUALTHREAD_ENTRY(arg0, arg1)
+#define HOTSPOT_JNI_ISVIRTUALTHREAD_ENTRY_ENABLED()  0
+#define HOTSPOT_JNI_ISVIRTUALTHREAD_RETURN(arg0)
+#define HOTSPOT_JNI_ISVIRTUALTHREAD_RETURN_ENABLED()  0
 #define HOTSPOT_JNI_MONITORENTER_ENTRY(arg0, arg1)
 #define HOTSPOT_JNI_MONITORENTER_ENTRY_ENABLED()  0
 #define HOTSPOT_JNI_MONITORENTER_RETURN(arg0)
@@ -1080,12 +1088,6 @@
 #define HOTSPOT_JNI_UNREGISTERNATIVES_RETURN(arg0)
 #define HOTSPOT_JNI_UNREGISTERNATIVES_RETURN_ENABLED()  0
 
-/* Modules */
-#define HOTSPOT_JNI_GETMODULE_ENTRY(arg0, arg1)
-#define HOTSPOT_JNI_GETMODULE_ENTRY_ENABLED()  0
-#define HOTSPOT_JNI_GETMODULE_RETURN(arg0)
-#define HOTSPOT_JNI_GETMODULE_RETURN_ENABLED()
-
 #else /* !defined(DTRACE_ENABLED) */
 #error This file should only be included when dtrace is not enabled
 #endif /* !defined(DTRACE_ENABLED) */

From 50f81c5d7c72c3085b076f897bd6608a4c016013 Mon Sep 17 00:00:00 2001
From: David Beaumont <dbeaumont@openjdk.org>
Date: Tue, 17 Mar 2026 21:43:58 +0000
Subject: [PATCH 226/655] 8379798: Refactor remaining tests in
 javax/xml/jaxp/functional to JUnit

Reviewed-by: joehw
---
 .../dom/ptests/AbstractCharacterDataTest.java |  87 +++++-----
 .../org/w3c/dom/ptests/AttrTest.java          |  27 ++--
 .../org/w3c/dom/ptests/CommentTest.java       |  17 +-
 .../org/w3c/dom/ptests/DocumentTest.java      |  73 +++++----
 .../org/w3c/dom/ptests/DocumentTypeTest.java  |  39 +++--
 .../w3c/dom/ptests/DomImplementationTest.java |  41 ++---
 .../org/w3c/dom/ptests/ElementTest.java       | 102 ++++++------
 .../org/w3c/dom/ptests/EntityChildTest.java   |  25 ++-
 .../org/w3c/dom/ptests/NamedNodeMapTest.java  |  28 ++--
 .../org/w3c/dom/ptests/NodeListTest.java      |  23 ++-
 .../org/w3c/dom/ptests/NodeTest.java          |  82 +++++-----
 .../org/w3c/dom/ptests/NotationTest.java      |  23 ++-
 .../functional/org/w3c/dom/ptests/PITest.java |  18 +--
 .../org/w3c/dom/ptests/TextTest.java          |  24 ++-
 .../org/w3c/dom/ptests/TypeInfoTest.java      | 128 ++++++++-------
 .../org/xml/sax/ptests/AttrImplTest.java      |  59 +++----
 .../org/xml/sax/ptests/AttributesNSTest.java  |  25 +--
 .../org/xml/sax/ptests/AttributesTest.java    |  25 +--
 .../xml/sax/ptests/ContentHandlerTest.java    |  47 +++---
 .../xml/sax/ptests/DefaultHandlerTest.java    |  54 +++----
 .../org/xml/sax/ptests/EHFatalTest.java       |  57 +++----
 .../org/xml/sax/ptests/NSSupportTest.java     |  29 ++--
 .../org/xml/sax/ptests/NSTableTest.java       |  12 +-
 .../org/xml/sax/ptests/ParserAdapterTest.java |  42 +++--
 .../org/xml/sax/ptests/ResolverTest.java      |  44 +++--
 .../org/xml/sax/ptests/XMLFilterCBTest.java   |  54 +++----
 .../org/xml/sax/ptests/XMLFilterTest.java     |  62 +++----
 .../xml/sax/ptests/XMLReaderAdapterTest.java  |  29 ++--
 .../xml/sax/ptests/XMLReaderFactoryTest.java  |  37 +++--
 .../xml/sax/ptests/XMLReaderNSTableTest.java  |  54 ++++---
 .../org/xml/sax/ptests/XMLReaderTest.java     |  56 +++----
 .../jaxp/functional/test/astro/AstroTest.java |  46 +++---
 .../functional/test/astro/DocumentLSTest.java |  52 +++---
 .../test/astro/NamespaceContextTest.java      |  32 ++--
 .../functional/test/astro/SAX201Test.java     |  10 +-
 .../test/astro/SchemaValidationTest.java      |  27 ++--
 .../functional/test/astro/XPathAPITest.java   |  94 ++++++-----
 .../test/auctionportal/AuctionController.java | 151 ++++++++++--------
 .../auctionportal/AuctionItemRepository.java  | 127 ++++++++-------
 .../{movies.xml.data => movies-utf16.xml}     |   0
 .../functional/test/gaptest/Bug4511326.java   |   9 +-
 .../functional/test/gaptest/Bug4512806.java   |  23 ++-
 .../functional/test/gaptest/Bug4515047.java   |   8 +-
 .../functional/test/gaptest/Bug4515660.java   |  52 +++---
 .../functional/test/gaptest/Bug4848653.java   |  28 ++--
 .../functional/test/gaptest/Bug4858685.java   |  38 ++---
 .../libs/org/w3c/dom/ptests/DOMTestUtil.java  |  15 +-
 .../libs/org/xml/sax/ptests/SAXTestConst.java |  18 ++-
 .../jaxp/libs/test/astro/AstroConstants.java  |  13 +-
 .../libs/test/astro/DOMFilterFactoryImpl.java |   5 +-
 .../astro/DOML3InputSourceFactoryImpl.java    |  34 ++--
 .../test/astro/InputSourceFactoryImpl.java    |   7 +-
 .../libs/test/astro/SAXFilterFactoryImpl.java |  28 ++--
 .../test/astro/StreamFilterFactoryImpl.java   |   5 +-
 .../astro/TemplatesFilterFactoryImpl.java     |   8 +-
 .../test/auctionportal/HiBidConstants.java    |  14 +-
 .../jaxp/libs/test/gaptest/GapTestConst.java  |  15 +-
 57 files changed, 1146 insertions(+), 1136 deletions(-)
 rename test/jaxp/javax/xml/jaxp/functional/test/auctionportal/content/{movies.xml.data => movies-utf16.xml} (100%)

diff --git a/test/jaxp/javax/xml/jaxp/functional/org/w3c/dom/ptests/AbstractCharacterDataTest.java b/test/jaxp/javax/xml/jaxp/functional/org/w3c/dom/ptests/AbstractCharacterDataTest.java
index c1b3381cb98..b46829de8e1 100644
--- a/test/jaxp/javax/xml/jaxp/functional/org/w3c/dom/ptests/AbstractCharacterDataTest.java
+++ b/test/jaxp/javax/xml/jaxp/functional/org/w3c/dom/ptests/AbstractCharacterDataTest.java
@@ -22,27 +22,26 @@
  */
 package org.w3c.dom.ptests;
 
-import static org.testng.Assert.assertEquals;
-import static org.testng.Assert.fail;
-import static org.w3c.dom.DOMException.INDEX_SIZE_ERR;
-import static org.w3c.dom.ptests.DOMTestUtil.DOMEXCEPTION_EXPECTED;
-
-import java.io.IOException;
-
-import javax.xml.parsers.ParserConfigurationException;
-
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
+import org.junit.jupiter.api.Test;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
 import org.w3c.dom.CharacterData;
 import org.w3c.dom.DOMException;
 import org.xml.sax.SAXException;
 
+import javax.xml.parsers.ParserConfigurationException;
+import java.io.IOException;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.fail;
+import static org.w3c.dom.DOMException.INDEX_SIZE_ERR;
+import static org.w3c.dom.ptests.DOMTestUtil.DOMEXCEPTION_EXPECTED;
+
 /*
  * @summary common test for the CharacterData Interface
  */
 public abstract class AbstractCharacterDataTest {
-    @DataProvider(name = "data-for-length")
-    public Object[][] getDataForTestLength() {
+    public static Object[][] getDataForTestLength() {
         return new Object[][] {
                 { "", 0 },
                 { "test", 4 } };
@@ -52,11 +51,11 @@ public abstract class AbstractCharacterDataTest {
      * Verify getLength method works as the spec, for an empty string, should
      * return zero
      */
-    @Test(dataProvider = "data-for-length")
+    @ParameterizedTest
+    @MethodSource("getDataForTestLength")
     public void testGetLength(String text, int length) throws Exception {
         CharacterData cd = createCharacterData(text);
-        assertEquals(cd.getLength(), length);
-
+        assertEquals(length, cd.getLength());
     }
 
     /*
@@ -66,12 +65,11 @@ public abstract class AbstractCharacterDataTest {
     public void testAppendData() throws Exception {
         CharacterData cd = createCharacterData("DOM");
         cd.appendData("2");
-        assertEquals(cd.getData(), "DOM2");
+        assertEquals("DOM2", cd.getData());
 
     }
 
-    @DataProvider(name = "data-for-delete")
-    public Object[][] getDataForTestDelete() {
+    public static Object[][] getDataForTestDelete() {
         return new Object[][] {
                 { "DOM", 2, 1, "DO" },
                 { "DOM", 0, 2, "M" },
@@ -81,15 +79,15 @@ public abstract class AbstractCharacterDataTest {
     /*
      * Verify deleteData method works as the spec.
      */
-    @Test(dataProvider = "data-for-delete")
+    @ParameterizedTest
+    @MethodSource("getDataForTestDelete")
     public void testDeleteData(String text, int offset, int count, String result) throws Exception {
         CharacterData cd = createCharacterData(text);
         cd.deleteData(offset, count);
         assertEquals(cd.getData(), result);
     }
 
-    @DataProvider(name = "data-for-replace")
-    public Object[][] getDataForTestReplace() {
+    public static Object[][] getDataForTestReplace() {
         return new Object[][] {
                 { "DOM", 0, 3, "SAX", "SAX" },
                 { "DOM", 1, 1, "AA", "DAAM" },
@@ -100,15 +98,15 @@ public abstract class AbstractCharacterDataTest {
     /*
      * Verify replaceData method works as the spec.
      */
-    @Test(dataProvider = "data-for-replace")
+    @ParameterizedTest
+    @MethodSource("getDataForTestReplace")
     public void testReplaceData(String text, int offset, int count, String arg, String result) throws Exception {
         CharacterData cd = createCharacterData(text);
         cd.replaceData(offset, count, arg);
         assertEquals(cd.getData(), result);
     }
 
-    @DataProvider(name = "data-for-replace-neg")
-    public Object[][] getDataForTestReplaceNeg() {
+    public static Object[][] getDataForTestReplaceNeg() {
         return new Object[][] {
                 { "DOM", -1, 3, "SAX" }, //offset if neg
                 { "DOM", 0, -1, "SAX" }, //count is neg
@@ -119,19 +117,19 @@ public abstract class AbstractCharacterDataTest {
      * Test for replaceData method: verifies that DOMException with
      * INDEX_SIZE_ERR is thrown if offset or count is out of the bound.
      */
-    @Test(dataProvider = "data-for-replace-neg")
+    @ParameterizedTest
+    @MethodSource("getDataForTestReplaceNeg")
     public void testReplaceDataNeg(String text, int offset, int count, String arg) throws Exception {
         CharacterData cd = createCharacterData(text);
         try {
             cd.replaceData(offset, count, arg);
             fail(DOMEXCEPTION_EXPECTED);
         } catch (DOMException e) {
-            assertEquals(e.code, INDEX_SIZE_ERR);
+            assertEquals(INDEX_SIZE_ERR, e.code);
         }
     }
 
-    @DataProvider(name = "data-for-insert")
-    public Object[][] getDataForTestInsert() {
+    public static Object[][] getDataForTestInsert() {
         return new Object[][] {
                 { "DOM", 0, "SAX", "SAXDOM" },
                 { "DOM", 3, "SAX", "DOMSAX" } };
@@ -140,15 +138,15 @@ public abstract class AbstractCharacterDataTest {
     /*
      * Verify insertData method works as the spec.
      */
-    @Test(dataProvider = "data-for-insert")
+    @ParameterizedTest
+    @MethodSource("getDataForTestInsert")
     public void testInsertData(String text, int offset, String arg, String result) throws Exception {
         CharacterData cd = createCharacterData(text);
         cd.insertData(offset, arg);
         assertEquals(cd.getData(), result);
     }
 
-    @DataProvider(name = "data-for-insert-neg")
-    public Object[][] getDataForTestInsertNeg() {
+    public static Object[][] getDataForTestInsertNeg() {
         return new Object[][] {
                 { "DOM", -1 }, //offset is neg
                 { "DOM", 4 } };//offset is greater than length
@@ -158,14 +156,15 @@ public abstract class AbstractCharacterDataTest {
      * Test for insertData method: verifies that DOMException with
      * INDEX_SIZE_ERR is thrown if offset is out of the bound.
      */
-    @Test(dataProvider = "data-for-insert-neg")
+    @ParameterizedTest
+    @MethodSource("getDataForTestInsertNeg")
     public void testInsertDataNeg(String text, int offset) throws Exception {
         CharacterData cd = createCharacterData(text);
         try {
             cd.insertData(offset, "TEST");
             fail(DOMEXCEPTION_EXPECTED);
         } catch (DOMException e) {
-            assertEquals(e.code, INDEX_SIZE_ERR);
+            assertEquals(INDEX_SIZE_ERR, e.code);
         }
     }
 
@@ -176,11 +175,10 @@ public abstract class AbstractCharacterDataTest {
     public void testSetData() throws Exception {
         CharacterData cd = createCharacterData("DOM");
         cd.setData("SAX");
-        assertEquals(cd.getData(), "SAX");
+        assertEquals("SAX", cd.getData());
     }
 
-    @DataProvider(name = "data-for-substring")
-    public Object[][] getDataForTestSubstring() {
+    public static Object[][] getDataForTestSubstring() {
         return new Object[][] {
                 { "DOM Level 2", 0, 3, "DOM" },
                 { "DOM", 0, 3, "DOM" },
@@ -190,15 +188,14 @@ public abstract class AbstractCharacterDataTest {
     /*
      * Verify substringData method works as the spec.
      */
-    @Test(dataProvider = "data-for-substring")
+    @ParameterizedTest
+    @MethodSource("getDataForTestSubstring")
     public void testSubstringData(String text, int offset, int count, String result) throws Exception {
         CharacterData cd = createCharacterData(text);
-        String retStr = cd.substringData(offset, count);
-        assertEquals(retStr, result);
+        assertEquals(result, cd.substringData(offset, count));
     }
 
-    @DataProvider(name = "data-for-substring-neg")
-    public Object[][] getDataForTestSubstringNeg() {
+    public static Object[][] getDataForTestSubstringNeg() {
         return new Object[][] {
                 { "DOM Level 2", -1, 3 }, //offset is neg
                 { "DOM", 0, -1 }, //count is neg
@@ -209,14 +206,15 @@ public abstract class AbstractCharacterDataTest {
      * Test for substringData method: verifies that DOMException with
      * INDEX_SIZE_ERR is thrown if offset or count is out of the bound.
      */
-    @Test(dataProvider = "data-for-substring-neg")
+    @ParameterizedTest
+    @MethodSource("getDataForTestSubstringNeg")
     public void testSubstringDataNeg(String text, int offset, int count) throws Exception {
         CharacterData cd = createCharacterData(text);
         try {
             cd.substringData(offset, count);
             fail(DOMEXCEPTION_EXPECTED);
         } catch (DOMException e) {
-            assertEquals(e.code, INDEX_SIZE_ERR);
+            assertEquals(INDEX_SIZE_ERR, e.code);
         }
 
     }
@@ -225,5 +223,4 @@ public abstract class AbstractCharacterDataTest {
      * Return a concrete CharacterData instance.
      */
     abstract protected CharacterData createCharacterData(String text) throws IOException, SAXException, ParserConfigurationException;
-
 }
diff --git a/test/jaxp/javax/xml/jaxp/functional/org/w3c/dom/ptests/AttrTest.java b/test/jaxp/javax/xml/jaxp/functional/org/w3c/dom/ptests/AttrTest.java
index bd7dfb10eab..08ba9b81055 100644
--- a/test/jaxp/javax/xml/jaxp/functional/org/w3c/dom/ptests/AttrTest.java
+++ b/test/jaxp/javax/xml/jaxp/functional/org/w3c/dom/ptests/AttrTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,23 +23,23 @@
 
 package org.w3c.dom.ptests;
 
-import static org.testng.Assert.assertEquals;
-import static org.testng.Assert.assertFalse;
-import static org.testng.Assert.assertNull;
-import static org.testng.Assert.assertTrue;
-import static org.w3c.dom.ptests.DOMTestUtil.createDOM;
-
-import org.testng.annotations.Test;
+import org.junit.jupiter.api.Test;
 import org.w3c.dom.Attr;
 import org.w3c.dom.Document;
 import org.w3c.dom.Element;
 import org.w3c.dom.NamedNodeMap;
 
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertFalse;
+import static org.junit.jupiter.api.Assertions.assertNull;
+import static org.junit.jupiter.api.Assertions.assertTrue;
+import static org.w3c.dom.ptests.DOMTestUtil.createDOM;
+
 
 /*
  * @test
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm org.w3c.dom.ptests.AttrTest
+ * @run junit/othervm org.w3c.dom.ptests.AttrTest
  * @summary Test for the Attr Interface
  */
 public class AttrTest {
@@ -51,12 +51,12 @@ public class AttrTest {
         Document document = createDOM("Attr01.xml");
         //test a new created Attr
         Attr attr = document.createAttribute("newAttribute");
-        assertEquals(attr.getName(), "newAttribute");
+        assertEquals("newAttribute", attr.getName());
 
         //test a Attr loaded from xml file
         Element elemNode = (Element) document.getElementsByTagName("book").item(1);
         Attr attr2 = (Attr) elemNode.getAttributes().item(0);
-        assertEquals(attr2.getName(), "category1");
+        assertEquals("category1", attr2.getName());
     }
 
     /*
@@ -71,7 +71,7 @@ public class AttrTest {
         NamedNodeMap nnMap = elemNode.getAttributes();
         for (int i = 0; i < nnMap.getLength(); i++) {
             Attr attr = (Attr) nnMap.item(i);
-            assertEquals(attr.getOwnerElement().getNodeName(), "book");
+            assertEquals("book", attr.getOwnerElement().getNodeName());
         }
 
         //test an Attr without owner node
@@ -143,8 +143,7 @@ public class AttrTest {
         Document document = createDOM("Attr01.xml");
         Attr attr = document.createAttribute("newAttribute");
         attr.setValue("newVal");
-        assertEquals(attr.getValue(), "newVal");
-
+        assertEquals("newVal", attr.getValue());
     }
 
 }
diff --git a/test/jaxp/javax/xml/jaxp/functional/org/w3c/dom/ptests/CommentTest.java b/test/jaxp/javax/xml/jaxp/functional/org/w3c/dom/ptests/CommentTest.java
index c3cff46c714..2f0664a8139 100644
--- a/test/jaxp/javax/xml/jaxp/functional/org/w3c/dom/ptests/CommentTest.java
+++ b/test/jaxp/javax/xml/jaxp/functional/org/w3c/dom/ptests/CommentTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -22,25 +22,24 @@
  */
 package org.w3c.dom.ptests;
 
-import static org.w3c.dom.ptests.DOMTestUtil.createNewDocument;
-
-import java.io.IOException;
-
-import javax.xml.parsers.ParserConfigurationException;
-
 import org.w3c.dom.CharacterData;
 import org.w3c.dom.Document;
 import org.xml.sax.SAXException;
 
+import javax.xml.parsers.ParserConfigurationException;
+import java.io.IOException;
+
+import static org.w3c.dom.ptests.DOMTestUtil.createNewDocument;
+
 /*
  * @test
  * @library /javax/xml/jaxp/libs /javax/xml/jaxp/functional
- * @run testng/othervm org.w3c.dom.ptests.CommentTest
+ * @run junit/othervm org.w3c.dom.ptests.CommentTest
  * @summary Test for Comment implementation returned by Document.createComment(String)
  */
 public class CommentTest extends AbstractCharacterDataTest {
     @Override
-    protected CharacterData createCharacterData(String text) throws IOException, SAXException, ParserConfigurationException {
+    protected CharacterData createCharacterData(String text) throws ParserConfigurationException {
         Document document = createNewDocument();
         return document.createComment(text);
     }
diff --git a/test/jaxp/javax/xml/jaxp/functional/org/w3c/dom/ptests/DocumentTest.java b/test/jaxp/javax/xml/jaxp/functional/org/w3c/dom/ptests/DocumentTest.java
index 3ebf28afaa7..b7b5c2669ea 100644
--- a/test/jaxp/javax/xml/jaxp/functional/org/w3c/dom/ptests/DocumentTest.java
+++ b/test/jaxp/javax/xml/jaxp/functional/org/w3c/dom/ptests/DocumentTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -22,34 +22,35 @@
  */
 package org.w3c.dom.ptests;
 
-import static javax.xml.XMLConstants.XMLNS_ATTRIBUTE_NS_URI;
-import static javax.xml.XMLConstants.XML_NS_URI;
-import static org.testng.Assert.assertEquals;
-import static org.testng.Assert.assertNotNull;
-import static org.testng.Assert.fail;
-import static org.w3c.dom.DOMException.NAMESPACE_ERR;
-import static org.w3c.dom.ptests.DOMTestUtil.DOMEXCEPTION_EXPECTED;
-import static org.w3c.dom.ptests.DOMTestUtil.createDOMWithNS;
-import static org.w3c.dom.ptests.DOMTestUtil.createNewDocument;
-
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
+import org.junit.jupiter.api.Test;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
 import org.w3c.dom.Attr;
 import org.w3c.dom.DOMException;
 import org.w3c.dom.Document;
 import org.w3c.dom.Element;
 import org.w3c.dom.NodeList;
 
+import static javax.xml.XMLConstants.XMLNS_ATTRIBUTE_NS_URI;
+import static javax.xml.XMLConstants.XML_NS_URI;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertNotNull;
+import static org.junit.jupiter.api.Assertions.assertThrows;
+import static org.junit.jupiter.api.Assertions.fail;
+import static org.w3c.dom.DOMException.NAMESPACE_ERR;
+import static org.w3c.dom.ptests.DOMTestUtil.DOMEXCEPTION_EXPECTED;
+import static org.w3c.dom.ptests.DOMTestUtil.createDOMWithNS;
+import static org.w3c.dom.ptests.DOMTestUtil.createNewDocument;
+
 /*
  * @test
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm org.w3c.dom.ptests.DocumentTest
+ * @run junit/othervm org.w3c.dom.ptests.DocumentTest
  * @summary Test createAttributeNS, getElementsByTagNameNS and createElementNS method of Document
  */
 public class DocumentTest {
 
-    @DataProvider(name = "invalid-nsuri")
-    public Object[][] getInvalidNamespaceURI() {
+    public static Object[][] getInvalidNamespaceURI() {
         return new Object[][] {
                 { " ", "xml:novel" }, //blank
                 { "hello", "xml:novel" }, //unqualified
@@ -61,14 +62,14 @@ public class DocumentTest {
      * Test for createAttributeNS method: verifies that DOMException is thrown
      * if reserved prefixes are used with an arbitrary namespace name.
      */
-    @Test(dataProvider = "invalid-nsuri", expectedExceptions = DOMException.class)
+    @ParameterizedTest
+    @MethodSource("getInvalidNamespaceURI")
     public void testCreateAttributeNSNeg(String namespaceURI, String name) throws Exception {
         Document document = createDOMWithNS("DocumentTest01.xml");
-        document.createAttributeNS(namespaceURI, name);
+        assertThrows(DOMException.class, () -> document.createAttributeNS(namespaceURI, name));
     }
 
-    @DataProvider(name = "valid-nsuri")
-    public Object[][] getValidNamespaceURI() {
+    public static Object[][] getValidNamespaceURI() {
         return new Object[][] {
                 { XML_NS_URI, "xml:novel" },
                 { XMLNS_ATTRIBUTE_NS_URI, "xmlns:novel" },
@@ -79,16 +80,16 @@ public class DocumentTest {
     /*
      * Verify the Attr from createAttributeNS.
      */
-    @Test(dataProvider = "valid-nsuri")
+    @ParameterizedTest
+    @MethodSource("getValidNamespaceURI")
     public void testCreateAttributeNS(String namespaceURI, String name) throws Exception {
         Document document = createDOMWithNS("DocumentTest01.xml");
         Attr attr = document.createAttributeNS(namespaceURI, name);
-        assertEquals(attr.getNamespaceURI(), namespaceURI);
-        assertEquals(attr.getName(), name);
+        assertEquals(namespaceURI, attr.getNamespaceURI());
+        assertEquals(name, attr.getName());
     }
 
-    @DataProvider(name = "elementName")
-    public Object[][] getElementName() {
+    public static Object[][] getElementName() {
         return new Object[][] {
                 { "author", 1 },
                 { "b:author", 0 } };
@@ -97,25 +98,27 @@ public class DocumentTest {
     /*
      * Verify the NodeList from getElementsByTagNameNS.
      */
-    @Test(dataProvider = "elementName")
-    public void testGetElementsByTagNameNS(String localName, int number) throws Exception {
+    @ParameterizedTest
+    @MethodSource("getElementName")
+    public void testGetElementsByTagNameNS(String localName, int expectedLength) throws Exception {
         Document document = createDOMWithNS("DocumentTest01.xml");
         NodeList nodeList = document.getElementsByTagNameNS("urn:BooksAreUs.org:BookInfo", localName);
-        assertEquals(nodeList.getLength(), number);
+        assertEquals(expectedLength, nodeList.getLength());
     }
 
     /*
      * Test for createElementNS method: verifies that DOMException is thrown
      * if reserved prefixes are used with an arbitrary namespace name.
      */
-    @Test(dataProvider = "invalid-nsuri")
+    @ParameterizedTest
+    @MethodSource("getInvalidNamespaceURI")
     public void testCreateElementNSNeg(String namespaceURI, String name) throws Exception {
         Document document = createDOMWithNS("DocumentTest01.xml");
         try {
             document.createElementNS(namespaceURI, name);
             fail(DOMEXCEPTION_EXPECTED);
         } catch (DOMException e) {
-            assertEquals(e.code, NAMESPACE_ERR);
+            assertEquals(NAMESPACE_ERR, e.code);
         }
     }
 
@@ -129,9 +132,9 @@ public class DocumentTest {
         final String localName = "novel";
         Document document = createDOMWithNS("DocumentTest01.xml");
         Element element = document.createElementNS(nsURI, name);
-        assertEquals(element.getNamespaceURI(), nsURI);
-        assertEquals(element.getNodeName(), name);
-        assertEquals(element.getLocalName(), localName);
+        assertEquals(nsURI, element.getNamespaceURI());
+        assertEquals(name, element.getNodeName());
+        assertEquals(localName, element.getLocalName());
     }
 
     /*
@@ -166,9 +169,9 @@ public class DocumentTest {
     /*
      * Test createElement with unqualified xml name.
      */
-    @Test(expectedExceptions = DOMException.class)
+    @Test
     public void testCreateElementNeg() throws Exception {
         Document doc = createNewDocument();
-        doc.createElement("!nc$%^*(!");
+        assertThrows(DOMException.class, () -> doc.createElement("!nc$%^*(!"));
     }
 }
diff --git a/test/jaxp/javax/xml/jaxp/functional/org/w3c/dom/ptests/DocumentTypeTest.java b/test/jaxp/javax/xml/jaxp/functional/org/w3c/dom/ptests/DocumentTypeTest.java
index b5265b825b0..448e358c97a 100644
--- a/test/jaxp/javax/xml/jaxp/functional/org/w3c/dom/ptests/DocumentTypeTest.java
+++ b/test/jaxp/javax/xml/jaxp/functional/org/w3c/dom/ptests/DocumentTypeTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,18 +23,18 @@
 
 package org.w3c.dom.ptests;
 
-import static org.testng.Assert.assertEquals;
-import static org.w3c.dom.ptests.DOMTestUtil.createDOM;
-
-import org.testng.Assert;
-import org.testng.annotations.Test;
+import org.junit.jupiter.api.Test;
 import org.w3c.dom.DocumentType;
 import org.w3c.dom.NamedNodeMap;
 
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertNull;
+import static org.w3c.dom.ptests.DOMTestUtil.createDOM;
+
 /*
  * @test
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm org.w3c.dom.ptests.DocumentTypeTest
+ * @run junit/othervm org.w3c.dom.ptests.DocumentTypeTest
  * @summary Test DocumentType
  */
 public class DocumentTypeTest {
@@ -48,10 +48,10 @@ public class DocumentTypeTest {
         NamedNodeMap namedNodeMap = documentType.getEntities();
         // should return both external and internal. Parameter entities are not
         // contained. Duplicates are discarded.
-        assertEquals(namedNodeMap.getLength(), 3);
-        assertEquals(namedNodeMap.item(0).getNodeName(), "author");
-        assertEquals(namedNodeMap.item(1).getNodeName(), "test");
-        assertEquals(namedNodeMap.item(2).getNodeName(), "writer");
+        assertEquals(3, namedNodeMap.getLength());
+        assertEquals("author", namedNodeMap.item(0).getNodeName());
+        assertEquals("test", namedNodeMap.item(1).getNodeName());
+        assertEquals("writer", namedNodeMap.item(2).getNodeName());
     }
 
     /*
@@ -61,12 +61,11 @@ public class DocumentTypeTest {
     public void testGetNotations() throws Exception {
         DocumentType documentType = createDOM("DocumentType03.xml").getDoctype();
         NamedNodeMap nm = documentType.getNotations();
-        assertEquals(nm.getLength(), 2); // should return 2 because the notation
-                                         // name is repeated and
-                                         // it considers only the first
-                                         // occurence
-        assertEquals(nm.item(0).getNodeName(), "gs");
-        assertEquals(nm.item(1).getNodeName(), "name");
+        // should return 2 because the notation name is repeated,
+        // and it considers only the first occurrence
+        assertEquals(2, nm.getLength());
+        assertEquals("gs", nm.item(0).getNodeName());
+        assertEquals("name", nm.item(1).getNodeName());
     }
 
     /*
@@ -75,7 +74,7 @@ public class DocumentTypeTest {
     @Test
     public void testGetName() throws Exception {
         DocumentType documentType = createDOM("DocumentType03.xml").getDoctype();
-        assertEquals(documentType.getName(), "note");
+        assertEquals("note", documentType.getName());
     }
 
     /*
@@ -84,8 +83,8 @@ public class DocumentTypeTest {
     @Test
     public void testGetSystemId() throws Exception {
         DocumentType documentType = createDOM("DocumentType05.xml").getDoctype();
-        assertEquals(documentType.getSystemId(), "DocumentBuilderImpl02.dtd");
-        Assert.assertNull(documentType.getPublicId());
+        assertEquals("DocumentBuilderImpl02.dtd", documentType.getSystemId());
+        assertNull(documentType.getPublicId());
     }
 
 }
diff --git a/test/jaxp/javax/xml/jaxp/functional/org/w3c/dom/ptests/DomImplementationTest.java b/test/jaxp/javax/xml/jaxp/functional/org/w3c/dom/ptests/DomImplementationTest.java
index 8e8191aa2a3..251279ced4f 100644
--- a/test/jaxp/javax/xml/jaxp/functional/org/w3c/dom/ptests/DomImplementationTest.java
+++ b/test/jaxp/javax/xml/jaxp/functional/org/w3c/dom/ptests/DomImplementationTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -22,21 +22,22 @@
  */
 package org.w3c.dom.ptests;
 
-import static org.testng.Assert.assertEquals;
-import static org.w3c.dom.ptests.DOMTestUtil.createNewDocument;
-
-import javax.xml.parsers.ParserConfigurationException;
-
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
+import org.junit.jupiter.api.Test;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
 import org.w3c.dom.DOMImplementation;
 import org.w3c.dom.Document;
 import org.w3c.dom.DocumentType;
 
+import javax.xml.parsers.ParserConfigurationException;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.w3c.dom.ptests.DOMTestUtil.createNewDocument;
+
 /*
  * @test
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm org.w3c.dom.ptests.DomImplementationTest
+ * @run junit/othervm org.w3c.dom.ptests.DomImplementationTest
  * @summary Test DomImplementation API
  */
 public class DomImplementationTest {
@@ -50,8 +51,8 @@ public class DomImplementationTest {
         final String name = "document:localName";
         DOMImplementation domImpl = getDOMImplementation();
         Document document = domImpl.createDocument(nsURI, name, null);
-        assertEquals(document.getDocumentElement().getNamespaceURI(), nsURI);
-        assertEquals(document.getDocumentElement().getNodeName(), name);
+        assertEquals(nsURI, document.getDocumentElement().getNamespaceURI());
+        assertEquals(name, document.getDocumentElement().getNodeName());
     }
 
     /*
@@ -85,8 +86,7 @@ public class DomImplementationTest {
         verifyDocumentType(document.getDoctype(), name, publicId, systemId);
     }
 
-    @DataProvider(name = "feature-supported")
-    public Object[][] getFeatureSupportedList() throws ParserConfigurationException {
+    public static Object[][] getFeatureSupportedList() throws ParserConfigurationException {
         DOMImplementation impl = getDOMImplementation();
         return new Object[][] {
                 { impl, "XML", "2.0", true },
@@ -109,20 +109,21 @@ public class DomImplementationTest {
     /*
      * Verify DOMImplementation for feature supporting.
      */
-    @Test(dataProvider = "feature-supported")
+    @ParameterizedTest
+    @MethodSource("getFeatureSupportedList")
     public void testHasFeature(DOMImplementation impl, String feature, String version, boolean isSupported) {
-        assertEquals(impl.hasFeature(feature,version), isSupported);
+        assertEquals(isSupported, impl.hasFeature(feature, version));
     }
 
 
-    private DOMImplementation getDOMImplementation() throws ParserConfigurationException {
+    private static DOMImplementation getDOMImplementation() throws ParserConfigurationException {
         return createNewDocument().getImplementation();
     }
 
 
-    private void verifyDocumentType(DocumentType documentType, String name, String publicId, String systemId) {
-        assertEquals(documentType.getPublicId(), publicId);
-        assertEquals(documentType.getSystemId(), systemId);
-        assertEquals(documentType.getName(), name);
+    private static void verifyDocumentType(DocumentType documentType, String name, String publicId, String systemId) {
+        assertEquals(publicId, documentType.getPublicId());
+        assertEquals(systemId, documentType.getSystemId());
+        assertEquals(name, documentType.getName());
     }
 }
diff --git a/test/jaxp/javax/xml/jaxp/functional/org/w3c/dom/ptests/ElementTest.java b/test/jaxp/javax/xml/jaxp/functional/org/w3c/dom/ptests/ElementTest.java
index b538f7d1738..b861e086b3e 100644
--- a/test/jaxp/javax/xml/jaxp/functional/org/w3c/dom/ptests/ElementTest.java
+++ b/test/jaxp/javax/xml/jaxp/functional/org/w3c/dom/ptests/ElementTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -22,23 +22,9 @@
  */
 package org.w3c.dom.ptests;
 
-import static javax.xml.XMLConstants.XML_NS_URI;
-import static org.testng.Assert.assertEquals;
-import static org.testng.Assert.assertNull;
-import static org.testng.Assert.assertTrue;
-import static org.testng.Assert.fail;
-import static org.w3c.dom.DOMException.INUSE_ATTRIBUTE_ERR;
-import static org.w3c.dom.ptests.DOMTestUtil.DOMEXCEPTION_EXPECTED;
-import static org.w3c.dom.ptests.DOMTestUtil.createDOM;
-import static org.w3c.dom.ptests.DOMTestUtil.createDOMWithNS;
-import static org.w3c.dom.ptests.DOMTestUtil.createNewDocument;
-
-import java.io.StringReader;
-
-import javax.xml.parsers.DocumentBuilderFactory;
-
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
+import org.junit.jupiter.api.Test;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
 import org.w3c.dom.Attr;
 import org.w3c.dom.DOMException;
 import org.w3c.dom.Document;
@@ -47,10 +33,25 @@ import org.w3c.dom.Node;
 import org.w3c.dom.NodeList;
 import org.xml.sax.InputSource;
 
+import javax.xml.parsers.DocumentBuilderFactory;
+import java.io.StringReader;
+
+import static javax.xml.XMLConstants.XML_NS_URI;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertNull;
+import static org.junit.jupiter.api.Assertions.assertThrows;
+import static org.junit.jupiter.api.Assertions.assertTrue;
+import static org.junit.jupiter.api.Assertions.fail;
+import static org.w3c.dom.DOMException.INUSE_ATTRIBUTE_ERR;
+import static org.w3c.dom.ptests.DOMTestUtil.DOMEXCEPTION_EXPECTED;
+import static org.w3c.dom.ptests.DOMTestUtil.createDOM;
+import static org.w3c.dom.ptests.DOMTestUtil.createDOMWithNS;
+import static org.w3c.dom.ptests.DOMTestUtil.createNewDocument;
+
 /*
  * @test
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm org.w3c.dom.ptests.ElementTest
+ * @run junit/othervm org.w3c.dom.ptests.ElementTest
  * @summary Test for the methods of Element Interface
  */
 public class ElementTest {
@@ -59,7 +60,7 @@ public class ElementTest {
         Document document = createDOMWithNS("ElementSample01.xml");
         Element elemNode = (Element) document.getElementsByTagName("book").item(0);
         String s = elemNode.getAttributeNS("urn:BooksAreUs.org:BookInfo", "category");
-        assertEquals(s, "research");
+        assertEquals("research", s);
     }
 
     @Test
@@ -67,7 +68,7 @@ public class ElementTest {
         Document document = createDOMWithNS("ElementSample01.xml");
         Element elemNode = (Element) document.getElementsByTagName("book").item(0);
         Attr attr = elemNode.getAttributeNodeNS("urn:BooksAreUs.org:BookInfo", "category");
-        assertEquals(attr.getValue(), "research");
+        assertEquals("research", attr.getValue());
 
     }
 
@@ -80,11 +81,11 @@ public class ElementTest {
         Document document = createDOMWithNS("ElementSample01.xml");
         Element elemNode = (Element) document.getElementsByTagName("book").item(1);
         Attr attr = elemNode.getAttributeNode("category1");
-        assertEquals(attr.getValue(), "research");
+        assertEquals("research", attr.getValue());
 
-        assertEquals(elemNode.getTagName(), "book");
+        assertEquals("book", elemNode.getTagName());
         elemNode.removeAttributeNode(attr);
-        assertEquals(elemNode.getAttribute("category1"), "");
+        assertEquals("", elemNode.getAttribute("category1"));
     }
 
     /*
@@ -112,8 +113,8 @@ public class ElementTest {
         elemNode.normalize();
         Node firstChild = elemNode.getFirstChild();
         Node lastChild = elemNode.getLastChild();
-        assertEquals(firstChild.getNodeValue(), "fjfjf");
-        assertEquals(lastChild.getNodeValue(), "fjfjf");
+        assertEquals("fjfjf", firstChild.getNodeValue());
+        assertEquals("fjfjf", lastChild.getNodeValue());
     }
 
     /*
@@ -129,32 +130,32 @@ public class ElementTest {
         myAttr.setValue(attrValue);
 
         assertNull(elemNode.setAttributeNode(myAttr));
-        assertEquals(elemNode.getAttribute(attrName), attrValue);
+        assertEquals(attrValue, elemNode.getAttribute(attrName));
     }
 
-    @DataProvider(name = "attribute")
-    public Object[][] getAttributeData() {
+    public static Object[][] getAttributeData() {
         return new Object[][] {
                 { "thisisname", "thisisitsvalue" },
                 { "style", "font-Family" } };
     }
 
-    @Test(dataProvider = "attribute")
+    @ParameterizedTest
+    @MethodSource("getAttributeData")
     public void testSetAttribute(String name, String value) throws Exception {
         Document document = createDOM("ElementSample02.xml");
         Element elemNode = document.createElement("pricetag2");
         elemNode.setAttribute(name, value);
-        assertEquals(elemNode.getAttribute(name), value);
+        assertEquals(value, elemNode.getAttribute(name));
     }
 
     /*
      * Negative test for setAttribute, null is not a valid name.
      */
-    @Test(expectedExceptions = DOMException.class)
+    @Test
     public void testSetAttributeNeg() throws Exception {
         Document document = createDOM("ElementSample02.xml");
         Element elemNode = document.createElement("pricetag2");
-        elemNode.setAttribute(null, null);
+        assertThrows(DOMException.class, () -> elemNode.setAttribute(null, null));
     }
 
     /*
@@ -182,7 +183,7 @@ public class ElementTest {
             element3.setAttributeNode(attr);
             fail(DOMEXCEPTION_EXPECTED);
         } catch (DOMException doe) {
-            assertEquals(doe.code, INUSE_ATTRIBUTE_ERR);
+            assertEquals(INUSE_ATTRIBUTE_ERR, doe.code);
         }
     }
 
@@ -201,8 +202,7 @@ public class ElementTest {
         assertNull(nl.item(0));
     }
 
-    @DataProvider(name = "nsattribute")
-    public Object[][] getNSAttributeData() {
+    public static Object[][] getNSAttributeData() {
         return new Object[][] {
                 { "h:html", "html", "attrValue" },
                 { "b:style", "style",  "attrValue" } };
@@ -211,14 +211,15 @@ public class ElementTest {
     /*
      * setAttributeNodeNS and verify it with getAttributeNS.
      */
-    @Test(dataProvider = "nsattribute")
+    @ParameterizedTest
+    @MethodSource("getNSAttributeData")
     public void testSetAttributeNodeNS(String qualifiedName, String localName, String value) throws Exception {
         Document document = createDOM("ElementSample03.xml");
         Element elemNode = document.createElement("pricetag2");
         Attr myAttr = document.createAttributeNS(XML_NS_URI, qualifiedName);
         myAttr.setValue(value);
         assertNull(elemNode.setAttributeNodeNS(myAttr));
-        assertEquals(elemNode.getAttributeNS(XML_NS_URI, localName), value);
+        assertEquals(value, elemNode.getAttributeNS(XML_NS_URI, localName));
     }
 
     @Test
@@ -233,22 +234,23 @@ public class ElementTest {
     @Test
     public void testToString() throws Exception {
         final String xml =
-                "<?xml version=\"1.0\" encoding=\"UTF-8\" standalone=\"yes\"?>"
-                + "<!DOCTYPE datacenterlist>"
-                + "<datacenterlist>"
-                + "  <datacenterinfo"
-                + "    id=\"0\""
-                + "    naddrs=\"1\""
-                + "    nnodes=\"1\""
-                + "    ismaster=\"0\">\n"
-                + "    <gateway ipaddr=\"192.168.100.27:26000\"/>"
-                + "  </datacenterinfo>"
-                + "</datacenterlist>";
+                """
+                <?xml version="1.0" encoding="UTF-8" standalone="yes"?>\
+                <!DOCTYPE datacenterlist>\
+                <datacenterlist>\
+                  <datacenterinfo\
+                    id="0"\
+                    naddrs="1"\
+                    nnodes="1"\
+                    ismaster="0">
+                    <gateway ipaddr="192.168.100.27:26000"/>\
+                  </datacenterinfo>\
+                </datacenterlist>""";
 
         Document doc = DocumentBuilderFactory.newInstance().newDocumentBuilder().parse(new InputSource(new StringReader(xml)));
         Element root = doc.getDocumentElement();
 
-        assertEquals(root.toString(), "[datacenterlist: null]");
+        assertEquals("[datacenterlist: null]", root.toString());
     }
 
 }
diff --git a/test/jaxp/javax/xml/jaxp/functional/org/w3c/dom/ptests/EntityChildTest.java b/test/jaxp/javax/xml/jaxp/functional/org/w3c/dom/ptests/EntityChildTest.java
index 65fe0e046ab..447100f45c9 100644
--- a/test/jaxp/javax/xml/jaxp/functional/org/w3c/dom/ptests/EntityChildTest.java
+++ b/test/jaxp/javax/xml/jaxp/functional/org/w3c/dom/ptests/EntityChildTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -22,23 +22,22 @@
  */
 package org.w3c.dom.ptests;
 
-import static org.testng.Assert.assertEquals;
-import static org.w3c.dom.ptests.DOMTestUtil.XML_DIR;
-
-import java.io.File;
-
-import javax.xml.parsers.DocumentBuilder;
-import javax.xml.parsers.DocumentBuilderFactory;
-
-import org.testng.annotations.Test;
+import org.junit.jupiter.api.Test;
 import org.w3c.dom.Document;
 import org.w3c.dom.Element;
 import org.w3c.dom.NodeList;
 
+import javax.xml.parsers.DocumentBuilder;
+import javax.xml.parsers.DocumentBuilderFactory;
+import java.io.File;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.w3c.dom.ptests.DOMTestUtil.XML_DIR;
+
 /*
  * @test
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm org.w3c.dom.ptests.EntityChildTest
+ * @run junit/othervm org.w3c.dom.ptests.EntityChildTest
  * @summary Test DOM Parser: parsing an xml file that contains external entities.
  */
 public class EntityChildTest {
@@ -54,7 +53,7 @@ public class EntityChildTest {
         Element root = document.getDocumentElement();
         NodeList n = root.getElementsByTagName("table");
         NodeList nl = n.item(0).getChildNodes();
-        assertEquals(n.getLength(), 1);
-        assertEquals(nl.getLength(), 3);
+        assertEquals(1, n.getLength());
+        assertEquals(3, nl.getLength());
     }
 }
diff --git a/test/jaxp/javax/xml/jaxp/functional/org/w3c/dom/ptests/NamedNodeMapTest.java b/test/jaxp/javax/xml/jaxp/functional/org/w3c/dom/ptests/NamedNodeMapTest.java
index 86cd3aa7bbb..5cf6bc2387c 100644
--- a/test/jaxp/javax/xml/jaxp/functional/org/w3c/dom/ptests/NamedNodeMapTest.java
+++ b/test/jaxp/javax/xml/jaxp/functional/org/w3c/dom/ptests/NamedNodeMapTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -22,21 +22,21 @@
  */
 package org.w3c.dom.ptests;
 
-import static org.testng.Assert.assertEquals;
-import static org.testng.Assert.assertNull;
-import static org.w3c.dom.ptests.DOMTestUtil.createDOMWithNS;
-
-import org.testng.annotations.Test;
+import org.junit.jupiter.api.Test;
 import org.w3c.dom.Attr;
 import org.w3c.dom.Document;
 import org.w3c.dom.NamedNodeMap;
 import org.w3c.dom.Node;
 import org.w3c.dom.NodeList;
 
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertNull;
+import static org.w3c.dom.ptests.DOMTestUtil.createDOMWithNS;
+
 /*
  * @test
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm org.w3c.dom.ptests.NamedNodeMapTest
+ * @run junit/othervm org.w3c.dom.ptests.NamedNodeMapTest
  * @summary Test for the methods of NamedNodeMap Interface
  */
 public class NamedNodeMapTest {
@@ -61,9 +61,9 @@ public class NamedNodeMapTest {
         // setting to a new Value
         attr.setValue("newValue");
         Node replacedAttr = namedNodeMap.setNamedItemNS(attr); // return the replaced attr
-        assertEquals(replacedAttr.getNodeValue(), "font-family");
+        assertEquals("font-family", replacedAttr.getNodeValue());
         Node updatedAttr = namedNodeMap.getNamedItemNS(nsURI, "style");
-        assertEquals(updatedAttr.getNodeValue(), "newValue");
+        assertEquals("newValue", updatedAttr.getNodeValue());
 
 
         // creating a non existing attribute node
@@ -75,7 +75,7 @@ public class NamedNodeMapTest {
         // checking if the node could be accessed
         // using the getNamedItemNS method
         Node newAttr = namedNodeMap.getNamedItemNS(nsURI, "newNode");
-        assertEquals(newAttr.getNodeValue(), "newValue");
+        assertEquals("newValue", newAttr.getNodeValue());
     }
 
     /*
@@ -89,7 +89,7 @@ public class NamedNodeMapTest {
         Node n = nodeList.item(7);
         NamedNodeMap namedNodeMap = n.getAttributes();
         Node node = namedNodeMap.getNamedItemNS("urn:BooksAreUs.org:BookInfo", "aaa");
-        assertEquals(node.getNodeValue(), "value");
+        assertEquals("value", node.getNodeValue());
 
     }
 
@@ -107,14 +107,14 @@ public class NamedNodeMapTest {
         NamedNodeMap namedNodeMap = n.getAttributes();
         Attr attr = document.createAttribute("name");
         Node replacedAttr = namedNodeMap.setNamedItem(attr);
-        assertEquals(replacedAttr.getNodeValue(), "attributeValue");
+        assertEquals("attributeValue", replacedAttr.getNodeValue());
         Node updatedAttrNode = namedNodeMap.getNamedItem("name");
-        assertEquals(updatedAttrNode.getNodeValue(), "");
+        assertEquals("", updatedAttrNode.getNodeValue());
 
         Attr newAttr = document.createAttribute("nonExistingName");
         assertNull(namedNodeMap.setNamedItem(newAttr));
         Node newAttrNode = namedNodeMap.getNamedItem("nonExistingName");
-        assertEquals(newAttrNode.getNodeValue(), "");
+        assertEquals("", newAttrNode.getNodeValue());
     }
 
 }
diff --git a/test/jaxp/javax/xml/jaxp/functional/org/w3c/dom/ptests/NodeListTest.java b/test/jaxp/javax/xml/jaxp/functional/org/w3c/dom/ptests/NodeListTest.java
index 740c28279f6..e04b24bd9ae 100644
--- a/test/jaxp/javax/xml/jaxp/functional/org/w3c/dom/ptests/NodeListTest.java
+++ b/test/jaxp/javax/xml/jaxp/functional/org/w3c/dom/ptests/NodeListTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -22,31 +22,31 @@
  */
 package org.w3c.dom.ptests;
 
-import static org.testng.Assert.assertEquals;
-import static org.w3c.dom.ptests.DOMTestUtil.createDOM;
-
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
 import org.w3c.dom.Document;
 import org.w3c.dom.Element;
 import org.w3c.dom.NodeList;
 
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.w3c.dom.ptests.DOMTestUtil.createDOM;
+
 /*
  * @test
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm org.w3c.dom.ptests.NodeListTest
+ * @run junit/othervm org.w3c.dom.ptests.NodeListTest
  * @summary Verifies a bug found in jaxp1.0.1 and 1.1FCS. After going out of
  * bound, the last element of a NodeList returns null. The bug has been fixed
  * in jaxp 1.1.1 build.
  */
 public class NodeListTest {
 
-    @DataProvider(name = "xml")
-    public Object[][] getTestData() {
+    public static Object[][] getTestData() {
         return new Object[][] { { "nodelist.xml", "document" }, { "Node01.xml", "body" } };
     }
 
-    @Test(dataProvider = "xml")
+    @ParameterizedTest
+    @MethodSource("getTestData")
     public void lastItemTest(String xmlFileName, String nodeName) throws Exception {
         Document document = createDOM(xmlFileName);
 
@@ -56,8 +56,7 @@ public class NodeListTest {
         Element elem1 = (Element) nl.item(n - 1);
         nl.item(n);
         Element elem3 = (Element) nl.item(n - 1);
-        assertEquals(elem3, elem1);
-
+        assertEquals(elem1, elem3);
     }
 
 }
diff --git a/test/jaxp/javax/xml/jaxp/functional/org/w3c/dom/ptests/NodeTest.java b/test/jaxp/javax/xml/jaxp/functional/org/w3c/dom/ptests/NodeTest.java
index 8df0808f9d4..828503d0e0b 100644
--- a/test/jaxp/javax/xml/jaxp/functional/org/w3c/dom/ptests/NodeTest.java
+++ b/test/jaxp/javax/xml/jaxp/functional/org/w3c/dom/ptests/NodeTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -22,29 +22,10 @@
  */
 package org.w3c.dom.ptests;
 
-import static jaxp.library.JAXPTestUtilities.USER_DIR;
-import static jaxp.library.JAXPTestUtilities.compareWithGold;
-import static org.testng.Assert.assertEquals;
-import static org.testng.Assert.assertFalse;
-import static org.testng.Assert.assertNotEquals;
-import static org.testng.Assert.assertTrue;
-import static org.w3c.dom.ptests.DOMTestUtil.GOLDEN_DIR;
-import static org.w3c.dom.ptests.DOMTestUtil.createDOM;
-import static org.w3c.dom.ptests.DOMTestUtil.createDOMWithNS;
-import static org.w3c.dom.ptests.DOMTestUtil.createNewDocument;
-
-import java.io.File;
-import java.util.PropertyPermission;
-
-import javax.xml.transform.Transformer;
-import javax.xml.transform.TransformerException;
-import javax.xml.transform.TransformerFactory;
-import javax.xml.transform.TransformerFactoryConfigurationError;
-import javax.xml.transform.dom.DOMSource;
-import javax.xml.transform.stream.StreamResult;
-
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
+import org.junit.jupiter.api.Assertions;
+import org.junit.jupiter.api.Test;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
 import org.w3c.dom.DOMException;
 import org.w3c.dom.Document;
 import org.w3c.dom.DocumentFragment;
@@ -52,15 +33,35 @@ import org.w3c.dom.Element;
 import org.w3c.dom.Node;
 import org.w3c.dom.NodeList;
 
+import javax.xml.transform.Transformer;
+import javax.xml.transform.TransformerException;
+import javax.xml.transform.TransformerFactory;
+import javax.xml.transform.TransformerFactoryConfigurationError;
+import javax.xml.transform.dom.DOMSource;
+import javax.xml.transform.stream.StreamResult;
+import java.io.File;
+import java.io.IOException;
+import java.nio.file.Files;
+import java.nio.file.Path;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertFalse;
+import static org.junit.jupiter.api.Assertions.assertNotEquals;
+import static org.junit.jupiter.api.Assertions.assertThrows;
+import static org.junit.jupiter.api.Assertions.assertTrue;
+import static org.w3c.dom.ptests.DOMTestUtil.GOLDEN_DIR;
+import static org.w3c.dom.ptests.DOMTestUtil.createDOM;
+import static org.w3c.dom.ptests.DOMTestUtil.createDOMWithNS;
+import static org.w3c.dom.ptests.DOMTestUtil.createNewDocument;
+
 /*
  * @test
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm org.w3c.dom.ptests.NodeTest
+ * @run junit/othervm org.w3c.dom.ptests.NodeTest
  * @summary Test Node interface
  */
 public class NodeTest {
-    @DataProvider(name = "feature-supported")
-    public Object[][] getFeatureSupportedList() throws Exception {
+    public static Object[][] getFeatureSupportedList() throws Exception {
         Document document = createDOMWithNS("Node01.xml");
         Node node = document.getElementsByTagName("body").item(0);
         return new Object[][] {
@@ -81,9 +82,10 @@ public class NodeTest {
     /*
      * Verify Node for feature supporting.
      */
-    @Test(dataProvider = "feature-supported")
+    @ParameterizedTest
+    @MethodSource("getFeatureSupportedList")
     public void testHasFeature(Node node, String feature, String version, boolean supported) {
-        assertEquals(node.isSupported(feature, version), supported);
+        assertEquals(supported, node.isSupported(feature, version));
     }
 
     /*
@@ -98,7 +100,7 @@ public class NodeTest {
         Node node =  document.getElementsByTagName("title").item(0);
         node.appendChild(document.createTextNode("test"));
         root.normalize();
-        assertEquals(node.getChildNodes().item(0).getNodeValue(), "Typographytest");
+        assertEquals("Typographytest", node.getChildNodes().item(0).getNodeValue());
     }
 
     /*
@@ -154,10 +156,10 @@ public class NodeTest {
         Element element = (Element) document.getElementsByTagName("sender").item(0);
         parentElement.insertBefore(createTestDocumentFragment(document), element);
 
-        String outputfile = USER_DIR + "InsertBefore.out";
+        String outputfile = "InsertBefore.out";
         String goldfile = GOLDEN_DIR + "InsertBeforeGF.out";
         outputXml(document, outputfile);
-        assertTrue(compareWithGold(goldfile, outputfile));
+        assertLinesMatch(goldfile, outputfile);
     }
 
 
@@ -172,10 +174,10 @@ public class NodeTest {
         Element element = (Element) document.getElementsByTagName("sender").item(0);
         parentElement.replaceChild(createTestDocumentFragment(document), element);
 
-        String outputfile = USER_DIR + "ReplaceChild3.out";
+        String outputfile = "ReplaceChild3.out";
         String goldfile = GOLDEN_DIR + "ReplaceChild3GF.out";
         outputXml(document, outputfile);
-        assertTrue(compareWithGold(goldfile, outputfile));
+        assertLinesMatch(goldfile, outputfile);
     }
 
     /*
@@ -183,14 +185,16 @@ public class NodeTest {
      * with a node which was created from a different document than the one
      * which is trying to use this method. It should throw a DOMException.
      */
-    @Test(expectedExceptions = DOMException.class)
+    @Test
     public void testReplaceChildNeg() throws Exception {
         Document document = createDOM("Node04.xml");
         Document doc2 = createNewDocument();
 
         Element parentElement = (Element) document.getElementsByTagName("to").item(0);
         Element element = (Element) document.getElementsByTagName("sender").item(0);
-        parentElement.replaceChild(createTestDocumentFragment(doc2), element);
+        assertThrows(
+                DOMException.class, () ->
+                        parentElement.replaceChild(createTestDocumentFragment(doc2), element));
     }
 
     private DocumentFragment createTestDocumentFragment(Document document) {
@@ -207,4 +211,10 @@ public class NodeTest {
         StreamResult streamResult = new StreamResult(new File(outputFileName));
         transformer.transform(domSource, streamResult);
     }
+
+    private static void assertLinesMatch(String goldenFile, String actual) throws IOException {
+        Assertions.assertLinesMatch(
+                Files.readAllLines(Path.of(goldenFile)),
+                Files.readAllLines(Path.of(actual)));
+    }
 }
diff --git a/test/jaxp/javax/xml/jaxp/functional/org/w3c/dom/ptests/NotationTest.java b/test/jaxp/javax/xml/jaxp/functional/org/w3c/dom/ptests/NotationTest.java
index 301df8e51c3..60630deb477 100644
--- a/test/jaxp/javax/xml/jaxp/functional/org/w3c/dom/ptests/NotationTest.java
+++ b/test/jaxp/javax/xml/jaxp/functional/org/w3c/dom/ptests/NotationTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -22,23 +22,22 @@
  */
 package org.w3c.dom.ptests;
 
-import static org.testng.Assert.assertEquals;
-import static org.w3c.dom.ptests.DOMTestUtil.createDOM;
-
-import java.io.IOException;
-
-import javax.xml.parsers.ParserConfigurationException;
-
-import org.testng.annotations.Test;
+import org.junit.jupiter.api.Test;
 import org.w3c.dom.Document;
 import org.w3c.dom.NamedNodeMap;
 import org.w3c.dom.Notation;
 import org.xml.sax.SAXException;
 
+import javax.xml.parsers.ParserConfigurationException;
+import java.io.IOException;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.w3c.dom.ptests.DOMTestUtil.createDOM;
+
 /*
  * @test
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm org.w3c.dom.ptests.NotationTest
+ * @run junit/othervm org.w3c.dom.ptests.NotationTest
  * @summary Test for Notation interface
  */
 public class NotationTest {
@@ -47,7 +46,7 @@ public class NotationTest {
      */
     @Test
     public void testGetSystemId() throws Exception {
-        assertEquals(findNotation("gs").getSystemId(), "http://who.knows.where/");
+        assertEquals("http://who.knows.where/", findNotation("gs").getSystemId());
     }
 
     /*
@@ -55,7 +54,7 @@ public class NotationTest {
      */
     @Test
     public void testGetPublicId() throws Exception {
-        assertEquals(findNotation("pubname").getPublicId(), "pubId");
+        assertEquals("pubId", findNotation("pubname").getPublicId());
     }
 
     //find notation in Notation01.xml
diff --git a/test/jaxp/javax/xml/jaxp/functional/org/w3c/dom/ptests/PITest.java b/test/jaxp/javax/xml/jaxp/functional/org/w3c/dom/ptests/PITest.java
index ea6a9072002..0dbff540c97 100644
--- a/test/jaxp/javax/xml/jaxp/functional/org/w3c/dom/ptests/PITest.java
+++ b/test/jaxp/javax/xml/jaxp/functional/org/w3c/dom/ptests/PITest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -22,17 +22,17 @@
  */
 package org.w3c.dom.ptests;
 
-import static org.testng.Assert.assertEquals;
-import static org.w3c.dom.ptests.DOMTestUtil.createDOMWithNS;
-
-import org.testng.annotations.Test;
+import org.junit.jupiter.api.Test;
 import org.w3c.dom.Document;
 import org.w3c.dom.ProcessingInstruction;
 
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.w3c.dom.ptests.DOMTestUtil.createDOMWithNS;
+
 /*
  * @test
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm org.w3c.dom.ptests.PITest
+ * @run junit/othervm org.w3c.dom.ptests.PITest
  * @summary Test for the methods of Processing Instruction
  */
 public class PITest {
@@ -43,11 +43,11 @@ public class PITest {
     public void test() throws Exception {
         Document document = createDOMWithNS("PITest01.xml");
         ProcessingInstruction pi = document.createProcessingInstruction("PI", "processing");
-        assertEquals(pi.getData(), "processing");
-        assertEquals(pi.getTarget(), "PI");
+        assertEquals("processing", pi.getData());
+        assertEquals("PI", pi.getTarget());
 
         pi.setData("newProcessing");
-        assertEquals(pi.getData(), "newProcessing");
+        assertEquals("newProcessing", pi.getData());
     }
 
 }
diff --git a/test/jaxp/javax/xml/jaxp/functional/org/w3c/dom/ptests/TextTest.java b/test/jaxp/javax/xml/jaxp/functional/org/w3c/dom/ptests/TextTest.java
index e763eda5c35..507801d1a2d 100644
--- a/test/jaxp/javax/xml/jaxp/functional/org/w3c/dom/ptests/TextTest.java
+++ b/test/jaxp/javax/xml/jaxp/functional/org/w3c/dom/ptests/TextTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -22,15 +22,7 @@
  */
 package org.w3c.dom.ptests;
 
-import static org.testng.Assert.assertEquals;
-import static org.w3c.dom.ptests.DOMTestUtil.createDOMWithNS;
-import static org.w3c.dom.ptests.DOMTestUtil.createNewDocument;
-
-import java.io.IOException;
-
-import javax.xml.parsers.ParserConfigurationException;
-
-import org.testng.annotations.Test;
+import org.junit.jupiter.api.Test;
 import org.w3c.dom.CharacterData;
 import org.w3c.dom.Document;
 import org.w3c.dom.Node;
@@ -38,10 +30,17 @@ import org.w3c.dom.NodeList;
 import org.w3c.dom.Text;
 import org.xml.sax.SAXException;
 
+import javax.xml.parsers.ParserConfigurationException;
+import java.io.IOException;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.w3c.dom.ptests.DOMTestUtil.createDOMWithNS;
+import static org.w3c.dom.ptests.DOMTestUtil.createNewDocument;
+
 /*
  * @test
  * @library /javax/xml/jaxp/libs /javax/xml/jaxp/functional
- * @run testng/othervm org.w3c.dom.ptests.TextTest
+ * @run junit/othervm org.w3c.dom.ptests.TextTest
  * @summary Test for Text implementation returned by Document.createTextNode(String)
  */
 public class TextTest extends AbstractCharacterDataTest {
@@ -60,8 +59,7 @@ public class TextTest extends AbstractCharacterDataTest {
 
         textNode.splitText(0);
         int increased = node.getChildNodes().getLength() - rawChildNum;
-        assertEquals(increased, 1);
-
+        assertEquals(1, increased);
     }
 
     @Override
diff --git a/test/jaxp/javax/xml/jaxp/functional/org/w3c/dom/ptests/TypeInfoTest.java b/test/jaxp/javax/xml/jaxp/functional/org/w3c/dom/ptests/TypeInfoTest.java
index 1013d5f4baf..d101b45d5f1 100644
--- a/test/jaxp/javax/xml/jaxp/functional/org/w3c/dom/ptests/TypeInfoTest.java
+++ b/test/jaxp/javax/xml/jaxp/functional/org/w3c/dom/ptests/TypeInfoTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2005, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2005, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -22,24 +22,23 @@
  */
 package org.w3c.dom.ptests;
 
-import static javax.xml.XMLConstants.W3C_XML_SCHEMA_NS_URI;
-import static org.testng.Assert.assertEquals;
-
-import java.io.StringReader;
-
-import javax.xml.parsers.DocumentBuilder;
-import javax.xml.parsers.DocumentBuilderFactory;
-
-import org.testng.annotations.Test;
+import org.junit.jupiter.api.Test;
 import org.w3c.dom.Document;
 import org.w3c.dom.Element;
 import org.w3c.dom.TypeInfo;
 import org.xml.sax.InputSource;
 
+import javax.xml.parsers.DocumentBuilder;
+import javax.xml.parsers.DocumentBuilderFactory;
+import java.io.StringReader;
+
+import static javax.xml.XMLConstants.W3C_XML_SCHEMA_NS_URI;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+
 /*
  * @test
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm org.w3c.dom.ptests.TypeInfoTest
+ * @run junit/othervm org.w3c.dom.ptests.TypeInfoTest
  * @summary Test getTypeName and getTypeNamespace methods of TypeInfo interface
  */
 public class TypeInfoTest {
@@ -48,11 +47,14 @@ public class TypeInfoTest {
      */
     @Test
     public void test() throws Exception {
-        TypeInfo typeInfo = getTypeOfRoot(SCHEMA_INSTANCE, "<?xml version='1.0'?>\n" + "<test1 xmlns=\"testNS\"><code/></test1>\n");
-
-        assertEquals(typeInfo.getTypeName(), "Test");
-        assertEquals(typeInfo.getTypeNamespace(), "testNS");
+        TypeInfo typeInfo = getTypeOfRoot(SCHEMA_INSTANCE,
+                """
+                <?xml version='1.0'?>
+                <test1 xmlns="testNS"><code/></test1>
+                """);
 
+        assertEquals("Test", typeInfo.getTypeName());
+        assertEquals("testNS", typeInfo.getTypeNamespace());
     }
 
     private TypeInfo getTypeOfRoot(String schemaText, String docText) throws Exception {
@@ -87,53 +89,55 @@ public class TypeInfoTest {
      * Schema instance
      */
     private static final String SCHEMA_INSTANCE =
-            "<?xml version=\"1.0\"?>\n"
-            + "<xsd:schema xmlns:xsd=\"http://www.w3.org/2001/XMLSchema\"\n"
-            + "            xmlns:testNS=\"testNS\"\n"
-            + "            targetNamespace=\"testNS\" elementFormDefault=\"qualified\">\n"
-            + "    <xsd:element name=\"test1\" type=\"testNS:Test\"/>\n"
-            + "    \n"
-            + "    <xsd:complexType name=\"Test\">\n"
-            + "        <xsd:sequence>\n"
-            + "            <xsd:element name=\"description\" minOccurs=\"0\"/>\n"
-            + "            <xsd:element name=\"code\"/>\n"
-            + "        </xsd:sequence>\n"
-            + "    </xsd:complexType>\n"
-            + "\n"
-            + "    <xsd:element name=\"test2\">\n"
-            + "        <xsd:complexType>\n"
-            + "            <xsd:sequence>\n"
-            + "                <xsd:element name=\"description\" minOccurs=\"0\"/>\n"
-            + "                <xsd:element name=\"code\"/>\n"
-            + "            </xsd:sequence>\n"
-            + "        </xsd:complexType>\n"
-            + "    </xsd:element>\n"
-            + "\n"
-            + "    <xsd:element name=\"test3\" type=\"xsd:string\"/>\n"
-            + "\n"
-            + "    <xsd:element name=\"test4\" type=\"testNS:Test1\"/>\n"
-            + "\n"
-            + "    <xsd:simpleType name=\"Test1\">\n"
-            + "        <xsd:restriction base=\"xsd:string\"/>\n"
-            + "    </xsd:simpleType>\n"
-            + "\n"
-            + "    <xsd:element name=\"test5\">\n"
-            + "        <xsd:simpleType>\n"
-            + "            <xsd:restriction base=\"xsd:string\"/>\n"
-            + "        </xsd:simpleType>\n"
-            + "    </xsd:element>\n"
-            + "\n"
-            + "    <xsd:element name=\"test6\">\n"
-            + "        <xsd:complexType>\n"
-            + "            <xsd:complexContent>\n"
-            + "                <xsd:extension base=\"testNS:Test\">\n"
-            + "                    <xsd:attribute name=\"attr\" type=\"xsd:string\"/>\n"
-            + "                </xsd:extension>\n"
-            + "            </xsd:complexContent>\n"
-            + "        </xsd:complexType>\n"
-            + "    </xsd:element>\n"
-            + "\n"
-            + "</xsd:schema>\n";
+            """
+            <?xml version="1.0"?>
+            <xsd:schema xmlns:xsd="http://www.w3.org/2001/XMLSchema"
+                        xmlns:testNS="testNS"
+                        targetNamespace="testNS" elementFormDefault="qualified">
+                <xsd:element name="test1" type="testNS:Test"/>
+
+                <xsd:complexType name="Test">
+                    <xsd:sequence>
+                        <xsd:element name="description" minOccurs="0"/>
+                        <xsd:element name="code"/>
+                    </xsd:sequence>
+                </xsd:complexType>
+
+                <xsd:element name="test2">
+                    <xsd:complexType>
+                        <xsd:sequence>
+                            <xsd:element name="description" minOccurs="0"/>
+                            <xsd:element name="code"/>
+                        </xsd:sequence>
+                    </xsd:complexType>
+                </xsd:element>
+
+                <xsd:element name="test3" type="xsd:string"/>
+
+                <xsd:element name="test4" type="testNS:Test1"/>
+
+                <xsd:simpleType name="Test1">
+                    <xsd:restriction base="xsd:string"/>
+                </xsd:simpleType>
+
+                <xsd:element name="test5">
+                    <xsd:simpleType>
+                        <xsd:restriction base="xsd:string"/>
+                    </xsd:simpleType>
+                </xsd:element>
+
+                <xsd:element name="test6">
+                    <xsd:complexType>
+                        <xsd:complexContent>
+                            <xsd:extension base="testNS:Test">
+                                <xsd:attribute name="attr" type="xsd:string"/>
+                            </xsd:extension>
+                        </xsd:complexContent>
+                    </xsd:complexType>
+                </xsd:element>
+
+            </xsd:schema>
+            """;
 
 
 }
diff --git a/test/jaxp/javax/xml/jaxp/functional/org/xml/sax/ptests/AttrImplTest.java b/test/jaxp/javax/xml/jaxp/functional/org/xml/sax/ptests/AttrImplTest.java
index b43012a6197..2af17996158 100644
--- a/test/jaxp/javax/xml/jaxp/functional/org/xml/sax/ptests/AttrImplTest.java
+++ b/test/jaxp/javax/xml/jaxp/functional/org/xml/sax/ptests/AttrImplTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -22,19 +22,20 @@
  */
 package org.xml.sax.ptests;
 
-import static org.testng.Assert.assertEquals;
-import static org.testng.Assert.assertNull;
-
-import org.testng.annotations.Test;
+import org.junit.jupiter.api.Test;
 import org.xml.sax.helpers.AttributesImpl;
 
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertNull;
+import static org.junit.jupiter.api.Assertions.assertThrows;
+
 /**
  * Class containing the test cases for AttributesImpl API.
  */
 /*
  * @test
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm org.xml.sax.ptests.AttrImplTest
+ * @run junit/othervm org.xml.sax.ptests.AttrImplTest
  */
 public class AttrImplTest {
     private static final String CAR_URI = "http://www.cars.com/xml";
@@ -66,8 +67,8 @@ public class AttrImplTest {
         attr.addAttribute(CAR_URI, CAR_LOCALNAME, CAR_QNAME, CAR_TYPE, CAR_VALUE);
         attr.addAttribute(JEEP_URI, JEEP_LOCALNAME, JEEP_QNAME, JEEP_TYPE,
                 JEEP_VALUE);
-        assertEquals(attr.getIndex(CAR_QNAME), 0);
-        assertEquals(attr.getIndex(JEEP_QNAME), 1);
+        assertEquals(0, attr.getIndex(CAR_QNAME));
+        assertEquals(1, attr.getIndex(JEEP_QNAME));
     }
 
     /**
@@ -79,7 +80,7 @@ public class AttrImplTest {
         attr.addAttribute(CAR_URI, CAR_LOCALNAME, CAR_QNAME, CAR_TYPE, CAR_VALUE);
         attr.addAttribute(JEEP_URI, JEEP_LOCALNAME, JEEP_QNAME, JEEP_TYPE,
                 JEEP_VALUE);
-        assertEquals(attr.getIndex(JEEP_URI, JEEP_LOCALNAME), 1);
+        assertEquals(1, attr.getIndex(JEEP_URI, JEEP_LOCALNAME));
     }
 
     /**
@@ -88,7 +89,7 @@ public class AttrImplTest {
     @Test
     public void testcase03() {
         AttributesImpl attr = new AttributesImpl();
-        assertEquals(attr.getIndex(JEEP_URI, "whl"), -1);
+        assertEquals(-1, attr.getIndex(JEEP_URI, "whl"));
     }
 
     /**
@@ -100,8 +101,8 @@ public class AttrImplTest {
         attr.addAttribute(CAR_URI, CAR_LOCALNAME, CAR_QNAME, CAR_TYPE, CAR_VALUE);
         attr.addAttribute(JEEP_URI, JEEP_LOCALNAME, JEEP_QNAME, JEEP_TYPE,
                 JEEP_VALUE);
-        assertEquals(attr.getType(1), JEEP_TYPE);
-        assertEquals(attr.getType(JEEP_QNAME), JEEP_TYPE);
+        assertEquals(JEEP_TYPE, attr.getType(1));
+        assertEquals(JEEP_TYPE, attr.getType(JEEP_QNAME));
     }
 
     /**
@@ -113,9 +114,9 @@ public class AttrImplTest {
         attr.addAttribute(CAR_URI, CAR_LOCALNAME, CAR_QNAME, CAR_TYPE, CAR_VALUE);
         attr.addAttribute(JEEP_URI, JEEP_LOCALNAME, JEEP_QNAME, JEEP_TYPE,
                 JEEP_VALUE);
-        assertEquals(attr.getValue(1), JEEP_VALUE);
-        assertEquals(attr.getValue(attr.getQName(1)), JEEP_VALUE);
-        assertEquals(attr.getValue(attr.getURI(1), attr.getLocalName(1)), JEEP_VALUE);
+        assertEquals(JEEP_VALUE, attr.getValue(1));
+        assertEquals(JEEP_VALUE, attr.getValue(attr.getQName(1)));
+        assertEquals(JEEP_VALUE, attr.getValue(attr.getURI(1), attr.getLocalName(1)));
     }
 
     /**
@@ -129,11 +130,11 @@ public class AttrImplTest {
         attr.addAttribute(JEEP_URI, JEEP_LOCALNAME, JEEP_QNAME, JEEP_TYPE,
                 JEEP_VALUE);
         attr.setAttribute(1, "www.megginson.com", "author", "meg", "s", "SAX2");
-        assertEquals(attr.getLocalName(1), "author");
-        assertEquals(attr.getQName(1), "meg");
-        assertEquals(attr.getType(1), "s");
-        assertEquals(attr.getType("meg"), "s");
-        assertEquals(attr.getURI(1), "www.megginson.com");
+        assertEquals("author", attr.getLocalName(1));
+        assertEquals("meg", attr.getQName(1));
+        assertEquals("s", attr.getType(1));
+        assertEquals("s", attr.getType("meg"));
+        assertEquals("www.megginson.com", attr.getURI(1));
     }
 
     /**
@@ -152,11 +153,11 @@ public class AttrImplTest {
         attr.setValue(1, "SAX01");
         attr.setURI(1, "www.megginson.com/sax/sax01");
 
-        assertEquals(attr.getLocalName(1), "speclead");
-        assertEquals(attr.getQName(1), "megi");
-        assertEquals(attr.getType(1), "sax");
-        assertEquals(attr.getType("megi"), "sax");
-        assertEquals(attr.getURI(1), "www.megginson.com/sax/sax01");
+        assertEquals("speclead", attr.getLocalName(1));
+        assertEquals("megi", attr.getQName(1));
+        assertEquals("sax", attr.getType(1));
+        assertEquals("sax", attr.getType("megi"));
+        assertEquals("www.megginson.com/sax/sax01", attr.getURI(1));
     }
 
     /**
@@ -165,11 +166,11 @@ public class AttrImplTest {
     @Test
     public void testcase08() {
         AttributesImpl attr = new AttributesImpl();
-        assertEquals(attr.getLength(), 0);
+        assertEquals(0, attr.getLength());
         attr.addAttribute(CAR_URI, CAR_LOCALNAME, CAR_QNAME, CAR_TYPE, CAR_VALUE);
         attr.addAttribute(JEEP_URI, JEEP_LOCALNAME, JEEP_QNAME, JEEP_TYPE,
                 JEEP_VALUE);
-        assertEquals(attr.getLength(), 2);
+        assertEquals(2, attr.getLength());
     }
 
     /**
@@ -189,13 +190,13 @@ public class AttrImplTest {
      * Javadoc says java.lang.ArrayIndexOutOfBoundsException is thrown When the
      * supplied index does not point to an attribute in the list.
      */
-    @Test(expectedExceptions = ArrayIndexOutOfBoundsException.class)
+    @Test
     public void testcase10() {
         AttributesImpl attr = new AttributesImpl();
         attr.addAttribute(CAR_URI, CAR_LOCALNAME, CAR_QNAME, CAR_TYPE, CAR_VALUE);
         attr.addAttribute(JEEP_URI, JEEP_LOCALNAME, JEEP_QNAME, JEEP_TYPE,
                 JEEP_VALUE);
         attr.removeAttribute(1);
-        attr.removeAttribute(1);
+        assertThrows(ArrayIndexOutOfBoundsException.class, () -> attr.removeAttribute(1));
     }
 }
diff --git a/test/jaxp/javax/xml/jaxp/functional/org/xml/sax/ptests/AttributesNSTest.java b/test/jaxp/javax/xml/jaxp/functional/org/xml/sax/ptests/AttributesNSTest.java
index 5e7db17c746..687ea92c9c9 100644
--- a/test/jaxp/javax/xml/jaxp/functional/org/xml/sax/ptests/AttributesNSTest.java
+++ b/test/jaxp/javax/xml/jaxp/functional/org/xml/sax/ptests/AttributesNSTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -22,18 +22,17 @@
  */
 package org.xml.sax.ptests;
 
-import static jaxp.library.JAXPTestUtilities.USER_DIR;
-import static jaxp.library.JAXPTestUtilities.compareWithGold;
-import static org.testng.Assert.assertTrue;
-import static org.xml.sax.ptests.SAXTestConst.GOLDEN_DIR;
-import static org.xml.sax.ptests.SAXTestConst.XML_DIR;
-
-import java.io.File;
+import org.junit.jupiter.api.Test;
 
 import javax.xml.parsers.SAXParser;
 import javax.xml.parsers.SAXParserFactory;
+import java.io.File;
+import java.nio.file.Files;
+import java.nio.file.Path;
 
-import org.testng.annotations.Test;
+import static org.junit.jupiter.api.Assertions.assertLinesMatch;
+import static org.xml.sax.ptests.SAXTestConst.GOLDEN_DIR;
+import static org.xml.sax.ptests.SAXTestConst.XML_DIR;
 
 /**
  * This tests the Attributes interface. Here the startElement() callback of
@@ -45,7 +44,7 @@ import org.testng.annotations.Test;
 /*
  * @test
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm org.xml.sax.ptests.AttributesNSTest
+ * @run junit/othervm org.xml.sax.ptests.AttributesNSTest
  */
 public class AttributesNSTest {
     /**
@@ -55,7 +54,7 @@ public class AttributesNSTest {
      */
     @Test
     public void testcase01() throws Exception {
-        String outputFile = USER_DIR + "AttributesNS.out";
+        String outputFile = "AttributesNS.out";
         String goldFile = GOLDEN_DIR + "AttributesNSGF.out";
         String xmlFile = XML_DIR + "namespace1.xml";
         SAXParserFactory spf = SAXParserFactory.newInstance();
@@ -68,6 +67,8 @@ public class AttributesNSTest {
         MyAttrCHandler myAttrCHandler = new MyAttrCHandler(outputFile);
         saxParser.parse(new File(xmlFile), myAttrCHandler);
         myAttrCHandler.flushAndClose();
-        assertTrue(compareWithGold(goldFile, outputFile));
+        assertLinesMatch(
+                Files.readAllLines(Path.of(goldFile)),
+                Files.readAllLines(Path.of(outputFile)));
     }
 }
diff --git a/test/jaxp/javax/xml/jaxp/functional/org/xml/sax/ptests/AttributesTest.java b/test/jaxp/javax/xml/jaxp/functional/org/xml/sax/ptests/AttributesTest.java
index 6ebdf070060..e37d0b93e5d 100644
--- a/test/jaxp/javax/xml/jaxp/functional/org/xml/sax/ptests/AttributesTest.java
+++ b/test/jaxp/javax/xml/jaxp/functional/org/xml/sax/ptests/AttributesTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -22,18 +22,17 @@
  */
 package org.xml.sax.ptests;
 
-import static jaxp.library.JAXPTestUtilities.USER_DIR;
-import static jaxp.library.JAXPTestUtilities.compareWithGold;
-import static org.testng.Assert.assertTrue;
-import static org.xml.sax.ptests.SAXTestConst.GOLDEN_DIR;
-import static org.xml.sax.ptests.SAXTestConst.XML_DIR;
-
-import java.io.File;
+import org.junit.jupiter.api.Test;
 
 import javax.xml.parsers.SAXParser;
 import javax.xml.parsers.SAXParserFactory;
+import java.io.File;
+import java.nio.file.Files;
+import java.nio.file.Path;
 
-import org.testng.annotations.Test;
+import static org.junit.jupiter.api.Assertions.assertLinesMatch;
+import static org.xml.sax.ptests.SAXTestConst.GOLDEN_DIR;
+import static org.xml.sax.ptests.SAXTestConst.XML_DIR;
 
 /**
  * This tests the Attributes interface. Here the startElement() callback of
@@ -46,7 +45,7 @@ import org.testng.annotations.Test;
 /*
  * @test
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm org.xml.sax.ptests.AttributesTest
+ * @run junit/othervm org.xml.sax.ptests.AttributesTest
  */
 public class AttributesTest {
     /**
@@ -57,7 +56,7 @@ public class AttributesTest {
      */
     @Test
     public void testcase01() throws Exception {
-        String outputFile = USER_DIR + "Attributes.out";
+        String outputFile = "Attributes.out";
         String goldFile = GOLDEN_DIR + "AttributesGF.out";
         String xmlFile = XML_DIR + "family.xml";
 
@@ -70,6 +69,8 @@ public class AttributesTest {
         MyAttrCHandler myAttrCHandler = new MyAttrCHandler(outputFile);
         saxParser.parse(new File(xmlFile), myAttrCHandler);
         myAttrCHandler.flushAndClose();
-        assertTrue(compareWithGold(goldFile, outputFile));
+        assertLinesMatch(
+                Files.readAllLines(Path.of(goldFile)),
+                Files.readAllLines(Path.of(outputFile)));
     }
 }
diff --git a/test/jaxp/javax/xml/jaxp/functional/org/xml/sax/ptests/ContentHandlerTest.java b/test/jaxp/javax/xml/jaxp/functional/org/xml/sax/ptests/ContentHandlerTest.java
index b450caba7aa..0c06cd27b7e 100644
--- a/test/jaxp/javax/xml/jaxp/functional/org/xml/sax/ptests/ContentHandlerTest.java
+++ b/test/jaxp/javax/xml/jaxp/functional/org/xml/sax/ptests/ContentHandlerTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -22,20 +22,7 @@
  */
 package org.xml.sax.ptests;
 
-import static jaxp.library.JAXPTestUtilities.USER_DIR;
-import static jaxp.library.JAXPTestUtilities.compareWithGold;
-import static org.testng.Assert.assertTrue;
-import static org.xml.sax.ptests.SAXTestConst.GOLDEN_DIR;
-import static org.xml.sax.ptests.SAXTestConst.XML_DIR;
-
-import java.io.BufferedWriter;
-import java.io.FileInputStream;
-import java.io.FileWriter;
-import java.io.IOException;
-
-import javax.xml.parsers.SAXParserFactory;
-
-import org.testng.annotations.Test;
+import org.junit.jupiter.api.Test;
 import org.xml.sax.Attributes;
 import org.xml.sax.InputSource;
 import org.xml.sax.Locator;
@@ -43,6 +30,18 @@ import org.xml.sax.SAXException;
 import org.xml.sax.XMLReader;
 import org.xml.sax.helpers.XMLFilterImpl;
 
+import javax.xml.parsers.SAXParserFactory;
+import java.io.BufferedWriter;
+import java.io.FileInputStream;
+import java.io.FileWriter;
+import java.io.IOException;
+import java.nio.file.Files;
+import java.nio.file.Path;
+
+import static org.junit.jupiter.api.Assertions.assertLinesMatch;
+import static org.xml.sax.ptests.SAXTestConst.GOLDEN_DIR;
+import static org.xml.sax.ptests.SAXTestConst.XML_DIR;
+
 /**
  * Class registers a content event handler to XMLReader. Content event handler
  * transverses XML and print all visited node  when XMLreader parses XML. Test
@@ -51,7 +50,7 @@ import org.xml.sax.helpers.XMLFilterImpl;
 /*
  * @test
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm org.xml.sax.ptests.ContentHandlerTest
+ * @run junit/othervm org.xml.sax.ptests.ContentHandlerTest
  */
 public class ContentHandlerTest {
     /**
@@ -61,7 +60,7 @@ public class ContentHandlerTest {
      */
     @Test
     public void testcase01() throws Exception {
-        String outputFile = USER_DIR + "Content.out";
+        String outputFile = "Content.out";
         String goldFile = GOLDEN_DIR + "ContentGF.out";
         String xmlFile = XML_DIR + "namespace1.xml";
 
@@ -73,7 +72,9 @@ public class ContentHandlerTest {
             xmlReader.setContentHandler(cHandler);
             xmlReader.parse(new InputSource(instream));
         }
-        assertTrue(compareWithGold(goldFile, outputFile));
+        assertLinesMatch(
+                Files.readAllLines(Path.of(goldFile)),
+                Files.readAllLines(Path.of(outputFile)));
     }
 }
 
@@ -112,7 +113,6 @@ class MyContentHandler extends XMLFilterImpl implements AutoCloseable {
     /**
      * Write characters tag along with content of characters when meet
      * characters event.
-     * @throws IOException error happen when writing file.
      */
     @Override
     public void characters(char[] ch, int start, int length) throws SAXException {
@@ -123,7 +123,6 @@ class MyContentHandler extends XMLFilterImpl implements AutoCloseable {
     /**
      * Write endDocument tag then flush the content and close the file when meet
      * endDocument event.
-     * @throws IOException error happen when writing file or closing file.
      */
     @Override
     public void endDocument() throws SAXException {
@@ -139,7 +138,6 @@ class MyContentHandler extends XMLFilterImpl implements AutoCloseable {
     /**
      * Write endElement tag with namespaceURI, localName, qName to the file when
      * meet endElement event.
-     * @throws IOException error happen when writing file.
      */
     @Override
     public void endElement(String namespaceURI,String localName,String qName) throws SAXException{
@@ -150,7 +148,6 @@ class MyContentHandler extends XMLFilterImpl implements AutoCloseable {
     /**
      * Write endPrefixMapping tag along with prefix to the file when meet
      * endPrefixMapping event.
-     * @throws IOException error happen when writing file.
      */
     @Override
     public void endPrefixMapping(String prefix) throws SAXException {
@@ -160,7 +157,6 @@ class MyContentHandler extends XMLFilterImpl implements AutoCloseable {
     /**
      * Write ignorableWhitespace tag along with white spaces when meet
      * ignorableWhitespace event.
-     * @throws IOException error happen when writing file.
      */
     @Override
     public void ignorableWhitespace(char[] ch, int start, int length) throws SAXException {
@@ -172,7 +168,6 @@ class MyContentHandler extends XMLFilterImpl implements AutoCloseable {
     /**
      * Write processingInstruction tag along with target name and target data
      * when meet processingInstruction event.
-     * @throws IOException error happen when writing file.
      */
     @Override
     public void processingInstruction(String target, String data) throws SAXException {
@@ -196,7 +191,6 @@ class MyContentHandler extends XMLFilterImpl implements AutoCloseable {
     /**
      * Write skippedEntity tag along with entity name when meet skippedEntity
      * event.
-     * @throws IOException error happen when writing file.
      */
     @Override
     public void skippedEntity(String name) throws SAXException {
@@ -205,7 +199,6 @@ class MyContentHandler extends XMLFilterImpl implements AutoCloseable {
 
     /**
      * Write startDocument tag when meet startDocument event.
-     * @throws IOException error happen when writing file.
      */
     @Override
     public void startDocument() throws SAXException {
@@ -215,7 +208,6 @@ class MyContentHandler extends XMLFilterImpl implements AutoCloseable {
     /**
      * Write startElement tag along with namespaceURI, localName, qName, number
      * of attributes and line number when meet startElement event.
-     * @throws IOException error happen when writing file.
      */
     @Override
     public void startElement(String namespaceURI, String localName,
@@ -229,7 +221,6 @@ class MyContentHandler extends XMLFilterImpl implements AutoCloseable {
     /**
      * Write startPrefixMapping tag along with prefix and uri when meet
      * startPrefixMapping event.
-     * @throws IOException error happen when writing file.
      */
     @Override
     public void startPrefixMapping(String prefix, String uri) throws SAXException {
diff --git a/test/jaxp/javax/xml/jaxp/functional/org/xml/sax/ptests/DefaultHandlerTest.java b/test/jaxp/javax/xml/jaxp/functional/org/xml/sax/ptests/DefaultHandlerTest.java
index f65a290cb2c..548cb6b4e43 100644
--- a/test/jaxp/javax/xml/jaxp/functional/org/xml/sax/ptests/DefaultHandlerTest.java
+++ b/test/jaxp/javax/xml/jaxp/functional/org/xml/sax/ptests/DefaultHandlerTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -22,27 +22,26 @@
  */
 package org.xml.sax.ptests;
 
-import static jaxp.library.JAXPTestUtilities.USER_DIR;
-import static jaxp.library.JAXPTestUtilities.compareWithGold;
-import static org.testng.Assert.assertTrue;
-import static org.xml.sax.ptests.SAXTestConst.GOLDEN_DIR;
-import static org.xml.sax.ptests.SAXTestConst.XML_DIR;
-
-import java.io.BufferedWriter;
-import java.io.File;
-import java.io.FileWriter;
-import java.io.IOException;
-
-import javax.xml.parsers.SAXParser;
-import javax.xml.parsers.SAXParserFactory;
-
-import org.testng.annotations.Test;
+import org.junit.jupiter.api.Test;
 import org.xml.sax.Attributes;
 import org.xml.sax.Locator;
 import org.xml.sax.SAXException;
 import org.xml.sax.SAXParseException;
 import org.xml.sax.helpers.DefaultHandler;
 
+import javax.xml.parsers.SAXParser;
+import javax.xml.parsers.SAXParserFactory;
+import java.io.BufferedWriter;
+import java.io.File;
+import java.io.FileWriter;
+import java.io.IOException;
+import java.nio.file.Files;
+import java.nio.file.Path;
+
+import static org.junit.jupiter.api.Assertions.assertLinesMatch;
+import static org.xml.sax.ptests.SAXTestConst.GOLDEN_DIR;
+import static org.xml.sax.ptests.SAXTestConst.XML_DIR;
+
 /**
  * XMLReader parse XML with default handler that transverses XML and
  * print all visited node. Test verifies output is same as the golden file.
@@ -50,7 +49,7 @@ import org.xml.sax.helpers.DefaultHandler;
 /*
  * @test
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm org.xml.sax.ptests.DefaultHandlerTest
+ * @run junit/othervm org.xml.sax.ptests.DefaultHandlerTest
  */
 public class DefaultHandlerTest {
     /**
@@ -60,7 +59,7 @@ public class DefaultHandlerTest {
      */
     @Test
     public void testDefaultHandler() throws Exception {
-        String outputFile = USER_DIR + "DefaultHandler.out";
+        String outputFile = "DefaultHandler.out";
         String goldFile = GOLDEN_DIR + "DefaultHandlerGF.out";
         String xmlFile = XML_DIR + "namespace1.xml";
 
@@ -75,9 +74,9 @@ public class DefaultHandlerTest {
         if (File.separatorChar == '\\')
                 newAbsolutePath = Absolutepath.replace('\\', '/');
         saxparser.parse("file:///" + newAbsolutePath, handler);
-
-        assertTrue(compareWithGold(goldFile, outputFile));
-
+        assertLinesMatch(
+                Files.readAllLines(Path.of(goldFile)),
+                Files.readAllLines(Path.of(outputFile)));
     }
 }
 
@@ -108,7 +107,6 @@ class MyDefaultHandler extends DefaultHandler {
     /**
      * Write characters tag along with content of characters when meet
      * characters event.
-     * @throws IOException error happen when writing file.
      */
     @Override
     public void characters(char[] ch, int start, int length) throws SAXException {
@@ -118,7 +116,6 @@ class MyDefaultHandler extends DefaultHandler {
     /**
      * Write endDocument tag then flush the content and close the file when meet
      * endDocument event.
-     * @throws IOException error happen when writing file or closing file.
      */
     @Override
     public void endDocument() throws SAXException {
@@ -134,7 +131,6 @@ class MyDefaultHandler extends DefaultHandler {
     /**
      * Write endElement tag with namespaceURI, localName, qName to the file when
      * meet endElement event.
-     * @throws IOException error happen when writing file.
      */
     @Override
     public void endElement(String namespaceURI,String localName,String qName) throws SAXException{
@@ -145,7 +141,6 @@ class MyDefaultHandler extends DefaultHandler {
     /**
      * Write endPrefixMapping tag along with prefix to the file when meet
      * endPrefixMapping event.
-     * @throws IOException error happen when writing file.
      */
     @Override
     public void endPrefixMapping(String prefix) throws SAXException {
@@ -155,7 +150,6 @@ class MyDefaultHandler extends DefaultHandler {
     /**
      * Write error tag along with exception to the file when meet recoverable
      * error event.
-     * @throws IOException error happen when writing file.
      */
     @Override
     public void error(SAXParseException e) throws SAXException {
@@ -165,7 +159,6 @@ class MyDefaultHandler extends DefaultHandler {
     /**
      * Write fatalError tag along with exception to the file when meet
      * unrecoverable error event.
-     * @throws IOException error happen when writing file.
      */
     @Override
     public void fatalError(SAXParseException e) throws SAXException {
@@ -174,7 +167,6 @@ class MyDefaultHandler extends DefaultHandler {
 
     /**
      * Write warning tag along with exception to the file when meet warning event.
-     * @throws IOException error happen when writing file.
      */
     @Override
     public void warning(SAXParseException e) throws SAXException {
@@ -184,7 +176,6 @@ class MyDefaultHandler extends DefaultHandler {
     /**
      * Write ignorableWhitespace tag along with white spaces when meet
      * ignorableWhitespace event.
-     * @throws IOException error happen when writing file.
      */
     @Override
     public void ignorableWhitespace(char[] ch, int start, int length) throws SAXException {
@@ -196,7 +187,6 @@ class MyDefaultHandler extends DefaultHandler {
     /**
      * Write processingInstruction tag along with target name and target data
      * when meet processingInstruction event.
-     * @throws IOException error happen when writing file.
      */
     @Override
     public void processingInstruction(String target, String data) throws SAXException {
@@ -216,7 +206,6 @@ class MyDefaultHandler extends DefaultHandler {
     /**
      * Write skippedEntity tag along with entity name when meet skippedEntity
      * event.
-     * @throws IOException error happen when writing file.
      */
     @Override
     public void skippedEntity(String name) throws SAXException {
@@ -225,7 +214,6 @@ class MyDefaultHandler extends DefaultHandler {
 
     /**
      * Write startDocument tag when meet startDocument event.
-     * @throws IOException error happen when writing file.
      */
     @Override
     public void startDocument() throws SAXException {
@@ -235,7 +223,6 @@ class MyDefaultHandler extends DefaultHandler {
     /**
      * Write startElement tag along with namespaceURI, localName, qName, number
      * of attributes and line number when meet startElement event.
-     * @throws IOException error happen when writing file.
      */
     @Override
     public void startElement(String namespaceURI, String localName,
@@ -248,7 +235,6 @@ class MyDefaultHandler extends DefaultHandler {
     /**
      * Write startPrefixMapping tag along with prefix and uri when meet
      * startPrefixMapping event.
-     * @throws IOException error happen when writing file.
      */
     @Override
     public void startPrefixMapping(String prefix, String uri) throws SAXException {
diff --git a/test/jaxp/javax/xml/jaxp/functional/org/xml/sax/ptests/EHFatalTest.java b/test/jaxp/javax/xml/jaxp/functional/org/xml/sax/ptests/EHFatalTest.java
index 507e9d28384..578ca881e48 100644
--- a/test/jaxp/javax/xml/jaxp/functional/org/xml/sax/ptests/EHFatalTest.java
+++ b/test/jaxp/javax/xml/jaxp/functional/org/xml/sax/ptests/EHFatalTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -22,28 +22,27 @@
  */
 package org.xml.sax.ptests;
 
-import static jaxp.library.JAXPTestUtilities.USER_DIR;
-import static jaxp.library.JAXPTestUtilities.compareWithGold;
-import static org.testng.Assert.assertTrue;
-import static org.testng.Assert.fail;
-import static org.xml.sax.ptests.SAXTestConst.GOLDEN_DIR;
-import static org.xml.sax.ptests.SAXTestConst.XML_DIR;
-
-import java.io.BufferedWriter;
-import java.io.FileInputStream;
-import java.io.FileWriter;
-import java.io.IOException;
-
-import javax.xml.parsers.SAXParser;
-import javax.xml.parsers.SAXParserFactory;
-
-import org.testng.annotations.Test;
+import org.junit.jupiter.api.Test;
 import org.xml.sax.InputSource;
 import org.xml.sax.SAXException;
 import org.xml.sax.SAXParseException;
 import org.xml.sax.XMLReader;
 import org.xml.sax.helpers.XMLFilterImpl;
 
+import javax.xml.parsers.SAXParser;
+import javax.xml.parsers.SAXParserFactory;
+import java.io.BufferedWriter;
+import java.io.FileInputStream;
+import java.io.FileWriter;
+import java.io.IOException;
+import java.nio.file.Files;
+import java.nio.file.Path;
+
+import static org.junit.jupiter.api.Assertions.assertLinesMatch;
+import static org.junit.jupiter.api.Assertions.assertThrows;
+import static org.xml.sax.ptests.SAXTestConst.GOLDEN_DIR;
+import static org.xml.sax.ptests.SAXTestConst.XML_DIR;
+
 /**
  * ErrorHandler unit test. Set a ErrorHandle to XMLReader. Capture fatal error
  * events in ErrorHandler.
@@ -51,34 +50,31 @@ import org.xml.sax.helpers.XMLFilterImpl;
 /*
  * @test
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm org.xml.sax.ptests.EHFatalTest
+ * @run junit/othervm org.xml.sax.ptests.EHFatalTest
  */
 public class EHFatalTest {
     /**
      * Error Handler to capture all error events to output file. Verifies the
      * output file is same as golden file.
-     *
-     * @throws Exception If any errors occur.
      */
     @Test
     public void testEHFatal() throws Exception {
-        String outputFile = USER_DIR + "EHFatal.out";
+        String outputFile = "EHFatal.out";
         String goldFile = GOLDEN_DIR + "EHFatalGF.out";
         String xmlFile = XML_DIR + "invalid.xml";
 
-        try(MyErrorHandler eHandler = new MyErrorHandler(outputFile);
-                FileInputStream instream = new FileInputStream(xmlFile)) {
-            SAXParser saxParser = SAXParserFactory.newInstance().newSAXParser();
-            XMLReader xmlReader = saxParser.getXMLReader();
+        SAXParser saxParser = SAXParserFactory.newInstance().newSAXParser();
+        XMLReader xmlReader = saxParser.getXMLReader();
+        try (MyErrorHandler eHandler = new MyErrorHandler(outputFile);
+             FileInputStream instream = new FileInputStream(xmlFile)) {
             xmlReader.setErrorHandler(eHandler);
             InputSource is = new InputSource(instream);
-            xmlReader.parse(is);
-            fail("Parse should throw SAXException");
-        } catch (SAXException expected) {
-            // This is expected.
+            assertThrows(SAXException.class, () -> xmlReader.parse(is));
         }
         // Need close the output file before we compare it with golden file.
-        assertTrue(compareWithGold(goldFile, outputFile));
+        assertLinesMatch(
+                Files.readAllLines(Path.of(goldFile)),
+                Files.readAllLines(Path.of(outputFile)));
     }
 }
 
@@ -109,7 +105,6 @@ class MyErrorHandler extends XMLFilterImpl implements AutoCloseable {
     /**
      * Write fatalError tag along with exception to the file when meet
      * unrecoverable error event.
-     * @throws IOException error happen when writing file.
      */
     @Override
     public void fatalError(SAXParseException e) throws SAXException {
diff --git a/test/jaxp/javax/xml/jaxp/functional/org/xml/sax/ptests/NSSupportTest.java b/test/jaxp/javax/xml/jaxp/functional/org/xml/sax/ptests/NSSupportTest.java
index 4ee4bf510a8..988bc3c92c9 100644
--- a/test/jaxp/javax/xml/jaxp/functional/org/xml/sax/ptests/NSSupportTest.java
+++ b/test/jaxp/javax/xml/jaxp/functional/org/xml/sax/ptests/NSSupportTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -22,13 +22,14 @@
  */
 package org.xml.sax.ptests;
 
-import static org.testng.Assert.assertEquals;
-import static org.testng.Assert.assertNull;
+import org.junit.jupiter.api.Test;
+import org.xml.sax.helpers.NamespaceSupport;
 
 import java.util.Enumeration;
 
-import org.testng.annotations.Test;
-import org.xml.sax.helpers.NamespaceSupport;
+import static org.junit.jupiter.api.Assertions.assertArrayEquals;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertNull;
 
 /**
  * Unit test cases for NamespaceSupport API
@@ -36,7 +37,7 @@ import org.xml.sax.helpers.NamespaceSupport;
 /*
  * @test
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm org.xml.sax.ptests.NSSupportTest
+ * @run junit/othervm org.xml.sax.ptests.NSSupportTest
  */
 public class NSSupportTest {
     /**
@@ -70,14 +71,14 @@ public class NSSupportTest {
         support.declarePrefix(EMPTY_PREFIX, W3_URI);
         support.declarePrefix(DC_PREFIX, PURL_URI);
 
-        Enumeration e = support.getDeclaredPrefixes();
+        Enumeration<String> e = support.getDeclaredPrefixes();
         int i = 0;
-        while(e.hasMoreElements()) {
-            prefixes[i++] = e.nextElement().toString();
+        while (e.hasMoreElements()) {
+            prefixes[i++] = e.nextElement();
         }
         support.popContext();
 
-        assertEquals(prefixes, new String[]{EMPTY_PREFIX, DC_PREFIX});
+        assertArrayEquals(new String[] { EMPTY_PREFIX, DC_PREFIX }, prefixes);
     }
 
     /**
@@ -92,7 +93,7 @@ public class NSSupportTest {
         support.declarePrefix(DC_PREFIX, PURL_URI);
         parts = support.processName("dc:title", parts, false);
         support.popContext();
-        assertEquals(parts, new String[]{PURL_URI, "title", "dc:title"});
+        assertArrayEquals(new String[] { PURL_URI, "title", "dc:title" }, parts);
     }
 
     /**
@@ -106,7 +107,7 @@ public class NSSupportTest {
         support.declarePrefix(EMPTY_PREFIX, W3_URI);
         parts = support.processName("a", parts, false);
         support.popContext();
-        assertEquals(parts, new String[]{W3_URI, "a", "a"});
+        assertArrayEquals(new String[] { W3_URI, "a", "a" }, parts);
     }
 
 
@@ -121,8 +122,8 @@ public class NSSupportTest {
         support.declarePrefix(EMPTY_PREFIX, W3_URI);
         support.declarePrefix(DC_PREFIX, PURL_URI);
 
-        assertEquals(support.getURI(EMPTY_PREFIX), W3_URI);
-        assertEquals(support.getURI(DC_PREFIX), PURL_URI);
+        assertEquals(W3_URI, support.getURI(EMPTY_PREFIX));
+        assertEquals(PURL_URI, support.getURI(DC_PREFIX));
         support.popContext();
         assertNull(support.getURI(EMPTY_PREFIX));
         assertNull(support.getURI(DC_PREFIX));
diff --git a/test/jaxp/javax/xml/jaxp/functional/org/xml/sax/ptests/NSTableTest.java b/test/jaxp/javax/xml/jaxp/functional/org/xml/sax/ptests/NSTableTest.java
index 81da8f25b88..eda3dc89fed 100644
--- a/test/jaxp/javax/xml/jaxp/functional/org/xml/sax/ptests/NSTableTest.java
+++ b/test/jaxp/javax/xml/jaxp/functional/org/xml/sax/ptests/NSTableTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -22,14 +22,14 @@
  */
 package org.xml.sax.ptests;
 
-import static org.testng.Assert.assertFalse;
-import static org.testng.Assert.assertTrue;
+import org.junit.jupiter.api.Test;
+import org.xml.sax.XMLReader;
 
 import javax.xml.parsers.SAXParser;
 import javax.xml.parsers.SAXParserFactory;
 
-import org.testng.annotations.Test;
-import org.xml.sax.XMLReader;
+import static org.junit.jupiter.api.Assertions.assertFalse;
+import static org.junit.jupiter.api.Assertions.assertTrue;
 
 /**
  * Class containing the test cases for Namespace Table defined at
@@ -38,7 +38,7 @@ import org.xml.sax.XMLReader;
 /*
  * @test
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm org.xml.sax.ptests.NSTableTest
+ * @run junit/othervm org.xml.sax.ptests.NSTableTest
  */
 public class NSTableTest {
     private static final String NAMESPACES =
diff --git a/test/jaxp/javax/xml/jaxp/functional/org/xml/sax/ptests/ParserAdapterTest.java b/test/jaxp/javax/xml/jaxp/functional/org/xml/sax/ptests/ParserAdapterTest.java
index b4a59180bac..4aaefefaa31 100644
--- a/test/jaxp/javax/xml/jaxp/functional/org/xml/sax/ptests/ParserAdapterTest.java
+++ b/test/jaxp/javax/xml/jaxp/functional/org/xml/sax/ptests/ParserAdapterTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -22,16 +22,7 @@
  */
 package org.xml.sax.ptests;
 
-import static org.testng.Assert.assertFalse;
-import static org.testng.Assert.assertNotNull;
-import static org.testng.Assert.assertTrue;
-import static org.xml.sax.ptests.SAXTestConst.XML_DIR;
-
-import java.io.FileInputStream;
-
-import javax.xml.parsers.SAXParserFactory;
-
-import org.testng.annotations.Test;
+import org.junit.jupiter.api.Test;
 import org.xml.sax.ContentHandler;
 import org.xml.sax.InputSource;
 import org.xml.sax.SAXException;
@@ -41,6 +32,15 @@ import org.xml.sax.helpers.ParserAdapter;
 import org.xml.sax.helpers.XMLFilterImpl;
 import org.xml.sax.helpers.XMLReaderAdapter;
 
+import javax.xml.parsers.SAXParserFactory;
+import java.io.FileInputStream;
+
+import static org.junit.jupiter.api.Assertions.assertFalse;
+import static org.junit.jupiter.api.Assertions.assertNotNull;
+import static org.junit.jupiter.api.Assertions.assertThrows;
+import static org.junit.jupiter.api.Assertions.assertTrue;
+import static org.xml.sax.ptests.SAXTestConst.XML_DIR;
+
 
 /**
  * Unit test cases for ParserAdapter API. By default the only features recognized
@@ -49,7 +49,7 @@ import org.xml.sax.helpers.XMLReaderAdapter;
 /*
  * @test
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm org.xml.sax.ptests.ParserAdapterTest
+ * @run junit/othervm org.xml.sax.ptests.ParserAdapterTest
  */
 public class ParserAdapterTest {
     /**
@@ -177,9 +177,9 @@ public class ParserAdapterTest {
      *
      * @exception Exception If any errors occur.
      */
-    @Test(expectedExceptions = SAXNotRecognizedException.class)
+    @Test
     public void getFeature03() throws Exception {
-        parserAdapter.getFeature("no-meaning-feature");
+        assertThrows(SAXNotRecognizedException.class, () -> parserAdapter.getFeature("no-meaning-feature"));
     }
 
     /**
@@ -228,31 +228,25 @@ public class ParserAdapterTest {
 
     /**
      * NPE expected when parsing a null object by ParserAdapter.
-     *
-     * @throws Exception If any errors occur.
      */
-    @Test(expectedExceptions = NullPointerException.class)
+    @Test
     public void parse01() throws Exception {
-        parserAdapter.parse((InputSource)null);
+        assertThrows(NullPointerException.class, () -> parserAdapter.parse((InputSource) null));
     }
 
     /**
      * SAXException expected when parsing a wrong-formatter XML with ParserAdapter.
-     *
-     * @throws Exception If any errors occur.
      */
-    @Test(expectedExceptions = SAXException.class)
+    @Test
     public void parse02() throws Exception {
         try(FileInputStream fis = new FileInputStream(XML_DIR + "invalid.xml")) {
             InputSource is = new InputSource(fis);
-            parserAdapter.parse(is);
+            assertThrows(SAXException.class, () -> parserAdapter.parse(is));
         }
     }
 
     /**
      * Parse a well-formatter XML with ParserAdapter.
-     *
-     * @throws Exception If any errors occur.
      */
     @Test
     public void parse03() throws Exception {
diff --git a/test/jaxp/javax/xml/jaxp/functional/org/xml/sax/ptests/ResolverTest.java b/test/jaxp/javax/xml/jaxp/functional/org/xml/sax/ptests/ResolverTest.java
index a7463edb53c..483e8b87c1d 100644
--- a/test/jaxp/javax/xml/jaxp/functional/org/xml/sax/ptests/ResolverTest.java
+++ b/test/jaxp/javax/xml/jaxp/functional/org/xml/sax/ptests/ResolverTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -22,13 +22,14 @@
  */
 package org.xml.sax.ptests;
 
-import static java.nio.file.StandardCopyOption.REPLACE_EXISTING;
-import static jaxp.library.JAXPTestUtilities.USER_DIR;
-import static jaxp.library.JAXPTestUtilities.compareWithGold;
-import static org.testng.Assert.assertTrue;
-import static org.xml.sax.ptests.SAXTestConst.GOLDEN_DIR;
-import static org.xml.sax.ptests.SAXTestConst.XML_DIR;
+import org.junit.jupiter.api.Test;
+import org.xml.sax.InputSource;
+import org.xml.sax.SAXException;
+import org.xml.sax.XMLReader;
+import org.xml.sax.helpers.XMLFilterImpl;
 
+import javax.xml.parsers.SAXParser;
+import javax.xml.parsers.SAXParserFactory;
 import java.io.BufferedWriter;
 import java.io.FileInputStream;
 import java.io.FileWriter;
@@ -36,16 +37,13 @@ import java.io.IOException;
 import java.net.URI;
 import java.net.URISyntaxException;
 import java.nio.file.Files;
+import java.nio.file.Path;
 import java.nio.file.Paths;
 
-import javax.xml.parsers.SAXParser;
-import javax.xml.parsers.SAXParserFactory;
-
-import org.testng.annotations.Test;
-import org.xml.sax.InputSource;
-import org.xml.sax.SAXException;
-import org.xml.sax.XMLReader;
-import org.xml.sax.helpers.XMLFilterImpl;
+import static java.nio.file.StandardCopyOption.REPLACE_EXISTING;
+import static org.junit.jupiter.api.Assertions.assertLinesMatch;
+import static org.xml.sax.ptests.SAXTestConst.GOLDEN_DIR;
+import static org.xml.sax.ptests.SAXTestConst.XML_DIR;
 
 /**
  * Entity resolver should be invoked in XML parse. This test verifies parsing
@@ -54,24 +52,22 @@ import org.xml.sax.helpers.XMLFilterImpl;
 /*
  * @test
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm org.xml.sax.ptests.ResolverTest
+ * @run junit/othervm org.xml.sax.ptests.ResolverTest
  */
-@Test
 public class ResolverTest {
     /**
      * Unit test for entityResolver setter.
-     *
-     * @throws Exception If any errors occur.
      */
+    @Test
     public void testResolver() throws Exception {
-        String outputFile = USER_DIR + "EntityResolver.out";
+        String outputFile = "EntityResolver.out";
         String goldFile = GOLDEN_DIR + "EntityResolverGF.out";
         String xmlFile = XML_DIR + "publish.xml";
 
         Files.copy(Paths.get(XML_DIR + "publishers.dtd"),
-                Paths.get(USER_DIR + "publishers.dtd"), REPLACE_EXISTING);
+                Paths.get("publishers.dtd"), REPLACE_EXISTING);
         Files.copy(Paths.get(XML_DIR + "familytree.dtd"),
-                Paths.get(USER_DIR + "familytree.dtd"), REPLACE_EXISTING);
+                Paths.get("familytree.dtd"), REPLACE_EXISTING);
 
         try(FileInputStream instream = new FileInputStream(xmlFile);
                 MyEntityResolver eResolver = new MyEntityResolver(outputFile)) {
@@ -81,7 +77,9 @@ public class ResolverTest {
             InputSource is = new InputSource(instream);
             xmlReader.parse(is);
         }
-        assertTrue(compareWithGold(goldFile, outputFile));
+        assertLinesMatch(
+                Files.readAllLines(Path.of(goldFile)),
+                Files.readAllLines(Path.of(outputFile)));
     }
 }
 
diff --git a/test/jaxp/javax/xml/jaxp/functional/org/xml/sax/ptests/XMLFilterCBTest.java b/test/jaxp/javax/xml/jaxp/functional/org/xml/sax/ptests/XMLFilterCBTest.java
index 4090b6b0733..377cd02ac7d 100644
--- a/test/jaxp/javax/xml/jaxp/functional/org/xml/sax/ptests/XMLFilterCBTest.java
+++ b/test/jaxp/javax/xml/jaxp/functional/org/xml/sax/ptests/XMLFilterCBTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -22,20 +22,7 @@
  */
 package org.xml.sax.ptests;
 
-import static jaxp.library.JAXPTestUtilities.USER_DIR;
-import static jaxp.library.JAXPTestUtilities.compareWithGold;
-import static org.testng.Assert.assertTrue;
-import static org.xml.sax.ptests.SAXTestConst.GOLDEN_DIR;
-import static org.xml.sax.ptests.SAXTestConst.XML_DIR;
-
-import java.io.BufferedWriter;
-import java.io.FileInputStream;
-import java.io.FileWriter;
-import java.io.IOException;
-
-import javax.xml.parsers.SAXParserFactory;
-
-import org.testng.annotations.Test;
+import org.junit.jupiter.api.Test;
 import org.xml.sax.Attributes;
 import org.xml.sax.InputSource;
 import org.xml.sax.Locator;
@@ -44,6 +31,18 @@ import org.xml.sax.SAXParseException;
 import org.xml.sax.XMLReader;
 import org.xml.sax.helpers.XMLFilterImpl;
 
+import javax.xml.parsers.SAXParserFactory;
+import java.io.BufferedWriter;
+import java.io.FileInputStream;
+import java.io.FileWriter;
+import java.io.IOException;
+import java.nio.file.Files;
+import java.nio.file.Path;
+
+import static org.junit.jupiter.api.Assertions.assertLinesMatch;
+import static org.xml.sax.ptests.SAXTestConst.GOLDEN_DIR;
+import static org.xml.sax.ptests.SAXTestConst.XML_DIR;
+
 /**
  * Set parent of XMLFilter to XMLReader. Parsing on XML file will invoke XMLFilter
  * to write to output file. Test verifies output is same as the golden file.
@@ -51,17 +50,15 @@ import org.xml.sax.helpers.XMLFilterImpl;
 /*
  * @test
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm org.xml.sax.ptests.XMLFilterCBTest
+ * @run junit/othervm org.xml.sax.ptests.XMLFilterCBTest
  */
-@Test
 public class XMLFilterCBTest {
     /**
      * Test XMLFilter working with XML reader.
-     *
-     * @throws Exception If any errors occur.
      */
+    @Test
     public void testXMLFilterCB() throws Exception {
-        String outputFile = USER_DIR + "XMLFilter.out";
+        String outputFile = "XMLFilter.out";
         String goldFile = GOLDEN_DIR + "XMLFilterGF.out";
         String xmlFile = XML_DIR + "namespace1.xml";
 
@@ -74,7 +71,9 @@ public class XMLFilterCBTest {
             myXmlFilter.parse(new InputSource(fis));
         }
         // Need close the output file before we compare it with golden file.
-        assertTrue(compareWithGold(goldFile, outputFile));
+        assertLinesMatch(
+                Files.readAllLines(Path.of(goldFile)),
+                Files.readAllLines(Path.of(outputFile)));
     }
 }
 
@@ -103,7 +102,6 @@ class MyXMLFilter extends XMLFilterImpl implements AutoCloseable {
     /**
      * Write characters tag along with content of characters when meet
      * characters event.
-     * @throws IOException error happen when writing file.
      */
     @Override
     public void characters(char[] ch, int start, int length) throws SAXException {
@@ -114,7 +112,6 @@ class MyXMLFilter extends XMLFilterImpl implements AutoCloseable {
     /**
      * Write endDocument tag then flush the content and close the file when meet
      * endDocument event.
-     * @throws IOException error happen when writing file or closing file.
      */
     @Override
     public void endDocument() throws SAXException {
@@ -130,7 +127,6 @@ class MyXMLFilter extends XMLFilterImpl implements AutoCloseable {
     /**
      * Write endElement tag with namespaceURI, localName, qName to the file when
      * meet endElement event.
-     * @throws IOException error happen when writing file.
      */
     @Override
     public void endElement(String namespaceURI,String localName,String qName)
@@ -142,7 +138,6 @@ class MyXMLFilter extends XMLFilterImpl implements AutoCloseable {
     /**
      * Write endPrefixMapping tag along with prefix to the file when meet
      * endPrefixMapping event.
-     * @throws IOException error happen when writing file.
      */
     @Override
     public void endPrefixMapping(String prefix) throws SAXException {
@@ -152,7 +147,6 @@ class MyXMLFilter extends XMLFilterImpl implements AutoCloseable {
     /**
      * Write error tag along with exception to the file when meet recoverable
      * error event.
-     * @throws IOException error happen when writing file.
      */
     @Override
     public void error(SAXParseException e) throws SAXException {
@@ -162,7 +156,6 @@ class MyXMLFilter extends XMLFilterImpl implements AutoCloseable {
     /**
      * Write fatalError tag along with exception to the file when meet
      * unrecoverable error event.
-     * @throws IOException error happen when writing file.
      */
     @Override
     public void fatalError(SAXParseException e) throws SAXException {
@@ -171,7 +164,6 @@ class MyXMLFilter extends XMLFilterImpl implements AutoCloseable {
 
     /**
      * Write warning tag along with exception to the file when meet warning event.
-     * @throws IOException error happen when writing file.
      */
     @Override
     public void warning(SAXParseException e) throws SAXException {
@@ -181,7 +173,6 @@ class MyXMLFilter extends XMLFilterImpl implements AutoCloseable {
     /**
      * Write ignorableWhitespace tag along with white spaces when meet
      * ignorableWhitespace event.
-     * @throws IOException error happen when writing file.
      */
     @Override
     public void ignorableWhitespace(char[] ch, int start, int length)
@@ -194,7 +185,6 @@ class MyXMLFilter extends XMLFilterImpl implements AutoCloseable {
     /**
      * Write processingInstruction tag along with target name and target data
      * when meet processingInstruction event.
-     * @throws IOException error happen when writing file.
      */
     @Override
     public void processingInstruction(String target, String data)
@@ -218,7 +208,6 @@ class MyXMLFilter extends XMLFilterImpl implements AutoCloseable {
     /**
      * Write skippedEntity tag along with entity name when meet skippedEntity
      * event.
-     * @throws IOException error happen when writing file.
      */
     @Override
     public void skippedEntity(String name) throws SAXException {
@@ -227,7 +216,6 @@ class MyXMLFilter extends XMLFilterImpl implements AutoCloseable {
 
     /**
      * Write startDocument tag when meet startDocument event.
-     * @throws IOException error happen when writing file.
      */
     @Override
     public void startDocument() throws SAXException {
@@ -237,7 +225,6 @@ class MyXMLFilter extends XMLFilterImpl implements AutoCloseable {
     /**
      * Write startElement tag along with namespaceURI, localName, qName, number
      * of attributes and line number when meet startElement event.
-     * @throws IOException error happen when writing file.
      */
     @Override
     public void startElement(String namespaceURI, String localName,
@@ -250,7 +237,6 @@ class MyXMLFilter extends XMLFilterImpl implements AutoCloseable {
     /**
      * Write startPrefixMapping tag along with prefix and uri when meet
      * startPrefixMapping event.
-     * @throws IOException error happen when writing file.
      */
     @Override
     public void startPrefixMapping(String prefix, String uri) throws SAXException {
diff --git a/test/jaxp/javax/xml/jaxp/functional/org/xml/sax/ptests/XMLFilterTest.java b/test/jaxp/javax/xml/jaxp/functional/org/xml/sax/ptests/XMLFilterTest.java
index 7ba882a9d1d..ee62b896b33 100644
--- a/test/jaxp/javax/xml/jaxp/functional/org/xml/sax/ptests/XMLFilterTest.java
+++ b/test/jaxp/javax/xml/jaxp/functional/org/xml/sax/ptests/XMLFilterTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -22,28 +22,28 @@
  */
 package org.xml.sax.ptests;
 
-import static org.testng.Assert.assertFalse;
-import static org.testng.Assert.assertNotNull;
-import static org.testng.Assert.assertTrue;
-import static org.xml.sax.ptests.SAXTestConst.XML_DIR;
-
-import java.io.FileInputStream;
-
-import javax.xml.parsers.SAXParserFactory;
-
-import org.testng.annotations.Test;
+import org.junit.jupiter.api.Test;
 import org.xml.sax.InputSource;
 import org.xml.sax.SAXNotRecognizedException;
 import org.xml.sax.XMLReader;
 import org.xml.sax.helpers.XMLFilterImpl;
 
+import javax.xml.parsers.SAXParserFactory;
+import java.io.FileInputStream;
+
+import static org.junit.jupiter.api.Assertions.assertFalse;
+import static org.junit.jupiter.api.Assertions.assertNotNull;
+import static org.junit.jupiter.api.Assertions.assertThrows;
+import static org.junit.jupiter.api.Assertions.assertTrue;
+import static org.xml.sax.ptests.SAXTestConst.XML_DIR;
+
 /**
  * Unit test for XMLFilter.
  */
 /*
  * @test
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm org.xml.sax.ptests.XMLFilterTest
+ * @run junit/othervm org.xml.sax.ptests.XMLFilterTest
  */
 public class XMLFilterTest {
     /**
@@ -132,8 +132,6 @@ public class XMLFilterTest {
 
     /**
      * By default true is expected get namespaces feature.
-     *
-     * @throws Exception If any errors occur.
      */
     @Test
     public void getFeature01() throws Exception {
@@ -148,8 +146,6 @@ public class XMLFilterTest {
 
     /**
      * By default false is expected get namespaces-prefix feature.
-     *
-     * @throws Exception If any errors occur.
      */
     @Test
     public void getFeature02() throws Exception {
@@ -163,19 +159,15 @@ public class XMLFilterTest {
     /**
      * SAXNotRecognizedException is expected when get a feature by an invalid
      * feature name.
-     *
-     * @throws Exception If any errors occur.
      */
-    @Test(expectedExceptions = SAXNotRecognizedException.class)
+    @Test
     public void getFeature03() throws Exception {
-        new XMLFilterImpl().getFeature("no-meaning-feature");
+        assertThrows(SAXNotRecognizedException.class, () -> new XMLFilterImpl().getFeature("no-meaning-feature"));
     }
 
     /**
      * Set namespaces feature to a value to XMLFilter. it's expected same when
      * obtain it again.
-     *
-     * @throws Exception If any errors occur.
      */
     @Test
     public void setFeature01() throws Exception {
@@ -193,8 +185,6 @@ public class XMLFilterTest {
     /**
      * Set namespaces-prefix feature to a value to XMLFilter. it's expected same
      * when obtain it again.
-     *
-     * @throws Exception If any errors occur.
      */
     @Test
     public void setFeature02() throws Exception {
@@ -211,35 +201,31 @@ public class XMLFilterTest {
 
     /**
      * NullPointerException is expected when parse a null InputSource.
-     *
-     * @throws Exception If any errors occur.
      */
-    @Test(expectedExceptions = NullPointerException.class)
+    @Test
     public void parse01() throws Exception {
-        new XMLFilterImpl().parse((InputSource)null);
+        assertThrows(NullPointerException.class, () -> new XMLFilterImpl().parse((InputSource) null));
     }
 
     /**
      * SAXException is expected when parsing a invalid formatted XML file.
-     *
-     * @throws Exception If any errors occur.
      */
-    @Test(expectedExceptions = NullPointerException.class)
+    @Test
     public void parse02() throws Exception {
-        try(FileInputStream fis = new FileInputStream(XML_DIR + "invalid.xml")) {
-            new XMLFilterImpl().parse(new InputSource(fis));
+        try (FileInputStream fis = new FileInputStream(XML_DIR + "invalid.xml")) {
+            InputSource input = new InputSource(fis);
+            assertThrows(NullPointerException.class, () -> new XMLFilterImpl().parse(input));
         }
     }
 
     /**
      * No exception when parse a normal XML file.
-     *
-     * @throws Exception If any errors occur.
      */
-    @Test(expectedExceptions = NullPointerException.class)
+    @Test
     public void parse03() throws Exception {
-        try(FileInputStream fis = new FileInputStream(XML_DIR + "correct2.xml")) {
-            new XMLFilterImpl().parse(new InputSource(fis));
+        try (FileInputStream fis = new FileInputStream(XML_DIR + "correct2.xml")) {
+            InputSource input = new InputSource(fis);
+            assertThrows(NullPointerException.class, () -> new XMLFilterImpl().parse(input));
         }
     }
 }
diff --git a/test/jaxp/javax/xml/jaxp/functional/org/xml/sax/ptests/XMLReaderAdapterTest.java b/test/jaxp/javax/xml/jaxp/functional/org/xml/sax/ptests/XMLReaderAdapterTest.java
index 40462fcf076..65dbaba9971 100644
--- a/test/jaxp/javax/xml/jaxp/functional/org/xml/sax/ptests/XMLReaderAdapterTest.java
+++ b/test/jaxp/javax/xml/jaxp/functional/org/xml/sax/ptests/XMLReaderAdapterTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -22,28 +22,27 @@
  */
 package org.xml.sax.ptests;
 
-import static org.testng.Assert.assertNotNull;
-import static org.testng.Assert.assertTrue;
-import static org.xml.sax.ptests.SAXTestConst.XML_DIR;
-
-import java.io.FileInputStream;
-
-import javax.xml.parsers.SAXParserFactory;
-
-import org.testng.annotations.Test;
+import org.junit.jupiter.api.Test;
 import org.xml.sax.HandlerBase;
 import org.xml.sax.InputSource;
 import org.xml.sax.SAXException;
 import org.xml.sax.XMLReader;
 import org.xml.sax.helpers.XMLReaderAdapter;
 
+import javax.xml.parsers.SAXParserFactory;
+import java.io.FileInputStream;
+
+import static org.junit.jupiter.api.Assertions.assertNotNull;
+import static org.junit.jupiter.api.Assertions.assertTrue;
+import static org.xml.sax.ptests.SAXTestConst.XML_DIR;
+
 /**
  * Class containing the test cases for XMLReaderAdapter API
  */
 /*
  * @test
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm org.xml.sax.ptests.XMLReaderAdapterTest
+ * @run junit/othervm org.xml.sax.ptests.XMLReaderAdapterTest
  */
 public class XMLReaderAdapterTest {
     /**
@@ -64,21 +63,17 @@ public class XMLReaderAdapterTest {
 
     /**
      * To test the constructor that uses XMLReader.
-     *
-     * @throws Exception If any errors occur.
      */
     @Test
     public void constructor02() throws Exception {
         XMLReader xmlReader = SAXParserFactory.newInstance().newSAXParser().getXMLReader();
-        assertNotNull(new XMLReaderAdapter(xmlReader));
+        new XMLReaderAdapter(xmlReader);
     }
 
     /**
      * To test the parse method. The specification says that this method
      * will throw an exception if the embedded XMLReader does not support
      * the http://xml.org/sax/features/namespace-prefixes property.
-     *
-     * @throws Exception If any errors occur.
      */
     @Test
     public void nsfeature01() throws Exception {
@@ -93,8 +88,6 @@ public class XMLReaderAdapterTest {
      * To test the parse method. The specification says that this method
      * will throw an exception if the embedded XMLReader does not support
      * the http://xml.org/sax/features/namespace-prefixes property.
-     *
-     * @throws Exception If any errors occur.
      */
     @Test
     public void parse01() throws Exception {
diff --git a/test/jaxp/javax/xml/jaxp/functional/org/xml/sax/ptests/XMLReaderFactoryTest.java b/test/jaxp/javax/xml/jaxp/functional/org/xml/sax/ptests/XMLReaderFactoryTest.java
index a109a27bce4..c8272d186ea 100644
--- a/test/jaxp/javax/xml/jaxp/functional/org/xml/sax/ptests/XMLReaderFactoryTest.java
+++ b/test/jaxp/javax/xml/jaxp/functional/org/xml/sax/ptests/XMLReaderFactoryTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -22,21 +22,21 @@
  */
 package org.xml.sax.ptests;
 
-import static jaxp.library.JAXPTestUtilities.setSystemProperty;
-
-import static org.testng.Assert.assertNotNull;
-
-import org.testng.annotations.Test;
+import org.junit.jupiter.api.Test;
 import org.xml.sax.SAXException;
 import org.xml.sax.helpers.XMLReaderFactory;
 
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertNotNull;
+import static org.junit.jupiter.api.Assertions.assertThrows;
+
 /**
  * Unit test for XMLReaderFactory.createXMLReader API.
  */
 /*
  * @test
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm org.xml.sax.ptests.XMLReaderFactoryTest
+ * @run junit/othervm org.xml.sax.ptests.XMLReaderFactoryTest
  */
 public class XMLReaderFactoryTest {
     /**
@@ -56,20 +56,25 @@ public class XMLReaderFactoryTest {
      */
     @Test
     public void createReader02() throws SAXException {
-        setSystemProperty("org.xml.sax.driver",
-            "com.sun.org.apache.xerces.internal.parsers.SAXParser");
-        assertNotNull(XMLReaderFactory.
-            createXMLReader("com.sun.org.apache.xerces.internal.parsers.SAXParser"));
+        System.setProperty("org.xml.sax.driver",
+                "com.sun.org.apache.xerces.internal.parsers.SAXParser");
+        try {
+            assertNotNull(XMLReaderFactory.createXMLReader(
+                    "com.sun.org.apache.xerces.internal.parsers.SAXParser"));
+        } finally {
+            System.clearProperty("org.xml.sax.driver");
+        }
     }
 
     /**
      * SAXException expected when create XMLReader with an invalid driver name.
      * @throws org.xml.sax.SAXException expected Exception
      */
-    @Test(expectedExceptions = SAXException.class,
-            expectedExceptionsMessageRegExp =
-                    "SAX2 driver class org.apache.crimson.parser.ABCD not found")
-    public void createReader03() throws SAXException{
-        XMLReaderFactory.createXMLReader("org.apache.crimson.parser.ABCD");
+    @Test
+    public void createReader03() throws SAXException {
+        SAXException e = assertThrows(
+                SAXException.class,
+                () -> XMLReaderFactory.createXMLReader("org.apache.crimson.parser.ABCD"));
+        assertEquals("SAX2 driver class org.apache.crimson.parser.ABCD not found", e.getMessage());
     }
 }
diff --git a/test/jaxp/javax/xml/jaxp/functional/org/xml/sax/ptests/XMLReaderNSTableTest.java b/test/jaxp/javax/xml/jaxp/functional/org/xml/sax/ptests/XMLReaderNSTableTest.java
index 9874866c7ec..2e7d0bc548f 100644
--- a/test/jaxp/javax/xml/jaxp/functional/org/xml/sax/ptests/XMLReaderNSTableTest.java
+++ b/test/jaxp/javax/xml/jaxp/functional/org/xml/sax/ptests/XMLReaderNSTableTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -22,20 +22,20 @@
  */
 package org.xml.sax.ptests;
 
-import static jaxp.library.JAXPTestUtilities.USER_DIR;
-import static jaxp.library.JAXPTestUtilities.compareWithGold;
-import static org.testng.Assert.assertTrue;
-import static org.xml.sax.ptests.SAXTestConst.GOLDEN_DIR;
-import static org.xml.sax.ptests.SAXTestConst.XML_DIR;
-
-import java.io.FileInputStream;
+import org.junit.jupiter.api.Assertions;
+import org.junit.jupiter.api.Test;
+import org.xml.sax.InputSource;
+import org.xml.sax.XMLReader;
 
 import javax.xml.parsers.SAXParser;
 import javax.xml.parsers.SAXParserFactory;
+import java.io.FileInputStream;
+import java.io.IOException;
+import java.nio.file.Files;
+import java.nio.file.Path;
 
-import org.testng.annotations.Test;
-import org.xml.sax.InputSource;
-import org.xml.sax.XMLReader;
+import static org.xml.sax.ptests.SAXTestConst.GOLDEN_DIR;
+import static org.xml.sax.ptests.SAXTestConst.XML_DIR;
 
 /** This class contains the testcases to test XMLReader with regard to
   * Namespace Table defined at
@@ -44,9 +44,8 @@ import org.xml.sax.XMLReader;
 /*
  * @test
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm org.xml.sax.ptests.XMLReaderNSTableTest
+ * @run junit/othervm org.xml.sax.ptests.XMLReaderNSTableTest
  */
-@Test
 public class XMLReaderNSTableTest {
     /**
      * XML file that used to be parsed.
@@ -62,11 +61,10 @@ public class XMLReaderNSTableTest {
      * namespace processing is enabled. namespace-prefix is also is enabled.
      * So it is a True-True combination.
      * The test is to test XMLReader with these conditions.
-     *
-     * @throws Exception If any errors occur.
      */
+    @Test
     public void testWithTrueTrue() throws Exception {
-        String outputFile = USER_DIR + "XRNSTableTT.out";
+        String outputFile = "XRNSTableTT.out";
         String goldFile = GOLDEN_DIR + "NSTableTTGF.out";
 
         SAXParserFactory spf = SAXParserFactory.newInstance();
@@ -79,18 +77,17 @@ public class XMLReaderNSTableTest {
             xmlReader.setContentHandler(handler);
             xmlReader.parse(new InputSource(fis));
         }
-        assertTrue(compareWithGold(goldFile, outputFile));
+        assertLinesMatch(goldFile, outputFile);
     }
 
     /**
      * Namespace processing is enabled. Hence namespace-prefix is
      * expected to be automatically off. So it is a True-False combination.
      * The test is to test XMLReader with these conditions.
-     *
-     * @throws Exception If any errors occur.
      */
+    @Test
     public void testWithTrueFalse() throws Exception {
-        String outputFile = USER_DIR + "XRNSTableTF.out";
+        String outputFile = "XRNSTableTF.out";
         String goldFile = GOLDEN_DIR + "NSTableTFGF.out";
 
         SAXParserFactory spf = SAXParserFactory.newInstance();
@@ -103,18 +100,17 @@ public class XMLReaderNSTableTest {
             xmlReader.setContentHandler(handler);
             xmlReader.parse(new InputSource(fis));
         }
-        assertTrue(compareWithGold(goldFile, outputFile));
+        assertLinesMatch(goldFile, outputFile);
     }
 
     /**
      * namespace processing is not enabled. Hence namespace-prefix is
      * expected to be automaically on. So it is a False-True combination.
      * The test is to test XMLReader with these conditions.
-     *
-     * @throws Exception If any errors occur.
      */
-    public void testWithFalseTrue()throws Exception {
-        String outputFile = USER_DIR + "XRNSTableFT.out";
+    @Test
+    public void testWithFalseTrue() throws Exception {
+        String outputFile = "XRNSTableFT.out";
         String goldFile = GOLDEN_DIR + "NSTableFTGF.out";
 
         SAXParserFactory spf = SAXParserFactory.newInstance();
@@ -125,6 +121,12 @@ public class XMLReaderNSTableTest {
             xmlReader.setContentHandler(handler);
             xmlReader.parse(new InputSource(fis));
         }
-        assertTrue(compareWithGold(goldFile, outputFile));
+        assertLinesMatch(goldFile, outputFile);
+    }
+
+    private static void assertLinesMatch(String goldenFile, String actual) throws IOException {
+        Assertions.assertLinesMatch(
+                Files.readAllLines(Path.of(goldenFile)),
+                Files.readAllLines(Path.of(actual)));
     }
 }
diff --git a/test/jaxp/javax/xml/jaxp/functional/org/xml/sax/ptests/XMLReaderTest.java b/test/jaxp/javax/xml/jaxp/functional/org/xml/sax/ptests/XMLReaderTest.java
index 497df48f7e4..f726e19922c 100644
--- a/test/jaxp/javax/xml/jaxp/functional/org/xml/sax/ptests/XMLReaderTest.java
+++ b/test/jaxp/javax/xml/jaxp/functional/org/xml/sax/ptests/XMLReaderTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -22,18 +22,7 @@
  */
 package org.xml.sax.ptests;
 
-import static org.testng.Assert.assertEquals;
-import static org.testng.Assert.assertFalse;
-import static org.testng.Assert.assertNotNull;
-import static org.testng.Assert.assertNull;
-import static org.testng.Assert.assertTrue;
-import static org.xml.sax.ptests.SAXTestConst.XML_DIR;
-
-import java.io.FileInputStream;
-
-import javax.xml.parsers.SAXParserFactory;
-
-import org.testng.annotations.Test;
+import org.junit.jupiter.api.Test;
 import org.xml.sax.InputSource;
 import org.xml.sax.SAXException;
 import org.xml.sax.SAXNotRecognizedException;
@@ -43,13 +32,24 @@ import org.xml.sax.ext.DeclHandler;
 import org.xml.sax.ext.LexicalHandler;
 import org.xml.sax.helpers.XMLFilterImpl;
 
+import javax.xml.parsers.SAXParserFactory;
+import java.io.FileInputStream;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertFalse;
+import static org.junit.jupiter.api.Assertions.assertNotNull;
+import static org.junit.jupiter.api.Assertions.assertNull;
+import static org.junit.jupiter.api.Assertions.assertThrows;
+import static org.junit.jupiter.api.Assertions.assertTrue;
+import static org.xml.sax.ptests.SAXTestConst.XML_DIR;
+
 /**
  * Class containing the test cases for SAXParser API
  */
 /*
  * @test
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm org.xml.sax.ptests.XMLReaderTest
+ * @run junit/othervm org.xml.sax.ptests.XMLReaderTest
  */
 public class XMLReaderTest {
 
@@ -309,11 +309,11 @@ public class XMLReaderTest {
      *
      * @throws Exception If any errors occur.
      */
-    @Test(expectedExceptions = SAXNotRecognizedException.class)
+    @Test
     public void featureNE01() throws Exception {
         SAXParserFactory spf = SAXParserFactory.newInstance();
         spf.setNamespaceAware(true);
-        spf.newSAXParser().getXMLReader().getFeature("no-meaning-feature");
+        assertThrows(SAXNotRecognizedException.class, () -> spf.newSAXParser().getXMLReader().getFeature("no-meaning-feature"));
     }
 
     /**
@@ -328,7 +328,7 @@ public class XMLReaderTest {
         XMLReader xmlReader = spf.newSAXParser().getXMLReader();
         XMLFilterImpl xmlFilter = new XMLFilterImpl();
         xmlReader.setEntityResolver(xmlFilter);
-        assertEquals(xmlReader.getEntityResolver(), xmlFilter);
+        assertEquals(xmlFilter, xmlReader.getEntityResolver());
     }
 
     /**
@@ -355,7 +355,7 @@ public class XMLReaderTest {
         XMLReader xmlReader = spf.newSAXParser().getXMLReader();
         XMLFilterImpl xmlFilter = new XMLFilterImpl();
         xmlReader.setDTDHandler(xmlFilter);
-        assertEquals(xmlReader.getDTDHandler(), xmlFilter);
+        assertEquals(xmlFilter, xmlReader.getDTDHandler());
     }
 
     /**
@@ -382,7 +382,7 @@ public class XMLReaderTest {
         XMLReader xmlReader = spf.newSAXParser().getXMLReader();
         XMLFilterImpl xmlFilter = new XMLFilterImpl();
         xmlReader.setContentHandler(xmlFilter);
-        assertEquals(xmlReader.getContentHandler(), xmlFilter);
+        assertEquals(xmlFilter, xmlReader.getContentHandler());
     }
 
     /**
@@ -429,11 +429,11 @@ public class XMLReaderTest {
      *
      * @throws Exception If any errors occur.
      */
-    @Test(expectedExceptions = NullPointerException.class)
+    @Test
     public void parse01() throws Exception {
         SAXParserFactory spf = SAXParserFactory.newInstance();
         spf.setNamespaceAware(true);
-        spf.newSAXParser().getXMLReader().parse((InputSource) null);
+        assertThrows(NullPointerException.class, () -> spf.newSAXParser().getXMLReader().parse((InputSource) null));
     }
 
     /**
@@ -441,12 +441,12 @@ public class XMLReaderTest {
      *
      * @throws Exception If any errors occur.
      */
-    @Test(expectedExceptions = SAXException.class)
+    @Test
     public void parse02() throws Exception {
         try (FileInputStream fis = new FileInputStream(XML_DIR + "invalid.xml")) {
             SAXParserFactory spf = SAXParserFactory.newInstance();
             spf.setNamespaceAware(true);
-            spf.newSAXParser().getXMLReader().parse(new InputSource(fis));
+            assertThrows(SAXException.class, () -> spf.newSAXParser().getXMLReader().parse(new InputSource(fis)));
         }
     }
 
@@ -470,11 +470,11 @@ public class XMLReaderTest {
      *
      * @throws Exception If any errors occur.
      */
-    @Test(expectedExceptions = SAXNotSupportedException.class)
+    @Test
     public void xrProperty01() throws Exception {
         SAXParserFactory spf = SAXParserFactory.newInstance();
         XMLReader xmlReader = spf.newSAXParser().getXMLReader();
-        xmlReader.getProperty(XML_STRING);
+        assertThrows(SAXNotSupportedException.class, () -> xmlReader.getProperty(XML_STRING));
     }
 
     /**
@@ -483,11 +483,11 @@ public class XMLReaderTest {
      *
      * @throws Exception If any errors occur.
      */
-    @Test(expectedExceptions = SAXNotSupportedException.class)
+    @Test
     public void xrProperty02() throws Exception {
         SAXParserFactory spf = SAXParserFactory.newInstance();
         XMLReader xmlReader = spf.newSAXParser().getXMLReader();
-        assertNull(xmlReader.getProperty(DOM_NODE));
+        assertThrows(SAXNotSupportedException.class, () -> xmlReader.getProperty(DOM_NODE));
     }
 
     /**
@@ -623,7 +623,7 @@ class MyDeclHandler implements DeclHandler {
      * @param eName The name of the associated element.
      * @param aName The name of the attribute.
      * @param type A string representing the attribute type.
-     * @param mode A string representing the attribute defaulting mode
+     * @param valueDefault A string representing the attribute defaulting mode
      * ("#IMPLIED", "#REQUIRED", or "#FIXED") or null if none of these applies.
      * @param value A string representing the attribute's default value, or null
      * if there is none.
diff --git a/test/jaxp/javax/xml/jaxp/functional/test/astro/AstroTest.java b/test/jaxp/javax/xml/jaxp/functional/test/astro/AstroTest.java
index a42fcd9d3d7..ae7b88c5d34 100644
--- a/test/jaxp/javax/xml/jaxp/functional/test/astro/AstroTest.java
+++ b/test/jaxp/javax/xml/jaxp/functional/test/astro/AstroTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2002, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2002, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,26 +23,25 @@
 
 package test.astro;
 
-import static java.lang.String.valueOf;
-import static jaxp.library.JAXPTestUtilities.USER_DIR;
-import static jaxp.library.JAXPTestUtilities.compareWithGold;
-import static org.testng.Assert.assertTrue;
-import static test.astro.AstroConstants.ASTROCAT;
-import static test.astro.AstroConstants.GOLDEN_DIR;
-
-import java.nio.file.Files;
-import java.nio.file.Paths;
+import org.junit.jupiter.api.BeforeAll;
+import org.junit.jupiter.api.TestInstance;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
 
 import javax.xml.transform.sax.TransformerHandler;
+import java.nio.file.Files;
+import java.nio.file.Path;
+import java.nio.file.Paths;
 
-import org.testng.annotations.BeforeClass;
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
+import static java.lang.String.valueOf;
+import static org.junit.jupiter.api.Assertions.assertLinesMatch;
+import static test.astro.AstroConstants.ASTROCAT;
+import static test.astro.AstroConstants.GOLDEN_DIR;
 
 /*
  * @test
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm test.astro.AstroTest
+ * @run junit/othervm test.astro.AstroTest
  * @summary run astro application, test xslt
  *
  * There are vast amounts of textual astronomical data, typically user is
@@ -67,10 +66,11 @@ import org.testng.annotations.Test;
  * AstroProcessor to test different JAXP classes and features.
  *
  */
+@TestInstance(TestInstance.Lifecycle.PER_CLASS)
 public class AstroTest {
     private FiltersAndGolden[] data;
 
-    @BeforeClass
+    @BeforeAll
     public void setup() throws Exception {
         data = new FiltersAndGolden[4];
         data[0] = new FiltersAndGolden(getGoldenFileName(1), astro -> astro.getRAFilter(0.106, 0.108));
@@ -82,8 +82,7 @@ public class AstroTest {
     /*
      * Provide permutations of InputSourceFactory and FilterFactory for test.
      */
-    @DataProvider(name = "factories")
-    public Object[][] getQueryFactories() {
+    public static Object[][] getQueryFactories() {
         return new Object[][] {
                 { StreamFilterFactoryImpl.class, InputSourceFactoryImpl.class },
                 { SAXFilterFactoryImpl.class, InputSourceFactoryImpl.class },
@@ -92,7 +91,8 @@ public class AstroTest {
                 { StreamFilterFactoryImpl.class, DOML3InputSourceFactoryImpl.class } };
     }
 
-    @Test(dataProvider = "factories")
+    @ParameterizedTest
+    @MethodSource("getQueryFactories")
     public void test(Class<FilterFactory> fFactClass, Class<InputSourceFactory> isFactClass) throws Exception {
         System.out.println(fFactClass.getName() +" : " + isFactClass.getName());
         AstroProcessor astro = new AstroProcessor(fFactClass, ASTROCAT, isFactClass);
@@ -108,10 +108,12 @@ public class AstroTest {
         for (int i = 0; i < filterCreators.length; i++)
             filters[i] = filterCreators[i].createFilter(astro);
 
-        String outputfile = Files.createTempFile(Paths.get(USER_DIR), "query" + processNum + ".out.", null).toString();
+        String outputfile = Files.createTempFile(Paths.get("."), "query" + processNum + ".out.", null).toString();
         System.out.println("output file: " + outputfile);
         astro.process(outputfile, filters);
-        assertTrue(compareWithGold(goldenFileName, outputfile));
+        assertLinesMatch(
+                Files.readAllLines(Path.of(goldenFileName)),
+                Files.readAllLines(Path.of(outputfile)));
     }
 
     private String getGoldenFileName(int num) {
@@ -124,8 +126,8 @@ public class AstroTest {
     }
 
     private static class FiltersAndGolden {
-        private FilterCreator[] filters;
-        private String goldenFileName;
+        private final FilterCreator[] filters;
+        private final String goldenFileName;
 
         FiltersAndGolden(String goldenFileName, FilterCreator... filters) {
             this.filters = filters;
diff --git a/test/jaxp/javax/xml/jaxp/functional/test/astro/DocumentLSTest.java b/test/jaxp/javax/xml/jaxp/functional/test/astro/DocumentLSTest.java
index d337ee1bbad..4082e0603d6 100644
--- a/test/jaxp/javax/xml/jaxp/functional/test/astro/DocumentLSTest.java
+++ b/test/jaxp/javax/xml/jaxp/functional/test/astro/DocumentLSTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2002, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2002, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -22,26 +22,7 @@
  */
 package test.astro;
 
-import static jaxp.library.JAXPTestUtilities.USER_DIR;
-import static jaxp.library.JAXPTestUtilities.filenameToURL;
-import static org.testng.Assert.assertEquals;
-import static org.testng.Assert.assertNotNull;
-import static org.testng.Assert.assertNull;
-import static org.testng.Assert.assertTrue;
-import static org.w3c.dom.ls.DOMImplementationLS.MODE_SYNCHRONOUS;
-import static test.astro.AstroConstants.ASTROCAT;
-
-import java.io.FileInputStream;
-import java.io.FileOutputStream;
-import java.io.InputStream;
-import java.io.OutputStream;
-import java.io.Writer;
-
-import javax.xml.parsers.DocumentBuilder;
-import javax.xml.parsers.DocumentBuilderFactory;
-import javax.xml.parsers.ParserConfigurationException;
-
-import org.testng.annotations.Test;
+import org.junit.jupiter.api.Test;
 import org.w3c.dom.Document;
 import org.w3c.dom.Element;
 import org.w3c.dom.ls.DOMImplementationLS;
@@ -50,10 +31,27 @@ import org.w3c.dom.ls.LSOutput;
 import org.w3c.dom.ls.LSParser;
 import org.w3c.dom.ls.LSSerializer;
 
+import javax.xml.parsers.DocumentBuilder;
+import javax.xml.parsers.DocumentBuilderFactory;
+import javax.xml.parsers.ParserConfigurationException;
+import java.io.FileInputStream;
+import java.io.FileOutputStream;
+import java.io.InputStream;
+import java.io.OutputStream;
+import java.io.Writer;
+import java.nio.file.Path;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertNotNull;
+import static org.junit.jupiter.api.Assertions.assertNull;
+import static org.junit.jupiter.api.Assertions.assertTrue;
+import static org.w3c.dom.ls.DOMImplementationLS.MODE_SYNCHRONOUS;
+import static test.astro.AstroConstants.ASTROCAT;
+
 /*
  * @test
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm test.astro.DocumentLSTest
+ * @run junit/othervm test.astro.DocumentLSTest
  * @summary org.w3c.dom.ls tests
  */
 public class DocumentLSTest {
@@ -84,11 +82,11 @@ public class DocumentLSTest {
             assertTrue(src.getCertifiedText());
             src.setCertifiedText(origCertified); // set back to orig
 
-            src.setSystemId(filenameToURL(ASTROCAT));
+            src.setSystemId(Path.of(ASTROCAT).toUri().toASCIIString());
 
             Document doc = domParser.parse(src);
             Element result = doc.getDocumentElement();
-            assertEquals(result.getTagName(), "stardb");
+            assertEquals("stardb", result.getTagName());
         }
     }
 
@@ -106,12 +104,12 @@ public class DocumentLSTest {
         domSerializer.getDomConfig().setParameter("xml-declaration", Boolean.FALSE);
         LSInput src = impl.createLSInput();
         src.setStringData(xml);
-        assertEquals(src.getStringData(), xml);
+        assertEquals(xml, src.getStringData());
 
         Document doc = domParser.parse(src);
         String result = domSerializer.writeToString(doc);
 
-        assertEquals(result, "<test>runDocumentLS_Q6</test>");
+        assertEquals("<test>runDocumentLS_Q6</test>", result);
     }
 
     /*
@@ -128,7 +126,7 @@ public class DocumentLSTest {
         impl = (DOMImplementationLS) db.getDOMImplementation();
         LSSerializer domSerializer = impl.createLSSerializer();
         MyDOMOutput mydomoutput = new MyDOMOutput();
-        try (OutputStream os = new FileOutputStream(USER_DIR + "test.out")) {
+        try (OutputStream os = new FileOutputStream("test.out")) {
             mydomoutput.setByteStream(os);
             mydomoutput.setEncoding("UTF-8");
             assertTrue(domSerializer.write(doc, mydomoutput));
diff --git a/test/jaxp/javax/xml/jaxp/functional/test/astro/NamespaceContextTest.java b/test/jaxp/javax/xml/jaxp/functional/test/astro/NamespaceContextTest.java
index 75b7880a1ca..7e5000a440e 100644
--- a/test/jaxp/javax/xml/jaxp/functional/test/astro/NamespaceContextTest.java
+++ b/test/jaxp/javax/xml/jaxp/functional/test/astro/NamespaceContextTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2002, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2002, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -22,18 +22,18 @@
  */
 package test.astro;
 
-import static javax.xml.XMLConstants.DEFAULT_NS_PREFIX;
-import static javax.xml.XMLConstants.NULL_NS_URI;
-import static org.testng.Assert.assertEquals;
+import org.junit.jupiter.api.Test;
 
 import javax.xml.namespace.QName;
 
-import org.testng.annotations.Test;
+import static javax.xml.XMLConstants.DEFAULT_NS_PREFIX;
+import static javax.xml.XMLConstants.NULL_NS_URI;
+import static org.junit.jupiter.api.Assertions.assertEquals;
 
 /*
  * @test
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm test.astro.NamespaceContextTest
+ * @run junit/othervm test.astro.NamespaceContextTest
  * @summary javax.xml.namespace.QName tests
  */
 public class NamespaceContextTest {
@@ -47,9 +47,9 @@ public class NamespaceContextTest {
     @Test
     public void testQNameConstructor() {
         QName qname = new QName(NS_URI, LOCAL_PART, PREFIX);
-        assertEquals(qname.getNamespaceURI(), NS_URI);
-        assertEquals(qname.getLocalPart(), LOCAL_PART);
-        assertEquals(qname.getPrefix(), PREFIX);
+        assertEquals(NS_URI, qname.getNamespaceURI());
+        assertEquals(LOCAL_PART, qname.getLocalPart());
+        assertEquals(PREFIX, qname.getPrefix());
     }
 
     /*
@@ -59,9 +59,9 @@ public class NamespaceContextTest {
     @Test
     public void testDefaultFields() {
         QName qname = new QName(LOCAL_PART); // just the local part specified
-        assertEquals(qname.getNamespaceURI(), NULL_NS_URI);
-        assertEquals(qname.getLocalPart(), LOCAL_PART);
-        assertEquals(qname.getPrefix(), DEFAULT_NS_PREFIX);
+        assertEquals(NULL_NS_URI, qname.getNamespaceURI());
+        assertEquals(LOCAL_PART, qname.getLocalPart());
+        assertEquals(DEFAULT_NS_PREFIX, qname.getPrefix());
     }
 
     /*
@@ -71,9 +71,9 @@ public class NamespaceContextTest {
     @Test
     public void testDefaultPrefix() {
         QName qname = new QName(NS_URI, LOCAL_PART); // no pref
-        assertEquals(qname.getNamespaceURI(), NS_URI);
-        assertEquals(qname.getLocalPart(), LOCAL_PART);
-        assertEquals(qname.getPrefix(), DEFAULT_NS_PREFIX);
+        assertEquals(NS_URI, qname.getNamespaceURI());
+        assertEquals(LOCAL_PART, qname.getLocalPart());
+        assertEquals(DEFAULT_NS_PREFIX, qname.getPrefix());
     }
 
     /*
@@ -83,6 +83,6 @@ public class NamespaceContextTest {
     @Test
     public void testQNameString() {
         QName qname = new QName(NS_URI, LOCAL_PART, PREFIX);
-        assertEquals(QName.valueOf(qname.toString()), qname);
+        assertEquals(qname, QName.valueOf(qname.toString()));
     }
 }
diff --git a/test/jaxp/javax/xml/jaxp/functional/test/astro/SAX201Test.java b/test/jaxp/javax/xml/jaxp/functional/test/astro/SAX201Test.java
index 6cdbd93ce82..3384d04161a 100644
--- a/test/jaxp/javax/xml/jaxp/functional/test/astro/SAX201Test.java
+++ b/test/jaxp/javax/xml/jaxp/functional/test/astro/SAX201Test.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2002, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2002, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -22,15 +22,15 @@
  */
 package test.astro;
 
-import javax.xml.parsers.SAXParserFactory;
-
-import org.testng.annotations.Test;
+import org.junit.jupiter.api.Test;
 import org.xml.sax.XMLReader;
 
+import javax.xml.parsers.SAXParserFactory;
+
 /*
  * @test
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm test.astro.SAX201Test
+ * @run junit/othervm test.astro.SAX201Test
  * @summary verify SAX 2.0.1 allows to use null in setters
  */
 public class SAX201Test {
diff --git a/test/jaxp/javax/xml/jaxp/functional/test/astro/SchemaValidationTest.java b/test/jaxp/javax/xml/jaxp/functional/test/astro/SchemaValidationTest.java
index 782831e60b8..d2e5740f1f8 100644
--- a/test/jaxp/javax/xml/jaxp/functional/test/astro/SchemaValidationTest.java
+++ b/test/jaxp/javax/xml/jaxp/functional/test/astro/SchemaValidationTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2002, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2002, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -22,25 +22,25 @@
  */
 package test.astro;
 
-import static javax.xml.XMLConstants.W3C_XML_SCHEMA_NS_URI;
-import static test.astro.AstroConstants.ASTROCAT;
-import static test.astro.AstroConstants.JAXP_SCHEMA_LANGUAGE;
-import static test.astro.AstroConstants.JAXP_SCHEMA_SOURCE;
-
-import java.io.File;
+import org.junit.jupiter.api.Test;
+import org.xml.sax.SAXException;
+import org.xml.sax.helpers.DefaultHandler;
 
 import javax.xml.parsers.ParserConfigurationException;
 import javax.xml.parsers.SAXParser;
 import javax.xml.parsers.SAXParserFactory;
+import java.io.File;
 
-import org.testng.annotations.Test;
-import org.xml.sax.SAXException;
-import org.xml.sax.helpers.DefaultHandler;
+import static javax.xml.XMLConstants.W3C_XML_SCHEMA_NS_URI;
+import static org.junit.jupiter.api.Assertions.assertThrows;
+import static test.astro.AstroConstants.ASTROCAT;
+import static test.astro.AstroConstants.JAXP_SCHEMA_LANGUAGE;
+import static test.astro.AstroConstants.JAXP_SCHEMA_SOURCE;
 
 /*
  * @test
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm test.astro.SchemaValidationTest
+ * @run junit/othervm test.astro.SchemaValidationTest
  * @summary test parser sets schema related properties to do validation
  */
 public class SchemaValidationTest {
@@ -59,11 +59,10 @@ public class SchemaValidationTest {
      * Test SAXException shall be thrown if schemaSource is set but
      * schemaLanguage is not set.
      */
-    @Test(expectedExceptions = SAXException.class)
+    @Test
     public void testSchemaValidationNeg() throws Exception {
         SAXParser sp = getValidatingParser();
-        sp.setProperty(JAXP_SCHEMA_SOURCE, "catalog.xsd");
-        sp.parse(new File(ASTROCAT), new DefaultHandler());
+        assertThrows(SAXException.class, () -> sp.setProperty(JAXP_SCHEMA_SOURCE, "catalog.xsd"));
     }
 
     private SAXParser getValidatingParser() throws ParserConfigurationException, SAXException {
diff --git a/test/jaxp/javax/xml/jaxp/functional/test/astro/XPathAPITest.java b/test/jaxp/javax/xml/jaxp/functional/test/astro/XPathAPITest.java
index 04bab01fa75..b305a060459 100644
--- a/test/jaxp/javax/xml/jaxp/functional/test/astro/XPathAPITest.java
+++ b/test/jaxp/javax/xml/jaxp/functional/test/astro/XPathAPITest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2002, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2002, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -22,18 +22,17 @@
  */
 package test.astro;
 
-import static javax.xml.XMLConstants.W3C_XML_SCHEMA_NS_URI;
-import static javax.xml.xpath.XPathConstants.DOM_OBJECT_MODEL;
-import static javax.xml.xpath.XPathConstants.NODESET;
-import static jaxp.library.JAXPTestUtilities.filenameToURL;
-import static org.testng.Assert.assertEquals;
-import static test.astro.AstroConstants.ASTROCAT;
-import static test.astro.AstroConstants.JAXP_SCHEMA_LANGUAGE;
-import static test.astro.AstroConstants.JAXP_SCHEMA_SOURCE;
-
-import java.net.MalformedURLException;
-import java.util.ArrayList;
-import java.util.Iterator;
+import org.junit.jupiter.api.BeforeAll;
+import org.junit.jupiter.api.Test;
+import org.junit.jupiter.api.TestInstance;
+import org.junit.jupiter.api.TestInstance.Lifecycle;
+import org.junit.jupiter.api.parallel.Execution;
+import org.junit.jupiter.api.parallel.ExecutionMode;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
+import org.w3c.dom.Document;
+import org.w3c.dom.NodeList;
+import org.xml.sax.InputSource;
 
 import javax.xml.namespace.NamespaceContext;
 import javax.xml.namespace.QName;
@@ -44,21 +43,26 @@ import javax.xml.xpath.XPathExpression;
 import javax.xml.xpath.XPathExpressionException;
 import javax.xml.xpath.XPathFactory;
 import javax.xml.xpath.XPathVariableResolver;
+import java.nio.file.Path;
+import java.util.ArrayList;
+import java.util.Iterator;
 
-import org.testng.annotations.BeforeClass;
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
-import org.w3c.dom.Document;
-import org.w3c.dom.NodeList;
-import org.xml.sax.InputSource;
+import static javax.xml.XMLConstants.W3C_XML_SCHEMA_NS_URI;
+import static javax.xml.xpath.XPathConstants.DOM_OBJECT_MODEL;
+import static javax.xml.xpath.XPathConstants.NODESET;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static test.astro.AstroConstants.ASTROCAT;
+import static test.astro.AstroConstants.JAXP_SCHEMA_LANGUAGE;
+import static test.astro.AstroConstants.JAXP_SCHEMA_SOURCE;
 
 /*
  * @test
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm test.astro.XPathAPITest
+ * @run junit/othervm test.astro.XPathAPITest
  * @summary test XPath API
  */
-@Test(singleThreaded = true)
+@Execution(ExecutionMode.SAME_THREAD)
+@TestInstance(Lifecycle.PER_CLASS)
 public class XPathAPITest {
     private static final String STARDB_STAR_3_CONSTELLATION = "//astro:stardb/astro:star[3]/astro:constellation";
     private static final String STARDB_STAR = "//astro:stardb/astro:star";
@@ -66,7 +70,7 @@ public class XPathAPITest {
     private XPathFactory xpf;
     private NamespaceContext nsContext;
 
-    @BeforeClass
+    @BeforeAll
     public void setup() throws Exception {
         DocumentBuilderFactory df = DocumentBuilderFactory.newInstance();
         df.setNamespaceAware(true);
@@ -81,45 +85,49 @@ public class XPathAPITest {
         nsContext = new MyNamespaceContext();
     }
 
-    @DataProvider(name = "nodelist-evaluator")
-    public Object[][] getNodeListEvaluator() throws MalformedURLException {
-        return new Object[][] { { (XPathEvaluator) expression -> getXPath().evaluate(expression, doc.getDocumentElement(), NODESET) },
-                { (XPathEvaluator) expression -> getXPath().evaluate(expression, createXMLInputSource(), NODESET) },
-                { (XPathEvaluator) expression -> getXPathExpression(expression).evaluate(doc.getDocumentElement(), NODESET) },
-                { (XPathEvaluator) expression -> getXPathExpression(expression).evaluate(createXMLInputSource(), NODESET) } };
+    public Object[] getNodeListEvaluator() {
+        return new Object[] {
+                (XPathEvaluator) expression -> getXPath().evaluate(expression, doc.getDocumentElement(), NODESET),
+                (XPathEvaluator) expression -> getXPath().evaluate(expression, createXMLInputSource(), NODESET),
+                (XPathEvaluator) expression -> getXPathExpression(expression).evaluate(doc.getDocumentElement(), NODESET),
+                (XPathEvaluator) expression -> getXPathExpression(expression).evaluate(createXMLInputSource(), NODESET),
+        };
     }
 
     /*
      * Test xpath expression evaluations method that returns type indicated by
      * QName
      */
-    @Test(dataProvider = "nodelist-evaluator")
+    @ParameterizedTest
+    @MethodSource("getNodeListEvaluator")
     public void testEvaluateNodeList(XPathEvaluator evaluator) throws Exception {
         NodeList o = (NodeList) evaluator.evaluate(STARDB_STAR);
-        assertEquals(o.getLength(), 10);
+        assertEquals(10, o.getLength());
     }
 
-    @DataProvider(name = "string-evaluator")
-    public Object[][] getStringEvaluator() throws MalformedURLException {
-        return new Object[][] { { (XPathEvaluator) expression -> getXPath().evaluate(expression, doc.getDocumentElement()) },
-                { (XPathEvaluator) expression -> getXPath().evaluate(expression, createXMLInputSource()) },
-                { (XPathEvaluator) expression -> getXPathExpression(expression).evaluate(doc.getDocumentElement()) },
-                { (XPathEvaluator) expression -> getXPathExpression(expression).evaluate(createXMLInputSource()) } };
+    public Object[] getStringEvaluator() {
+        return new Object[] {
+                (XPathEvaluator) expression -> getXPath().evaluate(expression, doc.getDocumentElement()),
+                (XPathEvaluator) expression -> getXPath().evaluate(expression, createXMLInputSource()),
+                (XPathEvaluator) expression -> getXPathExpression(expression).evaluate(doc.getDocumentElement()),
+                (XPathEvaluator) expression -> getXPathExpression(expression).evaluate(createXMLInputSource()),
+        };
     }
 
     /*
      * Test xpath expression evaluations method that returns String
      */
-    @Test(dataProvider = "string-evaluator")
+    @ParameterizedTest
+    @MethodSource("getStringEvaluator")
     public void testEvaluateString(XPathEvaluator evaluator) throws Exception {
-        assertEquals(evaluator.evaluate(STARDB_STAR_3_CONSTELLATION), "Psc");
+        assertEquals("Psc", evaluator.evaluate(STARDB_STAR_3_CONSTELLATION));
     }
 
     @Test
     public void testXPathVariableResolver() throws Exception {
         XPath xpath = getXPath();
         xpath.setXPathVariableResolver(new MyXPathVariableResolver());
-        assertEquals(xpath.evaluate("//astro:stardb/astro:star[astro:hr=$id]/astro:constellation", doc.getDocumentElement()), "Peg");
+        assertEquals("Peg", xpath.evaluate("//astro:stardb/astro:star[astro:hr=$id]/astro:constellation", doc.getDocumentElement()));
 
     }
 
@@ -142,15 +150,15 @@ public class XPathAPITest {
             return "http://www.astro.com/astro".equals(nsURI) ? "astro" : "";
         }
 
-        public Iterator getPrefixes(String nsURI) {
-            ArrayList list = new ArrayList();
+        public Iterator<String> getPrefixes(String nsURI) {
+            ArrayList<String> list = new ArrayList<>();
             list.add("astro");
             return list.iterator();
         }
     }
 
     @FunctionalInterface
-    private interface XPathEvaluator {
+    public interface XPathEvaluator {
         Object evaluate(String expression) throws XPathExpressionException;
     }
 
@@ -165,6 +173,6 @@ public class XPathAPITest {
     }
 
     private InputSource createXMLInputSource() {
-        return new InputSource(filenameToURL(ASTROCAT));
+        return new InputSource(Path.of(ASTROCAT).toUri().toASCIIString());
     }
 }
diff --git a/test/jaxp/javax/xml/jaxp/functional/test/auctionportal/AuctionController.java b/test/jaxp/javax/xml/jaxp/functional/test/auctionportal/AuctionController.java
index b2a66629e39..a3cc438f394 100644
--- a/test/jaxp/javax/xml/jaxp/functional/test/auctionportal/AuctionController.java
+++ b/test/jaxp/javax/xml/jaxp/functional/test/auctionportal/AuctionController.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -22,22 +22,18 @@
  */
 package test.auctionportal;
 
-import static javax.xml.XMLConstants.W3C_XML_SCHEMA_NS_URI;
-import static jaxp.library.JAXPTestUtilities.bomStream;
-import static org.testng.Assert.assertEquals;
-import static org.testng.Assert.assertFalse;
-import static org.testng.Assert.assertTrue;
-import static test.auctionportal.HiBidConstants.JAXP_SCHEMA_LANGUAGE;
-import static test.auctionportal.HiBidConstants.JAXP_SCHEMA_SOURCE;
-import static test.auctionportal.HiBidConstants.PORTAL_ACCOUNT_NS;
-import static test.auctionportal.HiBidConstants.XML_DIR;
-
-import java.io.File;
-import java.io.FileInputStream;
-import java.io.InputStream;
-import java.math.BigInteger;
-import java.nio.file.Paths;
-import java.util.GregorianCalendar;
+import org.junit.jupiter.api.Test;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.EnumSource;
+import org.w3c.dom.Attr;
+import org.w3c.dom.DOMConfiguration;
+import org.w3c.dom.Document;
+import org.w3c.dom.Element;
+import org.w3c.dom.NodeList;
+import org.w3c.dom.TypeInfo;
+import org.w3c.dom.bootstrap.DOMImplementationRegistry;
+import org.w3c.dom.ls.DOMImplementationLS;
+import org.w3c.dom.ls.LSSerializer;
 
 import javax.xml.datatype.DatatypeConstants;
 import javax.xml.datatype.DatatypeFactory;
@@ -51,17 +47,28 @@ import javax.xml.transform.dom.DOMSource;
 import javax.xml.validation.Schema;
 import javax.xml.validation.SchemaFactory;
 import javax.xml.validation.Validator;
+import java.io.ByteArrayInputStream;
+import java.io.File;
+import java.io.FileInputStream;
+import java.io.IOException;
+import java.io.InputStream;
+import java.math.BigInteger;
+import java.nio.ByteBuffer;
+import java.nio.ByteOrder;
+import java.nio.charset.Charset;
+import java.nio.charset.StandardCharsets;
+import java.nio.file.Files;
+import java.nio.file.Paths;
+import java.util.GregorianCalendar;
 
-import org.testng.annotations.Test;
-import org.w3c.dom.Attr;
-import org.w3c.dom.DOMConfiguration;
-import org.w3c.dom.Document;
-import org.w3c.dom.Element;
-import org.w3c.dom.NodeList;
-import org.w3c.dom.TypeInfo;
-import org.w3c.dom.bootstrap.DOMImplementationRegistry;
-import org.w3c.dom.ls.DOMImplementationLS;
-import org.w3c.dom.ls.LSSerializer;
+import static javax.xml.XMLConstants.W3C_XML_SCHEMA_NS_URI;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertFalse;
+import static org.junit.jupiter.api.Assertions.assertTrue;
+import static test.auctionportal.HiBidConstants.JAXP_SCHEMA_LANGUAGE;
+import static test.auctionportal.HiBidConstants.JAXP_SCHEMA_SOURCE;
+import static test.auctionportal.HiBidConstants.PORTAL_ACCOUNT_NS;
+import static test.auctionportal.HiBidConstants.XML_DIR;
 
 /**
  * This is the user controller  class for the Auction portal HiBid.com.
@@ -69,14 +76,13 @@ import org.w3c.dom.ls.LSSerializer;
 /*
  * @test
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm test.auctionportal.AuctionController
+ * @run junit/othervm test.auctionportal.AuctionController
  */
 public class AuctionController {
     /**
      * Check for DOMErrorHandler handling DOMError. Before fix of bug 4890927
      * DOMConfiguration.setParameter("well-formed",true) throws an exception.
      *
-     * @throws Exception If any errors occur.
      */
     @Test
     public void testCreateNewItem2Sell() throws Exception {
@@ -99,7 +105,6 @@ public class AuctionController {
      * Check for DOMErrorHandler handling DOMError. Before fix of bug 4896132
      * test throws DOM Level 1 node error.
      *
-     * @throws Exception If any errors occur.
      */
     @Test
     public void testCreateNewItem2SellRetry() throws Exception  {
@@ -131,7 +136,6 @@ public class AuctionController {
      * Check if setting the attribute to be of type ID works. This will affect
      * the Attr.isID method according to the spec.
      *
-     * @throws Exception If any errors occur.
      */
     @Test
     public void testCreateID() throws Exception {
@@ -152,7 +156,6 @@ public class AuctionController {
     /**
      * Check the user data on the node.
      *
-     * @throws Exception If any errors occur.
      */
     @Test
     public void testCheckingUserData() throws Exception {
@@ -164,45 +167,44 @@ public class AuctionController {
         DocumentBuilder docBuilder = dbf.newDocumentBuilder();
         Document document = docBuilder.parse(xmlFile);
 
-        Element account = (Element)document.getElementsByTagNameNS(PORTAL_ACCOUNT_NS, "Account").item(0);
-        assertEquals(account.getNodeName(), "acc:Account");
+        Element account = (Element) document.getElementsByTagNameNS(PORTAL_ACCOUNT_NS, "Account").item(0);
+        assertEquals("acc:Account", account.getNodeName());
         Element firstName = (Element) document.getElementsByTagNameNS(PORTAL_ACCOUNT_NS, "FirstName").item(0);
-        assertEquals(firstName.getNodeName(), "FirstName");
+        assertEquals("FirstName", firstName.getNodeName());
 
         Document doc1 = docBuilder.newDocument();
         Element someName = doc1.createElement("newelem");
 
         someName.setUserData("mykey", "dd",
-            (operation, key,  data, src,  dst) ->  {
-                System.err.println("In UserDataHandler" + key);
-                System.out.println("In UserDataHandler");
-            });
-        Element impAccount = (Element)document.importNode(someName, true);
-        assertEquals(impAccount.getNodeName(), "newelem");
+                (operation, key, data, src, dst) -> {
+                    System.err.println("In UserDataHandler" + key);
+                    System.out.println("In UserDataHandler");
+                });
+        Element impAccount = (Element) document.importNode(someName, true);
+        assertEquals("newelem", impAccount.getNodeName());
         document.normalizeDocument();
         String data = (someName.getUserData("mykey")).toString();
-        assertEquals(data, "dd");
+        assertEquals("dd", data);
     }
 
 
     /**
      * Check the UTF-16 XMLEncoding xml file.
      *
-     * @throws Exception If any errors occur.
-     * @see <a href="content/movies.xml">movies.xml</a>
+     * @see <a href="content/movies-utf16.xml">movies-utf16.xml</a>
      */
-    @Test
-    public void testCheckingEncoding() throws Exception {
-        // Note since movies.xml is UTF-16 encoding. We're not using stanard XML
-        // file suffix.
-        String xmlFile = XML_DIR + "movies.xml.data";
+    @ParameterizedTest
+    @EnumSource(value=ByteOrder.class)
+    public void testCheckingEncoding(ByteOrder byteOrder) throws Exception {
+        String xmlFile = XML_DIR + "movies-utf16.xml";
 
-        try (InputStream source = bomStream("UTF-16", xmlFile)) {
+        // File is stored as UTF-8, but declares itself as UTF-16 for testing.
+        try (InputStream source = utf16Stream(xmlFile, byteOrder)) {
             DocumentBuilderFactory dbf = DocumentBuilderFactory.newInstance();
             dbf.setNamespaceAware(true);
             Document document = dbf.newDocumentBuilder().parse(source);
-            assertEquals(document.getXmlEncoding(), "UTF-16");
-            assertEquals(document.getXmlStandalone(), true);
+            assertEquals("UTF-16", document.getXmlEncoding());
+            assertTrue(document.getXmlStandalone());
         }
     }
 
@@ -210,7 +212,6 @@ public class AuctionController {
      * Check validation API features. A schema which is including in Bug 4909119
      * used to be testing for the functionalities.
      *
-     * @throws Exception If any errors occur.
      * @see <a href="content/userDetails.xsd">userDetails.xsd</a>
      */
     @Test
@@ -244,7 +245,6 @@ public class AuctionController {
     /**
      * Check grammar caching with imported schemas.
      *
-     * @throws Exception If any errors occur.
      * @see <a href="content/coins.xsd">coins.xsd</a>
      * @see <a href="content/coinsImportMe.xsd">coinsImportMe.xsd</a>
      */
@@ -279,7 +279,6 @@ public class AuctionController {
      * parsing using the SAXParser. SCHEMA_SOURCE attribute is using for this
      * test.
      *
-     * @throws Exception If any errors occur.
      * @see <a href="content/coins.xsd">coins.xsd</a>
      * @see <a href="content/coinsImportMe.xsd">coinsImportMe.xsd</a>
      */
@@ -304,7 +303,6 @@ public class AuctionController {
     /**
      * Check usage of javax.xml.datatype.Duration class.
      *
-     * @throws Exception If any errors occur.
      */
     @Test
     public void testGetItemDuration() throws Exception {
@@ -326,18 +324,17 @@ public class AuctionController {
         Duration sellDuration = DatatypeFactory.newInstance().newDuration(childList.item(0).getNodeValue());
         assertFalse(sellDuration.isShorterThan(duration));
         assertFalse(sellDuration.isLongerThan(duration));
-        assertEquals(sellDuration.getField(DatatypeConstants.DAYS), BigInteger.valueOf(365));
-        assertEquals(sellDuration.normalizeWith(new GregorianCalendar(1999, 2, 22)), duration);
+        assertEquals(BigInteger.valueOf(365), sellDuration.getField(DatatypeConstants.DAYS));
+        assertEquals(duration, sellDuration.normalizeWith(new GregorianCalendar(1999, 2, 22)));
 
         Duration myDuration = sellDuration.add(duration);
-        assertEquals(myDuration.normalizeWith(new GregorianCalendar(2003, 2, 22)),
-                DatatypeFactory.newInstance().newDuration("P730D"));
+        assertEquals(DatatypeFactory.newInstance().newDuration("P730D"),
+                myDuration.normalizeWith(new GregorianCalendar(2003, 2, 22)));
     }
 
     /**
      * Check usage of TypeInfo interface introduced in DOM L3.
      *
-     * @throws Exception If any errors occur.
      */
     @Test
     public void testGetTypeInfo() throws Exception {
@@ -354,12 +351,36 @@ public class AuctionController {
         Document document = docBuilder.parse(xmlFile);
         Element userId = (Element)document.getElementsByTagNameNS(PORTAL_ACCOUNT_NS, "UserID").item(0);
         TypeInfo typeInfo = userId.getSchemaTypeInfo();
-        assertTrue(typeInfo.getTypeName().equals("nonNegativeInteger"));
-        assertTrue(typeInfo.getTypeNamespace().equals(W3C_XML_SCHEMA_NS_URI));
+        assertEquals("nonNegativeInteger", typeInfo.getTypeName());
+        assertEquals(W3C_XML_SCHEMA_NS_URI, typeInfo.getTypeNamespace());
 
         Element role = (Element)document.getElementsByTagNameNS(PORTAL_ACCOUNT_NS, "Role").item(0);
         TypeInfo roletypeInfo = role.getSchemaTypeInfo();
-        assertTrue(roletypeInfo.getTypeName().equals("BuyOrSell"));
-        assertTrue(roletypeInfo.getTypeNamespace().equals(PORTAL_ACCOUNT_NS));
+        assertEquals("BuyOrSell", roletypeInfo.getTypeName());
+        assertEquals(PORTAL_ACCOUNT_NS, roletypeInfo.getTypeNamespace());
+    }
+
+    /** Convert file contents to a given character set with BOM marker. */
+    public static InputStream utf16Stream(String file, ByteOrder byteOrder)
+            throws IOException {
+        Charset charset;
+        byte[] head;
+        switch (byteOrder) {
+            case BIG_ENDIAN:
+                charset = StandardCharsets.UTF_16BE;
+                head = new byte[] { (byte) 0xFE, (byte) 0xFF };
+                break;
+            case LITTLE_ENDIAN:
+                charset = StandardCharsets.UTF_16LE;
+                head = new byte[] { (byte) 0xFF, (byte) 0xFE };
+                break;
+            default:
+                throw new AssertionError("Unsupported byte order: " + byteOrder);
+        }
+        byte[] content = Files.readString(Paths.get(file)).getBytes(charset);
+        ByteBuffer bb = ByteBuffer.allocate(head.length + content.length);
+        bb.put(head);
+        bb.put(content);
+        return new ByteArrayInputStream(bb.array());
     }
 }
diff --git a/test/jaxp/javax/xml/jaxp/functional/test/auctionportal/AuctionItemRepository.java b/test/jaxp/javax/xml/jaxp/functional/test/auctionportal/AuctionItemRepository.java
index 854cb7d1ad4..dca34a73d82 100644
--- a/test/jaxp/javax/xml/jaxp/functional/test/auctionportal/AuctionItemRepository.java
+++ b/test/jaxp/javax/xml/jaxp/functional/test/auctionportal/AuctionItemRepository.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -22,14 +22,31 @@
  */
 package test.auctionportal;
 
-import static jaxp.library.JAXPTestUtilities.setSystemProperty;
+import org.junit.jupiter.api.Test;
+import org.w3c.dom.Document;
+import org.xml.sax.SAXException;
+import org.xml.sax.SAXParseException;
+
+import javax.xml.parsers.DocumentBuilder;
+import javax.xml.parsers.DocumentBuilderFactory;
+import javax.xml.parsers.ParserConfigurationException;
+import javax.xml.parsers.SAXParser;
+import javax.xml.parsers.SAXParserFactory;
+import javax.xml.transform.TransformerFactory;
+import javax.xml.transform.dom.DOMSource;
+import javax.xml.transform.stream.StreamResult;
+import java.io.File;
+import java.io.FileInputStream;
+import java.io.FileOutputStream;
+import java.io.IOException;
+import java.io.InputStream;
+import java.nio.file.Paths;
 
 import static javax.xml.XMLConstants.FEATURE_SECURE_PROCESSING;
 import static javax.xml.XMLConstants.W3C_XML_SCHEMA_NS_URI;
-import static jaxp.library.JAXPTestUtilities.USER_DIR;
-import static jaxp.library.JAXPTestUtilities.compareDocumentWithGold;
-import static org.testng.Assert.assertFalse;
-import static org.testng.Assert.assertTrue;
+import static org.junit.jupiter.api.Assertions.assertFalse;
+import static org.junit.jupiter.api.Assertions.assertThrows;
+import static org.junit.jupiter.api.Assertions.assertTrue;
 import static test.auctionportal.HiBidConstants.GOLDEN_DIR;
 import static test.auctionportal.HiBidConstants.JAXP_SCHEMA_LANGUAGE;
 import static test.auctionportal.HiBidConstants.JAXP_SCHEMA_SOURCE;
@@ -37,30 +54,13 @@ import static test.auctionportal.HiBidConstants.SP_ENTITY_EXPANSION_LIMIT;
 import static test.auctionportal.HiBidConstants.SP_MAX_OCCUR_LIMIT;
 import static test.auctionportal.HiBidConstants.XML_DIR;
 
-import java.io.File;
-import java.io.FileInputStream;
-import java.io.FileOutputStream;
-import java.io.InputStream;
-
-import javax.xml.parsers.DocumentBuilder;
-import javax.xml.parsers.DocumentBuilderFactory;
-import javax.xml.parsers.SAXParser;
-import javax.xml.parsers.SAXParserFactory;
-import javax.xml.transform.TransformerFactory;
-import javax.xml.transform.dom.DOMSource;
-import javax.xml.transform.stream.StreamResult;
-
-import org.testng.annotations.Test;
-import org.w3c.dom.Document;
-import org.xml.sax.SAXParseException;
-
 /**
  * This is a test class for the Auction portal HiBid.com.
  */
 /*
  * @test
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm test.auctionportal.AuctionItemRepository
+ * @run junit/othervm test.auctionportal.AuctionItemRepository
  */
 public class AuctionItemRepository {
     /**
@@ -79,7 +79,6 @@ public class AuctionItemRepository {
      * not. Previous system property was changed to jdk.xml.entityExpansionLimit
      * see http://docs.oracle.com/javase/tutorial/jaxp/limits/limits.html.
      *
-     * @throws Exception If any errors occur.
      */
     @Test
     public void testEntityExpansionSAXPos() throws Exception {
@@ -88,7 +87,7 @@ public class AuctionItemRepository {
         // implementation limits.
         factory.setFeature(FEATURE_SECURE_PROCESSING, true);
         // Set entityExpansionLimit as 2 should expect fatalError
-        setSystemProperty(SP_ENTITY_EXPANSION_LIMIT, String.valueOf(128000));
+        System.setProperty(SP_ENTITY_EXPANSION_LIMIT, String.valueOf(128000));
         SAXParser parser = factory.newSAXParser();
 
         MyErrorHandler fatalHandler = new MyErrorHandler();
@@ -101,27 +100,25 @@ public class AuctionItemRepository {
      * not. Previous system property was changed to jdk.xml.entityExpansionLimit
      * see http://docs.oracle.com/javase/tutorial/jaxp/limits/limits.html.
      *
-     * @throws Exception If any errors occur.
      */
-    @Test(expectedExceptions = SAXParseException.class)
+    @Test
     public void testEntityExpansionSAXNeg() throws Exception {
         SAXParserFactory factory = SAXParserFactory.newInstance();
         // Secure processing will limit XML processing to conform to
         // implementation limits.
         factory.setFeature(FEATURE_SECURE_PROCESSING, true);
         // Set entityExpansionLimit as 2 should expect SAXParseException.
-        setSystemProperty(SP_ENTITY_EXPANSION_LIMIT, String.valueOf(2));
+        System.setProperty(SP_ENTITY_EXPANSION_LIMIT, String.valueOf(2));
 
         SAXParser parser = factory.newSAXParser();
         MyErrorHandler fatalHandler = new MyErrorHandler();
-        parser.parse(new File(ENTITY_XML), fatalHandler);
+        assertThrows(SAXParseException.class, () -> parser.parse(new File(ENTITY_XML), fatalHandler));
     }
 
     /**
      * Testing set MaxOccursLimit to 10000 in the secure processing enabled for
      * SAXParserFactory.
      *
-     * @throws Exception If any errors occur.
      */
     @Test
     public void testMaxOccurLimitPos() throws Exception {
@@ -130,7 +127,7 @@ public class AuctionItemRepository {
         SAXParserFactory factory = SAXParserFactory.newInstance();
         factory.setValidating(true);
         factory.setFeature(FEATURE_SECURE_PROCESSING, true);
-        setSystemProperty(SP_MAX_OCCUR_LIMIT, String.valueOf(10000));
+        System.setProperty(SP_MAX_OCCUR_LIMIT, String.valueOf(10000));
         SAXParser parser = factory.newSAXParser();
         parser.setProperty(JAXP_SCHEMA_LANGUAGE, W3C_XML_SCHEMA_NS_URI);
         parser.setProperty(JAXP_SCHEMA_SOURCE, new File(schema_file));
@@ -145,13 +142,12 @@ public class AuctionItemRepository {
      * Use a DocumentBuilder to create a DOM object and see if Secure Processing
      * feature affects the entity expansion.
      *
-     * @throws Exception If any errors occur.
      */
     @Test
     public void testEntityExpansionDOMPos() throws Exception  {
         DocumentBuilderFactory dfactory = DocumentBuilderFactory.newInstance();
         dfactory.setFeature(FEATURE_SECURE_PROCESSING, true);
-        setSystemProperty(SP_ENTITY_EXPANSION_LIMIT, String.valueOf(10000));
+        System.setProperty(SP_ENTITY_EXPANSION_LIMIT, String.valueOf(10000));
         DocumentBuilder dBuilder = dfactory.newDocumentBuilder();
         MyErrorHandler eh = new MyErrorHandler();
         dBuilder.setErrorHandler(eh);
@@ -164,27 +160,25 @@ public class AuctionItemRepository {
      * Processing feature and entityExpansionLimit value affects output.
      * Negative test that when entityExpansionLimit is too small.
      *
-     * @throws Exception If any errors occur.
      */
-    @Test(expectedExceptions = SAXParseException.class)
+    @Test
     public void testEntityExpansionDOMNeg() throws Exception {
         DocumentBuilderFactory dfactory = DocumentBuilderFactory.newInstance();
         dfactory.setFeature(FEATURE_SECURE_PROCESSING, true);
-        setSystemProperty(SP_ENTITY_EXPANSION_LIMIT, String.valueOf(2));
+        System.setProperty(SP_ENTITY_EXPANSION_LIMIT, String.valueOf(2));
         DocumentBuilder dBuilder = dfactory.newDocumentBuilder();
         MyErrorHandler eh = new MyErrorHandler();
         dBuilder.setErrorHandler(eh);
-        dBuilder.parse(ENTITY_XML);
+        assertThrows(SAXParseException.class, () -> dBuilder.parse(ENTITY_XML));
     }
 
     /**
      * Test xi:include with a SAXParserFactory.
      *
-     * @throws Exception If any errors occur.
      */
-    @Test(groups = {"readWriteLocalFiles"})
+    @Test
     public void testXIncludeSAXPos() throws Exception {
-        String resultFile = USER_DIR + "doc_xinclude.out";
+        String resultFile = "doc_xinclude.out";
         String goldFile = GOLDEN_DIR + "doc_xincludeGold.xml";
         String xmlFile = XML_DIR + "doc_xinclude.xml";
 
@@ -203,11 +197,10 @@ public class AuctionItemRepository {
      * Test the simple case of including a document using xi:include using a
      * DocumentBuilder.
      *
-     * @throws Exception If any errors occur.
      */
-    @Test(groups = {"readWriteLocalFiles"})
+    @Test
     public void testXIncludeDOMPos() throws Exception {
-        String resultFile = USER_DIR + "doc_xincludeDOM.out";
+        String resultFile = "doc_xincludeDOM.out";
         String goldFile = GOLDEN_DIR + "doc_xincludeGold.xml";
         String xmlFile = XML_DIR + "doc_xinclude.xml";
         try (FileOutputStream fos = new FileOutputStream(resultFile)) {
@@ -226,11 +219,10 @@ public class AuctionItemRepository {
      * Test the simple case of including a document using xi:include within a
      * xi:fallback using a DocumentBuilder.
      *
-     * @throws Exception If any errors occur.
      */
-    @Test(groups = {"readWriteLocalFiles"})
+    @Test
     public void testXIncludeFallbackDOMPos() throws Exception {
-        String resultFile = USER_DIR + "doc_fallbackDOM.out";
+        String resultFile = "doc_fallbackDOM.out";
         String goldFile = GOLDEN_DIR + "doc_fallbackGold.xml";
         String xmlFile = XML_DIR + "doc_fallback.xml";
         try (FileOutputStream fos = new FileOutputStream(resultFile)) {
@@ -250,11 +242,10 @@ public class AuctionItemRepository {
      * Test for xi:fallback where the fall back text is parsed as text. This
      * test uses a nested xi:include for the fallback test.
      *
-     * @throws Exception If any errors occur.
      */
-    @Test(groups = {"readWriteLocalFiles"})
+    @Test
     public void testXIncludeFallbackTextPos() throws Exception {
-        String resultFile = USER_DIR + "doc_fallback_text.out";
+        String resultFile = "doc_fallback_text.out";
         String goldFile = GOLDEN_DIR + "doc_fallback_textGold.xml";
         String xmlFile = XML_DIR + "doc_fallback_text.xml";
         try (FileOutputStream fos = new FileOutputStream(resultFile)) {
@@ -273,11 +264,10 @@ public class AuctionItemRepository {
     /**
      * Test the XPointer element() framework with XInclude.
      *
-     * @throws Exception If any errors occur.
      */
-    @Test(groups = {"readWriteLocalFiles"})
+    @Test
     public void testXpointerElementPos() throws Exception {
-        String resultFile = USER_DIR + "doc_xpointer_element.out";
+        String resultFile = "doc_xpointer_element.out";
         String goldFile = GOLDEN_DIR + "doc_xpointerGold.xml";
         String xmlFile = XML_DIR + "doc_xpointer_element.xml";
         try (FileOutputStream fos = new FileOutputStream(resultFile)) {
@@ -297,11 +287,10 @@ public class AuctionItemRepository {
     /**
      * Test the XPointer framework with a SAX object.
      *
-     * @throws Exception If any errors occur.
      */
-    @Test(groups = {"readWriteLocalFiles"})
+    @Test
     public void testXPointerPos() throws Exception {
-        String resultFile = USER_DIR + "doc_xpointer.out";
+        String resultFile = "doc_xpointer.out";
         String goldFile = GOLDEN_DIR + "doc_xpointerGold.xml";
         String xmlFile = XML_DIR + "doc_xpointer.xml";
 
@@ -320,11 +309,10 @@ public class AuctionItemRepository {
      * Test if xi:include may reference the doc containing the include if the
      * parse type is text.
      *
-     * @throws Exception If any errors occur.
      */
-    @Test(groups = {"readWriteLocalFiles"})
+    @Test
     public void testXIncludeLoopPos() throws Exception {
-        String resultFile = USER_DIR + "doc_xinc_loops.out";
+        String resultFile = "doc_xinc_loops.out";
         String goldFile = GOLDEN_DIR + "doc_xinc_loopGold.xml";
         String xmlFile = XML_DIR + "doc_xinc_loops.xml";
 
@@ -347,11 +335,10 @@ public class AuctionItemRepository {
      * Test if two non nested xi:include elements can include the same document
      * with an xi:include statement.
      *
-     * @throws Exception If any errors occur.
      */
-    @Test(groups = {"readWriteLocalFiles"})
+    @Test
     public void testXIncludeNestedPos() throws Exception {
-        String resultFile = USER_DIR + "schedule.out";
+        String resultFile = "schedule.out";
         String goldFile = GOLDEN_DIR + "scheduleGold.xml";
         String xmlFile = XML_DIR + "schedule.xml";
 
@@ -367,4 +354,20 @@ public class AuctionItemRepository {
         }
         assertTrue(compareDocumentWithGold(goldFile, resultFile));
     }
+
+    public static boolean compareDocumentWithGold(String goldfile, String resultFile)
+            throws ParserConfigurationException, SAXException, IOException {
+        DocumentBuilderFactory factory = DocumentBuilderFactory.newInstance();
+        factory.setNamespaceAware(true);
+        factory.setCoalescing(true);
+        factory.setIgnoringElementContentWhitespace(true);
+        factory.setIgnoringComments(true);
+        DocumentBuilder db = factory.newDocumentBuilder();
+
+        Document goldD = db.parse(Paths.get(goldfile).toFile());
+        goldD.normalizeDocument();
+        Document resultD = db.parse(Paths.get(resultFile).toFile());
+        resultD.normalizeDocument();
+        return goldD.isEqualNode(resultD);
+    }
 }
diff --git a/test/jaxp/javax/xml/jaxp/functional/test/auctionportal/content/movies.xml.data b/test/jaxp/javax/xml/jaxp/functional/test/auctionportal/content/movies-utf16.xml
similarity index 100%
rename from test/jaxp/javax/xml/jaxp/functional/test/auctionportal/content/movies.xml.data
rename to test/jaxp/javax/xml/jaxp/functional/test/auctionportal/content/movies-utf16.xml
diff --git a/test/jaxp/javax/xml/jaxp/functional/test/gaptest/Bug4511326.java b/test/jaxp/javax/xml/jaxp/functional/test/gaptest/Bug4511326.java
index a8bac488b8e..a9bb95e20a8 100644
--- a/test/jaxp/javax/xml/jaxp/functional/test/gaptest/Bug4511326.java
+++ b/test/jaxp/javax/xml/jaxp/functional/test/gaptest/Bug4511326.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,19 +23,18 @@
 
 package test.gaptest;
 
-import java.io.StringReader;
+import org.junit.jupiter.api.Test;
 
 import javax.xml.transform.TransformerConfigurationException;
 import javax.xml.transform.TransformerFactory;
 import javax.xml.transform.stream.StreamSource;
-
-import org.testng.annotations.Test;
+import java.io.StringReader;
 
 /*
  * @test
  * @bug 4511326
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm test.gaptest.Bug4511326
+ * @run junit/othervm test.gaptest.Bug4511326
  * @summary In forwards-compatible mode the attribute isn't ignored
  */
 public class Bug4511326 {
diff --git a/test/jaxp/javax/xml/jaxp/functional/test/gaptest/Bug4512806.java b/test/jaxp/javax/xml/jaxp/functional/test/gaptest/Bug4512806.java
index d27186bcf6d..2e7b05eaaac 100644
--- a/test/jaxp/javax/xml/jaxp/functional/test/gaptest/Bug4512806.java
+++ b/test/jaxp/javax/xml/jaxp/functional/test/gaptest/Bug4512806.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,24 +23,23 @@
 
 package test.gaptest;
 
-import static javax.xml.transform.OutputKeys.ENCODING;
-import static javax.xml.transform.OutputKeys.INDENT;
-import static org.testng.Assert.assertEquals;
-
-import java.io.StringReader;
+import org.junit.jupiter.api.Test;
 
 import javax.xml.transform.Transformer;
 import javax.xml.transform.TransformerConfigurationException;
 import javax.xml.transform.TransformerFactory;
 import javax.xml.transform.stream.StreamSource;
+import java.io.StringReader;
 
-import org.testng.annotations.Test;
+import static javax.xml.transform.OutputKeys.ENCODING;
+import static javax.xml.transform.OutputKeys.INDENT;
+import static org.junit.jupiter.api.Assertions.assertEquals;
 
 /*
  * @test
  * @bug 4512806
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm test.gaptest.Bug4512806
+ * @run junit/othervm test.gaptest.Bug4512806
  * @summary test transformer.setOutputProperties(null)
  */
 public class Bug4512806 {
@@ -57,13 +56,13 @@ public class Bug4512806 {
         transformer.setOutputProperty(INDENT, "no");
         transformer.setOutputProperty(ENCODING, "UTF-16");
 
-        assertEquals(printPropertyValue(INDENT), "indent=no");
-        assertEquals(printPropertyValue(ENCODING), "encoding=UTF-16");
+        assertEquals("indent=no", printPropertyValue(INDENT));
+        assertEquals("encoding=UTF-16", printPropertyValue(ENCODING));
 
         transformer.setOutputProperties(null);
 
-        assertEquals(printPropertyValue(INDENT), "indent=yes");
-        assertEquals(printPropertyValue(ENCODING), "encoding=UTF-8");
+        assertEquals("indent=yes", printPropertyValue(INDENT));
+        assertEquals("encoding=UTF-8", printPropertyValue(ENCODING));
 
     }
 
diff --git a/test/jaxp/javax/xml/jaxp/functional/test/gaptest/Bug4515047.java b/test/jaxp/javax/xml/jaxp/functional/test/gaptest/Bug4515047.java
index 5fc68a28a6b..8466c9cff79 100644
--- a/test/jaxp/javax/xml/jaxp/functional/test/gaptest/Bug4515047.java
+++ b/test/jaxp/javax/xml/jaxp/functional/test/gaptest/Bug4515047.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,6 +23,8 @@
 
 package test.gaptest;
 
+import org.junit.jupiter.api.Test;
+
 import javax.xml.parsers.DocumentBuilderFactory;
 import javax.xml.parsers.ParserConfigurationException;
 import javax.xml.transform.Transformer;
@@ -31,13 +33,11 @@ import javax.xml.transform.TransformerFactory;
 import javax.xml.transform.dom.DOMSource;
 import javax.xml.transform.stream.StreamResult;
 
-import org.testng.annotations.Test;
-
 /*
  * @test
  * @bug 4515047
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm test.gaptest.Bug4515047
+ * @run junit/othervm test.gaptest.Bug4515047
  * @summary test transform an empty dom source
  */
 public class Bug4515047 {
diff --git a/test/jaxp/javax/xml/jaxp/functional/test/gaptest/Bug4515660.java b/test/jaxp/javax/xml/jaxp/functional/test/gaptest/Bug4515660.java
index 014765f89d8..303db79f68b 100644
--- a/test/jaxp/javax/xml/jaxp/functional/test/gaptest/Bug4515660.java
+++ b/test/jaxp/javax/xml/jaxp/functional/test/gaptest/Bug4515660.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,14 +23,15 @@
 
 package test.gaptest;
 
-import static jaxp.library.JAXPTestUtilities.setSystemProperty;
-import static jaxp.library.JAXPTestUtilities.clearSystemProperty;
-
-import static org.testng.Assert.assertTrue;
-
-import java.io.IOException;
-import java.io.StringReader;
-import java.io.StringWriter;
+import org.junit.jupiter.api.AfterAll;
+import org.junit.jupiter.api.BeforeAll;
+import org.junit.jupiter.api.Test;
+import org.junit.jupiter.api.TestInstance;
+import org.junit.jupiter.api.parallel.Execution;
+import org.junit.jupiter.api.parallel.ExecutionMode;
+import org.xml.sax.InputSource;
+import org.xml.sax.SAXException;
+import org.xml.sax.helpers.XMLFilterImpl;
 
 import javax.xml.parsers.ParserConfigurationException;
 import javax.xml.parsers.SAXParserFactory;
@@ -41,32 +42,31 @@ import javax.xml.transform.TransformerFactory;
 import javax.xml.transform.sax.SAXSource;
 import javax.xml.transform.sax.SAXTransformerFactory;
 import javax.xml.transform.stream.StreamResult;
+import java.io.IOException;
+import java.io.StringReader;
+import java.io.StringWriter;
 
-import org.testng.annotations.AfterClass;
-import org.testng.annotations.BeforeClass;
-import org.testng.annotations.Test;
-import org.xml.sax.InputSource;
-import org.xml.sax.SAXException;
-import org.xml.sax.helpers.XMLFilterImpl;
+import static org.junit.jupiter.api.Assertions.assertTrue;
 
 /*
  * @test
  * @bug 4515660
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm test.gaptest.Bug4515660
+ * @run junit/othervm test.gaptest.Bug4515660
  * @summary verify property org.xml.sax.driver is used by SAXTransformerFactory
  */
-@Test(singleThreaded = true)
+@Execution(ExecutionMode.SAME_THREAD)
+@TestInstance(TestInstance.Lifecycle.PER_CLASS)
 public class Bug4515660 {
 
-    @BeforeClass
+    @BeforeAll
     public void setSaxDrier() {
-        setSystemProperty("org.xml.sax.driver", ReaderStub.class.getName());
+        System.setProperty("org.xml.sax.driver", ReaderStub.class.getName());
     }
 
-    @AfterClass
+    @AfterAll
     public void clearSaxDrier() {
-        clearSystemProperty("org.xml.sax.driver");
+        System.clearProperty("org.xml.sax.driver");
     }
 
     @Test
@@ -88,9 +88,13 @@ public class Bug4515660 {
 
     @Test
     public void testSAXTransformerFactory() throws TransformerConfigurationException {
-        final String xsl = "<?xml version='1.0'?>\n" + "<xsl:stylesheet" + " xmlns:xsl='http://www.w3.org/1999/XSL/Transform'" + " version='1.0'>\n"
-                + "   <xsl:template match='/'>Hello World!</xsl:template>\n" + "</xsl:stylesheet>\n";
-
+        final String xsl =
+                """
+                <?xml version='1.0'?>
+                <xsl:stylesheet xmlns:xsl='http://www.w3.org/1999/XSL/Transform' version='1.0'>
+                   <xsl:template match='/'>Hello World!</xsl:template>
+                </xsl:stylesheet>
+                """;
         ReaderStub.used = false;
 
         TransformerFactory transFactory = TransformerFactory.newInstance();
diff --git a/test/jaxp/javax/xml/jaxp/functional/test/gaptest/Bug4848653.java b/test/jaxp/javax/xml/jaxp/functional/test/gaptest/Bug4848653.java
index b8fe9e06814..edf2ef2d1c1 100644
--- a/test/jaxp/javax/xml/jaxp/functional/test/gaptest/Bug4848653.java
+++ b/test/jaxp/javax/xml/jaxp/functional/test/gaptest/Bug4848653.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -22,28 +22,27 @@
  */
 package test.gaptest;
 
-import static jaxp.library.JAXPTestUtilities.filenameToURL;
-import static test.gaptest.GapTestConst.XML_DIR;
-
-import java.io.IOException;
-
-import javax.xml.XMLConstants;
-import javax.xml.parsers.ParserConfigurationException;
-import javax.xml.parsers.SAXParser;
-import javax.xml.parsers.SAXParserFactory;
-
-import org.testng.annotations.Test;
+import org.junit.jupiter.api.Test;
 import org.xml.sax.ErrorHandler;
 import org.xml.sax.InputSource;
 import org.xml.sax.SAXException;
 import org.xml.sax.SAXParseException;
 import org.xml.sax.XMLReader;
 
+import javax.xml.XMLConstants;
+import javax.xml.parsers.ParserConfigurationException;
+import javax.xml.parsers.SAXParser;
+import javax.xml.parsers.SAXParserFactory;
+import java.io.IOException;
+import java.nio.file.Path;
+
+import static test.gaptest.GapTestConst.XML_DIR;
+
 /*
  * @test
  * @bug 4848653
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm test.gaptest.Bug4848653
+ * @run junit/othervm test.gaptest.Bug4848653
  * @summary Verify JAXP schemaLanguage property is ignored if setValidating(false)
  */
 public class Bug4848653 {
@@ -56,7 +55,8 @@ public class Bug4848653 {
         parser.setProperty("http://java.sun.com/xml/jaxp/properties/schemaLanguage", XMLConstants.W3C_XML_SCHEMA_NS_URI);
 
         String filename = XML_DIR + "Bug4848653.xml";
-        InputSource is = new InputSource(filenameToURL(filename));
+        String uri = Path.of(filename).toUri().toASCIIString();
+        InputSource is = new InputSource(uri);
         XMLReader xmlReader = parser.getXMLReader();
         xmlReader.setErrorHandler(new MyErrorHandler());
         xmlReader.parse(is);
diff --git a/test/jaxp/javax/xml/jaxp/functional/test/gaptest/Bug4858685.java b/test/jaxp/javax/xml/jaxp/functional/test/gaptest/Bug4858685.java
index 6ebcae5940d..7667d6ad140 100644
--- a/test/jaxp/javax/xml/jaxp/functional/test/gaptest/Bug4858685.java
+++ b/test/jaxp/javax/xml/jaxp/functional/test/gaptest/Bug4858685.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -22,43 +22,43 @@
  */
 package test.gaptest;
 
-import static jaxp.library.JAXPTestUtilities.filenameToURL;
-import static org.testng.Assert.assertEquals;
-import static test.gaptest.GapTestConst.GOLDEN_DIR;
-import static test.gaptest.GapTestConst.XML_DIR;
-
-import java.io.IOException;
-import java.nio.file.Files;
-import java.nio.file.Paths;
+import org.junit.jupiter.api.Test;
+import org.w3c.dom.NamedNodeMap;
+import org.w3c.dom.Node;
+import org.w3c.dom.NodeList;
 
 import javax.xml.transform.Transformer;
 import javax.xml.transform.TransformerException;
 import javax.xml.transform.TransformerFactory;
 import javax.xml.transform.dom.DOMResult;
 import javax.xml.transform.stream.StreamSource;
+import java.io.IOException;
+import java.nio.file.Files;
+import java.nio.file.Path;
+import java.nio.file.Paths;
 
-import org.testng.annotations.Test;
-import org.w3c.dom.NamedNodeMap;
-import org.w3c.dom.Node;
-import org.w3c.dom.NodeList;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static test.gaptest.GapTestConst.GOLDEN_DIR;
+import static test.gaptest.GapTestConst.XML_DIR;
 
 /*
  * @test
  * @bug 4858685 4894410
  * @library /javax/xml/jaxp/libs
- * @run testng/othervm test.gaptest.Bug4858685
+ * @run junit/othervm test.gaptest.Bug4858685
  * @summary test transforming text node
  */
 public class Bug4858685 {
     @Test
     public void test() throws TransformerException, IOException {
-        String uri = XML_DIR + "certificate.xml";
+        String filename = XML_DIR + "certificate.xml";
         TransformerFactory transformerFactory = TransformerFactory.newInstance();
 
         Transformer transformer = transformerFactory.newTransformer();
 
         // use URI as a StreamSource
-        StreamSource streamSource = new StreamSource(filenameToURL(uri));
+        String uri = Path.of(filename).toUri().toASCIIString();
+        StreamSource streamSource = new StreamSource(uri);
 
         DOMResult domResult = new DOMResult();
 
@@ -66,12 +66,8 @@ public class Bug4858685 {
         transformer.transform(streamSource, domResult);
 
         // dump DOM in a human readable form
-        String gotString = DOMDump.dumpDom(domResult.getNode());
-
         String goldenString = new String(Files.readAllBytes(Paths.get(GOLDEN_DIR + "Bug4858685.txt")));
-
-        assertEquals(gotString, goldenString);
-
+        assertEquals(goldenString, DOMDump.dumpDom(domResult.getNode()));
     }
 
     /**
diff --git a/test/jaxp/javax/xml/jaxp/libs/org/w3c/dom/ptests/DOMTestUtil.java b/test/jaxp/javax/xml/jaxp/libs/org/w3c/dom/ptests/DOMTestUtil.java
index 6b32aa36e74..c4239606135 100644
--- a/test/jaxp/javax/xml/jaxp/libs/org/w3c/dom/ptests/DOMTestUtil.java
+++ b/test/jaxp/javax/xml/jaxp/libs/org/w3c/dom/ptests/DOMTestUtil.java
@@ -22,11 +22,9 @@
  */
 package org.w3c.dom.ptests;
 
-import static jaxp.library.JAXPTestUtilities.FILE_SEP;
-import static jaxp.library.JAXPTestUtilities.getPathByClassName;
-
 import java.io.File;
 import java.io.IOException;
+import java.nio.file.Path;
 
 import javax.xml.parsers.DocumentBuilder;
 import javax.xml.parsers.DocumentBuilderFactory;
@@ -39,15 +37,22 @@ import org.xml.sax.SAXException;
  * This class defines the path constant and common method
  */
 public class DOMTestUtil {
+    private static final Path TEST_SRC = Path.of(System.getProperty("test.src")).toAbsolutePath();
+
+    private static String forwardSlashDir(Path p) {
+        // Convention in these tests is to include trailing '/' in directory strings.
+        return p.toString().replace(File.separatorChar, '/') + '/';
+    }
+
     /*
      * XML source file directory.
      */
-    public static final String XML_DIR = getPathByClassName(DOMTestUtil.class, ".." + FILE_SEP + "xmlfiles");
+    public static final String XML_DIR = forwardSlashDir(TEST_SRC.resolveSibling("xmlfiles"));
 
     /*
      * Golden validation files directory.
      */
-    public static final String GOLDEN_DIR = getPathByClassName(DOMTestUtil.class, ".." + FILE_SEP + "xmlfiles" + FILE_SEP + "out");
+    public static final String GOLDEN_DIR = XML_DIR + "out/";
 
     /*
      * Error Message for DOMException being expected.
diff --git a/test/jaxp/javax/xml/jaxp/libs/org/xml/sax/ptests/SAXTestConst.java b/test/jaxp/javax/xml/jaxp/libs/org/xml/sax/ptests/SAXTestConst.java
index 6798d7879dc..ea35a484cdf 100644
--- a/test/jaxp/javax/xml/jaxp/libs/org/xml/sax/ptests/SAXTestConst.java
+++ b/test/jaxp/javax/xml/jaxp/libs/org/xml/sax/ptests/SAXTestConst.java
@@ -22,8 +22,8 @@
  */
 package org.xml.sax.ptests;
 
-import static jaxp.library.JAXPTestUtilities.FILE_SEP;
-import static jaxp.library.JAXPTestUtilities.getPathByClassName;
+import java.io.File;
+import java.nio.file.Path;
 
 /**
  * This is the Base test class provide basic support for JAXP SAX functional
@@ -31,16 +31,20 @@ import static jaxp.library.JAXPTestUtilities.getPathByClassName;
  * has their own TestBase class.
  */
 public class SAXTestConst {
+    private static final Path TEST_SRC = Path.of(System.getProperty("test.src")).toAbsolutePath();
+
+    private static String forwardSlashDir(Path p) {
+        // Convention in these tests is to include trailing '/' in directory strings.
+        return p.toString().replace(File.separatorChar, '/') + '/';
+    }
+
     /**
      * XML source file directory.
      */
-    public static final String XML_DIR = getPathByClassName(SAXTestConst.class,
-            ".." + FILE_SEP + "xmlfiles");
-
+    public static final String XML_DIR = forwardSlashDir(TEST_SRC.resolveSibling("xmlfiles"));
 
     /**
      * Golden validation files directory.
      */
-    public static final String GOLDEN_DIR = getPathByClassName(SAXTestConst.class,
-            ".." + FILE_SEP + "xmlfiles" + FILE_SEP + "out");
+    public static final String GOLDEN_DIR = XML_DIR + "out/";
 }
diff --git a/test/jaxp/javax/xml/jaxp/libs/test/astro/AstroConstants.java b/test/jaxp/javax/xml/jaxp/libs/test/astro/AstroConstants.java
index b3f2cb6e5c6..9645832c896 100644
--- a/test/jaxp/javax/xml/jaxp/libs/test/astro/AstroConstants.java
+++ b/test/jaxp/javax/xml/jaxp/libs/test/astro/AstroConstants.java
@@ -23,10 +23,14 @@
 
 package test.astro;
 
+import java.nio.file.Path;
+
 import static java.io.File.separator;
-import static jaxp.library.JAXPTestUtilities.getPathByClassName;
 
 public class AstroConstants {
+    private static final Path XML_FILES =
+            Path.of(System.getProperty("test.src")).resolve("xmlfiles").toAbsolutePath();
+
     // Query parameters :
 
     public static final double RA_MIN = 0.0; // hours
@@ -36,7 +40,7 @@ public class AstroConstants {
 
     // Stylesheet source paths:
 
-    public static final String XSLPATH = getPathByClassName(AstroConstants.class, "xmlfiles" + separator + "xsl");
+    public static final String XSLPATH = XML_FILES.resolve("xsl").toString() + separator;
     public static final String RAXSL = XSLPATH + "ra.xsl";
     public static final String DECXSL = XSLPATH + "dec.xsl";
     public static final String RADECXSL = XSLPATH + "radec.xsl";
@@ -51,10 +55,9 @@ public class AstroConstants {
 
     // Catalog references
 
-    public static final String ASTROCAT = getPathByClassName(AstroConstants.class, "xmlfiles") + "catalog.xml";
+    public static final String ASTROCAT = XML_FILES.resolve("catalog.xml").toString();
 
-
-    public static final String GOLDEN_DIR = getPathByClassName(AstroConstants.class, "xmlfiles" + separator + "gold");
+    public static final String GOLDEN_DIR = XML_FILES.resolve("gold").toString() + separator;
     public static final String JAXP_SCHEMA_LANGUAGE = "http://java.sun.com/xml/jaxp/properties/schemaLanguage";
     public static final String JAXP_SCHEMA_SOURCE = "http://java.sun.com/xml/jaxp/properties/schemaSource";
 }
diff --git a/test/jaxp/javax/xml/jaxp/libs/test/astro/DOMFilterFactoryImpl.java b/test/jaxp/javax/xml/jaxp/libs/test/astro/DOMFilterFactoryImpl.java
index e232fb61fcc..32c34673846 100644
--- a/test/jaxp/javax/xml/jaxp/libs/test/astro/DOMFilterFactoryImpl.java
+++ b/test/jaxp/javax/xml/jaxp/libs/test/astro/DOMFilterFactoryImpl.java
@@ -22,12 +22,12 @@
  */
 package test.astro;
 
-import static jaxp.library.JAXPTestUtilities.filenameToURL;
 import static test.astro.AstroConstants.DECXSL;
 import static test.astro.AstroConstants.RAXSL;
 import static test.astro.AstroConstants.STYPEXSL;
 
 import java.io.IOException;
+import java.nio.file.Path;
 
 import javax.xml.parsers.DocumentBuilderFactory;
 import javax.xml.parsers.ParserConfigurationException;
@@ -75,6 +75,7 @@ public class DOMFilterFactoryImpl extends SourceFilterFactory {
     private Document getStylesheetDOM(String xslfilename) throws SAXException, IOException, ParserConfigurationException {
         DocumentBuilderFactory dbf = DocumentBuilderFactory.newInstance();
         dbf.setNamespaceAware(true);
-        return dbf.newDocumentBuilder().parse(filenameToURL(xslfilename));
+        String xslUri = Path.of(xslfilename).toUri().toASCIIString();
+        return dbf.newDocumentBuilder().parse(xslUri);
     }
 }
diff --git a/test/jaxp/javax/xml/jaxp/libs/test/astro/DOML3InputSourceFactoryImpl.java b/test/jaxp/javax/xml/jaxp/libs/test/astro/DOML3InputSourceFactoryImpl.java
index 2f4170b21ce..6fde37c79ab 100644
--- a/test/jaxp/javax/xml/jaxp/libs/test/astro/DOML3InputSourceFactoryImpl.java
+++ b/test/jaxp/javax/xml/jaxp/libs/test/astro/DOML3InputSourceFactoryImpl.java
@@ -22,22 +22,6 @@
  */
 package test.astro;
 
-import static jaxp.library.JAXPTestUtilities.filenameToURL;
-import static jaxp.library.JAXPTestUtilities.USER_DIR;
-import static org.w3c.dom.ls.DOMImplementationLS.MODE_SYNCHRONOUS;
-import static org.w3c.dom.traversal.NodeFilter.SHOW_ELEMENT;
-
-import java.io.ByteArrayInputStream;
-import java.io.FileReader;
-import java.io.FileWriter;
-import java.io.InputStreamReader;
-import java.io.Reader;
-import java.nio.file.Files;
-import java.nio.file.Paths;
-
-import javax.xml.parsers.DocumentBuilder;
-import javax.xml.parsers.DocumentBuilderFactory;
-
 import org.w3c.dom.DOMConfiguration;
 import org.w3c.dom.Document;
 import org.w3c.dom.Element;
@@ -50,6 +34,20 @@ import org.w3c.dom.ls.LSSerializer;
 import org.w3c.dom.ls.LSSerializerFilter;
 import org.xml.sax.InputSource;
 
+import javax.xml.parsers.DocumentBuilder;
+import javax.xml.parsers.DocumentBuilderFactory;
+import java.io.ByteArrayInputStream;
+import java.io.FileReader;
+import java.io.FileWriter;
+import java.io.InputStreamReader;
+import java.io.Reader;
+import java.nio.file.Files;
+import java.nio.file.Path;
+import java.nio.file.Paths;
+
+import static org.w3c.dom.ls.DOMImplementationLS.MODE_SYNCHRONOUS;
+import static org.w3c.dom.traversal.NodeFilter.SHOW_ELEMENT;
+
 /*
  * A specialized implementation of an Input Source factory that utilizes
  * DOM Level 3 implementations to build a Document (DOM) from the
@@ -72,7 +70,7 @@ public class DOML3InputSourceFactoryImpl implements InputSourceFactory {
         Document doc = null;
         LSInput src = impl.createLSInput();
         // register the input file with the input source...
-        String systemId = filenameToURL(filename);
+        String systemId = Path.of(filename).toUri().toASCIIString();
         src.setSystemId(systemId);
         try (Reader reader = new FileReader(filename)) {
             src.setCharacterStream(reader);
@@ -82,7 +80,7 @@ public class DOML3InputSourceFactoryImpl implements InputSourceFactory {
 
         // Use DOM L3 LSSerializer (previously called a DOMWriter)
         // to serialize the xml doc DOM to a file stream.
-        String tmpCatalog = Files.createTempFile(Paths.get(USER_DIR), "catalog.xml", null).toString();
+        String tmpCatalog = Files.createTempFile(Paths.get("."), "catalog.xml", null).toString();
 
         LSSerializer domserializer = impl.createLSSerializer();
         domserializer.setFilter(new MyDOMWriterFilter());
diff --git a/test/jaxp/javax/xml/jaxp/libs/test/astro/InputSourceFactoryImpl.java b/test/jaxp/javax/xml/jaxp/libs/test/astro/InputSourceFactoryImpl.java
index a2c5b8319c8..d5ccdbf70e6 100644
--- a/test/jaxp/javax/xml/jaxp/libs/test/astro/InputSourceFactoryImpl.java
+++ b/test/jaxp/javax/xml/jaxp/libs/test/astro/InputSourceFactoryImpl.java
@@ -22,10 +22,10 @@
  */
 package test.astro;
 
-import static jaxp.library.JAXPTestUtilities.filenameToURL;
-
 import org.xml.sax.InputSource;
 
+import java.nio.file.Path;
+
 /*
  * Default implementation of a input source factory. This is the most
  * straight forward way to create a sax input source and set it's
@@ -38,7 +38,8 @@ public class InputSourceFactoryImpl implements InputSourceFactory {
 
     public InputSource newInputSource(String filename) {
         InputSource catSrc = new InputSource(filename);
-        catSrc.setSystemId(filenameToURL(filename));
+        String uri = Path.of(filename).toUri().toASCIIString();
+        catSrc.setSystemId(uri);
         return catSrc;
     }
 }
diff --git a/test/jaxp/javax/xml/jaxp/libs/test/astro/SAXFilterFactoryImpl.java b/test/jaxp/javax/xml/jaxp/libs/test/astro/SAXFilterFactoryImpl.java
index 4ef5d3cc259..403c0a70460 100644
--- a/test/jaxp/javax/xml/jaxp/libs/test/astro/SAXFilterFactoryImpl.java
+++ b/test/jaxp/javax/xml/jaxp/libs/test/astro/SAXFilterFactoryImpl.java
@@ -22,22 +22,22 @@
  */
 package test.astro;
 
-import static jaxp.library.JAXPTestUtilities.filenameToURL;
-import static test.astro.AstroConstants.DECENTXSL;
-import static test.astro.AstroConstants.DECXSL;
-import static test.astro.AstroConstants.RAENTXSL;
-import static test.astro.AstroConstants.STYPEXSL;
-import static test.astro.AstroConstants.TOPTEMPLXSL;
+import org.xml.sax.EntityResolver;
+import org.xml.sax.InputSource;
+import org.xml.sax.SAXException;
+import org.xml.sax.XMLReader;
 
 import javax.xml.parsers.ParserConfigurationException;
 import javax.xml.parsers.SAXParserFactory;
 import javax.xml.transform.Source;
 import javax.xml.transform.sax.SAXSource;
+import java.nio.file.Path;
 
-import org.xml.sax.EntityResolver;
-import org.xml.sax.InputSource;
-import org.xml.sax.SAXException;
-import org.xml.sax.XMLReader;
+import static test.astro.AstroConstants.DECENTXSL;
+import static test.astro.AstroConstants.DECXSL;
+import static test.astro.AstroConstants.RAENTXSL;
+import static test.astro.AstroConstants.STYPEXSL;
+import static test.astro.AstroConstants.TOPTEMPLXSL;
 
 /*
  * Implementation of the filter factory interface that utilizes SAX
@@ -51,7 +51,7 @@ import org.xml.sax.XMLReader;
  *
  */
 public class SAXFilterFactoryImpl extends SourceFilterFactory {
-    private EntityResolver entityResolver;
+    private final EntityResolver entityResolver;
 
     public SAXFilterFactoryImpl() {
         super();
@@ -60,7 +60,8 @@ public class SAXFilterFactoryImpl extends SourceFilterFactory {
 
     @Override
     protected Source getSource(String xslFileName) throws SAXException, ParserConfigurationException {
-        SAXSource saxsource = new SAXSource(new InputSource(filenameToURL(xslFileName)));
+        String xslUri = Path.of(xslFileName).toUri().toASCIIString();
+        SAXSource saxsource = new SAXSource(new InputSource(xslUri));
         saxsource.setXMLReader(getXMLReader());
         return saxsource;
     }
@@ -97,7 +98,8 @@ public class SAXFilterFactoryImpl extends SourceFilterFactory {
         public InputSource resolveEntity(String publicid, String sysId) {
             if (sysId.equals("http://astro.com/stylesheets/toptemplate")) {
                 InputSource retval = new InputSource(TOPTEMPLXSL);
-                retval.setSystemId(filenameToURL(TOPTEMPLXSL));
+                String xslUri = Path.of(TOPTEMPLXSL).toUri().toASCIIString();
+                retval.setSystemId(xslUri);
                 return retval;
             } else {
                 return null; // use default behavior
diff --git a/test/jaxp/javax/xml/jaxp/libs/test/astro/StreamFilterFactoryImpl.java b/test/jaxp/javax/xml/jaxp/libs/test/astro/StreamFilterFactoryImpl.java
index 0978161312e..38e864f6897 100644
--- a/test/jaxp/javax/xml/jaxp/libs/test/astro/StreamFilterFactoryImpl.java
+++ b/test/jaxp/javax/xml/jaxp/libs/test/astro/StreamFilterFactoryImpl.java
@@ -22,7 +22,6 @@
  */
 package test.astro;
 
-import static jaxp.library.JAXPTestUtilities.filenameToURL;
 import static test.astro.AstroConstants.DECXSL;
 import static test.astro.AstroConstants.RADECXSL;
 import static test.astro.AstroConstants.RAXSL;
@@ -30,11 +29,13 @@ import static test.astro.AstroConstants.STYPEXSL;
 
 import javax.xml.transform.Source;
 import javax.xml.transform.stream.StreamSource;
+import java.nio.file.Path;
 
 public class StreamFilterFactoryImpl extends SourceFilterFactory {
     @Override
     protected Source getSource(String xslFileName) {
-        return new StreamSource(filenameToURL(xslFileName));
+        String xslUri = Path.of(xslFileName).toUri().toASCIIString();
+        return new StreamSource(xslUri);
     }
 
     @Override
diff --git a/test/jaxp/javax/xml/jaxp/libs/test/astro/TemplatesFilterFactoryImpl.java b/test/jaxp/javax/xml/jaxp/libs/test/astro/TemplatesFilterFactoryImpl.java
index 09a71b1a534..6047d0c5ae8 100644
--- a/test/jaxp/javax/xml/jaxp/libs/test/astro/TemplatesFilterFactoryImpl.java
+++ b/test/jaxp/javax/xml/jaxp/libs/test/astro/TemplatesFilterFactoryImpl.java
@@ -22,13 +22,13 @@
  */
 package test.astro;
 
-import static jaxp.library.JAXPTestUtilities.filenameToURL;
 import static test.astro.AstroConstants.DECXSL;
 import static test.astro.AstroConstants.RAURIXSL;
 import static test.astro.AstroConstants.STYPEXSL;
 import static test.astro.AstroConstants.TOPTEMPLINCXSL;
 
 import java.io.IOException;
+import java.nio.file.Path;
 
 import javax.xml.parsers.ParserConfigurationException;
 import javax.xml.parsers.SAXParserFactory;
@@ -94,7 +94,8 @@ public class TemplatesFilterFactoryImpl extends AbstractFilterFactory {
         // create the stylesheet input source
         InputSource xslSrc = new InputSource(xslFileName);
 
-        xslSrc.setSystemId(filenameToURL(xslFileName));
+        String xslUri = Path.of(xslFileName).toUri().toASCIIString();
+        xslSrc.setSystemId(xslUri);
         // hook up the templates handler as the xsl content handler
         xmlreader.setContentHandler(templatesHandler);
         // call parse on the xsl input source
@@ -113,7 +114,8 @@ public class TemplatesFilterFactoryImpl extends AbstractFilterFactory {
         public Source resolve(String href, String base) throws TransformerException {
             if ("http://astro.com/stylesheets/topleveltemplate".equals(href)) {
                 StreamSource ss = new StreamSource(TOPTEMPLINCXSL);
-                ss.setSystemId(filenameToURL(TOPTEMPLINCXSL));
+                String xslUri = Path.of(TOPTEMPLINCXSL).toUri().toASCIIString();
+                ss.setSystemId(xslUri);
                 return ss;
             } else {
                 return null;
diff --git a/test/jaxp/javax/xml/jaxp/libs/test/auctionportal/HiBidConstants.java b/test/jaxp/javax/xml/jaxp/libs/test/auctionportal/HiBidConstants.java
index 5c812c52b04..7852540a308 100644
--- a/test/jaxp/javax/xml/jaxp/libs/test/auctionportal/HiBidConstants.java
+++ b/test/jaxp/javax/xml/jaxp/libs/test/auctionportal/HiBidConstants.java
@@ -22,21 +22,29 @@
  */
 package test.auctionportal;
 
-import static jaxp.library.JAXPTestUtilities.getPathByClassName;
+import java.io.File;
+import java.nio.file.Path;
 
 /**
  * This is the Base test class provide basic support for Auction portal test.
  */
 public class HiBidConstants {
+    private static final Path TEST_SRC = Path.of(System.getProperty("test.src")).toAbsolutePath();
+
+    private static String forwardSlashDir(Path p) {
+        // Convention in these tests is to include trailing '/' in directory strings.
+        return p.toString().replace(File.separatorChar, '/') + '/';
+    }
+
     /**
      * XML source file directory.
      */
-    public static final String XML_DIR = getPathByClassName(HiBidConstants.class, "content");
+    public static final String XML_DIR = forwardSlashDir(TEST_SRC.resolve("content"));
 
     /**
      * Golden validation files directory.
      */
-    public static final String GOLDEN_DIR = getPathByClassName(HiBidConstants.class, "golden");
+    public static final String GOLDEN_DIR = forwardSlashDir(TEST_SRC.resolve("golden"));
 
     /**
      * Name space for account operation.
diff --git a/test/jaxp/javax/xml/jaxp/libs/test/gaptest/GapTestConst.java b/test/jaxp/javax/xml/jaxp/libs/test/gaptest/GapTestConst.java
index 237d0ac6ed2..648a6c2be10 100644
--- a/test/jaxp/javax/xml/jaxp/libs/test/gaptest/GapTestConst.java
+++ b/test/jaxp/javax/xml/jaxp/libs/test/gaptest/GapTestConst.java
@@ -22,20 +22,27 @@
  */
 package test.gaptest;
 
-import static jaxp.library.JAXPTestUtilities.FILE_SEP;
-import static jaxp.library.JAXPTestUtilities.getPathByClassName;
+import java.io.File;
+import java.nio.file.Path;
 
 /**
  * This class defines the path constant
  */
 public class GapTestConst {
+    private static final Path TEST_SRC = Path.of(System.getProperty("test.src")).toAbsolutePath();
+
+    private static String forwardSlashDir(Path p) {
+        // Convention in these tests is to include trailing '/' in directory strings.
+        return p.toString().replace(File.separatorChar, '/') + '/';
+    }
+
     /**
      * XML source file directory.
      */
-    public static final String XML_DIR = getPathByClassName(GapTestConst.class, "xmlfiles");
+    public static final String XML_DIR = forwardSlashDir(TEST_SRC.resolve("xmlfiles"));
 
     /**
      * Golden validation files directory.
      */
-    public static final String GOLDEN_DIR = getPathByClassName(GapTestConst.class, "xmlfiles" + FILE_SEP + "out");
+    public static final String GOLDEN_DIR = XML_DIR + "out/";
 }

From abb9c33cedac730753dd3aaebd101532a1aa70a1 Mon Sep 17 00:00:00 2001
From: Prasanta Sadhukhan <psadhukhan@openjdk.org>
Date: Wed, 18 Mar 2026 01:14:16 +0000
Subject: [PATCH 227/655] 8380125: Formatting issue for few swing classes

Reviewed-by: honkar, azvegint
---
 .../share/classes/javax/swing/AbstractButton.java    |  4 ++--
 .../javax/swing/ActionPropertyChangeListener.java    |  2 +-
 .../share/classes/javax/swing/AncestorNotifier.java  |  2 +-
 .../share/classes/javax/swing/ArrayTable.java        |  6 +++---
 .../share/classes/javax/swing/JComboBox.java         |  4 ++--
 .../share/classes/javax/swing/JList.java             |  2 +-
 .../share/classes/javax/swing/JPopupMenu.java        |  6 +++---
 .../share/classes/javax/swing/JTextField.java        |  4 ++--
 .../share/classes/javax/swing/JTree.java             |  2 +-
 .../share/classes/javax/swing/KeyboardManager.java   |  2 +-
 .../share/classes/javax/swing/PopupFactory.java      |  2 +-
 .../share/classes/javax/swing/SwingUtilities.java    |  2 +-
 .../share/classes/javax/swing/UIDefaults.java        |  4 ++--
 .../javax/swing/plaf/basic/BasicComboPopup.java      |  4 ++--
 .../classes/javax/swing/plaf/basic/BasicListUI.java  |  2 +-
 .../javax/swing/plaf/basic/BasicMenuBarUI.java       | 10 +++++-----
 .../javax/swing/plaf/basic/BasicPopupMenuUI.java     |  2 +-
 .../javax/swing/plaf/basic/BasicSpinnerUI.java       |  2 +-
 .../javax/swing/plaf/basic/BasicSplitPaneUI.java     | 12 ++++++------
 .../javax/swing/plaf/basic/BasicTabbedPaneUI.java    |  4 ++--
 .../javax/swing/plaf/basic/BasicToolBarUI.java       |  4 ++--
 .../classes/javax/swing/plaf/basic/BasicTreeUI.java  |  2 +-
 .../swing/plaf/nimbus/AbstractRegionPainter.java     |  2 +-
 .../javax/swing/plaf/nimbus/NimbusLookAndFeel.java   |  2 +-
 .../javax/swing/plaf/nimbus/SynthPainterImpl.java    |  6 +++---
 .../javax/swing/plaf/synth/SynthComboBoxUI.java      |  2 +-
 .../javax/swing/plaf/synth/SynthScrollPaneUI.java    |  2 +-
 .../classes/javax/swing/text/JTextComponent.java     |  2 +-
 .../share/classes/javax/swing/text/TextAction.java   |  4 ++--
 .../javax/swing/tree/DefaultTreeCellEditor.java      |  2 +-
 .../share/classes/sun/swing/SwingUtilities2.java     |  6 +++---
 31 files changed, 56 insertions(+), 56 deletions(-)

diff --git a/src/java.desktop/share/classes/javax/swing/AbstractButton.java b/src/java.desktop/share/classes/javax/swing/AbstractButton.java
index d4112b5ed04..a1961acce29 100644
--- a/src/java.desktop/share/classes/javax/swing/AbstractButton.java
+++ b/src/java.desktop/share/classes/javax/swing/AbstractButton.java
@@ -1070,13 +1070,13 @@ public abstract class AbstractButton extends JComponent implements ItemSelectabl
         Action oldValue = getAction();
         if (action==null || !action.equals(a)) {
             action = a;
-            if (oldValue!=null) {
+            if (oldValue != null) {
                 removeActionListener(oldValue);
                 oldValue.removePropertyChangeListener(actionPropertyChangeListener);
                 actionPropertyChangeListener = null;
             }
             configurePropertiesFromAction(action);
-            if (action!=null) {
+            if (action != null) {
                 // Don't add if it is already a listener
                 if (!isListener(ActionListener.class, action)) {
                     addActionListener(action);
diff --git a/src/java.desktop/share/classes/javax/swing/ActionPropertyChangeListener.java b/src/java.desktop/share/classes/javax/swing/ActionPropertyChangeListener.java
index db12b6766b8..19b9152a1b5 100644
--- a/src/java.desktop/share/classes/javax/swing/ActionPropertyChangeListener.java
+++ b/src/java.desktop/share/classes/javax/swing/ActionPropertyChangeListener.java
@@ -111,7 +111,7 @@ abstract class ActionPropertyChangeListener<T extends JComponent>
         while ((r = (OwnedWeakReference)queue.poll()) != null) {
             ActionPropertyChangeListener<?> oldPCL = r.getOwner();
             Action oldAction = oldPCL.getAction();
-            if (oldAction!=null) {
+            if (oldAction != null) {
                 oldAction.removePropertyChangeListener(oldPCL);
             }
         }
diff --git a/src/java.desktop/share/classes/javax/swing/AncestorNotifier.java b/src/java.desktop/share/classes/javax/swing/AncestorNotifier.java
index f3cfdd9d0ba..a3ed463d2d5 100644
--- a/src/java.desktop/share/classes/javax/swing/AncestorNotifier.java
+++ b/src/java.desktop/share/classes/javax/swing/AncestorNotifier.java
@@ -213,7 +213,7 @@ class AncestorNotifier implements ComponentListener, PropertyChangeListener, Ser
     public void propertyChange(PropertyChangeEvent evt) {
         String s = evt.getPropertyName();
 
-        if (s!=null && (s.equals("parent") || s.equals("ancestor"))) {
+        if (s != null && (s.equals("parent") || s.equals("ancestor"))) {
             JComponent component = (JComponent)evt.getSource();
 
             if (evt.getNewValue() != null) {
diff --git a/src/java.desktop/share/classes/javax/swing/ArrayTable.java b/src/java.desktop/share/classes/javax/swing/ArrayTable.java
index 7c38f9fb577..282bd3454ca 100644
--- a/src/java.desktop/share/classes/javax/swing/ArrayTable.java
+++ b/src/java.desktop/share/classes/javax/swing/ArrayTable.java
@@ -145,7 +145,7 @@ class ArrayTable implements Cloneable {
      */
     public Object get(Object key) {
         Object value = null;
-        if (table !=null) {
+        if (table != null) {
             if (isArray()) {
                 Object[] array = (Object[])table;
                 for (int i = 0; i<array.length-1; i+=2) {
@@ -181,7 +181,7 @@ class ArrayTable implements Cloneable {
      */
     public boolean containsKey(Object key) {
         boolean contains = false;
-        if (table !=null) {
+        if (table != null) {
             if (isArray()) {
                 Object[] array = (Object[])table;
                 for (int i = 0; i<array.length-1; i+=2) {
@@ -206,7 +206,7 @@ class ArrayTable implements Cloneable {
         if (key==null) {
             return null;
         }
-        if (table !=null) {
+        if (table != null) {
             if (isArray()){
                 // Is key on the list?
                 int index = -1;
diff --git a/src/java.desktop/share/classes/javax/swing/JComboBox.java b/src/java.desktop/share/classes/javax/swing/JComboBox.java
index 67600ad323a..af7c5a01a7e 100644
--- a/src/java.desktop/share/classes/javax/swing/JComboBox.java
+++ b/src/java.desktop/share/classes/javax/swing/JComboBox.java
@@ -1103,13 +1103,13 @@ implements ItemSelectable,ListDataListener,ActionListener, Accessible {
         Action oldValue = getAction();
         if (action==null || !action.equals(a)) {
             action = a;
-            if (oldValue!=null) {
+            if (oldValue != null) {
                 removeActionListener(oldValue);
                 oldValue.removePropertyChangeListener(actionPropertyChangeListener);
                 actionPropertyChangeListener = null;
             }
             configurePropertiesFromAction(action);
-            if (action!=null) {
+            if (action != null) {
                 // Don't add if it is already a listener
                 if (!isListener(ActionListener.class, action)) {
                     addActionListener(action);
diff --git a/src/java.desktop/share/classes/javax/swing/JList.java b/src/java.desktop/share/classes/javax/swing/JList.java
index 8d4497d6f9a..f3620be02b4 100644
--- a/src/java.desktop/share/classes/javax/swing/JList.java
+++ b/src/java.desktop/share/classes/javax/swing/JList.java
@@ -2694,7 +2694,7 @@ public class JList<E> extends JComponent implements Scrollable, Accessible
                     }
                     Rectangle newFirstRect = getCellBounds(newFirst,newFirst);
                     Rectangle firstRect = getCellBounds(first,first);
-                    if ((newFirstRect != null) && (firstRect!=null)) {
+                    if ((newFirstRect != null) && (firstRect != null)) {
                         while ( (newFirstRect.y + visibleRect.height <
                                  firstRect.y + firstRect.height) &&
                                 (newFirstRect.y < firstRect.y) ) {
diff --git a/src/java.desktop/share/classes/javax/swing/JPopupMenu.java b/src/java.desktop/share/classes/javax/swing/JPopupMenu.java
index 2ecc7cf3b1e..f3d11a29b4a 100644
--- a/src/java.desktop/share/classes/javax/swing/JPopupMenu.java
+++ b/src/java.desktop/share/classes/javax/swing/JPopupMenu.java
@@ -975,7 +975,7 @@ public class JPopupMenu extends JComponent implements Accessible,MenuElement {
         if (newFrame != frame) {
             // Use the invoker's frame so that events
             // are propagated properly
-            if (newFrame!=null) {
+            if (newFrame != null) {
                 this.frame = newFrame;
                 if(popup != null) {
                     setVisible(false);
@@ -1012,7 +1012,7 @@ public class JPopupMenu extends JComponent implements Accessible,MenuElement {
      */
     JPopupMenu getRootPopupMenu() {
         JPopupMenu mp = this;
-        while((mp!=null) && (mp.isPopupMenu()!=true) &&
+        while((mp != null) && (mp.isPopupMenu()!=true) &&
               (mp.getInvoker() != null) &&
               (mp.getInvoker().getParent() instanceof JPopupMenu popupMenu)
               ) {
@@ -1182,7 +1182,7 @@ public class JPopupMenu extends JComponent implements Accessible,MenuElement {
     private static Frame getFrame(Component c) {
         Component w = c;
 
-        while(!(w instanceof Frame) && (w!=null)) {
+        while(!(w instanceof Frame) && (w != null)) {
             w = w.getParent();
         }
         return (Frame)w;
diff --git a/src/java.desktop/share/classes/javax/swing/JTextField.java b/src/java.desktop/share/classes/javax/swing/JTextField.java
index 0d66209d8af..b6d8639c994 100644
--- a/src/java.desktop/share/classes/javax/swing/JTextField.java
+++ b/src/java.desktop/share/classes/javax/swing/JTextField.java
@@ -581,13 +581,13 @@ public class JTextField extends JTextComponent implements SwingConstants {
         Action oldValue = getAction();
         if (action==null || !action.equals(a)) {
             action = a;
-            if (oldValue!=null) {
+            if (oldValue != null) {
                 removeActionListener(oldValue);
                 oldValue.removePropertyChangeListener(actionPropertyChangeListener);
                 actionPropertyChangeListener = null;
             }
             configurePropertiesFromAction(action);
-            if (action!=null) {
+            if (action != null) {
                 // Don't add if it is already a listener
                 if (!isListener(ActionListener.class, action)) {
                     addActionListener(action);
diff --git a/src/java.desktop/share/classes/javax/swing/JTree.java b/src/java.desktop/share/classes/javax/swing/JTree.java
index 622c55e2ede..397584b6e4a 100644
--- a/src/java.desktop/share/classes/javax/swing/JTree.java
+++ b/src/java.desktop/share/classes/javax/swing/JTree.java
@@ -2087,7 +2087,7 @@ public class JTree extends JComponent implements Scrollable, Accessible
             value = expandedState.get(path);
             if (value == null || !value)
                 return false;
-        } while( (path=path.getParentPath())!=null );
+        } while( (path=path.getParentPath()) != null );
 
         return true;
     }
diff --git a/src/java.desktop/share/classes/javax/swing/KeyboardManager.java b/src/java.desktop/share/classes/javax/swing/KeyboardManager.java
index 42a6403ddb5..8206ab5cea6 100644
--- a/src/java.desktop/share/classes/javax/swing/KeyboardManager.java
+++ b/src/java.desktop/share/classes/javax/swing/KeyboardManager.java
@@ -330,7 +330,7 @@ class KeyboardManager {
             return;
         }
         Hashtable<Object, Object> keyMap = containerMap.get(topContainer);
-        if (keyMap!=null) {
+        if (keyMap != null) {
             Vector<?> v = (Vector)keyMap.get(JMenuBar.class);
             if (v != null) {
                 v.removeElement(mb);
diff --git a/src/java.desktop/share/classes/javax/swing/PopupFactory.java b/src/java.desktop/share/classes/javax/swing/PopupFactory.java
index 208177fc55e..7245820c289 100644
--- a/src/java.desktop/share/classes/javax/swing/PopupFactory.java
+++ b/src/java.desktop/share/classes/javax/swing/PopupFactory.java
@@ -925,7 +925,7 @@ public class PopupFactory {
               add to that, otherwise
               add to the window. */
             while (!(parent instanceof Window) &&
-                   (parent!=null)) {
+                   (parent != null)) {
                 parent = parent.getParent();
             }
 
diff --git a/src/java.desktop/share/classes/javax/swing/SwingUtilities.java b/src/java.desktop/share/classes/javax/swing/SwingUtilities.java
index afe1c444c31..ae5faf64f3b 100644
--- a/src/java.desktop/share/classes/javax/swing/SwingUtilities.java
+++ b/src/java.desktop/share/classes/javax/swing/SwingUtilities.java
@@ -506,7 +506,7 @@ public class SwingUtilities implements SwingConstants
     public static boolean isDescendingFrom(Component a,Component b) {
         if(a == b)
             return true;
-        for(Container p = a.getParent();p!=null;p=p.getParent())
+        for(Container p = a.getParent(); p != null; p = p.getParent())
             if(p == b)
                 return true;
         return false;
diff --git a/src/java.desktop/share/classes/javax/swing/UIDefaults.java b/src/java.desktop/share/classes/javax/swing/UIDefaults.java
index d59a46dba32..67a739360f9 100644
--- a/src/java.desktop/share/classes/javax/swing/UIDefaults.java
+++ b/src/java.desktop/share/classes/javax/swing/UIDefaults.java
@@ -1169,7 +1169,7 @@ public class UIDefaults extends Hashtable<Object,Object>
          */
         private Class<?>[] getClassArray(Object[] args) {
             Class<?>[] types = null;
-            if (args!=null) {
+            if (args != null) {
                 types = new Class<?>[args.length];
                 for (int i = 0; i< args.length; i++) {
                     /* PENDING(ges): At present only the primitive types
@@ -1199,7 +1199,7 @@ public class UIDefaults extends Hashtable<Object,Object>
 
         private String printArgs(Object[] array) {
             String s = "{";
-            if (array !=null) {
+            if (array != null) {
                 for (int i = 0 ; i < array.length-1; i++) {
                     s = s.concat(array[i] + ",");
                 }
diff --git a/src/java.desktop/share/classes/javax/swing/plaf/basic/BasicComboPopup.java b/src/java.desktop/share/classes/javax/swing/plaf/basic/BasicComboPopup.java
index 38798d4c94f..42791772c2d 100644
--- a/src/java.desktop/share/classes/javax/swing/plaf/basic/BasicComboPopup.java
+++ b/src/java.desktop/share/classes/javax/swing/plaf/basic/BasicComboPopup.java
@@ -1070,11 +1070,11 @@ public class BasicComboPopup extends JPopupMenu implements ComboPopup {
                 ComponentOrientation o =(ComponentOrientation)e.getNewValue();
 
                 JList<?> list = getList();
-                if (list!=null && list.getComponentOrientation()!=o) {
+                if (list != null && list.getComponentOrientation()!=o) {
                     list.setComponentOrientation(o);
                 }
 
-                if (scroller!=null && scroller.getComponentOrientation()!=o) {
+                if (scroller != null && scroller.getComponentOrientation()!=o) {
                     scroller.setComponentOrientation(o);
                 }
 
diff --git a/src/java.desktop/share/classes/javax/swing/plaf/basic/BasicListUI.java b/src/java.desktop/share/classes/javax/swing/plaf/basic/BasicListUI.java
index 0a4aa03dce9..ab5fdb12c5a 100644
--- a/src/java.desktop/share/classes/javax/swing/plaf/basic/BasicListUI.java
+++ b/src/java.desktop/share/classes/javax/swing/plaf/basic/BasicListUI.java
@@ -876,7 +876,7 @@ public class BasicListUI extends ListUI
         }
 
         Long l = (Long)UIManager.get("List.timeFactor");
-        timeFactor = (l!=null) ? l.longValue() : 1000L;
+        timeFactor = (l != null) ? l.longValue() : 1000L;
 
         updateIsFileList();
     }
diff --git a/src/java.desktop/share/classes/javax/swing/plaf/basic/BasicMenuBarUI.java b/src/java.desktop/share/classes/javax/swing/plaf/basic/BasicMenuBarUI.java
index 2079aafd3a2..b7310b56aef 100644
--- a/src/java.desktop/share/classes/javax/swing/plaf/basic/BasicMenuBarUI.java
+++ b/src/java.desktop/share/classes/javax/swing/plaf/basic/BasicMenuBarUI.java
@@ -125,7 +125,7 @@ public class BasicMenuBarUI extends MenuBarUI  {
 
         for (int i = 0; i < menuBar.getMenuCount(); i++) {
             JMenu menu = menuBar.getMenu(i);
-            if (menu!=null)
+            if (menu != null)
                 menu.getModel().addChangeListener(changeListener);
         }
         menuBar.addContainerListener(containerListener);
@@ -167,7 +167,7 @@ public class BasicMenuBarUI extends MenuBarUI  {
      * Uninstalls default properties.
      */
     protected void uninstallDefaults() {
-        if (menuBar!=null) {
+        if (menuBar != null) {
             LookAndFeel.uninstallBorder(menuBar);
         }
     }
@@ -180,7 +180,7 @@ public class BasicMenuBarUI extends MenuBarUI  {
 
         for (int i = 0; i < menuBar.getMenuCount(); i++) {
             JMenu menu = menuBar.getMenu(i);
-            if (menu !=null)
+            if (menu != null)
                 menu.getModel().removeChangeListener(changeListener);
         }
 
@@ -240,7 +240,7 @@ public class BasicMenuBarUI extends MenuBarUI  {
             int i,c;
             for(i=0,c = menuBar.getMenuCount() ; i < c ; i++) {
                 JMenu menu = menuBar.getMenu(i);
-                if(menu !=null && menu.isSelected()) {
+                if(menu != null && menu.isSelected()) {
                     menuBar.getSelectionModel().setSelectedIndex(i);
                     break;
                 }
@@ -277,7 +277,7 @@ public class BasicMenuBarUI extends MenuBarUI  {
             MenuElement[] me;
             MenuElement[] subElements;
             JMenu menu = menuBar.getMenu(0);
-            if (menu!=null) {
+            if (menu != null) {
                     me = new MenuElement[3];
                     me[0] = (MenuElement) menuBar;
                     me[1] = (MenuElement) menu;
diff --git a/src/java.desktop/share/classes/javax/swing/plaf/basic/BasicPopupMenuUI.java b/src/java.desktop/share/classes/javax/swing/plaf/basic/BasicPopupMenuUI.java
index 8df27d3e3cb..b72a2d8a140 100644
--- a/src/java.desktop/share/classes/javax/swing/plaf/basic/BasicPopupMenuUI.java
+++ b/src/java.desktop/share/classes/javax/swing/plaf/basic/BasicPopupMenuUI.java
@@ -908,7 +908,7 @@ public class BasicPopupMenuUI extends PopupMenuUI {
         }
 
         boolean isInPopup(Component src) {
-            for (Component c=src; c!=null; c=c.getParent()) {
+            for (Component c=src; c != null; c=c.getParent()) {
                 if (c instanceof Window) {
                     break;
                 } else if (c instanceof JPopupMenu) {
diff --git a/src/java.desktop/share/classes/javax/swing/plaf/basic/BasicSpinnerUI.java b/src/java.desktop/share/classes/javax/swing/plaf/basic/BasicSpinnerUI.java
index 2b871343697..7080fa3aac1 100644
--- a/src/java.desktop/share/classes/javax/swing/plaf/basic/BasicSpinnerUI.java
+++ b/src/java.desktop/share/classes/javax/swing/plaf/basic/BasicSpinnerUI.java
@@ -688,7 +688,7 @@ public class BasicSpinnerUI extends SpinnerUI
                     arrowButton = (JButton)e.getSource();
                 }
             } else {
-                if (arrowButton!=null && !arrowButton.getModel().isPressed()
+                if (arrowButton != null && !arrowButton.getModel().isPressed()
                     && autoRepeatTimer.isRunning()) {
                     autoRepeatTimer.stop();
                     spinner = null;
diff --git a/src/java.desktop/share/classes/javax/swing/plaf/basic/BasicSplitPaneUI.java b/src/java.desktop/share/classes/javax/swing/plaf/basic/BasicSplitPaneUI.java
index 270181f4600..1d8c471e9ec 100644
--- a/src/java.desktop/share/classes/javax/swing/plaf/basic/BasicSplitPaneUI.java
+++ b/src/java.desktop/share/classes/javax/swing/plaf/basic/BasicSplitPaneUI.java
@@ -2273,7 +2273,7 @@ public class BasicSplitPaneUI extends SplitPaneUI
                     JSplitPane parentSplitPane =
                         (JSplitPane)SwingUtilities.getAncestorOfClass(
                                          JSplitPane.class, splitPane);
-                    if (parentSplitPane!=null) {
+                    if (parentSplitPane != null) {
                         parentSplitPane.requestFocus();
                     }
                 }
@@ -2307,7 +2307,7 @@ public class BasicSplitPaneUI extends SplitPaneUI
                 } while (splitPane.isAncestorOf(focusOn) &&
                          !focusFrom.contains(focusOn));
             }
-            if ( focusOn!=null && !splitPane.isAncestorOf(focusOn) ) {
+            if ( focusOn != null && !splitPane.isAncestorOf(focusOn) ) {
                 focusOn.requestFocus();
             }
         }
@@ -2323,7 +2323,7 @@ public class BasicSplitPaneUI extends SplitPaneUI
             if (focusOn != null) {
                 // don't change the focus if the new focused component belongs
                 // to the same splitpane and the same side
-                if ( focus!=null &&
+                if ( focus != null &&
                      ( (SwingUtilities.isDescendingFrom(focus, left) &&
                         SwingUtilities.isDescendingFrom(focusOn, left)) ||
                        (SwingUtilities.isDescendingFrom(focus, right) &&
@@ -2338,15 +2338,15 @@ public class BasicSplitPaneUI extends SplitPaneUI
             Component left = splitPane.getLeftComponent();
             Component right = splitPane.getRightComponent();
             Component next;
-            if (focus!=null && SwingUtilities.isDescendingFrom(focus, left) &&
-                right!=null) {
+            if (focus != null && SwingUtilities.isDescendingFrom(focus, left) &&
+                right != null) {
                 next = getFirstAvailableComponent(right);
                 if (next != null) {
                     return next;
                 }
             }
             JSplitPane parentSplitPane = (JSplitPane)SwingUtilities.getAncestorOfClass(JSplitPane.class, splitPane);
-            if (parentSplitPane!=null) {
+            if (parentSplitPane != null) {
                 // focus next side of the parent split pane
                 next = getNextSide(parentSplitPane, focus);
             } else {
diff --git a/src/java.desktop/share/classes/javax/swing/plaf/basic/BasicTabbedPaneUI.java b/src/java.desktop/share/classes/javax/swing/plaf/basic/BasicTabbedPaneUI.java
index 842e8892c76..6e0d0101b9c 100644
--- a/src/java.desktop/share/classes/javax/swing/plaf/basic/BasicTabbedPaneUI.java
+++ b/src/java.desktop/share/classes/javax/swing/plaf/basic/BasicTabbedPaneUI.java
@@ -528,7 +528,7 @@ public class BasicTabbedPaneUI extends TabbedPaneUI implements SwingConstants {
         }
 
         tabPane.removeContainerListener(getHandler());
-        if (htmlViews!=null) {
+        if (htmlViews != null) {
             htmlViews.removeAllElements();
             htmlViews = null;
         }
@@ -4090,7 +4090,7 @@ public class BasicTabbedPaneUI extends TabbedPaneUI implements SwingConstants {
                     setHtmlView(v, inserted, index);
                 }
             } else {                             // Not HTML
-                if (htmlViews!=null) {           // Add placeholder
+                if (htmlViews != null) {           // Add placeholder
                     setHtmlView(null, inserted, index);
                 }                                // else nada!
             }
diff --git a/src/java.desktop/share/classes/javax/swing/plaf/basic/BasicToolBarUI.java b/src/java.desktop/share/classes/javax/swing/plaf/basic/BasicToolBarUI.java
index 41ab6137976..1bcd4a9be8d 100644
--- a/src/java.desktop/share/classes/javax/swing/plaf/basic/BasicToolBarUI.java
+++ b/src/java.desktop/share/classes/javax/swing/plaf/basic/BasicToolBarUI.java
@@ -980,7 +980,7 @@ public class BasicToolBarUI extends ToolBarUI implements SwingConstants
     {
         toolBar.setOrientation( orientation );
 
-        if (dragWindow !=null)
+        if (dragWindow != null)
             dragWindow.setOrientation(orientation);
     }
 
@@ -1616,7 +1616,7 @@ public class BasicToolBarUI extends ToolBarUI implements SwingConstants
                 this.orientation = o;
                 Dimension size = getSize();
                 setSize(new Dimension(size.height, size.width));
-                if (offset!=null) {
+                if (offset != null) {
                     if( BasicGraphicsUtils.isLeftToRight(toolBar) ) {
                         setOffset(new Point(offset.y, offset.x));
                     } else if( o == JToolBar.HORIZONTAL ) {
diff --git a/src/java.desktop/share/classes/javax/swing/plaf/basic/BasicTreeUI.java b/src/java.desktop/share/classes/javax/swing/plaf/basic/BasicTreeUI.java
index 28beaee6929..096fe7cc5f7 100644
--- a/src/java.desktop/share/classes/javax/swing/plaf/basic/BasicTreeUI.java
+++ b/src/java.desktop/share/classes/javax/swing/plaf/basic/BasicTreeUI.java
@@ -943,7 +943,7 @@ public class BasicTreeUI extends TreeUI
         lineTypeDashed = UIManager.getBoolean("Tree.lineTypeDashed");
 
         Long l = (Long)UIManager.get("Tree.timeFactor");
-        timeFactor = (l!=null) ? l.longValue() : 1000L;
+        timeFactor = (l != null) ? l.longValue() : 1000L;
 
         Object showsRootHandles = UIManager.get("Tree.showsRootHandles");
         if (showsRootHandles != null) {
diff --git a/src/java.desktop/share/classes/javax/swing/plaf/nimbus/AbstractRegionPainter.java b/src/java.desktop/share/classes/javax/swing/plaf/nimbus/AbstractRegionPainter.java
index 1bdff19fa2d..cfcc014940a 100644
--- a/src/java.desktop/share/classes/javax/swing/plaf/nimbus/AbstractRegionPainter.java
+++ b/src/java.desktop/share/classes/javax/swing/plaf/nimbus/AbstractRegionPainter.java
@@ -660,7 +660,7 @@ public abstract class AbstractRegionPainter implements Painter<JComponent> {
                 ImageScalingHelper.paint(g, 0, 0, w, h, img, insets, dstInsets,
                         ImageScalingHelper.PaintType.PAINT9_STRETCH, ImageScalingHelper.PAINT_ALL);
                 g.setRenderingHint(RenderingHints.KEY_INTERPOLATION,
-                    oldScalingHints!=null?oldScalingHints:RenderingHints.VALUE_INTERPOLATION_NEAREST_NEIGHBOR);
+                    oldScalingHints != null ? oldScalingHints:RenderingHints.VALUE_INTERPOLATION_NEAREST_NEIGHBOR);
             } else {
                 // render directly
                 paint0(g, c, w, h, extendedCacheKeys);
diff --git a/src/java.desktop/share/classes/javax/swing/plaf/nimbus/NimbusLookAndFeel.java b/src/java.desktop/share/classes/javax/swing/plaf/nimbus/NimbusLookAndFeel.java
index c9340a62368..05fa3bbc9b6 100644
--- a/src/java.desktop/share/classes/javax/swing/plaf/nimbus/NimbusLookAndFeel.java
+++ b/src/java.desktop/share/classes/javax/swing/plaf/nimbus/NimbusLookAndFeel.java
@@ -531,7 +531,7 @@ public class NimbusLookAndFeel extends SynthLookAndFeel {
         public Object createValue(UIDefaults table) {
             Object obj = null;
             // check specified state
-            if (state!=null){
+            if (state != null){
                 obj = uiDefaults.get(prefix+"["+state+"]."+suffix);
             }
             // check enabled state
diff --git a/src/java.desktop/share/classes/javax/swing/plaf/nimbus/SynthPainterImpl.java b/src/java.desktop/share/classes/javax/swing/plaf/nimbus/SynthPainterImpl.java
index ca19a74b6ac..1842073588b 100644
--- a/src/java.desktop/share/classes/javax/swing/plaf/nimbus/SynthPainterImpl.java
+++ b/src/java.desktop/share/classes/javax/swing/plaf/nimbus/SynthPainterImpl.java
@@ -63,13 +63,13 @@ class SynthPainterImpl extends SynthPainter {
         if (p != null) {
             if (g instanceof Graphics2D){
                 Graphics2D gfx = (Graphics2D)g;
-                if (transform!=null){
+                if (transform != null) {
                     gfx.transform(transform);
                 }
                 gfx.translate(x, y);
                 p.paint(gfx, ctx.getComponent(), w, h);
                 gfx.translate(-x, -y);
-                if (transform!=null){
+                if (transform != null){
                     try {
                         gfx.transform(transform.createInverse());
                     } catch (NoninvertibleTransformException e) {
@@ -85,7 +85,7 @@ class SynthPainterImpl extends SynthPainter {
                 BufferedImage img = new BufferedImage(w,h,
                         BufferedImage.TYPE_INT_ARGB);
                 Graphics2D gfx = img.createGraphics();
-                if (transform!=null){
+                if (transform != null){
                     gfx.transform(transform);
                 }
                 p.paint(gfx, ctx.getComponent(), w, h);
diff --git a/src/java.desktop/share/classes/javax/swing/plaf/synth/SynthComboBoxUI.java b/src/java.desktop/share/classes/javax/swing/plaf/synth/SynthComboBoxUI.java
index 77ca2a1fc05..ad10e70a837 100644
--- a/src/java.desktop/share/classes/javax/swing/plaf/synth/SynthComboBoxUI.java
+++ b/src/java.desktop/share/classes/javax/swing/plaf/synth/SynthComboBoxUI.java
@@ -814,7 +814,7 @@ public class SynthComboBoxUI extends BasicComboBoxUI implements
         public void propertyChange(PropertyChangeEvent evt) {
             ComboBoxEditor newEditor = comboBox.getEditor();
             if (editor != newEditor){
-                if (editorComponent!=null){
+                if (editorComponent != null) {
                     editorComponent.removeFocusListener(this);
                 }
                 editor = newEditor;
diff --git a/src/java.desktop/share/classes/javax/swing/plaf/synth/SynthScrollPaneUI.java b/src/java.desktop/share/classes/javax/swing/plaf/synth/SynthScrollPaneUI.java
index 96541d51f67..0c3a17fbdbb 100644
--- a/src/java.desktop/share/classes/javax/swing/plaf/synth/SynthScrollPaneUI.java
+++ b/src/java.desktop/share/classes/javax/swing/plaf/synth/SynthScrollPaneUI.java
@@ -225,7 +225,7 @@ public class SynthScrollPaneUI extends BasicScrollPaneUI
 
     private int getComponentState(JComponent c) {
         int baseState = SynthLookAndFeel.getComponentState(c);
-        if (viewportViewFocusHandler!=null && viewportViewHasFocus){
+        if (viewportViewFocusHandler != null && viewportViewHasFocus) {
             baseState = baseState | FOCUSED;
         }
         return baseState;
diff --git a/src/java.desktop/share/classes/javax/swing/text/JTextComponent.java b/src/java.desktop/share/classes/javax/swing/text/JTextComponent.java
index 59cee1e12ee..f81ba9d66c2 100644
--- a/src/java.desktop/share/classes/javax/swing/text/JTextComponent.java
+++ b/src/java.desktop/share/classes/javax/swing/text/JTextComponent.java
@@ -1181,7 +1181,7 @@ public abstract class JTextComponent extends JComponent implements Scrollable, A
         Hashtable<String, Action> h = new Hashtable<String, Action>();
         for (Action a : actions) {
             String value = (String)a.getValue(Action.NAME);
-            h.put((value!=null ? value:""), a);
+            h.put((value != null ? value : ""), a);
         }
         for (KeyBinding binding : bindings) {
             Action a = h.get(binding.actionName);
diff --git a/src/java.desktop/share/classes/javax/swing/text/TextAction.java b/src/java.desktop/share/classes/javax/swing/text/TextAction.java
index 5c11c994ab2..d05f7e24a6b 100644
--- a/src/java.desktop/share/classes/javax/swing/text/TextAction.java
+++ b/src/java.desktop/share/classes/javax/swing/text/TextAction.java
@@ -107,11 +107,11 @@ public abstract class TextAction extends AbstractAction {
         Hashtable<String, Action> h = new Hashtable<String, Action>();
         for (Action a : list1) {
             String value = (String)a.getValue(Action.NAME);
-            h.put((value!=null ? value:""), a);
+            h.put((value != null ? value : ""), a);
         }
         for (Action a : list2) {
             String value = (String)a.getValue(Action.NAME);
-            h.put((value!=null ? value:""), a);
+            h.put((value != null ? value : ""), a);
         }
         Action[] actions = new Action[h.size()];
         int index = 0;
diff --git a/src/java.desktop/share/classes/javax/swing/tree/DefaultTreeCellEditor.java b/src/java.desktop/share/classes/javax/swing/tree/DefaultTreeCellEditor.java
index 4662c95c01f..3f3721dd30a 100644
--- a/src/java.desktop/share/classes/javax/swing/tree/DefaultTreeCellEditor.java
+++ b/src/java.desktop/share/classes/javax/swing/tree/DefaultTreeCellEditor.java
@@ -259,7 +259,7 @@ public class DefaultTreeCellEditor implements ActionListener, TreeCellEditor,
                                          ((MouseEvent)event).getY());
                     editable = (lastPath != null && path != null &&
                                lastPath.equals(path));
-                    if (path!=null) {
+                    if (path != null) {
                         lastRow = tree.getRowForPath(path);
                         Object value = path.getLastPathComponent();
                         boolean isSelected = tree.isRowSelected(lastRow);
diff --git a/src/java.desktop/share/classes/sun/swing/SwingUtilities2.java b/src/java.desktop/share/classes/sun/swing/SwingUtilities2.java
index 28b93ed1e2a..399ef3e531d 100644
--- a/src/java.desktop/share/classes/sun/swing/SwingUtilities2.java
+++ b/src/java.desktop/share/classes/sun/swing/SwingUtilities2.java
@@ -1646,17 +1646,17 @@ public class SwingUtilities2 {
             if (container.isFocusCycleRoot()) {
                 FocusTraversalPolicy policy = container.getFocusTraversalPolicy();
                 Component comp = policy.getDefaultComponent(container);
-                if (comp!=null) {
+                if (comp != null) {
                     comp.requestFocus(FocusEvent.Cause.TRAVERSAL);
                     return comp;
                 }
             }
             Container rootAncestor = container.getFocusCycleRootAncestor();
-            if (rootAncestor!=null) {
+            if (rootAncestor != null) {
                 FocusTraversalPolicy policy = rootAncestor.getFocusTraversalPolicy();
                 Component comp = policy.getComponentAfter(rootAncestor, container);
 
-                if (comp!=null && SwingUtilities.isDescendingFrom(comp, container)) {
+                if (comp != null && SwingUtilities.isDescendingFrom(comp, container)) {
                     comp.requestFocus(FocusEvent.Cause.TRAVERSAL);
                     return comp;
                 }

From d52e5bd0357a074f74757f7a8256ed14a2e0eaee Mon Sep 17 00:00:00 2001
From: Sergey Bylokhov <serb@openjdk.org>
Date: Wed, 18 Mar 2026 03:36:00 +0000
Subject: [PATCH 228/655] 8378727: [macOS] Missing dispatch_release for
 semaphores in CDesktopPeer

Reviewed-by: honkar, kizune, azvegint, dmarkov
---
 .../macosx/native/libawt_lwawt/awt/CDesktopPeer.m           | 6 ++++++
 1 file changed, 6 insertions(+)

diff --git a/src/java.desktop/macosx/native/libawt_lwawt/awt/CDesktopPeer.m b/src/java.desktop/macosx/native/libawt_lwawt/awt/CDesktopPeer.m
index 460749c363d..faacef5adea 100644
--- a/src/java.desktop/macosx/native/libawt_lwawt/awt/CDesktopPeer.m
+++ b/src/java.desktop/macosx/native/libawt_lwawt/awt/CDesktopPeer.m
@@ -70,6 +70,7 @@ JNI_COCOA_ENTER(env);
     dispatch_time_t timeout = dispatch_time(DISPATCH_TIME_NOW, (int64_t)(NSEC_PER_SEC)); // 1 second timeout
 
     // Asynchronous call to openURL
+    dispatch_retain(semaphore);
     [[NSWorkspace sharedWorkspace] openURLs:urls
                                     withApplicationAtURL:appURI
                                     configuration:configuration
@@ -78,9 +79,11 @@ JNI_COCOA_ENTER(env);
             status = (OSStatus) error.code;
         }
         dispatch_semaphore_signal(semaphore);
+        dispatch_release(semaphore);
     }];
 
     dispatch_semaphore_wait(semaphore, timeout);
+    dispatch_release(semaphore);
 
 JNI_COCOA_EXIT(env);
     return status;
@@ -146,6 +149,7 @@ JNI_COCOA_ENTER(env);
     dispatch_time_t timeout = dispatch_time(DISPATCH_TIME_NOW, (int64_t)(NSEC_PER_SEC)); // 1 second timeout
 
     // Asynchronous call - openURLs:withApplicationAtURL
+    dispatch_retain(semaphore);
     [[NSWorkspace sharedWorkspace] openURLs:urls
                                    withApplicationAtURL:appURI
                                    configuration:configuration
@@ -154,9 +158,11 @@ JNI_COCOA_ENTER(env);
             status = (OSStatus) error.code;
         }
         dispatch_semaphore_signal(semaphore);
+        dispatch_release(semaphore);
     }];
 
     dispatch_semaphore_wait(semaphore, timeout);
+    dispatch_release(semaphore);
 
     [urlToOpen release];
 JNI_COCOA_EXIT(env);

From 31de288c0c67448487eabd46348bef97a1a60846 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Galder=20Zamarre=C3=B1o?= <galder@openjdk.org>
Date: Wed, 18 Mar 2026 06:49:20 +0000
Subject: [PATCH 229/655] 8367399: C2 SuperWord: add IR rules for MemorySegment
 cases from JDK-8329077

Reviewed-by: fyang, epeter
---
 .../TestCompatibleUseDefTypeSize.java         | 204 +++++++++---------
 1 file changed, 96 insertions(+), 108 deletions(-)

diff --git a/test/hotspot/jtreg/compiler/loopopts/superword/TestCompatibleUseDefTypeSize.java b/test/hotspot/jtreg/compiler/loopopts/superword/TestCompatibleUseDefTypeSize.java
index 873533aaba8..e6edda9085a 100644
--- a/test/hotspot/jtreg/compiler/loopopts/superword/TestCompatibleUseDefTypeSize.java
+++ b/test/hotspot/jtreg/compiler/loopopts/superword/TestCompatibleUseDefTypeSize.java
@@ -1,5 +1,6 @@
 /*
  * Copyright (c) 2024, 2026, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2026 IBM Corporation. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -24,13 +25,15 @@
 package compiler.loopopts.superword;
 
 import compiler.lib.ir_framework.*;
+import compiler.lib.verify.Verify;
 import jdk.test.lib.Utils;
 import jdk.test.whitebox.WhiteBox;
+import java.lang.foreign.MemorySegment;
+import java.lang.foreign.ValueLayout;
 import java.lang.reflect.Array;
 import java.util.Map;
 import java.util.HashMap;
 import java.util.Random;
-import java.nio.ByteOrder;
 
 /*
  * @test
@@ -61,6 +64,8 @@ public class TestCompatibleUseDefTypeSize {
     float[] bF;
     double[] aD;
     double[] bD;
+    MemorySegment aMSF;
+    MemorySegment aMSD;
 
     // List of tests
     Map<String,TestFunction> tests = new HashMap<String,TestFunction>();
@@ -92,6 +97,8 @@ public class TestCompatibleUseDefTypeSize {
         bF = generateF();
         aD = generateD();
         bD = generateD();
+        aMSF = generateMemorySegmentF();
+        aMSD = generateMemorySegmentD();
 
         // Add all tests to list
         tests.put("test0",       () -> { return test0(aB.clone(), bC.clone()); });
@@ -122,6 +129,10 @@ public class TestCompatibleUseDefTypeSize {
         tests.put("testLongToShort", () -> { return testLongToShort(aL.clone(), bS.clone()); });
         tests.put("testLongToChar",  () -> { return testLongToChar(aL.clone(), bC.clone()); });
         tests.put("testLongToInt",   () -> { return testLongToInt(aL.clone(), bI.clone()); });
+        tests.put("testFloatToIntMemorySegment",   () -> { return testFloatToIntMemorySegment(copyF(aMSF), bF.clone()); });
+        tests.put("testDoubleToLongMemorySegment", () -> { return testDoubleToLongMemorySegment(copyD(aMSD), bD.clone()); });
+        tests.put("testIntToFloatMemorySegment",   () -> { return testIntToFloatMemorySegment(copyF(aMSF), bF.clone()); });
+        tests.put("testLongToDoubleMemorySegment", () -> { return testLongToDoubleMemorySegment(copyD(aMSD), bD.clone()); });
 
         // Compute gold value for all test methods before compilation
         for (Map.Entry<String,TestFunction> entry : tests.entrySet()) {
@@ -160,7 +171,11 @@ public class TestCompatibleUseDefTypeSize {
                  "testLongToByte",
                  "testLongToShort",
                  "testLongToChar",
-                 "testLongToInt"})
+                 "testLongToInt",
+                 "testFloatToIntMemorySegment",
+                 "testDoubleToLongMemorySegment",
+                 "testIntToFloatMemorySegment",
+                 "testLongToDoubleMemorySegment"})
     public void runTests() {
         for (Map.Entry<String,TestFunction> entry : tests.entrySet()) {
             String name = entry.getKey();
@@ -170,7 +185,7 @@ public class TestCompatibleUseDefTypeSize {
             // Compute new result
             Object[] result = test.run();
             // Compare gold and new result
-            verify(name, gold, result);
+            Verify.checkEQ(gold, result);
         }
     }
 
@@ -230,119 +245,32 @@ public class TestCompatibleUseDefTypeSize {
         return a;
     }
 
-    static void verify(String name, Object[] gold, Object[] result) {
-        if (gold.length != result.length) {
-            throw new RuntimeException("verify " + name + ": not the same number of outputs: gold.length = " +
-                                       gold.length + ", result.length = " + result.length);
-        }
-        for (int i = 0; i < gold.length; i++) {
-            Object g = gold[i];
-            Object r = result[i];
-            if (g.getClass() != r.getClass() || !g.getClass().isArray() || !r.getClass().isArray()) {
-                throw new RuntimeException("verify " + name + ": must both be array of same type:" +
-                                           " gold[" + i + "].getClass() = " + g.getClass().getSimpleName() +
-                                           " result[" + i + "].getClass() = " + r.getClass().getSimpleName());
-            }
-            if (g == r) {
-                throw new RuntimeException("verify " + name + ": should be two separate arrays (with identical content):" +
-                                           " gold[" + i + "] == result[" + i + "]");
-            }
-            if (Array.getLength(g) != Array.getLength(r)) {
-                    throw new RuntimeException("verify " + name + ": arrays must have same length:" +
-                                           " gold[" + i + "].length = " + Array.getLength(g) +
-                                           " result[" + i + "].length = " + Array.getLength(r));
-            }
-            Class c = g.getClass().getComponentType();
-            if (c == byte.class) {
-                verifyB(name, i, (byte[])g, (byte[])r);
-            } else if (c == short.class) {
-                verifyS(name, i, (short[])g, (short[])r);
-            } else if (c == char.class) {
-                verifyC(name, i, (char[])g, (char[])r);
-            } else if (c == int.class) {
-                verifyI(name, i, (int[])g, (int[])r);
-            } else if (c == long.class) {
-                verifyL(name, i, (long[])g, (long[])r);
-            } else if (c == float.class) {
-                verifyF(name, i, (float[])g, (float[])r);
-            } else if (c == double.class) {
-                verifyD(name, i, (double[])g, (double[])r);
-            } else {
-                throw new RuntimeException("verify " + name + ": array type not supported for verify:" +
-                                       " gold[" + i + "].getClass() = " + g.getClass().getSimpleName() +
-                                       " result[" + i + "].getClass() = " + r.getClass().getSimpleName());
-            }
+    static MemorySegment generateMemorySegmentF() {
+        MemorySegment a = MemorySegment.ofArray(new float[RANGE]);
+        for (int i = 0; i < (int) a.byteSize(); i += 8) {
+            a.set(ValueLayout.JAVA_LONG_UNALIGNED, i, RANDOM.nextLong());
         }
+        return a;
     }
 
-    static void verifyB(String name, int i, byte[] g, byte[] r) {
-        for (int j = 0; j < g.length; j++) {
-            if (g[j] != r[j]) {
-                throw new RuntimeException("verify " + name + ": arrays must have same content:" +
-                                           " gold[" + i + "][" + j + "] = " + g[j] +
-                                           " result[" + i + "][" + j + "] = " + r[j]);
-            }
-        }
+    MemorySegment copyF(MemorySegment src) {
+        MemorySegment dst = generateMemorySegmentF();
+        MemorySegment.copy(src, 0, dst, 0, src.byteSize());
+        return dst;
     }
 
-    static void verifyS(String name, int i, short[] g, short[] r) {
-        for (int j = 0; j < g.length; j++) {
-            if (g[j] != r[j]) {
-                throw new RuntimeException("verify " + name + ": arrays must have same content:" +
-                                           " gold[" + i + "][" + j + "] = " + g[j] +
-                                           " result[" + i + "][" + j + "] = " + r[j]);
-            }
+    static MemorySegment generateMemorySegmentD() {
+        MemorySegment a = MemorySegment.ofArray(new double[RANGE]);
+        for (int i = 0; i < (int) a.byteSize(); i += 8) {
+            a.set(ValueLayout.JAVA_LONG_UNALIGNED, i, RANDOM.nextLong());
         }
+        return a;
     }
 
-    static void verifyC(String name, int i, char[] g, char[] r) {
-        for (int j = 0; j < g.length; j++) {
-            if (g[j] != r[j]) {
-                throw new RuntimeException("verify " + name + ": arrays must have same content:" +
-                                           " gold[" + i + "][" + j + "] = " + g[j] +
-                                           " result[" + i + "][" + j + "] = " + r[j]);
-            }
-        }
-    }
-
-    static void verifyI(String name, int i, int[] g, int[] r) {
-        for (int j = 0; j < g.length; j++) {
-            if (g[j] != r[j]) {
-                throw new RuntimeException("verify " + name + ": arrays must have same content:" +
-                                           " gold[" + i + "][" + j + "] = " + g[j] +
-                                           " result[" + i + "][" + j + "] = " + r[j]);
-            }
-        }
-    }
-
-    static void verifyL(String name, int i, long[] g, long[] r) {
-        for (int j = 0; j < g.length; j++) {
-            if (g[j] != r[j]) {
-                throw new RuntimeException("verify " + name + ": arrays must have same content:" +
-                                           " gold[" + i + "][" + j + "] = " + g[j] +
-                                           " result[" + i + "][" + j + "] = " + r[j]);
-            }
-        }
-    }
-
-    static void verifyF(String name, int i, float[] g, float[] r) {
-        for (int j = 0; j < g.length; j++) {
-            if (Float.floatToIntBits(g[j]) != Float.floatToIntBits(r[j])) {
-                throw new RuntimeException("verify " + name + ": arrays must have same content:" +
-                                           " gold[" + i + "][" + j + "] = " + g[j] +
-                                           " result[" + i + "][" + j + "] = " + r[j]);
-            }
-        }
-    }
-
-    static void verifyD(String name, int i, double[] g, double[] r) {
-        for (int j = 0; j < g.length; j++) {
-            if (Double.doubleToLongBits(g[j]) != Double.doubleToLongBits(r[j])) {
-                throw new RuntimeException("verify " + name + ": arrays must have same content:" +
-                                           " gold[" + i + "][" + j + "] = " + g[j] +
-                                           " result[" + i + "][" + j + "] = " + r[j]);
-            }
-        }
+    MemorySegment copyD(MemorySegment src) {
+        MemorySegment dst = generateMemorySegmentD();
+        MemorySegment.copy(src, 0, dst, 0, src.byteSize());
+        return dst;
     }
 
     @Test
@@ -707,4 +635,64 @@ public class TestCompatibleUseDefTypeSize {
 
         return new Object[] { ints, res };
     }
+
+    @Test
+    @IR(counts = {IRNode.LOAD_VECTOR_F, IRNode.VECTOR_SIZE + "min(max_int, max_float)", "> 0",
+                  IRNode.STORE_VECTOR, "> 0",
+                  IRNode.VECTOR_REINTERPRET, "> 0"},
+        applyIf = {"AlignVector", "false"},
+        applyIfPlatform = {"64-bit", "true"},
+        applyIfCPUFeatureOr = {"sse4.1", "true", "asimd", "true", "rvv", "true"})
+    static Object[] testFloatToIntMemorySegment(MemorySegment a, float[] b) {
+        for (int i = 0; i < RANGE; i++) {
+            a.set(ValueLayout.JAVA_FLOAT_UNALIGNED, 4L * i, b[i]);
+        }
+
+        return new Object[]{ a, b };
+    }
+
+    @Test
+    @IR(counts = {IRNode.LOAD_VECTOR_D, IRNode.VECTOR_SIZE + "min(max_long, max_double)", "> 0",
+                  IRNode.STORE_VECTOR, "> 0",
+                  IRNode.VECTOR_REINTERPRET, "> 0"},
+        applyIf = {"AlignVector", "false"},
+        applyIfPlatform = {"64-bit", "true"},
+        applyIfCPUFeatureOr = {"sse4.1", "true", "asimd", "true", "rvv", "true"})
+    static Object[] testDoubleToLongMemorySegment(MemorySegment a, double[] b) {
+        for (int i = 0; i < RANGE; i++) {
+            a.set(ValueLayout.JAVA_DOUBLE_UNALIGNED, 8L * i, b[i]);
+        }
+
+        return new Object[]{ a, b };
+    }
+
+    @Test
+    @IR(counts = {IRNode.LOAD_VECTOR_I, "> 0",
+                  IRNode.STORE_VECTOR, "> 0",
+                  IRNode.VECTOR_REINTERPRET, "> 0"},
+        applyIf = {"AlignVector", "false"},
+        applyIfPlatform = {"64-bit", "true"},
+        applyIfCPUFeatureOr = {"sse4.1", "true", "asimd", "true", "rvv", "true"})
+    static Object[] testIntToFloatMemorySegment(MemorySegment a, float[] b) {
+        for (int i = 0; i < RANGE; i++) {
+            b[i] = a.get(ValueLayout.JAVA_FLOAT_UNALIGNED, 4L * i);
+        }
+
+        return new Object[]{ a, b };
+    }
+
+    @Test
+    @IR(counts = {IRNode.LOAD_VECTOR_L, "> 0",
+                  IRNode.STORE_VECTOR, "> 0",
+                  IRNode.VECTOR_REINTERPRET, "> 0"},
+        applyIf = {"AlignVector", "false"},
+        applyIfPlatform = {"64-bit", "true"},
+        applyIfCPUFeatureOr = {"sse4.1", "true", "asimd", "true", "rvv", "true"})
+    static Object[] testLongToDoubleMemorySegment(MemorySegment a, double[] b) {
+        for (int i = 0; i < RANGE; i++) {
+            b[i] = a.get(ValueLayout.JAVA_DOUBLE_UNALIGNED, 8L * i);
+        }
+
+        return new Object[]{ a, b };
+    }
 }

From d8f19bf961f1f25a029943b6390f8b9c95f31304 Mon Sep 17 00:00:00 2001
From: Dusan Balek <dusan.balek@oracle.com>
Date: Wed, 18 Mar 2026 07:04:25 +0000
Subject: [PATCH 230/655] 8347418: ConsoleIOContext.countTrailintBackslashes
 causes NullPointerException

Reviewed-by: jlahoda
---
 .../jshell/tool/ConsoleIOContext.java         |  2 +
 .../jshell/ConcurrentHistoryLoadingTest.java  | 80 +++++++++++++++++++
 .../langtools/jdk/jshell/ReplToolTesting.java | 14 ++--
 .../jdk/jshell/TerminalNoExecTest.java        |  8 +-
 4 files changed, 94 insertions(+), 10 deletions(-)
 create mode 100644 test/langtools/jdk/jshell/ConcurrentHistoryLoadingTest.java

diff --git a/src/jdk.jshell/share/classes/jdk/internal/jshell/tool/ConsoleIOContext.java b/src/jdk.jshell/share/classes/jdk/internal/jshell/tool/ConsoleIOContext.java
index 32664504d20..eba81b4be07 100644
--- a/src/jdk.jshell/share/classes/jdk/internal/jshell/tool/ConsoleIOContext.java
+++ b/src/jdk.jshell/share/classes/jdk/internal/jshell/tool/ConsoleIOContext.java
@@ -49,6 +49,7 @@ import java.util.List;
 import java.util.ListIterator;
 import java.util.Locale;
 import java.util.Map;
+import java.util.Objects;
 import java.util.Optional;
 import java.util.Set;
 import java.util.concurrent.ExecutorService;
@@ -202,6 +203,7 @@ class ConsoleIOContext extends IOContext {
               .filter(key -> key.startsWith(HISTORY_LINE_PREFIX))
               .sorted()
               .map(key -> repl.prefs.get(key))
+              .filter(Objects::nonNull)
               .forEach(loadHistory::add);
 
         for (ListIterator<String> it = loadHistory.listIterator(); it.hasNext(); ) {
diff --git a/test/langtools/jdk/jshell/ConcurrentHistoryLoadingTest.java b/test/langtools/jdk/jshell/ConcurrentHistoryLoadingTest.java
new file mode 100644
index 00000000000..926dbbf50b4
--- /dev/null
+++ b/test/langtools/jdk/jshell/ConcurrentHistoryLoadingTest.java
@@ -0,0 +1,80 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+import java.io.ByteArrayInputStream;
+import java.util.Arrays;
+import java.util.concurrent.atomic.AtomicBoolean;
+import java.util.prefs.Preferences;
+
+import jdk.jshell.tool.JavaShellToolBuilder;
+import org.junit.jupiter.api.Assertions;
+import org.junit.jupiter.api.Test;
+
+/*
+ * @test
+ * @bug 8347418
+ * @summary Verify that loading of JShell history doesn't lead to a
+ *          NullPointerException when the Preferences are modified concurrently.
+ * @run junit ConcurrentHistoryLoadingTest
+ */
+public class ConcurrentHistoryLoadingTest {
+
+    private static final String HISTORY_LINE_PREFIX = "HISTORY_LINE_";
+
+    @Test
+    public void testConcurrentHistoryLoading() throws Throwable {
+        AtomicBoolean removeOnAccess = new AtomicBoolean();
+        Preferences testPrefs = new ReplToolTesting.MemoryPreferences() {
+            @Override
+            protected String getSpi(String key) {
+                String result = super.getSpi(key);
+                if (key.startsWith(HISTORY_LINE_PREFIX) && removeOnAccess.getAndSet(false)) {
+                    for (String key2Remote : keysSpi()) {
+                        remove(key2Remote);
+                    }
+                }
+                return result;
+            }
+        };
+        StringBuilder input = new StringBuilder();
+        int max = 10;
+        for (int j = 0; j < max; j++) {
+            input.append("int x").append(j).append(" = 42\n");
+        }
+        JavaShellToolBuilder
+                .builder()
+                .persistence(testPrefs)
+                .in(new ByteArrayInputStream(input.toString().getBytes()), null)
+                .start();
+        Assertions.assertEquals(10, Arrays.stream(testPrefs.keys())
+                .filter(key -> key.startsWith(HISTORY_LINE_PREFIX))
+                .count());
+        removeOnAccess.set(true);
+        JavaShellToolBuilder
+                .builder()
+                .persistence(testPrefs)
+                .in(new ByteArrayInputStream(input.toString().getBytes()), null)
+                .start();
+
+    }
+}
diff --git a/test/langtools/jdk/jshell/ReplToolTesting.java b/test/langtools/jdk/jshell/ReplToolTesting.java
index 429a0a7ce02..2dabf29e1f9 100644
--- a/test/langtools/jdk/jshell/ReplToolTesting.java
+++ b/test/langtools/jdk/jshell/ReplToolTesting.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2015, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2015, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -914,7 +914,7 @@ public class ReplToolTesting {
         }
     }
 
-    public static final class MemoryPreferences extends AbstractPreferences {
+    public static class MemoryPreferences extends AbstractPreferences {
 
         private final Map<String, String> values = new HashMap<>();
         private final Map<String, MemoryPreferences> nodes = new HashMap<>();
@@ -943,17 +943,17 @@ public class ReplToolTesting {
         }
 
         @Override
-        protected void removeNodeSpi() throws BackingStoreException {
+        protected void removeNodeSpi() {
             ((MemoryPreferences) parent()).nodes.remove(name());
         }
 
         @Override
-        protected String[] keysSpi() throws BackingStoreException {
+        protected String[] keysSpi() {
             return values.keySet().toArray(new String[0]);
         }
 
         @Override
-        protected String[] childrenNamesSpi() throws BackingStoreException {
+        protected String[] childrenNamesSpi() {
             return nodes.keySet().toArray(new String[0]);
         }
 
@@ -963,11 +963,11 @@ public class ReplToolTesting {
         }
 
         @Override
-        protected void syncSpi() throws BackingStoreException {
+        protected void syncSpi() {
         }
 
         @Override
-        protected void flushSpi() throws BackingStoreException {
+        protected void flushSpi() {
         }
 
     }
diff --git a/test/langtools/jdk/jshell/TerminalNoExecTest.java b/test/langtools/jdk/jshell/TerminalNoExecTest.java
index 3d76157fd26..d7cd20046af 100644
--- a/test/langtools/jdk/jshell/TerminalNoExecTest.java
+++ b/test/langtools/jdk/jshell/TerminalNoExecTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2024, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -39,7 +39,7 @@ import java.io.Writer;
 import java.nio.file.Files;
 import java.nio.file.Path;
 import java.nio.file.Paths;
-import java.util.concurrent.TimeUnit;
+import java.util.HashMap;
 import java.util.concurrent.atomic.AtomicBoolean;
 import jdk.jfr.consumer.RecordingStream;
 import jdk.jshell.tool.JavaShellToolBuilder;
@@ -58,7 +58,9 @@ public class TerminalNoExecTest {
                     spawnedNewProcess.set(true);
                 });
                 rs.startAsync();
-                JavaShellToolBuilder.builder().run("--execution=local", "--no-startup");
+                JavaShellToolBuilder.builder()
+                                    .persistence(new HashMap<>())
+                                    .run("--execution=local", "--no-startup");
                 rs.stop();
             }
             if (spawnedNewProcess.get()) {

From 706fbb3044ef56cad14cf4e413b24042a3ea3f13 Mon Sep 17 00:00:00 2001
From: Volkan Yazici <vyazici@openjdk.org>
Date: Wed, 18 Mar 2026 08:25:29 +0000
Subject: [PATCH 231/655] 8378431: Move input validation checks to Java for
 java.lang.StringUTF16 intrinsics

Reviewed-by: dfenacci, rgiulietti, rriggs
---
 src/hotspot/share/classfile/vmIntrinsics.hpp  |   4 +-
 src/hotspot/share/opto/library_call.cpp       | 214 ++++++++----------
 src/hotspot/share/opto/library_call.hpp       |   4 +-
 .../share/classes/java/lang/StringUTF16.java  | 116 +++++++---
 .../TestStringIntrinsicRangeChecks.java       |  10 +-
 5 files changed, 200 insertions(+), 148 deletions(-)

diff --git a/src/hotspot/share/classfile/vmIntrinsics.hpp b/src/hotspot/share/classfile/vmIntrinsics.hpp
index 67817682ced..e84acd62284 100644
--- a/src/hotspot/share/classfile/vmIntrinsics.hpp
+++ b/src/hotspot/share/classfile/vmIntrinsics.hpp
@@ -368,10 +368,10 @@ class methodHandle;
   do_intrinsic(_inflateStringB,           java_lang_StringLatin1, inflate_name, inflateB_signature,              F_S)   \
    do_signature(inflateB_signature,                              "([BI[BII)V")                                          \
   do_intrinsic(_toBytesStringU,           java_lang_StringUTF16, toBytes_name, toBytesU_signature,               F_S)   \
-   do_name(     toBytes_name,                                    "toBytes")                                             \
+   do_name(     toBytes_name,                                    "toBytes0")                                            \
    do_signature(toBytesU_signature,                              "([CII)[B")                                            \
   do_intrinsic(_getCharsStringU,          java_lang_StringUTF16, getCharsU_name, getCharsU_signature,            F_S)   \
-   do_name(     getCharsU_name,                                  "getChars")                                            \
+   do_name(     getCharsU_name,                                  "getChars0")                                           \
    do_signature(getCharsU_signature,                             "([BII[CI)V")                                          \
   do_intrinsic(_getCharStringU,           java_lang_StringUTF16, getChar_name, getCharStringU_signature,         F_S)   \
    do_signature(getCharStringU_signature,                        "([BI)C")                                              \
diff --git a/src/hotspot/share/opto/library_call.cpp b/src/hotspot/share/opto/library_call.cpp
index 501e35ae5cb..ffc798019b4 100644
--- a/src/hotspot/share/opto/library_call.cpp
+++ b/src/hotspot/share/opto/library_call.cpp
@@ -843,6 +843,22 @@ void LibraryCallKit::set_result(RegionNode* region, PhiNode* value) {
   assert(value->type()->basic_type() == result()->bottom_type()->basic_type(), "sanity");
 }
 
+RegionNode* LibraryCallKit::create_bailout() {
+  RegionNode* bailout = new RegionNode(1);
+  record_for_igvn(bailout);
+  return bailout;
+}
+
+bool LibraryCallKit::check_bailout(RegionNode* bailout) {
+  if (bailout->req() > 1) {
+    bailout = _gvn.transform(bailout)->as_Region();
+    Node* frame = _gvn.transform(new ParmNode(C->start(), TypeFunc::FramePtr));
+    Node* halt = _gvn.transform(new HaltNode(bailout, frame, "unexpected guard failure in intrinsic"));
+    C->root()->add_req(halt);
+  }
+  return stopped();
+}
+
 //------------------------------generate_guard---------------------------
 // Helper function for generating guarded fast-slow graph structures.
 // The given 'test', if true, guards a slow path.  If the test fails
@@ -951,36 +967,19 @@ void LibraryCallKit::generate_string_range_check(Node* array,
                                                  Node* offset,
                                                  Node* count,
                                                  bool char_count,
-                                                 bool halt_on_oob) {
+                                                 RegionNode* region) {
   if (stopped()) {
     return; // already stopped
   }
-  RegionNode* bailout = new RegionNode(1);
-  record_for_igvn(bailout);
   if (char_count) {
     // Convert char count to byte count
     count = _gvn.transform(new LShiftINode(count, intcon(1)));
   }
-
   // Offset and count must not be negative
-  generate_negative_guard(offset, bailout, nullptr, halt_on_oob);
-  generate_negative_guard(count, bailout, nullptr, halt_on_oob);
+  generate_negative_guard(offset, region, nullptr, true);
+  generate_negative_guard(count, region, nullptr, true);
   // Offset + count must not exceed length of array
-  generate_limit_guard(offset, count, load_array_length(array), bailout, halt_on_oob);
-
-  if (bailout->req() > 1) {
-    if (halt_on_oob) {
-      bailout = _gvn.transform(bailout)->as_Region();
-      Node* frame = _gvn.transform(new ParmNode(C->start(), TypeFunc::FramePtr));
-      Node* halt = _gvn.transform(new HaltNode(bailout, frame, "unexpected guard failure in intrinsic"));
-      C->root()->add_req(halt);
-    } else {
-      PreserveJVMState pjvms(this);
-      set_control(_gvn.transform(bailout));
-      uncommon_trap(Deoptimization::Reason_intrinsic,
-                    Deoptimization::Action_maybe_recompile);
-    }
-  }
+  generate_limit_guard(offset, count, load_array_length(array), region, true);
 }
 
 Node* LibraryCallKit::current_thread_helper(Node*& tls_output, ByteSize handle_offset,
@@ -1139,10 +1138,6 @@ bool LibraryCallKit::inline_array_equals(StrIntrinsicNode::ArgEnc ae) {
 //------------------------------inline_countPositives------------------------------
 // int java.lang.StringCoding#countPositives0(byte[] ba, int off, int len)
 bool LibraryCallKit::inline_countPositives() {
-  if (too_many_traps(Deoptimization::Reason_intrinsic)) {
-    return false;
-  }
-
   assert(callee()->signature()->size() == 3, "countPositives has 3 parameters");
   // no receiver since it is static method
   Node* ba         = argument(0);
@@ -1150,8 +1145,9 @@ bool LibraryCallKit::inline_countPositives() {
   Node* len        = argument(2);
 
   ba = must_be_not_null(ba, true);
-  generate_string_range_check(ba, offset, len, false, true);
-  if (stopped()) {
+  RegionNode* bailout = create_bailout();
+  generate_string_range_check(ba, offset, len, false, bailout);
+  if (check_bailout(bailout)) {
     return true;
   }
 
@@ -1283,9 +1279,6 @@ bool LibraryCallKit::inline_string_indexOf(StrIntrinsicNode::ArgEnc ae) {
 
 //-----------------------------inline_string_indexOfI-----------------------
 bool LibraryCallKit::inline_string_indexOfI(StrIntrinsicNode::ArgEnc ae) {
-  if (too_many_traps(Deoptimization::Reason_intrinsic)) {
-    return false;
-  }
   if (!Matcher::match_rule_supported(Op_StrIndexOf)) {
     return false;
   }
@@ -1307,9 +1300,10 @@ bool LibraryCallKit::inline_string_indexOfI(StrIntrinsicNode::ArgEnc ae) {
   Node* tgt_start = array_element_address(tgt, intcon(0), T_BYTE);
 
   // Range checks
-  generate_string_range_check(src, src_offset, src_count, ae != StrIntrinsicNode::LL, true);
-  generate_string_range_check(tgt, intcon(0), tgt_count, ae == StrIntrinsicNode::UU, true);
-  if (stopped()) {
+  RegionNode* bailout = create_bailout();
+  generate_string_range_check(src, src_offset, src_count, ae != StrIntrinsicNode::LL, bailout);
+  generate_string_range_check(tgt, intcon(0), tgt_count, ae == StrIntrinsicNode::UU, bailout);
+  if (check_bailout(bailout)) {
     return true;
   }
 
@@ -1404,7 +1398,11 @@ bool LibraryCallKit::inline_string_indexOfChar(StrIntrinsicNode::ArgEnc ae) {
   Node* src_count = _gvn.transform(new SubINode(max, from_index));
 
   // Range checks
-  generate_string_range_check(src, src_offset, src_count, ae == StrIntrinsicNode::U, true);
+  RegionNode* bailout = create_bailout();
+  generate_string_range_check(src, src_offset, src_count, ae == StrIntrinsicNode::U, bailout);
+  if (check_bailout(bailout)) {
+    return true;
+  }
 
   // Check for int_ch >= 0
   Node* int_ch_cmp = _gvn.transform(new CmpINode(int_ch, intcon(0)));
@@ -1454,9 +1452,6 @@ bool LibraryCallKit::inline_string_indexOfChar(StrIntrinsicNode::ArgEnc ae) {
 //   void StringLatin1.inflate0(byte[] src, int srcOff, char[] dst, int dstOff, int len)
 //   void StringLatin1.inflate0(byte[] src, int srcOff, byte[] dst, int dstOff, int len)
 bool LibraryCallKit::inline_string_copy(bool compress) {
-  if (too_many_traps(Deoptimization::Reason_intrinsic)) {
-    return false;
-  }
   int nargs = 5;  // 2 oops, 3 ints
   assert(callee()->signature()->size() == nargs, "string copy has 5 arguments");
 
@@ -1495,9 +1490,10 @@ bool LibraryCallKit::inline_string_copy(bool compress) {
   }
 
   // Range checks
-  generate_string_range_check(src, src_offset, length, convert_src, true);
-  generate_string_range_check(dst, dst_offset, length, convert_dst, true);
-  if (stopped()) {
+  RegionNode* bailout = create_bailout();
+  generate_string_range_check(src, src_offset, length, convert_src, bailout);
+  generate_string_range_check(dst, dst_offset, length, convert_dst, bailout);
+  if (check_bailout(bailout)) {
     return true;
   }
 
@@ -1545,12 +1541,10 @@ bool LibraryCallKit::inline_string_copy(bool compress) {
 #endif //_LP64
 
 //------------------------inline_string_toBytesU--------------------------
-// public static byte[] StringUTF16.toBytes(char[] value, int off, int len)
+// public static byte[] StringUTF16.toBytes0(char[] value, int off, int len)
 bool LibraryCallKit::inline_string_toBytesU() {
-  if (too_many_traps(Deoptimization::Reason_intrinsic)) {
-    return false;
-  }
   // Get the arguments.
+  assert(callee()->signature()->size() == 3, "character array encoder requires 3 arguments");
   Node* value     = argument(0);
   Node* offset    = argument(1);
   Node* length    = argument(2);
@@ -1558,30 +1552,18 @@ bool LibraryCallKit::inline_string_toBytesU() {
   Node* newcopy = nullptr;
 
   // Set the original stack and the reexecute bit for the interpreter to reexecute
-  // the bytecode that invokes StringUTF16.toBytes() if deoptimization happens.
+  // the bytecode that invokes StringUTF16.toBytes0() if deoptimization happens.
   { PreserveReexecuteState preexecs(this);
     jvms()->set_should_reexecute(true);
 
-    // Check if a null path was taken unconditionally.
-    value = null_check(value);
-
-    RegionNode* bailout = new RegionNode(1);
-    record_for_igvn(bailout);
-
-    // Range checks
-    generate_negative_guard(offset, bailout);
-    generate_negative_guard(length, bailout);
-    generate_limit_guard(offset, length, load_array_length(value), bailout);
+    value = must_be_not_null(value, true);
+    RegionNode* bailout = create_bailout();
+    generate_negative_guard(offset, bailout, nullptr, true);
+    generate_negative_guard(length, bailout, nullptr, true);
+    generate_limit_guard(offset, length, load_array_length(value), bailout, true);
     // Make sure that resulting byte[] length does not overflow Integer.MAX_VALUE
-    generate_limit_guard(length, intcon(0), intcon(max_jint/2), bailout);
-
-    if (bailout->req() > 1) {
-      PreserveJVMState pjvms(this);
-      set_control(_gvn.transform(bailout));
-      uncommon_trap(Deoptimization::Reason_intrinsic,
-                    Deoptimization::Action_maybe_recompile);
-    }
-    if (stopped()) {
+    generate_limit_guard(length, intcon(0), intcon(max_jint/2), bailout, true);
+    if (check_bailout(bailout)) {
       return true;
     }
 
@@ -1640,12 +1622,9 @@ bool LibraryCallKit::inline_string_toBytesU() {
 }
 
 //------------------------inline_string_getCharsU--------------------------
-// public void StringUTF16.getChars(byte[] src, int srcBegin, int srcEnd, char dst[], int dstBegin)
+// public void StringUTF16.getChars0(byte[] src, int srcBegin, int srcEnd, char dst[], int dstBegin)
 bool LibraryCallKit::inline_string_getCharsU() {
-  if (too_many_traps(Deoptimization::Reason_intrinsic)) {
-    return false;
-  }
-
+  assert(callee()->signature()->size() == 5, "StringUTF16.getChars0() has 5 arguments");
   // Get the arguments.
   Node* src       = argument(0);
   Node* src_begin = argument(1);
@@ -1658,8 +1637,8 @@ bool LibraryCallKit::inline_string_getCharsU() {
   AllocateArrayNode* alloc = tightly_coupled_allocation(dst);
 
   // Check if a null path was taken unconditionally.
-  src = null_check(src);
-  dst = null_check(dst);
+  src = must_be_not_null(src, true);
+  dst = must_be_not_null(dst, true);
   if (stopped()) {
     return true;
   }
@@ -1669,51 +1648,50 @@ bool LibraryCallKit::inline_string_getCharsU() {
   src_begin = _gvn.transform(new LShiftINode(src_begin, intcon(1)));
 
   // Range checks
-  generate_string_range_check(src, src_begin, length, true);
-  generate_string_range_check(dst, dst_begin, length, false);
-  if (stopped()) {
+  RegionNode* bailout = create_bailout();
+  generate_string_range_check(src, src_begin, length, true, bailout);
+  generate_string_range_check(dst, dst_begin, length, false, bailout);
+  if (check_bailout(bailout)) {
     return true;
   }
 
-  if (!stopped()) {
-    // Calculate starting addresses.
-    Node* src_start = array_element_address(src, src_begin, T_BYTE);
-    Node* dst_start = array_element_address(dst, dst_begin, T_CHAR);
+  // Calculate starting addresses.
+  Node* src_start = array_element_address(src, src_begin, T_BYTE);
+  Node* dst_start = array_element_address(dst, dst_begin, T_CHAR);
 
-    // Check if array addresses are aligned to HeapWordSize
-    const TypeInt* tsrc = gvn().type(src_begin)->is_int();
-    const TypeInt* tdst = gvn().type(dst_begin)->is_int();
-    bool aligned = tsrc->is_con() && ((arrayOopDesc::base_offset_in_bytes(T_BYTE) + tsrc->get_con() * type2aelembytes(T_BYTE)) % HeapWordSize == 0) &&
-                   tdst->is_con() && ((arrayOopDesc::base_offset_in_bytes(T_CHAR) + tdst->get_con() * type2aelembytes(T_CHAR)) % HeapWordSize == 0);
+  // Check if array addresses are aligned to HeapWordSize
+  const TypeInt* tsrc = gvn().type(src_begin)->is_int();
+  const TypeInt* tdst = gvn().type(dst_begin)->is_int();
+  bool aligned = tsrc->is_con() && ((arrayOopDesc::base_offset_in_bytes(T_BYTE) + tsrc->get_con() * type2aelembytes(T_BYTE)) % HeapWordSize == 0) &&
+                 tdst->is_con() && ((arrayOopDesc::base_offset_in_bytes(T_CHAR) + tdst->get_con() * type2aelembytes(T_CHAR)) % HeapWordSize == 0);
 
-    // Figure out which arraycopy runtime method to call (disjoint, uninitialized).
-    const char* copyfunc_name = "arraycopy";
-    address     copyfunc_addr = StubRoutines::select_arraycopy_function(T_CHAR, aligned, true, copyfunc_name, true);
-    Node* call = make_runtime_call(RC_LEAF|RC_NO_FP,
-                      OptoRuntime::fast_arraycopy_Type(),
-                      copyfunc_addr, copyfunc_name, TypeRawPtr::BOTTOM,
-                      src_start, dst_start, ConvI2X(length) XTOP);
-    // Do not let reads from the cloned object float above the arraycopy.
-    if (alloc != nullptr) {
-      if (alloc->maybe_set_complete(&_gvn)) {
-        // "You break it, you buy it."
-        InitializeNode* init = alloc->initialization();
-        assert(init->is_complete(), "we just did this");
-        init->set_complete_with_arraycopy();
-        assert(dst->is_CheckCastPP(), "sanity");
-        assert(dst->in(0)->in(0) == init, "dest pinned");
-      }
-      // Do not let stores that initialize this object be reordered with
-      // a subsequent store that would make this object accessible by
-      // other threads.
-      // Record what AllocateNode this StoreStore protects so that
-      // escape analysis can go from the MemBarStoreStoreNode to the
-      // AllocateNode and eliminate the MemBarStoreStoreNode if possible
-      // based on the escape status of the AllocateNode.
-      insert_mem_bar(Op_MemBarStoreStore, alloc->proj_out_or_null(AllocateNode::RawAddress));
-    } else {
-      insert_mem_bar(Op_MemBarCPUOrder);
+  // Figure out which arraycopy runtime method to call (disjoint, uninitialized).
+  const char* copyfunc_name = "arraycopy";
+  address     copyfunc_addr = StubRoutines::select_arraycopy_function(T_CHAR, aligned, true, copyfunc_name, true);
+  Node* call = make_runtime_call(RC_LEAF|RC_NO_FP,
+                    OptoRuntime::fast_arraycopy_Type(),
+                    copyfunc_addr, copyfunc_name, TypeRawPtr::BOTTOM,
+                    src_start, dst_start, ConvI2X(length) XTOP);
+  // Do not let reads from the cloned object float above the arraycopy.
+  if (alloc != nullptr) {
+    if (alloc->maybe_set_complete(&_gvn)) {
+      // "You break it, you buy it."
+      InitializeNode* init = alloc->initialization();
+      assert(init->is_complete(), "we just did this");
+      init->set_complete_with_arraycopy();
+      assert(dst->is_CheckCastPP(), "sanity");
+      assert(dst->in(0)->in(0) == init, "dest pinned");
     }
+    // Do not let stores that initialize this object be reordered with
+    // a subsequent store that would make this object accessible by
+    // other threads.
+    // Record what AllocateNode this StoreStore protects so that
+    // escape analysis can go from the MemBarStoreStoreNode to the
+    // AllocateNode and eliminate the MemBarStoreStoreNode if possible
+    // based on the escape status of the AllocateNode.
+    insert_mem_bar(Op_MemBarStoreStore, alloc->proj_out_or_null(AllocateNode::RawAddress));
+  } else {
+    insert_mem_bar(Op_MemBarCPUOrder);
   }
 
   C->set_has_split_ifs(true); // Has chance for split-if optimization
@@ -1725,9 +1703,16 @@ bool LibraryCallKit::inline_string_getCharsU() {
 // static void StringUTF16.putChar(byte[] val, int index, int c)
 // static char StringUTF16.getChar(byte[] val, int index)
 bool LibraryCallKit::inline_string_char_access(bool is_store) {
+  Node* ch;
+  if (is_store) {
+    assert(callee()->signature()->size() == 3, "StringUTF16.putChar() has 3 arguments");
+    ch = argument(2);
+  } else {
+    assert(callee()->signature()->size() == 2, "StringUTF16.getChar() has 2 arguments");
+    ch = nullptr;
+  }
   Node* value  = argument(0);
   Node* index  = argument(1);
-  Node* ch = is_store ? argument(2) : nullptr;
 
   // This intrinsic accesses byte[] array as char[] array. Computing the offsets
   // correctly requires matched array shapes.
@@ -6185,9 +6170,10 @@ bool LibraryCallKit::inline_encodeISOArray(bool ascii) {
   }
 
   // Check source & target bounds
-  generate_string_range_check(src, src_offset, length, src_elem == T_BYTE, true);
-  generate_string_range_check(dst, dst_offset, length, false, true);
-  if (stopped()) {
+  RegionNode* bailout = create_bailout();
+  generate_string_range_check(src, src_offset, length, src_elem == T_BYTE, bailout);
+  generate_string_range_check(dst, dst_offset, length, false, bailout);
+  if (check_bailout(bailout)) {
     return true;
   }
 
diff --git a/src/hotspot/share/opto/library_call.hpp b/src/hotspot/share/opto/library_call.hpp
index bd4b753d1cb..9b87df645e1 100644
--- a/src/hotspot/share/opto/library_call.hpp
+++ b/src/hotspot/share/opto/library_call.hpp
@@ -130,6 +130,8 @@ class LibraryCallKit : public GraphKit {
   virtual int reexecute_sp() { return _reexecute_sp; }
 
   // Helper functions to inline natives
+  RegionNode* create_bailout();
+  bool check_bailout(RegionNode* bailout);
   Node* generate_guard(Node* test, RegionNode* region, float true_prob);
   Node* generate_slow_guard(Node* test, RegionNode* region);
   Node* generate_fair_guard(Node* test, RegionNode* region);
@@ -143,7 +145,7 @@ class LibraryCallKit : public GraphKit {
                              bool with_opaque = false);
   void  generate_string_range_check(Node* array, Node* offset,
                                     Node* length, bool char_count,
-                                    bool halt_on_oob = false);
+                                    RegionNode* region);
   Node* current_thread_helper(Node* &tls_output, ByteSize handle_offset,
                               bool is_immutable);
   Node* generate_current_thread(Node* &tls_output);
diff --git a/src/java.base/share/classes/java/lang/StringUTF16.java b/src/java.base/share/classes/java/lang/StringUTF16.java
index 27b9ae54a8a..23de31a61b7 100644
--- a/src/java.base/share/classes/java/lang/StringUTF16.java
+++ b/src/java.base/share/classes/java/lang/StringUTF16.java
@@ -67,30 +67,61 @@ final class StringUTF16 {
 
     // Check the size of a UTF16-coded string
     // Throw an exception if out of range
-    static int newBytesLength(int len) {
-        if (len < 0) {
-            throw new NegativeArraySizeException();
-        }
-        if (len >= MAX_LENGTH) {
-            throw new OutOfMemoryError("UTF16 String size is " + len +
-                                       ", should be less than " + MAX_LENGTH);
-        }
+    private static int newBytesLength(int len) {
+        checkBytesLength(len);
         return len << 1;
     }
 
+    /**
+     * Checks if the provided length is a valid UTF-16 string byte array length.
+     *
+     * @param length a UTF-16 string byte array length
+     *
+     * @throws NegativeArraySizeException if {@code length < 0}
+     * @throws OutOfMemoryError if {@code length > (Integer.MAX_VALUE / 2)}
+     */
+    private static void checkBytesLength(int length) {
+        if (length < 0) {
+            throw new NegativeArraySizeException();
+        }
+        if (length >= MAX_LENGTH) {
+            throw new OutOfMemoryError("UTF16 String size is " + length +
+                    ", should be less than " + MAX_LENGTH);
+        }
+    }
+
+    /**
+     * Writes the given code point to the specified position of the provided
+     * UTF-16 string byte array.
+     * <p>
+     * <b>WARNING: This method does not perform any input validations.</b>
+     *
+     * @param val a UTF-16 string byte array
+     * @param index the index of the character to write the code point to
+     * @param c a code point
+     */
+    // vmIntrinsics::_putCharStringU
     @IntrinsicCandidate
-    // intrinsic performs no bounds checks
     static void putChar(byte[] val, int index, int c) {
-        assert index >= 0 && index < length(val) : "Trusted caller missed bounds check";
+        assert val != null && index >= 0 && index < length(val) : "Trusted caller violated input constraints";
         index <<= 1;
         val[index++] = (byte)(c >> HI_BYTE_SHIFT);
         val[index]   = (byte)(c >> LO_BYTE_SHIFT);
     }
 
+    /**
+     * {@return the code point at the the specified position of the provided
+     * UTF-16 string byte array}
+     * <p>
+     * <b>WARNING: This method does not perform any input validations.</b>
+     *
+     * @param val a UTF-16 string byte array
+     * @param index the index of the character to get the code point from
+     */
+    // vmIntrinsics::_getCharStringU
     @IntrinsicCandidate
-    // intrinsic performs no bounds checks
     static char getChar(byte[] val, int index) {
-        assert index >= 0 && index < length(val) : "Trusted caller missed bounds check";
+        assert val != null && index >= 0 && index < length(val) : "Trusted caller violated input constraints";
         index <<= 1;
         return (char)(((val[index++] & 0xff) << HI_BYTE_SHIFT) |
                       ((val[index]   & 0xff) << LO_BYTE_SHIFT));
@@ -173,14 +204,27 @@ final class StringUTF16 {
     }
 
     /**
-     * {@return an encoded byte[] for the UTF16 characters in char[]}
-     * No checking is done on the characters, some may or may not be latin1.
-     * @param value a char array
-     * @param off an offset
-     * @param len a length
+     * {@return a UTF-16 string byte array produced by encoding the characters
+     * in the provided character array sub-range}
+     *
+     * @param value a character array to encode
+     * @param off the index of the character to start encoding from
+     * @param len the number of characters to encode
+     *
+     * @throws NegativeArraySizeException if {@code len < 0}
+     * @throws NullPointerException if {@code value} is null
+     * @throws OutOfMemoryError if {@code len > (Integer.MAX_VALUE / 2)}
+     * @throws StringIndexOutOfBoundsException if the sub-range is out of bounds
      */
-    @IntrinsicCandidate
     static byte[] toBytes(char[] value, int off, int len) {
+        checkBytesLength(len);
+        String.checkBoundsOffCount(off, len, value.length);     // Implicit null check on `value`
+        return toBytes0(value, off, len);
+    }
+
+    // vmIntrinsics::_toBytesStringU
+    @IntrinsicCandidate
+    private static byte[] toBytes0(char[] value, int off, int len) {
         byte[] val = newBytesFor(len);
         for (int i = 0; i < len; i++) {
             putChar(val, i, value[off]);
@@ -495,12 +539,28 @@ final class StringUTF16 {
         return result;
     }
 
-    @IntrinsicCandidate
+    /**
+     * Copies the specified sub-range of characters from a UTF-16 string byte
+     * array to the specified character array sub-range.
+     *
+     * @param value the source UTF-16 string byte array to copy from
+     * @param srcBegin the index (inclusive) of the first character in the source sub-range
+     * @param srcEnd the index (exclusive) of the last character in the source sub-range
+     * @param dst the target character array to copy to
+     * @param dstBegin the index (inclusive) of the first character in the target sub-range
+     *
+     * @throws NullPointerException if {@code value} or {@code dst} is null
+     * @throws StringIndexOutOfBoundsException if the sub-ranges are out of bounds
+     */
     static void getChars(byte[] value, int srcBegin, int srcEnd, char[] dst, int dstBegin) {
-        // We need a range check here because 'getChar' has no checks
-        if (srcBegin < srcEnd) {
-            String.checkBoundsOffCount(srcBegin, srcEnd - srcBegin, length(value));
-        }
+        checkBoundsBeginEnd(srcBegin, srcEnd, value);                           // Implicit null check on `value` via `checkBoundsBeginEnd()`
+        String.checkBoundsOffCount(dstBegin, srcEnd - srcBegin, dst.length);    // Implicit null check on `dst`
+        getChars0(value, srcBegin, srcEnd, dst, dstBegin);
+    }
+
+    // vmIntrinsics::_getCharsStringU
+    @IntrinsicCandidate
+    private static void getChars0(byte[] value, int srcBegin, int srcEnd, char[] dst, int dstBegin) {
         for (int i = srcBegin; i < srcEnd; i++) {
             dst[dstBegin++] = getChar(value, i);
         }
@@ -721,7 +781,7 @@ final class StringUTF16 {
         return -StringLatin1.compareToCI_UTF16(other, value);
     }
 
-    public static int compareToFC_Latin1(byte[] value, byte[] other) {
+    static int compareToFC_Latin1(byte[] value, byte[] other) {
         return -StringLatin1.compareToFC_UTF16(other, value);
     }
 
@@ -769,7 +829,7 @@ final class StringUTF16 {
         return 0;
     }
 
-    public static int compareToFC(byte[] value, byte[] other) {
+    static int compareToFC(byte[] value, byte[] other) {
         int tlast = length(value);
         int olast = length(other);
         int lim = Math.min(tlast, olast);
@@ -1970,13 +2030,13 @@ final class StringUTF16 {
         }
     }
 
-    static final int MAX_LENGTH = Integer.MAX_VALUE >> 1;
+    private static final int MAX_LENGTH = Integer.MAX_VALUE >> 1;
 
-    static void checkIndex(int off, byte[] val) {
+    private static void checkIndex(int off, byte[] val) {
         String.checkIndex(off, length(val));
     }
 
-    static void checkOffset(int off, byte[] val) {
+    private static void checkOffset(int off, byte[] val) {
         String.checkOffset(off, length(val));
     }
 
diff --git a/test/hotspot/jtreg/compiler/intrinsics/string/TestStringIntrinsicRangeChecks.java b/test/hotspot/jtreg/compiler/intrinsics/string/TestStringIntrinsicRangeChecks.java
index a7d2cfe7fa7..ec99bba19d2 100644
--- a/test/hotspot/jtreg/compiler/intrinsics/string/TestStringIntrinsicRangeChecks.java
+++ b/test/hotspot/jtreg/compiler/intrinsics/string/TestStringIntrinsicRangeChecks.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2016, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2016, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -89,12 +89,16 @@ public class TestStringIntrinsicRangeChecks {
         for (int srcOff = 0; srcOff < SIZE; ++srcOff) {
             for (int dstOff = 0; dstOff < SIZE; ++dstOff) {
                 for (int len = 0; len < SIZE; ++len) {
+                    int srcEnd = srcOff + len;
+                    int dstEnd = dstOff + len;
                     // Check for potential overlows in source or destination array
                     boolean srcOverflow  = (srcOff + len) > SIZE;
                     boolean srcOverflowB = (2*srcOff + 2*len) > SIZE;
                     boolean dstOverflow  = (dstOff + len) > SIZE;
                     boolean dstOverflowB = (2*dstOff + 2*len) > SIZE;
-                    boolean getCharsOver = (srcOff < len) && ((2*(len-1) >= SIZE) || ((dstOff + len - srcOff) > SIZE));
+                    boolean getCharsOver = srcOff > srcEnd || (2*srcEnd) > SIZE ||  // src
+                            (2*len) > SIZE ||                                       // len
+                            dstOff > dstEnd || dstEnd > SIZE;                       // dst
                     // Check if an exception is thrown and bail out if result is inconsistent with above
                     // assumptions (for example, an exception was not thrown although an overflow happened).
                     check(compressByte, srcOverflowB || dstOverflow,  byteArray, srcOff, SIZE, dstOff, len);
@@ -102,7 +106,7 @@ public class TestStringIntrinsicRangeChecks {
                     check(inflateByte,  srcOverflow  || dstOverflowB, byteArray, srcOff, SIZE, dstOff, len);
                     check(inflateChar,  srcOverflow  || dstOverflow,  byteArray, srcOff, SIZE, dstOff, len);
                     check(toBytes,      srcOverflow,                  charArray, srcOff, len);
-                    check(getChars,     getCharsOver,                 byteArray, srcOff, len, SIZE, dstOff);
+                    check(getChars,     getCharsOver,                 byteArray, srcOff, srcEnd, SIZE, dstOff);
                 }
             }
         }

From 3a93daf189213d4c8af5d57d7af1e832401331b6 Mon Sep 17 00:00:00 2001
From: Albert Mingkun Yang <ayang@openjdk.org>
Date: Wed, 18 Mar 2026 09:07:14 +0000
Subject: [PATCH 232/655] 8373369: [REDO] Remove
 ThreadLocalAllocBuffer::_reserve_for_allocation_prefetch

Reviewed-by: mdoerr, kvn, tschatzl
---
 src/hotspot/cpu/ppc/ppc.ad                    | 29 -------
 .../gc/shared/threadLocalAllocBuffer.cpp      | 28 +------
 .../gc/shared/threadLocalAllocBuffer.hpp      |  1 -
 src/hotspot/share/opto/macro.cpp              |  3 +-
 src/hotspot/share/runtime/vmStructs.cpp       |  1 -
 .../runtime/ThreadLocalAllocBuffer.java       |  3 +-
 .../classes/sun/jvm/hotspot/runtime/VM.java   |  7 --
 test/hotspot/jtreg/ProblemList.txt            |  3 +-
 .../TestAllocatePrefetchStyleLargeFlags.java  | 79 +++++++++++++++++++
 9 files changed, 84 insertions(+), 70 deletions(-)
 create mode 100644 test/hotspot/jtreg/compiler/c2/TestAllocatePrefetchStyleLargeFlags.java

diff --git a/src/hotspot/cpu/ppc/ppc.ad b/src/hotspot/cpu/ppc/ppc.ad
index 21fc12742ef..01c290f9b04 100644
--- a/src/hotspot/cpu/ppc/ppc.ad
+++ b/src/hotspot/cpu/ppc/ppc.ad
@@ -6327,36 +6327,8 @@ instruct loadConD_Ex(regD dst, immD src) %{
 // Prefetch instructions.
 // Must be safe to execute with invalid address (cannot fault).
 
-// Special prefetch versions which use the dcbz instruction.
-instruct prefetch_alloc_zero(indirectMemory mem, iRegLsrc src) %{
-  match(PrefetchAllocation (AddP mem src));
-  predicate(AllocatePrefetchStyle == 3);
-  ins_cost(MEMORY_REF_COST);
-
-  format %{ "PREFETCH $mem, 2, $src \t// Prefetch write-many with zero" %}
-  size(4);
-  ins_encode %{
-    __ dcbz($src$$Register, $mem$$base$$Register);
-  %}
-  ins_pipe(pipe_class_memory);
-%}
-
-instruct prefetch_alloc_zero_no_offset(indirectMemory mem) %{
-  match(PrefetchAllocation mem);
-  predicate(AllocatePrefetchStyle == 3);
-  ins_cost(MEMORY_REF_COST);
-
-  format %{ "PREFETCH $mem, 2 \t// Prefetch write-many with zero" %}
-  size(4);
-  ins_encode %{
-    __ dcbz($mem$$base$$Register);
-  %}
-  ins_pipe(pipe_class_memory);
-%}
-
 instruct prefetch_alloc(indirectMemory mem, iRegLsrc src) %{
   match(PrefetchAllocation (AddP mem src));
-  predicate(AllocatePrefetchStyle != 3);
   ins_cost(MEMORY_REF_COST);
 
   format %{ "PREFETCH $mem, 2, $src \t// Prefetch write-many" %}
@@ -6369,7 +6341,6 @@ instruct prefetch_alloc(indirectMemory mem, iRegLsrc src) %{
 
 instruct prefetch_alloc_no_offset(indirectMemory mem) %{
   match(PrefetchAllocation mem);
-  predicate(AllocatePrefetchStyle != 3);
   ins_cost(MEMORY_REF_COST);
 
   format %{ "PREFETCH $mem, 2 \t// Prefetch write-many" %}
diff --git a/src/hotspot/share/gc/shared/threadLocalAllocBuffer.cpp b/src/hotspot/share/gc/shared/threadLocalAllocBuffer.cpp
index 61cf73fe04a..4c160929f5a 100644
--- a/src/hotspot/share/gc/shared/threadLocalAllocBuffer.cpp
+++ b/src/hotspot/share/gc/shared/threadLocalAllocBuffer.cpp
@@ -37,7 +37,6 @@
 #include "utilities/copy.hpp"
 
 size_t       ThreadLocalAllocBuffer::_max_size = 0;
-int          ThreadLocalAllocBuffer::_reserve_for_allocation_prefetch = 0;
 unsigned int ThreadLocalAllocBuffer::_target_refills = 0;
 
 ThreadLocalAllocBuffer::ThreadLocalAllocBuffer() :
@@ -225,30 +224,6 @@ void ThreadLocalAllocBuffer::startup_initialization() {
   // abort during VM initialization.
   _target_refills = MAX2(_target_refills, 2U);
 
-#ifdef COMPILER2
-  // If the C2 compiler is present, extra space is needed at the end of
-  // TLABs, otherwise prefetching instructions generated by the C2
-  // compiler will fault (due to accessing memory outside of heap).
-  // The amount of space is the max of the number of lines to
-  // prefetch for array and for instance allocations. (Extra space must be
-  // reserved to accommodate both types of allocations.)
-  //
-  // Only SPARC-specific BIS instructions are known to fault. (Those
-  // instructions are generated if AllocatePrefetchStyle==3 and
-  // AllocatePrefetchInstr==1). To be on the safe side, however,
-  // extra space is reserved for all combinations of
-  // AllocatePrefetchStyle and AllocatePrefetchInstr.
-  //
-  // If the C2 compiler is not present, no space is reserved.
-
-  // +1 for rounding up to next cache line, +1 to be safe
-  if (CompilerConfig::is_c2_or_jvmci_compiler_enabled()) {
-    int lines =  MAX2(AllocatePrefetchLines, AllocateInstancePrefetchLines) + 2;
-    _reserve_for_allocation_prefetch = (AllocatePrefetchDistance + AllocatePrefetchStepSize * lines) /
-                                       (int)HeapWordSize;
-  }
-#endif
-
   // During jvm startup, the main thread is initialized
   // before the heap is initialized.  So reinitialize it now.
   guarantee(Thread::current()->is_Java_thread(), "tlab initialization thread not Java thread");
@@ -454,8 +429,7 @@ void ThreadLocalAllocStats::publish() {
 }
 
 size_t ThreadLocalAllocBuffer::end_reserve() {
-  size_t reserve_size = CollectedHeap::lab_alignment_reserve();
-  return MAX2(reserve_size, (size_t)_reserve_for_allocation_prefetch);
+  return CollectedHeap::lab_alignment_reserve();
 }
 
 size_t ThreadLocalAllocBuffer::estimated_used_bytes() const {
diff --git a/src/hotspot/share/gc/shared/threadLocalAllocBuffer.hpp b/src/hotspot/share/gc/shared/threadLocalAllocBuffer.hpp
index 25d9bf00eac..eb664d13961 100644
--- a/src/hotspot/share/gc/shared/threadLocalAllocBuffer.hpp
+++ b/src/hotspot/share/gc/shared/threadLocalAllocBuffer.hpp
@@ -57,7 +57,6 @@ private:
   uint64_t  _allocated_before_last_gc;           // total bytes allocated up until the last gc
 
   static size_t   _max_size;                          // maximum size of any TLAB
-  static int      _reserve_for_allocation_prefetch;   // Reserve at the end of the TLAB
   static unsigned _target_refills;                    // expected number of refills between GCs
 
   unsigned  _number_of_refills;
diff --git a/src/hotspot/share/opto/macro.cpp b/src/hotspot/share/opto/macro.cpp
index b9045ddcf4c..6995cacd1b0 100644
--- a/src/hotspot/share/opto/macro.cpp
+++ b/src/hotspot/share/opto/macro.cpp
@@ -1917,8 +1917,7 @@ Node* PhaseMacroExpand::prefetch_allocation(Node* i_o, Node*& needgc_false,
       transform_later(cache_adr);
       cache_adr = new CastP2XNode(needgc_false, cache_adr);
       transform_later(cache_adr);
-      // Address is aligned to execute prefetch to the beginning of cache line size
-      // (it is important when BIS instruction is used on SPARC as prefetch).
+      // Address is aligned to execute prefetch to the beginning of cache line size.
       Node* mask = _igvn.MakeConX(~(intptr_t)(step_size-1));
       cache_adr = new AndXNode(cache_adr, mask);
       transform_later(cache_adr);
diff --git a/src/hotspot/share/runtime/vmStructs.cpp b/src/hotspot/share/runtime/vmStructs.cpp
index 9796b990b2a..93e0ff2f3b6 100644
--- a/src/hotspot/share/runtime/vmStructs.cpp
+++ b/src/hotspot/share/runtime/vmStructs.cpp
@@ -335,7 +335,6 @@
   nonstatic_field(ThreadLocalAllocBuffer,      _pf_top,                                       HeapWord*)                             \
   nonstatic_field(ThreadLocalAllocBuffer,      _desired_size,                                 size_t)                                \
   nonstatic_field(ThreadLocalAllocBuffer,      _refill_waste_limit,                           size_t)                                \
-     static_field(ThreadLocalAllocBuffer,      _reserve_for_allocation_prefetch,              int)                                   \
      static_field(ThreadLocalAllocBuffer,      _target_refills,                               unsigned)                              \
   nonstatic_field(ThreadLocalAllocBuffer,      _number_of_refills,                            unsigned)                              \
   nonstatic_field(ThreadLocalAllocBuffer,      _refill_waste,                                 unsigned)                              \
diff --git a/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/runtime/ThreadLocalAllocBuffer.java b/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/runtime/ThreadLocalAllocBuffer.java
index 11f03a6003e..683e4b67935 100644
--- a/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/runtime/ThreadLocalAllocBuffer.java
+++ b/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/runtime/ThreadLocalAllocBuffer.java
@@ -76,10 +76,9 @@ public class ThreadLocalAllocBuffer extends VMObject {
 
   private long endReserve() {
     long labAlignmentReserve = VM.getVM().getLabAlignmentReserve();
-    long reserveForAllocationPrefetch = VM.getVM().getReserveForAllocationPrefetch();
     long heapWordSize = VM.getVM().getHeapWordSize();
 
-    return Math.max(labAlignmentReserve, reserveForAllocationPrefetch) * heapWordSize;
+    return labAlignmentReserve * heapWordSize;
   }
 
   /** Support for iteration over heap -- not sure how this will
diff --git a/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/runtime/VM.java b/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/runtime/VM.java
index dc27a4fc59e..1607563150a 100644
--- a/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/runtime/VM.java
+++ b/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/runtime/VM.java
@@ -123,7 +123,6 @@ public class VM {
   private int          invocationEntryBCI;
   private ReversePtrs  revPtrs;
   private VMRegImpl    vmregImpl;
-  private int          reserveForAllocationPrefetch;
   private int          labAlignmentReserve;
 
   // System.getProperties from debuggee VM
@@ -447,8 +446,6 @@ public class VM {
     boolType = (CIntegerType) db.lookupType("bool");
 
     Type threadLocalAllocBuffer = db.lookupType("ThreadLocalAllocBuffer");
-    CIntegerField reserveForAllocationPrefetchField = threadLocalAllocBuffer.getCIntegerField("_reserve_for_allocation_prefetch");
-    reserveForAllocationPrefetch = (int)reserveForAllocationPrefetchField.getCInteger(intType);
 
     Type collectedHeap = db.lookupType("CollectedHeap");
     CIntegerField labAlignmentReserveField = collectedHeap.getCIntegerField("_lab_alignment_reserve");
@@ -915,10 +912,6 @@ public class VM {
     return vmInternalInfo;
   }
 
-  public int getReserveForAllocationPrefetch() {
-    return reserveForAllocationPrefetch;
-  }
-
   public int getLabAlignmentReserve() {
     return labAlignmentReserve;
   }
diff --git a/test/hotspot/jtreg/ProblemList.txt b/test/hotspot/jtreg/ProblemList.txt
index ba63f775223..60d2ffa722f 100644
--- a/test/hotspot/jtreg/ProblemList.txt
+++ b/test/hotspot/jtreg/ProblemList.txt
@@ -83,6 +83,8 @@ compiler/c2/aarch64/TestStaticCallStub.java 8359963 linux-aarch64,macosx-aarch64
 
 compiler/longcountedloops/TestLoopNestTooManyTraps.java 8376591 generic-all
 
+compiler/unsafe/AlignmentGapAccess.java 8373487 generic-all
+
 #############################################################################
 
 # :hotspot_gc
@@ -196,4 +198,3 @@ vmTestbase/nsk/monitoring/ThreadMXBean/findMonitorDeadlockedThreads/find006/Test
 # in either implementation or test code.
 
 #############################################################################
-
diff --git a/test/hotspot/jtreg/compiler/c2/TestAllocatePrefetchStyleLargeFlags.java b/test/hotspot/jtreg/compiler/c2/TestAllocatePrefetchStyleLargeFlags.java
new file mode 100644
index 00000000000..b455107d5f6
--- /dev/null
+++ b/test/hotspot/jtreg/compiler/c2/TestAllocatePrefetchStyleLargeFlags.java
@@ -0,0 +1,79 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+/*
+ * @test
+ * @summary Stress allocation prefetch with large legal AllocatePrefetch* values
+ * @requires vm.compiler2.enabled
+ *
+ * @run main/othervm -Xbatch -XX:-TieredCompilation -XX:+UseTLAB
+ *                   -XX:AllocatePrefetchStyle=1
+ *                   -XX:AllocatePrefetchDistance=512
+ *                   -XX:AllocatePrefetchStepSize=512
+ *                   -XX:AllocatePrefetchLines=64
+ *                   -XX:AllocateInstancePrefetchLines=64
+ *                   compiler.c2.TestAllocatePrefetchStyleLargeFlags
+ * @run main/othervm -Xbatch -XX:-TieredCompilation -XX:+UseTLAB
+ *                   -XX:AllocatePrefetchStyle=2
+ *                   -XX:AllocatePrefetchDistance=512
+ *                   -XX:AllocatePrefetchStepSize=512
+ *                   -XX:AllocatePrefetchLines=64
+ *                   -XX:AllocateInstancePrefetchLines=64
+ *                   compiler.c2.TestAllocatePrefetchStyleLargeFlags
+ * @run main/othervm -Xbatch -XX:-TieredCompilation -XX:+UseTLAB
+ *                   -XX:AllocatePrefetchStyle=3
+ *                   -XX:AllocatePrefetchDistance=512
+ *                   -XX:AllocatePrefetchStepSize=512
+ *                   -XX:AllocatePrefetchLines=64
+ *                   -XX:AllocateInstancePrefetchLines=64
+ *                   compiler.c2.TestAllocatePrefetchStyleLargeFlags
+ */
+
+package compiler.c2;
+
+public class TestAllocatePrefetchStyleLargeFlags {
+    private static volatile Object sink;
+
+    private static final class Payload {
+        private final int value;
+
+        private Payload(int value) {
+            this.value = value;
+        }
+    }
+
+    private static Object allocateInstance(int value) {
+        return new Payload(value);
+    }
+
+    private static Object allocateArray(int value) {
+        return new int[value & 31];
+    }
+
+    public static void main(String[] args) {
+        for (int i = 0; i < 50_000; i++) {
+            sink = allocateInstance(i);
+            sink = allocateArray(i);
+        }
+    }
+}

From 9ef2e8dc1c993a875eb7e47525df277d96066fe1 Mon Sep 17 00:00:00 2001
From: Ivan Bereziuk <Navi.Bereziuk@gmail.com>
Date: Wed, 18 Mar 2026 10:18:19 +0000
Subject: [PATCH 233/655] 8278102: containers/docker/TestJcmd.java failed with
 "RuntimeException: Could not find specified process"

Reviewed-by: kevinw, sgehwolf
---
 test/hotspot/jtreg/ProblemList.txt                 | 1 -
 test/hotspot/jtreg/containers/docker/TestJcmd.java | 8 ++------
 2 files changed, 2 insertions(+), 7 deletions(-)

diff --git a/test/hotspot/jtreg/ProblemList.txt b/test/hotspot/jtreg/ProblemList.txt
index 60d2ffa722f..5bb5bf54fba 100644
--- a/test/hotspot/jtreg/ProblemList.txt
+++ b/test/hotspot/jtreg/ProblemList.txt
@@ -117,7 +117,6 @@ runtime/NMT/VirtualAllocCommitMerge.java 8309698 linux-s390x
 
 applications/jcstress/copy.java 8229852 linux-all
 
-containers/docker/TestJcmd.java 8278102 linux-all
 containers/docker/TestJFREvents.java 8327723 linux-x64
 containers/docker/TestJcmdWithSideCar.java 8341518 linux-x64
 
diff --git a/test/hotspot/jtreg/containers/docker/TestJcmd.java b/test/hotspot/jtreg/containers/docker/TestJcmd.java
index fcd5c665f2b..4f6fda20c86 100644
--- a/test/hotspot/jtreg/containers/docker/TestJcmd.java
+++ b/test/hotspot/jtreg/containers/docker/TestJcmd.java
@@ -170,14 +170,10 @@ public class TestJcmd {
         opts.addDockerOpts("--volume", Utils.TEST_CLASSES + ":/test-classes/:z")
             .addJavaOpts("-cp", "/test-classes/")
             .addDockerOpts("--cap-add=SYS_PTRACE")
+            .addDockerOpts("--pull=never")
             .addDockerOpts("--name", CONTAINER_NAME)
             .addClassOptions("" + TIME_TO_RUN_CONTAINER_PROCESS);
 
-        if (IS_PODMAN && !ROOT_UID.equals(getId("-u"))) {
-            // map the current userid to the one in the target namespace
-            opts.addDockerOpts("--userns=keep-id");
-        }
-
         // avoid large Xmx
         opts.appendTestJavaOptions = false;
 
@@ -186,7 +182,7 @@ public class TestJcmd {
         return ProcessTools.startProcess("main-container-process",
                                       pb,
                                       line -> line.contains(EventGeneratorLoop.MAIN_METHOD_STARTED),
-                                      5, TimeUnit.SECONDS);
+                                      15, TimeUnit.SECONDS);
     }
 
 

From e99ed13691369346386cc22df053c16f96aa6f69 Mon Sep 17 00:00:00 2001
From: Quan Anh Mai <qamai@openjdk.org>
Date: Wed, 18 Mar 2026 11:05:10 +0000
Subject: [PATCH 234/655] 8379671: C2: Fix usage of PhaseGVN::transform in some
 intrinsics

Reviewed-by: bmaillard, dfenacci, roland
---
 src/hotspot/share/opto/library_call.cpp | 75 ++++++++++++-------------
 1 file changed, 37 insertions(+), 38 deletions(-)

diff --git a/src/hotspot/share/opto/library_call.cpp b/src/hotspot/share/opto/library_call.cpp
index ffc798019b4..743612a1051 100644
--- a/src/hotspot/share/opto/library_call.cpp
+++ b/src/hotspot/share/opto/library_call.cpp
@@ -3006,7 +3006,7 @@ bool LibraryCallKit::inline_native_time_funcs(address funcAddr, const char* func
 //   slow path: runtime call
 // }
 bool LibraryCallKit::inline_native_vthread_start_transition(address funcAddr, const char* funcName, bool is_final_transition) {
-  Node* vt_oop = _gvn.transform(must_be_not_null(argument(0), true)); // VirtualThread this argument
+  Node* vt_oop = must_be_not_null(argument(0), true); // VirtualThread this argument
   IdealKit ideal(this);
 
   Node* thread = ideal.thread();
@@ -3026,7 +3026,7 @@ bool LibraryCallKit::inline_native_vthread_start_transition(address funcAddr, co
 
   ideal.if_then(disabled, BoolTest::ne, ideal.ConI(0)); {
     sync_kit(ideal);
-    Node* is_mount = is_final_transition ? ideal.ConI(0) : _gvn.transform(argument(1));
+    Node* is_mount = is_final_transition ? ideal.ConI(0) : argument(1);
     const TypeFunc* tf = OptoRuntime::vthread_transition_Type();
     make_runtime_call(RC_NO_LEAF, tf, funcAddr, funcName, TypePtr::BOTTOM, vt_oop, is_mount);
     ideal.sync_kit(this);
@@ -3038,7 +3038,7 @@ bool LibraryCallKit::inline_native_vthread_start_transition(address funcAddr, co
 }
 
 bool LibraryCallKit::inline_native_vthread_end_transition(address funcAddr, const char* funcName, bool is_first_transition) {
-  Node* vt_oop = _gvn.transform(must_be_not_null(argument(0), true)); // VirtualThread this argument
+  Node* vt_oop = must_be_not_null(argument(0), true); // VirtualThread this argument
   IdealKit ideal(this);
 
   Node* _notify_jvmti_addr = makecon(TypeRawPtr::make((address)MountUnmountDisabler::notify_jvmti_events_address()));
@@ -3046,7 +3046,7 @@ bool LibraryCallKit::inline_native_vthread_end_transition(address funcAddr, cons
 
   ideal.if_then(_notify_jvmti, BoolTest::eq, ideal.ConI(1)); {
     sync_kit(ideal);
-    Node* is_mount = is_first_transition ? ideal.ConI(1) : _gvn.transform(argument(1));
+    Node* is_mount = is_first_transition ? ideal.ConI(1) : argument(1);
     const TypeFunc* tf = OptoRuntime::vthread_transition_Type();
     make_runtime_call(RC_NO_LEAF, tf, funcAddr, funcName, TypePtr::BOTTOM, vt_oop, is_mount);
     ideal.sync_kit(this);
@@ -3077,7 +3077,7 @@ bool LibraryCallKit::inline_native_notify_jvmti_sync() {
   {
     // unconditionally update the is_disable_suspend bit in current JavaThread
     Node* thread = ideal.thread();
-    Node* arg = _gvn.transform(argument(0)); // argument for notification
+    Node* arg = argument(0); // argument for notification
     Node* addr = basic_plus_adr(top(), thread, in_bytes(JavaThread::is_disable_suspend_offset()));
     const TypePtr *addr_type = _gvn.type(addr)->isa_ptr();
 
@@ -3157,7 +3157,7 @@ bool LibraryCallKit::inline_native_classID() {
       ideal.set(result, _gvn.transform(new AddLNode(array_kls_trace_id, longcon(1))));
     } __ else_(); {
       // void class case
-      ideal.set(result, _gvn.transform(longcon(LAST_TYPE_ID + 1)));
+      ideal.set(result, longcon(LAST_TYPE_ID + 1));
     } __ end_if();
 
     Node* signaled_flag_address = makecon(TypeRawPtr::make(JfrIntrinsicSupport::signal_address()));
@@ -3185,9 +3185,9 @@ bool LibraryCallKit::inline_native_jvm_commit() {
   // TLS.
   Node* tls_ptr = _gvn.transform(new ThreadLocalNode());
   // Jfr java buffer.
-  Node* java_buffer_offset = _gvn.transform(new AddPNode(top(), tls_ptr, _gvn.transform(MakeConX(in_bytes(JAVA_BUFFER_OFFSET_JFR)))));
+  Node* java_buffer_offset = _gvn.transform(new AddPNode(top(), tls_ptr, MakeConX(in_bytes(JAVA_BUFFER_OFFSET_JFR))));
   Node* java_buffer = _gvn.transform(new LoadPNode(control(), input_memory_state, java_buffer_offset, TypePtr::BOTTOM, TypeRawPtr::NOTNULL, MemNode::unordered));
-  Node* java_buffer_pos_offset = _gvn.transform(new AddPNode(top(), java_buffer, _gvn.transform(MakeConX(in_bytes(JFR_BUFFER_POS_OFFSET)))));
+  Node* java_buffer_pos_offset = _gvn.transform(new AddPNode(top(), java_buffer, MakeConX(in_bytes(JFR_BUFFER_POS_OFFSET))));
 
   // Load the current value of the notified field in the JfrThreadLocal.
   Node* notified_offset = basic_plus_adr(top(), tls_ptr, in_bytes(NOTIFY_OFFSET_JFR));
@@ -3209,7 +3209,7 @@ bool LibraryCallKit::inline_native_jvm_commit() {
   // Iff notified, the return address of the commit method is the current position of the backing java buffer. This is used to reset the event writer.
   Node* current_pos_X = _gvn.transform(new LoadXNode(control(), input_memory_state, java_buffer_pos_offset, TypeRawPtr::NOTNULL, TypeX_X, MemNode::unordered));
   // Convert the machine-word to a long.
-  Node* current_pos = _gvn.transform(ConvX2L(current_pos_X));
+  Node* current_pos = ConvX2L(current_pos_X);
 
   // False branch, not notified.
   Node* not_notified = _gvn.transform(new IfFalseNode(iff_notified));
@@ -3219,7 +3219,7 @@ bool LibraryCallKit::inline_native_jvm_commit() {
   // Arg is the next position as a long.
   Node* arg = argument(0);
   // Convert long to machine-word.
-  Node* next_pos_X = _gvn.transform(ConvL2X(arg));
+  Node* next_pos_X = ConvL2X(arg);
 
   // Store the next_position to the underlying jfr java buffer.
   store_to_memory(control(), java_buffer_pos_offset, next_pos_X, LP64_ONLY(T_LONG) NOT_LP64(T_INT), MemNode::release);
@@ -3228,9 +3228,9 @@ bool LibraryCallKit::inline_native_jvm_commit() {
   set_all_memory(commit_memory);
 
   // Now load the flags from off the java buffer and decide if the buffer is a lease. If so, it needs to be returned post-commit.
-  Node* java_buffer_flags_offset = _gvn.transform(new AddPNode(top(), java_buffer, _gvn.transform(MakeConX(in_bytes(JFR_BUFFER_FLAGS_OFFSET)))));
+  Node* java_buffer_flags_offset = _gvn.transform(new AddPNode(top(), java_buffer, MakeConX(in_bytes(JFR_BUFFER_FLAGS_OFFSET))));
   Node* flags = make_load(control(), java_buffer_flags_offset, TypeInt::UBYTE, T_BYTE, MemNode::unordered);
-  Node* lease_constant = _gvn.transform(_gvn.intcon(4));
+  Node* lease_constant = _gvn.intcon(4);
 
   // And flags with lease constant.
   Node* lease = _gvn.transform(new AndINode(flags, lease_constant));
@@ -3267,7 +3267,7 @@ bool LibraryCallKit::inline_native_jvm_commit() {
   lease_compare_rgn->init_req(_true_path, call_return_lease_control);
   lease_compare_rgn->init_req(_false_path, not_lease);
 
-  lease_compare_mem->init_req(_true_path, _gvn.transform(reset_memory()));
+  lease_compare_mem->init_req(_true_path, reset_memory());
   lease_compare_mem->init_req(_false_path, commit_memory);
 
   lease_compare_io->init_req(_true_path, i_o());
@@ -3425,10 +3425,10 @@ bool LibraryCallKit::inline_native_getEventWriter() {
                                            IN_HEAP | MO_UNORDERED | C2_MISMATCHED | C2_CONTROL_DEPENDENT_LOAD);
 
   // Mask off the excluded information from the epoch.
-  Node * vthread_is_excluded = _gvn.transform(new AndINode(vthread_epoch_raw, _gvn.transform(excluded_mask)));
+  Node * vthread_is_excluded = _gvn.transform(new AndINode(vthread_epoch_raw, excluded_mask));
 
   // Branch on excluded to conditionalize updating the epoch for the virtual thread.
-  Node* is_excluded_cmp = _gvn.transform(new CmpINode(vthread_is_excluded, _gvn.transform(excluded_mask)));
+  Node* is_excluded_cmp = _gvn.transform(new CmpINode(vthread_is_excluded, excluded_mask));
   Node* test_not_excluded = _gvn.transform(new BoolNode(is_excluded_cmp, BoolTest::ne));
   IfNode* iff_not_excluded = create_and_map_if(control(), test_not_excluded, PROB_MAX, COUNT_UNKNOWN);
 
@@ -3440,7 +3440,7 @@ bool LibraryCallKit::inline_native_getEventWriter() {
   set_control(included);
 
   // Get epoch value.
-  Node* epoch = _gvn.transform(new AndINode(vthread_epoch_raw, _gvn.transform(epoch_mask)));
+  Node* epoch = _gvn.transform(new AndINode(vthread_epoch_raw, epoch_mask));
 
   // Load the current epoch generation. The value is unsigned 16-bit, so we type it as T_CHAR.
   Node* epoch_generation_address = makecon(TypeRawPtr::make(JfrIntrinsicSupport::epoch_generation_address()));
@@ -3478,7 +3478,7 @@ bool LibraryCallKit::inline_native_getEventWriter() {
   // Update control and phi nodes.
   epoch_compare_rgn->init_req(_true_path, call_write_checkpoint_control);
   epoch_compare_rgn->init_req(_false_path, epoch_is_equal);
-  epoch_compare_mem->init_req(_true_path, _gvn.transform(reset_memory()));
+  epoch_compare_mem->init_req(_true_path, reset_memory());
   epoch_compare_mem->init_req(_false_path, input_memory_state);
   epoch_compare_io->init_req(_true_path, i_o());
   epoch_compare_io->init_req(_false_path, input_io_state);
@@ -3519,11 +3519,11 @@ bool LibraryCallKit::inline_native_getEventWriter() {
   vthread_compare_mem->init_req(_false_path, input_memory_state);
   vthread_compare_io->init_req(_true_path, _gvn.transform(exclude_compare_io));
   vthread_compare_io->init_req(_false_path, input_io_state);
-  tid->init_req(_true_path, _gvn.transform(vthread_tid));
-  tid->init_req(_false_path, _gvn.transform(thread_obj_tid));
-  exclusion->init_req(_true_path, _gvn.transform(vthread_is_excluded));
-  exclusion->init_req(_false_path, _gvn.transform(threadObj_is_excluded));
-  pinVirtualThread->init_req(_true_path, _gvn.transform(continuation_support));
+  tid->init_req(_true_path, vthread_tid);
+  tid->init_req(_false_path, thread_obj_tid);
+  exclusion->init_req(_true_path, vthread_is_excluded);
+  exclusion->init_req(_false_path, threadObj_is_excluded);
+  pinVirtualThread->init_req(_true_path, continuation_support);
   pinVirtualThread->init_req(_false_path, _gvn.intcon(0));
 
   // Update branch state.
@@ -3581,9 +3581,9 @@ bool LibraryCallKit::inline_native_getEventWriter() {
   // Update control and phi nodes.
   event_writer_tid_compare_rgn->init_req(_true_path, tid_is_not_equal);
   event_writer_tid_compare_rgn->init_req(_false_path, tid_is_equal);
-  event_writer_tid_compare_mem->init_req(_true_path, _gvn.transform(reset_memory()));
+  event_writer_tid_compare_mem->init_req(_true_path, reset_memory());
   event_writer_tid_compare_mem->init_req(_false_path, _gvn.transform(vthread_compare_mem));
-  event_writer_tid_compare_io->init_req(_true_path, _gvn.transform(i_o()));
+  event_writer_tid_compare_io->init_req(_true_path, i_o());
   event_writer_tid_compare_io->init_req(_false_path, _gvn.transform(vthread_compare_io));
 
   // Result of top level CFG, Memory, IO and Value.
@@ -3598,14 +3598,14 @@ bool LibraryCallKit::inline_native_getEventWriter() {
 
   // Result memory.
   result_mem->init_req(_true_path, _gvn.transform(event_writer_tid_compare_mem));
-  result_mem->init_req(_false_path, _gvn.transform(input_memory_state));
+  result_mem->init_req(_false_path, input_memory_state);
 
   // Result IO.
   result_io->init_req(_true_path, _gvn.transform(event_writer_tid_compare_io));
-  result_io->init_req(_false_path, _gvn.transform(input_io_state));
+  result_io->init_req(_false_path, input_io_state);
 
   // Result value.
-  result_value->init_req(_true_path, _gvn.transform(event_writer)); // return event writer oop
+  result_value->init_req(_true_path, event_writer); // return event writer oop
   result_value->init_req(_false_path, null()); // return null
 
   // Set output state.
@@ -3671,7 +3671,7 @@ void LibraryCallKit::extend_setCurrentThread(Node* jt, Node* thread) {
                                    IN_HEAP | MO_UNORDERED | C2_MISMATCHED | C2_CONTROL_DEPENDENT_LOAD);
 
   // Mask off the excluded information from the epoch.
-  Node * const is_excluded = _gvn.transform(new AndINode(epoch_raw, _gvn.transform(excluded_mask)));
+  Node * const is_excluded = _gvn.transform(new AndINode(epoch_raw, excluded_mask));
 
   // Load the tid field from the thread.
   Node* tid = load_field_from_object(thread, "tid", "J");
@@ -3681,7 +3681,7 @@ void LibraryCallKit::extend_setCurrentThread(Node* jt, Node* thread) {
   Node* tid_memory = store_to_memory(control(), thread_id_offset, tid, T_LONG, MemNode::unordered, true);
 
   // Branch is_excluded to conditionalize updating the epoch .
-  Node* excluded_cmp = _gvn.transform(new CmpINode(is_excluded, _gvn.transform(excluded_mask)));
+  Node* excluded_cmp = _gvn.transform(new CmpINode(is_excluded, excluded_mask));
   Node* test_excluded = _gvn.transform(new BoolNode(excluded_cmp, BoolTest::eq));
   IfNode* iff_excluded = create_and_map_if(control(), test_excluded, PROB_MIN, COUNT_UNKNOWN);
 
@@ -3696,7 +3696,7 @@ void LibraryCallKit::extend_setCurrentThread(Node* jt, Node* thread) {
   Node* vthread_is_included = _gvn.intcon(0);
 
   // Get epoch value.
-  Node* epoch = _gvn.transform(new AndINode(epoch_raw, _gvn.transform(epoch_mask)));
+  Node* epoch = _gvn.transform(new AndINode(epoch_raw, epoch_mask));
 
   // Store the vthread epoch to the jfr thread local.
   Node* vthread_epoch_offset = basic_plus_adr(top(), jt, in_bytes(THREAD_LOCAL_OFFSET_JFR + VTHREAD_EPOCH_OFFSET_JFR));
@@ -3714,8 +3714,8 @@ void LibraryCallKit::extend_setCurrentThread(Node* jt, Node* thread) {
   excluded_rgn->init_req(_false_path, included);
   excluded_mem->init_req(_true_path, tid_memory);
   excluded_mem->init_req(_false_path, included_memory);
-  exclusion->init_req(_true_path, _gvn.transform(vthread_is_excluded));
-  exclusion->init_req(_false_path, _gvn.transform(vthread_is_included));
+  exclusion->init_req(_true_path, vthread_is_excluded);
+  exclusion->init_req(_false_path, vthread_is_included);
 
   // Set intermediate state.
   set_control(_gvn.transform(excluded_rgn));
@@ -3771,7 +3771,6 @@ bool LibraryCallKit::inline_native_setCurrentThread() {
   Node* p = basic_plus_adr(top()/*!oop*/, thread, in_bytes(JavaThread::vthread_offset()));
   Node* thread_obj_handle
     = make_load(nullptr, p, p->bottom_type()->is_ptr(), T_OBJECT, MemNode::unordered);
-  thread_obj_handle = _gvn.transform(thread_obj_handle);
   const TypePtr *adr_type = _gvn.type(thread_obj_handle)->isa_ptr();
   access_store_at(nullptr, thread_obj_handle, adr_type, arr, _gvn.type(arr), T_OBJECT, IN_NATIVE | MO_UNORDERED);
 
@@ -3867,7 +3866,7 @@ bool LibraryCallKit::inline_native_Continuation_pinning(bool unpin) {
   } else {
     pin_count_rhs = _gvn.intcon(UINT32_MAX);
   }
-  Node* pin_count_cmp = _gvn.transform(new CmpUNode(_gvn.transform(pin_count), pin_count_rhs));
+  Node* pin_count_cmp = _gvn.transform(new CmpUNode(pin_count, pin_count_rhs));
   Node* test_pin_count_over_underflow = _gvn.transform(new BoolNode(pin_count_cmp, BoolTest::eq));
   IfNode* iff_pin_count_over_underflow = create_and_map_if(control(), test_pin_count_over_underflow, PROB_MIN, COUNT_UNKNOWN);
 
@@ -3904,10 +3903,10 @@ bool LibraryCallKit::inline_native_Continuation_pinning(bool unpin) {
   PhiNode* result_mem = new PhiNode(result_rgn, Type::MEMORY, TypePtr::BOTTOM);
   record_for_igvn(result_mem);
 
-  result_rgn->init_req(_true_path, _gvn.transform(valid_pin_count));
-  result_rgn->init_req(_false_path, _gvn.transform(continuation_is_null));
-  result_mem->init_req(_true_path, _gvn.transform(reset_memory()));
-  result_mem->init_req(_false_path, _gvn.transform(input_memory_state));
+  result_rgn->init_req(_true_path, valid_pin_count);
+  result_rgn->init_req(_false_path, continuation_is_null);
+  result_mem->init_req(_true_path, reset_memory());
+  result_mem->init_req(_false_path, input_memory_state);
 
   // Set output state.
   set_control(_gvn.transform(result_rgn));

From 262b31be3de42012bf9460e5deb0b43bec6a3fa0 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Manuel=20H=C3=A4ssig?= <mhaessig@openjdk.org>
Date: Wed, 18 Mar 2026 12:33:41 +0000
Subject: [PATCH 235/655] 8359335: Template-Framework Library: Primitive Types
 subtyping

Reviewed-by: chagedorn, epeter
---
 .../jtreg/compiler/igvn/ExpressionFuzzer.java |  5 ++-
 .../library/Expression.java                   | 31 +++++++++++--
 .../library/Operations.java                   | 13 +++++-
 .../library/PrimitiveType.java                | 20 ++++++++-
 .../examples/TestPrimitiveTypes.java          | 20 ++++++++-
 .../tests/TestExpression.java                 | 45 ++++++++++++++++---
 6 files changed, 116 insertions(+), 18 deletions(-)

diff --git a/test/hotspot/jtreg/compiler/igvn/ExpressionFuzzer.java b/test/hotspot/jtreg/compiler/igvn/ExpressionFuzzer.java
index 875ef57c865..33be24a0367 100644
--- a/test/hotspot/jtreg/compiler/igvn/ExpressionFuzzer.java
+++ b/test/hotspot/jtreg/compiler/igvn/ExpressionFuzzer.java
@@ -52,6 +52,7 @@ import static compiler.lib.template_framework.Template.let;
 import static compiler.lib.template_framework.Template.$;
 import compiler.lib.template_framework.library.CodeGenerationDataNameType;
 import compiler.lib.template_framework.library.Expression;
+import compiler.lib.template_framework.library.Expression.Nesting;
 import compiler.lib.template_framework.library.Operations;
 import compiler.lib.template_framework.library.PrimitiveType;
 import compiler.lib.template_framework.library.TestFrameworkClass;
@@ -335,7 +336,7 @@ public class ExpressionFuzzer {
             for (int i = 0; i < 10; i++) {
                 // The depth determines roughly how many operations are going to be used in the expression.
                 int depth = RANDOM.nextInt(1, 20);
-                Expression expression = Expression.nestRandomly(type, Operations.PRIMITIVE_OPERATIONS, depth);
+                Expression expression = Expression.nestRandomly(type, Operations.PRIMITIVE_OPERATIONS, depth, Nesting.EXACT);
                 tests.add(testTemplate.asToken(expression));
             }
         }
@@ -350,7 +351,7 @@ public class ExpressionFuzzer {
             for (int i = 0; i < 2; i++) {
                 // The depth determines roughly how many operations are going to be used in the expression.
                 int depth = RANDOM.nextInt(1, 20);
-                Expression expression = Expression.nestRandomly(type, Operations.SCALAR_NUMERIC_OPERATIONS, depth);
+                Expression expression = Expression.nestRandomly(type, Operations.SCALAR_NUMERIC_OPERATIONS, depth, Nesting.EXACT);
                 tests.add(testTemplate.asToken(expression));
             }
         }
diff --git a/test/hotspot/jtreg/compiler/lib/template_framework/library/Expression.java b/test/hotspot/jtreg/compiler/lib/template_framework/library/Expression.java
index 43ab16af415..37ad4debde6 100644
--- a/test/hotspot/jtreg/compiler/lib/template_framework/library/Expression.java
+++ b/test/hotspot/jtreg/compiler/lib/template_framework/library/Expression.java
@@ -382,6 +382,23 @@ public class Expression {
         return sb.toString();
     }
 
+    /**
+     * {@link Nesting} defines the different ways of selecting {@link Expression}s
+     * to nest based on their types.
+     */
+    public enum Nesting {
+        /**
+         * Only nest {@Expression}s where the argument and return types match exactly
+         * based on the implementation of {@link CodeGenerateionDataNameType#isSubtypeOf}.
+         */
+        EXACT,
+        /**
+         * Only nest {@Expression}s where the return type is a subtype of the argument
+         * type based on the implemetation of {@link CodeGenerateionDataNameType#isSubtypeOf}.
+         */
+        SUBTYPE
+    }
+
     /**
      * Create a nested {@link Expression} with a specified {@code returnType} from a
      * set of {@code expressions}.
@@ -391,11 +408,13 @@ public class Expression {
      *                    the nested {@link Expression}.
      * @param maxNumberOfUsedExpressions the maximal number of {@link Expression}s from the
      *                                   {@code expressions} are nested.
+     * @param nesting control the {@link Nesting} of the sampled {@link Expression}s.
      * @return a new randomly nested {@link Expression}.
      */
     public static Expression nestRandomly(CodeGenerationDataNameType returnType,
                                           List<Expression> expressions,
-                                          int maxNumberOfUsedExpressions) {
+                                          int maxNumberOfUsedExpressions,
+                                          Nesting nesting) {
         List<Expression> filtered = expressions.stream().filter(e -> e.returnType.isSubtypeOf(returnType)).toList();
 
         if (filtered.isEmpty()) {
@@ -406,7 +425,7 @@ public class Expression {
         Expression expression = filtered.get(r);
 
         for (int i = 1; i < maxNumberOfUsedExpressions; i++) {
-            expression = expression.nestRandomly(expressions);
+            expression = expression.nestRandomly(expressions, nesting);
         }
         return expression;
     }
@@ -416,12 +435,16 @@ public class Expression {
      * {@code this} {@link Expression}, ensuring compatibility of argument and return type.
      *
      * @param nestingExpressions list of expressions we sample from for the inner {@link Expression}.
+     * @param nesting control the {@link Nesting} of the sampled {@link Expression}s.
      * @return a new nested {@link Expression}.
      */
-    public Expression nestRandomly(List<Expression> nestingExpressions) {
+    public Expression nestRandomly(List<Expression> nestingExpressions, Nesting nesting) {
         int argumentIndex = RANDOM.nextInt(this.argumentTypes.size());
         CodeGenerationDataNameType argumentType = this.argumentTypes.get(argumentIndex);
-        List<Expression> filtered = nestingExpressions.stream().filter(e -> e.returnType.isSubtypeOf(argumentType)).toList();
+        List<Expression> filtered = nestingExpressions.stream()
+                                                      .filter(e -> e.returnType.isSubtypeOf(argumentType) &&
+                                                                (nesting == Nesting.EXACT ? argumentType.isSubtypeOf(e.returnType) : true))
+                                                      .toList();
 
         if (filtered.isEmpty()) {
             // Found no expression that has a matching returnType.
diff --git a/test/hotspot/jtreg/compiler/lib/template_framework/library/Operations.java b/test/hotspot/jtreg/compiler/lib/template_framework/library/Operations.java
index 1fe05cc2b6c..2ea251cc5e5 100644
--- a/test/hotspot/jtreg/compiler/lib/template_framework/library/Operations.java
+++ b/test/hotspot/jtreg/compiler/lib/template_framework/library/Operations.java
@@ -129,8 +129,17 @@ public final class Operations {
             ops.add(Expression.make(type, "(", type, " + ", type, ")"));
             ops.add(Expression.make(type, "(", type, " - ", type, ")"));
             ops.add(Expression.make(type, "(", type, " * ", type, ")"));
-            ops.add(Expression.make(type, "(", type, " / ", type, ")"));
-            ops.add(Expression.make(type, "(", type, " % ", type, ")"));
+            // Because of subtyping, we can sample an expression like `(float)((int)(3) / (int)(0))`. Floating point
+            // division and modulo do not throw an ArithmeticException on division by zero, integer division and modulo
+            // do. In the expression above, the division has an integer on both sides, so it is executed as an integer
+            // division and throws an ArithmeticException even though we would expect the float division not to do so.
+            // To prevent this issue, we provide two versions of floating point division operations: one that casts
+            // its operands and one that expects that an ArithmeticException might be thrown when we get unlucky when
+            // sampling subtypes.
+            ops.add(Expression.make(type, "((" + type.name() + ")(", type, ") / (" + type.name() +")(", type, "))"));
+            ops.add(Expression.make(type, "((" + type.name() + ")(", type, ") % (" + type.name() +")(", type, "))"));
+            ops.add(Expression.make(type, "(", type, " / ", type, ")", WITH_ARITHMETIC_EXCEPTION));
+            ops.add(Expression.make(type, "(", type, " % ", type, ")", WITH_ARITHMETIC_EXCEPTION));
 
             // Relational / Comparison Operators
             ops.add(Expression.make(BOOLEANS, "(", type, " == ", type, ")"));
diff --git a/test/hotspot/jtreg/compiler/lib/template_framework/library/PrimitiveType.java b/test/hotspot/jtreg/compiler/lib/template_framework/library/PrimitiveType.java
index c8541ac1fa6..b20dbb28d22 100644
--- a/test/hotspot/jtreg/compiler/lib/template_framework/library/PrimitiveType.java
+++ b/test/hotspot/jtreg/compiler/lib/template_framework/library/PrimitiveType.java
@@ -71,7 +71,25 @@ public final class PrimitiveType implements CodeGenerationDataNameType {
 
     @Override
     public boolean isSubtypeOf(DataName.Type other) {
-        return (other instanceof PrimitiveType pt) && pt.kind == kind;
+        // Implement other >: this according to JLS §4.10.1.
+        if (other instanceof PrimitiveType superType) {
+            if (superType.kind == Kind.BOOLEAN || kind == Kind.BOOLEAN) {
+                // Boolean does not have a supertype and only itself as a subtype.
+                return superType.kind == this.kind;
+            }
+            if (superType.kind == Kind.CHAR || kind == Kind.CHAR) {
+                // Char does not have a subtype, but it is itself a subtype of any primitive type with
+                // a larger byte size. The following is correct for the subtype relation to floats,
+                // since chars are 16 bits wide and floats 32 bits or more.
+                return superType.kind == this.kind || (superType.byteSize() > this.byteSize() && this.kind != Kind.BYTE);
+            }
+            // Due to float >: long, all integers are subtypes of floating point types.
+            return (superType.isFloating() && !this.isFloating()) ||
+                   // Generally, narrower types are subtypes of wider types.
+                   (superType.isFloating() == this.isFloating() && superType.byteSize() >= this.byteSize());
+        }
+
+        return false;
     }
 
     @Override
diff --git a/test/hotspot/jtreg/testlibrary_tests/template_framework/examples/TestPrimitiveTypes.java b/test/hotspot/jtreg/testlibrary_tests/template_framework/examples/TestPrimitiveTypes.java
index 6193b6aad0c..facaefaa8f3 100644
--- a/test/hotspot/jtreg/testlibrary_tests/template_framework/examples/TestPrimitiveTypes.java
+++ b/test/hotspot/jtreg/testlibrary_tests/template_framework/examples/TestPrimitiveTypes.java
@@ -48,6 +48,7 @@ import static compiler.lib.template_framework.Template.let;
 import static compiler.lib.template_framework.Template.$;
 import static compiler.lib.template_framework.Template.addDataName;
 import static compiler.lib.template_framework.DataName.Mutability.MUTABLE;
+import static compiler.lib.template_framework.DataName.Mutability.MUTABLE_OR_IMMUTABLE;
 
 import compiler.lib.template_framework.library.Hooks;
 import compiler.lib.template_framework.library.CodeGenerationDataNameType;
@@ -129,7 +130,8 @@ public class TestPrimitiveTypes {
         }
 
         // Finally, test the type by creating some DataNames (variables), and sampling
-        // from them. There should be no cross-over between the types.
+        // from them. Sampling exactly should not lead to any conversion and sampling
+        // subtypes should only lead to widening conversions.
         // IMPORTANT: since we are adding the DataName via an inserted Template, we
         //            must chose a "transparentScope", so that the DataName escapes. If we
         //            instead chose "scope", the test would fail, because it later
@@ -150,6 +152,14 @@ public class TestPrimitiveTypes {
             """
         ));
 
+        var assignmentTemplate = Template.make("lhsType", (PrimitiveType lhsType) -> scope(
+            dataNames(MUTABLE).exactOf(lhsType).sampleAndLetAs("lhs"),
+            dataNames(MUTABLE_OR_IMMUTABLE).subtypeOf(lhsType).sampleAndLetAs("rhs"),
+            """
+            #lhs = #rhs;
+            """
+        ));
+
         var namesTemplate = Template.make(() -> scope(
             """
             public static void test_names() {
@@ -161,10 +171,16 @@ public class TestPrimitiveTypes {
                     ).toList()
                 ),
                 """
-                // Now sample:
+                // Sample exactly:
                 """,
                 Collections.nCopies(10,
                     CodeGenerationDataNameType.PRIMITIVE_TYPES.stream().map(sampleTemplate::asToken).toList()
+                ),
+                """
+                // Sample subtypes:
+                """,
+                Collections.nCopies(10,
+                    CodeGenerationDataNameType.PRIMITIVE_TYPES.stream().map(assignmentTemplate::asToken).toList()
                 )
             )),
             """
diff --git a/test/hotspot/jtreg/testlibrary_tests/template_framework/tests/TestExpression.java b/test/hotspot/jtreg/testlibrary_tests/template_framework/tests/TestExpression.java
index b34538c39c1..609b0936079 100644
--- a/test/hotspot/jtreg/testlibrary_tests/template_framework/tests/TestExpression.java
+++ b/test/hotspot/jtreg/testlibrary_tests/template_framework/tests/TestExpression.java
@@ -41,6 +41,7 @@ import compiler.lib.template_framework.TemplateToken;
 import static compiler.lib.template_framework.Template.scope;
 import compiler.lib.template_framework.library.CodeGenerationDataNameType;
 import compiler.lib.template_framework.library.Expression;
+import compiler.lib.template_framework.library.Expression.Nesting;
 
 /**
  * This tests the use of the {@link Expression} from the template library. This is
@@ -174,44 +175,74 @@ public class TestExpression {
         Expression e4 = Expression.make(myTypeA1, "<", myTypeA, ">");
         Expression e5 = Expression.make(myTypeA, "[", myTypeB, "]");
 
-        Expression e1e2 = e1.nestRandomly(List.of(e2));
-        Expression e1ex = e1.nestRandomly(List.of(e3, e2, e3));
-        Expression e1e4 = e1.nestRandomly(List.of(e3, e4, e3));
-        Expression e1ey = e1.nestRandomly(List.of(e3, e3));
+        Expression e1e2 = e1.nestRandomly(List.of(e2), Nesting.SUBTYPE);
+        Expression e1e2Exact = e1.nestRandomly(List.of(e2), Nesting.EXACT);
+        Expression e1ex = e1.nestRandomly(List.of(e3, e2, e3), Nesting.SUBTYPE);
+        Expression e1exExact = e1.nestRandomly(List.of(e3, e2, e3), Nesting.EXACT);
+        Expression e1e4 = e1.nestRandomly(List.of(e3, e4, e3), Nesting.SUBTYPE);
+        Expression e1e4Exact = e1.nestRandomly(List.of(e3, e4, e3), Nesting.EXACT);
+        Expression e1ey = e1.nestRandomly(List.of(e3, e3), Nesting.SUBTYPE);
+        Expression e1eyExact = e1.nestRandomly(List.of(e3, e3), Nesting.EXACT);
 
         // 5-deep nesting of e1
-        Expression deep1 = Expression.nestRandomly(myTypeA, List.of(e1, e3), 5);
+        Expression deep1 = Expression.nestRandomly(myTypeA, List.of(e1, e3), 5, Nesting.SUBTYPE);
+        Expression deep1Exact = Expression.nestRandomly(myTypeA, List.of(e1, e3), 5, Nesting.EXACT);
         // Alternating pattern
-        Expression deep2 = Expression.nestRandomly(myTypeA, List.of(e5, e3), 5);
+        Expression deep2 = Expression.nestRandomly(myTypeA, List.of(e5, e3), 5, Nesting.SUBTYPE);
+        Expression deep2Exact = Expression.nestRandomly(myTypeA, List.of(e5, e3), 5, Nesting.SUBTYPE);
 
         var template = Template.make(() -> scope(
             "xx", e1e2.toString(), "yy\n",
+            "xx", e1e2Exact.toString(), "yy\n",
             "xx", e1ex.toString(), "yy\n",
+            "xx", e1exExact.toString(), "yy\n",
             "xx", e1e4.toString(), "yy\n",
+            "xx", e1e4Exact.toString(), "yy\n",
             "xx", e1ey.toString(), "yy\n",
+            "xx", e1eyExact.toString(), "yy\n",
             "xx", deep1.toString(), "yy\n",
+            "xx", deep1Exact.toString(), "yy\n",
             "xx", deep2.toString(), "yy\n",
+            "xx", deep2Exact.toString(), "yy\n",
             "xx", e1e2.asToken(List.of("a")), "yy\n",
+            "xx", e1e2Exact.asToken(List.of("a")), "yy\n",
             "xx", e1ex.asToken(List.of("a")), "yy\n",
+            "xx", e1exExact.asToken(List.of("a")), "yy\n",
             "xx", e1e4.asToken(List.of("a")), "yy\n",
+            "xx", e1e4Exact.asToken(List.of("a")), "yy\n",
             "xx", e1ey.asToken(List.of("a")), "yy\n",
+            "xx", e1eyExact.asToken(List.of("a")), "yy\n",
             "xx", deep1.asToken(List.of("a")), "yy\n",
-            "xx", deep2.asToken(List.of("a")), "yy\n"
+            "xx", deep1Exact.asToken(List.of("a")), "yy\n",
+            "xx", deep2.asToken(List.of("a")), "yy\n",
+            "xx", deep2Exact.asToken(List.of("a")), "yy\n"
         ));
 
         String expected =
             """
             xxExpression["[(", MyTypeA, ")]"]yy
             xxExpression["[(", MyTypeA, ")]"]yy
+            xxExpression["[(", MyTypeA, ")]"]yy
+            xxExpression["[(", MyTypeA, ")]"]yy
             xxExpression["[<", MyTypeA, ">]"]yy
             xxExpression["[", MyTypeA, "]"]yy
+            xxExpression["[", MyTypeA, "]"]yy
+            xxExpression["[", MyTypeA, "]"]yy
+            xxExpression["[[[[[", MyTypeA, "]]]]]"]yy
             xxExpression["[[[[[", MyTypeA, "]]]]]"]yy
             xxExpression["[{[{[", MyTypeB, "]}]}]"]yy
+            xxExpression["[{[{[", MyTypeB, "]}]}]"]yy
+            xx[(a)]yy
+            xx[(a)]yy
             xx[(a)]yy
             xx[(a)]yy
             xx[<a>]yy
             xx[a]yy
+            xx[a]yy
+            xx[a]yy
             xx[[[[[a]]]]]yy
+            xx[[[[[a]]]]]yy
+            xx[{[{[a]}]}]yy
             xx[{[{[a]}]}]yy
             """;
         String code = template.render();

From 08ff2bf4d0541f7b3fd7c4a9c7f386cb710510af Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Eirik=20Bj=C3=B8rsn=C3=B8s?= <eirbjo@openjdk.org>
Date: Wed, 18 Mar 2026 14:12:43 +0000
Subject: [PATCH 236/655] 8376398: [TESTBUG] Testing of Unsafe native
 (re)allocation is sensitive to current JDK native memory use

Reviewed-by: azafari
---
 test/hotspot/jtreg/runtime/Unsafe/AllocateMemory.java | 4 ++--
 test/hotspot/jtreg/runtime/Unsafe/Reallocate.java     | 4 ++--
 2 files changed, 4 insertions(+), 4 deletions(-)

diff --git a/test/hotspot/jtreg/runtime/Unsafe/AllocateMemory.java b/test/hotspot/jtreg/runtime/Unsafe/AllocateMemory.java
index 7d8d33b1225..b18bcb8cc13 100644
--- a/test/hotspot/jtreg/runtime/Unsafe/AllocateMemory.java
+++ b/test/hotspot/jtreg/runtime/Unsafe/AllocateMemory.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2015, 2022, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2015, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -61,7 +61,7 @@ public class AllocateMemory {
         // allocateMemory() should throw an OutOfMemoryError when the underlying malloc fails,
         // since we start with -XX:MallocLimit
         try {
-            address = unsafe.allocateMemory(100 * 1024 * 1024);
+            address = unsafe.allocateMemory(101 * 1024 * 1024);
             throw new RuntimeException("Did not get expected OutOfMemoryError");
         } catch (OutOfMemoryError e) {
             // Expected
diff --git a/test/hotspot/jtreg/runtime/Unsafe/Reallocate.java b/test/hotspot/jtreg/runtime/Unsafe/Reallocate.java
index c15b931449d..dc0ce86fa1f 100644
--- a/test/hotspot/jtreg/runtime/Unsafe/Reallocate.java
+++ b/test/hotspot/jtreg/runtime/Unsafe/Reallocate.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2015, 2022, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2015, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -62,7 +62,7 @@ public class Reallocate {
 
         // Make sure we can throw an OOME when we fail to reallocate due to OOM
         try {
-            unsafe.reallocateMemory(address, 100 * 1024 * 1024);
+            unsafe.reallocateMemory(address, 101 * 1024 * 1024);
         } catch (OutOfMemoryError e) {
             // Expected
             return;

From 00a77704b00eb4a4d4356695329fb0e247bb3028 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mar=C3=ADa=20Arias=20de=20Reyna=20Dom=C3=ADnguez?=
 <mariasde@openjdk.org>
Date: Wed, 18 Mar 2026 14:26:48 +0000
Subject: [PATCH 237/655] 8380292: Confusing "reverted *" messages during
 training

Reviewed-by: adinn, asmehra
---
 src/hotspot/share/oops/constantPool.cpp | 2 +-
 src/hotspot/share/oops/cpCache.cpp      | 6 +++---
 2 files changed, 4 insertions(+), 4 deletions(-)

diff --git a/src/hotspot/share/oops/constantPool.cpp b/src/hotspot/share/oops/constantPool.cpp
index 456333efad0..8d817178d1a 100644
--- a/src/hotspot/share/oops/constantPool.cpp
+++ b/src/hotspot/share/oops/constantPool.cpp
@@ -564,7 +564,7 @@ void ConstantPool::remove_resolved_klass_if_non_deterministic(int cp_index) {
   }
 
   LogStreamHandle(Trace, aot, resolve) log;
-  if (log.is_enabled()) {
+  if (log.is_enabled() && !CDSConfig::is_dumping_preimage_static_archive()) {
     ResourceMark rm;
     log.print("%s klass  CP entry [%3d]: %s %s",
               (can_archive ? "archived" : "reverted"),
diff --git a/src/hotspot/share/oops/cpCache.cpp b/src/hotspot/share/oops/cpCache.cpp
index edb5f6714c0..4177e4601ef 100644
--- a/src/hotspot/share/oops/cpCache.cpp
+++ b/src/hotspot/share/oops/cpCache.cpp
@@ -450,7 +450,7 @@ void ConstantPoolCache::remove_resolved_field_entries_if_non_deterministic() {
       Symbol* klass_name = cp->klass_name_at(klass_cp_index);
       Symbol* name = cp->uncached_name_ref_at(cp_index);
       Symbol* signature = cp->uncached_signature_ref_at(cp_index);
-      if (resolved) {
+      if (resolved && !CDSConfig::is_dumping_preimage_static_archive()) {
         log.print("%s field  CP entry [%3d]: %s => %s.%s:%s%s%s",
                   (archived ? "archived" : "reverted"),
                   cp_index,
@@ -493,7 +493,7 @@ void ConstantPoolCache::remove_resolved_method_entries_if_non_deterministic() {
       Symbol* name = cp->uncached_name_ref_at(cp_index);
       Symbol* signature = cp->uncached_signature_ref_at(cp_index);
       LogStream ls(lt);
-      if (resolved) {
+      if (resolved && !CDSConfig::is_dumping_preimage_static_archive()) {
         ls.print("%s%s method CP entry [%3d]: %s %s.%s:%s",
                 (archived ? "archived" : "reverted"),
                 (rme->is_resolved(Bytecodes::_invokeinterface) ? " interface" : ""),
@@ -539,7 +539,7 @@ void ConstantPoolCache::remove_resolved_indy_entries_if_non_deterministic() {
       Symbol* bsm_name = cp->uncached_name_ref_at(bsm_ref);
       Symbol* bsm_signature = cp->uncached_signature_ref_at(bsm_ref);
       Symbol* bsm_klass = cp->klass_name_at(cp->uncached_klass_ref_index_at(bsm_ref));
-      if (resolved) {
+      if (resolved && !CDSConfig::is_dumping_preimage_static_archive()) {
         log.print("%s indy   CP entry [%3d]: %s (%d)",
                   (archived ? "archived" : "reverted"),
                   cp_index, cp->pool_holder()->name()->as_C_string(), i);

From 0379c0b005f4e99cb0f22ef6c43608697e805422 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Eirik=20Bj=C3=B8rsn=C3=B8s?= <eirbjo@openjdk.org>
Date: Wed, 18 Mar 2026 14:36:58 +0000
Subject: [PATCH 238/655] 8379557: Further optimize URL.toExternalForm

Reviewed-by: vyazici
---
 .../classes/java/net/URLStreamHandler.java    | 35 +++++++--
 test/jdk/java/net/URL/Constructor.java        | 19 ++++-
 .../openjdk/bench/java/net/URLToString.java   | 77 +++++++++++++++++++
 3 files changed, 122 insertions(+), 9 deletions(-)
 create mode 100644 test/micro/org/openjdk/bench/java/net/URLToString.java

diff --git a/src/java.base/share/classes/java/net/URLStreamHandler.java b/src/java.base/share/classes/java/net/URLStreamHandler.java
index f66902a451e..76807d27cee 100644
--- a/src/java.base/share/classes/java/net/URLStreamHandler.java
+++ b/src/java.base/share/classes/java/net/URLStreamHandler.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1995, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1995, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -481,14 +481,33 @@ public abstract class URLStreamHandler {
      * @return  a string representation of the {@code URL} argument.
      */
     protected String toExternalForm(URL u) {
-        String s;
+        // The fast paths and branch-free concatenations in this method are here for
+        // a reason and should not be updated without checking performance figures.
+
+        // Optionality, subtly different for authority
+        boolean emptyAuth = u.getAuthority() == null || u.getAuthority().isEmpty();
+        boolean emptyPath = u.getPath() == null;
+        boolean emptyQuery = u.getQuery() == null;
+        boolean emptyRef = u.getRef() == null;
+        var path = emptyPath ? "" : u.getPath();
+        // Fast paths for empty components
+        if (emptyQuery && emptyRef) {
+            return emptyAuth
+                    ? (u.getProtocol() + ":" + path)
+                    : (u.getProtocol() + "://" + u.getAuthority() + path);
+        }
+        // Prefer locals for efficient concatenation
+        var authSep = emptyAuth ? ":" : "://";
+        var auth = emptyAuth ? "" : u.getAuthority();
+        var querySep = emptyQuery ? "" : "?";
+        var query = emptyQuery ? "" : u.getQuery();
+        var refSep = emptyRef ? "" : "#";
+        var ref = emptyRef ? "" : u.getRef();
         return u.getProtocol()
-            + ':'
-            + ((s = u.getAuthority()) != null && !s.isEmpty()
-               ? "//" + s : "")
-            + ((s = u.getPath()) != null ? s : "")
-            + ((s = u.getQuery()) != null ? '?' + s : "")
-            + ((s = u.getRef()) != null ? '#' + s : "");
+                + authSep + auth
+                + path
+                + querySep + query
+                + refSep + ref;
     }
 
     /**
diff --git a/test/jdk/java/net/URL/Constructor.java b/test/jdk/java/net/URL/Constructor.java
index 13eae40d6d4..b1d6dc91bc4 100644
--- a/test/jdk/java/net/URL/Constructor.java
+++ b/test/jdk/java/net/URL/Constructor.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1998, 2013, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1998, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -48,6 +48,7 @@ public class Constructor {
         entries.addAll(Arrays.asList(jarURLs));
         entries.addAll(Arrays.asList(normalHttpURLs));
         entries.addAll(Arrays.asList(abnormalHttpURLs));
+        entries.addAll(Arrays.asList(blankComponents));
         if (hasFtp())
             entries.addAll(Arrays.asList(ftpURLs));
         URL url;
@@ -252,4 +253,20 @@ public class Constructor {
                   "/dir1/entry.txt",
                   "ftp://br:pwd@ftp.foo.com/dir1/entry.txt")
     };
+
+    static Entry[] blankComponents = new Entry[] {
+        new Entry(null, "http://host/path#", "http://host/path#"),
+        new Entry(null, "http://host/path?", "http://host/path?"),
+        new Entry(null, "http://host/path?#", "http://host/path?#"),
+        new Entry(null, "http://host/path#?", "http://host/path#?"),
+        new Entry(null, "file:/path#", "file:/path#"),
+        new Entry(null, "file:/path?", "file:/path?"),
+        new Entry(null, "file:/path?#", "file:/path?#"),
+        new Entry(null, "file:///path#", "file:/path#"),
+        new Entry(null, "file:///path?", "file:/path?"),
+        new Entry(null, "file:/path#?", "file:/path#?"),
+        new Entry("file:/path", "path?#", "file:/path?#"),
+        new Entry(null, "file:", "file:"),
+        new Entry(null, "file:#", "file:#")
+    };
 }
diff --git a/test/micro/org/openjdk/bench/java/net/URLToString.java b/test/micro/org/openjdk/bench/java/net/URLToString.java
new file mode 100644
index 00000000000..38f6500c573
--- /dev/null
+++ b/test/micro/org/openjdk/bench/java/net/URLToString.java
@@ -0,0 +1,77 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+package org.openjdk.bench.java.net;
+
+import org.openjdk.jmh.annotations.*;
+
+import java.net.MalformedURLException;
+import java.net.URI;
+import java.net.URL;
+import java.util.concurrent.TimeUnit;
+
+/**
+ * Tests java.net.URL.toString performance
+ */
+@BenchmarkMode(Mode.AverageTime)
+@OutputTimeUnit(TimeUnit.NANOSECONDS)
+@State(Scope.Thread)
+@Warmup(iterations = 5, time = 1)
+@Measurement(iterations = 5, time = 1)
+@Fork(value = 3)
+public class URLToString {
+
+    @Param({"false", "true"})
+    boolean auth;
+
+    @Param({"false", "true"})
+    boolean query;
+
+    @Param({"false", "true"})
+    boolean ref;
+
+    private URL url;
+
+    @Setup()
+    public void setup() throws MalformedURLException {
+        StringBuilder sb = new StringBuilder();
+        if (auth) {
+            sb.append("http://hostname");
+        } else {
+            sb.append("file:");
+        }
+        sb.append("/some/long/path/to/jar/app-1.0.jar!/org/summerframework/samples/horseclinic/HorseClinicApplication.class");
+        if (query) {
+            sb.append("?param=value");
+        }
+        if (ref) {
+            sb.append("#fragment");
+        }
+
+        url = URI.create(sb.toString()).toURL();
+    }
+
+    @Benchmark
+    public String urlToString() {
+        return url.toString();
+    }
+}

From 766959f884be63e7f65175c6e685a10445c8a182 Mon Sep 17 00:00:00 2001
From: Ashay Rane <253344819+raneashay@users.noreply.github.com>
Date: Wed, 18 Mar 2026 15:15:12 +0000
Subject: [PATCH 239/655] 8371685: C2: Add flag to disable Loop Peeling

Reviewed-by: chagedorn, snatarajan, roland
---
 src/hotspot/share/opto/c2_globals.hpp         |  9 ++
 src/hotspot/share/opto/loopTransform.cpp      | 22 +++++
 src/hotspot/share/opto/loopnode.cpp           |  8 +-
 .../compiler/loopopts/TestLoopPeeling.java    | 37 +++++++-
 .../loopopts/TestLoopPeelingDisabled.java     | 89 +++++++++++++++++++
 5 files changed, 158 insertions(+), 7 deletions(-)
 create mode 100644 test/hotspot/jtreg/compiler/loopopts/TestLoopPeelingDisabled.java

diff --git a/src/hotspot/share/opto/c2_globals.hpp b/src/hotspot/share/opto/c2_globals.hpp
index 1662f808286..66a6f2d0c3c 100644
--- a/src/hotspot/share/opto/c2_globals.hpp
+++ b/src/hotspot/share/opto/c2_globals.hpp
@@ -334,6 +334,15 @@
   product(bool, PartialPeelLoop, true,                                      \
           "Partial peel (rotate) loops")                                    \
                                                                             \
+  product(uint, LoopPeeling, 1, DIAGNOSTIC,                                 \
+          "Control loop peeling optimization: "                             \
+          "0 = always disable loop peeling, "                               \
+          "1 = enable loop peeling (default), "                             \
+          "2 = disable loop peeling as a standalone optimization but "      \
+          "allow it as a helper to other loop optimizations like removing " \
+          "empty loops")                                                    \
+          range(0, 2)                                                       \
+                                                                            \
   product(intx, PartialPeelNewPhiDelta, 0,                                  \
           "Additional phis that can be created by partial peeling")         \
           range(0, max_jint)                                                \
diff --git a/src/hotspot/share/opto/loopTransform.cpp b/src/hotspot/share/opto/loopTransform.cpp
index 4e221a9a0ef..1801841bad3 100644
--- a/src/hotspot/share/opto/loopTransform.cpp
+++ b/src/hotspot/share/opto/loopTransform.cpp
@@ -524,6 +524,9 @@ bool IdealLoopTree::policy_peeling(PhaseIdealLoop *phase) {
 // return the estimated loop size if peeling is applicable, otherwise return
 // zero. No node budget is allocated.
 uint IdealLoopTree::estimate_peeling(PhaseIdealLoop *phase) {
+  if (LoopPeeling != 1) {
+    return 0;
+  }
 
   // If nodes are depleted, some transform has miscalculated its needs.
   assert(!phase->exceeding_node_budget(), "sanity");
@@ -775,6 +778,7 @@ void PhaseIdealLoop::peeled_dom_test_elim(IdealLoopTree* loop, Node_List& old_ne
 //             exit
 //
 void PhaseIdealLoop::do_peeling(IdealLoopTree *loop, Node_List &old_new) {
+  assert(LoopPeeling != 0, "do_peeling called with loop peeling always disabled");
 
   C->set_major_progress();
   // Peeling a 'main' loop in a pre/main/post situation obfuscates the
@@ -2201,6 +2205,15 @@ void PhaseIdealLoop::do_maximally_unroll(IdealLoopTree *loop, Node_List &old_new
 
   // If loop is tripping an odd number of times, peel odd iteration
   if ((cl->trip_count() & 1) == 1) {
+    if (LoopPeeling == 0) {
+#ifndef PRODUCT
+      if (TraceLoopOpts) {
+        tty->print("MaxUnroll cancelled since LoopPeeling is always disabled");
+        loop->dump_head();
+      }
+#endif
+      return;
+    }
     do_peeling(loop, old_new);
   }
 
@@ -3243,6 +3256,15 @@ bool IdealLoopTree::do_remove_empty_loop(PhaseIdealLoop *phase) {
 #endif
 
   if (needs_guard) {
+    if (LoopPeeling == 0) {
+#ifndef PRODUCT
+      if (TraceLoopOpts) {
+        tty->print("Empty loop not removed since LoopPeeling is always disabled");
+        this->dump_head();
+      }
+#endif
+      return false;
+    }
     // Peel the loop to ensure there's a zero trip guard
     Node_List old_new;
     phase->do_peeling(this, old_new);
diff --git a/src/hotspot/share/opto/loopnode.cpp b/src/hotspot/share/opto/loopnode.cpp
index 1523372e64c..b2eb0c47458 100644
--- a/src/hotspot/share/opto/loopnode.cpp
+++ b/src/hotspot/share/opto/loopnode.cpp
@@ -896,11 +896,11 @@ bool PhaseIdealLoop::create_loop_nest(IdealLoopTree* loop, Node_List &old_new) {
     // Loop is strip mined: use the safepoint of the outer strip mined loop
     OuterStripMinedLoopNode* outer_loop = head->as_CountedLoop()->outer_loop();
     assert(outer_loop != nullptr, "no outer loop");
-    safepoint = outer_loop->outer_safepoint();
+    safepoint = LoopPeeling == 0 ? nullptr : outer_loop->outer_safepoint();
     outer_loop->transform_to_counted_loop(&_igvn, this);
     exit_test = head->loopexit();
   } else {
-    safepoint = find_safepoint(back_control, x, loop);
+    safepoint = LoopPeeling == 0 ? nullptr : find_safepoint(back_control, x, loop);
   }
 
   IfFalseNode* exit_branch = exit_test->false_proj();
@@ -1074,8 +1074,8 @@ bool PhaseIdealLoop::create_loop_nest(IdealLoopTree* loop, Node_List &old_new) {
   // Peel one iteration of the loop and use the safepoint at the end
   // of the peeled iteration to insert Parse Predicates. If no well
   // positioned safepoint peel to guarantee a safepoint in the outer
-  // loop.
-  if (safepoint != nullptr || !loop->_has_call) {
+  // loop.  When loop peeling is disabled, skip the peeling step altogether.
+  if (LoopPeeling != 0 && (safepoint != nullptr || !loop->_has_call)) {
     old_new.clear();
     do_peeling(loop, old_new);
   } else {
diff --git a/test/hotspot/jtreg/compiler/loopopts/TestLoopPeeling.java b/test/hotspot/jtreg/compiler/loopopts/TestLoopPeeling.java
index a32f3cb851a..aab6e4f2aaa 100644
--- a/test/hotspot/jtreg/compiler/loopopts/TestLoopPeeling.java
+++ b/test/hotspot/jtreg/compiler/loopopts/TestLoopPeeling.java
@@ -23,12 +23,27 @@
 
 /*
  * @test
- * @bug 8078262 8177095
- * @summary Tests correct dominator information after loop peeling.
+ * @bug 8078262 8177095 8371685
+ * @summary Tests correct dominator information after loop peeling and
+ *          tests that LoopPeeling flag correctly disables loop peeling.
  *
  * @run main/othervm -Xcomp
  *      -XX:CompileCommand=compileonly,compiler.loopopts.TestLoopPeeling::test*
  *      compiler.loopopts.TestLoopPeeling
+ * @run main/othervm -Xcomp
+ *      -XX:+UnlockDiagnosticVMOptions -XX:LoopPeeling=0
+ *      -XX:CompileCommand=compileonly,compiler.loopopts.TestLoopPeeling::test*
+ *      compiler.loopopts.TestLoopPeeling
+ * @run main/othervm -Xbatch
+ *      -XX:+UnlockDiagnosticVMOptions -XX:LoopPeeling=0
+ *      compiler.loopopts.TestLoopPeeling
+ * @run main/othervm -Xcomp
+ *      -XX:+UnlockDiagnosticVMOptions -XX:LoopPeeling=2
+ *      -XX:CompileCommand=compileonly,compiler.loopopts.TestLoopPeeling::test*
+ *      compiler.loopopts.TestLoopPeeling
+ * @run main/othervm -Xbatch
+ *      -XX:+UnlockDiagnosticVMOptions -XX:LoopPeeling=2
+ *      compiler.loopopts.TestLoopPeeling
  */
 
 package compiler.loopopts;
@@ -44,6 +59,8 @@ public class TestLoopPeeling {
             test.testArrayAccess2(0);
             test.testArrayAccess3(0, false);
             test.testArrayAllocation(0, 1);
+            test.testEmptyLoop(100);
+            test.testMaxUnrollOddTrip();
         } catch (Exception e) {
             // Ignore exceptions
         }
@@ -142,5 +159,19 @@ public class TestLoopPeeling {
         }
         return null;
     }
-}
 
+    public void testEmptyLoop(int limit) {
+        for (int i = 0; i < limit; i++) {
+            // Empty body - candidate for empty loop removal
+        }
+    }
+
+    public int testMaxUnrollOddTrip() {
+        int sum = 0;
+        // Trip count of 5 (odd) - maximal unroll needs to peel one iteration
+        for (int i = 0; i < 5; i++) {
+            sum += array[i];
+        }
+        return sum;
+    }
+}
diff --git a/test/hotspot/jtreg/compiler/loopopts/TestLoopPeelingDisabled.java b/test/hotspot/jtreg/compiler/loopopts/TestLoopPeelingDisabled.java
new file mode 100644
index 00000000000..e7bbe24d1de
--- /dev/null
+++ b/test/hotspot/jtreg/compiler/loopopts/TestLoopPeelingDisabled.java
@@ -0,0 +1,89 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+package compiler.loopopts;
+
+import compiler.lib.ir_framework.*;
+import compiler.lib.ir_framework.driver.irmatching.IRViolationException;
+import jdk.test.lib.Asserts;
+
+/*
+ * @test
+ * @bug 8371685
+ * @requires vm.flagless & vm.debug
+ * @summary Verifies that the LoopPeeling flag correctly disables loop peeling
+ *          by checking whether the "After Loop Peeling" compile phase is
+ *          emitted.  When loop peeling is disabled, no peeling should occur and
+ *          the phase must be absent from the compilation output.
+ * @library /test/lib /
+ * @run driver compiler.loopopts.TestLoopPeelingDisabled
+ */
+public class TestLoopPeelingDisabled {
+    static int[] array = new int[100];
+
+    public static void main(String[] args) {
+        // First, run the test with loop peeling enabled, which is the default.
+        // The IR framework should catch if the number of counted loops does not
+        // match the annotations.
+        TestFramework.run();
+
+        // Then, run the same test with loop peeling disabled, which should
+        // elide the {BEFORE,AFTER}_LOOP_PEELING compilation phases, causing the
+        // test to throw an IRViolationException. We then check whether the
+        // exception message matches our expectation (that the loop peeling
+        // phase was not found).
+        try {
+            TestFramework.runWithFlags("-XX:+UnlockDiagnosticVMOptions",
+                                       "-XX:LoopPeeling=0");
+            Asserts.fail("Expected IRViolationException");
+        } catch (IRViolationException e) {
+            String info = e.getExceptionInfo();
+            if (!info.contains("NO compilation output found for this phase")) {
+                Asserts.fail("Unexpected IR violation: " + info);
+            }
+            System.out.println("Loop peeling correctly disabled");
+        }
+
+        // Finally, run the same test with loop peeling disabled only when
+        // splitting iterations.  Since the function being tested does not hit
+        // this case, we expect that the loop will be peeled, which is ensured
+        // by the IR annotations.
+        TestFramework.runWithFlags("-XX:+UnlockDiagnosticVMOptions",
+                                   "-XX:LoopPeeling=2");
+    }
+
+    @Test
+    @IR(counts = {IRNode.COUNTED_LOOP, "1"}, phase = CompilePhase.BEFORE_LOOP_PEELING)
+    @IR(counts = {IRNode.COUNTED_LOOP, "2"}, phase = CompilePhase.AFTER_LOOP_PEELING)
+    public static int test() {
+        int sum = 0;
+
+        // Use an odd trip count so that `do_maximally_unroll()` tries to peel
+        // the odd iteration.
+        for (int i = 0; i < 5; i++) {
+            sum += array[i];
+        }
+
+        return sum;
+    }
+}

From 446fb203b2e27807f0cd2ec78447478a1de19773 Mon Sep 17 00:00:00 2001
From: Coleen Phillimore <coleenp@openjdk.org>
Date: Wed, 18 Mar 2026 16:07:41 +0000
Subject: [PATCH 240/655] 8379015: Convert TraceNewOopMapGeneration to unified
 logging

Reviewed-by: dholmes, matsaave
---
 src/hotspot/share/classfile/classPrinter.cpp  |   3 +-
 src/hotspot/share/classfile/classPrinter.hpp  |   3 +-
 .../share/interpreter/bytecodeTracer.cpp      |   8 +-
 src/hotspot/share/logging/logTag.hpp          |   3 +-
 src/hotspot/share/oops/generateOopMap.cpp     | 111 +++++++-----------
 src/hotspot/share/runtime/globals.hpp         |  12 --
 .../runtime/logging/GenerateOopMapTest.java   |  84 +++++++++++++
 7 files changed, 139 insertions(+), 85 deletions(-)
 create mode 100644 test/hotspot/jtreg/runtime/logging/GenerateOopMapTest.java

diff --git a/src/hotspot/share/classfile/classPrinter.cpp b/src/hotspot/share/classfile/classPrinter.cpp
index 3ed0a5e9840..6cf89f7357f 100644
--- a/src/hotspot/share/classfile/classPrinter.cpp
+++ b/src/hotspot/share/classfile/classPrinter.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2022, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2022, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -224,6 +224,7 @@ void ClassPrinter::print_flags_help(outputStream* os) {
   os->print_cr("   0x%02x  - print info for invokehandle",  PRINT_METHOD_HANDLE);
   os->print_cr("   0x%02x  - print details of the C++ and Java objects that represent classes",  PRINT_CLASS_DETAILS);
   os->print_cr("   0x%02x  - print details of the C++ objects that represent methods",  PRINT_METHOD_DETAILS);
+  os->print_cr("   0x%02x  - print MethodData",  PRINT_METHOD_DATA);
   os->cr();
 }
 
diff --git a/src/hotspot/share/classfile/classPrinter.hpp b/src/hotspot/share/classfile/classPrinter.hpp
index 470e82ddc0e..b09a1a1ef3b 100644
--- a/src/hotspot/share/classfile/classPrinter.hpp
+++ b/src/hotspot/share/classfile/classPrinter.hpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2022, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2022, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -54,6 +54,7 @@ public:
     PRINT_METHOD_HANDLE     = 1 << 4, // extra information for invokehandle
     PRINT_CLASS_DETAILS     = 1 << 5, // print details of the C++ and Java objects that represent classes
     PRINT_METHOD_DETAILS    = 1 << 6, // print details of the C++ objects that represent methods
+    PRINT_METHOD_DATA       = 1 << 7, // print MethodData - requires MDO lock
   };
   static bool has_mode(int flags, Mode mode) {
     return (flags & static_cast<int>(mode)) != 0;
diff --git a/src/hotspot/share/interpreter/bytecodeTracer.cpp b/src/hotspot/share/interpreter/bytecodeTracer.cpp
index 21974218957..2610a8a2bd6 100644
--- a/src/hotspot/share/interpreter/bytecodeTracer.cpp
+++ b/src/hotspot/share/interpreter/bytecodeTracer.cpp
@@ -78,7 +78,7 @@ class BytecodePrinter {
   void      print_field_or_method(int cp_index, outputStream* st);
   void      print_dynamic(int cp_index, outputStream* st);
   void      print_attributes(int bci, outputStream* st);
-  void      bytecode_epilog(int bci, outputStream* st);
+  void      print_method_data_at(int bci, outputStream* st);
 
  public:
   BytecodePrinter(int flags = 0) : _is_wide(false), _code(Bytecodes::_illegal), _flags(flags) {}
@@ -171,7 +171,9 @@ class BytecodePrinter {
     }
     _next_pc = is_wide() ? bcp+2 : bcp+1;
     print_attributes(bci, st);
-    bytecode_epilog(bci, st);
+    if (ClassPrinter::has_mode(_flags, ClassPrinter::PRINT_METHOD_DATA)) {
+      print_method_data_at(bci, st);
+    }
   }
 };
 
@@ -598,7 +600,7 @@ void BytecodePrinter::print_attributes(int bci, outputStream* st) {
 }
 
 
-void BytecodePrinter::bytecode_epilog(int bci, outputStream* st) {
+void BytecodePrinter::print_method_data_at(int bci, outputStream* st) {
   MethodData* mdo = method()->method_data();
   if (mdo != nullptr) {
 
diff --git a/src/hotspot/share/logging/logTag.hpp b/src/hotspot/share/logging/logTag.hpp
index 3ad6a197d07..20d61b542b0 100644
--- a/src/hotspot/share/logging/logTag.hpp
+++ b/src/hotspot/share/logging/logTag.hpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2015, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2015, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -90,6 +90,7 @@ class outputStream;
   LOG_TAG(freelist) \
   LOG_TAG(gc) \
   NOT_PRODUCT(LOG_TAG(generate)) \
+  LOG_TAG(generateoopmap) \
   LOG_TAG(handshake) \
   LOG_TAG(hashtables) \
   LOG_TAG(heap) \
diff --git a/src/hotspot/share/oops/generateOopMap.cpp b/src/hotspot/share/oops/generateOopMap.cpp
index 5e12c57676d..09912aeaf63 100644
--- a/src/hotspot/share/oops/generateOopMap.cpp
+++ b/src/hotspot/share/oops/generateOopMap.cpp
@@ -400,9 +400,7 @@ void GenerateOopMap::bb_mark_fct(GenerateOopMap *c, int bci, int *data) {
   if (c->is_bb_header(bci))
      return;
 
-  if (TraceNewOopMapGeneration) {
-     tty->print_cr("Basicblock#%d begins at: %d", c->_bb_count, bci);
-  }
+  log_debug(generateoopmap)( "Basicblock#%d begins at: %d", c->_bb_count, bci);
   c->set_bbmark_bit(bci);
   c->_bb_count++;
 }
@@ -913,13 +911,12 @@ void GenerateOopMap::do_interpretation()
   // iterated more than once.
   int i = 0;
   do {
-#ifndef PRODUCT
-    if (TraceNewOopMapGeneration) {
-      tty->print("\n\nIteration #%d of do_interpretation loop, method:\n", i);
-      method()->print_name(tty);
-      tty->print("\n\n");
+    if (log_is_enabled(Trace, generateoopmap)) {
+      LogStream st(Log(generateoopmap)::trace());
+      st.print("Iteration #%d of do_interpretation loop, method:", i);
+      method()->print_name(&st);
+      st.print("\n\n");
     }
-#endif
     _conflict = false;
     _monitor_safe = true;
     // init_state is now called from init_basic_blocks.  The length of a
@@ -1084,8 +1081,7 @@ void GenerateOopMap::initialize_vars() {
 
 void GenerateOopMap::add_to_ref_init_set(int localNo) {
 
-  if (TraceNewOopMapGeneration)
-    tty->print_cr("Added init vars: %d", localNo);
+  log_debug(generateoopmap)("Added init vars: %d", localNo);
 
   // Is it already in the set?
   if (_init_vars->contains(localNo) )
@@ -1284,13 +1280,13 @@ void GenerateOopMap::report_monitor_mismatch(const char *msg) {
 void GenerateOopMap::print_states(outputStream *os,
                                   CellTypeState* vec, int num) {
   for (int i = 0; i < num; i++) {
-    vec[i].print(tty);
+    vec[i].print(os);
   }
 }
 
 // Print the state values at the current bytecode.
-void GenerateOopMap::print_current_state(outputStream   *os,
-                                         BytecodeStream *currentBC,
+void GenerateOopMap::print_current_state(outputStream*   os,
+                                         BytecodeStream* currentBC,
                                          bool            detailed) {
   if (detailed) {
     os->print("     %4d vars     = ", currentBC->bci());
@@ -1312,6 +1308,7 @@ void GenerateOopMap::print_current_state(outputStream   *os,
     case Bytecodes::_invokestatic:
     case Bytecodes::_invokedynamic:
     case Bytecodes::_invokeinterface: {
+      ResourceMark rm;
       int idx = currentBC->has_index_u4() ? currentBC->get_index_u4() : currentBC->get_index_u2();
       ConstantPool* cp      = method()->constants();
       int nameAndTypeIdx    = cp->name_and_type_ref_index_at(idx, currentBC->code());
@@ -1342,8 +1339,9 @@ void GenerateOopMap::print_current_state(outputStream   *os,
 // Sets the current state to be the state after executing the
 // current instruction, starting in the current state.
 void GenerateOopMap::interp1(BytecodeStream *itr) {
-  if (TraceNewOopMapGeneration) {
-    print_current_state(tty, itr, TraceNewOopMapGenerationDetailed);
+  if (log_is_enabled(Trace, generateoopmap)) {
+    LogStream st(Log(generateoopmap)::trace());
+    print_current_state(&st, itr, Verbose);
   }
 
   // Should we report the results? Result is reported *before* the instruction at the current bci is executed.
@@ -2026,9 +2024,7 @@ void GenerateOopMap::ret_jump_targets_do(BytecodeStream *bcs, jmpFct_t jmpFct, i
     DEBUG_ONLY(BasicBlock* target_bb = &jsr_bb[1];)
     assert(target_bb  == get_basic_block_at(target_bci), "wrong calc. of successor basicblock");
     bool alive = jsr_bb->is_alive();
-    if (TraceNewOopMapGeneration) {
-      tty->print("pc = %d, ret -> %d alive: %s\n", bci, target_bci, alive ? "true" : "false");
-    }
+    log_debug(generateoopmap)("pc = %d, ret -> %d alive: %s", bci, target_bci, alive ? "true" : "false");
     if (alive) jmpFct(this, target_bci, data);
   }
 }
@@ -2046,6 +2042,7 @@ char* GenerateOopMap::state_vec_to_string(CellTypeState* vec, int len) {
   return _state_vec_buf;
 }
 
+#ifndef PRODUCT
 void GenerateOopMap::print_time() {
   tty->print_cr ("Accumulated oopmap times:");
   tty->print_cr ("---------------------------");
@@ -2053,6 +2050,7 @@ void GenerateOopMap::print_time() {
   tty->print_cr ("  (%3.0f bytecodes per sec) ",
   (double)GenerateOopMap::_total_byte_count / GenerateOopMap::_total_oopmap_time.seconds());
 }
+#endif
 
 //
 //  ============ Main Entry Point ===========
@@ -2062,27 +2060,16 @@ GenerateOopMap::GenerateOopMap(const methodHandle& method) {
   _method = method;
   _max_locals=0;
   _init_vars = nullptr;
-
-#ifndef PRODUCT
-  // If we are doing a detailed trace, include the regular trace information.
-  if (TraceNewOopMapGenerationDetailed) {
-    TraceNewOopMapGeneration = true;
-  }
-#endif
 }
 
 bool GenerateOopMap::compute_map(Thread* current) {
 #ifndef PRODUCT
-  if (TimeOopMap2) {
-    method()->print_short_name(tty);
-    tty->print("  ");
-  }
   if (TimeOopMap) {
     _total_byte_count += method()->code_size();
+    TraceTime t_all(nullptr, &_total_oopmap_time, TimeOopMap);
   }
 #endif
-  TraceTime t_single("oopmap time", TimeOopMap2);
-  TraceTime t_all(nullptr, &_total_oopmap_time, TimeOopMap);
+  TraceTime t_single("oopmap time", TRACETIME_LOG(Debug, generateoopmap));
 
   // Initialize values
   _got_error      = false;
@@ -2099,16 +2086,16 @@ bool GenerateOopMap::compute_map(Thread* current) {
   _did_rewriting  = false;
   _did_relocation = false;
 
-  if (TraceNewOopMapGeneration) {
-    tty->print("Method name: %s\n", method()->name()->as_C_string());
-    if (Verbose) {
-      _method->print_codes();
-      tty->print_cr("Exception table:");
-      ExceptionTable excps(method());
-      for(int i = 0; i < excps.length(); i ++) {
-        tty->print_cr("[%d - %d] -> %d",
-                      excps.start_pc(i), excps.end_pc(i), excps.handler_pc(i));
-      }
+  if (log_is_enabled(Debug, generateoopmap)) {
+    ResourceMark rm;
+    LogStream st(Log(generateoopmap)::debug());
+    st.print_cr("Method name: %s\n", method()->name()->as_C_string());
+    _method->print_codes_on(&st);
+    st.print_cr("Exception table:");
+    ExceptionTable excps(method());
+    for (int i = 0; i < excps.length(); i ++) {
+      st.print_cr("[%d - %d] -> %d",
+                  excps.start_pc(i), excps.end_pc(i), excps.handler_pc(i));
     }
   }
 
@@ -2175,7 +2162,7 @@ void GenerateOopMap::verify_error(const char *format, ...) {
 //
 void GenerateOopMap::report_result() {
 
-  if (TraceNewOopMapGeneration) tty->print_cr("Report result pass");
+  log_debug(generateoopmap)("Report result pass");
 
   // We now want to report the result of the parse
   _report_result = true;
@@ -2192,7 +2179,7 @@ void GenerateOopMap::report_result() {
 }
 
 void GenerateOopMap::result_for_basicblock(int bci) {
- if (TraceNewOopMapGeneration) tty->print_cr("Report result pass for basicblock");
+ log_debug(generateoopmap)("Report result pass for basicblock");
 
   // We now want to report the result of the parse
   _report_result = true;
@@ -2200,7 +2187,7 @@ void GenerateOopMap::result_for_basicblock(int bci) {
   // Find basicblock and report results
   BasicBlock* bb = get_basic_block_containing(bci);
   guarantee(bb != nullptr, "no basic block for bci");
-  assert(bb->is_reachable(), "getting result from unreachable basicblock");
+  assert(bb->is_reachable(), "getting result from unreachable basicblock %d", bci);
   bb->set_changed(true);
   interp_bb(bb);
 }
@@ -2212,9 +2199,7 @@ void GenerateOopMap::result_for_basicblock(int bci) {
 void GenerateOopMap::record_refval_conflict(int varNo) {
   assert(varNo>=0 && varNo< _max_locals, "index out of range");
 
-  if (TraceOopMapRewrites) {
-     tty->print("### Conflict detected (local no: %d)\n", varNo);
-  }
+  log_trace(generateoopmap)("### Conflict detected (local no: %d)", varNo);
 
   if (!_new_var_map) {
     _new_var_map = NEW_RESOURCE_ARRAY(int, _max_locals);
@@ -2253,10 +2238,12 @@ void GenerateOopMap::rewrite_refval_conflicts()
   // Tracing flag
   _did_rewriting = true;
 
-  if (TraceOopMapRewrites) {
-    tty->print_cr("ref/value conflict for method %s - bytecodes are getting rewritten", method()->name()->as_C_string());
-    method()->print();
-    method()->print_codes();
+  if (log_is_enabled(Trace, generateoopmap)) {
+    ResourceMark rm;
+    LogStream st(Log(generateoopmap)::trace());
+    st.print_cr("ref/value conflict for method %s - bytecodes are getting rewritten", method()->name()->as_C_string());
+    method()->print_on(&st);
+    method()->print_codes_on(&st);
   }
 
   assert(_new_var_map!=nullptr, "nothing to rewrite");
@@ -2266,9 +2253,7 @@ void GenerateOopMap::rewrite_refval_conflicts()
   if (!_got_error) {
     for (int k = 0; k < _max_locals && !_got_error; k++) {
       if (_new_var_map[k] != k) {
-        if (TraceOopMapRewrites) {
-          tty->print_cr("Rewriting: %d -> %d", k, _new_var_map[k]);
-        }
+        log_trace(generateoopmap)("Rewriting: %d -> %d", k, _new_var_map[k]);
         rewrite_refval_conflict(k, _new_var_map[k]);
         if (_got_error) return;
         nof_conflicts++;
@@ -2319,22 +2304,16 @@ bool GenerateOopMap::rewrite_refval_conflict_inst(BytecodeStream *itr, int from,
   int bci = itr->bci();
 
   if (is_aload(itr, &index) && index == from) {
-    if (TraceOopMapRewrites) {
-      tty->print_cr("Rewriting aload at bci: %d", bci);
-    }
+    log_trace(generateoopmap)("Rewriting aload at bci: %d", bci);
     return rewrite_load_or_store(itr, Bytecodes::_aload, Bytecodes::_aload_0, to);
   }
 
   if (is_astore(itr, &index) && index == from) {
     if (!stack_top_holds_ret_addr(bci)) {
-      if (TraceOopMapRewrites) {
-        tty->print_cr("Rewriting astore at bci: %d", bci);
-      }
+      log_trace(generateoopmap)("Rewriting astore at bci: %d", bci);
       return rewrite_load_or_store(itr, Bytecodes::_astore, Bytecodes::_astore_0, to);
     } else {
-      if (TraceOopMapRewrites) {
-        tty->print_cr("Suppress rewriting of astore at bci: %d", bci);
-      }
+      log_trace(generateoopmap)("Suppress rewriting of astore at bci: %d", bci);
     }
   }
 
@@ -2502,9 +2481,7 @@ void GenerateOopMap::compute_ret_adr_at_TOS() {
         // TDT: should this be is_good_address() ?
         if (_stack_top > 0 && stack()[_stack_top-1].is_address()) {
           _ret_adr_tos->append(bcs.bci());
-          if (TraceNewOopMapGeneration) {
-            tty->print_cr("Ret_adr TOS at bci: %d", bcs.bci());
-          }
+          log_debug(generateoopmap)("Ret_adr TOS at bci: %d", bcs.bci());
         }
         interp1(&bcs);
       }
diff --git a/src/hotspot/share/runtime/globals.hpp b/src/hotspot/share/runtime/globals.hpp
index 559071cae68..0c627e27209 100644
--- a/src/hotspot/share/runtime/globals.hpp
+++ b/src/hotspot/share/runtime/globals.hpp
@@ -871,21 +871,9 @@ const int ObjectAlignmentInBytes = 8;
   develop(bool, VerifyDependencies, trueInDebug,                            \
           "Exercise and verify the compilation dependency mechanism")       \
                                                                             \
-  develop(bool, TraceNewOopMapGeneration, false,                            \
-          "Trace OopMapGeneration")                                         \
-                                                                            \
-  develop(bool, TraceNewOopMapGenerationDetailed, false,                    \
-          "Trace OopMapGeneration: print detailed cell states")             \
-                                                                            \
   develop(bool, TimeOopMap, false,                                          \
           "Time calls to GenerateOopMap::compute_map() in sum")             \
                                                                             \
-  develop(bool, TimeOopMap2, false,                                         \
-          "Time calls to GenerateOopMap::compute_map() individually")       \
-                                                                            \
-  develop(bool, TraceOopMapRewrites, false,                                 \
-          "Trace rewriting of methods during oop map generation")           \
-                                                                            \
   develop(bool, TraceFinalizerRegistration, false,                          \
           "Trace registration of final references")                         \
                                                                             \
diff --git a/test/hotspot/jtreg/runtime/logging/GenerateOopMapTest.java b/test/hotspot/jtreg/runtime/logging/GenerateOopMapTest.java
new file mode 100644
index 00000000000..6e114ff6b1d
--- /dev/null
+++ b/test/hotspot/jtreg/runtime/logging/GenerateOopMapTest.java
@@ -0,0 +1,84 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+
+/*
+ * @test GenerateOopMap
+ * @bug 8379015
+ * @requires vm.flagless
+ * @modules java.base/jdk.internal.misc
+ * @library /test/lib
+ * @run driver GenerateOopMapTest
+ */
+
+import java.nio.file.Files;
+import java.nio.file.Path;
+import java.util.regex.Matcher;
+import java.util.regex.Pattern;
+import jdk.test.lib.process.OutputAnalyzer;
+import jdk.test.lib.process.ProcessTools;
+import jdk.test.lib.Platform;
+
+public class GenerateOopMapTest {
+
+    static String infoPattern = "[generateoopmap]";
+    static String debugPattern = "[generateoopmap] Basicblock#0 begins at:";
+    static String tracePattern = "[trace][generateoopmap]        5  vars = 'r'      stack = 'v'   monitors = ''  \tifne";
+    static String traceDetailPattern = "[generateoopmap]         0 vars     = ( r  |slot0)    invokestatic()V";
+
+    static void test() throws Exception {
+        // Don't print much with info level.
+        ProcessBuilder pb = ProcessTools.createLimitedTestJavaProcessBuilder("-Xlog:generateoopmap=info",
+                                                                             "GenerateOopMapTest", "test");
+        OutputAnalyzer o = new OutputAnalyzer(pb.start());
+        o.shouldNotContain(infoPattern).shouldHaveExitValue(0);
+
+        // Prints bytecodes and BasicBlock information in debug.
+        pb = ProcessTools.createLimitedTestJavaProcessBuilder("-Xlog:generateoopmap=debug",
+                                                              "GenerateOopMapTest", "test");
+        o = new OutputAnalyzer(pb.start());
+        o.shouldContain(debugPattern).shouldHaveExitValue(0);
+
+        // Prints ref/val for each bytecode in trace.
+        pb = ProcessTools.createLimitedTestJavaProcessBuilder("-Xlog:generateoopmap=trace",
+                                                              "GenerateOopMapTest", "test");
+        o = new OutputAnalyzer(pb.start());
+        o.shouldContain(tracePattern).shouldHaveExitValue(0);
+
+        // Prints extra stuff with detailed. Not sure how useful this is but keep it for now.
+        if (Platform.isDebugBuild()) {
+            pb = ProcessTools.createLimitedTestJavaProcessBuilder("-Xlog:generateoopmap=trace",
+                                                                  "-XX:+Verbose",
+                                                                  "GenerateOopMapTest", "test");
+            o = new OutputAnalyzer(pb.start());
+            o.shouldContain(traceDetailPattern).shouldHaveExitValue(0);
+        }
+    };
+
+    public static void main(String... args) throws Exception {
+        System.gc();
+        if (args.length == 0) {
+            test();
+        }
+    }
+}

From 20567e82412b0ea8976a029728b400ca788178ba Mon Sep 17 00:00:00 2001
From: Justin Lu <jlu@openjdk.org>
Date: Wed, 18 Mar 2026 16:08:20 +0000
Subject: [PATCH 241/655] 8380218: Refactor test/jdk/java/nio/charset TestNG
 tests to JUnit

Reviewed-by: bpb, naoto
---
 .../charset/Charset/DefaultCharsetTest.java   | 50 +++++++--------
 .../jdk/java/nio/charset/Charset/ForName.java | 62 ++++++++++---------
 .../CoderMalfunctionErrorTest.java            | 18 +++---
 .../CoderMalfunctionErrorTest.java            | 17 ++---
 .../charset/spi/CharsetProviderBasicTest.java | 26 ++++----
 test/jdk/sun/nio/cs/StreamEncoderOut.java     | 25 ++++----
 .../sun/nio/cs/TestUnicodeReversedBOM.java    | 47 +++++++-------
 7 files changed, 124 insertions(+), 121 deletions(-)

diff --git a/test/jdk/java/nio/charset/Charset/DefaultCharsetTest.java b/test/jdk/java/nio/charset/Charset/DefaultCharsetTest.java
index be33ecb70f2..f3caf94775e 100644
--- a/test/jdk/java/nio/charset/Charset/DefaultCharsetTest.java
+++ b/test/jdk/java/nio/charset/Charset/DefaultCharsetTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2017, 2023, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2017, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -34,22 +34,19 @@
  *        jdk.test.lib.Platform
  *        jdk.test.lib.process.*
  *        Default
- * @run testng DefaultCharsetTest
+ * @run junit DefaultCharsetTest
  */
 
-import java.util.ArrayList;
-import java.util.Iterator;
-import java.util.List;
 import java.util.Map;
+import java.util.stream.Stream;
 
-import jdk.test.lib.Platform;
 import jdk.test.lib.process.ProcessTools;
+import org.junit.jupiter.api.BeforeAll;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.Arguments;
+import org.junit.jupiter.params.provider.MethodSource;
 
-import org.testng.annotations.BeforeClass;
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
-
-import static org.testng.Assert.assertTrue;
+import static org.junit.jupiter.api.Assertions.assertTrue;
 
 public class DefaultCharsetTest {
 
@@ -58,28 +55,27 @@ public class DefaultCharsetTest {
     private static final Map<String, String> env = pb.environment();
     private static String UNSUPPORTED = null;
 
-    @BeforeClass
+    @BeforeAll
     public static void checkSupports() throws Exception {
         UNSUPPORTED = runWithLocale("nonexist");
     }
 
-    @DataProvider
-    public static Iterator<Object[]> locales() {
-        List<Object[]> data = new ArrayList<>();
-        data.add(new String[]{"en_US", "iso-8859-1"});
-        data.add(new String[]{"ja_JP.utf8", "utf-8"});
-        data.add(new String[]{"tr_TR", "iso-8859-9"});
-        data.add(new String[]{"C", "us-ascii"});
-        data.add(new String[]{"ja_JP", "x-euc-jp-linux"});
-        data.add(new String[]{"ja_JP.eucjp", "x-euc-jp-linux"});
-        data.add(new String[]{"ja_JP.ujis", "x-euc-jp-linux"});
-        data.add(new String[]{"ja_JP.utf8", "utf-8"});
-        return data.iterator();
+    public static Stream<Arguments> locales() {
+        return Stream.of(
+                Arguments.of("en_US", "iso-8859-1"),
+                Arguments.of("ja_JP.utf8", "utf-8"),
+                Arguments.of("tr_TR", "iso-8859-9"),
+                Arguments.of("C", "us-ascii"),
+                Arguments.of("ja_JP", "x-euc-jp-linux"),
+                Arguments.of("ja_JP.eucjp", "x-euc-jp-linux"),
+                Arguments.of("ja_JP.ujis", "x-euc-jp-linux"),
+                Arguments.of("ja_JP.utf8", "utf-8")
+        );
     }
 
-    @Test(dataProvider = "locales")
-    public void testDefaultCharset(String locale, String expectedCharset)
-            throws Exception {
+    @ParameterizedTest
+    @MethodSource("locales")
+    public void testDefaultCharset(String locale, String expectedCharset) throws Exception {
         String actual = runWithLocale(locale);
         if (UNSUPPORTED.equals(actual)) {
             System.out.println(locale + ": Locale not supported, skipping...");
diff --git a/test/jdk/java/nio/charset/Charset/ForName.java b/test/jdk/java/nio/charset/Charset/ForName.java
index d8a1e2f72d3..6af903a3c8a 100644
--- a/test/jdk/java/nio/charset/Charset/ForName.java
+++ b/test/jdk/java/nio/charset/Charset/ForName.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2021, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,49 +25,51 @@
  * @summary Unit test for forName(String, Charset)
  * @bug 8270490
  * @modules jdk.charsets
- * @run testng ForName
+ * @run junit ForName
  */
 
 import java.nio.charset.Charset;
-import java.nio.charset.IllegalCharsetNameException;
 import java.nio.charset.StandardCharsets;
+import java.util.stream.Stream;
 
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
-import static org.testng.Assert.assertEquals;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.Arguments;
+import org.junit.jupiter.params.provider.MethodSource;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertThrows;
 
-@Test
 public class ForName {
 
-    @DataProvider
-    Object[][] params() {
-        return new Object[][] {
-                {"UTF-8", null, StandardCharsets.UTF_8},
-                {"UTF-8", StandardCharsets.US_ASCII, StandardCharsets.UTF_8},
-                {"windows-31j", StandardCharsets.US_ASCII, Charset.forName("windows-31j")},
-                {"foo", StandardCharsets.US_ASCII, StandardCharsets.US_ASCII},
-                {"foo", null, null},
-                {"\u3042", null, null},
-                {"\u3042", StandardCharsets.UTF_8, StandardCharsets.UTF_8},
-        };
+    static Stream<Arguments> params() {
+        return Stream.of(
+                Arguments.of("UTF-8", null, StandardCharsets.UTF_8),
+                Arguments.of("UTF-8", StandardCharsets.US_ASCII, StandardCharsets.UTF_8),
+                Arguments.of("windows-31j", StandardCharsets.US_ASCII, Charset.forName("windows-31j")),
+                Arguments.of("foo", StandardCharsets.US_ASCII, StandardCharsets.US_ASCII),
+                Arguments.of("foo", null, null),
+                Arguments.of("\u3042", null, null),
+                Arguments.of("\u3042", StandardCharsets.UTF_8, StandardCharsets.UTF_8)
+        );
     }
 
-    @DataProvider
-    Object[][] paramsIAE() {
-        return new Object[][] {
-                {null, null},
-                {null, StandardCharsets.UTF_8},
-        };
+    static Stream<Arguments> paramsIAE() {
+        return Stream.of(
+                Arguments.of(null, null),
+                Arguments.of(null, StandardCharsets.UTF_8)
+        );
     }
 
-    @Test(dataProvider="params")
-    public void testForName_2arg(String name, Charset fallback, Charset expected) throws Exception {
+    @ParameterizedTest
+    @MethodSource("params")
+    public void testForName_2arg(String name, Charset fallback, Charset expected) {
         var cs = Charset.forName(name, fallback);
-        assertEquals(cs, expected);
+        assertEquals(expected, cs);
     }
 
-    @Test(dataProvider="paramsIAE", expectedExceptions=IllegalArgumentException.class)
-    public void testForName_2arg_IAE(String name, Charset fallback) throws Exception {
-        Charset.forName(name, fallback);
+    @ParameterizedTest
+    @MethodSource("paramsIAE")
+    public void testForName_2arg_IAE(String name, Charset fallback) {
+        assertThrows(IllegalArgumentException.class, () -> Charset.forName(name, fallback));
     }
 }
diff --git a/test/jdk/java/nio/charset/CharsetDecoder/CoderMalfunctionErrorTest.java b/test/jdk/java/nio/charset/CharsetDecoder/CoderMalfunctionErrorTest.java
index 79091071ea3..5e830b955b6 100644
--- a/test/jdk/java/nio/charset/CharsetDecoder/CoderMalfunctionErrorTest.java
+++ b/test/jdk/java/nio/charset/CharsetDecoder/CoderMalfunctionErrorTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2020, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,26 +23,30 @@
 
 /* @test
  * @bug 8253832
- * @run testng CoderMalfunctionErrorTest
  * @summary Check CoderMalfunctionError is thrown for any RuntimeException
  *      on CharsetDecoder.decodeLoop() invocation.
+ * @run junit CoderMalfunctionErrorTest
  */
 
-import org.testng.annotations.Test;
 
 import java.nio.ByteBuffer;
 import java.nio.CharBuffer;
 import java.nio.charset.*;
 
-@Test
+import org.junit.jupiter.api.Test;
+
+import static org.junit.jupiter.api.Assertions.assertThrows;
+
 public class CoderMalfunctionErrorTest {
-    @Test (expectedExceptions = CoderMalfunctionError.class)
+
+    @Test
     public void testDecodeLoop() {
-        new CharsetDecoder(StandardCharsets.US_ASCII, 1, 1) {
+        assertThrows(CoderMalfunctionError.class,
+                () -> new CharsetDecoder(StandardCharsets.US_ASCII, 1, 1) {
             @Override
             protected CoderResult decodeLoop(ByteBuffer byteBuffer, CharBuffer charBuffer) {
                 throw new RuntimeException("This exception should be wrapped in CoderMalfunctionError");
             }
-        }.decode(null, null, true);
+        }.decode(null, null, true));
     }
 }
diff --git a/test/jdk/java/nio/charset/CharsetEncoder/CoderMalfunctionErrorTest.java b/test/jdk/java/nio/charset/CharsetEncoder/CoderMalfunctionErrorTest.java
index ffd73164d9f..e917126d461 100644
--- a/test/jdk/java/nio/charset/CharsetEncoder/CoderMalfunctionErrorTest.java
+++ b/test/jdk/java/nio/charset/CharsetEncoder/CoderMalfunctionErrorTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2020, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,26 +23,29 @@
 
 /* @test
  * @bug 8253832
- * @run testng CoderMalfunctionErrorTest
+ * @run junit CoderMalfunctionErrorTest
  * @summary Check CoderMalfunctionError is thrown for any RuntimeException
  *      on CharsetEncoder.encodeLoop() invocation.
  */
 
-import org.testng.annotations.Test;
 
 import java.nio.ByteBuffer;
 import java.nio.CharBuffer;
 import java.nio.charset.*;
 
-@Test
+import org.junit.jupiter.api.Test;
+
+import static org.junit.jupiter.api.Assertions.assertThrows;
+
 public class CoderMalfunctionErrorTest {
-    @Test (expectedExceptions = CoderMalfunctionError.class)
+    @Test
     public void testEncodeLoop() {
-        new CharsetEncoder(StandardCharsets.US_ASCII, 1, 1) {
+        assertThrows(CoderMalfunctionError.class,
+                () -> new CharsetEncoder(StandardCharsets.US_ASCII, 1, 1) {
             @Override
             protected CoderResult encodeLoop(CharBuffer charBuffer, ByteBuffer byteBuffer) {
                 throw new RuntimeException("This exception should be wrapped in CoderMalfunctionError");
             }
-        }.encode(null, null, true);
+        }.encode(null, null, true));
     }
 }
diff --git a/test/jdk/java/nio/charset/spi/CharsetProviderBasicTest.java b/test/jdk/java/nio/charset/spi/CharsetProviderBasicTest.java
index abf46d81b1c..8b0e74d4360 100644
--- a/test/jdk/java/nio/charset/spi/CharsetProviderBasicTest.java
+++ b/test/jdk/java/nio/charset/spi/CharsetProviderBasicTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2017, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2017, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -35,28 +35,25 @@
  *        jdk.test.lib.util.JarUtils
  *        FooCharset FooProvider CharsetTest
  * @run driver SetupJar
- * @run testng CharsetProviderBasicTest
+ * @run junit CharsetProviderBasicTest
  */
 
 import java.io.File;
 import java.util.ArrayList;
-import java.util.Iterator;
 import java.util.List;
 import java.util.stream.Stream;
 
 import jdk.test.lib.JDKToolFinder;
 import jdk.test.lib.Utils;
 import jdk.test.lib.process.ProcessTools;
-
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.Arguments;
+import org.junit.jupiter.params.provider.MethodSource;
 
 import static java.util.Arrays.asList;
 
 public class CharsetProviderBasicTest {
 
-    private static final String TEST_SRC = System.getProperty("test.src");
-
     private static final List DEFAULT_CSS = List.of(
         "US-ASCII", "8859_1", "iso-ir-6", "UTF-16", "windows-1252", "!BAR", "cp1252"
     );
@@ -69,14 +66,15 @@ public class CharsetProviderBasicTest {
                            .equals(locale);
     }
 
-    @DataProvider
-    public static Iterator<Object[]> testCases() {
-        return Stream.of("", "ja_JP.eucJP", "tr_TR")
-                     .map(locale -> new Object[]{locale, "FOO"})
-                     .iterator();
+    public static Stream<Arguments> testCases() {
+        return Stream.of("",
+                        "ja_JP.eucJP",
+                        "tr_TR")
+                .map(locale -> Arguments.of(locale, "FOO"));
     }
 
-    @Test(dataProvider = "testCases")
+    @ParameterizedTest
+    @MethodSource("testCases")
     public void testDefaultCharset(String locale, String css) throws Throwable {
         if ((System.getProperty("os.name").startsWith("Windows") || !checkSupports(locale))
                 && (!locale.isEmpty())) {
diff --git a/test/jdk/sun/nio/cs/StreamEncoderOut.java b/test/jdk/sun/nio/cs/StreamEncoderOut.java
index 90a22512311..90b4aee838d 100644
--- a/test/jdk/sun/nio/cs/StreamEncoderOut.java
+++ b/test/jdk/sun/nio/cs/StreamEncoderOut.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2015, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2015, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -24,10 +24,8 @@
 /* @test
    @bug 8030179
    @summary test if the charset encoder deails with surrogate correctly
- * @run testng/othervm -esa StreamEncoderOut
+ * @run junit/othervm -esa StreamEncoderOut
  */
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
 
 import java.io.IOException;
 import java.io.OutputStream;
@@ -35,9 +33,12 @@ import java.io.OutputStreamWriter;
 import java.nio.charset.Charset;
 import java.util.stream.Stream;
 
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.Arguments;
+import org.junit.jupiter.params.provider.MethodSource;
+
 import static java.util.stream.Collectors.joining;
 
-@Test
 public class StreamEncoderOut {
 
     enum Input {
@@ -57,14 +58,11 @@ public class StreamEncoderOut {
         }
     }
 
-    @DataProvider(name = "CharsetAndString")
-    // [Charset, Input]
-    public static Object[][] makeStreamTestData() {
+    public static Stream<Arguments> makeStreamTestData() {
         // Cross product of supported charsets and inputs
-        return Charset.availableCharsets().values().stream().
-                filter(Charset::canEncode).
-                flatMap(cs -> Stream.of(Input.values()).map(i -> new Object[]{cs, i})).
-                toArray(Object[][]::new);
+        return Charset.availableCharsets().values().stream()
+                .filter(Charset::canEncode)
+                .flatMap(cs -> Stream.of(Input.values()).map(i -> Arguments.of(cs, i)));
     }
 
     private static String generate(String s, int n) {
@@ -79,7 +77,8 @@ public class StreamEncoderOut {
         public void write(int b) throws IOException {}
     };
 
-    @Test(dataProvider = "CharsetAndString")
+    @ParameterizedTest
+    @MethodSource("makeStreamTestData")
     public void test(Charset cs, Input input) throws IOException {
         OutputStreamWriter w = new OutputStreamWriter(DEV_NULL, cs);
         String t = generate(input.value, 8193);
diff --git a/test/jdk/sun/nio/cs/TestUnicodeReversedBOM.java b/test/jdk/sun/nio/cs/TestUnicodeReversedBOM.java
index d76bf2f6034..ca0798c13e5 100644
--- a/test/jdk/sun/nio/cs/TestUnicodeReversedBOM.java
+++ b/test/jdk/sun/nio/cs/TestUnicodeReversedBOM.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2019, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2019, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -26,16 +26,18 @@
  * @bug 8216140
  * @summary Test reversed BOM (U+FFFE) in the middle of a byte buffer
  *      passes through during decoding with UnicodeDecoder.
- * @run testng TestUnicodeReversedBOM
+ * @run junit TestUnicodeReversedBOM
  */
+
 import java.nio.charset.*;
 import java.nio.*;
 import java.util.*;
+import java.util.stream.Stream;
 
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.Arguments;
+import org.junit.jupiter.params.provider.MethodSource;
 
-@Test
 public class TestUnicodeReversedBOM {
     private static byte[] A_REVERSED_BE =
         {(byte)0x0, (byte)'A', (byte)0xff, (byte)0xfe};
@@ -46,26 +48,25 @@ public class TestUnicodeReversedBOM {
     private static byte[] BOM_REVERSED_LE =
         {(byte)0xff, (byte)0xfe, (byte)0xfe, (byte)0xff};
 
-    @DataProvider
-    // [(byte[])byte array, (Charset)cs]
-    public static Object[][] ReversedBOM() {
-        return new Object[][] {
-            {A_REVERSED_BE, StandardCharsets.UTF_16},
-            {A_REVERSED_LE, StandardCharsets.UTF_16},
-            {A_REVERSED_BE, StandardCharsets.UTF_16BE},
-            {A_REVERSED_LE, StandardCharsets.UTF_16BE},
-            {A_REVERSED_BE, StandardCharsets.UTF_16LE},
-            {A_REVERSED_LE, StandardCharsets.UTF_16LE},
-            {BOM_REVERSED_BE, StandardCharsets.UTF_16},
-            {BOM_REVERSED_LE, StandardCharsets.UTF_16},
-            {BOM_REVERSED_BE, StandardCharsets.UTF_16BE},
-            {BOM_REVERSED_LE, StandardCharsets.UTF_16BE},
-            {BOM_REVERSED_BE, StandardCharsets.UTF_16LE},
-            {BOM_REVERSED_LE, StandardCharsets.UTF_16LE},
-        };
+    public static Stream<Arguments> ReversedBOM() {
+        return Stream.of(
+            Arguments.of(A_REVERSED_BE, StandardCharsets.UTF_16),
+            Arguments.of(A_REVERSED_LE, StandardCharsets.UTF_16),
+            Arguments.of(A_REVERSED_BE, StandardCharsets.UTF_16BE),
+            Arguments.of(A_REVERSED_LE, StandardCharsets.UTF_16BE),
+            Arguments.of(A_REVERSED_BE, StandardCharsets.UTF_16LE),
+            Arguments.of(A_REVERSED_LE, StandardCharsets.UTF_16LE),
+            Arguments.of(BOM_REVERSED_BE, StandardCharsets.UTF_16),
+            Arguments.of(BOM_REVERSED_LE, StandardCharsets.UTF_16),
+            Arguments.of(BOM_REVERSED_BE, StandardCharsets.UTF_16BE),
+            Arguments.of(BOM_REVERSED_LE, StandardCharsets.UTF_16BE),
+            Arguments.of(BOM_REVERSED_BE, StandardCharsets.UTF_16LE),
+            Arguments.of(BOM_REVERSED_LE, StandardCharsets.UTF_16LE)
+        );
     }
 
-    @Test(dataProvider = "ReversedBOM")
+    @ParameterizedTest
+    @MethodSource("ReversedBOM")
     public void testReversedBOM(byte[] ba, Charset cs) throws CharacterCodingException {
         cs.newDecoder()
             .onMalformedInput(CodingErrorAction.REPORT)

From b6de5aed2c2a5493c089b7f8493e953b13e4c2fa Mon Sep 17 00:00:00 2001
From: Daniel Fuchs <dfuchs@openjdk.org>
Date: Wed, 18 Mar 2026 16:45:53 +0000
Subject: [PATCH 242/655] 8379699: H3ConnectionPoolTest::testH2H3WithTwoAltSVC
 fails intermittently

Reviewed-by: syan, jpai
---
 .../http3/H3ConnectionPoolTest.java           | 56 +++++++------------
 1 file changed, 20 insertions(+), 36 deletions(-)

diff --git a/test/jdk/java/net/httpclient/http3/H3ConnectionPoolTest.java b/test/jdk/java/net/httpclient/http3/H3ConnectionPoolTest.java
index 614d564005b..12956604484 100644
--- a/test/jdk/java/net/httpclient/http3/H3ConnectionPoolTest.java
+++ b/test/jdk/java/net/httpclient/http3/H3ConnectionPoolTest.java
@@ -25,11 +25,13 @@
  * @test
  * @library /test/lib /test/jdk/java/net/httpclient/lib
  * @build jdk.httpclient.test.lib.http2.Http2TestServer
- *        jdk.test.lib.Asserts
  *        jdk.test.lib.Utils
  *        jdk.test.lib.net.SimpleSSLContext
  * @run junit/othervm -Djdk.httpclient.HttpClient.log=ssl,requests,responses,errors,http3,quic:hs
  *                     -Djdk.internal.httpclient.debug=false
+ *                     -Djdk.httpclient.keepalive.timeout.h3=480
+ *                     -Djdk.httpclient.quic.idleTimeout=480
+ *                     -Djdk.test.server.quic.idleTimeout=480
  *                     H3ConnectionPoolTest
  */
 
@@ -44,7 +46,6 @@ import java.util.ArrayList;
 import java.util.List;
 import java.util.Set;
 import java.util.concurrent.CompletableFuture;
-import java.util.concurrent.CompletionException;
 import java.util.function.Supplier;
 
 import javax.net.ssl.SSLContext;
@@ -60,11 +61,11 @@ import static java.net.http.HttpOption.H3_DISCOVERY;
 import static java.net.http.HttpOption.Http3DiscoveryMode.ALT_SVC;
 import static java.net.http.HttpOption.Http3DiscoveryMode.ANY;
 import static java.net.http.HttpOption.Http3DiscoveryMode.HTTP_3_URI_ONLY;
-import static jdk.test.lib.Asserts.assertEquals;
-import static jdk.test.lib.Asserts.assertNotEquals;
-import static jdk.test.lib.Asserts.assertTrue;
 
 import org.junit.jupiter.api.Test;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertNotEquals;
+import static org.junit.jupiter.api.Assertions.assertTrue;
 
 public class H3ConnectionPoolTest implements HttpServerAdapters {
 
@@ -257,7 +258,7 @@ public class H3ConnectionPoolTest implements HttpServerAdapters {
                 HttpResponse<String> response2 = client.send(request2, BodyHandlers.ofString());
                 assertEquals(HTTP_3, response2.version());
                 checkStatus(200, response2.statusCode());
-                assertNotEquals(response2.connectionLabel().get(), response1.connectionLabel().get());
+                assertNotEquals(response1.connectionLabel().get(), response2.connectionLabel().get());
 
                 // second request with HTTP3_URI_ONLY should reuse a created connection
                 // It should reuse the advertised connection (from response2) if same
@@ -295,8 +296,8 @@ public class H3ConnectionPoolTest implements HttpServerAdapters {
                 HttpResponse<String> response2 = client.send(request2, BodyHandlers.ofString());
                 assertEquals(HTTP_3, response2.version());
                 checkStatus(200, response2.statusCode());
-                assertNotEquals(response2.connectionLabel().get(), h2resp2.connectionLabel().get());
-                assertNotEquals(response2.connectionLabel().get(), response1.connectionLabel().get());
+                assertNotEquals(h2resp2.connectionLabel().get(), response2.connectionLabel().get());
+                assertNotEquals(response1.connectionLabel().get(), response2.connectionLabel().get());
 
                 // third request with ALT_SVC should reuse the same advertised
                 // connection (from response2), regardless of same origin...
@@ -304,16 +305,16 @@ public class H3ConnectionPoolTest implements HttpServerAdapters {
                 HttpResponse<String> response3 = client.send(request3, BodyHandlers.ofString());
                 assertEquals(HTTP_3, response3.version());
                 checkStatus(200, response3.statusCode());
-                assertEquals(response3.connectionLabel().get(), response2.connectionLabel().get());
-                assertNotEquals(response3.connectionLabel().get(), response1.connectionLabel().get());
+                assertEquals(response2.connectionLabel().get(), response3.connectionLabel().get());
+                assertNotEquals(response1.connectionLabel().get(), response3.connectionLabel().get());
 
                 // fourth request with HTTP_3_URI_ONLY should reuse the first connection,
                 // and not reuse the second.
                 HttpRequest request4 = req1Builder.copy().build();
                 HttpResponse<String> response4 = client.send(request4, BodyHandlers.ofString());
                 assertEquals(HTTP_3, response4.version());
-                assertEquals(response4.connectionLabel().get(), response1.connectionLabel().get());
-                assertNotEquals(response4.connectionLabel().get(), response3.connectionLabel().get());
+                assertEquals(response1.connectionLabel().get(), response4.connectionLabel().get());
+                assertNotEquals(response3.connectionLabel().get(), response4.connectionLabel().get());
                 checkStatus(200, response1.statusCode());
             } else {
                 System.out.println("WARNING: Couldn't create HTTP/3 server on same port! Can't test all...");
@@ -329,7 +330,7 @@ public class H3ConnectionPoolTest implements HttpServerAdapters {
                 HttpResponse<String> response2 = client.send(request2, BodyHandlers.ofString());
                 assertEquals(HTTP_3, response2.version());
                 checkStatus(200, response2.statusCode());
-                assertNotEquals(response2.connectionLabel().get(), h2resp2.connectionLabel().get());
+                assertNotEquals(h2resp2.connectionLabel().get(), response2.connectionLabel().get());
 
                 // third request with ALT_SVC should reuse the same advertised
                 // connection (from response2), regardless of same origin...
@@ -337,7 +338,7 @@ public class H3ConnectionPoolTest implements HttpServerAdapters {
                 HttpResponse<String> response3 = client.send(request3, BodyHandlers.ofString());
                 assertEquals(HTTP_3, response3.version());
                 checkStatus(200, response3.statusCode());
-                assertEquals(response3.connectionLabel().get(), response2.connectionLabel().get());
+                assertEquals(response2.connectionLabel().get(), response3.connectionLabel().get());
             }
         } finally {
             http3OnlyServer.stop();
@@ -417,7 +418,7 @@ public class H3ConnectionPoolTest implements HttpServerAdapters {
                             response2);
                     assertEquals(HTTP_3, response2.version());
                     checkStatus(200, response2.statusCode());
-                    assertNotEquals(response2.connectionLabel().get(), c1Label);
+                    assertNotEquals(c1Label, response2.connectionLabel().get());
                     if (i == 0) {
                         c2Label = response2.connectionLabel().get();
                     }
@@ -494,8 +495,8 @@ public class H3ConnectionPoolTest implements HttpServerAdapters {
                     if (i == 0) {
                         c2Label = response2.connectionLabel().get();
                     }
-                    assertNotEquals(response2.connectionLabel().get(), h2resp2.connectionLabel().get());
-                    assertNotEquals(response2.connectionLabel().get(), c1Label);
+                    assertNotEquals(h2resp2.connectionLabel().get(), response2.connectionLabel().get());
+                    assertNotEquals(c1Label, response2.connectionLabel().get());
                     assertEquals(c2Label, response2.connectionLabel().orElse(null));
                 }
                 var expectedLabels = Set.of(c1Label, c2Label);
@@ -507,7 +508,7 @@ public class H3ConnectionPoolTest implements HttpServerAdapters {
                             response3);
                     assertEquals(HTTP_3, response3.version());
                     checkStatus(200, response3.statusCode());
-                    assertNotEquals(response3.connectionLabel().get(), h2resp2.connectionLabel().get());
+                    assertNotEquals(h2resp2.connectionLabel().get(), response3.connectionLabel().get());
                     var label = response3.connectionLabel().orElse("");
                     assertTrue(expectedLabels.contains(label), "Unexpected label: %s not in %s"
                             .formatted(label, expectedLabels));
@@ -526,7 +527,7 @@ public class H3ConnectionPoolTest implements HttpServerAdapters {
                 HttpResponse<String> response2 = client.send(request2, BodyHandlers.ofString());
                 assertEquals(HTTP_3, response2.version());
                 checkStatus(200, response2.statusCode());
-                assertNotEquals(response2.connectionLabel().get(), h2resp2.connectionLabel().get());
+                assertNotEquals(h2resp2.connectionLabel().get(), response2.connectionLabel().get());
 
                 // third request with ALT_SVC should reuse the same advertised
                 // connection (from response2), regardless of same origin...
@@ -560,21 +561,4 @@ public class H3ConnectionPoolTest implements HttpServerAdapters {
         }
     }
 
-    static void checkStrings(String expected, String found) throws Exception {
-        if (!expected.equals(found)) {
-            System.err.printf("Test failed: wrong string %s/%s\n",
-                    expected, found);
-            throw new RuntimeException("Test failed");
-        }
-    }
-
-
-    static <T> T logExceptionally(String desc, Throwable t) {
-        System.out.println(desc + " failed: " + t);
-        System.err.println(desc + " failed: " + t);
-        if (t instanceof RuntimeException r) throw r;
-        if (t instanceof Error e) throw e;
-        throw new CompletionException(t);
-    }
-
 }

From 7d805e113948196ac4e45ac05e09413e63b9bb46 Mon Sep 17 00:00:00 2001
From: Naoto Sato <naoto@openjdk.org>
Date: Wed, 18 Mar 2026 16:57:52 +0000
Subject: [PATCH 243/655] 8380222: Refactor test/jdk/java/lang/Character TestNG
 tests to JUnit

Reviewed-by: jlu, bpb, liach, iris
---
 .../lang/Character/Latin1CaseConversion.java  | 47 +++++++++----------
 .../UnicodeBlock/NumberEntities.java          | 17 +++----
 2 files changed, 32 insertions(+), 32 deletions(-)

diff --git a/test/jdk/java/lang/Character/Latin1CaseConversion.java b/test/jdk/java/lang/Character/Latin1CaseConversion.java
index a176bd4b002..436193c5f16 100644
--- a/test/jdk/java/lang/Character/Latin1CaseConversion.java
+++ b/test/jdk/java/lang/Character/Latin1CaseConversion.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2023, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2023, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -21,17 +21,16 @@
  * questions.
  */
 
-import org.testng.annotations.Test;
-
-import static org.testng.Assert.assertEquals;
-import static org.testng.Assert.fail;
+import org.junit.jupiter.api.Test;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.fail;
 
 /**
  * @test
  * @bug 8302877
  * @summary Provides exhaustive verification of Character.toUpperCase and Character.toLowerCase
  * for all code points in the latin1 range 0-255.
- * @run testng Latin1CaseConversion
+ * @run junit Latin1CaseConversion
  */
 public class Latin1CaseConversion {
 
@@ -44,41 +43,41 @@ public class Latin1CaseConversion {
             if (c < 0x41) { // Before A
                 assertUnchanged(upper, lower, c);
             } else if (c <= 0x5A) { // A-Z
-                assertEquals(upper, c);
-                assertEquals(lower, c + 32);
+                assertEquals(c, upper);
+                assertEquals(c + 32, lower);
             } else if (c < 0x61) { // Between Z and a
                 assertUnchanged(upper, lower, c);
             } else if (c <= 0x7A) { // a-z
-                assertEquals(upper, c - 32);
-                assertEquals(lower, c);
+                assertEquals(c - 32, upper);
+                assertEquals(c, lower);
             } else if (c < 0xB5) { // Between z and Micro Sign
                 assertUnchanged(upper, lower, c);
             } else if (c == 0xB5) { // Special case for Micro Sign
-                assertEquals(upper, 0x39C);
-                assertEquals(lower, c);
+                assertEquals(0x39C, upper);
+                assertEquals(c, lower);
             } else if (c < 0xC0) { // Between my and A-grave
                 assertUnchanged(upper, lower, c);
             } else if (c < 0xD7) { // A-grave - O with Diaeresis
-                assertEquals(upper, c);
-                assertEquals(lower, c + 32);
+                assertEquals(c, upper);
+                assertEquals(c + 32, lower);
             } else if (c == 0xD7) { // Multiplication
                 assertUnchanged(upper, lower, c);
             } else if (c <= 0xDE) { // O with slash - Thorn
-                assertEquals(upper, c);
-                assertEquals(lower, c + 32);
+                assertEquals(c, upper);
+                assertEquals(c + 32, lower);
             } else if (c == 0xDF) { // Sharp s
                 assertUnchanged(upper, lower, c);
             } else if (c < 0xF7) { // a-grave - divsion
-                assertEquals(upper, c - 32);
-                assertEquals(lower, c);
+                assertEquals(c - 32, upper);
+                assertEquals(c, lower);
             } else if (c == 0xF7) { // Division
                 assertUnchanged(upper, lower, c);
             } else if (c < 0xFF) { // o with slash - thorn
-                assertEquals(upper, c - 32);
-                assertEquals(lower, c);
+                assertEquals(c - 32, upper);
+                assertEquals(c, lower);
             } else if (c == 0XFF) { // Special case for y with Diaeresis
-                assertEquals(upper, 0x178);
-                assertEquals(lower, c);
+                assertEquals(0x178, upper);
+                assertEquals(c, lower);
             } else {
                 fail("Uncovered code point: " + Integer.toHexString(c));
             }
@@ -86,7 +85,7 @@ public class Latin1CaseConversion {
     }
 
     private static void assertUnchanged(int upper, int lower, int c) {
-        assertEquals(upper, c);
-        assertEquals(lower, c);
+        assertEquals(c, upper);
+        assertEquals(c, lower);
     }
 }
diff --git a/test/jdk/java/lang/Character/UnicodeBlock/NumberEntities.java b/test/jdk/java/lang/Character/UnicodeBlock/NumberEntities.java
index 30382c3cfe3..86b9fe6ea69 100644
--- a/test/jdk/java/lang/Character/UnicodeBlock/NumberEntities.java
+++ b/test/jdk/java/lang/Character/UnicodeBlock/NumberEntities.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2015, 2022, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2015, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -28,17 +28,17 @@
  *      of Character.UnicodeBlock constants. Also checks the size of
  *      Character.UnicodeScript's "aliases" map.
  * @modules java.base/java.lang:open
- * @run testng NumberEntities
+ * @run junit NumberEntities
  */
 
-import static org.testng.Assert.assertEquals;
-import org.testng.annotations.Test;
-
 import java.lang.reflect.Field;
 import java.util.Map;
 
-@Test
+import org.junit.jupiter.api.Test;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+
 public class NumberEntities {
+    @Test
     public void test_UnicodeBlock_NumberEntities() throws Throwable {
         // The number of entries in Character.UnicodeBlock.map.
         // See src/java.base/share/classes/java/lang/Character.java
@@ -46,13 +46,14 @@ public class NumberEntities {
         Field m = Character.UnicodeBlock.class.getDeclaredField("map");
         n.setAccessible(true);
         m.setAccessible(true);
-        assertEquals(((Map)m.get(null)).size(), n.getInt(null));
+        assertEquals(n.getInt(null), ((Map)m.get(null)).size());
     }
+    @Test
     public void test_UnicodeScript_aliases() throws Throwable {
         // The number of entries in Character.UnicodeScript.aliases.
         // See src/java.base/share/classes/java/lang/Character.java
         Field aliases = Character.UnicodeScript.class.getDeclaredField("aliases");
         aliases.setAccessible(true);
-        assertEquals(((Map)aliases.get(null)).size(), Character.UnicodeScript.UNKNOWN.ordinal() + 1);
+        assertEquals(Character.UnicodeScript.UNKNOWN.ordinal() + 1, ((Map)aliases.get(null)).size());
     }
 }

From f3069680e48712a7cacc4208550816300f68fbf4 Mon Sep 17 00:00:00 2001
From: Ashutosh Mehra <asmehra@openjdk.org>
Date: Wed, 18 Mar 2026 17:55:00 +0000
Subject: [PATCH 244/655] 8380303: Obsolete unused flag UseXMMForArrayCopy

Reviewed-by: kvn, adinn, ayang
---
 src/hotspot/cpu/x86/vm_version_x86.cpp  | 13 -------------
 src/hotspot/share/runtime/arguments.cpp |  2 +-
 src/hotspot/share/runtime/globals.hpp   |  3 ---
 3 files changed, 1 insertion(+), 17 deletions(-)

diff --git a/src/hotspot/cpu/x86/vm_version_x86.cpp b/src/hotspot/cpu/x86/vm_version_x86.cpp
index a800feea0a8..747d662f668 100644
--- a/src/hotspot/cpu/x86/vm_version_x86.cpp
+++ b/src/hotspot/cpu/x86/vm_version_x86.cpp
@@ -1508,9 +1508,6 @@ void VM_Version::get_processor_features() {
         MaxLoopPad = 11;
       }
 #endif // COMPILER2
-      if (FLAG_IS_DEFAULT(UseXMMForArrayCopy)) {
-        UseXMMForArrayCopy = true; // use SSE2 movq on new ZX cpus
-      }
       if (supports_sse4_2()) { // new ZX cpus
         if (FLAG_IS_DEFAULT(UseUnalignedLoadStores)) {
           UseUnalignedLoadStores = true; // use movdqu on newest ZX cpus
@@ -1571,10 +1568,6 @@ void VM_Version::get_processor_features() {
       if (FLAG_IS_DEFAULT(AllocatePrefetchInstr)) {
         FLAG_SET_DEFAULT(AllocatePrefetchInstr, 3);
       }
-      // On family 15h processors use XMM and UnalignedLoadStores for Array Copy
-      if (supports_sse2() && FLAG_IS_DEFAULT(UseXMMForArrayCopy)) {
-        FLAG_SET_DEFAULT(UseXMMForArrayCopy, true);
-      }
       if (supports_sse2() && FLAG_IS_DEFAULT(UseUnalignedLoadStores)) {
         FLAG_SET_DEFAULT(UseUnalignedLoadStores, true);
       }
@@ -1591,9 +1584,6 @@ void VM_Version::get_processor_features() {
     if (cpu_family() >= 0x17) {
       // On family >=17h processors use XMM and UnalignedLoadStores
       // for Array Copy
-      if (supports_sse2() && FLAG_IS_DEFAULT(UseXMMForArrayCopy)) {
-        FLAG_SET_DEFAULT(UseXMMForArrayCopy, true);
-      }
       if (supports_sse2() && FLAG_IS_DEFAULT(UseUnalignedLoadStores)) {
         FLAG_SET_DEFAULT(UseUnalignedLoadStores, true);
       }
@@ -1640,9 +1630,6 @@ void VM_Version::get_processor_features() {
       }
 #endif // COMPILER2
 
-      if (FLAG_IS_DEFAULT(UseXMMForArrayCopy)) {
-        UseXMMForArrayCopy = true; // use SSE2 movq on new Intel cpus
-      }
       if ((supports_sse4_2() && supports_ht()) || supports_avx()) { // Newest Intel cpus
         if (FLAG_IS_DEFAULT(UseUnalignedLoadStores)) {
           UseUnalignedLoadStores = true; // use movdqu on newest Intel cpus
diff --git a/src/hotspot/share/runtime/arguments.cpp b/src/hotspot/share/runtime/arguments.cpp
index 449ac8e826c..778e9c1fc6d 100644
--- a/src/hotspot/share/runtime/arguments.cpp
+++ b/src/hotspot/share/runtime/arguments.cpp
@@ -554,7 +554,7 @@ static SpecialFlag const special_jvm_flags[] = {
   { "NewSizeThreadIncrease",        JDK_Version::undefined(), JDK_Version::jdk(27), JDK_Version::jdk(28) },
   { "NeverActAsServerClassMachine", JDK_Version::jdk(26),  JDK_Version::jdk(27), JDK_Version::jdk(28) },
   { "AlwaysActAsServerClassMachine", JDK_Version::jdk(26),  JDK_Version::jdk(27), JDK_Version::jdk(28) },
-
+  { "UseXMMForArrayCopy",           JDK_Version::undefined(), JDK_Version::jdk(27), JDK_Version::jdk(28) },
 #ifdef ASSERT
   { "DummyObsoleteTestFlag",        JDK_Version::undefined(), JDK_Version::jdk(18), JDK_Version::undefined() },
 #endif
diff --git a/src/hotspot/share/runtime/globals.hpp b/src/hotspot/share/runtime/globals.hpp
index 0c627e27209..17e10e2f87c 100644
--- a/src/hotspot/share/runtime/globals.hpp
+++ b/src/hotspot/share/runtime/globals.hpp
@@ -798,9 +798,6 @@ const int ObjectAlignmentInBytes = 8;
           "Number of OutOfMemoryErrors preallocated with backtrace")        \
           range(0, 1024)                                                    \
                                                                             \
-  product(bool, UseXMMForArrayCopy, false,                                  \
-          "Use SSE2 MOVQ instruction for Arraycopy")                        \
-                                                                            \
   develop(bool, PrintFieldLayout, false,                                    \
           "Print field layout for each class")                              \
                                                                             \

From 4f2debe697a1ba35ee480fc66d5d937aa4ac2f30 Mon Sep 17 00:00:00 2001
From: Christoph Langer <clanger@openjdk.org>
Date: Wed, 18 Mar 2026 18:58:55 +0000
Subject: [PATCH 245/655] 8380033: Test
 java/util/jar/Manifest/IncludeInExceptionsTest.java could be more agnostic to
 VM default

Reviewed-by: mbaesken
---
 .../jar/Manifest/IncludeInExceptionsTest.java | 22 +++++++++----------
 1 file changed, 11 insertions(+), 11 deletions(-)

diff --git a/test/jdk/java/util/jar/Manifest/IncludeInExceptionsTest.java b/test/jdk/java/util/jar/Manifest/IncludeInExceptionsTest.java
index bb3cd6e23ef..52d3783b4cf 100644
--- a/test/jdk/java/util/jar/Manifest/IncludeInExceptionsTest.java
+++ b/test/jdk/java/util/jar/Manifest/IncludeInExceptionsTest.java
@@ -21,9 +21,6 @@
  * questions.
  */
 
-import org.junit.jupiter.params.ParameterizedTest;
-import org.junit.jupiter.params.provider.MethodSource;
-
 import java.io.IOException;
 import java.io.OutputStream;
 import java.nio.file.Files;
@@ -34,17 +31,23 @@ import java.util.jar.JarFile;
 import java.util.jar.JarOutputStream;
 import java.util.stream.Stream;
 
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
+
 import static java.nio.charset.StandardCharsets.UTF_8;
 import static org.junit.jupiter.api.Assertions.assertThrows;
 import static org.junit.jupiter.api.Assertions.fail;
+import static sun.security.util.SecurityProperties.INCLUDE_JAR_NAME_IN_EXCEPTIONS;
 
 /*
  * @test
  * @bug 8216362
- * @run junit/othervm -Djdk.includeInExceptions=jar IncludeInExceptionsTest
- * @run junit/othervm IncludeInExceptionsTest
  * @summary Verify that the property jdk.includeInExceptions works as expected
- * when an error occurs while reading an invalid Manifest file.
+ *          when an error occurs while reading an invalid Manifest file.
+ * @modules java.base/sun.security.util
+ * @run junit/othervm -Djdk.includeInExceptions=jar IncludeInExceptionsTest
+ * @run junit/othervm -Djdk.includeInExceptions= IncludeInExceptionsTest
+ * @run junit/othervm IncludeInExceptionsTest
  */
 
 /*
@@ -53,8 +56,6 @@ import static org.junit.jupiter.api.Assertions.fail;
  */
 public class IncludeInExceptionsTest {
 
-    private static final boolean includeInExceptions = System.getProperty("jdk.includeInExceptions") != null;
-
     static final String FILENAME = "Unique-Filename-Expected-In_Msg.jar";
 
     static final byte[] INVALID_MANIFEST = (
@@ -79,9 +80,9 @@ public class IncludeInExceptionsTest {
     void testInvalidManifest(Callable<?> attempt) {
         var ioException = assertThrows(IOException.class, attempt::call);
         boolean foundFileName = ioException.getMessage().contains(FILENAME);
-        if (includeInExceptions && !foundFileName) {
+        if (INCLUDE_JAR_NAME_IN_EXCEPTIONS && !foundFileName) {
             fail("JAR file name expected but not found in error message");
-        } else if (foundFileName && !includeInExceptions) {
+        } else if (foundFileName && !INCLUDE_JAR_NAME_IN_EXCEPTIONS) {
             fail("JAR file name found but should not be in error message");
         }
     }
@@ -96,4 +97,3 @@ public class IncludeInExceptionsTest {
         );
     }
 }
-

From 30145a4bd7919d5e616251056903826d3ab01702 Mon Sep 17 00:00:00 2001
From: Sergey Bylokhov <serb@openjdk.org>
Date: Wed, 18 Mar 2026 20:40:42 +0000
Subject: [PATCH 246/655] 8379952: Revert JDK-8365711: Restore protected
 visibility of menuBarHeight and hotTrackingOn

Reviewed-by: azvegint
---
 .../com/sun/java/swing/plaf/windows/WindowsMenuUI.java        | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsMenuUI.java b/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsMenuUI.java
index a7aca0c5ccf..259c32c74f4 100644
--- a/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsMenuUI.java
+++ b/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsMenuUI.java
@@ -51,8 +51,8 @@ import com.sun.java.swing.plaf.windows.TMSchema.State;
  * Windows rendition of the component.
  */
 public final class WindowsMenuUI extends BasicMenuUI {
-    private Integer menuBarHeight;
-    private boolean hotTrackingOn;
+    protected Integer menuBarHeight;
+    protected boolean hotTrackingOn;
 
     final WindowsMenuItemUIAccessor accessor =
         new WindowsMenuItemUIAccessor() {

From 37cdc7977fc346c4b66d10fa149d6f28553f7002 Mon Sep 17 00:00:00 2001
From: Alexander Zvegintsev <azvegint@openjdk.org>
Date: Wed, 18 Mar 2026 20:47:48 +0000
Subject: [PATCH 247/655] 8380228: JNI primitive type mismatch in
 Java_com_sun_java_swing_plaf_gtk_GTKLookAndFeel_applyThemeIfNeeded of
 swing_GTKEngine.c:403 (ID: 52423)

Reviewed-by: psadhukhan, serb
---
 .../unix/native/libawt_xawt/awt/swing_GTKEngine.c             | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/src/java.desktop/unix/native/libawt_xawt/awt/swing_GTKEngine.c b/src/java.desktop/unix/native/libawt_xawt/awt/swing_GTKEngine.c
index 3b7b2880316..1c29e5168ba 100644
--- a/src/java.desktop/unix/native/libawt_xawt/awt/swing_GTKEngine.c
+++ b/src/java.desktop/unix/native/libawt_xawt/awt/swing_GTKEngine.c
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2005, 2020, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2005, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -400,5 +400,5 @@ Java_com_sun_java_swing_plaf_gtk_GTKLookAndFeel_applyThemeIfNeeded(JNIEnv *env,
     const gboolean result = gtk->apply_theme_if_needed();
     gtk->gdk_threads_leave();
 
-    return result;
+    return result ? JNI_TRUE : JNI_FALSE;
 }

From 27a4ed5b7adbf6652b0ff82158f80d90d3f9ba65 Mon Sep 17 00:00:00 2001
From: Rui Li <ruiamzn@amazon.com>
Date: Wed, 18 Mar 2026 23:11:48 +0000
Subject: [PATCH 248/655] 8375568: Shenandoah: Abbreviate thread names in
 display when length constraints apply

Reviewed-by: wkemper, kdnilsen
---
 src/hotspot/share/gc/shenandoah/shenandoahControlThread.cpp     | 2 +-
 .../share/gc/shenandoah/shenandoahGenerationalControlThread.cpp | 2 +-
 src/hotspot/share/gc/shenandoah/shenandoahHeap.cpp              | 2 +-
 src/hotspot/share/gc/shenandoah/shenandoahRegulatorThread.cpp   | 2 +-
 src/hotspot/share/gc/shenandoah/shenandoahUncommitThread.cpp    | 2 +-
 .../hotspot/jtreg/gc/ergonomics/TestInitialGCThreadLogging.java | 2 +-
 6 files changed, 6 insertions(+), 6 deletions(-)

diff --git a/src/hotspot/share/gc/shenandoah/shenandoahControlThread.cpp b/src/hotspot/share/gc/shenandoah/shenandoahControlThread.cpp
index c5607421265..48183507124 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahControlThread.cpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahControlThread.cpp
@@ -45,7 +45,7 @@ ShenandoahControlThread::ShenandoahControlThread() :
   _requested_gc_cause(GCCause::_no_gc),
   _degen_point(ShenandoahGC::_degenerated_outside_cycle),
   _control_lock(CONTROL_LOCK_RANK, "ShenandoahControl_lock", true) {
-  set_name("Shenandoah Control Thread");
+  set_name("ShenControl");
   create_and_start();
 }
 
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahGenerationalControlThread.cpp b/src/hotspot/share/gc/shenandoah/shenandoahGenerationalControlThread.cpp
index 5f201a404d8..1edff443ded 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahGenerationalControlThread.cpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahGenerationalControlThread.cpp
@@ -55,7 +55,7 @@ ShenandoahGenerationalControlThread::ShenandoahGenerationalControlThread() :
   _heap(ShenandoahGenerationalHeap::heap()),
   _age_period(0) {
   shenandoah_assert_generational();
-  set_name("Shenandoah Control Thread");
+  set_name("ShenControl");
   create_and_start();
 }
 
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahHeap.cpp b/src/hotspot/share/gc/shenandoah/shenandoahHeap.cpp
index c6889351161..c0a4cfc34fb 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahHeap.cpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahHeap.cpp
@@ -261,7 +261,7 @@ jint ShenandoahHeap::initialize() {
   //
   // Worker threads must be initialized after the barrier is configured
   //
-  _workers = new ShenandoahWorkerThreads("Shenandoah GC Threads", _max_workers);
+  _workers = new ShenandoahWorkerThreads("ShenWorker", _max_workers);
   if (_workers == nullptr) {
     vm_exit_during_initialization("Failed necessary allocation.");
   } else {
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahRegulatorThread.cpp b/src/hotspot/share/gc/shenandoah/shenandoahRegulatorThread.cpp
index fe92a3a3e08..28094a1d57d 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahRegulatorThread.cpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahRegulatorThread.cpp
@@ -43,7 +43,7 @@ ShenandoahRegulatorThread::ShenandoahRegulatorThread(ShenandoahGenerationalContr
   _young_heuristics = _heap->young_generation()->heuristics();
   _global_heuristics = _heap->global_generation()->heuristics();
 
-  set_name("Shenandoah Regulator Thread");
+  set_name("ShenRegulator");
   create_and_start();
 }
 
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahUncommitThread.cpp b/src/hotspot/share/gc/shenandoah/shenandoahUncommitThread.cpp
index ec708b198e7..f2fcd39daf5 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahUncommitThread.cpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahUncommitThread.cpp
@@ -32,7 +32,7 @@
 ShenandoahUncommitThread::ShenandoahUncommitThread(ShenandoahHeap* heap)
   : _heap(heap),
     _uncommit_lock(Mutex::safepoint - 2, "ShenandoahUncommit_lock", true) {
-  set_name("Shenandoah Uncommit Thread");
+  set_name("ShenUncommit");
   create_and_start();
 
   // Allow uncommits. This is managed by the control thread during a GC.
diff --git a/test/hotspot/jtreg/gc/ergonomics/TestInitialGCThreadLogging.java b/test/hotspot/jtreg/gc/ergonomics/TestInitialGCThreadLogging.java
index 69a3e7b8742..52aa1bc26e5 100644
--- a/test/hotspot/jtreg/gc/ergonomics/TestInitialGCThreadLogging.java
+++ b/test/hotspot/jtreg/gc/ergonomics/TestInitialGCThreadLogging.java
@@ -55,7 +55,7 @@ public class TestInitialGCThreadLogging {
 
     if (GC.Shenandoah.isSupported()) {
       noneGCSupported = false;
-      testInitialGCThreadLogging("UseShenandoahGC", "Shenandoah GC Thread");
+      testInitialGCThreadLogging("UseShenandoahGC", "ShenWorker");
     }
 
     if (noneGCSupported) {

From deccad2e95549611631543211d69ca7fff59c5e7 Mon Sep 17 00:00:00 2001
From: Thomas Stuefe <stuefe@openjdk.org>
Date: Thu, 19 Mar 2026 05:04:00 +0000
Subject: [PATCH 249/655] 8377907: (process) Race in ProcessBuilder can cause
 JVM hangs

Reviewed-by: simonis, rriggs
---
 make/test/JtregNativeJdk.gmk                  |   8 +-
 .../unix/native/jspawnhelper/jspawnhelper.c   |  72 ++++---
 .../unix/native/libjava/ProcessImpl_md.c      | 159 +++++++++++---
 src/java.base/unix/native/libjava/childproc.c | 121 +++++++----
 src/java.base/unix/native/libjava/childproc.h |  17 +-
 test/jdk/java/lang/ProcessBuilder/Basic.java  |  39 +++-
 .../ConcNativeForkTest.java                   | 129 ++++++++++++
 .../ConcNativeForkTest/libConcNativeFork.c    | 147 +++++++++++++
 .../ProcessBuilder/FDLeakTest/FDLeakTest.java |   8 +-
 .../ProcessBuilder/JspawnhelperProtocol.java  |  18 +-
 .../ProcessBuilder/JspawnhelperWarnings.java  |   9 +-
 .../ProcessBuilder/NonPipelineLeaksFD.java    | 182 ++++++++++++++++
 .../lang/ProcessBuilder/PipelineLeaksFD.java  |  18 +-
 .../PipesCloseOnExecTest.java                 | 115 ++++++++++
 .../libPipesCloseOnExec.c                     | 198 ++++++++++++++++++
 test/lib/native/testlib_thread_barriers.h     |  83 ++++++++
 16 files changed, 1190 insertions(+), 133 deletions(-)
 create mode 100644 test/jdk/java/lang/ProcessBuilder/ConcNativeForkTest/ConcNativeForkTest.java
 create mode 100644 test/jdk/java/lang/ProcessBuilder/ConcNativeForkTest/libConcNativeFork.c
 create mode 100644 test/jdk/java/lang/ProcessBuilder/NonPipelineLeaksFD.java
 create mode 100644 test/jdk/java/lang/ProcessBuilder/PipesCloseOnExecTest/PipesCloseOnExecTest.java
 create mode 100644 test/jdk/java/lang/ProcessBuilder/PipesCloseOnExecTest/libPipesCloseOnExec.c
 create mode 100644 test/lib/native/testlib_thread_barriers.h

diff --git a/make/test/JtregNativeJdk.gmk b/make/test/JtregNativeJdk.gmk
index 0482011f561..6774e708f99 100644
--- a/make/test/JtregNativeJdk.gmk
+++ b/make/test/JtregNativeJdk.gmk
@@ -1,5 +1,5 @@
 #
-# Copyright (c) 2015, 2025, Oracle and/or its affiliates. All rights reserved.
+# Copyright (c) 2015, 2026, Oracle and/or its affiliates. All rights reserved.
 # DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
 #
 # This code is free software; you can redistribute it and/or modify it
@@ -63,7 +63,8 @@ ifeq ($(call isTargetOs, windows), true)
   BUILD_JDK_JTREG_EXCLUDE += libDirectIO.c libInheritedChannel.c \
       libExplicitAttach.c libImplicitAttach.c \
       exelauncher.c libFDLeaker.c exeFDLeakTester.c \
-      libChangeSignalDisposition.c exePrintSignalDisposition.c
+      libChangeSignalDisposition.c exePrintSignalDisposition.c \
+      libConcNativeFork.c libPipesCloseOnExec.c
 
   BUILD_JDK_JTREG_EXECUTABLES_LIBS_exeNullCallerTest := $(LIBCXX)
   BUILD_JDK_JTREG_EXECUTABLES_LIBS_exerevokeall := advapi32.lib
@@ -77,6 +78,9 @@ else
   BUILD_JDK_JTREG_LIBRARIES_LDFLAGS_libLinkerInvokerUnnamed := -pthread
   BUILD_JDK_JTREG_LIBRARIES_LDFLAGS_libLinkerInvokerModule := -pthread
   BUILD_JDK_JTREG_LIBRARIES_LDFLAGS_libLoaderLookupInvoker := -pthread
+  BUILD_JDK_JTREG_LIBRARIES_LDFLAGS_libConcNativeFork := -pthread
+  BUILD_JDK_JTREG_LIBRARIES_LDFLAGS_libPipesCloseOnExec := -pthread
+  BUILD_JDK_JTREG_LIBRARIES_LDFLAGS_libLoaderLookupInvoker := -pthread
 
   BUILD_JDK_JTREG_LIBRARIES_LDFLAGS_libExplicitAttach := -pthread
   BUILD_JDK_JTREG_LIBRARIES_LDFLAGS_libImplicitAttach := -pthread
diff --git a/src/java.base/unix/native/jspawnhelper/jspawnhelper.c b/src/java.base/unix/native/jspawnhelper/jspawnhelper.c
index f26d0d618e3..2523fb30acc 100644
--- a/src/java.base/unix/native/jspawnhelper/jspawnhelper.c
+++ b/src/java.base/unix/native/jspawnhelper/jspawnhelper.c
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2013, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2013, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -26,12 +26,13 @@
 #include <assert.h>
 #include <errno.h>
 #include <fcntl.h>
+#include <stdarg.h>
+#include <stdbool.h>
 #include <stdio.h>
 #include <stdlib.h>
 #include <string.h>
 #include <unistd.h>
 #include <sys/types.h>
-#include <sys/stat.h>
 
 #include "childproc.h"
 #include "childproc_errorcodes.h"
@@ -148,17 +149,37 @@ void initChildStuff (int fdin, int fdout, ChildStuff *c) {
     offset += sp.parentPathvBytes;
 }
 
+#ifdef DEBUG
+static void checkIsValid(int fd) {
+    if (!fdIsValid(fd)) {
+        puts(usageErrorText);
+        sendErrorCodeAndExit(-1, ESTEP_JSPAWN_INVALID_FD, fd, errno);
+    }
+}
+static void checkIsPipe(int fd) {
+    checkIsValid(fd);
+    if (!fdIsPipe(fd)) {
+        puts(usageErrorText);
+        sendErrorCodeAndExit(-1, ESTEP_JSPAWN_NOT_A_PIPE, fd, errno);
+    }
+}
+static void checkFileDescriptorSetup() {
+    checkIsValid(STDIN_FILENO);
+    checkIsValid(STDOUT_FILENO);
+    checkIsValid(STDERR_FILENO);
+    checkIsPipe(FAIL_FILENO);
+    checkIsPipe(CHILDENV_FILENO);
+}
+#endif // DEBUG
+
 int main(int argc, char *argv[]) {
     ChildStuff c;
-    struct stat buf;
-    /* argv[1] contains the fd number to read all the child info */
-    int r, fdinr, fdinw, fdout;
 
 #ifdef DEBUG
     jtregSimulateCrash(0, 4);
 #endif
 
-    if (argc != 3) {
+    if (argc != 2) {
         printf("Incorrect number of arguments: %d\n", argc);
         puts(usageErrorText);
         sendErrorCodeAndExit(-1, ESTEP_JSPAWN_ARG_ERROR, 0, 0);
@@ -170,32 +191,21 @@ int main(int argc, char *argv[]) {
         sendErrorCodeAndExit(-1, ESTEP_JSPAWN_VERSION_ERROR, 0, 0);
     }
 
-    r = sscanf (argv[2], "%d:%d:%d", &fdinr, &fdinw, &fdout);
-    if (r == 3 && fcntl(fdinr, F_GETFD) != -1 && fcntl(fdinw, F_GETFD) != -1) {
-        fstat(fdinr, &buf);
-        if (!S_ISFIFO(buf.st_mode)) {
-            printf("Incorrect input pipe\n");
-            puts(usageErrorText);
-            sendErrorCodeAndExit(-1, ESTEP_JSPAWN_NOT_A_PIPE, fdinr, errno);
-        }
-    } else {
-        printf("Incorrect FD array data: %s\n", argv[2]);
-        puts(usageErrorText);
-        sendErrorCodeAndExit(-1, ESTEP_JSPAWN_NOT_A_PIPE, fdinr, errno);
-    }
+#ifdef DEBUG
+    /* Check expected file descriptors */
+    checkFileDescriptorSetup();
+#endif
 
-    // Close the writing end of the pipe we use for reading from the parent.
-    // We have to do this before we start reading from the parent to avoid
-    // blocking in the case the parent exits before we finished reading from it.
-    close(fdinw); // Deliberately ignore errors (see https://lwn.net/Articles/576478/).
-    initChildStuff (fdinr, fdout, &c);
-    // Now set the file descriptor for the pipe's writing end to -1
-    // for the case that somebody tries to close it again.
-    assert(c.childenv[1] == fdinw);
-    c.childenv[1] = -1;
-    // The file descriptor for reporting errors back to our parent we got on the command
-    // line should be the same like the one in the ChildStuff struct we've just read.
-    assert(c.fail[1] == fdout);
+    initChildStuff(CHILDENV_FILENO, FAIL_FILENO, &c);
+
+#ifdef DEBUG
+    /* Not needed in spawn mode */
+    assert(c.in[0] == -1 && c.in[1] == -1 &&
+           c.out[0] == -1 && c.out[1] == -1 &&
+           c.err[0] == -1 && c.err[1] == -1 &&
+           c.fail[0] == -1 && c.fail[1] == -1 &&
+           c.fds[0] == -1 && c.fds[1] == -1 && c.fds[2] == -1);
+#endif
 
     childProcess (&c);
     return 0; /* NOT REACHED */
diff --git a/src/java.base/unix/native/libjava/ProcessImpl_md.c b/src/java.base/unix/native/libjava/ProcessImpl_md.c
index 29522f3c822..f7d91166e76 100644
--- a/src/java.base/unix/native/libjava/ProcessImpl_md.c
+++ b/src/java.base/unix/native/libjava/ProcessImpl_md.c
@@ -43,7 +43,9 @@
 #include <sys/wait.h>
 #include <signal.h>
 #include <string.h>
-
+#include <fcntl.h>
+#include <stdbool.h>
+#include <unistd.h>
 #include <spawn.h>
 
 #include "childproc.h"
@@ -528,27 +530,46 @@ forkChild(ChildStuff *c) {
     return resultPid;
 }
 
+/* Given two fds, one of which has to be -1, the other one has to be valid,
+ * return the valid one. */
+static int eitherOneOf(int fd1, int fd2) {
+    if (fd2 == -1) {
+        assert(fdIsValid(fd1));
+        return fd1;
+    }
+    assert(fd1 == -1);
+    assert(fdIsValid(fd2));
+    return fd2;
+}
+
+static int call_posix_spawn_file_actions_adddup2(posix_spawn_file_actions_t *file_actions, int filedes, int newfiledes) {
+#ifdef __APPLE__
+    /* MacOS is not POSIX-compliant: dup2 file actions specifying the same fd as source and destination
+     * should be handled as no-op according to spec, but they cause EBADF. */
+    if (filedes == newfiledes) {
+        return 0;
+    }
+#endif
+    return posix_spawn_file_actions_adddup2(file_actions, filedes, newfiledes);
+}
+
 static pid_t
 spawnChild(JNIEnv *env, jobject process, ChildStuff *c, const char *helperpath) {
     pid_t resultPid;
-    int i, offset, rval, bufsize, magic;
-    char *buf, buf1[(3 * 11) + 3]; // "%d:%d:%d\0"
-    char *hlpargs[4];
+    int offset, rval, bufsize, magic;
+    char* buf;
+    char* hlpargs[3];
     SpawnInfo sp;
+    posix_spawn_file_actions_t file_actions;
+    int child_stdin, child_stdout, child_stderr, child_childenv, child_fail = -1;
 
-    /* need to tell helper which fd is for receiving the childstuff
-     * and which fd to send response back on
-     */
-    snprintf(buf1, sizeof(buf1), "%d:%d:%d", c->childenv[0], c->childenv[1], c->fail[1]);
     /* NULL-terminated argv array.
      * argv[0] contains path to jspawnhelper, to follow conventions.
      * argv[1] contains the version string as argument to jspawnhelper
-     * argv[2] contains the fd string as argument to jspawnhelper
      */
     hlpargs[0] = (char*)helperpath;
     hlpargs[1] = VERSION_STRING;
-    hlpargs[2] = buf1;
-    hlpargs[3] = NULL;
+    hlpargs[2] = NULL;
 
     /* Following items are sent down the pipe to the helper
      * after it is spawned.
@@ -571,19 +592,79 @@ spawnChild(JNIEnv *env, jobject process, ChildStuff *c, const char *helperpath)
     bufsize += sp.dirlen;
     arraysize(parentPathv, &sp.nparentPathv, &sp.parentPathvBytes);
     bufsize += sp.parentPathvBytes;
-    /* We need to clear FD_CLOEXEC if set in the fds[].
-     * Files are created FD_CLOEXEC in Java.
-     * Otherwise, they will be closed when the target gets exec'd */
-    for (i=0; i<3; i++) {
-        if (c->fds[i] != -1) {
-            int flags = fcntl(c->fds[i], F_GETFD);
-            if (flags & FD_CLOEXEC) {
-                fcntl(c->fds[i], F_SETFD, flags & (~FD_CLOEXEC));
-            }
-        }
+
+    /* Prepare file descriptors for jspawnhelper and the target binary. */
+
+    /* 0: copy of either "in" pipe read fd or the stdin redirect fd */
+    child_stdin = eitherOneOf(c->fds[0], c->in[0]);
+
+    /* 1: copy of either "out" pipe write fd or the stdout redirect fd */
+    child_stdout = eitherOneOf(c->fds[1], c->out[1]);
+
+    /* 2: redirectErrorStream=1: redirected to child's stdout (Order matters!)
+     *    redirectErrorStream=0: copy of either "err" pipe write fd or stderr redirect fd. */
+    if (c->redirectErrorStream) {
+        child_stderr = STDOUT_FILENO; /* Note: this refers to the future stdout in the child process */
+    } else {
+        child_stderr = eitherOneOf(c->fds[2], c->err[1]);
     }
 
-    rval = posix_spawn(&resultPid, helperpath, 0, 0, (char * const *) hlpargs, environ);
+    /* 3: copy of the "fail" pipe write fd */
+    child_fail = c->fail[1];
+
+    /* 4: copy of the "childenv" pipe read end */
+    child_childenv = c->childenv[0];
+
+    assert(fdIsValid(child_stdin));
+    assert(fdIsValid(child_stdout));
+    assert(fdIsValid(child_stderr));
+    assert(fdIsPipe(child_fail));
+    assert(fdIsPipe(child_childenv));
+    /* This must always hold true, unless someone deliberately closed 0, 1, or 2 in the parent JVM. */
+    assert(child_fail > STDERR_FILENO);
+    assert(child_childenv > STDERR_FILENO);
+
+    /* Slot in dup2 file actions. */
+    posix_spawn_file_actions_init(&file_actions);
+
+#ifdef __APPLE__
+    /* On MacOS, posix_spawn does not behave in a POSIX-conform way in that the
+     * kernel closes CLOEXEC file descriptors too early for dup2 file actions to
+     * copy them after the fork. We have to explicitly prevent that by calling a
+     * propietary API. */
+    posix_spawn_file_actions_addinherit_np(&file_actions, child_stdin);
+    posix_spawn_file_actions_addinherit_np(&file_actions, child_stdout);
+    posix_spawn_file_actions_addinherit_np(&file_actions, child_stderr);
+    posix_spawn_file_actions_addinherit_np(&file_actions, child_fail);
+    posix_spawn_file_actions_addinherit_np(&file_actions, child_childenv);
+#endif
+
+    /* First dup2 stdin/out/err to 0,1,2. After this, we can safely dup2 over the
+     * original stdin/out/err. */
+    if (call_posix_spawn_file_actions_adddup2(&file_actions, child_stdin, STDIN_FILENO) != 0 ||
+        call_posix_spawn_file_actions_adddup2(&file_actions, child_stdout, STDOUT_FILENO) != 0 ||
+        /* Order matters: stderr may be redirected to stdout, so this dup2 must happen after the stdout one. */
+        call_posix_spawn_file_actions_adddup2(&file_actions, child_stderr, STDERR_FILENO) != 0)
+    {
+        return -1;
+    }
+
+    /* We dup2 with one intermediary step to prevent accidentally dup2'ing over child_childenv. */
+    const int tmp_child_childenv = child_fail < 10 ? 10 : child_fail - 1;
+    if (call_posix_spawn_file_actions_adddup2(&file_actions, child_childenv, tmp_child_childenv) != 0 ||
+        call_posix_spawn_file_actions_adddup2(&file_actions, child_fail, FAIL_FILENO) != 0 ||
+        call_posix_spawn_file_actions_adddup2(&file_actions, tmp_child_childenv, CHILDENV_FILENO) != 0)
+    {
+        return -1;
+    }
+
+    /* Since we won't use these in jspawnhelper, reset them all */
+    c->in[0] = c->in[1] = c->out[0] = c->out[1] =
+    c->err[0] = c->err[1] = c->fail[0] = c->fail[1] =
+    c->fds[0] = c->fds[1] = c->fds[2] = -1;
+    c->redirectErrorStream = false;
+
+    rval = posix_spawn(&resultPid, helperpath, &file_actions, 0, (char * const *) hlpargs, environ);
 
     if (rval != 0) {
         return -1;
@@ -667,6 +748,30 @@ startChild(JNIEnv *env, jobject process, ChildStuff *c, const char *helperpath)
     }
 }
 
+static int pipeSafely(int fd[2]) {
+    /* Pipe filedescriptors must be CLOEXEC as early as possible - ideally from the point of
+     * creation on - since at any moment a concurrent (third-party) fork() could inherit copies
+     * of these descriptors and accidentally keep the pipes open. That could cause the parent
+     * process to hang (see e.g. JDK-8377907).
+     * We use pipe2(2), if we have it. If we don't, we use pipe(2) + fcntl(2) immediately.
+     * The latter is still racy and can therefore still cause hangs as described in JDK-8377907,
+     * but at least the dangerous time window is as short as we can make it.
+     */
+    int rc = -1;
+#ifdef HAVE_PIPE2
+    rc = pipe2(fd, O_CLOEXEC);
+#else
+    rc = pipe(fd);
+    if (rc == 0) {
+        fcntl(fd[0], F_SETFD, FD_CLOEXEC);
+        fcntl(fd[1], F_SETFD, FD_CLOEXEC);
+    }
+#endif /* HAVE_PIPE2 */
+    assert(fdIsCloexec(fd[0]));
+    assert(fdIsCloexec(fd[1]));
+    return rc;
+}
+
 JNIEXPORT jint JNICALL
 Java_java_lang_ProcessImpl_forkAndExec(JNIEnv *env,
                                        jobject process,
@@ -727,11 +832,11 @@ Java_java_lang_ProcessImpl_forkAndExec(JNIEnv *env,
     fds = (*env)->GetIntArrayElements(env, std_fds, NULL);
     if (fds == NULL) goto Catch;
 
-    if ((fds[0] == -1 && pipe(in)  < 0) ||
-        (fds[1] == -1 && pipe(out) < 0) ||
-        (fds[2] == -1 && !redirectErrorStream && pipe(err) < 0) || // if not redirecting create the pipe
-        (pipe(childenv) < 0) ||
-        (pipe(fail) < 0)) {
+    if ((fds[0] == -1 && pipeSafely(in)  < 0) ||
+        (fds[1] == -1 && pipeSafely(out) < 0) ||
+        (fds[2] == -1 && !redirectErrorStream && pipeSafely(err) < 0) ||
+        (pipeSafely(childenv) < 0) ||
+        (pipeSafely(fail) < 0)) {
         throwInternalIOException(env, errno, "Bad file descriptor", mode);
         goto Catch;
     }
diff --git a/src/java.base/unix/native/libjava/childproc.c b/src/java.base/unix/native/libjava/childproc.c
index a45674e3f82..83ee782482f 100644
--- a/src/java.base/unix/native/libjava/childproc.c
+++ b/src/java.base/unix/native/libjava/childproc.c
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2013, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2013, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,13 +23,16 @@
  * questions.
  */
 
+#include <assert.h>
 #include <dirent.h>
 #include <errno.h>
 #include <fcntl.h>
 #include <signal.h>
+#include <stdbool.h>
 #include <stdio.h>
 #include <stdlib.h>
 #include <string.h>
+#include <sys/stat.h>
 #include <unistd.h>
 #include <limits.h>
 
@@ -39,12 +42,27 @@
 
 const char * const *parentPathv;
 
+#ifdef DEBUG
+bool fdIsValid(int fd) {
+    return fcntl(fd, F_GETFD) != -1;
+}
+bool fdIsPipe(int fd) {
+    struct stat buf;
+    errno = 0;
+    return fstat(fd, &buf) != -1 && S_ISFIFO(buf.st_mode);
+}
+bool fdIsCloexec(int fd) {
+    errno = 0;
+    const int flags = fcntl(fd, F_GETFD);
+    return flags != -1 && (flags & FD_CLOEXEC);
+}
+#endif // DEBUG
+
+static int
+restartableDup2(int fd_from, int fd_to, errcode_t* errcode)
 /* All functions taking an errcode_t* as output behave the same: upon error, they populate
  * errcode_t::hint and errcode_t::errno, but leave errcode_t::step as ESTEP_UNKNOWN since
  * this information will be provided by the outer caller */
-
-static bool
-restartableDup2(int fd_from, int fd_to, errcode_t* errcode)
 {
     int err;
     RESTARTABLE(dup2(fd_from, fd_to), err);
@@ -393,7 +411,10 @@ childProcess(void *arg)
 {
     const ChildStuff* p = (const ChildStuff*) arg;
 
-    int fail_pipe_fd = p->fail[1];
+    int fail_pipe_fd = (p->mode == MODE_POSIX_SPAWN) ?
+        FAIL_FILENO : /* file descriptors already set up by posix_spawn(). */
+        p->fail[1];
+
     /* error information for WhyCantJohnnyExec */
     errcode_t errcode;
 
@@ -407,55 +428,63 @@ childProcess(void *arg)
 #ifdef DEBUG
     jtregSimulateCrash(0, 6);
 #endif
-    /* Close the parent sides of the pipes.
-       Closing pipe fds here is redundant, since markDescriptorsCloseOnExec()
-       would do it anyways, but a little paranoia is a good thing. */
-    if (!closeSafely2(p->in[1], &errcode)  ||
-        !closeSafely2(p->out[0], &errcode) ||
-        !closeSafely2(p->err[0], &errcode) ||
-        !closeSafely2(p->childenv[0], &errcode) ||
-        !closeSafely2(p->childenv[1], &errcode) ||
-        !closeSafely2(p->fail[0], &errcode))
-    {
-        errcode.step = ESTEP_PIPECLOSE_FAIL;
-        goto WhyCantJohnnyExec;
-    }
 
-    /* Give the child sides of the pipes the right fileno's. */
-    /* Note: it is possible for in[0] == 0 */
-    if (!moveDescriptor(p->in[0] != -1 ?  p->in[0] : p->fds[0],
-                                STDIN_FILENO, &errcode)) {
-        errcode.step = ESTEP_DUP2_STDIN_FAIL;
-        goto WhyCantJohnnyExec;
-    }
+    /* File descriptor setup for non-Posix-spawn mode */
+    if (p->mode != MODE_POSIX_SPAWN) {
 
-    if (!moveDescriptor(p->out[1] != -1 ?  p->out[1] : p->fds[1],
-                                STDOUT_FILENO, &errcode)) {
-        errcode.step = ESTEP_DUP2_STDOUT_FAIL;
-        goto WhyCantJohnnyExec;
-    }
-
-    if (p->redirectErrorStream) {
-        if (!closeSafely2(p->err[1], &errcode) ||
-            !restartableDup2(STDOUT_FILENO, STDERR_FILENO, &errcode)) {
-            errcode.step = ESTEP_DUP2_STDERR_REDIRECT_FAIL;
+        /* Close the parent sides of the pipes.
+           Closing pipe fds here is redundant, since markDescriptorsCloseOnExec()
+           would do it anyways, but a little paranoia is a good thing. */
+        if (!closeSafely2(p->in[1], &errcode)  ||
+            !closeSafely2(p->out[0], &errcode) ||
+            !closeSafely2(p->err[0], &errcode) ||
+            !closeSafely2(p->childenv[0], &errcode) ||
+            !closeSafely2(p->childenv[1], &errcode) ||
+            !closeSafely2(p->fail[0], &errcode))
+        {
+            errcode.step = ESTEP_PIPECLOSE_FAIL;
             goto WhyCantJohnnyExec;
         }
-    } else {
-        if (!moveDescriptor(p->err[1] != -1 ? p->err[1] : p->fds[2],
-                                    STDERR_FILENO, &errcode)) {
-            errcode.step = ESTEP_DUP2_STDERR_REDIRECT_FAIL;
+
+        /* Give the child sides of the pipes the right fileno's. */
+        /* Note: it is possible for in[0] == 0 */
+        if (!moveDescriptor(p->in[0] != -1 ?  p->in[0] : p->fds[0],
+                                    STDIN_FILENO, &errcode)) {
+            errcode.step = ESTEP_DUP2_STDIN_FAIL;
             goto WhyCantJohnnyExec;
         }
-    }
 
-    if (!moveDescriptor(fail_pipe_fd, FAIL_FILENO, &errcode)) {
-        errcode.step = ESTEP_DUP2_FAILPIPE_FAIL;
-        goto WhyCantJohnnyExec;
-    }
+        if (!moveDescriptor(p->out[1] != -1 ?  p->out[1] : p->fds[1],
+                                    STDOUT_FILENO, &errcode)) {
+            errcode.step = ESTEP_DUP2_STDOUT_FAIL;
+            goto WhyCantJohnnyExec;
+        }
 
-    /* We moved the fail pipe fd */
-    fail_pipe_fd = FAIL_FILENO;
+        if (p->redirectErrorStream) {
+            if (!closeSafely2(p->err[1], &errcode) ||
+                !restartableDup2(STDOUT_FILENO, STDERR_FILENO, &errcode)) {
+                errcode.step = ESTEP_DUP2_STDERR_REDIRECT_FAIL;
+                goto WhyCantJohnnyExec;
+            }
+        } else {
+            if (!moveDescriptor(p->err[1] != -1 ? p->err[1] : p->fds[2],
+                                        STDERR_FILENO, &errcode)) {
+                errcode.step = ESTEP_DUP2_STDERR_REDIRECT_FAIL;
+                goto WhyCantJohnnyExec;
+            }
+        }
+
+        if (!moveDescriptor(fail_pipe_fd, FAIL_FILENO, &errcode)) {
+            errcode.step = ESTEP_DUP2_FAILPIPE_FAIL;
+            goto WhyCantJohnnyExec;
+        }
+
+        /* We moved the fail pipe fd */
+        fail_pipe_fd = FAIL_FILENO;
+
+    } /* end: FORK/VFORK mode */
+
+    assert(fail_pipe_fd == FAIL_FILENO);
 
     /* For AIX: The code in markDescriptorsCloseOnExec() relies on the current
      * semantic of this function. When this point here is reached only the
diff --git a/src/java.base/unix/native/libjava/childproc.h b/src/java.base/unix/native/libjava/childproc.h
index 4271c786635..27414e60137 100644
--- a/src/java.base/unix/native/libjava/childproc.h
+++ b/src/java.base/unix/native/libjava/childproc.h
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2013, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2013, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -27,6 +27,7 @@
 #define CHILDPROC_MD_H
 
 #include <sys/types.h>
+#include <stdbool.h>
 
 #ifdef __APPLE__
 #include <crt_externs.h>
@@ -72,6 +73,9 @@ extern char **environ;
 
 #define FAIL_FILENO (STDERR_FILENO + 1)
 
+/* For POSIX_SPAWN mode */
+#define CHILDENV_FILENO (FAIL_FILENO + 1)
+
 /* These numbers must be the same as the Enum in ProcessImpl.java
  * Must be a better way of doing this.
  */
@@ -129,6 +133,17 @@ int childProcess(void *arg);
  * See: test/jdk/java/lang/ProcessBuilder/JspawnhelperProtocol.java
  */
 void jtregSimulateCrash(pid_t child, int stage);
+/* Helper functions to check the state of fds */
+bool fdIsValid(int fd);
+bool fdIsPipe(int fd);
+bool fdIsCloexec(int fd);
 #endif
 
+#if defined(__linux__) || defined(__FreeBSD__) || defined(__OpenBSD__) || defined(__NetBSD__)
+#define HAVE_PIPE2
+#else
+// Neither MacOS nor AIX support pipe2, unfortunately
+#undef HAVE_PIPE2
 #endif
+
+#endif /* CHILDPROC_MD_H */
diff --git a/test/jdk/java/lang/ProcessBuilder/Basic.java b/test/jdk/java/lang/ProcessBuilder/Basic.java
index dd97de8fad8..401a1e2bd8a 100644
--- a/test/jdk/java/lang/ProcessBuilder/Basic.java
+++ b/test/jdk/java/lang/ProcessBuilder/Basic.java
@@ -22,32 +22,43 @@
  */
 
 /*
- * @test
+ * @test id=POSIX_SPAWN
  * @bug 4199068 4738465 4937983 4930681 4926230 4931433 4932663 4986689
  *      5026830 5023243 5070673 4052517 4811767 6192449 6397034 6413313
  *      6464154 6523983 6206031 4960438 6631352 6631966 6850957 6850958
  *      4947220 7018606 7034570 4244896 5049299 8003488 8054494 8058464
  *      8067796 8224905 8263729 8265173 8272600 8231297 8282219 8285517
- *      8352533 8368192
+ *      8352533 8368192 8377907
  * @key intermittent
  * @summary Basic tests for Process and Environment Variable code
  * @modules java.base/java.lang:open
  *          java.base/java.io:open
  * @requires vm.flagless
  * @library /test/lib
- * @run main/othervm/native/timeout=360 Basic
- * @run main/othervm/native/timeout=360 -Djdk.lang.Process.launchMechanism=fork Basic
+ * @run main/othervm/native/timeout=360 -Djdk.lang.Process.launchMechanism=posix_spawn Basic
  * @author Martin Buchholz
  */
 
 /*
- * @test
+ * @test id=FORK
+ * @key intermittent
+ * @summary Basic tests for Process and Environment Variable code
+ * @modules java.base/java.lang:open
+ *          java.base/java.io:open
+ * @requires !vm.musl
+ * @requires vm.flagless
+ * @library /test/lib
+ * @run main/othervm/native/timeout=360 -Djdk.lang.Process.launchMechanism=fork Basic
+ */
+
+/*
+ * @test id=VFORK
  * @modules java.base/java.lang:open
  *          java.base/java.io:open
  *          java.base/jdk.internal.misc
  * @requires (os.family == "linux")
  * @library /test/lib
- * @run main/othervm/timeout=300 -Djdk.lang.Process.launchMechanism=posix_spawn Basic
+ * @run main/othervm/timeout=300 -Djdk.lang.Process.launchMechanism=vfork Basic
  */
 
 import java.lang.ProcessBuilder.Redirect;
@@ -1229,6 +1240,20 @@ public class Basic {
             equal(r.out(), "standard output");
             equal(r.err(), "standard error");
         }
+
+        //----------------------------------------------------------------
+        // Default: should go to pipes (use a fresh ProcessBuilder)
+        //----------------------------------------------------------------
+        {
+            ProcessBuilder pb2 = new ProcessBuilder(childArgs);
+            Process p = pb2.start();
+            new PrintStream(p.getOutputStream()).print("standard input");
+            p.getOutputStream().close();
+            ProcessResults r = run(p);
+            equal(r.exitValue(), 0);
+            equal(r.out, "standard output");
+            equal(r.err, "standard error");
+        }
     }
 
     static void checkProcessPid() {
@@ -1267,6 +1292,8 @@ public class Basic {
         if (UnicodeOS.is())
             System.out.println("This appears to be a Unicode-based OS.");
 
+        System.out.println("Using:" + System.getProperty("jdk.lang.Process.launchMechanism"));
+
         try { testIORedirection(); }
         catch (Throwable t) { unexpected(t); }
 
diff --git a/test/jdk/java/lang/ProcessBuilder/ConcNativeForkTest/ConcNativeForkTest.java b/test/jdk/java/lang/ProcessBuilder/ConcNativeForkTest/ConcNativeForkTest.java
new file mode 100644
index 00000000000..f02e4991302
--- /dev/null
+++ b/test/jdk/java/lang/ProcessBuilder/ConcNativeForkTest/ConcNativeForkTest.java
@@ -0,0 +1,129 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2026, IBM Corp.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+/*
+ * @test id=POSIX_SPAWN
+ * @bug 8377907
+ * @summary Test that demonstrates the hanging-parent-on-native-concurrent-forks problem
+ * @requires os.family != "windows"
+ * @requires vm.flagless
+ * @library /test/lib
+ * @run main/othervm/manual -Djdk.lang.Process.launchMechanism=POSIX_SPAWN ConcNativeForkTest
+ */
+
+/*
+ * @test id=FORK
+ * @bug 8377907
+ * @summary Test that demonstrates the hanging-parent-on-native-concurrent-forks problem
+ * @requires os.family != "windows"
+ * @requires vm.flagless
+ * @library /test/lib
+ * @run main/othervm/manual -Djdk.lang.Process.launchMechanism=FORK ConcNativeForkTest
+ */
+
+/*
+ * @test id=VFORK
+ * @bug 8377907
+ * @summary Test that demonstrates the hanging-parent-on-native-concurrent-forks problem
+ * @requires os.family == "linux"
+ * @requires vm.flagless
+ * @library /test/lib
+ * @run main/othervm/manual -Djdk.lang.Process.launchMechanism=VFORK ConcNativeForkTest
+ */
+
+public class ConcNativeForkTest {
+
+    // How this works:
+    // - We start a child process via ProcessBuilder. Does not matter what, we just call "/bin/true".
+    // - Concurrently, we continuously (up to a limit) fork natively; these forks will all exec "sleep 30".
+    // - If the natively forked child process forks off at the right (wrong) moment, it will catch the open pipe from
+    //   the "/bin/true" child process, and forcing the parent process (this test) to wait in ProcessBuilder.start()
+    //   (inside forkAndExec()) until the natively forked child releases the pipe file descriptors it inherited.
+
+    // Notes:
+    //
+    // Obviously, this is racy and depends on scheduler timings of the underlying OS. The test succeeding is
+    // no proof the bug does not exist (see PipesCloseOnExecTest as a complimentary test that is more reliable, but
+    // only works on Linux).
+    // That said, in tests it reliably reproduces the bug on Linux x64 and MacOS Arm.
+    //
+    // This test is not well suited for automatic test execution, since the test essentially
+    // fork-bombs itself, and that may run into issues in containerized CI/CD environments.
+
+    native static boolean prepareNativeForkerThread(int numForks);
+    native static void releaseNativeForkerThread();
+    native static void stopNativeForkerThread();
+
+    private static final int numIterations = 20;
+
+    public static void main(String[] args) throws Exception {
+
+        System.out.println("jdk.lang.Process.launchMechanism=" +
+                System.getProperty("jdk.lang.Process.launchMechanism"));
+
+        System.loadLibrary("ConcNativeFork");
+
+        // A very simple program returning immediately (/bin/true)
+        ProcessBuilder pb = new ProcessBuilder("true").inheritIO();
+        final int numJavaProcesses = 10;
+        final int numNativeProcesses = 250;
+        Process[] processes = new Process[numJavaProcesses];
+
+        for (int iteration = 0; iteration < numIterations; iteration ++) {
+
+            if (!prepareNativeForkerThread(numNativeProcesses)) {
+                throw new RuntimeException("Failed to start native forker thread (see stdout)");
+            }
+
+            long[] durations = new long[numJavaProcesses];
+
+            releaseNativeForkerThread();
+
+            for (int np = 0; np < numJavaProcesses; np ++) {
+                long t1 = System.currentTimeMillis();
+                try (Process p = pb.start()) {
+                    durations[np] = System.currentTimeMillis() - t1;
+                    processes[np] = p;
+                }
+            }
+
+            stopNativeForkerThread();
+
+            long longestDuration = 0;
+            for (int np = 0; np < numJavaProcesses; np ++) {
+                processes[np].waitFor();
+                System.out.printf("Duration: %dms%n", durations[np]);
+                longestDuration = Math.max(durations[np], longestDuration);
+            }
+
+            System.out.printf("Longest startup time: %dms%n", longestDuration);
+
+            if (longestDuration >= 30000) {
+                throw new RuntimeException("Looks like we blocked on native fork");
+            }
+        }
+
+    }
+
+}
diff --git a/test/jdk/java/lang/ProcessBuilder/ConcNativeForkTest/libConcNativeFork.c b/test/jdk/java/lang/ProcessBuilder/ConcNativeForkTest/libConcNativeFork.c
new file mode 100644
index 00000000000..59729308558
--- /dev/null
+++ b/test/jdk/java/lang/ProcessBuilder/ConcNativeForkTest/libConcNativeFork.c
@@ -0,0 +1,147 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2026, IBM Corp.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+#include <assert.h>
+#include <errno.h>
+#include <pthread.h>
+#include <sched.h>
+#include <signal.h>
+#include <stdbool.h>
+#include <stdatomic.h>
+#include <stdlib.h>
+#include <stdio.h>
+#include <sys/stat.h>
+#include <sys/wait.h>
+#include <unistd.h>
+#include <jni.h>
+#include "testlib_thread_barriers.h"
+
+static void trc(const char* fmt, ...) {
+    char buf [1024];
+    va_list ap;
+    va_start(ap, fmt);
+    vsnprintf(buf, sizeof(buf), fmt, ap);
+    va_end(ap);
+    printf("(pid: %d): %s\n", (int)getpid(), buf);
+    fflush(stdout);
+}
+
+static pthread_t tid_forker;
+
+static pthread_barrier_t start_barrier;
+static atomic_bool stop_now = false;
+
+static void* forkerLoop(void* info) {
+
+    const int numForks = (int)(intptr_t)info;
+    pid_t* pids = calloc(numForks, sizeof(pid_t));
+
+    trc("Forker: Waiting for Go.");
+
+    pthread_barrier_wait(&start_barrier);
+
+    for (int i = 0; i < numForks; i++) {
+        const pid_t pid = fork();
+        if (pid == 0) {
+            /* Exec sleep. Properly opened file descriptors in parents (tagged CLOEXEC) should be released now.
+             * Note that we use bash to not have to deal with path resolution. For our case, it does not matter if
+             * sleep is a builtin or not. */
+            char* env[] = { "PATH=/usr/bin:/bin", NULL };
+            char* argv[] = { "sh", "-c", "sleep 30", NULL };
+            execve("/bin/sh", argv, env);
+            trc("Native child: sleep exec failed? %d", errno);
+            /* The simplest way to handle this is to just wait here; this *will* cause the test to fail. */
+            sleep(120);
+            trc("Native child: exiting");
+            exit(0);
+        } else {
+            pids[i] = pid;
+            sched_yield();
+        }
+    }
+
+    trc("Forker: All native child processes started.");
+
+    /* Wait for test to signal end */
+    while (!atomic_load(&stop_now)) {
+        sleep(1);
+    }
+
+    trc("Forker: Cleaning up.");
+
+    /* Reap children */
+    for (int i = 0; i < numForks; i ++) {
+        if (pids[i] != 0) {
+            kill(pids[i], SIGKILL); /* if still running */
+            waitpid(pids[i], NULL, 0);
+        }
+    }
+
+    trc("Forker: Done.");
+
+    return NULL;
+}
+
+JNIEXPORT jboolean JNICALL
+Java_ConcNativeForkTest_prepareNativeForkerThread(JNIEnv* env, jclass cls, jint numForks)
+{
+    pthread_attr_t attr;
+    int rc = 0;
+
+    const int cap = 1000;
+    const int numForksCapped = numForks > cap ? cap : numForks;
+    if (numForks > numForksCapped) {
+        trc("Main: Capping max. number of forks at %d", numForksCapped); /* don't forkbomb me */
+    }
+
+    if (pthread_barrier_init(&start_barrier, NULL, 2) != 0) {
+        trc("Main: pthread_barrier_init failed (%d)", errno);
+        return false;
+    }
+
+    pthread_attr_init(&attr);
+    if (pthread_create(&tid_forker, &attr, forkerLoop, (void*)(intptr_t)numForksCapped) != 0) {
+        trc("Main: pthread_create failed (%d)", errno);
+        return JNI_FALSE;
+    }
+
+    trc("Main: Prepared native forker thread");
+
+    return JNI_TRUE;
+}
+
+JNIEXPORT void JNICALL
+Java_ConcNativeForkTest_releaseNativeForkerThread(JNIEnv* env, jclass cls)
+{
+    pthread_barrier_wait(&start_barrier);
+    trc("Main: signaled GO");
+}
+
+JNIEXPORT void JNICALL
+Java_ConcNativeForkTest_stopNativeForkerThread(JNIEnv* env, jclass cls)
+{
+    atomic_store(&stop_now, true);
+    pthread_join(tid_forker, NULL);
+    pthread_barrier_destroy(&start_barrier);
+}
diff --git a/test/jdk/java/lang/ProcessBuilder/FDLeakTest/FDLeakTest.java b/test/jdk/java/lang/ProcessBuilder/FDLeakTest/FDLeakTest.java
index 146c2be563f..aee85e2335f 100644
--- a/test/jdk/java/lang/ProcessBuilder/FDLeakTest/FDLeakTest.java
+++ b/test/jdk/java/lang/ProcessBuilder/FDLeakTest/FDLeakTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2025, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -24,7 +24,7 @@
 
 /**
  * @test id=posix_spawn
- * @summary Check that we don't leak FDs
+ * @summary Check that we don't leak FDs to child processes
  * @requires os.family != "windows"
  * @library /test/lib
  * @run main/othervm/native -Djdk.lang.Process.launchMechanism=posix_spawn -agentlib:FDLeaker FDLeakTest
@@ -32,7 +32,7 @@
 
 /**
  * @test id=fork
- * @summary Check that we don't leak FDs
+ * @summary Check that we don't leak FDs to child processes
  * @requires os.family != "windows"
  * @library /test/lib
  * @run main/othervm/native -Djdk.lang.Process.launchMechanism=fork -agentlib:FDLeaker FDLeakTest
@@ -40,7 +40,7 @@
 
 /**
  * @test id=vfork
- * @summary Check that we don't leak FDs
+ * @summary Check that we don't leak FDs to child processes
  * @requires os.family == "linux"
  * @library /test/lib
  * @run main/othervm/native -Djdk.lang.Process.launchMechanism=vfork -agentlib:FDLeaker FDLeakTest
diff --git a/test/jdk/java/lang/ProcessBuilder/JspawnhelperProtocol.java b/test/jdk/java/lang/ProcessBuilder/JspawnhelperProtocol.java
index 0098bc531fd..59ce9450cb9 100644
--- a/test/jdk/java/lang/ProcessBuilder/JspawnhelperProtocol.java
+++ b/test/jdk/java/lang/ProcessBuilder/JspawnhelperProtocol.java
@@ -39,6 +39,7 @@ import java.util.Optional;
 import java.util.concurrent.TimeUnit;
 import java.util.concurrent.TimeoutException;
 
+import jdk.test.lib.process.OutputAnalyzer;
 import jdk.test.lib.process.ProcessTools;
 
 public class JspawnhelperProtocol {
@@ -55,7 +56,9 @@ public class JspawnhelperProtocol {
         System.out.println("Recursively executing 'JspawnhelperProtocol " + arg + "'");
         Process p = null;
         try {
-            p = Runtime.getRuntime().exec(CMD);
+            // Route any stdout from the child process - be it jspawnhelper error messages or the output of "/bin/pwd" -
+            // through to the parent process.
+            p = new ProcessBuilder(CMD).inheritIO().start();
         } catch (Exception e) {
             // Check that exception contains rich message on failure.
             e.printStackTrace(System.out);
@@ -70,12 +73,6 @@ public class JspawnhelperProtocol {
             System.exit(ERROR + 1);
         }
         if (p.exitValue() == 0) {
-            String pwd = p.inputReader().readLine();
-            String realPwd = Path.of("").toAbsolutePath().toString();
-            if (!realPwd.equals(pwd)) {
-                System.out.println("Child process returned '" + pwd + "' (expected '" + realPwd + "')");
-                System.exit(ERROR + 2);
-            }
             System.out.println("  Successfully executed '" + CMD[0] + "'");
             System.exit(0);
         } else {
@@ -89,7 +86,6 @@ public class JspawnhelperProtocol {
         pb = ProcessTools.createLimitedTestJavaProcessBuilder("-Djdk.lang.Process.launchMechanism=posix_spawn",
                                                               "JspawnhelperProtocol",
                                                               "normalExec");
-        pb.inheritIO();
         Process p = pb.start();
         if (!p.waitFor(TIMEOUT, TimeUnit.SECONDS)) {
             throw new Exception("Parent process timed out");
@@ -97,6 +93,10 @@ public class JspawnhelperProtocol {
         if (p.exitValue() != 0) {
             throw new Exception("Parent process exited with " + p.exitValue());
         }
+        OutputAnalyzer output = new OutputAnalyzer(p);
+        output.shouldContain("Recursively executing 'JspawnhelperProtocol normalExec'");
+        String realPwd = Path.of("").toAbsolutePath().toString();
+        output.shouldContain(realPwd);
     }
 
     private static void simulateCrashInChild(int stage) throws Exception {
@@ -144,7 +144,7 @@ public class JspawnhelperProtocol {
         try (BufferedReader br = p.inputReader()) {
             line = br.readLine();
             while (line != null && !line.startsWith("posix_spawn:")) {
-                System.out.println(line);
+                System.out.println("parent stdout:" + line);
                 line = br.readLine();
             }
         }
diff --git a/test/jdk/java/lang/ProcessBuilder/JspawnhelperWarnings.java b/test/jdk/java/lang/ProcessBuilder/JspawnhelperWarnings.java
index cb2d504951d..fec0b4f3efd 100644
--- a/test/jdk/java/lang/ProcessBuilder/JspawnhelperWarnings.java
+++ b/test/jdk/java/lang/ProcessBuilder/JspawnhelperWarnings.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2024, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -61,7 +61,7 @@ public class JspawnhelperWarnings {
         oa.shouldHaveExitValue(EXITCODE_OFFSET + ESTEP_JSPAWN_ARG_ERROR);
         oa.shouldContain("jspawnhelper fail: (1-0-0)");
         oa.shouldContain("This command is not for general use");
-        if (nArgs != 2) {
+        if (nArgs != 1) {
             oa.shouldContain("Incorrect number of arguments");
         } else {
             oa.shouldContain("Incorrect Java version");
@@ -69,10 +69,9 @@ public class JspawnhelperWarnings {
     }
 
     private static void testVersion() throws Exception {
-        String[] args = new String[3];
+        String[] args = new String[2];
         args[0] = Paths.get(System.getProperty("java.home"), "lib", "jspawnhelper").toString();
         args[1] = "wrongVersion";
-        args[2] = "1:1:1";
         Process p = ProcessTools.startProcess("jspawnhelper", new ProcessBuilder(args));
         OutputAnalyzer oa = new OutputAnalyzer(p);
         oa.shouldHaveExitValue(EXITCODE_OFFSET + ESTEP_JSPAWN_VERSION_ERROR);
@@ -88,7 +87,7 @@ public class JspawnhelperWarnings {
         switch (args[0]) {
             case "badargs" -> {
                 for (int nArgs = 0; nArgs < 10; nArgs++) {
-                    if (nArgs != 2) {
+                    if (nArgs != 1) {
                         tryWithNArgs(nArgs);
                     }
                 }
diff --git a/test/jdk/java/lang/ProcessBuilder/NonPipelineLeaksFD.java b/test/jdk/java/lang/ProcessBuilder/NonPipelineLeaksFD.java
new file mode 100644
index 00000000000..be2c4af3bbe
--- /dev/null
+++ b/test/jdk/java/lang/ProcessBuilder/NonPipelineLeaksFD.java
@@ -0,0 +1,182 @@
+/*
+ * Copyright (c) 2022, 2026, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2026, IBM Corp.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+import java.io.*;
+
+/*
+ * @test id=FORK
+ * @summary Check that we don't accumulate leaked FDs in the parent process
+ * @requires os.family == "linux"
+ * @library /test/lib
+ * @run main/othervm -Djdk.lang.Process.launchMechanism=fork NonPipelineLeaksFD
+ */
+
+/*
+ * @test id=VFORK
+ * @summary Check that we don't accumulate leaked FDs in the parent process
+ * @requires os.family == "linux"
+ * @library /test/lib
+ * @run main/othervm -Djdk.lang.Process.launchMechanism=vfork NonPipelineLeaksFD
+ */
+
+/*
+ * @test id=POSIX_SPAWN
+ * @summary Check that we don't accumulate leaked FDs in the parent process
+ * @requires os.family == "linux"
+ * @library /test/lib
+ * @run main/othervm -Djdk.lang.Process.launchMechanism=posix_spawn NonPipelineLeaksFD
+ */
+
+public class NonPipelineLeaksFD {
+
+    final static int repeatCount = 50;
+
+    // Similar to PilelineLeaksFD, but where PilelineLeaksFD checks that the parent process
+    // does not leak file descriptors when invoking a pipeline, here we check that we don't
+    // leak FDs when executing simple (non-pipelined) programs but we test a wider span of
+    // redirection modes in both successful and failing variants.
+
+    // How this works:
+    //
+    // We execute a mix of failing and succeeding child process starts with various
+    // flavors of IO redirections many times; we observe the open file descriptors
+    // before and afterwards. Test fails if we have significantly more file descriptors
+    // open afterwards than before.
+
+    static int countNumberOfOpenFileDescriptors() {
+        return new File("/proc/self/fd").list().length;
+    }
+
+    static void printOpenFileDescriptors() {
+        long mypid =  ProcessHandle.current().pid();
+        try(Process p = new ProcessBuilder("lsof", "-p", Long.toString(mypid))
+                .inheritIO().start()) {
+            p.waitFor();
+        } catch (InterruptedException | IOException ignored) {
+            // Quietly swallow; it was just an attempt.
+        }
+    }
+
+    static String readFirstLineOf(File f) {
+        String result;
+        try (BufferedReader b = new BufferedReader(new FileReader(f))){
+            result = b.readLine();
+        } catch (IOException e) {
+            throw new RuntimeException(e);
+        }
+        return result;
+    }
+
+    static void runThisExpectSuccess(ProcessBuilder bld) {
+        try(Process p = bld.start()) {
+            p.waitFor();
+            if (p.exitValue() != 0) {
+                throw new RuntimeException("Unexpected exitcode");
+            }
+        } catch (IOException | InterruptedException e) {
+            throw new RuntimeException(e);
+        }
+    }
+
+    static void runThisExpectError(ProcessBuilder bld) {
+        boolean failed = false;
+        try(Process p = bld.start()) {
+            p.waitFor();
+        } catch (IOException | InterruptedException e) {
+            failed = true;
+        }
+        if (!failed) {
+            throw new RuntimeException("Expected Error");
+        }
+    }
+
+    static void runPosWithPipes() {
+        ProcessBuilder bld = new ProcessBuilder("sh", "-c", "echo hallo");
+        runThisExpectSuccess(bld);
+    }
+
+    static void runPosWithInheritIO() {
+        ProcessBuilder bld = new ProcessBuilder("sh", "-c", "echo hallo").inheritIO();
+        runThisExpectSuccess(bld);
+    }
+
+    static void runPosWithRedirectToFile() {
+        File fo = new File("test.out");
+        ProcessBuilder bld = new ProcessBuilder("sh", "-c", "echo hallo");
+        bld.redirectOutput(ProcessBuilder.Redirect.to(fo));
+        runThisExpectSuccess(bld);
+        if (!readFirstLineOf(fo).equals("hallo")) {
+            throw new RuntimeException("mismatch");
+        }
+    }
+
+    static void runNegWithPipes() {
+        ProcessBuilder bld = new ProcessBuilder("doesnotexist");
+        runThisExpectError(bld);
+    }
+
+    static void runNegWithInheritIO() {
+        ProcessBuilder bld = new ProcessBuilder("doesnotexist").inheritIO();
+        runThisExpectError(bld);
+    }
+
+    static void runNegWithRedirectToFile() {
+        File fo = new File("test.out");
+        ProcessBuilder bld = new ProcessBuilder("doesnotexist");
+        bld.redirectOutput(ProcessBuilder.Redirect.to(fo));
+        runThisExpectError(bld);
+    }
+
+    static void doTestNTimesAndCountFDs(Runnable runnable, String name) {
+        System.out.println(name);
+        int c1 = countNumberOfOpenFileDescriptors();
+        for (int i = 0; i < repeatCount; i++) {
+            runnable.run();
+        }
+        int c2 = countNumberOfOpenFileDescriptors();
+        System.out.printf("%d->%d", c1, c2);
+    }
+
+    public static void main(String[] args) throws Exception {
+        System.out.println("jdk.lang.Process.launchMechanism=" +
+                System.getProperty("jdk.lang.Process.launchMechanism"));
+        int c1 = countNumberOfOpenFileDescriptors();
+        doTestNTimesAndCountFDs(NonPipelineLeaksFD::runPosWithPipes, "runPosWithPipes");
+        doTestNTimesAndCountFDs(NonPipelineLeaksFD::runPosWithInheritIO, "runPosWithInheritIO");
+        doTestNTimesAndCountFDs(NonPipelineLeaksFD::runPosWithRedirectToFile, "runPosWithRedirectToFile");
+        doTestNTimesAndCountFDs(NonPipelineLeaksFD::runNegWithPipes, "runNegWithPipes");
+        doTestNTimesAndCountFDs(NonPipelineLeaksFD::runNegWithInheritIO, "runNegWithInheritIO");
+        doTestNTimesAndCountFDs(NonPipelineLeaksFD::runNegWithRedirectToFile, "runNegWithRedirectToFile");
+        int c2 = countNumberOfOpenFileDescriptors();
+
+        System.out.printf("All tests: %d->%d", c1, c2);
+        printOpenFileDescriptors();
+
+        final int fudge = 10;
+        if (c2 > (c1 + fudge)) {
+            throw new RuntimeException(
+                    String.format("Leak suspected (%d->%d) - see lsof output", c1, c2));
+        }
+    }
+}
diff --git a/test/jdk/java/lang/ProcessBuilder/PipelineLeaksFD.java b/test/jdk/java/lang/ProcessBuilder/PipelineLeaksFD.java
index 92cca736503..18dde6e95d7 100644
--- a/test/jdk/java/lang/ProcessBuilder/PipelineLeaksFD.java
+++ b/test/jdk/java/lang/ProcessBuilder/PipelineLeaksFD.java
@@ -46,12 +46,21 @@ import java.util.StringJoiner;
 import java.util.stream.Collectors;
 
 /*
- * @test
+ * @test id=FORK
  * @bug 8289643 8291760 8291986
  * @requires os.family == "mac" | (os.family == "linux" & !vm.musl)
  * @summary File descriptor leak detection with ProcessBuilder.startPipeline
  * @library /test/lib
- * @run junit/othervm/timeout=240 PipelineLeaksFD
+ * @run junit/othervm/timeout=240 -Djdk.lang.Process.launchMechanism=FORK PipelineLeaksFD
+ */
+
+/*
+ * @test id=POSIX_SPAWN
+ * @bug 8289643 8291760 8291986
+ * @requires os.family == "mac" | (os.family == "linux" & !vm.musl)
+ * @summary File descriptor leak detection with ProcessBuilder.startPipeline
+ * @library /test/lib
+ * @run junit/othervm/timeout=240 -Djdk.lang.Process.launchMechanism=POSIX_SPAWN PipelineLeaksFD
  */
 
 public class PipelineLeaksFD {
@@ -97,6 +106,8 @@ public class PipelineLeaksFD {
     @MethodSource("builders")
     void checkForLeaks(List<ProcessBuilder> builders) throws IOException {
 
+        System.out.println("Using:" + System.getProperty("jdk.lang.Process.launchMechanism"));
+
         List<String> lsofLines = lsofForPids(MY_PID);
         Set<PipeRecord> pipesBefore = pipesFromLSOF(lsofLines, MY_PID);
         if (pipesBefore.size() < 3) {
@@ -162,6 +173,9 @@ public class PipelineLeaksFD {
     @ParameterizedTest()
     @MethodSource("redirectCases")
     void checkRedirectErrorStream(boolean redirectError) {
+
+        System.out.println("Using:" + System.getProperty("jdk.lang.Process.launchMechanism"));
+
         try (Process p = new ProcessBuilder("cat")
                 .redirectErrorStream(redirectError)
                 .start()) {
diff --git a/test/jdk/java/lang/ProcessBuilder/PipesCloseOnExecTest/PipesCloseOnExecTest.java b/test/jdk/java/lang/ProcessBuilder/PipesCloseOnExecTest/PipesCloseOnExecTest.java
new file mode 100644
index 00000000000..1e988f0496c
--- /dev/null
+++ b/test/jdk/java/lang/ProcessBuilder/PipesCloseOnExecTest/PipesCloseOnExecTest.java
@@ -0,0 +1,115 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2026, IBM Corp.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+/*
+ * @test id=FORK
+ * @bug 8377907
+ * @summary Check that we don't open pipes without CLOEXCEC
+ * @requires os.family == "linux"
+ * @requires vm.flagless
+ * @library /test/lib
+ * @run main/othervm/native -Djdk.lang.Process.launchMechanism=FORK PipesCloseOnExecTest
+ */
+
+/*
+ * @test id=VFORK
+ * @bug 8377907
+ * @summary Check that we don't open pipes without CLOEXCEC
+ * @requires os.family == "linux"
+ * @requires vm.flagless
+ * @library /test/lib
+ * @run main/othervm/native -Djdk.lang.Process.launchMechanism=VFORK PipesCloseOnExecTest
+ */
+
+/*
+ * @test id=POSIX_SPAWN
+ * @bug 8377907
+ * @summary Check that we don't open pipes without CLOEXCEC
+ * @requires os.family == "linux"
+ * @requires vm.flagless
+ * @library /test/lib
+ * @run main/othervm/native -Djdk.lang.Process.launchMechanism=POSIX_SPAWN PipesCloseOnExecTest
+ */
+
+import jdk.test.lib.process.OutputAnalyzer;
+
+import java.io.IOException;
+import java.time.LocalTime;
+
+public class PipesCloseOnExecTest {
+
+    // How this works:
+    // - We start a child process A. Does not matter what, we just call "/bin/date".
+    // - Concurrently, we (natively, continuously) iterate all pipe file descriptors in
+    //   the process and count all those that are not tagged with CLOEXEC. Finding one
+    //   counts as error.
+
+    // Note that this test can only reliably succeed with Linux and the xxxBSDs, where
+    // we have pipe2(2).
+    //
+    // On MacOs and AIX, we emulate pipe2(2) with pipe(2) and fcntl(2); therefore we
+    // have a tiny time window in which a concurrent thread can can observe pipe
+    // filedescriptors without CLOEXEC. Furthermore, on MacOS, we also have to employ
+    // the double-dup-trick to workaround a the buggy MacOS implementation of posix_spawn.
+    // Therefore, on these platforms, the test would (correctly) spot "bad" file descriptors.
+
+    native static boolean startTester();
+    native static boolean stopTester();
+
+    static final int num_tries = 100;
+
+    static void printOpenFileDescriptors() {
+        long mypid =  ProcessHandle.current().pid();
+        try(Process p = new ProcessBuilder("lsof", "-p", Long.toString(mypid))
+                .inheritIO().start()) {
+            p.waitFor();
+        } catch (InterruptedException | IOException ignored) {
+            // Quietly swallow; it was just an attempt.
+        }
+    }
+
+    public static void main(String[] args) throws Exception {
+
+        System.out.println("jdk.lang.Process.launchMechanism=" +
+                           System.getProperty("jdk.lang.Process.launchMechanism"));
+
+        System.loadLibrary("PipesCloseOnExec");
+
+        if (!startTester()) {
+            throw new RuntimeException("Failed to start testers (see stdout)");
+        }
+
+        System.out.println(LocalTime.now() + ": Call ProcessBuilder.start...");
+
+        for (int i = 0; i < num_tries; i ++) {
+            ProcessBuilder pb = new ProcessBuilder("true").inheritIO();
+            new OutputAnalyzer(pb.start()).shouldHaveExitValue(0);
+        }
+
+        if (!stopTester()) {
+            printOpenFileDescriptors();
+            throw new RuntimeException("Catched FDs without CLOEXEC? Check output.");
+        }
+    }
+}
diff --git a/test/jdk/java/lang/ProcessBuilder/PipesCloseOnExecTest/libPipesCloseOnExec.c b/test/jdk/java/lang/ProcessBuilder/PipesCloseOnExecTest/libPipesCloseOnExec.c
new file mode 100644
index 00000000000..9a090f3bbd5
--- /dev/null
+++ b/test/jdk/java/lang/ProcessBuilder/PipesCloseOnExecTest/libPipesCloseOnExec.c
@@ -0,0 +1,198 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2026, IBM Corp.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+#include <assert.h>
+#include <errno.h>
+#include <fcntl.h>
+#include <pthread.h>
+#include <stdbool.h>
+#include <stdatomic.h>
+#include <stdlib.h>
+#include <stdio.h>
+#include <string.h>
+#include <sys/stat.h>
+#include <unistd.h>
+#include <jni.h>
+#include "testlib_thread_barriers.h"
+
+static void trc(const char* fmt, ...) {
+    char buf [1024];
+    va_list ap;
+    va_start(ap, fmt);
+    vsnprintf(buf, sizeof(buf), fmt, ap);
+    va_end(ap);
+    printf("%s\n", buf);
+    fflush(stdout);
+}
+
+/* Set 1 to restrict this test to pipes, 0 to test all file descriptors.
+ * (for now, we ignore regular files opened with CLOEXEC since loaded jars seem not tagged as CLOEXEc.
+ * We should probably fix that eventually. */
+#define TEST_PIPES_ONLY 1
+
+/* stdin/out/err file descriptors are usually not CLOEXEC */
+#define IGNORE_BELOW 4
+
+/* Only query file descriptors up to this point */
+#define MAX_FD 1024
+
+static pthread_t tid_tester;
+
+static pthread_barrier_t start_barrier;
+static atomic_bool stop_now = false;
+
+/* Mainly to prevent tracing the same fd over and over again:
+ *   1 - present, 2 - present, cloexec */
+static unsigned fd_state[MAX_FD];
+
+static bool is_pipe(int fd) {
+    struct stat mystat;
+    if (fstat(fd, &mystat) == -1) {
+        return false;
+    }
+    return mystat.st_mode & S_IFIFO;
+}
+
+static void print_fd_details(int fd, char* out, size_t outlen) {
+    const char* type = "unknown";
+    char link[1024] = { 0 };
+    char procfd[129];
+    struct stat mystat;
+
+    out[0] = '\0';
+
+    if (fstat(fd, &mystat) == -1) {
+        snprintf(out, outlen, "%s", errno == EBADF ? "EBADF" : "???");
+        return;
+    }
+
+    switch (mystat.st_mode & S_IFMT) {
+        case S_IFBLK:  type = "blk"; break;
+        case S_IFCHR:  type = "char"; break;
+        case S_IFDIR:  type = "dir"; break;
+        case S_IFIFO:  type = "fifo"; break;
+        case S_IFLNK:  type = "lnk"; break;
+        case S_IFREG:  type = "reg"; break;
+        case S_IFSOCK: type = "sock"; break;
+    }
+
+    snprintf(procfd, sizeof(procfd) - 1, "/proc/self/fd/%d", fd);
+    int linklen = readlink(procfd, link, sizeof(link) - 1);
+    if (linklen > 0) {
+        link[linklen] = '\0';
+        snprintf(out, outlen, "%s (%s)", type, link);
+    } else {
+        snprintf(out, outlen, "%s", type);
+    }
+}
+
+/* Returns true for error */
+static bool testFD(int fd) {
+
+    int rc = fcntl(fd, F_GETFD);
+    if (rc == -1) {
+        return false;
+    }
+
+    const bool has_cloexec = (rc & FD_CLOEXEC);
+    const bool is_a_pipe = is_pipe(fd);
+    const unsigned state = has_cloexec ? 2 : 1;
+    bool had_error = false;
+
+    if (fd_state[fd] != state) {
+        fd_state[fd] = state;
+        char buf[1024];
+        print_fd_details(fd, buf, sizeof(buf));
+        if (has_cloexec) {
+            trc("%d: %s", fd, buf);
+        } else {
+            if (fd < IGNORE_BELOW) {
+                trc("%d: %s ** CLOEXEC MISSING ** (ignored - below scanned range)", fd, buf);
+            } else if (TEST_PIPES_ONLY && !is_a_pipe) {
+                trc("%d: %s ** CLOEXEC MISSING ** (ignored - not a pipe)", fd, buf);
+            } else {
+                trc("%d: %s ** CLOEXEC MISSING ** (ERROR)", fd, buf);
+                had_error = true;
+            }
+        }
+    }
+
+    return had_error;
+}
+
+static void* testerLoop(void* dummy) {
+
+    pthread_barrier_wait(&start_barrier);
+
+    trc("Tester is alive");
+
+    bool had_error = false;
+
+    while (!atomic_load(&stop_now)) {
+        for (int fd = 0; fd < MAX_FD; fd++) {
+            bool rc = testFD(fd);
+            had_error = had_error || rc;
+        }
+    }
+
+    trc("Tester dies");
+
+    return had_error ? (void*)1 : NULL;
+}
+
+JNIEXPORT jboolean JNICALL
+Java_PipesCloseOnExecTest_startTester(JNIEnv* env, jclass cls)
+{
+    pthread_attr_t attr;
+    int rc = 0;
+
+    if (pthread_barrier_init(&start_barrier, NULL, 2) != 0) {
+        trc("pthread_barrier_init failed (%d)", errno);
+        return false;
+    }
+
+    pthread_attr_init(&attr);
+    if (pthread_create(&tid_tester, &attr, testerLoop, NULL) != 0) {
+        trc("pthread_create failed (%d)", errno);
+        return JNI_FALSE;
+    }
+
+    pthread_barrier_wait(&start_barrier);
+
+    trc("Started tester");
+
+    return JNI_TRUE;
+}
+
+JNIEXPORT jboolean JNICALL
+Java_PipesCloseOnExecTest_stopTester(JNIEnv* env, jclass cls)
+{
+    atomic_store(&stop_now, true);
+
+    void* retval = NULL;
+    pthread_join(tid_tester, &retval);
+    pthread_barrier_destroy(&start_barrier);
+
+    return retval == NULL ? JNI_TRUE : JNI_FALSE;
+}
diff --git a/test/lib/native/testlib_thread_barriers.h b/test/lib/native/testlib_thread_barriers.h
new file mode 100644
index 00000000000..8e0b717b57a
--- /dev/null
+++ b/test/lib/native/testlib_thread_barriers.h
@@ -0,0 +1,83 @@
+/*
+ * Copyright (c) 2022, 2026, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2026, IBM Corp.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+#ifndef TESTLIB_THREAD_BARRIERS_H
+#define TESTLIB_THREAD_BARRIERS_H
+
+/* MacOS does not have pthread barriers; implement a fallback using condvars. */
+
+#ifndef _WIN32
+#if !defined _POSIX_BARRIERS || _POSIX_BARRIERS < 0
+
+#include <pthread.h>
+
+#define PTHREAD_BARRIER_SERIAL_THREAD       1
+
+#define pthread_barrier_t                       barr_t
+#define pthread_barrier_init(barr, attr, need)  barr_init(barr, attr, need)
+#define pthread_barrier_destroy(barr)           barr_destroy(barr)
+#define pthread_barrier_wait(barr)              barr_wait(barr)
+
+typedef struct {
+    pthread_mutex_t mutex;
+    pthread_cond_t cond;
+    int have, need, trigger_count;
+} barr_t;
+
+int barr_init(barr_t* b, void* ignored, int need) {
+    b->have = b->trigger_count = 0;
+    b->need = need;
+    pthread_mutex_init(&b->mutex, NULL);
+    pthread_cond_init(&b->cond, NULL);
+    return 0;
+}
+
+int barr_destroy(barr_t* b) {
+    pthread_mutex_destroy(&b->mutex);
+    pthread_cond_destroy(&b->cond);
+    return 0;
+}
+
+int barr_wait(barr_t* b) {
+    pthread_mutex_lock(&b->mutex);
+    int my_trigger_count = b->trigger_count;
+    b->have++;
+    if (b->have == b->need) {
+        b->have = 0;
+        b->trigger_count++;
+        pthread_cond_broadcast(&b->cond);
+        pthread_mutex_unlock(&b->mutex);
+        return PTHREAD_BARRIER_SERIAL_THREAD;
+    }
+    while (my_trigger_count == b->trigger_count) { // no spurious wakeups
+        pthread_cond_wait(&b->cond, &b->mutex);
+    }
+    pthread_mutex_unlock(&b->mutex);
+    return 0;
+}
+
+#endif // !_POSIX_BARRIERS
+#endif // !_WIN32
+
+#endif // TESTLIB_THREAD_BARRIERS_H

From 7c0da6702ffeed4fb5d991241010a133a7225321 Mon Sep 17 00:00:00 2001
From: Richard Reingruber <rrich@openjdk.org>
Date: Thu, 19 Mar 2026 05:20:45 +0000
Subject: [PATCH 250/655] 8380041: PPC: remove POWER6 remnants

Reviewed-by: dbriemann, mdoerr
---
 src/hotspot/cpu/ppc/assembler_ppc.hpp             |  7 -------
 src/hotspot/cpu/ppc/assembler_ppc.inline.hpp      |  2 --
 src/hotspot/cpu/ppc/disassembler_ppc.cpp          |  3 ---
 src/hotspot/cpu/ppc/macroAssembler_ppc.cpp        |  4 ++--
 src/hotspot/cpu/ppc/macroAssembler_ppc.hpp        |  8 --------
 src/hotspot/cpu/ppc/macroAssembler_ppc.inline.hpp | 13 ++++---------
 src/hotspot/cpu/ppc/ppc.ad                        | 14 --------------
 7 files changed, 6 insertions(+), 45 deletions(-)

diff --git a/src/hotspot/cpu/ppc/assembler_ppc.hpp b/src/hotspot/cpu/ppc/assembler_ppc.hpp
index da2daffd579..378e01fc1cc 100644
--- a/src/hotspot/cpu/ppc/assembler_ppc.hpp
+++ b/src/hotspot/cpu/ppc/assembler_ppc.hpp
@@ -1580,10 +1580,6 @@ class Assembler : public AbstractAssembler {
   static bool is_nop(int x) {
     return x == 0x60000000;
   }
-  // endgroup opcode for Power6
-  static bool is_endgroup(int x) {
-    return is_ori(x) && inv_ra_field(x) == 1 && inv_rs_field(x) == 1 && inv_d1_field(x) == 0;
-  }
 
 
  private:
@@ -1659,9 +1655,6 @@ class Assembler : public AbstractAssembler {
   inline void ori_opt( Register d, int ui16);
   inline void oris_opt(Register d, int ui16);
 
-  // endgroup opcode for Power6
-  inline void endgroup();
-
   // count instructions
   inline void cntlzw(  Register a, Register s);
   inline void cntlzw_( Register a, Register s);
diff --git a/src/hotspot/cpu/ppc/assembler_ppc.inline.hpp b/src/hotspot/cpu/ppc/assembler_ppc.inline.hpp
index bd6f3300606..d349bbc6f87 100644
--- a/src/hotspot/cpu/ppc/assembler_ppc.inline.hpp
+++ b/src/hotspot/cpu/ppc/assembler_ppc.inline.hpp
@@ -253,8 +253,6 @@ inline void Assembler::mr(      Register d, Register s)   { Assembler::orr(d, s,
 inline void Assembler::ori_opt( Register d, int ui16)     { if (ui16!=0) Assembler::ori( d, d, ui16); }
 inline void Assembler::oris_opt(Register d, int ui16)     { if (ui16!=0) Assembler::oris(d, d, ui16); }
 
-inline void Assembler::endgroup()                         { Assembler::ori(R1, R1, 0); }
-
 // count instructions
 inline void Assembler::cntlzw(  Register a, Register s)              { emit_int32(CNTLZW_OPCODE | rta(a) | rs(s) | rc(0)); }
 inline void Assembler::cntlzw_( Register a, Register s)              { emit_int32(CNTLZW_OPCODE | rta(a) | rs(s) | rc(1)); }
diff --git a/src/hotspot/cpu/ppc/disassembler_ppc.cpp b/src/hotspot/cpu/ppc/disassembler_ppc.cpp
index fb3cb50cdec..2e16e1a301f 100644
--- a/src/hotspot/cpu/ppc/disassembler_ppc.cpp
+++ b/src/hotspot/cpu/ppc/disassembler_ppc.cpp
@@ -119,9 +119,6 @@ address Disassembler::decode_instruction0(address here, outputStream * st, addre
   } else if (instruction == 0xbadbabe) {
     st->print(".data 0xbadbabe");
     next = here + Assembler::instr_len(here);
-  } else if (Assembler::is_endgroup(instruction)) {
-    st->print("endgroup");
-    next = here + Assembler::instr_len(here);
   } else {
     next = here;
   }
diff --git a/src/hotspot/cpu/ppc/macroAssembler_ppc.cpp b/src/hotspot/cpu/ppc/macroAssembler_ppc.cpp
index f3050cbabb4..14e90ddf185 100644
--- a/src/hotspot/cpu/ppc/macroAssembler_ppc.cpp
+++ b/src/hotspot/cpu/ppc/macroAssembler_ppc.cpp
@@ -483,7 +483,7 @@ void MacroAssembler::set_dest_of_bc_far_at(address instruction_addr, address des
     // variant 3, far cond branch to the next instruction, already patched to nops:
     //
     //    nop
-    //    endgroup
+    //    nop
     //  SKIP/DEST:
     //
     return;
@@ -500,7 +500,7 @@ void MacroAssembler::set_dest_of_bc_far_at(address instruction_addr, address des
   if (is_bc_far_variant2_at(instruction_addr) && dest == instruction_addr + 8) {
     // Far branch to next instruction: Optimize it by patching nops (produce variant 3).
     masm.nop();
-    masm.endgroup();
+    masm.nop();
   } else {
     if (is_bc_far_variant1_at(instruction_addr)) {
       // variant 1, the 1st instruction contains the destination address:
diff --git a/src/hotspot/cpu/ppc/macroAssembler_ppc.hpp b/src/hotspot/cpu/ppc/macroAssembler_ppc.hpp
index 58dec702d7a..4be62098bdf 100644
--- a/src/hotspot/cpu/ppc/macroAssembler_ppc.hpp
+++ b/src/hotspot/cpu/ppc/macroAssembler_ppc.hpp
@@ -70,14 +70,6 @@ class MacroAssembler: public Assembler {
   // Move register if destination register and target register are different
   inline void mr_if_needed(Register rd, Register rs, bool allow_invalid = false);
   inline void fmr_if_needed(FloatRegister rd, FloatRegister rs);
-  // This is dedicated for emitting scheduled mach nodes. For better
-  // readability of the ad file I put it here.
-  // Endgroups are not needed if
-  //  - the scheduler is off
-  //  - the scheduler found that there is a natural group end, in that
-  //    case it reduced the size of the instruction used in the test
-  //    yielding 'needed'.
-  inline void endgroup_if_needed(bool needed);
 
   // Memory barriers.
   inline void membar(int bits);
diff --git a/src/hotspot/cpu/ppc/macroAssembler_ppc.inline.hpp b/src/hotspot/cpu/ppc/macroAssembler_ppc.inline.hpp
index 2b19d84c69c..cdeb8527bea 100644
--- a/src/hotspot/cpu/ppc/macroAssembler_ppc.inline.hpp
+++ b/src/hotspot/cpu/ppc/macroAssembler_ppc.inline.hpp
@@ -1,6 +1,6 @@
 /*
- * Copyright (c) 2002, 2025, Oracle and/or its affiliates. All rights reserved.
- * Copyright (c) 2012, 2025 SAP SE. All rights reserved.
+ * Copyright (c) 2002, 2026, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2012, 2026 SAP SE. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -72,11 +72,6 @@ inline void MacroAssembler::mr_if_needed(Register rd, Register rs, bool allow_no
 inline void MacroAssembler::fmr_if_needed(FloatRegister rd, FloatRegister rs) {
   if (rs != rd) fmr(rd, rs);
 }
-inline void MacroAssembler::endgroup_if_needed(bool needed) {
-  if (needed) {
-    endgroup();
-  }
-}
 
 inline void MacroAssembler::membar(int bits) {
   // Comment: Usage of elemental_membar(bits) is not recommended for Power 8.
@@ -240,13 +235,13 @@ inline bool MacroAssembler::is_bc_far_variant3_at(address instruction_addr) {
   // Variant 3, far cond branch to the next instruction, already patched to nops:
   //
   //    nop
-  //    endgroup
+  //    nop
   //  SKIP/DEST:
   //
   const int instruction_1 = *(int*)(instruction_addr);
   const int instruction_2 = *(int*)(instruction_addr + 4);
   return is_nop(instruction_1) &&
-         is_endgroup(instruction_2);
+         is_nop(instruction_2);
 }
 
 // set dst to -1, 0, +1 as follows: if CR0bi is "greater than", dst is set to 1,
diff --git a/src/hotspot/cpu/ppc/ppc.ad b/src/hotspot/cpu/ppc/ppc.ad
index 01c290f9b04..3b25604471f 100644
--- a/src/hotspot/cpu/ppc/ppc.ad
+++ b/src/hotspot/cpu/ppc/ppc.ad
@@ -14362,20 +14362,6 @@ instruct tlsLoadP(threadRegP dst) %{
 
 //---Some PPC specific nodes---------------------------------------------------
 
-// Stop a group.
-instruct endGroup() %{
-  ins_cost(0);
-
-  ins_is_nop(true);
-
-  format %{ "End Bundle (ori r1, r1, 0)" %}
-  size(4);
-  ins_encode %{
-    __ endgroup();
-  %}
-  ins_pipe(pipe_class_default);
-%}
-
 // Nop instructions
 
 instruct fxNop() %{

From d0e62e114ce8a40b30300ae023b78488a350f879 Mon Sep 17 00:00:00 2001
From: Michael Reeves <michael.reeves077@gmail.com>
Date: Thu, 19 Mar 2026 07:44:30 +0000
Subject: [PATCH 251/655] 8351847: C2: Add "TraceSplitIf" flag to get more
 information about the optimization in Split-If

Reviewed-by: chagedorn, dfenacci
---
 src/hotspot/share/opto/c2_globals.hpp         |  3 +
 src/hotspot/share/opto/loopopts.cpp           | 11 +++-
 src/hotspot/share/opto/split_if.cpp           | 36 ++++++++++++
 .../compiler/splitif/TestTraceSplitIf.java    | 58 +++++++++++++++++++
 4 files changed, 106 insertions(+), 2 deletions(-)
 create mode 100644 test/hotspot/jtreg/compiler/splitif/TestTraceSplitIf.java

diff --git a/src/hotspot/share/opto/c2_globals.hpp b/src/hotspot/share/opto/c2_globals.hpp
index 66a6f2d0c3c..e0833afa29d 100644
--- a/src/hotspot/share/opto/c2_globals.hpp
+++ b/src/hotspot/share/opto/c2_globals.hpp
@@ -249,6 +249,9 @@
   develop(bool, TraceLoopOpts, false,                                       \
           "Trace executed loop optimizations")                              \
                                                                             \
+  develop(bool, TraceSplitIf, false,                                        \
+          "Trace Split-If optimization")                                    \
+                                                                            \
   develop(bool, TraceLoopLimitCheck, false,                                 \
           "Trace generation of loop limits checks")                         \
                                                                             \
diff --git a/src/hotspot/share/opto/loopopts.cpp b/src/hotspot/share/opto/loopopts.cpp
index a21fa43b30c..2a0178530e8 100644
--- a/src/hotspot/share/opto/loopopts.cpp
+++ b/src/hotspot/share/opto/loopopts.cpp
@@ -1478,9 +1478,11 @@ void PhaseIdealLoop::split_if_with_blocks_post(Node *n) {
 
     // Now split the IF
     C->print_method(PHASE_BEFORE_SPLIT_IF, 4, iff);
-    if (TraceLoopOpts) {
-      tty->print_cr("Split-If");
+#ifndef PRODUCT
+    if (TraceLoopOpts || TraceSplitIf) {
+      tty->print_cr("Split-If: %d %s", iff->_idx, iff->Name());
     }
+#endif
     do_split_if(iff);
     C->print_method(PHASE_AFTER_SPLIT_IF, 4, iff);
     return;
@@ -1590,6 +1592,11 @@ bool PhaseIdealLoop::try_merge_identical_ifs(Node* n) {
     // Now split the IF
     RegionNode* new_false_region;
     RegionNode* new_true_region;
+#ifndef PRODUCT
+    if (TraceLoopOpts || TraceSplitIf) {
+      tty->print_cr("Split-If Merging Identical Ifs: Dom-If: %d %s, If: %d %s", dom_if->_idx, dom_if->Name(), n->_idx, n->Name());
+    }
+#endif
     do_split_if(n, &new_false_region, &new_true_region);
     assert(new_false_region->req() == new_true_region->req(), "");
 #ifdef ASSERT
diff --git a/src/hotspot/share/opto/split_if.cpp b/src/hotspot/share/opto/split_if.cpp
index dff8bf86606..91595c57a10 100644
--- a/src/hotspot/share/opto/split_if.cpp
+++ b/src/hotspot/share/opto/split_if.cpp
@@ -38,6 +38,11 @@ RegionNode* PhaseIdealLoop::split_thru_region(Node* n, RegionNode* region) {
   assert(n->is_CFG(), "");
   RegionNode* r = new RegionNode(region->req());
   IdealLoopTree* loop = get_loop(n);
+#ifndef PRODUCT
+  if (TraceSplitIf) {
+    tty->print_cr("  Splitting %d %s through %d %s", n->_idx, n->Name(), region->_idx, region->Name());
+  }
+#endif
   for (uint i = 1; i < region->req(); i++) {
     Node* x = n->clone();
     Node* in0 = n->in(0);
@@ -145,6 +150,11 @@ bool PhaseIdealLoop::split_up( Node *n, Node *blk1, Node *blk2 ) {
   }
 
   // Now actually split-up this guy.  One copy per control path merging.
+#ifndef PRODUCT
+  if (TraceSplitIf) {
+    tty->print_cr("  Splitting up: %d %s", n->_idx, n->Name());
+  }
+#endif
   Node *phi = PhiNode::make_blank(blk1, n);
   for( uint j = 1; j < blk1->req(); j++ ) {
     Node *x = n->clone();
@@ -185,6 +195,11 @@ bool PhaseIdealLoop::split_up( Node *n, Node *blk1, Node *blk2 ) {
 // AddP and CheckCastPP have the same obj input after split if.
 bool PhaseIdealLoop::clone_cmp_loadklass_down(Node* n, const Node* blk1, const Node* blk2) {
   if (n->Opcode() == Op_AddP && at_relevant_ctrl(n, blk1, blk2)) {
+#ifndef PRODUCT
+    if (TraceSplitIf) {
+      tty->print_cr("  Cloning down (LoadKlass): %d %s", n->_idx, n->Name());
+    }
+#endif
     Node_List cmp_nodes;
     uint old = C->unique();
     for (DUIterator_Fast imax, i = n->fast_outs(imax); i < imax; i++) {
@@ -301,6 +316,11 @@ bool PhaseIdealLoop::clone_cmp_down(Node* n, const Node* blk1, const Node* blk2)
            at_relevant_ctrl(cmov, blk1, blk2)))) {
 
       // Must clone down
+#ifndef PRODUCT
+      if (TraceSplitIf) {
+        tty->print_cr("  Cloning down (Cmp): %d %s", n->_idx, n->Name());
+      }
+#endif
       if (!n->is_FastLock()) {
         // Clone down any block-local BoolNode uses of this CmpNode
         for (DUIterator i = n->outs(); n->has_out(i); i++) {
@@ -401,6 +421,12 @@ void PhaseIdealLoop::clone_template_assertion_expression_down(Node* node) {
     return;
   }
 
+#ifndef PRODUCT
+  if (TraceSplitIf) {
+    tty->print_cr("  Cloning down (Template Assertion Expression): %d %s", node->_idx, node->Name());
+  }
+#endif
+
   TemplateAssertionExpressionNode template_assertion_expression_node(node);
   auto clone_expression = [&](IfNode* template_assertion_predicate) {
     OpaqueTemplateAssertionPredicateNode* opaque_node =
@@ -459,6 +485,11 @@ Node *PhaseIdealLoop::spinup( Node *iff_dom, Node *new_false, Node *new_true, No
   Node *phi_post;
   if( prior_n == new_false || prior_n == new_true ) {
     phi_post = def->clone();
+#ifndef PRODUCT
+    if (TraceSplitIf) {
+      tty->print_cr("  Spinup: cloning def to sink: %d %s -> %d %s", def->_idx, def->Name(), phi_post->_idx, phi_post->Name());
+    }
+#endif
     phi_post->set_req(0, prior_n );
     register_new_node(phi_post, prior_n);
   } else {
@@ -472,6 +503,11 @@ Node *PhaseIdealLoop::spinup( Node *iff_dom, Node *new_false, Node *new_true, No
     } else {
       assert( def->is_Phi(), "" );
       assert( prior_n->is_Region(), "must be a post-dominating merge point" );
+#ifndef PRODUCT
+      if (TraceSplitIf) {
+        tty->print_cr("  Spinup: creating new Phi for merge: %d %s", def->_idx, def->Name());
+      }
+#endif
 
       // Need a Phi here
       phi_post = PhiNode::make_blank(prior_n, def);
diff --git a/test/hotspot/jtreg/compiler/splitif/TestTraceSplitIf.java b/test/hotspot/jtreg/compiler/splitif/TestTraceSplitIf.java
new file mode 100644
index 00000000000..32f3a213215
--- /dev/null
+++ b/test/hotspot/jtreg/compiler/splitif/TestTraceSplitIf.java
@@ -0,0 +1,58 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+/*
+ * @test
+ * @bug 8351847
+ * @summary Sanity test for -XX:+TraceSplitIf to ensure it doesn't crash and produces output.
+ * @library /test/lib
+ * @requires vm.compiler2.enabled & vm.debug
+ * @run driver ${test.main.class}
+ */
+
+package compiler.splitif;
+
+import jdk.test.lib.process.OutputAnalyzer;
+import jdk.test.lib.process.ProcessTools;
+
+public class TestTraceSplitIf {
+    public static void main(String[] args) throws Exception {
+        ProcessBuilder pb = ProcessTools.createLimitedTestJavaProcessBuilder(
+            "-XX:+TraceSplitIf",
+            "-Xcomp",
+            HelloWorld.class.getName()
+        );
+
+        OutputAnalyzer output = new OutputAnalyzer(pb.start());
+
+        output.shouldHaveExitValue(0);
+        output.shouldContain("Merging Identical Ifs");
+        output.shouldContain("Split-If");
+    }
+
+    public static class HelloWorld {
+        public static void main(String[] args) {
+            System.out.println("Hello, World!");
+        }
+    }
+}

From 02001567f0d8ba83d28b014b9e8564f1e594ff74 Mon Sep 17 00:00:00 2001
From: Matthias Baesken <mbaesken@openjdk.org>
Date: Thu, 19 Mar 2026 08:19:41 +0000
Subject: [PATCH 252/655] 8379425: Windows and macOS should not allow
 unsupported headless-only build

Reviewed-by: erikj, aivanov, clanger
---
 make/autoconf/jdk-options.m4 | 7 +++++++
 1 file changed, 7 insertions(+)

diff --git a/make/autoconf/jdk-options.m4 b/make/autoconf/jdk-options.m4
index dafac618c59..89fcbc88521 100644
--- a/make/autoconf/jdk-options.m4
+++ b/make/autoconf/jdk-options.m4
@@ -102,6 +102,13 @@ AC_DEFUN_ONCE([JDKOPT_SETUP_JDK_OPTIONS],
       CHECKING_MSG: [if we should build headless-only (no GUI)])
   AC_SUBST(ENABLE_HEADLESS_ONLY)
 
+  # Avoid headless-only on macOS and Windows, it is not supported there
+  if test "x$ENABLE_HEADLESS_ONLY" = xtrue; then
+    if test "x$OPENJDK_TARGET_OS" = xwindows || test "x$OPENJDK_TARGET_OS" = xmacosx; then
+      AC_MSG_ERROR([headless-only is not supported on macOS and Windows])
+    fi
+  fi
+
   # should we linktime gc unused code sections in the JDK build ?
   if test "x$OPENJDK_TARGET_OS" = "xlinux"; then
     if test "x$OPENJDK_TARGET_CPU" = "xs390x" || test "x$OPENJDK_TARGET_CPU" = "xppc64le"; then

From a0c8fce9d76ee809d5f67b83b07c6829e44aed07 Mon Sep 17 00:00:00 2001
From: Thomas Schatzl <tschatzl@openjdk.org>
Date: Thu, 19 Mar 2026 09:57:28 +0000
Subject: [PATCH 253/655] 8379511: G1: G1CollectorState should derive
 concurrent cycle state from G1ConcurrentMark

Reviewed-by: iwalulya, ayang
---
 src/hotspot/share/gc/g1/g1CollectedHeap.cpp   |  2 +-
 src/hotspot/share/gc/g1/g1CollectorState.cpp  | 25 +++++++-
 src/hotspot/share/gc/g1/g1CollectorState.hpp  | 26 ++------
 src/hotspot/share/gc/g1/g1ConcurrentMark.cpp  | 57 +++++++++--------
 src/hotspot/share/gc/g1/g1ConcurrentMark.hpp  | 11 +++-
 .../share/gc/g1/g1ConcurrentMarkThread.cpp    | 16 ++---
 .../share/gc/g1/g1ConcurrentMarkThread.hpp    | 46 ++++++++------
 .../gc/g1/g1ConcurrentMarkThread.inline.hpp   | 61 +++++++++++++++----
 src/hotspot/share/gc/g1/g1PeriodicGCTask.cpp  |  6 +-
 src/hotspot/share/gc/g1/g1Policy.cpp          | 22 ++-----
 src/hotspot/share/gc/g1/g1Policy.hpp          |  2 +-
 src/hotspot/share/gc/g1/g1RemSet.cpp          |  2 +-
 src/hotspot/share/gc/g1/g1VMOperations.cpp    | 15 ++---
 src/hotspot/share/gc/g1/g1YoungCollector.cpp  |  2 +-
 .../g1/g1YoungGCAllocationFailureInjector.cpp | 10 +--
 .../gc/g1/g1YoungGCPostEvacuateTasks.cpp      |  2 +-
 src/hotspot/share/prims/whitebox.cpp          |  2 +-
 17 files changed, 185 insertions(+), 122 deletions(-)

diff --git a/src/hotspot/share/gc/g1/g1CollectedHeap.cpp b/src/hotspot/share/gc/g1/g1CollectedHeap.cpp
index abc45254782..8b41a3b2079 100644
--- a/src/hotspot/share/gc/g1/g1CollectedHeap.cpp
+++ b/src/hotspot/share/gc/g1/g1CollectedHeap.cpp
@@ -2554,7 +2554,7 @@ HeapWord* G1CollectedHeap::do_collection_pause(size_t word_size,
 
 void G1CollectedHeap::start_concurrent_cycle(bool concurrent_operation_is_full_mark) {
   assert(_cm->is_fully_initialized(), "sanity");
-  assert(!_cm->in_progress(), "Can not start concurrent operation while in progress");
+  assert(!collector_state()->is_in_concurrent_cycle(), "Can not start concurrent cycle when already running");
   MutexLocker x(G1CGC_lock, Mutex::_no_safepoint_check_flag);
   if (concurrent_operation_is_full_mark) {
     _cm->start_full_concurrent_cycle();
diff --git a/src/hotspot/share/gc/g1/g1CollectorState.cpp b/src/hotspot/share/gc/g1/g1CollectorState.cpp
index d41ee22fdce..b64e9d45674 100644
--- a/src/hotspot/share/gc/g1/g1CollectorState.cpp
+++ b/src/hotspot/share/gc/g1/g1CollectorState.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2021, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2021, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -22,7 +22,9 @@
  *
  */
 
+#include "gc/g1/g1CollectedHeap.inline.hpp"
 #include "gc/g1/g1CollectorState.hpp"
+#include "gc/g1/g1ConcurrentMarkThread.inline.hpp"
 #include "gc/g1/g1GCPauseType.hpp"
 
 G1GCPauseType G1CollectorState::young_gc_pause_type(bool concurrent_operation_is_full_mark) const {
@@ -44,3 +46,24 @@ G1GCPauseType G1CollectorState::young_gc_pause_type(bool concurrent_operation_is
     return G1GCPauseType::YoungGC;
   }
 }
+
+bool G1CollectorState::is_in_concurrent_cycle() const {
+  G1ConcurrentMark* cm = G1CollectedHeap::heap()->concurrent_mark();
+  return cm->is_in_concurrent_cycle();
+}
+
+bool G1CollectorState::is_in_marking() const {
+  G1ConcurrentMark* cm = G1CollectedHeap::heap()->concurrent_mark();
+  return cm->is_in_marking();
+}
+
+bool G1CollectorState::is_in_mark_or_rebuild() const {
+  G1ConcurrentMark* cm = G1CollectedHeap::heap()->concurrent_mark();
+  return is_in_marking() || cm->is_in_rebuild_or_scrub();
+}
+
+bool G1CollectorState::is_in_reset_for_next_cycle() const {
+  G1ConcurrentMark* cm = G1CollectedHeap::heap()->concurrent_mark();
+  return cm->is_in_reset_for_next_cycle();
+}
+
diff --git a/src/hotspot/share/gc/g1/g1CollectorState.hpp b/src/hotspot/share/gc/g1/g1CollectorState.hpp
index fca30792344..ddf9d7fd181 100644
--- a/src/hotspot/share/gc/g1/g1CollectorState.hpp
+++ b/src/hotspot/share/gc/g1/g1CollectorState.hpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2015, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2015, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -60,16 +60,6 @@ class G1CollectorState {
   // do the concurrent start phase work.
   volatile bool _initiate_conc_mark_if_possible;
 
-  // Marking is in progress. Set from start of the concurrent start pause to the
-  // end of the Remark pause.
-  bool _mark_in_progress;
-  // Marking or rebuilding remembered set work is in progress. Set from the end
-  // of the concurrent start pause to the end of the Cleanup pause.
-  bool _mark_or_rebuild_in_progress;
-
-  // The marking bitmap is currently being cleared or about to be cleared.
-  bool _clear_bitmap_in_progress;
-
   // Set during a full gc pause.
   bool _in_full_gc;
 
@@ -81,9 +71,6 @@ public:
     _in_concurrent_start_gc(false),
     _initiate_conc_mark_if_possible(false),
 
-    _mark_in_progress(false),
-    _mark_or_rebuild_in_progress(false),
-    _clear_bitmap_in_progress(false),
     _in_full_gc(false) { }
 
   // Phase setters
@@ -96,10 +83,6 @@ public:
 
   void set_initiate_conc_mark_if_possible(bool v) { _initiate_conc_mark_if_possible = v; }
 
-  void set_mark_in_progress(bool v) { _mark_in_progress = v; }
-  void set_mark_or_rebuild_in_progress(bool v) { _mark_or_rebuild_in_progress = v; }
-  void set_clear_bitmap_in_progress(bool v) { _clear_bitmap_in_progress = v; }
-
   // Phase getters
   bool in_young_only_phase() const { return _in_young_only_phase && !_in_full_gc; }
   bool in_mixed_phase() const { return !_in_young_only_phase && !_in_full_gc; }
@@ -111,9 +94,10 @@ public:
 
   bool initiate_conc_mark_if_possible() const { return _initiate_conc_mark_if_possible; }
 
-  bool mark_in_progress() const { return _mark_in_progress; }
-  bool mark_or_rebuild_in_progress() const { return _mark_or_rebuild_in_progress; }
-  bool clear_bitmap_in_progress() const { return _clear_bitmap_in_progress; }
+  bool is_in_concurrent_cycle() const;
+  bool is_in_marking() const;
+  bool is_in_mark_or_rebuild() const;
+  bool is_in_reset_for_next_cycle() const;
 
   // Calculate GC Pause Type from internal state.
   G1GCPauseType young_gc_pause_type(bool concurrent_operation_is_full_mark) const;
diff --git a/src/hotspot/share/gc/g1/g1ConcurrentMark.cpp b/src/hotspot/share/gc/g1/g1ConcurrentMark.cpp
index 33b21d8348d..ab28feb520f 100644
--- a/src/hotspot/share/gc/g1/g1ConcurrentMark.cpp
+++ b/src/hotspot/share/gc/g1/g1ConcurrentMark.cpp
@@ -573,8 +573,20 @@ void G1ConcurrentMark::fully_initialize() {
   reset_at_marking_complete();
 }
 
-bool G1ConcurrentMark::in_progress() const {
-  return is_fully_initialized() ? _cm_thread->in_progress() : false;
+bool G1ConcurrentMark::is_in_concurrent_cycle() const {
+  return is_fully_initialized() ? _cm_thread->is_in_progress() : false;
+}
+
+bool G1ConcurrentMark::is_in_marking() const {
+  return is_fully_initialized() ? cm_thread()->is_in_marking() : false;
+}
+
+bool G1ConcurrentMark::is_in_rebuild_or_scrub() const {
+  return cm_thread()->is_in_rebuild_or_scrub();
+}
+
+bool G1ConcurrentMark::is_in_reset_for_next_cycle() const {
+  return cm_thread()->is_in_reset_for_next_cycle();
 }
 
 PartialArrayStateManager* G1ConcurrentMark::partial_array_state_manager() const {
@@ -622,7 +634,7 @@ void G1ConcurrentMark::humongous_object_eagerly_reclaimed(G1HeapRegion* r) {
   // Need to clear mark bit of the humongous object. Doing this unconditionally is fine.
   mark_bitmap()->clear(r->bottom());
 
-  if (!_g1h->collector_state()->mark_or_rebuild_in_progress()) {
+  if (!_g1h->collector_state()->is_in_mark_or_rebuild()) {
     return;
   }
 
@@ -729,7 +741,7 @@ private:
     }
 
     bool is_clear_concurrent_undo() {
-      return suspendible() && _cm->cm_thread()->in_undo_mark();
+      return suspendible() && _cm->cm_thread()->is_in_undo_cycle();
     }
 
     bool has_aborted() {
@@ -785,8 +797,7 @@ private:
         // as asserts here to minimize their overhead on the product. However, we
         // will have them as guarantees at the beginning / end of the bitmap
         // clearing to get some checking in the product.
-        assert(!suspendible() || _cm->in_progress(), "invariant");
-        assert(!suspendible() || !G1CollectedHeap::heap()->collector_state()->mark_or_rebuild_in_progress(), "invariant");
+        assert(!suspendible() || _cm->is_in_reset_for_next_cycle(), "invariant");
 
         // Abort iteration if necessary.
         if (has_aborted()) {
@@ -836,23 +847,14 @@ void G1ConcurrentMark::clear_bitmap(WorkerThreads* workers, bool may_yield) {
 void G1ConcurrentMark::cleanup_for_next_mark() {
   // Make sure that the concurrent mark thread looks to still be in
   // the current cycle.
-  guarantee(is_fully_initialized(), "should be initializd");
-  guarantee(in_progress(), "invariant");
-
-  // We are finishing up the current cycle by clearing the next
-  // marking bitmap and getting it ready for the next cycle. During
-  // this time no other cycle can start. So, let's make sure that this
-  // is the case.
-  guarantee(!_g1h->collector_state()->mark_or_rebuild_in_progress(), "invariant");
+  guarantee(is_in_reset_for_next_cycle(), "invariant");
 
   clear_bitmap(_concurrent_workers, true);
 
   reset_partial_array_state_manager();
 
-  // Repeat the asserts from above.
-  guarantee(is_fully_initialized(), "should be initializd");
-  guarantee(in_progress(), "invariant");
-  guarantee(!_g1h->collector_state()->mark_or_rebuild_in_progress(), "invariant");
+  // Should not have changed state yet (even if a Full GC interrupted us).
+  guarantee(is_in_reset_for_next_cycle(), "invariant");
 }
 
 void G1ConcurrentMark::reset_partial_array_state_manager() {
@@ -977,14 +979,14 @@ void G1ConcurrentMark::start_full_concurrent_cycle() {
   // during it. No need to call it here.
 
   // Signal the thread to start work.
-  cm_thread()->start_full_mark();
+  cm_thread()->start_full_cycle();
 }
 
 void G1ConcurrentMark::start_undo_concurrent_cycle() {
   root_regions()->cancel_scan();
 
   // Signal the thread to start work.
-  cm_thread()->start_undo_mark();
+  cm_thread()->start_undo_cycle();
 }
 
 void G1ConcurrentMark::notify_concurrent_cycle_completed() {
@@ -1186,8 +1188,6 @@ uint G1ConcurrentMark::completed_mark_cycles() const {
 }
 
 void G1ConcurrentMark::concurrent_cycle_end(bool mark_cycle_completed) {
-  _g1h->collector_state()->set_clear_bitmap_in_progress(false);
-
   _g1h->trace_heap_after_gc(_gc_tracer_cm);
 
   if (mark_cycle_completed) {
@@ -1372,6 +1372,9 @@ void G1ConcurrentMark::remark() {
       G1ObjectCountIsAliveClosure is_alive(_g1h);
       _gc_tracer_cm->report_object_count_after_gc(&is_alive, _g1h->workers());
     }
+
+    // Successfully completed marking, advance state.
+    cm_thread()->set_full_cycle_rebuild_and_scrub();
   } else {
     // We overflowed.  Restart concurrent marking.
     _restart_for_overflow.store_relaxed(true);
@@ -1392,6 +1395,8 @@ void G1ConcurrentMark::remark() {
   _g1h->update_perf_counter_cpu_time();
 
   policy->record_concurrent_mark_remark_end();
+
+  return;
 }
 
 void G1ConcurrentMark::compute_new_sizes() {
@@ -1454,6 +1459,10 @@ void G1ConcurrentMark::cleanup() {
     GCTraceTime(Debug, gc, phases) debug("Finalize Concurrent Mark Cleanup", _gc_timer_cm);
     policy->record_concurrent_mark_cleanup_end(needs_remembered_set_rebuild());
   }
+
+  // Advance state.
+  cm_thread()->set_full_cycle_reset_for_next_cycle();
+  return;
 }
 
 // 'Keep Alive' oop closure used by both serial parallel reference processing.
@@ -1880,7 +1889,7 @@ public:
 void G1ConcurrentMark::verify_no_collection_set_oops() {
   assert(SafepointSynchronize::is_at_safepoint() || !is_init_completed(),
          "should be at a safepoint or initializing");
-  if (!_g1h->collector_state()->mark_or_rebuild_in_progress()) {
+  if (!is_fully_initialized() || !_g1h->collector_state()->is_in_mark_or_rebuild()) {
     return;
   }
 
@@ -1958,7 +1967,7 @@ bool G1ConcurrentMark::concurrent_cycle_abort() {
   // has been signalled is already rare), and this work should be negligible compared
   // to actual full gc work.
 
-  if (!is_fully_initialized() || (!cm_thread()->in_progress() && !cm_thread()->should_terminate())) {
+  if (!is_fully_initialized() || (!cm_thread()->is_in_progress() && !cm_thread()->should_terminate())) {
     return false;
   }
 
diff --git a/src/hotspot/share/gc/g1/g1ConcurrentMark.hpp b/src/hotspot/share/gc/g1/g1ConcurrentMark.hpp
index 8bd04437097..de97179d210 100644
--- a/src/hotspot/share/gc/g1/g1ConcurrentMark.hpp
+++ b/src/hotspot/share/gc/g1/g1ConcurrentMark.hpp
@@ -353,6 +353,7 @@ class G1ConcurrentMark : public CHeapObj<mtGC> {
   friend class G1CMRootRegionScanTask;
   friend class G1CMTask;
   friend class G1ClearBitMapTask;
+  friend class G1CollectorState;
   friend class G1ConcurrentMarkThread;
 
   G1ConcurrentMarkThread* _cm_thread;     // The thread doing the work
@@ -528,6 +529,12 @@ class G1ConcurrentMark : public CHeapObj<mtGC> {
 
   G1ConcurrentMarkThread* cm_thread() const;
 
+  // Concurrent cycle state queries.
+  bool is_in_concurrent_cycle() const;
+  bool is_in_marking() const;
+  bool is_in_rebuild_or_scrub() const;
+  bool is_in_reset_for_next_cycle() const;
+
 public:
   // To be called when an object is marked the first time, e.g. after a successful
   // mark_in_bitmap call. Updates various statistics data.
@@ -561,7 +568,7 @@ public:
 
   void fully_initialize();
   bool is_fully_initialized() const { return _cm_thread != nullptr; }
-  bool in_progress() const;
+
   uint max_num_tasks() const {return _max_num_tasks; }
 
   // Clear statistics gathered during the concurrent cycle for the given region after
@@ -666,8 +673,10 @@ public:
   // Do concurrent preclean work.
   void preclean();
 
+  // Executes the Remark pause.
   void remark();
 
+  // Executes the Cleanup pause.
   void cleanup();
 
   // Mark in the marking bitmap. Used during evacuation failure to
diff --git a/src/hotspot/share/gc/g1/g1ConcurrentMarkThread.cpp b/src/hotspot/share/gc/g1/g1ConcurrentMarkThread.cpp
index 629cbae935e..31d61b8b388 100644
--- a/src/hotspot/share/gc/g1/g1ConcurrentMarkThread.cpp
+++ b/src/hotspot/share/gc/g1/g1ConcurrentMarkThread.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2001, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2001, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -112,22 +112,22 @@ class G1ConcPhaseTimer : public GCTraceConcTimeImpl<LogLevel::Info, LOG_TAGS(gc,
 
 void G1ConcurrentMarkThread::run_service() {
   while (wait_for_next_cycle()) {
-    assert(in_progress(), "must be");
+    assert(is_in_progress(), "must be");
 
     GCIdMark gc_id_mark;
-    FormatBuffer<128> title("Concurrent %s Cycle", _state == FullMark ? "Mark" : "Undo");
+    FormatBuffer<128> title("Concurrent %s Cycle", is_in_full_concurrent_cycle() ? "Mark" : "Undo");
     GCTraceConcTime(Info, gc) tt(title);
 
     concurrent_cycle_start();
 
-    if (_state == FullMark) {
+    if (_state == FullCycleMarking) {
       concurrent_mark_cycle_do();
     } else {
-      assert(_state == UndoMark, "Must do undo mark but is %d", _state);
+      assert(_state == UndoCycleResetForNextCycle, "Must do undo mark but is %d", _state);
       concurrent_undo_cycle_do();
     }
 
-    concurrent_cycle_end(_state == FullMark && !_cm->has_aborted());
+    concurrent_cycle_end(is_in_full_concurrent_cycle() && !_cm->has_aborted());
 
     update_perf_counter_cpu_time();
   }
@@ -135,7 +135,7 @@ void G1ConcurrentMarkThread::run_service() {
 }
 
 void G1ConcurrentMarkThread::stop_service() {
-  if (in_progress()) {
+  if (is_in_progress()) {
     // We are not allowed to abort the marking threads during root region scan.
     // Needs to be done separately.
     _cm->root_region_scan_abort_and_wait();
@@ -149,7 +149,7 @@ void G1ConcurrentMarkThread::stop_service() {
 
 bool G1ConcurrentMarkThread::wait_for_next_cycle() {
   MonitorLocker ml(G1CGC_lock, Mutex::_no_safepoint_check_flag);
-  while (!in_progress() && !should_terminate()) {
+  while (!is_in_progress() && !should_terminate()) {
     ml.wait();
   }
 
diff --git a/src/hotspot/share/gc/g1/g1ConcurrentMarkThread.hpp b/src/hotspot/share/gc/g1/g1ConcurrentMarkThread.hpp
index 22be7d9ffbb..e75298fdcb4 100644
--- a/src/hotspot/share/gc/g1/g1ConcurrentMarkThread.hpp
+++ b/src/hotspot/share/gc/g1/g1ConcurrentMarkThread.hpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2001, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2001, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -32,25 +32,34 @@ class G1Policy;
 
 // The concurrent mark thread triggers the various steps of the concurrent marking
 // cycle, including various marking cleanup.
+//
+// The concurrent cycle may either be "Full" (i.e. include marking, rebuilding and
+// scrubbing, resetting for the next cycle) or "Undo", i.e. shortened to just the
+// reset part.
 class G1ConcurrentMarkThread: public ConcurrentGCThread {
   G1ConcurrentMark* _cm;
 
   enum ServiceState : uint {
     Idle,
-    FullMark,
-    UndoMark
+    FullCycleMarking,
+    FullCycleRebuildOrScrub,
+    FullCycleResetForNextCycle,
+    UndoCycleResetForNextCycle
   };
 
   volatile ServiceState _state;
 
+  // Returns whether we are in a "Full" cycle.
+  bool is_in_full_concurrent_cycle() const;
+
   // Wait for next cycle. Returns the command passed over.
   bool wait_for_next_cycle();
 
   bool mark_loop_needs_restart() const;
 
-  // Phases and subphases for the full concurrent marking cycle in order.
+  // Phases and subphases for the full concurrent cycle in order.
   //
-  // All these methods return true if the marking should be aborted.
+  // All these methods return true if the cycle should be aborted.
   bool phase_clear_cld_claimed_marks();
   bool phase_scan_root_regions();
 
@@ -88,22 +97,25 @@ class G1ConcurrentMarkThread: public ConcurrentGCThread {
   double total_mark_cpu_time_s();
   // Cpu time used by all marking worker threads in seconds.
   double worker_threads_cpu_time_s();
-
-  G1ConcurrentMark* cm() { return _cm; }
-
+  // State management.
   void set_idle();
-  void start_full_mark();
-  void start_undo_mark();
+  void start_full_cycle();
+  void start_undo_cycle();
 
-  bool idle() const;
+  void set_full_cycle_rebuild_and_scrub();
+  void set_full_cycle_reset_for_next_cycle();
+
+  bool is_idle() const;
   // Returns true from the moment a concurrent cycle is
-  // initiated (during the concurrent start pause when started() is set)
-  // to the moment when the cycle completes (just after the next
-  // marking bitmap has been cleared and in_progress() is
-  // cleared).
-  bool in_progress() const;
+  // initiated (during the concurrent start pause when calling one of the
+  // start_*_cycle() methods) to the moment when the cycle completes.
+  bool is_in_progress() const;
 
-  bool in_undo_mark() const;
+  bool is_in_marking() const;
+  bool is_in_rebuild_or_scrub() const;
+  bool is_in_reset_for_next_cycle() const;
+
+  bool is_in_undo_cycle() const;
 
   // Update the perf data counter for concurrent mark.
   void update_perf_counter_cpu_time();
diff --git a/src/hotspot/share/gc/g1/g1ConcurrentMarkThread.inline.hpp b/src/hotspot/share/gc/g1/g1ConcurrentMarkThread.inline.hpp
index e80c5023405..8cb7881e000 100644
--- a/src/hotspot/share/gc/g1/g1ConcurrentMarkThread.inline.hpp
+++ b/src/hotspot/share/gc/g1/g1ConcurrentMarkThread.inline.hpp
@@ -40,29 +40,64 @@ inline double G1ConcurrentMarkThread::worker_threads_cpu_time_s() {
   return _cm->worker_threads_cpu_time_s();
 }
 
+inline bool G1ConcurrentMarkThread::is_in_full_concurrent_cycle() const {
+  ServiceState state = _state;
+  return (state == FullCycleMarking || state == FullCycleRebuildOrScrub || state == FullCycleResetForNextCycle);
+}
+
 inline void G1ConcurrentMarkThread::set_idle() {
-  assert(_state == FullMark || _state == UndoMark, "must not be starting a new cycle");
+  // Concurrent cycle may be aborted any time.
+  assert(!is_idle(), "must not be idle");
   _state = Idle;
 }
 
-inline void G1ConcurrentMarkThread::start_full_mark() {
-  assert(_state == Idle, "cycle in progress");
-  _state = FullMark;
+inline void G1ConcurrentMarkThread::start_full_cycle() {
+  assert(SafepointSynchronize::is_at_safepoint(), "must be");
+  assert(is_idle(), "cycle in progress");
+  _state = FullCycleMarking;
 }
 
-inline void G1ConcurrentMarkThread::start_undo_mark() {
-  assert(_state == Idle, "cycle in progress");
-  _state = UndoMark;
+inline void G1ConcurrentMarkThread::start_undo_cycle() {
+  assert(SafepointSynchronize::is_at_safepoint(), "must be");
+  assert(is_idle(), "cycle in progress");
+  _state = UndoCycleResetForNextCycle;
 }
 
-inline bool G1ConcurrentMarkThread::idle() const { return _state == Idle; }
-
-inline bool G1ConcurrentMarkThread::in_progress() const {
-  return !idle();
+inline void G1ConcurrentMarkThread::set_full_cycle_rebuild_and_scrub() {
+  assert(SafepointSynchronize::is_at_safepoint(), "must be");
+  assert(_state == FullCycleMarking, "must be");
+  _state = FullCycleRebuildOrScrub;
 }
 
-inline bool G1ConcurrentMarkThread::in_undo_mark() const {
-  return _state == UndoMark;
+inline void G1ConcurrentMarkThread::set_full_cycle_reset_for_next_cycle() {
+  assert(SafepointSynchronize::is_at_safepoint(), "must be");
+  assert(_state == FullCycleRebuildOrScrub, "must be");
+  _state = FullCycleResetForNextCycle;
+}
+
+inline bool G1ConcurrentMarkThread::is_in_marking() const {
+  return _state == FullCycleMarking;
+}
+
+inline bool G1ConcurrentMarkThread::is_in_rebuild_or_scrub() const {
+  return _state == FullCycleRebuildOrScrub;
+}
+
+inline bool G1ConcurrentMarkThread::is_in_reset_for_next_cycle() const {
+  ServiceState state = _state;
+  return state == FullCycleResetForNextCycle || state == UndoCycleResetForNextCycle;
+}
+
+inline bool G1ConcurrentMarkThread::is_idle() const {
+  return _state == Idle;
+}
+
+inline bool G1ConcurrentMarkThread::is_in_progress() const {
+  return !is_idle();
+}
+
+inline bool G1ConcurrentMarkThread::is_in_undo_cycle() const {
+  return _state == UndoCycleResetForNextCycle;
 }
 
 #endif // SHARE_GC_G1_G1CONCURRENTMARKTHREAD_INLINE_HPP
diff --git a/src/hotspot/share/gc/g1/g1PeriodicGCTask.cpp b/src/hotspot/share/gc/g1/g1PeriodicGCTask.cpp
index f280d76f3c7..ee11bbd961f 100644
--- a/src/hotspot/share/gc/g1/g1PeriodicGCTask.cpp
+++ b/src/hotspot/share/gc/g1/g1PeriodicGCTask.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2020, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -38,8 +38,8 @@ bool G1PeriodicGCTask::should_start_periodic_gc(G1CollectedHeap* g1h,
   // Ensure no GC safepoints while we're doing the checks, to avoid data races.
   SuspendibleThreadSetJoiner sts;
 
-  // If we are currently in a concurrent mark we are going to uncommit memory soon.
-  if (g1h->concurrent_mark()->in_progress()) {
+  // If we are currently in a concurrent cycle we are going to uncommit memory soon.
+  if (g1h->collector_state()->is_in_concurrent_cycle()) {
     log_debug(gc, periodic)("Concurrent cycle in progress. Skipping.");
     return false;
   }
diff --git a/src/hotspot/share/gc/g1/g1Policy.cpp b/src/hotspot/share/gc/g1/g1Policy.cpp
index 98e6acc1d77..3c8b81bdb8f 100644
--- a/src/hotspot/share/gc/g1/g1Policy.cpp
+++ b/src/hotspot/share/gc/g1/g1Policy.cpp
@@ -579,9 +579,6 @@ void G1Policy::record_full_collection_end(size_t allocation_word_size) {
   collector_state()->set_in_young_gc_before_mixed(false);
   collector_state()->set_initiate_conc_mark_if_possible(need_to_start_conc_mark("end of Full GC", allocation_word_size));
   collector_state()->set_in_concurrent_start_gc(false);
-  collector_state()->set_mark_in_progress(false);
-  collector_state()->set_mark_or_rebuild_in_progress(false);
-  collector_state()->set_clear_bitmap_in_progress(false);
 
   _eden_surv_rate_group->start_adding_regions();
   // also call this on any additional surv rate groups
@@ -709,7 +706,6 @@ void G1Policy::record_concurrent_mark_remark_end() {
   double elapsed_time_ms = (end_time_sec - start_time_sec) * 1000.0;
   _analytics->report_concurrent_mark_remark_times_ms(elapsed_time_ms);
   record_pause(G1GCPauseType::Remark, start_time_sec, end_time_sec);
-  collector_state()->set_mark_in_progress(false);
 }
 
 G1CollectionSetCandidates* G1Policy::candidates() const {
@@ -739,7 +735,7 @@ double G1Policy::constant_other_time_ms(double pause_time_ms) const {
 }
 
 bool G1Policy::about_to_start_mixed_phase() const {
-  return _g1h->concurrent_mark()->in_progress() || collector_state()->in_young_gc_before_mixed();
+  return collector_state()->is_in_concurrent_cycle() || collector_state()->in_young_gc_before_mixed();
 }
 
 bool G1Policy::need_to_start_conc_mark(const char* source, size_t allocation_word_size) {
@@ -971,12 +967,8 @@ void G1Policy::record_young_collection_end(bool concurrent_operation_is_full_mar
 
   _eden_surv_rate_group->start_adding_regions();
 
-  assert(!(G1GCPauseTypeHelper::is_concurrent_start_pause(this_pause) && collector_state()->mark_or_rebuild_in_progress()),
-         "If the last pause has been concurrent start, we should not have been in the marking window");
-  if (G1GCPauseTypeHelper::is_concurrent_start_pause(this_pause)) {
-    collector_state()->set_mark_in_progress(concurrent_operation_is_full_mark);
-    collector_state()->set_mark_or_rebuild_in_progress(concurrent_operation_is_full_mark);
-  }
+  assert(!(G1GCPauseTypeHelper::is_concurrent_start_pause(this_pause) && collector_state()->is_in_concurrent_cycle()),
+         "If the last pause has been concurrent start, we should not have been in the marking cycle");
 
   _free_regions_at_end_of_collection = _g1h->num_free_regions();
 
@@ -1235,7 +1227,7 @@ bool G1Policy::force_concurrent_start_if_outside_cycle(GCCause::Cause gc_cause)
   // We actually check whether we are marking here and not if we are in a
   // reclamation phase. This means that we will schedule a concurrent mark
   // even while we are still in the process of reclaiming memory.
-  bool during_cycle = _g1h->concurrent_mark()->in_progress();
+  bool during_cycle = collector_state()->is_in_concurrent_cycle();
   if (!during_cycle) {
     log_debug(gc, ergo)("Request concurrent cycle initiation (requested by GC cause). "
                         "GC cause: %s",
@@ -1328,8 +1320,8 @@ void G1Policy::decide_on_concurrent_start_pause() {
   // We do not allow concurrent start to be piggy-backed on a mixed GC.
   assert(!collector_state()->in_concurrent_start_gc() ||
          collector_state()->in_young_only_phase(), "sanity");
-  // We also do not allow mixed GCs during marking.
-  assert(!collector_state()->mark_or_rebuild_in_progress() || collector_state()->in_young_only_phase(), "sanity");
+  // We also do not allow mixed GCs during marking/rebuilding.
+  assert(!collector_state()->is_in_mark_or_rebuild() || collector_state()->in_young_only_phase(), "sanity %d %d", collector_state()->is_in_concurrent_cycle(), collector_state()->in_young_only_phase());
 }
 
 void G1Policy::record_concurrent_mark_cleanup_end(bool has_rebuilt_remembered_sets) {
@@ -1349,8 +1341,6 @@ void G1Policy::record_concurrent_mark_cleanup_end(bool has_rebuilt_remembered_se
     log_debug(gc, ergo)("request young-only gcs (candidate old regions not available)");
   }
   collector_state()->set_in_young_gc_before_mixed(mixed_gc_pending);
-  collector_state()->set_mark_or_rebuild_in_progress(false);
-  collector_state()->set_clear_bitmap_in_progress(true);
 
   double end_sec = os::elapsedTime();
   double start_sec = cur_pause_start_sec();
diff --git a/src/hotspot/share/gc/g1/g1Policy.hpp b/src/hotspot/share/gc/g1/g1Policy.hpp
index 9513c79869e..ccbde31a465 100644
--- a/src/hotspot/share/gc/g1/g1Policy.hpp
+++ b/src/hotspot/share/gc/g1/g1Policy.hpp
@@ -115,7 +115,7 @@ class G1Policy: public CHeapObj<mtGC> {
   G1ConcurrentStartToMixedTimeTracker _concurrent_start_to_mixed;
 
   bool should_update_surv_rate_group_predictors() {
-    return collector_state()->in_young_only_phase() && !collector_state()->mark_or_rebuild_in_progress();
+    return collector_state()->in_young_only_phase() && !collector_state()->is_in_mark_or_rebuild();
   }
 
   double pending_cards_processing_time() const;
diff --git a/src/hotspot/share/gc/g1/g1RemSet.cpp b/src/hotspot/share/gc/g1/g1RemSet.cpp
index 0c9a0fad8f2..4b4a8a68c30 100644
--- a/src/hotspot/share/gc/g1/g1RemSet.cpp
+++ b/src/hotspot/share/gc/g1/g1RemSet.cpp
@@ -1026,7 +1026,7 @@ class G1MergeHeapRootsTask : public WorkerTask {
       // the pause occurs during the Concurrent Cleanup for Next Mark phase.
       // Only at that point the region's bitmap may contain marks while being in the collection
       // set at the same time.
-      return _g1h->collector_state()->clear_bitmap_in_progress() &&
+      return _g1h->collector_state()->is_in_reset_for_next_cycle() &&
              hr->is_old();
     }
 
diff --git a/src/hotspot/share/gc/g1/g1VMOperations.cpp b/src/hotspot/share/gc/g1/g1VMOperations.cpp
index 56ab3a4b0fe..f98f0b078f3 100644
--- a/src/hotspot/share/gc/g1/g1VMOperations.cpp
+++ b/src/hotspot/share/gc/g1/g1VMOperations.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2001, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2001, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -84,8 +84,9 @@ void VM_G1TryInitiateConcMark::doit() {
 
   GCCauseSetter x(g1h, _gc_cause);
 
-  _mark_in_progress = g1h->collector_state()->mark_in_progress();
-  _cycle_already_in_progress = g1h->concurrent_mark()->in_progress();
+  G1CollectorState* state = g1h->collector_state();
+  _mark_in_progress = state->is_in_marking();
+  _cycle_already_in_progress =  state->is_in_concurrent_cycle();
 
   if (!g1h->policy()->force_concurrent_start_if_outside_cycle(_gc_cause)) {
     // Failure to force the next GC pause to be a concurrent start indicates
@@ -166,11 +167,11 @@ void VM_G1PauseConcurrent::doit_epilogue() {
 }
 
 void VM_G1PauseRemark::work() {
-  G1CollectedHeap* g1h = G1CollectedHeap::heap();
-  g1h->concurrent_mark()->remark();
+  G1ConcurrentMark* cm = G1CollectedHeap::heap()->concurrent_mark();
+  cm->remark();
 }
 
 void VM_G1PauseCleanup::work() {
-  G1CollectedHeap* g1h = G1CollectedHeap::heap();
-  g1h->concurrent_mark()->cleanup();
+  G1ConcurrentMark* cm = G1CollectedHeap::heap()->concurrent_mark();
+  cm->cleanup();
 }
diff --git a/src/hotspot/share/gc/g1/g1YoungCollector.cpp b/src/hotspot/share/gc/g1/g1YoungCollector.cpp
index 71a76a2e48b..3fceb42b6d7 100644
--- a/src/hotspot/share/gc/g1/g1YoungCollector.cpp
+++ b/src/hotspot/share/gc/g1/g1YoungCollector.cpp
@@ -391,7 +391,7 @@ class G1PrepareEvacuationTask : public WorkerTask {
       if (!obj->is_typeArray()) {
         // All regions that were allocated before marking have a TAMS != bottom.
         bool allocated_before_mark_start = region->bottom() != _g1h->concurrent_mark()->top_at_mark_start(region);
-        bool mark_in_progress = _g1h->collector_state()->mark_in_progress();
+        bool mark_in_progress = _g1h->collector_state()->is_in_marking();
 
         if (allocated_before_mark_start && mark_in_progress) {
           return false;
diff --git a/src/hotspot/share/gc/g1/g1YoungGCAllocationFailureInjector.cpp b/src/hotspot/share/gc/g1/g1YoungGCAllocationFailureInjector.cpp
index 75cff2b339b..6ba72f6cde0 100644
--- a/src/hotspot/share/gc/g1/g1YoungGCAllocationFailureInjector.cpp
+++ b/src/hotspot/share/gc/g1/g1YoungGCAllocationFailureInjector.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2021, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2021, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -61,9 +61,9 @@ void G1YoungGCAllocationFailureInjector::select_allocation_failure_regions() {
 
 bool G1YoungGCAllocationFailureInjector::arm_if_needed_for_gc_type(bool for_young_only_phase,
                                                                    bool during_concurrent_start,
-                                                                   bool mark_or_rebuild_in_progress) {
+                                                                   bool in_concurrent_cycle) {
   bool res = false;
-  if (mark_or_rebuild_in_progress) {
+  if (in_concurrent_cycle) {
     res |= G1GCAllocationFailureALotDuringConcMark;
   }
   if (during_concurrent_start) {
@@ -91,12 +91,12 @@ void G1YoungGCAllocationFailureInjector::arm_if_needed() {
     G1CollectorState* collector_state = g1h->collector_state();
     const bool in_young_only_phase = collector_state->in_young_only_phase();
     const bool in_concurrent_start_gc = collector_state->in_concurrent_start_gc();
-    const bool mark_or_rebuild_in_progress = collector_state->mark_or_rebuild_in_progress();
+    const bool in_concurrent_cycle = collector_state->is_in_concurrent_cycle();
 
     _inject_allocation_failure_for_current_gc &=
       arm_if_needed_for_gc_type(in_young_only_phase,
                                 in_concurrent_start_gc,
-                                mark_or_rebuild_in_progress);
+                                in_concurrent_cycle);
 
     if (_inject_allocation_failure_for_current_gc) {
       select_allocation_failure_regions();
diff --git a/src/hotspot/share/gc/g1/g1YoungGCPostEvacuateTasks.cpp b/src/hotspot/share/gc/g1/g1YoungGCPostEvacuateTasks.cpp
index a0013d27172..769cc9a077c 100644
--- a/src/hotspot/share/gc/g1/g1YoungGCPostEvacuateTasks.cpp
+++ b/src/hotspot/share/gc/g1/g1YoungGCPostEvacuateTasks.cpp
@@ -395,7 +395,7 @@ public:
     {
       ResourceMark rm;
       bool allocated_after_mark_start = r->bottom() == _g1h->concurrent_mark()->top_at_mark_start(r);
-      bool mark_in_progress = _g1h->collector_state()->mark_in_progress();
+      bool mark_in_progress = _g1h->collector_state()->is_in_marking();
       guarantee(obj->is_typeArray() || (allocated_after_mark_start || !mark_in_progress),
                 "Only eagerly reclaiming primitive arrays is supported, other humongous objects only if allocated after mark start, but the object "
                 PTR_FORMAT " (%s) is not (mark %d allocated after mark: %d).",
diff --git a/src/hotspot/share/prims/whitebox.cpp b/src/hotspot/share/prims/whitebox.cpp
index 1a440584fe1..5df1461c0fd 100644
--- a/src/hotspot/share/prims/whitebox.cpp
+++ b/src/hotspot/share/prims/whitebox.cpp
@@ -578,7 +578,7 @@ WB_END
 WB_ENTRY(jboolean, WB_G1InConcurrentMark(JNIEnv* env, jobject o))
   if (UseG1GC) {
     G1CollectedHeap* g1h = G1CollectedHeap::heap();
-    return g1h->concurrent_mark()->in_progress();
+    return g1h->collector_state()->is_in_concurrent_cycle();
   }
   THROW_MSG_0(vmSymbols::java_lang_UnsupportedOperationException(), "WB_G1InConcurrentMark: G1 GC is not enabled");
 WB_END

From 75b2ee26804cf449ca3ab0580eb090817ab98eff Mon Sep 17 00:00:00 2001
From: Roland Westrelin <roland@openjdk.org>
Date: Thu, 19 Mar 2026 10:11:57 +0000
Subject: [PATCH 254/655] 8376591: TestLoopNestTooManyTraps fails with various
 stress flags

Reviewed-by: aseoane, qamai, dfenacci, syan
---
 test/hotspot/jtreg/ProblemList.txt                              | 2 --
 .../compiler/longcountedloops/TestLoopNestTooManyTraps.java     | 1 +
 2 files changed, 1 insertion(+), 2 deletions(-)

diff --git a/test/hotspot/jtreg/ProblemList.txt b/test/hotspot/jtreg/ProblemList.txt
index 5bb5bf54fba..a9211bed62e 100644
--- a/test/hotspot/jtreg/ProblemList.txt
+++ b/test/hotspot/jtreg/ProblemList.txt
@@ -81,8 +81,6 @@ compiler/interpreter/Test6833129.java 8335266 generic-i586
 
 compiler/c2/aarch64/TestStaticCallStub.java 8359963 linux-aarch64,macosx-aarch64
 
-compiler/longcountedloops/TestLoopNestTooManyTraps.java 8376591 generic-all
-
 compiler/unsafe/AlignmentGapAccess.java 8373487 generic-all
 
 #############################################################################
diff --git a/test/hotspot/jtreg/compiler/longcountedloops/TestLoopNestTooManyTraps.java b/test/hotspot/jtreg/compiler/longcountedloops/TestLoopNestTooManyTraps.java
index 502afc56548..c2008a2cccb 100644
--- a/test/hotspot/jtreg/compiler/longcountedloops/TestLoopNestTooManyTraps.java
+++ b/test/hotspot/jtreg/compiler/longcountedloops/TestLoopNestTooManyTraps.java
@@ -25,6 +25,7 @@
  * @test
  * @bug 8350330
  * @summary C2: PhaseIdealLoop::add_parse_predicate() should mirror GraphKit::add_parse_predicate()
+ * @requires vm.flagless
  * @library /test/lib /
  * @build jdk.test.whitebox.WhiteBox
  * @run driver jdk.test.lib.helpers.ClassFileInstaller jdk.test.whitebox.WhiteBox

From 1de03224b8d4924f052ef074d251621d58bf98e4 Mon Sep 17 00:00:00 2001
From: Ralf Schmelter <rschmelter@openjdk.org>
Date: Thu, 19 Mar 2026 12:28:17 +0000
Subject: [PATCH 255/655] 8378764: fileStream::fileSize() fails for >2GB files
 on Windows

Reviewed-by: stuefe, dholmes, amenkov
---
 src/hotspot/os/posix/os_posix.cpp       |  8 ++++++++
 src/hotspot/os/windows/os_windows.cpp   |  7 +++++++
 src/hotspot/share/runtime/os.hpp        |  2 ++
 src/hotspot/share/utilities/ostream.cpp | 12 ++++++------
 src/hotspot/share/utilities/ostream.hpp |  2 +-
 5 files changed, 24 insertions(+), 7 deletions(-)

diff --git a/src/hotspot/os/posix/os_posix.cpp b/src/hotspot/os/posix/os_posix.cpp
index f147ed4be93..1fb2a248bec 100644
--- a/src/hotspot/os/posix/os_posix.cpp
+++ b/src/hotspot/os/posix/os_posix.cpp
@@ -888,6 +888,14 @@ void* os::lookup_function(const char* name) {
   return dlsym(RTLD_DEFAULT, name);
 }
 
+int64_t os::ftell(FILE* file) {
+  return ::ftell(file);
+}
+
+int os::fseek(FILE* file, int64_t offset, int whence) {
+  return ::fseek(file, offset, whence);
+}
+
 jlong os::lseek(int fd, jlong offset, int whence) {
   return (jlong) ::lseek(fd, offset, whence);
 }
diff --git a/src/hotspot/os/windows/os_windows.cpp b/src/hotspot/os/windows/os_windows.cpp
index 01162ef930d..18d047348cb 100644
--- a/src/hotspot/os/windows/os_windows.cpp
+++ b/src/hotspot/os/windows/os_windows.cpp
@@ -5114,6 +5114,13 @@ jlong os::seek_to_file_offset(int fd, jlong offset) {
   return (jlong)::_lseeki64(fd, (__int64)offset, SEEK_SET);
 }
 
+int64_t os::ftell(FILE* file) {
+  return ::_ftelli64(file);
+}
+
+int os::fseek(FILE* file, int64_t offset, int whence) {
+  return ::_fseeki64(file,offset, whence);
+}
 
 jlong os::lseek(int fd, jlong offset, int whence) {
   return (jlong) ::_lseeki64(fd, offset, whence);
diff --git a/src/hotspot/share/runtime/os.hpp b/src/hotspot/share/runtime/os.hpp
index 76041f256a9..c883b828456 100644
--- a/src/hotspot/share/runtime/os.hpp
+++ b/src/hotspot/share/runtime/os.hpp
@@ -721,6 +721,8 @@ class os: AllStatic {
   static int open(const char *path, int oflag, int mode);
   static FILE* fdopen(int fd, const char* mode);
   static FILE* fopen(const char* path, const char* mode);
+  static int64_t ftell(FILE* file);
+  static int fseek(FILE* file, int64_t offset, int whence);
   static jlong lseek(int fd, jlong offset, int whence);
   static bool file_exists(const char* file);
 
diff --git a/src/hotspot/share/utilities/ostream.cpp b/src/hotspot/share/utilities/ostream.cpp
index 5e339a700cb..ded233d48bf 100644
--- a/src/hotspot/share/utilities/ostream.cpp
+++ b/src/hotspot/share/utilities/ostream.cpp
@@ -611,15 +611,15 @@ void fileStream::write(const char* s, size_t len) {
   }
 }
 
-long fileStream::fileSize() {
-  long size = -1;
+int64_t fileStream::fileSize() {
+  int64_t size = -1;
   if (_file != nullptr) {
-    long pos = ::ftell(_file);
+    int64_t pos = os::ftell(_file);
     if (pos < 0) return pos;
-    if (::fseek(_file, 0, SEEK_END) == 0) {
-      size = ::ftell(_file);
+    if (os::fseek(_file, 0, SEEK_END) == 0) {
+      size = os::ftell(_file);
     }
-    ::fseek(_file, pos, SEEK_SET);
+    os::fseek(_file, pos, SEEK_SET);
   }
   return size;
 }
diff --git a/src/hotspot/share/utilities/ostream.hpp b/src/hotspot/share/utilities/ostream.hpp
index e971ac4d125..c3a4026f4d9 100644
--- a/src/hotspot/share/utilities/ostream.hpp
+++ b/src/hotspot/share/utilities/ostream.hpp
@@ -312,7 +312,7 @@ class fileStream : public outputStream {
     fclose(_file);
     _need_close = false;
   }
-  long fileSize();
+  int64_t fileSize();
   void flush();
 };
 

From 4e9b35f9e8771e18352c7dfd3e3bc85f1811f617 Mon Sep 17 00:00:00 2001
From: Zhengyu Gu <zgu@openjdk.org>
Date: Thu, 19 Mar 2026 12:38:08 +0000
Subject: [PATCH 256/655] 8323792: ThreadSnapshot::initialize can cause assert
 in Thread::check_for_dangling_thread_pointer (possibility of dangling Thread
 pointer)

Co-authored-by: Kevin Walls <kevinw@openjdk.org>
Reviewed-by: dholmes
---
 src/hotspot/share/runtime/threadSMR.cpp       |   7 +-
 src/hotspot/share/runtime/threads.cpp         |   2 +-
 src/hotspot/share/services/management.cpp     |   3 +-
 src/hotspot/share/services/threadIdTable.cpp  |  24 +--
 src/hotspot/share/services/threadIdTable.hpp  |   9 +-
 .../threads/ThreadInfoTest.java               | 187 ++++++++++++++++++
 6 files changed, 213 insertions(+), 19 deletions(-)
 create mode 100644 test/hotspot/jtreg/serviceability/threads/ThreadInfoTest.java

diff --git a/src/hotspot/share/runtime/threadSMR.cpp b/src/hotspot/share/runtime/threadSMR.cpp
index 418f7707118..4c68648fec8 100644
--- a/src/hotspot/share/runtime/threadSMR.cpp
+++ b/src/hotspot/share/runtime/threadSMR.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2017, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2017, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -726,7 +726,8 @@ JavaThread* ThreadsList::find_JavaThread_from_java_tid(jlong java_tid) const {
         }
       }
     }
-  } else if (!thread->is_exiting()) {
+  } else if (includes(thread) && !thread->is_exiting()) {
+    // The thread is protected by this list and has not yet exited
     return thread;
   }
   return nullptr;
@@ -883,7 +884,7 @@ void ThreadsSMRSupport::add_thread(JavaThread *thread){
 
   ThreadsList *old_list = xchg_java_thread_list(new_list);
   free_list(old_list);
-  if (ThreadIdTable::is_initialized()) {
+  if (ThreadIdTable::is_initialized_acquire()) {
     jlong tid = SharedRuntime::get_java_tid(thread);
     ThreadIdTable::add_thread(tid, thread);
   }
diff --git a/src/hotspot/share/runtime/threads.cpp b/src/hotspot/share/runtime/threads.cpp
index f7f755a37b3..442b68e596a 100644
--- a/src/hotspot/share/runtime/threads.cpp
+++ b/src/hotspot/share/runtime/threads.cpp
@@ -1127,7 +1127,7 @@ void Threads::remove(JavaThread* p, bool is_daemon) {
     ConditionalMutexLocker throttle_ml(ThreadsLockThrottle_lock, UseThreadsLockThrottleLock);
     MonitorLocker ml(Threads_lock);
 
-    if (ThreadIdTable::is_initialized()) {
+    if (ThreadIdTable::is_initialized_acquire()) {
       // This cleanup must be done before the current thread's GC barrier
       // is detached since we need to touch the threadObj oop.
       jlong tid = SharedRuntime::get_java_tid(p);
diff --git a/src/hotspot/share/services/management.cpp b/src/hotspot/share/services/management.cpp
index 09277e16479..664fb5a8ef3 100644
--- a/src/hotspot/share/services/management.cpp
+++ b/src/hotspot/share/services/management.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -1146,6 +1146,7 @@ JVM_ENTRY(jint, jmm_GetThreadInfo(JNIEnv *env, jlongArray ids, jint maxDepth, jo
         // create dummy snapshot
         dump_result.add_thread_snapshot();
       } else {
+        assert(dump_result.t_list()->includes(jt), "Must be protected");
         dump_result.add_thread_snapshot(jt);
       }
     }
diff --git a/src/hotspot/share/services/threadIdTable.cpp b/src/hotspot/share/services/threadIdTable.cpp
index 1604927a0ac..d5141441ccd 100644
--- a/src/hotspot/share/services/threadIdTable.cpp
+++ b/src/hotspot/share/services/threadIdTable.cpp
@@ -1,5 +1,5 @@
 /*
-* Copyright (c) 2019, 2025, Oracle and/or its affiliates. All rights reserved.
+* Copyright (c) 2019, 2026, Oracle and/or its affiliates. All rights reserved.
 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
 *
 * This code is free software; you can redistribute it and/or modify it
@@ -23,7 +23,6 @@
 */
 
 #include "classfile/javaClasses.inline.hpp"
-#include "runtime/atomicAccess.hpp"
 #include "runtime/interfaceSupport.inline.hpp"
 #include "runtime/javaThread.inline.hpp"
 #include "runtime/threadSMR.hpp"
@@ -44,7 +43,7 @@ static ThreadIdTableHash* volatile _local_table = nullptr;
 static volatile size_t _current_size = 0;
 static volatile size_t _items_count = 0;
 
-volatile bool ThreadIdTable::_is_initialized = false;
+Atomic<bool> ThreadIdTable::_is_initialized {false};
 volatile bool ThreadIdTable::_has_work = false;
 
 class ThreadIdTableEntry : public CHeapObj<mtInternal> {
@@ -81,24 +80,25 @@ class ThreadIdTableConfig : public AllStatic {
 // Lazily creates the table and populates it with the given
 // thread list
 void ThreadIdTable::lazy_initialize(const ThreadsList *threads) {
-  if (!_is_initialized) {
+  if (!_is_initialized.load_acquire()) {
     {
       // There is no obvious benefit in allowing the thread table
       // to be concurrently populated during initialization.
       MutexLocker ml(ThreadIdTableCreate_lock);
-      if (_is_initialized) {
+      if (_is_initialized.load_relaxed()) {
         return;
       }
       create_table(threads->length());
-      _is_initialized = true;
+      _is_initialized.release_store(true);
     }
+
     for (uint i = 0; i < threads->length(); i++) {
       JavaThread* thread = threads->thread_at(i);
       oop tobj = thread->threadObj();
       if (tobj != nullptr) {
-        jlong java_tid = java_lang_Thread::thread_id(tobj);
         MutexLocker ml(Threads_lock);
         if (!thread->is_exiting()) {
+          jlong java_tid = java_lang_Thread::thread_id(tobj);
           // Must be inside the lock to ensure that we don't add a thread to the table
           // that has just passed the removal point in Threads::remove().
           add_thread(java_tid, thread);
@@ -211,7 +211,7 @@ public:
 };
 
 void ThreadIdTable::do_concurrent_work(JavaThread* jt) {
-  assert(_is_initialized, "Thread table is not initialized");
+  assert(_is_initialized.load_relaxed(), "Thread table is not initialized");
   _has_work = false;
   double load_factor = get_load_factor();
   log_debug(thread, table)("Concurrent work, load factor: %g", load_factor);
@@ -221,7 +221,8 @@ void ThreadIdTable::do_concurrent_work(JavaThread* jt) {
 }
 
 JavaThread* ThreadIdTable::add_thread(jlong tid, JavaThread* java_thread) {
-  assert(_is_initialized, "Thread table is not initialized");
+  assert(Threads_lock->owned_by_self(), "Must hold Threads_lock");
+  assert(_is_initialized.load_relaxed(), "Thread table is not initialized");
   Thread* thread = Thread::current();
   ThreadIdTableLookup lookup(tid);
   ThreadGet tg;
@@ -240,7 +241,7 @@ JavaThread* ThreadIdTable::add_thread(jlong tid, JavaThread* java_thread) {
 }
 
 JavaThread* ThreadIdTable::find_thread_by_tid(jlong tid) {
-  assert(_is_initialized, "Thread table is not initialized");
+  assert(_is_initialized.load_relaxed(), "Thread table is not initialized");
   Thread* thread = Thread::current();
   ThreadIdTableLookup lookup(tid);
   ThreadGet tg;
@@ -249,7 +250,8 @@ JavaThread* ThreadIdTable::find_thread_by_tid(jlong tid) {
 }
 
 bool ThreadIdTable::remove_thread(jlong tid) {
-  assert(_is_initialized, "Thread table is not initialized");
+  assert(Threads_lock->owned_by_self(), "Must hold Threads_lock");
+  assert(_is_initialized.load_relaxed(), "Thread table is not initialized");
   Thread* thread = Thread::current();
   ThreadIdTableLookup lookup(tid);
   return _local_table->remove(thread, lookup);
diff --git a/src/hotspot/share/services/threadIdTable.hpp b/src/hotspot/share/services/threadIdTable.hpp
index 15dfb89d670..256484cce2d 100644
--- a/src/hotspot/share/services/threadIdTable.hpp
+++ b/src/hotspot/share/services/threadIdTable.hpp
@@ -1,5 +1,5 @@
 /*
-* Copyright (c) 2019, 2025, Oracle and/or its affiliates. All rights reserved.
+* Copyright (c) 2019, 2026, Oracle and/or its affiliates. All rights reserved.
 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
 *
 * This code is free software; you can redistribute it and/or modify it
@@ -26,6 +26,7 @@
 #define SHARE_SERVICES_THREADIDTABLE_HPP
 
 #include "memory/allStatic.hpp"
+#include "runtime/atomic.hpp"
 
 class JavaThread;
 class ThreadsList;
@@ -34,13 +35,15 @@ class ThreadIdTableConfig;
 class ThreadIdTable : public AllStatic {
   friend class ThreadIdTableConfig;
 
-  static volatile bool _is_initialized;
+  static Atomic<bool> _is_initialized;
   static volatile bool _has_work;
 
 public:
   // Initialization
   static void lazy_initialize(const ThreadsList* threads);
-  static bool is_initialized() { return _is_initialized; }
+  static bool is_initialized_acquire() {
+    return _is_initialized.load_acquire();
+  }
 
   // Lookup and list management
   static JavaThread* find_thread_by_tid(jlong tid);
diff --git a/test/hotspot/jtreg/serviceability/threads/ThreadInfoTest.java b/test/hotspot/jtreg/serviceability/threads/ThreadInfoTest.java
new file mode 100644
index 00000000000..b5db455cc20
--- /dev/null
+++ b/test/hotspot/jtreg/serviceability/threads/ThreadInfoTest.java
@@ -0,0 +1,187 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+import jdk.test.lib.Utils;
+
+import java.lang.management.ManagementFactory;
+import java.lang.management.ThreadInfo;
+import java.lang.management.ThreadMXBean;
+
+import java.util.ArrayList;
+import java.util.List;
+
+/*
+ * @test
+ * @bug 8323792
+ * @summary Make sure that jmm_GetThreadInfo() call does not crash JVM
+ * @library /test/lib
+ * @modules java.management
+ * @run main/othervm ThreadInfoTest
+ *
+ * @comment Exercise getThreadInfo(ids, 0).  Depth parameter of zero means
+ * no VM operation, which could crash with Threads starting and ending.
+ */
+
+public class ThreadInfoTest {
+    private static com.sun.management.ThreadMXBean mbean =
+        (com.sun.management.ThreadMXBean)ManagementFactory.getThreadMXBean();
+
+    private static final int NUM_THREADS = 2;
+    static long[] ids = new long[NUM_THREADS];
+    static ThreadInfo[] infos = new ThreadInfo[NUM_THREADS];
+    static volatile int count = 0;
+    static int ITERATIONS = 4;
+
+    public static void main(String[] argv) throws Exception {
+        boolean replacing = false;
+
+        startThreads(ids, NUM_THREADS);
+        new MyGetThreadInfoThread(ids).start();
+        new MyReplacerThread(ids).start();
+        for (int i = 0; i < ITERATIONS; i++) {
+            do {
+                count = countInfo(infos);
+                System.out.println("Iteration " + i + ": ThreadInfos found (Threads alive): " + count);
+                goSleep(100);
+            } while (count > 0);
+        }
+    }
+
+    private static Thread newThread(int i) {
+        Thread thread = new MyThread(i);
+        thread.setDaemon(true);
+        return thread;
+    }
+
+   private static void startThreads(long[] ids, int count) {
+        System.out.println("Starting " + count + " Threads...");
+        Thread[] threads = new Thread[count];
+        for (int i = 0; i < count; i++) {
+            threads[i] = newThread(i);
+            threads[i].start();
+            ids[i] = threads[i].getId();
+        }
+        System.out.println(ids);
+    }
+
+    // Count ThreadInfo from array, return how many are non-null.
+    private static int countInfo(ThreadInfo[] info) {
+        int count = 0;
+        if (info != null) {
+            int i = 0;
+            for (ThreadInfo ti: info) {
+                if (ti != null) {
+                    count++;
+                }
+                i++;
+            }
+        }
+        return count;
+    }
+
+    private static int replaceThreads(long[] ids, ThreadInfo[] info) {
+        int replaced = 0;
+        if (info != null) {
+            for (int i = 0; i < info.length; i++) {
+                ThreadInfo ti = info[i];
+                if (ti == null) {
+                    Thread thread = newThread(i);
+                    thread.start();
+                    ids[i] = thread.getId();
+                    replaced++;
+                }
+            }
+        }
+        return replaced;
+    }
+
+    private static void goSleep(long ms) {
+        try {
+            Thread.sleep(ms);
+        } catch (InterruptedException e) {
+            System.out.println("Unexpected exception is thrown: " + e);
+        }
+    }
+
+    // A Thread which replaces Threads in the shared array of threads.
+    static class MyReplacerThread extends Thread {
+        long[] ids;
+
+        public MyReplacerThread(long[] ids) {
+            this.ids = ids;
+            this.setDaemon(true);
+        }
+
+        public void run() {
+            boolean replacing = false;
+            while (true) {
+                if (replacing) {
+                    replaceThreads(ids, infos);
+                }
+                if (count < 10) {
+                    replacing = true;
+                }
+                if (count > 20) {
+                    replacing = false;
+                }
+                goSleep(1);
+            }
+        }
+    }
+
+    // A Thread which lives for a short while.
+    static class MyThread extends Thread {
+        long endTimeMs;
+
+        public MyThread(long n) {
+            super("MyThread-" + n);
+            endTimeMs = (n * n * 10) + System.currentTimeMillis();
+        }
+
+        public void run() {
+            try {
+                long sleep = Math.max(1, endTimeMs - System.currentTimeMillis());
+                goSleep(sleep);
+            } catch (Exception e) {
+                System.out.println(Thread.currentThread().getName() + ": " + e);
+            }
+        }
+    }
+
+    // A Thread to continually call getThreadInfo on a shared array of thread ids.
+    static class MyGetThreadInfoThread extends Thread {
+        long[] ids;
+
+        public MyGetThreadInfoThread(long[] ids) {
+            this.ids = ids;
+            this.setDaemon(true);
+        }
+
+        public void run() {
+            while (true) {
+                infos = mbean.getThreadInfo(ids, 0);
+                goSleep(10);
+            }
+        }
+    }
+}

From 347aae6428358e79a9463b04654f3eaf83450595 Mon Sep 17 00:00:00 2001
From: Thomas Stuefe <stuefe@openjdk.org>
Date: Thu, 19 Mar 2026 12:40:50 +0000
Subject: [PATCH 257/655] 8380011: Path-to-gcroots search should not trigger
 stack overflows

Reviewed-by: egahlin
---
 .../jfr/leakprofiler/chains/dfsClosure.cpp    |  23 +++-
 .../jfr/leakprofiler/chains/dfsClosure.hpp    |   3 +
 test/jdk/TEST.groups                          |   1 +
 .../jdk/jfr/event/oldobject/OldObjects.java   |  14 ++-
 .../oldobject/TestDFSWithSmallStack.java      | 101 ++++++++++++++++++
 5 files changed, 139 insertions(+), 3 deletions(-)
 create mode 100644 test/jdk/jdk/jfr/event/oldobject/TestDFSWithSmallStack.java

diff --git a/src/hotspot/share/jfr/leakprofiler/chains/dfsClosure.cpp b/src/hotspot/share/jfr/leakprofiler/chains/dfsClosure.cpp
index 83eee96091e..8b5819e92c4 100644
--- a/src/hotspot/share/jfr/leakprofiler/chains/dfsClosure.cpp
+++ b/src/hotspot/share/jfr/leakprofiler/chains/dfsClosure.cpp
@@ -34,6 +34,7 @@
 #include "memory/resourceArea.hpp"
 #include "oops/access.inline.hpp"
 #include "oops/oop.inline.hpp"
+#include "runtime/os.hpp"
 #include "utilities/align.hpp"
 
 UnifiedOopRef DFSClosure::_reference_stack[max_dfs_depth];
@@ -67,9 +68,27 @@ void DFSClosure::find_leaks_from_root_set(EdgeStore* edge_store,
   rs.process();
 }
 
+static address calculate_headroom_limit() {
+  static constexpr size_t required_headroom = K * 64;
+  const Thread* const t = Thread::current_or_null();
+  return t->stack_end() + required_headroom;
+}
+
 DFSClosure::DFSClosure(EdgeStore* edge_store, JFRBitSet* mark_bits, const Edge* start_edge)
   :_edge_store(edge_store), _mark_bits(mark_bits), _start_edge(start_edge),
-  _max_depth(max_dfs_depth), _depth(0), _ignore_root_set(false) {
+  _max_depth(max_dfs_depth), _depth(0), _ignore_root_set(false),
+  _headroom_limit(calculate_headroom_limit()) {
+}
+
+bool DFSClosure::have_headroom() const {
+  const address sp = (address) os::current_stack_pointer();
+#ifdef ASSERT
+  const Thread* const t = Thread::current_or_null();
+  assert(t->is_VM_thread(), "invariant");
+  assert(t->is_in_full_stack(_headroom_limit), "invariant");
+  assert(t->is_in_full_stack(sp), "invariant");
+#endif
+  return sp > _headroom_limit;
 }
 
 void DFSClosure::closure_impl(UnifiedOopRef reference, const oop pointee) {
@@ -97,7 +116,7 @@ void DFSClosure::closure_impl(UnifiedOopRef reference, const oop pointee) {
     }
   }
   assert(_max_depth >= 1, "invariant");
-  if (_depth < _max_depth - 1) {
+  if (_depth < _max_depth - 1 && have_headroom()) {
     _depth++;
     pointee->oop_iterate(this);
     assert(_depth > 0, "invariant");
diff --git a/src/hotspot/share/jfr/leakprofiler/chains/dfsClosure.hpp b/src/hotspot/share/jfr/leakprofiler/chains/dfsClosure.hpp
index 98364690422..9ee15ff07e0 100644
--- a/src/hotspot/share/jfr/leakprofiler/chains/dfsClosure.hpp
+++ b/src/hotspot/share/jfr/leakprofiler/chains/dfsClosure.hpp
@@ -46,12 +46,15 @@ class DFSClosure : public BasicOopIterateClosure {
   size_t _max_depth;
   size_t _depth;
   bool _ignore_root_set;
+  const address _headroom_limit;
 
   DFSClosure(EdgeStore* edge_store, JFRBitSet* mark_bits, const Edge* start_edge);
 
   void add_chain();
   void closure_impl(UnifiedOopRef reference, const oop pointee);
 
+  bool have_headroom() const;
+
  public:
   virtual ReferenceIterationMode reference_iteration_mode() { return DO_FIELDS_EXCEPT_REFERENT; }
 
diff --git a/test/jdk/TEST.groups b/test/jdk/TEST.groups
index ccf745700d1..2bff07b8a55 100644
--- a/test/jdk/TEST.groups
+++ b/test/jdk/TEST.groups
@@ -558,6 +558,7 @@ jdk_jfr_sanity = \
     jdk/jfr/event/gc/collection/TestGCWithFasttime.java \
     jdk/jfr/event/gc/configuration/TestGCConfigurationEvent.java \
     jdk/jfr/event/metadata/TestDefaultConfigurations.java \
+    jdk/jfr/event/oldobject/TestDFSWithSmallStack.java \
     jdk/jfr/startupargs/TestDumpOnExit.java \
     jdk/jfr/api/consumer/recordingstream/TestBasics.java
 
diff --git a/test/jdk/jdk/jfr/event/oldobject/OldObjects.java b/test/jdk/jdk/jfr/event/oldobject/OldObjects.java
index ba90bb10a9e..bb0ca27836e 100644
--- a/test/jdk/jdk/jfr/event/oldobject/OldObjects.java
+++ b/test/jdk/jdk/jfr/event/oldobject/OldObjects.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2015, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2015, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -276,4 +276,16 @@ final public class OldObjects {
             throw new RuntimeException("Reference chain max length not respected. Found a chain of length " + length);
         }
     }
+
+    public static int countChains(List<RecordedEvent> events) throws IOException {
+        int found = 0;
+        for (RecordedEvent e : events) {
+            RecordedObject ro = e.getValue("object");
+            if (ro.getValue("referrer") != null) {
+                found++;
+            }
+        }
+        System.out.println("Found chains: " + found);
+        return found;
+    }
 }
diff --git a/test/jdk/jdk/jfr/event/oldobject/TestDFSWithSmallStack.java b/test/jdk/jdk/jfr/event/oldobject/TestDFSWithSmallStack.java
new file mode 100644
index 00000000000..d25a6cd5f67
--- /dev/null
+++ b/test/jdk/jdk/jfr/event/oldobject/TestDFSWithSmallStack.java
@@ -0,0 +1,101 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2026, IBM Corp.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+package jdk.jfr.event.oldobject;
+
+import java.util.LinkedList;
+import java.util.List;
+
+import jdk.jfr.Recording;
+import jdk.jfr.consumer.RecordedEvent;
+import jdk.jfr.internal.test.WhiteBox;
+import jdk.test.lib.jfr.EventNames;
+import jdk.test.lib.jfr.Events;
+
+/**
+ * @test id=dfsonly
+ * @summary Tests that DFS works with a small stack
+ * @library /test/lib /test/jdk
+ * @requires vm.hasJFR
+ * @modules jdk.jfr/jdk.jfr.internal.test
+ * @run main/othervm -Xmx2g -XX:VMThreadStackSize=512 jdk.jfr.event.oldobject.TestDFSWithSmallStack dfsonly
+ */
+
+/**
+ * @test id=bfsdfs
+ * @summary Tests that DFS works with a small stack
+ * @library /test/lib /test/jdk
+ * @requires vm.hasJFR
+ * @modules jdk.jfr/jdk.jfr.internal.test
+ * @run main/othervm -Xmx2g -XX:VMThreadStackSize=512 jdk.jfr.event.oldobject.TestDFSWithSmallStack bfsdfs
+ */
+public class TestDFSWithSmallStack {
+
+    // Tests depth first search with a small stack.
+
+    // An non-zero exit code, together with a missing hs-err file or possibly a missing jfr file,
+    // indicates a native stack overflow happened and is a fail condition for this test.
+
+    // We build up an array of linked lists, each containing enough entries for DFS search to
+    // max out max_dfs_depth (but not greatly surpass it).
+
+    private static final int TOTAL_OBJECTS = 10_000_000;
+    private static final int OBJECTS_PER_LIST = 5_000;
+    public static LinkedList<Object>[] leak;
+
+    public static void main(String... args) throws Exception {
+
+        switch (args[0]) {
+            case "dfsonly" -> WhiteBox.setSkipBFS(true);
+            case "bfsdfs" -> {} /* ignored */
+            default -> throw new RuntimeException("Invalid argument");
+        }
+
+        WhiteBox.setWriteAllObjectSamples(true);
+        int count = 10;
+
+        while (count > 0) {
+            try (Recording r = new Recording()) {
+                r.enable(EventNames.OldObjectSample).with("cutoff", "infinity");
+                r.start();
+                leak = new LinkedList[TOTAL_OBJECTS / OBJECTS_PER_LIST];
+                for (int i = 0; i < leak.length; i++) {
+                    leak[i] = new LinkedList<Object>();
+                    for (int j = 0; j < OBJECTS_PER_LIST; j++) {
+                        leak[i].add(new Object());
+                    }
+                }
+                System.gc();
+                r.stop();
+                List<RecordedEvent> events = Events.fromRecording(r);
+                Events.hasEvents(events);
+                if (OldObjects.countChains(events) >= 30) {
+                    return;
+                }
+                System.out.println("Not enough chains found, retrying.");
+            }
+            count--;
+            leak = null;
+        }
+    }
+}

From 3ad532135e47544c202e0f2f8e1df638da6fb20c Mon Sep 17 00:00:00 2001
From: Kim Barrett <kbarrett@openjdk.org>
Date: Thu, 19 Mar 2026 14:47:35 +0000
Subject: [PATCH 258/655] 8380150: JavaCallArguments defined too late

Reviewed-by: stefank, ayang
---
 src/hotspot/os_cpu/bsd_zero/atomicAccess_bsd_zero.hpp | 3 +--
 1 file changed, 1 insertion(+), 2 deletions(-)

diff --git a/src/hotspot/os_cpu/bsd_zero/atomicAccess_bsd_zero.hpp b/src/hotspot/os_cpu/bsd_zero/atomicAccess_bsd_zero.hpp
index 6c8684718fc..8e45490e5b6 100644
--- a/src/hotspot/os_cpu/bsd_zero/atomicAccess_bsd_zero.hpp
+++ b/src/hotspot/os_cpu/bsd_zero/atomicAccess_bsd_zero.hpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * Copyright 2007, 2008, 2011, 2015, Red Hat, Inc.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
@@ -27,7 +27,6 @@
 #define OS_CPU_BSD_ZERO_ATOMICACCESS_BSD_ZERO_HPP
 
 #include "orderAccess_bsd_zero.hpp"
-#include "runtime/os.hpp"
 
 // Implementation of class AtomicAccess
 

From c715a45431968d328cf01995607110f27515cb41 Mon Sep 17 00:00:00 2001
From: Leo Korinth <lkorinth@openjdk.org>
Date: Thu, 19 Mar 2026 14:56:53 +0000
Subject: [PATCH 259/655] 8380298: Rename _pagesizes and
 _pre_allocated_pagesizes in hugepages.cpp

Reviewed-by: stefank, iwalulya, jsikstro
---
 src/hotspot/os/linux/hugepages.cpp | 18 +++++++++---------
 src/hotspot/os/linux/hugepages.hpp |  8 ++++----
 src/hotspot/os/linux/os_linux.cpp  | 28 +++++++++++++---------------
 3 files changed, 26 insertions(+), 28 deletions(-)

diff --git a/src/hotspot/os/linux/hugepages.cpp b/src/hotspot/os/linux/hugepages.cpp
index a78f355c179..1340c470dff 100644
--- a/src/hotspot/os/linux/hugepages.cpp
+++ b/src/hotspot/os/linux/hugepages.cpp
@@ -35,16 +35,16 @@
 #include <dirent.h>
 
 ExplicitHugePageSupport::ExplicitHugePageSupport() :
-  _initialized(false), _pagesizes(), _pre_allocated_pagesizes(), _default_hugepage_size(SIZE_MAX), _inconsistent(false) {}
+  _initialized{false}, _os_supported{}, _pre_allocated{}, _default_hugepage_size{SIZE_MAX}, _inconsistent{false} {}
 
-os::PageSizes ExplicitHugePageSupport::pagesizes() const {
+os::PageSizes ExplicitHugePageSupport::os_supported() const {
   assert(_initialized, "Not initialized");
-  return _pagesizes;
+  return _os_supported;
 }
 
-os::PageSizes ExplicitHugePageSupport::pre_allocated_pagesizes() const {
+os::PageSizes ExplicitHugePageSupport::pre_allocated() const {
   assert(_initialized, "Not initialized");
-  return _pre_allocated_pagesizes;
+  return _pre_allocated;
 }
 
 size_t ExplicitHugePageSupport::default_hugepage_size() const {
@@ -151,7 +151,7 @@ static os::PageSizes filter_pre_allocated_hugepages(os::PageSizes pagesizes) {
 void ExplicitHugePageSupport::print_on(outputStream* os) {
   if (_initialized) {
     os->print_cr("Explicit hugepage support:");
-    for (size_t s = _pagesizes.smallest(); s != 0; s = _pagesizes.next_larger(s)) {
+    for (size_t s = _os_supported.smallest(); s != 0; s = _os_supported.next_larger(s)) {
       os->print_cr("  hugepage size: " EXACTFMT, EXACTFMTARGS(s));
     }
     os->print_cr("  default hugepage size: " EXACTFMT, EXACTFMTARGS(_default_hugepage_size));
@@ -166,13 +166,13 @@ void ExplicitHugePageSupport::print_on(outputStream* os) {
 void ExplicitHugePageSupport::scan_os() {
   _default_hugepage_size = scan_default_hugepagesize();
   if (_default_hugepage_size > 0) {
-    _pagesizes = scan_hugepages();
-    _pre_allocated_pagesizes = filter_pre_allocated_hugepages(_pagesizes);
+    _os_supported = scan_hugepages();
+    _pre_allocated = filter_pre_allocated_hugepages(_os_supported);
     // See https://www.kernel.org/doc/Documentation/vm/hugetlbpage.txt: /proc/meminfo should match
     // /sys/kernel/mm/hugepages/hugepages-xxxx. However, we may run on a broken kernel (e.g. on WSL)
     // that only exposes /proc/meminfo but not /sys/kernel/mm/hugepages. In that case, we are not
     // sure about the state of hugepage support by the kernel, so we won't use explicit hugepages.
-    if (!_pagesizes.contains(_default_hugepage_size)) {
+    if (!_os_supported.contains(_default_hugepage_size)) {
       log_info(pagesize)("Unexpected configuration: default pagesize (%zu) "
                          "has no associated directory in /sys/kernel/mm/hugepages.", _default_hugepage_size);
       _inconsistent = true;
diff --git a/src/hotspot/os/linux/hugepages.hpp b/src/hotspot/os/linux/hugepages.hpp
index 5c190feae97..5a9767b4ff8 100644
--- a/src/hotspot/os/linux/hugepages.hpp
+++ b/src/hotspot/os/linux/hugepages.hpp
@@ -45,10 +45,10 @@ class ExplicitHugePageSupport {
 
   // All supported hugepage sizes (sizes for which entries exist
   // in /sys/kernel/mm/hugepages/hugepage-xxx)
-  os::PageSizes _pagesizes;
+  os::PageSizes _os_supported;
 
   // Above pages filtered for where the contents of file nr_hugepages was larger than zero
-  os::PageSizes _pre_allocated_pagesizes;
+  os::PageSizes _pre_allocated;
 
   // Contains the default hugepage. The "default hugepage size" is the one that
   // - is marked in /proc/meminfo as "Hugepagesize"
@@ -63,8 +63,8 @@ public:
 
   void scan_os();
 
-  os::PageSizes pagesizes() const;
-  os::PageSizes pre_allocated_pagesizes() const;
+  os::PageSizes os_supported() const;
+  os::PageSizes pre_allocated() const;
   size_t default_hugepage_size() const;
   void print_on(outputStream* os);
 
diff --git a/src/hotspot/os/linux/os_linux.cpp b/src/hotspot/os/linux/os_linux.cpp
index 7bde0ae08c9..c79b0ab9fb5 100644
--- a/src/hotspot/os/linux/os_linux.cpp
+++ b/src/hotspot/os/linux/os_linux.cpp
@@ -3818,8 +3818,8 @@ static int hugetlbfs_page_size_flag(size_t page_size) {
 }
 
 static bool hugetlbfs_sanity_check(size_t page_size) {
-  const os::PageSizes page_sizes = HugePages::explicit_hugepage_info().pagesizes();
-  assert(page_sizes.contains(page_size), "Invalid page sizes passed (%zu)", page_size);
+  const os::PageSizes os_supported = HugePages::explicit_hugepage_info().os_supported();
+  assert(os_supported.contains(page_size), "Invalid page sizes passed (%zu)", page_size);
 
   // Include the page size flag to ensure we sanity check the correct page size.
   int flags = MAP_ANONYMOUS | MAP_PRIVATE | MAP_HUGETLB | hugetlbfs_page_size_flag(page_size);
@@ -3833,16 +3833,16 @@ static bool hugetlbfs_sanity_check(size_t page_size) {
       log_info(pagesize)("Large page size (" EXACTFMT ") failed sanity check, "
                          "checking if smaller large page sizes are usable",
                          EXACTFMTARGS(page_size));
-      for (size_t page_size_ = page_sizes.next_smaller(page_size);
-          page_size_ > os::vm_page_size();
-          page_size_ = page_sizes.next_smaller(page_size_)) {
-        flags = MAP_ANONYMOUS | MAP_PRIVATE | MAP_HUGETLB | hugetlbfs_page_size_flag(page_size_);
-        p = mmap(nullptr, page_size_, PROT_READ|PROT_WRITE, flags, -1, 0);
+      for (size_t size = os_supported.next_smaller(page_size);
+          size > os::vm_page_size();
+          size = os_supported.next_smaller(size)) {
+        flags = MAP_ANONYMOUS | MAP_PRIVATE | MAP_HUGETLB | hugetlbfs_page_size_flag(size);
+        p = mmap(nullptr, size, PROT_READ|PROT_WRITE, flags, -1, 0);
         if (p != MAP_FAILED) {
           // Mapping succeeded, sanity check passed.
-          munmap(p, page_size_);
+          munmap(p, size);
           log_info(pagesize)("Large page size (" EXACTFMT ") passed sanity check",
-                             EXACTFMTARGS(page_size_));
+                             EXACTFMTARGS(size));
           return true;
         }
       }
@@ -4024,7 +4024,7 @@ void os::Linux::large_page_init() {
     // - os::large_page_size() is the default explicit hugepage size (/proc/meminfo "Hugepagesize")
     // - os::pagesizes() contains all hugepage sizes the kernel supports, regardless whether there
     //   are pages configured in the pool or not (from /sys/kernel/hugepages/hugepage-xxxx ...)
-    os::PageSizes all_large_pages = HugePages::explicit_hugepage_info().pagesizes();
+    os::PageSizes all_large_pages = HugePages::explicit_hugepage_info().os_supported();
     const size_t default_large_page_size = HugePages::default_explicit_hugepage_size();
 
     // 3) Consistency check and post-processing
@@ -4068,7 +4068,7 @@ void os::Linux::large_page_init() {
 
     // Populate _page_sizes with _large_page_size (default large page size) even if not pre-allocated.
     // Then, populate _page_sizes with all smaller large page sizes that have been pre-allocated.
-    os::PageSizes pre_allocated = HugePages::explicit_hugepage_info().pre_allocated_pagesizes();
+    os::PageSizes pre_allocated = HugePages::explicit_hugepage_info().pre_allocated();
     for (size_t page_size = _large_page_size; page_size != 0; page_size = pre_allocated.next_smaller(page_size)) {
       _page_sizes.add(page_size);
     }
@@ -4133,12 +4133,12 @@ static char* reserve_memory_special_huge_tlbfs(size_t bytes,
                                                size_t page_size,
                                                char* req_addr,
                                                bool exec) {
-  const os::PageSizes page_sizes = HugePages::explicit_hugepage_info().pagesizes();
+  const os::PageSizes os_supported = HugePages::explicit_hugepage_info().os_supported();
   assert(UseLargePages, "only for Huge TLBFS large pages");
   assert(is_aligned(req_addr, alignment), "Must be");
   assert(is_aligned(req_addr, page_size), "Must be");
   assert(is_aligned(alignment, os::vm_allocation_granularity()), "Must be");
-  assert(page_sizes.contains(page_size), "Must be a valid page size");
+  assert(os_supported.contains(page_size), "Must be a valid page size");
   assert(page_size > os::vm_page_size(), "Must be a large page size");
   assert(bytes >= page_size, "Shouldn't allocate large pages for small sizes");
 
@@ -5461,5 +5461,3 @@ void os::print_open_file_descriptors(outputStream* st) {
     st->print_cr("Open File Descriptors: %d", fds);
   }
 }
-
-

From 28e72430ef3dae96f9b97615ea70a78c22e2424e Mon Sep 17 00:00:00 2001
From: Daniel Fuchs <dfuchs@openjdk.org>
Date: Thu, 19 Mar 2026 15:15:19 +0000
Subject: [PATCH 260/655] 8379707: UserAuthWithAuthenticator::h3Test fails
 intermittentently

Reviewed-by: syan, jpai, djelinski
---
 .../httpclient/UserAuthWithAuthenticator.java | 47 ++++++++++++++-----
 1 file changed, 36 insertions(+), 11 deletions(-)

diff --git a/test/jdk/java/net/httpclient/UserAuthWithAuthenticator.java b/test/jdk/java/net/httpclient/UserAuthWithAuthenticator.java
index 90df367a619..6062fcd9448 100644
--- a/test/jdk/java/net/httpclient/UserAuthWithAuthenticator.java
+++ b/test/jdk/java/net/httpclient/UserAuthWithAuthenticator.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2024, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2024, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -21,17 +21,33 @@
  * questions.
  */
 
-import java.io.*;
-import java.net.*;
+import java.io.Closeable;
+import java.io.IOException;
+import java.io.InputStream;
+import java.io.OutputStream;
+import java.net.Authenticator;
+import java.net.InetAddress;
+import java.net.InetSocketAddress;
+import java.net.PasswordAuthentication;
+import java.net.Proxy;
+import java.net.ProxySelector;
+import java.net.ServerSocket;
+import java.net.Socket;
+import java.net.SocketAddress;
+import java.net.URI;
+import java.net.URISyntaxException;
 import java.net.http.HttpClient;
+import java.net.http.HttpClient.Version;
 import java.net.http.HttpRequest;
-import java.net.http.HttpOption.Http3DiscoveryMode;
 import java.net.http.HttpResponse;
-import javax.net.ssl.*;
+import java.util.LinkedList;
+import java.util.List;
 import java.util.concurrent.ExecutorService;
 import java.util.concurrent.Executors;
-import java.util.regex.*;
-import java.util.*;
+import java.util.regex.Matcher;
+import java.util.regex.Pattern;
+import javax.net.ssl.SSLContext;
+
 import jdk.test.lib.net.SimpleSSLContext;
 import jdk.test.lib.net.URIBuilder;
 import jdk.httpclient.test.lib.common.HttpServerAdapters;
@@ -42,6 +58,8 @@ import jdk.httpclient.test.lib.http2.Http2TestServer;
 import com.sun.net.httpserver.BasicAuthenticator;
 import org.junit.jupiter.api.Test;
 
+import static java.net.http.HttpOption.H3_DISCOVERY;
+import static java.net.http.HttpOption.Http3DiscoveryMode.HTTP_3_URI_ONLY;
 import static java.nio.charset.StandardCharsets.US_ASCII;
 import static org.junit.jupiter.api.Assertions.assertEquals;
 import static org.junit.jupiter.api.Assertions.assertFalse;
@@ -119,7 +137,7 @@ class UserAuthWithAuthenticator {
     private static void h3Test(final boolean useHeader, boolean rightPassword) throws Exception {
         SSLContext sslContext = SimpleSSLContext.findSSLContext();
         try (ExecutorService executor = Executors.newCachedThreadPool();
-             HttpTestServer server = HttpTestServer.create(Http3DiscoveryMode.HTTP_3_URI_ONLY, sslContext, executor);
+             HttpTestServer server = HttpTestServer.create(HTTP_3_URI_ONLY, sslContext, executor);
              HttpClient client = HttpServerAdapters.createClientBuilderForH3()
                      .sslContext(sslContext)
                      .executor(executor)
@@ -164,11 +182,18 @@ class UserAuthWithAuthenticator {
                 .build();
 
         var authHeaderValue = authHeaderValue("user", rightPassword ? "pwd" : "wrongPwd");
-        HttpRequest req = HttpRequest.newBuilder(uri)
+        HttpRequest.Builder reqBuilder = HttpRequest.newBuilder(uri)
                 .version(version)
                 .header(useHeader ? "Authorization" : "X-Ignore", authHeaderValue)
-                .GET()
-                .build();
+                .GET();
+        if (version == Version.HTTP_3) {
+            // we should not attempt to default to TCP since our server is HTTP_3_URI_ONLY
+            // setting the option on the request also has the effect of telling
+            // the client that it can use the full HTTP/3 timeout, since the server
+            // is known to support HTTP/3
+            reqBuilder.setOption(H3_DISCOVERY, HTTP_3_URI_ONLY);
+        }
+        HttpRequest req = reqBuilder.build();
 
         HttpResponse<String> resp = client.send(req, HttpResponse.BodyHandlers.ofString());
         var sa = (ServerAuth) client.authenticator().orElseThrow();

From 5a22b6477bdda68df26675419165933cbe787704 Mon Sep 17 00:00:00 2001
From: Ashay Rane <253344819+raneashay@users.noreply.github.com>
Date: Thu, 19 Mar 2026 15:37:03 +0000
Subject: [PATCH 261/655] 8278857: C2: optimize (x << 2) & -4 to x (and similar
 patterns) -> KnownBits for LShift

Reviewed-by: qamai, mchevalier
---
 src/hotspot/share/opto/mulnode.cpp            |  27 +--
 src/hotspot/share/opto/rangeinference.hpp     |  35 +++
 src/hotspot/share/utilities/intn_t.hpp        |  32 +++
 .../gtest/opto/test_rangeinference.cpp        | 200 ++++++++++++++----
 4 files changed, 245 insertions(+), 49 deletions(-)

diff --git a/src/hotspot/share/opto/mulnode.cpp b/src/hotspot/share/opto/mulnode.cpp
index cac9f1dcc37..b0aef9b165e 100644
--- a/src/hotspot/share/opto/mulnode.cpp
+++ b/src/hotspot/share/opto/mulnode.cpp
@@ -1143,21 +1143,24 @@ const Type* LShiftNode::ValueIL(PhaseGVN* phase, BasicType bt) const {
     return t1;
   }
 
-  // Either input is BOTTOM ==> the result is BOTTOM
-  if ((t1 == TypeInteger::bottom(bt)) || (t2 == TypeInt::INT) ||
-      (t1 == Type::BOTTOM) || (t2 == Type::BOTTOM)) {
+  // If nothing is known about the shift amount then the result is BOTTOM
+  if (t2 == TypeInt::INT) {
     return TypeInteger::bottom(bt);
   }
 
   const TypeInteger* r1 = t1->is_integer(bt); // Handy access
-  const TypeInt* r2 = t2->is_int(); // Handy access
+  // Since the shift semantics in Java take into account only the bottom five
+  // bits for ints and the bottom six bits for longs, we can further constrain
+  // the range of values of the shift amount by ANDing with the right mask based
+  // on whether the type is int or long.
+  const TypeInt* mask = TypeInt::make(bits_per_java_integer(bt) - 1);
+  const TypeInt* r2 = RangeInference::infer_and(t2->is_int(), mask);
 
   if (!r2->is_con()) {
     return TypeInteger::bottom(bt);
   }
 
   uint shift = r2->get_con();
-  shift &= bits_per_java_integer(bt) - 1;  // semantics of Java shifts
   // Shift by a multiple of 32/64 does nothing:
   if (shift == 0) {
     return t1;
@@ -1166,22 +1169,20 @@ const Type* LShiftNode::ValueIL(PhaseGVN* phase, BasicType bt) const {
   // If the shift is a constant, shift the bounds of the type,
   // unless this could lead to an overflow.
   if (!r1->is_con()) {
-    jlong lo = r1->lo_as_long(), hi = r1->hi_as_long();
 #ifdef ASSERT
     if (bt == T_INT) {
+      jlong lo = r1->lo_as_long(), hi = r1->hi_as_long();
       jint lo_int = r1->is_int()->_lo, hi_int = r1->is_int()->_hi;
       assert((java_shift_right(java_shift_left(lo, shift, bt),  shift, bt) == lo) == (((lo_int << shift) >> shift) == lo_int), "inconsistent");
       assert((java_shift_right(java_shift_left(hi, shift, bt),  shift, bt) == hi) == (((hi_int << shift) >> shift) == hi_int), "inconsistent");
     }
 #endif
-    if (java_shift_right(java_shift_left(lo, shift, bt),  shift, bt) == lo &&
-        java_shift_right(java_shift_left(hi, shift, bt), shift, bt) == hi) {
-      // No overflow.  The range shifts up cleanly.
-      return TypeInteger::make(java_shift_left(lo, shift, bt),
-                               java_shift_left(hi,  shift, bt),
-                               MAX2(r1->_widen, r2->_widen), bt);
+
+    if (bt == T_INT) {
+        return RangeInference::infer_lshift(r1->is_int(), shift);
     }
-    return TypeInteger::bottom(bt);
+
+    return RangeInference::infer_lshift(r1->is_long(), shift);
   }
 
   return TypeInteger::make(java_shift_left(r1->get_con_as_long(bt), shift, bt), bt);
diff --git a/src/hotspot/share/opto/rangeinference.hpp b/src/hotspot/share/opto/rangeinference.hpp
index 66ea741a2da..7c0f12f6ef7 100644
--- a/src/hotspot/share/opto/rangeinference.hpp
+++ b/src/hotspot/share/opto/rangeinference.hpp
@@ -28,6 +28,7 @@
 #include "cppstdlib/limits.hpp"
 #include "cppstdlib/type_traits.hpp"
 #include "utilities/globalDefinitions.hpp"
+#include "utilities/intn_t.hpp"
 
 class outputStream;
 class Type;
@@ -407,6 +408,40 @@ public:
       return TypeIntMirror<S<CTP>, U<CTP>>::make(TypeIntPrototype<S<CTP>, U<CTP>>{{lo, hi}, {ulo, uhi}, {zeros, ones}});
     });
   }
+
+  // Compute `known_bits` by shifting known bits of `t1` left and setting the
+  // low `shift` bits to zeros.  Also update the signed and unsigned ranges when
+  // the shift operation does not cause an overflow.  The caller is responsible
+  // for normalizing the shift amount (i.e. masking with 31 for ints or 63 for
+  // longs).
+  template <class CTP>
+  static CTP infer_lshift(CTP t1, int masked_shift) {
+    assert(masked_shift >= 0 &&
+        masked_shift < HotSpotNumerics::type_width<U<CTP>>(),
+        "shift is out of range");
+
+    U<CTP> pattern = (U<CTP>(1) << masked_shift) - U<CTP>(1);
+    U<CTP> known_one_bits = t1->_bits._ones << masked_shift;
+    U<CTP> known_zero_bits = (t1->_bits._zeros << masked_shift) | pattern;
+    KnownBits<U<CTP>> known_bits{known_zero_bits, known_one_bits};
+
+    S<CTP> shifted_slo = S<CTP>(U<CTP>(t1->_lo) << masked_shift);
+    S<CTP> shifted_shi = S<CTP>(U<CTP>(t1->_hi) << masked_shift);
+    bool s_overflow = (shifted_slo >> masked_shift) != t1->_lo ||
+                      (shifted_shi >> masked_shift) != t1->_hi;
+    S<CTP> slo = s_overflow ? std::numeric_limits<S<CTP>>::min() : shifted_slo;
+    S<CTP> shi = s_overflow ? std::numeric_limits<S<CTP>>::max() : shifted_shi;
+
+    U<CTP> shifted_ulo = t1->_ulo << masked_shift;
+    U<CTP> shifted_uhi = t1->_uhi << masked_shift;
+    bool u_overflow = (shifted_ulo >> masked_shift) != t1->_ulo ||
+                      (shifted_uhi >> masked_shift) != t1->_uhi;
+    U<CTP> ulo = u_overflow ? std::numeric_limits<U<CTP>>::min() : shifted_ulo;
+    U<CTP> uhi = u_overflow ? std::numeric_limits<U<CTP>>::max() : shifted_uhi;
+
+    TypeIntPrototype<S<CTP>, U<CTP>> proto{{slo, shi}, {ulo, uhi}, known_bits};
+    return CT<CTP>::make(proto, t1->_widen);
+  }
 };
 
 #endif // SHARE_OPTO_RANGEINFERENCE_HPP
diff --git a/src/hotspot/share/utilities/intn_t.hpp b/src/hotspot/share/utilities/intn_t.hpp
index 594e62a1694..1b8e7de652e 100644
--- a/src/hotspot/share/utilities/intn_t.hpp
+++ b/src/hotspot/share/utilities/intn_t.hpp
@@ -84,6 +84,7 @@ public:
   constexpr bool operator>(intn_t o) const { return int(*this) > int(o); }
   constexpr bool operator<=(intn_t o) const { return int(*this) <= int(o); }
   constexpr bool operator>=(intn_t o) const { return int(*this) >= int(o); }
+  constexpr intn_t operator>>(unsigned int s) const { return intn_t(int(*this) >> s); }
 };
 
 template <unsigned int nbits>
@@ -163,4 +164,35 @@ inline unsigned count_leading_zeros(uintn_t<nbits> v) {
   return count_leading_zeros<unsigned int>(v._v & uintn_t<nbits>::_mask) - (32 - nbits);
 }
 
+class HotSpotNumerics {
+private:
+  template <typename T>
+  static constexpr int type_width_impl(T value) {
+    // Count the number of 1s in `value`.  We can't use population_count() from
+    // utilities/population_count.hpp, since it requires `std::is_integral`, which
+    // fails for `uintn_t<N>`.  Since this is a constexpr function, this function
+    // does not impose a runtime performance overhead.
+    return value == T(0) ? 0 : 1 + type_width_impl(value >> 1);
+  }
+
+public:
+  // Returns true if T is a signed type.  We can't rely on std::is_signed
+  // because it returns false for intn_t<N>, which is not a standard integral
+  // type.  Instead, we check whether T(-1) is less than T(0).
+  template <typename T>
+  static constexpr bool is_signed() {
+    return T(-1) < T(0);
+  }
+
+  // Returns the bit width of the unsigned type T.  We can't use sizeof() on T,
+  // since sizeof(uintn_t<N>) returns the size of the underlying storage rather
+  // than the logical type width.  So we instead compute the number of 1s in the
+  // maximum value.
+  template <typename T>
+  static constexpr int type_width() {
+    static_assert(!is_signed<T>(), "type_width requires an unsigned type");
+    return type_width_impl(std::numeric_limits<T>::max());
+  }
+};
+
 #endif // SHARE_UTILITIES_INTN_T_HPP
diff --git a/test/hotspot/gtest/opto/test_rangeinference.cpp b/test/hotspot/gtest/opto/test_rangeinference.cpp
index fd49050d022..641edaba4da 100644
--- a/test/hotspot/gtest/opto/test_rangeinference.cpp
+++ b/test/hotspot/gtest/opto/test_rangeinference.cpp
@@ -370,6 +370,32 @@ static void test_binary_instance_correctness_exhaustive(Operation op, Inference
   }
 }
 
+template <class InputType, class U = std::remove_const_t<decltype(InputType::_ulo)>>
+static void populate_sample_values(U* samples, const size_t sample_count, const InputType &input) {
+  constexpr size_t max_tries = 100;
+  constexpr size_t start_random_idx = 4;
+
+  assert(sample_count >= 4, "need at least 4 slots for boundary values");
+  samples[0] = U(input._lo);
+  samples[1] = U(input._hi);
+  samples[2] = input._ulo;
+  samples[3] = input._uhi;
+
+  // Initialize remaining slots to a known-contained value in case the random
+  // fill below doesn't find enough values.
+  for (size_t i = start_random_idx; i < sample_count; i++) {
+    samples[i] = input._ulo;
+  }
+
+  for (size_t tries = 0, idx = start_random_idx; tries < max_tries && idx < sample_count; tries++) {
+    U n = uniform_random<U>();
+    if (input.contains(n)) {
+      samples[idx] = n;
+      idx++;
+    }
+  }
+}
+
 // Check the correctness, that is, if v1 is an element of input1, v2 is an element of input2, then
 // op(v1, v2) must be an element of infer(input1, input2). This version does the check randomly on
 // a number of elements in input1 and input2.
@@ -379,22 +405,11 @@ static void test_binary_instance_correctness_samples(Operation op, Inference inf
   auto result = infer(input1, input2);
 
   constexpr size_t sample_count = 6;
-  U input1_samples[sample_count] {U(input1._lo), U(input1._hi), input1._ulo, input1._uhi, input1._ulo, input1._ulo};
-  U input2_samples[sample_count] {U(input2._lo), U(input2._hi), input2._ulo, input2._uhi, input2._ulo, input2._ulo};
+  U input1_samples[sample_count];
+  populate_sample_values(input1_samples, sample_count, input1);
 
-  auto random_sample = [](U* samples, const InputType& input) {
-    constexpr size_t max_tries = 100;
-    constexpr size_t start_random_idx = 4;
-    for (size_t tries = 0, idx = start_random_idx; tries < max_tries && idx < sample_count; tries++) {
-      U n = uniform_random<U>();
-      if (input.contains(n)) {
-        samples[idx] = n;
-        idx++;
-      }
-    }
-  };
-  random_sample(input1_samples, input1);
-  random_sample(input2_samples, input2);
+  U input2_samples[sample_count];
+  populate_sample_values(input2_samples, sample_count, input2);
 
   for (size_t i = 0; i < sample_count; i++) {
     for (size_t j = 0; j < sample_count; j++) {
@@ -428,6 +443,22 @@ static void test_binary_instance_monotonicity_exhaustive(Inference infer, const
   }
 }
 
+template <class InputType>
+static InputType compute_random_superset(const InputType& input) {
+    using S = std::remove_const_t<decltype(InputType::_lo)>;
+    using U = std::remove_const_t<decltype(InputType::_ulo)>;
+
+    S lo = MIN2(input->_lo, S(uniform_random<U>()));
+    S hi = MAX2(input->_hi, S(uniform_random<U>()));
+    U ulo = MIN2(input->_ulo, uniform_random<U>());
+    U uhi = MAX2(input->_uhi, uniform_random<U>());
+    U zeros = input->_bits._zeros & uniform_random<U>();
+    U ones = input->_bits._ones & uniform_random<U>();
+    InputType super = InputType::make(TypeIntPrototype<S, U>{{lo, hi}, {ulo, uhi}, {zeros, ones}}, 0);
+    assert(super.contains(input), "impossible");
+    return super;
+}
+
 // Check the monotonicity, that is, if input1 is a subset of super1, input2 is a subset of super2,
 // then infer(input1, input2) must be a subset of infer(super1, super2). This version does the
 // check randomly on a number of supersets of input1 and input2.
@@ -443,20 +474,8 @@ static void test_binary_instance_monotonicity_samples(Inference infer, const Inp
   ASSERT_TRUE(infer(input1, universe).contains(result));
   ASSERT_TRUE(infer(universe, universe).contains(result));
 
-  auto random_superset = [](const InputType& input) {
-    S lo = MIN2(input->_lo, S(uniform_random<U>()));
-    S hi = MAX2(input->_hi, S(uniform_random<U>()));
-    U ulo = MIN2(input->_ulo, uniform_random<U>());
-    U uhi = MAX2(input->_uhi, uniform_random<U>());
-    U zeros = input->_bits._zeros & uniform_random<U>();
-    U ones = input->_bits._ones & uniform_random<U>();
-    InputType super = InputType::make(TypeIntPrototype<S, U>{{lo, hi}, {ulo, uhi}, {zeros, ones}}, 0);
-    assert(super.contains(input), "impossible");
-    return super;
-  };
-
-  InputType super1 = random_superset(input1);
-  InputType super2 = random_superset(input2);
+  InputType super1 = compute_random_superset<InputType>(input1);
+  InputType super2 = compute_random_superset<InputType>(input2);
   ASSERT_TRUE(infer(super1, input2).contains(result));
   ASSERT_TRUE(infer(input1, super2).contains(result));
   ASSERT_TRUE(infer(super1, super2).contains(result));
@@ -480,16 +499,11 @@ static void test_binary_exhaustive(Operation op, Inference infer) {
   }
 }
 
-// Verify the correctness and monotonicity of an inference function by randomly sampling instances
-// of InputType
-template <class InputType, class Operation, class Inference>
-static void test_binary_random(Operation op, Inference infer) {
+template <class InputType>
+static void populate_sample_types(InputType* samples, const size_t sample_count) {
   using S = std::remove_const_t<decltype(InputType::_lo)>;
   using U = std::remove_const_t<decltype(InputType::_ulo)>;
 
-  constexpr size_t sample_count = 100;
-  InputType samples[sample_count];
-
   // Fill with {0}
   for (size_t i = 0; i < sample_count; i++) {
     samples[i] = InputType::make(TypeIntPrototype<S, U>{{S(0), S(0)}, {U(0), U(0)}, {U(0), U(0)}}, 0);
@@ -549,6 +563,18 @@ static void test_binary_random(Operation op, Inference infer) {
                                        canonicalized_t._data._bits};
     idx++;
   }
+}
+
+// Verify the correctness and monotonicity of an inference function by randomly sampling instances
+// of InputType
+template <class InputType, class Operation, class Inference>
+static void test_binary_random(Operation op, Inference infer) {
+  using S = std::remove_const_t<decltype(InputType::_lo)>;
+  using U = std::remove_const_t<decltype(InputType::_ulo)>;
+
+  constexpr size_t sample_count = 100;
+  InputType samples[sample_count];
+  populate_sample_types(samples, sample_count);
 
   for (size_t i = 0; i < sample_count; i++) {
     for (size_t j = 0; j < sample_count; j++) {
@@ -570,6 +596,107 @@ static void test_binary() {
   test_binary_random<TypeIntMirror<jlong, julong>>(Operation<julong>(), Inference<TypeIntMirror<jlong, julong>>());
 }
 
+template <class U>
+static U lshift_op(U v, int shift) {
+  return v << shift;
+}
+
+// Test correctness: for all values v in input, (v << shift) must be in the result
+template <class InputType>
+static void test_lshift_correctness(const InputType& input, int shift) {
+  using U = std::remove_const_t<decltype(input->_ulo)>;
+  auto result = RangeInference::infer_lshift(input, shift);
+  for (juint v = 0; v <= juint(std::numeric_limits<U>::max()); v++) {
+    if (input.contains(U(v))) {
+      U r = lshift_op(U(v), shift);
+      ASSERT_TRUE(result.contains(r));
+    }
+  }
+}
+
+// Test correctness for jint/jlong types by sampling values from the input range.
+template <class InputType>
+static void test_lshift_correctness_samples(const InputType& input, int shift) {
+  using U = std::remove_const_t<decltype(input->_ulo)>;
+  auto result = RangeInference::infer_lshift(input, shift);
+
+  constexpr size_t sample_count = 6;
+  U samples[sample_count];
+  populate_sample_values(samples, sample_count, input);
+
+  for (size_t i = 0; i < sample_count; i++) {
+    ASSERT_TRUE(input.contains(samples[i]));
+
+    U r = lshift_op(samples[i], shift);
+    ASSERT_TRUE(result.contains(r));
+  }
+}
+
+// Test monotonicity: if input is a subset of super, then result is a subset of
+// infer_lshift(super, shift)
+template <class InputType>
+static void test_lshift_monotonicity(const InputType& input, int shift) {
+  auto result = RangeInference::infer_lshift(input, shift);
+  for (const InputType& super : all_instances<InputType>()) {
+    if (super.contains(input)) {
+      ASSERT_TRUE(RangeInference::infer_lshift(super, shift).contains(result));
+    }
+  }
+}
+
+// Test monotonicity for jint/jlong types by constructing random supersets.
+template <class InputType>
+static void test_lshift_monotonicity_samples(const InputType& input, int shift) {
+  using S = std::remove_const_t<decltype(input->_lo)>;
+  using U = std::remove_const_t<decltype(input->_ulo)>;
+  auto result = RangeInference::infer_lshift(input, shift);
+
+  // The universe is a superset of all other sets
+  InputType universe = InputType{std::numeric_limits<S>::min(), std::numeric_limits<S>::max(), U(0), U(-1), {U(0), U(0)}};
+  ASSERT_TRUE(RangeInference::infer_lshift(universe, shift).contains(result));
+
+  InputType super = compute_random_superset<InputType>(input);
+  ASSERT_TRUE(RangeInference::infer_lshift(super, shift).contains(result));
+}
+
+template <class InputType>
+static void test_lshift_for_type() {
+  using U = std::remove_const_t<decltype(InputType::_ulo)>;
+  constexpr int type_bits = HotSpotNumerics::type_width<U>();
+  for (const InputType& input : all_instances<InputType>()) {
+    for (int shift = 0; shift < type_bits; shift++) {
+      test_lshift_correctness(input, shift);
+      test_lshift_monotonicity(input, shift);
+    }
+  }
+}
+
+// Sample-based test for jint/jlong types
+template <class InputType>
+static void test_lshift_random() {
+  using S = std::remove_const_t<decltype(InputType::_lo)>;
+  using U = std::remove_const_t<decltype(InputType::_ulo)>;
+
+  constexpr size_t sample_count = 100;
+  InputType samples[sample_count];
+  populate_sample_types(samples, sample_count);
+
+  for (size_t i = 0; i < sample_count; i++) {
+    for (int shift = 0; shift < HotSpotNumerics::type_width<U>(); shift++) {
+      test_lshift_correctness_samples(samples[i], shift);
+      test_lshift_monotonicity_samples(samples[i], shift);
+    }
+  }
+}
+
+static void test_lshift() {
+  test_lshift_for_type<TypeIntMirror<intn_t<1>, uintn_t<1>>>();
+  test_lshift_for_type<TypeIntMirror<intn_t<2>, uintn_t<2>>>();
+  test_lshift_for_type<TypeIntMirror<intn_t<3>, uintn_t<3>>>();
+  test_lshift_random<TypeIntMirror<jint, juint>>();
+  test_lshift_random<TypeIntMirror<jlong, julong>>();
+}
+
 template <class U>
 class OpAnd {
 public:
@@ -622,4 +749,5 @@ TEST(opto, range_inference) {
   test_binary<OpAnd, InferAnd>();
   test_binary<OpOr, InferOr>();
   test_binary<OpXor, InferXor>();
+  test_lshift();
 }

From 1b924bfc8979529e50c0298761c921e314a45706 Mon Sep 17 00:00:00 2001
From: Brian Burkhalter <bpb@openjdk.org>
Date: Thu, 19 Mar 2026 16:08:26 +0000
Subject: [PATCH 262/655] 8380204: java/io/File/EmptyPath.java fails due to
 unexpected listRoots value

Reviewed-by: alanb
---
 test/jdk/java/io/File/EmptyPath.java | 13 +------------
 1 file changed, 1 insertion(+), 12 deletions(-)

diff --git a/test/jdk/java/io/File/EmptyPath.java b/test/jdk/java/io/File/EmptyPath.java
index 374a69c7959..67331380531 100644
--- a/test/jdk/java/io/File/EmptyPath.java
+++ b/test/jdk/java/io/File/EmptyPath.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -285,17 +285,6 @@ public class EmptyPath {
         assertEquals(nioSet, ioSet);
     }
 
-    @Test
-    public void listRoots() {
-        Set<String> expected = Arrays.stream(f.getAbsoluteFile().listRoots())
-            .map(File::toString)
-            .collect(Collectors.toSet());
-        Set<String> actual = Arrays.stream(f.listRoots())
-            .map(File::toString)
-            .collect(Collectors.toSet());
-        assertEquals(expected, actual);
-    }
-
     @Test
     public void mkdir() {
         assertFalse(f.mkdir());

From 76e7c9e68a42b41df1f309815d9f0111fd967d1f Mon Sep 17 00:00:00 2001
From: Damon Nguyen <dnguyen@openjdk.org>
Date: Thu, 19 Mar 2026 16:11:50 +0000
Subject: [PATCH 263/655] 8380078: Update GIFlib to 6.1.2

Reviewed-by: serb, azvegint
---
 src/java.desktop/share/legal/giflib.md                    | 2 +-
 .../share/native/libsplashscreen/giflib/gif_lib.h         | 2 +-
 .../share/native/libsplashscreen/giflib/gifalloc.c        | 8 ++++++++
 3 files changed, 10 insertions(+), 2 deletions(-)

diff --git a/src/java.desktop/share/legal/giflib.md b/src/java.desktop/share/legal/giflib.md
index ba2dbb00535..781023dd334 100644
--- a/src/java.desktop/share/legal/giflib.md
+++ b/src/java.desktop/share/legal/giflib.md
@@ -1,4 +1,4 @@
-## GIFLIB v6.1.1
+## GIFLIB v6.1.2
 
 ### GIFLIB License
 ```
diff --git a/src/java.desktop/share/native/libsplashscreen/giflib/gif_lib.h b/src/java.desktop/share/native/libsplashscreen/giflib/gif_lib.h
index 5d9c3346090..64b33beefa7 100644
--- a/src/java.desktop/share/native/libsplashscreen/giflib/gif_lib.h
+++ b/src/java.desktop/share/native/libsplashscreen/giflib/gif_lib.h
@@ -39,7 +39,7 @@ extern "C" {
 
 #define GIFLIB_MAJOR 6
 #define GIFLIB_MINOR 1
-#define GIFLIB_RELEASE 1
+#define GIFLIB_RELEASE 2
 
 #define GIF_ERROR 0
 #define GIF_OK 1
diff --git a/src/java.desktop/share/native/libsplashscreen/giflib/gifalloc.c b/src/java.desktop/share/native/libsplashscreen/giflib/gifalloc.c
index aebf2d7662f..25e03914496 100644
--- a/src/java.desktop/share/native/libsplashscreen/giflib/gifalloc.c
+++ b/src/java.desktop/share/native/libsplashscreen/giflib/gifalloc.c
@@ -373,6 +373,14 @@ SavedImage *GifMakeSavedImage(GifFileType *GifFile,
                          * aliasing problems.
                          */
 
+                        /* Null out aliased pointers before any allocations
+                         * so that FreeLastSavedImage won't free CopyFrom's
+                         * data if an allocation fails partway through. */
+                        sp->ImageDesc.ColorMap = NULL;
+                        sp->RasterBits = NULL;
+                        sp->ExtensionBlocks = NULL;
+                        sp->ExtensionBlockCount = 0;
+
                         /* first, the local color map */
                         if (CopyFrom->ImageDesc.ColorMap != NULL) {
                                 sp->ImageDesc.ColorMap = GifMakeMapObject(

From 876a68ad41693940b3b05867eb1673f163c83b4a Mon Sep 17 00:00:00 2001
From: Justin Lu <jlu@openjdk.org>
Date: Thu, 19 Mar 2026 16:19:51 +0000
Subject: [PATCH 264/655] 8378884: Migrate jdk/jdk/nio/zipfs tests to use JUnit

Reviewed-by: lancea
---
 test/jdk/jdk/nio/zipfs/Basic.java             | 185 ++--
 test/jdk/jdk/nio/zipfs/CRCWriteTest.java      |  23 +-
 .../zipfs/{testng/test => }/ChannelTests.java | 209 ++--
 .../jdk/nio/zipfs/CompressionModeTest.java    |  84 +-
 test/jdk/jdk/nio/zipfs/CopyMoveTests.java     |  91 +-
 .../jdk/nio/zipfs/DirectoryStreamTests.java   |  80 +-
 .../jdk/jdk/nio/zipfs/EndOfCenValidation.java |   5 +-
 test/jdk/jdk/nio/zipfs/HasDotDotTest.java     |  48 +-
 .../jdk/nio/zipfs/InvalidZipHeaderTests.java  |  58 +-
 .../zipfs/LargeCompressedEntrySizeTest.java   |  15 +-
 test/jdk/jdk/nio/zipfs/LargeEntriesTest.java  | 113 +-
 .../{testng/test => }/ManifestOrderTest.java  |  79 +-
 .../jdk/jdk/nio/zipfs/NewFileSystemTests.java |  99 +-
 .../jdk/nio/zipfs/NonExistentPathTests.java   |  10 +-
 test/jdk/jdk/nio/zipfs/PathOps.java           | 976 +++++++++---------
 .../test => }/PosixAttributeViewTest.java     |  40 +-
 .../nio/zipfs/PropertyPermissionTests.java    |  20 +-
 test/jdk/jdk/nio/zipfs/ReleaseDeflater.java   |  25 +-
 test/jdk/jdk/nio/zipfs/UpdateEntryTest.java   |  25 +-
 test/jdk/jdk/nio/zipfs/ZFSTests.java          | 103 +-
 test/jdk/jdk/nio/zipfs/ZeroDate.java          |  89 +-
 .../jdk/nio/zipfs/ZipFSOutputStreamTest.java  |  41 +-
 .../jdk/nio/zipfs/ZipFSPermissionsTest.java   |  76 +-
 test/jdk/jdk/nio/zipfs/ZipFSTester.java       | 548 +++++-----
 test/jdk/jdk/nio/zipfs/jarfs/JFSTester.java   | 103 +-
 .../nio/zipfs/jarfs/MultiReleaseJarTest.java  | 140 +--
 test/jdk/jdk/nio/zipfs/testng/TEST.properties |   4 -
 .../{testng => }/util/ZipFsBaseTest.java      |  74 +-
 28 files changed, 1727 insertions(+), 1636 deletions(-)
 rename test/jdk/jdk/nio/zipfs/{testng/test => }/ChannelTests.java (93%)
 rename test/jdk/jdk/nio/zipfs/{testng/test => }/ManifestOrderTest.java (91%)
 rename test/jdk/jdk/nio/zipfs/{testng/test => }/PosixAttributeViewTest.java (77%)
 delete mode 100644 test/jdk/jdk/nio/zipfs/testng/TEST.properties
 rename test/jdk/jdk/nio/zipfs/{testng => }/util/ZipFsBaseTest.java (80%)

diff --git a/test/jdk/jdk/nio/zipfs/Basic.java b/test/jdk/jdk/nio/zipfs/Basic.java
index faaf634f93c..8416145299a 100644
--- a/test/jdk/jdk/nio/zipfs/Basic.java
+++ b/test/jdk/jdk/nio/zipfs/Basic.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2009, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2009, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -21,15 +21,18 @@
  * questions.
  */
 
+import org.junit.jupiter.api.AfterAll;
+import org.junit.jupiter.api.BeforeAll;
+import org.junit.jupiter.api.Test;
+
+import java.net.URISyntaxException;
 import java.nio.file.AccessMode;
 import java.nio.file.ClosedFileSystemException;
 import java.nio.file.FileStore;
-import java.nio.file.FileSystem;
 import java.nio.file.FileSystems;
 import java.nio.file.FileVisitResult;
 import java.nio.file.Files;
 import java.nio.file.Path;
-import java.nio.file.PathMatcher;
 import java.nio.file.ProviderMismatchException;
 import java.nio.file.SimpleFileVisitor;
 import java.nio.file.StandardCopyOption;
@@ -37,103 +40,135 @@ import java.nio.file.attribute.BasicFileAttributes;
 import java.nio.file.spi.FileSystemProvider;
 import java.net.URI;
 import java.io.IOException;
-import java.util.Collections;
 import java.util.Map;
+
 import static java.nio.file.StandardWatchEventKinds.ENTRY_CREATE;
-/**
+import static org.junit.jupiter.api.Assertions.assertDoesNotThrow;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertFalse;
+import static org.junit.jupiter.api.Assertions.assertThrows;
+import static org.junit.jupiter.api.Assertions.assertTrue;
+
+/*
  * @test
  * @bug 8038500 8040059 8150366 8150496 8147539 8290047
  * @summary Basic test for zip provider
- *
  * @modules jdk.zipfs
- * @run main Basic
+ * @run junit Basic
  */
-
 public class Basic {
-    public static void main(String[] args) throws Exception {
-        // Test: zip should be returned in provider list
-        boolean found = false;
-        for (FileSystemProvider provider: FileSystemProvider.installedProviders()) {
-            if (provider.getScheme().equalsIgnoreCase("jar")) {
-                found = true;
-                break;
-            }
-        }
-        if (!found)
-            throw new RuntimeException("'jar' provider not installed");
 
-        // create JAR file for test
-        Path jarFile = Utils.createJarFile("basic.jar",
+    static Path jarFile;
+    static URI uri;
+
+    @BeforeAll
+    static void setup() throws IOException, URISyntaxException {
+        jarFile = Utils.createJarFile("basic.jar",
                 "META-INF/services/java.nio.file.spi.FileSystemProvider");
+        uri = new URI("jar", jarFile.toUri().toString(), null);
+    }
 
+    @AfterAll
+    static void cleanUp() throws IOException {
+        Files.deleteIfExists(jarFile);
+    }
+
+    @Test
+    void providerListTest() {
+        // Test: zip should be returned in provider list
+        assertTrue(FileSystemProvider.installedProviders().stream()
+                .anyMatch(p -> p.getScheme().equalsIgnoreCase("jar")),
+                "'jar' provider not installed");
+    }
+
+    @Test
+    void newFileSystemTest() throws IOException {
+        // To test `newFileSystem`, close the shared FileSystem
+        var fs = FileSystems.newFileSystem(uri, Map.of());
+        fs.close();
         // Test: FileSystems#newFileSystem(Path)
-        Map<String,?> env = Collections.emptyMap();
         FileSystems.newFileSystem(jarFile).close();
-
         // Test: FileSystems#newFileSystem(URI)
-        URI uri = new URI("jar", jarFile.toUri().toString(), null);
-        FileSystem fs = FileSystems.newFileSystem(uri, env, null);
+        FileSystems.newFileSystem(uri, Map.of()).close();
+    }
 
-        // Test: exercise toUri method
-        String expected = uri.toString() + "!/foo";
-        String actual = fs.getPath("/foo").toUri().toString();
-        if (!actual.equals(expected)) {
-            throw new RuntimeException("toUri returned '" + actual +
-                "', expected '" + expected + "'");
+    @Test
+    void toUriTest() throws IOException {
+        try (var fs = FileSystems.newFileSystem(uri, Map.of())) {
+            // Test: exercise toUri method
+            String expected = uri.toString() + "!/foo";
+            String actual = fs.getPath("/foo").toUri().toString();
+            assertEquals(expected, actual, "toUri returned '" + actual +
+                    "', expected '" + expected + "'");
         }
+    }
 
-        // Test: exercise directory iterator and retrieval of basic attributes
-        Files.walkFileTree(fs.getPath("/"), new FileTreePrinter());
+    @Test
+    void directoryIteratorTest() throws IOException {
+        try (var fs = FileSystems.newFileSystem(uri, Map.of())) {
+            // Test: exercise directory iterator and retrieval of basic attributes
+            Files.walkFileTree(fs.getPath("/"), new FileTreePrinter());
+        }
+    }
 
-        // Test: copy file from zip file to current (scratch) directory
-        Path source = fs.getPath("/META-INF/services/java.nio.file.spi.FileSystemProvider");
-        if (Files.exists(source)) {
-            Path target = Path.of(source.getFileName().toString());
-            Files.copy(source, target, StandardCopyOption.REPLACE_EXISTING);
-            try {
-                long s1 = Files.readAttributes(source, BasicFileAttributes.class).size();
-                long s2 = Files.readAttributes(target, BasicFileAttributes.class).size();
-                if (s2 != s1)
-                    throw new RuntimeException("target size != source size");
-            } finally {
-                Files.delete(target);
+    @Test
+    void copyFileTest() throws IOException {
+        try (var fs = FileSystems.newFileSystem(uri, Map.of())) {
+            // Test: copy file from zip file to current (scratch) directory
+            Path source = fs.getPath("/META-INF/services/java.nio.file.spi.FileSystemProvider");
+            if (Files.exists(source)) {
+                Path target = Path.of(source.getFileName().toString());
+                Files.copy(source, target, StandardCopyOption.REPLACE_EXISTING);
+                try {
+                    long s1 = Files.readAttributes(source, BasicFileAttributes.class).size();
+                    long s2 = Files.readAttributes(target, BasicFileAttributes.class).size();
+                    assertEquals(s1, s2, "target size != source size");
+                } finally {
+                    Files.delete(target);
+                }
             }
         }
+    }
 
-        // Test: FileStore
-        FileStore store = Files.getFileStore(fs.getPath("/"));
-        if (!store.supportsFileAttributeView("basic"))
-            throw new RuntimeException("BasicFileAttributeView should be supported");
-
-        // Test: watch register should throw PME
-        try {
-            fs.getPath("/")
-              .register(FileSystems.getDefault().newWatchService(), ENTRY_CREATE);
-            throw new RuntimeException("watch service is not supported");
-        } catch (ProviderMismatchException x) { }
-
-        // Test: IllegalArgumentException
-        try {
-            PathMatcher pm = fs.getPathMatcher(":glob");
-            throw new RuntimeException("IllegalArgumentException not thrown");
-        } catch (IllegalArgumentException iae) {
-        }
-        try {
-            PathMatcher pm = fs.getPathMatcher("glob:");
-        } catch (IllegalArgumentException iae) {
-            iae.printStackTrace();
-            throw new RuntimeException("Unexpected IllegalArgumentException");
+    @Test
+    void fileStoreTest() throws IOException {
+        try (var fs = FileSystems.newFileSystem(uri, Map.of())) {
+            // Test: FileStore
+            FileStore store = Files.getFileStore(fs.getPath("/"));
+            assertTrue(store.supportsFileAttributeView("basic"),
+                    "BasicFileAttributeView should be supported");
         }
+    }
 
+    @Test
+    void watchRegisterNPETest() throws IOException {
+        try (var fs = FileSystems.newFileSystem(uri, Map.of())) {
+            // Test: watch register should throw PME
+            assertThrows(ProviderMismatchException.class, () -> fs.getPath("/")
+                            .register(FileSystems.getDefault().newWatchService(), ENTRY_CREATE),
+                    "watch service is not supported");
+        }
+    }
+
+    @Test
+    void pathMatcherIAETest() throws IOException {
+        try (var fs = FileSystems.newFileSystem(uri, Map.of())) {
+            // Test: IllegalArgumentException
+            assertThrows(IllegalArgumentException.class, () -> fs.getPathMatcher(":glob"),
+                    "IllegalArgumentException not thrown");
+            assertDoesNotThrow(() -> fs.getPathMatcher("glob:"),
+                    "Unexpected IllegalArgumentException");
+        }
+    }
+
+    @Test
+    void closedFileSystemTest() throws IOException {
         // Test: ClosedFileSystemException
+        var fs = FileSystems.newFileSystem(uri, Map.of());
         fs.close();
-        if (fs.isOpen())
-            throw new RuntimeException("FileSystem should be closed");
-        try {
-            fs.provider().checkAccess(fs.getPath("/missing"), AccessMode.READ);
-        } catch (ClosedFileSystemException x) { }
-
-        Files.deleteIfExists(jarFile);
+        assertFalse(fs.isOpen(), "FileSystem should be closed");
+        assertThrows(ClosedFileSystemException.class,
+                () -> fs.provider().checkAccess(fs.getPath("/missing"), AccessMode.READ));
     }
 
     // FileVisitor that pretty prints a file tree
diff --git a/test/jdk/jdk/nio/zipfs/CRCWriteTest.java b/test/jdk/jdk/nio/zipfs/CRCWriteTest.java
index 3f333ae9a44..268f8f42faf 100644
--- a/test/jdk/jdk/nio/zipfs/CRCWriteTest.java
+++ b/test/jdk/jdk/nio/zipfs/CRCWriteTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2019, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2019, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -21,7 +21,6 @@
  * questions.
  *
  */
-import org.testng.annotations.Test;
 
 import java.io.FileInputStream;
 import java.io.IOException;
@@ -32,20 +31,20 @@ import java.nio.file.FileSystem;
 import java.nio.file.FileSystems;
 import java.nio.file.Files;
 import java.nio.file.Path;
-import java.util.Arrays;
 import java.util.Map;
 import java.util.zip.ZipEntry;
 import java.util.zip.ZipFile;
 import java.util.zip.ZipInputStream;
 
-import static org.testng.Assert.*;
+import static org.junit.jupiter.api.Assertions.*;
+import org.junit.jupiter.api.Test;
 
 /**
  * @test
  * @bug 8232879
  * @summary Test OutputStream::write with Zip FS
  * @modules jdk.zipfs
- * @run testng/othervm CRCWriteTest
+ * @run junit/othervm CRCWriteTest
  */
 public class CRCWriteTest {
 
@@ -114,16 +113,16 @@ public class CRCWriteTest {
         // check entries with ZipFile API
         try (ZipFile zf = new ZipFile(zipfile.toFile())) {
             // check entry count
-            assertEquals(entries.length, zf.size());
+            assertEquals(zf.size(), entries.length);
 
             // Check compression method and content of each entry
             for (Entry e : entries) {
                 ZipEntry ze = zf.getEntry(e.name);
                 assertNotNull(ze);
-                assertEquals(e.method, ze.getMethod());
+                assertEquals(ze.getMethod(), e.method);
                 try (InputStream in = zf.getInputStream(ze)) {
                     byte[] bytes = in.readAllBytes();
-                    assertTrue(Arrays.equals(bytes, e.bytes));
+                    assertArrayEquals(bytes, e.bytes);
                 }
             }
         }
@@ -134,9 +133,9 @@ public class CRCWriteTest {
                          new ZipInputStream(new FileInputStream(zipfile.toFile()))) {
                 ZipEntry ze;
                 while ((ze = zis.getNextEntry()) != null) {
-                    assertEquals(e.method, ze.getMethod());
+                    assertEquals(ze.getMethod(), e.method);
                     byte[] bytes = zis.readAllBytes();
-                    assertTrue(Arrays.equals(bytes, e.bytes));
+                    assertArrayEquals(bytes, e.bytes);
                 }
             }
         }
@@ -147,13 +146,13 @@ public class CRCWriteTest {
             Path top = fs.getPath("/");
             long count = Files.find(top, Integer.MAX_VALUE,
                     (path, attrs) -> attrs.isRegularFile()).count();
-            assertEquals(entries.length, count);
+            assertEquals(count, entries.length);
 
             // check content of each entry
             for (Entry e : entries) {
                 Path file = fs.getPath(e.name);
                 byte[] bytes = Files.readAllBytes(file);
-                assertTrue(Arrays.equals(bytes, e.bytes));
+                assertArrayEquals(bytes, e.bytes);
             }
         }
     }
diff --git a/test/jdk/jdk/nio/zipfs/testng/test/ChannelTests.java b/test/jdk/jdk/nio/zipfs/ChannelTests.java
similarity index 93%
rename from test/jdk/jdk/nio/zipfs/testng/test/ChannelTests.java
rename to test/jdk/jdk/nio/zipfs/ChannelTests.java
index 3c7d18988b7..ffeed251649 100644
--- a/test/jdk/jdk/nio/zipfs/testng/test/ChannelTests.java
+++ b/test/jdk/jdk/nio/zipfs/ChannelTests.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2020, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -21,9 +21,9 @@
  * questions.
  *
  */
-package test;
 
-import org.testng.annotations.Test;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
 import util.ZipFsBaseTest;
 
 import java.io.ByteArrayOutputStream;
@@ -33,7 +33,11 @@ import java.nio.channels.ClosedChannelException;
 import java.nio.channels.FileChannel;
 import java.nio.channels.FileLock;
 import java.nio.channels.SeekableByteChannel;
-import java.nio.file.*;
+import java.nio.file.FileAlreadyExistsException;
+import java.nio.file.FileSystem;
+import java.nio.file.FileSystems;
+import java.nio.file.Files;
+import java.nio.file.Path;
 import java.util.Arrays;
 import java.util.Map;
 import java.util.Random;
@@ -41,15 +45,24 @@ import java.util.Set;
 import java.util.zip.ZipEntry;
 
 import static java.nio.charset.StandardCharsets.UTF_8;
-import static java.nio.file.StandardOpenOption.*;
-import static org.testng.Assert.*;
+import static java.nio.file.StandardOpenOption.APPEND;
+import static java.nio.file.StandardOpenOption.CREATE;
+import static java.nio.file.StandardOpenOption.CREATE_NEW;
+import static java.nio.file.StandardOpenOption.READ;
+import static java.nio.file.StandardOpenOption.WRITE;
+import static org.junit.jupiter.api.Assertions.assertArrayEquals;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertFalse;
+import static org.junit.jupiter.api.Assertions.assertNotNull;
+import static org.junit.jupiter.api.Assertions.assertThrows;
+import static org.junit.jupiter.api.Assertions.assertTrue;
 
-/**
+/*
  * @test
  * @bug 8242006
  * @summary Improve FileChannel and SeekableByteChannel Zip FS test coverage
  * @modules jdk.zipfs
- * @run testng test.ChannelTests
+ * @run junit ChannelTests
  */
 public class ChannelTests extends ZipFsBaseTest {
 
@@ -81,7 +94,8 @@ public class ChannelTests extends ZipFsBaseTest {
      * @param compression The compression used when writing the entries
      * @throws Exception If an error occurs
      */
-    @Test(dataProvider = "zipfsMap")
+    @ParameterizedTest
+    @MethodSource("zipfsMap")
     public void sbcFromOSToZipTest(final Map<String, String> env,
                                    final int compression) throws Exception {
         Entry e00 = Entry.of("Entry-00", compression, FIFTH_MAJOR);
@@ -108,7 +122,8 @@ public class ChannelTests extends ZipFsBaseTest {
      * @param compression The compression used when writing the entries
      * @throws Exception If an error occurs
      */
-    @Test(dataProvider = "zipfsMap")
+    @ParameterizedTest
+    @MethodSource("zipfsMap")
     public void sbcFromZipToOSTest(final Map<String, String> env,
                                    final int compression) throws Exception {
         Entry e0 = Entry.of("Entry-0", compression, THE_SLAMS);
@@ -125,7 +140,7 @@ public class ChannelTests extends ZipFsBaseTest {
         }
         // Check to see if the file exists and the bytes match
         assertTrue(Files.isRegularFile(osFile));
-        assertEquals(Files.readAllBytes(osFile), e0.bytes);
+        assertArrayEquals(e0.bytes, Files.readAllBytes(osFile));
         Files.deleteIfExists(zipFile);
         Files.deleteIfExists(osFile);
     }
@@ -138,7 +153,8 @@ public class ChannelTests extends ZipFsBaseTest {
      * @param compression The compression used when writing the entries
      * @throws Exception If an error occurs
      */
-    @Test(dataProvider = "zipfsMap")
+    @ParameterizedTest
+    @MethodSource("zipfsMap")
     public void sbcFromZipToZipTest(final Map<String, String> env,
                                     final int compression) throws Exception {
         Entry e0 = Entry.of("Entry-0", compression, THE_SLAMS);
@@ -170,7 +186,8 @@ public class ChannelTests extends ZipFsBaseTest {
      * @param expectedCompression The compression to be used when copying the entry
      * @throws Exception If an error occurs
      */
-    @Test(dataProvider = "copyMoveMap")
+    @ParameterizedTest
+    @MethodSource("copyMoveMap")
     public void sbcChangeCompressionTest(final Map<String, String> env,
                                          final int compression,
                                          final int expectedCompression) throws Exception {
@@ -206,7 +223,8 @@ public class ChannelTests extends ZipFsBaseTest {
      * @param compression The compression used when writing the entries
      * @throws Exception If an error occurs
      */
-    @Test(dataProvider = "zipfsMap")
+    @ParameterizedTest
+    @MethodSource("zipfsMap")
     public void sbcReadTest(final Map<String, String> env,
                             final int compression) throws Exception {
         Path zipFile = generatePath(HERE, "test", ".zip");
@@ -222,7 +240,7 @@ public class ChannelTests extends ZipFsBaseTest {
             int bytesRead = sbc.read(buf);
             // Check to see if the expected bytes were read
             byte[] result = Arrays.copyOfRange(buf.array(), 0, bytesRead);
-            assertEquals(THE_SLAMS.getBytes(UTF_8), result);
+            assertArrayEquals(THE_SLAMS.getBytes(UTF_8), result);
         }
         Files.deleteIfExists(zipFile);
     }
@@ -234,7 +252,8 @@ public class ChannelTests extends ZipFsBaseTest {
      * @param compression The compression used when writing the entries
      * @throws Exception If an error occurs
      */
-    @Test(dataProvider = "zipfsMap")
+    @ParameterizedTest
+    @MethodSource("zipfsMap")
     public void sbcWriteTest(final Map<String, String> env,
                              final int compression) throws Exception {
         Entry e0 = Entry.of("Entry-0", compression, THE_SLAMS);
@@ -261,7 +280,8 @@ public class ChannelTests extends ZipFsBaseTest {
      * @param compression The compression used when writing the entries
      * @throws Exception If an error occurs
      */
-    @Test(dataProvider = "zipfsMap")
+    @ParameterizedTest
+    @MethodSource("zipfsMap")
     public void sbcAppendTest(final Map<String, String> env,
                               final int compression) throws Exception {
         Path zipFile = generatePath(HERE, "test", ".zip");
@@ -291,7 +311,8 @@ public class ChannelTests extends ZipFsBaseTest {
      * @param compression The compression used when writing the entries
      * @throws Exception If an error occurs
      */
-    @Test(dataProvider = "zipfsMap")
+    @ParameterizedTest
+    @MethodSource("zipfsMap")
     public void sbcTruncateTest(final Map<String, String> env,
                                 final int compression) throws Exception {
         Path zipFile = generatePath(HERE, "test", ".zip");
@@ -317,7 +338,8 @@ public class ChannelTests extends ZipFsBaseTest {
      * @param compression The compression used when writing the entries
      * @throws Exception If an error occurs
      */
-    @Test(dataProvider = "zipfsMap")
+    @ParameterizedTest
+    @MethodSource("zipfsMap")
     public void sbcFAETest(final Map<String, String> env,
                            final int compression) throws Exception {
         Path zipFile = generatePath(HERE, "test", ".zip");
@@ -344,7 +366,8 @@ public class ChannelTests extends ZipFsBaseTest {
      * @param compression The compression used when writing the entries
      * @throws Exception If an error occurs
      */
-    @Test(dataProvider = "zipfsMap")
+    @ParameterizedTest
+    @MethodSource("zipfsMap")
     public void sbcCloseTest(final Map<String, String> env,
                              final int compression) throws Exception {
         Path zipFile = generatePath(HERE, "test", ".zip");
@@ -369,7 +392,8 @@ public class ChannelTests extends ZipFsBaseTest {
      * @param compression The compression used when writing the entries
      * @throws Exception If an error occurs
      */
-    @Test(dataProvider = "zipfsMap")
+    @ParameterizedTest
+    @MethodSource("zipfsMap")
     public void sbcCCETest(final Map<String, String> env,
                            final int compression) throws Exception {
         Path zipFile = generatePath(HERE, "test", ".zip");
@@ -401,7 +425,8 @@ public class ChannelTests extends ZipFsBaseTest {
      * @param compression The compression used when writing the entries
      * @throws Exception If an error occurs
      */
-    @Test(dataProvider = "zipfsMap")
+    @ParameterizedTest
+    @MethodSource("zipfsMap")
     public void sbcSizeTest(final Map<String, String> env,
                             final int compression) throws Exception {
         Entry e0 = Entry.of("Entry-0", compression, THE_SLAMS);
@@ -412,17 +437,17 @@ public class ChannelTests extends ZipFsBaseTest {
         try (FileSystem zipfs = FileSystems.newFileSystem(zipFile, env);
              SeekableByteChannel sbc = Files.newByteChannel(
                      zipfs.getPath(e0.name), Set.of(READ))) {
-            assertEquals(sbc.size(), THE_SLAMS.length());
+            assertEquals(THE_SLAMS.length(), sbc.size());
         }
         try (FileSystem zipfs = FileSystems.newFileSystem(zipFile, env);
              SeekableByteChannel sbc = Files.newByteChannel(zipfs.getPath(e0.name))) {
-            assertEquals(sbc.size(), THE_SLAMS.length());
+            assertEquals(THE_SLAMS.length(), sbc.size());
         }
         try (FileSystem zipfs = FileSystems.newFileSystem(zipFile, env);
              SeekableByteChannel sbc = Files.newByteChannel(zipfs.getPath("Entry-01")
                      , Set.of(CREATE, WRITE))) {
             sbc.write(ByteBuffer.wrap(FIFTH_MAJOR.getBytes(UTF_8)));
-            assertEquals(sbc.size(), FIFTH_MAJOR.length());
+            assertEquals(FIFTH_MAJOR.length(), sbc.size());
         }
         Files.deleteIfExists(zipFile);
     }
@@ -435,7 +460,8 @@ public class ChannelTests extends ZipFsBaseTest {
      * @param compression The compression used when writing the entries
      * @throws Exception If an error occurs
      */
-    @Test(dataProvider = "zipfsMap")
+    @ParameterizedTest
+    @MethodSource("zipfsMap")
     public void sbcOpenClosedTest(final Map<String, String> env,
                                   final int compression) throws Exception {
         Path zipFile = generatePath(HERE, "test", ".zip");
@@ -462,7 +488,8 @@ public class ChannelTests extends ZipFsBaseTest {
      * @param compression The compression used when writing the entries
      * @throws Exception If an error occurs
      */
-    @Test(dataProvider = "zipfsMap")
+    @ParameterizedTest
+    @MethodSource("zipfsMap")
     public void sbcPositionTest(final Map<String, String> env,
                                 final int compression) throws Exception {
         Path zipFile = generatePath(HERE, "test", ".zip");
@@ -480,7 +507,7 @@ public class ChannelTests extends ZipFsBaseTest {
             for (var i = 0; i < fSize; i++) {
                 long pos = RANDOM.nextInt(seed);
                 sbc.position(pos);
-                assertEquals(sbc.position(), pos);
+                assertEquals(pos, sbc.position());
             }
         }
         Files.deleteIfExists(zipFile);
@@ -496,7 +523,8 @@ public class ChannelTests extends ZipFsBaseTest {
      * @param compression The compression used when writing the entries
      * @throws Exception If an error occurs
      */
-    @Test(dataProvider = "zipfsMap")
+    @ParameterizedTest
+    @MethodSource("zipfsMap")
     public void fcFromOSToZipTest(final Map<String, String> env,
                                   final int compression) throws Exception {
         Entry e0 = Entry.of("Entry-0", compression, THE_SLAMS);
@@ -522,7 +550,8 @@ public class ChannelTests extends ZipFsBaseTest {
      * @param compression The compression used when writing the entries
      * @throws Exception If an error occurs
      */
-    @Test(dataProvider = "zipfsMap")
+    @ParameterizedTest
+    @MethodSource("zipfsMap")
     public void fcFromZipToOSTest(final Map<String, String> env,
                                   final int compression) throws Exception {
         Entry e0 = Entry.of("Entry-0", compression, THE_SLAMS);
@@ -538,7 +567,7 @@ public class ChannelTests extends ZipFsBaseTest {
         }
         // Check to see if the file exists and the bytes match
         assertTrue(Files.isRegularFile(osFile));
-        assertEquals(Files.readAllBytes(osFile), e0.bytes);
+        assertArrayEquals(e0.bytes, Files.readAllBytes(osFile));
         Files.deleteIfExists(zipFile);
         Files.deleteIfExists(osFile);
     }
@@ -551,7 +580,8 @@ public class ChannelTests extends ZipFsBaseTest {
      * @param compression The compression used when writing the entries
      * @throws Exception If an error occurs
      */
-    @Test(dataProvider = "zipfsMap")
+    @ParameterizedTest
+    @MethodSource("zipfsMap")
     public void fcFromZipToZipTest(final Map<String, String> env,
                                    final int compression) throws Exception {
         Entry e0 = Entry.of("Entry-0", compression, THE_SLAMS);
@@ -583,7 +613,8 @@ public class ChannelTests extends ZipFsBaseTest {
      * @param expectedCompression The compression to be used when copying the entry
      * @throws Exception If an error occurs
      */
-    @Test(dataProvider = "copyMoveMap")
+    @ParameterizedTest
+    @MethodSource("copyMoveMap")
     public void fcChangeCompressionTest(final Map<String, String> env,
                                         final int compression,
                                         final int expectedCompression) throws Exception {
@@ -620,7 +651,8 @@ public class ChannelTests extends ZipFsBaseTest {
      * @param compression The compression used when writing the entries
      * @throws Exception If an error occurs
      */
-    @Test(dataProvider = "zipfsMap")
+    @ParameterizedTest
+    @MethodSource("zipfsMap")
     public void fcAppendTest(final Map<String, String> env,
                              final int compression) throws Exception {
         Path zipFile = generatePath(HERE, "test", ".zip");
@@ -647,7 +679,8 @@ public class ChannelTests extends ZipFsBaseTest {
      * @param compression The compression used when writing the entries
      * @throws Exception If an error occurs
      */
-    @Test(dataProvider = "zipfsMap")
+    @ParameterizedTest
+    @MethodSource("zipfsMap")
     public void fcTruncateTest(final Map<String, String> env,
                                final int compression) throws Exception {
         Path zipFile = generatePath(HERE, "test", ".zip");
@@ -672,7 +705,8 @@ public class ChannelTests extends ZipFsBaseTest {
      * @param compression The compression used when writing the entries
      * @throws Exception If an error occurs
      */
-    @Test(dataProvider = "zipfsMap")
+    @ParameterizedTest
+    @MethodSource("zipfsMap")
     public void fcMapTest(final Map<String, String> env,
                           final int compression) throws Exception {
         Path zipFile = generatePath(HERE, "test", ".zip");
@@ -701,7 +735,8 @@ public class ChannelTests extends ZipFsBaseTest {
      * @param compression The compression used when writing the entries
      * @throws Exception If an error occurs
      */
-    @Test(dataProvider = "zipfsMap")
+    @ParameterizedTest
+    @MethodSource("zipfsMap")
     public void fcOpenClosedTest(final Map<String, String> env,
                                  final int compression) throws Exception {
         Path zipFile = generatePath(HERE, "test", ".zip");
@@ -728,7 +763,8 @@ public class ChannelTests extends ZipFsBaseTest {
      * @param compression The compression used when writing the entries
      * @throws Exception If an error occurs
      */
-    @Test(dataProvider = "zipfsMap")
+    @ParameterizedTest
+    @MethodSource("zipfsMap")
     public void fcFAETest(final Map<String, String> env,
                           final int compression) throws Exception {
         Path zipFile = generatePath(HERE, "test", ".zip");
@@ -752,7 +788,8 @@ public class ChannelTests extends ZipFsBaseTest {
      * @param compression The compression used when writing the entries
      * @throws Exception If an error occurs
      */
-    @Test(dataProvider = "zipfsMap")
+    @ParameterizedTest
+    @MethodSource("zipfsMap")
     public void fcCloseTest(final Map<String, String> env,
                              final int compression) throws Exception {
         Path zipFile = generatePath(HERE, "test", ".zip");
@@ -777,7 +814,8 @@ public class ChannelTests extends ZipFsBaseTest {
      * @param compression The compression used when writing the entries
      * @throws Exception If an error occurs
      */
-    @Test(dataProvider = "zipfsMap")
+    @ParameterizedTest
+    @MethodSource("zipfsMap")
     public void fcCCETest(final Map<String, String> env,
                           final int compression) throws Exception {
         Path zipFile = generatePath(HERE, "test", ".zip");
@@ -839,7 +877,8 @@ public class ChannelTests extends ZipFsBaseTest {
      * @param compression The compression used when writing the entries
      * @throws Exception If an error occurs
      */
-    @Test(dataProvider = "zipfsMap")
+    @ParameterizedTest
+    @MethodSource("zipfsMap")
     public void fcReadTest(final Map<String, String> env,
                            final int compression) throws Exception {
         Path zipFile = generatePath(HERE, "test", ".zip");
@@ -854,7 +893,7 @@ public class ChannelTests extends ZipFsBaseTest {
             int bytesRead = fc.read(buf);
             // Check to see if the expected bytes were read
             byte[] result = Arrays.copyOfRange(buf.array(), 0, bytesRead);
-            assertEquals(THE_SLAMS.getBytes(UTF_8), result);
+            assertArrayEquals(THE_SLAMS.getBytes(UTF_8), result);
         }
         Files.deleteIfExists(zipFile);
     }
@@ -867,7 +906,8 @@ public class ChannelTests extends ZipFsBaseTest {
      * @param compression The compression used when writing the entries
      * @throws Exception If an error occurs
      */
-    @Test(dataProvider = "zipfsMap")
+    @ParameterizedTest
+    @MethodSource("zipfsMap")
     public void fcReadPosTest(final Map<String, String> env,
                               final int compression) throws Exception {
         Path zipFile = generatePath(HERE, "test", ".zip");
@@ -882,7 +922,7 @@ public class ChannelTests extends ZipFsBaseTest {
             int bytesRead = fc.read(buf, GRAND_SLAMS_HEADER.length());
             // Check to see if the expected bytes were read
             byte[] result = Arrays.copyOfRange(buf.array(), 0, bytesRead);
-            assertEquals(GRAND_SLAMS.getBytes(UTF_8), result);
+            assertArrayEquals(GRAND_SLAMS.getBytes(UTF_8), result);
         }
         Files.deleteIfExists(zipFile);
     }
@@ -895,7 +935,8 @@ public class ChannelTests extends ZipFsBaseTest {
      * @param compression The compression used when writing the entries
      * @throws Exception If an error occurs
      */
-    @Test(dataProvider = "zipfsMap")
+    @ParameterizedTest
+    @MethodSource("zipfsMap")
     public void fcReadArrayTest(final Map<String, String> env,
                                 final int compression) throws Exception {
         Path zipFile = generatePath(HERE, "test", ".zip");
@@ -921,7 +962,7 @@ public class ChannelTests extends ZipFsBaseTest {
                 bos.write(b.array());
             }
             // Check to see if the returned byte array is what is expected
-            assertEquals(e0.bytes, bos.toByteArray());
+            assertArrayEquals(bos.toByteArray(), e0.bytes);
         }
         Files.deleteIfExists(zipFile);
     }
@@ -934,7 +975,8 @@ public class ChannelTests extends ZipFsBaseTest {
      * @param compression The compression used when writing the entries
      * @throws Exception If an error occurs
      */
-    @Test(dataProvider = "zipfsMap")
+    @ParameterizedTest
+    @MethodSource("zipfsMap")
     public void fcReadArrayWithOffsetTest(final Map<String, String> env,
                                           final int compression) throws Exception {
         Entry e0 = Entry.of("Entry-0", compression, THE_SLAMS);
@@ -969,7 +1011,7 @@ public class ChannelTests extends ZipFsBaseTest {
             bos.write(b.array());
         }
         // Check to see if the returned byte array is what is expected
-        assertEquals(GRAND_SLAMS.getBytes(UTF_8), bos.toByteArray());
+        assertArrayEquals(GRAND_SLAMS.getBytes(UTF_8), bos.toByteArray());
         Files.deleteIfExists(zipFile);
     }
 
@@ -981,7 +1023,8 @@ public class ChannelTests extends ZipFsBaseTest {
      * @param compression The compression used when writing the entries
      * @throws Exception If an error occurs
      */
-    @Test(dataProvider = "zipfsMap")
+    @ParameterizedTest
+    @MethodSource("zipfsMap")
     public void fcTransferToZipTest(final Map<String, String> env,
                                     final int compression) throws Exception {
         Entry e00 = Entry.of("Entry-00", compression, THE_SLAMS);
@@ -995,7 +1038,7 @@ public class ChannelTests extends ZipFsBaseTest {
         }
         // Verify the entry was copied
         verify(zipFile, e00);
-        assertEquals(Files.readAllBytes(osFile), e00.bytes);
+        assertArrayEquals(e00.bytes, Files.readAllBytes(osFile));
         Files.deleteIfExists(osFile);
         Files.deleteIfExists(zipFile);
     }
@@ -1008,7 +1051,8 @@ public class ChannelTests extends ZipFsBaseTest {
      * @param compression The compression used when writing the entries
      * @throws Exception If an error occurs
      */
-    @Test(dataProvider = "zipfsMap")
+    @ParameterizedTest
+    @MethodSource("zipfsMap")
     public void fcTransferToOsTest(final Map<String, String> env,
                                    final int compression) throws Exception {
         Entry e00 = Entry.of("Entry-00", compression, THE_SLAMS);
@@ -1021,7 +1065,7 @@ public class ChannelTests extends ZipFsBaseTest {
             fcTransferTo(zipfs.getPath(e00.name), osFile);
         }
         // Verify the entry was copied
-        assertEquals(Files.readAllBytes(osFile), e00.bytes);
+        assertArrayEquals(e00.bytes, Files.readAllBytes(osFile));
         Files.deleteIfExists(osFile);
         Files.deleteIfExists(zipFile);
     }
@@ -1034,7 +1078,8 @@ public class ChannelTests extends ZipFsBaseTest {
      * @param compression The compression used when writing the entries
      * @throws Exception If an error occurs
      */
-    @Test(dataProvider = "zipfsMap")
+    @ParameterizedTest
+    @MethodSource("zipfsMap")
     public void fcTransferToZipToZipTest(final Map<String, String> env,
                                          final int compression) throws Exception {
         Entry e0 = Entry.of("Entry-0", compression, THE_SLAMS);
@@ -1065,7 +1110,8 @@ public class ChannelTests extends ZipFsBaseTest {
      * @param compression The compression used when writing the entries
      * @throws Exception If an error occurs
      */
-    @Test(dataProvider = "zipfsMap")
+    @ParameterizedTest
+    @MethodSource("zipfsMap")
     public void fcTransferFromOsTest(final Map<String, String> env,
                                      final int compression) throws Exception {
         Entry e00 = Entry.of("Entry-00", compression, THE_SLAMS);
@@ -1079,7 +1125,7 @@ public class ChannelTests extends ZipFsBaseTest {
         }
         // Verify the entry was copied
         zip(zipFile, env, e00);
-        assertEquals(Files.readAllBytes(osFile), e00.bytes);
+        assertArrayEquals(e00.bytes, Files.readAllBytes(osFile));
         Files.deleteIfExists(osFile);
         Files.deleteIfExists(zipFile);
     }
@@ -1092,7 +1138,8 @@ public class ChannelTests extends ZipFsBaseTest {
      * @param compression The compression used when writing the entries
      * @throws Exception If an error occurs
      */
-    @Test(dataProvider = "zipfsMap")
+    @ParameterizedTest
+    @MethodSource("zipfsMap")
     public void fcTransferFromZipTest(final Map<String, String> env,
                                       final int compression) throws Exception {
         Entry e00 = Entry.of("Entry-00", compression, THE_SLAMS);
@@ -1105,7 +1152,7 @@ public class ChannelTests extends ZipFsBaseTest {
             fcTransferFrom(zipfs.getPath(e00.name), osFile);
         }
         // Verify the bytes match
-        assertEquals(Files.readAllBytes(osFile), e00.bytes);
+        assertArrayEquals(e00.bytes, Files.readAllBytes(osFile));
         Files.deleteIfExists(osFile);
         Files.deleteIfExists(zipFile);
     }
@@ -1118,7 +1165,8 @@ public class ChannelTests extends ZipFsBaseTest {
      * @param compression The compression used when writing the entries
      * @throws Exception If an error occurs
      */
-    @Test(dataProvider = "zipfsMap")
+    @ParameterizedTest
+    @MethodSource("zipfsMap")
     public void fcTransferFromZipToZipTest(final Map<String, String> env,
                                            final int compression) throws Exception {
         Entry e0 = Entry.of("Entry-0", compression, THE_SLAMS);
@@ -1148,7 +1196,8 @@ public class ChannelTests extends ZipFsBaseTest {
      * @param compression The compression used when writing the entries
      * @throws Exception If an error occurs
      */
-    @Test(dataProvider = "zipfsMap")
+    @ParameterizedTest
+    @MethodSource("zipfsMap")
     public void fcWriteTest(final Map<String, String> env,
                             final int compression) throws Exception {
         Entry e0 = Entry.of("Entry-0", compression, THE_SLAMS);
@@ -1174,7 +1223,8 @@ public class ChannelTests extends ZipFsBaseTest {
      * @param compression The compression used when writing the entries
      * @throws Exception If an error occurs
      */
-    @Test(dataProvider = "zipfsMap")
+    @ParameterizedTest
+    @MethodSource("zipfsMap")
     public void fcWritePosTest(final Map<String, String> env,
                                final int compression) throws Exception {
         // Use this value to replace the value specified for AUSTRALIAN_OPEN
@@ -1209,7 +1259,8 @@ public class ChannelTests extends ZipFsBaseTest {
      * @param compression The compression used when writing the entries
      * @throws Exception If an error occurs
      */
-    @Test(dataProvider = "zipfsMap")
+    @ParameterizedTest
+    @MethodSource("zipfsMap")
     public void fcWriteArrayTest(final Map<String, String> env,
                                  final int compression) throws Exception {
         Path zipFile = generatePath(HERE, "test", ".zip");
@@ -1227,7 +1278,7 @@ public class ChannelTests extends ZipFsBaseTest {
              FileChannel fc = FileChannel.open(zipfs.getPath(e0.name),
                      Set.of(CREATE, WRITE))) {
             fc.write(bb);
-            assertEquals(fc.size(), GRAND_SLAMS.length());
+            assertEquals(GRAND_SLAMS.length(), fc.size());
         }
         // Verify the entry was created
         verify(zipFile, e0);
@@ -1242,7 +1293,8 @@ public class ChannelTests extends ZipFsBaseTest {
      * @param compression The compression used when writing the entries
      * @throws Exception If an error occurs
      */
-    @Test(dataProvider = "zipfsMap")
+    @ParameterizedTest
+    @MethodSource("zipfsMap")
     public void fcWriteArrayWithOffsetTest(final Map<String, String> env,
                                            final int compression) throws Exception {
 
@@ -1276,7 +1328,7 @@ public class ChannelTests extends ZipFsBaseTest {
             fc.position(GRAND_SLAMS_HEADER.length());
             // Replace the original values
             fc.write(bb, 0, 2);
-            assertEquals(fc.size(), THE_SLAMS.length());
+            assertEquals(THE_SLAMS.length(), fc.size());
         }
         // Verify the entry was updated
         verify(zipFile, e0.content(updatedFile));
@@ -1290,7 +1342,8 @@ public class ChannelTests extends ZipFsBaseTest {
      * @param compression The compression used when writing the entries
      * @throws Exception If an error occurs
      */
-    @Test(dataProvider = "zipfsMap")
+    @ParameterizedTest
+    @MethodSource("zipfsMap")
     public void fcForceWriteTest(final Map<String, String> env,
                             final int compression) throws Exception {
         Entry e0 = Entry.of("Entry-0", compression, THE_SLAMS);
@@ -1317,7 +1370,8 @@ public class ChannelTests extends ZipFsBaseTest {
      * @param compression The compression used when writing the entries
      * @throws Exception If an error occurs
      */
-    @Test(dataProvider = "zipfsMap")
+    @ParameterizedTest
+    @MethodSource("zipfsMap")
     public void fcPositionTest(final Map<String, String> env,
                                 final int compression) throws Exception {
         Path zipFile = generatePath(HERE, "test", ".zip");
@@ -1334,7 +1388,7 @@ public class ChannelTests extends ZipFsBaseTest {
             for (var i = 0; i < fSize; i++) {
                 long pos = RANDOM.nextInt(seed);
                 fc.position(pos);
-                assertEquals(fc.position(), pos);
+                assertEquals(pos, fc.position());
             }
         }
         Files.deleteIfExists(zipFile);
@@ -1347,7 +1401,8 @@ public class ChannelTests extends ZipFsBaseTest {
      * @param compression The compression used when writing the entries
      * @throws Exception If an error occurs
      */
-    @Test(dataProvider = "zipfsMap")
+    @ParameterizedTest
+    @MethodSource("zipfsMap")
     public void fcSizeTest(final Map<String, String> env,
                            final int compression) throws Exception {
         Path osFile = Path.of("GrandSlams.txt");
@@ -1360,29 +1415,29 @@ public class ChannelTests extends ZipFsBaseTest {
         // Validate the file sizes match
         try (FileSystem zipfs = FileSystems.newFileSystem(zipFile, env);
              FileChannel fc = FileChannel.open(zipfs.getPath(e0.name))) {
-            assertEquals(fc.size(), THE_SLAMS.length());
+            assertEquals(THE_SLAMS.length(), fc.size());
         }
         try (FileSystem zipfs = FileSystems.newFileSystem(zipFile, env);
              FileChannel fc = FileChannel.open(zipfs.getPath(e0.name), Set.of(READ))) {
-            assertEquals(fc.size(), THE_SLAMS.length());
+            assertEquals(THE_SLAMS.length(), fc.size());
         }
         try (FileSystem zipfs = FileSystems.newFileSystem(zipFile, env);
              FileChannel fc = FileChannel.open(zipfs.getPath(e0.name), Set.of(READ, WRITE))) {
-            assertEquals(fc.size(), THE_SLAMS.length());
+            assertEquals(THE_SLAMS.length(), fc.size());
         }
         try (FileSystem zipfs = FileSystems.newFileSystem(zipFile, env);
              FileChannel fc = FileChannel.open(zipfs.getPath(e0.name), Set.of(WRITE))) {
-            assertEquals(fc.size(), THE_SLAMS.length());
+            assertEquals(THE_SLAMS.length(), fc.size());
         }
         try (FileSystem zipfs = FileSystems.newFileSystem(zipFile, env);
              FileChannel fc = FileChannel.open(zipfs.getPath(e0.name), Set.of(APPEND))) {
-            assertEquals(fc.size(), THE_SLAMS.length());
+            assertEquals(THE_SLAMS.length(), fc.size());
         }
         try (FileSystem zipfs = FileSystems.newFileSystem(zipFile, env);
              FileChannel fc = FileChannel.open(zipfs.getPath("Entry-01"),
                      Set.of(CREATE, WRITE))) {
             fc.write(ByteBuffer.wrap(FIFTH_MAJOR.getBytes(UTF_8)));
-            assertEquals(fc.size(), FIFTH_MAJOR.length());
+            assertEquals(FIFTH_MAJOR.length(), fc.size());
         }
         Files.deleteIfExists(zipFile);
         Files.deleteIfExists(osFile);
@@ -1395,7 +1450,8 @@ public class ChannelTests extends ZipFsBaseTest {
      * @param compression The compression used when writing the entries
      * @throws Exception If an error occurs
      */
-    @Test(dataProvider = "zipfsMap")
+    @ParameterizedTest
+    @MethodSource("zipfsMap")
     public void fcLockTest(final Map<String, String> env,
                            final int compression) throws Exception {
         Path zipFile = generatePath(HERE, "test", ".zip");
@@ -1426,7 +1482,8 @@ public class ChannelTests extends ZipFsBaseTest {
      * @param compression The compression used when writing the entries
      * @throws Exception If an error occurs
      */
-    @Test(dataProvider = "zipfsMap")
+    @ParameterizedTest
+    @MethodSource("zipfsMap")
     public void fcTryLockTest(final Map<String, String> env,
                               final int compression) throws Exception {
         Path zipFile = generatePath(HERE, "test", ".zip");
diff --git a/test/jdk/jdk/nio/zipfs/CompressionModeTest.java b/test/jdk/jdk/nio/zipfs/CompressionModeTest.java
index 1b024d4addf..1307f6f4ed7 100644
--- a/test/jdk/jdk/nio/zipfs/CompressionModeTest.java
+++ b/test/jdk/jdk/nio/zipfs/CompressionModeTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2019, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2019, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -22,7 +22,6 @@
  *
  */
 
-import org.testng.annotations.*;
 
 import java.io.IOException;
 import java.io.InputStream;
@@ -32,22 +31,27 @@ import java.nio.file.FileSystems;
 import java.nio.file.Files;
 import java.nio.file.Path;
 import java.security.SecureRandom;
-import java.util.Arrays;
 import java.util.HashMap;
 import java.util.Map;
+import java.util.stream.Stream;
 import java.util.zip.ZipEntry;
 import java.util.zip.ZipFile;
 
 import static java.lang.String.format;
 import static java.util.stream.Collectors.joining;
-import static org.testng.Assert.*;
+
+import static org.junit.jupiter.api.Assertions.*;
+
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.Arguments;
+import org.junit.jupiter.params.provider.MethodSource;
 
 /**
  * @test
  * @bug 8231093
  * @summary Test Zip FS compressionMethod property
  * @modules jdk.zipfs
- * @run testng CompressionModeTest
+ * @run junit CompressionModeTest
  */
 public class CompressionModeTest {
 
@@ -77,7 +81,8 @@ public class CompressionModeTest {
      * @throws Exception If an error occurs during the creation, verification or
      *                   deletion of the ZIP file
      */
-    @Test(dataProvider = "validCompressionMethods", enabled = true)
+    @ParameterizedTest
+    @MethodSource("validCompressionMethods")
     public void testValidCompressionMehods(Map<String, String> env,
                                            int compression) throws Exception {
 
@@ -99,7 +104,8 @@ public class CompressionModeTest {
      * @throws Exception if an error occurs other than the expected
      * IllegalArgumentException
      */
-    @Test(dataProvider = "invalidCompressionMethod")
+    @ParameterizedTest
+    @MethodSource("invalidCompressionMethod")
     public void testInvalidCompressionMethod(Map<String, String> env) throws Exception {
         System.out.printf("ZIP FS Map = %s%n ", formatMap(env));
         Path zipfile = generatePath(HERE, "test", ".zip");
@@ -131,44 +137,42 @@ public class CompressionModeTest {
     }
 
     /**
-     * DataProvider used to validate that you can create a ZIP file with and
+     * MethodSource used to validate that you can create a ZIP file with and
      * without compression.
      */
-    @DataProvider(name = "validCompressionMethods")
-    private Object[][] validCompressionMethods() {
-        return new Object[][]{
-                {Map.of("create", "true"), ZipEntry.DEFLATED},
-                {Map.of("create", "true", "noCompression", "true"),
-                        ZipEntry.STORED},
-                {Map.of("create", "true", "noCompression", "false"),
-                        ZipEntry.DEFLATED},
-                {Map.of("create", "true", "compressionMethod", "STORED"),
-                        ZipEntry.STORED},
-                {Map.of("create", "true", "compressionMethod", "DEFLATED"),
-                        ZipEntry.DEFLATED},
-                {Map.of("create", "true", "compressionMethod", "stored"),
-                        ZipEntry.STORED},
-                {Map.of("create", "true", "compressionMethod", "deflated"),
-                        ZipEntry.DEFLATED}
-        };
+    private static Stream<Arguments> validCompressionMethods() {
+        return Stream.of(
+                Arguments.of(Map.of("create", "true"), ZipEntry.DEFLATED),
+                Arguments.of(Map.of("create", "true", "noCompression", "true"),
+                        ZipEntry.STORED),
+                Arguments.of(Map.of("create", "true", "noCompression", "false"),
+                        ZipEntry.DEFLATED),
+                Arguments.of(Map.of("create", "true", "compressionMethod", "STORED"),
+                        ZipEntry.STORED),
+                Arguments.of(Map.of("create", "true", "compressionMethod", "DEFLATED"),
+                        ZipEntry.DEFLATED),
+                Arguments.of(Map.of("create", "true", "compressionMethod", "stored"),
+                        ZipEntry.STORED),
+                Arguments.of(Map.of("create", "true", "compressionMethod", "deflated"),
+                        ZipEntry.DEFLATED)
+        );
     }
 
     /**
-     * DataProvider used to validate that an IllegalArgumentException is thrown
+     * MethodSource used to validate that an IllegalArgumentException is thrown
      * for an invalid value for the compressionMethod property.
      */
-    @DataProvider(name = "invalidCompressionMethod")
-    private Object[][] invalidCompressionMethod() {
+    private static Stream<Arguments> invalidCompressionMethod() {
         HashMap<String, String> map = new HashMap<>();
         map.put("create", "true");
         map.put("compressionMethod", null);
-        return new Object[][]{
-                {map},
-                {Map.of("create", "true", "compressionMethod", "")},
-                {Map.of("create", "true", "compressionMethod",
-                        Integer.parseInt("5"))},
-                {Map.of("create", "true", "compressionMethod", "invalid")}
-        };
+        return Stream.of(
+                Arguments.of(map),
+                Arguments.of(Map.of("create", "true", "compressionMethod", "")),
+                Arguments.of(Map.of("create", "true", "compressionMethod",
+                        Integer.parseInt("5"))),
+                Arguments.of(Map.of("create", "true", "compressionMethod", "invalid"))
+        );
     }
 
     /**
@@ -186,16 +190,16 @@ public class CompressionModeTest {
         // check entries with ZIP API
         try (ZipFile zf = new ZipFile(zipfile.toFile())) {
             // check entry count
-            assertEquals(entries, zf.size());
+            assertEquals(zf.size(), entries);
 
             // check compression method and content of each entry
             for (int i = start; i < entries; i++) {
                 ZipEntry ze = zf.getEntry("Entry-" + i);
                 assertNotNull(ze);
-                assertEquals(method, ze.getMethod());
+                assertEquals(ze.getMethod(), method);
                 try (InputStream is = zf.getInputStream(ze)) {
                     byte[] bytes = is.readAllBytes();
-                    assertTrue(Arrays.equals(bytes, ZIP_FILE_ENTRY));
+                    assertArrayEquals(ZIP_FILE_ENTRY, bytes);
                 }
             }
         }
@@ -209,13 +213,13 @@ public class CompressionModeTest {
                             path.getFileName() != null &&
                             path.getFileName().toString().equals("META-INF")))
                     .count();
-            assertEquals(entries, count);
+            assertEquals(count, entries);
 
             // check content of each entry
             for (int i = start; i < entries; i++) {
                 Path file = fs.getPath("Entry-" + i);
                 byte[] bytes = Files.readAllBytes(file);
-                assertTrue(Arrays.equals(bytes, ZIP_FILE_ENTRY));
+                assertArrayEquals(ZIP_FILE_ENTRY, bytes);
             }
         }
     }
diff --git a/test/jdk/jdk/nio/zipfs/CopyMoveTests.java b/test/jdk/jdk/nio/zipfs/CopyMoveTests.java
index 1991528f521..fc941bfe056 100644
--- a/test/jdk/jdk/nio/zipfs/CopyMoveTests.java
+++ b/test/jdk/jdk/nio/zipfs/CopyMoveTests.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2019, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2019, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -22,29 +22,32 @@
  *
  */
 
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
 
 import java.io.IOException;
 import java.io.InputStream;
 import java.nio.charset.StandardCharsets;
 import java.nio.file.*;
 import java.security.SecureRandom;
-import java.util.Arrays;
 import java.util.Map;
+import java.util.stream.Stream;
 import java.util.zip.ZipEntry;
 import java.util.zip.ZipFile;
 
 import static java.lang.String.format;
 import static java.util.stream.Collectors.joining;
-import static org.testng.Assert.*;
+
+import static org.junit.jupiter.api.Assertions.*;
+
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.Arguments;
+import org.junit.jupiter.params.provider.MethodSource;
 
 /**
  * @test
  * @bug 8231766
  * @summary Test Files::copy and Files::move with Zip FS
  * @modules jdk.zipfs
- * @run testng/othervm CopyMoveTests
+ * @run junit/othervm CopyMoveTests
  */
 public class CopyMoveTests {
     // Enable debugging output
@@ -58,33 +61,31 @@ public class CopyMoveTests {
     private static final SecureRandom random = new SecureRandom();
 
     /*
-     * DataProvider used to verify that a FileAlreadyExistsException is
+     * MethodSource used to verify that a FileAlreadyExistsException is
      * thrown with copying a file without the REPLACE_EXISTING option
      */
-    @DataProvider(name = "zipfsMap")
-    private Object[][] zipfsMap() {
-        return new Object[][]{
-                {Map.of("create", "true"), ZipEntry.DEFLATED},
-                {Map.of("create", "true", "noCompression", "true"),
-                        ZipEntry.STORED},
-                {Map.of("create", "true", "noCompression", "false"),
-                        ZipEntry.DEFLATED}
-        };
+    private static Stream<Arguments> zipfsMap() {
+        return Stream.of(
+                Arguments.of(Map.of("create", "true"), ZipEntry.DEFLATED),
+                Arguments.of(Map.of("create", "true", "noCompression", "true"),
+                        ZipEntry.STORED),
+                Arguments.of(Map.of("create", "true", "noCompression", "false"),
+                        ZipEntry.DEFLATED)
+        );
     }
 
     /*
-     * DataProvider used to verify that an entry may be copied or moved within
+     * MethodSource used to verify that an entry may be copied or moved within
      * a Zip file system with the correct compression method
      */
-    @DataProvider(name = "copyMoveMap")
-    private Object[][] copyMoveMap() {
-        return new Object[][]{
-                {Map.of("create", "true"), ZipEntry.DEFLATED, ZipEntry.STORED},
-                {Map.of("create", "true", "noCompression", "true"),
-                        ZipEntry.STORED, ZipEntry.DEFLATED},
-                {Map.of("create", "true", "noCompression", "false"),
-                        ZipEntry.DEFLATED, ZipEntry.STORED}
-        };
+    private static Stream<Arguments> copyMoveMap() {
+        return Stream.of(
+                Arguments.of(Map.of("create", "true"), ZipEntry.DEFLATED, ZipEntry.STORED),
+                Arguments.of(Map.of("create", "true", "noCompression", "true"),
+                        ZipEntry.STORED, ZipEntry.DEFLATED),
+                Arguments.of(Map.of("create", "true", "noCompression", "false"),
+                        ZipEntry.DEFLATED, ZipEntry.STORED)
+        );
     }
 
     /**
@@ -96,7 +97,8 @@ public class CopyMoveTests {
      * @param expectedCompression The compression to be used when copying the entry
      * @throws Exception If an error occurs
      */
-    @Test(dataProvider = "copyMoveMap", enabled = true)
+    @ParameterizedTest
+    @MethodSource("copyMoveMap")
     public void copyTest(Map<String, String> createMap, int compression,
                          int expectedCompression) throws Exception {
         Entry e0 = Entry.of("Entry-0", compression, ZIP_FILE_VALUE);
@@ -127,7 +129,8 @@ public class CopyMoveTests {
      * @param expectedCompression The compression to be used when copying the entry
      * @throws Exception If an error occurs
      */
-    @Test(dataProvider = "copyMoveMap", enabled = true)
+    @ParameterizedTest
+    @MethodSource("copyMoveMap")
     public void copyZipToZipTest(Map<String, String> createMap, int compression,
                             int expectedCompression) throws Exception {
         Entry e0 = Entry.of("Entry-0", compression, ZIP_FILE_VALUE);
@@ -163,7 +166,8 @@ public class CopyMoveTests {
      * @param expectedCompression The compression to be used when copying the entry
      * @throws Exception If an error occurs
      */
-    @Test(dataProvider = "copyMoveMap", enabled = true)
+    @ParameterizedTest
+    @MethodSource("copyMoveMap")
     public void copyFromOsTest(Map<String, String> createMap, int compression,
                            int expectedCompression) throws Exception {
 
@@ -196,7 +200,8 @@ public class CopyMoveTests {
      * @param expectedCompression The compression to be used when moving the entry
      * @throws Exception If an error occurs
      */
-    @Test(dataProvider = "copyMoveMap", enabled = true)
+    @ParameterizedTest
+    @MethodSource("copyMoveMap")
     public void CopyFromZipTest(Map<String, String> createMap, int compression,
                                 int expectedCompression) throws Exception {
 
@@ -217,7 +222,7 @@ public class CopyMoveTests {
         verify(zipFile, e0, e1);
         // Check to see if the file exists and the bytes match
         assertTrue(Files.isRegularFile(osFile));
-        assertEquals(Files.readAllBytes(osFile), e0.bytes);
+        assertArrayEquals(e0.bytes, Files.readAllBytes(osFile));
         Files.deleteIfExists(zipFile);
         Files.deleteIfExists(osFile);
     }
@@ -231,7 +236,8 @@ public class CopyMoveTests {
      * @param expectedCompression The compression to be used when moving the entry
      * @throws Exception If an error occurs
      */
-    @Test(dataProvider = "copyMoveMap", enabled = true)
+    @ParameterizedTest
+    @MethodSource("copyMoveMap")
     public void moveTest(Map<String, String> createMap, int compression,
                          int expectedCompression) throws Exception {
 
@@ -261,7 +267,8 @@ public class CopyMoveTests {
      * @param expectedCompression The compression to be used when moving the entry
      * @throws Exception If an error occurs
      */
-    @Test(dataProvider = "copyMoveMap", enabled = true)
+    @ParameterizedTest
+    @MethodSource("copyMoveMap")
     public void moveZipToZipTest(Map<String, String> createMap, int compression,
                             int expectedCompression) throws Exception {
 
@@ -299,7 +306,8 @@ public class CopyMoveTests {
      * @param expectedCompression The compression to be used when moving the entry
      * @throws Exception If an error occurs
      */
-    @Test(dataProvider = "copyMoveMap", enabled = true)
+    @ParameterizedTest
+    @MethodSource("copyMoveMap")
     public void moveFromZipTest(Map<String, String> createMap, int compression,
                             int expectedCompression) throws Exception {
 
@@ -320,7 +328,7 @@ public class CopyMoveTests {
         verify(zipFile, e1);
         // Check to see if the file exists and the bytes match
         assertTrue(Files.isRegularFile(osFile));
-        assertEquals(Files.readAllBytes(osFile), e0.bytes);
+        assertArrayEquals(e0.bytes, Files.readAllBytes(osFile));
         Files.deleteIfExists(zipFile);
         Files.deleteIfExists(osFile);
     }
@@ -332,7 +340,8 @@ public class CopyMoveTests {
      * @param createMap Properties used for creating the ZIP Filesystem
      * @throws Exception if an error occurs
      */
-    @Test(dataProvider = "zipfsMap", enabled = true)
+    @ParameterizedTest
+    @MethodSource("zipfsMap")
     public void testFAEWithCopy(Map<String, String> createMap,
                                 int compression) throws Exception {
         if (DEBUG) {
@@ -444,17 +453,17 @@ public class CopyMoveTests {
         // check entries with zip API
         try (ZipFile zf = new ZipFile(zipfile.toFile())) {
             // check entry count
-            assertEquals(entries.length, zf.size());
+            assertEquals(zf.size(), entries.length);
 
             // check compression method and content of each entry
             for (Entry e : entries) {
                 ZipEntry ze = zf.getEntry(e.name);
                 //System.out.printf("Name: %s, method: %s, Expected Method: %s%n", e.name, ze.getMethod(), e.method);
                 assertNotNull(ze);
-                assertEquals(e.method, ze.getMethod());
+                assertEquals(ze.getMethod(), e.method);
                 try (InputStream in = zf.getInputStream(ze)) {
                     byte[] bytes = in.readAllBytes();
-                    assertTrue(Arrays.equals(bytes, e.bytes));
+                    assertArrayEquals(bytes, e.bytes);
                 }
             }
         }
@@ -465,13 +474,13 @@ public class CopyMoveTests {
             Path top = fs.getPath("/");
             long count = Files.find(top, Integer.MAX_VALUE,
                     (path, attrs) -> attrs.isRegularFile()).count();
-            assertEquals(entries.length, count);
+            assertEquals(count, entries.length);
 
             // check content of each entry
             for (Entry e : entries) {
                 Path file = fs.getPath(e.name);
                 byte[] bytes = Files.readAllBytes(file);
-                assertTrue(Arrays.equals(bytes, e.bytes));
+                assertArrayEquals(bytes, e.bytes);
             }
         }
     }
diff --git a/test/jdk/jdk/nio/zipfs/DirectoryStreamTests.java b/test/jdk/jdk/nio/zipfs/DirectoryStreamTests.java
index 0a255caa812..6aaaa4d5cd7 100644
--- a/test/jdk/jdk/nio/zipfs/DirectoryStreamTests.java
+++ b/test/jdk/jdk/nio/zipfs/DirectoryStreamTests.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2019, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2019, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -21,10 +21,6 @@
  * questions.
  */
 
-import org.testng.annotations.AfterClass;
-import org.testng.annotations.BeforeClass;
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
 
 import java.io.IOException;
 import java.nio.file.*;
@@ -33,9 +29,17 @@ import java.util.Iterator;
 import java.util.Map;
 import java.util.NoSuchElementException;
 import java.util.regex.PatternSyntaxException;
+import java.util.stream.Stream;
 import java.util.zip.ZipException;
 
-import static org.testng.Assert.*;
+import org.junit.jupiter.api.AfterAll;
+import static org.junit.jupiter.api.Assertions.*;
+import org.junit.jupiter.api.BeforeAll;
+import org.junit.jupiter.api.Test;
+
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.Arguments;
+import org.junit.jupiter.params.provider.MethodSource;
 
 /**
  * @test
@@ -43,7 +47,7 @@ import static org.testng.Assert.*;
  * @summary ZIP File System tests that leverage DirectoryStream
  * @modules jdk.zipfs
  * @compile DirectoryStreamTests.java
- * @run testng DirectoryStreamTests
+ * @run junit DirectoryStreamTests
  */
 public class DirectoryStreamTests {
 
@@ -65,8 +69,8 @@ public class DirectoryStreamTests {
     /**
      * Create the JAR files used by the tests
      */
-    @BeforeClass
-    public void setUp()  throws Exception {
+    @BeforeAll
+    public static void setUp() throws Exception {
         emptyJarFile = Paths.get("emptyDir.jar");
         try (FileSystem zipfs = ZIPFS_PROVIDER.newFileSystem(emptyJarFile, ZIPFS_MAP)) {
 
@@ -80,8 +84,8 @@ public class DirectoryStreamTests {
     /**
      * Remove JAR files used by test as part of clean-up
      */
-    @AfterClass
-    public void tearDown() throws Exception {
+    @AfterAll
+    public static void tearDown() throws Exception {
             Files.deleteIfExists(jarFile);
             Files.deleteIfExists(emptyJarFile);
     }
@@ -91,7 +95,8 @@ public class DirectoryStreamTests {
      * System and that the returned Iterator correctly indicates whether the
      * filter has been matched
      */
-    @Test(dataProvider = "filterTestValues")
+    @ParameterizedTest
+    @MethodSource("filterValues")
     public void test0000(String glob, boolean expectedResult, String errMsg)
             throws Exception {
 
@@ -106,7 +111,7 @@ public class DirectoryStreamTests {
                          }
              }))
         {
-            assertEquals(ds.iterator().hasNext(), expectedResult, errMsg);
+            assertEquals(expectedResult, ds.iterator().hasNext(), errMsg);
         }
     }
 
@@ -114,7 +119,8 @@ public class DirectoryStreamTests {
      * Validate that you can specify a glob using the ZIP File System and that the
      * returned Iterator correctly indicates whether the glob pattern has been matched
      */
-    @Test(dataProvider = "filterTestValues")
+    @ParameterizedTest
+    @MethodSource("filterValues")
     public void test0001(String glob, boolean expectedResult, String errMsg)
             throws Exception {
 
@@ -122,7 +128,7 @@ public class DirectoryStreamTests {
                 ZIPFS_PROVIDER.newFileSystem(Paths.get("basic.jar"), UNZIPFS_MAP);
              DirectoryStream<Path> ds =
                      Files.newDirectoryStream(zipfs.getPath("/"), glob)) {
-            assertEquals(ds.iterator().hasNext(), expectedResult, errMsg);
+            assertEquals(expectedResult, ds.iterator().hasNext(), errMsg);
         }
     }
 
@@ -144,7 +150,8 @@ public class DirectoryStreamTests {
      * Validate that the correct type of paths are returned when creating a
      * DirectoryStream
      */
-    @Test(dataProvider = "startPaths")
+    @ParameterizedTest
+    @MethodSource("Name")
     public void test0003(String startPath, String expectedPath)
             throws IOException {
         try (FileSystem zipfs =
@@ -153,9 +160,8 @@ public class DirectoryStreamTests {
                      Files.newDirectoryStream(zipfs.getPath(startPath))) {
 
             for (Path entry : stream) {
-                assertTrue(entry.toString().equals(expectedPath),
-                        String.format("Error: Expected path %s not found when"
-                                + " starting at %s%n", expectedPath, entry));
+                assertEquals(entry.toString(), expectedPath, String.format("Error: Expected path %s not found when"
+                        + " starting at %s%n", expectedPath, entry));
             }
         }
     }
@@ -310,35 +316,31 @@ public class DirectoryStreamTests {
     /**
      * Glob values to use to validate filtering
      */
-    @DataProvider(name = "filterTestValues")
-    public static Object[][] filterValues() {
+    public static Stream<Arguments> filterValues() {
 
         String expectedMsg = "Error: Matching entries were expected but not found!!!";
         String notExpectedMsg = "Error: No matching entries expected but were found!!!";
-        return new Object[][]{
-
-                {"M*", true, expectedMsg},
-                {"I*", false, notExpectedMsg}
-        };
+        return Stream.of(
+                Arguments.of("M*", true, expectedMsg),
+                Arguments.of("I*", false, notExpectedMsg)
+        );
     }
 
     /**
      * Starting Path for the DirectoryStream and the expected path to be returned
      * when traversing the stream
      */
-    @DataProvider(name = "startPaths")
-    public static Object[][] Name() {
-        return new Object[][]{
-
-                {"META-INF", "META-INF/services"},
-                {"/META-INF", "/META-INF/services"},
-                {"/META-INF/../META-INF","/META-INF/../META-INF/services" },
-                {"./META-INF", "./META-INF/services"},
-                {"", "META-INF"},
-                {"/", "/META-INF"},
-                {".", "./META-INF"},
-                {"./", "./META-INF"}
-        };
+    public static Stream<Arguments> Name() {
+        return Stream.of(
+                Arguments.of("META-INF", "META-INF/services"),
+                Arguments.of("/META-INF", "/META-INF/services"),
+                Arguments.of("/META-INF/../META-INF", "/META-INF/../META-INF/services" ),
+                Arguments.of("./META-INF", "./META-INF/services"),
+                Arguments.of("", "META-INF"),
+                Arguments.of("/", "/META-INF"),
+                Arguments.of(".", "./META-INF"),
+                Arguments.of("./", "./META-INF")
+        );
     }
 
     /**
diff --git a/test/jdk/jdk/nio/zipfs/EndOfCenValidation.java b/test/jdk/jdk/nio/zipfs/EndOfCenValidation.java
index ed0bdbb52ea..e8012cc3ea3 100644
--- a/test/jdk/jdk/nio/zipfs/EndOfCenValidation.java
+++ b/test/jdk/jdk/nio/zipfs/EndOfCenValidation.java
@@ -142,9 +142,8 @@ public class EndOfCenValidation {
      * @param msg exception message to expect
      */
     private static void verifyRejection(Path zip, String msg) {
-        ZipException ex = assertThrows(ZipException.class, () -> {
-            FileSystems.newFileSystem(zip);
-        });
+        ZipException ex = assertThrows(ZipException.class,
+                () -> FileSystems.newFileSystem(zip));
         assertEquals(msg, ex.getMessage());
     }
 }
diff --git a/test/jdk/jdk/nio/zipfs/HasDotDotTest.java b/test/jdk/jdk/nio/zipfs/HasDotDotTest.java
index 6c6111dd0ab..26a4a597d3a 100644
--- a/test/jdk/jdk/nio/zipfs/HasDotDotTest.java
+++ b/test/jdk/jdk/nio/zipfs/HasDotDotTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2021, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -21,8 +21,6 @@
  * questions.
  *
  */
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
 
 import java.io.IOException;
 import java.nio.charset.StandardCharsets;
@@ -37,14 +35,20 @@ import java.util.zip.CRC32;
 import java.util.zip.ZipEntry;
 import java.util.zip.ZipOutputStream;
 
-import static org.testng.Assert.assertThrows;
-import static org.testng.Assert.assertTrue;
+import static org.junit.jupiter.api.Assertions.assertArrayEquals;
+import static org.junit.jupiter.api.Assertions.assertThrows;
+
+import org.junit.jupiter.api.Test;
+
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.Arguments;
+import org.junit.jupiter.params.provider.MethodSource;
 /**
  * @test
  * @bug 8251329
  * @summary Excercise Zip FS with "." or ".." in a Zip Entry name
  * @modules jdk.zipfs
- * @run testng/othervm HasDotDotTest
+ * @run junit/othervm HasDotDotTest
  */
 public class HasDotDotTest {
     // Zip file to be created
@@ -56,22 +60,21 @@ public class HasDotDotTest {
     private static final boolean DEBUG = false;
 
     /**
-     * DataProvider containing Zip entry names which should result in an IOException
+     * MethodSource containing Zip entry names which should result in an IOException
      * @return Array of Zip entry names
      */
-    @DataProvider
-    private Object[][] checkForDotOrDotDotPaths() {
-        return new Object[][]{
-                {"/./foo"},
-                {"/../foo"},
-                {"/../foo/.."},
-                {"/foo/.."},
-                {"/foo/."},
-                {"/.."},
-                {"/."},
-                {"/.foo/./"},
-                {"/.././"},
-        };
+    private static Stream<Arguments> checkForDotOrDotDotPaths() {
+        return Stream.of(
+                Arguments.of("/./foo"),
+                Arguments.of("/../foo"),
+                Arguments.of("/../foo/.."),
+                Arguments.of("/foo/.."),
+                Arguments.of("/foo/."),
+                Arguments.of("/.."),
+                Arguments.of("/."),
+                Arguments.of("/.foo/./"),
+                Arguments.of("/.././")
+        );
     }
 
     // Zip entry names to create a Zip file with for validating they are not
@@ -111,7 +114,8 @@ public class HasDotDotTest {
      * @param path
      * @throws IOException
      */
-    @Test(dataProvider = "checkForDotOrDotDotPaths")
+    @ParameterizedTest
+    @MethodSource("checkForDotOrDotDotPaths")
     public void hasDotOrDotDotTest(String path) throws IOException {
         if (DEBUG) {
             System.out.printf("Validating entry: %s%n", path);
@@ -147,7 +151,7 @@ public class HasDotDotTest {
                     }
                 }
                 Arrays.sort(EXPECTED_PATHS);
-                assertTrue(Arrays.equals(entries, EXPECTED_PATHS));
+                assertArrayEquals(EXPECTED_PATHS, entries);
             }
         }
         Files.deleteIfExists(ZIPFILE);
diff --git a/test/jdk/jdk/nio/zipfs/InvalidZipHeaderTests.java b/test/jdk/jdk/nio/zipfs/InvalidZipHeaderTests.java
index 92acc98eb84..7a16f3026f2 100644
--- a/test/jdk/jdk/nio/zipfs/InvalidZipHeaderTests.java
+++ b/test/jdk/jdk/nio/zipfs/InvalidZipHeaderTests.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2019, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2019, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -21,10 +21,6 @@
  * questions.
  */
 
-import org.testng.annotations.AfterClass;
-import org.testng.annotations.BeforeClass;
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
 
 import java.io.FileOutputStream;
 import java.io.IOException;
@@ -36,9 +32,17 @@ import java.util.List;
 import java.util.jar.JarEntry;
 import java.util.jar.JarOutputStream;
 import java.util.stream.Collectors;
+import java.util.stream.Stream;
 
 import static java.nio.file.Files.walk;
-import static org.testng.Assert.*;
+
+import org.junit.jupiter.api.AfterAll;
+import static org.junit.jupiter.api.Assertions.*;
+import org.junit.jupiter.api.BeforeAll;
+
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.Arguments;
+import org.junit.jupiter.params.provider.MethodSource;
 
 /**
  * @test
@@ -46,7 +50,7 @@ import static org.testng.Assert.*;
  * @summary Validate that you can iterate a ZIP file with invalid ZIP header entries
  * @modules jdk.zipfs
  * @compile InvalidZipHeaderTests.java
- * @run testng InvalidZipHeaderTests
+ * @run junit InvalidZipHeaderTests
  */
 public class InvalidZipHeaderTests {
 
@@ -57,16 +61,16 @@ public class InvalidZipHeaderTests {
     /**
      * Create the JAR files used by the tests
      */
-    @BeforeClass
-    public void setUp() throws Exception {
+    @BeforeAll
+    public static void setUp() throws Exception {
         createInvalidJarFile();
     }
 
     /**
      * Remove JAR files used by test as part of clean-up
      */
-    @AfterClass
-    public void tearDown() throws Exception {
+    @AfterAll
+    public static void tearDown() throws Exception {
         Files.deleteIfExists(Path.of(INVALID_JAR_FILE));
     }
 
@@ -75,17 +79,17 @@ public class InvalidZipHeaderTests {
      * Validate that you can walk a ZIP archive with header entries
      * such as "foo//"
      */
-    @Test(dataProvider = "startPaths")
+    @ParameterizedTest
+    @MethodSource("Name")
     public void walkInvalidHeaderTest(String startPath, List<String> expectedPaths)
             throws IOException {
         try (FileSystem zipfs =
                      FileSystems.newFileSystem(Path.of(INVALID_JAR_FILE))) {
             List<String> result = walk(zipfs.getPath(startPath))
                     .map(f -> f.toString()).collect(Collectors.toList());
-            assertTrue(result.equals(expectedPaths),
-                    String.format("Error: Expected paths not found when walking"
-                                    + "%s,  starting at %s%n", INVALID_JAR_FILE,
-                            startPath));
+            assertEquals(result, expectedPaths, String.format("Error: Expected paths not found when walking"
+                            + "%s,  starting at %s%n", INVALID_JAR_FILE,
+                    startPath));
         }
     }
 
@@ -94,18 +98,16 @@ public class InvalidZipHeaderTests {
      * Starting Path for walking the ZIP archive and the expected paths to be returned
      * when traversing the archive
      */
-    @DataProvider(name = "startPaths")
-    public static Object[][] Name() {
-        return new Object[][]{
-
-                {"luckydog", List.of("luckydog", "luckydog/outfile.txt")},
-                {"/luckydog", List.of("/luckydog", "/luckydog/outfile.txt")},
-                {"./luckydog", List.of("./luckydog", "./luckydog/outfile.txt")},
-                {"", List.of( "", "luckydog", "luckydog/outfile.txt")},
-                {"/", List.of("/", "/luckydog", "/luckydog/outfile.txt")},
-                {".", List.of(".", "./luckydog", "./luckydog/outfile.txt")},
-                {"./", List.of(".", "./luckydog", "./luckydog/outfile.txt")}
-        };
+    public static Stream<Arguments> Name() {
+        return Stream.of(
+                Arguments.of("luckydog", List.of("luckydog", "luckydog/outfile.txt")),
+                Arguments.of("/luckydog", List.of("/luckydog", "/luckydog/outfile.txt")),
+                Arguments.of("./luckydog", List.of("./luckydog", "./luckydog/outfile.txt")),
+                Arguments.of("", List.of( "", "luckydog", "luckydog/outfile.txt")),
+                Arguments.of("/", List.of("/", "/luckydog", "/luckydog/outfile.txt")),
+                Arguments.of(".", List.of(".", "./luckydog", "./luckydog/outfile.txt")),
+                Arguments.of("./", List.of(".", "./luckydog", "./luckydog/outfile.txt"))
+        );
     }
 
     /**
diff --git a/test/jdk/jdk/nio/zipfs/LargeCompressedEntrySizeTest.java b/test/jdk/jdk/nio/zipfs/LargeCompressedEntrySizeTest.java
index 1dcfe461dda..44ec884db2d 100644
--- a/test/jdk/jdk/nio/zipfs/LargeCompressedEntrySizeTest.java
+++ b/test/jdk/jdk/nio/zipfs/LargeCompressedEntrySizeTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2021, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -22,9 +22,6 @@
  *
  */
 
-import org.testng.annotations.AfterMethod;
-import org.testng.annotations.BeforeMethod;
-import org.testng.annotations.Test;
 
 import java.io.IOException;
 import java.io.OutputStream;
@@ -36,24 +33,28 @@ import java.util.Collections;
 import java.util.Random;
 import java.util.concurrent.TimeUnit;
 
+import org.junit.jupiter.api.AfterEach;
+import org.junit.jupiter.api.BeforeEach;
+import org.junit.jupiter.api.Test;
+
 /**
  * @test
  * @bug 8190753 8011146
  * @summary Verify that using zip filesystem for opening an outputstream for a zip entry whose
  * compressed size is large, doesn't run into "Negative initial size" exception
- * @run testng/manual/othervm LargeCompressedEntrySizeTest
+ * @run junit/manual/othervm LargeCompressedEntrySizeTest
  */
 public class LargeCompressedEntrySizeTest {
 
     private static final String LARGE_FILE_NAME = "LargeZipEntry.txt";
     private static final String ZIP_FILE_NAME = "8190753-test-compressed-size.zip";
 
-    @BeforeMethod
+    @BeforeEach
     public void setUp() throws IOException {
         deleteFiles();
     }
 
-    @AfterMethod
+    @AfterEach
     public void tearDown() throws IOException {
         deleteFiles();
     }
diff --git a/test/jdk/jdk/nio/zipfs/LargeEntriesTest.java b/test/jdk/jdk/nio/zipfs/LargeEntriesTest.java
index 3b05f3339d7..45251c95718 100644
--- a/test/jdk/jdk/nio/zipfs/LargeEntriesTest.java
+++ b/test/jdk/jdk/nio/zipfs/LargeEntriesTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2019, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2019, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -22,32 +22,37 @@
  *
  */
 
-import org.testng.annotations.*;
-
 import java.io.*;
 import java.nio.charset.StandardCharsets;
 import java.nio.file.FileSystem;
 import java.nio.file.*;
 import java.security.SecureRandom;
-import java.util.Arrays;
-import java.util.ArrayList;
-import java.util.List;
 import java.util.Map;
 import java.util.function.Consumer;
+import java.util.stream.Stream;
 import java.util.zip.ZipEntry;
 import java.util.zip.ZipFile;
 
 import static java.lang.Boolean.TRUE;
 import static java.lang.String.format;
 import static java.util.stream.Collectors.joining;
-import static org.testng.Assert.*;
 
-/**
+import org.junit.jupiter.api.AfterAll;
+import org.junit.jupiter.api.AfterEach;
+import static org.junit.jupiter.api.Assertions.*;
+import org.junit.jupiter.api.BeforeAll;
+import org.junit.jupiter.api.BeforeEach;
+
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.Arguments;
+import org.junit.jupiter.params.provider.MethodSource;
+
+/*
  * @test
  * @bug 8230870
  * @summary Test ZIP Filesystem behavior with ~64k entries
  * @modules jdk.zipfs
- * @run testng LargeEntriesTest
+ * @run junit/othervm LargeEntriesTest
  */
 public class LargeEntriesTest {
 
@@ -86,34 +91,41 @@ public class LargeEntriesTest {
     private static final SecureRandom random = new SecureRandom();
 
     /**
-     * Fields used for timing runs
+     * Fields used for timing runs.
+     * Toggle on by running with "-Dtiming.enabled=true".
      */
     private static int testNumberRunning;
     private static long runningTestTime;
     private static long startTestRunTime;
     private static final double NANOS_IN_SECOND = 1_000_000_000.0;
+    private static final boolean TIMING_ENABLED =
+            Boolean.getBoolean("timing.enabled");
 
-    @BeforeTest(enabled = false)
-    public void beforeTest() {
+    @BeforeAll
+    public static void beforeTest() {
+        if (!TIMING_ENABLED) return;
         startTestRunTime = System.nanoTime();
     }
 
-    @AfterTest(enabled = false)
-    public void afterTest() {
+    @AfterAll
+    public static void afterTest() {
+        if (!TIMING_ENABLED) return;
         long endTestRunTime = System.nanoTime();
         long duration = endTestRunTime - startTestRunTime;
         System.out.printf("#### Completed test run, total running time: %.4f in seconds%n",
                 duration / NANOS_IN_SECOND);
     }
 
-    @BeforeMethod(enabled = false)
-    public static void beforeMethod() {
+    @BeforeEach
+    public void beforeMethod() {
+        if (!TIMING_ENABLED) return;
         runningTestTime = System.nanoTime();
         System.out.printf("**** Starting test number: %s%n", testNumberRunning);
     }
 
-    @AfterMethod(enabled = false)
+    @AfterEach
     public void afterMethod() {
+        if (!TIMING_ENABLED) return;
         long endRunningTestTime = System.nanoTime();
         long duration = endRunningTestTime - runningTestTime;
         System.out.printf("**** Completed test number: %s, Time: %.4f%n",
@@ -132,7 +144,8 @@ public class LargeEntriesTest {
      * @throws Exception If an error occurs during the creation, verification or
      *                   deletion of the ZIP file
      */
-    @Test(dataProvider = "zipfsMap", enabled = true)
+    @ParameterizedTest
+    @MethodSource("zipfsMap")
     public void testZip(Map<String, String> env, int compression) throws Exception {
 
         System.out.printf("ZIP FS Map = %s, Compression mode= %s%n ",
@@ -158,7 +171,8 @@ public class LargeEntriesTest {
      * @throws Exception If an error occurs during the creation, verification or
      *                   deletion of the ZIP file
      */
-    @Test(dataProvider = "zip64Map", enabled = true)
+    @ParameterizedTest
+    @MethodSource("zip64Map")
     public void testForceZIP64End(Map<String, String> env, int compression) throws Exception {
 
         System.out.printf("ZIP FS Map = %s, Compression mode= %s%n ",
@@ -183,7 +197,8 @@ public class LargeEntriesTest {
      * @throws Exception If an error occurs during the creation, verification or
      *                   deletion of the JAR file
      */
-    @Test(dataProvider = "zipfsMap", enabled = true)
+    @ParameterizedTest
+    @MethodSource("zipfsMap")
     public void testJar(Map<String, String> env, int compression) throws Exception {
         for (int entries = ZIP64_ENTRIES - 1; entries < ZIP64_ENTRIES + 2; entries++) {
             Path jar = generatePath(HERE, "test", ".jar");
@@ -271,36 +286,34 @@ public class LargeEntriesTest {
     }
 
     /*
-     * DataProvider used to validate that you can create a ZIP file with and
+     * MethodSource used to validate that you can create a ZIP file with and
      * without compression.
      */
-    @DataProvider(name = "zipfsMap")
-    private Object[][] zipfsMap() {
-        return new Object[][]{
-                {Map.of("create", "true"), ZipEntry.DEFLATED},
-                {Map.of("create", "true", "noCompression", "true"),
-                        ZipEntry.STORED},
-                {Map.of("create", "true", "noCompression", "false"),
-                        ZipEntry.DEFLATED}
-        };
+    private static Stream<Arguments> zipfsMap() {
+        return Stream.of(
+                Arguments.of(Map.of("create", "true"), ZipEntry.DEFLATED),
+                Arguments.of(Map.of("create", "true", "noCompression", "true"),
+                        ZipEntry.STORED),
+                Arguments.of(Map.of("create", "true", "noCompression", "false"),
+                        ZipEntry.DEFLATED)
+        );
     }
 
     /*
-     * DataProvider used to validate that you can create a ZIP file with/without
+     * MethodSource used to validate that you can create a ZIP file with/without
      * ZIP64 format extensions
      */
-    @DataProvider(name = "zip64Map")
-    private Object[][] zip64Map() {
-        return new Object[][]{
-                {Map.of("create", "true", "forceZIP64End", "true"),
-                        ZipEntry.DEFLATED},
-                {Map.of("create", "true", "noCompression", "true",
-                        "forceZIP64End", "true"), ZipEntry.STORED},
-                {Map.of("create", "true", "noCompression", "false",
-                        "forceZIP64End", "false"), ZipEntry.DEFLATED},
-                {Map.of("create", "true", "noCompression", "true",
-                        "forceZIP64End", "false"), ZipEntry.STORED}
-        };
+    private static Stream<Arguments> zip64Map() {
+        return Stream.of(
+                Arguments.of(Map.of("create", "true", "forceZIP64End", "true"),
+                        ZipEntry.DEFLATED),
+                Arguments.of(Map.of("create", "true", "noCompression", "true",
+                        "forceZIP64End", "true"), ZipEntry.STORED),
+                Arguments.of(Map.of("create", "true", "noCompression", "false",
+                        "forceZIP64End", "false"), ZipEntry.DEFLATED),
+                Arguments.of(Map.of("create", "true", "noCompression", "true",
+                        "forceZIP64End", "false"), ZipEntry.STORED)
+        );
     }
 
     /**
@@ -319,16 +332,16 @@ public class LargeEntriesTest {
         // check entries with ZIP API
         try (ZipFile zf = new ZipFile(zipfile.toFile())) {
             // check entry count
-            assertEquals(entries, zf.size());
+            assertEquals(zf.size(), entries);
 
             // check compression method and content of each entry
             for (int i = start; i < entries; i++) {
                 ZipEntry ze = zf.getEntry("Entry-" + i);
                 assertNotNull(ze);
-                assertEquals(method, ze.getMethod());
+                assertEquals(ze.getMethod(), method);
                 try (InputStream is = zf.getInputStream(ze)) {
                     byte[] bytes = is.readAllBytes();
-                    assertTrue(Arrays.equals(bytes, ZIP_FILE_ENTRY));
+                    assertArrayEquals(ZIP_FILE_ENTRY, bytes);
                 }
             }
         }
@@ -342,13 +355,13 @@ public class LargeEntriesTest {
                             path.getFileName() != null &&
                             path.getFileName().toString().equals("META-INF")))
                     .count();
-            assertEquals(entries, count);
+            assertEquals(count, entries);
 
             // check content of each entry
             for (int i = start; i < entries; i++) {
                 Path file = fs.getPath("Entry-" + i);
                 byte[] bytes = Files.readAllBytes(file);
-                assertTrue(Arrays.equals(bytes, ZIP_FILE_ENTRY));
+                assertArrayEquals(ZIP_FILE_ENTRY, bytes);
             }
         }
 
@@ -359,7 +372,7 @@ public class LargeEntriesTest {
         boolean requireZip64 = entries >= ZIP64_ENTRIES || isZip64Forced;
         System.out.printf(" isZip64Forced = %s, foundZip64= %s, requireZip64= %s%n",
                 isZip64Forced, foundZip64, requireZip64);
-        assertEquals(requireZip64, foundZip64);
+        assertEquals(foundZip64, requireZip64);
 
 
     }
@@ -515,7 +528,7 @@ public class LargeEntriesTest {
          * @return This Result object
          */
         Result assertSuccess() {
-            assertEquals(ec, 0, format("Expected ec 0, received: %s, output [%s]", ec, output));
+            assertEquals(0, ec, format("Expected ec 0, received: %s, output [%s]", ec, output));
             return this;
         }
 
diff --git a/test/jdk/jdk/nio/zipfs/testng/test/ManifestOrderTest.java b/test/jdk/jdk/nio/zipfs/ManifestOrderTest.java
similarity index 91%
rename from test/jdk/jdk/nio/zipfs/testng/test/ManifestOrderTest.java
rename to test/jdk/jdk/nio/zipfs/ManifestOrderTest.java
index e3ee1bac778..7eb8f70d1b7 100644
--- a/test/jdk/jdk/nio/zipfs/testng/test/ManifestOrderTest.java
+++ b/test/jdk/jdk/nio/zipfs/ManifestOrderTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2020, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -21,33 +21,45 @@
  * questions.
  *
  */
-package test;
 
-import org.testng.annotations.BeforeSuite;
-import org.testng.annotations.Test;
+import org.junit.jupiter.api.BeforeAll;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
 import util.ZipFsBaseTest;
 
 import java.io.InputStream;
 import java.io.OutputStream;
-import java.nio.file.*;
+import java.nio.file.FileSystem;
+import java.nio.file.FileSystems;
+import java.nio.file.Files;
+import java.nio.file.Path;
+import java.nio.file.Paths;
 import java.util.Arrays;
 import java.util.HashMap;
 import java.util.Map;
-import java.util.jar.*;
+import java.util.jar.Attributes;
 import java.util.jar.Attributes.Name;
+import java.util.jar.JarEntry;
+import java.util.jar.JarFile;
+import java.util.jar.JarInputStream;
+import java.util.jar.Manifest;
 import java.util.spi.ToolProvider;
 import java.util.stream.Collectors;
 import java.util.zip.ZipEntry;
 
-import static org.testng.Assert.*;
+import static org.junit.jupiter.api.Assertions.assertArrayEquals;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertNotNull;
+import static org.junit.jupiter.api.Assertions.assertNull;
+import static org.junit.jupiter.api.Assertions.assertTrue;
 
-/**
+/*
  * @test
  * @bug 8211917
  * @summary Validate that Zip FS will always add META-INF/MANIFEST.MF to the
  * beginning of a Zip file allowing the Manifest be found and processed
  * by java.util.jar.JarInputStream.
-
+ * @run junit ManifestOrderTest
  */
 public class ManifestOrderTest extends ZipFsBaseTest {
 
@@ -73,8 +85,8 @@ public class ManifestOrderTest extends ZipFsBaseTest {
     /**
      * Create the Manifests and Map of attributes included in the Manifests
      */
-    @BeforeSuite
-    public void setup() {
+    @BeforeAll
+    public static void setup() {
         String jdkVendor = System.getProperty("java.vendor");
         String jdkVersion = System.getProperty("java.version");
         String attributeKey = "Player";
@@ -109,7 +121,8 @@ public class ManifestOrderTest extends ZipFsBaseTest {
      * @param compression The compression used when writing the entries
      * @throws Exception If an error occurs
      */
-    @Test(dataProvider = "zipfsMap")
+    @ParameterizedTest
+    @MethodSource("zipfsMap")
     public void testJarWithManifestAddedFirst(final Map<String, String> env,
                                               final int compression)
             throws Exception {
@@ -137,7 +150,8 @@ public class ManifestOrderTest extends ZipFsBaseTest {
      * @param compression The compression used when writing the entries
      * @throws Exception If an error occurs
      */
-    @Test(dataProvider = "zipfsMap")
+    @ParameterizedTest
+    @MethodSource("zipfsMap")
     public void testJarWithManifestAddedLast(final Map<String, String> env,
                                              final int compression) throws Exception {
         final Path jarPath = generatePath(HERE, "test", ".jar");
@@ -164,7 +178,8 @@ public class ManifestOrderTest extends ZipFsBaseTest {
      * @param compression The compression used when writing the entries
      * @throws Exception If an error occurs
      */
-    @Test(dataProvider = "zipfsMap")
+    @ParameterizedTest
+    @MethodSource("zipfsMap")
     public void testJarWithManifestAddedInBetween(final Map<String, String> env,
                                                   final int compression)
             throws Exception {
@@ -192,7 +207,8 @@ public class ManifestOrderTest extends ZipFsBaseTest {
      * @param compression The compression used when writing the entries
      * @throws Exception If an error occurs
      */
-    @Test(dataProvider = "zipfsMap")
+    @ParameterizedTest
+    @MethodSource("zipfsMap")
     public void testJarWithNoManifest(final Map<String, String> env,
                                       final int compression) throws Exception {
         final Path jarPath = generatePath(HERE, "test", ".jar");
@@ -218,7 +234,8 @@ public class ManifestOrderTest extends ZipFsBaseTest {
      * @param compression The compression used when writing the entries
      * @throws Exception If an error occurs
      */
-    @Test(dataProvider = "zipfsMap")
+    @ParameterizedTest
+    @MethodSource("zipfsMap")
     public void testManifestCopiedFromOSFile(final Map<String, String> env,
                                              final int compression) throws Exception {
         final Path jarPath = generatePath(HERE, "test", ".jar");
@@ -248,7 +265,8 @@ public class ManifestOrderTest extends ZipFsBaseTest {
      * @param compression The compression used when writing the entries
      * @throws Exception If an error occurs
      */
-    @Test(dataProvider = "zipfsMap")
+    @ParameterizedTest
+    @MethodSource("zipfsMap")
     public void copyJarToJarTest(final Map<String, String> env, final int compression)
             throws Exception {
         final Path jarPath = generatePath(HERE, "test", ".jar");
@@ -290,7 +308,8 @@ public class ManifestOrderTest extends ZipFsBaseTest {
      * @param compression The compression used when writing the entries
      * @throws Exception If an error occurs
      */
-    @Test(dataProvider = "compressionMethods")
+    @ParameterizedTest
+    @MethodSource("compressionMethods")
     public void testJarToolGeneratedJarWithManifest(final int compression)
             throws Exception {
 
@@ -319,7 +338,7 @@ public class ManifestOrderTest extends ZipFsBaseTest {
                 jarPath.getFileName().toString(),
                 manifestFile.toAbsolutePath().toString(),
                 "-C", tmpdir.toAbsolutePath().toString(), ".");
-        assertEquals(exitCode, 0, "jar tool exited with failure");
+        assertEquals(0, exitCode, "jar tool exited with failure");
         verify(jarPath, MANIFEST_ATTRS, compression, entries);
 
         // Add an additional entry and re-verify
@@ -338,7 +357,8 @@ public class ManifestOrderTest extends ZipFsBaseTest {
      * @param compression The compression used when writing the entries
      * @throws Exception If an error occurs
      */
-    @Test(dataProvider = "zipfsMap")
+    @ParameterizedTest
+    @MethodSource("zipfsMap")
     public void createWithManifestTest(final Map<String, String> env,
                                        final int compression) throws Exception {
         Path jarPath = generatePath(HERE, "test", ".jar");
@@ -373,7 +393,8 @@ public class ManifestOrderTest extends ZipFsBaseTest {
      * @param compression The compression used when writing the entries
      * @throws Exception If an error occurs
      */
-    @Test(dataProvider = "zipfsMap")
+    @ParameterizedTest
+    @MethodSource("zipfsMap")
     public void updateManifestTest(final Map<String, String> env,
                                    final int compression) throws Exception {
         final Path jarPath = generatePath(HERE, "test", ".jar");
@@ -442,12 +463,12 @@ public class ManifestOrderTest extends ZipFsBaseTest {
                     }
                     final Entry e = expected.remove(je.getName());
                     assertNotNull(e, "Unexpected entry in jar ");
-                    assertEquals(je.getMethod(), e.method, "Compression method mismatch");
-                    assertEquals(jis.readAllBytes(), e.bytes);
+                    assertEquals(e.method, je.getMethod(), "Compression method mismatch");
+                    assertArrayEquals(e.bytes, jis.readAllBytes());
 
                     je = jis.getNextJarEntry();
                 }
-                assertEquals(expected.size(), 0, "Missing entries in jar!");
+                assertEquals(0, expected.size(), "Missing entries in jar!");
             }
         }
 
@@ -462,14 +483,14 @@ public class ManifestOrderTest extends ZipFsBaseTest {
                     System.out.printf("Entry Name: %s, method: %s, Expected Method: %s%n",
                             e.name, je.getMethod(), e.method);
                 }
-                assertEquals(e.method, je.getMethod(), "Compression methods mismatch");
+                assertEquals(je.getMethod(), e.method, "Compression methods mismatch");
                 try (InputStream in = jf.getInputStream(je)) {
                     byte[] bytes = in.readAllBytes();
                     if (DEBUG) {
                         System.out.printf("bytes= %s, actual=%s%n",
                                 new String(bytes), new String(e.bytes));
                     }
-                    assertTrue(Arrays.equals(bytes, e.bytes), "Entries do not match");
+                    assertArrayEquals(bytes, e.bytes, "Entries do not match");
                 }
             }
         }
@@ -480,7 +501,7 @@ public class ManifestOrderTest extends ZipFsBaseTest {
             Path top = fs.getPath("/");
             long count = Files.find(top, Integer.MAX_VALUE,
                     (path, attrs) -> attrs.isRegularFile()).count();
-            assertEquals(entries.length + (!attributes.isEmpty() ? 1 : 0), count);
+            assertEquals(count, entries.length + (!attributes.isEmpty() ? 1 : 0));
             Path mf = fs.getPath("META-INF", "MANIFEST.MF");
             Manifest m = null;
 
@@ -497,7 +518,7 @@ public class ManifestOrderTest extends ZipFsBaseTest {
                     System.out.printf("Entry name = %s, bytes= %s, actual=%s%n", e.name,
                             new String(Files.readAllBytes(file)), new String(e.bytes));
                 }
-                assertEquals(Files.readAllBytes(file), e.bytes);
+                assertArrayEquals(e.bytes, Files.readAllBytes(file));
             }
         }
     }
@@ -519,7 +540,7 @@ public class ManifestOrderTest extends ZipFsBaseTest {
                     System.out.printf("Key: %s, Value: %s%n", k, v);
                 }
                 assertTrue(attrs.containsKey(k));
-                assertEquals(v, attrs.get(k));
+                assertEquals(attrs.get(k), v);
             });
         } else {
             assertNull(m, "Manifest was found!");
diff --git a/test/jdk/jdk/nio/zipfs/NewFileSystemTests.java b/test/jdk/jdk/nio/zipfs/NewFileSystemTests.java
index d9da79be126..b72fc765b68 100644
--- a/test/jdk/jdk/nio/zipfs/NewFileSystemTests.java
+++ b/test/jdk/jdk/nio/zipfs/NewFileSystemTests.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2019, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2019, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -21,11 +21,6 @@
  * questions.
  */
 
-import org.testng.annotations.AfterClass;
-import org.testng.annotations.BeforeClass;
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
-import org.testng.SkipException;
 
 import java.io.IOException;
 import java.net.URI;
@@ -36,14 +31,26 @@ import java.nio.file.NoSuchFileException;
 import java.nio.file.Path;
 import java.util.Iterator;
 import java.util.Map;
+import java.util.stream.Stream;
+
 import jdk.test.lib.Platform;
 
 import static java.nio.charset.StandardCharsets.UTF_8;
-import static org.testng.Assert.assertEquals;
-import static org.testng.Assert.assertFalse;
-import static org.testng.Assert.assertNotNull;
-import static org.testng.Assert.assertThrows;
-import static org.testng.Assert.assertTrue;
+
+import org.junit.jupiter.api.AfterAll;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertFalse;
+import static org.junit.jupiter.api.Assertions.assertNotNull;
+import static org.junit.jupiter.api.Assertions.assertThrows;
+import static org.junit.jupiter.api.Assertions.assertTrue;
+import org.junit.jupiter.api.Assumptions;
+import org.junit.jupiter.api.BeforeAll;
+import org.junit.jupiter.api.Test;
+
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.Arguments;
+import org.junit.jupiter.params.provider.MethodSource;
+import org.junit.jupiter.params.provider.NullSource;
 
 /**
  * @test
@@ -52,7 +59,7 @@ import static org.testng.Assert.assertTrue;
  * @modules jdk.zipfs
  * @library /test/lib
  * @compile NewFileSystemTests.java
- * @run testng NewFileSystemTests
+ * @run junit NewFileSystemTests
  */
 public class NewFileSystemTests {
 
@@ -68,8 +75,8 @@ public class NewFileSystemTests {
     /**
      * Create the JAR file used by the tests
      */
-    @BeforeClass
-    public void setUp() throws Exception {
+    @BeforeAll
+    public static void setUp() throws Exception {
         jarFile = Utils.createJarFile("basic.jar",
                 "README");
         jarURI = new URI(ZIPFS_SCHEME, jarFile.toUri().toString(), null);
@@ -79,8 +86,8 @@ public class NewFileSystemTests {
     /**
      * Remove JAR file used by test as part of clean-up
      */
-    @AfterClass
-    public void tearDown() throws Exception {
+    @AfterAll
+    public static void tearDown() throws Exception {
         Files.deleteIfExists(jarFile);
     }
 
@@ -117,7 +124,9 @@ public class NewFileSystemTests {
      *
      * @throws IOException
      */
-    @Test(dataProvider = "classLoaders")
+    @ParameterizedTest
+    @MethodSource("classLoaders")
+    @NullSource
     public void testNewFileSystemPathClassLoader(ClassLoader cl) throws Exception {
         try (FileSystem zipfs = FileSystems.newFileSystem(Path.of("basic.jar"),
                 cl)) {
@@ -131,7 +140,9 @@ public class NewFileSystemTests {
      *
      * @throws IOException
      */
-    @Test(dataProvider = "classLoaders")
+    @ParameterizedTest
+    @MethodSource("classLoaders")
+    @NullSource
     public void testNewFileSystemPathMapClassLoader(ClassLoader cl) throws Exception {
         try (FileSystem zipfs = FileSystems.newFileSystem(Path.of("basic.jar"),
                 ZIPFS_OPTIONS, cl)) {
@@ -158,7 +169,9 @@ public class NewFileSystemTests {
      *
      * @throws IOException
      */
-    @Test(dataProvider = "classLoaders")
+    @ParameterizedTest
+    @MethodSource("classLoaders")
+    @NullSource
     public void testNewFileSystemURIMapClassLoader(ClassLoader cl) throws Exception {
         try (FileSystem zipfs = FileSystems.newFileSystem(jarURI, ZIPFS_OPTIONS,
                 cl)) {
@@ -184,17 +197,17 @@ public class NewFileSystemTests {
      * opened if the underlying file is missing, but even with this set, a ZIP
      * file system cannot be opened for conflicting or invalid access modes.
      */
-    @DataProvider(name = "badEnvMap")
-    protected Object[][] badEnvMap() {
-        return new Object[][]{
-                {Map.of(), NoSuchFileException.class},
-                {Map.of("accessMode", "readOnly"), NoSuchFileException.class},
-                {Map.of("accessMode", "readWrite"), NoSuchFileException.class},
-                {Map.of("create", true, "accessMode", "readOnly"), IllegalArgumentException.class},
-                {Map.of("create", true, "accessMode", "badValue"), IllegalArgumentException.class},
-        };
+    protected static Stream<Arguments> badEnvMap() {
+        return Stream.of(
+                Arguments.of(Map.of(), NoSuchFileException.class),
+                Arguments.of(Map.of("accessMode", "readOnly"), NoSuchFileException.class),
+                Arguments.of(Map.of("accessMode", "readWrite"), NoSuchFileException.class),
+                Arguments.of(Map.of("create", true, "accessMode", "readOnly"), IllegalArgumentException.class),
+                Arguments.of(Map.of("create", true, "accessMode", "badValue"), IllegalArgumentException.class)
+        );
     }
-    @Test(dataProvider = "badEnvMap")
+    @ParameterizedTest
+    @MethodSource("badEnvMap")
     public void badArgumentsFailure(Map<String, String> env, Class<? extends Throwable> exception) throws IOException {
         assertThrows(exception, () -> FileSystems.newFileSystem(Path.of("no_such.zip"), env));
     }
@@ -209,9 +222,7 @@ public class NewFileSystemTests {
         Path multiReleaseJar = createMultiReleaseJar();
         try (FileSystem fs = FileSystems.newFileSystem(multiReleaseJar, Map.of("accessMode", "readWrite"))) {
             assertFalse(fs.isReadOnly());
-            assertEquals(
-                    Files.readString(fs.getPath("file.txt"), UTF_8),
-                    "Default version",
+            assertEquals("Default version", Files.readString(fs.getPath("file.txt"), UTF_8),
                     "unexpected file content");
         }
     }
@@ -222,9 +233,7 @@ public class NewFileSystemTests {
      */
     @Test
     public void readOnlyZipFileFailure() throws IOException {
-        if (Platform.isRoot()) {
-            throw new SkipException("Test skipped when executed by root user.");
-        }
+        Assumptions.assumeFalse(Platform.isRoot(), "Test skipped when executed by root user.");
         // Underlying file is read-only.
         Path readOnlyZip = Utils.createJarFile("read_only.zip", Map.of("file.txt", "Hello World"));
         // In theory this can fail, and we should avoid unwanted false-negatives.
@@ -243,9 +252,7 @@ public class NewFileSystemTests {
         Path multiReleaseJar = createMultiReleaseJar();
         try (FileSystem fs = FileSystems.newFileSystem(multiReleaseJar, Map.of("releaseVersion", "1"))) {
             assertTrue(fs.isReadOnly());
-            assertEquals(
-                    Files.readString(fs.getPath("file.txt"), UTF_8),
-                    "First version",
+            assertEquals("First version", Files.readString(fs.getPath("file.txt"), UTF_8),
                     "unexpected file content");
         }
     }
@@ -273,15 +280,13 @@ public class NewFileSystemTests {
     }
 
     /*
-     * DataProvider used to verify that a Zip file system may be returned
+     * MethodSource used to verify that a Zip file system may be returned
      * when specifying a class loader
      */
-    @DataProvider(name = "classLoaders")
-    private Object[][] classLoaders() {
-        return new Object[][]{
-                {null},
-                {ClassLoader.getSystemClassLoader()}
-        };
+    private static Stream<Arguments> classLoaders() {
+        return Stream.of(
+                Arguments.of(ClassLoader.getSystemClassLoader())
+        );
     }
 
     /**
@@ -294,11 +299,11 @@ public class NewFileSystemTests {
         assertNotNull(fs, "Error: FileSystem was not returned");
         assertTrue(fs.provider().getScheme().equalsIgnoreCase(ZIPFS_SCHEME));
         assertTrue(fs.isOpen());
-        assertEquals(fs.getSeparator(), "/");
+        assertEquals("/", fs.getSeparator());
 
         // one root
         Iterator<Path> roots = fs.getRootDirectories().iterator();
-        assertTrue(roots.next().toString().equals("/"));
+        assertEquals("/", roots.next().toString());
         assertFalse(roots.hasNext());
     }
 }
diff --git a/test/jdk/jdk/nio/zipfs/NonExistentPathTests.java b/test/jdk/jdk/nio/zipfs/NonExistentPathTests.java
index 20ed552212c..70c864c44ea 100644
--- a/test/jdk/jdk/nio/zipfs/NonExistentPathTests.java
+++ b/test/jdk/jdk/nio/zipfs/NonExistentPathTests.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2019, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2019, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -21,17 +21,15 @@
  * questions.
  *
  */
-import org.testng.annotations.BeforeTest;
-import org.testng.annotations.Test;
 
 import java.io.IOException;
 import java.net.URI;
-import java.nio.file.FileSystemNotFoundException;
 import java.nio.file.FileSystems;
 import java.nio.file.Path;
 import java.util.Map;
 
-import static org.testng.Assert.assertThrows;
+import static org.junit.jupiter.api.Assertions.assertThrows;
+import org.junit.jupiter.api.Test;
 
 /**
  * @test
@@ -39,7 +37,7 @@ import static org.testng.Assert.assertThrows;
  * @summary Validate the correct Exception is thrown if the Zip/JAR is not found
  *
  * @modules jdk.zipfs
- * @run testng/othervm NonExistentPathTests
+ * @run junit/othervm NonExistentPathTests
  */
 public class NonExistentPathTests {
     private static final String ZIPFS_SCHEME = "jar";
diff --git a/test/jdk/jdk/nio/zipfs/PathOps.java b/test/jdk/jdk/nio/zipfs/PathOps.java
index b976894a301..a035d425a3d 100644
--- a/test/jdk/jdk/nio/zipfs/PathOps.java
+++ b/test/jdk/jdk/nio/zipfs/PathOps.java
@@ -21,6 +21,14 @@
  * questions.
  */
 
+import org.junit.jupiter.api.AfterAll;
+import org.junit.jupiter.api.BeforeAll;
+import org.junit.jupiter.api.Test;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.Arguments;
+import org.junit.jupiter.params.provider.MethodSource;
+import org.junit.jupiter.params.provider.ValueSource;
+
 import java.io.IOException;
 import java.nio.file.FileSystem;
 import java.nio.file.FileSystems;
@@ -29,607 +37,573 @@ import java.nio.file.InvalidPathException;
 import java.nio.file.Path;
 import java.nio.file.Paths;
 import java.nio.file.ProviderMismatchException;
+import java.util.stream.Stream;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertFalse;
+import static org.junit.jupiter.api.Assertions.assertNotNull;
+import static org.junit.jupiter.api.Assertions.assertThrows;
+import static org.junit.jupiter.api.Assertions.fail;
 
 /*
- *
  * @test
  * @bug 8038500 8040059 8139956 8146754 8172921 8186142 8326487
  * @summary Tests path operations for zip provider.
- *
  * @modules jdk.zipfs
- * @run main PathOps
- * @run main/othervm PathOps
+ * @run junit PathOps
+ * @run junit/othervm PathOps
  */
-
 public class PathOps {
 
-    static final java.io.PrintStream out = System.out;
     static FileSystem fs;
 
-    private Path path;
-    private Exception exc;
-
-    private PathOps(String first, String... more) {
-        out.println();
-        try {
-            path = fs.getPath(first, more);
-            out.format("%s -> %s", first, path);
-        } catch (Exception x) {
-            exc = x;
-            out.format("%s -> %s", first, x);
-        }
-        out.println();
+    // This test uses a static file system since some ops tested on
+    // Path depend on the same underlying `fs` instance
+    @BeforeAll
+    static void setup() throws IOException {
+        // create empty JAR file, test doesn't require any contents
+        Path emptyJar = Utils.createJarFile("empty.jar");
+        fs = FileSystems.newFileSystem(emptyJar);
     }
 
-    Path path() {
-        return path;
+    @AfterAll
+    static void cleanup() throws IOException {
+        fs.close();
     }
 
-    void fail() {
-        throw new RuntimeException("PathOps failed");
+    @Test
+    void nullPointerTest() {
+        Path path = fs.getPath("foo");
+        assertThrows(NullPointerException.class, () -> path.resolve((String) null));
+        assertThrows(NullPointerException.class, () -> path.relativize(null));
+        assertThrows(NullPointerException.class, () -> path.compareTo(null));
+        assertThrows(NullPointerException.class, () -> path.startsWith((Path) null));
+        assertThrows(NullPointerException.class, () -> path.endsWith((Path) null));
     }
 
-    void checkPath() {
-        if (path == null) {
-            throw new InternalError("path is null");
-        }
+    @Test
+    void mismatchedProvidersTest() {
+        Path path = fs.getPath("foo");
+        Path other = Paths.get("foo");
+        assertThrows(ProviderMismatchException.class, () -> path.compareTo(other));
+        assertThrows(ProviderMismatchException.class, () -> path.resolve(other));
+        assertThrows(ProviderMismatchException.class, () -> path.relativize(other));
+        assertFalse(path.startsWith(other), "providerMismatched startsWith() returns true ");
+        assertFalse(path.endsWith(other), "providerMismatched endsWith() returns true ");
     }
 
-    void check(Object result, String expected) {
-        out.format("\tExpected: %s\n", expected);
-        out.format("\tActual: %s\n",  result);
+    @ParameterizedTest
+    @MethodSource
+    void constructionTest(String first, String[] more, String expected) {
+        string(getPath(first, more), expected);
+    }
+
+    static Stream<Arguments> constructionTest() {
+        return Stream.of(
+                Arguments.of("/", new String[]{}, "/"),
+                Arguments.of("/", new String[]{""}, "/"),
+                Arguments.of("/", new String[]{"foo"}, "/foo"),
+                Arguments.of("/", new String[]{"/foo"}, "/foo"),
+                Arguments.of("/", new String[]{"foo/"}, "/foo"),
+                Arguments.of("foo", new String[]{"bar", "gus"}, "foo/bar/gus"),
+                Arguments.of("", new String[]{},  ""),
+                Arguments.of("", new String[]{"/"}, "/"),
+                Arguments.of("", new String[]{"foo", "", "bar", "", "/gus"}, "foo/bar/gus")
+        );
+    }
+
+    @Test
+    void allComponentsTest() {
+        var path = getPath("/a/b/c");
+        root(path, "/");
+        parent(path, "/a/b");
+        name(path, "c");
+    }
+
+    @ParameterizedTest
+    @MethodSource
+    void nameCountTest(String first, String root, String parent, String name, int nameCount) {
+        var path = getPath(first);
+        root(path, root);
+        parent(path, parent);
+        name(path, name);
+        nameCount(path, nameCount);
+    }
+
+    static Stream<Arguments> nameCountTest() {
+        return Stream.of(
+                // root component only
+                Arguments.of("/", "/", null, null, 0),
+                // empty name
+                Arguments.of("", null, null, "", 1)
+        );
+    }
+
+    @ParameterizedTest
+    @MethodSource
+    void parentNameTest(String first, String root, String parent, String name) {
+        var path = getPath(first);
+        root(path, root);
+        parent(path, parent);
+        name(path, name);
+    }
+
+    static Stream<Arguments> parentNameTest() {
+        return Stream.of(
+                // no root component
+                Arguments.of("a/b", null, "a", "b"),
+                // name component only
+                Arguments.of("foo", null, null, "foo")
+        );
+    }
+
+    @ParameterizedTest
+    @MethodSource
+    void startsWithTest(String first, String prefix) {
+        starts(getPath(first), prefix);
+    }
+
+    static Stream<Arguments> startsWithTest() {
+        return Stream.of(
+                Arguments.of("", ""),
+                Arguments.of("/", "/"),
+                Arguments.of("foo", "foo"),
+                Arguments.of("/foo", "/"),
+                Arguments.of("/foo", "/foo"),
+                Arguments.of("/foo/bar", "/"),
+                Arguments.of("/foo/bar", "/foo"),
+                Arguments.of("/foo/bar", "/foo/"),
+                Arguments.of("/foo/bar", "/foo/bar"),
+                Arguments.of("foo/bar", "foo"),
+                Arguments.of("foo/bar", "foo/"),
+                Arguments.of("foo/bar", "foo/bar")
+        );
+    }
+
+    @ParameterizedTest
+    @MethodSource
+    void notStartsWithTest(String first, String prefix) {
+        notStarts(getPath(first), prefix);
+    }
+
+    static Stream<Arguments> notStartsWithTest() {
+        return Stream.of(
+                Arguments.of("", "/"),
+                Arguments.of("/", "/foo"),
+                Arguments.of("foo", "f"),
+                Arguments.of("/foo", "/f"),
+                Arguments.of("/foo", ""),
+                Arguments.of("/foo/bar", "/f"),
+                Arguments.of("/foo/bar", "foo"),
+                Arguments.of("/foo/bar", "foo/bar"),
+                Arguments.of("/foo/bar", ""),
+                Arguments.of("foo/bar", "f"),
+                Arguments.of("foo/bar", "/foo"),
+                Arguments.of("foo/bar", "/foo/bar")
+        );
+    }
+
+    @ParameterizedTest
+    @MethodSource
+    void endsWithTest(String first, String suffix) {
+        ends(getPath(first), suffix);
+    }
+
+    static Stream<Arguments> endsWithTest() {
+        return Stream.of(
+                Arguments.of("", ""),
+                Arguments.of("/", "/"),
+                Arguments.of("/foo", "foo"),
+                Arguments.of("/foo","/foo"),
+                Arguments.of("/foo/bar", "bar"),
+                Arguments.of("/foo/bar", "foo/bar"),
+                Arguments.of("/foo/bar", "foo/bar/"),
+                Arguments.of("/foo/bar", "/foo/bar"),
+                Arguments.of("/foo/bar/", "bar"),
+                Arguments.of("/foo/bar/", "foo/bar"),
+                Arguments.of("/foo/bar/", "foo/bar/"),
+                Arguments.of("/foo/bar/", "/foo/bar"),
+                Arguments.of("foo", "foo"),
+                Arguments.of("foo/bar", "bar"),
+                Arguments.of("foo/bar", "bar/"),
+                Arguments.of("foo/bar", "foo/bar/"),
+                Arguments.of("foo/bar", "foo/bar")
+        );
+    }
+
+    @ParameterizedTest
+    @MethodSource
+    void notEndsWithTest(String first, String suffix) {
+        notEnds(getPath(first), suffix);
+    }
+
+    static Stream<Arguments> notEndsWithTest() {
+        return Stream.of(
+                Arguments.of("", "/"),
+                Arguments.of("/", "foo"),
+                Arguments.of("/", "/foo"),
+                Arguments.of("/foo", "/"),
+                Arguments.of("/foo/bar", "/bar"),
+                Arguments.of("/foo/bar/", "/bar")
+        );
+    }
+
+    @ParameterizedTest
+    @MethodSource
+    void elementTest(int index, String expected) {
+        element(getPath("a/b/c"), index, expected);
+    }
+
+    static Stream<Arguments> elementTest() {
+        return Stream.of(
+                Arguments.of(0, "a"),
+                Arguments.of(1, "b"),
+                Arguments.of(2, "c")
+        );
+    }
+
+    @ParameterizedTest
+    @ValueSource(strings = {"/", "/tmp"} )
+    void isAbsoluteTest(String first) {
+        absolute(getPath(first));
+    }
+
+    @ParameterizedTest
+    @ValueSource(strings = {"tmp", ""} )
+    void notAbsoluteTest(String first) {
+        notAbsolute(getPath(first));
+    }
+
+    @ParameterizedTest
+    @MethodSource
+    void resolveTest(String first, String other, String expected) {
+        resolve(getPath(first), other, expected);
+    }
+
+    static Stream<Arguments> resolveTest() {
+        return Stream.of(
+                Arguments.of("/tmp", "foo", "/tmp/foo"),
+                Arguments.of("/tmp", "/foo", "/foo"),
+                Arguments.of("/tmp", "", "/tmp"),
+                Arguments.of("tmp", "foo", "tmp/foo"),
+                Arguments.of("tmp", "/foo", "/foo"),
+                Arguments.of("tmp", "", "tmp"),
+                Arguments.of("", "", ""),
+                Arguments.of("", "foo", "foo"),
+                Arguments.of("", "/foo", "/foo"),
+                Arguments.of("/", "", "/"),
+                Arguments.of("/", "foo", "/foo"),
+                Arguments.of("/", "/foo", "/foo"),
+                Arguments.of("/", "/foo/", "/foo")
+        );
+    }
+
+    @ParameterizedTest
+    @MethodSource
+    void resolvePathTest(String first, String other, String expected) {
+        resolvePath(getPath(first), other, expected);
+    }
+
+    static Stream<Arguments> resolvePathTest() {
+        return Stream.of(
+                Arguments.of("/tmp", "foo", "/tmp/foo"),
+                Arguments.of("/tmp", "/foo", "/foo"),
+                Arguments.of("/tmp", "", "/tmp"),
+                Arguments.of("tmp", "foo", "tmp/foo"),
+                Arguments.of("tmp", "/foo", "/foo"),
+                Arguments.of("tmp", "", "tmp"),
+                Arguments.of("", "", ""),
+                Arguments.of("", "foo", "foo"),
+                Arguments.of("", "/foo", "/foo"),
+                Arguments.of("/", "", "/"),
+                Arguments.of("/", "foo", "/foo"),
+                Arguments.of("/",  "/foo", "/foo"),
+                Arguments.of("/", "/foo/", "/foo")
+        );
+    }
+
+    @ParameterizedTest
+    @MethodSource
+    void resolveSiblingTest(String first, String other, String expected) {
+        resolveSibling(getPath(first), other, expected);
+    }
+
+    static Stream<Arguments> resolveSiblingTest() {
+        return Stream.of(
+                Arguments.of("foo", "bar", "bar"),
+                Arguments.of("foo", "/bar", "/bar"),
+                Arguments.of("foo", "", ""),
+                Arguments.of("foo/bar", "gus", "foo/gus"),
+                Arguments.of("foo/bar", "/gus", "/gus"),
+                Arguments.of("foo/bar", "", "foo"),
+                Arguments.of("/foo", "gus", "/gus"),
+                Arguments.of("/foo", "/gus", "/gus"),
+                Arguments.of("/foo", "", "/"),
+                Arguments.of("/foo/bar", "gus", "/foo/gus"),
+                Arguments.of("/foo/bar", "/gus", "/gus"),
+                Arguments.of("/foo/bar", "", "/foo")
+        );
+    }
+
+    @Test
+    void resolveSiblingAndResolveTest() {
+        var path = getPath("");
+        resolveSibling(path, "foo", "foo");
+        resolveSibling(path, "/foo", "/foo");
+        resolve(path, "", "");
+    }
+
+    @ParameterizedTest
+    @MethodSource
+    void relativizeTest(String first, String other, String expected) {
+        relativize(getPath(first), other, expected);
+    }
+
+    static Stream<Arguments> relativizeTest() {
+        return Stream.of(
+                Arguments.of("/a/b/c", "/a/b/c", ""),
+                Arguments.of("/a/b/c", "/a/b/c/d/e", "d/e"),
+                Arguments.of("/a/b/c", "/a/x", "../../x"),
+                Arguments.of("/a/b/c", "/x", "../../../x"),
+                Arguments.of("a/b/c", "a/b/c/d", "d"),
+                Arguments.of("a/b/c", "a/x", "../../x"),
+                Arguments.of("a/b/c", "x", "../../../x"),
+                Arguments.of("a/b/c", "", "../../.."),
+                Arguments.of("", "a", "a"),
+                Arguments.of("", "a/b/c", "a/b/c"),
+                Arguments.of("", "", ""),
+                Arguments.of("/", "/a", "a"),
+                Arguments.of("/", "/a/c", "a/c"),
+                // 8146754
+                Arguments.of("/tmp/path", "/tmp/path/a.txt", "a.txt"),
+                Arguments.of("/tmp/path/", "/tmp/path/a.txt", "a.txt")
+        );
+    }
+
+    @ParameterizedTest
+    @MethodSource
+    void normalizeTest(String first, String expected) {
+        normalize(getPath(first), expected);
+    }
+
+    static Stream<Arguments> normalizeTest() {
+        return Stream.of(
+                Arguments.of("/", "/"),
+                Arguments.of("foo", "foo"),
+                Arguments.of("/foo", "/foo"),
+                Arguments.of(".", ""),
+                Arguments.of("..", ".."),
+                Arguments.of("/..", "/"),
+                Arguments.of("/../..", "/"),
+                Arguments.of("foo/.", "foo"),
+                Arguments.of("./foo", "foo"),
+                Arguments.of("foo/..", ""),
+                Arguments.of("../foo", "../foo"),
+                Arguments.of("../../foo", "../../foo"),
+                Arguments.of("foo/bar/..", "foo"),
+                Arguments.of("foo/bar/gus/../..", "foo"),
+                Arguments.of("/foo/bar/gus/../..", "/foo"),
+                Arguments.of("/./.", "/"),
+                Arguments.of("/.", "/"),
+                Arguments.of("/./abc", "/abc")
+        );
+    }
+
+    @ParameterizedTest
+    @MethodSource
+    void invalidTest(String first) {
+        assertThrows(InvalidPathException.class, () -> getPath(first));
+    }
+
+    static Stream<String> invalidTest() {
+        return Stream.of(
+                "foo\u0000bar",
+                "\u0000foo",
+                "bar\u0000",
+                "//foo\u0000bar",
+                "//\u0000foo",
+                "//bar\u0000"
+        );
+    }
+
+    @Test
+    void normalizationTest() {
+        var path = getPath("//foo//bar");
+        string(path, "/foo/bar");
+        root(path, "/");
+        parent(path, "/foo");
+        name(path, "bar");
+    }
+
+    @Test
+    void isSameFileTest() {
+        isSameFile(getPath("/fileDoesNotExist"), "/fileDoesNotExist");
+    }
+
+    @Test
+    void getNameCountTest() {
+        // 8139956
+        System.out.println("check getNameCount");
+        int nc = fs.getPath("/").relativize(fs.getPath("/")).getNameCount();
+        assertEquals(1, nc, "getNameCount of empty path failed");
+    }
+
+    // Utilities for testing
+
+    static void checkPath(Path path) {
+        assertNotNull(path, "path is null");
+    }
+
+    static void check(Object result, String expected) {
         if (result == null) {
             if (expected == null) return;
         } else {
             // compare string representations
-            if (expected != null && result.toString().equals(expected.toString()))
+            if (expected != null && result.toString().equals(expected))
                 return;
         }
         fail();
     }
 
-    void check(Object result, boolean expected) {
+    static void check(Object result, boolean expected) {
         check(result, Boolean.toString(expected));
     }
 
-    void check(Object result, int expected) {
+    static void check(Object result, int expected) {
         check(result, Integer.toString(expected));
     }
 
-    PathOps root(String expected) {
-        out.println("check root");
-        checkPath();
+    static void root(Path path, String expected) {
+        System.out.println("check root");
+        checkPath(path);
         check(path.getRoot(), expected);
-        return this;
     }
 
-    PathOps parent(String expected) {
-        out.println("check parent");
-        checkPath();
+    static void parent(Path path, String expected) {
+        System.out.println("check parent");
+        checkPath(path);
         check(path.getParent(), expected);
-        return this;
     }
 
-    PathOps name(String expected) {
-        out.println("check name");
-        checkPath();
+    static void name(Path path, String expected) {
+        System.out.println("check name");
+        checkPath(path);
         check(path.getFileName(), expected);
-        return this;
     }
 
-    PathOps nameCount(int expected) {
-        out.println("check nameCount");
-        checkPath();
+    static void nameCount(Path path, int expected) {
+        System.out.println("check nameCount");
+        checkPath(path);
         check(path.getNameCount(), expected);
-        return this;
     }
 
-    PathOps element(int index, String expected) {
-        out.format("check element %d\n", index);
-        checkPath();
+    static void element(Path path, int index, String expected) {
+        System.out.format("check element %d\n", index);
+        checkPath(path);
         check(path.getName(index), expected);
-        return this;
     }
 
-    PathOps subpath(int startIndex, int endIndex, String expected) {
-        out.format("test subpath(%d,%d)\n", startIndex, endIndex);
-        checkPath();
+    static void subpath(Path path, int startIndex, int endIndex, String expected) {
+        System.out.format("test subpath(%d,%d)\n", startIndex, endIndex);
+        checkPath(path);
         check(path.subpath(startIndex, endIndex), expected);
-        return this;
     }
 
-    PathOps starts(String prefix) {
-        out.format("test startsWith with %s\n", prefix);
-        checkPath();
+    static void starts(Path path, String prefix) {
+        System.out.format("test startsWith with %s\n", prefix);
+        checkPath(path);
         Path s = fs.getPath(prefix);
         check(path.startsWith(s), true);
-        return this;
     }
 
-    PathOps notStarts(String prefix) {
-        out.format("test not startsWith with %s\n", prefix);
-        checkPath();
+    static void notStarts(Path path, String prefix) {
+        System.out.format("test not startsWith with %s\n", prefix);
+        checkPath(path);
         Path s = fs.getPath(prefix);
         check(path.startsWith(s), false);
-        return this;
     }
 
-    PathOps ends(String suffix) {
-        out.format("test endsWith %s\n", suffix);
-        checkPath();
+    static void ends(Path path, String suffix) {
+        System.out.format("test endsWith %s\n", suffix);
+        checkPath(path);
         Path s = fs.getPath(suffix);
         check(path.endsWith(s), true);
-        return this;
     }
 
-    PathOps notEnds(String suffix) {
-        out.format("test not endsWith %s\n", suffix);
-        checkPath();
+    static void notEnds(Path path, String suffix) {
+        System.out.format("test not endsWith %s\n", suffix);
+        checkPath(path);
         Path s = fs.getPath(suffix);
         check(path.endsWith(s), false);
-        return this;
     }
 
-    PathOps absolute() {
-        out.println("check path is absolute");
-        checkPath();
+    static void absolute(Path path) {
+        System.out.println("check path is absolute");
+        checkPath(path);
         check(path.isAbsolute(), true);
-        return this;
     }
 
-    PathOps notAbsolute() {
-        out.println("check path is not absolute");
-        checkPath();
+    static void notAbsolute(Path path) {
+        System.out.println("check path is not absolute");
+        checkPath(path);
         check(path.isAbsolute(), false);
-        return this;
     }
 
-    PathOps resolve(String other, String expected) {
-        out.format("test resolve %s\n", other);
-        checkPath();
+    static void resolve(Path path, String other, String expected) {
+        System.out.format("test resolve %s\n", other);
+        checkPath(path);
         check(path.resolve(other), expected);
-        return this;
     }
 
-    PathOps resolvePath(String other, String expected) {
-        out.format("test resolve %s\n", other);
-        checkPath();
+    static void resolvePath(Path path, String other, String expected) {
+        System.out.format("test resolve %s\n", other);
+        checkPath(path);
         check(path.resolve(fs.getPath(other)), expected);
-        return this;
     }
 
-    PathOps resolveSibling(String other, String expected) {
-        out.format("test resolveSibling %s\n", other);
-        checkPath();
+    static void resolveSibling(Path path, String other, String expected) {
+        System.out.format("test resolveSibling %s\n", other);
+        checkPath(path);
         check(path.resolveSibling(other), expected);
-        return this;
+
     }
 
-    PathOps relativize(String other, String expected) {
-        out.format("test relativize %s\n", other);
-        checkPath();
+    static void relativize(Path path, String other, String expected) {
+        System.out.format("test relativize %s\n", other);
+        checkPath(path);
         Path that = fs.getPath(other);
         check(path.relativize(that), expected);
-        return this;
+
     }
 
-    PathOps normalize(String expected) {
-        out.println("check normalized path");
-        checkPath();
+    static void normalize(Path path, String expected) {
+        System.out.println("check normalized path");
+        checkPath(path);
         check(path.normalize(), expected);
-        return this;
+
     }
 
-    PathOps string(String expected) {
-        out.println("check string representation");
-        checkPath();
+    static void string(Path path, String expected) {
+        System.out.println("check string representation");
+        checkPath(path);
         check(path, expected);
-        return this;
     }
 
-    PathOps isSameFile(String target) {
+    static void isSameFile(Path path, String target) {
         try {
-            out.println("check two paths are same");
-            checkPath();
-            check(Files.isSameFile(path, test(target).path()), true);
+            System.out.println("check two paths are same");
+            checkPath(path);
+            check(Files.isSameFile(path, fs.getPath(target)), true);
         } catch (IOException ioe) {
             fail();
         }
-        return this;
     }
 
-    PathOps invalid() {
-        if (!(exc instanceof InvalidPathException)) {
-            out.println("InvalidPathException not thrown as expected");
-            fail();
-        }
-        return this;
+    static Path getPath(String s) {
+        return fs.getPath(s);
     }
 
-    static PathOps test(String s) {
-        return new PathOps(s);
-    }
-
-    static PathOps test(String first, String... more) {
-        return new PathOps(first, more);
-    }
-
-    // -- PathOpss --
-
-    static void header(String s) {
-        out.println();
-        out.println();
-        out.println("-- " + s + " --");
-    }
-
-    static void doPathOpTests() {
-        header("Path operations");
-
-        // construction
-        test("/")
-            .string("/");
-        test("/", "")
-            .string("/");
-        test("/", "foo")
-            .string("/foo");
-        test("/", "/foo")
-            .string("/foo");
-        test("/", "foo/")
-            .string("/foo");
-        test("foo", "bar", "gus")
-            .string("foo/bar/gus");
-        test("")
-            .string("");
-        test("", "/")
-            .string("/");
-        test("", "foo", "", "bar", "", "/gus")
-            .string("foo/bar/gus");
-
-        // all components
-        test("/a/b/c")
-            .root("/")
-            .parent("/a/b")
-            .name("c");
-
-        // root component only
-        test("/")
-            .root("/")
-            .parent(null)
-            .name(null)
-            .nameCount(0);
-
-        // empty name
-        test("")
-            .root(null)
-            .parent(null)
-            .name("")
-            .nameCount(1);
-
-        // no root component
-        test("a/b")
-            .root(null)
-            .parent("a")
-            .name("b");
-
-        // name component only
-        test("foo")
-            .root(null)
-            .parent(null)
-            .name("foo");
-
-        // startsWith
-        test("")
-            .starts("")
-            .notStarts("/");
-        test("/")
-            .starts("/")
-            .notStarts("/foo");
-        test("/foo")
-            .starts("/")
-            .starts("/foo")
-            .notStarts("/f")
-            .notStarts("");
-        test("/foo/bar")
-            .starts("/")
-            .starts("/foo")
-            .starts("/foo/")
-            .starts("/foo/bar")
-            .notStarts("/f")
-            .notStarts("foo")
-            .notStarts("foo/bar")
-            .notStarts("");
-        test("foo")
-            .starts("foo")
-            .notStarts("f");
-        test("foo/bar")
-            .starts("foo")
-            .starts("foo/")
-            .starts("foo/bar")
-            .notStarts("f")
-            .notStarts("/foo")
-            .notStarts("/foo/bar");
-
-        // endsWith
-        test("")
-            .ends("")
-            .notEnds("/");
-        test("/")
-            .ends("/")
-            .notEnds("foo")
-            .notEnds("/foo");
-        test("/foo")
-            .ends("foo")
-            .ends("/foo")
-            .notEnds("/");
-        test("/foo/bar")
-            .ends("bar")
-            .ends("foo/bar")
-            .ends("foo/bar/")
-            .ends("/foo/bar")
-            .notEnds("/bar");
-        test("/foo/bar/")
-            .ends("bar")
-            .ends("foo/bar")
-            .ends("foo/bar/")
-            .ends("/foo/bar")
-            .notEnds("/bar");
-        test("foo")
-            .ends("foo");
-        test("foo/bar")
-            .ends("bar")
-            .ends("bar/")
-            .ends("foo/bar/")
-            .ends("foo/bar");
-
-        // elements
-        test("a/b/c")
-            .element(0,"a")
-            .element(1,"b")
-            .element(2,"c");
-
-        // isAbsolute
-        test("/")
-            .absolute();
-        test("/tmp")
-            .absolute();
-        test("tmp")
-            .notAbsolute();
-        test("")
-            .notAbsolute();
-
-        // resolve
-        test("/tmp")
-            .resolve("foo", "/tmp/foo")
-            .resolve("/foo", "/foo")
-            .resolve("", "/tmp");
-        test("tmp")
-            .resolve("foo", "tmp/foo")
-            .resolve("/foo", "/foo")
-            .resolve("", "tmp");
-        test("")
-            .resolve("", "")
-            .resolve("foo", "foo")
-            .resolve("/foo", "/foo");
-        test("/")
-            .resolve("", "/")
-            .resolve("foo", "/foo")
-            .resolve("/foo", "/foo")
-            .resolve("/foo/", "/foo");
-
-        // resolve(Path)
-        test("/tmp")
-            .resolvePath("foo", "/tmp/foo")
-            .resolvePath("/foo", "/foo")
-            .resolvePath("", "/tmp");
-        test("tmp")
-            .resolvePath("foo", "tmp/foo")
-            .resolvePath("/foo", "/foo")
-            .resolvePath("", "tmp");
-        test("")
-            .resolvePath("", "")
-            .resolvePath("foo", "foo")
-            .resolvePath("/foo", "/foo");
-        test("/")
-            .resolvePath("", "/")
-            .resolvePath("foo", "/foo")
-            .resolvePath("/foo", "/foo")
-            .resolvePath("/foo/", "/foo");
-
-        // resolveSibling
-        test("foo")
-            .resolveSibling("bar", "bar")
-            .resolveSibling("/bar", "/bar")
-            .resolveSibling("", "");
-        test("foo/bar")
-            .resolveSibling("gus", "foo/gus")
-            .resolveSibling("/gus", "/gus")
-            .resolveSibling("", "foo");
-        test("/foo")
-            .resolveSibling("gus", "/gus")
-            .resolveSibling("/gus", "/gus")
-            .resolveSibling("", "/");
-        test("/foo/bar")
-            .resolveSibling("gus", "/foo/gus")
-            .resolveSibling("/gus", "/gus")
-            .resolveSibling("", "/foo");
-        test("")
-            .resolveSibling("foo", "foo")
-            .resolveSibling("/foo", "/foo")
-            .resolve("", "");
-
-        // relativize
-        test("/a/b/c")
-            .relativize("/a/b/c", "")
-            .relativize("/a/b/c/d/e", "d/e")
-            .relativize("/a/x", "../../x")
-            .relativize("/x", "../../../x");
-        test("a/b/c")
-            .relativize("a/b/c/d", "d")
-            .relativize("a/x", "../../x")
-            .relativize("x", "../../../x")
-            .relativize("", "../../..");
-        test("")
-            .relativize("a", "a")
-            .relativize("a/b/c", "a/b/c")
-            .relativize("", "");
-        test("/")
-            .relativize("/a", "a")
-            .relativize("/a/c", "a/c");
-        // 8146754
-        test("/tmp/path")
-            .relativize("/tmp/path/a.txt", "a.txt");
-        test("/tmp/path/")
-            .relativize("/tmp/path/a.txt", "a.txt");
-
-        // normalize
-        test("/")
-            .normalize("/");
-        test("foo")
-            .normalize("foo");
-        test("/foo")
-            .normalize("/foo");
-        test(".")
-            .normalize("");
-        test("..")
-            .normalize("..");
-        test("/..")
-            .normalize("/");
-        test("/../..")
-            .normalize("/");
-        test("foo/.")
-            .normalize("foo");
-        test("./foo")
-            .normalize("foo");
-        test("foo/..")
-            .normalize("");
-        test("../foo")
-            .normalize("../foo");
-        test("../../foo")
-            .normalize("../../foo");
-        test("foo/bar/..")
-            .normalize("foo");
-        test("foo/bar/gus/../..")
-            .normalize("foo");
-        test("/foo/bar/gus/../..")
-            .normalize("/foo");
-        test("/./.")
-            .normalize("/");
-        test("/.")
-            .normalize("/");
-        test("/./abc")
-            .normalize("/abc");
-        // invalid
-        test("foo\u0000bar")
-            .invalid();
-        test("\u0000foo")
-            .invalid();
-        test("bar\u0000")
-            .invalid();
-        test("//foo\u0000bar")
-            .invalid();
-        test("//\u0000foo")
-            .invalid();
-        test("//bar\u0000")
-            .invalid();
-
-        // normalization
-        test("//foo//bar")
-            .string("/foo/bar")
-            .root("/")
-            .parent("/foo")
-            .name("bar");
-
-        // isSameFile
-        test("/fileDoesNotExist")
-            .isSameFile("/fileDoesNotExist");
-
-        // 8139956
-        out.println("check getNameCount");
-        int nc = fs.getPath("/").relativize(fs.getPath("/")).getNameCount();
-        if (nc != 1) {
-            out.format("\tExpected: 1\n");
-            out.format("\tActual: %d\n",  nc);
-            throw new RuntimeException("getNameCount of empty path failed");
-        }
-     }
-
-    static void npes() {
-        header("NullPointerException");
-
-        Path path = fs.getPath("foo");
-
-        try {
-            path.resolve((String)null);
-            throw new RuntimeException("NullPointerException not thrown");
-        } catch (NullPointerException npe) {
-        }
-
-        try {
-            path.relativize(null);
-            throw new RuntimeException("NullPointerException not thrown");
-        } catch (NullPointerException npe) {
-        }
-
-        try {
-            path.compareTo(null);
-            throw new RuntimeException("NullPointerException not thrown");
-        } catch (NullPointerException npe) {
-        }
-
-        try {
-            path.startsWith((Path)null);
-            throw new RuntimeException("NullPointerException not thrown");
-        } catch (NullPointerException npe) {
-        }
-
-        try {
-            path.endsWith((Path)null);
-            throw new RuntimeException("NullPointerException not thrown");
-        } catch (NullPointerException npe) {
-        }
-
-    }
-
-    static void mismatchedProviders() {
-        header("ProviderMismatchException");
-        Path path = fs.getPath("foo");
-        Path other = Paths.get("foo");
-        try {
-            path.compareTo(other);
-            throw new RuntimeException("ProviderMismatchException not thrown");
-        } catch (ProviderMismatchException pme) {}
-
-        try {
-            path.resolve(other);
-            throw new RuntimeException("ProviderMismatchException not thrown");
-        } catch (ProviderMismatchException pme) {}
-
-        try {
-            path.relativize(other);
-            throw new RuntimeException("ProviderMismatchException not thrown");
-        } catch (ProviderMismatchException pme) {}
-
-        try {
-            if (path.startsWith(other))
-                throw new RuntimeException("providerMismatched startsWith() returns true ");
-            if (path.endsWith(other))
-                throw new RuntimeException("providerMismatched endsWith() returns true ");
-        } catch (ProviderMismatchException pme) {
-            throw new RuntimeException("ProviderMismatchException is thrown for starts/endsWith()");
-        }
-    }
-
-    public static void main(String[] args) throws IOException {
-        // create empty JAR file, test doesn't require any contents
-        Path emptyJar = Utils.createJarFile("empty.jar");
-
-        fs = FileSystems.newFileSystem(emptyJar);
-        try {
-            npes();
-            mismatchedProviders();
-            doPathOpTests();
-        } finally {
-            fs.close();
-        }
+    static Path getPath(String first, String... more) {
+        return fs.getPath(first, more);
     }
 }
diff --git a/test/jdk/jdk/nio/zipfs/testng/test/PosixAttributeViewTest.java b/test/jdk/jdk/nio/zipfs/PosixAttributeViewTest.java
similarity index 77%
rename from test/jdk/jdk/nio/zipfs/testng/test/PosixAttributeViewTest.java
rename to test/jdk/jdk/nio/zipfs/PosixAttributeViewTest.java
index 7734ea733c9..ff20741135d 100644
--- a/test/jdk/jdk/nio/zipfs/testng/test/PosixAttributeViewTest.java
+++ b/test/jdk/jdk/nio/zipfs/PosixAttributeViewTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2021, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -21,12 +21,12 @@
  * questions.
  *
  */
-package test;
 
-import org.testng.annotations.AfterTest;
-import org.testng.annotations.BeforeTest;
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
+import org.junit.jupiter.api.AfterAll;
+import org.junit.jupiter.api.BeforeAll;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.Arguments;
+import org.junit.jupiter.params.provider.MethodSource;
 import util.ZipFsBaseTest;
 
 import java.io.IOException;
@@ -36,13 +36,15 @@ import java.nio.file.Files;
 import java.nio.file.Path;
 import java.nio.file.attribute.PosixFileAttributeView;
 import java.util.Map;
+import java.util.stream.Stream;
 import java.util.zip.ZipEntry;
 
-/**
+/*
  * @test
  * @bug 8273935
  * @summary Validate that Files.getFileAttributeView will not throw an
  * Exception when the attribute view PosixFileAttributeView is not available
+ * @run junit PosixAttributeViewTest
  */
 public class PosixAttributeViewTest extends ZipFsBaseTest {
     public static final String ZIP_ENTRY = "Entry-0";
@@ -52,8 +54,8 @@ public class PosixAttributeViewTest extends ZipFsBaseTest {
      * Create initial Zip File
      * @throws IOException if an error occurs
      */
-    @BeforeTest
-    public void setup() throws IOException {
+    @BeforeAll
+    public static void setup() throws IOException {
         Files.deleteIfExists(ZIP_FILE);
         Entry entry = Entry.of(ZIP_ENTRY, ZipEntry.DEFLATED,
                 "Tennis Anyone");
@@ -64,22 +66,21 @@ public class PosixAttributeViewTest extends ZipFsBaseTest {
      * Remove Zip File used by Test
      * @throws IOException if an error occurs
      */
-    @AfterTest
-    public void cleanup() throws IOException {
+    @AfterAll
+    public static void cleanup() throws IOException {
         Files.deleteIfExists(ZIP_FILE);
     }
 
     /**
-     * DataProvider used to specify the Map indicating whether Posix
+     * MethodSource used to specify the Map indicating whether Posix
      * file attributes have been enabled
      * @return  map of the Zip FS properties to configure
      */
-    @DataProvider
-    protected Object[][] zipfsMap() {
-        return new Object[][]{
-                {Map.of()},
-                {Map.of("enablePosixFileAttributes", "true")}
-        };
+    protected static Stream<Arguments> zipfsMap() {
+        return Stream.of(
+                Arguments.of(Map.of()),
+                Arguments.of(Map.of("enablePosixFileAttributes", "true"))
+        );
     }
 
     /**
@@ -89,7 +90,8 @@ public class PosixAttributeViewTest extends ZipFsBaseTest {
      * @param env map of the Zip FS properties to configure
      * @throws Exception if an error occurs
      */
-    @Test(dataProvider = "zipfsMap")
+    @ParameterizedTest
+    @MethodSource("zipfsMap")
     public void testPosixAttributeView(Map<String, String> env) throws Exception {
         try (FileSystem fs = FileSystems.newFileSystem(ZIP_FILE, env)) {
             Path entry = fs.getPath(ZIP_ENTRY);
diff --git a/test/jdk/jdk/nio/zipfs/PropertyPermissionTests.java b/test/jdk/jdk/nio/zipfs/PropertyPermissionTests.java
index de8992bce74..5f31d87f81c 100644
--- a/test/jdk/jdk/nio/zipfs/PropertyPermissionTests.java
+++ b/test/jdk/jdk/nio/zipfs/PropertyPermissionTests.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2019, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2019, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -21,9 +21,6 @@
  * questions.
  */
 
-import org.testng.annotations.AfterClass;
-import org.testng.annotations.BeforeClass;
-import org.testng.annotations.Test;
 
 import java.io.IOException;
 import java.nio.file.FileSystem;
@@ -33,13 +30,18 @@ import java.nio.file.Paths;
 import java.nio.file.spi.FileSystemProvider;
 import java.util.Map;
 
+import org.junit.jupiter.api.AfterAll;
+import org.junit.jupiter.api.BeforeAll;
+import org.junit.jupiter.api.Test;
+
+
 /**
  * @test
  * @bug 8210469
  * @summary Verify ZIP FileSystem works with a Security Manager
  * @modules jdk.zipfs
  * @compile PropertyPermissionTests.java
- * @run testng/othervm PropertyPermissionTests
+ * @run junit/othervm PropertyPermissionTests
  */
 public class PropertyPermissionTests {
 
@@ -55,8 +57,8 @@ public class PropertyPermissionTests {
     /**
      * Create the JAR files used by the tests
      */
-    @BeforeClass
-    public void setUp()  throws Exception {
+    @BeforeAll
+    public static void setUp() throws Exception {
         jarFile = Utils.createJarFile("basic.jar",
                 "META-INF/services/java.nio.file.spi.FileSystemProvider");
     }
@@ -64,8 +66,8 @@ public class PropertyPermissionTests {
     /**
      * Remove JAR files used by test as part of clean-up
      */
-    @AfterClass
-    public void tearDown() throws Exception {
+    @AfterAll
+    public static void tearDown() throws Exception {
         Files.deleteIfExists(jarFile);
     }
 
diff --git a/test/jdk/jdk/nio/zipfs/ReleaseDeflater.java b/test/jdk/jdk/nio/zipfs/ReleaseDeflater.java
index 82369b4fe39..95446da9267 100644
--- a/test/jdk/jdk/nio/zipfs/ReleaseDeflater.java
+++ b/test/jdk/jdk/nio/zipfs/ReleaseDeflater.java
@@ -1,5 +1,6 @@
 /*
  * Copyright Amazon.com Inc. or its affiliates. All Rights Reserved.
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,12 +26,15 @@
 /*
  * @test
  * @bug 8234011
- * @summary Check that jdk.nio.zipfs.ZipFileSystem doesn't cache more than ZipFileSystem.MAX_FLATER Inflater/Deflater objects
- * @run main ReleaseDeflater
+ * @summary Check that jdk.nio.zipfs.ZipFileSystem doesn't cache more than
+ *          ZipFileSystem.MAX_FLATER Inflater/Deflater objects.
  * @modules jdk.zipfs/jdk.nio.zipfs:+open
- * @author Volker Simonis
+ * @run junit ReleaseDeflater
  */
 
+import org.junit.jupiter.api.Test;
+
+import java.io.IOException;
 import java.io.InputStream;
 import java.io.OutputStream;
 import java.lang.reflect.Field;
@@ -44,8 +48,12 @@ import java.util.List;
 import java.util.Map;
 import java.util.ArrayList;
 
+import static org.junit.jupiter.api.Assertions.assertFalse;
+
 public class ReleaseDeflater {
-    public static void main(String[] args) throws Throwable {
+
+    @Test
+    void cacheTest() throws IOException, IllegalAccessException {
         Path zipFile = Paths.get("ReleaseDeflaterTest.zip");
         try (FileSystem fs = FileSystems.newFileSystem(zipFile, Map.of("create", true))) {
             FileSystemProvider zprov = fs.provider();
@@ -75,15 +83,11 @@ public class ReleaseDeflater {
                 Field inflaters = fs.getClass().getDeclaredField("inflaters");
                 inflaters.setAccessible(true);
                 int inflater_count = ((List<?>) inflaters.get(fs)).size();
-                if (inflater_count > MAX_FLATERS) {
-                    throw new Exception("Too many inflaters " + inflater_count);
-                }
+                assertFalse(inflater_count > MAX_FLATERS, "Too many inflaters " + inflater_count);
                 Field deflaters = fs.getClass().getDeclaredField("deflaters");
                 deflaters.setAccessible(true);
                 int deflater_count = ((List<?>) deflaters.get(fs)).size();
-                if (deflater_count > MAX_FLATERS) {
-                    throw new Exception("Too many deflaters " + deflater_count);
-                }
+                assertFalse(deflater_count > MAX_FLATERS, "Too many deflaters " + deflater_count);
             } catch (NoSuchFieldException nsfe) {
                 // Probably the implementation has changed, so there's not much we can do...
                 throw new RuntimeException("Implementation of jdk.nio.zipfs.ZipFileSystem changed - disable or fix the test");
@@ -91,6 +95,5 @@ public class ReleaseDeflater {
         } finally {
             Files.deleteIfExists(zipFile);
         }
-
     }
 }
diff --git a/test/jdk/jdk/nio/zipfs/UpdateEntryTest.java b/test/jdk/jdk/nio/zipfs/UpdateEntryTest.java
index 6611efced82..8a65f08afc2 100644
--- a/test/jdk/jdk/nio/zipfs/UpdateEntryTest.java
+++ b/test/jdk/jdk/nio/zipfs/UpdateEntryTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2019, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2019, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -22,7 +22,6 @@
  *
  */
 
-import org.testng.annotations.Test;
 
 import java.io.IOException;
 import java.io.InputStream;
@@ -32,7 +31,6 @@ import java.nio.file.FileSystem;
 import java.nio.file.FileSystems;
 import java.nio.file.Files;
 import java.nio.file.Path;
-import java.util.Arrays;
 import java.util.Map;
 import java.util.spi.ToolProvider;
 import java.util.zip.CRC32;
@@ -40,16 +38,16 @@ import java.util.zip.ZipEntry;
 import java.util.zip.ZipFile;
 import java.util.zip.ZipOutputStream;
 
-import static org.testng.Assert.*;
+import static org.junit.jupiter.api.Assertions.*;
+import org.junit.jupiter.api.Test;
 
 /**
  * @test
  * @bug 8229887
  * @summary Validate ZIP FileSystem can replace existing STORED and DEFLATED entries
  * @modules jdk.zipfs
- * @run testng UpdateEntryTest
+ * @run junit UpdateEntryTest
  */
-@Test
 public class UpdateEntryTest {
 
     private static final Path HERE = Path.of(".");
@@ -109,6 +107,7 @@ public class UpdateEntryTest {
      * Validate that you can replace an existing entry in a JAR file that
      * was added with the STORED(no-compression) option
      */
+    @Test
     public void testReplaceStoredEntry() throws IOException {
         String jarFileName = "updateStoredEntry.jar";
         String storedFileName = "storedFile.txt";
@@ -132,6 +131,7 @@ public class UpdateEntryTest {
     /**
      * Test updating an entry that is STORED (not compressed)
      */
+    @Test
     public void test1() throws IOException {
         Entry e1 = Entry.of("foo", ZipEntry.STORED, "hello");
         Entry e2 = Entry.of("bar", ZipEntry.STORED, "world");
@@ -141,6 +141,7 @@ public class UpdateEntryTest {
     /**
      * Test updating an entry that is DEFLATED (compressed)
      */
+    @Test
     public void test2() throws IOException {
         Entry e1 = Entry.of("foo", ZipEntry.DEFLATED, "hello");
         Entry e2 = Entry.of("bar", ZipEntry.STORED, "world");
@@ -183,16 +184,16 @@ public class UpdateEntryTest {
         // check entries with zip API
         try (ZipFile zf = new ZipFile(zipfile.toFile())) {
             // check entry count
-            assertTrue(zf.size() == entries.length);
+            assertEquals(zf.size(), entries.length);
 
             // check compression method and content of each entry
             for (Entry e : entries) {
                 ZipEntry ze = zf.getEntry(e.name);
-                assertTrue(ze != null);
-                assertTrue(ze.getMethod() == e.method);
+                assertNotNull(ze);
+                assertEquals(ze.getMethod(), e.method);
                 try (InputStream in = zf.getInputStream(ze)) {
                     byte[] bytes = in.readAllBytes();
-                    assertTrue(Arrays.equals(bytes, e.bytes));
+                    assertArrayEquals(bytes, e.bytes);
                 }
             }
         }
@@ -203,13 +204,13 @@ public class UpdateEntryTest {
             Path top = fs.getPath("/");
             long count = Files.find(top, Integer.MAX_VALUE,
                     (path, attrs) -> attrs.isRegularFile()).count();
-            assertTrue(count == entries.length);
+            assertEquals(count, entries.length);
 
             // check content of each entry
             for (Entry e : entries) {
                 Path file = fs.getPath(e.name);
                 byte[] bytes = Files.readAllBytes(file);
-                assertTrue(Arrays.equals(bytes, e.bytes));
+                assertArrayEquals(bytes, e.bytes);
             }
         }
     }
diff --git a/test/jdk/jdk/nio/zipfs/ZFSTests.java b/test/jdk/jdk/nio/zipfs/ZFSTests.java
index f00ff58f877..b4e625dfe38 100644
--- a/test/jdk/jdk/nio/zipfs/ZFSTests.java
+++ b/test/jdk/jdk/nio/zipfs/ZFSTests.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2012, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2012, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -24,18 +24,20 @@
 /* @test
  * @bug 7156873 8040059 8028480 8034773 8153248 8061777 8197398 8210394
  * @summary ZipFileSystem regression tests
- *
  * @modules jdk.zipfs
- * @run main ZFSTests
- * @run main/othervm ZFSTests
+ * @run junit ZFSTests
+ * @run junit/othervm ZFSTests
  */
 
+import org.junit.jupiter.api.Test;
 
 import java.io.IOException;
 import java.io.OutputStream;
 import java.net.URI;
 import java.nio.ByteBuffer;
 import java.nio.channels.*;
+import java.nio.charset.Charset;
+import java.nio.charset.StandardCharsets;
 import java.nio.file.*;
 import java.nio.file.attribute.BasicFileAttributes;
 import java.nio.file.spi.*;
@@ -45,16 +47,16 @@ import java.util.zip.ZipEntry;
 import java.util.zip.ZipFile;
 import java.util.zip.ZipOutputStream;
 
+import static org.junit.jupiter.api.Assertions.assertArrayEquals;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertFalse;
+
 public class ZFSTests {
 
-    public static void main(String[] args) throws Throwable {
-        test8197398();
-        test7156873();
-        test8061777();
-        tests();
-    }
+    static final Charset ASCII = StandardCharsets.US_ASCII;
 
-    static void test8197398() throws Throwable {
+    @Test
+    void test8197398() throws Throwable {
 
         // root entry "/"
         Path path = Paths.get("rootdir.zip");
@@ -72,33 +74,29 @@ public class ZFSTests {
         }
         AtomicInteger cnt = new AtomicInteger();
         int max = 3;
-        try (FileSystem fs = FileSystems.newFileSystem(uri, Collections.emptyMap())) {
+        try (FileSystem fs = FileSystems.newFileSystem(uri, Map.of())) {
             Files.walkFileTree(fs.getRootDirectories().iterator().next(),
                                 new SimpleFileVisitor<Path>() {
 
                 @Override
                 public FileVisitResult visitFile(Path file, BasicFileAttributes attrs)
                         throws IOException {
-                    if (cnt.incrementAndGet() > max)
-                        throw new RuntimeException("visited too many files/dirs");
+                    assertFalse(cnt.incrementAndGet() > max, "visited too many files/dirs");
                     files.remove(file.toString());
-                    if (!Arrays.equals(Files.readAllBytes(file), file.toString().getBytes()))
-                        throw new RuntimeException("visited files has wrong content: " + file);
+                    assertArrayEquals(file.toString().getBytes(), Files.readAllBytes(file),
+                            "visited files has wrong content: " + file);
                     return FileVisitResult.CONTINUE;
                 }
 
                 @Override
-                public FileVisitResult preVisitDirectory(Path dir, BasicFileAttributes attrs)
-                        throws IOException {
-                    if (cnt.incrementAndGet() > max)
-                        throw new RuntimeException("visited too many files/dirs");
+                public FileVisitResult preVisitDirectory(Path dir, BasicFileAttributes attrs) {
+                    assertFalse(cnt.incrementAndGet() > max, "visited too many files/dirs");
                     dirs.remove(dir.toString());
                     return FileVisitResult.CONTINUE;
                 }
             });
-            if (cnt.get() != max || dirs.size() != 0 || files.size() != 0)
-                throw new RuntimeException("walk files/dirs failed");
-
+            assertFalse(cnt.get() != max || dirs.size() != 0 || files.size() != 0,
+                    "walk files/dirs failed");
         } finally {
             Files.deleteIfExists(path);
         }
@@ -119,15 +117,15 @@ public class ZFSTests {
                 zos.write("/fooo/bar".getBytes());
             }
 
-            try (FileSystem fs = FileSystems.newFileSystem(uri, Collections.emptyMap())) {
+            try (FileSystem fs = FileSystems.newFileSystem(uri, Map.of())) {
                 Files.walkFileTree(fs.getRootDirectories().iterator().next(),
                                     new SimpleFileVisitor<Path>() {
                     @Override
                     public FileVisitResult visitFile(Path file, BasicFileAttributes attrs)
                             throws IOException {
                         files.remove(file.toString());
-                        if (!Arrays.equals(Files.readAllBytes(file), file.toString().getBytes()))
-                            throw new RuntimeException("visited files has wrong content: " + file);
+                        assertArrayEquals(file.toString().getBytes(), Files.readAllBytes(file),
+                                "visited files has wrong content: " + file);
                         return FileVisitResult.CONTINUE;
                     }
                     @Override
@@ -137,8 +135,8 @@ public class ZFSTests {
                         return FileVisitResult.CONTINUE;
                     }
                 });
-                if (dirs.size() != 0 || files.size() != 0)
-                    throw new RuntimeException("walk files/dirs failed");
+                assertFalse(dirs.size() != 0 || files.size() != 0,
+                        "walk files/dirs failed");
 
                 // for next test: updated any entry, the result zipfs file should have no
                 // absolute path entry
@@ -151,22 +149,22 @@ public class ZFSTests {
             files.add("/foo");
             files.add("/bar");
             files.add("/fooo/bar");
-            try (FileSystem fs = FileSystems.newFileSystem(uri, Collections.emptyMap())) {
+            try (FileSystem fs = FileSystems.newFileSystem(uri, Map.of())) {
                     Files.walk(fs.getPath("/")).forEach( p -> {
                         if (Files.isDirectory(p)) {
                             dirs.remove(p.toString());
                         } else {
                             files.remove(p.toString());
                             try {
-                                if (!Arrays.equals(Files.readAllBytes(p), p.toString().getBytes()))
-                                    throw new RuntimeException("visited files has wrong content: " + p);
+                                assertArrayEquals(p.toString().getBytes(), Files.readAllBytes(p),
+                                        "visited files has wrong content: " + p);
                             } catch (IOException x) {
                                 throw new RuntimeException(x);
                             }
                         }
                     });
-                if (dirs.size() != 0 || files.size() != 0)
-                    throw new RuntimeException("walk files/dirs failed");
+                assertFalse(dirs.size() != 0 || files.size() != 0,
+                        "walk files/dirs failed");
 
             }
             // updated zip file should  not have "/" and entry with absolute path
@@ -175,17 +173,16 @@ public class ZFSTests {
                                      .map(ZipEntry::toString)
                                      .sorted()
                                      .toArray(String[]::new);
-                if (!Arrays.equals(entries, new String[] {"bar", "foo", "fooo/", "fooo/bar" })) {
-                    System.out.println("unexpeded: " + Arrays.toString(entries));
-                    throw new RuntimeException("unexpected entreis in updated zipfs file");
-                }
+                assertArrayEquals(new String[] {"bar", "foo", "fooo/", "fooo/bar" }, entries,
+                        "unexpected entreis in updated zipfs file");
             }
         } finally {
             Files.deleteIfExists(path);
         }
     }
 
-    static void test7156873() throws Throwable {
+    @Test
+    void test7156873() throws Throwable {
         String DIRWITHSPACE = "testdir with spaces";
         Path dir = Paths.get(DIRWITHSPACE);
         Path path = Paths.get(DIRWITHSPACE, "file.zip");
@@ -201,7 +198,8 @@ public class ZFSTests {
         }
     }
 
-    static void test8061777() throws Throwable {
+    @Test
+    void test8061777() throws Throwable {
         Path path = Paths.get("file.zip");
         try {
             URI uri = URI.create("jar:" + path.toUri());
@@ -212,24 +210,25 @@ public class ZFSTests {
                 FileSystemProvider fsp = fs.provider();
                 Path p = fs.getPath("/\u8868\u7533.txt");  // 0x95 0x5c 0x90 0x5c
                 try (OutputStream os = fsp.newOutputStream(p)) {
-                    os.write("Hello!".getBytes("ASCII"));
+                    os.write("Hello!".getBytes(ASCII));
                 }
                 Path dir = fs.getPath("/");
                 Files.list(dir)
                      .forEach( child -> {
                              System.out.println("child:" + child);
-                             if (!child.toString().equals(p.toString()))
-                                 throw new RuntimeException("wrong path name created");
+                             assertEquals(p.toString(), child.toString(),
+                                     "wrong path name created");
                           });
-                if (!"Hello!".equals(new String(Files.readAllBytes(p), "ASCII")))
-                    throw new RuntimeException("wrong content in newly created file");
+                assertEquals("Hello!", new String(Files.readAllBytes(p), ASCII),
+                        "wrong content in newly created file");
             }
         } finally {
             Files.deleteIfExists(path);
         }
     }
 
-    static void tests() throws Throwable {
+    @Test
+    void tests() throws Throwable {
         Path path = Paths.get("file.zip");
         try {
             URI uri = URI.create("jar:" + path.toUri());
@@ -245,16 +244,14 @@ public class ZFSTests {
                                      StandardOpenOption.WRITE,
                                      StandardOpenOption.APPEND);
                 try (FileChannel ch = fsp.newFileChannel(p, options)) {
-                    ch.write(ByteBuffer.wrap("Hello!".getBytes("ASCII")));
+                    ch.write(ByteBuffer.wrap("Hello!".getBytes(ASCII)));
                 }
                 // 8034773
                 try (OutputStream os = fsp.newOutputStream(p, new OpenOption[0])) {
-                    os.write("Hello2!".getBytes("ASCII"));
-                }
-                if (!"Hello2!".equals(new String(
-                        Files.readAllBytes(fs.getPath("test.txt"))))) {
-                    throw new RuntimeException("failed to open as truncate_existing");
+                    os.write("Hello2!".getBytes(ASCII));
                 }
+                assertEquals("Hello2!", new String(
+                        Files.readAllBytes(fs.getPath("test.txt"))), "failed to open as truncate_existing");
 
                 options = EnumSet.of(StandardOpenOption.CREATE,
                                      StandardOpenOption.APPEND,
@@ -273,8 +270,8 @@ public class ZFSTests {
                 Files.list(dir)
                      .forEach( child -> {
                              System.out.println("child:" + child);
-                             if (child.toString().endsWith("/"))
-                                 throw new RuntimeException("subdir names ends with /");
+                             assertFalse(child.toString().endsWith("/"),
+                                     "subdir names ends with /");
                           });
             }
         } finally {
diff --git a/test/jdk/jdk/nio/zipfs/ZeroDate.java b/test/jdk/jdk/nio/zipfs/ZeroDate.java
index ff702f63488..9c7f3abef0d 100644
--- a/test/jdk/jdk/nio/zipfs/ZeroDate.java
+++ b/test/jdk/jdk/nio/zipfs/ZeroDate.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2017, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2017, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -26,6 +26,7 @@ import static java.util.zip.ZipFile.CENTIM;
 import static java.util.zip.ZipFile.ENDHDR;
 import static java.util.zip.ZipFile.ENDOFF;
 import static java.util.zip.ZipFile.LOCTIM;
+import static org.junit.jupiter.api.Assertions.assertEquals;
 
 import java.io.IOException;
 import java.io.InputStream;
@@ -40,11 +41,17 @@ import java.time.Instant;
 import java.time.LocalDate;
 import java.time.LocalDateTime;
 import java.time.ZoneId;
-import java.util.Collections;
+import java.util.Map;
+import java.util.stream.Stream;
 import java.util.zip.ZipEntry;
 import java.util.zip.ZipOutputStream;
 
 import jdk.test.lib.Utils;
+import org.junit.jupiter.api.AfterAll;
+import org.junit.jupiter.api.BeforeAll;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.Arguments;
+import org.junit.jupiter.params.provider.MethodSource;
 
 /* @test
  * @bug 8184940 8186227 8188869
@@ -53,42 +60,54 @@ import jdk.test.lib.Utils;
  * @author Liam Miller-Cushon
  * @modules jdk.zipfs
  * @library /test/lib
+ * @run junit ZeroDate
  */
 public class ZeroDate {
 
-    public static void main(String[] args) throws Exception {
-        // create a zip file, and read it in as a byte array
-        Path path = Utils.createTempFile("bad", ".zip");
-        try {
-            try (OutputStream os = Files.newOutputStream(path);
-                 ZipOutputStream zos = new ZipOutputStream(os)) {
-                ZipEntry e = new ZipEntry("x");
-                zos.putNextEntry(e);
-                zos.write((int) 'x');
-            }
-            int len = (int) Files.size(path);
-            byte[] data = new byte[len];
-            try (InputStream is = Files.newInputStream(path)) {
-                is.read(data);
-            }
+    static Path path;
+    static byte[] data;
 
-            // year, month, day are zero
-            testDate(data.clone(), 0, LocalDate.of(1979, 11, 30).atStartOfDay());
-            // only year is zero
-            testDate(data.clone(), 0 << 25 | 4 << 21 | 5 << 16, LocalDate.of(1980, 4, 5).atStartOfDay());
-            // month is greater than 12
-            testDate(data.clone(), 0 << 25 | 13 << 21 | 1 << 16, LocalDate.of(1981, 1, 1).atStartOfDay());
-            // 30th of February
-            testDate(data.clone(), 0 << 25 | 2 << 21 | 30 << 16, LocalDate.of(1980, 3, 1).atStartOfDay());
-            // 30th of February, 24:60:60
-            testDate(data.clone(), 0 << 25 | 2 << 21 | 30 << 16 | 24 << 11 | 60 << 5 | 60 >> 1,
-                    LocalDateTime.of(1980, 3, 2, 1, 1, 0));
-        } finally {
-            Files.delete(path);
+    @BeforeAll
+    static void setup() throws IOException {
+        // create a zip file, and read it in as a byte array
+        path = Utils.createTempFile("bad", ".zip");
+        try (OutputStream os = Files.newOutputStream(path);
+             ZipOutputStream zos = new ZipOutputStream(os)) {
+            ZipEntry e = new ZipEntry("x");
+            zos.putNextEntry(e);
+            zos.write((int) 'x');
+        }
+        int len = (int) Files.size(path);
+        data = new byte[len];
+        try (InputStream is = Files.newInputStream(path)) {
+            is.read(data);
         }
     }
 
-    private static void testDate(byte[] data, int date, LocalDateTime expected) throws IOException {
+    @AfterAll
+    static void cleanup () throws IOException {
+        Files.delete(path);
+    }
+
+    static Stream<Arguments> dateData() {
+        return Stream.of(
+                // year, month, day are zero
+                Arguments.of(data.clone(), 0, LocalDate.of(1979, 11, 30).atStartOfDay()),
+                // only year is zero
+                Arguments.of(data.clone(), 0 << 25 | 4 << 21 | 5 << 16, LocalDate.of(1980, 4, 5).atStartOfDay()),
+                // month is greater than 12
+                Arguments.of(data.clone(), 0 << 25 | 13 << 21 | 1 << 16, LocalDate.of(1981, 1, 1).atStartOfDay()),
+                // 30th of February
+                Arguments.of(data.clone(), 0 << 25 | 2 << 21 | 30 << 16, LocalDate.of(1980, 3, 1).atStartOfDay()),
+                // 30th of February, 24:60:60
+                Arguments.of(data.clone(), 0 << 25 | 2 << 21 | 30 << 16 | 24 << 11 | 60 << 5 | 60 >> 1,
+                        LocalDateTime.of(1980, 3, 2, 1, 1, 0))
+        );
+    }
+
+    @ParameterizedTest
+    @MethodSource("dateData")
+    void testDate(byte[] data, int date, LocalDateTime expected) throws IOException {
         // set the datetime
         int endpos = data.length - ENDHDR;
         int cenpos = u16(data, endpos + ENDOFF);
@@ -102,7 +121,7 @@ public class ZeroDate {
             os.write(data);
         }
         URI uri = URI.create("jar:" + path.toUri());
-        try (FileSystem fs = FileSystems.newFileSystem(uri, Collections.emptyMap())) {
+        try (FileSystem fs = FileSystems.newFileSystem(uri, Map.of())) {
             Path entry = fs.getPath("x");
             Instant actualInstant =
                     Files.readAttributes(entry, BasicFileAttributes.class)
@@ -110,10 +129,8 @@ public class ZeroDate {
                             .toInstant();
             Instant expectedInstant =
                     expected.atZone(ZoneId.systemDefault()).toInstant();
-            if (!actualInstant.equals(expectedInstant)) {
-                throw new AssertionError(
-                        String.format("actual: %s, expected: %s", actualInstant, expectedInstant));
-            }
+            assertEquals(expectedInstant, actualInstant,
+                    String.format("actual: %s, expected: %s", actualInstant, expectedInstant));
         } finally {
             Files.delete(path);
         }
diff --git a/test/jdk/jdk/nio/zipfs/ZipFSOutputStreamTest.java b/test/jdk/jdk/nio/zipfs/ZipFSOutputStreamTest.java
index 8175eec070d..4e797b57380 100644
--- a/test/jdk/jdk/nio/zipfs/ZipFSOutputStreamTest.java
+++ b/test/jdk/jdk/nio/zipfs/ZipFSOutputStreamTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2022, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2022, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -22,11 +22,6 @@
  *
  */
 
-import org.testng.Assert;
-import org.testng.annotations.AfterMethod;
-import org.testng.annotations.BeforeMethod;
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
 
 import java.io.IOException;
 import java.io.InputStream;
@@ -37,6 +32,16 @@ import java.nio.file.Files;
 import java.nio.file.Path;
 import java.util.Arrays;
 import java.util.Map;
+import java.util.stream.Stream;
+
+import org.junit.jupiter.api.AfterEach;
+import org.junit.jupiter.api.BeforeEach;
+
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.Arguments;
+import org.junit.jupiter.params.provider.MethodSource;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
 
 
 /**
@@ -44,7 +49,7 @@ import java.util.Map;
  * @summary Verify that the outputstream created for zip file entries, through the ZipFileSystem
  * works fine for varying sizes of the zip file entries
  * @bug 8190753 8011146 8279536
- * @run testng/timeout=300 ZipFSOutputStreamTest
+ * @run junit/timeout=300 ZipFSOutputStreamTest
  */
 public class ZipFSOutputStreamTest {
     // List of files to be added to the ZIP file along with their sizes in bytes
@@ -56,12 +61,12 @@ public class ZipFSOutputStreamTest {
 
     private static final Path ZIP_FILE = Path.of("zipfs-outputstream-test.zip");
 
-    @BeforeMethod
+    @BeforeEach
     public void setUp() throws IOException {
         deleteFiles();
     }
 
-    @AfterMethod
+    @AfterEach
     public void tearDown() throws IOException {
         deleteFiles();
     }
@@ -70,13 +75,12 @@ public class ZipFSOutputStreamTest {
         Files.deleteIfExists(ZIP_FILE);
     }
 
-    @DataProvider(name = "zipFSCreationEnv")
-    private Object[][] zipFSCreationEnv() {
-        return new Object[][]{
-                {Map.of("create", "true", "noCompression", "true")}, // STORED
-                {Map.of("create", "true", "noCompression", "false")} // DEFLATED
+    private static Stream<Arguments> zipFSCreationEnv() {
+        return Stream.of(
+                Arguments.of(Map.of("create", "true", "noCompression", "true")), // STORED
+                Arguments.of(Map.of("create", "true", "noCompression", "false")) // DEFLATED
 
-        };
+        );
     }
 
     /**
@@ -84,7 +88,8 @@ public class ZipFSOutputStreamTest {
      * by the ZipFileSystem. Then verify that the generated zip file entries are as expected,
      * both in size and content
      */
-    @Test(dataProvider = "zipFSCreationEnv")
+    @ParameterizedTest
+    @MethodSource("zipFSCreationEnv")
     public void testOutputStream(final Map<String, ?> env) throws Exception {
         final byte[] chunk = new byte[1024];
         // fill it with some fixed content (the fixed content will later on help ease
@@ -117,12 +122,12 @@ public class ZipFSOutputStreamTest {
                     while ((numRead = is.read(buf)) != -1) {
                         totalRead += numRead;
                         // verify the content
-                        Assert.assertEquals(Arrays.mismatch(buf, 0, numRead, chunk, 0, numRead), -1,
+                        assertEquals(-1, Arrays.mismatch(buf, 0, numRead, chunk, 0, numRead),
                                 "Unexpected content in " + entryPath);
                     }
                     System.out.println("Read entry " + entryPath + " of bytes " + totalRead
                             + " in " + (System.currentTimeMillis() - start) + " milli seconds");
-                    Assert.assertEquals(totalRead, (long) entry.getValue(),
+                    assertEquals((long) entry.getValue(), totalRead,
                             "Unexpected number of bytes read from zip entry " + entryPath);
                 }
             }
diff --git a/test/jdk/jdk/nio/zipfs/ZipFSPermissionsTest.java b/test/jdk/jdk/nio/zipfs/ZipFSPermissionsTest.java
index d5e0a03a9fa..24cba1f301b 100644
--- a/test/jdk/jdk/nio/zipfs/ZipFSPermissionsTest.java
+++ b/test/jdk/jdk/nio/zipfs/ZipFSPermissionsTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2019, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2019, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -22,8 +22,6 @@
  *
  */
 
-import org.testng.SkipException;
-import org.testng.annotations.*;
 
 import java.io.IOException;
 import java.nio.file.FileSystem;
@@ -36,9 +34,21 @@ import java.nio.file.attribute.PosixFilePermission;
 import java.nio.file.attribute.PosixFilePermissions;
 import java.util.Map;
 import java.util.Set;
+import java.util.stream.Stream;
 
 import static java.nio.file.attribute.PosixFilePermission.*;
-import static org.testng.Assert.assertEquals;
+
+import org.junit.jupiter.api.AfterAll;
+import org.junit.jupiter.api.AfterEach;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import org.junit.jupiter.api.Assumptions;
+import org.junit.jupiter.api.BeforeAll;
+import org.junit.jupiter.api.BeforeEach;
+
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.Arguments;
+import org.junit.jupiter.params.provider.MethodSource;
+import org.junit.jupiter.params.provider.NullSource;
 
 /**
  * @test
@@ -46,7 +56,7 @@ import static org.testng.Assert.assertEquals;
  * @summary Updating an existing zip file does not preserve original permissions
  * @library /test/lib
  * @modules jdk.zipfs
- * @run testng/othervm ZipFSPermissionsTest
+ * @run junit/othervm ZipFSPermissionsTest
  */
 public class ZipFSPermissionsTest {
 
@@ -62,18 +72,14 @@ public class ZipFSPermissionsTest {
     /**
      * Create the files used by the test
      */
-    @BeforeSuite
-    public void setUp() throws Exception {
+    @BeforeAll
+    public static void setUp() throws Exception {
         boolean supportsPosix = FileSystems.getDefault()
                 .supportedFileAttributeViews().contains("posix");
-
         // Check to see if File System supports POSIX permissions
-        if (supportsPosix) {
-            System.out.println("File Store Supports Posix");
-        } else {
-            // As there is no POSIX permission support, skip running the test
-            throw new SkipException("Cannot set permissions on this File Store");
-        }
+
+        Assumptions.assumeTrue(supportsPosix, "Cannot set permissions on this File Store");
+        System.out.println("File Store Supports Posix");
         Files.writeString(entry0, "Tennis Pro");
         Files.writeString(entry1, "Tennis is a lifetime sport!");
     }
@@ -81,7 +87,7 @@ public class ZipFSPermissionsTest {
     /**
      * Re-create the initial Zip file prior to each run.
      */
-    @BeforeMethod
+    @BeforeEach
     public void before() throws Exception {
         Files.deleteIfExists(zipFile);
         zip(zipFile, Map.of("create", "true"), entry0);
@@ -90,7 +96,7 @@ public class ZipFSPermissionsTest {
     /**
      * Remove Zip file used by test after each run.
      */
-    @AfterMethod
+    @AfterEach
     public void tearDown() throws Exception {
         Files.deleteIfExists(zipFile);
     }
@@ -98,8 +104,8 @@ public class ZipFSPermissionsTest {
     /**
      * Remove files used by test as part of final test run clean-up
      */
-    @AfterSuite
-    public void suiteCleanUp() throws Exception {
+    @AfterAll
+    public static void suiteCleanUp() throws Exception {
         Files.deleteIfExists(zipFile);
         Files.deleteIfExists(entry0);
         Files.deleteIfExists(entry1);
@@ -112,7 +118,9 @@ public class ZipFSPermissionsTest {
      *                 file
      * @throws Exception If an error occurs
      */
-    @Test(dataProvider = "posixPermissions")
+    @ParameterizedTest
+    @MethodSource("posixPermissions")
+    @NullSource
     public void testZipPerms(Set<PosixFilePermission> newPerms) throws Exception {
         if (DEBUG) {
             System.out.printf("Test Run with perms= %s%n", newPerms);
@@ -138,7 +146,7 @@ public class ZipFSPermissionsTest {
         // Zip file
         PosixFileAttributes afterAttrs = getPosixAttributes(zipFile);
         displayPermissions("Permissions after updating the Zip File", zipFile);
-        assertEquals(afterAttrs.permissions(), newPerms,
+        assertEquals(newPerms, afterAttrs.permissions(),
                 "Permissions were not updated as expected!");
     }
 
@@ -206,23 +214,21 @@ public class ZipFSPermissionsTest {
     }
 
     /*
-     * DataProvider used to verify the permissions on a Zip file
+     * MethodSource used to verify the permissions on a Zip file
      * are as expected after updating the Zip file
      */
-    @DataProvider(name = "posixPermissions")
-    private Object[][] posixPermissions() {
-        return new Object[][]{
-                {null},
-                {Set.of(OWNER_READ, OWNER_WRITE, OTHERS_READ)},
-                {Set.of(OWNER_READ, OWNER_WRITE, OWNER_EXECUTE)},
-                {Set.of(OWNER_READ, OWNER_WRITE, OTHERS_READ, OTHERS_WRITE)},
-                {Set.of(OWNER_READ, OWNER_WRITE, OWNER_EXECUTE, OTHERS_READ,
-                        OTHERS_WRITE, OTHERS_EXECUTE)},
-                {Set.of(OWNER_READ, OWNER_WRITE, OWNER_EXECUTE,
+    private static Stream<Arguments> posixPermissions() {
+        return Stream.of(
+                Arguments.of(Set.of(OWNER_READ, OWNER_WRITE, OTHERS_READ)),
+                Arguments.of(Set.of(OWNER_READ, OWNER_WRITE, OWNER_EXECUTE)),
+                Arguments.of(Set.of(OWNER_READ, OWNER_WRITE, OTHERS_READ, OTHERS_WRITE)),
+                Arguments.of(Set.of(OWNER_READ, OWNER_WRITE, OWNER_EXECUTE, OTHERS_READ,
+                        OTHERS_WRITE, OTHERS_EXECUTE)),
+                Arguments.of(Set.of(OWNER_READ, OWNER_WRITE, OWNER_EXECUTE,
                         GROUP_READ, GROUP_WRITE,GROUP_EXECUTE, OTHERS_READ,
-                        OTHERS_WRITE, OTHERS_EXECUTE)},
-                {Set.of(OWNER_READ, OWNER_WRITE, GROUP_READ, GROUP_WRITE,
-                        OTHERS_READ, OTHERS_WRITE)},
-        };
+                        OTHERS_WRITE, OTHERS_EXECUTE)),
+                Arguments.of(Set.of(OWNER_READ, OWNER_WRITE, GROUP_READ, GROUP_WRITE,
+                        OTHERS_READ, OTHERS_WRITE))
+        );
     }
 }
diff --git a/test/jdk/jdk/nio/zipfs/ZipFSTester.java b/test/jdk/jdk/nio/zipfs/ZipFSTester.java
index e6300a90004..84135fd0d7d 100644
--- a/test/jdk/jdk/nio/zipfs/ZipFSTester.java
+++ b/test/jdk/jdk/nio/zipfs/ZipFSTester.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2010, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2010, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -21,6 +21,9 @@
  * questions.
  */
 
+import org.junit.jupiter.api.BeforeAll;
+import org.junit.jupiter.api.Test;
+
 import java.io.File;
 import java.io.IOException;
 import java.io.InputStream;
@@ -68,6 +71,13 @@ import java.util.zip.ZipOutputStream;
 
 import static java.nio.file.StandardOpenOption.*;
 import static java.nio.file.StandardCopyOption.*;
+import static org.junit.jupiter.api.Assertions.assertArrayEquals;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertFalse;
+import static org.junit.jupiter.api.Assertions.assertNotEquals;
+import static org.junit.jupiter.api.Assertions.assertThrows;
+import static org.junit.jupiter.api.Assertions.assertTrue;
+import static org.junit.jupiter.api.Assertions.fail;
 
 /*
  * Tests various zipfs operations.
@@ -78,57 +88,46 @@ import static java.nio.file.StandardCopyOption.*;
  *      8131067 8034802 8210899 8273961 8271079 8299864
  * @summary Test Zip filesystem provider
  * @modules jdk.zipfs
- * @run main ZipFSTester
- * @run main/othervm ZipFSTester
+ * @run junit ZipFSTester
+ * @run junit/othervm ZipFSTester
  */
-
 public class ZipFSTester {
-    public static void main(String[] args) throws Exception {
-        // create JAR file for test, actual contents don't matter
-        Path jarFile = Utils.createJarFile("tester.jar",
+
+    private static final Random RDM = new Random();
+
+    // create JAR file for test, actual contents don't matter
+    static Path jarFile;
+
+    @BeforeAll
+    static void setup() throws Exception {
+        jarFile = Utils.createJarFile("tester.jar",
                 "META-INF/MANIFEST.MF",
                 "dir1/foo",
                 "dir2/bar",
                 "dir1/dir3/fooo");
-
-        try (FileSystem fs = newZipFileSystem(jarFile, Collections.emptyMap())) {
-            test0(fs);
-            test1(fs);
-            test2(fs);
-            testFileStoreNullArgs(fs); // more tests
-        }
-        testStreamChannel();
-        testTime(jarFile);
-        test8069211();
-        test8131067();
     }
 
-    private static final Random RDM = new Random();
-
-    static void test0(FileSystem fs)
-        throws Exception
-    {
+    @Test
+    void test0() throws Exception {
         List<String> list = new LinkedList<>();
-        try (ZipFile zf = new ZipFile(fs.toString())) {
+        try (var fs = newZipFileSystem(jarFile, Map.of());
+             ZipFile zf = new ZipFile(fs.toString())) {
             Enumeration<? extends ZipEntry> zes = zf.entries();
             while (zes.hasMoreElements()) {
                 list.add(zes.nextElement().getName());
             }
             for (String pname : list) {
                 Path path = fs.getPath(pname);
-                if (!Files.exists(path))
-                    throw new RuntimeException("path existence check failed!");
+                assertTrue(Files.exists(path), "path existence check failed!");
                 while ((path = path.getParent()) != null) {
-                    if (!Files.exists(path))
-                        throw new RuntimeException("parent existence check failed!");
+                    assertTrue(Files.exists(path), "parent existence check failed!");
                 }
             }
         }
     }
 
-    static void test1(FileSystem fs0)
-        throws Exception
-    {
+    @Test
+    void test1() throws Exception {
         // prepare a src for testing
         Path src = getTempPath();
         String tmpName = src.toString();
@@ -142,11 +141,12 @@ public class ZipFSTester {
         Path tmpfsPath = getTempPath();
         Map<String, Object> env = new HashMap<String, Object>();
         env.put("create", "true");
-        try (FileSystem copy = newZipFileSystem(tmpfsPath, env)) {
-            z2zcopy(fs0, copy, "/", 0);
+        try (var fs = newZipFileSystem(jarFile, Map.of());
+             FileSystem copy = newZipFileSystem(tmpfsPath, env)) {
+            z2zcopy(fs, copy, "/", 0);
 
             // copy the test jar itself in
-            Files.copy(Paths.get(fs0.toString()), copy.getPath("/foo.jar"));
+            Files.copy(Paths.get(fs.toString()), copy.getPath("/foo.jar"));
             Path zpath = copy.getPath("/foo.jar");
             try (FileSystem zzfs = FileSystems.newFileSystem(zpath)) {
                 Files.copy(src, zzfs.getPath("/srcInjarjar"));
@@ -158,23 +158,15 @@ public class ZipFSTester {
             FileSystemProvider provider = fs.provider();
             // newFileSystem(path...) should not throw exception
             try (FileSystem fsPath = provider.newFileSystem(tmpfsPath, new HashMap<String, Object>())){}
-            try (FileSystem fsUri = provider.newFileSystem(
-                     new URI("jar", tmpfsPath.toUri().toString(), null),
-                     new HashMap<String, Object>()))
-            {
-                throw new RuntimeException("newFileSystem(URI...) does not throw exception");
-            } catch (FileSystemAlreadyExistsException fsaee) {}
-
-            try {
-                provider.newFileSystem(new File(System.getProperty("test.src", ".")).toPath(),
-                                       new HashMap<String, Object>());
-                throw new RuntimeException("newFileSystem() opens a directory as zipfs");
-            } catch (UnsupportedOperationException uoe) {}
-
-            try {
-                provider.newFileSystem(src, new HashMap<String, Object>());
-                throw new RuntimeException("newFileSystem() opens a non-zip file as zipfs");
-            } catch (UnsupportedOperationException uoe) {}
+            assertThrows(FileSystemAlreadyExistsException.class,
+                    () -> provider.newFileSystem(new URI("jar", tmpfsPath.toUri().toString(), null),
+                    new HashMap<>()), "newFileSystem(URI...) does not throw exception");
+            assertThrows(UnsupportedOperationException.class,
+                    () -> provider.newFileSystem(new File(System.getProperty("test.src", ".")).toPath(),
+                    new HashMap<>()), "newFileSystem() opens a directory as zipfs");
+            assertThrows(UnsupportedOperationException.class,
+                    () -> provider.newFileSystem(src, new HashMap<String, Object>()),
+                    "newFileSystem() opens a non-zip file as zipfs");
 
             // walk
             walk(fs.getPath("/"));
@@ -193,15 +185,13 @@ public class ZipFSTester {
 
             // delete
             Files.delete(dst);
-            if (Files.exists(dst))
-                throw new RuntimeException("Failed!");
+            assertFalse(Files.exists(dst));
 
             // moveout
             Path dst3 = Paths.get(tmpName + "_Tmp");
             Files.move(dst2, dst3);
             checkEqual(src, dst3);
-            if (Files.exists(dst2))
-                throw new RuntimeException("Failed!");
+            assertFalse(Files.exists(dst2));
 
             // copyback + move
             Files.copy(dst3, dst);
@@ -211,11 +201,9 @@ public class ZipFSTester {
 
             // delete
             Files.delete(dst4);
-            if (Files.exists(dst4))
-                throw new RuntimeException("Failed!");
+            assertFalse(Files.exists(dst4));
             Files.delete(dst3);
-            if (Files.exists(dst3))
-                throw new RuntimeException("Failed!");
+            assertFalse(Files.exists(dst3));
 
             // move (existing entry)
             Path dst5 = fs.getPath("META-INF/MANIFEST.MF");
@@ -227,12 +215,7 @@ public class ZipFSTester {
 
             // newInputStream on dir
             Path parent = dst2.getParent();
-            try {
-                Files.newInputStream(parent);
-                throw new RuntimeException("Failed");
-            } catch (FileSystemException e) {
-                // expected fse
-            }
+            assertThrows(FileSystemException.class, () -> Files.newInputStream(parent));
 
             // rmdirs
             try {
@@ -278,8 +261,8 @@ public class ZipFSTester {
         }
     }
 
-    static void test2(FileSystem fs) throws Exception {
-
+    @Test
+    void test2() throws Exception {
         Path fs1Path = getTempPath();
         Path fs2Path = getTempPath();
         Path fs3Path = getTempPath();
@@ -293,129 +276,137 @@ public class ZipFSTester {
         final FileSystem fs3 = newZipFileSystem(fs3Path, env);
 
         System.out.println("copy src: fs -> fs0...");
-        z2zcopy(fs, fs0, "/", 0);   // copy fs -> fs1
-        fs0.close();                // dump to file
+        try (var fs = newZipFileSystem(jarFile, Map.of())) {
+            z2zcopy(fs, fs0, "/", 0);   // copy fs -> fs1
+            fs0.close();                // dump to file
 
-        System.out.println("open fs0 as fs1");
-        env = new HashMap<String, Object>();
-        final FileSystem fs1 = newZipFileSystem(fs1Path, env);
+            System.out.println("open fs0 as fs1");
+            env = new HashMap<String, Object>();
+            final FileSystem fs1 = newZipFileSystem(fs1Path, env);
 
-        System.out.println("listing...");
-        final ArrayList<String> files = new ArrayList<>();
-        final ArrayList<String> dirs = new ArrayList<>();
-        list(fs1.getPath("/"), files, dirs);
+            System.out.println("listing...");
+            final ArrayList<String> files = new ArrayList<>();
+            final ArrayList<String> dirs = new ArrayList<>();
+            list(fs1.getPath("/"), files, dirs);
 
-        Thread t0 = new Thread(new Runnable() {
-            public void run() {
-                List<String> list = new ArrayList<>(dirs);
-                Collections.shuffle(list);
-                for (String path : list) {
-                    try {
-                        z2zcopy(fs1, fs2, path, 0);
-                    } catch (Exception x) {
-                        x.printStackTrace();
-                    }
-                }
-            }
-
-        });
-
-        Thread t1 = new Thread(new Runnable() {
-            public void run() {
-                List<String> list = new ArrayList<>(dirs);
-                Collections.shuffle(list);
-                for (String path : list) {
-                    try {
-                        z2zcopy(fs1, fs2, path, 1);
-                    } catch (Exception x) {
-                        x.printStackTrace();
-                    }
-                }
-            }
-
-        });
-
-        Thread t2 = new Thread(new Runnable() {
-            public void run() {
-                List<String> list = new ArrayList<>(dirs);
-                Collections.shuffle(list);
-                for (String path : list) {
-                    try {
-                        z2zcopy(fs1, fs2, path, 2);
-                    } catch (Exception x) {
-                        x.printStackTrace();
-                    }
-                }
-            }
-
-        });
-
-        Thread t3 = new Thread(new Runnable() {
-            public void run() {
-                List<String> list = new ArrayList<>(files);
-                Collections.shuffle(list);
-                while (!list.isEmpty()) {
-                    Iterator<String> itr = list.iterator();
-                    while (itr.hasNext()) {
-                        String path = itr.next();
+            Thread t0 = new Thread(new Runnable() {
+                public void run() {
+                    List<String> list = new ArrayList<>(dirs);
+                    Collections.shuffle(list);
+                    for (String path : list) {
                         try {
-                            if (Files.exists(fs2.getPath(path))) {
-                                z2zmove(fs2, fs3, path);
-                                itr.remove();
-                            }
-                        } catch (FileAlreadyExistsException x) {
-                            itr.remove();
+                            z2zcopy(fs1, fs2, path, 0);
                         } catch (Exception x) {
                             x.printStackTrace();
                         }
                     }
                 }
+
+            });
+
+            Thread t1 = new Thread(new Runnable() {
+                public void run() {
+                    List<String> list = new ArrayList<>(dirs);
+                    Collections.shuffle(list);
+                    for (String path : list) {
+                        try {
+                            z2zcopy(fs1, fs2, path, 1);
+                        } catch (Exception x) {
+                            x.printStackTrace();
+                        }
+                    }
+                }
+
+            });
+
+            Thread t2 = new Thread(new Runnable() {
+                public void run() {
+                    List<String> list = new ArrayList<>(dirs);
+                    Collections.shuffle(list);
+                    for (String path : list) {
+                        try {
+                            z2zcopy(fs1, fs2, path, 2);
+                        } catch (Exception x) {
+                            x.printStackTrace();
+                        }
+                    }
+                }
+
+            });
+
+            Thread t3 = new Thread(new Runnable() {
+                public void run() {
+                    List<String> list = new ArrayList<>(files);
+                    Collections.shuffle(list);
+                    while (!list.isEmpty()) {
+                        Iterator<String> itr = list.iterator();
+                        while (itr.hasNext()) {
+                            String path = itr.next();
+                            try {
+                                if (Files.exists(fs2.getPath(path))) {
+                                    z2zmove(fs2, fs3, path);
+                                    itr.remove();
+                                }
+                            } catch (FileAlreadyExistsException x) {
+                                itr.remove();
+                            } catch (Exception x) {
+                                x.printStackTrace();
+                            }
+                        }
+                    }
+                }
+
+            });
+
+            System.out.println("copying/removing...");
+            t0.start();
+            t1.start();
+            t2.start();
+            t3.start();
+            t0.join();
+            t1.join();
+            t2.join();
+            t3.join();
+
+            System.out.println("closing: fs1, fs2");
+            fs1.close();
+            fs2.close();
+
+            int failed = 0;
+            System.out.println("checkEqual: fs vs fs3");
+            for (String path : files) {
+                try {
+                    checkEqual(fs.getPath(path), fs3.getPath(path));
+                } catch (IOException x) {
+                    //x.printStackTrace();
+                    failed++;
+                }
             }
+            System.out.println("closing: fs3");
+            fs3.close();
 
-        });
+            System.out.println("opening: fs3 as fs4");
+            FileSystem fs4 = newZipFileSystem(fs3Path, env);
 
-        System.out.println("copying/removing...");
-        t0.start(); t1.start(); t2.start(); t3.start();
-        t0.join(); t1.join(); t2.join(); t3.join();
 
-        System.out.println("closing: fs1, fs2");
-        fs1.close();
-        fs2.close();
+            ArrayList<String> files2 = new ArrayList<>();
+            ArrayList<String> dirs2 = new ArrayList<>();
+            list(fs4.getPath("/"), files2, dirs2);
 
-        int failed = 0;
-        System.out.println("checkEqual: fs vs fs3");
-        for (String path : files) {
-            try {
-                checkEqual(fs.getPath(path), fs3.getPath(path));
-            } catch (IOException x) {
-                //x.printStackTrace();
-                failed++;
+            System.out.println("checkEqual: fs vs fs4");
+            for (String path : files2) {
+                checkEqual(fs.getPath(path), fs4.getPath(path));
             }
+            System.out.println("walking: fs4");
+            walk(fs4.getPath("/"));
+            System.out.println("closing: fs4");
+            fs4.close();
+            System.out.printf("failed=%d%n", failed);
+
+            Files.delete(fs1Path);
+            Files.delete(fs2Path);
+            Files.delete(fs3Path);
         }
-        System.out.println("closing: fs3");
-        fs3.close();
-
-        System.out.println("opening: fs3 as fs4");
-        FileSystem fs4 = newZipFileSystem(fs3Path, env);
-
-
-        ArrayList<String> files2 = new ArrayList<>();
-        ArrayList<String> dirs2 = new ArrayList<>();
-        list(fs4.getPath("/"), files2, dirs2);
-
-        System.out.println("checkEqual: fs vs fs4");
-        for (String path : files2) {
-            checkEqual(fs.getPath(path), fs4.getPath(path));
-        }
-        System.out.println("walking: fs4");
-        walk(fs4.getPath("/"));
-        System.out.println("closing: fs4");
-        fs4.close();
-        System.out.printf("failed=%d%n", failed);
-
-        Files.delete(fs1Path);
-        Files.delete(fs2Path);
-        Files.delete(fs3Path);
     }
 
     static final int METHOD_STORED     = 0;
@@ -448,29 +439,21 @@ public class ZipFSTester {
         CRC32 crc32 = new CRC32();
         crc32.update(expected);
 
-        if (((Long)Files.getAttribute(path, "zip:crc")).intValue() !=
-            (int)crc32.getValue()) {
-            System.out.printf(" getAttribute.crc <%s> failed %x vs %x ...%n",
+        assertEquals((int)crc32.getValue(), ((Long)Files.getAttribute(path, "zip:crc")).intValue(),
+                " getAttribute.crc <%s> failed %x vs %x ...%n".formatted(
                               path.toString(),
                               ((Long)Files.getAttribute(path, "zip:crc")).intValue(),
-                              (int)crc32.getValue());
-            throw new RuntimeException("CHECK FAILED!");
-        }
+                              (int)crc32.getValue()));
 
-        if (((Long)Files.getAttribute(path, "zip:size")).intValue() != expected.length) {
-            System.out.printf(" getAttribute.size <%s> failed %x vs %x ...%n",
+        assertEquals(expected.length, ((Long)Files.getAttribute(path, "zip:size")).intValue(),
+                " getAttribute.size <%s> failed %x vs %x ...%n".formatted(
                               path.toString(),
                               ((Long)Files.getAttribute(path, "zip:size")).intValue(),
-                              expected.length);
-            throw new RuntimeException("CHECK FAILED!");
-        }
+                              expected.length));
 
         //streams
         try (InputStream is = Files.newInputStream(path)) {
-            if (!Arrays.equals(is.readAllBytes(), expected)) {
-                System.out.printf(" newInputStream <%s> failed...%n", path.toString());
-                throw new RuntimeException("CHECK FAILED!");
-            }
+            assertArrayEquals(expected, is.readAllBytes(), " newInputStream <%s> failed...%n".formatted(path.toString()));
         }
 
         // channels -- via sun.nio.ch.ChannelInputStream
@@ -478,17 +461,12 @@ public class ZipFSTester {
             InputStream is = Channels.newInputStream(sbc)) {
 
             // check all bytes match
-            if (!Arrays.equals(is.readAllBytes(), expected)) {
-                System.out.printf(" newByteChannel <%s> failed...%n", path.toString());
-                throw new RuntimeException("CHECK FAILED!");
-            }
+            assertArrayEquals(expected, is.readAllBytes(),
+                    " newByteChannel <%s> failed...%n".formatted(path.toString()));
 
             // Check if read position is at the end
-            if (sbc.position() != expected.length) {
-                System.out.printf("pos [%s]: size=%d, position=%d%n",
-                                  path.toString(), expected.length, sbc.position());
-                throw new RuntimeException("CHECK FAILED!");
-            }
+            assertEquals(expected.length, sbc.position(), "pos [%s]: size=%d, position=%d%n".formatted(
+                                  path.toString(), expected.length, sbc.position()));
 
             // Check position(x) + read() at the random/specific pos/len
             byte[] buf = new byte[1024];
@@ -503,21 +481,20 @@ public class ZipFSTester {
                 // System.out.printf("  --> %d, %d%n", pos, len);
                 bb.position(0).limit(len);    // bb.flip().limit(len);
                 int expectedReadResult = sbc.size() == 0 ? -1 : len;
-                if (sbc.position(pos).position() != pos ||
+                assertFalse(sbc.position(pos).position() != pos ||
                     sbc.read(bb) != expectedReadResult ||
-                    !Arrays.equals(buf, 0, bb.position(), expected, pos, pos + len)) {
-                    System.out.printf("read()/position() failed%n");
-                    throw new RuntimeException("CHECK FAILED!");
-                }
+                    !Arrays.equals(buf, 0, bb.position(), expected, pos, pos + len),
+                        "read()/position() failed%n");
             }
         } catch (IOException x) {
             x.printStackTrace();
-            throw new RuntimeException("CHECK FAILED!");
+            fail("CHECK FAILED!");
         }
     }
 
     // test entry stream/channel reading
-    static void testStreamChannel() throws Exception {
+    @Test
+    void testStreamChannel() throws Exception {
         Path zpath = getTempPath();
         try {
             var crc = new CRC32();
@@ -542,7 +519,7 @@ public class ZipFSTester {
                    zos.closeEntry();
                 }
             }
-            try (var zfs = newZipFileSystem(zpath, Collections.emptyMap())) {
+            try (var zfs = newZipFileSystem(zpath, Map.of())) {
                 for (Object[] e : entries) {
                     Path path = zfs.getPath((String)e[0]);
                     byte[] bytes = (byte[])e[2];
@@ -561,7 +538,7 @@ public class ZipFSTester {
                     }
                 }
             }
-            try (var zfs = newZipFileSystem(zpath, Collections.emptyMap())) {
+            try (var zfs = newZipFileSystem(zpath, Map.of())) {
                 for (Object[] e : entries) {
                     checkRead(zfs.getPath((String)e[0]), (byte[])e[2]);
                 }
@@ -574,7 +551,7 @@ public class ZipFSTester {
                     Files.write(zfs.getPath((String)e[0]), (byte[])e[2]);
                 }
             }
-            try (var zfs = newZipFileSystem(zpath, Collections.emptyMap())) {
+            try (var zfs = newZipFileSystem(zpath, Map.of())) {
                 for (Object[] e : entries) {
                     checkRead(zfs.getPath((String)e[0]), (byte[])e[2]);
                 }
@@ -591,7 +568,7 @@ public class ZipFSTester {
                     }
                 }
             }
-            try (var zfs = newZipFileSystem(zpath, Collections.emptyMap())) {
+            try (var zfs = newZipFileSystem(zpath, Map.of())) {
                 for (Object[] e : entries) {
                     checkRead(zfs.getPath((String)e[0]), (byte[])e[2]);
                 }
@@ -604,9 +581,10 @@ public class ZipFSTester {
     }
 
     // test file stamp
-    static void testTime(Path src) throws Exception {
+    @Test
+    void testTime() throws Exception {
         BasicFileAttributes attrs = Files
-                        .getFileAttributeView(src, BasicFileAttributeView.class)
+                        .getFileAttributeView(jarFile, BasicFileAttributeView.class)
                         .readAttributes();
         // create a new filesystem, copy this file into it
         Map<String, Object> env = new HashMap<String, Object>();
@@ -616,8 +594,8 @@ public class ZipFSTester {
             System.out.println("test copy with timestamps...");
             // copyin
             Path dst = getPathWithParents(fs, "me");
-            Files.copy(src, dst, COPY_ATTRIBUTES);
-            checkEqual(src, dst);
+            Files.copy(jarFile, dst, COPY_ATTRIBUTES);
+            checkEqual(jarFile, dst);
             System.out.println("mtime: " + attrs.lastModifiedTime());
             System.out.println("ctime: " + attrs.creationTime());
             System.out.println("atime: " + attrs.lastAccessTime());
@@ -630,20 +608,19 @@ public class ZipFSTester {
             System.out.println("atime: " + dstAttrs.lastAccessTime());
 
             // 1-second granularity
-            if (attrs.lastModifiedTime().to(TimeUnit.SECONDS) !=
+            assertFalse(attrs.lastModifiedTime().to(TimeUnit.SECONDS) !=
                 dstAttrs.lastModifiedTime().to(TimeUnit.SECONDS) ||
                 attrs.lastAccessTime().to(TimeUnit.SECONDS) !=
                 dstAttrs.lastAccessTime().to(TimeUnit.SECONDS) ||
                 attrs.creationTime().to(TimeUnit.SECONDS) !=
-                dstAttrs.creationTime().to(TimeUnit.SECONDS)) {
-                throw new RuntimeException("Timestamp Copy Failed!");
-            }
+                dstAttrs.creationTime().to(TimeUnit.SECONDS), "Timestamp Copy Failed!");
         } finally {
             Files.delete(fsPath);
         }
     }
 
-    static void test8069211() throws Exception {
+    @Test
+    void test8069211() throws Exception {
         // create a new filesystem, copy this file into it
         Map<String, Object> env = new HashMap<String, Object>();
         env.put("create", "true");
@@ -655,18 +632,17 @@ public class ZipFSTester {
             out.close();
         }
         try (FileSystem fs = newZipFileSystem(fsPath, new HashMap<String, Object>())) {
-            if (!Arrays.equals(Files.readAllBytes(fs.getPath("/foo")),
-                               "hello".getBytes())) {
-                throw new RuntimeException("entry close() failed");
-            }
+            assertArrayEquals("hello".getBytes(), Files.readAllBytes(fs.getPath("/foo")),
+                    "entry close() failed");
         } catch (Exception x) {
-            throw new RuntimeException("entry close() failed", x);
+            fail("entry close() failed", x);
         } finally {
             Files.delete(fsPath);
         }
     }
 
-    static void test8131067() throws Exception {
+    @Test
+    void test8131067() throws Exception {
         Map<String, Object> env = new HashMap<String, Object>();
         env.put("create", "true");
 
@@ -677,10 +653,8 @@ public class ZipFSTester {
         try (FileSystem fs = newZipFileSystem(fsPath, env);) {
             Files.write(fs.getPath("/foo"), "hello".getBytes());
             URI fooUri = fs.getPath("/foo").toUri();
-            if (!Arrays.equals(Files.readAllBytes(Paths.get(fooUri)),
-                               "hello".getBytes())) {
-                throw new RuntimeException("entry close() failed");
-            }
+            assertArrayEquals("hello".getBytes(), Files.readAllBytes(Paths.get(fooUri)),
+                    "entry close() failed");
         } finally {
             Files.delete(fsPath);
         }
@@ -868,19 +842,13 @@ public class ZipFSTester {
                 int nDst = 0;
                 while (nDst < nSrc) {
                     int n = isDst.read(bufDst, nDst, nSrc - nDst);
-                    if (n == -1) {
-                        System.out.printf("checking <%s> vs <%s>...%n",
-                                          src.toString(), dst.toString());
-                        throw new RuntimeException("CHECK FAILED!");
-                    }
+                    assertNotEquals(-1, n, "checking <%s> vs <%s>...%n".formatted(
+                                          src.toString(), dst.toString()));
                     nDst += n;
                 }
                 while (--nSrc >= 0) {
-                    if (bufSrc[nSrc] != bufDst[nSrc]) {
-                        System.out.printf("checking <%s> vs <%s>...%n",
-                                          src.toString(), dst.toString());
-                        throw new RuntimeException("CHECK FAILED!");
-                    }
+                    assertEquals(bufSrc[nSrc], bufDst[nSrc], "checking <%s> vs <%s>...%n".formatted(
+                                          src.toString(), dst.toString()));
                     nSrc--;
                 }
             }
@@ -890,29 +858,20 @@ public class ZipFSTester {
         try (SeekableByteChannel chSrc = Files.newByteChannel(src);
              SeekableByteChannel chDst = Files.newByteChannel(dst))
         {
-            if (chSrc.size() != chDst.size()) {
-                System.out.printf("src[%s].size=%d, dst[%s].size=%d%n",
+            assertEquals(chSrc.size(), chDst.size(), "src[%s].size=%d, dst[%s].size=%d%n".formatted(
                                   chSrc.toString(), chSrc.size(),
-                                  chDst.toString(), chDst.size());
-                throw new RuntimeException("CHECK FAILED!");
-            }
+                                  chDst.toString(), chDst.size()));
             ByteBuffer bbSrc = ByteBuffer.allocate(8192);
             ByteBuffer bbDst = ByteBuffer.allocate(8192);
 
             int nSrc = 0;
             while ((nSrc = chSrc.read(bbSrc)) != -1) {
                 int nDst = chDst.read(bbDst);
-                if (nSrc != nDst) {
-                    System.out.printf("checking <%s> vs <%s>...%n",
-                                      src.toString(), dst.toString());
-                    throw new RuntimeException("CHECK FAILED!");
-                }
+                assertEquals(nSrc, nDst,
+                        "checking <%s> vs <%s>...%n".formatted(src.toString(), dst.toString()));
                 while (--nSrc >= 0) {
-                    if (bbSrc.get(nSrc) != bbDst.get(nSrc)) {
-                        System.out.printf("checking <%s> vs <%s>...%n",
-                                          src.toString(), dst.toString());
-                        throw new RuntimeException("CHECK FAILED!");
-                    }
+                    assertEquals(bbSrc.get(nSrc), bbDst.get(nSrc),
+                            "checking <%s> vs <%s>...%n".formatted(src.toString(), dst.toString()));
                     nSrc--;
                 }
                 bbSrc.flip();
@@ -920,18 +879,12 @@ public class ZipFSTester {
             }
 
             // Check if source read position is at the end
-            if (chSrc.position() != chSrc.size()) {
-                System.out.printf("src[%s]: size=%d, position=%d%n",
-                                  chSrc.toString(), chSrc.size(), chSrc.position());
-                throw new RuntimeException("CHECK FAILED!");
-            }
+            assertEquals(chSrc.position(), chSrc.size(), "src[%s]: size=%d, position=%d%n".formatted(
+                                  chSrc.toString(), chSrc.size(), chSrc.position()));
 
             // Check if destination read position is at the end
-            if (chDst.position() != chDst.size()) {
-                System.out.printf("dst[%s]: size=%d, position=%d%n",
-                                  chDst.toString(), chDst.size(), chDst.position());
-                throw new RuntimeException("CHECK FAILED!");
-            }
+            assertEquals(chDst.position(), chDst.size(), "dst[%s]: size=%d, position=%d%n".formatted(
+                                  chDst.toString(), chDst.size(), chDst.position()));
 
             // Check position(x) + read() at the specific pos/len
             for (int i = 0; i < 10; i++) {
@@ -996,18 +949,12 @@ public class ZipFSTester {
             }
 
             // Check if source read position is at the end
-            if (srcCh.position() != srcCh.size()) {
-                System.out.printf("src[%s]: size=%d, position=%d%n",
-                                  srcCh.toString(), srcCh.size(), srcCh.position());
-                throw new RuntimeException("CHECK FAILED!");
-            }
+            assertEquals(srcCh.position(), srcCh.size(), "src[%s]: size=%d, position=%d%n".formatted(
+                                  srcCh.toString(), srcCh.size(), srcCh.position()));
 
             // Check if destination write position is at the end
-            if (dstCh.position() != dstCh.size()) {
-                System.out.printf("dst[%s]: size=%d, position=%d%n",
-                                  dstCh.toString(), dstCh.size(), dstCh.position());
-                throw new RuntimeException("CHECK FAILED!");
-            }
+            assertEquals(dstCh.position(), dstCh.size(), "dst[%s]: size=%d, position=%d%n".formatted(
+                                  dstCh.toString(), dstCh.size(), dstCh.position()));
         }
     }
 
@@ -1037,17 +984,13 @@ public class ZipFSTester {
 
         try (SeekableByteChannel sbc = Files.newByteChannel(path)) {
             System.out.printf("   sbc[0]: pos=%d, size=%d%n", sbc.position(), sbc.size());
-            if (sbc.position() != 0) {
-                throw new RuntimeException("CHECK FAILED!");
-            }
+            assertEquals(0, sbc.position());
 
             bb = ByteBuffer.allocate((int)sbc.size());
             n = sbc.read(bb);
             System.out.printf("   sbc[1]: read=%d, pos=%d, size=%d%n",
                               n, sbc.position(), sbc.size());
-            if (sbc.position() != sbc.size()) {
-                throw new RuntimeException("CHECK FAILED!");
-            }
+            assertEquals(sbc.position(), sbc.size());
             bb2 = ByteBuffer.allocate((int)sbc.size());
         }
 
@@ -1057,16 +1000,13 @@ public class ZipFSTester {
             sbc.position(N);
             System.out.printf("   sbc[2]: pos=%d, size=%d%n",
                               sbc.position(), sbc.size());
-            if (sbc.position() != N) {
-                throw new RuntimeException("CHECK FAILED!");
-            }
+            assertEquals(N, sbc.position());
             bb2.limit(100);
             n = sbc.read(bb2);
             System.out.printf("   sbc[3]: read=%d, pos=%d, size=%d%n",
                               n, sbc.position(), sbc.size());
-            if (n < 0 || sbc.position() != (N + n)) {
-                throw new RuntimeException("CHECK FAILED!");
-            }
+            assertFalse(n < 0);
+            assertFalse(sbc.position() != (N + n));
             System.out.printf("   sbc[4]: bb[%d]=%d, bb1[0]=%d%n",
                               N, bb.get(N) & 0xff, bb2.get(0) & 0xff);
         }
@@ -1086,38 +1026,22 @@ public class ZipFSTester {
     /**
      * Tests if certain methods throw a NullPointerException if invoked with null
      * as specified in java.nio.file.package-info.java
-     * @param fs file system containing at least one ZipFileStore
      *
      * @see 8299864
      */
-    static void testFileStoreNullArgs(FileSystem fs)  {
-        FileStore store = fs.getFileStores().iterator().next();
+    @Test
+    void testFileStoreNullArgs() throws Exception {
+        try (var fs = newZipFileSystem(jarFile, Map.of())) {
+            // file system containing at least one ZipFileStore
+            FileStore store = fs.getFileStores().iterator().next();
 
-        // Make sure we are testing the right thing
-        if (!"jdk.nio.zipfs.ZipFileStore".equals(store.getClass().getName()))
-            throw new AssertionError(store.getClass().getName());
+            // Make sure we are testing the right thing
+            assertEquals("jdk.nio.zipfs.ZipFileStore", store.getClass().getName());
 
-        assertThrowsNPE(() -> store.supportsFileAttributeView((String) null));
-        assertThrowsNPE(() -> store.supportsFileAttributeView((Class<? extends FileAttributeView>) null));
-        assertThrowsNPE(() -> store.getAttribute(null));
-        assertThrowsNPE(() -> store.getFileStoreAttributeView(null));
-    }
-
-    @FunctionalInterface
-    private interface ThrowingRunnable {
-        void run() throws Exception;
-    }
-
-    static void assertThrowsNPE(ThrowingRunnable r) {
-        try {
-            r.run();
-            // Didn't throw an exception
-            throw new AssertionError();
-        } catch (NullPointerException expected) {
-            // happy path
-        } catch (Exception e) {
-            throw new AssertionError(e);
+            assertThrows(NullPointerException.class, () -> store.supportsFileAttributeView((String) null));
+            assertThrows(NullPointerException.class, () -> store.supportsFileAttributeView((Class<? extends FileAttributeView>) null));
+            assertThrows(NullPointerException.class, () -> store.getAttribute(null));
+            assertThrows(NullPointerException.class, () -> store.getFileStoreAttributeView(null));
         }
     }
-
 }
diff --git a/test/jdk/jdk/nio/zipfs/jarfs/JFSTester.java b/test/jdk/jdk/nio/zipfs/jarfs/JFSTester.java
index 82505e24e6c..46bb27dcf10 100644
--- a/test/jdk/jdk/nio/zipfs/jarfs/JFSTester.java
+++ b/test/jdk/jdk/nio/zipfs/jarfs/JFSTester.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2016, 2020, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2016, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -30,12 +30,9 @@
  * @library /test/lib/
  * @build jdk.test.lib.util.JarBuilder
  *        jdk.test.lib.compiler.Compiler
- * @run testng JFSTester
+ * @run junit JFSTester
  */
 
-import org.testng.Assert;
-import org.testng.annotations.BeforeClass;
-import org.testng.annotations.Test;
 
 import java.io.IOException;
 import java.io.UncheckedIOException;
@@ -52,35 +49,41 @@ import java.util.stream.Collectors;
 
 import jdk.test.lib.util.JarBuilder;
 
+import org.junit.jupiter.api.BeforeAll;
+import org.junit.jupiter.api.Test;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+
+
 public class JFSTester {
-    private URI jarURI;
+    private static URI jarURI;
 
-    final private String root_dir1_leaf1_txt = "This is leaf 1." + System.lineSeparator();
-    final private String root_dir1_leaf2_txt = "This is leaf 2." + System.lineSeparator();
-    final private String root_dir2_leaf3_txt = "This is leaf 3." + System.lineSeparator();
-    final private String root_dir2_leaf4_txt = "This is leaf 4." + System.lineSeparator();
-    final private String v9_root_dir2_leaf3_txt = "This is version 9 leaf 3." + System.lineSeparator();
-    final private String v9_root_dir2_leaf4_txt = "This is version 9 leaf 4." + System.lineSeparator();
-    final private String v9_root_dir3_leaf5_txt = "This is version 9 leaf 5." + System.lineSeparator();
-    final private String v9_root_dir3_leaf6_txt = "This is version 9 leaf 6." + System.lineSeparator();
-    final private String v10_root_dir3_leaf5_txt = "This is version 10 leaf 5." + System.lineSeparator();
-    final private String v10_root_dir3_leaf6_txt = "This is version 10 leaf 6." + System.lineSeparator();
+    private static final String ROOT_DIR_1_LEAF_1_TXT = "This is leaf 1." + System.lineSeparator();
+    private static final String ROOT_DIR_1_LEAF_2_TXT = "This is leaf 2." + System.lineSeparator();
+    private static final String ROOT_DIR_2_LEAF_3_TXT = "This is leaf 3." + System.lineSeparator();
+    private static final String ROOT_DIR_2_LEAF_4_TXT = "This is leaf 4." + System.lineSeparator();
+    private static final String V_9_ROOT_DIR_2_LEAF_3_TXT = "This is version 9 leaf 3." + System.lineSeparator();
+    private static final String V_9_ROOT_DIR_2_LEAF_4_TXT = "This is version 9 leaf 4." + System.lineSeparator();
+    private static final String V_9_ROOT_DIR_3_LEAF_5_TXT = "This is version 9 leaf 5." + System.lineSeparator();
+    private static final String V_9_ROOT_DIR_3_LEAF_6_TXT = "This is version 9 leaf 6." + System.lineSeparator();
+    private static final String V_10_ROOT_DIR_3_LEAF_5_TXT = "This is version 10 leaf 5." + System.lineSeparator();
+    private static final String V_10_ROOT_DIR_3_LEAF_6_TXT = "This is version 10 leaf 6." + System.lineSeparator();
 
-    @BeforeClass
-    public void initialize() throws Exception {
+    @BeforeAll
+    public static void initialize() throws Exception {
         Path jarfile = Paths.get("test.jar");
         JarBuilder jb = new JarBuilder(jarfile.toString());
         jb.addAttribute("Multi-Release", "true");
-        jb.addEntry("root/dir1/leaf1.txt", root_dir1_leaf1_txt.getBytes());
-        jb.addEntry("root/dir1/leaf2.txt", root_dir1_leaf2_txt.getBytes());
-        jb.addEntry("root/dir2/leaf3.txt", root_dir2_leaf3_txt.getBytes());
-        jb.addEntry("root/dir2/leaf4.txt", root_dir2_leaf4_txt.getBytes());
-        jb.addEntry("META-INF/versions/9/root/dir2/leaf3.txt", v9_root_dir2_leaf3_txt.getBytes());
-        jb.addEntry("META-INF/versions/9/root/dir2/leaf4.txt", v9_root_dir2_leaf4_txt.getBytes());
-        jb.addEntry("META-INF/versions/9/root/dir3/leaf5.txt", v9_root_dir3_leaf5_txt.getBytes());
-        jb.addEntry("META-INF/versions/9/root/dir3/leaf6.txt", v9_root_dir3_leaf6_txt.getBytes());
-        jb.addEntry("META-INF/versions/10/root/dir3/leaf5.txt", v10_root_dir3_leaf5_txt.getBytes());
-        jb.addEntry("META-INF/versions/10/root/dir3/leaf6.txt", v10_root_dir3_leaf6_txt.getBytes());
+        jb.addEntry("root/dir1/leaf1.txt", ROOT_DIR_1_LEAF_1_TXT.getBytes());
+        jb.addEntry("root/dir1/leaf2.txt", ROOT_DIR_1_LEAF_2_TXT.getBytes());
+        jb.addEntry("root/dir2/leaf3.txt", ROOT_DIR_2_LEAF_3_TXT.getBytes());
+        jb.addEntry("root/dir2/leaf4.txt", ROOT_DIR_2_LEAF_4_TXT.getBytes());
+        jb.addEntry("META-INF/versions/9/root/dir2/leaf3.txt", V_9_ROOT_DIR_2_LEAF_3_TXT.getBytes());
+        jb.addEntry("META-INF/versions/9/root/dir2/leaf4.txt", V_9_ROOT_DIR_2_LEAF_4_TXT.getBytes());
+        jb.addEntry("META-INF/versions/9/root/dir3/leaf5.txt", V_9_ROOT_DIR_3_LEAF_5_TXT.getBytes());
+        jb.addEntry("META-INF/versions/9/root/dir3/leaf6.txt", V_9_ROOT_DIR_3_LEAF_6_TXT.getBytes());
+        jb.addEntry("META-INF/versions/10/root/dir3/leaf5.txt", V_10_ROOT_DIR_3_LEAF_5_TXT.getBytes());
+        jb.addEntry("META-INF/versions/10/root/dir3/leaf6.txt", V_10_ROOT_DIR_3_LEAF_6_TXT.getBytes());
         jb.build();
         System.out.println("Created " + jarfile + ": " + Files.exists(jarfile));
         jarURI = new URI("jar", jarfile.toUri().toString(), null);
@@ -92,38 +95,38 @@ public class JFSTester {
         Map<String, String> env = new HashMap<>();
         Set<String> contents = doTest(env);
         Set<String> expectedContents = Set.of(
-            root_dir1_leaf1_txt,
-            root_dir1_leaf2_txt,
-            root_dir2_leaf3_txt,
-            root_dir2_leaf4_txt
+                ROOT_DIR_1_LEAF_1_TXT,
+                ROOT_DIR_1_LEAF_2_TXT,
+                ROOT_DIR_2_LEAF_3_TXT,
+                ROOT_DIR_2_LEAF_4_TXT
         );
-        Assert.assertEquals(contents, expectedContents);
+        assertEquals(expectedContents, contents);
 
         // open file as multi-release for version 9
         env.put("multi-release", "9");
         contents = doTest(env);
         expectedContents = Set.of(
-            root_dir1_leaf1_txt,
-            root_dir1_leaf2_txt,
-            v9_root_dir2_leaf3_txt,
-            v9_root_dir2_leaf4_txt,
-            v9_root_dir3_leaf5_txt,
-            v9_root_dir3_leaf6_txt
+                ROOT_DIR_1_LEAF_1_TXT,
+                ROOT_DIR_1_LEAF_2_TXT,
+                V_9_ROOT_DIR_2_LEAF_3_TXT,
+                V_9_ROOT_DIR_2_LEAF_4_TXT,
+                V_9_ROOT_DIR_3_LEAF_5_TXT,
+                V_9_ROOT_DIR_3_LEAF_6_TXT
         );
-        Assert.assertEquals(contents, expectedContents);
+        assertEquals(expectedContents, contents);
 
         // open file as multi-release for version 10
         env.put("multi-release", "10");
         contents = doTest(env);
         expectedContents = Set.of(
-            root_dir1_leaf1_txt,
-            root_dir1_leaf2_txt,
-            v9_root_dir2_leaf3_txt,
-            v9_root_dir2_leaf4_txt,
-            v10_root_dir3_leaf5_txt,
-            v10_root_dir3_leaf6_txt
+                ROOT_DIR_1_LEAF_1_TXT,
+                ROOT_DIR_1_LEAF_2_TXT,
+                V_9_ROOT_DIR_2_LEAF_3_TXT,
+                V_9_ROOT_DIR_2_LEAF_4_TXT,
+                V_10_ROOT_DIR_3_LEAF_5_TXT,
+                V_10_ROOT_DIR_3_LEAF_6_TXT
         );
-        Assert.assertEquals(contents, expectedContents);
+        assertEquals(expectedContents, contents);
     }
 
     private Set<String> doTest(Map<String,String> env) throws IOException {
@@ -158,7 +161,7 @@ public class JFSTester {
             "!/root/dir2/leaf3.txt",
             "!/root/dir2/leaf4.txt"
         );
-        Assert.assertEquals(contents, expectedContents);
+        assertEquals(expectedContents, contents);
 
         // open file as multi-release for version 9
         env.put("multi-release", "9");
@@ -171,7 +174,7 @@ public class JFSTester {
             "!/META-INF/versions/9/root/dir3/leaf5.txt",
             "!/META-INF/versions/9/root/dir3/leaf6.txt"
         );
-        Assert.assertEquals(contents, expectedContents);
+        assertEquals(expectedContents, contents);
 
         // open file as multi-release for version 10
         env.put("multi-release", "10");
@@ -184,7 +187,7 @@ public class JFSTester {
             "!/META-INF/versions/10/root/dir3/leaf5.txt",
             "!/META-INF/versions/10/root/dir3/leaf6.txt"
         );
-        Assert.assertEquals(contents, expectedContents);
+        assertEquals(expectedContents, contents);
     }
 
     private Set<String> doTestUri(Map<String,String> env) throws IOException {
diff --git a/test/jdk/jdk/nio/zipfs/jarfs/MultiReleaseJarTest.java b/test/jdk/jdk/nio/zipfs/jarfs/MultiReleaseJarTest.java
index 1a336278089..ad0b47a75ee 100644
--- a/test/jdk/jdk/nio/zipfs/jarfs/MultiReleaseJarTest.java
+++ b/test/jdk/jdk/nio/zipfs/jarfs/MultiReleaseJarTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2015, 2020, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2015, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -32,7 +32,7 @@
  * @build CreateMultiReleaseTestJars
  *        jdk.test.lib.util.JarBuilder
  *        jdk.test.lib.compiler.Compiler
- * @run testng MultiReleaseJarTest
+ * @run junit MultiReleaseJarTest
  */
 
 import java.io.IOException;
@@ -46,11 +46,22 @@ import java.util.ArrayList;
 import java.util.HashMap;
 import java.util.Map;
 import java.util.concurrent.atomic.AtomicInteger;
+import java.util.stream.Stream;
 
-import org.testng.Assert;
-import org.testng.annotations.*;
 import jdk.test.lib.util.JarBuilder;
 
+import org.junit.jupiter.api.BeforeAll;
+import org.junit.jupiter.api.Test;
+import org.junit.jupiter.api.TestInstance;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.Arguments;
+import org.junit.jupiter.params.provider.MethodSource;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertThrows;
+import static org.junit.jupiter.api.Assertions.assertTrue;
+
+@TestInstance(TestInstance.Lifecycle.PER_CLASS)
 public class MultiReleaseJarTest {
     final private int MAJOR_VERSION = Runtime.version().feature();
     private static final String PROPERTY_RELEASE_VERSION = "releaseVersion";
@@ -69,7 +80,7 @@ public class MultiReleaseJarTest {
     private URI mruri;
     private URI smruri;
 
-    @BeforeClass
+    @BeforeAll
     public void initialize() throws Exception {
         creator.compileEntries();
         creator.buildUnversionedJar();
@@ -90,55 +101,51 @@ public class MultiReleaseJarTest {
         Files.delete(Paths.get(userdir, "short-multi-release.jar"));
     }
 
-    @DataProvider(name="strings")
-    public Object[][] createStrings() {
-        return new Object[][]{
-                {"runtime", MAJOR_VERSION, "8"},
-                {null, 8, Integer.toString(MAJOR_VERSION)},
-                {"8", 8, "9"},
-                {"9", 9, null},
-                {Integer.toString(MAJOR_VERSION), MAJOR_VERSION, "8"},
-                {Integer.toString(MAJOR_VERSION+1), MAJOR_VERSION, "8"},
-                {"50", MAJOR_VERSION, "9"}
-        };
+    public Stream<Arguments> createStrings() {
+        return Stream.of(
+                Arguments.of("runtime", MAJOR_VERSION, "8"),
+                Arguments.of(null, 8, Integer.toString(MAJOR_VERSION)),
+                Arguments.of("8", 8, "9"),
+                Arguments.of("9", 9, null),
+                Arguments.of(Integer.toString(MAJOR_VERSION), MAJOR_VERSION, "8"),
+                Arguments.of(Integer.toString(MAJOR_VERSION+1), MAJOR_VERSION, "8"),
+                Arguments.of("50", MAJOR_VERSION, "9")
+        );
     }
 
-    @DataProvider(name="integers")
-    public Object[][] createIntegers() {
-        return new Object[][] {
-                {null, 8, Integer.valueOf(9)},
-                {Integer.valueOf(8), 8, Integer.valueOf(9)},
-                {Integer.valueOf(9), 9, Integer.valueOf(MAJOR_VERSION)},
-                {Integer.valueOf(MAJOR_VERSION), MAJOR_VERSION, Integer.valueOf(8)},
-                {Integer.valueOf(MAJOR_VERSION + 1), MAJOR_VERSION, null},
-                {Integer.valueOf(100), MAJOR_VERSION, Integer.valueOf(8)}
-        };
+    public Stream<Arguments> createIntegers() {
+        return Stream.of(
+                Arguments.of(null, 8, Integer.valueOf(9)),
+                Arguments.of(Integer.valueOf(8), 8, Integer.valueOf(9)),
+                Arguments.of(Integer.valueOf(9), 9, Integer.valueOf(MAJOR_VERSION)),
+                Arguments.of(Integer.valueOf(MAJOR_VERSION), MAJOR_VERSION, Integer.valueOf(8)),
+                Arguments.of(Integer.valueOf(MAJOR_VERSION + 1), MAJOR_VERSION, null),
+                Arguments.of(Integer.valueOf(100), MAJOR_VERSION, Integer.valueOf(8))
+        );
     }
 
-    @DataProvider(name="versions")
-    public Object[][] createVersions() {
-        return new Object[][] {
-                {null, 8, Version.parse("14")},
-                {Version.parse("8"), 8, Version.parse("7")},
-                {Version.parse("9"), 9, null},
-                {Version.parse(Integer.toString(MAJOR_VERSION)), MAJOR_VERSION, Version.parse("8")},
-                {Version.parse(Integer.toString(MAJOR_VERSION) + 1), MAJOR_VERSION, Version.parse("9")},
-                {Version.parse("100"), MAJOR_VERSION, Version.parse("14")}
-        };
+    public Stream<Arguments> createVersions() {
+        return Stream.of(
+                Arguments.of(null, 8, Version.parse("14")),
+                Arguments.of(Version.parse("8"), 8, Version.parse("7")),
+                Arguments.of(Version.parse("9"), 9, null),
+                Arguments.of(Version.parse(Integer.toString(MAJOR_VERSION)), MAJOR_VERSION, Version.parse("8")),
+                Arguments.of(Version.parse(Integer.toString(MAJOR_VERSION) + 1), MAJOR_VERSION, Version.parse("9")),
+                Arguments.of(Version.parse("100"), MAJOR_VERSION, Version.parse("14"))
+        );
     }
 
-    @DataProvider(name="invalidVersions")
-    public Object[][] invalidVersions() {
-        return new Object[][] {
-                {Map.of(PROPERTY_RELEASE_VERSION, "")},
-                {Map.of(PROPERTY_RELEASE_VERSION, "invalid")},
-                {Map.of(PROPERTY_RELEASE_VERSION, "0")},
-                {Map.of(PROPERTY_RELEASE_VERSION, "-1")},
-                {Map.of(PROPERTY_RELEASE_VERSION, "11.0.1")},
-                {Map.of(PROPERTY_RELEASE_VERSION, new ArrayList<Long>())},
-                {Map.of(PROPERTY_RELEASE_VERSION, Integer.valueOf(0))},
-                {Map.of(PROPERTY_RELEASE_VERSION, Integer.valueOf(-1))}
-        };
+    public Stream<Arguments> invalidVersions() {
+        return Stream.of(
+                Arguments.of(Map.of(PROPERTY_RELEASE_VERSION, "")),
+                Arguments.of(Map.of(PROPERTY_RELEASE_VERSION, "invalid")),
+                Arguments.of(Map.of(PROPERTY_RELEASE_VERSION, "0")),
+                Arguments.of(Map.of(PROPERTY_RELEASE_VERSION, "-1")),
+                Arguments.of(Map.of(PROPERTY_RELEASE_VERSION, "11.0.1")),
+                Arguments.of(Map.of(PROPERTY_RELEASE_VERSION, new ArrayList<Long>())),
+                Arguments.of(Map.of(PROPERTY_RELEASE_VERSION, Integer.valueOf(0))),
+                Arguments.of(Map.of(PROPERTY_RELEASE_VERSION, Integer.valueOf(-1)))
+        );
     }
 
     // Not the best test but all I can do since ZipFileSystem
@@ -148,16 +155,16 @@ public class MultiReleaseJarTest {
         Map<String,String> env = new HashMap<>();
         // no configuration, treat multi-release jar as unversioned
         try (FileSystem fs = FileSystems.newFileSystem(mruri, env)) {
-            Assert.assertTrue(readAndCompare(fs, 8));
+            assertTrue(readAndCompare(fs, 8));
         }
         env.put(PROPERTY_RELEASE_VERSION, "runtime");
         // a configuration and jar file is multi-release
         try (FileSystem fs = FileSystems.newFileSystem(mruri, env)) {
-            Assert.assertTrue(readAndCompare(fs, MAJOR_VERSION));
+            assertTrue(readAndCompare(fs, MAJOR_VERSION));
         }
         // a configuration but jar file is unversioned
         try (FileSystem fs = FileSystems.newFileSystem(uvuri, env)) {
-            Assert.assertTrue(readAndCompare(fs, 8));
+            assertTrue(readAndCompare(fs, 8));
         }
     }
 
@@ -167,7 +174,8 @@ public class MultiReleaseJarTest {
         return src.contains("return " + expected);
     }
 
-    @Test(dataProvider="strings")
+    @ParameterizedTest
+    @MethodSource("createStrings")
     public void testStrings(String value, int expected, String ignorable) throws Throwable {
         stringEnv.clear();
         stringEnv.put(PROPERTY_RELEASE_VERSION, value);
@@ -176,7 +184,8 @@ public class MultiReleaseJarTest {
         runTest(stringEnv, expected);
     }
 
-    @Test(dataProvider="integers")
+    @ParameterizedTest
+    @MethodSource("createIntegers")
     public void testIntegers(Integer value, int expected, Integer ignorable) throws Throwable {
         integerEnv.clear();
         integerEnv.put(PROPERTY_RELEASE_VERSION, value);
@@ -185,7 +194,8 @@ public class MultiReleaseJarTest {
         runTest(integerEnv, expected);
     }
 
-    @Test(dataProvider="versions")
+    @ParameterizedTest
+    @MethodSource("createVersions")
     public void testVersions(Version value, int expected, Version ignorable) throws Throwable {
         versionEnv.clear();
         versionEnv.put(PROPERTY_RELEASE_VERSION, value);
@@ -210,30 +220,34 @@ public class MultiReleaseJarTest {
      * @throws Throwable  Exception thrown for anything other than the expected
      * IllegalArgumentException
      */
-    @Test(dataProvider="invalidVersions")
+    @ParameterizedTest
+    @MethodSource("invalidVersions")
     public void testInvalidVersions(Map<String,?> env) throws Throwable {
-        Assert.assertThrows(IllegalArgumentException.class, () ->
+        assertThrows(IllegalArgumentException.class, () ->
                 FileSystems.newFileSystem(Path.of(userdir,
                         "multi-release.jar"), env));
     }
 
     // The following tests are for backwards compatibility to validate that
     // the original property still works
-    @Test(dataProvider="strings")
+    @ParameterizedTest
+    @MethodSource("createStrings")
     public void testMRStrings(String value, int expected, String ignorable) throws Throwable {
         stringEnv.clear();
         stringEnv.put(PROPERTY_MULTI_RELEASE, value);
         runTest(stringEnv, expected);
     }
 
-    @Test(dataProvider="integers")
+    @ParameterizedTest
+    @MethodSource("createIntegers")
     public void testMRIntegers(Integer value, int expected, Integer ignorable) throws Throwable {
         integerEnv.clear();
         integerEnv.put(PROPERTY_MULTI_RELEASE, value);
         runTest(integerEnv, expected);
     }
 
-    @Test(dataProvider="versions")
+    @ParameterizedTest
+    @MethodSource("createVersions")
     public void testMRVersions(Version value, int expected, Version ignorable) throws Throwable {
         versionEnv.clear();
         versionEnv.put(PROPERTY_MULTI_RELEASE, value);
@@ -250,7 +264,7 @@ public class MultiReleaseJarTest {
             byte [] bytes = Files.readAllBytes(version);
             Class<?> vcls = (new ByteArrayClassLoader(fs)).defineClass(className, bytes);
             MethodHandle mh = MethodHandles.lookup().findVirtual(vcls, "getVersion", mt);
-            Assert.assertEquals((int)mh.invoke(vcls.getDeclaredConstructor().newInstance()), expected);
+            assertEquals(expected, (int)mh.invoke(vcls.getDeclaredConstructor().newInstance()));
         }
     }
 
@@ -281,7 +295,7 @@ public class MultiReleaseJarTest {
         jb.build();
         Map<String,String> env = Map.of(PROPERTY_RELEASE_VERSION, "runtime");
         try (FileSystem fs = FileSystems.newFileSystem(uri, env)) {
-            Assert.assertTrue(true);
+            assertTrue(true);
         }
         Files.delete(jfpath);
     }
@@ -300,9 +314,9 @@ public class MultiReleaseJarTest {
         URI customJar = new URI("jar", ssp , null);
         try (FileSystem fs = FileSystems.newFileSystem(customJar, env)) {
             if (expected) {
-                Assert.assertTrue(readAndCompare(fs, MAJOR_VERSION));
+                assertTrue(readAndCompare(fs, MAJOR_VERSION));
             } else {
-                Assert.assertTrue(readAndCompare(fs, 8));
+                assertTrue(readAndCompare(fs, 8));
             }
         }
         Files.delete(filePath);
diff --git a/test/jdk/jdk/nio/zipfs/testng/TEST.properties b/test/jdk/jdk/nio/zipfs/testng/TEST.properties
deleted file mode 100644
index f069323c2f9..00000000000
--- a/test/jdk/jdk/nio/zipfs/testng/TEST.properties
+++ /dev/null
@@ -1,4 +0,0 @@
-# Zip FS unit tests uses TestNG
-modules = jdk.zipfs
-TestNG.dirs = .
-
diff --git a/test/jdk/jdk/nio/zipfs/testng/util/ZipFsBaseTest.java b/test/jdk/jdk/nio/zipfs/util/ZipFsBaseTest.java
similarity index 80%
rename from test/jdk/jdk/nio/zipfs/testng/util/ZipFsBaseTest.java
rename to test/jdk/jdk/nio/zipfs/util/ZipFsBaseTest.java
index 6686ff0e920..1e6e1a385b1 100644
--- a/test/jdk/jdk/nio/zipfs/testng/util/ZipFsBaseTest.java
+++ b/test/jdk/jdk/nio/zipfs/util/ZipFsBaseTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2020, 2022, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,7 +23,7 @@
  */
 package util;
 
-import org.testng.annotations.DataProvider;
+import org.junit.jupiter.params.provider.Arguments;
 
 import java.io.File;
 import java.io.IOException;
@@ -34,7 +34,6 @@ import java.nio.file.FileSystems;
 import java.nio.file.Files;
 import java.nio.file.Path;
 import java.security.SecureRandom;
-import java.util.Arrays;
 import java.util.Comparator;
 import java.util.Map;
 import java.util.stream.Stream;
@@ -43,7 +42,9 @@ import java.util.zip.ZipFile;
 
 import static java.lang.String.format;
 import static java.util.stream.Collectors.joining;
-import static org.testng.Assert.*;
+import static org.junit.jupiter.api.Assertions.assertArrayEquals;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertNotNull;
 
 public class ZipFsBaseTest {
 
@@ -53,49 +54,46 @@ public class ZipFsBaseTest {
     private static final SecureRandom random = new SecureRandom();
 
     /**
-     * DataProvider used to specify the Zip FS properties to use when creating
+     * MethodSource used to specify the Zip FS properties to use when creating
      * the Zip File along with the compression method used
      *
      * @return Zip FS properties and compression method used by the tests
      */
-    @DataProvider(name = "zipfsMap")
-    protected Object[][] zipfsMap() {
-        return new Object[][]{
-                {Map.of("create", "true"), ZipEntry.DEFLATED},
-                {Map.of("create", "true", "noCompression", "true"),
-                        ZipEntry.STORED},
-                {Map.of("create", "true", "noCompression", "false"),
-                        ZipEntry.DEFLATED}
-        };
+    protected static Stream<Arguments> zipfsMap() {
+        return Stream.of(
+                Arguments.of(Map.of("create", "true"), ZipEntry.DEFLATED),
+                Arguments.of(Map.of("create", "true", "noCompression", "true"),
+                        ZipEntry.STORED),
+                Arguments.of(Map.of("create", "true", "noCompression", "false"),
+                        ZipEntry.DEFLATED)
+        );
     }
 
     /*
-     * DataProvider used to verify that an entry can be copied or moved within
+     * MethodSource used to verify that an entry can be copied or moved within
      * a Zip file system using a different compression from when the entry
      * was first created
      */
-    @DataProvider(name = "copyMoveMap")
-    protected Object[][] copyMoveMap() {
-        return new Object[][]{
-                {Map.of("create", "true"), ZipEntry.DEFLATED, ZipEntry.STORED},
-                {Map.of("create", "true", "noCompression", "true"),
-                        ZipEntry.STORED, ZipEntry.DEFLATED},
-                {Map.of("create", "true", "noCompression", "false"),
-                        ZipEntry.DEFLATED, ZipEntry.STORED}
-        };
+    protected static Stream<Arguments> copyMoveMap() {
+        return Stream.of(
+                Arguments.of(Map.of("create", "true"), ZipEntry.DEFLATED, ZipEntry.STORED),
+                Arguments.of(Map.of("create", "true", "noCompression", "true"),
+                        ZipEntry.STORED, ZipEntry.DEFLATED),
+                Arguments.of(Map.of("create", "true", "noCompression", "false"),
+                        ZipEntry.DEFLATED, ZipEntry.STORED)
+        );
     }
 
     /**
-     * DataProvider with the compression methods to be used for a given test run
+     * MethodSource with the compression methods to be used for a given test run
      *
      * @return Compression methods to test with
      */
-    @DataProvider(name = "compressionMethods")
-    protected Object[][] compressionMethods() {
-        return new Object[][]{
-                {ZipEntry.DEFLATED},
-                {ZipEntry.STORED}
-        };
+    protected static Stream<Arguments> compressionMethods() {
+        return Stream.of(
+                Arguments.of(ZipEntry.DEFLATED),
+                Arguments.of(ZipEntry.STORED)
+        );
     }
 
     /**
@@ -137,7 +135,7 @@ public class ZipFsBaseTest {
         // check entries with Zip API
         try (ZipFile zf = new ZipFile(zipfile.toFile())) {
             // check entry count
-            assertEquals(entries.length, zf.size());
+            assertEquals(zf.size(), entries.length);
 
             // Check compression method and content of each entry
             for (Entry e : entries) {
@@ -147,7 +145,7 @@ public class ZipFsBaseTest {
                     System.out.printf("Entry Name: %s, method: %s, Expected Method: %s%n",
                             e.name, ze.getMethod(), e.method);
                 }
-                assertEquals(e.method, ze.getMethod());
+                assertEquals(ze.getMethod(), e.method);
                 try (InputStream in = zf.getInputStream(ze)) {
                     byte[] bytes = in.readAllBytes();
                     if (DEBUG) {
@@ -155,7 +153,7 @@ public class ZipFsBaseTest {
                                 new String(bytes), new String(e.bytes));
                     }
 
-                    assertTrue(Arrays.equals(bytes, e.bytes));
+                    assertArrayEquals(bytes, e.bytes);
                 }
             }
         }
@@ -166,7 +164,7 @@ public class ZipFsBaseTest {
             Path top = fs.getPath("/");
             long count = Files.find(top, Integer.MAX_VALUE,
                     (path, attrs) -> attrs.isRegularFile()).count();
-            assertEquals(entries.length, count);
+            assertEquals(count, entries.length);
 
             // Check content of each entry
             for (Entry e : entries) {
@@ -175,7 +173,7 @@ public class ZipFsBaseTest {
                     System.out.printf("Entry name = %s, bytes= %s, actual=%s%n", e.name,
                             new String(Files.readAllBytes(file)), new String(e.bytes));
                 }
-                assertEquals(Files.readAllBytes(file), e.bytes);
+                assertArrayEquals(e.bytes, Files.readAllBytes(file));
             }
         }
     }
@@ -189,7 +187,7 @@ public class ZipFsBaseTest {
      * @param source  The path of the file to add to the Zip File
      * @throws IOException If an error occurs while creating/updating the Zip file
      */
-    protected void zip(Path zipFile, Map<String, String> env, Path source) throws IOException {
+    protected static void zip(Path zipFile, Map<String, String> env, Path source) throws IOException {
         if (DEBUG) {
             System.out.printf("File:%s, adding:%s%n", zipFile.toAbsolutePath(), source);
         }
@@ -208,7 +206,7 @@ public class ZipFsBaseTest {
      * @param entries The entries to add to the Zip File
      * @throws IOException If an error occurs while creating the Zip file
      */
-    protected void zip(Path zipFile, Map<String, ?> env,
+    protected static void zip(Path zipFile, Map<String, ?> env,
                     Entry... entries) throws IOException {
         if (DEBUG) {
             System.out.printf("Creating file: %s, env: %s%n", zipFile, formatMap(env));

From 9ea893d87749fd87a3d1947e6d71c5899c6380bb Mon Sep 17 00:00:00 2001
From: Naoto Sato <naoto@openjdk.org>
Date: Thu, 19 Mar 2026 16:56:26 +0000
Subject: [PATCH 265/655] 8380223: Refactor test/jdk/sun/util/resources TestNG
 tests to JUnit

Reviewed-by: bpb, jlu
---
 .../util/resources/TimeZone/Bug8139107.java   |  7 ++--
 .../TimeZone/ChineseTimeZoneNameTest.java     | 25 +++++++--------
 .../sun/util/resources/cldr/Bug8202764.java   | 21 ++++++------
 .../resources/cldr/TimeZoneNamesTest.java     | 32 +++++++++----------
 4 files changed, 42 insertions(+), 43 deletions(-)

diff --git a/test/jdk/sun/util/resources/TimeZone/Bug8139107.java b/test/jdk/sun/util/resources/TimeZone/Bug8139107.java
index e00d4c88889..575dd7c291e 100644
--- a/test/jdk/sun/util/resources/TimeZone/Bug8139107.java
+++ b/test/jdk/sun/util/resources/TimeZone/Bug8139107.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2015, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2015, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -27,12 +27,13 @@
  * @summary Test that date parsing with DateTimeFormatter pattern
  *   that contains timezone field doesn't trigger NPE. All supported
  *   locales are tested.
- * @run testng/timeout=480 Bug8139107
+ * @run junit/timeout=480 Bug8139107
  */
 import java.time.format.DateTimeFormatter;
 import java.time.format.DateTimeParseException;
 import java.util.Locale;
-import org.testng.annotations.Test;
+
+import org.junit.jupiter.api.Test;
 
 public class Bug8139107 {
 
diff --git a/test/jdk/sun/util/resources/TimeZone/ChineseTimeZoneNameTest.java b/test/jdk/sun/util/resources/TimeZone/ChineseTimeZoneNameTest.java
index 335d147f9ab..258edc38a59 100644
--- a/test/jdk/sun/util/resources/TimeZone/ChineseTimeZoneNameTest.java
+++ b/test/jdk/sun/util/resources/TimeZone/ChineseTimeZoneNameTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2021, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2021, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -26,7 +26,7 @@
  * @bug 8275721 8174269
  * @modules jdk.localedata
  * @summary Checks Chinese time zone names for `UTC` using CLDR are consistent
- * @run testng ChineseTimeZoneNameTest
+ * @run junit ChineseTimeZoneNameTest
  */
 
 import java.time.Instant;
@@ -35,11 +35,10 @@ import java.time.ZonedDateTime;
 import java.time.format.DateTimeFormatter;
 import java.util.Locale;
 
-import static org.testng.Assert.assertEquals;
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
+import static org.junit.jupiter.api.Assertions.assertEquals;
 
-@Test
 public class ChineseTimeZoneNameTest {
 
     private static final Locale SIMPLIFIED_CHINESE = Locale.forLanguageTag("zh-Hans");
@@ -47,8 +46,7 @@ public class ChineseTimeZoneNameTest {
     private static final ZonedDateTime EPOCH_UTC =
         ZonedDateTime.ofInstant(Instant.ofEpochSecond (0), ZoneId.of ("UTC"));
 
-    @DataProvider(name="locales")
-    Object[][] data() {
+    private static Object[][] data() {
         return new Object[][] {
             {Locale.CHINESE,                        SIMPLIFIED_CHINESE},
             {Locale.SIMPLIFIED_CHINESE,             SIMPLIFIED_CHINESE},
@@ -61,11 +59,12 @@ public class ChineseTimeZoneNameTest {
         };
     }
 
-    @Test(dataProvider="locales")
+    @ParameterizedTest
+    @MethodSource("data")
     public void test_ChineseTimeZoneNames(Locale testLoc, Locale resourceLoc) {
-        assertEquals(DateTimeFormatter.ofPattern("z", testLoc).format(EPOCH_UTC),
-                DateTimeFormatter.ofPattern("z", resourceLoc).format(EPOCH_UTC));
-        assertEquals(DateTimeFormatter.ofPattern("zzzz", testLoc).format(EPOCH_UTC),
-                DateTimeFormatter.ofPattern("zzzz", resourceLoc).format(EPOCH_UTC));
+        assertEquals(DateTimeFormatter.ofPattern("z", resourceLoc).format(EPOCH_UTC),
+            DateTimeFormatter.ofPattern("z", testLoc).format(EPOCH_UTC));
+        assertEquals(DateTimeFormatter.ofPattern("zzzz", resourceLoc).format(EPOCH_UTC),
+            DateTimeFormatter.ofPattern("zzzz", testLoc).format(EPOCH_UTC));
     }
 }
diff --git a/test/jdk/sun/util/resources/cldr/Bug8202764.java b/test/jdk/sun/util/resources/cldr/Bug8202764.java
index 6f3e40e6201..e7fa110671a 100644
--- a/test/jdk/sun/util/resources/cldr/Bug8202764.java
+++ b/test/jdk/sun/util/resources/cldr/Bug8202764.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -28,11 +28,9 @@
  * @summary Checks time zone names are consistent with aliased ids,
  *      between DateFormatSymbols.getZoneStrings() and getDisplayName()
  *      of TimeZone/ZoneId classes
- * @run testng/othervm Bug8202764
+ * @run junit/othervm Bug8202764
  */
 
-import static org.testng.Assert.assertEquals;
-
 import java.time.ZoneId;
 import java.time.format.TextStyle;
 import java.text.DateFormatSymbols;
@@ -41,7 +39,8 @@ import java.util.Locale;
 import java.util.Set;
 import java.util.TimeZone;
 
-import org.testng.annotations.Test;
+import org.junit.jupiter.api.Test;
+import static org.junit.jupiter.api.Assertions.assertEquals;
 
 public class Bug8202764 {
 
@@ -53,15 +52,15 @@ public class Bug8202764 {
             .forEach(zone -> {
                 System.out.println(zone[0]);
                 TimeZone tz = TimeZone.getTimeZone(zone[0]);
-                assertEquals(zone[1], tz.getDisplayName(false, TimeZone.LONG, Locale.US));
-                assertEquals(zone[2], tz.getDisplayName(false, TimeZone.SHORT, Locale.US));
-                assertEquals(zone[3], tz.getDisplayName(true, TimeZone.LONG, Locale.US));
-                assertEquals(zone[4], tz.getDisplayName(true, TimeZone.SHORT, Locale.US));
+                assertEquals(tz.getDisplayName(false, TimeZone.LONG, Locale.US), zone[1]);
+                assertEquals(tz.getDisplayName(false, TimeZone.SHORT, Locale.US), zone[2]);
+                assertEquals(tz.getDisplayName(true, TimeZone.LONG, Locale.US), zone[3]);
+                assertEquals(tz.getDisplayName(true, TimeZone.SHORT, Locale.US), zone[4]);
                 if (zoneIds.contains(zone[0])) {
                     // Some of the ids, e.g. three-letter ids are not supported in ZoneId
                     ZoneId zi = tz.toZoneId();
-                    assertEquals(zone[5], zi.getDisplayName(TextStyle.FULL, Locale.US));
-                    assertEquals(zone[6], zi.getDisplayName(TextStyle.SHORT, Locale.US));
+                    assertEquals(zi.getDisplayName(TextStyle.FULL, Locale.US), zone[5]);
+                    assertEquals(zi.getDisplayName(TextStyle.SHORT, Locale.US), zone[6]);
                 }
             });
     }
diff --git a/test/jdk/sun/util/resources/cldr/TimeZoneNamesTest.java b/test/jdk/sun/util/resources/cldr/TimeZoneNamesTest.java
index 05b0114f1b4..6d21cd5613a 100644
--- a/test/jdk/sun/util/resources/cldr/TimeZoneNamesTest.java
+++ b/test/jdk/sun/util/resources/cldr/TimeZoneNamesTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -28,7 +28,7 @@
  * @modules jdk.localedata
  * @summary Checks CLDR time zone names are generated correctly at
  * either build or runtime
- * @run testng TimeZoneNamesTest
+ * @run junit TimeZoneNamesTest
  */
 
 import java.text.DateFormatSymbols;
@@ -39,16 +39,15 @@ import java.util.Locale;
 import java.util.Objects;
 import java.util.TimeZone;
 
-import static org.testng.Assert.assertEquals;
-import static org.testng.Assert.assertFalse;
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
+import org.junit.jupiter.api.Test;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertFalse;
 
-@Test
 public class TimeZoneNamesTest {
 
-    @DataProvider
-    Object[][] sampleTZs() {
+    private static Object[][] sampleTZs() {
         return new Object[][] {
             // tzid, locale, style, expected
 
@@ -219,19 +218,20 @@ public class TimeZoneNamesTest {
     }
 
 
-    @Test(dataProvider="sampleTZs")
+    @ParameterizedTest
+    @MethodSource("sampleTZs")
     public void test_tzNames(String tzid, Locale locale, String lstd, String sstd, String ldst, String sdst, String lgen, String sgen) {
         // Standard time
-        assertEquals(TimeZone.getTimeZone(tzid).getDisplayName(false, TimeZone.LONG, locale), lstd);
-        assertEquals(TimeZone.getTimeZone(tzid).getDisplayName(false, TimeZone.SHORT, locale), sstd);
+        assertEquals(lstd, TimeZone.getTimeZone(tzid).getDisplayName(false, TimeZone.LONG, locale));
+        assertEquals(sstd, TimeZone.getTimeZone(tzid).getDisplayName(false, TimeZone.SHORT, locale));
 
         // daylight saving time
-        assertEquals(TimeZone.getTimeZone(tzid).getDisplayName(true, TimeZone.LONG, locale), ldst);
-        assertEquals(TimeZone.getTimeZone(tzid).getDisplayName(true, TimeZone.SHORT, locale), sdst);
+        assertEquals(ldst, TimeZone.getTimeZone(tzid).getDisplayName(true, TimeZone.LONG, locale));
+        assertEquals(sdst, TimeZone.getTimeZone(tzid).getDisplayName(true, TimeZone.SHORT, locale));
 
         // generic name
-        assertEquals(ZoneId.of(tzid).getDisplayName(TextStyle.FULL, locale), lgen);
-        assertEquals(ZoneId.of(tzid).getDisplayName(TextStyle.SHORT, locale), sgen);
+        assertEquals(lgen, ZoneId.of(tzid).getDisplayName(TextStyle.FULL, locale));
+        assertEquals(sgen, ZoneId.of(tzid).getDisplayName(TextStyle.SHORT, locale));
     }
 
     // Make sure getZoneStrings() returns non-empty string array

From 13b954b996262c6d686b5e7818781324d54c1e4c Mon Sep 17 00:00:00 2001
From: Kelvin Nilsen <kdnilsen@openjdk.org>
Date: Thu, 19 Mar 2026 17:58:43 +0000
Subject: [PATCH 266/655] 8380407: GenShen: Problem with
 com/sun/jdi/ThreadMemoryLeakTest

Reviewed-by: shade
---
 .../shenandoah/heuristics/shenandoahYoungHeuristics.cpp   | 4 +---
 src/hotspot/share/gc/shenandoah/shenandoahGeneration.cpp  | 4 ++--
 .../share/gc/shenandoah/shenandoahGenerationalHeap.cpp    | 8 ++++++--
 3 files changed, 9 insertions(+), 7 deletions(-)

diff --git a/src/hotspot/share/gc/shenandoah/heuristics/shenandoahYoungHeuristics.cpp b/src/hotspot/share/gc/shenandoah/heuristics/shenandoahYoungHeuristics.cpp
index 3779f969723..68935aba5a8 100644
--- a/src/hotspot/share/gc/shenandoah/heuristics/shenandoahYoungHeuristics.cpp
+++ b/src/hotspot/share/gc/shenandoah/heuristics/shenandoahYoungHeuristics.cpp
@@ -174,10 +174,8 @@ size_t ShenandoahYoungHeuristics::bytes_of_allocation_runway_before_gc_trigger(s
   size_t usage = _space_info->used();
   size_t available = (capacity > usage)? capacity - usage: 0;
   size_t allocated = _free_set->get_bytes_allocated_since_gc_start();
+  size_t anticipated_available = available + young_regions_to_be_reclaimed * ShenandoahHeapRegion::region_size_bytes();
 
-  size_t available_young_collected = ShenandoahHeap::heap()->collection_set()->get_young_available_bytes_collected();
-  size_t anticipated_available =
-          available + young_regions_to_be_reclaimed * ShenandoahHeapRegion::region_size_bytes() - available_young_collected;
   size_t spike_headroom = capacity * ShenandoahAllocSpikeFactor / 100;
   size_t penalties      = capacity * _gc_time_penalties / 100;
 
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahGeneration.cpp b/src/hotspot/share/gc/shenandoah/shenandoahGeneration.cpp
index b2d5e5423dd..750389ae6c3 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahGeneration.cpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahGeneration.cpp
@@ -315,8 +315,8 @@ void ShenandoahGeneration::prepare_regions_and_collection_set(bool concurrent) {
     _free_set->prepare_to_rebuild(young_trashed_regions, old_trashed_regions, first_old, last_old, num_old);
     if (heap->mode()->is_generational()) {
       ShenandoahGenerationalHeap* gen_heap = ShenandoahGenerationalHeap::heap();
-    size_t allocation_runway =
-      gen_heap->young_generation()->heuristics()->bytes_of_allocation_runway_before_gc_trigger(young_trashed_regions);
+      size_t allocation_runway =
+        gen_heap->young_generation()->heuristics()->bytes_of_allocation_runway_before_gc_trigger(young_trashed_regions);
       gen_heap->compute_old_generation_balance(allocation_runway, old_trashed_regions, young_trashed_regions);
     }
     _free_set->finish_rebuild(young_trashed_regions, old_trashed_regions, num_old);
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahGenerationalHeap.cpp b/src/hotspot/share/gc/shenandoah/shenandoahGenerationalHeap.cpp
index b302bde8510..c731221adeb 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahGenerationalHeap.cpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahGenerationalHeap.cpp
@@ -638,9 +638,13 @@ void ShenandoahGenerationalHeap::compute_old_generation_balance(size_t mutator_x
                              bound_on_old_reserve:
                              MIN2((young_reserve * ShenandoahOldEvacPercent) / (100 - ShenandoahOldEvacPercent),
                                   bound_on_old_reserve));
-  if (young_reserve > young_available) {
-    young_reserve = young_available;
+  assert(mutator_xfer_limit <= young_available,
+         "Cannot transfer (%zu) memory that is not available (%zu)", mutator_xfer_limit, young_available);
+  // Young reserves are to be taken out of the mutator_xfer_limit.
+  if (young_reserve > mutator_xfer_limit) {
+    young_reserve = mutator_xfer_limit;
   }
+  mutator_xfer_limit -= young_reserve;
 
   // Decide how much old space we should reserve for a mixed collection
   size_t proposed_reserve_for_mixed = 0;

From cdd64dbb5da3c6f2e316397cee71838984b323bf Mon Sep 17 00:00:00 2001
From: Hai-May Chao <hchao@openjdk.org>
Date: Thu, 19 Mar 2026 19:12:27 +0000
Subject: [PATCH 267/655] 8379433: Throwing proper exception for invalid
 encapsulation length in Hybrid

Reviewed-by: weijun
---
 .../classes/sun/security/ssl/Hybrid.java      |  4 +-
 .../ssl/HybridKeyExchange/TestHybrid.java     | 67 +++++++++++++++++++
 2 files changed, 69 insertions(+), 2 deletions(-)
 create mode 100644 test/jdk/sun/security/ssl/HybridKeyExchange/TestHybrid.java

diff --git a/src/java.base/share/classes/sun/security/ssl/Hybrid.java b/src/java.base/share/classes/sun/security/ssl/Hybrid.java
index e3e2cfa0b23..43634ce2f34 100644
--- a/src/java.base/share/classes/sun/security/ssl/Hybrid.java
+++ b/src/java.base/share/classes/sun/security/ssl/Hybrid.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2025, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -355,7 +355,7 @@ public class Hybrid {
                 int to, String algorithm) throws DecapsulateException {
             int expectedEncSize = engineEncapsulationSize();
             if (encapsulation.length != expectedEncSize) {
-                throw new IllegalArgumentException(
+                throw new DecapsulateException(
                         "Invalid key encapsulation message length: " +
                         encapsulation.length +
                         ", expected = " + expectedEncSize);
diff --git a/test/jdk/sun/security/ssl/HybridKeyExchange/TestHybrid.java b/test/jdk/sun/security/ssl/HybridKeyExchange/TestHybrid.java
new file mode 100644
index 00000000000..82314c31dcf
--- /dev/null
+++ b/test/jdk/sun/security/ssl/HybridKeyExchange/TestHybrid.java
@@ -0,0 +1,67 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+/*
+ * @test
+ * @bug 8379433
+ * @summary Test expected DecapsulateException thrown by Hybrid KEM implementation
+ * @modules java.base/sun.security.ssl
+ * @run main/othervm TestHybrid
+*/
+import java.security.KeyPair;
+import java.security.KeyPairGenerator;
+import java.security.Provider;
+import java.util.Arrays;
+import javax.crypto.DecapsulateException;
+import javax.crypto.KEM;
+
+public class TestHybrid {
+
+    public static void main(String[] args) throws Exception {
+
+        Class<?> clazz = Class.forName("sun.security.ssl.HybridProvider");
+        Provider p = (Provider) clazz.getField("PROVIDER").get(null);
+
+        String alg = "X25519MLKEM768";
+        KeyPairGenerator kpg = KeyPairGenerator.getInstance(alg, p);
+        KeyPair kp = kpg.generateKeyPair();
+
+        KEM kem = KEM.getInstance(alg, p);
+        KEM.Encapsulator e = kem.newEncapsulator(kp.getPublic());
+        KEM.Decapsulator d = kem.newDecapsulator(kp.getPrivate());
+
+        int secretSize = e.secretSize();
+        KEM.Encapsulated enc = e.encapsulate();
+        byte[] ciphertext = enc.encapsulation();
+
+        byte[] badCiphertext = Arrays.copyOf(ciphertext,
+                ciphertext.length - 1);
+        try {
+            d.decapsulate(badCiphertext, 0, secretSize, "Generic");
+            throw new RuntimeException(
+                    "Expected DecapsulateException not thrown");
+        } catch (DecapsulateException expected) {
+            System.out.println("Expected DecapsulateException thrown");
+        }
+    }
+}

From 80fb1f72456dd2ea272cfe24475a561b6fb9a1a1 Mon Sep 17 00:00:00 2001
From: Brian Burkhalter <bpb@openjdk.org>
Date: Thu, 19 Mar 2026 19:44:38 +0000
Subject: [PATCH 268/655] 8379824: Refactor java/io tests to use JUnit

Reviewed-by: jlu, alanb
---
 .../io/BufferedInputStream/TransferTo.java    |  18 +-
 test/jdk/java/io/BufferedReader/Lines.java    | 150 ++++++------
 .../ByteArrayOutputStream/EncodingTest.java   |  33 +--
 .../java/io/ByteArrayOutputStream/Write.java  |  76 +++----
 .../io/CharArrayReader/ReadCharBuffer.java    |  41 ++--
 .../java/io/DataOutputStream/WriteUTF.java    |  18 +-
 test/jdk/java/io/File/LastModifiedTest.java   |  12 +-
 .../java/io/FileReader/ConstructorTest.java   |  33 +--
 .../java/io/FileWriter/ConstructorTest.java   |  43 ++--
 .../java/io/InputStream/NullInputStream.java  | 214 ++++++------------
 .../io/InputStreamReader/ReadCharBuffer.java  |  28 +--
 .../StatefulDecoderNearEOF.java               |  27 +--
 .../io/LineNumberReader/MarkSplitCRLF.java    |  14 +-
 .../ObjectStreamClassCaching.java             |  19 +-
 .../TestOSCClassLoaderLeak.java               |  12 +-
 .../io/OutputStream/NullOutputStream.java     |  69 ++----
 .../jdk/java/io/PrintStream/EncodingTest.java |  35 +--
 .../io/PrintStream/InheritEncodingTest.java   |  50 ++--
 .../jdk/java/io/PrintWriter/EncodingTest.java |  33 +--
 .../io/PushbackInputStream/TransferTo.java    |  16 +-
 test/jdk/java/io/Reader/NullReader.java       |  79 ++++---
 test/jdk/java/io/Reader/Of.java               | 107 +++++----
 test/jdk/java/io/Reader/ReadCharBuffer.java   |  59 +++--
 .../io/Reader/ReadIntoZeroLengthArray.java    |  58 ++---
 test/jdk/java/io/Reader/Skip.java             |  68 +++---
 .../io/SequenceInputStream/TransferTo.java    |  22 +-
 test/jdk/java/io/Writer/NullWriter.java       | 104 ++++-----
 27 files changed, 693 insertions(+), 745 deletions(-)

diff --git a/test/jdk/java/io/BufferedInputStream/TransferTo.java b/test/jdk/java/io/BufferedInputStream/TransferTo.java
index a0d7b0ee9bd..fe42c0a8b2e 100644
--- a/test/jdk/java/io/BufferedInputStream/TransferTo.java
+++ b/test/jdk/java/io/BufferedInputStream/TransferTo.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2022, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2022, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -46,22 +46,22 @@ import java.util.concurrent.atomic.AtomicReference;
 import java.util.function.Consumer;
 import java.util.function.Supplier;
 
-import org.testng.annotations.Test;
-
 import jdk.test.lib.RandomFactory;
 
 import static java.lang.String.format;
 import static java.nio.file.StandardOpenOption.*;
 
-import static org.testng.Assert.assertEquals;
-import static org.testng.Assert.assertThrows;
-import static org.testng.Assert.assertTrue;
+import org.junit.jupiter.api.Test;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertThrows;
+import static org.junit.jupiter.api.Assertions.assertTrue;
 
 /*
  * @test
  * @library /test/lib
  * @build jdk.test.lib.RandomFactory
- * @run testng/othervm/timeout=180 -Xmx1280m TransferTo
+ * @run junit/othervm/timeout=180 -Xmx1280m TransferTo
  * @bug 8279283 8294541
  * @summary Tests whether java.io.BufferedInputStream.transferTo conforms to the
  *          InputStream.transferTo specification
@@ -183,7 +183,7 @@ public class TransferTo {
             int count = inBytes.length - posIn;
             int expected = count - bufferBytes;
 
-            assertEquals(reported, expected,
+            assertEquals(expected, reported,
                     format("transferred %d bytes but should report %d", reported, expected));
 
             byte[] outBytes = recorder.get().get();
@@ -198,7 +198,7 @@ public class TransferTo {
                 reported = in.transferTo(out);
                 expected = count - bufferBytes;
 
-                assertEquals(reported, expected,
+                assertEquals(expected, reported,
                         format("replayed %d bytes but should report %d", reported, expected));
 
                 outBytes = recorder.get().get();
diff --git a/test/jdk/java/io/BufferedReader/Lines.java b/test/jdk/java/io/BufferedReader/Lines.java
index 2e35f75887d..3b4edb80e70 100644
--- a/test/jdk/java/io/BufferedReader/Lines.java
+++ b/test/jdk/java/io/BufferedReader/Lines.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2012, 2013, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2012, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -24,7 +24,7 @@
 /*
  * @test
  * @bug 8003258 8029434
- * @run testng Lines
+ * @run junit Lines
  */
 
 import java.io.BufferedReader;
@@ -41,10 +41,15 @@ import java.util.NoSuchElementException;
 import java.util.Spliterator;
 import java.util.stream.Stream;
 import java.util.concurrent.atomic.AtomicInteger;
-import org.testng.annotations.Test;
-import static org.testng.Assert.*;
 
-@Test(groups = "unit")
+import org.junit.jupiter.api.Test;
+
+import static org.junit.jupiter.api.Assertions.assertDoesNotThrow;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertFalse;
+import static org.junit.jupiter.api.Assertions.assertThrows;
+import static org.junit.jupiter.api.Assertions.assertTrue;
+
 public class Lines {
     private static final Map<String, Integer> cases = new HashMap<>();
 
@@ -155,75 +160,81 @@ public class Lines {
     private static void verify(Map.Entry<String, Integer> e) {
         final String data = e.getKey();
         final int total_lines = e.getValue();
-        try (BufferedReader br = new BufferedReader(
-                                    new StringReader(data))) {
-            assertEquals(br.lines()
-                           .mapToInt(l -> 1).reduce(0, (x, y) -> x + y),
-                         total_lines,
-                         data + " should produce " + total_lines + " lines.");
-        } catch (IOException ioe) {
-            fail("Should not have any exception.");
-        }
+        assertDoesNotThrow
+            (() -> {
+                try (BufferedReader br =
+                     new BufferedReader(new StringReader(data))) {
+                    assertEquals(total_lines,
+                                 br.lines().mapToInt(l -> 1).reduce(0, (x, y) -> x + y),
+                                 data + " should produce " + total_lines + " lines.");
+                }
+            });
     }
 
+    @Test
     public void testLinesBasic() {
         // Basic test cases
         cases.entrySet().stream().forEach(Lines::verify);
         // Similar test, also verify MockLineReader is correct
-        for (int i = 0; i < 10; i++) {
-            try (BufferedReader br = new BufferedReader(new MockLineReader(i))) {
-                assertEquals(br.lines()
-                               .peek(l -> assertTrue(l.matches("^Line \\d+$")))
-                               .mapToInt(l -> 1).reduce(0, (x, y) -> x + y),
-                             i,
-                             "MockLineReader(" + i + ") should produce " + i + " lines.");
-            } catch (IOException ioe) {
-                fail("Unexpected IOException.");
-            }
-        }
+        assertDoesNotThrow
+            (() -> {
+                for (int i = 0; i < 10; i++) {
+                    try (BufferedReader br =
+                         new BufferedReader(new MockLineReader(i))) {
+                        assertEquals(i,
+                                     br.lines()
+                                     .peek(l -> assertTrue(l.matches("^Line \\d+$")))
+                                     .mapToInt(l -> 1).reduce(0, (x, y) -> x + y),
+                                     "MockLineReader(" + i + ") should produce " + i + " lines.");
+                    }
+                }
+            });
     }
 
+    @Test
     public void testUncheckedIOException() throws IOException {
         MockLineReader r = new MockLineReader(10, 3);
         ArrayList<String> ar = new ArrayList<>();
-        try (BufferedReader br = new BufferedReader(r)) {
-            br.lines().limit(3L).forEach(ar::add);
-            assertEquals(ar.size(), 3, "Should be able to read 3 lines.");
-        } catch (UncheckedIOException uioe) {
-            fail("Unexpected UncheckedIOException");
-        }
+        assertDoesNotThrow
+            (() -> {
+                try (BufferedReader br = new BufferedReader(r)) {
+                    br.lines().limit(3L).forEach(ar::add);
+                    assertEquals(3, ar.size(), "Should be able to read 3 lines.");
+                }
+            });
         r.reset();
-        try (BufferedReader br = new BufferedReader(r)) {
-            br.lines().forEach(ar::add);
-            fail("Should had thrown UncheckedIOException.");
-        } catch (UncheckedIOException uioe) {
-            assertEquals(r.getLineNumber(), 4, "should fail to read 4th line");
-            assertEquals(ar.size(), 6, "3 + 3 lines read");
-        }
+        assertThrows(UncheckedIOException.class,
+                     () -> {
+                         try (BufferedReader br = new BufferedReader(r)) {
+                             br.lines().forEach(ar::add);
+                         }
+                     });
+        assertEquals(4, r.getLineNumber(), "should fail to read 4th line");
+        assertEquals(6, ar.size(), "3 + 3 lines read");
         for (int i = 0; i < ar.size(); i++) {
-            assertEquals(ar.get(i), "Line " + (i % 3 + 1));
+            assertEquals("Line " + (i % 3 + 1), ar.get(i));
         }
     }
 
+    @Test
     public void testIterator() throws IOException {
         MockLineReader r = new MockLineReader(6);
         BufferedReader br = new BufferedReader(r);
         String line = br.readLine();
-        assertEquals(r.getLineNumber(), 1, "Read one line");
+        assertEquals(1, r.getLineNumber(), "Read one line");
         Stream<String> s = br.lines();
         Iterator<String> it = s.iterator();
         // Ensure iterate with only next works
         for (int i = 0; i < 5; i++) {
             String str = it.next();
-            assertEquals(str, "Line " + (i + 2), "Addtional five lines");
+            assertEquals("Line " + (i + 2), str, "Addtional five lines");
         }
         // NoSuchElementException
-        try {
-            it.next();
-            fail("Should have run out of lines.");
-        } catch (NoSuchElementException nsse) {}
+        assertThrows(NoSuchElementException.class, () -> it.next(),
+                     "Should have run out of lines.");
     }
 
+    @Test
     public void testPartialReadAndLineNo() throws IOException {
         MockLineReader r = new MockLineReader(5);
         LineNumberReader lr = new LineNumberReader(r);
@@ -231,23 +242,24 @@ public class Lines {
         lr.read(buf, 0, 5);
         assertEquals(0, lr.getLineNumber(), "LineNumberReader start with line 0");
         assertEquals(1, r.getLineNumber(), "MockLineReader start with line 1");
-        assertEquals(new String(buf), "Line ");
+        assertEquals("Line ", new String(buf));
         String l1 = lr.readLine();
-        assertEquals(l1, "1", "Remaining of the first line");
+        assertEquals("1", l1, "Remaining of the first line");
         assertEquals(1, lr.getLineNumber(), "Line 1 is read");
         assertEquals(1, r.getLineNumber(), "MockLineReader not yet go next line");
         lr.read(buf, 0, 4);
         assertEquals(1, lr.getLineNumber(), "In the middle of line 2");
-        assertEquals(new String(buf, 0, 4), "Line");
+        assertEquals("Line", new String(buf, 0, 4));
         ArrayList<String> ar = lr.lines()
              .peek(l -> assertEquals(lr.getLineNumber(), r.getLineNumber()))
              .collect(ArrayList::new, ArrayList::add, ArrayList::addAll);
-        assertEquals(ar.get(0), " 2", "Remaining in the second line");
+        assertEquals(" 2", ar.get(0), "Remaining in the second line");
         for (int i = 1; i < ar.size(); i++) {
-            assertEquals(ar.get(i), "Line " + (i + 2), "Rest are full lines");
+            assertEquals("Line " + (i + 2), ar.get(i), "Rest are full lines");
         }
     }
 
+    @Test
     public void testInterlacedRead() throws IOException {
         MockLineReader r = new MockLineReader(10);
         BufferedReader br = new BufferedReader(r);
@@ -256,26 +268,24 @@ public class Lines {
         Iterator<String> it = s.iterator();
 
         br.read(buf);
-        assertEquals(new String(buf), "Line ");
-        assertEquals(it.next(), "1");
-        try {
-            s.iterator().next();
-            fail("Should failed on second attempt to get iterator from s");
-        } catch (IllegalStateException ise) {}
+        assertEquals("Line ", new String(buf));
+        assertEquals("1", it.next());
+        assertThrows(IllegalStateException.class, () -> s.iterator().next(),
+                     "Should fail on second call to Iterator next method");
         br.read(buf, 0, 2);
-        assertEquals(new String(buf, 0, 2), "Li");
+        assertEquals("Li", new String(buf, 0, 2));
         // Get stream again should continue from where left
         // Only read remaining of the line
         br.lines().limit(1L).forEach(line -> assertEquals(line, "ne 2"));
         br.read(buf, 0, 2);
-        assertEquals(new String(buf, 0, 2), "Li");
+        assertEquals("Li", new String(buf, 0, 2));
         br.read(buf, 0, 2);
-        assertEquals(new String(buf, 0, 2), "ne");
-        assertEquals(it.next(), " 3");
+        assertEquals("ne", new String(buf, 0, 2));
+        assertEquals(" 3", it.next());
         // Line 4
         br.readLine();
         // interator pick
-        assertEquals(it.next(), "Line 5");
+        assertEquals("Line 5", it.next());
         // Another stream instantiated by lines()
         AtomicInteger line_no = new AtomicInteger(6);
         br.lines().forEach(l -> assertEquals(l, "Line " + line_no.getAndIncrement()));
@@ -283,14 +293,16 @@ public class Lines {
         assertFalse(it.hasNext());
     }
 
+    @Test
     public void testCharacteristics() {
-        try (BufferedReader br = new BufferedReader(
-                                    new StringReader(""))) {
-            Spliterator<String> instance = br.lines().spliterator();
-            assertTrue(instance.hasCharacteristics(Spliterator.NONNULL));
-            assertTrue(instance.hasCharacteristics(Spliterator.ORDERED));
-        } catch (IOException ioe) {
-            fail("Should not have any exception.");
-        }
+        assertDoesNotThrow
+            (() -> {
+                try (BufferedReader br =
+                     new BufferedReader(new StringReader(""))) {
+                    Spliterator<String> instance = br.lines().spliterator();
+                    assertTrue(instance.hasCharacteristics(Spliterator.NONNULL));
+                    assertTrue(instance.hasCharacteristics(Spliterator.ORDERED));
+                }
+            });
     }
 }
diff --git a/test/jdk/java/io/ByteArrayOutputStream/EncodingTest.java b/test/jdk/java/io/ByteArrayOutputStream/EncodingTest.java
index 1a9d8d4c20b..40bef97294a 100644
--- a/test/jdk/java/io/ByteArrayOutputStream/EncodingTest.java
+++ b/test/jdk/java/io/ByteArrayOutputStream/EncodingTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2017, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2017, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,29 +25,31 @@ import java.io.ByteArrayOutputStream;
 import java.io.IOException;
 import java.nio.charset.Charset;
 import java.nio.charset.StandardCharsets;
-import org.testng.Assert;
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
+import java.util.stream.Stream;
+
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.Arguments;
+import org.junit.jupiter.params.provider.MethodSource;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
 
 /**
  * @test
  * @bug 8183743
  * @summary Test to verify the new overload method with Charset functions the same
  * as the existing method that takes a charset name.
- * @run testng EncodingTest
+ * @run junit EncodingTest
  */
 public class EncodingTest {
     /*
-     * DataProvider for the toString method test. Provides the following fields:
+     * MethodSource for the toString method test. Provides the following fields:
      * byte array, charset name string, charset object
      */
-    @DataProvider(name = "parameters")
-    public Object[][] getParameters() throws IOException {
+    public static Stream<Arguments> parameters() throws IOException {
         byte[] data = getData();
-        return new Object[][]{
-            {data, StandardCharsets.UTF_8.name(), StandardCharsets.UTF_8},
-            {data, StandardCharsets.ISO_8859_1.name(), StandardCharsets.ISO_8859_1},
-        };
+        return Stream.of
+            (Arguments.of(data, StandardCharsets.UTF_8.name(), StandardCharsets.UTF_8),
+             Arguments.of(data, StandardCharsets.ISO_8859_1.name(), StandardCharsets.ISO_8859_1));
     }
 
     /**
@@ -58,20 +60,21 @@ public class EncodingTest {
      * @param charset the charset
      * @throws Exception if the test fails
      */
-    @Test(dataProvider = "parameters")
+    @ParameterizedTest
+    @MethodSource("parameters")
     public void test(byte[] data, String csn, Charset charset) throws Exception {
         ByteArrayOutputStream baos = new ByteArrayOutputStream();
         baos.write(data);
         String str1 = baos.toString(csn);
         String str2 = baos.toString(charset);
-        Assert.assertEquals(str1, str2);
+        assertEquals(str2, str1);
     }
 
     /*
      * Returns an array containing a character that's invalid for UTF-8
      * but valid for ISO-8859-1
      */
-    byte[] getData() throws IOException {
+    static byte[] getData() throws IOException {
         String str1 = "A string that contains ";
         String str2 = " , an invalid character for UTF-8.";
 
diff --git a/test/jdk/java/io/ByteArrayOutputStream/Write.java b/test/jdk/java/io/ByteArrayOutputStream/Write.java
index 72c399916e0..99d8a206635 100644
--- a/test/jdk/java/io/ByteArrayOutputStream/Write.java
+++ b/test/jdk/java/io/ByteArrayOutputStream/Write.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1997, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -26,7 +26,7 @@
  * @bug 4017158 8180410
  * @library /test/lib
  * @build jdk.test.lib.RandomFactory
- * @run testng Write
+ * @run junit Write
  * @summary Check for correct implementation of ByteArrayInputStream.write
  * @key randomness
  */
@@ -35,49 +35,40 @@ import java.io.ByteArrayOutputStream;
 import java.util.Arrays;
 import java.util.Random;
 import jdk.test.lib.RandomFactory;
-import org.testng.annotations.Test;
-import static org.testng.Assert.*;
+
+import org.junit.jupiter.api.Test;
+
+import static org.junit.jupiter.api.Assertions.assertArrayEquals;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertThrows;
 
 public class Write {
     private static void doBoundsTest(byte[] b, int off, int len,
                                      ByteArrayOutputStream baos)
         throws Exception {
         if (b != null) {
-            System.out.println("ByteArrayOutStream.write: b.length = " +
+            System.err.println("ByteArrayOutStream.write: b.length = " +
                                b.length + " off = " + off + " len = " + len);
         } else{
-            System.out.println("ByteArrayOutStream.write: b is null off = " +
+            System.err.println("ByteArrayOutStream.write: b is null off = " +
                                off + " len = " + len);
         }
 
-        try {
-            baos.write(b, off, len);
-        } catch (IndexOutOfBoundsException e) {
-            System.out.println("IndexOutOfBoundsException is thrown: OKAY");
-        } catch (NullPointerException e) {
-            System.out.println("NullPointerException is thrown: OKAY");
-        } catch (Throwable e){
-            throw new RuntimeException("Unexpected Exception is thrown", e);
-        }
+        Class expectedException = (b == null)
+            ? NullPointerException.class : IndexOutOfBoundsException.class;
+        assertThrows(expectedException, () -> baos.write(b, off, len));
 
         if (b != null) {
-            System.out.println("ByteArrayOutStream.writeBytes: b.length = " +
+            System.err.println("ByteArrayOutStream.writeBytes: b.length = " +
                                b.length);
         } else{
-            System.out.println("ByteArrayOutStream.writeBytes: b is null");
-        }
-
-        try {
-            baos.writeBytes(b);
-        } catch (NullPointerException e) {
-            System.out.println("NullPointerException is thrown: OKAY");
-        } catch (Throwable e){
-            throw new RuntimeException("Unexpected Exception is thrown", e);
+            System.err.println("ByteArrayOutStream.writeBytes: b is null");
+            assertThrows(NullPointerException.class, () -> baos.writeBytes(b));
         }
     }
 
     @Test
-    public static void boundsTest() throws Exception {
+    public void boundsTest() throws Exception {
         byte array1[] = {1 , 2 , 3 , 4 , 5};     // Simple array
 
         //Create new ByteArrayOutputStream object
@@ -91,7 +82,7 @@ public class Write {
     }
 
     @Test
-    public static void writeTest() throws Exception {
+    public void writeTest() throws Exception {
         ByteArrayOutputStream baos = new ByteArrayOutputStream();
         Random rnd = RandomFactory.getRandom();
         final int size = 17 + rnd.nextInt(128);
@@ -104,39 +95,36 @@ public class Write {
         int off2 = rnd.nextInt(size / 2) + 1;
         int len2 = Math.min(rnd.nextInt(size / 2) + 1, size - off2);
 
-        System.out.format("size: %d, off1: %d, len1: %d, off2: %d, len2: %d%n",
+        System.err.format("size: %d, off1: %d, len1: %d, off2: %d, len2: %d%n",
             size, off1, len1, off2, len2);
 
         baos.write(b, off1, len1);
         byte[] b1 = baos.toByteArray();
-        assertEquals(b1.length, len1, "Array length test 1 failed.");
-        assertEquals(b1, Arrays.copyOfRange(b, off1, off1 + len1),
+        assertEquals(len1, b1.length, "Array length test 1 failed.");
+        assertArrayEquals(Arrays.copyOfRange(b, off1, off1 + len1), b1,
             "Array equality test 1 failed.");
 
         baos.write(b, off2, len2);
         byte[] b2 = baos.toByteArray();
-        assertEquals(b2.length, len1 + len2, "Array length test 2 failed.");
-        assertEquals(Arrays.copyOfRange(b2, 0, len1),
-             Arrays.copyOfRange(b, off1, off1 + len1),
+        assertEquals(len1 + len2, b2.length, "Array length test 2 failed.");
+        assertArrayEquals(Arrays.copyOfRange(b, off1, off1 + len1),
+            Arrays.copyOfRange(b2, 0, len1),
             "Array equality test 2A failed.");
-        assertEquals(Arrays.copyOfRange(b2, len1, len1 + len2),
-            Arrays.copyOfRange(b, off2, off2 + len2),
+        assertArrayEquals(Arrays.copyOfRange(b, off2, off2 + len2),
+            Arrays.copyOfRange(b2, len1, len1 + len2),
             "Array equality test 2B failed.");
 
         baos.writeBytes(b);
         byte[] b3 = baos.toByteArray();
         int len3 = len1 + len2 + b.length;
-        if (b3.length != len1 + len2 + b.length) {
-            throw new RuntimeException("Array length test 3 failed.");
-        }
-        assertEquals(b3.length, len3, "Array length test 3 failed.");
-        assertEquals(Arrays.copyOfRange(b3, 0, len1),
-             Arrays.copyOfRange(b, off1, off1 + len1),
+        assertEquals(len3, b3.length, "Array length test 3 failed.");
+        assertArrayEquals(Arrays.copyOfRange(b, off1, off1 + len1),
+            Arrays.copyOfRange(b3, 0, len1),
             "Array equality test 3A failed.");
-        assertEquals(Arrays.copyOfRange(b3, len1, len1 + len2),
-            Arrays.copyOfRange(b, off2, off2 + len2),
+        assertArrayEquals(Arrays.copyOfRange(b, off2, off2 + len2),
+            Arrays.copyOfRange(b3, len1, len1 + len2),
             "Array equality test 3B failed.");
-        assertEquals(Arrays.copyOfRange(b3, len1 + len2, len3), b,
+        assertArrayEquals(b, Arrays.copyOfRange(b3, len1 + len2, len3),
             "Array equality test 3C failed.");
     }
 }
diff --git a/test/jdk/java/io/CharArrayReader/ReadCharBuffer.java b/test/jdk/java/io/CharArrayReader/ReadCharBuffer.java
index 545ba8ba029..87571a399ac 100644
--- a/test/jdk/java/io/CharArrayReader/ReadCharBuffer.java
+++ b/test/jdk/java/io/CharArrayReader/ReadCharBuffer.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2021, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,13 +25,9 @@
  * @test
  * @bug 4926314
  * @summary Test for CharArrayReader#read(CharBuffer).
- * @run testng ReadCharBuffer
+ * @run junit ReadCharBuffer
  */
 
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
-
-
 import java.io.CharArrayReader;
 import java.io.IOException;
 import java.io.Reader;
@@ -39,43 +35,46 @@ import java.nio.ByteBuffer;
 import java.nio.CharBuffer;
 import java.util.Arrays;
 
-import static org.testng.Assert.assertEquals;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
 
 public class ReadCharBuffer {
 
     private static final int BUFFER_SIZE = 7;
 
-    @DataProvider(name = "buffers")
-    public Object[][] createBuffers() {
+    public static CharBuffer[] buffers() {
         // test both on-heap and off-heap buffers as they may use different code paths
-        return new Object[][]{
-                new Object[]{CharBuffer.allocate(BUFFER_SIZE)},
-                new Object[]{ByteBuffer.allocateDirect(BUFFER_SIZE * 2).asCharBuffer()}
+        return new CharBuffer[] {
+            CharBuffer.allocate(BUFFER_SIZE),
+            ByteBuffer.allocateDirect(BUFFER_SIZE * 2).asCharBuffer()
         };
     }
 
-    @Test(dataProvider = "buffers")
+    @ParameterizedTest
+    @MethodSource("buffers")
     public void read(CharBuffer buffer) throws IOException {
         fillBuffer(buffer);
 
         try (Reader reader = new CharArrayReader("ABCD".toCharArray())) {
             buffer.limit(3);
             buffer.position(1);
-            assertEquals(reader.read(buffer), 2);
-            assertEquals(buffer.position(), 3);
-            assertEquals(buffer.limit(), 3);
+            assertEquals(2, reader.read(buffer));
+            assertEquals(3, buffer.position());
+            assertEquals(3, buffer.limit());
 
             buffer.limit(7);
             buffer.position(4);
-            assertEquals(reader.read(buffer), 2);
-            assertEquals(buffer.position(), 6);
-            assertEquals(buffer.limit(), 7);
+            assertEquals(2, reader.read(buffer));
+            assertEquals(6, buffer.position());
+            assertEquals(7, buffer.limit());
 
-            assertEquals(reader.read(buffer), -1);
+            assertEquals(-1, reader.read(buffer));
         }
 
         buffer.clear();
-        assertEquals(buffer.toString(), "xABxCDx");
+        assertEquals("xABxCDx", buffer.toString());
     }
 
     private void fillBuffer(CharBuffer buffer) {
diff --git a/test/jdk/java/io/DataOutputStream/WriteUTF.java b/test/jdk/java/io/DataOutputStream/WriteUTF.java
index d5557ec85ed..ed8b7397971 100644
--- a/test/jdk/java/io/DataOutputStream/WriteUTF.java
+++ b/test/jdk/java/io/DataOutputStream/WriteUTF.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1999, 2019, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1999, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,7 +25,7 @@
  * @bug 4260284 8219196 8223254
  * @summary Test if DataOutputStream will overcount written field.
  * @requires (sun.arch.data.model == "64" & os.maxMemory >= 4g)
- * @run testng/othervm -Xmx4g WriteUTF
+ * @run junit/othervm -Xmx4g WriteUTF
  */
 
 import java.io.ByteArrayOutputStream;
@@ -33,11 +33,13 @@ import java.io.DataOutputStream;
 import java.io.IOException;
 import java.io.UTFDataFormatException;
 
-import org.testng.annotations.Test;
+import org.junit.jupiter.api.Test;
+
+import static org.junit.jupiter.api.Assertions.assertThrows;
 
 public class WriteUTF {
     @Test
-    public static void overcountWrittenField() throws IOException {
+    public void overcountWrittenField() throws IOException {
         ByteArrayOutputStream baos = new ByteArrayOutputStream();
         DataOutputStream dos = new DataOutputStream(baos);
         dos.writeUTF("Hello, World!");  // 15
@@ -54,16 +56,16 @@ public class WriteUTF {
         dos.writeUTF(s);
     }
 
-    @Test(expectedExceptions = UTFDataFormatException.class)
+    @Test
     public void utfDataFormatException() throws IOException {
-        writeUTF(1 << 16);
+        assertThrows(UTFDataFormatException.class, () -> writeUTF(1 << 16));
     }
 
     // Without 8219196 fix, throws ArrayIndexOutOfBoundsException instead of
     // expected UTFDataFormatException. Requires 4GB of heap (-Xmx4g) to run
     // without throwing an OutOfMemoryError.
-    @Test(expectedExceptions = UTFDataFormatException.class)
+    @Test
     public void arrayIndexOutOfBoundsException() throws IOException {
-        writeUTF(Integer.MAX_VALUE / 3 + 1);
+        assertThrows(UTFDataFormatException.class, () -> writeUTF(Integer.MAX_VALUE / 3 + 1));
     }
 }
diff --git a/test/jdk/java/io/File/LastModifiedTest.java b/test/jdk/java/io/File/LastModifiedTest.java
index 52c7d390401..4eaf5fa34c2 100644
--- a/test/jdk/java/io/File/LastModifiedTest.java
+++ b/test/jdk/java/io/File/LastModifiedTest.java
@@ -1,4 +1,5 @@
 /*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
  * Copyright Amazon.com Inc. or its affiliates. All Rights Reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
@@ -21,20 +22,19 @@
  * questions.
  */
 
-import org.testng.annotations.Test;
-
 import java.io.File;
 import java.io.IOException;
 import java.nio.file.Files;
 import java.time.Instant;
 
-import static org.testng.Assert.assertEquals;
-import static org.testng.Assert.assertNotEquals;
+import org.junit.jupiter.api.Test;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
 
 /**
  * @test
  * @library ..
- * @run testng LastModifiedTest
+ * @run junit LastModifiedTest
  * @summary Test to validate that java.nio.Files returns the same value
  * as java.io.File
  */
@@ -51,7 +51,7 @@ public class LastModifiedTest {
             long ioTimestamp = tempFile.lastModified();
             long nioTimestamp = Files.getLastModifiedTime(tempFile.toPath()).toMillis();
 
-            assertEquals(ioTimestamp, nioTimestamp);
+            assertEquals(nioTimestamp, ioTimestamp);
         } finally {
             tempFile.delete();
         }
diff --git a/test/jdk/java/io/FileReader/ConstructorTest.java b/test/jdk/java/io/FileReader/ConstructorTest.java
index b082a710079..71cd525917a 100644
--- a/test/jdk/java/io/FileReader/ConstructorTest.java
+++ b/test/jdk/java/io/FileReader/ConstructorTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -30,15 +30,19 @@ import java.io.InputStreamReader;
 import java.io.Reader;
 import java.nio.charset.Charset;
 import java.nio.charset.StandardCharsets;
-import org.testng.Assert;
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
+import java.util.stream.Stream;
+
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.Arguments;
+import org.junit.jupiter.params.provider.MethodSource;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
 
 /**
  * @test
  * @bug 8183554
  * @summary Test to verify the new Constructors that take a Charset.
- * @run testng ConstructorTest
+ * @run junit ConstructorTest
  */
 public class ConstructorTest {
     static String USER_DIR = System.getProperty("user.dir", ".");
@@ -51,17 +55,15 @@ public class ConstructorTest {
     static final String TEST_STRING = "abc \u0100 \u0101 \u0555 \u07FD \u07FF";
     static final int BUFFER_SIZE = 8192;
 
-    @DataProvider(name = "parameters")
-    public Object[][] getParameters() throws IOException {
+    public static Stream<Arguments> parameters() throws IOException {
         File file1 = new File(USER_DIR, "FileReaderTest1.txt");
         File file2 = new File(USER_DIR, "FileReaderTest2.txt");
 
-        return new Object[][]{
-            {ConstructorType.STRING, file1, file2, StandardCharsets.UTF_8},
-            {ConstructorType.FILE, file1, file2, StandardCharsets.UTF_8},
-            {ConstructorType.STRING, file1, file2, StandardCharsets.ISO_8859_1},
-            {ConstructorType.FILE, file1, file2, StandardCharsets.ISO_8859_1},
-        };
+        return Stream.of
+            (Arguments.of(ConstructorType.STRING, file1, file2, StandardCharsets.UTF_8),
+             Arguments.of(ConstructorType.FILE, file1, file2, StandardCharsets.UTF_8),
+             Arguments.of(ConstructorType.STRING, file1, file2, StandardCharsets.ISO_8859_1),
+             Arguments.of(ConstructorType.FILE, file1, file2, StandardCharsets.ISO_8859_1));
     }
 
     /**
@@ -75,7 +77,8 @@ public class ConstructorTest {
      * @param charset the charset
      * @throws IOException
      */
-    @Test(dataProvider = "parameters")
+    @ParameterizedTest
+    @MethodSource("parameters")
     void test(ConstructorType type, File file1, File file2, Charset charset)
             throws Exception {
         prepareFile(file1, TEST_STRING, charset);
@@ -86,7 +89,7 @@ public class ConstructorTest {
                 InputStreamReader isr = new InputStreamReader(is, charset);) {
             String result1 = readAll(fr, BUFFER_SIZE);
             String result2 = readAll(isr, BUFFER_SIZE);
-            Assert.assertEquals(result1, result2);
+            assertEquals(result2, result1);
         }
     }
 
diff --git a/test/jdk/java/io/FileWriter/ConstructorTest.java b/test/jdk/java/io/FileWriter/ConstructorTest.java
index 691b52504f9..64a43395f51 100644
--- a/test/jdk/java/io/FileWriter/ConstructorTest.java
+++ b/test/jdk/java/io/FileWriter/ConstructorTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -31,15 +31,21 @@ import java.io.OutputStreamWriter;
 import java.io.Reader;
 import java.nio.charset.Charset;
 import java.nio.charset.StandardCharsets;
-import org.testng.Assert;
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
+import java.util.stream.Stream;
+
+import java.util.stream.Stream;
+
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.Arguments;
+import org.junit.jupiter.params.provider.MethodSource;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
 
 /**
  * @test
  * @bug 8183554
  * @summary Test to verify the new Constructors that take a Charset.
- * @run testng ConstructorTest
+ * @run junit ConstructorTest
  */
 public class ConstructorTest {
     static String USER_DIR = System.getProperty("user.dir", ".");
@@ -54,21 +60,19 @@ public class ConstructorTest {
     static final String TEST_STRING = "abc \u0100 \u0101 \u0555 \u07FD \u07FF";
     static final int BUFFER_SIZE = 8192;
 
-    @DataProvider(name = "parameters")
-    public Object[][] getParameters() throws IOException {
+    public static Stream<Arguments> parameters() throws IOException {
         File file1 = new File(USER_DIR, "FileWriterTest1.txt");
         File file2 = new File(USER_DIR, "FileWriterTest2.txt");
 
-        return new Object[][]{
-            {ConstructorType.STRING, file1, file2, StandardCharsets.UTF_8},
-            {ConstructorType.FILE, file1, file2, StandardCharsets.UTF_8},
-            {ConstructorType.STRING_APPEND, file1, file2, StandardCharsets.UTF_8},
-            {ConstructorType.FILE_APPEND, file1, file2, StandardCharsets.UTF_8},
-            {ConstructorType.STRING, file1, file2, StandardCharsets.ISO_8859_1},
-            {ConstructorType.FILE, file1, file2, StandardCharsets.ISO_8859_1},
-            {ConstructorType.STRING_APPEND, file1, file2, StandardCharsets.ISO_8859_1},
-            {ConstructorType.FILE_APPEND, file1, file2, StandardCharsets.ISO_8859_1},
-        };
+        return Stream.of
+            (Arguments.of(ConstructorType.STRING, file1, file2, StandardCharsets.UTF_8),
+             Arguments.of(ConstructorType.FILE, file1, file2, StandardCharsets.UTF_8),
+             Arguments.of(ConstructorType.STRING_APPEND, file1, file2, StandardCharsets.UTF_8),
+             Arguments.of(ConstructorType.FILE_APPEND, file1, file2, StandardCharsets.UTF_8),
+             Arguments.of(ConstructorType.STRING, file1, file2, StandardCharsets.ISO_8859_1),
+             Arguments.of(ConstructorType.FILE, file1, file2, StandardCharsets.ISO_8859_1),
+             Arguments.of(ConstructorType.STRING_APPEND, file1, file2, StandardCharsets.ISO_8859_1),
+             Arguments.of(ConstructorType.FILE_APPEND, file1, file2, StandardCharsets.ISO_8859_1));
     }
 
     /**
@@ -82,7 +86,8 @@ public class ConstructorTest {
      * @param charset the charset
      * @throws IOException
      */
-    @Test(dataProvider = "parameters")
+    @ParameterizedTest
+    @MethodSource("parameters")
     void test(ConstructorType type, File file1, File file2, Charset charset)
             throws Exception {
         writeWithFileWriter(type, file1, TEST_STRING, charset);
@@ -94,7 +99,7 @@ public class ConstructorTest {
             ) {
             String result1 = readAll(r1, BUFFER_SIZE);
             String result2 = readAll(r2, BUFFER_SIZE);
-            Assert.assertEquals(result1, result2);
+            assertEquals(result1, result2);
         }
     }
 
diff --git a/test/jdk/java/io/InputStream/NullInputStream.java b/test/jdk/java/io/InputStream/NullInputStream.java
index 74317822404..d911edab380 100644
--- a/test/jdk/java/io/InputStream/NullInputStream.java
+++ b/test/jdk/java/io/InputStream/NullInputStream.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -21,232 +21,148 @@
  * questions.
  */
 
-import org.testng.annotations.AfterClass;
-import org.testng.annotations.BeforeClass;
-import org.testng.annotations.Test;
-
 import java.io.ByteArrayOutputStream;
 import java.io.EOFException;
 import java.io.IOException;
 import java.io.InputStream;
 
-import static org.testng.Assert.*;
+import org.junit.jupiter.api.AfterAll;
+import org.junit.jupiter.api.BeforeAll;
+import org.junit.jupiter.api.Test;
+
+import static org.junit.jupiter.api.Assertions.assertDoesNotThrow;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertNotNull;
+import static org.junit.jupiter.api.Assertions.assertThrows;
 
 /*
  * @test
  * @bug 4358774 6516099 8139206
- * @run testng NullInputStream
+ * @run junit NullInputStream
  * @summary Check for expected behavior of InputStream.nullInputStream().
  */
 public class NullInputStream {
     private static InputStream openStream;
     private static InputStream closedStream;
 
-    @BeforeClass
+    @BeforeAll
     public static void setup() {
         openStream = InputStream.nullInputStream();
         closedStream = InputStream.nullInputStream();
-        try {
-           closedStream.close();
-        } catch (IOException e) {
-            fail("Unexpected IOException");
-        }
+        assertDoesNotThrow(() -> closedStream.close());
     }
 
-    @AfterClass
+    @AfterAll
     public static void closeStream() {
-        try {
-            openStream.close();
-        } catch (IOException e) {
-            fail("Unexpected IOException");
-        }
+        assertDoesNotThrow(() -> openStream.close());
     }
 
     @Test
-    public static void testOpen() {
+    public void testOpen() {
         assertNotNull(openStream, "InputStream.nullInputStream() returned null");
     }
 
     @Test
-    public static void testAvailable() {
-        try {
-            assertEquals(0, openStream.available(), "available() != 0");
-        } catch (IOException ioe) {
-            fail("Unexpected IOException");
-        }
+    public void testAvailable() throws IOException {
+        assertEquals(0, openStream.available());
     }
 
     @Test
-    public static void testRead() {
-        try {
-            assertEquals(-1, openStream.read(), "read() != -1");
-        } catch (IOException ioe) {
-            fail("Unexpected IOException");
-        }
+    public void testRead() throws IOException {
+        assertEquals(-1, openStream.read());
     }
 
     @Test
-    public static void testReadBII() {
-        try {
-            assertEquals(-1, openStream.read(new byte[1], 0, 1),
-                "read(byte[],int,int) != -1");
-        } catch (IOException ioe) {
-            fail("Unexpected IOException");
-        }
+    public void testReadBII() throws IOException {
+        assertEquals(-1, openStream.read(new byte[1], 0, 1));
     }
 
     @Test
-    public static void testReadAllBytes() {
-        try {
-            assertEquals(0, openStream.readAllBytes().length,
-                "readAllBytes().length != 0");
-        } catch (IOException ioe) {
-            fail("Unexpected IOException");
-        }
+    public void testReadAllBytes() throws IOException {
+        assertEquals(0, openStream.readAllBytes().length);
     }
 
     @Test
-    public static void testReadNBytes() {
-        try {
-            assertEquals(0, openStream.readNBytes(new byte[1], 0, 1),
-                "readNBytes(byte[],int,int) != 0");
-        } catch (IOException ioe) {
-            fail("Unexpected IOException");
-        }
+    public void testReadNBytes() throws IOException {
+        assertEquals(0, openStream.readNBytes(new byte[1], 0, 1));
     }
 
     @Test
-    public static void testReadNBytesWithLength() {
-        try {
-            assertEquals(0, openStream.readNBytes(-1).length,
-                "readNBytes(-1) != 0");
-            fail("Expected IllegalArgumentException not thrown");
-        } catch (IllegalArgumentException iae) {
-        } catch (IOException ioe) {
-            fail("Unexpected IOException");
-        }
-        try {
-            assertEquals(0, openStream.readNBytes(0).length,
-                "readNBytes(0, false) != 0");
-            assertEquals(0, openStream.readNBytes(1).length,
-                "readNBytes(1, false) != 0");
-        } catch (IOException ioe) {
-            fail("Unexpected IOException");
-        }
+    public void testReadNBytesWithLength() throws IOException {
+        assertThrows(IllegalArgumentException.class,
+                     () -> openStream.readNBytes(-1));
+        assertEquals(0, openStream.readNBytes(0).length);
+        assertEquals(0, openStream.readNBytes(1).length);
     }
 
     @Test
-    public static void testSkip() {
-        try {
-            assertEquals(0, openStream.skip(1), "skip() != 0");
-        } catch (IOException ioe) {
-            fail("Unexpected IOException");
-        }
+    public void testSkip() throws IOException {
+        assertEquals(0L, openStream.skip(1));
     }
 
     @Test
-    public static void testSkipNBytes() {
-        try {
-            openStream.skipNBytes(-1);
-            openStream.skipNBytes(0);
-        } catch (IOException ioe) {
-            fail("Unexpected IOException");
-        }
-    }
-
-    @Test(expectedExceptions = EOFException.class)
-    public static void testSkipNBytesEOF() throws IOException {
-        openStream.skipNBytes(1);
+    public void testSkipNBytes() {
+        assertDoesNotThrow(() -> {
+                openStream.skipNBytes(-1);
+                openStream.skipNBytes(0);
+            });
     }
 
     @Test
-    public static void testTransferTo() {
-        try {
-            assertEquals(0, openStream.transferTo(new ByteArrayOutputStream(7)),
-                "transferTo() != 0");
-        } catch (IOException ioe) {
-            fail("Unexpected IOException");
-        }
+    public void testSkipNBytesEOF() throws IOException {
+        assertThrows(EOFException.class, () -> openStream.skipNBytes(1));
     }
 
     @Test
-    public static void testAvailableClosed() {
-        try {
-            closedStream.available();
-            fail("Expected IOException not thrown");
-        } catch (IOException e) {
-        }
+    public void testTransferTo() throws IOException {
+        assertEquals(0L, openStream.transferTo(new ByteArrayOutputStream(7)));
     }
 
     @Test
-    public static void testReadClosed() {
-        try {
-            closedStream.read();
-            fail("Expected IOException not thrown");
-        } catch (IOException e) {
-        }
+    public void testAvailableClosed() {
+        assertThrows(IOException.class, () -> closedStream.available());
     }
 
     @Test
-    public static void testReadBIIClosed() {
-        try {
-            closedStream.read(new byte[1], 0, 1);
-            fail("Expected IOException not thrown");
-        } catch (IOException e) {
-        }
+    public void testReadClosed() {
+        assertThrows(IOException.class, () -> closedStream.read());
     }
 
     @Test
-    public static void testReadAllBytesClosed() {
-        try {
-            closedStream.readAllBytes();
-            fail("Expected IOException not thrown");
-        } catch (IOException e) {
-        }
+    public void testReadBIIClosed() {
+        assertThrows(IOException.class,
+                     () -> closedStream.read(new byte[1], 0, 1));
     }
 
     @Test
-    public static void testReadNBytesClosed() {
-        try {
-            closedStream.readNBytes(new byte[1], 0, 1);
-            fail("Expected IOException not thrown");
-        } catch (IOException e) {
-        }
+    public void testReadAllBytesClosed() {
+        assertThrows(IOException.class, () -> closedStream.readAllBytes());
     }
 
     @Test
-    public static void testReadNBytesWithLengthClosed() {
-        try {
-            closedStream.readNBytes(1);
-            fail("Expected IOException not thrown");
-        } catch (IOException e) {
-        }
+    public void testReadNBytesClosed() {
+        assertThrows(IOException.class, () ->
+            closedStream.readNBytes(new byte[1], 0, 1));
     }
 
     @Test
-    public static void testSkipClosed() {
-        try {
-            closedStream.skip(1);
-            fail("Expected IOException not thrown");
-        } catch (IOException e) {
-        }
+    public void testReadNBytesWithLengthClosed() {
+        assertThrows(IOException.class, () -> closedStream.readNBytes(1));
     }
 
     @Test
-    public static void testSkipNBytesClosed() {
-        try {
-            closedStream.skipNBytes(1);
-            fail("Expected IOException not thrown");
-        } catch (IOException e) {
-        }
+    public void testSkipClosed() {
+        assertThrows(IOException.class, () -> closedStream.skip(1));
     }
 
     @Test
-    public static void testTransferToClosed() {
-        try {
-            closedStream.transferTo(new ByteArrayOutputStream(7));
-            fail("Expected IOException not thrown");
-        } catch (IOException e) {
-        }
+    public void testSkipNBytesClosed() {
+        assertThrows(IOException.class, () -> closedStream.skipNBytes(1));
+    }
+
+    @Test
+    public void testTransferToClosed() {
+        assertThrows(IOException.class,
+            () -> closedStream.transferTo(new ByteArrayOutputStream(7)));
     }
 }
diff --git a/test/jdk/java/io/InputStreamReader/ReadCharBuffer.java b/test/jdk/java/io/InputStreamReader/ReadCharBuffer.java
index 8a4094c512a..6df3feb756f 100644
--- a/test/jdk/java/io/InputStreamReader/ReadCharBuffer.java
+++ b/test/jdk/java/io/InputStreamReader/ReadCharBuffer.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2021, 2022, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2021, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,13 +25,9 @@
  * @test
  * @bug 4926314 8287003
  * @summary Test for InputStreamReader#read(CharBuffer).
- * @run testng ReadCharBuffer
+ * @run junit ReadCharBuffer
  */
 
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
-
-
 import java.io.ByteArrayInputStream;
 import java.io.IOException;
 import java.io.InputStreamReader;
@@ -40,22 +36,25 @@ import java.nio.ByteBuffer;
 import java.nio.CharBuffer;
 import java.nio.charset.CodingErrorAction;
 import java.util.Arrays;
+import java.util.stream.Stream;
 
 import static java.nio.charset.StandardCharsets.US_ASCII;
 import static java.nio.charset.StandardCharsets.UTF_8;
-import static org.testng.Assert.assertEquals;
+
+import org.junit.jupiter.api.Test;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
 
 public class ReadCharBuffer {
 
     private static final int BUFFER_SIZE = 24;
 
-    @DataProvider(name = "buffers")
-    public Object[][] createBuffers() {
+    public static Stream<CharBuffer> buffers() {
         // test both on-heap and off-heap buffers as they make use different code paths
-        return new Object[][]{
-                new Object[]{CharBuffer.allocate(BUFFER_SIZE)},
-                new Object[]{ByteBuffer.allocateDirect(BUFFER_SIZE * 2).asCharBuffer()}
-        };
+        return Stream.of(CharBuffer.allocate(BUFFER_SIZE),
+                         ByteBuffer.allocateDirect(BUFFER_SIZE * 2).asCharBuffer());
     }
 
     private void fillBuffer(CharBuffer buffer) {
@@ -65,7 +64,8 @@ public class ReadCharBuffer {
         buffer.clear();
     }
 
-    @Test(dataProvider = "buffers")
+    @ParameterizedTest
+    @MethodSource("buffers")
     public void read(CharBuffer buffer) throws IOException {
         fillBuffer(buffer);
 
diff --git a/test/jdk/java/io/InputStreamReader/StatefulDecoderNearEOF.java b/test/jdk/java/io/InputStreamReader/StatefulDecoderNearEOF.java
index 95759df5522..f456d176e98 100644
--- a/test/jdk/java/io/InputStreamReader/StatefulDecoderNearEOF.java
+++ b/test/jdk/java/io/InputStreamReader/StatefulDecoderNearEOF.java
@@ -23,7 +23,7 @@
 
 /* @test
  * @bug 8292043
- * @run testng StatefulDecoderNearEOF
+ * @run junit StatefulDecoderNearEOF
  * @summary Check MalformedInputException is thrown with stateful decoders
  *      with malformed input before EOF
  */
@@ -36,29 +36,30 @@ import java.nio.charset.CodingErrorAction;
 import java.nio.charset.MalformedInputException;
 import java.nio.charset.StandardCharsets;
 import java.util.stream.IntStream;
+import java.util.stream.Stream;
 
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
-import static org.testng.Assert.assertEquals;
-import static org.testng.Assert.assertThrows;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.Arguments;
+import org.junit.jupiter.params.provider.MethodSource;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertThrows;
 
-@Test
 public class StatefulDecoderNearEOF {
 
-    @DataProvider
-    public Object[][] inputs() {
-        return new Object[][] {
+    public static Stream<Arguments> inputs() {
+        return Stream.of(
             // BOM, followed by High surrogate (in UTF-16LE).
             // First read() should throw an exception.
-            {new byte[] {(byte)0xff, (byte)0xfe, 0, (byte)0xd8}, 0},
+            Arguments.of(new byte[] {(byte)0xff, (byte)0xfe, 0, (byte)0xd8}, 0),
 
             // BOM, followed by 'A', 'B', 'C', then by High surrogate (in UTF-16LE).
             // Fourth read() should throw an exception.
-            {new byte[] {(byte)0xff, (byte)0xfe, (byte)0x41, 0, (byte)0x42, 0, (byte)0x43, 0, 0, (byte)0xd8}, 3},
-        };
+            Arguments.of(new byte[] {(byte)0xff, (byte)0xfe, (byte)0x41, 0, (byte)0x42, 0, (byte)0x43, 0, 0, (byte)0xd8}, 3));
     }
 
-    @Test (dataProvider = "inputs")
+    @ParameterizedTest
+    @MethodSource("inputs")
     public void testStatefulDecoderNearEOF(byte[] ba, int numSucessReads) throws IOException {
         try (var r = new InputStreamReader(
                 new ByteArrayInputStream(ba),
diff --git a/test/jdk/java/io/LineNumberReader/MarkSplitCRLF.java b/test/jdk/java/io/LineNumberReader/MarkSplitCRLF.java
index d735e78f684..187bef037c5 100644
--- a/test/jdk/java/io/LineNumberReader/MarkSplitCRLF.java
+++ b/test/jdk/java/io/LineNumberReader/MarkSplitCRLF.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2019, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2019, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -24,7 +24,7 @@
 /* @test
  * @bug 8218280
  * @summary Make sure marking a line feed within a CRLF sequence works correctly
- * @run testng MarkSplitCRLF
+ * @run junit MarkSplitCRLF
  */
 
 import java.io.IOException;
@@ -32,13 +32,13 @@ import java.io.LineNumberReader;
 import java.io.Reader;
 import java.io.StringReader;
 
-import org.testng.annotations.Test;
+import org.junit.jupiter.api.Test;
 
-import static org.testng.Assert.*;
+import static org.junit.jupiter.api.Assertions.assertEquals;
 
 public class MarkSplitCRLF {
     @Test
-    public static void testSpecifiedBufferSize() throws IOException {
+    public void testSpecifiedBufferSize() throws IOException {
         final String string = "foo\r\nbar";
         try (Reader reader =
             new LineNumberReader(new StringReader(string), 5)) {
@@ -56,7 +56,7 @@ public class MarkSplitCRLF {
     }
 
     @Test
-    public static void testCRNotFollowedByLF() throws IOException {
+    public void testCRNotFollowedByLF() throws IOException {
         final String string = "foo\rbar";
         try (Reader reader =
             new LineNumberReader(new StringReader(string), 5)) {
@@ -74,7 +74,7 @@ public class MarkSplitCRLF {
     }
 
     @Test
-    public static void testDefaultBufferSize() throws IOException {
+    public void testDefaultBufferSize() throws IOException {
         StringBuilder sb = new StringBuilder(8195);
         for (int i = 0; i < 8190; i++) {
             char c = (char)i;
diff --git a/test/jdk/java/io/ObjectStreamClass/ObjectStreamClassCaching.java b/test/jdk/java/io/ObjectStreamClass/ObjectStreamClassCaching.java
index 4004cbcf859..b1765b04060 100644
--- a/test/jdk/java/io/ObjectStreamClass/ObjectStreamClassCaching.java
+++ b/test/jdk/java/io/ObjectStreamClass/ObjectStreamClassCaching.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2021, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2021, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -26,9 +26,10 @@ import java.lang.ref.WeakReference;
 import java.io.ObjectStreamClass;
 import java.io.Serializable;
 import java.util.ArrayList;
-import org.testng.annotations.Test;
-import static org.testng.Assert.assertFalse;
-import static org.testng.Assert.assertTrue;
+
+import org.junit.jupiter.api.Test;
+
+import static org.junit.jupiter.api.Assertions.assertTrue;
 
 /*
  * @test id=G1
@@ -36,7 +37,7 @@ import static org.testng.Assert.assertTrue;
  * @bug 8277072
  * @library /test/lib/
  * @summary ObjectStreamClass caches keep ClassLoaders alive (G1 GC)
- * @run testng/othervm -Xmx64m -XX:+UseG1GC ObjectStreamClassCaching
+ * @run junit/othervm -Xmx64m -XX:+UseG1GC ObjectStreamClassCaching
  */
 
 /*
@@ -45,7 +46,7 @@ import static org.testng.Assert.assertTrue;
  * @bug 8277072
  * @library /test/lib/
  * @summary ObjectStreamClass caches keep ClassLoaders alive (Parallel GC)
- * @run testng/othervm -Xmx64m -XX:+UseParallelGC ObjectStreamClassCaching
+ * @run junit/othervm -Xmx64m -XX:+UseParallelGC ObjectStreamClassCaching
  */
 
 /*
@@ -54,7 +55,7 @@ import static org.testng.Assert.assertTrue;
  * @bug 8277072 8327180
  * @library /test/lib/
  * @summary ObjectStreamClass caches keep ClassLoaders alive (ZGC)
- * @run testng/othervm -Xmx64m -XX:+UseZGC ObjectStreamClassCaching
+ * @run junit/othervm -Xmx64m -XX:+UseZGC ObjectStreamClassCaching
  */
 
 /*
@@ -63,7 +64,7 @@ import static org.testng.Assert.assertTrue;
  * @bug 8277072
  * @library /test/lib/
  * @summary ObjectStreamClass caches keep ClassLoaders alive (Shenandoah GC)
- * @run testng/othervm -Xmx64m -XX:+UseShenandoahGC ObjectStreamClassCaching
+ * @run junit/othervm -Xmx64m -XX:+UseShenandoahGC ObjectStreamClassCaching
  */
 
 /*
@@ -72,7 +73,7 @@ import static org.testng.Assert.assertTrue;
  * @bug 8277072 8327180
  * @library /test/lib/
  * @summary ObjectStreamClass caches keep ClassLoaders alive (Serial GC)
- * @run testng/othervm -Xmx64m -XX:+UseSerialGC ObjectStreamClassCaching
+ * @run junit/othervm -Xmx64m -XX:+UseSerialGC ObjectStreamClassCaching
  */
 public class ObjectStreamClassCaching {
 
diff --git a/test/jdk/java/io/ObjectStreamClass/TestOSCClassLoaderLeak.java b/test/jdk/java/io/ObjectStreamClass/TestOSCClassLoaderLeak.java
index 1816aa45fe7..e7b944f6574 100644
--- a/test/jdk/java/io/ObjectStreamClass/TestOSCClassLoaderLeak.java
+++ b/test/jdk/java/io/ObjectStreamClass/TestOSCClassLoaderLeak.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2021, 2022, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2021, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -29,18 +29,20 @@ import java.io.ObjectStreamClass;
 import java.io.ObjectStreamField;
 import java.io.Serializable;
 import java.util.Arrays;
-import org.testng.annotations.Test;
-import static org.testng.Assert.assertTrue;
-import static org.testng.Assert.assertFalse;
 
 import jdk.test.lib.util.ForceGC;
 
+import org.junit.jupiter.api.Test;
+
+import static org.junit.jupiter.api.Assertions.assertFalse;
+import static org.junit.jupiter.api.Assertions.assertTrue;
+
 /* @test
  * @bug 8277072
  * @library /test/lib/
  * @build jdk.test.lib.util.ForceGC
  * @summary ObjectStreamClass caches keep ClassLoaders alive
- * @run testng TestOSCClassLoaderLeak
+ * @run junit TestOSCClassLoaderLeak
  */
 public class TestOSCClassLoaderLeak {
 
diff --git a/test/jdk/java/io/OutputStream/NullOutputStream.java b/test/jdk/java/io/OutputStream/NullOutputStream.java
index e0041e424d8..d0f76596db3 100644
--- a/test/jdk/java/io/OutputStream/NullOutputStream.java
+++ b/test/jdk/java/io/OutputStream/NullOutputStream.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -21,85 +21,64 @@
  * questions.
  */
 
-import org.testng.annotations.AfterClass;
-import org.testng.annotations.BeforeClass;
-import org.testng.annotations.Test;
-
 import java.io.IOException;
 import java.io.OutputStream;
 
-import static org.testng.Assert.assertNotNull;
-import static org.testng.Assert.fail;
+import org.junit.jupiter.api.AfterAll;
+import org.junit.jupiter.api.BeforeAll;
+import org.junit.jupiter.api.Test;
+
+import static org.junit.jupiter.api.Assertions.assertNotNull;
+import static org.junit.jupiter.api.Assertions.assertDoesNotThrow;
+import static org.junit.jupiter.api.Assertions.assertNull;
+import static org.junit.jupiter.api.Assertions.assertThrows;
 
 /*
  * @test
  * @bug 4358774
- * @run testng NullOutputStream
+ * @run junit NullOutputStream
  * @summary Check for expected behavior of OutputStream.nullOutputStream().
  */
 public class NullOutputStream {
     private static OutputStream openStream;
     private static OutputStream closedStream;
 
-    @BeforeClass
+    @BeforeAll
     public static void setup() {
         openStream = OutputStream.nullOutputStream();
         closedStream = OutputStream.nullOutputStream();
-        try {
-           closedStream.close();
-        } catch (IOException e) {
-            fail("Unexpected IOException");
-        }
+        assertDoesNotThrow(() -> closedStream.close());
     }
 
-    @AfterClass
+    @AfterAll
     public static void closeStream() {
-        try {
-            openStream.close();
-        } catch (IOException e) {
-            fail("Unexpected IOException");
-        }
+        assertDoesNotThrow(() -> openStream.close());
     }
 
     @Test
-    public static void testOpen() {
+    public void testOpen() {
         assertNotNull(openStream,
             "OutputStream.nullOutputStream() returned null");
     }
 
     @Test
-    public static void testWrite() {
-        try {
-            openStream.write(62832);
-        } catch (IOException e) {
-            fail("Unexpected IOException");
-        }
+    public void testWrite() throws IOException {
+        openStream.write(62832);
     }
 
     @Test
-    public static void testWriteBII() {
-        try {
-            openStream.write(new byte[] {(byte)6}, 0, 1);
-        } catch (Exception e) {
-            fail("Unexpected IOException");
-        }
+    public void testWriteBII() {
+        assertDoesNotThrow(() -> openStream.write(new byte[] {(byte)6}, 0, 1));
     }
 
     @Test
-    public static void testWriteClosed() {
-        try {
-            closedStream.write(62832);
-            fail("Expected IOException not thrown");
-        } catch (IOException e) {
-        }
+    public void testWriteClosed() {
+        assertThrows(IOException.class, () -> closedStream.write(62832));
     }
 
     @Test
-    public static void testWriteBIIClosed() {
-        try {
-            closedStream.write(new byte[] {(byte)6}, 0, 1);
-            fail("Expected IOException not thrown");
-        } catch (IOException e) {
-        }
+    public void testWriteBIIClosed() {
+        assertThrows(IOException.class,
+                     () -> closedStream.write(new byte[] {(byte)6}, 0, 1));
     }
 }
diff --git a/test/jdk/java/io/PrintStream/EncodingTest.java b/test/jdk/java/io/PrintStream/EncodingTest.java
index d767b5801d3..a0fe27b81cb 100644
--- a/test/jdk/java/io/PrintStream/EncodingTest.java
+++ b/test/jdk/java/io/PrintStream/EncodingTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2017, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2017, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -29,16 +29,20 @@ import java.nio.charset.Charset;
 import java.nio.charset.StandardCharsets;
 import java.nio.file.Files;
 import java.nio.file.Paths;
-import org.testng.Assert;
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
+import java.util.stream.Stream;
+
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.Arguments;
+import org.junit.jupiter.params.provider.MethodSource;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
 
 /**
  * @test
  * @bug 8183743
  * @summary Test to verify the new overload method with Charset functions the same
  * as the existing method that takes a charset name.
- * @run testng EncodingTest
+ * @run junit EncodingTest
  */
 public class EncodingTest {
     static String USER_DIR = System.getProperty("user.dir", ".");
@@ -50,22 +54,20 @@ public class EncodingTest {
     }
 
     /*
-     * DataProvider fields:
+     * MethodSource fields:
      * Type of the constructor, a file to be written with a charset name,
      * a file to be written with a charset, charset name, charset.
      */
-    @DataProvider(name = "parameters")
-    public Object[][] getParameters() throws IOException {
+    public static Stream<Arguments> parameters() throws IOException {
         String csn = StandardCharsets.UTF_8.name();
         Charset charset = StandardCharsets.UTF_8;
         File file1 = new File(USER_DIR, "PSCharsetTest1.txt");
         File file2 = new File(USER_DIR, "PSCharsetTest2.txt");
 
-        return new Object[][]{
-            {ConstructorType.STRING, file1, file2, csn, charset},
-            {ConstructorType.FILE, file1, file2, csn, charset},
-            {ConstructorType.OUTPUTSTREAM, file1, file2, csn, charset}
-        };
+        return Stream.of
+            (Arguments.of(ConstructorType.STRING, file1, file2, csn, charset),
+             Arguments.of(ConstructorType.FILE, file1, file2, csn, charset),
+             Arguments.of(ConstructorType.OUTPUTSTREAM, file1, file2, csn, charset));
     }
 
     /**
@@ -78,14 +80,15 @@ public class EncodingTest {
      * @param charset the charset
      * @throws IOException
      */
-    @Test(dataProvider = "parameters")
+    @ParameterizedTest
+    @MethodSource("parameters")
     public void test(ConstructorType type, File file1, File file2, String csn, Charset charset)
             throws Exception {
         createFile(getPrintStream(type, file1.getPath(), csn, null));
         createFile(getPrintStream(type, file2.getPath(), null, charset));
 
-        Assert.assertEquals(Files.readAllLines(Paths.get(file1.getPath()), charset),
-                Files.readAllLines(Paths.get(file2.getPath()), charset));
+        assertEquals(Files.readAllLines(Paths.get(file2.getPath()), charset),
+            Files.readAllLines(Paths.get(file1.getPath()), charset));
     }
 
     public void createFile(PrintStream out) throws IOException {
diff --git a/test/jdk/java/io/PrintStream/InheritEncodingTest.java b/test/jdk/java/io/PrintStream/InheritEncodingTest.java
index e31404114a0..094a1d4e0be 100644
--- a/test/jdk/java/io/PrintStream/InheritEncodingTest.java
+++ b/test/jdk/java/io/PrintStream/InheritEncodingTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2021, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -21,10 +21,6 @@
  * questions.
  */
 
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
-import static org.testng.Assert.assertEquals;
-
 import java.io.ByteArrayOutputStream;
 import java.io.IOException;
 import java.io.OutputStreamWriter;
@@ -33,31 +29,35 @@ import java.io.PrintWriter;
 import java.nio.charset.Charset;
 import java.nio.charset.StandardCharsets;
 
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+
 /**
  * @test
  * @bug 8276970
  * @summary Test to verify the charset in PrintStream is inherited
  *      in the OutputStreamWriter/PrintWriter
- * @run testng InheritEncodingTest
+ * @run junit InheritEncodingTest
  */
-@Test
 public class InheritEncodingTest {
 
     private static final String testString = "\u00e9\u3042"; // "éあ"
 
-    @DataProvider
-    public Object[][] encodings() {
-        return new Object[][]{
-                {StandardCharsets.ISO_8859_1},
-                {StandardCharsets.US_ASCII},
-                {StandardCharsets.UTF_8},
-                {StandardCharsets.UTF_16},
-                {StandardCharsets.UTF_16BE},
-                {StandardCharsets.UTF_16LE},
+    public static Charset[] encodings() {
+        return new Charset[]{
+                StandardCharsets.ISO_8859_1,
+                StandardCharsets.US_ASCII,
+                StandardCharsets.UTF_8,
+                StandardCharsets.UTF_16,
+                StandardCharsets.UTF_16BE,
+                StandardCharsets.UTF_16LE
         };
     }
 
-    @Test (dataProvider = "encodings")
+    @ParameterizedTest
+    @MethodSource("encodings")
     public void testOutputStreamWriter(Charset stdCharset) throws IOException {
         var ba = new ByteArrayOutputStream();
         var ps = new PrintStream(ba, true, stdCharset);
@@ -65,16 +65,17 @@ public class InheritEncodingTest {
 
         // tests OutputStreamWriter's encoding explicitly
         var osw = new OutputStreamWriter(ps);
-        assertEquals(Charset.forName(osw.getEncoding()), stdCharset);
+        assertEquals(stdCharset, Charset.forName(osw.getEncoding()));
 
         // tests roundtrip result
         osw.write(testString);
         osw.flush();
         var result = ba.toString(stdCharset);
-        assertEquals(result, expected);
+        assertEquals(expected, result);
     }
 
-    @Test (dataProvider = "encodings")
+    @ParameterizedTest
+    @MethodSource("encodings")
     public void testPrintWriter(Charset stdCharset) throws IOException {
         var ba = new ByteArrayOutputStream();
         var ps = new PrintStream(ba, true, stdCharset);
@@ -85,10 +86,11 @@ public class InheritEncodingTest {
         pw.write(testString);
         pw.flush();
         var result = ba.toString(stdCharset);
-        assertEquals(result, expected);
+        assertEquals(expected, result);
     }
 
-    @Test (dataProvider = "encodings")
+    @ParameterizedTest
+    @MethodSource("encodings")
     public void testPrintStream(Charset stdCharset) throws IOException {
         var ba = new ByteArrayOutputStream();
         var ps = new PrintStream(ba, true, stdCharset);
@@ -96,12 +98,12 @@ public class InheritEncodingTest {
 
         // tests PrintStream's charset explicitly
         var psWrapper = new PrintStream(ps);
-        assertEquals(psWrapper.charset(), stdCharset);
+        assertEquals(stdCharset, psWrapper.charset());
 
         // tests roundtrip result
         psWrapper.print(testString);
         psWrapper.flush();
         var result = ba.toString(stdCharset);
-        assertEquals(result, expected);
+        assertEquals(expected, result);
     }
 }
diff --git a/test/jdk/java/io/PrintWriter/EncodingTest.java b/test/jdk/java/io/PrintWriter/EncodingTest.java
index f02944d9900..ef6e8b0094b 100644
--- a/test/jdk/java/io/PrintWriter/EncodingTest.java
+++ b/test/jdk/java/io/PrintWriter/EncodingTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2017, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2017, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -29,16 +29,20 @@ import java.nio.charset.Charset;
 import java.nio.charset.StandardCharsets;
 import java.nio.file.Files;
 import java.nio.file.Paths;
-import org.testng.Assert;
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
+import java.util.stream.Stream;
+
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.Arguments;
+import org.junit.jupiter.params.provider.MethodSource;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
 
 /**
  * @test
  * @bug 8183743
  * @summary Test to verify the new overload method with Charset functions the same
  * as the existing method that takes a charset name.
- * @run testng EncodingTest
+ * @run junit EncodingTest
  */
 public class EncodingTest {
     static String USER_DIR = System.getProperty("user.dir", ".");
@@ -54,18 +58,16 @@ public class EncodingTest {
      * Type of the constructor, a file to be written with a charset name,
      * a file to be written with a charset, charset name, charset.
      */
-    @DataProvider(name = "parameters")
-    public Object[][] getParameters() throws IOException {
+    public static Stream<Arguments> parameters() throws IOException {
         String csn = StandardCharsets.UTF_8.name();
         Charset charset = StandardCharsets.UTF_8;
         File file1 = new File(USER_DIR, "PWCharsetTest1.txt");
         File file2 = new File(USER_DIR, "PWCharsetTest2.txt");
 
-        return new Object[][]{
-            {ConstructorType.STRING, file1, file2, csn, charset},
-            {ConstructorType.FILE, file1, file2, csn, charset},
-            {ConstructorType.OUTPUTSTREAM, file1, file2, csn, charset}
-        };
+        return Stream.of
+            (Arguments.of(ConstructorType.STRING, file1, file2, csn, charset),
+             Arguments.of(ConstructorType.FILE, file1, file2, csn, charset),
+             Arguments.of(ConstructorType.OUTPUTSTREAM, file1, file2, csn, charset));
     }
 
     /**
@@ -79,14 +81,15 @@ public class EncodingTest {
      * @param charset the charset
      * @throws IOException
      */
-    @Test(dataProvider = "parameters")
+    @ParameterizedTest
+    @MethodSource("parameters")
     public void test(ConstructorType type, File file1, File file2, String csn, Charset charset)
             throws Exception {
         createFile(getWriter(type, file1.getPath(), csn, null));
         createFile(getWriter(type, file2.getPath(), null, charset));
 
-        Assert.assertEquals(Files.readAllLines(Paths.get(file1.getPath()), charset),
-                Files.readAllLines(Paths.get(file2.getPath()), charset));
+        assertEquals(Files.readAllLines(Paths.get(file2.getPath()), charset),
+                Files.readAllLines(Paths.get(file1.getPath()), charset));
     }
 
     void createFile(PrintWriter out) throws IOException {
diff --git a/test/jdk/java/io/PushbackInputStream/TransferTo.java b/test/jdk/java/io/PushbackInputStream/TransferTo.java
index 0a27d88bc70..5d601748003 100644
--- a/test/jdk/java/io/PushbackInputStream/TransferTo.java
+++ b/test/jdk/java/io/PushbackInputStream/TransferTo.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2022, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2022, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -32,21 +32,21 @@ import java.util.concurrent.atomic.AtomicReference;
 import java.util.function.Consumer;
 import java.util.function.Supplier;
 
-import org.testng.annotations.Test;
+import static java.lang.String.format;
 
 import jdk.test.lib.RandomFactory;
 
-import static java.lang.String.format;
+import org.junit.jupiter.api.Test;
 
-import static org.testng.Assert.assertEquals;
-import static org.testng.Assert.assertThrows;
-import static org.testng.Assert.assertTrue;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertThrows;
+import static org.junit.jupiter.api.Assertions.assertTrue;
 
 /*
  * @test
  * @library /test/lib
  * @build jdk.test.lib.RandomFactory
- * @run testng/othervm/timeout=180 TransferTo
+ * @run junit/othervm/timeout=180 TransferTo
  * @bug 8296431
  * @summary Tests whether java.io.PushbackInputStream.transferTo conforms to the
  *          InputStream.transferTo specification
@@ -162,7 +162,7 @@ public class TransferTo {
             long reported = in.transferTo(out);
             int count = inBytes.length - posIn;
 
-            assertEquals(reported, count,
+            assertEquals(count, reported,
                     format("reported %d bytes but should report %d", reported, count));
 
             byte[] outBytes = recorder.get().get();
diff --git a/test/jdk/java/io/Reader/NullReader.java b/test/jdk/java/io/Reader/NullReader.java
index 9c16f33df1c..b80c1a9f67a 100644
--- a/test/jdk/java/io/Reader/NullReader.java
+++ b/test/jdk/java/io/Reader/NullReader.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -27,118 +27,125 @@ import java.io.StringWriter;
 import java.nio.CharBuffer;
 import java.nio.ReadOnlyBufferException;
 
-import org.testng.annotations.*;
+import org.junit.jupiter.api.AfterAll;
+import org.junit.jupiter.api.BeforeAll;
+import org.junit.jupiter.api.Test;
 
-import static org.testng.Assert.*;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertFalse;
+import static org.junit.jupiter.api.Assertions.assertNotNull;
+import static org.junit.jupiter.api.Assertions.assertThrows;
 
 /*
  * @test
  * @bug 8196298 8204930
- * @run testng NullReader
+ * @run junit NullReader
  * @summary Check for expected behavior of Reader.nullReader().
  */
 public class NullReader {
     private static Reader openReader;
     private static Reader closedReader;
 
-    @BeforeClass
+    @BeforeAll
     public static void setup() throws IOException {
         openReader = Reader.nullReader();
         closedReader = Reader.nullReader();
         closedReader.close();
     }
 
-    @AfterClass
+    @AfterAll
     public static void closeStream() throws IOException {
         openReader.close();
     }
 
     @Test
-    public static void testOpen() {
+    public void testOpen() {
         assertNotNull(openReader, "Reader.nullReader() returned null");
     }
 
     @Test
-    public static void testRead() throws IOException {
+    public void testRead() throws IOException {
         assertEquals(-1, openReader.read(), "read() != -1");
     }
 
     @Test
-    public static void testReadBII() throws IOException {
+    public void testReadBII() throws IOException {
         assertEquals(-1, openReader.read(new char[1], 0, 1),
                 "read(char[],int,int) != -1");
     }
 
     @Test
-    public static void testReadBIILenZero() throws IOException {
+    public void testReadBIILenZero() throws IOException {
         assertEquals(0, openReader.read(new char[1], 0, 0),
                 "read(char[],int,int) != 0");
     }
 
     @Test
-    public static void testReadCharBuffer() throws IOException {
+    public void testReadCharBuffer() throws IOException {
         CharBuffer charBuffer = CharBuffer.allocate(1);
         assertEquals(-1, openReader.read(charBuffer),
                 "read(CharBuffer) != -1");
     }
 
     @Test
-    public static void testReadCharBufferZeroRemaining() throws IOException {
+    public void testReadCharBufferZeroRemaining() throws IOException {
         CharBuffer charBuffer = CharBuffer.allocate(0);
         assertEquals(0, openReader.read(charBuffer),
                 "read(CharBuffer) != 0");
     }
 
     @Test
-    public static void testReady() throws IOException {
+    public void testReady() throws IOException {
         assertFalse(openReader.ready());
     }
 
     @Test
-    public static void testSkip() throws IOException {
+    public void testSkip() throws IOException {
         assertEquals(0, openReader.skip(1), "skip() != 0");
     }
 
     @Test
-    public static void testTransferTo() throws IOException {
+    public void testTransferTo() throws IOException {
         assertEquals(0, openReader.transferTo(new StringWriter(7)),
                 "transferTo() != 0");
     }
 
-    @Test(expectedExceptions = IOException.class)
-    public static void testReadClosed() throws IOException {
-        closedReader.read();
+    @Test
+    public void testReadClosed() throws IOException {
+        assertThrows(IOException.class, () -> closedReader.read());
     }
 
-    @Test(expectedExceptions = IOException.class)
-    public static void testReadBIIClosed() throws IOException {
-        closedReader.read(new char[1], 0, 1);
+    @Test
+    public void testReadBIIClosed() throws IOException {
+        assertThrows(IOException.class,
+                     () -> closedReader.read(new char[1], 0, 1));
     }
 
-    @Test(expectedExceptions = IOException.class)
-    public static void testReadCharBufferClosed() throws IOException {
+    @Test
+    public void testReadCharBufferClosed() throws IOException {
         CharBuffer charBuffer = CharBuffer.allocate(0);
-        closedReader.read(charBuffer);
+        assertThrows(IOException.class, () -> closedReader.read(charBuffer));
     }
 
-    @Test(expectedExceptions = IOException.class)
-    public static void testReadCharBufferZeroRemainingClosed() throws IOException {
+    @Test
+    public void testReadCharBufferZeroRemainingClosed() throws IOException {
         CharBuffer charBuffer = CharBuffer.allocate(0);
-        closedReader.read(charBuffer);
+        assertThrows(IOException.class, () -> closedReader.read(charBuffer));
     }
 
-    @Test(expectedExceptions = IOException.class)
-    public static void testReadyClosed() throws IOException {
-        closedReader.ready();
+    @Test
+    public void testReadyClosed() throws IOException {
+        assertThrows(IOException.class, () -> closedReader.ready());
     }
 
-    @Test(expectedExceptions = IOException.class)
-    public static void testSkipClosed() throws IOException {
-        closedReader.skip(1);
+    @Test
+    public void testSkipClosed() throws IOException {
+        assertThrows(IOException.class, () -> closedReader.skip(1));
     }
 
-    @Test(expectedExceptions = IOException.class)
-    public static void testTransferToClosed() throws IOException {
-        closedReader.transferTo(new StringWriter(7));
+    @Test
+    public void testTransferToClosed() throws IOException {
+        assertThrows(IOException.class,
+                     () -> closedReader.transferTo(new StringWriter(7)));
     }
 }
diff --git a/test/jdk/java/io/Reader/Of.java b/test/jdk/java/io/Reader/Of.java
index 491c0499e6b..7d3e039b920 100644
--- a/test/jdk/java/io/Reader/Of.java
+++ b/test/jdk/java/io/Reader/Of.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2024, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -29,15 +29,18 @@ import java.nio.ByteBuffer;
 import java.nio.CharBuffer;
 import java.nio.ReadOnlyBufferException;
 
-import org.testng.annotations.*;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
 
-import static org.testng.Assert.*;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertThrows;
+import static org.junit.jupiter.api.Assertions.assertTrue;
 
 /*
  * @test
  * @bug 8341566
  * @summary Check for expected behavior of Reader.of().
- * @run testng Of
+ * @run junit Of
  */
 public class Of {
     final static String CONTENT = "Some Reader Test";
@@ -45,7 +48,6 @@ public class Of {
     /*
      * Readers to be tested.
      */
-    @DataProvider
     public static Reader[] readers() {
         return new Reader[] {
             new StringReader(CONTENT),
@@ -81,135 +83,152 @@ public class Of {
         };
     }
 
-    @Test(dataProvider = "readers")
+    @ParameterizedTest
+    @MethodSource("readers")
     public void testRead(Reader reader) throws IOException {
         String s = "";
         for (int c; (c = reader.read()) != -1; s += (char) c);
-        assertEquals(s, CONTENT, "read() returned wrong value");
+        assertEquals(CONTENT, s, "read() returned wrong value");
     }
 
-    @Test(dataProvider = "readers")
+    @ParameterizedTest
+    @MethodSource("readers")
     public void testReadBII(Reader reader) throws IOException {
         char[] c = new char[16];
-        assertEquals(reader.read(c, 8, 8), 8,
+        assertEquals(8, reader.read(c, 8, 8),
                 "read(char[],int,int) does not respect given start or end");
-        assertEquals(reader.read(c, 0, 16), 8,
+        assertEquals(8, reader.read(c, 0, 16),
                 "read(char[],int,int) does not respect end of stream");
-        assertEquals(new String(c),
-                CONTENT.substring(8, 16) + CONTENT.substring(0, 8),
+        assertEquals(CONTENT.substring(8, 16) + CONTENT.substring(0, 8),
+                new String(c),
                 "read(char[],int,int) provides wrong content");
     }
 
-    @Test(dataProvider = "readers")
+    @ParameterizedTest
+    @MethodSource("readers")
     public void testReadBIILenZero(Reader reader) throws IOException {
-        assertEquals(reader.read(new char[1], 0, 0), 0,
+        assertEquals(0, reader.read(new char[1], 0, 0),
                 "read(char[],int,int) != 0");
     }
 
-    @Test(dataProvider = "readers")
+    @ParameterizedTest
+    @MethodSource("readers")
     public void testReadDirectCharBuffer(Reader reader) throws IOException {
         CharBuffer charBuffer = ByteBuffer.allocateDirect(32).asCharBuffer();
         charBuffer.position(8);
-        assertEquals(reader.read(charBuffer), 8,
+        assertEquals(8, reader.read(charBuffer),
                 "read(CharBuffer) does not respect position or limit");
         charBuffer.rewind();
-        assertEquals(reader.read(charBuffer), 8,
+        assertEquals(8, reader.read(charBuffer),
                 "read(CharBuffer) does not respect end of stream");
         charBuffer.rewind();
-        assertEquals(charBuffer.toString(),
-                // last part first proofs that copy loops correctly stopped
-                CONTENT.substring(8, 16) + CONTENT.substring(0, 8),
+        // last part first proves that copy loops correctly stopped
+        assertEquals(CONTENT.substring(8, 16) + CONTENT.substring(0, 8),
+                charBuffer.toString(),
                 "read(CharBuffer) provides wrong content");
     }
 
-    @Test(dataProvider = "readers")
+    @ParameterizedTest
+    @MethodSource("readers")
     public void testReadNonDirectCharBuffer(Reader reader) throws IOException {
         CharBuffer charBuffer = CharBuffer.allocate(16);
         charBuffer.position(8);
-        assertEquals(reader.read(charBuffer), 8,
+        assertEquals(8, reader.read(charBuffer),
                 "read(CharBuffer) does not respect position or limit");
         charBuffer.rewind();
-        assertEquals(reader.read(charBuffer), 8,
+        assertEquals(8, reader.read(charBuffer),
                 "read(CharBuffer) does not respect end of stream");
         charBuffer.rewind();
-        assertEquals(charBuffer.toString(),
-                CONTENT.substring(8, 16) + CONTENT.substring(0, 8),
+        assertEquals(CONTENT.substring(8, 16) + CONTENT.substring(0, 8),
+                charBuffer.toString(),
                 "read(CharBuffer) provides wrong content");
     }
 
-    @Test(dataProvider = "readers")
+    @ParameterizedTest
+    @MethodSource("readers")
     public void testReadCharBufferZeroRemaining(Reader reader) throws IOException {
         CharBuffer charBuffer = CharBuffer.allocate(0);
-        assertEquals(reader.read(charBuffer), 0, "read(CharBuffer) != 0");
+        assertEquals(0, reader.read(charBuffer), "read(CharBuffer) != 0");
     }
 
-    @Test(dataProvider = "readers")
+    @ParameterizedTest
+    @MethodSource("readers")
     public void testReady(Reader reader) throws IOException {
         assertTrue(reader.ready());
     }
 
-    @Test(dataProvider = "readers")
+    @ParameterizedTest
+    @MethodSource("readers")
     public void testSkip(Reader reader) throws IOException {
-        assertEquals(reader.skip(8), 8, "skip() does not respect limit");
-        assertEquals(reader.skip(9), 8, "skip() does not respect end of stream");
-        assertEquals(reader.skip(1), 0, "skip() does not respect empty stream");
+        assertEquals(8, reader.skip(8), "skip() does not respect limit");
+        assertEquals(8, reader.skip(9), "skip() does not respect end of stream");
+        assertEquals(0, reader.skip(1), "skip() does not respect empty stream");
     }
 
-    @Test(dataProvider = "readers")
+    @ParameterizedTest
+    @MethodSource("readers")
     public void testTransferTo(Reader reader) throws IOException {
         StringWriter sw = new StringWriter(16);
-        assertEquals(reader.transferTo(sw), 16, "transferTo() != 16");
-        assertEquals(reader.transferTo(sw), 0,
+        assertEquals(16, reader.transferTo(sw), "transferTo() != 16");
+        assertEquals(0, reader.transferTo(sw),
                 "transferTo() does not respect empty stream");
-        assertEquals(sw.toString(), CONTENT,
+        assertEquals(CONTENT, sw.toString(),
                 "transferTo() provides wrong content");
     }
 
-    @Test(dataProvider = "readers")
+    @ParameterizedTest
+    @MethodSource("readers")
     public void testReadClosed(Reader reader) throws IOException {
         reader.close();
         assertThrows(IOException.class, () -> {reader.read();});
     }
 
-    @Test(dataProvider = "readers")
+    @ParameterizedTest
+    @MethodSource("readers")
     public void testReadBIIClosed(Reader reader) throws IOException {
         reader.close();
         assertThrows(IOException.class, () -> reader.read(new char[1], 0, 1));
     }
 
-    @Test(dataProvider = "readers")
+    @ParameterizedTest
+    @MethodSource("readers")
     public void testReadCharBufferClosed(Reader reader) throws IOException {
         CharBuffer charBuffer = CharBuffer.allocate(1);
         reader.close();
         assertThrows(IOException.class, () -> reader.read(charBuffer));
     }
 
-    @Test(dataProvider = "readers")
+    @ParameterizedTest
+    @MethodSource("readers")
     public void testReadCharBufferZeroRemainingClosed(Reader reader) throws IOException {
         CharBuffer charBuffer = CharBuffer.allocate(0);
         reader.close();
         assertThrows(IOException.class, () -> reader.read(charBuffer));
     }
 
-    @Test(dataProvider = "readers")
+    @ParameterizedTest
+    @MethodSource("readers")
     public void testReadyClosed(Reader reader) throws IOException {
         reader.close();
         assertThrows(IOException.class, () -> reader.ready());
     }
 
-    @Test(dataProvider = "readers")
+    @ParameterizedTest
+    @MethodSource("readers")
     public void testSkipClosed(Reader reader) throws IOException {
         reader.close();
         assertThrows(IOException.class, () -> reader.skip(1));
     }
 
-    @Test(dataProvider = "readers")
+    @ParameterizedTest
+    @MethodSource("readers")
     public void testTransferToClosed(Reader reader) throws IOException {
         reader.close();
         assertThrows(IOException.class, () -> reader.transferTo(new StringWriter(1)));
     }
 
-    @Test(dataProvider = "readers")
+    @ParameterizedTest
+    @MethodSource("readers")
     public void testCloseClosed(Reader reader) throws IOException {
         reader.close();
         reader.close();
diff --git a/test/jdk/java/io/Reader/ReadCharBuffer.java b/test/jdk/java/io/Reader/ReadCharBuffer.java
index c57860601fb..dc858999287 100644
--- a/test/jdk/java/io/Reader/ReadCharBuffer.java
+++ b/test/jdk/java/io/Reader/ReadCharBuffer.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2021, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,40 +25,38 @@
  * @test
  * @bug 4926314 8266014
  * @summary Test for Reader#read(CharBuffer).
- * @run testng ReadCharBuffer
+ * @run junit ReadCharBuffer
  */
 
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
-
-
-import java.io.IOException;
 import java.io.BufferedReader;
 import java.io.CharArrayReader;
+import java.io.IOException;
 import java.io.Reader;
 import java.io.UncheckedIOException;
 import java.nio.ByteBuffer;
 import java.nio.CharBuffer;
 import java.util.Arrays;
 import java.util.Objects;
+import java.util.stream.Stream;
 
-import static org.testng.Assert.assertEquals;
+import org.junit.jupiter.api.Test;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
 
-@Test(groups = "unit")
 public class ReadCharBuffer {
 
     private static final int BUFFER_SIZE = 8 + 8192 + 2;
 
-    @DataProvider(name = "buffers")
-    public Object[][] createBuffers() {
+    public static Stream<CharBuffer> buffers() {
         // test both on-heap and off-heap buffers as they make use different code paths
-        return new Object[][]{
-                new Object[]{CharBuffer.allocate(BUFFER_SIZE)},
-                new Object[]{ByteBuffer.allocateDirect(BUFFER_SIZE * 2).asCharBuffer()}
-        };
+        return Stream.of(CharBuffer.allocate(BUFFER_SIZE),
+            ByteBuffer.allocateDirect(BUFFER_SIZE * 2).asCharBuffer());
     }
 
-    @Test(dataProvider = "buffers")
+    @ParameterizedTest
+    @MethodSource("buffers")
     public void read(CharBuffer buffer) throws IOException {
         fillBuffer(buffer);
 
@@ -74,21 +72,21 @@ public class ReadCharBuffer {
             int limit = 1 + 6;
             buffer.limit(limit);
             buffer.position(1);
-            assertEquals(reader.read(buffer), 6);
-            assertEquals(buffer.position(), limit);
-            assertEquals(buffer.limit(), limit);
+            assertEquals(6, reader.read(buffer));
+            assertEquals(limit, buffer.position());
+            assertEquals(limit, buffer.limit());
 
             // read the full temporary buffer
             // and then accurately reduce the next #read call
             limit = 8 + 8192 + 1;
             buffer.limit(8 + 8192 + 1);
             buffer.position(8);
-            assertEquals(reader.read(buffer), 8192 + 1);
-            assertEquals(buffer.position(), limit);
-            assertEquals(buffer.limit(), limit);
+            assertEquals(8192 + 1, reader.read(buffer));
+            assertEquals(limit, buffer.position());
+            assertEquals(limit, buffer.limit());
 
-            assertEquals(reader.read(), 'H');
-            assertEquals(reader.read(), -1);
+            assertEquals('H', reader.read());
+            assertEquals(-1, reader.read());
         }
 
         buffer.clear();
@@ -98,20 +96,15 @@ public class ReadCharBuffer {
             expected.append('y');
         }
         expected.append("Gx");
-        assertEquals(buffer.toString(), expected.toString());
+        assertEquals(expected.toString(), buffer.toString());
     }
 
     @Test
-    public void readZeroLength() {
+    public void readZeroLength() throws IOException {
         char[] buf = new char[] {1, 2, 3};
         BufferedReader r = new BufferedReader(new CharArrayReader(buf));
-        int n = -1;
-        try {
-            n = r.read(CharBuffer.allocate(0));
-        } catch (IOException e) {
-            throw new UncheckedIOException(e);
-        }
-        assertEquals(n, 0);
+        int n = r.read(CharBuffer.allocate(0));
+        assertEquals(0, n);
     }
 
     private void fillBuffer(CharBuffer buffer) {
diff --git a/test/jdk/java/io/Reader/ReadIntoZeroLengthArray.java b/test/jdk/java/io/Reader/ReadIntoZeroLengthArray.java
index 480cd32c981..e69a24d38f4 100644
--- a/test/jdk/java/io/Reader/ReadIntoZeroLengthArray.java
+++ b/test/jdk/java/io/Reader/ReadIntoZeroLengthArray.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2020, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -29,55 +29,57 @@ import java.io.LineNumberReader;
 import java.io.PushbackReader;
 import java.io.Reader;
 import java.io.StringReader;
-import org.testng.Assert;
-import org.testng.annotations.AfterTest;
-import org.testng.annotations.BeforeTest;
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
+import java.util.stream.Stream;
+
+import org.junit.jupiter.api.AfterAll;
+import org.junit.jupiter.api.BeforeAll;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
 
 /*
  * @test
  * @bug 8248383
  * @summary Ensure that zero is returned for read into zero length array
- * @run testng ReadIntoZeroLengthArray
+ * @run junit ReadIntoZeroLengthArray
  */
 public class ReadIntoZeroLengthArray {
-    private File file;
+    private static File file;
 
-    private char[] cbuf0;
-    private char[] cbuf1;
+    private static char[] cbuf0;
+    private static char[] cbuf1;
 
-    @BeforeTest
-    public void setup() throws IOException {
+    @BeforeAll
+    public static void setup() throws IOException {
         file = File.createTempFile("foo", "bar", new File("."));
+
         cbuf0 = new char[0];
         cbuf1 = new char[1];
     }
 
-    @AfterTest
-    public void teardown() throws IOException {
+    @AfterAll
+    public static void teardown() throws IOException {
         file.delete();
     }
 
-    @DataProvider(name = "readers")
-    public Object[][] getReaders() throws IOException {
-        Reader fileReader = new FileReader(file);
-        return new Object[][] {
-            {new LineNumberReader(fileReader)},
-            {new CharArrayReader(new char[] {27})},
-            {new PushbackReader(fileReader)},
-            {fileReader},
-            {new StringReader(new String(new byte[] {(byte)42}))}
-        };
+    public static Stream<Reader> readers() throws IOException {
+        return Stream.of(new LineNumberReader(new FileReader(file)),
+                         new CharArrayReader(new char[] {27}),
+                         new PushbackReader(new FileReader(file)),
+                         new FileReader(file),
+                         new StringReader(new String(new byte[] {(byte)42})));
     }
 
-    @Test(dataProvider = "readers")
+    @ParameterizedTest
+    @MethodSource("readers")
     void test0(Reader r) throws IOException {
-        Assert.assertEquals(r.read(cbuf0), 0);
+        assertEquals(0, r.read(cbuf0));
     }
 
-    @Test(dataProvider = "readers")
+    @ParameterizedTest
+    @MethodSource("readers")
     void test1(Reader r) throws IOException {
-        Assert.assertEquals(r.read(cbuf1, 0, 0), 0);
+        assertEquals(0, r.read(cbuf1, 0, 0));
     }
 }
diff --git a/test/jdk/java/io/Reader/Skip.java b/test/jdk/java/io/Reader/Skip.java
index 9e311686507..80d260d4276 100644
--- a/test/jdk/java/io/Reader/Skip.java
+++ b/test/jdk/java/io/Reader/Skip.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1998, 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1998, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -24,7 +24,7 @@
 /* @test
  * @bug 4134311 8247918
  * @summary Test if skip works correctly
- * @run testng Skip
+ * @run junit Skip
 */
 
 import java.io.CharArrayReader;
@@ -36,10 +36,16 @@ import java.io.PushbackReader;
 import java.io.RandomAccessFile;
 import java.io.Reader;
 import java.io.StringReader;
+import java.util.stream.Stream;
 
-import org.testng.Assert;
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
+import org.junit.jupiter.api.Test;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.Arguments;
+import org.junit.jupiter.params.provider.MethodSource;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertFalse;
+import static org.junit.jupiter.api.Assertions.assertThrows;
 
 public class Skip {
     private static String FILENAME =
@@ -52,52 +58,52 @@ public class Skip {
             long nchars = 8200;
             long actual = fr.skip(nchars);
 
-            Assert.assertFalse(actual > nchars,
+            assertFalse(actual > nchars,
                 "Should skip " + nchars + ", but skipped " +actual+" chars");
         }
     }
 
-    @DataProvider(name = "readers")
-    public Object[][] getReaders() throws IOException {
-        return new Object[][] {
-            {new LineNumberReader(new FileReader(file))},
-            {new CharArrayReader(new char[] {27})},
-            {new PushbackReader(new FileReader(file))},
-            {new FileReader(file)},
-            {new StringReader(new String(new byte[] {(byte)42}))}
+    public static Reader[] readers() throws IOException {
+        return new Reader[] {
+            new LineNumberReader(new FileReader(file)),
+            new CharArrayReader(new char[] {27}),
+            new PushbackReader(new FileReader(file)),
+            new FileReader(file),
+            new StringReader(new String(new byte[] {(byte)42}))
         };
     }
 
-    @Test(dataProvider = "readers")
+    @ParameterizedTest
+    @MethodSource("readers")
     public void eof(Reader r) throws IOException {
          r.skip(Long.MAX_VALUE);
-         Assert.assertEquals(r.skip(1), 0);
-         Assert.assertEquals(r.read(), -1);
+         assertEquals(0, r.skip(1));
+         assertEquals(-1, r.read());
     }
 
-    @DataProvider(name = "skipIAE")
-    public Object[][] getSkipIAEs() throws IOException {
-        return new Object[][] {
-            {new LineNumberReader(new FileReader(file))},
-            {new PushbackReader(new FileReader(file))},
-            {new FileReader(file)}
+    public static Reader[] skipIAE() throws IOException {
+        return new Reader[] {
+            new LineNumberReader(new FileReader(file)),
+            new PushbackReader(new FileReader(file)),
+            new FileReader(file)
         };
     }
 
-    @Test(dataProvider = "skipIAE", expectedExceptions = IllegalArgumentException.class)
+    @ParameterizedTest
+    @MethodSource("skipIAE")
     public void testThrowsIAE(Reader r) throws IOException {
-        r.skip(-1);
+        assertThrows(IllegalArgumentException.class, () -> r.skip(-1));
     }
 
-    @DataProvider(name = "skipNoIAE")
-    public Object[][] getSkipNoIAEs() throws IOException {
-        return new Object[][] {
-            {new CharArrayReader(new char[] {27})},
-            {new StringReader(new String(new byte[] {(byte)42}))}
+    public static Reader[] skipNoIAE() throws IOException {
+        return new Reader[] {
+            new CharArrayReader(new char[] {27}),
+            new StringReader(new String(new byte[] {(byte)42}))
         };
     }
 
-    @Test(dataProvider = "skipNoIAE")
+    @ParameterizedTest
+    @MethodSource("skipNoIAE")
     public void testNoIAE(Reader r) throws IOException {
         r.skip(-1);
     }
diff --git a/test/jdk/java/io/SequenceInputStream/TransferTo.java b/test/jdk/java/io/SequenceInputStream/TransferTo.java
index 4c8ff71a4f3..8ea9a77672e 100644
--- a/test/jdk/java/io/SequenceInputStream/TransferTo.java
+++ b/test/jdk/java/io/SequenceInputStream/TransferTo.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2022, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2022, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -33,22 +33,22 @@ import java.util.concurrent.atomic.AtomicReference;
 import java.util.function.Consumer;
 import java.util.function.Supplier;
 
-import org.testng.annotations.Test;
+import static java.lang.String.format;
 
 import jdk.test.lib.RandomFactory;
 
-import static java.lang.String.format;
+import org.junit.jupiter.api.Test;
 
-import static org.testng.Assert.assertEquals;
-import static org.testng.Assert.assertNotEquals;
-import static org.testng.Assert.assertThrows;
-import static org.testng.Assert.assertTrue;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertNotEquals;
+import static org.junit.jupiter.api.Assertions.assertThrows;
+import static org.junit.jupiter.api.Assertions.assertTrue;
 
 /*
  * @test
  * @library /test/lib
  * @build jdk.test.lib.RandomFactory
- * @run testng/othervm/timeout=180 TransferTo
+ * @run junit/othervm/timeout=180 TransferTo
  * @bug 8297298
  * @summary Tests whether java.io.SequenceInputStream.transferTo conforms to the
  *          InputStream.transferTo specification
@@ -141,8 +141,8 @@ public class TransferTo {
         SequenceInputStream sis = new SequenceInputStream(is1, is2);
         OutputStream nos = OutputStream.nullOutputStream();
         sis.transferTo(nos);
-        assertEquals(is1.available(), 0);
-        assertEquals(is2.available(), 0);
+        assertEquals(0, is1.available());
+        assertEquals(0, is2.available());
     }
 
     /*
@@ -200,7 +200,7 @@ public class TransferTo {
             long reported = in.transferTo(out);
             int count = inBytes.length - posIn;
 
-            assertEquals(reported, count,
+            assertEquals(count, reported,
                     format("reported %d bytes but should report %d", reported, count));
 
             byte[] outBytes = recorder.get().get();
diff --git a/test/jdk/java/io/Writer/NullWriter.java b/test/jdk/java/io/Writer/NullWriter.java
index d632947f129..e37c8bd54dd 100644
--- a/test/jdk/java/io/Writer/NullWriter.java
+++ b/test/jdk/java/io/Writer/NullWriter.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -21,144 +21,146 @@
  * questions.
  */
 
-import org.testng.annotations.AfterClass;
-import org.testng.annotations.BeforeClass;
-import org.testng.annotations.Test;
-
 import java.io.IOException;
 import java.io.Writer;
 
-import static org.testng.Assert.assertNotNull;
-import static org.testng.Assert.assertSame;
+import org.junit.jupiter.api.AfterAll;
+import org.junit.jupiter.api.BeforeAll;
+import org.junit.jupiter.api.Test;
+
+import static org.junit.jupiter.api.Assertions.assertNotNull;
+import static org.junit.jupiter.api.Assertions.assertSame;
+import static org.junit.jupiter.api.Assertions.assertThrows;
 
 /*
  * @test
  * @bug 8196298
- * @run testng NullWriter
+ * @run junit NullWriter
  * @summary Check for expected behavior of Writer.nullWriter().
  */
 public class NullWriter {
     private static Writer openWriter;
     private static Writer closedWriter;
 
-    @BeforeClass
+    @BeforeAll
     public static void setup() throws IOException {
         openWriter = Writer.nullWriter();
         closedWriter = Writer.nullWriter();
         closedWriter.close();
     }
 
-    @AfterClass
+    @AfterAll
     public static void closeStream() throws IOException {
         openWriter.close();
     }
 
     @Test
-    public static void testOpen() {
+    public void testOpen() {
         assertNotNull(openWriter, "Writer.nullWriter() returned null");
     }
 
     @Test
-    public static void testAppendChar() throws IOException {
+    public void testAppendChar() throws IOException {
         assertSame(openWriter, openWriter.append('x'));
     }
 
     @Test
-    public static void testAppendCharSequence() throws IOException {
+    public void testAppendCharSequence() throws IOException {
         CharSequence cs = "abc";
         assertSame(openWriter, openWriter.append(cs));
     }
 
     @Test
-    public static void testAppendCharSequenceNull() throws IOException {
+    public void testAppendCharSequenceNull() throws IOException {
         assertSame(openWriter, openWriter.append(null));
     }
 
     @Test
-    public static void testAppendCharSequenceII() throws IOException {
+    public void testAppendCharSequenceII() throws IOException {
         CharSequence cs = "abc";
         assertSame(openWriter, openWriter.append(cs, 0, 1));
     }
 
     @Test
-    public static void testAppendCharSequenceIINull() throws IOException {
+    public void testAppendCharSequenceIINull() throws IOException {
         assertSame(openWriter, openWriter.append(null, 2, 1));
     }
 
     @Test
-    public static void testFlush() throws IOException {
+    public void testFlush() throws IOException {
         openWriter.flush();
     }
 
     @Test
-    public static void testWrite() throws IOException {
+    public void testWrite() throws IOException {
         openWriter.write(62832);
     }
 
     @Test
-    public static void testWriteString() throws IOException {
+    public void testWriteString() throws IOException {
         openWriter.write("");
     }
 
     @Test
-    public static void testWriteStringII() throws IOException {
+    public void testWriteStringII() throws IOException {
         openWriter.write("", 0, 0);
     }
 
     @Test
-    public static void testWriteBII() throws IOException, Exception {
+    public void testWriteBII() throws IOException, Exception {
         openWriter.write(new char[]{(char) 6}, 0, 1);
     }
 
-    @Test(expectedExceptions = IOException.class)
-    public static void testAppendCharClosed() throws IOException {
-        closedWriter.append('x');
+    @Test
+    public void testAppendCharClosed() throws IOException {
+        assertThrows(IOException.class, () -> closedWriter.append('x'));
     }
 
-    @Test(expectedExceptions = IOException.class)
-    public static void testAppendCharSequenceClosed() throws IOException {
+    @Test
+    public void testAppendCharSequenceClosed() throws IOException {
         CharSequence cs = "abc";
-        closedWriter.append(cs);
+        assertThrows(IOException.class, () -> closedWriter.append(cs));
     }
 
-    @Test(expectedExceptions = IOException.class)
-    public static void testAppendCharSequenceNullClosed() throws IOException {
-        closedWriter.append(null);
+    @Test
+    public void testAppendCharSequenceNullClosed() throws IOException {
+        assertThrows(IOException.class, () -> closedWriter.append(null));
     }
 
-    @Test(expectedExceptions = IOException.class)
-    public static void testAppendCharSequenceIIClosed() throws IOException {
+    @Test
+    public void testAppendCharSequenceIIClosed() throws IOException {
         CharSequence cs = "abc";
-        closedWriter.append(cs, 0, 1);
+        assertThrows(IOException.class, () -> closedWriter.append(cs, 0, 1));
     }
 
-    @Test(expectedExceptions = IOException.class)
-    public static void testAppendCharSequenceIINullClosed() throws IOException {
-        closedWriter.append(null, 2, 1);
+    @Test
+    public void testAppendCharSequenceIINullClosed() throws IOException {
+        assertThrows(IOException.class, () -> closedWriter.append(null, 2, 1));
     }
 
-    @Test(expectedExceptions = IOException.class)
-    public static void testFlushClosed() throws IOException {
-        closedWriter.flush();
+    @Test
+    public void testFlushClosed() throws IOException {
+        assertThrows(IOException.class, () -> closedWriter.flush());
     }
 
-    @Test(expectedExceptions = IOException.class)
-    public static void testWriteClosed() throws IOException {
-        closedWriter.write(62832);
+    @Test
+    public void testWriteClosed() throws IOException {
+        assertThrows(IOException.class, () -> closedWriter.write(62832));
     }
 
-    @Test(expectedExceptions = IOException.class)
-    public static void testWriteStringClosed() throws IOException {
-        closedWriter.write("");
+    @Test
+    public void testWriteStringClosed() throws IOException {
+        assertThrows(IOException.class, () -> closedWriter.write(""));
     }
 
-    @Test(expectedExceptions = IOException.class)
-    public static void testWriteStringIIClosed() throws IOException {
-        closedWriter.write("", 0, 0);
+    @Test
+    public void testWriteStringIIClosed() throws IOException {
+        assertThrows(IOException.class, () -> closedWriter.write("", 0, 0));
     }
 
-    @Test(expectedExceptions = IOException.class)
-    public static void testWriteBIIClosed() throws IOException {
-        closedWriter.write(new char[]{(char) 6}, 0, 1);
+    @Test
+    public void testWriteBIIClosed() throws IOException {
+        assertThrows(IOException.class,
+                     () -> closedWriter.write(new char[]{(char) 6}, 0, 1));
     }
 }

From 615aba8257460edd08dc1d825d9394d98cef8e35 Mon Sep 17 00:00:00 2001
From: Alexey Ivanov <aivanov@openjdk.org>
Date: Thu, 19 Mar 2026 20:30:18 +0000
Subject: [PATCH 269/655] 8374304: MultiResolutionSplashTest.java fails in CI:
 "Image with wrong resolution is used for splash screen!"

Reviewed-by: dmarkov, prr
---
 .../MultiResolutionSplashTest.java            | 185 +++++++++---------
 1 file changed, 89 insertions(+), 96 deletions(-)

diff --git a/test/jdk/java/awt/SplashScreen/MultiResolutionSplash/MultiResolutionSplashTest.java b/test/jdk/java/awt/SplashScreen/MultiResolutionSplash/MultiResolutionSplashTest.java
index 1f2de081cce..c0a9c90feba 100644
--- a/test/jdk/java/awt/SplashScreen/MultiResolutionSplash/MultiResolutionSplashTest.java
+++ b/test/jdk/java/awt/SplashScreen/MultiResolutionSplash/MultiResolutionSplashTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2014, 2023, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2014, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -22,30 +22,25 @@
  */
 
 import java.awt.Color;
-import java.awt.Dialog;
 import java.awt.Frame;
 import java.awt.Graphics;
-import java.awt.Graphics2D;
 import java.awt.GraphicsEnvironment;
-import java.awt.Panel;
 import java.awt.Rectangle;
 import java.awt.Robot;
 import java.awt.SplashScreen;
 import java.awt.TextField;
-import java.awt.Window;
 import java.awt.event.KeyEvent;
 import java.awt.image.BufferedImage;
 import java.io.File;
+import java.io.IOException;
+
 import javax.imageio.ImageIO;
-import sun.java2d.SunGraphics2D;
 
-
-/**
+/*
  * @test
  * @key headful
  * @bug 8043869 8075244 8078082 8145173 8151787 8212213
  * @summary Tests the HiDPI splash screen support for windows and MAC
- * @modules java.desktop/sun.java2d
  * @run main MultiResolutionSplashTest GENERATE_IMAGES
  * @run main/othervm -splash:splash1.png MultiResolutionSplashTest TEST_SPLASH 0
  * @run main/othervm -splash:splash2 MultiResolutionSplashTest TEST_SPLASH 1
@@ -56,47 +51,54 @@ public class MultiResolutionSplashTest {
 
     private static final int IMAGE_WIDTH = 300;
     private static final int IMAGE_HEIGHT = 200;
-    private static boolean isMac;
 
-    static {
-        isMac = System.getProperty("os.name").contains("OS X");
-    }
+    private static final boolean isMac = System.getProperty("os.name")
+                                               .contains("OS X");
+
     private static final ImageInfo[] tests = {
-        new ImageInfo("splash1.png", "splash1@2x.png", Color.BLUE, Color.GREEN),
-        new ImageInfo("splash2", "splash2@2x", Color.WHITE, Color.BLACK),
-        new ImageInfo("splash3.", "splash3@2x.", Color.YELLOW, Color.RED)
+        new ImageInfo("splash1", ".png", Color.BLUE,   Color.GREEN),
+        new ImageInfo("splash2", "",     Color.WHITE,  Color.BLACK),
+        new ImageInfo("splash3", ".",    Color.YELLOW, Color.RED)
     };
 
     public static void main(String[] args) throws Exception {
-
-        String test = args[0];
-        switch (test) {
+        switch (args[0]) {
             case "GENERATE_IMAGES":
                 generateImages();
                 break;
             case "TEST_SPLASH":
-                int index = Integer.parseInt(args[1]);
-                testSplash(tests[index]);
+                testSplash(tests[Integer.parseInt(args[1])]);
                 break;
             case "TEST_FOCUS":
                 testFocus();
                 break;
             default:
-                throw new RuntimeException("Unknown test: " + test);
+                throw new RuntimeException("Unknown test: " + args[0]);
         }
     }
 
     static void testSplash(ImageInfo test) throws Exception {
         SplashScreen splashScreen = SplashScreen.getSplashScreen();
-
         if (splashScreen == null) {
             throw new RuntimeException("Splash screen is not shown!");
         }
 
-        Graphics2D g = splashScreen.createGraphics();
-        Rectangle splashBounds = splashScreen.getBounds();
-        int screenX = (int) splashBounds.getCenterX();
-        int screenY = (int) splashBounds.getCenterY();
+        final Rectangle splashBounds = splashScreen.getBounds();
+        final double scaleFactor = getScreenScaleFactor();
+
+        final Robot robot = new Robot();
+        // Allow time for the splash screen to show
+        robot.delay(100);
+
+        BufferedImage splashCapture = robot.createScreenCapture(splashBounds);
+        String captureFileName = "splashscreen-%1.2f-%s.png"
+                                 .formatted(scaleFactor, test.name1x);
+        saveImageNoError(splashCapture, new File(captureFileName));
+
+        // Close the splash screen; this gives time for it to be fully removed
+        splashScreen.close();
+        robot.waitForIdle();
+
         if (splashBounds.width != IMAGE_WIDTH) {
             throw new RuntimeException(
                     "SplashScreen#getBounds has wrong width");
@@ -106,19 +108,19 @@ public class MultiResolutionSplashTest {
                     "SplashScreen#getBounds has wrong height");
         }
 
-        Robot robot = new Robot();
-        Color splashScreenColor = robot.getPixelColor(screenX, screenY);
-        float scaleFactor = getScaleFactor();
+        Color splashScreenColor =
+                new Color(splashCapture.getRGB(splashBounds.width / 2,
+                                               splashBounds.height / 2));
         Color testColor = (1 < scaleFactor) ? test.color2x : test.color1x;
 
         if (!compare(testColor, splashScreenColor)) {
             throw new RuntimeException(
-                    "Image with wrong resolution is used for splash screen!");
+                    "Image with wrong resolution is used for splash screen! "
+                    + "Refer to " + captureFileName);
         }
     }
 
     static void testFocus() throws Exception {
-
         Robot robot = new Robot();
         robot.setAutoWaitForIdle(true);
         robot.setAutoDelay(50);
@@ -157,94 +159,85 @@ public class MultiResolutionSplashTest {
         return Math.abs(n - m) <= 50;
     }
 
-    static float getScaleFactor() {
-
-        final Dialog dialog = new Dialog((Window) null);
-        dialog.setSize(100, 100);
-        dialog.setModal(true);
-        final float[] scaleFactors = new float[1];
-        Panel panel = new Panel() {
-
-            @Override
-            public void paint(Graphics g) {
-                float scaleFactor = 1;
-                if (g instanceof SunGraphics2D) {
-                    scaleFactor = getScreenScaleFactor();
-                }
-                scaleFactors[0] = scaleFactor;
-                dialog.setVisible(false);
-            }
-        };
-
-        dialog.add(panel);
-        dialog.setVisible(true);
-        dialog.dispose();
-
-        return scaleFactors[0];
-    }
-
     static void generateImages() throws Exception {
         for (ImageInfo test : tests) {
-            generateImage(test.name1x, test.color1x, 1);
-            generateImage(test.name2x, test.color2x, getScreenScaleFactor());
+            generateImage(test.name1x, test.color1x, 1.0);
+
+            // Ensure the second image uses scale greater than 1.0
+            double scale = getAdjustedScaleFactor();
+            generateImage(test.name2x, test.color2x, scale);
         }
     }
 
-    static void generateImage(String name, Color color, float scale) throws Exception {
+    static void generateImage(final String name,
+                              final Color color,
+                              final double scale) throws Exception {
         File file = new File(name);
         if (file.exists()) {
             return;
         }
-        BufferedImage image = new BufferedImage((int) (scale * IMAGE_WIDTH),
-                (int) (scale * IMAGE_HEIGHT), BufferedImage.TYPE_INT_RGB);
+
+        final int width = (int) (scale * IMAGE_WIDTH);
+        final int height = (int) (scale * IMAGE_HEIGHT);
+        BufferedImage image = new BufferedImage(width,
+                                                height,
+                                                BufferedImage.TYPE_INT_RGB);
         Graphics g = image.getGraphics();
         g.setColor(color);
-        g.fillRect(0, 0, (int) (scale * IMAGE_WIDTH), (int) (scale * IMAGE_HEIGHT));
+        g.fillRect(0, 0, width, height);
+
+        saveImage(image, file);
+    }
+
+    private static void saveImage(BufferedImage image,
+                                  File file) throws IOException {
         ImageIO.write(image, "png", file);
     }
 
-    static float getScreenScaleFactor() {
-        return (float) GraphicsEnvironment.
-                getLocalGraphicsEnvironment().
-                getDefaultScreenDevice().getDefaultConfiguration().
-                getDefaultTransform().getScaleX();
+    private static void saveImageNoError(BufferedImage image,
+                                         File file) {
+        try {
+            saveImage(image, file);
+        } catch (IOException ignored) {
+        }
+    }
+
+    static double getScreenScaleFactor() {
+        return GraphicsEnvironment
+               .getLocalGraphicsEnvironment()
+               .getDefaultScreenDevice()
+               .getDefaultConfiguration()
+               .getDefaultTransform()
+               .getScaleX();
+    }
+
+    // Ensure the second image uses scale greater than 1.0
+    static double getAdjustedScaleFactor() {
+        double scale = getScreenScaleFactor();
+        return scale < 1.25 ? 2.0 : scale;
     }
 
     static class ImageInfo {
-
         final String name1x;
         final String name2x;
         final Color color1x;
         final Color color2x;
 
-        public ImageInfo(String name1x, String name2x, Color color1x, Color color2x) {
-            this.name1x = name1x;
-            if (!isMac) {
-                float scale = getScreenScaleFactor();
-                StringBuffer buff = new StringBuffer();
-                if (scale - (int) scale > 0) {
-                    buff.append("@").append((int) (scale * 100)).append("pct");
-                } else {
-                    buff.append("@").append((int) scale).append("x");
-                }
-                StringBuffer buffer = new StringBuffer();
-                String[] splitStr = name1x.split("\\.");
-                if (splitStr.length == 2) {
-                    this.name2x = buffer.append(splitStr[0]).append(buff)
-                            .append(".").append(splitStr[1]).toString();
-                } else {
-                    if (name1x.indexOf(".") > 0) {
-                        this.name2x = buffer.append(splitStr[0]).append(buff).append(".").toString();
-                    } else {
-                        this.name2x = buffer.append(splitStr[0]).append(buff).toString();
-                    }
-                }
-            } else {
-                this.name2x = name2x;
-            }
+        public ImageInfo(String baseName, String ext,
+                         Color color1x, Color color2x) {
+            this.name1x = baseName + ext;
+            this.name2x = createName2x(baseName, ext);
             this.color1x = color1x;
             this.color2x = color2x;
         }
+
+        private static String createName2x(String baseName, String ext) {
+            double scale = getAdjustedScaleFactor();
+            if (!isMac && (((int) (scale * 100)) % 100 != 0)) {
+                return baseName + "@" + ((int) (scale * 100)) + "pct" + ext;
+            } else {
+                return baseName + "@" + ((int) scale) + "x" + ext;
+            }
+        }
     }
 }
-

From 96f6ffbff49e39d6efd5bddd8f8b0a55ea696aa7 Mon Sep 17 00:00:00 2001
From: Alexey Semenyuk <asemenyuk@openjdk.org>
Date: Thu, 19 Mar 2026 21:59:55 +0000
Subject: [PATCH 270/655] 8278591: Jpackage post installation information
 message

Reviewed-by: almatvee, erikj
---
 make/modules/jdk.jpackage/Java.gmk            |   4 +-
 .../jpackage/internal/cli/StandardOption.java |   2 +
 .../resources/HelpResources.properties        |   4 +-
 src/jdk.jpackage/share/man/jpackage.md        |   6 +-
 .../jdk/jpackage/internal/MsiMutator.java     |  56 ++
 .../jdk/jpackage/internal/WinFromOptions.java |   2 +
 .../internal/WinMsiPackageBuilder.java        |   9 +-
 .../jdk/jpackage/internal/WinMsiPackager.java |  37 +-
 .../jpackage/internal/WixFragmentBuilder.java |  14 +-
 .../jdk/jpackage/internal/WixPipeline.java    | 179 +++---
 .../internal/WixUiFragmentBuilder.java        | 520 ++++++------------
 .../jdk/jpackage/internal/WixVariables.java   |  97 +++-
 .../internal/model/WinMsiPackageMixin.java    |  18 +-
 .../internal/resources/msi-disable-actions.js |  79 +++
 .../jdk/jpackage/internal/wixui/Control.java  |  36 ++
 .../jpackage/internal/wixui/CustomDialog.java |  38 ++
 .../jdk/jpackage/internal/wixui/Dialog.java   |  36 ++
 .../jpackage/internal/wixui/DialogPair.java   |  49 ++
 .../jdk/jpackage/internal/wixui/Publish.java  |  92 ++++
 .../internal/wixui/ShowActionSuppresser.java  |  72 +++
 .../internal/wixui/StandardControl.java       |  47 ++
 .../jdk/jpackage/internal/wixui/UIConfig.java |  79 +++
 .../jdk/jpackage/internal/wixui/UISpec.java   | 293 ++++++++++
 .../jpackage/internal/wixui/WixDialog.java    |  43 ++
 .../jdk/jpackage/internal/wixui/WixUI.java    |  46 ++
 .../jdk/jpackage/test/MsiDatabase.java        | 135 ++++-
 .../jdk/jpackage/test/WindowsHelper.java      |   9 +
 .../jpackage/internal/cli/help-windows.txt    |   2 +
 .../jpackage/internal/cli/jpackage-options.md |   1 +
 .../jpackage/internal/WixVariablesTest.java   | 269 +++++++++
 .../jpackage/internal/wixui/UISpecTest.java   |  85 +++
 .../tools/jpackage/junit/windows/junit.java   |  19 +-
 .../ControlEvents.md                          |   8 +
 .../InstallUISequence.md                      |   3 +
 .../dir_chooser+license/ControlEvents.md      |   4 +
 .../dir_chooser+license/InstallUISequence.md  |   3 +
 .../ControlEvents.md                          |  10 +
 .../InstallUISequence.md                      |   3 +
 .../dir_chooser/ControlEvents.md              |   6 +
 .../dir_chooser/InstallUISequence.md          |   3 +
 .../license+shortcut_prompt/ControlEvents.md  |   7 +
 .../InstallUISequence.md                      |   3 +
 .../license/ControlEvents.md                  |   2 +
 .../license/InstallUISequence.md              |   4 +
 .../shortcut_prompt/ControlEvents.md          |   7 +
 .../shortcut_prompt/InstallUISequence.md      |   3 +
 .../WinInstallerUiTest/ui/ControlEvents.md    |   2 +
 .../ui/InstallUISequence.md                   |   4 +
 .../tools/jpackage/resources/msi-export.js    |   4 +-
 .../jpackage/windows/WinInstallerUiTest.java  | 332 ++++++++---
 .../tools/jpackage/windows/WinL10nTest.java   |  31 +-
 51 files changed, 2219 insertions(+), 598 deletions(-)
 create mode 100644 src/jdk.jpackage/windows/classes/jdk/jpackage/internal/MsiMutator.java
 create mode 100644 src/jdk.jpackage/windows/classes/jdk/jpackage/internal/resources/msi-disable-actions.js
 create mode 100644 src/jdk.jpackage/windows/classes/jdk/jpackage/internal/wixui/Control.java
 create mode 100644 src/jdk.jpackage/windows/classes/jdk/jpackage/internal/wixui/CustomDialog.java
 create mode 100644 src/jdk.jpackage/windows/classes/jdk/jpackage/internal/wixui/Dialog.java
 create mode 100644 src/jdk.jpackage/windows/classes/jdk/jpackage/internal/wixui/DialogPair.java
 create mode 100644 src/jdk.jpackage/windows/classes/jdk/jpackage/internal/wixui/Publish.java
 create mode 100644 src/jdk.jpackage/windows/classes/jdk/jpackage/internal/wixui/ShowActionSuppresser.java
 create mode 100644 src/jdk.jpackage/windows/classes/jdk/jpackage/internal/wixui/StandardControl.java
 create mode 100644 src/jdk.jpackage/windows/classes/jdk/jpackage/internal/wixui/UIConfig.java
 create mode 100644 src/jdk.jpackage/windows/classes/jdk/jpackage/internal/wixui/UISpec.java
 create mode 100644 src/jdk.jpackage/windows/classes/jdk/jpackage/internal/wixui/WixDialog.java
 create mode 100644 src/jdk.jpackage/windows/classes/jdk/jpackage/internal/wixui/WixUI.java
 create mode 100644 test/jdk/tools/jpackage/junit/windows/jdk.jpackage/jdk/jpackage/internal/WixVariablesTest.java
 create mode 100644 test/jdk/tools/jpackage/junit/windows/jdk.jpackage/jdk/jpackage/internal/wixui/UISpecTest.java
 create mode 100644 test/jdk/tools/jpackage/resources/WinInstallerUiTest/dir_chooser+license+shortcut_prompt/ControlEvents.md
 create mode 100644 test/jdk/tools/jpackage/resources/WinInstallerUiTest/dir_chooser+license+shortcut_prompt/InstallUISequence.md
 create mode 100644 test/jdk/tools/jpackage/resources/WinInstallerUiTest/dir_chooser+license/ControlEvents.md
 create mode 100644 test/jdk/tools/jpackage/resources/WinInstallerUiTest/dir_chooser+license/InstallUISequence.md
 create mode 100644 test/jdk/tools/jpackage/resources/WinInstallerUiTest/dir_chooser+shortcut_prompt/ControlEvents.md
 create mode 100644 test/jdk/tools/jpackage/resources/WinInstallerUiTest/dir_chooser+shortcut_prompt/InstallUISequence.md
 create mode 100644 test/jdk/tools/jpackage/resources/WinInstallerUiTest/dir_chooser/ControlEvents.md
 create mode 100644 test/jdk/tools/jpackage/resources/WinInstallerUiTest/dir_chooser/InstallUISequence.md
 create mode 100644 test/jdk/tools/jpackage/resources/WinInstallerUiTest/license+shortcut_prompt/ControlEvents.md
 create mode 100644 test/jdk/tools/jpackage/resources/WinInstallerUiTest/license+shortcut_prompt/InstallUISequence.md
 create mode 100644 test/jdk/tools/jpackage/resources/WinInstallerUiTest/license/ControlEvents.md
 create mode 100644 test/jdk/tools/jpackage/resources/WinInstallerUiTest/license/InstallUISequence.md
 create mode 100644 test/jdk/tools/jpackage/resources/WinInstallerUiTest/shortcut_prompt/ControlEvents.md
 create mode 100644 test/jdk/tools/jpackage/resources/WinInstallerUiTest/shortcut_prompt/InstallUISequence.md
 create mode 100644 test/jdk/tools/jpackage/resources/WinInstallerUiTest/ui/ControlEvents.md
 create mode 100644 test/jdk/tools/jpackage/resources/WinInstallerUiTest/ui/InstallUISequence.md

diff --git a/make/modules/jdk.jpackage/Java.gmk b/make/modules/jdk.jpackage/Java.gmk
index da66fc14009..1fd4d527217 100644
--- a/make/modules/jdk.jpackage/Java.gmk
+++ b/make/modules/jdk.jpackage/Java.gmk
@@ -1,5 +1,5 @@
 #
-# Copyright (c) 2020, 2025, Oracle and/or its affiliates. All rights reserved.
+# Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
 # DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
 #
 # This code is free software; you can redistribute it and/or modify it
@@ -29,7 +29,7 @@ DISABLED_WARNINGS_java += dangling-doc-comments
 
 COPY += .gif .png .txt .spec .script .prerm .preinst \
     .postrm .postinst .list .sh .desktop .copyright .control .plist .template \
-    .icns .scpt .wxs .wxl .wxi .wxf .ico .bmp .tiff .service .xsl
+    .icns .scpt .wxs .wxl .wxi .wxf .ico .bmp .tiff .service .xsl .js
 
 CLEAN += .properties
 
diff --git a/src/jdk.jpackage/share/classes/jdk/jpackage/internal/cli/StandardOption.java b/src/jdk.jpackage/share/classes/jdk/jpackage/internal/cli/StandardOption.java
index f554fc12ec6..c2338b87fad 100644
--- a/src/jdk.jpackage/share/classes/jdk/jpackage/internal/cli/StandardOption.java
+++ b/src/jdk.jpackage/share/classes/jdk/jpackage/internal/cli/StandardOption.java
@@ -400,6 +400,8 @@ public final class StandardOption {
 
     public static final OptionValue<Boolean> WIN_INSTALLDIR_CHOOSER = booleanOption("win-dir-chooser").scope(nativeBundling()).create();
 
+    public static final OptionValue<Boolean> WIN_WITH_UI = booleanOption("win-with-ui").scope(nativeBundling()).create();
+
     public static final OptionValue<UUID> WIN_UPGRADE_UUID = uuidOption("win-upgrade-uuid").scope(nativeBundling()).create();
 
     public static final OptionValue<Boolean> WIN_CONSOLE_HINT = booleanOption("win-console")
diff --git a/src/jdk.jpackage/share/classes/jdk/jpackage/internal/resources/HelpResources.properties b/src/jdk.jpackage/share/classes/jdk/jpackage/internal/resources/HelpResources.properties
index 466f58ee68e..0b2ca83a7d7 100644
--- a/src/jdk.jpackage/share/classes/jdk/jpackage/internal/resources/HelpResources.properties
+++ b/src/jdk.jpackage/share/classes/jdk/jpackage/internal/resources/HelpResources.properties
@@ -1,5 +1,5 @@
 #
-# Copyright (c) 2017, 2025, Oracle and/or its affiliates. All rights reserved.
+# Copyright (c) 2017, 2026, Oracle and/or its affiliates. All rights reserved.
 # DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
 #
 # This code is free software; you can redistribute it and/or modify it
@@ -426,3 +426,5 @@ help.option.win-update-url=\
 help.option.win-upgrade-uuid=\
 \          UUID associated with upgrades for this package
 
+help.option.win-with-ui=\
+\          Enforces the installer to have UI
diff --git a/src/jdk.jpackage/share/man/jpackage.md b/src/jdk.jpackage/share/man/jpackage.md
index f78bec9808c..9ba5949866f 100644
--- a/src/jdk.jpackage/share/man/jpackage.md
+++ b/src/jdk.jpackage/share/man/jpackage.md
@@ -1,5 +1,5 @@
 ---
-# Copyright (c) 2018, 2025, Oracle and/or its affiliates. All rights reserved.
+# Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
 # DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
 #
 # This code is free software; you can redistribute it and/or modify it
@@ -436,6 +436,10 @@ The `jpackage` tool will take as input a Java application and a Java run-time im
 
 :   UUID associated with upgrades for this package
 
+<a id="option-win-with-ui">`--win-with-ui`</a>
+
+:   Enforces the installer to have UI
+
 #### Linux platform options (available only when running on Linux):
 
 <a id="option-linux-package-name">`--linux-package-name` *name*</a>
diff --git a/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/MsiMutator.java b/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/MsiMutator.java
new file mode 100644
index 00000000000..592cc55c0df
--- /dev/null
+++ b/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/MsiMutator.java
@@ -0,0 +1,56 @@
+/*
+ * Copyright (c) 2021, 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.  Oracle designates this
+ * particular file as subject to the "Classpath" exception as provided
+ * by Oracle in the LICENSE file that accompanied this code.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+package jdk.jpackage.internal;
+
+import java.io.IOException;
+import java.nio.file.Files;
+import java.nio.file.Path;
+import java.util.Objects;
+import jdk.jpackage.internal.resources.ResourceLocator;
+
+/**
+ * WSH script altering cooked .msi file.
+ */
+record MsiMutator(String scriptResourceName) {
+
+    MsiMutator {
+        Objects.requireNonNull(scriptResourceName);
+        if (Path.of(scriptResourceName).getNameCount() != 1) {
+            throw new IllegalArgumentException();
+        }
+    }
+
+    void addToConfigRoot(Path configRoot) throws IOException {
+        var scriptFile = configRoot.resolve(pathInConfigRoot());
+        try (var in = ResourceLocator.class.getResourceAsStream(scriptResourceName)) {
+            Files.createDirectories(scriptFile.getParent());
+            Files.copy(in, scriptFile);
+        }
+    }
+
+    Path pathInConfigRoot() {
+        return Path.of(scriptResourceName);
+    }
+}
diff --git a/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/WinFromOptions.java b/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/WinFromOptions.java
index f6080523e89..59701777396 100644
--- a/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/WinFromOptions.java
+++ b/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/WinFromOptions.java
@@ -39,6 +39,7 @@ import static jdk.jpackage.internal.cli.StandardOption.WIN_SHORTCUT_HINT;
 import static jdk.jpackage.internal.cli.StandardOption.WIN_SHORTCUT_PROMPT;
 import static jdk.jpackage.internal.cli.StandardOption.WIN_UPDATE_URL;
 import static jdk.jpackage.internal.cli.StandardOption.WIN_UPGRADE_UUID;
+import static jdk.jpackage.internal.cli.StandardOption.WIN_WITH_UI;
 import static jdk.jpackage.internal.model.StandardPackageType.WIN_MSI;
 
 import jdk.jpackage.internal.cli.Options;
@@ -93,6 +94,7 @@ final class WinFromOptions {
         WIN_UPDATE_URL.ifPresentIn(options, pkgBuilder::updateURL);
         WIN_INSTALLDIR_CHOOSER.ifPresentIn(options, pkgBuilder::withInstallDirChooser);
         WIN_SHORTCUT_PROMPT.ifPresentIn(options, pkgBuilder::withShortcutPrompt);
+        WIN_WITH_UI.ifPresentIn(options, pkgBuilder::withUi);
 
         if (app.isService()) {
             RESOURCE_DIR.ifPresentIn(options, resourceDir -> {
diff --git a/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/WinMsiPackageBuilder.java b/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/WinMsiPackageBuilder.java
index 7695cf04ac1..c2564028ecb 100644
--- a/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/WinMsiPackageBuilder.java
+++ b/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/WinMsiPackageBuilder.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2025, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -65,6 +65,7 @@ final class WinMsiPackageBuilder {
                 MsiVersion.of(pkg.version()),
                 withInstallDirChooser,
                 withShortcutPrompt,
+                withUi,
                 Optional.ofNullable(helpURL),
                 Optional.ofNullable(updateURL),
                 Optional.ofNullable(startMenuGroupName).orElseGet(DEFAULTS::startMenuGroupName),
@@ -92,6 +93,11 @@ final class WinMsiPackageBuilder {
         return this;
     }
 
+    WinMsiPackageBuilder withUi(boolean v) {
+        withUi = v;
+        return this;
+    }
+
     WinMsiPackageBuilder helpURL(String v) {
         helpURL = v;
         return this;
@@ -131,6 +137,7 @@ final class WinMsiPackageBuilder {
 
     private boolean withInstallDirChooser;
     private boolean withShortcutPrompt;
+    private boolean withUi;
     private String helpURL;
     private String updateURL;
     private String startMenuGroupName;
diff --git a/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/WinMsiPackager.java b/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/WinMsiPackager.java
index a53d083847a..3eb7b10b846 100644
--- a/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/WinMsiPackager.java
+++ b/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/WinMsiPackager.java
@@ -36,7 +36,6 @@ import java.nio.file.Path;
 import java.nio.file.PathMatcher;
 import java.util.ArrayList;
 import java.util.Collections;
-import java.util.HashMap;
 import java.util.LinkedHashSet;
 import java.util.List;
 import java.util.Map;
@@ -315,50 +314,50 @@ final class WinMsiPackager implements Consumer<PackagingPipeline.Builder> {
         wixPipeline.buildMsi(msiOut.toAbsolutePath());
     }
 
-    private Map<String, String> createWixVars() throws IOException {
-        Map<String, String> data = new HashMap<>();
+    private WixVariables createWixVars() throws IOException {
+        var wixVars = new WixVariables();
 
-        data.put("JpProductCode", pkg.productCode().toString());
-        data.put("JpProductUpgradeCode", pkg.upgradeCode().toString());
+        wixVars.put("JpProductCode", pkg.productCode().toString());
+        wixVars.put("JpProductUpgradeCode", pkg.upgradeCode().toString());
 
         Log.verbose(I18N.format("message.product-code", pkg.productCode()));
         Log.verbose(I18N.format("message.upgrade-code", pkg.upgradeCode()));
 
-        data.put("JpAllowUpgrades", "yes");
+        wixVars.define("JpAllowUpgrades");
         if (!pkg.isRuntimeInstaller()) {
-            data.put("JpAllowDowngrades", "yes");
+            wixVars.define("JpAllowDowngrades");
         }
 
-        data.put("JpAppName", pkg.packageName());
-        data.put("JpAppDescription", pkg.description());
-        data.put("JpAppVendor", pkg.app().vendor());
-        data.put("JpAppVersion", pkg.version());
+        wixVars.put("JpAppName", pkg.packageName());
+        wixVars.put("JpAppDescription", pkg.description());
+        wixVars.put("JpAppVendor", pkg.app().vendor());
+        wixVars.put("JpAppVersion", pkg.version());
         if (Files.exists(installerIcon)) {
-            data.put("JpIcon", installerIcon.toString());
+            wixVars.put("JpIcon", installerIcon.toString());
         }
 
         pkg.helpURL().ifPresent(value -> {
-            data.put("JpHelpURL", value);
+            wixVars.put("JpHelpURL", value);
         });
 
         pkg.updateURL().ifPresent(value -> {
-            data.put("JpUpdateURL", value);
+            wixVars.put("JpUpdateURL", value);
         });
 
         pkg.aboutURL().ifPresent(value -> {
-            data.put("JpAboutURL", value);
+            wixVars.put("JpAboutURL", value);
         });
 
-        data.put("JpAppSizeKb", Long.toString(AppImageLayout.toPathGroup(
+        wixVars.put("JpAppSizeKb", Long.toString(AppImageLayout.toPathGroup(
                 env.appImageLayout()).sizeInBytes() >> 10));
 
-        data.put("JpConfigDir", env.configDir().toAbsolutePath().toString());
+        wixVars.put("JpConfigDir", env.configDir().toAbsolutePath().toString());
 
         if (pkg.isSystemWideInstall()) {
-            data.put("JpIsSystemWide", "yes");
+            wixVars.define("JpIsSystemWide");
         }
 
-        return data;
+        return wixVars;
     }
 
     private static List<Path> getWxlFilesFromDir(Path dir) {
diff --git a/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/WixFragmentBuilder.java b/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/WixFragmentBuilder.java
index 46894699d98..c842c366f63 100644
--- a/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/WixFragmentBuilder.java
+++ b/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/WixFragmentBuilder.java
@@ -32,7 +32,6 @@ import java.nio.file.Path;
 import java.util.Collection;
 import java.util.Map;
 import java.util.Objects;
-import java.util.Optional;
 import java.util.regex.Matcher;
 import java.util.regex.Pattern;
 import javax.xml.stream.XMLStreamWriter;
@@ -65,16 +64,14 @@ abstract class WixFragmentBuilder {
     }
 
     void initFromParams(BuildEnv env, WinMsiPackage pkg) {
-        wixVariables = null;
+        wixVariables = new WixVariables();
         additionalResources = null;
         configRoot = env.configDir();
         fragmentResource = env.createResource(defaultResourceName).setPublicName(outputFileName);
     }
 
     void configureWixPipeline(WixPipeline.Builder wixPipeline) {
-        wixPipeline.addSource(configRoot.resolve(outputFileName),
-                Optional.ofNullable(wixVariables).map(WixVariables::getValues).orElse(
-                        null));
+        wixPipeline.addSource(configRoot.resolve(outputFileName), wixVariables);
     }
 
     void addFilesToConfigRoot() throws IOException {
@@ -147,14 +144,11 @@ abstract class WixFragmentBuilder {
     protected abstract Collection<XmlConsumer> getFragmentWriters();
 
     protected final void defineWixVariable(String variableName) {
-        setWixVariable(variableName, "yes");
+        wixVariables.define(variableName);
     }
 
     protected final void setWixVariable(String variableName, String variableValue) {
-        if (wixVariables == null) {
-            wixVariables = new WixVariables();
-        }
-        wixVariables.setWixVariable(variableName, variableValue);
+        wixVariables.put(variableName, variableValue);
     }
 
     protected final void addResource(OverridableResource resource, String saveAsName) {
diff --git a/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/WixPipeline.java b/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/WixPipeline.java
index 40160192862..a09db389ca5 100644
--- a/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/WixPipeline.java
+++ b/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/WixPipeline.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2019, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2019, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -24,22 +24,18 @@
  */
 package jdk.jpackage.internal;
 
+import static jdk.jpackage.internal.ShortPathUtils.adjustPath;
+
 import java.io.IOException;
-import java.nio.file.Files;
 import java.nio.file.Path;
 import java.util.ArrayList;
-import java.util.Collections;
-import java.util.HashMap;
 import java.util.List;
 import java.util.Map;
 import java.util.Objects;
-import java.util.Optional;
 import java.util.Set;
-import java.util.function.Function;
+import java.util.function.Consumer;
 import java.util.function.UnaryOperator;
-import java.util.stream.Collectors;
 import java.util.stream.Stream;
-import static jdk.jpackage.internal.ShortPathUtils.adjustPath;
 import jdk.jpackage.internal.util.PathUtils;
 
 /**
@@ -61,18 +57,20 @@ final class WixPipeline {
 
             final var absWorkDir = workDir.normalize().toAbsolutePath();
 
-            final UnaryOperator<Path> normalizePath = path -> {
-                return path.normalize().toAbsolutePath();
-            };
+            final var absObjWorkDir = PathUtils.normalizedAbsolutePath(wixObjDir);
 
-            final var absObjWorkDir = normalizePath.apply(wixObjDir);
-
-            var relSources = sources.stream().map(source -> {
-                return source.overridePath(normalizePath.apply(source.path));
+            final var absSources = sources.stream().map(source -> {
+                return source.copyWithPath(PathUtils.normalizedAbsolutePath(source.path));
             }).toList();
 
-            return new WixPipeline(toolset, adjustPath(absWorkDir), absObjWorkDir,
-                    wixVariables, mapLightOptions(normalizePath), relSources);
+            return new WixPipeline(
+                    toolset,
+                    adjustPath(absWorkDir),
+                    absObjWorkDir,
+                    wixVariables.createdImmutableCopy(),
+                    mapLightOptions(PathUtils::normalizedAbsolutePath),
+                    absSources,
+                    msiMutators);
         }
 
         Builder setWixObjDir(Path v) {
@@ -85,17 +83,30 @@ final class WixPipeline {
             return this;
         }
 
-        Builder setWixVariables(Map<String, String> v) {
-            wixVariables.clear();
+        Builder putWixVariables(WixVariables v) {
             wixVariables.putAll(v);
             return this;
         }
 
-        Builder addSource(Path source, Map<String, String> wixVariables) {
-            sources.add(new WixSource(source, wixVariables));
+        Builder putWixVariables(Map<String, String> v) {
+            wixVariables.putAll(v);
             return this;
         }
 
+        Builder addSource(Path source, WixVariables wixVariables) {
+            sources.add(new WixSource(source, wixVariables.createdImmutableCopy()));
+            return this;
+        }
+
+        Builder addMsiMutator(MsiMutator msiMutator, List<String> args) {
+            msiMutators.add(new MsiMutatorWithArgs(msiMutator, args));
+            return this;
+        }
+
+        Builder addSource(Path source) {
+            return addSource(source, WixVariables.EMPTY);
+        }
+
         Builder addLightOptions(String ... v) {
             lightOptions.addAll(List.of(v));
             return this;
@@ -119,87 +130,59 @@ final class WixPipeline {
 
         private Path workDir;
         private Path wixObjDir;
-        private final Map<String, String> wixVariables = new HashMap<>();
+        private final WixVariables wixVariables = new WixVariables();
         private final List<String> lightOptions = new ArrayList<>();
         private final List<WixSource> sources = new ArrayList<>();
+        private final List<MsiMutatorWithArgs> msiMutators = new ArrayList<>();
     }
 
     static Builder build() {
         return new Builder();
     }
 
-    private WixPipeline(WixToolset toolset, Path workDir, Path wixObjDir,
-            Map<String, String> wixVariables, List<String> lightOptions,
-            List<WixSource> sources) {
-        this.toolset = toolset;
-        this.workDir = workDir;
-        this.wixObjDir = wixObjDir;
-        this.wixVariables = wixVariables;
-        this.lightOptions = lightOptions;
-        this.sources = sources;
+    private WixPipeline(
+            WixToolset toolset,
+            Path workDir,
+            Path wixObjDir,
+            WixVariables wixVariables,
+            List<String> lightOptions,
+            List<WixSource> sources,
+            List<MsiMutatorWithArgs> msiMutators) {
+
+        this.toolset = Objects.requireNonNull(toolset);
+        this.workDir = Objects.requireNonNull(workDir);
+        this.wixObjDir = Objects.requireNonNull(wixObjDir);
+        this.wixVariables = Objects.requireNonNull(wixVariables);
+        this.lightOptions = Objects.requireNonNull(lightOptions);
+        this.sources = Objects.requireNonNull(sources);
+        this.msiMutators = Objects.requireNonNull(msiMutators);
     }
 
     void buildMsi(Path msi) throws IOException {
-        Objects.requireNonNull(workDir);
 
         // Use short path to the output msi to workaround
         // WiX limitations of handling long paths.
         var transientMsi = wixObjDir.resolve("a.msi");
 
+        var configRoot = workDir.resolve(transientMsi).getParent();
+
+        for (var msiMutator : msiMutators) {
+            msiMutator.addToConfigRoot(configRoot);
+        }
+
         switch (toolset.getType()) {
             case Wix3 -> buildMsiWix3(transientMsi);
             case Wix4 -> buildMsiWix4(transientMsi);
-            default -> throw new IllegalArgumentException();
+        }
+
+        for (var msiMutator : msiMutators) {
+            msiMutator.execute(configRoot, workDir.resolve(transientMsi));
         }
 
         IOUtils.copyFile(workDir.resolve(transientMsi), msi);
     }
 
-    private void addWixVariblesToCommandLine(
-            Map<String, String> otherWixVariables, List<String> cmdline) {
-        Stream.of(wixVariables, Optional.ofNullable(otherWixVariables).
-                orElseGet(Collections::emptyMap)).filter(Objects::nonNull).
-                reduce((a, b) -> {
-                    a.putAll(b);
-                    return a;
-                }).ifPresent(wixVars -> {
-            var entryStream = wixVars.entrySet().stream();
-
-            Stream<String> stream;
-            switch (toolset.getType()) {
-                case Wix3 -> {
-                    stream = entryStream.map(wixVar -> {
-                        return String.format("-d%s=%s", wixVar.getKey(), wixVar.
-                                getValue());
-                    });
-                }
-                case Wix4 -> {
-                    stream = entryStream.map(wixVar -> {
-                        return Stream.of("-d", String.format("%s=%s", wixVar.
-                                getKey(), wixVar.getValue()));
-                    }).flatMap(Function.identity());
-                }
-                default -> {
-                    throw new IllegalArgumentException();
-                }
-            }
-
-            stream.reduce(cmdline, (ctnr, wixVar) -> {
-                ctnr.add(wixVar);
-                return ctnr;
-            }, (x, y) -> {
-                x.addAll(y);
-                return x;
-            });
-        });
-    }
-
     private void buildMsiWix4(Path msi) throws IOException {
-        var mergedSrcWixVars = sources.stream().map(wixSource -> {
-            return Optional.ofNullable(wixSource.variables).orElseGet(
-                    Collections::emptyMap).entrySet().stream();
-        }).flatMap(Function.identity()).collect(Collectors.toMap(
-                Map.Entry::getKey, Map.Entry::getValue));
 
         List<String> cmdline = new ArrayList<>(List.of(
                 toolset.getToolPath(WixTool.Wix4).toString(),
@@ -213,7 +196,7 @@ final class WixPipeline {
 
         cmdline.addAll(lightOptions);
 
-        addWixVariblesToCommandLine(mergedSrcWixVars, cmdline);
+        addWixVariablesToCommandLine(sources.stream(), cmdline::addAll);
 
         cmdline.addAll(sources.stream().map(wixSource -> {
             return wixSource.path.toString();
@@ -241,7 +224,6 @@ final class WixPipeline {
         lightCmdline.addAll(lightOptions);
         wixObjs.stream().map(Path::toString).forEach(lightCmdline::add);
 
-        Files.createDirectories(msi.getParent());
         execute(lightCmdline);
     }
 
@@ -262,7 +244,7 @@ final class WixPipeline {
             cmdline.add("-fips");
         }
 
-        addWixVariblesToCommandLine(wixSource.variables, cmdline);
+        addWixVariablesToCommandLine(Stream.of(wixSource), cmdline::addAll);
 
         execute(cmdline);
 
@@ -273,16 +255,47 @@ final class WixPipeline {
         Executor.of(new ProcessBuilder(cmdline).directory(workDir.toFile())).executeExpectSuccess();
     }
 
-    private record WixSource(Path path, Map<String, String> variables) {
-        WixSource overridePath(Path path) {
+    private void addWixVariablesToCommandLine(Stream<WixSource> wixSources, Consumer<List<String>> sink) {
+        sink.accept(wixSources.map(WixSource::variables).reduce(wixVariables, (a, b) -> {
+            return new WixVariables().putAll(a).putAll(b);
+        }).toWixCommandLine(toolset.getType()));
+    }
+
+    private record WixSource(Path path, WixVariables variables) {
+        WixSource {
+            Objects.requireNonNull(path);
+            Objects.requireNonNull(variables);
+        }
+
+        WixSource copyWithPath(Path path) {
             return new WixSource(path, variables);
         }
     }
 
+    private record MsiMutatorWithArgs(MsiMutator mutator, List<String> args) {
+        MsiMutatorWithArgs {
+            Objects.requireNonNull(mutator);
+            Objects.requireNonNull(args);
+        }
+
+        void addToConfigRoot(Path configRoot) throws IOException {
+            mutator.addToConfigRoot(configRoot);
+        }
+
+        void execute(Path configRoot, Path transientMsi) throws IOException {
+            Executor.of("cscript", "//Nologo")
+                    .args(PathUtils.normalizedAbsolutePathString(configRoot.resolve(mutator.pathInConfigRoot())))
+                    .args(PathUtils.normalizedAbsolutePathString(transientMsi))
+                    .args(args)
+                    .executeExpectSuccess();
+        }
+    }
+
     private final WixToolset toolset;
-    private final Map<String, String> wixVariables;
+    private final WixVariables wixVariables;
     private final List<String> lightOptions;
     private final Path wixObjDir;
     private final Path workDir;
     private final List<WixSource> sources;
+    private final List<MsiMutatorWithArgs> msiMutators;
 }
diff --git a/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/WixUiFragmentBuilder.java b/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/WixUiFragmentBuilder.java
index 4a2a0756dbd..4748dcfb827 100644
--- a/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/WixUiFragmentBuilder.java
+++ b/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/WixUiFragmentBuilder.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2021, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2021, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -24,25 +24,32 @@
  */
 package jdk.jpackage.internal;
 
-import jdk.jpackage.internal.model.WinMsiPackage;
 import java.io.IOException;
 import java.io.InputStream;
 import java.nio.file.Files;
 import java.nio.file.Path;
 import java.util.ArrayList;
 import java.util.Collection;
-import java.util.HashMap;
+import java.util.Comparator;
 import java.util.List;
 import java.util.Map;
 import java.util.Objects;
+import java.util.Optional;
 import java.util.function.Function;
-import java.util.function.Supplier;
+import java.util.stream.Stream;
 import javax.xml.stream.XMLStreamException;
 import javax.xml.stream.XMLStreamWriter;
 import jdk.jpackage.internal.WixAppImageFragmentBuilder.ShortcutsFolder;
 import jdk.jpackage.internal.WixToolset.WixToolsetType;
+import jdk.jpackage.internal.model.WinMsiPackage;
 import jdk.jpackage.internal.resources.ResourceLocator;
 import jdk.jpackage.internal.util.XmlConsumer;
+import jdk.jpackage.internal.wixui.Dialog;
+import jdk.jpackage.internal.wixui.DialogPair;
+import jdk.jpackage.internal.wixui.Publish;
+import jdk.jpackage.internal.wixui.ShowActionSuppresser;
+import jdk.jpackage.internal.wixui.UIConfig;
+import jdk.jpackage.internal.wixui.UISpec;
 
 /**
  * Creates UI WiX fragment.
@@ -53,63 +60,83 @@ final class WixUiFragmentBuilder extends WixFragmentBuilder {
     void initFromParams(BuildEnv env, WinMsiPackage pkg) {
         super.initFromParams(env, pkg);
 
-        withLicenseDlg = pkg.licenseFile().isPresent();
-        if (withLicenseDlg) {
+        final var shortcutFolders = ShortcutsFolder.getForPackage(pkg);
+
+        uiConfig = UIConfig.build()
+                .withLicenseDlg(pkg.licenseFile().isPresent())
+                .withInstallDirChooserDlg(pkg.withInstallDirChooser())
+                .withShortcutPromptDlg(!shortcutFolders.isEmpty() && pkg.withShortcutPrompt())
+                .create();
+
+        if (!uiConfig.equals(UIConfig.build().create()) || pkg.withUI()) {
+            uiSpec = Optional.of(UISpec.create(uiConfig));
+        } else {
+            uiSpec = Optional.empty();
+        }
+
+        if (uiConfig.isWithLicenseDlg()) {
             Path licenseFileName = pkg.licenseFile().orElseThrow().getFileName();
             Path destFile = getConfigRoot().resolve(licenseFileName);
             setWixVariable("JpLicenseRtf", destFile.toAbsolutePath().toString());
         }
 
-        withInstallDirChooserDlg = pkg.withInstallDirChooser();
-
-        final var shortcutFolders = ShortcutsFolder.getForPackage(pkg);
-
-        withShortcutPromptDlg = !shortcutFolders.isEmpty() && pkg.withShortcutPrompt();
-
         customDialogs = new ArrayList<>();
 
-        if (withShortcutPromptDlg) {
-            CustomDialog dialog = new CustomDialog(env::createResource, I18N.getString(
-                    "resource.shortcutpromptdlg-wix-file"),
+        if (uiConfig.isWithShortcutPromptDlg()) {
+            CustomDialog dialog = new CustomDialog(
+                    env::createResource,
+                    I18N.getString("resource.shortcutpromptdlg-wix-file"),
                     "ShortcutPromptDlg.wxs");
             for (var shortcutFolder : shortcutFolders) {
-                dialog.wixVariables.defineWixVariable(
+                dialog.wixVariables.define(
                         shortcutFolder.getWixVariableName());
             }
             customDialogs.add(dialog);
         }
 
-        if (withInstallDirChooserDlg) {
-            CustomDialog dialog = new CustomDialog(env::createResource, I18N.getString(
-                    "resource.installdirnotemptydlg-wix-file"),
+        if (uiConfig.isWithInstallDirChooserDlg()) {
+            CustomDialog dialog = new CustomDialog(
+                    env::createResource,
+                    I18N.getString("resource.installdirnotemptydlg-wix-file"),
                     "InstallDirNotEmptyDlg.wxs");
-            List<Dialog> dialogIds = getUI().dialogIdsSupplier.apply(this);
-            dialog.wixVariables.setWixVariable("JpAfterInstallDirDlg",
-                    dialogIds.get(dialogIds.indexOf(Dialog.InstallDirDlg) + 1).id);
             customDialogs.add(dialog);
         }
+
     }
 
     @Override
     void configureWixPipeline(WixPipeline.Builder wixPipeline) {
         super.configureWixPipeline(wixPipeline);
 
-        if (withShortcutPromptDlg || withInstallDirChooserDlg || withLicenseDlg) {
-            final String extName;
-            switch (getWixType()) {
-                case Wix3 -> extName = "WixUIExtension";
-                case Wix4 -> extName = "WixToolset.UI.wixext";
-                default -> throw new IllegalArgumentException();
-            }
-            wixPipeline.addLightOptions("-ext", extName);
-        }
-
         // Only needed if we using CA dll, so Wix can find it
         if (withCustomActionsDll) {
             wixPipeline.addLightOptions("-b",
                     getConfigRoot().toAbsolutePath().toString());
         }
 
+        if (uiSpec.isEmpty()) {
+            return;
+        }
+
+        var extName = switch (getWixType()) {
+            case Wix3 -> "WixUIExtension";
+            case Wix4 -> "WixToolset.UI.wixext";
+        };
+        wixPipeline.addLightOptions("-ext", extName);
+        wixPipeline.putWixVariables(uiSpec.get().wixVariables());
+
+        if (!uiSpec.get().hideDialogs().isEmpty() && getWixType() == WixToolsetType.Wix3) {
+            // Older WiX doesn't support multiple overrides of a "ShowAction" element.
+            // Have to run a script to alter the msi.
+            var removeActions = uiSpec.get().hideDialogs().stream()
+                    .map(ShowActionSuppresser::dialog)
+                    .sorted(Dialog.DEFAULT_COMPARATOR)
+                    .map(Dialog::id);
+            wixPipeline.addMsiMutator(
+                    new MsiMutator("msi-disable-actions.js"),
+                    Stream.concat(Stream.of("InstallUISequence"), removeActions).toList());
+        }
+
         for (var customDialog : customDialogs) {
             customDialog.addToWixPipeline(wixPipeline);
         }
@@ -132,26 +159,24 @@ final class WixUiFragmentBuilder extends WixFragmentBuilder {
         return List.of(this::addUI);
     }
 
-    private void addUI(XMLStreamWriter xml) throws XMLStreamException,
-            IOException {
+    private void addUI(XMLStreamWriter xml) throws XMLStreamException, IOException {
 
-        if (withInstallDirChooserDlg) {
+        if (uiConfig.isWithInstallDirChooserDlg()) {
             xml.writeStartElement("Property");
             xml.writeAttribute("Id", "WIXUI_INSTALLDIR");
             xml.writeAttribute("Value", "INSTALLDIR");
             xml.writeEndElement(); // Property
         }
 
-        if (withLicenseDlg) {
+        if (uiConfig.isWithLicenseDlg()) {
             xml.writeStartElement("WixVariable");
             xml.writeAttribute("Id", "WixUILicenseRtf");
             xml.writeAttribute("Value", "$(var.JpLicenseRtf)");
             xml.writeEndElement(); // WixVariable
         }
 
-        var ui = getUI();
-        if (ui != null) {
-            ui.write(getWixType(), this, xml);
+        if (uiSpec.isPresent()) {
+            writeNonEmptyUIElement(xml);
         } else {
             xml.writeStartElement("UI");
             xml.writeAttribute("Id", "JpUI");
@@ -159,371 +184,140 @@ final class WixUiFragmentBuilder extends WixFragmentBuilder {
         }
     }
 
-    private UI getUI() {
-        if (withInstallDirChooserDlg || withShortcutPromptDlg) {
-            // WixUI_InstallDir for shortcut prompt dialog too because in
-            // WixUI_Minimal UI sequence WelcomeEulaDlg dialog doesn't have "Next"
-            // button, but has "Install" button. So inserting shortcut prompt dialog
-            // after welcome dialog in WixUI_Minimal UI sequence would be confusing
-            return UI.InstallDir;
-        } else if (withLicenseDlg) {
-            return UI.Minimal;
-        } else {
-            return null;
-        }
-    }
+    void writeNonEmptyUIElement(XMLStreamWriter xml) throws XMLStreamException, IOException {
 
-    private enum UI {
-        InstallDir("WixUI_InstallDir",
-                WixUiFragmentBuilder::dialogSequenceForWixUI_InstallDir,
-                Dialog::createPairsForWixUI_InstallDir),
-        Minimal("WixUI_Minimal", null, null);
+        switch (getWixType()) {
+            case Wix3 -> {}
+            case Wix4 -> {
+                // https://wixtoolset.org/docs/fourthree/faqs/#converting-custom-wixui-dialog-sets
+                xml.writeProcessingInstruction("foreach WIXUIARCH in X86;X64;A64");
+                writeWix4UIRef(xml, uiSpec.get().wixUI().id(), "JpUIInternal_$(WIXUIARCH)");
+                xml.writeProcessingInstruction("endforeach");
 
-        UI(String wixUIRef,
-                Function<WixUiFragmentBuilder, List<Dialog>> dialogIdsSupplier,
-                Supplier<Map<DialogPair, List<Publish>>> dialogPairsSupplier) {
-            this.wixUIRef = wixUIRef;
-            this.dialogIdsSupplier = dialogIdsSupplier;
-            this.dialogPairsSupplier = dialogPairsSupplier;
-        }
-
-        void write(WixToolsetType wixType, WixUiFragmentBuilder outer, XMLStreamWriter xml) throws XMLStreamException, IOException {
-            switch (wixType) {
-                case Wix3 -> {}
-                case Wix4 -> {
-                    // https://wixtoolset.org/docs/fourthree/faqs/#converting-custom-wixui-dialog-sets
-                    xml.writeProcessingInstruction("foreach WIXUIARCH in X86;X64;A64");
-                    writeWix4UIRef(xml, wixUIRef, "JpUIInternal_$(WIXUIARCH)");
-                    xml.writeProcessingInstruction("endforeach");
-
-                    writeWix4UIRef(xml, "JpUIInternal", "JpUI");
-                }
-                default -> {
-                    throw new IllegalArgumentException();
-                }
-            }
-
-            xml.writeStartElement("UI");
-            switch (wixType) {
-                case Wix3 -> {
-                    xml.writeAttribute("Id", "JpUI");
-                    xml.writeStartElement("UIRef");
-                    xml.writeAttribute("Id", wixUIRef);
-                    xml.writeEndElement(); // UIRef
-                }
-                case Wix4 -> {
-                    xml.writeAttribute("Id", "JpUIInternal");
-                }
-                default -> {
-                    throw new IllegalArgumentException();
-                }
-            }
-            writeContents(wixType, outer, xml);
-            xml.writeEndElement(); // UI
-        }
-
-        private void writeContents(WixToolsetType wixType, WixUiFragmentBuilder outer,
-                XMLStreamWriter xml) throws XMLStreamException, IOException {
-            if (dialogIdsSupplier != null) {
-                List<Dialog> dialogIds = dialogIdsSupplier.apply(outer);
-                Map<DialogPair, List<Publish>> dialogPairs = dialogPairsSupplier.get();
-
-                if (dialogIds.contains(Dialog.InstallDirDlg)) {
-                    xml.writeStartElement("DialogRef");
-                    xml.writeAttribute("Id", "InstallDirNotEmptyDlg");
-                    xml.writeEndElement(); // DialogRef
-                }
-
-                var it = dialogIds.iterator();
-                Dialog firstId = it.next();
-                while (it.hasNext()) {
-                    Dialog secondId = it.next();
-                    DialogPair pair = new DialogPair(firstId, secondId);
-                    for (var curPair : List.of(pair, pair.flip())) {
-                        for (var publish : dialogPairs.get(curPair)) {
-                            writePublishDialogPair(wixType, xml, publish, curPair);
-                        }
-                    }
-                    firstId = secondId;
-                }
+                writeWix4UIRef(xml, "JpUIInternal", "JpUI");
             }
         }
 
-        private static void writeWix4UIRef(XMLStreamWriter xml, String uiRef, String id) throws XMLStreamException, IOException {
-            // https://wixtoolset.org/docs/fourthree/faqs/#referencing-the-standard-wixui-dialog-sets
-            xml.writeStartElement("UI");
-            xml.writeAttribute("Id", id);
-            xml.writeStartElement("ui:WixUI");
-            xml.writeAttribute("Id", uiRef);
-            xml.writeNamespace("ui", "http://wixtoolset.org/schemas/v4/wxs/ui");
-            xml.writeEndElement(); // UIRef
-            xml.writeEndElement(); // UI
-        }
-
-        private final String wixUIRef;
-        private final Function<WixUiFragmentBuilder, List<Dialog>> dialogIdsSupplier;
-        private final Supplier<Map<DialogPair, List<Publish>>> dialogPairsSupplier;
-    }
-
-    private List<Dialog> dialogSequenceForWixUI_InstallDir() {
-        List<Dialog> dialogIds = new ArrayList<>(
-                List.of(Dialog.WixUI_WelcomeDlg));
-        if (withLicenseDlg) {
-            dialogIds.add(Dialog.WixUI_LicenseAgreementDlg);
-        }
-
-        if (withInstallDirChooserDlg) {
-            dialogIds.add(Dialog.InstallDirDlg);
-        }
-
-        if (withShortcutPromptDlg) {
-            dialogIds.add(Dialog.ShortcutPromptDlg);
-        }
-
-        dialogIds.add(Dialog.WixUI_VerifyReadyDlg);
-
-        return dialogIds;
-    }
-
-    private enum Dialog {
-        WixUI_WelcomeDlg,
-        WixUI_LicenseAgreementDlg,
-        InstallDirDlg,
-        ShortcutPromptDlg,
-        WixUI_VerifyReadyDlg;
-
-        Dialog() {
-            if (name().startsWith("WixUI_")) {
-                id = name().substring("WixUI_".length());
-            } else {
-                id = name();
+        xml.writeStartElement("UI");
+        switch (getWixType()) {
+            case Wix3 -> {
+                xml.writeAttribute("Id", "JpUI");
+                xml.writeStartElement("UIRef");
+                xml.writeAttribute("Id", uiSpec.get().wixUI().id());
+                xml.writeEndElement(); // UIRef
+            }
+            case Wix4 -> {
+                xml.writeAttribute("Id", "JpUIInternal");
             }
         }
-
-        static Map<DialogPair, List<Publish>> createPair(Dialog firstId,
-                Dialog secondId, List<PublishBuilder> nextBuilders,
-                List<PublishBuilder> prevBuilders) {
-            var pair = new DialogPair(firstId, secondId);
-            return Map.of(pair, nextBuilders.stream().map(b -> {
-                return buildPublish(b.create()).next().create();
-            }).toList(), pair.flip(),
-                    prevBuilders.stream().map(b -> {
-                        return buildPublish(b.create()).back().create();
-                    }).toList());
-        }
-
-        static Map<DialogPair, List<Publish>> createPair(Dialog firstId,
-                Dialog secondId, List<PublishBuilder> builders) {
-            return createPair(firstId, secondId, builders, builders);
-        }
-
-        static Map<DialogPair, List<Publish>> createPairsForWixUI_InstallDir() {
-            Map<DialogPair, List<Publish>> map = new HashMap<>();
-
-            // Order is a "weight" of action. If there are multiple
-            // "NewDialog" action for the same dialog Id, MSI would pick the one
-            // with higher order value. In WixUI_InstallDir dialog sequence the
-            // highest order value is 4. InstallDirNotEmptyDlg adds NewDialog
-            // action with order 5. Setting order to 6 for all
-            // actions configured in this function would make them executed
-            // instead of corresponding default actions defined in
-            // WixUI_InstallDir dialog sequence.
-            var order = 6;
-
-            // Based on WixUI_InstallDir.wxs
-            var backFromVerifyReadyDlg = List.of(buildPublish().condition(
-                    "NOT Installed").order(order));
-            var uncondinal = List.of(buildPublish().condition("1"));
-            var ifNotIstalled = List.of(
-                    buildPublish().condition("NOT Installed").order(order));
-            var ifLicenseAccepted = List.of(buildPublish().condition(
-                    "LicenseAccepted = \"1\"").order(order));
-
-            // Empty condition list for the default dialog sequence
-            map.putAll(createPair(WixUI_WelcomeDlg, WixUI_LicenseAgreementDlg,
-                    List.of()));
-            map.putAll(
-                    createPair(WixUI_WelcomeDlg, InstallDirDlg, ifNotIstalled));
-            map.putAll(createPair(WixUI_WelcomeDlg, ShortcutPromptDlg,
-                    ifNotIstalled));
-
-            map.putAll(createPair(WixUI_LicenseAgreementDlg, InstallDirDlg,
-                    List.of()));
-            map.putAll(createPair(WixUI_LicenseAgreementDlg, ShortcutPromptDlg,
-                    ifLicenseAccepted, uncondinal));
-            map.putAll(createPair(WixUI_LicenseAgreementDlg,
-                    WixUI_VerifyReadyDlg, ifLicenseAccepted,
-                    backFromVerifyReadyDlg));
-
-            map.putAll(createPair(InstallDirDlg, ShortcutPromptDlg, List.of(),
-                    uncondinal));
-            map.putAll(createPair(InstallDirDlg, WixUI_VerifyReadyDlg, List.of()));
-
-            map.putAll(createPair(ShortcutPromptDlg, WixUI_VerifyReadyDlg,
-                    uncondinal, backFromVerifyReadyDlg));
-
-            return map;
-        }
-
-        private final String id;
+        writeUIElementContents(xml);
+        xml.writeEndElement(); // UI
     }
 
-    private static final class DialogPair {
+    private void writeUIElementContents(XMLStreamWriter xml) throws XMLStreamException, IOException {
 
-        DialogPair(Dialog first, Dialog second) {
-            this(first.id, second.id);
+        if (uiConfig.isWithInstallDirChooserDlg()) {
+            xml.writeStartElement("DialogRef");
+            xml.writeAttribute("Id", "InstallDirNotEmptyDlg");
+            xml.writeEndElement(); // DialogRef
         }
 
-        DialogPair(String firstId, String secondId) {
-            this.firstId = firstId;
-            this.secondId = secondId;
+        for (var e : uiSpec.get().customDialogSequence().entrySet().stream()
+                .sorted(Comparator.comparing(Map.Entry::getKey, DialogPair.DEFAULT_COMPARATOR))
+                .toList()) {
+            writePublishDialogPair(getWixType(), xml, e.getValue(), e.getKey());
         }
 
-        DialogPair flip() {
-            return new DialogPair(secondId, firstId);
-        }
-
-        @Override
-        public int hashCode() {
-            int hash = 3;
-            hash = 97 * hash + Objects.hashCode(this.firstId);
-            hash = 97 * hash + Objects.hashCode(this.secondId);
-            return hash;
-        }
-
-        @Override
-        public boolean equals(Object obj) {
-            if (this == obj) {
-                return true;
-            }
-            if (obj == null) {
-                return false;
-            }
-            if (getClass() != obj.getClass()) {
-                return false;
-            }
-            final DialogPair other = (DialogPair) obj;
-            if (!Objects.equals(this.firstId, other.firstId)) {
-                return false;
-            }
-            if (!Objects.equals(this.secondId, other.secondId)) {
-                return false;
-            }
-            return true;
-        }
-
-        private final String firstId;
-        private final String secondId;
+        hideDialogs(getWixType(), xml, uiSpec.get().hideDialogs());
     }
 
-    private static final class Publish {
-
-        Publish(String control, String condition, int order) {
-            this.control = control;
-            this.condition = condition;
-            this.order = order;
-        }
-
-        private final String control;
-        private final String condition;
-        private final int order;
+    private static void writeWix4UIRef(XMLStreamWriter xml, String uiRef, String id) throws XMLStreamException, IOException {
+        // https://wixtoolset.org/docs/fourthree/faqs/#referencing-the-standard-wixui-dialog-sets
+        xml.writeStartElement("UI");
+        xml.writeAttribute("Id", Objects.requireNonNull(id));
+        xml.writeStartElement("ui:WixUI");
+        xml.writeAttribute("Id", Objects.requireNonNull(uiRef));
+        xml.writeNamespace("ui", "http://wixtoolset.org/schemas/v4/wxs/ui");
+        xml.writeEndElement(); // UIRef
+        xml.writeEndElement(); // UI
     }
 
-    private static final class PublishBuilder {
+    private static void writePublishDialogPair(
+            WixToolsetType wixType,
+            XMLStreamWriter xml,
+            Publish publish,
+            DialogPair dialogPair) throws IOException, XMLStreamException {
 
-        PublishBuilder() {
-            order(0);
-            next();
-            condition("1");
-        }
-
-        PublishBuilder(Publish publish) {
-            order(publish.order);
-            control(publish.control);
-            condition(publish.condition);
-        }
-
-        public PublishBuilder control(String v) {
-            control = v;
-            return this;
-        }
-
-        public PublishBuilder next() {
-            return control("Next");
-        }
-
-        public PublishBuilder back() {
-            return control("Back");
-        }
-
-        public PublishBuilder condition(String v) {
-            condition = v;
-            return this;
-        }
-
-        public PublishBuilder order(int v) {
-            order = v;
-            return this;
-        }
-
-        Publish create() {
-            return new Publish(control, condition, order);
-        }
-
-        private String control;
-        private String condition;
-        private int order;
-    }
-
-    private static PublishBuilder buildPublish() {
-        return new PublishBuilder();
-    }
-
-    private static PublishBuilder buildPublish(Publish publish) {
-        return new PublishBuilder(publish);
-    }
-
-    private static void writePublishDialogPair(WixToolsetType wixType, XMLStreamWriter xml,
-            Publish publish, DialogPair dialogPair) throws IOException, XMLStreamException {
         xml.writeStartElement("Publish");
-        xml.writeAttribute("Dialog", dialogPair.firstId);
-        xml.writeAttribute("Control", publish.control);
+        xml.writeAttribute("Dialog", dialogPair.first().id());
+        xml.writeAttribute("Control", publish.control().id());
         xml.writeAttribute("Event", "NewDialog");
-        xml.writeAttribute("Value", dialogPair.secondId);
-        if (publish.order != 0) {
-            xml.writeAttribute("Order", String.valueOf(publish.order));
+        xml.writeAttribute("Value", dialogPair.second().id());
+        if (publish.order() != 0) {
+            xml.writeAttribute("Order", String.valueOf(publish.order()));
         }
+
         switch (wixType) {
-            case Wix3 -> xml.writeCharacters(publish.condition);
-            case Wix4 -> xml.writeAttribute("Condition", publish.condition);
-            default -> throw new IllegalArgumentException();
+            case Wix3 -> {
+                xml.writeCharacters(publish.condition());
+            }
+            case Wix4 -> {
+                xml.writeAttribute("Condition", publish.condition());
+            }
         }
+
+        xml.writeEndElement();
+    }
+
+    private static void hideDialogs(
+            WixToolsetType wixType,
+            XMLStreamWriter xml,
+            Collection<? extends ShowActionSuppresser> hideDialogs) throws IOException, XMLStreamException {
+
+        if (!hideDialogs.isEmpty()) {
+            if (wixType == WixToolsetType.Wix4) {
+                xml.writeStartElement("InstallUISequence");
+                for (var showAction : hideDialogs.stream().sorted(ShowActionSuppresser.DEFAULT_COMPARATOR).toList()) {
+                    writeWix4ShowAction(wixType, xml, showAction);
+                }
+                xml.writeEndElement();
+            }
+        }
+    }
+
+    private static void writeWix4ShowAction(
+            WixToolsetType wixType,
+            XMLStreamWriter xml,
+            ShowActionSuppresser hideDialog) throws IOException, XMLStreamException {
+
+        xml.writeStartElement("Show");
+        xml.writeAttribute("Dialog", String.format("override %s", hideDialog.dialog().id()));
+        xml.writeAttribute(switch (hideDialog.order()) {
+            case AFTER -> "After";
+        }, hideDialog.anchor().id());
+        xml.writeAttribute("Condition", "0");
         xml.writeEndElement();
     }
 
     private final class CustomDialog {
 
-        CustomDialog(Function<String, OverridableResource> createResource, String category,
-                String wxsFileName) {
+        CustomDialog(Function<String, OverridableResource> createResource, String category, String wxsFileName) {
             this.wxsFileName = wxsFileName;
             this.wixVariables = new WixVariables();
 
-            addResource(createResource.apply(wxsFileName).setCategory(category).setPublicName(
-                    wxsFileName), wxsFileName);
+            addResource(createResource.apply(wxsFileName).setCategory(category).setPublicName(wxsFileName), wxsFileName);
         }
 
         void addToWixPipeline(WixPipeline.Builder wixPipeline) {
-            wixPipeline.addSource(getConfigRoot().toAbsolutePath().resolve(
-                    wxsFileName), wixVariables.getValues());
+            wixPipeline.addSource(getConfigRoot().toAbsolutePath().resolve(wxsFileName), wixVariables);
         }
 
         private final WixVariables wixVariables;
         private final String wxsFileName;
     }
 
-    private boolean withInstallDirChooserDlg;
-    private boolean withShortcutPromptDlg;
-    private boolean withLicenseDlg;
+    private UIConfig uiConfig;
+    private Optional<UISpec> uiSpec;
     private boolean withCustomActionsDll = true;
     private List<CustomDialog> customDialogs;
 }
diff --git a/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/WixVariables.java b/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/WixVariables.java
index 36ed1d99738..88a25810182 100644
--- a/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/WixVariables.java
+++ b/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/WixVariables.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2021, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -24,22 +24,103 @@
  */
 package jdk.jpackage.internal;
 
+import java.util.Collections;
+import java.util.Comparator;
 import java.util.HashMap;
+import java.util.List;
 import java.util.Map;
+import java.util.Objects;
+import java.util.stream.Stream;
+import jdk.jpackage.internal.WixToolset.WixToolsetType;
 
 final class WixVariables {
 
-    void defineWixVariable(String variableName) {
-        setWixVariable(variableName, "yes");
+    WixVariables() {
+        this.values = new HashMap<>();
     }
 
-    void setWixVariable(String variableName, String variableValue) {
-        values.put(variableName, variableValue);
+    private WixVariables(Map<String, String> values) {
+        this.values = values;
+        this.isImmutable = true;
     }
 
-    Map<String, String> getValues() {
-        return values;
+    WixVariables define(String variableName) {
+        return put(variableName, "yes");
     }
 
-    private final Map<String, String> values = new HashMap<>();
+    WixVariables put(String variableName, String variableValue) {
+        Objects.requireNonNull(variableName);
+        Objects.requireNonNull(variableValue);
+        validateMutable();
+        values.compute(variableName, (k, v) -> {
+            if (!allowOverrides && v != null) {
+                throw overridingDisabled();
+            }
+            return variableValue;
+        });
+        return this;
+    }
+
+    WixVariables putAll(Map<String, String> values) {
+        Objects.requireNonNull(values);
+        validateMutable();
+        if (!allowOverrides && !Collections.disjoint(this.values.keySet(), values.keySet())) {
+            throw overridingDisabled();
+        } else {
+            values.entrySet().forEach(e -> {
+                put(e.getKey(), e.getValue());
+            });
+        }
+        return this;
+    }
+
+    WixVariables putAll(WixVariables other) {
+        return putAll(other.values);
+    }
+
+    WixVariables allowOverrides(boolean v) {
+        validateMutable();
+        allowOverrides = v;
+        return this;
+    }
+
+    WixVariables createdImmutableCopy() {
+        if (isImmutable) {
+            return this;
+        } else {
+            return new WixVariables(Map.copyOf(values));
+        }
+    }
+
+    List<String> toWixCommandLine(WixToolsetType wixType) {
+        var orderedWixVars = values.entrySet().stream().sorted(Comparator.comparing(Map.Entry::getKey));
+        return (switch (Objects.requireNonNull(wixType)) {
+            case Wix3 -> {
+                yield orderedWixVars.map(wixVar -> {
+                    return String.format("-d%s=%s", wixVar.getKey(), wixVar.getValue());
+                });
+            }
+            case Wix4 -> {
+                yield orderedWixVars.flatMap(wixVar -> {
+                    return Stream.of("-d", String.format("%s=%s", wixVar.getKey(), wixVar.getValue()));
+                });
+            }
+        }).toList();
+    }
+
+    private void validateMutable() {
+        if (isImmutable) {
+            throw new IllegalStateException("WiX variables container is immutable");
+        }
+    }
+
+    private static IllegalStateException overridingDisabled() {
+        return new IllegalStateException("Overriding variables is unsupported");
+    }
+
+    private final Map<String, String> values;
+    private boolean allowOverrides;
+    private boolean isImmutable;
+
+    static final WixVariables EMPTY = new WixVariables().createdImmutableCopy();
 }
diff --git a/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/model/WinMsiPackageMixin.java b/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/model/WinMsiPackageMixin.java
index 94d7c30fe57..ec004da2cee 100644
--- a/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/model/WinMsiPackageMixin.java
+++ b/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/model/WinMsiPackageMixin.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2025, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -36,6 +36,8 @@ public interface WinMsiPackageMixin {
 
     boolean withShortcutPrompt();
 
+    boolean withUI();
+
     Optional<String> helpURL();
 
     Optional<String> updateURL();
@@ -50,8 +52,16 @@ public interface WinMsiPackageMixin {
 
     Optional<Path> serviceInstaller();
 
-    record Stub(DottedVersion msiVersion, boolean withInstallDirChooser, boolean withShortcutPrompt,
-            Optional<String> helpURL, Optional<String> updateURL, String startMenuGroupName,
-            boolean isSystemWideInstall, UUID upgradeCode, UUID productCode,
+    record Stub(
+            DottedVersion msiVersion,
+            boolean withInstallDirChooser,
+            boolean withShortcutPrompt,
+            boolean withUI,
+            Optional<String> helpURL,
+            Optional<String> updateURL,
+            String startMenuGroupName,
+            boolean isSystemWideInstall,
+            UUID upgradeCode,
+            UUID productCode,
             Optional<Path> serviceInstaller) implements WinMsiPackageMixin {}
 }
diff --git a/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/resources/msi-disable-actions.js b/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/resources/msi-disable-actions.js
new file mode 100644
index 00000000000..2f0f3a5d019
--- /dev/null
+++ b/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/resources/msi-disable-actions.js
@@ -0,0 +1,79 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.  Oracle designates this
+ * particular file as subject to the "Classpath" exception as provided
+ * by Oracle in the LICENSE file that accompanied this code.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+
+function modifyMsi(msiPath, callback) {
+  var installer = new ActiveXObject('WindowsInstaller.Installer')
+  var database = installer.OpenDatabase(msiPath, 1 /* msiOpenDatabaseModeTransact */)
+
+  callback(installer, database)
+
+  database.Commit()
+}
+
+
+function disableActions(installer, db, sequence, actionIDs) {
+  var tables = {}
+
+  var view = db.OpenView("SELECT `Action`, `Condition`, `Sequence` FROM " + sequence)
+  view.Execute()
+
+  try {
+    while (true) {
+      var record = view.Fetch()
+      if (!record) {
+          break
+      }
+
+      var action = record.StringData(1)
+
+      if (actionIDs.hasOwnProperty(action)) {
+        WScript.Echo("Set condition of [" + action + "] action in [" + sequence + "] sequence to [0]")
+        var newRecord = installer.CreateRecord(3)
+        for (var i = 1; i !== newRecord.FieldCount + 1; i++) {
+          newRecord.StringData(i) = record.StringData(i)
+        }
+        newRecord.StringData(2) = "0" // Set condition value to `0`
+        view.Modify(3 /* msiViewModifyAssign */, newRecord) // Replace existing record
+      }
+    }
+  } finally {
+    view.Close()
+  }
+}
+
+
+(function () {
+  var msi = WScript.arguments(0)
+  var sequence = WScript.arguments(1)
+  var actionIDs = {}
+  for (var i = 0; i !== WScript.arguments.Count(); i++) {
+    actionIDs[WScript.arguments(i)] = true
+  }
+
+  modifyMsi(msi, function (installer, db) {
+    disableActions(installer, db, sequence, actionIDs)
+  })
+})()
diff --git a/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/wixui/Control.java b/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/wixui/Control.java
new file mode 100644
index 00000000000..d41fc435126
--- /dev/null
+++ b/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/wixui/Control.java
@@ -0,0 +1,36 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.  Oracle designates this
+ * particular file as subject to the "Classpath" exception as provided
+ * by Oracle in the LICENSE file that accompanied this code.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+package jdk.jpackage.internal.wixui;
+
+import java.util.Comparator;
+
+/**
+ * WiX Dialog's control.
+ */
+public sealed interface Control permits StandardControl {
+    String id();
+
+    public static final Comparator<Control> DEFAULT_COMPARATOR = Comparator.comparing(Control::id);
+}
diff --git a/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/wixui/CustomDialog.java b/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/wixui/CustomDialog.java
new file mode 100644
index 00000000000..7325685469c
--- /dev/null
+++ b/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/wixui/CustomDialog.java
@@ -0,0 +1,38 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.  Oracle designates this
+ * particular file as subject to the "Classpath" exception as provided
+ * by Oracle in the LICENSE file that accompanied this code.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+package jdk.jpackage.internal.wixui;
+
+/**
+ * Custom jpackage dialogs.
+ */
+public enum CustomDialog implements Dialog {
+    ShortcutPromptDlg,
+    ;
+
+    @Override
+    public String id() {
+        return name();
+    }
+}
diff --git a/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/wixui/Dialog.java b/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/wixui/Dialog.java
new file mode 100644
index 00000000000..a43648042a9
--- /dev/null
+++ b/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/wixui/Dialog.java
@@ -0,0 +1,36 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.  Oracle designates this
+ * particular file as subject to the "Classpath" exception as provided
+ * by Oracle in the LICENSE file that accompanied this code.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+package jdk.jpackage.internal.wixui;
+
+import java.util.Comparator;
+
+/**
+ * WiX Dialog.
+ */
+public sealed interface Dialog permits WixDialog, CustomDialog {
+    String id();
+
+    public static final Comparator<Dialog> DEFAULT_COMPARATOR = Comparator.comparing(Dialog::id);
+}
diff --git a/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/wixui/DialogPair.java b/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/wixui/DialogPair.java
new file mode 100644
index 00000000000..7f0f3bb6090
--- /dev/null
+++ b/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/wixui/DialogPair.java
@@ -0,0 +1,49 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.  Oracle designates this
+ * particular file as subject to the "Classpath" exception as provided
+ * by Oracle in the LICENSE file that accompanied this code.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+package jdk.jpackage.internal.wixui;
+
+import static java.util.Comparator.comparing;
+
+import java.util.Comparator;
+import java.util.Objects;
+
+public record DialogPair(Dialog first, Dialog second) {
+
+    public DialogPair {
+        Objects.requireNonNull(first);
+        Objects.requireNonNull(second);
+        if (first.equals(second) || first.id().equals(second.id())) {
+            throw new IllegalArgumentException("Dialogs must be different");
+        }
+    }
+
+    DialogPair flip() {
+        return new DialogPair(second, first);
+    }
+
+    public static final Comparator<DialogPair> DEFAULT_COMPARATOR =
+            comparing(DialogPair::first, Dialog.DEFAULT_COMPARATOR)
+                    .thenComparing(comparing(DialogPair::second, Dialog.DEFAULT_COMPARATOR));
+}
diff --git a/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/wixui/Publish.java b/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/wixui/Publish.java
new file mode 100644
index 00000000000..7741ad823bb
--- /dev/null
+++ b/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/wixui/Publish.java
@@ -0,0 +1,92 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.  Oracle designates this
+ * particular file as subject to the "Classpath" exception as provided
+ * by Oracle in the LICENSE file that accompanied this code.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+package jdk.jpackage.internal.wixui;
+
+import java.util.Objects;
+
+public record Publish(Control control, String condition, int order) {
+
+    public Publish {
+        Objects.requireNonNull(control);
+        Objects.requireNonNull(condition);
+        if (order < 0) {
+            throw new IllegalArgumentException("Negative order");
+        }
+    }
+
+    Builder toBuilder() {
+        return new Builder(this);
+    }
+
+    static Builder build() {
+        return new Builder();
+    }
+
+    static final class Builder {
+
+        private Builder() {
+            order(0);
+            next();
+            condition("1");
+        }
+
+        private Builder(Publish publish) {
+            order(publish.order);
+            control(publish.control);
+            condition(publish.condition);
+        }
+
+        Publish create() {
+            return new Publish(control, condition, order);
+        }
+
+        Builder control(Control v) {
+            control = v;
+            return this;
+        }
+
+        Builder next() {
+            return control(StandardControl.NEXT);
+        }
+
+        Builder back() {
+            return control(StandardControl.BACK);
+        }
+
+        Builder condition(String v) {
+            condition = v;
+            return this;
+        }
+
+        Builder order(int v) {
+            order = v;
+            return this;
+        }
+
+        private int order;
+        private Control control;
+        private String condition;
+    }
+}
diff --git a/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/wixui/ShowActionSuppresser.java b/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/wixui/ShowActionSuppresser.java
new file mode 100644
index 00000000000..f89b15987ee
--- /dev/null
+++ b/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/wixui/ShowActionSuppresser.java
@@ -0,0 +1,72 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.  Oracle designates this
+ * particular file as subject to the "Classpath" exception as provided
+ * by Oracle in the LICENSE file that accompanied this code.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+package jdk.jpackage.internal.wixui;
+
+import static java.util.Comparator.comparing;
+
+import java.util.Comparator;
+import java.util.Objects;
+
+public record ShowActionSuppresser(Dialog dialog, Dialog anchor, Order order) {
+
+    public enum Order {
+        AFTER,
+        ;
+    }
+
+    public ShowActionSuppresser {
+        Objects.requireNonNull(order);
+        validate(dialog);
+        validate(anchor);
+    }
+
+    static Builder suppressShowAction(WixDialog dialog) {
+        return new Builder(dialog);
+    }
+
+    static final class Builder {
+
+        private Builder(WixDialog dialog) {
+            this.dialog = Objects.requireNonNull(dialog);
+        }
+
+        ShowActionSuppresser after(WixDialog anchor) {
+            return new ShowActionSuppresser(dialog, anchor, Order.AFTER);
+        }
+
+        private final WixDialog dialog;
+    }
+
+    private static void validate(Dialog v) {
+        if (!(Objects.requireNonNull(v) instanceof WixDialog)) {
+            throw new IllegalArgumentException();
+        }
+    }
+
+    public static final Comparator<ShowActionSuppresser> DEFAULT_COMPARATOR =
+            comparing(ShowActionSuppresser::dialog, Dialog.DEFAULT_COMPARATOR)
+                    .thenComparing(comparing(ShowActionSuppresser::anchor, Dialog.DEFAULT_COMPARATOR))
+                    .thenComparing(comparing(ShowActionSuppresser::order));
+}
diff --git a/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/wixui/StandardControl.java b/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/wixui/StandardControl.java
new file mode 100644
index 00000000000..43c5c5a7e9e
--- /dev/null
+++ b/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/wixui/StandardControl.java
@@ -0,0 +1,47 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.  Oracle designates this
+ * particular file as subject to the "Classpath" exception as provided
+ * by Oracle in the LICENSE file that accompanied this code.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+package jdk.jpackage.internal.wixui;
+
+import java.util.Objects;
+
+/**
+ * Dialog controls referenced in adjustments of the standard WiX UI.
+ */
+enum StandardControl implements Control {
+    NEXT("Next"),
+    BACK("Back"),
+    ;
+
+    StandardControl(String id) {
+        this.id = Objects.requireNonNull(id);
+    }
+
+    @Override
+    public String id() {
+        return id;
+    }
+
+    private final String id;
+}
diff --git a/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/wixui/UIConfig.java b/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/wixui/UIConfig.java
new file mode 100644
index 00000000000..c695694788f
--- /dev/null
+++ b/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/wixui/UIConfig.java
@@ -0,0 +1,79 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.  Oracle designates this
+ * particular file as subject to the "Classpath" exception as provided
+ * by Oracle in the LICENSE file that accompanied this code.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+package jdk.jpackage.internal.wixui;
+
+/**
+ * UI config.
+ */
+public record UIConfig(
+        boolean isWithInstallDirChooserDlg,
+        boolean isWithShortcutPromptDlg,
+        boolean isWithLicenseDlg) {
+
+    public static Builder build() {
+        return new Builder();
+    }
+
+    public static final class Builder {
+
+        private Builder() {
+        }
+
+        public UIConfig create() {
+            return new UIConfig(isWithInstallDirChooserDlg, isWithShortcutPromptDlg, isWithLicenseDlg);
+        }
+
+        public Builder withInstallDirChooserDlg(boolean v) {
+            isWithInstallDirChooserDlg = v;
+            return this;
+        }
+
+        public Builder withInstallDirChooserDlg() {
+            return withInstallDirChooserDlg(true);
+        }
+
+        public Builder withShortcutPromptDlg(boolean v) {
+            isWithShortcutPromptDlg = v;
+            return this;
+        }
+
+        public Builder withShortcutPromptDlg() {
+            return withShortcutPromptDlg(true);
+        }
+
+        public Builder withLicenseDlg(boolean v) {
+            isWithLicenseDlg = v;
+            return this;
+        }
+
+        public Builder withLicenseDlg() {
+            return withLicenseDlg(true);
+        }
+
+        private boolean isWithInstallDirChooserDlg;
+        private boolean isWithShortcutPromptDlg;
+        private boolean isWithLicenseDlg;
+    }
+}
diff --git a/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/wixui/UISpec.java b/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/wixui/UISpec.java
new file mode 100644
index 00000000000..38cf3775c2b
--- /dev/null
+++ b/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/wixui/UISpec.java
@@ -0,0 +1,293 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.  Oracle designates this
+ * particular file as subject to the "Classpath" exception as provided
+ * by Oracle in the LICENSE file that accompanied this code.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+package jdk.jpackage.internal.wixui;
+
+import static jdk.jpackage.internal.wixui.CustomDialog.ShortcutPromptDlg;
+import static jdk.jpackage.internal.wixui.ShowActionSuppresser.suppressShowAction;
+import static jdk.jpackage.internal.wixui.WixDialog.InstallDirDlg;
+import static jdk.jpackage.internal.wixui.WixDialog.LicenseAgreementDlg;
+import static jdk.jpackage.internal.wixui.WixDialog.ProgressDlg;
+import static jdk.jpackage.internal.wixui.WixDialog.VerifyReadyDlg;
+import static jdk.jpackage.internal.wixui.WixDialog.WelcomeDlg;
+import static jdk.jpackage.internal.wixui.WixDialog.WelcomeEulaDlg;
+
+import java.util.ArrayList;
+import java.util.Collection;
+import java.util.Collections;
+import java.util.HashMap;
+import java.util.List;
+import java.util.Map;
+import java.util.Objects;
+import java.util.Optional;
+import java.util.function.BiConsumer;
+import java.util.function.Supplier;
+import java.util.stream.Collectors;
+
+/**
+ * UI spec.
+ * <p>
+ * UI is based on one of the standard WiX UIs with optional alterations.
+ */
+public record UISpec(
+        WixUI wixUI,
+        Map<String, String> wixVariables,
+        Map<DialogPair, Publish> customDialogSequence,
+        Collection<ShowActionSuppresser> hideDialogs) {
+
+    public UISpec {
+        Objects.requireNonNull(wixUI);
+        Objects.requireNonNull(wixVariables);
+        Objects.requireNonNull(customDialogSequence);
+        Objects.requireNonNull(hideDialogs);
+    }
+
+    static Builder build(WixUI wixUI) {
+        return new Builder().wixUI(wixUI);
+    }
+
+    static final class Builder {
+
+        private Builder() {
+        }
+
+        UISpec create() {
+            return new UISpec(
+                    wixUI,
+                    Optional.ofNullable(wixVariables).map(Collections::unmodifiableMap).orElseGet(Map::of),
+                    Optional.ofNullable(customDialogSequence).map(Collections::unmodifiableMap).orElseGet(Map::of),
+                    Optional.ofNullable(hideDialogs).map(List::copyOf).orElseGet(List::of));
+        }
+
+        Builder wixUI(WixUI v) {
+            wixUI = v;
+            return this;
+        }
+
+        Builder setWixVariable(String name, String value) {
+            wixVariables.put(Objects.requireNonNull(name), Objects.requireNonNull(value));
+            return this;
+        }
+
+        Builder customDialogSequence(Map<DialogPair, Publish> v) {
+            customDialogSequence = v;
+            return this;
+        }
+
+        Builder hideDialogs(Collection<ShowActionSuppresser> v) {
+            hideDialogs = v;
+            return this;
+        }
+
+        Builder hideDialogs(ShowActionSuppresser... v) {
+            return hideDialogs(List.of(v));
+        }
+
+        private WixUI wixUI;
+        private final Map<String, String> wixVariables = new HashMap<>();
+        private Map<DialogPair, Publish> customDialogSequence;
+        private Collection<ShowActionSuppresser> hideDialogs;
+    }
+
+    public static UISpec create(UIConfig cfg) {
+        Objects.requireNonNull(cfg);
+        return Optional.ofNullable(DEFAULT_SPECS.get(cfg)).map(Supplier::get).orElseGet(() -> {
+            return createCustom(cfg);
+        });
+    }
+
+    private static UISpec createCustom(UIConfig cfg) {
+        Objects.requireNonNull(cfg);
+
+        var dialogs = installDirUiDialogs(cfg);
+        var dialogPairs = toDialogPairs(dialogs);
+
+        var customDialogSequence = overrideInstallDirDialogSequence().stream().filter(e -> {
+            return dialogPairs.contains(e.getKey());
+        }).collect(Collectors.toUnmodifiableMap(Map.Entry::getKey, Map.Entry::getValue));
+
+        var uiSpec = build(WixUI.INSTALL_DIR).customDialogSequence(customDialogSequence);
+
+        var it = dialogs.iterator();
+        do {
+            if (it.next().equals(InstallDirDlg)) {
+                uiSpec.setWixVariable("JpAfterInstallDirDlg", it.next().id());
+            }
+        } while (it.hasNext());
+
+        return uiSpec.create();
+    }
+
+    private static void createPairs(
+            BiConsumer<DialogPair, Publish> sink,
+            Dialog first,
+            Dialog second,
+            Publish publishNext,
+            Publish publishPrev) {
+
+        createPairNext(sink, first, second, publishNext);
+        createPairBack(sink, second, first, publishPrev);
+    }
+
+    private static void createPairs(
+            BiConsumer<DialogPair, Publish> sink,
+            Dialog first,
+            Dialog second,
+            Publish publish) {
+        createPairs(sink, first, second, publish, publish);
+    }
+
+    private static void createPairNext(
+            BiConsumer<DialogPair, Publish> sink,
+            Dialog first,
+            Dialog second,
+            Publish publish) {
+
+        var pair = new DialogPair(first, second);
+
+        sink.accept(pair, publish.toBuilder().next().create());
+    }
+
+    private static void createPairBack(
+            BiConsumer<DialogPair, Publish> sink,
+            Dialog first,
+            Dialog second,
+            Publish publish) {
+
+        var pair = new DialogPair(first, second);
+
+        sink.accept(pair, publish.toBuilder().back().create());
+    }
+
+    private static Collection<DialogPair> toDialogPairs(List<Dialog> dialogs) {
+        if (dialogs.size() < 2) {
+            throw new IllegalArgumentException();
+        }
+
+        var pairs = new ArrayList<DialogPair>();
+        var it = dialogs.listIterator();
+        var prev = it.next();
+        do {
+            var next = it.next();
+            var pair = new DialogPair(prev, next);
+            pairs.add(pair);
+            pairs.add(pair.flip());
+            prev = next;
+        } while (it.hasNext());
+
+        return pairs;
+    }
+
+    private static List<Dialog> installDirUiDialogs(UIConfig cfg) {
+        var dialogs = new ArrayList<Dialog>();
+
+        dialogs.add(WelcomeDlg);
+
+        if (cfg.isWithLicenseDlg()) {
+            dialogs.add(LicenseAgreementDlg);
+        }
+
+        if (cfg.isWithInstallDirChooserDlg()) {
+            dialogs.add(InstallDirDlg);
+        }
+
+        if (cfg.isWithShortcutPromptDlg()) {
+            dialogs.add(ShortcutPromptDlg);
+        }
+
+        dialogs.add(VerifyReadyDlg);
+
+        return dialogs;
+    }
+
+    private static Collection<Map.Entry<DialogPair, Publish>> overrideInstallDirDialogSequence() {
+
+        List<Map.Entry<DialogPair, Publish>> entries = new ArrayList<>();
+
+        BiConsumer<DialogPair, Publish> acc = (pair, publish) -> {
+            entries.add(Map.entry(pair, publish));
+        };
+
+        // Order is a "weight" of action. If there are multiple
+        // "NewDialog" action for the same dialog Id, MSI would pick the one
+        // with higher order value. In WixUI_InstallDir dialog sequence the
+        // highest order value is 4. InstallDirNotEmptyDlg adds NewDialog
+        // action with order 5. Setting order to 6 for all
+        // actions configured in this function would make them executed
+        // instead of corresponding default actions defined in
+        // WixUI_InstallDir dialog sequence.
+        var order = 6;
+
+        // Based on WixUI_InstallDir.wxs
+        var backFromVerifyReadyDlg = Publish.build().condition(CONDITION_NOT_INSTALLED).order(order).create();
+        var uncondinal = Publish.build().condition(CONDITION_ALWAYS).create();
+        var ifNotIstalled = Publish.build().condition(CONDITION_NOT_INSTALLED).order(order).create();
+        var ifLicenseAccepted = Publish.build().condition("LicenseAccepted = \"1\"").order(order).create();
+
+        // Define all alternative transitions:
+        //  - Skip standard license dialog
+        //  - Insert shortcut prompt dialog after the standard install dir dialog
+        //  - Replace the standard install dir dialog with the shortcut prompt dialog
+
+        createPairs(acc, WelcomeDlg, InstallDirDlg, ifNotIstalled);
+        createPairs(acc, WelcomeDlg, VerifyReadyDlg, ifNotIstalled);
+        createPairs(acc, WelcomeDlg, ShortcutPromptDlg, ifNotIstalled);
+
+        createPairs(acc, LicenseAgreementDlg, ShortcutPromptDlg, ifLicenseAccepted, uncondinal);
+        createPairs(acc, LicenseAgreementDlg, VerifyReadyDlg, ifLicenseAccepted, backFromVerifyReadyDlg);
+
+        createPairs(acc, InstallDirDlg, ShortcutPromptDlg, uncondinal);
+
+        createPairs(acc, ShortcutPromptDlg, VerifyReadyDlg, uncondinal, backFromVerifyReadyDlg);
+
+        return entries;
+    }
+
+    private static final Map<UIConfig, Supplier<UISpec>> DEFAULT_SPECS;
+
+    private static final String CONDITION_ALWAYS = "1";
+    private static final String CONDITION_NOT_INSTALLED = "NOT Installed";
+
+    static {
+
+        var specs = new HashMap<UIConfig, Supplier<UISpec>>();
+
+        // Verbatim WiX "Minimal" dialog set.
+        specs.put(UIConfig.build()
+                .withLicenseDlg()
+                .create(), () -> {
+                    return build(WixUI.MINIMAL).create();
+                });
+
+        // Standard WiX "Minimal" dialog set without the license dialog.
+        // The license dialog is removed by overriding the default "Show"
+        // action with the condition that always evaluates to "FALSE".
+        specs.put(UIConfig.build()
+                .create(), () -> {
+                    return build(WixUI.MINIMAL).hideDialogs(suppressShowAction(WelcomeEulaDlg).after(ProgressDlg)).create();
+                });
+
+        DEFAULT_SPECS = Collections.unmodifiableMap(specs);
+    }
+}
diff --git a/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/wixui/WixDialog.java b/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/wixui/WixDialog.java
new file mode 100644
index 00000000000..95c415dcaa0
--- /dev/null
+++ b/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/wixui/WixDialog.java
@@ -0,0 +1,43 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.  Oracle designates this
+ * particular file as subject to the "Classpath" exception as provided
+ * by Oracle in the LICENSE file that accompanied this code.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+package jdk.jpackage.internal.wixui;
+
+/**
+ * Standard WiX dialogs.
+ */
+enum WixDialog implements Dialog {
+    InstallDirDlg,
+    LicenseAgreementDlg,
+    ProgressDlg,
+    VerifyReadyDlg,
+    WelcomeDlg,
+    WelcomeEulaDlg,
+    ;
+
+    @Override
+    public String id() {
+        return name();
+    }
+}
diff --git a/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/wixui/WixUI.java b/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/wixui/WixUI.java
new file mode 100644
index 00000000000..1b87a7fee2d
--- /dev/null
+++ b/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/wixui/WixUI.java
@@ -0,0 +1,46 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.  Oracle designates this
+ * particular file as subject to the "Classpath" exception as provided
+ * by Oracle in the LICENSE file that accompanied this code.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+package jdk.jpackage.internal.wixui;
+
+import java.util.Objects;
+
+/**
+ * Standard WiX UI.
+ */
+public enum WixUI {
+    MINIMAL("WixUI_Minimal"),
+    INSTALL_DIR("WixUI_InstallDir"),
+    ;
+
+    WixUI(String id) {
+        this.id = Objects.requireNonNull(id);
+    }
+
+    public String id() {
+        return id;
+    }
+
+    private final String id;
+}
diff --git a/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/MsiDatabase.java b/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/MsiDatabase.java
index 6b3fae07d41..6c92e820f2e 100644
--- a/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/MsiDatabase.java
+++ b/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/MsiDatabase.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2025, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -30,7 +30,9 @@ import java.nio.charset.StandardCharsets;
 import java.nio.file.Files;
 import java.nio.file.Path;
 import java.util.ArrayList;
+import java.util.Arrays;
 import java.util.Collection;
+import java.util.Comparator;
 import java.util.HashMap;
 import java.util.List;
 import java.util.Map;
@@ -42,9 +44,10 @@ import java.util.regex.Matcher;
 import java.util.regex.Pattern;
 import java.util.stream.Collectors;
 import java.util.stream.IntStream;
+import java.util.stream.Stream;
 
 
-final class MsiDatabase {
+public final class MsiDatabase {
 
     static MsiDatabase load(Path msiFile, Path idtFileOutputDir, Set<Table> tableNames) {
         try {
@@ -61,7 +64,7 @@ final class MsiDatabase {
                     .execute(0);
 
             var tables = orderedTableNames.stream().map(tableName -> {
-                return Map.entry(tableName, idtFileOutputDir.resolve(tableName + ".idt"));
+                return Map.entry(tableName, idtFileOutputDir.resolve(tableName.tableName() + ".idt"));
             }).filter(e -> {
                 return Files.exists(e.getValue());
             }).collect(Collectors.toMap(Map.Entry::getKey, e -> {
@@ -81,6 +84,8 @@ final class MsiDatabase {
         FILE("File"),
         PROPERTY("Property"),
         SHORTCUT("Shortcut"),
+        CONTROL_EVENT("ControlEvent"),
+        INSTALL_UI_SEQUENCE("InstallUISequence"),
         ;
 
         Table(String name) {
@@ -95,6 +100,7 @@ final class MsiDatabase {
 
         static final Set<Table> FIND_PROPERTY_REQUIRED_TABLES = Set.of(PROPERTY);
         static final Set<Table> LIST_SHORTCUTS_REQUIRED_TABLES = Set.of(COMPONENT, DIRECTORY, FILE, SHORTCUT);
+        static final Set<Table> UI_ALTERATIONS_REQUIRED_TABLES = Set.of(CONTROL_EVENT, INSTALL_UI_SEQUENCE);
     }
 
 
@@ -120,12 +126,7 @@ final class MsiDatabase {
     }
 
     Collection<Shortcut> listShortcuts() {
-        var shortcuts = tables.get(Table.SHORTCUT);
-        if (shortcuts == null) {
-            return List.of();
-        }
-        return IntStream.range(0, shortcuts.rowCount()).mapToObj(i -> {
-            var row = shortcuts.row(i);
+        return rows(Table.SHORTCUT).map(row -> {
             var shortcutPath = directoryPath(row.apply("Directory_")).resolve(fileNameFromFieldValue(row.apply("Name")));
             var workDir = directoryPath(row.apply("WkDir"));
             var shortcutTarget = Path.of(expandFormattedString(row.apply("Target")));
@@ -133,6 +134,53 @@ final class MsiDatabase {
         }).toList();
     }
 
+    UIAlterations uiAlterations() {
+
+        var includeActions = Set.of("WelcomeEulaDlg", "WelcomeDlg");
+        var actions = actionSequence(Table.INSTALL_UI_SEQUENCE).filter(action -> {
+            return includeActions.contains(action.action());
+        }).sorted(Comparator.comparing(Action::sequence)).toList();
+
+        // Custom jpackage dialogs.
+        var jpackageDialogs = Set.of("InstallDirNotEmptyDlg", "ShortcutPromptDlg");
+
+        var includeControls = Set.of("Next", "Back");
+        var controlEvents = rows(Table.CONTROL_EVENT).map(row -> {
+            return new ControlEvent(
+                    row.apply("Dialog_"),
+                    row.apply("Control_"),
+                    row.apply("Event"),
+                    row.apply("Argument"),
+                    row.apply("Condition"),
+                    Integer.parseInt(row.apply("Ordering")));
+        }).filter(controlEvent -> {
+            if (jpackageDialogs.contains(controlEvent.dialog())) {
+                // Include controls of all custom jpackage dialogs.
+                return true;
+            }
+
+            if (controlEvent.ordering() >= 6) {
+                // jpackage assumes the standard WiX UI doesn't define control events
+                // for dialog sequences it alters with the order higher than 6.
+                // Include all such items.
+
+                if (includeControls.contains(controlEvent.control())) {
+                    // Include only specific controls that jpackage alters.
+                    return true;
+                }
+            }
+
+            return false;
+        }).sorted(Comparator.comparing(ControlEvent::dialog)
+                .thenComparing(ControlEvent::control)
+                .thenComparing(ControlEvent::event)
+                .thenComparing(ControlEvent::argument)
+                .thenComparing(ControlEvent::condition)
+                .thenComparing(Comparator.comparingInt(ControlEvent::ordering))).toList();
+
+        return new UIAlterations(actions, controlEvents);
+    }
+
     record Shortcut(Path path, Path target, Path workDir) {
 
         Shortcut {
@@ -148,6 +196,49 @@ final class MsiDatabase {
         }
     }
 
+    public record Action(String action, String condition, int sequence) {
+        public Action {
+            Objects.requireNonNull(action);
+            Objects.requireNonNull(condition);
+        }
+    }
+
+    public record ControlEvent(
+            String dialog,
+            String control,
+            String event,
+            String argument,
+            String condition,
+            int ordering) {
+
+        public ControlEvent {
+            Objects.requireNonNull(dialog);
+            Objects.requireNonNull(control);
+            Objects.requireNonNull(event);
+            Objects.requireNonNull(argument);
+            Objects.requireNonNull(condition);
+        }
+    }
+
+    public record UIAlterations(Collection<Action> installUISequence, Collection<ControlEvent> controlEvents) {
+
+        public UIAlterations {
+            Objects.requireNonNull(installUISequence);
+        }
+    }
+
+    private Stream<Action> actionSequence(Table tableName) {
+        return rows(tableName).map(row -> {
+            return new Action(row.apply("Action"), row.apply("Condition"), Integer.parseInt(row.apply("Sequence")));
+        });
+    }
+
+    private Stream<Function<String, String>> rows(Table tableName) {
+        return Optional.ofNullable(tables.get(tableName)).stream().flatMap(table -> {
+            return IntStream.range(0, table.rowCount()).mapToObj(table::row);
+        });
+    }
+
     private Path directoryPath(String directoryId) {
         var table = tables.get(Table.DIRECTORY);
         Path result = null;
@@ -339,20 +430,28 @@ final class MsiDatabase {
 
                 var columns = headerLines.get(0).split("\t");
 
-                var header = headerLines.get(2).split("\t", 4);
-                if (header.length == 3) {
-                    if (Pattern.matches("^[1-9]\\d+$", header[0])) {
-                        charset = Charset.forName(header[0]);
-                    } else {
-                        throw new IllegalArgumentException(String.format(
-                                "Unexpected charset name [%s] in [%s] file", header[0], idtFile));
-                    }
-                } else if (header.length != 2) {
+                int tableNameIdx;
+
+                var header = headerLines.get(2).split("\t");
+                if (Pattern.matches("^[1-9]\\d+$", header[0])) {
+                    charset = Charset.forName(header[0]);
+                    tableNameIdx = 1;
+                } else {
+                    tableNameIdx = 0;
+                }
+
+                if (header.length < (tableNameIdx + 2)) {
                     throw new IllegalArgumentException(String.format(
                             "Unexpected number of fields (%d) in the 3rd line of [%s] file",
                             header.length, idtFile));
                 }
 
+                var tableName = header[tableNameIdx];
+                List<String> primaryKeys = Arrays.asList(header).subList(tableNameIdx + 1, header.length);
+
+                TKit.trace(String.format("Table in [%s] file: charset=%s; name=%s; primary keys=%s",
+                        idtFile, charset, tableName, primaryKeys));
+
                 return new IdtFileHeader(charset, List.of(columns));
 
             } catch (IOException ex) {
diff --git a/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/WindowsHelper.java b/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/WindowsHelper.java
index c7b55ed1de7..98e9c4bfe61 100644
--- a/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/WindowsHelper.java
+++ b/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/WindowsHelper.java
@@ -276,6 +276,11 @@ public class WindowsHelper {
         return MsiDatabaseCache.INSTANCE.findProperty(cmd.outputBundle(), propertyName).orElseThrow();
     }
 
+    public static MsiDatabase.UIAlterations getUIAlterations(JPackageCommand cmd) {
+        cmd.verifyIsOfType(PackageType.WIN_MSI);
+        return MsiDatabaseCache.INSTANCE.uiAlterations(cmd.outputBundle());
+    }
+
     static Collection<MsiDatabase.Shortcut> getMsiShortcuts(JPackageCommand cmd) {
         cmd.verifyIsOfType(PackageType.WIN_MSI);
         return MsiDatabaseCache.INSTANCE.listShortcuts(cmd.outputBundle());
@@ -572,6 +577,10 @@ public class WindowsHelper {
             return ensureTables(msiPath, MsiDatabase.Table.LIST_SHORTCUTS_REQUIRED_TABLES).listShortcuts();
         }
 
+        MsiDatabase.UIAlterations uiAlterations(Path msiPath) {
+            return ensureTables(msiPath, MsiDatabase.Table.UI_ALTERATIONS_REQUIRED_TABLES).uiAlterations();
+        }
+
         MsiDatabase ensureTables(Path msiPath, Set<MsiDatabase.Table> tableNames) {
             Objects.requireNonNull(msiPath);
             try {
diff --git a/test/jdk/tools/jpackage/junit/share/jdk.jpackage/jdk/jpackage/internal/cli/help-windows.txt b/test/jdk/tools/jpackage/junit/share/jdk.jpackage/jdk/jpackage/internal/cli/help-windows.txt
index b72ba310f3f..7a098b847ad 100644
--- a/test/jdk/tools/jpackage/junit/share/jdk.jpackage/jdk/jpackage/internal/cli/help-windows.txt
+++ b/test/jdk/tools/jpackage/junit/share/jdk.jpackage/jdk/jpackage/internal/cli/help-windows.txt
@@ -203,3 +203,5 @@ Platform dependent options for creating the application package:
           URL of available application update information
   --win-upgrade-uuid <uuid>
           UUID associated with upgrades for this package
+  --win-with-ui
+          Enforces the installer to have UI
diff --git a/test/jdk/tools/jpackage/junit/share/jdk.jpackage/jdk/jpackage/internal/cli/jpackage-options.md b/test/jdk/tools/jpackage/junit/share/jdk.jpackage/jdk/jpackage/internal/cli/jpackage-options.md
index 60b79451547..64d3c6c075b 100644
--- a/test/jdk/tools/jpackage/junit/share/jdk.jpackage/jdk/jpackage/internal/cli/jpackage-options.md
+++ b/test/jdk/tools/jpackage/junit/share/jdk.jpackage/jdk/jpackage/internal/cli/jpackage-options.md
@@ -61,3 +61,4 @@
 | --win-shortcut-prompt | win-exe, win-msi | x | x |  | USE_LAST |
 | --win-update-url | win-exe, win-msi | x | x |  | USE_LAST |
 | --win-upgrade-uuid | win-exe, win-msi | x | x |  | USE_LAST |
+| --win-with-ui | win-exe, win-msi | x | x |  | USE_LAST |
diff --git a/test/jdk/tools/jpackage/junit/windows/jdk.jpackage/jdk/jpackage/internal/WixVariablesTest.java b/test/jdk/tools/jpackage/junit/windows/jdk.jpackage/jdk/jpackage/internal/WixVariablesTest.java
new file mode 100644
index 00000000000..a9d83c8d544
--- /dev/null
+++ b/test/jdk/tools/jpackage/junit/windows/jdk.jpackage/jdk/jpackage/internal/WixVariablesTest.java
@@ -0,0 +1,269 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+package jdk.jpackage.internal;
+
+import static jdk.jpackage.internal.WixToolset.WixToolsetType.Wix4;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertNotSame;
+import static org.junit.jupiter.api.Assertions.assertSame;
+import static org.junit.jupiter.api.Assertions.assertThrowsExactly;
+
+import java.util.HashMap;
+import java.util.List;
+import java.util.Map;
+import java.util.function.Consumer;
+import jdk.jpackage.internal.WixToolset.WixToolsetType;
+import org.junit.jupiter.api.Test;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.EnumSource;
+import org.junit.jupiter.params.provider.ValueSource;
+
+class WixVariablesTest {
+
+    @Test
+    void test_define() {
+        assertEquals(List.of("-d", "foo=yes"), new WixVariables().define("foo").toWixCommandLine(Wix4));
+    }
+
+    @ParameterizedTest
+    @ValueSource(booleans = {true, false})
+    void test_define_null(boolean immutable) {
+        assertThrows(NullPointerException.class, vars -> {
+            vars.define(null);
+        }, create(immutable));
+    }
+
+    @Test
+    void test_put() {
+        assertEquals(List.of("-d", "foo=bar"), new WixVariables().put("foo", "bar").toWixCommandLine(Wix4));
+    }
+
+    @ParameterizedTest
+    @ValueSource(booleans = {true, false})
+    void test_put_null(boolean immutable) {
+        assertThrows(NullPointerException.class, vars -> {
+            vars.put("foo", null);
+        }, create(immutable));
+
+        assertThrows(NullPointerException.class, vars -> {
+            vars.put(null, "foo");
+        }, create(immutable));
+    }
+
+    @Test
+    void test_putAll() {
+        assertEquals(List.of("-d", "foo=bar"), new WixVariables().putAll(Map.of("foo", "bar")).toWixCommandLine(Wix4));
+        assertEquals(List.of("-d", "foo=yes"), new WixVariables().putAll(new WixVariables().define("foo")).toWixCommandLine(Wix4));
+    }
+
+    @ParameterizedTest
+    @ValueSource(booleans = {true, false})
+    void test_putAll_null(boolean immutable) {
+
+        assertThrows(NullPointerException.class, vars -> {
+            vars.putAll((Map<String, String>)null);
+        }, create(immutable));
+
+        assertThrows(NullPointerException.class, vars -> {
+            vars.putAll((WixVariables)null);
+        }, create(immutable));
+
+        final var expectedExceptionType = immutable ? IllegalStateException.class : NullPointerException.class;
+
+        var other = new HashMap<String, String>();
+
+        other.clear();
+        other.put("foo", null);
+        assertThrows(expectedExceptionType, vars -> {
+            vars.putAll(other);
+        }, create(immutable));
+
+        other.clear();
+        other.put(null, "foo");
+        assertThrows(expectedExceptionType, vars -> {
+            vars.putAll(other);
+        }, create(immutable));
+    }
+
+    @Test
+    void testImmutable() {
+        var vars = new WixVariables().define("foo").createdImmutableCopy();
+
+        assertThrows(IllegalStateException.class, _ -> {
+            vars.putAll(Map.of());
+        }, vars);
+
+        assertThrows(IllegalStateException.class, _ -> {
+            vars.putAll(new WixVariables());
+        }, vars);
+
+        assertThrows(IllegalStateException.class, _ -> {
+            vars.define("foo");
+        }, vars);
+
+        assertThrows(IllegalStateException.class, _ -> {
+            vars.put("foo", "bar");
+        }, vars);
+
+        for (var allowOverrides : List.of(true, false)) {
+            assertThrows(IllegalStateException.class, _ -> {
+                vars.allowOverrides(allowOverrides);
+            }, vars);
+        }
+    }
+
+    @Test
+    void testDefaultOverridable() {
+        var vars = new WixVariables().define("foo");
+
+        assertThrows(IllegalStateException.class, _ -> {
+            vars.define("foo");
+        }, vars);
+
+        assertThrows(IllegalStateException.class, _ -> {
+            vars.put("foo", "no");
+        }, vars);
+
+        assertThrows(IllegalStateException.class, _ -> {
+            vars.put("foo", "yes");
+        }, vars);
+
+        assertThrows(IllegalStateException.class, _ -> {
+            vars.putAll(Map.of("foo", "A", "bar", "B"));
+        }, vars);
+
+        assertThrows(IllegalStateException.class, _ -> {
+            vars.putAll(new WixVariables().putAll(Map.of("foo", "A", "bar", "B")));
+        }, vars);
+    }
+
+    @ParameterizedTest
+    @ValueSource(booleans = {true, false})
+    void testOverridable_define(boolean overridable) {
+        var vars = new WixVariables().allowOverrides(overridable).define("foo");
+
+        if (overridable) {
+            vars.define("foo");
+        } else {
+            assertThrows(IllegalStateException.class, _ -> {
+                vars.define("foo");
+            }, vars);
+            vars.allowOverrides(true);
+            vars.define("foo");
+        }
+    }
+
+    @ParameterizedTest
+    @ValueSource(booleans = {true, false})
+    void testOverridable_put(boolean overridable) {
+        var vars = new WixVariables().allowOverrides(overridable).define("foo");
+
+        if (overridable) {
+            vars.put("foo", "bar");
+            assertEquals(List.of("-d", "foo=bar"), vars.toWixCommandLine(Wix4));
+        } else {
+            assertThrows(IllegalStateException.class, _ -> {
+                vars.put("foo", "bar");
+            }, vars);
+            vars.allowOverrides(true);
+            vars.put("foo", "bar");
+            assertEquals(List.of("-d", "foo=bar"), vars.toWixCommandLine(Wix4));
+        }
+    }
+
+    @ParameterizedTest
+    @ValueSource(booleans = {true, false})
+    void testOverridable_putAll(boolean overridable) {
+        var vars = new WixVariables().allowOverrides(overridable).define("foo");
+
+        var other = Map.of("foo", "A", "bar", "B");
+
+        if (overridable) {
+            vars.putAll(other);
+            assertEquals(List.of("-d", "bar=B", "-d", "foo=A"), vars.toWixCommandLine(Wix4));
+        } else {
+            assertThrows(IllegalStateException.class, _ -> {
+                vars.putAll(other);
+            }, vars);
+            vars.allowOverrides(true);
+            vars.putAll(other);
+            assertEquals(List.of("-d", "bar=B", "-d", "foo=A"), vars.toWixCommandLine(Wix4));
+        }
+    }
+
+    @Test
+    void test_createdImmutableCopy() {
+        var vars = new WixVariables().define("foo");
+
+        var copy = vars.createdImmutableCopy();
+
+        assertNotSame(vars, copy);
+
+        assertSame(copy, copy.createdImmutableCopy());
+
+        assertEquals(List.of("-d", "foo=yes"), copy.toWixCommandLine(Wix4));
+
+        vars.allowOverrides(true).put("foo", "bar");
+        assertEquals(List.of("-d", "foo=bar"), vars.toWixCommandLine(Wix4));
+        assertEquals(List.of("-d", "foo=yes"), copy.toWixCommandLine(Wix4));
+    }
+
+    @ParameterizedTest
+    @EnumSource(WixToolsetType.class)
+    void test_toWixCommandLine(WixToolsetType wixType) {
+        var args = new WixVariables().define("foo").put("bar", "a").toWixCommandLine(wixType);
+
+        var expectedArgs = switch (wixType) {
+            case Wix3 -> {
+                yield List.of("-dbar=a", "-dfoo=yes");
+            }
+            case Wix4 -> {
+                yield List.of("-d", "bar=a", "-d", "foo=yes");
+            }
+        };
+
+        assertEquals(expectedArgs, args);
+    }
+
+    private static WixVariables create(boolean immutable) {
+        var vars = new WixVariables();
+        if (immutable) {
+            return vars.createdImmutableCopy();
+        } else {
+            return vars;
+        }
+    }
+
+    private static void assertThrows(
+            Class<? extends RuntimeException> expectedExceptionType, Consumer<WixVariables> mutator, WixVariables vars) {
+
+        var content = vars.toWixCommandLine(Wix4);
+
+        assertThrowsExactly(expectedExceptionType, () -> {
+            mutator.accept(vars);
+        });
+
+        assertEquals(content, vars.toWixCommandLine(Wix4));
+    }
+}
diff --git a/test/jdk/tools/jpackage/junit/windows/jdk.jpackage/jdk/jpackage/internal/wixui/UISpecTest.java b/test/jdk/tools/jpackage/junit/windows/jdk.jpackage/jdk/jpackage/internal/wixui/UISpecTest.java
new file mode 100644
index 00000000000..08e7796ca50
--- /dev/null
+++ b/test/jdk/tools/jpackage/junit/windows/jdk.jpackage/jdk/jpackage/internal/wixui/UISpecTest.java
@@ -0,0 +1,85 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+package jdk.jpackage.internal.wixui;
+
+import java.util.ArrayList;
+import java.util.Collection;
+import java.util.List;
+import java.util.Map;
+import java.util.Objects;
+import java.util.stream.Collectors;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
+
+class UISpecTest {
+
+    @ParameterizedTest
+    @MethodSource
+    void test(UIConfig cfg) {
+        var uiSpec = UISpec.create(cfg);
+
+        validateCustomDialogSequence(uiSpec.customDialogSequence());
+    }
+
+    private static Collection<UIConfig> test() {
+
+        var testCases = new ArrayList<UIConfig>();
+
+        for (boolean withInstallDirChooserDlg : List.of(true, false)) {
+            for (boolean withShortcutPromptDlg : List.of(true, false)) {
+                for (boolean withLicenseDlg : List.of(true, false)) {
+                    testCases.add(UIConfig.build()
+                            .withInstallDirChooserDlg(withInstallDirChooserDlg)
+                            .withShortcutPromptDlg(withShortcutPromptDlg)
+                            .withLicenseDlg(withLicenseDlg)
+                            .create());
+                }
+            }
+        }
+
+        return testCases;
+    }
+
+    static void validateCustomDialogSequence(Map<DialogPair, Publish> seq) {
+        seq.entrySet().stream().map(DialogControl::new).collect(Collectors.toMap(x -> x, x -> x, (a, b) -> {
+            throw new AssertionError(String.format(
+                    "Dialog [%s] has multiple Publish elements associated with [%s] control", a.host(), a.hostedControl()));
+        }));
+    }
+
+    record DialogControl(Dialog host, Control hostedControl) {
+        DialogControl {
+            Objects.requireNonNull(host);
+            Objects.requireNonNull(hostedControl);
+        }
+
+        DialogControl(DialogPair pair, Publish publish) {
+            this(pair.first(), publish.control());
+        }
+
+        DialogControl(Map.Entry<DialogPair, Publish> e) {
+            this(e.getKey(), e.getValue());
+        }
+    }
+}
diff --git a/test/jdk/tools/jpackage/junit/windows/junit.java b/test/jdk/tools/jpackage/junit/windows/junit.java
index d27a282f0dc..1a1d0d58f7e 100644
--- a/test/jdk/tools/jpackage/junit/windows/junit.java
+++ b/test/jdk/tools/jpackage/junit/windows/junit.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2025, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -28,3 +28,20 @@
  *    jdk/jpackage/internal/ExecutableOSVersionTest.java
  * @run junit jdk.jpackage/jdk.jpackage.internal.ExecutableOSVersionTest
  */
+
+/* @test
+ * @summary WixVariables unit tests
+ * @requires (os.family == "windows")
+ * @compile/module=jdk.jpackage -Xlint:all -Werror
+ *    jdk/jpackage/internal/WixVariablesTest.java
+ * @run junit jdk.jpackage/jdk.jpackage.internal.WixVariablesTest
+ */
+
+/* @test
+ * @summary UiSpec unit tests
+ * @requires (os.family == "windows")
+ * @modules jdk.jpackage/jdk.jpackage.internal.wixui:open
+ * @compile/module=jdk.jpackage -Xlint:all -Werror
+ *    jdk/jpackage/internal/wixui/UISpecTest.java
+ * @run junit jdk.jpackage/jdk.jpackage.internal.wixui.UISpecTest
+ */
diff --git a/test/jdk/tools/jpackage/resources/WinInstallerUiTest/dir_chooser+license+shortcut_prompt/ControlEvents.md b/test/jdk/tools/jpackage/resources/WinInstallerUiTest/dir_chooser+license+shortcut_prompt/ControlEvents.md
new file mode 100644
index 00000000000..39e6b535e69
--- /dev/null
+++ b/test/jdk/tools/jpackage/resources/WinInstallerUiTest/dir_chooser+license+shortcut_prompt/ControlEvents.md
@@ -0,0 +1,8 @@
+| Dialog | Control | Event | Argument | Condition | Ordering |
+| --- | --- | --- | --- | --- | --- |
+| InstallDirNotEmptyDlg | No | NewDialog | InstallDirDlg | 1 | 1 |
+| InstallDirNotEmptyDlg | Yes | NewDialog | ShortcutPromptDlg | 1 | 1 |
+| ShortcutPromptDlg | Back | NewDialog | InstallDirDlg | 1 | 1 |
+| ShortcutPromptDlg | Cancel | SpawnDialog | CancelDlg | 1 | 1 |
+| ShortcutPromptDlg | Next | NewDialog | VerifyReadyDlg | 1 | 1 |
+| VerifyReadyDlg | Back | NewDialog | ShortcutPromptDlg | NOT Installed | 6 |
diff --git a/test/jdk/tools/jpackage/resources/WinInstallerUiTest/dir_chooser+license+shortcut_prompt/InstallUISequence.md b/test/jdk/tools/jpackage/resources/WinInstallerUiTest/dir_chooser+license+shortcut_prompt/InstallUISequence.md
new file mode 100644
index 00000000000..e583dfa4982
--- /dev/null
+++ b/test/jdk/tools/jpackage/resources/WinInstallerUiTest/dir_chooser+license+shortcut_prompt/InstallUISequence.md
@@ -0,0 +1,3 @@
+| Action | Condition |
+| --- | --- |
+| WelcomeDlg | NOT Installed OR PATCH |
diff --git a/test/jdk/tools/jpackage/resources/WinInstallerUiTest/dir_chooser+license/ControlEvents.md b/test/jdk/tools/jpackage/resources/WinInstallerUiTest/dir_chooser+license/ControlEvents.md
new file mode 100644
index 00000000000..1d908b0508a
--- /dev/null
+++ b/test/jdk/tools/jpackage/resources/WinInstallerUiTest/dir_chooser+license/ControlEvents.md
@@ -0,0 +1,4 @@
+| Dialog | Control | Event | Argument | Condition | Ordering |
+| --- | --- | --- | --- | --- | --- |
+| InstallDirNotEmptyDlg | No | NewDialog | InstallDirDlg | 1 | 1 |
+| InstallDirNotEmptyDlg | Yes | NewDialog | VerifyReadyDlg | 1 | 1 |
diff --git a/test/jdk/tools/jpackage/resources/WinInstallerUiTest/dir_chooser+license/InstallUISequence.md b/test/jdk/tools/jpackage/resources/WinInstallerUiTest/dir_chooser+license/InstallUISequence.md
new file mode 100644
index 00000000000..e583dfa4982
--- /dev/null
+++ b/test/jdk/tools/jpackage/resources/WinInstallerUiTest/dir_chooser+license/InstallUISequence.md
@@ -0,0 +1,3 @@
+| Action | Condition |
+| --- | --- |
+| WelcomeDlg | NOT Installed OR PATCH |
diff --git a/test/jdk/tools/jpackage/resources/WinInstallerUiTest/dir_chooser+shortcut_prompt/ControlEvents.md b/test/jdk/tools/jpackage/resources/WinInstallerUiTest/dir_chooser+shortcut_prompt/ControlEvents.md
new file mode 100644
index 00000000000..93d11c944e0
--- /dev/null
+++ b/test/jdk/tools/jpackage/resources/WinInstallerUiTest/dir_chooser+shortcut_prompt/ControlEvents.md
@@ -0,0 +1,10 @@
+| Dialog | Control | Event | Argument | Condition | Ordering |
+| --- | --- | --- | --- | --- | --- |
+| InstallDirDlg | Back | NewDialog | WelcomeDlg | NOT Installed | 6 |
+| InstallDirNotEmptyDlg | No | NewDialog | InstallDirDlg | 1 | 1 |
+| InstallDirNotEmptyDlg | Yes | NewDialog | ShortcutPromptDlg | 1 | 1 |
+| ShortcutPromptDlg | Back | NewDialog | InstallDirDlg | 1 | 1 |
+| ShortcutPromptDlg | Cancel | SpawnDialog | CancelDlg | 1 | 1 |
+| ShortcutPromptDlg | Next | NewDialog | VerifyReadyDlg | 1 | 1 |
+| VerifyReadyDlg | Back | NewDialog | ShortcutPromptDlg | NOT Installed | 6 |
+| WelcomeDlg | Next | NewDialog | InstallDirDlg | NOT Installed | 6 |
diff --git a/test/jdk/tools/jpackage/resources/WinInstallerUiTest/dir_chooser+shortcut_prompt/InstallUISequence.md b/test/jdk/tools/jpackage/resources/WinInstallerUiTest/dir_chooser+shortcut_prompt/InstallUISequence.md
new file mode 100644
index 00000000000..e583dfa4982
--- /dev/null
+++ b/test/jdk/tools/jpackage/resources/WinInstallerUiTest/dir_chooser+shortcut_prompt/InstallUISequence.md
@@ -0,0 +1,3 @@
+| Action | Condition |
+| --- | --- |
+| WelcomeDlg | NOT Installed OR PATCH |
diff --git a/test/jdk/tools/jpackage/resources/WinInstallerUiTest/dir_chooser/ControlEvents.md b/test/jdk/tools/jpackage/resources/WinInstallerUiTest/dir_chooser/ControlEvents.md
new file mode 100644
index 00000000000..2fcc387732a
--- /dev/null
+++ b/test/jdk/tools/jpackage/resources/WinInstallerUiTest/dir_chooser/ControlEvents.md
@@ -0,0 +1,6 @@
+| Dialog | Control | Event | Argument | Condition | Ordering |
+| --- | --- | --- | --- | --- | --- |
+| InstallDirDlg | Back | NewDialog | WelcomeDlg | NOT Installed | 6 |
+| InstallDirNotEmptyDlg | No | NewDialog | InstallDirDlg | 1 | 1 |
+| InstallDirNotEmptyDlg | Yes | NewDialog | VerifyReadyDlg | 1 | 1 |
+| WelcomeDlg | Next | NewDialog | InstallDirDlg | NOT Installed | 6 |
diff --git a/test/jdk/tools/jpackage/resources/WinInstallerUiTest/dir_chooser/InstallUISequence.md b/test/jdk/tools/jpackage/resources/WinInstallerUiTest/dir_chooser/InstallUISequence.md
new file mode 100644
index 00000000000..e583dfa4982
--- /dev/null
+++ b/test/jdk/tools/jpackage/resources/WinInstallerUiTest/dir_chooser/InstallUISequence.md
@@ -0,0 +1,3 @@
+| Action | Condition |
+| --- | --- |
+| WelcomeDlg | NOT Installed OR PATCH |
diff --git a/test/jdk/tools/jpackage/resources/WinInstallerUiTest/license+shortcut_prompt/ControlEvents.md b/test/jdk/tools/jpackage/resources/WinInstallerUiTest/license+shortcut_prompt/ControlEvents.md
new file mode 100644
index 00000000000..72e8b80ca08
--- /dev/null
+++ b/test/jdk/tools/jpackage/resources/WinInstallerUiTest/license+shortcut_prompt/ControlEvents.md
@@ -0,0 +1,7 @@
+| Dialog | Control | Event | Argument | Condition | Ordering |
+| --- | --- | --- | --- | --- | --- |
+| LicenseAgreementDlg | Next | NewDialog | ShortcutPromptDlg | LicenseAccepted = "1" | 6 |
+| ShortcutPromptDlg | Back | NewDialog | LicenseAgreementDlg | 1 | 1 |
+| ShortcutPromptDlg | Cancel | SpawnDialog | CancelDlg | 1 | 1 |
+| ShortcutPromptDlg | Next | NewDialog | VerifyReadyDlg | 1 | 1 |
+| VerifyReadyDlg | Back | NewDialog | ShortcutPromptDlg | NOT Installed | 6 |
diff --git a/test/jdk/tools/jpackage/resources/WinInstallerUiTest/license+shortcut_prompt/InstallUISequence.md b/test/jdk/tools/jpackage/resources/WinInstallerUiTest/license+shortcut_prompt/InstallUISequence.md
new file mode 100644
index 00000000000..e583dfa4982
--- /dev/null
+++ b/test/jdk/tools/jpackage/resources/WinInstallerUiTest/license+shortcut_prompt/InstallUISequence.md
@@ -0,0 +1,3 @@
+| Action | Condition |
+| --- | --- |
+| WelcomeDlg | NOT Installed OR PATCH |
diff --git a/test/jdk/tools/jpackage/resources/WinInstallerUiTest/license/ControlEvents.md b/test/jdk/tools/jpackage/resources/WinInstallerUiTest/license/ControlEvents.md
new file mode 100644
index 00000000000..7a9bcca86f3
--- /dev/null
+++ b/test/jdk/tools/jpackage/resources/WinInstallerUiTest/license/ControlEvents.md
@@ -0,0 +1,2 @@
+| Dialog | Control | Event | Argument | Condition | Ordering |
+| --- | --- | --- | --- | --- | --- |
diff --git a/test/jdk/tools/jpackage/resources/WinInstallerUiTest/license/InstallUISequence.md b/test/jdk/tools/jpackage/resources/WinInstallerUiTest/license/InstallUISequence.md
new file mode 100644
index 00000000000..3008e0db54b
--- /dev/null
+++ b/test/jdk/tools/jpackage/resources/WinInstallerUiTest/license/InstallUISequence.md
@@ -0,0 +1,4 @@
+| Action | Condition |
+| --- | --- |
+| WelcomeDlg | Installed AND PATCH |
+| WelcomeEulaDlg | NOT Installed |
diff --git a/test/jdk/tools/jpackage/resources/WinInstallerUiTest/shortcut_prompt/ControlEvents.md b/test/jdk/tools/jpackage/resources/WinInstallerUiTest/shortcut_prompt/ControlEvents.md
new file mode 100644
index 00000000000..a93b0ecbff1
--- /dev/null
+++ b/test/jdk/tools/jpackage/resources/WinInstallerUiTest/shortcut_prompt/ControlEvents.md
@@ -0,0 +1,7 @@
+| Dialog | Control | Event | Argument | Condition | Ordering |
+| --- | --- | --- | --- | --- | --- |
+| ShortcutPromptDlg | Back | NewDialog | WelcomeDlg | NOT Installed | 6 |
+| ShortcutPromptDlg | Cancel | SpawnDialog | CancelDlg | 1 | 1 |
+| ShortcutPromptDlg | Next | NewDialog | VerifyReadyDlg | 1 | 1 |
+| VerifyReadyDlg | Back | NewDialog | ShortcutPromptDlg | NOT Installed | 6 |
+| WelcomeDlg | Next | NewDialog | ShortcutPromptDlg | NOT Installed | 6 |
diff --git a/test/jdk/tools/jpackage/resources/WinInstallerUiTest/shortcut_prompt/InstallUISequence.md b/test/jdk/tools/jpackage/resources/WinInstallerUiTest/shortcut_prompt/InstallUISequence.md
new file mode 100644
index 00000000000..e583dfa4982
--- /dev/null
+++ b/test/jdk/tools/jpackage/resources/WinInstallerUiTest/shortcut_prompt/InstallUISequence.md
@@ -0,0 +1,3 @@
+| Action | Condition |
+| --- | --- |
+| WelcomeDlg | NOT Installed OR PATCH |
diff --git a/test/jdk/tools/jpackage/resources/WinInstallerUiTest/ui/ControlEvents.md b/test/jdk/tools/jpackage/resources/WinInstallerUiTest/ui/ControlEvents.md
new file mode 100644
index 00000000000..7a9bcca86f3
--- /dev/null
+++ b/test/jdk/tools/jpackage/resources/WinInstallerUiTest/ui/ControlEvents.md
@@ -0,0 +1,2 @@
+| Dialog | Control | Event | Argument | Condition | Ordering |
+| --- | --- | --- | --- | --- | --- |
diff --git a/test/jdk/tools/jpackage/resources/WinInstallerUiTest/ui/InstallUISequence.md b/test/jdk/tools/jpackage/resources/WinInstallerUiTest/ui/InstallUISequence.md
new file mode 100644
index 00000000000..6e3eef39f43
--- /dev/null
+++ b/test/jdk/tools/jpackage/resources/WinInstallerUiTest/ui/InstallUISequence.md
@@ -0,0 +1,4 @@
+| Action | Condition |
+| --- | --- |
+| WelcomeDlg | Installed AND PATCH |
+| WelcomeEulaDlg | 0 |
diff --git a/test/jdk/tools/jpackage/resources/msi-export.js b/test/jdk/tools/jpackage/resources/msi-export.js
index d639f19ca44..6cb5ab5a781 100644
--- a/test/jdk/tools/jpackage/resources/msi-export.js
+++ b/test/jdk/tools/jpackage/resources/msi-export.js
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2025, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -71,7 +71,7 @@ function exportTables(db, outputDir, requestedTableNames) {
   var msi = WScript.arguments(0)
   var outputDir = WScript.arguments(1)
   var tables = {}
-  for (var i = 0; i !== WScript.arguments.Count(); i++) {
+  for (var i = 2; i !== WScript.arguments.Count(); i++) {
     tables[WScript.arguments(i)] = true
   }
 
diff --git a/test/jdk/tools/jpackage/windows/WinInstallerUiTest.java b/test/jdk/tools/jpackage/windows/WinInstallerUiTest.java
index d6cebde6444..e9238c1a6f7 100644
--- a/test/jdk/tools/jpackage/windows/WinInstallerUiTest.java
+++ b/test/jdk/tools/jpackage/windows/WinInstallerUiTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2021, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2021, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -21,114 +21,299 @@
  * questions.
  */
 
+import java.io.IOException;
+import java.io.UncheckedIOException;
 import java.nio.file.Files;
 import java.nio.file.Path;
+import java.nio.file.StandardOpenOption;
 import java.util.ArrayList;
+import java.util.Collection;
+import java.util.Collections;
 import java.util.List;
+import java.util.Set;
+import java.util.function.Predicate;
+import java.util.regex.Pattern;
+import java.util.stream.Collectors;
+import java.util.stream.Stream;
 import jdk.jpackage.internal.util.Slot;
-import jdk.jpackage.test.Annotations.Parameters;
+import jdk.jpackage.test.Annotations.ParameterSupplier;
 import jdk.jpackage.test.Annotations.Test;
 import jdk.jpackage.test.JPackageCommand;
+import jdk.jpackage.test.MsiDatabase;
+import jdk.jpackage.test.MsiDatabase.UIAlterations;
+import jdk.jpackage.test.MsiDatabase.ControlEvent;
 import jdk.jpackage.test.PackageTest;
 import jdk.jpackage.test.PackageType;
+import jdk.jpackage.test.RunnablePackageTest.Action;
 import jdk.jpackage.test.TKit;
+import jdk.jpackage.test.WindowsHelper;
 
 /**
- * Test all possible combinations of --win-dir-chooser, --win-shortcut-prompt
+ * Test combinations of --win-dir-chooser, --win-shortcut-prompt, --win-with-ui,
  * and --license parameters.
  */
 
 /*
  * @test
- * @summary jpackage with --win-dir-chooser, --win-shortcut-prompt and --license parameters
+ * @summary jpackage with --win-dir-chooser, --win-shortcut-prompt, --with-with-ui and --license parameters
  * @library /test/jdk/tools/jpackage/helpers
  * @key jpackagePlatformPackage
  * @build jdk.jpackage.test.*
  * @build WinInstallerUiTest
  * @requires (os.family == "windows")
+ * @requires (jpackage.test.SQETest != null)
+ * @run main/othervm/timeout=720 -Xmx512m  jdk.jpackage.test.Main
+ *  --jpt-run=WinInstallerUiTest
+ *  --jpt-exclude=(dir_chooser)
+ *  --jpt-exclude=(license)
+ *  --jpt-exclude=+ui
+ */
+
+/*
+ * @test
+ * @summary jpackage with --win-dir-chooser, --win-shortcut-prompt, --with-with-ui and --license parameters
+ * @library /test/jdk/tools/jpackage/helpers
+ * @key jpackagePlatformPackage
+ * @build jdk.jpackage.test.*
+ * @build WinInstallerUiTest
+ * @requires (os.family == "windows")
+ * @requires (jpackage.test.SQETest == null)
  * @run main/othervm/timeout=720 -Xmx512m  jdk.jpackage.test.Main
  *  --jpt-run=WinInstallerUiTest
  */
+
 public class WinInstallerUiTest {
 
-    public WinInstallerUiTest(Boolean withDirChooser, Boolean withLicense,
-            Boolean withShortcutPrompt) {
-        this.withShortcutPrompt = withShortcutPrompt;
-        this.withDirChooser = withDirChooser;
-        this.withLicense = withLicense;
+    @Test
+    @ParameterSupplier
+    public void test(TestSpec spec) {
+        spec.run();
     }
 
-    @Parameters
-    public static List<Object[]> data() {
-        List<Object[]> data = new ArrayList<>();
-        for (var withDirChooser : List.of(Boolean.TRUE, Boolean.FALSE)) {
-            for (var withLicense : List.of(Boolean.TRUE, Boolean.FALSE)) {
-                for (var withShortcutPrompt : List.of(Boolean.TRUE, Boolean.FALSE)) {
+    public static void updateExpectedMsiTables() {
+        for (var spec : testCases()) {
+            spec.createTest(true).addBundleVerifier(cmd -> {
+                spec.save(WindowsHelper.getUIAlterations(cmd));
+            }).run(Action.CREATE);
+        }
+    }
+
+    record TestSpec(
+            boolean withDirChooser,
+            boolean withLicense,
+            boolean withShortcutPrompt,
+            boolean withUi) {
+
+        TestSpec {
+            if (!withDirChooser && !withLicense && !withShortcutPrompt && !withUi) {
+                throw new IllegalArgumentException();
+            }
+        }
+
+        @Override
+        public String toString() {
+            var tokens = new ArrayList<String>();
+            if (withDirChooser) {
+                tokens.add("dir_chooser");
+            }
+
+            if (withShortcutPrompt) {
+                tokens.add("shortcut_prompt");
+            }
+
+            if (withLicense) {
+                tokens.add("license");
+            }
+
+            if (withUi) {
+                tokens.add("ui");
+            }
+
+            return tokens.stream().sorted().collect(Collectors.joining("+"));
+        }
+
+        TestSpec copyWithUi(boolean withUi) {
+            return new TestSpec(withDirChooser, withLicense, withShortcutPrompt, withUi);
+        }
+
+        TestSpec copyWithUi() {
+            return copyWithUi(true);
+        }
+
+        TestSpec copyWithoutUi() {
+            return copyWithUi(false);
+        }
+
+        void run() {
+            createTest(false).forTypes(PackageType.WIN_MSI).addBundleVerifier(cmd -> {
+                var expectedFilesDir = expectedFilesDir();
+
+                var expectedInstallUISequence = Files.readAllLines(expectedFilesDir.resolve(INSTALL_UI_SEQUENCE_FILE));
+                var expectedControlEvents = Files.readAllLines(expectedFilesDir.resolve(CONTROL_EVENTS_FILE));
+
+                var uiAlterations = WindowsHelper.getUIAlterations(cmd);
+
+                var actualInstallUISequence = actionSequenceToMarkdownTable(uiAlterations.installUISequence());
+                var actualControlEvents = controlEventsToMarkdownTable(uiAlterations.controlEvents());
+
+                TKit.assertStringListEquals(expectedInstallUISequence, actualInstallUISequence,
+                        String.format("Check alterations to the `InstallUISequence` MSI table match the contents of [%s] file",
+                                expectedFilesDir.resolve(INSTALL_UI_SEQUENCE_FILE)));
+
+                TKit.assertStringListEquals(expectedControlEvents, actualControlEvents,
+                        String.format("Check alterations to the `ControlEvents` MSI table match the contents of [%s] file",
+                                expectedFilesDir.resolve(CONTROL_EVENTS_FILE)));
+            }).run();
+        }
+
+        PackageTest createTest(boolean onlyMsi) {
+            return new PackageTest()
+                    .forTypes(onlyMsi ? Set.of(PackageType.WIN_MSI) : PackageType.WINDOWS)
+                    .configureHelloApp()
+                    .addInitializer(JPackageCommand::setFakeRuntime)
+                    .addInitializer(this::setPackageName)
+                    .mutate(test -> {
+                        if (withDirChooser) {
+                            test.addInitializer(cmd -> cmd.addArgument("--win-dir-chooser"));
+                        }
+
+                        if (withShortcutPrompt) {
+                            test.addInitializer(cmd -> {
+                                cmd.addArgument("--win-shortcut-prompt");
+                                cmd.addArgument("--win-menu");
+                                cmd.addArgument("--win-shortcut");
+                            });
+                        }
+
+                        if (withLicense) {
+                            setLicenseFile(test);
+                        }
+
+                        if (withUi) {
+                            test.addInitializer(cmd -> cmd.addArgument("--win-with-ui"));
+                        }
+                    });
+        }
+
+        private void setPackageName(JPackageCommand cmd) {
+            StringBuilder sb = new StringBuilder(cmd.name());
+            sb.append("With");
+            if (withDirChooser) {
+                sb.append("Dc"); // DirChooser
+            }
+            if (withShortcutPrompt) {
+                sb.append("Sp"); // ShortcutPrompt
+            }
+            if (withLicense) {
+                sb.append("L"); // License
+            }
+            if (withUi) {
+                sb.append("Ui"); // UI
+            }
+            cmd.setArgumentValue("--name", sb.toString());
+        }
+
+        void save(UIAlterations uiAlterations) {
+            var expectedFilesDir = expectedFilesDir();
+
+            write(expectedFilesDir.resolve(INSTALL_UI_SEQUENCE_FILE),
+                    actionSequenceToMarkdownTable(uiAlterations.installUISequence()));
+
+            write(expectedFilesDir.resolve(CONTROL_EVENTS_FILE),
+                    controlEventsToMarkdownTable(uiAlterations.controlEvents()));
+        }
+
+        private Path expectedFilesDir() {
+            if ((withDirChooser || withShortcutPrompt || withLicense) && withUi) {
+                return copyWithoutUi().expectedFilesDir();
+            } else {
+                return EXPECTED_MSI_TABLES_ROOT.resolve(toString());
+            }
+        }
+
+        private void write(Path file, List<String> lines) {
+            try {
+                Files.createDirectories(file.getParent());
+                Files.write(file, lines, StandardOpenOption.CREATE, StandardOpenOption.TRUNCATE_EXISTING);
+            } catch (IOException ex) {
+                throw new UncheckedIOException(ex);
+            }
+        }
+
+        private static List<String> toMarkdownTable(List<String> header, Stream<String[]> content) {
+            return Stream.of(
+                    Stream.<String[]>of(header.toArray(String[]::new)),
+                    Stream.<String[]>of(Collections.nCopies(header.size(), "---").toArray(String[]::new)),
+                    content
+            ).flatMap(x -> x).map(row -> {
+                return Stream.of(row).map(v -> {
+                    // Escape the pipe (|) character.
+                    return v.replaceAll(Pattern.quote("|"), "&#124;");
+                }).collect(Collectors.joining(" | ", "| ", " |"));
+            }).toList();
+        }
+
+        private static List<String> actionSequenceToMarkdownTable(Collection<MsiDatabase.Action> actions) {
+            return toMarkdownTable(
+                    List.of("Action", "Condition"),
+                    actions.stream().map(action -> {
+                        return toStringArray(action.action(), action.condition());
+                    })
+            );
+        }
+
+        private static List<String> controlEventsToMarkdownTable(Collection<ControlEvent> controlEvents) {
+            return toMarkdownTable(
+                    List.of("Dialog", "Control", "Event", "Argument", "Condition", "Ordering"),
+                    controlEvents.stream().map(controlEvent -> {
+                        return toStringArray(
+                                controlEvent.dialog(),
+                                controlEvent.control(),
+                                controlEvent.event(),
+                                controlEvent.argument(),
+                                controlEvent.condition(),
+                                Integer.toString(controlEvent.ordering()));
+                    })
+            );
+        }
+
+        private static String[] toStringArray(String... items) {
+            return items;
+        }
+
+        private static final String CONTROL_EVENTS_FILE = "ControlEvents.md";
+        private static final String INSTALL_UI_SEQUENCE_FILE = "InstallUISequence.md";
+    }
+
+    public static Collection<?> test() {
+        return Stream.concat(
+                testCases().stream().filter(Predicate.not(TestSpec::withUi)).map(TestSpec::copyWithUi),
+                testCases().stream()
+        ).map(v -> {
+            return new Object[] {v};
+        }).toList();
+    }
+
+    private static Collection<TestSpec> testCases() {
+        var testCases = new ArrayList<TestSpec>();
+
+        for (var withDirChooser : List.of(true, false)) {
+            for (var withLicense : List.of(true, false)) {
+                for (var withShortcutPrompt : List.of(true, false)) {
                     if (!withDirChooser && !withLicense && !withShortcutPrompt) {
                         // Duplicates SimplePackageTest
                         continue;
                     }
 
-                    if (withDirChooser && !withLicense && !withShortcutPrompt) {
-                        // Duplicates WinDirChooserTest
-                        continue;
-                    }
-
-                    if (!withDirChooser && withLicense && !withShortcutPrompt) {
-                        // Duplicates LicenseTest
-                        continue;
-                    }
-
-                    data.add(new Object[]{withDirChooser, withLicense,
-                        withShortcutPrompt});
+                    testCases.add(new TestSpec(withDirChooser, withLicense, withShortcutPrompt, false));
                 }
             }
         }
 
-        return data;
-    }
+        // Enforce UI
+        testCases.add(new TestSpec(false, false, false, true));
 
-    @Test
-    public void test() {
-        PackageTest test = new PackageTest()
-                .forTypes(PackageType.WINDOWS)
-                .configureHelloApp();
-
-        test.addInitializer(JPackageCommand::setFakeRuntime);
-        test.addInitializer(this::setPackageName);
-
-        if (withDirChooser) {
-            test.addInitializer(cmd -> cmd.addArgument("--win-dir-chooser"));
-        }
-
-        if (withShortcutPrompt) {
-            test.addInitializer(cmd -> {
-                cmd.addArgument("--win-shortcut-prompt");
-                cmd.addArgument("--win-menu");
-                cmd.addArgument("--win-shortcut");
-            });
-        }
-
-        if (withLicense) {
-            setLicenseFile(test);
-        }
-
-        test.run();
-    }
-
-    private void setPackageName(JPackageCommand cmd) {
-        StringBuilder sb = new StringBuilder(cmd.name());
-        sb.append("With");
-        if (withDirChooser) {
-            sb.append("Dc"); // DirChooser
-        }
-        if (withShortcutPrompt) {
-            sb.append("Sp"); // ShortcutPrompt
-        }
-        if (withLicense) {
-            sb.append("L"); // License
-        }
-        cmd.setArgumentValue("--name", sb.toString());
+        return testCases;
     }
 
     private static void setLicenseFile(PackageTest test) {
@@ -143,9 +328,8 @@ public class WinInstallerUiTest {
         });
     }
 
-    private final boolean withDirChooser;
-    private final boolean withLicense;
-    private final boolean withShortcutPrompt;
-
     private static final Path LICENSE_FILE = TKit.TEST_SRC_ROOT.resolve(Path.of("resources", "license.txt"));
+
+    private static final Path EXPECTED_MSI_TABLES_ROOT = TKit.TEST_SRC_ROOT.resolve(
+            Path.of("resources", WinInstallerUiTest.class.getSimpleName()));
 }
diff --git a/test/jdk/tools/jpackage/windows/WinL10nTest.java b/test/jdk/tools/jpackage/windows/WinL10nTest.java
index 14139013318..4d983df2598 100644
--- a/test/jdk/tools/jpackage/windows/WinL10nTest.java
+++ b/test/jdk/tools/jpackage/windows/WinL10nTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2020, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -21,22 +21,22 @@
  * questions.
  */
 
+import static jdk.jpackage.test.WindowsHelper.getWixTypeFromVerboseJPackageOutput;
+import static jdk.jpackage.test.WindowsHelper.WixType.WIX3;
+
 import java.io.IOException;
 import java.nio.file.Path;
-import jdk.jpackage.test.TKit;
-import jdk.jpackage.test.PackageTest;
-import jdk.jpackage.test.PackageType;
-import jdk.jpackage.test.Annotations.Test;
-import jdk.jpackage.test.Annotations.Parameters;
-
 import java.util.Arrays;
 import java.util.List;
 import java.util.function.Predicate;
 import java.util.stream.Collectors;
 import java.util.stream.Stream;
+import jdk.jpackage.test.Annotations.Parameters;
+import jdk.jpackage.test.Annotations.Test;
 import jdk.jpackage.test.Executor;
-import static jdk.jpackage.test.WindowsHelper.WixType.WIX3;
-import static jdk.jpackage.test.WindowsHelper.getWixTypeFromVerboseJPackageOutput;
+import jdk.jpackage.test.PackageTest;
+import jdk.jpackage.test.PackageType;
+import jdk.jpackage.test.TKit;
 
 /*
  * @test
@@ -124,8 +124,17 @@ public class WinL10nTest {
         var toolFileName = wixToolName + ".exe";
         return (s) -> {
             s = s.trim();
-            return s.startsWith(toolFileName) || ((s.contains(String.format("\\%s ", toolFileName)) && s.
-                    contains(" -out ")));
+
+            if (s.startsWith(toolFileName)) {
+                return true;
+            }
+
+            // Accommodate for:
+            //     'C:\Program Files (x86)\WiX Toolset v3.14\bin\light.exe' ...
+            //     light.exe ...
+            return Stream.of("\\%s ", "\\%s' ").map(format -> {
+                return String.format(format, toolFileName);
+            }).anyMatch(s::contains) && s.contains(" -out ");
         };
     }
 

From 3c09c2cd2d8e93844f366a3c9e2e3790ecc0d029 Mon Sep 17 00:00:00 2001
From: Prasanta Sadhukhan <psadhukhan@openjdk.org>
Date: Fri, 20 Mar 2026 02:38:41 +0000
Subject: [PATCH 271/655] 8267961: JInternalFrame.getNormalBounds() returns
 normalBounds when maximized state is false instead of bounds

Reviewed-by: tr, dnguyen
---
 .../classes/javax/swing/JInternalFrame.java   |  6 ++
 .../TestNonMaximizedNormalBounds.java         | 73 +++++++++++++++++++
 2 files changed, 79 insertions(+)
 create mode 100644 test/jdk/javax/swing/JInternalFrame/TestNonMaximizedNormalBounds.java

diff --git a/src/java.desktop/share/classes/javax/swing/JInternalFrame.java b/src/java.desktop/share/classes/javax/swing/JInternalFrame.java
index f3295cd6ad8..dec53d29e75 100644
--- a/src/java.desktop/share/classes/javax/swing/JInternalFrame.java
+++ b/src/java.desktop/share/classes/javax/swing/JInternalFrame.java
@@ -987,6 +987,9 @@ public class JInternalFrame extends JComponent implements
             = "Indicates whether this internal frame is maximized.")
     public void setMaximum(boolean b) throws PropertyVetoException {
         if (isMaximum == b) {
+            if (!b) {
+                normalBounds = null;
+            }
             return;
         }
 
@@ -998,6 +1001,9 @@ public class JInternalFrame extends JComponent implements
            get it wrong... See, for example, getNormalBounds() */
         isMaximum = b;
         firePropertyChange(IS_MAXIMUM_PROPERTY, oldValue, newValue);
+        if (!b) {
+            normalBounds = null;
+        }
     }
 
     /**
diff --git a/test/jdk/javax/swing/JInternalFrame/TestNonMaximizedNormalBounds.java b/test/jdk/javax/swing/JInternalFrame/TestNonMaximizedNormalBounds.java
new file mode 100644
index 00000000000..67faeeb5bb1
--- /dev/null
+++ b/test/jdk/javax/swing/JInternalFrame/TestNonMaximizedNormalBounds.java
@@ -0,0 +1,73 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+ /*
+  * @test
+  * @key headful
+  * @bug 8267961
+  * @summary Verify JInternalFrame.getNormalBounds()
+  *          returns getBounds() value in non-maximized state
+  * @run main TestNonMaximizedNormalBounds
+  */
+
+import java.awt.Rectangle;
+import javax.swing.JDesktopPane;
+import javax.swing.JInternalFrame;
+import javax.swing.SwingUtilities;
+import java.beans.PropertyVetoException;
+
+public class TestNonMaximizedNormalBounds {
+
+    private static volatile Rectangle bounds;
+    private static volatile Rectangle normalBounds;
+    private static JInternalFrame jif;
+
+    public static void main(String[] args) throws Exception {
+        SwingUtilities.invokeAndWait(() -> {
+            Rectangle bounds = new Rectangle(96, 97, 98, 99);
+            Rectangle nbounds = new Rectangle(196, 197, 198, 199);
+            JDesktopPane p = new JDesktopPane();
+            jif = new JInternalFrame();
+            p.add(jif);
+            jif.setBounds(bounds);
+            jif.setNormalBounds(nbounds);
+        });
+        Thread.sleep(100);
+        SwingUtilities.invokeAndWait(() -> {
+            try {
+                jif.setMaximum(false);
+            } catch (PropertyVetoException e) {
+                throw new RuntimeException(e);
+            }
+        });
+        Thread.sleep(100);
+        SwingUtilities.invokeAndWait(() -> {
+            normalBounds = jif.getNormalBounds();
+            bounds = jif.getBounds();
+        });
+        if (!normalBounds.equals(bounds)) {
+            System.out.println("normalBounds " + normalBounds + " getBounds " + bounds);
+            throw new RuntimeException("normalBounds not equal to getBounds in non-maximized state");
+        }
+    }
+}

From b79449f0938c2abd63d44d613a0de6720913699f Mon Sep 17 00:00:00 2001
From: Alexey Semenyuk <asemenyuk@openjdk.org>
Date: Fri, 20 Mar 2026 03:01:03 +0000
Subject: [PATCH 272/655] 8379431: [macos] jpackage issues unexpected warning
 when bundling an unsigned runtime package from the signed predefined runtime
 bundle

Reviewed-by: almatvee
---
 .../jpackage/internal/MacPackageBuilder.java  |  4 +-
 .../test/JPackageOutputValidator.java         | 47 +++++++++++++------
 .../jpackage/test/JPackageStringBundle.java   | 14 ++++++
 .../SigningRuntimeImagePackageTest.java       |  9 ++++
 .../tools/jpackage/share/AppVersionTest.java  | 11 ++---
 5 files changed, 62 insertions(+), 23 deletions(-)

diff --git a/src/jdk.jpackage/macosx/classes/jdk/jpackage/internal/MacPackageBuilder.java b/src/jdk.jpackage/macosx/classes/jdk/jpackage/internal/MacPackageBuilder.java
index e19f234d0d6..1049496146f 100644
--- a/src/jdk.jpackage/macosx/classes/jdk/jpackage/internal/MacPackageBuilder.java
+++ b/src/jdk.jpackage/macosx/classes/jdk/jpackage/internal/MacPackageBuilder.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2025, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -65,7 +65,7 @@ final class MacPackageBuilder {
     }
 
     private static void validatePredefinedAppImage(MacPackage pkg) {
-        if (pkg.predefinedAppImageSigned().orElse(false)) {
+        if (pkg.predefinedAppImageSigned().orElse(false) && !pkg.isRuntimeInstaller()) {
             pkg.predefinedAppImage().ifPresent(predefinedAppImage -> {
                 var thePackageFile = PackageFile.getPathInAppImage(APPLICATION_LAYOUT);
                 if (!Files.exists(predefinedAppImage.resolve(thePackageFile))) {
diff --git a/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/JPackageOutputValidator.java b/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/JPackageOutputValidator.java
index c5c9c018b6a..ed14f40f65c 100644
--- a/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/JPackageOutputValidator.java
+++ b/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/JPackageOutputValidator.java
@@ -43,7 +43,7 @@ public final class JPackageOutputValidator {
     }
 
     public JPackageOutputValidator(JPackageOutputValidator other) {
-        stdout = other.stdout;
+        stream = other.stream;
         match = other.match;
         matchTimestamps = other.matchTimestamps;
         stripTimestamps = other.stripTimestamps;
@@ -59,7 +59,7 @@ public final class JPackageOutputValidator {
      * @return this
      */
     public JPackageOutputValidator stdout() {
-        stdout = true;
+        stream = StdStream.OUT;
         return this;
     }
 
@@ -68,7 +68,16 @@ public final class JPackageOutputValidator {
      * @return this
      */
     public JPackageOutputValidator stderr() {
-        stdout = false;
+        stream = StdStream.ERR;
+        return this;
+    }
+
+    /**
+     * Configures this validator to validate both stdout and stderr.
+     * @return this
+     */
+    public JPackageOutputValidator stdoutAndStderr() {
+        stream = StdStream.OUT_AND_ERR;
         return this;
     }
 
@@ -171,7 +180,7 @@ public final class JPackageOutputValidator {
     }
 
     public JPackageOutputValidator compose(JPackageOutputValidator other) {
-        if (stdout != other.stdout) {
+        if (stream != other.stream) {
             throw new IllegalArgumentException();
         }
         if (match != other.match) {
@@ -188,7 +197,7 @@ public final class JPackageOutputValidator {
 
     private Optional<Consumer<Executor.Result>> toResultConsumer(JPackageCommand cmd) {
         return toStringIteratorConsumer(cmd).map(validator -> {
-            return toResultConsumer(validator, stdout, match, label());
+            return toResultConsumer(validator, stream, match, label());
         });
     }
 
@@ -244,7 +253,11 @@ public final class JPackageOutputValidator {
     }
 
     private String label() {
-        return stdout ? "'stdout'" : "'stderr'";
+        return switch (stream) {
+            case OUT -> "'stdout'";
+            case ERR -> "'stderr'";
+            case OUT_AND_ERR -> "'stdout+stderr'";
+        };
     }
 
     private Consumer<Iterator<String>> decorate(TKit.TextStreamVerifier validator) {
@@ -256,17 +269,16 @@ public final class JPackageOutputValidator {
     }
 
     private static Consumer<Executor.Result> toResultConsumer(
-            Consumer<Iterator<String>> validator, boolean stdout, boolean match, String label) {
+            Consumer<Iterator<String>> validator, StdStream stream, boolean match, String label) {
         Objects.requireNonNull(validator);
         Objects.requireNonNull(label);
 
         return result -> {
-            List<String> content;
-            if (stdout) {
-                content = result.stdout();
-            } else {
-                content = result.stderr();
-            }
+            List<String> content = switch (stream) {
+                case OUT -> result.stdout();
+                case ERR -> result.stderr();
+                case OUT_AND_ERR -> result.getOutput();
+            };
 
             if (match) {
                 TKit.trace(String.format("Checking %s for exact match against defined validators...", label));
@@ -371,7 +383,14 @@ public final class JPackageOutputValidator {
         }
     }
 
-    boolean stdout = true;
+    private enum StdStream {
+        OUT,
+        ERR,
+        OUT_AND_ERR,
+        ;
+    }
+
+    StdStream stream = StdStream.OUT;
     boolean match;
     boolean matchTimestamps;
     boolean stripTimestamps;
diff --git a/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/JPackageStringBundle.java b/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/JPackageStringBundle.java
index dcf994a0e93..688b16a8e09 100644
--- a/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/JPackageStringBundle.java
+++ b/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/JPackageStringBundle.java
@@ -78,6 +78,10 @@ public enum JPackageStringBundle {
         });
     }
 
+    public Pattern cannedFormattedStringAsPattern(String key, Object ... args) {
+        return cannedFormattedStringAsPattern(key, MATCH_ANY, args);
+    }
+
     static Pattern toPattern(MessageFormat mf, Function<Object, Pattern> formatArgMapper, Object ... args) {
         Objects.requireNonNull(mf);
         Objects.requireNonNull(formatArgMapper);
@@ -154,4 +158,14 @@ public enum JPackageStringBundle {
     private final Class<?> i18nClass;
     private final Method i18nClass_getString;
     private final BiFunction<String, Object[], String> formatter;
+
+    private static final Function<Object, Pattern> MATCH_ANY = new Function<>() {
+
+        @Override
+        public Pattern apply(Object v) {
+            return PATTERN;
+        }
+
+        private static final Pattern PATTERN = Pattern.compile(".*");
+    };
 }
diff --git a/test/jdk/tools/jpackage/macosx/SigningRuntimeImagePackageTest.java b/test/jdk/tools/jpackage/macosx/SigningRuntimeImagePackageTest.java
index 11b466ed715..42a0e6fd664 100644
--- a/test/jdk/tools/jpackage/macosx/SigningRuntimeImagePackageTest.java
+++ b/test/jdk/tools/jpackage/macosx/SigningRuntimeImagePackageTest.java
@@ -37,6 +37,8 @@ import jdk.jpackage.internal.util.Slot;
 import jdk.jpackage.test.Annotations.ParameterSupplier;
 import jdk.jpackage.test.Annotations.Test;
 import jdk.jpackage.test.JPackageCommand;
+import jdk.jpackage.test.JPackageOutputValidator;
+import jdk.jpackage.test.JPackageStringBundle;
 import jdk.jpackage.test.MacHelper;
 import jdk.jpackage.test.MacHelper.ResolvableCertificateRequest;
 import jdk.jpackage.test.MacHelper.SignKeyOption;
@@ -98,6 +100,13 @@ public class SigningRuntimeImagePackageTest {
             cmd.ignoreDefaultRuntime(true);
             cmd.removeArgumentWithValue("--input");
             cmd.setArgumentValue("--runtime-image", predefinedRuntime.get());
+
+            // `warning.per.user.app.image.signed` warning doesn't apply to runtime bundling.
+            // Ensure the warning is not in the output.
+            new JPackageOutputValidator().add(TKit.assertTextStream(
+                    JPackageStringBundle.MAIN.cannedFormattedStringAsPattern("warning.per.user.app.image.signed", "file")
+            ).negate()).stdoutAndStderr().applyTo(cmd);
+
         }).addInstallVerifier(cmd -> {
             MacSignVerify.verifyAppImageSigned(cmd, signRuntime.certRequest());
         }).run();
diff --git a/test/jdk/tools/jpackage/share/AppVersionTest.java b/test/jdk/tools/jpackage/share/AppVersionTest.java
index 3b6ac5a9241..7ba1870def1 100644
--- a/test/jdk/tools/jpackage/share/AppVersionTest.java
+++ b/test/jdk/tools/jpackage/share/AppVersionTest.java
@@ -46,7 +46,6 @@ import java.util.Optional;
 import java.util.Set;
 import java.util.function.Consumer;
 import java.util.function.Predicate;
-import java.util.regex.Pattern;
 import java.util.stream.Stream;
 import jdk.internal.util.OperatingSystem;
 import jdk.jpackage.internal.util.MacBundle;
@@ -287,9 +286,7 @@ public final class AppVersionTest {
         }
 
         TKit.TextStreamVerifier negateFind() {
-            var pattern = JPackageStringBundle.MAIN.cannedFormattedStringAsPattern(key, _ -> {
-                return Pattern.compile(".*");
-            }, args);
+            var pattern = JPackageStringBundle.MAIN.cannedFormattedStringAsPattern(key, args);
             return TKit.assertTextStream(pattern).negate();
         }
 
@@ -400,7 +397,7 @@ public final class AppVersionTest {
             Stream.of(Message.values()).filter(message -> {
                 return !expectMessageKeys.contains(message.key());
             }).map(Message::negateFind).forEach(validator -> {
-                new JPackageOutputValidator().add(validator).applyTo(cmd);
+                new JPackageOutputValidator().add(validator).stdoutAndStderr().applyTo(cmd);
             });
         }
 
@@ -760,7 +757,7 @@ public final class AppVersionTest {
             private final List<VersionSource> versions = new ArrayList<>();
             private final Map<PackageType, Expected> expected = new HashMap<>();
 
-            private final static Set<PackageType> ALL_TYPES = Set.of(PackageType.values());
+            private static final Set<PackageType> ALL_TYPES = Set.of(PackageType.values());
         }
     }
 
@@ -1019,7 +1016,7 @@ public final class AppVersionTest {
             return predefinedRuntimeDir;
         }
 
-        final static String MAC_PREDEFINED_RUNTIME_BUNDLE_VERSION = "1.22.333";
+        static final String MAC_PREDEFINED_RUNTIME_BUNDLE_VERSION = "1.22.333";
     }
 
     private static Consumer<TestSpec> skipImagePackageType(Consumer<TestSpec> consumer) {

From 7e943e7d41ee8175660e236c4b7fe39604fdae2f Mon Sep 17 00:00:00 2001
From: David Holmes <dholmes@openjdk.org>
Date: Fri, 20 Mar 2026 03:57:48 +0000
Subject: [PATCH 273/655] 8380474: Crash SEGV in ThreadIdTable::lazy_initialize
  after JDK-8323792

Reviewed-by: kvn, iklam
---
 src/hotspot/share/services/threadIdTable.cpp | 5 +++--
 1 file changed, 3 insertions(+), 2 deletions(-)

diff --git a/src/hotspot/share/services/threadIdTable.cpp b/src/hotspot/share/services/threadIdTable.cpp
index d5141441ccd..585cc6377ec 100644
--- a/src/hotspot/share/services/threadIdTable.cpp
+++ b/src/hotspot/share/services/threadIdTable.cpp
@@ -23,6 +23,7 @@
 */
 
 #include "classfile/javaClasses.inline.hpp"
+#include "runtime/handles.hpp"
 #include "runtime/interfaceSupport.inline.hpp"
 #include "runtime/javaThread.inline.hpp"
 #include "runtime/threadSMR.hpp"
@@ -94,11 +95,11 @@ void ThreadIdTable::lazy_initialize(const ThreadsList *threads) {
 
     for (uint i = 0; i < threads->length(); i++) {
       JavaThread* thread = threads->thread_at(i);
-      oop tobj = thread->threadObj();
+      Handle tobj = Handle(JavaThread::current(), thread->threadObj());
       if (tobj != nullptr) {
         MutexLocker ml(Threads_lock);
         if (!thread->is_exiting()) {
-          jlong java_tid = java_lang_Thread::thread_id(tobj);
+          jlong java_tid = java_lang_Thread::thread_id(tobj());
           // Must be inside the lock to ensure that we don't add a thread to the table
           // that has just passed the removal point in Threads::remove().
           add_thread(java_tid, thread);

From f2550e89c7d382b3256327d7a720c9059de1e4b5 Mon Sep 17 00:00:00 2001
From: Dusan Balek <dusan.balek@oracle.com>
Date: Fri, 20 Mar 2026 07:25:45 +0000
Subject: [PATCH 274/655] 8378906: NPE from javac thrown when encountering
 abstract synthetic bridge method

Reviewed-by: mcimadamore
---
 .../com/sun/tools/javac/code/Types.java       |   6 +-
 .../types/IsFunctionalInterfaceTest.java      | 160 ++++++++++++++++++
 2 files changed, 164 insertions(+), 2 deletions(-)
 create mode 100644 test/langtools/tools/javac/types/IsFunctionalInterfaceTest.java

diff --git a/src/jdk.compiler/share/classes/com/sun/tools/javac/code/Types.java b/src/jdk.compiler/share/classes/com/sun/tools/javac/code/Types.java
index 9ffab9fd961..f1c6676d087 100644
--- a/src/jdk.compiler/share/classes/com/sun/tools/javac/code/Types.java
+++ b/src/jdk.compiler/share/classes/com/sun/tools/javac/code/Types.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -993,10 +993,12 @@ public class Types {
 
        @Override
        public boolean test(Symbol sym) {
+           List<MethodSymbol> msyms;
            return sym.kind == MTH &&
                    (sym.flags() & (ABSTRACT | DEFAULT)) == ABSTRACT &&
                    !overridesObjectMethod(origin, sym) &&
-                   (interfaceCandidates(origin.type, (MethodSymbol)sym).head.flags() & DEFAULT) == 0;
+                   (msyms = interfaceCandidates(origin.type, (MethodSymbol)sym)).nonEmpty() &&
+                   (msyms.head.flags() & DEFAULT) == 0;
        }
     }
 
diff --git a/test/langtools/tools/javac/types/IsFunctionalInterfaceTest.java b/test/langtools/tools/javac/types/IsFunctionalInterfaceTest.java
new file mode 100644
index 00000000000..a4fe4e470c7
--- /dev/null
+++ b/test/langtools/tools/javac/types/IsFunctionalInterfaceTest.java
@@ -0,0 +1,160 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+/*
+ * @test
+ * @bug 8378906
+ * @summary Check that Types.isFunctionalInterface() works for interface methods
+ *          with ACC_PUBLIC, ACC_BRIDGE, ACC_ABSTRACT, ACC_SYNTHETIC flags.
+ * @library /tools/lib
+ * @modules
+ *      jdk.compiler/com.sun.tools.javac.api
+ *      jdk.compiler/com.sun.tools.javac.main
+ * @build toolbox.ToolBox toolbox.JavacTask
+ * @run junit IsFunctionalInterfaceTest
+ */
+
+import java.lang.classfile.ClassFile;
+import java.lang.classfile.MethodElement;
+import java.lang.classfile.MethodModel;
+import java.lang.reflect.AccessFlag;
+import java.nio.file.Files;
+import java.nio.file.Path;
+import java.nio.file.Paths;
+import java.util.*;
+
+import toolbox.JavacTask;
+import toolbox.ToolBox;
+
+import org.junit.jupiter.api.BeforeEach;
+import org.junit.jupiter.api.Test;
+import org.junit.jupiter.api.TestInfo;
+import toolbox.Task;
+
+public class IsFunctionalInterfaceTest {
+
+    Path base;
+    ToolBox tb = new ToolBox();
+
+    @Test
+    void test8378906() throws Exception {
+        Path classes = base.resolve("classes");
+        Files.createDirectories(classes);
+        new JavacTask(tb)
+                .options("-d", classes.toString())
+                .sources("""
+                         interface I {
+                            @Deprecated
+                            Object test();
+                         }
+
+                         final class Sub implements I {
+                            public static final Sub INSTANCE = new Sub();
+                            public Object test() { return null; }
+                         }
+
+                         class Util {
+                            public static boolean foo(I a) { return true; }
+                            public static boolean foo(Sub a) { return false; }
+                         }
+                         """)
+                .run()
+                .writeAll();
+
+        Path path = classes.resolve("I.class");
+        ClassFile classFile = ClassFile.of();
+        byte[] bytes = classFile.transformClass(classFile.parse(path),
+                (classBuilder, classElement) -> {
+                    if (classElement instanceof MethodModel mm
+                            && mm.methodName().equalsString("test")) {
+                        int flags = mm.flags().flagsMask() | AccessFlag.BRIDGE.mask() | AccessFlag.SYNTHETIC.mask();
+                        classBuilder.withMethod(mm.methodName(), mm.methodType(), flags, (methodBuilder) -> {
+                            mm.attributes().forEach(attr -> {
+                                if (attr instanceof MethodElement me) {
+                                    methodBuilder.with(me);
+                                }
+                            });
+                        });
+                    } else {
+                        classBuilder.with(classElement);
+                    }
+                });
+        Files.write(path, bytes);
+
+        new JavacTask(tb)
+                .options("-d", classes.toString(), "-cp", classes.toString())
+                .sources("""
+                         public class Test {
+                            public void main() { Util.foo(Sub.INSTANCE); }
+                         }
+                         """)
+                .run()
+                .writeAll();
+
+        List<String> out1 = new JavacTask(tb)
+                .options("-d", classes.toString(), "-cp", classes.toString(), "-XDrawDiagnostics", "-nowarn")
+                .sources("""
+                         public class Test {
+                            public void main() { t(() -> null); }
+                            private void t(I i) {}
+                         }
+                         """)
+                .run(Task.Expect.FAIL)
+                .writeAll()
+                .getOutputLines(Task.OutputKind.DIRECT);
+        tb.checkEqual(out1, List.of(
+                "Test.java:2:25: compiler.err.cant.apply.symbol: kindname.method, t, I, @27, kindname.class, Test, (compiler.misc.no.conforming.assignment.exists: (compiler.misc.not.a.functional.intf.1: I, (compiler.misc.no.abstracts: kindname.interface, I)))",
+                "1 error"));
+
+        List<String> out2 = new JavacTask(tb)
+                .options("-d", classes.toString(), "-cp", classes.toString(), "-XDrawDiagnostics", "-nowarn")
+                .sources("""
+                         public class Impl implements I {
+                         }
+                         """)
+                .run(Task.Expect.FAIL)
+                .writeAll()
+                .getOutputLines(Task.OutputKind.DIRECT);
+        tb.checkEqual(out2, List.of(
+                "Impl.java:1:8: compiler.err.does.not.override.abstract: Impl, test(), I",
+                "1 error"));
+
+        new JavacTask(tb)
+                .options("-d", classes.toString(), "-cp", classes.toString())
+                .sources("""
+                         public class Impl implements I {
+                            public Object test() { return null; }
+                         }
+                         """)
+                .run()
+                .writeAll();
+    }
+
+    @BeforeEach
+    public void setUp(TestInfo info) {
+        base = Paths.get(".")
+                    .resolve(info.getTestMethod()
+                                 .orElseThrow()
+                                 .getName());
+    }
+}

From f5fbb6a237f022b485dbc79b6ec819df65535ffe Mon Sep 17 00:00:00 2001
From: Arno Zeller <azeller@openjdk.org>
Date: Fri, 20 Mar 2026 09:01:59 +0000
Subject: [PATCH 275/655] 8380428: ProblemList
 containers/docker/TestJcmdWithSideCar.java on linux-all

Reviewed-by: goetz, mbaesken, dholmes, ysuenaga
---
 test/hotspot/jtreg/ProblemList.txt | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/test/hotspot/jtreg/ProblemList.txt b/test/hotspot/jtreg/ProblemList.txt
index a9211bed62e..dec9682f0cf 100644
--- a/test/hotspot/jtreg/ProblemList.txt
+++ b/test/hotspot/jtreg/ProblemList.txt
@@ -116,7 +116,7 @@ runtime/NMT/VirtualAllocCommitMerge.java 8309698 linux-s390x
 applications/jcstress/copy.java 8229852 linux-all
 
 containers/docker/TestJFREvents.java 8327723 linux-x64
-containers/docker/TestJcmdWithSideCar.java 8341518 linux-x64
+containers/docker/TestJcmdWithSideCar.java 8341518 linux-all
 
 #############################################################################
 

From f7c427fedaf7406560918ee568e6861e666f5aa4 Mon Sep 17 00:00:00 2001
From: Roger Riggs <rriggs@openjdk.org>
Date: Fri, 20 Mar 2026 14:14:59 +0000
Subject: [PATCH 276/655] 8379182: [test] 
 java/lang/ProcessBuilder/PipelineLeaksFD.java fails

Reviewed-by: stuefe
---
 test/jdk/java/lang/ProcessBuilder/Basic.java  |   1 -
 .../java/lang/ProcessBuilder/LinuxFDInfo.java |  62 +++++
 .../lang/ProcessBuilder/PipelineLeaksFD.java  | 248 +++++-------------
 .../java/lang/ProcessBuilder/libLinuxFDInfo.c |  37 +++
 4 files changed, 159 insertions(+), 189 deletions(-)
 create mode 100644 test/jdk/java/lang/ProcessBuilder/LinuxFDInfo.java
 create mode 100644 test/jdk/java/lang/ProcessBuilder/libLinuxFDInfo.c

diff --git a/test/jdk/java/lang/ProcessBuilder/Basic.java b/test/jdk/java/lang/ProcessBuilder/Basic.java
index 401a1e2bd8a..70d6101c1a5 100644
--- a/test/jdk/java/lang/ProcessBuilder/Basic.java
+++ b/test/jdk/java/lang/ProcessBuilder/Basic.java
@@ -45,7 +45,6 @@
  * @summary Basic tests for Process and Environment Variable code
  * @modules java.base/java.lang:open
  *          java.base/java.io:open
- * @requires !vm.musl
  * @requires vm.flagless
  * @library /test/lib
  * @run main/othervm/native/timeout=360 -Djdk.lang.Process.launchMechanism=fork Basic
diff --git a/test/jdk/java/lang/ProcessBuilder/LinuxFDInfo.java b/test/jdk/java/lang/ProcessBuilder/LinuxFDInfo.java
new file mode 100644
index 00000000000..6e0b08c5879
--- /dev/null
+++ b/test/jdk/java/lang/ProcessBuilder/LinuxFDInfo.java
@@ -0,0 +1,62 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+/**
+ * Accessor for Native calls to get information about File Descriptors.
+ * If it's a pipe and its Inode number.
+ */
+public class LinuxFDInfo {
+
+    static {
+        System.loadLibrary("LinuxFDInfo");
+    }
+
+    // Maximum file descriptor to probe for being a pipe,
+    private final static int MAX_FD = 100;
+
+    // A simple main to print the pipes in this process and their Inode value
+    public static void main() {
+        for (int fd = 0; fd < MAX_FD; fd++) {
+            long inode = getPipeInodeNum(fd);
+            if (inode != 0) {
+                System.out.printf("fd: %d, inode: 0x%08x\n", fd, inode);
+            }
+        }
+    }
+
+    // Parse the output from main into a long array of the fd, and Inode.
+    public static FdAndInode parseFdAndInode(String s) {
+        String[] args = s.split(",");
+        return new FdAndInode(Integer.parseUnsignedInt(args[0].split(":")[1].trim()),
+            Long.parseUnsignedLong(args[1].split(":")[1].trim().substring(2), 16));
+    }
+
+    /**
+     * Return the inode number for the FD, if it is a pipe.
+     * @param fd file descriptor
+     * @return the Inode number.
+     */
+    public static native long getPipeInodeNum(int fd);
+
+    public record FdAndInode(int fd, long inode) {}
+}
diff --git a/test/jdk/java/lang/ProcessBuilder/PipelineLeaksFD.java b/test/jdk/java/lang/ProcessBuilder/PipelineLeaksFD.java
index 18dde6e95d7..d1213a5ee11 100644
--- a/test/jdk/java/lang/ProcessBuilder/PipelineLeaksFD.java
+++ b/test/jdk/java/lang/ProcessBuilder/PipelineLeaksFD.java
@@ -21,34 +21,26 @@
  * questions.
  */
 
-import org.junit.jupiter.api.condition.EnabledIf;
 import org.junit.jupiter.params.ParameterizedTest;
 import org.junit.jupiter.params.provider.MethodSource;
-import static org.junit.jupiter.api.Assertions.*;
-import jdk.test.lib.Utils;
 
 import java.io.BufferedReader;
 import java.io.IOException;
 import java.io.Writer;
-import java.lang.ProcessHandle;
-import java.nio.file.Files;
-import java.nio.file.Path;
-import java.util.concurrent.TimeUnit;
-import java.util.ArrayList;
-import java.util.Arrays;
 import java.util.HashMap;
 import java.util.HashSet;
 import java.util.LinkedHashSet;
 import java.util.List;
-import java.util.Optional;
 import java.util.Set;
-import java.util.StringJoiner;
 import java.util.stream.Collectors;
 
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.fail;
+
 /*
  * @test id=FORK
  * @bug 8289643 8291760 8291986
- * @requires os.family == "mac" | (os.family == "linux" & !vm.musl)
+ * @requires os.family == "mac" | os.family == "linux"
  * @summary File descriptor leak detection with ProcessBuilder.startPipeline
  * @library /test/lib
  * @run junit/othervm/timeout=240 -Djdk.lang.Process.launchMechanism=FORK PipelineLeaksFD
@@ -56,20 +48,23 @@ import java.util.stream.Collectors;
 
 /*
  * @test id=POSIX_SPAWN
- * @bug 8289643 8291760 8291986
- * @requires os.family == "mac" | (os.family == "linux" & !vm.musl)
+ * @bug 8289643 8291760 8291986 8379182
+ * @requires os.family == "mac" | os.family == "linux"
  * @summary File descriptor leak detection with ProcessBuilder.startPipeline
  * @library /test/lib
- * @run junit/othervm/timeout=240 -Djdk.lang.Process.launchMechanism=POSIX_SPAWN PipelineLeaksFD
+ * @run junit/othervm/native/timeout=240 -Djdk.lang.Process.launchMechanism=POSIX_SPAWN PipelineLeaksFD
  */
 
 public class PipelineLeaksFD {
 
-    private static final String OS_NAME = System.getProperty("os.name", "Unknown");
+    private static final String TEST_JDK = System.getProperty("test.jdk");
+
+    private static final String JAVA_LIBRARY_PATH = System.getProperty("java.library.path");
 
     private static final long MY_PID =  ProcessHandle.current().pid();
 
-    private static final boolean LSOF_AVAILABLE = checkForLSOF();
+    // Maximum file descriptor to probe for being a pipe,
+    private static final int MAX_FD = 100;
 
     // Test cases for pipelines with a number of pipeline sequences
     public static Object[][] builders() {
@@ -85,39 +80,17 @@ public class PipelineLeaksFD {
         };
     }
 
-    // True if lsof is runnable and collect pipe usage.
-    private static boolean lsofAvailable() {
-        return LSOF_AVAILABLE;
-    }
-
-    // Check if lsof is available
-    private static boolean checkForLSOF() {
-        try {
-            lsofForPids(MY_PID);
-            return true;
-        } catch (IOException ioe) {
-            System.err.println("Skipping: " + ioe);
-            return false;
-        }
-    }
-
-    @EnabledIf("lsofAvailable")
     @ParameterizedTest
     @MethodSource("builders")
     void checkForLeaks(List<ProcessBuilder> builders) throws IOException {
 
         System.out.println("Using:" + System.getProperty("jdk.lang.Process.launchMechanism"));
-
-        List<String> lsofLines = lsofForPids(MY_PID);
-        Set<PipeRecord> pipesBefore = pipesFromLSOF(lsofLines, MY_PID);
-        if (pipesBefore.size() < 3) {
-            // Dump all lsof output to aid debugging
-            System.out.println("Output from lsof");
-            lsofLines.forEach(System.err::println);
-            System.err.println(pipesBefore);
-            fail("There should be at least 3 pipes before, (0, 1, 2)");
+        Set<PipeRecord> beforePipes = pipesFromSelf();
+        if (beforePipes.size() < 3) {
+            fail("There should be at least 3 pipes before, (0, 1, 2): is " +
+                    beforePipes.size());
         }
-        printPipes(pipesBefore, "Before start");
+        printPipes(beforePipes, "Before start");
 
         List<Process> processes = ProcessBuilder.startPipeline(builders);
 
@@ -144,18 +117,14 @@ public class PipelineLeaksFD {
 
         processes.forEach(PipelineLeaksFD::waitForQuiet);
 
-        lsofLines = lsofForPids(MY_PID);
-        Set<PipeRecord> pipesAfter = pipesFromLSOF(lsofLines, MY_PID);
-        if (!pipesBefore.equals(pipesAfter)) {
-            Set<PipeRecord> missing = new HashSet<>(pipesBefore);
-            missing.removeAll(pipesAfter);
-            printPipes(missing, "Missing from pipesAfter");
-            Set<PipeRecord> extra = new HashSet<>(pipesAfter);
-            extra.removeAll(pipesBefore);
-            printPipes(extra, "Extra pipes in pipesAfter");
-            // Dump all lsof output to aid debugging
-            System.out.println("\nOutput from lsof");
-            lsofLines.forEach(System.err::println);
+        Set<PipeRecord> afterPipes = pipesFromSelf();
+        if (!beforePipes.equals(afterPipes)) {
+            Set<PipeRecord> missing = new HashSet<>(beforePipes);
+            missing.removeAll(afterPipes);
+            printPipes(missing, "Missing from beforePipes()");
+            Set<PipeRecord> extra = new HashSet<>(afterPipes);
+            extra.removeAll(beforePipes);
+            printPipes(extra, "Extra pipes in afterPipes()");
             fail("More or fewer pipes than expected");
         }
     }
@@ -168,43 +137,46 @@ public class PipelineLeaksFD {
         };
     }
 
-    // Test redirectErrorStream  (true/false) has the right number of pipes in use
-    @EnabledIf("lsofAvailable")
+    // Test redirectErrorStream  (true/false) has the right number of pipes in use.
+    // Spawn the child to report its pipe inode info.
     @ParameterizedTest()
     @MethodSource("redirectCases")
     void checkRedirectErrorStream(boolean redirectError) {
 
         System.out.println("Using:" + System.getProperty("jdk.lang.Process.launchMechanism"));
 
-        try (Process p = new ProcessBuilder("cat")
+        try (Process p = new ProcessBuilder(TEST_JDK + "/bin/java",
+                "--enable-preview",
+                "-Djava.library.path=" + JAVA_LIBRARY_PATH,
+                "--enable-native-access=ALL-UNNAMED", "LinuxFDInfo")
                 .redirectErrorStream(redirectError)
                 .start()) {
-            System.err.printf("Parent PID; %d, Child Pid: %d\n", MY_PID, p.pid());
-            List<String> lsofLines = lsofForPids(MY_PID, p.pid());
-            final Set<PipeRecord> pipes = pipesFromLSOF(lsofLines, MY_PID, p.pid());
-            printPipes(pipes, "Parent and child pipes");
 
-            // For each of the child standard pipes, check the parent and child uses of the pipe
-            var pIn = PipeRecord.pipeFor(pipes, p.pid(), 0).orElseThrow();
-            Set<PipeRecord> pIns = PipeRecord.allSamePipes(pipes, pIn);
-            assertEquals(2, pIns.size(), "StdIn pipe count");
+            final Set<PipeRecord> pipes = pipesFromSelf();
+            printPipes(pipes, "Parent pipes");
 
+            List<String> lines = p.inputReader().readAllLines();
+            Set<PipeRecord> childPipes = lines.stream().map(s -> {
+                var fdAndInode = LinuxFDInfo.parseFdAndInode(s);
+                return PipeRecord.lookup(fdAndInode.fd(), "0x%08x".formatted(fdAndInode.inode()), p.pid());
+            })
+                    .collect(Collectors.toCollection(LinkedHashSet::new));
+            printPipes(childPipes, "child pipes");
+            int uniquePipes = childPipes.stream().map(PipeRecord::myKey).collect(Collectors.toSet()).size();
             // Number of pipe references depending on whether stderr is redirected to stdout
-            long expected = redirectError ? 3 : 2;
-
-            var pOut = PipeRecord.pipeFor(pipes, p.pid(), 1).orElseThrow();
-            Set<PipeRecord> pOuts = PipeRecord.allSamePipes(pipes, pOut);
-            assertEquals(expected, pOuts.size(), "StdOut pipe count");
-
-            var pErr = PipeRecord.pipeFor(pipes, p.pid(), 2).orElseThrow();
-            Set<PipeRecord> pErrs = PipeRecord.allSamePipes(pipes, pErr);
-            assertEquals(expected, pErrs.size(), "StdErr pipe count");
+            long expected = redirectError ? 2 : 3;
+            assertEquals(expected, uniquePipes, "Wrong number of unique pipes");
 
             String expectedTypeName = redirectError
                     ? "java.lang.ProcessBuilder$NullInputStream"
                     : "java.lang.ProcessImpl$ProcessPipeInputStream";
             assertEquals(expectedTypeName, p.getErrorStream().getClass().getName(),
                     "errorStream type is incorrect");
+
+            final Set<PipeRecord> afterPipes = pipesFromSelf();
+            if (!pipes.equals(afterPipes)) {
+                printPipes(afterPipes, "Parent pipes after are different");
+            }
         } catch (IOException ioe) {
             fail("Process start", ioe);
         }
@@ -221,122 +193,26 @@ public class PipelineLeaksFD {
             if (st != 0) {
                 System.err.println("non-zero exit status: " + p);
             }
-        } catch (InterruptedException ie) {
+        } catch (InterruptedException ignore) {
         }
     }
 
-    /**
-     * Extract the PipeRecords from the `lsof` output for a list of processes
-     *
-     * @param lines lines of lsof output
-     * @param pids varargs list of pids of interest
-     * @return a Set of PipeRecords for those pids
-     */
-    private static LinkedHashSet<PipeRecord> pipesFromLSOF(List<String> lines, long... pids) {
-        Arrays.sort(pids);
-        return lines.stream()
-                .map(PipelineLeaksFD::pipeFromLSOF)
-                .filter(pr -> pr != null &&
-                        Arrays.binarySearch(pids, pr.pid()) >= 0)
-                .collect(Collectors.toCollection(LinkedHashSet::new));
-    }
-
-    /**
-     * Collect the output of `lsof` for all files.
-     * Files are used for `lsof` input and output to avoid creating pipes.
-     * @param pids zero or more pids to request data for; none -> all
-     * @return a List of lines output from `lsof`.
-     */
-    private static List<String> lsofForPids(long... pids) throws IOException {
-        Path tmpDir = Path.of(".");
-        String tmpPrefix = "lsof-";
-        Path lsofEmptyInput = Files.createTempFile(tmpDir, tmpPrefix, ".empty");
-        Path lsofOutput = Files.createTempFile(tmpDir, tmpPrefix, ".tmp");
-
-        List<String> lsofArgs = new ArrayList<>();
-        lsofArgs.add("lsof");
-        if (pids.length > 0) {
-            StringJoiner pidsArg = new StringJoiner(",");
-            for (long p : pids) {
-                pidsArg.add(Long.toString(p));
+    static Set<PipeRecord> pipesFromSelf() {
+        Set<PipeRecord> pipes = new LinkedHashSet<>(MAX_FD);
+        for (int fd = 0; fd < MAX_FD; fd++) {
+            long inode = LinuxFDInfo.getPipeInodeNum(fd);
+            if (inode != 0) {
+                pipes.add(PipeRecord.lookup(fd, "0x%08x".formatted(inode), MY_PID));
             }
-            lsofArgs.add("-p");
-            lsofArgs.add(pidsArg.toString());
         }
-
-        try (Process p = new ProcessBuilder(lsofArgs)
-                .redirectOutput(lsofOutput.toFile())
-                .redirectInput(lsofEmptyInput.toFile()) // empty input
-                .redirectError(ProcessBuilder.Redirect.DISCARD) // ignored output
-                .start()) {
-            boolean status = p.waitFor(Utils.adjustTimeout(120), TimeUnit.SECONDS);
-            if (!status) {
-                p.destroyForcibly();
-            }
-            assertTrue(status, "Process 'lsof' failed");
-
-            return Files.readAllLines(lsofOutput);
-        } catch (InterruptedException ie) {
-            throw new IOException("Waiting for lsof exit interrupted", ie);
-        }
-    }
-
-    // Return pipe records by parsing the appropriate platform specific `lsof` output.
-    static PipeRecord pipeFromLSOF(String s) {
-        return switch (OS_NAME) {
-            case "Linux" -> pipeFromLinuxLSOF(s);
-            case "Mac OS X" -> pipeFromMacLSOF(s);
-            default -> throw new RuntimeException("lsof not supported on platform: " + OS_NAME);
-        };
-    }
-
-    // Return Pipe from lsof output put, or null (on Mac OS X)
-    // lsof      55221 xxxx    0      PIPE 0xc76402237956a5cb      16384  ->0xfcb0c07ae447908c
-    // lsof      55221 xxxx    1      PIPE 0xb486e02f86da463e      16384  ->0xf94eacc85896b4e6
-    static PipeRecord pipeFromMacLSOF(String s) {
-        String[] fields = s.split("\\s+");
-        if ("PIPE".equals(fields[4])) {
-            final int pid = Integer.parseInt(fields[1]);
-            final String myKey = (fields.length > 5) ? fields[5] : "";
-            final String otherKey = (fields.length > 7) ? fields[7].substring(2) : "";
-            return PipeRecord.lookup(Integer.parseInt(fields[3]), myKey, otherKey, pid);
-        }
-        return null;
-    }
-
-    // Return Pipe from lsof output put, or null (on Linux)
-    // java    7612 xxxx   14w  FIFO   0,12       0t0   117662267 pipe
-    // java    7612 xxxx   15r  FIFO   0,12       0t0   117662268 pipe
-    static PipeRecord pipeFromLinuxLSOF(String s) {
-        String[] fields = s.split("\\s+");
-        if ("FIFO".equals(fields[4])) {
-            final int pid = Integer.parseInt(fields[1]);
-            final String key = (fields.length > 7) ? fields[7] : "";
-            final int fdNum = Integer.parseInt(fields[3].substring(0, fields[3].length() - 1));
-            return PipeRecord.lookup(fdNum, key, null, pid);
-        }
-        return null;
+        return pipes;
     }
 
     // Identify a pipe by pid, fd, and a key (unique across processes)
     // Mac OS X has separate keys for read and write sides, both are matched to the same "name"
     record PipeRecord(long pid, int fd, KeyedString myKey) {
-        static PipeRecord lookup(int fd, String myKey, String otherKey, int pid) {
-            return new PipeRecord(pid, fd, KeyedString.getKey(myKey, otherKey));
-        }
-
-        // Return the PipeRecord matching the fd and pid
-        static Optional<PipeRecord> pipeFor(Set<PipeRecord> pipes, long pid, int fd) {
-            return pipes.stream()
-                    .filter(p -> p.fd() == fd && p.pid() == pid)
-                    .findFirst();
-        }
-
-        // Return all the PipeRecords with the same key (the same OS pipe identification)
-        static Set<PipeRecord> allSamePipes(Set<PipeRecord> pipes, PipeRecord p) {
-            return pipes.stream()
-                    .filter(p1 -> p1.myKey().key.equals(p.myKey().key))
-                    .collect(Collectors.toSet());
+        static PipeRecord lookup(int fd, String myKey, long pid) {
+            return new PipeRecord(pid, fd, KeyedString.getKey(myKey));
         }
     }
 
@@ -357,12 +233,8 @@ public class PipelineLeaksFD {
             this(s, k);
         }
 
-        static KeyedString getKey(String key, String otherKey) {
-            var k = map.computeIfAbsent(key, KeyedString::new);
-            if (otherKey != null) {
-                map.putIfAbsent(otherKey, k);
-            }
-            return k;
+        static KeyedString getKey(String key) {
+            return map.computeIfAbsent(key, KeyedString::new);
         }
 
         public String toString() {
diff --git a/test/jdk/java/lang/ProcessBuilder/libLinuxFDInfo.c b/test/jdk/java/lang/ProcessBuilder/libLinuxFDInfo.c
new file mode 100644
index 00000000000..3eb4bd15aac
--- /dev/null
+++ b/test/jdk/java/lang/ProcessBuilder/libLinuxFDInfo.c
@@ -0,0 +1,37 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+#include "jni.h"
+#include <sys/stat.h>
+
+// If the file descriptor is a PIPE, return the INode.
+JNIEXPORT jlong JNICALL
+Java_LinuxFDInfo_getPipeInodeNum(JNIEnv *env, jclass cls, jint fd) {
+#ifdef S_ISFIFO
+    struct stat buf;
+    if  (fstat(fd, &buf) != -1 && S_ISFIFO(buf.st_mode)) {
+        return buf.st_ino;
+    }
+#endif
+    return 0;
+}

From 396cc0ab6a8a6d2e3a0d9b6c3cedafef6a427094 Mon Sep 17 00:00:00 2001
From: Jaikiran Pai <jpai@openjdk.org>
Date: Fri, 20 Mar 2026 15:58:45 +0000
Subject: [PATCH 277/655] 8380534: Use loopback address in
 java/net/DatagramPacket/ReuseBuf.java test

Reviewed-by: dfuchs
---
 .../jdk/java/net/DatagramPacket/ReuseBuf.java | 161 ++++++++++++------
 1 file changed, 111 insertions(+), 50 deletions(-)

diff --git a/test/jdk/java/net/DatagramPacket/ReuseBuf.java b/test/jdk/java/net/DatagramPacket/ReuseBuf.java
index 232bd07dded..2213f306a8a 100644
--- a/test/jdk/java/net/DatagramPacket/ReuseBuf.java
+++ b/test/jdk/java/net/DatagramPacket/ReuseBuf.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2001, 2019, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2001, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -21,71 +21,132 @@
  * questions.
  */
 
-/**
+
+import java.net.DatagramPacket;
+import java.net.DatagramSocket;
+import java.net.InetAddress;
+import java.net.InetSocketAddress;
+import java.net.SocketException;
+import java.util.concurrent.atomic.AtomicReference;
+
+/*
  * @test
- *
  * @bug 4424096
- *
- * @summary DatagramPacket spec needs clarification (reuse buf)
+ * @summary Verify the specification of DatagramPacket.getData()
  */
-import java.net.*;
-
 public class ReuseBuf {
-    static String msgs[] = {"Hello World", "Java", "Good Bye"};
-    static int port;
+    private static final String[] msgs = {"Hello World", "Java", "Good Bye"};
 
-    static class ServerThread extends Thread{
-        DatagramSocket ds;
-        public ServerThread() {
+    static class Server implements Runnable, AutoCloseable {
+
+        private final DatagramSocket ds;
+        private volatile boolean closed;
+        private final AtomicReference<Exception> serverFailure = new AtomicReference<>();
+
+        public Server(final InetSocketAddress bindAddr) {
             try {
-                InetAddress local = InetAddress.getLocalHost();
-                InetSocketAddress bindaddr = new InetSocketAddress(local, 0);
-                ds = new DatagramSocket(bindaddr);
-                port = ds.getLocalPort();
+                this.ds = new DatagramSocket(bindAddr);
+            } catch (SocketException e) {
+                throw new RuntimeException(e);
+            }
+            System.out.println("Server bound to address: " + this.ds.getLocalSocketAddress());
+        }
+
+        private InetSocketAddress getServerAddress() {
+            return (InetSocketAddress) this.ds.getLocalSocketAddress();
+        }
+
+        private static void serverLog(final String msg) {
+            System.out.println("[server] " + msg);
+        }
+
+        @Override
+        public void run() {
+            serverLog("server processing started");
+            try {
+                doRun();
             } catch (Exception e) {
-                throw new RuntimeException(e.getMessage());
+                // no need to be concerned with the exception
+                // if the server is already closed
+                if (!closed) {
+                    this.serverFailure.set(e);
+                    System.err.println("server exception: " + e);
+                    e.printStackTrace();
+                }
+            } finally {
+                close();
             }
         }
 
-        public void run() {
-            byte b[] = new byte[100];
-            DatagramPacket dp = new DatagramPacket(b,b.length);
-            while (true) {
-                try {
-                    ds.receive(dp);
-                    String reply = new String(dp.getData(), dp.getOffset(), dp.getLength());
-                    ds.send(new DatagramPacket(reply.getBytes(),reply.length(),
-                                               dp.getAddress(),dp.getPort()));
-                    if (reply.equals(msgs[msgs.length-1])) {
-                        break;
-                    }
-                } catch (Exception e) {
-                    throw new RuntimeException(e.getMessage());
+        private void doRun() throws Exception {
+            byte[] b = new byte[100];
+            DatagramPacket dp = new DatagramPacket(b, b.length);
+            while (!closed) {
+                serverLog("waiting to receive a message at " + ds.getLocalSocketAddress());
+                ds.receive(dp);
+                String reply = new String(dp.getData(), dp.getOffset(), dp.getLength());
+                serverLog("replying to " + dp.getAddress() + ":" + dp.getPort());
+                ds.send(new DatagramPacket(reply.getBytes(), reply.length(),
+                        dp.getAddress(), dp.getPort()));
+                if (reply.equals(msgs[msgs.length - 1])) {
+                    break;
                 }
             }
-            ds.close();
+        }
+
+        @Override
+        public void close() {
+            if (this.closed) {
+                return;
+            }
+            synchronized (this) {
+                if (this.closed) {
+                    return;
+                }
+                this.closed = true;
+            }
+            System.out.println("Server closing " + ds.getLocalSocketAddress());
+            this.ds.close();
         }
     }
 
-    public static void main(String args[]) throws Exception {
-        ServerThread st = new ServerThread();
-        st.start();
-        InetAddress local = InetAddress.getLocalHost();
-        InetSocketAddress bindaddr = new InetSocketAddress(local, 0);
-        DatagramSocket ds = new DatagramSocket(bindaddr);
-        byte b[] = new byte[100];
-        DatagramPacket dp = new DatagramPacket(b,b.length);
-        for (int i = 0; i < msgs.length; i++) {
-            ds.send(new DatagramPacket(msgs[i].getBytes(),msgs[i].length(),
-                                       InetAddress.getLocalHost(),
-                                       port));
-            ds.receive(dp);
-            if (!msgs[i].equals(new String(dp.getData(), dp.getOffset(), dp.getLength()))) {
-                throw new RuntimeException("Msg expected: "+msgs[i] +msgs[i].length()+
-                                           "msg received: "+new String(dp.getData(), dp.getOffset(), dp.getLength())+dp.getLength());
+    public static void main(String[] args) throws Exception {
+        InetSocketAddress loopbackEphemeral = new InetSocketAddress(InetAddress.getLoopbackAddress(), 0);
+        Server server;
+        Thread serverThread;
+        try (var _ = server = new Server(loopbackEphemeral);
+             DatagramSocket ds = new DatagramSocket(loopbackEphemeral)) {
+
+            InetSocketAddress destAddr = server.getServerAddress();
+            // start the server
+            serverThread = new Thread(server);
+            serverThread.start();
+
+            byte[] b = new byte[100];
+            DatagramPacket dp = new DatagramPacket(b, b.length);
+            for (String msg : msgs) {
+                System.out.println("sending message from " + ds.getLocalSocketAddress()
+                        + " to " + destAddr);
+                ds.send(new DatagramPacket(msg.getBytes(), msg.length(), destAddr));
+                // wait for a reply from the server
+                ds.receive(dp);
+                System.out.println("received message from: " + dp.getAddress() + ":" + dp.getPort());
+                String actual = new String(dp.getData(), dp.getOffset(), dp.getLength());
+                if (!msg.equals(actual)) {
+                    throw new RuntimeException("Msg expected: " + msg
+                            + " of length: " + msg.length() +
+                            ", actual received: " + actual + " of length: " + dp.getLength());
+                }
             }
+            System.out.println("All " + msgs.length + " replies received from the server");
+        }
+        // wait for the server thread to complete
+        System.out.println("awaiting server thread " + serverThread + " to complete");
+        serverThread.join();
+        Exception serverFailure = server.serverFailure.get();
+        if (serverFailure != null) {
+            System.err.println("Unexpected failure on server: " + serverFailure);
+            throw serverFailure;
         }
-        ds.close();
-        System.out.println("Test Passed!!!");
     }
 }

From b32e9b0f9be7349f797ced4a260e1e10418af3bb Mon Sep 17 00:00:00 2001
From: William Kemper <wkemper@openjdk.org>
Date: Fri, 20 Mar 2026 16:20:40 +0000
Subject: [PATCH 278/655] 8378806: Genshen: Add scope of collection to end of
 cycle message in JMX notification

Reviewed-by: kdnilsen, xpeng
---
 .../share/gc/shenandoah/shenandoahUtils.cpp   | 18 +++-
 .../share/gc/shenandoah/shenandoahUtils.hpp   |  2 +
 .../mxbeans/TestCycleEndMessage.java          | 83 +++++++++++++++++++
 .../TestStringDeduplicationTools.java         |  3 +-
 4 files changed, 104 insertions(+), 2 deletions(-)
 create mode 100644 test/hotspot/jtreg/gc/shenandoah/mxbeans/TestCycleEndMessage.java

diff --git a/src/hotspot/share/gc/shenandoah/shenandoahUtils.cpp b/src/hotspot/share/gc/shenandoah/shenandoahUtils.cpp
index 176baa133c8..dea47fcbf4f 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahUtils.cpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahUtils.cpp
@@ -40,6 +40,22 @@
 
 ShenandoahPhaseTimings::Phase ShenandoahTimingsTracker::_current_phase = ShenandoahPhaseTimings::_invalid_phase;
 
+const char* ShenandoahGCSession::cycle_end_message(ShenandoahGenerationType type) {
+  switch (type) {
+    case NON_GEN:
+      return "end of GC cycle";
+    case GLOBAL:
+      return "end of Global GC cycle";
+    case YOUNG:
+      return "end of Young GC cycle";
+    case OLD:
+      return "end of Old GC cycle";
+    default:
+      ShouldNotReachHere();
+      return "end of GC cycle";
+  }
+}
+
 ShenandoahGCSession::ShenandoahGCSession(GCCause::Cause cause, ShenandoahGeneration* generation) :
   _heap(ShenandoahHeap::heap()),
   _generation(generation),
@@ -54,7 +70,7 @@ ShenandoahGCSession::ShenandoahGCSession(GCCause::Cause cause, ShenandoahGenerat
   _heap->trace_heap_before_gc(_tracer);
 
   _trace_cycle.initialize(_heap->cycle_memory_manager(), cause,
-          "end of GC cycle",
+          cycle_end_message(_generation->type()),
           /* allMemoryPoolsAffected */    true,
           /* recordGCBeginTime = */       true,
           /* recordPreGCUsage = */        true,
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahUtils.hpp b/src/hotspot/share/gc/shenandoah/shenandoahUtils.hpp
index 8a508c4afd8..6ef4cd7c702 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahUtils.hpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahUtils.hpp
@@ -67,6 +67,8 @@ private:
   GCTracer* const _tracer;
 
   TraceMemoryManagerStats _trace_cycle;
+
+  static const char* cycle_end_message(ShenandoahGenerationType type);
 public:
   ShenandoahGCSession(GCCause::Cause cause, ShenandoahGeneration* generation);
   ~ShenandoahGCSession();
diff --git a/test/hotspot/jtreg/gc/shenandoah/mxbeans/TestCycleEndMessage.java b/test/hotspot/jtreg/gc/shenandoah/mxbeans/TestCycleEndMessage.java
new file mode 100644
index 00000000000..e7a4cfc9605
--- /dev/null
+++ b/test/hotspot/jtreg/gc/shenandoah/mxbeans/TestCycleEndMessage.java
@@ -0,0 +1,83 @@
+/*
+ * Copyright Amazon.com Inc. or its affiliates. All Rights Reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ *
+ */
+
+/*
+ * @test
+ * @summary Check that GC cycle end message contains generation name
+ * @library /test/lib /
+ * @requires vm.gc.Shenandoah
+ *
+ * @run main/othervm -Xmx128m -XX:+UnlockDiagnosticVMOptions -XX:+UnlockExperimentalVMOptions
+ *      -XX:+UseShenandoahGC -XX:ShenandoahGCMode=generational
+ *      TestCycleEndMessage
+ */
+
+import java.lang.management.GarbageCollectorMXBean;
+import java.lang.management.ManagementFactory;
+import java.util.concurrent.atomic.AtomicBoolean;
+import javax.management.Notification;
+import javax.management.NotificationEmitter;
+import javax.management.NotificationListener;
+import javax.management.openmbean.CompositeData;
+
+import com.sun.management.GarbageCollectionNotificationInfo;
+
+public class TestCycleEndMessage {
+
+    public static void main(String[] args) throws Exception {
+        final AtomicBoolean foundGenerationInCycle = new AtomicBoolean(false);
+
+        NotificationListener listener = new NotificationListener() {
+            @Override
+            public void handleNotification(Notification n, Object o) {
+                if (n.getType().equals(GarbageCollectionNotificationInfo.GARBAGE_COLLECTION_NOTIFICATION)) {
+                    GarbageCollectionNotificationInfo info = GarbageCollectionNotificationInfo.from((CompositeData) n.getUserData());
+
+                    String name = info.getGcName();
+                    String action = info.getGcAction();
+
+                    System.out.println("Received: " + name + " / " + action);
+
+                    if (name.equals("Shenandoah Cycles") &&
+                        (action.contains("Global") || action.contains("Young") || action.contains("Old"))) {
+                        foundGenerationInCycle.set(true);
+                    }
+                }
+            }
+        };
+
+        for (GarbageCollectorMXBean bean : ManagementFactory.getGarbageCollectorMXBeans()) {
+            ((NotificationEmitter) bean).addNotificationListener(listener, null, null);
+        }
+
+        System.gc();
+        Thread.sleep(2000);
+
+        if (!foundGenerationInCycle.get()) {
+            throw new IllegalStateException("Expected to find generation name (Global/Young/Old) in Shenandoah Cycles action message");
+        }
+
+        System.out.println("Test passed: Found generation name in cycle end message");
+    }
+}
diff --git a/test/hotspot/jtreg/gc/stringdedup/TestStringDeduplicationTools.java b/test/hotspot/jtreg/gc/stringdedup/TestStringDeduplicationTools.java
index 3dbedd61d12..e4185dd0f12 100644
--- a/test/hotspot/jtreg/gc/stringdedup/TestStringDeduplicationTools.java
+++ b/test/hotspot/jtreg/gc/stringdedup/TestStringDeduplicationTools.java
@@ -129,7 +129,8 @@ class TestStringDeduplicationTools {
                 GarbageCollectionNotificationInfo info = GarbageCollectionNotificationInfo.from((CompositeData) n.getUserData());
                 // Shenandoah and Z GC also report GC pauses, skip them
                 if (info.getGcName().startsWith("Shenandoah")) {
-                    if ("end of GC cycle".equals(info.getGcAction())) {
+                    String action = info.getGcAction();
+                    if (action != null && action.contains("GC cycle")) {
                         gcCount++;
                     }
                 } else if (info.getGcName().startsWith("ZGC")) {

From 26c4b5f5a1ad623ef7d3db06e4903867b03b5443 Mon Sep 17 00:00:00 2001
From: William Kemper <wkemper@openjdk.org>
Date: Fri, 20 Mar 2026 16:25:39 +0000
Subject: [PATCH 279/655] 8379367: GenShen: Replace atomic promotion failure
 counters with thread local variables

Reviewed-by: kdnilsen
---
 .../gc/shenandoah/shenandoahBarrierSet.cpp    |   7 +-
 .../shenandoah/shenandoahGenerationalHeap.cpp | 207 ++--------------
 .../shenandoah/shenandoahGenerationalHeap.hpp |   7 -
 .../share/gc/shenandoah/shenandoahHeap.cpp    |  18 +-
 .../gc/shenandoah/shenandoahOldGeneration.cpp |  85 +++++--
 .../gc/shenandoah/shenandoahOldGeneration.hpp |  12 +-
 .../share/gc/shenandoah/shenandoahPLAB.cpp    | 221 ++++++++++++++++++
 .../share/gc/shenandoah/shenandoahPLAB.hpp    | 130 +++++++++++
 .../shenandoah/shenandoahThreadLocalData.cpp  |  13 +-
 .../shenandoah/shenandoahThreadLocalData.hpp  |  84 +------
 .../test_shenandoahOldGeneration.cpp          |  20 +-
 11 files changed, 470 insertions(+), 334 deletions(-)
 create mode 100644 src/hotspot/share/gc/shenandoah/shenandoahPLAB.cpp
 create mode 100644 src/hotspot/share/gc/shenandoah/shenandoahPLAB.hpp

diff --git a/src/hotspot/share/gc/shenandoah/shenandoahBarrierSet.cpp b/src/hotspot/share/gc/shenandoah/shenandoahBarrierSet.cpp
index 004558a9fa8..cb6ff795c07 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahBarrierSet.cpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahBarrierSet.cpp
@@ -166,10 +166,9 @@ void ShenandoahBarrierSet::on_thread_detach(Thread *thread) {
       gclab->retire();
     }
 
-    PLAB* plab = ShenandoahThreadLocalData::plab(thread);
-    if (plab != nullptr) {
-      // This will assert if plab is not null in non-generational mode
-      ShenandoahGenerationalHeap::heap()->retire_plab(plab);
+    ShenandoahPLAB* shenandoah_plab = ShenandoahThreadLocalData::shenandoah_plab(thread);
+    if (shenandoah_plab != nullptr) {
+      shenandoah_plab->retire();
     }
 
     // SATB protocol requires to keep alive reachable oops from roots at the beginning of GC
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahGenerationalHeap.cpp b/src/hotspot/share/gc/shenandoah/shenandoahGenerationalHeap.cpp
index c731221adeb..27e374a0f85 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahGenerationalHeap.cpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahGenerationalHeap.cpp
@@ -269,27 +269,25 @@ oop ShenandoahGenerationalHeap::try_evacuate_object(oop p, Thread* thread, uint
           break;
         }
         case OLD_GENERATION: {
-          PLAB* plab = ShenandoahThreadLocalData::plab(thread);
-          if (plab != nullptr) {
+          ShenandoahPLAB* shenandoah_plab = ShenandoahThreadLocalData::shenandoah_plab(thread);
+          if (shenandoah_plab != nullptr) {
             has_plab = true;
-            copy = allocate_from_plab(thread, size, is_promotion);
-            if ((copy == nullptr) && (size < ShenandoahThreadLocalData::plab_size(thread)) &&
-                ShenandoahThreadLocalData::plab_retries_enabled(thread)) {
+            copy = shenandoah_plab->allocate(size, is_promotion);
+            if (copy == nullptr && size < shenandoah_plab->desired_size() && shenandoah_plab->retries_enabled()) {
               // PLAB allocation failed because we are bumping up against the limit on old evacuation reserve or because
               // the requested object does not fit within the current plab but the plab still has an "abundance" of memory,
               // where abundance is defined as >= ShenGenHeap::plab_min_size().  In the former case, we try shrinking the
               // desired PLAB size to the minimum and retry PLAB allocation to avoid cascading of shared memory allocations.
               // Shrinking the desired PLAB size may allow us to eke out a small PLAB while staying beneath evacuation reserve.
-              if (plab->words_remaining() < plab_min_size()) {
-                ShenandoahThreadLocalData::set_plab_size(thread, plab_min_size());
-                copy = allocate_from_plab(thread, size, is_promotion);
-                // If we still get nullptr, we'll try a shared allocation below.
+              if (shenandoah_plab->plab()->words_remaining() < plab_min_size()) {
+                shenandoah_plab->set_desired_size(plab_min_size());
+                copy = shenandoah_plab->allocate(size, is_promotion);
                 if (copy == nullptr) {
-                  // If retry fails, don't continue to retry until we have success (probably in next GC pass)
-                  ShenandoahThreadLocalData::disable_plab_retries(thread);
+                  // If we still get nullptr, we'll try a shared allocation below.
+                  // However, don't continue to retry until we have success (probably in next GC pass)
+                  shenandoah_plab->disable_retries();
                 }
               }
-              // else, copy still equals nullptr.  this causes shared allocation below, preserving this plab for future needs.
             }
           }
           break;
@@ -384,9 +382,9 @@ oop ShenandoahGenerationalHeap::try_evacuate_object(oop p, Thread* thread, uint
           break;
         }
         case OLD_GENERATION: {
-          ShenandoahThreadLocalData::plab(thread)->undo_allocation(copy, size);
+          ShenandoahThreadLocalData::shenandoah_plab(thread)->plab()->undo_allocation(copy, size);
           if (is_promotion) {
-            ShenandoahThreadLocalData::subtract_from_plab_promoted(thread, size * HeapWordSize);
+            ShenandoahThreadLocalData::shenandoah_plab(thread)->subtract_from_promoted(size * HeapWordSize);
           }
           break;
         }
@@ -411,179 +409,6 @@ template oop ShenandoahGenerationalHeap::try_evacuate_object<YOUNG_GENERATION, Y
 template oop ShenandoahGenerationalHeap::try_evacuate_object<YOUNG_GENERATION, OLD_GENERATION>(oop p, Thread* thread, uint from_region_age);
 template oop ShenandoahGenerationalHeap::try_evacuate_object<OLD_GENERATION, OLD_GENERATION>(oop p, Thread* thread, uint from_region_age);
 
-inline HeapWord* ShenandoahGenerationalHeap::allocate_from_plab(Thread* thread, size_t size, bool is_promotion) {
-  assert(UseTLAB, "TLABs should be enabled");
-
-  PLAB* plab = ShenandoahThreadLocalData::plab(thread);
-  HeapWord* obj;
-
-  if (plab == nullptr) {
-    assert(!thread->is_Java_thread() && !thread->is_Worker_thread(), "Performance: thread should have PLAB: %s", thread->name());
-    // No PLABs in this thread, fallback to shared allocation
-    return nullptr;
-  } else if (is_promotion && !ShenandoahThreadLocalData::allow_plab_promotions(thread)) {
-    return nullptr;
-  }
-  // if plab->word_size() <= 0, thread's plab not yet initialized for this pass, so allow_plab_promotions() is not trustworthy
-  obj = plab->allocate(size);
-  if ((obj == nullptr) && (plab->words_remaining() < plab_min_size())) {
-    // allocate_from_plab_slow will establish allow_plab_promotions(thread) for future invocations
-    obj = allocate_from_plab_slow(thread, size, is_promotion);
-  }
-  // if plab->words_remaining() >= ShenGenHeap::heap()->plab_min_size(), just return nullptr so we can use a shared allocation
-  if (obj == nullptr) {
-    return nullptr;
-  }
-
-  if (is_promotion) {
-    ShenandoahThreadLocalData::add_to_plab_promoted(thread, size * HeapWordSize);
-  }
-  return obj;
-}
-
-// Establish a new PLAB and allocate size HeapWords within it.
-HeapWord* ShenandoahGenerationalHeap::allocate_from_plab_slow(Thread* thread, size_t size, bool is_promotion) {
-  assert(mode()->is_generational(), "PLABs only relevant to generational GC");
-
-  const size_t plab_min_size = this->plab_min_size();
-  // PLABs are aligned to card boundaries to avoid synchronization with concurrent
-  // allocations in other PLABs.
-  const size_t min_size = (size > plab_min_size)? align_up(size, CardTable::card_size_in_words()): plab_min_size;
-
-  // Figure out size of new PLAB, using value determined at last refill.
-  size_t cur_size = ShenandoahThreadLocalData::plab_size(thread);
-  if (cur_size == 0) {
-    cur_size = plab_min_size;
-  }
-
-  // Expand aggressively, doubling at each refill in this epoch, ceiling at plab_max_size()
-  const size_t future_size = MIN2(cur_size * 2, plab_max_size());
-  // Doubling, starting at a card-multiple, should give us a card-multiple. (Ceiling and floor
-  // are card multiples.)
-  assert(is_aligned(future_size, CardTable::card_size_in_words()), "Card multiple by construction, future_size: %zu"
-          ", card_size: %u, cur_size: %zu, max: %zu",
-         future_size, CardTable::card_size_in_words(), cur_size, plab_max_size());
-
-  // Record new heuristic value even if we take any shortcut. This captures
-  // the case when moderately-sized objects always take a shortcut. At some point,
-  // heuristics should catch up with them.  Note that the requested cur_size may
-  // not be honored, but we remember that this is the preferred size.
-  log_debug(gc, plab)("Set next PLAB refill size: %zu bytes", future_size * HeapWordSize);
-  ShenandoahThreadLocalData::set_plab_size(thread, future_size);
-
-  if (cur_size < size) {
-    // The PLAB to be allocated is still not large enough to hold the object. Fall back to shared allocation.
-    // This avoids retiring perfectly good PLABs in order to represent a single large object allocation.
-    log_debug(gc, plab)("Current PLAB size (%zu) is too small for %zu", cur_size * HeapWordSize, size * HeapWordSize);
-    return nullptr;
-  }
-
-  // Retire current PLAB, and allocate a new one.
-  PLAB* plab = ShenandoahThreadLocalData::plab(thread);
-  if (plab->words_remaining() < plab_min_size) {
-    // Retire current PLAB. This takes care of any PLAB book-keeping.
-    // retire_plab() registers the remnant filler object with the remembered set scanner without a lock.
-    // Since PLABs are card-aligned, concurrent registrations in other PLABs don't interfere.
-    retire_plab(plab, thread);
-
-    size_t actual_size = 0;
-    HeapWord* plab_buf = allocate_new_plab(min_size, cur_size, &actual_size);
-    if (plab_buf == nullptr) {
-      if (min_size == plab_min_size) {
-        // Disable PLAB promotions for this thread because we cannot even allocate a minimal PLAB. This allows us
-        // to fail faster on subsequent promotion attempts.
-        ShenandoahThreadLocalData::disable_plab_promotions(thread);
-      }
-      return nullptr;
-    } else {
-      ShenandoahThreadLocalData::enable_plab_retries(thread);
-    }
-    // Since the allocated PLAB may have been down-sized for alignment, plab->allocate(size) below may still fail.
-    if (ZeroTLAB) {
-      // ... and clear it.
-      Copy::zero_to_words(plab_buf, actual_size);
-    } else {
-      // ...and zap just allocated object.
-#ifdef ASSERT
-      // Skip mangling the space corresponding to the object header to
-      // ensure that the returned space is not considered parsable by
-      // any concurrent GC thread.
-      size_t hdr_size = oopDesc::header_size();
-      Copy::fill_to_words(plab_buf + hdr_size, actual_size - hdr_size, badHeapWordVal);
-#endif // ASSERT
-    }
-    assert(is_aligned(actual_size, CardTable::card_size_in_words()), "Align by design");
-    plab->set_buf(plab_buf, actual_size);
-    if (is_promotion && !ShenandoahThreadLocalData::allow_plab_promotions(thread)) {
-      return nullptr;
-    }
-    return plab->allocate(size);
-  } else {
-    // If there's still at least min_size() words available within the current plab, don't retire it.  Let's nibble
-    // away on this plab as long as we can.  Meanwhile, return nullptr to force this particular allocation request
-    // to be satisfied with a shared allocation.  By packing more promotions into the previously allocated PLAB, we
-    // reduce the likelihood of evacuation failures, and we reduce the need for downsizing our PLABs.
-    return nullptr;
-  }
-}
-
-HeapWord* ShenandoahGenerationalHeap::allocate_new_plab(size_t min_size, size_t word_size, size_t* actual_size) {
-  // Align requested sizes to card-sized multiples.  Align down so that we don't violate max size of TLAB.
-  assert(is_aligned(min_size, CardTable::card_size_in_words()), "Align by design");
-  assert(word_size >= min_size, "Requested PLAB is too small");
-
-  ShenandoahAllocRequest req = ShenandoahAllocRequest::for_plab(min_size, word_size);
-  // Note that allocate_memory() sets a thread-local flag to prohibit further promotions by this thread
-  // if we are at risk of infringing on the old-gen evacuation budget.
-  HeapWord* res = allocate_memory(req);
-  if (res != nullptr) {
-    *actual_size = req.actual_size();
-  } else {
-    *actual_size = 0;
-  }
-  assert(is_aligned(res, CardTable::card_size_in_words()), "Align by design");
-  return res;
-}
-
-void ShenandoahGenerationalHeap::retire_plab(PLAB* plab, Thread* thread) {
-  // We don't enforce limits on plab evacuations.  We let it consume all available old-gen memory in order to reduce
-  // probability of an evacuation failure.  We do enforce limits on promotion, to make sure that excessive promotion
-  // does not result in an old-gen evacuation failure.  Note that a failed promotion is relatively harmless.  Any
-  // object that fails to promote in the current cycle will be eligible for promotion in a subsequent cycle.
-
-  // When the plab was instantiated, its entirety was treated as if the entire buffer was going to be dedicated to
-  // promotions.  Now that we are retiring the buffer, we adjust for the reality that the plab is not entirely promotions.
-  //  1. Some of the plab may have been dedicated to evacuations.
-  //  2. Some of the plab may have been abandoned due to waste (at the end of the plab).
-  size_t not_promoted =
-          ShenandoahThreadLocalData::get_plab_actual_size(thread) - ShenandoahThreadLocalData::get_plab_promoted(thread);
-  ShenandoahThreadLocalData::reset_plab_promoted(thread);
-  ShenandoahThreadLocalData::set_plab_actual_size(thread, 0);
-  if (not_promoted > 0) {
-    log_debug(gc, plab)("Retire PLAB, unexpend unpromoted: %zu", not_promoted * HeapWordSize);
-    old_generation()->unexpend_promoted(not_promoted);
-  }
-  const size_t original_waste = plab->waste();
-  HeapWord* const top = plab->top();
-
-  // plab->retire() overwrites unused memory between plab->top() and plab->hard_end() with a dummy object to make memory parsable.
-  // It adds the size of this unused memory, in words, to plab->waste().
-  plab->retire();
-  if (top != nullptr && plab->waste() > original_waste && is_in_old(top)) {
-    // If retiring the plab created a filler object, then we need to register it with our card scanner so it can
-    // safely walk the region backing the plab.
-    log_debug(gc, plab)("retire_plab() is registering remnant of size %zu at " PTR_FORMAT,
-                        (plab->waste() - original_waste) * HeapWordSize, p2i(top));
-    // No lock is necessary because the PLAB memory is aligned on card boundaries.
-    old_generation()->card_scan()->register_object_without_lock(top);
-  }
-}
-
-void ShenandoahGenerationalHeap::retire_plab(PLAB* plab) {
-  Thread* thread = Thread::current();
-  retire_plab(plab, thread);
-}
-
 // Make sure old-generation is large enough, but no larger than is necessary, to hold mixed evacuations
 // and promotions, if we anticipate either. Any deficit is provided by the young generation, subject to
 // mutator_xfer_limit, and any surplus is transferred to the young generation.  mutator_xfer_limit is
@@ -1164,9 +989,7 @@ void ShenandoahGenerationalHeap::complete_degenerated_cycle() {
     coalesce_and_fill_old_regions(false);
   }
 
-  log_info(gc, cset)("Degenerated cycle complete, promotions reserved: %zu, promotions expended: %zu, failed count: %zu, failed bytes: %zu",
-                     old_generation()->get_promoted_reserve(), old_generation()->get_promoted_expended(),
-                     old_generation()->get_promotion_failed_count(), old_generation()->get_promotion_failed_words() * HeapWordSize);
+  old_generation()->maybe_log_promotion_failure_stats(false);
 }
 
 void ShenandoahGenerationalHeap::complete_concurrent_cycle() {
@@ -1181,9 +1004,7 @@ void ShenandoahGenerationalHeap::complete_concurrent_cycle() {
     entry_global_coalesce_and_fill();
   }
 
-  log_info(gc, cset)("Concurrent cycle complete, promotions reserved: %zu, promotions expended: %zu, failed count: %zu, failed bytes: %zu",
-                     old_generation()->get_promoted_reserve(), old_generation()->get_promoted_expended(),
-                     old_generation()->get_promotion_failed_count(), old_generation()->get_promotion_failed_words() * HeapWordSize);
+  old_generation()->maybe_log_promotion_failure_stats(true);
 }
 
 void ShenandoahGenerationalHeap::entry_global_coalesce_and_fill() {
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahGenerationalHeap.hpp b/src/hotspot/share/gc/shenandoah/shenandoahGenerationalHeap.hpp
index 7fe0362aa3f..d6893dc011e 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahGenerationalHeap.hpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahGenerationalHeap.hpp
@@ -102,9 +102,6 @@ public:
   size_t plab_min_size() const { return _min_plab_size; }
   size_t plab_max_size() const { return _max_plab_size; }
 
-  void retire_plab(PLAB* plab);
-  void retire_plab(PLAB* plab, Thread* thread);
-
   // ---------- Update References
   //
   // In the generational mode, we will use this function for young, mixed, and global collections.
@@ -113,10 +110,6 @@ public:
   void final_update_refs_update_region_states() override;
 
 private:
-  HeapWord* allocate_from_plab(Thread* thread, size_t size, bool is_promotion);
-  HeapWord* allocate_from_plab_slow(Thread* thread, size_t size, bool is_promotion);
-  HeapWord* allocate_new_plab(size_t min_size, size_t word_size, size_t* actual_size);
-
   const size_t _min_plab_size;
   const size_t _max_plab_size;
 
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahHeap.cpp b/src/hotspot/share/gc/shenandoah/shenandoahHeap.cpp
index c0a4cfc34fb..9cd22e6ee25 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahHeap.cpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahHeap.cpp
@@ -1182,20 +1182,20 @@ public:
     }
 
     if (ShenandoahHeap::heap()->mode()->is_generational()) {
-      PLAB* plab = ShenandoahThreadLocalData::plab(thread);
-      assert(plab != nullptr, "PLAB should be initialized for %s", thread->name());
+      ShenandoahPLAB* shenandoah_plab = ShenandoahThreadLocalData::shenandoah_plab(thread);
+      assert(shenandoah_plab != nullptr, "PLAB should be initialized for %s", thread->name());
 
       // There are two reasons to retire all plabs between old-gen evacuation passes.
       //  1. We need to make the plab memory parsable by remembered-set scanning.
       //  2. We need to establish a trustworthy UpdateWaterMark value within each old-gen heap region
-      ShenandoahGenerationalHeap::heap()->retire_plab(plab, thread);
+      shenandoah_plab->retire();
 
       // Re-enable promotions for the next evacuation phase.
-      ShenandoahThreadLocalData::enable_plab_promotions(thread);
+      shenandoah_plab->enable_promotions();
 
       // Reset the fill size for next evacuation phase.
-      if (_resize && ShenandoahThreadLocalData::plab_size(thread) > 0) {
-        ShenandoahThreadLocalData::set_plab_size(thread, 0);
+      if (_resize && shenandoah_plab->desired_size() > 0) {
+        shenandoah_plab->set_desired_size(0);
       }
     }
   }
@@ -1465,9 +1465,9 @@ public:
     assert(gclab->words_remaining() == 0, "GCLAB should not need retirement");
 
     if (ShenandoahHeap::heap()->mode()->is_generational()) {
-      PLAB* plab = ShenandoahThreadLocalData::plab(thread);
-      assert(plab != nullptr, "PLAB should be initialized for %s", thread->name());
-      assert(plab->words_remaining() == 0, "PLAB should not need retirement");
+      ShenandoahPLAB* shenandoah_plab = ShenandoahThreadLocalData::shenandoah_plab(thread);
+      assert(shenandoah_plab != nullptr, "PLAB should be initialized for %s", thread->name());
+      assert(shenandoah_plab->plab()->words_remaining() == 0, "PLAB should not need retirement");
     }
   }
 };
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahOldGeneration.cpp b/src/hotspot/share/gc/shenandoah/shenandoahOldGeneration.cpp
index 1b12909bcaf..16a24da8b1c 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahOldGeneration.cpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahOldGeneration.cpp
@@ -38,6 +38,7 @@
 #include "gc/shenandoah/shenandoahOldGeneration.hpp"
 #include "gc/shenandoah/shenandoahReferenceProcessor.hpp"
 #include "gc/shenandoah/shenandoahScanRemembered.inline.hpp"
+#include "gc/shenandoah/shenandoahThreadLocalData.hpp"
 #include "gc/shenandoah/shenandoahUtils.hpp"
 #include "gc/shenandoah/shenandoahWorkerPolicy.hpp"
 #include "gc/shenandoah/shenandoahYoungGeneration.hpp"
@@ -109,8 +110,6 @@ ShenandoahOldGeneration::ShenandoahOldGeneration(uint max_queues)
     _promoted_expended(0),
     _promotion_potential(0),
     _pad_for_promote_in_place(0),
-    _promotion_failure_count(0),
-    _promotion_failure_words(0),
     _promotable_humongous_regions(0),
     _promotable_regular_regions(0),
     _is_parsable(true),
@@ -148,8 +147,50 @@ void ShenandoahOldGeneration::augment_promoted_reserve(size_t increment) {
 void ShenandoahOldGeneration::reset_promoted_expended() {
   shenandoah_assert_heaplocked_or_safepoint();
   _promoted_expended.store_relaxed(0);
-  _promotion_failure_count.store_relaxed(0);
-  _promotion_failure_words.store_relaxed(0);
+}
+
+void ShenandoahOldGeneration::maybe_log_promotion_failure_stats(bool concurrent) const {
+  LogTarget(Info, gc, plab) plab_info;
+  if (plab_info.is_enabled()) {
+    size_t failed_count = 0;
+    size_t failed_words = 0;
+
+    class AggregatePromotionFailuresClosure : public ThreadClosure {
+    private:
+      size_t _total_count;
+      size_t _total_words;
+    public:
+      AggregatePromotionFailuresClosure() : _total_count(0), _total_words(0) {}
+
+      void do_thread(Thread* thread) override {
+        ShenandoahPLAB* plab = ShenandoahThreadLocalData::shenandoah_plab(thread);
+        if (plab != nullptr) {
+          _total_count += plab->get_promotion_failure_count();
+          _total_words += plab->get_promotion_failure_words();
+          plab->reset_promotion_failures();
+        }
+      }
+
+      size_t total_count() const { return _total_count; }
+      size_t total_words() const { return _total_words; }
+    };
+
+    AggregatePromotionFailuresClosure cl;
+    if (concurrent) {
+      MutexLocker lock(Threads_lock);
+      Threads::threads_do(&cl);
+    } else {
+      Threads::threads_do(&cl);
+    }
+
+    failed_count = cl.total_count();
+    failed_words = cl.total_words();
+
+    LogStream ls(plab_info);
+    ls.print_cr("Cycle complete, promotions reserved: %zu, promotions expended: %zu, failed count: %zu, failed bytes: %zu",
+                get_promoted_reserve(), get_promoted_expended(),
+                failed_count, failed_words * HeapWordSize);
+  }
 }
 
 size_t ShenandoahOldGeneration::expend_promoted(size_t increment) {
@@ -199,7 +240,8 @@ ShenandoahOldGeneration::configure_plab_for_current_thread(const ShenandoahAlloc
   // We've created a new plab. Now we configure it whether it will be used for promotions
   // and evacuations - or just evacuations.
   Thread* thread = Thread::current();
-  ShenandoahThreadLocalData::reset_plab_promoted(thread);
+  ShenandoahPLAB* shenandoah_plab = ShenandoahThreadLocalData::shenandoah_plab(thread);
+  shenandoah_plab->reset_promoted();
 
   // The actual size of the allocation may be larger than the requested bytes (due to alignment on card boundaries).
   // If this puts us over our promotion budget, we need to disable future PLAB promotions for this thread.
@@ -209,12 +251,12 @@ ShenandoahOldGeneration::configure_plab_for_current_thread(const ShenandoahAlloc
     log_debug(gc, plab)("Thread can promote using PLAB of %zu bytes. Expended: %zu, available: %zu",
                         actual_size, get_promoted_expended(), get_promoted_reserve());
     expend_promoted(actual_size);
-    ShenandoahThreadLocalData::enable_plab_promotions(thread);
-    ShenandoahThreadLocalData::set_plab_actual_size(thread, actual_size);
+    shenandoah_plab->enable_promotions();
+    shenandoah_plab->set_actual_size(actual_size);
   } else {
     // Disable promotions in this thread because entirety of this PLAB must be available to hold old-gen evacuations.
-    ShenandoahThreadLocalData::disable_plab_promotions(thread);
-    ShenandoahThreadLocalData::set_plab_actual_size(thread, 0);
+    shenandoah_plab->disable_promotions();
+    shenandoah_plab->set_actual_size(0);
     log_debug(gc, plab)("Thread cannot promote using PLAB of %zu bytes. Expended: %zu, available: %zu, mixed evacuations? %s",
                         actual_size, get_promoted_expended(), get_promoted_reserve(), BOOL_TO_STR(ShenandoahHeap::heap()->collection_set()->has_old_regions()));
   }
@@ -582,13 +624,21 @@ void ShenandoahOldGeneration::handle_failed_evacuation() {
   }
 }
 
-void ShenandoahOldGeneration::handle_failed_promotion(Thread* thread, size_t size) {
-  _promotion_failure_count.add_then_fetch(1UL);
-  _promotion_failure_words.add_then_fetch(size);
+void ShenandoahOldGeneration::handle_failed_promotion(Thread* thread, size_t size) const {
+  LogTarget(Info, gc, plab) plab_info;
+  if (plab_info.is_enabled()) {
+    ShenandoahPLAB* plab = ShenandoahThreadLocalData::shenandoah_plab(thread);
+    if (plab != nullptr) {
+      plab->record_promotion_failure(size);
+    } else {
+      ResourceMark for_thread_name;
+      log_debug(gc, plab)("Thread: %s has no plab", thread->name());
+    }
+  }
 
-  LogTarget(Debug, gc, plab) lt;
-  LogStream ls(lt);
-  if (lt.is_enabled()) {
+  LogTarget(Debug, gc, plab) plab_debug;
+  if (plab_debug.is_enabled()) {
+    LogStream ls(plab_debug);
     log_failed_promotion(ls, thread, size);
   }
 }
@@ -603,9 +653,10 @@ void ShenandoahOldGeneration::log_failed_promotion(LogStream& ls, Thread* thread
   const size_t gc_id = heap->control_thread()->get_gc_id();
   if ((gc_id != last_report_epoch) || (epoch_report_count++ < MaxReportsPerEpoch)) {
     // Promotion failures should be very rare.  Invest in providing useful diagnostic info.
-    PLAB* const plab = ShenandoahThreadLocalData::plab(thread);
+    ShenandoahPLAB* const shenandoah_plab = ShenandoahThreadLocalData::shenandoah_plab(thread);
+    PLAB* const plab = (shenandoah_plab == nullptr)? nullptr: shenandoah_plab->plab();
     const size_t words_remaining = (plab == nullptr)? 0: plab->words_remaining();
-    const char* promote_enabled = ShenandoahThreadLocalData::allow_plab_promotions(thread)? "enabled": "disabled";
+    const char* promote_enabled = (shenandoah_plab != nullptr && shenandoah_plab->allows_promotion())? "enabled": "disabled";
 
     // Promoted reserve is only changed by vm or control thread. Promoted expended is always accessed atomically.
     const size_t promotion_reserve = get_promoted_reserve();
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahOldGeneration.hpp b/src/hotspot/share/gc/shenandoah/shenandoahOldGeneration.hpp
index 5ebad461f3c..12e046a1afc 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahOldGeneration.hpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahOldGeneration.hpp
@@ -76,11 +76,6 @@ private:
   // objects). This field records the total amount of padding used for such regions.
   size_t _pad_for_promote_in_place;
 
-  // Keep track of the number and size of promotions that failed. Perhaps we should use this to increase
-  // the size of the old generation for the next collection cycle.
-  Atomic<size_t> _promotion_failure_count;
-  Atomic<size_t> _promotion_failure_words;
-
   // During construction of the collection set, we keep track of regions that are eligible
   // for promotion in place. These fields track the count of those humongous and regular regions.
   // This data is used to force the evacuation phase even when the collection set is otherwise
@@ -125,9 +120,8 @@ public:
   // This is used on the allocation path to gate promotions that would exceed the reserve
   size_t get_promoted_expended() const;
 
-  // Return the count and size (in words) of failed promotions since the last reset
-  size_t get_promotion_failed_count() const { return _promotion_failure_count.load_relaxed(); }
-  size_t get_promotion_failed_words() const { return _promotion_failure_words.load_relaxed(); }
+  // Aggregate and log promotion failure stats if logging is enabled
+  void maybe_log_promotion_failure_stats(bool concurrent) const;
 
   // Test if there is enough memory reserved for this promotion
   bool can_promote(size_t requested_bytes) const {
@@ -175,7 +169,7 @@ public:
   void handle_failed_evacuation();
 
   // Increment promotion failure counters, optionally log a more detailed message
-  void handle_failed_promotion(Thread* thread, size_t size);
+  void handle_failed_promotion(Thread* thread, size_t size) const;
   void log_failed_promotion(LogStream& ls, Thread* thread, size_t size) const;
 
   // A successful evacuation re-dirties the cards and registers the object with the remembered set
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahPLAB.cpp b/src/hotspot/share/gc/shenandoah/shenandoahPLAB.cpp
new file mode 100644
index 00000000000..412cfa9447e
--- /dev/null
+++ b/src/hotspot/share/gc/shenandoah/shenandoahPLAB.cpp
@@ -0,0 +1,221 @@
+/*
+ * Copyright Amazon.com Inc. or its affiliates. All Rights Reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ *
+ */
+
+#include "gc/shared/cardTable.hpp"
+#include "gc/shenandoah/shenandoahAllocRequest.hpp"
+#include "gc/shenandoah/shenandoahGenerationalHeap.hpp"
+#include "gc/shenandoah/shenandoahHeap.inline.hpp"
+#include "gc/shenandoah/shenandoahOldGeneration.hpp"
+#include "gc/shenandoah/shenandoahPLAB.hpp"
+#include "logging/log.hpp"
+#include "runtime/globals.hpp"
+#include "runtime/javaThread.hpp"
+#include "utilities/copy.hpp"
+
+ShenandoahPLAB::ShenandoahPLAB() :
+  _plab(nullptr),
+  _desired_size(0),
+  _actual_size(0),
+  _promoted(0),
+  _promotion_failure_count(0),
+  _promotion_failure_words(0),
+  _allows_promotion(false),
+  _retries_enabled(false),
+  _heap(ShenandoahGenerationalHeap::heap()) {
+  _plab = new PLAB(align_up(PLAB::min_size(), CardTable::card_size_in_words()));
+}
+
+ShenandoahPLAB::~ShenandoahPLAB() {
+  if (_plab != nullptr) {
+    delete _plab;
+  }
+}
+
+void ShenandoahPLAB::subtract_from_promoted(size_t increment) {
+  assert(_promoted >= increment, "Cannot subtract more than remaining promoted");
+  _promoted -= increment;
+}
+
+HeapWord* ShenandoahPLAB::allocate(size_t size, bool is_promotion) {
+  assert(UseTLAB, "TLABs should be enabled");
+
+  if (_plab == nullptr) {
+    // No PLABs in this thread, fallback to shared allocation
+    return nullptr;
+  }
+
+  if (is_promotion && !_allows_promotion) {
+    // Thread is not allowed to promote
+    return nullptr;
+  }
+
+  HeapWord* obj = _plab->allocate(size);
+  if (obj == nullptr) {
+    if (_plab->words_remaining() < _heap->plab_min_size()) {
+      // allocate_slow will establish _allows_promotion for future invocations
+      obj = allocate_slow(size, is_promotion);
+    }
+  }
+
+  // if plab->words_remaining() >= ShenGenHeap::heap()->plab_min_size(), just return nullptr so we can use a shared allocation
+  if (obj == nullptr) {
+    return nullptr;
+  }
+
+  if (is_promotion) {
+    add_to_promoted(size * HeapWordSize);
+  }
+  return obj;
+}
+
+// Establish a new PLAB and allocate size HeapWords within it.
+HeapWord* ShenandoahPLAB::allocate_slow(size_t size, bool is_promotion) {
+  assert(_heap->mode()->is_generational(), "PLABs only relevant to generational GC");
+
+  // PLABs are aligned to card boundaries to avoid synchronization with concurrent
+  // allocations in other PLABs.
+  const size_t plab_min_size = _heap->plab_min_size();
+  const size_t min_size = (size > plab_min_size)? align_up(size, CardTable::card_size_in_words()): plab_min_size;
+
+  // Figure out size of new PLAB, using value determined at last refill.
+  size_t cur_size = _desired_size;
+  if (cur_size == 0) {
+    cur_size = plab_min_size;
+  }
+
+  // Expand aggressively, doubling at each refill in this epoch, ceiling at plab_max_size()
+  // Doubling, starting at a card-multiple, should give us a card-multiple. (Ceiling and floor
+  // are card multiples.)
+  const size_t future_size = MIN2(cur_size * 2, _heap->plab_max_size());
+  assert(is_aligned(future_size, CardTable::card_size_in_words()), "Card multiple by construction, future_size: %zu"
+          ", card_size: %u, cur_size: %zu, max: %zu",
+         future_size, CardTable::card_size_in_words(), cur_size, _heap->plab_max_size());
+
+  // Record new heuristic value even if we take any shortcut. This captures
+  // the case when moderately-sized objects always take a shortcut. At some point,
+  // heuristics should catch up with them.  Note that the requested cur_size may
+  // not be honored, but we remember that this is the preferred size.
+  log_debug(gc, plab)("Set next PLAB refill size: %zu bytes", future_size * HeapWordSize);
+  set_desired_size(future_size);
+
+  if (cur_size < size) {
+    // The PLAB to be allocated is still not large enough to hold the object. Fall back to shared allocation.
+    // This avoids retiring perfectly good PLABs in order to represent a single large object allocation.
+    log_debug(gc, plab)("Current PLAB size (%zu) is too small for %zu", cur_size * HeapWordSize, size * HeapWordSize);
+    return nullptr;
+  }
+
+  if (_plab->words_remaining() < plab_min_size) {
+    // Retire current PLAB. This takes care of any PLAB book-keeping.
+    // retire_plab() registers the remnant filler object with the remembered set scanner without a lock.
+    // Since PLABs are card-aligned, concurrent registrations in other PLABs don't interfere.
+    retire();
+
+    size_t actual_size = 0;
+    HeapWord* plab_buf = allocate_new_plab(min_size, cur_size, &actual_size);
+    if (plab_buf == nullptr) {
+      if (min_size == plab_min_size) {
+        // Disable PLAB promotions for this thread because we cannot even allocate a minimal PLAB. This allows us
+        // to fail faster on subsequent promotion attempts.
+        disable_promotions();
+      }
+      return nullptr;
+    }
+
+    enable_retries();
+
+    // Since the allocated PLAB may have been down-sized for alignment, plab->allocate(size) below may still fail.
+    if (ZeroTLAB) {
+      // Skip mangling the space corresponding to the object header to
+      // ensure that the returned space is not considered parsable by
+      // any concurrent GC thread.
+      Copy::zero_to_words(plab_buf, actual_size);
+    } else {
+#ifdef ASSERT
+      size_t hdr_size = oopDesc::header_size();
+      Copy::fill_to_words(plab_buf + hdr_size, actual_size - hdr_size, badHeapWordVal);
+#endif
+    }
+    assert(is_aligned(actual_size, CardTable::card_size_in_words()), "Align by design");
+    _plab->set_buf(plab_buf, actual_size);
+    if (is_promotion && !_allows_promotion) {
+      return nullptr;
+    }
+    return _plab->allocate(size);
+  }
+
+  // If there's still at least min_size() words available within the current plab, don't retire it.  Let's nibble
+  // away on this plab as long as we can.  Meanwhile, return nullptr to force this particular allocation request
+  // to be satisfied with a shared allocation.  By packing more promotions into the previously allocated PLAB, we
+  // reduce the likelihood of evacuation failures, and we reduce the need for downsizing our PLABs.
+  return nullptr;
+}
+
+HeapWord* ShenandoahPLAB::allocate_new_plab(size_t min_size, size_t word_size, size_t* actual_size) {
+  assert(is_aligned(min_size, CardTable::card_size_in_words()), "Align by design");
+  assert(word_size >= min_size, "Requested PLAB is too small");
+
+  ShenandoahAllocRequest req = ShenandoahAllocRequest::for_plab(min_size, word_size);
+  HeapWord* res = _heap->allocate_memory(req);
+  if (res != nullptr) {
+    *actual_size = req.actual_size();
+  } else {
+    *actual_size = 0;
+  }
+  assert(is_aligned(res, CardTable::card_size_in_words()), "Align by design");
+  return res;
+}
+
+void ShenandoahPLAB::retire() {
+  // We don't enforce limits on plab evacuations.  We let it consume all available old-gen memory in order to reduce
+  // probability of an evacuation failure.  We do enforce limits on promotion, to make sure that excessive promotion
+  // does not result in an old-gen evacuation failure.  Note that a failed promotion is relatively harmless.  Any
+  // object that fails to promote in the current cycle will be eligible for promotion in a subsequent cycle.
+
+  // When the plab was instantiated, its entirety was treated as if the entire buffer was going to be dedicated to
+  // promotions.  Now that we are retiring the buffer, we adjust for the reality that the plab is not entirely promotions.
+  //  1. Some of the plab may have been dedicated to evacuations.
+  //  2. Some of the plab may have been abandoned due to waste (at the end of the plab).
+  size_t not_promoted = _actual_size - _promoted;
+  reset_promoted();
+  set_actual_size(0);
+  if (not_promoted > 0) {
+    log_debug(gc, plab)("Retire PLAB, unexpend unpromoted: %zu", not_promoted * HeapWordSize);
+    _heap->old_generation()->unexpend_promoted(not_promoted);
+  }
+  const size_t original_waste = _plab->waste();
+  HeapWord* const top = _plab->top();
+
+  // plab->retire() overwrites unused memory between plab->top() and plab->hard_end() with a dummy object to make memory parsable.
+  // It adds the size of this unused memory, in words, to plab->waste().
+  _plab->retire();
+  if (top != nullptr && _plab->waste() > original_waste && _heap->is_in_old(top)) {
+    // If retiring the plab created a filler object, then we need to register it with our card scanner so it can
+    // safely walk the region backing the plab.
+    log_debug(gc, plab)("retire_plab() is registering remnant of size %zu at " PTR_FORMAT,
+                        (_plab->waste() - original_waste) * HeapWordSize, p2i(top));
+    // No lock is necessary because the PLAB memory is aligned on card boundaries.
+    _heap->old_generation()->card_scan()->register_object_without_lock(top);
+  }
+}
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahPLAB.hpp b/src/hotspot/share/gc/shenandoah/shenandoahPLAB.hpp
new file mode 100644
index 00000000000..4278eb65b10
--- /dev/null
+++ b/src/hotspot/share/gc/shenandoah/shenandoahPLAB.hpp
@@ -0,0 +1,130 @@
+/*
+ * Copyright Amazon.com Inc. or its affiliates. All Rights Reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ *
+ */
+
+#ifndef SHARE_GC_SHENANDOAH_SHENANDOAHPLAB_HPP
+#define SHARE_GC_SHENANDOAH_SHENANDOAHPLAB_HPP
+
+#include "gc/shared/plab.hpp"
+#include "memory/allocation.hpp"
+
+class ShenandoahGenerationalHeap;
+
+class ShenandoahPLAB : public CHeapObj<mtGC> {
+private:
+  // The actual allocation buffer
+  PLAB* _plab;
+
+  // Heuristics will grow the desired size of plabs.
+  size_t _desired_size;
+
+  // Once the plab has been allocated, and we know the actual size, we record it here.
+  size_t _actual_size;
+
+  // As the plab is used for promotions, this value is incremented. When the plab is
+  // retired, the difference between 'actual_size' and 'promoted' will be returned to
+  // the old generation's promotion reserve (i.e., it will be 'unexpended').
+  size_t _promoted;
+
+  // Track failed promotion attempts per thread
+  size_t _promotion_failure_count;
+  size_t _promotion_failure_words;
+
+  // If false, no more promotion by this thread during this evacuation phase.
+  bool _allows_promotion;
+
+  // If true, evacuations may attempt to allocate a smaller plab if the original size fails.
+  bool _retries_enabled;
+
+  // Use for allocations, min/max plab sizes
+  ShenandoahGenerationalHeap* _heap;
+
+  // Enable retry logic for PLAB allocation failures
+  void enable_retries() { _retries_enabled = true; }
+
+  // Establish a new PLAB and allocate from it
+  HeapWord* allocate_slow(size_t size, bool is_promotion);
+  // Allocate a new PLAB buffer from the heap
+  HeapWord* allocate_new_plab(size_t min_size, size_t word_size, size_t* actual_size);
+
+public:
+  ShenandoahPLAB();
+  ~ShenandoahPLAB();
+
+  // Access the underlying PLAB buffer
+  PLAB* plab() const { return _plab; }
+
+  // Heuristic size for next PLAB allocation
+  size_t desired_size() const { return _desired_size; }
+  // Update heuristic size for next PLAB allocation
+  void set_desired_size(size_t v) { _desired_size = v; }
+
+  // Check if retry logic is enabled
+  bool retries_enabled() const { return _retries_enabled; }
+  // Disable retry logic for PLAB allocation failures
+  void disable_retries() { _retries_enabled = false; }
+
+  // Allow this thread to promote objects
+  void enable_promotions() { _allows_promotion = true; }
+  // Prevent this thread from promoting objects
+  void disable_promotions() { _allows_promotion = false; }
+  // Check if this thread is allowed to promote objects
+  bool allows_promotion() const { return _allows_promotion; }
+
+  // Reset promotion tracking for new evacuation phase
+  void reset_promoted() { _promoted = 0; }
+  // When a plab is retired, subtract from the expended promotion budget
+  void subtract_from_promoted(size_t increment);
+  // Bytes promoted through this PLAB
+  size_t get_promoted() const { return _promoted; }
+  // Track promoted bytes in this PLAB
+  void add_to_promoted(size_t increment) { _promoted += increment; }
+
+  // Track failed promotion attempts
+  void record_promotion_failure(size_t size) {
+    _promotion_failure_count++;
+    _promotion_failure_words += size;
+  }
+  // Get failed promotion count for aggregation
+  size_t get_promotion_failure_count() const { return _promotion_failure_count; }
+  // Get failed promotion words for aggregation
+  size_t get_promotion_failure_words() const { return _promotion_failure_words; }
+  // Reset failure tracking for new evacuation phase
+  void reset_promotion_failures() {
+    _promotion_failure_count = 0;
+    _promotion_failure_words = 0;
+  }
+
+  // Record actual allocated PLAB size
+  void set_actual_size(size_t value) { _actual_size = value; }
+  // Actual allocated PLAB size
+  size_t get_actual_size() const { return _actual_size; }
+
+  // Allocate from this PLAB
+  HeapWord* allocate(size_t size, bool is_promotion);
+
+  // Retire this PLAB and return unused promotion budget
+  void retire();
+};
+
+#endif // SHARE_GC_SHENANDOAH_SHENANDOAHPLAB_HPP
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahThreadLocalData.cpp b/src/hotspot/share/gc/shenandoah/shenandoahThreadLocalData.cpp
index ace5ab5e69a..1f3ce76cc1c 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahThreadLocalData.cpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahThreadLocalData.cpp
@@ -37,12 +37,7 @@ ShenandoahThreadLocalData::ShenandoahThreadLocalData() :
   _card_table(nullptr),
   _gclab(nullptr),
   _gclab_size(0),
-  _plab(nullptr),
-  _plab_desired_size(0),
-  _plab_actual_size(0),
-  _plab_promoted(0),
-  _plab_allows_promotion(true),
-  _plab_retries_enabled(true),
+  _shenandoah_plab(nullptr),
   _evacuation_stats(new ShenandoahEvacuationStats()) {
 }
 
@@ -50,9 +45,9 @@ ShenandoahThreadLocalData::~ShenandoahThreadLocalData() {
   if (_gclab != nullptr) {
     delete _gclab;
   }
-  if (_plab != nullptr) {
-    ShenandoahGenerationalHeap::heap()->retire_plab(_plab);
-    delete _plab;
+  if (_shenandoah_plab != nullptr) {
+    _shenandoah_plab->retire();
+    delete _shenandoah_plab;
   }
 
   delete _evacuation_stats;
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahThreadLocalData.hpp b/src/hotspot/share/gc/shenandoah/shenandoahThreadLocalData.hpp
index f54a65b0785..b1b923bbfce 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahThreadLocalData.hpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahThreadLocalData.hpp
@@ -36,6 +36,7 @@
 #include "gc/shenandoah/shenandoahCodeRoots.hpp"
 #include "gc/shenandoah/shenandoahEvacTracker.hpp"
 #include "gc/shenandoah/shenandoahGenerationalHeap.hpp"
+#include "gc/shenandoah/shenandoahPLAB.hpp"
 #include "gc/shenandoah/shenandoahSATBMarkQueueSet.hpp"
 #include "runtime/javaThread.hpp"
 #include "utilities/debug.hpp"
@@ -62,24 +63,7 @@ private:
   // Used both by mutator threads and by GC worker threads
   // for evacuations within the old generation and
   // for promotions from the young generation into the old generation.
-  PLAB* _plab;
-
-  // Heuristics will grow the desired size of plabs.
-  size_t _plab_desired_size;
-
-  // Once the plab has been allocated, and we know the actual size, we record it here.
-  size_t _plab_actual_size;
-
-  // As the plab is used for promotions, this value is incremented. When the plab is
-  // retired, the difference between 'actual_size' and 'promoted' will be returned to
-  // the old generation's promotion reserve (i.e., it will be 'unexpended').
-  size_t _plab_promoted;
-
-  // If false, no more promotion by this thread during this evacuation phase.
-  bool   _plab_allows_promotion;
-
-  // If true, evacuations may attempt to allocate a smaller plab if the original size fails.
-  bool   _plab_retries_enabled;
+  ShenandoahPLAB* _shenandoah_plab;
 
   ShenandoahEvacuationStats* _evacuation_stats;
 
@@ -141,8 +125,7 @@ public:
     data(thread)->_gclab_size = 0;
 
     if (ShenandoahHeap::heap()->mode()->is_generational()) {
-      data(thread)->_plab = new PLAB(align_up(PLAB::min_size(), CardTable::card_size_in_words()));
-      data(thread)->_plab_desired_size = 0;
+      data(thread)->_shenandoah_plab = new ShenandoahPLAB();
     }
   }
 
@@ -170,65 +153,8 @@ public:
     return data(thread)->_evacuation_stats;
   }
 
-  static PLAB* plab(Thread* thread) {
-    return data(thread)->_plab;
-  }
-
-  static size_t plab_size(Thread* thread) {
-    return data(thread)->_plab_desired_size;
-  }
-
-  static void set_plab_size(Thread* thread, size_t v) {
-    data(thread)->_plab_desired_size = v;
-  }
-
-  static void enable_plab_retries(Thread* thread) {
-    data(thread)->_plab_retries_enabled = true;
-  }
-
-  static void disable_plab_retries(Thread* thread) {
-    data(thread)->_plab_retries_enabled = false;
-  }
-
-  static bool plab_retries_enabled(Thread* thread) {
-    return data(thread)->_plab_retries_enabled;
-  }
-
-  static void enable_plab_promotions(Thread* thread) {
-    data(thread)->_plab_allows_promotion = true;
-  }
-
-  static void disable_plab_promotions(Thread* thread) {
-    data(thread)->_plab_allows_promotion = false;
-  }
-
-  static bool allow_plab_promotions(Thread* thread) {
-    return data(thread)->_plab_allows_promotion;
-  }
-
-  static void reset_plab_promoted(Thread* thread) {
-    data(thread)->_plab_promoted = 0;
-  }
-
-  static void add_to_plab_promoted(Thread* thread, size_t increment) {
-    data(thread)->_plab_promoted += increment;
-  }
-
-  static void subtract_from_plab_promoted(Thread* thread, size_t increment) {
-    assert(data(thread)->_plab_promoted >= increment, "Cannot subtract more than remaining promoted");
-    data(thread)->_plab_promoted -= increment;
-  }
-
-  static size_t get_plab_promoted(Thread* thread) {
-    return data(thread)->_plab_promoted;
-  }
-
-  static void set_plab_actual_size(Thread* thread, size_t value) {
-    data(thread)->_plab_actual_size = value;
-  }
-
-  static size_t get_plab_actual_size(Thread* thread) {
-    return data(thread)->_plab_actual_size;
+  static ShenandoahPLAB* shenandoah_plab(Thread* thread) {
+    return data(thread)->_shenandoah_plab;
   }
 
   // Evacuation OOM handling
diff --git a/test/hotspot/gtest/gc/shenandoah/test_shenandoahOldGeneration.cpp b/test/hotspot/gtest/gc/shenandoah/test_shenandoahOldGeneration.cpp
index 4167e33b706..4633d8588d3 100644
--- a/test/hotspot/gtest/gc/shenandoah/test_shenandoahOldGeneration.cpp
+++ b/test/hotspot/gtest/gc/shenandoah/test_shenandoahOldGeneration.cpp
@@ -26,6 +26,7 @@
 #include "gc/shenandoah/shenandoahHeap.inline.hpp"
 #include "gc/shenandoah/mode/shenandoahMode.hpp"
 #include "gc/shenandoah/shenandoahOldGeneration.hpp"
+#include "gc/shenandoah/shenandoahPLAB.hpp"
 #include "gc/shenandoah/shenandoahThreadLocalData.hpp"
 
 #define SKIP_IF_NOT_SHENANDOAH() \
@@ -58,10 +59,15 @@ protected:
     old->set_evacuation_reserve(512 * HeapWordSize);
 
     Thread* thread = Thread::current();
-    ShenandoahThreadLocalData::reset_plab_promoted(thread);
-    ShenandoahThreadLocalData::disable_plab_promotions(thread);
-    ShenandoahThreadLocalData::set_plab_actual_size(thread, INITIAL_PLAB_SIZE);
-    ShenandoahThreadLocalData::add_to_plab_promoted(thread, INITIAL_PLAB_PROMOTED);
+    ShenandoahPLAB* shenandoah_plab = ShenandoahThreadLocalData::shenandoah_plab(thread);
+    if (shenandoah_plab == nullptr) {
+      ShenandoahThreadLocalData::initialize_gclab(thread);
+      shenandoah_plab = ShenandoahThreadLocalData::shenandoah_plab(thread);
+    }
+    shenandoah_plab->reset_promoted();
+    shenandoah_plab->disable_promotions();
+    shenandoah_plab->set_actual_size(INITIAL_PLAB_SIZE);
+    shenandoah_plab->add_to_promoted(INITIAL_PLAB_PROMOTED);
   }
 
   void TearDown() override {
@@ -72,15 +78,15 @@ protected:
   }
 
   static bool promotions_enabled() {
-    return ShenandoahThreadLocalData::allow_plab_promotions(Thread::current());
+    return ShenandoahThreadLocalData::shenandoah_plab(Thread::current())->allows_promotion();
   }
 
   static size_t plab_size() {
-    return ShenandoahThreadLocalData::get_plab_actual_size(Thread::current());
+    return ShenandoahThreadLocalData::shenandoah_plab(Thread::current())->get_actual_size();
   }
 
   static size_t plab_promoted() {
-    return ShenandoahThreadLocalData::get_plab_promoted(Thread::current());
+    return ShenandoahThreadLocalData::shenandoah_plab(Thread::current())->get_promoted();
   }
 };
 

From 54c5e41cbaabcd21d7bbf8f5667b2e35cfe12dd7 Mon Sep 17 00:00:00 2001
From: Xu Jiawei <sseu-buhzzi-github@mail.buhzzi.com>
Date: Fri, 20 Mar 2026 16:45:43 +0000
Subject: [PATCH 280/655] 8380085: jpackage (Linux) launcher crashes with
 SIGSEGV when input contains large number of JAR files

Reviewed-by: asemenyuk, almatvee
---
 .../linux/native/applauncher/LinuxLauncher.c  | 66 +++++++++++++++----
 1 file changed, 54 insertions(+), 12 deletions(-)

diff --git a/src/jdk.jpackage/linux/native/applauncher/LinuxLauncher.c b/src/jdk.jpackage/linux/native/applauncher/LinuxLauncher.c
index 7fb8d9f53e9..7db42bc2dbd 100644
--- a/src/jdk.jpackage/linux/native/applauncher/LinuxLauncher.c
+++ b/src/jdk.jpackage/linux/native/applauncher/LinuxLauncher.c
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2021, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -133,6 +133,43 @@ cleanup:
 }
 
 
+static ssize_t readFully(const int fd, void* buf, const size_t len) {
+    size_t nRead = 0;
+    ssize_t n;
+
+    while (nRead < len) {
+        n = read(fd, (char*)buf + nRead, len - nRead);
+        if (n == -1) {
+            if (errno == EINTR) {
+                continue;
+            }
+            return -1;
+        }
+        if (n == 0) {
+            break;
+        }
+        nRead += (size_t)n;
+    }
+    return (ssize_t)nRead;
+}
+
+static ssize_t writeFully(const int fd, const void* buf, const size_t len) {
+    size_t nWritten = 0;
+    ssize_t n;
+
+    while (nWritten < len) {
+        n = write(fd, (const char*)buf + nWritten, len - nWritten);
+        if (n == -1) {
+            if (errno == EINTR) {
+                continue;
+            }
+            return -1;
+        }
+        nWritten += (size_t)n;
+    }
+    return (ssize_t)nWritten;
+}
+
 static void closePipeEnd(int* pipefd, int idx) {
     if (pipefd[idx] >= 0) {
         close(pipefd[idx]);
@@ -190,21 +227,24 @@ int main(int argc, char *argv[]) {
         jvmLauncherData = initJvmlLauncherData(&jvmLauncherDataBufferSize);
         if (jvmLauncherData) {
             /* Buffer size */
-            if (write(pipefd[1], &jvmLauncherDataBufferSize,
-                                    sizeof(jvmLauncherDataBufferSize)) == -1) {
+            if (writeFully(pipefd[1], &jvmLauncherDataBufferSize,
+                      sizeof(jvmLauncherDataBufferSize)) !=
+                sizeof(jvmLauncherDataBufferSize)) {
                 JP_LOG_ERRNO;
                 goto cleanup;
             }
             if (jvmLauncherDataBufferSize) {
                 /* Buffer address */
-                if (write(pipefd[1], &jvmLauncherData,
-                                            sizeof(jvmLauncherData)) == -1) {
+                if (writeFully(pipefd[1], &jvmLauncherData,
+                          sizeof(jvmLauncherData)) !=
+                    sizeof(jvmLauncherData)) {
                     JP_LOG_ERRNO;
                     goto cleanup;
                 }
                 /* Buffer data */
-                if (write(pipefd[1], jvmLauncherData,
-                                            jvmLauncherDataBufferSize) == -1) {
+                if (writeFully(pipefd[1], jvmLauncherData,
+                                jvmLauncherDataBufferSize) !=
+                    jvmLauncherDataBufferSize) {
                     JP_LOG_ERRNO;
                     goto cleanup;
                 }
@@ -218,8 +258,9 @@ int main(int argc, char *argv[]) {
         /* Close unused write end */
         closePipeEnd(pipefd, 1);
 
-        if (read(pipefd[0], &jvmLauncherDataBufferSize,
-                                sizeof(jvmLauncherDataBufferSize)) == -1) {
+        if (readFully(pipefd[0], &jvmLauncherDataBufferSize,
+                 sizeof(jvmLauncherDataBufferSize)) !=
+            sizeof(jvmLauncherDataBufferSize)) {
             JP_LOG_ERRNO;
             goto cleanup;
         }
@@ -229,7 +270,8 @@ int main(int argc, char *argv[]) {
             goto cleanup;
         }
 
-        if (read(pipefd[0], &baseAddress, sizeof(baseAddress)) == -1) {
+        if (readFully(pipefd[0], &baseAddress, sizeof(baseAddress)) !=
+            sizeof(baseAddress)) {
             JP_LOG_ERRNO;
             goto cleanup;
         }
@@ -240,8 +282,8 @@ int main(int argc, char *argv[]) {
             goto cleanup;
         }
 
-        if (read(pipefd[0], jvmLauncherData,
-                                        jvmLauncherDataBufferSize) == -1) {
+        if (readFully(pipefd[0], jvmLauncherData, jvmLauncherDataBufferSize) !=
+            jvmLauncherDataBufferSize) {
             JP_LOG_ERRNO;
             goto cleanup;
         }

From d0841c6bde28183ab39feb8242982bcefed3f1f9 Mon Sep 17 00:00:00 2001
From: William Kemper <wkemper@openjdk.org>
Date: Fri, 20 Mar 2026 16:46:12 +0000
Subject: [PATCH 281/655] 8379688: GenShen: Skip promotions when marking finds
 enough immediate garbage

Reviewed-by: kdnilsen
---
 .../shenandoahGenerationalHeuristics.cpp      |  59 ++--
 .../shenandoahGenerationalHeuristics.hpp      |   2 +-
 .../heuristics/shenandoahGlobalHeuristics.cpp | 293 ++++++++--------
 .../heuristics/shenandoahGlobalHeuristics.hpp | 135 ++++++-
 .../heuristics/shenandoahOldHeuristics.cpp    |  18 +-
 .../heuristics/shenandoahOldHeuristics.hpp    |   5 +-
 .../heuristics/shenandoahYoungHeuristics.cpp  |   7 +-
 .../shenandoah/shenandoahInPlacePromoter.cpp  |  15 +-
 .../shenandoah/shenandoahInPlacePromoter.hpp  |   1 +
 .../test_shenandoahGlobalHeuristic.cpp        | 332 ++++++++++++++++++
 10 files changed, 661 insertions(+), 206 deletions(-)
 create mode 100644 test/hotspot/gtest/gc/shenandoah/test_shenandoahGlobalHeuristic.cpp

diff --git a/src/hotspot/share/gc/shenandoah/heuristics/shenandoahGenerationalHeuristics.cpp b/src/hotspot/share/gc/shenandoah/heuristics/shenandoahGenerationalHeuristics.cpp
index bcf4197f86d..08d628e67ff 100644
--- a/src/hotspot/share/gc/shenandoah/heuristics/shenandoahGenerationalHeuristics.cpp
+++ b/src/hotspot/share/gc/shenandoah/heuristics/shenandoahGenerationalHeuristics.cpp
@@ -80,19 +80,11 @@ void ShenandoahGenerationalHeuristics::choose_collection_set(ShenandoahCollectio
   assert(collection_set->is_empty(), "Collection set must be empty here");
 
   _add_regions_to_old = 0;
-  ShenandoahInPlacePromotionPlanner in_place_promotions(heap);
 
-  // Find the amount that will be promoted, regions that will be promoted in
-  // place, and preselected older regions that will be promoted by evacuation.
-  compute_evacuation_budgets(in_place_promotions, heap);
+  // Choose the collection set
+  filter_regions(collection_set);
 
-  // Choose the collection set, including the regions preselected above for promotion into the old generation.
-  filter_regions(in_place_promotions, collection_set);
-
-  // Even if collection_set->is_empty(), we want to adjust budgets, making reserves available to mutator.
-  adjust_evacuation_budgets(heap, collection_set);
-
-  if (_generation->is_global()) {
+  if (!collection_set->is_empty() && _generation->is_global()) {
     // We have just chosen a collection set for a global cycle. The mark bitmap covering old regions is complete, so
     // the remembered set scan can use that to avoid walking into garbage. When the next old mark begins, we will
     // use the mark bitmap to make the old regions parsable by coalescing and filling any unmarked objects. Thus,
@@ -229,8 +221,7 @@ void ShenandoahGenerationalHeuristics::compute_evacuation_budgets(ShenandoahInPl
   // case of a GLOBAL gc.  During choose_collection_set() of GLOBAL, old will be expanded on demand.
 }
 
-void ShenandoahGenerationalHeuristics::filter_regions(ShenandoahInPlacePromotionPlanner& in_place_promotions,
-                                                      ShenandoahCollectionSet* collection_set) {
+void ShenandoahGenerationalHeuristics::filter_regions(ShenandoahCollectionSet* collection_set) {
   auto heap = ShenandoahGenerationalHeap::heap();
   const size_t region_size_bytes = ShenandoahHeapRegion::region_size_bytes();
 
@@ -270,21 +261,12 @@ void ShenandoahGenerationalHeuristics::filter_regions(ShenandoahInPlacePromotion
         immediate_garbage += garbage;
         region->make_trash_immediate();
       } else {
-        if (collection_set->is_in(i)) {
-          assert(heap->is_tenurable(region), "Preselected region %zu must be tenurable", i);
-        } else if (region->is_young() && heap->is_tenurable(region)) {
-          // Note that for GLOBAL GC, region may be OLD, and OLD regions do not qualify for pre-selection
-
-          // This region is old enough to be promoted, but it was not preselected, either because its garbage is below
-          // old garbage threshold so it will be promoted in place, or because there is insufficient room
-          // in old gen to hold the evacuated copies of this region's live data.  In either case, we choose not to
-          // place this region into the collection set.
-        } else {
-          // This is our candidate for later consideration.
-          assert(region->get_top_before_promote() == nullptr, "Cannot add region %zu scheduled for in-place-promotion to the collection set", i);
-          candidates[cand_idx].set_region_and_garbage(region, garbage);
-          cand_idx++;
-        }
+        // This is our candidate for later consideration. Note that this region
+        // could still be promoted in place and may not necessarily end up in the
+        // collection set.
+        assert(region->get_top_before_promote() == nullptr, "Cannot add region %zu scheduled for in-place-promotion to the collection set", i);
+        candidates[cand_idx].set_region_and_garbage(region, garbage);
+        cand_idx++;
       }
     } else if (region->is_humongous_start()) {
       // Reclaim humongous regions here, and count them as the immediate garbage
@@ -310,18 +292,25 @@ void ShenandoahGenerationalHeuristics::filter_regions(ShenandoahInPlacePromotion
          PROPERFMTARGS(immediate_garbage), PROPERFMTARGS(total_garbage));
 
   const size_t immediate_percent = (total_garbage == 0) ? 0 : (immediate_garbage * 100 / total_garbage);
-  const bool has_preselected_regions = !collection_set->is_empty();
-  if (has_preselected_regions || (immediate_percent <= ShenandoahImmediateThreshold)) {
+  ShenandoahInPlacePromotionPlanner in_place_promotions(heap);
+  if (immediate_percent <= ShenandoahImmediateThreshold) {
+
+    // Find the amount that will be promoted, regions that will be promoted in
+    // place, and preselected older regions that will be promoted by evacuation.
+    compute_evacuation_budgets(in_place_promotions, heap);
+
     // Call the subclasses to add young-gen regions into the collection set.
     choose_collection_set_from_regiondata(collection_set, candidates, cand_idx, immediate_garbage + free);
-  }
 
-  if (collection_set->has_old_regions()) {
-    heap->shenandoah_policy()->record_mixed_cycle();
+    // Even if collection_set->is_empty(), we want to adjust budgets, making reserves available to mutator.
+    adjust_evacuation_budgets(heap, collection_set);
+
+    if (collection_set->has_old_regions()) {
+      heap->shenandoah_policy()->record_mixed_cycle();
+    }
   }
 
   collection_set->summarize(total_garbage, immediate_garbage, immediate_regions);
-
   ShenandoahTracer::report_evacuation_info(collection_set,
                                            free_regions,
                                            in_place_promotions.humongous_region_stats().count,
@@ -375,7 +364,7 @@ size_t ShenandoahGenerationalHeuristics::select_aged_regions(ShenandoahInPlacePr
     }
 
     if (!r->is_regular()) {
-      if (r->is_humongous() && heap->is_tenurable(r)) {
+      if (r->is_humongous_start() && heap->is_tenurable(r)) {
         in_place_promotions.prepare(r);
       }
       // Nothing else to be done for humongous regions
diff --git a/src/hotspot/share/gc/shenandoah/heuristics/shenandoahGenerationalHeuristics.hpp b/src/hotspot/share/gc/shenandoah/heuristics/shenandoahGenerationalHeuristics.hpp
index 248d0de5a26..c418e8c24ec 100644
--- a/src/hotspot/share/gc/shenandoah/heuristics/shenandoahGenerationalHeuristics.hpp
+++ b/src/hotspot/share/gc/shenandoah/heuristics/shenandoahGenerationalHeuristics.hpp
@@ -74,7 +74,7 @@ private:
   size_t select_aged_regions(ShenandoahInPlacePromotionPlanner& in_place_promotions, const size_t old_promotion_reserve);
 
   // Filter and sort remaining regions before adding to collection set.
-  void filter_regions(ShenandoahInPlacePromotionPlanner& in_place_promotions, ShenandoahCollectionSet* collection_set);
+  void filter_regions(ShenandoahCollectionSet* collection_set);
 
   // Adjust evacuation budgets after choosing collection set.  The argument regions_to_xfer
   // represents regions to be transferred to old based on decisions made in top_off_collection_set()
diff --git a/src/hotspot/share/gc/shenandoah/heuristics/shenandoahGlobalHeuristics.cpp b/src/hotspot/share/gc/shenandoah/heuristics/shenandoahGlobalHeuristics.cpp
index 142a6c3f047..ed25cd2e1a9 100644
--- a/src/hotspot/share/gc/shenandoah/heuristics/shenandoahGlobalHeuristics.cpp
+++ b/src/hotspot/share/gc/shenandoah/heuristics/shenandoahGlobalHeuristics.cpp
@@ -31,21 +31,94 @@
 #include "gc/shenandoah/shenandoahHeapRegion.inline.hpp"
 #include "utilities/quickSort.hpp"
 
+bool ShenandoahEvacuationBudget::try_reserve(size_t bytes) {
+  size_t new_consumption = _consumed + bytes;
+  if (new_consumption <= _reserve) {
+    return true;
+  }
+  // Try expanding from shared pool
+  size_t new_reserve = _reserve;
+  size_t new_committed = _shared->committed;
+  while ((new_consumption > new_reserve) && (new_committed < _shared->limit)) {
+    new_committed += _region_size_bytes;
+    new_reserve += _region_size_bytes;
+  }
+  if (new_consumption <= new_reserve) {
+    _reserve = new_reserve;
+    _shared->committed = new_committed;
+    return true;
+  }
+  return false;
+}
+
+void ShenandoahEvacuationBudget::commit(size_t consumption, size_t live) {
+  _consumed += consumption;
+  _live_bytes += live;
+  _region_count++;
+}
+
+ShenandoahGlobalRegionDisposition ShenandoahGlobalCSetBudget::try_add_region(
+    const ShenandoahGlobalRegionAttributes& region) {
+
+  size_t region_garbage = region.garbage;
+  size_t new_garbage = _cur_garbage + region_garbage;
+  bool add_regardless = (region_garbage > _ignore_threshold) && (new_garbage < _min_garbage);
+
+  if (!add_regardless && (region_garbage < _garbage_threshold)) {
+    return ShenandoahGlobalRegionDisposition::SKIP;
+  }
+
+  size_t live_bytes = region.live_data_bytes;
+
+  if (region.is_old) {
+    size_t evac_need = old_evac.anticipated_consumption(live_bytes);
+    size_t promo_loss = region.free_bytes;
+
+    // Snapshot state for rollback — old branch does two reservations
+    size_t saved_committed = _shared.committed;
+    size_t saved_old_reserve = old_evac.reserve();
+    size_t saved_promo_reserve = promo.reserve();
+
+    if (old_evac.try_reserve(evac_need) && promo.try_reserve(promo_loss)) {
+      old_evac.commit(evac_need, live_bytes);
+      promo.commit_raw(promo_loss);
+      _cur_garbage = new_garbage;
+      return ShenandoahGlobalRegionDisposition::ADD_OLD_EVAC;
+    }
+    _shared.committed = saved_committed;
+    old_evac.set_reserve(saved_old_reserve);
+    promo.set_reserve(saved_promo_reserve);
+    return ShenandoahGlobalRegionDisposition::SKIP;
+  } else if (region.is_tenurable) {
+    size_t promo_need = promo.anticipated_consumption(live_bytes);
+    if (promo.try_reserve(promo_need)) {
+      promo.commit(promo_need, live_bytes);
+      _cur_garbage = new_garbage;
+      return ShenandoahGlobalRegionDisposition::ADD_PROMO;
+    }
+    return ShenandoahGlobalRegionDisposition::SKIP;
+  } else {
+    size_t evac_need = young_evac.anticipated_consumption(live_bytes);
+    if (young_evac.try_reserve(evac_need)) {
+      young_evac.commit(evac_need, live_bytes);
+      _cur_garbage = new_garbage;
+      return ShenandoahGlobalRegionDisposition::ADD_YOUNG_EVAC;
+    }
+    return ShenandoahGlobalRegionDisposition::SKIP;
+  }
+}
+
 ShenandoahGlobalHeuristics::ShenandoahGlobalHeuristics(ShenandoahGlobalGeneration* generation)
         : ShenandoahGenerationalHeuristics(generation) {
 }
 
-
 void ShenandoahGlobalHeuristics::choose_collection_set_from_regiondata(ShenandoahCollectionSet* cset,
                                                                        RegionData* data, size_t size,
                                                                        size_t actual_free) {
-  // Better select garbage-first regions
   QuickSort::sort<RegionData>(data, size, compare_by_garbage);
-
-  choose_global_collection_set(cset, data, size, actual_free, 0 /* cur_young_garbage */);
+  choose_global_collection_set(cset, data, size, actual_free, 0);
 }
 
-
 void ShenandoahGlobalHeuristics::choose_global_collection_set(ShenandoahCollectionSet* cset,
                                                               const ShenandoahHeuristics::RegionData* data,
                                                               size_t size, size_t actual_free,
@@ -80,8 +153,7 @@ void ShenandoahGlobalHeuristics::choose_global_collection_set(ShenandoahCollecti
   if (young_evac_reserve > unaffiliated_young_memory) {
     shared_reserve_regions += unaffiliated_young_regions;
   } else {
-    size_t delta_regions = young_evac_reserve / region_size_bytes;
-    shared_reserve_regions += delta_regions;
+    shared_reserve_regions += young_evac_reserve / region_size_bytes;
   }
   young_evac_reserve = 0;
   size_t total_old_reserve = old_evac_reserve + old_promo_reserve;
@@ -90,24 +162,15 @@ void ShenandoahGlobalHeuristics::choose_global_collection_set(ShenandoahCollecti
     shared_reserve_regions += unaffiliated_old_regions;
     old_promo_reserve = total_old_reserve - unaffiliated_old_memory;
   } else {
-    size_t delta_regions = old_evac_reserve / region_size_bytes;
-    shared_reserve_regions += delta_regions;
+    shared_reserve_regions += old_evac_reserve / region_size_bytes;
   }
   old_evac_reserve = 0;
   assert(shared_reserve_regions <=
          (heap->young_generation()->free_unaffiliated_regions() + heap->old_generation()->free_unaffiliated_regions()),
-         "simple math");
-
-  size_t shared_reserves = shared_reserve_regions * region_size_bytes;
-  size_t committed_from_shared_reserves = 0;
-
-  size_t promo_bytes = 0;
-  size_t old_evac_bytes = 0;
-  size_t young_evac_bytes = 0;
-
-  size_t consumed_by_promo = 0;        // promo_bytes * ShenandoahPromoEvacWaste
-  size_t consumed_by_old_evac = 0;     // old_evac_bytes * ShenandoahOldEvacWaste
-  size_t consumed_by_young_evac = 0;   // young_evac_bytes * ShenandoahEvacWaste
+         "Shared reserve regions (%zu) should not exceed total unaffiliated regions (young: %zu, old: %zu)",
+         shared_reserve_regions,
+         heap->young_generation()->free_unaffiliated_regions(),
+         heap->old_generation()->free_unaffiliated_regions());
 
   // Of the memory reclaimed by GC, some of this will need to be reserved for the next GC collection.  Use the current
   // young reserve as an approximation of the future Collector reserve requirement.  Try to end with at least
@@ -115,147 +178,93 @@ void ShenandoahGlobalHeuristics::choose_global_collection_set(ShenandoahCollecti
   size_t free_target = (capacity * ShenandoahMinFreeThreshold) / 100 + original_young_evac_reserve;
   size_t min_garbage = (free_target > actual_free) ? (free_target - actual_free) : 0;
 
-  size_t aged_regions_promoted = 0;
-  size_t young_regions_evacuated = 0;
-  size_t old_regions_evacuated = 0;
+  ShenandoahGlobalCSetBudget budget(region_size_bytes,
+                                    shared_reserve_regions * region_size_bytes,
+                                    garbage_threshold, ignore_threshold, min_garbage,
+                                    young_evac_reserve, ShenandoahEvacWaste,
+                                    old_evac_reserve, ShenandoahOldEvacWaste,
+                                    old_promo_reserve, ShenandoahPromoEvacWaste);
+  budget.set_cur_garbage(cur_young_garbage);
 
-  log_info(gc, ergo)("Adaptive CSet Selection for GLOBAL. Discretionary evacuation budget (for either old or young): %zu%s"
-                     ", Actual Free: %zu%s.",
-                      byte_size_in_proper_unit(shared_reserves), proper_unit_for_byte_size(shared_reserves),
-                      byte_size_in_proper_unit(actual_free), proper_unit_for_byte_size(actual_free));
+  log_info(gc, ergo)("Adaptive CSet Selection for global cycle. Discretionary evacuation budget (for either old or young): " PROPERFMT ", Actual Free: " PROPERFMT,
+                     PROPERFMTARGS(budget.shared_reserves()), PROPERFMTARGS(actual_free));
 
-  size_t cur_garbage = cur_young_garbage;
   for (size_t idx = 0; idx < size; idx++) {
     ShenandoahHeapRegion* r = data[idx].get_region();
-    assert(!cset->is_in(r->index()), "Region (%zu) should not be in the collection set", r->index());
-    bool add_region = false;
-    size_t region_garbage = r->garbage();
-    size_t new_garbage = cur_garbage + region_garbage;
-    bool add_regardless = (region_garbage > ignore_threshold) && (new_garbage < min_garbage);
-    size_t live_bytes = r->get_live_data_bytes();
-    if (add_regardless || (region_garbage >= garbage_threshold)) {
-      if (r->is_old()) {
-        size_t anticipated_consumption = (size_t) (live_bytes * ShenandoahOldEvacWaste);
-        size_t new_old_consumption = consumed_by_old_evac + anticipated_consumption;
-        size_t new_old_evac_reserve = old_evac_reserve;
-        size_t proposed_old_region_expansion = 0;
-        while ((new_old_consumption > new_old_evac_reserve) && (committed_from_shared_reserves < shared_reserves)) {
-          committed_from_shared_reserves += region_size_bytes;
-          proposed_old_region_expansion++;
-          new_old_evac_reserve += region_size_bytes;
-        }
-        // If this region has free memory and we choose to place it in the collection set, its free memory is no longer
-        // available to hold promotion results.  So we behave as if its free memory is consumed within the promotion reserve.
-        size_t anticipated_loss_from_promo_reserve = r->free();
-        size_t new_promo_consumption = consumed_by_promo + anticipated_loss_from_promo_reserve;
-        size_t new_promo_reserve = old_promo_reserve;
-        while ((new_promo_consumption > new_promo_reserve) && (committed_from_shared_reserves < shared_reserves)) {
-          committed_from_shared_reserves += region_size_bytes;
-          proposed_old_region_expansion++;
-          new_promo_reserve += region_size_bytes;
-        }
-        if ((new_old_consumption <= new_old_evac_reserve) && (new_promo_consumption <= new_promo_reserve)) {
-          add_region = true;
-          old_evac_reserve = new_old_evac_reserve;
-          old_promo_reserve = new_promo_reserve;
-          old_evac_bytes += live_bytes;
-          consumed_by_old_evac = new_old_consumption;
-          consumed_by_promo = new_promo_consumption;
-          cur_garbage = new_garbage;
-          old_regions_evacuated++;
-        } else {
-          // We failed to sufficiently expand old so unwind proposed expansion
-          committed_from_shared_reserves -= proposed_old_region_expansion * region_size_bytes;
-        }
-      } else if (heap->is_tenurable(r)) {
-        size_t anticipated_consumption = (size_t) (live_bytes * ShenandoahPromoEvacWaste);
-        size_t new_promo_consumption = consumed_by_promo + anticipated_consumption;
-        size_t new_promo_reserve = old_promo_reserve;
-        size_t proposed_old_region_expansion = 0;
-        while ((new_promo_consumption > new_promo_reserve) && (committed_from_shared_reserves < shared_reserves)) {
-          committed_from_shared_reserves += region_size_bytes;
-          proposed_old_region_expansion++;
-          new_promo_reserve += region_size_bytes;
-        }
-        if (new_promo_consumption <= new_promo_reserve) {
-          add_region = true;
-          old_promo_reserve = new_promo_reserve;
-          promo_bytes += live_bytes;
-          consumed_by_promo = new_promo_consumption;
-          cur_garbage = new_garbage;
-          aged_regions_promoted++;
-        } else {
-          // We failed to sufficiently expand old so unwind proposed expansion
-          committed_from_shared_reserves -= proposed_old_region_expansion * region_size_bytes;
-        }
-      } else {
-        assert(r->is_young() && !heap->is_tenurable(r), "DeMorgan's law (assuming r->is_affiliated)");
-        size_t anticipated_consumption = (size_t) (live_bytes * ShenandoahEvacWaste);
-        size_t new_young_evac_consumption = consumed_by_young_evac + anticipated_consumption;
-        size_t new_young_evac_reserve = young_evac_reserve;
-        size_t proposed_young_region_expansion = 0;
-        while ((new_young_evac_consumption > new_young_evac_reserve) && (committed_from_shared_reserves < shared_reserves)) {
-          committed_from_shared_reserves += region_size_bytes;
-          proposed_young_region_expansion++;
-          new_young_evac_reserve += region_size_bytes;
-        }
-        if (new_young_evac_consumption <= new_young_evac_reserve) {
-          add_region = true;
-          young_evac_reserve = new_young_evac_reserve;
-          young_evac_bytes += live_bytes;
-          consumed_by_young_evac = new_young_evac_consumption;
-          cur_garbage = new_garbage;
-          young_regions_evacuated++;
-        } else {
-          // We failed to sufficiently expand old so unwind proposed expansion
-          committed_from_shared_reserves -= proposed_young_region_expansion * region_size_bytes;
-        }
-      }
+    if (cset->is_in(r) || r->get_top_before_promote() != nullptr) {
+      assert(heap->is_tenurable(r), "Region %zu already selected for promotion must be tenurable", idx);
+      continue;
     }
-    if (add_region) {
+
+    ShenandoahGlobalRegionAttributes attrs;
+    attrs.garbage = r->garbage();
+    attrs.live_data_bytes = r->get_live_data_bytes();
+    attrs.free_bytes = r->free();
+    attrs.is_old = r->is_old();
+    attrs.is_tenurable = !r->is_old() && heap->is_tenurable(r);
+
+    if (budget.try_add_region(attrs) != ShenandoahGlobalRegionDisposition::SKIP) {
       cset->add_region(r);
     }
   }
 
-  if (committed_from_shared_reserves < shared_reserves) {
-    // Give all the rest to promotion
-    old_promo_reserve += (shared_reserves - committed_from_shared_reserves);
-    // dead code: committed_from_shared_reserves = shared_reserves;
-  }
+  budget.finish();
 
-  // Consider the effects of round-off:
-  //  1. We know that the sum over each evacuation mutiplied by Evacuation Waste is <= total evacuation reserve
-  //  2. However, the reserve for each individual evacuation may be rounded down.  In the worst case, we will be over budget
-  //     by the number of regions evacuated, since each region's reserve might be under-estimated by at most 1
-  //  3. Likewise, if we take the sum of bytes evacuated and multiply this by the Evacuation Waste and then round down
-  //     to nearest integer, the calculated reserve will underestimate the true reserve needs by at most 1.
-  //  4. This explains the adjustments to subtotals in the assert statements below.
-  assert(young_evac_bytes * ShenandoahEvacWaste <= young_evac_reserve + young_regions_evacuated,
-         "budget: %zu <= %zu", (size_t) (young_evac_bytes * ShenandoahEvacWaste), young_evac_reserve);
-  assert(old_evac_bytes * ShenandoahOldEvacWaste <= old_evac_reserve + old_regions_evacuated,
-         "budget: %zu <= %zu", (size_t) (old_evac_bytes * ShenandoahOldEvacWaste), old_evac_reserve);
-  assert(promo_bytes * ShenandoahPromoEvacWaste <= old_promo_reserve + aged_regions_promoted,
-         "budget: %zu <= %zu", (size_t) (promo_bytes * ShenandoahPromoEvacWaste), old_promo_reserve);
-  assert(young_evac_reserve + old_evac_reserve + old_promo_reserve <=
-         heap->young_generation()->get_evacuation_reserve() + heap->old_generation()->get_evacuation_reserve() +
-         heap->old_generation()->get_promoted_reserve(), "Exceeded budget");
+  DEBUG_ONLY(budget.assert_budget_constraints_hold(
+      heap->young_generation()->get_evacuation_reserve() +
+      heap->old_generation()->get_evacuation_reserve() +
+      heap->old_generation()->get_promoted_reserve()));
 
-  if (heap->young_generation()->get_evacuation_reserve() < young_evac_reserve) {
-    size_t delta_bytes = young_evac_reserve - heap->young_generation()->get_evacuation_reserve();
+  if (heap->young_generation()->get_evacuation_reserve() < budget.young_evac.reserve()) {
+    size_t delta_bytes = budget.young_evac.reserve() - heap->young_generation()->get_evacuation_reserve();
     size_t delta_regions = delta_bytes / region_size_bytes;
     size_t regions_to_transfer = MIN2(unaffiliated_old_regions, delta_regions);
     log_info(gc)("Global GC moves %zu unaffiliated regions from old collector to young collector reserves", regions_to_transfer);
     ssize_t negated_regions = -regions_to_transfer;
     heap->free_set()->move_unaffiliated_regions_from_collector_to_old_collector(negated_regions);
-  } else if (heap->young_generation()->get_evacuation_reserve() > young_evac_reserve) {
-    size_t delta_bytes = heap->young_generation()->get_evacuation_reserve() - young_evac_reserve;
+  } else if (heap->young_generation()->get_evacuation_reserve() > budget.young_evac.reserve()) {
+    size_t delta_bytes = heap->young_generation()->get_evacuation_reserve() - budget.young_evac.reserve();
     size_t delta_regions = delta_bytes / region_size_bytes;
     size_t regions_to_transfer = MIN2(unaffiliated_young_regions, delta_regions);
     log_info(gc)("Global GC moves %zu unaffiliated regions from young collector to old collector reserves", regions_to_transfer);
     heap->free_set()->move_unaffiliated_regions_from_collector_to_old_collector(regions_to_transfer);
   }
 
-  heap->young_generation()->set_evacuation_reserve(young_evac_reserve);
-  heap->old_generation()->set_evacuation_reserve(old_evac_reserve);
-  heap->old_generation()->set_promoted_reserve(old_promo_reserve);
+  heap->young_generation()->set_evacuation_reserve(budget.young_evac.reserve());
+  heap->old_generation()->set_evacuation_reserve(budget.old_evac.reserve());
+  heap->old_generation()->set_promoted_reserve(budget.promo.reserve());
 }
+
+#ifdef ASSERT
+void ShenandoahGlobalCSetBudget::assert_budget_constraints_hold(size_t original_total_reserves) const {
+  // Consider the effects of round-off:
+  //  1. We know that the sum over each evacuation multiplied by Evacuation Waste is <= total evacuation reserve
+  //  2. However, the reserve for each individual evacuation may be rounded down. In the worst case, we will be
+  //     over budget by the number of regions evacuated, since each region's reserve might be under-estimated by
+  //     at most 1.
+  //  3. Likewise, if we take the sum of bytes evacuated and multiply this by the Evacuation Waste and then round
+  //     down to nearest integer, the calculated reserve will underestimate the true reserve needs by at most 1.
+  //  4. This explains the adjustments to subtotals in the assert statements below.
+  assert(young_evac.live_bytes() * young_evac.waste_factor() <=
+         young_evac.reserve() + young_evac.region_count(),
+         "Young evac consumption (%zu) exceeds reserve (%zu) + region count (%zu)",
+         (size_t)(young_evac.live_bytes() * young_evac.waste_factor()),
+         young_evac.reserve(), young_evac.region_count());
+  assert(old_evac.live_bytes() * old_evac.waste_factor() <=
+         old_evac.reserve() + old_evac.region_count(),
+         "Old evac consumption (%zu) exceeds reserve (%zu) + region count (%zu)",
+         (size_t)(old_evac.live_bytes() * old_evac.waste_factor()),
+         old_evac.reserve(), old_evac.region_count());
+  assert(promo.live_bytes() * promo.waste_factor() <=
+         promo.reserve() + promo.region_count(),
+         "Promo consumption (%zu) exceeds reserve (%zu) + region count (%zu)",
+         (size_t)(promo.live_bytes() * promo.waste_factor()),
+         promo.reserve(), promo.region_count());
+
+  size_t total_post_reserves = young_evac.reserve() + old_evac.reserve() + promo.reserve();
+  assert(total_post_reserves <= original_total_reserves,
+         "Total post-cset reserves (%zu + %zu + %zu = %zu) exceed original reserves (%zu)",
+         young_evac.reserve(), old_evac.reserve(), promo.reserve(),
+         total_post_reserves, original_total_reserves);
+}
+#endif
diff --git a/src/hotspot/share/gc/shenandoah/heuristics/shenandoahGlobalHeuristics.hpp b/src/hotspot/share/gc/shenandoah/heuristics/shenandoahGlobalHeuristics.hpp
index 1f95f75c521..8102fa24d14 100644
--- a/src/hotspot/share/gc/shenandoah/heuristics/shenandoahGlobalHeuristics.hpp
+++ b/src/hotspot/share/gc/shenandoah/heuristics/shenandoahGlobalHeuristics.hpp
@@ -25,16 +25,138 @@
 #ifndef SHARE_GC_SHENANDOAH_HEURISTICS_SHENANDOAHGLOBALHEURISTICS_HPP
 #define SHARE_GC_SHENANDOAH_HEURISTICS_SHENANDOAHGLOBALHEURISTICS_HPP
 
-
 #include "gc/shenandoah/heuristics/shenandoahGenerationalHeuristics.hpp"
 
 class ShenandoahGlobalGeneration;
 
-/*
- * This is a specialization of the generational heuristics which is aware
- * of old and young regions and respects the configured evacuation parameters
- * for such regions during a global collection of a generational heap.
- */
+enum class ShenandoahGlobalRegionDisposition {
+  SKIP,
+  ADD_OLD_EVAC,
+  ADD_PROMO,
+  ADD_YOUNG_EVAC
+};
+
+// A shared pool of evacuation reserves that can be drawn from by any
+// evacuation category. Owned by ShenandoahGlobalCSetBudget; each
+// ShenandoahEvacuationBudget holds a pointer to it.
+struct ShenandoahSharedEvacReserve {
+  size_t limit;
+  size_t committed;
+
+  ShenandoahSharedEvacReserve(size_t limit) : limit(limit), committed(0) {}
+};
+
+// Tracks the budget for a single evacuation category.
+class ShenandoahEvacuationBudget {
+  size_t _reserve;
+  size_t _consumed;
+  size_t _live_bytes;
+  size_t _region_count;
+  size_t _region_size_bytes;
+  double _waste_factor;
+  ShenandoahSharedEvacReserve* _shared;
+
+public:
+  ShenandoahEvacuationBudget(size_t reserve, double waste_factor,
+                             size_t region_size_bytes,
+                             ShenandoahSharedEvacReserve* shared)
+    : _reserve(reserve), _consumed(0), _live_bytes(0),
+      _region_count(0), _region_size_bytes(region_size_bytes),
+      _waste_factor(waste_factor), _shared(shared) {}
+
+  size_t anticipated_consumption(size_t live_bytes) const {
+    return (size_t)(live_bytes * _waste_factor);
+  }
+
+  // Try to reserve 'bytes' from this budget, expanding from the shared
+  // pool if necessary. On success, updates _reserve and shared->committed
+  // and returns true. On failure, nothing is modified.
+  bool try_reserve(size_t bytes);
+
+  // Record that a region was accepted.
+  void commit(size_t consumption, size_t live_bytes);
+
+  // Record a raw consumption (e.g. free bytes lost from promo reserve).
+  void commit_raw(size_t bytes) { _consumed += bytes; }
+
+  size_t reserve()      const { return _reserve; }
+  size_t consumed()     const { return _consumed; }
+  size_t live_bytes()   const { return _live_bytes; }
+  size_t region_count() const { return _region_count; }
+  double waste_factor() const { return _waste_factor; }
+
+  void add_to_reserve(size_t bytes) { _reserve += bytes; }
+  void set_reserve(size_t bytes)    { _reserve = bytes; }
+};
+
+// These are the attributes of a region required to decide if it can be
+// added to the collection set or not.
+struct ShenandoahGlobalRegionAttributes {
+  size_t garbage;
+  size_t live_data_bytes;
+  size_t free_bytes;
+  bool   is_old;
+  bool   is_tenurable;
+};
+
+// This class consolidates all of the data required to build a global
+// collection set. Critically, it takes no dependencies on any classes
+// that themselves depend on ShenandoahHeap. This makes it possible to
+// write extensive unit tests for this complex code.
+class ShenandoahGlobalCSetBudget {
+  size_t _region_size_bytes;
+  size_t _garbage_threshold;
+  size_t _ignore_threshold;
+  size_t _min_garbage;
+  size_t _cur_garbage;
+
+  ShenandoahSharedEvacReserve _shared;
+
+public:
+  ShenandoahEvacuationBudget young_evac;
+  ShenandoahEvacuationBudget old_evac;
+  ShenandoahEvacuationBudget promo;
+
+  ShenandoahGlobalCSetBudget(size_t region_size_bytes,
+                             size_t shared_reserves,
+                             size_t garbage_threshold,
+                             size_t ignore_threshold,
+                             size_t min_garbage,
+                             size_t young_evac_reserve, double young_waste,
+                             size_t old_evac_reserve,   double old_waste,
+                             size_t promo_reserve,      double promo_waste)
+    : _region_size_bytes(region_size_bytes),
+      _garbage_threshold(garbage_threshold),
+      _ignore_threshold(ignore_threshold),
+      _min_garbage(min_garbage),
+      _cur_garbage(0),
+      _shared(shared_reserves),
+      young_evac(young_evac_reserve, young_waste, region_size_bytes, &_shared),
+      old_evac(old_evac_reserve, old_waste, region_size_bytes, &_shared),
+      promo(promo_reserve, promo_waste, region_size_bytes, &_shared) {}
+
+  ShenandoahGlobalRegionDisposition try_add_region(const ShenandoahGlobalRegionAttributes& region);
+
+  // Any remaining shared budget is given to the promotion reserve.
+  void finish() {
+    if (_shared.committed < _shared.limit) {
+      promo.add_to_reserve(_shared.limit - _shared.committed);
+    }
+  }
+
+  // Verify that the budget invariants hold after collection set selection.
+  // original_total_reserves is the sum of the young, old, and promo evacuation
+  // reserves as they were before the budget was constructed.
+  DEBUG_ONLY(void assert_budget_constraints_hold(size_t original_total_reserves) const;)
+
+  size_t region_size_bytes()     const { return _region_size_bytes; }
+  size_t shared_reserves()       const { return _shared.limit; }
+  size_t committed_from_shared() const { return _shared.committed; }
+  size_t cur_garbage()           const { return _cur_garbage; }
+
+  void set_cur_garbage(size_t g) { _cur_garbage = g; }
+};
+
 class ShenandoahGlobalHeuristics : public ShenandoahGenerationalHeuristics {
 public:
   ShenandoahGlobalHeuristics(ShenandoahGlobalGeneration* generation);
@@ -50,5 +172,4 @@ private:
                                     size_t cur_young_garbage) const;
 };
 
-
 #endif // SHARE_GC_SHENANDOAH_HEURISTICS_SHENANDOAHGLOBALHEURISTICS_HPP
diff --git a/src/hotspot/share/gc/shenandoah/heuristics/shenandoahOldHeuristics.cpp b/src/hotspot/share/gc/shenandoah/heuristics/shenandoahOldHeuristics.cpp
index e0cab781674..4f71562f4f6 100644
--- a/src/hotspot/share/gc/shenandoah/heuristics/shenandoahOldHeuristics.cpp
+++ b/src/hotspot/share/gc/shenandoah/heuristics/shenandoahOldHeuristics.cpp
@@ -79,7 +79,6 @@ ShenandoahOldHeuristics::ShenandoahOldHeuristics(ShenandoahOldGeneration* genera
 }
 
 bool ShenandoahOldHeuristics::prime_collection_set(ShenandoahCollectionSet* collection_set) {
-  _mixed_evac_cset = collection_set;
   _included_old_regions = 0;
   _evacuated_old_bytes = 0;
   _collected_old_bytes = 0;
@@ -106,10 +105,6 @@ bool ShenandoahOldHeuristics::prime_collection_set(ShenandoahCollectionSet* coll
 
   _first_pinned_candidate = NOT_FOUND;
 
-  uint included_old_regions = 0;
-  size_t evacuated_old_bytes = 0;
-  size_t collected_old_bytes = 0;
-
   // If a region is put into the collection set, then this region's free (not yet used) bytes are no longer
   // "available" to hold the results of other evacuations.  This may cause a decrease in the remaining amount
   // of memory that can still be evacuated.  We address this by reducing the evacuation budget by the amount
@@ -152,7 +147,7 @@ bool ShenandoahOldHeuristics::prime_collection_set(ShenandoahCollectionSet* coll
   log_debug(gc)("Choose old regions for mixed collection: old evacuation budget: " PROPERFMT ", candidates: %u",
                 PROPERFMTARGS(_old_evacuation_budget),
                 unprocessed_old_collection_candidates());
-  return add_old_regions_to_cset();
+  return add_old_regions_to_cset(collection_set);
 }
 
 bool ShenandoahOldHeuristics::all_candidates_are_pinned() {
@@ -226,7 +221,7 @@ void ShenandoahOldHeuristics::slide_pinned_regions_to_front() {
   _next_old_collection_candidate = write_index + 1;
 }
 
-bool ShenandoahOldHeuristics::add_old_regions_to_cset() {
+bool ShenandoahOldHeuristics::add_old_regions_to_cset(ShenandoahCollectionSet* collection_set) {
   if (unprocessed_old_collection_candidates() == 0) {
     return false;
   }
@@ -310,7 +305,7 @@ bool ShenandoahOldHeuristics::add_old_regions_to_cset() {
         break;
       }
     }
-    _mixed_evac_cset->add_region(r);
+    collection_set->add_region(r);
     _included_old_regions++;
     _evacuated_old_bytes += live_data_for_evacuation;
     _collected_old_bytes += r->garbage();
@@ -356,7 +351,7 @@ bool ShenandoahOldHeuristics::finalize_mixed_evacs() {
   return (_included_old_regions > 0);
 }
 
-bool ShenandoahOldHeuristics::top_off_collection_set(size_t &add_regions_to_old) {
+bool ShenandoahOldHeuristics::top_off_collection_set(ShenandoahCollectionSet* collection_set, size_t &add_regions_to_old) {
   if (unprocessed_old_collection_candidates() == 0) {
     add_regions_to_old = 0;
     return false;
@@ -367,11 +362,10 @@ bool ShenandoahOldHeuristics::top_off_collection_set(size_t &add_regions_to_old)
 
     // We have budgeted to assure the live_bytes_in_tenurable_regions() get evacuated into old generation.  Young reserves
     // only for untenurable region evacuations.
-    size_t planned_young_evac = _mixed_evac_cset->get_live_bytes_in_untenurable_regions();
+    size_t planned_young_evac = collection_set->get_live_bytes_in_untenurable_regions();
     size_t consumed_from_young_cset = (size_t) (planned_young_evac * ShenandoahEvacWaste);
 
     size_t region_size_bytes = ShenandoahHeapRegion::region_size_bytes();
-    size_t regions_required_for_collector_reserve = (consumed_from_young_cset + region_size_bytes - 1) / region_size_bytes;
 
     assert(consumed_from_young_cset <= max_young_cset, "sanity");
     assert(max_young_cset <= young_unaffiliated_regions * region_size_bytes, "sanity");
@@ -399,7 +393,7 @@ bool ShenandoahOldHeuristics::top_off_collection_set(size_t &add_regions_to_old)
       _old_generation->augment_evacuation_reserve(budget_supplement);
       young_generation->set_evacuation_reserve(max_young_cset - budget_supplement);
 
-      return add_old_regions_to_cset();
+      return add_old_regions_to_cset(collection_set);
     } else {
       add_regions_to_old = 0;
       return false;
diff --git a/src/hotspot/share/gc/shenandoah/heuristics/shenandoahOldHeuristics.hpp b/src/hotspot/share/gc/shenandoah/heuristics/shenandoahOldHeuristics.hpp
index e657ac58ae4..04a92d28248 100644
--- a/src/hotspot/share/gc/shenandoah/heuristics/shenandoahOldHeuristics.hpp
+++ b/src/hotspot/share/gc/shenandoah/heuristics/shenandoahOldHeuristics.hpp
@@ -106,7 +106,6 @@ private:
   // when client code invokes prime_collection_set().  They are consulted, and sometimes modified, when client code
   // calls top_off_collection_set() to possibly expand the number of old-gen regions in a mixed evacuation cset, and by
   // finalize_mixed_evacs(), which prepares the way for mixed evacuations to begin.
-  ShenandoahCollectionSet* _mixed_evac_cset;
   size_t _evacuated_old_bytes;
   size_t _collected_old_bytes;
   size_t _included_old_regions;
@@ -163,7 +162,7 @@ private:
   // a conservative old evacuation budget, and the second time with a larger more aggressive old evacuation budget.  Returns
   // true iff we need to finalize mixed evacs.  (If no regions are added to the collection set, there is no need to finalize
   // mixed evacuations.)
-  bool add_old_regions_to_cset();
+  bool add_old_regions_to_cset(ShenandoahCollectionSet* collection_set);
 
 public:
   explicit ShenandoahOldHeuristics(ShenandoahOldGeneration* generation, ShenandoahGenerationalHeap* gen_heap);
@@ -180,7 +179,7 @@ public:
   // evacuation candidate regions into the collection set as will fit within this excess repurposed reserved.
   // Returns true iff we need to finalize mixed evacs.  Upon return, the var parameter regions_to_xfer holds the
   // number of regions to transfer from young to old.
-  bool top_off_collection_set(size_t &add_regions_to_old);
+  bool top_off_collection_set(ShenandoahCollectionSet* collection_set, size_t &add_regions_to_old);
 
   // Having added all eligible mixed-evacuation candidates to the collection set, this function updates the total count
   // of how much old-gen memory remains to be evacuated and adjusts the representation of old-gen regions that remain to
diff --git a/src/hotspot/share/gc/shenandoah/heuristics/shenandoahYoungHeuristics.cpp b/src/hotspot/share/gc/shenandoah/heuristics/shenandoahYoungHeuristics.cpp
index 68935aba5a8..68ffb6592db 100644
--- a/src/hotspot/share/gc/shenandoah/heuristics/shenandoahYoungHeuristics.cpp
+++ b/src/hotspot/share/gc/shenandoah/heuristics/shenandoahYoungHeuristics.cpp
@@ -60,7 +60,7 @@ void ShenandoahYoungHeuristics::choose_collection_set_from_regiondata(Shenandoah
   // enough consolidated garbage to make effective use of young-gen evacuation reserve.  If there is still
   // young-gen reserve available following selection of the young-gen collection set, see if we can use
   // this memory to expand the old-gen evacuation collection set.
-  need_to_finalize_mixed |= heap->old_generation()->heuristics()->top_off_collection_set(_add_regions_to_old);
+  need_to_finalize_mixed |= heap->old_generation()->heuristics()->top_off_collection_set(cset, _add_regions_to_old);
   if (need_to_finalize_mixed) {
     heap->old_generation()->heuristics()->finalize_mixed_evacs();
   }
@@ -90,7 +90,10 @@ void ShenandoahYoungHeuristics::choose_young_collection_set(ShenandoahCollection
 
   for (size_t idx = 0; idx < size; idx++) {
     ShenandoahHeapRegion* r = data[idx].get_region();
-    assert(!cset->is_in(r), "Region %zu should not already be in the collection set", idx);
+    if (cset->is_in(r) || r->get_top_before_promote() != nullptr) {
+      assert(heap->is_tenurable(r), "Region %zu already selected for promotion must be tenurable", idx);
+      continue;
+    }
 
     // Note that we do not add tenurable regions if they were not pre-selected.  They were not selected
     // because there is insufficient room in old-gen to hold their to-be-promoted live objects or because
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahInPlacePromoter.cpp b/src/hotspot/share/gc/shenandoah/shenandoahInPlacePromoter.cpp
index 4a15401250c..10d61221e87 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahInPlacePromoter.cpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahInPlacePromoter.cpp
@@ -48,6 +48,7 @@ bool ShenandoahInPlacePromotionPlanner::is_eligible(const ShenandoahHeapRegion*
 }
 
 void ShenandoahInPlacePromotionPlanner::prepare(ShenandoahHeapRegion* r) {
+  assert(!r->is_humongous_continuation(), "Should not call for humongous continuations");
   HeapWord* tams = _marking_context->top_at_mark_start(r);
   HeapWord* original_top = r->top();
 
@@ -59,10 +60,16 @@ void ShenandoahInPlacePromotionPlanner::prepare(ShenandoahHeapRegion* r) {
     return;
   }
 
-  if (r->is_humongous()) {
-    // Nothing else to do for humongous, we just update the stats and move on. The humongous regions
-    // themselves will be discovered and promoted by gc workers during evacuation.
-    _pip_humongous_stats.update(r);
+  if (r->is_humongous_start()) {
+    if (const oop obj = cast_to_oop(r->bottom()); !obj->is_typeArray()) {
+      // Nothing else to do for humongous, we just update the stats and move on. The humongous regions
+      // themselves will be discovered and promoted by gc workers during evacuation. Note that humongous
+      // primitive arrays are not promoted.
+      const size_t num_regions = ShenandoahHeapRegion::required_regions(obj->size() * HeapWordSize);
+      for (size_t i = r->index(); i < r->index() + num_regions; i++) {
+        _pip_humongous_stats.update(_heap->get_region(i));
+      }
+    }
     return;
   }
 
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahInPlacePromoter.hpp b/src/hotspot/share/gc/shenandoah/shenandoahInPlacePromoter.hpp
index 2e7e19ee26e..d2cb644a59e 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahInPlacePromoter.hpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahInPlacePromoter.hpp
@@ -142,3 +142,4 @@ private:
 };
 
 #endif // SHARE_GC_SHENANDOAH_SHENANDOAHINPLACEPROMOTER_HPP
+
diff --git a/test/hotspot/gtest/gc/shenandoah/test_shenandoahGlobalHeuristic.cpp b/test/hotspot/gtest/gc/shenandoah/test_shenandoahGlobalHeuristic.cpp
new file mode 100644
index 00000000000..7b3e4227b5c
--- /dev/null
+++ b/test/hotspot/gtest/gc/shenandoah/test_shenandoahGlobalHeuristic.cpp
@@ -0,0 +1,332 @@
+/*
+ * Copyright Amazon.com Inc. or its affiliates. All Rights Reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+#include "unittest.hpp"
+#include "gc/shenandoah/heuristics/shenandoahGlobalHeuristics.hpp"
+
+// Region size of 256K is the minimum Shenandoah region size.
+static const size_t REGION_SIZE = 256 * 1024;
+
+// Waste factors matching the default JVM flag values.
+static const double OLD_EVAC_WASTE   = ShenandoahOldEvacWaste;
+static const double PROMO_EVAC_WASTE = ShenandoahPromoEvacWaste;
+static const double YOUNG_EVAC_WASTE = ShenandoahEvacWaste;
+
+// Default thresholds as percentages of region size.
+static const size_t GARBAGE_THRESHOLD = REGION_SIZE * 25 / 100;
+static const size_t IGNORE_THRESHOLD  = REGION_SIZE * 5 / 100;
+
+static ShenandoahGlobalCSetBudget make_budget(size_t shared_reserves,
+                                              size_t min_garbage = 0,
+                                              size_t young_evac_reserve = 0,
+                                              size_t old_evac_reserve = 0,
+                                              size_t promo_reserve = 0) {
+  return ShenandoahGlobalCSetBudget(REGION_SIZE, shared_reserves,
+                                    GARBAGE_THRESHOLD, IGNORE_THRESHOLD, min_garbage,
+                                    young_evac_reserve, YOUNG_EVAC_WASTE,
+                                    old_evac_reserve, OLD_EVAC_WASTE,
+                                    promo_reserve, PROMO_EVAC_WASTE);
+}
+
+// ---- Threshold tests ----
+
+// A region whose garbage is 1 byte below the 25% garbage threshold should be
+// skipped, even when there is plenty of shared reserve available.
+TEST(ShenandoahGlobalCSet, skip_below_garbage_threshold) {
+  auto budget = make_budget(10 * REGION_SIZE);
+  ShenandoahGlobalRegionAttributes region = {
+    GARBAGE_THRESHOLD - 1, REGION_SIZE - (GARBAGE_THRESHOLD - 1), 0, false, false
+  };
+  EXPECT_EQ(budget.try_add_region(region), ShenandoahGlobalRegionDisposition::SKIP);
+}
+
+// When the cumulative garbage collected so far is below min_garbage, regions
+// with garbage above the ignore threshold (5%) but below the garbage threshold
+// (25%) are added anyway ("add_regardless" path). This young non-tenurable
+// region should be accepted as a young evacuation.
+TEST(ShenandoahGlobalCSet, add_regardless_when_below_min_garbage) {
+  auto budget = make_budget(10 * REGION_SIZE, /*min_garbage=*/REGION_SIZE);
+  ShenandoahGlobalRegionAttributes region = {
+    IGNORE_THRESHOLD + 1, 1000, 0, false, false
+  };
+  EXPECT_EQ(budget.try_add_region(region), ShenandoahGlobalRegionDisposition::ADD_YOUNG_EVAC);
+}
+
+// A region whose garbage is exactly at the ignore threshold (not above it)
+// should be skipped even when min_garbage has not been met, because the
+// add_regardless condition requires garbage strictly above the ignore threshold.
+TEST(ShenandoahGlobalCSet, skip_at_ignore_threshold) {
+  auto budget = make_budget(10 * REGION_SIZE, /*min_garbage=*/REGION_SIZE);
+  ShenandoahGlobalRegionAttributes region = {
+    IGNORE_THRESHOLD, 1000, 0, false, false
+  };
+  EXPECT_EQ(budget.try_add_region(region), ShenandoahGlobalRegionDisposition::SKIP);
+}
+
+// ---- Old region evacuation ----
+
+// An old region at the garbage threshold with 50K live and 10K free, backed by
+// ample shared reserves. Should be accepted as old evacuation. The old_evac
+// budget consumes 50K * 1.4 = 70K for evacuation, and the promo budget absorbs
+// the 10K of free bytes that are lost when this region enters the collection set.
+TEST(ShenandoahGlobalCSet, old_region_accepted) {
+  auto budget = make_budget(5 * REGION_SIZE);
+  ShenandoahGlobalRegionAttributes region = {
+    GARBAGE_THRESHOLD, 50000, 10000, true, false
+  };
+
+  EXPECT_EQ(budget.try_add_region(region), ShenandoahGlobalRegionDisposition::ADD_OLD_EVAC);
+  EXPECT_EQ(budget.old_evac.region_count(), (size_t)1);
+  EXPECT_EQ(budget.old_evac.live_bytes(), (size_t)50000);
+  EXPECT_EQ(budget.old_evac.consumed(), (size_t)(50000 * OLD_EVAC_WASTE));
+  EXPECT_EQ(budget.promo.consumed(), (size_t)10000);
+  EXPECT_EQ(budget.cur_garbage(), GARBAGE_THRESHOLD);
+}
+
+// An old region with zero shared reserves and no per-category reserves. Both
+// the old_evac and promo reservations will fail, so the region is skipped.
+// Verify that all budget state remains at zero (clean rollback).
+TEST(ShenandoahGlobalCSet, old_region_rejected_no_budget) {
+  auto budget = make_budget(0);
+  ShenandoahGlobalRegionAttributes region = {
+    GARBAGE_THRESHOLD, 50000, 10000, true, false
+  };
+
+  EXPECT_EQ(budget.try_add_region(region), ShenandoahGlobalRegionDisposition::SKIP);
+  EXPECT_EQ(budget.old_evac.region_count(), (size_t)0);
+  EXPECT_EQ(budget.committed_from_shared(), (size_t)0);
+  EXPECT_EQ(budget.old_evac.consumed(), (size_t)0);
+  EXPECT_EQ(budget.promo.consumed(), (size_t)0);
+}
+
+// An old region with no per-category reserves but sufficient shared reserves.
+// The old_evac budget must expand from the shared pool to accommodate the
+// evacuation. Since old_evac starts at zero, all of its reserve comes from
+// shared, so committed_from_shared should equal old_evac.reserve().
+TEST(ShenandoahGlobalCSet, old_region_expands_shared) {
+  auto budget = make_budget(5 * REGION_SIZE);
+  ShenandoahGlobalRegionAttributes region = {
+    GARBAGE_THRESHOLD, 50000, 0, true, false
+  };
+
+  EXPECT_EQ(budget.try_add_region(region), ShenandoahGlobalRegionDisposition::ADD_OLD_EVAC);
+  EXPECT_GT(budget.committed_from_shared(), (size_t)0);
+  EXPECT_EQ(budget.committed_from_shared(), budget.old_evac.reserve());
+  EXPECT_GE(budget.old_evac.reserve(), budget.old_evac.consumed());
+}
+
+// An old region with enough old_evac reserve for the live data but zero promo
+// reserve, and a full region's worth of free bytes. The free bytes represent
+// promotion capacity that is lost when this region enters the cset, so the
+// promo budget must expand from shared reserves to absorb that loss.
+TEST(ShenandoahGlobalCSet, old_region_free_bytes_consume_promo_reserve) {
+  size_t live_data = 10000;
+  size_t evac_needed = (size_t)(live_data * OLD_EVAC_WASTE);
+  auto budget = make_budget(5 * REGION_SIZE, 0, 0, evac_needed, 0);
+  ShenandoahGlobalRegionAttributes region = {
+    GARBAGE_THRESHOLD, live_data, REGION_SIZE, true, false
+  };
+
+  EXPECT_EQ(budget.try_add_region(region), ShenandoahGlobalRegionDisposition::ADD_OLD_EVAC);
+  EXPECT_GT(budget.committed_from_shared(), (size_t)0);
+  EXPECT_GE(budget.promo.reserve(), (size_t)REGION_SIZE);
+  EXPECT_EQ(budget.promo.consumed(), (size_t)REGION_SIZE);
+}
+
+// ---- Promotion ----
+
+// A young tenurable region at the garbage threshold with 40K live data and
+// ample shared reserves. Should be accepted as a promotion. The promo budget
+// consumes 40K * 1.2 = 48K.
+TEST(ShenandoahGlobalCSet, tenurable_region_promoted) {
+  auto budget = make_budget(5 * REGION_SIZE);
+  ShenandoahGlobalRegionAttributes region = {
+    GARBAGE_THRESHOLD, 40000, 0, false, true
+  };
+
+  EXPECT_EQ(budget.try_add_region(region), ShenandoahGlobalRegionDisposition::ADD_PROMO);
+  EXPECT_EQ(budget.promo.region_count(), (size_t)1);
+  EXPECT_EQ(budget.promo.live_bytes(), (size_t)40000);
+  EXPECT_EQ(budget.promo.consumed(), (size_t)(40000 * PROMO_EVAC_WASTE));
+}
+
+// A young tenurable region with zero reserves. The promo reservation fails,
+// so the region is skipped.
+TEST(ShenandoahGlobalCSet, tenurable_region_rejected) {
+  auto budget = make_budget(0);
+  ShenandoahGlobalRegionAttributes region = {
+    GARBAGE_THRESHOLD, 40000, 0, false, true
+  };
+  EXPECT_EQ(budget.try_add_region(region), ShenandoahGlobalRegionDisposition::SKIP);
+}
+
+// ---- Young evacuation ----
+
+// A young non-tenurable region at the garbage threshold with 30K live data.
+// Should be accepted as a young evacuation. The young_evac budget consumes
+// 30K * 1.2 = 36K.
+TEST(ShenandoahGlobalCSet, young_region_evacuated) {
+  auto budget = make_budget(5 * REGION_SIZE);
+  ShenandoahGlobalRegionAttributes region = {
+    GARBAGE_THRESHOLD, 30000, 0, false, false
+  };
+
+  EXPECT_EQ(budget.try_add_region(region), ShenandoahGlobalRegionDisposition::ADD_YOUNG_EVAC);
+  EXPECT_EQ(budget.young_evac.region_count(), (size_t)1);
+  EXPECT_EQ(budget.young_evac.consumed(), (size_t)(30000 * YOUNG_EVAC_WASTE));
+}
+
+// A young non-tenurable region with zero reserves. The young_evac reservation
+// fails, so the region is skipped.
+TEST(ShenandoahGlobalCSet, young_region_rejected) {
+  auto budget = make_budget(0);
+  ShenandoahGlobalRegionAttributes region = {
+    GARBAGE_THRESHOLD, 30000, 0, false, false
+  };
+  EXPECT_EQ(budget.try_add_region(region), ShenandoahGlobalRegionDisposition::SKIP);
+}
+
+// ---- Multi-region and budget interaction tests ----
+
+// Evaluate two identical young regions against a budget with only 1 region's
+// worth of shared reserves. Each region has 150K live data, so anticipated
+// consumption is 150K * 1.2 = 180K per region. The first region expands the
+// young_evac reserve by one region (256K) from shared, consuming 180K of it.
+// The second region needs another 180K, but only 76K remains in the reserve
+// and the shared pool is exhausted, so it must be skipped.
+TEST(ShenandoahGlobalCSet, shared_exhausted_across_regions) {
+  auto budget = make_budget(1 * REGION_SIZE);
+  ShenandoahGlobalRegionAttributes region = {
+    GARBAGE_THRESHOLD, 150000, 0, false, false
+  };
+
+  EXPECT_EQ(budget.try_add_region(region), ShenandoahGlobalRegionDisposition::ADD_YOUNG_EVAC);
+  EXPECT_EQ(budget.try_add_region(region), ShenandoahGlobalRegionDisposition::SKIP);
+  EXPECT_EQ(budget.young_evac.region_count(), (size_t)1);
+}
+
+// An old region where the old_evac reserve is pre-sized to exactly cover the
+// evacuation need, and the promo reserve covers the free bytes loss. No shared
+// reserves should be drawn because the per-category reserves are sufficient.
+TEST(ShenandoahGlobalCSet, existing_reserve_used_before_shared) {
+  size_t live_data = 50000;
+  size_t evac_needed = (size_t)(live_data * OLD_EVAC_WASTE);
+  auto budget = make_budget(5 * REGION_SIZE, 0, 0, evac_needed, REGION_SIZE);
+  ShenandoahGlobalRegionAttributes region = {
+    GARBAGE_THRESHOLD, live_data, 1000, true, false
+  };
+
+  EXPECT_EQ(budget.try_add_region(region), ShenandoahGlobalRegionDisposition::ADD_OLD_EVAC);
+  EXPECT_EQ(budget.committed_from_shared(), (size_t)0);
+}
+
+// Evaluate two identical young regions and verify that cur_garbage accumulates
+// the garbage from each accepted region.
+TEST(ShenandoahGlobalCSet, garbage_accumulates) {
+  auto budget = make_budget(10 * REGION_SIZE);
+  ShenandoahGlobalRegionAttributes region = {
+    GARBAGE_THRESHOLD, 10000, 0, false, false
+  };
+
+  budget.try_add_region(region);
+  EXPECT_EQ(budget.cur_garbage(), GARBAGE_THRESHOLD);
+  budget.try_add_region(region);
+  EXPECT_EQ(budget.cur_garbage(), 2 * GARBAGE_THRESHOLD);
+}
+
+// When no regions are evaluated, finish() should donate the entire shared
+// reserve pool to the promo budget.
+TEST(ShenandoahGlobalCSet, finish_donates_remaining_to_promo) {
+  auto budget = make_budget(5 * REGION_SIZE);
+  size_t promo_before = budget.promo.reserve();
+  budget.finish();
+  EXPECT_EQ(budget.promo.reserve(), promo_before + 5 * REGION_SIZE);
+}
+
+// After evaluating one region that draws from the shared pool, finish() should
+// donate only the remaining (unconsumed) shared reserves to promo.
+TEST(ShenandoahGlobalCSet, finish_donates_remainder_after_use) {
+  auto budget = make_budget(5 * REGION_SIZE);
+  ShenandoahGlobalRegionAttributes region = {
+    GARBAGE_THRESHOLD, 10000, 0, false, false
+  };
+  budget.try_add_region(region);
+  size_t shared_used = budget.committed_from_shared();
+  size_t promo_before = budget.promo.reserve();
+  budget.finish();
+  EXPECT_EQ(budget.promo.reserve(), promo_before + (5 * REGION_SIZE - shared_used));
+}
+
+// ---- ShenandoahEvacuationBudget unit tests ----
+
+// A reservation that fits entirely within the existing reserve should succeed
+// without drawing from the shared pool.
+TEST(ShenandoahEvacuationBudget, try_reserve_fits_without_expansion) {
+  ShenandoahSharedEvacReserve shared(5 * REGION_SIZE);
+  ShenandoahEvacuationBudget evac_budget(REGION_SIZE, 1.0, REGION_SIZE, &shared);
+  EXPECT_TRUE(evac_budget.try_reserve(REGION_SIZE));
+  EXPECT_EQ(shared.committed, (size_t)0);
+  EXPECT_EQ(evac_budget.reserve(), (size_t)REGION_SIZE);
+}
+
+// A reservation of REGION_SIZE+1 bytes starting from a zero reserve requires
+// two region-sized expansions from the shared pool (one region isn't enough).
+TEST(ShenandoahEvacuationBudget, try_reserve_expands_from_shared) {
+  ShenandoahSharedEvacReserve shared(5 * REGION_SIZE);
+  ShenandoahEvacuationBudget evac_budget(0, 1.0, REGION_SIZE, &shared);
+  EXPECT_TRUE(evac_budget.try_reserve(REGION_SIZE + 1));
+  EXPECT_EQ(shared.committed, 2 * REGION_SIZE);
+  EXPECT_EQ(evac_budget.reserve(), 2 * REGION_SIZE);
+}
+
+// A reservation with an empty shared pool should fail, leaving both the
+// budget's reserve and the shared pool's committed count unchanged.
+TEST(ShenandoahEvacuationBudget, try_reserve_fails_no_shared) {
+  ShenandoahSharedEvacReserve shared(0);
+  ShenandoahEvacuationBudget evac_budget(0, 1.0, REGION_SIZE, &shared);
+  EXPECT_FALSE(evac_budget.try_reserve(REGION_SIZE));
+  EXPECT_EQ(shared.committed, (size_t)0);
+  EXPECT_EQ(evac_budget.reserve(), (size_t)0);
+}
+
+// A reservation of 3 regions against a shared pool of only 2 regions should
+// fail. On failure, neither the budget's reserve nor the shared pool's
+// committed count should be modified.
+TEST(ShenandoahEvacuationBudget, try_reserve_fails_insufficient_shared) {
+  ShenandoahSharedEvacReserve shared(2 * REGION_SIZE);
+  ShenandoahEvacuationBudget evac_budget(0, 1.0, REGION_SIZE, &shared);
+  EXPECT_FALSE(evac_budget.try_reserve(3 * REGION_SIZE));
+  EXPECT_EQ(shared.committed, (size_t)0);
+  EXPECT_EQ(evac_budget.reserve(), (size_t)0);
+}
+
+// Committing a consumption of 1200 bytes with 1000 live bytes should update
+// all three tracking fields: consumed, live_bytes, and region_count.
+TEST(ShenandoahEvacuationBudget, commit_updates_fields) {
+  ShenandoahSharedEvacReserve shared(5 * REGION_SIZE);
+  ShenandoahEvacuationBudget evac_budget(REGION_SIZE, 1.2, REGION_SIZE, &shared);
+  evac_budget.commit(1200, 1000);
+  EXPECT_EQ(evac_budget.consumed(), (size_t)1200);
+  EXPECT_EQ(evac_budget.live_bytes(), (size_t)1000);
+  EXPECT_EQ(evac_budget.region_count(), (size_t)1);
+}

From 137d97131bc044fa090b88eab767913d690bb2e2 Mon Sep 17 00:00:00 2001
From: Vladimir Kozlov <kvn@openjdk.org>
Date: Fri, 20 Mar 2026 20:18:12 +0000
Subject: [PATCH 282/655] 8378935: C2 crash in PhaseOutput::fill_buffer: wrong
 size of mach node

Reviewed-by: iklam, asmehra
---
 src/hotspot/share/cds/aotMetaspace.cpp  |  4 +--
 src/hotspot/share/cds/cdsConfig.cpp     |  4 +--
 src/hotspot/share/code/aotCodeCache.cpp | 45 +++----------------------
 src/hotspot/share/code/aotCodeCache.hpp |  9 ++---
 4 files changed, 10 insertions(+), 52 deletions(-)

diff --git a/src/hotspot/share/cds/aotMetaspace.cpp b/src/hotspot/share/cds/aotMetaspace.cpp
index b75d7628aa9..5e75cd72778 100644
--- a/src/hotspot/share/cds/aotMetaspace.cpp
+++ b/src/hotspot/share/cds/aotMetaspace.cpp
@@ -1187,8 +1187,8 @@ void AOTMetaspace::dump_static_archive_impl(StaticArchiveBuilder& builder, TRAPS
     CDSConfig::enable_dumping_aot_code();
     {
       builder.start_ac_region();
-      // Write the contents to AOT code region and close AOTCodeCache before packing the region
-      AOTCodeCache::close();
+      // Write the contents to AOT code region before packing the region
+      AOTCodeCache::dump();
       builder.end_ac_region();
     }
     CDSConfig::disable_dumping_aot_code();
diff --git a/src/hotspot/share/cds/cdsConfig.cpp b/src/hotspot/share/cds/cdsConfig.cpp
index f4ef3c66f7a..d8ae50517fe 100644
--- a/src/hotspot/share/cds/cdsConfig.cpp
+++ b/src/hotspot/share/cds/cdsConfig.cpp
@@ -108,6 +108,8 @@ void CDSConfig::ergo_initialize() {
   }
 
   AOTMapLogger::ergo_initialize();
+
+  setup_compiler_args();
 }
 
 const char* CDSConfig::default_archive_path() {
@@ -635,8 +637,6 @@ bool CDSConfig::check_vm_args_consistency(bool patch_mod_javabase, bool mode_fla
     FLAG_SET_ERGO_IF_DEFAULT(AOTClassLinking, true);
   }
 
-  setup_compiler_args();
-
   if (AOTClassLinking) {
     // If AOTClassLinking is specified, enable all AOT optimizations by default.
     FLAG_SET_ERGO_IF_DEFAULT(AOTInvokeDynamicLinking, true);
diff --git a/src/hotspot/share/code/aotCodeCache.cpp b/src/hotspot/share/code/aotCodeCache.cpp
index e5f68afc51d..b29cf906736 100644
--- a/src/hotspot/share/code/aotCodeCache.cpp
+++ b/src/hotspot/share/code/aotCodeCache.cpp
@@ -284,11 +284,11 @@ bool AOTCodeCache::open_cache(bool is_dumping, bool is_using) {
   return true;
 }
 
-void AOTCodeCache::close() {
+void AOTCodeCache::dump() {
   if (is_on()) {
-    delete _cache; // Free memory
-    _cache = nullptr;
-    opened_cache = nullptr;
+    assert(is_on_for_dump(), "should be called only when dumping AOT code");
+    MutexLocker ml(Compile_lock);
+    _cache->finish_write();
   }
 }
 
@@ -304,7 +304,6 @@ AOTCodeCache::AOTCodeCache(bool is_dumping, bool is_using) :
   _store_size(0),
   _for_use(is_using),
   _for_dump(is_dumping),
-  _closing(false),
   _failed(false),
   _lookup_failed(false),
   _table(nullptr),
@@ -381,30 +380,6 @@ void AOTCodeCache::init_early_c1_table() {
   }
 }
 
-AOTCodeCache::~AOTCodeCache() {
-  if (_closing) {
-    return; // Already closed
-  }
-  // Stop any further access to cache.
-  _closing = true;
-
-  MutexLocker ml(Compile_lock);
-  if (for_dump()) { // Finalize cache
-    finish_write();
-  }
-  _load_buffer = nullptr;
-  if (_C_store_buffer != nullptr) {
-    FREE_C_HEAP_ARRAY(char, _C_store_buffer);
-    _C_store_buffer = nullptr;
-    _store_buffer = nullptr;
-  }
-  if (_table != nullptr) {
-    MutexLocker ml(AOTCodeCStrings_lock, Mutex::_no_safepoint_check_flag);
-    delete _table;
-    _table = nullptr;
-  }
-}
-
 void AOTCodeCache::Config::record(uint cpu_features_offset) {
   _flags = 0;
 #ifdef ASSERT
@@ -1545,18 +1520,6 @@ void AOTCodeAddressTable::init_early_c1() {
 
 #undef SET_ADDRESS
 
-AOTCodeAddressTable::~AOTCodeAddressTable() {
-  if (_extrs_addr != nullptr) {
-    FREE_C_HEAP_ARRAY(address, _extrs_addr);
-  }
-  if (_stubs_addr != nullptr) {
-    FREE_C_HEAP_ARRAY(address, _stubs_addr);
-  }
-  if (_shared_blobs_addr != nullptr) {
-    FREE_C_HEAP_ARRAY(address, _shared_blobs_addr);
-  }
-}
-
 #ifdef PRODUCT
 #define MAX_STR_COUNT 200
 #else
diff --git a/src/hotspot/share/code/aotCodeCache.hpp b/src/hotspot/share/code/aotCodeCache.hpp
index 85f8b47920f..bd8721fea8c 100644
--- a/src/hotspot/share/code/aotCodeCache.hpp
+++ b/src/hotspot/share/code/aotCodeCache.hpp
@@ -152,7 +152,6 @@ public:
     _early_c1_complete(false),
     _complete(false)
   { }
-  ~AOTCodeAddressTable();
   void init_extrs();
   void init_early_stubs();
   void init_shared_blobs();
@@ -260,7 +259,6 @@ private:
   uint   _store_size;      // Used when writing cache
   bool   _for_use;         // AOT cache is open for using AOT code
   bool   _for_dump;        // AOT cache is open for dumping AOT code
-  bool   _closing;         // Closing cache file
   bool   _failed;          // Failed read/write to/from cache (cache is broken?)
   bool   _lookup_failed;   // Failed to lookup for info (skip only this code load)
 
@@ -290,7 +288,6 @@ private:
 
 public:
   AOTCodeCache(bool is_dumping, bool is_using);
-  ~AOTCodeCache();
 
   const char* cache_buffer() const { return _load_buffer; }
   bool failed() const { return _failed; }
@@ -314,8 +311,6 @@ public:
   bool for_use()  const { return _for_use  && !_failed; }
   bool for_dump() const { return _for_dump && !_failed; }
 
-  bool closing()          const { return _closing; }
-
   AOTCodeEntry* add_entry() {
     _store_entries_cnt++;
     _store_entries -= 1;
@@ -375,8 +370,8 @@ public:
   static AOTCodeCache* cache() { assert(_passed_init2, "Too early to ask"); return _cache; }
   static void initialize() NOT_CDS_RETURN;
   static void init2() NOT_CDS_RETURN;
-  static void close() NOT_CDS_RETURN;
-  static bool is_on() CDS_ONLY({ return cache() != nullptr && !_cache->closing(); }) NOT_CDS_RETURN_(false);
+  static void dump() NOT_CDS_RETURN;
+  static bool is_on() CDS_ONLY({ return cache() != nullptr; }) NOT_CDS_RETURN_(false);
   static bool is_on_for_use()  CDS_ONLY({ return is_on() && _cache->for_use(); }) NOT_CDS_RETURN_(false);
   static bool is_on_for_dump() CDS_ONLY({ return is_on() && _cache->for_dump(); }) NOT_CDS_RETURN_(false);
   static bool is_dumping_stub() NOT_CDS_RETURN_(false);

From d610aceed477e0e17d3cdc56df719706ae9eccc5 Mon Sep 17 00:00:00 2001
From: William Kemper <wkemper@openjdk.org>
Date: Fri, 20 Mar 2026 23:42:08 +0000
Subject: [PATCH 283/655] 8380562: GenShen: GC notification event may see
 invalid values

Reviewed-by: cslucas, kdnilsen
---
 .../share/gc/shenandoah/shenandoahHeap.cpp    |  5 +--
 .../gc/shenandoah/shenandoahMemoryPool.cpp    | 31 ++-----------------
 .../gc/shenandoah/shenandoahMemoryPool.hpp    | 11 +++++++
 3 files changed, 14 insertions(+), 33 deletions(-)

diff --git a/src/hotspot/share/gc/shenandoah/shenandoahHeap.cpp b/src/hotspot/share/gc/shenandoah/shenandoahHeap.cpp
index 9cd22e6ee25..817f5e8dc47 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahHeap.cpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahHeap.cpp
@@ -2700,10 +2700,7 @@ GrowableArray<MemoryPool*> ShenandoahHeap::memory_pools() {
 }
 
 MemoryUsage ShenandoahHeap::memory_usage() {
-  assert(_initial_size <= ShenandoahHeap::heap()->max_capacity(), "sanity");
-  assert(used() <= ShenandoahHeap::heap()->max_capacity(), "sanity");
-  assert(committed() <= ShenandoahHeap::heap()->max_capacity(), "sanity");
-  return MemoryUsage(_initial_size, used(), committed(), max_capacity());
+  return shenandoah_memory_usage(_initial_size, used(), committed(), max_capacity());
 }
 
 ShenandoahRegionIterator::ShenandoahRegionIterator() :
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahMemoryPool.cpp b/src/hotspot/share/gc/shenandoah/shenandoahMemoryPool.cpp
index d55d1bd8147..dfc34dcc3c3 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahMemoryPool.cpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahMemoryPool.cpp
@@ -48,25 +48,7 @@ ShenandoahMemoryPool::ShenandoahMemoryPool(ShenandoahHeap* heap,
 
 
 MemoryUsage ShenandoahMemoryPool::get_memory_usage() {
-  size_t initial   = initial_size();
-  size_t max       = max_size();
-  size_t used      = used_in_bytes();
-  size_t committed = _heap->committed();
-
-  // These asserts can never fail: max is stable, and all updates to other values never overflow max.
-  assert(initial <= max,    "initial: %zu, max: %zu",   initial,   max);
-  assert(used <= max,       "used: %zu, max: %zu",      used,      max);
-  assert(committed <= max,  "committed: %zu, max: %zu", committed, max);
-
-  // Committed and used are updated concurrently and independently. They can momentarily break
-  // the assert below, which would also fail in downstream code. To avoid that, adjust values
-  // to make sense under the race. See JDK-8207200.
-  committed = MAX2(used, committed);
-  assert(used <= committed, "used: %zu, committed: %zu", used, committed);
-  assert(initial <= _heap->max_capacity(), "sanity");
-  assert(committed <= _heap->max_capacity(), "sanity");
-  assert(max <= _heap->max_capacity(), "sanity");
-  return MemoryUsage(initial, used, committed, max);
+  return shenandoah_memory_usage(initial_size(), used_in_bytes(), _heap->committed(), max_size());
 }
 
 size_t ShenandoahMemoryPool::used_in_bytes() {
@@ -83,16 +65,7 @@ ShenandoahGenerationalMemoryPool::ShenandoahGenerationalMemoryPool(ShenandoahHea
         _generation(generation) { }
 
 MemoryUsage ShenandoahGenerationalMemoryPool::get_memory_usage() {
-  size_t initial   = initial_size();
-  size_t max       = max_size();
-  size_t used      = used_in_bytes();
-  size_t committed = _generation->used_regions_size();
-
-  assert(initial <= _heap->max_capacity(), "sanity");
-  assert(used <= _heap->max_capacity(), "sanity");
-  assert(committed <= _heap->max_capacity(), "sanity");
-  assert(max <= _heap->max_capacity(), "sanity");
-  return MemoryUsage(initial, used, committed, max);
+  return shenandoah_memory_usage(initial_size(), used_in_bytes(), _generation->used_regions_size(), max_size());
 }
 
 size_t ShenandoahGenerationalMemoryPool::used_in_bytes() {
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahMemoryPool.hpp b/src/hotspot/share/gc/shenandoah/shenandoahMemoryPool.hpp
index ccdfdddede9..d466087b9b7 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahMemoryPool.hpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahMemoryPool.hpp
@@ -30,6 +30,17 @@
 #include "services/memoryPool.hpp"
 #include "services/memoryUsage.hpp"
 
+// Constructs a MemoryUsage from concurrently sampled values, clamping committed
+// to be at least as large as used to account for concurrent updates. See JDK-8207200.
+inline MemoryUsage shenandoah_memory_usage(size_t initial, size_t used, size_t committed, size_t max) {
+  assert(initial <= max,    "initial: %zu, max: %zu",   initial,   max);
+  assert(used <= max,       "used: %zu, max: %zu",      used,      max);
+  assert(committed <= max,  "committed: %zu, max: %zu", committed, max);
+  committed = MAX2(used, committed);
+  assert(used <= committed, "used: %zu, committed: %zu", used, committed);
+  return MemoryUsage(initial, used, committed, max);
+}
+
 class ShenandoahMemoryPool : public CollectedMemoryPool {
 protected:
    ShenandoahHeap* _heap;

From e58e576f80cd35728bac6738474c4090737c16a8 Mon Sep 17 00:00:00 2001
From: Jaikiran Pai <jpai@openjdk.org>
Date: Sat, 21 Mar 2026 02:21:09 +0000
Subject: [PATCH 284/655] 8369181: InflaterOutputStream: writing after finish()
 results in IllegalStateException instead of an IOException

Reviewed-by: alanb, sherman, lancea
---
 .../java/util/zip/InflaterOutputStream.java   |  87 +++++++---
 .../util/zip/InflaterOutputStreamTest.java    | 157 ++++++++++++++++++
 2 files changed, 218 insertions(+), 26 deletions(-)
 create mode 100644 test/jdk/java/util/zip/InflaterOutputStreamTest.java

diff --git a/src/java.base/share/classes/java/util/zip/InflaterOutputStream.java b/src/java.base/share/classes/java/util/zip/InflaterOutputStream.java
index 31c51509a76..abe4e069915 100644
--- a/src/java.base/share/classes/java/util/zip/InflaterOutputStream.java
+++ b/src/java.base/share/classes/java/util/zip/InflaterOutputStream.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2006, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2006, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -31,14 +31,14 @@ import java.io.OutputStream;
 import java.util.Objects;
 
 /**
- * Implements an output stream filter for uncompressing data stored in the
+ * Implements an output stream filter for decompressing data stored in the
  * "deflate" compression format.
  *
  * <h2 id="decompressor-usage">Decompressor Usage</h2>
  * An {@code InflaterOutputStream} created without
  * specifying a {@linkplain Inflater decompressor} will create a decompressor
  * at construction time, and close the decompressor when the output stream
- * is {@linkplain #close closed}.
+ * is {@linkplain #close closed} or when {@link #finish()} is called.
  * <p>
  * If a decompressor is specified when creating a {@code InflaterOutputStream}, it is the
  * responsibility of the caller to {@linkplain Inflater#close close} the
@@ -49,7 +49,6 @@ import java.util.Objects;
  * stream, either directly, or with the {@code try}-with-resources statement.
  *
  * @since       1.6
- * @author      David R Tribble (david@tribble.com)
  *
  * @see InflaterInputStream
  * @see DeflaterInputStream
@@ -60,7 +59,7 @@ public class InflaterOutputStream extends FilterOutputStream {
     /** Decompressor for this stream. */
     protected final Inflater inf;
 
-    /** Output buffer for writing uncompressed data. */
+    /** Output buffer for writing decompressed data. */
     protected final byte[] buf;
 
     /** Temporary write buffer. */
@@ -72,6 +71,10 @@ public class InflaterOutputStream extends FilterOutputStream {
     /** true iff {@link #close()} has been called. */
     private boolean closed = false;
 
+    // set to true if finish() was called and this InflaterOutputStream
+    // had created its own Inflater at construction time.
+    private boolean defaultInflaterClosed;
+
     /**
      * Checks to make sure that this stream has not been closed.
      */
@@ -88,7 +91,7 @@ public class InflaterOutputStream extends FilterOutputStream {
      * The decompressor will be closed when this output stream
      * is {@linkplain #close() closed}.
      *
-     * @param out output stream to write the uncompressed data to
+     * @param out output stream to write the decompressed data to
      * @throws NullPointerException if {@code out} is null
      */
     public InflaterOutputStream(OutputStream out) {
@@ -104,7 +107,7 @@ public class InflaterOutputStream extends FilterOutputStream {
      * {@linkplain ##decompressor-usage will not close} the given
      * {@linkplain Inflater decompressor}.
      *
-     * @param out output stream to write the uncompressed data to
+     * @param out output stream to write the decompressed data to
      * @param infl decompressor ("inflater") for this stream
      * @throws NullPointerException if {@code out} or {@code infl} is null
      */
@@ -120,7 +123,7 @@ public class InflaterOutputStream extends FilterOutputStream {
      * {@linkplain ##decompressor-usage will not close} the given
      * {@linkplain Inflater decompressor}.
      *
-     * @param out output stream to write the uncompressed data to
+     * @param out output stream to write the decompressed data to
      * @param infl decompressor ("inflater") for this stream
      * @param bufLen decompression buffer size
      * @throws IllegalArgumentException if {@code bufLen <= 0}
@@ -143,27 +146,45 @@ public class InflaterOutputStream extends FilterOutputStream {
     }
 
     /**
-     * Writes any remaining uncompressed data to the output stream and closes
+     * Writes any remaining decompressed data to the output stream and closes
      * the underlying output stream.
      *
+     * @implSpec If not already closed, this method calls {@link #finish()} before
+     * closing the underlying output stream.
+     *
      * @throws IOException if an I/O error occurs
      */
     @Override
     public void close() throws IOException {
-        if (!closed) {
-            // Complete the uncompressed output
+        if (closed) {
+            return;
+        }
+        IOException toThrow = null;
+        // Complete the decompressed output
+        try {
+            finish();
+        } catch (IOException ioe) {
+            toThrow = ioe;
+        } finally {
             try {
-                finish();
-            } finally {
                 out.close();
-                closed = true;
+            } catch (IOException ioe) {
+                if (toThrow == null) {
+                    toThrow = ioe;
+                } else if (toThrow != ioe) {
+                    toThrow.addSuppressed(ioe);
+                }
             }
+            closed = true;
+        }
+        if (toThrow != null) {
+            throw toThrow;
         }
     }
 
     /**
-     * Flushes this output stream, forcing any pending buffered output bytes to be
-     * written.
+     * Flushes this output stream, writing any pending buffered decompressed data to
+     * the underlying output stream.
      *
      * @throws IOException if an I/O error occurs or this stream is already
      * closed
@@ -184,7 +205,7 @@ public class InflaterOutputStream extends FilterOutputStream {
                         break;
                     }
 
-                    // Write the uncompressed output data block
+                    // Write the decompressed output data block
                     out.write(buf, 0, n);
                 }
                 super.flush();
@@ -200,12 +221,18 @@ public class InflaterOutputStream extends FilterOutputStream {
     }
 
     /**
-     * Finishes writing uncompressed data to the output stream without closing
-     * the underlying stream.  Use this method when applying multiple filters in
-     * succession to the same output stream.
+     * Writes any pending buffered decompressed data to the underlying output stream,
+     * without closing the underlying stream.
      *
-     * @throws IOException if an I/O error occurs or this stream is already
-     * closed
+     * @implSpec This method calls {@link #flush()} to write any pending buffered
+     * decompressed data.
+     * <p>
+     * If this {@code InflaterOutputStream} was created without specifying
+     * a {@linkplain Inflater decompressor}, then this method closes the decompressor
+     * that was created at construction time. The {@code InflaterOutputStream} cannot
+     * then be used for any further writes.
+     *
+     * @throws IOException if an I/O error occurs or this stream is already closed
      */
     public void finish() throws IOException {
         ensureOpen();
@@ -214,11 +241,12 @@ public class InflaterOutputStream extends FilterOutputStream {
         flush();
         if (usesDefaultInflater) {
             inf.end();
+            this.defaultInflaterClosed = true;
         }
     }
 
     /**
-     * Writes a byte to the uncompressed output stream.
+     * Writes a byte to the decompressed output stream.
      *
      * @param b a single byte of compressed data to decompress and write to
      * the output stream
@@ -234,7 +262,7 @@ public class InflaterOutputStream extends FilterOutputStream {
     }
 
     /**
-     * Writes an array of bytes to the uncompressed output stream.
+     * Writes an array of bytes to the decompressed output stream.
      *
      * @param b buffer containing compressed data to decompress and write to
      * the output stream
@@ -251,15 +279,22 @@ public class InflaterOutputStream extends FilterOutputStream {
     public void write(byte[] b, int off, int len) throws IOException {
         // Sanity checks
         ensureOpen();
+        // check if this InflaterOutputStream had constructed its own
+        // Inflater at construction time and has been
+        // rendered unusable for writes due to finish() being called
+        // on it.
+        if (usesDefaultInflater && defaultInflaterClosed) {
+            throw new IOException("Inflater closed");
+        }
         if (b == null) {
-            throw new NullPointerException("Null buffer for read");
+            throw new NullPointerException("Null input buffer");
         }
         Objects.checkFromIndexSize(off, len, b.length);
         if (len == 0) {
             return;
         }
 
-        // Write uncompressed data to the output stream
+        // Write decompressed data to the output stream
         try {
             for (;;) {
                 int n;
diff --git a/test/jdk/java/util/zip/InflaterOutputStreamTest.java b/test/jdk/java/util/zip/InflaterOutputStreamTest.java
new file mode 100644
index 00000000000..3f588d95c0c
--- /dev/null
+++ b/test/jdk/java/util/zip/InflaterOutputStreamTest.java
@@ -0,0 +1,157 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+import java.io.ByteArrayOutputStream;
+import java.io.IOException;
+import java.util.ArrayList;
+import java.util.List;
+import java.util.zip.Deflater;
+import java.util.zip.Inflater;
+import java.util.zip.InflaterOutputStream;
+
+import org.junit.jupiter.api.BeforeAll;
+import org.junit.jupiter.api.Test;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.Arguments;
+import org.junit.jupiter.params.provider.MethodSource;
+import static java.nio.charset.StandardCharsets.US_ASCII;
+import static org.junit.jupiter.api.Assertions.assertArrayEquals;
+import static org.junit.jupiter.api.Assertions.assertThrows;
+import static org.junit.jupiter.api.Assertions.fail;
+
+/*
+ * @test
+ * @bug 8369181
+ * @summary Verify the behaviour of basic operations on InflaterOutputStream
+ * @run junit ${test.main.class}
+ */
+class InflaterOutputStreamTest {
+
+    private static final byte[] INPUT_CONTENT = "hello world".getBytes(US_ASCII);
+    private static byte[] COMPRESSED_CONTENT;
+
+    @BeforeAll
+    static void beforeAll() throws Exception {
+        // created the compressed content
+        final ByteArrayOutputStream compressedBaos = new ByteArrayOutputStream();
+        try (Deflater compressor = new Deflater()) {
+            compressor.setInput(INPUT_CONTENT);
+            compressor.finish();
+            while (!compressor.finished()) {
+                final byte[] tmpBuffer = new byte[100];
+                final int numCompressed = compressor.deflate(tmpBuffer);
+                compressedBaos.write(tmpBuffer, 0, numCompressed);
+            }
+        }
+        COMPRESSED_CONTENT = compressedBaos.toByteArray();
+    }
+
+    static List<Arguments> inflaterOutputStreams() {
+        final List<Arguments> args = new ArrayList<>();
+        args.add(Arguments.of(new InflaterOutputStream(new ByteArrayOutputStream())));
+        args.add(Arguments.of(new InflaterOutputStream(new ByteArrayOutputStream(),
+                new Inflater())));
+        args.add(Arguments.of(new InflaterOutputStream(new ByteArrayOutputStream(),
+                new Inflater(), 1024)));
+        return args;
+    }
+
+    /*
+     * Verify that write() methods throw an IOException when the InflaterOutputStream
+     * is already closed.
+     */
+    @ParameterizedTest
+    @MethodSource("inflaterOutputStreams")
+    void testWriteAfterClose(final InflaterOutputStream ios) throws Exception {
+        ios.close();
+        IOException ioe = assertThrows(IOException.class, () -> ios.write(COMPRESSED_CONTENT));
+        // verify it failed for right reason
+        assertStreamClosedIOE(ioe);
+    }
+
+    /*
+     * Verify that flush() throws an IOException when the InflaterOutputStream
+     * is already closed
+     */
+    @ParameterizedTest
+    @MethodSource("inflaterOutputStreams")
+    void testFlushAfterClose(final InflaterOutputStream ios) throws Exception {
+        ios.close();
+        final IOException ioe = assertThrows(IOException.class, ios::flush);
+        // verify it failed for right reason
+        assertStreamClosedIOE(ioe);
+    }
+
+    /*
+     * Verify that finish() throws an IOException when the InflaterOutputStream
+     * is already closed.
+     */
+    @ParameterizedTest
+    @MethodSource("inflaterOutputStreams")
+    void testFinishAfterClose(final InflaterOutputStream ios) throws Exception {
+        ios.close();
+        final IOException ioe = assertThrows(IOException.class, ios::finish);
+        // verify it failed for right reason
+        assertStreamClosedIOE(ioe);
+    }
+
+    /*
+     * Verify that after finish() is called on an InflaterOutputStream that was constructed
+     * without specifying a Inflater, any subsequent writes will throw an IOException.
+     */
+    @Test
+    void testWriteAfterFinish() throws IOException {
+        // InflaterOutputStream that constructs an internal default Inflater
+        final InflaterOutputStream ios = new InflaterOutputStream(new ByteArrayOutputStream());
+        ios.finish();
+        final IOException ioe = assertThrows(IOException.class, () -> ios.write(COMPRESSED_CONTENT));
+        final String msg = ioe.getMessage();
+        // verify that it's the right IOException
+        if (msg == null || !msg.contains("Inflater closed")) {
+            // propagate the original exception
+            fail("unexpected exception message in IOException", ioe);
+        }
+
+        // repeat with a InflaterOutputStream that is passed a Inflater
+        try (Inflater intf = new Inflater();
+             ByteArrayOutputStream baos = new ByteArrayOutputStream();
+             InflaterOutputStream stream = new InflaterOutputStream(baos, intf)) {
+
+            stream.finish();
+            // not expected to throw any exception
+            stream.write(COMPRESSED_CONTENT);
+            stream.flush();
+            // verify the decompressed content is as expected
+            final byte[] decompressed = baos.toByteArray();
+            assertArrayEquals(INPUT_CONTENT, decompressed, "unexpected decompressed content");
+        }
+    }
+
+    private void assertStreamClosedIOE(final IOException ioe) {
+        final String msg = ioe.getMessage();
+        if (msg == null || !msg.contains("Stream closed")) {
+            // propagate the original exception
+            fail("unexpected exception message in IOException", ioe);
+        }
+    }
+}

From 9a3b850af6178abd7aa29f42d74c4f7fd3f2bc4c Mon Sep 17 00:00:00 2001
From: Dingli Zhang <dzhang@openjdk.org>
Date: Sat, 21 Mar 2026 05:36:27 +0000
Subject: [PATCH 285/655] 8380416: Enable CmpUNodeValueTests.java IR tests for
 RISC-V

Reviewed-by: fyang
---
 .../compiler/c2/gvn/CmpUNodeValueTests.java   | 28 +++++++++----------
 1 file changed, 14 insertions(+), 14 deletions(-)

diff --git a/test/hotspot/jtreg/compiler/c2/gvn/CmpUNodeValueTests.java b/test/hotspot/jtreg/compiler/c2/gvn/CmpUNodeValueTests.java
index cbcbda3422f..2df74e52971 100644
--- a/test/hotspot/jtreg/compiler/c2/gvn/CmpUNodeValueTests.java
+++ b/test/hotspot/jtreg/compiler/c2/gvn/CmpUNodeValueTests.java
@@ -99,7 +99,7 @@ public class CmpUNodeValueTests {
     }
 
     @Test
-    @IR(applyIfPlatformOr = {"x64", "true", "aarch64", "true"}, counts = {IRNode.CMP_U, "1"})
+    @IR(applyIfPlatformOr = {"x64", "true", "aarch64", "true", "riscv64", "true"}, counts = {IRNode.CMP_U, "1"})
     int testIntControl(boolean b1, boolean b2) {
         int v1 = b1 ? 1 : -1;
         int v2 = b2 ? 1 : 0;
@@ -107,7 +107,7 @@ public class CmpUNodeValueTests {
     }
 
     @Test
-    @IR(applyIfPlatformOr = {"x64", "true", "aarch64", "true"}, failOn = {IRNode.CMP_U, IRNode.CALL})
+    @IR(applyIfPlatformOr = {"x64", "true", "aarch64", "true", "riscv64", "true"}, failOn = {IRNode.CMP_U, IRNode.CALL})
     int testIntLT(int x) {
         int v1 = x & Integer.MAX_VALUE; // Unset the highest bit, make v1 non-negative
         int v2 = Integer.MIN_VALUE;
@@ -115,7 +115,7 @@ public class CmpUNodeValueTests {
     }
 
     @Test
-    @IR(applyIfPlatformOr = {"x64", "true", "aarch64", "true"}, failOn = {IRNode.CMP_U, IRNode.CALL})
+    @IR(applyIfPlatformOr = {"x64", "true", "aarch64", "true", "riscv64", "true"}, failOn = {IRNode.CMP_U, IRNode.CALL})
     int testIntLE(boolean b1, boolean b2) {
         int v1 = b1 ? 2 : 0;
         int v2 = b2 ? -1 : 2;
@@ -123,7 +123,7 @@ public class CmpUNodeValueTests {
     }
 
     @Test
-    @IR(applyIfPlatformOr = {"x64", "true", "aarch64", "true"}, failOn = {IRNode.CMP_U, IRNode.CALL})
+    @IR(applyIfPlatformOr = {"x64", "true", "aarch64", "true", "riscv64", "true"}, failOn = {IRNode.CMP_U, IRNode.CALL})
     int testIntGT(boolean b1, boolean b2) {
         int v1 = b1 ? Integer.MIN_VALUE : Integer.MAX_VALUE;
         int v2 = b2 ? 0 : 2;
@@ -131,7 +131,7 @@ public class CmpUNodeValueTests {
     }
 
     @Test
-    @IR(applyIfPlatformOr = {"x64", "true", "aarch64", "true"}, failOn = {IRNode.CMP_U, IRNode.CALL})
+    @IR(applyIfPlatformOr = {"x64", "true", "aarch64", "true", "riscv64", "true"}, failOn = {IRNode.CMP_U, IRNode.CALL})
     int testIntGE(int x, int y) {
         int v1 = x | Integer.MIN_VALUE; // Set the highest bit, make v1 negative
         int v2 = y & Integer.MAX_VALUE; // Unset the highest bit, make v2 non-negative
@@ -139,13 +139,13 @@ public class CmpUNodeValueTests {
     }
 
     @Test
-    @IR(applyIfPlatformOr = {"x64", "true", "aarch64", "true"}, failOn = {IRNode.CMP_U, IRNode.CALL})
+    @IR(applyIfPlatformOr = {"x64", "true", "aarch64", "true", "riscv64", "true"}, failOn = {IRNode.CMP_U, IRNode.CALL})
     int testIntEQ() {
         return Integer.compareUnsigned(oneInline(), 1) == 0 ? 0 : one();
     }
 
     @Test
-    @IR(applyIfPlatformOr = {"x64", "true", "aarch64", "true"}, failOn = {IRNode.CMP_U, IRNode.CALL})
+    @IR(applyIfPlatformOr = {"x64", "true", "aarch64", "true", "riscv64", "true"}, failOn = {IRNode.CMP_U, IRNode.CALL})
     int testIntNE(boolean b1, boolean b2) {
         int v1 = b1 ? 1 : -1;
         int v2 = b2 ? 0 : 2;
@@ -153,7 +153,7 @@ public class CmpUNodeValueTests {
     }
 
     @Test
-    @IR(applyIfPlatformOr = {"x64", "true", "aarch64", "true"}, counts = {IRNode.CMP_UL, "1"})
+    @IR(applyIfPlatformOr = {"x64", "true", "aarch64", "true", "riscv64", "true"}, counts = {IRNode.CMP_UL, "1"})
     int testLongControl(boolean b1, boolean b2) {
         long v1 = b1 ? 1 : -1;
         long v2 = b2 ? 1 : 0;
@@ -162,7 +162,7 @@ public class CmpUNodeValueTests {
 
 
     @Test
-    @IR(applyIfPlatformOr = {"x64", "true", "aarch64", "true"}, failOn = {IRNode.CMP_UL, IRNode.CALL})
+    @IR(applyIfPlatformOr = {"x64", "true", "aarch64", "true", "riscv64", "true"}, failOn = {IRNode.CMP_UL, IRNode.CALL})
     int testLongLT(int x, boolean b2) {
         long v1 = Integer.toUnsignedLong(x);
         long v2 = Integer.MIN_VALUE;
@@ -170,7 +170,7 @@ public class CmpUNodeValueTests {
     }
 
     @Test
-    @IR(applyIfPlatformOr = {"x64", "true", "aarch64", "true"}, failOn = {IRNode.CMP_UL, IRNode.CALL})
+    @IR(applyIfPlatformOr = {"x64", "true", "aarch64", "true", "riscv64", "true"}, failOn = {IRNode.CMP_UL, IRNode.CALL})
     int testLongLE(boolean b1, boolean b2) {
         long v1 = b1 ? 2 : 0;
         long v2 = b2 ? -1 : 2;
@@ -178,7 +178,7 @@ public class CmpUNodeValueTests {
     }
 
     @Test
-    @IR(applyIfPlatformOr = {"x64", "true", "aarch64", "true"}, failOn = {IRNode.CMP_UL, IRNode.CALL})
+    @IR(applyIfPlatformOr = {"x64", "true", "aarch64", "true", "riscv64", "true"}, failOn = {IRNode.CMP_UL, IRNode.CALL})
     int testLongGT(boolean b1, boolean b2) {
         long v1 = b1 ? Long.MIN_VALUE : Long.MAX_VALUE;
         long v2 = b2 ? 0 : 2;
@@ -186,7 +186,7 @@ public class CmpUNodeValueTests {
     }
 
     @Test
-    @IR(applyIfPlatformOr = {"x64", "true", "aarch64", "true"}, failOn = {IRNode.CMP_UL, IRNode.CALL})
+    @IR(applyIfPlatformOr = {"x64", "true", "aarch64", "true", "riscv64", "true"}, failOn = {IRNode.CMP_UL, IRNode.CALL})
     int testLongGE(int x, int y) {
         long v1 = x | Long.MIN_VALUE; // Set the highest bit, make v1 negative
         long v2 = y & Long.MAX_VALUE; // Unset the highest bit, make v2 non-negative
@@ -194,13 +194,13 @@ public class CmpUNodeValueTests {
     }
 
     @Test
-    @IR(applyIfPlatformOr = {"x64", "true", "aarch64", "true"}, failOn = {IRNode.CMP_UL, IRNode.CALL})
+    @IR(applyIfPlatformOr = {"x64", "true", "aarch64", "true", "riscv64", "true"}, failOn = {IRNode.CMP_UL, IRNode.CALL})
     int testLongEQ() {
         return Long.compareUnsigned(oneInline(), 1L) == 0 ? 0 : one();
     }
 
     @Test
-    @IR(applyIfPlatformOr = {"x64", "true", "aarch64", "true"}, failOn = {IRNode.CMP_UL, IRNode.CALL})
+    @IR(applyIfPlatformOr = {"x64", "true", "aarch64", "true", "riscv64", "true"}, failOn = {IRNode.CMP_UL, IRNode.CALL})
     int testLongNE(boolean b1, boolean b2) {
         long v1 = b1 ? 1 : -1;
         long v2 = b2 ? 0 : 2;

From 2cdf61795206675fdfd056d720f181ad45929d4e Mon Sep 17 00:00:00 2001
From: Guanqiang Han <ghan@openjdk.org>
Date: Sat, 21 Mar 2026 07:50:03 +0000
Subject: [PATCH 286/655] 8372649: C2 compilation fails with "there should be
 an oop in OopMap instead of a live raw oop at safepoint"

Reviewed-by: qamai, chagedorn
---
 src/hotspot/share/opto/output.cpp             |  25 ++++-
 ...heckCastPPRawOopSchedulingAtSafepoint.java | 103 ++++++++++++++++++
 2 files changed, 122 insertions(+), 6 deletions(-)
 create mode 100644 test/hotspot/jtreg/compiler/codegen/TestCheckCastPPRawOopSchedulingAtSafepoint.java

diff --git a/src/hotspot/share/opto/output.cpp b/src/hotspot/share/opto/output.cpp
index edfd6189fb9..a70620fac5b 100644
--- a/src/hotspot/share/opto/output.cpp
+++ b/src/hotspot/share/opto/output.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1998, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1998, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -2914,17 +2914,30 @@ void Scheduling::ComputeRegisterAntidependencies(Block *b) {
 
     Node *m = b->get_node(i);
 
-    // Add precedence edge from following safepoint to use of derived pointer
-    if( last_safept_node != end_node &&
+    if (last_safept_node != end_node &&
         m != last_safept_node) {
+      bool need_safept_prec = false;
+      // Add precedence edge from following safepoint to use of derived pointer
       for (uint k = 1; k < m->req(); k++) {
         const Type *t = m->in(k)->bottom_type();
-        if( t->isa_oop_ptr() &&
-            t->is_ptr()->offset() != 0 ) {
-          last_safept_node->add_prec( m );
+        if (t->isa_oop_ptr() &&
+            t->is_ptr()->offset() != 0) {
+          need_safept_prec = true;
           break;
         }
       }
+      // A CheckCastPP whose input is still RawPtr must stay above the following safepoint.
+      // Otherwise post-regalloc block-local scheduling can leave a live raw oop at the safepoint.
+      if (!need_safept_prec && m->is_Mach() &&
+          m->as_Mach()->ideal_Opcode() == Op_CheckCastPP) {
+        Node* def = m->in(1);
+        if (def != nullptr && def->bottom_type()->base() == Type::RawPtr) {
+          need_safept_prec = true;
+        }
+      }
+      if (need_safept_prec) {
+        last_safept_node->add_prec(m);
+      }
     }
 
     if( n->jvms() ) {           // Precedence edge from derived to safept
diff --git a/test/hotspot/jtreg/compiler/codegen/TestCheckCastPPRawOopSchedulingAtSafepoint.java b/test/hotspot/jtreg/compiler/codegen/TestCheckCastPPRawOopSchedulingAtSafepoint.java
new file mode 100644
index 00000000000..00ba4be76f8
--- /dev/null
+++ b/test/hotspot/jtreg/compiler/codegen/TestCheckCastPPRawOopSchedulingAtSafepoint.java
@@ -0,0 +1,103 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+/*
+ * @test
+ * @bug 8372649 8376189
+ * @summary CheckCastPP with RawPtr input can be scheduled below a safepoint during C2
+ *          post-regalloc block-local scheduling, causing a live raw oop at the safepoint
+ *          instead of a corresponding oop in the OopMap.
+ * @library /test/lib
+ * @modules jdk.incubator.vector
+ * @run main/othervm -Xcomp -XX:-TieredCompilation -XX:TrackedInitializationLimit=0
+ *                   -XX:CompileCommand=compileonly,${test.main.class}::test8372649
+ *                   -XX:+OptoScheduling ${test.main.class} 8372649
+ * @run main/othervm --add-modules=jdk.incubator.vector
+ *                   -XX:+OptoScheduling ${test.main.class} 8376189
+ */
+
+package compiler.codegen;
+
+import jdk.incubator.vector.*;
+import jdk.test.lib.Asserts;
+
+public class TestCheckCastPPRawOopSchedulingAtSafepoint {
+    private static final VectorSpecies<Integer> SPECIES_I = IntVector.SPECIES_64;
+
+    static public void main(String[] args) {
+        String mode = args[0];
+        if ("8372649".equals(mode)) {
+            run8372649();
+        } else if ("8376189".equals(mode)) {
+            run8376189();
+        }
+    }
+
+    // JDK-8372649
+    static void run8372649(){
+        for (int j = 6; 116 > j; ++j) {
+            test8372649();
+        }
+        Asserts.assertEQ(Test.c, 43560L);
+    }
+
+    static class Test {
+        static int a = 256;
+        float[] b = new float[256];
+        static long c;
+    }
+
+    static void test8372649() {
+        float[][] g = new float[Test.a][Test.a];
+        for (int d = 7; d < 16; d++) {
+            long e = 1;
+            do {
+                g[d][(int) e] = d;
+                synchronized (new Test()) {}
+            } while (++e < 5);
+        }
+        for (int i = 0; i < Test.a; ++i) {
+            for (int j = 0; j < Test.a ; ++j) {
+                Test.c += g[i][j];
+            }
+        }
+    }
+
+    // JDK-8376189
+    static void run8376189(){
+        int[] a = new int[10_000];
+        int r = 0;
+        for (int i = 0; i < 10_000; i++) {
+            r = test8376189(a);
+        }
+        Asserts.assertEQ(r, 0);
+    }
+
+    public static int test8376189(int[] a) {
+        var mins = IntVector.broadcast(SPECIES_I, a[0]);
+        for (int i = 0; i < SPECIES_I.loopBound(a.length); i += SPECIES_I.length()) {
+            mins = IntVector.fromArray(SPECIES_I, a, 0);
+        }
+        return mins.reduceLanes(VectorOperators.MIN);
+    }
+}
\ No newline at end of file

From e042467ed2afd6c70fb5fa1ce98cae27f7d9e85b Mon Sep 17 00:00:00 2001
From: Afshin Zafari <azafari@openjdk.org>
Date: Sun, 22 Mar 2026 12:56:27 +0000
Subject: [PATCH 287/655] 8378440: ASAN build fails on Windows due to missing
 dlfcn.h file

Reviewed-by: stuefe
---
 src/hotspot/share/sanitizers/address.cpp | 8 ++++++++
 1 file changed, 8 insertions(+)

diff --git a/src/hotspot/share/sanitizers/address.cpp b/src/hotspot/share/sanitizers/address.cpp
index 7d129feab0a..26de106ebcb 100644
--- a/src/hotspot/share/sanitizers/address.cpp
+++ b/src/hotspot/share/sanitizers/address.cpp
@@ -30,6 +30,7 @@
 #include "utilities/globalDefinitions.hpp"
 #include "utilities/vmError.hpp"
 
+#ifndef _WINDOWS
 #include <dlfcn.h>
 #include <stdio.h>
 
@@ -118,4 +119,11 @@ void Asan::report(outputStream* st) {
   }
 }
 
+#else // defined windows
+
+void Asan::initialize() {}
+bool Asan::had_error() { return false; }
+void Asan::report(outputStream* st) {}
+#endif // ifndef _WINDOWS
+
 #endif // ADDRESS_SANITIZER

From aba5d31ae73c9ffc9f7f9ab192f91e7e33f5bc66 Mon Sep 17 00:00:00 2001
From: Phil Race <prr@openjdk.org>
Date: Sun, 22 Mar 2026 19:51:45 +0000
Subject: [PATCH 288/655] 8378605: Remove AppContext from the Swing TimerQueue
 implementation

Reviewed-by: psadhukhan, dnguyen
---
 .../share/classes/javax/swing/TimerQueue.java | 25 ++++++-------------
 1 file changed, 8 insertions(+), 17 deletions(-)

diff --git a/src/java.desktop/share/classes/javax/swing/TimerQueue.java b/src/java.desktop/share/classes/javax/swing/TimerQueue.java
index 4ef2769652a..39c06e57479 100644
--- a/src/java.desktop/share/classes/javax/swing/TimerQueue.java
+++ b/src/java.desktop/share/classes/javax/swing/TimerQueue.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1997, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -28,7 +28,7 @@ package javax.swing;
 import java.util.concurrent.*;
 import java.util.concurrent.locks.*;
 import java.util.concurrent.atomic.AtomicLong;
-import sun.awt.AppContext;
+import sun.awt.util.ThreadGroupUtils;
 
 /**
  * Internal class to manage all Timers using one thread.
@@ -40,8 +40,7 @@ import sun.awt.AppContext;
  */
 class TimerQueue implements Runnable
 {
-    private static final Object sharedInstanceKey =
-        new StringBuffer("TimerQueue.sharedInstanceKey");
+    private static volatile TimerQueue sharedInstance;
 
     private final DelayQueue<DelayedTimer> queue;
     private volatile boolean running;
@@ -69,14 +68,10 @@ class TimerQueue implements Runnable
 
     public static TimerQueue sharedInstance() {
         synchronized (classLock) {
-            TimerQueue sharedInst = (TimerQueue)
-                                    SwingUtilities.appContextGet(
-                                                        sharedInstanceKey);
-            if (sharedInst == null) {
-                sharedInst = new TimerQueue();
-                SwingUtilities.appContextPut(sharedInstanceKey, sharedInst);
+            if (sharedInstance == null) {
+                sharedInstance = new TimerQueue();
             }
-            return sharedInst;
+            return sharedInstance;
         }
     }
 
@@ -88,9 +83,10 @@ class TimerQueue implements Runnable
                 return;
             }
             try {
-                final ThreadGroup threadGroup = AppContext.getAppContext().getThreadGroup();
+                final ThreadGroup threadGroup = ThreadGroupUtils.getRootThreadGroup();
                 String name = "TimerQueue";
                 Thread timerThread = new Thread(threadGroup, this, name, 0, false);
+                timerThread.setContextClassLoader(null);
                 timerThread.setDaemon(true);
                 timerThread.setPriority(Thread.NORM_PRIORITY);
                 timerThread.start();
@@ -183,11 +179,6 @@ class TimerQueue implements Runnable
                         timer.getLock().unlock();
                     }
                 } catch (InterruptedException ie) {
-                    // Shouldn't ignore InterruptedExceptions here, so AppContext
-                    // is disposed gracefully, see 6799345 for details
-                    if (AppContext.getAppContext().isDisposed()) {
-                        break;
-                    }
                 }
             }
         } finally {

From fae345c6cf513d39d21f35826f8a82d125da2053 Mon Sep 17 00:00:00 2001
From: Phil Race <prr@openjdk.org>
Date: Sun, 22 Mar 2026 19:53:43 +0000
Subject: [PATCH 289/655] 8378918: Remove AppContext from some DnD classes

Reviewed-by: serb, dnguyen
---
 .../plaf/basic/DragRecognitionSupport.java      | 17 +++++------------
 .../sun/awt/dnd/SunDragSourceContextPeer.java   | 11 ++++-------
 .../sun/awt/dnd/SunDropTargetContextPeer.java   |  6 ++----
 3 files changed, 11 insertions(+), 23 deletions(-)

diff --git a/src/java.desktop/share/classes/javax/swing/plaf/basic/DragRecognitionSupport.java b/src/java.desktop/share/classes/javax/swing/plaf/basic/DragRecognitionSupport.java
index abdd460e44b..517dad35d45 100644
--- a/src/java.desktop/share/classes/javax/swing/plaf/basic/DragRecognitionSupport.java
+++ b/src/java.desktop/share/classes/javax/swing/plaf/basic/DragRecognitionSupport.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2005, 2008, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2005, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -29,14 +29,12 @@ import java.awt.event.*;
 import java.awt.dnd.DragSource;
 import javax.swing.*;
 import sun.awt.dnd.SunDragSourceContextPeer;
-import sun.awt.AppContext;
 
 /**
  * Drag gesture recognition support for classes that have a
  * <code>TransferHandler</code>. The gesture for a drag in this class is a mouse
  * press followed by movement by <code>DragSource.getDragThreshold()</code>
- * pixels. An instance of this class is maintained per AppContext, and the
- * public static methods call into the appropriate instance.
+ * pixels.
  *
  * @author Shannon Hickey
  */
@@ -53,19 +51,14 @@ class DragRecognitionSupport {
         public void dragStarting(MouseEvent me);
     }
 
+    private static DragRecognitionSupport support;
     /**
-     * Returns the DragRecognitionSupport for the caller's AppContext.
+     * Returns the DragRecognitionSupport instance.
      */
-    private static DragRecognitionSupport getDragRecognitionSupport() {
-        DragRecognitionSupport support =
-            (DragRecognitionSupport)AppContext.getAppContext().
-                get(DragRecognitionSupport.class);
-
+    private static synchronized DragRecognitionSupport getDragRecognitionSupport() {
         if (support == null) {
             support = new DragRecognitionSupport();
-            AppContext.getAppContext().put(DragRecognitionSupport.class, support);
         }
-
         return support;
     }
 
diff --git a/src/java.desktop/share/classes/sun/awt/dnd/SunDragSourceContextPeer.java b/src/java.desktop/share/classes/sun/awt/dnd/SunDragSourceContextPeer.java
index 258cebd6616..4aad70961bc 100644
--- a/src/java.desktop/share/classes/sun/awt/dnd/SunDragSourceContextPeer.java
+++ b/src/java.desktop/share/classes/sun/awt/dnd/SunDragSourceContextPeer.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2000, 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2000, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -264,8 +264,7 @@ public abstract class SunDragSourceContextPeer implements DragSourceContextPeer
                                     modifiers, x, y);
         EventDispatcher dispatcher = new EventDispatcher(dispatchType, event);
 
-        SunToolkit.invokeLaterOnAppContext(
-            SunToolkit.targetToAppContext(getComponent()), dispatcher);
+        SunToolkit.invokeLater(dispatcher);
 
         startSecondaryEventLoop();
     }
@@ -310,8 +309,7 @@ public abstract class SunDragSourceContextPeer implements DragSourceContextPeer
         EventDispatcher dispatcher =
             new EventDispatcher(DISPATCH_EXIT, event);
 
-        SunToolkit.invokeLaterOnAppContext(
-            SunToolkit.targetToAppContext(getComponent()), dispatcher);
+        SunToolkit.invokeLater(dispatcher);
 
         startSecondaryEventLoop();
     }
@@ -341,8 +339,7 @@ public abstract class SunDragSourceContextPeer implements DragSourceContextPeer
         EventDispatcher dispatcher =
             new EventDispatcher(DISPATCH_FINISH, event);
 
-        SunToolkit.invokeLaterOnAppContext(
-            SunToolkit.targetToAppContext(getComponent()), dispatcher);
+        SunToolkit.invokeLater(dispatcher);
 
         startSecondaryEventLoop();
         setNativeContext(0);
diff --git a/src/java.desktop/share/classes/sun/awt/dnd/SunDropTargetContextPeer.java b/src/java.desktop/share/classes/sun/awt/dnd/SunDropTargetContextPeer.java
index 686c3166441..70d1bda9cd0 100644
--- a/src/java.desktop/share/classes/sun/awt/dnd/SunDropTargetContextPeer.java
+++ b/src/java.desktop/share/classes/sun/awt/dnd/SunDropTargetContextPeer.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2000, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2000, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -55,7 +55,6 @@ import sun.util.logging.PlatformLogger;
 import java.io.IOException;
 import java.io.InputStream;
 
-import sun.awt.AppContext;
 import sun.awt.SunToolkit;
 import sun.awt.datatransfer.DataTransferer;
 import sun.awt.datatransfer.ToolkitThreadBlockedHandler;
@@ -558,7 +557,6 @@ public abstract class SunDropTargetContextPeer implements DropTargetContextPeer,
                                       final long nativeCtxt,
                                       final int eventID,
                                       final boolean dispatchType) {
-        AppContext appContext = SunToolkit.targetToAppContext(component);
 
         EventDispatcher dispatcher =
             new EventDispatcher(this, dropAction, actions, formats, nativeCtxt,
@@ -572,7 +570,7 @@ public abstract class SunDropTargetContextPeer implements DropTargetContextPeer,
         }
 
         // schedule callback
-        SunToolkit.postEvent(appContext, event);
+        SunToolkit.postEvent(event);
 
         eventPosted(event);
 

From d64ea294f716fbbe09f8dea32b7512f48484d539 Mon Sep 17 00:00:00 2001
From: Phil Race <prr@openjdk.org>
Date: Sun, 22 Mar 2026 19:54:01 +0000
Subject: [PATCH 290/655] 8378919: Remove AppContext from the java.awt.Desktop
 class

Reviewed-by: serb, dnguyen
---
 src/java.desktop/share/classes/java/awt/Desktop.java | 8 +++-----
 1 file changed, 3 insertions(+), 5 deletions(-)

diff --git a/src/java.desktop/share/classes/java/awt/Desktop.java b/src/java.desktop/share/classes/java/awt/Desktop.java
index 3f73fa6cd81..43bd1f9c11c 100644
--- a/src/java.desktop/share/classes/java/awt/Desktop.java
+++ b/src/java.desktop/share/classes/java/awt/Desktop.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2005, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2005, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -272,6 +272,8 @@ public class Desktop {
         }
     }
 
+    private static Desktop desktop;
+
     /**
      * Returns the {@code Desktop} instance of the current
      * desktop context. On some platforms the Desktop API may not be
@@ -292,12 +294,8 @@ public class Desktop {
                                                     "supported on the current platform");
         }
 
-        sun.awt.AppContext context = sun.awt.AppContext.getAppContext();
-        Desktop desktop = (Desktop)context.get(Desktop.class);
-
         if (desktop == null) {
             desktop = new Desktop();
-            context.put(Desktop.class, desktop);
         }
 
         return desktop;

From a26d61312eaa3faf20db86d7378c4bdec42275ac Mon Sep 17 00:00:00 2001
From: Phil Race <prr@openjdk.org>
Date: Sun, 22 Mar 2026 19:54:22 +0000
Subject: [PATCH 291/655] 8378898: Remove AppContext from
 sun/awt/windows/WWindowPeer.java

Reviewed-by: dnguyen, serb
---
 .../classes/sun/awt/windows/WWindowPeer.java  | 112 +++---------------
 1 file changed, 18 insertions(+), 94 deletions(-)

diff --git a/src/java.desktop/windows/classes/sun/awt/windows/WWindowPeer.java b/src/java.desktop/windows/classes/sun/awt/windows/WWindowPeer.java
index f678be9f1ab..f028e0fbec5 100644
--- a/src/java.desktop/windows/classes/sun/awt/windows/WWindowPeer.java
+++ b/src/java.desktop/windows/classes/sun/awt/windows/WWindowPeer.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1996, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1996, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -56,7 +56,6 @@ import java.util.LinkedList;
 import java.util.List;
 
 import sun.awt.AWTAccessor;
-import sun.awt.AppContext;
 import sun.awt.DisplayChangedListener;
 import sun.awt.SunToolkit;
 import sun.awt.TimedWindowEvent;
@@ -84,26 +83,12 @@ public class WWindowPeer extends WPanelPeer implements WindowPeer,
     private TranslucentWindowPainter painter;
 
     /*
-     * A key used for storing a list of active windows in AppContext. The value
-     * is a list of windows, sorted by the time of activation: later a window is
-     * activated, greater its index is in the list.
-     */
-    private static final StringBuffer ACTIVE_WINDOWS_KEY =
-        new StringBuffer("active_windows_list");
-
-    /*
-     * Listener for 'activeWindow' KFM property changes. It is added to each
-     * AppContext KFM. See ActiveWindowListener inner class below.
+     * Listener for 'activeWindow' KFM property changes.
+     * See ActiveWindowListener inner class below.
      */
     private static PropertyChangeListener activeWindowListener =
         new ActiveWindowListener();
 
-    /*
-     * The object is a listener for the AppContext.GUI_DISPOSED property.
-     */
-    private static final PropertyChangeListener guiDisposedListener =
-        new GuiDisposedListener();
-
     /*
      * Called (on the Toolkit thread) before the appropriate
      * WindowStateEvent is posted to the EventQueue.
@@ -116,18 +101,17 @@ public class WWindowPeer extends WPanelPeer implements WindowPeer,
     private static native void initIDs();
     static {
         initIDs();
+        KeyboardFocusManager kfm = KeyboardFocusManager.getCurrentKeyboardFocusManager();
+        kfm.addPropertyChangeListener("activeWindow", activeWindowListener);
     }
 
+    static List<WWindowPeer> activeWindows = new LinkedList<WWindowPeer>();
     // WComponentPeer overrides
     @Override
     @SuppressWarnings("unchecked")
     protected void disposeImpl() {
-        AppContext appContext = SunToolkit.targetToAppContext(target);
-        synchronized (appContext) {
-            List<WWindowPeer> l = (List<WWindowPeer>)appContext.get(ACTIVE_WINDOWS_KEY);
-            if (l != null) {
-                l.remove(this);
-            }
+        synchronized (activeWindows) {
+            activeWindows.remove(this);
         }
 
         // Remove ourself from the Map of DisplayChangeListeners
@@ -222,8 +206,6 @@ public class WWindowPeer extends WPanelPeer implements WindowPeer,
         Win32GraphicsDevice gd = (Win32GraphicsDevice) gc.getDevice();
         gd.addDisplayChangedListener(this);
 
-        initActiveWindowsTracking((Window)target);
-
         updateIconImages();
 
         Shape shape = ((Window)target).getShape();
@@ -530,22 +512,15 @@ public class WWindowPeer extends WPanelPeer implements WindowPeer,
     native void modalEnable(Dialog blocker);
 
     /*
-     * Returns all the ever active windows from the current AppContext.
+     * Returns all the active windows.
      * The list is sorted by the time of activation, so the latest
      * active window is always at the end.
      */
-    @SuppressWarnings("unchecked")
     public static long[] getActiveWindowHandles(Component target) {
-        AppContext appContext = SunToolkit.targetToAppContext(target);
-        if (appContext == null) return null;
-        synchronized (appContext) {
-            List<WWindowPeer> l = (List<WWindowPeer>)appContext.get(ACTIVE_WINDOWS_KEY);
-            if (l == null) {
-                return null;
-            }
-            long[] result = new long[l.size()];
-            for (int j = 0; j < l.size(); j++) {
-                result[j] = l.get(j).getHWnd();
+        synchronized (activeWindows) {
+            long[] result = new long[activeWindows.size()];
+            for (int j = 0; j < activeWindows.size(); j++) {
+                result[j] = activeWindows.get(j).getHWnd();
             }
             return result;
         }
@@ -823,58 +798,11 @@ public class WWindowPeer extends WPanelPeer implements WindowPeer,
         }
     }
 
-    /*
-     * The method maps the list of the active windows to the window's AppContext,
-     * then the method registers ActiveWindowListener, GuiDisposedListener listeners;
-     * it executes the initilialization only once per AppContext.
-     */
-    @SuppressWarnings("unchecked")
-    private static void initActiveWindowsTracking(Window w) {
-        AppContext appContext = AppContext.getAppContext();
-        synchronized (appContext) {
-            List<WWindowPeer> l = (List<WWindowPeer>)appContext.get(ACTIVE_WINDOWS_KEY);
-            if (l == null) {
-                l = new LinkedList<WWindowPeer>();
-                appContext.put(ACTIVE_WINDOWS_KEY, l);
-                appContext.addPropertyChangeListener(AppContext.GUI_DISPOSED, guiDisposedListener);
-
-                KeyboardFocusManager kfm = KeyboardFocusManager.getCurrentKeyboardFocusManager();
-                kfm.addPropertyChangeListener("activeWindow", activeWindowListener);
-            }
-        }
-    }
-
-    /*
-     * The GuiDisposedListener class listens for the AppContext.GUI_DISPOSED property,
-     * it removes the list of the active windows from the disposed AppContext and
-     * unregisters ActiveWindowListener listener.
-     */
-    private static final class GuiDisposedListener implements PropertyChangeListener {
-        @Override
-        public void propertyChange(PropertyChangeEvent e) {
-            boolean isDisposed = (Boolean)e.getNewValue();
-            if (isDisposed != true) {
-                if (log.isLoggable(PlatformLogger.Level.FINE)) {
-                    log.fine(" Assertion (newValue != true) failed for AppContext.GUI_DISPOSED ");
-                }
-            }
-            AppContext appContext = AppContext.getAppContext();
-            synchronized (appContext) {
-                appContext.remove(ACTIVE_WINDOWS_KEY);
-                appContext.removePropertyChangeListener(AppContext.GUI_DISPOSED, this);
-
-                KeyboardFocusManager kfm = KeyboardFocusManager.getCurrentKeyboardFocusManager();
-                kfm.removePropertyChangeListener("activeWindow", activeWindowListener);
-            }
-        }
-    }
-
     /*
      * Static inner class, listens for 'activeWindow' KFM property changes and
-     * updates the list of active windows per AppContext, so the latest active
-     * window is always at the end of the list. The list is stored in AppContext.
+     * updates the list of active windows so the latest active
+     * window is always at the end of the list.
      */
-    @SuppressWarnings("unchecked")
     private static final class ActiveWindowListener implements PropertyChangeListener {
         @Override
         public void propertyChange(PropertyChangeEvent e) {
@@ -882,15 +810,11 @@ public class WWindowPeer extends WPanelPeer implements WindowPeer,
             if (w == null) {
                 return;
             }
-            AppContext appContext = SunToolkit.targetToAppContext(w);
-            synchronized (appContext) {
+            synchronized (activeWindows) {
                 WWindowPeer wp = AWTAccessor.getComponentAccessor().getPeer(w);
                 // add/move wp to the end of the list
-                List<WWindowPeer> l = (List<WWindowPeer>)appContext.get(ACTIVE_WINDOWS_KEY);
-                if (l != null) {
-                    l.remove(wp);
-                    l.add(wp);
-                }
+                 activeWindows.remove(wp);
+                 activeWindows.add(wp);
             }
         }
     }

From ea464b1405f05963e5a1fa2fb27427935cad7f70 Mon Sep 17 00:00:00 2001
From: Phil Race <prr@openjdk.org>
Date: Sun, 22 Mar 2026 19:55:47 +0000
Subject: [PATCH 292/655] 8379018: Remove AppContext from two input method
 related classes

Reviewed-by: serb, dnguyen, kizune
---
 .../java/awt/event/InputMethodEvent.java      |   6 +-
 .../awt/im/ExecutableInputMethodManager.java  |   6 +-
 test/jdk/java/awt/im/8041990/bug8041990.java  | 106 ------------------
 3 files changed, 4 insertions(+), 114 deletions(-)
 delete mode 100644 test/jdk/java/awt/im/8041990/bug8041990.java

diff --git a/src/java.desktop/share/classes/java/awt/event/InputMethodEvent.java b/src/java.desktop/share/classes/java/awt/event/InputMethodEvent.java
index 12ad1a03171..429d0b819f4 100644
--- a/src/java.desktop/share/classes/java/awt/event/InputMethodEvent.java
+++ b/src/java.desktop/share/classes/java/awt/event/InputMethodEvent.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1997, 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -37,7 +37,6 @@ import java.text.AttributedCharacterIterator;
 import java.text.CharacterIterator;
 
 import sun.awt.AWTAccessor;
-import sun.awt.AppContext;
 import sun.awt.SunToolkit;
 
 /**
@@ -444,8 +443,7 @@ public class InputMethodEvent extends AWTEvent {
             // throw the IllegalArgumentException to conform to EventObject spec
             throw new IllegalArgumentException("null source");
         }
-        AppContext appContext = SunToolkit.targetToAppContext(source);
-        EventQueue eventQueue = SunToolkit.getSystemEventQueueImplPP(appContext);
+        EventQueue eventQueue = SunToolkit.getSystemEventQueueImplPP();
         return AWTAccessor.getEventQueueAccessor().getMostRecentEventTime(eventQueue);
     }
 }
diff --git a/src/java.desktop/share/classes/sun/awt/im/ExecutableInputMethodManager.java b/src/java.desktop/share/classes/sun/awt/im/ExecutableInputMethodManager.java
index d8246a4947c..f67f560e004 100644
--- a/src/java.desktop/share/classes/sun/awt/im/ExecutableInputMethodManager.java
+++ b/src/java.desktop/share/classes/sun/awt/im/ExecutableInputMethodManager.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1998, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1998, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -35,7 +35,6 @@ import java.awt.PopupMenu;
 import java.awt.Menu;
 import java.awt.MenuItem;
 import java.awt.Toolkit;
-import sun.awt.AppContext;
 import java.awt.event.ActionEvent;
 import java.awt.event.ActionListener;
 import java.awt.event.InvocationEvent;
@@ -177,9 +176,8 @@ class ExecutableInputMethodManager extends InputMethodManager
                                     lock,
                                     true);
 
-        AppContext requesterAppContext = SunToolkit.targetToAppContext(requester);
         synchronized (lock) {
-            SunToolkit.postEvent(requesterAppContext, event);
+            SunToolkit.postEvent(event);
             while (!event.isDispatched()) {
                 lock.wait();
             }
diff --git a/test/jdk/java/awt/im/8041990/bug8041990.java b/test/jdk/java/awt/im/8041990/bug8041990.java
deleted file mode 100644
index c5ddbac42ba..00000000000
--- a/test/jdk/java/awt/im/8041990/bug8041990.java
+++ /dev/null
@@ -1,106 +0,0 @@
-/*
- * Copyright (c) 2014, 2025, Oracle and/or its affiliates. All rights reserved.
- * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
- *
- * This code is free software; you can redistribute it and/or modify it
- * under the terms of the GNU General Public License version 2 only, as
- * published by the Free Software Foundation.
- *
- * This code is distributed in the hope that it will be useful, but WITHOUT
- * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
- * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
- * version 2 for more details (a copy is included in the LICENSE file that
- * accompanied this code).
- *
- * You should have received a copy of the GNU General Public License version
- * 2 along with this work; if not, write to the Free Software Foundation,
- * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
- *
- * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
- * or visit www.oracle.com if you need additional information or have any
- * questions.
- */
-
-
-/**
- * @test
- * @key headful
- * @bug 8041990
- * @summary Language specific keys does not work in non-default AppContexts of top-level windows
- * @author Petr Pchelko
- * @modules java.desktop/sun.awt
- */
-
-import sun.awt.SunToolkit;
-
-import javax.swing.*;
-import java.awt.*;
-import java.awt.event.InputMethodEvent;
-import java.awt.font.TextHitInfo;
-import java.text.AttributedString;
-import java.util.concurrent.CountDownLatch;
-import java.util.concurrent.atomic.AtomicReference;
-
-public class bug8041990 {
-    private static JFrame frame;
-    private static JComponent component;
-
-    public static void main(String[] args) throws Exception {
-        ThreadGroup stubTG = new ThreadGroup(getRootThreadGroup(), "Stub Thread Group");
-        ThreadGroup swingTG = new ThreadGroup(getRootThreadGroup(), "SwingTG");
-        try {
-            Thread stubThread = new Thread(stubTG, SunToolkit::createNewAppContext);
-            stubThread.start();
-            stubThread.join();
-
-            CountDownLatch startSwingLatch = new CountDownLatch(1);
-            new Thread(swingTG, () -> {
-                SunToolkit.createNewAppContext();
-                SwingUtilities.invokeLater(() -> {
-                    frame = new JFrame();
-                    component = new JLabel("Test Text");
-                    frame.add(component);
-                    frame.setBounds(100, 100, 100, 100);
-                    frame.setVisible(true);
-                    startSwingLatch.countDown();
-                });
-            }).start();
-            startSwingLatch.await();
-
-            AtomicReference<Exception> caughtException = new AtomicReference<>();
-            Thread checkThread = new Thread(getRootThreadGroup(), () -> {
-                try {
-                    // If the bug is present this will throw exception
-                    new InputMethodEvent(component,
-                            InputMethodEvent.CARET_POSITION_CHANGED,
-                            TextHitInfo.leading(0),
-                            TextHitInfo.trailing(0));
-                } catch (Exception e) {
-                    caughtException.set(e);
-                }
-            });
-            checkThread.start();
-            checkThread.join();
-
-            if (caughtException.get() != null) {
-                throw new RuntimeException("Failed. Caught exception!", caughtException.get());
-            }
-        } finally {
-            new Thread(swingTG, () -> SwingUtilities.invokeLater(() -> {
-                if (frame != null) {
-                    frame.dispose();
-                }
-            })).start();
-        }
-    }
-
-    private static ThreadGroup getRootThreadGroup() {
-        ThreadGroup currentTG = Thread.currentThread().getThreadGroup();
-        ThreadGroup parentTG = currentTG.getParent();
-        while (parentTG != null) {
-            currentTG = parentTG;
-            parentTG = currentTG.getParent();
-        }
-        return currentTG;
-    }
-}

From 88972399e5e940bdd76f9f30fdcca5757b205349 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mar=C3=ADa=20Arias=20de=20Reyna=20Dom=C3=ADnguez?=
 <mariasde@openjdk.org>
Date: Mon, 23 Mar 2026 02:13:38 +0000
Subject: [PATCH 293/655] 8380427: Revert  JDK-8380292Confusing "reverted *"
 messages during training

Reviewed-by: adinn, iklam
---
 src/hotspot/share/oops/constantPool.cpp | 2 +-
 src/hotspot/share/oops/cpCache.cpp      | 6 +++---
 2 files changed, 4 insertions(+), 4 deletions(-)

diff --git a/src/hotspot/share/oops/constantPool.cpp b/src/hotspot/share/oops/constantPool.cpp
index 8d817178d1a..456333efad0 100644
--- a/src/hotspot/share/oops/constantPool.cpp
+++ b/src/hotspot/share/oops/constantPool.cpp
@@ -564,7 +564,7 @@ void ConstantPool::remove_resolved_klass_if_non_deterministic(int cp_index) {
   }
 
   LogStreamHandle(Trace, aot, resolve) log;
-  if (log.is_enabled() && !CDSConfig::is_dumping_preimage_static_archive()) {
+  if (log.is_enabled()) {
     ResourceMark rm;
     log.print("%s klass  CP entry [%3d]: %s %s",
               (can_archive ? "archived" : "reverted"),
diff --git a/src/hotspot/share/oops/cpCache.cpp b/src/hotspot/share/oops/cpCache.cpp
index 4177e4601ef..edb5f6714c0 100644
--- a/src/hotspot/share/oops/cpCache.cpp
+++ b/src/hotspot/share/oops/cpCache.cpp
@@ -450,7 +450,7 @@ void ConstantPoolCache::remove_resolved_field_entries_if_non_deterministic() {
       Symbol* klass_name = cp->klass_name_at(klass_cp_index);
       Symbol* name = cp->uncached_name_ref_at(cp_index);
       Symbol* signature = cp->uncached_signature_ref_at(cp_index);
-      if (resolved && !CDSConfig::is_dumping_preimage_static_archive()) {
+      if (resolved) {
         log.print("%s field  CP entry [%3d]: %s => %s.%s:%s%s%s",
                   (archived ? "archived" : "reverted"),
                   cp_index,
@@ -493,7 +493,7 @@ void ConstantPoolCache::remove_resolved_method_entries_if_non_deterministic() {
       Symbol* name = cp->uncached_name_ref_at(cp_index);
       Symbol* signature = cp->uncached_signature_ref_at(cp_index);
       LogStream ls(lt);
-      if (resolved && !CDSConfig::is_dumping_preimage_static_archive()) {
+      if (resolved) {
         ls.print("%s%s method CP entry [%3d]: %s %s.%s:%s",
                 (archived ? "archived" : "reverted"),
                 (rme->is_resolved(Bytecodes::_invokeinterface) ? " interface" : ""),
@@ -539,7 +539,7 @@ void ConstantPoolCache::remove_resolved_indy_entries_if_non_deterministic() {
       Symbol* bsm_name = cp->uncached_name_ref_at(bsm_ref);
       Symbol* bsm_signature = cp->uncached_signature_ref_at(bsm_ref);
       Symbol* bsm_klass = cp->klass_name_at(cp->uncached_klass_ref_index_at(bsm_ref));
-      if (resolved && !CDSConfig::is_dumping_preimage_static_archive()) {
+      if (resolved) {
         log.print("%s indy   CP entry [%3d]: %s (%d)",
                   (archived ? "archived" : "reverted"),
                   cp_index, cp->pool_holder()->name()->as_C_string(), i);

From a6f59ba1d16a3e6032db393d94c1f6ab9b1c8657 Mon Sep 17 00:00:00 2001
From: Ioi Lam <iklam@openjdk.org>
Date: Mon, 23 Mar 2026 04:35:56 +0000
Subject: [PATCH 294/655] 8378749: Early GC crash with unresolved AOT FMG
 subgraph classes

Reviewed-by: kvn, eosterlund
---
 src/hotspot/share/cds/aotMetaspace.cpp        |  13 +--
 src/hotspot/share/cds/cdsConfig.cpp           |  22 +++-
 src/hotspot/share/cds/dumpTimeClassInfo.hpp   |   9 +-
 src/hotspot/share/cds/filemap.cpp             |  28 ++++-
 src/hotspot/share/cds/heapShared.cpp          | 104 +++---------------
 src/hotspot/share/cds/heapShared.hpp          |  25 +----
 .../classfile/systemDictionaryShared.cpp      |   5 -
 .../classfile/systemDictionaryShared.hpp      |   3 +-
 test/hotspot/jtreg/TEST.groups                |   1 +
 .../cds/appcds/TestZGCWithAOTHeap.java        |   4 +-
 .../appcds/jigsaw/addmods/AddmodsOption.java  |  13 +--
 .../jigsaw/addopens/AddopensOption.java       |  12 +-
 .../appcds/jigsaw/module/ModuleOption.java    |  13 +--
 .../ReplaceCriticalClasses.java               |   3 +-
 14 files changed, 85 insertions(+), 170 deletions(-)

diff --git a/src/hotspot/share/cds/aotMetaspace.cpp b/src/hotspot/share/cds/aotMetaspace.cpp
index 5e75cd72778..76c37194882 100644
--- a/src/hotspot/share/cds/aotMetaspace.cpp
+++ b/src/hotspot/share/cds/aotMetaspace.cpp
@@ -1812,15 +1812,10 @@ MapArchiveResult AOTMetaspace::map_archives(FileMapInfo* static_mapinfo, FileMap
       } else {
         FileMapRegion* r = static_mapinfo->region_at(AOTMetaspace::hp);
         if (r->used() > 0) {
-          if (static_mapinfo->object_streaming_mode()) {
-            AOTMetaspace::report_loading_error("Cannot use CDS heap data.");
-          } else {
-            if (!UseCompressedOops && !AOTMappedHeapLoader::can_map()) {
-              AOTMetaspace::report_loading_error("Cannot use CDS heap data. Selected GC not compatible -XX:-UseCompressedOops");
-            } else {
-              AOTMetaspace::report_loading_error("Cannot use CDS heap data. UseEpsilonGC, UseG1GC, UseSerialGC, UseParallelGC, or UseShenandoahGC are required.");
-            }
-          }
+          AOTMetaspace::report_loading_error("Cannot use CDS heap data.");
+        }
+        if (!CDSConfig::is_dumping_static_archive()) {
+          CDSConfig::stop_using_full_module_graph("No CDS heap data");
         }
       }
     }
diff --git a/src/hotspot/share/cds/cdsConfig.cpp b/src/hotspot/share/cds/cdsConfig.cpp
index d8ae50517fe..9d191bf0121 100644
--- a/src/hotspot/share/cds/cdsConfig.cpp
+++ b/src/hotspot/share/cds/cdsConfig.cpp
@@ -972,17 +972,27 @@ bool CDSConfig::is_loading_heap() {
 }
 
 bool CDSConfig::is_dumping_klass_subgraphs() {
-  if (is_dumping_classic_static_archive() || is_dumping_final_static_archive()) {
+  if (is_dumping_aot_linked_classes()) {
     // KlassSubGraphs (see heapShared.cpp) is a legacy mechanism for archiving oops. It
     // has been superceded by AOT class linking. This feature is used only when
     // AOT class linking is disabled.
-    //
-    // KlassSubGraphs are disabled in the preimage static archive, which contains a very
-    // limited set of oops.
-    return is_dumping_heap() && !is_dumping_aot_linked_classes();
-  } else {
     return false;
   }
+
+  if (is_dumping_preimage_static_archive()) {
+    // KlassSubGraphs are disabled in the preimage static archive, which contains a very
+    // limited set of oops.
+    return false;
+  }
+
+  if (!is_dumping_full_module_graph()) {
+    // KlassSubGraphs cannot be partially disabled. Since some of the KlassSubGraphs
+    // are used for (legacy support) of the archived full module graph, if
+    // is_dumping_full_module_graph() is calse, we must disable all KlassSubGraphs.
+    return false;
+  }
+
+  return is_dumping_heap();
 }
 
 bool CDSConfig::is_using_klass_subgraphs() {
diff --git a/src/hotspot/share/cds/dumpTimeClassInfo.hpp b/src/hotspot/share/cds/dumpTimeClassInfo.hpp
index c2f83b22337..d2de8148bea 100644
--- a/src/hotspot/share/cds/dumpTimeClassInfo.hpp
+++ b/src/hotspot/share/cds/dumpTimeClassInfo.hpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2021, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2021, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -41,7 +41,6 @@ class Symbol;
 class DumpTimeClassInfo: public CHeapObj<mtClass> {
   bool _excluded;
   bool _is_aot_tooling_class;
-  bool _is_early_klass;
   bool _has_checked_exclusion;
 
   class DTLoaderConstraint {
@@ -143,7 +142,6 @@ public:
     _clsfile_crc32 = -1;
     _excluded = false;
     _is_aot_tooling_class = false;
-    _is_early_klass = JvmtiExport::is_early_phase();
     _verifier_constraints = nullptr;
     _verifier_constraint_flags = nullptr;
     _loader_constraints = nullptr;
@@ -219,11 +217,6 @@ public:
     _is_aot_tooling_class = true;
   }
 
-  // Was this class loaded while JvmtiExport::is_early_phase()==true
-  bool is_early_klass() {
-    return _is_early_klass;
-  }
-
   // simple accessors
   void set_excluded()                               { _excluded = true; }
   bool has_checked_exclusion() const                { return _has_checked_exclusion; }
diff --git a/src/hotspot/share/cds/filemap.cpp b/src/hotspot/share/cds/filemap.cpp
index 91fbce701e5..a07f13cefca 100644
--- a/src/hotspot/share/cds/filemap.cpp
+++ b/src/hotspot/share/cds/filemap.cpp
@@ -1535,10 +1535,34 @@ bool FileMapInfo::can_use_heap_region() {
   if (!has_heap_region()) {
     return false;
   }
-  if (!object_streaming_mode() && !Universe::heap()->can_load_archived_objects() && !UseG1GC) {
-    // Incompatible object format
+
+  if (!object_streaming_mode() && !AOTMappedHeapLoader::can_use()) {
+    // Currently this happens only when using ZGC with an AOT cache generated with -XX:-AOTStreamableObjects
+    AOTMetaspace::report_loading_error("CDS heap data cannot be used by the selected GC. "
+                                       "Please choose a different GC or rebuild AOT cache "
+                                       "with -XX:+AOTStreamableObjects");
     return false;
   }
+
+  if (CDSConfig::is_using_aot_linked_classes()) {
+    assert(!JvmtiExport::should_post_class_file_load_hook(), "already checked");
+    assert(CDSConfig::is_using_full_module_graph(), "already checked");
+  } else {
+    if (JvmtiExport::should_post_class_file_load_hook()) {
+      AOTMetaspace::report_loading_error("CDS heap data is disabled because JVMTI ClassFileLoadHook is in use.");
+      return false;
+    }
+    if (!CDSConfig::is_using_full_module_graph()) {
+      if (CDSConfig::is_dumping_final_static_archive()) {
+        // We are loading the preimage static archive, which has no KlassSubGraphs.
+        // See CDSConfig::is_dumping_klass_subgraphs()
+      } else {
+        AOTMetaspace::report_loading_error("CDS heap data is disabled because archived full module graph is not used.");
+        return false;
+      }
+    }
+  }
+
   if (JvmtiExport::should_post_class_file_load_hook() && JvmtiExport::has_early_class_hook_env()) {
     ShouldNotReachHere(); // CDS should have been disabled.
     // The archived objects are mapped at JVM start-up, but we don't know if
diff --git a/src/hotspot/share/cds/heapShared.cpp b/src/hotspot/share/cds/heapShared.cpp
index 8cab56dda8d..708a19e9a7d 100644
--- a/src/hotspot/share/cds/heapShared.cpp
+++ b/src/hotspot/share/cds/heapShared.cpp
@@ -131,17 +131,14 @@ static ArchivableStaticFieldInfo archive_subgraph_entry_fields[] = {
   {"java/lang/module/Configuration",              "EMPTY_CONFIGURATION"},
   {"jdk/internal/math/FDBigInteger",              "archivedCaches"},
 
-#ifndef PRODUCT
-  {nullptr, nullptr}, // Extra slot for -XX:ArchiveHeapTestClass
-#endif
-  {nullptr, nullptr},
-};
-
-// full module graph
-static ArchivableStaticFieldInfo fmg_archive_subgraph_entry_fields[] = {
+  // full module graph support
   {"jdk/internal/loader/ArchivedClassLoaders",    "archivedClassLoaders"},
   {ARCHIVED_BOOT_LAYER_CLASS,                     ARCHIVED_BOOT_LAYER_FIELD},
   {"java/lang/Module$ArchivedData",               "archivedData"},
+
+#ifndef PRODUCT
+  {nullptr, nullptr}, // Extra slot for -XX:ArchiveHeapTestClass
+#endif
   {nullptr, nullptr},
 };
 
@@ -164,8 +161,7 @@ bool HeapShared::is_subgraph_root_class(InstanceKlass* ik) {
   assert(CDSConfig::is_dumping_heap(), "dump-time only");
   if (CDSConfig::is_dumping_klass_subgraphs()) {
     // Legacy CDS archive support (to be deprecated)
-    return is_subgraph_root_class_of(archive_subgraph_entry_fields, ik) ||
-           is_subgraph_root_class_of(fmg_archive_subgraph_entry_fields, ik);
+    return is_subgraph_root_class_of(archive_subgraph_entry_fields, ik);
   } else {
     return false;
   }
@@ -925,7 +921,7 @@ void HeapShared::start_scanning_for_oops() {
 
     // The special subgraph doesn't belong to any class. We use Object_klass() here just
     // for convenience.
-    _dump_time_special_subgraph = init_subgraph_info(vmClasses::Object_klass(), false);
+    _dump_time_special_subgraph = init_subgraph_info(vmClasses::Object_klass());
 
     // Cache for recording where the archived objects are copied to
     create_archived_object_cache();
@@ -1003,12 +999,7 @@ void HeapShared::archive_subgraphs() {
   assert(CDSConfig::is_dumping_heap(), "must be");
 
   if (CDSConfig::is_dumping_klass_subgraphs()) {
-    archive_object_subgraphs(archive_subgraph_entry_fields,
-                             false /* is_full_module_graph */);
-    if (CDSConfig::is_dumping_full_module_graph()) {
-      archive_object_subgraphs(fmg_archive_subgraph_entry_fields,
-                               true /* is_full_module_graph */);
-    }
+    archive_object_subgraphs(archive_subgraph_entry_fields);
   }
 }
 
@@ -1021,12 +1012,11 @@ HeapShared::RunTimeKlassSubGraphInfoTable   HeapShared::_run_time_subgraph_info_
 // Get the subgraph_info for Klass k. A new subgraph_info is created if
 // there is no existing one for k. The subgraph_info records the "buffered"
 // address of the class.
-KlassSubGraphInfo* HeapShared::init_subgraph_info(Klass* k, bool is_full_module_graph) {
+KlassSubGraphInfo* HeapShared::init_subgraph_info(Klass* k) {
   assert(CDSConfig::is_dumping_heap(), "dump time only");
   bool created;
   KlassSubGraphInfo* info =
-    _dump_time_subgraph_info_table->put_if_absent(k, KlassSubGraphInfo(k, is_full_module_graph),
-                                                  &created);
+    _dump_time_subgraph_info_table->put_if_absent(k, KlassSubGraphInfo(k), &created);
   assert(created, "must not initialize twice");
   return info;
 }
@@ -1114,7 +1104,6 @@ void KlassSubGraphInfo::add_subgraph_object_klass(Klass* orig_k) {
   }
 
   _subgraph_object_klasses->append_if_missing(orig_k);
-  _has_non_early_klasses |= is_non_early_klass(orig_k);
 }
 
 void KlassSubGraphInfo::check_allowed_klass(InstanceKlass* ik) {
@@ -1157,45 +1146,11 @@ void KlassSubGraphInfo::check_allowed_klass(InstanceKlass* ik) {
   AOTMetaspace::unrecoverable_writing_error();
 }
 
-bool KlassSubGraphInfo::is_non_early_klass(Klass* k) {
-  if (k->is_objArray_klass()) {
-    k = ObjArrayKlass::cast(k)->bottom_klass();
-  }
-  if (k->is_instance_klass()) {
-    if (!SystemDictionaryShared::is_early_klass(InstanceKlass::cast(k))) {
-      ResourceMark rm;
-      log_info(aot, heap)("non-early: %s", k->external_name());
-      return true;
-    } else {
-      return false;
-    }
-  } else {
-    return false;
-  }
-}
-
 // Initialize an archived subgraph_info_record from the given KlassSubGraphInfo.
 void ArchivedKlassSubGraphInfoRecord::init(KlassSubGraphInfo* info) {
   _k = ArchiveBuilder::get_buffered_klass(info->klass());
   _entry_field_records = nullptr;
   _subgraph_object_klasses = nullptr;
-  _is_full_module_graph = info->is_full_module_graph();
-
-  if (_is_full_module_graph) {
-    // Consider all classes referenced by the full module graph as early -- we will be
-    // allocating objects of these classes during JVMTI early phase, so they cannot
-    // be processed by (non-early) JVMTI ClassFileLoadHook
-    _has_non_early_klasses = false;
-  } else {
-    _has_non_early_klasses = info->has_non_early_klasses();
-  }
-
-  if (_has_non_early_klasses) {
-    ResourceMark rm;
-    log_info(aot, heap)(
-          "Subgraph of klass %s has non-early klasses and cannot be used when JVMTI ClassFileLoadHook is enabled",
-          _k->external_name());
-  }
 
   // populate the entry fields
   GrowableArray<int>* entry_fields = info->subgraph_entry_fields();
@@ -1353,15 +1308,10 @@ static void verify_the_heap(Klass* k, const char* which) {
 
 // Before GC can execute, we must ensure that all oops reachable from HeapShared::roots()
 // have a valid klass. I.e., oopDesc::klass() must have already been resolved.
-//
-// Note: if a ArchivedKlassSubGraphInfoRecord contains non-early classes, and JVMTI
-// ClassFileLoadHook is enabled, it's possible for this class to be dynamically replaced. In
-// this case, we will not load the ArchivedKlassSubGraphInfoRecord and will clear its roots.
 void HeapShared::resolve_classes(JavaThread* current) {
   assert(CDSConfig::is_using_archive(), "runtime only!");
   if (CDSConfig::is_using_klass_subgraphs()) {
     resolve_classes_for_subgraphs(current, archive_subgraph_entry_fields);
-    resolve_classes_for_subgraphs(current, fmg_archive_subgraph_entry_fields);
   }
 }
 
@@ -1509,24 +1459,6 @@ HeapShared::resolve_or_init_classes_for_subgraph_of(Klass* k, bool do_init, TRAP
     }
     return nullptr;
   } else {
-    if (record->is_full_module_graph() && !CDSConfig::is_using_full_module_graph()) {
-      if (log_is_enabled(Info, aot, heap)) {
-        ResourceMark rm(THREAD);
-        log_info(aot, heap)("subgraph %s cannot be used because full module graph is disabled",
-                            k->external_name());
-      }
-      return nullptr;
-    }
-
-    if (record->has_non_early_klasses() && JvmtiExport::should_post_class_file_load_hook()) {
-      if (log_is_enabled(Info, aot, heap)) {
-        ResourceMark rm(THREAD);
-        log_info(aot, heap)("subgraph %s cannot be used because JVMTI ClassFileLoadHook is enabled",
-                            k->external_name());
-      }
-      return nullptr;
-    }
-
     if (log_is_enabled(Info, aot, heap)) {
       ResourceMark rm;
       log_info(aot, heap)("%s subgraph %s ", do_init ? "init" : "resolve", k->external_name());
@@ -1608,8 +1540,8 @@ void HeapShared::init_archived_fields_for(Klass* k, const ArchivedKlassSubGraphI
     // mirror after this point.
     if (log_is_enabled(Info, aot, heap)) {
       ResourceMark rm;
-      log_info(aot, heap)("initialize_from_archived_subgraph %s " PTR_FORMAT "%s%s",
-                          k->external_name(), p2i(k), JvmtiExport::is_early_phase() ? " (early)" : "",
+      log_info(aot, heap)("initialize_from_archived_subgraph %s " PTR_FORMAT "%s",
+                          k->external_name(), p2i(k),
                           k->has_aot_initialized_mirror() ? " (aot-inited)" : "");
     }
   }
@@ -2075,9 +2007,9 @@ void HeapShared::set_has_been_seen_during_subgraph_recording(oop obj) {
   ++ _num_new_walked_objs;
 }
 
-void HeapShared::start_recording_subgraph(InstanceKlass *k, const char* class_name, bool is_full_module_graph) {
+void HeapShared::start_recording_subgraph(InstanceKlass *k, const char* class_name) {
   log_info(aot, heap)("Start recording subgraph(s) for archived fields in %s", class_name);
-  init_subgraph_info(k, is_full_module_graph);
+  init_subgraph_info(k);
   init_seen_objects_table();
   _num_new_walked_objs = 0;
   _num_new_archived_objs = 0;
@@ -2209,9 +2141,6 @@ void HeapShared::init_subgraph_entry_fields(TRAPS) {
   _dump_time_subgraph_info_table = new (mtClass)DumpTimeKlassSubGraphInfoTable();
   if (CDSConfig::is_dumping_klass_subgraphs()) {
     init_subgraph_entry_fields(archive_subgraph_entry_fields, CHECK);
-    if (CDSConfig::is_dumping_full_module_graph()) {
-      init_subgraph_entry_fields(fmg_archive_subgraph_entry_fields, CHECK);
-    }
   }
 }
 
@@ -2310,8 +2239,7 @@ void HeapShared::init_heap_writer() {
   }
 }
 
-void HeapShared::archive_object_subgraphs(ArchivableStaticFieldInfo fields[],
-                                          bool is_full_module_graph) {
+void HeapShared::archive_object_subgraphs(ArchivableStaticFieldInfo fields[]) {
   _num_total_subgraph_recordings = 0;
   _num_total_walked_objs = 0;
   _num_total_archived_objs = 0;
@@ -2327,7 +2255,7 @@ void HeapShared::archive_object_subgraphs(ArchivableStaticFieldInfo fields[],
   for (int i = 0; fields[i].valid(); ) {
     ArchivableStaticFieldInfo* info = &fields[i];
     const char* klass_name = info->klass_name;
-    start_recording_subgraph(info->klass, klass_name, is_full_module_graph);
+    start_recording_subgraph(info->klass, klass_name);
 
     // If you have specified consecutive fields of the same klass in
     // fields[], these will be archived in the same
diff --git a/src/hotspot/share/cds/heapShared.hpp b/src/hotspot/share/cds/heapShared.hpp
index 92f41784268..c3ad1f666b1 100644
--- a/src/hotspot/share/cds/heapShared.hpp
+++ b/src/hotspot/share/cds/heapShared.hpp
@@ -66,21 +66,12 @@ class KlassSubGraphInfo: public CHeapObj<mtClass> {
   // For each entry field, it is a tuple of field_offset, field_value
   GrowableArray<int>* _subgraph_entry_fields;
 
-  // Does this KlassSubGraphInfo belong to the archived full module graph
-  bool _is_full_module_graph;
-
-  // Does this KlassSubGraphInfo references any classes that were loaded while
-  // JvmtiExport::is_early_phase()!=true. If so, this KlassSubGraphInfo cannot be
-  // used at runtime if JVMTI ClassFileLoadHook is enabled.
-  bool _has_non_early_klasses;
   static bool is_non_early_klass(Klass* k);
   static void check_allowed_klass(InstanceKlass* ik);
  public:
-  KlassSubGraphInfo(Klass* k, bool is_full_module_graph) :
+  KlassSubGraphInfo(Klass* k) :
     _k(k),  _subgraph_object_klasses(nullptr),
-    _subgraph_entry_fields(nullptr),
-    _is_full_module_graph(is_full_module_graph),
-    _has_non_early_klasses(false) {}
+    _subgraph_entry_fields(nullptr) {}
 
   ~KlassSubGraphInfo() {
     if (_subgraph_object_klasses != nullptr) {
@@ -104,8 +95,6 @@ class KlassSubGraphInfo: public CHeapObj<mtClass> {
     return _subgraph_object_klasses == nullptr ? 0 :
            _subgraph_object_klasses->length();
   }
-  bool is_full_module_graph() const { return _is_full_module_graph; }
-  bool has_non_early_klasses() const { return _has_non_early_klasses; }
 };
 
 // An archived record of object sub-graphs reachable from static
@@ -114,7 +103,6 @@ class KlassSubGraphInfo: public CHeapObj<mtClass> {
 class ArchivedKlassSubGraphInfoRecord {
  private:
   Klass* _k;
-  bool _is_full_module_graph;
   bool _has_non_early_klasses;
 
   // contains pairs of field offset and value for each subgraph entry field
@@ -130,7 +118,6 @@ class ArchivedKlassSubGraphInfoRecord {
   Klass* klass() const { return _k; }
   Array<int>* entry_field_records() const { return _entry_field_records; }
   Array<Klass*>* subgraph_object_klasses() const { return _subgraph_object_klasses; }
-  bool is_full_module_graph() const { return _is_full_module_graph; }
   bool has_non_early_klasses() const { return _has_non_early_klasses; }
 };
 #endif // INCLUDE_CDS_JAVA_HEAP
@@ -270,8 +257,7 @@ private:
 
   static CachedOopInfo make_cached_oop_info(oop obj, oop referrer);
   static ArchivedKlassSubGraphInfoRecord* archive_subgraph_info(KlassSubGraphInfo* info);
-  static void archive_object_subgraphs(ArchivableStaticFieldInfo fields[],
-                                       bool is_full_module_graph);
+  static void archive_object_subgraphs(ArchivableStaticFieldInfo fields[]);
 
   // Archive object sub-graph starting from the given static field
   // in Klass k's mirror.
@@ -285,7 +271,7 @@ private:
   static void verify_subgraph_from(oop orig_obj) PRODUCT_RETURN;
   static void check_special_subgraph_classes();
 
-  static KlassSubGraphInfo* init_subgraph_info(Klass *k, bool is_full_module_graph);
+  static KlassSubGraphInfo* init_subgraph_info(Klass *k);
   static KlassSubGraphInfo* get_subgraph_info(Klass *k);
 
   static void init_subgraph_entry_fields(TRAPS) NOT_CDS_JAVA_HEAP_RETURN;
@@ -340,8 +326,7 @@ private:
   static size_t _num_total_recorded_klasses;
   static size_t _num_total_verifications;
 
-  static void start_recording_subgraph(InstanceKlass *k, const char* klass_name,
-                                       bool is_full_module_graph);
+  static void start_recording_subgraph(InstanceKlass *k, const char* klass_name);
   static void done_recording_subgraph(InstanceKlass *k, const char* klass_name);
 
   static bool has_been_seen_during_subgraph_recording(oop obj);
diff --git a/src/hotspot/share/classfile/systemDictionaryShared.cpp b/src/hotspot/share/classfile/systemDictionaryShared.cpp
index cfb20412ab8..5947050e31a 100644
--- a/src/hotspot/share/classfile/systemDictionaryShared.cpp
+++ b/src/hotspot/share/classfile/systemDictionaryShared.cpp
@@ -373,11 +373,6 @@ bool SystemDictionaryShared::is_jfr_event_class(InstanceKlass *k) {
   return false;
 }
 
-bool SystemDictionaryShared::is_early_klass(InstanceKlass* ik) {
-  DumpTimeClassInfo* info = _dumptime_table->get(ik);
-  return (info != nullptr) ? info->is_early_klass() : false;
-}
-
 bool SystemDictionaryShared::check_self_exclusion(InstanceKlass* k) {
   bool log_warning = false;
   const char* error = check_self_exclusion_helper(k, log_warning);
diff --git a/src/hotspot/share/classfile/systemDictionaryShared.hpp b/src/hotspot/share/classfile/systemDictionaryShared.hpp
index 2619a642fd1..33b245e26fc 100644
--- a/src/hotspot/share/classfile/systemDictionaryShared.hpp
+++ b/src/hotspot/share/classfile/systemDictionaryShared.hpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2014, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2014, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -199,7 +199,6 @@ private:
   static void iterate_verification_constraint_names(InstanceKlass* k, DumpTimeClassInfo* info, Function func);
 
 public:
-  static bool is_early_klass(InstanceKlass* k);   // Was k loaded while JvmtiExport::is_early_phase()==true
   static bool has_archived_enum_objs(InstanceKlass* ik);
   static void set_has_archived_enum_objs(InstanceKlass* ik);
 
diff --git a/test/hotspot/jtreg/TEST.groups b/test/hotspot/jtreg/TEST.groups
index 32cff812975..6e9421e5c09 100644
--- a/test/hotspot/jtreg/TEST.groups
+++ b/test/hotspot/jtreg/TEST.groups
@@ -458,6 +458,7 @@ hotspot_appcds_dynamic = \
  -runtime/cds/appcds/TestEpsilonGCWithCDS.java \
  -runtime/cds/appcds/TestParallelGCWithCDS.java \
  -runtime/cds/appcds/TestSerialGCWithCDS.java \
+ -runtime/cds/appcds/TestZGCWithAOTHeap.java \
  -runtime/cds/appcds/TestZGCWithCDS.java \
  -runtime/cds/appcds/UnusedCPDuringDump.java \
  -runtime/cds/appcds/VerifierTest_1B.java
diff --git a/test/hotspot/jtreg/runtime/cds/appcds/TestZGCWithAOTHeap.java b/test/hotspot/jtreg/runtime/cds/appcds/TestZGCWithAOTHeap.java
index 567c8da73cb..719a4ee83f7 100644
--- a/test/hotspot/jtreg/runtime/cds/appcds/TestZGCWithAOTHeap.java
+++ b/test/hotspot/jtreg/runtime/cds/appcds/TestZGCWithAOTHeap.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2022, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2022, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -65,7 +65,7 @@ public class TestZGCWithAOTHeap {
         String dumpGC = dumpWithZ ? Z : G1;
         String execGC = execWithZ ? Z : G1;
         String generalErrMsg = "Cannot use CDS heap data.";
-        String coopsErrMsg = generalErrMsg + " Selected GC not compatible -XX:-UseCompressedOops";
+        String coopsErrMsg = "CDS heap data cannot be used by the selected GC. Please choose a different GC or rebuild AOT cache with -XX:+AOTStreamableObjects";
         String coops = "-XX:-UseCompressedOops";
         String coh = shouldUseCOH ? "-XX:+UseCompactObjectHeaders" : "-XX:-UseCompactObjectHeaders";
         String stream = shouldStream ? "-XX:+AOTStreamableObjects" : "-XX:-AOTStreamableObjects";
diff --git a/test/hotspot/jtreg/runtime/cds/appcds/jigsaw/addmods/AddmodsOption.java b/test/hotspot/jtreg/runtime/cds/appcds/jigsaw/addmods/AddmodsOption.java
index 10e17f2072f..cf9ffb2403a 100644
--- a/test/hotspot/jtreg/runtime/cds/appcds/jigsaw/addmods/AddmodsOption.java
+++ b/test/hotspot/jtreg/runtime/cds/appcds/jigsaw/addmods/AddmodsOption.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2024, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2024, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -47,7 +47,6 @@ public class AddmodsOption {
         final String allModulePath = "ALL-MODULE-PATH";
         final String loggingOption = "-Xlog:aot=debug,aot+module=debug,aot+heap=info,cds=debug,module=trace";
         final String versionPattern = "java.[0-9][0-9].*";
-        final String subgraphCannotBeUsed = "subgraph jdk.internal.module.ArchivedBootLayer cannot be used because full module graph is disabled";
         final String warningIncubator = "WARNING: Using incubator modules: jdk.incubator.vector";
         String archiveName = TestCommon.getNewArchiveName("addmods-option");
         TestCommon.setCurrentArchiveName(archiveName);
@@ -81,16 +80,14 @@ public class AddmodsOption {
             "-version");
         oa.shouldHaveExitValue(0)
           .shouldContain("Mismatched values for property jdk.module.addmods")
-          .shouldContain("runtime jdk.incubator.vector dump time jdk.jconsole")
-          .shouldContain(subgraphCannotBeUsed);
+          .shouldContain("runtime jdk.incubator.vector dump time jdk.jconsole");
 
         // no module specified during runtime
         oa = TestCommon.execCommon(
             loggingOption,
             "-version");
         oa.shouldHaveExitValue(0)
-          .shouldContain("jdk.httpserver specified during dump time but not during runtime")
-          .shouldContain(subgraphCannotBeUsed);
+          .shouldContain("jdk.httpserver specified during dump time but not during runtime");
 
         // dump an archive without the --add-modules option
         archiveName = TestCommon.getNewArchiveName("no-addmods-option");
@@ -111,8 +108,7 @@ public class AddmodsOption {
         oa.shouldHaveExitValue(0)
           .shouldContain("jdk.jconsole specified during runtime but not during dump time")
           // version of the jdk.httpserver module, e.g. java 22-ea
-          .shouldMatch(versionPattern)
-          .shouldContain(subgraphCannotBeUsed);
+          .shouldMatch(versionPattern);
 
         // dump an archive with an incubator module, -add-modules jdk.incubator.vector
         archiveName = TestCommon.getNewArchiveName("incubator-module");
@@ -137,7 +133,6 @@ public class AddmodsOption {
           // module is not restored from archive
           .shouldContain("define_module(): creation of module: jdk.incubator.vector")
           .shouldContain("WARNING: Using incubator modules: jdk.incubator.vector")
-          .shouldContain("subgraph jdk.internal.module.ArchivedBootLayer is not recorde")
           .shouldHaveExitValue(0);
 
         if (Compiler.isJVMCIEnabled()) {
diff --git a/test/hotspot/jtreg/runtime/cds/appcds/jigsaw/addopens/AddopensOption.java b/test/hotspot/jtreg/runtime/cds/appcds/jigsaw/addopens/AddopensOption.java
index 636169ef3cb..6f1864f90bd 100644
--- a/test/hotspot/jtreg/runtime/cds/appcds/jigsaw/addopens/AddopensOption.java
+++ b/test/hotspot/jtreg/runtime/cds/appcds/jigsaw/addopens/AddopensOption.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2025, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -43,7 +43,6 @@ public class AddopensOption {
         final String addOpensTimeFormat = "java.base/java.time.format=ALL-UNNAMED";
         final String loggingOption = "-Xlog:aot=debug,aot+module=debug,aot+heap=info,cds=debug,module=trace";
         final String versionPattern = "java.[0-9][0-9].*";
-        final String subgraphCannotBeUsed = "subgraph jdk.internal.module.ArchivedBootLayer cannot be used because full module graph is disabled";
         final String warningIncubator = "WARNING: Using incubator modules: jdk.incubator.vector";
         String archiveName = TestCommon.getNewArchiveName("addopens-option");
         TestCommon.setCurrentArchiveName(archiveName);
@@ -76,16 +75,14 @@ public class AddopensOption {
             "-version");
         oa.shouldHaveExitValue(0)
           .shouldContain("Mismatched values for property jdk.module.addopens")
-          .shouldContain("runtime java.base/java.nio=ALL-UNNAMED dump time java.base/java.time.format=ALL-UNNAMED")
-          .shouldContain(subgraphCannotBeUsed);
+          .shouldContain("runtime java.base/java.nio=ALL-UNNAMED dump time java.base/java.time.format=ALL-UNNAMED");
 
         // no module specified during runtime
         oa = TestCommon.execCommon(
             loggingOption,
             "-version");
         oa.shouldHaveExitValue(0)
-          .shouldContain("jdk.httpserver specified during dump time but not during runtime")
-          .shouldContain(subgraphCannotBeUsed);
+          .shouldContain("jdk.httpserver specified during dump time but not during runtime");
 
         // dump an archive without the --add-opens option
         archiveName = TestCommon.getNewArchiveName("no-addopens-option");
@@ -106,8 +103,7 @@ public class AddopensOption {
         oa.shouldHaveExitValue(0)
           .shouldContain("java.base/java.time.format=ALL-UNNAMED specified during runtime but not during dump time")
           // version of the jdk.httpserver module, e.g. java 22-ea
-          .shouldMatch(versionPattern)
-          .shouldContain(subgraphCannotBeUsed);
+          .shouldMatch(versionPattern);
 
         // dump an archive with -add-opens java.base/java.nio=ALL-UNNAMED
         archiveName = TestCommon.getNewArchiveName("addopens-java-nio");
diff --git a/test/hotspot/jtreg/runtime/cds/appcds/jigsaw/module/ModuleOption.java b/test/hotspot/jtreg/runtime/cds/appcds/jigsaw/module/ModuleOption.java
index 3001b8dd2ca..6339538bbb2 100644
--- a/test/hotspot/jtreg/runtime/cds/appcds/jigsaw/module/ModuleOption.java
+++ b/test/hotspot/jtreg/runtime/cds/appcds/jigsaw/module/ModuleOption.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2023, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2023, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -42,7 +42,6 @@ public class ModuleOption {
         // e.g. JDK 22:     "java 22"
         //      JDK 22.0.1: "java 22.0.1"
         final String versionPattern = "java.[0-9][0-9].*";
-        final String subgraphCannotBeUsed = "subgraph jdk.internal.module.ArchivedBootLayer cannot be used because full module graph is disabled";
         String archiveName = TestCommon.getNewArchiveName("module-option");
         TestCommon.setCurrentArchiveName(archiveName);
 
@@ -70,16 +69,14 @@ public class ModuleOption {
             "-m", "jdk.compiler/com.sun.tools.javac.Main",
             "-version");
         oa.shouldHaveExitValue(0)
-          .shouldContain("Mismatched values for property jdk.module.main: runtime jdk.compiler dump time jdk.httpserver")
-          .shouldContain(subgraphCannotBeUsed);
+          .shouldContain("Mismatched values for property jdk.module.main: runtime jdk.compiler dump time jdk.httpserver");
 
         // no module specified during runtime
         oa = TestCommon.execCommon(
             loggingOption,
             "-version");
         oa.shouldHaveExitValue(0)
-          .shouldContain("Mismatched values for property jdk.module.main: jdk.httpserver specified during dump time but not during runtime")
-          .shouldContain(subgraphCannotBeUsed);
+          .shouldContain("Mismatched values for property jdk.module.main: jdk.httpserver specified during dump time but not during runtime");
 
         // dump an archive without the module option
         archiveName = TestCommon.getNewArchiveName("no-module-option");
@@ -98,8 +95,7 @@ public class ModuleOption {
         oa.shouldHaveExitValue(0)
           .shouldContain("Mismatched values for property jdk.module.main: jdk.httpserver specified during runtime but not during dump time")
           // version of the jdk.httpserver module, e.g. java 22-ea
-          .shouldMatch(versionPattern)
-          .shouldContain(subgraphCannotBeUsed);
+          .shouldMatch(versionPattern);
 
         // dump an archive with an incubator module, -m jdk.incubator.vector
         archiveName = TestCommon.getNewArchiveName("incubator-module");
@@ -122,7 +118,6 @@ public class ModuleOption {
           // module is not restored from archive
           .shouldContain("define_module(): creation of module: jdk.incubator.vector")
           .shouldContain("WARNING: Using incubator modules: jdk.incubator.vector")
-          .shouldContain("subgraph jdk.internal.module.ArchivedBootLayer is not recorde")
           .shouldContain("module jdk.incubator.vector does not have a ModuleMainClass attribute, use -m <module>/<main-class>")
           .shouldHaveExitValue(1);
     }
diff --git a/test/hotspot/jtreg/runtime/cds/serviceability/ReplaceCriticalClasses.java b/test/hotspot/jtreg/runtime/cds/serviceability/ReplaceCriticalClasses.java
index 408ab0582b1..99b2714a08f 100644
--- a/test/hotspot/jtreg/runtime/cds/serviceability/ReplaceCriticalClasses.java
+++ b/test/hotspot/jtreg/runtime/cds/serviceability/ReplaceCriticalClasses.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -190,7 +190,6 @@ public class ReplaceCriticalClasses {
                 if (checkSubgraph) {
                     if (expectShared) {
                         if (!out.getOutput().contains("Unable to map at required address in java heap")) {
-                            out.shouldContain(subgraphInit);
                             // If the subgraph is successfully initialized, the specified shared class must not be rewritten.
                             out.shouldNotContain("Rewriting done.");
                         }

From f1cb3b41f1f498f7a1542cd247fe6564294b572e Mon Sep 17 00:00:00 2001
From: Jatin Bhateja <jbhateja@openjdk.org>
Date: Mon, 23 Mar 2026 04:41:14 +0000
Subject: [PATCH 295/655] 8379792: UBSAN runtime error: signed integer overflow
 during compress expand value transform

Co-authored-by: Kim Barrett <kbarrett@openjdk.org>
Reviewed-by: kbarrett, fyang
---
 src/hotspot/cpu/riscv/vm_version_riscv.hpp    |  2 +-
 .../linux_riscv/vm_version_linux_riscv.cpp    | 20 +++++++------
 src/hotspot/share/opto/intrinsicnode.cpp      |  4 +--
 .../share/utilities/globalDefinitions.hpp     | 30 ++++++++++++-------
 4 files changed, 33 insertions(+), 23 deletions(-)

diff --git a/src/hotspot/cpu/riscv/vm_version_riscv.hpp b/src/hotspot/cpu/riscv/vm_version_riscv.hpp
index 03c843efc69..11a88dfedd7 100644
--- a/src/hotspot/cpu/riscv/vm_version_riscv.hpp
+++ b/src/hotspot/cpu/riscv/vm_version_riscv.hpp
@@ -55,7 +55,7 @@ class VM_Version : public Abstract_VM_Version {
 
    public:
     RVFeatureValue(const char* pretty, int linux_bit_num, bool fstring) :
-      _pretty(pretty), _feature_string(fstring), _linux_feature_bit(nth_bit(linux_bit_num)) {
+      _pretty(pretty), _feature_string(fstring), _linux_feature_bit(nth_bit<uint64_t>(linux_bit_num)) {
     }
     virtual void enable_feature(int64_t value = 0) = 0;
     virtual void disable_feature() = 0;
diff --git a/src/hotspot/os_cpu/linux_riscv/vm_version_linux_riscv.cpp b/src/hotspot/os_cpu/linux_riscv/vm_version_linux_riscv.cpp
index 35cbb75e8ff..648131b94a3 100644
--- a/src/hotspot/os_cpu/linux_riscv/vm_version_linux_riscv.cpp
+++ b/src/hotspot/os_cpu/linux_riscv/vm_version_linux_riscv.cpp
@@ -36,40 +36,42 @@
 #include <sys/auxv.h>
 #include <sys/prctl.h>
 
+static constexpr uint64_t feature_bit(int n) { return nth_bit<uint64_t>(n); }
+
 #ifndef HWCAP_ISA_I
-#define HWCAP_ISA_I  nth_bit('I' - 'A')
+#define HWCAP_ISA_I  feature_bit('I' - 'A')
 #endif
 
 #ifndef HWCAP_ISA_M
-#define HWCAP_ISA_M  nth_bit('M' - 'A')
+#define HWCAP_ISA_M  feature_bit('M' - 'A')
 #endif
 
 #ifndef HWCAP_ISA_A
-#define HWCAP_ISA_A  nth_bit('A' - 'A')
+#define HWCAP_ISA_A  feature_bit('A' - 'A')
 #endif
 
 #ifndef HWCAP_ISA_F
-#define HWCAP_ISA_F  nth_bit('F' - 'A')
+#define HWCAP_ISA_F  feature_bit('F' - 'A')
 #endif
 
 #ifndef HWCAP_ISA_D
-#define HWCAP_ISA_D  nth_bit('D' - 'A')
+#define HWCAP_ISA_D  feature_bit('D' - 'A')
 #endif
 
 #ifndef HWCAP_ISA_C
-#define HWCAP_ISA_C  nth_bit('C' - 'A')
+#define HWCAP_ISA_C  feature_bit('C' - 'A')
 #endif
 
 #ifndef HWCAP_ISA_Q
-#define HWCAP_ISA_Q  nth_bit('Q' - 'A')
+#define HWCAP_ISA_Q  feature_bit('Q' - 'A')
 #endif
 
 #ifndef HWCAP_ISA_H
-#define HWCAP_ISA_H  nth_bit('H' - 'A')
+#define HWCAP_ISA_H  feature_bit('H' - 'A')
 #endif
 
 #ifndef HWCAP_ISA_V
-#define HWCAP_ISA_V  nth_bit('V' - 'A')
+#define HWCAP_ISA_V  feature_bit('V' - 'A')
 #endif
 
 #define read_csr(csr)                                           \
diff --git a/src/hotspot/share/opto/intrinsicnode.cpp b/src/hotspot/share/opto/intrinsicnode.cpp
index c3e003ad8d3..3e235738e0f 100644
--- a/src/hotspot/share/opto/intrinsicnode.cpp
+++ b/src/hotspot/share/opto/intrinsicnode.cpp
@@ -273,7 +273,7 @@ static const Type* bitshuffle_value(const TypeInteger* src_type, const TypeInteg
       //  result.lo = 0
       if (maskcon != -1L) {
         int bitcount = population_count(static_cast<julong>(bt == T_INT ? maskcon & 0xFFFFFFFFL : maskcon));
-        hi = right_n_bits_typed<jlong>(bitcount);
+        hi = right_n_bits<jlong>(bitcount);
         lo = 0L;
       } else {
         // preserve originally assigned hi (MAX_INT/LONG) and lo (MIN_INT/LONG) values
@@ -376,7 +376,7 @@ static const Type* bitshuffle_value(const TypeInteger* src_type, const TypeInteg
         // Rule 3:
         // We can further constrain the upper bound of bit compression if the number of bits
         // which can be set(one) is less than the maximum number of bits of integral type.
-        hi = MIN2(right_n_bits_typed<jlong>(result_bit_width), hi);
+        hi = MIN2(right_n_bits<jlong>(result_bit_width), hi);
       }
     } else {
       assert(opc == Op_ExpandBits, "");
diff --git a/src/hotspot/share/utilities/globalDefinitions.hpp b/src/hotspot/share/utilities/globalDefinitions.hpp
index 9560d863a2c..40691de518e 100644
--- a/src/hotspot/share/utilities/globalDefinitions.hpp
+++ b/src/hotspot/share/utilities/globalDefinitions.hpp
@@ -1072,18 +1072,26 @@ const intptr_t NoBits     =  0; // no bits set in a word
 const jlong    NoLongBits =  0; // no bits set in a long
 const intptr_t OneBit     =  1; // only right_most bit set in a word
 
-// get a word with the n.th or the right-most or left-most n bits set
-// (note: #define used only so that they can be used in enum constant definitions)
-#define nth_bit(n)        (((n) >= BitsPerWord) ? 0 : (OneBit << (n)))
-#define right_n_bits(n)   (nth_bit(n) - 1)
-
-// same as nth_bit(n), but allows handing in a type as template parameter. Allows
-// us to use nth_bit with 64-bit types on 32-bit platforms
-template<class T> inline T nth_bit_typed(int n) {
-  return ((T)1) << n;
+// Return a value of type T with the n.th bit set and all other bits zero.
+// T must be an integral or enum type. n must be non-negative. If n is at
+// least the bitwise size of T then all bits in the result are zero.
+template<typename T = intptr_t>
+constexpr T nth_bit(int n) {
+  assert(n >= 0, "n must be non-negative");
+  using U = std::make_unsigned_t<T>;
+  constexpr size_t size = sizeof(U) * BitsPerByte;
+  return T((size_t(n) >= size) ? U(0) : (U(1) << n));
 }
-template<class T> inline T right_n_bits_typed(int n) {
-  return nth_bit_typed<T>(n) - 1;
+
+// Return a value of type T with all bits below the n.th bit set and all
+// other bits zero. T must be an integral or enum type. n must be
+// non-negative. If n is at least the bitwise size of T then all bits in
+// the result are set.
+template<typename T = intptr_t>
+constexpr T right_n_bits(int n) {
+  assert(n >= 0, "n must be non-negative");
+  using U = std::make_unsigned_t<T>;
+  return T(nth_bit<U>(n) - 1);
 }
 
 // bit-operations using a mask m

From 8e906ddad6e8019718a916e02082b2badf0c0ff2 Mon Sep 17 00:00:00 2001
From: Phil Race <prr@openjdk.org>
Date: Mon, 23 Mar 2026 05:29:22 +0000
Subject: [PATCH 296/655] 8379019: Remove AppContext from WindowEvent

Reviewed-by: serb, azvegint
---
 .../share/classes/java/awt/event/WindowEvent.java  | 14 +++-----------
 1 file changed, 3 insertions(+), 11 deletions(-)

diff --git a/src/java.desktop/share/classes/java/awt/event/WindowEvent.java b/src/java.desktop/share/classes/java/awt/event/WindowEvent.java
index d898860f153..b2dbdb4f13f 100644
--- a/src/java.desktop/share/classes/java/awt/event/WindowEvent.java
+++ b/src/java.desktop/share/classes/java/awt/event/WindowEvent.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1996, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1996, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -29,7 +29,6 @@ import java.awt.Window;
 import java.io.Serial;
 import java.lang.annotation.Native;
 
-import sun.awt.AppContext;
 import sun.awt.SunToolkit;
 
 /**
@@ -324,21 +323,14 @@ public class WindowEvent extends ComponentEvent {
      * WINDOW_LOST_FOCUS event, this is the Window that gained activation or
      * focus. For any other type of WindowEvent, or if the focus or activation
      * change occurs with a native application, with a Java application in a
-     * different VM or context, or with no other Window, null is returned.
+     * different VM, or with no other Window, null is returned.
      *
      * @return the other Window involved in the focus or activation change, or
      *         null
      * @since 1.4
      */
     public Window getOppositeWindow() {
-        if (opposite == null) {
-            return null;
-        }
-
-        return (SunToolkit.targetToAppContext(opposite) ==
-                AppContext.getAppContext())
-            ? opposite
-            : null;
+        return opposite;
     }
 
     /**

From 206c9cd6e18cf3229c51d3932a79c6f6258a0f04 Mon Sep 17 00:00:00 2001
From: Phil Race <prr@openjdk.org>
Date: Mon, 23 Mar 2026 05:59:16 +0000
Subject: [PATCH 297/655] 8378923: Remove AppContext from datatransfer classes

Reviewed-by: psadhukhan, tr, serb
---
 .../classes/javax/swing/TransferHandler.java  |  31 ++---
 .../DesktopDatatransferServiceImpl.java       |  11 +-
 .../sun/awt/datatransfer/SunClipboard.java    |   3 -
 .../classes/sun/swing/SwingUtilities2.java    |   9 --
 .../SystemClipboardTest.java                  | 111 ------------------
 5 files changed, 13 insertions(+), 152 deletions(-)
 delete mode 100644 test/jdk/java/awt/Clipboard/FlavorChangeNotificationTest/SystemClipboardTest.java

diff --git a/src/java.desktop/share/classes/javax/swing/TransferHandler.java b/src/java.desktop/share/classes/javax/swing/TransferHandler.java
index f412314b28f..0f2229482bc 100644
--- a/src/java.desktop/share/classes/javax/swing/TransferHandler.java
+++ b/src/java.desktop/share/classes/javax/swing/TransferHandler.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2000, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2000, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -38,7 +38,6 @@ import javax.swing.text.JTextComponent;
 
 import sun.reflect.misc.MethodUtil;
 import sun.swing.SwingUtilities2;
-import sun.awt.AppContext;
 import sun.swing.*;
 import sun.awt.SunToolkit;
 
@@ -1096,15 +1095,12 @@ public class TransferHandler implements Serializable {
 
     private String propertyName;
     private static SwingDragGestureRecognizer recognizer = null;
+    private static DropHandler handler;
 
     private static DropTargetListener getDropTargetListener() {
         synchronized(DropHandler.class) {
-            DropHandler handler =
-                (DropHandler)AppContext.getAppContext().get(DropHandler.class);
-
             if (handler == null) {
                 handler = new DropHandler();
-                AppContext.getAppContext().put(DropHandler.class, handler);
             }
 
             return handler;
@@ -1725,29 +1721,22 @@ public class TransferHandler implements Serializable {
             }
         }
 
+        private static Clipboard clipboard;
         /**
          * Returns the clipboard to use for cut/copy/paste.
          */
         private Clipboard getClipboard(JComponent c) {
-            if (SwingUtilities2.canAccessSystemClipboard()) {
+            if (!GraphicsEnvironment.isHeadless()) {
                 return c.getToolkit().getSystemClipboard();
             }
-            Clipboard clipboard = (Clipboard)sun.awt.AppContext.getAppContext().
-                get(SandboxClipboardKey);
-            if (clipboard == null) {
-                clipboard = new Clipboard("Sandboxed Component Clipboard");
-                sun.awt.AppContext.getAppContext().put(SandboxClipboardKey,
-                                                       clipboard);
+            // Likely it is impossible to be here in headless.
+            synchronized (TransferHandler.class) {
+               if (clipboard == null) {
+                   clipboard = new Clipboard("Headless clipboard");
+               }
+               return clipboard;
             }
-            return clipboard;
         }
-
-        /**
-         * Key used in app context to lookup Clipboard to use if access to
-         * System clipboard is denied.
-         */
-        private static Object SandboxClipboardKey = new Object();
-
     }
 
 }
diff --git a/src/java.desktop/share/classes/sun/awt/datatransfer/DesktopDatatransferServiceImpl.java b/src/java.desktop/share/classes/sun/awt/datatransfer/DesktopDatatransferServiceImpl.java
index e96ca888ee3..4234dbad59a 100644
--- a/src/java.desktop/share/classes/sun/awt/datatransfer/DesktopDatatransferServiceImpl.java
+++ b/src/java.desktop/share/classes/sun/awt/datatransfer/DesktopDatatransferServiceImpl.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2014, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2014, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,7 +25,6 @@
 
 package sun.awt.datatransfer;
 
-import sun.awt.AppContext;
 import sun.datatransfer.DesktopDatatransferService;
 
 import java.awt.EventQueue;
@@ -43,8 +42,6 @@ import java.util.function.Supplier;
  */
 public class DesktopDatatransferServiceImpl implements DesktopDatatransferService {
 
-    private static final Object FLAVOR_MAP_KEY = new Object();
-
     @Override
     public void invokeOnEventThread(Runnable r) {
         EventQueue.invokeLater(r);
@@ -59,13 +56,11 @@ public class DesktopDatatransferServiceImpl implements DesktopDatatransferServic
         return null;
     }
 
+    private FlavorMap fm;
     @Override
-    public FlavorMap getFlavorMap(Supplier<FlavorMap> supplier) {
-        AppContext context = AppContext.getAppContext();
-        FlavorMap fm = (FlavorMap) context.get(FLAVOR_MAP_KEY);
+    public synchronized FlavorMap getFlavorMap(Supplier<FlavorMap> supplier) {
         if (fm == null) {
             fm = supplier.get();
-            context.put(FLAVOR_MAP_KEY, fm);
         }
         return fm;
     }
diff --git a/src/java.desktop/share/classes/sun/awt/datatransfer/SunClipboard.java b/src/java.desktop/share/classes/sun/awt/datatransfer/SunClipboard.java
index bc8071a798b..4ccee481a9e 100644
--- a/src/java.desktop/share/classes/sun/awt/datatransfer/SunClipboard.java
+++ b/src/java.desktop/share/classes/sun/awt/datatransfer/SunClipboard.java
@@ -226,9 +226,6 @@ public abstract class SunClipboard extends Clipboard {
      * argument is not {@code null} and is not equal to the current
      * contents context.
      *
-     * @param disposedContext the AppContext that is disposed or
-     *        {@code null} if the ownership is lost because another
-     *        application acquired ownership.
      */
     protected void lostOwnershipLater() {
         SunToolkit.postEvent(new PeerEvent(this, () -> lostOwnershipNow(),
diff --git a/src/java.desktop/share/classes/sun/swing/SwingUtilities2.java b/src/java.desktop/share/classes/sun/swing/SwingUtilities2.java
index 399ef3e531d..8c6d6ab9850 100644
--- a/src/java.desktop/share/classes/sun/swing/SwingUtilities2.java
+++ b/src/java.desktop/share/classes/sun/swing/SwingUtilities2.java
@@ -1435,15 +1435,6 @@ public class SwingUtilities2 {
         }
     }
 
-    /**
-    * checks if the system clipboard can be accessed.
-    * This is true in a headful environment, false in a headless one
-    *
-    */
-   public static boolean canAccessSystemClipboard() {
-       return !GraphicsEnvironment.isHeadless();
-   }
-
     public static String displayPropertiesToCSS(Font font, Color fg) {
         StringBuilder rule = new StringBuilder("body {");
         if (font != null) {
diff --git a/test/jdk/java/awt/Clipboard/FlavorChangeNotificationTest/SystemClipboardTest.java b/test/jdk/java/awt/Clipboard/FlavorChangeNotificationTest/SystemClipboardTest.java
deleted file mode 100644
index ff19005b8aa..00000000000
--- a/test/jdk/java/awt/Clipboard/FlavorChangeNotificationTest/SystemClipboardTest.java
+++ /dev/null
@@ -1,111 +0,0 @@
-/*
- * Copyright (c) 2003, 2023, Oracle and/or its affiliates. All rights reserved.
- * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
- *
- * This code is free software; you can redistribute it and/or modify it
- * under the terms of the GNU General Public License version 2 only, as
- * published by the Free Software Foundation.
- *
- * This code is distributed in the hope that it will be useful, but WITHOUT
- * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
- * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
- * version 2 for more details (a copy is included in the LICENSE file that
- * accompanied this code).
- *
- * You should have received a copy of the GNU General Public License version
- * 2 along with this work; if not, write to the Free Software Foundation,
- * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
- *
- * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
- * or visit www.oracle.com if you need additional information or have any
- * questions.
- */
-
-/*
-  @test
-  @bug 4259272
-  @summary tests that notifications on changes to the set of DataFlavors
-           available on the system clipboard are delivered properly
-  @key headful
-  @modules java.desktop/sun.awt
-  @build Common
-  @run main SystemClipboardTest
-*/
-
-import java.awt.Toolkit;
-import java.awt.datatransfer.Clipboard;
-import java.awt.datatransfer.StringSelection;
-
-import sun.awt.SunToolkit;
-
-public class SystemClipboardTest {
-
-    private final Clipboard clipboard =
-            Toolkit.getDefaultToolkit().getSystemClipboard();
-
-    private final FlavorListenerImpl listener1 = new FlavorListenerImpl();
-
-    private final FlavorListenerImpl listener2 = new FlavorListenerImpl();
-
-    private boolean isListener2Added;
-
-
-    public static void main(String[] args) {
-        new SystemClipboardTest().start();
-    }
-
-    public void start() {
-        Util.setClipboardContents(clipboard,
-                new StringSelection("text3"), null);
-
-        clipboard.addFlavorListener(listener1);
-
-        final ThreadGroup threadGroup = new ThreadGroup("Test thread group");
-        final Object lock = new Object();
-        final Runnable runnable = new Runnable() {
-                public void run() {
-                    SunToolkit.createNewAppContext();
-                    clipboard.addFlavorListener(listener2);
-                    synchronized (lock) {
-                        isListener2Added = true;
-                        lock.notifyAll();
-                    }
-                }
-        };
-        final Thread thread = new Thread(threadGroup, runnable, "Test thread");
-        synchronized (lock) {
-            thread.start();
-            while (!isListener2Added) {
-                try {
-                    lock.wait();
-                } catch (InterruptedException ie) {
-                    ie.printStackTrace();
-                }
-            }
-        }
-
-        Util.setClipboardContents(clipboard,
-                new TransferableUnion(new StringSelection("text2"),
-                        new ImageSelection(Util.createImage())),
-                null);
-        Util.sleep(3000);
-
-        clipboard.removeFlavorListener(listener1);
-        // must not remove listener2 from this AppContext
-
-        Util.setClipboardContents(clipboard,
-                new StringSelection("text3"), null);
-        Util.sleep(3000);
-
-        System.err.println("listener1: " + listener1
-                + "\nlistener2: " + listener2);
-
-        if (!(listener1.notified1
-                && listener2.notified1
-                && !listener1.notified2
-                && listener2.notified2)) {
-            throw new RuntimeException("notifications about flavor " +
-                                       "changes delivered incorrectly!");
-        }
-     }
-}
\ No newline at end of file

From db49e8d083118709c01eb00e659bbab8f98e95e2 Mon Sep 17 00:00:00 2001
From: Christian Hagedorn <chagedorn@openjdk.org>
Date: Mon, 23 Mar 2026 07:11:33 +0000
Subject: [PATCH 298/655] 8378243: [IR Framework] Create separate VMInfo and
 ApplicableIRRules JavaMessage classes

Reviewed-by: mchevalier, dfenacci, thartmann
---
 .../compiler/lib/ir_framework/IRNode.java     |  2 +-
 .../driver/irmatching/irmethod/IRMethod.java  |  2 +-
 .../driver/irmatching/irrule/IRRule.java      |  2 +-
 .../checkattribute/parsing/RawIRNode.java     |  6 +-
 .../irrule/constraint/raw/RawConstraint.java  |  4 +-
 .../constraint/raw/RawCountsConstraint.java   |  3 +-
 .../constraint/raw/RawFailOnConstraint.java   |  2 +-
 .../phase/CompilePhaseIRRuleBuilder.java      |  2 +-
 .../DefaultPhaseRawConstraintParser.java      |  6 +-
 .../parser/ApplicableIRRulesParser.java       | 75 ++--------------
 .../irmatching/parser/IRMethodBuilder.java    |  1 +
 .../irmatching/parser/TestClassParser.java    | 20 +++--
 .../irmatching/parser/VMInfoParser.java       | 67 --------------
 .../driver/network/TestVMData.java            |  6 +-
 .../testvm/java/ApplicableIRRules.java        | 81 +++++++++++++++++
 .../driver/network/testvm/java/IRRuleIds.java |  4 +
 .../testvm/java/JavaMessageParser.java        | 33 +++----
 .../network/testvm/java/JavaMessages.java     | 24 ++---
 .../testvm/java}/VMInfo.java                  | 87 ++++++++++---------
 .../multiline/ApplicableIRRulesStrategy.java  | 78 +++++++++++++++++
 .../java/multiline/MultiLineParser.java       | 67 ++++++++++++++
 .../multiline/MultiLineParsingStrategy.java   | 32 +++++++
 .../testvm/java/multiline/VMInfoStrategy.java | 57 ++++++++++++
 .../test/ApplicableIRRulesPrinter.java        | 25 +++---
 .../ir_framework/tests/TestIRMatching.java    | 15 +++-
 25 files changed, 453 insertions(+), 248 deletions(-)
 delete mode 100644 test/hotspot/jtreg/compiler/lib/ir_framework/driver/irmatching/parser/VMInfoParser.java
 create mode 100644 test/hotspot/jtreg/compiler/lib/ir_framework/driver/network/testvm/java/ApplicableIRRules.java
 rename test/hotspot/jtreg/compiler/lib/ir_framework/driver/{irmatching/parser => network/testvm/java}/VMInfo.java (74%)
 create mode 100644 test/hotspot/jtreg/compiler/lib/ir_framework/driver/network/testvm/java/multiline/ApplicableIRRulesStrategy.java
 create mode 100644 test/hotspot/jtreg/compiler/lib/ir_framework/driver/network/testvm/java/multiline/MultiLineParser.java
 create mode 100644 test/hotspot/jtreg/compiler/lib/ir_framework/driver/network/testvm/java/multiline/MultiLineParsingStrategy.java
 create mode 100644 test/hotspot/jtreg/compiler/lib/ir_framework/driver/network/testvm/java/multiline/VMInfoStrategy.java

diff --git a/test/hotspot/jtreg/compiler/lib/ir_framework/IRNode.java b/test/hotspot/jtreg/compiler/lib/ir_framework/IRNode.java
index 1c59a03b4b0..ebc95527344 100644
--- a/test/hotspot/jtreg/compiler/lib/ir_framework/IRNode.java
+++ b/test/hotspot/jtreg/compiler/lib/ir_framework/IRNode.java
@@ -24,7 +24,7 @@
 package compiler.lib.ir_framework;
 
 import compiler.lib.ir_framework.driver.irmatching.mapping.*;
-import compiler.lib.ir_framework.driver.irmatching.parser.VMInfo;
+import compiler.lib.ir_framework.driver.network.testvm.java.VMInfo;
 import compiler.lib.ir_framework.shared.CheckedTestFrameworkException;
 import compiler.lib.ir_framework.shared.TestFormat;
 import compiler.lib.ir_framework.shared.TestFormatException;
diff --git a/test/hotspot/jtreg/compiler/lib/ir_framework/driver/irmatching/irmethod/IRMethod.java b/test/hotspot/jtreg/compiler/lib/ir_framework/driver/irmatching/irmethod/IRMethod.java
index 5fbe90f0e72..137766b0011 100644
--- a/test/hotspot/jtreg/compiler/lib/ir_framework/driver/irmatching/irmethod/IRMethod.java
+++ b/test/hotspot/jtreg/compiler/lib/ir_framework/driver/irmatching/irmethod/IRMethod.java
@@ -31,8 +31,8 @@ import compiler.lib.ir_framework.driver.irmatching.MatchResult;
 import compiler.lib.ir_framework.driver.irmatching.Matchable;
 import compiler.lib.ir_framework.driver.irmatching.MatchableMatcher;
 import compiler.lib.ir_framework.driver.irmatching.irrule.IRRule;
-import compiler.lib.ir_framework.driver.irmatching.parser.VMInfo;
 import compiler.lib.ir_framework.driver.network.testvm.java.IRRuleIds;
+import compiler.lib.ir_framework.driver.network.testvm.java.VMInfo;
 import compiler.lib.ir_framework.shared.TestFormat;
 import compiler.lib.ir_framework.shared.TestFormatException;
 
diff --git a/test/hotspot/jtreg/compiler/lib/ir_framework/driver/irmatching/irrule/IRRule.java b/test/hotspot/jtreg/compiler/lib/ir_framework/driver/irmatching/irrule/IRRule.java
index 749942eabd6..5c48394851b 100644
--- a/test/hotspot/jtreg/compiler/lib/ir_framework/driver/irmatching/irrule/IRRule.java
+++ b/test/hotspot/jtreg/compiler/lib/ir_framework/driver/irmatching/irrule/IRRule.java
@@ -31,7 +31,7 @@ import compiler.lib.ir_framework.driver.irmatching.Matchable;
 import compiler.lib.ir_framework.driver.irmatching.MatchableMatcher;
 import compiler.lib.ir_framework.driver.irmatching.irrule.phase.CompilePhaseIRRule;
 import compiler.lib.ir_framework.driver.irmatching.irrule.phase.CompilePhaseIRRuleBuilder;
-import compiler.lib.ir_framework.driver.irmatching.parser.VMInfo;
+import compiler.lib.ir_framework.driver.network.testvm.java.VMInfo;
 
 /**
  * This class represents a generic {@link IR @IR} rule of an IR method. It contains a list of compile phase specific
diff --git a/test/hotspot/jtreg/compiler/lib/ir_framework/driver/irmatching/irrule/checkattribute/parsing/RawIRNode.java b/test/hotspot/jtreg/compiler/lib/ir_framework/driver/irmatching/irrule/checkattribute/parsing/RawIRNode.java
index b86ae47e186..d8be8add2a2 100644
--- a/test/hotspot/jtreg/compiler/lib/ir_framework/driver/irmatching/irrule/checkattribute/parsing/RawIRNode.java
+++ b/test/hotspot/jtreg/compiler/lib/ir_framework/driver/irmatching/irrule/checkattribute/parsing/RawIRNode.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2022, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2022, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,10 +25,10 @@ package compiler.lib.ir_framework.driver.irmatching.irrule.checkattribute.parsin
 
 import compiler.lib.ir_framework.CompilePhase;
 import compiler.lib.ir_framework.IRNode;
+import compiler.lib.ir_framework.driver.SuccessOnlyConstraintException;
+import compiler.lib.ir_framework.driver.network.testvm.java.VMInfo;
 import compiler.lib.ir_framework.shared.Comparison;
 import compiler.lib.ir_framework.shared.TestFormat;
-import compiler.lib.ir_framework.driver.irmatching.parser.VMInfo;
-import compiler.lib.ir_framework.driver.SuccessOnlyConstraintException;
 
 import java.util.regex.Matcher;
 
diff --git a/test/hotspot/jtreg/compiler/lib/ir_framework/driver/irmatching/irrule/constraint/raw/RawConstraint.java b/test/hotspot/jtreg/compiler/lib/ir_framework/driver/irmatching/irrule/constraint/raw/RawConstraint.java
index 1c2fba218db..174136c7c28 100644
--- a/test/hotspot/jtreg/compiler/lib/ir_framework/driver/irmatching/irrule/constraint/raw/RawConstraint.java
+++ b/test/hotspot/jtreg/compiler/lib/ir_framework/driver/irmatching/irrule/constraint/raw/RawConstraint.java
@@ -27,12 +27,12 @@ import compiler.lib.ir_framework.CompilePhase;
 import compiler.lib.ir_framework.IR;
 import compiler.lib.ir_framework.IRNode;
 import compiler.lib.ir_framework.driver.irmatching.irrule.constraint.Constraint;
-import compiler.lib.ir_framework.driver.irmatching.parser.VMInfo;
+import compiler.lib.ir_framework.driver.network.testvm.java.VMInfo;
 
 /**
  * Interface to represent a single raw constraint as found in the {@link IR @IR} annotation (i.e. {@link IRNode}
  * placeholder strings are not replaced by regexes, yet). A raw constraint can be parsed into a {@link Constraint} by
- * calling {@link #parse(CompilePhase, String)}. This replaces the IR node placeholder strings by actual regexes and
+ * calling {@link #parse(CompilePhase, String, VMInfo)}. This replaces the IR node placeholder strings by actual regexes and
  * merges composite nodes together.
  *
  * @see Constraint
diff --git a/test/hotspot/jtreg/compiler/lib/ir_framework/driver/irmatching/irrule/constraint/raw/RawCountsConstraint.java b/test/hotspot/jtreg/compiler/lib/ir_framework/driver/irmatching/irrule/constraint/raw/RawCountsConstraint.java
index 9934a830a06..a616f1a0455 100644
--- a/test/hotspot/jtreg/compiler/lib/ir_framework/driver/irmatching/irrule/constraint/raw/RawCountsConstraint.java
+++ b/test/hotspot/jtreg/compiler/lib/ir_framework/driver/irmatching/irrule/constraint/raw/RawCountsConstraint.java
@@ -26,12 +26,11 @@ package compiler.lib.ir_framework.driver.irmatching.irrule.constraint.raw;
 
 import compiler.lib.ir_framework.CompilePhase;
 import compiler.lib.ir_framework.IR;
-import compiler.lib.ir_framework.IRNode;
 import compiler.lib.ir_framework.TestFramework;
 import compiler.lib.ir_framework.driver.irmatching.irrule.checkattribute.parsing.RawIRNode;
 import compiler.lib.ir_framework.driver.irmatching.irrule.constraint.Constraint;
-import compiler.lib.ir_framework.driver.irmatching.parser.VMInfo;
 import compiler.lib.ir_framework.driver.SuccessOnlyConstraintException;
+import compiler.lib.ir_framework.driver.network.testvm.java.VMInfo;
 import compiler.lib.ir_framework.shared.Comparison;
 import compiler.lib.ir_framework.shared.TestFormat;
 import compiler.lib.ir_framework.shared.TestFormatException;
diff --git a/test/hotspot/jtreg/compiler/lib/ir_framework/driver/irmatching/irrule/constraint/raw/RawFailOnConstraint.java b/test/hotspot/jtreg/compiler/lib/ir_framework/driver/irmatching/irrule/constraint/raw/RawFailOnConstraint.java
index 4bd334f1f08..6bd3f8f3448 100644
--- a/test/hotspot/jtreg/compiler/lib/ir_framework/driver/irmatching/irrule/constraint/raw/RawFailOnConstraint.java
+++ b/test/hotspot/jtreg/compiler/lib/ir_framework/driver/irmatching/irrule/constraint/raw/RawFailOnConstraint.java
@@ -29,7 +29,7 @@ import compiler.lib.ir_framework.TestFramework;
 import compiler.lib.ir_framework.driver.SuccessOnlyConstraintException;
 import compiler.lib.ir_framework.driver.irmatching.irrule.checkattribute.parsing.RawIRNode;
 import compiler.lib.ir_framework.driver.irmatching.irrule.constraint.Constraint;
-import compiler.lib.ir_framework.driver.irmatching.parser.VMInfo;
+import compiler.lib.ir_framework.driver.network.testvm.java.VMInfo;
 import compiler.lib.ir_framework.shared.Comparison;
 
 /**
diff --git a/test/hotspot/jtreg/compiler/lib/ir_framework/driver/irmatching/irrule/phase/CompilePhaseIRRuleBuilder.java b/test/hotspot/jtreg/compiler/lib/ir_framework/driver/irmatching/irrule/phase/CompilePhaseIRRuleBuilder.java
index 5d327135c22..4d46a53c46b 100644
--- a/test/hotspot/jtreg/compiler/lib/ir_framework/driver/irmatching/irrule/phase/CompilePhaseIRRuleBuilder.java
+++ b/test/hotspot/jtreg/compiler/lib/ir_framework/driver/irmatching/irrule/phase/CompilePhaseIRRuleBuilder.java
@@ -34,7 +34,7 @@ import compiler.lib.ir_framework.driver.irmatching.irrule.checkattribute.parsing
 import compiler.lib.ir_framework.driver.irmatching.irrule.checkattribute.parsing.RawFailOn;
 import compiler.lib.ir_framework.driver.irmatching.irrule.constraint.Constraint;
 import compiler.lib.ir_framework.driver.irmatching.irrule.constraint.raw.RawConstraint;
-import compiler.lib.ir_framework.driver.irmatching.parser.VMInfo;
+import compiler.lib.ir_framework.driver.network.testvm.java.VMInfo;
 import compiler.lib.ir_framework.shared.TestFormat;
 
 import java.util.*;
diff --git a/test/hotspot/jtreg/compiler/lib/ir_framework/driver/irmatching/irrule/phase/DefaultPhaseRawConstraintParser.java b/test/hotspot/jtreg/compiler/lib/ir_framework/driver/irmatching/irrule/phase/DefaultPhaseRawConstraintParser.java
index 1f837883978..5f8f597a4fe 100644
--- a/test/hotspot/jtreg/compiler/lib/ir_framework/driver/irmatching/irrule/phase/DefaultPhaseRawConstraintParser.java
+++ b/test/hotspot/jtreg/compiler/lib/ir_framework/driver/irmatching/irrule/phase/DefaultPhaseRawConstraintParser.java
@@ -31,7 +31,7 @@ import compiler.lib.ir_framework.driver.irmatching.irrule.checkattribute.Counts;
 import compiler.lib.ir_framework.driver.irmatching.irrule.checkattribute.FailOn;
 import compiler.lib.ir_framework.driver.irmatching.irrule.constraint.Constraint;
 import compiler.lib.ir_framework.driver.irmatching.irrule.constraint.raw.RawConstraint;
-import compiler.lib.ir_framework.driver.irmatching.parser.VMInfo;
+import compiler.lib.ir_framework.driver.network.testvm.java.VMInfo;
 import compiler.lib.ir_framework.shared.TestFrameworkException;
 
 import java.util.ArrayList;
@@ -71,7 +71,7 @@ class DefaultPhaseRawConstraintParser {
         for (RawConstraint rawConstraint : rawConstraints) {
             CompilePhase compilePhase = rawConstraint.defaultCompilePhase();
             List<Constraint> checkAttribute =
-                    matchableForCompilePhase.computeIfAbsent(compilePhase, k -> new ArrayList<>());
+                    matchableForCompilePhase.computeIfAbsent(compilePhase, _ -> new ArrayList<>());
             checkAttribute.add(rawConstraint.parse(compilePhase, compilation.output(compilePhase), vmInfo));
         }
         return replaceConstraintsWithCheckAttribute(matchableForCompilePhase, checkAttributeType);
@@ -113,7 +113,7 @@ class DefaultPhaseRawConstraintParser {
     private static void addCheckAttribute(Map<CompilePhase, Matchable> failOnForCompilePhase,
                                           Map<CompilePhase, List<Matchable>> result) {
         failOnForCompilePhase.forEach((compilePhase, matchable) -> {
-            List<Matchable> list = result.computeIfAbsent(compilePhase, k -> new ArrayList<>());
+            List<Matchable> list = result.computeIfAbsent(compilePhase, _ -> new ArrayList<>());
             list.add(matchable);
         });
     }
diff --git a/test/hotspot/jtreg/compiler/lib/ir_framework/driver/irmatching/parser/ApplicableIRRulesParser.java b/test/hotspot/jtreg/compiler/lib/ir_framework/driver/irmatching/parser/ApplicableIRRulesParser.java
index d251c574e47..67a04df2b58 100644
--- a/test/hotspot/jtreg/compiler/lib/ir_framework/driver/irmatching/parser/ApplicableIRRulesParser.java
+++ b/test/hotspot/jtreg/compiler/lib/ir_framework/driver/irmatching/parser/ApplicableIRRulesParser.java
@@ -25,16 +25,12 @@ package compiler.lib.ir_framework.driver.irmatching.parser;
 
 import compiler.lib.ir_framework.IR;
 import compiler.lib.ir_framework.TestFramework;
-import compiler.lib.ir_framework.driver.irmatching.parser.hotspot.HotSpotPidFileParser;
+import compiler.lib.ir_framework.driver.network.testvm.java.ApplicableIRRules;
 import compiler.lib.ir_framework.driver.network.testvm.java.IRRuleIds;
 import compiler.lib.ir_framework.shared.TestFormat;
-import compiler.lib.ir_framework.shared.TestFrameworkException;
-import compiler.lib.ir_framework.test.ApplicableIRRulesPrinter;
 
 import java.lang.reflect.Method;
-import java.util.ArrayList;
 import java.util.HashMap;
-import java.util.List;
 import java.util.Map;
 
 /**
@@ -55,73 +51,19 @@ public class ApplicableIRRulesParser {
      * Parse the Applicable IR rules passed as parameter and return a "test name" -> TestMethod map that contains an
      * entry for each method that needs to be IR matched on.
      */
-    public TestMethods parse(String applicableIRRules) {
-        createTestMethodMap(applicableIRRules, testClass);
+    public TestMethods parse(ApplicableIRRules applicableIRRules) {
+        createTestMethodMap(applicableIRRules);
         // We could have found format errors in @IR annotations. Report them now with an exception.
         TestFormat.throwIfAnyFailures();
         return new TestMethods(testMethods);
     }
 
-    /**
-     * Sets up a map testname -> TestMethod map. The TestMethod object will later be filled with the ideal and opto
-     * assembly output in {@link HotSpotPidFileParser}.
-     */
-    private void createTestMethodMap(String applicableIRRules, Class<?> testClass) {
-        Map<String, IRRuleIds> irRulesMap = parseApplicableIRRules(applicableIRRules);
-        createTestMethodsWithApplicableIRRules(testClass, irRulesMap);
-    }
-
-    /**
-     * Read the Applicable IR Rules emitted by the Test VM to decide if an @IR rule must be checked for a method.
-     */
-    private Map<String, IRRuleIds> parseApplicableIRRules(String applicableIRRules) {
-        Map<String, IRRuleIds> irRulesMap = new HashMap<>();
-        String[] applicableIRRulesLines = getApplicableIRRulesLines(applicableIRRules);
-        for (String s : applicableIRRulesLines) {
-            String line = s.trim();
-            String[] splitLine = line.split(",");
-            if (splitLine.length < 2) {
-                throw new TestFrameworkException("Invalid Applicable IR Rules format. No comma found: " + splitLine[0]);
-            }
-            String testName = splitLine[0];
-            IRRuleIds irRuleIds = parseIrRulesIds(splitLine);
-            irRulesMap.put(testName, irRuleIds);
-        }
-        return irRulesMap;
-    }
-
-    /**
-     * Parse the Applicable IR Rules lines without header, explanation line and footer and return them in an array.
-     */
-    private String[] getApplicableIRRulesLines(String applicableIRRules) {
-        if (applicableIRRules.isEmpty()) {
-            // Nothing to IR match.
-            return new String[0];
-        }
-        return applicableIRRules.split("\\R");
-    }
-
-    /**
-     * Parse rule indexes from a single line of the Applicable IR Rules in the format: <method,idx1,idx2,...>
-     */
-    private IRRuleIds parseIrRulesIds(String[] splitLine) {
-        List<Integer> irRuleIds = new ArrayList<>();
-        for (int i = 1; i < splitLine.length; i++) {
-            try {
-                irRuleIds.add(Integer.parseInt(splitLine[i]));
-            } catch (NumberFormatException e) {
-                throw new TestFrameworkException("Invalid Applicable IR Rules format. No number found: " + splitLine[i]);
-            }
-        }
-        return new IRRuleIds(irRuleIds);
-    }
-
-    private void createTestMethodsWithApplicableIRRules(Class<?> testClass, Map<String, IRRuleIds> irRulesMap) {
+    private void createTestMethodMap(ApplicableIRRules applicableIRRules) {
         for (Method m : testClass.getDeclaredMethods()) {
             IR[] irAnnos = m.getAnnotationsByType(IR.class);
             if (irAnnos.length > 0) {
                 // Validation of legal @IR attributes and placement of the annotation was already done in Test VM.
-                IRRuleIds irRuleIds = irRulesMap.get(m.getName());
+                IRRuleIds irRuleIds = applicableIRRules.ruleIds(m.getName());
                 validateIRRuleIds(m, irAnnos, irRuleIds);
                 if (hasAnyApplicableIRRules(irRuleIds)) {
                     testMethods.put(m.getName(), new TestMethod(m, irAnnos, irRuleIds));
@@ -131,10 +73,7 @@ public class ApplicableIRRulesParser {
     }
 
     private void validateIRRuleIds(Method m, IR[] irAnnos, IRRuleIds irRuleIds) {
-        TestFramework.check(irRuleIds != null, "Should find method name in validIrRulesMap for " + m);
-        TestFramework.check(!irRuleIds.isEmpty(), "Did not find any rule indices for " + m);
-        TestFramework.check((irRuleIds.first() >= 1 || irRuleIds.first() == ApplicableIRRulesPrinter.NO_RULES)
-                            && irRuleIds.last() <= irAnnos.length,
+        TestFramework.check((irRuleIds.isEmpty() || (irRuleIds.first() >= 1 && irRuleIds.last() <= irAnnos.length)),
                             "Invalid IR rule index found in validIrRulesMap for " + m);
     }
 
@@ -142,6 +81,6 @@ public class ApplicableIRRulesParser {
      * Does the list of IR rules contain any applicable IR rules for the given conditions?
      */
     private boolean hasAnyApplicableIRRules(IRRuleIds irRuleIds) {
-        return irRuleIds.first() != ApplicableIRRulesPrinter.NO_RULES;
+        return !irRuleIds.isEmpty();
     }
 }
diff --git a/test/hotspot/jtreg/compiler/lib/ir_framework/driver/irmatching/parser/IRMethodBuilder.java b/test/hotspot/jtreg/compiler/lib/ir_framework/driver/irmatching/parser/IRMethodBuilder.java
index 46a237576e6..5ce93df434c 100644
--- a/test/hotspot/jtreg/compiler/lib/ir_framework/driver/irmatching/parser/IRMethodBuilder.java
+++ b/test/hotspot/jtreg/compiler/lib/ir_framework/driver/irmatching/parser/IRMethodBuilder.java
@@ -32,6 +32,7 @@ import compiler.lib.ir_framework.driver.irmatching.irmethod.NotCompilableIRMetho
 import compiler.lib.ir_framework.driver.irmatching.parser.hotspot.HotSpotPidFileParser;
 import compiler.lib.ir_framework.driver.irmatching.parser.hotspot.LoggedMethod;
 import compiler.lib.ir_framework.driver.irmatching.parser.hotspot.LoggedMethods;
+import compiler.lib.ir_framework.driver.network.testvm.java.VMInfo;
 
 import java.util.Map;
 import java.util.SortedSet;
diff --git a/test/hotspot/jtreg/compiler/lib/ir_framework/driver/irmatching/parser/TestClassParser.java b/test/hotspot/jtreg/compiler/lib/ir_framework/driver/irmatching/parser/TestClassParser.java
index ca36a3e9f72..30a766ddd4e 100644
--- a/test/hotspot/jtreg/compiler/lib/ir_framework/driver/irmatching/parser/TestClassParser.java
+++ b/test/hotspot/jtreg/compiler/lib/ir_framework/driver/irmatching/parser/TestClassParser.java
@@ -23,6 +23,7 @@
 
 package compiler.lib.ir_framework.driver.irmatching.parser;
 
+import compiler.lib.ir_framework.TestFramework;
 import compiler.lib.ir_framework.driver.irmatching.Matchable;
 import compiler.lib.ir_framework.driver.irmatching.NonIRTestClass;
 import compiler.lib.ir_framework.driver.irmatching.TestClass;
@@ -31,6 +32,8 @@ import compiler.lib.ir_framework.driver.irmatching.irmethod.IRMethodMatchable;
 import compiler.lib.ir_framework.driver.irmatching.parser.hotspot.HotSpotPidFileParser;
 import compiler.lib.ir_framework.driver.irmatching.parser.hotspot.LoggedMethods;
 import compiler.lib.ir_framework.driver.network.TestVMData;
+import compiler.lib.ir_framework.driver.network.testvm.java.ApplicableIRRules;
+import compiler.lib.ir_framework.driver.network.testvm.java.VMInfo;
 import compiler.lib.ir_framework.shared.TestFormat;
 
 import java.util.SortedSet;
@@ -55,19 +58,20 @@ public class TestClassParser {
      * Return a default/empty TestClass object if there are no applicable @IR rules in any method of the test class.
      */
     public Matchable parse(TestVMData testVmData) {
+        ApplicableIRRules applicableIrRules = testVmData.applicableIRRules();
+        if (applicableIrRules.hasNoMethods()) {
+            return new NonIRTestClass();
+        }
         ApplicableIRRulesParser applicableIRRulesParser = new ApplicableIRRulesParser(testClass);
         TestMethods testMethods = applicableIRRulesParser.parse(testVmData.applicableIRRules());
-        VMInfo vmInfo = VMInfoParser.parseVMInfo(testVmData.vmInfo());
-        if (testMethods.hasTestMethods()) {
-            HotSpotPidFileParser hotSpotPidFileParser = new HotSpotPidFileParser(testClass.getName(), testMethods);
-            LoggedMethods loggedMethods = hotSpotPidFileParser.parse(testVmData.hotspotPidFileName());
-            return createTestClass(testMethods, loggedMethods, vmInfo);
-        }
-        return new NonIRTestClass();
+        TestFramework.check(testMethods.hasTestMethods(), "must have at least one");
+        HotSpotPidFileParser hotSpotPidFileParser = new HotSpotPidFileParser(testClass.getName(), testMethods);
+        LoggedMethods loggedMethods = hotSpotPidFileParser.parse(testVmData.hotspotPidFileName());
+        return createTestClass(testMethods, loggedMethods, testVmData.vmInfo());
     }
 
     /**
-     * Create test class with IR methods for all test methods identified by {@link ApplicableIRRulesParser} by combining them
+     * Create test class with IR methods for all test methods found in {@link ApplicableIRRules} by combining them
      * with the parsed compilation output from {@link HotSpotPidFileParser}.
      */
     private Matchable createTestClass(TestMethods testMethods, LoggedMethods loggedMethods, VMInfo vmInfo) {
diff --git a/test/hotspot/jtreg/compiler/lib/ir_framework/driver/irmatching/parser/VMInfoParser.java b/test/hotspot/jtreg/compiler/lib/ir_framework/driver/irmatching/parser/VMInfoParser.java
deleted file mode 100644
index 44013839754..00000000000
--- a/test/hotspot/jtreg/compiler/lib/ir_framework/driver/irmatching/parser/VMInfoParser.java
+++ /dev/null
@@ -1,67 +0,0 @@
-/*
- * Copyright (c) 2023, 2026, Oracle and/or its affiliates. All rights reserved.
- * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
- *
- * This code is free software; you can redistribute it and/or modify it
- * under the terms of the GNU General Public License version 2 only, as
- * published by the Free Software Foundation.
- *
- * This code is distributed in the hope that it will be useful, but WITHOUT
- * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
- * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
- * version 2 for more details (a copy is included in the LICENSE file that
- * accompanied this code).
- *
- * You should have received a copy of the GNU General Public License version
- * 2 along with this work; if not, write to the Free Software Foundation,
- * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
- *
- * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
- * or visit www.oracle.com if you need additional information or have any
- * questions.
- */
-
-package compiler.lib.ir_framework.driver.irmatching.parser;
-
-import compiler.lib.ir_framework.shared.TestFrameworkException;
-
-import java.util.HashMap;
-import java.util.Map;
-
-/**
- * Class to parse the VMInfo emitted by the Test VM and creating {@link VMInfo} objects for each entry.
- *
- * @see VMInfo
- */
-public class VMInfoParser {
-
-    /**
-     * Create a new VMInfo object from the vmInfo string.
-     */
-    public static VMInfo parseVMInfo(String vmInfo) {
-        Map<String, String> map = new HashMap<>();
-        String[] lines = getVMInfoLines(vmInfo);
-        for (String s : lines) {
-            String line = s.trim();
-            String[] splitLine = line.split(":", 2);
-            if (splitLine.length != 2) {
-                throw new TestFrameworkException("Invalid VMInfo key:value encoding. Found: " + splitLine[0]);
-            }
-            String key = splitLine[0];
-            String value = splitLine[1];
-            map.put(key, value);
-        }
-        return new VMInfo(map);
-    }
-
-    /**
-     * Extract the VMInfo from the applicableIRRules string, strip away the header and return the individual key-value lines.
-     */
-    private static String[] getVMInfoLines(String vmInfo) {
-        if (vmInfo.isEmpty()) {
-            // Nothing to IR match.
-            return new String[0];
-        }
-        return vmInfo.split("\\R");
-    }
-}
diff --git a/test/hotspot/jtreg/compiler/lib/ir_framework/driver/network/TestVMData.java b/test/hotspot/jtreg/compiler/lib/ir_framework/driver/network/TestVMData.java
index 413cf3347d8..59632ef1a48 100644
--- a/test/hotspot/jtreg/compiler/lib/ir_framework/driver/network/TestVMData.java
+++ b/test/hotspot/jtreg/compiler/lib/ir_framework/driver/network/TestVMData.java
@@ -24,7 +24,9 @@
 package compiler.lib.ir_framework.driver.network;
 
 import compiler.lib.ir_framework.driver.irmatching.IRMatcher;
+import compiler.lib.ir_framework.driver.network.testvm.java.ApplicableIRRules;
 import compiler.lib.ir_framework.driver.network.testvm.java.JavaMessages;
+import compiler.lib.ir_framework.driver.network.testvm.java.VMInfo;
 import compiler.lib.ir_framework.shared.TestFrameworkSocket;
 
 /**
@@ -42,11 +44,11 @@ public class TestVMData {
         this.allowNotCompilable = allowNotCompilable;
     }
 
-    public String applicableIRRules() {
+    public ApplicableIRRules applicableIRRules() {
         return javaMessages.applicableIRRules();
     }
 
-    public String vmInfo() {
+    public VMInfo vmInfo() {
         return javaMessages.vmInfo();
     }
 
diff --git a/test/hotspot/jtreg/compiler/lib/ir_framework/driver/network/testvm/java/ApplicableIRRules.java b/test/hotspot/jtreg/compiler/lib/ir_framework/driver/network/testvm/java/ApplicableIRRules.java
new file mode 100644
index 00000000000..eb41472057e
--- /dev/null
+++ b/test/hotspot/jtreg/compiler/lib/ir_framework/driver/network/testvm/java/ApplicableIRRules.java
@@ -0,0 +1,81 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+package compiler.lib.ir_framework.driver.network.testvm.java;
+
+import compiler.lib.ir_framework.IR;
+import compiler.lib.ir_framework.TestFramework;
+import compiler.lib.ir_framework.driver.irmatching.IRMatcher;
+
+import java.util.LinkedHashMap;
+import java.util.Map;
+import java.util.stream.Collectors;
+
+/**
+ * Class to hold the Applicable IR Rules sent by the Test VM. It specifies which {@link IR @IR} rules the
+ * {@link IRMatcher} need to check. This can be different depending on the used VM flags or the machine the test is run
+ * on itself.
+ */
+public class ApplicableIRRules implements JavaMessage {
+    private static final boolean PRINT_APPLICABLE_IR_RULES =
+            Boolean.parseBoolean(System.getProperty("PrintApplicableIRRules", "false"))
+                    || TestFramework.VERBOSE;
+
+    private final Map<String, IRRuleIds> methods;
+
+    public ApplicableIRRules() {
+        this.methods = new LinkedHashMap<>();
+    }
+
+    public void add(String method, IRRuleIds irRuleIds) {
+        methods.put(method, irRuleIds);
+    }
+
+    public IRRuleIds ruleIds(String methodName) {
+        return methods.computeIfAbsent(methodName, _ -> IRRuleIds.createEmpty());
+    }
+
+    public boolean hasNoMethods() {
+        return methods.isEmpty();
+    }
+
+    @Override
+    public void print() {
+        if (!PRINT_APPLICABLE_IR_RULES) {
+            return;
+        }
+
+        System.out.println();
+        System.out.println("Applicable IR Rules");
+        System.out.println("-------------------");
+        if (methods.isEmpty()) {
+            System.out.println("<none>");
+            return;
+        }
+        for (var entry : methods.entrySet()) {
+            String method = entry.getKey();
+            String ruleIds = entry.getValue().stream().map(String::valueOf).collect(Collectors.joining(", "));
+            System.out.println("- " + method + ": " + ruleIds);
+        }
+    }
+}
diff --git a/test/hotspot/jtreg/compiler/lib/ir_framework/driver/network/testvm/java/IRRuleIds.java b/test/hotspot/jtreg/compiler/lib/ir_framework/driver/network/testvm/java/IRRuleIds.java
index b8ea1765b4f..f5bc084fbce 100644
--- a/test/hotspot/jtreg/compiler/lib/ir_framework/driver/network/testvm/java/IRRuleIds.java
+++ b/test/hotspot/jtreg/compiler/lib/ir_framework/driver/network/testvm/java/IRRuleIds.java
@@ -49,6 +49,10 @@ public class IRRuleIds implements Iterable<Integer> {
         return ruleIds.getLast();
     }
 
+    public static IRRuleIds createEmpty() {
+        return new IRRuleIds(new ArrayList<>());
+    }
+
     public boolean isEmpty() {
         return ruleIds.isEmpty();
     }
diff --git a/test/hotspot/jtreg/compiler/lib/ir_framework/driver/network/testvm/java/JavaMessageParser.java b/test/hotspot/jtreg/compiler/lib/ir_framework/driver/network/testvm/java/JavaMessageParser.java
index 896aef38f1f..d419a06c8de 100644
--- a/test/hotspot/jtreg/compiler/lib/ir_framework/driver/network/testvm/java/JavaMessageParser.java
+++ b/test/hotspot/jtreg/compiler/lib/ir_framework/driver/network/testvm/java/JavaMessageParser.java
@@ -24,6 +24,9 @@
 package compiler.lib.ir_framework.driver.network.testvm.java;
 
 import compiler.lib.ir_framework.TestFramework;
+import compiler.lib.ir_framework.driver.network.testvm.java.multiline.ApplicableIRRulesStrategy;
+import compiler.lib.ir_framework.driver.network.testvm.java.multiline.MultiLineParser;
+import compiler.lib.ir_framework.driver.network.testvm.java.multiline.VMInfoStrategy;
 import compiler.lib.ir_framework.shared.TestFrameworkException;
 import compiler.lib.ir_framework.test.network.MessageTag;
 
@@ -43,18 +46,18 @@ public class JavaMessageParser {
     private final List<String> stdoutMessages;
     private final List<String> executedTests;
     private final Map<String, Long> methodTimes;
-    private final StringBuilder vmInfoBuilder;
-    private final StringBuilder applicableIrRules;
+    private final MultiLineParser<VMInfo> vmInfoParser;
+    private final MultiLineParser<ApplicableIRRules> applicableIRRulesParser;
 
-    private StringBuilder currentBuilder;
+    private MultiLineParser<? extends JavaMessage> currentMultiLineParser;
 
     public JavaMessageParser() {
         this.stdoutMessages = new ArrayList<>();
         this.methodTimes = new HashMap<>();
         this.executedTests = new ArrayList<>();
-        this.vmInfoBuilder = new StringBuilder();
-        this.applicableIrRules = new StringBuilder();
-        this.currentBuilder = null;
+        this.vmInfoParser = new MultiLineParser<>(new VMInfoStrategy());
+        this.applicableIRRulesParser = new MultiLineParser<>(new ApplicableIRRulesStrategy());
+        this.currentMultiLineParser = null;
     }
 
     public void parseLine(String line) {
@@ -74,12 +77,11 @@ public class JavaMessageParser {
             return;
         }
 
-        // Multi-line message for single tag.
-        currentBuilder.append(line).append(System.lineSeparator());
+        currentMultiLineParser.parseLine(line);
     }
 
     private void assertNoActiveParser() {
-        TestFramework.check(currentBuilder == null, "Unexpected new tag while parsing block");
+        TestFramework.check(currentMultiLineParser == null, "Unexpected new tag while parsing block");
     }
 
     private void parseTagLine(Matcher tagLineMatcher) {
@@ -89,8 +91,8 @@ public class JavaMessageParser {
             case STDOUT -> stdoutMessages.add(message);
             case TEST_LIST -> executedTests.add(message);
             case PRINT_TIMES -> parsePrintTimes(message);
-            case VM_INFO -> currentBuilder = vmInfoBuilder;
-            case APPLICABLE_IR_RULES -> currentBuilder = applicableIrRules;
+            case VM_INFO -> currentMultiLineParser = vmInfoParser;
+            case APPLICABLE_IR_RULES -> currentMultiLineParser = applicableIRRulesParser;
             default -> throw new TestFrameworkException("unknown tag");
         }
     }
@@ -108,18 +110,19 @@ public class JavaMessageParser {
     }
 
     private void assertActiveParser() {
-        TestFramework.check(currentBuilder != null, "Received non-tag line outside of any tag block");
+        TestFramework.check(currentMultiLineParser != null, "Received non-tag line outside of any tag block");
     }
 
     private void parseEndTag() {
-        currentBuilder = null;
+        currentMultiLineParser.markFinished();
+        currentMultiLineParser = null;
     }
 
     public JavaMessages output() {
         return new JavaMessages(new StdoutMessages(stdoutMessages),
                                 new ExecutedTests(executedTests),
                                 new MethodTimes(methodTimes),
-                                applicableIrRules.toString(),
-                                vmInfoBuilder.toString());
+                                applicableIRRulesParser.output(),
+                                vmInfoParser.output());
     }
 }
diff --git a/test/hotspot/jtreg/compiler/lib/ir_framework/driver/network/testvm/java/JavaMessages.java b/test/hotspot/jtreg/compiler/lib/ir_framework/driver/network/testvm/java/JavaMessages.java
index e47ecff4b2a..e817610f441 100644
--- a/test/hotspot/jtreg/compiler/lib/ir_framework/driver/network/testvm/java/JavaMessages.java
+++ b/test/hotspot/jtreg/compiler/lib/ir_framework/driver/network/testvm/java/JavaMessages.java
@@ -23,22 +23,18 @@
 
 package compiler.lib.ir_framework.driver.network.testvm.java;
 
-import compiler.lib.ir_framework.TestFramework;
-
 /**
  * Class to collect all Java messages sent from the Test VM to the Driver VM.
  */
 public class JavaMessages {
-    private static final boolean PRINT_APPLICABLE_IR_RULES = Boolean.parseBoolean(System.getProperty("PrintApplicableIRRules", "false"));
-
     private final StdoutMessages stdoutMessages;
     private final ExecutedTests executedTests;
     private final MethodTimes methodTimes;
-    private final String applicableIrRules;
-    private final String vmInfo;
+    private final ApplicableIRRules applicableIrRules;
+    private final VMInfo vmInfo;
 
     JavaMessages(StdoutMessages stdoutMessages, ExecutedTests executedTests, MethodTimes methodTimes,
-                 String applicableIrRules, String vmInfo) {
+                 ApplicableIRRules applicableIrRules, VMInfo vmInfo) {
         this.stdoutMessages = stdoutMessages;
         this.executedTests = executedTests;
         this.methodTimes = methodTimes;
@@ -46,21 +42,19 @@ public class JavaMessages {
         this.vmInfo = vmInfo;
     }
 
-    public String applicableIRRules() {
-        return applicableIrRules;
+    public VMInfo vmInfo() {
+        return vmInfo;
     }
 
-    public String vmInfo() {
-        return vmInfo;
+    public ApplicableIRRules applicableIRRules() {
+        return applicableIrRules;
     }
 
     public void print() {
         stdoutMessages.print();
         methodTimes.print();
         executedTests.print();
-        if (TestFramework.VERBOSE || PRINT_APPLICABLE_IR_RULES) {
-            System.out.println("Read Applicable IR Rules from Test VM:");
-            System.out.println(applicableIrRules);
-        }
+        vmInfo.print();
+        applicableIrRules.print();
     }
 }
diff --git a/test/hotspot/jtreg/compiler/lib/ir_framework/driver/irmatching/parser/VMInfo.java b/test/hotspot/jtreg/compiler/lib/ir_framework/driver/network/testvm/java/VMInfo.java
similarity index 74%
rename from test/hotspot/jtreg/compiler/lib/ir_framework/driver/irmatching/parser/VMInfo.java
rename to test/hotspot/jtreg/compiler/lib/ir_framework/driver/network/testvm/java/VMInfo.java
index 89b6d610496..a948dbc22ef 100644
--- a/test/hotspot/jtreg/compiler/lib/ir_framework/driver/irmatching/parser/VMInfo.java
+++ b/test/hotspot/jtreg/compiler/lib/ir_framework/driver/network/testvm/java/VMInfo.java
@@ -21,7 +21,7 @@
  * questions.
  */
 
-package compiler.lib.ir_framework.driver.irmatching.parser;
+package compiler.lib.ir_framework.driver.network.testvm.java;
 
 import compiler.lib.ir_framework.TestFramework;
 import compiler.lib.ir_framework.shared.TestFrameworkException;
@@ -32,31 +32,27 @@ import java.util.regex.Pattern;
 
 /**
  * This class stores the key value mapping from the VMInfo.
- *
- * @see ApplicableIRRulesParser
  */
-public class VMInfo {
+public class VMInfo implements JavaMessage {
+    private static final Pattern CPU_SKYLAKE_PATTERN =
+            Pattern.compile("family 6 model 85 stepping (\\d+) ");
+
     /**
      * Stores the key-value mapping.
      */
     private final Map<String, String> keyValueMap;
 
-    private static final Pattern CPU_SKYLAKE_PATTERN =
-            Pattern.compile("family 6 model 85 stepping (\\d+) ");
-
-    public VMInfo(Map<String, String> map) {
-        this.keyValueMap = map;
-
-        TestFramework.check(isKey("cpuFeatures"),   "VMInfo does not contain cpuFeatures");
-        TestFramework.check(isKey("MaxVectorSize"), "VMInfo does not contain MaxVectorSize");
-        TestFramework.check(isKey("MaxVectorSizeIsDefault"), "VMInfo does not contain MaxVectorSizeIsDefault");
-        TestFramework.check(isKey("LoopMaxUnroll"), "VMInfo does not contain LoopMaxUnroll");
-        TestFramework.check(isKey("UseAVX"), "VMInfo does not contain UseAVX");
-        TestFramework.check(isKey("UseAVXIsDefault"), "VMInfo does not contain UseAVXIsDefault");
+    public VMInfo(Map<String, String> keyValueMap) {
+        this.keyValueMap = keyValueMap;
     }
 
-    public String getStringValue(String key) {
-        TestFramework.check(isKey(key), "VMInfo does not contain \"" + key + "\"");
+    public boolean hasCPUFeature(String feature) {
+        String features = getStringValue("cpuFeatures") + ",";
+        return features.contains(" " + feature + ",");
+    }
+
+    private String getStringValue(String key) {
+        TestFramework.check(keyValueMap.containsKey(key), "VMInfo does not contain \"" + key + "\"");
         return keyValueMap.get(key);
     }
 
@@ -68,28 +64,6 @@ public class VMInfo {
         }
     }
 
-    public boolean hasCPUFeature(String feature) {
-        String features = getStringValue("cpuFeatures") + ",";
-        return features.contains(" " + feature + ",");
-    }
-
-    public boolean isCascadeLake() {
-        Matcher matcher = CPU_SKYLAKE_PATTERN.matcher(getStringValue("cpuFeatures"));
-        if (!matcher.find()) {
-            return false; // skylake pattern not found
-        }
-        String stepping = matcher.group(1).trim();
-        return Long.parseLong(stepping) >= 5; // this makes it Cascade Lake
-    }
-
-    public boolean isDefaultCascadeLake() {
-        // See VM_Version::is_default_intel_cascade_lake
-        return isCascadeLake() &&
-               getLongValue("MaxVectorSizeIsDefault") == 1 &&
-               getLongValue("UseAVXIsDefault") == 1 &&
-               getLongValue("UseAVX") > 2;
-    }
-
     /**
      * Some platforms do not behave as expected, and one cannot trust that the vectors
      * make use of the full MaxVectorSize. For Cascade Lake, we only use 32 bytes for
@@ -101,7 +75,36 @@ public class VMInfo {
         return !isDefaultCascadeLake();
     }
 
-    public boolean isKey(String key) {
-        return keyValueMap.containsKey(key);
+    private boolean isDefaultCascadeLake() {
+        // See VM_Version::is_default_intel_cascade_lake
+        return isCascadeLake() &&
+               getLongValue("MaxVectorSizeIsDefault") == 1 &&
+               getLongValue("UseAVXIsDefault") == 1 &&
+               getLongValue("UseAVX") > 2;
+    }
+
+    private boolean isCascadeLake() {
+        Matcher matcher = CPU_SKYLAKE_PATTERN.matcher(getStringValue("cpuFeatures"));
+        if (!matcher.find()) {
+            return false; // skylake pattern not found
+        }
+        String stepping = matcher.group(1).trim();
+        return Long.parseLong(stepping) >= 5; // this makes it Cascade Lake
+    }
+
+    @Override
+    public void print() {
+        if (!TestFramework.VERBOSE) {
+            return;
+        }
+
+        System.out.println();
+        System.out.println("VM Info");
+        System.out.println("--------");
+        for (var entry : keyValueMap.entrySet()) {
+            String key = entry.getKey();
+            String value = entry.getValue();
+            System.out.println("- Key: " + key + ", Value: " + value);
+        }
     }
 }
diff --git a/test/hotspot/jtreg/compiler/lib/ir_framework/driver/network/testvm/java/multiline/ApplicableIRRulesStrategy.java b/test/hotspot/jtreg/compiler/lib/ir_framework/driver/network/testvm/java/multiline/ApplicableIRRulesStrategy.java
new file mode 100644
index 00000000000..3728e489ba7
--- /dev/null
+++ b/test/hotspot/jtreg/compiler/lib/ir_framework/driver/network/testvm/java/multiline/ApplicableIRRulesStrategy.java
@@ -0,0 +1,78 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+package compiler.lib.ir_framework.driver.network.testvm.java.multiline;
+
+import compiler.lib.ir_framework.driver.network.testvm.java.ApplicableIRRules;
+import compiler.lib.ir_framework.driver.network.testvm.java.IRRuleIds;
+import compiler.lib.ir_framework.shared.TestFrameworkException;
+import compiler.lib.ir_framework.test.ApplicableIRRulesPrinter;
+
+import java.util.ArrayList;
+import java.util.List;
+
+/**
+ * Dedicated strategy to parse the multi-line Applicable IR Rules message into a new {@link ApplicableIRRules} object.
+ */
+public class ApplicableIRRulesStrategy implements MultiLineParsingStrategy<ApplicableIRRules> {
+    private final ApplicableIRRules applicableIrRules;
+
+    public ApplicableIRRulesStrategy() {
+        this.applicableIrRules = new ApplicableIRRules();
+    }
+
+    @Override
+    public void parseLine(String line) {
+        if (line.equals(ApplicableIRRulesPrinter.NO_RULES)) {
+            return;
+        }
+
+        String[] splitLine = line.split(",");
+        if (splitLine.length < 2) {
+            throw new TestFrameworkException("Invalid Applicable IR Rules format. No comma found: " + splitLine[0]);
+        }
+        String testName = splitLine[0];
+        IRRuleIds irRulesIds = parseIrRulesIds(splitLine);
+        applicableIrRules.add(testName, irRulesIds);
+    }
+
+    /**
+     * Parse rule indexes from a single line of the Applicable IR Rules in the format: <method,idx1,idx2,...>
+     */
+    private IRRuleIds parseIrRulesIds(String[] splitLine) {
+        List<Integer> irRuleIds = new ArrayList<>();
+        for (int i = 1; i < splitLine.length; i++) {
+            try {
+                irRuleIds.add(Integer.parseInt(splitLine[i]));
+            } catch (NumberFormatException e) {
+                throw new TestFrameworkException("Invalid Applicable IR Rules format. No number found: " + splitLine[i]);
+            }
+        }
+        return new IRRuleIds(irRuleIds);
+    }
+
+    @Override
+    public ApplicableIRRules output() {
+        return applicableIrRules;
+    }
+}
diff --git a/test/hotspot/jtreg/compiler/lib/ir_framework/driver/network/testvm/java/multiline/MultiLineParser.java b/test/hotspot/jtreg/compiler/lib/ir_framework/driver/network/testvm/java/multiline/MultiLineParser.java
new file mode 100644
index 00000000000..fbc24eed736
--- /dev/null
+++ b/test/hotspot/jtreg/compiler/lib/ir_framework/driver/network/testvm/java/multiline/MultiLineParser.java
@@ -0,0 +1,67 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+package compiler.lib.ir_framework.driver.network.testvm.java.multiline;
+
+import compiler.lib.ir_framework.TestFramework;
+import compiler.lib.ir_framework.driver.network.testvm.java.JavaMessage;
+import compiler.lib.ir_framework.test.network.MessageTag;
+
+/**
+ * Generic multi-line parser that takes a {@link MultiLineParsingStrategy} to decide how to parse a single line of
+ * a multi line {@link JavaMessage}. Once parsing is done, the strategy is queried for the final parsed output.
+ */
+public class MultiLineParser<Output extends JavaMessage> {
+    private enum ParserState {
+        NOTHING_PARSED, PARSING, FINISHED_PARSING
+    }
+
+    private ParserState parserState;
+    private final MultiLineParsingStrategy<Output> multiLineParsingStrategy;
+
+    public MultiLineParser(MultiLineParsingStrategy<Output> multiLineParsingStrategy) {
+        this.multiLineParsingStrategy = multiLineParsingStrategy;
+        this.parserState = ParserState.NOTHING_PARSED;
+    }
+
+    public void parseLine(String line) {
+        TestFramework.check(parserState != ParserState.FINISHED_PARSING,
+                            "cannot parse another block");
+        parserState = ParserState.PARSING;
+        multiLineParsingStrategy.parseLine(line);
+    }
+
+    /**
+     * Once the {@link MessageTag#END_MARKER} was seen, this method is called to mark the end of this multi-line message.
+     */
+    public void markFinished() {
+        TestFramework.check(parserState == ParserState.PARSING,
+                            "nothing parsed, cannot have empty block");
+        parserState = ParserState.FINISHED_PARSING;
+    }
+
+    public Output output() {
+        TestFramework.check(parserState != ParserState.PARSING, "either nothing parsed or finished");
+        return multiLineParsingStrategy.output();
+    }
+}
diff --git a/test/hotspot/jtreg/compiler/lib/ir_framework/driver/network/testvm/java/multiline/MultiLineParsingStrategy.java b/test/hotspot/jtreg/compiler/lib/ir_framework/driver/network/testvm/java/multiline/MultiLineParsingStrategy.java
new file mode 100644
index 00000000000..0283c520465
--- /dev/null
+++ b/test/hotspot/jtreg/compiler/lib/ir_framework/driver/network/testvm/java/multiline/MultiLineParsingStrategy.java
@@ -0,0 +1,32 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+package compiler.lib.ir_framework.driver.network.testvm.java.multiline;
+
+/**
+ * Interface to define a strategy to parse a line in a {@link MultiLineParser}.
+ */
+public interface MultiLineParsingStrategy<Output> {
+    void parseLine(String line);
+    Output output();
+}
diff --git a/test/hotspot/jtreg/compiler/lib/ir_framework/driver/network/testvm/java/multiline/VMInfoStrategy.java b/test/hotspot/jtreg/compiler/lib/ir_framework/driver/network/testvm/java/multiline/VMInfoStrategy.java
new file mode 100644
index 00000000000..7d3072394c0
--- /dev/null
+++ b/test/hotspot/jtreg/compiler/lib/ir_framework/driver/network/testvm/java/multiline/VMInfoStrategy.java
@@ -0,0 +1,57 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+package compiler.lib.ir_framework.driver.network.testvm.java.multiline;
+
+import compiler.lib.ir_framework.driver.network.testvm.java.VMInfo;
+import compiler.lib.ir_framework.shared.TestFrameworkException;
+
+import java.util.HashMap;
+import java.util.Map;
+
+/**
+ * Dedicated strategy to parse the multi-line VM info message into a new {@link VMInfo} object.
+ */
+public class VMInfoStrategy implements MultiLineParsingStrategy<VMInfo> {
+    private final Map<String, String> keyValueMap;
+
+    public VMInfoStrategy() {
+        this.keyValueMap = new HashMap<>();
+    }
+
+    @Override
+    public void parseLine(String line) {
+        String[] splitLine = line.split(":", 2);
+        if (splitLine.length != 2) {
+            throw new TestFrameworkException("Invalid VmInfo key:value encoding. Found: " + splitLine[0]);
+        }
+        String key = splitLine[0];
+        String value = splitLine[1];
+        keyValueMap.put(key, value);
+    }
+
+    @Override
+    public VMInfo output() {
+        return new VMInfo(keyValueMap);
+    }
+}
diff --git a/test/hotspot/jtreg/compiler/lib/ir_framework/test/ApplicableIRRulesPrinter.java b/test/hotspot/jtreg/compiler/lib/ir_framework/test/ApplicableIRRulesPrinter.java
index 79f5c7fe18e..a4797a29dc7 100644
--- a/test/hotspot/jtreg/compiler/lib/ir_framework/test/ApplicableIRRulesPrinter.java
+++ b/test/hotspot/jtreg/compiler/lib/ir_framework/test/ApplicableIRRulesPrinter.java
@@ -47,7 +47,7 @@ import java.util.function.Function;
  * termination of the Test VM. IR rule indices start at 1.
  */
 public class ApplicableIRRulesPrinter {
-    public static final int NO_RULES = -1;
+    public static final String NO_RULES = "<no IR rules>";
 
     private static final WhiteBox WHITE_BOX = WhiteBox.getWhiteBox();
     private static final List<Function<String, Object>> LONG_GETTERS = Arrays.asList(
@@ -155,17 +155,15 @@ public class ApplicableIRRulesPrinter {
                 i++;
             }
         }
-        if (irAnnos.length != 0) {
-            output.append(m.getName());
-            if (validRules.isEmpty()) {
-                output.append("," + NO_RULES);
-            } else {
-                for (i = 0; i < validRules.size(); i++) {
-                    output.append(",").append(validRules.get(i));
-                }
-            }
-            output.append(System.lineSeparator());
+
+        if (irAnnos.length == 0 || validRules.isEmpty()) {
+            return;
         }
+        output.append(m.getName());
+        for (i = 0; i < validRules.size(); i++) {
+            output.append(",").append(validRules.get(i));
+        }
+        output.append(System.lineSeparator());
     }
 
     private void printDisableReason(String method, String reason, String[] apply, int ruleIndex, int ruleMax) {
@@ -520,9 +518,10 @@ public class ApplicableIRRulesPrinter {
     }
 
     public void emit() {
+        if (output.isEmpty()) {
+            output.append(NO_RULES).append(System.lineSeparator());
+        }
         output.append(MessageTag.END_MARKER);
         TestVmSocket.sendMultiLine(MessageTag.APPLICABLE_IR_RULES, output.toString());
     }
 }
-
-
diff --git a/test/hotspot/jtreg/testlibrary_tests/ir_framework/tests/TestIRMatching.java b/test/hotspot/jtreg/testlibrary_tests/ir_framework/tests/TestIRMatching.java
index b6881fede75..fc8a92cf9a2 100644
--- a/test/hotspot/jtreg/testlibrary_tests/ir_framework/tests/TestIRMatching.java
+++ b/test/hotspot/jtreg/testlibrary_tests/ir_framework/tests/TestIRMatching.java
@@ -329,7 +329,7 @@ public class TestIRMatching {
         System.out.flush();
         String output = baos.toString();
         findIrIds(output, "testMatchAllIf50", 1, 22);
-        findIrIds(output, "testMatchNoneIf50", -1, -1);
+        assertNoIds(output, "testMatchNoneIf50");
 
         runWithArguments(FlagComparisons.class, "-XX:TLABRefillWasteFraction=49");
         System.out.flush();
@@ -431,12 +431,14 @@ public class TestIRMatching {
 
     private static void findIrIds(String output, String method, int... numbers) {
         StringBuilder builder = new StringBuilder();
-        builder.append(method);
+        builder.append(method).append(": ");
         for (int i = 0; i < numbers.length; i+=2) {
             int start = numbers[i];
             int endIncluded = numbers[i + 1];
             for (int j = start; j <= endIncluded; j++) {
-                builder.append(",");
+                if (j != numbers[0]) {
+                    builder.append(", ");
+                }
                 builder.append(j);
             }
         }
@@ -445,6 +447,13 @@ public class TestIRMatching {
                                                       System.lineSeparator()));
         }
     }
+
+    private static void assertNoIds(String output, String methodName) {
+        String applicableIRRules = output.split("Applicable IR Rules")[1];
+        if (applicableIRRules.contains(methodName)) {
+            addException(new RuntimeException("Should not find ids for \"" + methodName + "\"" + System.lineSeparator()));
+        }
+    }
 }
 
 class AndOr1 {

From 4df61ce3fc492c82e6c832236e21b2fed4908939 Mon Sep 17 00:00:00 2001
From: Albert Mingkun Yang <ayang@openjdk.org>
Date: Mon, 23 Mar 2026 08:03:54 +0000
Subject: [PATCH 299/655] 8380532: Parallel: Rename allocate to cas_allocate in
 PSYoungGen

Reviewed-by: tschatzl, jsikstro
---
 src/hotspot/share/gc/parallel/parallelScavengeHeap.cpp | 2 +-
 src/hotspot/share/gc/parallel/psYoungGen.hpp           | 2 +-
 2 files changed, 2 insertions(+), 2 deletions(-)

diff --git a/src/hotspot/share/gc/parallel/parallelScavengeHeap.cpp b/src/hotspot/share/gc/parallel/parallelScavengeHeap.cpp
index f49419595e1..337b2ccdd10 100644
--- a/src/hotspot/share/gc/parallel/parallelScavengeHeap.cpp
+++ b/src/hotspot/share/gc/parallel/parallelScavengeHeap.cpp
@@ -272,7 +272,7 @@ HeapWord* ParallelScavengeHeap::mem_allocate(size_t size) {
 
 HeapWord* ParallelScavengeHeap::mem_allocate_cas_noexpand(size_t size, bool is_tlab) {
   // Try young-gen first.
-  HeapWord* result = young_gen()->allocate(size);
+  HeapWord* result = young_gen()->cas_allocate(size);
   if (result != nullptr) {
     return result;
   }
diff --git a/src/hotspot/share/gc/parallel/psYoungGen.hpp b/src/hotspot/share/gc/parallel/psYoungGen.hpp
index 10aa037da98..ed10806ac99 100644
--- a/src/hotspot/share/gc/parallel/psYoungGen.hpp
+++ b/src/hotspot/share/gc/parallel/psYoungGen.hpp
@@ -128,7 +128,7 @@ class PSYoungGen : public CHeapObj<mtGC> {
   size_t max_gen_size() const { return _max_gen_size; }
 
   // Allocation
-  HeapWord* allocate(size_t word_size) {
+  HeapWord* cas_allocate(size_t word_size) {
     HeapWord* result = eden_space()->cas_allocate(word_size);
     return result;
   }

From caf37add7ac32e55d0aae161cafa6a379c58c56f Mon Sep 17 00:00:00 2001
From: Guanqiang Han <ghan@openjdk.org>
Date: Mon, 23 Mar 2026 08:11:22 +0000
Subject: [PATCH 300/655] 8374789: C2: refactor GraphKit code that create AddP
 nodes for raw memory to use helper method

Reviewed-by: chagedorn, qamai
---
 .../share/gc/shared/c2/barrierSetC2.cpp       |  8 +--
 .../shenandoah/c2/shenandoahBarrierSetC2.cpp  |  4 +-
 .../gc/shenandoah/c2/shenandoahSupport.cpp    |  4 +-
 src/hotspot/share/opto/addnode.cpp            | 14 ++--
 src/hotspot/share/opto/addnode.hpp            | 28 ++++++--
 src/hotspot/share/opto/arraycopynode.cpp      | 30 ++++----
 src/hotspot/share/opto/callnode.cpp           |  4 +-
 src/hotspot/share/opto/castnode.cpp           |  4 +-
 src/hotspot/share/opto/cfgnode.cpp            |  2 +-
 src/hotspot/share/opto/escape.cpp             |  2 +-
 src/hotspot/share/opto/generateOptoStub.cpp   | 17 +++--
 src/hotspot/share/opto/graphKit.cpp           | 18 ++---
 src/hotspot/share/opto/graphKit.hpp           |  9 ++-
 src/hotspot/share/opto/idealKit.hpp           |  4 +-
 src/hotspot/share/opto/library_call.cpp       | 68 +++++++++----------
 src/hotspot/share/opto/loopTransform.cpp      |  4 +-
 src/hotspot/share/opto/loopopts.cpp           |  8 +--
 src/hotspot/share/opto/macro.cpp              | 32 ++++-----
 src/hotspot/share/opto/macro.hpp              | 22 ++++--
 src/hotspot/share/opto/macroArrayCopy.cpp     |  6 +-
 src/hotspot/share/opto/memnode.cpp            | 13 ++--
 src/hotspot/share/opto/parse1.cpp             | 22 +++---
 src/hotspot/share/opto/parseHelper.cpp        |  4 +-
 src/hotspot/share/opto/subtypenode.cpp        |  8 +--
 24 files changed, 182 insertions(+), 153 deletions(-)

diff --git a/src/hotspot/share/gc/shared/c2/barrierSetC2.cpp b/src/hotspot/share/gc/shared/c2/barrierSetC2.cpp
index ad7fc31dc09..a888ea81707 100644
--- a/src/hotspot/share/gc/shared/c2/barrierSetC2.cpp
+++ b/src/hotspot/share/gc/shared/c2/barrierSetC2.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -758,8 +758,8 @@ Node* BarrierSetC2::obj_allocate(PhaseMacroExpand* macro, Node* mem, Node* toobi
   assert(UseTLAB, "Only for TLAB enabled allocations");
 
   Node* thread = macro->transform_later(new ThreadLocalNode());
-  Node* tlab_top_adr = macro->basic_plus_adr(macro->top()/*not oop*/, thread, in_bytes(JavaThread::tlab_top_offset()));
-  Node* tlab_end_adr = macro->basic_plus_adr(macro->top()/*not oop*/, thread, in_bytes(JavaThread::tlab_end_offset()));
+  Node* tlab_top_adr = macro->off_heap_plus_addr(thread, in_bytes(JavaThread::tlab_top_offset()));
+  Node* tlab_end_adr = macro->off_heap_plus_addr(thread, in_bytes(JavaThread::tlab_end_offset()));
 
   // Load TLAB end.
   //
@@ -778,7 +778,7 @@ Node* BarrierSetC2::obj_allocate(PhaseMacroExpand* macro, Node* mem, Node* toobi
   macro->transform_later(old_tlab_top);
 
   // Add to heap top to get a new TLAB top
-  Node* new_tlab_top = new AddPNode(macro->top(), old_tlab_top, size_in_bytes);
+  Node* new_tlab_top = AddPNode::make_off_heap(old_tlab_top, size_in_bytes);
   macro->transform_later(new_tlab_top);
 
   // Check against TLAB end
diff --git a/src/hotspot/share/gc/shenandoah/c2/shenandoahBarrierSetC2.cpp b/src/hotspot/share/gc/shenandoah/c2/shenandoahBarrierSetC2.cpp
index 1947c75314e..f721c3cd001 100644
--- a/src/hotspot/share/gc/shenandoah/c2/shenandoahBarrierSetC2.cpp
+++ b/src/hotspot/share/gc/shenandoah/c2/shenandoahBarrierSetC2.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2023, Red Hat, Inc. All rights reserved.
+ * Copyright (c) 2018, 2026, Red Hat, Inc. All rights reserved.
  * Copyright Amazon.com Inc. or its affiliates. All Rights Reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
@@ -918,7 +918,7 @@ void ShenandoahBarrierSetC2::clone_at_expansion(PhaseMacroExpand* phase, ArrayCo
 
     Node* thread = phase->transform_later(new ThreadLocalNode());
     Node* offset = phase->igvn().MakeConX(in_bytes(ShenandoahThreadLocalData::gc_state_offset()));
-    Node* gc_state_addr = phase->transform_later(new AddPNode(phase->C->top(), thread, offset));
+    Node* gc_state_addr = phase->transform_later(AddPNode::make_off_heap(thread, offset));
 
     uint gc_state_idx = Compile::AliasIdxRaw;
     const TypePtr* gc_state_adr_type = nullptr; // debug-mode-only argument
diff --git a/src/hotspot/share/gc/shenandoah/c2/shenandoahSupport.cpp b/src/hotspot/share/gc/shenandoah/c2/shenandoahSupport.cpp
index 40fe0c00490..015276feb5c 100644
--- a/src/hotspot/share/gc/shenandoah/c2/shenandoahSupport.cpp
+++ b/src/hotspot/share/gc/shenandoah/c2/shenandoahSupport.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2015, 2021, Red Hat, Inc. All rights reserved.
+ * Copyright (c) 2015, 2026, Red Hat, Inc. All rights reserved.
  * Copyright (C) 2022, Tencent. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
@@ -871,7 +871,7 @@ void ShenandoahBarrierC2Support::test_gc_state(Node*& ctrl, Node* raw_mem, Node*
 
   Node* thread          = new ThreadLocalNode();
   Node* gc_state_offset = igvn.MakeConX(in_bytes(ShenandoahThreadLocalData::gc_state_offset()));
-  Node* gc_state_addr   = new AddPNode(phase->C->top(), thread, gc_state_offset);
+  Node* gc_state_addr   = AddPNode::make_off_heap(thread, gc_state_offset);
   Node* gc_state        = new LoadBNode(old_ctrl, raw_mem, gc_state_addr,
                                         DEBUG_ONLY(phase->C->get_adr_type(Compile::AliasIdxRaw)) NOT_DEBUG(nullptr),
                                         TypeInt::BYTE, MemNode::unordered);
diff --git a/src/hotspot/share/opto/addnode.cpp b/src/hotspot/share/opto/addnode.cpp
index e04da430ef0..5520e4ae977 100644
--- a/src/hotspot/share/opto/addnode.cpp
+++ b/src/hotspot/share/opto/addnode.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1997, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -816,7 +816,7 @@ Node *AddPNode::Ideal(PhaseGVN *phase, bool can_reshape) {
         offset  = phase->MakeConX(t2->get_con() + t12->get_con());
       } else {
         // Else move the constant to the right.  ((A+con)+B) into ((A+B)+con)
-        address = phase->transform(new AddPNode(in(Base),addp->in(Address),in(Offset)));
+        address = phase->transform(AddPNode::make_with_base(in(Base), addp->in(Address), in(Offset)));
         offset  = addp->in(Offset);
       }
       set_req_X(Address, address, phase);
@@ -838,11 +838,11 @@ Node *AddPNode::Ideal(PhaseGVN *phase, bool can_reshape) {
   // Convert: (ptr + (offset+con)) into (ptr+offset)+con.
   // The idea is to merge array_base+scaled_index groups together,
   // and only have different constant offsets from the same base.
-  const Node *add = in(Offset);
-  if( add->Opcode() == Op_AddX && add->in(1) != add ) {
-    const Type *t22 = phase->type( add->in(2) );
-    if( t22->singleton() && (t22 != Type::TOP) ) {  // Right input is an add of a constant?
-      set_req(Address, phase->transform(new AddPNode(in(Base),in(Address),add->in(1))));
+  const Node* add = in(Offset);
+  if (add->Opcode() == Op_AddX && add->in(1) != add) {
+    const Type* t22 = phase->type(add->in(2));
+    if (t22->singleton() && (t22 != Type::TOP)) {  // Right input is an add of a constant?
+      set_req(Address, phase->transform(AddPNode::make_with_base(in(Base), in(Address), add->in(1))));
       set_req_X(Offset, add->in(2), phase); // puts add on igvn worklist if needed
       return this;              // Made progress
     }
diff --git a/src/hotspot/share/opto/addnode.hpp b/src/hotspot/share/opto/addnode.hpp
index 6128de00efb..793eff8dd5d 100644
--- a/src/hotspot/share/opto/addnode.hpp
+++ b/src/hotspot/share/opto/addnode.hpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1997, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -221,17 +221,19 @@ public:
 // So not really an AddNode.  Lives here, because people associate it with
 // an add.
 class AddPNode : public Node {
+private:
+  AddPNode(Node* base, Node* ptr, Node* off) : Node(nullptr, base, ptr, off) {
+    init_class_id(Class_AddP);
+    assert((ptr->bottom_type() == Type::TOP) ||
+           ((base == Compile::current()->top()) == (ptr->bottom_type()->make_ptr()->isa_oopptr() == nullptr)),
+           "base input only needed for heap addresses");
+  }
+
 public:
   enum { Control,               // When is it safe to do this add?
          Base,                  // Base oop, for GC purposes
          Address,               // Actually address, derived from base
          Offset } ;             // Offset added to address
-  AddPNode(Node *base, Node *ptr, Node *off) : Node(nullptr,base,ptr,off) {
-    init_class_id(Class_AddP);
-    assert((ptr->bottom_type() == Type::TOP) ||
-      ((base == Compile::current()->top()) == (ptr->bottom_type()->make_ptr()->isa_oopptr() == nullptr)),
-      "base input only needed for heap addresses");
-  }
   virtual int Opcode() const;
   virtual Node* Identity(PhaseGVN* phase);
   virtual Node *Ideal(PhaseGVN *phase, bool can_reshape);
@@ -243,6 +245,18 @@ public:
                                      // second return value:
                                      intptr_t& offset);
 
+  static AddPNode* make_with_base(Node* base, Node* ptr, Node* offset) {
+    return new AddPNode(base, ptr, offset);
+  }
+
+  static AddPNode* make_with_base(Node* base, Node* offset) {
+    return make_with_base(base, base, offset);
+  }
+
+  static AddPNode* make_off_heap(Node* ptr, Node* offset) {
+    return make_with_base(Compile::current()->top(), ptr, offset);
+  }
+
   // Collect the AddP offset values into the elements array, giving up
   // if there are more than length.
   int unpack_offsets(Node* elements[], int length) const;
diff --git a/src/hotspot/share/opto/arraycopynode.cpp b/src/hotspot/share/opto/arraycopynode.cpp
index 3b006ae6b11..82d17440c56 100644
--- a/src/hotspot/share/opto/arraycopynode.cpp
+++ b/src/hotspot/share/opto/arraycopynode.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2016, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2016, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -226,8 +226,8 @@ Node* ArrayCopyNode::try_clone_instance(PhaseGVN *phase, bool can_reshape, int c
     ciField* field = ik->nonstatic_field_at(i);
     const TypePtr* adr_type = phase->C->alias_type(field)->adr_type();
     Node* off = phase->MakeConX(field->offset_in_bytes());
-    Node* next_src = phase->transform(new AddPNode(base_src,base_src,off));
-    Node* next_dest = phase->transform(new AddPNode(base_dest,base_dest,off));
+    Node* next_src = phase->transform(AddPNode::make_with_base(base_src, off));
+    Node* next_dest = phase->transform(AddPNode::make_with_base(base_dest, off));
     assert(phase->C->get_alias_index(adr_type) == phase->C->get_alias_index(phase->type(next_src)->isa_ptr()),
       "slice of address and input slice don't match");
     assert(phase->C->get_alias_index(adr_type) == phase->C->get_alias_index(phase->type(next_dest)->isa_ptr()),
@@ -332,11 +332,11 @@ bool ArrayCopyNode::prepare_array_copy(PhaseGVN *phase, bool can_reshape,
 
     Node* dest_scale = phase->transform(new LShiftXNode(dest_offset, phase->intcon(shift)));
 
-    adr_src          = phase->transform(new AddPNode(base_src, base_src, src_scale));
-    adr_dest         = phase->transform(new AddPNode(base_dest, base_dest, dest_scale));
+    adr_src = phase->transform(AddPNode::make_with_base(base_src, src_scale));
+    adr_dest = phase->transform(AddPNode::make_with_base(base_dest, dest_scale));
 
-    adr_src          = phase->transform(new AddPNode(base_src, adr_src, phase->MakeConX(header)));
-    adr_dest         = phase->transform(new AddPNode(base_dest, adr_dest, phase->MakeConX(header)));
+    adr_src = phase->transform(AddPNode::make_with_base(base_src, adr_src, phase->MakeConX(header)));
+    adr_dest = phase->transform(AddPNode::make_with_base(base_dest, adr_dest, phase->MakeConX(header)));
 
     copy_type = dest_elem;
   } else {
@@ -355,8 +355,8 @@ bool ArrayCopyNode::prepare_array_copy(PhaseGVN *phase, bool can_reshape,
       return false;
     }
 
-    adr_src  = phase->transform(new AddPNode(base_src, base_src, src_offset));
-    adr_dest = phase->transform(new AddPNode(base_dest, base_dest, dest_offset));
+    adr_src = phase->transform(AddPNode::make_with_base(base_src, src_offset));
+    adr_dest = phase->transform(AddPNode::make_with_base(base_dest, dest_offset));
 
     // The address is offsetted to an aligned address where a raw copy would start.
     // If the clone copy is decomposed into load-stores - the address is adjusted to
@@ -366,8 +366,8 @@ bool ArrayCopyNode::prepare_array_copy(PhaseGVN *phase, bool can_reshape,
     int diff = arrayOopDesc::base_offset_in_bytes(elem) - offset;
     assert(diff >= 0, "clone should not start after 1st array element");
     if (diff > 0) {
-      adr_src = phase->transform(new AddPNode(base_src, adr_src, phase->MakeConX(diff)));
-      adr_dest = phase->transform(new AddPNode(base_dest, adr_dest, phase->MakeConX(diff)));
+      adr_src = phase->transform(AddPNode::make_with_base(base_src, adr_src, phase->MakeConX(diff)));
+      adr_dest = phase->transform(AddPNode::make_with_base(base_dest, adr_dest, phase->MakeConX(diff)));
     }
     copy_type = elem;
     value_type = ary_src->elem();
@@ -425,12 +425,12 @@ Node* ArrayCopyNode::array_copy_forward(PhaseGVN *phase,
       store(bs, phase, forward_ctl, mm, adr_dest, atp_dest, v, value_type, copy_type);
       for (int i = 1; i < count; i++) {
         Node* off  = phase->MakeConX(type2aelembytes(copy_type) * i);
-        Node* next_src = phase->transform(new AddPNode(base_src,adr_src,off));
+        Node* next_src = phase->transform(AddPNode::make_with_base(base_src,adr_src,off));
         // We may have narrowed the type of next_src right before calling this method but because this runs with
         // PhaseIterGVN::_delay_transform true, explicitly update the type of the AddP so it's consistent  with its
         // base and load() picks the right memory slice.
         phase->set_type(next_src, next_src->Value(phase));
-        Node* next_dest = phase->transform(new AddPNode(base_dest,adr_dest,off));
+        Node* next_dest = phase->transform(AddPNode::make_with_base(base_dest,adr_dest,off));
         // Same as above
         phase->set_type(next_dest, next_dest->Value(phase));
         v = load(bs, phase, forward_ctl, mm, next_src, atp_src, value_type, copy_type);
@@ -469,12 +469,12 @@ Node* ArrayCopyNode::array_copy_backward(PhaseGVN *phase,
     if (count > 0) {
       for (int i = count-1; i >= 1; i--) {
         Node* off  = phase->MakeConX(type2aelembytes(copy_type) * i);
-        Node* next_src = phase->transform(new AddPNode(base_src,adr_src,off));
+        Node* next_src = phase->transform(AddPNode::make_with_base(base_src,adr_src,off));
         // We may have narrowed the type of next_src right before calling this method but because this runs with
         // PhaseIterGVN::_delay_transform true, explicitly update the type of the AddP so it's consistent  with its
         // base and store() picks the right memory slice.
         phase->set_type(next_src, next_src->Value(phase));
-        Node* next_dest = phase->transform(new AddPNode(base_dest,adr_dest,off));
+        Node* next_dest = phase->transform(AddPNode::make_with_base(base_dest,adr_dest,off));
         phase->set_type(next_dest, next_dest->Value(phase));
         Node* v = load(bs, phase, backward_ctl, mm, next_src, atp_src, value_type, copy_type);
         store(bs, phase, backward_ctl, mm, next_dest, atp_dest, v, value_type, copy_type);
diff --git a/src/hotspot/share/opto/callnode.cpp b/src/hotspot/share/opto/callnode.cpp
index d4c832359d6..e01feb874ef 100644
--- a/src/hotspot/share/opto/callnode.cpp
+++ b/src/hotspot/share/opto/callnode.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1997, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -1745,7 +1745,7 @@ Node *AllocateNode::make_ideal_mark(PhaseGVN* phase, Node* control, Node* mem) {
   Node* mark_node = nullptr;
   if (UseCompactObjectHeaders) {
     Node* klass_node = in(AllocateNode::KlassNode);
-    Node* proto_adr = phase->transform(new AddPNode(phase->C->top(), klass_node, phase->MakeConX(in_bytes(Klass::prototype_header_offset()))));
+    Node* proto_adr = phase->transform(AddPNode::make_off_heap(klass_node, phase->MakeConX(in_bytes(Klass::prototype_header_offset()))));
     mark_node = LoadNode::make(*phase, control, mem, proto_adr, phase->type(proto_adr)->is_ptr(), TypeX_X, TypeX_X->basic_type(), MemNode::unordered);
   } else {
     // For now only enable fast locking for non-array types
diff --git a/src/hotspot/share/opto/castnode.cpp b/src/hotspot/share/opto/castnode.cpp
index 4e3750b5ee5..54269a56c19 100644
--- a/src/hotspot/share/opto/castnode.cpp
+++ b/src/hotspot/share/opto/castnode.cpp
@@ -470,9 +470,7 @@ static inline Node* addP_of_X2P(PhaseGVN *phase,
   if (negate) {
     dispX = phase->transform(new SubXNode(phase->MakeConX(0), dispX));
   }
-  return new AddPNode(phase->C->top(),
-                      phase->transform(new CastX2PNode(base)),
-                      dispX);
+  return AddPNode::make_off_heap(phase->transform(new CastX2PNode(base)), dispX);
 }
 
 Node *CastX2PNode::Ideal(PhaseGVN *phase, bool can_reshape) {
diff --git a/src/hotspot/share/opto/cfgnode.cpp b/src/hotspot/share/opto/cfgnode.cpp
index 04061a60bad..a251a253ed1 100644
--- a/src/hotspot/share/opto/cfgnode.cpp
+++ b/src/hotspot/share/opto/cfgnode.cpp
@@ -2480,7 +2480,7 @@ Node *PhiNode::Ideal(PhaseGVN *phase, bool can_reshape) {
           }
           phase->is_IterGVN()->register_new_node_with_optimizer(offset);
         }
-        return new AddPNode(base, address, offset);
+        return AddPNode::make_with_base(base, address, offset);
       }
     }
   }
diff --git a/src/hotspot/share/opto/escape.cpp b/src/hotspot/share/opto/escape.cpp
index 5befdd924ff..7041eb0b810 100644
--- a/src/hotspot/share/opto/escape.cpp
+++ b/src/hotspot/share/opto/escape.cpp
@@ -780,7 +780,7 @@ Node* ConnectionGraph::split_castpp_load_through_phi(Node* curr_addp, Node* curr
         base = base->find_out_with(Op_CastPP);
       }
 
-      Node* addr = _igvn->transform(new AddPNode(base, base, curr_addp->in(AddPNode::Offset)));
+      Node* addr = _igvn->transform(AddPNode::make_with_base(base, curr_addp->in(AddPNode::Offset)));
       Node* mem = (memory->is_Phi() && (memory->in(0) == region)) ? memory->in(i) : memory;
       Node* load = curr_load->clone();
       load->set_req(0, nullptr);
diff --git a/src/hotspot/share/opto/generateOptoStub.cpp b/src/hotspot/share/opto/generateOptoStub.cpp
index 77633857cdf..d719c301dc6 100644
--- a/src/hotspot/share/opto/generateOptoStub.cpp
+++ b/src/hotspot/share/opto/generateOptoStub.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1999, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1999, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -88,18 +88,17 @@ void GraphKit::gen_stub(address C_function,
 
   const int NoAlias = Compile::AliasIdxBot;
 
-  Node* adr_last_Java_pc = basic_plus_adr(top(),
-                                            thread,
-                                            in_bytes(JavaThread::frame_anchor_offset()) +
-                                            in_bytes(JavaFrameAnchor::last_Java_pc_offset()));
+  Node* adr_last_Java_pc = off_heap_plus_addr(thread,
+                                              in_bytes(JavaThread::frame_anchor_offset()) +
+                                              in_bytes(JavaFrameAnchor::last_Java_pc_offset()));
 
   // Drop in the last_Java_sp.  last_Java_fp is not touched.
   // Always do this after the other "last_Java_frame" fields are set since
   // as soon as last_Java_sp != nullptr the has_last_Java_frame is true and
   // users will look at the other fields.
   //
-  Node *adr_sp = basic_plus_adr(top(), thread, in_bytes(JavaThread::last_Java_sp_offset()));
-  Node *last_sp = frameptr();
+  Node* adr_sp = off_heap_plus_addr(thread, in_bytes(JavaThread::last_Java_sp_offset()));
+  Node* last_sp = frameptr();
   store_to_memory(control(), adr_sp, last_sp, T_ADDRESS, MemNode::unordered);
 
   // Set _thread_in_native
@@ -228,7 +227,7 @@ void GraphKit::gen_stub(address C_function,
   Node* target = map()->in(TypeFunc::Parms);
   // Runtime call returning oop in TLS?  Fetch it out
   if( pass_tls ) {
-    Node* adr = basic_plus_adr(top(), thread, in_bytes(JavaThread::vm_result_oop_offset()));
+    Node* adr = off_heap_plus_addr(thread, in_bytes(JavaThread::vm_result_oop_offset()));
     Node* vm_result = make_load(nullptr, adr, TypeOopPtr::BOTTOM, T_OBJECT, MemNode::unordered);
     map()->set_req(TypeFunc::Parms, vm_result); // vm_result passed as result
     // clear thread-local-storage(tls)
@@ -237,7 +236,7 @@ void GraphKit::gen_stub(address C_function,
 
   //-----------------------------
   // check exception
-  Node* adr = basic_plus_adr(top(), thread, in_bytes(Thread::pending_exception_offset()));
+  Node* adr = off_heap_plus_addr(thread, in_bytes(Thread::pending_exception_offset()));
   Node* pending = make_load(nullptr, adr, TypeOopPtr::BOTTOM, T_OBJECT, MemNode::unordered);
 
   Node* exit_memory = reset_memory();
diff --git a/src/hotspot/share/opto/graphKit.cpp b/src/hotspot/share/opto/graphKit.cpp
index 31da6fd0e2d..e297292770e 100644
--- a/src/hotspot/share/opto/graphKit.cpp
+++ b/src/hotspot/share/opto/graphKit.cpp
@@ -508,7 +508,7 @@ void GraphKit::uncommon_trap_if_should_post_on_exceptions(Deoptimization::DeoptR
 
     // first must access the should_post_on_exceptions_flag in this thread's JavaThread
     Node* jthread = _gvn.transform(new ThreadLocalNode());
-    Node* adr = basic_plus_adr(top(), jthread, in_bytes(JavaThread::should_post_on_exceptions_flag_offset()));
+    Node* adr = off_heap_plus_addr(jthread, in_bytes(JavaThread::should_post_on_exceptions_flag_offset()));
     Node* should_post_flag = make_load(control(), adr, TypeInt::INT, T_INT, MemNode::unordered);
 
     // Test the should_post_on_exceptions_flag vs. 0
@@ -1234,7 +1234,7 @@ Node* GraphKit::basic_plus_adr(Node* base, Node* ptr, Node* offset) {
            "Unexpected zero offset - should have matched MakeConX(0)");
   }
 #endif
-  return _gvn.transform( new AddPNode(base, ptr, offset) );
+  return _gvn.transform(AddPNode::make_with_base(base, ptr, offset));
 }
 
 Node* GraphKit::ConvI2L(Node* offset) {
@@ -2817,9 +2817,9 @@ Node* Phase::gen_subtype_check(Node* subklass, Node* superklass, Node** ctrl, No
   // will always succeed.  We could leave a dependency behind to ensure this.
 
   // First load the super-klass's check-offset
-  Node *p1 = gvn.transform(new AddPNode(C->top(), superklass, gvn.MakeConX(in_bytes(Klass::super_check_offset_offset()))));
+  Node* p1 = gvn.transform(AddPNode::make_off_heap(superklass, gvn.MakeConX(in_bytes(Klass::super_check_offset_offset()))));
   Node* m = C->immutable_memory();
-  Node *chk_off = gvn.transform(new LoadINode(nullptr, m, p1, gvn.type(p1)->is_ptr(), TypeInt::INT, MemNode::unordered));
+  Node* chk_off = gvn.transform(new LoadINode(nullptr, m, p1, gvn.type(p1)->is_ptr(), TypeInt::INT, MemNode::unordered));
   int cacheoff_con = in_bytes(Klass::secondary_super_cache_offset());
   const TypeInt* chk_off_t = chk_off->Value(&gvn)->isa_int();
   int chk_off_con = (chk_off_t != nullptr && chk_off_t->is_con()) ? chk_off_t->get_con() : cacheoff_con;
@@ -2835,11 +2835,11 @@ Node* Phase::gen_subtype_check(Node* subklass, Node* superklass, Node** ctrl, No
 #ifdef _LP64
   chk_off_X = gvn.transform(new ConvI2LNode(chk_off_X));
 #endif
-  Node* p2 = gvn.transform(new AddPNode(C->top(), subklass, chk_off_X));
+  Node* p2 = gvn.transform(AddPNode::make_off_heap(subklass, chk_off_X));
   // For some types like interfaces the following loadKlass is from a 1-word
   // cache which is mutable so can't use immutable memory.  Other
   // types load from the super-class display table which is immutable.
-  Node *kmem = C->immutable_memory();
+  Node* kmem = C->immutable_memory();
   // secondary_super_cache is not immutable but can be treated as such because:
   // - no ideal node writes to it in a way that could cause an
   //   incorrect/missed optimization of the following Load.
@@ -3076,7 +3076,7 @@ bool GraphKit::seems_never_null(Node* obj, ciProfileData* data, bool& speculatin
 
 void GraphKit::guard_klass_being_initialized(Node* klass) {
   int init_state_off = in_bytes(InstanceKlass::init_state_offset());
-  Node* adr = basic_plus_adr(top(), klass, init_state_off);
+  Node* adr = off_heap_plus_addr(klass, init_state_off);
   Node* init_state = LoadNode::make(_gvn, nullptr, immutable_memory(), adr,
                                     adr->bottom_type()->is_ptr(), TypeInt::BYTE,
                                     T_BYTE, MemNode::acquire);
@@ -3094,7 +3094,7 @@ void GraphKit::guard_klass_being_initialized(Node* klass) {
 
 void GraphKit::guard_init_thread(Node* klass) {
   int init_thread_off = in_bytes(InstanceKlass::init_thread_offset());
-  Node* adr = basic_plus_adr(top(), klass, init_thread_off);
+  Node* adr = off_heap_plus_addr(klass, init_thread_off);
 
   Node* init_thread = LoadNode::make(_gvn, nullptr, immutable_memory(), adr,
                                      adr->bottom_type()->is_ptr(), TypePtr::NOTNULL,
@@ -3672,7 +3672,7 @@ Node* GraphKit::get_layout_helper(Node* klass_node, jint& constant_value) {
     }
   }
   constant_value = Klass::_lh_neutral_value;  // put in a known value
-  Node* lhp = basic_plus_adr(top(), klass_node, in_bytes(Klass::layout_helper_offset()));
+  Node* lhp = off_heap_plus_addr(klass_node, in_bytes(Klass::layout_helper_offset()));
   return make_load(nullptr, lhp, TypeInt::INT, T_INT, MemNode::unordered);
 }
 
diff --git a/src/hotspot/share/opto/graphKit.hpp b/src/hotspot/share/opto/graphKit.hpp
index dc691173f71..273009ca7ce 100644
--- a/src/hotspot/share/opto/graphKit.hpp
+++ b/src/hotspot/share/opto/graphKit.hpp
@@ -320,6 +320,13 @@ class GraphKit : public Phase {
   }
   Node* basic_plus_adr(Node* base, Node* ptr, Node* offset);
 
+  Node* off_heap_plus_addr(Node* ptr, intptr_t offset) {
+    return basic_plus_adr(top(), ptr, MakeConX(offset));
+  }
+
+  Node* off_heap_plus_addr(Node* ptr, Node* offset) {
+    return basic_plus_adr(top(), ptr, offset);
+  }
 
   // Some convenient shortcuts for common nodes
   Node* IfTrue(IfNode* iff)                   { return _gvn.transform(new IfTrueNode(iff));      }
@@ -346,7 +353,7 @@ class GraphKit : public Phase {
   Node* CmpP(Node* l, Node* r)                { return _gvn.transform(new CmpPNode(l, r));       }
   Node* Bool(Node* cmp, BoolTest::mask relop) { return _gvn.transform(new BoolNode(cmp, relop)); }
 
-  Node* AddP(Node* b, Node* a, Node* o)       { return _gvn.transform(new AddPNode(b, a, o));    }
+  Node* AddP(Node* b, Node* a, Node* o)       { return _gvn.transform(AddPNode::make_with_base(b, a, o)); }
 
   // Convert between int and long, and size_t.
   // (See macros ConvI2X, etc., in type.hpp for ConvI2X, etc.)
diff --git a/src/hotspot/share/opto/idealKit.hpp b/src/hotspot/share/opto/idealKit.hpp
index 518c3b92136..a2ac9e204ba 100644
--- a/src/hotspot/share/opto/idealKit.hpp
+++ b/src/hotspot/share/opto/idealKit.hpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2005, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2005, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -200,7 +200,7 @@ class IdealKit: public StackObj {
 
   // Raw address should be transformed regardless 'delay_transform' flag
   // to produce canonical form CastX2P(offset).
-  Node* AddP(Node *base, Node *ptr, Node *off) { return _gvn.transform(new AddPNode(base, ptr, off)); }
+  Node* AddP(Node* base, Node* ptr, Node* off) { return _gvn.transform(AddPNode::make_with_base(base, ptr, off)); }
 
   Node* CmpP(Node* l, Node* r) { return transform(new CmpPNode(l, r)); }
 #ifdef _LP64
diff --git a/src/hotspot/share/opto/library_call.cpp b/src/hotspot/share/opto/library_call.cpp
index 743612a1051..eed99ceb8bc 100644
--- a/src/hotspot/share/opto/library_call.cpp
+++ b/src/hotspot/share/opto/library_call.cpp
@@ -989,7 +989,7 @@ Node* LibraryCallKit::current_thread_helper(Node*& tls_output, ByteSize handle_o
     = TypeOopPtr::make_from_klass(thread_klass)->cast_to_ptr_type(TypePtr::NotNull);
 
   Node* thread = _gvn.transform(new ThreadLocalNode());
-  Node* p = basic_plus_adr(top()/*!oop*/, thread, in_bytes(handle_offset));
+  Node* p = off_heap_plus_addr(thread, in_bytes(handle_offset));
   tls_output = thread;
 
   Node* thread_obj_handle
@@ -2161,7 +2161,7 @@ Node* LibraryCallKit::make_unsafe_address(Node*& base, Node* offset, BasicType t
   Node* uncasted_base = base;
   int kind = classify_unsafe_addr(uncasted_base, offset, type);
   if (kind == Type::RawPtr) {
-    return basic_plus_adr(top(), uncasted_base, offset);
+    return off_heap_plus_addr(uncasted_base, offset);
   } else if (kind == Type::AnyPtr) {
     assert(base == uncasted_base, "unexpected base change");
     if (can_cast) {
@@ -2181,13 +2181,13 @@ Node* LibraryCallKit::make_unsafe_address(Node*& base, Node* offset, BasicType t
         base = null_assert(base);
         Node* raw_base = _gvn.transform(new CastX2PNode(offset));
         offset = MakeConX(0);
-        return basic_plus_adr(top(), raw_base, offset);
+        return off_heap_plus_addr(raw_base, offset);
       }
     }
     // We don't know if it's an on heap or off heap access. Fall back
     // to raw memory access.
     Node* raw = _gvn.transform(new CheckCastPPNode(control(), base, TypeRawPtr::BOTTOM));
-    return basic_plus_adr(top(), raw, offset);
+    return off_heap_plus_addr(raw, offset);
   } else {
     assert(base == uncasted_base, "unexpected base change");
     // We know it's an on heap access so base can't be null
@@ -2962,7 +2962,7 @@ bool LibraryCallKit::inline_unsafe_allocate() {
     // Note:  The argument might still be an illegal value like
     // Serializable.class or Object[].class.   The runtime will handle it.
     // But we must make an explicit check for initialization.
-    Node* insp = basic_plus_adr(top(), kls, in_bytes(InstanceKlass::init_state_offset()));
+    Node* insp = off_heap_plus_addr(kls, in_bytes(InstanceKlass::init_state_offset()));
     // Use T_BOOLEAN for InstanceKlass::_init_state so the compiler
     // can generate code to load it as unsigned byte.
     Node* inst = make_load(nullptr, insp, TypeInt::UBYTE, T_BOOLEAN, MemNode::acquire);
@@ -3010,7 +3010,7 @@ bool LibraryCallKit::inline_native_vthread_start_transition(address funcAddr, co
   IdealKit ideal(this);
 
   Node* thread = ideal.thread();
-  Node* jt_addr = basic_plus_adr(top(), thread, in_bytes(JavaThread::is_in_vthread_transition_offset()));
+  Node* jt_addr = off_heap_plus_addr(thread, in_bytes(JavaThread::is_in_vthread_transition_offset()));
   Node* vt_addr = basic_plus_adr(vt_oop, java_lang_Thread::is_in_vthread_transition_offset());
   access_store_at(nullptr, jt_addr, _gvn.type(jt_addr)->is_ptr(), ideal.ConI(1), TypeInt::BOOL, T_BOOLEAN, IN_NATIVE | MO_UNORDERED);
   access_store_at(nullptr, vt_addr, _gvn.type(vt_addr)->is_ptr(), ideal.ConI(1), TypeInt::BOOL, T_BOOLEAN, IN_NATIVE | MO_UNORDERED);
@@ -3052,7 +3052,7 @@ bool LibraryCallKit::inline_native_vthread_end_transition(address funcAddr, cons
     ideal.sync_kit(this);
   } ideal.else_(); {
     Node* thread = ideal.thread();
-    Node* jt_addr = basic_plus_adr(top(), thread, in_bytes(JavaThread::is_in_vthread_transition_offset()));
+    Node* jt_addr = off_heap_plus_addr(thread, in_bytes(JavaThread::is_in_vthread_transition_offset()));
     Node* vt_addr = basic_plus_adr(vt_oop, java_lang_Thread::is_in_vthread_transition_offset());
 
     sync_kit(ideal);
@@ -3078,7 +3078,7 @@ bool LibraryCallKit::inline_native_notify_jvmti_sync() {
     // unconditionally update the is_disable_suspend bit in current JavaThread
     Node* thread = ideal.thread();
     Node* arg = argument(0); // argument for notification
-    Node* addr = basic_plus_adr(top(), thread, in_bytes(JavaThread::is_disable_suspend_offset()));
+    Node* addr = off_heap_plus_addr(thread, in_bytes(JavaThread::is_disable_suspend_offset()));
     const TypePtr *addr_type = _gvn.type(addr)->isa_ptr();
 
     sync_kit(ideal);
@@ -3185,12 +3185,12 @@ bool LibraryCallKit::inline_native_jvm_commit() {
   // TLS.
   Node* tls_ptr = _gvn.transform(new ThreadLocalNode());
   // Jfr java buffer.
-  Node* java_buffer_offset = _gvn.transform(new AddPNode(top(), tls_ptr, MakeConX(in_bytes(JAVA_BUFFER_OFFSET_JFR))));
+  Node* java_buffer_offset = _gvn.transform(AddPNode::make_off_heap(tls_ptr, MakeConX(in_bytes(JAVA_BUFFER_OFFSET_JFR))));
   Node* java_buffer = _gvn.transform(new LoadPNode(control(), input_memory_state, java_buffer_offset, TypePtr::BOTTOM, TypeRawPtr::NOTNULL, MemNode::unordered));
-  Node* java_buffer_pos_offset = _gvn.transform(new AddPNode(top(), java_buffer, MakeConX(in_bytes(JFR_BUFFER_POS_OFFSET))));
+  Node* java_buffer_pos_offset = _gvn.transform(AddPNode::make_off_heap(java_buffer, MakeConX(in_bytes(JFR_BUFFER_POS_OFFSET))));
 
   // Load the current value of the notified field in the JfrThreadLocal.
-  Node* notified_offset = basic_plus_adr(top(), tls_ptr, in_bytes(NOTIFY_OFFSET_JFR));
+  Node* notified_offset = off_heap_plus_addr(tls_ptr, in_bytes(NOTIFY_OFFSET_JFR));
   Node* notified = make_load(control(), notified_offset, TypeInt::BOOL, T_BOOLEAN, MemNode::unordered);
 
   // Test for notification.
@@ -3228,7 +3228,7 @@ bool LibraryCallKit::inline_native_jvm_commit() {
   set_all_memory(commit_memory);
 
   // Now load the flags from off the java buffer and decide if the buffer is a lease. If so, it needs to be returned post-commit.
-  Node* java_buffer_flags_offset = _gvn.transform(new AddPNode(top(), java_buffer, MakeConX(in_bytes(JFR_BUFFER_FLAGS_OFFSET))));
+  Node* java_buffer_flags_offset = _gvn.transform(AddPNode::make_off_heap(java_buffer, MakeConX(in_bytes(JFR_BUFFER_FLAGS_OFFSET))));
   Node* flags = make_load(control(), java_buffer_flags_offset, TypeInt::UBYTE, T_BYTE, MemNode::unordered);
   Node* lease_constant = _gvn.intcon(4);
 
@@ -3360,7 +3360,7 @@ bool LibraryCallKit::inline_native_getEventWriter() {
   Node* tls_ptr = _gvn.transform(new ThreadLocalNode());
 
   // Load the address of java event writer jobject handle from the jfr_thread_local structure.
-  Node* jobj_ptr = basic_plus_adr(top(), tls_ptr, in_bytes(THREAD_LOCAL_WRITER_OFFSET_JFR));
+  Node* jobj_ptr = off_heap_plus_addr(tls_ptr, in_bytes(THREAD_LOCAL_WRITER_OFFSET_JFR));
 
   // Load the eventwriter jobject handle.
   Node* jobj = make_load(control(), jobj_ptr, TypeRawPtr::BOTTOM, T_ADDRESS, MemNode::unordered);
@@ -3537,7 +3537,7 @@ bool LibraryCallKit::inline_native_getEventWriter() {
   ciInstanceKlass* const instklass_EventWriter = klass_EventWriter->as_instance_klass();
   const TypeKlassPtr* const aklass = TypeKlassPtr::make(instklass_EventWriter);
   const TypeOopPtr* const xtype = aklass->as_instance_type();
-  Node* jobj_untagged = _gvn.transform(new AddPNode(top(), jobj, _gvn.MakeConX(-JNIHandles::TypeTag::global)));
+  Node* jobj_untagged = _gvn.transform(AddPNode::make_off_heap(jobj, _gvn.MakeConX(-JNIHandles::TypeTag::global)));
   Node* event_writer = access_load(jobj_untagged, xtype, T_OBJECT, IN_NATIVE | C2_CONTROL_DEPENDENT_LOAD);
 
   // Load the current thread id from the event writer object.
@@ -3652,7 +3652,7 @@ void LibraryCallKit::extend_setCurrentThread(Node* jt, Node* thread) {
   IfNode* iff_thread_not_equal_carrierThread =
     create_and_map_if(control(), test_thread_not_equal_carrierThread, PROB_FAIR, COUNT_UNKNOWN);
 
-  Node* vthread_offset = basic_plus_adr(top(), jt, in_bytes(THREAD_LOCAL_OFFSET_JFR + VTHREAD_OFFSET_JFR));
+  Node* vthread_offset = off_heap_plus_addr(jt, in_bytes(THREAD_LOCAL_OFFSET_JFR + VTHREAD_OFFSET_JFR));
 
   // False branch, is carrierThread.
   Node* thread_equal_carrierThread = _gvn.transform(new IfFalseNode(iff_thread_not_equal_carrierThread));
@@ -3677,7 +3677,7 @@ void LibraryCallKit::extend_setCurrentThread(Node* jt, Node* thread) {
   Node* tid = load_field_from_object(thread, "tid", "J");
 
   // Store the vthread tid to the jfr thread local.
-  Node* thread_id_offset = basic_plus_adr(top(), jt, in_bytes(THREAD_LOCAL_OFFSET_JFR + VTHREAD_ID_OFFSET_JFR));
+  Node* thread_id_offset = off_heap_plus_addr(jt, in_bytes(THREAD_LOCAL_OFFSET_JFR + VTHREAD_ID_OFFSET_JFR));
   Node* tid_memory = store_to_memory(control(), thread_id_offset, tid, T_LONG, MemNode::unordered, true);
 
   // Branch is_excluded to conditionalize updating the epoch .
@@ -3699,7 +3699,7 @@ void LibraryCallKit::extend_setCurrentThread(Node* jt, Node* thread) {
   Node* epoch = _gvn.transform(new AndINode(epoch_raw, epoch_mask));
 
   // Store the vthread epoch to the jfr thread local.
-  Node* vthread_epoch_offset = basic_plus_adr(top(), jt, in_bytes(THREAD_LOCAL_OFFSET_JFR + VTHREAD_EPOCH_OFFSET_JFR));
+  Node* vthread_epoch_offset = off_heap_plus_addr(jt, in_bytes(THREAD_LOCAL_OFFSET_JFR + VTHREAD_EPOCH_OFFSET_JFR));
   Node* included_memory = store_to_memory(control(), vthread_epoch_offset, epoch, T_CHAR, MemNode::unordered, true);
 
   RegionNode* excluded_rgn = new RegionNode(PATH_LIMIT);
@@ -3722,7 +3722,7 @@ void LibraryCallKit::extend_setCurrentThread(Node* jt, Node* thread) {
   set_all_memory(excluded_mem);
 
   // Store the vthread exclusion state to the jfr thread local.
-  Node* thread_local_excluded_offset = basic_plus_adr(top(), jt, in_bytes(THREAD_LOCAL_OFFSET_JFR + VTHREAD_EXCLUDED_OFFSET_JFR));
+  Node* thread_local_excluded_offset = off_heap_plus_addr(jt, in_bytes(THREAD_LOCAL_OFFSET_JFR + VTHREAD_EXCLUDED_OFFSET_JFR));
   store_to_memory(control(), thread_local_excluded_offset, _gvn.transform(exclusion), T_BOOLEAN, MemNode::unordered, true);
 
   // Store release
@@ -3768,7 +3768,7 @@ bool LibraryCallKit::inline_native_setCurrentThread() {
          "method changes current Thread but is not annotated ChangesCurrentThread");
   Node* arr = argument(1);
   Node* thread = _gvn.transform(new ThreadLocalNode());
-  Node* p = basic_plus_adr(top()/*!oop*/, thread, in_bytes(JavaThread::vthread_offset()));
+  Node* p = off_heap_plus_addr(thread, in_bytes(JavaThread::vthread_offset()));
   Node* thread_obj_handle
     = make_load(nullptr, p, p->bottom_type()->is_ptr(), T_OBJECT, MemNode::unordered);
   const TypePtr *adr_type = _gvn.type(thread_obj_handle)->isa_ptr();
@@ -3776,7 +3776,7 @@ bool LibraryCallKit::inline_native_setCurrentThread() {
 
   // Change the _monitor_owner_id of the JavaThread
   Node* tid = load_field_from_object(arr, "tid", "J");
-  Node* monitor_owner_id_offset = basic_plus_adr(top(), thread, in_bytes(JavaThread::monitor_owner_id_offset()));
+  Node* monitor_owner_id_offset = off_heap_plus_addr(thread, in_bytes(JavaThread::monitor_owner_id_offset()));
   store_to_memory(control(), monitor_owner_id_offset, tid, T_LONG, MemNode::unordered, true);
 
   JFR_ONLY(extend_setCurrentThread(thread, arr);)
@@ -3797,7 +3797,7 @@ const Type* LibraryCallKit::scopedValueCache_type() {
 
 Node* LibraryCallKit::scopedValueCache_helper() {
   Node* thread = _gvn.transform(new ThreadLocalNode());
-  Node* p = basic_plus_adr(top()/*!oop*/, thread, in_bytes(JavaThread::scopedValueCache_offset()));
+  Node* p = off_heap_plus_addr(thread, in_bytes(JavaThread::scopedValueCache_offset()));
   // We cannot use immutable_memory() because we might flip onto a
   // different carrier thread, at which point we'll need to use that
   // carrier thread's cache.
@@ -3839,7 +3839,7 @@ bool LibraryCallKit::inline_native_Continuation_pinning(bool unpin) {
 
   // TLS
   Node* tls_ptr = _gvn.transform(new ThreadLocalNode());
-  Node* last_continuation_offset = basic_plus_adr(top(), tls_ptr, in_bytes(JavaThread::cont_entry_offset()));
+  Node* last_continuation_offset = off_heap_plus_addr(tls_ptr, in_bytes(JavaThread::cont_entry_offset()));
   Node* last_continuation = make_load(control(), last_continuation_offset, last_continuation_offset->get_ptr_type(), T_ADDRESS, MemNode::unordered);
 
   // Null check the last continuation object.
@@ -3856,7 +3856,7 @@ bool LibraryCallKit::inline_native_Continuation_pinning(bool unpin) {
   set_control(continuation_is_not_null);
 
   // Load the pin count from the last continuation.
-  Node* pin_count_offset = basic_plus_adr(top(), last_continuation, in_bytes(ContinuationEntry::pin_count_offset()));
+  Node* pin_count_offset = off_heap_plus_addr(last_continuation, in_bytes(ContinuationEntry::pin_count_offset()));
   Node* pin_count = make_load(control(), pin_count_offset, TypeInt::INT, T_INT, MemNode::unordered);
 
   // The loaded pin count is compared against a context specific rhs for over/underflow detection.
@@ -3918,7 +3918,7 @@ bool LibraryCallKit::inline_native_Continuation_pinning(bool unpin) {
 //---------------------------load_mirror_from_klass----------------------------
 // Given a klass oop, load its java mirror (a java.lang.Class oop).
 Node* LibraryCallKit::load_mirror_from_klass(Node* klass) {
-  Node* p = basic_plus_adr(top(), klass, in_bytes(Klass::java_mirror_offset()));
+  Node* p = off_heap_plus_addr(klass, in_bytes(Klass::java_mirror_offset()));
   Node* load = make_load(nullptr, p, TypeRawPtr::NOTNULL, T_ADDRESS, MemNode::unordered);
   // mirror = ((OopHandle)mirror)->resolve();
   return access_load(load, TypeInstPtr::MIRROR, T_OBJECT, IN_NATIVE);
@@ -3958,7 +3958,7 @@ Node* LibraryCallKit::generate_klass_flags_guard(Node* kls, int modifier_mask, i
                                                  ByteSize offset, const Type* type, BasicType bt) {
   // Branch around if the given klass has the given modifier bit set.
   // Like generate_guard, adds a new path onto the region.
-  Node* modp = basic_plus_adr(top(), kls, in_bytes(offset));
+  Node* modp = off_heap_plus_addr(kls, in_bytes(offset));
   Node* mods = make_load(nullptr, modp, type, bt, MemNode::unordered);
   Node* mask = intcon(modifier_mask);
   Node* bits = intcon(modifier_bits);
@@ -4092,7 +4092,7 @@ bool LibraryCallKit::inline_native_Class_query(vmIntrinsics::ID id) {
       phi->add_req(null());
     }
     // If we fall through, it's a plain class.  Get its _super.
-    p = basic_plus_adr(top(), kls, in_bytes(Klass::super_offset()));
+    p = off_heap_plus_addr(kls, in_bytes(Klass::super_offset()));
     kls = _gvn.transform(LoadKlassNode::make(_gvn, immutable_memory(), p, TypeRawPtr::BOTTOM, TypeInstKlassPtr::OBJECT_OR_NULL));
     null_ctl = top();
     kls = null_check_oop(kls, &null_ctl);
@@ -4627,10 +4627,10 @@ Node* LibraryCallKit::generate_virtual_guard(Node* obj_klass,
   assert(vtable_index >= 0 || vtable_index == Method::nonvirtual_vtable_index,
          "bad index %d", vtable_index);
   // Get the Method* out of the appropriate vtable entry.
-  int entry_offset  = in_bytes(Klass::vtable_start_offset()) +
+  int entry_offset = in_bytes(Klass::vtable_start_offset()) +
                      vtable_index*vtableEntry::size_in_bytes() +
                      in_bytes(vtableEntry::method_offset());
-  Node* entry_addr  = basic_plus_adr(top(), obj_klass, entry_offset);
+  Node* entry_addr = off_heap_plus_addr(obj_klass, entry_offset);
   Node* target_call = make_load(nullptr, entry_addr, TypePtr::NOTNULL, T_ADDRESS, MemNode::unordered);
 
   // Compare the target method with the expected method (e.g., Object.hashCode).
@@ -5105,7 +5105,7 @@ bool LibraryCallKit::inline_unsafe_copyMemory() {
   Node* dst_addr = make_unsafe_address(dst_base, dst_off);
 
   Node* thread = _gvn.transform(new ThreadLocalNode());
-  Node* doing_unsafe_access_addr = basic_plus_adr(top(), thread, in_bytes(JavaThread::doing_unsafe_access_offset()));
+  Node* doing_unsafe_access_addr = off_heap_plus_addr(thread, in_bytes(JavaThread::doing_unsafe_access_offset()));
   BasicType doing_unsafe_access_bt = T_BYTE;
   assert((sizeof(bool) * CHAR_BIT) == 8, "not implemented");
 
@@ -5160,7 +5160,7 @@ bool LibraryCallKit::inline_unsafe_setMemory() {
   Node* dst_addr = make_unsafe_address(dst_base, dst_off);
 
   Node* thread = _gvn.transform(new ThreadLocalNode());
-  Node* doing_unsafe_access_addr = basic_plus_adr(top(), thread, in_bytes(JavaThread::doing_unsafe_access_offset()));
+  Node* doing_unsafe_access_addr = off_heap_plus_addr(thread, in_bytes(JavaThread::doing_unsafe_access_offset()));
   BasicType doing_unsafe_access_bt = T_BYTE;
   assert((sizeof(bool) * CHAR_BIT) == 8, "not implemented");
 
@@ -6696,7 +6696,7 @@ bool LibraryCallKit::inline_updateCRC32() {
 
   Node* base = makecon(TypeRawPtr::make(StubRoutines::crc_table_addr()));
   Node* offset = _gvn.transform(new LShiftINode(result, intcon(0x2)));
-  Node* adr = basic_plus_adr(top(), base, ConvI2X(offset));
+  Node* adr = off_heap_plus_addr(base, ConvI2X(offset));
   result = make_load(control(), adr, TypeInt::INT, T_INT, MemNode::unordered);
 
   crc = _gvn.transform(new URShiftINode(crc, intcon(8)));
@@ -6768,7 +6768,7 @@ bool LibraryCallKit::inline_updateByteBufferCRC32() {
   offset = ConvI2X(offset);
 
   // 'src_start' points to src array + scaled offset
-  Node* src_start = basic_plus_adr(top(), base, offset);
+  Node* src_start = off_heap_plus_addr(base, offset);
 
   // Call the stub.
   address stubAddr = StubRoutines::updateBytesCRC32();
@@ -6865,7 +6865,7 @@ bool LibraryCallKit::inline_updateDirectByteBufferCRC32C() {
   offset = ConvI2X(offset);
 
   // 'src_start' points to src array + scaled offset
-  Node* src_start = basic_plus_adr(top(), base, offset);
+  Node* src_start = off_heap_plus_addr(base, offset);
 
   // static final int[] byteTable in class CRC32C
   Node* table = get_table_from_crc32c_class(callee()->holder());
@@ -6949,7 +6949,7 @@ bool LibraryCallKit::inline_updateByteBufferAdler32() {
   offset = ConvI2X(offset);
 
   // 'src_start' points to src array + scaled offset
-  Node* src_start = basic_plus_adr(top(), base, offset);
+  Node* src_start = off_heap_plus_addr(base, offset);
 
   // Call the stub.
   address stubAddr = StubRoutines::updateBytesAdler32();
diff --git a/src/hotspot/share/opto/loopTransform.cpp b/src/hotspot/share/opto/loopTransform.cpp
index 1801841bad3..80b17efb998 100644
--- a/src/hotspot/share/opto/loopTransform.cpp
+++ b/src/hotspot/share/opto/loopTransform.cpp
@@ -3991,7 +3991,7 @@ bool PhaseIdealLoop::intrinsify_fill(IdealLoopTree* lpt) {
     index = new LShiftXNode(index, shift->in(2));
     _igvn.register_new_node_with_optimizer(index);
   }
-  Node* from = new AddPNode(base, base, index);
+  Node* from = AddPNode::make_with_base(base, index);
   _igvn.register_new_node_with_optimizer(from);
   // For normal array fills, C2 uses two AddP nodes for array element
   // addressing. But for array fills with Unsafe call, there's only one
@@ -3999,7 +3999,7 @@ bool PhaseIdealLoop::intrinsify_fill(IdealLoopTree* lpt) {
   assert(offset != nullptr || C->has_unsafe_access(),
          "Only array fills with unsafe have no extra offset");
   if (offset != nullptr) {
-    from = new AddPNode(base, from, offset);
+    from = AddPNode::make_with_base(base, from, offset);
     _igvn.register_new_node_with_optimizer(from);
   }
   // Compute the number of elements to copy
diff --git a/src/hotspot/share/opto/loopopts.cpp b/src/hotspot/share/opto/loopopts.cpp
index 2a0178530e8..4e447edee8d 100644
--- a/src/hotspot/share/opto/loopopts.cpp
+++ b/src/hotspot/share/opto/loopopts.cpp
@@ -620,10 +620,10 @@ Node* PhaseIdealLoop::remix_address_expressions(Node* n) {
         IdealLoopTree* n23_loop = get_loop(n23_ctrl);
         if (n22loop != n_loop && n22loop->is_member(n_loop) &&
             n23_loop == n_loop) {
-          Node* add1 = new AddPNode(n->in(1), n->in(2)->in(2), n->in(3));
+          Node* add1 = AddPNode::make_with_base(n->in(1), n->in(2)->in(2), n->in(3));
           // Stuff new AddP in the loop preheader
           register_new_node(add1, n_loop->_head->as_Loop()->skip_strip_mined(1)->in(LoopNode::EntryControl));
-          Node* add2 = new AddPNode(n->in(1), add1, n->in(2)->in(3));
+          Node* add2 = AddPNode::make_with_base(n->in(1), add1, n->in(2)->in(3));
           register_new_node(add2, n_ctrl);
           _igvn.replace_node(n, add2);
           return add2;
@@ -641,10 +641,10 @@ Node* PhaseIdealLoop::remix_address_expressions(Node* n) {
           Node *tmp = V; V = I; I = tmp;
         }
         if (!ctrl_is_member(n_loop, I)) {
-          Node* add1 = new AddPNode(n->in(1), n->in(2), I);
+          Node* add1 = AddPNode::make_with_base(n->in(1), n->in(2), I);
           // Stuff new AddP in the loop preheader
           register_new_node(add1, n_loop->_head->as_Loop()->skip_strip_mined(1)->in(LoopNode::EntryControl));
-          Node* add2 = new AddPNode(n->in(1), add1, V);
+          Node* add2 = AddPNode::make_with_base(n->in(1), add1, V);
           register_new_node(add2, n_ctrl);
           _igvn.replace_node(n, add2);
           return add2;
diff --git a/src/hotspot/share/opto/macro.cpp b/src/hotspot/share/opto/macro.cpp
index 6995cacd1b0..48277eb46d2 100644
--- a/src/hotspot/share/opto/macro.cpp
+++ b/src/hotspot/share/opto/macro.cpp
@@ -274,7 +274,7 @@ Node* PhaseMacroExpand::make_arraycopy_load(ArrayCopyNode* ac, intptr_t offset,
   if (ac->is_clonebasic()) {
     assert(ac->in(ArrayCopyNode::Src) != ac->in(ArrayCopyNode::Dest), "clone source equals destination");
     Node* base = ac->in(ArrayCopyNode::Src);
-    Node* adr = _igvn.transform(new AddPNode(base, base, _igvn.MakeConX(offset)));
+    Node* adr = _igvn.transform(AddPNode::make_with_base(base, _igvn.MakeConX(offset)));
     const TypePtr* adr_type = _igvn.type(base)->is_ptr()->add_offset(offset);
     MergeMemNode* mergemen = _igvn.transform(MergeMemNode::make(mem))->as_MergeMem();
     BarrierSetC2* bs = BarrierSet::barrier_set()->barrier_set_c2();
@@ -293,7 +293,7 @@ Node* PhaseMacroExpand::make_arraycopy_load(ArrayCopyNode* ac, intptr_t offset,
       if (src_pos_t->is_con() && dest_pos_t->is_con()) {
         intptr_t off = ((src_pos_t->get_con() - dest_pos_t->get_con()) << shift) + offset;
         Node* base = ac->in(ArrayCopyNode::Src);
-        adr = _igvn.transform(new AddPNode(base, base, _igvn.MakeConX(off)));
+        adr = _igvn.transform(AddPNode::make_with_base(base, _igvn.MakeConX(off)));
         adr_type = _igvn.type(base)->is_ptr()->add_offset(off);
         if (ac->in(ArrayCopyNode::Src) == ac->in(ArrayCopyNode::Dest)) {
           // Don't emit a new load from src if src == dst but try to get the value from memory instead
@@ -308,7 +308,7 @@ Node* PhaseMacroExpand::make_arraycopy_load(ArrayCopyNode* ac, intptr_t offset,
 
         Node* off = _igvn.transform(new AddXNode(_igvn.MakeConX(offset), diff));
         Node* base = ac->in(ArrayCopyNode::Src);
-        adr = _igvn.transform(new AddPNode(base, base, off));
+        adr = _igvn.transform(AddPNode::make_with_base(base, off));
         adr_type = _igvn.type(base)->is_ptr()->add_offset(Type::OffsetBot);
         if (ac->in(ArrayCopyNode::Src) == ac->in(ArrayCopyNode::Dest)) {
           // Non constant offset in the array: we can't statically
@@ -1199,7 +1199,7 @@ bool PhaseMacroExpand::eliminate_boxing_node(CallStaticJavaNode *boxing) {
 
 
 Node* PhaseMacroExpand::make_load_raw(Node* ctl, Node* mem, Node* base, int offset, const Type* value_type, BasicType bt) {
-  Node* adr = basic_plus_adr(top(), base, offset);
+  Node* adr = off_heap_plus_addr(base, offset);
   const TypePtr* adr_type = adr->bottom_type()->is_ptr();
   Node* value = LoadNode::make(_igvn, ctl, mem, adr, adr_type, value_type, bt, MemNode::unordered);
   transform_later(value);
@@ -1208,7 +1208,7 @@ Node* PhaseMacroExpand::make_load_raw(Node* ctl, Node* mem, Node* base, int offs
 
 
 Node* PhaseMacroExpand::make_store_raw(Node* ctl, Node* mem, Node* base, int offset, Node* value, BasicType bt) {
-  Node* adr = basic_plus_adr(top(), base, offset);
+  Node* adr = off_heap_plus_addr(base, offset);
   mem = StoreNode::make(_igvn, ctl, mem, adr, nullptr, value, bt, MemNode::unordered);
   transform_later(mem);
   return mem;
@@ -1834,7 +1834,7 @@ Node* PhaseMacroExpand::prefetch_allocation(Node* i_o, Node*& needgc_false,
       Node* thread = new ThreadLocalNode();
       transform_later(thread);
 
-      Node* eden_pf_adr = new AddPNode(top()/*not oop*/, thread,
+      Node* eden_pf_adr = AddPNode::make_off_heap(thread,
                    _igvn.MakeConX(in_bytes(JavaThread::tlab_pf_top_offset())));
       transform_later(eden_pf_adr);
 
@@ -1860,8 +1860,8 @@ Node* PhaseMacroExpand::prefetch_allocation(Node* i_o, Node*& needgc_false,
       Node* need_pf_false = new IfFalseNode(need_pf_iff);
       transform_later(need_pf_false);
 
-      Node* new_pf_wmt = new AddPNode(top(), old_pf_wm,
-                                    _igvn.MakeConX(AllocatePrefetchDistance));
+      Node* new_pf_wmt = AddPNode::make_off_heap(old_pf_wm,
+                                                 _igvn.MakeConX(AllocatePrefetchDistance));
       transform_later(new_pf_wmt);
       new_pf_wmt->set_req(0, need_pf_true);
 
@@ -1880,8 +1880,8 @@ Node* PhaseMacroExpand::prefetch_allocation(Node* i_o, Node*& needgc_false,
       uint distance = 0;
 
       for (intx i = 0; i < lines; i++) {
-        prefetch_adr = new AddPNode(top(), new_pf_wmt,
-                                            _igvn.MakeConX(distance));
+        prefetch_adr = AddPNode::make_off_heap(new_pf_wmt,
+                                               _igvn.MakeConX(distance));
         transform_later(prefetch_adr);
         prefetch = new PrefetchAllocationNode(i_o, prefetch_adr);
         transform_later(prefetch);
@@ -1912,8 +1912,8 @@ Node* PhaseMacroExpand::prefetch_allocation(Node* i_o, Node*& needgc_false,
       uint distance = AllocatePrefetchDistance;
 
       // Next cache address.
-      Node* cache_adr = new AddPNode(top(), old_eden_top,
-                                     _igvn.MakeConX(step_size + distance));
+      Node* cache_adr = AddPNode::make_off_heap(old_eden_top,
+                                                _igvn.MakeConX(step_size + distance));
       transform_later(cache_adr);
       cache_adr = new CastP2XNode(needgc_false, cache_adr);
       transform_later(cache_adr);
@@ -1932,8 +1932,8 @@ Node* PhaseMacroExpand::prefetch_allocation(Node* i_o, Node*& needgc_false,
       Node* prefetch_adr;
       distance = step_size;
       for (intx i = 1; i < lines; i++) {
-        prefetch_adr = new AddPNode(top(), cache_adr,
-                                            _igvn.MakeConX(distance));
+        prefetch_adr = AddPNode::make_off_heap(cache_adr,
+                                               _igvn.MakeConX(distance));
         transform_later(prefetch_adr);
         prefetch = new PrefetchAllocationNode(contended_phi_rawmem, prefetch_adr);
         transform_later(prefetch);
@@ -1948,8 +1948,8 @@ Node* PhaseMacroExpand::prefetch_allocation(Node* i_o, Node*& needgc_false,
       uint step_size = AllocatePrefetchStepSize;
       uint distance = AllocatePrefetchDistance;
       for (intx i = 0; i < lines; i++) {
-        prefetch_adr = new AddPNode(top(), new_eden_top,
-                                            _igvn.MakeConX(distance));
+        prefetch_adr = AddPNode::make_off_heap(new_eden_top,
+                                               _igvn.MakeConX(distance));
         transform_later(prefetch_adr);
         prefetch = new PrefetchAllocationNode(i_o, prefetch_adr);
         // Do not let it float too high, since if eden_top == eden_end,
diff --git a/src/hotspot/share/opto/macro.hpp b/src/hotspot/share/opto/macro.hpp
index 070bfbe1478..59a455cae6d 100644
--- a/src/hotspot/share/opto/macro.hpp
+++ b/src/hotspot/share/opto/macro.hpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2005, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2005, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -41,19 +41,31 @@ private:
 public:
   // Helper methods roughly modeled after GraphKit:
   Node* basic_plus_adr(Node* ptr, int offset, bool raw_base = false) {
-    return (offset == 0)? ptr: basic_plus_adr(ptr, MakeConX(offset), raw_base);
+    return basic_plus_adr(ptr, MakeConX(offset), raw_base);
   }
+
   Node* basic_plus_adr(Node* base, Node* ptr, int offset) {
-    return (offset == 0)? ptr: basic_plus_adr(base, ptr, MakeConX(offset));
+    return basic_plus_adr(base, ptr, MakeConX(offset));
   }
+
   Node* basic_plus_adr(Node* ptr, Node* offset, bool raw_base = false) {
     Node* base = raw_base ? top() : ptr;
     return basic_plus_adr(base, ptr, offset);
   }
+
   Node* basic_plus_adr(Node* base, Node* ptr, Node* offset) {
-    Node* adr = new AddPNode(base, ptr, offset);
-    return transform_later(adr);
+    return (offset == MakeConX(0)) ?
+           ptr : transform_later(AddPNode::make_with_base(base, ptr, offset));
   }
+
+  Node* off_heap_plus_addr(Node* ptr, int offset) {
+    return basic_plus_adr(top(), ptr, MakeConX(offset));
+  }
+
+  Node* off_heap_plus_addr(Node* ptr, Node* offset) {
+    return basic_plus_adr(top(), ptr, offset);
+  }
+
   Node* transform_later(Node* n) {
     // equivalent to _gvn.transform in GraphKit, Ideal, etc.
     _igvn.register_new_node_with_optimizer(n);
diff --git a/src/hotspot/share/opto/macroArrayCopy.cpp b/src/hotspot/share/opto/macroArrayCopy.cpp
index 344561606b5..139775506db 100644
--- a/src/hotspot/share/opto/macroArrayCopy.cpp
+++ b/src/hotspot/share/opto/macroArrayCopy.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2012, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2012, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -640,7 +640,7 @@ Node* PhaseMacroExpand::generate_arraycopy(ArrayCopyNode *ac, AllocateArrayNode*
 
         // (At this point we can assume disjoint_bases, since types differ.)
         int ek_offset = in_bytes(ObjArrayKlass::element_klass_offset());
-        Node* p1 = basic_plus_adr(top(), dest_klass, ek_offset);
+        Node* p1 = off_heap_plus_addr(dest_klass, ek_offset);
         Node* n1 = LoadKlassNode::make(_igvn, C->immutable_memory(), p1, TypeRawPtr::BOTTOM);
         Node* dest_elem_klass = transform_later(n1);
         Node* cv = generate_checkcast_arraycopy(&local_ctrl, &local_mem,
@@ -1131,7 +1131,7 @@ Node* PhaseMacroExpand::generate_checkcast_arraycopy(Node** ctrl, MergeMemNode**
   // look in each non-null element's class, at the desired klass's
   // super_check_offset, for the desired klass.
   int sco_offset = in_bytes(Klass::super_check_offset_offset());
-  Node* p3 = basic_plus_adr(top(), dest_elem_klass, sco_offset);
+  Node* p3 = off_heap_plus_addr(dest_elem_klass, sco_offset);
   Node* n3 = new LoadINode(nullptr, *mem /*memory(p3)*/, p3, _igvn.type(p3)->is_ptr(), TypeInt::INT, MemNode::unordered);
   Node* check_offset = ConvI2X(transform_later(n3));
   Node* check_value  = dest_elem_klass;
diff --git a/src/hotspot/share/opto/memnode.cpp b/src/hotspot/share/opto/memnode.cpp
index 85bc41e71b9..3cd553e4bd1 100644
--- a/src/hotspot/share/opto/memnode.cpp
+++ b/src/hotspot/share/opto/memnode.cpp
@@ -1846,7 +1846,7 @@ Node* LoadNode::split_through_phi(PhaseGVN* phase, bool ignore_missing_instance_
       }
       if (base_is_phi && (base->in(0) == region)) {
         Node* base_x = base->in(i); // Clone address for loads from boxed objects.
-        Node* adr_x = phase->transform(new AddPNode(base_x,base_x,address->in(AddPNode::Offset)));
+        Node* adr_x = phase->transform(AddPNode::make_with_base(base_x, address->in(AddPNode::Offset)));
         x->set_req(Address, adr_x);
       }
     }
@@ -4191,10 +4191,10 @@ Node *ClearArrayNode::Ideal(PhaseGVN *phase, bool can_reshape) {
   Node *off  = phase->MakeConX(BytesPerLong);
   mem = new StoreLNode(in(0),mem,adr,atp,zero,MemNode::unordered,false);
   count--;
-  while( count-- ) {
+  while (count--) {
     mem = phase->transform(mem);
-    adr = phase->transform(new AddPNode(base,adr,off));
-    mem = new StoreLNode(in(0),mem,adr,atp,zero,MemNode::unordered,false);
+    adr = phase->transform(AddPNode::make_with_base(base, adr, off));
+    mem = new StoreLNode(in(0), mem, adr, atp, zero, MemNode::unordered, false);
   }
   return mem;
 }
@@ -4231,7 +4231,7 @@ Node* ClearArrayNode::make_address(Node* dest, Node* offset, bool raw_base, Phas
     // May be called as part of the initialization of a just allocated object
     base = phase->C->top();
   }
-  return phase->transform(new AddPNode(base, dest, offset));
+  return phase->transform(AddPNode::make_with_base(base, dest, offset));
 }
 
 //----------------------------clear_memory-------------------------------------
@@ -5042,8 +5042,7 @@ Node* InitializeNode::make_raw_address(intptr_t offset,
   Node* addr = in(RawAddress);
   if (offset != 0) {
     Compile* C = phase->C;
-    addr = phase->transform( new AddPNode(C->top(), addr,
-                                                 phase->MakeConX(offset)) );
+    addr = phase->transform(AddPNode::make_off_heap(addr, phase->MakeConX(offset)));
   }
   return addr;
 }
diff --git a/src/hotspot/share/opto/parse1.cpp b/src/hotspot/share/opto/parse1.cpp
index 2f699650037..647e8515b30 100644
--- a/src/hotspot/share/opto/parse1.cpp
+++ b/src/hotspot/share/opto/parse1.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1997, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -104,9 +104,9 @@ void Parse::print_statistics() {
 Node *Parse::fetch_interpreter_state(int index,
                                      BasicType bt,
                                      Node* local_addrs) {
-  Node *mem = memory(Compile::AliasIdxRaw);
-  Node *adr = basic_plus_adr(top(), local_addrs, -index*wordSize);
-  Node *ctl = control();
+  Node* mem = memory(Compile::AliasIdxRaw);
+  Node* adr = off_heap_plus_addr(local_addrs, -index*wordSize);
+  Node* ctl = control();
 
   // Very similar to LoadNode::make, except we handle un-aligned longs and
   // doubles on Sparc.  Intel can handle them just fine directly.
@@ -120,7 +120,7 @@ Node *Parse::fetch_interpreter_state(int index,
   case T_DOUBLE: {
     // Since arguments are in reverse order, the argument address 'adr'
     // refers to the back half of the long/double.  Recompute adr.
-    adr = basic_plus_adr(top(), local_addrs, -(index+1)*wordSize);
+    adr = off_heap_plus_addr(local_addrs, -(index+1)*wordSize);
     if (Matcher::misaligned_doubles_ok) {
       l = (bt == T_DOUBLE)
         ? (Node*)new LoadDNode(ctl, mem, adr, TypeRawPtr::BOTTOM, Type::DOUBLE, MemNode::unordered)
@@ -219,7 +219,7 @@ void Parse::load_interpreter_state(Node* osr_buf) {
   // Commute monitors from interpreter frame to compiler frame.
   assert(jvms()->monitor_depth() == 0, "should be no active locks at beginning of osr");
   int mcnt = osr_block->flow()->monitor_count();
-  Node *monitors_addr = basic_plus_adr(top(), osr_buf, (max_locals+mcnt*2-1)*wordSize);
+  Node* monitors_addr = off_heap_plus_addr(osr_buf, (max_locals+mcnt*2-1)*wordSize);
   for (index = 0; index < mcnt; index++) {
     // Make a BoxLockNode for the monitor.
     BoxLockNode* osr_box = new BoxLockNode(next_monitor());
@@ -270,7 +270,7 @@ void Parse::load_interpreter_state(Node* osr_buf) {
   }
 
   // Extract the needed locals from the interpreter frame.
-  Node *locals_addr = basic_plus_adr(top(), osr_buf, (max_locals-1)*wordSize);
+  Node* locals_addr = off_heap_plus_addr(osr_buf, (max_locals-1)*wordSize);
 
   // find all the locals that the interpreter thinks contain live oops
   const ResourceBitMap live_oops = method()->live_local_oops_at_bci(osr_bci());
@@ -2127,7 +2127,7 @@ void Parse::call_register_finalizer() {
   Node* klass_addr = basic_plus_adr( receiver, receiver, oopDesc::klass_offset_in_bytes() );
   Node* klass = _gvn.transform(LoadKlassNode::make(_gvn, immutable_memory(), klass_addr, TypeInstPtr::KLASS));
 
-  Node* access_flags_addr = basic_plus_adr(top(), klass, in_bytes(Klass::misc_flags_offset()));
+  Node* access_flags_addr = off_heap_plus_addr(klass, in_bytes(Klass::misc_flags_offset()));
   Node* access_flags = make_load(nullptr, access_flags_addr, TypeInt::UBYTE, T_BOOLEAN, MemNode::unordered);
 
   Node* mask  = _gvn.transform(new AndINode(access_flags, intcon(KlassFlags::_misc_has_finalizer)));
@@ -2273,9 +2273,9 @@ void Parse::add_safepoint() {
   sfpnt->init_req(TypeFunc::FramePtr , top() );
 
   // Create a node for the polling address
-  Node *polladr;
-  Node *thread = _gvn.transform(new ThreadLocalNode());
-  Node *polling_page_load_addr = _gvn.transform(basic_plus_adr(top(), thread, in_bytes(JavaThread::polling_page_offset())));
+  Node* polladr;
+  Node* thread = _gvn.transform(new ThreadLocalNode());
+  Node* polling_page_load_addr = _gvn.transform(off_heap_plus_addr(thread, in_bytes(JavaThread::polling_page_offset())));
   polladr = make_load(control(), polling_page_load_addr, TypeRawPtr::BOTTOM, T_ADDRESS, MemNode::unordered);
   sfpnt->init_req(TypeFunc::Parms+0, _gvn.transform(polladr));
 
diff --git a/src/hotspot/share/opto/parseHelper.cpp b/src/hotspot/share/opto/parseHelper.cpp
index 2e8fca68a8d..232f5d6c89a 100644
--- a/src/hotspot/share/opto/parseHelper.cpp
+++ b/src/hotspot/share/opto/parseHelper.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1998, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1998, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -220,7 +220,7 @@ void Parse::array_store_check() {
 
   // Extract the array element class
   int element_klass_offset = in_bytes(ObjArrayKlass::element_klass_offset());
-  Node* p2 = basic_plus_adr(top(), array_klass, element_klass_offset);
+  Node* p2 = off_heap_plus_addr(array_klass, element_klass_offset);
   Node* a_e_klass = _gvn.transform(LoadKlassNode::make(_gvn, immutable_memory(), p2, tak));
   assert(array_klass->is_Con() == a_e_klass->is_Con() || StressReflectiveCode, "a constant array type must come with a constant element type");
 
diff --git a/src/hotspot/share/opto/subtypenode.cpp b/src/hotspot/share/opto/subtypenode.cpp
index 8e4c7d829a7..69b7058d053 100644
--- a/src/hotspot/share/opto/subtypenode.cpp
+++ b/src/hotspot/share/opto/subtypenode.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2020, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -182,7 +182,7 @@ bool SubTypeCheckNode::verify(PhaseGVN* phase) {
         return verify_helper(phase, load_klass(phase), cached_t);
       }
       case Compile::SSC_full_test: {
-        Node* p1 = phase->transform(new AddPNode(C->top(), superklass, phase->MakeConX(in_bytes(Klass::super_check_offset_offset()))));
+        Node* p1 = phase->transform(AddPNode::make_off_heap(superklass, phase->MakeConX(in_bytes(Klass::super_check_offset_offset()))));
         Node* chk_off = phase->transform(new LoadINode(nullptr, C->immutable_memory(), p1, phase->type(p1)->is_ptr(), TypeInt::INT, MemNode::unordered));
         record_for_cleanup(chk_off, phase);
 
@@ -194,7 +194,7 @@ bool SubTypeCheckNode::verify(PhaseGVN* phase) {
 #ifdef _LP64
           chk_off_X = phase->transform(new ConvI2LNode(chk_off_X));
 #endif
-          Node* p2 = phase->transform(new AddPNode(C->top(), subklass, chk_off_X));
+          Node* p2 = phase->transform(AddPNode::make_off_heap(subklass, chk_off_X));
           Node* nkls = phase->transform(LoadKlassNode::make(*phase, C->immutable_memory(), p2, phase->type(p2)->is_ptr(), TypeInstKlassPtr::OBJECT_OR_NULL));
 
           return verify_helper(phase, nkls, cached_t);
@@ -217,7 +217,7 @@ Node* SubTypeCheckNode::load_klass(PhaseGVN* phase) const {
   const Type* sub_t = phase->type(obj_or_subklass);
   Node* subklass = nullptr;
   if (sub_t->isa_oopptr()) {
-    Node* adr = phase->transform(new AddPNode(obj_or_subklass, obj_or_subklass, phase->MakeConX(oopDesc::klass_offset_in_bytes())));
+    Node* adr = phase->transform(AddPNode::make_with_base(obj_or_subklass, phase->MakeConX(oopDesc::klass_offset_in_bytes())));
     subklass  = phase->transform(LoadKlassNode::make(*phase, phase->C->immutable_memory(), adr, TypeInstPtr::KLASS));
     record_for_cleanup(subklass, phase);
   } else {

From 700a3856341cc83e370ca35bd0f703f75c6ce9bf Mon Sep 17 00:00:00 2001
From: Thomas Schatzl <tschatzl@openjdk.org>
Date: Mon, 23 Mar 2026 09:38:37 +0000
Subject: [PATCH 301/655] 8080226: G1: Replace collector state booleans with
 explicit state variable(s)

Reviewed-by: iwalulya, ayang
---
 src/hotspot/share/gc/g1/g1CollectedHeap.cpp   | 10 +--
 src/hotspot/share/gc/g1/g1CollectionSet.cpp   |  4 +-
 src/hotspot/share/gc/g1/g1CollectorState.cpp  | 29 +++----
 src/hotspot/share/gc/g1/g1CollectorState.hpp  | 87 +++++++++----------
 src/hotspot/share/gc/g1/g1HeapVerifier.cpp    |  8 +-
 src/hotspot/share/gc/g1/g1Policy.cpp          | 54 +++++-------
 src/hotspot/share/gc/g1/g1Policy.hpp          |  2 +-
 src/hotspot/share/gc/g1/g1RootClosures.cpp    |  4 +-
 src/hotspot/share/gc/g1/g1YoungCollector.cpp  | 14 +--
 .../g1/g1YoungGCAllocationFailureInjector.cpp |  4 +-
 .../gc/g1/g1YoungGCPostEvacuateTasks.cpp      |  2 +-
 11 files changed, 100 insertions(+), 118 deletions(-)

diff --git a/src/hotspot/share/gc/g1/g1CollectedHeap.cpp b/src/hotspot/share/gc/g1/g1CollectedHeap.cpp
index 8b41a3b2079..480550d6ed1 100644
--- a/src/hotspot/share/gc/g1/g1CollectedHeap.cpp
+++ b/src/hotspot/share/gc/g1/g1CollectedHeap.cpp
@@ -2481,7 +2481,7 @@ void G1CollectedHeap::trace_heap(GCWhen::Type when, const GCTracer* gc_tracer) {
 void G1CollectedHeap::gc_prologue(bool full) {
   // Update common counters.
   increment_total_collections(full /* full gc */);
-  if (full || collector_state()->in_concurrent_start_gc()) {
+  if (full || collector_state()->is_in_concurrent_start_gc()) {
     increment_old_marking_cycles_started();
   }
 }
@@ -2651,7 +2651,7 @@ void G1CollectedHeap::verify_after_young_collection(G1HeapVerifier::G1VerifyType
   verify_numa_regions("GC End");
   _verifier->verify_region_sets_optional();
 
-  if (collector_state()->in_concurrent_start_gc()) {
+  if (collector_state()->is_in_concurrent_start_gc()) {
     log_debug(gc, verify)("Marking state");
     _verifier->verify_marking_state();
   }
@@ -2732,7 +2732,7 @@ void G1CollectedHeap::do_collection_pause_at_safepoint(size_t allocation_word_si
   // Record whether this pause may need to trigger a concurrent operation. Later,
   // when we signal the G1ConcurrentMarkThread, the collector state has already
   // been reset for the next pause.
-  bool should_start_concurrent_mark_operation = collector_state()->in_concurrent_start_gc();
+  bool should_start_concurrent_mark_operation = collector_state()->is_in_concurrent_start_gc();
 
   // Perform the collection.
   G1YoungCollector collector(gc_cause(), allocation_word_size);
@@ -2827,7 +2827,7 @@ bool G1STWSubjectToDiscoveryClosure::do_object_b(oop obj) {
 }
 
 void G1CollectedHeap::make_pending_list_reachable() {
-  if (collector_state()->in_concurrent_start_gc()) {
+  if (collector_state()->is_in_concurrent_start_gc()) {
     oop pll_head = Universe::reference_pending_list();
     if (pll_head != nullptr) {
       // Any valid worker id is fine here as we are in the VM thread and single-threaded.
@@ -3212,7 +3212,7 @@ void G1CollectedHeap::retire_gc_alloc_region(G1HeapRegion* alloc_region,
     _survivor.add_used_bytes(allocated_bytes);
   }
 
-  bool const during_im = collector_state()->in_concurrent_start_gc();
+  bool const during_im = collector_state()->is_in_concurrent_start_gc();
   if (during_im && allocated_bytes > 0) {
     _cm->add_root_region(alloc_region);
   }
diff --git a/src/hotspot/share/gc/g1/g1CollectionSet.cpp b/src/hotspot/share/gc/g1/g1CollectionSet.cpp
index 39acaaab913..978925d88cb 100644
--- a/src/hotspot/share/gc/g1/g1CollectionSet.cpp
+++ b/src/hotspot/share/gc/g1/g1CollectionSet.cpp
@@ -325,7 +325,7 @@ double G1CollectionSet::finalize_young_part(double target_pause_time_ms, G1Survi
   guarantee(target_pause_time_ms > 0.0,
             "target_pause_time_ms = %1.6lf should be positive", target_pause_time_ms);
 
-  bool in_young_only_phase = _policy->collector_state()->in_young_only_phase();
+  bool in_young_only_phase = _policy->collector_state()->is_in_young_only_phase();
   size_t pending_cards = _policy->analytics()->predict_pending_cards(in_young_only_phase);
 
   log_trace(gc, ergo, cset)("Start choosing CSet. Pending cards: %zu target pause time: %1.2fms",
@@ -378,7 +378,7 @@ void G1CollectionSet::finalize_old_part(double time_remaining_ms) {
   if (!candidates()->is_empty()) {
     candidates()->verify();
 
-    if (collector_state()->in_mixed_phase()) {
+    if (collector_state()->is_in_mixed_phase()) {
       time_remaining_ms = select_candidates_from_marking(time_remaining_ms);
     } else {
       log_debug(gc, ergo, cset)("Do not add marking candidates to collection set due to pause type.");
diff --git a/src/hotspot/share/gc/g1/g1CollectorState.cpp b/src/hotspot/share/gc/g1/g1CollectorState.cpp
index b64e9d45674..d40a445c0ed 100644
--- a/src/hotspot/share/gc/g1/g1CollectorState.cpp
+++ b/src/hotspot/share/gc/g1/g1CollectorState.cpp
@@ -26,24 +26,19 @@
 #include "gc/g1/g1CollectorState.hpp"
 #include "gc/g1/g1ConcurrentMarkThread.inline.hpp"
 #include "gc/g1/g1GCPauseType.hpp"
+#include "runtime/safepoint.hpp"
 
-G1GCPauseType G1CollectorState::young_gc_pause_type(bool concurrent_operation_is_full_mark) const {
-  assert(!in_full_gc(), "must be");
-  if (in_concurrent_start_gc()) {
-    assert(!in_young_gc_before_mixed(), "must be");
-    return concurrent_operation_is_full_mark ? G1GCPauseType::ConcurrentStartMarkGC :
-                                               G1GCPauseType::ConcurrentStartUndoGC;
-  } else if (in_young_gc_before_mixed()) {
-    assert(!in_concurrent_start_gc(), "must be");
-    return G1GCPauseType::LastYoungGC;
-  } else if (in_mixed_phase()) {
-    assert(!in_concurrent_start_gc(), "must be");
-    assert(!in_young_gc_before_mixed(), "must be");
-    return G1GCPauseType::MixedGC;
-  } else {
-    assert(!in_concurrent_start_gc(), "must be");
-    assert(!in_young_gc_before_mixed(), "must be");
-    return G1GCPauseType::YoungGC;
+G1GCPauseType G1CollectorState::gc_pause_type(bool concurrent_operation_is_full_mark) const {
+  assert(SafepointSynchronize::is_at_safepoint(), "must be");
+  switch (_phase) {
+    case Phase::YoungNormal: return G1GCPauseType::YoungGC;
+    case Phase::YoungLastYoung: return G1GCPauseType::LastYoungGC;
+    case Phase::YoungConcurrentStart:
+        return concurrent_operation_is_full_mark ? G1GCPauseType::ConcurrentStartMarkGC :
+                                                   G1GCPauseType::ConcurrentStartUndoGC;
+    case Phase::Mixed: return G1GCPauseType::MixedGC;
+    case Phase::FullGC: return G1GCPauseType::FullGC;
+    default: ShouldNotReachHere();
   }
 }
 
diff --git a/src/hotspot/share/gc/g1/g1CollectorState.hpp b/src/hotspot/share/gc/g1/g1CollectorState.hpp
index ddf9d7fd181..c2923cb3954 100644
--- a/src/hotspot/share/gc/g1/g1CollectorState.hpp
+++ b/src/hotspot/share/gc/g1/g1CollectorState.hpp
@@ -29,68 +29,61 @@
 #include "utilities/globalDefinitions.hpp"
 
 // State of the G1 collection.
+//
+// The rough phasing is Young-Only, Mixed / Space Reclamation and
+// Full GC "phase".
+//
+// We split the Young-only phase into three parts to cover interesting
+// sub-phases and avoid separate tracking.
 class G1CollectorState {
-  // Indicates whether we are in the phase where we do partial gcs that only contain
-  // the young generation. Not set while _in_full_gc is set.
-  bool _in_young_only_phase;
+  enum class Phase {
+    // Indicates that the next GC in the Young-Only phase will (likely) be a "Normal"
+    // young GC.
+    YoungNormal,
+    // We are in a concurrent start GC during the Young-Only phase. This is only set
+    // during that GC because we only decide whether we do this type of GC at the start
+    // of the pause.
+    YoungConcurrentStart,
+    // Indicates that we are about to start or in the last young gc in the Young-Only
+    // phase before the Mixed phase. This GC is required to keep pause time requirements.
+    YoungLastYoung,
+    // Doing extra old generation evacuation.
+    Mixed,
+    // The Full GC phase (that coincides with the Full GC pause).
+    FullGC
+  } _phase;
 
-  // Indicates whether we are in the last young gc before the mixed gc phase. This GC
-  // is required to keep pause time requirements.
-  bool _in_young_gc_before_mixed;
-
-  // If _initiate_conc_mark_if_possible is set at the beginning of a
-  // pause, it is a suggestion that the pause should start a marking
-  // cycle by doing the concurrent start work. However, it is possible
-  // that the concurrent marking thread is still finishing up the
-  // previous marking cycle (e.g., clearing the marking bitmap).
-  // If that is the case we cannot start a new cycle and
-  // we'll have to wait for the concurrent marking thread to finish
-  // what it is doing. In this case we will postpone the marking cycle
-  // initiation decision for the next pause. When we eventually decide
-  // to start a cycle, we will set _in_concurrent_start_gc which
-  // will stay true until the end of the concurrent start pause doing the
-  // concurrent start work.
-  volatile bool _in_concurrent_start_gc;
-
-  // At the end of a pause we check the heap occupancy and we decide
-  // whether we will start a marking cycle during the next pause. If
-  // we decide that we want to do that, set this parameter. This parameter will
-  // stay set until the beginning of a subsequent pause (not necessarily
-  // the next one) when we decide that we will indeed start a marking cycle and
-  // do the concurrent start phase work.
+  // _initiate_conc_mark_if_possible indicates that there has been a request to start
+  // a concurrent cycle but we have not been able to fulfill it because another one
+  // has been in progress when the request came in.
+  //
+  // This flag remembers that there is an unfullfilled request.
   volatile bool _initiate_conc_mark_if_possible;
 
-  // Set during a full gc pause.
-  bool _in_full_gc;
-
 public:
   G1CollectorState() :
-    _in_young_only_phase(true),
-    _in_young_gc_before_mixed(false),
-
-    _in_concurrent_start_gc(false),
-    _initiate_conc_mark_if_possible(false),
-
-    _in_full_gc(false) { }
+    _phase(Phase::YoungNormal),
+    _initiate_conc_mark_if_possible(false) { }
 
   // Phase setters
-  void set_in_young_only_phase(bool v) { _in_young_only_phase = v; }
+  void set_in_normal_young_gc() { _phase = Phase::YoungNormal; }
+  void set_in_space_reclamation_phase() { _phase = Phase::Mixed; }
+  void set_in_full_gc() { _phase = Phase::FullGC; }
 
   // Pause setters
-  void set_in_young_gc_before_mixed(bool v) { _in_young_gc_before_mixed = v; }
-  void set_in_concurrent_start_gc(bool v) { _in_concurrent_start_gc = v; }
-  void set_in_full_gc(bool v) { _in_full_gc = v; }
+  void set_in_young_gc_before_mixed() { _phase = Phase::YoungLastYoung; }
+  void set_in_concurrent_start_gc() { _phase = Phase::YoungConcurrentStart; _initiate_conc_mark_if_possible = false; }
 
   void set_initiate_conc_mark_if_possible(bool v) { _initiate_conc_mark_if_possible = v; }
 
   // Phase getters
-  bool in_young_only_phase() const { return _in_young_only_phase && !_in_full_gc; }
-  bool in_mixed_phase() const { return !_in_young_only_phase && !_in_full_gc; }
+  bool is_in_young_only_phase() const { return _phase == Phase::YoungNormal || _phase == Phase::YoungConcurrentStart || _phase == Phase::YoungLastYoung; }
+  bool is_in_mixed_phase() const { return _phase == Phase::Mixed; }
 
   // Specific pauses
-  bool in_young_gc_before_mixed() const { return _in_young_gc_before_mixed; }
-  bool in_full_gc() const { return _in_full_gc; }
-  bool in_concurrent_start_gc() const { return _in_concurrent_start_gc; }
+  bool is_in_young_gc_before_mixed() const { return _phase == Phase::YoungLastYoung; }
+  bool is_in_full_gc() const { return _phase == Phase::FullGC; }
+  bool is_in_concurrent_start_gc() const { return _phase == Phase::YoungConcurrentStart; }
 
   bool initiate_conc_mark_if_possible() const { return _initiate_conc_mark_if_possible; }
 
@@ -100,7 +93,7 @@ public:
   bool is_in_reset_for_next_cycle() const;
 
   // Calculate GC Pause Type from internal state.
-  G1GCPauseType young_gc_pause_type(bool concurrent_operation_is_full_mark) const;
+  G1GCPauseType gc_pause_type(bool concurrent_operation_is_full_mark) const;
 };
 
 #endif // SHARE_GC_G1_G1COLLECTORSTATE_HPP
diff --git a/src/hotspot/share/gc/g1/g1HeapVerifier.cpp b/src/hotspot/share/gc/g1/g1HeapVerifier.cpp
index a2a9bc8e857..dd7a8aa117d 100644
--- a/src/hotspot/share/gc/g1/g1HeapVerifier.cpp
+++ b/src/hotspot/share/gc/g1/g1HeapVerifier.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2016, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2016, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -236,7 +236,7 @@ private:
   VerifyOption     _vo;
   bool             _failures;
 
-  bool is_in_full_gc() const { return G1CollectedHeap::heap()->collector_state()->in_full_gc(); }
+  bool is_in_full_gc() const { return G1CollectedHeap::heap()->collector_state()->is_in_full_gc(); }
 
 public:
   VerifyRegionClosure(VerifyOption vo)
@@ -349,7 +349,7 @@ void G1HeapVerifier::verify(VerifyOption vo) {
 
   bool failures = rootsCl.failures() || codeRootsCl.failures();
 
-  if (!_g1h->policy()->collector_state()->in_full_gc()) {
+  if (!_g1h->policy()->collector_state()->is_in_full_gc()) {
     // If we're verifying during a full GC then the region sets
     // will have been torn down at the start of the GC. Therefore
     // verifying the region sets will fail. So we only verify
@@ -494,7 +494,7 @@ public:
 };
 
 void G1HeapVerifier::verify_marking_state() {
-  assert(G1CollectedHeap::heap()->collector_state()->in_concurrent_start_gc(), "must be");
+  assert(G1CollectedHeap::heap()->collector_state()->is_in_concurrent_start_gc(), "must be");
 
   // Verify TAMSes, bitmaps and liveness statistics.
   //
diff --git a/src/hotspot/share/gc/g1/g1Policy.cpp b/src/hotspot/share/gc/g1/g1Policy.cpp
index 3c8b81bdb8f..1fa5aa877c0 100644
--- a/src/hotspot/share/gc/g1/g1Policy.cpp
+++ b/src/hotspot/share/gc/g1/g1Policy.cpp
@@ -177,7 +177,7 @@ uint G1Policy::calculate_desired_eden_length_by_mmu() const {
 
 void G1Policy::update_young_length_bounds() {
   assert(!Universe::is_fully_initialized() || SafepointSynchronize::is_at_safepoint(), "must be");
-  bool for_young_only_phase = collector_state()->in_young_only_phase();
+  bool for_young_only_phase = collector_state()->is_in_young_only_phase();
   update_young_length_bounds(_analytics->predict_pending_cards(for_young_only_phase),
                              _analytics->predict_card_rs_length(for_young_only_phase),
                              _analytics->predict_code_root_rs_length(for_young_only_phase));
@@ -505,7 +505,7 @@ uint G1Policy::calculate_desired_eden_length_before_mixed(double base_time_ms,
 double G1Policy::predict_survivor_regions_evac_time() const {
   double survivor_regions_evac_time = predict_young_region_other_time_ms(_g1h->survivor()->length());
   for (G1HeapRegion* r : _g1h->survivor()->regions()) {
-    survivor_regions_evac_time += predict_region_copy_time_ms(r, _g1h->collector_state()->in_young_only_phase());
+    survivor_regions_evac_time += predict_region_copy_time_ms(r, _g1h->collector_state()->is_in_young_only_phase());
   }
 
   return survivor_regions_evac_time;
@@ -561,8 +561,7 @@ void G1Policy::revise_young_list_target_length(size_t pending_cards, size_t card
 void G1Policy::record_full_collection_start() {
   record_pause_start_time();
   // Release the future to-space so that it is available for compaction into.
-  collector_state()->set_in_young_only_phase(false);
-  collector_state()->set_in_full_gc(true);
+  collector_state()->set_in_full_gc();
   _collection_set->abandon_all_candidates();
 }
 
@@ -571,14 +570,10 @@ void G1Policy::record_full_collection_end(size_t allocation_word_size) {
   // since last pause.
   double end_sec = os::elapsedTime();
 
-  collector_state()->set_in_full_gc(false);
-
   // "Nuke" the heuristics that control the young/mixed GC
   // transitions and make sure we start with young GCs after the Full GC.
-  collector_state()->set_in_young_only_phase(true);
-  collector_state()->set_in_young_gc_before_mixed(false);
+  collector_state()->set_in_normal_young_gc();
   collector_state()->set_initiate_conc_mark_if_possible(need_to_start_conc_mark("end of Full GC", allocation_word_size));
-  collector_state()->set_in_concurrent_start_gc(false);
 
   _eden_surv_rate_group->start_adding_regions();
   // also call this on any additional surv rate groups
@@ -697,7 +692,7 @@ void G1Policy::record_young_collection_start() {
 
 void G1Policy::record_concurrent_mark_init_end() {
   assert(!collector_state()->initiate_conc_mark_if_possible(), "we should have cleared it by now");
-  collector_state()->set_in_concurrent_start_gc(false);
+  collector_state()->set_in_normal_young_gc();
 }
 
 void G1Policy::record_concurrent_mark_remark_end() {
@@ -735,7 +730,7 @@ double G1Policy::constant_other_time_ms(double pause_time_ms) const {
 }
 
 bool G1Policy::about_to_start_mixed_phase() const {
-  return collector_state()->is_in_concurrent_cycle() || collector_state()->in_young_gc_before_mixed();
+  return collector_state()->is_in_concurrent_cycle() || collector_state()->is_in_young_gc_before_mixed();
 }
 
 bool G1Policy::need_to_start_conc_mark(const char* source, size_t allocation_word_size) {
@@ -748,7 +743,7 @@ bool G1Policy::need_to_start_conc_mark(const char* source, size_t allocation_wor
 
   bool result = false;
   if (non_young_occupancy > marking_initiating_used_threshold) {
-    result = collector_state()->in_young_only_phase();
+    result = collector_state()->is_in_young_only_phase();
     log_debug(gc, ergo, ihop)("%s non-young occupancy: %zuB allocation request: %zuB threshold: %zuB (%1.2f) source: %s",
                               result ? "Request concurrent cycle initiation (occupancy higher than threshold)" : "Do not request concurrent cycle initiation (still doing mixed collections)",
                               non_young_occupancy, allocation_word_size * HeapWordSize, marking_initiating_used_threshold, (double) marking_initiating_used_threshold / _g1h->capacity() * 100, source);
@@ -757,7 +752,7 @@ bool G1Policy::need_to_start_conc_mark(const char* source, size_t allocation_wor
 }
 
 bool G1Policy::concurrent_operation_is_full_mark(const char* msg, size_t allocation_word_size) {
-  return collector_state()->in_concurrent_start_gc() &&
+  return collector_state()->is_in_concurrent_start_gc() &&
     ((_g1h->gc_cause() != GCCause::_g1_humongous_allocation) || need_to_start_conc_mark(msg, allocation_word_size));
 }
 
@@ -796,7 +791,7 @@ void G1Policy::record_young_collection_end(bool concurrent_operation_is_full_mar
   double end_time_sec = Ticks::now().seconds();
   double pause_time_ms = (end_time_sec - start_time_sec) * 1000.0;
 
-  G1GCPauseType this_pause = collector_state()->young_gc_pause_type(concurrent_operation_is_full_mark);
+  G1GCPauseType this_pause = collector_state()->gc_pause_type(concurrent_operation_is_full_mark);
   bool is_young_only_pause = G1GCPauseTypeHelper::is_young_only_pause(this_pause);
 
   if (G1GCPauseTypeHelper::is_concurrent_start_pause(this_pause)) {
@@ -947,14 +942,13 @@ void G1Policy::record_young_collection_end(bool concurrent_operation_is_full_mar
     // This has been the young GC before we start doing mixed GCs. We already
     // decided to start mixed GCs much earlier, so there is nothing to do except
     // advancing the state.
-    collector_state()->set_in_young_only_phase(false);
-    collector_state()->set_in_young_gc_before_mixed(false);
+    collector_state()->set_in_space_reclamation_phase();
   } else if (G1GCPauseTypeHelper::is_mixed_pause(this_pause)) {
     // This is a mixed GC. Here we decide whether to continue doing more
     // mixed GCs or not.
     if (!next_gc_should_be_mixed()) {
       log_debug(gc, ergo)("do not continue mixed GCs (candidate old regions not available)");
-      collector_state()->set_in_young_only_phase(true);
+      collector_state()->set_in_normal_young_gc();
 
       assert(!candidates()->has_more_marking_candidates(),
              "only end mixed if all candidates from marking were processed");
@@ -1073,7 +1067,7 @@ void G1Policy::record_young_gc_pause_end(bool evacuation_failed) {
 double G1Policy::predict_base_time_ms(size_t pending_cards,
                                       size_t card_rs_length,
                                       size_t code_root_rs_length) const {
-  bool in_young_only_phase = collector_state()->in_young_only_phase();
+  bool in_young_only_phase = collector_state()->is_in_young_only_phase();
 
   // Cards from the refinement table and the cards from the young gen remset are
   // unique to each other as they are located on the card table.
@@ -1097,7 +1091,7 @@ double G1Policy::predict_base_time_ms(size_t pending_cards,
 }
 
 double G1Policy::predict_base_time_ms(size_t pending_cards, size_t card_rs_length) const {
-  bool for_young_only_phase = collector_state()->in_young_only_phase();
+  bool for_young_only_phase = collector_state()->is_in_young_only_phase();
   size_t code_root_rs_length = _analytics->predict_code_root_rs_length(for_young_only_phase);
   return predict_base_time_ms(pending_cards, card_rs_length, code_root_rs_length);
 }
@@ -1137,7 +1131,7 @@ double G1Policy::predict_eden_copy_time_ms(uint count, size_t* bytes_to_copy) co
   if (bytes_to_copy != nullptr) {
     *bytes_to_copy = expected_bytes;
   }
-  return _analytics->predict_object_copy_time_ms(expected_bytes, collector_state()->in_young_only_phase());
+  return _analytics->predict_object_copy_time_ms(expected_bytes, collector_state()->is_in_young_only_phase());
 }
 
 double G1Policy::predict_region_copy_time_ms(G1HeapRegion* hr, bool for_young_only_phase) const {
@@ -1243,8 +1237,7 @@ bool G1Policy::force_concurrent_start_if_outside_cycle(GCCause::Cause gc_cause)
 }
 
 void G1Policy::initiate_conc_mark() {
-  collector_state()->set_in_concurrent_start_gc(true);
-  collector_state()->set_initiate_conc_mark_if_possible(false);
+  collector_state()->set_in_concurrent_start_gc();
 }
 
 static const char* requester_for_mixed_abort(GCCause::Cause cause) {
@@ -1266,7 +1259,7 @@ void G1Policy::decide_on_concurrent_start_pause() {
   // will set it here if we have to. However, it should be cleared by
   // the end of the pause (it's only set for the duration of a
   // concurrent start pause).
-  assert(!collector_state()->in_concurrent_start_gc(), "pre-condition");
+  assert(!collector_state()->is_in_concurrent_start_gc(), "pre-condition");
 
   if (collector_state()->initiate_conc_mark_if_possible()) {
     // We had noticed on a previous pause that the heap occupancy has
@@ -1279,7 +1272,7 @@ void G1Policy::decide_on_concurrent_start_pause() {
     if ((cause != GCCause::_wb_breakpoint) &&
         ConcurrentGCBreakpoints::is_controlled()) {
       log_debug(gc, ergo)("Do not initiate concurrent cycle (whitebox controlled)");
-    } else if (!about_to_start_mixed_phase() && collector_state()->in_young_only_phase()) {
+    } else if (!about_to_start_mixed_phase() && collector_state()->is_in_young_only_phase()) {
       // Initiate a new concurrent start if there is no marking or reclamation going on.
       initiate_conc_mark();
       log_debug(gc, ergo)("Initiate concurrent cycle (concurrent cycle initiation requested)");
@@ -1288,8 +1281,7 @@ void G1Policy::decide_on_concurrent_start_pause() {
                (cause == GCCause::_wb_breakpoint)) {
       // Initiate a concurrent start.  A concurrent start must be a young only
       // GC, so the collector state must be updated to reflect this.
-      collector_state()->set_in_young_only_phase(true);
-      collector_state()->set_in_young_gc_before_mixed(false);
+      collector_state()->set_in_normal_young_gc();
 
       // We might have ended up coming here about to start a mixed phase with a collection set
       // active. The following remark might change the change the "evacuation efficiency" of
@@ -1318,10 +1310,10 @@ void G1Policy::decide_on_concurrent_start_pause() {
   }
   // Result consistency checks.
   // We do not allow concurrent start to be piggy-backed on a mixed GC.
-  assert(!collector_state()->in_concurrent_start_gc() ||
-         collector_state()->in_young_only_phase(), "sanity");
+  assert(!collector_state()->is_in_concurrent_start_gc() ||
+         collector_state()->is_in_young_only_phase(), "sanity");
   // We also do not allow mixed GCs during marking/rebuilding.
-  assert(!collector_state()->is_in_mark_or_rebuild() || collector_state()->in_young_only_phase(), "sanity %d %d", collector_state()->is_in_concurrent_cycle(), collector_state()->in_young_only_phase());
+  assert(!collector_state()->is_in_mark_or_rebuild() || collector_state()->is_in_young_only_phase(), "sanity %d %d", collector_state()->is_in_concurrent_cycle(), collector_state()->is_in_young_only_phase());
 }
 
 void G1Policy::record_concurrent_mark_cleanup_end(bool has_rebuilt_remembered_sets) {
@@ -1340,7 +1332,9 @@ void G1Policy::record_concurrent_mark_cleanup_end(bool has_rebuilt_remembered_se
     abort_time_to_mixed_tracking();
     log_debug(gc, ergo)("request young-only gcs (candidate old regions not available)");
   }
-  collector_state()->set_in_young_gc_before_mixed(mixed_gc_pending);
+  if (mixed_gc_pending) {
+    collector_state()->set_in_young_gc_before_mixed();
+  }
 
   double end_sec = os::elapsedTime();
   double start_sec = cur_pause_start_sec();
diff --git a/src/hotspot/share/gc/g1/g1Policy.hpp b/src/hotspot/share/gc/g1/g1Policy.hpp
index ccbde31a465..1209c7c02d5 100644
--- a/src/hotspot/share/gc/g1/g1Policy.hpp
+++ b/src/hotspot/share/gc/g1/g1Policy.hpp
@@ -115,7 +115,7 @@ class G1Policy: public CHeapObj<mtGC> {
   G1ConcurrentStartToMixedTimeTracker _concurrent_start_to_mixed;
 
   bool should_update_surv_rate_group_predictors() {
-    return collector_state()->in_young_only_phase() && !collector_state()->is_in_mark_or_rebuild();
+    return collector_state()->is_in_young_only_phase() && !collector_state()->is_in_mark_or_rebuild();
   }
 
   double pending_cards_processing_time() const;
diff --git a/src/hotspot/share/gc/g1/g1RootClosures.cpp b/src/hotspot/share/gc/g1/g1RootClosures.cpp
index f03681487cb..2d5150c27aa 100644
--- a/src/hotspot/share/gc/g1/g1RootClosures.cpp
+++ b/src/hotspot/share/gc/g1/g1RootClosures.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2015, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2015, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -72,7 +72,7 @@ G1EvacuationRootClosures* G1EvacuationRootClosures::create_root_closures(G1Colle
                                                                          G1ParScanThreadState* pss,
                                                                          bool process_only_dirty_klasses) {
   G1EvacuationRootClosures* res = nullptr;
-  if (g1h->collector_state()->in_concurrent_start_gc()) {
+  if (g1h->collector_state()->is_in_concurrent_start_gc()) {
     if (ClassUnloadingWithConcurrentMark) {
       res = new G1ConcurrentStartMarkClosures<false>(g1h, pss);
     } else {
diff --git a/src/hotspot/share/gc/g1/g1YoungCollector.cpp b/src/hotspot/share/gc/g1/g1YoungCollector.cpp
index 3fceb42b6d7..a3693456268 100644
--- a/src/hotspot/share/gc/g1/g1YoungCollector.cpp
+++ b/src/hotspot/share/gc/g1/g1YoungCollector.cpp
@@ -105,7 +105,7 @@ public:
     // Take snapshot of current pause type at start as it may be modified during gc.
     // The strings for all Concurrent Start pauses are the same, so the parameter
     // does not matter here.
-    _pause_type(_collector->collector_state()->young_gc_pause_type(false /* concurrent_operation_is_full_mark */)),
+    _pause_type(_collector->collector_state()->gc_pause_type(false /* concurrent_operation_is_full_mark */)),
     _pause_cause(cause),
     // Fake a "no cause" and manually add the correct string in update_young_gc_name()
     // to make the string look more natural.
@@ -160,9 +160,9 @@ class G1YoungGCVerifierMark : public StackObj {
 
   static G1HeapVerifier::G1VerifyType young_collection_verify_type() {
     G1CollectorState* state = G1CollectedHeap::heap()->collector_state();
-    if (state->in_concurrent_start_gc()) {
+    if (state->is_in_concurrent_start_gc()) {
       return G1HeapVerifier::G1VerifyConcurrentStart;
-    } else if (state->in_young_only_phase()) {
+    } else if (state->is_in_young_only_phase()) {
       return G1HeapVerifier::G1VerifyYoungNormal;
     } else {
       return G1HeapVerifier::G1VerifyMixed;
@@ -530,7 +530,7 @@ void G1YoungCollector::pre_evacuate_collection_set(G1EvacInfo* evacuation_info)
   // Needs log buffers flushed.
   calculate_collection_set(evacuation_info, policy()->max_pause_time_ms());
 
-  if (collector_state()->in_concurrent_start_gc()) {
+  if (collector_state()->is_in_concurrent_start_gc()) {
     Ticks start = Ticks::now();
     concurrent_mark()->pre_concurrent_start(_gc_cause);
     phase_times()->record_prepare_concurrent_task_time_ms((Ticks::now() - start).seconds() * 1000.0);
@@ -1037,7 +1037,7 @@ void G1YoungCollector::post_evacuate_cleanup_2(G1ParScanThreadStateSet* per_thre
 }
 
 void G1YoungCollector::enqueue_candidates_as_root_regions() {
-  assert(collector_state()->in_concurrent_start_gc(), "must be");
+  assert(collector_state()->is_in_concurrent_start_gc(), "must be");
 
   G1CollectionSetCandidates* candidates = collection_set()->candidates();
   candidates->iterate_regions([&] (G1HeapRegion* r) {
@@ -1077,7 +1077,7 @@ void G1YoungCollector::post_evacuate_collection_set(G1EvacInfo* evacuation_info,
   // Regions in the collection set candidates are roots for the marking (they are
   // not marked through considering they are very likely to be reclaimed soon.
   // They need to be enqueued explicitly compared to survivor regions.
-  if (collector_state()->in_concurrent_start_gc()) {
+  if (collector_state()->is_in_concurrent_start_gc()) {
     enqueue_candidates_as_root_regions();
   }
 
@@ -1180,7 +1180,7 @@ void G1YoungCollector::collect() {
 
     // Need to report the collection pause now since record_collection_pause_end()
     // modifies it to the next state.
-    jtm.report_pause_type(collector_state()->young_gc_pause_type(_concurrent_operation_is_full_mark));
+    jtm.report_pause_type(collector_state()->gc_pause_type(_concurrent_operation_is_full_mark));
 
     policy()->record_young_collection_end(_concurrent_operation_is_full_mark, evacuation_alloc_failed(), _allocation_word_size);
   }
diff --git a/src/hotspot/share/gc/g1/g1YoungGCAllocationFailureInjector.cpp b/src/hotspot/share/gc/g1/g1YoungGCAllocationFailureInjector.cpp
index 6ba72f6cde0..2291a755cd3 100644
--- a/src/hotspot/share/gc/g1/g1YoungGCAllocationFailureInjector.cpp
+++ b/src/hotspot/share/gc/g1/g1YoungGCAllocationFailureInjector.cpp
@@ -89,8 +89,8 @@ void G1YoungGCAllocationFailureInjector::arm_if_needed() {
 
     // Now check if evacuation failure injection should be enabled for the current GC.
     G1CollectorState* collector_state = g1h->collector_state();
-    const bool in_young_only_phase = collector_state->in_young_only_phase();
-    const bool in_concurrent_start_gc = collector_state->in_concurrent_start_gc();
+    const bool in_young_only_phase = collector_state->is_in_young_only_phase();
+    const bool in_concurrent_start_gc = collector_state->is_in_concurrent_start_gc();
     const bool in_concurrent_cycle = collector_state->is_in_concurrent_cycle();
 
     _inject_allocation_failure_for_current_gc &=
diff --git a/src/hotspot/share/gc/g1/g1YoungGCPostEvacuateTasks.cpp b/src/hotspot/share/gc/g1/g1YoungGCPostEvacuateTasks.cpp
index 769cc9a077c..3d49b8f025b 100644
--- a/src/hotspot/share/gc/g1/g1YoungGCPostEvacuateTasks.cpp
+++ b/src/hotspot/share/gc/g1/g1YoungGCPostEvacuateTasks.cpp
@@ -501,7 +501,7 @@ class G1PostEvacuateCollectionSetCleanupTask2::ProcessEvacuationFailedRegionsTas
       // Concurrent mark does not mark through regions that we retain (they are root
       // regions wrt to marking), so we must clear their mark data (tams, bitmap, ...)
       // set eagerly or during evacuation failure.
-      bool clear_mark_data = !g1h->collector_state()->in_concurrent_start_gc() ||
+      bool clear_mark_data = !g1h->collector_state()->is_in_concurrent_start_gc() ||
                              g1h->policy()->should_retain_evac_failed_region(r);
 
       if (clear_mark_data) {

From 174183759e0545daf379ead18d796aa61fe36d98 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Joel=20Sikstr=C3=B6m?= <jsikstro@openjdk.org>
Date: Mon, 23 Mar 2026 10:48:55 +0000
Subject: [PATCH 302/655] 8380281: Remove the client emulation mode

Reviewed-by: ayang, kvn
---
 .../share/compiler/compilerDefinitions.cpp    | 61 -------------------
 .../share/compiler/compilerDefinitions.hpp    |  4 --
 .../share/runtime/abstract_vm_version.cpp     | 18 +-----
 src/hotspot/share/runtime/arguments.cpp       |  5 +-
 test/hotspot/jtreg/TEST.ROOT                  |  1 -
 .../arraycopy/TestArrayCopyNoInitDeopt.java   |  6 +-
 .../TestDefaultMethodArrayCloneDeoptC2.java   |  2 +-
 .../c2/TestReduceAllocationAndHeapDump.java   |  2 +-
 .../stress/OverloadCompileQueueTest.java      |  4 +-
 .../TestAESIntrinsicsOnSupportedConfig.java   |  2 +-
 ...orphicVirtualCallAfterMorphismChanged.java |  2 +-
 .../intrinsics/IntrinsicAvailableTest.java    |  2 +-
 .../intrinsics/IntrinsicDisabledTest.java     |  3 +-
 .../bigInteger/MontgomeryMultiplyTest.java    |  6 +-
 .../intrinsics/bmi/verifycode/AndnTestI.java  |  2 +-
 .../intrinsics/bmi/verifycode/AndnTestL.java  |  2 +-
 .../intrinsics/bmi/verifycode/BlsiTestI.java  |  2 +-
 .../intrinsics/bmi/verifycode/BlsiTestL.java  |  2 +-
 .../bmi/verifycode/BlsmskTestI.java           |  2 +-
 .../bmi/verifycode/BlsmskTestL.java           |  2 +-
 .../intrinsics/bmi/verifycode/BlsrTestI.java  |  2 +-
 .../intrinsics/bmi/verifycode/BlsrTestL.java  |  2 +-
 .../bmi/verifycode/BmiIntrinsicBase.java      |  2 +-
 .../bmi/verifycode/BzhiTestI2L.java           |  2 +-
 .../intrinsics/bmi/verifycode/LZcntTestI.java |  2 +-
 .../intrinsics/bmi/verifycode/LZcntTestL.java |  2 +-
 .../intrinsics/bmi/verifycode/TZcntTestI.java |  2 +-
 .../intrinsics/bmi/verifycode/TZcntTestL.java |  2 +-
 .../klass/CastNullCheckDroppingsTest.java     |  6 +-
 .../mathexact/sanity/IntrinsicBase.java       |  2 +-
 .../TestCountedLoopSafepointBackedge.java     |  2 +-
 .../UseCountedLoopSafepointsTest.java         |  3 +-
 .../compiler/profiling/TestTypeProfiling.java |  6 +-
 .../rangechecks/TestExplicitRangeChecks.java  |  3 +-
 .../compiler/testlibrary/CompilerUtils.java   |  4 +-
 .../sha/predicate/IntrinsicPredicates.java    |  2 +-
 .../compiler/tiered/NonTieredLevelsTest.java  |  4 +-
 .../types/correctness/CorrectnessTest.java    |  6 +-
 .../compiler/types/correctness/OffTest.java   |  2 +-
 .../uncommontrap/TestUnstableIfTrap.java      |  2 +-
 .../unsafe/UnsafeGetConstantField.java        |  6 +-
 .../unsafe/UnsafeGetStableArrayElement.java   |  6 +-
 .../whitebox/DeoptimizeRelocatedNMethod.java  |  1 -
 .../whitebox/IsMethodCompilableTest.java      |  5 +-
 .../TestGCBasherWithAllocateHeapAt.java       |  2 +-
 .../stress/gcbasher/TestGCBasherWithG1.java   |  2 +-
 .../gcbasher/TestGCBasherWithParallel.java    |  2 +-
 .../gcbasher/TestGCBasherWithSerial.java      |  2 +-
 .../gcbasher/TestGCBasherWithShenandoah.java  | 20 +++---
 .../gc/stress/gcbasher/TestGCBasherWithZ.java |  4 +-
 .../ReservedStackTestCompiler.java            |  2 +-
 .../AbstractMethodErrorTest.java              |  2 +-
 .../IncompatibleClassChangeErrorTest.java     |  2 +-
 .../compiler/CompilerDirectivesDCMDTest.java  |  2 +-
 .../NMethodRelocationTest.java                |  1 -
 .../ctw/src/sun/hotspot/tools/ctw/Utils.java  |  6 +-
 .../event/compiler/TestCompilerInlining.java  |  4 +-
 .../runtime/TestThrowableInstrumentation.java |  2 +-
 test/jdk/jdk/jfr/jvm/TestJFRIntrinsic.java    |  4 +-
 test/jtreg-ext/requires/VMProps.java          | 13 ----
 ...stMutuallyExclusivePlatformPredicates.java |  2 +-
 test/lib/jdk/test/lib/Platform.java           |  4 --
 62 files changed, 87 insertions(+), 195 deletions(-)

diff --git a/src/hotspot/share/compiler/compilerDefinitions.cpp b/src/hotspot/share/compiler/compilerDefinitions.cpp
index 5b207334599..0e4e211453b 100644
--- a/src/hotspot/share/compiler/compilerDefinitions.cpp
+++ b/src/hotspot/share/compiler/compilerDefinitions.cpp
@@ -185,46 +185,6 @@ intx CompilerConfig::scaled_freq_log(intx freq_log, double scale) {
   }
 }
 
-void CompilerConfig::set_client_emulation_mode_flags() {
-  assert(has_c1(), "Must have C1 compiler present");
-  CompilationModeFlag::set_quick_only();
-
-  FLAG_SET_ERGO(ProfileInterpreter, false);
-#if INCLUDE_JVMCI
-  FLAG_SET_ERGO(EnableJVMCI, false);
-  FLAG_SET_ERGO(UseJVMCICompiler, false);
-#endif
-  if (FLAG_IS_DEFAULT(InitialCodeCacheSize)) {
-    FLAG_SET_ERGO(InitialCodeCacheSize, 160*K);
-  }
-  if (FLAG_IS_DEFAULT(ReservedCodeCacheSize)) {
-    FLAG_SET_ERGO(ReservedCodeCacheSize, 32*M);
-  }
-  if (FLAG_IS_DEFAULT(NonProfiledCodeHeapSize)) {
-    FLAG_SET_ERGO(NonProfiledCodeHeapSize, 27*M);
-  }
-  if (FLAG_IS_DEFAULT(ProfiledCodeHeapSize)) {
-    FLAG_SET_ERGO(ProfiledCodeHeapSize, 0);
-  }
-  if (FLAG_IS_DEFAULT(NonNMethodCodeHeapSize)) {
-    FLAG_SET_ERGO(NonNMethodCodeHeapSize, 5*M);
-  }
-  if (FLAG_IS_DEFAULT(CodeCacheExpansionSize)) {
-    FLAG_SET_ERGO(CodeCacheExpansionSize, 32*K);
-  }
-  if (FLAG_IS_DEFAULT(CICompilerCount)) {
-    FLAG_SET_ERGO(CICompilerCount, 1);
-  }
-}
-
-bool CompilerConfig::is_compilation_mode_selected() {
-  return !FLAG_IS_DEFAULT(TieredCompilation) ||
-         !FLAG_IS_DEFAULT(TieredStopAtLevel) ||
-         !FLAG_IS_DEFAULT(CompilationMode)
-         JVMCI_ONLY(|| !FLAG_IS_DEFAULT(EnableJVMCI)
-                    || !FLAG_IS_DEFAULT(UseJVMCICompiler));
-}
-
 static bool check_legacy_flags() {
   JVMFlag* compile_threshold_flag = JVMFlag::flag_from_enum(FLAG_MEMBER_ENUM(CompileThreshold));
   if (JVMFlagAccess::check_constraint(compile_threshold_flag, JVMFlagLimit::get_constraint(compile_threshold_flag)->constraint_func(), false) != JVMFlag::SUCCESS) {
@@ -540,29 +500,11 @@ bool CompilerConfig::check_args_consistency(bool status) {
   return status;
 }
 
-bool CompilerConfig::should_set_client_emulation_mode_flags() {
-#if !COMPILER1_OR_COMPILER2
-  return false;
-#endif
-
-  return has_c1() &&
-         is_compilation_mode_selected() &&
-         !has_c2() &&
-         !is_jvmci_compiler();
-}
-
 void CompilerConfig::ergo_initialize() {
 #if !COMPILER1_OR_COMPILER2
   return;
 #endif
 
-  // This property is also checked when selecting the heap size. Since client
-  // emulation mode influences Java heap memory usage, part of the logic must
-  // occur before choosing the heap size.
-  if (should_set_client_emulation_mode_flags()) {
-    set_client_emulation_mode_flags();
-  }
-
   set_legacy_emulation_flags();
   set_compilation_policy_flags();
 
@@ -581,9 +523,6 @@ void CompilerConfig::ergo_initialize() {
   }
 
   if (ProfileInterpreter && CompilerConfig::is_c1_simple_only()) {
-    if (!FLAG_IS_DEFAULT(ProfileInterpreter)) {
-        warning("ProfileInterpreter disabled due to client emulation mode");
-    }
     FLAG_SET_CMDLINE(ProfileInterpreter, false);
   }
 
diff --git a/src/hotspot/share/compiler/compilerDefinitions.hpp b/src/hotspot/share/compiler/compilerDefinitions.hpp
index a9b052ff782..e8ba977f705 100644
--- a/src/hotspot/share/compiler/compilerDefinitions.hpp
+++ b/src/hotspot/share/compiler/compilerDefinitions.hpp
@@ -151,14 +151,10 @@ public:
 
   inline static CompilerType compiler_type();
 
-  static bool should_set_client_emulation_mode_flags();
-
 private:
-  static bool is_compilation_mode_selected();
   static void set_compilation_policy_flags();
   static void set_jvmci_specific_flags();
   static void set_legacy_emulation_flags();
-  static void set_client_emulation_mode_flags();
 };
 
 #endif // SHARE_COMPILER_COMPILERDEFINITIONS_HPP
diff --git a/src/hotspot/share/runtime/abstract_vm_version.cpp b/src/hotspot/share/runtime/abstract_vm_version.cpp
index 4051ba3f9d6..37c5815f60e 100644
--- a/src/hotspot/share/runtime/abstract_vm_version.cpp
+++ b/src/hotspot/share/runtime/abstract_vm_version.cpp
@@ -152,28 +152,14 @@ const char* Abstract_VM_Version::vm_info_string() {
       }
     case Arguments::_mixed:
       if (is_vm_statically_linked()) {
-        if (CompilationModeFlag::quick_only()) {
-          return CDSConfig::is_using_archive() ? "mixed mode, emulated-client, static, sharing" : "mixed mode, emulated-client, static";
-        } else {
-          return CDSConfig::is_using_archive() ? "mixed mode, static, sharing" : "mixed mode, static";
-         }
+        return CDSConfig::is_using_archive() ? "mixed mode, static, sharing" : "mixed mode, static";
       } else {
-        if (CompilationModeFlag::quick_only()) {
-          return CDSConfig::is_using_archive() ? "mixed mode, emulated-client, sharing" : "mixed mode, emulated-client";
-        } else {
-          return CDSConfig::is_using_archive() ? "mixed mode, sharing" : "mixed mode";
-        }
+        return CDSConfig::is_using_archive() ? "mixed mode, sharing" : "mixed mode";
       }
     case Arguments::_comp:
       if (is_vm_statically_linked()) {
-        if (CompilationModeFlag::quick_only()) {
-          return CDSConfig::is_using_archive() ? "compiled mode, emulated-client, static, sharing" : "compiled mode, emulated-client, static";
-        }
         return CDSConfig::is_using_archive() ? "compiled mode, static, sharing" : "compiled mode, static";
       } else {
-        if (CompilationModeFlag::quick_only()) {
-          return CDSConfig::is_using_archive() ? "compiled mode, emulated-client, sharing" : "compiled mode, emulated-client";
-        }
         return CDSConfig::is_using_archive() ? "compiled mode, sharing" : "compiled mode";
       }
   }
diff --git a/src/hotspot/share/runtime/arguments.cpp b/src/hotspot/share/runtime/arguments.cpp
index 778e9c1fc6d..b853349242c 100644
--- a/src/hotspot/share/runtime/arguments.cpp
+++ b/src/hotspot/share/runtime/arguments.cpp
@@ -1513,10 +1513,7 @@ void Arguments::set_heap_size() {
                        !FLAG_IS_DEFAULT(MinRAMPercentage) ||
                        !FLAG_IS_DEFAULT(InitialRAMPercentage);
 
-  // Limit the available memory if client emulation mode is enabled.
-  const size_t avail_mem = CompilerConfig::should_set_client_emulation_mode_flags()
-      ? 1ULL*G
-      : os::physical_memory();
+  const size_t avail_mem = os::physical_memory();
 
   // If the maximum heap size has not been set with -Xmx, then set it as
   // fraction of the size of physical memory, respecting the maximum and
diff --git a/test/hotspot/jtreg/TEST.ROOT b/test/hotspot/jtreg/TEST.ROOT
index 2a3d3eebbbd..892529b966f 100644
--- a/test/hotspot/jtreg/TEST.ROOT
+++ b/test/hotspot/jtreg/TEST.ROOT
@@ -69,7 +69,6 @@ requires.properties= \
     vm.gc.Z \
     vm.jvmci \
     vm.jvmci.enabled \
-    vm.emulatedClient \
     vm.cpu.features \
     vm.pageSize \
     vm.debug \
diff --git a/test/hotspot/jtreg/compiler/arraycopy/TestArrayCopyNoInitDeopt.java b/test/hotspot/jtreg/compiler/arraycopy/TestArrayCopyNoInitDeopt.java
index 839ff6cf36e..9e920a08b0f 100644
--- a/test/hotspot/jtreg/compiler/arraycopy/TestArrayCopyNoInitDeopt.java
+++ b/test/hotspot/jtreg/compiler/arraycopy/TestArrayCopyNoInitDeopt.java
@@ -25,7 +25,7 @@
  * @test
  * @bug 8072016
  * @summary Infinite deoptimization/recompilation cycles in case of arraycopy with tightly coupled allocation
- * @requires vm.flavor == "server" & !vm.emulatedClient & !vm.graal.enabled
+ * @requires vm.flavor == "server" & !vm.graal.enabled
  * @library /test/lib /
  * @modules java.base/jdk.internal.misc
  *          java.management
@@ -87,8 +87,8 @@ public class TestArrayCopyNoInitDeopt {
     }
 
     static public void main(String[] args) throws Exception {
-        if (!Platform.isServer() || Platform.isEmulatedClient()) {
-            throw new Error("TESTBUG: Not server mode");
+        if (!Platform.isServer()) {
+            throw new Error("TESTBUG: Not server VM");
         }
         // Only execute if C2 is available
         if (TIERED_STOP_AT_LEVEL == CompilerWhiteBoxTest.COMP_LEVEL_FULL_OPTIMIZATION) {
diff --git a/test/hotspot/jtreg/compiler/arraycopy/TestDefaultMethodArrayCloneDeoptC2.java b/test/hotspot/jtreg/compiler/arraycopy/TestDefaultMethodArrayCloneDeoptC2.java
index 7f5a891ce9e..c7554dcffdb 100644
--- a/test/hotspot/jtreg/compiler/arraycopy/TestDefaultMethodArrayCloneDeoptC2.java
+++ b/test/hotspot/jtreg/compiler/arraycopy/TestDefaultMethodArrayCloneDeoptC2.java
@@ -27,7 +27,7 @@
  * @summary C2: Access to [].clone from interfaces fails.
  * @library /test/lib /
  *
- * @requires vm.flavor == "server" & !vm.emulatedClient
+ * @requires vm.flavor == "server"
  * @build jdk.test.whitebox.WhiteBox
  * @run driver jdk.test.lib.helpers.ClassFileInstaller jdk.test.whitebox.WhiteBox
  * @run main/othervm -Xcomp -Xbatch -Xbootclasspath/a:.  -XX:-TieredCompilation  -XX:+UnlockDiagnosticVMOptions -XX:+WhiteBoxAPI
diff --git a/test/hotspot/jtreg/compiler/c2/TestReduceAllocationAndHeapDump.java b/test/hotspot/jtreg/compiler/c2/TestReduceAllocationAndHeapDump.java
index 9319da0e0b9..f65643f8d87 100644
--- a/test/hotspot/jtreg/compiler/c2/TestReduceAllocationAndHeapDump.java
+++ b/test/hotspot/jtreg/compiler/c2/TestReduceAllocationAndHeapDump.java
@@ -26,7 +26,7 @@
  * @bug 8319784
  * @summary Check that the JVM is able to dump the heap even when there are ReduceAllocationMerge in the scope.
  * @library /test/lib /
- * @requires vm.flavor == "server" & !vm.emulatedClient
+ * @requires vm.flavor == "server"
  * @run main/othervm compiler.c2.TestReduceAllocationAndHeapDump
  */
 
diff --git a/test/hotspot/jtreg/compiler/codecache/stress/OverloadCompileQueueTest.java b/test/hotspot/jtreg/compiler/codecache/stress/OverloadCompileQueueTest.java
index 548a746c3af..7122a81c1e7 100644
--- a/test/hotspot/jtreg/compiler/codecache/stress/OverloadCompileQueueTest.java
+++ b/test/hotspot/jtreg/compiler/codecache/stress/OverloadCompileQueueTest.java
@@ -112,9 +112,9 @@ public class OverloadCompileQueueTest implements Runnable {
             AVAILABLE_LEVELS = IntStream
                     .rangeClosed(LEVEL_SIMPLE, TIERED_STOP_AT_LEVEL)
                     .toArray();
-        } else if (Platform.isServer() && !Platform.isEmulatedClient()) {
+        } else if (Platform.isServer()) {
             AVAILABLE_LEVELS = new int[] { LEVEL_FULL_OPTIMIZATION };
-        } else if (Platform.isClient() || Platform.isMinimal() || Platform.isEmulatedClient()) {
+        } else if (Platform.isClient() || Platform.isMinimal()) {
             AVAILABLE_LEVELS = new int[] { LEVEL_SIMPLE };
         } else {
             throw new Error("TESTBUG: unknown VM: " + Platform.vmName);
diff --git a/test/hotspot/jtreg/compiler/cpuflags/TestAESIntrinsicsOnSupportedConfig.java b/test/hotspot/jtreg/compiler/cpuflags/TestAESIntrinsicsOnSupportedConfig.java
index 59c8b2efa11..421307e85ca 100644
--- a/test/hotspot/jtreg/compiler/cpuflags/TestAESIntrinsicsOnSupportedConfig.java
+++ b/test/hotspot/jtreg/compiler/cpuflags/TestAESIntrinsicsOnSupportedConfig.java
@@ -76,7 +76,7 @@ public class TestAESIntrinsicsOnSupportedConfig extends AESIntrinsicsBase {
                 prepareArguments(prepareBooleanFlag(AESIntrinsicsBase
                         .USE_AES, true)));
         final String errorMessage = "Case testUseAES failed";
-        if (Platform.isServer() && !Platform.isEmulatedClient() && isTieredLevelGreaterThan(3)) {
+        if (Platform.isServer() && isTieredLevelGreaterThan(3)) {
             verifyOutput(new String[]{AESIntrinsicsBase.CIPHER_INTRINSIC,
                     AESIntrinsicsBase.AES_INTRINSIC}, null, errorMessage,
                     outputAnalyzer);
diff --git a/test/hotspot/jtreg/compiler/inlining/InlineBimorphicVirtualCallAfterMorphismChanged.java b/test/hotspot/jtreg/compiler/inlining/InlineBimorphicVirtualCallAfterMorphismChanged.java
index 6f1dadd6b80..bebb3802eb9 100644
--- a/test/hotspot/jtreg/compiler/inlining/InlineBimorphicVirtualCallAfterMorphismChanged.java
+++ b/test/hotspot/jtreg/compiler/inlining/InlineBimorphicVirtualCallAfterMorphismChanged.java
@@ -29,7 +29,7 @@
  * @modules java.base/jdk.internal.misc
  * @library /test/lib
  * @requires vm.flagless
- * @requires vm.flavor == "server" & !vm.emulatedClient
+ * @requires vm.flavor == "server"
  *
  * @run driver compiler.inlining.InlineBimorphicVirtualCallAfterMorphismChanged
  */
diff --git a/test/hotspot/jtreg/compiler/intrinsics/IntrinsicAvailableTest.java b/test/hotspot/jtreg/compiler/intrinsics/IntrinsicAvailableTest.java
index abf0aa7b885..310fce78f9b 100644
--- a/test/hotspot/jtreg/compiler/intrinsics/IntrinsicAvailableTest.java
+++ b/test/hotspot/jtreg/compiler/intrinsics/IntrinsicAvailableTest.java
@@ -142,7 +142,7 @@ public class IntrinsicAvailableTest extends CompilerWhiteBoxTest {
 
     public void test() throws Exception {
         Executable intrinsicMethod = testCase.getExecutable();
-        if (Platform.isServer() && !Platform.isEmulatedClient() && (TIERED_STOP_AT_LEVEL == COMP_LEVEL_FULL_OPTIMIZATION)) {
+        if (Platform.isServer() && (TIERED_STOP_AT_LEVEL == COMP_LEVEL_FULL_OPTIMIZATION)) {
             if (TIERED_COMPILATION) {
                 checkIntrinsicForCompilationLevel(intrinsicMethod, COMP_LEVEL_SIMPLE);
             }
diff --git a/test/hotspot/jtreg/compiler/intrinsics/IntrinsicDisabledTest.java b/test/hotspot/jtreg/compiler/intrinsics/IntrinsicDisabledTest.java
index a98bef68c9a..7eb1c855f4b 100644
--- a/test/hotspot/jtreg/compiler/intrinsics/IntrinsicDisabledTest.java
+++ b/test/hotspot/jtreg/compiler/intrinsics/IntrinsicDisabledTest.java
@@ -217,8 +217,7 @@ public class IntrinsicDisabledTest {
     }
 
     public static void main(String args[]) {
-        if (Platform.isServer() && !Platform.isEmulatedClient() &&
-                                   (TIERED_STOP_AT_LEVEL == CompilerWhiteBoxTest.COMP_LEVEL_FULL_OPTIMIZATION)) {
+        if (Platform.isServer() && (TIERED_STOP_AT_LEVEL == CompilerWhiteBoxTest.COMP_LEVEL_FULL_OPTIMIZATION)) {
             if (TIERED_COMPILATION) {
                 test(CompilerWhiteBoxTest.COMP_LEVEL_SIMPLE);
             }
diff --git a/test/hotspot/jtreg/compiler/intrinsics/bigInteger/MontgomeryMultiplyTest.java b/test/hotspot/jtreg/compiler/intrinsics/bigInteger/MontgomeryMultiplyTest.java
index e145a0088c0..0ca419f7dcd 100644
--- a/test/hotspot/jtreg/compiler/intrinsics/bigInteger/MontgomeryMultiplyTest.java
+++ b/test/hotspot/jtreg/compiler/intrinsics/bigInteger/MontgomeryMultiplyTest.java
@@ -26,7 +26,7 @@
  * @test
  * @bug 8130150 8131779 8139907
  * @summary Verify that the Montgomery multiply and square intrinsic works and correctly checks their arguments.
- * @requires vm.flavor == "server" & !vm.emulatedClient
+ * @requires vm.flavor == "server"
  * @modules java.base/jdk.internal.misc:open
  * @modules java.base/java.math:open
  * @library /test/lib /
@@ -313,8 +313,8 @@ public class MontgomeryMultiplyTest {
     }
 
     public static void main(String args[]) {
-        if (!Platform.isServer() || Platform.isEmulatedClient()) {
-            throw new Error("TESTBUG: Not server mode");
+        if (!Platform.isServer()) {
+            throw new Error("TESTBUG: Not server VM");
         }
         if (wb.isIntrinsicAvailable(getExecutable(true), CompilerWhiteBoxTest.COMP_LEVEL_FULL_OPTIMIZATION) &&
                 wb.isIntrinsicAvailable(getExecutable(false), CompilerWhiteBoxTest.COMP_LEVEL_FULL_OPTIMIZATION)) {
diff --git a/test/hotspot/jtreg/compiler/intrinsics/bmi/verifycode/AndnTestI.java b/test/hotspot/jtreg/compiler/intrinsics/bmi/verifycode/AndnTestI.java
index 4145b0f5641..30ce3b36af6 100644
--- a/test/hotspot/jtreg/compiler/intrinsics/bmi/verifycode/AndnTestI.java
+++ b/test/hotspot/jtreg/compiler/intrinsics/bmi/verifycode/AndnTestI.java
@@ -24,7 +24,7 @@
 /*
  * @test
  * @bug 8031321
- * @requires vm.flavor == "server" & !vm.emulatedClient & !vm.graal.enabled
+ * @requires vm.flavor == "server" & !vm.graal.enabled
  * @library /test/lib /
  * @modules java.base/jdk.internal.misc
  *          java.management
diff --git a/test/hotspot/jtreg/compiler/intrinsics/bmi/verifycode/AndnTestL.java b/test/hotspot/jtreg/compiler/intrinsics/bmi/verifycode/AndnTestL.java
index c17e5345d21..1a3e7e1314d 100644
--- a/test/hotspot/jtreg/compiler/intrinsics/bmi/verifycode/AndnTestL.java
+++ b/test/hotspot/jtreg/compiler/intrinsics/bmi/verifycode/AndnTestL.java
@@ -24,7 +24,7 @@
 /*
  * @test
  * @bug 8031321
- * @requires vm.flavor == "server" & !vm.emulatedClient & !vm.graal.enabled
+ * @requires vm.flavor == "server" & !vm.graal.enabled
  * @library /test/lib /
  * @modules java.base/jdk.internal.misc
  *          java.management
diff --git a/test/hotspot/jtreg/compiler/intrinsics/bmi/verifycode/BlsiTestI.java b/test/hotspot/jtreg/compiler/intrinsics/bmi/verifycode/BlsiTestI.java
index 881ed37906e..71d9e52a539 100644
--- a/test/hotspot/jtreg/compiler/intrinsics/bmi/verifycode/BlsiTestI.java
+++ b/test/hotspot/jtreg/compiler/intrinsics/bmi/verifycode/BlsiTestI.java
@@ -24,7 +24,7 @@
 /*
  * @test
  * @bug 8031321
- * @requires vm.flavor == "server" & !vm.emulatedClient & !vm.graal.enabled
+ * @requires vm.flavor == "server" & !vm.graal.enabled
  * @library /test/lib /
  * @modules java.base/jdk.internal.misc
  *          java.management
diff --git a/test/hotspot/jtreg/compiler/intrinsics/bmi/verifycode/BlsiTestL.java b/test/hotspot/jtreg/compiler/intrinsics/bmi/verifycode/BlsiTestL.java
index 1ea8125b1cd..425f70f1052 100644
--- a/test/hotspot/jtreg/compiler/intrinsics/bmi/verifycode/BlsiTestL.java
+++ b/test/hotspot/jtreg/compiler/intrinsics/bmi/verifycode/BlsiTestL.java
@@ -24,7 +24,7 @@
 /*
  * @test
  * @bug 8031321
- * @requires vm.flavor == "server" & !vm.emulatedClient & !vm.graal.enabled
+ * @requires vm.flavor == "server" & !vm.graal.enabled
  * @library /test/lib /
  * @modules java.base/jdk.internal.misc
  *          java.management
diff --git a/test/hotspot/jtreg/compiler/intrinsics/bmi/verifycode/BlsmskTestI.java b/test/hotspot/jtreg/compiler/intrinsics/bmi/verifycode/BlsmskTestI.java
index 38753762f39..3632d9617b8 100644
--- a/test/hotspot/jtreg/compiler/intrinsics/bmi/verifycode/BlsmskTestI.java
+++ b/test/hotspot/jtreg/compiler/intrinsics/bmi/verifycode/BlsmskTestI.java
@@ -24,7 +24,7 @@
 /*
  * @test
  * @bug 8031321
- * @requires vm.flavor == "server" & !vm.emulatedClient & !vm.graal.enabled
+ * @requires vm.flavor == "server" & !vm.graal.enabled
  * @library /test/lib /
  * @modules java.base/jdk.internal.misc
  *          java.management
diff --git a/test/hotspot/jtreg/compiler/intrinsics/bmi/verifycode/BlsmskTestL.java b/test/hotspot/jtreg/compiler/intrinsics/bmi/verifycode/BlsmskTestL.java
index 9a279083059..8f6958d212f 100644
--- a/test/hotspot/jtreg/compiler/intrinsics/bmi/verifycode/BlsmskTestL.java
+++ b/test/hotspot/jtreg/compiler/intrinsics/bmi/verifycode/BlsmskTestL.java
@@ -24,7 +24,7 @@
 /*
  * @test
  * @bug 8031321
- * @requires vm.flavor == "server" & !vm.emulatedClient & !vm.graal.enabled
+ * @requires vm.flavor == "server" & !vm.graal.enabled
  * @library /test/lib /
  * @modules java.base/jdk.internal.misc
  *          java.management
diff --git a/test/hotspot/jtreg/compiler/intrinsics/bmi/verifycode/BlsrTestI.java b/test/hotspot/jtreg/compiler/intrinsics/bmi/verifycode/BlsrTestI.java
index 4ea2b3ab841..bd8c26724a1 100644
--- a/test/hotspot/jtreg/compiler/intrinsics/bmi/verifycode/BlsrTestI.java
+++ b/test/hotspot/jtreg/compiler/intrinsics/bmi/verifycode/BlsrTestI.java
@@ -24,7 +24,7 @@
 /*
  * @test
  * @bug 8031321
- * @requires vm.flavor == "server" & !vm.emulatedClient & !vm.graal.enabled
+ * @requires vm.flavor == "server" & !vm.graal.enabled
  * @library /test/lib /
  * @modules java.base/jdk.internal.misc
  *          java.management
diff --git a/test/hotspot/jtreg/compiler/intrinsics/bmi/verifycode/BlsrTestL.java b/test/hotspot/jtreg/compiler/intrinsics/bmi/verifycode/BlsrTestL.java
index 421e24d07ab..68f82a99bd3 100644
--- a/test/hotspot/jtreg/compiler/intrinsics/bmi/verifycode/BlsrTestL.java
+++ b/test/hotspot/jtreg/compiler/intrinsics/bmi/verifycode/BlsrTestL.java
@@ -24,7 +24,7 @@
 /*
  * @test
  * @bug 8031321
- * @requires vm.flavor == "server" & !vm.emulatedClient & !vm.graal.enabled
+ * @requires vm.flavor == "server" & !vm.graal.enabled
  * @library /test/lib /
  * @modules java.base/jdk.internal.misc
  *          java.management
diff --git a/test/hotspot/jtreg/compiler/intrinsics/bmi/verifycode/BmiIntrinsicBase.java b/test/hotspot/jtreg/compiler/intrinsics/bmi/verifycode/BmiIntrinsicBase.java
index 0e8c8fe9514..8c6120388a1 100644
--- a/test/hotspot/jtreg/compiler/intrinsics/bmi/verifycode/BmiIntrinsicBase.java
+++ b/test/hotspot/jtreg/compiler/intrinsics/bmi/verifycode/BmiIntrinsicBase.java
@@ -83,7 +83,7 @@ public class BmiIntrinsicBase extends CompilerWhiteBoxTest {
 
         System.out.println(testCase.name());
 
-        if (TIERED_COMPILATION && TIERED_STOP_AT_LEVEL != CompilerWhiteBoxTest.COMP_LEVEL_MAX || Platform.isEmulatedClient()) {
+        if (TIERED_COMPILATION && TIERED_STOP_AT_LEVEL != CompilerWhiteBoxTest.COMP_LEVEL_MAX) {
             System.out.println("TieredStopAtLevel value (" + TIERED_STOP_AT_LEVEL + ") is too low, test SKIPPED");
             return;
         }
diff --git a/test/hotspot/jtreg/compiler/intrinsics/bmi/verifycode/BzhiTestI2L.java b/test/hotspot/jtreg/compiler/intrinsics/bmi/verifycode/BzhiTestI2L.java
index 4cf94a0eb8b..872fefd883c 100644
--- a/test/hotspot/jtreg/compiler/intrinsics/bmi/verifycode/BzhiTestI2L.java
+++ b/test/hotspot/jtreg/compiler/intrinsics/bmi/verifycode/BzhiTestI2L.java
@@ -23,7 +23,7 @@
 
 /*
  * @test
- * @requires vm.simpleArch == "x64" & vm.flavor == "server" & !vm.emulatedClient & !vm.graal.enabled
+ * @requires vm.simpleArch == "x64" & vm.flavor == "server" & !vm.graal.enabled
  * @library /test/lib /
  * @modules java.base/jdk.internal.misc
  *          java.management
diff --git a/test/hotspot/jtreg/compiler/intrinsics/bmi/verifycode/LZcntTestI.java b/test/hotspot/jtreg/compiler/intrinsics/bmi/verifycode/LZcntTestI.java
index c905fca34a2..34f1eb4f3a3 100644
--- a/test/hotspot/jtreg/compiler/intrinsics/bmi/verifycode/LZcntTestI.java
+++ b/test/hotspot/jtreg/compiler/intrinsics/bmi/verifycode/LZcntTestI.java
@@ -24,7 +24,7 @@
 /*
  * @test
  * @bug 8031321
- * @requires vm.flavor == "server" & !vm.emulatedClient & !vm.graal.enabled
+ * @requires vm.flavor == "server" & !vm.graal.enabled
  * @library /test/lib /
  * @modules java.base/jdk.internal.misc
  *          java.management
diff --git a/test/hotspot/jtreg/compiler/intrinsics/bmi/verifycode/LZcntTestL.java b/test/hotspot/jtreg/compiler/intrinsics/bmi/verifycode/LZcntTestL.java
index cf49937936f..30cadaf200e 100644
--- a/test/hotspot/jtreg/compiler/intrinsics/bmi/verifycode/LZcntTestL.java
+++ b/test/hotspot/jtreg/compiler/intrinsics/bmi/verifycode/LZcntTestL.java
@@ -24,7 +24,7 @@
 /*
  * @test
  * @bug 8031321
- * @requires vm.flavor == "server" & !vm.emulatedClient & !vm.graal.enabled
+ * @requires vm.flavor == "server" & !vm.graal.enabled
  * @library /test/lib /
  * @modules java.base/jdk.internal.misc
  *          java.management
diff --git a/test/hotspot/jtreg/compiler/intrinsics/bmi/verifycode/TZcntTestI.java b/test/hotspot/jtreg/compiler/intrinsics/bmi/verifycode/TZcntTestI.java
index 8a8ce4508fa..bc6c1276450 100644
--- a/test/hotspot/jtreg/compiler/intrinsics/bmi/verifycode/TZcntTestI.java
+++ b/test/hotspot/jtreg/compiler/intrinsics/bmi/verifycode/TZcntTestI.java
@@ -24,7 +24,7 @@
 /*
  * @test
  * @bug 8031321
- * @requires vm.flavor == "server" & !vm.emulatedClient & !vm.graal.enabled
+ * @requires vm.flavor == "server" & !vm.graal.enabled
  * @library /test/lib /
  * @modules java.base/jdk.internal.misc
  *          java.management
diff --git a/test/hotspot/jtreg/compiler/intrinsics/bmi/verifycode/TZcntTestL.java b/test/hotspot/jtreg/compiler/intrinsics/bmi/verifycode/TZcntTestL.java
index 926f071074e..b5db7b861c3 100644
--- a/test/hotspot/jtreg/compiler/intrinsics/bmi/verifycode/TZcntTestL.java
+++ b/test/hotspot/jtreg/compiler/intrinsics/bmi/verifycode/TZcntTestL.java
@@ -24,7 +24,7 @@
 /*
  * @test
  * @bug 8031321
- * @requires vm.flavor == "server" & !vm.emulatedClient & !vm.graal.enabled
+ * @requires vm.flavor == "server" & !vm.graal.enabled
  * @library /test/lib /
  * @modules java.base/jdk.internal.misc
  *          java.management
diff --git a/test/hotspot/jtreg/compiler/intrinsics/klass/CastNullCheckDroppingsTest.java b/test/hotspot/jtreg/compiler/intrinsics/klass/CastNullCheckDroppingsTest.java
index 1828e0ba837..31449eefb33 100644
--- a/test/hotspot/jtreg/compiler/intrinsics/klass/CastNullCheckDroppingsTest.java
+++ b/test/hotspot/jtreg/compiler/intrinsics/klass/CastNullCheckDroppingsTest.java
@@ -26,7 +26,7 @@
  * @bug 8054492
  * @summary Casting can result in redundant null checks in generated code
  * @requires vm.hasJFR
- * @requires vm.flavor == "server" & !vm.emulatedClient & !vm.graal.enabled
+ * @requires vm.flavor == "server" & !vm.graal.enabled
  * @library /test/lib
  * @modules java.base/jdk.internal.misc
  *          java.management
@@ -93,8 +93,8 @@ public class CastNullCheckDroppingsTest {
     int[]   asink;
 
     public static void main(String[] args) throws Exception {
-        if (!Platform.isServer() || Platform.isEmulatedClient()) {
-            throw new Error("TESTBUG: Not server mode");
+        if (!Platform.isServer()) {
+            throw new Error("TESTBUG: Not server VM");
         }
         // Make sure background compilation is disabled
         if (WHITE_BOX.getBooleanVMFlag("BackgroundCompilation")) {
diff --git a/test/hotspot/jtreg/compiler/intrinsics/mathexact/sanity/IntrinsicBase.java b/test/hotspot/jtreg/compiler/intrinsics/mathexact/sanity/IntrinsicBase.java
index f9b2e156f0c..10ae924c794 100644
--- a/test/hotspot/jtreg/compiler/intrinsics/mathexact/sanity/IntrinsicBase.java
+++ b/test/hotspot/jtreg/compiler/intrinsics/mathexact/sanity/IntrinsicBase.java
@@ -50,7 +50,7 @@ public abstract class IntrinsicBase extends CompilerWhiteBoxTest {
 
         int expectedIntrinsicCount = 0;
 
-        if (Platform.isServer() && !Platform.isEmulatedClient()) {
+        if (Platform.isServer()) {
             if (TIERED_COMPILATION) {
                 int max_level = TIERED_STOP_AT_LEVEL;
                 expectedIntrinsicCount = (max_level == COMP_LEVEL_MAX) ? 1 : 0;
diff --git a/test/hotspot/jtreg/compiler/loopopts/TestCountedLoopSafepointBackedge.java b/test/hotspot/jtreg/compiler/loopopts/TestCountedLoopSafepointBackedge.java
index e277f15035a..31c32f2cd2a 100644
--- a/test/hotspot/jtreg/compiler/loopopts/TestCountedLoopSafepointBackedge.java
+++ b/test/hotspot/jtreg/compiler/loopopts/TestCountedLoopSafepointBackedge.java
@@ -24,7 +24,7 @@
 /**
  * @test
  * @bug 8161147
- * @requires vm.flavor == "server" & !vm.emulatedClient
+ * @requires vm.flavor == "server"
  * @summary Safepoint on backedge breaks UseCountedLoopSafepoints
  * @run main/othervm -XX:-BackgroundCompilation -XX:-UseOnStackReplacement -XX:+UseCountedLoopSafepoints TestCountedLoopSafepointBackedge
  *
diff --git a/test/hotspot/jtreg/compiler/loopopts/UseCountedLoopSafepointsTest.java b/test/hotspot/jtreg/compiler/loopopts/UseCountedLoopSafepointsTest.java
index 2a9cedfc87e..378c8e6da75 100644
--- a/test/hotspot/jtreg/compiler/loopopts/UseCountedLoopSafepointsTest.java
+++ b/test/hotspot/jtreg/compiler/loopopts/UseCountedLoopSafepointsTest.java
@@ -28,7 +28,7 @@
  * @summary Test that C2 flag UseCountedLoopSafepoints ensures a safepoint is kept in a CountedLoop
  * @library /test/lib /
  * @requires vm.compMode != "Xint" & vm.flavor == "server" & (vm.opt.TieredStopAtLevel == null | vm.opt.TieredStopAtLevel == 4) & vm.debug == true
- * @requires !vm.emulatedClient & !vm.graal.enabled
+ * @requires !vm.graal.enabled
  * @modules java.base/jdk.internal.misc
  * @build jdk.test.whitebox.WhiteBox
  * @run driver jdk.test.lib.helpers.ClassFileInstaller jdk.test.whitebox.WhiteBox
@@ -37,7 +37,6 @@
 
 package compiler.loopopts;
 
-import jdk.test.lib.Platform;
 import jdk.test.lib.process.ProcessTools;
 import jdk.test.lib.process.OutputAnalyzer;
 import java.util.List;
diff --git a/test/hotspot/jtreg/compiler/profiling/TestTypeProfiling.java b/test/hotspot/jtreg/compiler/profiling/TestTypeProfiling.java
index 895589ea03f..9d64a08b691 100644
--- a/test/hotspot/jtreg/compiler/profiling/TestTypeProfiling.java
+++ b/test/hotspot/jtreg/compiler/profiling/TestTypeProfiling.java
@@ -27,7 +27,7 @@
   * @summary Parameters type profiling is not performed from aarch64 interpreter
   *
   * @requires os.arch != "arm"
-  * @requires vm.flavor == "server" & vm.compMode == "Xmixed" & !vm.emulatedClient & !vm.graal.enabled
+  * @requires vm.flavor == "server" & vm.compMode == "Xmixed" & !vm.graal.enabled
   *
   * @comment the test can't be run w/ TieredStopAtLevel < 4
   * @requires vm.opt.TieredStopAtLevel == null | vm.opt.TieredStopAtLevel == 4
@@ -94,8 +94,8 @@ public class TestTypeProfiling {
     }
 
     static public void main(String[] args) throws Exception {
-        if (!Platform.isServer() || Platform.isEmulatedClient()) {
-            throw new Error("TESTBUG: Not server mode");
+        if (!Platform.isServer()) {
+            throw new Error("TESTBUG: Not server VM");
         }
         // Only execute if C2 is available
         if (TIERED_STOP_AT_LEVEL != CompilerWhiteBoxTest.COMP_LEVEL_FULL_OPTIMIZATION) {
diff --git a/test/hotspot/jtreg/compiler/rangechecks/TestExplicitRangeChecks.java b/test/hotspot/jtreg/compiler/rangechecks/TestExplicitRangeChecks.java
index d74a10ae02c..c48609647c1 100644
--- a/test/hotspot/jtreg/compiler/rangechecks/TestExplicitRangeChecks.java
+++ b/test/hotspot/jtreg/compiler/rangechecks/TestExplicitRangeChecks.java
@@ -447,8 +447,7 @@ public class TestExplicitRangeChecks {
                 success = false;
             }
             // Only perform these additional checks if C2 is available
-            if (Platform.isServer() && !Platform.isEmulatedClient() &&
-                TIERED_STOP_AT_LEVEL == CompilerWhiteBoxTest.COMP_LEVEL_FULL_OPTIMIZATION) {
+            if (Platform.isServer() && TIERED_STOP_AT_LEVEL == CompilerWhiteBoxTest.COMP_LEVEL_FULL_OPTIMIZATION) {
                 if (deoptimize && WHITE_BOX.isMethodCompiled(m)) {
                     System.out.println(name + " not deoptimized on invalid access");
                     success = false;
diff --git a/test/hotspot/jtreg/compiler/testlibrary/CompilerUtils.java b/test/hotspot/jtreg/compiler/testlibrary/CompilerUtils.java
index 93be1971ca3..a8d953c5a30 100644
--- a/test/hotspot/jtreg/compiler/testlibrary/CompilerUtils.java
+++ b/test/hotspot/jtreg/compiler/testlibrary/CompilerUtils.java
@@ -53,10 +53,10 @@ public class CompilerUtils {
                     "TieredStopAtLevel has value out of int capacity");
             return IntStream.rangeClosed(1, maxLevel).toArray();
         } else {
-            if (Platform.isServer() && !Platform.isEmulatedClient()) {
+            if (Platform.isServer()) {
                 return new int[]{4};
             }
-            if (Platform.isClient() || Platform.isMinimal() || Platform.isEmulatedClient()) {
+            if (Platform.isClient() || Platform.isMinimal()) {
                 return new int[]{1};
             }
         }
diff --git a/test/hotspot/jtreg/compiler/testlibrary/sha/predicate/IntrinsicPredicates.java b/test/hotspot/jtreg/compiler/testlibrary/sha/predicate/IntrinsicPredicates.java
index b088f58bb5b..52925fcf993 100644
--- a/test/hotspot/jtreg/compiler/testlibrary/sha/predicate/IntrinsicPredicates.java
+++ b/test/hotspot/jtreg/compiler/testlibrary/sha/predicate/IntrinsicPredicates.java
@@ -56,7 +56,7 @@ public class IntrinsicPredicates {
                 "TieredStopAtLevel");
         boolean maxLevelIsReachable = (tieredMaxLevel
                 == IntrinsicPredicates.TIERED_MAX_LEVEL);
-        return Platform.isServer() && !Platform.isEmulatedClient() && (!isTiered || maxLevelIsReachable);
+        return Platform.isServer() && (!isTiered || maxLevelIsReachable);
     };
 
     public static final BooleanSupplier MD5_INSTRUCTION_AVAILABLE
diff --git a/test/hotspot/jtreg/compiler/tiered/NonTieredLevelsTest.java b/test/hotspot/jtreg/compiler/tiered/NonTieredLevelsTest.java
index d23b13a65e4..fd55187a7ef 100644
--- a/test/hotspot/jtreg/compiler/tiered/NonTieredLevelsTest.java
+++ b/test/hotspot/jtreg/compiler/tiered/NonTieredLevelsTest.java
@@ -47,10 +47,10 @@ public class NonTieredLevelsTest extends CompLevelsTest {
     private static final int AVAILABLE_COMP_LEVEL;
     private static final IntPredicate IS_AVAILABLE_COMPLEVEL;
     static {
-        if (Platform.isServer() && !Platform.isEmulatedClient()) {
+        if (Platform.isServer()) {
             AVAILABLE_COMP_LEVEL = COMP_LEVEL_FULL_OPTIMIZATION;
             IS_AVAILABLE_COMPLEVEL = x -> x == COMP_LEVEL_FULL_OPTIMIZATION;
-        } else if (Platform.isClient() || Platform.isMinimal() || Platform.isEmulatedClient()) {
+        } else if (Platform.isClient() || Platform.isMinimal()) {
             AVAILABLE_COMP_LEVEL = COMP_LEVEL_SIMPLE;
             IS_AVAILABLE_COMPLEVEL = x -> x == COMP_LEVEL_SIMPLE;
         } else {
diff --git a/test/hotspot/jtreg/compiler/types/correctness/CorrectnessTest.java b/test/hotspot/jtreg/compiler/types/correctness/CorrectnessTest.java
index 895f8674ed5..08cbdb29aea 100644
--- a/test/hotspot/jtreg/compiler/types/correctness/CorrectnessTest.java
+++ b/test/hotspot/jtreg/compiler/types/correctness/CorrectnessTest.java
@@ -25,7 +25,7 @@
  * @test CorrectnessTest
  * @bug 8038418
  * @summary Tests correctness of type usage with type profiling and speculations
- * @requires vm.flavor == "server" & !vm.emulatedClient
+ * @requires vm.flavor == "server"
  * @library /test/lib /
  * @modules java.base/jdk.internal.misc
  *          java.management
@@ -87,8 +87,8 @@ public class CorrectnessTest {
     private static final WhiteBox WHITE_BOX = WhiteBox.getWhiteBox();
 
     public static void main(String[] args) {
-        if (!Platform.isServer() || Platform.isEmulatedClient()) {
-            throw new Error("TESTBUG: Not server mode");
+        if (!Platform.isServer()) {
+            throw new Error("TESTBUG: Not server VM");
         }
         Asserts.assertGTE(args.length, 1);
         ProfilingType profilingType = ProfilingType.valueOf(args[0]);
diff --git a/test/hotspot/jtreg/compiler/types/correctness/OffTest.java b/test/hotspot/jtreg/compiler/types/correctness/OffTest.java
index 6f2354cf895..338c818fd3a 100644
--- a/test/hotspot/jtreg/compiler/types/correctness/OffTest.java
+++ b/test/hotspot/jtreg/compiler/types/correctness/OffTest.java
@@ -25,7 +25,7 @@
  * @test CorrectnessTest
  * @key randomness
  * @bug 8038418
- * @requires vm.flavor == "server" & !vm.emulatedClient
+ * @requires vm.flavor == "server"
  * @library /test/lib /
  * @modules java.base/jdk.internal.misc
  *          java.management
diff --git a/test/hotspot/jtreg/compiler/uncommontrap/TestUnstableIfTrap.java b/test/hotspot/jtreg/compiler/uncommontrap/TestUnstableIfTrap.java
index 04293370eb5..d539b56d850 100644
--- a/test/hotspot/jtreg/compiler/uncommontrap/TestUnstableIfTrap.java
+++ b/test/hotspot/jtreg/compiler/uncommontrap/TestUnstableIfTrap.java
@@ -210,7 +210,7 @@ public class TestUnstableIfTrap {
         boolean isMethodCompiledAtMaxTier
                 = WB.getMethodCompilationLevel(m) == MAX_TIER;
 
-        return Platform.isServer() && !Platform.isEmulatedClient() && isMethodCompiled
+        return Platform.isServer() && isMethodCompiled
                 && (!isTiered || isMethodCompiledAtMaxTier);
     }
 
diff --git a/test/hotspot/jtreg/compiler/unsafe/UnsafeGetConstantField.java b/test/hotspot/jtreg/compiler/unsafe/UnsafeGetConstantField.java
index 8b20cbf8ecd..bab22bb0cd0 100644
--- a/test/hotspot/jtreg/compiler/unsafe/UnsafeGetConstantField.java
+++ b/test/hotspot/jtreg/compiler/unsafe/UnsafeGetConstantField.java
@@ -27,7 +27,7 @@
  * @library /test/lib
  * @library /testlibrary/asm
  *
- * @requires vm.flavor == "server" & !vm.emulatedClient
+ * @requires vm.flavor == "server"
  *
  * @modules java.base/jdk.internal.vm.annotation
  *          java.base/jdk.internal.misc
@@ -97,8 +97,8 @@ public class UnsafeGetConstantField {
     static final Unsafe U = Unsafe.getUnsafe();
 
     public static void main(String[] args) {
-        if (!Platform.isServer() || Platform.isEmulatedClient()) {
-            throw new Error("TESTBUG: Not server mode");
+        if (!Platform.isServer()) {
+            throw new Error("TESTBUG: Not server VM");
         }
         testUnsafeGetAddress();
         testUnsafeGetField();
diff --git a/test/hotspot/jtreg/compiler/unsafe/UnsafeGetStableArrayElement.java b/test/hotspot/jtreg/compiler/unsafe/UnsafeGetStableArrayElement.java
index 9d3578bd6a1..a124c58055a 100644
--- a/test/hotspot/jtreg/compiler/unsafe/UnsafeGetStableArrayElement.java
+++ b/test/hotspot/jtreg/compiler/unsafe/UnsafeGetStableArrayElement.java
@@ -26,7 +26,7 @@
  * @summary tests on constant folding of unsafe get operations from stable arrays
  * @library /test/lib
  * @build jdk.test.whitebox.WhiteBox
- * @requires vm.flavor == "server" & !vm.emulatedClient
+ * @requires vm.flavor == "server"
  *
  * @modules java.base/jdk.internal.vm.annotation
  *          java.base/jdk.internal.misc
@@ -343,8 +343,8 @@ public class UnsafeGetStableArrayElement {
     }
 
     public static void main(String[] args) throws Exception {
-        if (!Platform.isServer() || Platform.isEmulatedClient()) {
-            throw new Error("TESTBUG: Not server mode");
+        if (!Platform.isServer()) {
+            throw new Error("TESTBUG: Not server VM");
         }
         testUnsafeAccess();
         System.out.println("TEST PASSED");
diff --git a/test/hotspot/jtreg/compiler/whitebox/DeoptimizeRelocatedNMethod.java b/test/hotspot/jtreg/compiler/whitebox/DeoptimizeRelocatedNMethod.java
index c7cf355259b..672e24ad874 100644
--- a/test/hotspot/jtreg/compiler/whitebox/DeoptimizeRelocatedNMethod.java
+++ b/test/hotspot/jtreg/compiler/whitebox/DeoptimizeRelocatedNMethod.java
@@ -29,7 +29,6 @@
  * @modules java.base/jdk.internal.misc java.management
  * @requires vm.opt.DeoptimizeALot != true
  * @requires vm.flavor == "server" & (vm.opt.TieredStopAtLevel == null | vm.opt.TieredStopAtLevel == 4)
- * @requires !vm.emulatedClient
  * @build jdk.test.whitebox.WhiteBox
  * @run driver jdk.test.lib.helpers.ClassFileInstaller jdk.test.whitebox.WhiteBox
  * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions -XX:+WhiteBoxAPI -Xbatch -XX:+SegmentedCodeCache
diff --git a/test/hotspot/jtreg/compiler/whitebox/IsMethodCompilableTest.java b/test/hotspot/jtreg/compiler/whitebox/IsMethodCompilableTest.java
index 19f577067e7..fff6517fc34 100644
--- a/test/hotspot/jtreg/compiler/whitebox/IsMethodCompilableTest.java
+++ b/test/hotspot/jtreg/compiler/whitebox/IsMethodCompilableTest.java
@@ -31,7 +31,6 @@
  *
  * @requires vm.opt.DeoptimizeALot != true
  * @requires vm.flavor == "server" & (vm.opt.TieredStopAtLevel == null | vm.opt.TieredStopAtLevel == 4)
- * @requires !vm.emulatedClient
  *
  * @build jdk.test.whitebox.WhiteBox
  * @run driver jdk.test.lib.helpers.ClassFileInstaller jdk.test.whitebox.WhiteBox
@@ -84,8 +83,8 @@ public class IsMethodCompilableTest extends CompilerWhiteBoxTest {
     protected void test() throws Exception {
 
         // Only c2 compilations can be disabled through PerMethodRecompilationCutoff
-        if (!Platform.isServer() || Platform.isEmulatedClient()) {
-            throw new Error("TESTBUG: Not server mode");
+        if (!Platform.isServer()) {
+            throw new Error("TESTBUG: Not server VM");
         }
 
         if (skipXcompOSR()) {
diff --git a/test/hotspot/jtreg/gc/stress/gcbasher/TestGCBasherWithAllocateHeapAt.java b/test/hotspot/jtreg/gc/stress/gcbasher/TestGCBasherWithAllocateHeapAt.java
index 778d398d9d2..cf837c1c3dd 100644
--- a/test/hotspot/jtreg/gc/stress/gcbasher/TestGCBasherWithAllocateHeapAt.java
+++ b/test/hotspot/jtreg/gc/stress/gcbasher/TestGCBasherWithAllocateHeapAt.java
@@ -31,7 +31,7 @@ import java.io.IOException;
  * @key stress
  * @library /
  * @requires vm.gc.G1
- * @requires vm.flavor == "server" & !vm.emulatedClient & os.family != "aix"
+ * @requires vm.flavor == "server" & os.family != "aix"
  * @summary Stress Java heap allocation with AllocateHeapAt flag using GC basher.
  * @run main/othervm/timeout=500 -Xlog:gc*=info -Xmx256m -server -XX:+UseG1GC -XX:AllocateHeapAt=. gc.stress.gcbasher.TestGCBasherWithAllocateHeapAt 120000
  */
diff --git a/test/hotspot/jtreg/gc/stress/gcbasher/TestGCBasherWithG1.java b/test/hotspot/jtreg/gc/stress/gcbasher/TestGCBasherWithG1.java
index 4f11ab361fb..a9095d73d9d 100644
--- a/test/hotspot/jtreg/gc/stress/gcbasher/TestGCBasherWithG1.java
+++ b/test/hotspot/jtreg/gc/stress/gcbasher/TestGCBasherWithG1.java
@@ -31,7 +31,7 @@ import java.io.IOException;
  * @key stress
  * @library /
  * @requires vm.gc.G1
- * @requires vm.flavor == "server" & !vm.emulatedClient
+ * @requires vm.flavor == "server"
  * @summary Stress the G1 GC by trying to make old objects more likely to be garbage than young objects.
  * @run main/othervm/timeout=200 -Xlog:gc*=info -Xmx256m -XX:+UseG1GC gc.stress.gcbasher.TestGCBasherWithG1 120000
  */
diff --git a/test/hotspot/jtreg/gc/stress/gcbasher/TestGCBasherWithParallel.java b/test/hotspot/jtreg/gc/stress/gcbasher/TestGCBasherWithParallel.java
index ee5ab654462..1bb71531abd 100644
--- a/test/hotspot/jtreg/gc/stress/gcbasher/TestGCBasherWithParallel.java
+++ b/test/hotspot/jtreg/gc/stress/gcbasher/TestGCBasherWithParallel.java
@@ -31,7 +31,7 @@ import java.io.IOException;
  * @key stress
  * @library /
  * @requires vm.gc.Parallel
- * @requires vm.flavor == "server" & !vm.emulatedClient
+ * @requires vm.flavor == "server"
  * @summary Stress the Parallel GC by trying to make old objects more likely to be garbage than young objects.
  * @run main/othervm/timeout=200 -Xlog:gc*=info -Xmx256m -XX:+UseParallelGC -XX:-UseGCOverheadLimit gc.stress.gcbasher.TestGCBasherWithParallel 120000
  */
diff --git a/test/hotspot/jtreg/gc/stress/gcbasher/TestGCBasherWithSerial.java b/test/hotspot/jtreg/gc/stress/gcbasher/TestGCBasherWithSerial.java
index 25650b6b9d5..ff6ad786302 100644
--- a/test/hotspot/jtreg/gc/stress/gcbasher/TestGCBasherWithSerial.java
+++ b/test/hotspot/jtreg/gc/stress/gcbasher/TestGCBasherWithSerial.java
@@ -31,7 +31,7 @@ import java.io.IOException;
  * @key stress
  * @library /
  * @requires vm.gc.Serial
- * @requires vm.flavor == "server" & !vm.emulatedClient
+ * @requires vm.flavor == "server"
  * @summary Stress the Serial GC by trying to make old objects more likely to be garbage than young objects.
  * @run main/othervm/timeout=200 -Xlog:gc*=info -Xmx256m -XX:+UseSerialGC gc.stress.gcbasher.TestGCBasherWithSerial 120000
  */
diff --git a/test/hotspot/jtreg/gc/stress/gcbasher/TestGCBasherWithShenandoah.java b/test/hotspot/jtreg/gc/stress/gcbasher/TestGCBasherWithShenandoah.java
index 0d1a4af9a2a..3bf0e59dce3 100644
--- a/test/hotspot/jtreg/gc/stress/gcbasher/TestGCBasherWithShenandoah.java
+++ b/test/hotspot/jtreg/gc/stress/gcbasher/TestGCBasherWithShenandoah.java
@@ -32,7 +32,7 @@ import java.io.IOException;
  * @key stress
  * @library /
  * @requires vm.gc.Shenandoah
- * @requires vm.flavor == "server" & !vm.emulatedClient
+ * @requires vm.flavor == "server"
  * @summary Stress the Shenandoah GC by trying to make old objects more likely to be garbage than young objects.
  *
  * @run main/othervm/timeout=200 -Xlog:gc*=info -Xmx1g -XX:+UnlockDiagnosticVMOptions -XX:+UnlockExperimentalVMOptions
@@ -51,7 +51,7 @@ import java.io.IOException;
  * @key stress
  * @library /
  * @requires vm.gc.Shenandoah
- * @requires vm.flavor == "server" & !vm.emulatedClient
+ * @requires vm.flavor == "server"
  * @summary Stress the Shenandoah GC by trying to make old objects more likely to be garbage than young objects.
  *
  * @run main/othervm/timeout=200 -Xlog:gc*=info -Xmx1g -XX:+UnlockDiagnosticVMOptions -XX:+UnlockExperimentalVMOptions
@@ -74,7 +74,7 @@ import java.io.IOException;
  * @key stress
  * @library /
  * @requires vm.gc.Shenandoah
- * @requires vm.flavor == "server" & !vm.emulatedClient
+ * @requires vm.flavor == "server"
  * @summary Stress the Shenandoah GC by trying to make old objects more likely to be garbage than young objects.
  *
  * @run main/othervm/timeout=200 -Xlog:gc*=info -Xmx1g -XX:+UnlockDiagnosticVMOptions -XX:+UnlockExperimentalVMOptions
@@ -92,7 +92,7 @@ import java.io.IOException;
  * @key stress
  * @library /
  * @requires vm.gc.Shenandoah
- * @requires vm.flavor == "server" & !vm.emulatedClient & vm.opt.ClassUnloading != false
+ * @requires vm.flavor == "server" & vm.opt.ClassUnloading != false
  * @summary Stress Shenandoah GC with nmethod barrier forced deoptimization enabled.
  *
  * @run main/othervm/timeout=200 -Xlog:gc*=info -Xmx1g -XX:+UnlockDiagnosticVMOptions -XX:+UnlockExperimentalVMOptions
@@ -105,7 +105,7 @@ import java.io.IOException;
  * @key stress
  * @library /
  * @requires vm.gc.Shenandoah
- * @requires vm.flavor == "server" & !vm.emulatedClient & vm.opt.ClassUnloading != false
+ * @requires vm.flavor == "server" & vm.opt.ClassUnloading != false
  * @summary Stress Shenandoah GC with nmethod barrier forced deoptimization enabled.
  *
  * @run main/othervm/timeout=200 -Xlog:gc*=info,nmethod+barrier=trace -Xmx1g -XX:+UnlockDiagnosticVMOptions -XX:+UnlockExperimentalVMOptions
@@ -126,7 +126,7 @@ import java.io.IOException;
  * @key stress
  * @library /
  * @requires vm.gc.Shenandoah
- * @requires vm.flavor == "server" & !vm.emulatedClient & vm.opt.ClassUnloading != false
+ * @requires vm.flavor == "server" & vm.opt.ClassUnloading != false
  * @summary Stress Shenandoah GC with nmethod barrier forced deoptimization enabled.
  *
  * @run main/othervm/timeout=200 -Xlog:gc*=info,nmethod+barrier=trace -Xmx1g -XX:+UnlockDiagnosticVMOptions -XX:+UnlockExperimentalVMOptions
@@ -152,7 +152,7 @@ import java.io.IOException;
  * @key stress
  * @library /
  * @requires vm.gc.Shenandoah
- * @requires vm.flavor == "server" & !vm.emulatedClient & vm.opt.ClassUnloading != false
+ * @requires vm.flavor == "server" & vm.opt.ClassUnloading != false
  * @summary Stress Shenandoah GC with nmethod barrier forced deoptimization enabled.
  *
  * @run main/othervm/timeout=200 -Xlog:gc*=info,nmethod+barrier=trace -Xmx1g -XX:+UnlockDiagnosticVMOptions -XX:+UnlockExperimentalVMOptions
@@ -172,7 +172,7 @@ import java.io.IOException;
  * @key stress
  * @library /
  * @requires vm.gc.Shenandoah
- * @requires vm.flavor == "server" & !vm.emulatedClient & vm.opt.ClassUnloading != false
+ * @requires vm.flavor == "server" & vm.opt.ClassUnloading != false
  * @summary Stress Shenandoah GC with nmethod barrier forced deoptimization enabled.
  *
  * @run main/othervm/timeout=200 -Xlog:gc*=info,nmethod+barrier=trace -Xmx1g -XX:+UnlockDiagnosticVMOptions -XX:+UnlockExperimentalVMOptions
@@ -185,7 +185,7 @@ import java.io.IOException;
  * @key stress
  * @library /
  * @requires vm.gc.Shenandoah
- * @requires vm.flavor == "server" & !vm.emulatedClient
+ * @requires vm.flavor == "server"
  * @summary Stress the Shenandoah GC by trying to make old objects more likely to be garbage than young objects.
  *
  * @run main/othervm/timeout=200 -Xlog:gc*=info -Xmx1g -XX:+UnlockDiagnosticVMOptions -XX:+UnlockExperimentalVMOptions
@@ -203,7 +203,7 @@ import java.io.IOException;
   * @key stress
   * @library /
   * @requires vm.gc.Shenandoah
-  * @requires vm.flavor == "server" & !vm.emulatedClient & vm.opt.ClassUnloading != false
+  * @requires vm.flavor == "server" & vm.opt.ClassUnloading != false
   * @summary Stress Shenandoah GC with nmethod barrier forced deoptimization enabled.
   *
   * @run main/othervm/timeout=200 -Xlog:gc*=info,nmethod+barrier=trace -Xmx1g -XX:+UnlockDiagnosticVMOptions -XX:+UnlockExperimentalVMOptions
diff --git a/test/hotspot/jtreg/gc/stress/gcbasher/TestGCBasherWithZ.java b/test/hotspot/jtreg/gc/stress/gcbasher/TestGCBasherWithZ.java
index d4a95fd9791..2007580f065 100644
--- a/test/hotspot/jtreg/gc/stress/gcbasher/TestGCBasherWithZ.java
+++ b/test/hotspot/jtreg/gc/stress/gcbasher/TestGCBasherWithZ.java
@@ -31,7 +31,7 @@ import java.io.IOException;
  * @key stress
  * @library /
  * @requires vm.gc.Z
- * @requires vm.flavor == "server" & !vm.emulatedClient
+ * @requires vm.flavor == "server"
  * @summary Stress ZGC
  * @run main/othervm/timeout=200 -Xlog:gc*=info -Xmx384m -XX:+UseZGC gc.stress.gcbasher.TestGCBasherWithZ 120000
  */
@@ -41,7 +41,7 @@ import java.io.IOException;
  * @key stress
  * @library /
  * @requires vm.gc.Z
- * @requires vm.flavor == "server" & !vm.emulatedClient & vm.opt.ClassUnloading != false
+ * @requires vm.flavor == "server" & vm.opt.ClassUnloading != false
  * @summary Stress ZGC with nmethod barrier forced deoptimization enabled.
  * @run main/othervm/timeout=200 -Xlog:gc*=info,nmethod+barrier=trace -Xmx384m -XX:+UseZGC
  *   -XX:+UnlockDiagnosticVMOptions -XX:+DeoptimizeNMethodBarriersALot -XX:-Inline
diff --git a/test/hotspot/jtreg/runtime/ReservedStack/ReservedStackTestCompiler.java b/test/hotspot/jtreg/runtime/ReservedStack/ReservedStackTestCompiler.java
index ac9e41b3236..2dc6b7e56a5 100644
--- a/test/hotspot/jtreg/runtime/ReservedStack/ReservedStackTestCompiler.java
+++ b/test/hotspot/jtreg/runtime/ReservedStack/ReservedStackTestCompiler.java
@@ -25,7 +25,7 @@
  * @test ReservedStackTestCompiler
  * @summary Run ReservedStackTest with dedicated compilers C1 and C2.
  *
- * @requires vm.flavor == "server" & !vm.emulatedClient
+ * @requires vm.flavor == "server"
  * @requires vm.opt.DeoptimizeALot != true
  * @library /test/lib
  * @modules java.base/jdk.internal.misc
diff --git a/test/hotspot/jtreg/runtime/exceptionMsgs/AbstractMethodError/AbstractMethodErrorTest.java b/test/hotspot/jtreg/runtime/exceptionMsgs/AbstractMethodError/AbstractMethodErrorTest.java
index a7063ecd2dc..508dcf197e3 100644
--- a/test/hotspot/jtreg/runtime/exceptionMsgs/AbstractMethodError/AbstractMethodErrorTest.java
+++ b/test/hotspot/jtreg/runtime/exceptionMsgs/AbstractMethodError/AbstractMethodErrorTest.java
@@ -25,7 +25,7 @@
 /**
  * @test
  * @summary Check that the verbose message of the AME is printed correctly.
- * @requires !(os.arch=="arm") & vm.flavor == "server" & !vm.emulatedClient & vm.compMode=="Xmixed" & !vm.graal.enabled & vm.opt.UseJVMCICompiler != true & (vm.opt.TieredStopAtLevel == null | vm.opt.TieredStopAtLevel==4)
+ * @requires !(os.arch=="arm") & vm.flavor == "server" & vm.compMode=="Xmixed" & !vm.graal.enabled & vm.opt.UseJVMCICompiler != true & (vm.opt.TieredStopAtLevel == null | vm.opt.TieredStopAtLevel==4)
  * @requires vm.opt.DeoptimizeALot != true
  * @library /test/lib /
  * @build jdk.test.whitebox.WhiteBox
diff --git a/test/hotspot/jtreg/runtime/exceptionMsgs/IncompatibleClassChangeError/IncompatibleClassChangeErrorTest.java b/test/hotspot/jtreg/runtime/exceptionMsgs/IncompatibleClassChangeError/IncompatibleClassChangeErrorTest.java
index 77738191f19..5891ff60c42 100644
--- a/test/hotspot/jtreg/runtime/exceptionMsgs/IncompatibleClassChangeError/IncompatibleClassChangeErrorTest.java
+++ b/test/hotspot/jtreg/runtime/exceptionMsgs/IncompatibleClassChangeError/IncompatibleClassChangeErrorTest.java
@@ -26,7 +26,7 @@
  * @test
  * @summary Check that the verbose message of ICCE is printed correctly.
  *          The test forces errors in vtable stubs and interpreter.
- * @requires !(os.arch=="arm") & vm.flavor == "server" & !vm.emulatedClient & vm.compMode=="Xmixed" & (!vm.graal.enabled | vm.opt.TieredCompilation == true) & (vm.opt.TieredStopAtLevel == null | vm.opt.TieredStopAtLevel==4)
+ * @requires !(os.arch=="arm") & vm.flavor == "server" & vm.compMode=="Xmixed" & (!vm.graal.enabled | vm.opt.TieredCompilation == true) & (vm.opt.TieredStopAtLevel == null | vm.opt.TieredStopAtLevel==4)
  * @library /test/lib /
  * @build jdk.test.whitebox.WhiteBox
  * @run driver jdk.test.lib.helpers.ClassFileInstaller jdk.test.whitebox.WhiteBox
diff --git a/test/hotspot/jtreg/serviceability/dcmd/compiler/CompilerDirectivesDCMDTest.java b/test/hotspot/jtreg/serviceability/dcmd/compiler/CompilerDirectivesDCMDTest.java
index 5e4f73cedd5..690726317b0 100644
--- a/test/hotspot/jtreg/serviceability/dcmd/compiler/CompilerDirectivesDCMDTest.java
+++ b/test/hotspot/jtreg/serviceability/dcmd/compiler/CompilerDirectivesDCMDTest.java
@@ -49,7 +49,7 @@ public class CompilerDirectivesDCMDTest {
 
     public void run(CommandExecutor executor) {
 
-        if (Platform.isServer() && !Platform.isEmulatedClient()) {
+        if (Platform.isServer()) {
             filename = System.getProperty("test.src", ".") + File.separator + "control2.txt";
         } else {
             filename = System.getProperty("test.src", ".") + File.separator + "control1.txt";
diff --git a/test/hotspot/jtreg/serviceability/jvmti/NMethodRelocation/NMethodRelocationTest.java b/test/hotspot/jtreg/serviceability/jvmti/NMethodRelocation/NMethodRelocationTest.java
index 5b4a1c7e663..65a89b152b6 100644
--- a/test/hotspot/jtreg/serviceability/jvmti/NMethodRelocation/NMethodRelocationTest.java
+++ b/test/hotspot/jtreg/serviceability/jvmti/NMethodRelocation/NMethodRelocationTest.java
@@ -28,7 +28,6 @@
  * @requires vm.jvmti &
  *           vm.gc != "Epsilon" &
  *           vm.flavor == "server" &
- *           !vm.emulatedClient &
  *           (vm.opt.TieredStopAtLevel == null | vm.opt.TieredStopAtLevel == 4) &
  *           vm.compMode == "Xmixed"
  * @library /test/lib /test/hotspot/jtreg
diff --git a/test/hotspot/jtreg/testlibrary/ctw/src/sun/hotspot/tools/ctw/Utils.java b/test/hotspot/jtreg/testlibrary/ctw/src/sun/hotspot/tools/ctw/Utils.java
index ec24d4f186d..20234677929 100644
--- a/test/hotspot/jtreg/testlibrary/ctw/src/sun/hotspot/tools/ctw/Utils.java
+++ b/test/hotspot/jtreg/testlibrary/ctw/src/sun/hotspot/tools/ctw/Utils.java
@@ -86,12 +86,10 @@ public class Utils {
             INITIAL_COMP_LEVEL = 1;
         } else {
             String vmName = System.getProperty("java.vm.name");
-            String vmInfo = System.getProperty("java.vm.info");
-            boolean isEmulatedClient = (vmInfo != null) && vmInfo.contains("emulated-client");
-            if (Utils.endsWithIgnoreCase(vmName, " Server VM") && !isEmulatedClient) {
+            if (Utils.endsWithIgnoreCase(vmName, " Server VM")) {
                 INITIAL_COMP_LEVEL = 4;
             } else if (Utils.endsWithIgnoreCase(vmName, " Client VM")
-                    || Utils.endsWithIgnoreCase(vmName, " Minimal VM") || isEmulatedClient) {
+                    || Utils.endsWithIgnoreCase(vmName, " Minimal VM")) {
                 INITIAL_COMP_LEVEL = 1;
             } else {
                 throw new RuntimeException("Unknown VM: " + vmName);
diff --git a/test/jdk/jdk/jfr/event/compiler/TestCompilerInlining.java b/test/jdk/jdk/jfr/event/compiler/TestCompilerInlining.java
index 9694c054f6a..20e611fc671 100644
--- a/test/jdk/jdk/jfr/event/compiler/TestCompilerInlining.java
+++ b/test/jdk/jdk/jfr/event/compiler/TestCompilerInlining.java
@@ -131,10 +131,10 @@ public class TestCompilerInlining {
         if (WHITE_BOX.getBooleanVMFlag("TieredCompilation")) {
             return IntStream.rangeClosed(LEVEL_SIMPLE, WHITE_BOX.getIntxVMFlag("TieredStopAtLevel").intValue()).toArray();
         }
-        if (Platform.isServer() && !Platform.isEmulatedClient()) {
+        if (Platform.isServer()) {
             return new int[] { LEVEL_FULL_OPTIMIZATION };
         }
-        if (Platform.isClient() || Platform.isEmulatedClient()) {
+        if (Platform.isClient()) {
             return new int[] { LEVEL_SIMPLE };
         }
         throw new Error("TESTBUG: unknown VM");
diff --git a/test/jdk/jdk/jfr/event/runtime/TestThrowableInstrumentation.java b/test/jdk/jdk/jfr/event/runtime/TestThrowableInstrumentation.java
index e1e135ab0b7..63d5dd16da9 100644
--- a/test/jdk/jdk/jfr/event/runtime/TestThrowableInstrumentation.java
+++ b/test/jdk/jdk/jfr/event/runtime/TestThrowableInstrumentation.java
@@ -52,7 +52,7 @@ public class TestThrowableInstrumentation {
     public static void main(String[] args) {
         // Compile Throwable::<clinit> with C1 (if available)
         if (!WHITE_BOX.enqueueInitializerForCompilation(java.lang.Throwable.class, COMP_LEVEL_SIMPLE)) {
-          if (!Platform.isServer() || isTieredCompilationEnabled() || Platform.isEmulatedClient()) {
+          if (!Platform.isServer() || isTieredCompilationEnabled()) {
             throw new RuntimeException("Unable to compile Throwable::<clinit> with C1");
           }
         }
diff --git a/test/jdk/jdk/jfr/jvm/TestJFRIntrinsic.java b/test/jdk/jdk/jfr/jvm/TestJFRIntrinsic.java
index 75ed0d14ca5..502eefd5375 100644
--- a/test/jdk/jdk/jfr/jvm/TestJFRIntrinsic.java
+++ b/test/jdk/jdk/jfr/jvm/TestJFRIntrinsic.java
@@ -131,10 +131,10 @@ public class TestJFRIntrinsic {
             int maxLevel = flagValue.intValue();
             return IntStream.rangeClosed(1, maxLevel).toArray();
         } else {
-            if (Platform.isServer() && !Platform.isEmulatedClient()) {
+            if (Platform.isServer()) {
                 return new int[]{4};
             }
-            if (Platform.isClient() || Platform.isMinimal() || Platform.isEmulatedClient()) {
+            if (Platform.isClient() || Platform.isMinimal()) {
                 return new int[]{1};
             }
         }
diff --git a/test/jtreg-ext/requires/VMProps.java b/test/jtreg-ext/requires/VMProps.java
index 70e619f3d3d..2d604a92b75 100644
--- a/test/jtreg-ext/requires/VMProps.java
+++ b/test/jtreg-ext/requires/VMProps.java
@@ -107,7 +107,6 @@ public class VMProps implements Callable<Map<String, String>> {
         map.put("vm.debug", this::vmDebug);
         map.put("vm.jvmci", this::vmJvmci);
         map.put("vm.jvmci.enabled", this::vmJvmciEnabled);
-        map.put("vm.emulatedClient", this::vmEmulatedClient);
         // vm.hasSA is "true" if the VM contains the serviceability agent
         // and jhsdb.
         map.put("vm.hasSA", this::vmHasSA);
@@ -299,18 +298,6 @@ public class VMProps implements Callable<Map<String, String>> {
         return "" + Compiler.isJVMCIEnabled();
     }
 
-
-    /**
-     * @return true if VM runs in emulated-client mode and false otherwise.
-     */
-    protected String vmEmulatedClient() {
-        String vmInfo = System.getProperty("java.vm.info");
-        if (vmInfo == null) {
-            return errorWithMessage("Can't get 'java.vm.info' property");
-        }
-        return "" + vmInfo.contains(" emulated-client");
-    }
-
     /**
      * @return supported CPU features
      */
diff --git a/test/lib-test/jdk/test/lib/TestMutuallyExclusivePlatformPredicates.java b/test/lib-test/jdk/test/lib/TestMutuallyExclusivePlatformPredicates.java
index 8047b81c1e6..801874f38c2 100644
--- a/test/lib-test/jdk/test/lib/TestMutuallyExclusivePlatformPredicates.java
+++ b/test/lib-test/jdk/test/lib/TestMutuallyExclusivePlatformPredicates.java
@@ -50,7 +50,7 @@ public class TestMutuallyExclusivePlatformPredicates {
         OS("isAix", "isLinux", "isOSX", "isWindows"),
         VM_TYPE("isClient", "isServer", "isMinimal", "isZero", "isEmbedded"),
         MODE("isInt", "isMixed", "isComp"),
-        IGNORED("isEmulatedClient", "isDebugBuild", "isFastDebugBuild", "isMusl",
+        IGNORED("isDebugBuild", "isFastDebugBuild", "isMusl",
                 "isStatic", "isSlowDebugBuild", "hasSA", "isRoot", "isTieredSupported",
                 "areCustomLoadersSupportedForCDS", "isDefaultCDSArchiveSupported",
                 "isHardenedOSX", "hasOSXPlistEntries", "isOracleLinux7", "isOnWayland");
diff --git a/test/lib/jdk/test/lib/Platform.java b/test/lib/jdk/test/lib/Platform.java
index 170e53930d8..892de2338e3 100644
--- a/test/lib/jdk/test/lib/Platform.java
+++ b/test/lib/jdk/test/lib/Platform.java
@@ -75,10 +75,6 @@ public class Platform {
         return vmInfo.contains("static");
     }
 
-    public static boolean isEmulatedClient() {
-        return vmInfo.contains(" emulated-client");
-    }
-
     public static boolean isTieredSupported() {
         return (compiler != null) && compiler.contains("Tiered Compilers");
     }

From 9a0fde4a4992bc2a67b66bc86aeceaebe0b77cf4 Mon Sep 17 00:00:00 2001
From: Thomas Schatzl <tschatzl@openjdk.org>
Date: Mon, 23 Mar 2026 11:04:12 +0000
Subject: [PATCH 303/655] 8367765: G1: Merge
 G1UpdateRegionLivenessAndSelectForRebuild task and collection set choosing

Reviewed-by: ayang, iwalulya
---
 .../share/gc/g1/g1CollectionSetCandidates.cpp |  10 +-
 .../share/gc/g1/g1CollectionSetCandidates.hpp |   5 +-
 .../share/gc/g1/g1CollectionSetChooser.cpp    | 296 ------------------
 .../share/gc/g1/g1CollectionSetChooser.hpp    |  55 ----
 src/hotspot/share/gc/g1/g1ConcurrentMark.cpp  |   8 +-
 .../gc/g1/g1ConcurrentMarkRemarkTasks.cpp     | 107 ++++++-
 .../gc/g1/g1ConcurrentMarkRemarkTasks.hpp     |  13 +-
 src/hotspot/share/gc/g1/g1Policy.cpp          |   1 -
 .../share/gc/g1/g1RemSetTrackingPolicy.cpp    |  11 +-
 9 files changed, 122 insertions(+), 384 deletions(-)
 delete mode 100644 src/hotspot/share/gc/g1/g1CollectionSetChooser.cpp
 delete mode 100644 src/hotspot/share/gc/g1/g1CollectionSetChooser.hpp

diff --git a/src/hotspot/share/gc/g1/g1CollectionSetCandidates.cpp b/src/hotspot/share/gc/g1/g1CollectionSetCandidates.cpp
index d71108d4d0e..debb0bb54b7 100644
--- a/src/hotspot/share/gc/g1/g1CollectionSetCandidates.cpp
+++ b/src/hotspot/share/gc/g1/g1CollectionSetCandidates.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2019, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2019, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,7 +23,6 @@
  */
 
 #include "gc/g1/g1CollectionSetCandidates.inline.hpp"
-#include "gc/g1/g1CollectionSetChooser.hpp"
 #include "gc/g1/g1HeapRegion.inline.hpp"
 #include "utilities/growableArray.hpp"
 
@@ -250,8 +249,9 @@ void G1CollectionSetCandidates::sort_marking_by_efficiency() {
   _from_marking_groups.verify();
 }
 
-void G1CollectionSetCandidates::set_candidates_from_marking(G1HeapRegion** candidates,
-                                                            uint num_candidates) {
+void G1CollectionSetCandidates::set_candidates_from_marking(GrowableArrayCHeap<G1HeapRegion*, mtGC>* candidates) {
+  uint num_candidates = candidates->length();
+
   if (num_candidates == 0) {
     log_debug(gc, ergo, cset) ("No regions selected from marking.");
     return;
@@ -273,7 +273,7 @@ void G1CollectionSetCandidates::set_candidates_from_marking(G1HeapRegion** candi
   current = new G1CSetCandidateGroup();
 
   for (uint i = 0; i < num_candidates; i++) {
-    G1HeapRegion* r = candidates[i];
+    G1HeapRegion* r = candidates->at(i);
     assert(!contains(r), "must not contain region %u", r->hrm_index());
     _contains_map[r->hrm_index()] = CandidateOrigin::Marking;
 
diff --git a/src/hotspot/share/gc/g1/g1CollectionSetCandidates.hpp b/src/hotspot/share/gc/g1/g1CollectionSetCandidates.hpp
index 7e882de7e5a..8a2235cf89c 100644
--- a/src/hotspot/share/gc/g1/g1CollectionSetCandidates.hpp
+++ b/src/hotspot/share/gc/g1/g1CollectionSetCandidates.hpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2019, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2019, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -245,8 +245,7 @@ public:
 
   // Merge collection set candidates from marking into the current marking candidates
   // (which needs to be empty).
-  void set_candidates_from_marking(G1HeapRegion** candidates,
-                                   uint num_candidates);
+  void set_candidates_from_marking(GrowableArrayCHeap<G1HeapRegion*, mtGC>* selected);
   // The most recent length of the list that had been merged last via
   // set_candidates_from_marking(). Used for calculating minimum collection set
   // regions.
diff --git a/src/hotspot/share/gc/g1/g1CollectionSetChooser.cpp b/src/hotspot/share/gc/g1/g1CollectionSetChooser.cpp
deleted file mode 100644
index e7bab32129e..00000000000
--- a/src/hotspot/share/gc/g1/g1CollectionSetChooser.cpp
+++ /dev/null
@@ -1,296 +0,0 @@
-/*
- * Copyright (c) 2001, 2026, Oracle and/or its affiliates. All rights reserved.
- * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
- *
- * This code is free software; you can redistribute it and/or modify it
- * under the terms of the GNU General Public License version 2 only, as
- * published by the Free Software Foundation.
- *
- * This code is distributed in the hope that it will be useful, but WITHOUT
- * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
- * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
- * version 2 for more details (a copy is included in the LICENSE file that
- * accompanied this code).
- *
- * You should have received a copy of the GNU General Public License version
- * 2 along with this work; if not, write to the Free Software Foundation,
- * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
- *
- * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
- * or visit www.oracle.com if you need additional information or have any
- * questions.
- *
- */
-
-#include "gc/g1/g1CollectedHeap.inline.hpp"
-#include "gc/g1/g1CollectionSetCandidates.hpp"
-#include "gc/g1/g1CollectionSetChooser.hpp"
-#include "gc/g1/g1HeapRegionRemSet.inline.hpp"
-#include "gc/shared/space.hpp"
-#include "runtime/atomic.hpp"
-#include "utilities/quickSort.hpp"
-
-// Determine collection set candidates (from marking): For all regions determine
-// whether they should be a collection set candidate. Calculate their efficiency,
-// sort, and put them into the collection set candidates.
-//
-// Threads calculate the GC efficiency of the regions they get to process, and
-// put them into some work area without sorting. At the end that array is sorted and
-// moved to the destination.
-class G1BuildCandidateRegionsTask : public WorkerTask {
-  // Work area for building the set of collection set candidates. Contains references
-  // to heap regions with their GC efficiencies calculated. To reduce contention
-  // on claiming array elements, worker threads claim parts of this array in chunks;
-  // Array elements may be null as threads might not get enough regions to fill
-  // up their chunks completely.
-  // Final sorting will remove them.
-  class G1BuildCandidateArray : public StackObj {
-    uint const _max_size;
-    uint const _chunk_size;
-
-    G1HeapRegion** _data;
-
-    Atomic<uint> _cur_claim_idx;
-
-    static int compare_region_gc_efficiency(G1HeapRegion** rr1, G1HeapRegion** rr2) {
-      G1HeapRegion* r1 = *rr1;
-      G1HeapRegion* r2 = *rr2;
-      // Make sure that null entries are moved to the end.
-      if (r1 == nullptr) {
-        if (r2 == nullptr) {
-          return 0;
-        } else {
-          return 1;
-        }
-      } else if (r2 == nullptr) {
-        return -1;
-      }
-
-      G1Policy* p = G1CollectedHeap::heap()->policy();
-      double gc_efficiency1 = p->predict_gc_efficiency(r1);
-      double gc_efficiency2 = p->predict_gc_efficiency(r2);
-
-      if (gc_efficiency1 > gc_efficiency2) {
-        return -1;
-      } else if (gc_efficiency1 < gc_efficiency2) {
-        return 1;
-      } else {
-        return 0;
-      }
-    }
-
-    // Calculates the maximum array size that will be used.
-    static uint required_array_size(uint num_regions, uint chunk_size, uint num_workers) {
-      uint const max_waste = num_workers * chunk_size;
-      // The array should be aligned with respect to chunk_size.
-      uint const aligned_num_regions = ((num_regions + chunk_size - 1) / chunk_size) * chunk_size;
-
-      return aligned_num_regions + max_waste;
-    }
-
-  public:
-    G1BuildCandidateArray(uint max_num_regions, uint chunk_size, uint num_workers) :
-      _max_size(required_array_size(max_num_regions, chunk_size, num_workers)),
-      _chunk_size(chunk_size),
-      _data(NEW_C_HEAP_ARRAY(G1HeapRegion*, _max_size, mtGC)),
-      _cur_claim_idx(0) {
-      for (uint i = 0; i < _max_size; i++) {
-        _data[i] = nullptr;
-      }
-    }
-
-    ~G1BuildCandidateArray() {
-      FREE_C_HEAP_ARRAY(G1HeapRegion*, _data);
-    }
-
-    // Claim a new chunk, returning its bounds [from, to[.
-    void claim_chunk(uint& from, uint& to) {
-      uint result = _cur_claim_idx.add_then_fetch(_chunk_size);
-      assert(_max_size > result - 1,
-             "Array too small, is %u should be %u with chunk size %u.",
-             _max_size, result, _chunk_size);
-      from = result - _chunk_size;
-      to = result;
-    }
-
-    // Set element in array.
-    void set(uint idx, G1HeapRegion* hr) {
-      assert(idx < _max_size, "Index %u out of bounds %u", idx, _max_size);
-      assert(_data[idx] == nullptr, "Value must not have been set.");
-      _data[idx] = hr;
-    }
-
-    void sort_by_gc_efficiency() {
-      uint length = _cur_claim_idx.load_relaxed();
-      if (length == 0) {
-        return;
-      }
-      for (uint i = length; i < _max_size; i++) {
-        assert(_data[i] == nullptr, "must be");
-      }
-      qsort(_data, length, sizeof(_data[0]), (_sort_Fn)compare_region_gc_efficiency);
-      for (uint i = length; i < _max_size; i++) {
-        assert(_data[i] == nullptr, "must be");
-      }
-    }
-
-    G1HeapRegion** array() const { return _data; }
-  };
-
-  // Per-region closure. In addition to determining whether a region should be
-  // added to the candidates, and calculating those regions' gc efficiencies, also
-  // gather additional statistics.
-  class G1BuildCandidateRegionsClosure : public G1HeapRegionClosure {
-    G1BuildCandidateArray* _array;
-
-    uint _cur_chunk_idx;
-    uint _cur_chunk_end;
-
-    uint _regions_added;
-
-    void add_region(G1HeapRegion* hr) {
-      if (_cur_chunk_idx == _cur_chunk_end) {
-        _array->claim_chunk(_cur_chunk_idx, _cur_chunk_end);
-      }
-      assert(_cur_chunk_idx < _cur_chunk_end, "Must be");
-
-      _array->set(_cur_chunk_idx, hr);
-      _cur_chunk_idx++;
-
-      _regions_added++;
-    }
-
-  public:
-    G1BuildCandidateRegionsClosure(G1BuildCandidateArray* array) :
-      _array(array),
-      _cur_chunk_idx(0),
-      _cur_chunk_end(0),
-      _regions_added(0) { }
-
-    bool do_heap_region(G1HeapRegion* r) {
-      // Candidates from marking are always old; also keep regions that are already
-      // collection set candidates (some retained regions) in that list.
-      if (!r->is_old() || r->is_collection_set_candidate()) {
-        // Keep remembered sets and everything for these regions.
-        return false;
-      }
-
-      // Can not add a region without a remembered set to the candidates.
-      if (!r->rem_set()->is_tracked()) {
-        return false;
-      }
-
-      // Skip any region that is currently used as an old GC alloc region. We should
-      // not consider those for collection before we fill them up as the effective
-      // gain from them is small. I.e. we only actually reclaim from the filled part,
-      // as the remainder is still eligible for allocation. These objects are also
-      // likely to have already survived a few collections, so they might be longer
-      // lived anyway.
-      // Otherwise the Old region must satisfy the liveness condition.
-      bool should_add = !G1CollectedHeap::heap()->is_old_gc_alloc_region(r) &&
-                        G1CollectionSetChooser::region_occupancy_low_enough_for_evac(r->live_bytes());
-      if (should_add) {
-        add_region(r);
-      } else {
-        r->rem_set()->clear(true /* only_cardset */);
-      }
-      return false;
-    }
-
-    uint regions_added() const { return _regions_added; }
-  };
-
-  G1CollectedHeap* _g1h;
-  G1HeapRegionClaimer _hrclaimer;
-
-  Atomic<uint> _num_regions_added;
-
-  G1BuildCandidateArray _result;
-
-  void update_totals(uint num_regions) {
-    if (num_regions > 0) {
-      _num_regions_added.add_then_fetch(num_regions);
-    }
-  }
-
-  // Early prune (remove) regions meeting the G1HeapWastePercent criteria. That
-  // is, either until only the minimum amount of old collection set regions are
-  // available (for forward progress in evacuation) or the waste accumulated by the
-  // removed regions is above the maximum allowed waste.
-  // Updates number of candidates and reclaimable bytes given.
-  void prune(G1HeapRegion** data) {
-    G1Policy* p = G1CollectedHeap::heap()->policy();
-
-    uint num_candidates = _num_regions_added.load_relaxed();
-
-    uint min_old_cset_length = p->calc_min_old_cset_length(num_candidates);
-    uint num_pruned = 0;
-    size_t wasted_bytes = 0;
-
-    if (min_old_cset_length >= num_candidates) {
-      // We take all of the candidate regions to provide some forward progress.
-      return;
-    }
-
-    size_t allowed_waste = p->allowed_waste_in_collection_set();
-    uint max_to_prune = num_candidates - min_old_cset_length;
-
-    while (true) {
-      G1HeapRegion* r = data[num_candidates - num_pruned - 1];
-      size_t const reclaimable = r->reclaimable_bytes();
-      if (num_pruned >= max_to_prune ||
-          wasted_bytes + reclaimable > allowed_waste) {
-        break;
-      }
-      r->rem_set()->clear(true /* cardset_only */);
-
-      wasted_bytes += reclaimable;
-      num_pruned++;
-    }
-
-    log_debug(gc, ergo, cset)("Pruned %u regions out of %u, leaving %zu bytes waste (allowed %zu)",
-                              num_pruned,
-                              num_candidates,
-                              wasted_bytes,
-                              allowed_waste);
-
-    _num_regions_added.sub_then_fetch(num_pruned, memory_order_relaxed);
-  }
-
-public:
-  G1BuildCandidateRegionsTask(uint max_num_regions, uint chunk_size, uint num_workers) :
-    WorkerTask("G1 Build Candidate Regions"),
-    _g1h(G1CollectedHeap::heap()),
-    _hrclaimer(num_workers),
-    _num_regions_added(0),
-    _result(max_num_regions, chunk_size, num_workers) { }
-
-  void work(uint worker_id) {
-    G1BuildCandidateRegionsClosure cl(&_result);
-    _g1h->heap_region_par_iterate_from_worker_offset(&cl, &_hrclaimer, worker_id);
-    update_totals(cl.regions_added());
-  }
-
-  void sort_and_prune_into(G1CollectionSetCandidates* candidates) {
-    _result.sort_by_gc_efficiency();
-    prune(_result.array());
-    candidates->set_candidates_from_marking(_result.array(),
-                                            _num_regions_added.load_relaxed());
-  }
-};
-
-uint G1CollectionSetChooser::calculate_work_chunk_size(uint num_workers, uint num_regions) {
-  assert(num_workers > 0, "Active gc workers should be greater than 0");
-  return MAX2(num_regions / num_workers, 1U);
-}
-
-void G1CollectionSetChooser::build(WorkerThreads* workers, uint max_num_regions, G1CollectionSetCandidates* candidates) {
-  uint num_workers = workers->active_workers();
-  uint chunk_size = calculate_work_chunk_size(num_workers, max_num_regions);
-
-  G1BuildCandidateRegionsTask cl(max_num_regions, chunk_size, num_workers);
-  workers->run_task(&cl, num_workers);
-
-  cl.sort_and_prune_into(candidates);
-  candidates->verify();
-}
diff --git a/src/hotspot/share/gc/g1/g1CollectionSetChooser.hpp b/src/hotspot/share/gc/g1/g1CollectionSetChooser.hpp
deleted file mode 100644
index 4db8ed23c49..00000000000
--- a/src/hotspot/share/gc/g1/g1CollectionSetChooser.hpp
+++ /dev/null
@@ -1,55 +0,0 @@
-/*
- * Copyright (c) 2001, 2025, Oracle and/or its affiliates. All rights reserved.
- * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
- *
- * This code is free software; you can redistribute it and/or modify it
- * under the terms of the GNU General Public License version 2 only, as
- * published by the Free Software Foundation.
- *
- * This code is distributed in the hope that it will be useful, but WITHOUT
- * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
- * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
- * version 2 for more details (a copy is included in the LICENSE file that
- * accompanied this code).
- *
- * You should have received a copy of the GNU General Public License version
- * 2 along with this work; if not, write to the Free Software Foundation,
- * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
- *
- * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
- * or visit www.oracle.com if you need additional information or have any
- * questions.
- *
- */
-
-#ifndef SHARE_GC_G1_G1COLLECTIONSETCHOOSER_HPP
-#define SHARE_GC_G1_G1COLLECTIONSETCHOOSER_HPP
-
-#include "gc/g1/g1HeapRegion.hpp"
-#include "gc/shared/gc_globals.hpp"
-#include "memory/allStatic.hpp"
-#include "runtime/globals.hpp"
-
-class G1CollectionSetCandidates;
-class WorkerThreads;
-
-// Helper class to calculate collection set candidates, and containing some related
-// methods.
-class G1CollectionSetChooser : public AllStatic {
-  static uint calculate_work_chunk_size(uint num_workers, uint num_regions);
-
-  static size_t mixed_gc_live_threshold_bytes() {
-    return G1HeapRegion::GrainBytes * (size_t)G1MixedGCLiveThresholdPercent / 100;
-  }
-
-public:
-  static bool region_occupancy_low_enough_for_evac(size_t live_bytes) {
-    return live_bytes < mixed_gc_live_threshold_bytes();
-  }
-
-  // Build and return set of collection set candidates sorted by decreasing gc
-  // efficiency.
-  static void build(WorkerThreads* workers, uint max_num_regions, G1CollectionSetCandidates* candidates);
-};
-
-#endif // SHARE_GC_G1_G1COLLECTIONSETCHOOSER_HPP
diff --git a/src/hotspot/share/gc/g1/g1ConcurrentMark.cpp b/src/hotspot/share/gc/g1/g1ConcurrentMark.cpp
index ab28feb520f..8fd355615d0 100644
--- a/src/hotspot/share/gc/g1/g1ConcurrentMark.cpp
+++ b/src/hotspot/share/gc/g1/g1ConcurrentMark.cpp
@@ -30,7 +30,6 @@
 #include "gc/g1/g1CardSetMemory.hpp"
 #include "gc/g1/g1CardTableClaimTable.inline.hpp"
 #include "gc/g1/g1CollectedHeap.inline.hpp"
-#include "gc/g1/g1CollectionSetChooser.hpp"
 #include "gc/g1/g1CollectorState.hpp"
 #include "gc/g1/g1ConcurrentMark.inline.hpp"
 #include "gc/g1/g1ConcurrentMarkRemarkTasks.hpp"
@@ -1328,14 +1327,13 @@ void G1ConcurrentMark::remark() {
       _g1h->workers()->run_task(&cl, num_workers);
 
       log_debug(gc, remset, tracking)("Remembered Set Tracking update regions total %u, selected %u",
-                                        _g1h->num_committed_regions(), cl.total_selected_for_rebuild());
+                                      _g1h->num_committed_regions(), cl.total_selected_for_rebuild());
 
       _needs_remembered_set_rebuild = (cl.total_selected_for_rebuild() > 0);
 
       if (_needs_remembered_set_rebuild) {
-        // Prune rebuild candidates based on G1HeapWastePercent.
-        // Improves rebuild time in addition to remembered set memory usage.
-        G1CollectionSetChooser::build(_g1h->workers(), _g1h->num_committed_regions(), _g1h->policy()->candidates());
+        GrowableArrayCHeap<G1HeapRegion*, mtGC>* selected = cl.sort_and_prune_old_selected();
+        _g1h->policy()->candidates()->set_candidates_from_marking(selected);
       }
     }
 
diff --git a/src/hotspot/share/gc/g1/g1ConcurrentMarkRemarkTasks.cpp b/src/hotspot/share/gc/g1/g1ConcurrentMarkRemarkTasks.cpp
index 4eb11f6d8f6..3eda7200e25 100644
--- a/src/hotspot/share/gc/g1/g1ConcurrentMarkRemarkTasks.cpp
+++ b/src/hotspot/share/gc/g1/g1ConcurrentMarkRemarkTasks.cpp
@@ -31,28 +31,32 @@
 #include "gc/g1/g1RemSetTrackingPolicy.hpp"
 #include "logging/log.hpp"
 #include "runtime/mutexLocker.hpp"
+#include "utilities/growableArray.hpp"
 
 struct G1UpdateRegionLivenessAndSelectForRebuildTask::G1OnRegionClosure : public G1HeapRegionClosure {
   G1CollectedHeap* _g1h;
   G1ConcurrentMark* _cm;
-  // The number of regions actually selected for rebuild.
-  uint _num_selected_for_rebuild;
 
   size_t _freed_bytes;
   uint _num_old_regions_removed;
   uint _num_humongous_regions_removed;
-  G1FreeRegionList* _local_cleanup_list;
+
+  GrowableArrayCHeap<G1HeapRegion*, mtGC> _old_selected_for_rebuild;
+  uint _num_humongous_selected_for_rebuild;
+
+  G1FreeRegionList* _cleanup_list;
 
   G1OnRegionClosure(G1CollectedHeap* g1h,
                     G1ConcurrentMark* cm,
                     G1FreeRegionList* local_cleanup_list) :
     _g1h(g1h),
     _cm(cm),
-    _num_selected_for_rebuild(0),
     _freed_bytes(0),
     _num_old_regions_removed(0),
     _num_humongous_regions_removed(0),
-    _local_cleanup_list(local_cleanup_list) {}
+    _old_selected_for_rebuild(16),
+    _num_humongous_selected_for_rebuild(0),
+    _cleanup_list(local_cleanup_list) {}
 
   void reclaim_empty_region_common(G1HeapRegion* hr) {
     assert(!hr->has_pinned_objects(), "precondition");
@@ -74,7 +78,7 @@ struct G1UpdateRegionLivenessAndSelectForRebuildTask::G1OnRegionClosure : public
 
       _num_humongous_regions_removed++;
       reclaim_empty_region_common(hr);
-      _g1h->free_humongous_region(hr, _local_cleanup_list);
+      _g1h->free_humongous_region(hr, _cleanup_list);
     };
 
     _g1h->humongous_obj_regions_iterate(hr, on_humongous_region);
@@ -85,7 +89,7 @@ struct G1UpdateRegionLivenessAndSelectForRebuildTask::G1OnRegionClosure : public
 
     _num_old_regions_removed++;
     reclaim_empty_region_common(hr);
-    _g1h->free_region(hr, _local_cleanup_list);
+    _g1h->free_region(hr, _cleanup_list);
   }
 
   bool do_heap_region(G1HeapRegion* hr) override {
@@ -98,13 +102,13 @@ struct G1UpdateRegionLivenessAndSelectForRebuildTask::G1OnRegionClosure : public
                         || hr->has_pinned_objects();
       if (is_live) {
         const bool selected_for_rebuild = tracker->update_humongous_before_rebuild(hr);
+
         auto on_humongous_region = [&] (G1HeapRegion* hr) {
           if (selected_for_rebuild) {
-            _num_selected_for_rebuild++;
+            _num_humongous_selected_for_rebuild++;
           }
           _cm->update_top_at_rebuild_start(hr);
         };
-
         _g1h->humongous_obj_regions_iterate(hr, on_humongous_region);
       } else {
         reclaim_empty_humongous_region(hr);
@@ -118,7 +122,7 @@ struct G1UpdateRegionLivenessAndSelectForRebuildTask::G1OnRegionClosure : public
       if (is_live) {
         const bool selected_for_rebuild = tracker->update_old_before_rebuild(hr);
         if (selected_for_rebuild) {
-          _num_selected_for_rebuild++;
+          _old_selected_for_rebuild.push(hr);
         }
         _cm->update_top_at_rebuild_start(hr);
       } else {
@@ -137,7 +141,8 @@ G1UpdateRegionLivenessAndSelectForRebuildTask::G1UpdateRegionLivenessAndSelectFo
   _g1h(g1h),
   _cm(cm),
   _hrclaimer(num_workers),
-  _total_selected_for_rebuild(0),
+  _old_selected_for_rebuild(128),
+  _num_humongous_selected_for_rebuild(0),
   _cleanup_list("Empty Regions After Mark List") {}
 
 G1UpdateRegionLivenessAndSelectForRebuildTask::~G1UpdateRegionLivenessAndSelectForRebuildTask() {
@@ -153,8 +158,6 @@ void G1UpdateRegionLivenessAndSelectForRebuildTask::work(uint worker_id) {
   G1OnRegionClosure on_region_cl(_g1h, _cm, &local_cleanup_list);
   _g1h->heap_region_par_iterate_from_worker_offset(&on_region_cl, &_hrclaimer, worker_id);
 
-  _total_selected_for_rebuild.add_then_fetch(on_region_cl._num_selected_for_rebuild);
-
   // Update the old/humongous region sets
   _g1h->remove_from_old_gen_sets(on_region_cl._num_old_regions_removed,
                                  on_region_cl._num_humongous_regions_removed);
@@ -163,6 +166,9 @@ void G1UpdateRegionLivenessAndSelectForRebuildTask::work(uint worker_id) {
     MutexLocker x(G1RareEvent_lock, Mutex::_no_safepoint_check_flag);
     _g1h->decrement_summary_bytes(on_region_cl._freed_bytes);
 
+    _old_selected_for_rebuild.appendAll(&on_region_cl._old_selected_for_rebuild);
+    _num_humongous_selected_for_rebuild += on_region_cl._num_humongous_selected_for_rebuild;
+
     _cleanup_list.add_ordered(&local_cleanup_list);
     assert(local_cleanup_list.is_empty(), "post-condition");
   }
@@ -172,3 +178,78 @@ uint G1UpdateRegionLivenessAndSelectForRebuildTask::desired_num_workers(uint num
   const uint num_regions_per_worker = 384;
   return (num_regions + num_regions_per_worker - 1) / num_regions_per_worker;
 }
+
+// Early prune (remove) regions meeting the G1HeapWastePercent criteria. That
+// is, either until only the minimum amount of old collection set regions are
+// available (for forward progress in evacuation) or the waste accumulated by the
+// removed regions is above the maximum allowed waste.
+// Updates number of candidates and reclaimable bytes given.
+void G1UpdateRegionLivenessAndSelectForRebuildTask::prune(GrowableArrayCHeap<G1HeapRegion*, mtGC>* old_regions) {
+  G1Policy* p = G1CollectedHeap::heap()->policy();
+
+  uint num_candidates = (uint)old_regions->length();
+
+  uint min_old_cset_length = p->calc_min_old_cset_length(num_candidates);
+  uint num_pruned = 0;
+  size_t wasted_bytes = 0;
+
+  if (min_old_cset_length >= num_candidates) {
+    // We take all of the candidate regions to provide some forward progress.
+    return;
+  }
+
+  size_t allowed_waste = p->allowed_waste_in_collection_set();
+  uint max_to_prune = num_candidates - min_old_cset_length;
+
+  while (true) {
+    G1HeapRegion* r = old_regions->at(num_candidates - num_pruned - 1);
+    size_t const reclaimable = r->reclaimable_bytes();
+    if (num_pruned >= max_to_prune ||
+      wasted_bytes + reclaimable > allowed_waste) {
+      break;
+    }
+    r->rem_set()->clear(true /* cardset_only */);
+
+    wasted_bytes += reclaimable;
+    num_pruned++;
+  }
+
+  log_debug(gc, ergo, cset)("Pruned %u regions out of %u, leaving %zu bytes waste (allowed %zu)",
+                            num_pruned,
+                            num_candidates,
+                            wasted_bytes,
+                            allowed_waste);
+
+  old_regions->trunc_to(num_candidates - num_pruned);
+}
+
+static int compare_region_gc_efficiency(G1HeapRegion** rr1, G1HeapRegion** rr2) {
+  G1HeapRegion* r1 = *rr1;
+  G1HeapRegion* r2 = *rr2;
+
+  assert(r1 != nullptr, "must be");
+  assert(r2 != nullptr, "must be");
+
+  G1Policy* p = G1CollectedHeap::heap()->policy();
+  double gc_efficiency1 = p->predict_gc_efficiency(r1);
+  double gc_efficiency2 = p->predict_gc_efficiency(r2);
+
+  if (gc_efficiency1 > gc_efficiency2) {
+    return -1;
+  } else if (gc_efficiency1 < gc_efficiency2) {
+    return 1;
+  } else {
+    return 0;
+  }
+}
+
+GrowableArrayCHeap<G1HeapRegion*, mtGC>* G1UpdateRegionLivenessAndSelectForRebuildTask::sort_and_prune_old_selected() {
+  // Nothing to do for the humongous candidates here. Old selected need to be pruned.
+
+  if (_old_selected_for_rebuild.length() != 0) {
+    _old_selected_for_rebuild.sort(compare_region_gc_efficiency);
+    prune(&_old_selected_for_rebuild);
+  }
+
+  return &_old_selected_for_rebuild;
+}
diff --git a/src/hotspot/share/gc/g1/g1ConcurrentMarkRemarkTasks.hpp b/src/hotspot/share/gc/g1/g1ConcurrentMarkRemarkTasks.hpp
index a256693ff1d..6905419e2cc 100644
--- a/src/hotspot/share/gc/g1/g1ConcurrentMarkRemarkTasks.hpp
+++ b/src/hotspot/share/gc/g1/g1ConcurrentMarkRemarkTasks.hpp
@@ -29,7 +29,7 @@
 #include "gc/g1/g1HeapRegionManager.hpp"
 #include "gc/g1/g1HeapRegionSet.hpp"
 #include "gc/shared/workerThread.hpp"
-#include "runtime/atomic.hpp"
+#include "utilities/growableArray.hpp"
 
 class G1CollectedHeap;
 class G1ConcurrentMark;
@@ -42,13 +42,15 @@ class G1UpdateRegionLivenessAndSelectForRebuildTask : public WorkerTask {
   G1ConcurrentMark* _cm;
   G1HeapRegionClaimer _hrclaimer;
 
-  Atomic<uint> _total_selected_for_rebuild;
+  GrowableArrayCHeap<G1HeapRegion*, mtGC> _old_selected_for_rebuild;
+  uint _num_humongous_selected_for_rebuild;
 
   // Reclaimed empty regions
   G1FreeRegionList _cleanup_list;
 
   struct G1OnRegionClosure;
 
+  void prune(GrowableArrayCHeap<G1HeapRegion*, mtGC>* old_regions);
 public:
   G1UpdateRegionLivenessAndSelectForRebuildTask(G1CollectedHeap* g1h,
                                                 G1ConcurrentMark* cm,
@@ -59,9 +61,14 @@ public:
   void work(uint worker_id) override;
 
   uint total_selected_for_rebuild() const {
-    return _total_selected_for_rebuild.load_relaxed();
+    return (uint)_old_selected_for_rebuild.length() + _num_humongous_selected_for_rebuild;
   }
 
+  // Sort selected old regions by efficiency and prune them based on G1HeapWastePercent.
+  // This pruning improves rebuild time in addition to remembered set memory usage.
+  // Returns the set of regions selected in efficiency order.
+  GrowableArrayCHeap<G1HeapRegion*, mtGC>* sort_and_prune_old_selected();
+
   static uint desired_num_workers(uint num_regions);
 };
 
diff --git a/src/hotspot/share/gc/g1/g1Policy.cpp b/src/hotspot/share/gc/g1/g1Policy.cpp
index 1fa5aa877c0..09043c92722 100644
--- a/src/hotspot/share/gc/g1/g1Policy.cpp
+++ b/src/hotspot/share/gc/g1/g1Policy.cpp
@@ -28,7 +28,6 @@
 #include "gc/g1/g1CollectedHeap.inline.hpp"
 #include "gc/g1/g1CollectionSet.hpp"
 #include "gc/g1/g1CollectionSetCandidates.inline.hpp"
-#include "gc/g1/g1CollectionSetChooser.hpp"
 #include "gc/g1/g1ConcurrentMark.hpp"
 #include "gc/g1/g1ConcurrentMarkThread.inline.hpp"
 #include "gc/g1/g1ConcurrentRefine.hpp"
diff --git a/src/hotspot/share/gc/g1/g1RemSetTrackingPolicy.cpp b/src/hotspot/share/gc/g1/g1RemSetTrackingPolicy.cpp
index 0c9973c520d..94f5466b8e0 100644
--- a/src/hotspot/share/gc/g1/g1RemSetTrackingPolicy.cpp
+++ b/src/hotspot/share/gc/g1/g1RemSetTrackingPolicy.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,12 +23,16 @@
  */
 
 #include "gc/g1/g1CollectedHeap.inline.hpp"
-#include "gc/g1/g1CollectionSetChooser.hpp"
 #include "gc/g1/g1HeapRegion.inline.hpp"
 #include "gc/g1/g1HeapRegionRemSet.inline.hpp"
 #include "gc/g1/g1RemSetTrackingPolicy.hpp"
 #include "runtime/safepoint.hpp"
 
+static bool region_occupancy_low_enough_for_evac(size_t live_bytes) {
+  size_t mixed_gc_live_threshold_bytes = G1HeapRegion::GrainBytes * (size_t)G1MixedGCLiveThresholdPercent / 100;
+  return live_bytes < mixed_gc_live_threshold_bytes;
+}
+
 void G1RemSetTrackingPolicy::update_at_allocate(G1HeapRegion* r) {
   assert(r->is_young() || r->is_humongous() || r->is_old(),
         "Region %u with unexpected heap region type %s", r->hrm_index(), r->get_type_str());
@@ -75,7 +79,8 @@ bool G1RemSetTrackingPolicy::update_old_before_rebuild(G1HeapRegion* r) {
 
   bool selected_for_rebuild = false;
 
-  if (G1CollectionSetChooser::region_occupancy_low_enough_for_evac(r->live_bytes()) &&
+  if (region_occupancy_low_enough_for_evac(r->live_bytes()) &&
+      !G1CollectedHeap::heap()->is_old_gc_alloc_region(r) &&
       !r->rem_set()->is_tracked()) {
     r->rem_set()->set_state_updating();
     selected_for_rebuild = true;

From c436802bcefcdac53cefe7b7c40d06e56884e132 Mon Sep 17 00:00:00 2001
From: Ashutosh Mehra <asmehra@openjdk.org>
Date: Mon, 23 Mar 2026 14:17:11 +0000
Subject: [PATCH 304/655] 8380168: Obsolete unused flag UseNewLongLShift

Reviewed-by: kvn, stuefe
---
 src/hotspot/cpu/x86/globals_x86.hpp     | 3 ---
 src/hotspot/cpu/x86/vm_version_x86.cpp  | 4 ----
 src/hotspot/share/runtime/arguments.cpp | 2 ++
 3 files changed, 2 insertions(+), 7 deletions(-)

diff --git a/src/hotspot/cpu/x86/globals_x86.hpp b/src/hotspot/cpu/x86/globals_x86.hpp
index 084793dc262..6de46752790 100644
--- a/src/hotspot/cpu/x86/globals_x86.hpp
+++ b/src/hotspot/cpu/x86/globals_x86.hpp
@@ -117,9 +117,6 @@ define_pd_global(intx, InitArrayShortSize, 8*BytesPerLong);
   product(bool, UseIncDec, true, DIAGNOSTIC,                                \
           "Use INC, DEC instructions on x86")                               \
                                                                             \
-  product(bool, UseNewLongLShift, false,                                    \
-          "Use optimized bitwise shift left")                               \
-                                                                            \
   product(bool, UseAddressNop, false,                                       \
           "Use '0F 1F [addr]' NOP instructions on x86 cpus")                \
                                                                             \
diff --git a/src/hotspot/cpu/x86/vm_version_x86.cpp b/src/hotspot/cpu/x86/vm_version_x86.cpp
index 747d662f668..4301bd328d6 100644
--- a/src/hotspot/cpu/x86/vm_version_x86.cpp
+++ b/src/hotspot/cpu/x86/vm_version_x86.cpp
@@ -1525,10 +1525,6 @@ void VM_Version::get_processor_features() {
       // Use it on new AMD cpus starting from Opteron.
       UseAddressNop = true;
     }
-    if (supports_sse2() && FLAG_IS_DEFAULT(UseNewLongLShift)) {
-      // Use it on new AMD cpus starting from Opteron.
-      UseNewLongLShift = true;
-    }
     if (FLAG_IS_DEFAULT(UseXmmLoadAndClearUpper)) {
       if (supports_sse4a()) {
         UseXmmLoadAndClearUpper = true; // use movsd only on '10h' Opteron
diff --git a/src/hotspot/share/runtime/arguments.cpp b/src/hotspot/share/runtime/arguments.cpp
index b853349242c..dac34017e45 100644
--- a/src/hotspot/share/runtime/arguments.cpp
+++ b/src/hotspot/share/runtime/arguments.cpp
@@ -555,6 +555,8 @@ static SpecialFlag const special_jvm_flags[] = {
   { "NeverActAsServerClassMachine", JDK_Version::jdk(26),  JDK_Version::jdk(27), JDK_Version::jdk(28) },
   { "AlwaysActAsServerClassMachine", JDK_Version::jdk(26),  JDK_Version::jdk(27), JDK_Version::jdk(28) },
   { "UseXMMForArrayCopy",           JDK_Version::undefined(), JDK_Version::jdk(27), JDK_Version::jdk(28) },
+  { "UseNewLongLShift",             JDK_Version::undefined(), JDK_Version::jdk(27), JDK_Version::jdk(28) },
+
 #ifdef ASSERT
   { "DummyObsoleteTestFlag",        JDK_Version::undefined(), JDK_Version::jdk(18), JDK_Version::undefined() },
 #endif

From 890d62bb8c6ed772a8bdf141856f86992818f264 Mon Sep 17 00:00:00 2001
From: Albert Mingkun Yang <ayang@openjdk.org>
Date: Mon, 23 Mar 2026 14:40:18 +0000
Subject: [PATCH 305/655] 8380564: Parallel: Rename allocate to
 cas_allocate_with_expansion in PSOldGen

Reviewed-by: tschatzl, jsikstro
---
 src/hotspot/share/gc/parallel/parallelScavengeHeap.cpp      | 2 +-
 src/hotspot/share/gc/parallel/psOldGen.hpp                  | 2 +-
 src/hotspot/share/gc/parallel/psPromotionManager.inline.hpp | 4 ++--
 3 files changed, 4 insertions(+), 4 deletions(-)

diff --git a/src/hotspot/share/gc/parallel/parallelScavengeHeap.cpp b/src/hotspot/share/gc/parallel/parallelScavengeHeap.cpp
index 337b2ccdd10..b77294a2ac1 100644
--- a/src/hotspot/share/gc/parallel/parallelScavengeHeap.cpp
+++ b/src/hotspot/share/gc/parallel/parallelScavengeHeap.cpp
@@ -932,7 +932,7 @@ void ParallelScavengeHeap::resize_after_full_gc() {
 }
 
 HeapWord* ParallelScavengeHeap::allocate_loaded_archive_space(size_t size) {
-  return _old_gen->allocate(size);
+  return _old_gen->cas_allocate_with_expansion(size);
 }
 
 void ParallelScavengeHeap::complete_loaded_archive_space(MemRegion archive_space) {
diff --git a/src/hotspot/share/gc/parallel/psOldGen.hpp b/src/hotspot/share/gc/parallel/psOldGen.hpp
index 7e3975036d4..c8e6ada3ebd 100644
--- a/src/hotspot/share/gc/parallel/psOldGen.hpp
+++ b/src/hotspot/share/gc/parallel/psOldGen.hpp
@@ -110,7 +110,7 @@ class PSOldGen : public CHeapObj<mtGC> {
   void shrink(size_t bytes);
 
   // Used by GC-workers during GC or for CDS at startup.
-  HeapWord* allocate(size_t word_size) {
+  HeapWord* cas_allocate_with_expansion(size_t word_size) {
     HeapWord* res;
     do {
       res = cas_allocate_noexpand(word_size);
diff --git a/src/hotspot/share/gc/parallel/psPromotionManager.inline.hpp b/src/hotspot/share/gc/parallel/psPromotionManager.inline.hpp
index 9e904e44b22..68370a33a54 100644
--- a/src/hotspot/share/gc/parallel/psPromotionManager.inline.hpp
+++ b/src/hotspot/share/gc/parallel/psPromotionManager.inline.hpp
@@ -204,13 +204,13 @@ inline HeapWord* PSPromotionManager::allocate_in_old_gen(Klass* klass,
   // Do we allocate directly, or flush and refill?
   if (obj_size > (OldPLABSize / 2)) {
     // Allocate this object directly
-    result = old_gen()->allocate(obj_size);
+    result = old_gen()->cas_allocate_with_expansion(obj_size);
     promotion_trace_event(cast_to_oop(result), klass, obj_size, age, true, nullptr);
   } else {
     // Flush and fill
     _old_lab.flush();
 
-    HeapWord* lab_base = old_gen()->allocate(OldPLABSize);
+    HeapWord* lab_base = old_gen()->cas_allocate_with_expansion(OldPLABSize);
     if (lab_base != nullptr) {
       _old_lab.initialize(MemRegion(lab_base, OldPLABSize));
       // Try the old lab allocation again.

From 00ee63e99e4d81ab522bd3fca5c42a5a3d7a830e Mon Sep 17 00:00:00 2001
From: Ashay Rane <253344819+raneashay@users.noreply.github.com>
Date: Mon, 23 Mar 2026 14:58:17 +0000
Subject: [PATCH 306/655] 8380475: C2: Improve AndNode::Identity with KnownBits

Reviewed-by: mchevalier, qamai
---
 src/hotspot/share/opto/mulnode.cpp            |  73 +--
 .../compiler/c2/irTests/TestShiftAndMask.java | 422 ++++++++++--------
 2 files changed, 256 insertions(+), 239 deletions(-)

diff --git a/src/hotspot/share/opto/mulnode.cpp b/src/hotspot/share/opto/mulnode.cpp
index b0aef9b165e..d7022b5f7ec 100644
--- a/src/hotspot/share/opto/mulnode.cpp
+++ b/src/hotspot/share/opto/mulnode.cpp
@@ -651,31 +651,19 @@ Node* AndINode::Identity(PhaseGVN* phase) {
     return in(1);
   }
 
-  Node* in1 = in(1);
-  uint op = in1->Opcode();
-  const TypeInt* t2 = phase->type(in(2))->isa_int();
-  if (t2 && t2->is_con()) {
-    int con = t2->get_con();
-    // Masking off high bits which are always zero is useless.
-    const TypeInt* t1 = phase->type(in(1))->isa_int();
-    if (t1 != nullptr && t1->_lo >= 0) {
-      jint t1_support = right_n_bits(1 + log2i_graceful(t1->_hi));
-      if ((t1_support & con) == t1_support)
-        return in1;
-    }
-    // Masking off the high bits of a unsigned-shift-right is not
-    // needed either.
-    if (op == Op_URShiftI) {
-      const TypeInt* t12 = phase->type(in1->in(2))->isa_int();
-      if (t12 && t12->is_con()) {  // Shift is by a constant
-        int shift = t12->get_con();
-        shift &= BitsPerJavaInteger - 1;  // semantics of Java shifts
-        int mask = max_juint >> shift;
-        if ((mask & con) == mask)  // If AND is useless, skip it
-          return in1;
-      }
-    }
+  const TypeInt* t1 = phase->type(in(1))->is_int();
+  const TypeInt* t2 = phase->type(in(2))->is_int();
+
+  if ((~t1->_bits._ones & ~t2->_bits._zeros) == 0) {
+    // All bits that might be 0 in in1 are known to be 0 in in2
+    return in(2);
   }
+
+  if ((~t2->_bits._ones & ~t1->_bits._zeros) == 0) {
+    // All bits that might be 0 in in2 are known to be 0 in in1
+    return in(1);
+  }
+
   return MulNode::Identity(phase);
 }
 
@@ -779,32 +767,19 @@ Node* AndLNode::Identity(PhaseGVN* phase) {
     return in(1);
   }
 
-  Node *usr = in(1);
-  const TypeLong *t2 = phase->type( in(2) )->isa_long();
-  if( t2 && t2->is_con() ) {
-    jlong con = t2->get_con();
-    // Masking off high bits which are always zero is useless.
-    const TypeLong* t1 = phase->type( in(1) )->isa_long();
-    if (t1 != nullptr && t1->_lo >= 0) {
-      int bit_count = log2i_graceful(t1->_hi) + 1;
-      jlong t1_support = jlong(max_julong >> (BitsPerJavaLong - bit_count));
-      if ((t1_support & con) == t1_support)
-        return usr;
-    }
-    uint lop = usr->Opcode();
-    // Masking off the high bits of a unsigned-shift-right is not
-    // needed either.
-    if( lop == Op_URShiftL ) {
-      const TypeInt *t12 = phase->type( usr->in(2) )->isa_int();
-      if( t12 && t12->is_con() ) {  // Shift is by a constant
-        int shift = t12->get_con();
-        shift &= BitsPerJavaLong - 1;  // semantics of Java shifts
-        jlong mask = max_julong >> shift;
-        if( (mask&con) == mask )  // If AND is useless, skip it
-          return usr;
-      }
-    }
+  const TypeLong* t1 = phase->type(in(1))->is_long();
+  const TypeLong* t2 = phase->type(in(2))->is_long();
+
+  if ((~t1->_bits._ones & ~t2->_bits._zeros) == 0) {
+    // All bits that might be 0 in in1 are known to be 0 in in2
+    return in(2);
   }
+
+  if ((~t2->_bits._ones & ~t1->_bits._zeros) == 0) {
+    // All bits that might be 0 in in2 are known to be 0 in in1
+    return in(1);
+  }
+
   return MulNode::Identity(phase);
 }
 
diff --git a/test/hotspot/jtreg/compiler/c2/irTests/TestShiftAndMask.java b/test/hotspot/jtreg/compiler/c2/irTests/TestShiftAndMask.java
index 1413ee0cafa..8f798a1b7eb 100644
--- a/test/hotspot/jtreg/compiler/c2/irTests/TestShiftAndMask.java
+++ b/test/hotspot/jtreg/compiler/c2/irTests/TestShiftAndMask.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2021, 2025, Red Hat, Inc. All rights reserved.
+ * Copyright (c) 2021, 2026, Red Hat, Inc. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -24,13 +24,14 @@
 package compiler.c2.irTests;
 
 import compiler.lib.ir_framework.*;
-import jdk.test.lib.Utils;
-import java.util.Random;
+import static compiler.lib.generators.Generators.G;
+import jdk.test.lib.Asserts;
+
 import java.util.Objects;
 
 /*
  * @test
- * @bug 8277850 8278949 8285793 8346664
+ * @bug 8277850 8278949 8285793 8346664 8380475
  * @key randomness
  * @summary C2: optimize mask checks in counted loops
  * @library /test/lib /
@@ -38,33 +39,31 @@ import java.util.Objects;
  */
 
 public class TestShiftAndMask {
-    private static final Random RANDOM = Utils.getRandomInstance();
-
     public static void main(String[] args) {
         TestFramework.run();
     }
 
     // any X << INT_MASK_WIDTH is zero under any INT_MASK
-    static final int INT_MASK_WIDTH = 1 + RANDOM.nextInt(30);
+    static final int INT_MASK_WIDTH = G.ints().restricted(1, 30).next();
     static final int INT_MAX_MASK = (1 << INT_MASK_WIDTH) - 1;
-    static final int INT_MASK = 1 + RANDOM.nextInt(INT_MAX_MASK);
-    static final int INT_MASK2 = 1 + RANDOM.nextInt(INT_MAX_MASK);
-    static final int INT_ZERO_CONST = RANDOM.nextInt() << INT_MASK_WIDTH;
+    static final int INT_MASK = G.ints().restricted(1, INT_MAX_MASK).next();
+    static final int INT_MASK2 = G.ints().restricted(1, INT_MAX_MASK).next();
+    static final int INT_ZERO_CONST = G.ints().next() << INT_MASK_WIDTH;
 
-    static final int INT_RANDOM_CONST = RANDOM.nextInt();
-    static final int INT_RANDOM_SHIFT = RANDOM.nextInt();
-    static final int INT_RANDOM_MASK = RANDOM.nextInt();
+    static final int INT_RANDOM_CONST = G.ints().next();
+    static final int INT_RANDOM_SHIFT = G.ints().next();
+    static final int INT_RANDOM_MASK = G.ints().next();
 
     // any X << LONG_MASK_WIDTH is zero under any LONG_MASK
-    static final int LONG_MASK_WIDTH = 1 + RANDOM.nextInt(62);
+    static final int LONG_MASK_WIDTH = G.ints().restricted(1, 62).next();
     static final long LONG_MAX_MASK = (1L << LONG_MASK_WIDTH) - 1;
-    static final long LONG_MASK = 1 + RANDOM.nextLong(LONG_MAX_MASK);
-    static final long LONG_MASK2 = 1 + RANDOM.nextLong(LONG_MAX_MASK);
-    static final long LONG_ZERO_CONST = RANDOM.nextLong() << LONG_MASK_WIDTH;
+    static final long LONG_MASK = G.longs().restricted(1L, LONG_MAX_MASK).next();
+    static final long LONG_MASK2 = G.longs().restricted(1L, LONG_MAX_MASK).next();
+    static final long LONG_ZERO_CONST = G.longs().next() << LONG_MASK_WIDTH;
 
-    static final long LONG_RANDOM_CONST = RANDOM.nextLong();
-    static final long LONG_RANDOM_SHIFT = RANDOM.nextLong();
-    static final long LONG_RANDOM_MASK = RANDOM.nextLong();
+    static final long LONG_RANDOM_CONST = G.longs().next();
+    static final long LONG_RANDOM_SHIFT = G.longs().next();
+    static final long LONG_RANDOM_MASK = G.longs().next();
 
     @Test
     public static int intSumAndMask(int i, int j) {
@@ -73,12 +72,9 @@ public class TestShiftAndMask {
 
     @Run(test = { "intSumAndMask" })
     public static void checkIntSumAndMask() {
-        int j = RANDOM.nextInt();
-        int i = RANDOM.nextInt();
-        int res = intSumAndMask(i, j);
-        if (res != ((j + i << INT_RANDOM_SHIFT + INT_RANDOM_CONST) & INT_RANDOM_MASK)) {
-            throw new RuntimeException("incorrect result: " + res);
-        }
+        int j = G.ints().next();
+        int i = G.ints().next();
+        Asserts.assertEquals(intSumAndMask(i, j), (j + i << INT_RANDOM_SHIFT + INT_RANDOM_CONST) & INT_RANDOM_MASK);
     }
 
     @Test
@@ -90,9 +86,7 @@ public class TestShiftAndMask {
 
     @Check(test = "shiftMaskInt")
     public static void checkShiftMaskInt(int res) {
-        if (res != 0) {
-            throw new RuntimeException("incorrect result: " + res);
-        }
+        Asserts.assertEquals(res, 0);
     }
 
     @Test
@@ -102,12 +96,9 @@ public class TestShiftAndMask {
 
     @Run(test = { "longSumAndMask" })
     public static void checkLongSumAndMask() {
-        long j = RANDOM.nextLong();
-        long i = RANDOM.nextLong();
-        long res = longSumAndMask(i, j);
-        if (res != ((j + i << LONG_RANDOM_SHIFT + LONG_RANDOM_CONST) & LONG_RANDOM_MASK)) {
-            throw new RuntimeException("incorrect result: " + res);
-        }
+        long j = G.longs().next();
+        long i = G.longs().next();
+        Asserts.assertEquals(longSumAndMask(i, j), (j + i << LONG_RANDOM_SHIFT + LONG_RANDOM_CONST) & LONG_RANDOM_MASK);
     }
 
     @Test
@@ -120,9 +111,7 @@ public class TestShiftAndMask {
 
     @Check(test = "shiftMaskLong")
     public static void checkShiftMaskLong(long res) {
-        if (res != 0) {
-            throw new RuntimeException("incorrect result: " + res);
-        }
+        Asserts.assertEquals(res, 0L);
     }
 
     static volatile int barrier;
@@ -143,9 +132,7 @@ public class TestShiftAndMask {
 
     @Check(test = "shiftNonConstMaskInt")
     public static void checkShiftNonConstMaskInt(int res) {
-        if (res != 0) {
-            throw new RuntimeException("incorrect result: " + res);
-        }
+        Asserts.assertEquals(res, 0);
     }
 
     @Test
@@ -164,9 +151,7 @@ public class TestShiftAndMask {
 
     @Check(test = "shiftNonConstMaskLong")
     public static void checkShiftNonConstMaskLong(long res) {
-        if (res != 0) {
-            throw new RuntimeException("incorrect result: " + res);
-        }
+        Asserts.assertEquals(res, 0L);
     }
 
     @Test
@@ -178,12 +163,9 @@ public class TestShiftAndMask {
 
     @Run(test = "addShiftMaskInt")
     public static void addShiftMaskInt_runner() {
-        int i = RANDOM.nextInt();
-        int j = RANDOM.nextInt();
-        int res = addShiftMaskInt(i, j);
-        if (res != (j & INT_MASK)) {
-            throw new RuntimeException("incorrect result: " + res);
-        }
+        int i = G.ints().next();
+        int j = G.ints().next();
+        Asserts.assertEquals(addShiftMaskInt(i, j), j & INT_MASK);
     }
 
     @Test
@@ -195,12 +177,9 @@ public class TestShiftAndMask {
 
     @Run(test = "addShiftPlusConstMaskInt")
     public static void addShiftPlusConstMaskInt_runner() {
-        int i = RANDOM.nextInt();
-        int j = RANDOM.nextInt();
-        int res = addShiftPlusConstMaskInt(i, j);
-        if (res != (j & INT_MASK)) {
-            throw new RuntimeException("incorrect result: " + res);
-        }
+        int i = G.ints().next();
+        int j = G.ints().next();
+        Asserts.assertEquals(addShiftPlusConstMaskInt(i, j), j & INT_MASK);
     }
 
     @Test
@@ -233,16 +212,10 @@ public class TestShiftAndMask {
 
     @Run(test = "addSshiftNonConstMaskInt")
     public static void addSshiftNonConstMaskInt_runner() {
-        int i = RANDOM.nextInt();
-        int j = RANDOM.nextInt();
-        int res = addSshiftNonConstMaskInt(i, j, true);
-        if (res != (j & INT_MASK)) {
-            throw new RuntimeException("incorrect result: " + res);
-        }
-        res = addSshiftNonConstMaskInt(i, j, false);
-        if (res != (j & INT_MASK2)) {
-            throw new RuntimeException("incorrect result: " + res);
-        }
+        int i = G.ints().next();
+        int j = G.ints().next();
+        Asserts.assertEquals(addSshiftNonConstMaskInt(i, j, true), j & INT_MASK);
+        Asserts.assertEquals(addSshiftNonConstMaskInt(i, j, false), j & INT_MASK2);
     }
 
     @Test
@@ -261,15 +234,9 @@ public class TestShiftAndMask {
 
     @Run(test = "addConstNonConstMaskInt")
     public static void addConstNonConstMaskInt_runner() {
-        int j = RANDOM.nextInt();
-        int res = addConstNonConstMaskInt(j, true);
-        if (res != (j & INT_MASK)) {
-            throw new RuntimeException("incorrect result: " + res);
-        }
-        res = addConstNonConstMaskInt(j, false);
-        if (res != (j & INT_MASK2)) {
-            throw new RuntimeException("incorrect result: " + res);
-        }
+        int j = G.ints().next();
+        Asserts.assertEquals(addConstNonConstMaskInt(j, true), j & INT_MASK);
+        Asserts.assertEquals(addConstNonConstMaskInt(j, false), j & INT_MASK2);
     }
 
     @Test
@@ -281,12 +248,9 @@ public class TestShiftAndMask {
 
     @Run(test = "addShiftMaskLong")
     public static void addShiftMaskLong_runner() {
-        long i = RANDOM.nextLong();
-        long j = RANDOM.nextLong();
-        long res = addShiftMaskLong(i, j);
-        if (res != (j & LONG_MASK)) {
-            throw new RuntimeException("incorrect result: " + res);
-        }
+        long i = G.longs().next();
+        long j = G.longs().next();
+        Asserts.assertEquals(addShiftMaskLong(i, j), j & LONG_MASK);
     }
 
     @Test
@@ -298,12 +262,9 @@ public class TestShiftAndMask {
 
     @Run(test = "addShiftPlusConstMaskLong")
     public static void addShiftPlusConstMaskLong_runner() {
-        long i = RANDOM.nextLong();
-        long j = RANDOM.nextLong();
-        long res = addShiftPlusConstMaskLong(i, j);
-        if (res != (j & LONG_MASK)) {
-            throw new RuntimeException("incorrect result: " + res);
-        }
+        long i = G.longs().next();
+        long j = G.longs().next();
+        Asserts.assertEquals(addShiftPlusConstMaskLong(i, j), j & LONG_MASK);
     }
 
     @Test
@@ -322,16 +283,10 @@ public class TestShiftAndMask {
 
     @Run(test = "addSshiftNonConstMaskLong")
     public static void addSshiftNonConstMaskLong_runner() {
-        long i = RANDOM.nextLong();
-        long j = RANDOM.nextLong();
-        long res = addSshiftNonConstMaskLong(i, j, true);
-        if (res != (j & LONG_MASK)) {
-            throw new RuntimeException("incorrect result: " + res);
-        }
-        res = addSshiftNonConstMaskLong(i, j, false);
-        if (res != (j & LONG_MASK2)) {
-            throw new RuntimeException("incorrect result: " + res);
-        }
+        long i = G.longs().next();
+        long j = G.longs().next();
+        Asserts.assertEquals(addSshiftNonConstMaskLong(i, j, true), j & LONG_MASK);
+        Asserts.assertEquals(addSshiftNonConstMaskLong(i, j, false), j & LONG_MASK2);
     }
 
     @Test
@@ -350,15 +305,9 @@ public class TestShiftAndMask {
 
     @Run(test = "addConstNonConstMaskLong")
     public static void addConstNonConstMaskLong_runner() {
-        long j = RANDOM.nextLong();
-        long res = addConstNonConstMaskLong(j, true);
-        if (res != (j & LONG_MASK)) {
-            throw new RuntimeException("incorrect result: " + res);
-        }
-        res = addConstNonConstMaskLong(j, false);
-        if (res != (j & LONG_MASK2)) {
-            throw new RuntimeException("incorrect result: " + res);
-        }
+        long j = G.longs().next();
+        Asserts.assertEquals(addConstNonConstMaskLong(j, true), j & LONG_MASK);
+        Asserts.assertEquals(addConstNonConstMaskLong(j, false), j & LONG_MASK2);
     }
 
     @Test
@@ -370,9 +319,7 @@ public class TestShiftAndMask {
 
     @Check(test = "addShiftMaskInt2")
     public static void checkAddShiftMaskInt2(int res) {
-        if (res != 0) {
-            throw new RuntimeException("incorrect result: " + res);
-        }
+        Asserts.assertEquals(res, 0);
     }
 
     @Test
@@ -384,9 +331,7 @@ public class TestShiftAndMask {
 
     @Check(test = "addShiftMaskLong2")
     public static void checkAddShiftMaskLong2(long res) {
-        if (res != 0) {
-            throw new RuntimeException("incorrect result: " + res);
-        }
+        Asserts.assertEquals(res, 0L);
     }
 
     // Try to get add inputs swapped compared to other tests
@@ -401,12 +346,9 @@ public class TestShiftAndMask {
 
     @Run(test = "addShiftMaskInt3")
     public static void addShiftMaskInt3_runner() {
-        int i = RANDOM.nextInt();
-        int j = RANDOM.nextInt();
-        int res = addShiftMaskInt3(i, j);
-        if (res != (j & INT_MASK)) {
-            throw new RuntimeException("incorrect result: " + res);
-        }
+        int i = G.ints().next();
+        int j = G.ints().next();
+        Asserts.assertEquals(addShiftMaskInt3(i, j), j & INT_MASK);
     }
 
     @Test
@@ -420,12 +362,9 @@ public class TestShiftAndMask {
 
     @Run(test = "addShiftMaskLong3")
     public static void addShiftMaskLong3_runner() {
-        long i = RANDOM.nextLong();
-        float j = RANDOM.nextFloat();
-        long res = addShiftMaskLong3(i, j);
-        if (res != (((long) j) & LONG_MASK)) {
-            throw new RuntimeException("incorrect result: " + res);
-        }
+        long i = G.longs().next();
+        float j = G.floats().next();
+        Asserts.assertEquals(addShiftMaskLong3(i, j), ((long) j) & LONG_MASK);
     }
 
     @Test
@@ -437,9 +376,7 @@ public class TestShiftAndMask {
 
     @Check(test = "shiftConvMask")
     public static void checkShiftConvMask(long res) {
-        if (res != 0) {
-            throw new RuntimeException("incorrect result: " + res);
-        }
+        Asserts.assertEquals(res, 0L);
     }
 
     @Test
@@ -458,9 +395,7 @@ public class TestShiftAndMask {
 
     @Check(test = "shiftNotConstConvMask")
     public static void checkShiftNotConstConvMask(long res) {
-        if (res != 0) {
-            throw new RuntimeException("incorrect result: " + res);
-        }
+        Asserts.assertEquals(res, 0L);
     }
 
     @Test
@@ -472,12 +407,9 @@ public class TestShiftAndMask {
 
     @Run(test = "addShiftConvMask")
     public static void addShiftConvMask_runner() {
-        int i = RANDOM.nextInt();
-        long j = RANDOM.nextLong();
-        long res = addShiftConvMask(i, j);
-        if (res != (j & INT_MASK)) {
-            throw new RuntimeException("incorrect result: " + res);
-        }
+        int i = G.ints().next();
+        long j = G.longs().next();
+        Asserts.assertEquals(addShiftConvMask(i, j), j & INT_MASK);
     }
 
     @Test
@@ -489,9 +421,7 @@ public class TestShiftAndMask {
 
     @Check(test = "addShiftConvMask2")
     public static void checkAddShiftConvMask2(long res) {
-        if (res != 0) {
-            throw new RuntimeException("incorrect result: " + res);
-        }
+        Asserts.assertEquals(res, 0L);
     }
 
     @Test
@@ -502,11 +432,8 @@ public class TestShiftAndMask {
 
     @Run(test = "shiftMaskIntCheckIndex")
     public static void shiftMaskIntCheckIndex_runner() {
-        int i = RANDOM.nextInt((Integer.MAX_VALUE - 1) >> INT_MASK_WIDTH);
-        int res = shiftMaskIntCheckIndex(i, (i << INT_MASK_WIDTH) + 1);
-        if (res != 0) {
-            throw new RuntimeException("incorrect result: " + res);
-        }
+        int i = G.uniformInts(0, ((Integer.MAX_VALUE - 1) >> INT_MASK_WIDTH) - 1).next();
+        Asserts.assertEquals(shiftMaskIntCheckIndex(i, (i << INT_MASK_WIDTH) + 1), 0);
     }
 
     @Test
@@ -517,11 +444,8 @@ public class TestShiftAndMask {
 
     @Run(test = "shiftMaskLongCheckIndex")
     public static void shiftMaskLongCheckIndex_runner() {
-        long i = RANDOM.nextLong((Long.MAX_VALUE - 1) >> LONG_MASK_WIDTH);
-        long res = shiftMaskLongCheckIndex(i, (i << LONG_MASK_WIDTH) + 1);
-        if (res != 0) {
-            throw new RuntimeException("incorrect result: " + res);
-        }
+        long i = G.uniformLongs(0L, ((Long.MAX_VALUE - 1) >> LONG_MASK_WIDTH) - 1).next();
+        Asserts.assertEquals(shiftMaskLongCheckIndex(i, (i << LONG_MASK_WIDTH) + 1), 0L);
     }
 
     @Test
@@ -533,12 +457,9 @@ public class TestShiftAndMask {
 
     @Run(test = "addShiftMaskIntCheckIndex")
     public static void addShiftMaskIntCheckIndex_runner() {
-        int i = RANDOM.nextInt((Integer.MAX_VALUE - 1) >> INT_MASK_WIDTH);
-        int j = RANDOM.nextInt();
-        int res = addShiftMaskIntCheckIndex(i, j, (i << INT_MASK_WIDTH) + 1);
-        if (res != (j & INT_MASK)) {
-            throw new RuntimeException("incorrect result: " + res);
-        }
+        int i = G.uniformInts(0, ((Integer.MAX_VALUE - 1) >> INT_MASK_WIDTH) - 1).next();
+        int j = G.ints().next();
+        Asserts.assertEquals(addShiftMaskIntCheckIndex(i, j, (i << INT_MASK_WIDTH) + 1), j & INT_MASK);
     }
 
     @Test
@@ -550,12 +471,9 @@ public class TestShiftAndMask {
 
     @Run(test = "addShiftMaskLongCheckIndex")
     public static void addShiftMaskLongCheckIndex_runner() {
-        long i = RANDOM.nextLong((Long.MAX_VALUE - 1) >> LONG_MASK_WIDTH);
-        long j = RANDOM.nextLong();
-        long res = addShiftMaskLongCheckIndex(i, j, (i << LONG_MASK_WIDTH) + 1);
-        if (res != (j & LONG_MASK)) {
-            throw new RuntimeException("incorrect result: " + res);
-        }
+        long i = G.uniformLongs(0L, ((Long.MAX_VALUE - 1) >> LONG_MASK_WIDTH) - 1).next();
+        long j = G.longs().next();
+        Asserts.assertEquals(addShiftMaskLongCheckIndex(i, j, (i << LONG_MASK_WIDTH) + 1), j & LONG_MASK);
     }
 
     @Test
@@ -567,12 +485,9 @@ public class TestShiftAndMask {
 
     @Run(test = "addShiftMaskIntCheckIndex2")
     public static void addShiftMaskIntCheckIndex2_runner() {
-        int i = RANDOM.nextInt((Integer.MAX_VALUE - 1) >> INT_MASK_WIDTH);
-        int j = RANDOM.nextInt((Integer.MAX_VALUE - 1) >> INT_MASK_WIDTH);
-        int res = addShiftMaskIntCheckIndex2(i, j, (Integer.max(i, j) << INT_MASK_WIDTH) + 1);
-        if (res != 0) {
-            throw new RuntimeException("incorrect result: " + res);
-        }
+        int i = G.uniformInts(0, ((Integer.MAX_VALUE - 1) >> INT_MASK_WIDTH) - 1).next();
+        int j = G.uniformInts(0, ((Integer.MAX_VALUE - 1) >> INT_MASK_WIDTH) - 1).next();
+        Asserts.assertEquals(addShiftMaskIntCheckIndex2(i, j, (Integer.max(i, j) << INT_MASK_WIDTH) + 1), 0);
     }
 
     @Test
@@ -583,12 +498,9 @@ public class TestShiftAndMask {
 
     @Run(test = "addShiftMaskLongCheckIndex2")
     public static void addShiftMaskLongCheckIndex2_runner() {
-        long i = RANDOM.nextLong((Long.MAX_VALUE - 1) >> LONG_MASK_WIDTH);
-        long j = RANDOM.nextLong((Long.MAX_VALUE - 1) >> LONG_MASK_WIDTH);
-        long res = addShiftMaskLongCheckIndex2(i, j, (Long.max(i, j) << LONG_MASK_WIDTH) + 1);
-        if (res != 0) {
-            throw new RuntimeException("incorrect result: " + res);
-        }
+        long i = G.uniformLongs(0L, ((Long.MAX_VALUE - 1) >> LONG_MASK_WIDTH) - 1).next();
+        long j = G.uniformLongs(0L, ((Long.MAX_VALUE - 1) >> LONG_MASK_WIDTH) - 1).next();
+        Asserts.assertEquals(addShiftMaskLongCheckIndex2(i, j, (Long.max(i, j) << LONG_MASK_WIDTH) + 1), 0L);
     }
 
     @Test
@@ -599,11 +511,8 @@ public class TestShiftAndMask {
 
     @Run(test = "shiftConvMaskCheckIndex")
     public static void shiftConvMaskCheckIndex_runner() {
-        int i = RANDOM.nextInt((Integer.MAX_VALUE - 1) >> INT_MASK_WIDTH);
-        long res = shiftConvMaskCheckIndex(i, (i << INT_MASK_WIDTH) + 1);
-        if (res != 0) {
-            throw new RuntimeException("incorrect result: " + res);
-        }
+        int i = G.uniformInts(0, ((Integer.MAX_VALUE - 1) >> INT_MASK_WIDTH) - 1).next();
+        Asserts.assertEquals(shiftConvMaskCheckIndex(i, (i << INT_MASK_WIDTH) + 1), 0L);
     }
 
     @Test
@@ -615,12 +524,9 @@ public class TestShiftAndMask {
 
     @Run(test = "addShiftConvMaskCheckIndex")
     public static void addShiftConvMaskCheckIndex_runner() {
-        int i = RANDOM.nextInt((Integer.MAX_VALUE - 1) >> INT_MASK_WIDTH);
-        long j = RANDOM.nextLong();
-        long res = addShiftConvMaskCheckIndex(i, j, (i << INT_MASK_WIDTH) + 1);
-        if (res != (j & INT_MASK)) {
-            throw new RuntimeException("incorrect result: " + res);
-        }
+        int i = G.uniformInts(0, ((Integer.MAX_VALUE - 1) >> INT_MASK_WIDTH) - 1).next();
+        long j = G.longs().next();
+        Asserts.assertEquals(addShiftConvMaskCheckIndex(i, j, (i << INT_MASK_WIDTH) + 1), j & INT_MASK);
     }
 
     @Test
@@ -631,11 +537,147 @@ public class TestShiftAndMask {
 
     @Run(test = "addShiftConvMaskCheckIndex2")
     public static void addShiftConvMaskCheckIndex2_runner() {
-        int i = RANDOM.nextInt((Integer.MAX_VALUE - 1) >> INT_MASK_WIDTH);
-        int j = RANDOM.nextInt((Integer.MAX_VALUE - 1) >> INT_MASK_WIDTH);
-        long res = addShiftConvMaskCheckIndex2(i, j, (Integer.max(i, j) << INT_MASK_WIDTH) + 1);
-        if (res != 0) {
-            throw new RuntimeException("incorrect result: " + res);
-        }
+        int i = G.uniformInts(0, ((Integer.MAX_VALUE - 1) >> INT_MASK_WIDTH) - 1).next();
+        int j = G.uniformInts(0, ((Integer.MAX_VALUE - 1) >> INT_MASK_WIDTH) - 1).next();
+        Asserts.assertEquals(addShiftConvMaskCheckIndex2(i, j, (Integer.max(i, j) << INT_MASK_WIDTH) + 1), 0L);
+    }
+
+    @Test
+    @IR(failOn = {IRNode.AND_I})
+    @IR(counts = {IRNode.LSHIFT_I, "1"})
+    public int shiftLeftWithLowMaskInt(int x) {
+      return (x << INT_MASK_WIDTH) & (-1 << INT_MASK_WIDTH); // transformed to: return x << INT_MASK_WIDTH;
+    }
+
+    @Test
+    @IR(failOn = {IRNode.AND_L})
+    @IR(counts = {IRNode.LSHIFT_L, "1"})
+    public long shiftLeftWithLowMaskLong(long x) {
+      return (x << LONG_MASK_WIDTH) & (-1 << LONG_MASK_WIDTH); // transformed to: return x << LONG_MASK_WIDTH;
+    }
+
+    @Test
+    @IR(failOn = {IRNode.AND_I})
+    @IR(counts = {IRNode.LSHIFT_I, "1"})
+    public int shiftLeftWithLowMaskSmallInt(int x) {
+        return (x << INT_MASK_WIDTH) & (-1 << (INT_MASK_WIDTH - 1)); // transformed to: return x << INT_MASK_WIDTH;
+    }
+
+    @Test
+    @IR(failOn = {IRNode.AND_L})
+    @IR(counts = {IRNode.LSHIFT_L, "1"})
+    public long shiftLeftWithLowMaskSmallLong(long x) {
+        return (x << LONG_MASK_WIDTH) & (-1 << (LONG_MASK_WIDTH - 1)); // transformed to: return x << LONG_MASK_WIDTH;
+    }
+
+    @Test
+    @IR(failOn = {IRNode.AND_I})
+    @IR(counts = {IRNode.LSHIFT_I, "1"})
+    public static int shiftLeftWithLowMaskIntReversed(int x) {
+      return (-1 << INT_MASK_WIDTH) & (x << INT_MASK_WIDTH); // transformed to: return x << INT_MASK_WIDTH;
+    }
+
+    @Test
+    @IR(failOn = {IRNode.AND_L})
+    @IR(counts = {IRNode.LSHIFT_L, "1"})
+    public static long shiftLeftWithLowMaskLongReversed(long x) {
+      return (-1 << LONG_MASK_WIDTH) & (x << LONG_MASK_WIDTH); // transformed to: return x << LONG_MASK_WIDTH;
+    }
+
+    @Test
+    @IR(failOn = {IRNode.AND_I})
+    @IR(counts = {IRNode.LSHIFT_I, "1"})
+    public static int shiftLeftWithLowMaskSmallIntReversed(int x) {
+        return (-1 << (INT_MASK_WIDTH - 1)) & (x << INT_MASK_WIDTH); // transformed to: return x << INT_MASK_WIDTH;
+    }
+
+    @Test
+    @IR(failOn = {IRNode.AND_L})
+    @IR(counts = {IRNode.LSHIFT_L, "1"})
+    public static long shiftLeftWithLowMaskSmallLongReversed(long x) {
+        return (-1 << (LONG_MASK_WIDTH - 1)) & (x << LONG_MASK_WIDTH); // transformed to: return x << LONG_MASK_WIDTH;
+    }
+
+    @Test
+    @IR(counts = {IRNode.AND_I, "1"})
+    public int andMaskNonNegativeInt(int x) {
+        return (x & 0x7FFF) & 0xFFFF; // transformed to: return x & 0x7FFF;
+    }
+
+    @Test
+    @IR(counts = {IRNode.AND_L, "1"})
+    public long andMaskNonNegativeLong(long x) {
+        return (x & 0x7FFFL) & 0xFFFFL; // transformed to: return x & 0x7FFFL;
+    }
+
+    @Test
+    @IR(counts = {IRNode.AND_I, "1"})
+    public int andMaskNonNegativeIntReversed(int x) {
+        return 0xFFFF & (x & 0x7FFF); // transformed to: return x & 0x7FFF;
+    }
+
+    @Test
+    @IR(counts = {IRNode.AND_L, "1"})
+    public long andMaskNonNegativeLongReversed(long x) {
+        return 0xFFFFL & (x & 0x7FFFL); // transformed to: return x & 0x7FFFL;
+    }
+
+    @Test
+    @IR(failOn = {IRNode.AND_I})
+    @IR(counts = {IRNode.URSHIFT_I, "1"})
+    public int andAfterURShiftInt(int x) {
+        return (x >>> 8) & 0x00FFFFFF; // transformed to return x >>> 8;
+    }
+
+    @Test
+    @IR(failOn = {IRNode.AND_L})
+    @IR(counts = {IRNode.URSHIFT_L, "1"})
+    public long andAfterURShiftLong(long x) {
+        return (x >>> 16) & 0x0000FFFFFFFFFFFFL; // transformed to return x >>> 16;
+    }
+
+    @Test
+    @IR(failOn = {IRNode.AND_I})
+    @IR(counts = {IRNode.URSHIFT_I, "1"})
+    public int andAfterURShiftIntReversed(int x) {
+        return 0x00FFFFFF & (x >>> 8); // transformed to return x >>> 8;
+    }
+
+    @Test
+    @IR(failOn = {IRNode.AND_L})
+    @IR(counts = {IRNode.URSHIFT_L, "1"})
+    public long andAfterURShiftLongReversed(long x) {
+        return 0x0000FFFFFFFFFFFFL & (x >>> 16); // transformed to return x >>> 16;
+    }
+
+    @Run(test = {"shiftLeftWithLowMaskInt", "shiftLeftWithLowMaskLong",
+                 "shiftLeftWithLowMaskSmallInt", "shiftLeftWithLowMaskSmallLong",
+                 "shiftLeftWithLowMaskIntReversed", "shiftLeftWithLowMaskLongReversed",
+                 "shiftLeftWithLowMaskSmallIntReversed", "shiftLeftWithLowMaskSmallLongReversed",
+                 "andMaskNonNegativeInt", "andMaskNonNegativeLong",
+                 "andMaskNonNegativeIntReversed", "andMaskNonNegativeLongReversed",
+                 "andAfterURShiftInt", "andAfterURShiftLong",
+                 "andAfterURShiftIntReversed", "andAfterURShiftLongReversed",
+    })
+    public void verifyShiftAndMaskTransforms() {
+        int xi = G.ints().next();
+        long xl = G.longs().next();
+
+        Asserts.assertEquals(shiftLeftWithLowMaskInt(xi), (xi << INT_MASK_WIDTH));
+        Asserts.assertEquals(shiftLeftWithLowMaskLong(xl), (xl << LONG_MASK_WIDTH));
+        Asserts.assertEquals(shiftLeftWithLowMaskSmallInt(xi), (xi << INT_MASK_WIDTH));
+        Asserts.assertEquals(shiftLeftWithLowMaskSmallLong(xl), (xl << LONG_MASK_WIDTH));
+        Asserts.assertEquals(shiftLeftWithLowMaskIntReversed(xi), (xi << INT_MASK_WIDTH));
+        Asserts.assertEquals(shiftLeftWithLowMaskLongReversed(xl), (xl << LONG_MASK_WIDTH));
+        Asserts.assertEquals(shiftLeftWithLowMaskSmallIntReversed(xi), (xi << INT_MASK_WIDTH));
+        Asserts.assertEquals(shiftLeftWithLowMaskSmallLongReversed(xl), (xl << LONG_MASK_WIDTH));
+        Asserts.assertEquals(andMaskNonNegativeInt(xi), (xi & 0x7FFF));
+        Asserts.assertEquals(andMaskNonNegativeLong(xl), (xl & 0x7FFFL));
+        Asserts.assertEquals(andMaskNonNegativeIntReversed(xi), (xi & 0x7FFF));
+        Asserts.assertEquals(andMaskNonNegativeLongReversed(xl), (xl & 0x7FFFL));
+        Asserts.assertEquals(andAfterURShiftInt(xi), (xi >>> 8));
+        Asserts.assertEquals(andAfterURShiftLong(xl), (xl >>> 16));
+        Asserts.assertEquals(andAfterURShiftIntReversed(xi), (xi >>> 8));
+        Asserts.assertEquals(andAfterURShiftLongReversed(xl), (xl >>> 16));
     }
 }

From 2a64074a8bd6024e1e09ae6f413595f3c9dcc86d Mon Sep 17 00:00:00 2001
From: Volkan Yazici <vyazici@openjdk.org>
Date: Mon, 23 Mar 2026 14:58:47 +0000
Subject: [PATCH 307/655] 8374706: HttpClient: Ensure that request body
 publishers support multiple subscriptions

Reviewed-by: dfuchs, jpai
---
 .../ByteBufferUtils.java                      |   4 +-
 .../FromPublisherTest.java                    |  41 ++++--
 .../HttpRequestBodyPublishers/NoBodyTest.java |  24 +++-
 .../OfByteArrayTest.java                      |  51 ++++---
 .../OfByteArraysTest.java                     |  34 +++--
 .../OfFileChannelTest.java}                   |  31 +++-
 .../HttpRequestBodyPublishers/OfFileTest.java |  46 ++++--
 .../OfInputStreamTest.java                    |  39 +++--
 .../OfStringTest.java                         |  27 ++--
 .../ReplayTestSupport.java                    | 134 ++++++++++++++++++
 10 files changed, 340 insertions(+), 91 deletions(-)
 rename test/jdk/java/net/httpclient/{FileChannelPublisherTest.java => HttpRequestBodyPublishers/OfFileChannelTest.java} (96%)
 create mode 100644 test/jdk/java/net/httpclient/HttpRequestBodyPublishers/ReplayTestSupport.java

diff --git a/test/jdk/java/net/httpclient/HttpRequestBodyPublishers/ByteBufferUtils.java b/test/jdk/java/net/httpclient/HttpRequestBodyPublishers/ByteBufferUtils.java
index 29276dc7b60..0f9d6a373d4 100644
--- a/test/jdk/java/net/httpclient/HttpRequestBodyPublishers/ByteBufferUtils.java
+++ b/test/jdk/java/net/httpclient/HttpRequestBodyPublishers/ByteBufferUtils.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2025, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -61,7 +61,7 @@ public final class ByteBufferUtils {
 
     private static byte[] bytes(ByteBuffer buffer) {
         byte[] bytes = new byte[buffer.limit()];
-        buffer.get(bytes);
+        buffer.get(buffer.position(), bytes);
         return bytes;
     }
 
diff --git a/test/jdk/java/net/httpclient/HttpRequestBodyPublishers/FromPublisherTest.java b/test/jdk/java/net/httpclient/HttpRequestBodyPublishers/FromPublisherTest.java
index f05eab0a2e5..7d3e78e0b29 100644
--- a/test/jdk/java/net/httpclient/HttpRequestBodyPublishers/FromPublisherTest.java
+++ b/test/jdk/java/net/httpclient/HttpRequestBodyPublishers/FromPublisherTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2025, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,10 +25,13 @@ import org.junit.jupiter.api.Test;
 import org.junit.jupiter.params.ParameterizedTest;
 import org.junit.jupiter.params.provider.ValueSource;
 
-import java.net.http.HttpRequest;
+import java.net.http.HttpRequest.BodyPublisher;
+import java.nio.ByteBuffer;
+import java.util.List;
 import java.util.concurrent.BlockingQueue;
 import java.util.concurrent.LinkedBlockingQueue;
 
+import static java.net.http.HttpRequest.BodyPublishers.*;
 import static org.junit.jupiter.api.Assertions.assertEquals;
 import static org.junit.jupiter.api.Assertions.assertThrows;
 import static org.junit.jupiter.api.Assertions.assertTrue;
@@ -37,16 +40,18 @@ import static org.junit.jupiter.api.Assertions.assertTrue;
  * @test
  * @bug 8364733
  * @summary Verify all specified `HttpRequest.BodyPublishers::fromPublisher` behavior
- * @build RecordingSubscriber
- * @run junit FromPublisherTest
+ * @build ByteBufferUtils
+ *        RecordingSubscriber
+ *        ReplayTestSupport
+ * @run junit ${test.main.class}
  */
 
-class FromPublisherTest {
+class FromPublisherTest extends ReplayTestSupport {
 
     @Test
     void testNullPublisher() {
-        assertThrows(NullPointerException.class, () -> HttpRequest.BodyPublishers.fromPublisher(null));
-        assertThrows(NullPointerException.class, () -> HttpRequest.BodyPublishers.fromPublisher(null, 1));
+        assertThrows(NullPointerException.class, () -> fromPublisher(null));
+        assertThrows(NullPointerException.class, () -> fromPublisher(null, 1));
     }
 
     @ParameterizedTest
@@ -54,7 +59,7 @@ class FromPublisherTest {
     void testInvalidContentLength(long contentLength) {
         IllegalArgumentException exception = assertThrows(
                 IllegalArgumentException.class,
-                () -> HttpRequest.BodyPublishers.fromPublisher(null, contentLength));
+                () -> fromPublisher(null, contentLength));
         String exceptionMessage = exception.getMessage();
         assertTrue(
                 exceptionMessage.contains("non-positive contentLength"),
@@ -64,29 +69,26 @@ class FromPublisherTest {
     @ParameterizedTest
     @ValueSource(longs = {1, 2, 3, 4})
     void testValidContentLength(long contentLength) {
-        HttpRequest.BodyPublisher publisher =
-                HttpRequest.BodyPublishers.fromPublisher(HttpRequest.BodyPublishers.noBody(), contentLength);
+        BodyPublisher publisher = fromPublisher(noBody(), contentLength);
         assertEquals(contentLength, publisher.contentLength());
     }
 
     @Test
     void testNoContentLength() {
-        HttpRequest.BodyPublisher publisher =
-                HttpRequest.BodyPublishers.fromPublisher(HttpRequest.BodyPublishers.noBody());
+        BodyPublisher publisher = fromPublisher(noBody());
         assertEquals(-1, publisher.contentLength());
     }
 
     @Test
     void testNullSubscriber() {
-        HttpRequest.BodyPublisher publisher =
-                HttpRequest.BodyPublishers.fromPublisher(HttpRequest.BodyPublishers.noBody());
+        BodyPublisher publisher = fromPublisher(noBody());
         assertThrows(NullPointerException.class, () -> publisher.subscribe(null));
     }
 
     @Test
     void testDelegation() throws InterruptedException {
         BlockingQueue<Object> publisherInvocations = new LinkedBlockingQueue<>();
-        HttpRequest.BodyPublisher publisher = HttpRequest.BodyPublishers.fromPublisher(subscriber -> {
+        BodyPublisher publisher = fromPublisher(subscriber -> {
             publisherInvocations.add("subscribe");
             publisherInvocations.add(subscriber);
         });
@@ -97,4 +99,13 @@ class FromPublisherTest {
         assertTrue(subscriber.invocations.isEmpty());
     }
 
+    @Override
+    Iterable<ReplayTarget> createReplayTargets() {
+        byte[] content = ByteBufferUtils.byteArrayOfLength(10);
+        ByteBuffer expectedBuffer = ByteBuffer.wrap(content);
+        BodyPublisher delegatePublisher = ofByteArray(content);
+        BodyPublisher publisher = fromPublisher(delegatePublisher, delegatePublisher.contentLength());
+        return List.of(new ReplayTarget(expectedBuffer, publisher));
+    }
+
 }
diff --git a/test/jdk/java/net/httpclient/HttpRequestBodyPublishers/NoBodyTest.java b/test/jdk/java/net/httpclient/HttpRequestBodyPublishers/NoBodyTest.java
index f58e9505c9a..d45482700d6 100644
--- a/test/jdk/java/net/httpclient/HttpRequestBodyPublishers/NoBodyTest.java
+++ b/test/jdk/java/net/httpclient/HttpRequestBodyPublishers/NoBodyTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2025, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,7 +23,10 @@
 
 import org.junit.jupiter.api.Test;
 
-import java.net.http.HttpRequest;
+import java.net.http.HttpRequest.BodyPublisher;
+import java.net.http.HttpRequest.BodyPublishers;
+import java.nio.ByteBuffer;
+import java.util.List;
 import java.util.concurrent.Flow;
 
 import static org.junit.jupiter.api.Assertions.assertEquals;
@@ -32,17 +35,19 @@ import static org.junit.jupiter.api.Assertions.assertEquals;
  * @test
  * @bug 8364733
  * @summary Verify all specified `HttpRequest.BodyPublishers::noBody` behavior
- * @build RecordingSubscriber
- * @run junit NoBodyTest
+ * @build ByteBufferUtils
+ *        RecordingSubscriber
+ *        ReplayTestSupport
+ * @run junit ${test.main.class}
  */
 
-class NoBodyTest {
+class NoBodyTest extends ReplayTestSupport {
 
     @Test
     void test() throws InterruptedException {
 
         // Create the publisher
-        HttpRequest.BodyPublisher publisher = HttpRequest.BodyPublishers.noBody();
+        BodyPublisher publisher = BodyPublishers.noBody();
 
         // Subscribe
         RecordingSubscriber subscriber = new RecordingSubscriber();
@@ -54,4 +59,11 @@ class NoBodyTest {
 
     }
 
+    @Override
+    Iterable<ReplayTarget> createReplayTargets() {
+        ByteBuffer expectedBuffer = ByteBuffer.wrap(new byte[0]);
+        BodyPublisher publisher = BodyPublishers.noBody();
+        return List.of(new ReplayTarget(expectedBuffer, publisher));
+    }
+
 }
diff --git a/test/jdk/java/net/httpclient/HttpRequestBodyPublishers/OfByteArrayTest.java b/test/jdk/java/net/httpclient/HttpRequestBodyPublishers/OfByteArrayTest.java
index 19f7369125d..25233c9dd99 100644
--- a/test/jdk/java/net/httpclient/HttpRequestBodyPublishers/OfByteArrayTest.java
+++ b/test/jdk/java/net/httpclient/HttpRequestBodyPublishers/OfByteArrayTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2025, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,7 +25,8 @@ import org.junit.jupiter.api.Test;
 import org.junit.jupiter.params.ParameterizedTest;
 import org.junit.jupiter.params.provider.CsvSource;
 
-import java.net.http.HttpRequest;
+import java.net.http.HttpRequest.BodyPublisher;
+import java.net.http.HttpRequest.BodyPublishers;
 import java.nio.ByteBuffer;
 import java.nio.charset.Charset;
 import java.nio.charset.StandardCharsets;
@@ -39,30 +40,34 @@ import static org.junit.jupiter.api.Assertions.assertThrows;
  * @test
  * @bug 8364733
  * @summary Verify all specified `HttpRequest.BodyPublishers::ofByteArray` behavior
- * @build RecordingSubscriber
- * @run junit OfByteArrayTest
+ *
+ * @build ByteBufferUtils
+ *        RecordingSubscriber
+ *        ReplayTestSupport
+ *
+ * @run junit ${test.main.class}
  *
  * @comment Using `main/othervm` to initiate tests that depend on a custom-configured JVM
- * @run main/othervm -Djdk.httpclient.bufsize=3 OfByteArrayTest testChunking "" 0 0 ""
- * @run main/othervm -Djdk.httpclient.bufsize=3 OfByteArrayTest testChunking a 0 0 ""
- * @run main/othervm -Djdk.httpclient.bufsize=3 OfByteArrayTest testChunking a 1 0 ""
- * @run main/othervm -Djdk.httpclient.bufsize=3 OfByteArrayTest testChunking a 0 1 a
- * @run main/othervm -Djdk.httpclient.bufsize=3 OfByteArrayTest testChunking ab 0 1 a
- * @run main/othervm -Djdk.httpclient.bufsize=3 OfByteArrayTest testChunking ab 1 1 b
- * @run main/othervm -Djdk.httpclient.bufsize=3 OfByteArrayTest testChunking ab 0 2 ab
- * @run main/othervm -Djdk.httpclient.bufsize=1 OfByteArrayTest testChunking abc 0 3 a:b:c
- * @run main/othervm -Djdk.httpclient.bufsize=2 OfByteArrayTest testChunking abc 0 3 ab:c
- * @run main/othervm -Djdk.httpclient.bufsize=2 OfByteArrayTest testChunking abcdef 2 4 cd:ef
+ * @run main/othervm -Djdk.httpclient.bufsize=3 ${test.main.class} testChunking "" 0 0 ""
+ * @run main/othervm -Djdk.httpclient.bufsize=3 ${test.main.class} testChunking a 0 0 ""
+ * @run main/othervm -Djdk.httpclient.bufsize=3 ${test.main.class} testChunking a 1 0 ""
+ * @run main/othervm -Djdk.httpclient.bufsize=3 ${test.main.class} testChunking a 0 1 a
+ * @run main/othervm -Djdk.httpclient.bufsize=3 ${test.main.class} testChunking ab 0 1 a
+ * @run main/othervm -Djdk.httpclient.bufsize=3 ${test.main.class} testChunking ab 1 1 b
+ * @run main/othervm -Djdk.httpclient.bufsize=3 ${test.main.class} testChunking ab 0 2 ab
+ * @run main/othervm -Djdk.httpclient.bufsize=1 ${test.main.class} testChunking abc 0 3 a:b:c
+ * @run main/othervm -Djdk.httpclient.bufsize=2 ${test.main.class} testChunking abc 0 3 ab:c
+ * @run main/othervm -Djdk.httpclient.bufsize=2 ${test.main.class} testChunking abcdef 2 4 cd:ef
  */
 
-public class OfByteArrayTest {
+public class OfByteArrayTest extends ReplayTestSupport {
 
     private static final Charset CHARSET = StandardCharsets.US_ASCII;
 
     @Test
     void testNullContent() {
-        assertThrows(NullPointerException.class, () -> HttpRequest.BodyPublishers.ofByteArray(null));
-        assertThrows(NullPointerException.class, () -> HttpRequest.BodyPublishers.ofByteArray(null, 1, 2));
+        assertThrows(NullPointerException.class, () -> BodyPublishers.ofByteArray(null));
+        assertThrows(NullPointerException.class, () -> BodyPublishers.ofByteArray(null, 1, 2));
     }
 
     @ParameterizedTest
@@ -78,7 +83,15 @@ public class OfByteArrayTest {
         byte[] content = contentText.getBytes(CHARSET);
         assertThrows(
                 IndexOutOfBoundsException.class,
-                () -> HttpRequest.BodyPublishers.ofByteArray(content, offset, length));
+                () -> BodyPublishers.ofByteArray(content, offset, length));
+    }
+
+    @Override
+    Iterable<ReplayTarget> createReplayTargets() {
+        byte[] content = "this content needs to be replayed again and again".getBytes(CHARSET);
+        ByteBuffer expectedBuffer = ByteBuffer.wrap(content);
+        BodyPublisher publisher = BodyPublishers.ofByteArray(content);
+        return List.of(new ReplayTarget(expectedBuffer, publisher));
     }
 
     /**
@@ -105,7 +118,7 @@ public class OfByteArrayTest {
 
         // Create the publisher
         byte[] content = contentText.getBytes(CHARSET);
-        HttpRequest.BodyPublisher publisher = HttpRequest.BodyPublishers.ofByteArray(content, offset, length);
+        BodyPublisher publisher = BodyPublishers.ofByteArray(content, offset, length);
 
         // Subscribe
         RecordingSubscriber subscriber = new RecordingSubscriber();
diff --git a/test/jdk/java/net/httpclient/HttpRequestBodyPublishers/OfByteArraysTest.java b/test/jdk/java/net/httpclient/HttpRequestBodyPublishers/OfByteArraysTest.java
index ab051d2020f..10784f7dbee 100644
--- a/test/jdk/java/net/httpclient/HttpRequestBodyPublishers/OfByteArraysTest.java
+++ b/test/jdk/java/net/httpclient/HttpRequestBodyPublishers/OfByteArraysTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2025, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -27,7 +27,8 @@ import org.junit.jupiter.params.provider.Arguments;
 import org.junit.jupiter.params.provider.MethodSource;
 import org.junit.jupiter.params.provider.ValueSource;
 
-import java.net.http.HttpRequest;
+import java.net.http.HttpRequest.BodyPublisher;
+import java.net.http.HttpRequest.BodyPublishers;
 import java.nio.ByteBuffer;
 import java.util.ArrayList;
 import java.util.Iterator;
@@ -46,15 +47,18 @@ import static org.junit.jupiter.api.Assertions.assertThrows;
  * @test
  * @bug 8226303 8364733
  * @summary Verify all specified `HttpRequest.BodyPublishers::ofByteArrays` behavior
+ *
  * @build ByteBufferUtils
  *        RecordingSubscriber
+ *        ReplayTestSupport
+ *
  * @run junit OfByteArraysTest
  *
  * @comment Using `main/othervm` to initiate tests that depend on a custom-configured JVM
  * @run main/othervm -Xmx64m OfByteArraysTest testOOM
  */
 
-public class OfByteArraysTest {
+public class OfByteArraysTest extends ReplayTestSupport {
 
     @ParameterizedTest
     @ValueSource(ints = {0, 1, 2, 3})
@@ -65,7 +69,7 @@ public class OfByteArraysTest {
                 .range(0, length)
                 .mapToObj(i -> new byte[]{(byte) i})
                 .toList();
-        HttpRequest.BodyPublisher publisher = HttpRequest.BodyPublishers.ofByteArrays(buffers::iterator);
+        BodyPublisher publisher = BodyPublishers.ofByteArrays(buffers::iterator);
 
         // Subscribe
         RecordingSubscriber subscriber = new RecordingSubscriber();
@@ -95,7 +99,7 @@ public class OfByteArraysTest {
             case 2 -> List.of(buffer2).iterator();
             default -> throw new AssertionError();
         };
-        HttpRequest.BodyPublisher publisher = HttpRequest.BodyPublishers.ofByteArrays(iterable);
+        BodyPublisher publisher = BodyPublishers.ofByteArrays(iterable);
 
         // Subscribe twice (to force two `Iterable::iterator` invocations)
         RecordingSubscriber subscriber = new RecordingSubscriber();
@@ -112,14 +116,14 @@ public class OfByteArraysTest {
 
     @Test
     void testNullIterable() {
-        assertThrows(NullPointerException.class, () -> HttpRequest.BodyPublishers.ofByteArrays(null));
+        assertThrows(NullPointerException.class, () -> BodyPublishers.ofByteArrays(null));
     }
 
     @Test
     void testNullIterator() throws InterruptedException {
 
         // Create the publisher
-        HttpRequest.BodyPublisher publisher = HttpRequest.BodyPublishers.ofByteArrays(() -> null);
+        BodyPublisher publisher = BodyPublishers.ofByteArrays(() -> null);
 
         // Subscribe
         RecordingSubscriber subscriber = new RecordingSubscriber();
@@ -138,7 +142,7 @@ public class OfByteArraysTest {
         // Create the publisher
         List<byte[]> iterable = new ArrayList<>();
         iterable.add(null);
-        HttpRequest.BodyPublisher publisher = HttpRequest.BodyPublishers.ofByteArrays(iterable);
+        BodyPublisher publisher = BodyPublishers.ofByteArrays(iterable);
 
         // Subscribe
         RecordingSubscriber subscriber = new RecordingSubscriber();
@@ -156,7 +160,7 @@ public class OfByteArraysTest {
 
         // Create the publisher
         RuntimeException exception = new RuntimeException("failure for `testIteratorCreationException`");
-        HttpRequest.BodyPublisher publisher = HttpRequest.BodyPublishers.ofByteArrays(() -> {
+        BodyPublisher publisher = BodyPublishers.ofByteArrays(() -> {
             throw exception;
         });
 
@@ -192,7 +196,7 @@ public class OfByteArraysTest {
         // Create the publisher
         IteratorThrowingAtEnd iterator =
                 new IteratorThrowingAtEnd(exceptionIndex, hasNextException, nextException);
-        HttpRequest.BodyPublisher publisher = HttpRequest.BodyPublishers.ofByteArrays(() -> iterator);
+        BodyPublisher publisher = BodyPublishers.ofByteArrays(() -> iterator);
 
         // Subscribe
         RecordingSubscriber subscriber = new RecordingSubscriber();
@@ -257,6 +261,14 @@ public class OfByteArraysTest {
 
     }
 
+    @Override
+    Iterable<ReplayTarget> createReplayTargets() {
+        byte[] byteArray = ByteBufferUtils.byteArrayOfLength(9);
+        ByteBuffer expectedBuffer = ByteBuffer.wrap(byteArray);
+        BodyPublisher publisher = BodyPublishers.ofByteArrays(List.of(byteArray));
+        return List.of(new ReplayTarget(expectedBuffer, -1, publisher, null));
+    }
+
     /**
      * Initiates tests that depend on a custom-configured JVM.
      */
@@ -273,7 +285,7 @@ public class OfByteArraysTest {
         // Create the publisher
         int length = ByteBufferUtils.findLengthExceedingMaxMemory();
         Iterable<byte[]> iterable = createIterableOfLength(length);
-        HttpRequest.BodyPublisher publisher = HttpRequest.BodyPublishers.ofByteArrays(iterable);
+        BodyPublisher publisher = BodyPublishers.ofByteArrays(iterable);
 
         // Subscribe
         RecordingSubscriber subscriber = new RecordingSubscriber();
diff --git a/test/jdk/java/net/httpclient/FileChannelPublisherTest.java b/test/jdk/java/net/httpclient/HttpRequestBodyPublishers/OfFileChannelTest.java
similarity index 96%
rename from test/jdk/java/net/httpclient/FileChannelPublisherTest.java
rename to test/jdk/java/net/httpclient/HttpRequestBodyPublishers/OfFileChannelTest.java
index c9c78791da3..47596f40a5f 100644
--- a/test/jdk/java/net/httpclient/FileChannelPublisherTest.java
+++ b/test/jdk/java/net/httpclient/HttpRequestBodyPublishers/OfFileChannelTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2025, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -26,9 +26,12 @@
  * @summary Verifies `HttpRequest.BodyPublishers::ofFileChannel`
  * @library /test/lib
  *          /test/jdk/java/net/httpclient/lib
- * @build jdk.httpclient.test.lib.common.HttpServerAdapters
+ * @build ByteBufferUtils
+ *        RecordingSubscriber
+ *        ReplayTestSupport
+ *        jdk.httpclient.test.lib.common.HttpServerAdapters
  *        jdk.test.lib.net.SimpleSSLContext
- * @run junit FileChannelPublisherTest
+ * @run junit ${test.main.class}
  */
 
 import jdk.httpclient.test.lib.common.HttpServerAdapters.HttpTestHandler;
@@ -52,8 +55,10 @@ import java.net.URI;
 import java.net.http.HttpClient;
 import java.net.http.HttpClient.Version;
 import java.net.http.HttpRequest;
+import java.net.http.HttpRequest.BodyPublisher;
 import java.net.http.HttpRequest.BodyPublishers;
 import java.net.http.HttpResponse;
+import java.nio.ByteBuffer;
 import java.nio.channels.ClosedChannelException;
 import java.nio.channels.FileChannel;
 import java.nio.file.Files;
@@ -82,9 +87,9 @@ import static org.junit.jupiter.api.Assertions.assertInstanceOf;
 import static org.junit.jupiter.api.Assertions.assertThrows;
 import static org.junit.jupiter.api.Assertions.assertTrue;
 
-class FileChannelPublisherTest {
+class OfFileChannelTest extends ReplayTestSupport {
 
-    private static final String CLASS_NAME = FileChannelPublisherTest.class.getSimpleName();
+    private static final String CLASS_NAME = OfFileChannelTest.class.getSimpleName();
 
     private static final Logger LOGGER = Utils.getDebugLogger(CLASS_NAME::toString, Utils.DEBUG);
 
@@ -650,6 +655,22 @@ class FileChannelPublisherTest {
 
     }
 
+    @Override
+    Iterable<ReplayTarget> createReplayTargets() {
+        int fileLength = 42;
+        byte[] fileBytes = generateFileBytes(fileLength);
+        Path filePath = Path.of("replayTarget.txt");
+        try {
+            Files.write(filePath, fileBytes, StandardOpenOption.CREATE);
+            FileChannel fileChannel = FileChannel.open(filePath);
+            BodyPublisher publisher = BodyPublishers.ofFileChannel(fileChannel, 0, fileLength);
+            ByteBuffer expectedBuffer = ByteBuffer.wrap(fileBytes);
+            return List.of(new ReplayTarget(expectedBuffer, fileLength, publisher, fileChannel));
+        } catch (IOException ioe) {
+            throw new UncheckedIOException(ioe);
+        }
+    }
+
     /**
      * Performs the initial {@code HEAD} request to the specified server. This
      * effectively admits a connection to the client's pool, where all protocol
diff --git a/test/jdk/java/net/httpclient/HttpRequestBodyPublishers/OfFileTest.java b/test/jdk/java/net/httpclient/HttpRequestBodyPublishers/OfFileTest.java
index 94b5a596fc6..7287468d600 100644
--- a/test/jdk/java/net/httpclient/HttpRequestBodyPublishers/OfFileTest.java
+++ b/test/jdk/java/net/httpclient/HttpRequestBodyPublishers/OfFileTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2025, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -31,7 +31,8 @@ import java.io.FileNotFoundException;
 import java.io.IOException;
 import java.io.OutputStream;
 import java.io.UncheckedIOException;
-import java.net.http.HttpRequest;
+import java.net.http.HttpRequest.BodyPublisher;
+import java.net.http.HttpRequest.BodyPublishers;
 import java.nio.ByteBuffer;
 import java.nio.file.FileSystem;
 import java.nio.file.FileSystems;
@@ -51,15 +52,18 @@ import static org.junit.jupiter.api.Assertions.assertTrue;
  * @test
  * @bug 8226303 8235459 8358688 8364733
  * @summary Verify all specified `HttpRequest.BodyPublishers::ofFile` behavior
+ *
  * @build ByteBufferUtils
  *        RecordingSubscriber
- * @run junit OfFileTest
+ *        ReplayTestSupport
+ *
+ * @run junit ${test.main.class}
  *
  * @comment Using `main/othervm` to initiate tests that depend on a custom-configured JVM
- * @run main/othervm -Xmx64m OfFileTest testOOM
+ * @run main/othervm -Xmx64m ${test.main.class} testOOM
  */
 
-public class OfFileTest {
+public class OfFileTest extends ReplayTestSupport {
 
     private static final Path DEFAULT_FS_DIR = Path.of(System.getProperty("user.dir", "."));
 
@@ -89,14 +93,14 @@ public class OfFileTest {
 
     @Test
     void testNullPath() {
-        assertThrows(NullPointerException.class, () -> HttpRequest.BodyPublishers.ofFile(null));
+        assertThrows(NullPointerException.class, () -> BodyPublishers.ofFile(null));
     }
 
     @ParameterizedTest
     @MethodSource("parentDirs")
     void testNonExistentPath(Path parentDir) {
         Path nonExistentPath = createFilePath(parentDir, "testNonExistentPath");
-        assertThrows(FileNotFoundException.class, () -> HttpRequest.BodyPublishers.ofFile(nonExistentPath));
+        assertThrows(FileNotFoundException.class, () -> BodyPublishers.ofFile(nonExistentPath));
     }
 
     @ParameterizedTest
@@ -106,7 +110,7 @@ public class OfFileTest {
         // Create the publisher
         byte[] fileBytes = ByteBufferUtils.byteArrayOfLength(3);
         Path filePath = createFile(parentDir, "testNonExistentPathAtSubscribe", fileBytes);
-        HttpRequest.BodyPublisher publisher = HttpRequest.BodyPublishers.ofFile(filePath);
+        BodyPublisher publisher = BodyPublishers.ofFile(filePath);
 
         // Delete the file
         Files.delete(filePath);
@@ -131,7 +135,7 @@ public class OfFileTest {
     void testIrregularFile(Path parentDir) throws Exception {
 
         // Create the publisher
-        HttpRequest.BodyPublisher publisher = HttpRequest.BodyPublishers.ofFile(parentDir);
+        BodyPublisher publisher = BodyPublishers.ofFile(parentDir);
 
         // Subscribe
         RecordingSubscriber subscriber = new RecordingSubscriber();
@@ -167,7 +171,7 @@ public class OfFileTest {
         // Create the publisher
         byte[] fileBytes = ByteBufferUtils.byteArrayOfLength(BIG_FILE_LENGTH);
         Path filePath = createFile(parentDir, "testFileModificationWhileReading", fileBytes);
-        HttpRequest.BodyPublisher publisher = HttpRequest.BodyPublishers.ofFile(filePath);
+        BodyPublisher publisher = BodyPublishers.ofFile(filePath);
 
         // Subscribe
         RecordingSubscriber subscriber = new RecordingSubscriber();
@@ -210,7 +214,7 @@ public class OfFileTest {
         // Create the publisher
         byte[] fileBytes = ByteBufferUtils.byteArrayOfLength(fileLength);
         Path filePath = createFile(parentDir, "testFileOfLength", fileBytes);
-        HttpRequest.BodyPublisher publisher = HttpRequest.BodyPublishers.ofFile(filePath);
+        BodyPublisher publisher = BodyPublishers.ofFile(filePath);
 
         // Subscribe
         RecordingSubscriber subscriber = new RecordingSubscriber();
@@ -222,6 +226,24 @@ public class OfFileTest {
 
     }
 
+    @Override
+    Iterable<ReplayTarget> createReplayTargets() {
+        byte[] fileBytes = ByteBufferUtils.byteArrayOfLength(3);
+        ByteBuffer expectedBuffer = ByteBuffer.wrap(fileBytes);
+        return parentDirs()
+                .stream()
+                .map(parentDir -> {
+                    try {
+                        Path filePath = createFile(parentDir, "replayTest", fileBytes);
+                        BodyPublisher publisher = BodyPublishers.ofFile(filePath);
+                        return new ReplayTarget(expectedBuffer, publisher);
+                    } catch (IOException ioe) {
+                        throw new UncheckedIOException(ioe);
+                    }
+                })
+                .toList();
+    }
+
     /**
      * Initiates tests that depend on a custom-configured JVM.
      */
@@ -248,7 +270,7 @@ public class OfFileTest {
         // Create the publisher
         int fileLength = ByteBufferUtils.findLengthExceedingMaxMemory();
         Path filePath = createFileOfLength(parentDir, "testOOM", fileLength);
-        HttpRequest.BodyPublisher publisher = HttpRequest.BodyPublishers.ofFile(filePath);
+        BodyPublisher publisher = BodyPublishers.ofFile(filePath);
 
         // Subscribe
         RecordingSubscriber subscriber = new RecordingSubscriber();
diff --git a/test/jdk/java/net/httpclient/HttpRequestBodyPublishers/OfInputStreamTest.java b/test/jdk/java/net/httpclient/HttpRequestBodyPublishers/OfInputStreamTest.java
index 7688c1674ee..06ed13333ae 100644
--- a/test/jdk/java/net/httpclient/HttpRequestBodyPublishers/OfInputStreamTest.java
+++ b/test/jdk/java/net/httpclient/HttpRequestBodyPublishers/OfInputStreamTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2025, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -28,7 +28,9 @@ import org.junit.jupiter.params.provider.ValueSource;
 import java.io.ByteArrayInputStream;
 import java.io.IOException;
 import java.io.InputStream;
-import java.net.http.HttpRequest;
+import java.net.http.HttpRequest.BodyPublisher;
+import java.net.http.HttpRequest.BodyPublishers;
+import java.nio.ByteBuffer;
 import java.util.List;
 import java.util.concurrent.Flow;
 import java.util.function.Supplier;
@@ -41,19 +43,22 @@ import static org.junit.jupiter.api.Assertions.assertThrows;
  * @test
  * @bug 8364733
  * @summary Verify all specified `HttpRequest.BodyPublishers::ofInputStream` behavior
+ *
  * @build ByteBufferUtils
  *        RecordingSubscriber
- * @run junit OfInputStreamTest
+ *        ReplayTestSupport
+ *
+ * @run junit ${test.main.class}
  *
  * @comment Using `main/othervm` to initiate tests that depend on a custom-configured JVM
- * @run main/othervm -Xmx64m OfInputStreamTest testOOM
+ * @run main/othervm -Xmx64m ${test.main.class} testOOM
  */
 
-public class OfInputStreamTest {
+public class OfInputStreamTest extends ReplayTestSupport {
 
     @Test
     void testNullInputStreamSupplier() {
-        assertThrows(NullPointerException.class, () -> HttpRequest.BodyPublishers.ofInputStream(null));
+        assertThrows(NullPointerException.class, () -> BodyPublishers.ofInputStream(null));
     }
 
     @Test
@@ -61,7 +66,7 @@ public class OfInputStreamTest {
 
         // Create the publisher
         RuntimeException exception = new RuntimeException();
-        HttpRequest.BodyPublisher publisher = HttpRequest.BodyPublishers.ofInputStream(() -> { throw exception; });
+        BodyPublisher publisher = BodyPublishers.ofInputStream(() -> { throw exception; });
 
         // Subscribe
         RecordingSubscriber subscriber = new RecordingSubscriber();
@@ -80,7 +85,7 @@ public class OfInputStreamTest {
     void testNullInputStream() throws InterruptedException {
 
         // Create the publisher
-        HttpRequest.BodyPublisher publisher = HttpRequest.BodyPublishers.ofInputStream(() -> null);
+        BodyPublisher publisher = BodyPublishers.ofInputStream(() -> null);
 
         // Subscribe
         RecordingSubscriber subscriber = new RecordingSubscriber();
@@ -107,7 +112,7 @@ public class OfInputStreamTest {
                     case 2 -> new ByteArrayInputStream(buffer2);
                     default -> throw new AssertionError();
                 };
-        HttpRequest.BodyPublisher publisher = HttpRequest.BodyPublishers.ofInputStream(inputStreamSupplier);
+        BodyPublisher publisher = BodyPublishers.ofInputStream(inputStreamSupplier);
 
         // Subscribe
         RecordingSubscriber subscriber = new RecordingSubscriber();
@@ -129,7 +134,7 @@ public class OfInputStreamTest {
         // Create the publisher
         byte[] content = ByteBufferUtils.byteArrayOfLength(length);
         InputStream inputStream = new ByteArrayInputStream(content);
-        HttpRequest.BodyPublisher publisher = HttpRequest.BodyPublishers.ofInputStream(() -> inputStream);
+        BodyPublisher publisher = BodyPublishers.ofInputStream(() -> inputStream);
 
         // Subscribe
         RecordingSubscriber subscriber = new RecordingSubscriber();
@@ -148,7 +153,7 @@ public class OfInputStreamTest {
         // Create the publisher
         RuntimeException exception = new RuntimeException("failure for `read`");
         InputStream inputStream = new InputStreamThrowingOnCompletion(exceptionIndex, exception);
-        HttpRequest.BodyPublisher publisher = HttpRequest.BodyPublishers.ofInputStream(() -> inputStream);
+        BodyPublisher publisher = BodyPublishers.ofInputStream(() -> inputStream);
 
         // Subscribe
         RecordingSubscriber subscriber = new RecordingSubscriber();
@@ -185,6 +190,14 @@ public class OfInputStreamTest {
 
     }
 
+    @Override
+    Iterable<ReplayTarget> createReplayTargets() {
+        byte[] content = ByteBufferUtils.byteArrayOfLength(10);
+        ByteBuffer expectedBuffer = ByteBuffer.wrap(content);
+        BodyPublisher publisher = BodyPublishers.ofInputStream(() -> new ByteArrayInputStream(content));
+        return List.of(new ReplayTarget(expectedBuffer, -1, publisher, null));
+    }
+
     /**
      * Initiates tests that depend on a custom-configured JVM.
      */
@@ -200,8 +213,8 @@ public class OfInputStreamTest {
 
         // Create the publisher using an `InputStream` that emits content exceeding the maximum memory
         int length = ByteBufferUtils.findLengthExceedingMaxMemory();
-        HttpRequest.BodyPublisher publisher =
-                HttpRequest.BodyPublishers.ofInputStream(() -> new InputStream() {
+        BodyPublisher publisher =
+                BodyPublishers.ofInputStream(() -> new InputStream() {
 
                     private int position;
 
diff --git a/test/jdk/java/net/httpclient/HttpRequestBodyPublishers/OfStringTest.java b/test/jdk/java/net/httpclient/HttpRequestBodyPublishers/OfStringTest.java
index 143b5ce17da..2e1fcb11f99 100644
--- a/test/jdk/java/net/httpclient/HttpRequestBodyPublishers/OfStringTest.java
+++ b/test/jdk/java/net/httpclient/HttpRequestBodyPublishers/OfStringTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2025, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -26,10 +26,12 @@ import org.junit.jupiter.params.ParameterizedTest;
 import org.junit.jupiter.params.provider.CsvSource;
 import org.junit.jupiter.params.provider.ValueSource;
 
-import java.net.http.HttpRequest;
+import java.net.http.HttpRequest.BodyPublisher;
+import java.net.http.HttpRequest.BodyPublishers;
 import java.nio.ByteBuffer;
 import java.nio.charset.Charset;
 import java.nio.charset.StandardCharsets;
+import java.util.List;
 import java.util.concurrent.Flow;
 
 import static org.junit.jupiter.api.Assertions.assertEquals;
@@ -41,10 +43,11 @@ import static org.junit.jupiter.api.Assertions.assertThrows;
  * @summary Verify all specified `HttpRequest.BodyPublishers::ofString` behavior
  * @build ByteBufferUtils
  *        RecordingSubscriber
- * @run junit OfStringTest
+ *        ReplayTestSupport
+ * @run junit ${test.main.class}
  */
 
-class OfStringTest {
+class OfStringTest extends ReplayTestSupport {
 
     private static final Charset CHARSET = StandardCharsets.US_ASCII;
 
@@ -58,7 +61,7 @@ class OfStringTest {
             contentChars[i] = (char) ('a' + i);
         }
         String content = new String(contentChars);
-        HttpRequest.BodyPublisher publisher = HttpRequest.BodyPublishers.ofString(content, CHARSET);
+        BodyPublisher publisher = BodyPublishers.ofString(content, CHARSET);
 
         // Subscribe
         assertEquals(length, publisher.contentLength());
@@ -87,7 +90,7 @@ class OfStringTest {
     void testCharset(String content, Charset charset) throws InterruptedException {
 
         // Create the publisher
-        HttpRequest.BodyPublisher publisher = HttpRequest.BodyPublishers.ofString(content, charset);
+        BodyPublisher publisher = BodyPublishers.ofString(content, charset);
 
         // Subscribe
         ByteBuffer expectedBuffer = charset.encode(content);
@@ -108,12 +111,20 @@ class OfStringTest {
 
     @Test
     void testNullContent() {
-        assertThrows(NullPointerException.class, () -> HttpRequest.BodyPublishers.ofString(null, CHARSET));
+        assertThrows(NullPointerException.class, () -> BodyPublishers.ofString(null, CHARSET));
     }
 
     @Test
     void testNullCharset() {
-        assertThrows(NullPointerException.class, () -> HttpRequest.BodyPublishers.ofString("foo", null));
+        assertThrows(NullPointerException.class, () -> BodyPublishers.ofString("foo", null));
+    }
+
+    @Override
+    Iterable<ReplayTarget> createReplayTargets() {
+        String content = "this content needs to be replayed again and again";
+        ByteBuffer expectedBuffer = CHARSET.encode(content);
+        BodyPublisher publisher = BodyPublishers.ofString(content, CHARSET);
+        return List.of(new ReplayTarget(expectedBuffer, publisher));
     }
 
 }
diff --git a/test/jdk/java/net/httpclient/HttpRequestBodyPublishers/ReplayTestSupport.java b/test/jdk/java/net/httpclient/HttpRequestBodyPublishers/ReplayTestSupport.java
new file mode 100644
index 00000000000..788b59e96b7
--- /dev/null
+++ b/test/jdk/java/net/httpclient/HttpRequestBodyPublishers/ReplayTestSupport.java
@@ -0,0 +1,134 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.ValueSource;
+
+import java.net.http.HttpRequest.BodyPublisher;
+import java.nio.ByteBuffer;
+import java.util.concurrent.Flow;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+
+/**
+ * Tests for verifying that a request body publisher supports multiple subscriptions, aka. replayable.
+ */
+public abstract class ReplayTestSupport {
+
+    @ParameterizedTest
+    @ValueSource(strings = {
+            // 2 subscriptions
+            "subscribe-cancel-subscribe-cancel",
+            "subscribe-cancel-subscribe-request",
+            "subscribe-request-subscribe-cancel",
+            "subscribe-request-subscribe-request",
+            // 3 subscriptions
+            "subscribe-cancel-subscribe-cancel-subscribe-request",
+            "subscribe-cancel-subscribe-request-subscribe-cancel",
+            "subscribe-cancel-subscribe-request-subscribe-request",
+            "subscribe-request-subscribe-cancel-subscribe-cancel",
+            "subscribe-request-subscribe-cancel-subscribe-request",
+            "subscribe-request-subscribe-request-subscribe-cancel",
+            "subscribe-request-subscribe-request-subscribe-request",
+    })
+    void testReplay(String opSequence) throws Exception {
+        for (ReplayTarget replayTarget : createReplayTargets()) {
+            try (replayTarget) {
+                System.err.printf("Executing test for replay target: %s%n", replayTarget);
+                testReplay(opSequence, replayTarget);
+            }
+        }
+    }
+
+    private static void testReplay(String opSequence, ReplayTarget replayTarget) throws InterruptedException {
+
+        // Create the publisher
+        ByteBuffer expectedBuffer = replayTarget.expectedBuffer;
+        BodyPublisher publisher = replayTarget.publisher;
+        assertEquals(replayTarget.expectedContentLength, publisher.contentLength());
+
+        // Execute the specified operations
+        RecordingSubscriber subscriber = null;
+        Flow.Subscription subscription = null;
+        String[] ops = opSequence.split("-");
+        for (int opIndex = 0; opIndex < ops.length; opIndex++) {
+            String op = ops[opIndex];
+            System.err.printf("Executing operation at index %s: %s%n", opIndex, op);
+            switch (op) {
+
+                case "subscribe": {
+                    subscriber = new RecordingSubscriber();
+                    publisher.subscribe(subscriber);
+                    assertEquals("onSubscribe", subscriber.invocations.take());
+                    subscription = (Flow.Subscription) subscriber.invocations.take();
+                    break;
+                }
+
+                case "request": {
+                    assert subscription != null;
+                    subscription.request(Long.MAX_VALUE);
+                    if (expectedBuffer.hasRemaining()) {
+                        assertEquals("onNext", subscriber.invocations.take());
+                        ByteBuffer actualBuffer = (ByteBuffer) subscriber.invocations.take();
+                        ByteBufferUtils.assertEquals(expectedBuffer, actualBuffer, null);
+                    }
+                    assertEquals("onComplete", subscriber.invocations.take());
+                    break;
+                }
+
+                case "cancel": {
+                    assert subscription != null;
+                    subscription.cancel();
+                    break;
+                }
+
+                default: throw new IllegalArgumentException("Unknown operation: " + op);
+
+            }
+        }
+
+    }
+
+    abstract Iterable<ReplayTarget> createReplayTargets();
+
+    public record ReplayTarget(
+            ByteBuffer expectedBuffer,
+            int expectedContentLength,
+            BodyPublisher publisher,
+            AutoCloseable resource)
+            implements AutoCloseable {
+
+        public ReplayTarget(ByteBuffer expectedBuffer, BodyPublisher publisher) {
+            this(expectedBuffer, expectedBuffer.limit(), publisher, null);
+        }
+
+        @Override
+        public void close() throws Exception {
+            if (resource != null) {
+                resource.close();
+            }
+        }
+
+    }
+
+}

From 60a141c3b5c0dcbf1cccfc55dc5b6a457b6a9a12 Mon Sep 17 00:00:00 2001
From: Thomas Schatzl <tschatzl@openjdk.org>
Date: Mon, 23 Mar 2026 15:42:33 +0000
Subject: [PATCH 308/655] 8380441: G1: Move G1GCPauseType to G1CollectorState

Reviewed-by: iwalulya, ayang
---
 src/hotspot/share/gc/g1/g1CollectedHeap.cpp   |  1 -
 src/hotspot/share/gc/g1/g1CollectedHeap.hpp   |  1 -
 .../share/gc/g1/g1CollectionSetCandidates.cpp |  2 +-
 src/hotspot/share/gc/g1/g1CollectorState.cpp  | 15 ++--
 src/hotspot/share/gc/g1/g1CollectorState.hpp  | 63 ++++++++++++-
 src/hotspot/share/gc/g1/g1GCPauseType.hpp     | 89 -------------------
 src/hotspot/share/gc/g1/g1Policy.cpp          | 48 +++++-----
 src/hotspot/share/gc/g1/g1Policy.hpp          |  8 +-
 src/hotspot/share/gc/g1/g1Trace.cpp           | 13 ++-
 src/hotspot/share/gc/g1/g1Trace.hpp           | 10 +--
 src/hotspot/share/gc/g1/g1YoungCollector.cpp  |  6 +-
 11 files changed, 111 insertions(+), 145 deletions(-)
 delete mode 100644 src/hotspot/share/gc/g1/g1GCPauseType.hpp

diff --git a/src/hotspot/share/gc/g1/g1CollectedHeap.cpp b/src/hotspot/share/gc/g1/g1CollectedHeap.cpp
index 480550d6ed1..be9ecf19123 100644
--- a/src/hotspot/share/gc/g1/g1CollectedHeap.cpp
+++ b/src/hotspot/share/gc/g1/g1CollectedHeap.cpp
@@ -42,7 +42,6 @@
 #include "gc/g1/g1FullCollector.hpp"
 #include "gc/g1/g1GCCounters.hpp"
 #include "gc/g1/g1GCParPhaseTimesTracker.hpp"
-#include "gc/g1/g1GCPauseType.hpp"
 #include "gc/g1/g1GCPhaseTimes.hpp"
 #include "gc/g1/g1HeapRegion.inline.hpp"
 #include "gc/g1/g1HeapRegionPrinter.hpp"
diff --git a/src/hotspot/share/gc/g1/g1CollectedHeap.hpp b/src/hotspot/share/gc/g1/g1CollectedHeap.hpp
index 7a4cde9001e..b5cb9167d92 100644
--- a/src/hotspot/share/gc/g1/g1CollectedHeap.hpp
+++ b/src/hotspot/share/gc/g1/g1CollectedHeap.hpp
@@ -34,7 +34,6 @@
 #include "gc/g1/g1ConcurrentMark.hpp"
 #include "gc/g1/g1EdenRegions.hpp"
 #include "gc/g1/g1EvacStats.hpp"
-#include "gc/g1/g1GCPauseType.hpp"
 #include "gc/g1/g1HeapRegionAttr.hpp"
 #include "gc/g1/g1HeapRegionManager.hpp"
 #include "gc/g1/g1HeapRegionSet.hpp"
diff --git a/src/hotspot/share/gc/g1/g1CollectionSetCandidates.cpp b/src/hotspot/share/gc/g1/g1CollectionSetCandidates.cpp
index debb0bb54b7..2113db1163b 100644
--- a/src/hotspot/share/gc/g1/g1CollectionSetCandidates.cpp
+++ b/src/hotspot/share/gc/g1/g1CollectionSetCandidates.cpp
@@ -264,7 +264,7 @@ void G1CollectionSetCandidates::set_candidates_from_marking(GrowableArrayCHeap<G
   // During each Mixed GC, we must collect at least G1Policy::calc_min_old_cset_length regions to meet
   // the G1MixedGCCountTarget. For the first collection in a Mixed GC cycle, we can add all regions
   // required to meet this threshold to the same remset group. We are certain these will be collected in
-  // the same MixedGC.
+  // the same Mixed GC.
   uint group_limit = p->calc_min_old_cset_length(num_candidates);
 
   G1CSetCandidateGroup::reset_next_group_id();
diff --git a/src/hotspot/share/gc/g1/g1CollectorState.cpp b/src/hotspot/share/gc/g1/g1CollectorState.cpp
index d40a445c0ed..66292642603 100644
--- a/src/hotspot/share/gc/g1/g1CollectorState.cpp
+++ b/src/hotspot/share/gc/g1/g1CollectorState.cpp
@@ -25,19 +25,18 @@
 #include "gc/g1/g1CollectedHeap.inline.hpp"
 #include "gc/g1/g1CollectorState.hpp"
 #include "gc/g1/g1ConcurrentMarkThread.inline.hpp"
-#include "gc/g1/g1GCPauseType.hpp"
 #include "runtime/safepoint.hpp"
 
-G1GCPauseType G1CollectorState::gc_pause_type(bool concurrent_operation_is_full_mark) const {
+G1CollectorState::Pause G1CollectorState::gc_pause_type(bool concurrent_operation_is_full_mark) const {
   assert(SafepointSynchronize::is_at_safepoint(), "must be");
   switch (_phase) {
-    case Phase::YoungNormal: return G1GCPauseType::YoungGC;
-    case Phase::YoungLastYoung: return G1GCPauseType::LastYoungGC;
+    case Phase::YoungNormal: return Pause::Normal;
+    case Phase::YoungLastYoung: return Pause::LastYoung;
     case Phase::YoungConcurrentStart:
-        return concurrent_operation_is_full_mark ? G1GCPauseType::ConcurrentStartMarkGC :
-                                                   G1GCPauseType::ConcurrentStartUndoGC;
-    case Phase::Mixed: return G1GCPauseType::MixedGC;
-    case Phase::FullGC: return G1GCPauseType::FullGC;
+        return concurrent_operation_is_full_mark ? Pause::ConcurrentStartFull :
+                                                   Pause::ConcurrentStartUndo;
+    case Phase::Mixed: return Pause::Mixed;
+    case Phase::FullGC: return Pause::Full;
     default: ShouldNotReachHere();
   }
 }
diff --git a/src/hotspot/share/gc/g1/g1CollectorState.hpp b/src/hotspot/share/gc/g1/g1CollectorState.hpp
index c2923cb3954..fc59df7349d 100644
--- a/src/hotspot/share/gc/g1/g1CollectorState.hpp
+++ b/src/hotspot/share/gc/g1/g1CollectorState.hpp
@@ -25,7 +25,8 @@
 #ifndef SHARE_GC_G1_G1COLLECTORSTATE_HPP
 #define SHARE_GC_G1_G1COLLECTORSTATE_HPP
 
-#include "gc/g1/g1GCPauseType.hpp"
+#include "utilities/debug.hpp"
+#include "utilities/enumIterator.hpp"
 #include "utilities/globalDefinitions.hpp"
 
 // State of the G1 collection.
@@ -92,8 +93,66 @@ public:
   bool is_in_mark_or_rebuild() const;
   bool is_in_reset_for_next_cycle() const;
 
+  enum class Pause : uint {
+    Normal,
+    LastYoung,
+    ConcurrentStartFull,
+    ConcurrentStartUndo,
+    Cleanup,
+    Remark,
+    Mixed,
+    Full
+  };
+
   // Calculate GC Pause Type from internal state.
-  G1GCPauseType gc_pause_type(bool concurrent_operation_is_full_mark) const;
+  Pause gc_pause_type(bool concurrent_operation_is_full_mark) const;
+
+  static const char* to_string(Pause type) {
+    static const char* pause_strings[] = { "Normal",
+                                           "Prepare Mixed",
+                                           "Concurrent Start", // Do not distinguish between the different
+                                           "Concurrent Start", // Concurrent Start pauses.
+                                           "Cleanup",
+                                           "Remark",
+                                           "Mixed",
+                                           "Full" };
+    return pause_strings[static_cast<uint>(type)];
+  }
+
+  static void assert_is_young_pause(Pause type) {
+    assert(type != Pause::Full, "must be");
+    assert(type != Pause::Remark, "must be");
+    assert(type != Pause::Cleanup, "must be");
+  }
+
+  static bool is_young_only_pause(Pause type) {
+    assert_is_young_pause(type);
+    return type == Pause::ConcurrentStartUndo ||
+           type == Pause::ConcurrentStartFull ||
+           type == Pause::LastYoung ||
+           type == Pause::Normal;
+  }
+
+  static bool is_mixed_pause(Pause type) {
+    assert_is_young_pause(type);
+    return type == Pause::Mixed;
+  }
+
+  static bool is_last_young_pause(Pause type) {
+    assert_is_young_pause(type);
+    return type == Pause::LastYoung;
+  }
+
+  static bool is_concurrent_start_pause(Pause type) {
+    assert_is_young_pause(type);
+    return type == Pause::ConcurrentStartFull || type == Pause::ConcurrentStartUndo;
+  }
+
+  static bool is_concurrent_cycle_pause(Pause type) {
+    return type == Pause::Cleanup || type == Pause::Remark;
+  }
 };
 
+ENUMERATOR_RANGE(G1CollectorState::Pause, G1CollectorState::Pause::Normal, G1CollectorState::Pause::Full)
+
 #endif // SHARE_GC_G1_G1COLLECTORSTATE_HPP
diff --git a/src/hotspot/share/gc/g1/g1GCPauseType.hpp b/src/hotspot/share/gc/g1/g1GCPauseType.hpp
deleted file mode 100644
index 254edb28fea..00000000000
--- a/src/hotspot/share/gc/g1/g1GCPauseType.hpp
+++ /dev/null
@@ -1,89 +0,0 @@
-/*
- * Copyright (c) 2021, Oracle and/or its affiliates. All rights reserved.
- * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
- *
- * This code is free software; you can redistribute it and/or modify it
- * under the terms of the GNU General Public License version 2 only, as
- * published by the Free Software Foundation.
- *
- * This code is distributed in the hope that it will be useful, but WITHOUT
- * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
- * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
- * version 2 for more details (a copy is included in the LICENSE file that
- * accompanied this code).
- *
- * You should have received a copy of the GNU General Public License version
- * 2 along with this work; if not, write to the Free Software Foundation,
- * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
- *
- * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
- * or visit www.oracle.com if you need additional information or have any
- * questions.
- *
- */
-
-#ifndef SHARE_GC_G1_G1GCPAUSETYPES_HPP
-#define SHARE_GC_G1_G1GCPAUSETYPES_HPP
-
-#include "utilities/debug.hpp"
-#include "utilities/enumIterator.hpp"
-
-enum class G1GCPauseType : uint {
-  YoungGC,
-  LastYoungGC,
-  ConcurrentStartMarkGC,
-  ConcurrentStartUndoGC,
-  Cleanup,
-  Remark,
-  MixedGC,
-  FullGC
-};
-
-ENUMERATOR_RANGE(G1GCPauseType, G1GCPauseType::YoungGC, G1GCPauseType::FullGC)
-
-class G1GCPauseTypeHelper {
-public:
-
-  static void assert_is_young_pause(G1GCPauseType type) {
-    assert(type != G1GCPauseType::FullGC, "must be");
-    assert(type != G1GCPauseType::Remark, "must be");
-    assert(type != G1GCPauseType::Cleanup, "must be");
-  }
-
-  static bool is_young_only_pause(G1GCPauseType type) {
-    assert_is_young_pause(type);
-    return type == G1GCPauseType::ConcurrentStartUndoGC ||
-           type == G1GCPauseType::ConcurrentStartMarkGC ||
-           type == G1GCPauseType::LastYoungGC ||
-           type == G1GCPauseType::YoungGC;
-  }
-
-  static bool is_mixed_pause(G1GCPauseType type) {
-    assert_is_young_pause(type);
-    return type == G1GCPauseType::MixedGC;
-  }
-
-  static bool is_last_young_pause(G1GCPauseType type) {
-    assert_is_young_pause(type);
-    return type == G1GCPauseType::LastYoungGC;
-  }
-
-  static bool is_concurrent_start_pause(G1GCPauseType type) {
-    assert_is_young_pause(type);
-    return type == G1GCPauseType::ConcurrentStartMarkGC || type == G1GCPauseType::ConcurrentStartUndoGC;
-  }
-
-  static const char* to_string(G1GCPauseType type) {
-    static const char* pause_strings[] = { "Normal",
-                                           "Prepare Mixed",
-                                           "Concurrent Start", // Do not distinguish between the different
-                                           "Concurrent Start", // Concurrent Start pauses.
-                                           "Cleanup",
-                                           "Remark",
-                                           "Mixed",
-                                           "Full" };
-    return pause_strings[static_cast<uint>(type)];
-  }
-};
-
-#endif // SHARE_GC_G1_G1GCPAUSETYPES_HPP
diff --git a/src/hotspot/share/gc/g1/g1Policy.cpp b/src/hotspot/share/gc/g1/g1Policy.cpp
index 09043c92722..dce83a3f084 100644
--- a/src/hotspot/share/gc/g1/g1Policy.cpp
+++ b/src/hotspot/share/gc/g1/g1Policy.cpp
@@ -584,7 +584,7 @@ void G1Policy::record_full_collection_end(size_t allocation_word_size) {
   _old_gen_alloc_tracker.reset_after_gc(_g1h->humongous_regions_count() * G1HeapRegion::GrainBytes);
 
   double start_time_sec = cur_pause_start_sec();
-  record_pause(G1GCPauseType::FullGC, start_time_sec, end_sec);
+  record_pause(Pause::Full, start_time_sec, end_sec);
 }
 
 static void log_refinement_stats(const G1ConcurrentRefineStats& stats) {
@@ -699,7 +699,7 @@ void G1Policy::record_concurrent_mark_remark_end() {
   double start_time_sec = cur_pause_start_sec();
   double elapsed_time_ms = (end_time_sec - start_time_sec) * 1000.0;
   _analytics->report_concurrent_mark_remark_times_ms(elapsed_time_ms);
-  record_pause(G1GCPauseType::Remark, start_time_sec, end_time_sec);
+  record_pause(Pause::Remark, start_time_sec, end_time_sec);
 }
 
 G1CollectionSetCandidates* G1Policy::candidates() const {
@@ -790,10 +790,10 @@ void G1Policy::record_young_collection_end(bool concurrent_operation_is_full_mar
   double end_time_sec = Ticks::now().seconds();
   double pause_time_ms = (end_time_sec - start_time_sec) * 1000.0;
 
-  G1GCPauseType this_pause = collector_state()->gc_pause_type(concurrent_operation_is_full_mark);
-  bool is_young_only_pause = G1GCPauseTypeHelper::is_young_only_pause(this_pause);
+  Pause this_pause = collector_state()->gc_pause_type(concurrent_operation_is_full_mark);
+  bool is_young_only_pause = G1CollectorState::is_young_only_pause(this_pause);
 
-  if (G1GCPauseTypeHelper::is_concurrent_start_pause(this_pause)) {
+  if (G1CollectorState::is_concurrent_start_pause(this_pause)) {
     record_concurrent_mark_init_end();
   } else {
     maybe_start_marking(allocation_word_size);
@@ -935,14 +935,14 @@ void G1Policy::record_young_collection_end(bool concurrent_operation_is_full_mar
 
   record_pause(this_pause, start_time_sec, end_time_sec);
 
-  if (G1GCPauseTypeHelper::is_last_young_pause(this_pause)) {
-    assert(!G1GCPauseTypeHelper::is_concurrent_start_pause(this_pause),
+  if (G1CollectorState::is_last_young_pause(this_pause)) {
+    assert(!G1CollectorState::is_concurrent_start_pause(this_pause),
            "The young GC before mixed is not allowed to be concurrent start GC");
     // This has been the young GC before we start doing mixed GCs. We already
     // decided to start mixed GCs much earlier, so there is nothing to do except
     // advancing the state.
     collector_state()->set_in_space_reclamation_phase();
-  } else if (G1GCPauseTypeHelper::is_mixed_pause(this_pause)) {
+  } else if (G1CollectorState::is_mixed_pause(this_pause)) {
     // This is a mixed GC. Here we decide whether to continue doing more
     // mixed GCs or not.
     if (!next_gc_should_be_mixed()) {
@@ -960,7 +960,7 @@ void G1Policy::record_young_collection_end(bool concurrent_operation_is_full_mar
 
   _eden_surv_rate_group->start_adding_regions();
 
-  assert(!(G1GCPauseTypeHelper::is_concurrent_start_pause(this_pause) && collector_state()->is_in_concurrent_cycle()),
+  assert(!(G1CollectorState::is_concurrent_start_pause(this_pause) && collector_state()->is_in_concurrent_cycle()),
          "If the last pause has been concurrent start, we should not have been in the marking cycle");
 
   _free_regions_at_end_of_collection = _g1h->num_free_regions();
@@ -972,7 +972,7 @@ void G1Policy::record_young_collection_end(bool concurrent_operation_is_full_mar
 
     _old_gen_alloc_tracker.reset_after_gc(_g1h->humongous_regions_count() * G1HeapRegion::GrainBytes);
     if (update_ihop_prediction(app_time_ms / 1000.0,
-                               G1GCPauseTypeHelper::is_young_only_pause(this_pause))) {
+                               G1CollectorState::is_young_only_pause(this_pause))) {
       _ihop_control->report_statistics(_g1h->gc_tracer_stw(), _g1h->non_young_occupancy_after_allocation(allocation_word_size));
     }
   } else {
@@ -1340,7 +1340,7 @@ void G1Policy::record_concurrent_mark_cleanup_end(bool has_rebuilt_remembered_se
   double elapsed_time_ms = (end_sec - start_sec) * 1000.0;
   _analytics->report_concurrent_mark_cleanup_times_ms(elapsed_time_ms);
 
-  record_pause(G1GCPauseType::Cleanup, start_sec, end_sec);
+  record_pause(Pause::Cleanup, start_sec, end_sec);
 }
 
 void G1Policy::abandon_collection_set_candidates() {
@@ -1356,25 +1356,25 @@ void G1Policy::maybe_start_marking(size_t allocation_word_size) {
   }
 }
 
-void G1Policy::update_gc_pause_time_ratios(G1GCPauseType gc_type, double start_time_sec, double end_time_sec) {
+void G1Policy::update_gc_pause_time_ratios(Pause gc_type, double start_time_sec, double end_time_sec) {
 
   double pause_time_sec = end_time_sec - start_time_sec;
   double pause_time_ms = pause_time_sec * 1000.0;
 
   _analytics->update_gc_time_ratios(end_time_sec, pause_time_ms);
 
-  if (gc_type == G1GCPauseType::Cleanup || gc_type == G1GCPauseType::Remark) {
+  if (G1CollectorState::is_concurrent_cycle_pause(gc_type)) {
     _analytics->append_prev_collection_pause_end_ms(pause_time_ms);
   } else {
     _analytics->set_prev_collection_pause_end_ms(end_time_sec * 1000.0);
   }
 }
 
-void G1Policy::record_pause(G1GCPauseType gc_type,
+void G1Policy::record_pause(Pause gc_type,
                             double start,
                             double end) {
   // Manage the MMU tracker. For some reason it ignores Full GCs.
-  if (gc_type != G1GCPauseType::FullGC) {
+  if (gc_type != Pause::Full) {
     _mmu_tracker->add_pause(start, end);
   }
 
@@ -1386,21 +1386,21 @@ void G1Policy::record_pause(G1GCPauseType gc_type,
   _analytics->set_gc_cpu_time_at_pause_end_ms(elapsed_gc_cpu_time);
 }
 
-void G1Policy::update_time_to_mixed_tracking(G1GCPauseType gc_type,
+void G1Policy::update_time_to_mixed_tracking(Pause gc_type,
                                              double start,
                                              double end) {
   // Manage the mutator time tracking from concurrent start to first mixed gc.
   switch (gc_type) {
-    case G1GCPauseType::FullGC:
+    case Pause::Full:
       abort_time_to_mixed_tracking();
       break;
-    case G1GCPauseType::Cleanup:
-    case G1GCPauseType::Remark:
-    case G1GCPauseType::YoungGC:
-    case G1GCPauseType::LastYoungGC:
+    case Pause::Cleanup:
+    case Pause::Remark:
+    case Pause::Normal:
+    case Pause::LastYoung:
       _concurrent_start_to_mixed.add_pause(end - start);
       break;
-    case G1GCPauseType::ConcurrentStartMarkGC:
+    case Pause::ConcurrentStartFull:
       // Do not track time-to-mixed time for periodic collections as they are likely
       // to be not representative to regular operation as the mutators are idle at
       // that time. Also only track full concurrent mark cycles.
@@ -1408,12 +1408,12 @@ void G1Policy::update_time_to_mixed_tracking(G1GCPauseType gc_type,
         _concurrent_start_to_mixed.record_concurrent_start_end(end);
       }
       break;
-    case G1GCPauseType::ConcurrentStartUndoGC:
+    case Pause::ConcurrentStartUndo:
       assert(_g1h->gc_cause() == GCCause::_g1_humongous_allocation,
              "GC cause must be humongous allocation but is %d",
              _g1h->gc_cause());
       break;
-    case G1GCPauseType::MixedGC:
+    case Pause::Mixed:
       _concurrent_start_to_mixed.record_mixed_gc_start(start);
       break;
     default:
diff --git a/src/hotspot/share/gc/g1/g1Policy.hpp b/src/hotspot/share/gc/g1/g1Policy.hpp
index 1209c7c02d5..585e26441d5 100644
--- a/src/hotspot/share/gc/g1/g1Policy.hpp
+++ b/src/hotspot/share/gc/g1/g1Policy.hpp
@@ -56,7 +56,7 @@ class GCPolicyCounters;
 class STWGCTimer;
 
 class G1Policy: public CHeapObj<mtGC> {
- private:
+  using Pause = G1CollectorState::Pause;
 
   static G1IHOPControl* create_ihop_control(const G1OldGenAllocationTracker* old_gen_alloc_tracker,
                                             const G1Predictions* predictor);
@@ -268,13 +268,13 @@ private:
   // Sets up marking if proper conditions are met.
   void maybe_start_marking(size_t allocation_word_size);
   // Manage time-to-mixed tracking.
-  void update_time_to_mixed_tracking(G1GCPauseType gc_type, double start, double end);
+  void update_time_to_mixed_tracking(Pause gc_type, double start, double end);
   // Record the given STW pause with the given start and end times (in s).
-  void record_pause(G1GCPauseType gc_type,
+  void record_pause(Pause gc_type,
                     double start,
                     double end);
 
-  void update_gc_pause_time_ratios(G1GCPauseType gc_type, double start_sec, double end_sec);
+  void update_gc_pause_time_ratios(Pause gc_type, double start_sec, double end_sec);
 
   // Indicate that we aborted marking before doing any mixed GCs.
   void abort_time_to_mixed_tracking();
diff --git a/src/hotspot/share/gc/g1/g1Trace.cpp b/src/hotspot/share/gc/g1/g1Trace.cpp
index ed6a91f41ed..242a97ca4e3 100644
--- a/src/hotspot/share/gc/g1/g1Trace.cpp
+++ b/src/hotspot/share/gc/g1/g1Trace.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2019, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2019, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,7 +23,6 @@
  */
 
 #include "gc/g1/g1EvacInfo.hpp"
-#include "gc/g1/g1GCPauseType.hpp"
 #include "gc/g1/g1HeapRegionTraceType.hpp"
 #include "gc/g1/g1Trace.hpp"
 #include "gc/shared/gcHeapSummary.hpp"
@@ -48,12 +47,12 @@ public:
 class G1YCTypeConstant : public JfrSerializer {
 public:
   void serialize(JfrCheckpointWriter& writer) {
-    constexpr EnumRange<G1GCPauseType> types{};
+    constexpr EnumRange<G1CollectorState::Pause> types{};
     static const u4 nof_entries = static_cast<u4>(types.size());
     writer.write_count(nof_entries);
     for (auto index : types) {
       writer.write_key(static_cast<uint>(index));
-      writer.write(G1GCPauseTypeHelper::to_string(index));
+      writer.write(G1CollectorState::to_string(index));
     }
   }
 };
@@ -72,8 +71,8 @@ void G1NewTracer::initialize() {
   JFR_ONLY(register_jfr_type_constants();)
 }
 
-void G1NewTracer::report_young_gc_pause(G1GCPauseType pause) {
-  G1GCPauseTypeHelper::assert_is_young_pause(pause);
+void G1NewTracer::report_young_gc_pause(G1CollectorState::Pause pause) {
+  G1CollectorState::assert_is_young_pause(pause);
   _pause = pause;
 }
 
@@ -128,7 +127,7 @@ void G1NewTracer::report_adaptive_ihop_statistics(size_t threshold,
 
 void G1NewTracer::send_g1_young_gc_event() {
   // Check that the pause type has been updated to something valid for this event.
-  G1GCPauseTypeHelper::assert_is_young_pause(_pause);
+  G1CollectorState::assert_is_young_pause(_pause);
 
   EventG1GarbageCollection e(UNTIMED);
   if (e.should_commit()) {
diff --git a/src/hotspot/share/gc/g1/g1Trace.hpp b/src/hotspot/share/gc/g1/g1Trace.hpp
index a2e11ed4496..bfcc275d2ca 100644
--- a/src/hotspot/share/gc/g1/g1Trace.hpp
+++ b/src/hotspot/share/gc/g1/g1Trace.hpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2019, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2019, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,7 +25,7 @@
 #ifndef SHARE_GC_G1_G1TRACE_HPP
 #define SHARE_GC_G1_G1TRACE_HPP
 
-#include "gc/g1/g1GCPauseType.hpp"
+#include "gc/g1/g1CollectorState.hpp"
 #include "gc/shared/gcTrace.hpp"
 
 class G1EvacInfo;
@@ -33,17 +33,17 @@ class G1HeapSummary;
 class G1EvacSummary;
 
 class G1NewTracer : public YoungGCTracer, public CHeapObj<mtGC> {
-  G1GCPauseType _pause;
+  G1CollectorState::Pause _pause;
 
 public:
   G1NewTracer() :
     YoungGCTracer(G1New),
-    _pause(G1GCPauseType::FullGC) // Initialize to something invalid. For this event, which
+    _pause(G1CollectorState::Pause::Full) // Initialize to something invalid. For this event, which
                                   // is about young collections, FullGC is not a valid value.
   { }
 
   void initialize();
-  void report_young_gc_pause(G1GCPauseType pause);
+  void report_young_gc_pause(G1CollectorState::Pause pause);
   void report_gc_end_impl(const Ticks& timestamp, TimePartitions* time_partitions);
   void report_evacuation_info(G1EvacInfo* info);
   void report_evacuation_failed(EvacuationFailedInfo& ef_info);
diff --git a/src/hotspot/share/gc/g1/g1YoungCollector.cpp b/src/hotspot/share/gc/g1/g1YoungCollector.cpp
index a3693456268..04ccac5ff05 100644
--- a/src/hotspot/share/gc/g1/g1YoungCollector.cpp
+++ b/src/hotspot/share/gc/g1/g1YoungCollector.cpp
@@ -70,7 +70,7 @@
 class G1YoungGCTraceTime {
   G1YoungCollector* _collector;
 
-  G1GCPauseType _pause_type;
+  G1CollectorState::Pause _pause_type;
   GCCause::Cause _pause_cause;
 
   static const uint MaxYoungGCNameLength = 128;
@@ -93,7 +93,7 @@ class G1YoungGCTraceTime {
     os::snprintf_checked(_young_gc_name_data,
                          MaxYoungGCNameLength,
                          "Pause Young (%s) (%s)%s",
-                         G1GCPauseTypeHelper::to_string(_pause_type),
+                         G1CollectorState::to_string(_pause_type),
                          GCCause::to_string(_pause_cause),
                          evacuation_failed_string);
     return _young_gc_name_data;
@@ -142,7 +142,7 @@ public:
   G1YoungGCJFRTracerMark(STWGCTimer* gc_timer_stw, G1NewTracer* gc_tracer_stw, GCCause::Cause cause) :
     G1JFRTracerMark(gc_timer_stw, gc_tracer_stw), _evacuation_info() { }
 
-  void report_pause_type(G1GCPauseType type) {
+  void report_pause_type(G1CollectorState::Pause type) {
     tracer()->report_young_gc_pause(type);
   }
 

From 5c2ef74931c05cac1aa589a8e1f9c242361dc247 Mon Sep 17 00:00:00 2001
From: SendaoYan <syan@openjdk.org>
Date: Mon, 23 Mar 2026 15:58:21 +0000
Subject: [PATCH 309/655] 8380316: Test runtime/os/AvailableProcessors.java
 fails Invalid argument

Reviewed-by: dholmes, ayang
---
 .../jtreg/runtime/os/AvailableProcessors.java | 49 +++++++++++++++++--
 1 file changed, 46 insertions(+), 3 deletions(-)

diff --git a/test/hotspot/jtreg/runtime/os/AvailableProcessors.java b/test/hotspot/jtreg/runtime/os/AvailableProcessors.java
index 18201d99127..51d6742b832 100644
--- a/test/hotspot/jtreg/runtime/os/AvailableProcessors.java
+++ b/test/hotspot/jtreg/runtime/os/AvailableProcessors.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2016, 2023, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2016, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -38,6 +38,9 @@ import jtreg.SkippedException;
 
 import java.util.ArrayList;
 import java.io.File;
+import java.io.BufferedReader;
+import java.io.FileReader;
+import java.io.IOException;
 
 public class AvailableProcessors {
 
@@ -73,13 +76,17 @@ public class AvailableProcessors {
                                                                      "AvailableProcessors");
 
             int[] expected = new int[] { 1, available/2, available-1, available };
+            int cpuId = getFirstAllowedCpu();
+            if (cpuId == -1) {
+                throw new SkippedException("Could not determine allowed CPU cores");
+            }
 
             for (int i : expected) {
                 System.out.println("Testing for " + i + " processors ...");
-                int max = i - 1;
+                int max = i - 1 + cpuId;
                 ArrayList<String> cmdline = new ArrayList<>(master.command());
                 // prepend taskset command
-                cmdline.add(0, "0-" + max);
+                cmdline.add(0, cpuId + "-" + max);
                 cmdline.add(0, "-c");
                 cmdline.add(0, taskset);
                 // append expected processor count
@@ -104,4 +111,40 @@ public class AvailableProcessors {
         else
             System.out.println(SUCCESS_STRING + available);
     }
+
+    /**
+     * Retrieves the first available CPU core ID allowed for the current process on Linux.
+     *
+     * @return The first CPU ID in Cpus_allowed_list, or -1 if unavailable.
+     */
+    static int getFirstAllowedCpu() {
+        final String statusFile = "/proc/self/status";
+        final String targetKey = "Cpus_allowed_list:";
+
+        try (BufferedReader br = new BufferedReader(new FileReader(statusFile))) {
+            String line;
+            while ((line = br.readLine()) != null) {
+                // Look for the line starting with "Cpus_allowed_list:"
+                if (line.startsWith(targetKey)) {
+                    // Extract the value part, e.g., "0-15,32-47" or "80,82,84"
+                    String listValue = line.substring(targetKey.length()).trim();
+                    if (listValue.isEmpty()) return -1;
+
+                    // Get the first segment before any comma (e.g., "0-15" from "0-15,32")
+                    String firstSegment = listValue.split(",")[0];
+
+                    // If it is a range (e.g., "80-159"), take the start number
+                    if (firstSegment.contains("-")) {
+                        return Integer.parseInt(firstSegment.split("-")[0]);
+                    } else {
+                        // If it is a single ID (e.g., "1"), parse it directly
+                        return Integer.parseInt(firstSegment);
+                    }
+                }
+            }
+        } catch (IOException | NumberFormatException | ArrayIndexOutOfBoundsException e) {
+            throw new RuntimeException("Failed to read or parse " + statusFile, e);
+        }
+        return -1;
+    }
 }

From 0798dd149799049ebeb17cc7ed4e57fdebab8fda Mon Sep 17 00:00:00 2001
From: Naoto Sato <naoto@openjdk.org>
Date: Mon, 23 Mar 2026 16:17:35 +0000
Subject: [PATCH 310/655] 8379551: sun/text/IntHashtable/Bug4705389.java timed
 out

Reviewed-by: liach, jpai
---
 test/jdk/sun/text/IntHashtable/Bug4705389.java | 3 +--
 1 file changed, 1 insertion(+), 2 deletions(-)

diff --git a/test/jdk/sun/text/IntHashtable/Bug4705389.java b/test/jdk/sun/text/IntHashtable/Bug4705389.java
index bb688439706..c74dd03b532 100644
--- a/test/jdk/sun/text/IntHashtable/Bug4705389.java
+++ b/test/jdk/sun/text/IntHashtable/Bug4705389.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2002, 2016, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2002, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -26,7 +26,6 @@
  * @bug 4705389
  * @summary Make sure to find removed slots, which test case will be timed out without the fix.
  * @modules java.base/sun.text
- * @run main/timeout=10 Bug4705389
  */
 
 import sun.text.IntHashtable;

From c6a20173a37ec56f3264d5a312543bdfc40ce3d2 Mon Sep 17 00:00:00 2001
From: Phil Race <prr@openjdk.org>
Date: Mon, 23 Mar 2026 17:15:07 +0000
Subject: [PATCH 311/655] 8378615: FFM Bound up call stub keeps JNI Global Ref
 to bound parameter

Reviewed-by: jdv, psadhukhan
---
 .../share/classes/sun/font/HBShaper.java      | 45 +++++++------------
 1 file changed, 16 insertions(+), 29 deletions(-)

diff --git a/src/java.desktop/share/classes/sun/font/HBShaper.java b/src/java.desktop/share/classes/sun/font/HBShaper.java
index 7d3f58fb88f..3a532072004 100644
--- a/src/java.desktop/share/classes/sun/font/HBShaper.java
+++ b/src/java.desktop/share/classes/sun/font/HBShaper.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2023, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2023, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -138,6 +138,7 @@ public class HBShaper {
     private static final MemorySegment get_h_advance_stub;
     private static final MemorySegment get_v_advance_stub;
     private static final MemorySegment get_contour_pt_stub;
+    private static final MemorySegment get_table_data_fn_stub;
 
     private static final MemorySegment store_layout_results_stub;
 
@@ -209,6 +210,12 @@ public class HBShaper {
         jdk_hb_shape_handle = tmp4;
 
         Arena garena = Arena.global(); // creating stubs that exist until VM exit.
+
+        get_table_data_fn_stub = getUpcallStub(garena,
+                "getFontTableData", // method name
+                JAVA_INT,           // return type
+                JAVA_INT, ADDRESS); // arg types
+
         FunctionDescriptor get_var_glyph_fd = getFunctionDescriptor(JAVA_INT,  // return type
               ADDRESS, ADDRESS, JAVA_INT, JAVA_INT, ADDRESS, ADDRESS); // arg types
         MethodHandle get_var_glyph_mh =
@@ -303,15 +310,9 @@ public class HBShaper {
         clusterHandle = getVarHandle(GlyphInfoLayout, "cluster");
     }
 
-
-    /*
-     * This is expensive but it is done just once per font.
-     * The unbound stub could be cached but the savings would
-     * be very low in the only case it is used.
-     */
     @SuppressWarnings("restricted")
-    private static MemorySegment getBoundUpcallStub
-         (Arena arena, Class<?> clazz, Object bindArg, String mName,
+    private static MemorySegment getUpcallStub
+         (Arena arena, String mName,
           MemoryLayout retType, MemoryLayout... argTypes) {
 
        try {
@@ -320,10 +321,8 @@ public class HBShaper {
                    FunctionDescriptor.ofVoid(argTypes) :
                    FunctionDescriptor.of(retType, argTypes);
            MethodType mType = nativeDescriptor.toMethodType();
-           mType = mType.insertParameterTypes(0, clazz);
            MethodHandle mh = MH_LOOKUP.findStatic(HBShaper.class, mName, mType);
-           MethodHandle bound_handle = mh.bindTo(bindArg);
-           return LINKER.upcallStub(bound_handle, nativeDescriptor, arena);
+           return LINKER.upcallStub(mh, nativeDescriptor, arena);
        } catch (IllegalAccessException | NoSuchMethodException e) {
           return null;
        }
@@ -480,15 +479,16 @@ public class HBShaper {
         });
     }
 
-    private static int getFontTableData(Font2D font2D,
-                                int tag,
-                                MemorySegment data_ptr_out) {
+    private static int getFontTableData(int tag, MemorySegment data_ptr_out) {
 
         /*
          * On return, the data_out_ptr will point to memory allocated by native malloc,
          * so it will be freed by the caller using native free - when it is
          * done with it.
          */
+
+        Font2D font2D = scopedVars.get().font();
+
         @SuppressWarnings("restricted")
         MemorySegment data_ptr = data_ptr_out.reinterpret(ADDRESS.byteSize());
         if (tag == 0) {
@@ -539,10 +539,6 @@ public class HBShaper {
     private static class FaceRef implements DisposerRecord {
         private Font2D font2D;
         private MemorySegment face;
-        // get_table_data_fn uses an Arena managed by GC,
-        // so we need to keep a reference to it here until
-        // this FaceRef is collected.
-        private MemorySegment get_table_data_fn;
 
         private FaceRef(Font2D font) {
             this.font2D = font;
@@ -561,16 +557,7 @@ public class HBShaper {
 
         private void createFace() {
             try {
-                get_table_data_fn = getBoundUpcallStub(Arena.ofAuto(),
-                        Font2D.class,
-                        font2D,                      // bind arg
-                        "getFontTableData",          // method name
-                        JAVA_INT,                   // return type
-                        JAVA_INT, ADDRESS); // arg types
-                if (get_table_data_fn == null) {
-                    return;
-                }
-                face = (MemorySegment)create_face_handle.invokeExact(get_table_data_fn);
+                face = (MemorySegment)create_face_handle.invokeExact(get_table_data_fn_stub);
             } catch (Throwable t) {
             }
         }

From 2095051a10f01ffac4fedcd2e3febd7d63f65f40 Mon Sep 17 00:00:00 2001
From: Frederic Parain <fparain@openjdk.org>
Date: Mon, 23 Mar 2026 17:46:44 +0000
Subject: [PATCH 312/655] 8380219: Interpreter debugging would be easier if
 InterpreterCodelets could print their assembly code

Reviewed-by: dholmes, ayang
---
 src/hotspot/share/compiler/disassembler.hpp   |  2 +-
 src/hotspot/share/interpreter/interpreter.cpp | 10 +++++++---
 src/hotspot/share/interpreter/interpreter.hpp |  1 +
 3 files changed, 9 insertions(+), 4 deletions(-)

diff --git a/src/hotspot/share/compiler/disassembler.hpp b/src/hotspot/share/compiler/disassembler.hpp
index db7066c9023..b9de9c3d27d 100644
--- a/src/hotspot/share/compiler/disassembler.hpp
+++ b/src/hotspot/share/compiler/disassembler.hpp
@@ -112,7 +112,7 @@ class Disassembler : public AbstractDisassembler {
   // interpreter code, by riding on the customary __ macro in the interpreter generator.
   // See templateTable_x86.cpp for an example.
   template<class T> inline static T* hook(const char* file, int line, T* masm) {
-    if (PrintInterpreter) {
+    if (PrintInterpreter NOT_PRODUCT(|| true)) {
       _hook(file, line, masm);
     }
     return masm;
diff --git a/src/hotspot/share/interpreter/interpreter.cpp b/src/hotspot/share/interpreter/interpreter.cpp
index 2cc163186e8..1f327152e0c 100644
--- a/src/hotspot/share/interpreter/interpreter.cpp
+++ b/src/hotspot/share/interpreter/interpreter.cpp
@@ -61,10 +61,10 @@ void InterpreterCodelet::initialize(const char* description, Bytecodes::Code byt
 
 void InterpreterCodelet::verify() {}
 
-void InterpreterCodelet::print_on(outputStream* st) const {
+void InterpreterCodelet::print_on(outputStream* st, bool print_code) const {
   ttyLocker ttyl;
 
-  if (AbstractInterpreter::should_print_instructions()) {
+  if (print_code) {
     st->cr();
     st->print_cr("----------------------------------------------------------------------");
   }
@@ -74,12 +74,16 @@ void InterpreterCodelet::print_on(outputStream* st) const {
   st->print_cr("[" INTPTR_FORMAT ", " INTPTR_FORMAT "]  %d bytes",
                 p2i(code_begin()), p2i(code_end()), code_size());
 
-  if (AbstractInterpreter::should_print_instructions()) {
+  if (print_code) {
     st->cr();
     Disassembler::decode(code_begin(), code_end(), st NOT_PRODUCT(COMMA &_asm_remarks));
   }
 }
 
+void InterpreterCodelet::print_on(outputStream* st) const {
+  print_on(st, AbstractInterpreter::should_print_instructions());
+}
+
 void InterpreterCodelet::print() const { print_on(tty); }
 
 CodeletMark::CodeletMark(InterpreterMacroAssembler*& masm,
diff --git a/src/hotspot/share/interpreter/interpreter.hpp b/src/hotspot/share/interpreter/interpreter.hpp
index f7d42fcb4da..fb368638332 100644
--- a/src/hotspot/share/interpreter/interpreter.hpp
+++ b/src/hotspot/share/interpreter/interpreter.hpp
@@ -67,6 +67,7 @@ class InterpreterCodelet: public Stub {
 
   // Debugging
   void    verify();
+  void    print_on(outputStream* st, bool print_code) const;
   void    print_on(outputStream* st) const;
   void    print() const;
 

From f1169bfcf1e5c916c12e33539a2ba8624eca1ead Mon Sep 17 00:00:00 2001
From: Vladimir Kozlov <kvn@openjdk.org>
Date: Mon, 23 Mar 2026 18:09:23 +0000
Subject: [PATCH 313/655] 8378195: guarantee(static_cast<int>(_oops_size) ==
 align_up(code_buffer->total_oop_size(), oopSize)) failed: failed: 12272 !=
 77808

Co-authored-by: Doug Simon <dnsimon@openjdk.org>
Reviewed-by: dnsimon, iveresov, vlivanov
---
 src/hotspot/share/code/nmethod.cpp | 9 ++-------
 src/hotspot/share/code/nmethod.hpp | 3 +--
 2 files changed, 3 insertions(+), 9 deletions(-)

diff --git a/src/hotspot/share/code/nmethod.cpp b/src/hotspot/share/code/nmethod.cpp
index 4c2f9157b99..5a6ed8ab3ed 100644
--- a/src/hotspot/share/code/nmethod.cpp
+++ b/src/hotspot/share/code/nmethod.cpp
@@ -1306,9 +1306,7 @@ nmethod::nmethod(
     _deopt_handler_entry_offset    = 0;
     _unwind_handler_offset   = 0;
 
-    CHECKED_CAST(_oops_size, uint16_t, align_up(code_buffer->total_oop_size(), oopSize));
-    uint16_t metadata_size;
-    CHECKED_CAST(metadata_size, uint16_t, align_up(code_buffer->total_metadata_size(), wordSize));
+    int metadata_size = align_up(code_buffer->total_metadata_size(), wordSize);
     JVMCI_ONLY( _metadata_size = metadata_size; )
     assert(_mutable_data_size == _relocation_size + metadata_size,
            "wrong mutable data size: %d != %d + %d",
@@ -1446,7 +1444,6 @@ nmethod::nmethod(const nmethod &nm) : CodeBlob(nm._name, nm._kind, nm._size, nm.
   _deopt_handler_entry_offset   = nm._deopt_handler_entry_offset;
   _unwind_handler_offset        = nm._unwind_handler_offset;
   _num_stack_arg_slots          = nm._num_stack_arg_slots;
-  _oops_size                    = nm._oops_size;
 #if INCLUDE_JVMCI
   _metadata_size                = nm._metadata_size;
 #endif
@@ -1749,9 +1746,7 @@ nmethod::nmethod(
       _unwind_handler_offset = -1;
     }
 
-    CHECKED_CAST(_oops_size, uint16_t, align_up(code_buffer->total_oop_size(), oopSize));
-    uint16_t metadata_size;
-    CHECKED_CAST(metadata_size, uint16_t, align_up(code_buffer->total_metadata_size(), wordSize));
+    int metadata_size = align_up(code_buffer->total_metadata_size(), wordSize);
     JVMCI_ONLY( _metadata_size = metadata_size; )
     int jvmci_data_size = 0 JVMCI_ONLY( + align_up(compiler->is_jvmci() ? jvmci_data->size() : 0, oopSize));
     assert(_mutable_data_size == _relocation_size + metadata_size + jvmci_data_size,
diff --git a/src/hotspot/share/code/nmethod.hpp b/src/hotspot/share/code/nmethod.hpp
index 2391bc6d830..092da181f12 100644
--- a/src/hotspot/share/code/nmethod.hpp
+++ b/src/hotspot/share/code/nmethod.hpp
@@ -235,11 +235,10 @@ class nmethod : public CodeBlob {
   // Number of arguments passed on the stack
   uint16_t _num_stack_arg_slots;
 
-  uint16_t _oops_size;
 #if INCLUDE_JVMCI
   // _metadata_size is not specific to JVMCI. In the non-JVMCI case, it can be derived as:
   // _metadata_size = mutable_data_size - relocation_size
-  uint16_t _metadata_size;
+  int _metadata_size;
 #endif
 
   // Offset in immutable data section

From d85fbd38cd53f7a8f0a40668c6b0c33e1b17641e Mon Sep 17 00:00:00 2001
From: Hannes Greule <hgreule@openjdk.org>
Date: Mon, 23 Mar 2026 21:06:03 +0000
Subject: [PATCH 314/655] 8370138: C2: clean up
 Matcher::use_asm_for_ldiv_by_con can

Reviewed-by: qamai, snatarajan
---
 src/hotspot/cpu/aarch64/aarch64.ad | 4 ----
 src/hotspot/cpu/arm/arm.ad         | 6 +-----
 src/hotspot/cpu/ppc/ppc.ad         | 4 ----
 src/hotspot/cpu/riscv/riscv.ad     | 4 ----
 src/hotspot/cpu/s390/s390.ad       | 4 ----
 src/hotspot/cpu/x86/x86.ad         | 7 -------
 src/hotspot/share/opto/divnode.cpp | 3 +--
 src/hotspot/share/opto/matcher.hpp | 4 ----
 8 files changed, 2 insertions(+), 34 deletions(-)

diff --git a/src/hotspot/cpu/aarch64/aarch64.ad b/src/hotspot/cpu/aarch64/aarch64.ad
index 3989c5a17f0..b79030f07e7 100644
--- a/src/hotspot/cpu/aarch64/aarch64.ad
+++ b/src/hotspot/cpu/aarch64/aarch64.ad
@@ -2524,10 +2524,6 @@ uint Matcher::float_pressure_limit()
   return (FLOATPRESSURE == -1) ? _FLOAT_REG_mask.size() : FLOATPRESSURE;
 }
 
-bool Matcher::use_asm_for_ldiv_by_con(jlong divisor) {
-  return false;
-}
-
 const RegMask& Matcher::divI_proj_mask() {
   ShouldNotReachHere();
   return RegMask::EMPTY;
diff --git a/src/hotspot/cpu/arm/arm.ad b/src/hotspot/cpu/arm/arm.ad
index 7d0d31c1f79..60a0ef307b5 100644
--- a/src/hotspot/cpu/arm/arm.ad
+++ b/src/hotspot/cpu/arm/arm.ad
@@ -1,5 +1,5 @@
 //
-// Copyright (c) 2008, 2025, Oracle and/or its affiliates. All rights reserved.
+// Copyright (c) 2008, 2026, Oracle and/or its affiliates. All rights reserved.
 // DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
 //
 // This code is free software; you can redistribute it and/or modify it
@@ -1112,10 +1112,6 @@ uint Matcher::float_pressure_limit()
   return (FLOATPRESSURE == -1) ? 30 : FLOATPRESSURE;
 }
 
-bool Matcher::use_asm_for_ldiv_by_con( jlong divisor ) {
-  return false;
-}
-
 // Register for DIVI projection of divmodI
 const RegMask& Matcher::divI_proj_mask() {
   ShouldNotReachHere();
diff --git a/src/hotspot/cpu/ppc/ppc.ad b/src/hotspot/cpu/ppc/ppc.ad
index 3b25604471f..f3d33b4305d 100644
--- a/src/hotspot/cpu/ppc/ppc.ad
+++ b/src/hotspot/cpu/ppc/ppc.ad
@@ -2457,10 +2457,6 @@ uint Matcher::float_pressure_limit()
   return (FLOATPRESSURE == -1) ? 28 : FLOATPRESSURE;
 }
 
-bool Matcher::use_asm_for_ldiv_by_con(jlong divisor) {
-  return false;
-}
-
 // Register for DIVI projection of divmodI.
 const RegMask& Matcher::divI_proj_mask() {
   ShouldNotReachHere();
diff --git a/src/hotspot/cpu/riscv/riscv.ad b/src/hotspot/cpu/riscv/riscv.ad
index e140052d168..54c0d9c0955 100644
--- a/src/hotspot/cpu/riscv/riscv.ad
+++ b/src/hotspot/cpu/riscv/riscv.ad
@@ -2111,10 +2111,6 @@ uint Matcher::float_pressure_limit()
   return (FLOATPRESSURE == -1) ? _FLOAT_REG_mask.size() : FLOATPRESSURE;
 }
 
-bool Matcher::use_asm_for_ldiv_by_con(jlong divisor) {
-  return false;
-}
-
 const RegMask& Matcher::divI_proj_mask() {
   ShouldNotReachHere();
   return RegMask::EMPTY;
diff --git a/src/hotspot/cpu/s390/s390.ad b/src/hotspot/cpu/s390/s390.ad
index b9982c795cd..2208a197ac9 100644
--- a/src/hotspot/cpu/s390/s390.ad
+++ b/src/hotspot/cpu/s390/s390.ad
@@ -1929,10 +1929,6 @@ uint Matcher::float_pressure_limit()
   return (FLOATPRESSURE == -1) ? 15 : FLOATPRESSURE;
 }
 
-bool Matcher::use_asm_for_ldiv_by_con(jlong divisor) {
-  return false;
-}
-
 // Register for DIVI projection of divmodI
 const RegMask& Matcher::divI_proj_mask() {
   return _Z_RARG4_INT_REG_mask;
diff --git a/src/hotspot/cpu/x86/x86.ad b/src/hotspot/cpu/x86/x86.ad
index 8b90655c53c..2fd4e5516fc 100644
--- a/src/hotspot/cpu/x86/x86.ad
+++ b/src/hotspot/cpu/x86/x86.ad
@@ -2763,13 +2763,6 @@ uint Matcher::float_pressure_limit()
   return (FLOATPRESSURE == -1) ? default_float_pressure_threshold : FLOATPRESSURE;
 }
 
-bool Matcher::use_asm_for_ldiv_by_con( jlong divisor ) {
-  // In 64 bit mode a code which use multiply when
-  // devisor is constant is faster than hardware
-  // DIV instruction (it uses MulHiL).
-  return false;
-}
-
 // Register for DIVI projection of divmodI
 const RegMask& Matcher::divI_proj_mask() {
   return INT_RAX_REG_mask();
diff --git a/src/hotspot/share/opto/divnode.cpp b/src/hotspot/share/opto/divnode.cpp
index c38e784a7af..b398ec27b80 100644
--- a/src/hotspot/share/opto/divnode.cpp
+++ b/src/hotspot/share/opto/divnode.cpp
@@ -419,8 +419,7 @@ static Node *transform_long_divide( PhaseGVN *phase, Node *dividend, jlong divis
     if (!d_pos) {
       q = new SubLNode(phase->longcon(0), phase->transform(q));
     }
-  } else if ( !Matcher::use_asm_for_ldiv_by_con(d) ) { // Use hardware DIV instruction when
-                                                       // it is faster than code generated below.
+  } else {
     // Attempt the jlong constant divide -> multiply transform found in
     //   "Division by Invariant Integers using Multiplication"
     //     by Granlund and Montgomery
diff --git a/src/hotspot/share/opto/matcher.hpp b/src/hotspot/share/opto/matcher.hpp
index 69e5ab354f1..4de41d6f2ef 100644
--- a/src/hotspot/share/opto/matcher.hpp
+++ b/src/hotspot/share/opto/matcher.hpp
@@ -429,10 +429,6 @@ public:
   // Register for MODL projection of divmodL
   static const RegMask& modL_proj_mask();
 
-  // Use hardware DIV instruction when it is faster than
-  // a code which use multiply for division by constant.
-  static bool use_asm_for_ldiv_by_con( jlong divisor );
-
   // Java-Interpreter calling convention
   // (what you use when calling between compiled-Java and Interpreted-Java
 

From e0fe86b53bdd0b208b10cc8a3e8ddc09910dfd75 Mon Sep 17 00:00:00 2001
From: Alexey Semenyuk <asemenyuk@openjdk.org>
Date: Tue, 24 Mar 2026 01:17:38 +0000
Subject: [PATCH 315/655] 8371924: --mac-app-store should be accepted option
 for app image signing

Reviewed-by: almatvee
---
 .../jdk/jpackage/internal/MacFromOptions.java | 22 ++++-----
 .../internal/MacRuntimeValidator.java         | 34 ++++++++++----
 .../resources/MacResources.properties         |  1 +
 .../jpackage/internal/cli/StandardOption.java |  2 +-
 .../jdk/jpackage/test/JPackageCommand.java    | 14 +++++-
 .../jdk/jpackage/test/LauncherVerifier.java   | 14 +++++-
 .../cli/OptionsValidationFailTest.excludes    |  1 +
 .../jpackage/internal/cli/jpackage-options.md |  2 +-
 .../jpackage/macosx/SigningAppImageTest.java  |  1 -
 .../macosx/SigningAppImageTwoStepsTest.java   | 34 +++++++++++++-
 test/jdk/tools/jpackage/share/ErrorTest.java  | 45 +++++++++++++++++--
 11 files changed, 138 insertions(+), 32 deletions(-)

diff --git a/src/jdk.jpackage/macosx/classes/jdk/jpackage/internal/MacFromOptions.java b/src/jdk.jpackage/macosx/classes/jdk/jpackage/internal/MacFromOptions.java
index 20dcbcf5742..2c247ed3989 100644
--- a/src/jdk.jpackage/macosx/classes/jdk/jpackage/internal/MacFromOptions.java
+++ b/src/jdk.jpackage/macosx/classes/jdk/jpackage/internal/MacFromOptions.java
@@ -27,8 +27,6 @@ package jdk.jpackage.internal;
 import static jdk.jpackage.internal.FromOptions.buildApplicationBuilder;
 import static jdk.jpackage.internal.FromOptions.createPackageBuilder;
 import static jdk.jpackage.internal.MacPackagingPipeline.APPLICATION_LAYOUT;
-import static jdk.jpackage.internal.MacRuntimeValidator.validateRuntimeHasJliLib;
-import static jdk.jpackage.internal.MacRuntimeValidator.validateRuntimeHasNoBinDir;
 import static jdk.jpackage.internal.OptionUtils.isBundlingOperation;
 import static jdk.jpackage.internal.cli.StandardBundlingOperation.CREATE_MAC_PKG;
 import static jdk.jpackage.internal.cli.StandardOption.APPCLASS;
@@ -203,12 +201,14 @@ final class MacFromOptions {
         final var predefinedRuntimeLayout = PREDEFINED_RUNTIME_IMAGE.findIn(options)
                 .map(MacPackage::guessRuntimeLayout);
 
-        predefinedRuntimeLayout.ifPresent(layout -> {
-            validateRuntimeHasJliLib(layout);
-            if (MAC_APP_STORE.containsIn(options)) {
-                validateRuntimeHasNoBinDir(layout);
-            }
-        });
+        predefinedRuntimeLayout.ifPresent(MacRuntimeValidator::validateRuntimeHasJliLib);
+
+        if (MAC_APP_STORE.containsIn(options)) {
+            PREDEFINED_APP_IMAGE.findIn(options)
+                    .map(APPLICATION_LAYOUT::resolveAt)
+                    .ifPresent(MacRuntimeValidator::validateRuntimeHasNoBinDir);
+            predefinedRuntimeLayout.ifPresent(MacRuntimeValidator::validateRuntimeHasNoBinDir);
+        }
 
         final var launcherFromOptions = new LauncherFromOptions().faMapper(MacFromOptions::createMacFa);
 
@@ -269,11 +269,13 @@ final class MacFromOptions {
         final boolean sign = MAC_SIGN.getFrom(options);
         final boolean appStore;
 
-        if (PREDEFINED_APP_IMAGE.containsIn(options)) {
+        if (MAC_APP_STORE.containsIn(options)) {
+            appStore = MAC_APP_STORE.getFrom(options);
+        } else if (PREDEFINED_APP_IMAGE.containsIn(options)) {
             final var appImageFileOptions = appBuilder.externalApplication().orElseThrow().extra();
             appStore = MAC_APP_STORE.getFrom(appImageFileOptions);
         } else {
-            appStore = MAC_APP_STORE.getFrom(options);
+            appStore = false;
         }
 
         appBuilder.appStore(appStore);
diff --git a/src/jdk.jpackage/macosx/classes/jdk/jpackage/internal/MacRuntimeValidator.java b/src/jdk.jpackage/macosx/classes/jdk/jpackage/internal/MacRuntimeValidator.java
index cfab12cbcba..340078849c7 100644
--- a/src/jdk.jpackage/macosx/classes/jdk/jpackage/internal/MacRuntimeValidator.java
+++ b/src/jdk.jpackage/macosx/classes/jdk/jpackage/internal/MacRuntimeValidator.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2025, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -30,6 +30,10 @@ import java.nio.file.Files;
 import java.nio.file.NoSuchFileException;
 import java.nio.file.Path;
 import java.util.function.Predicate;
+import jdk.jpackage.internal.model.AppImageLayout;
+import jdk.jpackage.internal.model.ApplicationLayout;
+import jdk.jpackage.internal.model.ConfigException;
+import jdk.jpackage.internal.model.JPackageException;
 import jdk.jpackage.internal.model.RuntimeLayout;
 
 final class MacRuntimeValidator {
@@ -45,17 +49,29 @@ final class MacRuntimeValidator {
             throw new UncheckedIOException(ex);
         }
 
-        throw I18N.buildConfigException("error.invalid-runtime-image-missing-file",
+        throw new JPackageException(I18N.format("error.invalid-runtime-image-missing-file",
                 runtimeLayout.rootDirectory(),
-                runtimeLayout.unresolve().runtimeDirectory().resolve("lib/**").resolve(jliName)).create();
+                runtimeLayout.unresolve().runtimeDirectory().resolve("lib/**").resolve(jliName)));
     }
 
-    static void validateRuntimeHasNoBinDir(RuntimeLayout runtimeLayout) {
-        if (Files.isDirectory(runtimeLayout.runtimeDirectory().resolve("bin"))) {
-            throw I18N.buildConfigException()
-                    .message("error.invalid-runtime-image-bin-dir", runtimeLayout.rootDirectory())
-                    .advice("error.invalid-runtime-image-bin-dir.advice", "--mac-app-store")
-                    .create();
+    static void validateRuntimeHasNoBinDir(AppImageLayout appImageLayout) {
+        if (Files.isDirectory(appImageLayout.runtimeDirectory().resolve("bin"))) {
+            switch (appImageLayout) {
+                case RuntimeLayout runtimeLayout -> {
+                    throw new ConfigException(
+                            I18N.format("error.invalid-runtime-image-bin-dir", runtimeLayout.rootDirectory()),
+                            I18N.format("error.invalid-runtime-image-bin-dir.advice", "--mac-app-store"));
+                }
+                case ApplicationLayout appLayout -> {
+                    throw new JPackageException(I18N.format("error.invalid-app-image-runtime-image-bin-dir",
+                            appLayout.rootDirectory().relativize(appLayout.runtimeDirectory()),
+                            appLayout.rootDirectory()));
+                }
+                default -> {
+                    throw new IllegalArgumentException();
+                }
+            }
+
         }
     }
 }
diff --git a/src/jdk.jpackage/macosx/classes/jdk/jpackage/internal/resources/MacResources.properties b/src/jdk.jpackage/macosx/classes/jdk/jpackage/internal/resources/MacResources.properties
index 90c4162b80e..95fff00152b 100644
--- a/src/jdk.jpackage/macosx/classes/jdk/jpackage/internal/resources/MacResources.properties
+++ b/src/jdk.jpackage/macosx/classes/jdk/jpackage/internal/resources/MacResources.properties
@@ -29,6 +29,7 @@ error.cert.not.found=No certificate found matching [{0}] using keychain [{1}]
 error.multiple.certs.found=Multiple certificates matching name [{0}] found in keychain [{1}]
 error.app-image.mac-sign.required=--mac-sign option is required with predefined application image and with type [app-image]
 error.invalid-runtime-image-missing-file=Runtime image "{0}" is missing "{1}" file
+error.invalid-app-image-runtime-image-bin-dir=Runtime directory {0} in the predefined application image [{1}] should not contain "bin" folder
 error.invalid-runtime-image-bin-dir=Runtime image "{0}" should not contain "bin" folder
 error.invalid-runtime-image-bin-dir.advice=Use --strip-native-commands jlink option when generating runtime image used with {0} option
 error.invalid-app-image-plist-file=Invalid "{0}" file in the predefined application image
diff --git a/src/jdk.jpackage/share/classes/jdk/jpackage/internal/cli/StandardOption.java b/src/jdk.jpackage/share/classes/jdk/jpackage/internal/cli/StandardOption.java
index c2338b87fad..438a5ac3e6f 100644
--- a/src/jdk.jpackage/share/classes/jdk/jpackage/internal/cli/StandardOption.java
+++ b/src/jdk.jpackage/share/classes/jdk/jpackage/internal/cli/StandardOption.java
@@ -342,7 +342,7 @@ public final class StandardOption {
 
     public static final OptionValue<Boolean> MAC_SIGN = booleanOption("mac-sign").scope(MAC_SIGNING).addAliases("s").create();
 
-    public static final OptionValue<Boolean> MAC_APP_STORE = booleanOption("mac-app-store").create();
+    public static final OptionValue<Boolean> MAC_APP_STORE = booleanOption("mac-app-store").scope(MAC_SIGNING).create();
 
     public static final OptionValue<String> MAC_APP_CATEGORY = stringOption("mac-app-category").create();
 
diff --git a/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/JPackageCommand.java b/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/JPackageCommand.java
index 6b1f67d50f4..4fad120d0f6 100644
--- a/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/JPackageCommand.java
+++ b/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/JPackageCommand.java
@@ -392,7 +392,6 @@ public class JPackageCommand extends CommandArguments<JPackageCommand> {
     }
 
     public JPackageCommand setFakeRuntime() {
-        verifyMutable();
         addPrerequisiteAction(cmd -> {
             cmd.setArgumentValue("--runtime-image", createInputRuntimeImage(RuntimeImageType.RUNTIME_TYPE_FAKE));
         });
@@ -400,12 +399,22 @@ public class JPackageCommand extends CommandArguments<JPackageCommand> {
         return this;
     }
 
+    public JPackageCommand usePredefinedAppImage(JPackageCommand appImageCmd) {
+        appImageCmd.verifyIsOfType(PackageType.IMAGE);
+        verifyIsOfType(PackageType.IMAGE);
+        appImageCmd.getVerifyActionsWithRole(ActionRole.LAUNCHER_VERIFIER).forEach(verifier -> {
+            addVerifyAction(verifier, ActionRole.LAUNCHER_VERIFIER);
+        });
+        return usePredefinedAppImage(appImageCmd.outputBundle());
+    }
+
     public JPackageCommand usePredefinedAppImage(Path predefinedAppImagePath) {
         return setArgumentValue("--app-image", Objects.requireNonNull(predefinedAppImagePath))
                 .removeArgumentWithValue("--input");
     }
 
     JPackageCommand addPrerequisiteAction(ThrowingConsumer<JPackageCommand, ? extends Exception> action) {
+        verifyMutable();
         prerequisiteActions.add(action);
         return this;
     }
@@ -421,6 +430,7 @@ public class JPackageCommand extends CommandArguments<JPackageCommand> {
     }
 
     JPackageCommand addVerifyAction(ThrowingConsumer<JPackageCommand, ? extends Exception> action, ActionRole actionRole) {
+        verifyMutable();
         verifyActions.add(action, actionRole);
         return this;
     }
@@ -2033,7 +2043,7 @@ public class JPackageCommand extends CommandArguments<JPackageCommand> {
     // `--runtime-image` parameter set.
     public static final Path DEFAULT_RUNTIME_IMAGE = Optional.ofNullable(TKit.getConfigProperty("runtime-image")).map(Path::of).orElse(null);
 
-    public final static String DEFAULT_VERSION = "1.0";
+    public static final String DEFAULT_VERSION = "1.0";
 
     // [HH:mm:ss.SSS]
     private static final Pattern TIMESTAMP_REGEXP = Pattern.compile(
diff --git a/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/LauncherVerifier.java b/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/LauncherVerifier.java
index f9fcfb905af..7657517bad5 100644
--- a/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/LauncherVerifier.java
+++ b/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/LauncherVerifier.java
@@ -372,14 +372,21 @@ public final class LauncherVerifier {
 
         TKit.assertTrue(entitlements.isPresent(), String.format("Check [%s] launcher is signed with entitlements", name));
 
+        String expectedEntitlementsOrigin;
+
         var customFile = Optional.ofNullable(cmd.getArgumentValue("--mac-entitlements")).map(Path::of);
-        if (customFile.isEmpty()) {
+        if (customFile.isPresent()) {
+            expectedEntitlementsOrigin = String.format("custom entitlements from [%s] file", customFile.get());
+        } else {
             // Try from the resource dir.
             var resourceDirFile = Optional.ofNullable(cmd.getArgumentValue("--resource-dir")).map(Path::of).map(resourceDir -> {
                 return resourceDir.resolve(cmd.name() + ".entitlements");
             }).filter(Files::exists);
             if (resourceDirFile.isPresent()) {
                 customFile = resourceDirFile;
+                expectedEntitlementsOrigin = "custom entitlements from the resource directory";
+            } else {
+                expectedEntitlementsOrigin = null;
             }
         }
 
@@ -388,11 +395,14 @@ public final class LauncherVerifier {
             expected = new PListReader(Files.readAllBytes(customFile.orElseThrow())).toMap(true);
         } else if (cmd.hasArgument("--mac-app-store")) {
             expected = DefaultEntitlements.APP_STORE;
+            expectedEntitlementsOrigin = "App Store entitlements";
         } else {
+            expectedEntitlementsOrigin = "default entitlements";
             expected = DefaultEntitlements.STANDARD;
         }
 
-        TKit.assertEquals(expected, entitlements.orElseThrow().toMap(true), String.format("Check [%s] launcher is signed with expected entitlements", name));
+        TKit.assertEquals(expected, entitlements.orElseThrow().toMap(true),
+                String.format("Check [%s] launcher is signed with %s", name, expectedEntitlementsOrigin));
     }
 
     private void executeLauncher(JPackageCommand cmd) throws IOException {
diff --git a/test/jdk/tools/jpackage/junit/share/jdk.jpackage/jdk/jpackage/internal/cli/OptionsValidationFailTest.excludes b/test/jdk/tools/jpackage/junit/share/jdk.jpackage/jdk/jpackage/internal/cli/OptionsValidationFailTest.excludes
index 32968db0606..19478aaa4a7 100644
--- a/test/jdk/tools/jpackage/junit/share/jdk.jpackage/jdk/jpackage/internal/cli/OptionsValidationFailTest.excludes
+++ b/test/jdk/tools/jpackage/junit/share/jdk.jpackage/jdk/jpackage/internal/cli/OptionsValidationFailTest.excludes
@@ -40,6 +40,7 @@ ErrorTest.test(WIN_MSI; app-desc=Hello; args-add=[--app-version, 1234]; errors=[
 ErrorTest.test(WIN_MSI; app-desc=Hello; args-add=[--app-version, 256.1]; errors=[message.error-header+[error.msi-product-version-major-out-of-range], message.advice-header+[error.version-string-wrong-format.advice]])
 ErrorTest.test(WIN_MSI; app-desc=Hello; args-add=[--launcher-as-service]; errors=[message.error-header+[error.missing-service-installer], message.advice-header+[error.missing-service-installer.advice]])
 ErrorTest.test(args-add=[@foo]; errors=[message.error-header+[ERR_CannotParseOptions, foo]])
+ErrorTest.testMacSignAppStoreInvalidRuntime
 ErrorTest.testMacSignWithoutIdentity(IMAGE; app-desc=Hello; args-add=[--mac-sign, --mac-signing-keychain, @@EMPTY_KEYCHAIN@@]; errors=[message.error-header+[error.cert.not.found, CODE_SIGN, EMPTY_KEYCHAIN]])
 ErrorTest.testMacSignWithoutIdentity(IMAGE; args-add=[--app-image, @@APP_IMAGE_WITH_SHORT_NAME@@, --mac-sign, --mac-signing-keychain, @@EMPTY_KEYCHAIN@@]; errors=[message.error-header+[error.cert.not.found, CODE_SIGN, EMPTY_KEYCHAIN]])
 ErrorTest.testMacSignWithoutIdentity(MAC_DMG; app-desc=Hello; args-add=[--mac-sign, --mac-signing-keychain, @@EMPTY_KEYCHAIN@@]; errors=[message.error-header+[error.cert.not.found, CODE_SIGN, EMPTY_KEYCHAIN]])
diff --git a/test/jdk/tools/jpackage/junit/share/jdk.jpackage/jdk/jpackage/internal/cli/jpackage-options.md b/test/jdk/tools/jpackage/junit/share/jdk.jpackage/jdk/jpackage/internal/cli/jpackage-options.md
index 64d3c6c075b..59ae0d176c1 100644
--- a/test/jdk/tools/jpackage/junit/share/jdk.jpackage/jdk/jpackage/internal/cli/jpackage-options.md
+++ b/test/jdk/tools/jpackage/junit/share/jdk.jpackage/jdk/jpackage/internal/cli/jpackage-options.md
@@ -29,7 +29,7 @@
 | --linux-shortcut | linux-deb, linux-rpm | x | x | x | USE_LAST |
 | --mac-app-category | mac-bundle | x | x |  | USE_LAST |
 | --mac-app-image-sign-identity | mac | x | x |  | USE_LAST |
-| --mac-app-store | mac-bundle | x | x |  | USE_LAST |
+| --mac-app-store | mac | x | x |  | USE_LAST |
 | --mac-dmg-content | mac-dmg | x | x |  | CONCATENATE |
 | --mac-entitlements | mac | x | x |  | USE_LAST |
 | --mac-installer-sign-identity | mac-pkg | x | x |  | USE_LAST |
diff --git a/test/jdk/tools/jpackage/macosx/SigningAppImageTest.java b/test/jdk/tools/jpackage/macosx/SigningAppImageTest.java
index 3a257a425b6..fc146270ab8 100644
--- a/test/jdk/tools/jpackage/macosx/SigningAppImageTest.java
+++ b/test/jdk/tools/jpackage/macosx/SigningAppImageTest.java
@@ -64,7 +64,6 @@ public class SigningAppImageTest {
 
         var testAL = new AdditionalLauncher("testAL");
         testAL.applyTo(cmd);
-        cmd.executeAndAssertHelloAppImageCreated();
 
         MacSign.withKeychain(keychain -> {
             sign.addTo(cmd);
diff --git a/test/jdk/tools/jpackage/macosx/SigningAppImageTwoStepsTest.java b/test/jdk/tools/jpackage/macosx/SigningAppImageTwoStepsTest.java
index a6d94b59bd9..20af9572044 100644
--- a/test/jdk/tools/jpackage/macosx/SigningAppImageTwoStepsTest.java
+++ b/test/jdk/tools/jpackage/macosx/SigningAppImageTwoStepsTest.java
@@ -26,6 +26,7 @@ import java.util.Collection;
 import java.util.List;
 import java.util.Objects;
 import java.util.Optional;
+import java.util.function.Consumer;
 import java.util.stream.Collectors;
 import java.util.stream.Stream;
 import jdk.jpackage.test.AdditionalLauncher;
@@ -68,6 +69,22 @@ public class SigningAppImageTwoStepsTest {
         spec.test();
     }
 
+    @Test
+    public static void testAppStore() {
+
+        var sign = new SignKeyOptionWithKeychain(
+                SignKeyOption.Type.SIGN_KEY_USER_SHORT_NAME,
+                SigningBase.StandardCertificateRequest.CODESIGN,
+                SigningBase.StandardKeychain.MAIN.keychain());
+
+        var spec = new TestSpec(Optional.empty(), sign);
+
+        spec.signAppImage(spec.createAppImage(), Optional.of(cmd -> {
+            cmd.addArgument("--mac-app-store");
+        }));
+    }
+
+
     public record TestSpec(Optional<SignKeyOptionWithKeychain> signAppImage, SignKeyOptionWithKeychain sign) {
 
         public TestSpec {
@@ -133,7 +150,7 @@ public class SigningAppImageTwoStepsTest {
             private SignKeyOptionWithKeychain sign;
         }
 
-        void test() {
+        JPackageCommand createAppImage() {
             var appImageCmd = JPackageCommand.helloAppImage()
                     .setFakeRuntime()
                     .setArgumentValue("--dest", TKit.createTempDirectory("appimage"));
@@ -150,16 +167,29 @@ public class SigningAppImageTwoStepsTest {
                 }, signOption.keychain());
             }, appImageCmd::execute);
 
+            return appImageCmd;
+        }
+
+        void signAppImage(JPackageCommand appImageCmd, Optional<Consumer<JPackageCommand>> mutator) {
+            Objects.requireNonNull(appImageCmd);
+            Objects.requireNonNull(mutator);
+
             MacSign.withKeychain(keychain -> {
                 var cmd = new JPackageCommand()
                         .setPackageType(PackageType.IMAGE)
-                        .addArguments("--app-image", appImageCmd.outputBundle())
+                        .usePredefinedAppImage(appImageCmd)
                         .mutate(sign::addTo);
 
+                mutator.ifPresent(cmd::mutate);
+
                 cmd.executeAndAssertHelloAppImageCreated();
                 MacSignVerify.verifyAppImageSigned(cmd, sign.certRequest());
             }, sign.keychain());
         }
+
+        void test() {
+            signAppImage(createAppImage(), Optional.empty());
+        }
     }
 
     public static Collection<Object[]> test() {
diff --git a/test/jdk/tools/jpackage/share/ErrorTest.java b/test/jdk/tools/jpackage/share/ErrorTest.java
index 2797115b202..fbaec8283e8 100644
--- a/test/jdk/tools/jpackage/share/ErrorTest.java
+++ b/test/jdk/tools/jpackage/share/ErrorTest.java
@@ -26,7 +26,6 @@ import static java.util.stream.Collectors.toMap;
 import static jdk.internal.util.OperatingSystem.LINUX;
 import static jdk.internal.util.OperatingSystem.MACOS;
 import static jdk.internal.util.OperatingSystem.WINDOWS;
-import static jdk.jpackage.internal.util.PListWriter.writeDict;
 import static jdk.jpackage.internal.util.PListWriter.writePList;
 import static jdk.jpackage.internal.util.XmlUtils.createXml;
 import static jdk.jpackage.internal.util.XmlUtils.toXmlConsumer;
@@ -35,6 +34,7 @@ import static jdk.jpackage.internal.util.function.ThrowingSupplier.toSupplier;
 import static jdk.jpackage.test.JPackageCommand.makeAdvice;
 import static jdk.jpackage.test.JPackageCommand.makeError;
 
+import java.io.IOException;
 import java.nio.file.Files;
 import java.nio.file.Path;
 import java.util.ArrayList;
@@ -56,6 +56,7 @@ import jdk.jpackage.internal.util.TokenReplace;
 import jdk.jpackage.test.Annotations.Parameter;
 import jdk.jpackage.test.Annotations.ParameterSupplier;
 import jdk.jpackage.test.Annotations.Test;
+import jdk.jpackage.test.ApplicationLayout;
 import jdk.jpackage.test.CannedArgument;
 import jdk.jpackage.test.CannedFormattedString;
 import jdk.jpackage.test.JPackageCommand;
@@ -699,11 +700,48 @@ public final class ErrorTest {
         ));
     }
 
+    @Test(ifOS = MACOS)
+    public static void testMacSignAppStoreInvalidRuntime() throws IOException {
+
+        // Create app image with the runtime directory content that will fail the subsequent signing jpackage command.
+        var appImageCmd = JPackageCommand.helloAppImage().setFakeRuntime();
+        appImageCmd.executeAndAssertImageCreated();
+        Files.createDirectory(appImageCmd.appLayout().runtimeHomeDirectory().resolve("bin"));
+
+        final var keychain = SignEnvMock.SingleCertificateKeychain.FOO.keychain();
+
+        var spec = testSpec()
+                .noAppDesc()
+                .addArgs("--mac-app-store", "--mac-sign", "--app-image", appImageCmd.outputBundle().toString())
+                .error("error.invalid-app-image-runtime-image-bin-dir",
+                        ApplicationLayout.macAppImage().runtimeHomeDirectory(), appImageCmd.outputBundle())
+                .create();
+
+        TKit.withNewState(() -> {
+            var script = Script.build()
+                    // Disable the mutation making mocks "run once".
+                    .commandMockBuilderMutator(null)
+                    // Replace "/usr/bin/security" with the mock bound to the keychain mock.
+                    .map(MacSignMockUtils.securityMock(SignEnvMock.VALUE))
+                    // Don't mock other external commands.
+                    .use(VerbatimCommandMock.INSTANCE)
+                    .createLoop();
+
+            // Create jpackage tool provider using the /usr/bin/security mock.
+            var jpackage = JPackageMockUtils.createJPackageToolProvider(OperatingSystem.MACOS, script);
+
+            // Override the default jpackage tool provider with the one using the /usr/bin/security mock.
+            JPackageCommand.useToolProviderByDefault(jpackage);
+
+            spec.test();
+        });
+    }
+
     @Test(ifOS = MACOS)
     @ParameterSupplier
     @ParameterSupplier("testMacPkgSignWithoutIdentity")
     public static void testMacSignWithoutIdentity(TestSpec spec) {
-        // The test called JPackage Command.useToolProviderBy Default(),
+        // The test calls JPackageCommand.useToolProviderByDefault(),
         // which alters global variables in the test library,
         // so run the test case with a new global state to isolate the alteration of the globals.
         TKit.withNewState(() -> {
@@ -998,8 +1036,7 @@ public final class ErrorTest {
         // Test a few app-image options that should not be used when signing external app image
         testCases.addAll(Stream.of(
                 new ArgumentGroup("--app-version", "2.0"),
-                new ArgumentGroup("--name", "foo"),
-                new ArgumentGroup("--mac-app-store")
+                new ArgumentGroup("--name", "foo")
         ).flatMap(argGroup -> {
             var withoutSign = testSpec()
                     .noAppDesc()

From e6c870ec43fc0b34e7afe7970054c658b7486e3e Mon Sep 17 00:00:00 2001
From: Ioi Lam <iklam@openjdk.org>
Date: Tue, 24 Mar 2026 01:46:08 +0000
Subject: [PATCH 316/655] 8378731: Move AOT-inited classes to initialized state
 in early VM bootstrap

Reviewed-by: kvn, liach
---
 src/hotspot/share/cds/aotClassInitializer.cpp |   5 +-
 .../share/cds/aotLinkedClassBulkLoader.cpp    | 104 +++++++++++++++---
 .../share/cds/aotLinkedClassBulkLoader.hpp    |   7 +-
 src/hotspot/share/oops/instanceKlass.cpp      |  35 +++++-
 src/hotspot/share/oops/instanceKlass.hpp      |   4 +-
 .../cds/appcds/aotCache/EarlyClassInit.java   |  61 ++++++++++
 6 files changed, 190 insertions(+), 26 deletions(-)
 create mode 100644 test/hotspot/jtreg/runtime/cds/appcds/aotCache/EarlyClassInit.java

diff --git a/src/hotspot/share/cds/aotClassInitializer.cpp b/src/hotspot/share/cds/aotClassInitializer.cpp
index 06fc3af6f30..41fdeb537cc 100644
--- a/src/hotspot/share/cds/aotClassInitializer.cpp
+++ b/src/hotspot/share/cds/aotClassInitializer.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2024, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2024, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -234,7 +234,8 @@ bool AOTClassInitializer::can_archive_initialized_mirror(InstanceKlass* ik) {
 }
 
 void AOTClassInitializer::call_runtime_setup(JavaThread* current, InstanceKlass* ik) {
-  assert(ik->has_aot_initialized_mirror(), "sanity");
+  precond(ik->has_aot_initialized_mirror());
+  precond(!AOTLinkedClassBulkLoader::is_initializing_classes_early());
   if (ik->is_runtime_setup_required()) {
     if (log_is_enabled(Info, aot, init)) {
       ResourceMark rm;
diff --git a/src/hotspot/share/cds/aotLinkedClassBulkLoader.cpp b/src/hotspot/share/cds/aotLinkedClassBulkLoader.cpp
index 3653f9d518c..6a60177fc40 100644
--- a/src/hotspot/share/cds/aotLinkedClassBulkLoader.cpp
+++ b/src/hotspot/share/cds/aotLinkedClassBulkLoader.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2024, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2024, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -116,11 +116,24 @@ void AOTLinkedClassBulkLoader::preload_classes_in_table(Array<InstanceKlass*>* c
   }
 }
 
+#ifdef ASSERT
+// true iff we are inside AOTLinkedClassBulkLoader::link_classes(), when
+// we are moving classes into the fully_initialized state before the
+// JVM is able to execute any bytecodes.
+static bool _is_initializing_classes_early = false;
+bool AOTLinkedClassBulkLoader::is_initializing_classes_early() {
+  return _is_initializing_classes_early;
+}
+#endif
+
 // Some cached heap objects may hold references to methods in aot-linked
 // classes (via MemberName). We need to make sure all classes are
 // linked before executing any bytecode.
 void AOTLinkedClassBulkLoader::link_classes(JavaThread* current) {
+  DEBUG_ONLY(_is_initializing_classes_early = true);
   link_classes_impl(current);
+  DEBUG_ONLY(_is_initializing_classes_early = false);
+
   if (current->has_pending_exception()) {
     exit_on_exception(current);
   }
@@ -135,6 +148,13 @@ void AOTLinkedClassBulkLoader::link_classes_impl(TRAPS) {
   link_classes_in_table(table->boot2(), CHECK);
   link_classes_in_table(table->platform(), CHECK);
   link_classes_in_table(table->app(), CHECK);
+
+  init_classes_for_loader(Handle(), AOTLinkedClassTable::get()->boot1(), /*early_only=*/true, CHECK);
+  init_classes_for_loader(Handle(), AOTLinkedClassTable::get()->boot2(), /*early_only=*/true, CHECK);
+  init_classes_for_loader(Handle(), AOTLinkedClassTable::get()->platform(), /*early_only=*/true, CHECK);
+  init_classes_for_loader(Handle(), AOTLinkedClassTable::get()->app(), /*early_only=*/true, CHECK);
+
+  log_info(aot, init)("------ finished early class init");
 }
 
 void AOTLinkedClassBulkLoader::link_classes_in_table(Array<InstanceKlass*>* classes, TRAPS) {
@@ -216,7 +236,7 @@ void AOTLinkedClassBulkLoader::validate_module(Klass* k, const char* category_na
 #endif
 
 void AOTLinkedClassBulkLoader::init_javabase_classes(JavaThread* current) {
-  init_classes_for_loader(Handle(), AOTLinkedClassTable::get()->boot1(), current);
+  init_classes_for_loader(Handle(), AOTLinkedClassTable::get()->boot1(), /*early_only=*/false, current);
   if (current->has_pending_exception()) {
     exit_on_exception(current);
   }
@@ -246,9 +266,9 @@ void AOTLinkedClassBulkLoader::init_non_javabase_classes_impl(TRAPS) {
   assert(h_system_loader() != nullptr,   "must be");
 
   AOTLinkedClassTable* table = AOTLinkedClassTable::get();
-  init_classes_for_loader(Handle(), table->boot2(), CHECK);
-  init_classes_for_loader(h_platform_loader, table->platform(), CHECK);
-  init_classes_for_loader(h_system_loader, table->app(), CHECK);
+  init_classes_for_loader(Handle(), table->boot2(), /*early_only=*/false, CHECK);
+  init_classes_for_loader(h_platform_loader, table->platform(), /*early_only=*/false, CHECK);
+  init_classes_for_loader(h_system_loader, table->app(), /*early_only=*/false, CHECK);
 
   if (Universe::is_fully_initialized() && VerifyDuringStartup) {
     // Make sure we're still in a clean state.
@@ -324,22 +344,80 @@ void AOTLinkedClassBulkLoader::initiate_loading(JavaThread* current, const char*
   }
 }
 
-// Some AOT-linked classes for <class_loader> must be initialized early. This includes
-// - classes that were AOT-initialized by AOTClassInitializer
-// - the classes of all objects that are reachable from the archived mirrors of
-//   the AOT-linked classes for <class_loader>.
-void AOTLinkedClassBulkLoader::init_classes_for_loader(Handle class_loader, Array<InstanceKlass*>* classes, TRAPS) {
+// Can we move ik into fully_initialized state before the JVM is able to execute
+// bytecodes?
+static bool is_early_init_possible(InstanceKlass* ik) {
+  if (ik->is_runtime_setup_required()) {
+    // Bytecodes need to be executed in order to initialize this class.
+    if (log_is_enabled(Debug, aot, init)) {
+      ResourceMark rm;
+      log_debug(aot, init)("No early init %s: needs runtimeSetup()",
+                           ik->external_name());
+    }
+    return false;
+  }
+
+  if (ik->super() != nullptr && !ik->super()->is_initialized()) {
+    // is_runtime_setup_required() == true for a super type
+    if (log_is_enabled(Debug, aot, init)) {
+      ResourceMark rm;
+      log_debug(aot, init)("No early init %s: super type %s not initialized",
+                           ik->external_name(), ik->super()->external_name());
+    }
+    return false;
+  }
+
+  Array<InstanceKlass*>* interfaces = ik->local_interfaces();
+  int num_interfaces = interfaces->length();
+  for (int i = 0; i < num_interfaces; i++) {
+    InstanceKlass* intf = interfaces->at(i);
+    if (!intf->is_initialized() && intf->interface_needs_clinit_execution_as_super(/*also_check_supers*/false)) {
+      // is_runtime_setup_required() == true for this interface
+      if (log_is_enabled(Debug, aot, init)) {
+        ResourceMark rm;
+        log_debug(aot, init)("No early init %s: interface type %s not initialized",
+                             ik->external_name(), intf->external_name());
+      }
+      return false;
+    }
+  }
+
+  return true;
+}
+
+// Normally, classes are initialized on demand. However, some AOT-linked classes
+// for the class_loader must be proactively intialized, including:
+// - Classes that have an AOT-initialized mirror (they were AOT-initialized by
+//   AOTClassInitializer during the assembly phase).
+// - The classes of all objects that are reachable from the archived mirrors of
+//   the AOT-linked classes for the class_loader. These are recorded in the special
+//   subgraph.
+//
+// (early_only == true) means that this function is called before the JVM
+// is capable of executing Java bytecodes.
+void AOTLinkedClassBulkLoader::init_classes_for_loader(Handle class_loader, Array<InstanceKlass*>* classes,
+                                                       bool early_only, TRAPS) {
   if (classes != nullptr) {
     for (int i = 0; i < classes->length(); i++) {
       InstanceKlass* ik = classes->at(i);
       assert(ik->class_loader_data() != nullptr, "must be");
-      if (ik->has_aot_initialized_mirror()) {
-        ik->initialize_with_aot_initialized_mirror(CHECK);
+
+      bool do_init = ik->has_aot_initialized_mirror();
+      if (do_init && early_only && !is_early_init_possible(ik)) {
+        // ik will be proactively initialized later when init_classes_for_loader()
+        // is called again with (early_only == false).
+        do_init = false;
+      }
+
+      if (do_init) {
+        ik->initialize_with_aot_initialized_mirror(early_only, CHECK);
       }
     }
   }
 
-  HeapShared::init_classes_for_special_subgraph(class_loader, CHECK);
+  if (!early_only) {
+    HeapShared::init_classes_for_special_subgraph(class_loader, CHECK);
+  }
 }
 
 void AOTLinkedClassBulkLoader::replay_training_at_init(Array<InstanceKlass*>* classes, TRAPS) {
diff --git a/src/hotspot/share/cds/aotLinkedClassBulkLoader.hpp b/src/hotspot/share/cds/aotLinkedClassBulkLoader.hpp
index 31fdac386fe..24ff61cea1e 100644
--- a/src/hotspot/share/cds/aotLinkedClassBulkLoader.hpp
+++ b/src/hotspot/share/cds/aotLinkedClassBulkLoader.hpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2024, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2024, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -56,7 +56,7 @@ class AOTLinkedClassBulkLoader :  AllStatic {
   static void link_classes_impl(TRAPS);
   static void link_classes_in_table(Array<InstanceKlass*>* classes, TRAPS);
   static void init_non_javabase_classes_impl(TRAPS);
-  static void init_classes_for_loader(Handle class_loader, Array<InstanceKlass*>* classes, TRAPS);
+  static void init_classes_for_loader(Handle class_loader, Array<InstanceKlass*>* classes, bool early_only, TRAPS);
   static void replay_training_at_init(Array<InstanceKlass*>* classes, TRAPS) NOT_CDS_RETURN;
 
 #ifdef ASSERT
@@ -73,8 +73,9 @@ public:
   static void init_javabase_classes(JavaThread* current) NOT_CDS_RETURN;
   static void init_non_javabase_classes(JavaThread* current) NOT_CDS_RETURN;
   static void exit_on_exception(JavaThread* current);
-
   static void replay_training_at_init_for_preloaded_classes(TRAPS) NOT_CDS_RETURN;
+
+  static bool is_initializing_classes_early() NOT_DEBUG({return false;});
 };
 
 #endif // SHARE_CDS_AOTLINKEDCLASSBULKLOADER_HPP
diff --git a/src/hotspot/share/oops/instanceKlass.cpp b/src/hotspot/share/oops/instanceKlass.cpp
index 1963327fc78..919afbf3abd 100644
--- a/src/hotspot/share/oops/instanceKlass.cpp
+++ b/src/hotspot/share/oops/instanceKlass.cpp
@@ -23,6 +23,7 @@
  */
 
 #include "cds/aotClassInitializer.hpp"
+#include "cds/aotLinkedClassBulkLoader.hpp"
 #include "cds/aotMetaspace.hpp"
 #include "cds/archiveUtils.hpp"
 #include "cds/cdsConfig.hpp"
@@ -150,6 +151,7 @@
 #endif //  ndef DTRACE_ENABLED
 
 bool InstanceKlass::_finalization_enabled = true;
+static int call_class_initializer_counter = 0;   // for debugging
 
 static inline bool is_class_loader(const Symbol* class_name,
                                    const ClassFileParser& parser) {
@@ -884,7 +886,9 @@ void InstanceKlass::assert_no_clinit_will_run_for_aot_initialized_class() const
 #endif
 
 #if INCLUDE_CDS
-void InstanceKlass::initialize_with_aot_initialized_mirror(TRAPS) {
+// early_init -- we are moving this class into the fully_initialized state before the
+// JVM is able to execute any bytecodes. See AOTLinkedClassBulkLoader::is_initializing_classes_early().
+void InstanceKlass::initialize_with_aot_initialized_mirror(bool early_init, TRAPS) {
   assert(has_aot_initialized_mirror(), "must be");
   assert(CDSConfig::is_loading_heap(), "must be");
   assert(CDSConfig::is_using_aot_linked_classes(), "must be");
@@ -894,15 +898,36 @@ void InstanceKlass::initialize_with_aot_initialized_mirror(TRAPS) {
     return;
   }
 
+  if (log_is_enabled(Info, aot, init)) {
+    ResourceMark rm;
+    log_info(aot, init)("%s (aot-inited%s)", external_name(), early_init ? ", early" : "");
+  }
+
   if (is_runtime_setup_required()) {
+    assert(!early_init, "must not call");
     // Need to take the slow path, which will call the runtimeSetup() function instead
     // of <clinit>
     initialize(CHECK);
     return;
   }
-  if (log_is_enabled(Info, aot, init)) {
-    ResourceMark rm;
-    log_info(aot, init)("%s (aot-inited)", external_name());
+
+  LogTarget(Info, class, init) lt;
+  if (lt.is_enabled()) {
+    ResourceMark rm(THREAD);
+    LogStream ls(lt);
+    ls.print("%d Initializing ", call_class_initializer_counter++);
+    name()->print_value_on(&ls);
+    ls.print_cr("(aot-inited) (" PTR_FORMAT ") by thread \"%s\"",
+                p2i(this), THREAD->name());
+  }
+
+  if (early_init) {
+    precond(AOTLinkedClassBulkLoader::is_initializing_classes_early());
+    precond(is_linked());
+    precond(init_thread() == nullptr);
+    set_init_state(fully_initialized);
+    fence_and_clear_init_lock();
+    return;
   }
 
   link_class(CHECK);
@@ -1699,8 +1724,6 @@ ArrayKlass* InstanceKlass::array_klass_or_null() {
   return array_klass_or_null(1);
 }
 
-static int call_class_initializer_counter = 0;   // for debugging
-
 Method* InstanceKlass::class_initializer() const {
   Method* clinit = find_method(
       vmSymbols::class_initializer_name(), vmSymbols::void_method_signature());
diff --git a/src/hotspot/share/oops/instanceKlass.hpp b/src/hotspot/share/oops/instanceKlass.hpp
index e370a3b7a7c..dd563ad3492 100644
--- a/src/hotspot/share/oops/instanceKlass.hpp
+++ b/src/hotspot/share/oops/instanceKlass.hpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1997, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -556,7 +556,7 @@ public:
 
   // initialization (virtuals from Klass)
   bool should_be_initialized() const override;  // means that initialize should be called
-  void initialize_with_aot_initialized_mirror(TRAPS);
+  void initialize_with_aot_initialized_mirror(bool early_init, TRAPS);
   void assert_no_clinit_will_run_for_aot_initialized_class() const NOT_DEBUG_RETURN;
   void initialize(TRAPS) override;
   void initialize_preemptable(TRAPS) override;
diff --git a/test/hotspot/jtreg/runtime/cds/appcds/aotCache/EarlyClassInit.java b/test/hotspot/jtreg/runtime/cds/appcds/aotCache/EarlyClassInit.java
new file mode 100644
index 00000000000..f78c3f83861
--- /dev/null
+++ b/test/hotspot/jtreg/runtime/cds/appcds/aotCache/EarlyClassInit.java
@@ -0,0 +1,61 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ *
+ */
+
+/*
+ * @test
+ * @summary Early init of classes in the AOT cache
+ * @bug 8378731
+ * @requires vm.cds.supports.aot.class.linking
+ * @library /test/lib
+ * @build EarlyClassInit
+ * @run driver jdk.test.lib.helpers.ClassFileInstaller -jar app.jar EarlyClassInitApp
+ * @run driver EarlyClassInit
+ */
+
+import jdk.test.lib.cds.SimpleCDSAppTester;
+import jdk.test.lib.process.OutputAnalyzer;
+
+public class EarlyClassInit {
+    public static void main(String... args) throws Exception {
+        SimpleCDSAppTester.of("EarlyClassInit")
+            .addVmArgs("-Xlog:aot+init=debug")
+            .classpath("app.jar")
+            .appCommandLine("EarlyClassInitApp")
+            .setProductionChecker((OutputAnalyzer out) -> {
+                    out.shouldContain("java.lang.Object (aot-inited, early)")
+                       .shouldContain("No early init java.lang.ClassLoader: needs runtimeSetup()")
+                       .shouldContain("No early init java.security.SecureClassLoader: super type java.lang.ClassLoader not initialized")
+                       .shouldContain("Calling java.lang.ClassLoader::runtimeSetup()")
+                       .shouldContain("java.security.SecureClassLoader (aot-inited)");
+                    out.shouldContain("HelloWorld");
+                })
+            .runAOTWorkflow();
+    }
+}
+
+class EarlyClassInitApp {
+    public static void main(String[] args) {
+        System.out.println("HelloWorld");
+    }
+}

From 105d526fa7dbf371115d9e2e4b906a8c15afd0bf Mon Sep 17 00:00:00 2001
From: Roger Calnan <roger.calnan@oracle.com>
Date: Tue, 24 Mar 2026 02:09:18 +0000
Subject: [PATCH 317/655] 8377921: Add anchors to the options in the Core Libs
 tool man pages

Reviewed-by: jpai, iris
---
 src/jdk.jartool/share/man/jar.md | 42 ++++++++++++++++----------------
 src/jdk.jlink/share/man/jlink.md | 30 +++++++++++------------
 2 files changed, 36 insertions(+), 36 deletions(-)

diff --git a/src/jdk.jartool/share/man/jar.md b/src/jdk.jartool/share/man/jar.md
index d944afcfb7f..658fa0cb4fa 100644
--- a/src/jdk.jartool/share/man/jar.md
+++ b/src/jdk.jartool/share/man/jar.md
@@ -1,5 +1,5 @@
 ---
-# Copyright (c) 1997, 2025, Oracle and/or its affiliates. All rights reserved.
+# Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
 # DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
 #
 # This code is free software; you can redistribute it and/or modify it
@@ -84,29 +84,29 @@ appropriate operation arguments described in this section. You can mix an
 operation argument with other one-letter options. Generally the operation
 argument is the first argument specified on the command line.
 
-`-c` or `--create`
+[`-c`]{#option--create} or `--create`
 :   Creates the archive.
 
-`-i` *FILE* or `--generate-index=`*FILE*
+[`-i`]{#option--generate-index} *FILE* or `--generate-index=`*FILE*
 :   Generates index information for the specified JAR file.  This option is deprecated
     and may be removed in a future release.
 
-`-t` or `--list`
+[`-t`]{#option--list} or `--list`
 :   Lists the table of contents for the archive.
 
-`-u` or `--update`
+[`-u`]{#option--update} or `--update`
 :   Updates an existing JAR file.
 
-`-x` or `--extract`
+[`-x`]{#option--extract} or `--extract`
 :   Extracts the named (or all) files from the archive.
     If a file with the same name appears more than once in
     the archive, each copy will be extracted, with later copies
     overwriting (replacing) earlier copies unless -k is specified.
 
-`-d` or `--describe-module`
+[`-d`]{#option--describe-module} or `--describe-module`
 :   Prints the module descriptor or automatic module name.
 
-`--validate`
+[`--validate`]{#option--validate}
 :   Validate the contents of the JAR file.
     See `Integrity of a JAR File` section below for more details.
 
@@ -115,7 +115,7 @@ argument is the first argument specified on the command line.
 You can use the following options to customize the actions of any operation
 mode included in the `jar` command.
 
-`-C` *DIR*
+[`-C`]{#option-C} *DIR*
 :   When used with the create operation mode, changes the specified directory
     and includes the *files* specified at the end of the command line.
 
@@ -126,10 +126,10 @@ mode included in the `jar` command.
     where the JAR file will be extracted. Unlike with the create operation mode,
     this option can be specified only once with the extract operation mode.
 
-`-f` *FILE* or `--file=`*FILE*
+[`-f`]{#option--file} *FILE* or `--file=`*FILE*
 :   Specifies the archive file name.
 
-`--release` *VERSION*
+[`--release`]{#option--release} *VERSION*
 :   Creates a multirelease JAR file. Places all files specified after the
     option into a versioned directory of the JAR file named
     `META-INF/versions/`*VERSION*`/`, where *VERSION* must be must be a
@@ -149,26 +149,26 @@ mode included in the `jar` command.
 You can use the following options to customize the actions of the create and
 the update main operation modes:
 
-`-e` *CLASSNAME* or `--main-class=`*CLASSNAME*
+[`-e`]{#option--main-class} *CLASSNAME* or `--main-class=`*CLASSNAME*
 :   Specifies the application entry point for standalone applications bundled
     into a modular or executable modular JAR file.
 
-`-m` *FILE* or `--manifest=`*FILE*
+[`-m`]{#option--manifest} *FILE* or `--manifest=`*FILE*
 :   Includes the manifest information from the given manifest file.
 
-`-M` or `--no-manifest`
+[`-M`]{#option--no-manifest} or `--no-manifest`
 :   Doesn't create a manifest file for the entries.
 
-`--module-version=`*VERSION*
+[`--module-version=`]{#option--module-version}*VERSION*
 :   Specifies the module version, when creating or updating a modular JAR file,
     or updating a non-modular JAR file.
 
-`--hash-modules=`*PATTERN*
+[`--hash-modules=`]{#option--hash-modules}*PATTERN*
 :   Computes and records the hashes of modules matched by the given pattern and
     that depend upon directly or indirectly on a modular JAR file being created
     or a non-modular JAR file being updated.
 
-`-p` or `--module-path`
+[`-p`]{#option--module-path} or `--module-path`
 :   Specifies the location of module dependence for generating the hash.
 
 `@`*file*
@@ -181,20 +181,20 @@ You can use the following options to customize the actions of the create (`-c`
 or `--create`) the update (`-u` or `--update` ) and the generate-index (`-i` or
 `--generate-index=`*FILE*) main operation modes:
 
-`-0` or `--no-compress`
+[`-0`]{#option--no-compress} or `--no-compress`
 :   Stores without using ZIP compression.
 
-`--date=`*TIMESTAMP*
+[`--date=`]{#option--date}*TIMESTAMP*
 :   The timestamp in ISO-8601 extended offset date-time with optional time-zone
     format, to use for the timestamp of the entries,
     e.g. "2022-02-12T12:30:00-05:00".
 
 ## Operation Modifiers Valid Only in Extract Mode
 
-`--dir` *DIR*
+[`--dir`]{#option--dir} *DIR*
 :   Directory into which the JAR file will be extracted.
 
-`-k` or `--keep-old-files`
+[`-k`]{#option--keep-old-files} or `--keep-old-files`
 :   Do not overwrite existing files.
     If a Jar file entry with the same name exists in the target directory, the
     existing file will not be overwritten.
diff --git a/src/jdk.jlink/share/man/jlink.md b/src/jdk.jlink/share/man/jlink.md
index 5c77202434c..b95424fdde9 100644
--- a/src/jdk.jlink/share/man/jlink.md
+++ b/src/jdk.jlink/share/man/jlink.md
@@ -57,14 +57,14 @@ Developers are responsible for updating their custom runtime images.
 
 ## jlink Options
 
-`--add-modules` *mod*\[`,`*mod*...\]
+[`--add-modules`]{#option--add-modules} *mod*\[`,`*mod*...\]
 :   Adds the named modules, *mod*, to the default set of root modules. The
     default set of root modules is empty.
 
-`--bind-services`
+[`--bind-services`]{#option--bind-services}
 :   Link service provider modules and their dependencies.
 
-`-c zip-{0-9}` or `--compress=zip-{0-9}`
+[`-c zip-{0-9}`]{#option--compress} or `--compress=zip-{0-9}`
 :   Enable compression of resources. The accepted values are:
     zip-{0-9}, where zip-0 provides no compression,
     and zip-9 provides the best compression. Default is zip-6.
@@ -75,37 +75,37 @@ Developers are responsible for updating their custom runtime images.
     -   `1`: Constant string sharing
     -   `2`: ZIP. Use zip-6 instead.
 
-`--disable-plugin` *pluginname*
+[`--disable-plugin`]{#option--disable-plugin} *pluginname*
 :   Disables the specified plug-in. See [jlink Plug-ins] for the list of
     supported plug-ins.
 
-`--endian` {`little`\|`big`}
+[`--endian`]{#option--endian} {`little`\|`big`}
 :   Specifies the byte order of the generated image. The default value is the
     format of your system's architecture.
 
 `-h` or `--help`
 :   Prints the help message.
 
-`--ignore-signing-information`
+[`--ignore-signing-information`]{#option--ignore-signing-information}
 :   Suppresses a fatal error when signed modular JARs are linked in the runtime
     image. The signature-related files of the signed modular JARs aren't copied
     to the runtime image.
 
-`--launcher` *command*`=`*module* or `--launcher` *command*`=`*module*`/`*main*
+[`--launcher`]{#option--launcher} *command*`=`*module* or `--launcher` *command*`=`*module*`/`*main*
 :   Specifies the launcher command name for the module or the command name for
     the module and main class (the module and the main class names are
     separated by a slash (`/`)).
 
-`--limit-modules` *mod*\[`,`*mod*...\]
+[`--limit-modules`]{#option--limit-modules} *mod*\[`,`*mod*...\]
 :   Limits the universe of observable modules to those in the transitive
     closure of the named modules, `mod`, plus the main module, if any, plus any
     further modules specified in the `--add-modules` option.
 
-`--list-plugins`
+[`--list-plugins`]{#option--list-plugins}
 :   Lists available plug-ins, which you can access through command-line
     options; see [jlink Plug-ins].
 
-`-p` or `--module-path` *modulepath*
+[`-p`]{#option-module-path} or `--module-path` *modulepath*
 :   Specifies the module path.
 
     If this option is not specified, then the default module path is
@@ -114,19 +114,19 @@ Developers are responsible for updating their custom runtime images.
     `java.base` module cannot be resolved from it, then the `jlink` command
     appends `$JAVA_HOME/jmods` to the module path.
 
-`--no-header-files`
+[`--no-header-files`]{#option--no-header-files}
 :   Excludes header files.
 
-`--no-man-pages`
+[`--no-man-pages`]{#option--no-man-pages}
 :   Excludes man pages.
 
-`--output` *path*
+[`--output`]{#option--output} *path*
 :   Specifies the location of the generated runtime image.
 
-`--save-opts` *filename*
+[`--save-opts`]{#option--save-opts} *filename*
 :   Saves `jlink` options in the specified file.
 
-`--suggest-providers` \[*name*`,` ...\]
+[`--suggest-providers`]{#option--suggest-providers} \[*name*`,` ...\]
 :   Suggest providers that implement the given service types from the module
     path.
 

From cc29010ae29c65964b44e9f472ad0c1d9f848f0a Mon Sep 17 00:00:00 2001
From: Ashutosh Mehra <asmehra@openjdk.org>
Date: Tue, 24 Mar 2026 03:18:25 +0000
Subject: [PATCH 318/655] 8380664: Remove stub entries used in x86-32

Reviewed-by: kvn
---
 src/hotspot/share/runtime/stubDeclarations.hpp | 10 ----------
 1 file changed, 10 deletions(-)

diff --git a/src/hotspot/share/runtime/stubDeclarations.hpp b/src/hotspot/share/runtime/stubDeclarations.hpp
index c478eda3e7c..7dc0f2d2bed 100644
--- a/src/hotspot/share/runtime/stubDeclarations.hpp
+++ b/src/hotspot/share/runtime/stubDeclarations.hpp
@@ -667,16 +667,6 @@
   do_entry(initial, dcbrt, dcbrt, dcbrt)                                \
   do_stub(initial, fmod)                                                \
   do_entry(initial, fmod, fmod, fmod)                                   \
-  /* following generic entries should really be x86_32 only */          \
-  do_stub(initial, dlibm_sin_cos_huge)                                  \
-  do_entry(initial, dlibm_sin_cos_huge, dlibm_sin_cos_huge,             \
-           dlibm_sin_cos_huge)                                          \
-  do_stub(initial, dlibm_reduce_pi04l)                                  \
-  do_entry(initial, dlibm_reduce_pi04l, dlibm_reduce_pi04l,             \
-           dlibm_reduce_pi04l)                                          \
-  do_stub(initial, dlibm_tan_cot_huge)                                  \
-  do_entry(initial, dlibm_tan_cot_huge, dlibm_tan_cot_huge,             \
-           dlibm_tan_cot_huge)                                          \
   /* merge in stubs and entries declared in arch header */              \
   STUBGEN_INITIAL_BLOBS_ARCH_DO(do_stub, do_arch_blob,                  \
                                 do_arch_entry, do_arch_entry_init)      \

From fd2ef1b870ca840e31436a60e726b197254f623f Mon Sep 17 00:00:00 2001
From: Daniel Fuchs <dfuchs@openjdk.org>
Date: Tue, 24 Mar 2026 10:44:03 +0000
Subject: [PATCH 319/655] 8380665: (dc)
 java/nio/channels/DatagramChannel/SendReceiveMaxSize.java could also test the
 loopback interface

Reviewed-by: alanb, jpai
---
 .../DatagramChannel/SendReceiveMaxSize.java   | 46 ++++++++++++++++---
 1 file changed, 39 insertions(+), 7 deletions(-)

diff --git a/test/jdk/java/nio/channels/DatagramChannel/SendReceiveMaxSize.java b/test/jdk/java/nio/channels/DatagramChannel/SendReceiveMaxSize.java
index 8d74fd8a387..a2f5844ce25 100644
--- a/test/jdk/java/nio/channels/DatagramChannel/SendReceiveMaxSize.java
+++ b/test/jdk/java/nio/channels/DatagramChannel/SendReceiveMaxSize.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2020, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -22,7 +22,7 @@
  */
 
 /*
- * @test
+ * @test id=default
  * @bug 8239355 8242885 8240901
  * @key randomness
  * @summary Check that it is possible to send and receive datagrams of
@@ -30,14 +30,41 @@
  * @library /test/lib
  * @build jdk.test.lib.net.IPSupport
  * @run testng/othervm SendReceiveMaxSize
+ */
+/*
+ * @test id=preferIPv4Stack
+ * @key randomness
+ * @summary Check that it is possible to send and receive datagrams of
+ *          maximum size on macOS, using an IPv4 only socket.
+ * @library /test/lib
+ * @build jdk.test.lib.net.IPSupport
  * @run testng/othervm -Djava.net.preferIPv4Stack=true SendReceiveMaxSize
  */
+/*
+ * @test id=preferIPv6Loopback
+ * @key randomness
+ * @summary Check that it is possible to send and receive datagrams of
+ *          maximum size on macOS, using a dual socket and the loopback
+ *          interface.
+ * @library /test/lib
+ * @build jdk.test.lib.net.IPSupport
+ * @run testng/othervm -Dtest.preferLoopback=true SendReceiveMaxSize
+ */
+/*
+ * @test id=preferIPv4Loopback
+ * @key randomness
+ * @summary Check that it is possible to send and receive datagrams of
+ *          maximum size on macOS, using an IPv4 only socket and the
+ *          loopback interface
+ * @library /test/lib
+ * @build jdk.test.lib.net.IPSupport
+ * @run testng/othervm -Dtest.preferLoopback=true -Djava.net.preferIPv4Stack=true SendReceiveMaxSize
+ */
 
 import jdk.test.lib.RandomFactory;
 import jdk.test.lib.NetworkConfiguration;
 import jdk.test.lib.Platform;
 import jdk.test.lib.net.IPSupport;
-import org.testng.Assert;
 import org.testng.annotations.BeforeTest;
 import org.testng.annotations.DataProvider;
 import org.testng.annotations.Test;
@@ -68,6 +95,7 @@ import static org.testng.Assert.assertTrue;
 public class SendReceiveMaxSize {
     private final static Class<IOException> IOE = IOException.class;
     private final static Random random = RandomFactory.getRandom();
+    private final static boolean PREFER_LOOPBACK = Boolean.getBoolean("test.preferLoopback");
 
     public interface DatagramChannelSupplier {
         DatagramChannel open() throws IOException;
@@ -83,11 +111,14 @@ public class SendReceiveMaxSize {
     public Object[][] invariants() throws IOException {
         var testcases = new ArrayList<Object[]>();
         var nc = NetworkConfiguration.probe();
+        var ipv4Loopback = (Inet4Address) InetAddress.getByName("127.0.0.1");
+        var ipv6Loopback = (Inet6Address) InetAddress.getByName("::1");
         if (hasIPv4()) {
-            InetAddress IPv4Addr = nc.ip4Addresses()
+            InetAddress IPv4Addr = PREFER_LOOPBACK ? ipv4Loopback
+                    : nc.ip4Addresses()
                     .filter(Predicate.not(InetAddress::isLoopbackAddress))
                     .findFirst()
-                    .orElse((Inet4Address) InetAddress.getByName("127.0.0.1"));
+                    .orElse(ipv4Loopback);
             testcases.add(new Object[]{
                     supplier(() -> DatagramChannel.open()),
                     IPSupport.getMaxUDPSendBufSizeIPv4(),
@@ -100,10 +131,11 @@ public class SendReceiveMaxSize {
             });
         }
         if (!preferIPv4Stack() && hasIPv6()) {
-            InetAddress IPv6Addr = nc.ip6Addresses()
+            InetAddress IPv6Addr = PREFER_LOOPBACK ? ipv6Loopback
+                    : nc.ip6Addresses()
                     .filter(Predicate.not(InetAddress::isLoopbackAddress))
                     .findFirst()
-                    .orElse((Inet6Address) InetAddress.getByName("::1"));
+                    .orElse(ipv6Loopback);
             testcases.add(new Object[]{
                     supplier(() -> DatagramChannel.open()),
                     IPSupport.getMaxUDPSendBufSizeIPv6(),

From 90eebaa344d3db6dd92ed6f0531a7dd30c311d67 Mon Sep 17 00:00:00 2001
From: Kevin Walls <kevinw@openjdk.org>
Date: Tue, 24 Mar 2026 10:52:07 +0000
Subject: [PATCH 320/655] 8380516: HotSpot has two different ways of making
 Windows strtok_s available as strtok_r

Reviewed-by: kbarrett, dlong
---
 src/hotspot/share/utilities/globalDefinitions_visCPP.hpp | 4 +++-
 src/hotspot/share/utilities/stringUtils.hpp              | 8 ++------
 2 files changed, 5 insertions(+), 7 deletions(-)

diff --git a/src/hotspot/share/utilities/globalDefinitions_visCPP.hpp b/src/hotspot/share/utilities/globalDefinitions_visCPP.hpp
index dfd6f2f1880..f106d325c68 100644
--- a/src/hotspot/share/utilities/globalDefinitions_visCPP.hpp
+++ b/src/hotspot/share/utilities/globalDefinitions_visCPP.hpp
@@ -69,7 +69,9 @@ inline int strncasecmp(const char *s1, const char *s2, size_t n) {
 // *not* the same as the C99 Annex K strtok_s.  VS provides that function
 // under the name strtok_s_l.  Make strtok_r a synonym so we can use that name
 // in shared code.
-const auto strtok_r = strtok_s;
+inline char* strtok_r(char* str, const char* delim, char** saveptr) {
+  return strtok_s(str, delim, saveptr);
+}
 
 // VS doesn't provide POSIX macros S_ISFIFO or S_IFIFO.  It doesn't even
 // provide _S_ISFIFO, per its usual naming convention for POSIX stuff.  But it
diff --git a/src/hotspot/share/utilities/stringUtils.hpp b/src/hotspot/share/utilities/stringUtils.hpp
index c3d21233808..66c8d30c7c0 100644
--- a/src/hotspot/share/utilities/stringUtils.hpp
+++ b/src/hotspot/share/utilities/stringUtils.hpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2014, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2014, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -26,11 +26,7 @@
 #define SHARE_UTILITIES_STRINGUTILS_HPP
 
 #include "memory/allStatic.hpp"
-
-#ifdef _WINDOWS
-  // strtok_s is the Windows thread-safe equivalent of POSIX strtok_r
-# define strtok_r strtok_s
-#endif
+#include "utilities/globalDefinitions.hpp"
 
 class StringUtils : AllStatic {
 public:

From d0d85cd6b5e8272066b424f4d5f4c84c923a4274 Mon Sep 17 00:00:00 2001
From: Thomas Schatzl <tschatzl@openjdk.org>
Date: Tue, 24 Mar 2026 15:36:15 +0000
Subject: [PATCH 321/655] 8380526: G1: Remove "last young" use for the Prepare
 Mixed GC

Reviewed-by: ayang, iwalulya
---
 src/hotspot/share/gc/g1/g1CollectorState.cpp |  2 +-
 src/hotspot/share/gc/g1/g1CollectorState.hpp | 22 ++++++++++----------
 src/hotspot/share/gc/g1/g1Policy.cpp         |  8 +++----
 3 files changed, 16 insertions(+), 16 deletions(-)

diff --git a/src/hotspot/share/gc/g1/g1CollectorState.cpp b/src/hotspot/share/gc/g1/g1CollectorState.cpp
index 66292642603..2b550f36904 100644
--- a/src/hotspot/share/gc/g1/g1CollectorState.cpp
+++ b/src/hotspot/share/gc/g1/g1CollectorState.cpp
@@ -31,7 +31,7 @@ G1CollectorState::Pause G1CollectorState::gc_pause_type(bool concurrent_operatio
   assert(SafepointSynchronize::is_at_safepoint(), "must be");
   switch (_phase) {
     case Phase::YoungNormal: return Pause::Normal;
-    case Phase::YoungLastYoung: return Pause::LastYoung;
+    case Phase::YoungPrepareMixed: return Pause::PrepareMixed;
     case Phase::YoungConcurrentStart:
         return concurrent_operation_is_full_mark ? Pause::ConcurrentStartFull :
                                                    Pause::ConcurrentStartUndo;
diff --git a/src/hotspot/share/gc/g1/g1CollectorState.hpp b/src/hotspot/share/gc/g1/g1CollectorState.hpp
index fc59df7349d..64c848959ae 100644
--- a/src/hotspot/share/gc/g1/g1CollectorState.hpp
+++ b/src/hotspot/share/gc/g1/g1CollectorState.hpp
@@ -45,9 +45,9 @@ class G1CollectorState {
     // during that GC because we only decide whether we do this type of GC at the start
     // of the pause.
     YoungConcurrentStart,
-    // Indicates that we are about to start or in the last young gc in the Young-Only
+    // Indicates that we are about to start or in the prepare mixed gc in the Young-Only
     // phase before the Mixed phase. This GC is required to keep pause time requirements.
-    YoungLastYoung,
+    YoungPrepareMixed,
     // Doing extra old generation evacuation.
     Mixed,
     // The Full GC phase (that coincides with the Full GC pause).
@@ -72,19 +72,19 @@ public:
   void set_in_full_gc() { _phase = Phase::FullGC; }
 
   // Pause setters
-  void set_in_young_gc_before_mixed() { _phase = Phase::YoungLastYoung; }
   void set_in_concurrent_start_gc() { _phase = Phase::YoungConcurrentStart; _initiate_conc_mark_if_possible = false; }
+  void set_in_prepare_mixed_gc() { _phase = Phase::YoungPrepareMixed; }
 
   void set_initiate_conc_mark_if_possible(bool v) { _initiate_conc_mark_if_possible = v; }
 
   // Phase getters
-  bool is_in_young_only_phase() const { return _phase == Phase::YoungNormal || _phase == Phase::YoungConcurrentStart || _phase == Phase::YoungLastYoung; }
+  bool is_in_young_only_phase() const { return _phase == Phase::YoungNormal || _phase == Phase::YoungConcurrentStart || _phase == Phase::YoungPrepareMixed; }
   bool is_in_mixed_phase() const { return _phase == Phase::Mixed; }
 
   // Specific pauses
-  bool is_in_young_gc_before_mixed() const { return _phase == Phase::YoungLastYoung; }
-  bool is_in_full_gc() const { return _phase == Phase::FullGC; }
   bool is_in_concurrent_start_gc() const { return _phase == Phase::YoungConcurrentStart; }
+  bool is_in_prepare_mixed_gc() const { return _phase == Phase::YoungPrepareMixed; }
+  bool is_in_full_gc() const { return _phase == Phase::FullGC; }
 
   bool initiate_conc_mark_if_possible() const { return _initiate_conc_mark_if_possible; }
 
@@ -95,9 +95,9 @@ public:
 
   enum class Pause : uint {
     Normal,
-    LastYoung,
     ConcurrentStartFull,
     ConcurrentStartUndo,
+    PrepareMixed,
     Cleanup,
     Remark,
     Mixed,
@@ -109,9 +109,9 @@ public:
 
   static const char* to_string(Pause type) {
     static const char* pause_strings[] = { "Normal",
-                                           "Prepare Mixed",
                                            "Concurrent Start", // Do not distinguish between the different
                                            "Concurrent Start", // Concurrent Start pauses.
+                                           "Prepare Mixed",
                                            "Cleanup",
                                            "Remark",
                                            "Mixed",
@@ -129,7 +129,7 @@ public:
     assert_is_young_pause(type);
     return type == Pause::ConcurrentStartUndo ||
            type == Pause::ConcurrentStartFull ||
-           type == Pause::LastYoung ||
+           type == Pause::PrepareMixed ||
            type == Pause::Normal;
   }
 
@@ -138,9 +138,9 @@ public:
     return type == Pause::Mixed;
   }
 
-  static bool is_last_young_pause(Pause type) {
+  static bool is_prepare_mixed_pause(Pause type) {
     assert_is_young_pause(type);
-    return type == Pause::LastYoung;
+    return type == Pause::PrepareMixed;
   }
 
   static bool is_concurrent_start_pause(Pause type) {
diff --git a/src/hotspot/share/gc/g1/g1Policy.cpp b/src/hotspot/share/gc/g1/g1Policy.cpp
index dce83a3f084..05caff1257a 100644
--- a/src/hotspot/share/gc/g1/g1Policy.cpp
+++ b/src/hotspot/share/gc/g1/g1Policy.cpp
@@ -729,7 +729,7 @@ double G1Policy::constant_other_time_ms(double pause_time_ms) const {
 }
 
 bool G1Policy::about_to_start_mixed_phase() const {
-  return collector_state()->is_in_concurrent_cycle() || collector_state()->is_in_young_gc_before_mixed();
+  return collector_state()->is_in_concurrent_cycle() || collector_state()->is_in_prepare_mixed_gc();
 }
 
 bool G1Policy::need_to_start_conc_mark(const char* source, size_t allocation_word_size) {
@@ -935,7 +935,7 @@ void G1Policy::record_young_collection_end(bool concurrent_operation_is_full_mar
 
   record_pause(this_pause, start_time_sec, end_time_sec);
 
-  if (G1CollectorState::is_last_young_pause(this_pause)) {
+  if (G1CollectorState::is_prepare_mixed_pause(this_pause)) {
     assert(!G1CollectorState::is_concurrent_start_pause(this_pause),
            "The young GC before mixed is not allowed to be concurrent start GC");
     // This has been the young GC before we start doing mixed GCs. We already
@@ -1332,7 +1332,7 @@ void G1Policy::record_concurrent_mark_cleanup_end(bool has_rebuilt_remembered_se
     log_debug(gc, ergo)("request young-only gcs (candidate old regions not available)");
   }
   if (mixed_gc_pending) {
-    collector_state()->set_in_young_gc_before_mixed();
+    collector_state()->set_in_prepare_mixed_gc();
   }
 
   double end_sec = os::elapsedTime();
@@ -1397,7 +1397,7 @@ void G1Policy::update_time_to_mixed_tracking(Pause gc_type,
     case Pause::Cleanup:
     case Pause::Remark:
     case Pause::Normal:
-    case Pause::LastYoung:
+    case Pause::PrepareMixed:
       _concurrent_start_to_mixed.add_pause(end - start);
       break;
     case Pause::ConcurrentStartFull:

From 9658c19afdf401bfda7ac2d7e79e37bfb78c1330 Mon Sep 17 00:00:00 2001
From: Kangcheng Xu <kxu@openjdk.org>
Date: Tue, 24 Mar 2026 16:16:51 +0000
Subject: [PATCH 322/655] 8378713: C2: performance regression due to missing
 constant folding for Math.pow()

Reviewed-by: roland, mchevalier
---
 src/hotspot/share/opto/callnode.cpp           | 174 ++++++++++++++
 src/hotspot/share/opto/callnode.hpp           |  17 ++
 src/hotspot/share/opto/classes.hpp            |   1 +
 src/hotspot/share/opto/library_call.cpp       |  62 +----
 src/hotspot/share/opto/macro.cpp              |  18 +-
 .../intrinsics/math/PowDNodeTests.java        | 218 ++++++++++++++++++
 .../compiler/lib/ir_framework/IRNode.java     |   6 +
 7 files changed, 431 insertions(+), 65 deletions(-)
 create mode 100644 test/hotspot/jtreg/compiler/intrinsics/math/PowDNodeTests.java

diff --git a/src/hotspot/share/opto/callnode.cpp b/src/hotspot/share/opto/callnode.cpp
index e01feb874ef..c7c0810ae85 100644
--- a/src/hotspot/share/opto/callnode.cpp
+++ b/src/hotspot/share/opto/callnode.cpp
@@ -43,6 +43,7 @@
 #include "opto/rootnode.hpp"
 #include "opto/runtime.hpp"
 #include "runtime/sharedRuntime.hpp"
+#include "runtime/stubRoutines.hpp"
 #include "utilities/powerOfTwo.hpp"
 
 // Portions of code courtesy of Clifford Click
@@ -1371,6 +1372,25 @@ TupleNode* CallLeafPureNode::make_tuple_of_input_state_and_top_return_values(con
   return tuple;
 }
 
+CallLeafPureNode* CallLeafPureNode::inline_call_leaf_pure_node(Node* control) const {
+  Node* top = Compile::current()->top();
+  if (control == nullptr) {
+    control = in(TypeFunc::Control);
+  }
+
+  CallLeafPureNode* call = new CallLeafPureNode(tf(), entry_point(), _name);
+  call->init_req(TypeFunc::Control, control);
+  call->init_req(TypeFunc::I_O, top);
+  call->init_req(TypeFunc::Memory, top);
+  call->init_req(TypeFunc::ReturnAdr, top);
+  call->init_req(TypeFunc::FramePtr, top);
+  for (unsigned int i = 0; i < tf()->domain()->cnt() - TypeFunc::Parms; i++) {
+    call->init_req(TypeFunc::Parms + i, in(TypeFunc::Parms + i));
+  }
+
+  return call;
+}
+
 Node* CallLeafPureNode::Ideal(PhaseGVN* phase, bool can_reshape) {
   if (is_dead()) {
     return nullptr;
@@ -2437,3 +2457,157 @@ bool CallNode::may_modify_arraycopy_helper(const TypeOopPtr* dest_t, const TypeO
 
   return true;
 }
+
+PowDNode::PowDNode(Compile* C, Node* base, Node* exp)
+    : CallLeafPureNode(
+        OptoRuntime::Math_DD_D_Type(),
+        StubRoutines::dpow() != nullptr ? StubRoutines::dpow() : CAST_FROM_FN_PTR(address, SharedRuntime::dpow),
+        "pow") {
+  add_flag(Flag_is_macro);
+  C->add_macro_node(this);
+
+  init_req(TypeFunc::Parms + 0, base);
+  init_req(TypeFunc::Parms + 1, C->top());  // double slot padding
+  init_req(TypeFunc::Parms + 2, exp);
+  init_req(TypeFunc::Parms + 3, C->top());  // double slot padding
+}
+
+const Type* PowDNode::Value(PhaseGVN* phase) const {
+  const Type* t_base = phase->type(base());
+  const Type* t_exp  = phase->type(exp());
+
+  if (t_base == Type::TOP || t_exp == Type::TOP) {
+    return Type::TOP;
+  }
+
+  const TypeD* base_con = t_base->isa_double_constant();
+  const TypeD* exp_con  = t_exp->isa_double_constant();
+  const TypeD* result_t = nullptr;
+
+  // constant folding: both inputs are constants
+  if (base_con != nullptr && exp_con != nullptr) {
+    result_t = TypeD::make(SharedRuntime::dpow(base_con->getd(), exp_con->getd()));
+  }
+
+  // Special cases when only the exponent is known:
+  if (exp_con != nullptr) {
+    double e = exp_con->getd();
+
+    // If the second argument is positive or negative zero, then the result is 1.0.
+    // i.e., pow(x, +/-0.0D) => 1.0
+    if (e == 0.0) { // true for both -0.0 and +0.0
+      result_t = TypeD::ONE;
+    }
+
+    // If the second argument is NaN, then the result is NaN.
+    // i.e., pow(x, NaN) => NaN
+    if (g_isnan(e)) {
+      result_t = TypeD::make(NAN);
+    }
+  }
+
+  if (result_t != nullptr) {
+    // We can't simply return a TypeD here, it must be a tuple type to be compatible with call nodes.
+    const Type** fields = TypeTuple::fields(2);
+    fields[TypeFunc::Parms + 0] = result_t;
+    fields[TypeFunc::Parms + 1] = Type::HALF;
+    return TypeTuple::make(TypeFunc::Parms + 2, fields);
+  }
+
+  return tf()->range();
+}
+
+Node* PowDNode::Ideal(PhaseGVN* phase, bool can_reshape) {
+  if (!can_reshape) {
+    return nullptr;  // wait for igvn
+  }
+
+  PhaseIterGVN* igvn = phase->is_IterGVN();
+  Node* base = this->base();
+  Node* exp  = this->exp();
+
+  const Type* t_exp  = phase->type(exp);
+  const TypeD* exp_con  = t_exp->isa_double_constant();
+
+  // Special cases when only the exponent is known:
+  if (exp_con != nullptr) {
+    double e = exp_con->getd();
+
+    // If the second argument is 1.0, then the result is the same as the first argument.
+    // i.e., pow(x, 1.0) => x
+    if (e == 1.0) {
+      return make_tuple_of_input_state_and_result(igvn, base);
+    }
+
+    // If the second argument is 2.0, then strength reduce to multiplications.
+    // i.e., pow(x, 2.0) => x * x
+    if (e == 2.0) {
+      Node* mul = igvn->transform(new MulDNode(base, base));
+      return make_tuple_of_input_state_and_result(igvn, mul);
+    }
+
+    // If the second argument is 0.5, the strength reduce to square roots.
+    // i.e., pow(x, 0.5) => sqrt(x) iff x > 0
+    if (e == 0.5 && Matcher::match_rule_supported(Op_SqrtD)) {
+      Node* ctrl = in(TypeFunc::Control);
+      Node* zero = igvn->zerocon(T_DOUBLE);
+
+      // According to the API specs, pow(-0.0, 0.5) = 0.0 and sqrt(-0.0) = -0.0.
+      // So pow(-0.0, 0.5) shouldn't be replaced with sqrt(-0.0).
+      // -0.0/+0.0 are both excluded since floating-point comparison doesn't distinguish -0.0 from +0.0.
+      Node* cmp = igvn->register_new_node_with_optimizer(new CmpDNode(base, zero));
+      Node* test = igvn->register_new_node_with_optimizer(new BoolNode(cmp, BoolTest::le));
+
+      IfNode* iff = new IfNode(ctrl, test, PROB_UNLIKELY_MAG(3), COUNT_UNKNOWN);
+      igvn->register_new_node_with_optimizer(iff);
+      Node* if_slow = igvn->register_new_node_with_optimizer(new IfTrueNode(iff));  // x <= 0
+      Node* if_fast = igvn->register_new_node_with_optimizer(new IfFalseNode(iff)); // x > 0
+
+      // slow path: call pow(x, 0.5)
+      Node* call = igvn->register_new_node_with_optimizer(inline_call_leaf_pure_node(if_slow));
+      Node* call_ctrl = igvn->register_new_node_with_optimizer(new ProjNode(call, TypeFunc::Control));
+      Node* call_result = igvn->register_new_node_with_optimizer(new ProjNode(call, TypeFunc::Parms + 0));
+
+      // fast path: sqrt(x)
+      Node* sqrt = igvn->register_new_node_with_optimizer(new SqrtDNode(igvn->C, if_fast, base));
+
+      // merge paths
+      RegionNode* region = new RegionNode(3);
+      igvn->register_new_node_with_optimizer(region);
+      region->init_req(1, call_ctrl); // slow path
+      region->init_req(2, if_fast);   // fast path
+
+      PhiNode* phi = new PhiNode(region, Type::DOUBLE);
+      igvn->register_new_node_with_optimizer(phi);
+      phi->init_req(1, call_result); // slow: pow() result
+      phi->init_req(2, sqrt);        // fast: sqrt() result
+
+      igvn->C->set_has_split_ifs(true); // Has chance for split-if optimization
+
+      return make_tuple_of_input_state_and_result(igvn, phi, region);
+    }
+  }
+
+  return CallLeafPureNode::Ideal(phase, can_reshape);
+}
+
+// We can't simply have Ideal() returning a Con or MulNode since the users are still expecting a Call node, but we could
+// produce a tuple that follows the same pattern so users can still get control, io, memory, etc..
+TupleNode* PowDNode::make_tuple_of_input_state_and_result(PhaseIterGVN* phase, Node* result, Node* control) {
+  if (control == nullptr) {
+    control = in(TypeFunc::Control);
+  }
+
+  Compile* C = phase->C;
+  C->remove_macro_node(this);
+  TupleNode* tuple = TupleNode::make(
+      tf()->range(),
+      control,
+      in(TypeFunc::I_O),
+      in(TypeFunc::Memory),
+      in(TypeFunc::FramePtr),
+      in(TypeFunc::ReturnAdr),
+      result,
+      C->top());
+  return tuple;
+}
diff --git a/src/hotspot/share/opto/callnode.hpp b/src/hotspot/share/opto/callnode.hpp
index 95d1fc27d45..a5131676347 100644
--- a/src/hotspot/share/opto/callnode.hpp
+++ b/src/hotspot/share/opto/callnode.hpp
@@ -948,6 +948,8 @@ public:
   }
   int Opcode() const override;
   Node* Ideal(PhaseGVN* phase, bool can_reshape) override;
+
+  CallLeafPureNode* inline_call_leaf_pure_node(Node* control = nullptr) const;
 };
 
 //------------------------------CallLeafNoFPNode-------------------------------
@@ -1299,4 +1301,19 @@ public:
   JVMState* dbg_jvms() const { return nullptr; }
 #endif
 };
+
+//------------------------------PowDNode--------------------------------------
+class PowDNode : public CallLeafPureNode {
+  TupleNode* make_tuple_of_input_state_and_result(PhaseIterGVN* phase, Node* result, Node* control = nullptr);
+
+public:
+  PowDNode(Compile* C, Node* base, Node* exp);
+  int Opcode() const override;
+  const Type* Value(PhaseGVN* phase) const override;
+  Node* Ideal(PhaseGVN* phase, bool can_reshape) override;
+
+  Node* base() const { return in(TypeFunc::Parms + 0); }
+  Node* exp() const  { return in(TypeFunc::Parms + 2); }
+};
+
 #endif // SHARE_OPTO_CALLNODE_HPP
diff --git a/src/hotspot/share/opto/classes.hpp b/src/hotspot/share/opto/classes.hpp
index 719b90ad6dd..d9290492337 100644
--- a/src/hotspot/share/opto/classes.hpp
+++ b/src/hotspot/share/opto/classes.hpp
@@ -286,6 +286,7 @@ macro(OpaqueZeroTripGuard)
 macro(OpaqueConstantBool)
 macro(OpaqueInitializedAssertionPredicate)
 macro(OpaqueTemplateAssertionPredicate)
+macro(PowD)
 macro(ProfileBoolean)
 macro(OrI)
 macro(OrL)
diff --git a/src/hotspot/share/opto/library_call.cpp b/src/hotspot/share/opto/library_call.cpp
index eed99ceb8bc..e0f95377cde 100644
--- a/src/hotspot/share/opto/library_call.cpp
+++ b/src/hotspot/share/opto/library_call.cpp
@@ -1819,61 +1819,17 @@ bool LibraryCallKit::runtime_math(const TypeFunc* call_type, address funcAddr, c
 
 //------------------------------inline_math_pow-----------------------------
 bool LibraryCallKit::inline_math_pow() {
+  Node* base = argument(0);
   Node* exp = argument(2);
-  const TypeD* d = _gvn.type(exp)->isa_double_constant();
-  if (d != nullptr) {
-    if (d->getd() == 2.0) {
-      // Special case: pow(x, 2.0) => x * x
-      Node* base = argument(0);
-      set_result(_gvn.transform(new MulDNode(base, base)));
-      return true;
-    } else if (d->getd() == 0.5 && Matcher::match_rule_supported(Op_SqrtD)) {
-      // Special case: pow(x, 0.5) => sqrt(x)
-      Node* base = argument(0);
-      Node* zero = _gvn.zerocon(T_DOUBLE);
 
-      RegionNode* region = new RegionNode(3);
-      Node* phi = new PhiNode(region, Type::DOUBLE);
-
-      Node* cmp  = _gvn.transform(new CmpDNode(base, zero));
-      // According to the API specs, pow(-0.0, 0.5) = 0.0 and sqrt(-0.0) = -0.0.
-      // So pow(-0.0, 0.5) shouldn't be replaced with sqrt(-0.0).
-      // -0.0/+0.0 are both excluded since floating-point comparison doesn't distinguish -0.0 from +0.0.
-      Node* test = _gvn.transform(new BoolNode(cmp, BoolTest::le));
-
-      Node* if_pow = generate_slow_guard(test, nullptr);
-      Node* value_sqrt = _gvn.transform(new SqrtDNode(C, control(), base));
-      phi->init_req(1, value_sqrt);
-      region->init_req(1, control());
-
-      if (if_pow != nullptr) {
-        set_control(if_pow);
-        address target = StubRoutines::dpow() != nullptr ? StubRoutines::dpow() :
-                                                        CAST_FROM_FN_PTR(address, SharedRuntime::dpow);
-        const TypePtr* no_memory_effects = nullptr;
-        Node* trig = make_runtime_call(RC_LEAF, OptoRuntime::Math_DD_D_Type(), target, "POW",
-                                       no_memory_effects, base, top(), exp, top());
-        Node* value_pow = _gvn.transform(new ProjNode(trig, TypeFunc::Parms+0));
-#ifdef ASSERT
-        Node* value_top = _gvn.transform(new ProjNode(trig, TypeFunc::Parms+1));
-        assert(value_top == top(), "second value must be top");
-#endif
-        phi->init_req(2, value_pow);
-        region->init_req(2, _gvn.transform(new ProjNode(trig, TypeFunc::Control)));
-      }
-
-      C->set_has_split_ifs(true); // Has chance for split-if optimization
-      set_control(_gvn.transform(region));
-      record_for_igvn(region);
-      set_result(_gvn.transform(phi));
-
-      return true;
-    }
-  }
-
-  return StubRoutines::dpow() != nullptr ?
-    runtime_math(OptoRuntime::Math_DD_D_Type(), StubRoutines::dpow(),  "dpow") :
-    runtime_math(OptoRuntime::Math_DD_D_Type(), CAST_FROM_FN_PTR(address, SharedRuntime::dpow),  "POW");
+  CallNode* pow = new PowDNode(C, base, exp);
+  set_predefined_input_for_runtime_call(pow);
+  pow = _gvn.transform(pow)->as_CallLeafPure();
+  set_predefined_output_for_runtime_call(pow);
+  Node* result = _gvn.transform(new ProjNode(pow, TypeFunc::Parms + 0));
+  record_for_igvn(pow);
+  set_result(result);
+  return true;
 }
 
 //------------------------------inline_math_native-----------------------------
diff --git a/src/hotspot/share/opto/macro.cpp b/src/hotspot/share/opto/macro.cpp
index 48277eb46d2..c78f6533840 100644
--- a/src/hotspot/share/opto/macro.cpp
+++ b/src/hotspot/share/opto/macro.cpp
@@ -2500,6 +2500,7 @@ void PhaseMacroExpand::eliminate_macro_nodes() {
         assert(n->Opcode() == Op_LoopLimit ||
                n->Opcode() == Op_ModD ||
                n->Opcode() == Op_ModF ||
+               n->Opcode() == Op_PowD ||
                n->is_OpaqueConstantBool()    ||
                n->is_OpaqueInitializedAssertionPredicate() ||
                n->Opcode() == Op_MaxL      ||
@@ -2656,18 +2657,11 @@ bool PhaseMacroExpand::expand_macro_nodes() {
     default:
       switch (n->Opcode()) {
       case Op_ModD:
-      case Op_ModF: {
-        CallNode* mod_macro = n->as_Call();
-        CallNode* call = new CallLeafPureNode(mod_macro->tf(), mod_macro->entry_point(), mod_macro->_name);
-        call->init_req(TypeFunc::Control, mod_macro->in(TypeFunc::Control));
-        call->init_req(TypeFunc::I_O, C->top());
-        call->init_req(TypeFunc::Memory, C->top());
-        call->init_req(TypeFunc::ReturnAdr, C->top());
-        call->init_req(TypeFunc::FramePtr, C->top());
-        for (unsigned int i = 0; i < mod_macro->tf()->domain()->cnt() - TypeFunc::Parms; i++) {
-          call->init_req(TypeFunc::Parms + i, mod_macro->in(TypeFunc::Parms + i));
-        }
-        _igvn.replace_node(mod_macro, call);
+      case Op_ModF:
+      case Op_PowD: {
+        CallLeafPureNode* call_macro = n->as_CallLeafPure();
+        CallLeafPureNode* call = call_macro->inline_call_leaf_pure_node();
+        _igvn.replace_node(call_macro, call);
         transform_later(call);
         break;
       }
diff --git a/test/hotspot/jtreg/compiler/intrinsics/math/PowDNodeTests.java b/test/hotspot/jtreg/compiler/intrinsics/math/PowDNodeTests.java
new file mode 100644
index 00000000000..e28cc5ab346
--- /dev/null
+++ b/test/hotspot/jtreg/compiler/intrinsics/math/PowDNodeTests.java
@@ -0,0 +1,218 @@
+/*
+ * Copyright (c) 2026, IBM and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ *
+ */
+package compiler.intrinsics.math;
+
+import jdk.test.lib.Asserts;
+
+import compiler.lib.ir_framework.*;
+import compiler.lib.generators.*;
+import static compiler.lib.generators.Generators.*;
+
+import java.util.Random;
+
+/*
+ * @test
+ * @bug 8378713
+ * @key randomness
+ * @summary Math.pow(base, exp) should constant propagate
+ * @library /test/lib /
+ * @run driver ${test.main.class}
+ */
+public class PowDNodeTests {
+    public static final Generator<Double> UNIFORMS = G.uniformDoubles(); // [0, 1)
+
+    public static final double B = UNIFORMS.next() * 1000.0d;
+    public static final double E = UNIFORMS.next() * 1000.0d + 3.0d; // e >= 3 to avoid strength reduction code
+
+    public static void main(String[] args) {
+        TestFramework.run();
+
+        testCorrectness();
+    }
+
+    // Test 1: pow(2.0, 10.0) -> 1024.0
+    @Test
+    @IR(failOn = {IRNode.POW_D})
+    public static double constantLiteralFolding() {
+        return Math.pow(2.0, 10.0);  // should fold to 1024.0
+    }
+
+    // Test 2: pow(final B, final E) -> B^E
+    @Test
+    @IR(failOn = {IRNode.POW_D})
+    public static double constantStaticFolding() {
+        return Math.pow(B, E);  // should fold to B^E
+    }
+
+    // Test 3: pow(b, 0.0) -> 1.0
+    @Test
+    @IR(failOn = {IRNode.POW_D})
+    @Arguments(values = {Argument.RANDOM_EACH})
+    public static double expZero(double b) {
+        return Math.pow(b, 0.0);
+    }
+
+    // Test 4: pow(b, 1.0) -> b (identity)
+    @Test
+    @IR(failOn = {IRNode.POW_D})
+    @Arguments(values = {Argument.RANDOM_EACH})
+    public static double expOne(double b) {
+        return Math.pow(b, 1.0);
+    }
+
+    // Test 5: pow(b, NaN) -> NaN
+    @Test
+    @IR(failOn = {IRNode.POW_D})
+    @Arguments(values = {Argument.RANDOM_EACH})
+    public static double expNaN(double b) {
+        return Math.pow(b, Double.NaN);
+    }
+
+    // Test 6: pow(b, 2.0) -> b * b
+    // More tests in TestPow2Opt.java
+    @Test
+    @IR(failOn = {IRNode.POW_D})
+    @IR(counts = {IRNode.MUL_D, "1"})
+    @Arguments(values = {Argument.RANDOM_EACH})
+    public static double expTwo(double b) {
+        return Math.pow(b, 2.0);
+    }
+
+    // Test 7: pow(b, 0.5) -> b <= 0.0 ? pow(b, 0.5) : sqrt(b)
+    // More tests in TestPow0Dot5Opt.java
+    @Test
+    @IR(counts = {IRNode.IF, "1"})
+    @IR(counts = {IRNode.SQRT_D, "1"})
+    @IR(counts = {".*CallLeaf.*pow.*", "1"}, phase = CompilePhase.BEFORE_MATCHING)
+    @Arguments(values = {Argument.RANDOM_EACH})
+    public static double expDot5(double b) {
+        return Math.pow(b, 0.5); // expand to: if (b > 0) { sqrt(b) } else { call(b) }
+    }
+
+    // Test 8: non-constant exponent stays as call
+    @Test
+    @IR(counts = {IRNode.POW_D, "1"})
+    @Arguments(values = {Argument.RANDOM_EACH, Argument.RANDOM_EACH})
+    public static double nonConstant(double b, double e) {
+        return Math.pow(b, e);
+    }
+
+    // Test 9: late constant discovery on base (after loop opts)
+    @Test
+    @IR(counts = {IRNode.POW_D, "1"}, phase = CompilePhase.AFTER_PARSING)
+    @IR(failOn = {IRNode.POW_D})
+    public static double lateBaseConstant() {
+        double base = 0;
+        for (int i = 0; i < 4; i++) {
+            if ((i % 2) == 0) {
+                base = B;
+            }
+        }
+        // After loop opts, base == B (constant), so pow(B, E) folds
+        return Math.pow(base, E);
+    }
+
+    // Test 10: late constant discovery on exp (after loop opts)
+    @Test
+    @IR(counts = {IRNode.POW_D, "1"}, phase = CompilePhase.AFTER_PARSING)
+    @IR(failOn = {IRNode.POW_D})
+    public static double lateExpConstant() {
+        double exp = 0;
+        for (int i = 0; i < 4; i++) {
+            if ((i % 2) == 0) {
+                exp = E;
+            }
+        }
+        // After loop opts, exp == E (constant), so pow(B, E) folds
+        return Math.pow(B, exp);
+    }
+
+    // Test 11: late constant discoveries on both base and exp (after loop opts)
+    @Test
+    @IR(counts = {IRNode.POW_D, "1"}, phase = CompilePhase.AFTER_PARSING)
+    @IR(failOn = {IRNode.POW_D})
+    public static double lateBothConstant() {
+        double base = 0, exp = 0;
+        for (int i = 0; i < 4; i++) {
+            if ((i % 2) == 0) {
+                base = B;
+                exp = E;
+            }
+        }
+        // After loop opts, base = B, exp == E, so pow(B, E) folds
+        return Math.pow(base, exp);
+    }
+
+    private static void assertEQWithinOneUlp(double expected, double observed) {
+        if (Double.isNaN(expected) && Double.isNaN(observed)) return;
+
+        // Math.pow() requires result must be within 1 ulp of the respective magnitude
+        double ulp = Math.max(Math.ulp(expected), Math.ulp(observed));
+        if (Math.abs(expected - observed) > ulp) {
+            throw new AssertionError(String.format(
+                    "expect = %x, observed = %x, ulp = %x",
+                    Double.doubleToRawLongBits(expected), Double.doubleToRawLongBits(observed), Double.doubleToRawLongBits(ulp)
+            ));
+        }
+    }
+
+    private static void testCorrectness() {
+        // No need to warm up for intrinsics
+        Asserts.assertEQ(1024.0d, constantLiteralFolding());
+
+        double BE = StrictMath.pow(B, E);
+        assertEQWithinOneUlp(BE, constantStaticFolding());
+        assertEQWithinOneUlp(BE, lateBaseConstant());
+        assertEQWithinOneUlp(BE, lateExpConstant());
+        assertEQWithinOneUlp(BE, lateBothConstant());
+
+        Generator<Double> anyBits = G.anyBitsDouble();
+        Generator<Double> largeDoubles = G.uniformDoubles(Long.MAX_VALUE, Double.MAX_VALUE);
+        Generator<Double> doubles = G.doubles();
+        double[] values = {
+                Double.MIN_VALUE, Double.MIN_NORMAL, -42.0d, -1.0d, -0.0d, +0.0d, 0.5d, 1.0d, 2.0d, 123d, Double.MAX_VALUE,
+                Double.NEGATIVE_INFINITY, Double.POSITIVE_INFINITY, Double.NaN,
+                UNIFORMS.next(), UNIFORMS.next(),
+                largeDoubles.next(), -largeDoubles.next(), // some sufficiently large magnitudes
+                anyBits.next(), anyBits.next(), // any bits with potentially more NaN representation
+                doubles.next(), doubles.next() // a healthy sprinkle of whatever else is possible
+        };
+
+        for (double b : values) {
+            // Strength reduced, so we know the bits matches exactly
+            Asserts.assertEQ(1.0d, expZero(b));
+            Asserts.assertEQ(b, expOne(b));
+            Asserts.assertEQ(b * b, expTwo(b));
+
+            assertEQWithinOneUlp(Double.NaN, expNaN(b));
+
+            // Runtime calls, so make sure the result is within 1 ulp
+            assertEQWithinOneUlp(StrictMath.pow(b, 0.5d), expDot5(b));
+
+            for (double e : values) {
+                assertEQWithinOneUlp(StrictMath.pow(b, e), nonConstant(b, e));
+            }
+        }
+    }
+}
diff --git a/test/hotspot/jtreg/compiler/lib/ir_framework/IRNode.java b/test/hotspot/jtreg/compiler/lib/ir_framework/IRNode.java
index ebc95527344..8885d1283df 100644
--- a/test/hotspot/jtreg/compiler/lib/ir_framework/IRNode.java
+++ b/test/hotspot/jtreg/compiler/lib/ir_framework/IRNode.java
@@ -3134,6 +3134,12 @@ public class IRNode {
         macroNodes(MOD_D, regex);
     }
 
+    public static final String POW_D = PREFIX + "POW_D" + POSTFIX;
+    static {
+        String regex = START + "PowD" + MID + END;
+        macroNodes(POW_D, regex);
+    }
+
     public static final String BLACKHOLE = PREFIX + "BLACKHOLE" + POSTFIX;
     static {
         fromBeforeRemoveUselessToFinalCode(BLACKHOLE, "Blackhole");

From 7b7f40b143ff84b7d4580930ec11926b833af031 Mon Sep 17 00:00:00 2001
From: Daniel Fuchs <dfuchs@openjdk.org>
Date: Tue, 24 Mar 2026 17:12:50 +0000
Subject: [PATCH 323/655] 8380561: Refactor java/nio/channels/DatagramChannel
 TestNG tests to use JUnit

Reviewed-by: alanb, bpb
---
 .../DatagramChannel/AdaptorConnect.java       |  31 +++---
 .../DatagramChannel/AdaptorGetters.java       | 105 +++++++++---------
 .../DatagramChannel/AfterDisconnect.java      |  40 +++----
 .../DatagramChannel/ConnectExceptions.java    |  93 +++++++++-------
 .../DatagramChannel/ConnectPortZero.java      |  59 +++++-----
 .../DatagramChannel/ConnectedSend.java        |  34 +++---
 .../nio/channels/DatagramChannel/SRTest.java  |  32 ++++--
 .../DatagramChannel/SendExceptions.java       |  99 ++++++++++-------
 .../DatagramChannel/SendPortZero.java         |  59 +++++-----
 .../DatagramChannel/SendReceiveMaxSize.java   |  64 ++++++-----
 10 files changed, 343 insertions(+), 273 deletions(-)

diff --git a/test/jdk/java/nio/channels/DatagramChannel/AdaptorConnect.java b/test/jdk/java/nio/channels/DatagramChannel/AdaptorConnect.java
index a609089e459..bf6b9023eb4 100644
--- a/test/jdk/java/nio/channels/DatagramChannel/AdaptorConnect.java
+++ b/test/jdk/java/nio/channels/DatagramChannel/AdaptorConnect.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2019, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2019, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -24,7 +24,7 @@
 /* @test
  * @bug 8232673
  * @summary Test DatagramChannel socket adaptor connect method with illegal args
- * @run testng AdaptorConnect
+ * @run junit AdaptorConnect
  */
 
 import java.net.DatagramSocket;
@@ -34,10 +34,9 @@ import java.net.SocketException;
 import java.nio.channels.DatagramChannel;
 import static java.net.InetAddress.getLoopbackAddress;
 
-import org.testng.annotations.Test;
-import static org.testng.Assert.*;
+import org.junit.jupiter.api.Test;
+import static org.junit.jupiter.api.Assertions.*;
 
-@Test
 public class AdaptorConnect {
 
     /**
@@ -59,6 +58,7 @@ public class AdaptorConnect {
     /**
      * Test connect method with an open socket.
      */
+    @Test
     public void testOpenSocket() throws Exception {
         try (DatagramChannel dc = DatagramChannel.open()) {
             DatagramSocket s = dc.socket();
@@ -66,42 +66,43 @@ public class AdaptorConnect {
             testConnectWithIllegalArguments(s);
 
             // should not be bound or connected
-            assertTrue(s.getLocalSocketAddress() == null);
-            assertTrue(s.getRemoteSocketAddress() == null);
+            assertNull(s.getLocalSocketAddress());
+            assertNull(s.getRemoteSocketAddress());
 
             // connect(SocketAddress)
             var remote1 = new InetSocketAddress(getLoopbackAddress(), 7001);
             s.connect(remote1);
-            assertEquals(s.getRemoteSocketAddress(), remote1);
+            assertEquals(remote1, s.getRemoteSocketAddress());
             testConnectWithIllegalArguments(s);
-            assertEquals(s.getRemoteSocketAddress(), remote1);
+            assertEquals(remote1, s.getRemoteSocketAddress());
 
             // connect(SocketAddress)
             var remote2 = new InetSocketAddress(getLoopbackAddress(), 7002);
             s.connect(remote2);
-            assertEquals(s.getRemoteSocketAddress(), remote2);
+            assertEquals(remote2, s.getRemoteSocketAddress());
             testConnectWithIllegalArguments(s);
-            assertEquals(s.getRemoteSocketAddress(), remote2);
+            assertEquals(remote2, s.getRemoteSocketAddress());
 
             // connect(InetAddress, int)
             var remote3 = new InetSocketAddress(getLoopbackAddress(), 7003);
             s.connect(remote3.getAddress(), remote3.getPort());
-            assertEquals(s.getRemoteSocketAddress(), remote3);
+            assertEquals(remote3, s.getRemoteSocketAddress());
             testConnectWithIllegalArguments(s);
-            assertEquals(s.getRemoteSocketAddress(), remote3);
+            assertEquals(remote3, s.getRemoteSocketAddress());
 
             // connect(InetAddress, int)
             var remote4 = new InetSocketAddress(getLoopbackAddress(), 7004);
             s.connect(remote4.getAddress(), remote4.getPort());
-            assertEquals(s.getRemoteSocketAddress(), remote4);
+            assertEquals(remote4, s.getRemoteSocketAddress());
             testConnectWithIllegalArguments(s);
-            assertEquals(s.getRemoteSocketAddress(), remote4);
+            assertEquals(remote4, s.getRemoteSocketAddress());
         }
     }
 
     /**
      * Test connect method with a closed socket.
      */
+    @Test
     public void testClosedSocket() throws Exception {
         DatagramChannel dc = DatagramChannel.open();
         DatagramSocket s = dc.socket();
diff --git a/test/jdk/java/nio/channels/DatagramChannel/AdaptorGetters.java b/test/jdk/java/nio/channels/DatagramChannel/AdaptorGetters.java
index 9e12f46be04..69f5a76c12d 100644
--- a/test/jdk/java/nio/channels/DatagramChannel/AdaptorGetters.java
+++ b/test/jdk/java/nio/channels/DatagramChannel/AdaptorGetters.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2019, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2019, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -24,7 +24,7 @@
 /* @test
  * @bug 8232673
  * @summary Test the DatagramChannel socket adaptor getter methods
- * @run testng AdaptorGetters
+ * @run junit AdaptorGetters
  */
 
 import java.net.DatagramSocket;
@@ -32,15 +32,15 @@ import java.net.InetAddress;
 import java.net.InetSocketAddress;
 import java.nio.channels.DatagramChannel;
 
-import org.testng.annotations.Test;
-import static org.testng.Assert.*;
+import org.junit.jupiter.api.Test;
+import static org.junit.jupiter.api.Assertions.*;
 
-@Test
 public class AdaptorGetters {
 
     /**
      * Test getters on unbound socket, before and after it is closed.
      */
+    @Test
     public void testUnboundSocket() throws Exception {
         DatagramChannel dc = DatagramChannel.open();
         DatagramSocket s = dc.socket();
@@ -53,12 +53,12 @@ public class AdaptorGetters {
 
             // local address
             assertTrue(s.getLocalAddress().isAnyLocalAddress());
-            assertTrue(s.getLocalPort() == 0);
-            assertTrue(s.getLocalSocketAddress() == null);
+            assertEquals(0, s.getLocalPort());
+            assertNull(s.getLocalSocketAddress());
 
             // remote address
-            assertTrue(s.getInetAddress() == null);
-            assertTrue(s.getPort() == -1);
+            assertNull(s.getInetAddress());
+            assertEquals(-1, s.getPort());
 
         } finally {
             dc.close();
@@ -70,19 +70,20 @@ public class AdaptorGetters {
         assertTrue(s.isClosed());
 
         // local address
-        assertTrue(s.getLocalAddress() == null);
-        assertTrue(s.getLocalPort() == -1);
-        assertTrue(s.getLocalSocketAddress() == null);
+        assertNull(s.getLocalAddress());
+        assertEquals(-1, s.getLocalPort());
+        assertNull(s.getLocalSocketAddress());
 
         // remote address
-        assertTrue(s.getInetAddress() == null);
-        assertTrue(s.getPort() == -1);
-        assertTrue((s.getRemoteSocketAddress() == null));
+        assertNull(s.getInetAddress());
+        assertEquals(-1, s.getPort());
+        assertNull(s.getRemoteSocketAddress());
     }
 
     /**
      * Test getters on bound socket, before and after it is closed.
      */
+    @Test
     public void testBoundSocket() throws Exception {
         DatagramChannel dc = DatagramChannel.open();
         DatagramSocket s = dc.socket();
@@ -96,14 +97,14 @@ public class AdaptorGetters {
             assertFalse(s.isClosed());
 
             // local address
-            assertEquals(s.getLocalAddress(), localAddress.getAddress());
-            assertTrue(s.getLocalPort() == localAddress.getPort());
-            assertEquals(s.getLocalSocketAddress(), localAddress);
+            assertEquals(localAddress.getAddress(), s.getLocalAddress());
+            assertEquals(localAddress.getPort(), s.getLocalPort());
+            assertEquals(localAddress, s.getLocalSocketAddress());
 
             // remote address
-            assertTrue(s.getInetAddress() == null);
-            assertTrue(s.getPort() == -1);
-            assertTrue((s.getRemoteSocketAddress() == null));
+            assertNull(s.getInetAddress());
+            assertEquals(-1, s.getPort());
+            assertNull(s.getRemoteSocketAddress());
 
         } finally {
             dc.close();
@@ -115,19 +116,20 @@ public class AdaptorGetters {
         assertTrue(s.isClosed());
 
         // local address
-        assertTrue(s.getLocalAddress() == null);
-        assertTrue(s.getLocalPort() == -1);
-        assertTrue(s.getLocalSocketAddress() == null);
+        assertNull(s.getLocalAddress());
+        assertEquals(-1, s.getLocalPort());
+        assertNull(s.getLocalSocketAddress());
 
         // remote address
-        assertTrue(s.getInetAddress() == null);
-        assertTrue(s.getPort() == -1);
-        assertTrue((s.getRemoteSocketAddress() == null));
+        assertNull(s.getInetAddress());
+        assertEquals(-1, s.getPort());
+        assertNull(s.getRemoteSocketAddress());
     }
 
     /**
      * Test getters on connected socket, before and after it is closed.
      */
+    @Test
     public void testConnectedSocket() throws Exception {
         var loopback = InetAddress.getLoopbackAddress();
         var remoteAddress = new InetSocketAddress(loopback, 7777);
@@ -143,14 +145,14 @@ public class AdaptorGetters {
             assertFalse(s.isClosed());
 
             // local address
-            assertEquals(s.getLocalAddress(), localAddress.getAddress());
-            assertTrue(s.getLocalPort() == localAddress.getPort());
-            assertEquals(s.getLocalSocketAddress(), localAddress);
+            assertEquals(localAddress.getAddress(), s.getLocalAddress());
+            assertEquals(localAddress.getPort(), s.getLocalPort());
+            assertEquals(localAddress, s.getLocalSocketAddress());
 
             // remote address
-            assertEquals(s.getInetAddress(), remoteAddress.getAddress());
-            assertTrue(s.getPort() == remoteAddress.getPort());
-            assertEquals(s.getRemoteSocketAddress(), remoteAddress);
+            assertEquals(remoteAddress.getAddress(), s.getInetAddress());
+            assertEquals(remoteAddress.getPort(), s.getPort());
+            assertEquals(remoteAddress, s.getRemoteSocketAddress());
 
         } finally {
             dc.close();
@@ -162,19 +164,20 @@ public class AdaptorGetters {
         assertTrue(s.isClosed());
 
         // local address
-        assertTrue(s.getLocalAddress() == null);
-        assertTrue(s.getLocalPort() == -1);
-        assertTrue(s.getLocalSocketAddress() == null);
+        assertNull(s.getLocalAddress());
+        assertEquals(-1, s.getLocalPort());
+        assertNull(s.getLocalSocketAddress());
 
         // remote address
-        assertEquals(s.getInetAddress(), remoteAddress.getAddress());
-        assertTrue(s.getPort() == remoteAddress.getPort());
-        assertEquals(s.getRemoteSocketAddress(), remoteAddress);
+        assertEquals(remoteAddress.getAddress(), s.getInetAddress());
+        assertEquals(remoteAddress.getPort(), s.getPort());
+        assertEquals(remoteAddress, s.getRemoteSocketAddress());
     }
 
     /**
      * Test getters on disconnected socket, before and after it is closed.
      */
+    @Test
     public void testDisconnectedSocket() throws Exception {
         DatagramChannel dc = DatagramChannel.open();
         DatagramSocket s = dc.socket();
@@ -191,14 +194,14 @@ public class AdaptorGetters {
             assertFalse(s.isClosed());
 
             // local address
-            assertEquals(s.getLocalAddress(), localAddress.getAddress());
-            assertTrue(s.getLocalPort() == localAddress.getPort());
-            assertEquals(s.getLocalSocketAddress(), localAddress);
+            assertEquals(localAddress.getAddress(), s.getLocalAddress());
+            assertEquals(localAddress.getPort(), s.getLocalPort());
+            assertEquals(localAddress, s.getLocalSocketAddress());
 
             // remote address
-            assertTrue(s.getInetAddress() == null);
-            assertTrue(s.getPort() == -1);
-            assertTrue((s.getRemoteSocketAddress() == null));
+            assertNull(s.getInetAddress());
+            assertEquals(-1, s.getPort());
+            assertNull(s.getRemoteSocketAddress());
 
 
         } finally {
@@ -211,13 +214,13 @@ public class AdaptorGetters {
         assertTrue(s.isClosed());
 
         // local address
-        assertTrue(s.getLocalAddress() == null);
-        assertTrue(s.getLocalPort() == -1);
-        assertTrue(s.getLocalSocketAddress() == null);
+        assertNull(s.getLocalAddress());
+        assertEquals(-1, s.getLocalPort());
+        assertNull(s.getLocalSocketAddress());
 
         // remote address
-        assertTrue(s.getInetAddress() == null);
-        assertTrue(s.getPort() == -1);
-        assertTrue((s.getRemoteSocketAddress() == null));
+        assertNull(s.getInetAddress());
+        assertEquals(-1, s.getPort());
+        assertNull(s.getRemoteSocketAddress());
     }
 }
diff --git a/test/jdk/java/nio/channels/DatagramChannel/AfterDisconnect.java b/test/jdk/java/nio/channels/DatagramChannel/AfterDisconnect.java
index de59984dae1..44a34ea3e55 100644
--- a/test/jdk/java/nio/channels/DatagramChannel/AfterDisconnect.java
+++ b/test/jdk/java/nio/channels/DatagramChannel/AfterDisconnect.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2019, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2019, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,9 +25,9 @@
  * @bug 8231880 8231258
  * @library /test/lib
  * @summary Test DatagramChannel bound to specific address/ephemeral port after disconnect
- * @run testng/othervm AfterDisconnect
- * @run testng/othervm -Djava.net.preferIPv4Stack=true AfterDisconnect
- * @run testng/othervm -Djava.net.preferIPv6Addresses=true AfterDisconnect
+ * @run junit/othervm AfterDisconnect
+ * @run junit/othervm -Djava.net.preferIPv4Stack=true AfterDisconnect
+ * @run junit/othervm -Djava.net.preferIPv6Addresses=true AfterDisconnect
  */
 
 import java.io.IOException;
@@ -49,15 +49,17 @@ import java.util.HashMap;
 import java.util.Map;
 import java.util.function.Predicate;
 
-import org.testng.annotations.Test;
-import static org.testng.Assert.*;
-
 import jdk.test.lib.net.IPSupport;
 
+import org.junit.jupiter.api.Test;
+
+import static java.nio.charset.StandardCharsets.UTF_8;
+import static org.junit.jupiter.api.Assertions.*;
+
 public class AfterDisconnect {
 
     interface RetryableTest<T extends Exception> {
-        public void runTest() throws T;
+        void runTest() throws T;
     }
 
     // retry the given lambda (RetryableTest) if an exception
@@ -81,7 +83,7 @@ public class AfterDisconnect {
      * When calling {@link DatagramChannel#disconnect()} a {@link BindException}
      * may occur. In which case we want to retry the test.
      */
-    class BindExceptionOnDisconnect extends BindException {
+    static class BindExceptionOnDisconnect extends BindException {
         BindExceptionOnDisconnect(BindException x) {
             super(x.getMessage());
             initCause(x);
@@ -149,8 +151,8 @@ public class AfterDisconnect {
 
             dc.connect(remote);
             assertTrue(dc.isConnected());
-            assertEquals(dc.getLocalAddress(), local);
-            assertEquals(dc.getRemoteAddress(), remote);
+            assertEquals(local, dc.getLocalAddress());
+            assertEquals(remote, dc.getRemoteAddress());
 
             try {
                 dc.disconnect();
@@ -158,8 +160,8 @@ public class AfterDisconnect {
                 throw new BindExceptionOnDisconnect(x);
             }
             assertFalse(dc.isConnected());
-            assertEquals(dc.getLocalAddress(), local);
-            assertTrue(dc.getRemoteAddress() == null);
+            assertEquals(local, dc.getLocalAddress());
+            assertNull(dc.getRemoteAddress());
         }
     }
 
@@ -192,7 +194,7 @@ public class AfterDisconnect {
     /**
      * Returns a map of the given channel's socket options and values.
      */
-    private Map<SocketOption<?>, Object> options(DatagramChannel dc) throws IOException {
+    private Map<SocketOption<?>, Object> options(DatagramChannel dc) {
         Map<SocketOption<?>, Object> map = new HashMap<>();
         for (SocketOption<?> option : dc.supportedOptions()) {
             try {
@@ -229,15 +231,15 @@ public class AfterDisconnect {
             // check blocking mode with non-blocking receive
             ByteBuffer bb = ByteBuffer.allocate(100);
             SocketAddress sender = dc.receive(bb);
-            assertTrue(sender == null);
+            assertNull(sender);
 
             // send datagram and ensure that channel is selected
-            dc.send(ByteBuffer.wrap("Hello".getBytes("UTF-8")), dc.getLocalAddress());
+            dc.send(ByteBuffer.wrap("Hello".getBytes(UTF_8)), dc.getLocalAddress());
             assertFalse(key.isReadable());
             while (sel.select() == 0);
             assertTrue(key.isReadable());
             sender = dc.receive(bb);
-            assertEquals(sender, dc.getLocalAddress());
+            assertEquals(dc.getLocalAddress(), sender);
 
             // cancel key, flush from Selector, and restore blocking mode
             key.cancel();
@@ -273,10 +275,10 @@ public class AfterDisconnect {
             assertTrue(key.isValid());
 
             // send datagram to multicast group, should be received
-            dc.send(ByteBuffer.wrap("Hello".getBytes("UTF-8")), dc.getLocalAddress());
+            dc.send(ByteBuffer.wrap("Hello".getBytes(UTF_8)), dc.getLocalAddress());
             ByteBuffer bb = ByteBuffer.allocate(100);
             SocketAddress sender = dc.receive(bb);
-            assertEquals(sender, dc.getLocalAddress());
+            assertEquals(dc.getLocalAddress(), sender);
 
             // drop membership
             key.drop();
diff --git a/test/jdk/java/nio/channels/DatagramChannel/ConnectExceptions.java b/test/jdk/java/nio/channels/DatagramChannel/ConnectExceptions.java
index a913f1f42e9..a89c4798c08 100644
--- a/test/jdk/java/nio/channels/DatagramChannel/ConnectExceptions.java
+++ b/test/jdk/java/nio/channels/DatagramChannel/ConnectExceptions.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,26 +25,32 @@
  * @bug 8198753
  * @summary Test DatagramChannel connect exceptions
  * @library ..
- * @run testng ConnectExceptions
+ * @run junit ConnectExceptions
  */
 
-import java.io.*;
-import java.net.*;
-import java.nio.*;
-import java.nio.channels.*;
-import org.testng.annotations.AfterTest;
-import org.testng.annotations.BeforeTest;
-import org.testng.annotations.Test;
-import static org.testng.Assert.*;
+
+import java.io.IOException;
+import java.net.InetAddress;
+import java.net.InetSocketAddress;
+import java.net.SocketAddress;
+import java.nio.channels.AlreadyConnectedException;
+import java.nio.channels.DatagramChannel;
+import java.nio.channels.UnresolvedAddressException;
+import java.nio.channels.UnsupportedAddressTypeException;
+
+import org.junit.jupiter.api.AfterEach;
+import org.junit.jupiter.api.BeforeEach;
+import org.junit.jupiter.api.Test;
+import static org.junit.jupiter.api.Assertions.*;
 
 public class ConnectExceptions {
-    static DatagramChannel sndChannel;
-    static DatagramChannel rcvChannel;
-    static InetSocketAddress sender;
-    static InetSocketAddress receiver;
+    private DatagramChannel sndChannel;
+    private DatagramChannel rcvChannel;
+    private InetSocketAddress sender;
+    private InetSocketAddress receiver;
 
-    @BeforeTest
-    public static void setup() throws Exception {
+    @BeforeEach
+    public void setup() throws Exception {
         sndChannel = DatagramChannel.open();
         sndChannel.bind(null);
         InetAddress address = InetAddress.getLocalHost();
@@ -60,29 +66,40 @@ public class ConnectExceptions {
             rcvChannel.socket().getLocalPort());
     }
 
-    @Test(expectedExceptions = UnsupportedAddressTypeException.class)
-    public static void unsupportedAddressTypeException() throws Exception {
-        rcvChannel.connect(sender);
-        sndChannel.connect(new SocketAddress() {});
-    }
-
-    @Test(expectedExceptions = UnresolvedAddressException.class)
-    public static void unresolvedAddressException() throws Exception {
-        String host = TestUtil.UNRESOLVABLE_HOST;
-        InetSocketAddress unresolvable = new InetSocketAddress (host, 37);
-        sndChannel.connect(unresolvable);
-    }
-
-    @Test(expectedExceptions = AlreadyConnectedException.class)
-    public static void alreadyConnectedException() throws Exception {
-        sndChannel.connect(receiver);
-        InetSocketAddress random = new InetSocketAddress(0);
-        sndChannel.connect(random);
-    }
-
-    @AfterTest
-    public static void cleanup() throws Exception {
+    @AfterEach
+    public void cleanup() throws Exception {
         rcvChannel.close();
         sndChannel.close();
     }
+
+    @Test
+    public void unsupportedAddressTypeException() throws IOException {
+        rcvChannel.connect(sender);
+        assertThrows(UnsupportedAddressTypeException.class, () -> {
+            sndChannel.connect(new SocketAddress() {});
+        });
+    }
+
+    @Test
+    public void unresolvedAddressException() throws IOException {
+        String host = TestUtil.UNRESOLVABLE_HOST;
+        InetSocketAddress unresolvable = new InetSocketAddress (host, 37);
+        assertThrows(UnresolvedAddressException.class, () -> {
+            sndChannel.connect(unresolvable);
+        });
+        sndChannel.connect(receiver);
+        assertThrows(UnresolvedAddressException.class, () -> {
+            sndChannel.connect(unresolvable);
+        });
+    }
+
+    @Test
+    public void alreadyConnectedException() throws IOException {
+        sndChannel.connect(receiver);
+        assertThrows(AlreadyConnectedException.class, () -> {
+            InetSocketAddress random = new InetSocketAddress(0);
+            sndChannel.connect(random);
+        });
+    }
+
 }
diff --git a/test/jdk/java/nio/channels/DatagramChannel/ConnectPortZero.java b/test/jdk/java/nio/channels/DatagramChannel/ConnectPortZero.java
index 4aa28e5226e..3ddad9ef526 100644
--- a/test/jdk/java/nio/channels/DatagramChannel/ConnectPortZero.java
+++ b/test/jdk/java/nio/channels/DatagramChannel/ConnectPortZero.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2020, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -21,10 +21,6 @@
  * questions.
  */
 
-import org.testng.annotations.AfterTest;
-import org.testng.annotations.BeforeTest;
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
 
 import java.io.IOException;
 import java.net.InetAddress;
@@ -38,7 +34,15 @@ import static jdk.test.lib.net.IPSupport.hasIPv6;
 import static jdk.test.lib.net.IPSupport.hasIPv4;
 import static java.net.StandardProtocolFamily.INET;
 import static java.net.StandardProtocolFamily.INET6;
-import static org.testng.Assert.assertThrows;
+
+import org.junit.jupiter.api.AfterAll;
+import org.junit.jupiter.api.BeforeAll;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
+
+import static org.junit.jupiter.api.Assertions.assertFalse;
+import static org.junit.jupiter.api.Assertions.assertThrows;
+import static org.junit.jupiter.api.Assertions.assertTrue;
 
 /*
  * @test
@@ -46,51 +50,54 @@ import static org.testng.Assert.assertThrows;
  * @library /test/lib
  * @build jdk.test.lib.net.IPSupport
  * @summary Check that DatagramChannel throws expected Exception when connecting to port 0
- * @run testng ConnectPortZero
- * @run testng/othervm -Djava.net.preferIPv4Stack=true ConnectPortZero
+ * @run junit ConnectPortZero
+ * @run junit/othervm -Djava.net.preferIPv4Stack=true ConnectPortZero
  */
 
 public class ConnectPortZero {
-    private InetSocketAddress loopbackZeroAddr, wildcardZeroAddr;
-    private DatagramChannel datagramChannel, datagramChannelIPv4, datagramChannelIPv6;
-    private List<Object[]> channels;
+    private static InetSocketAddress loopbackZeroAddr, wildcardZeroAddr;
+    private static DatagramChannel datagramChannel, datagramChannelIPv4, datagramChannelIPv6;
+    private static List<DatagramChannel> channels;
 
     private static final Class<SocketException> SE = SocketException.class;
 
-    @BeforeTest
-    public void setUp() throws IOException {
+    @BeforeAll
+    public static void setUp() throws IOException {
         wildcardZeroAddr = new InetSocketAddress(0);
         loopbackZeroAddr = new InetSocketAddress(InetAddress.getLoopbackAddress(), 0);
 
         channels = new ArrayList<>();
 
         datagramChannel = DatagramChannel.open();
-        channels.add(new Object[]{datagramChannel});
+        channels.add(datagramChannel);
         if (hasIPv4()) {
             datagramChannelIPv4 = DatagramChannel.open(INET);
-            channels.add(new Object[]{datagramChannelIPv4});
+            channels.add(datagramChannelIPv4);
         }
         if (hasIPv6()) {
             datagramChannelIPv6 = DatagramChannel.open(INET6);
-            channels.add(new Object[]{datagramChannelIPv6});
+            channels.add(datagramChannelIPv6);
         }
     }
 
-    @DataProvider(name = "data")
-    public Object[][] variants() {
-        return channels.toArray(Object[][]::new);
+    @AfterAll
+    public static void tearDown() throws IOException {
+        for(DatagramChannel ch : channels) {
+            ch.close();
+        }
     }
 
-    @Test(dataProvider = "data")
+    public static List<DatagramChannel> channels() {
+        return channels;
+    }
+
+    @ParameterizedTest
+    @MethodSource("channels")
     public void testChannelConnect(DatagramChannel dc) {
+        assertTrue(dc.isOpen());
+        assertFalse(dc.isConnected());
         assertThrows(SE, () -> dc.connect(loopbackZeroAddr));
         assertThrows(SE, () -> dc.connect(wildcardZeroAddr));
     }
 
-    @AfterTest
-    public void tearDown() throws IOException {
-        for(Object[] ch : channels) {
-            ((DatagramChannel)ch[0]).close();
-        }
-    }
 }
diff --git a/test/jdk/java/nio/channels/DatagramChannel/ConnectedSend.java b/test/jdk/java/nio/channels/DatagramChannel/ConnectedSend.java
index d761f8db3f0..78e5a37294f 100644
--- a/test/jdk/java/nio/channels/DatagramChannel/ConnectedSend.java
+++ b/test/jdk/java/nio/channels/DatagramChannel/ConnectedSend.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,23 +25,27 @@
  * @bug 4849277 7183800
  * @summary Test DatagramChannel send while connected
  * @library ..
- * @run testng ConnectedSend
+ * @run junit ConnectedSend
  * @author Mike McCloskey
  */
 
-import java.io.*;
-import java.net.*;
-import java.nio.*;
-import java.nio.channels.*;
-import java.nio.charset.*;
-import org.testng.annotations.Test;
-import static org.testng.Assert.*;
+
+import java.net.DatagramPacket;
+import java.net.InetAddress;
+import java.net.InetSocketAddress;
+import java.nio.ByteBuffer;
+import java.nio.CharBuffer;
+import java.nio.channels.DatagramChannel;
+import java.nio.charset.StandardCharsets;
+
+import org.junit.jupiter.api.Test;
+import static org.junit.jupiter.api.Assertions.*;
 
 public class ConnectedSend {
     // Check if DatagramChannel.send while connected can include
     // address without throwing
     @Test
-    public static void sendToConnectedAddress() throws Exception {
+    public void sendToConnectedAddress() throws Exception {
         DatagramChannel sndChannel = DatagramChannel.open();
         sndChannel.bind(null);
         InetAddress address = InetAddress.getLocalHost();
@@ -68,7 +72,7 @@ public class ConnectedSend {
         bb.clear();
         rcvChannel.receive(bb);
         bb.flip();
-        CharBuffer cb = Charset.forName("US-ASCII").newDecoder().decode(bb);
+        CharBuffer cb = StandardCharsets.US_ASCII.newDecoder().decode(bb);
         assertTrue(cb.toString().startsWith("h"), "Unexpected message content");
 
         rcvChannel.close();
@@ -79,7 +83,7 @@ public class ConnectedSend {
     // that has not been initialized with an address; the legacy
     // datagram socket will send in this case
     @Test
-    public static void sendAddressedPacket() throws Exception {
+    public void sendAddressedPacket() throws Exception {
         DatagramChannel sndChannel = DatagramChannel.open();
         sndChannel.bind(null);
         InetAddress address = InetAddress.getLocalHost();
@@ -99,19 +103,19 @@ public class ConnectedSend {
         rcvChannel.connect(sender);
         sndChannel.connect(receiver);
 
-        byte b[] = "hello".getBytes("UTF-8");
+        byte[] b = "hello".getBytes(StandardCharsets.UTF_8);
         DatagramPacket pkt = new DatagramPacket(b, b.length);
         sndChannel.socket().send(pkt);
 
         ByteBuffer bb = ByteBuffer.allocate(256);
         rcvChannel.receive(bb);
         bb.flip();
-        CharBuffer cb = Charset.forName("US-ASCII").newDecoder().decode(bb);
+        CharBuffer cb = StandardCharsets.US_ASCII.newDecoder().decode(bb);
         assertTrue(cb.toString().startsWith("h"), "Unexpected message content");
 
         // Check that the pkt got set with the target address;
         // This is legacy behavior
-        assertEquals(pkt.getSocketAddress(), receiver,
+        assertEquals(receiver, pkt.getSocketAddress(),
             "Unexpected address set on packet");
 
         rcvChannel.close();
diff --git a/test/jdk/java/nio/channels/DatagramChannel/SRTest.java b/test/jdk/java/nio/channels/DatagramChannel/SRTest.java
index 9a7309cc46e..5ad66e6cdff 100644
--- a/test/jdk/java/nio/channels/DatagramChannel/SRTest.java
+++ b/test/jdk/java/nio/channels/DatagramChannel/SRTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2001, 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2001, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,13 +23,19 @@
 
 /* @test
  * @summary Test DatagramChannel's send and receive methods
- * @run testng/othervm/timeout=20 SRTest
+ * @run junit/othervm SRTest
  */
 
-import java.io.*;
-import java.net.*;
-import java.nio.*;
-import java.nio.channels.*;
+import java.io.IOException;
+import java.io.PrintStream;
+import java.net.DatagramPacket;
+import java.net.DatagramSocket;
+import java.net.InetAddress;
+import java.net.InetSocketAddress;
+import java.net.SocketException;
+import java.nio.ByteBuffer;
+import java.nio.CharBuffer;
+import java.nio.channels.DatagramChannel;
 import java.util.concurrent.CompletableFuture;
 import java.util.concurrent.CompletionException;
 import java.util.concurrent.ExecutorService;
@@ -37,22 +43,24 @@ import java.util.concurrent.Executors;
 import java.util.stream.Stream;
 import static java.nio.charset.StandardCharsets.US_ASCII;
 
-import org.testng.annotations.*;
+import org.junit.jupiter.api.AfterAll;
+import org.junit.jupiter.api.BeforeAll;
+import org.junit.jupiter.api.Test;
 
 public class SRTest {
 
-    ExecutorService executorService;
+    static ExecutorService executorService;
     static PrintStream log = System.err;
 
     static final String DATA_STRING = "hello";
 
-    @BeforeClass
-    public void beforeClass() {
+    @BeforeAll
+    public static void beforeClass() {
         executorService = Executors.newCachedThreadPool();
     }
 
-    @AfterClass
-    public void afterClass() {
+    @AfterAll
+    public static void afterClass() {
         executorService.shutdown();
     }
 
diff --git a/test/jdk/java/nio/channels/DatagramChannel/SendExceptions.java b/test/jdk/java/nio/channels/DatagramChannel/SendExceptions.java
index 343ab1b8232..94508f9b6e2 100644
--- a/test/jdk/java/nio/channels/DatagramChannel/SendExceptions.java
+++ b/test/jdk/java/nio/channels/DatagramChannel/SendExceptions.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,27 +25,34 @@
  * @bug 4675045 8198753
  * @summary Test DatagramChannel send exceptions
  * @library ..
- * @run testng SendExceptions
+ * @run junit SendExceptions
  */
 
-import java.io.*;
-import java.net.*;
-import java.nio.*;
-import java.nio.channels.*;
-import org.testng.annotations.AfterTest;
-import org.testng.annotations.BeforeTest;
-import org.testng.annotations.Test;
-import static org.testng.Assert.*;
+import java.io.IOException;
+import java.net.InetAddress;
+import java.net.InetSocketAddress;
+import java.net.SocketAddress;
+import java.nio.ByteBuffer;
+import java.nio.channels.AlreadyConnectedException;
+import java.nio.channels.DatagramChannel;
+import java.nio.channels.UnresolvedAddressException;
+import java.nio.channels.UnsupportedAddressTypeException;
+
+import org.junit.jupiter.api.AfterEach;
+import org.junit.jupiter.api.BeforeEach;
+import org.junit.jupiter.api.Test;
+import static org.junit.jupiter.api.Assertions.*;
 
 public class SendExceptions {
-    static DatagramChannel sndChannel;
-    static DatagramChannel rcvChannel;
-    static InetSocketAddress sender;
-    static InetSocketAddress receiver;
-    static ByteBuffer buf = ByteBuffer.allocate(17);
+    private DatagramChannel sndChannel;
+    private DatagramChannel rcvChannel;
+    private InetSocketAddress sender;
+    private InetSocketAddress receiver;
+    static final ByteBuffer buf = ByteBuffer.allocate(17);
 
-    @BeforeTest
-    public static void setup() throws Exception {
+    @BeforeEach
+    public void setup() throws Exception {
+        buf.rewind();
         sndChannel = DatagramChannel.open();
         sndChannel.bind(null);
         InetAddress address = InetAddress.getLocalHost();
@@ -61,29 +68,43 @@ public class SendExceptions {
             rcvChannel.socket().getLocalPort());
     }
 
-    @Test(expectedExceptions = UnsupportedAddressTypeException.class)
-    public static void unsupportedAddressTypeException() throws Exception {
-        rcvChannel.connect(sender);
-        sndChannel.send(buf, new SocketAddress() {});
-    }
-
-    @Test(expectedExceptions = UnresolvedAddressException.class)
-    public static void unresolvedAddressException() throws Exception {
-        String host = TestUtil.UNRESOLVABLE_HOST;
-        InetSocketAddress unresolvable = new InetSocketAddress (host, 37);
-        sndChannel.send(buf, unresolvable);
-    }
-
-    @Test(expectedExceptions = AlreadyConnectedException.class)
-    public static void alreadyConnectedException() throws Exception {
-        sndChannel.connect(receiver);
-        InetSocketAddress random = new InetSocketAddress(0);
-        sndChannel.send(buf, random);
-    }
-
-    @AfterTest
-    public static void cleanup() throws Exception {
+    @AfterEach
+    public void cleanup() throws Exception {
         rcvChannel.close();
         sndChannel.close();
     }
+
+    @Test
+    public void unsupportedAddressTypeException() throws IOException {
+        assertThrows(UnsupportedAddressTypeException.class, () -> {
+            sndChannel.send(buf, new SocketAddress() {});
+        });
+        rcvChannel.connect(sender);
+        assertThrows(UnsupportedAddressTypeException.class, () -> {
+            sndChannel.send(buf, new SocketAddress() {});
+        });
+        sndChannel.connect(receiver);
+        assertThrows(UnsupportedAddressTypeException.class, () -> {
+            sndChannel.send(buf, new SocketAddress() {});
+        });
+    }
+
+    @Test
+    public void unresolvedAddressException() {
+        String host = TestUtil.UNRESOLVABLE_HOST;
+        InetSocketAddress unresolvable = new InetSocketAddress (host, 37);
+        assertThrows(UnresolvedAddressException.class, () -> {
+            sndChannel.send(buf, unresolvable);
+        });
+    }
+
+    @Test
+    public void alreadyConnectedException() throws IOException {
+        sndChannel.connect(receiver);
+        InetSocketAddress random = new InetSocketAddress(0);
+        assertThrows(AlreadyConnectedException.class, () -> {
+            sndChannel.send(buf, random);
+        });
+    }
+
 }
diff --git a/test/jdk/java/nio/channels/DatagramChannel/SendPortZero.java b/test/jdk/java/nio/channels/DatagramChannel/SendPortZero.java
index 6a8b9f24d41..9733dad83f8 100644
--- a/test/jdk/java/nio/channels/DatagramChannel/SendPortZero.java
+++ b/test/jdk/java/nio/channels/DatagramChannel/SendPortZero.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2020, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -21,11 +21,6 @@
  * questions.
  */
 
-import org.testng.annotations.AfterTest;
-import org.testng.annotations.BeforeTest;
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
-
 import java.io.IOException;
 import java.net.InetAddress;
 import java.net.InetSocketAddress;
@@ -39,7 +34,13 @@ import static java.net.StandardProtocolFamily.INET;
 import static java.net.StandardProtocolFamily.INET6;
 import static jdk.test.lib.net.IPSupport.hasIPv4;
 import static jdk.test.lib.net.IPSupport.hasIPv6;
-import static org.testng.Assert.assertThrows;
+
+import org.junit.jupiter.api.AfterAll;
+import org.junit.jupiter.api.BeforeAll;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
+import static org.junit.jupiter.api.Assertions.assertThrows;
+import static org.junit.jupiter.api.Assertions.assertTrue;
 
 /*
  * @test
@@ -47,20 +48,20 @@ import static org.testng.Assert.assertThrows;
  * @library /test/lib
  * @build jdk.test.lib.net.IPSupport
  * @summary Check that DatagramChannel throws expected Exception when sending to port 0
- * @run testng/othervm SendPortZero
- * @run testng/othervm -Djava.net.preferIPv4Stack=true SendPortZero
+ * @run junit/othervm SendPortZero
+ * @run junit/othervm -Djava.net.preferIPv4Stack=true SendPortZero
  */
 
 public class SendPortZero {
-    private ByteBuffer buf;
-    private List<Object[]> channels;
-    private InetSocketAddress loopbackZeroAddr, wildcardZeroAddr;
-    private DatagramChannel datagramChannel, datagramChannelIPv4, datagramChannelIPv6;
+    private static ByteBuffer buf;
+    private static List<DatagramChannel> channels;
+    private static InetSocketAddress loopbackZeroAddr, wildcardZeroAddr;
+    private static DatagramChannel datagramChannel, datagramChannelIPv4, datagramChannelIPv6;
 
     private static final Class<SocketException> SE = SocketException.class;
 
-    @BeforeTest
-    public void setUp() throws IOException {
+    @BeforeAll
+    public static void setUp() throws IOException {
         buf = ByteBuffer.wrap("test".getBytes());
 
         wildcardZeroAddr = new InetSocketAddress(0);
@@ -69,32 +70,34 @@ public class SendPortZero {
         channels = new ArrayList<>();
 
         datagramChannel = DatagramChannel.open();
-        channels.add(new Object[]{datagramChannel});
+        channels.add(datagramChannel);
         if (hasIPv4()) {
             datagramChannelIPv4 = DatagramChannel.open(INET);
-            channels.add(new Object[]{datagramChannelIPv4});
+            channels.add(datagramChannelIPv4);
         }
         if (hasIPv6()) {
             datagramChannelIPv6 = DatagramChannel.open(INET6);
-            channels.add(new Object[]{datagramChannelIPv6});
+            channels.add(datagramChannelIPv6);
         }
     }
 
-    @DataProvider(name = "data")
-    public Object[][] variants() {
-        return channels.toArray(Object[][]::new);
+    @AfterAll
+    public static void tearDown() throws IOException {
+        for(DatagramChannel ch : channels) {
+            ch.close();
+        }
     }
 
-    @Test(dataProvider = "data")
+    public static List<DatagramChannel> channels() {
+        return channels;
+    }
+
+    @ParameterizedTest
+    @MethodSource("channels")
     public void testChannelSend(DatagramChannel dc) {
+        assertTrue(dc.isOpen());
         assertThrows(SE, () -> dc.send(buf, loopbackZeroAddr));
         assertThrows(SE, () -> dc.send(buf, wildcardZeroAddr));
     }
 
-    @AfterTest
-    public void tearDown() throws IOException {
-        for(Object[] ch : channels) {
-            ((DatagramChannel)ch[0]).close();
-        }
-    }
 }
diff --git a/test/jdk/java/nio/channels/DatagramChannel/SendReceiveMaxSize.java b/test/jdk/java/nio/channels/DatagramChannel/SendReceiveMaxSize.java
index a2f5844ce25..cb6e66dd5de 100644
--- a/test/jdk/java/nio/channels/DatagramChannel/SendReceiveMaxSize.java
+++ b/test/jdk/java/nio/channels/DatagramChannel/SendReceiveMaxSize.java
@@ -29,7 +29,7 @@
  *          maximum size on macOS.
  * @library /test/lib
  * @build jdk.test.lib.net.IPSupport
- * @run testng/othervm SendReceiveMaxSize
+ * @run junit/othervm SendReceiveMaxSize
  */
 /*
  * @test id=preferIPv4Stack
@@ -38,7 +38,7 @@
  *          maximum size on macOS, using an IPv4 only socket.
  * @library /test/lib
  * @build jdk.test.lib.net.IPSupport
- * @run testng/othervm -Djava.net.preferIPv4Stack=true SendReceiveMaxSize
+ * @run junit/othervm -Djava.net.preferIPv4Stack=true SendReceiveMaxSize
  */
 /*
  * @test id=preferIPv6Loopback
@@ -48,7 +48,7 @@
  *          interface.
  * @library /test/lib
  * @build jdk.test.lib.net.IPSupport
- * @run testng/othervm -Dtest.preferLoopback=true SendReceiveMaxSize
+ * @run junit/othervm -Dtest.preferLoopback=true SendReceiveMaxSize
  */
 /*
  * @test id=preferIPv4Loopback
@@ -58,16 +58,13 @@
  *          loopback interface
  * @library /test/lib
  * @build jdk.test.lib.net.IPSupport
- * @run testng/othervm -Dtest.preferLoopback=true -Djava.net.preferIPv4Stack=true SendReceiveMaxSize
+ * @run junit/othervm -Dtest.preferLoopback=true -Djava.net.preferIPv4Stack=true SendReceiveMaxSize
  */
 
 import jdk.test.lib.RandomFactory;
 import jdk.test.lib.NetworkConfiguration;
 import jdk.test.lib.Platform;
 import jdk.test.lib.net.IPSupport;
-import org.testng.annotations.BeforeTest;
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
 
 import java.io.IOException;
 import java.net.Inet4Address;
@@ -78,6 +75,7 @@ import java.net.SocketAddress;
 import java.nio.ByteBuffer;
 import java.nio.channels.DatagramChannel;
 import java.util.ArrayList;
+import java.util.List;
 import java.util.Random;
 import java.util.function.Predicate;
 
@@ -88,9 +86,14 @@ import static java.net.StandardSocketOptions.SO_RCVBUF;
 import static jdk.test.lib.net.IPSupport.hasIPv4;
 import static jdk.test.lib.net.IPSupport.hasIPv6;
 import static jdk.test.lib.net.IPSupport.preferIPv4Stack;
-import static org.testng.Assert.assertEquals;
-import static org.testng.Assert.assertThrows;
-import static org.testng.Assert.assertTrue;
+
+import org.junit.jupiter.api.BeforeAll;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.Arguments;
+import org.junit.jupiter.params.provider.MethodSource;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertThrows;
+import static org.junit.jupiter.api.Assertions.assertTrue;
 
 public class SendReceiveMaxSize {
     private final static Class<IOException> IOE = IOException.class;
@@ -102,14 +105,13 @@ public class SendReceiveMaxSize {
     }
     static DatagramChannelSupplier supplier(DatagramChannelSupplier supplier) { return supplier; }
 
-    @BeforeTest
-    public void setUp() {
+    @BeforeAll
+    public static void setUp() {
         IPSupport.throwSkippedExceptionIfNonOperational();
     }
 
-    @DataProvider
-    public Object[][] invariants() throws IOException {
-        var testcases = new ArrayList<Object[]>();
+    public static List<Arguments> testCases() throws IOException {
+        var testcases = new ArrayList<Arguments>();
         var nc = NetworkConfiguration.probe();
         var ipv4Loopback = (Inet4Address) InetAddress.getByName("127.0.0.1");
         var ipv6Loopback = (Inet6Address) InetAddress.getByName("::1");
@@ -119,16 +121,16 @@ public class SendReceiveMaxSize {
                     .filter(Predicate.not(InetAddress::isLoopbackAddress))
                     .findFirst()
                     .orElse(ipv4Loopback);
-            testcases.add(new Object[]{
+            testcases.add(Arguments.of(
                     supplier(() -> DatagramChannel.open()),
                     IPSupport.getMaxUDPSendBufSizeIPv4(),
                     IPv4Addr
-            });
-            testcases.add(new Object[]{
+            ));
+            testcases.add(Arguments.of(
                     supplier(() -> DatagramChannel.open(INET)),
                     IPSupport.getMaxUDPSendBufSizeIPv4(),
                     IPv4Addr
-            });
+            ));
         }
         if (!preferIPv4Stack() && hasIPv6()) {
             InetAddress IPv6Addr = PREFER_LOOPBACK ? ipv6Loopback
@@ -136,21 +138,22 @@ public class SendReceiveMaxSize {
                     .filter(Predicate.not(InetAddress::isLoopbackAddress))
                     .findFirst()
                     .orElse(ipv6Loopback);
-            testcases.add(new Object[]{
+            testcases.add(Arguments.of(
                     supplier(() -> DatagramChannel.open()),
                     IPSupport.getMaxUDPSendBufSizeIPv6(),
                     IPv6Addr
-            });
-            testcases.add(new Object[]{
+            ));
+            testcases.add(Arguments.of(
                     supplier(() -> DatagramChannel.open(INET6)),
                     IPSupport.getMaxUDPSendBufSizeIPv6(),
                     IPv6Addr
-            });
+            ));
         }
-        return testcases.toArray(Object[][]::new);
+        return testcases;
     }
 
-    @Test(dataProvider = "invariants")
+    @ParameterizedTest
+    @MethodSource("testCases")
     public void testGetOption(DatagramChannelSupplier supplier, int capacity, InetAddress host)
             throws IOException {
         if (Platform.isOSX()) {
@@ -160,7 +163,8 @@ public class SendReceiveMaxSize {
         }
     }
 
-    @Test(dataProvider = "invariants")
+    @ParameterizedTest
+    @MethodSource("testCases")
     public void testSendReceiveMaxSize(DatagramChannelSupplier supplier, int capacity, InetAddress host)
             throws IOException {
         try (var receiver = DatagramChannel.open()) {
@@ -205,8 +209,8 @@ public class SendReceiveMaxSize {
                 // check that data has been fragmented and re-assembled correctly at receiver
                 System.out.println("sendBuf:    " + sendBuf);
                 System.out.println("receiveBuf: " + receiveBuf);
-                assertEquals(sendBuf, receiveBuf);
-                assertEquals(sendBuf.compareTo(receiveBuf), 0);
+                assertEquals(receiveBuf, sendBuf);
+                assertEquals(0, sendBuf.compareTo(receiveBuf));
 
                 testData = new byte[capacity - 1];
                 random.nextBytes(testData);
@@ -232,8 +236,8 @@ public class SendReceiveMaxSize {
                 // check that data has been fragmented and re-assembled correctly at receiver
                 System.out.println("sendBuf:    " + sendBuf);
                 System.out.println("receiveBuf: " + receiveBuf);
-                assertEquals(sendBuf, receiveBuf);
-                assertEquals(sendBuf.compareTo(receiveBuf), 0);
+                assertEquals(receiveBuf, sendBuf);
+                assertEquals(0, sendBuf.compareTo(receiveBuf));
 
                 var failSendBuf = ByteBuffer.allocate(capacity + 1);
                 assertThrows(IOE, () ->  sender.send(failSendBuf, addr));

From 4a9903bae4691947391942064624c44f5d26cab5 Mon Sep 17 00:00:00 2001
From: William Kemper <wkemper@openjdk.org>
Date: Tue, 24 Mar 2026 18:06:28 +0000
Subject: [PATCH 324/655] 8380431: Shenandoah: Concurrent modification of
 stack-chunk objects during evacuation

Reviewed-by: rkennke
---
 .../share/gc/shenandoah/shenandoahFullGC.cpp    |  5 ++++-
 .../shenandoah/shenandoahGenerationalHeap.cpp   | 17 +++++++++--------
 .../share/gc/shenandoah/shenandoahHeap.cpp      | 13 +++++++++++--
 .../gc/shenandoah/shenandoahMark.inline.hpp     |  7 +++----
 4 files changed, 27 insertions(+), 15 deletions(-)

diff --git a/src/hotspot/share/gc/shenandoah/shenandoahFullGC.cpp b/src/hotspot/share/gc/shenandoah/shenandoahFullGC.cpp
index 750f7e9122d..21b1fd9e0a8 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahFullGC.cpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahFullGC.cpp
@@ -878,8 +878,11 @@ public:
       Copy::aligned_conjoint_words(compact_from, compact_to, size);
       oop new_obj = cast_to_oop(compact_to);
 
-      ContinuationGCSupport::relativize_stack_chunk(new_obj);
+      // Restore the mark word before relativizing the stack chunk. The copy's
+      // mark word contains the full GC forwarding encoding, which would cause
+      // is_stackChunk() to read garbage (especially with compact headers).
       new_obj->init_mark();
+      ContinuationGCSupport::relativize_stack_chunk(new_obj);
     }
   }
 };
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahGenerationalHeap.cpp b/src/hotspot/share/gc/shenandoah/shenandoahGenerationalHeap.cpp
index 27e374a0f85..d5cfa4b7fb9 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahGenerationalHeap.cpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahGenerationalHeap.cpp
@@ -346,18 +346,19 @@ oop ShenandoahGenerationalHeap::try_evacuate_object(oop p, Thread* thread, uint
     increase_object_age(copy_val, from_region_age + 1);
   }
 
+  // Relativize stack chunks before publishing the copy. After the forwarding CAS,
+  // mutators can see the copy and thaw it via the fast path if flags == 0. We must
+  // relativize derived pointers and set gc_mode before that happens. Skip if the
+  // copy's mark word is already a forwarding pointer (another thread won the race
+  // and overwrote the original's header before we copied it).
+  if (!ShenandoahForwarding::is_forwarded(copy_val)) {
+    ContinuationGCSupport::relativize_stack_chunk(copy_val);
+  }
+
   // Try to install the new forwarding pointer.
   oop result = ShenandoahForwarding::try_update_forwardee(p, copy_val);
   if (result == copy_val) {
     // Successfully evacuated. Our copy is now the public one!
-
-    // This is necessary for virtual thread support. This uses the mark word without
-    // considering that it may now be a forwarding pointer (and could therefore crash).
-    // Secondarily, we do not want to spend cycles relativizing stack chunks for oops
-    // that lost the evacuation race (and will therefore not become visible). It is
-    // safe to do this on the public copy (this is also done during concurrent mark).
-    ContinuationGCSupport::relativize_stack_chunk(copy_val);
-
     if (ShenandoahEvacTracking) {
       // Record that the evacuation succeeded
       evac_tracker()->end_evacuation(thread, size * HeapWordSize, FROM_GENERATION, TO_GENERATION);
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahHeap.cpp b/src/hotspot/share/gc/shenandoah/shenandoahHeap.cpp
index 817f5e8dc47..5bf76505506 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahHeap.cpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahHeap.cpp
@@ -1353,12 +1353,21 @@ oop ShenandoahHeap::try_evacuate_object(oop p, Thread* thread, ShenandoahHeapReg
   // Copy the object:
   Copy::aligned_disjoint_words(cast_from_oop<HeapWord*>(p), copy, size);
 
-  // Try to install the new forwarding pointer.
   oop copy_val = cast_to_oop(copy);
+
+  // Relativize stack chunks before publishing the copy. After the forwarding CAS,
+  // mutators can see the copy and thaw it via the fast path if flags == 0. We must
+  // relativize derived pointers and set gc_mode before that happens. Skip if the
+  // copy's mark word is already a forwarding pointer (another thread won the race
+  // and overwrote the original's header before we copied it).
+  if (!ShenandoahForwarding::is_forwarded(copy_val)) {
+    ContinuationGCSupport::relativize_stack_chunk(copy_val);
+  }
+
+  // Try to install the new forwarding pointer.
   oop result = ShenandoahForwarding::try_update_forwardee(p, copy_val);
   if (result == copy_val) {
     // Successfully evacuated. Our copy is now the public one!
-    ContinuationGCSupport::relativize_stack_chunk(copy_val);
     shenandoah_assert_correct(nullptr, copy_val);
     if (ShenandoahEvacTracking) {
       evac_tracker()->end_evacuation(thread, size * HeapWordSize, from_region->affiliation(), target_gen);
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahMark.inline.hpp b/src/hotspot/share/gc/shenandoah/shenandoahMark.inline.hpp
index ba24e890769..d4699a61166 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahMark.inline.hpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahMark.inline.hpp
@@ -77,10 +77,9 @@ void ShenandoahMark::do_task(ShenandoahObjToScanQueue* q, T* cl, ShenandoahLiveD
   if (task->is_not_chunked()) {
     if (obj->is_instance()) {
       // Case 1: Normal oop, process as usual.
-      if (ContinuationGCSupport::relativize_stack_chunk(obj)) {
-          // Loom doesn't support mixing of weak marking and strong marking of
-          // stack chunks.
-          cl->set_weak(false);
+      if (obj->is_stackChunk()) {
+        // Loom doesn't support mixing of weak marking and strong marking of stack chunks.
+        cl->set_weak(false);
       }
 
       obj->oop_iterate(cl);

From 6b156ab45b763c7e79e4df15a8cab61949623eea Mon Sep 17 00:00:00 2001
From: Matias Saavedra Silva <matsaave@openjdk.org>
Date: Tue, 24 Mar 2026 18:23:53 +0000
Subject: [PATCH 325/655] 8357037: Verifier rejects method ending in switch
 instruction

Reviewed-by: dlong, dholmes, coleenp
---
 src/hotspot/share/interpreter/bytecodes.cpp   |  2 +-
 .../verifier/MethodEndsWithLookupSwitch.jasm  | 54 ++++++++++++++++++
 .../verifier/MethodEndsWithSwitch.java        | 42 ++++++++++++++
 .../verifier/MethodEndsWithTableSwitch.jasm   | 57 +++++++++++++++++++
 4 files changed, 154 insertions(+), 1 deletion(-)
 create mode 100644 test/hotspot/jtreg/runtime/verifier/MethodEndsWithLookupSwitch.jasm
 create mode 100644 test/hotspot/jtreg/runtime/verifier/MethodEndsWithSwitch.java
 create mode 100644 test/hotspot/jtreg/runtime/verifier/MethodEndsWithTableSwitch.jasm

diff --git a/src/hotspot/share/interpreter/bytecodes.cpp b/src/hotspot/share/interpreter/bytecodes.cpp
index 1526b3c330e..a7914b6b93a 100644
--- a/src/hotspot/share/interpreter/bytecodes.cpp
+++ b/src/hotspot/share/interpreter/bytecodes.cpp
@@ -402,7 +402,7 @@ int Bytecodes::special_length_at(Bytecodes::Code code, address bcp, address end)
   case _fast_binaryswitch: // fall through
   case _fast_linearswitch:
     { address aligned_bcp = align_up(bcp + 1, jintSize);
-      if (end != nullptr && aligned_bcp + 2*jintSize >= end) {
+      if (end != nullptr && aligned_bcp + 2*jintSize > end) {
         return -1; // don't read past end of code buffer
       }
       // Promote calculation to 64 bits to do range checks, used by the verifier.
diff --git a/test/hotspot/jtreg/runtime/verifier/MethodEndsWithLookupSwitch.jasm b/test/hotspot/jtreg/runtime/verifier/MethodEndsWithLookupSwitch.jasm
new file mode 100644
index 00000000000..c6043674da9
--- /dev/null
+++ b/test/hotspot/jtreg/runtime/verifier/MethodEndsWithLookupSwitch.jasm
@@ -0,0 +1,54 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+super public class MethodEndsWithLookupSwitch version 51:0 {
+
+/*
+ * See if verifier allows a method to end with a switch instruction.
+ */
+private Method "foo":"()V"
+    stack 1 locals 1
+{
+        goto L1;
+L3:
+        stack_frame_type same;
+        return;
+L1:
+        stack_frame_type same;
+        iconst_0;
+        lookupswitch {
+                default: L3
+        };
+}
+
+public Method "<init>":"()V"
+    stack 2 locals 1
+{
+        aload_0;
+        dup;
+        invokespecial    Method java/lang/Object."<init>":"()V";
+        invokespecial    Method "foo":"()V";
+        return;
+}
+
+} // end Class MethodEndsWithLookupSwitch
diff --git a/test/hotspot/jtreg/runtime/verifier/MethodEndsWithSwitch.java b/test/hotspot/jtreg/runtime/verifier/MethodEndsWithSwitch.java
new file mode 100644
index 00000000000..9fca02eb5f0
--- /dev/null
+++ b/test/hotspot/jtreg/runtime/verifier/MethodEndsWithSwitch.java
@@ -0,0 +1,42 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+/*
+ * @test
+ * @summary Verify that method can end with a switch instruction.
+ * @compile MethodEndsWithLookupSwitch.jasm MethodEndsWithTableSwitch.jasm
+ * @run main/othervm MethodEndsWithSwitch
+ */
+
+public class MethodEndsWithSwitch {
+
+    static void test(String testName) throws Exception {
+        System.out.println("Testing: " + testName);
+        Class c = Class.forName(testName);
+    }
+
+    public static void main(String[] args) throws Exception {
+        test("MethodEndsWithLookupSwitch");
+        test("MethodEndsWithTableSwitch");
+    }
+}
diff --git a/test/hotspot/jtreg/runtime/verifier/MethodEndsWithTableSwitch.jasm b/test/hotspot/jtreg/runtime/verifier/MethodEndsWithTableSwitch.jasm
new file mode 100644
index 00000000000..97505f48643
--- /dev/null
+++ b/test/hotspot/jtreg/runtime/verifier/MethodEndsWithTableSwitch.jasm
@@ -0,0 +1,57 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+super public class MethodEndsWithTableSwitch version 51:0 {
+
+/*
+ * See if verifier allows a method to end with a switch instruction.
+ */
+private Method "foo":"()V"
+    stack 1 locals 1
+{
+        goto L1;
+L3:
+        stack_frame_type same;
+        return;
+L1:
+        stack_frame_type same;
+        iconst_0;
+        tableswitch {
+            0: L3;
+            1: L3;
+            2: L3;
+            default: L3
+        };
+}
+
+public Method "<init>":"()V"
+    stack 2 locals 1
+{
+        aload_0;
+        dup;
+        invokespecial    Method java/lang/Object."<init>":"()V";
+        invokespecial    Method "foo":"()V";
+        return;
+}
+
+} // end Class MethodEndsWithTableSwitch

From 2afd7b8b1459951fd476f0e9b0b8e1845c97890d Mon Sep 17 00:00:00 2001
From: Brent Christian <bchristi@openjdk.org>
Date: Tue, 24 Mar 2026 18:53:53 +0000
Subject: [PATCH 326/655] 8379672: jdk/internal/misc/VM/RuntimeArguments.java
 test still fails in Virtual threads mode after JDK-8373718

Reviewed-by: jpai
---
 test/jdk/jdk/internal/misc/VM/RuntimeArguments.java | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/test/jdk/jdk/internal/misc/VM/RuntimeArguments.java b/test/jdk/jdk/internal/misc/VM/RuntimeArguments.java
index b86593d84ba..47df5da36f9 100644
--- a/test/jdk/jdk/internal/misc/VM/RuntimeArguments.java
+++ b/test/jdk/jdk/internal/misc/VM/RuntimeArguments.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2016, 2023, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2016, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -24,7 +24,7 @@
 /**
  * @test
  * @requires vm.flagless
- * @requires test.thread.factory == null
+ * @requires test.thread.factory == ""
  * @library /test/lib
  * @modules java.base/jdk.internal.misc
  *          jdk.zipfs

From 18fdbd2404b3b6b23ba8457e4c42674ffc3fffa4 Mon Sep 17 00:00:00 2001
From: Kim Barrett <kbarrett@openjdk.org>
Date: Tue, 24 Mar 2026 20:32:31 +0000
Subject: [PATCH 327/655] 8314258: Add integer_cast for checking conversions
 don't change the value

Reviewed-by: azafari, stefank, lkorinth
---
 src/hotspot/share/utilities/integerCast.hpp   | 157 ++++++++++
 .../gtest/utilities/test_integerCast.cpp      | 287 ++++++++++++++++++
 2 files changed, 444 insertions(+)
 create mode 100644 src/hotspot/share/utilities/integerCast.hpp
 create mode 100644 test/hotspot/gtest/utilities/test_integerCast.cpp

diff --git a/src/hotspot/share/utilities/integerCast.hpp b/src/hotspot/share/utilities/integerCast.hpp
new file mode 100644
index 00000000000..0715cab18d5
--- /dev/null
+++ b/src/hotspot/share/utilities/integerCast.hpp
@@ -0,0 +1,157 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ *
+ */
+
+#ifndef SHARE_UTILITIES_INTEGERCAST_HPP
+#define SHARE_UTILITIES_INTEGERCAST_HPP
+
+#include "cppstdlib/limits.hpp"
+#include "cppstdlib/type_traits.hpp"
+#include "metaprogramming/enableIf.hpp"
+#include "utilities/debug.hpp"
+#include "utilities/macros.hpp"
+
+#include <stdint.h>
+
+// Tests whether all values for the From type are within the range of values
+// for the To Type.  From and To must be integral types.  This is used by
+// integer_cast to test for tautological conversions.
+template<typename From, typename To,
+         ENABLE_IF(std::is_integral_v<From>),
+         ENABLE_IF(std::is_integral_v<To>)>
+constexpr bool is_always_integer_convertible() {
+  if constexpr (std::is_signed_v<To> == std::is_signed_v<From>) {
+    // signed => signed or unsigned => unsigned.
+    return sizeof(To) >= sizeof(From);
+  } else if constexpr (std::is_signed_v<From>) {
+    // signed => unsigned is never tautological, because of negative values.
+    return false;
+  } else {
+    // unsigned => signed.
+    return sizeof(To) > sizeof(From);
+  }
+}
+
+// Tests whether the value of from is within the range of values for the To
+// type.  To and From must be integral types.  This is used by integer_cast
+// to test whether the conversion should be performed.
+template<typename To, typename From,
+         ENABLE_IF(std::is_integral_v<To>),
+         ENABLE_IF(std::is_integral_v<From>)>
+constexpr bool is_integer_convertible(From from) {
+  if constexpr (is_always_integer_convertible<From, To>()) {
+    // This clause simplifies direct calls and the implementation below.  It
+    // isn't needed by integer_cast, where a tautological call is discarded.
+    return true;
+  } else if constexpr (std::is_unsigned_v<From>) {
+    // unsigned => signed or unsigned => unsigned.
+    // Convert To::max to corresponding unsigned for compare.
+    using U = std::make_unsigned_t<To>;
+    return from <= static_cast<U>(std::numeric_limits<To>::max());
+  } else if constexpr (std::is_signed_v<To>) {
+    // signed => signed.
+    return ((std::numeric_limits<To>::min() <= from) &&
+            (from <= std::numeric_limits<To>::max()));
+  } else {
+    // signed => unsigned.  Convert from to corresponding unsigned for compare.
+    using U = std::make_unsigned_t<From>;
+    return (0 <= from) && (static_cast<U>(from) <= std::numeric_limits<To>::max());
+  }
+}
+
+// Convert the from value to the To type, after a debug-only check that the
+// value of from is within the range of values for the To type.  To and From
+// must be integral types.
+//
+// permit_tautology determines the behavior when a conversion will always
+// succeed because the range of values for the From type is enclosed by the
+// range of values for the To type (is_always_integer_convertible<From, To>()
+// is true).  If true, the conversion will be performed as requested. If
+// false, a compile-time error is produced.  The default is false for 64bit
+// platforms, true for 32bit platforms.  See integer_cast_permit_tautology as
+// the preferred way to override the default and always provide a true value.
+//
+// Unnecessary integer_casts make code harder to understand.  Hence the
+// compile-time failure for tautological conversions, to alert that a code
+// change is making a integer_cast unnecessary.  This can be suppressed on a
+// per-call basis, because there are cases where a conversion might only
+// sometimes be tautological.  For example, the types involved may vary by
+// platform.  Another case is if the operation is in a template with dependent
+// types, with the operation only being tautological for some instantiations.
+// Suppressing the tautology check is an alternative to possibly complex
+// metaprogramming to only perform the integer_cast when necessary.
+//
+// Despite that, for 32bit platforms the default is to not reject unnecessary
+// integer_casts.  This is because 64bit platforms are the primary target, and
+// are likely to require conversions in some places.  However, some of those
+// conversions will be tautological on 32bit platforms, such as size_t => uint.
+template<typename To,
+         bool permit_tautology = LP64_ONLY(false) NOT_LP64(true),
+         typename From,
+         ENABLE_IF(std::is_integral_v<To>),
+         ENABLE_IF(std::is_integral_v<From>)>
+constexpr To integer_cast(From from) {
+  if constexpr (is_always_integer_convertible<From, To>()) {
+    static_assert(permit_tautology, "tautological integer_cast");
+  } else {
+#ifdef ASSERT
+    if (!is_integer_convertible<To>(from)) {
+      if constexpr (std::is_signed_v<From>) {
+        fatal("integer_cast failed: %jd", static_cast<intmax_t>(from));
+      } else {
+        fatal("integer_cast failed: %ju", static_cast<uintmax_t>(from));
+      }
+    }
+#endif // ASSERT
+  }
+  return static_cast<To>(from);
+}
+
+// Equivalent to "integer_cast<To, true>(from)", disabling the compile-time
+// check for tautological casts.  Using this function is prefered to direct
+// use of the permit_tautology template parameter for integer_cast, unless the
+// choice is computed.
+template<typename To, typename From,
+         ENABLE_IF(std::is_integral_v<To>),
+         ENABLE_IF(std::is_integral_v<From>)>
+constexpr To integer_cast_permit_tautology(From from) {
+  return integer_cast<To, true>(from);
+}
+
+// Convert an enumerator to an integral value via static_cast, after a
+// debug-only check that the value is within the range for the destination
+// type.  This is mostly for compatibility with old code.  Class scoped enums
+// were used to work around ancient compilers that didn't implement class
+// scoped static integral constants properly, and HotSpot code still has many
+// examples of this.  For others it might be sufficient to provide an explicit
+// underlying type and either permit implicit conversions or use
+// PrimitiveConversion::cast.
+template<typename To, typename From,
+         ENABLE_IF(std::is_integral_v<To>),
+         ENABLE_IF(std::is_enum_v<From>)>
+constexpr To integer_cast(From from) {
+  using U = std::underlying_type_t<From>;
+  return integer_cast<To, true /* permit_tautology */>(static_cast<U>(from));
+}
+
+#endif // SHARE_UTILITIES_INTEGERCAST_HPP
diff --git a/test/hotspot/gtest/utilities/test_integerCast.cpp b/test/hotspot/gtest/utilities/test_integerCast.cpp
new file mode 100644
index 00000000000..87d35384c2c
--- /dev/null
+++ b/test/hotspot/gtest/utilities/test_integerCast.cpp
@@ -0,0 +1,287 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+#include "cppstdlib/limits.hpp"
+#include "cppstdlib/type_traits.hpp"
+#include "utilities/integerCast.hpp"
+#include "utilities/globalDefinitions.hpp"
+
+#include "unittest.hpp"
+
+// Enable gcc warnings to verify we don't get any of these.
+// Eventually we plan to have these globally enabled, but not there yet.
+#ifdef __GNUC__
+#pragma GCC diagnostic warning "-Wconversion"
+#pragma GCC diagnostic warning "-Wsign-conversion"
+#endif
+
+// Tautology tests for signed -> signed types.
+static_assert(is_always_integer_convertible<int32_t, int32_t>());
+static_assert(!is_always_integer_convertible<int64_t, int32_t>());
+static_assert(is_always_integer_convertible<int32_t, int64_t>());
+static_assert(is_always_integer_convertible<int64_t, int64_t>());
+
+// Tautology tests for unsigned -> unsigned types.
+static_assert(is_always_integer_convertible<uint32_t, uint32_t>());
+static_assert(!is_always_integer_convertible<uint64_t, uint32_t>());
+static_assert(is_always_integer_convertible<uint32_t, uint64_t>());
+static_assert(is_always_integer_convertible<uint64_t, uint64_t>());
+
+// Tautology tests for signed -> unsigned types.
+static_assert(!is_always_integer_convertible<int32_t, uint32_t>());
+static_assert(!is_always_integer_convertible<int64_t, uint32_t>());
+static_assert(!is_always_integer_convertible<int32_t, uint64_t>());
+static_assert(!is_always_integer_convertible<int64_t, uint64_t>());
+
+// Tautology tests for unsigned -> signed types.
+static_assert(!is_always_integer_convertible<uint32_t, int32_t>());
+static_assert(!is_always_integer_convertible<uint64_t, int32_t>());
+static_assert(is_always_integer_convertible<uint32_t, int64_t>());
+static_assert(!is_always_integer_convertible<uint64_t, int64_t>());
+
+template<typename T>
+struct TestIntegerCastValues {
+  static TestIntegerCastValues values;
+
+  T minus_one = static_cast<T>(-1);
+  T zero = static_cast<T>(0);
+  T one = static_cast<T>(1);
+  T min = std::numeric_limits<T>::min();
+  T max = std::numeric_limits<T>::max();
+};
+
+template<typename T>
+TestIntegerCastValues<T> TestIntegerCastValues<T>::values{};
+
+template<typename To, typename From>
+struct TestIntegerCastPairedValues {
+  static TestIntegerCastPairedValues values;
+
+  From min = static_cast<From>(std::numeric_limits<To>::min());
+  From max = static_cast<From>(std::numeric_limits<To>::max());
+};
+
+template<typename To, typename From>
+TestIntegerCastPairedValues<To, From>
+TestIntegerCastPairedValues<To, From>::values{};
+
+//////////////////////////////////////////////////////////////////////////////
+// Integer casts between integral types of different sizes.
+// Test narrowing to verify checking.
+// Test widening to verify no compiler warnings for tautological comparisons.
+
+template<typename To, typename From>
+struct TestIntegerCastIntegerValues {
+  static TestIntegerCastIntegerValues values;
+
+  TestIntegerCastValues<To> to;
+  TestIntegerCastValues<From> from;
+  TestIntegerCastPairedValues<To, From> to_as_from;
+};
+
+template<typename To, typename From>
+TestIntegerCastIntegerValues<To, From>
+TestIntegerCastIntegerValues<To, From>::values{};
+
+template<typename To, typename From>
+static void good_integer_conversion(From from) {
+  ASSERT_TRUE(is_integer_convertible<To>(from));
+  EXPECT_EQ(static_cast<To>(from), integer_cast<To>(from));
+}
+
+template<typename To, typename From>
+static void bad_integer_conversion(From from) {
+  EXPECT_FALSE(is_integer_convertible<To>(from));
+}
+
+// signed -> signed is tautological unless From is wider than To.
+
+TEST(TestIntegerCast, wide_signed_to_narrow_signed_integers) {
+  using To = int32_t;
+  using From = int64_t;
+  using Values = TestIntegerCastIntegerValues<To, From>;
+  const Values& values = Values::values;
+
+  good_integer_conversion<To>(values.from.minus_one);
+  good_integer_conversion<To>(values.from.zero);
+  good_integer_conversion<To>(values.from.one);
+  bad_integer_conversion<To>(values.from.min);
+  bad_integer_conversion<To>(values.from.max);
+  good_integer_conversion<To>(values.to_as_from.min);
+  good_integer_conversion<To>(values.to_as_from.max);
+  bad_integer_conversion<To>(values.to_as_from.min - 1);
+  bad_integer_conversion<To>(values.to_as_from.max + 1);
+}
+
+// unsigned -> unsigned is tautological unless From is wider than To.
+
+TEST(TestIntegerCast, wide_unsigned_to_narrow_unsigned_integers) {
+  using To = uint32_t;
+  using From = uint64_t;
+  using Values = TestIntegerCastIntegerValues<To, From>;
+  const Values& values = Values::values;
+
+  bad_integer_conversion<To>(values.from.minus_one);
+  good_integer_conversion<To>(values.from.zero);
+  good_integer_conversion<To>(values.from.one);
+  good_integer_conversion<To>(values.from.min);
+  bad_integer_conversion<To>(values.from.max);
+  good_integer_conversion<To>(values.to_as_from.min);
+  good_integer_conversion<To>(values.to_as_from.min);
+  bad_integer_conversion<To>(values.to_as_from.min - 1);
+  bad_integer_conversion<To>(values.to_as_from.max + 1);
+}
+
+TEST(TestIntegerCast, unsigned_to_signed_same_size_integers) {
+  using To = int32_t;
+  using From = uint32_t;
+  using Values = TestIntegerCastIntegerValues<To, From>;
+  const Values& values = Values::values;
+
+  good_integer_conversion<To>(values.from.zero);
+  good_integer_conversion<To>(values.from.one);
+  good_integer_conversion<To>(values.from.min);
+  bad_integer_conversion<To>(values.from.max);
+  bad_integer_conversion<To>(values.to_as_from.min);
+  good_integer_conversion<To>(values.to_as_from.max);
+  bad_integer_conversion<To>(values.to_as_from.max + 1);
+}
+
+// Narrow unsigned to wide signed is tautological.
+
+TEST(TestIntegerCast, wide_unsigned_to_narrow_signed_integers) {
+  using To = int32_t;
+  using From = uint64_t;
+  using Values = TestIntegerCastIntegerValues<To, From>;
+  const Values& values = Values::values;
+
+  bad_integer_conversion<To>(values.from.minus_one);
+  good_integer_conversion<To>(values.from.zero);
+  good_integer_conversion<To>(values.from.one);
+  good_integer_conversion<To>(values.from.min);
+  bad_integer_conversion<To>(values.from.max);
+  bad_integer_conversion<To>(values.to_as_from.min);
+  good_integer_conversion<To>(values.to_as_from.max);
+  bad_integer_conversion<To>(values.to_as_from.min - 1);
+  bad_integer_conversion<To>(values.to_as_from.max + 1);
+}
+
+TEST(TestIntegerCast, signed_to_unsigned_same_size_integers) {
+  using To = uint32_t;
+  using From = int32_t;
+  using Values = TestIntegerCastIntegerValues<To, From>;
+  const Values& values = Values::values;
+
+  bad_integer_conversion<To>(values.from.minus_one);
+  good_integer_conversion<To>(values.from.zero);
+  good_integer_conversion<To>(values.from.one);
+  bad_integer_conversion<To>(values.from.min);
+  good_integer_conversion<To>(values.from.max);
+  good_integer_conversion<To>(values.to_as_from.min);
+  bad_integer_conversion<To>(values.to_as_from.max);
+}
+
+TEST(TestIntegerCast, narrow_signed_to_wide_unsigned_integers) {
+  using To = uint64_t;
+  using From = int32_t;
+  using Values = TestIntegerCastIntegerValues<To, From>;
+  const Values& values = Values::values;
+
+  bad_integer_conversion<To>(values.from.minus_one);
+  good_integer_conversion<To>(values.from.zero);
+  good_integer_conversion<To>(values.from.one);
+  bad_integer_conversion<To>(values.from.min);
+  good_integer_conversion<To>(values.from.max);
+  good_integer_conversion<To>(values.to_as_from.min);
+  bad_integer_conversion<To>(values.to_as_from.max);
+}
+
+TEST(TestIntegerCast, wide_signed_to_narrow_unsigned_integers) {
+  using To = uint32_t;
+  using From = int64_t;
+  using Values = TestIntegerCastIntegerValues<To, From>;
+  const Values& values = Values::values;
+
+  bad_integer_conversion<To>(values.from.minus_one);
+  good_integer_conversion<To>(values.from.zero);
+  good_integer_conversion<To>(values.from.one);
+  bad_integer_conversion<To>(values.from.min);
+  bad_integer_conversion<To>(values.from.max);
+  good_integer_conversion<To>(values.to_as_from.min);
+  good_integer_conversion<To>(values.to_as_from.max);
+}
+
+TEST(TestIntegerCast, permit_tautology) {
+  using From = uint32_t;
+  using To = int64_t;
+  using Values = TestIntegerCastIntegerValues<To, From>;
+  const Values& values = Values::values;
+
+  static_assert(is_always_integer_convertible<From, To>());
+  EXPECT_EQ(static_cast<To>(values.from.min),
+            (integer_cast<To, true>(values.from.min)));
+  EXPECT_EQ(static_cast<To>(values.from.min),
+            (integer_cast_permit_tautology<To>(values.from.min)));
+  EXPECT_EQ(static_cast<To>(values.from.max),
+            (integer_cast<To, true>(values.from.max)));
+  EXPECT_EQ(static_cast<To>(values.from.max),
+            integer_cast_permit_tautology<To>(values.from.max));
+}
+
+TEST(TestIntegerCast, check_constexpr) {
+  using From = int64_t;
+  using To = int32_t;
+  constexpr From value = std::numeric_limits<To>::max();
+  constexpr To converted = integer_cast<To>(value);
+  EXPECT_EQ(static_cast<To>(value), converted);
+}
+
+#ifdef ASSERT
+
+TEST_VM_ASSERT(TestIntegerCast, cast_failure_signed_range) {
+  using From = int64_t;
+  using To = int32_t;
+  using Values = TestIntegerCastIntegerValues<To, From>;
+  const Values& values = Values::values;
+
+  From value = values.from.max;
+  To expected = static_cast<To>(value); // Narrowing conversion.
+  EXPECT_FALSE(is_integer_convertible<To>(value));
+  // Should assert.  If it doesn't, then shuld be equal, so fail.
+  EXPECT_NE(static_cast<To>(value), integer_cast<To>(value));
+}
+
+TEST_VM_ASSERT(TestIntegerCast, cast_failure_unsigned_range) {
+  using From = uint64_t;
+  using To = uint32_t;
+  using Values = TestIntegerCastIntegerValues<To, From>;
+  const Values& values = Values::values;
+
+  From value = values.from.max;
+  To expected = static_cast<To>(value); // Narrowing conversion.
+  EXPECT_FALSE(is_integer_convertible<To>(value));
+  // Should assert.  If it doesn't, then should be equal, so fail.
+  EXPECT_NE(static_cast<To>(value), integer_cast<To>(value));
+}
+
+#endif // ASSERT

From 4b38e7bcd3989a5e33d2b38e3c7904a5d3be7e45 Mon Sep 17 00:00:00 2001
From: Naoto Sato <naoto@openjdk.org>
Date: Tue, 24 Mar 2026 21:35:17 +0000
Subject: [PATCH 328/655] 8346133: Refactor java.time.ZoneOffset caching

Reviewed-by: jlu, liach, rriggs
---
 .../share/classes/java/time/ZoneOffset.java   | 19 ++++++++++---------
 1 file changed, 10 insertions(+), 9 deletions(-)

diff --git a/src/java.base/share/classes/java/time/ZoneOffset.java b/src/java.base/share/classes/java/time/ZoneOffset.java
index 2a45e7cbf82..3bcb75db3e4 100644
--- a/src/java.base/share/classes/java/time/ZoneOffset.java
+++ b/src/java.base/share/classes/java/time/ZoneOffset.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2012, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2012, 2026, Oracle and/or its affiliates. All rights reserved.
  * Copyright (c) 2025, Alibaba Group Holding Limited. All Rights Reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
@@ -87,9 +87,9 @@ import java.util.Objects;
 import java.util.concurrent.ConcurrentHashMap;
 import java.util.concurrent.ConcurrentMap;
 import java.util.concurrent.atomic.AtomicReferenceArray;
+import java.util.function.Supplier;
 
 import jdk.internal.util.DecimalDigits;
-import jdk.internal.vm.annotation.Stable;
 
 /**
  * A time-zone offset from Greenwich/UTC, such as {@code +02:00}.
@@ -178,8 +178,13 @@ public final class ZoneOffset
     /**
      * The zone rules for an offset will always return this offset. Cache it for efficiency.
      */
-    @Stable
-    private transient ZoneRules rules;
+    private final transient LazyConstant<ZoneRules> rules =
+        LazyConstant.of(new Supplier<ZoneRules>() {
+            @Override
+            public ZoneRules get() {
+                return ZoneRules.of(ZoneOffset.this);
+            }
+        });
 
     //-----------------------------------------------------------------------
     /**
@@ -521,11 +526,7 @@ public final class ZoneOffset
      */
     @Override
     public ZoneRules getRules() {
-        ZoneRules rules = this.rules;
-        if (rules == null) {
-            rules = this.rules = ZoneRules.of(this);
-        }
-        return rules;
+        return rules.get();
     }
 
     @Override

From 4e7901576851ebe22b40349bf0e155b39ca6c34a Mon Sep 17 00:00:00 2001
From: William Kemper <wkemper@openjdk.org>
Date: Tue, 24 Mar 2026 23:52:27 +0000
Subject: [PATCH 329/655] 8380846: GenShen: Remove the experimental option to
 disable adaptive tenuring

Reviewed-by: kdnilsen
---
 .../gc/shenandoah/shenandoahAgeCensus.cpp     | 28 ++++---------------
 .../gc/shenandoah/shenandoahAgeCensus.hpp     |  1 -
 .../gc/shenandoah/shenandoahGeneration.cpp    |  2 +-
 .../gc/shenandoah/shenandoahMark.inline.hpp   | 12 ++++----
 .../gc/shenandoah/shenandoah_globals.hpp      |  6 +---
 5 files changed, 12 insertions(+), 37 deletions(-)

diff --git a/src/hotspot/share/gc/shenandoah/shenandoahAgeCensus.cpp b/src/hotspot/share/gc/shenandoah/shenandoahAgeCensus.cpp
index 86ff6f22c72..71fd6e37614 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahAgeCensus.cpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahAgeCensus.cpp
@@ -57,21 +57,13 @@ ShenandoahAgeCensus::ShenandoahAgeCensus(uint max_workers)
     // Sentinel value
     _tenuring_threshold[i] = MAX_COHORTS;
   }
-  if (ShenandoahGenerationalAdaptiveTenuring) {
-    _local_age_tables = NEW_C_HEAP_ARRAY(AgeTable*, _max_workers, mtGC);
-    CENSUS_NOISE(_local_noise = NEW_C_HEAP_ARRAY(ShenandoahNoiseStats, max_workers, mtGC);)
-    for (uint i = 0; i < _max_workers; i++) {
-      _local_age_tables[i] = new AgeTable(false);
-      CENSUS_NOISE(_local_noise[i].clear();)
-    }
-  } else {
-    _local_age_tables = nullptr;
+  _local_age_tables = NEW_C_HEAP_ARRAY(AgeTable*, _max_workers, mtGC);
+  CENSUS_NOISE(_local_noise = NEW_C_HEAP_ARRAY(ShenandoahNoiseStats, max_workers, mtGC);)
+  for (uint i = 0; i < _max_workers; i++) {
+    _local_age_tables[i] = new AgeTable(false);
+    CENSUS_NOISE(_local_noise[i].clear();)
   }
   _epoch = MAX_SNAPSHOTS - 1;  // see prepare_for_census_update()
-
-  if (!ShenandoahGenerationalAdaptiveTenuring) {
-    _tenuring_threshold[_epoch] = InitialTenuringThreshold;
-  }
 }
 
 ShenandoahAgeCensus::~ShenandoahAgeCensus() {
@@ -154,7 +146,6 @@ void ShenandoahAgeCensus::prepare_for_census_update() {
 // and compute the new tenuring threshold.
 void ShenandoahAgeCensus::update_census(size_t age0_pop) {
   prepare_for_census_update();
-  assert(ShenandoahGenerationalAdaptiveTenuring, "Only update census when adaptive tenuring is enabled");
   assert(_global_age_tables[_epoch]->is_clear(), "Dirty decks");
   CENSUS_NOISE(assert(_global_noise[_epoch].is_clear(), "Dirty decks");)
 
@@ -195,10 +186,6 @@ void ShenandoahAgeCensus::reset_global() {
 
 // Reset the local age tables, clearing any partial census.
 void ShenandoahAgeCensus::reset_local() {
-  if (!ShenandoahGenerationalAdaptiveTenuring) {
-    assert(_local_age_tables == nullptr, "Error");
-    return;
-  }
   for (uint i = 0; i < _max_workers; i++) {
     _local_age_tables[i]->clear();
     CENSUS_NOISE(_local_noise[i].clear();)
@@ -221,10 +208,6 @@ bool ShenandoahAgeCensus::is_clear_global() {
 
 // Is local census information clear?
 bool ShenandoahAgeCensus::is_clear_local() {
-  if (!ShenandoahGenerationalAdaptiveTenuring) {
-    assert(_local_age_tables == nullptr, "Error");
-    return true;
-  }
   for (uint i = 0; i < _max_workers; i++) {
     bool clear = _local_age_tables[i]->is_clear();
     CENSUS_NOISE(clear |= _local_noise[i].is_clear();)
@@ -258,7 +241,6 @@ void ShenandoahAgeCensus::update_total() {
 #endif // !PRODUCT
 
 void ShenandoahAgeCensus::update_tenuring_threshold() {
-  assert(ShenandoahGenerationalAdaptiveTenuring, "Only update when adaptive tenuring is enabled");
   uint tt = compute_tenuring_threshold();
   assert(tt <= MAX_COHORTS, "Out of bounds");
   _tenuring_threshold[_epoch] = tt;
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahAgeCensus.hpp b/src/hotspot/share/gc/shenandoah/shenandoahAgeCensus.hpp
index 39ea4ee9002..5ccd0b21398 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahAgeCensus.hpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahAgeCensus.hpp
@@ -173,7 +173,6 @@ class ShenandoahAgeCensus: public CHeapObj<mtGC> {
   ~ShenandoahAgeCensus();
 
   // Return the local age table (population vector) for worker_id.
-  // Only used in the case of ShenandoahGenerationalAdaptiveTenuring
   AgeTable* get_local_age_table(uint worker_id) const {
     return _local_age_tables[worker_id];
   }
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahGeneration.cpp b/src/hotspot/share/gc/shenandoah/shenandoahGeneration.cpp
index 750389ae6c3..f3c05049079 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahGeneration.cpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahGeneration.cpp
@@ -272,7 +272,7 @@ void ShenandoahGeneration::prepare_regions_and_collection_set(bool concurrent) {
   }
 
   // Tally the census counts and compute the adaptive tenuring threshold
-  if (is_generational && ShenandoahGenerationalAdaptiveTenuring) {
+  if (is_generational) {
     // Objects above TAMS weren't included in the age census. Since they were all
     // allocated in this cycle they belong in the age 0 cohort. We walk over all
     // young regions and sum the volume of objects between TAMS and top.
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahMark.inline.hpp b/src/hotspot/share/gc/shenandoah/shenandoahMark.inline.hpp
index d4699a61166..0d42b95164b 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahMark.inline.hpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahMark.inline.hpp
@@ -117,13 +117,11 @@ inline void ShenandoahMark::count_liveness(ShenandoahLiveData* live_data, oop ob
   // Age census for objects in the young generation
   if (GENERATION == YOUNG || (GENERATION == GLOBAL && region->is_young())) {
     assert(heap->mode()->is_generational(), "Only if generational");
-    if (ShenandoahGenerationalAdaptiveTenuring) {
-      assert(region->is_young(), "Only for young objects");
-      uint age = ShenandoahHeap::get_object_age(obj);
-      ShenandoahAgeCensus* const census = ShenandoahGenerationalHeap::heap()->age_census();
-      CENSUS_NOISE(census->add(age, region->age(), region->youth(), size, worker_id);)
-      NO_CENSUS_NOISE(census->add(age, region->age(), size, worker_id);)
-    }
+    assert(region->is_young(), "Only for young objects");
+    const uint age = ShenandoahHeap::get_object_age(obj);
+    ShenandoahAgeCensus* const census = ShenandoahGenerationalHeap::heap()->age_census();
+    CENSUS_NOISE(census->add(age, region->age(), region->youth(), size, worker_id);)
+    NO_CENSUS_NOISE(census->add(age, region->age(), size, worker_id);)
   }
 
   if (!region->is_humongous_start()) {
diff --git a/src/hotspot/share/gc/shenandoah/shenandoah_globals.hpp b/src/hotspot/share/gc/shenandoah/shenandoah_globals.hpp
index d3e9a1f9fae..bbfa19934d9 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoah_globals.hpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoah_globals.hpp
@@ -152,9 +152,6 @@
           "evvort even if the usage of old generation is below "            \
           "ShenandoahIgnoreOldGrowthBelowPercentage.")                      \
                                                                             \
-  product(bool, ShenandoahGenerationalAdaptiveTenuring, true, EXPERIMENTAL, \
-          "(Generational mode only) Dynamically adapt tenuring age.")       \
-                                                                            \
   product(bool, ShenandoahGenerationalCensusIgnoreOlderCohorts, true,       \
                                                                EXPERIMENTAL,\
           "(Generational mode only) Ignore mortality rates older than the " \
@@ -179,8 +176,7 @@
           "(Generational mode only) Cohort mortality rates below this "     \
           "value will be treated as indicative of longevity, leading to "   \
           "tenuring. A lower value delays tenuring, a higher value hastens "\
-          "it. Used only when ShenandoahGenerationalhenAdaptiveTenuring is "\
-          "enabled.")                                                       \
+          "it.")                                                       \
           range(0.001,0.999)                                                \
                                                                             \
   product(size_t, ShenandoahGenerationalTenuringCohortPopulationThreshold,  \

From e8ce930e28c26b12fb0eafab201ccedaa2650e5d Mon Sep 17 00:00:00 2001
From: William Kemper <wkemper@openjdk.org>
Date: Wed, 25 Mar 2026 00:23:41 +0000
Subject: [PATCH 330/655] 8379020: GenShen: Promote all objects when whitebox
 full GC is requested

Reviewed-by: ysr, kdnilsen
---
 .../gc/shenandoah/shenandoahAgeCensus.hpp     | 28 +++++++++++++++++++
 .../shenandoahGenerationalControlThread.cpp   |  7 +++++
 2 files changed, 35 insertions(+)

diff --git a/src/hotspot/share/gc/shenandoah/shenandoahAgeCensus.hpp b/src/hotspot/share/gc/shenandoah/shenandoahAgeCensus.hpp
index 5ccd0b21398..9c5baaedcd6 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahAgeCensus.hpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahAgeCensus.hpp
@@ -97,6 +97,8 @@ struct ShenandoahNoiseStats {
 // once the per-worker data is consolidated into the appropriate population vector
 // per minor collection. The _local_age_table is thus C x N, for N GC workers.
 class ShenandoahAgeCensus: public CHeapObj<mtGC> {
+  friend class ShenandoahTenuringOverride;
+
   AgeTable** _global_age_tables;      // Global age tables used for adapting tenuring threshold, one per snapshot
   AgeTable** _local_age_tables;       // Local scratch age tables to track object ages, one per worker
 
@@ -148,6 +150,10 @@ class ShenandoahAgeCensus: public CHeapObj<mtGC> {
     return _tenuring_threshold[prev];
   }
 
+  // Override the tenuring threshold for the current epoch. This is used to
+  // cause everything to be promoted for a whitebox full gc request.
+  void set_tenuring_threshold(uint threshold) { _tenuring_threshold[_epoch] = threshold; }
+
 #ifndef PRODUCT
   // Return the sum of size of objects of all ages recorded in the
   // census at snapshot indexed by snap.
@@ -232,4 +238,26 @@ class ShenandoahAgeCensus: public CHeapObj<mtGC> {
   void print();
 };
 
+// RAII object that temporarily overrides the tenuring threshold for the
+// duration of a scope, restoring the original value on destruction.
+// Used to force promotion of all young objects during whitebox full GCs.
+class ShenandoahTenuringOverride : public StackObj {
+  ShenandoahAgeCensus* _census;
+  uint _saved_threshold;
+  bool _active;
+public:
+  ShenandoahTenuringOverride(bool active, ShenandoahAgeCensus* census) :
+    _census(census), _saved_threshold(0), _active(active) {
+    if (_active) {
+      _saved_threshold = _census->tenuring_threshold();
+      _census->set_tenuring_threshold(0);
+    }
+  }
+  ~ShenandoahTenuringOverride() {
+    if (_active) {
+      _census->set_tenuring_threshold(_saved_threshold);
+    }
+  }
+};
+
 #endif // SHARE_GC_SHENANDOAH_SHENANDOAHAGECENSUS_HPP
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahGenerationalControlThread.cpp b/src/hotspot/share/gc/shenandoah/shenandoahGenerationalControlThread.cpp
index 1edff443ded..67cc4d2f703 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahGenerationalControlThread.cpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahGenerationalControlThread.cpp
@@ -24,6 +24,7 @@
  *
  */
 
+#include "gc/shenandoah/shenandoahAgeCensus.hpp"
 #include "gc/shenandoah/shenandoahAsserts.hpp"
 #include "gc/shenandoah/shenandoahCollectorPolicy.hpp"
 #include "gc/shenandoah/shenandoahConcurrentGC.hpp"
@@ -271,6 +272,12 @@ void ShenandoahGenerationalControlThread::run_gc_cycle(const ShenandoahGCRequest
     // Cannot uncommit bitmap slices during concurrent reset
     ShenandoahNoUncommitMark forbid_region_uncommit(_heap);
 
+    // When a whitebox full GC is requested, set the tenuring threshold to zero
+    // so that all young objects are promoted to old. This ensures that tests
+    // using WB.fullGC() to promote objects to old gen will not loop forever.
+    ShenandoahTenuringOverride tenuring_override(request.cause == GCCause::_wb_full_gc,
+                                                 _heap->age_census());
+
     _heap->print_before_gc();
     switch (gc_mode()) {
       case concurrent_normal: {

From 56885958c2207eabd24c079a8f4a69e2aad066a5 Mon Sep 17 00:00:00 2001
From: Kelvin Nilsen <kdnilsen@openjdk.org>
Date: Wed, 25 Mar 2026 00:40:37 +0000
Subject: [PATCH 331/655] 8380408: GenShen: Fix regression with
 vmTestbase/gc/memory/Churn/Churn2/TestDescription.java

Reviewed-by: wkemper
---
 .../heuristics/shenandoahGenerationalHeuristics.cpp       | 4 ++++
 .../heuristics/shenandoahGenerationalHeuristics.hpp       | 2 +-
 .../gc/shenandoah/heuristics/shenandoahOldHeuristics.cpp  | 6 ++++--
 src/hotspot/share/gc/shenandoah/shenandoahFreeSet.hpp     | 6 ++++--
 src/hotspot/share/gc/shenandoah/shenandoahGeneration.cpp  | 6 ------
 src/hotspot/share/gc/shenandoah/shenandoahGeneration.hpp  | 3 +--
 .../share/gc/shenandoah/shenandoahYoungGeneration.cpp     | 8 ++++++++
 .../share/gc/shenandoah/shenandoahYoungGeneration.hpp     | 2 ++
 8 files changed, 24 insertions(+), 13 deletions(-)

diff --git a/src/hotspot/share/gc/shenandoah/heuristics/shenandoahGenerationalHeuristics.cpp b/src/hotspot/share/gc/shenandoah/heuristics/shenandoahGenerationalHeuristics.cpp
index 08d628e67ff..d5622ed5d79 100644
--- a/src/hotspot/share/gc/shenandoah/heuristics/shenandoahGenerationalHeuristics.cpp
+++ b/src/hotspot/share/gc/shenandoah/heuristics/shenandoahGenerationalHeuristics.cpp
@@ -498,7 +498,11 @@ void ShenandoahGenerationalHeuristics::adjust_evacuation_budgets(ShenandoahHeap*
   size_t young_evacuated = collection_set->get_live_bytes_in_untenurable_regions();
   size_t young_evacuated_reserve_used = (size_t) (ShenandoahEvacWaste * double(young_evacuated));
 
+  // In top_off_collection_set(), we shrunk planned future reserve by _add_regions_to_old * region_size_bytes, but we
+  // didn't shrink available. The current reserve is not affected by the planned future reserve. Current available is
+  // larger than planned available by the planned adjustment amount.
   size_t total_young_available = young_generation->available_with_reserve() - _add_regions_to_old * region_size_bytes;
+
   assert(young_evacuated_reserve_used <= total_young_available, "Cannot evacuate (%zu) more than is available in young (%zu)",
          young_evacuated_reserve_used, total_young_available);
   young_generation->set_evacuation_reserve(young_evacuated_reserve_used);
diff --git a/src/hotspot/share/gc/shenandoah/heuristics/shenandoahGenerationalHeuristics.hpp b/src/hotspot/share/gc/shenandoah/heuristics/shenandoahGenerationalHeuristics.hpp
index c418e8c24ec..d6551cffb73 100644
--- a/src/hotspot/share/gc/shenandoah/heuristics/shenandoahGenerationalHeuristics.hpp
+++ b/src/hotspot/share/gc/shenandoah/heuristics/shenandoahGenerationalHeuristics.hpp
@@ -76,7 +76,7 @@ private:
   // Filter and sort remaining regions before adding to collection set.
   void filter_regions(ShenandoahCollectionSet* collection_set);
 
-  // Adjust evacuation budgets after choosing collection set.  The argument regions_to_xfer
+  // Adjust evacuation budgets after choosing collection set.  On entry, the instance variable _regions_to_xfer
   // represents regions to be transferred to old based on decisions made in top_off_collection_set()
   void adjust_evacuation_budgets(ShenandoahHeap* const heap,
                                  ShenandoahCollectionSet* const collection_set);
diff --git a/src/hotspot/share/gc/shenandoah/heuristics/shenandoahOldHeuristics.cpp b/src/hotspot/share/gc/shenandoah/heuristics/shenandoahOldHeuristics.cpp
index 4f71562f4f6..33c91e27be5 100644
--- a/src/hotspot/share/gc/shenandoah/heuristics/shenandoahOldHeuristics.cpp
+++ b/src/hotspot/share/gc/shenandoah/heuristics/shenandoahOldHeuristics.cpp
@@ -369,7 +369,6 @@ bool ShenandoahOldHeuristics::top_off_collection_set(ShenandoahCollectionSet* co
 
     assert(consumed_from_young_cset <= max_young_cset, "sanity");
     assert(max_young_cset <= young_unaffiliated_regions * region_size_bytes, "sanity");
-
     size_t regions_for_old_expansion;
     if (consumed_from_young_cset < max_young_cset) {
       size_t excess_young_reserves = max_young_cset - consumed_from_young_cset;
@@ -392,7 +391,10 @@ bool ShenandoahOldHeuristics::top_off_collection_set(ShenandoahCollectionSet* co
       _unspent_unfragmented_old_budget += supplement_without_waste;
       _old_generation->augment_evacuation_reserve(budget_supplement);
       young_generation->set_evacuation_reserve(max_young_cset - budget_supplement);
-
+      assert(young_generation->get_evacuation_reserve() >=
+             collection_set->get_live_bytes_in_untenurable_regions() * ShenandoahEvacWaste,
+             "adjusted evac reserve (%zu) must be large enough for planned evacuation (%zu)",
+             young_generation->get_evacuation_reserve(), collection_set->get_live_bytes_in_untenurable_regions());
       return add_old_regions_to_cset(collection_set);
     } else {
       add_regions_to_old = 0;
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahFreeSet.hpp b/src/hotspot/share/gc/shenandoah/shenandoahFreeSet.hpp
index 2df06432bd2..eeff0fde87c 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahFreeSet.hpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahFreeSet.hpp
@@ -857,14 +857,16 @@ public:
     ShenandoahRebuildLocker locker(rebuild_lock());
     return _partitions.available_in_locked_for_rebuild(ShenandoahFreeSetPartitionId::Mutator);
   }
-  inline size_t available_holding_lock() const
-                                  { return _partitions.available_in(ShenandoahFreeSetPartitionId::Mutator); }
 
   // Use this version of available() if the heap lock is held.
   inline size_t available_locked() const {
     return _partitions.available_in(ShenandoahFreeSetPartitionId::Mutator);
   }
 
+  inline size_t collector_available_locked() const {
+    return _partitions.available_in(ShenandoahFreeSetPartitionId::Collector);
+  }
+
   inline size_t total_humongous_waste() const      { return _total_humongous_waste; }
   inline size_t humongous_waste_in_mutator() const {
     return _partitions.humongous_waste(ShenandoahFreeSetPartitionId::Mutator);
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahGeneration.cpp b/src/hotspot/share/gc/shenandoah/shenandoahGeneration.cpp
index f3c05049079..3d592e9f9be 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahGeneration.cpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahGeneration.cpp
@@ -423,12 +423,6 @@ size_t ShenandoahGeneration::available() const {
   return result;
 }
 
-// For ShenandoahYoungGeneration, Include the young available that may have been reserved for the Collector.
-size_t ShenandoahGeneration::available_with_reserve() const {
-  size_t result = available(max_capacity());
-  return result;
-}
-
 size_t ShenandoahGeneration::soft_mutator_available() const {
   size_t result = available(ShenandoahHeap::heap()->soft_max_capacity() * (100.0 - ShenandoahEvacReserve) / 100);
   return result;
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahGeneration.hpp b/src/hotspot/share/gc/shenandoah/shenandoahGeneration.hpp
index 1a549be8988..6f32d101152 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahGeneration.hpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahGeneration.hpp
@@ -63,7 +63,7 @@ private:
   // Return available assuming that we can allocate no more than capacity bytes within this generation.
   size_t available(size_t capacity) const;
 
- public:
+public:
   ShenandoahGeneration(ShenandoahGenerationType type,
                        uint max_workers);
   ~ShenandoahGeneration();
@@ -96,7 +96,6 @@ private:
   virtual size_t max_capacity() const override = 0;
 
   size_t available() const override;
-  size_t available_with_reserve() const;
 
   // Returns the memory available based on the _soft_ max heap capacity (soft_max_heap - used).
   // The soft max heap size may be adjusted lower than the max heap size to cause the trigger
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahYoungGeneration.cpp b/src/hotspot/share/gc/shenandoah/shenandoahYoungGeneration.cpp
index f00ce16136f..7a76bc50078 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahYoungGeneration.cpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahYoungGeneration.cpp
@@ -131,6 +131,14 @@ size_t ShenandoahYoungGeneration::free_unaffiliated_regions() const {
   return _free_set->young_unaffiliated_regions();
 }
 
+size_t ShenandoahYoungGeneration::available_with_reserve() const {
+  shenandoah_assert_heaplocked();
+  ShenandoahFreeSet* free_set = ShenandoahHeap::heap()->free_set();
+  size_t mutator_available = free_set->available_locked();
+  size_t collector_available = free_set->collector_available_locked();
+  return mutator_available + collector_available;
+}
+
 size_t ShenandoahYoungGeneration::available() const {
   // The collector reserve may eat into what the mutator is allowed to use. Make sure we are looking
   // at what is available to the mutator when reporting how much memory is available.
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahYoungGeneration.hpp b/src/hotspot/share/gc/shenandoah/shenandoahYoungGeneration.hpp
index 930c5ff1747..c3b6944ec80 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahYoungGeneration.hpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahYoungGeneration.hpp
@@ -82,6 +82,8 @@ public:
   size_t get_affiliated_region_count() const override;
   size_t max_capacity() const override;
 
+  // Return sum of bytes available to mutator and to Collector, assuming heap lock is held.
+  size_t available_with_reserve() const;
   size_t available() const override;
   size_t soft_mutator_available() const override;
 

From 4408e1c9279184fa0558e41d77f5683f61e5b314 Mon Sep 17 00:00:00 2001
From: Dingli Zhang <dzhang@openjdk.org>
Date: Wed, 25 Mar 2026 02:16:59 +0000
Subject: [PATCH 332/655] 8380580: Enable
 TestCombineAddPWithConstantOffsets.java IR tests for RISC-V

Reviewed-by: fyang
---
 .../c2/irTests/igvn/TestCombineAddPWithConstantOffsets.java  | 5 +++--
 1 file changed, 3 insertions(+), 2 deletions(-)

diff --git a/test/hotspot/jtreg/compiler/c2/irTests/igvn/TestCombineAddPWithConstantOffsets.java b/test/hotspot/jtreg/compiler/c2/irTests/igvn/TestCombineAddPWithConstantOffsets.java
index 69963316fa9..cb7a63f5fe6 100644
--- a/test/hotspot/jtreg/compiler/c2/irTests/igvn/TestCombineAddPWithConstantOffsets.java
+++ b/test/hotspot/jtreg/compiler/c2/irTests/igvn/TestCombineAddPWithConstantOffsets.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2024, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -27,7 +27,7 @@ import compiler.lib.ir_framework.*;
 /*
  * @test
  * @bug 8343067
- * @requires os.simpleArch == "x64" | os.simpleArch == "aarch64"
+ * @requires os.simpleArch == "x64" | os.simpleArch == "aarch64" | os.simpleArch == "riscv64"
  * @requires vm.compiler2.enabled
  * @summary Test that chains of AddP nodes with constant offsets are idealized
  *          when their offset input changes.
@@ -43,6 +43,7 @@ public class TestCombineAddPWithConstantOffsets {
     @Test
     @IR(applyIfPlatform = {"x64", "true"}, failOn = {IRNode.ADD_P_OF, ".*"})
     @IR(applyIfPlatform = {"aarch64", "true"}, failOn = {IRNode.ADD_P_OF, "reg_imm"})
+    @IR(applyIfPlatform = {"riscv64", "true"}, failOn = {IRNode.ADD_P_OF, "reg_imm"})
     static void testCombineAddPWithConstantOffsets(int[] arr) {
         for (long i = 6; i < 14; i++) {
             arr[(int)i] = 1;

From 274f8e601c60fe48c6dc0fe113c44dc253cd757b Mon Sep 17 00:00:00 2001
From: Alexey Semenyuk <asemenyuk@openjdk.org>
Date: Wed, 25 Mar 2026 02:44:14 +0000
Subject: [PATCH 333/655] 8371182: [macos] Improve error messages for "invalid
 mac bundle identifier"

Reviewed-by: almatvee
---
 .../internal/MacApplicationBuilder.java       |  45 ++--
 .../resources/MacResources.properties         |   5 +-
 .../jpackage/internal/cli/StandardOption.java |   7 +
 .../internal/cli/StandardValidator.java       |   6 +-
 .../resources/MainResources.properties        |   2 +
 .../jpackage/test/CannedFormattedString.java  |  20 +-
 .../jdk/jpackage/test/JPackageCommand.java    |  47 ++++
 .../test/JPackageOutputValidator.java         |   5 +
 .../internal/MacApplicationBuilderTest.java   |  96 ++++++++
 .../tools/jpackage/junit/macosx/junit.java    |   8 +
 .../cli/OptionsValidationFailTest.excludes    |   1 -
 .../internal/cli/StandardOptionTest.java      |  36 +++
 .../jpackage/macosx/MacPropertiesTest.java    | 223 ++++++++++++++++--
 .../tools/jpackage/share/AppVersionTest.java  |  41 ++--
 test/jdk/tools/jpackage/share/ErrorTest.java  |   4 +-
 15 files changed, 465 insertions(+), 81 deletions(-)
 create mode 100644 test/jdk/tools/jpackage/junit/macosx/jdk.jpackage/jdk/jpackage/internal/MacApplicationBuilderTest.java

diff --git a/src/jdk.jpackage/macosx/classes/jdk/jpackage/internal/MacApplicationBuilder.java b/src/jdk.jpackage/macosx/classes/jdk/jpackage/internal/MacApplicationBuilder.java
index cdccd488ed6..d6b816ca75e 100644
--- a/src/jdk.jpackage/macosx/classes/jdk/jpackage/internal/MacApplicationBuilder.java
+++ b/src/jdk.jpackage/macosx/classes/jdk/jpackage/internal/MacApplicationBuilder.java
@@ -24,6 +24,8 @@
  */
 package jdk.jpackage.internal;
 
+import static jdk.jpackage.internal.cli.StandardValidator.IS_VALID_MAC_BUNDLE_IDENTIFIER;
+
 import java.io.IOException;
 import java.io.UncheckedIOException;
 import java.nio.file.Files;
@@ -37,6 +39,7 @@ import jdk.jpackage.internal.model.AppImageLayout;
 import jdk.jpackage.internal.model.AppImageSigningConfig;
 import jdk.jpackage.internal.model.Application;
 import jdk.jpackage.internal.model.ApplicationLaunchers;
+import jdk.jpackage.internal.model.ConfigException;
 import jdk.jpackage.internal.model.ExternalApplication;
 import jdk.jpackage.internal.model.JPackageException;
 import jdk.jpackage.internal.model.Launcher;
@@ -138,20 +141,6 @@ final class MacApplicationBuilder {
         return MacApplication.create(ApplicationBuilder.overrideAppImageLayout(app, appImageLayout), mixin);
     }
 
-    static boolean isValidBundleIdentifier(String id) {
-        for (int i = 0; i < id.length(); i++) {
-            char a = id.charAt(i);
-            // We check for ASCII codes first which we accept. If check fails,
-            // check if it is acceptable extended ASCII or unicode character.
-            if ((a >= 'A' && a <= 'Z') || (a >= 'a' && a <= 'z')
-                    || (a >= '0' && a <= '9') || (a == '-' || a == '.')) {
-                continue;
-            }
-            return false;
-        }
-        return true;
-    }
-
     private static void validateAppVersion(Application app) {
         try {
             CFBundleVersion.of(app.version());
@@ -246,8 +235,8 @@ final class MacApplicationBuilder {
     }
 
     private String validatedBundleIdentifier(Application app) {
-        final var value = Optional.ofNullable(bundleIdentifier).orElseGet(() -> {
-            return app.mainLauncher()
+        return Optional.ofNullable(bundleIdentifier).orElseGet(() -> {
+            var derivedValue = app.mainLauncher()
                     .flatMap(Launcher::startupInfo)
                     .map(li -> {
                         final var packageName = li.packageName();
@@ -258,15 +247,23 @@ final class MacApplicationBuilder {
                         }
                     })
                     .orElseGet(app::name);
+
+            if (!IS_VALID_MAC_BUNDLE_IDENTIFIER.test(derivedValue)) {
+                // Derived bundle identifier is invalid. Try to adjust it by dropping all invalid characters.
+                derivedValue = derivedValue.codePoints()
+                        .mapToObj(Character::toString)
+                        .filter(IS_VALID_MAC_BUNDLE_IDENTIFIER)
+                        .collect(Collectors.joining(""));
+                if (!IS_VALID_MAC_BUNDLE_IDENTIFIER.test(derivedValue)) {
+                    throw new ConfigException(
+                            I18N.format("error.invalid-derived-bundle-identifier"),
+                            I18N.format("error.invalid-derived-bundle-identifier.advice"));
+                }
+            }
+
+            Log.verbose(I18N.format("message.derived-bundle-identifier", derivedValue));
+            return derivedValue;
         });
-
-        if (!isValidBundleIdentifier(value)) {
-            throw I18N.buildConfigException("message.invalid-identifier", value)
-                    .advice("message.invalid-identifier.advice")
-                    .create();
-        }
-
-        return value;
     }
 
     private String validatedCategory() {
diff --git a/src/jdk.jpackage/macosx/classes/jdk/jpackage/internal/resources/MacResources.properties b/src/jdk.jpackage/macosx/classes/jdk/jpackage/internal/resources/MacResources.properties
index 95fff00152b..2ed1f740805 100644
--- a/src/jdk.jpackage/macosx/classes/jdk/jpackage/internal/resources/MacResources.properties
+++ b/src/jdk.jpackage/macosx/classes/jdk/jpackage/internal/resources/MacResources.properties
@@ -33,6 +33,8 @@ error.invalid-app-image-runtime-image-bin-dir=Runtime directory {0} in the prede
 error.invalid-runtime-image-bin-dir=Runtime image "{0}" should not contain "bin" folder
 error.invalid-runtime-image-bin-dir.advice=Use --strip-native-commands jlink option when generating runtime image used with {0} option
 error.invalid-app-image-plist-file=Invalid "{0}" file in the predefined application image
+error.invalid-derived-bundle-identifier=Can't derive a valid bundle identifier from the input data
+error.invalid-derived-bundle-identifier.advice=Specify bundle identifier with --mac-package-identifier option
 
 resource.app-info-plist=Application Info.plist
 resource.app-runtime-info-plist=Embedded Java Runtime Info.plist
@@ -57,8 +59,7 @@ message.icon-not-icns= The specified icon "{0}" is not an ICNS file and will not
 message.version-string-too-many-components='app-version' may have between 1 and 3 numbers: 1, 1.2, 1.2.3.
 message.version-string-first-number-not-zero=The first number in an app-version cannot be zero or negative.
 message.keychain.error=Unable to get keychain list.
-message.invalid-identifier=Invalid mac bundle identifier [{0}].
-message.invalid-identifier.advice=specify identifier with "--mac-package-identifier".
+message.derived-bundle-identifier=Derived bundle identifier: {0}
 message.preparing-dmg-setup=Preparing dmg setup: {0}.
 message.preparing-scripts=Preparing package scripts.
 message.preparing-distribution-dist=Preparing distribution.dist: {0}.
diff --git a/src/jdk.jpackage/share/classes/jdk/jpackage/internal/cli/StandardOption.java b/src/jdk.jpackage/share/classes/jdk/jpackage/internal/cli/StandardOption.java
index 438a5ac3e6f..f193cff0dc0 100644
--- a/src/jdk.jpackage/share/classes/jdk/jpackage/internal/cli/StandardOption.java
+++ b/src/jdk.jpackage/share/classes/jdk/jpackage/internal/cli/StandardOption.java
@@ -58,9 +58,11 @@ import java.util.regex.Matcher;
 import java.util.regex.Pattern;
 import java.util.stream.Stream;
 import jdk.internal.util.OperatingSystem;
+import jdk.jpackage.internal.cli.OptionValueExceptionFactory.StandardArgumentsMapper;
 import jdk.jpackage.internal.model.AppImageBundleType;
 import jdk.jpackage.internal.model.BundleType;
 import jdk.jpackage.internal.model.BundlingOperationDescriptor;
+import jdk.jpackage.internal.model.ConfigException;
 import jdk.jpackage.internal.model.JPackageException;
 import jdk.jpackage.internal.model.LauncherShortcut;
 import jdk.jpackage.internal.model.LauncherShortcutStartupDirectory;
@@ -352,6 +354,11 @@ public final class StandardOption {
 
     public static final OptionValue<String> MAC_BUNDLE_IDENTIFIER = stringOption("mac-package-identifier")
             .valuePattern("package identifier")
+            .validator(StandardValidator.IS_VALID_MAC_BUNDLE_IDENTIFIER)
+            .validatorExceptionFactory(OptionValueExceptionFactory.build((message, cause) -> {
+                return new ConfigException(message, I18N.format("error.parameter-not-mac-bundle-identifier.advice"), cause);
+            }).formatArgumentsTransformer(StandardArgumentsMapper.VALUE_AND_NAME).create())
+            .validatorExceptionFormatString("error.parameter-not-mac-bundle-identifier")
             .create();
 
     public static final OptionValue<String> MAC_BUNDLE_SIGNING_PREFIX = stringOption("mac-package-signing-prefix").scope(MAC_SIGNING).create();
diff --git a/src/jdk.jpackage/share/classes/jdk/jpackage/internal/cli/StandardValidator.java b/src/jdk.jpackage/share/classes/jdk/jpackage/internal/cli/StandardValidator.java
index cfa97439592..ee9f39ee9cd 100644
--- a/src/jdk.jpackage/share/classes/jdk/jpackage/internal/cli/StandardValidator.java
+++ b/src/jdk.jpackage/share/classes/jdk/jpackage/internal/cli/StandardValidator.java
@@ -36,11 +36,12 @@ import java.nio.file.Path;
 import java.util.Objects;
 import java.util.function.Consumer;
 import java.util.function.Predicate;
+import java.util.regex.Pattern;
 import jdk.jpackage.internal.cli.Validator.ValidatingConsumerException;
 import jdk.jpackage.internal.util.FileUtils;
 import jdk.jpackage.internal.util.MacBundle;
 
-final public class StandardValidator {
+public final class StandardValidator {
 
     private StandardValidator() {
     }
@@ -143,6 +144,9 @@ final public class StandardValidator {
         return MacBundle.fromPath(path).isPresent();
     };
 
+    // https://developer.apple.com/documentation/BundleResources/Information-Property-List/CFBundleIdentifier
+    public static final Predicate<String> IS_VALID_MAC_BUNDLE_IDENTIFIER = Pattern.compile("[\\p{Alnum}-\\.]+").asMatchPredicate();
+
 
     public static final class DirectoryListingIOException extends RuntimeException {
 
diff --git a/src/jdk.jpackage/share/classes/jdk/jpackage/internal/resources/MainResources.properties b/src/jdk.jpackage/share/classes/jdk/jpackage/internal/resources/MainResources.properties
index 02784a52acc..9dfd13d60bb 100644
--- a/src/jdk.jpackage/share/classes/jdk/jpackage/internal/resources/MainResources.properties
+++ b/src/jdk.jpackage/share/classes/jdk/jpackage/internal/resources/MainResources.properties
@@ -88,6 +88,8 @@ error.parameter-not-empty-directory=The value "{0}" provided for parameter {1} i
 error.parameter-not-url=The value "{0}" provided for parameter {1} is not a valid URL
 error.parameter-not-launcher-shortcut-dir=The value "{0}" provided for parameter {1} is not a valid shortcut startup directory
 error.parameter-not-mac-bundle=The value "{0}" provided for parameter {1} is not a valid macOS bundle
+error.parameter-not-mac-bundle-identifier=The value "{0}" provided for parameter {1} is not a valid macOS bundle identifier.
+error.parameter-not-mac-bundle-identifier.advice=Bundle identifier must be a non-empty string containing only alphanumeric characters (A-Z, a-z, and 0-9), hyphens (-), and periods (.)
 error.path-parameter-ioexception=I/O error accessing path value "{0}" of parameter {1}
 error.parameter-add-launcher-malformed=The value "{0}" provided for parameter {1} does not match the pattern <name>=<file path>
 error.parameter-add-launcher-not-file=The value of path to a property file "{0}" provided for additional launcher "{1}" is not a valid file path
diff --git a/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/CannedFormattedString.java b/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/CannedFormattedString.java
index d5248ee2b17..cc31c416d44 100644
--- a/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/CannedFormattedString.java
+++ b/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/CannedFormattedString.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2024, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2024, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -27,6 +27,7 @@ import java.util.List;
 import java.util.Objects;
 import java.util.function.BiFunction;
 import java.util.function.UnaryOperator;
+import java.util.regex.Pattern;
 import java.util.stream.Stream;
 
 public record CannedFormattedString(BiFunction<String, Object[], String> formatter, String key, List<Object> args) implements CannedArgument {
@@ -67,6 +68,23 @@ public record CannedFormattedString(BiFunction<String, Object[], String> formatt
         }
     }
 
+    public interface Spec {
+
+        String format();
+        List<Object> modelArgs();
+
+        default CannedFormattedString asCannedFormattedString(Object ... args) {
+            if (args.length != modelArgs().size()) {
+                throw new IllegalArgumentException();
+            }
+            return JPackageStringBundle.MAIN.cannedFormattedString(format(), args);
+        }
+
+        default Pattern asPattern() {
+            return JPackageStringBundle.MAIN.cannedFormattedStringAsPattern(format(), modelArgs().toArray());
+        }
+    }
+
     private record AddPrefixFormatter(BiFunction<String, Object[], String> formatter) implements BiFunction<String, Object[], String> {
 
         AddPrefixFormatter {
diff --git a/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/JPackageCommand.java b/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/JPackageCommand.java
index 4fad120d0f6..b173d345596 100644
--- a/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/JPackageCommand.java
+++ b/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/JPackageCommand.java
@@ -1078,6 +1078,53 @@ public class JPackageCommand extends CommandArguments<JPackageCommand> {
         return this;
     }
 
+    public JPackageCommand validateOutput(
+            Class<? extends CannedFormattedString.Spec> messageGroup,
+            Consumer<JPackageOutputValidator> validatorMutator,
+            List<CannedFormattedString> expectedMessages) {
+
+        Objects.requireNonNull(validatorMutator);
+
+        if (!messageGroup.isEnum()) {
+            throw new IllegalArgumentException();
+        }
+
+        var messageSpecs = messageGroup.getEnumConstants();
+
+        var expectMessageFormats = expectedMessages.stream().map(CannedFormattedString::key).toList();
+
+        var groupMessageFormats = Stream.of(messageSpecs)
+                .map(CannedFormattedString.Spec::format)
+                .collect(Collectors.toMap(x -> x, x -> x))
+                .keySet();
+
+        if (!groupMessageFormats.containsAll(expectMessageFormats)) {
+            // Expected format strings should be a subset of the group format strings.
+            throw new IllegalArgumentException();
+        }
+
+        if (!expectedMessages.isEmpty()) {
+            new JPackageOutputValidator().expectMatchingStrings(expectedMessages).mutate(validatorMutator).applyTo(this);
+        }
+
+        Stream.of(messageSpecs).filter(spec -> {
+            return !expectMessageFormats.contains(spec.format());
+        }).map(CannedFormattedString.Spec::asPattern).map(pattern -> {
+            return TKit.assertTextStream(pattern).negate();
+        }).forEach(validator -> {
+            new JPackageOutputValidator().add(validator).stdoutAndStderr().applyTo(this);
+        });
+
+        return this;
+    }
+
+    public JPackageCommand validateOutput(
+            Class<? extends CannedFormattedString.Spec> messageGroup,
+            Consumer<JPackageOutputValidator> validatorMutator,
+            CannedFormattedString... expected) {
+        return validateOutput(messageGroup, validatorMutator, List.of(expected));
+    }
+
     public boolean isWithToolProvider() {
         return toolProviderSource.toolProvider().isPresent();
     }
diff --git a/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/JPackageOutputValidator.java b/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/JPackageOutputValidator.java
index ed14f40f65c..8817ca0b730 100644
--- a/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/JPackageOutputValidator.java
+++ b/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/JPackageOutputValidator.java
@@ -140,6 +140,11 @@ public final class JPackageOutputValidator {
         return this;
     }
 
+    public JPackageOutputValidator mutate(Consumer<JPackageOutputValidator> mutator) {
+        mutator.accept(this);
+        return this;
+    }
+
     public void applyTo(JPackageCommand cmd) {
         toResultConsumer(cmd).ifPresent(cmd::validateResult);
     }
diff --git a/test/jdk/tools/jpackage/junit/macosx/jdk.jpackage/jdk/jpackage/internal/MacApplicationBuilderTest.java b/test/jdk/tools/jpackage/junit/macosx/jdk.jpackage/jdk/jpackage/internal/MacApplicationBuilderTest.java
new file mode 100644
index 00000000000..559e8d53827
--- /dev/null
+++ b/test/jdk/tools/jpackage/junit/macosx/jdk.jpackage/jdk/jpackage/internal/MacApplicationBuilderTest.java
@@ -0,0 +1,96 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+package jdk.jpackage.internal;
+
+import static jdk.jpackage.internal.MacPackagingPipeline.APPLICATION_LAYOUT;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertThrowsExactly;
+
+import java.util.List;
+import java.util.Map;
+import java.util.Objects;
+import java.util.Optional;
+import jdk.jpackage.internal.model.ApplicationLaunchers;
+import jdk.jpackage.internal.model.ConfigException;
+import jdk.jpackage.internal.model.Launcher;
+import jdk.jpackage.internal.model.LauncherStartupInfo;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.CsvSource;
+
+class MacApplicationBuilderTest {
+
+    @ParameterizedTest
+    @CsvSource({
+        "NAME,!fo#o,foo",
+        "NAME,bar,bar",
+        "MAIN_LAUNCHER_CLASSNAME,foo.b$ar.Hello,foo.bar",
+        "MAIN_LAUNCHER_CLASSNAME,Hello$2,Hello2",
+        "NAME,!#,",
+    })
+    void testDerivedBundleIdentifier(ApplicationBuilderProperty type, String value, String expectedBundleIdentifier) {
+
+        var builder = buildApplication();
+        var macBuilder = new MacApplicationBuilder(builder);
+
+        type.applyTo(value, builder, macBuilder);
+
+        if (expectedBundleIdentifier != null) {
+            assertEquals(expectedBundleIdentifier, macBuilder.create().bundleIdentifier());
+        } else {
+            var ex = assertThrowsExactly(ConfigException.class, macBuilder::create);
+            assertEquals(I18N.format("error.invalid-derived-bundle-identifier"), ex.getMessage());
+            assertEquals(I18N.format("error.invalid-derived-bundle-identifier.advice"), ex.getAdvice());
+        }
+    }
+
+    private static ApplicationBuilder buildApplication() {
+        return new ApplicationBuilder().appImageLayout(APPLICATION_LAYOUT);
+    }
+
+    enum ApplicationBuilderProperty {
+        NAME {
+            void applyTo(String value, ApplicationBuilder builder, MacApplicationBuilder macBuilder) {
+                builder.name(Objects.requireNonNull(value));
+            }
+        },
+        MAIN_LAUNCHER_CLASSNAME {
+            void applyTo(String value, ApplicationBuilder builder, MacApplicationBuilder macBuilder) {
+                var startupInfo = new LauncherStartupInfo.Stub(Objects.requireNonNull(value), List.of(), List.of(), List.of());
+                var launcher = new Launcher.Stub(
+                        startupInfo.simpleClassName(),
+                        Optional.of(startupInfo),
+                        List.of(),
+                        false,
+                        "",
+                        Optional.empty(),
+                        null,
+                        Map.of());
+                builder.launchers(new ApplicationLaunchers(launcher));
+            }
+        }
+        ;
+
+        abstract void applyTo(String value, ApplicationBuilder builder, MacApplicationBuilder macBuilder);
+    }
+}
diff --git a/test/jdk/tools/jpackage/junit/macosx/junit.java b/test/jdk/tools/jpackage/junit/macosx/junit.java
index 4ab05daf1ae..55d309a5d7c 100644
--- a/test/jdk/tools/jpackage/junit/macosx/junit.java
+++ b/test/jdk/tools/jpackage/junit/macosx/junit.java
@@ -63,3 +63,11 @@
  *    jdk/jpackage/internal/ActiveKeychainListTest.java
  * @run junit jdk.jpackage/jdk.jpackage.internal.ActiveKeychainListTest
  */
+
+/* @test
+ * @summary Test MacApplicationBuilderTest
+ * @requires (os.family == "mac")
+ * @compile/module=jdk.jpackage -Xlint:all -Werror
+ *    jdk/jpackage/internal/MacApplicationBuilderTest.java
+ * @run junit jdk.jpackage/jdk.jpackage.internal.MacApplicationBuilderTest
+ */
diff --git a/test/jdk/tools/jpackage/junit/share/jdk.jpackage/jdk/jpackage/internal/cli/OptionsValidationFailTest.excludes b/test/jdk/tools/jpackage/junit/share/jdk.jpackage/jdk/jpackage/internal/cli/OptionsValidationFailTest.excludes
index 19478aaa4a7..a7a65402b9c 100644
--- a/test/jdk/tools/jpackage/junit/share/jdk.jpackage/jdk/jpackage/internal/cli/OptionsValidationFailTest.excludes
+++ b/test/jdk/tools/jpackage/junit/share/jdk.jpackage/jdk/jpackage/internal/cli/OptionsValidationFailTest.excludes
@@ -18,7 +18,6 @@ ErrorTest.test(IMAGE; args-add=[--module, com.foo.bar, --runtime-image, @@JAVA_H
 ErrorTest.test(IMAGE; args-add=[--module, java.base, --runtime-image, @@JAVA_HOME@@]; errors=[message.error-header+[ERR_NoMainClass]])
 ErrorTest.test(LINUX_DEB; app-desc=Hello; args-add=[--linux-package-name, #]; errors=[message.error-header+[error.deb-invalid-value-for-package-name, #], message.advice-header+[error.deb-invalid-value-for-package-name.advice]])
 ErrorTest.test(LINUX_RPM; app-desc=Hello; args-add=[--linux-package-name, #]; errors=[message.error-header+[error.rpm-invalid-value-for-package-name, #], message.advice-header+[error.rpm-invalid-value-for-package-name.advice]])
-ErrorTest.test(MAC_PKG; app-desc=Hello; args-add=[--mac-package-identifier, #1]; errors=[message.error-header+[message.invalid-identifier, #1], message.advice-header+[message.invalid-identifier.advice]])
 ErrorTest.test(NATIVE; app-desc=Hello; args-add=[--mac-app-store, --runtime-image, @@JAVA_HOME@@]; errors=[message.error-header+[error.invalid-runtime-image-bin-dir, @@JAVA_HOME@@], message.advice-header+[error.invalid-runtime-image-bin-dir.advice, --mac-app-store]])
 ErrorTest.test(NATIVE; app-desc=Hello; args-add=[--runtime-image, @@EMPTY_DIR@@]; errors=[message.error-header+[error.invalid-runtime-image-missing-file, @@EMPTY_DIR@@, lib/**/libjli.dylib]])
 ErrorTest.test(NATIVE; app-desc=Hello; args-add=[--runtime-image, @@INVALID_MAC_RUNTIME_BUNDLE@@]; errors=[message.error-header+[error.invalid-runtime-image-missing-file, @@INVALID_MAC_RUNTIME_BUNDLE@@, Contents/Home/lib/**/libjli.dylib]])
diff --git a/test/jdk/tools/jpackage/junit/share/jdk.jpackage/jdk/jpackage/internal/cli/StandardOptionTest.java b/test/jdk/tools/jpackage/junit/share/jdk.jpackage/jdk/jpackage/internal/cli/StandardOptionTest.java
index 58a78edb627..4d47bced8f1 100644
--- a/test/jdk/tools/jpackage/junit/share/jdk.jpackage/jdk/jpackage/internal/cli/StandardOptionTest.java
+++ b/test/jdk/tools/jpackage/junit/share/jdk.jpackage/jdk/jpackage/internal/cli/StandardOptionTest.java
@@ -58,6 +58,7 @@ import jdk.jpackage.internal.cli.StandardOption.LauncherProperty;
 import jdk.jpackage.internal.model.AppImageBundleType;
 import jdk.jpackage.internal.model.BundleType;
 import jdk.jpackage.internal.model.JPackageException;
+import jdk.jpackage.internal.model.ConfigException;
 import jdk.jpackage.internal.model.LauncherShortcut;
 import jdk.jpackage.internal.model.LauncherShortcutStartupDirectory;
 import jdk.jpackage.internal.util.RootedPath;
@@ -71,6 +72,7 @@ import org.junit.jupiter.api.Test;
 import org.junit.jupiter.api.io.TempDir;
 import org.junit.jupiter.params.ParameterizedTest;
 import org.junit.jupiter.params.provider.Arguments;
+import org.junit.jupiter.params.provider.CsvSource;
 import org.junit.jupiter.params.provider.EnumSource;
 import org.junit.jupiter.params.provider.MethodSource;
 import org.junit.jupiter.params.provider.ValueSource;
@@ -258,6 +260,40 @@ public class StandardOptionTest extends JUnitAdapter.TestSrcInitializer {
         }).toList(), result.errors());
     }
 
+    @ParameterizedTest
+    @ValueSource(strings = {
+        ".",
+        "a-b.c",
+        "A",
+        "com.acme.Foo"
+    })
+    void test_MAC_BUNDLE_IDENTIFIER_valid(String id) {
+
+        var spec = StandardOption.MAC_BUNDLE_IDENTIFIER.getSpec();
+
+        var result = spec.convert(spec.name(), StringToken.of(id)).orElseThrow();
+
+        assertEquals(result, id);
+    }
+
+    @ParameterizedTest
+    @ValueSource(strings = {
+        "",
+        ",",
+        "Hello!"
+    })
+    void test_MAC_BUNDLE_IDENTIFIER_invalid(String id) {
+
+        var spec = StandardOption.MAC_BUNDLE_IDENTIFIER.getSpec();
+
+        var result = spec.convert(spec.name(), StringToken.of(id));
+
+        var ex = assertThrows(ConfigException.class, result::orElseThrow);
+
+        assertEquals(I18N.format("error.parameter-not-mac-bundle-identifier", id, spec.name().formatForCommandLine()), ex.getMessage());
+        assertEquals(I18N.format("error.parameter-not-mac-bundle-identifier.advice"), ex.getAdvice());
+    }
+
     @ParameterizedTest
     @EnumSource(OptionMutatorTest.TestType.class)
     public void test_pathOptionMutator(OptionMutatorTest.TestType type) {
diff --git a/test/jdk/tools/jpackage/macosx/MacPropertiesTest.java b/test/jdk/tools/jpackage/macosx/MacPropertiesTest.java
index 67a5cf6b609..f8638735a6a 100644
--- a/test/jdk/tools/jpackage/macosx/MacPropertiesTest.java
+++ b/test/jdk/tools/jpackage/macosx/MacPropertiesTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2019, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2019, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -21,11 +21,20 @@
  * questions.
  */
 
-import jdk.jpackage.test.TKit;
-import jdk.jpackage.test.MacHelper;
-import jdk.jpackage.test.JPackageCommand;
+import java.util.ArrayList;
+import java.util.Collection;
+import java.util.List;
+import java.util.Objects;
+import java.util.Optional;
+import java.util.function.Consumer;
+import java.util.stream.Collectors;
+import jdk.jpackage.test.Annotations.ParameterSupplier;
 import jdk.jpackage.test.Annotations.Test;
-import jdk.jpackage.test.Annotations.Parameter;
+import jdk.jpackage.test.CannedFormattedString;
+import jdk.jpackage.test.JPackageCommand;
+import jdk.jpackage.test.JPackageOutputValidator;
+import jdk.jpackage.test.MacHelper;
+import jdk.jpackage.test.TKit;
 
 
 /**
@@ -43,30 +52,198 @@ import jdk.jpackage.test.Annotations.Parameter;
  *  --jpt-run=MacPropertiesTest
  */
 public class MacPropertiesTest {
-    @Test
-    @Parameter("MacPackageNameTest")
-    public void testPackageName(String packageName) {
-        testParameterInAppImage("--mac-package-name", "CFBundleName",
-                packageName);
-    }
 
     @Test
-    @Parameter("Foo")
-    public void testPackageIdetifier(String packageId) {
-        testParameterInAppImage("--mac-package-identifier", "CFBundleIdentifier",
-                packageId);
+    @ParameterSupplier
+    public void test(TestSpec spec) {
+        spec.run();
     }
 
-    private static void testParameterInAppImage(String jpackageParameterName,
-            String plistKeyName, String value) {
-        JPackageCommand cmd = JPackageCommand.helloAppImage()
-                .addArguments(jpackageParameterName, value);
+    public static Collection<Object[]> test() {
 
-        cmd.executeAndAssertHelloAppImageCreated();
+        var testCases = new ArrayList<TestSpec.Builder>();
 
-        var plist = MacHelper.readPListFromAppImage(cmd.outputBundle());
+        testCases.addAll(List.of(
+                TestSpec.build("CFBundleName").addArgs("--mac-package-name", "MacPackageNameTest").expect("MacPackageNameTest"),
+                TestSpec.build("CFBundleIdentifier").addArgs("--mac-package-identifier", "Foo").expect("Foo"),
+                // Should derive from the input data.
+                TestSpec.build("CFBundleIdentifier").appDesc("com.acme.Hello").expect("com.acme").expect(BundleIdentifierMessage.VALUE.asCannedFormattedString("com.acme"))
+        ));
 
-        TKit.assertEquals(value, plist.queryValue(plistKeyName), String.format(
-                "Check value of %s plist key", plistKeyName));
+        return testCases.stream().map(TestSpec.Builder::create).map(v -> {
+            return new Object[] {v};
+        }).toList();
+    }
+
+    enum BundleIdentifierMessage implements CannedFormattedString.Spec {
+        VALUE("message.derived-bundle-identifier", "bundle-id"),
+        ;
+
+        BundleIdentifierMessage(String key, Object ... args) {
+            this.key = Objects.requireNonNull(key);
+            this.args = List.of(args);
+        }
+
+        @Override
+        public String format() {
+            return key;
+        }
+
+        @Override
+        public List<Object> modelArgs() {
+            return args;
+        }
+
+        private final String key;
+        private final List<Object> args;
+    }
+
+    record TestSpec(
+            Optional<String> appDesc,
+            List<String> addArgs,
+            List<String> delArgs,
+            List<CannedFormattedString> expectedTraceMessages,
+            String expectedInfoPlistKeyValue,
+            String infoPlistKey,
+            Optional<Class<? extends CannedFormattedString.Spec>> traceMessagesClass) {
+
+        TestSpec {
+            Objects.requireNonNull(addArgs);
+            Objects.requireNonNull(delArgs);
+            Objects.requireNonNull(expectedTraceMessages);
+            Objects.requireNonNull(expectedInfoPlistKeyValue);
+            Objects.requireNonNull(infoPlistKey);
+            Objects.requireNonNull(traceMessagesClass);
+        }
+
+        void run() {
+            var cmd = appDesc.map(JPackageCommand::helloAppImage).orElseGet(JPackageCommand::helloAppImage)
+                    .setFakeRuntime().addArguments(addArgs);
+
+            delArgs.forEach(cmd::removeArgumentWithValue);
+
+            Consumer<JPackageOutputValidator> validatorMutator = validator -> {
+                validator.matchTimestamps().stripTimestamps();
+            };
+
+            traceMessagesClass.ifPresentOrElse(v -> {
+                cmd.validateOutput(v, validatorMutator, expectedTraceMessages);
+            }, () -> {
+                new JPackageOutputValidator()
+                        .mutate(validatorMutator)
+                        .expectMatchingStrings(expectedTraceMessages)
+                        .applyTo(cmd);
+            });
+
+            cmd.executeAndAssertHelloAppImageCreated();
+
+            var plist = MacHelper.readPListFromAppImage(cmd.outputBundle());
+
+            TKit.assertEquals(
+                    expectedInfoPlistKeyValue,
+                    plist.queryValue(infoPlistKey),
+                    String.format("Check value of %s plist key", infoPlistKey));
+        }
+
+        @Override
+        public String toString() {
+            var tokens = new ArrayList<String>();
+
+            tokens.add(String.format("%s=>%s", infoPlistKey, expectedInfoPlistKeyValue));
+
+            appDesc.ifPresent(v -> {
+                tokens.add("app-desc=" + v);
+            });
+
+            if (!addArgs.isEmpty()) {
+                tokens.add("args-add=" + addArgs);
+            }
+
+            if (!delArgs.isEmpty()) {
+                tokens.add("args-del=" + delArgs);
+            }
+
+            if (!expectedTraceMessages.isEmpty()) {
+                tokens.add("expect=" + expectedTraceMessages);
+            }
+
+            return tokens.stream().collect(Collectors.joining("; "));
+        }
+
+        static Builder build() {
+            return new Builder();
+        }
+
+        static Builder build(String infoPlistKey) {
+            return build().infoPlistKey(Objects.requireNonNull(infoPlistKey));
+        }
+
+        static final class Builder {
+
+            TestSpec create() {
+
+                Class<? extends CannedFormattedString.Spec> traceMessagesClass = switch (Objects.requireNonNull(infoPlistKey)) {
+                    case "CFBundleIdentifier" -> BundleIdentifierMessage.class;
+                    case "CFBundleName" -> null;
+                    default -> {
+                        throw new IllegalStateException();
+                    }
+                };
+
+                return new TestSpec(
+                        Optional.ofNullable(appDesc),
+                        addArgs,
+                        delArgs,
+                        expectedTraceMessages,
+                        expectedInfoPlistKeyValue,
+                        infoPlistKey,
+                        Optional.ofNullable(traceMessagesClass));
+            }
+
+            Builder appDesc(String v) {
+                appDesc = v;
+                return this;
+            }
+
+            Builder addArgs(List<String> v) {
+                addArgs.addAll(v);
+                return this;
+            }
+
+            Builder addArgs(String... args) {
+                return addArgs(List.of(args));
+            }
+
+            Builder delArgs(List<String> v) {
+                delArgs.addAll(v);
+                return this;
+            }
+
+            Builder delArgs(String... args) {
+                return delArgs(List.of(args));
+            }
+
+            Builder expect(CannedFormattedString traceMessage) {
+                expectedTraceMessages.add(traceMessage);
+                return this;
+            }
+
+            Builder expect(String v) {
+                expectedInfoPlistKeyValue = v;
+                return this;
+            }
+
+            Builder infoPlistKey(String v) {
+                infoPlistKey = v;
+                return this;
+            }
+
+            private String appDesc;
+            private final List<String> addArgs = new ArrayList<>();
+            private final List<String> delArgs = new ArrayList<>();
+            private final List<CannedFormattedString> expectedTraceMessages = new ArrayList<>();
+            private String expectedInfoPlistKeyValue;
+            private String infoPlistKey;
+        }
     }
 }
diff --git a/test/jdk/tools/jpackage/share/AppVersionTest.java b/test/jdk/tools/jpackage/share/AppVersionTest.java
index 7ba1870def1..598ee1551b3 100644
--- a/test/jdk/tools/jpackage/share/AppVersionTest.java
+++ b/test/jdk/tools/jpackage/share/AppVersionTest.java
@@ -46,7 +46,6 @@ import java.util.Optional;
 import java.util.Set;
 import java.util.function.Consumer;
 import java.util.function.Predicate;
-import java.util.stream.Stream;
 import jdk.internal.util.OperatingSystem;
 import jdk.jpackage.internal.util.MacBundle;
 import jdk.jpackage.internal.util.RuntimeReleaseFile;
@@ -58,8 +57,6 @@ import jdk.jpackage.test.CannedFormattedString;
 import jdk.jpackage.test.ConfigurationTarget;
 import jdk.jpackage.test.JPackageCommand;
 import jdk.jpackage.test.JPackageCommand.StandardAssert;
-import jdk.jpackage.test.JPackageOutputValidator;
-import jdk.jpackage.test.JPackageStringBundle;
 import jdk.jpackage.test.JavaAppDesc;
 import jdk.jpackage.test.MacHelper;
 import jdk.jpackage.test.PackageTest;
@@ -270,7 +267,7 @@ public final class AppVersionTest {
         }).toList();
     }
 
-    enum Message {
+    enum Message implements CannedFormattedString.Spec {
         VERSION_FROM_MODULE("message.module-version", "version", "module"),
         VERSION_FROM_RELEASE_FILE("message.release-version", "version"),
         VERSION_NORMALIZED("message.version-normalized", "version", "version"),
@@ -278,24 +275,21 @@ public final class AppVersionTest {
 
         Message(String key, Object ... args) {
             this.key = Objects.requireNonNull(key);
-            this.args = args;
+            this.args = List.of(args);
         }
 
-        CannedFormattedString cannedFormattedString(Object ... args) {
-            return JPackageStringBundle.MAIN.cannedFormattedString(key, args);
-        }
-
-        TKit.TextStreamVerifier negateFind() {
-            var pattern = JPackageStringBundle.MAIN.cannedFormattedStringAsPattern(key, args);
-            return TKit.assertTextStream(pattern).negate();
-        }
-
-        String key() {
+        @Override
+        public String format() {
             return key;
         }
 
+        @Override
+        public List<Object> modelArgs() {
+            return args;
+        }
+
         private final String key;
-        private final Object[] args;
+        private final List<Object> args;
     }
 
     sealed interface VersionSource {
@@ -389,16 +383,9 @@ public final class AppVersionTest {
         }
 
         void applyTo(JPackageCommand cmd) {
-            Objects.requireNonNull(cmd);
-            new JPackageOutputValidator().expectMatchingStrings(messages).matchTimestamps().stripTimestamps().applyTo(cmd);
-            cmd.version(version);
-
-            var expectMessageKeys = messages.stream().map(CannedFormattedString::key).toList();
-            Stream.of(Message.values()).filter(message -> {
-                return !expectMessageKeys.contains(message.key());
-            }).map(Message::negateFind).forEach(validator -> {
-                new JPackageOutputValidator().add(validator).stdoutAndStderr().applyTo(cmd);
-            });
+            cmd.version(version).validateOutput(Message.class, validator -> {
+                validator.matchTimestamps().stripTimestamps();
+            }, messages);
         }
 
         @Override
@@ -436,7 +423,7 @@ public final class AppVersionTest {
             }
 
             Builder message(Message message, Object ... args) {
-                return messages(message.cannedFormattedString(args));
+                return messages(message.asCannedFormattedString(args));
             }
 
             private String version;
diff --git a/test/jdk/tools/jpackage/share/ErrorTest.java b/test/jdk/tools/jpackage/share/ErrorTest.java
index fbaec8283e8..ed5865024fa 100644
--- a/test/jdk/tools/jpackage/share/ErrorTest.java
+++ b/test/jdk/tools/jpackage/share/ErrorTest.java
@@ -1015,8 +1015,8 @@ public final class ErrorTest {
                 testSpec().noAppDesc().addArgs("--app-image", Token.APP_IMAGE.token())
                         .error("error.app-image.mac-sign.required"),
                 testSpec().type(PackageType.MAC_PKG).addArgs("--mac-package-identifier", "#1")
-                        .error("message.invalid-identifier", "#1")
-                        .advice("message.invalid-identifier.advice"),
+                        .error("error.parameter-not-mac-bundle-identifier", "#1", "--mac-package-identifier")
+                        .advice("error.parameter-not-mac-bundle-identifier.advice"),
                 // Bundle for mac app store should not have runtime commands
                 testSpec().nativeType().addArgs("--mac-app-store", "--jlink-options", "--bind-services")
                         .error("ERR_MissingJLinkOptMacAppStore", "--strip-native-commands"),

From ec8bcf72c82b4c7a6a3e6098d4f48a0fe6522e78 Mon Sep 17 00:00:00 2001
From: Vladimir Petko <vpetko@openjdk.org>
Date: Wed, 25 Mar 2026 04:58:48 +0000
Subject: [PATCH 334/655] 8352567: [s390x] ProblemList JFR tests requiring JFR
 stubs

Reviewed-by: amitkumar, aph
---
 test/hotspot/jtreg/ProblemList.txt |  2 ++
 test/jdk/ProblemList.txt           | 18 ++++++++++++++++++
 2 files changed, 20 insertions(+)

diff --git a/test/hotspot/jtreg/ProblemList.txt b/test/hotspot/jtreg/ProblemList.txt
index dec9682f0cf..3b871d9f4b6 100644
--- a/test/hotspot/jtreg/ProblemList.txt
+++ b/test/hotspot/jtreg/ProblemList.txt
@@ -78,6 +78,7 @@ compiler/floatingpoint/TestSubnormalDouble.java 8317810 generic-i586
 compiler/codecache/CodeCacheFullCountTest.java 8332954 generic-all
 
 compiler/interpreter/Test6833129.java 8335266 generic-i586
+compiler/intrinsics/TestReturnOopSetForJFRWriteCheckpoint.java 8286300 linux-s390x
 
 compiler/c2/aarch64/TestStaticCallStub.java 8359963 linux-aarch64,macosx-aarch64
 
@@ -113,6 +114,7 @@ runtime/StackGuardPages/TestStackGuardPagesNative.java 8303612 linux-all
 runtime/ErrorHandling/MachCodeFramesInErrorFile.java 8313315 linux-ppc64le
 runtime/NMT/VirtualAllocCommitMerge.java 8309698 linux-s390x
 
+applications/ctw/modules/jdk_jfr.java 8286300 linux-s390x
 applications/jcstress/copy.java 8229852 linux-all
 
 containers/docker/TestJFREvents.java 8327723 linux-x64
diff --git a/test/jdk/ProblemList.txt b/test/jdk/ProblemList.txt
index 38ffe2ae963..f1bd91d86aa 100644
--- a/test/jdk/ProblemList.txt
+++ b/test/jdk/ProblemList.txt
@@ -713,6 +713,24 @@ jdk/incubator/vector/LoadJsvmlTest.java                         8305390 windows-
 
 # jdk_jfr
 
+jdk/jfr/api/consumer/TestRecordingFileWrite.java                8286300 linux-s390x
+jdk/jfr/api/consumer/streaming/TestCrossProcessStreaming.java   8286300 linux-s390x
+jdk/jfr/api/consumer/streaming/TestFilledChunks.java            8286300 linux-s390x
+jdk/jfr/api/consumer/streaming/TestRemovedChunks.java           8286300 linux-s390x
+jdk/jfr/api/recording/misc/TestGetStreamWithFailure.java        8286300 linux-s390x
+jdk/jfr/api/settings/TestSettingControl.java                    8286300 linux-s390x
+jdk/jfr/event/runtime/TestBackToBackSensitive.java              8286300 linux-s390x
+jdk/jfr/event/runtime/TestSyncOnValueBasedClassEvent.java       8286300 linux-s390x
+jdk/jfr/event/tracing/TestMultipleThreads.java                  8286300 linux-s390x
+jdk/jfr/event/tracing/TestTracedString.java                     8286300 linux-s390x
+jdk/jfr/javaagent/TestLoadedAgent.java                          8286300 linux-s390x
+jdk/jfr/javaagent/TestPremainAgent.java                         8286300 linux-s390x
+jdk/jfr/jmx/streaming/TestClose.java                            8286300 linux-s390x
+jdk/jfr/jmx/streaming/TestMaxSize.java                          8286300 linux-s390x
+jdk/jfr/jvm/TestChunkIntegrity.java                             8286300 linux-s390x
+jdk/jfr/jvm/TestJFRIntrinsic.java                               8286300 linux-s390x
+jdk/jfr/tool/TestDisassemble.java                               8286300 linux-s390x
+jdk/jfr/tool/TestScrub.java                                     8286300 linux-s390x
 jdk/jfr/event/compiler/TestCodeSweeper.java                     8338127 generic-all
 jdk/jfr/event/oldobject/TestShenandoah.java                     8342951 generic-all
 jdk/jfr/event/runtime/TestResidentSetSizeEvent.java             8309846 aix-ppc64

From 51ea257460cc999468c7799afb76fb8cebaff80c Mon Sep 17 00:00:00 2001
From: Fredrik Bredberg <fbredberg@openjdk.org>
Date: Wed, 25 Mar 2026 06:53:14 +0000
Subject: [PATCH 335/655] 8379782: Implement Object Monitor Table enabled by
 default

Reviewed-by: stefank, coleenp, aartemov
---
 src/hotspot/share/runtime/globals.hpp | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/src/hotspot/share/runtime/globals.hpp b/src/hotspot/share/runtime/globals.hpp
index 17e10e2f87c..60feddde09b 100644
--- a/src/hotspot/share/runtime/globals.hpp
+++ b/src/hotspot/share/runtime/globals.hpp
@@ -1929,7 +1929,7 @@ const int ObjectAlignmentInBytes = 8;
              "Mark all threads after a safepoint, and clear on a modify "   \
              "fence. Add cleanliness checks.")                              \
                                                                             \
-  product(bool, UseObjectMonitorTable, false, DIAGNOSTIC,                   \
+  product(bool, UseObjectMonitorTable, true, DIAGNOSTIC,                    \
           "Use a table to record inflated monitors rather than the first "  \
           "word of the object.")                                            \
                                                                             \

From 0c60c9ca1477a114a9c7095226d3a1e5d31600fb Mon Sep 17 00:00:00 2001
From: Jean-Philippe Bempel <jpbempel@openjdk.org>
Date: Wed, 25 Mar 2026 06:56:41 +0000
Subject: [PATCH 336/655] 8376185: NoSuchFieldError thrown after a record with
 type annotation retransformed

Reviewed-by: sspitsyn, dholmes
---
 .../share/prims/jvmtiRedefineClasses.cpp      |   4 +-
 .../RetransformRecordTypeAnn/MyRecord.java    |  47 ++
 .../TestRetransformRecord.java                |  94 ++++
 .../altered/MyRecord.jcod                     | 421 ++++++++++++++++++
 test/lib/RedefineClassHelper.java             |   2 +-
 5 files changed, 566 insertions(+), 2 deletions(-)
 create mode 100644 test/jdk/java/lang/instrument/RetransformRecordTypeAnn/MyRecord.java
 create mode 100644 test/jdk/java/lang/instrument/RetransformRecordTypeAnn/TestRetransformRecord.java
 create mode 100644 test/jdk/java/lang/instrument/RetransformRecordTypeAnn/altered/MyRecord.jcod

diff --git a/src/hotspot/share/prims/jvmtiRedefineClasses.cpp b/src/hotspot/share/prims/jvmtiRedefineClasses.cpp
index 13b239b4df0..c594cfc6816 100644
--- a/src/hotspot/share/prims/jvmtiRedefineClasses.cpp
+++ b/src/hotspot/share/prims/jvmtiRedefineClasses.cpp
@@ -1481,6 +1481,8 @@ jvmtiError VM_RedefineClasses::load_new_class_versions() {
       } else {
         return JVMTI_ERROR_INTERNAL;
       }
+    } else if (res != JVMTI_ERROR_NONE) {
+      return res;
     }
 
 #ifdef ASSERT
@@ -2045,7 +2047,7 @@ bool VM_RedefineClasses::rewrite_cp_refs_in_record_attribute(InstanceKlass* scra
       AnnotationArray* type_annotations = component->type_annotations();
       if (type_annotations != nullptr && type_annotations->length() != 0) {
         int byte_i = 0;  // byte index into annotations
-        if (!rewrite_cp_refs_in_annotations_typeArray(type_annotations, byte_i)) {
+        if (!rewrite_cp_refs_in_type_annotations_typeArray(type_annotations, byte_i, "record_info")) {
           log_debug(redefine, class, annotation)("bad record_component_type_annotations at %d", i);
           // propagate failure back to caller
           return false;
diff --git a/test/jdk/java/lang/instrument/RetransformRecordTypeAnn/MyRecord.java b/test/jdk/java/lang/instrument/RetransformRecordTypeAnn/MyRecord.java
new file mode 100644
index 00000000000..e0f4ecc50f5
--- /dev/null
+++ b/test/jdk/java/lang/instrument/RetransformRecordTypeAnn/MyRecord.java
@@ -0,0 +1,47 @@
+/*
+ * Copyright (c) 2026, Datadog, Inc. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+import java.lang.annotation.ElementType;
+import java.lang.annotation.Retention;
+import java.lang.annotation.RetentionPolicy;
+import java.lang.annotation.Target;
+
+@MyTypeAnnotation
+public record MyRecord(@MyTypeUseAnnotation String filter) {
+    public static MyRecord parse(String param) {
+        if (param == null) {
+            throw new IllegalArgumentException("Filter cannot be null");
+        }
+        return new MyRecord(param);
+    }
+}
+
+@Target({ElementType.TYPE})
+@Retention(RetentionPolicy.RUNTIME)
+@interface MyTypeAnnotation {
+}
+
+@Target({ElementType.TYPE_USE})
+@Retention(RetentionPolicy.RUNTIME)
+@interface MyTypeUseAnnotation {
+}
diff --git a/test/jdk/java/lang/instrument/RetransformRecordTypeAnn/TestRetransformRecord.java b/test/jdk/java/lang/instrument/RetransformRecordTypeAnn/TestRetransformRecord.java
new file mode 100644
index 00000000000..e8f1ba176d1
--- /dev/null
+++ b/test/jdk/java/lang/instrument/RetransformRecordTypeAnn/TestRetransformRecord.java
@@ -0,0 +1,94 @@
+/*
+ * Copyright (c) 2026, Datadog, Inc. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+/*
+ * @test
+ * @bug 8376185
+ * @summary Class retransformation on a record type annotation
+ * @comment This is will rewrite the constant pool and process
+ * @comment the type annotation
+ * @library /test/lib
+ * @modules java.base/jdk.internal.misc
+ * @modules java.compiler
+ *          java.instrument
+ * @compile ../NamedBuffer.java
+ * @compile altered/MyRecord.jcod
+ * @run driver jdk.test.lib.helpers.ClassFileInstaller MyRecord
+ * @compile MyRecord.java
+ * @run main RedefineClassHelper
+ * @run main/othervm -javaagent:redefineagent.jar -Xlog:redefine*=debug TestRetransformRecord
+ */
+
+/*
+ * This test is loading a record with type annotation first, then by
+ * calling retransformClasses, we inject a slightly different record classfile
+ * where just some constants from the constant pools were swapped.
+ * It triggers, during the retransformation, a rewrite of the constant pool
+ * calling VM_RedefineClasses::rewrite_cp_refs_in_record_attribute method.
+ */
+import java.io.File;
+import java.io.FileInputStream;
+import java.lang.instrument.ClassFileTransformer;
+import java.lang.instrument.Instrumentation;
+import java.security.ProtectionDomain;
+
+public class TestRetransformRecord {
+    static final String SRC = System.getProperty("test.src");
+    static final String DEST = System.getProperty("test.classes");
+
+    public static void main(String[] args) throws Exception {
+        MyRecord.parse("foo");
+        File clsfile = new File("MyRecord.class");
+        byte[] buf = null;
+        try (FileInputStream str = new FileInputStream(clsfile)) {
+            buf = NamedBuffer.loadBufferFromStream(str);
+        }
+        Instrumentation inst = RedefineClassHelper.instrumentation;
+        inst.addTransformer(new IdentityTransformer("MyRecord", buf), true);
+        inst.retransformClasses(MyRecord.class);
+        System.out.println(MyRecord.parse("foo"));
+    }
+}
+
+class IdentityTransformer implements ClassFileTransformer {
+    private final String className;
+    private final byte[] buffer;
+
+    public IdentityTransformer(String className, byte[] buffer) {
+        this.className = className;
+        this.buffer = buffer;
+    }
+
+    @Override
+    public byte[] transform(ClassLoader loader,
+                            String classPath,
+                            Class<?> classBeingRedefined,
+                            ProtectionDomain protectionDomain,
+                            byte[] classfileBuffer) {
+        if (classPath != null && classPath.equals(className.replace('.', '/'))) {
+            System.out.println("Transforming " + className);
+            return buffer;
+        }
+        return null;
+    }
+}
diff --git a/test/jdk/java/lang/instrument/RetransformRecordTypeAnn/altered/MyRecord.jcod b/test/jdk/java/lang/instrument/RetransformRecordTypeAnn/altered/MyRecord.jcod
new file mode 100644
index 00000000000..88b4c038a39
--- /dev/null
+++ b/test/jdk/java/lang/instrument/RetransformRecordTypeAnn/altered/MyRecord.jcod
@@ -0,0 +1,421 @@
+/*
+ * Copyright (c) 2026, Datadog, Inc. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+/*
+ * This is a jcod version of the MyRecord classfile. 
+ * Generated from runnning java -jar asmtools.jar jdec MyRecord.class
+ * Then slightly modified to trigger constant pool rewrite.
+ * Here the following modifications:
+ * - constants #10 and #11 were swapped
+ * - constants #14 and #34 were swapped
+ */
+class MyRecord {
+  0xCAFEBABE;
+  0;                                       // minor version
+  69;                                      // version
+  [] {                                     // Constant Pool
+    ;                                      // first element is empty
+    Method #2 #3;                          // #1
+    Class #4;                              // #2
+    NameAndType #5 #6;                     // #3
+    Utf8 "java/lang/Record";               // #4
+    Utf8 "<init>";                         // #5
+    Utf8 "()V";                            // #6
+    Field #8 #9;                           // #7
+    Class #11;                             // #8
+    NameAndType #10 #12;                   // #9
+    Utf8 "filter";                         // #10
+    Utf8 "MyRecord";                       // #11
+    Utf8 "Ljava/lang/String;";             // #12
+    Class #34;                             // #13
+    Utf8 "LMyTypeUseAnnotation;";          // #14
+    String #16;                            // #15
+    Utf8 "Filter cannot be null";          // #16
+    Method #13 #18;                        // #17
+    NameAndType #5 #19;                    // #18
+    Utf8 "(Ljava/lang/String;)V";          // #19
+    Method #8 #18;                         // #20
+    InvokeDynamic 0s #22;                  // #21
+    NameAndType #23 #24;                   // #22
+    Utf8 "toString";                       // #23
+    Utf8 "(LMyRecord;)Ljava/lang/String;";  // #24
+    InvokeDynamic 0s #26;                  // #25
+    NameAndType #27 #28;                   // #26
+    Utf8 "hashCode";                       // #27
+    Utf8 "(LMyRecord;)I";                  // #28
+    InvokeDynamic 0s #30;                  // #29
+    NameAndType #31 #32;                   // #30
+    Utf8 "equals";                         // #31
+    Utf8 "(LMyRecord;Ljava/lang/Object;)Z";  // #32
+    Utf8 "RuntimeVisibleTypeAnnotations";  // #33
+    Utf8 "java/lang/IllegalArgumentException";  // #34
+    Utf8 "Code";                           // #35
+    Utf8 "LineNumberTable";                // #36
+    Utf8 "LocalVariableTable";             // #37
+    Utf8 "this";                           // #38
+    Utf8 "LMyRecord;";                     // #39
+    Utf8 "MethodParameters";               // #40
+    Utf8 "parse";                          // #41
+    Utf8 "(Ljava/lang/String;)LMyRecord;";  // #42
+    Utf8 "param";                          // #43
+    Utf8 "StackMapTable";                  // #44
+    Utf8 "()Ljava/lang/String;";           // #45
+    Utf8 "()I";                            // #46
+    Utf8 "(Ljava/lang/Object;)Z";          // #47
+    Utf8 "o";                              // #48
+    Utf8 "Ljava/lang/Object;";             // #49
+    Utf8 "SourceFile";                     // #50
+    Utf8 "MyRecord.java";                  // #51
+    Utf8 "RuntimeVisibleAnnotations";      // #52
+    Utf8 "LMyTypeAnnotation;";             // #53
+    Utf8 "Record";                         // #54
+    Utf8 "BootstrapMethods";               // #55
+    String #10;                            // #56
+    MethodHandle 1b #7;                    // #57
+    MethodHandle 6b #59;                   // #58
+    Method #60 #61;                        // #59
+    Class #62;                             // #60
+    NameAndType #63 #64;                   // #61
+    Utf8 "java/lang/runtime/ObjectMethods";  // #62
+    Utf8 "bootstrap";                      // #63
+    Utf8 "(Ljava/lang/invoke/MethodHandles$Lookup;Ljava/lang/String;Ljava/lang/invoke/TypeDescriptor;Ljava/lang/Class;Ljava/lang/String;[Ljava/lang/invoke/MethodHandle;)Ljava/lang/Object;";  // #64
+    Utf8 "InnerClasses";                   // #65
+    Class #67;                             // #66
+    Utf8 "java/lang/invoke/MethodHandles$Lookup";  // #67
+    Class #69;                             // #68
+    Utf8 "java/lang/invoke/MethodHandles";  // #69
+    Utf8 "Lookup";                         // #70
+  }
+
+  0x0031;                                  // access
+  #8;                                      // this_cpx
+  #2;                                      // super_cpx
+
+  [] {                                     // Interfaces
+  }                                        // end of Interfaces
+
+  [] {                                     // Fields
+    {                                      // field
+      0x0012;                              // access
+      #10;                                 // name_index
+      #12;                                 // descriptor_index
+      [] {                                 // Attributes
+        Attr(#33) {                        // RuntimeVisibleTypeAnnotations
+          [] {                             // annotations
+            {                              // type_annotation
+              0x13;                        // target_type: FIELD
+              []b {                        // type_paths
+              }
+              #14;
+              [] {                         // element_value_pairs
+              }                            // element_value_pairs
+            }                              // type_annotation
+          }
+        }                                  // end of RuntimeVisibleTypeAnnotations
+      }                                    // end of Attributes
+    }
+  }                                        // end of Fields
+
+  [] {                                     // Methods
+    {                                      // method
+      0x0001;                              // access
+      #5;                                  // name_index
+      #19;                                 // descriptor_index
+      [] {                                 // Attributes
+        Attr(#35) {                        // Code
+          2;                               // max_stack
+          2;                               // max_locals
+          Bytes[]{
+            0x2A 0xB7 0x00 0x01 0x2A 0x2B 0xB5 0x00 0x07 0xB1;
+          }
+          [] {                             // Traps
+          }                                // end of Traps
+          [] {                             // Attributes
+            Attr(#36) {                    // LineNumberTable
+              [] {                         // line_number_table
+                   0    7;
+              }
+            }                              // end of LineNumberTable
+            ;
+            Attr(#37) {                    // LocalVariableTable
+              [] {                         // LocalVariableTable
+                   0   10   38   39   0;
+                   0   10   11   12   1;
+              }
+            }                              // end of LocalVariableTable
+          }                                // end of Attributes
+        }                                  // end of Code
+        ;
+        Attr(#40) {                        // MethodParameters
+          []b {                            // MethodParameters
+            #10  0x0000;
+          }
+        }                                  // end of MethodParameters
+        ;
+        Attr(#33) {                        // RuntimeVisibleTypeAnnotations
+          [] {                             // annotations
+            {                              // type_annotation
+              0x16;                        // target_type: METHOD_FORMAL_PARAMETER
+              0x00;                        // parameter_index
+              []b {                        // type_paths
+              }
+              #14;
+              [] {                         // element_value_pairs
+              }                            // element_value_pairs
+            }                              // type_annotation
+          }
+        }                                  // end of RuntimeVisibleTypeAnnotations
+      }                                    // end of Attributes
+    }
+    ;
+    {                                      // method
+      0x0009;                              // access
+      #41;                                 // name_index
+      #42;                                 // descriptor_index
+      [] {                                 // Attributes
+        Attr(#35) {                        // Code
+          3;                               // max_stack
+          1;                               // max_locals
+          Bytes[]{
+            0x2A 0xC7 0x00 0x0D 0xBB 0x00 0x0D 0x59 0x12 0x0F 0xB7 0x00;
+            0x11 0xBF 0xBB 0x00 0x08 0x59 0x2A 0xB7 0x00 0x14 0xB0;
+          }
+          [] {                             // Traps
+          }                                // end of Traps
+          [] {                             // Attributes
+            Attr(#36) {                    // LineNumberTable
+              [] {                         // line_number_table
+                   0    9;
+                   4   10;
+                  14   12;
+              }
+            }                              // end of LineNumberTable
+            ;
+            Attr(#37) {                    // LocalVariableTable
+              [] {                         // LocalVariableTable
+                   0   23   43   12   0;
+              }
+            }                              // end of LocalVariableTable
+            ;
+            Attr(#44) {                    // StackMapTable
+              [] {                         // 
+                14b;                       // same_frame
+              }
+            }                              // end of StackMapTable
+          }                                // end of Attributes
+        }                                  // end of Code
+      }                                    // end of Attributes
+    }
+    ;
+    {                                      // method
+      0x0011;                              // access
+      #23;                                 // name_index
+      #45;                                 // descriptor_index
+      [] {                                 // Attributes
+        Attr(#35) {                        // Code
+          1;                               // max_stack
+          1;                               // max_locals
+          Bytes[]{
+            0x2A 0xBA 0x00 0x15 0x00 0x00 0xB0;
+          }
+          [] {                             // Traps
+          }                                // end of Traps
+          [] {                             // Attributes
+            Attr(#36) {                    // LineNumberTable
+              [] {                         // line_number_table
+                   0    6;
+              }
+            }                              // end of LineNumberTable
+            ;
+            Attr(#37) {                    // LocalVariableTable
+              [] {                         // LocalVariableTable
+                   0    7   38   39   0;
+              }
+            }                              // end of LocalVariableTable
+          }                                // end of Attributes
+        }                                  // end of Code
+      }                                    // end of Attributes
+    }
+    ;
+    {                                      // method
+      0x0011;                              // access
+      #27;                                 // name_index
+      #46;                                 // descriptor_index
+      [] {                                 // Attributes
+        Attr(#35) {                        // Code
+          1;                               // max_stack
+          1;                               // max_locals
+          Bytes[]{
+            0x2A 0xBA 0x00 0x19 0x00 0x00 0xAC;
+          }
+          [] {                             // Traps
+          }                                // end of Traps
+          [] {                             // Attributes
+            Attr(#36) {                    // LineNumberTable
+              [] {                         // line_number_table
+                   0    6;
+              }
+            }                              // end of LineNumberTable
+            ;
+            Attr(#37) {                    // LocalVariableTable
+              [] {                         // LocalVariableTable
+                   0    7   38   39   0;
+              }
+            }                              // end of LocalVariableTable
+          }                                // end of Attributes
+        }                                  // end of Code
+      }                                    // end of Attributes
+    }
+    ;
+    {                                      // method
+      0x0011;                              // access
+      #31;                                 // name_index
+      #47;                                 // descriptor_index
+      [] {                                 // Attributes
+        Attr(#35) {                        // Code
+          2;                               // max_stack
+          2;                               // max_locals
+          Bytes[]{
+            0x2A 0x2B 0xBA 0x00 0x1D 0x00 0x00 0xAC          }
+          [] {                             // Traps
+          }                                // end of Traps
+          [] {                             // Attributes
+            Attr(#36) {                    // LineNumberTable
+              [] {                         // line_number_table
+                   0    6;
+              }
+            }                              // end of LineNumberTable
+            ;
+            Attr(#37) {                    // LocalVariableTable
+              [] {                         // LocalVariableTable
+                   0    8   38   39   0;
+                   0    8   48   49   1;
+              }
+            }                              // end of LocalVariableTable
+          }                                // end of Attributes
+        }                                  // end of Code
+      }                                    // end of Attributes
+    }
+    ;
+    {                                      // method
+      0x0001;                              // access
+      #10;                                 // name_index
+      #45;                                 // descriptor_index
+      [] {                                 // Attributes
+        Attr(#35) {                        // Code
+          1;                               // max_stack
+          1;                               // max_locals
+          Bytes[]{
+            0x2A 0xB4 0x00 0x07 0xB0;
+          }
+          [] {                             // Traps
+          }                                // end of Traps
+          [] {                             // Attributes
+            Attr(#36) {                    // LineNumberTable
+              [] {                         // line_number_table
+                   0    6;
+              }
+            }                              // end of LineNumberTable
+            ;
+            Attr(#37) {                    // LocalVariableTable
+              [] {                         // LocalVariableTable
+                   0    5   38   39   0;
+              }
+            }                              // end of LocalVariableTable
+          }                                // end of Attributes
+        }                                  // end of Code
+        ;
+        Attr(#33) {                        // RuntimeVisibleTypeAnnotations
+          [] {                             // annotations
+            {                              // type_annotation
+              0x14;                        // target_type: METHOD_RETURN
+              []b {                        // type_paths
+              }
+              #14;
+              [] {                         // element_value_pairs
+              }                            // element_value_pairs
+            }                              // type_annotation
+          }
+        }                                  // end of RuntimeVisibleTypeAnnotations
+      }                                    // end of Attributes
+    }
+  }                                        // end of Methods
+
+  [] {                                     // Attributes
+    Attr(#50) {                            // SourceFile
+      #51;
+    }                                      // end of SourceFile
+    ;
+    Attr(#52) {                            // RuntimeVisibleAnnotations
+      [] {                                 // annotations
+        {                                  // annotation
+          #53;
+          [] {                             // element_value_pairs
+          }                                // element_value_pairs
+        }                                  // annotation
+      }
+    }                                      // end of RuntimeVisibleAnnotations
+    ;
+    Attr(#54) {                            // Record
+      [] {                                 // components
+        {                                  // component
+          #10;                             // name_index
+          #12;                             // descriptor_index
+          [] {                             // Attributes
+            Attr(#33) {                    // RuntimeVisibleTypeAnnotations
+              [] {                         // annotations
+                {                          // type_annotation
+                  0x13;                    // target_type: FIELD
+                  []b {                    // type_paths
+                  }
+                  #14;
+                  [] {                     // element_value_pairs
+                  }                        // element_value_pairs
+                }                          // type_annotation
+              }
+            }                              // end of RuntimeVisibleTypeAnnotations
+          }                                // end of Attributes
+        }
+      }
+    }                                      // end of Record
+    ;
+    Attr(#55) {                            // BootstrapMethods
+      [] {                                 // bootstrap_methods
+        {                                  // bootstrap_method
+          #58;                             // bootstrap_method_ref
+          [] {                             // bootstrap_arguments
+            #8;
+            #56;
+            #57;
+          }                                // bootstrap_arguments
+        }                                  // bootstrap_method
+      }
+    }                                      // end of BootstrapMethods
+    ;
+    Attr(#65) {                            // InnerClasses
+      [] {                                 // classes
+          #66   #68   #70  25;
+      }
+    }                                      // end of InnerClasses
+  }                                        // end of Attributes
+}
diff --git a/test/lib/RedefineClassHelper.java b/test/lib/RedefineClassHelper.java
index ce27fb33f44..064778b3a2a 100644
--- a/test/lib/RedefineClassHelper.java
+++ b/test/lib/RedefineClassHelper.java
@@ -107,7 +107,7 @@ public class RedefineClassHelper {
      * Main method to be invoked before test to create the redefineagent.jar
      */
     public static void main(String[] args) throws Exception {
-        String manifest = "Premain-Class: RedefineClassHelper\nCan-Redefine-Classes: true\n";
+        String manifest = "Premain-Class: RedefineClassHelper\nCan-Redefine-Classes: true\nCan-Retransform-Classes: true\n";
         ClassFileInstaller.writeJar("redefineagent.jar", ClassFileInstaller.Manifest.fromString(manifest), "RedefineClassHelper");
     }
 }

From 0423483bfdd20e22751edc3b5e5d42f2380bad47 Mon Sep 17 00:00:00 2001
From: Albert Mingkun Yang <ayang@openjdk.org>
Date: Wed, 25 Mar 2026 07:03:08 +0000
Subject: [PATCH 337/655] 8380772: Rename _total_allocations to
 _total_allocated_size in ThreadLocalAllocStats

Reviewed-by: stefank, aboldtch, tschatzl
---
 .../gc/shared/threadLocalAllocBuffer.cpp      | 24 +++++++++----------
 .../gc/shared/threadLocalAllocBuffer.hpp      |  6 ++---
 2 files changed, 15 insertions(+), 15 deletions(-)

diff --git a/src/hotspot/share/gc/shared/threadLocalAllocBuffer.cpp b/src/hotspot/share/gc/shared/threadLocalAllocBuffer.cpp
index 4c160929f5a..9d995234736 100644
--- a/src/hotspot/share/gc/shared/threadLocalAllocBuffer.cpp
+++ b/src/hotspot/share/gc/shared/threadLocalAllocBuffer.cpp
@@ -302,7 +302,7 @@ HeapWord* ThreadLocalAllocBuffer::hard_end() {
 PerfVariable* ThreadLocalAllocStats::_perf_allocating_threads;
 PerfVariable* ThreadLocalAllocStats::_perf_total_refills;
 PerfVariable* ThreadLocalAllocStats::_perf_max_refills;
-PerfVariable* ThreadLocalAllocStats::_perf_total_allocations;
+PerfVariable* ThreadLocalAllocStats::_perf_total_allocated_size;
 PerfVariable* ThreadLocalAllocStats::_perf_total_gc_waste;
 PerfVariable* ThreadLocalAllocStats::_perf_max_gc_waste;
 PerfVariable* ThreadLocalAllocStats::_perf_total_refill_waste;
@@ -325,7 +325,7 @@ void ThreadLocalAllocStats::initialize() {
     _perf_allocating_threads      = create_perf_variable("allocThreads",   PerfData::U_None,  CHECK);
     _perf_total_refills           = create_perf_variable("fills",          PerfData::U_None,  CHECK);
     _perf_max_refills             = create_perf_variable("maxFills",       PerfData::U_None,  CHECK);
-    _perf_total_allocations       = create_perf_variable("alloc",          PerfData::U_Bytes, CHECK);
+    _perf_total_allocated_size    = create_perf_variable("alloc",          PerfData::U_Bytes, CHECK);
     _perf_total_gc_waste          = create_perf_variable("gcWaste",        PerfData::U_Bytes, CHECK);
     _perf_max_gc_waste            = create_perf_variable("maxGcWaste",     PerfData::U_Bytes, CHECK);
     _perf_total_refill_waste      = create_perf_variable("refillWaste",    PerfData::U_Bytes, CHECK);
@@ -339,7 +339,7 @@ ThreadLocalAllocStats::ThreadLocalAllocStats() :
     _allocating_threads(0),
     _total_refills(0),
     _max_refills(0),
-    _total_allocations(0),
+    _total_allocated_size(0),
     _total_gc_waste(0),
     _max_gc_waste(0),
     _total_refill_waste(0),
@@ -352,13 +352,13 @@ unsigned int ThreadLocalAllocStats::allocating_threads_avg() {
 }
 
 void ThreadLocalAllocStats::update_fast_allocations(unsigned int refills,
-                                       size_t allocations,
-                                       size_t gc_waste,
-                                       size_t refill_waste) {
+                                                    size_t allocated_size,
+                                                    size_t gc_waste,
+                                                    size_t refill_waste) {
   _allocating_threads      += 1;
   _total_refills           += refills;
   _max_refills              = MAX2(_max_refills, refills);
-  _total_allocations       += allocations;
+  _total_allocated_size    += allocated_size;
   _total_gc_waste          += gc_waste;
   _max_gc_waste             = MAX2(_max_gc_waste, gc_waste);
   _total_refill_waste      += refill_waste;
@@ -374,7 +374,7 @@ void ThreadLocalAllocStats::update(const ThreadLocalAllocStats& other) {
   _allocating_threads      += other._allocating_threads;
   _total_refills           += other._total_refills;
   _max_refills              = MAX2(_max_refills, other._max_refills);
-  _total_allocations       += other._total_allocations;
+  _total_allocated_size    += other._total_allocated_size;
   _total_gc_waste          += other._total_gc_waste;
   _max_gc_waste             = MAX2(_max_gc_waste, other._max_gc_waste);
   _total_refill_waste      += other._total_refill_waste;
@@ -387,7 +387,7 @@ void ThreadLocalAllocStats::reset() {
   _allocating_threads      = 0;
   _total_refills           = 0;
   _max_refills             = 0;
-  _total_allocations       = 0;
+  _total_allocated_size    = 0;
   _total_gc_waste          = 0;
   _max_gc_waste            = 0;
   _total_refill_waste      = 0;
@@ -397,14 +397,14 @@ void ThreadLocalAllocStats::reset() {
 }
 
 void ThreadLocalAllocStats::publish() {
-  if (_total_allocations == 0) {
+  if (_total_allocated_size == 0) {
     return;
   }
 
   _allocating_threads_avg.sample(_allocating_threads);
 
   const size_t waste = _total_gc_waste + _total_refill_waste;
-  const double waste_percent = percent_of(waste, _total_allocations);
+  const double waste_percent = percent_of(waste, _total_allocated_size);
   log_debug(gc, tlab)("TLAB totals: thrds: %d  refills: %d max: %d"
                       " slow allocs: %d max %d waste: %4.1f%%"
                       " gc: %zuB max: %zuB"
@@ -418,7 +418,7 @@ void ThreadLocalAllocStats::publish() {
     _perf_allocating_threads      ->set_value(_allocating_threads);
     _perf_total_refills           ->set_value(_total_refills);
     _perf_max_refills             ->set_value(_max_refills);
-    _perf_total_allocations       ->set_value(_total_allocations);
+    _perf_total_allocated_size    ->set_value(_total_allocated_size);
     _perf_total_gc_waste          ->set_value(_total_gc_waste);
     _perf_max_gc_waste            ->set_value(_max_gc_waste);
     _perf_total_refill_waste      ->set_value(_total_refill_waste);
diff --git a/src/hotspot/share/gc/shared/threadLocalAllocBuffer.hpp b/src/hotspot/share/gc/shared/threadLocalAllocBuffer.hpp
index eb664d13961..8c99523557e 100644
--- a/src/hotspot/share/gc/shared/threadLocalAllocBuffer.hpp
+++ b/src/hotspot/share/gc/shared/threadLocalAllocBuffer.hpp
@@ -182,7 +182,7 @@ private:
   static PerfVariable* _perf_allocating_threads;
   static PerfVariable* _perf_total_refills;
   static PerfVariable* _perf_max_refills;
-  static PerfVariable* _perf_total_allocations;
+  static PerfVariable* _perf_total_allocated_size;
   static PerfVariable* _perf_total_gc_waste;
   static PerfVariable* _perf_max_gc_waste;
   static PerfVariable* _perf_total_refill_waste;
@@ -195,7 +195,7 @@ private:
   unsigned int _allocating_threads;
   unsigned int _total_refills;
   unsigned int _max_refills;
-  size_t       _total_allocations;
+  size_t       _total_allocated_size;
   size_t       _total_gc_waste;
   size_t       _max_gc_waste;
   size_t       _total_refill_waste;
@@ -210,7 +210,7 @@ public:
   ThreadLocalAllocStats();
 
   void update_fast_allocations(unsigned int refills,
-                               size_t allocations,
+                               size_t allocated_size,
                                size_t gc_waste,
                                size_t refill_waste);
   void update_slow_allocations(unsigned int allocations);

From 3bf5022bc6b8bbc544502b3fc100c6debdb1b2c7 Mon Sep 17 00:00:00 2001
From: Alan Bateman <alanb@openjdk.org>
Date: Wed, 25 Mar 2026 07:40:26 +0000
Subject: [PATCH 338/655] 8380641: Thread dump parsing and test improvements
 8378946: threadDump.schema.json syntax error, missing comma after owner

Reviewed-by: amenkov, sspitsyn
---
 .../doc-files/threadDump.schema.json          |   2 +-
 .../HotSpotDiagnosticMXBean/DumpThreads.java  |  84 +++++---
 .../security/provider/acvp/ML_DSA_Test.java   |  10 +-
 test/lib/jdk/test/lib/json/JSONValue.java     |  94 +++++++--
 .../jdk/test/lib/threaddump/ThreadDump.java   | 193 +++++++++---------
 5 files changed, 240 insertions(+), 143 deletions(-)

diff --git a/src/jdk.management/share/classes/com/sun/management/doc-files/threadDump.schema.json b/src/jdk.management/share/classes/com/sun/management/doc-files/threadDump.schema.json
index bf52bb3915d..1da3e3941ef 100644
--- a/src/jdk.management/share/classes/com/sun/management/doc-files/threadDump.schema.json
+++ b/src/jdk.management/share/classes/com/sun/management/doc-files/threadDump.schema.json
@@ -81,7 +81,7 @@
                           "owner": {
                             "type": "string",
                             "description": "The thread identifier of the owner when the parkBlocker is an AbstractOwnableSynchronizer."
-                          }
+                          },
                           "required": [
                             "object"
                           ]
diff --git a/test/jdk/com/sun/management/HotSpotDiagnosticMXBean/DumpThreads.java b/test/jdk/com/sun/management/HotSpotDiagnosticMXBean/DumpThreads.java
index 77020491c29..3878513d3f2 100644
--- a/test/jdk/com/sun/management/HotSpotDiagnosticMXBean/DumpThreads.java
+++ b/test/jdk/com/sun/management/HotSpotDiagnosticMXBean/DumpThreads.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2021, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2021, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -49,6 +49,7 @@ import java.nio.file.FileAlreadyExistsException;
 import java.nio.file.Path;
 import java.time.ZonedDateTime;
 import java.util.List;
+import java.util.Map;
 import java.util.Objects;
 import java.util.Set;
 import java.util.concurrent.CountDownLatch;
@@ -238,6 +239,7 @@ class DumpThreads {
 
     void testBlockedThread(ThreadFactory factory, boolean pinned) throws Exception {
         var lock = new Object();
+        String lockAsString = Objects.toIdentityString(lock);
         var started = new CountDownLatch(1);
 
         Thread thread = factory.newThread(() -> {
@@ -258,9 +260,7 @@ class DumpThreads {
                 thread.start();
                 started.await();
                 await(thread, Thread.State.BLOCKED);
-
                 long tid = thread.threadId();
-                String lockAsString = Objects.toIdentityString(lock);
 
                 // thread dump in plain text should include thread
                 List<String> lines = dumpThreadsToPlainText();
@@ -308,6 +308,7 @@ class DumpThreads {
 
     void testWaitingThread(ThreadFactory factory, boolean pinned) throws Exception {
         var lock = new Object();
+        String lockAsString = Objects.toIdentityString(lock);
         var started = new CountDownLatch(1);
 
         Thread thread = factory.newThread(() -> {
@@ -331,9 +332,7 @@ class DumpThreads {
             thread.start();
             started.await();
             await(thread, Thread.State.WAITING);
-
             long tid = thread.threadId();
-            String lockAsString = Objects.toIdentityString(lock);
 
             // thread dump in plain text should include thread
             List<String> lines = dumpThreadsToPlainText();
@@ -417,7 +416,6 @@ class DumpThreads {
             thread.start();
             started.await();
             await(thread, Thread.State.WAITING);
-
             long tid = thread.threadId();
 
             // thread dump in plain text should include thread
@@ -460,7 +458,7 @@ class DumpThreads {
     }
 
     /**
-     * Test thread dump with a thread owning a monitor.
+     * Test thread dump with a thread owning monitors.
      */
     @ParameterizedTest
     @MethodSource("threadFactories")
@@ -475,19 +473,26 @@ class DumpThreads {
     }
 
     void testThreadOwnsMonitor(ThreadFactory factory, boolean pinned) throws Exception {
-        var lock = new Object();
-        var started = new CountDownLatch(1);
+        var lock1 = new Object();
+        var lock2 = new Object();
+        var lock3 = new Object();
+        String lock1AsString = Objects.toIdentityString(lock1);
+        String lock2AsString = Objects.toIdentityString(lock2);
+        String lock3AsString = Objects.toIdentityString(lock3);
 
+        var started = new CountDownLatch(1);
         Thread thread = factory.newThread(() -> {
-            synchronized (lock) {
-                if (pinned) {
-                    VThreadPinner.runPinned(() -> {
+            synchronized (lock1) {
+                synchronized (lock2) {
+                    if (pinned) {
+                        VThreadPinner.runPinned(() -> {
+                            started.countDown();
+                            lockAndRun(lock3, LockSupport::park);
+                        });
+                    } else {
                         started.countDown();
-                        LockSupport.park();
-                    });
-                } else {
-                    started.countDown();
-                    LockSupport.park();
+                        lockAndRun(lock3, LockSupport::park);
+                    }
                 }
             }
         });
@@ -497,16 +502,16 @@ class DumpThreads {
             thread.start();
             started.await();
             await(thread, Thread.State.WAITING);
-
             long tid = thread.threadId();
-            String lockAsString = Objects.toIdentityString(lock);
 
             // thread dump in plain text should include thread
             List<String> lines = dumpThreadsToPlainText();
             ThreadFields fields = findThread(tid, lines);
             assertNotNull(fields, "thread not found");
             assertEquals("WAITING", fields.state());
-            assertTrue(contains(lines, "- locked <" + lockAsString));
+            assertTrue(contains(lines, "- locked <" + lock1AsString));
+            assertTrue(contains(lines, "- locked <" + lock2AsString));
+            assertTrue(contains(lines, "- locked <" + lock3AsString));
 
             // thread dump in JSON format should include thread in root container
             ThreadDump threadDump = dumpThreadsToJson();
@@ -516,18 +521,47 @@ class DumpThreads {
             assertNotNull(ti, "thread not found");
             assertEquals(ti.isVirtual(), thread.isVirtual());
 
-            // the lock should be in the ownedMonitors array
-            Set<String> ownedMonitors = ti.ownedMonitors().values()
+            // depth -> list of locks
+            Map<Integer, List<String>> ownedMonitors = ti.ownedMonitors();
+
+            // lock -> list of depths
+            Map<String, List<Integer>> monitorDepths = ownedMonitors.entrySet()
                     .stream()
-                    .flatMap(List::stream)
-                    .collect(Collectors.toSet());
-            assertTrue(ownedMonitors.contains(lockAsString), lockAsString + " not found");
+                    .flatMap(e -> e.getValue()
+                            .stream()
+                            .map(monitor -> Map.entry(monitor, e.getKey())))
+                    .collect(Collectors.groupingBy(
+                            Map.Entry::getKey,
+                            Collectors.mapping(Map.Entry::getValue, Collectors.toList())
+                    ));
+
+            // each lock should be owned
+            List<Integer> lock1Depths = monitorDepths.getOrDefault(lock1AsString, List.of());
+            List<Integer> lock2Depths = monitorDepths.getOrDefault(lock2AsString, List.of());
+            List<Integer> lock3Depths = monitorDepths.getOrDefault(lock3AsString, List.of());
+            assertEquals(1, lock1Depths.size());
+            assertEquals(1, lock2Depths.size());
+            assertEquals(1, lock3Depths.size());
+
+            // lock1 and lock2 owned at the same depth, lock3 is the innermost
+            int depth1 = lock1Depths.get(0);
+            int depth2 = lock2Depths.get(0);
+            int depth3 = lock3Depths.get(0);
+            assertEquals(depth1, depth2);
+            assertTrue(depth3 < depth1);
+
         } finally {
             LockSupport.unpark(thread);
             thread.join();
         }
     }
 
+    private void lockAndRun(Object lock, Runnable action) {
+        synchronized (lock) {
+            action.run();
+        }
+    }
+
     /**
      * Test mounted virtual thread.
      */
diff --git a/test/jdk/sun/security/provider/acvp/ML_DSA_Test.java b/test/jdk/sun/security/provider/acvp/ML_DSA_Test.java
index ac56642b8d7..f76f3d8b9a8 100644
--- a/test/jdk/sun/security/provider/acvp/ML_DSA_Test.java
+++ b/test/jdk/sun/security/provider/acvp/ML_DSA_Test.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2024, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2024, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -88,13 +88,13 @@ public class ML_DSA_Test {
         for (var t : kat.get("testGroups").asArray()) {
             var pname = t.get("parameterSet").asString();
             System.out.println(">> " + pname + " sign");
-            var det = Boolean.parseBoolean(t.get("deterministic").asString());
+            var det = t.get("deterministic").asBoolean();
             if (t.get("signatureInterface").asString().equals("internal")) {
                 ML_DSA_Impls.version = ML_DSA_Impls.Version.DRAFT;
             } else {
                 ML_DSA_Impls.version = ML_DSA_Impls.Version.FINAL;
             }
-            if (t.get("externalMu").asString().equals("true")) {
+            if (t.get("externalMu").asBoolean()) {
                 continue; // Not supported
             }
             for (var c : t.get("tests").asArray()) {
@@ -139,7 +139,7 @@ public class ML_DSA_Test {
                 ML_DSA_Impls.version = ML_DSA_Impls.Version.FINAL;
             }
 
-            if (t.get("externalMu").asString().equals("true")) {
+            if (t.get("externalMu").asBoolean()) {
                 continue; // Not supported
             }
 
@@ -157,7 +157,7 @@ public class ML_DSA_Test {
                     public byte[] getEncoded() { return toByteArray(c.get("pk").asString()); }
                 };
                 // Only ML-DSA sigVer has negative tests
-                var expected = Boolean.parseBoolean(c.get("testPassed").asString());
+                var expected = c.get("testPassed").asBoolean();
                 var actual = true;
                 try {
                     s.initVerify(pk);
diff --git a/test/lib/jdk/test/lib/json/JSONValue.java b/test/lib/jdk/test/lib/json/JSONValue.java
index f89d13b3bba..72ed2fd917c 100644
--- a/test/lib/jdk/test/lib/json/JSONValue.java
+++ b/test/lib/jdk/test/lib/json/JSONValue.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2022, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -28,6 +28,7 @@ import java.util.HashMap;
 import java.util.Iterator;
 import java.util.List;
 import java.util.Map;
+import java.util.Optional;
 
 public interface JSONValue {
 
@@ -88,9 +89,6 @@ public interface JSONValue {
 
         @Override
         public String toString() {
-            if (value == null) {
-                return "null";
-            }
             var builder = new StringBuilder();
             builder.append("\"");
 
@@ -172,6 +170,56 @@ public interface JSONValue {
         public Iterator<JSONValue> iterator() {
             return values.iterator();
         }
+
+        @Override
+        public List<JSONValue> elements() {
+            return List.copyOf(values);
+        }
+    }
+
+    public final class JSONBoolean implements JSONValue {
+        private static JSONBoolean TRUE = new JSONBoolean(true);
+        private static JSONBoolean FALSE = new JSONBoolean(false);
+
+        private final boolean value;
+
+        private JSONBoolean(boolean value) {
+            this.value = value;
+        }
+
+        @Override
+        public boolean asBoolean() {
+            return value;
+        }
+
+        @Override
+        public String toString() {
+            return String.valueOf(value);
+        }
+
+        public static JSONBoolean of(boolean value) {
+            return value ? TRUE : FALSE;
+        }
+    }
+
+    public final class JSONNull implements JSONValue {
+        private static JSONNull NULL = new JSONNull();
+
+        private JSONNull() {}
+
+        @Override
+        public Optional<JSONValue> valueOrNull() {
+            return Optional.empty();
+        }
+
+        @Override
+        public String toString() {
+            return "null";
+        }
+
+        public static JSONNull of() {
+            return NULL;
+        }
     }
 
     class JSONParser {
@@ -181,8 +229,8 @@ public interface JSONValue {
         JSONParser() {
         }
 
-        private IllegalStateException failure(String message) {
-            return new IllegalStateException(String.format("[%d]: %s : %s", pos, message, input));
+        private IllegalArgumentException failure(String message) {
+            return new IllegalArgumentException(String.format("[%d]: %s : %s", pos, message, input));
         }
 
         private char current() {
@@ -220,13 +268,13 @@ public interface JSONValue {
             }
         }
 
-        private JSONString parseBoolean() {
+        private JSONBoolean parseBoolean() {
             if (current() == 't') {
                 expect('r');
                 expect('u');
                 expect('e');
                 advance();
-                return new JSONString("true");
+                return JSONBoolean.of(true);
             }
 
             if (current() == 'f') {
@@ -235,7 +283,7 @@ public interface JSONValue {
                 expect('s');
                 expect('e');
                 advance();
-                return new JSONString("false");
+                return JSONBoolean.of(false);
             }
             throw failure("a boolean can only be 'true' or 'false'");
         }
@@ -400,12 +448,12 @@ public interface JSONValue {
             return new JSONArray(list);
         }
 
-        public JSONString parseNull() {
+        public JSONNull parseNull() {
             expect('u');
             expect('l');
             expect('l');
             advance();
-            return new JSONString(null);
+            return JSONNull.of();
         }
 
         public JSONObject parseObject() {
@@ -531,22 +579,38 @@ public interface JSONValue {
     }
 
     default int size() {
-        throw new IllegalStateException("Size operation unsupported");
+        throw new UnsupportedOperationException("Size operation unsupported");
+    }
+
+    default List<JSONValue> elements() {
+        throw new UnsupportedOperationException("Unsupported conversion to array");
     }
 
     default String asString() {
-        throw new IllegalStateException("Unsupported conversion to String");
+        throw new UnsupportedOperationException("Unsupported conversion to String");
     }
 
     default JSONArray asArray() {
-        throw new IllegalStateException("Unsupported conversion to array");
+        throw new UnsupportedOperationException("Unsupported conversion to array");
     }
 
     default JSONObject asObject() {
-        throw new IllegalStateException("Unsupported conversion to object");
+        throw new UnsupportedOperationException("Unsupported conversion to object");
+    }
+
+    default boolean asBoolean() {
+        throw new UnsupportedOperationException("Unsupported conversion to boolean");
     }
 
     default JSONValue get(String field) {
         return asObject().get(field);
     }
+
+    default Optional<JSONValue> getOrAbsent(String field) {
+        return Optional.ofNullable(get(field));
+    }
+
+    default Optional<JSONValue> valueOrNull() {
+        return Optional.of(this);
+    }
 }
diff --git a/test/lib/jdk/test/lib/threaddump/ThreadDump.java b/test/lib/jdk/test/lib/threaddump/ThreadDump.java
index ca728e625fc..972d46675f4 100644
--- a/test/lib/jdk/test/lib/threaddump/ThreadDump.java
+++ b/test/lib/jdk/test/lib/threaddump/ThreadDump.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2022, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2022, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -32,13 +32,17 @@ import java.util.Map;
 import java.util.Optional;
 import java.util.OptionalLong;
 import java.util.Set;
+import java.util.function.Function;
+import java.util.stream.Collectors;
 import java.util.stream.Stream;
 import jdk.test.lib.json.JSONValue;
 
 /**
  * Represents a thread dump that is obtained by parsing JSON text. A thread dump in JSON
  * format is generated with the {@code com.sun.management.HotSpotDiagnosticMXBean} API or
- * using {@code jcmd <pid> Thread.dump_to_file -format=json <file>}.
+ * using {@code jcmd <pid> Thread.dump_to_file -format=json <file>}. The thread dump
+ * format is documented in {@code
+ * src/jdk.management/share/classes/com/sun/management/doc-files/threadDump.schema.json}.
  *
  * <p> The following is an example thread dump that is parsed by this class. Many of the
  * objects are collapsed to reduce the size.
@@ -127,6 +131,20 @@ public final class ThreadDump {
         this.threadDumpObj = threadDumpObj;
     }
 
+    /**
+     * Assert that a JSONValue is a JSONString and parse the string as an int.
+     */
+    private static int parseStringAsInt(JSONValue valueObj) {
+        return Integer.parseInt(valueObj.asString());
+    }
+
+    /**
+     * Assert that a JSONValue is a JSONString and parse the string as a long.
+     */
+    private static long parseStringAsLong(JSONValue valueObj) {
+        return Long.parseLong(valueObj.asString());
+    }
+
     /**
      * Represents an element in the threadDump/threadContainers array.
      */
@@ -149,14 +167,6 @@ public final class ThreadDump {
             children.add(container);
         }
 
-        /**
-         * Returns the value of a property of this thread container, as a string.
-         */
-        private String getStringProperty(String propertyName) {
-            JSONValue value = containerObj.get(propertyName);
-            return (value != null) ? value.asString() : null;
-        }
-
         /**
          * Returns the thread container name.
          */
@@ -168,10 +178,10 @@ public final class ThreadDump {
          * Return the thread identifier of the owner or empty OptionalLong if not owned.
          */
         public OptionalLong owner() {
-            String owner = getStringProperty("owner");
-            return (owner != null)
-                    ? OptionalLong.of(Long.parseLong(owner))
-                    : OptionalLong.empty();
+            return containerObj.get("owner")  // string or null
+                    .valueOrNull()
+                    .map(v -> OptionalLong.of(parseStringAsLong(v)))
+                    .orElse(OptionalLong.empty());
         }
 
         /**
@@ -192,12 +202,10 @@ public final class ThreadDump {
          * Returns a stream of {@code ThreadInfo} objects for the threads in this container.
          */
         public Stream<ThreadInfo> threads() {
-            JSONValue.JSONArray threadsObj = containerObj.get("threads").asArray();
-            Set<ThreadInfo> threadInfos = new HashSet<>();
-            for (JSONValue threadObj : threadsObj) {
-                threadInfos.add(new ThreadInfo(threadObj));
-            }
-            return threadInfos.stream();
+            return containerObj.get("threads")
+                    .elements()
+                    .stream()
+                    .map(ThreadInfo::new);
         }
 
         /**
@@ -237,29 +245,10 @@ public final class ThreadDump {
         private final JSONValue threadObj;
 
         ThreadInfo(JSONValue threadObj) {
-            this.tid = Long.parseLong(threadObj.get("tid").asString());
+            this.tid = parseStringAsLong(threadObj.get("tid"));
             this.threadObj = threadObj;
         }
 
-        /**
-         * Returns the value of a property of this thread object, as a string.
-         */
-        private String getStringProperty(String propertyName) {
-            JSONValue value = threadObj.get(propertyName);
-            return (value != null) ? value.asString() : null;
-        }
-
-        /**
-         * Returns the value of a property of an object in this thread object, as a string.
-         */
-        private String getStringProperty(String objectName, String propertyName) {
-            if (threadObj.get(objectName) instanceof JSONValue.JSONObject obj
-                    && obj.get(propertyName) instanceof JSONValue value) {
-                return value.asString();
-            }
-            return null;
-        }
-
         /**
          * Returns the thread identifier.
          */
@@ -271,83 +260,92 @@ public final class ThreadDump {
          * Returns the thread name.
          */
         public String name() {
-            return getStringProperty("name");
+            return threadObj.get("name").asString();
         }
 
         /**
          * Returns the thread state.
          */
         public String state() {
-            return getStringProperty("state");
+            return threadObj.get("state").asString();
         }
 
         /**
          * Returns true if virtual thread.
          */
         public boolean isVirtual() {
-            String s = getStringProperty("virtual");
-            return (s != null) ? Boolean.parseBoolean(s) : false;
+            return threadObj.getOrAbsent("virtual")
+                    .map(JSONValue::asBoolean)
+                    .orElse(false);
         }
 
         /**
-         * Returns the thread's parkBlocker.
+         * Returns the thread's parkBlocker or null.
          */
         public String parkBlocker() {
-            return getStringProperty("parkBlocker", "object");
+            return threadObj.getOrAbsent("parkBlocker")
+                    .map(v -> v.get("object").asString())
+                    .orElse(null);
         }
 
         /**
          * Returns the owner of the parkBlocker if the parkBlocker is an AbstractOwnableSynchronizer.
          */
         public OptionalLong parkBlockerOwner() {
-            String owner = getStringProperty("parkBlocker", "owner");
-            return (owner != null)
-                    ? OptionalLong.of(Long.parseLong(owner))
-                    : OptionalLong.empty();
+            return threadObj.getOrAbsent("parkBlocker")
+                    .map(v -> OptionalLong.of(parseStringAsLong(v.get("owner"))))
+                    .orElse(OptionalLong.empty());
         }
 
         /**
-         * Returns the object that the thread is blocked entering its monitor.
+         * Returns the object that the thread is blocked entering its monitor or null.
          */
         public String blockedOn() {
-            return getStringProperty("blockedOn");
+            return threadObj.getOrAbsent("blockedOn")
+                    .map(JSONValue::asString)
+                    .orElse(null);
         }
 
         /**
-         * Return the object that is the therad is waiting on with Object.wait.
+         * Return the object that is the thread is waiting on with Object.wait or null.
          */
         public String waitingOn() {
-            return getStringProperty("waitingOn");
+            return threadObj.getOrAbsent("waitingOn")
+                    .map(JSONValue::asString)
+                    .orElse(null);
         }
 
         /**
          * Returns the thread stack.
          */
         public Stream<String> stack() {
-            JSONValue.JSONArray stackObj = threadObj.get("stack").asArray();
-            List<String> stack = new ArrayList<>();
-            for (JSONValue steObject : stackObj) {
-                stack.add(steObject.asString());
-            }
-            return stack.stream();
+            return threadObj.get("stack")
+                    .elements()
+                    .stream()
+                    .map(JSONValue::asString);
         }
 
         /**
          * Return a map of monitors owned.
          */
         public Map<Integer, List<String>> ownedMonitors() {
-            Map<Integer, List<String>> ownedMonitors = new HashMap<>();
-            JSONValue monitorsOwnedObj = threadObj.get("monitorsOwned");
-            if (monitorsOwnedObj != null) {
-                for (JSONValue obj : monitorsOwnedObj.asArray()) {
-                    int depth = Integer.parseInt(obj.get("depth").asString());
-                    for (JSONValue lock : obj.get("locks").asArray()) {
-                        ownedMonitors.computeIfAbsent(depth, _ -> new ArrayList<>())
-                                .add(lock.asString());
-                    }
-                }
-            }
-            return ownedMonitors;
+            Map<Integer, List<String>> result = new HashMap<>();
+            threadObj.getOrAbsent("monitorsOwned")
+                    .map(JSONValue::elements)
+                    .orElse(List.of())
+                    .forEach(e -> {
+                        int depth = parseStringAsInt(e.get("depth"));
+                        List<String> locks = e.get("locks")
+                                .elements()
+                                .stream()
+                                .map(v -> v.valueOrNull()  // string or null
+                                        .map(JSONValue::asString)
+                                        .orElse(null))
+                                .toList();
+                        result.computeIfAbsent(depth, _ -> new ArrayList<>()).addAll(locks);
+                    });
+
+            return result;
         }
 
         /**
@@ -355,10 +353,9 @@ public final class ThreadDump {
          * its carrier.
          */
         public OptionalLong carrier() {
-            String s = getStringProperty("carrier");
-            return (s != null)
-                    ? OptionalLong.of(Long.parseLong(s))
-                    : OptionalLong.empty();
+            return threadObj.getOrAbsent("carrier")
+                    .map(s -> OptionalLong.of(parseStringAsLong(s)))
+                    .orElse(OptionalLong.empty());
         }
 
         @Override
@@ -388,33 +385,25 @@ public final class ThreadDump {
         }
     }
 
-    /**
-     * Returns the value of a property of this thread dump, as a string.
-     */
-    private String getStringProperty(String propertyName) {
-        JSONValue value = threadDumpObj.get(propertyName);
-        return (value != null) ? value.asString() : null;
-    }
-
     /**
      * Returns the value of threadDump/processId.
      */
     public long processId() {
-        return Long.parseLong(getStringProperty("processId"));
+        return parseStringAsLong(threadDumpObj.get("processId"));
     }
 
     /**
      * Returns the value of threadDump/time.
      */
     public String time() {
-        return getStringProperty("time");
+        return threadDumpObj.get("time").asString();
     }
 
     /**
      * Returns the value of threadDump/runtimeVersion.
      */
     public String runtimeVersion() {
-        return getStringProperty("runtimeVersion");
+        return threadDumpObj.get("runtimeVersion").asString();
     }
 
     /**
@@ -449,24 +438,31 @@ public final class ThreadDump {
         JSONValue threadDumpObj = JSONValue.parse(json).get("threadDump");
 
         // threadContainers array, preserve insertion order (parents are added before children)
-        Map<String, JSONValue> containerObjs = new LinkedHashMap<>();
-        JSONValue threadContainersObj = threadDumpObj.get("threadContainers");
-        for (JSONValue containerObj : threadContainersObj.asArray()) {
-            String name = containerObj.get("container").asString();
-            containerObjs.put(name, containerObj);
-        }
+        Map<String, JSONValue> containerObjs = threadDumpObj.get("threadContainers")
+                .elements()
+                .stream()
+                .collect(Collectors.toMap(
+                        c -> c.get("container").asString(),
+                        Function.identity(),
+                        (a, b) -> { throw new RuntimeException("Duplicate container"); },
+                        LinkedHashMap::new
+                ));
 
         // find root and create tree of thread containers
         ThreadContainer root = null;
         Map<String, ThreadContainer> map = new HashMap<>();
         for (String name : containerObjs.keySet()) {
             JSONValue containerObj = containerObjs.get(name);
-            String parentName = containerObj.get("parent").asString();
-            if (parentName == null) {
+            JSONValue parentObj = containerObj.get("parent");
+            if (parentObj instanceof JSONValue.JSONNull) {
+                if (root != null) {
+                    throw new RuntimeException("More than one root container");
+                }
                 root = new ThreadContainer(name, null, containerObj);
                 map.put(name, root);
             } else {
-                var parent = map.get(parentName);
+                String parentName = parentObj.asString();
+                ThreadContainer parent = map.get(parentName);
                 if (parent == null) {
                     throw new RuntimeException("Thread container " + name + " found before " + parentName);
                 }
@@ -475,7 +471,10 @@ public final class ThreadDump {
                 map.put(name, container);
             }
         }
+        if (root == null) {
+            throw new RuntimeException("No root container");
+        }
 
         return new ThreadDump(root, map, threadDumpObj);
     }
-}
\ No newline at end of file
+}

From 1faee07b9546b8ba46e43093267b2b9ccbc7a1dc Mon Sep 17 00:00:00 2001
From: Jatin Bhateja <jbhateja@openjdk.org>
Date: Wed, 25 Mar 2026 08:13:47 +0000
Subject: [PATCH 339/655] 8379362: C2: Buffer overrun in
 VectorSupport::lanetype2name

Reviewed-by: liach, vlivanov, mhaessig
---
 src/hotspot/share/prims/vectorSupport.cpp | 7 +++++--
 1 file changed, 5 insertions(+), 2 deletions(-)

diff --git a/src/hotspot/share/prims/vectorSupport.cpp b/src/hotspot/share/prims/vectorSupport.cpp
index 58f22d38d33..7d80ed327fd 100644
--- a/src/hotspot/share/prims/vectorSupport.cpp
+++ b/src/hotspot/share/prims/vectorSupport.cpp
@@ -200,7 +200,6 @@ bool VectorSupport::is_unsigned_op(jint id) {
 }
 
 const char* VectorSupport::lanetype2name(LaneType lane_type) {
-  assert(lane_type >= LT_FLOAT && lane_type <= LT_LONG, "");
   const char* lanetype2name[] = {
     "float",
     "double",
@@ -209,7 +208,11 @@ const char* VectorSupport::lanetype2name(LaneType lane_type) {
     "int",
     "long"
   };
-  return lanetype2name[lane_type];
+  if (lane_type >= LT_FLOAT && lane_type <= LT_LONG) {
+    return lanetype2name[lane_type];
+  }
+  assert(false, "unknown lane type: %d", (int)lane_type);
+  return "illegal";
 }
 
 int VectorSupport::vop2ideal(jint id, LaneType lt) {

From 7d24a096b4cb3fa73e77370e82d24caeada9003b Mon Sep 17 00:00:00 2001
From: Daniel Fuchs <dfuchs@openjdk.org>
Date: Wed, 25 Mar 2026 10:21:07 +0000
Subject: [PATCH 340/655] 8380824:
 java/net/DatagramSocket/SendReceiveMaxSize.java could also test the loopback
 interface

Reviewed-by: jpai
---
 .../DatagramSocket/SendReceiveMaxSize.java    | 65 ++++++++++++++++++-
 1 file changed, 62 insertions(+), 3 deletions(-)

diff --git a/test/jdk/java/net/DatagramSocket/SendReceiveMaxSize.java b/test/jdk/java/net/DatagramSocket/SendReceiveMaxSize.java
index ded087d35e8..86936ae41d0 100644
--- a/test/jdk/java/net/DatagramSocket/SendReceiveMaxSize.java
+++ b/test/jdk/java/net/DatagramSocket/SendReceiveMaxSize.java
@@ -22,7 +22,7 @@
  */
 
 /*
- * @test
+ * @test id=default
  * @bug 8242885 8250886 8240901
  * @key randomness
  * @summary This test verifies that on macOS, the send buffer size is configured
@@ -34,13 +34,62 @@
  * @library /test/lib
  * @build jdk.test.lib.net.IPSupport
  * @run testng/othervm SendReceiveMaxSize
+ */
+/*
+ * @test id=preferIPv4Stack
+ * @key randomness
+ * @summary Check that it is possible to send and receive datagrams of
+ *          maximum size on macOS, using an IPv4 only socket.
+ * @library /test/lib
+ * @build jdk.test.lib.net.IPSupport
  * @run testng/othervm -Djava.net.preferIPv4Stack=true SendReceiveMaxSize
+ */
+/*
+ * @test id=preferIPv6Addresses
+ * @key randomness
+ * @summary Check that it is possible to send and receive datagrams of
+ *          maximum size on macOS, using a dual socket and prefering
+ *          IPv6 addresses.
+ * @library /test/lib
+ * @build jdk.test.lib.net.IPSupport
  * @run testng/othervm -Djava.net.preferIPv6Addresses=true SendReceiveMaxSize
  */
+/*
+ * @test id=preferLoopback
+ * @key randomness
+ * @summary Check that it is possible to send and receive datagrams of
+ *          maximum size on macOS, using a dual socket and the loopback
+ *          interface.
+ * @library /test/lib
+ * @build jdk.test.lib.net.IPSupport
+ * @run testng/othervm -Dtest.preferLoopback=true SendReceiveMaxSize
+ */
+/*
+ * @test id=preferIPv6Loopback
+ * @key randomness
+ * @summary Check that it is possible to send and receive datagrams of
+ *          maximum size on macOS, using a dual socket and the loopback
+ *          interface.
+ * @library /test/lib
+ * @build jdk.test.lib.net.IPSupport
+ * @run testng/othervm -Dtest.preferLoopback=true -Djava.net.preferIPv6Addresses=true SendReceiveMaxSize
+ */
+/*
+ * @test id=preferIPv4Loopback
+ * @key randomness
+ * @summary Check that it is possible to send and receive datagrams of
+ *          maximum size on macOS, using an IPv4 only socket and the
+ *          loopback interface
+ * @library /test/lib
+ * @build jdk.test.lib.net.IPSupport
+ * @run testng/othervm -Dtest.preferLoopback=true -Djava.net.preferIPv4Stack=true SendReceiveMaxSize
+ */
 
 import jdk.test.lib.RandomFactory;
 import jdk.test.lib.Platform;
 import jdk.test.lib.net.IPSupport;
+import jtreg.SkippedException;
+import org.testng.SkipException;
 import org.testng.annotations.BeforeTest;
 import org.testng.annotations.DataProvider;
 import org.testng.annotations.Test;
@@ -61,6 +110,9 @@ import static org.testng.Assert.assertEquals;
 import static org.testng.Assert.expectThrows;
 
 public class SendReceiveMaxSize {
+
+    private final static boolean PREFER_LOOPBACK = Boolean.getBoolean("test.preferLoopback");
+
     private int BUF_LIMIT;
     private InetAddress HOST_ADDR;
     private final static int IPV4_SNDBUF = 65507;
@@ -75,8 +127,15 @@ public class SendReceiveMaxSize {
 
     @BeforeTest
     public void setUp() throws IOException {
-        IPSupport.throwSkippedExceptionIfNonOperational();
-        HOST_ADDR = InetAddress.getLocalHost();
+        try {
+            // This method throws jtreg.SkippedException, which is
+            // interpreted as a test failure by testng
+            IPSupport.throwSkippedExceptionIfNonOperational();
+        } catch (SkippedException skip) {
+            // throws the appropriate TestNG SkipException
+            throw new SkipException(skip.getMessage(), skip);
+        }
+        HOST_ADDR = PREFER_LOOPBACK ? InetAddress.getLoopbackAddress() : InetAddress.getLocalHost();
         BUF_LIMIT = (HOST_ADDR instanceof Inet6Address) ? IPV6_SNDBUF : IPV4_SNDBUF;
         System.out.printf("Host address: %s, Buffer limit: %d%n", HOST_ADDR, BUF_LIMIT);
     }

From 3737cad6d9fc32ccaee5373b1d84d730f6ef42f9 Mon Sep 17 00:00:00 2001
From: Evgeny Astigeevich <eastigeevich@openjdk.org>
Date: Wed, 25 Mar 2026 12:46:25 +0000
Subject: [PATCH 341/655] 8370947: Mitigate Neoverse-N1 erratum 1542419
 negative impact on GCs and JIT performance

Co-authored-by: Axel Boldt-Christmas <aboldtch@openjdk.org>
Reviewed-by: shade, eosterlund, aph, aboldtch
---
 .../gc/z/zBarrierSetAssembler_aarch64.cpp     |   4 +-
 src/hotspot/cpu/aarch64/globals_aarch64.hpp   |   2 +
 src/hotspot/cpu/aarch64/relocInfo_aarch64.cpp |   7 +-
 .../cpu/aarch64/vm_version_aarch64.cpp        |  45 ++
 .../cpu/aarch64/vm_version_aarch64.hpp        |   5 +
 .../linux_aarch64/icache_linux_aarch64.cpp    |  28 ++
 .../linux_aarch64/icache_linux_aarch64.hpp    | 101 ++++-
 .../vm_version_linux_aarch64.cpp              |   2 +
 src/hotspot/share/asm/codeBuffer.cpp          |   3 -
 src/hotspot/share/code/codeBlob.cpp           |   6 +
 src/hotspot/share/code/nmethod.cpp            |  32 +-
 src/hotspot/share/code/nmethod.hpp            |   7 +-
 src/hotspot/share/code/relocInfo.cpp          |   9 -
 src/hotspot/share/code/relocInfo.hpp          |   2 -
 src/hotspot/share/gc/z/zBarrierSetNMethod.cpp |  14 +-
 src/hotspot/share/gc/z/zGeneration.cpp        |  14 +-
 src/hotspot/share/gc/z/zMark.cpp              |  31 +-
 src/hotspot/share/gc/z/zNMethod.cpp           |  16 +-
 src/hotspot/share/gc/z/zNMethod.hpp           |   2 +
 src/hotspot/share/runtime/globals.hpp         |   2 +
 src/hotspot/share/runtime/icache.hpp          |  23 +
 ...tDeferredICacheInvalidationCmdOptions.java | 426 ++++++++++++++++++
 .../gc/TestDeferredICacheInvalidation.java    | 306 +++++++++++++
 .../bench/vm/gc/GCPatchingNmethodCost.java    | 206 +++++++++
 24 files changed, 1244 insertions(+), 49 deletions(-)
 create mode 100644 src/hotspot/os_cpu/linux_aarch64/icache_linux_aarch64.cpp
 create mode 100644 test/hotspot/jtreg/compiler/runtime/TestDeferredICacheInvalidationCmdOptions.java
 create mode 100644 test/hotspot/jtreg/gc/TestDeferredICacheInvalidation.java
 create mode 100644 test/micro/org/openjdk/bench/vm/gc/GCPatchingNmethodCost.java

diff --git a/src/hotspot/cpu/aarch64/gc/z/zBarrierSetAssembler_aarch64.cpp b/src/hotspot/cpu/aarch64/gc/z/zBarrierSetAssembler_aarch64.cpp
index 4f0977a414f..f0885fee93d 100644
--- a/src/hotspot/cpu/aarch64/gc/z/zBarrierSetAssembler_aarch64.cpp
+++ b/src/hotspot/cpu/aarch64/gc/z/zBarrierSetAssembler_aarch64.cpp
@@ -879,7 +879,9 @@ void ZBarrierSetAssembler::patch_barrier_relocation(address addr, int format) {
     ShouldNotReachHere();
   }
 
-  ICache::invalidate_word((address)patch_addr);
+  if (!UseSingleICacheInvalidation) {
+    ICache::invalidate_word((address)patch_addr);
+  }
 }
 
 #ifdef COMPILER1
diff --git a/src/hotspot/cpu/aarch64/globals_aarch64.hpp b/src/hotspot/cpu/aarch64/globals_aarch64.hpp
index e6de2c798b1..ba29646a828 100644
--- a/src/hotspot/cpu/aarch64/globals_aarch64.hpp
+++ b/src/hotspot/cpu/aarch64/globals_aarch64.hpp
@@ -127,6 +127,8 @@ define_pd_global(intx, InlineSmallCode,          1000);
           "Branch Protection to use: none, standard, pac-ret")          \
   product(bool, AlwaysMergeDMB, true, DIAGNOSTIC,                       \
           "Always merge DMB instructions in code emission")             \
+  product(bool, NeoverseN1ICacheErratumMitigation, false, DIAGNOSTIC,   \
+          "Enable workaround for Neoverse N1 erratum 1542419")          \
 
 // end of ARCH_FLAGS
 
diff --git a/src/hotspot/cpu/aarch64/relocInfo_aarch64.cpp b/src/hotspot/cpu/aarch64/relocInfo_aarch64.cpp
index dbec2d76d4f..f1b9fb213a2 100644
--- a/src/hotspot/cpu/aarch64/relocInfo_aarch64.cpp
+++ b/src/hotspot/cpu/aarch64/relocInfo_aarch64.cpp
@@ -54,7 +54,12 @@ void Relocation::pd_set_data_value(address x, bool verify_only) {
     bytes = MacroAssembler::pd_patch_instruction_size(addr(), x);
     break;
   }
-  ICache::invalidate_range(addr(), bytes);
+
+  if (UseSingleICacheInvalidation) {
+    assert(_binding != nullptr, "expect to be called with RelocIterator in use");
+  } else {
+    ICache::invalidate_range(addr(), bytes);
+  }
 }
 
 address Relocation::pd_call_destination(address orig_addr) {
diff --git a/src/hotspot/cpu/aarch64/vm_version_aarch64.cpp b/src/hotspot/cpu/aarch64/vm_version_aarch64.cpp
index 4423d9c5b58..0a40cd705cd 100644
--- a/src/hotspot/cpu/aarch64/vm_version_aarch64.cpp
+++ b/src/hotspot/cpu/aarch64/vm_version_aarch64.cpp
@@ -52,6 +52,9 @@ uintptr_t VM_Version::_pac_mask;
 
 SpinWait VM_Version::_spin_wait;
 
+bool VM_Version::_cache_dic_enabled;
+bool VM_Version::_cache_idc_enabled;
+
 const char* VM_Version::_features_names[MAX_CPU_FEATURES] = { nullptr };
 
 static SpinWait get_spin_wait_desc() {
@@ -63,6 +66,19 @@ static SpinWait get_spin_wait_desc() {
   return spin_wait;
 }
 
+static bool has_neoverse_n1_errata_1542419() {
+  const int major_rev_num = VM_Version::cpu_variant();
+  const int minor_rev_num = VM_Version::cpu_revision();
+  // Neoverse N1: 0xd0c
+  // Erratum 1542419 affects r3p0, r3p1 and r4p0.
+  // It is fixed in r4p1 and later revisions, which are not affected.
+  return (VM_Version::cpu_family() == VM_Version::CPU_ARM &&
+          VM_Version::model_is(0xd0c) &&
+          ((major_rev_num == 3 && minor_rev_num == 0) ||
+           (major_rev_num == 3 && minor_rev_num == 1) ||
+           (major_rev_num == 4 && minor_rev_num == 0)));
+}
+
 void VM_Version::initialize() {
 #define SET_CPU_FEATURE_NAME(id, name, bit) \
   _features_names[bit] = XSTR(name);
@@ -74,6 +90,9 @@ void VM_Version::initialize() {
   _supports_atomic_getset8 = true;
   _supports_atomic_getadd8 = true;
 
+  _cache_dic_enabled = false;
+  _cache_idc_enabled = false;
+
   get_os_cpu_info();
 
   int dcache_line = VM_Version::dcache_line_size();
@@ -661,6 +680,32 @@ void VM_Version::initialize() {
     clear_feature(CPU_SVE);
   }
 
+  if (FLAG_IS_DEFAULT(UseSingleICacheInvalidation) && is_cache_idc_enabled() && is_cache_dic_enabled()) {
+    FLAG_SET_DEFAULT(UseSingleICacheInvalidation, true);
+  }
+
+  if (FLAG_IS_DEFAULT(NeoverseN1ICacheErratumMitigation) && has_neoverse_n1_errata_1542419()) {
+    FLAG_SET_DEFAULT(NeoverseN1ICacheErratumMitigation, true);
+  }
+
+  if (NeoverseN1ICacheErratumMitigation) {
+    if (!has_neoverse_n1_errata_1542419()) {
+      vm_exit_during_initialization("NeoverseN1ICacheErratumMitigation is set for the CPU not having Neoverse N1 errata 1542419");
+    }
+    if (FLAG_IS_DEFAULT(UseSingleICacheInvalidation)) {
+      FLAG_SET_DEFAULT(UseSingleICacheInvalidation, true);
+    }
+
+    if (!UseSingleICacheInvalidation) {
+      vm_exit_during_initialization("NeoverseN1ICacheErratumMitigation is set but UseSingleICacheInvalidation is not enabled");
+    }
+  }
+
+  if (UseSingleICacheInvalidation
+      && (!is_cache_idc_enabled() || (!is_cache_dic_enabled() && !NeoverseN1ICacheErratumMitigation))) {
+    vm_exit_during_initialization("UseSingleICacheInvalidation is set but neither IDC nor DIC nor NeoverseN1ICacheErratumMitigation is enabled");
+  }
+
   // Construct the "features" string
   stringStream ss(512);
   ss.print("0x%02x:0x%x:0x%03x:%d", _cpu, _variant, _model, _revision);
diff --git a/src/hotspot/cpu/aarch64/vm_version_aarch64.hpp b/src/hotspot/cpu/aarch64/vm_version_aarch64.hpp
index e8681611234..6145990d0d6 100644
--- a/src/hotspot/cpu/aarch64/vm_version_aarch64.hpp
+++ b/src/hotspot/cpu/aarch64/vm_version_aarch64.hpp
@@ -58,6 +58,8 @@ protected:
   // When _prefer_sve_merging_mode_cpy is true, `cpy (imm, zeroing)` is
   // implemented as `movi; cpy(imm, merging)`.
   static constexpr bool _prefer_sve_merging_mode_cpy = true;
+  static bool _cache_dic_enabled;
+  static bool _cache_idc_enabled;
 
   static SpinWait _spin_wait;
 
@@ -253,6 +255,9 @@ public:
     return vector_length_in_bytes <= 16;
   }
 
+  static bool is_cache_dic_enabled() { return _cache_dic_enabled; }
+  static bool is_cache_idc_enabled() { return _cache_idc_enabled; }
+
   static void get_cpu_features_name(void* features_buffer, stringStream& ss);
 
   // Returns names of features present in features_set1 but not in features_set2
diff --git a/src/hotspot/os_cpu/linux_aarch64/icache_linux_aarch64.cpp b/src/hotspot/os_cpu/linux_aarch64/icache_linux_aarch64.cpp
new file mode 100644
index 00000000000..41cad5af325
--- /dev/null
+++ b/src/hotspot/os_cpu/linux_aarch64/icache_linux_aarch64.cpp
@@ -0,0 +1,28 @@
+/*
+ * Copyright Amazon.com Inc. or its affiliates. All Rights Reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ *
+ */
+
+#include "runtime/icache.hpp"
+#include "utilities/globalDefinitions.hpp"
+
+NOT_PRODUCT(THREAD_LOCAL AArch64ICacheInvalidationContext* AArch64ICacheInvalidationContext::_current_context = nullptr;)
diff --git a/src/hotspot/os_cpu/linux_aarch64/icache_linux_aarch64.hpp b/src/hotspot/os_cpu/linux_aarch64/icache_linux_aarch64.hpp
index 8fbaa7a6b6e..b410aebed7b 100644
--- a/src/hotspot/os_cpu/linux_aarch64/icache_linux_aarch64.hpp
+++ b/src/hotspot/os_cpu/linux_aarch64/icache_linux_aarch64.hpp
@@ -26,6 +26,10 @@
 #ifndef OS_CPU_LINUX_AARCH64_ICACHE_AARCH64_HPP
 #define OS_CPU_LINUX_AARCH64_ICACHE_AARCH64_HPP
 
+#include "memory/allocation.hpp"
+#include "runtime/vm_version.hpp"
+#include "utilities/globalDefinitions.hpp"
+
 // Interface for updating the instruction cache.  Whenever the VM
 // modifies code, part of the processor instruction cache potentially
 // has to be flushed.
@@ -37,8 +41,103 @@ class ICache : public AbstractICache {
     __builtin___clear_cache((char *)addr, (char *)(addr + 4));
   }
   static void invalidate_range(address start, int nbytes) {
-    __builtin___clear_cache((char *)start, (char *)(start + nbytes));
+    if (NeoverseN1ICacheErratumMitigation) {
+      assert(VM_Version::is_cache_idc_enabled(),
+             "Expect CTR_EL0.IDC to be enabled for Neoverse N1 with erratum "
+             "1542419");
+      assert(!VM_Version::is_cache_dic_enabled(),
+             "Expect CTR_EL0.DIC to be disabled for Neoverse N1 with erratum "
+             "1542419");
+      asm volatile("dsb ish       \n"
+                   "ic  ivau, xzr \n"
+                   "dsb ish       \n"
+                   "isb           \n"
+                   : : : "memory");
+    } else {
+      __builtin___clear_cache((char *)start, (char *)(start + nbytes));
+    }
   }
 };
 
+class AArch64ICacheInvalidationContext : StackObj {
+ private:
+
+#ifdef ASSERT
+  static THREAD_LOCAL AArch64ICacheInvalidationContext* _current_context;
+#endif
+
+  bool _has_modified_code;
+
+ public:
+  NONCOPYABLE(AArch64ICacheInvalidationContext);
+
+  AArch64ICacheInvalidationContext()
+      : _has_modified_code(false) {
+    assert(_current_context == nullptr, "nested ICacheInvalidationContext not supported");
+#ifdef ASSERT
+    _current_context = this;
+#endif
+  }
+
+  ~AArch64ICacheInvalidationContext() {
+    NOT_PRODUCT(_current_context = nullptr);
+
+    if (!_has_modified_code || !UseSingleICacheInvalidation) {
+      return;
+    }
+
+    assert(VM_Version::is_cache_idc_enabled(), "Expect CTR_EL0.IDC to be enabled");
+
+    asm volatile("dsb ish" : : : "memory");
+
+    if (NeoverseN1ICacheErratumMitigation) {
+      assert(!VM_Version::is_cache_dic_enabled(),
+             "Expect CTR_EL0.DIC to be disabled for Neoverse N1 with erratum "
+             "1542419");
+
+      // Errata 1542419: Neoverse N1 cores with the 'COHERENT_ICACHE' feature
+      // may fetch stale instructions when software depends on
+      // prefetch-speculation-protection instead of explicit synchronization.
+      //
+      // Neoverse-N1 implementation mitigates the errata 1542419 with a
+      // workaround:
+      // - Disable coherent icache.
+      // - Trap IC IVAU instructions.
+      // - Execute:
+      //   - tlbi vae3is, xzr
+      //   - dsb sy
+      // - Ignore trapped IC IVAU instructions.
+      //
+      // `tlbi vae3is, xzr` invalidates all translation entries (all VAs, all
+      // possible levels). It waits for all memory accesses using in-scope old
+      // translation information to complete before it is considered complete.
+      //
+      // As this workaround has significant overhead, Arm Neoverse N1 (MP050)
+      // Software Developer Errata Notice version 29.0 suggests:
+      //
+      // "Since one TLB inner-shareable invalidation is enough to avoid this
+      // erratum, the number of injected TLB invalidations should be minimized
+      // in the trap handler to mitigate the performance impact due to this
+      // workaround."
+      // As the address for icache invalidation is not relevant and
+      // IC IVAU instruction is ignored, we use XZR in it.
+      asm volatile(
+          "ic  ivau, xzr \n"
+          "dsb ish       \n"
+          :
+          :
+          : "memory");
+    } else {
+      assert(VM_Version::is_cache_dic_enabled(), "Expect CTR_EL0.DIC to be enabled");
+    }
+    asm volatile("isb" : : : "memory");
+  }
+
+  void set_has_modified_code() {
+    _has_modified_code = true;
+  }
+};
+
+#define PD_ICACHE_INVALIDATION_CONTEXT AArch64ICacheInvalidationContext
+
 #endif // OS_CPU_LINUX_AARCH64_ICACHE_AARCH64_HPP
diff --git a/src/hotspot/os_cpu/linux_aarch64/vm_version_linux_aarch64.cpp b/src/hotspot/os_cpu/linux_aarch64/vm_version_linux_aarch64.cpp
index 1fe06dc640d..dad7161a3cb 100644
--- a/src/hotspot/os_cpu/linux_aarch64/vm_version_linux_aarch64.cpp
+++ b/src/hotspot/os_cpu/linux_aarch64/vm_version_linux_aarch64.cpp
@@ -169,6 +169,8 @@ void VM_Version::get_os_cpu_info() {
 
   _icache_line_size = (1 << (ctr_el0 & 0x0f)) * 4;
   _dcache_line_size = (1 << ((ctr_el0 >> 16) & 0x0f)) * 4;
+  _cache_idc_enabled = ((ctr_el0 >> 28) & 0x1) != 0;
+  _cache_dic_enabled = ((ctr_el0 >> 29) & 0x1) != 0;
 
   if (!(dczid_el0 & 0x10)) {
     _zva_length = 4 << (dczid_el0 & 0xf);
diff --git a/src/hotspot/share/asm/codeBuffer.cpp b/src/hotspot/share/asm/codeBuffer.cpp
index ba525588f32..964aec8b501 100644
--- a/src/hotspot/share/asm/codeBuffer.cpp
+++ b/src/hotspot/share/asm/codeBuffer.cpp
@@ -745,9 +745,6 @@ void CodeBuffer::copy_code_to(CodeBlob* dest_blob) {
 
   // Done moving code bytes; were they the right size?
   assert((int)align_up(dest.total_content_size(), oopSize) == dest_blob->content_size(), "sanity");
-
-  // Flush generated code
-  ICache::invalidate_range(dest_blob->code_begin(), dest_blob->code_size());
 }
 
 // Move all my code into another code buffer.  Consult applicable
diff --git a/src/hotspot/share/code/codeBlob.cpp b/src/hotspot/share/code/codeBlob.cpp
index fcc0b42a461..d07386bd795 100644
--- a/src/hotspot/share/code/codeBlob.cpp
+++ b/src/hotspot/share/code/codeBlob.cpp
@@ -331,7 +331,13 @@ RuntimeBlob::RuntimeBlob(
   : CodeBlob(name, kind, cb, size, header_size, frame_complete, frame_size, oop_maps, caller_must_gc_arguments,
              align_up(cb->total_relocation_size(), oopSize))
 {
+  if (code_size() == 0) {
+    // Nothing to copy
+    return;
+  }
+
   cb->copy_code_and_locs_to(this);
+  ICache::invalidate_range(code_begin(), code_size());
 }
 
 void RuntimeBlob::free(RuntimeBlob* blob) {
diff --git a/src/hotspot/share/code/nmethod.cpp b/src/hotspot/share/code/nmethod.cpp
index 5a6ed8ab3ed..5cb795a4723 100644
--- a/src/hotspot/share/code/nmethod.cpp
+++ b/src/hotspot/share/code/nmethod.cpp
@@ -1328,6 +1328,7 @@ nmethod::nmethod(
     code_buffer->copy_values_to(this);
 
     post_init();
+    ICache::invalidate_range(code_begin(), code_size());
   }
 
   if (PrintNativeNMethods || PrintDebugInfo || PrintRelocations || PrintDependencies) {
@@ -1809,6 +1810,7 @@ nmethod::nmethod(
     init_immutable_data_ref_count();
 
     post_init();
+    ICache::invalidate_range(code_begin(), code_size());
 
     // we use the information of entry points to find out if a method is
     // static or non static
@@ -2036,7 +2038,7 @@ void nmethod::copy_values(GrowableArray<jobject>* array) {
   // The code and relocations have already been initialized by the
   // CodeBlob constructor, so it is valid even at this early point to
   // iterate over relocations and patch the code.
-  fix_oop_relocations(nullptr, nullptr, /*initialize_immediates=*/ true);
+  fix_oop_relocations(/*initialize_immediates=*/ true);
 }
 
 void nmethod::copy_values(GrowableArray<Metadata*>* array) {
@@ -2048,24 +2050,42 @@ void nmethod::copy_values(GrowableArray<Metadata*>* array) {
   }
 }
 
-void nmethod::fix_oop_relocations(address begin, address end, bool initialize_immediates) {
+bool nmethod::fix_oop_relocations(bool initialize_immediates) {
   // re-patch all oop-bearing instructions, just in case some oops moved
-  RelocIterator iter(this, begin, end);
+  RelocIterator iter(this);
+  bool modified_code = false;
   while (iter.next()) {
     if (iter.type() == relocInfo::oop_type) {
       oop_Relocation* reloc = iter.oop_reloc();
-      if (initialize_immediates && reloc->oop_is_immediate()) {
+      if (!reloc->oop_is_immediate()) {
+        // Refresh the oop-related bits of this instruction.
+        reloc->set_value(reloc->value());
+        modified_code = true;
+      } else if (initialize_immediates) {
         oop* dest = reloc->oop_addr();
         jobject obj = *reinterpret_cast<jobject*>(dest);
         initialize_immediate_oop(dest, obj);
       }
-      // Refresh the oop-related bits of this instruction.
-      reloc->fix_oop_relocation();
     } else if (iter.type() == relocInfo::metadata_type) {
       metadata_Relocation* reloc = iter.metadata_reloc();
       reloc->fix_metadata_relocation();
+      modified_code |= !reloc->metadata_is_immediate();
     }
   }
+  return modified_code;
+}
+
+void nmethod::fix_oop_relocations() {
+  ICacheInvalidationContext icic;
+  fix_oop_relocations(&icic);
+}
+
+void nmethod::fix_oop_relocations(ICacheInvalidationContext* icic) {
+  assert(icic != nullptr, "must provide context to track if code was modified");
+  bool modified_code = fix_oop_relocations(/*initialize_immediates=*/ false);
+  if (modified_code) {
+    icic->set_has_modified_code();
+  }
 }
 
 static void install_post_call_nop_displacement(nmethod* nm, address pc) {
diff --git a/src/hotspot/share/code/nmethod.hpp b/src/hotspot/share/code/nmethod.hpp
index 092da181f12..ea8c0e2ad5d 100644
--- a/src/hotspot/share/code/nmethod.hpp
+++ b/src/hotspot/share/code/nmethod.hpp
@@ -41,6 +41,7 @@ class Dependencies;
 class DirectiveSet;
 class DebugInformationRecorder;
 class ExceptionHandlerTable;
+class ICacheInvalidationContext;
 class ImplicitExceptionTable;
 class JvmtiThreadState;
 class MetadataClosure;
@@ -801,15 +802,15 @@ public:
 
   // Relocation support
 private:
-  void fix_oop_relocations(address begin, address end, bool initialize_immediates);
+  bool fix_oop_relocations(bool initialize_immediates);
   inline void initialize_immediate_oop(oop* dest, jobject handle);
 
 protected:
   address oops_reloc_begin() const;
 
 public:
-  void fix_oop_relocations(address begin, address end) { fix_oop_relocations(begin, end, false); }
-  void fix_oop_relocations()                           { fix_oop_relocations(nullptr, nullptr, false); }
+  void fix_oop_relocations(ICacheInvalidationContext* icic);
+  void fix_oop_relocations();
 
   bool is_at_poll_return(address pc);
   bool is_at_poll_or_poll_return(address pc);
diff --git a/src/hotspot/share/code/relocInfo.cpp b/src/hotspot/share/code/relocInfo.cpp
index 2a6335e2118..25d91edc20f 100644
--- a/src/hotspot/share/code/relocInfo.cpp
+++ b/src/hotspot/share/code/relocInfo.cpp
@@ -590,15 +590,6 @@ oop oop_Relocation::oop_value() {
   return *oop_addr();
 }
 
-
-void oop_Relocation::fix_oop_relocation() {
-  if (!oop_is_immediate()) {
-    // get the oop from the pool, and re-insert it into the instruction:
-    set_value(value());
-  }
-}
-
-
 void oop_Relocation::verify_oop_relocation() {
   if (!oop_is_immediate()) {
     // get the oop from the pool, and re-insert it into the instruction:
diff --git a/src/hotspot/share/code/relocInfo.hpp b/src/hotspot/share/code/relocInfo.hpp
index 6f1778ef479..bb2b2b5693f 100644
--- a/src/hotspot/share/code/relocInfo.hpp
+++ b/src/hotspot/share/code/relocInfo.hpp
@@ -988,8 +988,6 @@ class oop_Relocation : public DataRelocation {
   void pack_data_to(CodeSection* dest) override;
   void unpack_data() override;
 
-  void fix_oop_relocation();        // reasserts oop value
-
   void verify_oop_relocation();
 
   address value() override { return *reinterpret_cast<address*>(oop_addr()); }
diff --git a/src/hotspot/share/gc/z/zBarrierSetNMethod.cpp b/src/hotspot/share/gc/z/zBarrierSetNMethod.cpp
index d80ce4e149d..a439b3a167b 100644
--- a/src/hotspot/share/gc/z/zBarrierSetNMethod.cpp
+++ b/src/hotspot/share/gc/z/zBarrierSetNMethod.cpp
@@ -33,6 +33,7 @@
 #include "gc/z/zThreadLocalData.hpp"
 #include "gc/z/zUncoloredRoot.inline.hpp"
 #include "logging/log.hpp"
+#include "runtime/icache.hpp"
 #include "runtime/threadWXSetters.inline.hpp"
 
 bool ZBarrierSetNMethod::nmethod_entry_barrier(nmethod* nm) {
@@ -70,12 +71,15 @@ bool ZBarrierSetNMethod::nmethod_entry_barrier(nmethod* nm) {
     return false;
   }
 
-  // Heal barriers
-  ZNMethod::nmethod_patch_barriers(nm);
+  {
+    ICacheInvalidationContext icic;
+    // Heal barriers
+    ZNMethod::nmethod_patch_barriers(nm, &icic);
 
-  // Heal oops
-  ZUncoloredRootProcessWeakOopClosure cl(ZNMethod::color(nm));
-  ZNMethod::nmethod_oops_do_inner(nm, &cl);
+    // Heal oops
+    ZUncoloredRootProcessWeakOopClosure cl(ZNMethod::color(nm));
+    ZNMethod::nmethod_oops_do_inner(nm, &cl, &icic);
+  }
 
   const uintptr_t prev_color = ZNMethod::color(nm);
   const uintptr_t new_color = *ZPointerStoreGoodMaskLowOrderBitsAddr;
diff --git a/src/hotspot/share/gc/z/zGeneration.cpp b/src/hotspot/share/gc/z/zGeneration.cpp
index 27f352a624f..0f9f4e34a5e 100644
--- a/src/hotspot/share/gc/z/zGeneration.cpp
+++ b/src/hotspot/share/gc/z/zGeneration.cpp
@@ -58,6 +58,7 @@
 #include "prims/jvmtiTagMap.hpp"
 #include "runtime/continuation.hpp"
 #include "runtime/handshake.hpp"
+#include "runtime/icache.hpp"
 #include "runtime/safepoint.hpp"
 #include "runtime/threads.hpp"
 #include "runtime/vmOperations.hpp"
@@ -1434,12 +1435,15 @@ public:
   virtual void do_nmethod(nmethod* nm) {
     ZLocker<ZReentrantLock> locker(ZNMethod::lock_for_nmethod(nm));
     if (_bs_nm->is_armed(nm)) {
-      // Heal barriers
-      ZNMethod::nmethod_patch_barriers(nm);
+      {
+        ICacheInvalidationContext icic;
+        // Heal barriers
+        ZNMethod::nmethod_patch_barriers(nm, &icic);
 
-      // Heal oops
-      ZUncoloredRootProcessOopClosure cl(ZNMethod::color(nm));
-      ZNMethod::nmethod_oops_do_inner(nm, &cl);
+        // Heal oops
+        ZUncoloredRootProcessOopClosure cl(ZNMethod::color(nm));
+        ZNMethod::nmethod_oops_do_inner(nm, &cl, &icic);
+      }
 
       log_trace(gc, nmethod)("nmethod: " PTR_FORMAT " visited by old remapping", p2i(nm));
 
diff --git a/src/hotspot/share/gc/z/zMark.cpp b/src/hotspot/share/gc/z/zMark.cpp
index 03701ae9998..ac7d86db240 100644
--- a/src/hotspot/share/gc/z/zMark.cpp
+++ b/src/hotspot/share/gc/z/zMark.cpp
@@ -59,6 +59,7 @@
 #include "oops/oop.inline.hpp"
 #include "runtime/continuation.hpp"
 #include "runtime/handshake.hpp"
+#include "runtime/icache.hpp"
 #include "runtime/javaThread.hpp"
 #include "runtime/prefetch.inline.hpp"
 #include "runtime/safepointMechanism.hpp"
@@ -718,12 +719,15 @@ public:
   virtual void do_nmethod(nmethod* nm) {
     ZLocker<ZReentrantLock> locker(ZNMethod::lock_for_nmethod(nm));
     if (_bs_nm->is_armed(nm)) {
-      // Heal barriers
-      ZNMethod::nmethod_patch_barriers(nm);
+      {
+         ICacheInvalidationContext icic;
+         // Heal barriers
+         ZNMethod::nmethod_patch_barriers(nm, &icic);
 
-      // Heal oops
-      ZUncoloredRootMarkOopClosure cl(ZNMethod::color(nm));
-      ZNMethod::nmethod_oops_do_inner(nm, &cl);
+         // Heal oops
+         ZUncoloredRootMarkOopClosure cl(ZNMethod::color(nm));
+         ZNMethod::nmethod_oops_do_inner(nm, &cl, &icic);
+      }
 
       // CodeCache unloading support
       nm->mark_as_maybe_on_stack();
@@ -753,10 +757,6 @@ public:
     if (_bs_nm->is_armed(nm)) {
       const uintptr_t prev_color = ZNMethod::color(nm);
 
-      // Heal oops
-      ZUncoloredRootMarkYoungOopClosure cl(prev_color);
-      ZNMethod::nmethod_oops_do_inner(nm, &cl);
-
       // Disarm only the young marking, not any potential old marking cycle
 
       const uintptr_t old_marked_mask = ZPointerMarkedMask ^ (ZPointerMarkedYoung0 | ZPointerMarkedYoung1);
@@ -767,9 +767,16 @@ public:
       // Check if disarming for young mark, completely disarms the nmethod entry barrier
       const bool complete_disarm = ZPointer::is_store_good(new_disarm_value_ptr);
 
-      if (complete_disarm) {
-        // We are about to completely disarm the nmethod, must take responsibility to patch all barriers before disarming
-        ZNMethod::nmethod_patch_barriers(nm);
+      {
+        ICacheInvalidationContext icic;
+        if (complete_disarm) {
+          // We are about to completely disarm the nmethod, must take responsibility to patch all barriers before disarming
+          ZNMethod::nmethod_patch_barriers(nm, &icic);
+        }
+
+        // Heal oops
+        ZUncoloredRootMarkYoungOopClosure cl(prev_color);
+        ZNMethod::nmethod_oops_do_inner(nm, &cl, &icic);
       }
 
       _bs_nm->guard_with(nm, (int)untype(new_disarm_value_ptr));
diff --git a/src/hotspot/share/gc/z/zNMethod.cpp b/src/hotspot/share/gc/z/zNMethod.cpp
index 780bc9e3bf7..a1348b63b6f 100644
--- a/src/hotspot/share/gc/z/zNMethod.cpp
+++ b/src/hotspot/share/gc/z/zNMethod.cpp
@@ -50,6 +50,7 @@
 #include "oops/oop.inline.hpp"
 #include "runtime/atomicAccess.hpp"
 #include "runtime/continuation.hpp"
+#include "runtime/icache.hpp"
 #include "utilities/debug.hpp"
 
 static ZNMethodData* gc_data(const nmethod* nm) {
@@ -245,8 +246,16 @@ void ZNMethod::set_guard_value(nmethod* nm, int value) {
 }
 
 void ZNMethod::nmethod_patch_barriers(nmethod* nm) {
+  ICacheInvalidationContext icic;
+  nmethod_patch_barriers(nm, &icic);
+}
+
+void ZNMethod::nmethod_patch_barriers(nmethod* nm, ICacheInvalidationContext* icic) {
   ZBarrierSetAssembler* const bs_asm = ZBarrierSet::assembler();
   ZArrayIterator<ZNMethodDataBarrier> iter(gc_data(nm)->barriers());
+  if (gc_data(nm)->barriers()->is_nonempty()) {
+    icic->set_has_modified_code();
+  }
   for (ZNMethodDataBarrier barrier; iter.next(&barrier);) {
     bs_asm->patch_barrier_relocation(barrier._reloc_addr, barrier._reloc_format);
   }
@@ -258,6 +267,11 @@ void ZNMethod::nmethod_oops_do(nmethod* nm, OopClosure* cl) {
 }
 
 void ZNMethod::nmethod_oops_do_inner(nmethod* nm, OopClosure* cl) {
+  ICacheInvalidationContext icic;
+  nmethod_oops_do_inner(nm, cl, &icic);
+}
+
+void ZNMethod::nmethod_oops_do_inner(nmethod* nm, OopClosure* cl, ICacheInvalidationContext* icic) {
   // Process oops table
   {
     oop* const begin = nm->oops_begin();
@@ -283,7 +297,7 @@ void ZNMethod::nmethod_oops_do_inner(nmethod* nm, OopClosure* cl) {
 
   // Process non-immediate oops
   if (data->has_non_immediate_oops()) {
-    nm->fix_oop_relocations();
+    nm->fix_oop_relocations(icic);
   }
 }
 
diff --git a/src/hotspot/share/gc/z/zNMethod.hpp b/src/hotspot/share/gc/z/zNMethod.hpp
index 865ea11e7b9..2779151c576 100644
--- a/src/hotspot/share/gc/z/zNMethod.hpp
+++ b/src/hotspot/share/gc/z/zNMethod.hpp
@@ -56,9 +56,11 @@ public:
   static void set_guard_value(nmethod* nm, int value);
 
   static void nmethod_patch_barriers(nmethod* nm);
+  static void nmethod_patch_barriers(nmethod* nm, ICacheInvalidationContext* icic);
 
   static void nmethod_oops_do(nmethod* nm, OopClosure* cl);
   static void nmethod_oops_do_inner(nmethod* nm, OopClosure* cl);
+  static void nmethod_oops_do_inner(nmethod* nm, OopClosure* cl, ICacheInvalidationContext* icic);
 
   static void nmethods_do_begin(bool secondary);
   static void nmethods_do_end(bool secondary);
diff --git a/src/hotspot/share/runtime/globals.hpp b/src/hotspot/share/runtime/globals.hpp
index 60feddde09b..296c5dedf8a 100644
--- a/src/hotspot/share/runtime/globals.hpp
+++ b/src/hotspot/share/runtime/globals.hpp
@@ -1978,6 +1978,8 @@ const int ObjectAlignmentInBytes = 8;
   develop(uint, BinarySearchThreshold, 16,                                  \
           "Minimal number of elements in a sorted collection to prefer"     \
           "binary search over simple linear search." )                      \
+  product(bool, UseSingleICacheInvalidation, false, DIAGNOSTIC,             \
+          "Defer multiple ICache invalidation to single invalidation")      \
                                                                             \
 
 // end of RUNTIME_FLAGS
diff --git a/src/hotspot/share/runtime/icache.hpp b/src/hotspot/share/runtime/icache.hpp
index bc153862323..692a876d9a6 100644
--- a/src/hotspot/share/runtime/icache.hpp
+++ b/src/hotspot/share/runtime/icache.hpp
@@ -129,4 +129,27 @@ class ICacheStubGenerator : public StubCodeGenerator {
   void generate_icache_flush(ICache::flush_icache_stub_t* flush_icache_stub);
 };
 
+class DefaultICacheInvalidationContext : StackObj {
+ public:
+  NONCOPYABLE(DefaultICacheInvalidationContext);
+
+  DefaultICacheInvalidationContext() {}
+
+  ~DefaultICacheInvalidationContext() {}
+
+  void set_has_modified_code() {}
+};
+
+#ifndef PD_ICACHE_INVALIDATION_CONTEXT
+#define PD_ICACHE_INVALIDATION_CONTEXT DefaultICacheInvalidationContext
+#endif // PD_ICACHE_INVALIDATION_CONTEXT
+
+class ICacheInvalidationContext final : public PD_ICACHE_INVALIDATION_CONTEXT {
+ private:
+  NONCOPYABLE(ICacheInvalidationContext);
+
+ public:
+  using PD_ICACHE_INVALIDATION_CONTEXT::PD_ICACHE_INVALIDATION_CONTEXT;
+};
+
 #endif // SHARE_RUNTIME_ICACHE_HPP
diff --git a/test/hotspot/jtreg/compiler/runtime/TestDeferredICacheInvalidationCmdOptions.java b/test/hotspot/jtreg/compiler/runtime/TestDeferredICacheInvalidationCmdOptions.java
new file mode 100644
index 00000000000..8bc74be5c62
--- /dev/null
+++ b/test/hotspot/jtreg/compiler/runtime/TestDeferredICacheInvalidationCmdOptions.java
@@ -0,0 +1,426 @@
+/*
+ * Copyright Amazon.com Inc. or its affiliates. All Rights Reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ *
+ */
+
+package compiler.runtime;
+
+import jdk.test.lib.process.OutputAnalyzer;
+import jdk.test.lib.process.ProcessTools;
+import jdk.test.whitebox.WhiteBox;
+import jtreg.SkippedException;
+
+/*
+ * @test
+ * @bug 8370947
+ * @summary Test command-line options for UseSingleICacheInvalidation and NeoverseN1ICacheErratumMitigation
+ * @library /test/lib
+ * @requires os.arch == "aarch64"
+ * @requires os.family == "linux"
+ * @build jdk.test.whitebox.WhiteBox
+ * @run driver jdk.test.lib.helpers.ClassFileInstaller jdk.test.whitebox.WhiteBox
+ * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions -XX:+WhiteBoxAPI compiler.runtime.TestDeferredICacheInvalidationCmdOptions
+ */
+
+public class TestDeferredICacheInvalidationCmdOptions {
+
+    // CPU identifiers
+    private static final int CPU_ARM = 0x41;
+    private static final int NEOVERSE_N1_MODEL = 0xd0c;
+
+    private static boolean isAffected;
+
+    public static void main(String[] args) throws Exception {
+        // Parse CPU features and print CPU info
+        parseCPUFeatures();
+
+        System.out.println("Testing UseSingleICacheInvalidation and NeoverseN1ICacheErratumMitigation command-line options...");
+
+        // Test case 1: Check defaults on Neoverse N1 pre-r4p1 (if applicable)
+        testCase1_DefaultsOnNeoverseN1();
+
+        // Test case 2: Check NeoverseN1ICacheErratumMitigation is false on unaffected CPUs
+        testCase2_DefaultsOnUnaffectedCPUs();
+
+        // Test case 3: Check if NeoverseN1ICacheErratumMitigation is set to false on affected CPUs,
+        //             UseSingleICacheInvalidation is also set to false
+        testCase3_ExplicitlyDisableErrataAffectsDeferred();
+
+        // Test case 4: Check JVM error if UseSingleICacheInvalidation=true
+        //             but NeoverseN1ICacheErratumMitigation=false on affected CPUs
+        testCase4_ConflictingFlagsOnAffectedCPUs();
+
+        // Test case 5: Check explicit NeoverseN1ICacheErratumMitigation=true enables UseSingleICacheInvalidation
+        testCase5_ExplicitlyEnableErrataEnablesDeferred();
+
+        // Test case 6: Check both flags can be explicitly set to false
+        testCase6_ExplicitlyDisableBothFlags();
+
+        // Test case 7: Check UseSingleICacheInvalidation=false with NeoverseN1ICacheErratumMitigation=true
+        testCase7_ConflictingErrataWithoutDeferred();
+
+        // Test case 8: Check setting NeoverseN1ICacheErratumMitigation=true on unaffected CPU causes an error
+        testCase8_EnablingErrataOnUnaffectedCPU();
+
+        System.out.println("All test cases passed!");
+    }
+
+    /**
+     * Parse CPU features string from WhiteBox.getCPUFeatures() to extract:
+     * - cpuFamily: 0x41 for ARM
+     * - cpuVariant: major revision
+     * - cpuModel: e.g., 0xd0c for Neoverse N1
+     * - cpuRevision: minor revision
+     * - cpuModel2: secondary model (if present, in parentheses)
+     *
+     * Sets the static field isAffected and prints CPU info.
+     *
+     * Format: 0x%02x:0x%x:0x%03x:%d[(0x%03x)]
+     * Example: "0x41:0x3:0xd0c:0" or "0x41:0x3:0xd0c:0(0xd0c)"
+     *
+     * @throws SkippedException if not running on ARM CPU
+     */
+    private static void parseCPUFeatures() {
+        WhiteBox wb = WhiteBox.getWhiteBox();
+        String cpuFeatures = wb.getCPUFeatures();
+        System.out.println("CPU Features string: " + cpuFeatures);
+
+        if (cpuFeatures == null || cpuFeatures.isEmpty()) {
+            throw new RuntimeException("No CPU features available");
+        }
+
+        int commaIndex = cpuFeatures.indexOf(",");
+        if (commaIndex == -1) {
+            throw new RuntimeException("Unexpected CPU features format (no comma): " + cpuFeatures);
+        }
+
+        String cpuPart = cpuFeatures.substring(0, commaIndex).trim();
+
+        String[] parts = cpuPart.split(":");
+        if (parts.length < 4) {
+            throw new RuntimeException("Unexpected CPU features format: " + cpuPart);
+        }
+
+        int cpuFamily = Integer.parseInt(parts[0].substring(2), 16);
+        if (cpuFamily != CPU_ARM) {
+            throw new SkippedException("Not running on ARM CPU (cpuFamily=0x" + Integer.toHexString(cpuFamily) + ")");
+        }
+
+        int cpuVariant = Integer.parseInt(parts[1].substring(2), 16);
+        int cpuModel = Integer.parseInt(parts[2].substring(2), 16);
+        int cpuModel2 = 0;
+
+        int model2Start = parts[3].indexOf("(");
+        String revisionStr = parts[3];
+        if (model2Start != -1) {
+            if (!parts[3].endsWith(")")) {
+                throw new RuntimeException("Unexpected CPU features format (missing closing parenthesis): " + parts[3]);
+            }
+            String model2Str = parts[3].substring(model2Start + 1, parts[3].length() - 1);
+            cpuModel2 = Integer.parseInt(model2Str.substring(2), 16);
+            revisionStr = parts[3].substring(0, model2Start);
+        }
+        int cpuRevision = Integer.parseInt(revisionStr);
+
+        // Neoverse N1 errata 1542419 affects r3p0, r3p1 and r4p0.
+        // It is fixed in r4p1 and later revisions.
+        if (cpuModel == NEOVERSE_N1_MODEL || cpuModel2 == NEOVERSE_N1_MODEL) {
+            isAffected = (cpuVariant == 3 && cpuRevision == 0) ||
+                         (cpuVariant == 3 && cpuRevision == 1) ||
+                         (cpuVariant == 4 && cpuRevision == 0);
+        }
+
+        printCPUInfo(cpuFamily, cpuVariant, cpuModel, cpuModel2, cpuRevision);
+    }
+
+    private static void printCPUInfo(int cpuFamily, int cpuVariant, int cpuModel, int cpuModel2, int cpuRevision) {
+        boolean isNeoverseN1 = (cpuFamily == CPU_ARM) &&
+                               (cpuModel == NEOVERSE_N1_MODEL || cpuModel2 == NEOVERSE_N1_MODEL);
+        System.out.println("\n=== CPU Information ===");
+        System.out.println("CPU Family: 0x" + Integer.toHexString(cpuFamily));
+        System.out.println("CPU Variant: 0x" + Integer.toHexString(cpuVariant));
+        System.out.println("CPU Model: 0x" + Integer.toHexString(cpuModel));
+        if (cpuModel2 != 0) {
+            System.out.println("CPU Model2: 0x" + Integer.toHexString(cpuModel2));
+        }
+        System.out.println("CPU Revision: " + cpuRevision);
+        System.out.println("Is Neoverse N1: " + isNeoverseN1);
+        System.out.println("Is affected by errata 1542419: " + isAffected);
+        System.out.println("======================\n");
+    }
+
+    /**
+     * Test case 1: Check the UseSingleICacheInvalidation and NeoverseN1ICacheErratumMitigation
+     * are set to true for Neoverse N1 pre-r4p1.
+     */
+    private static void testCase1_DefaultsOnNeoverseN1() throws Exception {
+        if (!isAffected) {
+            System.out.println("\nTest case 1: Skipping since CPU is not affected by Neoverse N1 errata 1542419");
+            return;
+        }
+
+        System.out.println("\nTest case 1: Check defaults on Neoverse N1 affected revisions");
+
+        ProcessBuilder pb = ProcessTools.createTestJavaProcessBuilder(
+            "-XX:+UnlockDiagnosticVMOptions",
+            "-XX:+PrintFlagsFinal",
+            "-version");
+
+        OutputAnalyzer output = new OutputAnalyzer(pb.start());
+        output.shouldHaveExitValue(0);
+
+        String output_str = output.getOutput();
+        boolean hasSingleEnabled = output_str.matches("(?s).*bool\\s+UseSingleICacheInvalidation\\s*=\\s*true.*");
+        boolean hasErrataEnabled = output_str.matches("(?s).*bool\\s+NeoverseN1ICacheErratumMitigation\\s*=\\s*true.*");
+
+        System.out.println("UseSingleICacheInvalidation enabled: " + hasSingleEnabled);
+        System.out.println("NeoverseN1ICacheErratumMitigation enabled: " + hasErrataEnabled);
+
+        // If running on affected Neoverse N1, both should be true
+        if (!hasSingleEnabled || !hasErrataEnabled) {
+            throw new RuntimeException("On affected Neoverse N1, both flags should be enabled by default");
+        }
+        System.out.println("Correctly enabled on affected Neoverse N1");
+    }
+
+    /**
+     * Test case 2: Check NeoverseN1ICacheErratumMitigation is false on unaffected CPUs.
+     */
+    private static void testCase2_DefaultsOnUnaffectedCPUs() throws Exception {
+        if (isAffected) {
+            System.out.println("\nTest case 2: Skipping since CPU is affected by Neoverse N1 errata 1542419");
+            return;
+        }
+
+        System.out.println("\nTest case 2: Check NeoverseN1ICacheErratumMitigation is false on unaffected CPUs");
+
+        ProcessBuilder pb = ProcessTools.createTestJavaProcessBuilder(
+            "-XX:+UnlockDiagnosticVMOptions",
+            "-XX:+PrintFlagsFinal",
+            "-version");
+
+        OutputAnalyzer output = new OutputAnalyzer(pb.start());
+        output.shouldHaveExitValue(0);
+
+        String output_str = output.getOutput();
+        boolean hasErrataEnabled = output_str.matches("(?s).*bool\\s+NeoverseN1ICacheErratumMitigation\\s*=\\s*true.*");
+
+        System.out.println("NeoverseN1ICacheErratumMitigation enabled: " + hasErrataEnabled);
+
+        // On non-Neoverse N1 or unaffected Neoverse N1 CPUs, NeoverseN1ICacheErratumMitigation should be false
+        if (hasErrataEnabled) {
+            throw new RuntimeException("On unaffected CPUs, NeoverseN1ICacheErratumMitigation should be disabled");
+        }
+        System.out.println("Correctly disabled on unaffected CPU");
+    }
+
+    /**
+     * Test case 3: Check if NeoverseN1ICacheErratumMitigation is set to false via cmd on affected CPUs,
+     * UseSingleICacheInvalidation is set to false.
+     */
+    private static void testCase3_ExplicitlyDisableErrataAffectsDeferred() throws Exception {
+        if (!isAffected) {
+            System.out.println("\nTest case 3: Skipping since CPU is not affected by Neoverse N1 errata 1542419");
+            return;
+        }
+
+        System.out.println("\nTest case 3: Explicitly disable NeoverseN1ICacheErratumMitigation, check UseSingleICacheInvalidation");
+
+        ProcessBuilder pb = ProcessTools.createTestJavaProcessBuilder(
+            "-XX:+UnlockDiagnosticVMOptions",
+            "-XX:-NeoverseN1ICacheErratumMitigation",
+            "-XX:+PrintFlagsFinal",
+            "-version");
+
+        OutputAnalyzer output = new OutputAnalyzer(pb.start());
+        output.shouldHaveExitValue(0);
+
+        String output_str = output.getOutput();
+        boolean hasSingleDisabled = output_str.matches("(?s).*bool\\s+UseSingleICacheInvalidation\\s*=\\s*false.*");
+        boolean hasErrataDisabled = output_str.matches("(?s).*bool\\s+NeoverseN1ICacheErratumMitigation\\s*=\\s*false.*");
+
+        System.out.println("NeoverseN1ICacheErratumMitigation disabled: " + hasErrataDisabled);
+        System.out.println("UseSingleICacheInvalidation disabled: " + hasSingleDisabled);
+
+        if (!hasErrataDisabled) {
+            throw new RuntimeException("Failed to disable NeoverseN1ICacheErratumMitigation via command line");
+        }
+
+        // On affected CPUs, disabling errata should also disable UseSingleICacheInvalidation
+        if (!hasSingleDisabled) {
+            throw new RuntimeException("On affected CPU, disabling NeoverseN1ICacheErratumMitigation should also disable UseSingleICacheInvalidation");
+        }
+        System.out.println("Correctly synchronized on affected CPU");
+    }
+
+    /**
+     * Test case 4: Check JVM reports an error if UseSingleICacheInvalidation is set to true
+     * but NeoverseN1ICacheErratumMitigation is set to false on affected CPUs.
+     */
+    private static void testCase4_ConflictingFlagsOnAffectedCPUs() throws Exception {
+        if (!isAffected) {
+            System.out.println("\nTest case 4: Skipping since CPU is not affected by Neoverse N1 errata 1542419");
+            return;
+        }
+
+        System.out.println("\nTest case 4: Try to set UseSingleICacheInvalidation=true with NeoverseN1ICacheErratumMitigation=false");
+
+        ProcessBuilder pb = ProcessTools.createTestJavaProcessBuilder(
+            "-XX:+UnlockDiagnosticVMOptions",
+            "-XX:+UseSingleICacheInvalidation",
+            "-XX:-NeoverseN1ICacheErratumMitigation",
+            "-version");
+
+        OutputAnalyzer output = new OutputAnalyzer(pb.start());
+
+        if (output.getExitValue() == 0) {
+            throw new RuntimeException("On affected CPU, conflicting flags should cause error");
+        }
+        output.shouldContain("Error");
+        System.out.println("JVM correctly rejected conflicting flags on affected CPU");
+    }
+
+    /**
+     * Test case 5: Check explicit NeoverseN1ICacheErratumMitigation=true enables UseSingleICacheInvalidation.
+     */
+    private static void testCase5_ExplicitlyEnableErrataEnablesDeferred() throws Exception {
+        if (!isAffected) {
+            System.out.println("\nTest case 5: Skipping since CPU is not affected by Neoverse N1 errata 1542419");
+            return;
+        }
+
+        System.out.println("\nTest case 5: Explicitly enable NeoverseN1ICacheErratumMitigation, check UseSingleICacheInvalidation");
+
+        ProcessBuilder pb = ProcessTools.createTestJavaProcessBuilder(
+            "-XX:+UnlockDiagnosticVMOptions",
+            "-XX:+NeoverseN1ICacheErratumMitigation",
+            "-XX:+PrintFlagsFinal",
+            "-version");
+
+        OutputAnalyzer output = new OutputAnalyzer(pb.start());
+        output.shouldHaveExitValue(0);
+
+        String output_str = output.getOutput();
+        boolean hasSingleEnabled = output_str.matches("(?s).*bool\\s+UseSingleICacheInvalidation\\s*=\\s*true.*");
+        boolean hasErrataEnabled = output_str.matches("(?s).*bool\\s+NeoverseN1ICacheErratumMitigation\\s*=\\s*true.*");
+
+        System.out.println("NeoverseN1ICacheErratumMitigation enabled: " + hasErrataEnabled);
+        System.out.println("UseSingleICacheInvalidation enabled: " + hasSingleEnabled);
+
+        if (!hasErrataEnabled) {
+            throw new RuntimeException("Failed to enable NeoverseN1ICacheErratumMitigation via command line");
+        }
+
+        if (!hasSingleEnabled) {
+            throw new RuntimeException("On affected CPU, enabling NeoverseN1ICacheErratumMitigation should also enable UseSingleICacheInvalidation");
+        }
+        System.out.println("Correctly synchronized on affected CPU");
+    }
+
+    /**
+     * Test case 6: Check both flags can be explicitly set to false.
+     */
+    private static void testCase6_ExplicitlyDisableBothFlags() throws Exception {
+        System.out.println("\nTest case 6: Explicitly disable both flags");
+
+        ProcessBuilder pb = ProcessTools.createTestJavaProcessBuilder(
+            "-XX:+UnlockDiagnosticVMOptions",
+            "-XX:-UseSingleICacheInvalidation",
+            "-XX:-NeoverseN1ICacheErratumMitigation",
+            "-XX:+PrintFlagsFinal",
+            "-version");
+
+        OutputAnalyzer output = new OutputAnalyzer(pb.start());
+        output.shouldHaveExitValue(0);
+
+        String output_str = output.getOutput();
+        boolean hasSingleDisabled = output_str.matches("(?s).*bool\\s+UseSingleICacheInvalidation\\s*=\\s*false.*");
+        boolean hasErrataDisabled = output_str.matches("(?s).*bool\\s+NeoverseN1ICacheErratumMitigation\\s*=\\s*false.*");
+
+        System.out.println("UseSingleICacheInvalidation disabled: " + hasSingleDisabled);
+        System.out.println("NeoverseN1ICacheErratumMitigation disabled: " + hasErrataDisabled);
+
+        if (!hasErrataDisabled) {
+            throw new RuntimeException("Failed to disable NeoverseN1ICacheErratumMitigation via command line");
+        }
+
+        if (!hasSingleDisabled) {
+            throw new RuntimeException("Failed to disable UseSingleICacheInvalidation via command line");
+        }
+
+        System.out.println("Successfully disabled both flags");
+    }
+
+    /**
+     * Test case 7: Check UseSingleICacheInvalidation=false with NeoverseN1ICacheErratumMitigation=true.
+     * On affected CPUs, this should error (conflicting requirement).
+     */
+    private static void testCase7_ConflictingErrataWithoutDeferred() throws Exception {
+        if (!isAffected) {
+            System.out.println("\nTest case 7: Skipping since CPU is not affected by Neoverse N1 errata 1542419");
+            return;
+        }
+        System.out.println("\nTest case 7: Try to set NeoverseN1ICacheErratumMitigation=true with UseSingleICacheInvalidation=false");
+
+        ProcessBuilder pb = ProcessTools.createTestJavaProcessBuilder(
+            "-XX:+UnlockDiagnosticVMOptions",
+            "-XX:-UseSingleICacheInvalidation",
+            "-XX:+NeoverseN1ICacheErratumMitigation",
+            "-XX:+PrintFlagsFinal",
+            "-version");
+
+        OutputAnalyzer output = new OutputAnalyzer(pb.start());
+
+        // This should fail on affected CPUs (conflicting requirement)
+        if (output.getExitValue() == 0) {
+            throw new RuntimeException("On affected CPU, setting NeoverseN1ICacheErratumMitigation=true with UseSingleICacheInvalidation=false should cause an error");
+        }
+        output.shouldContain("Error");
+        System.out.println("JVM correctly rejected conflicting flags on affected CPU");
+    }
+
+    /**
+     * Test case 8: Check setting NeoverseN1ICacheErratumMitigation=true on unaffected CPU causes an error.
+     */
+    private static void testCase8_EnablingErrataOnUnaffectedCPU() throws Exception {
+        if (isAffected) {
+            System.out.println("\nTest case 8: Skipping since CPU is affected by Neoverse N1 errata 1542419");
+            return;
+        }
+
+        System.out.println("\nTest case 8: Try to set NeoverseN1ICacheErratumMitigation=true on unaffected CPU");
+
+        ProcessBuilder pb = ProcessTools.createTestJavaProcessBuilder(
+            "-XX:+UnlockDiagnosticVMOptions",
+            "-XX:+NeoverseN1ICacheErratumMitigation",
+            "-version");
+
+        OutputAnalyzer output = new OutputAnalyzer(pb.start());
+
+        // This should fail on unaffected CPUs (errata not present)
+        if (output.getExitValue() == 0) {
+            throw new RuntimeException("On unaffected CPU, setting NeoverseN1ICacheErratumMitigation=true should cause error");
+        }
+        output.shouldContain("Error");
+        System.out.println("JVM correctly rejected enabling errata flag on unaffected CPU");
+    }
+}
diff --git a/test/hotspot/jtreg/gc/TestDeferredICacheInvalidation.java b/test/hotspot/jtreg/gc/TestDeferredICacheInvalidation.java
new file mode 100644
index 00000000000..70cd1ab6d8c
--- /dev/null
+++ b/test/hotspot/jtreg/gc/TestDeferredICacheInvalidation.java
@@ -0,0 +1,306 @@
+/*
+ * Copyright Amazon.com Inc. or its affiliates. All Rights Reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ *
+ */
+
+package gc;
+
+/*
+ * @test id=parallel
+ * @bug 8370947
+ * @summary Check no assertion is triggered when UseSingleICacheInvalidation is enabled for ParallelGC
+ * @library /test/lib
+ * @requires vm.debug
+ * @requires vm.gc.Parallel
+ * @build jdk.test.whitebox.WhiteBox
+ * @run driver jdk.test.lib.helpers.ClassFileInstaller jdk.test.whitebox.WhiteBox
+ * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions -XX:+WhiteBoxAPI -XX:+UseParallelGC -XX:-UseCodeCacheFlushing gc.TestDeferredICacheInvalidation youngGC C1
+ * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions -XX:+WhiteBoxAPI -XX:+UseParallelGC -XX:-UseCodeCacheFlushing gc.TestDeferredICacheInvalidation fullGC C1
+ * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions -XX:+WhiteBoxAPI -XX:+UseParallelGC -XX:-UseCodeCacheFlushing gc.TestDeferredICacheInvalidation youngGC C2
+ * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions -XX:+WhiteBoxAPI -XX:+UseParallelGC -XX:-UseCodeCacheFlushing gc.TestDeferredICacheInvalidation fullGC C2
+ */
+
+/*
+ * @test id=g1
+ * @bug 8370947
+ * @summary Check no assertion is triggered when UseSingleICacheInvalidation is enabled for G1GC
+ * @library /test/lib
+ * @requires vm.debug
+ * @requires vm.gc.G1
+ * @build jdk.test.whitebox.WhiteBox
+ * @run driver jdk.test.lib.helpers.ClassFileInstaller jdk.test.whitebox.WhiteBox
+ * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions -XX:+WhiteBoxAPI -XX:+UseG1GC -XX:-UseCodeCacheFlushing gc.TestDeferredICacheInvalidation youngGC C1
+ * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions -XX:+WhiteBoxAPI -XX:+UseG1GC -XX:-UseCodeCacheFlushing gc.TestDeferredICacheInvalidation fullGC C1
+ * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions -XX:+WhiteBoxAPI -XX:+UseG1GC -XX:-UseCodeCacheFlushing gc.TestDeferredICacheInvalidation youngGC C2
+ * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions -XX:+WhiteBoxAPI -XX:+UseG1GC -XX:-UseCodeCacheFlushing gc.TestDeferredICacheInvalidation fullGC C2
+ */
+
+/*
+ * @test id=shenandoah
+ * @bug 8370947
+ * @summary Check no assertion is triggered when UseSingleICacheInvalidation is enabled for ShenandoahGC
+ * @library /test/lib
+ * @requires vm.debug
+ * @requires vm.gc.Shenandoah
+ * @build jdk.test.whitebox.WhiteBox
+ * @run driver jdk.test.lib.helpers.ClassFileInstaller jdk.test.whitebox.WhiteBox
+ * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions -XX:+WhiteBoxAPI -XX:+UseShenandoahGC -XX:-UseCodeCacheFlushing gc.TestDeferredICacheInvalidation fullGC C1
+ * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions -XX:+WhiteBoxAPI -XX:+UseShenandoahGC -XX:-UseCodeCacheFlushing gc.TestDeferredICacheInvalidation fullGC C2
+ */
+
+/*
+ * @test id=genshen
+ * @bug 8370947
+ * @summary Check no assertion is triggered when UseSingleICacheInvalidation is enabled for generational ShenandoahGC
+ * @library /test/lib
+ * @requires vm.debug
+ * @requires vm.gc.Shenandoah
+ * @build jdk.test.whitebox.WhiteBox
+ * @run driver jdk.test.lib.helpers.ClassFileInstaller jdk.test.whitebox.WhiteBox
+ * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions -XX:+WhiteBoxAPI -XX:+UseShenandoahGC -XX:+UnlockExperimentalVMOptions -XX:ShenandoahGCMode=generational -XX:-UseCodeCacheFlushing gc.TestDeferredICacheInvalidation youngGC C1
+ * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions -XX:+WhiteBoxAPI -XX:+UseShenandoahGC -XX:+UnlockExperimentalVMOptions -XX:ShenandoahGCMode=generational -XX:-UseCodeCacheFlushing gc.TestDeferredICacheInvalidation fullGC C1
+ * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions -XX:+WhiteBoxAPI -XX:+UseShenandoahGC -XX:+UnlockExperimentalVMOptions -XX:ShenandoahGCMode=generational -XX:-UseCodeCacheFlushing gc.TestDeferredICacheInvalidation youngGC C2
+ * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions -XX:+WhiteBoxAPI -XX:+UseShenandoahGC -XX:+UnlockExperimentalVMOptions -XX:ShenandoahGCMode=generational -XX:-UseCodeCacheFlushing gc.TestDeferredICacheInvalidation fullGC C2
+ */
+
+/*
+ * @test id=z
+ * @bug 8370947
+ * @summary Check no assertion is triggered when UseSingleICacheInvalidation is enabled for ZGC
+ * @library /test/lib
+ * @requires vm.debug
+ * @requires vm.gc.Z
+ * @build jdk.test.whitebox.WhiteBox
+ * @run driver jdk.test.lib.helpers.ClassFileInstaller jdk.test.whitebox.WhiteBox
+ * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions -XX:+WhiteBoxAPI -XX:+UseZGC -XX:-UseCodeCacheFlushing gc.TestDeferredICacheInvalidation youngGC C1
+ * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions -XX:+WhiteBoxAPI -XX:+UseZGC -XX:-UseCodeCacheFlushing gc.TestDeferredICacheInvalidation fullGC C1
+ * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions -XX:+WhiteBoxAPI -XX:+UseZGC -XX:-UseCodeCacheFlushing gc.TestDeferredICacheInvalidation youngGC C2
+ * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions -XX:+WhiteBoxAPI -XX:+UseZGC -XX:-UseCodeCacheFlushing gc.TestDeferredICacheInvalidation fullGC C2
+ */
+
+/*
+ * Nmethods have GC barriers and OOPs embedded into their code. GCs can patch nmethod's code
+ * which requires icache invalidation. Doing invalidation per instruction can be expensive.
+ * CPU can support hardware dcache and icache coherence. This would allow to defer cache
+ * invalidation.
+ *
+ * There are assertions for deferred cache invalidation. This test checks that all of them
+ * are passed.
+ */
+
+import java.util.concurrent.atomic.AtomicBoolean;
+import java.util.concurrent.locks.ReentrantReadWriteLock;
+
+import jdk.test.whitebox.WhiteBox;
+
+public class TestDeferredICacheInvalidation {
+
+    private static final WhiteBox WB = WhiteBox.getWhiteBox();
+
+    public static class A {
+        public String s1;
+        public String s2;
+        public String s3;
+        public String s4;
+        public String s5;
+        public String s6;
+        public String s7;
+        public String s8;
+        public String s9;
+    }
+
+    public static A a = new A();
+
+    private static int compLevel;
+
+    public static class B {
+        public static void test0() {
+        }
+
+        public static void test1() {
+            a.s1 = a.s1 + "1";
+        }
+
+        public static void test2() {
+            a.s1 = a.s1 + "1";
+            a.s2 = a.s2 + "2";
+        }
+
+        public static void test3() {
+            a.s1 = a.s1 + "1";
+            a.s2 = a.s2 + "2";
+            a.s3 = a.s3 + "3";
+        }
+
+        public static void test4() {
+            a.s1 = a.s1 + "1";
+            a.s2 = a.s2 + "2";
+            a.s3 = a.s3 + "3";
+            a.s4 = a.s4 + "4";
+        }
+
+        public static void test5() {
+            a.s1 = a.s1 + "1";
+            a.s2 = a.s2 + "2";
+            a.s3 = a.s3 + "3";
+            a.s4 = a.s4 + "4";
+            a.s5 = a.s5 + "5";
+        }
+
+        public static void test6() {
+            a.s1 = a.s1 + "1";
+            a.s2 = a.s2 + "2";
+            a.s3 = a.s3 + "3";
+            a.s4 = a.s4 + "4";
+            a.s5 = a.s5 + "5";
+            a.s6 = a.s6 + "6";
+        }
+
+        public static void test7() {
+            a.s1 = a.s1 + "1";
+            a.s2 = a.s2 + "2";
+            a.s3 = a.s3 + "3";
+            a.s4 = a.s4 + "4";
+            a.s5 = a.s5 + "5";
+            a.s6 = a.s6 + "6";
+            a.s7 = a.s7 + "7";
+        }
+
+        public static void test8() {
+            a.s1 = a.s1 + "1";
+            a.s2 = a.s2 + "2";
+            a.s3 = a.s3 + "3";
+            a.s4 = a.s4 + "4";
+            a.s5 = a.s5 + "5";
+            a.s6 = a.s6 + "6";
+            a.s7 = a.s7 + "7";
+            a.s8 = a.s8 + "8";
+        }
+
+        public static void test9() {
+            a.s1 = a.s1 + "1";
+            a.s2 = a.s2 + "2";
+            a.s3 = a.s3 + "3";
+            a.s4 = a.s4 + "4";
+            a.s5 = a.s5 + "5";
+            a.s6 = a.s6 + "6";
+            a.s7 = a.s7 + "7";
+            a.s8 = a.s8 + "8";
+            a.s9 = a.s9 + "9";
+        }
+    }
+
+    private static void compileMethods() throws Exception {
+        for (var m : B.class.getDeclaredMethods()) {
+            if (!m.getName().startsWith("test")) {
+                continue;
+            }
+            m.invoke(null);
+            WB.markMethodProfiled(m);
+            WB.enqueueMethodForCompilation(m, compLevel);
+            while (WB.isMethodQueuedForCompilation(m)) {
+                Thread.sleep(100);
+            }
+            if (WB.getMethodCompilationLevel(m) != compLevel) {
+                throw new IllegalStateException("Method " + m + " is not compiled at the compilation level: " + compLevel + ". Got: " + WB.getMethodCompilationLevel(m));
+            }
+        }
+    }
+
+    public static void youngGC() throws Exception {
+        a = null;
+        WB.youngGC();
+    }
+
+    public static void fullGC() throws Exception {
+        // Thread synchronization
+        final ReentrantReadWriteLock rwLock = new ReentrantReadWriteLock();
+        final ReentrantReadWriteLock.ReadLock readLock = rwLock.readLock();
+        final ReentrantReadWriteLock.WriteLock writeLock = rwLock.writeLock();
+        final AtomicBoolean running = new AtomicBoolean(true);
+
+        // Thread 1: GC thread that runs for 1 second with 100ms sleep intervals
+        Thread gcThread = new Thread(() -> {
+            final long startTime = System.currentTimeMillis();
+            final long duration = 1000;
+            try {
+                while (System.currentTimeMillis() - startTime < duration) {
+                    writeLock.lock();
+                    try {
+                        a = new A();
+                        WB.fullGC();
+                    } finally {
+                        writeLock.unlock();
+                    }
+                    Thread.sleep(100);
+                }
+            } catch (InterruptedException e) {
+                // Thread interrupted, exit
+            }
+            running.set(false);
+        });
+
+        // Threads 2-11: Test threads that execute test0() through test9()
+        Thread[] testThreads = new Thread[10];
+        for (int i = 0; i < 10; i++) {
+            final int testIdx = i;
+            testThreads[i] = new Thread(() -> {
+                try {
+                    var method = B.class.getDeclaredMethod("test" + testIdx);
+                    while (running.get()) {
+                        readLock.lock();
+                        try {
+                            method.invoke(null);
+                        } finally {
+                            readLock.unlock();
+                        }
+                    }
+                } catch (Exception e) {
+                    e.printStackTrace();
+                    System.exit(10);
+                }
+            });
+        }
+
+        // Start all threads
+        gcThread.start();
+        for (Thread t : testThreads) {
+            t.start();
+        }
+
+        // Wait for all threads to complete
+        gcThread.join();
+        for (Thread t : testThreads) {
+            t.join();
+        }
+    }
+
+    public static void main(String[] args) throws Exception {
+        if (!Boolean.TRUE.equals(WB.getBooleanVMFlag("UseSingleICacheInvalidation"))) {
+            System.out.println("Skip. Test requires UseSingleICacheInvalidation enabled.");
+            return;
+        }
+        compLevel = (args[1].equals("C1")) ? 1 : 4;
+        compileMethods();
+        TestDeferredICacheInvalidation.class.getMethod(args[0]).invoke(null);
+    }
+}
diff --git a/test/micro/org/openjdk/bench/vm/gc/GCPatchingNmethodCost.java b/test/micro/org/openjdk/bench/vm/gc/GCPatchingNmethodCost.java
new file mode 100644
index 00000000000..53fa2378ead
--- /dev/null
+++ b/test/micro/org/openjdk/bench/vm/gc/GCPatchingNmethodCost.java
@@ -0,0 +1,206 @@
+/*
+ * Copyright Amazon.com Inc. or its affiliates. All Rights Reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ *
+ */
+
+package org.openjdk.bench.vm.gc;
+
+import java.lang.reflect.Method;
+import java.util.*;
+import java.util.concurrent.TimeUnit;
+
+import org.openjdk.jmh.annotations.Benchmark;
+import org.openjdk.jmh.annotations.BenchmarkMode;
+import org.openjdk.jmh.annotations.CompilerControl;
+import org.openjdk.jmh.annotations.Fork;
+import org.openjdk.jmh.annotations.Level;
+import org.openjdk.jmh.annotations.Mode;
+import org.openjdk.jmh.annotations.Measurement;
+import org.openjdk.jmh.annotations.OutputTimeUnit;
+import org.openjdk.jmh.annotations.Param;
+import org.openjdk.jmh.annotations.Scope;
+import org.openjdk.jmh.annotations.Setup;
+import org.openjdk.jmh.annotations.State;
+import org.openjdk.jmh.annotations.Warmup;
+
+import org.openjdk.bench.util.InMemoryJavaCompiler;
+
+import jdk.test.whitebox.WhiteBox;
+import jdk.test.whitebox.code.NMethod;
+
+/*
+ * Nmethods have OOPs and GC barriers emmedded into their code.
+ * GCs patch them which causes invalidation of nmethods' code.
+ *
+ * This benchmark can be used to estimate the cost of patching
+ * OOPs and GC barriers.
+ *
+ * We create 5000 nmethods which access fields of a class.
+ * We measure the time of different GC cycles to see
+ * the impact of patching nmethods.
+ *
+ * The benchmark parameters are method count and accessed field count.
+ */
+
+@BenchmarkMode(Mode.SingleShotTime)
+@OutputTimeUnit(TimeUnit.MILLISECONDS)
+@State(Scope.Benchmark)
+@Fork(value = 1, jvmArgsAppend = {
+    "-XX:+UnlockDiagnosticVMOptions",
+    "-XX:+UnlockExperimentalVMOptions",
+    "-XX:+WhiteBoxAPI",
+    "-Xbootclasspath/a:lib-test/wb.jar",
+    "-XX:-UseCodeCacheFlushing"
+})
+@Warmup(iterations = 5)
+@Measurement(iterations = 5)
+public class GCPatchingNmethodCost {
+
+    private static final int COMP_LEVEL = 1;
+    private static final String FIELD_USER = "FieldUser";
+
+    public static Fields fields;
+
+    private static TestMethod[] methods = {};
+    private static byte[] BYTE_CODE;
+    private static WhiteBox WB;
+
+    @Param({"5000"})
+    public int methodCount;
+
+    @Param({"0", "2", "4", "8"})
+    public int accessedFieldCount;
+
+    public static class Fields {
+        public String f1;
+        public String f2;
+        public String f3;
+        public String f4;
+        public String f5;
+        public String f6;
+        public String f7;
+        public String f8;
+        public String f9;
+    }
+
+    private static final class TestMethod {
+        private final Method method;
+
+        public TestMethod(Method method) throws Exception {
+            this.method = method;
+            WB.testSetDontInlineMethod(method, true);
+        }
+
+        public void profile() throws Exception {
+            method.invoke(null);
+            WB.markMethodProfiled(method);
+        }
+
+        public void invoke() throws Exception {
+            method.invoke(null);
+        }
+
+        public void compile() throws Exception {
+            WB.enqueueMethodForCompilation(method, COMP_LEVEL);
+            while (WB.isMethodQueuedForCompilation(method)) {
+                Thread.onSpinWait();
+            }
+            if (WB.getMethodCompilationLevel(method) != COMP_LEVEL) {
+                throw new IllegalStateException("Method " + method + " is not compiled at the compilation level: " + COMP_LEVEL + ". Got: " + WB.getMethodCompilationLevel(method));
+            }
+        }
+
+        public NMethod getNMethod() {
+            return NMethod.get(method, false);
+        }
+    }
+
+    private static ClassLoader createClassLoader() {
+        return new ClassLoader() {
+            @Override
+            public Class<?> loadClass(String name) throws ClassNotFoundException {
+                if (!name.equals(FIELD_USER)) {
+                    return super.loadClass(name);
+                }
+
+                return defineClass(name, BYTE_CODE, 0, BYTE_CODE.length);
+            }
+        };
+    }
+
+    private static void createTestMethods(int accessedFieldCount, int count) throws Exception {
+        String javaCode = "public class " + FIELD_USER + " {";
+        String field = GCPatchingNmethodCost.class.getName() + ".fields.f";
+        javaCode += "public static void accessFields() {";
+        for (int i = 1; i <= accessedFieldCount; i++) {
+            javaCode += field + i + "= " + field + i + " + " + i + ";";
+        }
+        javaCode += "}}";
+
+        BYTE_CODE = InMemoryJavaCompiler.compile(FIELD_USER, javaCode);
+
+        fields = new Fields();
+
+        methods = new TestMethod[count];
+        for (int i = 0; i < count; i++) {
+            var cl = createClassLoader().loadClass(FIELD_USER);
+            Method method = cl.getMethod("accessFields");
+            methods[i] = new TestMethod(method);
+            methods[i].profile();
+            methods[i].compile();
+        }
+    }
+
+    private static void initWhiteBox() {
+        WB = WhiteBox.getWhiteBox();
+    }
+
+    @Setup(Level.Trial)
+    public void setupCodeCache() throws Exception {
+        initWhiteBox();
+        createTestMethods(accessedFieldCount, methodCount);
+        System.gc();
+    }
+
+    @Setup(Level.Iteration)
+    public void setupIteration() {
+        fields = new Fields();
+    }
+
+    @Benchmark
+    public void youngGC() throws Exception {
+        fields = null;
+        WB.youngGC();
+    }
+
+    @Benchmark
+    public void fullGC() throws Exception {
+        fields = null;
+        WB.fullGC();
+    }
+
+    @Benchmark
+    public void systemGC() throws Exception {
+        fields = null;
+        System.gc();
+    }
+}

From 46e6b26bf8c3124bf4e0c5d26c3eb04e220bd0cb Mon Sep 17 00:00:00 2001
From: Saranya Natarajan <snatarajan@openjdk.org>
Date: Wed, 25 Mar 2026 12:47:41 +0000
Subject: [PATCH 342/655] 8372646: C2: Stress Counted Loop creation

Reviewed-by: rcastanedalo, chagedorn, dfenacci
---
 src/hotspot/share/opto/c2_globals.hpp |  3 +++
 src/hotspot/share/opto/compile.cpp    | 12 +++++++++---
 src/hotspot/share/opto/loopnode.cpp   | 15 +++++++++++++--
 3 files changed, 25 insertions(+), 5 deletions(-)

diff --git a/src/hotspot/share/opto/c2_globals.hpp b/src/hotspot/share/opto/c2_globals.hpp
index e0833afa29d..a4f6d04f6a3 100644
--- a/src/hotspot/share/opto/c2_globals.hpp
+++ b/src/hotspot/share/opto/c2_globals.hpp
@@ -907,6 +907,9 @@
                                                                             \
   develop(bool, StressLoopPeeling, false,                                   \
           "Randomize loop peeling decision")                                \
+                                                                            \
+  develop(bool, StressCountedLoop, false,                                   \
+          "Randomly delay conversion to counted loops")                     \
 
 // end of C2_FLAGS
 
diff --git a/src/hotspot/share/opto/compile.cpp b/src/hotspot/share/opto/compile.cpp
index f1ea8231df9..f34c75656a4 100644
--- a/src/hotspot/share/opto/compile.cpp
+++ b/src/hotspot/share/opto/compile.cpp
@@ -741,7 +741,7 @@ Compile::Compile(ciEnv* ci_env, ciMethod* target, int osr_bci,
   if (StressLCM || StressGCM || StressIGVN || StressCCP ||
       StressIncrementalInlining || StressMacroExpansion ||
       StressMacroElimination || StressUnstableIfTraps ||
-      StressBailout || StressLoopPeeling) {
+      StressBailout || StressLoopPeeling || StressCountedLoop) {
     initialize_stress_seed(directive);
   }
 
@@ -2257,7 +2257,9 @@ bool Compile::optimize_loops(PhaseIterGVN& igvn, LoopOptsMode mode) {
       PhaseIdealLoop::optimize(igvn, mode);
       _loop_opts_cnt--;
       if (failing())  return false;
-      if (major_progress()) print_method(PHASE_PHASEIDEALLOOP_ITERATIONS, 2);
+      if (major_progress()) {
+        print_method(PHASE_PHASEIDEALLOOP_ITERATIONS, 2);
+      }
     }
   }
   return true;
@@ -3798,7 +3800,11 @@ void Compile::final_graph_reshaping_main_switch(Node* n, Final_Reshape_Counts& f
     }
     break;
   case Op_Loop:
-    assert(!n->as_Loop()->is_loop_nest_inner_loop() || _loop_opts_cnt == 0, "should have been turned into a counted loop");
+    // When StressCountedLoop is enabled, this loop may intentionally avoid a counted loop conversion.
+    // This is expected behavior for the stress mode, which exercises alternative compilation paths.
+    if (!StressCountedLoop) {
+      assert(!n->as_Loop()->is_loop_nest_inner_loop() || _loop_opts_cnt == 0, "should have been turned into a counted loop");
+    }
   case Op_CountedLoop:
   case Op_LongCountedLoop:
   case Op_OuterStripMinedLoop:
diff --git a/src/hotspot/share/opto/loopnode.cpp b/src/hotspot/share/opto/loopnode.cpp
index b2eb0c47458..686a0a05f66 100644
--- a/src/hotspot/share/opto/loopnode.cpp
+++ b/src/hotspot/share/opto/loopnode.cpp
@@ -2137,7 +2137,6 @@ bool CountedLoopConverter::is_counted_loop() {
   }
 
   assert(_head->Opcode() == Op_Loop || _head->Opcode() == Op_LongCountedLoop, "regular loops only");
-  _phase->C->print_method(PHASE_BEFORE_CLOOPS, 3, _head);
 
   // ===================================================
   // We can only convert this loop to a counted loop if we can guarantee that the iv phi will never overflow at runtime.
@@ -2411,6 +2410,12 @@ bool CountedLoopConverter::is_counted_loop() {
   _checked_for_counted_loop = true;
 #endif
 
+#ifndef PRODUCT
+  if (StressCountedLoop && (_phase->C->random() % 2 == 0)) {
+    return false;
+  }
+#endif
+
   return true;
 }
 
@@ -2553,6 +2558,8 @@ IdealLoopTree* CountedLoopConverter::convert() {
 
   PhaseIterGVN* igvn = &_phase->igvn();
 
+  _phase->C->print_method(PHASE_BEFORE_CLOOPS, 3, _head);
+
   if (_should_insert_stride_overflow_limit_check) {
     insert_stride_overflow_limit_check();
   }
@@ -4734,7 +4741,11 @@ void IdealLoopTree::counted_loop( PhaseIdealLoop *phase ) {
   } else if (_head->is_LongCountedLoop() || phase->try_convert_to_counted_loop(_head, loop, T_LONG)) {
     remove_safepoints(phase, true);
   } else {
-    assert(!_head->is_Loop() || !_head->as_Loop()->is_loop_nest_inner_loop(), "transformation to counted loop should not fail");
+    // When StressCountedLoop is enabled, this loop may intentionally avoid a counted loop conversion.
+    // This is expected behavior for the stress mode, which exercises alternative compilation paths.
+    if (!StressCountedLoop) {
+      assert(!_head->is_Loop() || !_head->as_Loop()->is_loop_nest_inner_loop(), "transformation to counted loop should not fail");
+    }
     if (_parent != nullptr && !_irreducible) {
       // Not a counted loop. Keep one safepoint.
       bool keep_one_sfpt = true;

From 6466d9809c80bdf1353b36efc67f7977ee4f45b6 Mon Sep 17 00:00:00 2001
From: Frederic Thevenet <fthevenet@openjdk.org>
Date: Wed, 25 Mar 2026 13:11:02 +0000
Subject: [PATCH 343/655] 8380776: No longer necessary to disable
 calloc-transposed-args warnings when building harfbuzz

Reviewed-by: erikj, kbarrett, jwaters, aivanov
---
 make/modules/java.desktop/lib/ClientLibraries.gmk | 5 +----
 1 file changed, 1 insertion(+), 4 deletions(-)

diff --git a/make/modules/java.desktop/lib/ClientLibraries.gmk b/make/modules/java.desktop/lib/ClientLibraries.gmk
index b76cb8dc4e3..13a74ab409f 100644
--- a/make/modules/java.desktop/lib/ClientLibraries.gmk
+++ b/make/modules/java.desktop/lib/ClientLibraries.gmk
@@ -338,11 +338,8 @@ else
   # noexcept-type required for GCC 7 builds. Not required for GCC 8+.
   # expansion-to-defined required for GCC 9 builds. Not required for GCC 10+.
   # maybe-uninitialized required for GCC 8 builds. Not required for GCC 9+.
-  # calloc-transposed-args required for GCC 14 builds. (fixed upstream in
-  #  Harfbuzz 032c931e1c0cfb20f18e5acb8ba005775242bd92)
   HARFBUZZ_DISABLED_WARNINGS_CXX_gcc := class-memaccess noexcept-type \
-      expansion-to-defined dangling-reference maybe-uninitialized \
-      calloc-transposed-args
+      expansion-to-defined dangling-reference maybe-uninitialized
   HARFBUZZ_DISABLED_WARNINGS_clang := missing-field-initializers \
       range-loop-analysis unused-variable
   HARFBUZZ_DISABLED_WARNINGS_microsoft := 4267 4244

From 4dca6e4ca89e3468c48247ddc7fabab769b72ee0 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Joel=20Sikstr=C3=B6m?= <jsikstro@openjdk.org>
Date: Wed, 25 Mar 2026 14:01:26 +0000
Subject: [PATCH 344/655] 8380903: [BACKOUT] Mitigate Neoverse-N1 erratum
 1542419 negative impact on GCs and JIT performance

Reviewed-by: aboldtch
---
 .../gc/z/zBarrierSetAssembler_aarch64.cpp     |   4 +-
 src/hotspot/cpu/aarch64/globals_aarch64.hpp   |   2 -
 src/hotspot/cpu/aarch64/relocInfo_aarch64.cpp |   7 +-
 .../cpu/aarch64/vm_version_aarch64.cpp        |  45 --
 .../cpu/aarch64/vm_version_aarch64.hpp        |   5 -
 .../linux_aarch64/icache_linux_aarch64.cpp    |  28 --
 .../linux_aarch64/icache_linux_aarch64.hpp    | 101 +----
 .../vm_version_linux_aarch64.cpp              |   2 -
 src/hotspot/share/asm/codeBuffer.cpp          |   3 +
 src/hotspot/share/code/codeBlob.cpp           |   6 -
 src/hotspot/share/code/nmethod.cpp            |  32 +-
 src/hotspot/share/code/nmethod.hpp            |   7 +-
 src/hotspot/share/code/relocInfo.cpp          |   9 +
 src/hotspot/share/code/relocInfo.hpp          |   2 +
 src/hotspot/share/gc/z/zBarrierSetNMethod.cpp |  14 +-
 src/hotspot/share/gc/z/zGeneration.cpp        |  14 +-
 src/hotspot/share/gc/z/zMark.cpp              |  31 +-
 src/hotspot/share/gc/z/zNMethod.cpp           |  16 +-
 src/hotspot/share/gc/z/zNMethod.hpp           |   2 -
 src/hotspot/share/runtime/globals.hpp         |   2 -
 src/hotspot/share/runtime/icache.hpp          |  23 -
 ...tDeferredICacheInvalidationCmdOptions.java | 426 ------------------
 .../gc/TestDeferredICacheInvalidation.java    | 306 -------------
 .../bench/vm/gc/GCPatchingNmethodCost.java    | 206 ---------
 24 files changed, 49 insertions(+), 1244 deletions(-)
 delete mode 100644 src/hotspot/os_cpu/linux_aarch64/icache_linux_aarch64.cpp
 delete mode 100644 test/hotspot/jtreg/compiler/runtime/TestDeferredICacheInvalidationCmdOptions.java
 delete mode 100644 test/hotspot/jtreg/gc/TestDeferredICacheInvalidation.java
 delete mode 100644 test/micro/org/openjdk/bench/vm/gc/GCPatchingNmethodCost.java

diff --git a/src/hotspot/cpu/aarch64/gc/z/zBarrierSetAssembler_aarch64.cpp b/src/hotspot/cpu/aarch64/gc/z/zBarrierSetAssembler_aarch64.cpp
index f0885fee93d..4f0977a414f 100644
--- a/src/hotspot/cpu/aarch64/gc/z/zBarrierSetAssembler_aarch64.cpp
+++ b/src/hotspot/cpu/aarch64/gc/z/zBarrierSetAssembler_aarch64.cpp
@@ -879,9 +879,7 @@ void ZBarrierSetAssembler::patch_barrier_relocation(address addr, int format) {
     ShouldNotReachHere();
   }
 
-  if (!UseSingleICacheInvalidation) {
-    ICache::invalidate_word((address)patch_addr);
-  }
+  ICache::invalidate_word((address)patch_addr);
 }
 
 #ifdef COMPILER1
diff --git a/src/hotspot/cpu/aarch64/globals_aarch64.hpp b/src/hotspot/cpu/aarch64/globals_aarch64.hpp
index ba29646a828..e6de2c798b1 100644
--- a/src/hotspot/cpu/aarch64/globals_aarch64.hpp
+++ b/src/hotspot/cpu/aarch64/globals_aarch64.hpp
@@ -127,8 +127,6 @@ define_pd_global(intx, InlineSmallCode,          1000);
           "Branch Protection to use: none, standard, pac-ret")          \
   product(bool, AlwaysMergeDMB, true, DIAGNOSTIC,                       \
           "Always merge DMB instructions in code emission")             \
-  product(bool, NeoverseN1ICacheErratumMitigation, false, DIAGNOSTIC,   \
-          "Enable workaround for Neoverse N1 erratum 1542419")          \
 
 // end of ARCH_FLAGS
 
diff --git a/src/hotspot/cpu/aarch64/relocInfo_aarch64.cpp b/src/hotspot/cpu/aarch64/relocInfo_aarch64.cpp
index f1b9fb213a2..dbec2d76d4f 100644
--- a/src/hotspot/cpu/aarch64/relocInfo_aarch64.cpp
+++ b/src/hotspot/cpu/aarch64/relocInfo_aarch64.cpp
@@ -54,12 +54,7 @@ void Relocation::pd_set_data_value(address x, bool verify_only) {
     bytes = MacroAssembler::pd_patch_instruction_size(addr(), x);
     break;
   }
-
-  if (UseSingleICacheInvalidation) {
-    assert(_binding != nullptr, "expect to be called with RelocIterator in use");
-  } else {
-    ICache::invalidate_range(addr(), bytes);
-  }
+  ICache::invalidate_range(addr(), bytes);
 }
 
 address Relocation::pd_call_destination(address orig_addr) {
diff --git a/src/hotspot/cpu/aarch64/vm_version_aarch64.cpp b/src/hotspot/cpu/aarch64/vm_version_aarch64.cpp
index 0a40cd705cd..4423d9c5b58 100644
--- a/src/hotspot/cpu/aarch64/vm_version_aarch64.cpp
+++ b/src/hotspot/cpu/aarch64/vm_version_aarch64.cpp
@@ -52,9 +52,6 @@ uintptr_t VM_Version::_pac_mask;
 
 SpinWait VM_Version::_spin_wait;
 
-bool VM_Version::_cache_dic_enabled;
-bool VM_Version::_cache_idc_enabled;
-
 const char* VM_Version::_features_names[MAX_CPU_FEATURES] = { nullptr };
 
 static SpinWait get_spin_wait_desc() {
@@ -66,19 +63,6 @@ static SpinWait get_spin_wait_desc() {
   return spin_wait;
 }
 
-static bool has_neoverse_n1_errata_1542419() {
-  const int major_rev_num = VM_Version::cpu_variant();
-  const int minor_rev_num = VM_Version::cpu_revision();
-  // Neoverse N1: 0xd0c
-  // Erratum 1542419 affects r3p0, r3p1 and r4p0.
-  // It is fixed in r4p1 and later revisions, which are not affected.
-  return (VM_Version::cpu_family() == VM_Version::CPU_ARM &&
-          VM_Version::model_is(0xd0c) &&
-          ((major_rev_num == 3 && minor_rev_num == 0) ||
-           (major_rev_num == 3 && minor_rev_num == 1) ||
-           (major_rev_num == 4 && minor_rev_num == 0)));
-}
-
 void VM_Version::initialize() {
 #define SET_CPU_FEATURE_NAME(id, name, bit) \
   _features_names[bit] = XSTR(name);
@@ -90,9 +74,6 @@ void VM_Version::initialize() {
   _supports_atomic_getset8 = true;
   _supports_atomic_getadd8 = true;
 
-  _cache_dic_enabled = false;
-  _cache_idc_enabled = false;
-
   get_os_cpu_info();
 
   int dcache_line = VM_Version::dcache_line_size();
@@ -680,32 +661,6 @@ void VM_Version::initialize() {
     clear_feature(CPU_SVE);
   }
 
-  if (FLAG_IS_DEFAULT(UseSingleICacheInvalidation) && is_cache_idc_enabled() && is_cache_dic_enabled()) {
-    FLAG_SET_DEFAULT(UseSingleICacheInvalidation, true);
-  }
-
-  if (FLAG_IS_DEFAULT(NeoverseN1ICacheErratumMitigation) && has_neoverse_n1_errata_1542419()) {
-    FLAG_SET_DEFAULT(NeoverseN1ICacheErratumMitigation, true);
-  }
-
-  if (NeoverseN1ICacheErratumMitigation) {
-    if (!has_neoverse_n1_errata_1542419()) {
-      vm_exit_during_initialization("NeoverseN1ICacheErratumMitigation is set for the CPU not having Neoverse N1 errata 1542419");
-    }
-    if (FLAG_IS_DEFAULT(UseSingleICacheInvalidation)) {
-      FLAG_SET_DEFAULT(UseSingleICacheInvalidation, true);
-    }
-
-    if (!UseSingleICacheInvalidation) {
-      vm_exit_during_initialization("NeoverseN1ICacheErratumMitigation is set but UseSingleICacheInvalidation is not enabled");
-    }
-  }
-
-  if (UseSingleICacheInvalidation
-      && (!is_cache_idc_enabled() || (!is_cache_dic_enabled() && !NeoverseN1ICacheErratumMitigation))) {
-    vm_exit_during_initialization("UseSingleICacheInvalidation is set but neither IDC nor DIC nor NeoverseN1ICacheErratumMitigation is enabled");
-  }
-
   // Construct the "features" string
   stringStream ss(512);
   ss.print("0x%02x:0x%x:0x%03x:%d", _cpu, _variant, _model, _revision);
diff --git a/src/hotspot/cpu/aarch64/vm_version_aarch64.hpp b/src/hotspot/cpu/aarch64/vm_version_aarch64.hpp
index 6145990d0d6..e8681611234 100644
--- a/src/hotspot/cpu/aarch64/vm_version_aarch64.hpp
+++ b/src/hotspot/cpu/aarch64/vm_version_aarch64.hpp
@@ -58,8 +58,6 @@ protected:
   // When _prefer_sve_merging_mode_cpy is true, `cpy (imm, zeroing)` is
   // implemented as `movi; cpy(imm, merging)`.
   static constexpr bool _prefer_sve_merging_mode_cpy = true;
-  static bool _cache_dic_enabled;
-  static bool _cache_idc_enabled;
 
   static SpinWait _spin_wait;
 
@@ -255,9 +253,6 @@ public:
     return vector_length_in_bytes <= 16;
   }
 
-  static bool is_cache_dic_enabled() { return _cache_dic_enabled; }
-  static bool is_cache_idc_enabled() { return _cache_idc_enabled; }
-
   static void get_cpu_features_name(void* features_buffer, stringStream& ss);
 
   // Returns names of features present in features_set1 but not in features_set2
diff --git a/src/hotspot/os_cpu/linux_aarch64/icache_linux_aarch64.cpp b/src/hotspot/os_cpu/linux_aarch64/icache_linux_aarch64.cpp
deleted file mode 100644
index 41cad5af325..00000000000
--- a/src/hotspot/os_cpu/linux_aarch64/icache_linux_aarch64.cpp
+++ /dev/null
@@ -1,28 +0,0 @@
-/*
- * Copyright Amazon.com Inc. or its affiliates. All Rights Reserved.
- * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
- *
- * This code is free software; you can redistribute it and/or modify it
- * under the terms of the GNU General Public License version 2 only, as
- * published by the Free Software Foundation.
- *
- * This code is distributed in the hope that it will be useful, but WITHOUT
- * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
- * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
- * version 2 for more details (a copy is included in the LICENSE file that
- * accompanied this code).
- *
- * You should have received a copy of the GNU General Public License version
- * 2 along with this work; if not, write to the Free Software Foundation,
- * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
- *
- * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
- * or visit www.oracle.com if you need additional information or have any
- * questions.
- *
- */
-
-#include "runtime/icache.hpp"
-#include "utilities/globalDefinitions.hpp"
-
-NOT_PRODUCT(THREAD_LOCAL AArch64ICacheInvalidationContext* AArch64ICacheInvalidationContext::_current_context = nullptr;)
diff --git a/src/hotspot/os_cpu/linux_aarch64/icache_linux_aarch64.hpp b/src/hotspot/os_cpu/linux_aarch64/icache_linux_aarch64.hpp
index b410aebed7b..8fbaa7a6b6e 100644
--- a/src/hotspot/os_cpu/linux_aarch64/icache_linux_aarch64.hpp
+++ b/src/hotspot/os_cpu/linux_aarch64/icache_linux_aarch64.hpp
@@ -26,10 +26,6 @@
 #ifndef OS_CPU_LINUX_AARCH64_ICACHE_AARCH64_HPP
 #define OS_CPU_LINUX_AARCH64_ICACHE_AARCH64_HPP
 
-#include "memory/allocation.hpp"
-#include "runtime/vm_version.hpp"
-#include "utilities/globalDefinitions.hpp"
-
 // Interface for updating the instruction cache.  Whenever the VM
 // modifies code, part of the processor instruction cache potentially
 // has to be flushed.
@@ -41,103 +37,8 @@ class ICache : public AbstractICache {
     __builtin___clear_cache((char *)addr, (char *)(addr + 4));
   }
   static void invalidate_range(address start, int nbytes) {
-    if (NeoverseN1ICacheErratumMitigation) {
-      assert(VM_Version::is_cache_idc_enabled(),
-             "Expect CTR_EL0.IDC to be enabled for Neoverse N1 with erratum "
-             "1542419");
-      assert(!VM_Version::is_cache_dic_enabled(),
-             "Expect CTR_EL0.DIC to be disabled for Neoverse N1 with erratum "
-             "1542419");
-      asm volatile("dsb ish       \n"
-                   "ic  ivau, xzr \n"
-                   "dsb ish       \n"
-                   "isb           \n"
-                   : : : "memory");
-    } else {
-      __builtin___clear_cache((char *)start, (char *)(start + nbytes));
-    }
+    __builtin___clear_cache((char *)start, (char *)(start + nbytes));
   }
 };
 
-class AArch64ICacheInvalidationContext : StackObj {
- private:
-
-#ifdef ASSERT
-  static THREAD_LOCAL AArch64ICacheInvalidationContext* _current_context;
-#endif
-
-  bool _has_modified_code;
-
- public:
-  NONCOPYABLE(AArch64ICacheInvalidationContext);
-
-  AArch64ICacheInvalidationContext()
-      : _has_modified_code(false) {
-    assert(_current_context == nullptr, "nested ICacheInvalidationContext not supported");
-#ifdef ASSERT
-    _current_context = this;
-#endif
-  }
-
-  ~AArch64ICacheInvalidationContext() {
-    NOT_PRODUCT(_current_context = nullptr);
-
-    if (!_has_modified_code || !UseSingleICacheInvalidation) {
-      return;
-    }
-
-    assert(VM_Version::is_cache_idc_enabled(), "Expect CTR_EL0.IDC to be enabled");
-
-    asm volatile("dsb ish" : : : "memory");
-
-    if (NeoverseN1ICacheErratumMitigation) {
-      assert(!VM_Version::is_cache_dic_enabled(),
-             "Expect CTR_EL0.DIC to be disabled for Neoverse N1 with erratum "
-             "1542419");
-
-      // Errata 1542419: Neoverse N1 cores with the 'COHERENT_ICACHE' feature
-      // may fetch stale instructions when software depends on
-      // prefetch-speculation-protection instead of explicit synchronization.
-      //
-      // Neoverse-N1 implementation mitigates the errata 1542419 with a
-      // workaround:
-      // - Disable coherent icache.
-      // - Trap IC IVAU instructions.
-      // - Execute:
-      //   - tlbi vae3is, xzr
-      //   - dsb sy
-      // - Ignore trapped IC IVAU instructions.
-      //
-      // `tlbi vae3is, xzr` invalidates all translation entries (all VAs, all
-      // possible levels). It waits for all memory accesses using in-scope old
-      // translation information to complete before it is considered complete.
-      //
-      // As this workaround has significant overhead, Arm Neoverse N1 (MP050)
-      // Software Developer Errata Notice version 29.0 suggests:
-      //
-      // "Since one TLB inner-shareable invalidation is enough to avoid this
-      // erratum, the number of injected TLB invalidations should be minimized
-      // in the trap handler to mitigate the performance impact due to this
-      // workaround."
-      // As the address for icache invalidation is not relevant and
-      // IC IVAU instruction is ignored, we use XZR in it.
-      asm volatile(
-          "ic  ivau, xzr \n"
-          "dsb ish       \n"
-          :
-          :
-          : "memory");
-    } else {
-      assert(VM_Version::is_cache_dic_enabled(), "Expect CTR_EL0.DIC to be enabled");
-    }
-    asm volatile("isb" : : : "memory");
-  }
-
-  void set_has_modified_code() {
-    _has_modified_code = true;
-  }
-};
-
-#define PD_ICACHE_INVALIDATION_CONTEXT AArch64ICacheInvalidationContext
-
 #endif // OS_CPU_LINUX_AARCH64_ICACHE_AARCH64_HPP
diff --git a/src/hotspot/os_cpu/linux_aarch64/vm_version_linux_aarch64.cpp b/src/hotspot/os_cpu/linux_aarch64/vm_version_linux_aarch64.cpp
index dad7161a3cb..1fe06dc640d 100644
--- a/src/hotspot/os_cpu/linux_aarch64/vm_version_linux_aarch64.cpp
+++ b/src/hotspot/os_cpu/linux_aarch64/vm_version_linux_aarch64.cpp
@@ -169,8 +169,6 @@ void VM_Version::get_os_cpu_info() {
 
   _icache_line_size = (1 << (ctr_el0 & 0x0f)) * 4;
   _dcache_line_size = (1 << ((ctr_el0 >> 16) & 0x0f)) * 4;
-  _cache_idc_enabled = ((ctr_el0 >> 28) & 0x1) != 0;
-  _cache_dic_enabled = ((ctr_el0 >> 29) & 0x1) != 0;
 
   if (!(dczid_el0 & 0x10)) {
     _zva_length = 4 << (dczid_el0 & 0xf);
diff --git a/src/hotspot/share/asm/codeBuffer.cpp b/src/hotspot/share/asm/codeBuffer.cpp
index 964aec8b501..ba525588f32 100644
--- a/src/hotspot/share/asm/codeBuffer.cpp
+++ b/src/hotspot/share/asm/codeBuffer.cpp
@@ -745,6 +745,9 @@ void CodeBuffer::copy_code_to(CodeBlob* dest_blob) {
 
   // Done moving code bytes; were they the right size?
   assert((int)align_up(dest.total_content_size(), oopSize) == dest_blob->content_size(), "sanity");
+
+  // Flush generated code
+  ICache::invalidate_range(dest_blob->code_begin(), dest_blob->code_size());
 }
 
 // Move all my code into another code buffer.  Consult applicable
diff --git a/src/hotspot/share/code/codeBlob.cpp b/src/hotspot/share/code/codeBlob.cpp
index d07386bd795..fcc0b42a461 100644
--- a/src/hotspot/share/code/codeBlob.cpp
+++ b/src/hotspot/share/code/codeBlob.cpp
@@ -331,13 +331,7 @@ RuntimeBlob::RuntimeBlob(
   : CodeBlob(name, kind, cb, size, header_size, frame_complete, frame_size, oop_maps, caller_must_gc_arguments,
              align_up(cb->total_relocation_size(), oopSize))
 {
-  if (code_size() == 0) {
-    // Nothing to copy
-    return;
-  }
-
   cb->copy_code_and_locs_to(this);
-  ICache::invalidate_range(code_begin(), code_size());
 }
 
 void RuntimeBlob::free(RuntimeBlob* blob) {
diff --git a/src/hotspot/share/code/nmethod.cpp b/src/hotspot/share/code/nmethod.cpp
index 5cb795a4723..5a6ed8ab3ed 100644
--- a/src/hotspot/share/code/nmethod.cpp
+++ b/src/hotspot/share/code/nmethod.cpp
@@ -1328,7 +1328,6 @@ nmethod::nmethod(
     code_buffer->copy_values_to(this);
 
     post_init();
-    ICache::invalidate_range(code_begin(), code_size());
   }
 
   if (PrintNativeNMethods || PrintDebugInfo || PrintRelocations || PrintDependencies) {
@@ -1810,7 +1809,6 @@ nmethod::nmethod(
     init_immutable_data_ref_count();
 
     post_init();
-    ICache::invalidate_range(code_begin(), code_size());
 
     // we use the information of entry points to find out if a method is
     // static or non static
@@ -2038,7 +2036,7 @@ void nmethod::copy_values(GrowableArray<jobject>* array) {
   // The code and relocations have already been initialized by the
   // CodeBlob constructor, so it is valid even at this early point to
   // iterate over relocations and patch the code.
-  fix_oop_relocations(/*initialize_immediates=*/ true);
+  fix_oop_relocations(nullptr, nullptr, /*initialize_immediates=*/ true);
 }
 
 void nmethod::copy_values(GrowableArray<Metadata*>* array) {
@@ -2050,42 +2048,24 @@ void nmethod::copy_values(GrowableArray<Metadata*>* array) {
   }
 }
 
-bool nmethod::fix_oop_relocations(bool initialize_immediates) {
+void nmethod::fix_oop_relocations(address begin, address end, bool initialize_immediates) {
   // re-patch all oop-bearing instructions, just in case some oops moved
-  RelocIterator iter(this);
-  bool modified_code = false;
+  RelocIterator iter(this, begin, end);
   while (iter.next()) {
     if (iter.type() == relocInfo::oop_type) {
       oop_Relocation* reloc = iter.oop_reloc();
-      if (!reloc->oop_is_immediate()) {
-        // Refresh the oop-related bits of this instruction.
-        reloc->set_value(reloc->value());
-        modified_code = true;
-      } else if (initialize_immediates) {
+      if (initialize_immediates && reloc->oop_is_immediate()) {
         oop* dest = reloc->oop_addr();
         jobject obj = *reinterpret_cast<jobject*>(dest);
         initialize_immediate_oop(dest, obj);
       }
+      // Refresh the oop-related bits of this instruction.
+      reloc->fix_oop_relocation();
     } else if (iter.type() == relocInfo::metadata_type) {
       metadata_Relocation* reloc = iter.metadata_reloc();
       reloc->fix_metadata_relocation();
-      modified_code |= !reloc->metadata_is_immediate();
     }
   }
-  return modified_code;
-}
-
-void nmethod::fix_oop_relocations() {
-  ICacheInvalidationContext icic;
-  fix_oop_relocations(&icic);
-}
-
-void nmethod::fix_oop_relocations(ICacheInvalidationContext* icic) {
-  assert(icic != nullptr, "must provide context to track if code was modified");
-  bool modified_code = fix_oop_relocations(/*initialize_immediates=*/ false);
-  if (modified_code) {
-    icic->set_has_modified_code();
-  }
 }
 
 static void install_post_call_nop_displacement(nmethod* nm, address pc) {
diff --git a/src/hotspot/share/code/nmethod.hpp b/src/hotspot/share/code/nmethod.hpp
index ea8c0e2ad5d..092da181f12 100644
--- a/src/hotspot/share/code/nmethod.hpp
+++ b/src/hotspot/share/code/nmethod.hpp
@@ -41,7 +41,6 @@ class Dependencies;
 class DirectiveSet;
 class DebugInformationRecorder;
 class ExceptionHandlerTable;
-class ICacheInvalidationContext;
 class ImplicitExceptionTable;
 class JvmtiThreadState;
 class MetadataClosure;
@@ -802,15 +801,15 @@ public:
 
   // Relocation support
 private:
-  bool fix_oop_relocations(bool initialize_immediates);
+  void fix_oop_relocations(address begin, address end, bool initialize_immediates);
   inline void initialize_immediate_oop(oop* dest, jobject handle);
 
 protected:
   address oops_reloc_begin() const;
 
 public:
-  void fix_oop_relocations(ICacheInvalidationContext* icic);
-  void fix_oop_relocations();
+  void fix_oop_relocations(address begin, address end) { fix_oop_relocations(begin, end, false); }
+  void fix_oop_relocations()                           { fix_oop_relocations(nullptr, nullptr, false); }
 
   bool is_at_poll_return(address pc);
   bool is_at_poll_or_poll_return(address pc);
diff --git a/src/hotspot/share/code/relocInfo.cpp b/src/hotspot/share/code/relocInfo.cpp
index 25d91edc20f..2a6335e2118 100644
--- a/src/hotspot/share/code/relocInfo.cpp
+++ b/src/hotspot/share/code/relocInfo.cpp
@@ -590,6 +590,15 @@ oop oop_Relocation::oop_value() {
   return *oop_addr();
 }
 
+
+void oop_Relocation::fix_oop_relocation() {
+  if (!oop_is_immediate()) {
+    // get the oop from the pool, and re-insert it into the instruction:
+    set_value(value());
+  }
+}
+
+
 void oop_Relocation::verify_oop_relocation() {
   if (!oop_is_immediate()) {
     // get the oop from the pool, and re-insert it into the instruction:
diff --git a/src/hotspot/share/code/relocInfo.hpp b/src/hotspot/share/code/relocInfo.hpp
index bb2b2b5693f..6f1778ef479 100644
--- a/src/hotspot/share/code/relocInfo.hpp
+++ b/src/hotspot/share/code/relocInfo.hpp
@@ -988,6 +988,8 @@ class oop_Relocation : public DataRelocation {
   void pack_data_to(CodeSection* dest) override;
   void unpack_data() override;
 
+  void fix_oop_relocation();        // reasserts oop value
+
   void verify_oop_relocation();
 
   address value() override { return *reinterpret_cast<address*>(oop_addr()); }
diff --git a/src/hotspot/share/gc/z/zBarrierSetNMethod.cpp b/src/hotspot/share/gc/z/zBarrierSetNMethod.cpp
index a439b3a167b..d80ce4e149d 100644
--- a/src/hotspot/share/gc/z/zBarrierSetNMethod.cpp
+++ b/src/hotspot/share/gc/z/zBarrierSetNMethod.cpp
@@ -33,7 +33,6 @@
 #include "gc/z/zThreadLocalData.hpp"
 #include "gc/z/zUncoloredRoot.inline.hpp"
 #include "logging/log.hpp"
-#include "runtime/icache.hpp"
 #include "runtime/threadWXSetters.inline.hpp"
 
 bool ZBarrierSetNMethod::nmethod_entry_barrier(nmethod* nm) {
@@ -71,15 +70,12 @@ bool ZBarrierSetNMethod::nmethod_entry_barrier(nmethod* nm) {
     return false;
   }
 
-  {
-    ICacheInvalidationContext icic;
-    // Heal barriers
-    ZNMethod::nmethod_patch_barriers(nm, &icic);
+  // Heal barriers
+  ZNMethod::nmethod_patch_barriers(nm);
 
-    // Heal oops
-    ZUncoloredRootProcessWeakOopClosure cl(ZNMethod::color(nm));
-    ZNMethod::nmethod_oops_do_inner(nm, &cl, &icic);
-  }
+  // Heal oops
+  ZUncoloredRootProcessWeakOopClosure cl(ZNMethod::color(nm));
+  ZNMethod::nmethod_oops_do_inner(nm, &cl);
 
   const uintptr_t prev_color = ZNMethod::color(nm);
   const uintptr_t new_color = *ZPointerStoreGoodMaskLowOrderBitsAddr;
diff --git a/src/hotspot/share/gc/z/zGeneration.cpp b/src/hotspot/share/gc/z/zGeneration.cpp
index 0f9f4e34a5e..27f352a624f 100644
--- a/src/hotspot/share/gc/z/zGeneration.cpp
+++ b/src/hotspot/share/gc/z/zGeneration.cpp
@@ -58,7 +58,6 @@
 #include "prims/jvmtiTagMap.hpp"
 #include "runtime/continuation.hpp"
 #include "runtime/handshake.hpp"
-#include "runtime/icache.hpp"
 #include "runtime/safepoint.hpp"
 #include "runtime/threads.hpp"
 #include "runtime/vmOperations.hpp"
@@ -1435,15 +1434,12 @@ public:
   virtual void do_nmethod(nmethod* nm) {
     ZLocker<ZReentrantLock> locker(ZNMethod::lock_for_nmethod(nm));
     if (_bs_nm->is_armed(nm)) {
-      {
-        ICacheInvalidationContext icic;
-        // Heal barriers
-        ZNMethod::nmethod_patch_barriers(nm, &icic);
+      // Heal barriers
+      ZNMethod::nmethod_patch_barriers(nm);
 
-        // Heal oops
-        ZUncoloredRootProcessOopClosure cl(ZNMethod::color(nm));
-        ZNMethod::nmethod_oops_do_inner(nm, &cl, &icic);
-      }
+      // Heal oops
+      ZUncoloredRootProcessOopClosure cl(ZNMethod::color(nm));
+      ZNMethod::nmethod_oops_do_inner(nm, &cl);
 
       log_trace(gc, nmethod)("nmethod: " PTR_FORMAT " visited by old remapping", p2i(nm));
 
diff --git a/src/hotspot/share/gc/z/zMark.cpp b/src/hotspot/share/gc/z/zMark.cpp
index ac7d86db240..03701ae9998 100644
--- a/src/hotspot/share/gc/z/zMark.cpp
+++ b/src/hotspot/share/gc/z/zMark.cpp
@@ -59,7 +59,6 @@
 #include "oops/oop.inline.hpp"
 #include "runtime/continuation.hpp"
 #include "runtime/handshake.hpp"
-#include "runtime/icache.hpp"
 #include "runtime/javaThread.hpp"
 #include "runtime/prefetch.inline.hpp"
 #include "runtime/safepointMechanism.hpp"
@@ -719,15 +718,12 @@ public:
   virtual void do_nmethod(nmethod* nm) {
     ZLocker<ZReentrantLock> locker(ZNMethod::lock_for_nmethod(nm));
     if (_bs_nm->is_armed(nm)) {
-      {
-         ICacheInvalidationContext icic;
-         // Heal barriers
-         ZNMethod::nmethod_patch_barriers(nm, &icic);
+      // Heal barriers
+      ZNMethod::nmethod_patch_barriers(nm);
 
-         // Heal oops
-         ZUncoloredRootMarkOopClosure cl(ZNMethod::color(nm));
-         ZNMethod::nmethod_oops_do_inner(nm, &cl, &icic);
-      }
+      // Heal oops
+      ZUncoloredRootMarkOopClosure cl(ZNMethod::color(nm));
+      ZNMethod::nmethod_oops_do_inner(nm, &cl);
 
       // CodeCache unloading support
       nm->mark_as_maybe_on_stack();
@@ -757,6 +753,10 @@ public:
     if (_bs_nm->is_armed(nm)) {
       const uintptr_t prev_color = ZNMethod::color(nm);
 
+      // Heal oops
+      ZUncoloredRootMarkYoungOopClosure cl(prev_color);
+      ZNMethod::nmethod_oops_do_inner(nm, &cl);
+
       // Disarm only the young marking, not any potential old marking cycle
 
       const uintptr_t old_marked_mask = ZPointerMarkedMask ^ (ZPointerMarkedYoung0 | ZPointerMarkedYoung1);
@@ -767,16 +767,9 @@ public:
       // Check if disarming for young mark, completely disarms the nmethod entry barrier
       const bool complete_disarm = ZPointer::is_store_good(new_disarm_value_ptr);
 
-      {
-        ICacheInvalidationContext icic;
-        if (complete_disarm) {
-          // We are about to completely disarm the nmethod, must take responsibility to patch all barriers before disarming
-          ZNMethod::nmethod_patch_barriers(nm, &icic);
-        }
-
-        // Heal oops
-        ZUncoloredRootMarkYoungOopClosure cl(prev_color);
-        ZNMethod::nmethod_oops_do_inner(nm, &cl, &icic);
+      if (complete_disarm) {
+        // We are about to completely disarm the nmethod, must take responsibility to patch all barriers before disarming
+        ZNMethod::nmethod_patch_barriers(nm);
       }
 
       _bs_nm->guard_with(nm, (int)untype(new_disarm_value_ptr));
diff --git a/src/hotspot/share/gc/z/zNMethod.cpp b/src/hotspot/share/gc/z/zNMethod.cpp
index a1348b63b6f..780bc9e3bf7 100644
--- a/src/hotspot/share/gc/z/zNMethod.cpp
+++ b/src/hotspot/share/gc/z/zNMethod.cpp
@@ -50,7 +50,6 @@
 #include "oops/oop.inline.hpp"
 #include "runtime/atomicAccess.hpp"
 #include "runtime/continuation.hpp"
-#include "runtime/icache.hpp"
 #include "utilities/debug.hpp"
 
 static ZNMethodData* gc_data(const nmethod* nm) {
@@ -246,16 +245,8 @@ void ZNMethod::set_guard_value(nmethod* nm, int value) {
 }
 
 void ZNMethod::nmethod_patch_barriers(nmethod* nm) {
-  ICacheInvalidationContext icic;
-  nmethod_patch_barriers(nm, &icic);
-}
-
-void ZNMethod::nmethod_patch_barriers(nmethod* nm, ICacheInvalidationContext* icic) {
   ZBarrierSetAssembler* const bs_asm = ZBarrierSet::assembler();
   ZArrayIterator<ZNMethodDataBarrier> iter(gc_data(nm)->barriers());
-  if (gc_data(nm)->barriers()->is_nonempty()) {
-    icic->set_has_modified_code();
-  }
   for (ZNMethodDataBarrier barrier; iter.next(&barrier);) {
     bs_asm->patch_barrier_relocation(barrier._reloc_addr, barrier._reloc_format);
   }
@@ -267,11 +258,6 @@ void ZNMethod::nmethod_oops_do(nmethod* nm, OopClosure* cl) {
 }
 
 void ZNMethod::nmethod_oops_do_inner(nmethod* nm, OopClosure* cl) {
-  ICacheInvalidationContext icic;
-  nmethod_oops_do_inner(nm, cl, &icic);
-}
-
-void ZNMethod::nmethod_oops_do_inner(nmethod* nm, OopClosure* cl, ICacheInvalidationContext* icic) {
   // Process oops table
   {
     oop* const begin = nm->oops_begin();
@@ -297,7 +283,7 @@ void ZNMethod::nmethod_oops_do_inner(nmethod* nm, OopClosure* cl, ICacheInvalida
 
   // Process non-immediate oops
   if (data->has_non_immediate_oops()) {
-    nm->fix_oop_relocations(icic);
+    nm->fix_oop_relocations();
   }
 }
 
diff --git a/src/hotspot/share/gc/z/zNMethod.hpp b/src/hotspot/share/gc/z/zNMethod.hpp
index 2779151c576..865ea11e7b9 100644
--- a/src/hotspot/share/gc/z/zNMethod.hpp
+++ b/src/hotspot/share/gc/z/zNMethod.hpp
@@ -56,11 +56,9 @@ public:
   static void set_guard_value(nmethod* nm, int value);
 
   static void nmethod_patch_barriers(nmethod* nm);
-  static void nmethod_patch_barriers(nmethod* nm, ICacheInvalidationContext* icic);
 
   static void nmethod_oops_do(nmethod* nm, OopClosure* cl);
   static void nmethod_oops_do_inner(nmethod* nm, OopClosure* cl);
-  static void nmethod_oops_do_inner(nmethod* nm, OopClosure* cl, ICacheInvalidationContext* icic);
 
   static void nmethods_do_begin(bool secondary);
   static void nmethods_do_end(bool secondary);
diff --git a/src/hotspot/share/runtime/globals.hpp b/src/hotspot/share/runtime/globals.hpp
index 296c5dedf8a..60feddde09b 100644
--- a/src/hotspot/share/runtime/globals.hpp
+++ b/src/hotspot/share/runtime/globals.hpp
@@ -1978,8 +1978,6 @@ const int ObjectAlignmentInBytes = 8;
   develop(uint, BinarySearchThreshold, 16,                                  \
           "Minimal number of elements in a sorted collection to prefer"     \
           "binary search over simple linear search." )                      \
-  product(bool, UseSingleICacheInvalidation, false, DIAGNOSTIC,             \
-          "Defer multiple ICache invalidation to single invalidation")      \
                                                                             \
 
 // end of RUNTIME_FLAGS
diff --git a/src/hotspot/share/runtime/icache.hpp b/src/hotspot/share/runtime/icache.hpp
index 692a876d9a6..bc153862323 100644
--- a/src/hotspot/share/runtime/icache.hpp
+++ b/src/hotspot/share/runtime/icache.hpp
@@ -129,27 +129,4 @@ class ICacheStubGenerator : public StubCodeGenerator {
   void generate_icache_flush(ICache::flush_icache_stub_t* flush_icache_stub);
 };
 
-class DefaultICacheInvalidationContext : StackObj {
- public:
-  NONCOPYABLE(DefaultICacheInvalidationContext);
-
-  DefaultICacheInvalidationContext() {}
-
-  ~DefaultICacheInvalidationContext() {}
-
-  void set_has_modified_code() {}
-};
-
-#ifndef PD_ICACHE_INVALIDATION_CONTEXT
-#define PD_ICACHE_INVALIDATION_CONTEXT DefaultICacheInvalidationContext
-#endif // PD_ICACHE_INVALIDATION_CONTEXT
-
-class ICacheInvalidationContext final : public PD_ICACHE_INVALIDATION_CONTEXT {
- private:
-  NONCOPYABLE(ICacheInvalidationContext);
-
- public:
-  using PD_ICACHE_INVALIDATION_CONTEXT::PD_ICACHE_INVALIDATION_CONTEXT;
-};
-
 #endif // SHARE_RUNTIME_ICACHE_HPP
diff --git a/test/hotspot/jtreg/compiler/runtime/TestDeferredICacheInvalidationCmdOptions.java b/test/hotspot/jtreg/compiler/runtime/TestDeferredICacheInvalidationCmdOptions.java
deleted file mode 100644
index 8bc74be5c62..00000000000
--- a/test/hotspot/jtreg/compiler/runtime/TestDeferredICacheInvalidationCmdOptions.java
+++ /dev/null
@@ -1,426 +0,0 @@
-/*
- * Copyright Amazon.com Inc. or its affiliates. All Rights Reserved.
- * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
- *
- * This code is free software; you can redistribute it and/or modify it
- * under the terms of the GNU General Public License version 2 only, as
- * published by the Free Software Foundation.
- *
- * This code is distributed in the hope that it will be useful, but WITHOUT
- * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
- * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
- * version 2 for more details (a copy is included in the LICENSE file that
- * accompanied this code).
- *
- * You should have received a copy of the GNU General Public License version
- * 2 along with this work; if not, write to the Free Software Foundation,
- * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
- *
- * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
- * or visit www.oracle.com if you need additional information or have any
- * questions.
- *
- */
-
-package compiler.runtime;
-
-import jdk.test.lib.process.OutputAnalyzer;
-import jdk.test.lib.process.ProcessTools;
-import jdk.test.whitebox.WhiteBox;
-import jtreg.SkippedException;
-
-/*
- * @test
- * @bug 8370947
- * @summary Test command-line options for UseSingleICacheInvalidation and NeoverseN1ICacheErratumMitigation
- * @library /test/lib
- * @requires os.arch == "aarch64"
- * @requires os.family == "linux"
- * @build jdk.test.whitebox.WhiteBox
- * @run driver jdk.test.lib.helpers.ClassFileInstaller jdk.test.whitebox.WhiteBox
- * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions -XX:+WhiteBoxAPI compiler.runtime.TestDeferredICacheInvalidationCmdOptions
- */
-
-public class TestDeferredICacheInvalidationCmdOptions {
-
-    // CPU identifiers
-    private static final int CPU_ARM = 0x41;
-    private static final int NEOVERSE_N1_MODEL = 0xd0c;
-
-    private static boolean isAffected;
-
-    public static void main(String[] args) throws Exception {
-        // Parse CPU features and print CPU info
-        parseCPUFeatures();
-
-        System.out.println("Testing UseSingleICacheInvalidation and NeoverseN1ICacheErratumMitigation command-line options...");
-
-        // Test case 1: Check defaults on Neoverse N1 pre-r4p1 (if applicable)
-        testCase1_DefaultsOnNeoverseN1();
-
-        // Test case 2: Check NeoverseN1ICacheErratumMitigation is false on unaffected CPUs
-        testCase2_DefaultsOnUnaffectedCPUs();
-
-        // Test case 3: Check if NeoverseN1ICacheErratumMitigation is set to false on affected CPUs,
-        //             UseSingleICacheInvalidation is also set to false
-        testCase3_ExplicitlyDisableErrataAffectsDeferred();
-
-        // Test case 4: Check JVM error if UseSingleICacheInvalidation=true
-        //             but NeoverseN1ICacheErratumMitigation=false on affected CPUs
-        testCase4_ConflictingFlagsOnAffectedCPUs();
-
-        // Test case 5: Check explicit NeoverseN1ICacheErratumMitigation=true enables UseSingleICacheInvalidation
-        testCase5_ExplicitlyEnableErrataEnablesDeferred();
-
-        // Test case 6: Check both flags can be explicitly set to false
-        testCase6_ExplicitlyDisableBothFlags();
-
-        // Test case 7: Check UseSingleICacheInvalidation=false with NeoverseN1ICacheErratumMitigation=true
-        testCase7_ConflictingErrataWithoutDeferred();
-
-        // Test case 8: Check setting NeoverseN1ICacheErratumMitigation=true on unaffected CPU causes an error
-        testCase8_EnablingErrataOnUnaffectedCPU();
-
-        System.out.println("All test cases passed!");
-    }
-
-    /**
-     * Parse CPU features string from WhiteBox.getCPUFeatures() to extract:
-     * - cpuFamily: 0x41 for ARM
-     * - cpuVariant: major revision
-     * - cpuModel: e.g., 0xd0c for Neoverse N1
-     * - cpuRevision: minor revision
-     * - cpuModel2: secondary model (if present, in parentheses)
-     *
-     * Sets the static field isAffected and prints CPU info.
-     *
-     * Format: 0x%02x:0x%x:0x%03x:%d[(0x%03x)]
-     * Example: "0x41:0x3:0xd0c:0" or "0x41:0x3:0xd0c:0(0xd0c)"
-     *
-     * @throws SkippedException if not running on ARM CPU
-     */
-    private static void parseCPUFeatures() {
-        WhiteBox wb = WhiteBox.getWhiteBox();
-        String cpuFeatures = wb.getCPUFeatures();
-        System.out.println("CPU Features string: " + cpuFeatures);
-
-        if (cpuFeatures == null || cpuFeatures.isEmpty()) {
-            throw new RuntimeException("No CPU features available");
-        }
-
-        int commaIndex = cpuFeatures.indexOf(",");
-        if (commaIndex == -1) {
-            throw new RuntimeException("Unexpected CPU features format (no comma): " + cpuFeatures);
-        }
-
-        String cpuPart = cpuFeatures.substring(0, commaIndex).trim();
-
-        String[] parts = cpuPart.split(":");
-        if (parts.length < 4) {
-            throw new RuntimeException("Unexpected CPU features format: " + cpuPart);
-        }
-
-        int cpuFamily = Integer.parseInt(parts[0].substring(2), 16);
-        if (cpuFamily != CPU_ARM) {
-            throw new SkippedException("Not running on ARM CPU (cpuFamily=0x" + Integer.toHexString(cpuFamily) + ")");
-        }
-
-        int cpuVariant = Integer.parseInt(parts[1].substring(2), 16);
-        int cpuModel = Integer.parseInt(parts[2].substring(2), 16);
-        int cpuModel2 = 0;
-
-        int model2Start = parts[3].indexOf("(");
-        String revisionStr = parts[3];
-        if (model2Start != -1) {
-            if (!parts[3].endsWith(")")) {
-                throw new RuntimeException("Unexpected CPU features format (missing closing parenthesis): " + parts[3]);
-            }
-            String model2Str = parts[3].substring(model2Start + 1, parts[3].length() - 1);
-            cpuModel2 = Integer.parseInt(model2Str.substring(2), 16);
-            revisionStr = parts[3].substring(0, model2Start);
-        }
-        int cpuRevision = Integer.parseInt(revisionStr);
-
-        // Neoverse N1 errata 1542419 affects r3p0, r3p1 and r4p0.
-        // It is fixed in r4p1 and later revisions.
-        if (cpuModel == NEOVERSE_N1_MODEL || cpuModel2 == NEOVERSE_N1_MODEL) {
-            isAffected = (cpuVariant == 3 && cpuRevision == 0) ||
-                         (cpuVariant == 3 && cpuRevision == 1) ||
-                         (cpuVariant == 4 && cpuRevision == 0);
-        }
-
-        printCPUInfo(cpuFamily, cpuVariant, cpuModel, cpuModel2, cpuRevision);
-    }
-
-    private static void printCPUInfo(int cpuFamily, int cpuVariant, int cpuModel, int cpuModel2, int cpuRevision) {
-        boolean isNeoverseN1 = (cpuFamily == CPU_ARM) &&
-                               (cpuModel == NEOVERSE_N1_MODEL || cpuModel2 == NEOVERSE_N1_MODEL);
-        System.out.println("\n=== CPU Information ===");
-        System.out.println("CPU Family: 0x" + Integer.toHexString(cpuFamily));
-        System.out.println("CPU Variant: 0x" + Integer.toHexString(cpuVariant));
-        System.out.println("CPU Model: 0x" + Integer.toHexString(cpuModel));
-        if (cpuModel2 != 0) {
-            System.out.println("CPU Model2: 0x" + Integer.toHexString(cpuModel2));
-        }
-        System.out.println("CPU Revision: " + cpuRevision);
-        System.out.println("Is Neoverse N1: " + isNeoverseN1);
-        System.out.println("Is affected by errata 1542419: " + isAffected);
-        System.out.println("======================\n");
-    }
-
-    /**
-     * Test case 1: Check the UseSingleICacheInvalidation and NeoverseN1ICacheErratumMitigation
-     * are set to true for Neoverse N1 pre-r4p1.
-     */
-    private static void testCase1_DefaultsOnNeoverseN1() throws Exception {
-        if (!isAffected) {
-            System.out.println("\nTest case 1: Skipping since CPU is not affected by Neoverse N1 errata 1542419");
-            return;
-        }
-
-        System.out.println("\nTest case 1: Check defaults on Neoverse N1 affected revisions");
-
-        ProcessBuilder pb = ProcessTools.createTestJavaProcessBuilder(
-            "-XX:+UnlockDiagnosticVMOptions",
-            "-XX:+PrintFlagsFinal",
-            "-version");
-
-        OutputAnalyzer output = new OutputAnalyzer(pb.start());
-        output.shouldHaveExitValue(0);
-
-        String output_str = output.getOutput();
-        boolean hasSingleEnabled = output_str.matches("(?s).*bool\\s+UseSingleICacheInvalidation\\s*=\\s*true.*");
-        boolean hasErrataEnabled = output_str.matches("(?s).*bool\\s+NeoverseN1ICacheErratumMitigation\\s*=\\s*true.*");
-
-        System.out.println("UseSingleICacheInvalidation enabled: " + hasSingleEnabled);
-        System.out.println("NeoverseN1ICacheErratumMitigation enabled: " + hasErrataEnabled);
-
-        // If running on affected Neoverse N1, both should be true
-        if (!hasSingleEnabled || !hasErrataEnabled) {
-            throw new RuntimeException("On affected Neoverse N1, both flags should be enabled by default");
-        }
-        System.out.println("Correctly enabled on affected Neoverse N1");
-    }
-
-    /**
-     * Test case 2: Check NeoverseN1ICacheErratumMitigation is false on unaffected CPUs.
-     */
-    private static void testCase2_DefaultsOnUnaffectedCPUs() throws Exception {
-        if (isAffected) {
-            System.out.println("\nTest case 2: Skipping since CPU is affected by Neoverse N1 errata 1542419");
-            return;
-        }
-
-        System.out.println("\nTest case 2: Check NeoverseN1ICacheErratumMitigation is false on unaffected CPUs");
-
-        ProcessBuilder pb = ProcessTools.createTestJavaProcessBuilder(
-            "-XX:+UnlockDiagnosticVMOptions",
-            "-XX:+PrintFlagsFinal",
-            "-version");
-
-        OutputAnalyzer output = new OutputAnalyzer(pb.start());
-        output.shouldHaveExitValue(0);
-
-        String output_str = output.getOutput();
-        boolean hasErrataEnabled = output_str.matches("(?s).*bool\\s+NeoverseN1ICacheErratumMitigation\\s*=\\s*true.*");
-
-        System.out.println("NeoverseN1ICacheErratumMitigation enabled: " + hasErrataEnabled);
-
-        // On non-Neoverse N1 or unaffected Neoverse N1 CPUs, NeoverseN1ICacheErratumMitigation should be false
-        if (hasErrataEnabled) {
-            throw new RuntimeException("On unaffected CPUs, NeoverseN1ICacheErratumMitigation should be disabled");
-        }
-        System.out.println("Correctly disabled on unaffected CPU");
-    }
-
-    /**
-     * Test case 3: Check if NeoverseN1ICacheErratumMitigation is set to false via cmd on affected CPUs,
-     * UseSingleICacheInvalidation is set to false.
-     */
-    private static void testCase3_ExplicitlyDisableErrataAffectsDeferred() throws Exception {
-        if (!isAffected) {
-            System.out.println("\nTest case 3: Skipping since CPU is not affected by Neoverse N1 errata 1542419");
-            return;
-        }
-
-        System.out.println("\nTest case 3: Explicitly disable NeoverseN1ICacheErratumMitigation, check UseSingleICacheInvalidation");
-
-        ProcessBuilder pb = ProcessTools.createTestJavaProcessBuilder(
-            "-XX:+UnlockDiagnosticVMOptions",
-            "-XX:-NeoverseN1ICacheErratumMitigation",
-            "-XX:+PrintFlagsFinal",
-            "-version");
-
-        OutputAnalyzer output = new OutputAnalyzer(pb.start());
-        output.shouldHaveExitValue(0);
-
-        String output_str = output.getOutput();
-        boolean hasSingleDisabled = output_str.matches("(?s).*bool\\s+UseSingleICacheInvalidation\\s*=\\s*false.*");
-        boolean hasErrataDisabled = output_str.matches("(?s).*bool\\s+NeoverseN1ICacheErratumMitigation\\s*=\\s*false.*");
-
-        System.out.println("NeoverseN1ICacheErratumMitigation disabled: " + hasErrataDisabled);
-        System.out.println("UseSingleICacheInvalidation disabled: " + hasSingleDisabled);
-
-        if (!hasErrataDisabled) {
-            throw new RuntimeException("Failed to disable NeoverseN1ICacheErratumMitigation via command line");
-        }
-
-        // On affected CPUs, disabling errata should also disable UseSingleICacheInvalidation
-        if (!hasSingleDisabled) {
-            throw new RuntimeException("On affected CPU, disabling NeoverseN1ICacheErratumMitigation should also disable UseSingleICacheInvalidation");
-        }
-        System.out.println("Correctly synchronized on affected CPU");
-    }
-
-    /**
-     * Test case 4: Check JVM reports an error if UseSingleICacheInvalidation is set to true
-     * but NeoverseN1ICacheErratumMitigation is set to false on affected CPUs.
-     */
-    private static void testCase4_ConflictingFlagsOnAffectedCPUs() throws Exception {
-        if (!isAffected) {
-            System.out.println("\nTest case 4: Skipping since CPU is not affected by Neoverse N1 errata 1542419");
-            return;
-        }
-
-        System.out.println("\nTest case 4: Try to set UseSingleICacheInvalidation=true with NeoverseN1ICacheErratumMitigation=false");
-
-        ProcessBuilder pb = ProcessTools.createTestJavaProcessBuilder(
-            "-XX:+UnlockDiagnosticVMOptions",
-            "-XX:+UseSingleICacheInvalidation",
-            "-XX:-NeoverseN1ICacheErratumMitigation",
-            "-version");
-
-        OutputAnalyzer output = new OutputAnalyzer(pb.start());
-
-        if (output.getExitValue() == 0) {
-            throw new RuntimeException("On affected CPU, conflicting flags should cause error");
-        }
-        output.shouldContain("Error");
-        System.out.println("JVM correctly rejected conflicting flags on affected CPU");
-    }
-
-    /**
-     * Test case 5: Check explicit NeoverseN1ICacheErratumMitigation=true enables UseSingleICacheInvalidation.
-     */
-    private static void testCase5_ExplicitlyEnableErrataEnablesDeferred() throws Exception {
-        if (!isAffected) {
-            System.out.println("\nTest case 5: Skipping since CPU is not affected by Neoverse N1 errata 1542419");
-            return;
-        }
-
-        System.out.println("\nTest case 5: Explicitly enable NeoverseN1ICacheErratumMitigation, check UseSingleICacheInvalidation");
-
-        ProcessBuilder pb = ProcessTools.createTestJavaProcessBuilder(
-            "-XX:+UnlockDiagnosticVMOptions",
-            "-XX:+NeoverseN1ICacheErratumMitigation",
-            "-XX:+PrintFlagsFinal",
-            "-version");
-
-        OutputAnalyzer output = new OutputAnalyzer(pb.start());
-        output.shouldHaveExitValue(0);
-
-        String output_str = output.getOutput();
-        boolean hasSingleEnabled = output_str.matches("(?s).*bool\\s+UseSingleICacheInvalidation\\s*=\\s*true.*");
-        boolean hasErrataEnabled = output_str.matches("(?s).*bool\\s+NeoverseN1ICacheErratumMitigation\\s*=\\s*true.*");
-
-        System.out.println("NeoverseN1ICacheErratumMitigation enabled: " + hasErrataEnabled);
-        System.out.println("UseSingleICacheInvalidation enabled: " + hasSingleEnabled);
-
-        if (!hasErrataEnabled) {
-            throw new RuntimeException("Failed to enable NeoverseN1ICacheErratumMitigation via command line");
-        }
-
-        if (!hasSingleEnabled) {
-            throw new RuntimeException("On affected CPU, enabling NeoverseN1ICacheErratumMitigation should also enable UseSingleICacheInvalidation");
-        }
-        System.out.println("Correctly synchronized on affected CPU");
-    }
-
-    /**
-     * Test case 6: Check both flags can be explicitly set to false.
-     */
-    private static void testCase6_ExplicitlyDisableBothFlags() throws Exception {
-        System.out.println("\nTest case 6: Explicitly disable both flags");
-
-        ProcessBuilder pb = ProcessTools.createTestJavaProcessBuilder(
-            "-XX:+UnlockDiagnosticVMOptions",
-            "-XX:-UseSingleICacheInvalidation",
-            "-XX:-NeoverseN1ICacheErratumMitigation",
-            "-XX:+PrintFlagsFinal",
-            "-version");
-
-        OutputAnalyzer output = new OutputAnalyzer(pb.start());
-        output.shouldHaveExitValue(0);
-
-        String output_str = output.getOutput();
-        boolean hasSingleDisabled = output_str.matches("(?s).*bool\\s+UseSingleICacheInvalidation\\s*=\\s*false.*");
-        boolean hasErrataDisabled = output_str.matches("(?s).*bool\\s+NeoverseN1ICacheErratumMitigation\\s*=\\s*false.*");
-
-        System.out.println("UseSingleICacheInvalidation disabled: " + hasSingleDisabled);
-        System.out.println("NeoverseN1ICacheErratumMitigation disabled: " + hasErrataDisabled);
-
-        if (!hasErrataDisabled) {
-            throw new RuntimeException("Failed to disable NeoverseN1ICacheErratumMitigation via command line");
-        }
-
-        if (!hasSingleDisabled) {
-            throw new RuntimeException("Failed to disable UseSingleICacheInvalidation via command line");
-        }
-
-        System.out.println("Successfully disabled both flags");
-    }
-
-    /**
-     * Test case 7: Check UseSingleICacheInvalidation=false with NeoverseN1ICacheErratumMitigation=true.
-     * On affected CPUs, this should error (conflicting requirement).
-     */
-    private static void testCase7_ConflictingErrataWithoutDeferred() throws Exception {
-        if (!isAffected) {
-            System.out.println("\nTest case 7: Skipping since CPU is not affected by Neoverse N1 errata 1542419");
-            return;
-        }
-        System.out.println("\nTest case 7: Try to set NeoverseN1ICacheErratumMitigation=true with UseSingleICacheInvalidation=false");
-
-        ProcessBuilder pb = ProcessTools.createTestJavaProcessBuilder(
-            "-XX:+UnlockDiagnosticVMOptions",
-            "-XX:-UseSingleICacheInvalidation",
-            "-XX:+NeoverseN1ICacheErratumMitigation",
-            "-XX:+PrintFlagsFinal",
-            "-version");
-
-        OutputAnalyzer output = new OutputAnalyzer(pb.start());
-
-        // This should fail on affected CPUs (conflicting requirement)
-        if (output.getExitValue() == 0) {
-            throw new RuntimeException("On affected CPU, setting NeoverseN1ICacheErratumMitigation=true with UseSingleICacheInvalidation=false should cause an error");
-        }
-        output.shouldContain("Error");
-        System.out.println("JVM correctly rejected conflicting flags on affected CPU");
-    }
-
-    /**
-     * Test case 8: Check setting NeoverseN1ICacheErratumMitigation=true on unaffected CPU causes an error.
-     */
-    private static void testCase8_EnablingErrataOnUnaffectedCPU() throws Exception {
-        if (isAffected) {
-            System.out.println("\nTest case 8: Skipping since CPU is affected by Neoverse N1 errata 1542419");
-            return;
-        }
-
-        System.out.println("\nTest case 8: Try to set NeoverseN1ICacheErratumMitigation=true on unaffected CPU");
-
-        ProcessBuilder pb = ProcessTools.createTestJavaProcessBuilder(
-            "-XX:+UnlockDiagnosticVMOptions",
-            "-XX:+NeoverseN1ICacheErratumMitigation",
-            "-version");
-
-        OutputAnalyzer output = new OutputAnalyzer(pb.start());
-
-        // This should fail on unaffected CPUs (errata not present)
-        if (output.getExitValue() == 0) {
-            throw new RuntimeException("On unaffected CPU, setting NeoverseN1ICacheErratumMitigation=true should cause error");
-        }
-        output.shouldContain("Error");
-        System.out.println("JVM correctly rejected enabling errata flag on unaffected CPU");
-    }
-}
diff --git a/test/hotspot/jtreg/gc/TestDeferredICacheInvalidation.java b/test/hotspot/jtreg/gc/TestDeferredICacheInvalidation.java
deleted file mode 100644
index 70cd1ab6d8c..00000000000
--- a/test/hotspot/jtreg/gc/TestDeferredICacheInvalidation.java
+++ /dev/null
@@ -1,306 +0,0 @@
-/*
- * Copyright Amazon.com Inc. or its affiliates. All Rights Reserved.
- * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
- *
- * This code is free software; you can redistribute it and/or modify it
- * under the terms of the GNU General Public License version 2 only, as
- * published by the Free Software Foundation.
- *
- * This code is distributed in the hope that it will be useful, but WITHOUT
- * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
- * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
- * version 2 for more details (a copy is included in the LICENSE file that
- * accompanied this code).
- *
- * You should have received a copy of the GNU General Public License version
- * 2 along with this work; if not, write to the Free Software Foundation,
- * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
- *
- * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
- * or visit www.oracle.com if you need additional information or have any
- * questions.
- *
- */
-
-package gc;
-
-/*
- * @test id=parallel
- * @bug 8370947
- * @summary Check no assertion is triggered when UseSingleICacheInvalidation is enabled for ParallelGC
- * @library /test/lib
- * @requires vm.debug
- * @requires vm.gc.Parallel
- * @build jdk.test.whitebox.WhiteBox
- * @run driver jdk.test.lib.helpers.ClassFileInstaller jdk.test.whitebox.WhiteBox
- * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions -XX:+WhiteBoxAPI -XX:+UseParallelGC -XX:-UseCodeCacheFlushing gc.TestDeferredICacheInvalidation youngGC C1
- * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions -XX:+WhiteBoxAPI -XX:+UseParallelGC -XX:-UseCodeCacheFlushing gc.TestDeferredICacheInvalidation fullGC C1
- * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions -XX:+WhiteBoxAPI -XX:+UseParallelGC -XX:-UseCodeCacheFlushing gc.TestDeferredICacheInvalidation youngGC C2
- * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions -XX:+WhiteBoxAPI -XX:+UseParallelGC -XX:-UseCodeCacheFlushing gc.TestDeferredICacheInvalidation fullGC C2
- */
-
-/*
- * @test id=g1
- * @bug 8370947
- * @summary Check no assertion is triggered when UseSingleICacheInvalidation is enabled for G1GC
- * @library /test/lib
- * @requires vm.debug
- * @requires vm.gc.G1
- * @build jdk.test.whitebox.WhiteBox
- * @run driver jdk.test.lib.helpers.ClassFileInstaller jdk.test.whitebox.WhiteBox
- * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions -XX:+WhiteBoxAPI -XX:+UseG1GC -XX:-UseCodeCacheFlushing gc.TestDeferredICacheInvalidation youngGC C1
- * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions -XX:+WhiteBoxAPI -XX:+UseG1GC -XX:-UseCodeCacheFlushing gc.TestDeferredICacheInvalidation fullGC C1
- * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions -XX:+WhiteBoxAPI -XX:+UseG1GC -XX:-UseCodeCacheFlushing gc.TestDeferredICacheInvalidation youngGC C2
- * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions -XX:+WhiteBoxAPI -XX:+UseG1GC -XX:-UseCodeCacheFlushing gc.TestDeferredICacheInvalidation fullGC C2
- */
-
-/*
- * @test id=shenandoah
- * @bug 8370947
- * @summary Check no assertion is triggered when UseSingleICacheInvalidation is enabled for ShenandoahGC
- * @library /test/lib
- * @requires vm.debug
- * @requires vm.gc.Shenandoah
- * @build jdk.test.whitebox.WhiteBox
- * @run driver jdk.test.lib.helpers.ClassFileInstaller jdk.test.whitebox.WhiteBox
- * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions -XX:+WhiteBoxAPI -XX:+UseShenandoahGC -XX:-UseCodeCacheFlushing gc.TestDeferredICacheInvalidation fullGC C1
- * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions -XX:+WhiteBoxAPI -XX:+UseShenandoahGC -XX:-UseCodeCacheFlushing gc.TestDeferredICacheInvalidation fullGC C2
- */
-
-/*
- * @test id=genshen
- * @bug 8370947
- * @summary Check no assertion is triggered when UseSingleICacheInvalidation is enabled for generational ShenandoahGC
- * @library /test/lib
- * @requires vm.debug
- * @requires vm.gc.Shenandoah
- * @build jdk.test.whitebox.WhiteBox
- * @run driver jdk.test.lib.helpers.ClassFileInstaller jdk.test.whitebox.WhiteBox
- * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions -XX:+WhiteBoxAPI -XX:+UseShenandoahGC -XX:+UnlockExperimentalVMOptions -XX:ShenandoahGCMode=generational -XX:-UseCodeCacheFlushing gc.TestDeferredICacheInvalidation youngGC C1
- * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions -XX:+WhiteBoxAPI -XX:+UseShenandoahGC -XX:+UnlockExperimentalVMOptions -XX:ShenandoahGCMode=generational -XX:-UseCodeCacheFlushing gc.TestDeferredICacheInvalidation fullGC C1
- * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions -XX:+WhiteBoxAPI -XX:+UseShenandoahGC -XX:+UnlockExperimentalVMOptions -XX:ShenandoahGCMode=generational -XX:-UseCodeCacheFlushing gc.TestDeferredICacheInvalidation youngGC C2
- * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions -XX:+WhiteBoxAPI -XX:+UseShenandoahGC -XX:+UnlockExperimentalVMOptions -XX:ShenandoahGCMode=generational -XX:-UseCodeCacheFlushing gc.TestDeferredICacheInvalidation fullGC C2
- */
-
-/*
- * @test id=z
- * @bug 8370947
- * @summary Check no assertion is triggered when UseSingleICacheInvalidation is enabled for ZGC
- * @library /test/lib
- * @requires vm.debug
- * @requires vm.gc.Z
- * @build jdk.test.whitebox.WhiteBox
- * @run driver jdk.test.lib.helpers.ClassFileInstaller jdk.test.whitebox.WhiteBox
- * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions -XX:+WhiteBoxAPI -XX:+UseZGC -XX:-UseCodeCacheFlushing gc.TestDeferredICacheInvalidation youngGC C1
- * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions -XX:+WhiteBoxAPI -XX:+UseZGC -XX:-UseCodeCacheFlushing gc.TestDeferredICacheInvalidation fullGC C1
- * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions -XX:+WhiteBoxAPI -XX:+UseZGC -XX:-UseCodeCacheFlushing gc.TestDeferredICacheInvalidation youngGC C2
- * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions -XX:+WhiteBoxAPI -XX:+UseZGC -XX:-UseCodeCacheFlushing gc.TestDeferredICacheInvalidation fullGC C2
- */
-
-/*
- * Nmethods have GC barriers and OOPs embedded into their code. GCs can patch nmethod's code
- * which requires icache invalidation. Doing invalidation per instruction can be expensive.
- * CPU can support hardware dcache and icache coherence. This would allow to defer cache
- * invalidation.
- *
- * There are assertions for deferred cache invalidation. This test checks that all of them
- * are passed.
- */
-
-import java.util.concurrent.atomic.AtomicBoolean;
-import java.util.concurrent.locks.ReentrantReadWriteLock;
-
-import jdk.test.whitebox.WhiteBox;
-
-public class TestDeferredICacheInvalidation {
-
-    private static final WhiteBox WB = WhiteBox.getWhiteBox();
-
-    public static class A {
-        public String s1;
-        public String s2;
-        public String s3;
-        public String s4;
-        public String s5;
-        public String s6;
-        public String s7;
-        public String s8;
-        public String s9;
-    }
-
-    public static A a = new A();
-
-    private static int compLevel;
-
-    public static class B {
-        public static void test0() {
-        }
-
-        public static void test1() {
-            a.s1 = a.s1 + "1";
-        }
-
-        public static void test2() {
-            a.s1 = a.s1 + "1";
-            a.s2 = a.s2 + "2";
-        }
-
-        public static void test3() {
-            a.s1 = a.s1 + "1";
-            a.s2 = a.s2 + "2";
-            a.s3 = a.s3 + "3";
-        }
-
-        public static void test4() {
-            a.s1 = a.s1 + "1";
-            a.s2 = a.s2 + "2";
-            a.s3 = a.s3 + "3";
-            a.s4 = a.s4 + "4";
-        }
-
-        public static void test5() {
-            a.s1 = a.s1 + "1";
-            a.s2 = a.s2 + "2";
-            a.s3 = a.s3 + "3";
-            a.s4 = a.s4 + "4";
-            a.s5 = a.s5 + "5";
-        }
-
-        public static void test6() {
-            a.s1 = a.s1 + "1";
-            a.s2 = a.s2 + "2";
-            a.s3 = a.s3 + "3";
-            a.s4 = a.s4 + "4";
-            a.s5 = a.s5 + "5";
-            a.s6 = a.s6 + "6";
-        }
-
-        public static void test7() {
-            a.s1 = a.s1 + "1";
-            a.s2 = a.s2 + "2";
-            a.s3 = a.s3 + "3";
-            a.s4 = a.s4 + "4";
-            a.s5 = a.s5 + "5";
-            a.s6 = a.s6 + "6";
-            a.s7 = a.s7 + "7";
-        }
-
-        public static void test8() {
-            a.s1 = a.s1 + "1";
-            a.s2 = a.s2 + "2";
-            a.s3 = a.s3 + "3";
-            a.s4 = a.s4 + "4";
-            a.s5 = a.s5 + "5";
-            a.s6 = a.s6 + "6";
-            a.s7 = a.s7 + "7";
-            a.s8 = a.s8 + "8";
-        }
-
-        public static void test9() {
-            a.s1 = a.s1 + "1";
-            a.s2 = a.s2 + "2";
-            a.s3 = a.s3 + "3";
-            a.s4 = a.s4 + "4";
-            a.s5 = a.s5 + "5";
-            a.s6 = a.s6 + "6";
-            a.s7 = a.s7 + "7";
-            a.s8 = a.s8 + "8";
-            a.s9 = a.s9 + "9";
-        }
-    }
-
-    private static void compileMethods() throws Exception {
-        for (var m : B.class.getDeclaredMethods()) {
-            if (!m.getName().startsWith("test")) {
-                continue;
-            }
-            m.invoke(null);
-            WB.markMethodProfiled(m);
-            WB.enqueueMethodForCompilation(m, compLevel);
-            while (WB.isMethodQueuedForCompilation(m)) {
-                Thread.sleep(100);
-            }
-            if (WB.getMethodCompilationLevel(m) != compLevel) {
-                throw new IllegalStateException("Method " + m + " is not compiled at the compilation level: " + compLevel + ". Got: " + WB.getMethodCompilationLevel(m));
-            }
-        }
-    }
-
-    public static void youngGC() throws Exception {
-        a = null;
-        WB.youngGC();
-    }
-
-    public static void fullGC() throws Exception {
-        // Thread synchronization
-        final ReentrantReadWriteLock rwLock = new ReentrantReadWriteLock();
-        final ReentrantReadWriteLock.ReadLock readLock = rwLock.readLock();
-        final ReentrantReadWriteLock.WriteLock writeLock = rwLock.writeLock();
-        final AtomicBoolean running = new AtomicBoolean(true);
-
-        // Thread 1: GC thread that runs for 1 second with 100ms sleep intervals
-        Thread gcThread = new Thread(() -> {
-            final long startTime = System.currentTimeMillis();
-            final long duration = 1000;
-            try {
-                while (System.currentTimeMillis() - startTime < duration) {
-                    writeLock.lock();
-                    try {
-                        a = new A();
-                        WB.fullGC();
-                    } finally {
-                        writeLock.unlock();
-                    }
-                    Thread.sleep(100);
-                }
-            } catch (InterruptedException e) {
-                // Thread interrupted, exit
-            }
-            running.set(false);
-        });
-
-        // Threads 2-11: Test threads that execute test0() through test9()
-        Thread[] testThreads = new Thread[10];
-        for (int i = 0; i < 10; i++) {
-            final int testIdx = i;
-            testThreads[i] = new Thread(() -> {
-                try {
-                    var method = B.class.getDeclaredMethod("test" + testIdx);
-                    while (running.get()) {
-                        readLock.lock();
-                        try {
-                            method.invoke(null);
-                        } finally {
-                            readLock.unlock();
-                        }
-                    }
-                } catch (Exception e) {
-                    e.printStackTrace();
-                    System.exit(10);
-                }
-            });
-        }
-
-        // Start all threads
-        gcThread.start();
-        for (Thread t : testThreads) {
-            t.start();
-        }
-
-        // Wait for all threads to complete
-        gcThread.join();
-        for (Thread t : testThreads) {
-            t.join();
-        }
-    }
-
-    public static void main(String[] args) throws Exception {
-        if (!Boolean.TRUE.equals(WB.getBooleanVMFlag("UseSingleICacheInvalidation"))) {
-            System.out.println("Skip. Test requires UseSingleICacheInvalidation enabled.");
-            return;
-        }
-        compLevel = (args[1].equals("C1")) ? 1 : 4;
-        compileMethods();
-        TestDeferredICacheInvalidation.class.getMethod(args[0]).invoke(null);
-    }
-}
diff --git a/test/micro/org/openjdk/bench/vm/gc/GCPatchingNmethodCost.java b/test/micro/org/openjdk/bench/vm/gc/GCPatchingNmethodCost.java
deleted file mode 100644
index 53fa2378ead..00000000000
--- a/test/micro/org/openjdk/bench/vm/gc/GCPatchingNmethodCost.java
+++ /dev/null
@@ -1,206 +0,0 @@
-/*
- * Copyright Amazon.com Inc. or its affiliates. All Rights Reserved.
- * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
- *
- * This code is free software; you can redistribute it and/or modify it
- * under the terms of the GNU General Public License version 2 only, as
- * published by the Free Software Foundation.
- *
- * This code is distributed in the hope that it will be useful, but WITHOUT
- * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
- * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
- * version 2 for more details (a copy is included in the LICENSE file that
- * accompanied this code).
- *
- * You should have received a copy of the GNU General Public License version
- * 2 along with this work; if not, write to the Free Software Foundation,
- * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
- *
- * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
- * or visit www.oracle.com if you need additional information or have any
- * questions.
- *
- */
-
-package org.openjdk.bench.vm.gc;
-
-import java.lang.reflect.Method;
-import java.util.*;
-import java.util.concurrent.TimeUnit;
-
-import org.openjdk.jmh.annotations.Benchmark;
-import org.openjdk.jmh.annotations.BenchmarkMode;
-import org.openjdk.jmh.annotations.CompilerControl;
-import org.openjdk.jmh.annotations.Fork;
-import org.openjdk.jmh.annotations.Level;
-import org.openjdk.jmh.annotations.Mode;
-import org.openjdk.jmh.annotations.Measurement;
-import org.openjdk.jmh.annotations.OutputTimeUnit;
-import org.openjdk.jmh.annotations.Param;
-import org.openjdk.jmh.annotations.Scope;
-import org.openjdk.jmh.annotations.Setup;
-import org.openjdk.jmh.annotations.State;
-import org.openjdk.jmh.annotations.Warmup;
-
-import org.openjdk.bench.util.InMemoryJavaCompiler;
-
-import jdk.test.whitebox.WhiteBox;
-import jdk.test.whitebox.code.NMethod;
-
-/*
- * Nmethods have OOPs and GC barriers emmedded into their code.
- * GCs patch them which causes invalidation of nmethods' code.
- *
- * This benchmark can be used to estimate the cost of patching
- * OOPs and GC barriers.
- *
- * We create 5000 nmethods which access fields of a class.
- * We measure the time of different GC cycles to see
- * the impact of patching nmethods.
- *
- * The benchmark parameters are method count and accessed field count.
- */
-
-@BenchmarkMode(Mode.SingleShotTime)
-@OutputTimeUnit(TimeUnit.MILLISECONDS)
-@State(Scope.Benchmark)
-@Fork(value = 1, jvmArgsAppend = {
-    "-XX:+UnlockDiagnosticVMOptions",
-    "-XX:+UnlockExperimentalVMOptions",
-    "-XX:+WhiteBoxAPI",
-    "-Xbootclasspath/a:lib-test/wb.jar",
-    "-XX:-UseCodeCacheFlushing"
-})
-@Warmup(iterations = 5)
-@Measurement(iterations = 5)
-public class GCPatchingNmethodCost {
-
-    private static final int COMP_LEVEL = 1;
-    private static final String FIELD_USER = "FieldUser";
-
-    public static Fields fields;
-
-    private static TestMethod[] methods = {};
-    private static byte[] BYTE_CODE;
-    private static WhiteBox WB;
-
-    @Param({"5000"})
-    public int methodCount;
-
-    @Param({"0", "2", "4", "8"})
-    public int accessedFieldCount;
-
-    public static class Fields {
-        public String f1;
-        public String f2;
-        public String f3;
-        public String f4;
-        public String f5;
-        public String f6;
-        public String f7;
-        public String f8;
-        public String f9;
-    }
-
-    private static final class TestMethod {
-        private final Method method;
-
-        public TestMethod(Method method) throws Exception {
-            this.method = method;
-            WB.testSetDontInlineMethod(method, true);
-        }
-
-        public void profile() throws Exception {
-            method.invoke(null);
-            WB.markMethodProfiled(method);
-        }
-
-        public void invoke() throws Exception {
-            method.invoke(null);
-        }
-
-        public void compile() throws Exception {
-            WB.enqueueMethodForCompilation(method, COMP_LEVEL);
-            while (WB.isMethodQueuedForCompilation(method)) {
-                Thread.onSpinWait();
-            }
-            if (WB.getMethodCompilationLevel(method) != COMP_LEVEL) {
-                throw new IllegalStateException("Method " + method + " is not compiled at the compilation level: " + COMP_LEVEL + ". Got: " + WB.getMethodCompilationLevel(method));
-            }
-        }
-
-        public NMethod getNMethod() {
-            return NMethod.get(method, false);
-        }
-    }
-
-    private static ClassLoader createClassLoader() {
-        return new ClassLoader() {
-            @Override
-            public Class<?> loadClass(String name) throws ClassNotFoundException {
-                if (!name.equals(FIELD_USER)) {
-                    return super.loadClass(name);
-                }
-
-                return defineClass(name, BYTE_CODE, 0, BYTE_CODE.length);
-            }
-        };
-    }
-
-    private static void createTestMethods(int accessedFieldCount, int count) throws Exception {
-        String javaCode = "public class " + FIELD_USER + " {";
-        String field = GCPatchingNmethodCost.class.getName() + ".fields.f";
-        javaCode += "public static void accessFields() {";
-        for (int i = 1; i <= accessedFieldCount; i++) {
-            javaCode += field + i + "= " + field + i + " + " + i + ";";
-        }
-        javaCode += "}}";
-
-        BYTE_CODE = InMemoryJavaCompiler.compile(FIELD_USER, javaCode);
-
-        fields = new Fields();
-
-        methods = new TestMethod[count];
-        for (int i = 0; i < count; i++) {
-            var cl = createClassLoader().loadClass(FIELD_USER);
-            Method method = cl.getMethod("accessFields");
-            methods[i] = new TestMethod(method);
-            methods[i].profile();
-            methods[i].compile();
-        }
-    }
-
-    private static void initWhiteBox() {
-        WB = WhiteBox.getWhiteBox();
-    }
-
-    @Setup(Level.Trial)
-    public void setupCodeCache() throws Exception {
-        initWhiteBox();
-        createTestMethods(accessedFieldCount, methodCount);
-        System.gc();
-    }
-
-    @Setup(Level.Iteration)
-    public void setupIteration() {
-        fields = new Fields();
-    }
-
-    @Benchmark
-    public void youngGC() throws Exception {
-        fields = null;
-        WB.youngGC();
-    }
-
-    @Benchmark
-    public void fullGC() throws Exception {
-        fields = null;
-        WB.fullGC();
-    }
-
-    @Benchmark
-    public void systemGC() throws Exception {
-        fields = null;
-        System.gc();
-    }
-}

From 2a6d92fd2725ad0bc26c54275aecf591a83d20a4 Mon Sep 17 00:00:00 2001
From: Ashutosh Mehra <asmehra@openjdk.org>
Date: Wed, 25 Mar 2026 14:59:18 +0000
Subject: [PATCH 345/655] 8380703: Assertion failure in
 TestCodeEntryAlignment.java

Reviewed-by: kvn, adinn
---
 src/hotspot/share/runtime/stubRoutines.cpp | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/src/hotspot/share/runtime/stubRoutines.cpp b/src/hotspot/share/runtime/stubRoutines.cpp
index 5246613738e..56d832d3fef 100644
--- a/src/hotspot/share/runtime/stubRoutines.cpp
+++ b/src/hotspot/share/runtime/stubRoutines.cpp
@@ -219,12 +219,12 @@ static BufferBlob* initialize_stubs(BlobId blob_id,
     if (STUBGEN_BLOB_FIELD_NAME(blob_name) == nullptr) {                \
       BlobId blob_id = BlobId:: JOIN3(stubgen, blob_name, id);          \
       int size = _ ## blob_name ## _code_size;                          \
-      int max_aligned_size = 10;                                        \
+      int max_aligned_stubs = StubInfo::stub_count(blob_id);            \
       const char* timer_msg = "StubRoutines generation " # blob_name " stubs"; \
       const char* name = "StubRoutines (" # blob_name " stubs)";        \
       const char* assert_msg = "_" # blob_name "_code_size";            \
       STUBGEN_BLOB_FIELD_NAME(blob_name) =                              \
-        initialize_stubs(blob_id, size, max_aligned_size, timer_msg,    \
+        initialize_stubs(blob_id, size, max_aligned_stubs, timer_msg,   \
                          name, assert_msg);                             \
     }                                                                   \
   }

From ca0bee78f51d5ff21cb318b9d4c8a702eca28c13 Mon Sep 17 00:00:00 2001
From: Kim Barrett <kbarrett@openjdk.org>
Date: Wed, 25 Mar 2026 15:19:32 +0000
Subject: [PATCH 346/655] 8374915: Move assertion in
 GenericTaskQueue<>::pop_global()

Reviewed-by: tschatzl, ayang
---
 src/hotspot/share/gc/shared/taskqueue.inline.hpp | 8 +++-----
 1 file changed, 3 insertions(+), 5 deletions(-)

diff --git a/src/hotspot/share/gc/shared/taskqueue.inline.hpp b/src/hotspot/share/gc/shared/taskqueue.inline.hpp
index e77645f4fcf..b142aadc580 100644
--- a/src/hotspot/share/gc/shared/taskqueue.inline.hpp
+++ b/src/hotspot/share/gc/shared/taskqueue.inline.hpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2015, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2015, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -279,13 +279,11 @@ typename GenericTaskQueue<E, MT, N>::PopResult GenericTaskQueue<E, MT, N>::pop_g
   // Increment top; if it wraps, also increment tag, to distinguish it
   // from any recent _age for the same top() index.
   idx_t new_top = increment_index(oldAge.top());
+  // Don't use bottom, since a pop_local might have decremented it.
+  assert_not_underflow(localBot, new_top);
   idx_t new_tag = oldAge.tag() + ((new_top == 0) ? 1 : 0);
   Age newAge(new_top, new_tag);
   bool result = par_set_age(oldAge, newAge);
-
-  // Note that using "bottom" here might fail, since a pop_local might
-  // have decremented it.
-  assert_not_underflow(localBot, newAge.top());
   return result ? PopResult::Success : PopResult::Contended;
 }
 

From cf424480f42ac220adee7034e0319cee0e9039db Mon Sep 17 00:00:00 2001
From: Hai-May Chao <hchao@openjdk.org>
Date: Wed, 25 Mar 2026 15:29:34 +0000
Subject: [PATCH 347/655] 8375275: Error handling to raise illegal_parameter or
 internal_error alert in hybrid key exchange

Reviewed-by: wetmore, mpowers
---
 .../classes/sun/security/ssl/DHasKEM.java     | 37 ++++++++++++-
 .../sun/security/ssl/KAKeyDerivation.java     | 53 +++++++++++++++----
 2 files changed, 78 insertions(+), 12 deletions(-)

diff --git a/src/java.base/share/classes/sun/security/ssl/DHasKEM.java b/src/java.base/share/classes/sun/security/ssl/DHasKEM.java
index 763013f280c..ef5c5b82f06 100644
--- a/src/java.base/share/classes/sun/security/ssl/DHasKEM.java
+++ b/src/java.base/share/classes/sun/security/ssl/DHasKEM.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2025, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -101,7 +101,18 @@ public class DHasKEM implements KEMSpi {
                 return new KEM.Encapsulated(
                         sub(dh, from, to),
                         pkEm, null);
+
+            } catch (IllegalArgumentException e) {
+                // ECDH validation failure
+                // all-zero shared secret
+                throw e;
+            } catch (InvalidKeyException e) {
+                // Invalid peer public key
+                // Convert InvalidKeyException to an unchecked exception
+                throw new IllegalArgumentException("Invalid peer public key",
+                        e);
             } catch (Exception e) {
+                // Unexpected internal failure
                 throw new ProviderException("internal error", e);
             }
         }
@@ -126,6 +137,11 @@ public class DHasKEM implements KEMSpi {
                 PublicKey pkE = params.DeserializePublicKey(encapsulation);
                 SecretKey dh = params.DH(algorithm, skR, pkE);
                 return sub(dh, from, to);
+
+            } catch (IllegalArgumentException e) {
+                // ECDH validation failure
+                // all-zero shared secret
+                throw e;
             } catch (IOException | InvalidKeyException e) {
                 throw new DecapsulateException("Cannot decapsulate", e);
             } catch (Exception e) {
@@ -248,7 +264,24 @@ public class DHasKEM implements KEMSpi {
             KeyAgreement ka = KeyAgreement.getInstance(kaAlgorithm);
             ka.init(skE);
             ka.doPhase(pkR, true);
-            return ka.generateSecret(alg);
+            SecretKey secret = ka.generateSecret(alg);
+
+            // RFC 8446 section 7.4.2: checks for all-zero
+            // X25519/X448 shared secret.
+            if (kaAlgorithm.equals("X25519") ||
+                    kaAlgorithm.equals("X448")) {
+                byte[] s = secret.getEncoded();
+                for (byte b : s) {
+                    if (b != 0) {
+                        return secret;
+                    }
+                }
+                // Trigger ILLEGAL_PARAMETER alert
+                throw new IllegalArgumentException(
+                        "All-zero shared secret");
+            }
+
+            return secret;
         }
     }
 }
diff --git a/src/java.base/share/classes/sun/security/ssl/KAKeyDerivation.java b/src/java.base/share/classes/sun/security/ssl/KAKeyDerivation.java
index 39e82b50435..dea86351cc8 100644
--- a/src/java.base/share/classes/sun/security/ssl/KAKeyDerivation.java
+++ b/src/java.base/share/classes/sun/security/ssl/KAKeyDerivation.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2019, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2019, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -26,6 +26,7 @@ package sun.security.ssl;
 
 import sun.security.util.RawKeySpec;
 
+import javax.crypto.DecapsulateException;
 import javax.crypto.KDF;
 import javax.crypto.KEM;
 import javax.crypto.KeyAgreement;
@@ -35,6 +36,7 @@ import javax.net.ssl.SSLHandshakeException;
 
 import java.io.IOException;
 import java.security.GeneralSecurityException;
+import java.security.InvalidKeyException;
 import java.security.KeyFactory;
 import java.security.PrivateKey;
 import java.security.Provider;
@@ -173,6 +175,9 @@ public class KAKeyDerivation implements SSLKeyDerivation {
                     "encapsulation");
         }
 
+        // All exceptions thrown during KEM encapsulation are mapped
+        // to TLS fatal alerts:
+        // illegal_parameter alert or internal_error alert.
         try {
             KeyFactory kf = (provider != null) ?
                     KeyFactory.getInstance(algorithmName, provider) :
@@ -189,8 +194,18 @@ public class KAKeyDerivation implements SSLKeyDerivation {
             SecretKey derived = deriveHandshakeSecret(algorithm, sharedSecret);
 
             return new KEM.Encapsulated(derived, enc.encapsulation(), null);
-        } catch (GeneralSecurityException gse) {
-            throw new SSLHandshakeException("Could not generate secret", gse);
+        } catch (IllegalArgumentException | InvalidKeyException e) {
+            // Peer validation failure
+            // ECDH all-zero shared secret (RFC 8446 section 7.4.2),
+            // ML-KEM encapsulation key check failure (FIPS-203 section 7.2)
+            throw context.conContext.fatal(Alert.ILLEGAL_PARAMETER, e);
+        } catch (GeneralSecurityException e) {
+            // Cryptographic failure,
+            // deriveHandshakeSecret failure.
+            throw context.conContext.fatal(Alert.INTERNAL_ERROR, e);
+        } catch (RuntimeException e) {
+            // unexpected provider/runtime failure
+            throw context.conContext.fatal(Alert.INTERNAL_ERROR, e);
         } finally {
             KeyUtil.destroySecretKeys(sharedSecret);
         }
@@ -208,13 +223,30 @@ public class KAKeyDerivation implements SSLKeyDerivation {
                 // Using KEM: called by the client after receiving the KEM
                 // ciphertext (keyshare) from the server in ServerHello.
                 // The client decapsulates it using its private key.
-                KEM kem = (provider != null)
-                        ? KEM.getInstance(algorithmName, provider)
-                        : KEM.getInstance(algorithmName);
-                var decapsulator = kem.newDecapsulator(localPrivateKey);
-                sharedSecret = decapsulator.decapsulate(
-                        keyshare, 0, decapsulator.secretSize(),
-                        "TlsPremasterSecret");
+
+                // All exceptions thrown during KEM decapsulation are mapped
+                // to TLS fatal alerts:
+                // illegal_parameter alert or internal_error alert.
+                try {
+                    KEM kem = (provider != null)
+                            ? KEM.getInstance(algorithmName, provider)
+                            : KEM.getInstance(algorithmName);
+                    var decapsulator = kem.newDecapsulator(localPrivateKey);
+                    sharedSecret = decapsulator.decapsulate(
+                            keyshare, 0, decapsulator.secretSize(),
+                            "TlsPremasterSecret");
+                } catch (IllegalArgumentException | InvalidKeyException |
+                        DecapsulateException e) {
+                    // Peer validation failure
+                    // ECDH all-zero shared secret (RFC 8446 section 7.4.2)
+                    throw context.conContext.fatal(Alert.ILLEGAL_PARAMETER, e);
+                } catch (GeneralSecurityException e) {
+                    // cryptographic failure
+                    throw context.conContext.fatal(Alert.INTERNAL_ERROR, e);
+                } catch (RuntimeException e) {
+                    // unexpected provider/runtime failure
+                    throw context.conContext.fatal(Alert.INTERNAL_ERROR, e);
+                }
             } else {
                 // Using traditional DH-style Key Agreement
                 KeyAgreement ka = KeyAgreement.getInstance(algorithmName);
@@ -225,6 +257,7 @@ public class KAKeyDerivation implements SSLKeyDerivation {
 
             return deriveHandshakeSecret(type, sharedSecret);
         } catch (GeneralSecurityException gse) {
+            // deriveHandshakeSecret() failure
             throw new SSLHandshakeException("Could not generate secret", gse);
         } finally {
             KeyUtil.destroySecretKeys(sharedSecret);

From 02972a5856a60f27fe6b914b38d3398bf6d2f9c7 Mon Sep 17 00:00:00 2001
From: Hai-May Chao <hchao@openjdk.org>
Date: Wed, 25 Mar 2026 15:52:04 +0000
Subject: [PATCH 348/655] 8379549:
 sun/security/ssl/SSLSocketImpl/SSLSocketSSLEngineCloseInbound.java failed
 with SocketException: Connection reset by peer

Reviewed-by: wetmore, syan, dcubed
---
 .../SSLSocketSSLEngineCloseInbound.java       | 48 ++++++++++++++-----
 1 file changed, 37 insertions(+), 11 deletions(-)

diff --git a/test/jdk/sun/security/ssl/SSLSocketImpl/SSLSocketSSLEngineCloseInbound.java b/test/jdk/sun/security/ssl/SSLSocketImpl/SSLSocketSSLEngineCloseInbound.java
index e084bdd3367..dc0610ce8c8 100644
--- a/test/jdk/sun/security/ssl/SSLSocketImpl/SSLSocketSSLEngineCloseInbound.java
+++ b/test/jdk/sun/security/ssl/SSLSocketImpl/SSLSocketSSLEngineCloseInbound.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2011, 2023, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2011, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -29,6 +29,7 @@
 /*
  * @test
  * @bug 8273553 8253368
+ * @library /test/lib
  * @summary sun.security.ssl.SSLEngineImpl.closeInbound also has similar error
  *          of JDK-8253368
  * @run main/othervm SSLSocketSSLEngineCloseInbound TLSv1.3
@@ -79,12 +80,30 @@
  *      read()          ...             ChangeCipherSpec
  *      read()          ...             Finished
  */
-import javax.net.ssl.*;
+
+import javax.net.ssl.KeyManagerFactory;
+import javax.net.ssl.SSLEngine;
+import javax.net.ssl.SSLEngineResult;
 import javax.net.ssl.SSLEngineResult.*;
-import java.io.*;
-import java.net.*;
-import java.security.*;
-import java.nio.*;
+import javax.net.ssl.SSLException;
+import javax.net.ssl.SSLContext;
+import javax.net.ssl.SSLSession;
+import javax.net.ssl.SSLSocket;
+import javax.net.ssl.TrustManagerFactory;
+
+import java.io.File;
+import java.io.IOException;
+import java.io.InputStream;
+import java.io.OutputStream;
+import java.net.InetAddress;
+import java.net.ServerSocket;
+import java.net.Socket;
+import java.nio.ByteBuffer;
+import java.security.KeyStore;
+import java.security.Security;
+import java.util.concurrent.CountDownLatch;
+
+import jdk.test.lib.Utils;
 
 public class SSLSocketSSLEngineCloseInbound {
 
@@ -124,6 +143,8 @@ public class SSLSocketSSLEngineCloseInbound {
     private ByteBuffer cTOs;            // "reliable" transport client->server
     private ByteBuffer sTOc;            // "reliable" transport server->client
 
+    private final CountDownLatch serverReadyLatch = new CountDownLatch(1);
+
     /*
      * The following is to set up the keystores/trust material.
      */
@@ -224,7 +245,7 @@ public class SSLSocketSSLEngineCloseInbound {
 
             // server-side socket that will read
             try (Socket socket = serverSocket.accept()) {
-                socket.setSoTimeout(500);
+                socket.setSoTimeout((int)Utils.adjustTimeout(500));
 
                 InputStream is = socket.getInputStream();
                 OutputStream os = socket.getOutputStream();
@@ -289,6 +310,8 @@ public class SSLSocketSSLEngineCloseInbound {
                             throw new Exception("Server session is not valid");
                         }
 
+                        // Server signals client it has finished writing
+                        serverReadyLatch.countDown();
                         return;
                     }
 
@@ -315,6 +338,8 @@ public class SSLSocketSSLEngineCloseInbound {
                 }
             }
         } finally {
+            // Release the latch if an exception is thrown.
+            serverReadyLatch.countDown();
             if (serverException != null) {
                 if (clientException != null) {
                     serverException.initCause(clientException);
@@ -342,7 +367,8 @@ public class SSLSocketSSLEngineCloseInbound {
             public void run() {
                 // client-side socket
                 try (SSLSocket sslSocket = (SSLSocket)sslc.getSocketFactory().
-                            createSocket("localhost", port)) {
+                            createSocket(InetAddress.getLoopbackAddress(),
+                                    port)) {
                     clientSocket = sslSocket;
 
                     OutputStream os = sslSocket.getOutputStream();
@@ -365,9 +391,9 @@ public class SSLSocketSSLEngineCloseInbound {
                         throw new Exception("Client's session is not valid");
                     }
 
-                    // Give server a chance to read before we shutdown via
-                    // the try-with-resources block.
-                    Thread.sleep(2000);
+                    // Client waits for server to finish sending data
+                    // before shutdown.
+                    serverReadyLatch.await();
                 } catch (Exception e) {
                     clientException = e;
                 }

From 331c7540175ce1e7f992a49102eaa6ff5b24c42b Mon Sep 17 00:00:00 2001
From: Albert Mingkun Yang <ayang@openjdk.org>
Date: Wed, 25 Mar 2026 16:32:44 +0000
Subject: [PATCH 349/655] 8380523: Refactor TLAB slow allocation naming

Reviewed-by: stefank, jsikstro
---
 .../gc/shared/threadLocalAllocBuffer.cpp      | 176 +++++++++---------
 .../gc/shared/threadLocalAllocBuffer.hpp      |  44 ++---
 .../shared/threadLocalAllocBuffer.inline.hpp  |   2 +-
 src/hotspot/share/jvmci/vmStructs_jvmci.cpp   |   4 +-
 src/hotspot/share/runtime/vmStructs.cpp       |   7 +-
 5 files changed, 116 insertions(+), 117 deletions(-)

diff --git a/src/hotspot/share/gc/shared/threadLocalAllocBuffer.cpp b/src/hotspot/share/gc/shared/threadLocalAllocBuffer.cpp
index 9d995234736..f9b8694eb04 100644
--- a/src/hotspot/share/gc/shared/threadLocalAllocBuffer.cpp
+++ b/src/hotspot/share/gc/shared/threadLocalAllocBuffer.cpp
@@ -37,7 +37,7 @@
 #include "utilities/copy.hpp"
 
 size_t       ThreadLocalAllocBuffer::_max_size = 0;
-unsigned int ThreadLocalAllocBuffer::_target_refills = 0;
+unsigned int ThreadLocalAllocBuffer::_target_num_refills = 0;
 
 ThreadLocalAllocBuffer::ThreadLocalAllocBuffer() :
   _start(nullptr),
@@ -48,10 +48,10 @@ ThreadLocalAllocBuffer::ThreadLocalAllocBuffer() :
   _desired_size(0),
   _refill_waste_limit(0),
   _allocated_before_last_gc(0),
-  _number_of_refills(0),
+  _num_refills(0),
   _refill_waste(0),
   _gc_waste(0),
-  _slow_allocations(0),
+  _num_slow_allocations(0),
   _allocated_size(0),
   _allocation_fraction(TLABAllocationWeight) {
 
@@ -81,7 +81,7 @@ void ThreadLocalAllocBuffer::accumulate_and_reset_statistics(ThreadLocalAllocSta
 
   print_stats("gc");
 
-  if (_number_of_refills > 0) {
+  if (_num_refills > 0) {
     // Update allocation history if a reasonable amount of eden was allocated.
     bool update_allocation_history = used > 0.5 * capacity;
 
@@ -98,16 +98,16 @@ void ThreadLocalAllocBuffer::accumulate_and_reset_statistics(ThreadLocalAllocSta
       _allocation_fraction.sample(alloc_frac);
     }
 
-    stats->update_fast_allocations(_number_of_refills,
+    stats->update_fast_allocations(_num_refills,
                                    _allocated_size,
                                    _gc_waste,
                                    _refill_waste);
   } else {
-    assert(_number_of_refills == 0 && _refill_waste == 0 && _gc_waste == 0,
+    assert(_num_refills == 0 && _refill_waste == 0 && _gc_waste == 0,
            "tlab stats == 0");
   }
 
-  stats->update_slow_allocations(_slow_allocations);
+  stats->update_num_slow_allocations(_num_slow_allocations);
 
   reset_statistics();
 }
@@ -147,7 +147,7 @@ void ThreadLocalAllocBuffer::resize() {
   assert(ResizeTLAB, "Should not call this otherwise");
   size_t alloc = (size_t)(_allocation_fraction.average() *
                           (Universe::heap()->tlab_capacity() / HeapWordSize));
-  size_t new_size = alloc / _target_refills;
+  size_t new_size = alloc / _target_num_refills;
 
   new_size = clamp(new_size, min_size(), max_size());
 
@@ -156,24 +156,24 @@ void ThreadLocalAllocBuffer::resize() {
   log_trace(gc, tlab)("TLAB new size: thread: " PTR_FORMAT " [id: %2d]"
                       " refills %d  alloc: %8.6f desired_size: %zu -> %zu",
                       p2i(thread()), thread()->osthread()->thread_id(),
-                      _target_refills, _allocation_fraction.average(), desired_size(), aligned_new_size);
+                      _target_num_refills, _allocation_fraction.average(), desired_size(), aligned_new_size);
 
   set_desired_size(aligned_new_size);
   set_refill_waste_limit(initial_refill_waste_limit());
 }
 
 void ThreadLocalAllocBuffer::reset_statistics() {
-  _number_of_refills = 0;
-  _refill_waste      = 0;
-  _gc_waste          = 0;
-  _slow_allocations  = 0;
-  _allocated_size    = 0;
+  _num_refills          = 0;
+  _refill_waste         = 0;
+  _gc_waste             = 0;
+  _num_slow_allocations = 0;
+  _allocated_size       = 0;
 }
 
 void ThreadLocalAllocBuffer::fill(HeapWord* start,
                                   HeapWord* top,
                                   size_t    new_size) {
-  _number_of_refills++;
+  _num_refills++;
   _allocated_size += new_size;
   print_stats("fill");
   assert(top <= start + new_size - alignment_reserve(), "size too small");
@@ -205,7 +205,7 @@ void ThreadLocalAllocBuffer::initialize() {
   size_t capacity = Universe::heap()->tlab_capacity() / HeapWordSize;
   if (capacity > 0) {
     // Keep alloc_frac as float and not double to avoid the double to float conversion
-    float alloc_frac = desired_size() * target_refills() / (float)capacity;
+    float alloc_frac = desired_size() * target_num_refills() / (float)capacity;
     _allocation_fraction.sample(alloc_frac);
   }
 
@@ -219,10 +219,10 @@ void ThreadLocalAllocBuffer::startup_initialization() {
 
   // Assuming each thread's active tlab is, on average,
   // 1/2 full at a GC
-  _target_refills = 100 / (2 * TLABWasteTargetPercent);
-  // We need to set initial target refills to 2 to avoid a GC which causes VM
+  _target_num_refills = 100 / (2 * TLABWasteTargetPercent);
+  // We need to set the initial target number of refills to 2 to avoid a GC which causes VM
   // abort during VM initialization.
-  _target_refills = MAX2(_target_refills, 2U);
+  _target_num_refills = MAX2(_target_num_refills, 2U);
 
   // During jvm startup, the main thread is initialized
   // before the heap is initialized.  So reinitialize it now.
@@ -240,10 +240,10 @@ size_t ThreadLocalAllocBuffer::initial_desired_size() {
     init_sz = TLABSize / HeapWordSize;
   } else {
     // Initial size is a function of the average number of allocating threads.
-    unsigned int nof_threads = ThreadLocalAllocStats::allocating_threads_avg();
+    unsigned int num_threads = ThreadLocalAllocStats::num_allocating_threads_avg();
 
     init_sz  = (Universe::heap()->tlab_capacity() / HeapWordSize) /
-                      (nof_threads * target_refills());
+                      (num_threads * target_num_refills());
     init_sz = align_object_size(init_sz);
   }
   // We can't use clamp() between min_size() and max_size() here because some
@@ -271,10 +271,10 @@ void ThreadLocalAllocBuffer::print_stats(const char* tag) {
             " slow: %dB",
             tag, p2i(thrd), thrd->osthread()->thread_id(),
             _desired_size / (K / HeapWordSize),
-            _slow_allocations, _refill_waste_limit * HeapWordSize,
+            _num_slow_allocations, _refill_waste_limit * HeapWordSize,
             _allocation_fraction.average(),
             _allocation_fraction.average() * tlab_used / K,
-            _number_of_refills, waste_percent,
+            _num_refills, waste_percent,
             _gc_waste * HeapWordSize,
             _refill_waste * HeapWordSize);
 }
@@ -299,17 +299,17 @@ HeapWord* ThreadLocalAllocBuffer::hard_end() {
   return _allocation_end + alignment_reserve();
 }
 
-PerfVariable* ThreadLocalAllocStats::_perf_allocating_threads;
-PerfVariable* ThreadLocalAllocStats::_perf_total_refills;
-PerfVariable* ThreadLocalAllocStats::_perf_max_refills;
+PerfVariable* ThreadLocalAllocStats::_perf_num_allocating_threads;
+PerfVariable* ThreadLocalAllocStats::_perf_total_num_refills;
+PerfVariable* ThreadLocalAllocStats::_perf_max_num_refills;
 PerfVariable* ThreadLocalAllocStats::_perf_total_allocated_size;
 PerfVariable* ThreadLocalAllocStats::_perf_total_gc_waste;
 PerfVariable* ThreadLocalAllocStats::_perf_max_gc_waste;
 PerfVariable* ThreadLocalAllocStats::_perf_total_refill_waste;
 PerfVariable* ThreadLocalAllocStats::_perf_max_refill_waste;
-PerfVariable* ThreadLocalAllocStats::_perf_total_slow_allocations;
-PerfVariable* ThreadLocalAllocStats::_perf_max_slow_allocations;
-AdaptiveWeightedAverage ThreadLocalAllocStats::_allocating_threads_avg(0);
+PerfVariable* ThreadLocalAllocStats::_perf_total_num_slow_allocations;
+PerfVariable* ThreadLocalAllocStats::_perf_max_num_slow_allocations;
+AdaptiveWeightedAverage ThreadLocalAllocStats::_num_allocating_threads_avg(0);
 
 static PerfVariable* create_perf_variable(const char* name, PerfData::Units unit, TRAPS) {
   ResourceMark rm;
@@ -317,47 +317,47 @@ static PerfVariable* create_perf_variable(const char* name, PerfData::Units unit
 }
 
 void ThreadLocalAllocStats::initialize() {
-  _allocating_threads_avg = AdaptiveWeightedAverage(TLABAllocationWeight);
-  _allocating_threads_avg.sample(1); // One allocating thread at startup
+  _num_allocating_threads_avg = AdaptiveWeightedAverage(TLABAllocationWeight);
+  _num_allocating_threads_avg.sample(1); // One allocating thread at startup
 
   if (UsePerfData) {
     EXCEPTION_MARK;
-    _perf_allocating_threads      = create_perf_variable("allocThreads",   PerfData::U_None,  CHECK);
-    _perf_total_refills           = create_perf_variable("fills",          PerfData::U_None,  CHECK);
-    _perf_max_refills             = create_perf_variable("maxFills",       PerfData::U_None,  CHECK);
-    _perf_total_allocated_size    = create_perf_variable("alloc",          PerfData::U_Bytes, CHECK);
-    _perf_total_gc_waste          = create_perf_variable("gcWaste",        PerfData::U_Bytes, CHECK);
-    _perf_max_gc_waste            = create_perf_variable("maxGcWaste",     PerfData::U_Bytes, CHECK);
-    _perf_total_refill_waste      = create_perf_variable("refillWaste",    PerfData::U_Bytes, CHECK);
-    _perf_max_refill_waste        = create_perf_variable("maxRefillWaste", PerfData::U_Bytes, CHECK);
-    _perf_total_slow_allocations  = create_perf_variable("slowAlloc",      PerfData::U_None,  CHECK);
-    _perf_max_slow_allocations    = create_perf_variable("maxSlowAlloc",   PerfData::U_None,  CHECK);
+    _perf_num_allocating_threads     = create_perf_variable("allocThreads",   PerfData::U_None,  CHECK);
+    _perf_total_num_refills          = create_perf_variable("fills",          PerfData::U_None,  CHECK);
+    _perf_max_num_refills            = create_perf_variable("maxFills",       PerfData::U_None,  CHECK);
+    _perf_total_allocated_size       = create_perf_variable("alloc",          PerfData::U_Bytes, CHECK);
+    _perf_total_gc_waste             = create_perf_variable("gcWaste",        PerfData::U_Bytes, CHECK);
+    _perf_max_gc_waste               = create_perf_variable("maxGcWaste",     PerfData::U_Bytes, CHECK);
+    _perf_total_refill_waste         = create_perf_variable("refillWaste",    PerfData::U_Bytes, CHECK);
+    _perf_max_refill_waste           = create_perf_variable("maxRefillWaste", PerfData::U_Bytes, CHECK);
+    _perf_total_num_slow_allocations = create_perf_variable("slowAlloc",      PerfData::U_None,  CHECK);
+    _perf_max_num_slow_allocations   = create_perf_variable("maxSlowAlloc",   PerfData::U_None,  CHECK);
   }
 }
 
 ThreadLocalAllocStats::ThreadLocalAllocStats() :
-    _allocating_threads(0),
-    _total_refills(0),
-    _max_refills(0),
+    _num_allocating_threads(0),
+    _total_num_refills(0),
+    _max_num_refills(0),
     _total_allocated_size(0),
     _total_gc_waste(0),
     _max_gc_waste(0),
     _total_refill_waste(0),
     _max_refill_waste(0),
-    _total_slow_allocations(0),
-    _max_slow_allocations(0) {}
+    _total_num_slow_allocations(0),
+    _max_num_slow_allocations(0) {}
 
-unsigned int ThreadLocalAllocStats::allocating_threads_avg() {
-  return MAX2((unsigned int)(_allocating_threads_avg.average() + 0.5), 1U);
+unsigned int ThreadLocalAllocStats::num_allocating_threads_avg() {
+  return MAX2((unsigned int)(_num_allocating_threads_avg.average() + 0.5), 1U);
 }
 
-void ThreadLocalAllocStats::update_fast_allocations(unsigned int refills,
+void ThreadLocalAllocStats::update_fast_allocations(unsigned int num_refills,
                                                     size_t allocated_size,
                                                     size_t gc_waste,
                                                     size_t refill_waste) {
-  _allocating_threads      += 1;
-  _total_refills           += refills;
-  _max_refills              = MAX2(_max_refills, refills);
+  _num_allocating_threads  += 1;
+  _total_num_refills       += num_refills;
+  _max_num_refills          = MAX2(_max_num_refills, num_refills);
   _total_allocated_size    += allocated_size;
   _total_gc_waste          += gc_waste;
   _max_gc_waste             = MAX2(_max_gc_waste, gc_waste);
@@ -365,35 +365,35 @@ void ThreadLocalAllocStats::update_fast_allocations(unsigned int refills,
   _max_refill_waste         = MAX2(_max_refill_waste, refill_waste);
 }
 
-void ThreadLocalAllocStats::update_slow_allocations(unsigned int allocations) {
-  _total_slow_allocations += allocations;
-  _max_slow_allocations    = MAX2(_max_slow_allocations, allocations);
+void ThreadLocalAllocStats::update_num_slow_allocations(unsigned int num_slow_allocations) {
+  _total_num_slow_allocations += num_slow_allocations;
+  _max_num_slow_allocations    = MAX2(_max_num_slow_allocations, num_slow_allocations);
 }
 
 void ThreadLocalAllocStats::update(const ThreadLocalAllocStats& other) {
-  _allocating_threads      += other._allocating_threads;
-  _total_refills           += other._total_refills;
-  _max_refills              = MAX2(_max_refills, other._max_refills);
-  _total_allocated_size    += other._total_allocated_size;
-  _total_gc_waste          += other._total_gc_waste;
-  _max_gc_waste             = MAX2(_max_gc_waste, other._max_gc_waste);
-  _total_refill_waste      += other._total_refill_waste;
-  _max_refill_waste         = MAX2(_max_refill_waste, other._max_refill_waste);
-  _total_slow_allocations  += other._total_slow_allocations;
-  _max_slow_allocations     = MAX2(_max_slow_allocations, other._max_slow_allocations);
+  _num_allocating_threads     += other._num_allocating_threads;
+  _total_num_refills          += other._total_num_refills;
+  _max_num_refills             = MAX2(_max_num_refills, other._max_num_refills);
+  _total_allocated_size       += other._total_allocated_size;
+  _total_gc_waste             += other._total_gc_waste;
+  _max_gc_waste                = MAX2(_max_gc_waste, other._max_gc_waste);
+  _total_refill_waste         += other._total_refill_waste;
+  _max_refill_waste            = MAX2(_max_refill_waste, other._max_refill_waste);
+  _total_num_slow_allocations += other._total_num_slow_allocations;
+  _max_num_slow_allocations    = MAX2(_max_num_slow_allocations, other._max_num_slow_allocations);
 }
 
 void ThreadLocalAllocStats::reset() {
-  _allocating_threads      = 0;
-  _total_refills           = 0;
-  _max_refills             = 0;
-  _total_allocated_size    = 0;
-  _total_gc_waste          = 0;
-  _max_gc_waste            = 0;
-  _total_refill_waste      = 0;
-  _max_refill_waste        = 0;
-  _total_slow_allocations  = 0;
-  _max_slow_allocations    = 0;
+  _num_allocating_threads     = 0;
+  _total_num_refills          = 0;
+  _max_num_refills            = 0;
+  _total_allocated_size       = 0;
+  _total_gc_waste             = 0;
+  _max_gc_waste               = 0;
+  _total_refill_waste         = 0;
+  _max_refill_waste           = 0;
+  _total_num_slow_allocations = 0;
+  _max_num_slow_allocations   = 0;
 }
 
 void ThreadLocalAllocStats::publish() {
@@ -401,7 +401,7 @@ void ThreadLocalAllocStats::publish() {
     return;
   }
 
-  _allocating_threads_avg.sample(_allocating_threads);
+  _num_allocating_threads_avg.sample(_num_allocating_threads);
 
   const size_t waste = _total_gc_waste + _total_refill_waste;
   const double waste_percent = percent_of(waste, _total_allocated_size);
@@ -409,22 +409,22 @@ void ThreadLocalAllocStats::publish() {
                       " slow allocs: %d max %d waste: %4.1f%%"
                       " gc: %zuB max: %zuB"
                       " slow: %zuB max: %zuB",
-                      _allocating_threads, _total_refills, _max_refills,
-                      _total_slow_allocations, _max_slow_allocations, waste_percent,
+                      _num_allocating_threads, _total_num_refills, _max_num_refills,
+                      _total_num_slow_allocations, _max_num_slow_allocations, waste_percent,
                       _total_gc_waste * HeapWordSize, _max_gc_waste * HeapWordSize,
                       _total_refill_waste * HeapWordSize, _max_refill_waste * HeapWordSize);
 
   if (UsePerfData) {
-    _perf_allocating_threads      ->set_value(_allocating_threads);
-    _perf_total_refills           ->set_value(_total_refills);
-    _perf_max_refills             ->set_value(_max_refills);
-    _perf_total_allocated_size    ->set_value(_total_allocated_size);
-    _perf_total_gc_waste          ->set_value(_total_gc_waste);
-    _perf_max_gc_waste            ->set_value(_max_gc_waste);
-    _perf_total_refill_waste      ->set_value(_total_refill_waste);
-    _perf_max_refill_waste        ->set_value(_max_refill_waste);
-    _perf_total_slow_allocations  ->set_value(_total_slow_allocations);
-    _perf_max_slow_allocations    ->set_value(_max_slow_allocations);
+    _perf_num_allocating_threads      ->set_value(_num_allocating_threads);
+    _perf_total_num_refills           ->set_value(_total_num_refills);
+    _perf_max_num_refills             ->set_value(_max_num_refills);
+    _perf_total_allocated_size        ->set_value(_total_allocated_size);
+    _perf_total_gc_waste              ->set_value(_total_gc_waste);
+    _perf_max_gc_waste                ->set_value(_max_gc_waste);
+    _perf_total_refill_waste          ->set_value(_total_refill_waste);
+    _perf_max_refill_waste            ->set_value(_max_refill_waste);
+    _perf_total_num_slow_allocations  ->set_value(_total_num_slow_allocations);
+    _perf_max_num_slow_allocations    ->set_value(_max_num_slow_allocations);
   }
 }
 
diff --git a/src/hotspot/share/gc/shared/threadLocalAllocBuffer.hpp b/src/hotspot/share/gc/shared/threadLocalAllocBuffer.hpp
index 8c99523557e..67bc149013e 100644
--- a/src/hotspot/share/gc/shared/threadLocalAllocBuffer.hpp
+++ b/src/hotspot/share/gc/shared/threadLocalAllocBuffer.hpp
@@ -56,13 +56,13 @@ private:
   size_t    _refill_waste_limit;                 // hold onto tlab if free() is larger than this
   uint64_t  _allocated_before_last_gc;           // total bytes allocated up until the last gc
 
-  static size_t   _max_size;                          // maximum size of any TLAB
-  static unsigned _target_refills;                    // expected number of refills between GCs
+  static size_t   _max_size;                     // maximum size of any TLAB
+  static unsigned _target_num_refills;           // expected number of refills between GCs
 
-  unsigned  _number_of_refills;
+  unsigned  _num_refills;
   unsigned  _refill_waste;
   unsigned  _gc_waste;
-  unsigned  _slow_allocations;
+  unsigned  _num_slow_allocations;
   size_t    _allocated_size;
 
   AdaptiveWeightedAverage _allocation_fraction;  // fraction of eden allocated in tlabs
@@ -79,7 +79,7 @@ private:
 
   size_t initial_refill_waste_limit();
 
-  static int    target_refills()                 { return _target_refills; }
+  static int    target_num_refills()             { return _target_num_refills; }
   size_t initial_desired_size();
 
   size_t remaining();
@@ -98,9 +98,9 @@ private:
 
   // statistics
 
-  int number_of_refills() const { return _number_of_refills; }
-  int gc_waste() const          { return _gc_waste; }
-  int slow_allocations() const  { return _slow_allocations; }
+  int num_refills() const                        { return _num_refills; }
+  int gc_waste() const                           { return _gc_waste; }
+  int num_slow_allocations() const               { return _num_slow_allocations; }
 
 public:
   ThreadLocalAllocBuffer();
@@ -179,41 +179,41 @@ public:
 
 class ThreadLocalAllocStats : public StackObj {
 private:
-  static PerfVariable* _perf_allocating_threads;
-  static PerfVariable* _perf_total_refills;
-  static PerfVariable* _perf_max_refills;
+  static PerfVariable* _perf_num_allocating_threads;
+  static PerfVariable* _perf_total_num_refills;
+  static PerfVariable* _perf_max_num_refills;
   static PerfVariable* _perf_total_allocated_size;
   static PerfVariable* _perf_total_gc_waste;
   static PerfVariable* _perf_max_gc_waste;
   static PerfVariable* _perf_total_refill_waste;
   static PerfVariable* _perf_max_refill_waste;
-  static PerfVariable* _perf_total_slow_allocations;
-  static PerfVariable* _perf_max_slow_allocations;
+  static PerfVariable* _perf_total_num_slow_allocations;
+  static PerfVariable* _perf_max_num_slow_allocations;
 
-  static AdaptiveWeightedAverage _allocating_threads_avg;
+  static AdaptiveWeightedAverage _num_allocating_threads_avg;
 
-  unsigned int _allocating_threads;
-  unsigned int _total_refills;
-  unsigned int _max_refills;
+  unsigned int _num_allocating_threads;
+  unsigned int _total_num_refills;
+  unsigned int _max_num_refills;
   size_t       _total_allocated_size;
   size_t       _total_gc_waste;
   size_t       _max_gc_waste;
   size_t       _total_refill_waste;
   size_t       _max_refill_waste;
-  unsigned int _total_slow_allocations;
-  unsigned int _max_slow_allocations;
+  unsigned int _total_num_slow_allocations;
+  unsigned int _max_num_slow_allocations;
 
 public:
   static void initialize();
-  static unsigned int allocating_threads_avg();
+  static unsigned int num_allocating_threads_avg();
 
   ThreadLocalAllocStats();
 
-  void update_fast_allocations(unsigned int refills,
+  void update_fast_allocations(unsigned int num_refills,
                                size_t allocated_size,
                                size_t gc_waste,
                                size_t refill_waste);
-  void update_slow_allocations(unsigned int allocations);
+  void update_num_slow_allocations(unsigned int num_slow_allocations);
   void update(const ThreadLocalAllocStats& other);
 
   void reset();
diff --git a/src/hotspot/share/gc/shared/threadLocalAllocBuffer.inline.hpp b/src/hotspot/share/gc/shared/threadLocalAllocBuffer.inline.hpp
index 441686c5c4c..727467f98d0 100644
--- a/src/hotspot/share/gc/shared/threadLocalAllocBuffer.inline.hpp
+++ b/src/hotspot/share/gc/shared/threadLocalAllocBuffer.inline.hpp
@@ -82,7 +82,7 @@ void ThreadLocalAllocBuffer::record_slow_allocation(size_t obj_size) {
 
   set_refill_waste_limit(refill_waste_limit() + refill_waste_limit_increment());
 
-  _slow_allocations++;
+  _num_slow_allocations++;
 
   log_develop_trace(gc, tlab)("TLAB: %s thread: " PTR_FORMAT " [id: %2d]"
                               " obj: %zu"
diff --git a/src/hotspot/share/jvmci/vmStructs_jvmci.cpp b/src/hotspot/share/jvmci/vmStructs_jvmci.cpp
index 74314b0ad61..ac532e1bb4c 100644
--- a/src/hotspot/share/jvmci/vmStructs_jvmci.cpp
+++ b/src/hotspot/share/jvmci/vmStructs_jvmci.cpp
@@ -450,8 +450,8 @@
   nonstatic_field(ThreadLocalAllocBuffer,   _pf_top,                                          HeapWord*)                             \
   nonstatic_field(ThreadLocalAllocBuffer,   _desired_size,                                    size_t)                                \
   nonstatic_field(ThreadLocalAllocBuffer,   _refill_waste_limit,                              size_t)                                \
-  nonstatic_field(ThreadLocalAllocBuffer,   _number_of_refills,                               unsigned)                              \
-  nonstatic_field(ThreadLocalAllocBuffer,   _slow_allocations,                                unsigned)                              \
+  nonstatic_field(ThreadLocalAllocBuffer,   _num_refills,                                     unsigned)                              \
+  nonstatic_field(ThreadLocalAllocBuffer,   _num_slow_allocations,                            unsigned)                              \
                                                                                                                                      \
   nonstatic_field(SafepointMechanism::ThreadData, _polling_word,                              volatile uintptr_t)                    \
   nonstatic_field(SafepointMechanism::ThreadData, _polling_page,                              volatile uintptr_t)                    \
diff --git a/src/hotspot/share/runtime/vmStructs.cpp b/src/hotspot/share/runtime/vmStructs.cpp
index 93e0ff2f3b6..48f3f078ae8 100644
--- a/src/hotspot/share/runtime/vmStructs.cpp
+++ b/src/hotspot/share/runtime/vmStructs.cpp
@@ -335,11 +335,11 @@
   nonstatic_field(ThreadLocalAllocBuffer,      _pf_top,                                       HeapWord*)                             \
   nonstatic_field(ThreadLocalAllocBuffer,      _desired_size,                                 size_t)                                \
   nonstatic_field(ThreadLocalAllocBuffer,      _refill_waste_limit,                           size_t)                                \
-     static_field(ThreadLocalAllocBuffer,      _target_refills,                               unsigned)                              \
-  nonstatic_field(ThreadLocalAllocBuffer,      _number_of_refills,                            unsigned)                              \
+     static_field(ThreadLocalAllocBuffer,      _target_num_refills,                           unsigned)                              \
+  nonstatic_field(ThreadLocalAllocBuffer,      _num_refills,                                  unsigned)                              \
   nonstatic_field(ThreadLocalAllocBuffer,      _refill_waste,                                 unsigned)                              \
   nonstatic_field(ThreadLocalAllocBuffer,      _gc_waste,                                     unsigned)                              \
-  nonstatic_field(ThreadLocalAllocBuffer,      _slow_allocations,                             unsigned)                              \
+  nonstatic_field(ThreadLocalAllocBuffer,      _num_slow_allocations,                         unsigned)                              \
   nonstatic_field(VirtualSpace,                _low_boundary,                                 char*)                                 \
   nonstatic_field(VirtualSpace,                _high_boundary,                                char*)                                 \
   nonstatic_field(VirtualSpace,                _low,                                          char*)                                 \
@@ -2142,4 +2142,3 @@ void vmStructs_init() {
   VMStructs::init();
 }
 #endif // ASSERT
-

From 28529282545f6b59596a445409d59398253176f1 Mon Sep 17 00:00:00 2001
From: Ana-Maria Mihalceanu <amihalceanu@openjdk.org>
Date: Wed, 25 Mar 2026 17:20:46 +0000
Subject: [PATCH 350/655] 8380663: Update jcmd man page to include
 AOT.end_recording diagnostic command

Reviewed-by: kevinw, kvn
---
 src/jdk.jcmd/share/man/jcmd.md | 10 ++++++++++
 1 file changed, 10 insertions(+)

diff --git a/src/jdk.jcmd/share/man/jcmd.md b/src/jdk.jcmd/share/man/jcmd.md
index af3886a915c..23dfa67d864 100644
--- a/src/jdk.jcmd/share/man/jcmd.md
+++ b/src/jdk.jcmd/share/man/jcmd.md
@@ -134,6 +134,16 @@ The following commands are available:
 
     -   `-all`: (Optional) Show help for all commands (BOOLEAN, false) .
 
+`AOT.end_recording`
+:   Ends an in-progress AOT training and records the results to the file(s) specified by `-XX:AOTConfiguration` and/or `-XX:AOTCacheOutput`.
+
+    Impact: Low
+
+    **Note:**
+
+    The JVM must be started in AOT training mode using command-line arguments such as `-XX:AOTMode=record` or `-XX:AOTCacheOutput=<file>`.
+    The results of the AOT training can be an AOT configuration file, an AOT cache file, or both.
+
 `Compiler.CodeHeap_Analytics`  \[*function*\] \[*granularity*\]
 :   Print CodeHeap analytics
 

From 88bdbb78b2565e559d6f96cd099770951f17e8cc Mon Sep 17 00:00:00 2001
From: Justin Lu <jlu@openjdk.org>
Date: Wed, 25 Mar 2026 18:26:24 +0000
Subject: [PATCH 351/655] 8380472: Clean up test/jdk/jdk/nio/zipfs/PathOps.java
 shared file system usage

Reviewed-by: lancea, jpai
---
 test/jdk/jdk/nio/zipfs/PathOps.java | 421 +++++++++++++---------------
 1 file changed, 190 insertions(+), 231 deletions(-)

diff --git a/test/jdk/jdk/nio/zipfs/PathOps.java b/test/jdk/jdk/nio/zipfs/PathOps.java
index a035d425a3d..86b7946eba2 100644
--- a/test/jdk/jdk/nio/zipfs/PathOps.java
+++ b/test/jdk/jdk/nio/zipfs/PathOps.java
@@ -21,7 +21,6 @@
  * questions.
  */
 
-import org.junit.jupiter.api.AfterAll;
 import org.junit.jupiter.api.BeforeAll;
 import org.junit.jupiter.api.Test;
 import org.junit.jupiter.params.ParameterizedTest;
@@ -30,20 +29,20 @@ import org.junit.jupiter.params.provider.MethodSource;
 import org.junit.jupiter.params.provider.ValueSource;
 
 import java.io.IOException;
-import java.nio.file.FileSystem;
 import java.nio.file.FileSystems;
 import java.nio.file.Files;
 import java.nio.file.InvalidPathException;
 import java.nio.file.Path;
 import java.nio.file.Paths;
 import java.nio.file.ProviderMismatchException;
+import java.util.Objects;
 import java.util.stream.Stream;
 
 import static org.junit.jupiter.api.Assertions.assertEquals;
 import static org.junit.jupiter.api.Assertions.assertFalse;
 import static org.junit.jupiter.api.Assertions.assertNotNull;
 import static org.junit.jupiter.api.Assertions.assertThrows;
-import static org.junit.jupiter.api.Assertions.fail;
+import static org.junit.jupiter.api.Assertions.assertTrue;
 
 /*
  * @test
@@ -55,47 +54,48 @@ import static org.junit.jupiter.api.Assertions.fail;
  */
 public class PathOps {
 
-    static FileSystem fs;
+    // create empty JAR file, testing doesn't require any contents
+    static Path emptyJar;
 
-    // This test uses a static file system since some ops tested on
-    // Path depend on the same underlying `fs` instance
     @BeforeAll
     static void setup() throws IOException {
-        // create empty JAR file, test doesn't require any contents
-        Path emptyJar = Utils.createJarFile("empty.jar");
-        fs = FileSystems.newFileSystem(emptyJar);
-    }
-
-    @AfterAll
-    static void cleanup() throws IOException {
-        fs.close();
+        emptyJar = Utils.createJarFile("empty.jar");
     }
 
+    // Ensure NPEs are thrown for null inputs on Path ops
     @Test
-    void nullPointerTest() {
-        Path path = fs.getPath("foo");
-        assertThrows(NullPointerException.class, () -> path.resolve((String) null));
-        assertThrows(NullPointerException.class, () -> path.relativize(null));
-        assertThrows(NullPointerException.class, () -> path.compareTo(null));
-        assertThrows(NullPointerException.class, () -> path.startsWith((Path) null));
-        assertThrows(NullPointerException.class, () -> path.endsWith((Path) null));
+    void nullPointerTest() throws IOException {
+        try (var fs = FileSystems.newFileSystem(emptyJar)) {
+            Path path = fs.getPath("foo");
+            assertThrows(NullPointerException.class, () -> path.resolve((String) null));
+            assertThrows(NullPointerException.class, () -> path.relativize(null));
+            assertThrows(NullPointerException.class, () -> path.compareTo(null));
+            assertThrows(NullPointerException.class, () -> path.startsWith((Path) null));
+            assertThrows(NullPointerException.class, () -> path.endsWith((Path) null));
+        }
     }
 
+    // Ensure correct behavior when paths are provided by mismatched providers
     @Test
-    void mismatchedProvidersTest() {
-        Path path = fs.getPath("foo");
+    void mismatchedProvidersTest() throws IOException {
         Path other = Paths.get("foo");
-        assertThrows(ProviderMismatchException.class, () -> path.compareTo(other));
-        assertThrows(ProviderMismatchException.class, () -> path.resolve(other));
-        assertThrows(ProviderMismatchException.class, () -> path.relativize(other));
-        assertFalse(path.startsWith(other), "providerMismatched startsWith() returns true ");
-        assertFalse(path.endsWith(other), "providerMismatched endsWith() returns true ");
+        try (var fs = FileSystems.newFileSystem(emptyJar)) {
+            Path path = fs.getPath("foo");
+            assertThrows(ProviderMismatchException.class, () -> path.compareTo(other));
+            assertThrows(ProviderMismatchException.class, () -> path.resolve(other));
+            assertThrows(ProviderMismatchException.class, () -> path.relativize(other));
+            assertFalse(path.startsWith(other), "providerMismatched startsWith() returns true ");
+            assertFalse(path.endsWith(other), "providerMismatched endsWith() returns true ");
+        }
     }
 
+    // Ensure correct construction of paths when given sequence of strings
     @ParameterizedTest
     @MethodSource
-    void constructionTest(String first, String[] more, String expected) {
-        string(getPath(first, more), expected);
+    void constructionTest(String first, String[] more, String expected) throws IOException {
+        try (var fs = FileSystems.newFileSystem(emptyJar)) {
+            string(fs.getPath(first, more), expected);
+        }
     }
 
     static Stream<Arguments> constructionTest() {
@@ -112,22 +112,29 @@ public class PathOps {
         );
     }
 
+    // Ensure proper root, parent, and name components
     @Test
-    void allComponentsTest() {
-        var path = getPath("/a/b/c");
-        root(path, "/");
-        parent(path, "/a/b");
-        name(path, "c");
+    void allComponentsTest() throws IOException {
+        try (var fs = FileSystems.newFileSystem(emptyJar)) {
+            var path = fs.getPath("/a/b/c");
+            root(path, "/");
+            parent(path, "/a/b");
+            name(path, "c");
+        }
     }
 
+    // Ensure correct name count for root only and empty name
     @ParameterizedTest
     @MethodSource
-    void nameCountTest(String first, String root, String parent, String name, int nameCount) {
-        var path = getPath(first);
-        root(path, root);
-        parent(path, parent);
-        name(path, name);
-        nameCount(path, nameCount);
+    void nameCountTest(String first, String root, String parent, String name, int nameCount) throws IOException {
+        try (var fs = FileSystems.newFileSystem(emptyJar)) {
+            var path = fs.getPath(first);
+            root(path, root);
+            parent(path, parent);
+            name(path, name);
+            assertNotNull(path);
+            assertEquals(nameCount, path.getNameCount());
+        }
     }
 
     static Stream<Arguments> nameCountTest() {
@@ -139,13 +146,16 @@ public class PathOps {
         );
     }
 
+    // Ensure correct parent and name behavior for no root and name only
     @ParameterizedTest
     @MethodSource
-    void parentNameTest(String first, String root, String parent, String name) {
-        var path = getPath(first);
-        root(path, root);
-        parent(path, parent);
-        name(path, name);
+    void parentNameTest(String first, String root, String parent, String name) throws IOException {
+        try (var fs = FileSystems.newFileSystem(emptyJar)) {
+            var path = fs.getPath(first);
+            root(path, root);
+            parent(path, parent);
+            name(path, name);
+        }
     }
 
     static Stream<Arguments> parentNameTest() {
@@ -157,10 +167,16 @@ public class PathOps {
         );
     }
 
+    // Ensure correct (positive) `startsWith` behavior
     @ParameterizedTest
     @MethodSource
-    void startsWithTest(String first, String prefix) {
-        starts(getPath(first), prefix);
+    void startsWithTest(String first, String prefix) throws IOException {
+        try (var fs = FileSystems.newFileSystem(emptyJar)) {
+            var path = fs.getPath(first);
+            assertNotNull(path);
+            Path s = fs.getPath(prefix);
+            assertTrue(path.startsWith(s));
+        }
     }
 
     static Stream<Arguments> startsWithTest() {
@@ -180,10 +196,16 @@ public class PathOps {
         );
     }
 
+    // Ensure correct (negative) `startsWith` behavior
     @ParameterizedTest
     @MethodSource
-    void notStartsWithTest(String first, String prefix) {
-        notStarts(getPath(first), prefix);
+    void notStartsWithTest(String first, String prefix) throws IOException {
+        try (var fs = FileSystems.newFileSystem(emptyJar)) {
+            var path = fs.getPath(first);
+            assertNotNull(path);
+            Path s = fs.getPath(prefix);
+            assertFalse(path.startsWith(s));
+        }
     }
 
     static Stream<Arguments> notStartsWithTest() {
@@ -203,10 +225,16 @@ public class PathOps {
         );
     }
 
+    // Ensure correct (positive) `endsWith` behavior
     @ParameterizedTest
     @MethodSource
-    void endsWithTest(String first, String suffix) {
-        ends(getPath(first), suffix);
+    void endsWithTest(String first, String suffix) throws IOException {
+        try (var fs = FileSystems.newFileSystem(emptyJar)) {
+            var path = fs.getPath(first);
+            assertNotNull(path);
+            Path s = fs.getPath(suffix);
+            assertTrue(path.endsWith(s));
+        }
     }
 
     static Stream<Arguments> endsWithTest() {
@@ -231,10 +259,16 @@ public class PathOps {
         );
     }
 
+    // Ensure correct (negative) `endsWith` behavior
     @ParameterizedTest
     @MethodSource
-    void notEndsWithTest(String first, String suffix) {
-        notEnds(getPath(first), suffix);
+    void notEndsWithTest(String first, String suffix) throws IOException {
+        try (var fs = FileSystems.newFileSystem(emptyJar)) {
+            var path = fs.getPath(first);
+            assertNotNull(path);
+            Path s = fs.getPath(suffix);
+            assertFalse(path.endsWith(s));
+        }
     }
 
     static Stream<Arguments> notEndsWithTest() {
@@ -248,10 +282,15 @@ public class PathOps {
         );
     }
 
+    // Ensure `getName` returns correct String at index
     @ParameterizedTest
     @MethodSource
-    void elementTest(int index, String expected) {
-        element(getPath("a/b/c"), index, expected);
+    void elementTest(int index, String expected) throws IOException {
+        try (var fs = FileSystems.newFileSystem(emptyJar)) {
+            var path = fs.getPath("a/b/c");
+            assertNotNull(path);
+            assertEquals(expected, path.getName(index).toString());
+        }
     }
 
     static Stream<Arguments> elementTest() {
@@ -262,22 +301,35 @@ public class PathOps {
         );
     }
 
+    // Ensure expected behavior for absolute paths
     @ParameterizedTest
     @ValueSource(strings = {"/", "/tmp"} )
-    void isAbsoluteTest(String first) {
-        absolute(getPath(first));
+    void isAbsoluteTest(String first) throws IOException {
+        try (var fs = FileSystems.newFileSystem(emptyJar)) {
+            var path = fs.getPath(first);
+            assertNotNull(path);
+            assertTrue(path.isAbsolute());
+        }
     }
 
+    // Ensure expected behavior for non-absolute paths
     @ParameterizedTest
     @ValueSource(strings = {"tmp", ""} )
-    void notAbsoluteTest(String first) {
-        notAbsolute(getPath(first));
+    void notAbsoluteTest(String first) throws IOException {
+        try (var fs = FileSystems.newFileSystem(emptyJar)) {
+            var path = fs.getPath(first);
+            assertNotNull(path);
+            assertFalse(path.isAbsolute());
+        }
     }
 
+    // Ensure correct append and replacement behavior for `resolve(String)`
     @ParameterizedTest
     @MethodSource
-    void resolveTest(String first, String other, String expected) {
-        resolve(getPath(first), other, expected);
+    void resolveTest(String first, String other, String expected) throws IOException {
+        try (var fs = FileSystems.newFileSystem(emptyJar)) {
+            resolve(fs.getPath(first), other, expected);
+        }
     }
 
     static Stream<Arguments> resolveTest() {
@@ -298,10 +350,15 @@ public class PathOps {
         );
     }
 
+    // Ensure correct append and replacement behavior for `resolve(Path)`
     @ParameterizedTest
     @MethodSource
-    void resolvePathTest(String first, String other, String expected) {
-        resolvePath(getPath(first), other, expected);
+    void resolvePathTest(String first, String other, String expected) throws IOException {
+        try (var fs = FileSystems.newFileSystem(emptyJar)) {
+            var path = fs.getPath(first);
+            assertNotNull(path);
+            assertEquals(expected, path.resolve(fs.getPath(other)).toString());
+        }
     }
 
     static Stream<Arguments> resolvePathTest() {
@@ -322,10 +379,13 @@ public class PathOps {
         );
     }
 
+    // Ensure correct behavior for `resolveSibling`
     @ParameterizedTest
     @MethodSource
-    void resolveSiblingTest(String first, String other, String expected) {
-        resolveSibling(getPath(first), other, expected);
+    void resolveSiblingTest(String first, String other, String expected) throws IOException {
+        try (var fs = FileSystems.newFileSystem(emptyJar)) {
+            resolveSibling(fs.getPath(first), other, expected);
+        }
     }
 
     static Stream<Arguments> resolveSiblingTest() {
@@ -345,18 +405,28 @@ public class PathOps {
         );
     }
 
+    // Checking `resolve` and `resolveSibling` behavior for empty path
     @Test
-    void resolveSiblingAndResolveTest() {
-        var path = getPath("");
-        resolveSibling(path, "foo", "foo");
-        resolveSibling(path, "/foo", "/foo");
-        resolve(path, "", "");
+    void resolveSiblingAndResolveTest() throws IOException {
+        try (var fs = FileSystems.newFileSystem(emptyJar)) {
+            var path = fs.getPath("");
+            resolveSibling(path, "foo", "foo");
+            resolveSibling(path, "/foo", "/foo");
+            resolve(path, "", "");
+        }
     }
 
+    // Ensure correct behavior of `relativize`. i.e. Relative path should be
+    // produced between two given paths
     @ParameterizedTest
     @MethodSource
-    void relativizeTest(String first, String other, String expected) {
-        relativize(getPath(first), other, expected);
+    void relativizeTest(String first, String other, String expected) throws IOException {
+        try (var fs = FileSystems.newFileSystem(emptyJar)) {
+            var path = fs.getPath(first);
+            assertNotNull(path);
+            Path that = fs.getPath(other);
+            assertEquals(expected, path.relativize(that).toString());
+        }
     }
 
     static Stream<Arguments> relativizeTest() {
@@ -380,10 +450,15 @@ public class PathOps {
         );
     }
 
+    // Ensure correct behavior of `normalize`. i.e. redundant elements should be removed.
     @ParameterizedTest
     @MethodSource
-    void normalizeTest(String first, String expected) {
-        normalize(getPath(first), expected);
+    void normalizeTest(String first, String expected) throws IOException {
+        try (var fs = FileSystems.newFileSystem(emptyJar)) {
+            var path = fs.getPath(first);
+            assertNotNull(path);
+            assertEquals(expected, path.normalize().toString());
+        }
     }
 
     static Stream<Arguments> normalizeTest() {
@@ -409,10 +484,13 @@ public class PathOps {
         );
     }
 
+    // Check IPE is thrown for invalid path Strings
     @ParameterizedTest
     @MethodSource
-    void invalidTest(String first) {
-        assertThrows(InvalidPathException.class, () -> getPath(first));
+    void invalidTest(String first) throws IOException {
+        try (var fs = FileSystems.newFileSystem(emptyJar)) {
+            assertThrows(InvalidPathException.class, () -> fs.getPath(first));
+        }
     }
 
     static Stream<String> invalidTest() {
@@ -426,184 +504,65 @@ public class PathOps {
         );
     }
 
+    // Check that repeated forward slash is normalized correctly
     @Test
-    void normalizationTest() {
-        var path = getPath("//foo//bar");
-        string(path, "/foo/bar");
-        root(path, "/");
-        parent(path, "/foo");
-        name(path, "bar");
+    void normalizationTest() throws IOException {
+        try (var fs = FileSystems.newFileSystem(emptyJar)) {
+            var path = fs.getPath("//foo//bar");
+            string(path, "/foo/bar");
+            root(path, "/");
+            parent(path, "/foo");
+            name(path, "bar");
+        }
     }
 
-    @Test
-    void isSameFileTest() {
-        isSameFile(getPath("/fileDoesNotExist"), "/fileDoesNotExist");
+    @Test // Check that identical paths refer to the same file
+    void isSameFileTest() throws IOException {
+        try (var fs = FileSystems.newFileSystem(emptyJar)) {
+            var path = fs.getPath("/fileDoesNotExist");
+            assertNotNull(path);
+            assertTrue(Files.isSameFile(path, fs.getPath("/fileDoesNotExist")));
+        }
     }
 
+    // Regression test for 8139956: Ensure `relativize` of equivalent paths
+    // produces an empty path -> `getNameCount` returns 1
     @Test
-    void getNameCountTest() {
-        // 8139956
-        System.out.println("check getNameCount");
-        int nc = fs.getPath("/").relativize(fs.getPath("/")).getNameCount();
-        assertEquals(1, nc, "getNameCount of empty path failed");
+    void getNameCountTest() throws IOException {
+        try (var fs = FileSystems.newFileSystem(emptyJar)) {
+            int nc = fs.getPath("/").relativize(fs.getPath("/")).getNameCount();
+            assertEquals(1, nc, "getNameCount of empty path failed");
+        }
     }
 
     // Utilities for testing
-
-    static void checkPath(Path path) {
-        assertNotNull(path, "path is null");
-    }
-
-    static void check(Object result, String expected) {
-        if (result == null) {
-            if (expected == null) return;
-        } else {
-            // compare string representations
-            if (expected != null && result.toString().equals(expected))
-                return;
-        }
-        fail();
-    }
-
-    static void check(Object result, boolean expected) {
-        check(result, Boolean.toString(expected));
-    }
-
-    static void check(Object result, int expected) {
-        check(result, Integer.toString(expected));
-    }
-
     static void root(Path path, String expected) {
-        System.out.println("check root");
-        checkPath(path);
-        check(path.getRoot(), expected);
+        assertNotNull(path);
+        assertEquals(expected, Objects.toString(path.getRoot(), null));
     }
 
     static void parent(Path path, String expected) {
-        System.out.println("check parent");
-        checkPath(path);
-        check(path.getParent(), expected);
+        assertNotNull(path);
+        assertEquals(expected, Objects.toString(path.getParent(), null));
     }
 
     static void name(Path path, String expected) {
-        System.out.println("check name");
-        checkPath(path);
-        check(path.getFileName(), expected);
-    }
-
-    static void nameCount(Path path, int expected) {
-        System.out.println("check nameCount");
-        checkPath(path);
-        check(path.getNameCount(), expected);
-    }
-
-    static void element(Path path, int index, String expected) {
-        System.out.format("check element %d\n", index);
-        checkPath(path);
-        check(path.getName(index), expected);
-    }
-
-    static void subpath(Path path, int startIndex, int endIndex, String expected) {
-        System.out.format("test subpath(%d,%d)\n", startIndex, endIndex);
-        checkPath(path);
-        check(path.subpath(startIndex, endIndex), expected);
-    }
-
-    static void starts(Path path, String prefix) {
-        System.out.format("test startsWith with %s\n", prefix);
-        checkPath(path);
-        Path s = fs.getPath(prefix);
-        check(path.startsWith(s), true);
-    }
-
-    static void notStarts(Path path, String prefix) {
-        System.out.format("test not startsWith with %s\n", prefix);
-        checkPath(path);
-        Path s = fs.getPath(prefix);
-        check(path.startsWith(s), false);
-    }
-
-    static void ends(Path path, String suffix) {
-        System.out.format("test endsWith %s\n", suffix);
-        checkPath(path);
-        Path s = fs.getPath(suffix);
-        check(path.endsWith(s), true);
-    }
-
-    static void notEnds(Path path, String suffix) {
-        System.out.format("test not endsWith %s\n", suffix);
-        checkPath(path);
-        Path s = fs.getPath(suffix);
-        check(path.endsWith(s), false);
-    }
-
-    static void absolute(Path path) {
-        System.out.println("check path is absolute");
-        checkPath(path);
-        check(path.isAbsolute(), true);
-    }
-
-    static void notAbsolute(Path path) {
-        System.out.println("check path is not absolute");
-        checkPath(path);
-        check(path.isAbsolute(), false);
+        assertNotNull(path);
+        assertEquals(expected, Objects.toString(path.getFileName(), null));
     }
 
     static void resolve(Path path, String other, String expected) {
-        System.out.format("test resolve %s\n", other);
-        checkPath(path);
-        check(path.resolve(other), expected);
-    }
-
-    static void resolvePath(Path path, String other, String expected) {
-        System.out.format("test resolve %s\n", other);
-        checkPath(path);
-        check(path.resolve(fs.getPath(other)), expected);
+        assertNotNull(path);
+        assertEquals(expected, path.resolve(other).toString());
     }
 
     static void resolveSibling(Path path, String other, String expected) {
-        System.out.format("test resolveSibling %s\n", other);
-        checkPath(path);
-        check(path.resolveSibling(other), expected);
-
-    }
-
-    static void relativize(Path path, String other, String expected) {
-        System.out.format("test relativize %s\n", other);
-        checkPath(path);
-        Path that = fs.getPath(other);
-        check(path.relativize(that), expected);
-
-    }
-
-    static void normalize(Path path, String expected) {
-        System.out.println("check normalized path");
-        checkPath(path);
-        check(path.normalize(), expected);
-
+        assertNotNull(path);
+        assertEquals(expected, path.resolveSibling(other).toString());
     }
 
     static void string(Path path, String expected) {
-        System.out.println("check string representation");
-        checkPath(path);
-        check(path, expected);
-    }
-
-    static void isSameFile(Path path, String target) {
-        try {
-            System.out.println("check two paths are same");
-            checkPath(path);
-            check(Files.isSameFile(path, fs.getPath(target)), true);
-        } catch (IOException ioe) {
-            fail();
-        }
-    }
-
-    static Path getPath(String s) {
-        return fs.getPath(s);
-    }
-
-    static Path getPath(String first, String... more) {
-        return fs.getPath(first, more);
+        assertNotNull(path);
+        assertEquals(expected, path.toString());
     }
 }

From 3588fb79691b3829bab214a4bb1517fd382cccaf Mon Sep 17 00:00:00 2001
From: Ioi Lam <iklam@openjdk.org>
Date: Wed, 25 Mar 2026 22:07:41 +0000
Subject: [PATCH 352/655] 8380825: AOT tests should run in two step training
 mode by default

Reviewed-by: kvn, vlivanov
---
 .../aotCache/AOTCacheSupportForCustomLoaders.java     | 10 ++++++++--
 .../runtime/cds/appcds/aotClassLinking/AddOpens.java  |  6 +++---
 .../runtime/cds/appcds/aotClassLinking/AddReads.java  |  8 +++-----
 .../aotCode/AOTCodeCPUFeatureIncompatibilityTest.java | 11 +++++++----
 test/lib/jdk/test/lib/cds/CDSAppTester.java           | 11 ++++++++++-
 5 files changed, 31 insertions(+), 15 deletions(-)

diff --git a/test/hotspot/jtreg/runtime/cds/appcds/aotCache/AOTCacheSupportForCustomLoaders.java b/test/hotspot/jtreg/runtime/cds/appcds/aotCache/AOTCacheSupportForCustomLoaders.java
index 9461957ef2c..1a8313a3058 100644
--- a/test/hotspot/jtreg/runtime/cds/appcds/aotCache/AOTCacheSupportForCustomLoaders.java
+++ b/test/hotspot/jtreg/runtime/cds/appcds/aotCache/AOTCacheSupportForCustomLoaders.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2025, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -76,10 +76,12 @@ public class AOTCacheSupportForCustomLoaders {
 }
 
 class AppWithCustomLoaders {
+    static MyLoader loader; // keep alive so its classes can be cached.
+
     public static void main(String args[]) throws Exception {
         File custJar = new File("cust.jar");
         URL[] urls = new URL[] {custJar.toURI().toURL()};
-        MyLoader loader = new MyLoader(urls, AppWithCustomLoaders.class.getClassLoader());
+        loader = new MyLoader(urls, AppWithCustomLoaders.class.getClassLoader());
 
         test1(loader);
         test2(loader);
@@ -107,6 +109,7 @@ class AppWithCustomLoaders {
     }
 
     // Test 3: custom loader defines a class from the exact location as a class defined in the boot layer.
+    static Class test3_c1_keepalive;
     static void test3(String modulePath) throws Exception {
         Class<?> c0 = Class.forName("com.test.Foo");
         System.out.println(c0);
@@ -130,6 +133,9 @@ class AppWithCustomLoaders {
         System.out.println(c1.getModule().getName());
         System.out.println(c1.getClassLoader());
 
+        // Keep c1 alive so it can be cached.
+        test3_c1_keepalive = c1;
+
         if (!c1.getModule().getName().equals("com.test")) {
             throw new RuntimeException("Unexpected module: " + c1.getModule());
         }
diff --git a/test/hotspot/jtreg/runtime/cds/appcds/aotClassLinking/AddOpens.java b/test/hotspot/jtreg/runtime/cds/appcds/aotClassLinking/AddOpens.java
index d3626d30c7e..f7e15f8fae0 100644
--- a/test/hotspot/jtreg/runtime/cds/appcds/aotClassLinking/AddOpens.java
+++ b/test/hotspot/jtreg/runtime/cds/appcds/aotClassLinking/AddOpens.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -157,7 +157,7 @@ public class AddOpens {
                 out.shouldContain(expectedOutput[0]);
                 out.shouldContain(expectedOutput[1]);
             } else if (runMode == RunMode.ASSEMBLY) {
-                out.shouldContain("full module graph: enabled");
+                out.shouldMatch("(full module graph: enabled)|(Full module graph = enabled)");
             }
         }
     }
@@ -200,7 +200,7 @@ public class AddOpens {
                 out.shouldContain(expectedOutput[0]);
                 out.shouldContain(expectedOutput[1]);
             } else if (runMode == RunMode.ASSEMBLY) {
-                out.shouldContain("full module graph: enabled");
+                out.shouldMatch("(full module graph: enabled)|(Full module graph = enabled)");
             }
         }
     }
diff --git a/test/hotspot/jtreg/runtime/cds/appcds/aotClassLinking/AddReads.java b/test/hotspot/jtreg/runtime/cds/appcds/aotClassLinking/AddReads.java
index 5c9364aa079..95fc9f0f700 100644
--- a/test/hotspot/jtreg/runtime/cds/appcds/aotClassLinking/AddReads.java
+++ b/test/hotspot/jtreg/runtime/cds/appcds/aotClassLinking/AddReads.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -65,8 +65,6 @@ public class AddReads {
         "[class,load] com.norequires.Main source: shared objects file";
     private static final String sharedClassB =
         "[class,load] org.astro.World source: shared objects file";
-    private static final String fmgEnabled = "full module graph: enabled";
-    private static final String fmgDisabled = "full module graph: disabled";
     private static final String cannotAccess =
         "class com.norequires.Main (in module com.norequires) cannot access class org.astro.World (in module org.astro)";
 
@@ -166,8 +164,8 @@ public class AddReads {
                 out.shouldContain("full module graph: disabled");
                 out.shouldContain("Mismatched values for property jdk.module.addreads: runtime com.norequires=ALL-UNNAMED dump time com.norequires=org.astro");
             } else if (runMode == RunMode.ASSEMBLY) {
-                out.shouldContain("full module graph: enabled");
-            } else {
+                out.shouldMatch("(full module graph: enabled)|(Full module graph = enabled)");
+             } else {
                 out.shouldHaveExitValue(0);
             }
         }
diff --git a/test/hotspot/jtreg/runtime/cds/appcds/aotCode/AOTCodeCPUFeatureIncompatibilityTest.java b/test/hotspot/jtreg/runtime/cds/appcds/aotCode/AOTCodeCPUFeatureIncompatibilityTest.java
index 8d1e190d1e3..e9e610330ad 100644
--- a/test/hotspot/jtreg/runtime/cds/appcds/aotCode/AOTCodeCPUFeatureIncompatibilityTest.java
+++ b/test/hotspot/jtreg/runtime/cds/appcds/aotCode/AOTCodeCPUFeatureIncompatibilityTest.java
@@ -76,15 +76,18 @@ public class AOTCodeCPUFeatureIncompatibilityTest {
             @Override
             public String[] vmArgs(RunMode runMode) {
                 if (runMode == RunMode.PRODUCTION) {
-                    return new String[] {vmOption, "-Xlog:aot+codecache+init=debug"};
+                    return new String[] {vmOption, "-Xlog:aot+codecache*=debug"};
+                } else {
+                    return new String[] {"-Xlog:aot+codecache*=debug"};
                 }
-                return new String[] {};
             }
             @Override
             public void checkExecution(OutputAnalyzer out, RunMode runMode) throws Exception {
-                if (runMode == RunMode.ASSEMBLY) {
+                if (runMode == RunMode.ASSEMBLY || runMode == RunMode.PRODUCTION) {
                     out.shouldMatch("CPU features recorded in AOTCodeCache:.*" + featureName + ".*");
-                } else if (runMode == RunMode.PRODUCTION) {
+                }
+
+                if (runMode == RunMode.PRODUCTION) {
                     out.shouldMatch("AOT Code Cache disabled: required cpu features are missing:.*" + featureName + ".*");
                     out.shouldContain("Unable to use AOT Code Cache");
                 }
diff --git a/test/lib/jdk/test/lib/cds/CDSAppTester.java b/test/lib/jdk/test/lib/cds/CDSAppTester.java
index 18356dd8aa9..3eac8a35a37 100644
--- a/test/lib/jdk/test/lib/cds/CDSAppTester.java
+++ b/test/lib/jdk/test/lib/cds/CDSAppTester.java
@@ -480,11 +480,20 @@ abstract public class CDSAppTester {
     // See JEP 483
     public void runAOTWorkflow(String... args) throws Exception {
         this.workflow = Workflow.AOT;
-        boolean oneStepTraining = true; // by default use onestep trainning
+
+        // By default use twostep training -- tests are much easier to write this way, as
+        // the stdout/stderr of the training run is clearly separated from the assembly phase.
+        //
+        // Many older test cases written before JEP 514 were not aware of one step treaining
+        // and may not check the stdout/stderr correctly.
+        boolean oneStepTraining = false;
 
         if (System.getProperty("CDSAppTester.two.step.training") != null) {
             oneStepTraining = false;
         }
+        if (System.getProperty("CDSAppTester.one.step.training") != null) {
+            oneStepTraining = true;
+        }
 
         if (args.length > 1) {
             // Tests such as test/hotspot/jtreg/runtime/cds/appcds/aotCache/SpecialCacheNames.java

From a55656d2f938ea7ca11b7022f4bfe63f124183cf Mon Sep 17 00:00:00 2001
From: Dingli Zhang <dzhang@openjdk.org>
Date: Thu, 26 Mar 2026 01:53:36 +0000
Subject: [PATCH 353/655] 8380789: RISC-V: TestOpaqueConstantBoolNodes.java
 fails when running without RVV

Reviewed-by: fyang
---
 .../compiler/intrinsics/string/TestOpaqueConstantBoolNodes.java  | 1 +
 1 file changed, 1 insertion(+)

diff --git a/test/hotspot/jtreg/compiler/intrinsics/string/TestOpaqueConstantBoolNodes.java b/test/hotspot/jtreg/compiler/intrinsics/string/TestOpaqueConstantBoolNodes.java
index b8db97f7ecb..c32eba5aa77 100644
--- a/test/hotspot/jtreg/compiler/intrinsics/string/TestOpaqueConstantBoolNodes.java
+++ b/test/hotspot/jtreg/compiler/intrinsics/string/TestOpaqueConstantBoolNodes.java
@@ -26,6 +26,7 @@
  * @bug 8374582
  * @summary Tests the creation and removal of opaque nodes at range checks points in string intrinsics.
  * @requires vm.flagless
+ * @requires os.arch != "riscv64" | vm.cpu.features ~= ".*rvv.*"
  * @library /test/lib /
  * @run driver ${test.main.class}
  */

From ceb109fbd8a382b8c8afa73bdeffc360d352d935 Mon Sep 17 00:00:00 2001
From: Alexey Semenyuk <asemenyuk@openjdk.org>
Date: Thu, 26 Mar 2026 01:59:10 +0000
Subject: [PATCH 354/655] 8380081: jpackage: Incorrect descriptions of
 win-specific options

Reviewed-by: nlisker, almatvee
---
 .../internal/resources/HelpResources.properties    | 14 +++++++++-----
 src/jdk.jpackage/share/man/jpackage.md             | 11 +++++++----
 .../jdk/jpackage/internal/cli/help-windows.txt     | 14 +++++++++-----
 3 files changed, 25 insertions(+), 14 deletions(-)

diff --git a/src/jdk.jpackage/share/classes/jdk/jpackage/internal/resources/HelpResources.properties b/src/jdk.jpackage/share/classes/jdk/jpackage/internal/resources/HelpResources.properties
index 0b2ca83a7d7..7f570e71330 100644
--- a/src/jdk.jpackage/share/classes/jdk/jpackage/internal/resources/HelpResources.properties
+++ b/src/jdk.jpackage/share/classes/jdk/jpackage/internal/resources/HelpResources.properties
@@ -405,20 +405,24 @@ help.option.win-help-url=\
 \          URL where user can obtain further information or technical support
 
 help.option.win-menu=\
-\          Request to add a Start menu shortcut for this application
+\          Adds a Start menu shortcut for this application, or requests\n\
+\          to do so if --win-shortcut-prompt is specified
 
 help.option.win-menu-group=\
 \          Start Menu group this application is placed in
 
 help.option.win-per-user-install=\
-\          Request to perform an install on a per-user basis
+\          Installs the application on a per-user basis.\n\
+\          Without this option installs per-machine
 
 help.option.win-shortcut=\
-\          Request to add desktop shortcut for this application
+\          Adds a desktop shortcut for this application, or requests\n\
+\          to do so if --win-shortcut-prompt is specified
 
 help.option.win-shortcut-prompt=\
-\          Adds a dialog to enable the user to choose if shortcuts\n\
-\          will be created by installer.
+\          Adds a dialog if at least one of --win-menu or --win-shortcut\n\
+\          are specified to enable the user to choose if these shortcuts\n\
+\          will be created by the installer
 
 help.option.win-update-url=\
 \          URL of available application update information
diff --git a/src/jdk.jpackage/share/man/jpackage.md b/src/jdk.jpackage/share/man/jpackage.md
index 9ba5949866f..156b05307b7 100644
--- a/src/jdk.jpackage/share/man/jpackage.md
+++ b/src/jdk.jpackage/share/man/jpackage.md
@@ -410,7 +410,8 @@ The `jpackage` tool will take as input a Java application and a Java run-time im
 
 <a id="option-win-menu">`--win-menu`</a>
 
-:   Request to add a Start Menu shortcut for this application
+:   Adds a Start menu shortcut for this application, or requests to do so
+    if --win-shortcut-prompt is specified
 
 <a id="option-win-menu-group">`--win-menu-group` *menu-group-name*</a>
 
@@ -418,15 +419,17 @@ The `jpackage` tool will take as input a Java application and a Java run-time im
 
 <a id="option-win-per-user-install">`--win-per-user-install`</a>
 
-:   Request to perform an install on a per-user basis
+:   Installs the application on a per-user basis. Without this option installs per-machine
 
 <a id="option-win-shortcut">`--win-shortcut`</a>
 
-:   Request to create a desktop shortcut for this application
+:   Adds a desktop shortcut for this application, or requests to do so
+    if --win-shortcut-prompt is specified
 
 <a id="option-win-shortcut-prompt">`--win-shortcut-prompt`</a>
 
-:   Adds a dialog to enable the user to choose if shortcuts will be created by installer
+:   Adds a dialog if at least one of --win-menu or --win-shortcut are specified
+    to enable the user to choose if these shortcuts will be created by the installer
 
 <a id="option-win-update-url">`--win-update-url` *url*</a>
 
diff --git a/test/jdk/tools/jpackage/junit/share/jdk.jpackage/jdk/jpackage/internal/cli/help-windows.txt b/test/jdk/tools/jpackage/junit/share/jdk.jpackage/jdk/jpackage/internal/cli/help-windows.txt
index 7a098b847ad..e30a5bb7f9b 100644
--- a/test/jdk/tools/jpackage/junit/share/jdk.jpackage/jdk/jpackage/internal/cli/help-windows.txt
+++ b/test/jdk/tools/jpackage/junit/share/jdk.jpackage/jdk/jpackage/internal/cli/help-windows.txt
@@ -189,16 +189,20 @@ Platform dependent options for creating the application package:
   --win-help-url <url>
           URL where user can obtain further information or technical support
   --win-menu [<shortcut startup directory>]
-          Request to add a Start menu shortcut for this application
+          Adds a Start menu shortcut for this application, or requests
+          to do so if --win-shortcut-prompt is specified
   --win-menu-group <menu group name>
           Start Menu group this application is placed in
   --win-per-user-install
-          Request to perform an install on a per-user basis
+          Installs the application on a per-user basis.
+          Without this option installs per-machine
   --win-shortcut [<shortcut startup directory>]
-          Request to add desktop shortcut for this application
+          Adds a desktop shortcut for this application, or requests
+          to do so if --win-shortcut-prompt is specified
   --win-shortcut-prompt
-          Adds a dialog to enable the user to choose if shortcuts
-          will be created by installer.
+          Adds a dialog if at least one of --win-menu or --win-shortcut
+          are specified to enable the user to choose if these shortcuts
+          will be created by the installer
   --win-update-url <url>
           URL of available application update information
   --win-upgrade-uuid <uuid>

From 69deec20163561b40abce1faa4e82217afdc8efd Mon Sep 17 00:00:00 2001
From: Yasumasa Suenaga <ysuenaga@openjdk.org>
Date: Thu, 26 Mar 2026 02:16:00 +0000
Subject: [PATCH 355/655] 8378985:
 serviceability/sa/TestJhsdbJstackMixedWithXComp.java failed if sender frame
 is return barrier of Continuation

Reviewed-by: cjplummer, mdoerr, fyang
---
 src/hotspot/share/runtime/vmStructs.cpp       |  2 +
 .../sun/jvm/hotspot/runtime/Continuation.java | 60 +++++++++++++++++++
 .../hotspot/runtime/ContinuationEntry.java    | 30 ++++++++--
 .../jvm/hotspot/runtime/Continuations.java    | 33 ++++++++++
 .../sun/jvm/hotspot/runtime/Frame.java        |  3 +-
 .../sun/jvm/hotspot/runtime/JavaThread.java   |  4 +-
 .../sun/jvm/hotspot/runtime/StubRoutines.java |  9 ++-
 .../aarch64/AARCH64ContinuationEntry.java     | 43 +++++++++++++
 .../hotspot/runtime/aarch64/AARCH64Frame.java | 33 ++++++----
 .../runtime/amd64/AMD64ContinuationEntry.java | 43 +++++++++++++
 .../jvm/hotspot/runtime/amd64/AMD64Frame.java | 50 ++++++++++++----
 .../runtime/ppc64/PPC64ContinuationEntry.java | 43 +++++++++++++
 .../jvm/hotspot/runtime/ppc64/PPC64Frame.java | 37 +++++++-----
 .../riscv64/RISCV64ContinuationEntry.java     | 43 +++++++++++++
 .../hotspot/runtime/riscv64/RISCV64Frame.java | 37 +++++++-----
 15 files changed, 412 insertions(+), 58 deletions(-)
 create mode 100644 src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/runtime/Continuation.java
 create mode 100644 src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/runtime/Continuations.java
 create mode 100644 src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/runtime/aarch64/AARCH64ContinuationEntry.java
 create mode 100644 src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/runtime/amd64/AMD64ContinuationEntry.java
 create mode 100644 src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/runtime/ppc64/PPC64ContinuationEntry.java
 create mode 100644 src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/runtime/riscv64/RISCV64ContinuationEntry.java

diff --git a/src/hotspot/share/runtime/vmStructs.cpp b/src/hotspot/share/runtime/vmStructs.cpp
index 48f3f078ae8..b6294a9a168 100644
--- a/src/hotspot/share/runtime/vmStructs.cpp
+++ b/src/hotspot/share/runtime/vmStructs.cpp
@@ -475,6 +475,7 @@
   /***********************************/                                                                                              \
                                                                                                                                      \
      static_field(StubRoutines,                _call_stub_return_address,                     address)                               \
+     static_field(StubRoutines,                _cont_returnBarrier,                           address)                               \
                                                                                                                                      \
   /***************************************/                                                                                          \
   /* PcDesc and other compiled code info */                                                                                          \
@@ -786,6 +787,7 @@
   static_field(Mutex,                          _mutex_array,                                  Mutex**)                               \
   static_field(Mutex,                          _num_mutex,                                    int)                                   \
   volatile_nonstatic_field(Mutex,              _owner,                                        Thread*)                               \
+  nonstatic_field(ContinuationEntry,           _parent,                                       ContinuationEntry*)                    \
   static_field(ContinuationEntry,              _return_pc,                                    address)
 
 //--------------------------------------------------------------------------------
diff --git a/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/runtime/Continuation.java b/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/runtime/Continuation.java
new file mode 100644
index 00000000000..72ba053f451
--- /dev/null
+++ b/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/runtime/Continuation.java
@@ -0,0 +1,60 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2026, NTT DATA.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ *
+ */
+package sun.jvm.hotspot.runtime;
+
+import sun.jvm.hotspot.debugger.Address;
+
+
+public class Continuation {
+
+    public static boolean isReturnBarrierEntry(Address senderPC) {
+        if (!Continuations.enabled()) {
+            return false;
+        }
+        return VM.getVM().getStubRoutines().contReturnBarrier().equals(senderPC);
+    }
+
+    public static boolean isSPInContinuation(ContinuationEntry entry, Address sp) {
+        return entry.getEntrySP().greaterThan(sp);
+    }
+
+    public static ContinuationEntry getContinuationEntryForSP(JavaThread thread, Address sp) {
+        ContinuationEntry entry = thread.getContEntry();
+        while (entry != null && !isSPInContinuation(entry, sp)) {
+            entry = entry.getParent();
+        }
+        return entry;
+    }
+
+    public static Frame continuationBottomSender(JavaThread thread, Frame callee, Address senderSP) {
+        ContinuationEntry ce = getContinuationEntryForSP(thread, callee.getSP());
+        Frame entry = ce.toFrame();
+        if (callee.isInterpretedFrame()) {
+            entry.setSP(senderSP); // sp != unextended_sp
+        }
+        return entry;
+    }
+
+}
diff --git a/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/runtime/ContinuationEntry.java b/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/runtime/ContinuationEntry.java
index 73152bdee84..7d8a2ba5993 100644
--- a/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/runtime/ContinuationEntry.java
+++ b/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/runtime/ContinuationEntry.java
@@ -1,6 +1,6 @@
 /*
- * Copyright (c) 2025, Oracle and/or its affiliates. All rights reserved.
- * Copyright (c) 2025, NTT DATA.
+ * Copyright (c) 2025, 2026, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2025, 2026, NTT DATA.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -26,12 +26,17 @@
 package sun.jvm.hotspot.runtime;
 
 import sun.jvm.hotspot.debugger.*;
-import sun.jvm.hotspot.runtime.*;
+import sun.jvm.hotspot.runtime.aarch64.*;
+import sun.jvm.hotspot.runtime.amd64.*;
+import sun.jvm.hotspot.runtime.ppc64.*;
+import sun.jvm.hotspot.runtime.riscv64.*;
 import sun.jvm.hotspot.types.*;
+import sun.jvm.hotspot.utilities.*;
 
 
-public class ContinuationEntry extends VMObject {
+public abstract class ContinuationEntry extends VMObject {
     private static long size;
+    private static AddressField parentField;
     private static Address returnPC;
 
     static {
@@ -41,13 +46,28 @@ public class ContinuationEntry extends VMObject {
     private static synchronized void initialize(TypeDataBase db) throws WrongTypeException {
         Type type = db.lookupType("ContinuationEntry");
         size = type.getSize();
+        parentField = type.getAddressField("_parent");
         returnPC = type.getAddressField("_return_pc").getValue();
     }
 
+    public static ContinuationEntry create(Address addr) {
+        return switch (VM.getVM().getDebugger().getCPU()) {
+            case "amd64"   -> VMObjectFactory.newObject(AMD64ContinuationEntry.class, addr);
+            case "aarch64" -> VMObjectFactory.newObject(AARCH64ContinuationEntry.class, addr);
+            case "riscv64" -> VMObjectFactory.newObject(RISCV64ContinuationEntry.class, addr);
+            case "ppc64" -> VMObjectFactory.newObject(PPC64ContinuationEntry.class, addr);
+            default -> throw new UnsupportedPlatformException("Continuation is not yet implemented.");
+        };
+    }
+
     public ContinuationEntry(Address addr) {
         super(addr);
     }
 
+    public ContinuationEntry getParent() {
+        return create(parentField.getValue(addr));
+    }
+
     public Address getEntryPC() {
         return returnPC;
     }
@@ -60,4 +80,6 @@ public class ContinuationEntry extends VMObject {
         return this.getAddress().addOffsetTo(size);
     }
 
+    public abstract Frame toFrame();
+
 }
diff --git a/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/runtime/Continuations.java b/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/runtime/Continuations.java
new file mode 100644
index 00000000000..884f8764ba5
--- /dev/null
+++ b/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/runtime/Continuations.java
@@ -0,0 +1,33 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2026, NTT DATA.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ *
+ */
+package sun.jvm.hotspot.runtime;
+
+public class Continuations {
+
+    public static boolean enabled() {
+        return VM.getVM().getCommandLineFlag("VMContinuations").getBool();
+    }
+
+}
diff --git a/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/runtime/Frame.java b/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/runtime/Frame.java
index ee9e0ecdafd..978fb39ad1c 100644
--- a/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/runtime/Frame.java
+++ b/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/runtime/Frame.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2000, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2000, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -138,6 +138,7 @@ public abstract class Frame implements Cloneable {
   }
 
   public abstract Address getSP();
+  public abstract void setSP(Address newSP);
   public abstract Address getID();
   public abstract Address getFP();
 
diff --git a/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/runtime/JavaThread.java b/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/runtime/JavaThread.java
index 826b5cecfd5..c18bcf8cd37 100644
--- a/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/runtime/JavaThread.java
+++ b/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/runtime/JavaThread.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2000, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2000, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -343,7 +343,7 @@ public class JavaThread extends Thread {
   }
 
   public ContinuationEntry getContEntry() {
-      return VMObjectFactory.newObject(ContinuationEntry.class, contEntryField.getValue(addr));
+      return ContinuationEntry.create(contEntryField.getValue(addr));
   }
 
   /** Gets the Java-side thread object for this JavaThread */
diff --git a/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/runtime/StubRoutines.java b/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/runtime/StubRoutines.java
index 38a3103ac50..85d8c8cd3b6 100644
--- a/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/runtime/StubRoutines.java
+++ b/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/runtime/StubRoutines.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2000, 2020, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2000, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -34,6 +34,7 @@ import sun.jvm.hotspot.utilities.Observer;
 
 public class StubRoutines {
   private static AddressField callStubReturnAddressField;
+  private static AddressField contReturnBarrierField;
 
   static {
     VM.registerVMInitializedObserver(new Observer() {
@@ -46,6 +47,7 @@ public class StubRoutines {
   private static synchronized void initialize(TypeDataBase db) {
     Type type = db.lookupType("StubRoutines");
     callStubReturnAddressField = type.getAddressField("_call_stub_return_address");
+    contReturnBarrierField = type.getAddressField("_cont_returnBarrier");
   }
 
   public StubRoutines() {
@@ -59,4 +61,9 @@ public class StubRoutines {
       return (addr.equals(returnPC));
     }
   }
+
+  public Address contReturnBarrier() {
+    return contReturnBarrierField.getValue();
+  }
+
 }
diff --git a/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/runtime/aarch64/AARCH64ContinuationEntry.java b/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/runtime/aarch64/AARCH64ContinuationEntry.java
new file mode 100644
index 00000000000..b373167a37c
--- /dev/null
+++ b/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/runtime/aarch64/AARCH64ContinuationEntry.java
@@ -0,0 +1,43 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2026, NTT DATA.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ *
+ */
+package sun.jvm.hotspot.runtime.aarch64;
+
+import sun.jvm.hotspot.debugger.Address;
+import sun.jvm.hotspot.runtime.ContinuationEntry;
+import sun.jvm.hotspot.runtime.Frame;
+
+
+public class AARCH64ContinuationEntry extends ContinuationEntry {
+
+    public AARCH64ContinuationEntry(Address addr) {
+        super(addr);
+    }
+
+    @Override
+    public Frame toFrame() {
+        return new AARCH64Frame(getEntrySP(), getEntrySP(), getEntryFP(), getEntryPC());
+    }
+
+}
diff --git a/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/runtime/aarch64/AARCH64Frame.java b/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/runtime/aarch64/AARCH64Frame.java
index 7233d508cbc..5e73150c6cf 100644
--- a/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/runtime/aarch64/AARCH64Frame.java
+++ b/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/runtime/aarch64/AARCH64Frame.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2001, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2001, 2026, Oracle and/or its affiliates. All rights reserved.
  * Copyright (c) 2015, 2019, Red Hat Inc.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
@@ -206,6 +206,11 @@ public class AARCH64Frame extends Frame {
   public Address getSP() { return raw_sp; }
   public Address getID() { return raw_sp; }
 
+  @Override
+  public void setSP(Address newSP) {
+    raw_sp = newSP;
+  }
+
   // FIXME: not implemented yet
   public boolean isSignalHandlerFrameDbg() { return false; }
   public int     getSignalNumberDbg()      { return 0;     }
@@ -360,16 +365,6 @@ public class AARCH64Frame extends Frame {
     map.setLocation(fp, savedFPAddr);
   }
 
-  private Frame senderForContinuationStub(AARCH64RegisterMap map, CodeBlob cb) {
-    var contEntry = map.getThread().getContEntry();
-
-    Address senderSP = contEntry.getEntrySP();
-    Address senderPC = contEntry.getEntryPC();
-    Address senderFP = contEntry.getEntryFP();
-
-    return new AARCH64Frame(senderSP, senderFP, senderPC);
-  }
-
   private Frame senderForCompiledFrame(AARCH64RegisterMap map, CodeBlob cb) {
     if (DEBUG) {
       System.out.println("senderForCompiledFrame");
@@ -416,6 +411,22 @@ public class AARCH64Frame extends Frame {
       updateMapWithSavedLink(map, savedFPAddr);
     }
 
+    if (Continuation.isReturnBarrierEntry(senderPC)) {
+      // We assume WalkContinuation is "WalkContinuation::skip".
+      // It is same with c'tor arguments of RegisterMap in frame::next_frame().
+      //
+      // HotSpot code in cpu/aarch64/frame_aarch64.inline.hpp:
+      //
+      //   if (Continuation::is_return_barrier_entry(sender_pc)) {
+      //     if (map->walk_cont()) { // about to walk into an h-stack
+      //       return Continuation::top_frame(*this, map);
+      //     } else {
+      //       return Continuation::continuation_bottom_sender(map->thread(), *this, l_sender_sp);
+      //     }
+      //   }
+      return Continuation.continuationBottomSender(map.getThread(), this, senderSP);
+    }
+
     return new AARCH64Frame(senderSP, savedFPAddr.getAddressAt(0), senderPC);
   }
 
diff --git a/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/runtime/amd64/AMD64ContinuationEntry.java b/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/runtime/amd64/AMD64ContinuationEntry.java
new file mode 100644
index 00000000000..3cbebfce2f4
--- /dev/null
+++ b/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/runtime/amd64/AMD64ContinuationEntry.java
@@ -0,0 +1,43 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2026, NTT DATA.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ *
+ */
+package sun.jvm.hotspot.runtime.amd64;
+
+import sun.jvm.hotspot.debugger.Address;
+import sun.jvm.hotspot.runtime.ContinuationEntry;
+import sun.jvm.hotspot.runtime.Frame;
+
+
+public class AMD64ContinuationEntry extends ContinuationEntry {
+
+    public AMD64ContinuationEntry(Address addr) {
+        super(addr);
+    }
+
+    @Override
+    public Frame toFrame() {
+        return new AMD64Frame(getEntrySP(), getEntrySP(), getEntryFP(), getEntryPC());
+    }
+
+}
diff --git a/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/runtime/amd64/AMD64Frame.java b/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/runtime/amd64/AMD64Frame.java
index fa9d50160e1..2b78157e2b2 100644
--- a/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/runtime/amd64/AMD64Frame.java
+++ b/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/runtime/amd64/AMD64Frame.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2001, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2001, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -206,6 +206,11 @@ public class AMD64Frame extends Frame {
   public Address getSP() { return raw_sp; }
   public Address getID() { return raw_sp; }
 
+  @Override
+  public void setSP(Address newSP) {
+    raw_sp = newSP;
+  }
+
   // FIXME: not implemented yet (should be done for Solaris)
   public boolean isSignalHandlerFrameDbg() { return false; }
   public int     getSignalNumberDbg()      { return 0;     }
@@ -258,6 +263,23 @@ public class AMD64Frame extends Frame {
     // update it accordingly
     map.setIncludeArgumentOops(false);
 
+    // HotSpot has following code in frame::sender_raw() at frame_x86.inline.hpp, however
+    // in_cont() should be false.
+    //
+    //   if (map->in_cont()) { // already in an h-stack
+    //     return map->stack_chunk()->sender(*this, map);
+    //   }
+    //
+    // in_cont() returns true if _chunk() is not null.
+    //
+    // frame::next_frame() creates RegisterMap instance with 4 arguments.
+    // It sets RegisterMap::WalkContinuation::skip to final argument (walk_cont),
+    // therefore _chunk will not be initialized by the following code in c'tor of RegisterMap.
+    //
+    //   if (walk_cont == WalkContinuation::include && thread != nullptr && thread->last_continuation() != nullptr) {
+    //     _chunk = stackChunkHandle(Thread::current()->handle_area()->allocate_null_handle(), true /* dummy */);
+    //   }
+
     if (isEntryFrame())       return senderForEntryFrame(map);
     if (isInterpretedFrame()) return senderForInterpreterFrame(map);
 
@@ -360,16 +382,6 @@ public class AMD64Frame extends Frame {
     map.setLocation(rbp, savedFPAddr);
   }
 
-  private Frame senderForContinuationStub(AMD64RegisterMap map, CodeBlob cb) {
-    var contEntry = map.getThread().getContEntry();
-
-    Address senderSP = contEntry.getEntrySP();
-    Address senderPC = contEntry.getEntryPC();
-    Address senderFP = contEntry.getEntryFP();
-
-    return new AMD64Frame(senderSP, senderFP, senderPC);
-  }
-
   private Frame senderForCompiledFrame(AMD64RegisterMap map, CodeBlob cb) {
     if (DEBUG) {
       System.out.println("senderForCompiledFrame");
@@ -408,6 +420,22 @@ public class AMD64Frame extends Frame {
       updateMapWithSavedLink(map, savedFPAddr);
     }
 
+    if (Continuation.isReturnBarrierEntry(senderPC)) {
+      // We assume WalkContinuation is "WalkContinuation::skip".
+      // It is same with c'tor arguments of RegisterMap in frame::next_frame().
+      //
+      // HotSpot code in cpu/x86/frame_x86.inline.hpp:
+      //
+      //   if (Continuation::is_return_barrier_entry(sender_pc)) {
+      //     if (map->walk_cont()) { // about to walk into an h-stack
+      //       return Continuation::top_frame(*this, map);
+      //     } else {
+      //       return Continuation::continuation_bottom_sender(map->thread(), *this, sender_sp);
+      //     }
+      //   }
+      return Continuation.continuationBottomSender(map.getThread(), this, senderSP);
+    }
+
     return new AMD64Frame(senderSP, savedFPAddr.getAddressAt(0), senderPC);
   }
 
diff --git a/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/runtime/ppc64/PPC64ContinuationEntry.java b/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/runtime/ppc64/PPC64ContinuationEntry.java
new file mode 100644
index 00000000000..fac71cc9953
--- /dev/null
+++ b/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/runtime/ppc64/PPC64ContinuationEntry.java
@@ -0,0 +1,43 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2026, NTT DATA.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ *
+ */
+package sun.jvm.hotspot.runtime.ppc64;
+
+import sun.jvm.hotspot.debugger.Address;
+import sun.jvm.hotspot.runtime.ContinuationEntry;
+import sun.jvm.hotspot.runtime.Frame;
+
+
+public class PPC64ContinuationEntry extends ContinuationEntry {
+
+    public PPC64ContinuationEntry(Address addr) {
+        super(addr);
+    }
+
+    @Override
+    public Frame toFrame() {
+        return new PPC64Frame(getEntrySP(), getEntrySP(), getEntryFP(), getEntryPC());
+    }
+
+}
diff --git a/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/runtime/ppc64/PPC64Frame.java b/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/runtime/ppc64/PPC64Frame.java
index cae034c9613..a663d016011 100644
--- a/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/runtime/ppc64/PPC64Frame.java
+++ b/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/runtime/ppc64/PPC64Frame.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2014, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2014, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -198,6 +198,11 @@ public class PPC64Frame extends Frame {
   public Address getSP() { return raw_sp; }
   public Address getID() { return raw_sp; }
 
+  @Override
+  public void setSP(Address newSP) {
+    raw_sp = newSP;
+  }
+
   // FIXME: not implemented yet (should be done for Solaris/PPC64)
   public boolean isSignalHandlerFrameDbg() { return false; }
   public int     getSignalNumberDbg()      { return 0;     }
@@ -260,9 +265,7 @@ public class PPC64Frame extends Frame {
     if (cb != null) {
       if (cb.isUpcallStub()) {
         return senderForUpcallStub(map, (UpcallStub)cb);
-      } else if (cb.isContinuationStub()) {
-        return senderForContinuationStub(map, cb);
-      } else {
+      } else if (cb.getFrameSize() > 0) {
         return senderForCompiledFrame(map, cb);
       }
     }
@@ -337,16 +340,6 @@ public class PPC64Frame extends Frame {
     return new PPC64Frame(sp, unextendedSP, getLink(), getSenderPC());
   }
 
-  private Frame senderForContinuationStub(PPC64RegisterMap map, CodeBlob cb) {
-    var contEntry = map.getThread().getContEntry();
-
-    Address sp = contEntry.getEntrySP();
-    Address pc = contEntry.getEntryPC();
-    Address fp = contEntry.getEntryFP();
-
-    return new PPC64Frame(sp, fp, pc);
-  }
-
   private Frame senderForCompiledFrame(PPC64RegisterMap map, CodeBlob cb) {
     if (DEBUG) {
       System.out.println("senderForCompiledFrame");
@@ -379,6 +372,22 @@ public class PPC64Frame extends Frame {
       }
     }
 
+    if (Continuation.isReturnBarrierEntry(senderPC)) {
+      // We assume WalkContinuation is "WalkContinuation::skip".
+      // It is same with c'tor arguments of RegisterMap in frame::next_frame().
+      //
+      // HotSpot code in cpu/ppc/frame_ppc.inline.hpp:
+      //
+      //   if (Continuation::is_return_barrier_entry(sender_pc)) {
+      //     if (map->walk_cont()) { // about to walk into an h-stack
+      //       return Continuation::top_frame(*this, map);
+      //     } else {
+      //       return Continuation::continuation_bottom_sender(map->thread(), *this, l_sender_sp);
+      //     }
+      //   }
+      return Continuation.continuationBottomSender(map.getThread(), this, senderSP);
+    }
+
     return new PPC64Frame(senderSP, getLink(), senderPC);
   }
 
diff --git a/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/runtime/riscv64/RISCV64ContinuationEntry.java b/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/runtime/riscv64/RISCV64ContinuationEntry.java
new file mode 100644
index 00000000000..ec04498a6c0
--- /dev/null
+++ b/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/runtime/riscv64/RISCV64ContinuationEntry.java
@@ -0,0 +1,43 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2026, NTT DATA.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ *
+ */
+package sun.jvm.hotspot.runtime.riscv64;
+
+import sun.jvm.hotspot.debugger.Address;
+import sun.jvm.hotspot.runtime.ContinuationEntry;
+import sun.jvm.hotspot.runtime.Frame;
+
+
+public class RISCV64ContinuationEntry extends ContinuationEntry {
+
+    public RISCV64ContinuationEntry(Address addr) {
+        super(addr);
+    }
+
+    @Override
+    public Frame toFrame() {
+        return new RISCV64Frame(getEntrySP(), getEntrySP(), getEntryFP(), getEntryPC());
+    }
+
+}
diff --git a/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/runtime/riscv64/RISCV64Frame.java b/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/runtime/riscv64/RISCV64Frame.java
index 44c8f4c679c..a35c0735979 100644
--- a/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/runtime/riscv64/RISCV64Frame.java
+++ b/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/runtime/riscv64/RISCV64Frame.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2001, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2001, 2026, Oracle and/or its affiliates. All rights reserved.
  * Copyright (c) 2015, 2019, Red Hat Inc.
  * Copyright (c) 2021, 2023, Huawei Technologies Co., Ltd. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
@@ -201,6 +201,11 @@ public class RISCV64Frame extends Frame {
   public Address getSP() { return raw_sp; }
   public Address getID() { return raw_sp; }
 
+  @Override
+  public void setSP(Address newSP) {
+    raw_sp = newSP;
+  }
+
   // FIXME: not implemented yet
   public boolean isSignalHandlerFrameDbg() { return false; }
   public int     getSignalNumberDbg()      { return 0;     }
@@ -264,9 +269,7 @@ public class RISCV64Frame extends Frame {
     if (cb != null) {
       if (cb.isUpcallStub()) {
         return senderForUpcallStub(map, (UpcallStub)cb);
-      } else if (cb.isContinuationStub()) {
-        return senderForContinuationStub(map, cb);
-      } else {
+      } else if (cb.getFrameSize() > 0) {
         return senderForCompiledFrame(map, cb);
       }
     }
@@ -354,16 +357,6 @@ public class RISCV64Frame extends Frame {
     map.setLocation(fp, savedFPAddr);
   }
 
-  private Frame senderForContinuationStub(RISCV64RegisterMap map, CodeBlob cb) {
-    var contEntry = map.getThread().getContEntry();
-
-    Address senderSP = contEntry.getEntrySP();
-    Address senderPC = contEntry.getEntryPC();
-    Address senderFP = contEntry.getEntryFP();
-
-    return new RISCV64Frame(senderSP, senderFP, senderPC);
-  }
-
   private Frame senderForCompiledFrame(RISCV64RegisterMap map, CodeBlob cb) {
     if (DEBUG) {
       System.out.println("senderForCompiledFrame");
@@ -406,6 +399,22 @@ public class RISCV64Frame extends Frame {
       updateMapWithSavedLink(map, savedFPAddr);
     }
 
+    if (Continuation.isReturnBarrierEntry(senderPC)) {
+      // We assume WalkContinuation is "WalkContinuation::skip".
+      // It is same with c'tor arguments of RegisterMap in frame::next_frame().
+      //
+      // HotSpot code in cpu/riscv/frame_riscv.inline.hpp:
+      //
+      //   if (Continuation::is_return_barrier_entry(sender_pc)) {
+      //     if (map->walk_cont()) { // about to walk into an h-stack
+      //       return Continuation::top_frame(*this, map);
+      //     } else {
+      //       return Continuation::continuation_bottom_sender(map->thread(), *this, l_sender_sp);
+      //     }
+      //   }
+      return Continuation.continuationBottomSender(map.getThread(), this, senderSP);
+    }
+
     return new RISCV64Frame(senderSP, savedFPAddr.getAddressAt(0), senderPC);
   }
 

From 960161db82191b679b92094c8bd661e868dfb424 Mon Sep 17 00:00:00 2001
From: Yasumasa Suenaga <ysuenaga@openjdk.org>
Date: Thu, 26 Mar 2026 07:22:04 +0000
Subject: [PATCH 356/655] 8380764: Vector classes should have @ValueBased

Reviewed-by: liach
---
 .../share/classes/jdk/incubator/vector/ByteVector128.java   | 6 ++++--
 .../share/classes/jdk/incubator/vector/ByteVector256.java   | 6 ++++--
 .../share/classes/jdk/incubator/vector/ByteVector512.java   | 6 ++++--
 .../share/classes/jdk/incubator/vector/ByteVector64.java    | 6 ++++--
 .../share/classes/jdk/incubator/vector/ByteVectorMax.java   | 6 ++++--
 .../share/classes/jdk/incubator/vector/DoubleVector128.java | 6 ++++--
 .../share/classes/jdk/incubator/vector/DoubleVector256.java | 6 ++++--
 .../share/classes/jdk/incubator/vector/DoubleVector512.java | 6 ++++--
 .../share/classes/jdk/incubator/vector/DoubleVector64.java  | 6 ++++--
 .../share/classes/jdk/incubator/vector/DoubleVectorMax.java | 6 ++++--
 .../share/classes/jdk/incubator/vector/FloatVector128.java  | 6 ++++--
 .../share/classes/jdk/incubator/vector/FloatVector256.java  | 6 ++++--
 .../share/classes/jdk/incubator/vector/FloatVector512.java  | 6 ++++--
 .../share/classes/jdk/incubator/vector/FloatVector64.java   | 6 ++++--
 .../share/classes/jdk/incubator/vector/FloatVectorMax.java  | 6 ++++--
 .../share/classes/jdk/incubator/vector/IntVector128.java    | 6 ++++--
 .../share/classes/jdk/incubator/vector/IntVector256.java    | 6 ++++--
 .../share/classes/jdk/incubator/vector/IntVector512.java    | 6 ++++--
 .../share/classes/jdk/incubator/vector/IntVector64.java     | 6 ++++--
 .../share/classes/jdk/incubator/vector/IntVectorMax.java    | 6 ++++--
 .../share/classes/jdk/incubator/vector/LongVector128.java   | 6 ++++--
 .../share/classes/jdk/incubator/vector/LongVector256.java   | 6 ++++--
 .../share/classes/jdk/incubator/vector/LongVector512.java   | 6 ++++--
 .../share/classes/jdk/incubator/vector/LongVector64.java    | 6 ++++--
 .../share/classes/jdk/incubator/vector/LongVectorMax.java   | 6 ++++--
 .../share/classes/jdk/incubator/vector/ShortVector128.java  | 6 ++++--
 .../share/classes/jdk/incubator/vector/ShortVector256.java  | 6 ++++--
 .../share/classes/jdk/incubator/vector/ShortVector512.java  | 6 ++++--
 .../share/classes/jdk/incubator/vector/ShortVector64.java   | 6 ++++--
 .../share/classes/jdk/incubator/vector/ShortVectorMax.java  | 6 ++++--
 .../classes/jdk/incubator/vector/X-VectorBits.java.template | 6 ++++--
 31 files changed, 124 insertions(+), 62 deletions(-)

diff --git a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/ByteVector128.java b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/ByteVector128.java
index c38e8d0f8a0..360afedbbbb 100644
--- a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/ByteVector128.java
+++ b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/ByteVector128.java
@@ -31,6 +31,7 @@ import java.util.Arrays;
 import java.util.Objects;
 import java.util.function.IntUnaryOperator;
 
+import jdk.internal.ValueBased;
 import jdk.internal.vm.annotation.ForceInline;
 import jdk.internal.vm.vector.VectorSupport;
 
@@ -41,6 +42,7 @@ import static jdk.incubator.vector.VectorOperators.*;
 // -- This file was mechanically generated: Do not edit! -- //
 
 @SuppressWarnings("cast")  // warning: redundant cast
+@ValueBased
 final class ByteVector128 extends ByteVector {
     static final ByteSpecies VSPECIES =
         (ByteSpecies) ByteVector.SPECIES_128;
@@ -598,7 +600,7 @@ final class ByteVector128 extends ByteVector {
     }
 
     // Mask
-
+    @ValueBased
     static final class ByteMask128 extends AbstractMask<Byte> {
         static final int VLENGTH = VSPECIES.laneCount();    // used by the JVM
 
@@ -831,7 +833,7 @@ final class ByteVector128 extends ByteVector {
     }
 
     // Shuffle
-
+    @ValueBased
     static final class ByteShuffle128 extends AbstractShuffle<Byte> {
         static final int VLENGTH = VSPECIES.laneCount();    // used by the JVM
 
diff --git a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/ByteVector256.java b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/ByteVector256.java
index 0eec0c56e37..ca0c59dd49e 100644
--- a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/ByteVector256.java
+++ b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/ByteVector256.java
@@ -31,6 +31,7 @@ import java.util.Arrays;
 import java.util.Objects;
 import java.util.function.IntUnaryOperator;
 
+import jdk.internal.ValueBased;
 import jdk.internal.vm.annotation.ForceInline;
 import jdk.internal.vm.vector.VectorSupport;
 
@@ -41,6 +42,7 @@ import static jdk.incubator.vector.VectorOperators.*;
 // -- This file was mechanically generated: Do not edit! -- //
 
 @SuppressWarnings("cast")  // warning: redundant cast
+@ValueBased
 final class ByteVector256 extends ByteVector {
     static final ByteSpecies VSPECIES =
         (ByteSpecies) ByteVector.SPECIES_256;
@@ -630,7 +632,7 @@ final class ByteVector256 extends ByteVector {
     }
 
     // Mask
-
+    @ValueBased
     static final class ByteMask256 extends AbstractMask<Byte> {
         static final int VLENGTH = VSPECIES.laneCount();    // used by the JVM
 
@@ -863,7 +865,7 @@ final class ByteVector256 extends ByteVector {
     }
 
     // Shuffle
-
+    @ValueBased
     static final class ByteShuffle256 extends AbstractShuffle<Byte> {
         static final int VLENGTH = VSPECIES.laneCount();    // used by the JVM
 
diff --git a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/ByteVector512.java b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/ByteVector512.java
index 138319b60d4..1a0c69153bc 100644
--- a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/ByteVector512.java
+++ b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/ByteVector512.java
@@ -31,6 +31,7 @@ import java.util.Arrays;
 import java.util.Objects;
 import java.util.function.IntUnaryOperator;
 
+import jdk.internal.ValueBased;
 import jdk.internal.vm.annotation.ForceInline;
 import jdk.internal.vm.vector.VectorSupport;
 
@@ -41,6 +42,7 @@ import static jdk.incubator.vector.VectorOperators.*;
 // -- This file was mechanically generated: Do not edit! -- //
 
 @SuppressWarnings("cast")  // warning: redundant cast
+@ValueBased
 final class ByteVector512 extends ByteVector {
     static final ByteSpecies VSPECIES =
         (ByteSpecies) ByteVector.SPECIES_512;
@@ -694,7 +696,7 @@ final class ByteVector512 extends ByteVector {
     }
 
     // Mask
-
+    @ValueBased
     static final class ByteMask512 extends AbstractMask<Byte> {
         static final int VLENGTH = VSPECIES.laneCount();    // used by the JVM
 
@@ -927,7 +929,7 @@ final class ByteVector512 extends ByteVector {
     }
 
     // Shuffle
-
+    @ValueBased
     static final class ByteShuffle512 extends AbstractShuffle<Byte> {
         static final int VLENGTH = VSPECIES.laneCount();    // used by the JVM
 
diff --git a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/ByteVector64.java b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/ByteVector64.java
index d7c7c78534b..50561eca0f8 100644
--- a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/ByteVector64.java
+++ b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/ByteVector64.java
@@ -31,6 +31,7 @@ import java.util.Arrays;
 import java.util.Objects;
 import java.util.function.IntUnaryOperator;
 
+import jdk.internal.ValueBased;
 import jdk.internal.vm.annotation.ForceInline;
 import jdk.internal.vm.vector.VectorSupport;
 
@@ -41,6 +42,7 @@ import static jdk.incubator.vector.VectorOperators.*;
 // -- This file was mechanically generated: Do not edit! -- //
 
 @SuppressWarnings("cast")  // warning: redundant cast
+@ValueBased
 final class ByteVector64 extends ByteVector {
     static final ByteSpecies VSPECIES =
         (ByteSpecies) ByteVector.SPECIES_64;
@@ -582,7 +584,7 @@ final class ByteVector64 extends ByteVector {
     }
 
     // Mask
-
+    @ValueBased
     static final class ByteMask64 extends AbstractMask<Byte> {
         static final int VLENGTH = VSPECIES.laneCount();    // used by the JVM
 
@@ -815,7 +817,7 @@ final class ByteVector64 extends ByteVector {
     }
 
     // Shuffle
-
+    @ValueBased
     static final class ByteShuffle64 extends AbstractShuffle<Byte> {
         static final int VLENGTH = VSPECIES.laneCount();    // used by the JVM
 
diff --git a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/ByteVectorMax.java b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/ByteVectorMax.java
index 636aa83893a..ee931bbc077 100644
--- a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/ByteVectorMax.java
+++ b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/ByteVectorMax.java
@@ -31,6 +31,7 @@ import java.util.Arrays;
 import java.util.Objects;
 import java.util.function.IntUnaryOperator;
 
+import jdk.internal.ValueBased;
 import jdk.internal.vm.annotation.ForceInline;
 import jdk.internal.vm.vector.VectorSupport;
 
@@ -41,6 +42,7 @@ import static jdk.incubator.vector.VectorOperators.*;
 // -- This file was mechanically generated: Do not edit! -- //
 
 @SuppressWarnings("cast")  // warning: redundant cast
+@ValueBased
 final class ByteVectorMax extends ByteVector {
     static final ByteSpecies VSPECIES =
         (ByteSpecies) ByteVector.SPECIES_MAX;
@@ -568,7 +570,7 @@ final class ByteVectorMax extends ByteVector {
     }
 
     // Mask
-
+    @ValueBased
     static final class ByteMaskMax extends AbstractMask<Byte> {
         static final int VLENGTH = VSPECIES.laneCount();    // used by the JVM
 
@@ -801,7 +803,7 @@ final class ByteVectorMax extends ByteVector {
     }
 
     // Shuffle
-
+    @ValueBased
     static final class ByteShuffleMax extends AbstractShuffle<Byte> {
         static final int VLENGTH = VSPECIES.laneCount();    // used by the JVM
 
diff --git a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/DoubleVector128.java b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/DoubleVector128.java
index 1140d377e9b..43c7e3f0c46 100644
--- a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/DoubleVector128.java
+++ b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/DoubleVector128.java
@@ -31,6 +31,7 @@ import java.util.Arrays;
 import java.util.Objects;
 import java.util.function.IntUnaryOperator;
 
+import jdk.internal.ValueBased;
 import jdk.internal.vm.annotation.ForceInline;
 import jdk.internal.vm.vector.VectorSupport;
 
@@ -41,6 +42,7 @@ import static jdk.incubator.vector.VectorOperators.*;
 // -- This file was mechanically generated: Do not edit! -- //
 
 @SuppressWarnings("cast")  // warning: redundant cast
+@ValueBased
 final class DoubleVector128 extends DoubleVector {
     static final DoubleSpecies VSPECIES =
         (DoubleSpecies) DoubleVector.SPECIES_128;
@@ -559,7 +561,7 @@ final class DoubleVector128 extends DoubleVector {
     }
 
     // Mask
-
+    @ValueBased
     static final class DoubleMask128 extends AbstractMask<Double> {
         static final int VLENGTH = VSPECIES.laneCount();    // used by the JVM
 
@@ -792,7 +794,7 @@ final class DoubleVector128 extends DoubleVector {
     }
 
     // Shuffle
-
+    @ValueBased
     static final class DoubleShuffle128 extends AbstractShuffle<Double> {
         static final int VLENGTH = VSPECIES.laneCount();    // used by the JVM
 
diff --git a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/DoubleVector256.java b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/DoubleVector256.java
index 59b7913cfcb..5f176854dbd 100644
--- a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/DoubleVector256.java
+++ b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/DoubleVector256.java
@@ -31,6 +31,7 @@ import java.util.Arrays;
 import java.util.Objects;
 import java.util.function.IntUnaryOperator;
 
+import jdk.internal.ValueBased;
 import jdk.internal.vm.annotation.ForceInline;
 import jdk.internal.vm.vector.VectorSupport;
 
@@ -41,6 +42,7 @@ import static jdk.incubator.vector.VectorOperators.*;
 // -- This file was mechanically generated: Do not edit! -- //
 
 @SuppressWarnings("cast")  // warning: redundant cast
+@ValueBased
 final class DoubleVector256 extends DoubleVector {
     static final DoubleSpecies VSPECIES =
         (DoubleSpecies) DoubleVector.SPECIES_256;
@@ -563,7 +565,7 @@ final class DoubleVector256 extends DoubleVector {
     }
 
     // Mask
-
+    @ValueBased
     static final class DoubleMask256 extends AbstractMask<Double> {
         static final int VLENGTH = VSPECIES.laneCount();    // used by the JVM
 
@@ -796,7 +798,7 @@ final class DoubleVector256 extends DoubleVector {
     }
 
     // Shuffle
-
+    @ValueBased
     static final class DoubleShuffle256 extends AbstractShuffle<Double> {
         static final int VLENGTH = VSPECIES.laneCount();    // used by the JVM
 
diff --git a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/DoubleVector512.java b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/DoubleVector512.java
index 8ed21953394..0696f48163d 100644
--- a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/DoubleVector512.java
+++ b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/DoubleVector512.java
@@ -31,6 +31,7 @@ import java.util.Arrays;
 import java.util.Objects;
 import java.util.function.IntUnaryOperator;
 
+import jdk.internal.ValueBased;
 import jdk.internal.vm.annotation.ForceInline;
 import jdk.internal.vm.vector.VectorSupport;
 
@@ -41,6 +42,7 @@ import static jdk.incubator.vector.VectorOperators.*;
 // -- This file was mechanically generated: Do not edit! -- //
 
 @SuppressWarnings("cast")  // warning: redundant cast
+@ValueBased
 final class DoubleVector512 extends DoubleVector {
     static final DoubleSpecies VSPECIES =
         (DoubleSpecies) DoubleVector.SPECIES_512;
@@ -571,7 +573,7 @@ final class DoubleVector512 extends DoubleVector {
     }
 
     // Mask
-
+    @ValueBased
     static final class DoubleMask512 extends AbstractMask<Double> {
         static final int VLENGTH = VSPECIES.laneCount();    // used by the JVM
 
@@ -804,7 +806,7 @@ final class DoubleVector512 extends DoubleVector {
     }
 
     // Shuffle
-
+    @ValueBased
     static final class DoubleShuffle512 extends AbstractShuffle<Double> {
         static final int VLENGTH = VSPECIES.laneCount();    // used by the JVM
 
diff --git a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/DoubleVector64.java b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/DoubleVector64.java
index 7e1a8cf768d..5b74c2c4619 100644
--- a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/DoubleVector64.java
+++ b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/DoubleVector64.java
@@ -31,6 +31,7 @@ import java.util.Arrays;
 import java.util.Objects;
 import java.util.function.IntUnaryOperator;
 
+import jdk.internal.ValueBased;
 import jdk.internal.vm.annotation.ForceInline;
 import jdk.internal.vm.vector.VectorSupport;
 
@@ -41,6 +42,7 @@ import static jdk.incubator.vector.VectorOperators.*;
 // -- This file was mechanically generated: Do not edit! -- //
 
 @SuppressWarnings("cast")  // warning: redundant cast
+@ValueBased
 final class DoubleVector64 extends DoubleVector {
     static final DoubleSpecies VSPECIES =
         (DoubleSpecies) DoubleVector.SPECIES_64;
@@ -557,7 +559,7 @@ final class DoubleVector64 extends DoubleVector {
     }
 
     // Mask
-
+    @ValueBased
     static final class DoubleMask64 extends AbstractMask<Double> {
         static final int VLENGTH = VSPECIES.laneCount();    // used by the JVM
 
@@ -790,7 +792,7 @@ final class DoubleVector64 extends DoubleVector {
     }
 
     // Shuffle
-
+    @ValueBased
     static final class DoubleShuffle64 extends AbstractShuffle<Double> {
         static final int VLENGTH = VSPECIES.laneCount();    // used by the JVM
 
diff --git a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/DoubleVectorMax.java b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/DoubleVectorMax.java
index 46c090e066e..07d227d641a 100644
--- a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/DoubleVectorMax.java
+++ b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/DoubleVectorMax.java
@@ -31,6 +31,7 @@ import java.util.Arrays;
 import java.util.Objects;
 import java.util.function.IntUnaryOperator;
 
+import jdk.internal.ValueBased;
 import jdk.internal.vm.annotation.ForceInline;
 import jdk.internal.vm.vector.VectorSupport;
 
@@ -41,6 +42,7 @@ import static jdk.incubator.vector.VectorOperators.*;
 // -- This file was mechanically generated: Do not edit! -- //
 
 @SuppressWarnings("cast")  // warning: redundant cast
+@ValueBased
 final class DoubleVectorMax extends DoubleVector {
     static final DoubleSpecies VSPECIES =
         (DoubleSpecies) DoubleVector.SPECIES_MAX;
@@ -556,7 +558,7 @@ final class DoubleVectorMax extends DoubleVector {
     }
 
     // Mask
-
+    @ValueBased
     static final class DoubleMaskMax extends AbstractMask<Double> {
         static final int VLENGTH = VSPECIES.laneCount();    // used by the JVM
 
@@ -789,7 +791,7 @@ final class DoubleVectorMax extends DoubleVector {
     }
 
     // Shuffle
-
+    @ValueBased
     static final class DoubleShuffleMax extends AbstractShuffle<Double> {
         static final int VLENGTH = VSPECIES.laneCount();    // used by the JVM
 
diff --git a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/FloatVector128.java b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/FloatVector128.java
index 1e3867e84fc..17c1fdba4fc 100644
--- a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/FloatVector128.java
+++ b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/FloatVector128.java
@@ -31,6 +31,7 @@ import java.util.Arrays;
 import java.util.Objects;
 import java.util.function.IntUnaryOperator;
 
+import jdk.internal.ValueBased;
 import jdk.internal.vm.annotation.ForceInline;
 import jdk.internal.vm.vector.VectorSupport;
 
@@ -41,6 +42,7 @@ import static jdk.incubator.vector.VectorOperators.*;
 // -- This file was mechanically generated: Do not edit! -- //
 
 @SuppressWarnings("cast")  // warning: redundant cast
+@ValueBased
 final class FloatVector128 extends FloatVector {
     static final FloatSpecies VSPECIES =
         (FloatSpecies) FloatVector.SPECIES_128;
@@ -563,7 +565,7 @@ final class FloatVector128 extends FloatVector {
     }
 
     // Mask
-
+    @ValueBased
     static final class FloatMask128 extends AbstractMask<Float> {
         static final int VLENGTH = VSPECIES.laneCount();    // used by the JVM
 
@@ -796,7 +798,7 @@ final class FloatVector128 extends FloatVector {
     }
 
     // Shuffle
-
+    @ValueBased
     static final class FloatShuffle128 extends AbstractShuffle<Float> {
         static final int VLENGTH = VSPECIES.laneCount();    // used by the JVM
 
diff --git a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/FloatVector256.java b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/FloatVector256.java
index f267025972d..7badb71415e 100644
--- a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/FloatVector256.java
+++ b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/FloatVector256.java
@@ -31,6 +31,7 @@ import java.util.Arrays;
 import java.util.Objects;
 import java.util.function.IntUnaryOperator;
 
+import jdk.internal.ValueBased;
 import jdk.internal.vm.annotation.ForceInline;
 import jdk.internal.vm.vector.VectorSupport;
 
@@ -41,6 +42,7 @@ import static jdk.incubator.vector.VectorOperators.*;
 // -- This file was mechanically generated: Do not edit! -- //
 
 @SuppressWarnings("cast")  // warning: redundant cast
+@ValueBased
 final class FloatVector256 extends FloatVector {
     static final FloatSpecies VSPECIES =
         (FloatSpecies) FloatVector.SPECIES_256;
@@ -571,7 +573,7 @@ final class FloatVector256 extends FloatVector {
     }
 
     // Mask
-
+    @ValueBased
     static final class FloatMask256 extends AbstractMask<Float> {
         static final int VLENGTH = VSPECIES.laneCount();    // used by the JVM
 
@@ -804,7 +806,7 @@ final class FloatVector256 extends FloatVector {
     }
 
     // Shuffle
-
+    @ValueBased
     static final class FloatShuffle256 extends AbstractShuffle<Float> {
         static final int VLENGTH = VSPECIES.laneCount();    // used by the JVM
 
diff --git a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/FloatVector512.java b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/FloatVector512.java
index 439e26f0d89..7c0786b7fcd 100644
--- a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/FloatVector512.java
+++ b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/FloatVector512.java
@@ -31,6 +31,7 @@ import java.util.Arrays;
 import java.util.Objects;
 import java.util.function.IntUnaryOperator;
 
+import jdk.internal.ValueBased;
 import jdk.internal.vm.annotation.ForceInline;
 import jdk.internal.vm.vector.VectorSupport;
 
@@ -41,6 +42,7 @@ import static jdk.incubator.vector.VectorOperators.*;
 // -- This file was mechanically generated: Do not edit! -- //
 
 @SuppressWarnings("cast")  // warning: redundant cast
+@ValueBased
 final class FloatVector512 extends FloatVector {
     static final FloatSpecies VSPECIES =
         (FloatSpecies) FloatVector.SPECIES_512;
@@ -587,7 +589,7 @@ final class FloatVector512 extends FloatVector {
     }
 
     // Mask
-
+    @ValueBased
     static final class FloatMask512 extends AbstractMask<Float> {
         static final int VLENGTH = VSPECIES.laneCount();    // used by the JVM
 
@@ -820,7 +822,7 @@ final class FloatVector512 extends FloatVector {
     }
 
     // Shuffle
-
+    @ValueBased
     static final class FloatShuffle512 extends AbstractShuffle<Float> {
         static final int VLENGTH = VSPECIES.laneCount();    // used by the JVM
 
diff --git a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/FloatVector64.java b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/FloatVector64.java
index 9e81a52d27b..fc4877e5ae8 100644
--- a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/FloatVector64.java
+++ b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/FloatVector64.java
@@ -31,6 +31,7 @@ import java.util.Arrays;
 import java.util.Objects;
 import java.util.function.IntUnaryOperator;
 
+import jdk.internal.ValueBased;
 import jdk.internal.vm.annotation.ForceInline;
 import jdk.internal.vm.vector.VectorSupport;
 
@@ -41,6 +42,7 @@ import static jdk.incubator.vector.VectorOperators.*;
 // -- This file was mechanically generated: Do not edit! -- //
 
 @SuppressWarnings("cast")  // warning: redundant cast
+@ValueBased
 final class FloatVector64 extends FloatVector {
     static final FloatSpecies VSPECIES =
         (FloatSpecies) FloatVector.SPECIES_64;
@@ -559,7 +561,7 @@ final class FloatVector64 extends FloatVector {
     }
 
     // Mask
-
+    @ValueBased
     static final class FloatMask64 extends AbstractMask<Float> {
         static final int VLENGTH = VSPECIES.laneCount();    // used by the JVM
 
@@ -792,7 +794,7 @@ final class FloatVector64 extends FloatVector {
     }
 
     // Shuffle
-
+    @ValueBased
     static final class FloatShuffle64 extends AbstractShuffle<Float> {
         static final int VLENGTH = VSPECIES.laneCount();    // used by the JVM
 
diff --git a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/FloatVectorMax.java b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/FloatVectorMax.java
index 4813f153544..5cfafecdb58 100644
--- a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/FloatVectorMax.java
+++ b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/FloatVectorMax.java
@@ -31,6 +31,7 @@ import java.util.Arrays;
 import java.util.Objects;
 import java.util.function.IntUnaryOperator;
 
+import jdk.internal.ValueBased;
 import jdk.internal.vm.annotation.ForceInline;
 import jdk.internal.vm.vector.VectorSupport;
 
@@ -41,6 +42,7 @@ import static jdk.incubator.vector.VectorOperators.*;
 // -- This file was mechanically generated: Do not edit! -- //
 
 @SuppressWarnings("cast")  // warning: redundant cast
+@ValueBased
 final class FloatVectorMax extends FloatVector {
     static final FloatSpecies VSPECIES =
         (FloatSpecies) FloatVector.SPECIES_MAX;
@@ -556,7 +558,7 @@ final class FloatVectorMax extends FloatVector {
     }
 
     // Mask
-
+    @ValueBased
     static final class FloatMaskMax extends AbstractMask<Float> {
         static final int VLENGTH = VSPECIES.laneCount();    // used by the JVM
 
@@ -789,7 +791,7 @@ final class FloatVectorMax extends FloatVector {
     }
 
     // Shuffle
-
+    @ValueBased
     static final class FloatShuffleMax extends AbstractShuffle<Float> {
         static final int VLENGTH = VSPECIES.laneCount();    // used by the JVM
 
diff --git a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/IntVector128.java b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/IntVector128.java
index cc8f31a4bc2..04b10386127 100644
--- a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/IntVector128.java
+++ b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/IntVector128.java
@@ -31,6 +31,7 @@ import java.util.Arrays;
 import java.util.Objects;
 import java.util.function.IntUnaryOperator;
 
+import jdk.internal.ValueBased;
 import jdk.internal.vm.annotation.ForceInline;
 import jdk.internal.vm.vector.VectorSupport;
 
@@ -41,6 +42,7 @@ import static jdk.incubator.vector.VectorOperators.*;
 // -- This file was mechanically generated: Do not edit! -- //
 
 @SuppressWarnings("cast")  // warning: redundant cast
+@ValueBased
 final class IntVector128 extends IntVector {
     static final IntSpecies VSPECIES =
         (IntSpecies) IntVector.SPECIES_128;
@@ -574,7 +576,7 @@ final class IntVector128 extends IntVector {
     }
 
     // Mask
-
+    @ValueBased
     static final class IntMask128 extends AbstractMask<Integer> {
         static final int VLENGTH = VSPECIES.laneCount();    // used by the JVM
 
@@ -807,7 +809,7 @@ final class IntVector128 extends IntVector {
     }
 
     // Shuffle
-
+    @ValueBased
     static final class IntShuffle128 extends AbstractShuffle<Integer> {
         static final int VLENGTH = VSPECIES.laneCount();    // used by the JVM
 
diff --git a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/IntVector256.java b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/IntVector256.java
index 0630cd958f2..20d9df1cd60 100644
--- a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/IntVector256.java
+++ b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/IntVector256.java
@@ -31,6 +31,7 @@ import java.util.Arrays;
 import java.util.Objects;
 import java.util.function.IntUnaryOperator;
 
+import jdk.internal.ValueBased;
 import jdk.internal.vm.annotation.ForceInline;
 import jdk.internal.vm.vector.VectorSupport;
 
@@ -41,6 +42,7 @@ import static jdk.incubator.vector.VectorOperators.*;
 // -- This file was mechanically generated: Do not edit! -- //
 
 @SuppressWarnings("cast")  // warning: redundant cast
+@ValueBased
 final class IntVector256 extends IntVector {
     static final IntSpecies VSPECIES =
         (IntSpecies) IntVector.SPECIES_256;
@@ -582,7 +584,7 @@ final class IntVector256 extends IntVector {
     }
 
     // Mask
-
+    @ValueBased
     static final class IntMask256 extends AbstractMask<Integer> {
         static final int VLENGTH = VSPECIES.laneCount();    // used by the JVM
 
@@ -815,7 +817,7 @@ final class IntVector256 extends IntVector {
     }
 
     // Shuffle
-
+    @ValueBased
     static final class IntShuffle256 extends AbstractShuffle<Integer> {
         static final int VLENGTH = VSPECIES.laneCount();    // used by the JVM
 
diff --git a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/IntVector512.java b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/IntVector512.java
index 92eb5a0f2d2..4f3a16e2777 100644
--- a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/IntVector512.java
+++ b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/IntVector512.java
@@ -31,6 +31,7 @@ import java.util.Arrays;
 import java.util.Objects;
 import java.util.function.IntUnaryOperator;
 
+import jdk.internal.ValueBased;
 import jdk.internal.vm.annotation.ForceInline;
 import jdk.internal.vm.vector.VectorSupport;
 
@@ -41,6 +42,7 @@ import static jdk.incubator.vector.VectorOperators.*;
 // -- This file was mechanically generated: Do not edit! -- //
 
 @SuppressWarnings("cast")  // warning: redundant cast
+@ValueBased
 final class IntVector512 extends IntVector {
     static final IntSpecies VSPECIES =
         (IntSpecies) IntVector.SPECIES_512;
@@ -598,7 +600,7 @@ final class IntVector512 extends IntVector {
     }
 
     // Mask
-
+    @ValueBased
     static final class IntMask512 extends AbstractMask<Integer> {
         static final int VLENGTH = VSPECIES.laneCount();    // used by the JVM
 
@@ -831,7 +833,7 @@ final class IntVector512 extends IntVector {
     }
 
     // Shuffle
-
+    @ValueBased
     static final class IntShuffle512 extends AbstractShuffle<Integer> {
         static final int VLENGTH = VSPECIES.laneCount();    // used by the JVM
 
diff --git a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/IntVector64.java b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/IntVector64.java
index c3f92285034..dd51669943b 100644
--- a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/IntVector64.java
+++ b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/IntVector64.java
@@ -31,6 +31,7 @@ import java.util.Arrays;
 import java.util.Objects;
 import java.util.function.IntUnaryOperator;
 
+import jdk.internal.ValueBased;
 import jdk.internal.vm.annotation.ForceInline;
 import jdk.internal.vm.vector.VectorSupport;
 
@@ -41,6 +42,7 @@ import static jdk.incubator.vector.VectorOperators.*;
 // -- This file was mechanically generated: Do not edit! -- //
 
 @SuppressWarnings("cast")  // warning: redundant cast
+@ValueBased
 final class IntVector64 extends IntVector {
     static final IntSpecies VSPECIES =
         (IntSpecies) IntVector.SPECIES_64;
@@ -570,7 +572,7 @@ final class IntVector64 extends IntVector {
     }
 
     // Mask
-
+    @ValueBased
     static final class IntMask64 extends AbstractMask<Integer> {
         static final int VLENGTH = VSPECIES.laneCount();    // used by the JVM
 
@@ -803,7 +805,7 @@ final class IntVector64 extends IntVector {
     }
 
     // Shuffle
-
+    @ValueBased
     static final class IntShuffle64 extends AbstractShuffle<Integer> {
         static final int VLENGTH = VSPECIES.laneCount();    // used by the JVM
 
diff --git a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/IntVectorMax.java b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/IntVectorMax.java
index 8d3c251536c..0b785b01aec 100644
--- a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/IntVectorMax.java
+++ b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/IntVectorMax.java
@@ -31,6 +31,7 @@ import java.util.Arrays;
 import java.util.Objects;
 import java.util.function.IntUnaryOperator;
 
+import jdk.internal.ValueBased;
 import jdk.internal.vm.annotation.ForceInline;
 import jdk.internal.vm.vector.VectorSupport;
 
@@ -41,6 +42,7 @@ import static jdk.incubator.vector.VectorOperators.*;
 // -- This file was mechanically generated: Do not edit! -- //
 
 @SuppressWarnings("cast")  // warning: redundant cast
+@ValueBased
 final class IntVectorMax extends IntVector {
     static final IntSpecies VSPECIES =
         (IntSpecies) IntVector.SPECIES_MAX;
@@ -568,7 +570,7 @@ final class IntVectorMax extends IntVector {
     }
 
     // Mask
-
+    @ValueBased
     static final class IntMaskMax extends AbstractMask<Integer> {
         static final int VLENGTH = VSPECIES.laneCount();    // used by the JVM
 
@@ -812,7 +814,7 @@ final class IntVectorMax extends IntVector {
     }
 
     // Shuffle
-
+    @ValueBased
     static final class IntShuffleMax extends AbstractShuffle<Integer> {
         static final int VLENGTH = VSPECIES.laneCount();    // used by the JVM
 
diff --git a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/LongVector128.java b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/LongVector128.java
index f8dad12ff89..594c82ca1fc 100644
--- a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/LongVector128.java
+++ b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/LongVector128.java
@@ -31,6 +31,7 @@ import java.util.Arrays;
 import java.util.Objects;
 import java.util.function.IntUnaryOperator;
 
+import jdk.internal.ValueBased;
 import jdk.internal.vm.annotation.ForceInline;
 import jdk.internal.vm.vector.VectorSupport;
 
@@ -41,6 +42,7 @@ import static jdk.incubator.vector.VectorOperators.*;
 // -- This file was mechanically generated: Do not edit! -- //
 
 @SuppressWarnings("cast")  // warning: redundant cast
+@ValueBased
 final class LongVector128 extends LongVector {
     static final LongSpecies VSPECIES =
         (LongSpecies) LongVector.SPECIES_128;
@@ -560,7 +562,7 @@ final class LongVector128 extends LongVector {
     }
 
     // Mask
-
+    @ValueBased
     static final class LongMask128 extends AbstractMask<Long> {
         static final int VLENGTH = VSPECIES.laneCount();    // used by the JVM
 
@@ -793,7 +795,7 @@ final class LongVector128 extends LongVector {
     }
 
     // Shuffle
-
+    @ValueBased
     static final class LongShuffle128 extends AbstractShuffle<Long> {
         static final int VLENGTH = VSPECIES.laneCount();    // used by the JVM
 
diff --git a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/LongVector256.java b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/LongVector256.java
index 144e2c1c64d..c3d1ff4c276 100644
--- a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/LongVector256.java
+++ b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/LongVector256.java
@@ -31,6 +31,7 @@ import java.util.Arrays;
 import java.util.Objects;
 import java.util.function.IntUnaryOperator;
 
+import jdk.internal.ValueBased;
 import jdk.internal.vm.annotation.ForceInline;
 import jdk.internal.vm.vector.VectorSupport;
 
@@ -41,6 +42,7 @@ import static jdk.incubator.vector.VectorOperators.*;
 // -- This file was mechanically generated: Do not edit! -- //
 
 @SuppressWarnings("cast")  // warning: redundant cast
+@ValueBased
 final class LongVector256 extends LongVector {
     static final LongSpecies VSPECIES =
         (LongSpecies) LongVector.SPECIES_256;
@@ -564,7 +566,7 @@ final class LongVector256 extends LongVector {
     }
 
     // Mask
-
+    @ValueBased
     static final class LongMask256 extends AbstractMask<Long> {
         static final int VLENGTH = VSPECIES.laneCount();    // used by the JVM
 
@@ -797,7 +799,7 @@ final class LongVector256 extends LongVector {
     }
 
     // Shuffle
-
+    @ValueBased
     static final class LongShuffle256 extends AbstractShuffle<Long> {
         static final int VLENGTH = VSPECIES.laneCount();    // used by the JVM
 
diff --git a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/LongVector512.java b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/LongVector512.java
index b49d0c7c147..b8c95967a99 100644
--- a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/LongVector512.java
+++ b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/LongVector512.java
@@ -31,6 +31,7 @@ import java.util.Arrays;
 import java.util.Objects;
 import java.util.function.IntUnaryOperator;
 
+import jdk.internal.ValueBased;
 import jdk.internal.vm.annotation.ForceInline;
 import jdk.internal.vm.vector.VectorSupport;
 
@@ -41,6 +42,7 @@ import static jdk.incubator.vector.VectorOperators.*;
 // -- This file was mechanically generated: Do not edit! -- //
 
 @SuppressWarnings("cast")  // warning: redundant cast
+@ValueBased
 final class LongVector512 extends LongVector {
     static final LongSpecies VSPECIES =
         (LongSpecies) LongVector.SPECIES_512;
@@ -572,7 +574,7 @@ final class LongVector512 extends LongVector {
     }
 
     // Mask
-
+    @ValueBased
     static final class LongMask512 extends AbstractMask<Long> {
         static final int VLENGTH = VSPECIES.laneCount();    // used by the JVM
 
@@ -805,7 +807,7 @@ final class LongVector512 extends LongVector {
     }
 
     // Shuffle
-
+    @ValueBased
     static final class LongShuffle512 extends AbstractShuffle<Long> {
         static final int VLENGTH = VSPECIES.laneCount();    // used by the JVM
 
diff --git a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/LongVector64.java b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/LongVector64.java
index 5e8451695bc..3c9b525f6d0 100644
--- a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/LongVector64.java
+++ b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/LongVector64.java
@@ -31,6 +31,7 @@ import java.util.Arrays;
 import java.util.Objects;
 import java.util.function.IntUnaryOperator;
 
+import jdk.internal.ValueBased;
 import jdk.internal.vm.annotation.ForceInline;
 import jdk.internal.vm.vector.VectorSupport;
 
@@ -41,6 +42,7 @@ import static jdk.incubator.vector.VectorOperators.*;
 // -- This file was mechanically generated: Do not edit! -- //
 
 @SuppressWarnings("cast")  // warning: redundant cast
+@ValueBased
 final class LongVector64 extends LongVector {
     static final LongSpecies VSPECIES =
         (LongSpecies) LongVector.SPECIES_64;
@@ -558,7 +560,7 @@ final class LongVector64 extends LongVector {
     }
 
     // Mask
-
+    @ValueBased
     static final class LongMask64 extends AbstractMask<Long> {
         static final int VLENGTH = VSPECIES.laneCount();    // used by the JVM
 
@@ -791,7 +793,7 @@ final class LongVector64 extends LongVector {
     }
 
     // Shuffle
-
+    @ValueBased
     static final class LongShuffle64 extends AbstractShuffle<Long> {
         static final int VLENGTH = VSPECIES.laneCount();    // used by the JVM
 
diff --git a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/LongVectorMax.java b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/LongVectorMax.java
index 3469da8f2f4..4752959f884 100644
--- a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/LongVectorMax.java
+++ b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/LongVectorMax.java
@@ -31,6 +31,7 @@ import java.util.Arrays;
 import java.util.Objects;
 import java.util.function.IntUnaryOperator;
 
+import jdk.internal.ValueBased;
 import jdk.internal.vm.annotation.ForceInline;
 import jdk.internal.vm.vector.VectorSupport;
 
@@ -41,6 +42,7 @@ import static jdk.incubator.vector.VectorOperators.*;
 // -- This file was mechanically generated: Do not edit! -- //
 
 @SuppressWarnings("cast")  // warning: redundant cast
+@ValueBased
 final class LongVectorMax extends LongVector {
     static final LongSpecies VSPECIES =
         (LongSpecies) LongVector.SPECIES_MAX;
@@ -558,7 +560,7 @@ final class LongVectorMax extends LongVector {
     }
 
     // Mask
-
+    @ValueBased
     static final class LongMaskMax extends AbstractMask<Long> {
         static final int VLENGTH = VSPECIES.laneCount();    // used by the JVM
 
@@ -791,7 +793,7 @@ final class LongVectorMax extends LongVector {
     }
 
     // Shuffle
-
+    @ValueBased
     static final class LongShuffleMax extends AbstractShuffle<Long> {
         static final int VLENGTH = VSPECIES.laneCount();    // used by the JVM
 
diff --git a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/ShortVector128.java b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/ShortVector128.java
index e989cdbdbea..89ec97c6be0 100644
--- a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/ShortVector128.java
+++ b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/ShortVector128.java
@@ -31,6 +31,7 @@ import java.util.Arrays;
 import java.util.Objects;
 import java.util.function.IntUnaryOperator;
 
+import jdk.internal.ValueBased;
 import jdk.internal.vm.annotation.ForceInline;
 import jdk.internal.vm.vector.VectorSupport;
 
@@ -41,6 +42,7 @@ import static jdk.incubator.vector.VectorOperators.*;
 // -- This file was mechanically generated: Do not edit! -- //
 
 @SuppressWarnings("cast")  // warning: redundant cast
+@ValueBased
 final class ShortVector128 extends ShortVector {
     static final ShortSpecies VSPECIES =
         (ShortSpecies) ShortVector.SPECIES_128;
@@ -582,7 +584,7 @@ final class ShortVector128 extends ShortVector {
     }
 
     // Mask
-
+    @ValueBased
     static final class ShortMask128 extends AbstractMask<Short> {
         static final int VLENGTH = VSPECIES.laneCount();    // used by the JVM
 
@@ -815,7 +817,7 @@ final class ShortVector128 extends ShortVector {
     }
 
     // Shuffle
-
+    @ValueBased
     static final class ShortShuffle128 extends AbstractShuffle<Short> {
         static final int VLENGTH = VSPECIES.laneCount();    // used by the JVM
 
diff --git a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/ShortVector256.java b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/ShortVector256.java
index c74188e22f5..0f5751c27d8 100644
--- a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/ShortVector256.java
+++ b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/ShortVector256.java
@@ -31,6 +31,7 @@ import java.util.Arrays;
 import java.util.Objects;
 import java.util.function.IntUnaryOperator;
 
+import jdk.internal.ValueBased;
 import jdk.internal.vm.annotation.ForceInline;
 import jdk.internal.vm.vector.VectorSupport;
 
@@ -41,6 +42,7 @@ import static jdk.incubator.vector.VectorOperators.*;
 // -- This file was mechanically generated: Do not edit! -- //
 
 @SuppressWarnings("cast")  // warning: redundant cast
+@ValueBased
 final class ShortVector256 extends ShortVector {
     static final ShortSpecies VSPECIES =
         (ShortSpecies) ShortVector.SPECIES_256;
@@ -598,7 +600,7 @@ final class ShortVector256 extends ShortVector {
     }
 
     // Mask
-
+    @ValueBased
     static final class ShortMask256 extends AbstractMask<Short> {
         static final int VLENGTH = VSPECIES.laneCount();    // used by the JVM
 
@@ -831,7 +833,7 @@ final class ShortVector256 extends ShortVector {
     }
 
     // Shuffle
-
+    @ValueBased
     static final class ShortShuffle256 extends AbstractShuffle<Short> {
         static final int VLENGTH = VSPECIES.laneCount();    // used by the JVM
 
diff --git a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/ShortVector512.java b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/ShortVector512.java
index 46b5d652200..3d38dfd88fd 100644
--- a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/ShortVector512.java
+++ b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/ShortVector512.java
@@ -31,6 +31,7 @@ import java.util.Arrays;
 import java.util.Objects;
 import java.util.function.IntUnaryOperator;
 
+import jdk.internal.ValueBased;
 import jdk.internal.vm.annotation.ForceInline;
 import jdk.internal.vm.vector.VectorSupport;
 
@@ -41,6 +42,7 @@ import static jdk.incubator.vector.VectorOperators.*;
 // -- This file was mechanically generated: Do not edit! -- //
 
 @SuppressWarnings("cast")  // warning: redundant cast
+@ValueBased
 final class ShortVector512 extends ShortVector {
     static final ShortSpecies VSPECIES =
         (ShortSpecies) ShortVector.SPECIES_512;
@@ -630,7 +632,7 @@ final class ShortVector512 extends ShortVector {
     }
 
     // Mask
-
+    @ValueBased
     static final class ShortMask512 extends AbstractMask<Short> {
         static final int VLENGTH = VSPECIES.laneCount();    // used by the JVM
 
@@ -863,7 +865,7 @@ final class ShortVector512 extends ShortVector {
     }
 
     // Shuffle
-
+    @ValueBased
     static final class ShortShuffle512 extends AbstractShuffle<Short> {
         static final int VLENGTH = VSPECIES.laneCount();    // used by the JVM
 
diff --git a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/ShortVector64.java b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/ShortVector64.java
index 66ff3efe522..b319d98f784 100644
--- a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/ShortVector64.java
+++ b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/ShortVector64.java
@@ -31,6 +31,7 @@ import java.util.Arrays;
 import java.util.Objects;
 import java.util.function.IntUnaryOperator;
 
+import jdk.internal.ValueBased;
 import jdk.internal.vm.annotation.ForceInline;
 import jdk.internal.vm.vector.VectorSupport;
 
@@ -41,6 +42,7 @@ import static jdk.incubator.vector.VectorOperators.*;
 // -- This file was mechanically generated: Do not edit! -- //
 
 @SuppressWarnings("cast")  // warning: redundant cast
+@ValueBased
 final class ShortVector64 extends ShortVector {
     static final ShortSpecies VSPECIES =
         (ShortSpecies) ShortVector.SPECIES_64;
@@ -574,7 +576,7 @@ final class ShortVector64 extends ShortVector {
     }
 
     // Mask
-
+    @ValueBased
     static final class ShortMask64 extends AbstractMask<Short> {
         static final int VLENGTH = VSPECIES.laneCount();    // used by the JVM
 
@@ -807,7 +809,7 @@ final class ShortVector64 extends ShortVector {
     }
 
     // Shuffle
-
+    @ValueBased
     static final class ShortShuffle64 extends AbstractShuffle<Short> {
         static final int VLENGTH = VSPECIES.laneCount();    // used by the JVM
 
diff --git a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/ShortVectorMax.java b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/ShortVectorMax.java
index b9a9b85126b..69b298857c9 100644
--- a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/ShortVectorMax.java
+++ b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/ShortVectorMax.java
@@ -31,6 +31,7 @@ import java.util.Arrays;
 import java.util.Objects;
 import java.util.function.IntUnaryOperator;
 
+import jdk.internal.ValueBased;
 import jdk.internal.vm.annotation.ForceInline;
 import jdk.internal.vm.vector.VectorSupport;
 
@@ -41,6 +42,7 @@ import static jdk.incubator.vector.VectorOperators.*;
 // -- This file was mechanically generated: Do not edit! -- //
 
 @SuppressWarnings("cast")  // warning: redundant cast
+@ValueBased
 final class ShortVectorMax extends ShortVector {
     static final ShortSpecies VSPECIES =
         (ShortSpecies) ShortVector.SPECIES_MAX;
@@ -568,7 +570,7 @@ final class ShortVectorMax extends ShortVector {
     }
 
     // Mask
-
+    @ValueBased
     static final class ShortMaskMax extends AbstractMask<Short> {
         static final int VLENGTH = VSPECIES.laneCount();    // used by the JVM
 
@@ -801,7 +803,7 @@ final class ShortVectorMax extends ShortVector {
     }
 
     // Shuffle
-
+    @ValueBased
     static final class ShortShuffleMax extends AbstractShuffle<Short> {
         static final int VLENGTH = VSPECIES.laneCount();    // used by the JVM
 
diff --git a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/X-VectorBits.java.template b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/X-VectorBits.java.template
index bbf02f9c6cd..35041a0b70f 100644
--- a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/X-VectorBits.java.template
+++ b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/X-VectorBits.java.template
@@ -31,6 +31,7 @@ import java.util.Arrays;
 import java.util.Objects;
 import java.util.function.IntUnaryOperator;
 
+import jdk.internal.ValueBased;
 import jdk.internal.vm.annotation.ForceInline;
 import jdk.internal.vm.vector.VectorSupport;
 
@@ -41,6 +42,7 @@ import static jdk.incubator.vector.VectorOperators.*;
 #warn This file is preprocessed before being compiled
 
 @SuppressWarnings("cast")  // warning: redundant cast
+@ValueBased
 final class $vectortype$ extends $abstractvectortype$ {
     static final $Type$Species VSPECIES =
         ($Type$Species) $Type$Vector.SPECIES_$BITS$;
@@ -855,7 +857,7 @@ final class $vectortype$ extends $abstractvectortype$ {
 #end[FP]
 
     // Mask
-
+    @ValueBased
     static final class $masktype$ extends AbstractMask<$Boxtype$> {
         static final int VLENGTH = VSPECIES.laneCount();    // used by the JVM
 
@@ -1103,7 +1105,7 @@ final class $vectortype$ extends $abstractvectortype$ {
     }
 
     // Shuffle
-
+    @ValueBased
     static final class $shuffletype$ extends AbstractShuffle<$Boxtype$> {
         static final int VLENGTH = VSPECIES.laneCount();    // used by the JVM
 

From c64f7357a536a7577432964ea8ce723c5373a184 Mon Sep 17 00:00:00 2001
From: Matthias Baesken <mbaesken@openjdk.org>
Date: Thu, 26 Mar 2026 08:19:31 +0000
Subject: [PATCH 357/655] 8379516: Adjust JVM debug helper exports

Reviewed-by: kbarrett, lucy, clanger
---
 src/hotspot/share/utilities/debug.cpp | 104 +++++++++++++++++---------
 1 file changed, 69 insertions(+), 35 deletions(-)

diff --git a/src/hotspot/share/utilities/debug.cpp b/src/hotspot/share/utilities/debug.cpp
index e8533e29460..23e8281f000 100644
--- a/src/hotspot/share/utilities/debug.cpp
+++ b/src/hotspot/share/utilities/debug.cpp
@@ -342,20 +342,20 @@ class Command : public StackObj {
 
 int Command::level = 0;
 
-extern "C" DEBUGEXPORT void blob(CodeBlob* cb) {
+extern "C" NOINLINE void blob(CodeBlob* cb) {
   Command c("blob");
   cb->print();
 }
 
 
-extern "C" DEBUGEXPORT void dump_vtable(address p) {
+extern "C" NOINLINE void dump_vtable(address p) {
   Command c("dump_vtable");
   Klass* k = (Klass*)p;
   k->vtable().print();
 }
 
 
-extern "C" DEBUGEXPORT void nm(intptr_t p) {
+extern "C" NOINLINE void nm(intptr_t p) {
   // Actually we look through all CodeBlobs (the nm name has been kept for backwards compatibility)
   Command c("nm");
   CodeBlob* cb = CodeCache::find_blob((address)p);
@@ -367,7 +367,7 @@ extern "C" DEBUGEXPORT void nm(intptr_t p) {
 }
 
 
-extern "C" DEBUGEXPORT void disnm(intptr_t p) {
+extern "C" NOINLINE void disnm(intptr_t p) {
   Command c("disnm");
   CodeBlob* cb = CodeCache::find_blob((address) p);
   if (cb != nullptr) {
@@ -382,7 +382,7 @@ extern "C" DEBUGEXPORT void disnm(intptr_t p) {
 }
 
 
-extern "C" DEBUGEXPORT void printnm(intptr_t p) {
+extern "C" NOINLINE void printnm(intptr_t p) {
   char buffer[256];
   os::snprintf_checked(buffer, sizeof(buffer), "printnm: " INTPTR_FORMAT, p);
   Command c(buffer);
@@ -396,14 +396,14 @@ extern "C" DEBUGEXPORT void printnm(intptr_t p) {
 }
 
 
-extern "C" DEBUGEXPORT void universe() {
+extern "C" NOINLINE void universe() {
   Command c("universe");
   if (!c.onThread()) return;
   Universe::print_on(tty);
 }
 
 
-extern "C" DEBUGEXPORT void verify() {
+extern "C" NOINLINE void verify() {
   // try to run a verify on the entire system
   // note: this may not be safe if we're not at a safepoint; for debugging,
   // this manipulates the safepoint settings to avoid assertion failures
@@ -421,7 +421,7 @@ extern "C" DEBUGEXPORT void verify() {
 }
 
 
-extern "C" DEBUGEXPORT void pp(void* p) {
+extern "C" NOINLINE void pp(void* p) {
   Command c("pp");
   if (!c.onThread()) return;
   FlagSetting fl(DisplayVMOutput, true);
@@ -445,7 +445,7 @@ extern "C" DEBUGEXPORT void pp(void* p) {
 }
 
 
-extern "C" DEBUGEXPORT void ps() { // print stack
+extern "C" NOINLINE void ps() { // print stack
   // Prints the stack of the current Java thread
   Command c("ps");
   if (!c.onThread()) return;
@@ -477,7 +477,7 @@ extern "C" DEBUGEXPORT void ps() { // print stack
   }
 }
 
-extern "C" DEBUGEXPORT void pfl() {
+extern "C" NOINLINE void pfl() {
   // print frame layout
   Command c("pfl");
   if (!c.onThread()) return;
@@ -494,7 +494,7 @@ extern "C" DEBUGEXPORT void pfl() {
   }
 }
 
-extern "C" DEBUGEXPORT void psf() { // print stack frames
+extern "C" NOINLINE void psf() { // print stack frames
   Command c("psf");
   if (!c.onThread()) return;
   JavaThread* p = JavaThread::active();
@@ -511,21 +511,21 @@ extern "C" DEBUGEXPORT void psf() { // print stack frames
 }
 
 
-extern "C" DEBUGEXPORT void threads() {
+extern "C" NOINLINE void threads() {
   Command c("threads");
   if (!c.onThread()) return;
   Threads::print(false, true);
 }
 
 
-extern "C" DEBUGEXPORT void psd() {
+extern "C" NOINLINE void psd() {
   Command c("psd");
   if (!c.onThread()) return;
   SystemDictionary::print();
 }
 
 
-extern "C" DEBUGEXPORT void pss() { // print all stacks
+extern "C" NOINLINE void pss() { // print all stacks
   Command c("pss");
   if (!c.onThread()) return;
   Threads::print(true, PRODUCT_ONLY(false) NOT_PRODUCT(true));
@@ -533,7 +533,7 @@ extern "C" DEBUGEXPORT void pss() { // print all stacks
 
 // #ifndef PRODUCT
 
-extern "C" DEBUGEXPORT void debug() {               // to set things up for compiler debugging
+extern "C" NOINLINE void debug() {               // to set things up for compiler debugging
   Command c("debug");
   NOT_PRODUCT(WizardMode = true;)
   PrintCompilation = true;
@@ -542,7 +542,7 @@ extern "C" DEBUGEXPORT void debug() {               // to set things up for comp
 }
 
 
-extern "C" DEBUGEXPORT void ndebug() {              // undo debug()
+extern "C" NOINLINE void ndebug() {              // undo debug()
   Command c("ndebug");
   PrintCompilation = false;
   PrintInlining = PrintAssembly = false;
@@ -550,36 +550,36 @@ extern "C" DEBUGEXPORT void ndebug() {              // undo debug()
 }
 
 
-extern "C" DEBUGEXPORT void flush()  {
+extern "C" NOINLINE void flush()  {
   Command c("flush");
   tty->flush();
 }
 
-extern "C" DEBUGEXPORT void events() {
+extern "C" NOINLINE void events() {
   Command c("events");
   Events::print();
 }
 
-extern "C" DEBUGEXPORT Method* findm(intptr_t pc) {
+extern "C" NOINLINE Method* findm(intptr_t pc) {
   Command c("findm");
   nmethod* nm = CodeCache::find_nmethod((address)pc);
   return (nm == nullptr) ? (Method*)nullptr : nm->method();
 }
 
 
-extern "C" DEBUGEXPORT nmethod* findnm(intptr_t addr) {
+extern "C" NOINLINE nmethod* findnm(intptr_t addr) {
   Command c("findnm");
   return  CodeCache::find_nmethod((address)addr);
 }
 
-extern "C" DEBUGEXPORT void find(intptr_t x) {
+extern "C" NOINLINE void find(intptr_t x) {
   Command c("find");
   if (!c.onThread()) return;
   os::print_location(tty, x, false);
 }
 
 
-extern "C" DEBUGEXPORT void findpc(intptr_t x) {
+extern "C" NOINLINE void findpc(intptr_t x) {
   Command c("findpc");
   if (!c.onThread()) return;
   os::print_location(tty, x, true);
@@ -591,15 +591,14 @@ extern "C" DEBUGEXPORT void findpc(intptr_t x) {
 //   call findclass("java/lang/Object", 0x3)             -> find j.l.Object and disasm all of its methods
 //   call findmethod("*ang/Object*", "wait", 0xff)       -> detailed disasm of all "wait" methods in j.l.Object
 //   call findmethod("*ang/Object*", "wait:(*J*)V", 0x1) -> list all "wait" methods in j.l.Object that have a long parameter
-extern "C" DEBUGEXPORT void findclass(const char* class_name_pattern, int flags) {
+extern "C" NOINLINE void findclass(const char* class_name_pattern, int flags) {
   Command c("findclass");
   if (!c.onThread()) return;
   ClassPrinter::print_flags_help(tty);
   ClassPrinter::print_classes(class_name_pattern, flags, tty);
 }
 
-extern "C" DEBUGEXPORT void findmethod(const char* class_name_pattern,
-                                     const char* method_pattern, int flags) {
+extern "C" NOINLINE void findmethod(const char* class_name_pattern, const char* method_pattern, int flags) {
   Command c("findmethod");
   if (!c.onThread()) return;
   ClassPrinter::print_flags_help(tty);
@@ -607,7 +606,7 @@ extern "C" DEBUGEXPORT void findmethod(const char* class_name_pattern,
 }
 
 // Need method pointer to find bcp
-extern "C" DEBUGEXPORT void findbcp(intptr_t method, intptr_t bcp) {
+extern "C" NOINLINE void findbcp(intptr_t method, intptr_t bcp) {
   Command c("findbcp");
   Method* mh = (Method*)method;
   if (!mh->is_native()) {
@@ -618,7 +617,7 @@ extern "C" DEBUGEXPORT void findbcp(intptr_t method, intptr_t bcp) {
 }
 
 // check and decode a single u5 value
-extern "C" DEBUGEXPORT u4 u5decode(intptr_t addr) {
+extern "C" NOINLINE u4 u5decode(intptr_t addr) {
   Command c("u5decode");
   u1* arr = (u1*)addr;
   size_t off = 0, lim = 5;
@@ -635,9 +634,7 @@ extern "C" DEBUGEXPORT u4 u5decode(intptr_t addr) {
 // there is no limit on the count of items printed; the
 // printing stops when an null is printed or at limit.
 // See documentation for UNSIGNED5::Reader::print(count).
-extern "C" DEBUGEXPORT intptr_t u5p(intptr_t addr,
-                                  intptr_t limit,
-                                  int count) {
+extern "C" NOINLINE intptr_t u5p(intptr_t addr, intptr_t limit, int count) {
   Command c("u5p");
   u1* arr = (u1*)addr;
   if (limit && limit < addr)  limit = addr;
@@ -650,10 +647,10 @@ extern "C" DEBUGEXPORT intptr_t u5p(intptr_t addr,
 
 // int versions of all methods to avoid having to type type casts in the debugger
 
-void pp(intptr_t p)          { pp((void*)p); }
-void pp(oop p)               { pp((void*)p); }
+NOINLINE void pp(intptr_t p)          { pp((void*)p); }
+NOINLINE void pp(oop p)               { pp((void*)p); }
 
-extern "C" DEBUGEXPORT void help() {
+extern "C" NOINLINE void help() {
   Command c("help");
   tty->print_cr("basic");
   tty->print_cr("  pp(void* p)         - try to make sense of p");
@@ -709,7 +706,7 @@ extern "C" DEBUGEXPORT void help() {
 }
 
 #ifndef PRODUCT
-extern "C" DEBUGEXPORT void pns(void* sp, void* fp, void* pc) { // print native stack
+extern "C" NOINLINE void pns(void* sp, void* fp, void* pc) { // print native stack
   Command c("pns");
   if (!c.onThread()) return;
   static char buf[O_BUFLEN];
@@ -728,7 +725,7 @@ extern "C" DEBUGEXPORT void pns(void* sp, void* fp, void* pc) { // print native
 // WARNING: Only intended for use when debugging. Do not leave calls to
 // pns2() in committed source (product or debug).
 //
-extern "C" DEBUGEXPORT void pns2() { // print native stack
+extern "C" NOINLINE void pns2() { // print native stack
   Command c("pns2");
   if (!c.onThread()) return;
   static char buf[O_BUFLEN];
@@ -739,6 +736,43 @@ extern "C" DEBUGEXPORT void pns2() { // print native stack
 }
 #endif
 
+// just an exported helper; to avoid link time elimination of the referenced functions
+extern "C" JNIEXPORT void JVM_debug_helpers_keeper(void* p1, void* p2, void* p3, intptr_t ip, oop oh, address adr) {
+  blob((CodeBlob*)p1);
+  dump_vtable(adr);
+  nm(ip);
+  disnm(ip);
+  printnm(ip);
+  universe();
+  verify();
+  pp(p1);
+  ps();
+  pfl();
+  psf();
+  threads();
+  psd();
+  pss();
+  debug();
+  ndebug();
+  flush();
+  events();
+  findm(ip);
+  findnm(ip);
+  find(ip);
+  findpc(ip);
+  findclass("", 0);
+  findmethod("", "", 0);
+  findbcp(ip, ip);
+  u5decode(ip);
+  u5p(ip, ip, 0);
+  pp(ip);
+  pp(oh);
+  help();
+#ifndef PRODUCT
+  pns(p1, p2, p3);
+  pns2();
+#endif
+}
 
 // Returns true iff the address p is readable and *(intptr_t*)p != errvalue
 extern "C" bool dbg_is_safe(const void* p, intptr_t errvalue) {

From aea8947e9df84bf583ef658c5bf5f61ad87b73fa Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Erik=20=C3=96sterlund?= <eosterlund@openjdk.org>
Date: Thu, 26 Mar 2026 09:29:53 +0000
Subject: [PATCH 358/655] 8378176: Concurrent GC worker threads may suffer from
 priority inversion

Reviewed-by: kbarrett, ayang, tschatzl
---
 src/hotspot/share/gc/shared/concurrentGCThread.cpp | 3 +--
 src/hotspot/share/gc/shared/concurrentGCThread.hpp | 2 +-
 src/hotspot/share/gc/shared/workerThread.cpp       | 2 --
 3 files changed, 2 insertions(+), 5 deletions(-)

diff --git a/src/hotspot/share/gc/shared/concurrentGCThread.cpp b/src/hotspot/share/gc/shared/concurrentGCThread.cpp
index ed6c1b4d283..c7765631cd9 100644
--- a/src/hotspot/share/gc/shared/concurrentGCThread.cpp
+++ b/src/hotspot/share/gc/shared/concurrentGCThread.cpp
@@ -33,9 +33,8 @@ ConcurrentGCThread::ConcurrentGCThread() :
     _should_terminate(false),
     _has_terminated(false) {}
 
-void ConcurrentGCThread::create_and_start(ThreadPriority prio) {
+void ConcurrentGCThread::create_and_start() {
   if (os::create_thread(this, os::gc_thread)) {
-    os::set_priority(this, prio);
     os::start_thread(this);
   }
 }
diff --git a/src/hotspot/share/gc/shared/concurrentGCThread.hpp b/src/hotspot/share/gc/shared/concurrentGCThread.hpp
index 0c764546045..5322d676493 100644
--- a/src/hotspot/share/gc/shared/concurrentGCThread.hpp
+++ b/src/hotspot/share/gc/shared/concurrentGCThread.hpp
@@ -36,7 +36,7 @@ private:
   Atomic<bool> _has_terminated;
 
 protected:
-  void create_and_start(ThreadPriority prio = NearMaxPriority);
+  void create_and_start();
 
   virtual void run_service() = 0;
   virtual void stop_service() = 0;
diff --git a/src/hotspot/share/gc/shared/workerThread.cpp b/src/hotspot/share/gc/shared/workerThread.cpp
index 2f6f003608f..2738c98e5c3 100644
--- a/src/hotspot/share/gc/shared/workerThread.cpp
+++ b/src/hotspot/share/gc/shared/workerThread.cpp
@@ -210,8 +210,6 @@ WorkerThread::WorkerThread(const char* name_prefix, uint name_suffix, WorkerTask
 }
 
 void WorkerThread::run() {
-  os::set_priority(this, NearMaxPriority);
-
   while (true) {
     _dispatcher->worker_run_task();
   }

From ab659d4ee48b33a4bad21857b02f0a29314f2b43 Mon Sep 17 00:00:00 2001
From: Dusan Balek <dusan.balek@oracle.com>
Date: Thu, 26 Mar 2026 10:19:37 +0000
Subject: [PATCH 359/655] 8371817: javac with annotation processor throws
 AssertionError: Cannot add metadata to this type: METHOD when dealing with
 local classes

Reviewed-by: mcimadamore
---
 .../com/sun/tools/javac/jvm/ClassReader.java  |   9 +-
 .../classfile/LocalClassesTest.java           | 163 ++++++++++++++++++
 2 files changed, 168 insertions(+), 4 deletions(-)
 create mode 100644 test/langtools/tools/javac/annotations/typeAnnotations/classfile/LocalClassesTest.java

diff --git a/src/jdk.compiler/share/classes/com/sun/tools/javac/jvm/ClassReader.java b/src/jdk.compiler/share/classes/com/sun/tools/javac/jvm/ClassReader.java
index 017d740dc0a..08ba0442781 100644
--- a/src/jdk.compiler/share/classes/com/sun/tools/javac/jvm/ClassReader.java
+++ b/src/jdk.compiler/share/classes/com/sun/tools/javac/jvm/ClassReader.java
@@ -1367,9 +1367,7 @@ public class ClassReader {
         else
             self.fullname = ClassSymbol.formFullName(self.name, self.owner);
 
-        if (m != null) {
-            ((ClassType)sym.type).setEnclosingType(m.type);
-        } else if ((self.flags_field & STATIC) == 0) {
+        if ((self.flags_field & STATIC) == 0 && (m == null || (m.flags_field & STATIC) == 0)) {
             ((ClassType)sym.type).setEnclosingType(c.type);
         } else {
             ((ClassType)sym.type).setEnclosingType(Type.noType);
@@ -2687,6 +2685,7 @@ public class ClassReader {
             // won't pass the "hasOuterInstance" check above, but those that don't have an
             // enclosing method (i.e. from initializers) will pass that check.
             boolean local = forceLocal =
+                    currentOwner.owner.kind != TYP ||
                     !currentOwner.owner.members().includes(currentOwner, LookupKind.NON_RECURSIVE);
             if (!currentOwner.name.isEmpty() && !local)
                 type = new MethodType(adjustMethodParams(flags, type.getParameterTypes()),
@@ -3038,7 +3037,9 @@ public class ClassReader {
      *  `typevars'.
      */
     protected void enterTypevars(Symbol sym, Type t) {
-        if (t.getEnclosingType() != null) {
+        if (sym.owner.kind == MTH) {
+            enterTypevars(sym.owner, sym.owner.type);
+        } else if (t.getEnclosingType() != null) {
             if (!t.getEnclosingType().hasTag(TypeTag.NONE)) {
                 enterTypevars(sym.owner, t.getEnclosingType());
             }
diff --git a/test/langtools/tools/javac/annotations/typeAnnotations/classfile/LocalClassesTest.java b/test/langtools/tools/javac/annotations/typeAnnotations/classfile/LocalClassesTest.java
new file mode 100644
index 00000000000..66b55c8d209
--- /dev/null
+++ b/test/langtools/tools/javac/annotations/typeAnnotations/classfile/LocalClassesTest.java
@@ -0,0 +1,163 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+/*
+ * @test
+ * @bug 8371817
+ * @summary Check for type annotating types that refer to local classes read
+ *          from classfiles
+ * @library /tools/lib
+ * @modules
+ *      jdk.compiler/com.sun.tools.javac.api
+ *      jdk.compiler/com.sun.tools.javac.main
+ * @build toolbox.ToolBox toolbox.JavacTask
+ * @run junit LocalClassesTest
+ */
+
+import com.sun.source.tree.ClassTree;
+import com.sun.source.util.TaskEvent;
+import com.sun.source.util.TaskListener;
+import com.sun.source.util.TreePathScanner;
+import com.sun.source.util.Trees;
+import java.nio.file.Files;
+import java.nio.file.Path;
+import java.nio.file.Paths;
+import java.util.HashMap;
+import java.util.Map;
+import java.util.Set;
+import javax.annotation.processing.AbstractProcessor;
+import javax.annotation.processing.RoundEnvironment;
+import javax.annotation.processing.SupportedAnnotationTypes;
+import javax.lang.model.SourceVersion;
+import javax.lang.model.element.Element;
+import javax.lang.model.element.TypeElement;
+import javax.lang.model.type.DeclaredType;
+import javax.lang.model.type.TypeMirror;
+import javax.lang.model.util.ElementFilter;
+import org.junit.jupiter.api.Assertions;
+import org.junit.jupiter.api.BeforeEach;
+import org.junit.jupiter.api.Test;
+import org.junit.jupiter.api.TestInfo;
+import toolbox.JavacTask;
+import toolbox.ToolBox;
+
+public class LocalClassesTest {
+
+    ToolBox tb = new ToolBox();
+    Path base;
+
+    @Test
+    void test() throws Exception {
+        Path classes = base.resolve("classes");
+        Files.createDirectories(classes);
+
+        Map<String, String> local2enclosing = new HashMap<>();
+        new JavacTask(tb)
+                .options("-d", classes.toString())
+                .sources("""
+                         import java.lang.annotation.ElementType;
+                         import java.lang.annotation.Target;
+
+                         public class Test {
+                            public static void m1() {
+                               class Local1 {
+                                  @Nullable Local1 l;
+                               }
+                            }
+                            public void m2() {
+                               class Local2 {
+                                  @Nullable Local2 l;
+                               }
+                            }
+                         }
+
+                         @Target({ElementType.TYPE_USE})
+                         @interface Nullable {}
+                         """)
+                .callback(task -> {
+                    task.addTaskListener(new TaskListener() {
+                        @Override
+                        public void finished(TaskEvent e) {
+                            if (e.getKind() == TaskEvent.Kind.ANALYZE) {
+                                Trees trees = Trees.instance(task);
+                                new TreePathScanner<>() {
+                                    @Override
+                                    public Object visitClass(ClassTree node, Object p) {
+                                        if (node.getSimpleName().toString().startsWith("Local")) {
+                                            Element el = trees.getElement(getCurrentPath());
+                                            TypeMirror type = trees.getTypeMirror(getCurrentPath());
+                                            local2enclosing.put(el.getSimpleName().toString(), ((DeclaredType) type).getEnclosingType().toString());
+                                        }
+                                        return super.visitClass(node, p);
+                                    }
+                                }.scan(e.getCompilationUnit(), null);
+                            }
+                        }
+                    });
+                })
+                .run()
+                .writeAll();
+
+        Path classes2 = base.resolve("classes2");
+        Files.createDirectories(classes2);
+
+        ProcessorImpl p = new ProcessorImpl();
+        new JavacTask(tb)
+                .options("-cp", classes.toString(), "-d", classes2.toString())
+                .processors(p)
+                .classes("Test$1Local1", "Test$1Local2")
+                .run()
+                .writeAll();
+
+        Assertions.assertEquals(local2enclosing.get("Local1"), p.local2enclosing.get("Local1"));
+        Assertions.assertEquals(local2enclosing.get("Local2"), p.local2enclosing.get("Local2"));
+    }
+
+    @SupportedAnnotationTypes("*")
+    private static class ProcessorImpl extends AbstractProcessor {
+        private Map<String, String> local2enclosing = new HashMap<>();
+
+        @Override
+        public boolean process(Set<? extends TypeElement> annotations, RoundEnvironment roundEnv) {
+            for (TypeElement te : ElementFilter.typesIn(roundEnv.getRootElements())) {
+                if (te.getSimpleName().toString().startsWith("Local")) {
+                    local2enclosing.put(te.getSimpleName().toString(), ((DeclaredType) te.asType()).getEnclosingType().toString());
+                }
+            }
+            return false;
+        }
+
+        @Override
+        public SourceVersion getSupportedSourceVersion() {
+            return SourceVersion.latestSupported();
+        }
+    }
+
+    @BeforeEach
+    public void setup(TestInfo info) {
+        base = Paths.get(".")
+                    .resolve(info.getTestMethod()
+                                 .orElseThrow()
+                                 .getName());
+    }
+}

From da296cbea1603e8b1de46c9daafced76fce921e6 Mon Sep 17 00:00:00 2001
From: Thomas Stuefe <stuefe@openjdk.org>
Date: Thu, 26 Mar 2026 11:08:48 +0000
Subject: [PATCH 360/655] 8363996: Obsolete UseCompressedClassPointers

Reviewed-by: rkennke, kvn, adinn, dholmes, mdoerr, iklam, fyang
---
 src/hotspot/cpu/aarch64/aarch64.ad            |  12 +-
 .../cpu/aarch64/c1_LIRAssembler_aarch64.cpp   |  27 +-
 .../cpu/aarch64/c1_LIRGenerator_aarch64.cpp   |  10 +-
 .../cpu/aarch64/c1_MacroAssembler_aarch64.cpp |  12 +-
 .../cpu/aarch64/macroAssembler_aarch64.cpp    |  74 ++----
 src/hotspot/cpu/arm/matcher_arm.hpp           |   3 +-
 src/hotspot/cpu/ppc/c1_MacroAssembler_ppc.cpp |   4 +-
 src/hotspot/cpu/ppc/macroAssembler_ppc.cpp    |  65 ++---
 src/hotspot/cpu/ppc/matcher_ppc.hpp           |   1 -
 .../riscv/c1_LIRAssembler_arraycopy_riscv.cpp |  11 +-
 .../cpu/riscv/c1_LIRAssembler_riscv.cpp       |  24 +-
 .../cpu/riscv/c1_LIRGenerator_riscv.cpp       |  10 +-
 .../cpu/riscv/c1_MacroAssembler_riscv.cpp     |  12 +-
 .../cpu/riscv/c2_MacroAssembler_riscv.cpp     |  15 +-
 .../cpu/riscv/macroAssembler_riscv.cpp        |  34 +--
 src/hotspot/cpu/riscv/riscv.ad                |   9 +-
 src/hotspot/cpu/riscv/stubGenerator_riscv.cpp |   8 +-
 src/hotspot/cpu/s390/c1_LIRAssembler_s390.cpp |  15 +-
 .../cpu/s390/c1_MacroAssembler_s390.cpp       |   8 +-
 src/hotspot/cpu/s390/macroAssembler_s390.cpp  | 176 ++++++-------
 src/hotspot/cpu/s390/macroAssembler_s390.hpp  |   5 +-
 src/hotspot/cpu/s390/matcher_s390.hpp         |   3 +-
 src/hotspot/cpu/x86/c1_LIRAssembler_x86.cpp   |  39 +--
 src/hotspot/cpu/x86/c1_LIRGenerator_x86.cpp   |  10 +-
 src/hotspot/cpu/x86/c1_MacroAssembler_x86.cpp |   9 +-
 src/hotspot/cpu/x86/macroAssembler_x86.cpp    |  38 +--
 src/hotspot/cpu/x86/macroAssembler_x86.hpp    |   3 +-
 src/hotspot/cpu/x86/matcher_x86.hpp           |   3 +-
 src/hotspot/cpu/x86/x86.ad                    |   9 +-
 src/hotspot/share/cds/aotMapLogger.cpp        |   1 -
 src/hotspot/share/cds/aotMappedHeapLoader.hpp |   2 +-
 src/hotspot/share/cds/aotMappedHeapWriter.cpp |   2 -
 src/hotspot/share/cds/aotMetaspace.cpp        | 222 ++++++++---------
 .../share/cds/aotStreamedHeapWriter.cpp       |   1 -
 src/hotspot/share/cds/archiveBuilder.cpp      |   7 +-
 src/hotspot/share/cds/archiveBuilder.hpp      |   2 -
 src/hotspot/share/cds/archiveUtils.cpp        |   4 +-
 src/hotspot/share/cds/cdsConfig.cpp           |   4 -
 src/hotspot/share/cds/filemap.cpp             |  24 +-
 src/hotspot/share/cds/filemap.hpp             |   2 -
 .../classfile/systemDictionaryShared.cpp      |   4 +-
 src/hotspot/share/code/aotCodeCache.cpp       |   7 -
 src/hotspot/share/code/aotCodeCache.hpp       |  11 +-
 src/hotspot/share/code/compiledIC.cpp         |  15 +-
 .../share/gc/shared/c2/barrierSetC2.cpp       |   1 -
 src/hotspot/share/gc/shared/gcTrace.cpp       |   9 +-
 .../share/gc/shenandoah/shenandoahAsserts.cpp |  32 ++-
 src/hotspot/share/gc/z/c2/zBarrierSetC2.cpp   |   4 +-
 src/hotspot/share/gc/z/zDebug.gdb             |   6 +-
 .../types/traceid/jfrTraceIdKlassQueue.cpp    |   4 +-
 .../share/jvmci/jvmciCompilerToVMInit.cpp     |  10 +-
 src/hotspot/share/jvmci/vmStructs_jvmci.cpp   |   4 +-
 .../share/memory/classLoaderMetaspace.cpp     |   6 +-
 .../share/memory/classLoaderMetaspace.hpp     |  17 +-
 src/hotspot/share/memory/metaspace.cpp        | 233 +++++++++---------
 src/hotspot/share/memory/metaspace.hpp        |  10 +-
 .../memory/metaspace/metaspaceReporter.cpp    | 212 ++++++++--------
 .../memory/metaspace/metaspaceStatistics.cpp  |  30 ++-
 .../memory/metaspace/virtualSpaceNode.cpp     |  11 +-
 src/hotspot/share/nmt/memReporter.cpp         |  10 +-
 src/hotspot/share/oops/arrayOop.hpp           |   5 +-
 src/hotspot/share/oops/compressedKlass.cpp    |  33 ++-
 src/hotspot/share/oops/compressedKlass.hpp    |   8 -
 .../share/oops/compressedKlass.inline.hpp     |   4 +-
 src/hotspot/share/oops/instanceKlass.cpp      |   6 +-
 src/hotspot/share/oops/klass.cpp              |  12 +-
 src/hotspot/share/oops/objLayout.cpp          |  10 +-
 src/hotspot/share/oops/objLayout.hpp          |  10 +-
 src/hotspot/share/oops/objLayout.inline.hpp   |   4 +-
 src/hotspot/share/oops/oop.cpp                |   5 +-
 src/hotspot/share/oops/oop.hpp                |   9 +-
 src/hotspot/share/oops/oop.inline.hpp         |  33 +--
 src/hotspot/share/opto/cfgnode.cpp            |   2 +-
 src/hotspot/share/opto/chaitin.cpp            |   4 +-
 src/hotspot/share/opto/compile.cpp            |   8 +-
 src/hotspot/share/opto/lcm.cpp                |   5 +-
 src/hotspot/share/opto/memnode.cpp            |   4 +-
 src/hotspot/share/opto/narrowptrnode.cpp      |   4 +-
 src/hotspot/share/opto/type.cpp               |   2 +-
 src/hotspot/share/prims/whitebox.cpp          |   1 -
 src/hotspot/share/runtime/arguments.cpp       |  19 +-
 src/hotspot/share/runtime/globals.hpp         |   3 -
 src/hotspot/share/runtime/os.cpp              |   5 +-
 src/hotspot/share/runtime/vmStructs.cpp       |   3 +-
 src/hotspot/share/services/memoryService.cpp  |  12 +-
 src/hotspot/share/utilities/macros.hpp        |  14 +-
 src/hotspot/share/utilities/vmError.cpp       |  15 +-
 .../classes/sun/jvm/hotspot/oops/Array.java   |   6 +-
 .../sun/jvm/hotspot/oops/Instance.java        |   6 +-
 .../classes/sun/jvm/hotspot/oops/Oop.java     |  21 +-
 .../classes/sun/jvm/hotspot/runtime/VM.java   |  18 +-
 .../gtest/metaspace/test_is_metaspace_obj.cpp |   6 +-
 .../gtest/metaspace/test_metaspaceUtils.cpp   |  61 ++---
 test/hotspot/gtest/oops/test_arrayOop.cpp     |  20 +-
 .../gtest/oops/test_compressedKlass.cpp       |  30 ---
 test/hotspot/gtest/oops/test_objArrayOop.cpp  |  40 ++-
 .../arraycopy/TestObjectArrayClone.java       |   6 +-
 .../c1/TestArrayCopyToFromObject.java         |   5 +-
 .../c2/TestReduceAllocationAndLoadKlass.java  |  63 -----
 .../AllocationMergesTests.java                |  22 +-
 .../compilerToVM/GetResolvedJavaTypeTest.java |   3 +-
 .../jdk/vm/ci/code/test/DataPatchTest.java    |   4 +-
 .../vm/ci/code/test/TestHotSpotVMConfig.java  |   3 +-
 .../types/TestCheckCastPPBecomesTOP.java      |   3 -
 .../jtreg/compiler/unsafe/OpaqueAccesses.java |  18 +-
 .../arguments/TestCompressedClassFlags.java   |  53 ----
 .../gc/g1/TestSharedArchiveWithPreTouch.java  |   6 +-
 .../gc/metaspace/TestMetaspaceMemoryPool.java |  15 +-
 .../metaspace/TestMetaspacePerfCounters.java  |  37 +--
 .../TestPerfCountersAndMemoryPools.java       |   7 +-
 .../gc/metaspace/TestSizeTransitions.java     |  48 ++--
 test/hotspot/jtreg/gtest/ArrayTests.java      |  27 +-
 .../jtreg/gtest/CompressedKlassGtest.java     |  10 +-
 test/hotspot/jtreg/gtest/MetaspaceGtests.java |  11 +-
 test/hotspot/jtreg/gtest/ObjArrayTests.java   |  54 ++--
 .../CDSCompressedKPtrs.java                   |  66 -----
 .../CompressedClassPointers.java              |  22 +-
 .../CompressedClassSpaceSize.java             |   9 +-
 .../CompressedKlassPointerAndOops.java        |   6 +-
 .../TestVMConfigInHsErrFile.java              |  15 +-
 .../runtime/FieldLayout/BaseOffsets.java      |  42 +---
 .../runtime/FieldLayout/FieldDensityTest.java |   5 +-
 .../FieldLayout/TestOopMapSizeMinimal.java    |  53 ++--
 .../Metaspace/MaxMetaspaceSizeTest.java       |   3 +-
 .../runtime/Metaspace/PrintMetaspaceDcmd.java |  60 +----
 .../cds/appcds/CommandLineFlagCombo.java      |   4 +-
 .../appcds/CommandLineFlagComboNegative.java  |   8 +-
 .../cds/appcds/FillerObjectLoadTest.java      |  53 ----
 .../appcds/TestCombinedCompressedFlags.java   |  87 +------
 .../runtime/cds/appcds/TestZGCWithCDS.java    |  62 +----
 .../cds/appcds/aotCache/OldClassSupport2.java |   7 +-
 .../cacheObject/DifferentHeapSizes.java       |   4 +-
 .../dynamicArchive/CDSStreamTestDriver.java   |   4 +-
 .../DynamicArchiveTestBase.java               |   7 +-
 .../sharedStrings/IncompatibleOptions.java    |  16 +-
 .../dcmd/vm/ClassLoaderStatsTest.java         |  15 +-
 .../ir_framework/tests/TestIRMatching.java    |  19 --
 .../GetObjectSizeIntrinsicsTest.java          |   5 +-
 .../TestObjectAllocationInNewTLABEvent.java   |   9 +-
 .../TestObjectAllocationOutsideTLABEvent.java |   9 +-
 ...ObjectAllocationSampleEventThrottling.java |   9 +-
 .../TestHeapSummaryEventDefNewSerial.java     |  12 +-
 .../objectcount/ObjectCountEventVerifier.java |   4 +-
 ...CountAfterGCEventWithG1ConcurrentMark.java |   4 +-
 ...CountAfterGCEventWithG1FullCollection.java |   4 +-
 ...bjectCountAfterGCEventWithParallelOld.java |   4 +-
 ...TestObjectCountAfterGCEventWithSerial.java |   4 +-
 .../gc/objectcount/TestObjectCountEvent.java  |   4 +-
 test/jtreg-ext/requires/VMProps.java          |  11 +-
 149 files changed, 952 insertions(+), 2093 deletions(-)
 delete mode 100644 test/hotspot/jtreg/compiler/c2/TestReduceAllocationAndLoadKlass.java
 delete mode 100644 test/hotspot/jtreg/gc/arguments/TestCompressedClassFlags.java
 delete mode 100644 test/hotspot/jtreg/runtime/CDSCompressedKPtrs/CDSCompressedKPtrs.java
 delete mode 100644 test/hotspot/jtreg/runtime/cds/appcds/FillerObjectLoadTest.java

diff --git a/src/hotspot/cpu/aarch64/aarch64.ad b/src/hotspot/cpu/aarch64/aarch64.ad
index b79030f07e7..05b2514a456 100644
--- a/src/hotspot/cpu/aarch64/aarch64.ad
+++ b/src/hotspot/cpu/aarch64/aarch64.ad
@@ -2233,15 +2233,9 @@ uint BoxLockNode::size(PhaseRegAlloc *ra_) const {
 void MachUEPNode::format(PhaseRegAlloc* ra_, outputStream* st) const
 {
   st->print_cr("# MachUEPNode");
-  if (UseCompressedClassPointers) {
-    st->print_cr("\tldrw rscratch1, [j_rarg0 + oopDesc::klass_offset_in_bytes()]\t# compressed klass");
-    st->print_cr("\tldrw r10, [rscratch2 + CompiledICData::speculated_klass_offset()]\t# compressed klass");
-    st->print_cr("\tcmpw rscratch1, r10");
-  } else {
-    st->print_cr("\tldr rscratch1, [j_rarg0 + oopDesc::klass_offset_in_bytes()]\t# compressed klass");
-    st->print_cr("\tldr r10, [rscratch2 + CompiledICData::speculated_klass_offset()]\t# compressed klass");
-    st->print_cr("\tcmp rscratch1, r10");
-  }
+  st->print_cr("\tldrw rscratch1, [j_rarg0 + oopDesc::klass_offset_in_bytes()]\t# compressed klass");
+  st->print_cr("\tldrw r10, [rscratch2 + CompiledICData::speculated_klass_offset()]\t# compressed klass");
+  st->print_cr("\tcmpw rscratch1, r10");
   st->print_cr("\tbne, SharedRuntime::_ic_miss_stub");
 }
 #endif
diff --git a/src/hotspot/cpu/aarch64/c1_LIRAssembler_aarch64.cpp b/src/hotspot/cpu/aarch64/c1_LIRAssembler_aarch64.cpp
index 30048a2079d..e7d8c2d3648 100644
--- a/src/hotspot/cpu/aarch64/c1_LIRAssembler_aarch64.cpp
+++ b/src/hotspot/cpu/aarch64/c1_LIRAssembler_aarch64.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2000, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2000, 2026, Oracle and/or its affiliates. All rights reserved.
  * Copyright (c) 2014, 2020, Red Hat Inc. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
@@ -59,22 +59,6 @@ const Register SHIFT_count = r0;   // where count for shift operations must be
 #define __ _masm->
 
 
-static void select_different_registers(Register preserve,
-                                       Register extra,
-                                       Register &tmp1,
-                                       Register &tmp2) {
-  if (tmp1 == preserve) {
-    assert_different_registers(tmp1, tmp2, extra);
-    tmp1 = extra;
-  } else if (tmp2 == preserve) {
-    assert_different_registers(tmp1, tmp2, extra);
-    tmp2 = extra;
-  }
-  assert_different_registers(preserve, tmp1, tmp2);
-}
-
-
-
 static void select_different_registers(Register preserve,
                                        Register extra,
                                        Register &tmp1,
@@ -1269,12 +1253,9 @@ void LIR_Assembler::emit_typecheck_helper(LIR_OpTypeCheck *op, Label* success, L
   } else if (obj == klass_RInfo) {
     klass_RInfo = dst;
   }
-  if (k->is_loaded() && !UseCompressedClassPointers) {
-    select_different_registers(obj, dst, k_RInfo, klass_RInfo);
-  } else {
-    Rtmp1 = op->tmp3()->as_register();
-    select_different_registers(obj, dst, k_RInfo, klass_RInfo, Rtmp1);
-  }
+
+  Rtmp1 = op->tmp3()->as_register();
+  select_different_registers(obj, dst, k_RInfo, klass_RInfo, Rtmp1);
 
   assert_different_registers(obj, k_RInfo, klass_RInfo);
 
diff --git a/src/hotspot/cpu/aarch64/c1_LIRGenerator_aarch64.cpp b/src/hotspot/cpu/aarch64/c1_LIRGenerator_aarch64.cpp
index ad26d494b2d..f10c5197d91 100644
--- a/src/hotspot/cpu/aarch64/c1_LIRGenerator_aarch64.cpp
+++ b/src/hotspot/cpu/aarch64/c1_LIRGenerator_aarch64.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2005, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2005, 2026, Oracle and/or its affiliates. All rights reserved.
  * Copyright (c) 2014, Red Hat Inc. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
@@ -1287,9 +1287,7 @@ void LIRGenerator::do_CheckCast(CheckCast* x) {
   }
   LIR_Opr reg = rlock_result(x);
   LIR_Opr tmp3 = LIR_OprFact::illegalOpr;
-  if (!x->klass()->is_loaded() || UseCompressedClassPointers) {
-    tmp3 = new_register(objectType);
-  }
+  tmp3 = new_register(objectType);
   __ checkcast(reg, obj.result(), x->klass(),
                new_register(objectType), new_register(objectType), tmp3,
                x->direct_compare(), info_for_exception, patching_info, stub,
@@ -1308,9 +1306,7 @@ void LIRGenerator::do_InstanceOf(InstanceOf* x) {
   }
   obj.load_item();
   LIR_Opr tmp3 = LIR_OprFact::illegalOpr;
-  if (!x->klass()->is_loaded() || UseCompressedClassPointers) {
-    tmp3 = new_register(objectType);
-  }
+  tmp3 = new_register(objectType);
   __ instanceof(reg, obj.result(), x->klass(),
                 new_register(objectType), new_register(objectType), tmp3,
                 x->direct_compare(), patching_info, x->profiled_method(), x->profiled_bci());
diff --git a/src/hotspot/cpu/aarch64/c1_MacroAssembler_aarch64.cpp b/src/hotspot/cpu/aarch64/c1_MacroAssembler_aarch64.cpp
index e934632715c..89a9422ea48 100644
--- a/src/hotspot/cpu/aarch64/c1_MacroAssembler_aarch64.cpp
+++ b/src/hotspot/cpu/aarch64/c1_MacroAssembler_aarch64.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1999, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1999, 2026, Oracle and/or its affiliates. All rights reserved.
  * Copyright (c) 2014, 2021, Red Hat Inc. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
@@ -105,12 +105,8 @@ void C1_MacroAssembler::initialize_header(Register obj, Register klass, Register
   } else {
     mov(t1, checked_cast<int32_t>(markWord::prototype().value()));
     str(t1, Address(obj, oopDesc::mark_offset_in_bytes()));
-    if (UseCompressedClassPointers) { // Take care not to kill klass
-      encode_klass_not_null(t1, klass);
-      strw(t1, Address(obj, oopDesc::klass_offset_in_bytes()));
-    } else {
-      str(klass, Address(obj, oopDesc::klass_offset_in_bytes()));
-    }
+    encode_klass_not_null(t1, klass); // Take care not to kill klass
+    strw(t1, Address(obj, oopDesc::klass_offset_in_bytes()));
   }
 
   if (len->is_valid()) {
@@ -121,7 +117,7 @@ void C1_MacroAssembler::initialize_header(Register obj, Register klass, Register
       // Clear gap/first 4 bytes following the length field.
       strw(zr, Address(obj, base_offset));
     }
-  } else if (UseCompressedClassPointers && !UseCompactObjectHeaders) {
+  } else if (!UseCompactObjectHeaders) {
     store_klass_gap(obj, zr);
   }
 }
diff --git a/src/hotspot/cpu/aarch64/macroAssembler_aarch64.cpp b/src/hotspot/cpu/aarch64/macroAssembler_aarch64.cpp
index 3e3e95be07e..732d94180ae 100644
--- a/src/hotspot/cpu/aarch64/macroAssembler_aarch64.cpp
+++ b/src/hotspot/cpu/aarch64/macroAssembler_aarch64.cpp
@@ -762,7 +762,7 @@ void MacroAssembler::call_VM_base(Register oop_result,
   assert(java_thread == rthread, "unexpected register");
 #ifdef ASSERT
   // TraceBytecodes does not use r12 but saves it over the call, so don't verify
-  // if ((UseCompressedOops || UseCompressedClassPointers) && !TraceBytecodes) verify_heapbase("call_VM_base: heap base corrupted?");
+  // if (!TraceBytecodes) verify_heapbase("call_VM_base: heap base corrupted?");
 #endif // ASSERT
 
   assert(java_thread != oop_result  , "cannot use the same register for java_thread & oop_result");
@@ -1002,14 +1002,10 @@ int MacroAssembler::ic_check(int end_alignment) {
     load_narrow_klass_compact(tmp1, receiver);
     ldrw(tmp2, Address(data, CompiledICData::speculated_klass_offset()));
     cmpw(tmp1, tmp2);
-  } else if (UseCompressedClassPointers) {
+  } else {
     ldrw(tmp1, Address(receiver, oopDesc::klass_offset_in_bytes()));
     ldrw(tmp2, Address(data, CompiledICData::speculated_klass_offset()));
     cmpw(tmp1, tmp2);
-  } else {
-    ldr(tmp1, Address(receiver, oopDesc::klass_offset_in_bytes()));
-    ldr(tmp2, Address(data, CompiledICData::speculated_klass_offset()));
-    cmp(tmp1, tmp2);
   }
 
   Label dont;
@@ -3278,7 +3274,6 @@ int MacroAssembler::pop_p(unsigned int bitset, Register stack) {
 #ifdef ASSERT
 void MacroAssembler::verify_heapbase(const char* msg) {
 #if 0
-  assert (UseCompressedOops || UseCompressedClassPointers, "should be compressed");
   assert (Universe::heap() != nullptr, "java heap should be initialized");
   if (!UseCompressedOops || Universe::ptr_base() == nullptr) {
     // rheapbase is allocated as general register
@@ -5067,13 +5062,10 @@ void MacroAssembler::load_narrow_klass_compact(Register dst, Register src) {
 void MacroAssembler::load_klass(Register dst, Register src) {
   if (UseCompactObjectHeaders) {
     load_narrow_klass_compact(dst, src);
-    decode_klass_not_null(dst);
-  } else if (UseCompressedClassPointers) {
-    ldrw(dst, Address(src, oopDesc::klass_offset_in_bytes()));
-    decode_klass_not_null(dst);
   } else {
-    ldr(dst, Address(src, oopDesc::klass_offset_in_bytes()));
+    ldrw(dst, Address(src, oopDesc::klass_offset_in_bytes()));
   }
+  decode_klass_not_null(dst);
 }
 
 void MacroAssembler::restore_cpu_control_state_after_jni(Register tmp1, Register tmp2) {
@@ -5125,25 +5117,21 @@ void MacroAssembler::load_mirror(Register dst, Register method, Register tmp1, R
 
 void MacroAssembler::cmp_klass(Register obj, Register klass, Register tmp) {
   assert_different_registers(obj, klass, tmp);
-  if (UseCompressedClassPointers) {
-    if (UseCompactObjectHeaders) {
-      load_narrow_klass_compact(tmp, obj);
-    } else {
-      ldrw(tmp, Address(obj, oopDesc::klass_offset_in_bytes()));
-    }
-    if (CompressedKlassPointers::base() == nullptr) {
-      cmp(klass, tmp, LSL, CompressedKlassPointers::shift());
-      return;
-    } else if (((uint64_t)CompressedKlassPointers::base() & 0xffffffff) == 0
-               && CompressedKlassPointers::shift() == 0) {
-      // Only the bottom 32 bits matter
-      cmpw(klass, tmp);
-      return;
-    }
-    decode_klass_not_null(tmp);
+  if (UseCompactObjectHeaders) {
+    load_narrow_klass_compact(tmp, obj);
   } else {
-    ldr(tmp, Address(obj, oopDesc::klass_offset_in_bytes()));
+    ldrw(tmp, Address(obj, oopDesc::klass_offset_in_bytes()));
   }
+  if (CompressedKlassPointers::base() == nullptr) {
+    cmp(klass, tmp, LSL, CompressedKlassPointers::shift());
+    return;
+  } else if (((uint64_t)CompressedKlassPointers::base() & 0xffffffff) == 0
+             && CompressedKlassPointers::shift() == 0) {
+    // Only the bottom 32 bits matter
+    cmpw(klass, tmp);
+    return;
+  }
+  decode_klass_not_null(tmp);
   cmp(klass, tmp);
 }
 
@@ -5151,36 +5139,25 @@ void MacroAssembler::cmp_klasses_from_objects(Register obj1, Register obj2, Regi
   if (UseCompactObjectHeaders) {
     load_narrow_klass_compact(tmp1, obj1);
     load_narrow_klass_compact(tmp2,  obj2);
-    cmpw(tmp1, tmp2);
-  } else if (UseCompressedClassPointers) {
+  } else {
     ldrw(tmp1, Address(obj1, oopDesc::klass_offset_in_bytes()));
     ldrw(tmp2, Address(obj2, oopDesc::klass_offset_in_bytes()));
-    cmpw(tmp1, tmp2);
-  } else {
-    ldr(tmp1, Address(obj1, oopDesc::klass_offset_in_bytes()));
-    ldr(tmp2, Address(obj2, oopDesc::klass_offset_in_bytes()));
-    cmp(tmp1, tmp2);
   }
+  cmpw(tmp1, tmp2);
 }
 
 void MacroAssembler::store_klass(Register dst, Register src) {
   // FIXME: Should this be a store release?  concurrent gcs assumes
   // klass length is valid if klass field is not null.
   assert(!UseCompactObjectHeaders, "not with compact headers");
-  if (UseCompressedClassPointers) {
-    encode_klass_not_null(src);
-    strw(src, Address(dst, oopDesc::klass_offset_in_bytes()));
-  } else {
-    str(src, Address(dst, oopDesc::klass_offset_in_bytes()));
-  }
+  encode_klass_not_null(src);
+  strw(src, Address(dst, oopDesc::klass_offset_in_bytes()));
 }
 
 void MacroAssembler::store_klass_gap(Register dst, Register src) {
   assert(!UseCompactObjectHeaders, "not with compact headers");
-  if (UseCompressedClassPointers) {
-    // Store to klass gap in destination
-    strw(src, Address(dst, oopDesc::klass_gap_offset_in_bytes()));
-  }
+  // Store to klass gap in destination
+  strw(src, Address(dst, oopDesc::klass_gap_offset_in_bytes()));
 }
 
 // Algorithm must match CompressedOops::encode.
@@ -5326,8 +5303,6 @@ MacroAssembler::KlassDecodeMode MacroAssembler::klass_decode_mode() {
 }
 
 MacroAssembler::KlassDecodeMode  MacroAssembler::klass_decode_mode(address base, int shift, const size_t range) {
-  assert(UseCompressedClassPointers, "not using compressed class pointers");
-
   // KlassDecodeMode shouldn't be set already.
   assert(_klass_decode_mode == KlassDecodeNone, "set once");
 
@@ -5457,8 +5432,6 @@ void MacroAssembler::decode_klass_not_null_for_aot(Register dst, Register src) {
 }
 
 void  MacroAssembler::decode_klass_not_null(Register dst, Register src) {
-  assert (UseCompressedClassPointers, "should only be used for compressed headers");
-
   if (AOTCodeCache::is_on_for_dump()) {
     decode_klass_not_null_for_aot(dst, src);
     return;
@@ -5525,7 +5498,6 @@ void  MacroAssembler::set_narrow_oop(Register dst, jobject obj) {
 }
 
 void  MacroAssembler::set_narrow_klass(Register dst, Klass* k) {
-  assert (UseCompressedClassPointers, "should only be used for compressed headers");
   assert (oop_recorder() != nullptr, "this assembler needs an OopRecorder");
   int index = oop_recorder()->find_index(k);
 
diff --git a/src/hotspot/cpu/arm/matcher_arm.hpp b/src/hotspot/cpu/arm/matcher_arm.hpp
index 6c818e1f20d..7978a5b7090 100644
--- a/src/hotspot/cpu/arm/matcher_arm.hpp
+++ b/src/hotspot/cpu/arm/matcher_arm.hpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2021, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2021, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -75,7 +75,6 @@
 
   static bool narrow_klass_use_complex_address() {
     NOT_LP64(ShouldNotCallThis());
-    assert(UseCompressedClassPointers, "only for compressed klass code");
     return false;
   }
 
diff --git a/src/hotspot/cpu/ppc/c1_MacroAssembler_ppc.cpp b/src/hotspot/cpu/ppc/c1_MacroAssembler_ppc.cpp
index 798451446e5..4d7af0e4a71 100644
--- a/src/hotspot/cpu/ppc/c1_MacroAssembler_ppc.cpp
+++ b/src/hotspot/cpu/ppc/c1_MacroAssembler_ppc.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1999, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1999, 2026, Oracle and/or its affiliates. All rights reserved.
  * Copyright (c) 2012, 2025 SAP SE. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
@@ -144,7 +144,7 @@ void C1_MacroAssembler::initialize_header(Register obj, Register klass, Register
 
   if (len->is_valid()) {
     stw(len, arrayOopDesc::length_offset_in_bytes(), obj);
-  } else if (UseCompressedClassPointers && !UseCompactObjectHeaders) {
+  } else if (!UseCompactObjectHeaders) {
     // Otherwise length is in the class gap.
     store_klass_gap(obj);
   }
diff --git a/src/hotspot/cpu/ppc/macroAssembler_ppc.cpp b/src/hotspot/cpu/ppc/macroAssembler_ppc.cpp
index 14e90ddf185..5fbcce94029 100644
--- a/src/hotspot/cpu/ppc/macroAssembler_ppc.cpp
+++ b/src/hotspot/cpu/ppc/macroAssembler_ppc.cpp
@@ -3201,23 +3201,17 @@ Register MacroAssembler::encode_klass_not_null(Register dst, Register src) {
 
 void MacroAssembler::store_klass(Register dst_oop, Register klass, Register ck) {
   assert(!UseCompactObjectHeaders, "not with compact headers");
-  if (UseCompressedClassPointers) {
-    Register compressedKlass = encode_klass_not_null(ck, klass);
-    stw(compressedKlass, oopDesc::klass_offset_in_bytes(), dst_oop);
-  } else {
-    std(klass, oopDesc::klass_offset_in_bytes(), dst_oop);
-  }
+  Register compressedKlass = encode_klass_not_null(ck, klass);
+  stw(compressedKlass, oopDesc::klass_offset_in_bytes(), dst_oop);
 }
 
 void MacroAssembler::store_klass_gap(Register dst_oop, Register val) {
   assert(!UseCompactObjectHeaders, "not with compact headers");
-  if (UseCompressedClassPointers) {
-    if (val == noreg) {
-      val = R0;
-      li(val, 0);
-    }
-    stw(val, oopDesc::klass_gap_offset_in_bytes(), dst_oop);
+  if (val == noreg) {
+    val = R0;
+    li(val, 0);
   }
+  stw(val, oopDesc::klass_gap_offset_in_bytes(), dst_oop);
 }
 
 int MacroAssembler::instr_size_for_decode_klass_not_null() {
@@ -3226,17 +3220,13 @@ int MacroAssembler::instr_size_for_decode_klass_not_null() {
   // Not yet computed?
   if (computed_size == -1) {
 
-    if (!UseCompressedClassPointers) {
-      computed_size = 0;
-    } else {
-      // Determine by scratch emit.
-      ResourceMark rm;
-      int code_size = 8 * BytesPerInstWord;
-      CodeBuffer cb("decode_klass_not_null scratch buffer", code_size, 0);
-      MacroAssembler* a = new MacroAssembler(&cb);
-      a->decode_klass_not_null(R11_scratch1);
-      computed_size = a->offset();
-    }
+    // Determine by scratch emit.
+    ResourceMark rm;
+    int code_size = 8 * BytesPerInstWord;
+    CodeBuffer cb("decode_klass_not_null scratch buffer", code_size, 0);
+    MacroAssembler* a = new MacroAssembler(&cb);
+    a->decode_klass_not_null(R11_scratch1);
+    computed_size = a->offset();
   }
 
   return computed_size;
@@ -3259,18 +3249,14 @@ void MacroAssembler::decode_klass_not_null(Register dst, Register src) {
 void MacroAssembler::load_klass_no_decode(Register dst, Register src) {
   if (UseCompactObjectHeaders) {
     load_narrow_klass_compact(dst, src);
-  } else if (UseCompressedClassPointers) {
-    lwz(dst, oopDesc::klass_offset_in_bytes(), src);
   } else {
-    ld(dst, oopDesc::klass_offset_in_bytes(), src);
+    lwz(dst, oopDesc::klass_offset_in_bytes(), src);
   }
 }
 
 void MacroAssembler::load_klass(Register dst, Register src) {
   load_klass_no_decode(dst, src);
-  if (UseCompressedClassPointers) { // also true for UseCompactObjectHeaders
-    decode_klass_not_null(dst);
-  }
+  decode_klass_not_null(dst);
 }
 
 // Loads the obj's Klass* into dst.
@@ -3286,18 +3272,13 @@ void MacroAssembler::load_narrow_klass_compact(Register dst, Register src) {
 
 void MacroAssembler::cmp_klass(ConditionRegister dst, Register obj, Register klass, Register tmp, Register tmp2) {
   assert_different_registers(obj, klass, tmp);
-  if (UseCompressedClassPointers) {
-    if (UseCompactObjectHeaders) {
-      load_narrow_klass_compact(tmp, obj);
-    } else {
-      lwz(tmp, oopDesc::klass_offset_in_bytes(), obj);
-    }
-    Register encoded_klass = encode_klass_not_null(tmp2, klass);
-    cmpw(dst, tmp, encoded_klass);
+  if (UseCompactObjectHeaders) {
+    load_narrow_klass_compact(tmp, obj);
   } else {
-    ld(tmp, oopDesc::klass_offset_in_bytes(), obj);
-    cmpd(dst, tmp, klass);
+    lwz(tmp, oopDesc::klass_offset_in_bytes(), obj);
   }
+  Register encoded_klass = encode_klass_not_null(tmp2, klass);
+  cmpw(dst, tmp, encoded_klass);
 }
 
 void MacroAssembler::cmp_klasses_from_objects(ConditionRegister dst, Register obj1, Register obj2, Register tmp1, Register tmp2) {
@@ -3305,14 +3286,10 @@ void MacroAssembler::cmp_klasses_from_objects(ConditionRegister dst, Register ob
     load_narrow_klass_compact(tmp1, obj1);
     load_narrow_klass_compact(tmp2, obj2);
     cmpw(dst, tmp1, tmp2);
-  } else if (UseCompressedClassPointers) {
+  } else {
     lwz(tmp1, oopDesc::klass_offset_in_bytes(), obj1);
     lwz(tmp2, oopDesc::klass_offset_in_bytes(), obj2);
     cmpw(dst, tmp1, tmp2);
-  } else {
-    ld(tmp1, oopDesc::klass_offset_in_bytes(), obj1);
-    ld(tmp2, oopDesc::klass_offset_in_bytes(), obj2);
-    cmpd(dst, tmp1, tmp2);
   }
 }
 
diff --git a/src/hotspot/cpu/ppc/matcher_ppc.hpp b/src/hotspot/cpu/ppc/matcher_ppc.hpp
index 2ddbec3e48c..cbe882648b8 100644
--- a/src/hotspot/cpu/ppc/matcher_ppc.hpp
+++ b/src/hotspot/cpu/ppc/matcher_ppc.hpp
@@ -87,7 +87,6 @@
 
   static bool narrow_klass_use_complex_address() {
     NOT_LP64(ShouldNotCallThis());
-    assert(UseCompressedClassPointers, "only for compressed klass code");
     // TODO: PPC port if (MatchDecodeNodes) return true;
     return false;
   }
diff --git a/src/hotspot/cpu/riscv/c1_LIRAssembler_arraycopy_riscv.cpp b/src/hotspot/cpu/riscv/c1_LIRAssembler_arraycopy_riscv.cpp
index 819d6c05654..58eb1a55553 100644
--- a/src/hotspot/cpu/riscv/c1_LIRAssembler_arraycopy_riscv.cpp
+++ b/src/hotspot/cpu/riscv/c1_LIRAssembler_arraycopy_riscv.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2000, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2000, 2026, Oracle and/or its affiliates. All rights reserved.
  * Copyright (c) 2020, 2022, Huawei Technologies Co., Ltd. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
@@ -196,12 +196,9 @@ void LIR_Assembler::arraycopy_type_check(Register src, Register src_pos, Registe
     if (UseCompactObjectHeaders) {
       __ load_narrow_klass_compact(tmp, src);
       __ load_narrow_klass_compact(t0, dst);
-    } else if (UseCompressedClassPointers) {
+    } else {
       __ lwu(tmp, Address(src, oopDesc::klass_offset_in_bytes()));
       __ lwu(t0, Address(dst, oopDesc::klass_offset_in_bytes()));
-    } else {
-      __ ld(tmp, Address(src, oopDesc::klass_offset_in_bytes()));
-      __ ld(t0, Address(dst, oopDesc::klass_offset_in_bytes()));
     }
     __ bne(tmp, t0, *stub->entry(), /* is_far */ true);
   } else {
@@ -257,9 +254,7 @@ void LIR_Assembler::arraycopy_assert(Register src, Register dst, Register tmp, c
     // but not necessarily exactly of type default_type.
     Label known_ok, halt;
     __ mov_metadata(tmp, default_type->constant_encoding());
-    if (UseCompressedClassPointers) {
-      __ encode_klass_not_null(tmp);
-    }
+    __ encode_klass_not_null(tmp);
 
     if (basic_type != T_OBJECT) {
       __ cmp_klass_compressed(dst, tmp, t0, halt, false);
diff --git a/src/hotspot/cpu/riscv/c1_LIRAssembler_riscv.cpp b/src/hotspot/cpu/riscv/c1_LIRAssembler_riscv.cpp
index 63e2fd015d7..29e5d86d0cc 100644
--- a/src/hotspot/cpu/riscv/c1_LIRAssembler_riscv.cpp
+++ b/src/hotspot/cpu/riscv/c1_LIRAssembler_riscv.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2000, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2000, 2026, Oracle and/or its affiliates. All rights reserved.
  * Copyright (c) 2014, 2020, Red Hat Inc. All rights reserved.
  * Copyright (c) 2020, 2023, Huawei Technologies Co., Ltd. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
@@ -55,20 +55,6 @@ const Register SHIFT_count = x10;   // where count for shift operations must be
 
 #define __ _masm->
 
-static void select_different_registers(Register preserve,
-                                       Register extra,
-                                       Register &tmp1,
-                                       Register &tmp2) {
-  if (tmp1 == preserve) {
-    assert_different_registers(tmp1, tmp2, extra);
-    tmp1 = extra;
-  } else if (tmp2 == preserve) {
-    assert_different_registers(tmp1, tmp2, extra);
-    tmp2 = extra;
-  }
-  assert_different_registers(preserve, tmp1, tmp2);
-}
-
 static void select_different_registers(Register preserve,
                                        Register extra,
                                        Register &tmp1,
@@ -1155,12 +1141,8 @@ void LIR_Assembler::emit_typecheck_helper(LIR_OpTypeCheck *op, Label* success, L
   } else if (obj == klass_RInfo) {
     klass_RInfo = dst;
   }
-  if (k->is_loaded() && !UseCompressedClassPointers) {
-    select_different_registers(obj, dst, k_RInfo, klass_RInfo);
-  } else {
-    Rtmp1 = op->tmp3()->as_register();
-    select_different_registers(obj, dst, k_RInfo, klass_RInfo, Rtmp1);
-  }
+  Rtmp1 = op->tmp3()->as_register();
+  select_different_registers(obj, dst, k_RInfo, klass_RInfo, Rtmp1);
 
   assert_different_registers(obj, k_RInfo, klass_RInfo);
 
diff --git a/src/hotspot/cpu/riscv/c1_LIRGenerator_riscv.cpp b/src/hotspot/cpu/riscv/c1_LIRGenerator_riscv.cpp
index 88565d9136f..f290708a231 100644
--- a/src/hotspot/cpu/riscv/c1_LIRGenerator_riscv.cpp
+++ b/src/hotspot/cpu/riscv/c1_LIRGenerator_riscv.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2005, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2005, 2026, Oracle and/or its affiliates. All rights reserved.
  * Copyright (c) 2014, Red Hat Inc. All rights reserved.
  * Copyright (c) 2020, 2022, Huawei Technologies Co., Ltd. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
@@ -1073,9 +1073,7 @@ void LIRGenerator::do_CheckCast(CheckCast* x) {
   }
   LIR_Opr reg = rlock_result(x);
   LIR_Opr tmp3 = LIR_OprFact::illegalOpr;
-  if (!x->klass()->is_loaded() || UseCompressedClassPointers) {
-    tmp3 = new_register(objectType);
-  }
+  tmp3 = new_register(objectType);
   __ checkcast(reg, obj.result(), x->klass(),
                new_register(objectType), new_register(objectType), tmp3,
                x->direct_compare(), info_for_exception, patching_info, stub,
@@ -1094,9 +1092,7 @@ void LIRGenerator::do_InstanceOf(InstanceOf* x) {
   }
   obj.load_item();
   LIR_Opr tmp3 = LIR_OprFact::illegalOpr;
-  if (!x->klass()->is_loaded() || UseCompressedClassPointers) {
-    tmp3 = new_register(objectType);
-  }
+  tmp3 = new_register(objectType);
   __ instanceof(reg, obj.result(), x->klass(),
                 new_register(objectType), new_register(objectType), tmp3,
                 x->direct_compare(), patching_info, x->profiled_method(), x->profiled_bci());
diff --git a/src/hotspot/cpu/riscv/c1_MacroAssembler_riscv.cpp b/src/hotspot/cpu/riscv/c1_MacroAssembler_riscv.cpp
index aeb077ba0a0..abcc070b253 100644
--- a/src/hotspot/cpu/riscv/c1_MacroAssembler_riscv.cpp
+++ b/src/hotspot/cpu/riscv/c1_MacroAssembler_riscv.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1999, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1999, 2026, Oracle and/or its affiliates. All rights reserved.
  * Copyright (c) 2014, Red Hat Inc. All rights reserved.
  * Copyright (c) 2020, 2022, Huawei Technologies Co., Ltd. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
@@ -92,12 +92,8 @@ void C1_MacroAssembler::initialize_header(Register obj, Register klass, Register
     // This assumes that all prototype bits fitr in an int32_t
     mv(tmp1, checked_cast<int32_t>(markWord::prototype().value()));
     sd(tmp1, Address(obj, oopDesc::mark_offset_in_bytes()));
-    if (UseCompressedClassPointers) { // Take care not to kill klass
-      encode_klass_not_null(tmp1, klass, tmp2);
-      sw(tmp1, Address(obj, oopDesc::klass_offset_in_bytes()));
-    } else {
-      sd(klass, Address(obj, oopDesc::klass_offset_in_bytes()));
-    }
+    encode_klass_not_null(tmp1, klass, tmp2);
+    sw(tmp1, Address(obj, oopDesc::klass_offset_in_bytes()));
   }
 
   if (len->is_valid()) {
@@ -108,7 +104,7 @@ void C1_MacroAssembler::initialize_header(Register obj, Register klass, Register
       // Clear gap/first 4 bytes following the length field.
       sw(zr, Address(obj, base_offset));
     }
-  } else if (UseCompressedClassPointers && !UseCompactObjectHeaders) {
+  } else if (!UseCompactObjectHeaders) {
     store_klass_gap(obj, zr);
   }
 }
diff --git a/src/hotspot/cpu/riscv/c2_MacroAssembler_riscv.cpp b/src/hotspot/cpu/riscv/c2_MacroAssembler_riscv.cpp
index 72a90ddde1f..0d06fd469de 100644
--- a/src/hotspot/cpu/riscv/c2_MacroAssembler_riscv.cpp
+++ b/src/hotspot/cpu/riscv/c2_MacroAssembler_riscv.cpp
@@ -1175,8 +1175,7 @@ void C2_MacroAssembler::string_compare_long_same_encoding(Register result, Regis
   Label TAIL_CHECK, TAIL, NEXT_WORD, DIFFERENCE;
 
   const int base_offset = arrayOopDesc::base_offset_in_bytes(T_BYTE);
-  assert((base_offset % (UseCompactObjectHeaders ? 4 :
-                        (UseCompressedClassPointers ? 8 : 4))) == 0, "Must be");
+  assert((base_offset % (UseCompactObjectHeaders ? 4 : 8)) == 0, "Must be");
 
   const int minCharsInWord = isLL ? wordSize : wordSize / 2;
 
@@ -1269,8 +1268,7 @@ void C2_MacroAssembler::string_compare_long_different_encoding(Register result,
   Label TAIL, NEXT_WORD, DIFFERENCE;
 
   const int base_offset = arrayOopDesc::base_offset_in_bytes(T_BYTE);
-  assert((base_offset % (UseCompactObjectHeaders ? 4 :
-                          (UseCompressedClassPointers ? 8 : 4))) == 0, "Must be");
+  assert((base_offset % (UseCompactObjectHeaders ? 4 : 8)) == 0, "Must be");
 
   Register strL = isLU ? str1 : str2;
   Register strU = isLU ? str2 : str1;
@@ -1485,8 +1483,7 @@ void C2_MacroAssembler::arrays_equals(Register a1, Register a2,
   int length_offset = arrayOopDesc::length_offset_in_bytes();
   int base_offset   = arrayOopDesc::base_offset_in_bytes(elem_size == 2 ? T_CHAR : T_BYTE);
 
-  assert((base_offset % (UseCompactObjectHeaders ? 4 :
-                         (UseCompressedClassPointers ? 8 : 4))) == 0, "Must be");
+  assert((base_offset % (UseCompactObjectHeaders ? 4 : 8)) == 0, "Must be");
 
   Register cnt1 = tmp3;
   Register cnt2 = tmp1;  // cnt2 only used in array length compare
@@ -1611,8 +1608,7 @@ void C2_MacroAssembler::string_equals(Register a1, Register a2,
 
   int base_offset = arrayOopDesc::base_offset_in_bytes(T_BYTE);
 
-  assert((base_offset % (UseCompactObjectHeaders ? 4 :
-                         (UseCompressedClassPointers ? 8 : 4))) == 0, "Must be");
+  assert((base_offset % (UseCompactObjectHeaders ? 4 : 8)) == 0, "Must be");
 
   BLOCK_COMMENT("string_equals {");
 
@@ -2699,8 +2695,7 @@ void C2_MacroAssembler::arrays_equals_v(Register a1, Register a2, Register resul
   int length_offset = arrayOopDesc::length_offset_in_bytes();
   int base_offset = arrayOopDesc::base_offset_in_bytes(elem_size == 2 ? T_CHAR : T_BYTE);
 
-  assert((base_offset % (UseCompactObjectHeaders ? 4 :
-                         (UseCompressedClassPointers ? 8 : 4))) == 0, "Must be");
+  assert((base_offset % (UseCompactObjectHeaders ? 4 : 8)) == 0, "Must be");
 
   BLOCK_COMMENT("arrays_equals_v {");
 
diff --git a/src/hotspot/cpu/riscv/macroAssembler_riscv.cpp b/src/hotspot/cpu/riscv/macroAssembler_riscv.cpp
index 4f5e7afc166..b0305fa2977 100644
--- a/src/hotspot/cpu/riscv/macroAssembler_riscv.cpp
+++ b/src/hotspot/cpu/riscv/macroAssembler_riscv.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1997, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
  * Copyright (c) 2014, 2020, Red Hat Inc. All rights reserved.
  * Copyright (c) 2020, 2024, Huawei Technologies Co., Ltd. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
@@ -3514,10 +3514,8 @@ void MacroAssembler::orptr(Address adr, RegisterOrConstant src, Register tmp1, R
 void MacroAssembler::cmp_klass_compressed(Register oop, Register trial_klass, Register tmp, Label &L, bool equal) {
   if (UseCompactObjectHeaders) {
     load_narrow_klass_compact(tmp, oop);
-  } else if (UseCompressedClassPointers) {
-    lwu(tmp, Address(oop, oopDesc::klass_offset_in_bytes()));
   } else {
-    ld(tmp, Address(oop, oopDesc::klass_offset_in_bytes()));
+    lwu(tmp, Address(oop, oopDesc::klass_offset_in_bytes()));
   }
   if (equal) {
     beq(trial_klass, tmp, L);
@@ -3741,11 +3739,9 @@ void MacroAssembler::load_klass(Register dst, Register src, Register tmp) {
   if (UseCompactObjectHeaders) {
     load_narrow_klass_compact(dst, src);
     decode_klass_not_null(dst, tmp);
-  } else if (UseCompressedClassPointers) {
+  } else {
     lwu(dst, Address(src, oopDesc::klass_offset_in_bytes()));
     decode_klass_not_null(dst, tmp);
-  } else {
-    ld(dst, Address(src, oopDesc::klass_offset_in_bytes()));
   }
 }
 
@@ -3753,20 +3749,15 @@ void MacroAssembler::store_klass(Register dst, Register src, Register tmp) {
   // FIXME: Should this be a store release? concurrent gcs assumes
   // klass length is valid if klass field is not null.
   assert(!UseCompactObjectHeaders, "not with compact headers");
-  if (UseCompressedClassPointers) {
-    encode_klass_not_null(src, tmp);
-    sw(src, Address(dst, oopDesc::klass_offset_in_bytes()));
-  } else {
-    sd(src, Address(dst, oopDesc::klass_offset_in_bytes()));
-  }
+  encode_klass_not_null(src, tmp);
+  sw(src, Address(dst, oopDesc::klass_offset_in_bytes()));
+
 }
 
 void MacroAssembler::store_klass_gap(Register dst, Register src) {
   assert(!UseCompactObjectHeaders, "not with compact headers");
-  if (UseCompressedClassPointers) {
-    // Store to klass gap in destination
-    sw(src, Address(dst, oopDesc::klass_gap_offset_in_bytes()));
-  }
+  // Store to klass gap in destination
+  sw(src, Address(dst, oopDesc::klass_gap_offset_in_bytes()));
 }
 
 void MacroAssembler::decode_klass_not_null(Register r, Register tmp) {
@@ -3775,7 +3766,6 @@ void MacroAssembler::decode_klass_not_null(Register r, Register tmp) {
 }
 
 void MacroAssembler::decode_klass_not_null(Register dst, Register src, Register tmp) {
-  assert(UseCompressedClassPointers, "should only be used for compressed headers");
   assert_different_registers(dst, tmp);
   assert_different_registers(src, tmp);
 
@@ -3806,8 +3796,6 @@ void MacroAssembler::encode_klass_not_null(Register r, Register tmp) {
 }
 
 void MacroAssembler::encode_klass_not_null(Register dst, Register src, Register tmp) {
-  assert(UseCompressedClassPointers, "should only be used for compressed headers");
-
   if (CompressedKlassPointers::base() == nullptr) {
     if (CompressedKlassPointers::shift() != 0) {
       srli(dst, src, CompressedKlassPointers::shift());
@@ -5337,7 +5325,6 @@ void MacroAssembler::set_narrow_oop(Register dst, jobject obj) {
 }
 
 void  MacroAssembler::set_narrow_klass(Register dst, Klass* k) {
-  assert (UseCompressedClassPointers, "should only be used for compressed headers");
   assert (oop_recorder() != nullptr, "this assembler needs an OopRecorder");
   int index = oop_recorder()->find_index(k);
 
@@ -5417,12 +5404,9 @@ int MacroAssembler::ic_check(int end_alignment) {
   if (UseCompactObjectHeaders) {
     load_narrow_klass_compact(tmp1, receiver);
     lwu(tmp2, Address(data, CompiledICData::speculated_klass_offset()));
-  } else if (UseCompressedClassPointers) {
+  } else {
     lwu(tmp1, Address(receiver, oopDesc::klass_offset_in_bytes()));
     lwu(tmp2, Address(data, CompiledICData::speculated_klass_offset()));
-  } else {
-    ld(tmp1,  Address(receiver, oopDesc::klass_offset_in_bytes()));
-    ld(tmp2, Address(data, CompiledICData::speculated_klass_offset()));
   }
 
   Label ic_hit;
diff --git a/src/hotspot/cpu/riscv/riscv.ad b/src/hotspot/cpu/riscv/riscv.ad
index 54c0d9c0955..e236d03e6d2 100644
--- a/src/hotspot/cpu/riscv/riscv.ad
+++ b/src/hotspot/cpu/riscv/riscv.ad
@@ -1801,13 +1801,8 @@ void MachUEPNode::format(PhaseRegAlloc* ra_, outputStream* st) const
 {
   assert_cond(st != nullptr);
   st->print_cr("# MachUEPNode");
-  if (UseCompressedClassPointers) {
-    st->print_cr("\tlwu t1, [j_rarg0 + oopDesc::klass_offset_in_bytes()]\t# compressed klass");
-    st->print_cr("\tlwu t2, [t0      + CompiledICData::speculated_klass_offset()]\t# compressed klass");
-  } else {
-    st->print_cr("\tld t1, [j_rarg0 + oopDesc::klass_offset_in_bytes()]\t# compressed klass");
-    st->print_cr("\tld t2, [t0      + CompiledICData::speculated_klass_offset()]\t# compressed klass");
-  }
+  st->print_cr("\tlwu t1, [j_rarg0 + oopDesc::klass_offset_in_bytes()]\t# compressed klass");
+  st->print_cr("\tlwu t2, [t0      + CompiledICData::speculated_klass_offset()]\t# compressed klass");
   st->print_cr("\tbeq t1, t2, ic_hit");
   st->print_cr("\tj, SharedRuntime::_ic_miss_stub\t # Inline cache check");
   st->print_cr("\tic_hit:");
diff --git a/src/hotspot/cpu/riscv/stubGenerator_riscv.cpp b/src/hotspot/cpu/riscv/stubGenerator_riscv.cpp
index 127ac9f6951..964c6d98e9c 100644
--- a/src/hotspot/cpu/riscv/stubGenerator_riscv.cpp
+++ b/src/hotspot/cpu/riscv/stubGenerator_riscv.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * Copyright (c) 2014, 2025, Red Hat Inc. All rights reserved.
  * Copyright (c) 2020, 2025, Huawei Technologies Co., Ltd. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
@@ -3070,8 +3070,7 @@ class StubGenerator: public StubCodeGenerator {
     const Register tmp = x30, tmpLval = x12;
 
     int base_offset = arrayOopDesc::base_offset_in_bytes(T_BYTE);
-    assert((base_offset % (UseCompactObjectHeaders ? 4 :
-                           (UseCompressedClassPointers ? 8 : 4))) == 0, "Must be");
+    assert((base_offset % (UseCompactObjectHeaders ? 4 : 8)) == 0, "Must be");
 
 #ifdef ASSERT
     if (AvoidUnalignedAccesses) {
@@ -3128,8 +3127,7 @@ class StubGenerator: public StubCodeGenerator {
                    tmp1 = x28, tmp2 = x29, tmp3 = x30, tmp4 = x12;
 
     int base_offset = arrayOopDesc::base_offset_in_bytes(T_BYTE);
-    assert((base_offset % (UseCompactObjectHeaders ? 4 :
-                           (UseCompressedClassPointers ? 8 : 4))) == 0, "Must be");
+    assert((base_offset % (UseCompactObjectHeaders ? 4 : 8)) == 0, "Must be");
 
     Register strU = isLU ? str2 : str1,
              strL = isLU ? str1 : str2,
diff --git a/src/hotspot/cpu/s390/c1_LIRAssembler_s390.cpp b/src/hotspot/cpu/s390/c1_LIRAssembler_s390.cpp
index 93d6051aa76..e1d8d062c23 100644
--- a/src/hotspot/cpu/s390/c1_LIRAssembler_s390.cpp
+++ b/src/hotspot/cpu/s390/c1_LIRAssembler_s390.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2016, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2016, 2026, Oracle and/or its affiliates. All rights reserved.
  * Copyright (c) 2016, 2024 SAP SE. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
@@ -2251,9 +2251,7 @@ void LIR_Assembler::emit_arraycopy(LIR_OpArrayCopy* op) {
     // but not necessarily exactly of type default_type.
     NearLabel known_ok, halt;
     metadata2reg(default_type->constant_encoding(), tmp);
-    if (UseCompressedClassPointers) {
-      __ encode_klass_not_null(tmp);
-    }
+    __ encode_klass_not_null(tmp);
 
     if (basic_type != T_OBJECT) {
       __ cmp_klass(tmp, dst, Z_R1_scratch);
@@ -2540,13 +2538,8 @@ void LIR_Assembler::emit_typecheck_helper(LIR_OpTypeCheck *op, Label* success, L
   // Get object class.
   // Not a safepoint as obj null check happens earlier.
   if (op->fast_check()) {
-    if (UseCompressedClassPointers) {
-      __ load_klass(klass_RInfo, obj);
-      __ compareU64_and_branch(k_RInfo, klass_RInfo, Assembler::bcondNotEqual, *failure_target);
-    } else {
-      __ z_cg(k_RInfo, Address(obj, oopDesc::klass_offset_in_bytes()));
-      __ branch_optimized(Assembler::bcondNotEqual, *failure_target);
-    }
+    __ load_klass(klass_RInfo, obj);
+    __ compareU64_and_branch(k_RInfo, klass_RInfo, Assembler::bcondNotEqual, *failure_target);
     // Successful cast, fall through to profile or jump.
   } else {
     bool need_slow_path = !k->is_loaded() ||
diff --git a/src/hotspot/cpu/s390/c1_MacroAssembler_s390.cpp b/src/hotspot/cpu/s390/c1_MacroAssembler_s390.cpp
index 993c1a1b552..813143938f9 100644
--- a/src/hotspot/cpu/s390/c1_MacroAssembler_s390.cpp
+++ b/src/hotspot/cpu/s390/c1_MacroAssembler_s390.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2016, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2016, 2026, Oracle and/or its affiliates. All rights reserved.
  * Copyright (c) 2016, 2024 SAP SE. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
@@ -107,10 +107,10 @@ void C1_MacroAssembler::initialize_header(Register obj, Register klass, Register
   }
 
   if (len->is_valid()) {
-    // Length will be in the klass gap, if one exists.
+    // Length will be in the klass gap.
     z_st(len, Address(obj, arrayOopDesc::length_offset_in_bytes()));
-  } else if (UseCompressedClassPointers && !UseCompactObjectHeaders) {
-    store_klass_gap(Rzero, obj);  // Zero klass gap for compressed oops.
+  } else if (!UseCompactObjectHeaders) {
+    store_klass_gap(Rzero, obj);  // Zero klass gap.
   }
 }
 
diff --git a/src/hotspot/cpu/s390/macroAssembler_s390.cpp b/src/hotspot/cpu/s390/macroAssembler_s390.cpp
index 6e132f895bd..de3608e74ba 100644
--- a/src/hotspot/cpu/s390/macroAssembler_s390.cpp
+++ b/src/hotspot/cpu/s390/macroAssembler_s390.cpp
@@ -1237,7 +1237,6 @@ void MacroAssembler::load_narrow_oop(Register t, narrowOop a) {
 
 // Load narrow klass constant, compression required.
 void MacroAssembler::load_narrow_klass(Register t, Klass* k) {
-  assert(UseCompressedClassPointers, "must be on to call this method");
   narrowKlass encoded_k = CompressedKlassPointers::encode(k);
   load_const_32to64(t, encoded_k, false /*sign_extend*/);
 }
@@ -1255,7 +1254,6 @@ void MacroAssembler::compare_immediate_narrow_oop(Register oop1, narrowOop oop2)
 
 // Compare narrow oop in reg with narrow oop constant, no decompression.
 void MacroAssembler::compare_immediate_narrow_klass(Register klass1, Klass* klass2) {
-  assert(UseCompressedClassPointers, "must be on to call this method");
   narrowKlass encoded_k = CompressedKlassPointers::encode(klass2);
 
   Assembler::z_clfi(klass1, encoded_k);
@@ -1348,8 +1346,6 @@ int MacroAssembler::patch_load_narrow_oop(address pos, oop o) {
 // Patching the immediate value of CPU version dependent load_narrow_klass sequence.
 // The passed ptr must NOT be in compressed format!
 int MacroAssembler::patch_load_narrow_klass(address pos, Klass* k) {
-  assert(UseCompressedClassPointers, "Can only patch compressed klass pointers");
-
   narrowKlass nk = CompressedKlassPointers::encode(k);
   return patch_load_const_32to64(pos, nk);
 }
@@ -1364,8 +1360,6 @@ int MacroAssembler::patch_compare_immediate_narrow_oop(address pos, oop o) {
 // Patching the immediate value of CPU version dependent compare_immediate_narrow_klass sequence.
 // The passed ptr must NOT be in compressed format!
 int MacroAssembler::patch_compare_immediate_narrow_klass(address pos, Klass* k) {
-  assert(UseCompressedClassPointers, "Can only patch compressed klass pointers");
-
   narrowKlass nk = CompressedKlassPointers::encode(k);
   return patch_compare_immediate_32(pos, nk);
 }
@@ -2235,10 +2229,8 @@ int MacroAssembler::ic_check(int end_alignment) {
 
   if (UseCompactObjectHeaders) {
     load_narrow_klass_compact(R1_scratch, R2_receiver);
-  } else if (UseCompressedClassPointers) {
-    z_llgf(R1_scratch, Address(R2_receiver, oopDesc::klass_offset_in_bytes()));
   } else {
-    z_lg(R1_scratch, Address(R2_receiver, oopDesc::klass_offset_in_bytes()));
+    z_llgf(R1_scratch, Address(R2_receiver, oopDesc::klass_offset_in_bytes()));
   }
   z_cg(R1_scratch, Address(R9_data, in_bytes(CompiledICData::speculated_klass_offset())));
   z_bre(success);
@@ -3916,7 +3908,6 @@ void MacroAssembler::encode_klass_not_null(Register dst, Register src) {
   address  base    = CompressedKlassPointers::base();
   int      shift   = CompressedKlassPointers::shift();
   bool     need_zero_extend = base != nullptr;
-  assert(UseCompressedClassPointers, "only for compressed klass ptrs");
 
   BLOCK_COMMENT("cKlass encoder {");
 
@@ -4013,7 +4004,6 @@ int MacroAssembler::instr_size_for_decode_klass_not_null() {
   address  base    = CompressedKlassPointers::base();
   int shift_size   = CompressedKlassPointers::shift() == 0 ? 0 : 6; /* sllg */
   int addbase_size = 0;
-  assert(UseCompressedClassPointers, "only for compressed klass ptrs");
 
   if (base != nullptr) {
     unsigned int base_h = ((unsigned long)base)>>32;
@@ -4043,7 +4033,6 @@ void MacroAssembler::decode_klass_not_null(Register dst) {
   address  base    = CompressedKlassPointers::base();
   int      shift   = CompressedKlassPointers::shift();
   int      beg_off = offset();
-  assert(UseCompressedClassPointers, "only for compressed klass ptrs");
 
   BLOCK_COMMENT("cKlass decoder (const size) {");
 
@@ -4085,7 +4074,6 @@ void MacroAssembler::decode_klass_not_null(Register dst) {
 void MacroAssembler::decode_klass_not_null(Register dst, Register src) {
   address base  = CompressedKlassPointers::base();
   int     shift = CompressedKlassPointers::shift();
-  assert(UseCompressedClassPointers, "only for compressed klass ptrs");
 
   BLOCK_COMMENT("cKlass decoder {");
 
@@ -4125,13 +4113,9 @@ void MacroAssembler::decode_klass_not_null(Register dst, Register src) {
 }
 
 void MacroAssembler::load_klass(Register klass, Address mem) {
-  if (UseCompressedClassPointers) {
-    z_llgf(klass, mem);
-    // Attention: no null check here!
-    decode_klass_not_null(klass);
-  } else {
-    z_lg(klass, mem);
-  }
+  z_llgf(klass, mem);
+  // Attention: no null check here!
+  decode_klass_not_null(klass);
 }
 
 // Loads the obj's Klass* into dst.
@@ -4154,10 +4138,8 @@ void MacroAssembler::cmp_klass(Register klass, Register obj, Register tmp) {
     assert_different_registers(klass, obj, tmp);
     load_narrow_klass_compact(tmp, obj);
     z_cr(klass, tmp);
-  } else if (UseCompressedClassPointers) {
-    z_c(klass, Address(obj, oopDesc::klass_offset_in_bytes()));
   } else {
-    z_cg(klass, Address(obj, oopDesc::klass_offset_in_bytes()));
+    z_c(klass, Address(obj, oopDesc::klass_offset_in_bytes()));
   }
   BLOCK_COMMENT("} cmp_klass");
 }
@@ -4170,12 +4152,9 @@ void MacroAssembler::cmp_klasses_from_objects(Register obj1, Register obj2, Regi
     load_narrow_klass_compact(tmp1, obj1);
     load_narrow_klass_compact(tmp2, obj2);
     z_cr(tmp1, tmp2);
-  } else if (UseCompressedClassPointers) {
+  } else {
     z_l(tmp1, Address(obj1, oopDesc::klass_offset_in_bytes()));
     z_c(tmp1, Address(obj2, oopDesc::klass_offset_in_bytes()));
-  } else {
-    z_lg(tmp1, Address(obj1, oopDesc::klass_offset_in_bytes()));
-    z_cg(tmp1, Address(obj2, oopDesc::klass_offset_in_bytes()));
   }
   BLOCK_COMMENT("} cmp_klasses_from_objects");
 }
@@ -4184,36 +4163,28 @@ void MacroAssembler::load_klass(Register klass, Register src_oop) {
   if (UseCompactObjectHeaders) {
     load_narrow_klass_compact(klass, src_oop);
     decode_klass_not_null(klass);
-  } else if (UseCompressedClassPointers) {
+  } else {
     z_llgf(klass, oopDesc::klass_offset_in_bytes(), src_oop);
     decode_klass_not_null(klass);
-  } else {
-    z_lg(klass, oopDesc::klass_offset_in_bytes(), src_oop);
   }
 }
 
 void MacroAssembler::store_klass(Register klass, Register dst_oop, Register ck) {
   assert(!UseCompactObjectHeaders, "Don't use with compact headers");
-  if (UseCompressedClassPointers) {
-    assert_different_registers(dst_oop, klass, Z_R0);
-    if (ck == noreg) ck = klass;
-    encode_klass_not_null(ck, klass);
-    z_st(ck, Address(dst_oop, oopDesc::klass_offset_in_bytes()));
-  } else {
-    z_stg(klass, Address(dst_oop, oopDesc::klass_offset_in_bytes()));
-  }
+  assert_different_registers(dst_oop, klass, Z_R0);
+  if (ck == noreg) ck = klass;
+  encode_klass_not_null(ck, klass);
+  z_st(ck, Address(dst_oop, oopDesc::klass_offset_in_bytes()));
 }
 
 void MacroAssembler::store_klass_gap(Register s, Register d) {
   assert(!UseCompactObjectHeaders, "Don't use with compact headers");
-  if (UseCompressedClassPointers) {
-    assert(s != d, "not enough registers");
-    // Support s = noreg.
-    if (s != noreg) {
-      z_st(s, Address(d, oopDesc::klass_gap_offset_in_bytes()));
-    } else {
-      z_mvhi(Address(d, oopDesc::klass_gap_offset_in_bytes()), 0);
-    }
+  assert(s != d, "not enough registers");
+  // Support s = noreg.
+  if (s != noreg) {
+    z_st(s, Address(d, oopDesc::klass_gap_offset_in_bytes()));
+  } else {
+    z_mvhi(Address(d, oopDesc::klass_gap_offset_in_bytes()), 0);
   }
 }
 
@@ -4227,67 +4198,64 @@ void MacroAssembler::compare_klass_ptr(Register Rop1, int64_t disp, Register Rba
 
   BLOCK_COMMENT("compare klass ptr {");
 
-  if (UseCompressedClassPointers) {
-    const int shift = CompressedKlassPointers::shift();
-    address   base  = CompressedKlassPointers::base();
+  const int shift = CompressedKlassPointers::shift();
+  address   base  = CompressedKlassPointers::base();
 
-    if (UseCompactObjectHeaders) {
-      assert(shift >= 3, "cKlass encoder detected bad shift");
-    } else {
-      assert((shift == 0) || (shift == 3), "cKlass encoder detected bad shift");
-    }
-    assert_different_registers(Rop1, Z_R0);
-    assert_different_registers(Rop1, Rbase, Z_R1);
-
-    // First encode register oop and then compare with cOop in memory.
-    // This sequence saves an unnecessary cOop load and decode.
-    if (base == nullptr) {
-      if (shift == 0) {
-        z_cl(Rop1, disp, Rbase);     // Unscaled
-      } else {
-        z_srlg(Z_R0, Rop1, shift);   // ZeroBased
-        z_cl(Z_R0, disp, Rbase);
-      }
-    } else {                         // HeapBased
-#ifdef ASSERT
-      bool     used_R0 = true;
-      bool     used_R1 = true;
-#endif
-      Register current = Rop1;
-      Label    done;
-
-      if (maybenull) {       // null pointer must be preserved!
-        z_ltgr(Z_R0, current);
-        z_bre(done);
-        current = Z_R0;
-      }
-
-      unsigned int base_h = ((unsigned long)base)>>32;
-      unsigned int base_l = (unsigned int)((unsigned long)base);
-      if ((base_h != 0) && (base_l == 0) && VM_Version::has_HighWordInstr()) {
-        lgr_if_needed(Z_R0, current);
-        z_aih(Z_R0, -((int)base_h));     // Base has no set bits in lower half.
-      } else if ((base_h == 0) && (base_l != 0)) {
-        lgr_if_needed(Z_R0, current);
-        z_agfi(Z_R0, -(int)base_l);
-      } else {
-        int pow2_offset = get_oop_base_complement(Z_R1, ((uint64_t)(intptr_t)base));
-        add2reg_with_index(Z_R0, pow2_offset, Z_R1, Rop1); // Subtract base by adding complement.
-      }
-
-      if (shift != 0) {
-        z_srlg(Z_R0, Z_R0, shift);
-      }
-      bind(done);
-      z_cl(Z_R0, disp, Rbase);
-#ifdef ASSERT
-      if (used_R0) preset_reg(Z_R0, 0xb05bUL, 2);
-      if (used_R1) preset_reg(Z_R1, 0xb06bUL, 2);
-#endif
-    }
+  if (UseCompactObjectHeaders) {
+    assert(shift >= 3, "cKlass encoder detected bad shift");
   } else {
-    z_clg(Rop1, disp, Z_R0, Rbase);
+    assert((shift == 0) || (shift == 3), "cKlass encoder detected bad shift");
   }
+  assert_different_registers(Rop1, Z_R0);
+  assert_different_registers(Rop1, Rbase, Z_R1);
+
+  // First encode register oop and then compare with cOop in memory.
+  // This sequence saves an unnecessary cOop load and decode.
+  if (base == nullptr) {
+    if (shift == 0) {
+      z_cl(Rop1, disp, Rbase);     // Unscaled
+    } else {
+      z_srlg(Z_R0, Rop1, shift);   // ZeroBased
+      z_cl(Z_R0, disp, Rbase);
+    }
+  } else {                         // HeapBased
+#ifdef ASSERT
+    bool     used_R0 = true;
+    bool     used_R1 = true;
+#endif
+    Register current = Rop1;
+    Label    done;
+
+    if (maybenull) {       // null pointer must be preserved!
+      z_ltgr(Z_R0, current);
+      z_bre(done);
+      current = Z_R0;
+    }
+
+    unsigned int base_h = ((unsigned long)base)>>32;
+    unsigned int base_l = (unsigned int)((unsigned long)base);
+    if ((base_h != 0) && (base_l == 0) && VM_Version::has_HighWordInstr()) {
+      lgr_if_needed(Z_R0, current);
+      z_aih(Z_R0, -((int)base_h));     // Base has no set bits in lower half.
+    } else if ((base_h == 0) && (base_l != 0)) {
+      lgr_if_needed(Z_R0, current);
+      z_agfi(Z_R0, -(int)base_l);
+    } else {
+      int pow2_offset = get_oop_base_complement(Z_R1, ((uint64_t)(intptr_t)base));
+      add2reg_with_index(Z_R0, pow2_offset, Z_R1, Rop1); // Subtract base by adding complement.
+    }
+
+    if (shift != 0) {
+      z_srlg(Z_R0, Z_R0, shift);
+    }
+    bind(done);
+    z_cl(Z_R0, disp, Rbase);
+#ifdef ASSERT
+    if (used_R0) preset_reg(Z_R0, 0xb05bUL, 2);
+    if (used_R1) preset_reg(Z_R1, 0xb06bUL, 2);
+#endif
+  }
+
   BLOCK_COMMENT("} compare klass ptr");
 }
 
diff --git a/src/hotspot/cpu/s390/macroAssembler_s390.hpp b/src/hotspot/cpu/s390/macroAssembler_s390.hpp
index da24ae80d45..32e484d4790 100644
--- a/src/hotspot/cpu/s390/macroAssembler_s390.hpp
+++ b/src/hotspot/cpu/s390/macroAssembler_s390.hpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2016, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2016, 2026, Oracle and/or its affiliates. All rights reserved.
  * Copyright (c) 2016, 2024 SAP SE. All rights reserved.
  * Copyright (c) 2024 IBM Corporation. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
@@ -842,8 +842,7 @@ class MacroAssembler: public Assembler {
   void store_klass(Register klass, Register dst_oop, Register ck = noreg); // Klass will get compressed if ck not provided.
   void store_klass_gap(Register s, Register dst_oop);
   void load_narrow_klass_compact(Register dst, Register src);
-  // Compares the Klass pointer of an object to a given Klass (which might be narrow,
-  // depending on UseCompressedClassPointers).
+  // Compares the narrow Klass pointer of an object to a given narrow Klass
   void cmp_klass(Register klass, Register obj, Register tmp);
   // Compares the Klass pointer of two objects obj1 and obj2. Result is in the condition flags.
   // Uses tmp1 and tmp2 as temporary registers.
diff --git a/src/hotspot/cpu/s390/matcher_s390.hpp b/src/hotspot/cpu/s390/matcher_s390.hpp
index 99461e33e3c..b04a6566d41 100644
--- a/src/hotspot/cpu/s390/matcher_s390.hpp
+++ b/src/hotspot/cpu/s390/matcher_s390.hpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2021, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2021, 2026, Oracle and/or its affiliates. All rights reserved.
  * Copyright (c) 2017, 2024 SAP SE. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
@@ -82,7 +82,6 @@
 
   static bool narrow_klass_use_complex_address() {
     NOT_LP64(ShouldNotCallThis());
-    assert(UseCompressedClassPointers, "only for compressed klass code");
     // TODO HS25: z port if (MatchDecodeNodes) return true;
     return false;
   }
diff --git a/src/hotspot/cpu/x86/c1_LIRAssembler_x86.cpp b/src/hotspot/cpu/x86/c1_LIRAssembler_x86.cpp
index d9be0fdcc8d..5397a230642 100644
--- a/src/hotspot/cpu/x86/c1_LIRAssembler_x86.cpp
+++ b/src/hotspot/cpu/x86/c1_LIRAssembler_x86.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2000, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2000, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -77,23 +77,6 @@ const Register SHIFT_count = rcx;   // where count for shift operations must be
 
 #define __ _masm->
 
-
-static void select_different_registers(Register preserve,
-                                       Register extra,
-                                       Register &tmp1,
-                                       Register &tmp2) {
-  if (tmp1 == preserve) {
-    assert_different_registers(tmp1, tmp2, extra);
-    tmp1 = extra;
-  } else if (tmp2 == preserve) {
-    assert_different_registers(tmp1, tmp2, extra);
-    tmp2 = extra;
-  }
-  assert_different_registers(preserve, tmp1, tmp2);
-}
-
-
-
 static void select_different_registers(Register preserve,
                                        Register extra,
                                        Register &tmp1,
@@ -1309,12 +1292,8 @@ void LIR_Assembler::emit_typecheck_helper(LIR_OpTypeCheck *op, Label* success, L
   } else if (obj == klass_RInfo) {
     klass_RInfo = dst;
   }
-  if (k->is_loaded() && !UseCompressedClassPointers) {
-    select_different_registers(obj, dst, k_RInfo, klass_RInfo);
-  } else {
-    Rtmp1 = op->tmp3()->as_register();
-    select_different_registers(obj, dst, k_RInfo, klass_RInfo, Rtmp1);
-  }
+  Rtmp1 = op->tmp3()->as_register();
+  select_different_registers(obj, dst, k_RInfo, klass_RInfo, Rtmp1);
 
   assert_different_registers(obj, k_RInfo, klass_RInfo);
 
@@ -1348,12 +1327,8 @@ void LIR_Assembler::emit_typecheck_helper(LIR_OpTypeCheck *op, Label* success, L
   if (op->fast_check()) {
     // get object class
     // not a safepoint as obj null check happens earlier
-    if (UseCompressedClassPointers) {
-      __ load_klass(Rtmp1, obj, tmp_load_klass);
-      __ cmpptr(k_RInfo, Rtmp1);
-    } else {
-      __ cmpptr(k_RInfo, Address(obj, oopDesc::klass_offset_in_bytes()));
-    }
+    __ load_klass(Rtmp1, obj, tmp_load_klass);
+    __ cmpptr(k_RInfo, Rtmp1);
     __ jcc(Assembler::notEqual, *failure_target);
     // successful cast, fall through to profile or jump
   } else {
@@ -2651,9 +2626,7 @@ void LIR_Assembler::emit_arraycopy(LIR_OpArrayCopy* op) {
     // but not necessarily exactly of type default_type.
     Label known_ok, halt;
     __ mov_metadata(tmp, default_type->constant_encoding());
-    if (UseCompressedClassPointers) {
-      __ encode_klass_not_null(tmp, rscratch1);
-    }
+    __ encode_klass_not_null(tmp, rscratch1);
 
     if (basic_type != T_OBJECT) {
       __ cmp_klass(tmp, dst, tmp2);
diff --git a/src/hotspot/cpu/x86/c1_LIRGenerator_x86.cpp b/src/hotspot/cpu/x86/c1_LIRGenerator_x86.cpp
index 5459e8df229..f448e4ee17f 100644
--- a/src/hotspot/cpu/x86/c1_LIRGenerator_x86.cpp
+++ b/src/hotspot/cpu/x86/c1_LIRGenerator_x86.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2005, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2005, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -1291,9 +1291,7 @@ void LIRGenerator::do_CheckCast(CheckCast* x) {
   }
   LIR_Opr reg = rlock_result(x);
   LIR_Opr tmp3 = LIR_OprFact::illegalOpr;
-  if (!x->klass()->is_loaded() || UseCompressedClassPointers) {
-    tmp3 = new_register(objectType);
-  }
+  tmp3 = new_register(objectType);
   __ checkcast(reg, obj.result(), x->klass(),
                new_register(objectType), new_register(objectType), tmp3,
                x->direct_compare(), info_for_exception, patching_info, stub,
@@ -1313,9 +1311,7 @@ void LIRGenerator::do_InstanceOf(InstanceOf* x) {
   }
   obj.load_item();
   LIR_Opr tmp3 = LIR_OprFact::illegalOpr;
-  if (!x->klass()->is_loaded() || UseCompressedClassPointers) {
-    tmp3 = new_register(objectType);
-  }
+  tmp3 = new_register(objectType);
   __ instanceof(reg, obj.result(), x->klass(),
                 new_register(objectType), new_register(objectType), tmp3,
                 x->direct_compare(), patching_info, x->profiled_method(), x->profiled_bci());
diff --git a/src/hotspot/cpu/x86/c1_MacroAssembler_x86.cpp b/src/hotspot/cpu/x86/c1_MacroAssembler_x86.cpp
index 88e2e6c8ba9..7adaea48ff1 100644
--- a/src/hotspot/cpu/x86/c1_MacroAssembler_x86.cpp
+++ b/src/hotspot/cpu/x86/c1_MacroAssembler_x86.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1999, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1999, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -85,14 +85,11 @@ void C1_MacroAssembler::initialize_header(Register obj, Register klass, Register
   if (UseCompactObjectHeaders) {
     movptr(t1, Address(klass, Klass::prototype_header_offset()));
     movptr(Address(obj, oopDesc::mark_offset_in_bytes()), t1);
-  } else if (UseCompressedClassPointers) { // Take care not to kill klass
+  } else { // Take care not to kill klass
     movptr(Address(obj, oopDesc::mark_offset_in_bytes()), checked_cast<int32_t>(markWord::prototype().value()));
     movptr(t1, klass);
     encode_klass_not_null(t1, rscratch1);
     movl(Address(obj, oopDesc::klass_offset_in_bytes()), t1);
-  } else {
-    movptr(Address(obj, oopDesc::mark_offset_in_bytes()), checked_cast<int32_t>(markWord::prototype().value()));
-    movptr(Address(obj, oopDesc::klass_offset_in_bytes()), klass);
   }
 
   if (len->is_valid()) {
@@ -104,7 +101,7 @@ void C1_MacroAssembler::initialize_header(Register obj, Register klass, Register
       xorl(t1, t1);
       movl(Address(obj, base_offset), t1);
     }
-  } else if (UseCompressedClassPointers && !UseCompactObjectHeaders) {
+  } else if (!UseCompactObjectHeaders) {
     xorptr(t1, t1);
     store_klass_gap(obj, t1);
   }
diff --git a/src/hotspot/cpu/x86/macroAssembler_x86.cpp b/src/hotspot/cpu/x86/macroAssembler_x86.cpp
index 1d77be26bd9..a0f08145d55 100644
--- a/src/hotspot/cpu/x86/macroAssembler_x86.cpp
+++ b/src/hotspot/cpu/x86/macroAssembler_x86.cpp
@@ -985,12 +985,9 @@ int MacroAssembler::ic_check(int end_alignment) {
   if (UseCompactObjectHeaders) {
     load_narrow_klass_compact(temp, receiver);
     cmpl(temp, Address(data, CompiledICData::speculated_klass_offset()));
-  } else if (UseCompressedClassPointers) {
+  } else {
     movl(temp, Address(receiver, oopDesc::klass_offset_in_bytes()));
     cmpl(temp, Address(data, CompiledICData::speculated_klass_offset()));
-  } else {
-    movptr(temp, Address(receiver, oopDesc::klass_offset_in_bytes()));
-    cmpptr(temp, Address(data, CompiledICData::speculated_klass_offset()));
   }
 
   // if inline cache check fails, then jump to runtime routine
@@ -5384,11 +5381,9 @@ void MacroAssembler::load_klass(Register dst, Register src, Register tmp) {
   if (UseCompactObjectHeaders) {
     load_narrow_klass_compact(dst, src);
     decode_klass_not_null(dst, tmp);
-  } else if (UseCompressedClassPointers) {
+  } else {
     movl(dst, Address(src, oopDesc::klass_offset_in_bytes()));
     decode_klass_not_null(dst, tmp);
-  } else {
-    movptr(dst, Address(src, oopDesc::klass_offset_in_bytes()));
   }
 }
 
@@ -5396,12 +5391,8 @@ void MacroAssembler::store_klass(Register dst, Register src, Register tmp) {
   assert(!UseCompactObjectHeaders, "not with compact headers");
   assert_different_registers(src, tmp);
   assert_different_registers(dst, tmp);
-  if (UseCompressedClassPointers) {
-    encode_klass_not_null(src, tmp);
-    movl(Address(dst, oopDesc::klass_offset_in_bytes()), src);
-  } else {
-    movptr(Address(dst, oopDesc::klass_offset_in_bytes()), src);
-  }
+  encode_klass_not_null(src, tmp);
+  movl(Address(dst, oopDesc::klass_offset_in_bytes()), src);
 }
 
 void MacroAssembler::cmp_klass(Register klass, Register obj, Register tmp) {
@@ -5410,10 +5401,8 @@ void MacroAssembler::cmp_klass(Register klass, Register obj, Register tmp) {
     assert_different_registers(klass, obj, tmp);
     load_narrow_klass_compact(tmp, obj);
     cmpl(klass, tmp);
-  } else if (UseCompressedClassPointers) {
-    cmpl(klass, Address(obj, oopDesc::klass_offset_in_bytes()));
   } else {
-    cmpptr(klass, Address(obj, oopDesc::klass_offset_in_bytes()));
+    cmpl(klass, Address(obj, oopDesc::klass_offset_in_bytes()));
   }
 }
 
@@ -5424,12 +5413,9 @@ void MacroAssembler::cmp_klasses_from_objects(Register obj1, Register obj2, Regi
     load_narrow_klass_compact(tmp1, obj1);
     load_narrow_klass_compact(tmp2, obj2);
     cmpl(tmp1, tmp2);
-  } else if (UseCompressedClassPointers) {
+  } else {
     movl(tmp1, Address(obj1, oopDesc::klass_offset_in_bytes()));
     cmpl(tmp1, Address(obj2, oopDesc::klass_offset_in_bytes()));
-  } else {
-    movptr(tmp1, Address(obj1, oopDesc::klass_offset_in_bytes()));
-    cmpptr(tmp1, Address(obj2, oopDesc::klass_offset_in_bytes()));
   }
 }
 
@@ -5478,10 +5464,8 @@ void MacroAssembler::store_heap_oop_null(Address dst) {
 
 void MacroAssembler::store_klass_gap(Register dst, Register src) {
   assert(!UseCompactObjectHeaders, "Don't use with compact headers");
-  if (UseCompressedClassPointers) {
-    // Store to klass gap in destination
-    movl(Address(dst, oopDesc::klass_gap_offset_in_bytes()), src);
-  }
+  // Store to klass gap in destination
+  movl(Address(dst, oopDesc::klass_gap_offset_in_bytes()), src);
 }
 
 #ifdef ASSERT
@@ -5671,7 +5655,6 @@ void  MacroAssembler::decode_klass_not_null(Register r, Register tmp) {
   BLOCK_COMMENT("decode_klass_not_null {");
   assert_different_registers(r, tmp);
   // Note: it will change flags
-  assert(UseCompressedClassPointers, "should only be used for compressed headers");
   // Cannot assert, unverified entry point counts instructions (see .ad file)
   // vtableStubs also counts instructions in pd_code_size_limit.
   // Also do not verify_oop as this is called by verify_oop.
@@ -5693,7 +5676,6 @@ void  MacroAssembler::decode_and_move_klass_not_null(Register dst, Register src)
   BLOCK_COMMENT("decode_and_move_klass_not_null {");
   assert_different_registers(src, dst);
   // Note: it will change flags
-  assert (UseCompressedClassPointers, "should only be used for compressed headers");
   // Cannot assert, unverified entry point counts instructions (see .ad file)
   // vtableStubs also counts instructions in pd_code_size_limit.
   // Also do not verify_oop as this is called by verify_oop.
@@ -5750,7 +5732,6 @@ void  MacroAssembler::set_narrow_oop(Address dst, jobject obj) {
 }
 
 void  MacroAssembler::set_narrow_klass(Register dst, Klass* k) {
-  assert (UseCompressedClassPointers, "should only be used for compressed headers");
   assert (oop_recorder() != nullptr, "this assembler needs an OopRecorder");
   int klass_index = oop_recorder()->find_index(k);
   RelocationHolder rspec = metadata_Relocation::spec(klass_index);
@@ -5758,7 +5739,6 @@ void  MacroAssembler::set_narrow_klass(Register dst, Klass* k) {
 }
 
 void  MacroAssembler::set_narrow_klass(Address dst, Klass* k) {
-  assert (UseCompressedClassPointers, "should only be used for compressed headers");
   assert (oop_recorder() != nullptr, "this assembler needs an OopRecorder");
   int klass_index = oop_recorder()->find_index(k);
   RelocationHolder rspec = metadata_Relocation::spec(klass_index);
@@ -5784,7 +5764,6 @@ void  MacroAssembler::cmp_narrow_oop(Address dst, jobject obj) {
 }
 
 void  MacroAssembler::cmp_narrow_klass(Register dst, Klass* k) {
-  assert (UseCompressedClassPointers, "should only be used for compressed headers");
   assert (oop_recorder() != nullptr, "this assembler needs an OopRecorder");
   int klass_index = oop_recorder()->find_index(k);
   RelocationHolder rspec = metadata_Relocation::spec(klass_index);
@@ -5792,7 +5771,6 @@ void  MacroAssembler::cmp_narrow_klass(Register dst, Klass* k) {
 }
 
 void  MacroAssembler::cmp_narrow_klass(Address dst, Klass* k) {
-  assert (UseCompressedClassPointers, "should only be used for compressed headers");
   assert (oop_recorder() != nullptr, "this assembler needs an OopRecorder");
   int klass_index = oop_recorder()->find_index(k);
   RelocationHolder rspec = metadata_Relocation::spec(klass_index);
diff --git a/src/hotspot/cpu/x86/macroAssembler_x86.hpp b/src/hotspot/cpu/x86/macroAssembler_x86.hpp
index 8469deaa8be..3bdd1e4477a 100644
--- a/src/hotspot/cpu/x86/macroAssembler_x86.hpp
+++ b/src/hotspot/cpu/x86/macroAssembler_x86.hpp
@@ -351,8 +351,7 @@ class MacroAssembler: public Assembler {
   void load_klass(Register dst, Register src, Register tmp);
   void store_klass(Register dst, Register src, Register tmp);
 
-  // Compares the Klass pointer of an object to a given Klass (which might be narrow,
-  // depending on UseCompressedClassPointers).
+  // Compares the narrow Klass pointer of an object to a given narrow Klass.
   void cmp_klass(Register klass, Register obj, Register tmp);
 
   // Compares the Klass pointer of two objects obj1 and obj2. Result is in the condition flags.
diff --git a/src/hotspot/cpu/x86/matcher_x86.hpp b/src/hotspot/cpu/x86/matcher_x86.hpp
index f7973a8564e..62a5d2827bc 100644
--- a/src/hotspot/cpu/x86/matcher_x86.hpp
+++ b/src/hotspot/cpu/x86/matcher_x86.hpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2021, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2021, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -75,7 +75,6 @@
   }
 
   static bool narrow_klass_use_complex_address() {
-    assert(UseCompressedClassPointers, "only for compressed klass code");
     return (CompressedKlassPointers::shift() <= 3);
   }
 
diff --git a/src/hotspot/cpu/x86/x86.ad b/src/hotspot/cpu/x86/x86.ad
index 2fd4e5516fc..f31d64f3d7e 100644
--- a/src/hotspot/cpu/x86/x86.ad
+++ b/src/hotspot/cpu/x86/x86.ad
@@ -2605,13 +2605,8 @@ uint BoxLockNode::size(PhaseRegAlloc *ra_) const
 #ifndef PRODUCT
 void MachUEPNode::format(PhaseRegAlloc* ra_, outputStream* st) const
 {
-  if (UseCompressedClassPointers) {
-    st->print_cr("movl    rscratch1, [j_rarg0 + oopDesc::klass_offset_in_bytes()]\t# compressed klass");
-    st->print_cr("\tcmpl    rscratch1, [rax + CompiledICData::speculated_klass_offset()]\t # Inline cache check");
-  } else {
-    st->print_cr("movq    rscratch1, [j_rarg0 + oopDesc::klass_offset_in_bytes()]\t# compressed klass");
-    st->print_cr("\tcmpq    rscratch1, [rax + CompiledICData::speculated_klass_offset()]\t # Inline cache check");
-  }
+  st->print_cr("movl    rscratch1, [j_rarg0 + oopDesc::klass_offset_in_bytes()]\t# compressed klass");
+  st->print_cr("\tcmpl    rscratch1, [rax + CompiledICData::speculated_klass_offset()]\t # Inline cache check");
   st->print_cr("\tjne     SharedRuntime::_ic_miss_stub");
 }
 #endif
diff --git a/src/hotspot/share/cds/aotMapLogger.cpp b/src/hotspot/share/cds/aotMapLogger.cpp
index 98336ff9b1f..9f338826fd6 100644
--- a/src/hotspot/share/cds/aotMapLogger.cpp
+++ b/src/hotspot/share/cds/aotMapLogger.cpp
@@ -589,7 +589,6 @@ public:
   }
 
   Klass* real_klass() {
-    assert(UseCompressedClassPointers, "heap archiving requires UseCompressedClassPointers");
     return _data._klass;
   }
 
diff --git a/src/hotspot/share/cds/aotMappedHeapLoader.hpp b/src/hotspot/share/cds/aotMappedHeapLoader.hpp
index 7c5ca1b1f9e..10f5ce3124f 100644
--- a/src/hotspot/share/cds/aotMappedHeapLoader.hpp
+++ b/src/hotspot/share/cds/aotMappedHeapLoader.hpp
@@ -54,7 +54,7 @@ public:
 
   // Can this VM map archived heap region? Currently only G1+compressed{oops,cp}
   static bool can_map() {
-    CDS_JAVA_HEAP_ONLY(return (UseG1GC && UseCompressedClassPointers);)
+    CDS_JAVA_HEAP_ONLY(return UseG1GC;)
     NOT_CDS_JAVA_HEAP(return false;)
   }
 
diff --git a/src/hotspot/share/cds/aotMappedHeapWriter.cpp b/src/hotspot/share/cds/aotMappedHeapWriter.cpp
index 3456c845938..8f810ef5244 100644
--- a/src/hotspot/share/cds/aotMappedHeapWriter.cpp
+++ b/src/hotspot/share/cds/aotMappedHeapWriter.cpp
@@ -450,7 +450,6 @@ int AOTMappedHeapWriter::filler_array_length(size_t fill_bytes) {
 }
 
 HeapWord* AOTMappedHeapWriter::init_filler_array_at_buffer_top(int array_length, size_t fill_bytes) {
-  assert(UseCompressedClassPointers, "Archived heap only supported for compressed klasses");
   Klass* oak = Universe::objectArrayKlass(); // already relocated to point to archived klass
   HeapWord* mem = offset_to_buffered_address<HeapWord*>(_buffer_used);
   memset(mem, 0, fill_bytes);
@@ -724,7 +723,6 @@ template <typename T> void AOTMappedHeapWriter::mark_oop_pointer(T* buffered_add
 }
 
 void AOTMappedHeapWriter::update_header_for_requested_obj(oop requested_obj, oop src_obj,  Klass* src_klass) {
-  assert(UseCompressedClassPointers, "Archived heap only supported for compressed klasses");
   narrowKlass nk = ArchiveBuilder::current()->get_requested_narrow_klass(src_klass);
   address buffered_addr = requested_addr_to_buffered_addr(cast_from_oop<address>(requested_obj));
 
diff --git a/src/hotspot/share/cds/aotMetaspace.cpp b/src/hotspot/share/cds/aotMetaspace.cpp
index 76c37194882..55e9f93b3ab 100644
--- a/src/hotspot/share/cds/aotMetaspace.cpp
+++ b/src/hotspot/share/cds/aotMetaspace.cpp
@@ -250,9 +250,9 @@ static bool shared_base_too_high(char* specified_base, char* aligned_base, size_
 static char* compute_shared_base(size_t cds_max) {
   char* specified_base = (char*)SharedBaseAddress;
   size_t alignment = AOTMetaspace::core_region_alignment();
-  if (UseCompressedClassPointers && CompressedKlassPointers::needs_class_space()) {
-    alignment = MAX2(alignment, Metaspace::reserve_alignment());
-  }
+#if INCLUDE_CLASS_SPACE
+  alignment = MAX2(alignment, Metaspace::reserve_alignment());
+#endif
 
   if (SharedBaseAddress == 0) {
     // Special meaning of -XX:SharedBaseAddress=0 -> Always map archive at os-selected address.
@@ -1637,32 +1637,29 @@ MapArchiveResult AOTMetaspace::map_archives(FileMapInfo* static_mapinfo, FileMap
     aot_log_debug(aot)("Failed to reserve spaces (use_requested_addr=%u)", (unsigned)use_requested_addr);
   } else {
 
-    if (Metaspace::using_class_space()) {
-      prot_zone_size = protection_zone_size();
-    }
+    CLASS_SPACE_ONLY(prot_zone_size = protection_zone_size();)
 
-#ifdef ASSERT
     // Some sanity checks after reserving address spaces for archives
     //  and class space.
     assert(archive_space_rs.is_reserved(), "Sanity");
-    if (Metaspace::using_class_space()) {
-      assert(archive_space_rs.base() == mapped_base_address &&
-          archive_space_rs.size() > protection_zone_size(),
-          "Archive space must lead and include the protection zone");
-      // Class space must closely follow the archive space. Both spaces
-      //  must be aligned correctly.
-      assert(class_space_rs.is_reserved() && class_space_rs.size() > 0,
-             "A class space should have been reserved");
-      assert(class_space_rs.base() >= archive_space_rs.end(),
-             "class space should follow the cds archive space");
-      assert(is_aligned(archive_space_rs.base(),
-                        core_region_alignment()),
-             "Archive space misaligned");
-      assert(is_aligned(class_space_rs.base(),
-                        Metaspace::reserve_alignment()),
-             "class space misaligned");
-    }
-#endif // ASSERT
+
+#if INCLUDE_CLASS_SPACE
+    assert(archive_space_rs.base() == mapped_base_address &&
+        archive_space_rs.size() > protection_zone_size(),
+        "Archive space must lead and include the protection zone");
+    // Class space must closely follow the archive space. Both spaces
+    //  must be aligned correctly.
+    assert(class_space_rs.is_reserved() && class_space_rs.size() > 0,
+           "A class space should have been reserved");
+    assert(class_space_rs.base() >= archive_space_rs.end(),
+           "class space should follow the cds archive space");
+    assert(is_aligned(archive_space_rs.base(),
+                      core_region_alignment()),
+           "Archive space misaligned");
+    assert(is_aligned(class_space_rs.base(),
+                      Metaspace::reserve_alignment()),
+           "class space misaligned");
+#endif // INCLUDE_CLASS_SPACE
 
     aot_log_info(aot)("Reserved archive_space_rs [" INTPTR_FORMAT " - " INTPTR_FORMAT "] (%zu) bytes%s",
                    p2i(archive_space_rs.base()), p2i(archive_space_rs.end()), archive_space_rs.size(),
@@ -1764,62 +1761,60 @@ MapArchiveResult AOTMetaspace::map_archives(FileMapInfo* static_mapinfo, FileMap
 
   if (result == MAP_ARCHIVE_SUCCESS) {
     SharedBaseAddress = (size_t)mapped_base_address;
-#ifdef _LP64
-    if (Metaspace::using_class_space()) {
-      assert(prot_zone_size > 0 &&
-             *(mapped_base_address) == 'P' &&
-             *(mapped_base_address + prot_zone_size - 1) == 'P',
-             "Protection zone was overwritten?");
-      // Set up ccs in metaspace.
-      Metaspace::initialize_class_space(class_space_rs);
+#if INCLUDE_CLASS_SPACE
+    assert(prot_zone_size > 0 &&
+           *(mapped_base_address) == 'P' &&
+           *(mapped_base_address + prot_zone_size - 1) == 'P',
+           "Protection zone was overwritten?");
+    // Set up ccs in metaspace.
+    Metaspace::initialize_class_space(class_space_rs);
 
-      // Set up compressed Klass pointer encoding: the encoding range must
-      //  cover both archive and class space.
-      const address klass_range_start = (address)mapped_base_address;
-      const size_t klass_range_size = (address)class_space_rs.end() - klass_range_start;
-      if (INCLUDE_CDS_JAVA_HEAP || UseCompactObjectHeaders) {
-        // The CDS archive may contain narrow Klass IDs that were precomputed at archive generation time:
-        // - every archived java object header (only if INCLUDE_CDS_JAVA_HEAP)
-        // - every archived Klass' prototype   (only if +UseCompactObjectHeaders)
-        //
-        // In order for those IDs to still be valid, we need to dictate base and shift: base should be the
-        // mapping start (including protection zone), shift should be the shift used at archive generation time.
-        CompressedKlassPointers::initialize_for_given_encoding(
-          klass_range_start, klass_range_size,
-          klass_range_start, ArchiveBuilder::precomputed_narrow_klass_shift() // precomputed encoding, see ArchiveBuilder
-        );
-        assert(CompressedKlassPointers::base() == klass_range_start, "must be");
-      } else {
-        // Let JVM freely choose encoding base and shift
-        CompressedKlassPointers::initialize(klass_range_start, klass_range_size);
-        assert(CompressedKlassPointers::base() == nullptr ||
-               CompressedKlassPointers::base() == klass_range_start, "must be");
-      }
-      // Establish protection zone, but only if we need one
-      if (CompressedKlassPointers::base() == klass_range_start) {
-        CompressedKlassPointers::establish_protection_zone(klass_range_start, prot_zone_size);
-      }
+    // Set up compressed Klass pointer encoding: the encoding range must
+    //  cover both archive and class space.
+    const address klass_range_start = (address)mapped_base_address;
+    const size_t klass_range_size = (address)class_space_rs.end() - klass_range_start;
+    if (INCLUDE_CDS_JAVA_HEAP || UseCompactObjectHeaders) {
+      // The CDS archive may contain narrow Klass IDs that were precomputed at archive generation time:
+      // - every archived java object header (only if INCLUDE_CDS_JAVA_HEAP)
+      // - every archived Klass' prototype   (only if +UseCompactObjectHeaders)
+      //
+      // In order for those IDs to still be valid, we need to dictate base and shift: base should be the
+      // mapping start (including protection zone), shift should be the shift used at archive generation time.
+      CompressedKlassPointers::initialize_for_given_encoding(
+        klass_range_start, klass_range_size,
+        klass_range_start, ArchiveBuilder::precomputed_narrow_klass_shift() // precomputed encoding, see ArchiveBuilder
+      );
+      assert(CompressedKlassPointers::base() == klass_range_start, "must be");
+    } else {
+      // Let JVM freely choose encoding base and shift
+      CompressedKlassPointers::initialize(klass_range_start, klass_range_size);
+      assert(CompressedKlassPointers::base() == nullptr ||
+             CompressedKlassPointers::base() == klass_range_start, "must be");
+    }
+    // Establish protection zone, but only if we need one
+    if (CompressedKlassPointers::base() == klass_range_start) {
+      CompressedKlassPointers::establish_protection_zone(klass_range_start, prot_zone_size);
+    }
 
-      if (static_mapinfo->can_use_heap_region()) {
-        if (static_mapinfo->object_streaming_mode()) {
-          HeapShared::initialize_loading_mode(HeapArchiveMode::_streaming);
-        } else {
-          // map_or_load_heap_region() compares the current narrow oop and klass encodings
-          // with the archived ones, so it must be done after all encodings are determined.
-          static_mapinfo->map_or_load_heap_region();
-          HeapShared::initialize_loading_mode(HeapArchiveMode::_mapping);
-        }
+    if (static_mapinfo->can_use_heap_region()) {
+      if (static_mapinfo->object_streaming_mode()) {
+        HeapShared::initialize_loading_mode(HeapArchiveMode::_streaming);
       } else {
-        FileMapRegion* r = static_mapinfo->region_at(AOTMetaspace::hp);
-        if (r->used() > 0) {
-          AOTMetaspace::report_loading_error("Cannot use CDS heap data.");
-        }
-        if (!CDSConfig::is_dumping_static_archive()) {
-          CDSConfig::stop_using_full_module_graph("No CDS heap data");
-        }
+        // map_or_load_heap_region() compares the current narrow oop and klass encodings
+        // with the archived ones, so it must be done after all encodings are determined.
+        static_mapinfo->map_or_load_heap_region();
+        HeapShared::initialize_loading_mode(HeapArchiveMode::_mapping);
+      }
+    } else {
+      FileMapRegion* r = static_mapinfo->region_at(AOTMetaspace::hp);
+      if (r->used() > 0) {
+        AOTMetaspace::report_loading_error("Cannot use CDS heap data.");
+      }
+      if (!CDSConfig::is_dumping_static_archive()) {
+        CDSConfig::stop_using_full_module_graph("No CDS heap data");
       }
     }
-#endif // _LP64
+#endif // INCLUDE_CLASS_SPACE
     log_info(aot)("initial optimized module handling: %s", CDSConfig::is_using_optimized_module_handling() ? "enabled" : "disabled");
     log_info(aot)("initial full module graph: %s", CDSConfig::is_using_full_module_graph() ? "enabled" : "disabled");
   } else {
@@ -1852,8 +1847,13 @@ MapArchiveResult AOTMetaspace::map_archives(FileMapInfo* static_mapinfo, FileMap
 // (The gap may result from different alignment requirements between metaspace
 //  and CDS)
 //
-// If UseCompressedClassPointers is disabled, only one address space will be
-//  reserved:
+// The range encompassing both spaces will be suitable to en/decode narrow Klass
+//  pointers: the base will be valid for encoding the range [Base, End) and not
+//  surpass the max. range for that encoding.
+//
+// On 32-bit, a "narrow" Klass is just the pointer itself, and the Klass encoding
+//  range encompasses the whole address range. Consequently, we can "decode" and
+//  "encode" any pointer anywhere, and so are free to place the CDS archive anywhere:
 //
 // +-- Base address             End
 // |                            |
@@ -1867,27 +1867,21 @@ MapArchiveResult AOTMetaspace::map_archives(FileMapInfo* static_mapinfo, FileMap
 //  use_archive_base_addr address is false, this base address is determined
 //  by the platform.
 //
-// If UseCompressedClassPointers=1, the range encompassing both spaces will be
-//  suitable to en/decode narrow Klass pointers: the base will be valid for
-//  encoding, the range [Base, End) and not surpass the max. range for that encoding.
-//
 // Return:
 //
 // - On success:
 //    - total_space_rs will be reserved as whole for archive_space_rs and
-//      class_space_rs if UseCompressedClassPointers is true.
+//      class_space_rs on 64-bit.
 //      On Windows, try reserve archive_space_rs and class_space_rs
 //      separately first if use_archive_base_addr is true.
 //    - archive_space_rs will be reserved and large enough to host static and
 //      if needed dynamic archive: [Base, A).
 //      archive_space_rs.base and size will be aligned to CDS reserve
 //      granularity.
-//    - class_space_rs: If UseCompressedClassPointers=1, class_space_rs will
-//      be reserved. Its start address will be aligned to metaspace reserve
-//      alignment, which may differ from CDS alignment. It will follow the cds
-//      archive space, close enough such that narrow class pointer encoding
-//      covers both spaces.
-//      If UseCompressedClassPointers=0, class_space_rs remains unreserved.
+//    - class_space_rs: On 64-bit, class_space_rs will be reserved. Its start
+//      address will be aligned to metaspace reserve alignment, which may differ
+//      from CDS alignment. It will follow the cds archive space, close enough
+//      such that narrow class pointer encoding covers both spaces.
 // - On error: null is returned and the spaces remain unreserved.
 char* AOTMetaspace::reserve_address_space_for_archives(FileMapInfo* static_mapinfo,
                                                        FileMapInfo* dynamic_mapinfo,
@@ -1903,32 +1897,34 @@ char* AOTMetaspace::reserve_address_space_for_archives(FileMapInfo* static_mapin
   size_t archive_end_offset  = (dynamic_mapinfo == nullptr) ? static_mapinfo->mapping_end_offset() : dynamic_mapinfo->mapping_end_offset();
   size_t archive_space_size = align_up(archive_end_offset, archive_space_alignment);
 
-  if (!Metaspace::using_class_space()) {
-    // Get the simple case out of the way first:
-    // no compressed class space, simple allocation.
+#if !INCLUDE_CLASS_SPACE
 
-    // When running without class space, requested archive base should be aligned to cds core alignment.
-    assert(is_aligned(base_address, archive_space_alignment),
-             "Archive base address unaligned: " PTR_FORMAT ", needs alignment: %zu.",
-             p2i(base_address), archive_space_alignment);
+  // Get the simple case out of the way first:
+  // no compressed class space, simple allocation.
 
-    archive_space_rs = MemoryReserver::reserve((char*)base_address,
-                                               archive_space_size,
-                                               archive_space_alignment,
-                                               os::vm_page_size(),
-                                               mtNone);
-    if (archive_space_rs.is_reserved()) {
-      assert(base_address == nullptr ||
-             (address)archive_space_rs.base() == base_address, "Sanity");
-      // Register archive space with NMT.
-      MemTracker::record_virtual_memory_tag(archive_space_rs, mtClassShared);
-      return archive_space_rs.base();
-    }
-    return nullptr;
+  // When running without class space, requested archive base should be aligned to cds core alignment.
+  assert(is_aligned(base_address, archive_space_alignment),
+           "Archive base address unaligned: " PTR_FORMAT ", needs alignment: %zu.",
+           p2i(base_address), archive_space_alignment);
+
+  archive_space_rs = MemoryReserver::reserve((char*)base_address,
+                                             archive_space_size,
+                                             archive_space_alignment,
+                                             os::vm_page_size(),
+                                             mtNone);
+  if (archive_space_rs.is_reserved()) {
+    assert(base_address == nullptr ||
+           (address)archive_space_rs.base() == base_address, "Sanity");
+    // Register archive space with NMT.
+    MemTracker::record_virtual_memory_tag(archive_space_rs, mtClassShared);
+    return archive_space_rs.base();
   }
 
-#ifdef _LP64
+  return nullptr;
 
+#else
+
+  // INCLUDE_CLASS_SPACE=1
   // Complex case: two spaces adjacent to each other, both to be addressable
   //  with narrow class pointers.
   // We reserve the whole range spanning both spaces, then split that range up.
@@ -2040,11 +2036,7 @@ char* AOTMetaspace::reserve_address_space_for_archives(FileMapInfo* static_mapin
 
   return archive_space_rs.base();
 
-#else
-  ShouldNotReachHere();
-  return nullptr;
-#endif
-
+#endif // INCLUDE_CLASS_SPACE
 }
 
 void AOTMetaspace::release_reserved_spaces(ReservedSpace& total_space_rs,
diff --git a/src/hotspot/share/cds/aotStreamedHeapWriter.cpp b/src/hotspot/share/cds/aotStreamedHeapWriter.cpp
index ad363f21fdb..25bef10a673 100644
--- a/src/hotspot/share/cds/aotStreamedHeapWriter.cpp
+++ b/src/hotspot/share/cds/aotStreamedHeapWriter.cpp
@@ -369,7 +369,6 @@ template <typename T> void AOTStreamedHeapWriter::map_oop_field_in_buffer(oop ob
 }
 
 void AOTStreamedHeapWriter::update_header_for_buffered_addr(address buffered_addr, oop src_obj,  Klass* src_klass) {
-  assert(UseCompressedClassPointers, "Archived heap only supported for compressed klasses");
   narrowKlass nk = ArchiveBuilder::current()->get_requested_narrow_klass(src_klass);
 
   markWord mw = markWord::prototype();
diff --git a/src/hotspot/share/cds/archiveBuilder.cpp b/src/hotspot/share/cds/archiveBuilder.cpp
index b2d6600e44f..21eef3d7b0b 100644
--- a/src/hotspot/share/cds/archiveBuilder.cpp
+++ b/src/hotspot/share/cds/archiveBuilder.cpp
@@ -1092,20 +1092,17 @@ class RelocateBufferToRequested : public BitMapClosure {
   }
 };
 
-#ifdef _LP64
 int ArchiveBuilder::precomputed_narrow_klass_shift() {
-  // Legacy Mode:
-  //    We use 32 bits for narrowKlass, which should cover the full 4G Klass range. Shift can be 0.
+  // Standard Mode:
+  //    We use 32 bits for narrowKlass, which should cover a full 4G Klass range. Shift can be 0.
   // CompactObjectHeader Mode:
   //    narrowKlass is much smaller, and we use the highest possible shift value to later get the maximum
   //    Klass encoding range.
   //
   // Note that all of this may change in the future, if we decide to correct the pre-calculated
   // narrow Klass IDs at archive load time.
-  assert(UseCompressedClassPointers, "Only needed for compressed class pointers");
   return UseCompactObjectHeaders ?  CompressedKlassPointers::max_shift() : 0;
 }
-#endif // _LP64
 
 void ArchiveBuilder::relocate_to_requested() {
   if (!ro_region()->is_packed()) {
diff --git a/src/hotspot/share/cds/archiveBuilder.hpp b/src/hotspot/share/cds/archiveBuilder.hpp
index b3667ea11b4..6a9df87092b 100644
--- a/src/hotspot/share/cds/archiveBuilder.hpp
+++ b/src/hotspot/share/cds/archiveBuilder.hpp
@@ -484,7 +484,6 @@ public:
   void print_stats();
   void report_out_of_space(const char* name, size_t needed_bytes);
 
-#ifdef _LP64
   // The CDS archive contains pre-computed narrow Klass IDs. It carries them in the headers of
   // archived heap objects. With +UseCompactObjectHeaders, it also carries them in prototypes
   // in Klass.
@@ -504,7 +503,6 @@ public:
   // TinyClassPointer Mode:
   //    We use the highest possible shift value to maximize the encoding range size.
   static int precomputed_narrow_klass_shift();
-#endif // _LP64
 
 };
 
diff --git a/src/hotspot/share/cds/archiveUtils.cpp b/src/hotspot/share/cds/archiveUtils.cpp
index f79b1e134e8..6e0608e196b 100644
--- a/src/hotspot/share/cds/archiveUtils.cpp
+++ b/src/hotspot/share/cds/archiveUtils.cpp
@@ -360,8 +360,8 @@ char* DumpRegion::allocate_metaspace_obj(size_t num_bytes, address src, Metaspac
   bool is_instance_class = is_class && ((Klass*)src)->is_instance_klass();
 
 #ifdef _LP64
-  // More strict alignments needed for UseCompressedClassPointers
-  if (is_class && UseCompressedClassPointers) {
+  // More strict alignments needed for Klass objects
+  if (is_class) {
     size_t klass_alignment = checked_cast<size_t>(nth_bit(ArchiveBuilder::precomputed_narrow_klass_shift()));
     alignment = MAX2(alignment, klass_alignment);
     precond(is_aligned(alignment, SharedSpaceObjectAlignment));
diff --git a/src/hotspot/share/cds/cdsConfig.cpp b/src/hotspot/share/cds/cdsConfig.cpp
index 9d191bf0121..ecf3c6d2231 100644
--- a/src/hotspot/share/cds/cdsConfig.cpp
+++ b/src/hotspot/share/cds/cdsConfig.cpp
@@ -891,10 +891,6 @@ const char* CDSConfig::type_of_archive_being_written() {
 // If an incompatible VM options is found, return a text message that explains why
 static const char* check_options_incompatible_with_dumping_heap() {
 #if INCLUDE_CDS_JAVA_HEAP
-  if (!UseCompressedClassPointers) {
-    return "UseCompressedClassPointers must be true";
-  }
-
   return nullptr;
 #else
   return "JVM not configured for writing Java heap objects";
diff --git a/src/hotspot/share/cds/filemap.cpp b/src/hotspot/share/cds/filemap.cpp
index a07f13cefca..38502b2b2d8 100644
--- a/src/hotspot/share/cds/filemap.cpp
+++ b/src/hotspot/share/cds/filemap.cpp
@@ -225,15 +225,9 @@ void FileMapHeader::populate(FileMapInfo *info, size_t core_region_alignment,
   }
 #endif
   _compressed_oops = UseCompressedOops;
-  _compressed_class_ptrs = UseCompressedClassPointers;
-  if (UseCompressedClassPointers) {
-#ifdef _LP64
-    _narrow_klass_pointer_bits = CompressedKlassPointers::narrow_klass_pointer_bits();
-    _narrow_klass_shift = ArchiveBuilder::precomputed_narrow_klass_shift();
-#endif
-  } else {
-    _narrow_klass_pointer_bits = _narrow_klass_shift = -1;
-  }
+  _narrow_klass_pointer_bits = CompressedKlassPointers::narrow_klass_pointer_bits();
+  _narrow_klass_shift = ArchiveBuilder::precomputed_narrow_klass_shift();
+
   // Which JIT compier is used
   _compiler_type = (u1)CompilerConfig::compiler_type();
   _type_profile_level = TypeProfileLevel;
@@ -295,7 +289,6 @@ void FileMapHeader::print(outputStream* st) {
   st->print_cr("- max_heap_size:                            %zu", _max_heap_size);
   st->print_cr("- narrow_oop_mode:                          %d", _narrow_oop_mode);
   st->print_cr("- compressed_oops:                          %d", _compressed_oops);
-  st->print_cr("- compressed_class_ptrs:                    %d", _compressed_class_ptrs);
   st->print_cr("- narrow_klass_pointer_bits:                %d", _narrow_klass_pointer_bits);
   st->print_cr("- narrow_klass_shift:                       %d", _narrow_klass_shift);
   st->print_cr("- cloned_vtables:                           %u", cast_to_u4(_cloned_vtables));
@@ -1926,11 +1919,12 @@ bool FileMapHeader::validate() {
     _has_platform_or_app_classes = false;
   }
 
-  aot_log_info(aot)("The %s was created with UseCompressedOops = %d, UseCompressedClassPointers = %d, UseCompactObjectHeaders = %d",
-                          file_type, compressed_oops(), compressed_class_pointers(), compact_headers());
-  if (compressed_oops() != UseCompressedOops || compressed_class_pointers() != UseCompressedClassPointers) {
-    aot_log_warning(aot)("Unable to use %s.\nThe saved state of UseCompressedOops and UseCompressedClassPointers is "
-                               "different from runtime, CDS will be disabled.", file_type);
+  aot_log_info(aot)("The %s was created with UseCompressedOops = %d, UseCompactObjectHeaders = %d",
+                          file_type, compressed_oops(), compact_headers());
+  if (compressed_oops() != UseCompressedOops) {
+    aot_log_warning(aot)("Unable to use %s.\nThe saved state of UseCompressedOops (%d) is "
+                               "different from runtime (%d), CDS will be disabled.", file_type,
+                               compressed_oops(), UseCompressedOops);
     return false;
   }
 
diff --git a/src/hotspot/share/cds/filemap.hpp b/src/hotspot/share/cds/filemap.hpp
index 56b88df378a..bae08bd5bc7 100644
--- a/src/hotspot/share/cds/filemap.hpp
+++ b/src/hotspot/share/cds/filemap.hpp
@@ -120,7 +120,6 @@ private:
   CompressedOops::Mode _narrow_oop_mode;          // compressed oop encoding mode
   bool    _object_streaming_mode;                 // dump was created for object streaming
   bool    _compressed_oops;                       // save the flag UseCompressedOops
-  bool    _compressed_class_ptrs;                 // save the flag UseCompressedClassPointers
   int     _narrow_klass_pointer_bits;             // save number of bits in narrowKlass
   int     _narrow_klass_shift;                    // save shift width used to pre-compute narrowKlass IDs in archived heap objects
   narrowPtr _cloned_vtables;                      // The address of the first cloned vtable
@@ -200,7 +199,6 @@ public:
   bool has_platform_or_app_classes()       const { return _has_platform_or_app_classes; }
   bool has_aot_linked_classes()            const { return _has_aot_linked_classes; }
   bool compressed_oops()                   const { return _compressed_oops; }
-  bool compressed_class_pointers()         const { return _compressed_class_ptrs; }
   int narrow_klass_pointer_bits()          const { return _narrow_klass_pointer_bits; }
   int narrow_klass_shift()                 const { return _narrow_klass_shift; }
   bool has_full_module_graph()             const { return _has_full_module_graph; }
diff --git a/src/hotspot/share/classfile/systemDictionaryShared.cpp b/src/hotspot/share/classfile/systemDictionaryShared.cpp
index 5947050e31a..58d432a628c 100644
--- a/src/hotspot/share/classfile/systemDictionaryShared.cpp
+++ b/src/hotspot/share/classfile/systemDictionaryShared.cpp
@@ -89,11 +89,9 @@ DEBUG_ONLY(bool SystemDictionaryShared::_class_loading_may_happen = true;)
 
 #ifdef ASSERT
 static void check_klass_after_loading(const Klass* k) {
-#ifdef _LP64
-  if (k != nullptr && UseCompressedClassPointers) {
+  if (k != nullptr) {
     CompressedKlassPointers::check_encodable(k);
   }
-#endif
 }
 #endif
 
diff --git a/src/hotspot/share/code/aotCodeCache.cpp b/src/hotspot/share/code/aotCodeCache.cpp
index b29cf906736..4ad5e12d808 100644
--- a/src/hotspot/share/code/aotCodeCache.cpp
+++ b/src/hotspot/share/code/aotCodeCache.cpp
@@ -388,9 +388,6 @@ void AOTCodeCache::Config::record(uint cpu_features_offset) {
   if (UseCompressedOops) {
     _flags |= compressedOops;
   }
-  if (UseCompressedClassPointers) {
-    _flags |= compressedClassPointers;
-  }
   if (UseTLAB) {
     _flags |= useTLAB;
   }
@@ -474,10 +471,6 @@ bool AOTCodeCache::Config::verify(AOTCodeCache* cache) const {
     return false;
   }
 
-  if (((_flags & compressedClassPointers) != 0) != UseCompressedClassPointers) {
-    log_debug(aot, codecache, init)("AOT Code Cache disabled: it was created with UseCompressedClassPointers = %s", UseCompressedClassPointers ? "false" : "true");
-    return false;
-  }
   if (_compressedKlassShift != (uint)CompressedKlassPointers::shift()) {
     log_debug(aot, codecache, init)("AOT Code Cache disabled: it was created with CompressedKlassPointers::shift() = %d vs current %d", _compressedKlassShift, CompressedKlassPointers::shift());
     return false;
diff --git a/src/hotspot/share/code/aotCodeCache.hpp b/src/hotspot/share/code/aotCodeCache.hpp
index bd8721fea8c..7996388faa6 100644
--- a/src/hotspot/share/code/aotCodeCache.hpp
+++ b/src/hotspot/share/code/aotCodeCache.hpp
@@ -177,12 +177,11 @@ protected:
       none                     = 0,
       debugVM                  = 1,
       compressedOops           = 2,
-      compressedClassPointers  = 4,
-      useTLAB                  = 8,
-      systemClassAssertions    = 16,
-      userClassAssertions      = 32,
-      enableContendedPadding   = 64,
-      restrictContendedPadding = 128
+      useTLAB                  = 4,
+      systemClassAssertions    = 8,
+      userClassAssertions      = 16,
+      enableContendedPadding   = 32,
+      restrictContendedPadding = 64
     };
     uint _flags;
     uint _cpu_features_offset; // offset in the cache where cpu features are stored
diff --git a/src/hotspot/share/code/compiledIC.cpp b/src/hotspot/share/code/compiledIC.cpp
index 5f5c9711441..07d96d6cd44 100644
--- a/src/hotspot/share/code/compiledIC.cpp
+++ b/src/hotspot/share/code/compiledIC.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1997, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -76,11 +76,7 @@ CompiledICData::CompiledICData()
 // Inline cache callsite info is initialized once the first time it is resolved
 void CompiledICData::initialize(CallInfo* call_info, Klass* receiver_klass) {
   _speculated_method = call_info->selected_method();
-  if (UseCompressedClassPointers) {
-    _speculated_klass = (uintptr_t)CompressedKlassPointers::encode_not_null(receiver_klass);
-  } else {
-    _speculated_klass = (uintptr_t)receiver_klass;
-  }
+  _speculated_klass = (uintptr_t)CompressedKlassPointers::encode_not_null(receiver_klass);
   if (call_info->call_kind() == CallInfo::itable_call) {
     assert(call_info->resolved_method() != nullptr, "virtual or interface method must be found");
     _itable_defc_klass = call_info->resolved_method()->method_holder();
@@ -133,12 +129,7 @@ Klass* CompiledICData::speculated_klass() const {
   if (is_speculated_klass_unloaded()) {
     return nullptr;
   }
-
-  if (UseCompressedClassPointers) {
-    return CompressedKlassPointers::decode_not_null((narrowKlass)_speculated_klass);
-  } else {
-    return (Klass*)_speculated_klass;
-  }
+  return CompressedKlassPointers::decode_not_null((narrowKlass)_speculated_klass);
 }
 
 //-----------------------------------------------------------------------------
diff --git a/src/hotspot/share/gc/shared/c2/barrierSetC2.cpp b/src/hotspot/share/gc/shared/c2/barrierSetC2.cpp
index a888ea81707..afe7d2acfa7 100644
--- a/src/hotspot/share/gc/shared/c2/barrierSetC2.cpp
+++ b/src/hotspot/share/gc/shared/c2/barrierSetC2.cpp
@@ -708,7 +708,6 @@ int BarrierSetC2::arraycopy_payload_base_offset(bool is_array) {
   // 12 - 64-bit VM, compressed klass
   // 16 - 64-bit VM, normal klass
   if (base_off % BytesPerLong != 0) {
-    assert(UseCompressedClassPointers, "");
     assert(!UseCompactObjectHeaders, "");
     if (is_array) {
       // Exclude length to copy by 8 bytes words.
diff --git a/src/hotspot/share/gc/shared/gcTrace.cpp b/src/hotspot/share/gc/shared/gcTrace.cpp
index bad9c707b1e..5d0627e779e 100644
--- a/src/hotspot/share/gc/shared/gcTrace.cpp
+++ b/src/hotspot/share/gc/shared/gcTrace.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2012, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2012, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -122,11 +122,10 @@ void GCTracer::report_gc_heap_summary(GCWhen::Type when, const GCHeapSummary& he
 
 void GCTracer::report_metaspace_summary(GCWhen::Type when, const MetaspaceSummary& summary) const {
   send_meta_space_summary_event(when, summary);
-
   send_metaspace_chunk_free_list_summary(when, Metaspace::NonClassType, summary.metaspace_chunk_free_list_summary());
-  if (UseCompressedClassPointers) {
-    send_metaspace_chunk_free_list_summary(when, Metaspace::ClassType, summary.class_chunk_free_list_summary());
-  }
+#if INCLUDE_CLASS_SPACE
+  send_metaspace_chunk_free_list_summary(when, Metaspace::ClassType, summary.class_chunk_free_list_summary());
+#endif
 }
 
 void YoungGCTracer::report_gc_end_impl(const Ticks& timestamp, TimePartitions* time_partitions) {
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahAsserts.cpp b/src/hotspot/share/gc/shenandoah/shenandoahAsserts.cpp
index baeaffb9c7b..268f5b13035 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahAsserts.cpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahAsserts.cpp
@@ -559,26 +559,24 @@ bool ShenandoahAsserts::extract_klass_safely(oop obj, narrowKlass& nk, const Kla
   if (!os::is_readable_pointer(obj)) {
     return false;
   }
-  if (UseCompressedClassPointers) {
-    if (UseCompactObjectHeaders) { // look in forwardee
-      markWord mark = obj->mark();
-      if (mark.is_marked()) {
-        oop fwd = cast_to_oop(mark.clear_lock_bits().to_pointer());
-        if (!os::is_readable_pointer(fwd)) {
-          return false;
-        }
-        mark = fwd->mark();
+
+  if (UseCompactObjectHeaders) { // look in forwardee
+    markWord mark = obj->mark();
+    if (mark.is_marked()) {
+      oop fwd = cast_to_oop(mark.clear_lock_bits().to_pointer());
+      if (!os::is_readable_pointer(fwd)) {
+        return false;
       }
-      nk = mark.narrow_klass();
-    } else {
-      nk = obj->narrow_klass();
+      mark = fwd->mark();
     }
-    if (!CompressedKlassPointers::is_valid_narrow_klass_id(nk)) {
-      return false;
-    }
-    k = CompressedKlassPointers::decode_not_null_without_asserts(nk);
+    nk = mark.narrow_klass();
   } else {
-    k = obj->klass();
+    nk = obj->narrow_klass();
   }
+  if (!CompressedKlassPointers::is_valid_narrow_klass_id(nk)) {
+    return false;
+  }
+  k = CompressedKlassPointers::decode_not_null_without_asserts(nk);
+
   return k != nullptr;
 }
diff --git a/src/hotspot/share/gc/z/c2/zBarrierSetC2.cpp b/src/hotspot/share/gc/z/c2/zBarrierSetC2.cpp
index 650918e2d30..0a3dac1e100 100644
--- a/src/hotspot/share/gc/z/c2/zBarrierSetC2.cpp
+++ b/src/hotspot/share/gc/z/c2/zBarrierSetC2.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2015, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2015, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -442,7 +442,7 @@ void ZBarrierSetC2::clone_at_expansion(PhaseMacroExpand* phase, ArrayCopyNode* a
       assert(src_offset == dest_offset, "should be equal");
       const jlong offset = src_offset->get_long();
       if (offset != arrayOopDesc::base_offset_in_bytes(T_OBJECT)) {
-        assert(!UseCompressedClassPointers || UseCompactObjectHeaders, "should only happen without compressed class pointers");
+        assert(UseCompactObjectHeaders, "should only happen with COH");
         assert((arrayOopDesc::base_offset_in_bytes(T_OBJECT) - offset) == BytesPerLong, "unexpected offset");
         length = phase->transform_later(new SubLNode(length, phase->longcon(1))); // Size is in longs
         src_offset = phase->longcon(arrayOopDesc::base_offset_in_bytes(T_OBJECT));
diff --git a/src/hotspot/share/gc/z/zDebug.gdb b/src/hotspot/share/gc/z/zDebug.gdb
index d502eea7ce3..df087c4a42d 100644
--- a/src/hotspot/share/gc/z/zDebug.gdb
+++ b/src/hotspot/share/gc/z/zDebug.gdb
@@ -50,11 +50,7 @@ define zpo
     end
     printf "\t Page: %llu\n", ((uintptr_t)$obj & ZAddressOffsetMask) >> ZGranuleSizeShift
     x/16gx $obj
-    if (UseCompressedClassPointers)
-        set $klass = (Klass*)(void*)((uintptr_t)CompressedKlassPointers::_base +((uintptr_t)$obj->_metadata->_compressed_klass << CompressedKlassPointers::_shift))
-    else
-        set $klass = $obj->_metadata->_klass
-    end
+    set $klass = (Klass*)(void*)((uintptr_t)CompressedKlassPointers::_base +((uintptr_t)$obj->_compressed_klass << CompressedKlassPointers::_shift))
     printf "Mark:  0x%016llx\tKlass: %s\n", (uintptr_t)$obj->_mark, (char*)$klass->_name->_body
 end
 
diff --git a/src/hotspot/share/jfr/recorder/checkpoint/types/traceid/jfrTraceIdKlassQueue.cpp b/src/hotspot/share/jfr/recorder/checkpoint/types/traceid/jfrTraceIdKlassQueue.cpp
index 9c57374d6c6..eab7de20545 100644
--- a/src/hotspot/share/jfr/recorder/checkpoint/types/traceid/jfrTraceIdKlassQueue.cpp
+++ b/src/hotspot/share/jfr/recorder/checkpoint/types/traceid/jfrTraceIdKlassQueue.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2020, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -75,7 +75,7 @@ static size_t element_size(bool compressed) {
 }
 
 static bool can_compress_element(traceid id) {
-  return Metaspace::using_class_space() && id < uncompressed_threshold;
+  return INCLUDE_CLASS_SPACE == 1 && id < uncompressed_threshold;
 }
 
 static size_t element_size(const Klass* klass) {
diff --git a/src/hotspot/share/jvmci/jvmciCompilerToVMInit.cpp b/src/hotspot/share/jvmci/jvmciCompilerToVMInit.cpp
index 6214f6a2746..6048c19d911 100644
--- a/src/hotspot/share/jvmci/jvmciCompilerToVMInit.cpp
+++ b/src/hotspot/share/jvmci/jvmciCompilerToVMInit.cpp
@@ -206,13 +206,8 @@ void CompilerToVM::Data::initialize(JVMCI_TRAPS) {
     Universe_narrow_oop_base = nullptr;
     Universe_narrow_oop_shift = 0;
   }
-  if (UseCompressedClassPointers) {
-    Universe_narrow_klass_base = CompressedKlassPointers::base();
-    Universe_narrow_klass_shift = CompressedKlassPointers::shift();
-  } else {
-    Universe_narrow_klass_base = nullptr;
-    Universe_narrow_klass_shift = 0;
-  }
+  Universe_narrow_klass_base = CompressedKlassPointers::base();
+  Universe_narrow_klass_shift = CompressedKlassPointers::shift();
   Universe_non_oop_bits = Universe::non_oop_word();
   Universe_verify_oop_mask = Universe::verify_oop_mask();
   Universe_verify_oop_bits = Universe::verify_oop_bits();
@@ -390,7 +385,6 @@ JVMCIObjectArray CompilerToVM::initialize_intrinsics(JVMCI_TRAPS) {
   X86_ONLY(do_int_flag(UseAVX))                                            \
   do_bool_flag(UseCRC32Intrinsics)                                         \
   do_bool_flag(UseAdler32Intrinsics)                                       \
-  do_bool_flag(UseCompressedClassPointers)                                 \
   do_bool_flag(UseCompressedOops)                                          \
   X86_ONLY(do_bool_flag(UseCountLeadingZerosInstruction))                  \
   X86_ONLY(do_bool_flag(UseCountTrailingZerosInstruction))                 \
diff --git a/src/hotspot/share/jvmci/vmStructs_jvmci.cpp b/src/hotspot/share/jvmci/vmStructs_jvmci.cpp
index ac532e1bb4c..1fdf98588fd 100644
--- a/src/hotspot/share/jvmci/vmStructs_jvmci.cpp
+++ b/src/hotspot/share/jvmci/vmStructs_jvmci.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2015, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2015, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -342,7 +342,7 @@
   volatile_nonstatic_field(ObjectMonitor,      _succ,                                         int64_t)                               \
                                                                                                                                      \
   volatile_nonstatic_field(oopDesc,            _mark,                                         markWord)                              \
-  volatile_nonstatic_field(oopDesc,            _metadata._klass,                              Klass*)                                \
+  volatile_nonstatic_field(oopDesc,            _compressed_klass,                             narrowKlass)                           \
                                                                                                                                      \
   static_field(StubRoutines,                _verify_oop_count,                                jint)                                  \
                                                                                                                                      \
diff --git a/src/hotspot/share/memory/classLoaderMetaspace.cpp b/src/hotspot/share/memory/classLoaderMetaspace.cpp
index c1ff172071d..af3b8b1b77f 100644
--- a/src/hotspot/share/memory/classLoaderMetaspace.cpp
+++ b/src/hotspot/share/memory/classLoaderMetaspace.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2020, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
  * Copyright (c) 2020 SAP SE. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
@@ -162,10 +162,12 @@ void ClassLoaderMetaspace::deallocate(MetaWord* ptr, size_t word_size) {
   MetaBlock bl(ptr, word_size);
   // Add to class arena only if block is usable for encodable Klass storage.
   MetaspaceArena* receiving_arena = non_class_space_arena();
-  if (Metaspace::using_class_space() && Metaspace::is_in_class_space(ptr) &&
+#if INCLUDE_CLASS_SPACE
+  if (Metaspace::is_in_class_space(ptr) &&
       is_aligned(ptr, class_space_arena()->allocation_alignment_bytes())) {
     receiving_arena = class_space_arena();
   }
+#endif
   receiving_arena->deallocate(bl);
   DEBUG_ONLY(InternalStats::inc_num_deallocs();)
 }
diff --git a/src/hotspot/share/memory/classLoaderMetaspace.hpp b/src/hotspot/share/memory/classLoaderMetaspace.hpp
index aa43e171708..dc782611e98 100644
--- a/src/hotspot/share/memory/classLoaderMetaspace.hpp
+++ b/src/hotspot/share/memory/classLoaderMetaspace.hpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2011, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2011, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -40,9 +40,10 @@ namespace metaspace {
 
 // A ClassLoaderMetaspace manages MetaspaceArena(s) for a CLD.
 //
-// A CLD owns one MetaspaceArena if UseCompressedClassPointers is false. Otherwise
-// it owns two - one for the Klass* objects from the class space, one for the other
-// types of MetaspaceObjs from the non-class space.
+// 64-bit:
+//
+// A CLD owns two MetaspaceArenas - one for the Klass* objects from the class space,
+// one for the other types of MetaspaceObjs from the non-class space.
 //
 // +------+       +----------------------+       +-------------------+
 // | CLD  | --->  | ClassLoaderMetaspace | ----> | (non class) Arena |
@@ -58,6 +59,11 @@ namespace metaspace {
 //                                                               ^
 //                                                               alloc top
 //
+// 32-bit:
+//
+// A CLD owns just one MetaspaceArena. In that arena all metadata - Klass and other -
+// are placed.
+
 class ClassLoaderMetaspace : public CHeapObj<mtClass> {
   friend class metaspace::ClmsTester; // for gtests
 
@@ -67,11 +73,10 @@ class ClassLoaderMetaspace : public CHeapObj<mtClass> {
   const Metaspace::MetaspaceType _space_type;
 
   // Arena for allocations from non-class  metaspace
-  //  (resp. for all allocations if -XX:-UseCompressedClassPointers).
   metaspace::MetaspaceArena* _non_class_space_arena;
 
   // Arena for allocations from class space
-  //  (null if -XX:-UseCompressedClassPointers).
+  //  (null for 32-bit).
   metaspace::MetaspaceArena* _class_space_arena;
 
   Mutex* lock() const                             { return _lock; }
diff --git a/src/hotspot/share/memory/metaspace.cpp b/src/hotspot/share/memory/metaspace.cpp
index e686b324004..da6ebc991c8 100644
--- a/src/hotspot/share/memory/metaspace.cpp
+++ b/src/hotspot/share/memory/metaspace.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2011, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2011, 2026, Oracle and/or its affiliates. All rights reserved.
  * Copyright (c) 2017, 2021 SAP SE. All rights reserved.
  * Copyright (c) 2023, 2025, Red Hat, Inc. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
@@ -166,33 +166,33 @@ void MetaspaceUtils::print_metaspace_change(const MetaspaceCombinedStats& pre_me
   // it is a constant (to uninformed users, often confusingly large). For non-class space, it would
   // be interesting since free chunks can be uncommitted, but for now it is left out.
 
-  if (Metaspace::using_class_space()) {
-    log_info(gc, metaspace)(HEAP_CHANGE_FORMAT" "
-                            HEAP_CHANGE_FORMAT" "
-                            HEAP_CHANGE_FORMAT,
-                            HEAP_CHANGE_FORMAT_ARGS("Metaspace",
-                                                    pre_meta_values.used(),
-                                                    pre_meta_values.committed(),
-                                                    meta_values.used(),
-                                                    meta_values.committed()),
-                            HEAP_CHANGE_FORMAT_ARGS("NonClass",
-                                                    pre_meta_values.non_class_used(),
-                                                    pre_meta_values.non_class_committed(),
-                                                    meta_values.non_class_used(),
-                                                    meta_values.non_class_committed()),
-                            HEAP_CHANGE_FORMAT_ARGS("Class",
-                                                    pre_meta_values.class_used(),
-                                                    pre_meta_values.class_committed(),
-                                                    meta_values.class_used(),
-                                                    meta_values.class_committed()));
-  } else {
-    log_info(gc, metaspace)(HEAP_CHANGE_FORMAT,
-                            HEAP_CHANGE_FORMAT_ARGS("Metaspace",
-                                                    pre_meta_values.used(),
-                                                    pre_meta_values.committed(),
-                                                    meta_values.used(),
-                                                    meta_values.committed()));
-  }
+#if INCLUDE_CLASS_SPACE
+  log_info(gc, metaspace)(HEAP_CHANGE_FORMAT" "
+                          HEAP_CHANGE_FORMAT" "
+                          HEAP_CHANGE_FORMAT,
+                          HEAP_CHANGE_FORMAT_ARGS("Metaspace",
+                                                  pre_meta_values.used(),
+                                                  pre_meta_values.committed(),
+                                                  meta_values.used(),
+                                                  meta_values.committed()),
+                          HEAP_CHANGE_FORMAT_ARGS("NonClass",
+                                                  pre_meta_values.non_class_used(),
+                                                  pre_meta_values.non_class_committed(),
+                                                  meta_values.non_class_used(),
+                                                  meta_values.non_class_committed()),
+                          HEAP_CHANGE_FORMAT_ARGS("Class",
+                                                  pre_meta_values.class_used(),
+                                                  pre_meta_values.class_committed(),
+                                                  meta_values.class_used(),
+                                                  meta_values.class_committed()));
+#else
+  log_info(gc, metaspace)(HEAP_CHANGE_FORMAT,
+                          HEAP_CHANGE_FORMAT_ARGS("Metaspace",
+                                                  pre_meta_values.used(),
+                                                  pre_meta_values.committed(),
+                                                  meta_values.used(),
+                                                  meta_values.committed()));
+#endif // INCLUDE_CLASS_SPACE
 }
 
 // This will print out a basic metaspace usage report but
@@ -226,41 +226,36 @@ void MetaspaceUtils::print_on(outputStream* out) {
                 stats.committed()/K,
                 stats.reserved()/K);
 
-  if (Metaspace::using_class_space()) {
-    StreamIndentor si(out, 1);
-    out->print("class space ");
-    out->fill_to(17);
-    out->print_cr("used %zuK, "
-                  "committed %zuK, "
-                  "reserved %zuK",
-                  stats.class_space_stats().used()/K,
-                  stats.class_space_stats().committed()/K,
-                  stats.class_space_stats().reserved()/K);
-  }
+#if INCLUDE_CLASS_SPACE
+  StreamIndentor si(out, 1);
+  out->print("class space ");
+  out->fill_to(17);
+  out->print_cr("used %zuK, "
+                "committed %zuK, "
+                "reserved %zuK",
+                stats.class_space_stats().used()/K,
+                stats.class_space_stats().committed()/K,
+                stats.class_space_stats().reserved()/K);
+#endif // INCLUDE_CLASS_SPACE
 }
 
 #ifdef ASSERT
 void MetaspaceUtils::verify() {
   if (Metaspace::initialized()) {
 
-    // Verify non-class chunkmanager...
     ChunkManager* cm = ChunkManager::chunkmanager_nonclass();
     cm->verify();
 
-    // ... and space list.
     VirtualSpaceList* vsl = VirtualSpaceList::vslist_nonclass();
     vsl->verify();
 
-    if (Metaspace::using_class_space()) {
-      // If we use compressed class pointers, verify class chunkmanager...
-      cm = ChunkManager::chunkmanager_class();
-      cm->verify();
-
-      // ... and class spacelist.
-      vsl = VirtualSpaceList::vslist_class();
-      vsl->verify();
-    }
+#if INCLUDE_CLASS_SPACE
+    cm = ChunkManager::chunkmanager_class();
+    cm->verify();
 
+    vsl = VirtualSpaceList::vslist_class();
+    vsl->verify();
+#endif // INCLUDE_CLASS_SPACE
   }
 }
 #endif
@@ -387,7 +382,8 @@ void MetaspaceGC::post_initialize() {
 
 bool MetaspaceGC::can_expand(size_t word_size, bool is_class) {
   // Check if the compressed class space is full.
-  if (is_class && Metaspace::using_class_space()) {
+#if INCLUDE_CLASS_SPACE
+  if (is_class) {
     size_t class_committed = MetaspaceUtils::committed_bytes(Metaspace::ClassType);
     if (class_committed + word_size * BytesPerWord > CompressedClassSpaceSize) {
       log_trace(gc, metaspace, freelist)("Cannot expand %s metaspace by %zu words (CompressedClassSpaceSize = %zu words)",
@@ -395,6 +391,7 @@ bool MetaspaceGC::can_expand(size_t word_size, bool is_class) {
       return false;
     }
   }
+#endif // INCLUDE_CLASS_SPACE
 
   // Check if the user has imposed a limit on the metaspace memory.
   size_t committed_bytes = MetaspaceUtils::committed_bytes();
@@ -548,7 +545,7 @@ const void* Metaspace::_class_space_end = nullptr;
 
 bool Metaspace::initialized() {
   return metaspace::MetaspaceContext::context_nonclass() != nullptr
-      LP64_ONLY(&& (using_class_space() ? Metaspace::class_space_is_initialized() : true));
+         CLASS_SPACE_ONLY(&& Metaspace::class_space_is_initialized());
 }
 
 #ifdef _LP64
@@ -566,9 +563,9 @@ void Metaspace::print_compressed_class_space(outputStream* st) {
 
 // Given a prereserved space, use that to set up the compressed class space list.
 void Metaspace::initialize_class_space(ReservedSpace rs) {
+  STATIC_ASSERT(INCLUDE_CLASS_SPACE == 1);
   assert(rs.size() >= CompressedClassSpaceSize,
          "%zu != %zu", rs.size(), CompressedClassSpaceSize);
-  assert(using_class_space(), "Must be using class space");
 
   assert(rs.size() == CompressedClassSpaceSize, "%zu != %zu",
          rs.size(), CompressedClassSpaceSize);
@@ -658,49 +655,51 @@ void Metaspace::ergo_initialize() {
 
   MaxMetaspaceSize = MAX2(MaxMetaspaceSize, commit_alignment());
 
-  if (UseCompressedClassPointers) {
-    // Let Class Space not be larger than 80% of MaxMetaspaceSize. Note that is
-    // grossly over-dimensioned for most usage scenarios; typical ratio of
-    // class space : non class space usage is about 1:6. With many small classes,
-    // it can get as low as 1:2. It is not a big deal though since ccs is only
-    // reserved and will be committed on demand only.
-    const size_t max_ccs_size = 8 * (MaxMetaspaceSize / 10);
+#if INCLUDE_CLASS_SPACE
 
-    // Sanity check.
-    const size_t max_klass_range = CompressedKlassPointers::max_klass_range_size();
-    assert(max_klass_range >= reserve_alignment(),
-           "Klass range (%zu) must cover at least a full root chunk (%zu)",
-           max_klass_range, reserve_alignment());
+  // Let Class Space not be larger than 80% of MaxMetaspaceSize. Note that is
+  // grossly over-dimensioned for most usage scenarios; typical ratio of
+  // class space : non class space usage is about 1:6. With many small classes,
+  // it can get as low as 1:2. It is not a big deal though since ccs is only
+  // reserved and will be committed on demand only.
+  const size_t max_ccs_size = 8 * (MaxMetaspaceSize / 10);
 
-    size_t adjusted_ccs_size = MIN3(CompressedClassSpaceSize, max_ccs_size, max_klass_range);
+  // Sanity check.
+  const size_t max_klass_range = CompressedKlassPointers::max_klass_range_size();
+  assert(max_klass_range >= reserve_alignment(),
+         "Klass range (%zu) must cover at least a full root chunk (%zu)",
+         max_klass_range, reserve_alignment());
 
-    // CCS must be aligned to root chunk size, and be at least the size of one
-    //  root chunk.
-    adjusted_ccs_size = align_up(adjusted_ccs_size, reserve_alignment());
-    adjusted_ccs_size = MAX2(adjusted_ccs_size, reserve_alignment());
+  size_t adjusted_ccs_size = MIN3(CompressedClassSpaceSize, max_ccs_size, max_klass_range);
 
-    // Print a warning if the adjusted size differs from the users input
-    if (CompressedClassSpaceSize != adjusted_ccs_size) {
-      #define X "CompressedClassSpaceSize adjusted from user input " \
-                "%zu bytes to %zu bytes", CompressedClassSpaceSize, adjusted_ccs_size
-      if (FLAG_IS_CMDLINE(CompressedClassSpaceSize)) {
-        log_warning(metaspace)(X);
-      } else {
-        log_info(metaspace)(X);
-      }
-      #undef X
-    }
-
-    // Note: re-adjusting may have us left with a CompressedClassSpaceSize
-    //  larger than MaxMetaspaceSize for very small values of MaxMetaspaceSize.
-    //  Lets just live with that, its not a big deal.
-    if (adjusted_ccs_size != CompressedClassSpaceSize) {
-      FLAG_SET_ERGO(CompressedClassSpaceSize, adjusted_ccs_size);
-      log_info(metaspace)("Setting CompressedClassSpaceSize to %zu.",
-                          CompressedClassSpaceSize);
+  // CCS must be aligned to root chunk size, and be at least the size of one
+  //  root chunk.
+  adjusted_ccs_size = align_up(adjusted_ccs_size, reserve_alignment());
+  adjusted_ccs_size = MAX2(adjusted_ccs_size, reserve_alignment());
+
+  // Print a warning if the adjusted size differs from the users input
+  if (CompressedClassSpaceSize != adjusted_ccs_size) {
+    #define X "CompressedClassSpaceSize adjusted from user input " \
+              "%zu bytes to %zu bytes", CompressedClassSpaceSize, adjusted_ccs_size
+    if (FLAG_IS_CMDLINE(CompressedClassSpaceSize)) {
+      log_warning(metaspace)(X);
+    } else {
+      log_info(metaspace)(X);
     }
+    #undef X
   }
 
+  // Note: re-adjusting may have us left with a CompressedClassSpaceSize
+  //  larger than MaxMetaspaceSize for very small values of MaxMetaspaceSize.
+  //  Lets just live with that, its not a big deal.
+  if (adjusted_ccs_size != CompressedClassSpaceSize) {
+    FLAG_SET_ERGO(CompressedClassSpaceSize, adjusted_ccs_size);
+    log_info(metaspace)("Setting CompressedClassSpaceSize to %zu.",
+                        CompressedClassSpaceSize);
+  }
+
+#endif // INCLUDE_CLASS_SPACE
+
   // Set MetaspaceSize, MinMetaspaceExpansion and MaxMetaspaceExpansion
   if (MetaspaceSize > MaxMetaspaceSize) {
     MetaspaceSize = MaxMetaspaceSize;
@@ -724,15 +723,12 @@ void Metaspace::global_initialize() {
     AOTMetaspace::initialize_for_static_dump();
   }
 
-  // If UseCompressedClassPointers=1, we have two cases:
+  // We have two cases:
   // a) if CDS is active (runtime, Xshare=on), it will create the class space
-  //    for us, initialize it and set up CompressedKlassPointers encoding.
-  //    Class space will be reserved above the mapped archives.
+  //    for us. It then will set up encoding to cover both CDS archive space and class space.
   // b) if CDS either deactivated (Xshare=off) or a static dump is to be done (Xshare:dump),
-  //    we will create the class space on our own. It will be placed above the java heap,
-  //    since we assume it has been placed in low
-  //    address regions. We may rethink this (see JDK-8244943). Failing that,
-  //    it will be placed anywhere.
+  //    we will create the class space on our own and set up encoding to only cover the
+  //    class space.
 
 #if INCLUDE_CDS
   // case (a)
@@ -746,9 +742,9 @@ void Metaspace::global_initialize() {
   }
 #endif // INCLUDE_CDS
 
-#ifdef _LP64
+#if INCLUDE_CLASS_SPACE
 
-  if (using_class_space() && !class_space_is_initialized()) {
+  if (!class_space_is_initialized()) {
     assert(!CDSConfig::is_using_archive(), "CDS archive is not mapped at this point");
 
     // case (b) (No CDS)
@@ -835,28 +831,23 @@ void Metaspace::global_initialize() {
   }
 
 #else
-  // +UseCompressedClassPointers on 32-bit: does not need class space. Klass can live wherever.
-  if (UseCompressedClassPointers) {
-    const address start = (address)os::vm_min_address(); // but not in the zero page
-    const address end = (address)CompressedKlassPointers::max_klass_range_size();
-    CompressedKlassPointers::initialize(start, end - start);
-  }
-#endif // __LP64
+  // 32-bit:
+  const address start = (address)os::vm_min_address(); // but not in the zero page
+  const address end = (address)CompressedKlassPointers::max_klass_range_size();
+  CompressedKlassPointers::initialize(start, end - start);
+#endif // INCLUDE_CLASS_SPACE
 
   // Initialize non-class virtual space list, and its chunk manager:
   MetaspaceContext::initialize_nonclass_space_context();
 
   _tracer = new MetaspaceTracer();
 
-  if (UseCompressedClassPointers) {
-    // Note: "cds" would be a better fit but keep this for backward compatibility.
-    LogTarget(Info, gc, metaspace) lt;
-    if (lt.is_enabled()) {
-      LogStream ls(lt);
-      CDS_ONLY(AOTMetaspace::print_on(&ls);)
-      Metaspace::print_compressed_class_space(&ls);
-      CompressedKlassPointers::print_mode(&ls);
-    }
+  LogTarget(Info, gc, metaspace) lt;
+  if (lt.is_enabled()) {
+    LogStream ls(lt);
+    CDS_ONLY(AOTMetaspace::print_on(&ls);)
+    Metaspace::print_compressed_class_space(&ls);
+    CompressedKlassPointers::print_mode(&ls);
   }
 }
 
@@ -888,15 +879,13 @@ MetaWord* Metaspace::allocate(ClassLoaderData* loader_data, size_t word_size,
   MetaWord* result = loader_data->metaspace_non_null()->allocate(word_size, mdtype);
 
   if (result != nullptr) {
-#ifdef ASSERT
-    if (using_class_space() && mdtype == ClassType) {
+    if (INCLUDE_CLASS_SPACE == 1 && mdtype == ClassType) {
       assert(is_in_class_space(result) &&
              is_aligned(result, CompressedKlassPointers::klass_alignment_in_bytes()), "Sanity");
     } else {
       assert((is_in_class_space(result) || is_in_nonclass_metaspace(result)) &&
              is_aligned(result, Metaspace::min_allocation_alignment_bytes), "Sanity");
     }
-#endif
     // Zero initialize.
     Copy::fill_to_words((HeapWord*)result, word_size, 0);
     log_trace(metaspace)("Metaspace::allocate: type %d return " PTR_FORMAT ".", (int)type, p2i(result));
@@ -1017,12 +1006,12 @@ void Metaspace::purge(bool classes_unloaded) {
     if (cm != nullptr) {
       cm->purge();
     }
-    if (using_class_space()) {
-      cm = ChunkManager::chunkmanager_class();
-      if (cm != nullptr) {
-        cm->purge();
-      }
+#if INCLUDE_CLASS_SPACE
+    cm = ChunkManager::chunkmanager_class();
+    if (cm != nullptr) {
+      cm->purge();
     }
+#endif // INCLUDE_CLASS_SPACE
   }
 
   // Try to satisfy queued metaspace allocation requests.
diff --git a/src/hotspot/share/memory/metaspace.hpp b/src/hotspot/share/memory/metaspace.hpp
index 01ef4b4dd49..96f5a2459ce 100644
--- a/src/hotspot/share/memory/metaspace.hpp
+++ b/src/hotspot/share/memory/metaspace.hpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2011, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2011, 2026, Oracle and/or its affiliates. All rights reserved.
  * Copyright (c) 2017, 2021 SAP SE. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
@@ -164,18 +164,12 @@ public:
 
   static void print_compressed_class_space(outputStream* st) NOT_LP64({});
 
-  // Return TRUE only if UseCompressedClassPointers is True.
-  static bool using_class_space() {
-    return NOT_LP64(false) LP64_ONLY(UseCompressedClassPointers);
-  }
-
   static bool is_class_space_allocation(MetadataType mdType) {
-    return mdType == ClassType && using_class_space();
+    return CLASS_SPACE_ONLY(mdType == ClassType) NOT_CLASS_SPACE(false);
   }
 
   static bool initialized();
 
 };
 
-
 #endif // SHARE_MEMORY_METASPACE_HPP
diff --git a/src/hotspot/share/memory/metaspace/metaspaceReporter.cpp b/src/hotspot/share/memory/metaspace/metaspaceReporter.cpp
index 3cff2a50d03..f6683f50fd1 100644
--- a/src/hotspot/share/memory/metaspace/metaspaceReporter.cpp
+++ b/src/hotspot/share/memory/metaspace/metaspaceReporter.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * Copyright (c) 2018, 2020 SAP SE. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
@@ -59,39 +59,39 @@ static void print_vs(outputStream* out, size_t scale) {
   const size_t committed_nc = RunningCounters::committed_words_nonclass();
   const int num_nodes_nc = VirtualSpaceList::vslist_nonclass()->num_nodes();
 
-  if (Metaspace::using_class_space()) {
-    const size_t reserved_c = RunningCounters::reserved_words_class();
-    const size_t committed_c = RunningCounters::committed_words_class();
-    const int num_nodes_c = VirtualSpaceList::vslist_class()->num_nodes();
+#if INCLUDE_CLASS_SPACE
+  const size_t reserved_c = RunningCounters::reserved_words_class();
+  const size_t committed_c = RunningCounters::committed_words_class();
+  const int num_nodes_c = VirtualSpaceList::vslist_class()->num_nodes();
 
-    out->print("  Non-class space:  ");
-    print_scaled_words(out, reserved_nc, scale, 7);
-    out->print(" reserved, ");
-    print_scaled_words_and_percentage(out, committed_nc, reserved_nc, scale, 7);
-    out->print(" committed, ");
-    out->print(" %d nodes.", num_nodes_nc);
-    out->cr();
-    out->print("      Class space:  ");
-    print_scaled_words(out, reserved_c, scale, 7);
-    out->print(" reserved, ");
-    print_scaled_words_and_percentage(out, committed_c, reserved_c, scale, 7);
-    out->print(" committed, ");
-    out->print(" %d nodes.", num_nodes_c);
-    out->cr();
-    out->print("             Both:  ");
-    print_scaled_words(out, reserved_c + reserved_nc, scale, 7);
-    out->print(" reserved, ");
-    print_scaled_words_and_percentage(out, committed_c + committed_nc, reserved_c + reserved_nc, scale, 7);
-    out->print(" committed. ");
-    out->cr();
-  } else {
-    print_scaled_words(out, reserved_nc, scale, 7);
-    out->print(" reserved, ");
-    print_scaled_words_and_percentage(out, committed_nc, reserved_nc, scale, 7);
-    out->print(" committed, ");
-    out->print(" %d nodes.", num_nodes_nc);
-    out->cr();
-  }
+  out->print("  Non-class space:  ");
+  print_scaled_words(out, reserved_nc, scale, 7);
+  out->print(" reserved, ");
+  print_scaled_words_and_percentage(out, committed_nc, reserved_nc, scale, 7);
+  out->print(" committed, ");
+  out->print(" %d nodes.", num_nodes_nc);
+  out->cr();
+  out->print("      Class space:  ");
+  print_scaled_words(out, reserved_c, scale, 7);
+  out->print(" reserved, ");
+  print_scaled_words_and_percentage(out, committed_c, reserved_c, scale, 7);
+  out->print(" committed, ");
+  out->print(" %d nodes.", num_nodes_c);
+  out->cr();
+  out->print("             Both:  ");
+  print_scaled_words(out, reserved_c + reserved_nc, scale, 7);
+  out->print(" reserved, ");
+  print_scaled_words_and_percentage(out, committed_c + committed_nc, reserved_c + reserved_nc, scale, 7);
+  out->print(" committed. ");
+  out->cr();
+#else
+  print_scaled_words(out, reserved_nc, scale, 7);
+  out->print(" reserved, ");
+  print_scaled_words_and_percentage(out, committed_nc, reserved_nc, scale, 7);
+  out->print(" committed, ");
+  out->print(" %d nodes.", num_nodes_nc);
+  out->cr();
+#endif // INCLUDE_CLASS_SPACE
 }
 
 static void print_settings(outputStream* out, size_t scale) {
@@ -102,12 +102,12 @@ static void print_settings(outputStream* out, size_t scale) {
     print_human_readable_size(out, MaxMetaspaceSize, scale);
   }
   out->cr();
-  if (Metaspace::using_class_space()) {
-    out->print("CompressedClassSpaceSize: ");
-    print_human_readable_size(out, CompressedClassSpaceSize, scale);
-  } else {
-    out->print("No class space");
-  }
+#if INCLUDE_CLASS_SPACE
+  out->print("CompressedClassSpaceSize: ");
+  print_human_readable_size(out, CompressedClassSpaceSize, scale);
+#else
+  out->print("No class space");
+#endif // INCLUDE_CLASS_SPACE
   out->cr();
   out->print("Initial GC threshold: ");
   print_human_readable_size(out, MetaspaceSize, scale);
@@ -117,9 +117,7 @@ static void print_settings(outputStream* out, size_t scale) {
   out->cr();
   out->print_cr("CDS: %s", (CDSConfig::is_using_archive() ? "on" : (CDSConfig::is_dumping_static_archive() ? "dump" : "off")));
   Settings::print_on(out);
-#ifdef _LP64
   CompressedKlassPointers::print_mode(out);
-#endif
 }
 
 // This will print out a basic metaspace usage report but
@@ -131,9 +129,7 @@ void MetaspaceReporter::print_basic_report(outputStream* out, size_t scale) {
   }
   out->cr();
   out->print_cr("Usage:");
-  if (Metaspace::using_class_space()) {
-    out->print("  Non-class:  ");
-  }
+  CLASS_SPACE_ONLY(out->print("  Non-class:  ");)
 
   // Note: since we want to purely rely on counters, without any locking or walking the CLDG,
   // for Usage stats (statistics over in-use chunks) all we can print is the
@@ -144,37 +140,35 @@ void MetaspaceReporter::print_basic_report(outputStream* out, size_t scale) {
   print_scaled_words(out, used_nc, scale, 5);
   out->print(" used.");
   out->cr();
-  if (Metaspace::using_class_space()) {
-    const size_t used_c = MetaspaceUtils::used_words(Metaspace::ClassType);
-    out->print("      Class:  ");
-    print_scaled_words(out, used_c, scale, 5);
-    out->print(" used.");
-    out->cr();
-    out->print("       Both:  ");
-    const size_t used = used_nc + used_c;
-    print_scaled_words(out, used, scale, 5);
-    out->print(" used.");
-    out->cr();
-  }
+#if INCLUDE_CLASS_SPACE
+  const size_t used_c = MetaspaceUtils::used_words(Metaspace::ClassType);
+  out->print("      Class:  ");
+  print_scaled_words(out, used_c, scale, 5);
+  out->print(" used.");
+  out->cr();
+  out->print("       Both:  ");
+  const size_t used = used_nc + used_c;
+  print_scaled_words(out, used, scale, 5);
+  out->print(" used.");
+  out->cr();
+#endif // INCLUDE_CLASS_SPACE
   out->cr();
   out->print_cr("Virtual space:");
   print_vs(out, scale);
   out->cr();
   out->print_cr("Chunk freelists:");
-  if (Metaspace::using_class_space()) {
-    out->print("   Non-Class:  ");
-  }
+  CLASS_SPACE_ONLY(out->print("   Non-Class:  ");)
   print_scaled_words(out, ChunkManager::chunkmanager_nonclass()->total_word_size(), scale);
   out->cr();
-  if (Metaspace::using_class_space()) {
-    out->print("       Class:  ");
-    print_scaled_words(out, ChunkManager::chunkmanager_class()->total_word_size(), scale);
-    out->cr();
-    out->print("        Both:  ");
-    print_scaled_words(out, ChunkManager::chunkmanager_nonclass()->total_word_size() +
-                            ChunkManager::chunkmanager_class()->total_word_size(), scale);
-    out->cr();
-  }
+#if INCLUDE_CLASS_SPACE
+  out->print("       Class:  ");
+  print_scaled_words(out, ChunkManager::chunkmanager_class()->total_word_size(), scale);
+  out->cr();
+  out->print("        Both:  ");
+  print_scaled_words(out, ChunkManager::chunkmanager_nonclass()->total_word_size() +
+                          ChunkManager::chunkmanager_class()->total_word_size(), scale);
+  out->cr();
+#endif // INCLUDE_CLASS_SPACE
   out->cr();
 
   // Print basic settings
@@ -256,70 +250,70 @@ void MetaspaceReporter::print_report(outputStream* out, size_t scale, int flags)
   // -- Print VirtualSpaceList details.
   if ((flags & (int)Option::ShowVSList) > 0) {
     out->cr();
-    out->print_cr("Virtual space list%s:", Metaspace::using_class_space() ? "s" : "");
-
-    if (Metaspace::using_class_space()) {
-      out->print_cr("   Non-Class:");
-    }
+#if INCLUDE_CLASS_SPACE
+    out->print_cr("Virtual space lists:");
+    out->print_cr("   Non-Class:");
     VirtualSpaceList::vslist_nonclass()->print_on(out);
     out->cr();
-    if (Metaspace::using_class_space()) {
-      out->print_cr("       Class:");
-      VirtualSpaceList::vslist_class()->print_on(out);
-      out->cr();
-    }
+    out->print_cr("       Class:");
+    VirtualSpaceList::vslist_class()->print_on(out);
+    out->cr();
+#else
+    out->print_cr("Virtual space list:");
+    VirtualSpaceList::vslist_nonclass()->print_on(out);
+    out->cr();
+#endif // INCLUDE_CLASS_SPACE
   }
   out->cr();
 
   //////////// Freelists (ChunkManager) section ///////////////////////////
 
-  out->cr();
-  out->print_cr("Chunk freelist%s:", Metaspace::using_class_space() ? "s" : "");
-
   ChunkManagerStats non_class_cm_stat;
   ChunkManagerStats class_cm_stat;
   ChunkManagerStats total_cm_stat;
 
   ChunkManager::chunkmanager_nonclass()->add_to_statistics(&non_class_cm_stat);
-  if (Metaspace::using_class_space()) {
-    ChunkManager::chunkmanager_nonclass()->add_to_statistics(&non_class_cm_stat);
-    ChunkManager::chunkmanager_class()->add_to_statistics(&class_cm_stat);
-    total_cm_stat.add(non_class_cm_stat);
-    total_cm_stat.add(class_cm_stat);
+#if INCLUDE_CLASS_SPACE
+  ChunkManager::chunkmanager_class()->add_to_statistics(&class_cm_stat);
+  total_cm_stat.add(non_class_cm_stat);
+  total_cm_stat.add(class_cm_stat);
 
-    out->print_cr("   Non-Class:");
-    non_class_cm_stat.print_on(out, scale);
-    out->cr();
-    out->print_cr("       Class:");
-    class_cm_stat.print_on(out, scale);
-    out->cr();
-    out->print_cr("        Both:");
-    total_cm_stat.print_on(out, scale);
-    out->cr();
-  } else {
-    ChunkManager::chunkmanager_nonclass()->add_to_statistics(&non_class_cm_stat);
-    non_class_cm_stat.print_on(out, scale);
-    out->cr();
-  }
+  out->print_cr("Chunk freelists:");
+  out->cr();
+  out->print_cr("   Non-Class:");
+  non_class_cm_stat.print_on(out, scale);
+  out->cr();
+  out->print_cr("       Class:");
+  class_cm_stat.print_on(out, scale);
+  out->cr();
+  out->print_cr("        Both:");
+  total_cm_stat.print_on(out, scale);
+  out->cr();
+#else
+  out->print_cr("Chunk freelist:");
+  ChunkManager::chunkmanager_nonclass()->add_to_statistics(&non_class_cm_stat);
+  non_class_cm_stat.print_on(out, scale);
+  out->cr();
+#endif // INCLUDE_CLASS_SPACE
 
   // -- Print Chunkmanager details.
   if ((flags & (int)Option::ShowChunkFreeList) > 0) {
     out->cr();
     out->print_cr("Chunk freelist details:");
-    if (Metaspace::using_class_space()) {
-      out->print_cr("   Non-Class:");
-    }
+#if INCLUDE_CLASS_SPACE
+    out->print_cr("   Non-Class:");
     ChunkManager::chunkmanager_nonclass()->print_on(out);
     out->cr();
-    if (Metaspace::using_class_space()) {
-      out->print_cr("       Class:");
-      ChunkManager::chunkmanager_class()->print_on(out);
-      out->cr();
-    }
+    out->print_cr("       Class:");
+    ChunkManager::chunkmanager_class()->print_on(out);
+    out->cr();
+#else
+    ChunkManager::chunkmanager_nonclass()->print_on(out);
+    out->cr();
+#endif // INCLUDE_CLASS_SPACE
   }
   out->cr();
 
-
   //////////// Waste section ///////////////////////////
   // As a convenience, print a summary of common waste.
   out->cr();
diff --git a/src/hotspot/share/memory/metaspace/metaspaceStatistics.cpp b/src/hotspot/share/memory/metaspace/metaspaceStatistics.cpp
index aab46d64db5..d90e8ed090d 100644
--- a/src/hotspot/share/memory/metaspace/metaspaceStatistics.cpp
+++ b/src/hotspot/share/memory/metaspace/metaspaceStatistics.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * Copyright (c) 2018, 2020 SAP SE. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
@@ -205,28 +205,26 @@ ArenaStats ClmsStats::totals() const {
 void ClmsStats::print_on(outputStream* st, size_t scale, bool detailed) const {
   StreamIndentor si(st, 2);
   st->cr();
-  if (Metaspace::using_class_space()) {
-    st->print("Non-Class: ");
-  }
+  CLASS_SPACE_ONLY(st->print("Non-Class: ");)
   _arena_stats_nonclass.print_on(st, scale, detailed);
   if (detailed) {
     st->cr();
   }
-  if (Metaspace::using_class_space()) {
+#if INCLUDE_CLASS_SPACE
+  st->cr();
+  st->print("    Class: ");
+  _arena_stats_class.print_on(st, scale, detailed);
+  if (detailed) {
     st->cr();
-    st->print("    Class: ");
-    _arena_stats_class.print_on(st, scale, detailed);
-    if (detailed) {
-      st->cr();
-    }
-    st->cr();
-    st->print("     Both: ");
-    totals().print_on(st, scale, detailed);
-    if (detailed) {
-      st->cr();
-    }
   }
   st->cr();
+  st->print("     Both: ");
+  totals().print_on(st, scale, detailed);
+  if (detailed) {
+    st->cr();
+  }
+#endif // INCLUDE_CLASS_SPACE
+  st->cr();
 }
 
 #ifdef ASSERT
diff --git a/src/hotspot/share/memory/metaspace/virtualSpaceNode.cpp b/src/hotspot/share/memory/metaspace/virtualSpaceNode.cpp
index df4e507b104..a934a628582 100644
--- a/src/hotspot/share/memory/metaspace/virtualSpaceNode.cpp
+++ b/src/hotspot/share/memory/metaspace/virtualSpaceNode.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * Copyright (c) 2018, 2021 SAP SE. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
@@ -259,12 +259,11 @@ VirtualSpaceNode* VirtualSpaceNode::create_node(size_t word_size,
   }
 
 #ifndef _LP64
-  // On 32-bit, with +UseCompressedClassPointers, the whole address space is the encoding range. We therefore
-  // don't need a class space. However, as a pragmatic workaround for pesty overflow problems on 32-bit, we leave
-  // a small area at the end of the address space out of the encoding range. We just assume no Klass will ever live
+  // On 32-bit, the whole address space is the encoding range. We therefore don't need a class space.
+  // However, as a pragmatic workaround for pesty overflow problems on 32-bit, we leave a small area
+  // at the end of the address space out of the encoding range. We just assume no Klass will ever live
   // there (it won't, for no OS we support on 32-bit has user-addressable memory up there).
-  assert(!UseCompressedClassPointers ||
-         rs.end() <= (char*)CompressedKlassPointers::max_klass_range_size(), "Weirdly high address");
+  assert(rs.end() <= (char*)CompressedKlassPointers::max_klass_range_size(), "Weirdly high address");
 #endif // _LP64
 
   MemTracker::record_virtual_memory_tag(rs, mtMetaspace);
diff --git a/src/hotspot/share/nmt/memReporter.cpp b/src/hotspot/share/nmt/memReporter.cpp
index 27a94ec7bc0..429db6ad31f 100644
--- a/src/hotspot/share/nmt/memReporter.cpp
+++ b/src/hotspot/share/nmt/memReporter.cpp
@@ -272,9 +272,7 @@ void MemSummaryReporter::report_summary_of_tag(MemTag mem_tag,
   } else if (mem_tag == mtClass) {
     // Metadata information
     report_metadata(Metaspace::NonClassType);
-    if (Metaspace::using_class_space()) {
-      report_metadata(Metaspace::ClassType);
-    }
+    CLASS_SPACE_ONLY(report_metadata(Metaspace::ClassType);)
   }
   out->cr();
 }
@@ -754,9 +752,9 @@ void MemSummaryDiffReporter::diff_summary_of_tag(MemTag mem_tag,
 void MemSummaryDiffReporter::print_metaspace_diff(const MetaspaceCombinedStats& current_ms,
                                                   const MetaspaceCombinedStats& early_ms) const {
   print_metaspace_diff("Metadata", current_ms.non_class_space_stats(), early_ms.non_class_space_stats());
-  if (Metaspace::using_class_space()) {
-    print_metaspace_diff("Class space", current_ms.class_space_stats(), early_ms.class_space_stats());
-  }
+#if INCLUDE_CLASS_SPACE
+  print_metaspace_diff("Class space", current_ms.class_space_stats(), early_ms.class_space_stats());
+#endif
 }
 
 void MemSummaryDiffReporter::print_metaspace_diff(const char* header,
diff --git a/src/hotspot/share/oops/arrayOop.hpp b/src/hotspot/share/oops/arrayOop.hpp
index f0c476a2486..836a1b9250d 100644
--- a/src/hotspot/share/oops/arrayOop.hpp
+++ b/src/hotspot/share/oops/arrayOop.hpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1997, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -80,8 +80,7 @@ private:
 
   // The _length field is not declared in C++.  It is allocated after the
   // mark-word when using compact headers (+UseCompactObjectHeaders), otherwise
-  // after the compressed Klass* when running with compressed class-pointers
-  // (+UseCompressedClassPointers), or else after the full Klass*.
+  // after the compressed Klass*.
   static int length_offset_in_bytes() {
     return oopDesc::base_offset_in_bytes();
   }
diff --git a/src/hotspot/share/oops/compressedKlass.cpp b/src/hotspot/share/oops/compressedKlass.cpp
index b32d10c74d2..ca1c46d4095 100644
--- a/src/hotspot/share/oops/compressedKlass.cpp
+++ b/src/hotspot/share/oops/compressedKlass.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2019, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2019, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -95,7 +95,7 @@ void CompressedKlassPointers::sanity_check_after_initialization() {
 
   // We should need a class space if address space is larger than what narrowKlass can address
   const bool should_need_class_space = (BytesPerWord * BitsPerByte) > narrow_klass_pointer_bits();
-  ASSERT_HERE(should_need_class_space == needs_class_space());
+  ASSERT_HERE(should_need_class_space == (INCLUDE_CLASS_SPACE ? true : false));
 
   const size_t klass_align = klass_alignment_in_bytes();
 
@@ -318,24 +318,19 @@ void CompressedKlassPointers::initialize(address addr, size_t len) {
 }
 
 void CompressedKlassPointers::print_mode(outputStream* st) {
-  st->print_cr("UseCompressedClassPointers %d, UseCompactObjectHeaders %d",
-               UseCompressedClassPointers, UseCompactObjectHeaders);
-  if (UseCompressedClassPointers) {
-    st->print_cr("Narrow klass pointer bits %d, Max shift %d",
-                 _narrow_klass_pointer_bits, _max_shift);
-    st->print_cr("Narrow klass base: " PTR_FORMAT ", Narrow klass shift: %d",
-                  p2i(base()), shift());
-    st->print_cr("Encoding Range: " RANGE2FMT, RANGE2FMTARGS(_base, encoding_range_end()));
-    st->print_cr("Klass Range:    " RANGE2FMT, RANGE2FMTARGS(_klass_range_start, _klass_range_end));
-    st->print_cr("Klass ID Range:  [%u - %u) (%u)", _lowest_valid_narrow_klass_id, _highest_valid_narrow_klass_id + 1,
-                 _highest_valid_narrow_klass_id + 1 - _lowest_valid_narrow_klass_id);
-    if (_protection_zone_size > 0) {
-      st->print_cr("Protection zone: " RANGEFMT, RANGEFMTARGS(_base, _protection_zone_size));
-    } else {
-      st->print_cr("No protection zone.");
-    }
+  st->print_cr("UseCompactObjectHeaders %d", UseCompactObjectHeaders);
+  st->print_cr("Narrow klass pointer bits %d, Max shift %d",
+               _narrow_klass_pointer_bits, _max_shift);
+  st->print_cr("Narrow klass base: " PTR_FORMAT ", Narrow klass shift: %d",
+                p2i(base()), shift());
+  st->print_cr("Encoding Range: " RANGE2FMT, RANGE2FMTARGS(_base, encoding_range_end()));
+  st->print_cr("Klass Range:    " RANGE2FMT, RANGE2FMTARGS(_klass_range_start, _klass_range_end));
+  st->print_cr("Klass ID Range:  [%u - %u) (%u)", _lowest_valid_narrow_klass_id, _highest_valid_narrow_klass_id + 1,
+               _highest_valid_narrow_klass_id + 1 - _lowest_valid_narrow_klass_id);
+  if (_protection_zone_size > 0) {
+    st->print_cr("Protection zone: " RANGEFMT, RANGEFMTARGS(_base, _protection_zone_size));
   } else {
-    st->print_cr("UseCompressedClassPointers off");
+    st->print_cr("No protection zone.");
   }
 }
 
diff --git a/src/hotspot/share/oops/compressedKlass.hpp b/src/hotspot/share/oops/compressedKlass.hpp
index 98a9eafdbf4..fe1ce9e07ae 100644
--- a/src/hotspot/share/oops/compressedKlass.hpp
+++ b/src/hotspot/share/oops/compressedKlass.hpp
@@ -98,7 +98,6 @@ class Klass;
 // If compressed klass pointers then use narrowKlass.
 typedef juint  narrowKlass;
 
-// For UseCompressedClassPointers.
 class CompressedKlassPointers : public AllStatic {
   friend class VMStructs;
   friend class ArchiveBuilder;
@@ -161,7 +160,6 @@ public:
 
   // Initialization sequence:
   // 1) Parse arguments. The following arguments take a role:
-  //      - UseCompressedClassPointers
   //      - UseCompactObjectHeaders
   //      - Xshare on off dump
   //      - CompressedClassSpaceSize
@@ -192,12 +190,6 @@ public:
   // resulting from the current encoding settings (base, shift), capped to a certain max. value.
   static size_t max_klass_range_size();
 
-  // On 64-bit, we need the class space to confine Klass structures to the encoding range, which is determined
-  // by bit size of narrowKlass IDs and the shift. On 32-bit, we support compressed class pointer only
-  // "pro-forma": narrowKlass have the same size as addresses (32 bits), and therefore the encoding range is
-  // equal to the address space size. Here, we don't need a class space.
-  static constexpr bool needs_class_space() { return LP64_ONLY(true) NOT_LP64(false); }
-
   // Reserve a range of memory that is to contain Klass strucutures which are referenced by narrow Klass IDs.
   // If optimize_for_zero_base is true, the implementation will attempt to reserve optimized for zero-based encoding.
   static char* reserve_address_space_for_compressed_classes(size_t size, bool aslr, bool optimize_for_zero_base);
diff --git a/src/hotspot/share/oops/compressedKlass.inline.hpp b/src/hotspot/share/oops/compressedKlass.inline.hpp
index 65732b3b289..834264286bc 100644
--- a/src/hotspot/share/oops/compressedKlass.inline.hpp
+++ b/src/hotspot/share/oops/compressedKlass.inline.hpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2017, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2017, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -75,7 +75,6 @@ inline narrowKlass CompressedKlassPointers::encode(const Klass* v) {
 
 #ifdef ASSERT
 inline void CompressedKlassPointers::check_encodable(const void* addr) {
-  assert(UseCompressedClassPointers, "Only call for +UseCCP");
   assert(addr != nullptr, "Null Klass?");
   assert(is_encodable(addr),
          "Address " PTR_FORMAT " is not encodable (Klass range: " RANGEFMT ", klass alignment: %d)",
@@ -84,7 +83,6 @@ inline void CompressedKlassPointers::check_encodable(const void* addr) {
 
 inline void CompressedKlassPointers::check_valid_narrow_klass_id(narrowKlass nk) {
   check_init(_base);
-  assert(UseCompressedClassPointers, "Only call for +UseCCP");
   assert(nk > 0, "narrow Klass ID is 0");
   const uint64_t nk_mask = ~right_n_bits(narrow_klass_pointer_bits());
   assert(((uint64_t)nk & nk_mask) == 0, "narrow klass id bit spillover (%u)", nk);
diff --git a/src/hotspot/share/oops/instanceKlass.cpp b/src/hotspot/share/oops/instanceKlass.cpp
index 919afbf3abd..d3333e72c2a 100644
--- a/src/hotspot/share/oops/instanceKlass.cpp
+++ b/src/hotspot/share/oops/instanceKlass.cpp
@@ -486,10 +486,8 @@ InstanceKlass* InstanceKlass::allocate_instance_klass(const ClassFileParser& par
     ik = new (loader_data, size, THREAD) InstanceKlass(parser);
   }
 
-  if (ik != nullptr && UseCompressedClassPointers) {
-    assert(CompressedKlassPointers::is_encodable(ik),
-           "Klass " PTR_FORMAT "needs a narrow Klass ID, but is not encodable", p2i(ik));
-  }
+  assert(ik == nullptr || CompressedKlassPointers::is_encodable(ik),
+         "Klass " PTR_FORMAT "needs a narrow Klass ID, but is not encodable", p2i(ik));
 
   // Check for pending exception before adding to the loader data and incrementing
   // class count.  Can get OOM here.
diff --git a/src/hotspot/share/oops/klass.cpp b/src/hotspot/share/oops/klass.cpp
index 001e9eba790..84a1766a702 100644
--- a/src/hotspot/share/oops/klass.cpp
+++ b/src/hotspot/share/oops/klass.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1997, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -1055,14 +1055,8 @@ void Klass::verify_on(outputStream* st) {
 
   // This can be expensive, but it is worth checking that this klass is actually
   // in the CLD graph but not in production.
-#ifdef ASSERT
-  if (UseCompressedClassPointers) {
-    // Stricter checks for both correct alignment and placement
-    CompressedKlassPointers::check_encodable(this);
-  } else {
-    assert(Metaspace::contains((address)this), "Should be");
-  }
-#endif // ASSERT
+  // Stricter checks for both correct alignment and placement
+  DEBUG_ONLY(CompressedKlassPointers::check_encodable(this));
 
   guarantee(this->is_klass(),"should be klass");
 
diff --git a/src/hotspot/share/oops/objLayout.cpp b/src/hotspot/share/oops/objLayout.cpp
index b8cd8249da1..2c426a7ddff 100644
--- a/src/hotspot/share/oops/objLayout.cpp
+++ b/src/hotspot/share/oops/objLayout.cpp
@@ -38,21 +38,17 @@ void ObjLayout::initialize() {
     _klass_mode = Compact;
     _oop_base_offset_in_bytes = sizeof(markWord);
     _oop_has_klass_gap = false;
-  } else if (UseCompressedClassPointers) {
+  } else {
     _klass_mode = Compressed;
     _oop_base_offset_in_bytes = sizeof(markWord) + sizeof(narrowKlass);
     _oop_has_klass_gap = true;
-  } else {
-    _klass_mode = Uncompressed;
-    _oop_base_offset_in_bytes = sizeof(markWord) + sizeof(Klass*);
-    _oop_has_klass_gap = false;
   }
 #else
   assert(_klass_mode == Undefined, "ObjLayout initialized twice");
   assert(!UseCompactObjectHeaders, "COH unsupported on 32-bit");
-  // We support +-UseCompressedClassPointers on 32-bit, but the layout
+  // We support narrow Klass pointers on 32-bit, but the layout
   // is exactly the same as it was with uncompressed klass pointers
-  _klass_mode = UseCompressedClassPointers ? Compressed : Uncompressed;
+  _klass_mode = Compressed;
   _oop_base_offset_in_bytes = sizeof(markWord) + sizeof(Klass*);
   _oop_has_klass_gap = false;
 #endif
diff --git a/src/hotspot/share/oops/objLayout.hpp b/src/hotspot/share/oops/objLayout.hpp
index e434524d4b0..37ed0b7a532 100644
--- a/src/hotspot/share/oops/objLayout.hpp
+++ b/src/hotspot/share/oops/objLayout.hpp
@@ -27,8 +27,8 @@
 
 /*
  * This class helps to avoid loading more than one flag in some
- * operations that require checking UseCompressedClassPointers,
- * UseCompactObjectHeaders and possibly more.
+ * operations that require checking UseCompactObjectHeaders and - in the future -
+ * possibly more.
  *
  * This is important on some performance critical paths, e.g. where
  * the Klass* is accessed frequently, especially by GC oop iterators
@@ -37,12 +37,10 @@
 class ObjLayout {
 public:
   enum Mode {
-    // +UseCompactObjectHeaders (implies +UseCompressedClassPointers)
+    // +UseCompactObjectHeaders
     Compact,
-    // +UseCompressedClassPointers (-UseCompactObjectHeaders)
+    // -UseCompactObjectHeaders (compressed Klass pointers)
     Compressed,
-    // -UseCompressedClassPointers (-UseCompactObjectHeaders)
-    Uncompressed,
     // Not yet initialized
     Undefined
   };
diff --git a/src/hotspot/share/oops/objLayout.inline.hpp b/src/hotspot/share/oops/objLayout.inline.hpp
index 6aa9e39ce28..adad490378d 100644
--- a/src/hotspot/share/oops/objLayout.inline.hpp
+++ b/src/hotspot/share/oops/objLayout.inline.hpp
@@ -32,10 +32,8 @@ inline ObjLayout::Mode ObjLayout::klass_mode() {
   assert(_klass_mode != Undefined, "KlassMode not yet initialized");
   if (UseCompactObjectHeaders) {
     assert(_klass_mode == Compact, "Klass mode does not match flags");
-  } else if (UseCompressedClassPointers) {
-    assert(_klass_mode == Compressed, "Klass mode does not match flags");
   } else {
-    assert(_klass_mode == Uncompressed, "Klass mode does not match flags");
+    assert(_klass_mode == Compressed, "Klass mode does not match flags");
   }
 #endif
   return _klass_mode;
diff --git a/src/hotspot/share/oops/oop.cpp b/src/hotspot/share/oops/oop.cpp
index 5f453241c3d..415732af4f6 100644
--- a/src/hotspot/share/oops/oop.cpp
+++ b/src/hotspot/share/oops/oop.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1997, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -152,8 +152,7 @@ bool oopDesc::is_typeArray_noinline()   const { return is_typeArray();   }
 #if INCLUDE_CDS_JAVA_HEAP
 void oopDesc::set_narrow_klass(narrowKlass nk) {
   assert(CDSConfig::is_dumping_heap(), "Used by CDS only. Do not abuse!");
-  assert(UseCompressedClassPointers, "must be");
-  _metadata._compressed_klass = nk;
+  _compressed_klass = nk;
 }
 #endif
 
diff --git a/src/hotspot/share/oops/oop.hpp b/src/hotspot/share/oops/oop.hpp
index 0dc6590750e..d6cc71a60d8 100644
--- a/src/hotspot/share/oops/oop.hpp
+++ b/src/hotspot/share/oops/oop.hpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1997, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -49,10 +49,7 @@ class oopDesc {
   friend class JVMCIVMStructs;
  private:
   volatile markWord _mark;
-  union _metadata {
-    Klass*      _klass;
-    narrowKlass _compressed_klass;
-  } _metadata;
+  narrowKlass _compressed_klass;
 
   // There may be ordering constraints on the initialization of fields that
   // make use of the C++ copy/assign incorrect.
@@ -338,7 +335,7 @@ class oopDesc {
     } else
 #endif
     {
-      return (int)offset_of(oopDesc, _metadata._klass);
+      return (int)offset_of(oopDesc, _compressed_klass);
     }
   }
   static int klass_gap_offset_in_bytes() {
diff --git a/src/hotspot/share/oops/oop.inline.hpp b/src/hotspot/share/oops/oop.inline.hpp
index b445eae933b..d5cb80e1122 100644
--- a/src/hotspot/share/oops/oop.inline.hpp
+++ b/src/hotspot/share/oops/oop.inline.hpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1997, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -99,9 +99,9 @@ Klass* oopDesc::klass() const {
     case ObjLayout::Compact:
       return mark().klass();
     case ObjLayout::Compressed:
-      return CompressedKlassPointers::decode_not_null(_metadata._compressed_klass);
+      return CompressedKlassPointers::decode_not_null(_compressed_klass);
     default:
-      return _metadata._klass;
+      ShouldNotReachHere();
   }
 }
 
@@ -110,9 +110,9 @@ Klass* oopDesc::klass_or_null() const {
     case ObjLayout::Compact:
       return mark().klass_or_null();
     case ObjLayout::Compressed:
-      return CompressedKlassPointers::decode(_metadata._compressed_klass);
+      return CompressedKlassPointers::decode(_compressed_klass);
     default:
-      return _metadata._klass;
+      ShouldNotReachHere();
   }
 }
 
@@ -121,11 +121,11 @@ Klass* oopDesc::klass_or_null_acquire() const {
     case ObjLayout::Compact:
       return mark_acquire().klass();
     case ObjLayout::Compressed: {
-      narrowKlass narrow_klass = AtomicAccess::load_acquire(&_metadata._compressed_klass);
+      narrowKlass narrow_klass = AtomicAccess::load_acquire(&_compressed_klass);
       return CompressedKlassPointers::decode(narrow_klass);
     }
     default:
-      return AtomicAccess::load_acquire(&_metadata._klass);
+      ShouldNotReachHere();
   }
 }
 
@@ -134,9 +134,9 @@ Klass* oopDesc::klass_without_asserts() const {
     case ObjLayout::Compact:
       return mark().klass_without_asserts();
     case ObjLayout::Compressed:
-      return CompressedKlassPointers::decode_without_asserts(_metadata._compressed_klass);
+      return CompressedKlassPointers::decode_without_asserts(_compressed_klass);
     default:
-      return _metadata._klass;
+      ShouldNotReachHere();
   }
 }
 
@@ -145,7 +145,7 @@ narrowKlass oopDesc::narrow_klass() const {
     case ObjLayout::Compact:
       return mark().narrow_klass();
     case ObjLayout::Compressed:
-      return _metadata._compressed_klass;
+      return _compressed_klass;
     default:
       ShouldNotReachHere();
   }
@@ -154,23 +154,14 @@ narrowKlass oopDesc::narrow_klass() const {
 void oopDesc::set_klass(Klass* k) {
   assert(Universe::is_bootstrapping() || (k != nullptr && k->is_klass()), "incorrect Klass");
   assert(!UseCompactObjectHeaders, "don't set Klass* with compact headers");
-  if (UseCompressedClassPointers) {
-    _metadata._compressed_klass = CompressedKlassPointers::encode_not_null(k);
-  } else {
-    _metadata._klass = k;
-  }
+  _compressed_klass = CompressedKlassPointers::encode_not_null(k);
 }
 
 void oopDesc::release_set_klass(HeapWord* mem, Klass* k) {
   assert(Universe::is_bootstrapping() || (k != nullptr && k->is_klass()), "incorrect Klass");
   assert(!UseCompactObjectHeaders, "don't set Klass* with compact headers");
   char* raw_mem = ((char*)mem + klass_offset_in_bytes());
-  if (UseCompressedClassPointers) {
-    AtomicAccess::release_store((narrowKlass*)raw_mem,
-                          CompressedKlassPointers::encode_not_null(k));
-  } else {
-    AtomicAccess::release_store((Klass**)raw_mem, k);
-  }
+  AtomicAccess::release_store((narrowKlass*)raw_mem, CompressedKlassPointers::encode_not_null(k));
 }
 
 void oopDesc::set_klass_gap(HeapWord* mem, int v) {
diff --git a/src/hotspot/share/opto/cfgnode.cpp b/src/hotspot/share/opto/cfgnode.cpp
index a251a253ed1..0915f79a503 100644
--- a/src/hotspot/share/opto/cfgnode.cpp
+++ b/src/hotspot/share/opto/cfgnode.cpp
@@ -2689,7 +2689,7 @@ Node *PhiNode::Ideal(PhaseGVN *phase, bool can_reshape) {
 #ifdef _LP64
   // Push DecodeN/DecodeNKlass down through phi.
   // The rest of phi graph will transform by split EncodeP node though phis up.
-  if ((UseCompressedOops || UseCompressedClassPointers) && can_reshape && progress == nullptr) {
+  if (can_reshape && progress == nullptr) {
     bool may_push = true;
     bool has_decodeN = false;
     bool is_decodeN = false;
diff --git a/src/hotspot/share/opto/chaitin.cpp b/src/hotspot/share/opto/chaitin.cpp
index 3ba3ffc1045..ef017ee15ec 100644
--- a/src/hotspot/share/opto/chaitin.cpp
+++ b/src/hotspot/share/opto/chaitin.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2000, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2000, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -2633,7 +2633,7 @@ void PhaseChaitin::verify_base_ptrs(ResourceArea* a) const {
 #ifdef _LP64
                       (UseCompressedOops && check->as_Mach()->ideal_Opcode() == Op_CastPP) ||
                       (UseCompressedOops && check->as_Mach()->ideal_Opcode() == Op_DecodeN) ||
-                      (UseCompressedClassPointers && check->as_Mach()->ideal_Opcode() == Op_DecodeNKlass) ||
+                      (check->as_Mach()->ideal_Opcode() == Op_DecodeNKlass) ||
 #endif // _LP64
                       check->as_Mach()->ideal_Opcode() == Op_LoadP ||
                       check->as_Mach()->ideal_Opcode() == Op_LoadKlass))) {
diff --git a/src/hotspot/share/opto/compile.cpp b/src/hotspot/share/opto/compile.cpp
index f34c75656a4..7ab384a29c7 100644
--- a/src/hotspot/share/opto/compile.cpp
+++ b/src/hotspot/share/opto/compile.cpp
@@ -3414,8 +3414,7 @@ void Compile::final_graph_reshaping_main_switch(Node* n, Final_Reshape_Counts& f
     Node *addp = n->in(AddPNode::Address);
     assert(n->as_AddP()->address_input_has_same_base(), "Base pointers must match (addp %u)", addp->_idx );
 #ifdef _LP64
-    if ((UseCompressedOops || UseCompressedClassPointers) &&
-        addp->Opcode() == Op_ConP &&
+    if (addp->Opcode() == Op_ConP &&
         addp == n->in(AddPNode::Base) &&
         n->in(AddPNode::Offset)->is_Con()) {
       // If the transformation of ConP to ConN+DecodeN is beneficial depends
@@ -3428,7 +3427,7 @@ void Compile::final_graph_reshaping_main_switch(Node* n, Final_Reshape_Counts& f
       bool is_klass = t->isa_klassptr() != nullptr;
 
       if ((is_oop   && UseCompressedOops          && Matcher::const_oop_prefer_decode()  ) ||
-          (is_klass && UseCompressedClassPointers && Matcher::const_klass_prefer_decode() &&
+          (is_klass && Matcher::const_klass_prefer_decode() &&
            t->isa_klassptr()->exact_klass()->is_in_encoding_range())) {
         Node* nn = nullptr;
 
@@ -3975,8 +3974,7 @@ void Compile::final_graph_reshaping_walk(Node_Stack& nstack, Node* root, Final_R
   }
 
   // Skip next transformation if compressed oops are not used.
-  if ((UseCompressedOops && !Matcher::gen_narrow_oop_implicit_null_checks()) ||
-      (!UseCompressedOops && !UseCompressedClassPointers))
+  if (UseCompressedOops && !Matcher::gen_narrow_oop_implicit_null_checks())
     return;
 
   // Go over safepoints nodes to skip DecodeN/DecodeNKlass nodes for debug edges.
diff --git a/src/hotspot/share/opto/lcm.cpp b/src/hotspot/share/opto/lcm.cpp
index 53a503866fa..450d267e821 100644
--- a/src/hotspot/share/opto/lcm.cpp
+++ b/src/hotspot/share/opto/lcm.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1998, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1998, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -306,8 +306,7 @@ void PhaseCFG::implicit_null_check(Block* block, Node *proj, Node *val, int allo
         // cannot reason about it; is probably not implicit null exception
       } else {
         const TypePtr* tptr;
-        if ((UseCompressedOops && CompressedOops::shift() == 0) ||
-            (UseCompressedClassPointers && CompressedKlassPointers::shift() == 0)) {
+        if ((UseCompressedOops && CompressedOops::shift() == 0) || CompressedKlassPointers::shift() == 0) {
           // 32-bits narrow oop can be the base of address expressions
           tptr = base->get_ptr_type();
         } else {
diff --git a/src/hotspot/share/opto/memnode.cpp b/src/hotspot/share/opto/memnode.cpp
index 3cd553e4bd1..46f6729c82f 100644
--- a/src/hotspot/share/opto/memnode.cpp
+++ b/src/hotspot/share/opto/memnode.cpp
@@ -2486,7 +2486,6 @@ Node* LoadKlassNode::make(PhaseGVN& gvn, Node* mem, Node* adr, const TypePtr* at
   assert(adr_type != nullptr, "expecting TypeKlassPtr");
 #ifdef _LP64
   if (adr_type->is_ptr_to_narrowklass()) {
-    assert(UseCompressedClassPointers, "no compressed klasses");
     Node* load_klass = gvn.transform(new LoadNKlassNode(mem, adr, at, tk->make_narrowklass(), MemNode::unordered));
     return new DecodeNKlassNode(load_klass, load_klass->bottom_type()->make_ptr());
   }
@@ -2816,8 +2815,7 @@ StoreNode* StoreNode::make(PhaseGVN& gvn, Node* ctl, Node* mem, Node* adr, const
       val = gvn.transform(new EncodePNode(val, val->bottom_type()->make_narrowoop()));
       return new StoreNNode(ctl, mem, adr, adr_type, val, mo);
     } else if (adr->bottom_type()->is_ptr_to_narrowklass() ||
-               (UseCompressedClassPointers && val->bottom_type()->isa_klassptr() &&
-                adr->bottom_type()->isa_rawptr())) {
+               (val->bottom_type()->isa_klassptr() && adr->bottom_type()->isa_rawptr())) {
       val = gvn.transform(new EncodePKlassNode(val, val->bottom_type()->make_narrowklass()));
       return new StoreNKlassNode(ctl, mem, adr, adr_type, val, mo);
     }
diff --git a/src/hotspot/share/opto/narrowptrnode.cpp b/src/hotspot/share/opto/narrowptrnode.cpp
index 7f86b8caecf..8b91bfaa944 100644
--- a/src/hotspot/share/opto/narrowptrnode.cpp
+++ b/src/hotspot/share/opto/narrowptrnode.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2014, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2014, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -102,7 +102,7 @@ const Type* EncodePKlassNode::Value(PhaseGVN* phase) const {
   if (t == Type::TOP) return Type::TOP;
   assert (t != TypePtr::NULL_PTR, "null klass?");
 
-  assert(UseCompressedClassPointers && t->isa_klassptr(), "only klass ptr here");
+  assert(t->isa_klassptr(), "only klass ptr here");
   return t->make_narrowklass();
 }
 
diff --git a/src/hotspot/share/opto/type.cpp b/src/hotspot/share/opto/type.cpp
index aab2ea3cd3b..308ec819773 100644
--- a/src/hotspot/share/opto/type.cpp
+++ b/src/hotspot/share/opto/type.cpp
@@ -3489,7 +3489,7 @@ TypeOopPtr::TypeOopPtr(TYPES t, PTR ptr, ciKlass* k, const TypeInterfaces* inter
 #ifdef _LP64
   if (_offset > 0 || _offset == Type::OffsetTop || _offset == Type::OffsetBot) {
     if (_offset == oopDesc::klass_offset_in_bytes()) {
-      _is_ptr_to_narrowklass = UseCompressedClassPointers;
+      _is_ptr_to_narrowklass = true;
     } else if (klass() == nullptr) {
       // Array with unknown body type
       assert(this->isa_aryptr(), "only arrays without klass");
diff --git a/src/hotspot/share/prims/whitebox.cpp b/src/hotspot/share/prims/whitebox.cpp
index 5df1461c0fd..a13d0ba47c8 100644
--- a/src/hotspot/share/prims/whitebox.cpp
+++ b/src/hotspot/share/prims/whitebox.cpp
@@ -333,7 +333,6 @@ WB_ENTRY(void, WB_ReadFromNoaccessArea(JNIEnv* env, jobject o))
 WB_END
 
 WB_ENTRY(void, WB_DecodeNKlassAndAccessKlass(JNIEnv* env, jobject o, jint nKlass))
-  assert(UseCompressedClassPointers, "Should only call for UseCompressedClassPointers");
   const narrowKlass nk = (narrowKlass)nKlass;
   const Klass* const k = CompressedKlassPointers::decode_not_null_without_asserts(nKlass);
   printf("WB_DecodeNKlassAndAccessKlass: nk %u k " PTR_FORMAT "\n", nk, p2i(k));
diff --git a/src/hotspot/share/runtime/arguments.cpp b/src/hotspot/share/runtime/arguments.cpp
index dac34017e45..1d79c4d0488 100644
--- a/src/hotspot/share/runtime/arguments.cpp
+++ b/src/hotspot/share/runtime/arguments.cpp
@@ -1554,7 +1554,7 @@ void Arguments::set_heap_size() {
     }
 
 #ifdef _LP64
-    if (UseCompressedOops || UseCompressedClassPointers) {
+    if (UseCompressedOops) {
       // HeapBaseMinAddress can be greater than default but not less than.
       if (!FLAG_IS_DEFAULT(HeapBaseMinAddress)) {
         if (HeapBaseMinAddress < DefaultHeapBaseMinAddress) {
@@ -1567,9 +1567,7 @@ void Arguments::set_heap_size() {
           FLAG_SET_ERGO(HeapBaseMinAddress, DefaultHeapBaseMinAddress);
         }
       }
-    }
 
-    if (UseCompressedOops) {
       uintptr_t heap_end = HeapBaseMinAddress + MaxHeapSize;
       uintptr_t max_coop_heap = max_heap_for_compressed_oops();
 
@@ -3782,10 +3780,6 @@ jint Arguments::parse(const JavaVMInitArgs* initial_cmd_args) {
 
 void Arguments::set_compact_headers_flags() {
 #ifdef _LP64
-  if (UseCompactObjectHeaders && FLAG_IS_CMDLINE(UseCompressedClassPointers) && !UseCompressedClassPointers) {
-    warning("Compact object headers require compressed class pointers. Disabling compact object headers.");
-    FLAG_SET_DEFAULT(UseCompactObjectHeaders, false);
-  }
   if (UseCompactObjectHeaders && !UseObjectMonitorTable) {
     // If UseCompactObjectHeaders is on the command line, turn on UseObjectMonitorTable.
     if (FLAG_IS_CMDLINE(UseCompactObjectHeaders)) {
@@ -3799,9 +3793,6 @@ void Arguments::set_compact_headers_flags() {
       FLAG_SET_DEFAULT(UseObjectMonitorTable, true);
     }
   }
-  if (UseCompactObjectHeaders && !UseCompressedClassPointers) {
-    FLAG_SET_DEFAULT(UseCompressedClassPointers, true);
-  }
 #endif
 }
 
@@ -3817,9 +3808,7 @@ jint Arguments::apply_ergo() {
 
   set_compact_headers_flags();
 
-  if (UseCompressedClassPointers) {
-    CompressedKlassPointers::pre_initialize();
-  }
+  CompressedKlassPointers::pre_initialize();
 
   CDSConfig::ergo_initialize();
 
@@ -3864,10 +3853,6 @@ jint Arguments::apply_ergo() {
     DebugNonSafepoints = true;
   }
 
-  if (FLAG_IS_CMDLINE(CompressedClassSpaceSize) && !UseCompressedClassPointers) {
-    warning("Setting CompressedClassSpaceSize has no effect when compressed class pointers are not used");
-  }
-
   // Treat the odd case where local verification is enabled but remote
   // verification is not as if both were enabled.
   if (BytecodeVerificationLocal && !BytecodeVerificationRemote) {
diff --git a/src/hotspot/share/runtime/globals.hpp b/src/hotspot/share/runtime/globals.hpp
index 60feddde09b..b5c19d8aa36 100644
--- a/src/hotspot/share/runtime/globals.hpp
+++ b/src/hotspot/share/runtime/globals.hpp
@@ -1368,9 +1368,6 @@ const int ObjectAlignmentInBytes = 8;
           "Maximum size of Metaspaces (in bytes)")                          \
           constraint(MaxMetaspaceSizeConstraintFunc,AfterErgo)              \
                                                                             \
-  product(bool, UseCompressedClassPointers, true,                           \
-          "(Deprecated) Use 32-bit class pointers.")                        \
-                                                                            \
   product(size_t, CompressedClassSpaceSize, 1*G,                            \
           "Maximum size of class area in Metaspace when compressed "        \
           "class pointers are used")                                        \
diff --git a/src/hotspot/share/runtime/os.cpp b/src/hotspot/share/runtime/os.cpp
index 129f8f76e73..d55cf454256 100644
--- a/src/hotspot/share/runtime/os.cpp
+++ b/src/hotspot/share/runtime/os.cpp
@@ -1285,7 +1285,7 @@ void os::print_location(outputStream* st, intptr_t x, bool verbose) {
   bool accessible = is_readable_pointer(addr);
 
   // Check if addr points into the narrow Klass protection zone
-  if (UseCompressedClassPointers && CompressedKlassPointers::is_in_protection_zone(addr)) {
+  if (CompressedKlassPointers::is_in_protection_zone(addr)) {
     st->print_cr(PTR_FORMAT " points into nKlass protection zone", p2i(addr));
     return;
   }
@@ -1339,8 +1339,9 @@ void os::print_location(outputStream* st, intptr_t x, bool verbose) {
   }
 
   // Compressed klass needs to be decoded first.
+  // Todo: questionable for COH - can we do this better?
 #ifdef _LP64
-  if (UseCompressedClassPointers && ((uintptr_t)addr &~ (uintptr_t)max_juint) == 0) {
+  if (((uintptr_t)addr &~ (uintptr_t)max_juint) == 0) {
     narrowKlass narrow_klass = (narrowKlass)(uintptr_t)addr;
     Klass* k = CompressedKlassPointers::decode_without_asserts(narrow_klass);
 
diff --git a/src/hotspot/share/runtime/vmStructs.cpp b/src/hotspot/share/runtime/vmStructs.cpp
index b6294a9a168..ad9463443b2 100644
--- a/src/hotspot/share/runtime/vmStructs.cpp
+++ b/src/hotspot/share/runtime/vmStructs.cpp
@@ -163,8 +163,7 @@
   /******************************************************************/                                                               \
                                                                                                                                      \
   volatile_nonstatic_field(oopDesc,            _mark,                                         markWord)                              \
-  volatile_nonstatic_field(oopDesc,            _metadata._klass,                              Klass*)                                \
-  volatile_nonstatic_field(oopDesc,            _metadata._compressed_klass,                   narrowKlass)                           \
+  volatile_nonstatic_field(oopDesc,            _compressed_klass,                             narrowKlass)                           \
   static_field(BarrierSet,                     _barrier_set,                                  BarrierSet*)                           \
   nonstatic_field(ArrayKlass,                  _dimension,                                    const int)                             \
   volatile_nonstatic_field(ArrayKlass,         _higher_dimension,                             ObjArrayKlass*)                        \
diff --git a/src/hotspot/share/services/memoryService.cpp b/src/hotspot/share/services/memoryService.cpp
index f64da3c5477..4636f125079 100644
--- a/src/hotspot/share/services/memoryService.cpp
+++ b/src/hotspot/share/services/memoryService.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -119,11 +119,11 @@ void MemoryService::add_metaspace_memory_pools() {
   mgr->add_pool(_metaspace_pool);
   _pools_list->append(_metaspace_pool);
 
-  if (UseCompressedClassPointers) {
-    _compressed_class_pool = new CompressedKlassSpacePool();
-    mgr->add_pool(_compressed_class_pool);
-    _pools_list->append(_compressed_class_pool);
-  }
+#if INCLUDE_CLASS_SPACE
+  _compressed_class_pool = new CompressedKlassSpacePool();
+  mgr->add_pool(_compressed_class_pool);
+  _pools_list->append(_compressed_class_pool);
+#endif
 
   _managers_list->append(mgr);
 }
diff --git a/src/hotspot/share/utilities/macros.hpp b/src/hotspot/share/utilities/macros.hpp
index a03255b5cf3..3621f675ecb 100644
--- a/src/hotspot/share/utilities/macros.hpp
+++ b/src/hotspot/share/utilities/macros.hpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1997, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -586,6 +586,18 @@
 #define BIG_ENDIAN_ONLY(code) code
 #endif
 
+#ifdef _LP64
+#define INCLUDE_CLASS_SPACE 1
+#define CLASS_SPACE_ONLY(x) x
+#define NOT_CLASS_SPACE(x)
+#else
+// On 32-bit we use fake "narrow class pointers" which are really just 32-bit pointers,
+// but we don't use a class space (would cause too much address space fragmentation)
+#define INCLUDE_CLASS_SPACE 0
+#define CLASS_SPACE_ONLY(x)
+#define NOT_CLASS_SPACE(x) x
+#endif
+
 #define define_pd_global(type, name, value) const type pd_##name = value;
 
 // Helper macros for constructing file names for includes.
diff --git a/src/hotspot/share/utilities/vmError.cpp b/src/hotspot/share/utilities/vmError.cpp
index 48fae6868ab..d78fd331b56 100644
--- a/src/hotspot/share/utilities/vmError.cpp
+++ b/src/hotspot/share/utilities/vmError.cpp
@@ -533,8 +533,7 @@ static void report_vm_version(outputStream* st, char* buf, int buflen) {
                  "", "",
 #endif
                  UseCompressedOops ? ", compressed oops" : "",
-                 UseCompactObjectHeaders ? ", compact obj headers"
-                                         : (UseCompressedClassPointers ? ", compressed class ptrs" : ""),
+                 UseCompactObjectHeaders ? ", compact obj headers" : "",
                  GCConfig::hs_err_name(),
                  VM_Version::vm_platform_string()
                );
@@ -1215,7 +1214,7 @@ void VMError::report(outputStream* st, bool _verbose) {
     CompressedOops::print_mode(st);
     st->cr();
 
-  STEP_IF("printing compressed klass pointers mode", _verbose && UseCompressedClassPointers)
+  STEP_IF("printing compressed klass pointers mode", _verbose)
     CDS_ONLY(AOTMetaspace::print_on(st);)
     Metaspace::print_compressed_class_space(st);
     CompressedKlassPointers::print_mode(st);
@@ -1437,12 +1436,10 @@ void VMError::print_vm_info(outputStream* st) {
 #endif
 
   // STEP("printing compressed class ptrs mode")
-  if (UseCompressedClassPointers) {
-    CDS_ONLY(AOTMetaspace::print_on(st);)
-    Metaspace::print_compressed_class_space(st);
-    CompressedKlassPointers::print_mode(st);
-    st->cr();
-  }
+  CDS_ONLY(AOTMetaspace::print_on(st);)
+  Metaspace::print_compressed_class_space(st);
+  CompressedKlassPointers::print_mode(st);
+  st->cr();
 
   // Take heap lock over heap, GC and metaspace printing so that information
   // is consistent.
diff --git a/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/oops/Array.java b/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/oops/Array.java
index c4eeaf4a367..61067e63707 100644
--- a/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/oops/Array.java
+++ b/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/oops/Array.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2000, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2000, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -83,10 +83,8 @@ public class Array extends Oop {
     }
     if (VM.getVM().isCompactObjectHeadersEnabled()) {
       lengthOffsetInBytes = Oop.getHeaderSize();
-    } else if (VM.getVM().isCompressedKlassPointersEnabled()) {
-      lengthOffsetInBytes = typeSize - VM.getVM().getIntSize();
     } else {
-      lengthOffsetInBytes = typeSize;
+      lengthOffsetInBytes = typeSize - VM.getVM().getIntSize();
     }
     return lengthOffsetInBytes;
   }
diff --git a/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/oops/Instance.java b/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/oops/Instance.java
index 66efbe3484a..fea4fdaabc2 100644
--- a/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/oops/Instance.java
+++ b/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/oops/Instance.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2000, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2000, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -57,10 +57,8 @@ public class Instance extends Oop {
   public static long getHeaderSize() {
     if (VM.getVM().isCompactObjectHeadersEnabled()) {
       return Oop.getHeaderSize();
-    } else if (VM.getVM().isCompressedKlassPointersEnabled()) {
-      return typeSize - VM.getVM().getIntSize();
     } else {
-      return typeSize;
+      return typeSize - VM.getVM().getIntSize();
     }
   }
 
diff --git a/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/oops/Oop.java b/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/oops/Oop.java
index 75ad4ab1d66..951499974fa 100644
--- a/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/oops/Oop.java
+++ b/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/oops/Oop.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2000, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2000, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -51,8 +51,7 @@ public class Oop {
       headerSize = markType.getSize();
     } else {
       headerSize = type.getSize();
-      klass      = new MetadataField(type.getAddressField("_metadata._klass"), 0);
-      compressedKlass  = new NarrowKlassField(type.getAddressField("_metadata._compressed_klass"), 0);
+      compressedKlass  = new NarrowKlassField(type.getAddressField("_compressed_klass"), 0);
     }
   }
 
@@ -75,7 +74,6 @@ public class Oop {
   public  static long getHeaderSize() { return headerSize; } // Header size in bytes.
 
   private static CIntField mark;
-  private static MetadataField  klass;
   private static NarrowKlassField compressedKlass;
 
   // Accessors for declared fields
@@ -83,12 +81,9 @@ public class Oop {
 
   public Klass getKlass() {
     if (VM.getVM().isCompactObjectHeadersEnabled()) {
-      assert(VM.getVM().isCompressedKlassPointersEnabled());
       return getMark().getKlass();
-    } else if (VM.getVM().isCompressedKlassPointersEnabled()) {
-      return (Klass)compressedKlass.getValue(getHandle());
     } else {
-      return (Klass)klass.getValue(getHandle());
+      return (Klass)compressedKlass.getValue(getHandle());
     }
   }
 
@@ -157,11 +152,7 @@ public class Oop {
     if (doVMFields) {
       visitor.doCInt(mark, true);
       if (!VM.getVM().isCompactObjectHeadersEnabled()) {
-        if (VM.getVM().isCompressedKlassPointersEnabled()) {
-          visitor.doMetadata(compressedKlass, true);
-        } else {
-          visitor.doMetadata(klass, true);
-        }
+        visitor.doMetadata(compressedKlass, true);
       }
     }
   }
@@ -220,10 +211,8 @@ public class Oop {
     if (VM.getVM().isCompactObjectHeadersEnabled()) {
       Mark mark = new Mark(handle);
       return mark.getKlass();
-    } else if (VM.getVM().isCompressedKlassPointersEnabled()) {
-      return (Klass)Metadata.instantiateWrapperFor(handle.getCompKlassAddressAt(compressedKlass.getOffset()));
     } else {
-      return (Klass)Metadata.instantiateWrapperFor(handle.getAddressAt(klass.getOffset()));
+      return (Klass)Metadata.instantiateWrapperFor(handle.getCompKlassAddressAt(compressedKlass.getOffset()));
     }
   }
 };
diff --git a/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/runtime/VM.java b/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/runtime/VM.java
index 1607563150a..2ec96121934 100644
--- a/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/runtime/VM.java
+++ b/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/runtime/VM.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2000, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2000, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -144,7 +144,6 @@ public class VM {
   private static CIntegerType boolType;
   private Boolean sharingEnabled;
   private Boolean compressedOopsEnabled;
-  private Boolean compressedKlassPointersEnabled;
   private Boolean compactObjectHeadersEnabled;
 
   // command line flags supplied to VM - see struct JVMFlag in jvmFlag.hpp
@@ -515,11 +514,7 @@ public class VM {
       heapOopSize = (int)getOopSize();
     }
 
-    if (isCompressedKlassPointersEnabled()) {
-      klassPtrSize = (int)getIntSize();
-    } else {
-      klassPtrSize = (int)getOopSize(); // same as an oop
-    }
+    klassPtrSize = (int)getIntSize();
   }
 
   /** This could be used by a reflective runtime system */
@@ -938,15 +933,6 @@ public class VM {
     return compressedOopsEnabled.booleanValue();
   }
 
-  public boolean isCompressedKlassPointersEnabled() {
-    if (compressedKlassPointersEnabled == null) {
-        Flag flag = getCommandLineFlag("UseCompressedClassPointers");
-        compressedKlassPointersEnabled = (flag == null) ? Boolean.FALSE:
-             (flag.getBool()? Boolean.TRUE: Boolean.FALSE);
-    }
-    return compressedKlassPointersEnabled.booleanValue();
-  }
-
   public boolean isCompactObjectHeadersEnabled() {
     if (compactObjectHeadersEnabled == null) {
         Flag flag = getCommandLineFlag("UseCompactObjectHeaders");
diff --git a/test/hotspot/gtest/metaspace/test_is_metaspace_obj.cpp b/test/hotspot/gtest/metaspace/test_is_metaspace_obj.cpp
index a35888c62e2..c1b4abfb355 100644
--- a/test/hotspot/gtest/metaspace/test_is_metaspace_obj.cpp
+++ b/test/hotspot/gtest/metaspace/test_is_metaspace_obj.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2020, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
  * Copyright (c) 2020 SAP SE. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
@@ -65,8 +65,8 @@ public:
 
     // Test VirtualSpaceList::contains
     const VirtualSpaceList* const vslist =
-        (mdType == Metaspace::ClassType && Metaspace::using_class_space()) ?
-         VirtualSpaceList::vslist_class() : VirtualSpaceList::vslist_nonclass();
+       (mdType == Metaspace::ClassType && INCLUDE_CLASS_SPACE) ?
+        VirtualSpaceList::vslist_class() : VirtualSpaceList::vslist_nonclass();
 
     ASSERT_TRUE(vslist->contains((MetaWord*)p));
 
diff --git a/test/hotspot/gtest/metaspace/test_metaspaceUtils.cpp b/test/hotspot/gtest/metaspace/test_metaspaceUtils.cpp
index 49ab816c4a0..68deb283784 100644
--- a/test/hotspot/gtest/metaspace/test_metaspaceUtils.cpp
+++ b/test/hotspot/gtest/metaspace/test_metaspaceUtils.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2020, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
  * Copyright (c) 2020 SAP SE. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
@@ -37,15 +37,15 @@ TEST_VM(metaspace, MetaspaceUtils_reserved) {
   EXPECT_LE(reserved_metadata, reserved);
 }
 
+#if INCLUDE_CLASS_SPACE
 TEST_VM(metaspace, MetaspaceUtils_reserved_compressed_class_pointers) {
-  if (UseCompressedClassPointers && CompressedKlassPointers::needs_class_space()) {
-    size_t reserved = MetaspaceUtils::reserved_bytes();
-    EXPECT_GT(reserved, 0UL);
-    size_t reserved_class = MetaspaceUtils::reserved_bytes(Metaspace::ClassType);
-    EXPECT_GT(reserved_class, 0UL);
-    EXPECT_LE(reserved_class, reserved);
-  }
+  size_t reserved = MetaspaceUtils::reserved_bytes();
+  EXPECT_GT(reserved, 0UL);
+  size_t reserved_class = MetaspaceUtils::reserved_bytes(Metaspace::ClassType);
+  EXPECT_GT(reserved_class, 0UL);
+  EXPECT_LE(reserved_class, reserved);
 }
+#endif // INCLUDE_CLASS_SPACE
 
 TEST_VM(metaspace, MetaspaceUtils_committed) {
   size_t committed = MetaspaceUtils::committed_bytes();
@@ -59,30 +59,15 @@ TEST_VM(metaspace, MetaspaceUtils_committed) {
   EXPECT_LE(committed_metadata, committed);
 }
 
+#if INCLUDE_CLASS_SPACE
 TEST_VM(metaspace, MetaspaceUtils_committed_compressed_class_pointers) {
-  if (UseCompressedClassPointers && CompressedKlassPointers::needs_class_space()) {
-    size_t committed = MetaspaceUtils::committed_bytes();
-    EXPECT_GT(committed, 0UL);
-    size_t committed_class = MetaspaceUtils::committed_bytes(Metaspace::ClassType);
-    EXPECT_GT(committed_class, 0UL);
-    EXPECT_LE(committed_class, committed);
-  }
-}
-
-TEST_VM(metaspace, MetaspaceUtils_non_compressed_class_pointers) {
-  if (UseCompressedClassPointers) {
-    return;
-  }
-
+  size_t committed = MetaspaceUtils::committed_bytes();
+  EXPECT_GT(committed, 0UL);
   size_t committed_class = MetaspaceUtils::committed_bytes(Metaspace::ClassType);
-  EXPECT_EQ(committed_class, 0UL);
-
-  size_t used_class = MetaspaceUtils::used_bytes(Metaspace::ClassType);
-  EXPECT_EQ(used_class, 0UL);
-
-  size_t reserved_class = MetaspaceUtils::reserved_bytes(Metaspace::ClassType);
-  EXPECT_EQ(reserved_class, 0UL);
+  EXPECT_GT(committed_class, 0UL);
+  EXPECT_LE(committed_class, committed);
 }
+#endif // INCLUDE_CLASS_SPACE
 
 static void check_metaspace_stats_are_consistent(const MetaspaceStats& stats) {
   EXPECT_LE(stats.committed(), stats.reserved());
@@ -102,13 +87,13 @@ TEST_VM(MetaspaceUtils, MetaspaceUtils_get_statistics) {
   check_metaspace_stats_are_not_null(combined_stats.non_class_space_stats());
   check_metaspace_stats_are_consistent(combined_stats.non_class_space_stats());
 
-  if (CompressedKlassPointers::needs_class_space() && UseCompressedClassPointers) {
-    check_metaspace_stats_are_not_null(combined_stats.class_space_stats());
-    check_metaspace_stats_are_consistent(combined_stats.class_space_stats());
-  } else {
-    // if we don't have a class space, combined stats should equal non-class stats
-    EXPECT_EQ(combined_stats.non_class_space_stats().reserved(), combined_stats.reserved());
-    EXPECT_EQ(combined_stats.non_class_space_stats().committed(), combined_stats.committed());
-    EXPECT_EQ(combined_stats.non_class_space_stats().used(), combined_stats.used());
-  }
+#if INCLUDE_CLASS_SPACE
+  check_metaspace_stats_are_not_null(combined_stats.class_space_stats());
+  check_metaspace_stats_are_consistent(combined_stats.class_space_stats());
+#else
+  // if we don't have a class space, combined stats should equal non-class stats
+  EXPECT_EQ(combined_stats.non_class_space_stats().reserved(), combined_stats.reserved());
+  EXPECT_EQ(combined_stats.non_class_space_stats().committed(), combined_stats.committed());
+  EXPECT_EQ(combined_stats.non_class_space_stats().used(), combined_stats.used());
+#endif // INCLUDE_CLASS_SPACE
 }
diff --git a/test/hotspot/gtest/oops/test_arrayOop.cpp b/test/hotspot/gtest/oops/test_arrayOop.cpp
index 33163de427c..bb5f54b3f58 100644
--- a/test/hotspot/gtest/oops/test_arrayOop.cpp
+++ b/test/hotspot/gtest/oops/test_arrayOop.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1997, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -97,7 +97,7 @@ TEST_VM(arrayOopDesc, base_offset) {
       EXPECT_EQ(arrayOopDesc::base_offset_in_bytes(T_OBJECT), 16);
       EXPECT_EQ(arrayOopDesc::base_offset_in_bytes(T_ARRAY),  16);
     }
-  } else if (UseCompressedClassPointers) {
+  } else {
     EXPECT_EQ(arrayOopDesc::base_offset_in_bytes(T_BOOLEAN), 16);
     EXPECT_EQ(arrayOopDesc::base_offset_in_bytes(T_BYTE),    16);
     EXPECT_EQ(arrayOopDesc::base_offset_in_bytes(T_SHORT),   16);
@@ -108,22 +108,6 @@ TEST_VM(arrayOopDesc, base_offset) {
     EXPECT_EQ(arrayOopDesc::base_offset_in_bytes(T_DOUBLE),  16);
     EXPECT_EQ(arrayOopDesc::base_offset_in_bytes(T_OBJECT),  16);
     EXPECT_EQ(arrayOopDesc::base_offset_in_bytes(T_ARRAY),   16);
-  } else {
-    EXPECT_EQ(arrayOopDesc::base_offset_in_bytes(T_BOOLEAN), 20);
-    EXPECT_EQ(arrayOopDesc::base_offset_in_bytes(T_BYTE),    20);
-    EXPECT_EQ(arrayOopDesc::base_offset_in_bytes(T_SHORT),   20);
-    EXPECT_EQ(arrayOopDesc::base_offset_in_bytes(T_CHAR),    20);
-    EXPECT_EQ(arrayOopDesc::base_offset_in_bytes(T_INT),     20);
-    EXPECT_EQ(arrayOopDesc::base_offset_in_bytes(T_FLOAT),   20);
-    EXPECT_EQ(arrayOopDesc::base_offset_in_bytes(T_LONG),    24);
-    EXPECT_EQ(arrayOopDesc::base_offset_in_bytes(T_DOUBLE),  24);
-    if (UseCompressedOops) {
-      EXPECT_EQ(arrayOopDesc::base_offset_in_bytes(T_OBJECT), 20);
-      EXPECT_EQ(arrayOopDesc::base_offset_in_bytes(T_ARRAY),  20);
-    } else {
-      EXPECT_EQ(arrayOopDesc::base_offset_in_bytes(T_OBJECT), 24);
-      EXPECT_EQ(arrayOopDesc::base_offset_in_bytes(T_ARRAY),  24);
-    }
   }
 #else
   EXPECT_EQ(arrayOopDesc::base_offset_in_bytes(T_BOOLEAN), 12);
diff --git a/test/hotspot/gtest/oops/test_compressedKlass.cpp b/test/hotspot/gtest/oops/test_compressedKlass.cpp
index dcdb335adb5..5a7323edc03 100644
--- a/test/hotspot/gtest/oops/test_compressedKlass.cpp
+++ b/test/hotspot/gtest/oops/test_compressedKlass.cpp
@@ -29,9 +29,6 @@
 #include "unittest.hpp"
 
 TEST_VM(CompressedKlass, basics) {
-  if (!UseCompressedClassPointers) {
-    return;
-  }
   ASSERT_LE(CompressedKlassPointers::base(), CompressedKlassPointers::klass_range_start());
   ASSERT_LT(CompressedKlassPointers::klass_range_start(), CompressedKlassPointers::klass_range_end());
   ASSERT_LE(CompressedKlassPointers::klass_range_end(), CompressedKlassPointers::encoding_range_end());
@@ -54,22 +51,7 @@ TEST_VM(CompressedKlass, basics) {
 #endif // _LP64
 }
 
-TEST_VM(CompressedKlass, ccp_off) {
-  if (UseCompressedClassPointers) {
-    return;
-  }
-  ASSERT_EQ(CompressedKlassPointers::klass_range_start(), (address)nullptr);
-  ASSERT_EQ(CompressedKlassPointers::klass_range_end(), (address)nullptr);
-  // We should be able to call CompressedKlassPointers::is_encodable, and it should
-  // always return false
-  ASSERT_FALSE(CompressedKlassPointers::is_encodable((address)0x12345));
-}
-
-
 TEST_VM(CompressedKlass, test_too_low_address) {
-  if (!UseCompressedClassPointers) {
-    return;
-  }
   address really_low = (address) 32;
   ASSERT_FALSE(CompressedKlassPointers::is_encodable(really_low));
   address low = CompressedKlassPointers::klass_range_start() - 1;
@@ -77,9 +59,6 @@ TEST_VM(CompressedKlass, test_too_low_address) {
 }
 
 TEST_VM(CompressedKlass, test_too_high_address) {
-  if (!UseCompressedClassPointers) {
-    return;
-  }
   address really_high = (address) UINTPTR_MAX;
   ASSERT_FALSE(CompressedKlassPointers::is_encodable(really_high));
   address high = CompressedKlassPointers::klass_range_end();
@@ -87,9 +66,6 @@ TEST_VM(CompressedKlass, test_too_high_address) {
 }
 
 TEST_VM(CompressedKlass, test_unaligned_address) {
-  if (!UseCompressedClassPointers) {
-    return;
-  }
   const size_t alignment = CompressedKlassPointers::klass_alignment_in_bytes();
   address addr = CompressedKlassPointers::klass_range_start() + alignment - 1;
   ASSERT_FALSE(CompressedKlassPointers::is_encodable(addr));
@@ -103,9 +79,6 @@ TEST_VM(CompressedKlass, test_unaligned_address) {
 }
 
 TEST_VM(CompressedKlass, test_good_address) {
-  if (!UseCompressedClassPointers) {
-    return;
-  }
   const size_t alignment = CompressedKlassPointers::klass_alignment_in_bytes();
   address addr = CompressedKlassPointers::klass_range_start();
   ASSERT_TRUE(CompressedKlassPointers::is_encodable(addr));
@@ -114,9 +87,6 @@ TEST_VM(CompressedKlass, test_good_address) {
 }
 
 TEST_VM(CompressedKlass, test_is_valid_narrow_klass) {
-  if (!UseCompressedClassPointers) {
-    return;
-  }
   ASSERT_FALSE(CompressedKlassPointers::is_valid_narrow_klass_id(0));
   narrowKlass nk_jlC = CompressedKlassPointers::encode((Klass*)vmClasses::Class_klass());
   ASSERT_TRUE(CompressedKlassPointers::is_valid_narrow_klass_id(nk_jlC));
diff --git a/test/hotspot/gtest/oops/test_objArrayOop.cpp b/test/hotspot/gtest/oops/test_objArrayOop.cpp
index 22c9b2efc11..f6a53a3031f 100644
--- a/test/hotspot/gtest/oops/test_objArrayOop.cpp
+++ b/test/hotspot/gtest/oops/test_objArrayOop.cpp
@@ -27,35 +27,29 @@
 
 TEST_VM(objArrayOop, osize) {
   static const struct {
-    int objal; bool ccp; bool coops; bool coh; int result;
+    int objal; bool coops; bool coh; int result;
   } x[] = {
-//    ObjAligInB, UseCCP, UseCoops, UseCOH, object size in heap words
+//    ObjAligInB, UseCoops, UseCOH, object size in heap words
 #ifdef _LP64
-    { 8,          false,  false, false,   4 },  // 20 byte header, 8 byte oops
-    { 8,          false,  true,  false,   3 },  // 20 byte header, 4 byte oops
-    { 8,          true,   false, false,   3 },  // 16 byte header, 8 byte oops
-    { 8,          true,   true,  false,   3 },  // 16 byte header, 4 byte oops
-    { 8,          true,   false, true,    3 },  // 12 byte header, 8 byte oops
-    { 8,          true,   true,  true,    2 },  // 12 byte header, 4 byte oops
-    { 16,         false,  false, false,   4 },  // 20 byte header, 8 byte oops, 16-byte align
-    { 16,         false,  true,  false,   4 },  // 20 byte header, 4 byte oops, 16-byte align
-    { 16,         true,   false, false,   4 },  // 16 byte header, 8 byte oops, 16-byte align
-    { 16,         true,   true,  false,   4 },  // 16 byte header, 4 byte oops, 16-byte align
-    { 16,         true,   false, true,    4 },  // 12 byte header, 8 byte oops, 16-byte align
-    { 16,         true,   true,  true,    2 },  // 12 byte header, 4 byte oops, 16-byte align
-    { 256,        false,  false, false,  32 }, // 20 byte header, 8 byte oops, 256-byte align
-    { 256,        false,  true,  false,  32 }, // 20 byte header, 4 byte oops, 256-byte align
-    { 256,        true,   false, false,  32 }, // 16 byte header, 8 byte oops, 256-byte align
-    { 256,        true,   true,  false,  32 }, // 16 byte header, 4 byte oops, 256-byte align
-    { 256,        true,   false, true,   32 }, // 12 byte header, 8 byte oops, 256-byte align
-    { 256,        true,   true,  true,   32 }, // 12 byte header, 4 byte oops, 256-byte align
+    { 8,          false, false,   3 },  // 16 byte header, 8 byte oops
+    { 8,          true,  false,   3 },  // 16 byte header, 4 byte oops
+    { 8,          false, true,    3 },  // 12 byte header, 8 byte oops
+    { 8,          true,  true,    2 },  // 12 byte header, 4 byte oops
+    { 16,         false, false,   4 },  // 16 byte header, 8 byte oops, 16-byte align
+    { 16,         true,  false,   4 },  // 16 byte header, 4 byte oops, 16-byte align
+    { 16,         false, true,    4 },  // 12 byte header, 8 byte oops, 16-byte align
+    { 16,         true,  true,    2 },  // 12 byte header, 4 byte oops, 16-byte align
+    { 256,        false, false,  32 }, // 16 byte header, 8 byte oops, 256-byte align
+    { 256,        true,  false,  32 }, // 16 byte header, 4 byte oops, 256-byte align
+    { 256,        false, true,   32 }, // 12 byte header, 8 byte oops, 256-byte align
+    { 256,        true,  true,   32 }, // 12 byte header, 4 byte oops, 256-byte align
 #else
-    { 8,          false,  false, false,   4 }, // 12 byte header, 4 byte oops, wordsize 4
+    { 8,          false, false,   4 }, // 12 byte header, 4 byte oops, wordsize 4
 #endif
-    { -1,         false,  false, false,  -1 }
+    { -1,         false, false,  -1 }
   };
   for (int i = 0; x[i].result != -1; i++) {
-    if (x[i].objal == (int)ObjectAlignmentInBytes && x[i].ccp == UseCompressedClassPointers && x[i].coops == UseCompressedOops &&
+    if (x[i].objal == (int)ObjectAlignmentInBytes && x[i].coops == UseCompressedOops &&
         x[i].coh == UseCompactObjectHeaders) {
       EXPECT_EQ(objArrayOopDesc::object_size(1), (size_t)x[i].result);
     }
diff --git a/test/hotspot/jtreg/compiler/arraycopy/TestObjectArrayClone.java b/test/hotspot/jtreg/compiler/arraycopy/TestObjectArrayClone.java
index b7e5b135c64..595205055ee 100644
--- a/test/hotspot/jtreg/compiler/arraycopy/TestObjectArrayClone.java
+++ b/test/hotspot/jtreg/compiler/arraycopy/TestObjectArrayClone.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2016, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2016, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -34,10 +34,6 @@
  * @run main/othervm -XX:CompileCommand=compileonly,compiler.arraycopy.TestObjectArrayClone::testClone*
  *                   -XX:CompileCommand=compileonly,jdk.internal.reflect.GeneratedMethodAccessor*::invoke
  *                   compiler.arraycopy.TestObjectArrayClone
- * @run main/othervm -XX:+IgnoreUnrecognizedVMOptions -XX:-UseCompressedClassPointers -Xmx128m
- *                   -XX:CompileCommand=compileonly,compiler.arraycopy.TestObjectArrayClone::testClone*
- *                   -XX:CompileCommand=compileonly,jdk.internal.reflect.GeneratedMethodAccessor*::invoke
- *                   compiler.arraycopy.TestObjectArrayClone
  * @run main/othervm -Xbatch -XX:-UseTypeProfile
  *                   -XX:CompileCommand=compileonly,compiler.arraycopy.TestObjectArrayClone::testClone*
  *                   -XX:CompileCommand=compileonly,jdk.internal.reflect.GeneratedMethodAccessor*::invoke
diff --git a/test/hotspot/jtreg/compiler/c1/TestArrayCopyToFromObject.java b/test/hotspot/jtreg/compiler/c1/TestArrayCopyToFromObject.java
index 98c8c24dd3a..176226806a6 100644
--- a/test/hotspot/jtreg/compiler/c1/TestArrayCopyToFromObject.java
+++ b/test/hotspot/jtreg/compiler/c1/TestArrayCopyToFromObject.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2016, 2023, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2016, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,8 +25,7 @@
  * @test
  * @bug 8160591
  * @summary C1-generated code for System.arraycopy() does not throw an ArrayStoreException if 'dst' is no a "proper" array (i.e., it is java.lang.Object)
- * @run main/othervm -XX:+IgnoreUnrecognizedVMOptions -XX:+TieredCompilation -XX:TieredStopAtLevel=1 -Xcomp -XX:-UseCompressedClassPointers -XX:CompileOnly=TestArrayCopyToFromObject::test TestArrayCopyToFromObject
- * @run main/othervm -XX:+IgnoreUnrecognizedVMOptions -XX:+TieredCompilation -XX:TieredStopAtLevel=1 -Xcomp -XX:+UseCompressedClassPointers -XX:CompileOnly=TestArrayCopyToFromObject::test TestArrayCopyToFromObject
+ * @run main/othervm -XX:+IgnoreUnrecognizedVMOptions -XX:+TieredCompilation -XX:TieredStopAtLevel=1 -Xcomp -XX:CompileOnly=TestArrayCopyToFromObject::test TestArrayCopyToFromObject
  */
 public class TestArrayCopyToFromObject {
 
diff --git a/test/hotspot/jtreg/compiler/c2/TestReduceAllocationAndLoadKlass.java b/test/hotspot/jtreg/compiler/c2/TestReduceAllocationAndLoadKlass.java
deleted file mode 100644
index a8997535aae..00000000000
--- a/test/hotspot/jtreg/compiler/c2/TestReduceAllocationAndLoadKlass.java
+++ /dev/null
@@ -1,63 +0,0 @@
-/*
- * Copyright (c) 2024, 2025, Oracle and/or its affiliates. All rights reserved.
- * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
- *
- * This code is free software; you can redistribute it and/or modify it
- * under the terms of the GNU General Public License version 2 only, as
- * published by the Free Software Foundation.
- *
- * This code is distributed in the hope that it will be useful, but WITHOUT
- * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
- * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
- * version 2 for more details (a copy is included in the LICENSE file that
- * accompanied this code).
- *
- * You should have received a copy of the GNU General Public License version
- * 2 along with this work; if not, write to the Free Software Foundation,
- * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
- *
- * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
- * or visit www.oracle.com if you need additional information or have any
- * questions.
- */
-
-/*
- * @test
- * @bug 8330795
- * @summary Check that Reduce Allocation Merges doesn't crash when CompressedClassPointers
- *          is disabled and there is an access to Klass "field" through the phi.
- * @requires vm.bits == 64 & vm.flagless & vm.compiler2.enabled & vm.opt.final.EliminateAllocations
- * @run main/othervm -XX:CompileCommand=dontinline,*TestReduceAllocationAndLoadKlass*::test
- *                   -XX:CompileCommand=compileonly,*TestReduceAllocationAndLoadKlass*::test
- *                   -XX:CompileCommand=compileonly,*Shape*::*init*
- *                   -XX:CompileCommand=compileonly,*Point*::*init*
- *                   -XX:CompileCommand=exclude,*TestReduceAllocationAndLoadKlass*::dummy
- *                   -XX:-TieredCompilation
- *                   -XX:-UseCompressedClassPointers
- *                   -Xbatch
- *                   -Xcomp
- *                   compiler.c2.TestReduceAllocationAndLoadKlass
- */
-
-package compiler.c2;
-
-public class TestReduceAllocationAndLoadKlass {
-    public static void main(String[] args) {
-        Point p = new Point();
-        Line q = new Line();
-
-        test(true);
-        test(false);
-    }
-
-    static Class test(boolean cond) {
-        Object p = cond ? dummy() : new Line();
-        return p.getClass();
-    }
-
-    static Point dummy() { return new Point(); }
-
-    static class Shape { }
-    static class Point extends Shape { }
-    static class Line extends Shape { }
-}
diff --git a/test/hotspot/jtreg/compiler/c2/irTests/scalarReplacement/AllocationMergesTests.java b/test/hotspot/jtreg/compiler/c2/irTests/scalarReplacement/AllocationMergesTests.java
index 24065bd97b9..2c84ad2676e 100644
--- a/test/hotspot/jtreg/compiler/c2/irTests/scalarReplacement/AllocationMergesTests.java
+++ b/test/hotspot/jtreg/compiler/c2/irTests/scalarReplacement/AllocationMergesTests.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2023, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2023, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -46,26 +46,13 @@ public class AllocationMergesTests {
                                              "-XX:+TraceReduceAllocationMerges",
                                              "-XX:+DeoptimizeALot",
                                              "-XX:+UseCompressedOops",
-                                             "-XX:+UseCompressedClassPointers",
                                              "-XX:CompileCommand=inline,*::charAt*",
                                              "-XX:CompileCommand=inline,*PicturePositions::*",
                                              "-XX:CompileCommand=inline,*Point::*",
                                              "-XX:CompileCommand=inline,*Nested::*",
                                              "-XX:CompileCommand=exclude,*::dummy*");
 
-        Scenario scenario1 = new Scenario(1, "-XX:+UnlockDiagnosticVMOptions",
-                                             "-XX:+ReduceAllocationMerges",
-                                             "-XX:+TraceReduceAllocationMerges",
-                                             "-XX:+DeoptimizeALot",
-                                             "-XX:+UseCompressedOops",
-                                             "-XX:-UseCompressedClassPointers",
-                                             "-XX:CompileCommand=inline,*::charAt*",
-                                             "-XX:CompileCommand=inline,*PicturePositions::*",
-                                             "-XX:CompileCommand=inline,*Point::*",
-                                             "-XX:CompileCommand=inline,*Nested::*",
-                                             "-XX:CompileCommand=exclude,*::dummy*");
-
-        Scenario scenario2 = new Scenario(2, "-XX:+UnlockDiagnosticVMOptions",
+        Scenario scenario1 = new Scenario(2, "-XX:+UnlockDiagnosticVMOptions",
                                              "-XX:+ReduceAllocationMerges",
                                              "-XX:+TraceReduceAllocationMerges",
                                              "-XX:+DeoptimizeALot",
@@ -76,12 +63,11 @@ public class AllocationMergesTests {
                                              "-XX:CompileCommand=inline,*Nested::*",
                                              "-XX:CompileCommand=exclude,*::dummy*");
 
-        Scenario scenario3 = new Scenario(3, "-XX:+UnlockDiagnosticVMOptions",
+        Scenario scenario2 = new Scenario(3, "-XX:+UnlockDiagnosticVMOptions",
                                              "-XX:+ReduceAllocationMerges",
                                              "-XX:+TraceReduceAllocationMerges",
                                              "-XX:+DeoptimizeALot",
                                              "-XX:+UseCompressedOops",
-                                             "-XX:+UseCompressedClassPointers",
                                              "-XX:-OptimizePtrCompare",
                                              "-XX:+VerifyReduceAllocationMerges",
                                              "-XX:CompileCommand=inline,*::charAt*",
@@ -90,7 +76,7 @@ public class AllocationMergesTests {
                                              "-XX:CompileCommand=inline,*Nested::*",
                                              "-XX:CompileCommand=exclude,*::dummy*");
 
-        framework.addScenarios(scenario0, scenario1, scenario2, scenario3).start();
+        framework.addScenarios(scenario0, scenario1, scenario2).start();
     }
 
     // ------------------ No Scalar Replacement Should Happen in The Tests Below ------------------- //
diff --git a/test/hotspot/jtreg/compiler/jvmci/compilerToVM/GetResolvedJavaTypeTest.java b/test/hotspot/jtreg/compiler/jvmci/compilerToVM/GetResolvedJavaTypeTest.java
index e0302e7b5aa..1e2e2d50232 100644
--- a/test/hotspot/jtreg/compiler/jvmci/compilerToVM/GetResolvedJavaTypeTest.java
+++ b/test/hotspot/jtreg/compiler/jvmci/compilerToVM/GetResolvedJavaTypeTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2015, 2022, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2015, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -159,7 +159,6 @@ public class GetResolvedJavaTypeTest {
     /* a compressed parameter for tested method is set to false because
        unsafe.getKlassPointer always returns uncompressed pointer */
     private static final boolean COMPRESSED = false;
-            // = WB.getBooleanVMFlag("UseCompressedClassPointers");
 
     private static long getPtrToKlass() {
         Field field;
diff --git a/test/hotspot/jtreg/compiler/jvmci/jdk.vm.ci.code.test/src/jdk/vm/ci/code/test/DataPatchTest.java b/test/hotspot/jtreg/compiler/jvmci/jdk.vm.ci.code.test/src/jdk/vm/ci/code/test/DataPatchTest.java
index adbad3e0b4d..b0c7d11edfe 100644
--- a/test/hotspot/jtreg/compiler/jvmci/jdk.vm.ci.code.test/src/jdk/vm/ci/code/test/DataPatchTest.java
+++ b/test/hotspot/jtreg/compiler/jvmci/jdk.vm.ci.code.test/src/jdk/vm/ci/code/test/DataPatchTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2015, 2022, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2015, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -119,7 +119,6 @@ public class DataPatchTest extends CodeInstallationTest {
 
     @Test
     public void testInlineNarrowMetadata() {
-        Assume.assumeTrue(config.useCompressedClassPointers);
         test(asm -> {
             ResolvedJavaType type = metaAccess.lookupJavaType(getConstClass());
             HotSpotConstant hub = (HotSpotConstant) constantReflection.asObjectHub(type);
@@ -144,7 +143,6 @@ public class DataPatchTest extends CodeInstallationTest {
 
     @Test
     public void testNarrowMetadataInDataSection() {
-        Assume.assumeTrue(config.useCompressedClassPointers);
         test(asm -> {
             ResolvedJavaType type = metaAccess.lookupJavaType(getConstClass());
             HotSpotConstant hub = (HotSpotConstant) constantReflection.asObjectHub(type);
diff --git a/test/hotspot/jtreg/compiler/jvmci/jdk.vm.ci.code.test/src/jdk/vm/ci/code/test/TestHotSpotVMConfig.java b/test/hotspot/jtreg/compiler/jvmci/jdk.vm.ci.code.test/src/jdk/vm/ci/code/test/TestHotSpotVMConfig.java
index a26872b96ae..4b0065d0e70 100644
--- a/test/hotspot/jtreg/compiler/jvmci/jdk.vm.ci.code.test/src/jdk/vm/ci/code/test/TestHotSpotVMConfig.java
+++ b/test/hotspot/jtreg/compiler/jvmci/jdk.vm.ci.code.test/src/jdk/vm/ci/code/test/TestHotSpotVMConfig.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2016, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2016, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -36,7 +36,6 @@ public class TestHotSpotVMConfig extends HotSpotVMConfigAccess {
     }
 
     public final boolean useCompressedOops = getFlag("UseCompressedOops", Boolean.class);
-    public final boolean useCompressedClassPointers = getFlag("UseCompressedClassPointers", Boolean.class);
 
     public final long narrowOopBase = getFieldValue("CompilerToVM::Data::Universe_narrow_oop_base", Long.class, "address");
     public final int narrowOopShift = getFieldValue("CompilerToVM::Data::Universe_narrow_oop_shift", Integer.class, "int");
diff --git a/test/hotspot/jtreg/compiler/types/TestCheckCastPPBecomesTOP.java b/test/hotspot/jtreg/compiler/types/TestCheckCastPPBecomesTOP.java
index 5c57e479307..38ab9121b47 100644
--- a/test/hotspot/jtreg/compiler/types/TestCheckCastPPBecomesTOP.java
+++ b/test/hotspot/jtreg/compiler/types/TestCheckCastPPBecomesTOP.java
@@ -30,9 +30,6 @@
  * @run main/othervm -XX:-TieredCompilation -XX:-UseOnStackReplacement -XX:-BackgroundCompilation
  *                   -XX:CompileOnly=TestCheckCastPPBecomesTOP::test1 -XX:LoopMaxUnroll=0
  *                   -XX:CompileCommand=dontinline,TestCheckCastPPBecomesTOP::notInlined -XX:+UseParallelGC TestCheckCastPPBecomesTOP
- * @run main/othervm -XX:+IgnoreUnrecognizedVMOptions -XX:-TieredCompilation -XX:-UseOnStackReplacement -XX:-BackgroundCompilation
- *                   -XX:CompileOnly=TestCheckCastPPBecomesTOP::test1 -XX:LoopMaxUnroll=0
- *                   -XX:CompileCommand=dontinline,TestCheckCastPPBecomesTOP::notInlined -XX:+UseParallelGC -XX:-UseCompressedClassPointers TestCheckCastPPBecomesTOP
  *
  */
 
diff --git a/test/hotspot/jtreg/compiler/unsafe/OpaqueAccesses.java b/test/hotspot/jtreg/compiler/unsafe/OpaqueAccesses.java
index 9a31cbbb057..00c3ce5fb7f 100644
--- a/test/hotspot/jtreg/compiler/unsafe/OpaqueAccesses.java
+++ b/test/hotspot/jtreg/compiler/unsafe/OpaqueAccesses.java
@@ -247,28 +247,14 @@ public class OpaqueAccesses {
                 "--add-exports=java.base/jdk.internal.misc=ALL-UNNAMED",
                 "-XX:+IgnoreUnrecognizedVMOptions", "-XX:+UnlockDiagnosticVMOptions",
                 "-XX:-TieredCompilation", "-Xbatch",
-                "-XX:+UseCompressedOops", "-XX:+UseCompressedClassPointers",
+                "-XX:+UseCompressedOops",
                 "-XX:CompileCommand=dontinline,compiler.unsafe.OpaqueAccesses::test*"
         );
         TestFramework.runWithFlags(
                 "--add-exports=java.base/jdk.internal.misc=ALL-UNNAMED",
                 "-XX:+IgnoreUnrecognizedVMOptions", "-XX:+UnlockDiagnosticVMOptions",
                 "-XX:-TieredCompilation", "-Xbatch",
-                "-XX:+UseCompressedOops", "-XX:-UseCompressedClassPointers",
-                "-XX:CompileCommand=dontinline,compiler.unsafe.OpaqueAccesses::test*"
-        );
-        TestFramework.runWithFlags(
-                "--add-exports=java.base/jdk.internal.misc=ALL-UNNAMED",
-                "-XX:+IgnoreUnrecognizedVMOptions", "-XX:+UnlockDiagnosticVMOptions",
-                "-XX:-TieredCompilation", "-Xbatch",
-                "-XX:-UseCompressedOops", "-XX:+UseCompressedClassPointers",
-                "-XX:CompileCommand=dontinline,compiler.unsafe.OpaqueAccesses::test*"
-        );
-        TestFramework.runWithFlags(
-                "--add-exports=java.base/jdk.internal.misc=ALL-UNNAMED",
-                "-XX:+IgnoreUnrecognizedVMOptions", "-XX:+UnlockDiagnosticVMOptions",
-                "-XX:-TieredCompilation", "-Xbatch",
-                "-XX:-UseCompressedOops", "-XX:-UseCompressedClassPointers",
+                "-XX:-UseCompressedOops",
                 "-XX:CompileCommand=dontinline,compiler.unsafe.OpaqueAccesses::test*"
         );
     }
diff --git a/test/hotspot/jtreg/gc/arguments/TestCompressedClassFlags.java b/test/hotspot/jtreg/gc/arguments/TestCompressedClassFlags.java
deleted file mode 100644
index b152fc8c936..00000000000
--- a/test/hotspot/jtreg/gc/arguments/TestCompressedClassFlags.java
+++ /dev/null
@@ -1,53 +0,0 @@
-/*
- * Copyright (c) 2013, 2024, Oracle and/or its affiliates. All rights reserved.
- * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
- *
- * This code is free software; you can redistribute it and/or modify it
- * under the terms of the GNU General Public License version 2 only, as
- * published by the Free Software Foundation.
- *
- * This code is distributed in the hope that it will be useful, but WITHOUT
- * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
- * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
- * version 2 for more details (a copy is included in the LICENSE file that
- * accompanied this code).
- *
- * You should have received a copy of the GNU General Public License version
- * 2 along with this work; if not, write to the Free Software Foundation,
- * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
- *
- * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
- * or visit www.oracle.com if you need additional information or have any
- * questions.
- */
-
-package gc.arguments;
-
-import jdk.test.lib.process.OutputAnalyzer;
-import jdk.test.lib.Platform;
-
-/*
- * @test
- * @bug 8015107
- * @summary Tests that VM prints a warning when -XX:CompressedClassSpaceSize
- *          is used together with -XX:-UseCompressedClassPointers
- * @library /test/lib
- * @library /
- * @modules java.base/jdk.internal.misc
- *          java.management
- * @requires vm.opt.CompressedClassSpaceSize == null & vm.opt.UseCompressedClassPointers == null
- * @run driver gc.arguments.TestCompressedClassFlags
- */
-public class TestCompressedClassFlags {
-    public static void main(String[] args) throws Exception {
-        if (Platform.is64bit()) {
-            OutputAnalyzer output = GCArguments.executeTestJava(
-                "-XX:CompressedClassSpaceSize=1g",
-                "-XX:-UseCompressedClassPointers",
-                "-version");
-            output.shouldContain("warning");
-            output.shouldNotContain("error");
-            output.shouldHaveExitValue(0);
-        }
-    }
-}
diff --git a/test/hotspot/jtreg/gc/g1/TestSharedArchiveWithPreTouch.java b/test/hotspot/jtreg/gc/g1/TestSharedArchiveWithPreTouch.java
index 1156a2166c1..bba3c850213 100644
--- a/test/hotspot/jtreg/gc/g1/TestSharedArchiveWithPreTouch.java
+++ b/test/hotspot/jtreg/gc/g1/TestSharedArchiveWithPreTouch.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2016, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2016, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -53,7 +53,7 @@ public class TestSharedArchiveWithPreTouch {
         List<String> dump_args = new ArrayList<String>(BaseOptions);
 
         if (Platform.is64bit()) {
-          dump_args.addAll(0, Arrays.asList(new String[] { "-XX:+UseCompressedClassPointers", "-XX:+UseCompressedOops" }));
+          dump_args.addFirst("-XX:+UseCompressedOops" );
         }
         dump_args.addAll(Arrays.asList(new String[] { "-Xshare:dump", "-Xlog:cds" }));
 
@@ -66,7 +66,7 @@ public class TestSharedArchiveWithPreTouch {
             List<String> load_args = new ArrayList<String>(BaseOptions);
 
             if (Platform.is64bit()) {
-                load_args.addAll(0, Arrays.asList(new String[] { "-XX:+UseCompressedClassPointers", "-XX:+UseCompressedOops" }));
+                load_args.addFirst("-XX:+UseCompressedOops" );
             }
             load_args.addAll(Arrays.asList(new String[] { "-Xshare:on", "-version" }));
 
diff --git a/test/hotspot/jtreg/gc/metaspace/TestMetaspaceMemoryPool.java b/test/hotspot/jtreg/gc/metaspace/TestMetaspaceMemoryPool.java
index 71cf2003ddd..2f4ce3df8b2 100644
--- a/test/hotspot/jtreg/gc/metaspace/TestMetaspaceMemoryPool.java
+++ b/test/hotspot/jtreg/gc/metaspace/TestMetaspaceMemoryPool.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2013, 2019, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2013, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -37,10 +37,9 @@ import static jdk.test.lib.Asserts.*;
  * @library /
  * @modules java.base/jdk.internal.misc
  *          java.management
- * @run main/othervm -XX:-UseCompressedOops gc.metaspace.TestMetaspaceMemoryPool
- * @run main/othervm -XX:-UseCompressedOops -XX:MaxMetaspaceSize=60m gc.metaspace.TestMetaspaceMemoryPool
- * @run main/othervm -XX:+UseCompressedOops -XX:+UseCompressedClassPointers gc.metaspace.TestMetaspaceMemoryPool
- * @run main/othervm -XX:+UseCompressedOops -XX:+UseCompressedClassPointers -XX:CompressedClassSpaceSize=60m gc.metaspace.TestMetaspaceMemoryPool
+ * @run main/othervm gc.metaspace.TestMetaspaceMemoryPool
+ * @run main/othervm -XX:MaxMetaspaceSize=60m gc.metaspace.TestMetaspaceMemoryPool
+ * @run main/othervm -XX:CompressedClassSpaceSize=60m gc.metaspace.TestMetaspaceMemoryPool
  */
 
 public class TestMetaspaceMemoryPool {
@@ -51,10 +50,8 @@ public class TestMetaspaceMemoryPool {
         verifyMemoryPool(getMemoryPool("Metaspace"), isMetaspaceMaxDefined);
 
         if (Platform.is64bit()) {
-            if (InputArguments.contains("-XX:+UseCompressedOops")) {
-                MemoryPoolMXBean cksPool = getMemoryPool("Compressed Class Space");
-                verifyMemoryPool(cksPool, true);
-            }
+            MemoryPoolMXBean cksPool = getMemoryPool("Compressed Class Space");
+            verifyMemoryPool(cksPool, true);
         }
     }
 
diff --git a/test/hotspot/jtreg/gc/metaspace/TestMetaspacePerfCounters.java b/test/hotspot/jtreg/gc/metaspace/TestMetaspacePerfCounters.java
index b0f779109e1..5ead40c9068 100644
--- a/test/hotspot/jtreg/gc/metaspace/TestMetaspacePerfCounters.java
+++ b/test/hotspot/jtreg/gc/metaspace/TestMetaspacePerfCounters.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2013, 2022, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2013, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -48,8 +48,7 @@ import gc.testlibrary.PerfCounters;
  *          java.compiler
  *          java.management/sun.management
  *          jdk.internal.jvmstat/sun.jvmstat.monitor
- * @run main/othervm -XX:-UseCompressedOops -XX:-UseCompressedClassPointers -XX:+UsePerfData -XX:+UseSerialGC gc.metaspace.TestMetaspacePerfCounters
- * @run main/othervm -XX:+UseCompressedOops -XX:+UseCompressedClassPointers -XX:+UsePerfData -XX:+UseSerialGC gc.metaspace.TestMetaspacePerfCounters
+ * @run main/othervm -XX:+UseCompressedOops -XX:+UsePerfData -XX:+UseSerialGC gc.metaspace.TestMetaspacePerfCounters
  */
 
 /* @test id=Parallel-64
@@ -63,8 +62,7 @@ import gc.testlibrary.PerfCounters;
  *          java.compiler
  *          java.management/sun.management
  *          jdk.internal.jvmstat/sun.jvmstat.monitor
- * @run main/othervm -XX:-UseCompressedOops -XX:-UseCompressedClassPointers -XX:+UsePerfData -XX:+UseParallelGC gc.metaspace.TestMetaspacePerfCounters
- * @run main/othervm -XX:+UseCompressedOops -XX:+UseCompressedClassPointers -XX:+UsePerfData -XX:+UseParallelGC gc.metaspace.TestMetaspacePerfCounters
+ * @run main/othervm -XX:+UseCompressedOops -XX:+UsePerfData -XX:+UseParallelGC gc.metaspace.TestMetaspacePerfCounters
  */
 
 /* @test id=G1-64
@@ -78,8 +76,7 @@ import gc.testlibrary.PerfCounters;
  *          java.compiler
  *          java.management/sun.management
  *          jdk.internal.jvmstat/sun.jvmstat.monitor
- * @run main/othervm -XX:-UseCompressedOops -XX:-UseCompressedClassPointers -XX:+UsePerfData -XX:+UseG1GC gc.metaspace.TestMetaspacePerfCounters
- * @run main/othervm -XX:+UseCompressedOops -XX:+UseCompressedClassPointers -XX:+UsePerfData -XX:+UseG1GC gc.metaspace.TestMetaspacePerfCounters
+ * @run main/othervm -XX:+UseCompressedOops -XX:+UsePerfData -XX:+UseG1GC gc.metaspace.TestMetaspacePerfCounters
  */
 
 /* @test id=Shenandoah-64
@@ -93,8 +90,7 @@ import gc.testlibrary.PerfCounters;
  *          java.compiler
  *          java.management/sun.management
  *          jdk.internal.jvmstat/sun.jvmstat.monitor
- * @run main/othervm -XX:-UseCompressedOops -XX:-UseCompressedClassPointers -XX:+UsePerfData -XX:+UseShenandoahGC gc.metaspace.TestMetaspacePerfCounters
- * @run main/othervm -XX:+UseCompressedOops -XX:+UseCompressedClassPointers -XX:+UsePerfData -XX:+UseShenandoahGC gc.metaspace.TestMetaspacePerfCounters
+ * @run main/othervm -XX:+UseCompressedOops -XX:+UsePerfData -XX:+UseShenandoahGC gc.metaspace.TestMetaspacePerfCounters
  */
 
 /* @test id=Epsilon-64
@@ -108,8 +104,7 @@ import gc.testlibrary.PerfCounters;
  *          java.compiler
  *          java.management/sun.management
  *          jdk.internal.jvmstat/sun.jvmstat.monitor
- * @run main/othervm -XX:+UnlockExperimentalVMOptions -XX:-UseCompressedOops -XX:-UseCompressedClassPointers -XX:+UsePerfData -XX:+UseEpsilonGC gc.metaspace.TestMetaspacePerfCounters
- * @run main/othervm -XX:+UnlockExperimentalVMOptions -XX:+UseCompressedOops -XX:+UseCompressedClassPointers -XX:+UsePerfData -XX:+UseEpsilonGC gc.metaspace.TestMetaspacePerfCounters
+ * @run main/othervm -XX:+UnlockExperimentalVMOptions -XX:+UseCompressedOops  -XX:+UsePerfData -XX:+UseEpsilonGC gc.metaspace.TestMetaspacePerfCounters
  */
 
 /* @test id=Serial-32
@@ -227,14 +222,8 @@ public class TestMetaspacePerfCounters {
         String ccs = "sun.gc.compressedclassspace";
 
         checkPerfCounters(metaspace);
-
-        if (isUsingCompressedClassPointers()) {
-            checkPerfCounters(ccs);
-            checkUsedIncreasesWhenLoadingClass(ccs);
-        } else {
-            checkEmptyPerfCounters(ccs);
-            checkUsedIncreasesWhenLoadingClass(metaspace);
-        }
+        checkPerfCounters(ccs);
+        checkUsedIncreasesWhenLoadingClass(ccs);
     }
 
     private static void checkPerfCounters(String ns) throws Exception {
@@ -262,13 +251,6 @@ public class TestMetaspacePerfCounters {
         assertGTE(snap1.maxCapacity, snap1.capacity);
     }
 
-    private static void checkEmptyPerfCounters(String ns) throws Exception {
-        for (PerfCounter counter : countersInNamespace(ns)) {
-            String msg = "Expected " + counter.getName() + " to equal 0";
-            assertEQ(counter.longValue(), 0L, msg);
-        }
-    }
-
     private static void checkUsedIncreasesWhenLoadingClass(String ns) throws Exception {
         // Need to ensure that used is up to date and that all unreachable
         // classes are unloaded before doing this check.
@@ -296,7 +278,4 @@ public class TestMetaspacePerfCounters {
         return ByteCodeLoader.load(name, byteCode);
     }
 
-    private static boolean isUsingCompressedClassPointers() {
-        return Platform.is64bit() && InputArguments.contains("-XX:+UseCompressedClassPointers");
-    }
 }
diff --git a/test/hotspot/jtreg/gc/metaspace/TestPerfCountersAndMemoryPools.java b/test/hotspot/jtreg/gc/metaspace/TestPerfCountersAndMemoryPools.java
index fb32c439940..6d5cdf181b9 100644
--- a/test/hotspot/jtreg/gc/metaspace/TestPerfCountersAndMemoryPools.java
+++ b/test/hotspot/jtreg/gc/metaspace/TestPerfCountersAndMemoryPools.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2013, 2022, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2013, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -40,8 +40,7 @@ import gc.testlibrary.PerfCounters;
  * @modules java.base/jdk.internal.misc
  *          java.management
  *          jdk.internal.jvmstat/sun.jvmstat.monitor
- * @run main/othervm -Xlog:class+load,class+unload=trace -XX:-UseCompressedOops -XX:-UseCompressedClassPointers -XX:+UseSerialGC -XX:+UsePerfData -Xint gc.metaspace.TestPerfCountersAndMemoryPools
- * @run main/othervm -Xlog:class+load,class+unload=trace -XX:+UseCompressedOops -XX:+UseCompressedClassPointers -XX:+UseSerialGC -XX:+UsePerfData -Xint gc.metaspace.TestPerfCountersAndMemoryPools
+ * @run main/othervm -Xlog:class+load,class+unload=trace -XX:+UseCompressedOops -XX:+UseSerialGC -XX:+UsePerfData -Xint gc.metaspace.TestPerfCountersAndMemoryPools
  */
 
 /* @test TestPerfCountersAndMemoryPools
@@ -60,7 +59,7 @@ public class TestPerfCountersAndMemoryPools {
     public static void main(String[] args) throws Exception {
         checkMemoryUsage("Metaspace", "sun.gc.metaspace");
 
-        if (InputArguments.contains("-XX:+UseCompressedClassPointers") && Platform.is64bit()) {
+        if (Platform.is64bit()) {
             checkMemoryUsage("Compressed Class Space", "sun.gc.compressedclassspace");
         }
     }
diff --git a/test/hotspot/jtreg/gc/metaspace/TestSizeTransitions.java b/test/hotspot/jtreg/gc/metaspace/TestSizeTransitions.java
index 4237b8ce1dd..db698782e8f 100644
--- a/test/hotspot/jtreg/gc/metaspace/TestSizeTransitions.java
+++ b/test/hotspot/jtreg/gc/metaspace/TestSizeTransitions.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2019, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2019, 2026, Oracle and/or its affiliates. All rights reserved.
  * Copyright (c) 2019, Twitter, Inc.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
@@ -35,24 +35,21 @@ import java.util.List;
  * @requires vm.gc.Serial
  * @summary Tests that the metaspace size transition logging is done correctly.
  * @library /test/lib
- * @run driver gc.metaspace.TestSizeTransitions false -XX:+UseSerialGC
- * @run driver gc.metaspace.TestSizeTransitions true  -XX:+UseSerialGC
+ * @run driver gc.metaspace.TestSizeTransitions -XX:+UseSerialGC
  */
 
 /* @test TestSizeTransitionsParallel
  * @requires vm.gc.Parallel
  * @summary Tests that the metaspace size transition logging is done correctly.
  * @library /test/lib
- * @run driver gc.metaspace.TestSizeTransitions false -XX:+UseParallelGC
- * @run driver gc.metaspace.TestSizeTransitions true  -XX:+UseParallelGC
+ * @run driver gc.metaspace.TestSizeTransitions -XX:+UseParallelGC
  */
 
 /* @test TestSizeTransitionsG1
  * @requires vm.gc.G1
  * @summary Tests that the metaspace size transition logging is done correctly.
  * @library /test/lib
- * @run driver gc.metaspace.TestSizeTransitions false -XX:+UseG1GC
- * @run driver gc.metaspace.TestSizeTransitions true  -XX:+UseG1GC
+ * @run driver gc.metaspace.TestSizeTransitions -XX:+UseG1GC
  */
 
 public class TestSizeTransitions {
@@ -76,13 +73,13 @@ public class TestSizeTransitions {
   private static final String SIZE_TRANSITION_REGEX = "\\d+K\\(\\d+K\\)->\\d+K\\(\\d+K\\)";
 
   // matches -coops metaspace size transitions
-  private static final String NO_COMPRESSED_KLASS_POINTERS_REGEX =
+  private static final String WITHOUT_CLASS_SPACE_REGEX =
     String.format("^%s.* Metaspace: %s$",
                   LOG_TAGS_REGEX,
                   SIZE_TRANSITION_REGEX);
 
   // matches +coops metaspace size transitions
-  private static final String COMPRESSED_KLASS_POINTERS_REGEX =
+  private static final String WITH_CLASS_SPACE_REGEX =
     String.format("^%s.* Metaspace: %s NonClass: %s Class: %s$",
                   LOG_TAGS_REGEX,
                   SIZE_TRANSITION_REGEX,
@@ -90,26 +87,11 @@ public class TestSizeTransitions {
                   SIZE_TRANSITION_REGEX);
 
   public static void main(String... args) throws Exception {
-    // args: <use-coops> <gc-arg>
-    if (args.length != 2) {
-      throw new RuntimeException("wrong number of args: " + args.length);
+    if (args.length == 0) {
+      throw new RuntimeException("expected jvm args: " + args.length);
     }
 
-    final boolean hasCompressedKlassPointers = Platform.is64bit();
-    final boolean useCompressedKlassPointers = Boolean.parseBoolean(args[0]);
-    final String gcArg = args[1];
-
-    if (!hasCompressedKlassPointers && useCompressedKlassPointers) {
-       // No need to run this configuration.
-       System.out.println("Skipping test.");
-       return;
-    }
-
-    List<String> jvmArgs = new ArrayList<>();
-    if (hasCompressedKlassPointers) {
-      jvmArgs.add(useCompressedKlassPointers ? "-XX:+UseCompressedClassPointers" : "-XX:-UseCompressedClassPointers");
-    }
-    jvmArgs.add(gcArg);
+    List<String> jvmArgs = new ArrayList<>(List.of(args));
     jvmArgs.add("-Xmx256m");
     jvmArgs.add("-Xlog:gc,gc+metaspace=info");
     jvmArgs.add(TestSizeTransitions.Run.class.getName());
@@ -123,12 +105,14 @@ public class TestSizeTransitions {
     System.out.println(output.getStdout());
     output.shouldHaveExitValue(0);
 
-    if (useCompressedKlassPointers) {
-      output.stdoutShouldMatch(COMPRESSED_KLASS_POINTERS_REGEX);
-      output.stdoutShouldNotMatch(NO_COMPRESSED_KLASS_POINTERS_REGEX);
+    // 32-bit uses narrow Pointers but no class space
+    final boolean hasClassSpace = Platform.is64bit();
+    if (hasClassSpace) {
+      output.stdoutShouldMatch(WITH_CLASS_SPACE_REGEX);
+      output.stdoutShouldNotMatch(WITHOUT_CLASS_SPACE_REGEX);
     } else {
-      output.stdoutShouldMatch(NO_COMPRESSED_KLASS_POINTERS_REGEX);
-      output.stdoutShouldNotMatch(COMPRESSED_KLASS_POINTERS_REGEX);
+      output.stdoutShouldMatch(WITHOUT_CLASS_SPACE_REGEX);
+      output.stdoutShouldNotMatch(WITH_CLASS_SPACE_REGEX);
     }
   }
 }
diff --git a/test/hotspot/jtreg/gtest/ArrayTests.java b/test/hotspot/jtreg/gtest/ArrayTests.java
index b1afa4795d2..d3a8498d5eb 100644
--- a/test/hotspot/jtreg/gtest/ArrayTests.java
+++ b/test/hotspot/jtreg/gtest/ArrayTests.java
@@ -26,31 +26,18 @@
  * This tests object array sizes by running gtests with different settings.
  */
 
-/* @test id=with-coops-with-ccp
- * @summary Run object array size tests with compressed oops and compressed class pointers
+/* @test id=with-coops
+ * @summary Run object array size tests with compressed oops
  * @library /test/lib
  * @modules java.base/jdk.internal.misc
  *          java.xml
- * @run main/native GTestWrapper --gtest_filter=arrayOop -XX:+UseCompressedClassPointers -XX:+UseCompressedOops
+ * @run main/native GTestWrapper --gtest_filter=arrayOop -XX:+UseCompressedOops
  */
-/* @test id=with-coops-no-ccp
- * @summary Run object array size tests with compressed oops and compressed class pointers
+
+/* @test id=no-coops
+ * @summary Run object array size tests with compressed oops
  * @library /test/lib
  * @modules java.base/jdk.internal.misc
  *          java.xml
- * @run main/native GTestWrapper --gtest_filter=arrayOop -XX:-UseCompressedClassPointers -XX:+UseCompressedOops
- */
-/* @test id=no-coops-with-ccp
- * @summary Run object array size tests with compressed oops and compressed class pointers
- * @library /test/lib
- * @modules java.base/jdk.internal.misc
- *          java.xml
- * @run main/native GTestWrapper --gtest_filter=arrayOop -XX:+UseCompressedClassPointers -XX:-UseCompressedOops
- */
-/* @test id=no-coops-no-ccp
- * @summary Run object array size tests with compressed oops and compressed class pointers
- * @library /test/lib
- * @modules java.base/jdk.internal.misc
- *          java.xml
- * @run main/native GTestWrapper --gtest_filter=arrayOop -XX:-UseCompressedClassPointers -XX:-UseCompressedOops
+ * @run main/native GTestWrapper --gtest_filter=arrayOop -XX:-UseCompressedOops
  */
diff --git a/test/hotspot/jtreg/gtest/CompressedKlassGtest.java b/test/hotspot/jtreg/gtest/CompressedKlassGtest.java
index ba801724558..24f1dff5a30 100644
--- a/test/hotspot/jtreg/gtest/CompressedKlassGtest.java
+++ b/test/hotspot/jtreg/gtest/CompressedKlassGtest.java
@@ -1,6 +1,6 @@
 /*
  * Copyright (c) 2024, Red Hat, Inc. All rights reserved.
- * Copyright (c) 2024, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2024, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -39,14 +39,6 @@
  * @run main/native GTestWrapper --gtest_filter=CompressedKlass* -XX:-UseCompactObjectHeaders -Xlog:metaspace* -Xmx6g -Xms128m -Xshare:off -XX:CompressedClassSpaceSize=128m
  */
 
-/* @test id=ccp_off
- * @library /test/lib
- * @requires vm.bits == "64"
- * @modules java.base/jdk.internal.misc
- *          java.xml
- * @run main/native GTestWrapper --gtest_filter=CompressedKlass* -XX:-UseCompressedClassPointers -Xlog:metaspace* -Xmx6g -Xms128m
- */
-
 /* @test id=use-zero-based-encoding-coh
  * @library /test/lib
  * @requires vm.bits == "64"
diff --git a/test/hotspot/jtreg/gtest/MetaspaceGtests.java b/test/hotspot/jtreg/gtest/MetaspaceGtests.java
index 38fef145125..26faa2c7c2d 100644
--- a/test/hotspot/jtreg/gtest/MetaspaceGtests.java
+++ b/test/hotspot/jtreg/gtest/MetaspaceGtests.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2020, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
  * Copyright (c) 2020, 2023 SAP SE. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
@@ -40,15 +40,6 @@
  * @run main/native GTestWrapper --gtest_filter=metaspace* -XX:+UnlockDiagnosticVMOptions -XX:VerifyMetaspaceInterval=1
  */
 
-/* @test id=no-ccs
- * @summary Run metaspace-related gtests with compressed class pointers off
- * @library /test/lib
- * @modules java.base/jdk.internal.misc
- *          java.xml
- * @requires vm.bits == 64
- * @requires vm.flagless
- * @run main/native GTestWrapper --gtest_filter=metaspace* -XX:+UnlockDiagnosticVMOptions -XX:-UseCompressedClassPointers
- */
 
 /* @test id=UseCompactObjectHeaders
  * @summary Run metaspace-related gtests with tiny classpointers
diff --git a/test/hotspot/jtreg/gtest/ObjArrayTests.java b/test/hotspot/jtreg/gtest/ObjArrayTests.java
index baae1840417..ede85948335 100644
--- a/test/hotspot/jtreg/gtest/ObjArrayTests.java
+++ b/test/hotspot/jtreg/gtest/ObjArrayTests.java
@@ -26,60 +26,34 @@
  * This tests object array sizes by running gtests with different settings.
  */
 
-/* @test id=with-coops-with-ccp
- * @summary Run object array size tests with compressed oops and compressed class pointers
+/* @test id=with-coops
+ * @summary Run object array size tests with compressed oops
  * @library /test/lib
  * @modules java.base/jdk.internal.misc
  *          java.xml
- * @run main/native GTestWrapper --gtest_filter=objArrayOop -XX:+UseCompressedClassPointers -XX:+UseCompressedOops
- */
-/* @test id=with-coops-no-ccp
- * @summary Run object array size tests with compressed oops and compressed class pointers
- * @library /test/lib
- * @modules java.base/jdk.internal.misc
- *          java.xml
- * @run main/native GTestWrapper --gtest_filter=objArrayOop -XX:-UseCompressedClassPointers -XX:+UseCompressedOops
- */
-/* @test id=no-coops-with-ccp
- * @summary Run object array size tests with compressed oops and compressed class pointers
- * @library /test/lib
- * @modules java.base/jdk.internal.misc
- *          java.xml
- * @run main/native GTestWrapper --gtest_filter=objArrayOop -XX:+UseCompressedClassPointers -XX:-UseCompressedOops
- */
-/* @test id=no-coops-no-ccp
- * @summary Run object array size tests with compressed oops and compressed class pointers
- * @library /test/lib
- * @modules java.base/jdk.internal.misc
- *          java.xml
- * @run main/native GTestWrapper --gtest_filter=objArrayOop -XX:-UseCompressedClassPointers -XX:-UseCompressedOops
+ * @run main/native GTestWrapper --gtest_filter=objArrayOop -XX:+UseCompressedOops
  */
 
-/* @test id=with-coops-with-ccp-large-align
- * @summary Run object array size tests with compressed oops and compressed class pointers
+/* @test id=no-coops
+ * @summary Run object array size tests with compressed oops
  * @library /test/lib
  * @modules java.base/jdk.internal.misc
  *          java.xml
- * @run main/native GTestWrapper --gtest_filter=objArrayOop -XX:+UseCompressedClassPointers -XX:+UseCompressedOops -XX:ObjAlignmentInBytes=256
+ * @run main/native GTestWrapper --gtest_filter=objArrayOop -XX:-UseCompressedOops
  */
-/* @test id=with-coops-no-ccp-large-align
- * @summary Run object array size tests with compressed oops and compressed class pointers
+
+/* @test id=with-coops-large-align
+ * @summary Run object array size tests with compressed oops
  * @library /test/lib
  * @modules java.base/jdk.internal.misc
  *          java.xml
- * @run main/native GTestWrapper --gtest_filter=objArrayOop -XX:-UseCompressedClassPointers -XX:+UseCompressedOops -XX:ObjAlignmentInBytes=256
+ * @run main/native GTestWrapper --gtest_filter=objArrayOop -XX:+UseCompressedOops -XX:ObjAlignmentInBytes=256
  */
-/* @test id=no-coops-with-ccp-large-align
- * @summary Run object array size tests with compressed oops and compressed class pointers
+
+/* @test id=no-coops-large-align
+ * @summary Run object array size tests with compressed oops
  * @library /test/lib
  * @modules java.base/jdk.internal.misc
  *          java.xml
- * @run main/native GTestWrapper --gtest_filter=objArrayOop -XX:+UseCompressedClassPointers -XX:-UseCompressedOops -XX:ObjAlignmentInBytes=256
- */
-/* @test id=no-coops-no-ccp-large-align
- * @summary Run object array size tests with compressed oops and compressed class pointers
- * @library /test/lib
- * @modules java.base/jdk.internal.misc
- *          java.xml
- * @run main/native GTestWrapper --gtest_filter=objArrayOop -XX:-UseCompressedClassPointers -XX:-UseCompressedOops -XX:ObjAlignmentInBytes=256
+ * @run main/native GTestWrapper --gtest_filter=objArrayOop -XX:-UseCompressedOops -XX:ObjAlignmentInBytes=256
  */
diff --git a/test/hotspot/jtreg/runtime/CDSCompressedKPtrs/CDSCompressedKPtrs.java b/test/hotspot/jtreg/runtime/CDSCompressedKPtrs/CDSCompressedKPtrs.java
deleted file mode 100644
index 51b0469ce46..00000000000
--- a/test/hotspot/jtreg/runtime/CDSCompressedKPtrs/CDSCompressedKPtrs.java
+++ /dev/null
@@ -1,66 +0,0 @@
-/*
- * Copyright (c) 2013, 2023, Oracle and/or its affiliates. All rights reserved.
- * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
- *
- * This code is free software; you can redistribute it and/or modify it
- * under the terms of the GNU General Public License version 2 only, as
- * published by the Free Software Foundation.
- *
- * This code is distributed in the hope that it will be useful, but WITHOUT
- * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
- * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
- * version 2 for more details (a copy is included in the LICENSE file that
- * accompanied this code).
- *
- * You should have received a copy of the GNU General Public License version
- * 2 along with this work; if not, write to the Free Software Foundation,
- * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
- *
- * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
- * or visit www.oracle.com if you need additional information or have any
- * questions.
- */
-
-/**
- * @test
- * @requires vm.cds
- * @requires vm.bits == 64
- * @requires vm.flagless
- * @bug 8003424
- * @summary Testing UseCompressedClassPointers with CDS
- * @library /test/lib
- * @modules java.base/jdk.internal.misc
- *          java.management
- * @run driver CDSCompressedKPtrs
- */
-
-import jdk.test.lib.Platform;
-import jdk.test.lib.process.ProcessTools;
-import jdk.test.lib.process.OutputAnalyzer;
-import jtreg.SkippedException;
-
-public class CDSCompressedKPtrs {
-  public static void main(String[] args) throws Exception {
-    ProcessBuilder pb;
-    pb = ProcessTools.createLimitedTestJavaProcessBuilder(
-      "-XX:+UseCompressedClassPointers", "-XX:+UseCompressedOops",
-      "-XX:+UnlockDiagnosticVMOptions", "-XX:SharedArchiveFile=./CDSCompressedKPtrs.jsa", "-Xshare:dump", "-Xlog:cds");
-    OutputAnalyzer output = new OutputAnalyzer(pb.start());
-    try {
-      output.shouldContain("Loading classes to share");
-      output.shouldHaveExitValue(0);
-
-      pb = ProcessTools.createLimitedTestJavaProcessBuilder(
-        "-XX:+UseCompressedClassPointers", "-XX:+UseCompressedOops",
-        "-XX:+UnlockDiagnosticVMOptions", "-XX:SharedArchiveFile=./CDSCompressedKPtrs.jsa", "-Xshare:on", "-version");
-      output = new OutputAnalyzer(pb.start());
-      output.shouldContain("sharing");
-      output.shouldHaveExitValue(0);
-
-    } catch (RuntimeException e) {
-      output.shouldContain("Unable to use shared archive");
-      output.shouldHaveExitValue(1);
-      throw new SkippedException("CDS was turned off");
-    }
-  }
-}
diff --git a/test/hotspot/jtreg/runtime/CompressedOops/CompressedClassPointers.java b/test/hotspot/jtreg/runtime/CompressedOops/CompressedClassPointers.java
index e4b6f2a0548..fe1f8cb92fc 100644
--- a/test/hotspot/jtreg/runtime/CompressedOops/CompressedClassPointers.java
+++ b/test/hotspot/jtreg/runtime/CompressedOops/CompressedClassPointers.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2013, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2013, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -40,7 +40,6 @@
 import jdk.test.lib.Platform;
 import jdk.test.lib.process.ProcessTools;
 import jdk.test.lib.process.OutputAnalyzer;
-import jtreg.SkippedException;
 
 public class CompressedClassPointers {
 
@@ -218,7 +217,6 @@ public class CompressedClassPointers {
     public static void smallHeapTestNoCoop() throws Exception {
         ProcessBuilder pb = ProcessTools.createLimitedTestJavaProcessBuilder(
             "-XX:-UseCompressedOops",
-            "-XX:+UseCompressedClassPointers",
             "-XX:+UnlockDiagnosticVMOptions",
             "-XX:SharedBaseAddress=8g",
             "-Xmx128m",
@@ -236,7 +234,6 @@ public class CompressedClassPointers {
     public static void smallHeapTestWith1GNoCoop() throws Exception {
         ProcessBuilder pb = ProcessTools.createLimitedTestJavaProcessBuilder(
             "-XX:-UseCompressedOops",
-            "-XX:+UseCompressedClassPointers",
             "-XX:+UnlockDiagnosticVMOptions",
             "-XX:CompressedClassSpaceSize=1g",
             "-Xmx128m",
@@ -258,7 +255,6 @@ public class CompressedClassPointers {
     public static void largeHeapTestNoCoop() throws Exception {
         ProcessBuilder pb = ProcessTools.createLimitedTestJavaProcessBuilder(
             "-XX:-UseCompressedOops",
-            "-XX:+UseCompressedClassPointers",
             "-XX:+UnlockDiagnosticVMOptions",
             "-XX:+UnlockExperimentalVMOptions",
             "-Xmx30g",
@@ -280,7 +276,6 @@ public class CompressedClassPointers {
     public static void largePagesTestNoCoop() throws Exception {
         ProcessBuilder pb = ProcessTools.createLimitedTestJavaProcessBuilder(
             "-XX:-UseCompressedOops",
-            "-XX:+UseCompressedClassPointers",
             "-XX:+UnlockDiagnosticVMOptions",
             "-Xmx128m",
             "-XX:+UseLargePages",
@@ -291,23 +286,10 @@ public class CompressedClassPointers {
         output.shouldHaveExitValue(0);
     }
 
-    public static void heapBaseMinAddressTestNoCoop() throws Exception {
-        ProcessBuilder pb = ProcessTools.createLimitedTestJavaProcessBuilder(
-            "-XX:-UseCompressedOops",
-            "-XX:+UseCompressedClassPointers",
-            "-XX:HeapBaseMinAddress=1m",
-            "-Xlog:gc+heap+coops=debug",
-            "-version");
-        OutputAnalyzer output = new OutputAnalyzer(pb.start());
-        output.shouldContain("HeapBaseMinAddress must be at least");
-        output.shouldHaveExitValue(0);
-    }
-
     public static void sharingTestNoCoop() throws Exception {
         // Test small heaps
         ProcessBuilder pb = ProcessTools.createLimitedTestJavaProcessBuilder(
             "-XX:-UseCompressedOops",
-            "-XX:+UseCompressedClassPointers",
             "-XX:+UnlockDiagnosticVMOptions",
             "-XX:SharedArchiveFile=./CompressedClassPointers.jsa",
             "-Xmx128m",
@@ -325,7 +307,6 @@ public class CompressedClassPointers {
 
           pb = ProcessTools.createLimitedTestJavaProcessBuilder(
             "-XX:-UseCompressedOops",
-            "-XX:+UseCompressedClassPointers",
             "-XX:+UnlockDiagnosticVMOptions",
             "-XX:SharedArchiveFile=./CompressedClassPointers.jsa",
             "-Xmx128m",
@@ -356,7 +337,6 @@ public class CompressedClassPointers {
         smallHeapTestWith1GNoCoop();
         largeHeapTestNoCoop();
         largePagesTestNoCoop();
-        heapBaseMinAddressTestNoCoop();
         sharingTestNoCoop();
     }
 }
diff --git a/test/hotspot/jtreg/runtime/CompressedOops/CompressedClassSpaceSize.java b/test/hotspot/jtreg/runtime/CompressedOops/CompressedClassSpaceSize.java
index 7bbb9edb7b4..0898e6b96eb 100644
--- a/test/hotspot/jtreg/runtime/CompressedOops/CompressedClassSpaceSize.java
+++ b/test/hotspot/jtreg/runtime/CompressedOops/CompressedClassSpaceSize.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2014, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2014, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -107,13 +107,6 @@ public class CompressedClassSpaceSize {
                 output = new OutputAnalyzer(pb.start());
                 output.shouldContain("outside the allowed range")
                         .shouldHaveExitValue(1);
-
-                pb = ProcessTools.createLimitedTestJavaProcessBuilder("-XX:-UseCompressedClassPointers",
-                        "-XX:CompressedClassSpaceSize=" + minAllowedClassSpaceSize,
-                        "-version");
-                output = new OutputAnalyzer(pb.start());
-                output.shouldContain("Setting CompressedClassSpaceSize has no effect when compressed class pointers are not used")
-                        .shouldHaveExitValue(0);
             }
             break;
             case "valid_small": {
diff --git a/test/hotspot/jtreg/runtime/CompressedOops/CompressedKlassPointerAndOops.java b/test/hotspot/jtreg/runtime/CompressedOops/CompressedKlassPointerAndOops.java
index 403654d1cc8..32bb432308b 100644
--- a/test/hotspot/jtreg/runtime/CompressedOops/CompressedKlassPointerAndOops.java
+++ b/test/hotspot/jtreg/runtime/CompressedOops/CompressedKlassPointerAndOops.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2013, 2023, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2013, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,8 +23,7 @@
 
 /*
  * @test
- * @bug 8000968
- * @summary NPG: UseCompressedClassPointers asserts with ObjectAlignmentInBytes=32
+ * @summary Test Compressed Oops with different object alignments
  * @library /test/lib
  * @modules java.base/jdk.internal.misc
  *          java.management
@@ -51,7 +50,6 @@ public class CompressedKlassPointerAndOops {
         OutputAnalyzer output;
 
         pb = ProcessTools.createLimitedTestJavaProcessBuilder(
-            "-XX:+UseCompressedClassPointers",
             "-XX:+UseCompressedOops",
             "-XX:ObjectAlignmentInBytes=" + alignment,
             "-version");
diff --git a/test/hotspot/jtreg/runtime/ErrorHandling/TestVMConfigInHsErrFile.java b/test/hotspot/jtreg/runtime/ErrorHandling/TestVMConfigInHsErrFile.java
index 1e168221726..8f41121fbc1 100644
--- a/test/hotspot/jtreg/runtime/ErrorHandling/TestVMConfigInHsErrFile.java
+++ b/test/hotspot/jtreg/runtime/ErrorHandling/TestVMConfigInHsErrFile.java
@@ -56,7 +56,7 @@ public class TestVMConfigInHsErrFile {
   public static void main(String[] args) throws Exception {
     switch (args[0]) {
       case "coh-on" -> testCompactObjectHeaders();
-      case "coh-off" -> testCompressedClassPointers();
+      case "coh-off" -> testNotCompactObjectHeaders();
     }
   }
 
@@ -79,20 +79,16 @@ public class TestVMConfigInHsErrFile {
     Pattern[] expectedPatterns = new Pattern[] {
       Pattern.compile("# Java VM: .*compact obj headers.*")
     };
-    Pattern[] notExpectedPatterns = new Pattern[] {
-      Pattern.compile("# Java VM: .*compressed class ptrs.*")
-    };
 
-    HsErrFileUtils.checkHsErrFileContent(f, expectedPatterns, notExpectedPatterns, true, true);
+    HsErrFileUtils.checkHsErrFileContent(f, expectedPatterns, null, true, true);
 
   }
 
-  private static void testCompressedClassPointers() throws Exception {
+  private static void testNotCompactObjectHeaders() throws Exception {
     ProcessBuilder pb = ProcessTools.createLimitedTestJavaProcessBuilder(
         "-XX:+UnlockDiagnosticVMOptions",
         "-XX:+UnlockExperimentalVMOptions",
         "-XX:-UseCompactObjectHeaders",
-        "-XX:+UseCompressedClassPointers",
         "-Xmx100M",
         "-XX:-CreateCoredumpOnCrash",
         "-XX:ErrorHandlerTest=14",
@@ -104,14 +100,11 @@ public class TestVMConfigInHsErrFile {
     // extract hs-err file
     File f = HsErrFileUtils.openHsErrFileFromOutput(output);
 
-    Pattern[] expectedPatterns = new Pattern[] {
-      Pattern.compile("# Java VM: .*compressed class ptrs.*")
-    };
     Pattern[] notExpectedPatterns = new Pattern[] {
       Pattern.compile("# Java VM: .*compact obj headers.*")
     };
 
-    HsErrFileUtils.checkHsErrFileContent(f, expectedPatterns, notExpectedPatterns, true, true);
+    HsErrFileUtils.checkHsErrFileContent(f, null, notExpectedPatterns, true, true);
 
   }
 }
diff --git a/test/hotspot/jtreg/runtime/FieldLayout/BaseOffsets.java b/test/hotspot/jtreg/runtime/FieldLayout/BaseOffsets.java
index 73f5a1c6137..00b09fec6ed 100644
--- a/test/hotspot/jtreg/runtime/FieldLayout/BaseOffsets.java
+++ b/test/hotspot/jtreg/runtime/FieldLayout/BaseOffsets.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2022, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2022, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -22,47 +22,29 @@
  */
 
 /*
- * @test id=with-coops-with-ccp
+ * @test id=with-coops
  * @library /test/lib /
  * @requires vm.bits == "64"
  * @modules java.base/jdk.internal.misc
  *          java.management
  * @build jdk.test.whitebox.WhiteBox
  * @run driver jdk.test.lib.helpers.ClassFileInstaller jdk.test.whitebox.WhiteBox
- * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions -XX:+WhiteBoxAPI -XX:+UseCompressedOops -XX:+UseCompressedClassPointers -XX:-UseCompactObjectHeaders BaseOffsets
+ * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions -XX:+WhiteBoxAPI -XX:+UseCompressedOops -XX:-UseCompactObjectHeaders BaseOffsets
  */
+
 /*
- * @test id=no-coops-with-ccp
+ * @test id=no-coops
  * @library /test/lib /
  * @requires vm.bits == "64"
  * @modules java.base/jdk.internal.misc
  *          java.management
  * @build jdk.test.whitebox.WhiteBox
  * @run driver jdk.test.lib.helpers.ClassFileInstaller jdk.test.whitebox.WhiteBox
- * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions -XX:+WhiteBoxAPI -XX:-UseCompressedOops -XX:+UseCompressedClassPointers -XX:-UseCompactObjectHeaders BaseOffsets
+ * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions -XX:+WhiteBoxAPI -XX:-UseCompressedOops -XX:-UseCompactObjectHeaders BaseOffsets
  */
+
 /*
- * @test id=with-coops-no-ccp
- * @library /test/lib /
- * @requires vm.bits == "64"
- * @modules java.base/jdk.internal.misc
- *          java.management
- * @build jdk.test.whitebox.WhiteBox
- * @run driver jdk.test.lib.helpers.ClassFileInstaller jdk.test.whitebox.WhiteBox
- * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions -XX:+WhiteBoxAPI -XX:+UseCompressedOops -XX:-UseCompressedClassPointers -XX:-UseCompactObjectHeaders BaseOffsets
- */
-/*
- * @test id=no-coops-no-ccp
- * @library /test/lib /
- * @requires vm.bits == "64"
- * @modules java.base/jdk.internal.misc
- *          java.management
- * @build jdk.test.whitebox.WhiteBox
- * @run driver jdk.test.lib.helpers.ClassFileInstaller jdk.test.whitebox.WhiteBox
- * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions -XX:+WhiteBoxAPI -XX:-UseCompressedOops -XX:-UseCompressedClassPointers -XX:-UseCompactObjectHeaders BaseOffsets
- */
-/*
- * @test id=with-coop--with-coh
+ * @test id=with-coop-with-coh
  * @library /test/lib /
  * @requires vm.bits == "64"
  * @modules java.base/jdk.internal.misc
@@ -71,6 +53,7 @@
  * @run driver jdk.test.lib.helpers.ClassFileInstaller jdk.test.whitebox.WhiteBox
  * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions -XX:+WhiteBoxAPI -XX:+UseCompressedOops -XX:+UseCompactObjectHeaders BaseOffsets
  */
+
 /*
  * @test id=no-coops-with-coh
  * @library /test/lib /
@@ -81,6 +64,7 @@
  * @run driver jdk.test.lib.helpers.ClassFileInstaller jdk.test.whitebox.WhiteBox
  * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions -XX:+WhiteBoxAPI -XX:-UseCompressedOops -XX:+UseCompactObjectHeaders BaseOffsets
  */
+
 /*
  * @test id=32bit
  * @library /test/lib /
@@ -117,14 +101,10 @@ public class BaseOffsets {
             INT_OFFSET = 8;
             INT_ARRAY_OFFSET = 12;
             LONG_ARRAY_OFFSET = 16;
-        } else if (WB.getBooleanVMFlag("UseCompressedClassPointers")) {
+        } else {
             INT_OFFSET = 12;
             INT_ARRAY_OFFSET = 16;
             LONG_ARRAY_OFFSET = 16;
-        } else {
-            INT_OFFSET = 16;
-            INT_ARRAY_OFFSET = 20;
-            LONG_ARRAY_OFFSET = 24;
         }
     }
 
diff --git a/test/hotspot/jtreg/runtime/FieldLayout/FieldDensityTest.java b/test/hotspot/jtreg/runtime/FieldLayout/FieldDensityTest.java
index 5f4fb7a79c4..019b428ae84 100644
--- a/test/hotspot/jtreg/runtime/FieldLayout/FieldDensityTest.java
+++ b/test/hotspot/jtreg/runtime/FieldLayout/FieldDensityTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2020, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -37,8 +37,7 @@
  * @library /test/lib
  * @modules java.base/jdk.internal.misc
  *          java.management
- * @run main/othervm -XX:+UseCompressedOops -XX:+UseCompressedClassPointers FieldDensityTest
- * @run main/othervm -XX:+UseCompressedOops -XX:-UseCompressedClassPointers FieldDensityTest
+ * @run main/othervm -XX:+UseCompressedOops FieldDensityTest
  */
 
 import java.lang.reflect.Field;
diff --git a/test/hotspot/jtreg/runtime/FieldLayout/TestOopMapSizeMinimal.java b/test/hotspot/jtreg/runtime/FieldLayout/TestOopMapSizeMinimal.java
index 861f1aa3d1b..263bd750ca3 100644
--- a/test/hotspot/jtreg/runtime/FieldLayout/TestOopMapSizeMinimal.java
+++ b/test/hotspot/jtreg/runtime/FieldLayout/TestOopMapSizeMinimal.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2025, 2026, Oracle and/or its affiliates. All rights reserved.
  * Copyright (c) 2025, Red Hat, Inc. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
@@ -30,47 +30,27 @@ import java.util.ArrayList;
 import java.util.List;
 
 /*
- * @test id=no_coops_no_ccptr_no_coh
+ * @test id=no_coops_no_coh
  * @library /test/lib
  * @modules java.base/jdk.internal.misc
  *          java.management
  * @build jdk.test.whitebox.WhiteBox
  * @run driver jdk.test.lib.helpers.ClassFileInstaller jdk.test.whitebox.WhiteBox
- * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions -XX:+WhiteBoxAPI -XX:+UnlockExperimentalVMOptions -XX:-UseCompressedOops -XX:-UseCompressedClassPointers -XX:-UseCompactObjectHeaders TestOopMapSizeMinimal
+ * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions -XX:+WhiteBoxAPI -XX:+UnlockExperimentalVMOptions -XX:-UseCompressedOops -XX:-UseCompactObjectHeaders TestOopMapSizeMinimal
  */
 
 /*
- * @test id=coops_no_ccptr_no_coh
+ * @test id=coops_no_coh
  * @library /test/lib
  * @modules java.base/jdk.internal.misc
  *          java.management
  * @build jdk.test.whitebox.WhiteBox
  * @run driver jdk.test.lib.helpers.ClassFileInstaller jdk.test.whitebox.WhiteBox
- * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions -XX:+WhiteBoxAPI -XX:+UnlockExperimentalVMOptions -XX:+UseCompressedOops -XX:-UseCompressedClassPointers -XX:-UseCompactObjectHeaders TestOopMapSizeMinimal
+ * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions -XX:+WhiteBoxAPI -XX:+UnlockExperimentalVMOptions -XX:+UseCompressedOops -XX:-UseCompactObjectHeaders TestOopMapSizeMinimal
  */
 
 /*
- * @test id=no_coops_ccptr_no_coh
- * @library /test/lib
- * @modules java.base/jdk.internal.misc
- *          java.management
- * @build jdk.test.whitebox.WhiteBox
- * @run driver jdk.test.lib.helpers.ClassFileInstaller jdk.test.whitebox.WhiteBox
- * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions -XX:+WhiteBoxAPI -XX:+UnlockExperimentalVMOptions -XX:-UseCompressedOops -XX:+UseCompressedClassPointers -XX:-UseCompactObjectHeaders TestOopMapSizeMinimal
- */
-
-/*
- * @test id=coops_ccptr_no_coh
- * @library /test/lib
- * @modules java.base/jdk.internal.misc
- *          java.management
- * @build jdk.test.whitebox.WhiteBox
- * @run driver jdk.test.lib.helpers.ClassFileInstaller jdk.test.whitebox.WhiteBox
- * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions -XX:+WhiteBoxAPI -XX:+UnlockExperimentalVMOptions -XX:+UseCompressedOops -XX:+UseCompressedClassPointers -XX:-UseCompactObjectHeaders TestOopMapSizeMinimal
- */
-
-/*
- * @test id=no_coops_ccptr_coh
+ * @test id=no_coops_coh
  * @library /test/lib
  * @modules java.base/jdk.internal.misc
  *          java.management
@@ -79,6 +59,16 @@ import java.util.List;
  * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions -XX:+WhiteBoxAPI -XX:+UnlockExperimentalVMOptions -XX:-UseCompressedOops -XX:+UseCompactObjectHeaders TestOopMapSizeMinimal
  */
 
+/*
+ * @test id=coops_coh
+ * @library /test/lib
+ * @modules java.base/jdk.internal.misc
+ *          java.management
+ * @build jdk.test.whitebox.WhiteBox
+ * @run driver jdk.test.lib.helpers.ClassFileInstaller jdk.test.whitebox.WhiteBox
+ * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions -XX:+WhiteBoxAPI -XX:+UnlockExperimentalVMOptions -XX:+UseCompressedOops -XX:+UseCompactObjectHeaders TestOopMapSizeMinimal
+ */
+
 public class TestOopMapSizeMinimal {
 
     public static int OOP_SIZE_IN_BYTES = -1;
@@ -99,10 +89,8 @@ public class TestOopMapSizeMinimal {
         if (is_64_bit) {
             if (WB.getBooleanVMFlag("UseCompactObjectHeaders")) {
                 HEADER_SIZE_IN_BYTES = 8;
-            } else if (WB.getBooleanVMFlag("UseCompressedClassPointers")) {
-                HEADER_SIZE_IN_BYTES = 12;
             } else {
-                HEADER_SIZE_IN_BYTES = 16;
+                HEADER_SIZE_IN_BYTES = 12;
             }
         } else {
             HEADER_SIZE_IN_BYTES = 8;
@@ -188,10 +176,9 @@ public class TestOopMapSizeMinimal {
         // DERIVED4  o4  oopmap entry 2  (reversed order)
         //           i4
 
-        // There are two combinations that have gaps:
-        // -UseCompressedOops + +COH, and -UseCompressedOops + -UseCompressedClassPointers.
-        // In both cases there is a gap following i1, and i2 will therefore nestle into that gap.
-        // Otherwise the same logic applies.
+        // There is one combination that has gaps:
+        // -UseCompressedOops + +COH: A gap will be following i1, and i2 will therefore nestle into that gap.
+        // Otherwise, the same logic applies.
 
         if (OOP_SIZE_IN_BYTES == 4 ||                               // oop size == int size
             (OOP_SIZE_IN_BYTES == 8 && HEADER_SIZE_IN_BYTES == 12)
diff --git a/test/hotspot/jtreg/runtime/Metaspace/MaxMetaspaceSizeTest.java b/test/hotspot/jtreg/runtime/Metaspace/MaxMetaspaceSizeTest.java
index b2ff8ed9bde..a42a6ee3a52 100644
--- a/test/hotspot/jtreg/runtime/Metaspace/MaxMetaspaceSizeTest.java
+++ b/test/hotspot/jtreg/runtime/Metaspace/MaxMetaspaceSizeTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2017, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2017, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -39,7 +39,6 @@ public class MaxMetaspaceSizeTest {
             "-Xshare:off",
             "-Xmx1g",
             "-XX:MaxMetaspaceSize=4K",
-            "-XX:+UseCompressedClassPointers",
             "-XX:CompressedClassSpaceSize=1g",
             "--version");
         OutputAnalyzer output = new OutputAnalyzer(pb.start());
diff --git a/test/hotspot/jtreg/runtime/Metaspace/PrintMetaspaceDcmd.java b/test/hotspot/jtreg/runtime/Metaspace/PrintMetaspaceDcmd.java
index 7ff19326324..f526405900d 100644
--- a/test/hotspot/jtreg/runtime/Metaspace/PrintMetaspaceDcmd.java
+++ b/test/hotspot/jtreg/runtime/Metaspace/PrintMetaspaceDcmd.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * Copyright (c) 2018, SAP and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
@@ -22,62 +22,27 @@
  * questions.
  */
 
+import jdk.test.lib.Platform;
 import jdk.test.lib.dcmd.PidJcmdExecutor;
 import jdk.test.lib.process.OutputAnalyzer;
 
-/*
- * @test id=test-64bit-ccs
- * @summary Test the VM.metaspace command
- * @requires vm.bits == "64"
- * @library /test/lib
- * @modules java.base/jdk.internal.misc
- *          java.management
- * @run main/othervm -Dwith-compressed-class-space -XX:MaxMetaspaceSize=201M -Xmx100M -XX:+UseCompressedOops -XX:+UseCompressedClassPointers PrintMetaspaceDcmd
- */
+import java.io.IOException;
 
 /*
- * @test id=test-64bit-noccs
+ * @test
  * @summary Test the VM.metaspace command
- * @requires vm.bits == "64"
  * @library /test/lib
  * @modules java.base/jdk.internal.misc
  *          java.management
- * @run main/othervm -Dwithout-compressed-class-space -XX:MaxMetaspaceSize=201M -Xmx100M -XX:-UseCompressedOops -XX:-UseCompressedClassPointers PrintMetaspaceDcmd
- */
-
- /*
- * @test id=test-nospecified
- * @summary Test the VM.metaspace command
- * @requires vm.bits == "64"
- * @library /test/lib
- * @modules java.base/jdk.internal.misc
- *          java.management
- * @run main/othervm -Dno-specified-flag -Xmx100M -XX:-UseCompressedOops -XX:-UseCompressedClassPointers PrintMetaspaceDcmd
- */
-
-/*
- * @test test-32bit
- * @summary Test the VM.metaspace command
- * @requires vm.bits == "32"
- * @library /test/lib
- * @modules java.base/jdk.internal.misc
- *          java.management
- * @run main/othervm -Dwithout-compressed-class-space -XX:MaxMetaspaceSize=201M -Xmx100M PrintMetaspaceDcmd
+ * @run main/othervm -Dwith-compressed-class-space -XX:MaxMetaspaceSize=201M -Xmx100M PrintMetaspaceDcmd
  */
 
 public class PrintMetaspaceDcmd {
 
-    private static void doTheNoSpecifiedPropTest() throws Exception {
-        ProcessBuilder pb = new ProcessBuilder();
-        OutputAnalyzer output;
+    public static void main(String [] args) throws IOException {
 
-        pb.command(new PidJcmdExecutor().getCommandLine("VM.metaspace", "basic"));
-        output = new OutputAnalyzer(pb.start());
-        output.shouldHaveExitValue(0);
-        output.shouldMatch("MaxMetaspaceSize: unlimited");
-    }
+        final boolean usesCompressedClassSpace = Platform.is64bit();
 
-    private static void doTheCCSPropTest(boolean usesCompressedClassSpace) throws Exception {
         ProcessBuilder pb = new ProcessBuilder();
         OutputAnalyzer output;
 
@@ -172,15 +137,4 @@ public class PrintMetaspaceDcmd {
         output.shouldMatch("MaxMetaspaceSize:.*210763776 bytes");
     }
 
-    public static void main(String args[]) throws Exception {
-        if (System.getProperty("no-specified-flag") != null) {
-            doTheNoSpecifiedPropTest();
-        } else if (System.getProperty("with-compressed-class-space") != null) {
-            doTheCCSPropTest(true);
-        } else if (System.getProperty("without-compressed-class-space") != null) {
-            doTheCCSPropTest(false);
-        } else {
-            throw new IllegalArgumentException("Unrecognized running mode");
-        }
-    }
 }
diff --git a/test/hotspot/jtreg/runtime/cds/appcds/CommandLineFlagCombo.java b/test/hotspot/jtreg/runtime/cds/appcds/CommandLineFlagCombo.java
index 6ab9b18c1e9..da994edeb27 100644
--- a/test/hotspot/jtreg/runtime/cds/appcds/CommandLineFlagCombo.java
+++ b/test/hotspot/jtreg/runtime/cds/appcds/CommandLineFlagCombo.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2014, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2014, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -55,7 +55,6 @@ public class CommandLineFlagCombo {
     private static final String[] testTable = {
         "-XX:+UseG1GC", "-XX:+UseSerialGC", "-XX:+UseParallelGC",
         "-XX:+UseLargePages", // may only take effect on machines with large-pages
-        "-XX:+UseCompressedClassPointers",
         "-XX:+UseCompressedOops",
         "-XX:ObjectAlignmentInBytes=16",
         "-XX:ObjectAlignmentInBytes=32",
@@ -123,7 +122,6 @@ public class CommandLineFlagCombo {
         if (Platform.is32bit())
         {
             if (testEntry.equals("-XX:+UseCompressedOops") ||
-                testEntry.equals("-XX:+UseCompressedClassPointers") ||
                 testEntry.contains("ObjectAlignmentInBytes") )
             {
                 System.out.println("Test case not applicable on 32-bit platforms");
diff --git a/test/hotspot/jtreg/runtime/cds/appcds/CommandLineFlagComboNegative.java b/test/hotspot/jtreg/runtime/cds/appcds/CommandLineFlagComboNegative.java
index 89fe868349b..d5aafb2bcf6 100644
--- a/test/hotspot/jtreg/runtime/cds/appcds/CommandLineFlagComboNegative.java
+++ b/test/hotspot/jtreg/runtime/cds/appcds/CommandLineFlagComboNegative.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2014, 2020, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2014, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -66,9 +66,9 @@ public class CommandLineFlagComboNegative {
                 "An error has occurred while processing the shared archive file", 1) );
         }
         testTable.add( new TestVector("-XX:+UseCompressedOops", "-XX:-UseCompressedOops",
-            "The saved state of UseCompressedOops and UseCompressedClassPointers is different from runtime, CDS will be disabled.", 1) );
-        testTable.add( new TestVector("-XX:+UseCompressedClassPointers", "-XX:-UseCompressedClassPointers",
-           "The saved state of UseCompressedOops and UseCompressedClassPointers is different from runtime, CDS will be disabled.", 1) );
+            "The saved state of UseCompressedOops (1) is different from runtime (0), CDS will be disabled.", 1) );
+        testTable.add( new TestVector("-XX:-UseCompressedOops", "-XX:+UseCompressedOops",
+                "The saved state of UseCompressedOops (0) is different from runtime (1), CDS will be disabled.", 1) );
     }
 
     private void runTests() throws Exception
diff --git a/test/hotspot/jtreg/runtime/cds/appcds/FillerObjectLoadTest.java b/test/hotspot/jtreg/runtime/cds/appcds/FillerObjectLoadTest.java
deleted file mode 100644
index 8538155375c..00000000000
--- a/test/hotspot/jtreg/runtime/cds/appcds/FillerObjectLoadTest.java
+++ /dev/null
@@ -1,53 +0,0 @@
-/*
- * Copyright (C) 2022, Tencent. All rights reserved.
- * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
- *
- * This code is free software; you can redistribute it and/or modify it
- * under the terms of the GNU General Public License version 2 only, as
- * published by the Free Software Foundation.
- *
- * This code is distributed in the hope that it will be useful, but WITHOUT
- * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
- * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
- * version 2 for more details (a copy is included in the LICENSE file that
- * accompanied this code).
- *
- * You should have received a copy of the GNU General Public License version
- * 2 along with this work; if not, write to the Free Software Foundation,
- * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
- *
- * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
- * or visit www.oracle.com if you need additional information or have any
- * questions.
- */
-
-/**
- * @test
- * bug 8286066
- * @summary VM crash caused by unloaded FillerObject_klass
- * @library /test/lib
- * @requires vm.cds
- * @requires vm.flagless
- * @run driver FillerObjectLoadTest
- */
-
-import jdk.test.lib.process.OutputAnalyzer;
-import jdk.test.lib.process.ProcessTools;
-
-public class FillerObjectLoadTest {
-    public static void main(String... args) throws Exception {
-        ProcessBuilder pb = ProcessTools.createLimitedTestJavaProcessBuilder(
-                "-XX:+IgnoreUnrecognizedVMOptions", "-XX:-UseCompressedClassPointers",
-                "-XX:+UnlockExperimentalVMOptions", "-XX:+UseEpsilonGC", "-Xshare:dump",
-                "-XX:SharedArchiveFile=" + TestCommon.getNewArchiveName());
-        OutputAnalyzer analyzer = new OutputAnalyzer(pb.start());
-        analyzer.shouldHaveExitValue(0);
-
-        pb = ProcessTools.createLimitedTestJavaProcessBuilder(
-                "-XX:+IgnoreUnrecognizedVMOptions", "-XX:-UseCompressedClassPointers",
-                "-XX:TLABSize=2048", "-Xshare:dump",
-                "-XX:SharedArchiveFile=" + TestCommon.getNewArchiveName());
-        analyzer = new OutputAnalyzer(pb.start());
-        analyzer.shouldHaveExitValue(0);
-    }
-}
diff --git a/test/hotspot/jtreg/runtime/cds/appcds/TestCombinedCompressedFlags.java b/test/hotspot/jtreg/runtime/cds/appcds/TestCombinedCompressedFlags.java
index 4f3681d30df..f0700b14b55 100644
--- a/test/hotspot/jtreg/runtime/cds/appcds/TestCombinedCompressedFlags.java
+++ b/test/hotspot/jtreg/runtime/cds/appcds/TestCombinedCompressedFlags.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2020, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -46,12 +46,10 @@ public class TestCombinedCompressedFlags {
 
     static class ConfArg {
         public boolean useCompressedOops;            // UseCompressedOops
-        public boolean useCompressedClassPointers;   // UseCompressedClassPointers
         public String  msg;
         public int code;
-        public ConfArg(boolean useCompressedOops, boolean useCompressedClassPointers, String msg, int code) {
+        public ConfArg(boolean useCompressedOops, String msg, int code) {
             this.useCompressedOops = useCompressedOops;
-            this.useCompressedClassPointers = useCompressedClassPointers;
             this.msg  = msg;
             this.code = code;
         }
@@ -65,67 +63,13 @@ public class TestCombinedCompressedFlags {
             initExecArgs();
         }
         private void initExecArgs() {
-           /* The combinations have four cases.
-            *          UseCompressedOops   UseCompressedClassPointers  Result
-            *    1.
-            *    dump: on                  on
-            *    test: on                  on                          Pass
-            *          on                  off                         Fail
-            *          off                 on                          Fail
-            *          off                 off                         Fail
-            *    2.
-            *    dump: on                  off
-            *    test: on                  off                         Pass
-            *          on                  on                          Fail
-            *          off                 on                          Pass
-            *          off                 off                         Fail
-            *    3.
-            *    dump: off                 on
-            *    test: off                 on                          Pass
-            *          on                  on                          Fail
-            *          on                  off                         Fail
-            *    4.
-            *    dump: off                 off
-            *    test: off                 off                         Pass
-            *          on                  on                          Fail
-            *          on                  off                         Fail
-            **/
+            // We fail this test if the UseCompressedOops setting used at dumptime differs from runtime,
+            // succeed if it is identical
             execArgs = new ArrayList<ConfArg>();
-            if (dumpArg.useCompressedOops && dumpArg.useCompressedClassPointers) {
-                execArgs
-                    .add(new ConfArg(true, true, HELLO_STRING, PASS));
-                execArgs
-                    .add(new ConfArg(true, false, EXEC_ABNORMAL_MSG, FAIL));
-                execArgs
-                    .add(new ConfArg(false, true, EXEC_ABNORMAL_MSG, FAIL));
-                execArgs
-                    .add(new ConfArg(false, false, EXEC_ABNORMAL_MSG, FAIL));
-
-            }  else if(dumpArg.useCompressedOops && !dumpArg.useCompressedClassPointers) {
-                execArgs
-                    .add(new ConfArg(true, false, HELLO_STRING, PASS));
-                execArgs
-                    .add(new ConfArg(true, true, EXEC_ABNORMAL_MSG, FAIL));
-                execArgs
-                    .add(new ConfArg(false, true, EXEC_ABNORMAL_MSG, FAIL));
-                execArgs
-                    .add(new ConfArg(false, false, EXEC_ABNORMAL_MSG, FAIL));
-
-            } else if (!dumpArg.useCompressedOops && dumpArg.useCompressedClassPointers) {
-                execArgs
-                    .add(new ConfArg(false, true, HELLO_STRING, PASS));
-                execArgs
-                    .add(new ConfArg(true, true, EXEC_ABNORMAL_MSG, FAIL));
-                execArgs
-                    .add(new ConfArg(true, false, EXEC_ABNORMAL_MSG, FAIL));
-            } else if (!dumpArg.useCompressedOops && !dumpArg.useCompressedClassPointers) {
-                execArgs
-                    .add(new ConfArg(false, false, HELLO_STRING, PASS));
-                execArgs
-                    .add(new ConfArg(true, true, EXEC_ABNORMAL_MSG, FAIL));
-                execArgs
-                    .add(new ConfArg(true, false, EXEC_ABNORMAL_MSG, FAIL));
-            }
+            execArgs
+                    .add(new ConfArg(dumpArg.useCompressedOops, HELLO_STRING, PASS));
+            execArgs
+                    .add(new ConfArg(!dumpArg.useCompressedOops, EXEC_ABNORMAL_MSG, FAIL));
         }
     }
 
@@ -134,23 +78,14 @@ public class TestCombinedCompressedFlags {
         else    return "-XX:-UseCompressedOops";
     }
 
-    public static String getCompressedClassPointersArg(boolean on) {
-        if (on) return "-XX:+UseCompressedClassPointers";
-        else    return "-XX:-UseCompressedClassPointers";
-    }
-
     public static List<RunArg> runList;
 
     public static void configureRunArgs() {
         runList = new ArrayList<RunArg>();
         runList
-            .add(new RunArg(new ConfArg(true, true, null, PASS)));
+            .add(new RunArg(new ConfArg(true, null, PASS)));
         runList
-            .add(new RunArg(new ConfArg(true, false, null, PASS)));
-        runList
-            .add(new RunArg(new ConfArg(false, true, null, PASS)));
-        runList
-            .add(new RunArg(new ConfArg(false, false, null, PASS)));
+            .add(new RunArg(new ConfArg(false, null, PASS)));
     }
 
     public static void main(String[] args) throws Exception {
@@ -162,7 +97,6 @@ public class TestCombinedCompressedFlags {
                 .dump(helloJar,
                       new String[] {"Hello"},
                       getCompressedOopsArg(t.dumpArg.useCompressedOops),
-                      getCompressedClassPointersArg(t.dumpArg.useCompressedClassPointers),
                       "-Xlog:cds",
                       "-XX:NativeMemoryTracking=detail");
             out.shouldContain("Dumping shared data to file:");
@@ -175,7 +109,6 @@ public class TestCombinedCompressedFlags {
                                       "-Xlog:cds",
                                       "-XX:NativeMemoryTracking=detail",
                                       getCompressedOopsArg(c.useCompressedOops),
-                                      getCompressedClassPointersArg(c.useCompressedClassPointers),
                                       "Hello");
                 out.shouldContain(c.msg);
                 out.shouldHaveExitValue(c.code);
diff --git a/test/hotspot/jtreg/runtime/cds/appcds/TestZGCWithCDS.java b/test/hotspot/jtreg/runtime/cds/appcds/TestZGCWithCDS.java
index eb42bb9f93d..bff2bcc727d 100644
--- a/test/hotspot/jtreg/runtime/cds/appcds/TestZGCWithCDS.java
+++ b/test/hotspot/jtreg/runtime/cds/appcds/TestZGCWithCDS.java
@@ -36,7 +36,6 @@
  * @comment Driver sets compressed oops/class pointers, jtreg overrides will cause problems.
             Only run the test if the flags are not set via the command line.
  * @requires vm.opt.UseCompressedOops == null
- * @requires vm.opt.UseCompressedClassPointers == null
  * @run driver TestZGCWithCDS true
  */
 
@@ -55,7 +54,6 @@
  * @comment Driver sets compressed oops/class pointers, jtreg overrides will cause problems.
             Only run the test if the flags are not set via the command line.
  * @requires vm.opt.UseCompressedOops == null
- * @requires vm.opt.UseCompressedClassPointers == null
  * @run driver TestZGCWithCDS false
  */
 
@@ -65,7 +63,7 @@ import jdk.test.lib.process.OutputAnalyzer;
 public class TestZGCWithCDS {
     public final static String HELLO = "Hello World";
     public final static String UNABLE_TO_USE_ARCHIVE = "Unable to use shared archive.";
-    public final static String ERR_MSG = "The saved state of UseCompressedOops and UseCompressedClassPointers is different from runtime, CDS will be disabled.";
+    public final static String ERR_MSG = "The saved state of UseCompressedOops (0) is different from runtime (1), CDS will be disabled.";
     public static void main(String... args) throws Exception {
          boolean compactHeadersOn = Boolean.valueOf(args[0]);
          String compactHeaders = "-XX:" + (compactHeadersOn ? "+" : "-") + "UseCompactObjectHeaders";
@@ -80,7 +78,7 @@ public class TestZGCWithCDS {
          out.shouldContain("Dumping shared data to file:");
          out.shouldHaveExitValue(0);
 
-         System.out.println("1. Run with same args of dump");
+         System.out.println("Run with same args of dump");
          out = TestCommon
                    .exec(helloJar,
                          "-XX:+UseZGC",
@@ -90,12 +88,11 @@ public class TestZGCWithCDS {
          out.shouldContain(HELLO);
          out.shouldHaveExitValue(0);
 
-         System.out.println("2. Run with +UseCompressedOops +UseCompressedClassPointers");
+         System.out.println("Run with ZGC, +UseCompressedOops");
          out = TestCommon
                    .exec(helloJar,
                          "-XX:-UseZGC",
                          "-XX:+UseCompressedOops",           // in case turned off by vmoptions
-                         "-XX:+UseCompressedClassPointers",  // by jtreg
                          compactHeaders,
                          "-Xlog:cds",
                          "Hello");
@@ -103,37 +100,22 @@ public class TestZGCWithCDS {
          out.shouldContain(ERR_MSG);
          out.shouldHaveExitValue(1);
 
-         System.out.println("3. Run with -UseCompressedOops -UseCompressedClassPointers");
+         System.out.println("Run with SerialGC, -UseCompressedOops");
          out = TestCommon
                    .exec(helloJar,
                          "-XX:+UseSerialGC",
                          "-XX:-UseCompressedOops",
-                         "-XX:-UseCompressedClassPointers",
-                         compactHeaders,
-                         "-Xlog:cds",
-                         "Hello");
-         out.shouldContain(UNABLE_TO_USE_ARCHIVE);
-         out.shouldContain(ERR_MSG);
-         out.shouldHaveExitValue(1);
-
-         System.out.println("4. Run with -UseCompressedOops +UseCompressedClassPointers");
-         out = TestCommon
-                   .exec(helloJar,
-                         "-XX:+UseSerialGC",
-                         "-XX:-UseCompressedOops",
-                         "-XX:+UseCompressedClassPointers",
                          compactHeaders,
                          "-Xlog:cds",
                          "Hello");
          out.shouldContain(HELLO);
          out.shouldHaveExitValue(0);
 
-         System.out.println("5. Run with +UseCompressedOops -UseCompressedClassPointers");
+         System.out.println("Run with SerialGC, +UseCompressedOops");
          out = TestCommon
                    .exec(helloJar,
                          "-XX:+UseSerialGC",
                          "-XX:+UseCompressedOops",
-                         "-XX:-UseCompressedClassPointers",
                          compactHeaders,
                          "-Xlog:cds",
                          "Hello");
@@ -141,39 +123,5 @@ public class TestZGCWithCDS {
          out.shouldContain(ERR_MSG);
          out.shouldHaveExitValue(1);
 
-         System.out.println("6. Run with +UseCompressedOops +UseCompressedClassPointers");
-         out = TestCommon
-                   .exec(helloJar,
-                         "-XX:+UseSerialGC",
-                         "-XX:+UseCompressedOops",
-                         "-XX:+UseCompressedClassPointers",
-                         compactHeaders,
-                         "-Xlog:cds",
-                         "Hello");
-         out.shouldContain(UNABLE_TO_USE_ARCHIVE);
-         out.shouldContain(ERR_MSG);
-         out.shouldHaveExitValue(1);
-
-         System.out.println("7. Dump with -UseCompressedOops -UseCompressedClassPointers");
-         out = TestCommon
-                   .dump(helloJar,
-                         new String[] {"Hello"},
-                         "-XX:+UseSerialGC",
-                         "-XX:-UseCompressedOops",
-                         "-XX:+UseCompressedClassPointers",
-                         compactHeaders,
-                         "-Xlog:cds");
-         out.shouldContain("Dumping shared data to file:");
-         out.shouldHaveExitValue(0);
-
-         System.out.println("8. Run with ZGC");
-         out = TestCommon
-                   .exec(helloJar,
-                         "-XX:+UseZGC",
-                         compactHeaders,
-                         "-Xlog:cds",
-                         "Hello");
-         out.shouldContain(HELLO);
-         out.shouldHaveExitValue(0);
     }
 }
diff --git a/test/hotspot/jtreg/runtime/cds/appcds/aotCache/OldClassSupport2.java b/test/hotspot/jtreg/runtime/cds/appcds/aotCache/OldClassSupport2.java
index 16a4d258e4f..b0db450e352 100644
--- a/test/hotspot/jtreg/runtime/cds/appcds/aotCache/OldClassSupport2.java
+++ b/test/hotspot/jtreg/runtime/cds/appcds/aotCache/OldClassSupport2.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2025, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -53,11 +53,6 @@ public class OldClassSupport2 {
         // This will disable AOT class linking.
         Tester tester2 = new Tester("-Djdk.module.showModuleResolution=true");
         tester2.run(new String[] {"AOT", "--two-step-training"} );
-
-        // Heap archiving is disable with -XX:-UseCompressedClassPointers.
-        // This will disable AOT class linking.
-        Tester tester3 = new Tester("-XX:-UseCompressedClassPointers");
-        tester3.run(new String[] {"AOT", "--two-step-training"} );
     }
 
     static class Tester extends CDSAppTester {
diff --git a/test/hotspot/jtreg/runtime/cds/appcds/cacheObject/DifferentHeapSizes.java b/test/hotspot/jtreg/runtime/cds/appcds/cacheObject/DifferentHeapSizes.java
index aeeac7ee0a4..fbf84a2a42d 100644
--- a/test/hotspot/jtreg/runtime/cds/appcds/cacheObject/DifferentHeapSizes.java
+++ b/test/hotspot/jtreg/runtime/cds/appcds/cacheObject/DifferentHeapSizes.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2023, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -84,7 +84,7 @@ public class DifferentHeapSizes {
                 } else {
                     result
                         .assertAbnormalExit("Unable to use shared archive.",
-                                            "The saved state of UseCompressedOops and UseCompressedClassPointers is different from runtime, CDS will be disabled.");
+                                            "The saved state of UseCompressedOops (1) is different from runtime (0), CDS will be disabled.");
                 }
             }
         }
diff --git a/test/hotspot/jtreg/runtime/cds/appcds/dynamicArchive/CDSStreamTestDriver.java b/test/hotspot/jtreg/runtime/cds/appcds/dynamicArchive/CDSStreamTestDriver.java
index 88af964d836..8d66ff3336f 100644
--- a/test/hotspot/jtreg/runtime/cds/appcds/dynamicArchive/CDSStreamTestDriver.java
+++ b/test/hotspot/jtreg/runtime/cds/appcds/dynamicArchive/CDSStreamTestDriver.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2020, 2022, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -69,7 +69,7 @@ public class CDSStreamTestDriver extends DynamicArchiveTestBase {
            } catch (SkippedException s) {
                if (GC.Z.isSelected() && s.toString().equals(skippedException)) {
                    System.out.println("Got " + s.toString() + " as expected.");
-                   System.out.println("Because the test was run with ZGC with UseCompressedOops and UseCompressedClassPointers disabled,");
+                   System.out.println("Because the test was run with ZGC with UseCompressedOops disabled,");
                    System.out.println("but the base archive was created with the options enabled");
               } else {
                    throw new RuntimeException("Archive mapping should always succeed after JDK-8231610 (did the machine run out of memory?)");
diff --git a/test/hotspot/jtreg/runtime/cds/appcds/dynamicArchive/DynamicArchiveTestBase.java b/test/hotspot/jtreg/runtime/cds/appcds/dynamicArchive/DynamicArchiveTestBase.java
index 108002246db..8ee3b405604 100644
--- a/test/hotspot/jtreg/runtime/cds/appcds/dynamicArchive/DynamicArchiveTestBase.java
+++ b/test/hotspot/jtreg/runtime/cds/appcds/dynamicArchive/DynamicArchiveTestBase.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2019, 2023, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2019, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -306,9 +306,8 @@ class DynamicArchiveTestBase {
      *   the JDK was built via cross-compilation on a different platform;
      * - the VM under test was started with a different options than the ones
      *   when the default CDS archive was built. E.g. the VM was started with
-     *   -XX:+UseZGC which implicitly disabled the UseCompressedOoops and the
-     *   UseCompressedClassPointers options. Those "compressed" options were
-     *   enabled when the default CDS archive was built.
+     *   -XX:+UseZGC which implicitly disables the UseCompressedOops option.
+     *   UseCompressedOops was enabled when the default CDS archive was built.
      */
     public static boolean isUseSharedSpacesDisabled() {
         return !WB.isSharingEnabled();
diff --git a/test/hotspot/jtreg/runtime/cds/appcds/sharedStrings/IncompatibleOptions.java b/test/hotspot/jtreg/runtime/cds/appcds/sharedStrings/IncompatibleOptions.java
index ddbfe2ed862..f2ec33cdefe 100644
--- a/test/hotspot/jtreg/runtime/cds/appcds/sharedStrings/IncompatibleOptions.java
+++ b/test/hotspot/jtreg/runtime/cds/appcds/sharedStrings/IncompatibleOptions.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2015, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2015, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -83,7 +83,9 @@ public class IncompatibleOptions {
     static final String COMPACT_STRING_MISMATCH =
         "The shared archive file's CompactStrings setting .* does not equal the current CompactStrings setting";
     static final String COMPRESSED_OOPS_NOT_CONSISTENT =
-        "The saved state of UseCompressedOops and UseCompressedClassPointers is different from runtime, CDS will be disabled.";
+        "The saved state of UseCompressedOops \\(%d\\) is different from runtime \\(%d\\), CDS will be disabled.";
+    static final String COMPRESSED_OOPS_NOT_CONSISTENT_10 = COMPRESSED_OOPS_NOT_CONSISTENT.formatted(1, 0);
+    static final String COMPRESSED_OOPS_NOT_CONSISTENT_01 = COMPRESSED_OOPS_NOT_CONSISTENT.formatted(0, 1);
     static String appJar;
     static String[] vmOptionsPrefix = {};
 
@@ -117,7 +119,7 @@ public class IncompatibleOptions {
 
         // Explicitly archive with compressed oops, run without.
         testDump(3, "-XX:+UseG1GC", "-XX:+UseCompressedOops", null, false);
-        testExec(3, "-XX:+UseG1GC", "-XX:-UseCompressedOops", COMPRESSED_OOPS_NOT_CONSISTENT, true);
+        testExec(3, "-XX:+UseG1GC", "-XX:-UseCompressedOops", COMPRESSED_OOPS_NOT_CONSISTENT_10, true);
 
         // NOTE: No warning is displayed, by design
         // Still run, to ensure no crash or exception
@@ -130,14 +132,14 @@ public class IncompatibleOptions {
         testExec(4, "-XX:+UseSerialGC", "", "", false);
 
         if (GC.Z.isSupported()) {
-            testExec(4, "-XX:+UseZGC", "", COMPRESSED_OOPS_NOT_CONSISTENT, true);
+            testExec(4, "-XX:+UseZGC", "", COMPRESSED_OOPS_NOT_CONSISTENT_10, true);
         }
 
         // Explicitly archive with object streaming and COOPs with one GC, run with other GCs.
         testDump(4, "-XX:-UseCompressedOops", "-XX:+AOTStreamableObjects", null, false);
-        testExec(4, "-XX:+UseG1GC", "", COMPRESSED_OOPS_NOT_CONSISTENT, true);
-        testExec(4, "-XX:+UseParallelGC", "", COMPRESSED_OOPS_NOT_CONSISTENT, true);
-        testExec(4, "-XX:+UseSerialGC", "", COMPRESSED_OOPS_NOT_CONSISTENT, true);
+        testExec(4, "-XX:+UseG1GC", "", COMPRESSED_OOPS_NOT_CONSISTENT_01, true);
+        testExec(4, "-XX:+UseParallelGC", "", COMPRESSED_OOPS_NOT_CONSISTENT_01, true);
+        testExec(4, "-XX:+UseSerialGC", "", COMPRESSED_OOPS_NOT_CONSISTENT_01, true);
 
         testExec(4, "-XX:+UseParallelGC", "-XX:-UseCompressedOops", "", false);
         testExec(4, "-XX:+UseSerialGC", "-XX:-UseCompressedOops", "", false);
diff --git a/test/hotspot/jtreg/serviceability/dcmd/vm/ClassLoaderStatsTest.java b/test/hotspot/jtreg/serviceability/dcmd/vm/ClassLoaderStatsTest.java
index a89f2508852..aaf54e03f9e 100644
--- a/test/hotspot/jtreg/serviceability/dcmd/vm/ClassLoaderStatsTest.java
+++ b/test/hotspot/jtreg/serviceability/dcmd/vm/ClassLoaderStatsTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2014, 2022, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2014, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -32,17 +32,6 @@
  * @run testng/othervm --add-exports=java.base/jdk.internal.misc=ALL-UNNAMED --add-exports=jdk.internal.jvmstat/sun.jvmstat.monitor=ALL-UNNAMED ClassLoaderStatsTest
  */
 
-/*
- * @test
- * @summary Test of diagnostic command VM.classloader_stats (-UseCCP)
- * @library /test/lib
- * @requires vm.bits != "32"
- * @modules java.base/jdk.internal.misc
- *          java.compiler
- *          java.management
- *          jdk.internal.jvmstat/sun.jvmstat.monitor
- * @run testng/othervm -XX:-UseCompressedClassPointers --add-exports=java.base/jdk.internal.misc=ALL-UNNAMED --add-exports=jdk.internal.jvmstat/sun.jvmstat.monitor=ALL-UNNAMED ClassLoaderStatsTest
- */
 
 import org.testng.annotations.Test;
 import org.testng.Assert;
@@ -110,7 +99,7 @@ public class ClassLoaderStatsTest {
 
                     // Minimum expected sizes: initial capacity is governed by the chunk size of the first chunk, which
                     // depends on the arena growth policy. Since this is a normal class loader, we expect as initial chunk
-                    // size at least 4k (if UseCompressedClassPointers is off).
+                    // size at least 4k.
                     // Minimum used size is difficult to guess but should be at least 1k.
                     // Maximum expected sizes: We just assume a reasonable maximum. We only loaded one class, so
                     // we should not see values > 64k.
diff --git a/test/hotspot/jtreg/testlibrary_tests/ir_framework/tests/TestIRMatching.java b/test/hotspot/jtreg/testlibrary_tests/ir_framework/tests/TestIRMatching.java
index fc8a92cf9a2..e4111238b59 100644
--- a/test/hotspot/jtreg/testlibrary_tests/ir_framework/tests/TestIRMatching.java
+++ b/test/hotspot/jtreg/testlibrary_tests/ir_framework/tests/TestIRMatching.java
@@ -165,25 +165,6 @@ public class TestIRMatching {
                  BadFailOnConstraint.create(RunTests.class, "bad1", 2, "Load")
         );
 
-        runCheck(new String[] {"-XX:+IgnoreUnrecognizedVMOptions", "-XX:-UseCompressedClassPointers"},
-                 BadFailOnConstraint.create(Loads.class, "load", 1, 1, "Load"),
-                 BadFailOnConstraint.create(Loads.class, "load", 1, 3, "LoadI"),
-                 BadCountsConstraint.create(Loads.class, "load", 1, 1, 0),
-                 BadCountsConstraint.create(Loads.class, "load", 1, 2, 1,"Load"),
-                 GoodRuleConstraint.create(Loads.class, "load", 2),
-                 GoodFailOnConstraint.create(Loads.class, "load", 3),
-                 BadCountsConstraint.create(Loads.class, "load", 3, 2, 2,"Store"),
-                 BadFailOnConstraint.create(Loads.class, "load", 4, 2, "Store"),
-                 BadFailOnConstraint.create(Loads.class, "load", 5, "Load"),
-                 BadFailOnConstraint.create(Loads.class, "load", 6, "Load"),
-                 BadFailOnConstraint.create(Loads.class, "load", 7, "Load"),
-                 GoodRuleConstraint.create(Loads.class, "load", 8),
-                 GoodRuleConstraint.create(Loads.class, "load", 9),
-                 GoodRuleConstraint.create(Loads.class, "load", 10),
-                 BadFailOnConstraint.create(Loads.class, "loadKlass", 1),
-                 BadCountsConstraint.create(Loads.class, "loadKlass", 2, 2,"Field")
-                 );
-
         // Loops
         runCheck(BadFailOnConstraint.create(Loops.class, "loop", 1, "Loop"),
                  GoodRuleConstraint.create(Loops.class, "loop", 2),
diff --git a/test/jdk/java/lang/instrument/GetObjectSizeIntrinsicsTest.java b/test/jdk/java/lang/instrument/GetObjectSizeIntrinsicsTest.java
index 44276a9f7f5..cdaa94e8289 100644
--- a/test/jdk/java/lang/instrument/GetObjectSizeIntrinsicsTest.java
+++ b/test/jdk/java/lang/instrument/GetObjectSizeIntrinsicsTest.java
@@ -314,8 +314,9 @@ public class GetObjectSizeIntrinsicsTest extends ASimpleInstrumentationTestCase
     static final int LARGE_INT_ARRAY_SIZE = 1024*1024*1024 + 1024;
     static final int LARGE_OBJ_ARRAY_SIZE = (4096/(int)REF_SIZE)*1024*1024 + 1024;
 
-    static final boolean CCP = WhiteBox.getWhiteBox().getBooleanVMFlag("UseCompressedClassPointers");
-    static final int ARRAY_HEADER_SIZE = CCP ? 16 : (Platform.is64bit() ? 20 : 12);
+    // 64-bit: 8mw-4ccp-4len
+    // 32-bit: 4mw-4ccp-4len-4gap
+    static final int ARRAY_HEADER_SIZE = 16;
 
     final String mode;
 
diff --git a/test/jdk/jdk/jfr/event/allocation/TestObjectAllocationInNewTLABEvent.java b/test/jdk/jdk/jfr/event/allocation/TestObjectAllocationInNewTLABEvent.java
index 9112cfbc247..9cc3141cd2d 100644
--- a/test/jdk/jdk/jfr/event/allocation/TestObjectAllocationInNewTLABEvent.java
+++ b/test/jdk/jdk/jfr/event/allocation/TestObjectAllocationInNewTLABEvent.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2013, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2013, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -64,9 +64,10 @@ import jdk.test.whitebox.WhiteBox;
 public class TestObjectAllocationInNewTLABEvent {
     private final static String EVENT_NAME = EventNames.ObjectAllocationInNewTLAB;
 
-    private static final Boolean COMPRESSED_CLASS_PTRS = WhiteBox.getWhiteBox().getBooleanVMFlag("UseCompressedClassPointers");
-
-    private static final int BYTE_ARRAY_OVERHEAD = (Platform.is64bit() && !COMPRESSED_CLASS_PTRS) ? 24 : 16;
+    // 64-bit  COH: MW8 +      L4 + End Alignment = 16
+    // 64-bit -COH: MW8 + K4 + L4                 = 16
+    // 32-bit     : MW4 + K4 + L4 + End Alignment = 16
+    private static final int BYTE_ARRAY_OVERHEAD = 16;
     private static final int OBJECT_SIZE = 128 * 1024;
 
     private static final int OBJECTS_TO_ALLOCATE = 100;
diff --git a/test/jdk/jdk/jfr/event/allocation/TestObjectAllocationOutsideTLABEvent.java b/test/jdk/jdk/jfr/event/allocation/TestObjectAllocationOutsideTLABEvent.java
index a7695b76849..9a4f0f28974 100644
--- a/test/jdk/jdk/jfr/event/allocation/TestObjectAllocationOutsideTLABEvent.java
+++ b/test/jdk/jdk/jfr/event/allocation/TestObjectAllocationOutsideTLABEvent.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2013, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2013, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -64,9 +64,10 @@ import jdk.test.whitebox.WhiteBox;
 public class TestObjectAllocationOutsideTLABEvent {
     private static final String EVENT_NAME = EventNames.ObjectAllocationOutsideTLAB;
 
-    private static final Boolean COMPRESSED_CLASS_PTRS = WhiteBox.getWhiteBox().getBooleanVMFlag("UseCompressedClassPointers");
-
-    private static final int BYTE_ARRAY_OVERHEAD = (Platform.is64bit() && !COMPRESSED_CLASS_PTRS) ? 24 : 16;
+    // 64-bit  COH: MW8 +      L4 + End Alignment = 16
+    // 64-bit -COH: MW8 + K4 + L4                 = 16
+    // 32-bit     : MW4 + K4 + L4 + End Alignment = 16
+    private static final int BYTE_ARRAY_OVERHEAD = 16;
     private static final int OBJECT_SIZE = 128 * 1024;
 
     private static final int OBJECTS_TO_ALLOCATE = 100;
diff --git a/test/jdk/jdk/jfr/event/allocation/TestObjectAllocationSampleEventThrottling.java b/test/jdk/jdk/jfr/event/allocation/TestObjectAllocationSampleEventThrottling.java
index 47f5b31f881..214f7336a73 100644
--- a/test/jdk/jdk/jfr/event/allocation/TestObjectAllocationSampleEventThrottling.java
+++ b/test/jdk/jdk/jfr/event/allocation/TestObjectAllocationSampleEventThrottling.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2020, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -52,9 +52,10 @@ import jdk.test.whitebox.WhiteBox;
 public class TestObjectAllocationSampleEventThrottling {
     private static final String EVENT_NAME = EventNames.ObjectAllocationSample;
 
-    private static final Boolean COMPRESSED_CLASS_PTRS = WhiteBox.getWhiteBox().getBooleanVMFlag("UseCompressedClassPointers");
-
-    private static final int BYTE_ARRAY_OVERHEAD = (Platform.is64bit() && !COMPRESSED_CLASS_PTRS) ? 24 : 16;
+    // 64-bit  COH: MW8 +      L4 + End Alignment = 16
+    // 64-bit -COH: MW8 + K4 + L4                 = 16
+    // 32-bit     : MW4 + K4 + L4 + End Alignment = 16
+    private static final int BYTE_ARRAY_OVERHEAD = 16;
     private static final int OBJECT_SIZE = 128 * 1024;
 
     private static final int OBJECTS_TO_ALLOCATE = 100;
diff --git a/test/jdk/jdk/jfr/event/gc/heapsummary/TestHeapSummaryEventDefNewSerial.java b/test/jdk/jdk/jfr/event/gc/heapsummary/TestHeapSummaryEventDefNewSerial.java
index f70d7a85f16..b880bd93bc5 100644
--- a/test/jdk/jdk/jfr/event/gc/heapsummary/TestHeapSummaryEventDefNewSerial.java
+++ b/test/jdk/jdk/jfr/event/gc/heapsummary/TestHeapSummaryEventDefNewSerial.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2013, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2013, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -33,16 +33,6 @@ import jdk.test.lib.jfr.GCHelper;
  * @run main/othervm -XX:+UseSerialGC jdk.jfr.event.gc.heapsummary.TestHeapSummaryEventDefNewSerial
  */
 
-/**
- * @test
- * @bug 8264008
- * @requires vm.flagless
- * @requires vm.hasJFR & vm.bits == 64
- * @requires vm.gc == "Serial" | vm.gc == null
- * @library /test/lib /test/jdk
- * @run main/othervm -XX:+UseSerialGC -XX:-UseCompressedClassPointers
- *                   jdk.jfr.event.gc.heapsummary.TestHeapSummaryEventDefNewSerial
- */
 public class TestHeapSummaryEventDefNewSerial {
     public static void main(String[] args) throws Exception {
         HeapSummaryEventAllGcs.test(GCHelper.gcDefNew, GCHelper.gcSerialOld);
diff --git a/test/jdk/jdk/jfr/event/gc/objectcount/ObjectCountEventVerifier.java b/test/jdk/jdk/jfr/event/gc/objectcount/ObjectCountEventVerifier.java
index 0ab663f130a..d7e6b3209d3 100644
--- a/test/jdk/jdk/jfr/event/gc/objectcount/ObjectCountEventVerifier.java
+++ b/test/jdk/jdk/jfr/event/gc/objectcount/ObjectCountEventVerifier.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2013, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2013, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -70,7 +70,7 @@ public class ObjectCountEventVerifier {
     private static long expectedFooArraySize(long count) {
         boolean runsOn32Bit = System.getProperty("sun.arch.data.model").equals("32");
         int bytesPerWord = runsOn32Bit ? 4 : 8;
-        int objectHeaderSize = bytesPerWord * 3; // length will be aligned on 64 bits
+        int objectHeaderSize = runsOn32Bit ? 12 : 16;
         int alignmentInOopArray = runsOn32Bit ? 4 : 0;
         int ptrSize = bytesPerWord;
         return objectHeaderSize + alignmentInOopArray + count * ptrSize;
diff --git a/test/jdk/jdk/jfr/event/gc/objectcount/TestObjectCountAfterGCEventWithG1ConcurrentMark.java b/test/jdk/jdk/jfr/event/gc/objectcount/TestObjectCountAfterGCEventWithG1ConcurrentMark.java
index eb69289aa5e..fbf2d8b543d 100644
--- a/test/jdk/jdk/jfr/event/gc/objectcount/TestObjectCountAfterGCEventWithG1ConcurrentMark.java
+++ b/test/jdk/jdk/jfr/event/gc/objectcount/TestObjectCountAfterGCEventWithG1ConcurrentMark.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2013, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2013, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -31,7 +31,7 @@ import jdk.test.lib.jfr.GCHelper;
  * @requires (vm.gc == "G1" | vm.gc == null)
  *           & vm.opt.ExplicitGCInvokesConcurrent != false
  * @library /test/lib /test/jdk
- * @run main/othervm -XX:+UnlockExperimentalVMOptions -XX:+UseG1GC -XX:+ExplicitGCInvokesConcurrent -XX:MarkSweepDeadRatio=0 -XX:-UseCompressedOops -XX:-UseCompressedClassPointers -XX:+IgnoreUnrecognizedVMOptions jdk.jfr.event.gc.objectcount.TestObjectCountAfterGCEventWithG1ConcurrentMark
+ * @run main/othervm -XX:+UnlockExperimentalVMOptions -XX:+UseG1GC -XX:+ExplicitGCInvokesConcurrent -XX:MarkSweepDeadRatio=0 -XX:-UseCompressedOops -XX:+IgnoreUnrecognizedVMOptions jdk.jfr.event.gc.objectcount.TestObjectCountAfterGCEventWithG1ConcurrentMark
  */
 public class TestObjectCountAfterGCEventWithG1ConcurrentMark {
     public static void main(String[] args) throws Exception {
diff --git a/test/jdk/jdk/jfr/event/gc/objectcount/TestObjectCountAfterGCEventWithG1FullCollection.java b/test/jdk/jdk/jfr/event/gc/objectcount/TestObjectCountAfterGCEventWithG1FullCollection.java
index 6e91cf4c644..758ab6988b5 100644
--- a/test/jdk/jdk/jfr/event/gc/objectcount/TestObjectCountAfterGCEventWithG1FullCollection.java
+++ b/test/jdk/jdk/jfr/event/gc/objectcount/TestObjectCountAfterGCEventWithG1FullCollection.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2013, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2013, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -31,7 +31,7 @@ import jdk.test.lib.jfr.GCHelper;
  * @requires (vm.gc == "G1" | vm.gc == null)
  *           & vm.opt.ExplicitGCInvokesConcurrent != true
  * @library /test/lib /test/jdk
- * @run main/othervm -XX:+UnlockExperimentalVMOptions -XX:-UseFastUnorderedTimeStamps -XX:+UseG1GC -XX:MarkSweepDeadRatio=0 -XX:-UseCompressedOops -XX:-UseCompressedClassPointers -XX:+IgnoreUnrecognizedVMOptions jdk.jfr.event.gc.objectcount.TestObjectCountAfterGCEventWithG1FullCollection
+ * @run main/othervm -XX:+UnlockExperimentalVMOptions -XX:-UseFastUnorderedTimeStamps -XX:+UseG1GC -XX:MarkSweepDeadRatio=0 -XX:-UseCompressedOops -XX:+IgnoreUnrecognizedVMOptions jdk.jfr.event.gc.objectcount.TestObjectCountAfterGCEventWithG1FullCollection
  */
 public class TestObjectCountAfterGCEventWithG1FullCollection {
     public static void main(String[] args) throws Exception {
diff --git a/test/jdk/jdk/jfr/event/gc/objectcount/TestObjectCountAfterGCEventWithParallelOld.java b/test/jdk/jdk/jfr/event/gc/objectcount/TestObjectCountAfterGCEventWithParallelOld.java
index 2a17e540be8..ac43d0d24e4 100644
--- a/test/jdk/jdk/jfr/event/gc/objectcount/TestObjectCountAfterGCEventWithParallelOld.java
+++ b/test/jdk/jdk/jfr/event/gc/objectcount/TestObjectCountAfterGCEventWithParallelOld.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2013, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2013, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -30,7 +30,7 @@ import jdk.test.lib.jfr.GCHelper;
  * @requires vm.hasJFR
  * @requires vm.gc == "Parallel" | vm.gc == null
  * @library /test/lib /test/jdk
- * @run main/othervm -XX:+UnlockExperimentalVMOptions -XX:-UseFastUnorderedTimeStamps -XX:+UseParallelGC -XX:MarkSweepDeadRatio=0 -XX:-UseCompressedOops -XX:-UseCompressedClassPointers -XX:+IgnoreUnrecognizedVMOptions jdk.jfr.event.gc.objectcount.TestObjectCountAfterGCEventWithParallelOld
+ * @run main/othervm -XX:+UnlockExperimentalVMOptions -XX:-UseFastUnorderedTimeStamps -XX:+UseParallelGC -XX:MarkSweepDeadRatio=0 -XX:-UseCompressedOops -XX:+IgnoreUnrecognizedVMOptions jdk.jfr.event.gc.objectcount.TestObjectCountAfterGCEventWithParallelOld
  */
 public class TestObjectCountAfterGCEventWithParallelOld {
     public static void main(String[] args) throws Exception {
diff --git a/test/jdk/jdk/jfr/event/gc/objectcount/TestObjectCountAfterGCEventWithSerial.java b/test/jdk/jdk/jfr/event/gc/objectcount/TestObjectCountAfterGCEventWithSerial.java
index 888eb089027..eac0e935fea 100644
--- a/test/jdk/jdk/jfr/event/gc/objectcount/TestObjectCountAfterGCEventWithSerial.java
+++ b/test/jdk/jdk/jfr/event/gc/objectcount/TestObjectCountAfterGCEventWithSerial.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2013, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2013, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -30,7 +30,7 @@ import jdk.test.lib.jfr.GCHelper;
  * @requires vm.hasJFR
  * @requires vm.gc == "Serial" | vm.gc == null
  * @library /test/lib /test/jdk
- * @run main/othervm -XX:+UnlockExperimentalVMOptions -XX:-UseFastUnorderedTimeStamps -XX:+UseSerialGC -XX:MarkSweepDeadRatio=0 -XX:-UseCompressedOops -XX:-UseCompressedClassPointers -XX:+IgnoreUnrecognizedVMOptions jdk.jfr.event.gc.objectcount.TestObjectCountAfterGCEventWithSerial
+ * @run main/othervm -XX:+UnlockExperimentalVMOptions -XX:-UseFastUnorderedTimeStamps -XX:+UseSerialGC -XX:MarkSweepDeadRatio=0 -XX:-UseCompressedOops -XX:+IgnoreUnrecognizedVMOptions jdk.jfr.event.gc.objectcount.TestObjectCountAfterGCEventWithSerial
  */
 public class TestObjectCountAfterGCEventWithSerial {
     public static void main(String[] args) throws Exception {
diff --git a/test/jdk/jdk/jfr/event/gc/objectcount/TestObjectCountEvent.java b/test/jdk/jdk/jfr/event/gc/objectcount/TestObjectCountEvent.java
index a9034ba0eaa..0a5d48e83c8 100644
--- a/test/jdk/jdk/jfr/event/gc/objectcount/TestObjectCountEvent.java
+++ b/test/jdk/jdk/jfr/event/gc/objectcount/TestObjectCountEvent.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2013, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2013, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -39,7 +39,7 @@ import jdk.test.lib.jfr.Events;
  * @requires vm.hasJFR
  * @requires vm.gc == "Serial" | vm.gc == null
  * @library /test/lib /test/jdk
- * @run main/othervm -XX:+UnlockExperimentalVMOptions -XX:-UseFastUnorderedTimeStamps -XX:+UseSerialGC -XX:-UseCompressedOops -XX:-UseCompressedClassPointers -XX:MarkSweepDeadRatio=0 -XX:+IgnoreUnrecognizedVMOptions jdk.jfr.event.gc.objectcount.TestObjectCountEvent
+ * @run main/othervm -XX:+UnlockExperimentalVMOptions -XX:-UseFastUnorderedTimeStamps -XX:+UseSerialGC -XX:-UseCompressedOops -XX:MarkSweepDeadRatio=0 -XX:+IgnoreUnrecognizedVMOptions jdk.jfr.event.gc.objectcount.TestObjectCountEvent
  */
 public class TestObjectCountEvent {
     private static final String objectCountEventPath = EventNames.ObjectCount;
diff --git a/test/jtreg-ext/requires/VMProps.java b/test/jtreg-ext/requires/VMProps.java
index 2d604a92b75..16fd32e626b 100644
--- a/test/jtreg-ext/requires/VMProps.java
+++ b/test/jtreg-ext/requires/VMProps.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2016, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2016, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -474,8 +474,7 @@ public class VMProps implements Callable<Map<String, String>> {
 
     /**
      * @return true if it's possible for "java -Xshare:dump" to write Java heap objects
-     *         with the current set of jtreg VM options. For example, false will be returned
-     *         if -XX:-UseCompressedClassPointers is specified.
+     *         with the current set of jtreg VM options.
      */
     protected String vmCDSCanWriteArchivedJavaHeap() {
         return "" + ("true".equals(vmCDS()) && WB.canWriteJavaHeapArchive());
@@ -483,8 +482,7 @@ public class VMProps implements Callable<Map<String, String>> {
 
     /**
      * @return true if it's possible for "java -Xshare:dump" to write Java heap objects
-     *         with the current set of jtreg VM options. For example, false will be returned
-     *         if -XX:-UseCompressedClassPointers is specified.
+     *         with the current set of jtreg VM options.
      */
     protected String vmCDSCanWriteMappedArchivedJavaHeap() {
         return "" + ("true".equals(vmCDS()) && WB.canWriteMappedJavaHeapArchive());
@@ -492,8 +490,7 @@ public class VMProps implements Callable<Map<String, String>> {
 
     /**
      * @return true if it's possible for "java -Xshare:dump" to write Java heap objects
-     *         with the current set of jtreg VM options. For example, false will be returned
-     *         if -XX:-UseCompressedClassPointers is specified.
+     *         with the current set of jtreg VM options.
      */
     protected String vmCDSCanWriteStreamedArchivedJavaHeap() {
         return "" + ("true".equals(vmCDS()) && WB.canWriteStreamedJavaHeapArchive());

From e07ab7fb9b5e49093f84b05fb6cecfa00f1b0f52 Mon Sep 17 00:00:00 2001
From: Arno Zeller <azeller@openjdk.org>
Date: Thu, 26 Mar 2026 11:17:18 +0000
Subject: [PATCH 361/655] 8380288: [BACKOUT] Incorrect Interpretation of POSIX
 TZ Environment Variable on AIX

Reviewed-by: mbaesken, mdoerr
---
 .../unix/native/libjava/TimeZone_md.c         | 66 +++++++------------
 1 file changed, 22 insertions(+), 44 deletions(-)

diff --git a/src/java.base/unix/native/libjava/TimeZone_md.c b/src/java.base/unix/native/libjava/TimeZone_md.c
index 39e7b726220..cd253edde60 100644
--- a/src/java.base/unix/native/libjava/TimeZone_md.c
+++ b/src/java.base/unix/native/libjava/TimeZone_md.c
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1999, 2026, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1999, 2025, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -352,15 +352,33 @@ getPlatformTimeZoneID()
 }
 
 static char *
-getJavaTimezoneFromPlatform(const char *tz_buf, size_t tz_len, const char *mapfilename) {
+mapPlatformToJavaTimezone(const char *java_home_dir, const char *tz) {
     FILE *tzmapf;
+    char mapfilename[PATH_MAX + 1];
     char line[256];
     int linecount = 0;
+    char *tz_buf = NULL;
+    char *temp_tz = NULL;
     char *javatz = NULL;
+    size_t tz_len = 0;
 
+    /* On AIX, the TZ environment variable may end with a comma
+     * followed by modifier fields until early AIX6.1.
+     * This restriction has been removed from AIX7. */
+
+    tz_buf = strdup(tz);
+    tz_len = strlen(tz_buf);
+
+    /* Open tzmappings file, with buffer overrun check */
+    if ((strlen(java_home_dir) + 15) > PATH_MAX) {
+        jio_fprintf(stderr, "Path %s/lib/tzmappings exceeds maximum path length\n", java_home_dir);
+        goto tzerr;
+    }
+    strcpy(mapfilename, java_home_dir);
+    strcat(mapfilename, "/lib/tzmappings");
     if ((tzmapf = fopen(mapfilename, "r")) == NULL) {
         jio_fprintf(stderr, "can't open %s\n", mapfilename);
-        return NULL;
+        goto tzerr;
     }
 
     while (fgets(line, sizeof(line), tzmapf) != NULL) {
@@ -413,50 +431,10 @@ getJavaTimezoneFromPlatform(const char *tz_buf, size_t tz_len, const char *mapfi
             break;
         }
     }
-
     (void) fclose(tzmapf);
-    return javatz;
-}
-
-static char *
-mapPlatformToJavaTimezone(const char *java_home_dir, const char *tz) {
-    char mapfilename[PATH_MAX + 1];
-    char *tz_buf = NULL;
-    char *javatz = NULL;
-    char *temp_tz = NULL;
-    size_t tz_len = 0;
-
-    /* On AIX, the TZ environment variable may end with a comma
-     * followed by modifier fields until early AIX6.1.
-     * This restriction has been removed from AIX7. */
-
-    tz_buf = strdup(tz);
-    tz_len = strlen(tz_buf);
-
-    /* Open tzmappings file, with buffer overrun check */
-    if ((strlen(java_home_dir) + 15) > PATH_MAX) {
-        jio_fprintf(stderr, "Path %s/lib/tzmappings exceeds maximum path length\n", java_home_dir);
-        goto tzerr;
-    }
-    strcpy(mapfilename, java_home_dir);
-    strcat(mapfilename, "/lib/tzmappings");
-
-    // First attempt to find the Java timezone for the full tz string
-    javatz = getJavaTimezoneFromPlatform(tz_buf, tz_len, mapfilename);
-
-    // If no match was found, check for timezone with truncated value
-    if (javatz == NULL) {
-        temp_tz = strchr(tz, ',');
-        tz_len = (temp_tz == NULL) ? strlen(tz) : temp_tz - tz;
-        free((void *) tz_buf);
-        tz_buf = (char *)malloc(tz_len + 1);
-        memcpy(tz_buf, tz, tz_len);
-        tz_buf[tz_len] = '\0';
-        javatz = getJavaTimezoneFromPlatform(tz_buf, tz_len, mapfilename);
-    }
 
 tzerr:
-    if (tz_buf != NULL) {
+    if (tz_buf != NULL ) {
         free((void *) tz_buf);
     }
 

From 407b677d5fe20f1958f530207e62234d510daca4 Mon Sep 17 00:00:00 2001
From: Coleen Phillimore <coleenp@openjdk.org>
Date: Thu, 26 Mar 2026 11:41:10 +0000
Subject: [PATCH 362/655] 8380942: Fix whitespace and conditional logic in
 interpreter code

Reviewed-by: dholmes, aartemov
---
 src/hotspot/share/interpreter/interpreterRuntime.cpp |  8 +++-----
 src/hotspot/share/interpreter/linkResolver.cpp       | 10 +++++-----
 src/hotspot/share/interpreter/oopMapCache.cpp        | 10 +++++-----
 3 files changed, 13 insertions(+), 15 deletions(-)

diff --git a/src/hotspot/share/interpreter/interpreterRuntime.cpp b/src/hotspot/share/interpreter/interpreterRuntime.cpp
index 59d5f29023c..e7b35b121a2 100644
--- a/src/hotspot/share/interpreter/interpreterRuntime.cpp
+++ b/src/hotspot/share/interpreter/interpreterRuntime.cpp
@@ -243,9 +243,9 @@ JRT_ENTRY(void, InterpreterRuntime::multianewarray(JavaThread* current, jint* fi
   // We may want to pass in more arguments - could make this slightly faster
   LastFrameAccessor last_frame(current);
   ConstantPool* constants = last_frame.method()->constants();
-  int          i = last_frame.get_index_u2(Bytecodes::_multianewarray);
-  Klass* klass   = constants->klass_at(i, CHECK);
-  int   nof_dims = last_frame.number_of_dimensions();
+  int i = last_frame.get_index_u2(Bytecodes::_multianewarray);
+  Klass* klass = constants->klass_at(i, CHECK);
+  int nof_dims = last_frame.number_of_dimensions();
   assert(klass->is_klass(), "not a class");
   assert(nof_dims >= 1, "multianewarray rank must be nonzero");
 
@@ -756,12 +756,10 @@ JRT_LEAF(void, InterpreterRuntime::monitorexit(BasicObjectLock* elem))
   elem->set_obj(nullptr);
 JRT_END
 
-
 JRT_ENTRY(void, InterpreterRuntime::throw_illegal_monitor_state_exception(JavaThread* current))
   THROW(vmSymbols::java_lang_IllegalMonitorStateException());
 JRT_END
 
-
 JRT_ENTRY(void, InterpreterRuntime::new_illegal_monitor_state_exception(JavaThread* current))
   // Returns an illegal exception to install into the current thread. The
   // pending_exception flag is cleared so normal exception handling does not
diff --git a/src/hotspot/share/interpreter/linkResolver.cpp b/src/hotspot/share/interpreter/linkResolver.cpp
index c82398b654c..25fff580c9d 100644
--- a/src/hotspot/share/interpreter/linkResolver.cpp
+++ b/src/hotspot/share/interpreter/linkResolver.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1997, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -1045,7 +1045,7 @@ void LinkResolver::resolve_field(fieldDescriptor& fd,
         stringStream ss;
         ss.print("Update to %s final field %s.%s attempted from a different class (%s) than the field's declaring class",
                  is_static ? "static" : "non-static", resolved_klass->external_name(), fd.name()->as_C_string(),
-                current_klass->external_name());
+                 current_klass->external_name());
         THROW_MSG(vmSymbols::java_lang_IllegalAccessError(), ss.as_string());
       }
 
@@ -1260,7 +1260,7 @@ void LinkResolver::runtime_resolve_special_method(CallInfo& result,
   methodHandle sel_method(THREAD, resolved_method());
 
   if (link_info.check_access() &&
-      // check if the method is not <init>
+      // check if the method is not <init>, which is never inherited
       resolved_method->name() != vmSymbols::object_initializer_name()) {
 
     Klass* current_klass = link_info.current_klass();
@@ -1724,8 +1724,8 @@ void LinkResolver::resolve_invoke(CallInfo& result, Handle recv, const constantP
 }
 
 void LinkResolver::resolve_invoke(CallInfo& result, Handle& recv,
-                             const methodHandle& attached_method,
-                             Bytecodes::Code byte, TRAPS) {
+                                  const methodHandle& attached_method,
+                                  Bytecodes::Code byte, TRAPS) {
   Klass* defc = attached_method->method_holder();
   Symbol* name = attached_method->name();
   Symbol* type = attached_method->signature();
diff --git a/src/hotspot/share/interpreter/oopMapCache.cpp b/src/hotspot/share/interpreter/oopMapCache.cpp
index d7c02296f33..5a1ad7b7883 100644
--- a/src/hotspot/share/interpreter/oopMapCache.cpp
+++ b/src/hotspot/share/interpreter/oopMapCache.cpp
@@ -256,8 +256,8 @@ bool OopMapCacheEntry::verify_mask(CellTypeState* vars, CellTypeState* stack, in
 
   if (log) st.print("Locals (%d): ", max_locals);
   for(int i = 0; i < max_locals; i++) {
-    bool v1 = is_oop(i)               ? true : false;
-    bool v2 = vars[i].is_reference()  ? true : false;
+    bool v1 = is_oop(i);
+    bool v2 = vars[i].is_reference();
     assert(v1 == v2, "locals oop mask generation error");
     if (log) st.print("%d", v1 ? 1 : 0);
   }
@@ -265,8 +265,8 @@ bool OopMapCacheEntry::verify_mask(CellTypeState* vars, CellTypeState* stack, in
 
   if (log) st.print("Stack (%d): ", stack_top);
   for(int j = 0; j < stack_top; j++) {
-    bool v1 = is_oop(max_locals + j)  ? true : false;
-    bool v2 = stack[j].is_reference() ? true : false;
+    bool v1 = is_oop(max_locals + j);
+    bool v2 = stack[j].is_reference();
     assert(v1 == v2, "stack oop mask generation error");
     if (log) st.print("%d", v1 ? 1 : 0);
   }
@@ -350,7 +350,7 @@ void OopMapCacheEntry::set_mask(CellTypeState *vars, CellTypeState *stack, int s
     }
 
     // set oop bit
-    if ( cell->is_reference()) {
+    if (cell->is_reference()) {
       value |= (mask << oop_bit_number );
       _num_oops++;
     }

From 60ce4857f406a3fe68be008ab1ca206b032412dc Mon Sep 17 00:00:00 2001
From: Daniel Fuchs <dfuchs@openjdk.org>
Date: Thu, 26 Mar 2026 11:48:34 +0000
Subject: [PATCH 363/655] 8380931: Refactor remaining java/nio/channels TestNG
 tests to use JUnit

Reviewed-by: alanb
---
 .../SocketChannel/AdaptorStreams.java         |  81 +++--
 .../SocketChannel/ConnectionReset.java        |  22 +-
 .../SocketChannel/ReadWriteAfterClose.java    |  54 +--
 .../channels/etc/LocalSocketAddressType.java  |  63 ++--
 .../java/nio/channels/etc/OpenAndConnect.java | 199 ++++++-----
 .../nio/channels/etc/ProtocolFamilies.java    | 239 ++++++-------
 .../unixdomain/EmptySunPathForSocketFile.java |  16 +-
 .../channels/unixdomain/FileAttributes.java   |  27 +-
 .../nio/channels/unixdomain/IOExchanges.java  | 328 ++++++++++--------
 .../nio/channels/unixdomain/NullTest.java     |  13 +-
 10 files changed, 561 insertions(+), 481 deletions(-)

diff --git a/test/jdk/java/nio/channels/SocketChannel/AdaptorStreams.java b/test/jdk/java/nio/channels/SocketChannel/AdaptorStreams.java
index 3487ae45de1..240d9e3baf7 100644
--- a/test/jdk/java/nio/channels/SocketChannel/AdaptorStreams.java
+++ b/test/jdk/java/nio/channels/SocketChannel/AdaptorStreams.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2019, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2019, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,7 +23,7 @@
 
 /* @test
  * @bug 8222774 4430139
- * @run testng AdaptorStreams
+ * @run junit AdaptorStreams
  * @summary Exercise socket adaptor input/output streams
  */
 
@@ -44,77 +44,82 @@ import java.util.concurrent.Future;
 import java.util.concurrent.ScheduledExecutorService;
 import java.util.concurrent.TimeUnit;
 
-import org.testng.annotations.Test;
-import static org.testng.Assert.*;
+import org.junit.jupiter.api.Test;
+import static org.junit.jupiter.api.Assertions.*;
 
-@Test
 public class AdaptorStreams {
 
     /**
      * Test read when bytes are available
      */
+    @Test
     public void testRead1() throws Exception {
         withConnection((sc, peer) -> {
             peer.getOutputStream().write(99);
             int n = sc.socket().getInputStream().read();
-            assertEquals(n, 99);
+            assertEquals(99, n);
         });
     }
 
     /**
      * Test read blocking before bytes are available
      */
+    @Test
     public void testRead2() throws Exception {
         withConnection((sc, peer) -> {
             scheduleWrite(peer.getOutputStream(), 99, 1000);
             int n = sc.socket().getInputStream().read();
-            assertEquals(n, 99);
+            assertEquals(99, n);
         });
     }
 
     /**
      * Test read when peer has closed connection
      */
+    @Test
     public void testRead3() throws Exception {
         withConnection((sc, peer) -> {
             peer.close();
             int n = sc.socket().getInputStream().read();
-            assertEquals(n, -1);
+            assertEquals(-1, n);
         });
     }
 
     /**
      * Test read blocking before peer closes connection
      */
+    @Test
     public void testRead4() throws Exception {
         withConnection((sc, peer) -> {
             scheduleClose(peer, 1000);
             int n = sc.socket().getInputStream().read();
-            assertEquals(n, -1);
+            assertEquals(-1, n);
         });
     }
 
     /**
      * Test async close of socket when thread blocked in read
      */
+    @Test
     public void testRead5() throws Exception {
         withConnection((sc, peer) -> {
             scheduleClose(sc, 2000);
             InputStream in = sc.socket().getInputStream();
-            expectThrows(IOException.class, () -> in.read());
+            assertThrows(IOException.class, () -> in.read());
         });
     }
 
     /**
      * Test interrupted status set before read
      */
+    @Test
     public void testRead6() throws Exception {
         withConnection((sc, peer) -> {
             Socket s = sc.socket();
             Thread.currentThread().interrupt();
             try {
                 InputStream in = s.getInputStream();
-                expectThrows(IOException.class, () -> in.read());
+                assertThrows(IOException.class, () -> in.read());
             } finally {
                 Thread.interrupted();  // clear interrupt
             }
@@ -125,13 +130,14 @@ public class AdaptorStreams {
     /**
      * Test interrupt of thread blocked in read
      */
+    @Test
     public void testRead7() throws Exception {
         withConnection((sc, peer) -> {
             Future<?> interrupter = scheduleInterrupt(Thread.currentThread(), 2000);
             Socket s = sc.socket();
             try {
                 InputStream in = s.getInputStream();
-                expectThrows(IOException.class, () -> in.read());
+                assertThrows(IOException.class, () -> in.read());
             } finally {
                 interrupter.cancel(true);
                 Thread.interrupted();  // clear interrupt
@@ -143,68 +149,74 @@ public class AdaptorStreams {
     /**
      * Test read when channel is configured non-blocking
      */
+    @Test
     public void testRead8() throws Exception {
         withConnection((sc, peer) -> {
             sc.configureBlocking(false);
             InputStream in = sc.socket().getInputStream();
-            expectThrows(IllegalBlockingModeException.class, () -> in.read());
+            assertThrows(IllegalBlockingModeException.class, () -> in.read());
         });
     }
 
     /**
      * Test timed read when bytes are available
      */
+    @Test
     public void testTimedRead1() throws Exception {
         withConnection((sc, peer) -> {
             peer.getOutputStream().write(99);
             Socket s = sc.socket();
             s.setSoTimeout(60_000);
             int n = s.getInputStream().read();
-            assertEquals(n, 99);
+            assertEquals(99, n);
         });
     }
 
     /**
      * Test timed read blocking before bytes are available
      */
+    @Test
     public void testTimedRead2() throws Exception {
         withConnection((sc, peer) -> {
             scheduleWrite(peer.getOutputStream(), 99, 1000);
             Socket s = sc.socket();
             s.setSoTimeout(60_000);
             int n = s.getInputStream().read();
-            assertEquals(n, 99);
+            assertEquals(99, n);
         });
     }
 
     /**
      * Test timed read when the read times out
      */
+    @Test
     public void testTimedRead3() throws Exception {
         withConnection((sc, peer) -> {
             Socket s = sc.socket();
             s.setSoTimeout(500);
             InputStream in = s.getInputStream();
-            expectThrows(SocketTimeoutException.class, () -> in.read());
+            assertThrows(SocketTimeoutException.class, () -> in.read());
         });
     }
 
     /**
      * Test async close of socket when thread blocked in timed read
      */
+    @Test
     public void testTimedRead4() throws Exception {
         withConnection((sc, peer) -> {
             scheduleClose(sc, 2000);
             Socket s = sc.socket();
             s.setSoTimeout(60_000);
             InputStream in = s.getInputStream();
-            expectThrows(IOException.class, () -> in.read());
+            assertThrows(IOException.class, () -> in.read());
         });
     }
 
     /**
      * Test interrupted status set before timed read
      */
+    @Test
     public void testTimedRead5() throws Exception {
         withConnection((sc, peer) -> {
             Socket s = sc.socket();
@@ -212,7 +224,7 @@ public class AdaptorStreams {
             try {
                 s.setSoTimeout(60_000);
                 InputStream in = s.getInputStream();
-                expectThrows(IOException.class, () -> in.read());
+                assertThrows(IOException.class, () -> in.read());
             } finally {
                 Thread.interrupted();  // clear interrupt
             }
@@ -223,6 +235,7 @@ public class AdaptorStreams {
     /**
      * Test interrupt of thread blocked in timed read
      */
+    @Test
     public void testTimedRead6() throws Exception {
         withConnection((sc, peer) -> {
             Future<?> interrupter = scheduleInterrupt(Thread.currentThread(), 2000);
@@ -230,7 +243,7 @@ public class AdaptorStreams {
             try {
                 s.setSoTimeout(60_000);
                 InputStream in = s.getInputStream();
-                expectThrows(IOException.class, () -> in.read());
+                assertThrows(IOException.class, () -> in.read());
                 assertTrue(s.isClosed());
             } finally {
                 interrupter.cancel(true);
@@ -243,10 +256,11 @@ public class AdaptorStreams {
     /**
      * Test async close of socket when thread blocked in write
      */
+    @Test
     public void testWrite1() throws Exception {
         withConnection((sc, peer) -> {
             scheduleClose(sc, 2000);
-            expectThrows(IOException.class, () -> {
+            assertThrows(IOException.class, () -> {
                 OutputStream out = sc.socket().getOutputStream();
                 byte[] data = new byte[64*1000];
                 while (true) {
@@ -259,13 +273,14 @@ public class AdaptorStreams {
     /**
      * Test interrupted status set before write
      */
+    @Test
     public void testWrite2() throws Exception {
         withConnection((sc, peer) -> {
             Socket s = sc.socket();
             Thread.currentThread().interrupt();
             try {
                 OutputStream out = s.getOutputStream();
-                expectThrows(IOException.class, () -> out.write(99));
+                assertThrows(IOException.class, () -> out.write(99));
             } finally {
                 Thread.interrupted();  // clear interrupt
             }
@@ -276,12 +291,13 @@ public class AdaptorStreams {
     /**
      * Test interrupt of thread blocked in write
      */
+    @Test
     public void testWrite3() throws Exception {
         withConnection((sc, peer) -> {
             Future<?> interrupter = scheduleInterrupt(Thread.currentThread(), 2000);
             Socket s = sc.socket();
             try {
-                expectThrows(IOException.class, () -> {
+                assertThrows(IOException.class, () -> {
                     OutputStream out = sc.socket().getOutputStream();
                     byte[] data = new byte[64*1000];
                     while (true) {
@@ -299,11 +315,12 @@ public class AdaptorStreams {
     /**
      * Test write when channel is configured non-blocking
      */
+    @Test
     public void testWrite4() throws Exception {
         withConnection((sc, peer) -> {
             sc.configureBlocking(false);
             OutputStream out = sc.socket().getOutputStream();
-            expectThrows(IllegalBlockingModeException.class, () -> out.write(99));
+            assertThrows(IllegalBlockingModeException.class, () -> out.write(99));
         });
     }
 
@@ -311,6 +328,7 @@ public class AdaptorStreams {
      * Test read when there are bytes available and another thread is blocked
      * in write
      */
+    @Test
     public void testConcurrentReadWrite1() throws Exception {
         withConnection((sc, peer) -> {
             Socket s = sc.socket();
@@ -328,13 +346,14 @@ public class AdaptorStreams {
             // test read when bytes are available
             peer.getOutputStream().write(99);
             int n = s.getInputStream().read();
-            assertEquals(n, 99);
+            assertEquals(99, n);
         });
     }
 
     /**
      * Test read blocking when another thread is blocked in write
      */
+    @Test
     public void testConcurrentReadWrite2() throws Exception {
         withConnection((sc, peer) -> {
             Socket s = sc.socket();
@@ -352,13 +371,14 @@ public class AdaptorStreams {
             // test read blocking until bytes are available
             scheduleWrite(peer.getOutputStream(), 99, 500);
             int n = s.getInputStream().read();
-            assertEquals(n, 99);
+            assertEquals(99, n);
         });
     }
 
     /**
      * Test writing when another thread is blocked in read
      */
+    @Test
     public void testConcurrentReadWrite3() throws Exception {
         withConnection((sc, peer) -> {
             Socket s = sc.socket();
@@ -372,7 +392,7 @@ public class AdaptorStreams {
             // test write
             s.getOutputStream().write(99);
             int n = peer.getInputStream().read();
-            assertEquals(n, 99);
+            assertEquals(99, n);
         });
     }
 
@@ -380,6 +400,7 @@ public class AdaptorStreams {
      * Test timed read when there are bytes available and another thread is
      * blocked in write
      */
+    @Test
     public void testConcurrentTimedReadWrite1() throws Exception {
         withConnection((sc, peer) -> {
             Socket s = sc.socket();
@@ -398,13 +419,14 @@ public class AdaptorStreams {
             peer.getOutputStream().write(99);
             s.setSoTimeout(60_000);
             int n = s.getInputStream().read();
-            assertEquals(n, 99);
+            assertEquals(99, n);
         });
     }
 
     /**
      * Test timed read blocking when another thread is blocked in write
      */
+    @Test
     public void testConcurrentTimedReadWrite2() throws Exception {
         withConnection((sc, peer) -> {
             Socket s = sc.socket();
@@ -423,13 +445,14 @@ public class AdaptorStreams {
             scheduleWrite(peer.getOutputStream(), 99, 500);
             s.setSoTimeout(60_000);
             int n = s.getInputStream().read();
-            assertEquals(n, 99);
+            assertEquals(99, n);
         });
     }
 
     /**
      * Test writing when another thread is blocked in read
      */
+    @Test
     public void testConcurrentTimedReadWrite3() throws Exception {
         withConnection((sc, peer) -> {
             Socket s = sc.socket();
@@ -444,7 +467,7 @@ public class AdaptorStreams {
             // test write
             s.getOutputStream().write(99);
             int n = peer.getInputStream().read();
-            assertEquals(n, 99);
+            assertEquals(99, n);
         });
     }
 
diff --git a/test/jdk/java/nio/channels/SocketChannel/ConnectionReset.java b/test/jdk/java/nio/channels/SocketChannel/ConnectionReset.java
index 759d819fa4f..2d89d708110 100644
--- a/test/jdk/java/nio/channels/SocketChannel/ConnectionReset.java
+++ b/test/jdk/java/nio/channels/SocketChannel/ConnectionReset.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2019, 2020, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2019, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -21,9 +21,9 @@
  * questions.
  */
 
-/**
+/*
  * @test
- * @run testng ConnectionReset
+ * @run junit ConnectionReset
  * @summary Test behavior of SocketChannel.read and the Socket adaptor read
  *          and available methods when a connection is reset
  */
@@ -36,12 +36,10 @@ import java.net.ServerSocket;
 import java.net.Socket;
 import java.nio.ByteBuffer;
 import java.nio.channels.SocketChannel;
-import java.lang.reflect.Method;
 
-import org.testng.annotations.Test;
-import static org.testng.Assert.*;
+import org.junit.jupiter.api.Test;
+import static org.junit.jupiter.api.Assertions.*;
 
-@Test
 public class ConnectionReset {
 
     static final int REPEAT_COUNT = 5;
@@ -50,6 +48,7 @@ public class ConnectionReset {
      * Tests SocketChannel.read when the connection is reset and there are no
      * bytes to read.
      */
+    @Test
     public void testSocketChannelReadNoData() throws IOException {
         System.out.println("testSocketChannelReadNoData");
         withResetConnection(null, sc -> {
@@ -69,6 +68,7 @@ public class ConnectionReset {
      * Tests SocketChannel.read when the connection is reset and there are bytes
      * to read.
      */
+    @Test
     public void testSocketChannelReadData() throws IOException {
         System.out.println("testSocketChannelReadData");
         byte[] data = { 1, 2, 3 };
@@ -99,6 +99,7 @@ public class ConnectionReset {
      * Tests available before Socket read when the connection is reset and there
      * are no bytes to read.
      */
+    @Test
     public void testAvailableBeforeSocketReadNoData() throws IOException {
         System.out.println("testAvailableBeforeSocketReadNoData");
         withResetConnection(null, sc -> {
@@ -107,7 +108,7 @@ public class ConnectionReset {
             for (int i=0; i<REPEAT_COUNT; i++) {
                 int bytesAvailable = in.available();
                 System.out.format("available => %d%n", bytesAvailable);
-                assertTrue(bytesAvailable == 0);
+                assertEquals(0, bytesAvailable);
                 try {
                     int bytesRead = in.read();
                     if (bytesRead == -1) {
@@ -127,6 +128,7 @@ public class ConnectionReset {
      * Tests available before Socket read when the connection is reset and there
      * are bytes to read.
      */
+    @Test
     public void testAvailableBeforeSocketReadData() throws IOException {
         System.out.println("testAvailableBeforeSocketReadData");
         byte[] data = { 1, 2, 3 };
@@ -160,6 +162,7 @@ public class ConnectionReset {
      * Tests Socket read before available when the connection is reset and there
      * are no bytes to read.
      */
+    @Test
     public void testSocketReadNoDataBeforeAvailable() throws IOException {
         System.out.println("testSocketReadNoDataBeforeAvailable");
         withResetConnection(null, sc -> {
@@ -179,7 +182,7 @@ public class ConnectionReset {
                 }
                 int bytesAvailable = in.available();
                 System.out.format("available => %d%n", bytesAvailable);
-                assertTrue(bytesAvailable == 0);
+                assertEquals(0, bytesAvailable);
             }
         });
     }
@@ -188,6 +191,7 @@ public class ConnectionReset {
      * Tests Socket read before available when the connection is reset and there
      * are bytes to read.
      */
+    @Test
     public void testSocketReadDataBeforeAvailable() throws IOException {
         System.out.println("testSocketReadDataBeforeAvailable");
         byte[] data = { 1, 2, 3 };
diff --git a/test/jdk/java/nio/channels/SocketChannel/ReadWriteAfterClose.java b/test/jdk/java/nio/channels/SocketChannel/ReadWriteAfterClose.java
index 037e750a552..0af09df4949 100644
--- a/test/jdk/java/nio/channels/SocketChannel/ReadWriteAfterClose.java
+++ b/test/jdk/java/nio/channels/SocketChannel/ReadWriteAfterClose.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2020, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -21,9 +21,6 @@
  * questions.
  */
 
-import org.testng.annotations.AfterTest;
-import org.testng.annotations.BeforeTest;
-import org.testng.annotations.Test;
 
 import java.io.IOException;
 import java.net.InetAddress;
@@ -34,38 +31,45 @@ import java.nio.channels.ClosedChannelException;
 import java.nio.channels.ServerSocketChannel;
 import java.nio.channels.SocketChannel;
 
-import static org.testng.Assert.*;
+import org.junit.jupiter.api.AfterAll;
+import org.junit.jupiter.api.BeforeAll;
+import org.junit.jupiter.api.Test;
+import static org.junit.jupiter.api.Assertions.*;
 
 /*
  * @test
  * @bug 8246707
- * @library /test/lib
  * @summary Reading or Writing to a closed SocketChannel should throw a ClosedChannelException
- * @run testng/othervm ReadWriteAfterClose
+ * @run junit/othervm ReadWriteAfterClose
  */
 
 public class ReadWriteAfterClose {
 
-    private ServerSocketChannel listener;
-    private SocketAddress saddr;
+    private static ServerSocketChannel listener;
+    private static SocketAddress saddr;
     private static final int bufCapacity = 4;
     private static final int bufArraySize = 4;
     private static final Class<ClosedChannelException> CCE = ClosedChannelException.class;
 
-    @BeforeTest
-    public void setUp() throws IOException {
+    @BeforeAll
+    public static void setUp() throws IOException {
         listener = ServerSocketChannel.open();
         listener.bind(new InetSocketAddress(InetAddress.getLoopbackAddress(), 0));
         saddr = listener.getLocalAddress();
     }
 
+    @AfterAll
+    public static void tearDown() throws IOException {
+        if (listener != null) listener.close();
+    }
+
     @Test
     public void testWriteAfterClose1() throws IOException {
         SocketChannel sc = SocketChannel.open(saddr);
         sc.close();
         ByteBuffer bufWrite = ByteBuffer.allocate(bufCapacity);
-        Throwable ex = expectThrows(CCE, () -> sc.write(bufWrite));
-        assertEquals(ex.getClass(), CCE);
+        Throwable ex = assertThrows(CCE, () -> sc.write(bufWrite));
+        assertSame(CCE, ex.getClass());
     }
 
     @Test
@@ -73,8 +77,8 @@ public class ReadWriteAfterClose {
         SocketChannel sc = SocketChannel.open(saddr);
         sc.close();
         ByteBuffer[] bufArrayWrite = allocateBufArray();
-        Throwable ex = expectThrows(CCE, () -> sc.write(bufArrayWrite));
-        assertEquals(ex.getClass(), CCE);
+        Throwable ex = assertThrows(CCE, () -> sc.write(bufArrayWrite));
+        assertSame(CCE, ex.getClass());
     }
 
     @Test
@@ -82,8 +86,8 @@ public class ReadWriteAfterClose {
         SocketChannel sc = SocketChannel.open(saddr);
         sc.close();
         ByteBuffer[] bufArrayWrite = allocateBufArray();
-        Throwable ex = expectThrows(CCE, () -> sc.write(bufArrayWrite, 0, bufArraySize));
-        assertEquals(ex.getClass(), CCE);
+        Throwable ex = assertThrows(CCE, () -> sc.write(bufArrayWrite, 0, bufArraySize));
+        assertSame(CCE, ex.getClass());
     }
 
     @Test
@@ -91,8 +95,8 @@ public class ReadWriteAfterClose {
         SocketChannel sc = SocketChannel.open(saddr);
         sc.close();
         ByteBuffer dst = ByteBuffer.allocate(bufCapacity);
-        Throwable ex = expectThrows(CCE, () -> sc.read(dst));
-        assertEquals(ex.getClass(), CCE);
+        Throwable ex = assertThrows(CCE, () -> sc.read(dst));
+        assertSame(CCE, ex.getClass());
     }
 
     @Test
@@ -100,8 +104,8 @@ public class ReadWriteAfterClose {
         SocketChannel sc = SocketChannel.open(saddr);
         sc.close();
         ByteBuffer[] dstArray = allocateBufArray();
-        Throwable ex = expectThrows(CCE, () -> sc.read(dstArray));
-        assertEquals(ex.getClass(), CCE);
+        Throwable ex = assertThrows(CCE, () -> sc.read(dstArray));
+        assertSame(CCE, ex.getClass());
     }
 
     @Test
@@ -109,8 +113,8 @@ public class ReadWriteAfterClose {
         SocketChannel sc = SocketChannel.open(saddr);
         sc.close();
         ByteBuffer[] dstArray = allocateBufArray();
-        Throwable ex = expectThrows(CCE, () -> sc.read(dstArray, 0, bufArraySize));
-        assertEquals(ex.getClass(), CCE);
+        Throwable ex = assertThrows(CCE, () -> sc.read(dstArray, 0, bufArraySize));
+        assertSame(CCE, ex.getClass());
     }
 
     public ByteBuffer[] allocateBufArray() {
@@ -120,8 +124,4 @@ public class ReadWriteAfterClose {
         return bufArr;
     }
 
-    @AfterTest
-    public void tearDown() throws IOException {
-        listener.close();
-    }
 }
\ No newline at end of file
diff --git a/test/jdk/java/nio/channels/etc/LocalSocketAddressType.java b/test/jdk/java/nio/channels/etc/LocalSocketAddressType.java
index 63be790c478..60e41af6288 100644
--- a/test/jdk/java/nio/channels/etc/LocalSocketAddressType.java
+++ b/test/jdk/java/nio/channels/etc/LocalSocketAddressType.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2020, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -26,40 +26,44 @@
  * @summary Test local address type
  * @library /test/lib
  * @build jdk.test.lib.NetworkConfiguration
- * @run testng/othervm LocalSocketAddressType
- * @run testng/othervm -Djava.net.preferIPv4Stack=true LocalSocketAddressType
+ * @run junit/othervm LocalSocketAddressType
+ * @run junit/othervm -Djava.net.preferIPv4Stack=true LocalSocketAddressType
  */
 
 import jdk.test.lib.NetworkConfiguration;
 import jdk.test.lib.net.IPSupport;
-import org.testng.annotations.BeforeTest;
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
 
-import java.net.*;
+import java.net.InetAddress;
+import java.net.InetSocketAddress;
 import java.nio.channels.DatagramChannel;
 import java.nio.channels.ServerSocketChannel;
 import java.nio.channels.SocketChannel;
 import java.util.Iterator;
-import java.util.stream.Collectors;
 import java.util.stream.Stream;
 
-import static java.lang.Boolean.parseBoolean;
-import static java.lang.System.getProperty;
 import static java.lang.System.out;
-import static jdk.test.lib.Asserts.assertEquals;
-import static jdk.test.lib.Asserts.assertTrue;
 import static jdk.test.lib.net.IPSupport.*;
 
+import jtreg.SkippedException;
+import org.junit.jupiter.api.Assumptions;
+import org.junit.jupiter.api.BeforeAll;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+
 public class LocalSocketAddressType {
 
-    @BeforeTest()
-    public void setup() {
+    @BeforeAll()
+    public static void setup() {
         IPSupport.printPlatformSupport(out);
-        throwSkippedExceptionIfNonOperational();
+        try {
+            throwSkippedExceptionIfNonOperational();
+        } catch (SkippedException skippedException) {
+            // jtreg.SkippedException would cause a JUnit test to fail
+            Assumptions.assumeTrue(false, skippedException.getMessage());
+        }
     }
 
-    @DataProvider(name = "addresses")
     public static Iterator<Object[]> addresses() throws Exception {
         NetworkConfiguration nc = NetworkConfiguration.probe();
         return Stream.concat(nc.ip4Addresses(), nc.ip6Addresses())
@@ -67,36 +71,39 @@ public class LocalSocketAddressType {
                 .iterator();
     }
 
-    @Test(dataProvider = "addresses")
-    public static void testSocketChannel(InetSocketAddress addr) throws Exception {
+    @ParameterizedTest
+    @MethodSource("addresses")
+    public void testSocketChannel(InetSocketAddress addr) throws Exception {
         try (var c = SocketChannel.open()) {
             Class<? extends InetAddress> cls = addr.getAddress().getClass();
             InetAddress ia = ((InetSocketAddress)c.bind(addr).getLocalAddress()).getAddress();
-            assertEquals(ia.getClass(), cls);
+            assertEquals(cls, ia.getClass());
             ia = c.socket().getLocalAddress();
-            assertEquals(ia.getClass(), cls);
+            assertEquals(cls, ia.getClass());
         }
     }
 
-    @Test(dataProvider = "addresses")
-    public static void testServerSocketChannel(InetSocketAddress addr) throws Exception {
+    @ParameterizedTest
+    @MethodSource("addresses")
+    public void testServerSocketChannel(InetSocketAddress addr) throws Exception {
         try (var c = ServerSocketChannel.open()) {
             Class<? extends InetAddress> cls = addr.getAddress().getClass();
             InetAddress ia = ((InetSocketAddress)c.bind(addr).getLocalAddress()).getAddress();
-            assertEquals(ia.getClass(), cls);
+            assertEquals(cls, ia.getClass());
             ia = c.socket().getInetAddress();
-            assertEquals(ia.getClass(), cls);
+            assertEquals(cls, ia.getClass());
         }
     }
 
-    @Test(dataProvider = "addresses")
-    public static void testDatagramChannel(InetSocketAddress addr) throws Exception {
+    @ParameterizedTest
+    @MethodSource("addresses")
+    public void testDatagramChannel(InetSocketAddress addr) throws Exception {
         try (var c = DatagramChannel.open()) {
             Class<? extends InetAddress> cls = addr.getAddress().getClass();
             InetAddress ia = ((InetSocketAddress)c.bind(addr).getLocalAddress()).getAddress();
-            assertEquals(ia.getClass(), cls);
+            assertEquals(cls, ia.getClass());
             ia = c.socket().getLocalAddress();
-            assertEquals(ia.getClass(), cls);
+            assertEquals(cls, ia.getClass());
         }
     }
 }
diff --git a/test/jdk/java/nio/channels/etc/OpenAndConnect.java b/test/jdk/java/nio/channels/etc/OpenAndConnect.java
index b183076e49d..0e0347ebb57 100644
--- a/test/jdk/java/nio/channels/etc/OpenAndConnect.java
+++ b/test/jdk/java/nio/channels/etc/OpenAndConnect.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2020, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,23 +23,32 @@
 
 import jdk.test.lib.NetworkConfiguration;
 import jdk.test.lib.net.IPSupport;
-import org.testng.annotations.BeforeTest;
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
 
 import java.io.IOException;
-import java.net.*;
-import java.nio.channels.*;
-import java.util.Arrays;
+import java.net.Inet4Address;
+import java.net.Inet6Address;
+import java.net.InetAddress;
+import java.net.InetSocketAddress;
+import java.net.ProtocolFamily;
+import java.net.SocketAddress;
+import java.nio.channels.DatagramChannel;
+import java.nio.channels.ServerSocketChannel;
+import java.nio.channels.SocketChannel;
 import java.util.List;
 import java.util.LinkedList;
 
-import static java.lang.System.getProperty;
 import static java.lang.System.out;
 import static java.net.StandardProtocolFamily.INET;
 import static java.net.StandardProtocolFamily.INET6;
 import static jdk.test.lib.net.IPSupport.*;
 
+import jtreg.SkippedException;
+import org.junit.jupiter.api.Assumptions;
+import org.junit.jupiter.api.BeforeAll;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.Arguments;
+import org.junit.jupiter.params.provider.MethodSource;
+
 /*
  * @test
  * @summary Test SocketChannel, ServerSocketChannel and DatagramChannel
@@ -48,10 +57,9 @@ import static jdk.test.lib.net.IPSupport.*;
  *          addresses (Inet4Address, Inet6Address).
  * @library /test/lib
  * @build jdk.test.lib.NetworkConfiguration
- * @run testng/othervm OpenAndConnect
+ * @run junit/othervm OpenAndConnect
  */
 
-
 public class OpenAndConnect {
     static final Inet4Address IA4ANYLOCAL;
     static final Inet6Address IA6ANYLOCAL;
@@ -77,11 +85,16 @@ public class OpenAndConnect {
         }
     }
 
-    @BeforeTest()
-    public void setup() {
+    @BeforeAll()
+    public static void setup() {
         NetworkConfiguration.printSystemConfiguration(out);
         IPSupport.printPlatformSupport(out);
-        throwSkippedExceptionIfNonOperational();
+        try {
+            throwSkippedExceptionIfNonOperational();
+        } catch (SkippedException skippedException) {
+            // jtreg.SkippedException would cause a JUnit test to fail
+            Assumptions.assumeTrue(false, skippedException.getMessage());
+        }
 
         out.println("IA4LOCAL:    " + IA4LOCAL);
         out.println("IA6LOCAL:    " + IA6LOCAL);
@@ -91,9 +104,8 @@ public class OpenAndConnect {
         out.println("IA6LOOPBACK: " + IA6LOOPBACK);
     }
 
-    @DataProvider(name = "openConnect")
-    public Object[][] openConnect() {
-        LinkedList<Object[]>  l = new LinkedList<>();
+    public static List<Arguments> openConnect() {
+        LinkedList<Arguments>  l = new LinkedList<>();
         if (IPSupport.hasIPv4()) {
             l.addAll(openConnectV4Tests);
             if (IA4LOCAL != null) {
@@ -112,7 +124,7 @@ public class OpenAndConnect {
                 l.addAll(openConnectV4LocalAndV6Tests);
             }
         }
-        return l.toArray(new Object[][]{});
+        return l;
     }
 
     //            +----- sfam is server/first socket family
@@ -127,92 +139,91 @@ public class OpenAndConnect {
     //            |       |              |        |     this is address used for connect
     //            |       |              |        |     also.
     //            |       |              |        |
-    //            |       |              |        |
-    //            |       |              |        |
-    //            |       |              |        |
-    //            +       +              +        +
-    //      {   sfam,   saddr,         cfam,    caddr,      }
+    //            |       |              |        +---------------+
+    //            |       |              |                        |
+    //            |       |              +---------------+        |
+    //            |       |                              |        |
+    //            |       +---------------+              |        |
+    //            |                       |              |        |
+    //            +---------------+       |              |        |
+    //                            |       |              |        |
+    //                            +       +              +        +
+    //              Arguments.of( sfam,   saddr,         cfam,    caddr,      )
 
     // Basic tests for when an IPv4 is available
-    public static List<Object[]> openConnectV4Tests =
-        Arrays.asList(new Object[][] {
-            {   INET,   IA4LOOPBACK,   INET,    IA4LOOPBACK },
-            {   INET,   IA4LOOPBACK,   null,    IA4LOOPBACK },
-            {   INET,   IA4ANYLOCAL,   null,    IA4LOOPBACK },
-            {   INET,   IA4ANYLOCAL,   INET,    IA4LOOPBACK },
-            {   null,   IA4LOOPBACK,   INET,    IA4ANYLOCAL },
-            {   null,   IA4LOOPBACK,   INET,    IA4LOOPBACK },
-            {   null,   IA4LOOPBACK,   INET,    null        },
-            {   null,   IA4LOOPBACK,   null,    null        }
-        });
+    public static List<Arguments> openConnectV4Tests =
+            List.of(Arguments.of( INET,   IA4LOOPBACK,   INET,    IA4LOOPBACK ),
+                    Arguments.of( INET,   IA4LOOPBACK,   null,    IA4LOOPBACK ),
+                    Arguments.of( INET,   IA4ANYLOCAL,   null,    IA4LOOPBACK ),
+                    Arguments.of( INET,   IA4ANYLOCAL,   INET,    IA4LOOPBACK ),
+                    Arguments.of( null,   IA4LOOPBACK,   INET,    IA4ANYLOCAL ),
+                    Arguments.of( null,   IA4LOOPBACK,   INET,    IA4LOOPBACK ),
+                    Arguments.of( null,   IA4LOOPBACK,   INET,    null        ),
+                    Arguments.of( null,   IA4LOOPBACK,   null,    null        )
+            );
 
     // Additional tests for when an IPv4 local address is available
-    public List<Object[]>  openConnectV4LocalTests =
-        Arrays.asList(new Object[][] {
-            {   INET,   IA4LOCAL,      INET,    IA4LOCAL    },
-            {   INET,   IA4LOCAL,      null,    IA4LOCAL    },
-            {   INET,   IA4LOCAL,      null,    DONT_BIND   },
-            {   INET,   IA4ANYLOCAL,   INET,    IA4LOCAL    },
-            {   INET,   IA4ANYLOCAL,   null,    IA4LOCAL    },
-            {   null,   IA4LOCAL,      INET,    IA4ANYLOCAL },
-            {   null,   IA4LOCAL,      INET,    IA4LOCAL    },
-            {   null,   IA4LOCAL,      INET,    null        },
-            {   null,   IA4LOCAL,      null,    null        }
-        });
+    public static List<Arguments>  openConnectV4LocalTests =
+            List.of(Arguments.of( INET,   IA4LOCAL,      INET,    IA4LOCAL    ),
+                    Arguments.of( INET,   IA4LOCAL,      null,    IA4LOCAL    ),
+                    Arguments.of( INET,   IA4LOCAL,      null,    DONT_BIND   ),
+                    Arguments.of( INET,   IA4ANYLOCAL,   INET,    IA4LOCAL    ),
+                    Arguments.of( INET,   IA4ANYLOCAL,   null,    IA4LOCAL    ),
+                    Arguments.of( null,   IA4LOCAL,      INET,    IA4ANYLOCAL ),
+                    Arguments.of( null,   IA4LOCAL,      INET,    IA4LOCAL    ),
+                    Arguments.of( null,   IA4LOCAL,      INET,    null        ),
+                    Arguments.of( null,   IA4LOCAL,      null,    null        )
+            );
 
     // Basic tests for when an IPv6 is available
-    public List<Object[]> openConnectV6Tests =
-        Arrays.asList(new Object[][] {
-            {   INET6,  IA6ANYLOCAL,   null,    IA6LOOPBACK },
-            {   INET6,  IA6ANYLOCAL,   INET6,   IA6LOOPBACK },
-            {   INET6,  IA6LOOPBACK,   INET6,   IA6LOOPBACK },
-            {   INET6,  IA6LOOPBACK,   INET6,   IA6LOOPBACK },
-            {   null,   IA6ANYLOCAL,   null,    IA6LOOPBACK },
-            {   null,   IA6ANYLOCAL,   INET6,   IA6LOOPBACK },
-            {   null,   IA6LOOPBACK,   INET6,   IA6LOOPBACK },
-            {   null,   IA6LOOPBACK,   INET6,   DONT_BIND   },
-            {   null,   IA6LOOPBACK,   INET6,   null        },
-            {   null,   IA6LOOPBACK,   null,    IA6LOOPBACK },
-            {   null,   IA6LOOPBACK,   null,    null        },
-            {   null,   IA6LOOPBACK,   INET6,   IA6ANYLOCAL },
-            {   null,   IA6LOOPBACK,   null,    IA6ANYLOCAL }
-        });
+    public static List<Arguments> openConnectV6Tests =
+            List.of(Arguments.of( INET6,  IA6ANYLOCAL,   null,    IA6LOOPBACK ),
+                    Arguments.of( INET6,  IA6ANYLOCAL,   INET6,   IA6LOOPBACK ),
+                    Arguments.of( INET6,  IA6LOOPBACK,   INET6,   IA6LOOPBACK ),
+                    Arguments.of( INET6,  IA6LOOPBACK,   INET6,   IA6LOOPBACK ),
+                    Arguments.of( null,   IA6ANYLOCAL,   null,    IA6LOOPBACK ),
+                    Arguments.of( null,   IA6ANYLOCAL,   INET6,   IA6LOOPBACK ),
+                    Arguments.of( null,   IA6LOOPBACK,   INET6,   IA6LOOPBACK ),
+                    Arguments.of( null,   IA6LOOPBACK,   INET6,   DONT_BIND   ),
+                    Arguments.of( null,   IA6LOOPBACK,   INET6,   null        ),
+                    Arguments.of( null,   IA6LOOPBACK,   null,    IA6LOOPBACK ),
+                    Arguments.of( null,   IA6LOOPBACK,   null,    null        ),
+                    Arguments.of( null,   IA6LOOPBACK,   INET6,   IA6ANYLOCAL ),
+                    Arguments.of( null,   IA6LOOPBACK,   null,    IA6ANYLOCAL )
+            );
 
     // Additional tests for when an IPv6 local address is available
-    public List<Object[]> openConnectV6LocalTests =
-        Arrays.asList(new Object[][] {
-            {   INET6,  IA6ANYLOCAL,   null,    IA6LOCAL    },
-            {   INET6,  IA6ANYLOCAL,   INET6,   IA6LOCAL    },
-            {   INET6,  IA6LOCAL,      INET6,   IA6LOCAL    },
-            {   INET6,  IA6LOCAL,      null,    IA6LOCAL    },
-            {   INET6,  IA6LOCAL,      null,    DONT_BIND   },
-            {   INET6,  IA6LOCAL,      INET6,   IA6LOCAL    },
-            {   null,   IA6ANYLOCAL,   null,    IA6LOCAL    },
-            {   null,   IA6ANYLOCAL,   INET6,   IA6LOCAL    },
-            {   null,   IA6LOCAL,      INET6,   IA6LOCAL    },
-            {   null,   IA6LOCAL,      INET6,   IA6ANYLOCAL },
-            {   null,   IA6LOCAL,      null,    IA6ANYLOCAL },
-            {   null,   IA6LOCAL,      null,    IA6LOCAL    },
-            {   null,   IA6LOCAL,      INET6,   null        },
-            {   null,   IA6LOCAL,      null,    null        }
-        });
+    public static List<Arguments> openConnectV6LocalTests =
+            List.of(Arguments.of( INET6,  IA6ANYLOCAL,   null,    IA6LOCAL    ),
+                    Arguments.of( INET6,  IA6ANYLOCAL,   INET6,   IA6LOCAL    ),
+                    Arguments.of( INET6,  IA6LOCAL,      INET6,   IA6LOCAL    ),
+                    Arguments.of( INET6,  IA6LOCAL,      null,    IA6LOCAL    ),
+                    Arguments.of( INET6,  IA6LOCAL,      null,    DONT_BIND   ),
+                    Arguments.of( INET6,  IA6LOCAL,      INET6,   IA6LOCAL    ),
+                    Arguments.of( null,   IA6ANYLOCAL,   null,    IA6LOCAL    ),
+                    Arguments.of( null,   IA6ANYLOCAL,   INET6,   IA6LOCAL    ),
+                    Arguments.of( null,   IA6LOCAL,      INET6,   IA6LOCAL    ),
+                    Arguments.of( null,   IA6LOCAL,      INET6,   IA6ANYLOCAL ),
+                    Arguments.of( null,   IA6LOCAL,      null,    IA6ANYLOCAL ),
+                    Arguments.of( null,   IA6LOCAL,      null,    IA6LOCAL    ),
+                    Arguments.of( null,   IA6LOCAL,      INET6,   null        ),
+                    Arguments.of( null,   IA6LOCAL,      null,    null        )
+            );
 
     // Additional tests for when IPv4 and IPv6 are available
-     public List<Object[]> openConnectV4AndV6Tests =
-        Arrays.asList(new Object[][] {
-            {   null,   IA4LOOPBACK,   INET6,   IA6ANYLOCAL },
-            {   null,   IA4LOOPBACK,   null,    IA6ANYLOCAL },
-            {   null,   IA4LOOPBACK,   INET6,   DONT_BIND   },
-            {   null,   IA4LOOPBACK,   INET6,   null        }
-        });
+    public static List<Arguments> openConnectV4AndV6Tests =
+            List.of(Arguments.of( null,   IA4LOOPBACK,   INET6,   IA6ANYLOCAL ),
+                    Arguments.of( null,   IA4LOOPBACK,   null,    IA6ANYLOCAL ),
+                    Arguments.of( null,   IA4LOOPBACK,   INET6,   DONT_BIND   ),
+                    Arguments.of( null,   IA4LOOPBACK,   INET6,   null        )
+            );
 
     // Additional tests for when IPv4 local address and IPv6 are available
-    public List<Object[]> openConnectV4LocalAndV6Tests =
-        Arrays.asList(new Object[][] {
-            {   null,   IA4LOCAL,      INET6,   IA6ANYLOCAL },
-            {   null,   IA4LOCAL,      INET6,   null        },
-            {   null,   IA4LOCAL,      null,    IA6ANYLOCAL }
-        });
+    public static List<Arguments> openConnectV4LocalAndV6Tests =
+            List.of(Arguments.of( null,   IA4LOCAL,      INET6,   IA6ANYLOCAL ),
+                    Arguments.of( null,   IA4LOCAL,      INET6,   null        ),
+                    Arguments.of( null,   IA4LOCAL,      null,    IA6ANYLOCAL )
+            );
 
     /**
      * If the destination address is the wildcard, it is replaced by the alternate
@@ -227,7 +238,8 @@ public class OpenAndConnect {
             return isa;
     }
 
-    @Test(dataProvider = "openConnect")
+    @ParameterizedTest
+    @MethodSource("openConnect")
     public void scOpenAndConnect(ProtocolFamily sfam,
                                  InetAddress saddr,
                                  ProtocolFamily cfam,
@@ -248,7 +260,8 @@ public class OpenAndConnect {
         }
     }
 
-    @Test(dataProvider = "openConnect")
+    @ParameterizedTest
+    @MethodSource("openConnect")
     public void dcOpenAndConnect(ProtocolFamily sfam,
                                  InetAddress saddr,
                                  ProtocolFamily cfam,
diff --git a/test/jdk/java/nio/channels/etc/ProtocolFamilies.java b/test/jdk/java/nio/channels/etc/ProtocolFamilies.java
index 45226e9a97e..7f823ff35a8 100644
--- a/test/jdk/java/nio/channels/etc/ProtocolFamilies.java
+++ b/test/jdk/java/nio/channels/etc/ProtocolFamilies.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2020, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,20 +23,38 @@
 
 import jdk.test.lib.NetworkConfiguration;
 import jdk.test.lib.net.IPSupport;
-import org.testng.annotations.BeforeTest;
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
-import org.testng.Assert.ThrowingRunnable;
+
 import java.io.IOException;
-import java.net.*;
-import java.nio.channels.*;
+import java.net.Inet4Address;
+import java.net.Inet6Address;
+import java.net.InetAddress;
+import java.net.InetSocketAddress;
+import java.net.ProtocolFamily;
+import java.net.SocketAddress;
+import java.net.StandardProtocolFamily;
+import java.net.UnknownHostException;
+import java.nio.channels.DatagramChannel;
+import java.nio.channels.ServerSocketChannel;
+import java.nio.channels.SocketChannel;
+import java.nio.channels.UnsupportedAddressTypeException;
 import java.nio.channels.spi.SelectorProvider;
+import java.util.List;
+
 import static java.lang.System.out;
 import static java.net.StandardProtocolFamily.INET;
 import static java.net.StandardProtocolFamily.INET6;
 import static jdk.test.lib.net.IPSupport.*;
-import static org.testng.Assert.assertEquals;
-import static org.testng.Assert.assertThrows;
+
+import jtreg.SkippedException;
+import org.junit.jupiter.api.Assumptions;
+import org.junit.jupiter.api.BeforeAll;
+import org.junit.jupiter.api.Test;
+import org.junit.jupiter.api.function.Executable;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.Arguments;
+import org.junit.jupiter.params.provider.MethodSource;
+
+import static org.junit.jupiter.api.Assertions.assertThrows;
 
 /*
  * @test
@@ -44,8 +62,8 @@ import static org.testng.Assert.assertThrows;
  *          with various ProtocolFamily combinations
  * @library /test/lib
  * @build jdk.test.lib.NetworkConfiguration
- * @run testng ProtocolFamilies
- * @run testng/othervm -Djava.net.preferIPv4Stack=true ProtocolFamilies
+ * @run junit ProtocolFamilies
+ * @run junit/othervm -Djava.net.preferIPv4Stack=true ProtocolFamilies
  */
 
 
@@ -55,11 +73,16 @@ public class ProtocolFamilies {
     static Inet4Address ia4;
     static Inet6Address ia6;
 
-    @BeforeTest()
-    public void setup() throws Exception {
+    @BeforeAll()
+    public static void setup() throws Exception {
         NetworkConfiguration.printSystemConfiguration(out);
         IPSupport.printPlatformSupport(out);
-        throwSkippedExceptionIfNonOperational();
+        try {
+            throwSkippedExceptionIfNonOperational();
+        } catch (SkippedException skippedException) {
+            // jtreg.SkippedException would cause a JUnit test to fail
+            Assumptions.assumeTrue(false, skippedException.getMessage());
+        }
 
         ia4 = getLocalIPv4Address();
         ia6 = getLocalIPv6Address();
@@ -70,111 +93,89 @@ public class ProtocolFamilies {
     static final Class<UnsupportedAddressTypeException> UATE = UnsupportedAddressTypeException.class;
     static final Class<UnsupportedOperationException> UOE = UnsupportedOperationException.class;
 
-    @DataProvider(name = "open")
-    public Object[][] open() {
+    public static List<Arguments> open() {
         if (hasIPv6 && !preferIPv4) {
-            return new Object[][]{
-                    {  INET,   null  },
-                    {  INET6,  null  }
-            };
+            return List.of(
+                    Arguments.of(  INET,   null  ),
+                    Arguments.of(  INET6,  null  )
+            );
         } else {
-            return new Object[][]{
-                    {  INET,   null  },
-                    {  INET6,  UOE   }
-            };
+            return List.of(
+                    Arguments.of(  INET,   null  ),
+                    Arguments.of(  INET6,  UOE   )
+            );
         }
     }
 
-    @Test(dataProvider = "open")
+    @ParameterizedTest
+    @MethodSource("open")
     public void scOpen(StandardProtocolFamily family,
                        Class<? extends Exception> expectedException)
-        throws Throwable
+        throws IOException
     {
-        SocketChannel sc = null;
-        try {
-            if (expectedException == UOE) {
-                try {
-                    sc = openSC(family);
-                } catch (UnsupportedOperationException e) {}
-            } else {
-                sc = openSC(family);
-            }
-        } finally {
-            if (sc != null)
-                sc.close();
+        if (expectedException != null) {
+            assertThrows(expectedException, () -> openSC(family));
+        } else {
+            try (var _ = openSC(family)) { }
         }
     }
 
-    @Test(dataProvider = "open")
+    @ParameterizedTest
+    @MethodSource("open")
     public void sscOpen(StandardProtocolFamily family,
                         Class<? extends Exception> expectedException)
-        throws Throwable
+        throws IOException
     {
-        ServerSocketChannel ssc = null;
-        try {
-            if (expectedException == UOE) {
-                try {
-                    ssc = openSSC(family);
-                } catch (UnsupportedOperationException e) {}
-            } else {
-                openSSC(family);
-            }
-        } finally {
-            if (ssc != null)
-                ssc.close();
+        if (expectedException != null) {
+            assertThrows(expectedException, () -> openSSC(family));
+        } else {
+            try (var _ = openSSC(family)) { }
         }
     }
 
-    @Test(dataProvider = "open")
+    @ParameterizedTest
+    @MethodSource("open")
     public void dcOpen(StandardProtocolFamily family,
                        Class<? extends Exception> expectedException)
-        throws Throwable
+        throws IOException
     {
-        DatagramChannel dc = null;
-        try {
-            if (expectedException == UOE) {
-                try {
-                    dc = openDC(family);
-                } catch (UnsupportedOperationException e) {}
-            } else {
-                openDC(family);
-            }
-        } finally {
-            if (dc != null)
-                dc.close();
+        if (expectedException != null) {
+            assertThrows(expectedException, () -> openDC(family));
+        } else {
+            try (var _ = openDC(family)) { }
         }
     }
 
-    @DataProvider(name = "openBind")
-    public Object[][] openBind() {
+    public static List<Arguments> openBind() {
         if (hasIPv6 && !preferIPv4) {
-            return new Object[][]{
-                    {   INET,   INET,   null   },
-                    {   INET,   INET6,  UATE   },
-                    {   INET,   null,   null   },
-                    {   INET6,  INET,   null   },
-                    {   INET6,  INET6,  null   },
-                    {   INET6,  null,   null   },
-                    {   null,   INET,   null   },
-                    {   null,   INET6,  null   },
-                    {   null,   null,   null   }
-            };
+            return List.of(
+                    Arguments.of(  INET,   INET,   null   ),
+                    Arguments.of(  INET,   INET6,  UATE   ),
+                    Arguments.of(  INET,   null,   null   ),
+                    Arguments.of(  INET6,  INET,   null   ),
+                    Arguments.of(  INET6,  INET6,  null   ),
+                    Arguments.of(  INET6,  null,   null   ),
+                    Arguments.of(  null,   INET,   null   ),
+                    Arguments.of(  null,   INET6,  null   ),
+                    Arguments.of(  null,   null,   null   )
+            );
         } else {
-            return new Object[][]{
-                    {   INET,   INET,   null   },
-                    {   INET,   INET6,  UATE   },
-                    {   INET,   null,   null   },
-                    {   null,   INET,   null   },
-                    {   null,   INET6,  UATE   },
-                    {   null,   null,   null   }
-            };
+            return List.of(
+                    Arguments.of(  INET,   INET,   null   ),
+                    Arguments.of(  INET,   INET6,  UATE   ),
+                    Arguments.of(  INET,   null,   null   ),
+                    Arguments.of(  null,   INET,   null   ),
+                    Arguments.of(  null,   INET6,  UATE   ),
+                    Arguments.of(  null,   null,   null   )
+            );
         }
     }
 
     // SocketChannel open - INET, INET6, default
     // SocketChannel bind - INET, INET6, null
 
-    @Test(dataProvider = "openBind")
+    @ParameterizedTest
+    @MethodSource("openBind")
     public void scOpenBind(StandardProtocolFamily ofamily,
                            StandardProtocolFamily bfamily,
                            Class<? extends Exception> expectedException)
@@ -182,9 +183,9 @@ public class ProtocolFamilies {
     {
         try (SocketChannel sc = openSC(ofamily)) {
             SocketAddress addr = getSocketAddress(bfamily);
-            ThrowingRunnable bindOp = () -> sc.bind(addr);
-                if (expectedException == null)
-                    bindOp.run();
+            Executable bindOp = () -> sc.bind(addr);
+            if (expectedException == null)
+                bindOp.execute();
             else
                 assertThrows(expectedException, bindOp);
         }
@@ -193,7 +194,8 @@ public class ProtocolFamilies {
     //  ServerSocketChannel open - INET, INET6, default
     //  ServerSocketChannel bind - INET, INET6, null
 
-    @Test(dataProvider = "openBind")
+    @ParameterizedTest
+    @MethodSource("openBind")
     public void sscOpenBind(StandardProtocolFamily ofamily,
                             StandardProtocolFamily bfamily,
                             Class<? extends Exception> expectedException)
@@ -201,9 +203,9 @@ public class ProtocolFamilies {
     {
         try (ServerSocketChannel ssc = openSSC(ofamily)) {
             SocketAddress addr = getSocketAddress(bfamily);
-            ThrowingRunnable bindOp = () -> ssc.bind(addr);
+            Executable bindOp = () -> ssc.bind(addr);
             if (expectedException == null)
-                bindOp.run();
+                bindOp.execute();
             else
                 assertThrows(expectedException, bindOp);
         }
@@ -212,7 +214,8 @@ public class ProtocolFamilies {
     //  DatagramChannel open - INET, INET6, default
     //  DatagramChannel bind - INET, INET6, null
 
-    @Test(dataProvider = "openBind")
+    @ParameterizedTest
+    @MethodSource("openBind")
     public void dcOpenBind(StandardProtocolFamily ofamily,
                            StandardProtocolFamily bfamily,
                            Class<? extends Exception> expectedException)
@@ -220,9 +223,9 @@ public class ProtocolFamilies {
     {
         try (DatagramChannel dc = openDC(ofamily)) {
             SocketAddress addr = getSocketAddress(bfamily);
-            ThrowingRunnable bindOp = () -> dc.bind(addr);
+            Executable bindOp = () -> dc.bind(addr);
             if (expectedException == null)
-                bindOp.run();
+                bindOp.execute();
             else
                 assertThrows(expectedException, bindOp);
         }
@@ -231,32 +234,32 @@ public class ProtocolFamilies {
     //  SocketChannel open    - INET, INET6, default
     //  SocketChannel connect - INET, INET6, default
 
-    @DataProvider(name = "openConnect")
-    public Object[][] openConnect() {
+    public static List<Arguments> openConnect() {
         if (hasIPv6 && !preferIPv4) {
-            return new Object[][]{
-                    {   INET,   INET,   null   },
-                    {   INET,   INET6,  null   },
-                    {   INET,   null,   null   },
-                    {   INET6,  INET,   UATE   },
-                    {   INET6,  INET6,  null   },
-                    {   INET6,  null,   null   },
-                    {   null,   INET,   UATE   },
-                    {   null,   INET6,  null   },
-                    {   null,   null,   null   }
-            };
+            return List.of(
+                    Arguments.of(  INET,   INET,   null   ),
+                    Arguments.of(  INET,   INET6,  null   ),
+                    Arguments.of(  INET,   null,   null   ),
+                    Arguments.of(  INET6,  INET,   UATE   ),
+                    Arguments.of(  INET6,  INET6,  null   ),
+                    Arguments.of(  INET6,  null,   null   ),
+                    Arguments.of(  null,   INET,   UATE   ),
+                    Arguments.of(  null,   INET6,  null   ),
+                    Arguments.of(  null,   null,   null   )
+            );
         } else {
             // INET6 channels cannot be created - UOE - tested elsewhere
-            return new Object[][]{
-                    {   INET,   INET,   null   },
-                    {   INET,   null,   null   },
-                    {   null,   INET,   null   },
-                    {   null,   null,   null   }
-            };
+            return List.of(
+                    Arguments.of(  INET,   INET,   null   ),
+                    Arguments.of(  INET,   null,   null   ),
+                    Arguments.of(  null,   INET,   null   ),
+                    Arguments.of(  null,   null,   null   )
+            );
         }
     }
 
-    @Test(dataProvider = "openConnect")
+    @ParameterizedTest
+    @MethodSource("openConnect")
     public void scOpenConnect(StandardProtocolFamily sfamily,
                               StandardProtocolFamily cfamily,
                               Class<? extends Exception> expectedException)
@@ -279,7 +282,7 @@ public class ProtocolFamilies {
     // Tests null handling
     @Test
     public void testNulls() {
-        assertThrows(NPE, () -> SocketChannel.open((ProtocolFamily)null));
+        assertThrows(NPE, () -> SocketChannel.open((ProtocolFamily) null));
         assertThrows(NPE, () -> ServerSocketChannel.open(null));
         assertThrows(NPE, () -> DatagramChannel.open(null));
 
diff --git a/test/jdk/java/nio/channels/unixdomain/EmptySunPathForSocketFile.java b/test/jdk/java/nio/channels/unixdomain/EmptySunPathForSocketFile.java
index 79f8ead7aa2..ec47babdff3 100644
--- a/test/jdk/java/nio/channels/unixdomain/EmptySunPathForSocketFile.java
+++ b/test/jdk/java/nio/channels/unixdomain/EmptySunPathForSocketFile.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2020, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -21,11 +21,11 @@
  * questions.
  */
 
-/**
+/*
  * @test
  * @bug 8256461
  * @modules java.base/sun.nio.fs
- * @run testng EmptySunPathForSocketFile
+ * @run junit EmptySunPathForSocketFile
  */
 
 import java.nio.file.FileSystems;
@@ -33,7 +33,8 @@ import java.nio.file.Path;
 import java.nio.file.spi.FileSystemProvider;
 import sun.nio.fs.AbstractFileSystemProvider;
 
-import static org.testng.Assert.assertEquals;
+import org.junit.jupiter.api.Test;
+import static org.junit.jupiter.api.Assertions.assertArrayEquals;
 
 /**
  * Check that AbstractFileSystemProvider.getSunPathForSocketFile with
@@ -41,9 +42,14 @@ import static org.testng.Assert.assertEquals;
  */
 public class EmptySunPathForSocketFile {
     public static void main(String[] args) throws Exception {
+        new EmptySunPathForSocketFile().test();
+    }
+
+    @Test
+    public void test() {
         Path path = Path.of("");
         FileSystemProvider provider = FileSystems.getDefault().provider();
         byte[] bb = ((AbstractFileSystemProvider) provider).getSunPathForSocketFile(path);
-        assertEquals(bb, new byte[0]);
+        assertArrayEquals(new byte[0], bb);
     }
 }
diff --git a/test/jdk/java/nio/channels/unixdomain/FileAttributes.java b/test/jdk/java/nio/channels/unixdomain/FileAttributes.java
index 3ff92a6bc05..5e9b65f90b2 100644
--- a/test/jdk/java/nio/channels/unixdomain/FileAttributes.java
+++ b/test/jdk/java/nio/channels/unixdomain/FileAttributes.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2021, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -21,35 +21,34 @@
  * questions.
  */
 
-/**
+/*
  * @test
  * @bug 8252971
- * @library /test/lib
- * @run testng FileAttributes
+ * @run junit FileAttributes
  */
 
 import java.io.IOException;
 import java.io.File;
-import java.net.*;
-import java.nio.channels.*;
+import java.net.UnixDomainSocketAddress;
+import java.nio.channels.SocketChannel;
 import java.nio.file.Files;
 import java.nio.file.Path;
 import java.nio.file.attribute.BasicFileAttributes;
-import java.util.Arrays;
-import org.testng.annotations.Test;
-import org.testng.SkipException;
 
 import static java.net.StandardProtocolFamily.UNIX;
-import static org.testng.Assert.assertFalse;
-import static org.testng.Assert.assertThrows;
-import static org.testng.Assert.assertTrue;
+
+import org.junit.jupiter.api.Assumptions;
+import org.junit.jupiter.api.Test;
+import static org.junit.jupiter.api.Assertions.assertFalse;
+import static org.junit.jupiter.api.Assertions.assertThrows;
+import static org.junit.jupiter.api.Assertions.assertTrue;
 
 /**
  */
 public class FileAttributes {
 
     @Test
-    public static void test() throws Exception {
+    public void test() throws Exception {
         checkSupported();
         Path path = null;
         try (var chan = SocketChannel.open(UNIX)) {
@@ -89,7 +88,7 @@ public class FileAttributes {
         try {
             SocketChannel.open(UNIX).close();
         } catch (UnsupportedOperationException e) {
-            throw new SkipException("Unix domain channels not supported");
+            Assumptions.assumeTrue(false, "Unix domain channels not supported");
         } catch (Exception e) {
             // continue test to see what problem is
         }
diff --git a/test/jdk/java/nio/channels/unixdomain/IOExchanges.java b/test/jdk/java/nio/channels/unixdomain/IOExchanges.java
index 33a7b5ef3c4..9924d02504a 100644
--- a/test/jdk/java/nio/channels/unixdomain/IOExchanges.java
+++ b/test/jdk/java/nio/channels/unixdomain/IOExchanges.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -21,38 +21,45 @@
  * questions.
  */
 
-/**
+/*
  * @test
  * @bug 8245194
- * @run testng/othervm/timeout=480 IOExchanges
+ * @run junit/othervm/timeout=480 IOExchanges
  */
 
 import java.io.IOException;
-import java.net.*;
-import java.nio.channels.*;
+import java.net.ProtocolFamily;
+import java.net.SocketAddress;
+import java.net.UnixDomainSocketAddress;
 import java.nio.ByteBuffer;
+import java.nio.channels.SelectionKey;
+import java.nio.channels.Selector;
+import java.nio.channels.ServerSocketChannel;
+import java.nio.channels.SocketChannel;
 import java.nio.file.Files;
+import java.util.List;
 
-import org.testng.annotations.BeforeTest;
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
 
 import static java.lang.System.out;
 import static java.net.StandardProtocolFamily.*;
 import static java.nio.channels.SelectionKey.OP_ACCEPT;
 import static java.nio.channels.SelectionKey.OP_READ;
 import static java.nio.channels.SelectionKey.OP_WRITE;
-import static org.testng.Assert.assertEquals;
-import static org.testng.Assert.assertTrue;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertTrue;
+import org.junit.jupiter.api.BeforeAll;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
 
 public class IOExchanges {
     static boolean unixDomainSupported = true;
 
 
-    @BeforeTest()
-    public void setup() {
+    @BeforeAll()
+    public static void setup() {
         try {
-            SocketChannel.open(UNIX);
+            SocketChannel.open(UNIX).close();
         } catch (IOException | UnsupportedOperationException e) {
             unixDomainSupported = false;
             out.println("Unix domain channels not supported");
@@ -72,8 +79,8 @@ public class IOExchanges {
     }
 
     public static void deleteFile(SocketAddress addr) throws Exception {
-        if (addr instanceof UnixDomainSocketAddress) {
-            Files.deleteIfExists(((UnixDomainSocketAddress) addr).getPath());
+        if (addr instanceof UnixDomainSocketAddress uaddr) {
+            Files.deleteIfExists(uaddr.getPath());
         }
     }
 
@@ -118,18 +125,12 @@ public class IOExchanges {
         SPINBAccep_NBConn_NBIO_RW_12a
     */
 
-    @DataProvider(name = "family")
-    public Object[][] family() {
-        return unixDomainSupported ?
-                new Object[][] {
-                    { UNIX },
-                    { INET }}
-                : new Object[][] {
-                    { INET }
-        };
+    public static List<ProtocolFamily> family() {
+        return unixDomainSupported ? List.of(INET, UNIX) : List.of(INET);
     }
 
-    @Test(dataProvider = "family")
+    @ParameterizedTest
+    @MethodSource("family")
     public void BAccep_BConn_BIO_WR_1(ProtocolFamily family)
             throws Throwable {
         try (ServerSocketChannel ssc = openServerSocketChannel(family)) {
@@ -140,25 +141,26 @@ public class IOExchanges {
                 try (SocketChannel sc = openSocketChannel(family)) {
                     assertTrue(sc.connect(addr));
                     ByteBuffer bb = ByteBuffer.allocate(10).put((byte) 0x01).flip();
-                    assertEquals(sc.write(bb), 1);
+                    assertEquals(1, sc.write(bb));
                     out.printf("wrote: 0x%x%n", bb.get(0));
-                    assertEquals(sc.read(bb.clear()), -1);
+                    assertEquals(-1, sc.read(bb.clear()));
                 }
             });
             t.start();
 
             try (SocketChannel sc = ssc.accept()) {
                 ByteBuffer bb = ByteBuffer.allocate(10);
-                assertEquals(sc.read(bb), 1);
+                assertEquals(1, sc.read(bb));
                 out.printf("read:  0x%x%n", bb.get(0));
-                assertEquals(bb.get(0), 0x01);
+                assertEquals(0x01, bb.get(0));
             }
             t.awaitCompletion();
             deleteFile(addr);
         }
     }
 
-    @Test(dataProvider = "family")
+    @ParameterizedTest
+    @MethodSource("family")
     public void BAccep_BConn_BIO_RW_2(ProtocolFamily family)
             throws Throwable {
         try (ServerSocketChannel ssc = openServerSocketChannel(family)) {
@@ -169,25 +171,26 @@ public class IOExchanges {
                 try (SocketChannel sc = openSocketChannel(family)) {
                     assertTrue(sc.connect(addr));
                     ByteBuffer bb = ByteBuffer.allocate(10);
-                    assertEquals(sc.read(bb), 1);
+                    assertEquals(1, sc.read(bb));
                     out.printf("read:  0x%x%n", bb.get(0));
-                    assertEquals(bb.get(0), 0x02);
+                    assertEquals(0x02, bb.get(0));
                 }
             });
             t.start();
 
             try (SocketChannel sc = ssc.accept()) {
                 ByteBuffer bb = ByteBuffer.allocate(10).put((byte) 0x02).flip();
-                assertEquals(sc.write(bb), 1);
+                assertEquals(1, sc.write(bb));
                 out.printf("wrote: 0x%x%n", bb.get(0));
-                assertEquals(sc.read(bb.clear()), -1);
+                assertEquals(-1, sc.read(bb.clear()));
             }
             t.awaitCompletion();
             deleteFile(addr);
         }
     }
 
-    @Test(dataProvider = "family")
+    @ParameterizedTest
+    @MethodSource("family")
     public void SELNBAccep_BConn_BIO_WR_3(ProtocolFamily family)
             throws Throwable {
         try (ServerSocketChannel ssc = openServerSocketChannel(family);
@@ -199,28 +202,29 @@ public class IOExchanges {
                 try (SocketChannel sc = openSocketChannel(family)) {
                     assertTrue(sc.connect(addr));
                     ByteBuffer bb = ByteBuffer.allocate(10).put((byte) 0x03).flip();
-                    assertEquals(sc.write(bb), 1);
+                    assertEquals(1, sc.write(bb));
                     out.printf("wrote: 0x%x%n", bb.get(0));
-                    assertEquals(sc.read(bb.clear()), -1);
+                    assertEquals(-1, sc.read(bb.clear()));
                 }
             });
             t.start();
 
             ssc.configureBlocking(false).register(selector, OP_ACCEPT);
-            assertEquals(selector.select(), 1);
+            assertEquals(1, selector.select());
 
             try (SocketChannel sc = ssc.accept()) {
                 ByteBuffer bb = ByteBuffer.allocate(10);
-                assertEquals(sc.read(bb), 1);
+                assertEquals(1, sc.read(bb));
                 out.printf("read:  0x%x%n", bb.get(0));
-                assertEquals(bb.get(0), 0x03);
+                assertEquals(0x03, bb.get(0));
             }
             t.awaitCompletion();
             deleteFile(addr);
         }
     }
 
-    @Test(dataProvider = "family")
+    @ParameterizedTest
+    @MethodSource("family")
     public void SELNBAccep_BConn_BIO_RW_4(ProtocolFamily family)
             throws Throwable {
         try (ServerSocketChannel ssc = openServerSocketChannel(family);
@@ -232,21 +236,21 @@ public class IOExchanges {
                 try (SocketChannel sc = openSocketChannel(family)) {
                     assertTrue(sc.connect(addr));
                     ByteBuffer bb = ByteBuffer.allocate(10);
-                    assertEquals(sc.read(bb), 1);
+                    assertEquals(1, sc.read(bb));
                     out.printf("read:  0x%x%n", bb.get(0));
-                    assertEquals(bb.get(0), 0x04);
+                    assertEquals(0x04, bb.get(0));
                 }
             });
             t.start();
 
             ssc.configureBlocking(false).register(selector, OP_ACCEPT);
-            assertEquals(selector.select(), 1);
+            assertEquals(1, selector.select());
 
             try (SocketChannel sc = ssc.accept()) {
                 ByteBuffer bb = ByteBuffer.allocate(10).put((byte) 0x04).flip();
-                assertEquals(sc.write(bb), 1);
+                assertEquals(1, sc.write(bb));
                 out.printf("wrote: 0x%x%n", bb.get(0));
-                assertEquals(sc.read(bb.clear()), -1);
+                assertEquals(-1, sc.read(bb.clear()));
 
             }
             t.awaitCompletion();
@@ -254,7 +258,8 @@ public class IOExchanges {
         }
     }
 
-    @Test(dataProvider = "family")
+    @ParameterizedTest
+    @MethodSource("family")
     public void SPINNBAccep_BConn_BIO_WR_5(ProtocolFamily family)
             throws Throwable {
         try (ServerSocketChannel ssc = openServerSocketChannel(family)) {
@@ -265,9 +270,9 @@ public class IOExchanges {
                 try (SocketChannel sc = openSocketChannel(family)) {
                     assertTrue(sc.connect(addr));
                     ByteBuffer bb = ByteBuffer.allocate(10).put((byte) 0x05).flip();
-                    assertEquals(sc.write(bb), 1);
+                    assertEquals(1, sc.write(bb));
                     out.printf("wrote: 0x%x%n", bb.get(0));
-                    assertEquals(sc.read(bb.clear()), -1);
+                    assertEquals(-1, sc.read(bb.clear()));
                 }
             });
             t.start();
@@ -284,16 +289,17 @@ public class IOExchanges {
 
             try (SocketChannel sc = accepted) {
                 ByteBuffer bb = ByteBuffer.allocate(10);
-                assertEquals(sc.read(bb), 1);
+                assertEquals(1, sc.read(bb));
                 out.printf("read:  0x%x%n", bb.get(0));
-                assertEquals(bb.get(0), 0x05);
+                assertEquals(0x05, bb.get(0));
             }
             t.awaitCompletion();
             deleteFile(addr);
         }
     }
 
-    @Test(dataProvider = "family")
+    @ParameterizedTest
+    @MethodSource("family")
     public void SPINNBAccep_BConn_BIO_RW_6(ProtocolFamily family)
             throws Throwable {
         try (ServerSocketChannel ssc = openServerSocketChannel(family)) {
@@ -304,9 +310,9 @@ public class IOExchanges {
                 try (SocketChannel sc = openSocketChannel(family)) {
                     assertTrue(sc.connect(addr));
                     ByteBuffer bb = ByteBuffer.allocate(10);
-                    assertEquals(sc.read(bb), 1);
+                    assertEquals(1, sc.read(bb));
                     out.printf("read:  0x%x%n", bb.get(0));
-                    assertEquals(bb.get(0), 0x06);
+                    assertEquals(0x06, bb.get(0));
                 }
             });
             t.start();
@@ -323,9 +329,9 @@ public class IOExchanges {
 
             try (SocketChannel sc = accepted) {
                 ByteBuffer bb = ByteBuffer.allocate(10).put((byte) 0x06).flip();
-                assertEquals(sc.write(bb), 1);
+                assertEquals(1, sc.write(bb));
                 out.printf("wrote: 0x%x%n", bb.get(0));
-                assertEquals(sc.read(bb.clear()), -1);
+                assertEquals(-1, sc.read(bb.clear()));
 
             }
             t.awaitCompletion();
@@ -336,7 +342,8 @@ public class IOExchanges {
     // Similar to the previous six scenarios, but with same-thread
     // non-blocking connect.
 
-    @Test(dataProvider = "family")
+    @ParameterizedTest
+    @MethodSource("family")
     public void BAccep_NBConn_BIO_WR_7(ProtocolFamily family)
             throws Throwable {
         try (ServerSocketChannel ssc = openServerSocketChannel(family)) {
@@ -352,16 +359,16 @@ public class IOExchanges {
                     sc.configureBlocking(true);
                     TestThread t = TestThread.of("t7", () -> {
                         ByteBuffer bb = ByteBuffer.allocate(10).put((byte) 0x07).flip();
-                        assertEquals(sc.write(bb), 1);
+                        assertEquals(1, sc.write(bb));
                         out.printf("wrote: 0x%x%n", bb.get(0));
-                        assertEquals(sc.read(bb.clear()), -1);
+                        assertEquals(-1, sc.read(bb.clear()));
                     });
                     t.start();
 
                     ByteBuffer bb = ByteBuffer.allocate(10);
-                    assertEquals(sc2.read(bb), 1);
+                    assertEquals(1, sc2.read(bb));
                     out.printf("read:  0x%x%n", bb.get(0));
-                    assertEquals(bb.get(0), 0x07);
+                    assertEquals(0x07, bb.get(0));
                     sc2.shutdownOutput();
                     t.awaitCompletion();
                 }
@@ -370,7 +377,8 @@ public class IOExchanges {
         }
     }
 
-    @Test(dataProvider = "family")
+    @ParameterizedTest
+    @MethodSource("family")
     public void BAccep_NBConn_BIO_RW_8(ProtocolFamily family)
             throws Throwable {
         try (ServerSocketChannel ssc = openServerSocketChannel(family)) {
@@ -386,17 +394,17 @@ public class IOExchanges {
                     sc.configureBlocking(true);
                     TestThread t = TestThread.of("t8", () -> {
                         ByteBuffer bb = ByteBuffer.allocate(10);
-                        assertEquals(sc.read(bb), 1);
+                        assertEquals(1, sc.read(bb));
                         out.printf("read:  0x%x%n", bb.get(0));
-                        assertEquals(bb.get(0), 0x08);
+                        assertEquals(0x08, bb.get(0));
                         sc.shutdownOutput();
                     });
                     t.start();
 
                     ByteBuffer bb = ByteBuffer.allocate(10).put((byte) 0x08).flip();
-                    assertEquals(sc2.write(bb), 1);
+                    assertEquals(1, sc2.write(bb));
                     out.printf("wrote: 0x%x%n", bb.get(0));
-                    assertEquals(sc2.read(bb.clear()), -1);
+                    assertEquals(-1, sc2.read(bb.clear()));
                     t.awaitCompletion();
                 }
             }
@@ -404,7 +412,8 @@ public class IOExchanges {
         }
     }
 
-    @Test(dataProvider = "family")
+    @ParameterizedTest
+    @MethodSource("family")
     public void SELNBAccep_NBConn_BIO_WR_9(ProtocolFamily family)
             throws Throwable {
         try (ServerSocketChannel ssc = openServerSocketChannel(family)) {
@@ -417,23 +426,23 @@ public class IOExchanges {
                 sc.connect(addr);
 
                 ssc.configureBlocking(false).register(selector, OP_ACCEPT);
-                assertEquals(selector.select(), 1);
+                assertEquals(1, selector.select());
 
                 try (SocketChannel sc2 = ssc.accept()) {
                     assertTrue(sc.finishConnect());
                     sc.configureBlocking(true);
                     TestThread t = TestThread.of("t9", () -> {
                         ByteBuffer bb = ByteBuffer.allocate(10).put((byte) 0x09).flip();
-                        assertEquals(sc.write(bb), 1);
+                        assertEquals(1, sc.write(bb));
                         out.printf("wrote: 0x%x%n", bb.get(0));
-                        assertEquals(sc.read(bb.clear()), -1);
+                        assertEquals(-1, sc.read(bb.clear()));
                     });
                     t.start();
 
                     ByteBuffer bb = ByteBuffer.allocate(10);
-                    assertEquals(sc2.read(bb), 1);
+                    assertEquals(1, sc2.read(bb));
                     out.printf("read:  0x%x%n", bb.get(0));
-                    assertEquals(bb.get(0), 0x09);
+                    assertEquals(0x09, bb.get(0));
                     sc2.shutdownOutput();
                     t.awaitCompletion();
                 }
@@ -442,7 +451,8 @@ public class IOExchanges {
         }
     }
 
-    @Test(dataProvider = "family")
+    @ParameterizedTest
+    @MethodSource("family")
     public void SELNBAccep_NBConn_BIO_RW_10(ProtocolFamily family)
             throws Throwable {
         try (ServerSocketChannel ssc = openServerSocketChannel(family)) {
@@ -455,24 +465,24 @@ public class IOExchanges {
                 sc.connect(addr);
 
                 ssc.configureBlocking(false).register(selector, OP_ACCEPT);
-                assertEquals(selector.select(), 1);
+                assertEquals(1, selector.select());
 
                 try (SocketChannel sc2 = ssc.accept()) {
                     assertTrue(sc.finishConnect());
                     sc.configureBlocking(true);
                     TestThread t = TestThread.of("t10", () -> {
                         ByteBuffer bb = ByteBuffer.allocate(10);
-                        assertEquals(sc.read(bb), 1);
+                        assertEquals(1, sc.read(bb));
                         out.printf("read:  0x%x%n", bb.get(0));
-                        assertEquals(bb.get(0), 0x10);
+                        assertEquals(0x10, bb.get(0));
                         sc.shutdownOutput();
                     });
                     t.start();
 
                     ByteBuffer bb = ByteBuffer.allocate(10).put((byte) 0x10).flip();
-                    assertEquals(sc2.write(bb), 1);
+                    assertEquals(1, sc2.write(bb));
                     out.printf("wrote: 0x%x%n", bb.get(0));
-                    assertEquals(sc2.read(bb.clear()), -1);
+                    assertEquals(-1, sc2.read(bb.clear()));
                     t.awaitCompletion();
                 }
             }
@@ -480,7 +490,8 @@ public class IOExchanges {
         }
     }
 
-    @Test(dataProvider = "family")
+    @ParameterizedTest
+    @MethodSource("family")
     public void SPINNBAccep_NBConn_BIO_WR_11(ProtocolFamily family)
             throws Throwable {
         try (ServerSocketChannel ssc = openServerSocketChannel(family)) {
@@ -506,16 +517,16 @@ public class IOExchanges {
                     sc.configureBlocking(true);
                     TestThread t = TestThread.of("t11", () -> {
                         ByteBuffer bb = ByteBuffer.allocate(10).put((byte) 0x11).flip();
-                        assertEquals(sc.write(bb), 1);
+                        assertEquals(1, sc.write(bb));
                         out.printf("wrote: 0x%x%n", bb.get(0));
-                        assertEquals(sc.read(bb.clear()), -1);
+                        assertEquals(-1, sc.read(bb.clear()));
                     });
                     t.start();
 
                     ByteBuffer bb = ByteBuffer.allocate(10);
-                    assertEquals(sc2.read(bb), 1);
+                    assertEquals(1, sc2.read(bb));
                     out.printf("read:  0x%x%n", bb.get(0));
-                    assertEquals(bb.get(0), 0x11);
+                    assertEquals(0x11, bb.get(0));
                     sc2.shutdownOutput();
                     t.awaitCompletion();
                 }
@@ -524,7 +535,8 @@ public class IOExchanges {
         }
     }
 
-    @Test(dataProvider = "family")
+    @ParameterizedTest
+    @MethodSource("family")
     public void SPINNBAccep_NBConn_BIO_RW_12(ProtocolFamily family)
             throws Throwable {
         try (ServerSocketChannel ssc = openServerSocketChannel(family)) {
@@ -550,17 +562,17 @@ public class IOExchanges {
                     sc.configureBlocking(true);
                     TestThread t = TestThread.of("t12", () -> {
                         ByteBuffer bb = ByteBuffer.allocate(10);
-                        assertEquals(sc.read(bb), 1);
+                        assertEquals(1, sc.read(bb));
                         out.printf("read:  0x%x%n", bb.get(0));
-                        assertEquals(bb.get(0), 0x12);
+                        assertEquals(0x12, bb.get(0));
                         sc.shutdownOutput();
                     });
                     t.start();
 
                     ByteBuffer bb = ByteBuffer.allocate(10).put((byte) 0x12).flip();
-                    assertEquals(sc2.write(bb), 1);
+                    assertEquals(1, sc2.write(bb));
                     out.printf("wrote: 0x%x%n", bb.get(0));
-                    assertEquals(sc2.read(bb.clear()), -1);
+                    assertEquals(-1, sc2.read(bb.clear()));
                     t.awaitCompletion();
                 }
             }
@@ -572,7 +584,8 @@ public class IOExchanges {
     // Similar to the previous twelve scenarios but with non-blocking IO
     // ---
 
-    @Test(dataProvider = "family")
+    @ParameterizedTest
+    @MethodSource("family")
     public void BAccep_BConn_NBIO_WR_1a(ProtocolFamily family)
             throws Throwable {
         try (ServerSocketChannel ssc = openServerSocketChannel(family)) {
@@ -589,13 +602,13 @@ public class IOExchanges {
                     selector.select();
                     int c;
                     while ((c = sc.write(bb)) < 1) ;
-                    assertEquals(c, 1);
+                    assertEquals(1, c);
                     out.printf("wrote: 0x%x%n", bb.get(0));
                     k.interestOps(OP_READ);
                     selector.select();
                     bb.clear();
                     while ((c = sc.read(bb)) == 0) ;
-                    assertEquals(c, -1);
+                    assertEquals(-1, c);
                 }
             });
             t.start();
@@ -608,16 +621,17 @@ public class IOExchanges {
                 selector.select();
                 int c;
                 while ((c = sc.read(bb)) == 0) ;
-                assertEquals(c, 1);
+                assertEquals(1, c);
                 out.printf("read:  0x%x%n", bb.get(0));
-                assertEquals(bb.get(0), 0x1A);
+                assertEquals(0x1A, bb.get(0));
             }
             t.awaitCompletion();
             deleteFile(addr);
         }
     }
 
-    @Test(dataProvider = "family")
+    @ParameterizedTest
+    @MethodSource("family")
     public void BAccep_BConn_NBIO_RW_2a(ProtocolFamily family)
             throws Throwable {
         try (ServerSocketChannel ssc = openServerSocketChannel(family)) {
@@ -634,9 +648,9 @@ public class IOExchanges {
                     selector.select();
                     int c;
                     while ((c = sc.read(bb)) == 0) ;
-                    assertEquals(c, 1);
+                    assertEquals(1, c);
                     out.printf("read:  0x%x%n", bb.get(0));
-                    assertEquals(bb.get(0), 0x2A);
+                    assertEquals(0x2A, bb.get(0));
                 }
             });
             t.start();
@@ -649,20 +663,21 @@ public class IOExchanges {
                 selector.select();
                 int c;
                 while ((c = sc.write(bb)) < 1) ;
-                assertEquals(c, 1);
+                assertEquals(1, c);
                 out.printf("wrote: 0x%x%n", bb.get(0));
                 k.interestOps(OP_READ);
                 selector.select();
                 bb.clear();
                 while ((c = sc.read(bb)) == 0) ;
-                assertEquals(c, -1);
+                assertEquals(-1, c);
             }
             t.awaitCompletion();
             deleteFile(addr);
         }
     }
 
-    @Test(dataProvider = "family")
+    @ParameterizedTest
+    @MethodSource("family")
     public void SELNBAccep_BConn_NBIO_WR_3a(ProtocolFamily family)
             throws Throwable {
         try (ServerSocketChannel ssc = openServerSocketChannel(family);
@@ -680,19 +695,19 @@ public class IOExchanges {
                     selector.select();
                     int c;
                     while ((c = sc.write(bb)) < 1) ;
-                    assertEquals(c, 1);
+                    assertEquals(1, c);
                     out.printf("wrote: 0x%x%n", bb.get(0));
                     k.interestOps(OP_READ);
                     selector.select();
                     bb.clear();
                     while ((c = sc.read(bb)) == 0) ;
-                    assertEquals(c, -1);
+                    assertEquals(-1, c);
                 }
             });
             t.start();
 
             ssc.configureBlocking(false).register(aselector, OP_ACCEPT);
-            assertEquals(aselector.select(), 1);
+            assertEquals(1, aselector.select());
 
             try (SocketChannel sc = ssc.accept();
                  Selector selector = Selector.open()) {
@@ -702,16 +717,17 @@ public class IOExchanges {
                 selector.select();
                 int c;
                 while ((c = sc.read(bb)) == 0) ;
-                assertEquals(c, 1);
+                assertEquals(1, c);
                 out.printf("read:  0x%x%n", bb.get(0));
-                assertEquals(bb.get(0), 0x3A);
+                assertEquals(0x3A, bb.get(0));
             }
             t.awaitCompletion();
             deleteFile(addr);
         }
     }
 
-    @Test(dataProvider = "family")
+    @ParameterizedTest
+    @MethodSource("family")
     public void SELNBAccep_BConn_NBIO_RW_4a(ProtocolFamily family)
             throws Throwable {
         try (ServerSocketChannel ssc = openServerSocketChannel(family);
@@ -729,15 +745,15 @@ public class IOExchanges {
                     selector.select();
                     int c;
                     while ((c = sc.read(bb)) == 0) ;
-                    assertEquals(c, 1);
+                    assertEquals(1, c);
                     out.printf("read:  0x%x%n", bb.get(0));
-                    assertEquals(bb.get(0), 0x4A);
+                    assertEquals(0x4A, bb.get(0));
                 }
             });
             t.start();
 
             ssc.configureBlocking(false).register(aselector, OP_ACCEPT);
-            assertEquals(aselector.select(), 1);
+            assertEquals(1, aselector.select());
 
             try (SocketChannel sc = ssc.accept();
                  Selector selector = Selector.open()) {
@@ -747,20 +763,21 @@ public class IOExchanges {
                 selector.select();
                 int c;
                 while ((c = sc.write(bb)) < 1) ;
-                assertEquals(c, 1);
+                assertEquals(1, c);
                 out.printf("wrote: 0x%x%n", bb.get(0));
                 k.interestOps(OP_READ);
                 selector.select();
                 bb.clear();
                 while ((c = sc.read(bb)) == 0) ;
-                assertEquals(c, -1);
+                assertEquals(-1, c);
             }
             t.awaitCompletion();
             deleteFile(addr);
         }
     }
 
-    @Test(dataProvider = "family")
+    @ParameterizedTest
+    @MethodSource("family")
     public void SPINNBAccep_BConn_NBIO_WR_5a(ProtocolFamily family)
             throws Throwable {
         try (ServerSocketChannel ssc = openServerSocketChannel(family)) {
@@ -777,13 +794,13 @@ public class IOExchanges {
                     selector.select();
                     int c;
                     while ((c = sc.write(bb)) < 1) ;
-                    assertEquals(c, 1);
+                    assertEquals(1, c);
                     out.printf("wrote: 0x%x%n", bb.get(0));
                     k.interestOps(OP_READ);
                     selector.select();
                     bb.clear();
                     while ((c = sc.read(bb)) == 0) ;
-                    assertEquals(c, -1);
+                    assertEquals(-1, c);
                 }
             });
             t.start();
@@ -806,16 +823,17 @@ public class IOExchanges {
                 selector.select();
                 int c;
                 while ((c = sc.read(bb)) == 0) ;
-                assertEquals(c, 1);
+                assertEquals(1, c);
                 out.printf("read:  0x%x%n", bb.get(0));
-                assertEquals(bb.get(0), 0x5A);
+                assertEquals(0x5A, bb.get(0));
             }
             t.awaitCompletion();
             deleteFile(addr);
         }
     }
 
-    @Test(dataProvider = "family")
+    @ParameterizedTest
+    @MethodSource("family")
     public void SPINNBAccep_BConn_NBIO_RW_6a(ProtocolFamily family)
             throws Throwable {
         try (ServerSocketChannel ssc = openServerSocketChannel(family)) {
@@ -832,9 +850,9 @@ public class IOExchanges {
                     selector.select();
                     int c;
                     while ((c = sc.read(bb)) == 0) ;
-                    assertEquals(c, 1);
+                    assertEquals(1, c);
                     out.printf("read:  0x%x%n", bb.get(0));
-                    assertEquals(bb.get(0), 0x6A);
+                    assertEquals(0x6A, bb.get(0));
                 }
             });
             t.start();
@@ -857,13 +875,13 @@ public class IOExchanges {
                 selector.select();
                 int c;
                 while ((c = sc.write(bb)) < 1) ;
-                assertEquals(c, 1);
+                assertEquals(1, c);
                 out.printf("wrote: 0x%x%n", bb.get(0));
                 k.interestOps(OP_READ);
                 selector.select();
                 bb.clear();
                 while ((c = sc.read(bb)) == 0) ;
-                assertEquals(c, -1);
+                assertEquals(-1, c);
 
             }
             t.awaitCompletion();
@@ -874,7 +892,8 @@ public class IOExchanges {
     // Similar to the previous six scenarios but with same-thread
     // non-blocking connect.
 
-    @Test(dataProvider = "family")
+    @ParameterizedTest
+    @MethodSource("family")
     public void BAccep_NBConn_NBIO_WR_7a(ProtocolFamily family)
             throws Throwable {
         try (ServerSocketChannel ssc = openServerSocketChannel(family)) {
@@ -895,13 +914,13 @@ public class IOExchanges {
                             selector.select();
                             int c;
                             while ((c = sc.write(bb)) < 1) ;
-                            assertEquals(c, 1);
+                            assertEquals(1, c);
                             out.printf("wrote: 0x%x%n", bb.get(0));
                             k.interestOps(OP_READ);
                             selector.select();
                             bb.clear();
                             while ((c = sc.read(bb)) == 0) ;
-                            assertEquals(c, -1);
+                            assertEquals(-1, c);
                         }
                     });
                     t.start();
@@ -913,9 +932,9 @@ public class IOExchanges {
                         selector.select();
                         int c;
                         while ((c = sc2.read(bb)) == 0) ;
-                        assertEquals(c, 1);
+                        assertEquals(1, c);
                         out.printf("read:  0x%x%n", bb.get(0));
-                        assertEquals(bb.get(0), 0x7A);
+                        assertEquals(0x7A, bb.get(0));
                         sc2.shutdownOutput();
                     }
                     t.awaitCompletion();
@@ -925,7 +944,8 @@ public class IOExchanges {
         }
     }
 
-    @Test(dataProvider = "family")
+    @ParameterizedTest
+    @MethodSource("family")
     public void BAccep_NBConn_NBIO_RW_8a(ProtocolFamily family)
             throws Throwable {
         try (ServerSocketChannel ssc = openServerSocketChannel(family)) {
@@ -945,9 +965,9 @@ public class IOExchanges {
                             selector.select();
                             int c;
                             while ((c = sc.read(bb)) == 0) ;
-                            assertEquals(c, 1);
+                            assertEquals(1, c);
                             out.printf("read:  0x%x%n", bb.get(0));
-                            assertEquals(bb.get(0), (byte) 0x8A);
+                            assertEquals((byte) 0x8A, bb.get(0));
                             sc.shutdownOutput();
                         }
                     });
@@ -960,13 +980,13 @@ public class IOExchanges {
                         selector.select();
                         int c;
                         while ((c = sc2.write(bb)) < 1) ;
-                        assertEquals(c, 1);
+                        assertEquals(1, c);
                         out.printf("wrote: 0x%x%n", bb.get(0));
                         k.interestOps(OP_READ);
                         selector.select();
                         bb.clear();
                         while ((c = sc2.read(bb)) == 0) ;
-                        assertEquals(c, -1);
+                        assertEquals(-1, c);
                     }
                     t.awaitCompletion();
                 }
@@ -975,7 +995,8 @@ public class IOExchanges {
         }
     }
 
-    @Test(dataProvider = "family")
+    @ParameterizedTest
+    @MethodSource("family")
     public void SELNBAccep_NBConn_NBIO_WR_9a(ProtocolFamily family)
             throws Throwable {
         try (ServerSocketChannel ssc = openServerSocketChannel(family)) {
@@ -988,7 +1009,7 @@ public class IOExchanges {
 
                 Selector aselector = Selector.open();
                 ssc.configureBlocking(false).register(aselector, OP_ACCEPT);
-                assertEquals(aselector.select(), 1);
+                assertEquals(1, aselector.select());
 
                 try (SocketChannel sc2 = ssc.accept()) {
                     assertTrue(sc.finishConnect());
@@ -1000,13 +1021,13 @@ public class IOExchanges {
                             selector.select();
                             int c;
                             while ((c = sc.write(bb)) < 1) ;
-                            assertEquals(c, 1);
+                            assertEquals(1, c);
                             out.printf("wrote: 0x%x%n", bb.get(0));
                             k.interestOps(OP_READ);
                             selector.select();
                             bb.clear();
                             while ((c = sc.read(bb)) == 0) ;
-                            assertEquals(c, -1);
+                            assertEquals(-1, c);
                         }
                     });
                     t.start();
@@ -1018,9 +1039,9 @@ public class IOExchanges {
                         selector.select();
                         int c;
                         while ((c = sc2.read(bb)) == 0) ;
-                        assertEquals(c, 1);
+                        assertEquals(1, c);
                         out.printf("read:  0x%x%n", bb.get(0));
-                        assertEquals(bb.get(0), (byte) 0x9A);
+                        assertEquals((byte) 0x9A, bb.get(0));
                         sc2.shutdownOutput();
                     }
                     t.awaitCompletion();
@@ -1030,7 +1051,8 @@ public class IOExchanges {
         }
     }
 
-    @Test(dataProvider = "family")
+    @ParameterizedTest
+    @MethodSource("family")
     public void SELNBAccep_NBConn_NBIO_RW_10a(ProtocolFamily family)
             throws Throwable {
         try (ServerSocketChannel ssc = openServerSocketChannel(family)) {
@@ -1043,7 +1065,7 @@ public class IOExchanges {
 
                 Selector aselector = Selector.open();
                 ssc.configureBlocking(false).register(aselector, OP_ACCEPT);
-                assertEquals(aselector.select(), 1);
+                assertEquals(1, aselector.select());
 
                 try (SocketChannel sc2 = ssc.accept()) {
                     assertTrue(sc.finishConnect());
@@ -1054,9 +1076,9 @@ public class IOExchanges {
                             selector.select();
                             int c;
                             while ((c = sc.read(bb)) == 0) ;
-                            assertEquals(c, 1);
+                            assertEquals(1, c);
                             out.printf("read:  0x%x%n", bb.get(0));
-                            assertEquals(bb.get(0), (byte) 0xAA);
+                            assertEquals((byte) 0xAA, bb.get(0));
                             sc.shutdownOutput();
                         }
                     });
@@ -1069,13 +1091,13 @@ public class IOExchanges {
                         selector.select();
                         int c;
                         while ((c = sc2.write(bb)) < 1) ;
-                        assertEquals(c, 1);
+                        assertEquals(1, c);
                         out.printf("wrote: 0x%x%n", bb.get(0));
                         k.interestOps(OP_READ);
                         selector.select();
                         bb.clear();
                         while ((c = sc2.read(bb)) == 0) ;
-                        assertEquals(c, -1);
+                        assertEquals(-1, c);
                     }
                     t.awaitCompletion();
                 }
@@ -1084,7 +1106,8 @@ public class IOExchanges {
         }
     }
 
-    @Test(dataProvider = "family")
+    @ParameterizedTest
+    @MethodSource("family")
     public void SPINBAccep_NBConn_NBIO_WR_11a(ProtocolFamily family)
             throws Throwable {
         try (ServerSocketChannel ssc = openServerSocketChannel(family)) {
@@ -1115,13 +1138,13 @@ public class IOExchanges {
                             selector.select();
                             int c;
                             while ((c = sc.write(bb)) < 1) ;
-                            assertEquals(c, 1);
+                            assertEquals(1, c);
                             out.printf("wrote: 0x%x%n", bb.get(0));
                             k.interestOps(OP_READ);
                             selector.select();
                             bb.clear();
                             while ((c = sc.read(bb)) == 0) ;
-                            assertEquals(c, -1);
+                            assertEquals(-1, c);
                         }
                     });
                     t.start();
@@ -1133,9 +1156,9 @@ public class IOExchanges {
                         selector.select();
                         int c;
                         while ((c = sc2.read(bb)) == 0) ;
-                        assertEquals(c, 1);
+                        assertEquals(1, c);
                         out.printf("read:  0x%x%n", bb.get(0));
-                        assertEquals(bb.get(0), (byte) 0xBA);
+                        assertEquals((byte) 0xBA, bb.get(0));
                         sc2.shutdownOutput();
                     }
                     t.awaitCompletion();
@@ -1145,7 +1168,8 @@ public class IOExchanges {
         }
     }
 
-    @Test(dataProvider = "family")
+    @ParameterizedTest
+    @MethodSource("family")
     public void SPINBAccep_NBConn_NBIO_RW_12a(ProtocolFamily family)
             throws Throwable {
         try (ServerSocketChannel ssc = openServerSocketChannel(family)) {
@@ -1175,9 +1199,9 @@ public class IOExchanges {
                             selector.select();
                             int c;
                             while ((c = sc.read(bb)) == 0) ;
-                            assertEquals(c, 1);
+                            assertEquals(1, c);
                             out.printf("read:  0x%x%n", bb.get(0));
-                            assertEquals(bb.get(0), (byte) 0xCA);
+                            assertEquals((byte) 0xCA, bb.get(0));
                             sc.shutdownOutput();
                         }
                     });
@@ -1190,13 +1214,13 @@ public class IOExchanges {
                         selector.select();
                         int c;
                         while ((c = sc2.write(bb)) < 1) ;
-                        assertEquals(c, 1);
+                        assertEquals(1, c);
                         out.printf("wrote: 0x%x%n", bb.get(0));
                         k.interestOps(OP_READ);
                         selector.select();
                         bb.clear();
                         while ((c = sc2.read(bb)) == 0) ;
-                        assertEquals(c, -1);
+                        assertEquals(-1, c);
                     }
                     t.awaitCompletion();
                 }
diff --git a/test/jdk/java/nio/channels/unixdomain/NullTest.java b/test/jdk/java/nio/channels/unixdomain/NullTest.java
index ed96cfdecc9..97a5b1d1b8e 100644
--- a/test/jdk/java/nio/channels/unixdomain/NullTest.java
+++ b/test/jdk/java/nio/channels/unixdomain/NullTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2020, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -21,10 +21,10 @@
  * questions.
  */
 
-/**
+/*
  * @test
  * @bug 8245194
- * @run testng NullTest
+ * @run junit NullTest
  */
 
 import java.net.ProtocolFamily;
@@ -32,8 +32,9 @@ import java.net.SocketAddress;
 import java.net.UnixDomainSocketAddress;
 import java.nio.channels.*;
 import java.nio.file.Path;
-import org.testng.annotations.Test;
-import static org.testng.Assert.assertThrows;
+
+import org.junit.jupiter.api.Test;
+import static org.junit.jupiter.api.Assertions.assertThrows;
 
 /**
  * Check for NPE
@@ -45,7 +46,7 @@ public class NullTest {
         NullPointerException.class;
 
     @Test
-    public static void runTest() throws Exception {
+    public void runTest() throws Exception {
         assertThrows(NPE, () -> SocketChannel.open((ProtocolFamily)null));
         assertThrows(NPE, () -> SocketChannel.open((SocketAddress)null));
         assertThrows(NPE, () -> ServerSocketChannel.open((ProtocolFamily)null));

From 1e3fb444c5aa0038d123c0f43858c1c4c684d958 Mon Sep 17 00:00:00 2001
From: Ioi Lam <iklam@openjdk.org>
Date: Thu, 26 Mar 2026 13:54:02 +0000
Subject: [PATCH 364/655] 8380409: JVM crashes when -XX:AOTMode=create uses
 app.aotconf generated with JVMTI agent

Reviewed-by: kvn, asmehra
---
 src/hotspot/share/cds/aotArtifactFinder.cpp   | 27 +++++-
 src/hotspot/share/cds/aotArtifactFinder.hpp   |  4 +-
 src/hotspot/share/cds/heapShared.cpp          |  1 +
 .../aotCache/RedefineCriticalClasses.java     | 83 +++++++++++++++++++
 .../aotCache/TransformCriticalClasses.java    | 72 ++++++++++++++++
 5 files changed, 185 insertions(+), 2 deletions(-)
 create mode 100644 test/hotspot/jtreg/runtime/cds/appcds/aotCache/RedefineCriticalClasses.java
 create mode 100644 test/hotspot/jtreg/runtime/cds/appcds/aotCache/TransformCriticalClasses.java

diff --git a/src/hotspot/share/cds/aotArtifactFinder.cpp b/src/hotspot/share/cds/aotArtifactFinder.cpp
index f85f1e46520..bd69b18a1aa 100644
--- a/src/hotspot/share/cds/aotArtifactFinder.cpp
+++ b/src/hotspot/share/cds/aotArtifactFinder.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2025, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -32,6 +32,7 @@
 #include "cds/lambdaProxyClassDictionary.hpp"
 #include "cds/regeneratedClasses.hpp"
 #include "classfile/systemDictionaryShared.hpp"
+#include "classfile/vmClasses.hpp"
 #include "logging/log.hpp"
 #include "memory/metaspaceClosure.hpp"
 #include "oops/instanceKlass.hpp"
@@ -169,6 +170,7 @@ void AOTArtifactFinder::find_artifacts() {
   end_scanning_for_oops();
 
   TrainingData::cleanup_training_data();
+  check_critical_classes();
 }
 
 void AOTArtifactFinder::start_scanning_for_oops() {
@@ -233,6 +235,7 @@ void AOTArtifactFinder::add_cached_instance_class(InstanceKlass* ik) {
   bool created;
   _seen_classes->put_if_absent(ik, &created);
   if (created) {
+    check_critical_class(ik);
     append_to_all_cached_classes(ik);
 
     // All super types must be added.
@@ -310,3 +313,25 @@ void AOTArtifactFinder::all_cached_classes_do(MetaspaceClosure* it) {
     it->push(_all_cached_classes->adr_at(i));
   }
 }
+
+void AOTArtifactFinder::check_critical_classes() {
+  if (CDSConfig::is_dumping_static_archive()) {
+    // vmClasses are store in the AOT cache (or AOT config file, or static archive).
+    // If any of the vmClasses is excluded, (usually due to incompatible JVMTI agent),
+    // the resulting cache/config/archive is unusable.
+    for (auto id : EnumRange<vmClassID>{}) {
+      check_critical_class(vmClasses::klass_at(id));
+    }
+  }
+}
+
+void AOTArtifactFinder::check_critical_class(InstanceKlass* ik) {
+  if (SystemDictionaryShared::is_excluded_class(ik)) {
+    ResourceMark rm;
+    const char* msg = err_msg("Critical class %s has been excluded. %s cannot be written.",
+                              ik->external_name(),
+                              CDSConfig::type_of_archive_being_written());
+    AOTMetaspace::unrecoverable_writing_error(msg);
+  }
+}
+
diff --git a/src/hotspot/share/cds/aotArtifactFinder.hpp b/src/hotspot/share/cds/aotArtifactFinder.hpp
index 05bcde6b0ac..50057b6caee 100644
--- a/src/hotspot/share/cds/aotArtifactFinder.hpp
+++ b/src/hotspot/share/cds/aotArtifactFinder.hpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2025, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -81,12 +81,14 @@ class AOTArtifactFinder : AllStatic {
   static void add_cached_type_array_class(TypeArrayKlass* tak);
   static void add_cached_instance_class(InstanceKlass* ik);
   static void append_to_all_cached_classes(Klass* k);
+  static void check_critical_class(InstanceKlass* ik);
 public:
   static void initialize();
   static void find_artifacts();
   static void add_cached_class(Klass* k);
   static void add_aot_inited_class(InstanceKlass* ik);
   static void all_cached_classes_do(MetaspaceClosure* it);
+  static void check_critical_classes();
   static void dispose();
 };
 
diff --git a/src/hotspot/share/cds/heapShared.cpp b/src/hotspot/share/cds/heapShared.cpp
index 708a19e9a7d..3d10e7e1f88 100644
--- a/src/hotspot/share/cds/heapShared.cpp
+++ b/src/hotspot/share/cds/heapShared.cpp
@@ -564,6 +564,7 @@ bool HeapShared::archive_object(oop obj, oop referrer, KlassSubGraphInfo* subgra
     return false;
   }
 
+  AOTArtifactFinder::add_cached_class(obj->klass());
   AOTOopChecker::check(obj); // Make sure contents of this oop are safe.
   count_allocation(obj->size());
 
diff --git a/test/hotspot/jtreg/runtime/cds/appcds/aotCache/RedefineCriticalClasses.java b/test/hotspot/jtreg/runtime/cds/appcds/aotCache/RedefineCriticalClasses.java
new file mode 100644
index 00000000000..c4753ee3878
--- /dev/null
+++ b/test/hotspot/jtreg/runtime/cds/appcds/aotCache/RedefineCriticalClasses.java
@@ -0,0 +1,83 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ *
+ */
+
+
+/*
+ * @test
+ * @summary AOT training run should fail if critical classes have been redefined by JVMTI
+ * @bug 8380409
+ * @requires vm.cds.supports.aot.class.linking
+ * @library /test/lib
+ * @run driver RedefineClassHelper
+ * @build RedefineCriticalClasses
+ * @run driver jdk.test.lib.helpers.ClassFileInstaller -jar app.jar RedefineCriticalClassesApp
+ * @run driver RedefineCriticalClasses
+ */
+
+import java.io.InputStream;
+import java.net.URL;
+import java.util.ArrayList;
+import jdk.test.lib.cds.CDSTestUtils;
+import jdk.test.lib.helpers.ClassFileInstaller;
+import jdk.test.lib.process.ProcessTools;
+
+public class RedefineCriticalClasses {
+    public static void main(String... args) throws Exception {
+        ArrayList<String> processArgs = new ArrayList<>();
+
+        // redefineagent.jar is created by "@run driver RedefineClassHelper"
+        processArgs.add("-javaagent:redefineagent.jar");
+
+        processArgs.add("-XX:AOTMode=record");
+        processArgs.add("-XX:AOTConfiguration=app.aotconfig");
+        processArgs.add("-Xlog:aot,cds");
+        processArgs.add("-cp");
+        processArgs.add("app.jar");
+        processArgs.add("RedefineCriticalClassesApp");
+
+        ProcessBuilder pb = ProcessTools.createLimitedTestJavaProcessBuilder(processArgs);
+        CDSTestUtils.executeAndLog(pb, "train")
+            .shouldContain("Redefined: class java.lang.Class")
+            .shouldContain("Skipping java/lang/Class: Has been redefined")
+            .shouldContain("Critical class java.lang.Class has been excluded. AOT configuration file cannot be written")
+            .shouldHaveExitValue(1);
+    }
+}
+
+class RedefineCriticalClassesApp {
+    public static void main(String[] args) throws Exception {
+        // Use RedefineClassHelper (loaded from redefineagent.jar into the boot class loader)
+        // to redefine java/lang/Class, using the exact same bytecodes as from the JDK.
+        // The JVM will mark it as having been redefined by JVMTI and will exclude it from the
+        // AOT configuration file.
+
+        URL url = new URL("jrt:/java.base/java/lang/Class.class");
+        try (InputStream in = url.openConnection().getInputStream()) {
+            byte[] b = in.readAllBytes();
+            System.out.println("Length = " + b.length);
+            RedefineClassHelper.redefineClass(Class.class, b);
+            System.out.println("Redefined: " + Class.class);
+        }
+    }
+}
diff --git a/test/hotspot/jtreg/runtime/cds/appcds/aotCache/TransformCriticalClasses.java b/test/hotspot/jtreg/runtime/cds/appcds/aotCache/TransformCriticalClasses.java
new file mode 100644
index 00000000000..9f25d58e01f
--- /dev/null
+++ b/test/hotspot/jtreg/runtime/cds/appcds/aotCache/TransformCriticalClasses.java
@@ -0,0 +1,72 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ *
+ */
+
+
+/*
+ * @test
+ * @summary AOT training run should fail if critical classes have been transformed by JVMTI
+ *          with ClassFileLoadHook
+ * @bug 8380409
+ * @requires vm.cds.supports.aot.class.linking
+ * @library /test/lib
+ * @build TransformCriticalClasses
+ * @run driver jdk.test.lib.helpers.ClassFileInstaller -jar app.jar TransformCriticalClassesApp
+ * @run main/othervm/native TransformCriticalClasses
+ */
+
+import java.util.ArrayList;
+import jdk.test.lib.cds.CDSTestUtils;
+import jdk.test.lib.helpers.ClassFileInstaller;
+import jdk.test.lib.process.ProcessTools;
+
+public class TransformCriticalClasses {
+    public static void main(String... args) throws Exception {
+        ArrayList<String> processArgs = new ArrayList<>();
+
+        // Tell the native agent SimpleClassFileLoadHook to do an dummy transformation
+        // of java/lang/Class. This class will be defined using the exact same bytecodes
+        // as from the JDK, but the JVM will mark it as having been transformed by JVMTI
+        // and will exclude it from the AOT configuration file.
+        processArgs.add("-agentlib:SimpleClassFileLoadHook=-early,java/lang/Class,xxxxxx,xxxxxx");
+
+        processArgs.add("-XX:AOTMode=record");
+        processArgs.add("-XX:AOTConfiguration=app.aotconfig");
+        processArgs.add("-Xlog:aot,cds");
+        processArgs.add("-cp");
+        processArgs.add("app.jar");
+        processArgs.add("TransformCriticalClassesApp");
+
+        ProcessBuilder pb = ProcessTools.createLimitedTestJavaProcessBuilder(processArgs);
+        CDSTestUtils.executeAndLog(pb, "train")
+            .shouldContain("Skipping java/lang/Class: From ClassFileLoadHook")
+            .shouldContain("Critical class java.lang.Class has been excluded. AOT configuration file cannot be written")
+            .shouldHaveExitValue(1);
+    }
+}
+
+class TransformCriticalClassesApp {
+    public static void main(String[] args) {
+        System.out.println("HelloWorld");
+    }
+}

From b3048bbed0ab050f139d117e11657a2eef081861 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Paul=20H=C3=BCbner?= <phubner@openjdk.org>
Date: Thu, 26 Mar 2026 14:09:17 +0000
Subject: [PATCH 365/655] 8370504:
 InterpreterMacroAssembler::profile_virtual_call parameter
 'receiver_can_be_null' is unused

Reviewed-by: aseoane, azafari, mchevalier, fbredberg
---
 src/hotspot/cpu/aarch64/interp_masm_aarch64.cpp | 15 ++-------------
 src/hotspot/cpu/aarch64/interp_masm_aarch64.hpp |  5 ++---
 src/hotspot/cpu/arm/interp_masm_arm.cpp         | 15 ++-------------
 src/hotspot/cpu/arm/interp_masm_arm.hpp         |  5 ++---
 src/hotspot/cpu/ppc/interp_masm_ppc.hpp         |  4 ++--
 src/hotspot/cpu/ppc/interp_masm_ppc_64.cpp      | 17 ++---------------
 src/hotspot/cpu/ppc/templateTable_ppc_64.cpp    |  6 +++---
 src/hotspot/cpu/riscv/interp_masm_riscv.cpp     | 15 ++-------------
 src/hotspot/cpu/riscv/interp_masm_riscv.hpp     |  5 ++---
 src/hotspot/cpu/s390/interp_masm_s390.cpp       | 16 ++--------------
 src/hotspot/cpu/s390/interp_masm_s390.hpp       |  5 ++---
 src/hotspot/cpu/x86/interp_masm_x86.cpp         | 17 ++---------------
 src/hotspot/cpu/x86/interp_masm_x86.hpp         |  5 ++---
 13 files changed, 27 insertions(+), 103 deletions(-)

diff --git a/src/hotspot/cpu/aarch64/interp_masm_aarch64.cpp b/src/hotspot/cpu/aarch64/interp_masm_aarch64.cpp
index 2b506b241e0..980fedb406d 100644
--- a/src/hotspot/cpu/aarch64/interp_masm_aarch64.cpp
+++ b/src/hotspot/cpu/aarch64/interp_masm_aarch64.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * Copyright (c) 2014, 2020, Red Hat Inc. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
@@ -989,26 +989,15 @@ void InterpreterMacroAssembler::profile_final_call(Register mdp) {
 
 
 void InterpreterMacroAssembler::profile_virtual_call(Register receiver,
-                                                     Register mdp,
-                                                     bool receiver_can_be_null) {
+                                                     Register mdp) {
   if (ProfileInterpreter) {
     Label profile_continue;
 
     // If no method data exists, go to profile_continue.
     test_method_data_pointer(mdp, profile_continue);
 
-    Label skip_receiver_profile;
-    if (receiver_can_be_null) {
-      Label not_null;
-      // We are making a call.  Increment the count for null receiver.
-      increment_mdp_data_at(mdp, in_bytes(CounterData::count_offset()));
-      b(skip_receiver_profile);
-      bind(not_null);
-    }
-
     // Record the receiver type.
     profile_receiver_type(receiver, mdp, 0);
-    bind(skip_receiver_profile);
 
     // The method data pointer needs to be updated to reflect the new target.
     update_mdp_by_constant(mdp, in_bytes(VirtualCallData::virtual_call_data_size()));
diff --git a/src/hotspot/cpu/aarch64/interp_masm_aarch64.hpp b/src/hotspot/cpu/aarch64/interp_masm_aarch64.hpp
index 74d4430000d..9a074f1ce69 100644
--- a/src/hotspot/cpu/aarch64/interp_masm_aarch64.hpp
+++ b/src/hotspot/cpu/aarch64/interp_masm_aarch64.hpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * Copyright (c) 2014, 2015, Red Hat Inc. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
@@ -285,8 +285,7 @@ class InterpreterMacroAssembler: public MacroAssembler {
   void profile_not_taken_branch(Register mdp);
   void profile_call(Register mdp);
   void profile_final_call(Register mdp);
-  void profile_virtual_call(Register receiver, Register mdp,
-                            bool receiver_can_be_null = false);
+  void profile_virtual_call(Register receiver, Register mdp);
   void profile_ret(Register return_bci, Register mdp);
   void profile_null_seen(Register mdp);
   void profile_typecheck(Register mdp, Register klass);
diff --git a/src/hotspot/cpu/arm/interp_masm_arm.cpp b/src/hotspot/cpu/arm/interp_masm_arm.cpp
index 23ecea24eb2..aee407864ee 100644
--- a/src/hotspot/cpu/arm/interp_masm_arm.cpp
+++ b/src/hotspot/cpu/arm/interp_masm_arm.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2008, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2008, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -1210,7 +1210,7 @@ void InterpreterMacroAssembler::profile_final_call(Register mdp) {
 
 
 // Sets mdp, blows Rtemp.
-void InterpreterMacroAssembler::profile_virtual_call(Register mdp, Register receiver, bool receiver_can_be_null) {
+void InterpreterMacroAssembler::profile_virtual_call(Register mdp, Register receiver) {
   assert_different_registers(mdp, receiver, Rtemp);
 
   if (ProfileInterpreter) {
@@ -1219,19 +1219,8 @@ void InterpreterMacroAssembler::profile_virtual_call(Register mdp, Register rece
     // If no method data exists, go to profile_continue.
     test_method_data_pointer(mdp, profile_continue);
 
-    Label skip_receiver_profile;
-    if (receiver_can_be_null) {
-      Label not_null;
-      cbnz(receiver, not_null);
-      // We are making a call.  Increment the count for null receiver.
-      increment_mdp_data_at(mdp, in_bytes(CounterData::count_offset()), Rtemp);
-      b(skip_receiver_profile);
-      bind(not_null);
-    }
-
     // Record the receiver type.
     record_klass_in_profile(receiver, mdp, Rtemp, true);
-    bind(skip_receiver_profile);
 
     // The method data pointer needs to be updated to reflect the new target.
     update_mdp_by_constant(mdp, in_bytes(VirtualCallData::virtual_call_data_size()));
diff --git a/src/hotspot/cpu/arm/interp_masm_arm.hpp b/src/hotspot/cpu/arm/interp_masm_arm.hpp
index 530be1c577e..147cd252b2c 100644
--- a/src/hotspot/cpu/arm/interp_masm_arm.hpp
+++ b/src/hotspot/cpu/arm/interp_masm_arm.hpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2008, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2008, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -239,8 +239,7 @@ class InterpreterMacroAssembler: public MacroAssembler {
 
   void profile_call(Register mdp);                                // Sets mdp, blows Rtemp.
   void profile_final_call(Register mdp);                          // Sets mdp, blows Rtemp.
-  void profile_virtual_call(Register mdp, Register receiver,      // Sets mdp, blows Rtemp.
-                            bool receiver_can_be_null = false);
+  void profile_virtual_call(Register mdp, Register receiver);     // Sets mdp, blows Rtemp.
   void profile_ret(Register mdp, Register return_bci);            // Sets mdp, blows R0-R3/R0-R18, Rtemp, LR
   void profile_null_seen(Register mdp);                           // Sets mdp.
   void profile_typecheck(Register mdp, Register klass);           // Sets mdp, blows Rtemp.
diff --git a/src/hotspot/cpu/ppc/interp_masm_ppc.hpp b/src/hotspot/cpu/ppc/interp_masm_ppc.hpp
index 4ea33ebaf63..275ff92c699 100644
--- a/src/hotspot/cpu/ppc/interp_masm_ppc.hpp
+++ b/src/hotspot/cpu/ppc/interp_masm_ppc.hpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2002, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2002, 2026, Oracle and/or its affiliates. All rights reserved.
  * Copyright (c) 2012, 2025 SAP SE. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
@@ -258,7 +258,7 @@ class InterpreterMacroAssembler: public MacroAssembler {
   void profile_not_taken_branch(Register scratch1, Register scratch2);
   void profile_call(Register scratch1, Register scratch2);
   void profile_final_call(Register scratch1, Register scratch2);
-  void profile_virtual_call(Register Rreceiver, Register Rscratch1, Register Rscratch2,  bool receiver_can_be_null);
+  void profile_virtual_call(Register Rreceiver, Register Rscratch1, Register Rscratch2);
   void profile_typecheck(Register Rklass, Register Rscratch1, Register Rscratch2);
   void profile_ret(TosState state, Register return_bci, Register scratch1, Register scratch2);
   void profile_switch_default(Register scratch1, Register scratch2);
diff --git a/src/hotspot/cpu/ppc/interp_masm_ppc_64.cpp b/src/hotspot/cpu/ppc/interp_masm_ppc_64.cpp
index f7bf457f72c..56eade8e533 100644
--- a/src/hotspot/cpu/ppc/interp_masm_ppc_64.cpp
+++ b/src/hotspot/cpu/ppc/interp_masm_ppc_64.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * Copyright (c) 2012, 2025 SAP SE. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
@@ -1340,28 +1340,15 @@ void InterpreterMacroAssembler::profile_final_call(Register scratch1, Register s
 // Count a virtual call in the bytecodes.
 void InterpreterMacroAssembler::profile_virtual_call(Register Rreceiver,
                                                      Register Rscratch1,
-                                                     Register Rscratch2,
-                                                     bool receiver_can_be_null) {
+                                                     Register Rscratch2) {
   if (!ProfileInterpreter) { return; }
   Label profile_continue;
 
   // If no method data exists, go to profile_continue.
   test_method_data_pointer(profile_continue);
 
-  Label skip_receiver_profile;
-  if (receiver_can_be_null) {
-    Label not_null;
-    cmpdi(CR0, Rreceiver, 0);
-    bne(CR0, not_null);
-    // We are making a call. Increment the count for null receiver.
-    increment_mdp_data_at(in_bytes(CounterData::count_offset()), Rscratch1, Rscratch2);
-    b(skip_receiver_profile);
-    bind(not_null);
-  }
-
   // Record the receiver type.
   record_klass_in_profile(Rreceiver, Rscratch1, Rscratch2);
-  bind(skip_receiver_profile);
 
   // The method data pointer needs to be updated to reflect the new target.
   update_mdp_by_constant(in_bytes(VirtualCallData::virtual_call_data_size()));
diff --git a/src/hotspot/cpu/ppc/templateTable_ppc_64.cpp b/src/hotspot/cpu/ppc/templateTable_ppc_64.cpp
index 8a3af748fa1..37f780535b4 100644
--- a/src/hotspot/cpu/ppc/templateTable_ppc_64.cpp
+++ b/src/hotspot/cpu/ppc/templateTable_ppc_64.cpp
@@ -3489,7 +3489,7 @@ void TemplateTable::invokevirtual(int byte_no) {
   // Get receiver klass.
   __ load_klass_check_null_throw(Rrecv_klass, Rrecv, R11_scratch1);
   __ verify_klass_ptr(Rrecv_klass);
-  __ profile_virtual_call(Rrecv_klass, R11_scratch1, R12_scratch2, false);
+  __ profile_virtual_call(Rrecv_klass, R11_scratch1, R12_scratch2);
 
   generate_vtable_call(Rrecv_klass, Rvtableindex_or_method, Rret_addr, R11_scratch1);
 }
@@ -3596,7 +3596,7 @@ void TemplateTable::invokeinterface_object_method(Register Rrecv_klass,
   // Non-final callc case.
   __ bind(LnotFinal);
   __ lhz(Rindex, in_bytes(ResolvedMethodEntry::table_index_offset()), Rcache);
-  __ profile_virtual_call(Rrecv_klass, Rtemp1, Rscratch, false);
+  __ profile_virtual_call(Rrecv_klass, Rtemp1, Rscratch);
   generate_vtable_call(Rrecv_klass, Rindex, Rret, Rscratch);
 }
 
@@ -3664,7 +3664,7 @@ void TemplateTable::invokeinterface(int byte_no) {
   __ lookup_interface_method(Rrecv_klass, Rinterface_klass, noreg, noreg, Rscratch1, Rscratch2,
                              L_no_such_interface, /*return_method=*/false);
 
-  __ profile_virtual_call(Rrecv_klass, Rscratch1, Rscratch2, false);
+  __ profile_virtual_call(Rrecv_klass, Rscratch1, Rscratch2);
 
   // Find entry point to call.
 
diff --git a/src/hotspot/cpu/riscv/interp_masm_riscv.cpp b/src/hotspot/cpu/riscv/interp_masm_riscv.cpp
index 744590bec2b..804c2072ba5 100644
--- a/src/hotspot/cpu/riscv/interp_masm_riscv.cpp
+++ b/src/hotspot/cpu/riscv/interp_masm_riscv.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * Copyright (c) 2014, 2020, Red Hat Inc. All rights reserved.
  * Copyright (c) 2020, 2023, Huawei Technologies Co., Ltd. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
@@ -1040,26 +1040,15 @@ void InterpreterMacroAssembler::profile_final_call(Register mdp) {
 
 
 void InterpreterMacroAssembler::profile_virtual_call(Register receiver,
-                                                     Register mdp,
-                                                     bool receiver_can_be_null) {
+                                                     Register mdp) {
   if (ProfileInterpreter) {
     Label profile_continue;
 
     // If no method data exists, go to profile_continue.
     test_method_data_pointer(mdp, profile_continue);
 
-    Label skip_receiver_profile;
-    if (receiver_can_be_null) {
-      Label not_null;
-      // We are making a call.  Increment the count for null receiver.
-      increment_mdp_data_at(mdp, in_bytes(CounterData::count_offset()));
-      j(skip_receiver_profile);
-      bind(not_null);
-    }
-
     // Record the receiver type.
     profile_receiver_type(receiver, mdp, 0);
-    bind(skip_receiver_profile);
 
     // The method data pointer needs to be updated to reflect the new target.
 
diff --git a/src/hotspot/cpu/riscv/interp_masm_riscv.hpp b/src/hotspot/cpu/riscv/interp_masm_riscv.hpp
index 59cc76b022f..df86f0dc532 100644
--- a/src/hotspot/cpu/riscv/interp_masm_riscv.hpp
+++ b/src/hotspot/cpu/riscv/interp_masm_riscv.hpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * Copyright (c) 2014, 2015, Red Hat Inc. All rights reserved.
  * Copyright (c) 2020, 2021, Huawei Technologies Co., Ltd. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
@@ -274,8 +274,7 @@ class InterpreterMacroAssembler: public MacroAssembler {
   void profile_not_taken_branch(Register mdp);
   void profile_call(Register mdp);
   void profile_final_call(Register mdp);
-  void profile_virtual_call(Register receiver, Register mdp,
-                            bool receiver_can_be_null = false);
+  void profile_virtual_call(Register receiver, Register mdp);
   void profile_ret(Register return_bci, Register mdp);
   void profile_null_seen(Register mdp);
   void profile_typecheck(Register mdp, Register klass);
diff --git a/src/hotspot/cpu/s390/interp_masm_s390.cpp b/src/hotspot/cpu/s390/interp_masm_s390.cpp
index a80ca26239b..d5239898dd7 100644
--- a/src/hotspot/cpu/s390/interp_masm_s390.cpp
+++ b/src/hotspot/cpu/s390/interp_masm_s390.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2016, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2016, 2026, Oracle and/or its affiliates. All rights reserved.
  * Copyright (c) 2016, 2024 SAP SE. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
@@ -1259,27 +1259,15 @@ void InterpreterMacroAssembler::profile_final_call(Register mdp) {
 
 void InterpreterMacroAssembler::profile_virtual_call(Register receiver,
                                                      Register mdp,
-                                                     Register reg2,
-                                                     bool receiver_can_be_null) {
+                                                     Register reg2) {
   if (ProfileInterpreter) {
     NearLabel profile_continue;
 
     // If no method data exists, go to profile_continue.
     test_method_data_pointer(mdp, profile_continue);
 
-    NearLabel skip_receiver_profile;
-    if (receiver_can_be_null) {
-      NearLabel not_null;
-      compareU64_and_branch(receiver, (intptr_t)0L, bcondNotEqual, not_null);
-      // We are making a call. Increment the count for null receiver.
-      increment_mdp_data_at(mdp, in_bytes(CounterData::count_offset()));
-      z_bru(skip_receiver_profile);
-      bind(not_null);
-    }
-
     // Record the receiver type.
     record_klass_in_profile(receiver, mdp, reg2);
-    bind(skip_receiver_profile);
 
     // The method data pointer needs to be updated to reflect the new target.
     update_mdp_by_constant(mdp, in_bytes(VirtualCallData::virtual_call_data_size()));
diff --git a/src/hotspot/cpu/s390/interp_masm_s390.hpp b/src/hotspot/cpu/s390/interp_masm_s390.hpp
index d981f9ea01e..b816185b065 100644
--- a/src/hotspot/cpu/s390/interp_masm_s390.hpp
+++ b/src/hotspot/cpu/s390/interp_masm_s390.hpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2016, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2016, 2026, Oracle and/or its affiliates. All rights reserved.
  * Copyright (c) 2016, 2024 SAP SE. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
@@ -296,8 +296,7 @@ class InterpreterMacroAssembler: public MacroAssembler {
   void profile_call(Register mdp);
   void profile_final_call(Register mdp);
   void profile_virtual_call(Register receiver, Register mdp,
-                            Register scratch2,
-                            bool receiver_can_be_null = false);
+                            Register scratch2);
   void profile_ret(Register return_bci, Register mdp);
   void profile_null_seen(Register mdp);
   void profile_typecheck(Register mdp, Register klass, Register scratch);
diff --git a/src/hotspot/cpu/x86/interp_masm_x86.cpp b/src/hotspot/cpu/x86/interp_masm_x86.cpp
index b2ea4143ac4..a38971c86fb 100644
--- a/src/hotspot/cpu/x86/interp_masm_x86.cpp
+++ b/src/hotspot/cpu/x86/interp_masm_x86.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1997, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -1392,28 +1392,15 @@ void InterpreterMacroAssembler::profile_final_call(Register mdp) {
 
 
 void InterpreterMacroAssembler::profile_virtual_call(Register receiver,
-                                                     Register mdp,
-                                                     bool receiver_can_be_null) {
+                                                     Register mdp) {
   if (ProfileInterpreter) {
     Label profile_continue;
 
     // If no method data exists, go to profile_continue.
     test_method_data_pointer(mdp, profile_continue);
 
-    Label skip_receiver_profile;
-    if (receiver_can_be_null) {
-      Label not_null;
-      testptr(receiver, receiver);
-      jccb(Assembler::notZero, not_null);
-      // We are making a call.  Increment the count for null receiver.
-      increment_mdp_data_at(mdp, in_bytes(CounterData::count_offset()));
-      jmp(skip_receiver_profile);
-      bind(not_null);
-    }
-
     // Record the receiver type.
     profile_receiver_type(receiver, mdp, 0);
-    bind(skip_receiver_profile);
 
     // The method data pointer needs to be updated to reflect the new target.
     update_mdp_by_constant(mdp, in_bytes(VirtualCallData::virtual_call_data_size()));
diff --git a/src/hotspot/cpu/x86/interp_masm_x86.hpp b/src/hotspot/cpu/x86/interp_masm_x86.hpp
index 4114028f78e..dfbd7ab64e0 100644
--- a/src/hotspot/cpu/x86/interp_masm_x86.hpp
+++ b/src/hotspot/cpu/x86/interp_masm_x86.hpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1997, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -243,8 +243,7 @@ class InterpreterMacroAssembler: public MacroAssembler {
   void profile_not_taken_branch(Register mdp);
   void profile_call(Register mdp);
   void profile_final_call(Register mdp);
-  void profile_virtual_call(Register receiver, Register mdp,
-                            bool receiver_can_be_null = false);
+  void profile_virtual_call(Register receiver, Register mdp);
   void profile_ret(Register return_bci, Register mdp);
   void profile_null_seen(Register mdp);
   void profile_typecheck(Register mdp, Register klass);

From 22831cb0d8f828327b49f45e04f2a62ae33754ee Mon Sep 17 00:00:00 2001
From: Kerem Kat <krk@openjdk.org>
Date: Thu, 26 Mar 2026 14:15:11 +0000
Subject: [PATCH 366/655] 8378005: Exclude boxing calls from guaranteed
 safepoint check in loop opts

Reviewed-by: mhaessig, chagedorn
---
 src/hotspot/share/opto/loopnode.cpp           | 16 +++-
 .../TestBoxingInfiniteLoopBrokenIf.java       | 88 +++++++++++++++++++
 ...TestStressLongCountedLoopInfiniteLoop.java | 75 ++++++++++++++++
 3 files changed, 176 insertions(+), 3 deletions(-)
 create mode 100644 test/hotspot/jtreg/compiler/loopopts/TestBoxingInfiniteLoopBrokenIf.java
 create mode 100644 test/hotspot/jtreg/compiler/loopopts/TestStressLongCountedLoopInfiniteLoop.java

diff --git a/src/hotspot/share/opto/loopnode.cpp b/src/hotspot/share/opto/loopnode.cpp
index 686a0a05f66..23186a25320 100644
--- a/src/hotspot/share/opto/loopnode.cpp
+++ b/src/hotspot/share/opto/loopnode.cpp
@@ -4345,8 +4345,13 @@ void IdealLoopTree::allpaths_check_safepts(VectorSet &visited, Node_List &stack)
   visited.set(_head->_idx);
   while (stack.size() > 0) {
     Node* n = stack.pop();
-    if (n->is_Call() && n->as_Call()->guaranteed_safepoint()) {
-      // Terminate this path
+    if (n->is_Call() && n->as_Call()->guaranteed_safepoint()
+        && !(n->is_CallStaticJava() && n->as_CallStaticJava()->is_boxing_method())) {
+      // Terminate this path: guaranteed safepoint found.
+      // Boxing CallStaticJava calls are excluded as they may lack a safepoint on the fast path. This is
+      // not done via CallStaticJavaNode::guaranteed_safepoint() as that also controls PcDesc emission.
+      // In the future, guaranteed_safepoint() should be reworked to correctly handle boxing methods
+      // to avoid this additional check.
     } else if (n->Opcode() == Op_SafePoint) {
       if (_phase->get_loop(n) != this) {
         if (_required_safept == nullptr) _required_safept = new Node_List();
@@ -4444,7 +4449,12 @@ void IdealLoopTree::check_safepts(VectorSet &visited, Node_List &stack) {
     if (!_irreducible) {
       // Scan the dom-path nodes from tail to head
       for (Node* n = tail(); n != _head; n = _phase->idom(n)) {
-        if (n->is_Call() && n->as_Call()->guaranteed_safepoint()) {
+        // Boxing CallStaticJava calls are excluded as they may lack a safepoint on the fast path. This is
+        // not done via CallStaticJavaNode::guaranteed_safepoint() as that also controls PcDesc emission.
+        // In the future, guaranteed_safepoint() should be reworked to correctly handle boxing methods
+        // to avoid this additional check.
+        if (n->is_Call() && n->as_Call()->guaranteed_safepoint()
+            && !(n->is_CallStaticJava() && n->as_CallStaticJava()->is_boxing_method())) {
           has_call = true;
           _has_sfpt = 1;          // Then no need for a safept!
           break;
diff --git a/test/hotspot/jtreg/compiler/loopopts/TestBoxingInfiniteLoopBrokenIf.java b/test/hotspot/jtreg/compiler/loopopts/TestBoxingInfiniteLoopBrokenIf.java
new file mode 100644
index 00000000000..18b4816445b
--- /dev/null
+++ b/test/hotspot/jtreg/compiler/loopopts/TestBoxingInfiniteLoopBrokenIf.java
@@ -0,0 +1,88 @@
+/*
+ * Copyright Amazon.com Inc. or its affiliates. All Rights Reserved.
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+/*
+ * @test
+ * @bug 8378005
+ * @summary Verify that an infinite loop with boxing does not crash when the containing If is broken
+ * @library /test/lib /
+ * @run driver ${test.main.class}
+ */
+
+package compiler.loopopts;
+import compiler.lib.ir_framework.*;
+import jdk.test.lib.Utils;
+
+public class TestBoxingInfiniteLoopBrokenIf {
+    static boolean flag;
+    static volatile boolean testReturned;
+
+    public static void main(String[] args) {
+        TestFramework framework = new TestFramework();
+        framework.addScenarios(
+            new Scenario(0),
+            new Scenario(1, "-XX:PerMethodTrapLimit=0", "-XX:CompileCommand=dontinline,*::valueOf", "-XX:CompileCommand=dontinline,*::throwWrongPath"),
+            new Scenario(2, "-XX:PerMethodTrapLimit=0", "-XX:CompileCommand=dontinline,*::valueOf", "-XX:CompileCommand=dontinline,*::throwWrongPath",
+                            "-XX:+IgnoreUnrecognizedVMOptions", "-XX:StressLongCountedLoop=1")
+        );
+        framework.start();
+    }
+
+    @Test
+    static void test() {
+        new Integer(0); // Enable EA + Loop opts
+
+        if (flag) { // Always false
+            throwWrongPath(); // Not inlined to simplify graph
+        } else {
+            // Infinite loop: j is always 0, Integer.valueOf(0) < 1 is always true.
+            for (int j = 0; Integer.valueOf(j) < 1;) {
+                j = 0;
+            }
+        }
+    }
+
+    @Run(test = "test")
+    @Warmup(0)
+    static void runTest(RunInfo info) {
+        testReturned = false;
+        Thread thread = new Thread(() -> {
+            test();
+            testReturned = true;
+        });
+        thread.setDaemon(true);
+        thread.start();
+        try {
+            Thread.sleep(Utils.adjustTimeout(500));
+        } catch (InterruptedException e) {
+        }
+        if (testReturned) {
+            throw new RuntimeException("test() should not return: infinite loop was incorrectly optimized away");
+        }
+    }
+
+    static void throwWrongPath() {
+        throw new RuntimeException("Wrong path");
+    }
+}
diff --git a/test/hotspot/jtreg/compiler/loopopts/TestStressLongCountedLoopInfiniteLoop.java b/test/hotspot/jtreg/compiler/loopopts/TestStressLongCountedLoopInfiniteLoop.java
new file mode 100644
index 00000000000..81996018a2b
--- /dev/null
+++ b/test/hotspot/jtreg/compiler/loopopts/TestStressLongCountedLoopInfiniteLoop.java
@@ -0,0 +1,75 @@
+/*
+ * Copyright Amazon.com Inc. or its affiliates. All Rights Reserved.
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+/*
+ * @test
+ * @bug 8378005
+ * @summary assert in proj_out when StressLongCountedLoop converts infinite loop to long counted loop nest
+ * @run main ${test.main.class}
+ * @run main/othervm -Xbatch -XX:-TieredCompilation -XX:+IgnoreUnrecognizedVMOptions -XX:StressLongCountedLoop=1
+ *                   -XX:CompileCommand=compileonly,${test.main.class}::test ${test.main.class}
+ */
+
+package compiler.loopopts;
+
+public class TestStressLongCountedLoopInfiniteLoop {
+    static int RANGE;
+
+    public static void main(String[] args) {
+        int[] a = new int[RANGE];
+        for (int i = 0; i < 10000; i++) {
+            try {
+                test(a, 0);
+            } catch (ArrayIndexOutOfBoundsException e) {
+            }
+        }
+    }
+
+    static void test(int[] a, int invar) {
+        // new Integer(0) works too, using MyInteger to avoid deprecation warnings.
+        a[new MyInteger(0).v()] = 0;
+
+        Object o;
+        for (int i = 0; i < 1; i++) {
+            o = 1;
+        }
+
+        // Infinite loop: j is always 0, 0 < 1 is always true.
+        for (int j = 0; Integer.valueOf(j) < 1;) {
+            j = 0;
+        }
+    }
+
+    static class MyInteger {
+        int v;
+
+        MyInteger(int v) {
+            this.v = v;
+        }
+
+        int v() {
+            return Integer.valueOf(v);
+        }
+    }
+}

From 8ecb14cecf1f05ea7c65fcfb5bb05e1e3a895d72 Mon Sep 17 00:00:00 2001
From: Yasumasa Suenaga <ysuenaga@openjdk.org>
Date: Thu, 26 Mar 2026 14:50:56 +0000
Subject: [PATCH 367/655] 8379454: SA still calculates end address with
 incorrect alignment

Reviewed-by: kevinw, cjplummer
---
 src/jdk.hotspot.agent/linux/native/libsaproc/libproc_impl.c | 3 ++-
 1 file changed, 2 insertions(+), 1 deletion(-)

diff --git a/src/jdk.hotspot.agent/linux/native/libsaproc/libproc_impl.c b/src/jdk.hotspot.agent/linux/native/libsaproc/libproc_impl.c
index e2681be73fe..029aac1f107 100644
--- a/src/jdk.hotspot.agent/linux/native/libsaproc/libproc_impl.c
+++ b/src/jdk.hotspot.agent/linux/native/libsaproc/libproc_impl.c
@@ -182,13 +182,14 @@ static bool fill_addr_info(lib_info* lib) {
     return false;
   }
 
+  long page_size = sysconf(_SC_PAGE_SIZE);
   lib->end = (uintptr_t)-1L;
   lib->exec_start = (uintptr_t)-1L;
   lib->exec_end = (uintptr_t)-1L;
   for (ph = phbuf, cnt = 0; cnt < ehdr.e_phnum; cnt++, ph++) {
     if (ph->p_type == PT_LOAD) {
       uintptr_t aligned_start = lib->base + align_down(ph->p_vaddr, ph->p_align);
-      uintptr_t aligned_end = aligned_start + align_up(ph->p_memsz, ph->p_align);
+      uintptr_t aligned_end = aligned_start + align_up(ph->p_memsz, page_size);
       if ((lib->end == (uintptr_t)-1L) || (lib->end < aligned_end)) {
         lib->end = aligned_end;
       }

From 541557ad1d9dfacc63490b5bd30e20455b0332c4 Mon Sep 17 00:00:00 2001
From: Joe Darcy <darcy@openjdk.org>
Date: Thu, 26 Mar 2026 17:19:50 +0000
Subject: [PATCH 368/655] 8380671: Refactor BasicFloat16ArithTests.java

Reviewed-by: bpb
---
 .../vector/BasicFloat16ArithTests.java        | 58 ++++++++++---------
 1 file changed, 30 insertions(+), 28 deletions(-)

diff --git a/test/jdk/jdk/incubator/vector/BasicFloat16ArithTests.java b/test/jdk/jdk/incubator/vector/BasicFloat16ArithTests.java
index 755745394fc..cdc7ce566f7 100644
--- a/test/jdk/jdk/incubator/vector/BasicFloat16ArithTests.java
+++ b/test/jdk/jdk/incubator/vector/BasicFloat16ArithTests.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2016, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2016, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -38,6 +38,8 @@ public class BasicFloat16ArithTests {
     private static float NaNf = Float.NaN;
 
     private static final float MAX_VAL_FP16 = 0x1.ffcp15f;
+    private static final float MIN_NRM_FP16 = 0x1.0p-14f;
+    private static final float MIN_VAL_FP16 = 0x1.0p-24f;
 
     public static void main(String... args) {
         checkBitWise();
@@ -145,9 +147,9 @@ public class BasicFloat16ArithTests {
         checkInt(PRECISION,     11, "Float16.PRECISION");
         checkInt(SIZE,          16, "Float16.SIZE");
 
-        checkFloat16(MIN_VALUE,  0x1.0p-24f, "Float16.MIN_VALUE");
-        checkFloat16(MIN_NORMAL, 0x1.0p-14f, "Float16.MIN_NORMAL");
-        checkFloat16(MAX_VALUE,  65504.0f,  "Float16.MAX_VALUE");
+        checkFloat16(MIN_VALUE,  MIN_VAL_FP16, "Float16.MIN_VALUE");
+        checkFloat16(MIN_NORMAL, MIN_NRM_FP16, "Float16.MIN_NORMAL");
+        checkFloat16(MAX_VALUE,  65504.0f,     "Float16.MAX_VALUE");
 
         checkFloat16(POSITIVE_INFINITY,   InfinityF,  "+infinity");
         checkFloat16(NEGATIVE_INFINITY,  -InfinityF,  "-infinity");
@@ -389,12 +391,12 @@ public class BasicFloat16ArithTests {
             { NaNf,      MAX_EXPONENT + 1},
 
             // Subnormal and almost subnormal values
-            {-0.0f,       MIN_EXPONENT - 1},
-            {+0.0f,       MIN_EXPONENT - 1},
-            { 0x1.0p-24f, MIN_EXPONENT - 1}, // Float16.MIN_VALUE
-            {-0x1.0p-24f, MIN_EXPONENT - 1}, // Float16.MIN_VALUE
-            { 0x1.0p-14f, MIN_EXPONENT},     // Float16.MIN_NORMAL
-            {-0x1.0p-14f, MIN_EXPONENT},     // Float16.MIN_NORMAL
+            {-0.0f,         MIN_EXPONENT - 1},
+            {+0.0f,         MIN_EXPONENT - 1},
+            { MIN_VAL_FP16, MIN_EXPONENT - 1},
+            {-MIN_VAL_FP16, MIN_EXPONENT - 1},
+            { MIN_NRM_FP16, MIN_EXPONENT},
+            {-MIN_NRM_FP16, MIN_EXPONENT},
 
             // Normal values
             { 1.0f,       0},
@@ -424,17 +426,17 @@ public class BasicFloat16ArithTests {
             { NaNf,      NaNf},
 
             // Zeros, subnormals, and MIN_VALUE all have MIN_VALUE as an ulp.
-            {-0.0f,       0x1.0p-24f},
-            {+0.0f,       0x1.0p-24f},
-            { 0x1.0p-24f, 0x1.0p-24f},
-            {-0x1.0p-24f, 0x1.0p-24f},
-            { 0x1.0p-14f, 0x1.0p-24f},
-            {-0x1.0p-14f, 0x1.0p-24f},
+            {-0.0f,         MIN_VAL_FP16},
+            {+0.0f,         MIN_VAL_FP16},
+            { MIN_VAL_FP16, MIN_VAL_FP16},
+            {-MIN_VAL_FP16, MIN_VAL_FP16},
+            { MIN_NRM_FP16, MIN_VAL_FP16},
+            {-MIN_NRM_FP16, MIN_VAL_FP16},
 
-            // ulp is 10 bits away
-            {0x1.0p0f,       0x0.004p0f}, // 1.0f
-            {0x1.0p1f,       0x0.004p1f}, // 2.0f
-            {0x1.0p2f,       0x0.004p2f}, // 4.0f
+            // ulp is (PRECISION - 1) = 10 bits away
+            {0x1.0p0f,       0x1.0p-10f}, // 1.0f
+            {0x1.0p1f,       0x1.0p-9f},  // 2.0f
+            {0x1.0p2f,       0x1.0p-8f},  // 4.0f
 
             {MAX_VAL_FP16*0.5f, 0x0.004p14f},
             {MAX_VAL_FP16,      0x0.004p15f},
@@ -507,12 +509,12 @@ public class BasicFloat16ArithTests {
     }
 
     private static void checkValueOfLong() {
-        checkFloat16(valueOf(-65_521),  Float.NEGATIVE_INFINITY, "-infinity");
-        checkFloat16(valueOf(-65_520),  Float.NEGATIVE_INFINITY, "-infinity");
-        checkFloat16(valueOf(-65_519), -MAX_VALUE.floatValue(), "-MAX_VALUE");
-        checkFloat16(valueOf(65_519),   MAX_VALUE.floatValue(), "MAX_VALUE");
-        checkFloat16(valueOf(65_520),   Float.POSITIVE_INFINITY, "+infinity");
-        checkFloat16(valueOf(65_521),   Float.POSITIVE_INFINITY, "+infinity");
+        checkFloat16(valueOf(-65_521),  Float.NEGATIVE_INFINITY, "-65_521");
+        checkFloat16(valueOf(-65_520),  Float.NEGATIVE_INFINITY, "-65_520");
+        checkFloat16(valueOf(-65_519), -MAX_VALUE.floatValue(),  "-65_519");
+        checkFloat16(valueOf( 65_519),  MAX_VALUE.floatValue(),   "65_519");
+        checkFloat16(valueOf( 65_520),  Float.POSITIVE_INFINITY,  "65_520");
+        checkFloat16(valueOf( 65_521),  Float.POSITIVE_INFINITY,  "65_521");
     }
 
     private static void checkValueOfString() {
@@ -792,7 +794,7 @@ public class BasicFloat16ArithTests {
                 // threshold; subtracting a non-zero finite value will
                 // result in MAX_VALUE, adding zero or a positive
                 // value will overflow.
-                {0x1.2p10f, 0x1.c7p5f, -0x1.0p-14f,
+                {0x1.2p10f, 0x1.c7p5f, -MIN_NRM_FP16,
                  MAX_VAL_FP16},
 
                 {0x1.2p10f, 0x1.c7p5f, -0.0f,
@@ -801,7 +803,7 @@ public class BasicFloat16ArithTests {
                 {0x1.2p10f, 0x1.c7p5f, +0.0f,
                  InfinityF},
 
-                {0x1.2p10f, 0x1.c7p5f, +0x1.0p-14f,
+                {0x1.2p10f, 0x1.c7p5f, +MIN_NRM_FP16,
                  InfinityF},
 
                 {0x1.2p10f, 0x1.c7p5f, InfinityF,

From aecc16358f5f1f6fa5cb78522d6db70430b79987 Mon Sep 17 00:00:00 2001
From: Naoto Sato <naoto@openjdk.org>
Date: Thu, 26 Mar 2026 17:53:53 +0000
Subject: [PATCH 369/655] 8230421: Java cannot handle Euro sign at the
 Simplified Chinese Windows Command Prompt

Reviewed-by: sherman
---
 .../windows/native/libjava/java_props_md.c    | 67 +++++++++----------
 1 file changed, 32 insertions(+), 35 deletions(-)

diff --git a/src/java.base/windows/native/libjava/java_props_md.c b/src/java.base/windows/native/libjava/java_props_md.c
index e152dbe9bef..6504891af34 100644
--- a/src/java.base/windows/native/libjava/java_props_md.c
+++ b/src/java.base/windows/native/libjava/java_props_md.c
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1998, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1998, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -74,43 +74,32 @@ getEncodingInternal(LCID lcid)
     case 65001:
         strcpy(ret, "UTF-8");
         break;
-    case 874:     /*  9:Thai     */
-    case 932:     /* 10:Japanese */
-    case 949:     /* 12:Korean Extended Wansung */
-    case 950:     /* 13:Chinese (Taiwan, Hongkong, Macau) */
-    case 1361:    /* 15:Korean Johab */
+    case 874:     /* Thai     */
+    case 932:     /* Japanese */
+    case 936:     /* Chinese (Simplified) */
+    case 949:     /* Korean Extended Wansung */
+    case 950:     /* Chinese (Taiwan, Hongkong, Macau) */
+    case 1361:    /* Korean Johab */
         ret[0] = 'M';
         ret[1] = 'S';
-        break;
-    case 936:
-        strcpy(ret, "GBK");
-        break;
-    case 54936:
-        strcpy(ret, "GB18030");
-        break;
-    default:
-        ret[0] = 'C';
-        ret[1] = 'p';
-        break;
-    }
 
-    //Traditional Chinese Windows should use MS950_HKSCS_XP as the
-    //default encoding, if HKSCS patch has been installed.
-    // "old" MS950 0xfa41 -> u+e001
-    // "new" MS950 0xfa41 -> u+92db
-    if (strcmp(ret, "MS950") == 0) {
-        TCHAR  mbChar[2] = {(char)0xfa, (char)0x41};
-        WCHAR  unicodeChar;
-        MultiByteToWideChar(CP_ACP, 0, mbChar, 2, &unicodeChar, 1);
-        if (unicodeChar == 0x92db) {
-            strcpy(ret, "MS950_HKSCS_XP");
-        }
-    } else {
-        //SimpChinese Windows should use GB18030 as the default
-        //encoding, if gb18030 patch has been installed (on windows
-        //2000/XP, (1)Codepage 54936 will be available
-        //(2)simsun18030.ttc will exist under system fonts dir )
-        if (strcmp(ret, "GBK") == 0 && IsValidCodePage(54936)) {
+        // Special handling for Chinese
+        if (codepage == 950) {
+            //Traditional Chinese Windows should use MS950_HKSCS_XP as the
+            //default encoding, if HKSCS patch has been installed.
+            // "old" MS950 0xfa41 -> u+e001
+            // "new" MS950 0xfa41 -> u+92db
+            TCHAR  mbChar[2] = {(char)0xfa, (char)0x41};
+            WCHAR  unicodeChar;
+            MultiByteToWideChar(CP_ACP, 0, mbChar, 2, &unicodeChar, 1);
+            if (unicodeChar == 0x92db) {
+                strcpy(ret, "MS950_HKSCS_XP");
+            }
+        } else if (codepage == 936 && IsValidCodePage(54936)) {
+            //SimpChinese Windows should use GB18030 as the default
+            //encoding, if gb18030 patch has been installed (on windows
+            //2000/XP, (1)Codepage 54936 will be available
+            //(2)simsun18030.ttc will exist under system fonts dir )
             char systemPath[MAX_PATH + 1];
             char* gb18030Font = "\\FONTS\\SimSun18030.ttc";
             FILE *f = NULL;
@@ -123,6 +112,14 @@ getEncodingInternal(LCID lcid)
                 }
             }
         }
+        break;
+    case 54936:
+        strcpy(ret, "GB18030");
+        break;
+    default:
+        ret[0] = 'C';
+        ret[1] = 'p';
+        break;
     }
 
     return ret;

From 72176305ae24e4e0c8f6541b229c16cae81e4775 Mon Sep 17 00:00:00 2001
From: Leo Korinth <lkorinth@openjdk.org>
Date: Thu, 26 Mar 2026 18:16:17 +0000
Subject: [PATCH 370/655] 8379346: Cleanup casts and implicit conversions to
 boolean

Reviewed-by: stefank, dholmes, ayang
---
 src/hotspot/os/linux/hugepages.cpp | 4 ++--
 src/hotspot/os/linux/os_linux.cpp  | 8 ++++----
 2 files changed, 6 insertions(+), 6 deletions(-)

diff --git a/src/hotspot/os/linux/hugepages.cpp b/src/hotspot/os/linux/hugepages.cpp
index 1340c470dff..213845c7134 100644
--- a/src/hotspot/os/linux/hugepages.cpp
+++ b/src/hotspot/os/linux/hugepages.cpp
@@ -68,7 +68,7 @@ static size_t scan_default_hugepagesize() {
   // format has been changed), we'll set largest page size to 0
 
   FILE *fp = os::fopen("/proc/meminfo", "r");
-  if (fp) {
+  if (fp != nullptr) {
     while (!feof(fp)) {
       int x = 0;
       char buf[16];
@@ -81,7 +81,7 @@ static size_t scan_default_hugepagesize() {
         // skip to next line
         for (;;) {
           int ch = fgetc(fp);
-          if (ch == EOF || ch == (int)'\n') break;
+          if (ch == EOF || ch == '\n') break;
         }
       }
     }
diff --git a/src/hotspot/os/linux/os_linux.cpp b/src/hotspot/os/linux/os_linux.cpp
index c79b0ab9fb5..bf096897aa7 100644
--- a/src/hotspot/os/linux/os_linux.cpp
+++ b/src/hotspot/os/linux/os_linux.cpp
@@ -1313,7 +1313,7 @@ bool os::is_primordial_thread(void) {
 // Find the virtual memory area that contains addr
 static bool find_vma(address addr, address* vma_low, address* vma_high) {
   FILE *fp = os::fopen("/proc/self/maps", "r");
-  if (fp) {
+  if (fp != nullptr) {
     address low, high;
     while (!feof(fp)) {
       if (fscanf(fp, "%p-%p", &low, &high) == 2) {
@@ -1326,7 +1326,7 @@ static bool find_vma(address addr, address* vma_low, address* vma_high) {
       }
       for (;;) {
         int ch = fgetc(fp);
-        if (ch == EOF || ch == (int)'\n') break;
+        if (ch == EOF || ch == '\n') break;
       }
     }
     fclose(fp);
@@ -4384,7 +4384,7 @@ int os::Linux::get_namespace_pid(int vmid) {
   os::snprintf_checked(fname, sizeof(fname), "/proc/%d/status", vmid);
   FILE *fp = os::fopen(fname, "r");
 
-  if (fp) {
+  if (fp != nullptr) {
     int pid, nspid;
     int ret;
     while (!feof(fp) && !ferror(fp)) {
@@ -4398,7 +4398,7 @@ int os::Linux::get_namespace_pid(int vmid) {
       }
       for (;;) {
         int ch = fgetc(fp);
-        if (ch == EOF || ch == (int)'\n') break;
+        if (ch == EOF || ch == '\n') break;
       }
     }
     fclose(fp);

From c5c5340b521151b9dac44cc72899ef31c2d812cb Mon Sep 17 00:00:00 2001
From: Leo Korinth <lkorinth@openjdk.org>
Date: Thu, 26 Mar 2026 18:37:45 +0000
Subject: [PATCH 371/655] 8379224: Always use zero as invalid page size

Reviewed-by: stefank, ayang
---
 src/hotspot/os/linux/hugepages.cpp | 5 ++---
 1 file changed, 2 insertions(+), 3 deletions(-)

diff --git a/src/hotspot/os/linux/hugepages.cpp b/src/hotspot/os/linux/hugepages.cpp
index 213845c7134..b065f7b1496 100644
--- a/src/hotspot/os/linux/hugepages.cpp
+++ b/src/hotspot/os/linux/hugepages.cpp
@@ -35,7 +35,7 @@
 #include <dirent.h>
 
 ExplicitHugePageSupport::ExplicitHugePageSupport() :
-  _initialized{false}, _os_supported{}, _pre_allocated{}, _default_hugepage_size{SIZE_MAX}, _inconsistent{false} {}
+  _initialized{false}, _os_supported{}, _pre_allocated{}, _default_hugepage_size{0}, _inconsistent{false} {}
 
 os::PageSizes ExplicitHugePageSupport::os_supported() const {
   assert(_initialized, "Not initialized");
@@ -187,7 +187,7 @@ void ExplicitHugePageSupport::scan_os() {
 }
 
 THPSupport::THPSupport() :
-    _initialized(false), _mode(THPMode::never), _pagesize(SIZE_MAX) {}
+    _initialized{false}, _mode{THPMode::never}, _pagesize{0} {}
 
 
 THPMode THPSupport::mode() const {
@@ -221,7 +221,6 @@ void THPSupport::scan_os() {
   }
 
   // Scan large page size for THP from hpage_pmd_size
-  _pagesize = 0;
   if (read_number_file("/sys/kernel/mm/transparent_hugepage/hpage_pmd_size", &_pagesize)) {
     assert(_pagesize > 0, "Expected");
   }

From 40d65f1063a27b081b4c074b04192eb2fcf5dd6a Mon Sep 17 00:00:00 2001
From: Brian Burkhalter <bpb@openjdk.org>
Date: Thu, 26 Mar 2026 18:38:04 +0000
Subject: [PATCH 372/655] 8379583: (fs) Files.copy use of posix_fadvise is
 problematic on Linux

Reviewed-by: alanb
---
 .../classes/sun/nio/fs/LinuxFileSystem.java   | 12 +---
 .../sun/nio/fs/UnixConstants.java.template    |  4 +-
 .../bench/java/nio/file/FilesCopy.java        | 68 +++++++++++++++++++
 3 files changed, 72 insertions(+), 12 deletions(-)
 create mode 100644 test/micro/org/openjdk/bench/java/nio/file/FilesCopy.java

diff --git a/src/java.base/linux/classes/sun/nio/fs/LinuxFileSystem.java b/src/java.base/linux/classes/sun/nio/fs/LinuxFileSystem.java
index 44e957f54fb..ec3e135b8b1 100644
--- a/src/java.base/linux/classes/sun/nio/fs/LinuxFileSystem.java
+++ b/src/java.base/linux/classes/sun/nio/fs/LinuxFileSystem.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2008, 2022, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2008, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -139,10 +139,7 @@ class LinuxFileSystem extends UnixFileSystem {
                       int size, long addressToPollForCancel)
         throws UnixException
     {
-        int advice = POSIX_FADV_SEQUENTIAL | // sequential data access
-                     POSIX_FADV_NOREUSE    | // will access only once
-                     POSIX_FADV_WILLNEED;    // will access in near future
-        posix_fadvise(src, 0, 0, advice);
+        posix_fadvise(src, 0, 0, POSIX_FADV_SEQUENTIAL);
 
         super.bufferedCopy(dst, src, address, size, addressToPollForCancel);
     }
@@ -151,10 +148,7 @@ class LinuxFileSystem extends UnixFileSystem {
     int directCopy(int dst, int src, long addressToPollForCancel)
         throws UnixException
     {
-        int advice = POSIX_FADV_SEQUENTIAL | // sequential data access
-                     POSIX_FADV_NOREUSE    | // will access only once
-                     POSIX_FADV_WILLNEED;    // will access in near future
-        posix_fadvise(src, 0, 0, advice);
+        posix_fadvise(src, 0, 0, POSIX_FADV_SEQUENTIAL);
 
         return directCopy0(dst, src, addressToPollForCancel);
     }
diff --git a/src/java.base/unix/classes/sun/nio/fs/UnixConstants.java.template b/src/java.base/unix/classes/sun/nio/fs/UnixConstants.java.template
index 6823833582f..7a9a22ac40d 100644
--- a/src/java.base/unix/classes/sun/nio/fs/UnixConstants.java.template
+++ b/src/java.base/unix/classes/sun/nio/fs/UnixConstants.java.template
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2008, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2008, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -173,7 +173,5 @@ class UnixConstants {
 #ifdef __linux__
     // advice flags used with posix_fadvise(2)
     static final int PREFIX_POSIX_FADV_SEQUENTIAL = POSIX_FADV_SEQUENTIAL;
-    static final int PREFIX_POSIX_FADV_NOREUSE    = POSIX_FADV_NOREUSE;
-    static final int PREFIX_POSIX_FADV_WILLNEED   = POSIX_FADV_WILLNEED;
 #endif
 }
diff --git a/test/micro/org/openjdk/bench/java/nio/file/FilesCopy.java b/test/micro/org/openjdk/bench/java/nio/file/FilesCopy.java
new file mode 100644
index 00000000000..9472920f071
--- /dev/null
+++ b/test/micro/org/openjdk/bench/java/nio/file/FilesCopy.java
@@ -0,0 +1,68 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+package org.openjdk.bench.java.nio.file;
+
+import java.io.IOException;
+import java.nio.ByteBuffer;
+import java.nio.channels.FileChannel;
+import java.nio.file.Files;
+import java.nio.file.Path;
+import static java.nio.file.StandardOpenOption.*;
+
+import org.openjdk.jmh.annotations.Benchmark;
+import org.openjdk.jmh.annotations.Scope;
+import org.openjdk.jmh.annotations.Setup;
+import org.openjdk.jmh.annotations.State;
+import org.openjdk.jmh.annotations.TearDown;
+
+@State(Scope.Benchmark)
+public class FilesCopy {
+
+    private static final int SIZE = Integer.MAX_VALUE;
+    private static final Path FILE = Path.of("file.dat");
+    private static final Path COPY = Path.of("copy.dat");
+
+    @Setup
+    public void init() throws IOException {
+        Files.deleteIfExists(FILE);
+        Files.deleteIfExists(COPY);
+        try (FileChannel fc = FileChannel.open(FILE, CREATE_NEW, READ, WRITE)) {
+            fc.position(SIZE);
+            fc.write(ByteBuffer.wrap(new byte[] {(byte)27}));
+        }
+    }
+
+    @TearDown
+    public void cleanup() throws IOException {
+        Files.deleteIfExists(FILE);
+        Files.deleteIfExists(COPY);
+    }
+
+    @Benchmark
+    public void copyFile() throws IOException {
+        Files.copy(FILE, COPY);
+        Files.delete(COPY);
+    }
+
+}

From 68c48290d63675d82f2e9e60241031de023c280f Mon Sep 17 00:00:00 2001
From: Kelvin Nilsen <kdnilsen@openjdk.org>
Date: Thu, 26 Mar 2026 20:04:13 +0000
Subject: [PATCH 373/655] 8380459: Shenandoah: Do not reset
 bytes-allocated-since-gc-start when degenerating

Reviewed-by: wkemper
---
 src/hotspot/share/gc/shenandoah/shenandoahControlThread.cpp  | 5 ++++-
 .../gc/shenandoah/shenandoahGenerationalControlThread.cpp    | 3 ++-
 2 files changed, 6 insertions(+), 2 deletions(-)

diff --git a/src/hotspot/share/gc/shenandoah/shenandoahControlThread.cpp b/src/hotspot/share/gc/shenandoah/shenandoahControlThread.cpp
index 48183507124..4c6e82c86a5 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahControlThread.cpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahControlThread.cpp
@@ -138,7 +138,10 @@ void ShenandoahControlThread::run_service() {
 
       heuristics->cancel_trigger_request();
 
-      heap->reset_bytes_allocated_since_gc_start();
+      if (mode != stw_degenerated) {
+        // If mode is stw_degenerated, count bytes allocated from the start of the conc GC that experienced alloc failure.
+        heap->reset_bytes_allocated_since_gc_start();
+      }
 
       MetaspaceCombinedStats meta_sizes = MetaspaceUtils::get_combined_statistics();
 
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahGenerationalControlThread.cpp b/src/hotspot/share/gc/shenandoah/shenandoahGenerationalControlThread.cpp
index 67cc4d2f703..ec33e671053 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahGenerationalControlThread.cpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahGenerationalControlThread.cpp
@@ -255,7 +255,8 @@ void ShenandoahGenerationalControlThread::run_gc_cycle(const ShenandoahGCRequest
 
   GCIdMark gc_id_mark;
 
-  if (gc_mode() != servicing_old) {
+  if ((gc_mode() != servicing_old) && (gc_mode() != stw_degenerated)) {
+    // If mode is stw_degenerated, count bytes allocated from the start of the conc GC that experienced alloc failure.
     _heap->reset_bytes_allocated_since_gc_start();
   }
 

From 91892948ee0ac3c62bbddbbf9e6f99e746f3d72f Mon Sep 17 00:00:00 2001
From: Damon Nguyen <dnguyen@openjdk.org>
Date: Thu, 26 Mar 2026 20:21:19 +0000
Subject: [PATCH 374/655] 8380229: 2 Impossible or redundant condition defect
 groups in 2 files

Reviewed-by: honkar, prr
---
 .../share/native/libharfbuzz/hb-aat-layout-common.hh           | 3 +--
 .../share/native/libharfbuzz/hb-ot-layout-common.hh            | 2 +-
 2 files changed, 2 insertions(+), 3 deletions(-)

diff --git a/src/java.desktop/share/native/libharfbuzz/hb-aat-layout-common.hh b/src/java.desktop/share/native/libharfbuzz/hb-aat-layout-common.hh
index d2ce32616be..4bb41fd0189 100644
--- a/src/java.desktop/share/native/libharfbuzz/hb-aat-layout-common.hh
+++ b/src/java.desktop/share/native/libharfbuzz/hb-aat-layout-common.hh
@@ -1266,8 +1266,7 @@ struct StateTableDriver
                                   next_state == StateTableT::STATE_START_OF_TEXT &&
                                   start_state_safe_to_break_eot &&
                                   is_not_actionable &&
-                                  is_not_epsilon_transition &&
-                                  !last_range;
+                                  is_not_epsilon_transition;
 
         if (is_null_transition)
         {
diff --git a/src/java.desktop/share/native/libharfbuzz/hb-ot-layout-common.hh b/src/java.desktop/share/native/libharfbuzz/hb-ot-layout-common.hh
index dcacc9cb86c..6b62732bf54 100644
--- a/src/java.desktop/share/native/libharfbuzz/hb-ot-layout-common.hh
+++ b/src/java.desktop/share/native/libharfbuzz/hb-ot-layout-common.hh
@@ -2480,7 +2480,7 @@ struct VarRegionAxis
     /* TODO Move these to sanitize(). */
     if (unlikely (start > peak || peak > end))
       return 1.f;
-    if (unlikely (start < 0 && end > 0 && peak != 0))
+    if (unlikely (start < 0 && end > 0))
       return 1.f;
 
     if (coord <= start || end <= coord)

From 4d2623757fbe8c9fa8c22817a993ca85a2403873 Mon Sep 17 00:00:00 2001
From: Sergey Bylokhov <serb@openjdk.org>
Date: Thu, 26 Mar 2026 20:59:45 +0000
Subject: [PATCH 375/655] 8359433: The final modifier on Windows L&F internal
 UI classes prevents extending them in apps

Reviewed-by: prr, aivanov
---
 .../java/swing/plaf/windows/WindowsBorders.java    |  8 ++++----
 .../java/swing/plaf/windows/WindowsButtonUI.java   |  2 +-
 .../plaf/windows/WindowsCheckBoxMenuItemUI.java    |  4 ++--
 .../java/swing/plaf/windows/WindowsCheckBoxUI.java |  2 +-
 .../plaf/windows/WindowsClassicLookAndFeel.java    |  4 ++--
 .../java/swing/plaf/windows/WindowsComboBoxUI.java | 10 +++++-----
 .../swing/plaf/windows/WindowsDesktopIconUI.java   |  4 ++--
 .../swing/plaf/windows/WindowsDesktopManager.java  |  4 ++--
 .../swing/plaf/windows/WindowsDesktopPaneUI.java   |  4 ++--
 .../swing/plaf/windows/WindowsEditorPaneUI.java    |  4 ++--
 .../swing/plaf/windows/WindowsFileChooserUI.java   | 14 +++++++-------
 .../windows/WindowsInternalFrameTitlePane.java     |  8 ++++----
 .../swing/plaf/windows/WindowsInternalFrameUI.java |  4 ++--
 .../java/swing/plaf/windows/WindowsLabelUI.java    |  2 +-
 .../java/swing/plaf/windows/WindowsMenuBarUI.java  |  4 ++--
 .../java/swing/plaf/windows/WindowsMenuItemUI.java |  2 +-
 .../sun/java/swing/plaf/windows/WindowsMenuUI.java |  6 +++---
 .../swing/plaf/windows/WindowsOptionPaneUI.java    |  4 ++--
 .../swing/plaf/windows/WindowsPasswordFieldUI.java |  4 ++--
 .../plaf/windows/WindowsPopupMenuSeparatorUI.java  |  4 ++--
 .../swing/plaf/windows/WindowsPopupMenuUI.java     |  4 ++--
 .../swing/plaf/windows/WindowsProgressBarUI.java   |  4 ++--
 .../plaf/windows/WindowsRadioButtonMenuItemUI.java |  4 ++--
 .../java/swing/plaf/windows/WindowsRootPaneUI.java |  4 ++--
 .../swing/plaf/windows/WindowsScrollBarUI.java     |  4 ++--
 .../swing/plaf/windows/WindowsScrollPaneUI.java    |  4 ++--
 .../swing/plaf/windows/WindowsSeparatorUI.java     |  4 ++--
 .../java/swing/plaf/windows/WindowsSliderUI.java   |  4 ++--
 .../java/swing/plaf/windows/WindowsSpinnerUI.java  |  4 ++--
 .../plaf/windows/WindowsSplitPaneDivider.java      |  4 ++--
 .../swing/plaf/windows/WindowsSplitPaneUI.java     |  4 ++--
 .../swing/plaf/windows/WindowsTabbedPaneUI.java    |  4 ++--
 .../swing/plaf/windows/WindowsTableHeaderUI.java   |  4 ++--
 .../java/swing/plaf/windows/WindowsTextAreaUI.java |  4 ++--
 .../swing/plaf/windows/WindowsTextFieldUI.java     |  4 ++--
 .../java/swing/plaf/windows/WindowsTextPaneUI.java |  4 ++--
 .../swing/plaf/windows/WindowsToggleButtonUI.java  |  2 +-
 .../plaf/windows/WindowsToolBarSeparatorUI.java    |  4 ++--
 .../java/swing/plaf/windows/WindowsToolBarUI.java  |  4 ++--
 .../sun/java/swing/plaf/windows/WindowsTreeUI.java |  6 +++---
 test/jdk/javax/swing/plaf/windows/bug4991587.java  |  4 ++--
 41 files changed, 91 insertions(+), 91 deletions(-)

diff --git a/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsBorders.java b/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsBorders.java
index 81766db8116..572e9e8c117 100644
--- a/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsBorders.java
+++ b/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsBorders.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1998, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1998, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -115,7 +115,7 @@ public final class WindowsBorders {
     }
 
     @SuppressWarnings("serial") // Superclass is not serializable across versions
-    public static final class ProgressBarBorder extends AbstractBorder implements UIResource {
+    public static class ProgressBarBorder extends AbstractBorder implements UIResource {
         protected Color shadow;
         protected Color highlight;
 
@@ -148,7 +148,7 @@ public final class WindowsBorders {
      * @since 1.4
      */
     @SuppressWarnings("serial") // Superclass is not serializable across versions
-    public static final class ToolBarBorder extends AbstractBorder implements UIResource, SwingConstants {
+    public static class ToolBarBorder extends AbstractBorder implements UIResource, SwingConstants {
         protected Color shadow;
         protected Color highlight;
 
@@ -308,7 +308,7 @@ public final class WindowsBorders {
      * @since 1.4
      */
     @SuppressWarnings("serial") // Superclass is not serializable across versions
-    public static final class InternalFrameLineBorder extends LineBorder implements
+    public static class InternalFrameLineBorder extends LineBorder implements
             UIResource {
         protected Color activeColor;
         protected Color inactiveColor;
diff --git a/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsButtonUI.java b/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsButtonUI.java
index ee07276aa30..63e99e0804a 100644
--- a/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsButtonUI.java
+++ b/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsButtonUI.java
@@ -56,7 +56,7 @@ import static com.sun.java.swing.plaf.windows.XPStyle.Skin;
  *
  * @author Jeff Dinkins
  */
-public final class WindowsButtonUI extends BasicButtonUI
+public class WindowsButtonUI extends BasicButtonUI
 {
     protected int dashedRectGapX;
     protected int dashedRectGapY;
diff --git a/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsCheckBoxMenuItemUI.java b/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsCheckBoxMenuItemUI.java
index 3a2578b3e0b..47e311486ba 100644
--- a/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsCheckBoxMenuItemUI.java
+++ b/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsCheckBoxMenuItemUI.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1997, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -42,7 +42,7 @@ import com.sun.java.swing.plaf.windows.TMSchema.State;
 /**
  * Windows check box menu item.
  */
-public final class WindowsCheckBoxMenuItemUI extends BasicCheckBoxMenuItemUI {
+public class WindowsCheckBoxMenuItemUI extends BasicCheckBoxMenuItemUI {
 
     final WindowsMenuItemUIAccessor accessor =
         new WindowsMenuItemUIAccessor() {
diff --git a/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsCheckBoxUI.java b/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsCheckBoxUI.java
index 7cb2490fd76..d264393f4d8 100644
--- a/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsCheckBoxUI.java
+++ b/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsCheckBoxUI.java
@@ -35,7 +35,7 @@ import javax.swing.plaf.ComponentUI;
  *
  * @author Jeff Dinkins
  */
-public final class WindowsCheckBoxUI extends WindowsRadioButtonUI
+public class WindowsCheckBoxUI extends WindowsRadioButtonUI
 {
     // NOTE: WindowsCheckBoxUI inherits from WindowsRadioButtonUI instead
     // of BasicCheckBoxUI because we want to pick up all the
diff --git a/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsClassicLookAndFeel.java b/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsClassicLookAndFeel.java
index 5716a875cd7..802b5f66888 100644
--- a/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsClassicLookAndFeel.java
+++ b/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsClassicLookAndFeel.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -31,7 +31,7 @@ package com.sun.java.swing.plaf.windows;
  * @since 1.5
  */
 @SuppressWarnings("serial") // Superclass is not serializable across versions
-public final class WindowsClassicLookAndFeel extends WindowsLookAndFeel {
+public class WindowsClassicLookAndFeel extends WindowsLookAndFeel {
     @Override
     public String getName() {
         return "Windows Classic";
diff --git a/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsComboBoxUI.java b/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsComboBoxUI.java
index fdc9b03ae7d..8717fd715ea 100644
--- a/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsComboBoxUI.java
+++ b/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsComboBoxUI.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1997, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -75,7 +75,7 @@ import static com.sun.java.swing.plaf.windows.XPStyle.Skin;
  * @author Tom Santos
  * @author Igor Kushnirskiy
  */
-public final class WindowsComboBoxUI extends BasicComboBoxUI {
+public class WindowsComboBoxUI extends BasicComboBoxUI {
 
     private static final MouseListener rolloverListener =
         new MouseAdapter() {
@@ -532,7 +532,7 @@ public final class WindowsComboBoxUI extends BasicComboBoxUI {
     }
 
     @SuppressWarnings("serial") // Same-version serialization only
-    protected final class WinComboPopUp extends BasicComboPopup {
+    protected class WinComboPopUp extends BasicComboPopup {
         private Skin listBoxBorder = null;
         private XPStyle xp;
 
@@ -550,7 +550,7 @@ public final class WindowsComboBoxUI extends BasicComboBoxUI {
             return new InvocationKeyHandler();
         }
 
-        protected final class InvocationKeyHandler extends BasicComboPopup.InvocationKeyHandler {
+        protected class InvocationKeyHandler extends BasicComboPopup.InvocationKeyHandler {
             protected InvocationKeyHandler() {
                 WinComboPopUp.this.super();
             }
@@ -570,7 +570,7 @@ public final class WindowsComboBoxUI extends BasicComboBoxUI {
     /**
      * Subclassed to highlight selected item in an editable combo box.
      */
-    public static final class WindowsComboBoxEditor
+    public static class WindowsComboBoxEditor
         extends BasicComboBoxEditor.UIResource {
 
         /**
diff --git a/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsDesktopIconUI.java b/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsDesktopIconUI.java
index 47ecdf5747b..2cebb050396 100644
--- a/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsDesktopIconUI.java
+++ b/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsDesktopIconUI.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1997, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -36,7 +36,7 @@ import javax.swing.plaf.basic.BasicDesktopIconUI;
 /**
  * Windows icon for a minimized window on the desktop.
  */
-public final class WindowsDesktopIconUI extends BasicDesktopIconUI {
+public class WindowsDesktopIconUI extends BasicDesktopIconUI {
     private int width;
 
     public static ComponentUI createUI(JComponent c) {
diff --git a/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsDesktopManager.java b/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsDesktopManager.java
index 79d81bad089..ae081a7690c 100644
--- a/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsDesktopManager.java
+++ b/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsDesktopManager.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1998, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1998, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -52,7 +52,7 @@ import java.lang.ref.WeakReference;
  * @author Thomas Ball
  */
 @SuppressWarnings("serial") // JDK-implementation class
-public final class WindowsDesktopManager extends DefaultDesktopManager
+public class WindowsDesktopManager extends DefaultDesktopManager
         implements java.io.Serializable, javax.swing.plaf.UIResource {
 
     /* The frame which is currently selected/activated.
diff --git a/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsDesktopPaneUI.java b/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsDesktopPaneUI.java
index dabbe3fb992..4a3f0ec38b1 100644
--- a/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsDesktopPaneUI.java
+++ b/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsDesktopPaneUI.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1997, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -34,7 +34,7 @@ import javax.swing.plaf.basic.BasicDesktopPaneUI;
  *
  * @author David Kloba
  */
-public final class WindowsDesktopPaneUI extends BasicDesktopPaneUI
+public class WindowsDesktopPaneUI extends BasicDesktopPaneUI
 {
     public static ComponentUI createUI(JComponent c) {
         return new WindowsDesktopPaneUI();
diff --git a/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsEditorPaneUI.java b/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsEditorPaneUI.java
index 44cb0e9634c..ea21b41c619 100644
--- a/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsEditorPaneUI.java
+++ b/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsEditorPaneUI.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1997, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -33,7 +33,7 @@ import javax.swing.text.Caret;
 /**
  * Windows rendition of the component.
  */
-public final class WindowsEditorPaneUI extends BasicEditorPaneUI
+public class WindowsEditorPaneUI extends BasicEditorPaneUI
 {
 
     /**
diff --git a/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsFileChooserUI.java b/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsFileChooserUI.java
index 08c01760be9..86c40ea70d6 100644
--- a/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsFileChooserUI.java
+++ b/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsFileChooserUI.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1997, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -101,7 +101,7 @@ import sun.swing.WindowsPlacesBar;
  *
  * @author Jeff Dinkins
  */
-public final class WindowsFileChooserUI extends BasicFileChooserUI {
+public class WindowsFileChooserUI extends BasicFileChooserUI {
 
     // The following are private because the implementation of the
     // Windows FileChooser L&F is not complete yet.
@@ -1122,7 +1122,7 @@ public final class WindowsFileChooserUI extends BasicFileChooserUI {
      * Data model for a type-face selection combo-box.
      */
     @SuppressWarnings("serial") // Superclass is not serializable across versions
-    protected final class DirectoryComboBoxModel extends AbstractListModel<File> implements ComboBoxModel<File> {
+    protected class DirectoryComboBoxModel extends AbstractListModel<File> implements ComboBoxModel<File> {
         Vector<File> directories = new Vector<File>();
         int[] depths = null;
         File selectedDirectory = null;
@@ -1252,7 +1252,7 @@ public final class WindowsFileChooserUI extends BasicFileChooserUI {
      * Render different type sizes and styles.
      */
     @SuppressWarnings("serial") // Superclass is not serializable across versions
-    public final class FilterComboBoxRenderer extends DefaultListCellRenderer {
+    public class FilterComboBoxRenderer extends DefaultListCellRenderer {
         @Override
         public Component getListCellRendererComponent(JList<?> list,
             Object value, int index, boolean isSelected,
@@ -1279,7 +1279,7 @@ public final class WindowsFileChooserUI extends BasicFileChooserUI {
      * Data model for a type-face selection combo-box.
      */
     @SuppressWarnings("serial") // Superclass is not serializable across versions
-    protected final class FilterComboBoxModel extends AbstractListModel<FileFilter> implements ComboBoxModel<FileFilter>,
+    protected class FilterComboBoxModel extends AbstractListModel<FileFilter> implements ComboBoxModel<FileFilter>,
             PropertyChangeListener {
         protected FileFilter[] filters;
         protected FilterComboBoxModel() {
@@ -1362,7 +1362,7 @@ public final class WindowsFileChooserUI extends BasicFileChooserUI {
     /**
      * Acts when DirectoryComboBox has changed the selected item.
      */
-    protected final class DirectoryComboBoxAction implements ActionListener {
+    protected class DirectoryComboBoxAction implements ActionListener {
 
 
 
@@ -1387,7 +1387,7 @@ public final class WindowsFileChooserUI extends BasicFileChooserUI {
     // ***********************
     // * FileView operations *
     // ***********************
-    protected final class WindowsFileView extends BasicFileView {
+    protected class WindowsFileView extends BasicFileView {
         /* FileView type descriptions */
 
         @Override
diff --git a/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsInternalFrameTitlePane.java b/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsInternalFrameTitlePane.java
index ba4bde12122..029e139fe8f 100644
--- a/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsInternalFrameTitlePane.java
+++ b/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsInternalFrameTitlePane.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2001, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2001, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -418,7 +418,7 @@ public class WindowsInternalFrameTitlePane extends BasicInternalFrameTitlePane {
         return new WindowsTitlePaneLayout();
     }
 
-    public final class WindowsTitlePaneLayout extends BasicInternalFrameTitlePane.TitlePaneLayout {
+    public class WindowsTitlePaneLayout extends BasicInternalFrameTitlePane.TitlePaneLayout {
         private Insets captionMargin = null;
         private Insets contentMargin = null;
         private XPStyle xp = XPStyle.getXP();
@@ -506,7 +506,7 @@ public class WindowsInternalFrameTitlePane extends BasicInternalFrameTitlePane {
         }
     } // end WindowsTitlePaneLayout
 
-    public final class WindowsPropertyChangeHandler extends PropertyChangeHandler {
+    public class WindowsPropertyChangeHandler extends PropertyChangeHandler {
         @Override
         public void propertyChange(PropertyChangeEvent evt) {
             String prop = evt.getPropertyName();
@@ -530,7 +530,7 @@ public class WindowsInternalFrameTitlePane extends BasicInternalFrameTitlePane {
      * <p>
      * Note: We assume here that icons are square.
      */
-    public static final class ScalableIconUIResource implements Icon, UIResource {
+    public static class ScalableIconUIResource implements Icon, UIResource {
         // We can use an arbitrary size here because we scale to it in paintIcon()
         private static final int SIZE = 16;
 
diff --git a/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsInternalFrameUI.java b/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsInternalFrameUI.java
index 9db31ba38f9..6e76ac6a5b4 100644
--- a/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsInternalFrameUI.java
+++ b/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsInternalFrameUI.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1997, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -45,7 +45,7 @@ import static com.sun.java.swing.plaf.windows.XPStyle.Skin;
 /**
  * Windows rendition of the component.
  */
-public final class WindowsInternalFrameUI extends BasicInternalFrameUI
+public class WindowsInternalFrameUI extends BasicInternalFrameUI
 {
     XPStyle xp = XPStyle.getXP();
 
diff --git a/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsLabelUI.java b/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsLabelUI.java
index 4283f743b97..c910b635491 100644
--- a/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsLabelUI.java
+++ b/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsLabelUI.java
@@ -40,7 +40,7 @@ import sun.swing.SwingUtilities2;
 /**
  * Windows rendition of the component.
  */
-public final class WindowsLabelUI extends BasicLabelUI {
+public class WindowsLabelUI extends BasicLabelUI {
 
     private static final ComponentUI UI = new WindowsLabelUI();
 
diff --git a/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsMenuBarUI.java b/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsMenuBarUI.java
index 3d3cf5feee7..ac26dcbf425 100644
--- a/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsMenuBarUI.java
+++ b/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsMenuBarUI.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1997, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -57,7 +57,7 @@ import sun.swing.MnemonicHandler;
 /**
  * Windows rendition of the component.
  */
-public final class WindowsMenuBarUI extends BasicMenuBarUI
+public class WindowsMenuBarUI extends BasicMenuBarUI
 {
     /* to be accessed on the EDT only */
     private WindowListener windowListener = null;
diff --git a/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsMenuItemUI.java b/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsMenuItemUI.java
index d15bc93a628..d50540588fb 100644
--- a/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsMenuItemUI.java
+++ b/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsMenuItemUI.java
@@ -58,7 +58,7 @@ import sun.swing.SwingUtilities2;
  *
  * @author Igor Kushnirskiy
  */
-public final class WindowsMenuItemUI extends BasicMenuItemUI {
+public class WindowsMenuItemUI extends BasicMenuItemUI {
     /**
      * The instance of {@code PropertyChangeListener}.
      */
diff --git a/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsMenuUI.java b/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsMenuUI.java
index 259c32c74f4..78028db7c00 100644
--- a/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsMenuUI.java
+++ b/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsMenuUI.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1997, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -50,7 +50,7 @@ import com.sun.java.swing.plaf.windows.TMSchema.State;
 /**
  * Windows rendition of the component.
  */
-public final class WindowsMenuUI extends BasicMenuUI {
+public class WindowsMenuUI extends BasicMenuUI {
     protected Integer menuBarHeight;
     protected boolean hotTrackingOn;
 
@@ -283,7 +283,7 @@ public final class WindowsMenuUI extends BasicMenuUI {
      * true when the mouse enters the menu and false when it exits.
      * @since 1.4
      */
-    protected final class WindowsMouseInputHandler extends BasicMenuUI.MouseInputHandler {
+    protected class WindowsMouseInputHandler extends BasicMenuUI.MouseInputHandler {
         @Override
         public void mouseEntered(MouseEvent evt) {
             super.mouseEntered(evt);
diff --git a/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsOptionPaneUI.java b/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsOptionPaneUI.java
index 05c1b177705..3bed1856a55 100644
--- a/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsOptionPaneUI.java
+++ b/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsOptionPaneUI.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1997, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -30,5 +30,5 @@ import javax.swing.plaf.basic.BasicOptionPaneUI;
 /**
  * Windows rendition of the component.
  */
-public final class WindowsOptionPaneUI extends BasicOptionPaneUI {
+public class WindowsOptionPaneUI extends BasicOptionPaneUI {
 }
diff --git a/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsPasswordFieldUI.java b/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsPasswordFieldUI.java
index 6adf6e402ec..0c30b291648 100644
--- a/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsPasswordFieldUI.java
+++ b/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsPasswordFieldUI.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1997, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -33,7 +33,7 @@ import javax.swing.text.Caret;
 /**
  * Windows rendition of the component.
  */
-public final class WindowsPasswordFieldUI extends BasicPasswordFieldUI {
+public class WindowsPasswordFieldUI extends BasicPasswordFieldUI {
 
     /**
      * Creates a UI for a JPasswordField
diff --git a/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsPopupMenuSeparatorUI.java b/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsPopupMenuSeparatorUI.java
index 576549ae482..f236c6b14fc 100644
--- a/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsPopupMenuSeparatorUI.java
+++ b/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsPopupMenuSeparatorUI.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2004, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2004, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -42,7 +42,7 @@ import com.sun.java.swing.plaf.windows.XPStyle.Skin;
  * @author Igor Kushnirskiy
  */
 
-public final class WindowsPopupMenuSeparatorUI extends BasicPopupMenuSeparatorUI {
+public class WindowsPopupMenuSeparatorUI extends BasicPopupMenuSeparatorUI {
 
     public static ComponentUI createUI(JComponent c) {
         return new WindowsPopupMenuSeparatorUI();
diff --git a/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsPopupMenuUI.java b/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsPopupMenuUI.java
index 1361286df4a..1c85cfebd94 100644
--- a/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsPopupMenuUI.java
+++ b/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsPopupMenuUI.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1997, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -57,7 +57,7 @@ import static sun.swing.SwingUtilities2.BASICMENUITEMUI_MAX_TEXT_OFFSET;
  *
  * @author Igor Kushnirskiy
  */
-public final class WindowsPopupMenuUI extends BasicPopupMenuUI {
+public class WindowsPopupMenuUI extends BasicPopupMenuUI {
 
     static MnemonicListener mnemonicListener = null;
     static final Object GUTTER_OFFSET_KEY =
diff --git a/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsProgressBarUI.java b/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsProgressBarUI.java
index 9cc7d277ff1..5440b98cd1b 100644
--- a/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsProgressBarUI.java
+++ b/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsProgressBarUI.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1997, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -51,7 +51,7 @@ import static com.sun.java.swing.plaf.windows.XPStyle.Skin;
  *
  * @author Michael C. Albers
  */
-public final class WindowsProgressBarUI extends BasicProgressBarUI
+public class WindowsProgressBarUI extends BasicProgressBarUI
 {
 
     private Rectangle previousFullBox;
diff --git a/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsRadioButtonMenuItemUI.java b/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsRadioButtonMenuItemUI.java
index 78768c29ab3..2ec78341c2a 100644
--- a/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsRadioButtonMenuItemUI.java
+++ b/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsRadioButtonMenuItemUI.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1997, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -42,7 +42,7 @@ import com.sun.java.swing.plaf.windows.TMSchema.State;
 /**
  * Windows rendition of the component.
  */
-public final class WindowsRadioButtonMenuItemUI extends BasicRadioButtonMenuItemUI {
+public class WindowsRadioButtonMenuItemUI extends BasicRadioButtonMenuItemUI {
 
     final WindowsMenuItemUIAccessor accessor =
         new WindowsMenuItemUIAccessor() {
diff --git a/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsRootPaneUI.java b/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsRootPaneUI.java
index 5e08dcf5605..d41fd9421e4 100644
--- a/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsRootPaneUI.java
+++ b/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsRootPaneUI.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2000, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2000, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -70,7 +70,7 @@ import sun.swing.MnemonicHandler;
  * @author Mark Davidson
  * @since 1.4
  */
-public final class WindowsRootPaneUI extends BasicRootPaneUI {
+public class WindowsRootPaneUI extends BasicRootPaneUI {
 
     private static final WindowsRootPaneUI windowsRootPaneUI = new WindowsRootPaneUI();
     static final AltProcessor altProcessor = new AltProcessor();
diff --git a/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsScrollBarUI.java b/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsScrollBarUI.java
index 04a9f2e97cf..2755f3543f1 100644
--- a/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsScrollBarUI.java
+++ b/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsScrollBarUI.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1997, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -55,7 +55,7 @@ import static com.sun.java.swing.plaf.windows.XPStyle.Skin;
 /**
  * Windows rendition of the component.
  */
-public final class WindowsScrollBarUI extends BasicScrollBarUI {
+public class WindowsScrollBarUI extends BasicScrollBarUI {
     private Grid thumbGrid;
     private Grid highlightGrid;
     private Dimension horizontalThumbSize;
diff --git a/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsScrollPaneUI.java b/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsScrollPaneUI.java
index 48e7a8c02fb..56b8eb1004e 100644
--- a/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsScrollPaneUI.java
+++ b/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsScrollPaneUI.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1997, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -30,5 +30,5 @@ import javax.swing.plaf.basic.BasicScrollPaneUI;
 /**
  * Windows rendition of the component.
  */
-public final class WindowsScrollPaneUI extends BasicScrollPaneUI
+public class WindowsScrollPaneUI extends BasicScrollPaneUI
 {}
diff --git a/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsSeparatorUI.java b/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsSeparatorUI.java
index 2a2caef60d2..12eaa33872c 100644
--- a/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsSeparatorUI.java
+++ b/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsSeparatorUI.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2002, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2002, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -30,4 +30,4 @@ import javax.swing.plaf.basic.*;
 /**
  * Windows Separator.
  */
-public final class WindowsSeparatorUI extends BasicSeparatorUI { }
+public class WindowsSeparatorUI extends BasicSeparatorUI { }
diff --git a/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsSliderUI.java b/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsSliderUI.java
index 731775a2575..cfc509babf4 100644
--- a/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsSliderUI.java
+++ b/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsSliderUI.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1997, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -44,7 +44,7 @@ import static com.sun.java.swing.plaf.windows.XPStyle.Skin;
 /**
  * Windows rendition of the component.
  */
-public final class WindowsSliderUI extends BasicSliderUI
+public class WindowsSliderUI extends BasicSliderUI
 {
     private boolean rollover = false;
     private boolean pressed = false;
diff --git a/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsSpinnerUI.java b/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsSpinnerUI.java
index a8e2a2ddcf1..8934bf9ff21 100644
--- a/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsSpinnerUI.java
+++ b/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsSpinnerUI.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1997, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -37,7 +37,7 @@ import static com.sun.java.swing.plaf.windows.TMSchema.State;
 import static com.sun.java.swing.plaf.windows.XPStyle.Skin;
 
 
-public final class WindowsSpinnerUI extends BasicSpinnerUI {
+public class WindowsSpinnerUI extends BasicSpinnerUI {
     public static ComponentUI createUI(JComponent c) {
         return new WindowsSpinnerUI();
     }
diff --git a/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsSplitPaneDivider.java b/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsSplitPaneDivider.java
index a132756bbee..26cd1bd8c2d 100644
--- a/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsSplitPaneDivider.java
+++ b/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsSplitPaneDivider.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1998, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1998, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -39,7 +39,7 @@ import javax.swing.plaf.basic.BasicSplitPaneUI;
  * @author Jeff Dinkins
  */
 @SuppressWarnings("serial") // Superclass is not serializable across versions
-public final class WindowsSplitPaneDivider extends BasicSplitPaneDivider
+public class WindowsSplitPaneDivider extends BasicSplitPaneDivider
 {
 
     /**
diff --git a/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsSplitPaneUI.java b/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsSplitPaneUI.java
index 481fa466a5b..b67ab22f48f 100644
--- a/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsSplitPaneUI.java
+++ b/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsSplitPaneUI.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1997, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -33,7 +33,7 @@ import javax.swing.plaf.basic.BasicSplitPaneUI;
 /**
  * Windows rendition of the component.
  */
-public final class WindowsSplitPaneUI extends BasicSplitPaneUI
+public class WindowsSplitPaneUI extends BasicSplitPaneUI
 {
 
     public WindowsSplitPaneUI() {
diff --git a/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsTabbedPaneUI.java b/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsTabbedPaneUI.java
index 874b5c65c6e..da8e8b9d385 100644
--- a/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsTabbedPaneUI.java
+++ b/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsTabbedPaneUI.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1997, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -48,7 +48,7 @@ import static com.sun.java.swing.plaf.windows.XPStyle.Skin;
 /**
  * Windows rendition of the component.
  */
-public final class WindowsTabbedPaneUI extends BasicTabbedPaneUI {
+public class WindowsTabbedPaneUI extends BasicTabbedPaneUI {
     /**
      * Keys to use for forward focus traversal when the JComponent is
      * managing focus.
diff --git a/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsTableHeaderUI.java b/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsTableHeaderUI.java
index de8f18b4ea1..1db0050f162 100644
--- a/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsTableHeaderUI.java
+++ b/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsTableHeaderUI.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1997, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -50,7 +50,7 @@ import static com.sun.java.swing.plaf.windows.TMSchema.Part;
 import static com.sun.java.swing.plaf.windows.TMSchema.State;
 import static com.sun.java.swing.plaf.windows.XPStyle.Skin;
 
-public final class WindowsTableHeaderUI extends BasicTableHeaderUI {
+public class WindowsTableHeaderUI extends BasicTableHeaderUI {
     private TableCellRenderer originalHeaderRenderer;
 
     public static ComponentUI createUI(JComponent h) {
diff --git a/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsTextAreaUI.java b/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsTextAreaUI.java
index 78cceff2a0c..7c9abb12e05 100644
--- a/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsTextAreaUI.java
+++ b/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsTextAreaUI.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1997, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -33,7 +33,7 @@ import javax.swing.text.Caret;
 /**
  * Windows rendition of the component.
  */
-public final class WindowsTextAreaUI extends BasicTextAreaUI {
+public class WindowsTextAreaUI extends BasicTextAreaUI {
     /**
      * Creates the object to use for a caret.  By default an
      * instance of WindowsCaret is created.  This method
diff --git a/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsTextFieldUI.java b/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsTextFieldUI.java
index 5846dcb9f09..9920ed371d8 100644
--- a/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsTextFieldUI.java
+++ b/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsTextFieldUI.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1997, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -62,7 +62,7 @@ import javax.swing.text.Position;
  *
  * @author  Timothy Prinzing
  */
-public final class WindowsTextFieldUI extends BasicTextFieldUI
+public class WindowsTextFieldUI extends BasicTextFieldUI
 {
     /**
      * Creates a UI for a JTextField.
diff --git a/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsTextPaneUI.java b/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsTextPaneUI.java
index 2c645903e51..d1418205385 100644
--- a/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsTextPaneUI.java
+++ b/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsTextPaneUI.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1997, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -33,7 +33,7 @@ import javax.swing.text.Caret;
 /**
  * Windows rendition of the component.
  */
-public final class WindowsTextPaneUI extends BasicTextPaneUI
+public class WindowsTextPaneUI extends BasicTextPaneUI
 {
     /**
      * Creates a UI for a JTextPane.
diff --git a/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsToggleButtonUI.java b/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsToggleButtonUI.java
index 67eb5c1d6a0..a612b3f392e 100644
--- a/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsToggleButtonUI.java
+++ b/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsToggleButtonUI.java
@@ -43,7 +43,7 @@ import javax.swing.plaf.basic.BasicToggleButtonUI;
  *
  * @author Jeff Dinkins
  */
-public final class WindowsToggleButtonUI extends BasicToggleButtonUI
+public class WindowsToggleButtonUI extends BasicToggleButtonUI
 {
     protected int dashedRectGapX;
     protected int dashedRectGapY;
diff --git a/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsToolBarSeparatorUI.java b/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsToolBarSeparatorUI.java
index 47175b83d30..1707ce5a80c 100644
--- a/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsToolBarSeparatorUI.java
+++ b/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsToolBarSeparatorUI.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1997, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -40,7 +40,7 @@ import static com.sun.java.swing.plaf.windows.XPStyle.Skin;
  *
  * @author Mark Davidson
  */
-public final class WindowsToolBarSeparatorUI extends BasicToolBarSeparatorUI {
+public class WindowsToolBarSeparatorUI extends BasicToolBarSeparatorUI {
 
     public static ComponentUI createUI( JComponent c ) {
         return new WindowsToolBarSeparatorUI();
diff --git a/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsToolBarUI.java b/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsToolBarUI.java
index 025c30c5c96..4e2cf42bf5d 100644
--- a/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsToolBarUI.java
+++ b/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsToolBarUI.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1997, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -45,7 +45,7 @@ import javax.swing.plaf.basic.BasicToolBarUI;
 import static com.sun.java.swing.plaf.windows.TMSchema.Part;
 
 
-public final class WindowsToolBarUI extends BasicToolBarUI {
+public class WindowsToolBarUI extends BasicToolBarUI {
 
     public static ComponentUI createUI(JComponent c) {
         return new WindowsToolBarUI();
diff --git a/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsTreeUI.java b/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsTreeUI.java
index 78384bbd18a..26edfb978bd 100644
--- a/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsTreeUI.java
+++ b/src/java.desktop/windows/classes/com/sun/java/swing/plaf/windows/WindowsTreeUI.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1997, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -167,7 +167,7 @@ public class WindowsTreeUI extends BasicTreeUI {
      * The plus sign button icon
      */
     @SuppressWarnings("serial") // Superclass is not serializable across versions
-    public static final class CollapsedIcon extends ExpandedIcon {
+    public static class CollapsedIcon extends ExpandedIcon {
         public static Icon createCollapsedIcon() {
             return new CollapsedIcon();
         }
@@ -185,7 +185,7 @@ public class WindowsTreeUI extends BasicTreeUI {
     }
 
     @SuppressWarnings("serial") // Superclass is not serializable across versions
-    public final class WindowsTreeCellRenderer extends DefaultTreeCellRenderer {
+    public class WindowsTreeCellRenderer extends DefaultTreeCellRenderer {
 
         /**
          * Configures the renderer based on the passed in components.
diff --git a/test/jdk/javax/swing/plaf/windows/bug4991587.java b/test/jdk/javax/swing/plaf/windows/bug4991587.java
index e4e4fde2b86..439bdd4cc61 100644
--- a/test/jdk/javax/swing/plaf/windows/bug4991587.java
+++ b/test/jdk/javax/swing/plaf/windows/bug4991587.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2004, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2004, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,7 +23,7 @@
 
 /*
  * @test
- * @bug 4991587
+ * @bug 4991587 8359433
  * @requires (os.family == "windows")
  * @summary Tests that disabled JButton text is positioned properly in Windows L&F
  * @modules java.desktop/com.sun.java.swing.plaf.windows

From 062d89bff59e09850d335e8de682c9711f28966b Mon Sep 17 00:00:00 2001
From: Phil Race <prr@openjdk.org>
Date: Thu, 26 Mar 2026 21:23:04 +0000
Subject: [PATCH 376/655] 8380804: Remove remaining AppContext usage from the
 Swing implementation

Reviewed-by: dnguyen, serb
---
 .../classes/javax/swing/RepaintManager.java   | 22 +++----
 .../classes/javax/swing/SwingUtilities.java   | 21 -------
 .../classes/javax/swing/SwingWorker.java      | 63 +++++++------------
 .../share/classes/javax/swing/Timer.java      |  5 +-
 .../share/classes/javax/swing/UIManager.java  | 34 ++--------
 5 files changed, 36 insertions(+), 109 deletions(-)

diff --git a/src/java.desktop/share/classes/javax/swing/RepaintManager.java b/src/java.desktop/share/classes/javax/swing/RepaintManager.java
index db8b13afa22..b587cf2da84 100644
--- a/src/java.desktop/share/classes/javax/swing/RepaintManager.java
+++ b/src/java.desktop/share/classes/javax/swing/RepaintManager.java
@@ -32,7 +32,6 @@ import java.util.*;
 import java.util.concurrent.atomic.AtomicInteger;
 
 import sun.awt.AWTAccessor;
-import sun.awt.AppContext;
 import sun.awt.DisplayChangedListener;
 import sun.awt.SunToolkit;
 import sun.java2d.SunGraphicsEnvironment;
@@ -1733,21 +1732,14 @@ public class RepaintManager
         }
 
         private static void scheduleDisplayChanges() {
-            // To avoid threading problems, we notify each RepaintManager
+            // To avoid threading problems, we notify the RepaintManager
             // on the thread it was created on.
-            for (AppContext context : AppContext.getAppContexts()) {
-                synchronized(context) {
-                    if (!context.isDisposed()) {
-                        EventQueue eventQueue = (EventQueue)context.get(
-                            AppContext.EVENT_QUEUE_KEY);
-                        if (eventQueue != null) {
-                            eventQueue.postEvent(new InvocationEvent(
-                                Toolkit.getDefaultToolkit(),
-                                new DisplayChangedRunnable()));
-                        }
-                    }
-                }
-            }
+            EventQueue eventQueue = Toolkit.getDefaultToolkit().getSystemEventQueue();
+            eventQueue.postEvent(
+                new InvocationEvent(
+                    Toolkit.getDefaultToolkit(),
+                    new DisplayChangedRunnable())
+            );
         }
     }
 
diff --git a/src/java.desktop/share/classes/javax/swing/SwingUtilities.java b/src/java.desktop/share/classes/javax/swing/SwingUtilities.java
index ae5faf64f3b..3603292b0ca 100644
--- a/src/java.desktop/share/classes/javax/swing/SwingUtilities.java
+++ b/src/java.desktop/share/classes/javax/swing/SwingUtilities.java
@@ -38,7 +38,6 @@ import javax.swing.event.MenuDragMouseEvent;
 import javax.swing.plaf.UIResource;
 import javax.swing.text.View;
 
-import sun.awt.AppContext;
 import sun.awt.AWTAccessor;
 import sun.awt.AWTAccessor.MouseEventAccessor;
 
@@ -1986,26 +1985,6 @@ public class SwingUtilities implements SwingConstants
         return (WindowListener)sharedOwnerFrame;
     }
 
-    /* Don't make these AppContext accessors public or protected --
-     * since AppContext is in sun.awt in 1.2, we shouldn't expose it
-     * even indirectly with a public API.
-     */
-    // REMIND(aim): phase out use of 4 methods below since they
-    // are just private covers for AWT methods (?)
-
-    static Object appContextGet(Object key) {
-        return AppContext.getAppContext().get(key);
-    }
-
-    static void appContextPut(Object key, Object value) {
-        AppContext.getAppContext().put(key, value);
-    }
-
-    static void appContextRemove(Object key) {
-        AppContext.getAppContext().remove(key);
-    }
-
-
     static Class<?> loadSystemClass(String className) throws ClassNotFoundException {
         return Class.forName(className, true, Thread.currentThread().
                              getContextClassLoader());
diff --git a/src/java.desktop/share/classes/javax/swing/SwingWorker.java b/src/java.desktop/share/classes/javax/swing/SwingWorker.java
index 75f1700bded..dae695b4868 100644
--- a/src/java.desktop/share/classes/javax/swing/SwingWorker.java
+++ b/src/java.desktop/share/classes/javax/swing/SwingWorker.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2005, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2005, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -45,7 +45,8 @@ import java.util.concurrent.ThreadPoolExecutor;
 import java.util.concurrent.TimeUnit;
 import java.util.concurrent.TimeoutException;
 
-import sun.awt.AppContext;
+import sun.awt.util.ThreadGroupUtils;
+
 import sun.swing.AccumulativeRunnable;
 
 /**
@@ -266,7 +267,7 @@ public abstract class SwingWorker<T, V> implements RunnableFuture<T> {
      */
     private AccumulativeRunnable<Integer> doNotifyProgressChange;
 
-    private final AccumulativeRunnable<Runnable> doSubmit = getDoSubmit();
+    private final AccumulativeRunnable<Runnable> doSubmit = new DoSubmitAccumulativeRunnable();
 
     /**
      * Values for the {@code state} bound property.
@@ -755,18 +756,16 @@ public abstract class SwingWorker<T, V> implements RunnableFuture<T> {
     }
 
 
+    private static ExecutorService executorService;
+
     /**
      * returns workersExecutorService.
      *
-     * returns the service stored in the appContext or creates it if
-     * necessary.
+     * returns the service and creates it if necessary.
      *
      * @return ExecutorService for the {@code SwingWorkers}
      */
     private static synchronized ExecutorService getWorkersExecutorService() {
-        final AppContext appContext = AppContext.getAppContext();
-        ExecutorService executorService =
-            (ExecutorService) appContext.get(SwingWorker.class);
         if (executorService == null) {
             //this creates daemon threads.
             ThreadFactory threadFactory =
@@ -788,46 +787,26 @@ public abstract class SwingWorker<T, V> implements RunnableFuture<T> {
                                        10L, TimeUnit.MINUTES,
                                        new LinkedBlockingQueue<Runnable>(),
                                        threadFactory);
-            appContext.put(SwingWorker.class, executorService);
 
-            // Don't use ShutdownHook here as it's not enough. We should track
-            // AppContext disposal instead of JVM shutdown, see 6799345 for details
-            final ExecutorService es = executorService;
-            appContext.addPropertyChangeListener(AppContext.DISPOSED_PROPERTY_NAME,
-                new PropertyChangeListener() {
-                    @Override
-                    public void propertyChange(PropertyChangeEvent pce) {
-                        boolean disposed = (Boolean)pce.getNewValue();
-                        if (disposed) {
-                            final WeakReference<ExecutorService> executorServiceRef =
-                                new WeakReference<ExecutorService>(es);
-                            final ExecutorService executorService =
-                                executorServiceRef.get();
-                            if (executorService != null) {
-                                executorService.shutdown();
-                            }
-                        }
-                    }
+            final Runnable shutdownHook = new Runnable() {
+                final WeakReference<ExecutorService> executorServiceRef =
+                      new WeakReference<ExecutorService>(executorService);
+                 public void run() {
+                     final ExecutorService executorService = executorServiceRef.get();
+                     if (executorService != null) {
+                         executorService.shutdown();
+                     }
                 }
-            );
+            };
+            ThreadGroup rootTG = ThreadGroupUtils.getRootThreadGroup();
+            Thread t = new Thread(rootTG, shutdownHook,
+                                    "SwingWorker ES", 0, false);
+            t.setContextClassLoader(null);
+            Runtime.getRuntime().addShutdownHook(t);
         }
         return executorService;
     }
 
-    private static final Object DO_SUBMIT_KEY = new StringBuilder("doSubmit");
-    private static AccumulativeRunnable<Runnable> getDoSubmit() {
-        synchronized (DO_SUBMIT_KEY) {
-            final AppContext appContext = AppContext.getAppContext();
-            Object doSubmit = appContext.get(DO_SUBMIT_KEY);
-            if (doSubmit == null) {
-                doSubmit = new DoSubmitAccumulativeRunnable();
-                appContext.put(DO_SUBMIT_KEY, doSubmit);
-            }
-            @SuppressWarnings("unchecked")
-            AccumulativeRunnable<Runnable> tmp = (AccumulativeRunnable<Runnable>) doSubmit;
-            return tmp;
-        }
-    }
     private static class DoSubmitAccumulativeRunnable
           extends AccumulativeRunnable<Runnable> implements ActionListener {
         private static final int DELAY = 1000 / 30;
diff --git a/src/java.desktop/share/classes/javax/swing/Timer.java b/src/java.desktop/share/classes/javax/swing/Timer.java
index 2cb8381d7d3..1063532715c 100644
--- a/src/java.desktop/share/classes/javax/swing/Timer.java
+++ b/src/java.desktop/share/classes/javax/swing/Timer.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1997, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -173,8 +173,7 @@ public class Timer implements Serializable
     private final transient Lock lock = new ReentrantLock();
 
     // This field is maintained by TimerQueue.
-    // eventQueued can also be reset by the TimerQueue, but will only ever
-    // happen in an AppContext case when TimerQueues thread is destroyed.
+    // eventQueued can also be reset by the TimerQueue
     // access to this field is synchronized on getLock() lock.
     transient TimerQueue.DelayedTimer delayedTimer = null;
 
diff --git a/src/java.desktop/share/classes/javax/swing/UIManager.java b/src/java.desktop/share/classes/javax/swing/UIManager.java
index 69063c562e6..f323842ae49 100644
--- a/src/java.desktop/share/classes/javax/swing/UIManager.java
+++ b/src/java.desktop/share/classes/javax/swing/UIManager.java
@@ -56,7 +56,6 @@ import sun.awt.OSInfo;
 import sun.swing.SwingUtilities2;
 import java.util.HashMap;
 import java.util.Objects;
-import sun.awt.AppContext;
 import sun.awt.AWTAccessor;
 
 import sun.swing.SwingAccessor;
@@ -179,10 +178,7 @@ public class UIManager implements Serializable
     /**
      * This class defines the state managed by the <code>UIManager</code>.  For
      * Swing applications the fields in this class could just as well
-     * be static members of <code>UIManager</code> however we give them
-     * "AppContext"
-     * scope instead so that potentially multiple lightweight
-     * applications running in a single VM have their own state.
+     * be static members of <code>UIManager</code>.
      */
     private static class LAFState
     {
@@ -206,8 +202,8 @@ public class UIManager implements Serializable
         void setSystemDefaults(UIDefaults x) { tables[1] = x; }
 
         /**
-         * Returns the SwingPropertyChangeSupport for the current
-         * AppContext.  If <code>create</code> is a true, a non-null
+         * Returns the SwingPropertyChangeSupport instance.
+         * If <code>create</code> is a true, a non-null
          * <code>SwingPropertyChangeSupport</code> will be returned, if
          * <code>create</code> is false and this has not been invoked
          * with true, null will be returned.
@@ -1366,18 +1362,7 @@ public class UIManager implements Serializable
             return;
         }
 
-        // Try to get default LAF from system property, then from AppContext
-        // (6653395), then use cross-platform one by default.
-        String lafName = null;
-        @SuppressWarnings("unchecked")
-        HashMap<Object, String> lafData =
-                (HashMap) AppContext.getAppContext().remove("swing.lafdata");
-        if (lafData != null) {
-            lafName = lafData.remove("defaultlaf");
-        }
-        if (lafName == null) {
-            lafName = getCrossPlatformLookAndFeelClassName();
-        }
+        String lafName = getCrossPlatformLookAndFeelClassName();
         lafName = swingProps.getProperty(defaultLAFKey, lafName);
 
         try {
@@ -1385,13 +1370,6 @@ public class UIManager implements Serializable
         } catch (Exception e) {
             throw new Error("Cannot load " + lafName);
         }
-
-        // Set any properties passed through AppContext (6653395).
-        if (lafData != null) {
-            for (Object key: lafData.keySet()) {
-                UIManager.put(key, lafData.get(key));
-            }
-        }
     }
 
 
@@ -1451,8 +1429,8 @@ public class UIManager implements Serializable
 
     /*
      * This method is called before any code that depends on the
-     * <code>AppContext</code> specific LAFState object runs.
-     * In some AppContext cases, it's possible for this method
+     * LAFState object runs.
+     * In some cases, it's possible for this method
      * to be re-entered, which is why we grab a lock before calling
      * initialize().
      */

From 6a92c5314464f62889a4042a98b7a14c247ac889 Mon Sep 17 00:00:00 2001
From: Chen Liang <liach@openjdk.org>
Date: Thu, 26 Mar 2026 22:52:44 +0000
Subject: [PATCH 377/655] 8380915: Cleanup some Java declarations of the Vector
 API

Reviewed-by: psandoz
---
 .../jdk/incubator/vector/AbstractMask.java    | 14 ++--
 .../jdk/incubator/vector/AbstractShuffle.java |  9 ++-
 .../jdk/incubator/vector/AbstractSpecies.java | 26 +++---
 .../jdk/incubator/vector/AbstractVector.java  | 13 +--
 .../jdk/incubator/vector/ByteVector.java      |  3 +-
 .../jdk/incubator/vector/ByteVector128.java   | 28 +++----
 .../jdk/incubator/vector/ByteVector256.java   | 28 +++----
 .../jdk/incubator/vector/ByteVector512.java   | 28 +++----
 .../jdk/incubator/vector/ByteVector64.java    | 28 +++----
 .../jdk/incubator/vector/ByteVectorMax.java   | 28 +++----
 .../jdk/incubator/vector/CPUFeatures.java     |  4 +-
 .../jdk/incubator/vector/DoubleVector.java    |  3 +-
 .../jdk/incubator/vector/DoubleVector128.java | 29 ++++---
 .../jdk/incubator/vector/DoubleVector256.java | 29 ++++---
 .../jdk/incubator/vector/DoubleVector512.java | 29 ++++---
 .../jdk/incubator/vector/DoubleVector64.java  | 29 ++++---
 .../jdk/incubator/vector/DoubleVectorMax.java | 29 ++++---
 .../jdk/incubator/vector/Float16Consts.java   |  4 +-
 .../jdk/incubator/vector/FloatVector.java     |  3 +-
 .../jdk/incubator/vector/FloatVector128.java  | 30 ++++---
 .../jdk/incubator/vector/FloatVector256.java  | 30 ++++---
 .../jdk/incubator/vector/FloatVector512.java  | 30 ++++---
 .../jdk/incubator/vector/FloatVector64.java   | 30 ++++---
 .../jdk/incubator/vector/FloatVectorMax.java  | 30 ++++---
 .../jdk/incubator/vector/IntVector.java       |  3 +-
 .../jdk/incubator/vector/IntVector128.java    | 28 +++----
 .../jdk/incubator/vector/IntVector256.java    | 28 +++----
 .../jdk/incubator/vector/IntVector512.java    | 28 +++----
 .../jdk/incubator/vector/IntVector64.java     | 28 +++----
 .../jdk/incubator/vector/IntVectorMax.java    | 28 +++----
 .../jdk/incubator/vector/LongVector.java      |  3 +-
 .../jdk/incubator/vector/LongVector128.java   | 27 +++----
 .../jdk/incubator/vector/LongVector256.java   | 27 +++----
 .../jdk/incubator/vector/LongVector512.java   | 27 +++----
 .../jdk/incubator/vector/LongVector64.java    | 27 +++----
 .../jdk/incubator/vector/LongVectorMax.java   | 27 +++----
 .../jdk/incubator/vector/ShortVector.java     |  3 +-
 .../jdk/incubator/vector/ShortVector128.java  | 28 +++----
 .../jdk/incubator/vector/ShortVector256.java  | 28 +++----
 .../jdk/incubator/vector/ShortVector512.java  | 28 +++----
 .../jdk/incubator/vector/ShortVector64.java   | 28 +++----
 .../jdk/incubator/vector/ShortVectorMax.java  | 28 +++----
 .../classes/jdk/incubator/vector/Util.java    |  4 +-
 .../classes/jdk/incubator/vector/Vector.java  |  5 +-
 .../incubator/vector/VectorIntrinsics.java    |  4 +-
 .../jdk/incubator/vector/VectorMask.java      |  2 +-
 .../incubator/vector/VectorMathLibrary.java   |  2 +-
 .../jdk/incubator/vector/VectorOperators.java | 79 +++++--------------
 .../jdk/incubator/vector/VectorShuffle.java   |  4 +-
 .../jdk/incubator/vector/VectorSpecies.java   |  9 +--
 .../incubator/vector/X-Vector.java.template   |  3 +-
 .../vector/X-VectorBits.java.template         | 33 ++++----
 52 files changed, 498 insertions(+), 585 deletions(-)

diff --git a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/AbstractMask.java b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/AbstractMask.java
index 5b762edfd3b..9ac90c08c27 100644
--- a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/AbstractMask.java
+++ b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/AbstractMask.java
@@ -24,17 +24,19 @@
  */
 package jdk.incubator.vector;
 
-import java.util.Objects;
-
-import jdk.internal.vm.annotation.ForceInline;
-
 import jdk.internal.misc.Unsafe;
-
+import jdk.internal.vm.annotation.ForceInline;
 import jdk.internal.vm.vector.VectorSupport;
 
 import static jdk.incubator.vector.VectorOperators.*;
 
-abstract class AbstractMask<E> extends VectorMask<E> {
+abstract sealed class AbstractMask<E> extends VectorMask<E>
+        permits ByteVector64.ByteMask64, ByteVector128.ByteMask128, ByteVector256.ByteMask256, ByteVector512.ByteMask512, ByteVectorMax.ByteMaskMax,
+        DoubleVector64.DoubleMask64, DoubleVector128.DoubleMask128, DoubleVector256.DoubleMask256, DoubleVector512.DoubleMask512, DoubleVectorMax.DoubleMaskMax,
+        FloatVector64.FloatMask64, FloatVector128.FloatMask128, FloatVector256.FloatMask256, FloatVector512.FloatMask512, FloatVectorMax.FloatMaskMax,
+        IntVector64.IntMask64, IntVector128.IntMask128, IntVector256.IntMask256, IntVector512.IntMask512, IntVectorMax.IntMaskMax,
+        LongVector64.LongMask64, LongVector128.LongMask128, LongVector256.LongMask256, LongVector512.LongMask512, LongVectorMax.LongMaskMax,
+        ShortVector64.ShortMask64, ShortVector128.ShortMask128, ShortVector256.ShortMask256, ShortVector512.ShortMask512, ShortVectorMax.ShortMaskMax {
     AbstractMask(boolean[] bits) {
         super(bits);
     }
diff --git a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/AbstractShuffle.java b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/AbstractShuffle.java
index 075400a0d4a..bea495f74fc 100644
--- a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/AbstractShuffle.java
+++ b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/AbstractShuffle.java
@@ -25,10 +25,17 @@
 package jdk.incubator.vector;
 
 import java.util.function.IntUnaryOperator;
+
 import jdk.internal.vm.annotation.ForceInline;
 import jdk.internal.vm.vector.VectorSupport;
 
-abstract class AbstractShuffle<E> extends VectorShuffle<E> {
+abstract sealed class AbstractShuffle<E> extends VectorShuffle<E>
+        permits ByteVector64.ByteShuffle64, ByteVector128.ByteShuffle128, ByteVector256.ByteShuffle256, ByteVector512.ByteShuffle512, ByteVectorMax.ByteShuffleMax,
+        DoubleVector64.DoubleShuffle64, DoubleVector128.DoubleShuffle128, DoubleVector256.DoubleShuffle256, DoubleVector512.DoubleShuffle512, DoubleVectorMax.DoubleShuffleMax,
+        FloatVector64.FloatShuffle64, FloatVector128.FloatShuffle128, FloatVector256.FloatShuffle256, FloatVector512.FloatShuffle512, FloatVectorMax.FloatShuffleMax,
+        IntVector64.IntShuffle64, IntVector128.IntShuffle128, IntVector256.IntShuffle256, IntVector512.IntShuffle512, IntVectorMax.IntShuffleMax,
+        LongVector64.LongShuffle64, LongVector128.LongShuffle128, LongVector256.LongShuffle256, LongVector512.LongShuffle512, LongVectorMax.LongShuffleMax,
+        ShortVector64.ShortShuffle64, ShortVector128.ShortShuffle128, ShortVector256.ShortShuffle256, ShortVector512.ShortShuffle512, ShortVectorMax.ShortShuffleMax {
     static final IntUnaryOperator IDENTITY = i -> i;
 
     // Internal representation allows for a maximum index of E.MAX_VALUE - 1
diff --git a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/AbstractSpecies.java b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/AbstractSpecies.java
index 6c834077387..3fd2be34346 100644
--- a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/AbstractSpecies.java
+++ b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/AbstractSpecies.java
@@ -24,39 +24,31 @@
  */
 package jdk.incubator.vector;
 
-import java.lang.foreign.MemorySegment;
-import jdk.internal.vm.annotation.ForceInline;
-import jdk.internal.vm.annotation.Stable;
 import java.lang.reflect.Array;
-import java.nio.ByteOrder;
 import java.util.Arrays;
 import java.util.function.Function;
 import java.util.function.IntUnaryOperator;
 
-abstract class AbstractSpecies<E> extends jdk.internal.vm.vector.VectorSupport.VectorSpecies<E>
-                                  implements VectorSpecies<E> {
-    @Stable
+import jdk.internal.vm.annotation.ForceInline;
+import jdk.internal.vm.annotation.Stable;
+import jdk.internal.vm.annotation.TrustFinalFields;
+
+@TrustFinalFields
+abstract sealed class AbstractSpecies<E> extends jdk.internal.vm.vector.VectorSupport.VectorSpecies<E>
+        implements VectorSpecies<E>
+        permits ByteVector.ByteSpecies, DoubleVector.DoubleSpecies, FloatVector.FloatSpecies,
+        IntVector.IntSpecies, LongVector.LongSpecies, ShortVector.ShortSpecies {
     final VectorShape vectorShape;
-    @Stable
     final LaneType laneType;
-    @Stable
     final int laneCount;
-    @Stable
     final int laneCountLog2P1;
-    @Stable
     final Class<? extends AbstractVector<E>> vectorType;
-    @Stable
     final Class<? extends AbstractMask<E>> maskType;
-    @Stable
     final Class<? extends AbstractShuffle<E>> shuffleType;
-    @Stable
     final Function<Object, ? extends AbstractVector<E>> vectorFactory;
 
-    @Stable
     final VectorShape indexShape;
-    @Stable
     final int maxScale, minScale;
-    @Stable
     final int vectorBitSize, vectorByteSize;
 
     AbstractSpecies(VectorShape vectorShape,
diff --git a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/AbstractVector.java b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/AbstractVector.java
index 80260c2bd30..ea8112cc2ae 100644
--- a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/AbstractVector.java
+++ b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/AbstractVector.java
@@ -25,22 +25,17 @@
 package jdk.incubator.vector;
 
 import java.lang.foreign.MemorySegment;
+import java.nio.ByteOrder;
+import java.util.function.IntUnaryOperator;
 
-import jdk.internal.foreign.AbstractMemorySegmentImpl;
-import jdk.internal.foreign.Utils;
 import jdk.internal.vm.annotation.ForceInline;
 import jdk.internal.vm.vector.VectorSupport;
 
-import java.lang.foreign.ValueLayout;
-import java.lang.reflect.Array;
-import java.nio.ByteOrder;
-import java.util.Objects;
-import java.util.function.IntUnaryOperator;
-
 import static jdk.incubator.vector.VectorOperators.*;
 
 @SuppressWarnings("cast")
-abstract class AbstractVector<E> extends Vector<E> {
+abstract sealed class AbstractVector<E> extends Vector<E>
+        permits ByteVector, DoubleVector, FloatVector, IntVector, LongVector, ShortVector {
     /**
      * The order of vector bytes when stored in natural,
      * array elements of the same lane type.
diff --git a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/ByteVector.java b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/ByteVector.java
index 846032cb5c6..7231ada3273 100644
--- a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/ByteVector.java
+++ b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/ByteVector.java
@@ -49,7 +49,8 @@ import static jdk.incubator.vector.VectorOperators.*;
  * {@code byte} values.
  */
 @SuppressWarnings("cast")  // warning: redundant cast
-public abstract class ByteVector extends AbstractVector<Byte> {
+public abstract sealed class ByteVector extends AbstractVector<Byte>
+         permits ByteVector64, ByteVector128, ByteVector256, ByteVector512, ByteVectorMax {
 
     ByteVector(byte[] vec) {
         super(vec);
diff --git a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/ByteVector128.java b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/ByteVector128.java
index 360afedbbbb..36ea8d081a8 100644
--- a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/ByteVector128.java
+++ b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/ByteVector128.java
@@ -25,7 +25,6 @@
 package jdk.incubator.vector;
 
 import java.lang.foreign.MemorySegment;
-import java.lang.foreign.ValueLayout;
 import java.nio.ByteOrder;
 import java.util.Arrays;
 import java.util.Objects;
@@ -35,9 +34,8 @@ import jdk.internal.ValueBased;
 import jdk.internal.vm.annotation.ForceInline;
 import jdk.internal.vm.vector.VectorSupport;
 
-import static jdk.internal.vm.vector.VectorSupport.*;
-
 import static jdk.incubator.vector.VectorOperators.*;
+import static jdk.internal.vm.vector.VectorSupport.*;
 
 // -- This file was mechanically generated: Do not edit! -- //
 
@@ -373,7 +371,7 @@ final class ByteVector128 extends ByteVector {
     @Override
     @ForceInline
     public final ByteShuffle128 toShuffle() {
-        return (ByteShuffle128) toShuffle(vspecies(), false);
+        return (ByteShuffle128) toShuffle(VSPECIES, false);
     }
 
     // Specialized unary testing
@@ -648,7 +646,7 @@ final class ByteVector128 extends ByteVector {
 
         @Override
         ByteMask128 uOp(MUnOp f) {
-            boolean[] res = new boolean[vspecies().laneCount()];
+            boolean[] res = new boolean[VSPECIES.laneCount()];
             boolean[] bits = getBits();
             for (int i = 0; i < res.length; i++) {
                 res[i] = f.apply(i, bits[i]);
@@ -658,7 +656,7 @@ final class ByteVector128 extends ByteVector {
 
         @Override
         ByteMask128 bOp(VectorMask<Byte> m, MBinOp f) {
-            boolean[] res = new boolean[vspecies().laneCount()];
+            boolean[] res = new boolean[VSPECIES.laneCount()];
             boolean[] bits = getBits();
             boolean[] mbits = ((ByteMask128)m).getBits();
             for (int i = 0; i < res.length; i++) {
@@ -808,16 +806,16 @@ final class ByteVector128 extends ByteVector {
         @ForceInline
         public boolean anyTrue() {
             return VectorSupport.test(BT_ne, ByteMask128.class, LANEBITS_TYPE_ORDINAL, VLENGTH,
-                                         this, vspecies().maskAll(true),
-                                         (m, __) -> anyTrueHelper(((ByteMask128)m).getBits()));
+                                         this, VSPECIES.maskAll(true),
+                                         (m, _) -> anyTrueHelper(((ByteMask128)m).getBits()));
         }
 
         @Override
         @ForceInline
         public boolean allTrue() {
             return VectorSupport.test(BT_overflow, ByteMask128.class, LANEBITS_TYPE_ORDINAL, VLENGTH,
-                                         this, vspecies().maskAll(true),
-                                         (m, __) -> allTrueHelper(((ByteMask128)m).getBits()));
+                                         this, VSPECIES.maskAll(true),
+                                         (m, _) -> allTrueHelper(((ByteMask128)m).getBits()));
         }
 
         @ForceInline
@@ -825,7 +823,7 @@ final class ByteVector128 extends ByteVector {
         static ByteMask128 maskAll(boolean bit) {
             return VectorSupport.fromBitsCoerced(ByteMask128.class, LANEBITS_TYPE_ORDINAL, VLENGTH,
                                                  (bit ? -1 : 0), MODE_BROADCAST, null,
-                                                 (v, __) -> (v != 0 ? TRUE_MASK : FALSE_MASK));
+                                                 (v, _) -> (v != 0 ? TRUE_MASK : FALSE_MASK));
         }
         private static final ByteMask128  TRUE_MASK = new ByteMask128(true);
         private static final ByteMask128 FALSE_MASK = new ByteMask128(false);
@@ -885,7 +883,7 @@ final class ByteVector128 extends ByteVector {
 
         @Override
         ByteVector128 toBitsVector0() {
-            return ((ByteVector128) vspecies().asIntegral().dummyVector()).vectorFactory(indices());
+            return ((ByteVector128) VSPECIES.asIntegral().dummyVector()).vectorFactory(indices());
         }
 
         @Override
@@ -936,7 +934,7 @@ final class ByteVector128 extends ByteVector {
         @ForceInline
         public final ByteMask128 laneIsValid() {
             return (ByteMask128) toBitsVector().compare(VectorOperators.GE, 0)
-                    .cast(vspecies());
+                    .cast(VSPECIES);
         }
 
         @ForceInline
@@ -944,7 +942,7 @@ final class ByteVector128 extends ByteVector {
         public final ByteShuffle128 rearrange(VectorShuffle<Byte> shuffle) {
             ByteShuffle128 concreteShuffle = (ByteShuffle128) shuffle;
             return (ByteShuffle128) toBitsVector().rearrange(concreteShuffle)
-                    .toShuffle(vspecies(), false);
+                    .toShuffle(VSPECIES, false);
         }
 
         @ForceInline
@@ -957,7 +955,7 @@ final class ByteVector128 extends ByteVector {
                 v = (ByteVector128) v.blend(v.lanewise(VectorOperators.ADD, length()),
                             v.compare(VectorOperators.LT, 0));
             }
-            return (ByteShuffle128) v.toShuffle(vspecies(), false);
+            return (ByteShuffle128) v.toShuffle(VSPECIES, false);
         }
 
         private static byte[] prepare(int[] indices, int offset) {
diff --git a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/ByteVector256.java b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/ByteVector256.java
index ca0c59dd49e..a11268ea40d 100644
--- a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/ByteVector256.java
+++ b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/ByteVector256.java
@@ -25,7 +25,6 @@
 package jdk.incubator.vector;
 
 import java.lang.foreign.MemorySegment;
-import java.lang.foreign.ValueLayout;
 import java.nio.ByteOrder;
 import java.util.Arrays;
 import java.util.Objects;
@@ -35,9 +34,8 @@ import jdk.internal.ValueBased;
 import jdk.internal.vm.annotation.ForceInline;
 import jdk.internal.vm.vector.VectorSupport;
 
-import static jdk.internal.vm.vector.VectorSupport.*;
-
 import static jdk.incubator.vector.VectorOperators.*;
+import static jdk.internal.vm.vector.VectorSupport.*;
 
 // -- This file was mechanically generated: Do not edit! -- //
 
@@ -373,7 +371,7 @@ final class ByteVector256 extends ByteVector {
     @Override
     @ForceInline
     public final ByteShuffle256 toShuffle() {
-        return (ByteShuffle256) toShuffle(vspecies(), false);
+        return (ByteShuffle256) toShuffle(VSPECIES, false);
     }
 
     // Specialized unary testing
@@ -680,7 +678,7 @@ final class ByteVector256 extends ByteVector {
 
         @Override
         ByteMask256 uOp(MUnOp f) {
-            boolean[] res = new boolean[vspecies().laneCount()];
+            boolean[] res = new boolean[VSPECIES.laneCount()];
             boolean[] bits = getBits();
             for (int i = 0; i < res.length; i++) {
                 res[i] = f.apply(i, bits[i]);
@@ -690,7 +688,7 @@ final class ByteVector256 extends ByteVector {
 
         @Override
         ByteMask256 bOp(VectorMask<Byte> m, MBinOp f) {
-            boolean[] res = new boolean[vspecies().laneCount()];
+            boolean[] res = new boolean[VSPECIES.laneCount()];
             boolean[] bits = getBits();
             boolean[] mbits = ((ByteMask256)m).getBits();
             for (int i = 0; i < res.length; i++) {
@@ -840,16 +838,16 @@ final class ByteVector256 extends ByteVector {
         @ForceInline
         public boolean anyTrue() {
             return VectorSupport.test(BT_ne, ByteMask256.class, LANEBITS_TYPE_ORDINAL, VLENGTH,
-                                         this, vspecies().maskAll(true),
-                                         (m, __) -> anyTrueHelper(((ByteMask256)m).getBits()));
+                                         this, VSPECIES.maskAll(true),
+                                         (m, _) -> anyTrueHelper(((ByteMask256)m).getBits()));
         }
 
         @Override
         @ForceInline
         public boolean allTrue() {
             return VectorSupport.test(BT_overflow, ByteMask256.class, LANEBITS_TYPE_ORDINAL, VLENGTH,
-                                         this, vspecies().maskAll(true),
-                                         (m, __) -> allTrueHelper(((ByteMask256)m).getBits()));
+                                         this, VSPECIES.maskAll(true),
+                                         (m, _) -> allTrueHelper(((ByteMask256)m).getBits()));
         }
 
         @ForceInline
@@ -857,7 +855,7 @@ final class ByteVector256 extends ByteVector {
         static ByteMask256 maskAll(boolean bit) {
             return VectorSupport.fromBitsCoerced(ByteMask256.class, LANEBITS_TYPE_ORDINAL, VLENGTH,
                                                  (bit ? -1 : 0), MODE_BROADCAST, null,
-                                                 (v, __) -> (v != 0 ? TRUE_MASK : FALSE_MASK));
+                                                 (v, _) -> (v != 0 ? TRUE_MASK : FALSE_MASK));
         }
         private static final ByteMask256  TRUE_MASK = new ByteMask256(true);
         private static final ByteMask256 FALSE_MASK = new ByteMask256(false);
@@ -917,7 +915,7 @@ final class ByteVector256 extends ByteVector {
 
         @Override
         ByteVector256 toBitsVector0() {
-            return ((ByteVector256) vspecies().asIntegral().dummyVector()).vectorFactory(indices());
+            return ((ByteVector256) VSPECIES.asIntegral().dummyVector()).vectorFactory(indices());
         }
 
         @Override
@@ -968,7 +966,7 @@ final class ByteVector256 extends ByteVector {
         @ForceInline
         public final ByteMask256 laneIsValid() {
             return (ByteMask256) toBitsVector().compare(VectorOperators.GE, 0)
-                    .cast(vspecies());
+                    .cast(VSPECIES);
         }
 
         @ForceInline
@@ -976,7 +974,7 @@ final class ByteVector256 extends ByteVector {
         public final ByteShuffle256 rearrange(VectorShuffle<Byte> shuffle) {
             ByteShuffle256 concreteShuffle = (ByteShuffle256) shuffle;
             return (ByteShuffle256) toBitsVector().rearrange(concreteShuffle)
-                    .toShuffle(vspecies(), false);
+                    .toShuffle(VSPECIES, false);
         }
 
         @ForceInline
@@ -989,7 +987,7 @@ final class ByteVector256 extends ByteVector {
                 v = (ByteVector256) v.blend(v.lanewise(VectorOperators.ADD, length()),
                             v.compare(VectorOperators.LT, 0));
             }
-            return (ByteShuffle256) v.toShuffle(vspecies(), false);
+            return (ByteShuffle256) v.toShuffle(VSPECIES, false);
         }
 
         private static byte[] prepare(int[] indices, int offset) {
diff --git a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/ByteVector512.java b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/ByteVector512.java
index 1a0c69153bc..707254e034e 100644
--- a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/ByteVector512.java
+++ b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/ByteVector512.java
@@ -25,7 +25,6 @@
 package jdk.incubator.vector;
 
 import java.lang.foreign.MemorySegment;
-import java.lang.foreign.ValueLayout;
 import java.nio.ByteOrder;
 import java.util.Arrays;
 import java.util.Objects;
@@ -35,9 +34,8 @@ import jdk.internal.ValueBased;
 import jdk.internal.vm.annotation.ForceInline;
 import jdk.internal.vm.vector.VectorSupport;
 
-import static jdk.internal.vm.vector.VectorSupport.*;
-
 import static jdk.incubator.vector.VectorOperators.*;
+import static jdk.internal.vm.vector.VectorSupport.*;
 
 // -- This file was mechanically generated: Do not edit! -- //
 
@@ -373,7 +371,7 @@ final class ByteVector512 extends ByteVector {
     @Override
     @ForceInline
     public final ByteShuffle512 toShuffle() {
-        return (ByteShuffle512) toShuffle(vspecies(), false);
+        return (ByteShuffle512) toShuffle(VSPECIES, false);
     }
 
     // Specialized unary testing
@@ -744,7 +742,7 @@ final class ByteVector512 extends ByteVector {
 
         @Override
         ByteMask512 uOp(MUnOp f) {
-            boolean[] res = new boolean[vspecies().laneCount()];
+            boolean[] res = new boolean[VSPECIES.laneCount()];
             boolean[] bits = getBits();
             for (int i = 0; i < res.length; i++) {
                 res[i] = f.apply(i, bits[i]);
@@ -754,7 +752,7 @@ final class ByteVector512 extends ByteVector {
 
         @Override
         ByteMask512 bOp(VectorMask<Byte> m, MBinOp f) {
-            boolean[] res = new boolean[vspecies().laneCount()];
+            boolean[] res = new boolean[VSPECIES.laneCount()];
             boolean[] bits = getBits();
             boolean[] mbits = ((ByteMask512)m).getBits();
             for (int i = 0; i < res.length; i++) {
@@ -904,16 +902,16 @@ final class ByteVector512 extends ByteVector {
         @ForceInline
         public boolean anyTrue() {
             return VectorSupport.test(BT_ne, ByteMask512.class, LANEBITS_TYPE_ORDINAL, VLENGTH,
-                                         this, vspecies().maskAll(true),
-                                         (m, __) -> anyTrueHelper(((ByteMask512)m).getBits()));
+                                         this, VSPECIES.maskAll(true),
+                                         (m, _) -> anyTrueHelper(((ByteMask512)m).getBits()));
         }
 
         @Override
         @ForceInline
         public boolean allTrue() {
             return VectorSupport.test(BT_overflow, ByteMask512.class, LANEBITS_TYPE_ORDINAL, VLENGTH,
-                                         this, vspecies().maskAll(true),
-                                         (m, __) -> allTrueHelper(((ByteMask512)m).getBits()));
+                                         this, VSPECIES.maskAll(true),
+                                         (m, _) -> allTrueHelper(((ByteMask512)m).getBits()));
         }
 
         @ForceInline
@@ -921,7 +919,7 @@ final class ByteVector512 extends ByteVector {
         static ByteMask512 maskAll(boolean bit) {
             return VectorSupport.fromBitsCoerced(ByteMask512.class, LANEBITS_TYPE_ORDINAL, VLENGTH,
                                                  (bit ? -1 : 0), MODE_BROADCAST, null,
-                                                 (v, __) -> (v != 0 ? TRUE_MASK : FALSE_MASK));
+                                                 (v, _) -> (v != 0 ? TRUE_MASK : FALSE_MASK));
         }
         private static final ByteMask512  TRUE_MASK = new ByteMask512(true);
         private static final ByteMask512 FALSE_MASK = new ByteMask512(false);
@@ -981,7 +979,7 @@ final class ByteVector512 extends ByteVector {
 
         @Override
         ByteVector512 toBitsVector0() {
-            return ((ByteVector512) vspecies().asIntegral().dummyVector()).vectorFactory(indices());
+            return ((ByteVector512) VSPECIES.asIntegral().dummyVector()).vectorFactory(indices());
         }
 
         @Override
@@ -1032,7 +1030,7 @@ final class ByteVector512 extends ByteVector {
         @ForceInline
         public final ByteMask512 laneIsValid() {
             return (ByteMask512) toBitsVector().compare(VectorOperators.GE, 0)
-                    .cast(vspecies());
+                    .cast(VSPECIES);
         }
 
         @ForceInline
@@ -1040,7 +1038,7 @@ final class ByteVector512 extends ByteVector {
         public final ByteShuffle512 rearrange(VectorShuffle<Byte> shuffle) {
             ByteShuffle512 concreteShuffle = (ByteShuffle512) shuffle;
             return (ByteShuffle512) toBitsVector().rearrange(concreteShuffle)
-                    .toShuffle(vspecies(), false);
+                    .toShuffle(VSPECIES, false);
         }
 
         @ForceInline
@@ -1053,7 +1051,7 @@ final class ByteVector512 extends ByteVector {
                 v = (ByteVector512) v.blend(v.lanewise(VectorOperators.ADD, length()),
                             v.compare(VectorOperators.LT, 0));
             }
-            return (ByteShuffle512) v.toShuffle(vspecies(), false);
+            return (ByteShuffle512) v.toShuffle(VSPECIES, false);
         }
 
         private static byte[] prepare(int[] indices, int offset) {
diff --git a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/ByteVector64.java b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/ByteVector64.java
index 50561eca0f8..d304edfc0c7 100644
--- a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/ByteVector64.java
+++ b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/ByteVector64.java
@@ -25,7 +25,6 @@
 package jdk.incubator.vector;
 
 import java.lang.foreign.MemorySegment;
-import java.lang.foreign.ValueLayout;
 import java.nio.ByteOrder;
 import java.util.Arrays;
 import java.util.Objects;
@@ -35,9 +34,8 @@ import jdk.internal.ValueBased;
 import jdk.internal.vm.annotation.ForceInline;
 import jdk.internal.vm.vector.VectorSupport;
 
-import static jdk.internal.vm.vector.VectorSupport.*;
-
 import static jdk.incubator.vector.VectorOperators.*;
+import static jdk.internal.vm.vector.VectorSupport.*;
 
 // -- This file was mechanically generated: Do not edit! -- //
 
@@ -373,7 +371,7 @@ final class ByteVector64 extends ByteVector {
     @Override
     @ForceInline
     public final ByteShuffle64 toShuffle() {
-        return (ByteShuffle64) toShuffle(vspecies(), false);
+        return (ByteShuffle64) toShuffle(VSPECIES, false);
     }
 
     // Specialized unary testing
@@ -632,7 +630,7 @@ final class ByteVector64 extends ByteVector {
 
         @Override
         ByteMask64 uOp(MUnOp f) {
-            boolean[] res = new boolean[vspecies().laneCount()];
+            boolean[] res = new boolean[VSPECIES.laneCount()];
             boolean[] bits = getBits();
             for (int i = 0; i < res.length; i++) {
                 res[i] = f.apply(i, bits[i]);
@@ -642,7 +640,7 @@ final class ByteVector64 extends ByteVector {
 
         @Override
         ByteMask64 bOp(VectorMask<Byte> m, MBinOp f) {
-            boolean[] res = new boolean[vspecies().laneCount()];
+            boolean[] res = new boolean[VSPECIES.laneCount()];
             boolean[] bits = getBits();
             boolean[] mbits = ((ByteMask64)m).getBits();
             for (int i = 0; i < res.length; i++) {
@@ -792,16 +790,16 @@ final class ByteVector64 extends ByteVector {
         @ForceInline
         public boolean anyTrue() {
             return VectorSupport.test(BT_ne, ByteMask64.class, LANEBITS_TYPE_ORDINAL, VLENGTH,
-                                         this, vspecies().maskAll(true),
-                                         (m, __) -> anyTrueHelper(((ByteMask64)m).getBits()));
+                                         this, VSPECIES.maskAll(true),
+                                         (m, _) -> anyTrueHelper(((ByteMask64)m).getBits()));
         }
 
         @Override
         @ForceInline
         public boolean allTrue() {
             return VectorSupport.test(BT_overflow, ByteMask64.class, LANEBITS_TYPE_ORDINAL, VLENGTH,
-                                         this, vspecies().maskAll(true),
-                                         (m, __) -> allTrueHelper(((ByteMask64)m).getBits()));
+                                         this, VSPECIES.maskAll(true),
+                                         (m, _) -> allTrueHelper(((ByteMask64)m).getBits()));
         }
 
         @ForceInline
@@ -809,7 +807,7 @@ final class ByteVector64 extends ByteVector {
         static ByteMask64 maskAll(boolean bit) {
             return VectorSupport.fromBitsCoerced(ByteMask64.class, LANEBITS_TYPE_ORDINAL, VLENGTH,
                                                  (bit ? -1 : 0), MODE_BROADCAST, null,
-                                                 (v, __) -> (v != 0 ? TRUE_MASK : FALSE_MASK));
+                                                 (v, _) -> (v != 0 ? TRUE_MASK : FALSE_MASK));
         }
         private static final ByteMask64  TRUE_MASK = new ByteMask64(true);
         private static final ByteMask64 FALSE_MASK = new ByteMask64(false);
@@ -869,7 +867,7 @@ final class ByteVector64 extends ByteVector {
 
         @Override
         ByteVector64 toBitsVector0() {
-            return ((ByteVector64) vspecies().asIntegral().dummyVector()).vectorFactory(indices());
+            return ((ByteVector64) VSPECIES.asIntegral().dummyVector()).vectorFactory(indices());
         }
 
         @Override
@@ -920,7 +918,7 @@ final class ByteVector64 extends ByteVector {
         @ForceInline
         public final ByteMask64 laneIsValid() {
             return (ByteMask64) toBitsVector().compare(VectorOperators.GE, 0)
-                    .cast(vspecies());
+                    .cast(VSPECIES);
         }
 
         @ForceInline
@@ -928,7 +926,7 @@ final class ByteVector64 extends ByteVector {
         public final ByteShuffle64 rearrange(VectorShuffle<Byte> shuffle) {
             ByteShuffle64 concreteShuffle = (ByteShuffle64) shuffle;
             return (ByteShuffle64) toBitsVector().rearrange(concreteShuffle)
-                    .toShuffle(vspecies(), false);
+                    .toShuffle(VSPECIES, false);
         }
 
         @ForceInline
@@ -941,7 +939,7 @@ final class ByteVector64 extends ByteVector {
                 v = (ByteVector64) v.blend(v.lanewise(VectorOperators.ADD, length()),
                             v.compare(VectorOperators.LT, 0));
             }
-            return (ByteShuffle64) v.toShuffle(vspecies(), false);
+            return (ByteShuffle64) v.toShuffle(VSPECIES, false);
         }
 
         private static byte[] prepare(int[] indices, int offset) {
diff --git a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/ByteVectorMax.java b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/ByteVectorMax.java
index ee931bbc077..0084995346b 100644
--- a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/ByteVectorMax.java
+++ b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/ByteVectorMax.java
@@ -25,7 +25,6 @@
 package jdk.incubator.vector;
 
 import java.lang.foreign.MemorySegment;
-import java.lang.foreign.ValueLayout;
 import java.nio.ByteOrder;
 import java.util.Arrays;
 import java.util.Objects;
@@ -35,9 +34,8 @@ import jdk.internal.ValueBased;
 import jdk.internal.vm.annotation.ForceInline;
 import jdk.internal.vm.vector.VectorSupport;
 
-import static jdk.internal.vm.vector.VectorSupport.*;
-
 import static jdk.incubator.vector.VectorOperators.*;
+import static jdk.internal.vm.vector.VectorSupport.*;
 
 // -- This file was mechanically generated: Do not edit! -- //
 
@@ -373,7 +371,7 @@ final class ByteVectorMax extends ByteVector {
     @Override
     @ForceInline
     public final ByteShuffleMax toShuffle() {
-        return (ByteShuffleMax) toShuffle(vspecies(), false);
+        return (ByteShuffleMax) toShuffle(VSPECIES, false);
     }
 
     // Specialized unary testing
@@ -618,7 +616,7 @@ final class ByteVectorMax extends ByteVector {
 
         @Override
         ByteMaskMax uOp(MUnOp f) {
-            boolean[] res = new boolean[vspecies().laneCount()];
+            boolean[] res = new boolean[VSPECIES.laneCount()];
             boolean[] bits = getBits();
             for (int i = 0; i < res.length; i++) {
                 res[i] = f.apply(i, bits[i]);
@@ -628,7 +626,7 @@ final class ByteVectorMax extends ByteVector {
 
         @Override
         ByteMaskMax bOp(VectorMask<Byte> m, MBinOp f) {
-            boolean[] res = new boolean[vspecies().laneCount()];
+            boolean[] res = new boolean[VSPECIES.laneCount()];
             boolean[] bits = getBits();
             boolean[] mbits = ((ByteMaskMax)m).getBits();
             for (int i = 0; i < res.length; i++) {
@@ -778,16 +776,16 @@ final class ByteVectorMax extends ByteVector {
         @ForceInline
         public boolean anyTrue() {
             return VectorSupport.test(BT_ne, ByteMaskMax.class, LANEBITS_TYPE_ORDINAL, VLENGTH,
-                                         this, vspecies().maskAll(true),
-                                         (m, __) -> anyTrueHelper(((ByteMaskMax)m).getBits()));
+                                         this, VSPECIES.maskAll(true),
+                                         (m, _) -> anyTrueHelper(((ByteMaskMax)m).getBits()));
         }
 
         @Override
         @ForceInline
         public boolean allTrue() {
             return VectorSupport.test(BT_overflow, ByteMaskMax.class, LANEBITS_TYPE_ORDINAL, VLENGTH,
-                                         this, vspecies().maskAll(true),
-                                         (m, __) -> allTrueHelper(((ByteMaskMax)m).getBits()));
+                                         this, VSPECIES.maskAll(true),
+                                         (m, _) -> allTrueHelper(((ByteMaskMax)m).getBits()));
         }
 
         @ForceInline
@@ -795,7 +793,7 @@ final class ByteVectorMax extends ByteVector {
         static ByteMaskMax maskAll(boolean bit) {
             return VectorSupport.fromBitsCoerced(ByteMaskMax.class, LANEBITS_TYPE_ORDINAL, VLENGTH,
                                                  (bit ? -1 : 0), MODE_BROADCAST, null,
-                                                 (v, __) -> (v != 0 ? TRUE_MASK : FALSE_MASK));
+                                                 (v, _) -> (v != 0 ? TRUE_MASK : FALSE_MASK));
         }
         private static final ByteMaskMax  TRUE_MASK = new ByteMaskMax(true);
         private static final ByteMaskMax FALSE_MASK = new ByteMaskMax(false);
@@ -855,7 +853,7 @@ final class ByteVectorMax extends ByteVector {
 
         @Override
         ByteVectorMax toBitsVector0() {
-            return ((ByteVectorMax) vspecies().asIntegral().dummyVector()).vectorFactory(indices());
+            return ((ByteVectorMax) VSPECIES.asIntegral().dummyVector()).vectorFactory(indices());
         }
 
         @Override
@@ -906,7 +904,7 @@ final class ByteVectorMax extends ByteVector {
         @ForceInline
         public final ByteMaskMax laneIsValid() {
             return (ByteMaskMax) toBitsVector().compare(VectorOperators.GE, 0)
-                    .cast(vspecies());
+                    .cast(VSPECIES);
         }
 
         @ForceInline
@@ -914,7 +912,7 @@ final class ByteVectorMax extends ByteVector {
         public final ByteShuffleMax rearrange(VectorShuffle<Byte> shuffle) {
             ByteShuffleMax concreteShuffle = (ByteShuffleMax) shuffle;
             return (ByteShuffleMax) toBitsVector().rearrange(concreteShuffle)
-                    .toShuffle(vspecies(), false);
+                    .toShuffle(VSPECIES, false);
         }
 
         @ForceInline
@@ -927,7 +925,7 @@ final class ByteVectorMax extends ByteVector {
                 v = (ByteVectorMax) v.blend(v.lanewise(VectorOperators.ADD, length()),
                             v.compare(VectorOperators.LT, 0));
             }
-            return (ByteShuffleMax) v.toShuffle(vspecies(), false);
+            return (ByteShuffleMax) v.toShuffle(VSPECIES, false);
         }
 
         private static byte[] prepare(int[] indices, int offset) {
diff --git a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/CPUFeatures.java b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/CPUFeatures.java
index c0d8ef03ada..0ad7ba1651d 100644
--- a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/CPUFeatures.java
+++ b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/CPUFeatures.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2025, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -36,7 +36,7 @@ import static jdk.internal.vm.vector.Utils.debug;
 /**
  * Enumerates CPU ISA extensions supported by the JVM on the current hardware.
  */
-/*package-private*/ class CPUFeatures {
+/*package-private*/ final class CPUFeatures {
     private static final Set<String> features = getCPUFeatures();
 
     private static Set<String> getCPUFeatures() {
diff --git a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/DoubleVector.java b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/DoubleVector.java
index 5e7c97dc56d..6f9b5e53ead 100644
--- a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/DoubleVector.java
+++ b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/DoubleVector.java
@@ -49,7 +49,8 @@ import static jdk.incubator.vector.VectorOperators.*;
  * {@code double} values.
  */
 @SuppressWarnings("cast")  // warning: redundant cast
-public abstract class DoubleVector extends AbstractVector<Double> {
+public abstract sealed class DoubleVector extends AbstractVector<Double>
+         permits DoubleVector64, DoubleVector128, DoubleVector256, DoubleVector512, DoubleVectorMax {
 
     DoubleVector(double[] vec) {
         super(vec);
diff --git a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/DoubleVector128.java b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/DoubleVector128.java
index 43c7e3f0c46..8d3ec21ec9b 100644
--- a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/DoubleVector128.java
+++ b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/DoubleVector128.java
@@ -35,9 +35,8 @@ import jdk.internal.ValueBased;
 import jdk.internal.vm.annotation.ForceInline;
 import jdk.internal.vm.vector.VectorSupport;
 
-import static jdk.internal.vm.vector.VectorSupport.*;
-
 import static jdk.incubator.vector.VectorOperators.*;
+import static jdk.internal.vm.vector.VectorSupport.*;
 
 // -- This file was mechanically generated: Do not edit! -- //
 
@@ -360,7 +359,7 @@ final class DoubleVector128 extends DoubleVector {
     @Override
     @ForceInline
     public final DoubleShuffle128 toShuffle() {
-        return (DoubleShuffle128) toShuffle(vspecies(), false);
+        return (DoubleShuffle128) toShuffle(VSPECIES, false);
     }
 
     // Specialized unary testing
@@ -609,7 +608,7 @@ final class DoubleVector128 extends DoubleVector {
 
         @Override
         DoubleMask128 uOp(MUnOp f) {
-            boolean[] res = new boolean[vspecies().laneCount()];
+            boolean[] res = new boolean[VSPECIES.laneCount()];
             boolean[] bits = getBits();
             for (int i = 0; i < res.length; i++) {
                 res[i] = f.apply(i, bits[i]);
@@ -619,7 +618,7 @@ final class DoubleVector128 extends DoubleVector {
 
         @Override
         DoubleMask128 bOp(VectorMask<Double> m, MBinOp f) {
-            boolean[] res = new boolean[vspecies().laneCount()];
+            boolean[] res = new boolean[VSPECIES.laneCount()];
             boolean[] bits = getBits();
             boolean[] mbits = ((DoubleMask128)m).getBits();
             for (int i = 0; i < res.length; i++) {
@@ -769,16 +768,16 @@ final class DoubleVector128 extends DoubleVector {
         @ForceInline
         public boolean anyTrue() {
             return VectorSupport.test(BT_ne, DoubleMask128.class, LANEBITS_TYPE_ORDINAL, VLENGTH,
-                                         this, vspecies().maskAll(true),
-                                         (m, __) -> anyTrueHelper(((DoubleMask128)m).getBits()));
+                                         this, VSPECIES.maskAll(true),
+                                         (m, _) -> anyTrueHelper(((DoubleMask128)m).getBits()));
         }
 
         @Override
         @ForceInline
         public boolean allTrue() {
             return VectorSupport.test(BT_overflow, DoubleMask128.class, LANEBITS_TYPE_ORDINAL, VLENGTH,
-                                         this, vspecies().maskAll(true),
-                                         (m, __) -> allTrueHelper(((DoubleMask128)m).getBits()));
+                                         this, VSPECIES.maskAll(true),
+                                         (m, _) -> allTrueHelper(((DoubleMask128)m).getBits()));
         }
 
         @ForceInline
@@ -786,7 +785,7 @@ final class DoubleVector128 extends DoubleVector {
         static DoubleMask128 maskAll(boolean bit) {
             return VectorSupport.fromBitsCoerced(DoubleMask128.class, LANEBITS_TYPE_ORDINAL, VLENGTH,
                                                  (bit ? -1 : 0), MODE_BROADCAST, null,
-                                                 (v, __) -> (v != 0 ? TRUE_MASK : FALSE_MASK));
+                                                 (v, _) -> (v != 0 ? TRUE_MASK : FALSE_MASK));
         }
         private static final DoubleMask128  TRUE_MASK = new DoubleMask128(true);
         private static final DoubleMask128 FALSE_MASK = new DoubleMask128(false);
@@ -835,7 +834,7 @@ final class DoubleVector128 extends DoubleVector {
         @Override
         @ForceInline
         public DoubleVector128 toVector() {
-            return (DoubleVector128) toBitsVector().castShape(vspecies(), 0);
+            return (DoubleVector128) toBitsVector().castShape(VSPECIES, 0);
         }
 
         @Override
@@ -846,7 +845,7 @@ final class DoubleVector128 extends DoubleVector {
 
         @Override
         LongVector128 toBitsVector0() {
-            return ((LongVector128) vspecies().asIntegral().dummyVector()).vectorFactory(indices());
+            return ((LongVector128) VSPECIES.asIntegral().dummyVector()).vectorFactory(indices());
         }
 
         @Override
@@ -920,7 +919,7 @@ final class DoubleVector128 extends DoubleVector {
         @ForceInline
         public final DoubleMask128 laneIsValid() {
             return (DoubleMask128) toBitsVector().compare(VectorOperators.GE, 0)
-                    .cast(vspecies());
+                    .cast(VSPECIES);
         }
 
         @ForceInline
@@ -928,7 +927,7 @@ final class DoubleVector128 extends DoubleVector {
         public final DoubleShuffle128 rearrange(VectorShuffle<Double> shuffle) {
             DoubleShuffle128 concreteShuffle = (DoubleShuffle128) shuffle;
             return (DoubleShuffle128) toBitsVector().rearrange(concreteShuffle.cast(LongVector.SPECIES_128))
-                    .toShuffle(vspecies(), false);
+                    .toShuffle(VSPECIES, false);
         }
 
         @ForceInline
@@ -941,7 +940,7 @@ final class DoubleVector128 extends DoubleVector {
                 v = (LongVector128) v.blend(v.lanewise(VectorOperators.ADD, length()),
                             v.compare(VectorOperators.LT, 0));
             }
-            return (DoubleShuffle128) v.toShuffle(vspecies(), false);
+            return (DoubleShuffle128) v.toShuffle(VSPECIES, false);
         }
 
         private static long[] prepare(int[] indices, int offset) {
diff --git a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/DoubleVector256.java b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/DoubleVector256.java
index 5f176854dbd..c6bb4b7e3d3 100644
--- a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/DoubleVector256.java
+++ b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/DoubleVector256.java
@@ -35,9 +35,8 @@ import jdk.internal.ValueBased;
 import jdk.internal.vm.annotation.ForceInline;
 import jdk.internal.vm.vector.VectorSupport;
 
-import static jdk.internal.vm.vector.VectorSupport.*;
-
 import static jdk.incubator.vector.VectorOperators.*;
+import static jdk.internal.vm.vector.VectorSupport.*;
 
 // -- This file was mechanically generated: Do not edit! -- //
 
@@ -360,7 +359,7 @@ final class DoubleVector256 extends DoubleVector {
     @Override
     @ForceInline
     public final DoubleShuffle256 toShuffle() {
-        return (DoubleShuffle256) toShuffle(vspecies(), false);
+        return (DoubleShuffle256) toShuffle(VSPECIES, false);
     }
 
     // Specialized unary testing
@@ -613,7 +612,7 @@ final class DoubleVector256 extends DoubleVector {
 
         @Override
         DoubleMask256 uOp(MUnOp f) {
-            boolean[] res = new boolean[vspecies().laneCount()];
+            boolean[] res = new boolean[VSPECIES.laneCount()];
             boolean[] bits = getBits();
             for (int i = 0; i < res.length; i++) {
                 res[i] = f.apply(i, bits[i]);
@@ -623,7 +622,7 @@ final class DoubleVector256 extends DoubleVector {
 
         @Override
         DoubleMask256 bOp(VectorMask<Double> m, MBinOp f) {
-            boolean[] res = new boolean[vspecies().laneCount()];
+            boolean[] res = new boolean[VSPECIES.laneCount()];
             boolean[] bits = getBits();
             boolean[] mbits = ((DoubleMask256)m).getBits();
             for (int i = 0; i < res.length; i++) {
@@ -773,16 +772,16 @@ final class DoubleVector256 extends DoubleVector {
         @ForceInline
         public boolean anyTrue() {
             return VectorSupport.test(BT_ne, DoubleMask256.class, LANEBITS_TYPE_ORDINAL, VLENGTH,
-                                         this, vspecies().maskAll(true),
-                                         (m, __) -> anyTrueHelper(((DoubleMask256)m).getBits()));
+                                         this, VSPECIES.maskAll(true),
+                                         (m, _) -> anyTrueHelper(((DoubleMask256)m).getBits()));
         }
 
         @Override
         @ForceInline
         public boolean allTrue() {
             return VectorSupport.test(BT_overflow, DoubleMask256.class, LANEBITS_TYPE_ORDINAL, VLENGTH,
-                                         this, vspecies().maskAll(true),
-                                         (m, __) -> allTrueHelper(((DoubleMask256)m).getBits()));
+                                         this, VSPECIES.maskAll(true),
+                                         (m, _) -> allTrueHelper(((DoubleMask256)m).getBits()));
         }
 
         @ForceInline
@@ -790,7 +789,7 @@ final class DoubleVector256 extends DoubleVector {
         static DoubleMask256 maskAll(boolean bit) {
             return VectorSupport.fromBitsCoerced(DoubleMask256.class, LANEBITS_TYPE_ORDINAL, VLENGTH,
                                                  (bit ? -1 : 0), MODE_BROADCAST, null,
-                                                 (v, __) -> (v != 0 ? TRUE_MASK : FALSE_MASK));
+                                                 (v, _) -> (v != 0 ? TRUE_MASK : FALSE_MASK));
         }
         private static final DoubleMask256  TRUE_MASK = new DoubleMask256(true);
         private static final DoubleMask256 FALSE_MASK = new DoubleMask256(false);
@@ -839,7 +838,7 @@ final class DoubleVector256 extends DoubleVector {
         @Override
         @ForceInline
         public DoubleVector256 toVector() {
-            return (DoubleVector256) toBitsVector().castShape(vspecies(), 0);
+            return (DoubleVector256) toBitsVector().castShape(VSPECIES, 0);
         }
 
         @Override
@@ -850,7 +849,7 @@ final class DoubleVector256 extends DoubleVector {
 
         @Override
         LongVector256 toBitsVector0() {
-            return ((LongVector256) vspecies().asIntegral().dummyVector()).vectorFactory(indices());
+            return ((LongVector256) VSPECIES.asIntegral().dummyVector()).vectorFactory(indices());
         }
 
         @Override
@@ -924,7 +923,7 @@ final class DoubleVector256 extends DoubleVector {
         @ForceInline
         public final DoubleMask256 laneIsValid() {
             return (DoubleMask256) toBitsVector().compare(VectorOperators.GE, 0)
-                    .cast(vspecies());
+                    .cast(VSPECIES);
         }
 
         @ForceInline
@@ -932,7 +931,7 @@ final class DoubleVector256 extends DoubleVector {
         public final DoubleShuffle256 rearrange(VectorShuffle<Double> shuffle) {
             DoubleShuffle256 concreteShuffle = (DoubleShuffle256) shuffle;
             return (DoubleShuffle256) toBitsVector().rearrange(concreteShuffle.cast(LongVector.SPECIES_256))
-                    .toShuffle(vspecies(), false);
+                    .toShuffle(VSPECIES, false);
         }
 
         @ForceInline
@@ -945,7 +944,7 @@ final class DoubleVector256 extends DoubleVector {
                 v = (LongVector256) v.blend(v.lanewise(VectorOperators.ADD, length()),
                             v.compare(VectorOperators.LT, 0));
             }
-            return (DoubleShuffle256) v.toShuffle(vspecies(), false);
+            return (DoubleShuffle256) v.toShuffle(VSPECIES, false);
         }
 
         private static long[] prepare(int[] indices, int offset) {
diff --git a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/DoubleVector512.java b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/DoubleVector512.java
index 0696f48163d..fb1441efc63 100644
--- a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/DoubleVector512.java
+++ b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/DoubleVector512.java
@@ -35,9 +35,8 @@ import jdk.internal.ValueBased;
 import jdk.internal.vm.annotation.ForceInline;
 import jdk.internal.vm.vector.VectorSupport;
 
-import static jdk.internal.vm.vector.VectorSupport.*;
-
 import static jdk.incubator.vector.VectorOperators.*;
+import static jdk.internal.vm.vector.VectorSupport.*;
 
 // -- This file was mechanically generated: Do not edit! -- //
 
@@ -360,7 +359,7 @@ final class DoubleVector512 extends DoubleVector {
     @Override
     @ForceInline
     public final DoubleShuffle512 toShuffle() {
-        return (DoubleShuffle512) toShuffle(vspecies(), false);
+        return (DoubleShuffle512) toShuffle(VSPECIES, false);
     }
 
     // Specialized unary testing
@@ -621,7 +620,7 @@ final class DoubleVector512 extends DoubleVector {
 
         @Override
         DoubleMask512 uOp(MUnOp f) {
-            boolean[] res = new boolean[vspecies().laneCount()];
+            boolean[] res = new boolean[VSPECIES.laneCount()];
             boolean[] bits = getBits();
             for (int i = 0; i < res.length; i++) {
                 res[i] = f.apply(i, bits[i]);
@@ -631,7 +630,7 @@ final class DoubleVector512 extends DoubleVector {
 
         @Override
         DoubleMask512 bOp(VectorMask<Double> m, MBinOp f) {
-            boolean[] res = new boolean[vspecies().laneCount()];
+            boolean[] res = new boolean[VSPECIES.laneCount()];
             boolean[] bits = getBits();
             boolean[] mbits = ((DoubleMask512)m).getBits();
             for (int i = 0; i < res.length; i++) {
@@ -781,16 +780,16 @@ final class DoubleVector512 extends DoubleVector {
         @ForceInline
         public boolean anyTrue() {
             return VectorSupport.test(BT_ne, DoubleMask512.class, LANEBITS_TYPE_ORDINAL, VLENGTH,
-                                         this, vspecies().maskAll(true),
-                                         (m, __) -> anyTrueHelper(((DoubleMask512)m).getBits()));
+                                         this, VSPECIES.maskAll(true),
+                                         (m, _) -> anyTrueHelper(((DoubleMask512)m).getBits()));
         }
 
         @Override
         @ForceInline
         public boolean allTrue() {
             return VectorSupport.test(BT_overflow, DoubleMask512.class, LANEBITS_TYPE_ORDINAL, VLENGTH,
-                                         this, vspecies().maskAll(true),
-                                         (m, __) -> allTrueHelper(((DoubleMask512)m).getBits()));
+                                         this, VSPECIES.maskAll(true),
+                                         (m, _) -> allTrueHelper(((DoubleMask512)m).getBits()));
         }
 
         @ForceInline
@@ -798,7 +797,7 @@ final class DoubleVector512 extends DoubleVector {
         static DoubleMask512 maskAll(boolean bit) {
             return VectorSupport.fromBitsCoerced(DoubleMask512.class, LANEBITS_TYPE_ORDINAL, VLENGTH,
                                                  (bit ? -1 : 0), MODE_BROADCAST, null,
-                                                 (v, __) -> (v != 0 ? TRUE_MASK : FALSE_MASK));
+                                                 (v, _) -> (v != 0 ? TRUE_MASK : FALSE_MASK));
         }
         private static final DoubleMask512  TRUE_MASK = new DoubleMask512(true);
         private static final DoubleMask512 FALSE_MASK = new DoubleMask512(false);
@@ -847,7 +846,7 @@ final class DoubleVector512 extends DoubleVector {
         @Override
         @ForceInline
         public DoubleVector512 toVector() {
-            return (DoubleVector512) toBitsVector().castShape(vspecies(), 0);
+            return (DoubleVector512) toBitsVector().castShape(VSPECIES, 0);
         }
 
         @Override
@@ -858,7 +857,7 @@ final class DoubleVector512 extends DoubleVector {
 
         @Override
         LongVector512 toBitsVector0() {
-            return ((LongVector512) vspecies().asIntegral().dummyVector()).vectorFactory(indices());
+            return ((LongVector512) VSPECIES.asIntegral().dummyVector()).vectorFactory(indices());
         }
 
         @Override
@@ -932,7 +931,7 @@ final class DoubleVector512 extends DoubleVector {
         @ForceInline
         public final DoubleMask512 laneIsValid() {
             return (DoubleMask512) toBitsVector().compare(VectorOperators.GE, 0)
-                    .cast(vspecies());
+                    .cast(VSPECIES);
         }
 
         @ForceInline
@@ -940,7 +939,7 @@ final class DoubleVector512 extends DoubleVector {
         public final DoubleShuffle512 rearrange(VectorShuffle<Double> shuffle) {
             DoubleShuffle512 concreteShuffle = (DoubleShuffle512) shuffle;
             return (DoubleShuffle512) toBitsVector().rearrange(concreteShuffle.cast(LongVector.SPECIES_512))
-                    .toShuffle(vspecies(), false);
+                    .toShuffle(VSPECIES, false);
         }
 
         @ForceInline
@@ -953,7 +952,7 @@ final class DoubleVector512 extends DoubleVector {
                 v = (LongVector512) v.blend(v.lanewise(VectorOperators.ADD, length()),
                             v.compare(VectorOperators.LT, 0));
             }
-            return (DoubleShuffle512) v.toShuffle(vspecies(), false);
+            return (DoubleShuffle512) v.toShuffle(VSPECIES, false);
         }
 
         private static long[] prepare(int[] indices, int offset) {
diff --git a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/DoubleVector64.java b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/DoubleVector64.java
index 5b74c2c4619..5583cff80e1 100644
--- a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/DoubleVector64.java
+++ b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/DoubleVector64.java
@@ -35,9 +35,8 @@ import jdk.internal.ValueBased;
 import jdk.internal.vm.annotation.ForceInline;
 import jdk.internal.vm.vector.VectorSupport;
 
-import static jdk.internal.vm.vector.VectorSupport.*;
-
 import static jdk.incubator.vector.VectorOperators.*;
+import static jdk.internal.vm.vector.VectorSupport.*;
 
 // -- This file was mechanically generated: Do not edit! -- //
 
@@ -360,7 +359,7 @@ final class DoubleVector64 extends DoubleVector {
     @Override
     @ForceInline
     public final DoubleShuffle64 toShuffle() {
-        return (DoubleShuffle64) toShuffle(vspecies(), false);
+        return (DoubleShuffle64) toShuffle(VSPECIES, false);
     }
 
     // Specialized unary testing
@@ -607,7 +606,7 @@ final class DoubleVector64 extends DoubleVector {
 
         @Override
         DoubleMask64 uOp(MUnOp f) {
-            boolean[] res = new boolean[vspecies().laneCount()];
+            boolean[] res = new boolean[VSPECIES.laneCount()];
             boolean[] bits = getBits();
             for (int i = 0; i < res.length; i++) {
                 res[i] = f.apply(i, bits[i]);
@@ -617,7 +616,7 @@ final class DoubleVector64 extends DoubleVector {
 
         @Override
         DoubleMask64 bOp(VectorMask<Double> m, MBinOp f) {
-            boolean[] res = new boolean[vspecies().laneCount()];
+            boolean[] res = new boolean[VSPECIES.laneCount()];
             boolean[] bits = getBits();
             boolean[] mbits = ((DoubleMask64)m).getBits();
             for (int i = 0; i < res.length; i++) {
@@ -767,16 +766,16 @@ final class DoubleVector64 extends DoubleVector {
         @ForceInline
         public boolean anyTrue() {
             return VectorSupport.test(BT_ne, DoubleMask64.class, LANEBITS_TYPE_ORDINAL, VLENGTH,
-                                         this, vspecies().maskAll(true),
-                                         (m, __) -> anyTrueHelper(((DoubleMask64)m).getBits()));
+                                         this, VSPECIES.maskAll(true),
+                                         (m, _) -> anyTrueHelper(((DoubleMask64)m).getBits()));
         }
 
         @Override
         @ForceInline
         public boolean allTrue() {
             return VectorSupport.test(BT_overflow, DoubleMask64.class, LANEBITS_TYPE_ORDINAL, VLENGTH,
-                                         this, vspecies().maskAll(true),
-                                         (m, __) -> allTrueHelper(((DoubleMask64)m).getBits()));
+                                         this, VSPECIES.maskAll(true),
+                                         (m, _) -> allTrueHelper(((DoubleMask64)m).getBits()));
         }
 
         @ForceInline
@@ -784,7 +783,7 @@ final class DoubleVector64 extends DoubleVector {
         static DoubleMask64 maskAll(boolean bit) {
             return VectorSupport.fromBitsCoerced(DoubleMask64.class, LANEBITS_TYPE_ORDINAL, VLENGTH,
                                                  (bit ? -1 : 0), MODE_BROADCAST, null,
-                                                 (v, __) -> (v != 0 ? TRUE_MASK : FALSE_MASK));
+                                                 (v, _) -> (v != 0 ? TRUE_MASK : FALSE_MASK));
         }
         private static final DoubleMask64  TRUE_MASK = new DoubleMask64(true);
         private static final DoubleMask64 FALSE_MASK = new DoubleMask64(false);
@@ -833,7 +832,7 @@ final class DoubleVector64 extends DoubleVector {
         @Override
         @ForceInline
         public DoubleVector64 toVector() {
-            return (DoubleVector64) toBitsVector().castShape(vspecies(), 0);
+            return (DoubleVector64) toBitsVector().castShape(VSPECIES, 0);
         }
 
         @Override
@@ -844,7 +843,7 @@ final class DoubleVector64 extends DoubleVector {
 
         @Override
         LongVector64 toBitsVector0() {
-            return ((LongVector64) vspecies().asIntegral().dummyVector()).vectorFactory(indices());
+            return ((LongVector64) VSPECIES.asIntegral().dummyVector()).vectorFactory(indices());
         }
 
         @Override
@@ -918,7 +917,7 @@ final class DoubleVector64 extends DoubleVector {
         @ForceInline
         public final DoubleMask64 laneIsValid() {
             return (DoubleMask64) toBitsVector().compare(VectorOperators.GE, 0)
-                    .cast(vspecies());
+                    .cast(VSPECIES);
         }
 
         @ForceInline
@@ -926,7 +925,7 @@ final class DoubleVector64 extends DoubleVector {
         public final DoubleShuffle64 rearrange(VectorShuffle<Double> shuffle) {
             DoubleShuffle64 concreteShuffle = (DoubleShuffle64) shuffle;
             return (DoubleShuffle64) toBitsVector().rearrange(concreteShuffle.cast(LongVector.SPECIES_64))
-                    .toShuffle(vspecies(), false);
+                    .toShuffle(VSPECIES, false);
         }
 
         @ForceInline
@@ -939,7 +938,7 @@ final class DoubleVector64 extends DoubleVector {
                 v = (LongVector64) v.blend(v.lanewise(VectorOperators.ADD, length()),
                             v.compare(VectorOperators.LT, 0));
             }
-            return (DoubleShuffle64) v.toShuffle(vspecies(), false);
+            return (DoubleShuffle64) v.toShuffle(VSPECIES, false);
         }
 
         private static long[] prepare(int[] indices, int offset) {
diff --git a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/DoubleVectorMax.java b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/DoubleVectorMax.java
index 07d227d641a..41272a5a5e5 100644
--- a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/DoubleVectorMax.java
+++ b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/DoubleVectorMax.java
@@ -35,9 +35,8 @@ import jdk.internal.ValueBased;
 import jdk.internal.vm.annotation.ForceInline;
 import jdk.internal.vm.vector.VectorSupport;
 
-import static jdk.internal.vm.vector.VectorSupport.*;
-
 import static jdk.incubator.vector.VectorOperators.*;
+import static jdk.internal.vm.vector.VectorSupport.*;
 
 // -- This file was mechanically generated: Do not edit! -- //
 
@@ -360,7 +359,7 @@ final class DoubleVectorMax extends DoubleVector {
     @Override
     @ForceInline
     public final DoubleShuffleMax toShuffle() {
-        return (DoubleShuffleMax) toShuffle(vspecies(), false);
+        return (DoubleShuffleMax) toShuffle(VSPECIES, false);
     }
 
     // Specialized unary testing
@@ -606,7 +605,7 @@ final class DoubleVectorMax extends DoubleVector {
 
         @Override
         DoubleMaskMax uOp(MUnOp f) {
-            boolean[] res = new boolean[vspecies().laneCount()];
+            boolean[] res = new boolean[VSPECIES.laneCount()];
             boolean[] bits = getBits();
             for (int i = 0; i < res.length; i++) {
                 res[i] = f.apply(i, bits[i]);
@@ -616,7 +615,7 @@ final class DoubleVectorMax extends DoubleVector {
 
         @Override
         DoubleMaskMax bOp(VectorMask<Double> m, MBinOp f) {
-            boolean[] res = new boolean[vspecies().laneCount()];
+            boolean[] res = new boolean[VSPECIES.laneCount()];
             boolean[] bits = getBits();
             boolean[] mbits = ((DoubleMaskMax)m).getBits();
             for (int i = 0; i < res.length; i++) {
@@ -766,16 +765,16 @@ final class DoubleVectorMax extends DoubleVector {
         @ForceInline
         public boolean anyTrue() {
             return VectorSupport.test(BT_ne, DoubleMaskMax.class, LANEBITS_TYPE_ORDINAL, VLENGTH,
-                                         this, vspecies().maskAll(true),
-                                         (m, __) -> anyTrueHelper(((DoubleMaskMax)m).getBits()));
+                                         this, VSPECIES.maskAll(true),
+                                         (m, _) -> anyTrueHelper(((DoubleMaskMax)m).getBits()));
         }
 
         @Override
         @ForceInline
         public boolean allTrue() {
             return VectorSupport.test(BT_overflow, DoubleMaskMax.class, LANEBITS_TYPE_ORDINAL, VLENGTH,
-                                         this, vspecies().maskAll(true),
-                                         (m, __) -> allTrueHelper(((DoubleMaskMax)m).getBits()));
+                                         this, VSPECIES.maskAll(true),
+                                         (m, _) -> allTrueHelper(((DoubleMaskMax)m).getBits()));
         }
 
         @ForceInline
@@ -783,7 +782,7 @@ final class DoubleVectorMax extends DoubleVector {
         static DoubleMaskMax maskAll(boolean bit) {
             return VectorSupport.fromBitsCoerced(DoubleMaskMax.class, LANEBITS_TYPE_ORDINAL, VLENGTH,
                                                  (bit ? -1 : 0), MODE_BROADCAST, null,
-                                                 (v, __) -> (v != 0 ? TRUE_MASK : FALSE_MASK));
+                                                 (v, _) -> (v != 0 ? TRUE_MASK : FALSE_MASK));
         }
         private static final DoubleMaskMax  TRUE_MASK = new DoubleMaskMax(true);
         private static final DoubleMaskMax FALSE_MASK = new DoubleMaskMax(false);
@@ -832,7 +831,7 @@ final class DoubleVectorMax extends DoubleVector {
         @Override
         @ForceInline
         public DoubleVectorMax toVector() {
-            return (DoubleVectorMax) toBitsVector().castShape(vspecies(), 0);
+            return (DoubleVectorMax) toBitsVector().castShape(VSPECIES, 0);
         }
 
         @Override
@@ -843,7 +842,7 @@ final class DoubleVectorMax extends DoubleVector {
 
         @Override
         LongVectorMax toBitsVector0() {
-            return ((LongVectorMax) vspecies().asIntegral().dummyVector()).vectorFactory(indices());
+            return ((LongVectorMax) VSPECIES.asIntegral().dummyVector()).vectorFactory(indices());
         }
 
         @Override
@@ -917,7 +916,7 @@ final class DoubleVectorMax extends DoubleVector {
         @ForceInline
         public final DoubleMaskMax laneIsValid() {
             return (DoubleMaskMax) toBitsVector().compare(VectorOperators.GE, 0)
-                    .cast(vspecies());
+                    .cast(VSPECIES);
         }
 
         @ForceInline
@@ -925,7 +924,7 @@ final class DoubleVectorMax extends DoubleVector {
         public final DoubleShuffleMax rearrange(VectorShuffle<Double> shuffle) {
             DoubleShuffleMax concreteShuffle = (DoubleShuffleMax) shuffle;
             return (DoubleShuffleMax) toBitsVector().rearrange(concreteShuffle.cast(LongVector.SPECIES_MAX))
-                    .toShuffle(vspecies(), false);
+                    .toShuffle(VSPECIES, false);
         }
 
         @ForceInline
@@ -938,7 +937,7 @@ final class DoubleVectorMax extends DoubleVector {
                 v = (LongVectorMax) v.blend(v.lanewise(VectorOperators.ADD, length()),
                             v.compare(VectorOperators.LT, 0));
             }
-            return (DoubleShuffleMax) v.toShuffle(vspecies(), false);
+            return (DoubleShuffleMax) v.toShuffle(VSPECIES, false);
         }
 
         private static long[] prepare(int[] indices, int offset) {
diff --git a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/Float16Consts.java b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/Float16Consts.java
index 48c4d2199b1..b70b11b0a49 100644
--- a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/Float16Consts.java
+++ b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/Float16Consts.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2024, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -34,7 +34,7 @@ import static jdk.incubator.vector.Float16.SIZE;
  * {@code Float16} type.
  */
 
-class Float16Consts {
+final class Float16Consts {
     /**
      * Don't let anyone instantiate this class.
      */
diff --git a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/FloatVector.java b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/FloatVector.java
index 5862a295fa3..cdf2532e4d9 100644
--- a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/FloatVector.java
+++ b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/FloatVector.java
@@ -49,7 +49,8 @@ import static jdk.incubator.vector.VectorOperators.*;
  * {@code float} values.
  */
 @SuppressWarnings("cast")  // warning: redundant cast
-public abstract class FloatVector extends AbstractVector<Float> {
+public abstract sealed class FloatVector extends AbstractVector<Float>
+         permits FloatVector64, FloatVector128, FloatVector256, FloatVector512, FloatVectorMax {
 
     FloatVector(float[] vec) {
         super(vec);
diff --git a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/FloatVector128.java b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/FloatVector128.java
index 17c1fdba4fc..24888e966da 100644
--- a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/FloatVector128.java
+++ b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/FloatVector128.java
@@ -25,7 +25,6 @@
 package jdk.incubator.vector;
 
 import java.lang.foreign.MemorySegment;
-import java.lang.foreign.ValueLayout;
 import java.nio.ByteOrder;
 import java.util.Arrays;
 import java.util.Objects;
@@ -35,9 +34,8 @@ import jdk.internal.ValueBased;
 import jdk.internal.vm.annotation.ForceInline;
 import jdk.internal.vm.vector.VectorSupport;
 
-import static jdk.internal.vm.vector.VectorSupport.*;
-
 import static jdk.incubator.vector.VectorOperators.*;
+import static jdk.internal.vm.vector.VectorSupport.*;
 
 // -- This file was mechanically generated: Do not edit! -- //
 
@@ -360,7 +358,7 @@ final class FloatVector128 extends FloatVector {
     @Override
     @ForceInline
     public final FloatShuffle128 toShuffle() {
-        return (FloatShuffle128) toShuffle(vspecies(), false);
+        return (FloatShuffle128) toShuffle(VSPECIES, false);
     }
 
     // Specialized unary testing
@@ -613,7 +611,7 @@ final class FloatVector128 extends FloatVector {
 
         @Override
         FloatMask128 uOp(MUnOp f) {
-            boolean[] res = new boolean[vspecies().laneCount()];
+            boolean[] res = new boolean[VSPECIES.laneCount()];
             boolean[] bits = getBits();
             for (int i = 0; i < res.length; i++) {
                 res[i] = f.apply(i, bits[i]);
@@ -623,7 +621,7 @@ final class FloatVector128 extends FloatVector {
 
         @Override
         FloatMask128 bOp(VectorMask<Float> m, MBinOp f) {
-            boolean[] res = new boolean[vspecies().laneCount()];
+            boolean[] res = new boolean[VSPECIES.laneCount()];
             boolean[] bits = getBits();
             boolean[] mbits = ((FloatMask128)m).getBits();
             for (int i = 0; i < res.length; i++) {
@@ -773,16 +771,16 @@ final class FloatVector128 extends FloatVector {
         @ForceInline
         public boolean anyTrue() {
             return VectorSupport.test(BT_ne, FloatMask128.class, LANEBITS_TYPE_ORDINAL, VLENGTH,
-                                         this, vspecies().maskAll(true),
-                                         (m, __) -> anyTrueHelper(((FloatMask128)m).getBits()));
+                                         this, VSPECIES.maskAll(true),
+                                         (m, _) -> anyTrueHelper(((FloatMask128)m).getBits()));
         }
 
         @Override
         @ForceInline
         public boolean allTrue() {
             return VectorSupport.test(BT_overflow, FloatMask128.class, LANEBITS_TYPE_ORDINAL, VLENGTH,
-                                         this, vspecies().maskAll(true),
-                                         (m, __) -> allTrueHelper(((FloatMask128)m).getBits()));
+                                         this, VSPECIES.maskAll(true),
+                                         (m, _) -> allTrueHelper(((FloatMask128)m).getBits()));
         }
 
         @ForceInline
@@ -790,7 +788,7 @@ final class FloatVector128 extends FloatVector {
         static FloatMask128 maskAll(boolean bit) {
             return VectorSupport.fromBitsCoerced(FloatMask128.class, LANEBITS_TYPE_ORDINAL, VLENGTH,
                                                  (bit ? -1 : 0), MODE_BROADCAST, null,
-                                                 (v, __) -> (v != 0 ? TRUE_MASK : FALSE_MASK));
+                                                 (v, _) -> (v != 0 ? TRUE_MASK : FALSE_MASK));
         }
         private static final FloatMask128  TRUE_MASK = new FloatMask128(true);
         private static final FloatMask128 FALSE_MASK = new FloatMask128(false);
@@ -839,7 +837,7 @@ final class FloatVector128 extends FloatVector {
         @Override
         @ForceInline
         public FloatVector128 toVector() {
-            return (FloatVector128) toBitsVector().castShape(vspecies(), 0);
+            return (FloatVector128) toBitsVector().castShape(VSPECIES, 0);
         }
 
         @Override
@@ -850,7 +848,7 @@ final class FloatVector128 extends FloatVector {
 
         @Override
         IntVector128 toBitsVector0() {
-            return ((IntVector128) vspecies().asIntegral().dummyVector()).vectorFactory(indices());
+            return ((IntVector128) VSPECIES.asIntegral().dummyVector()).vectorFactory(indices());
         }
 
         @Override
@@ -875,7 +873,7 @@ final class FloatVector128 extends FloatVector {
         @ForceInline
         public final FloatMask128 laneIsValid() {
             return (FloatMask128) toBitsVector().compare(VectorOperators.GE, 0)
-                    .cast(vspecies());
+                    .cast(VSPECIES);
         }
 
         @ForceInline
@@ -883,7 +881,7 @@ final class FloatVector128 extends FloatVector {
         public final FloatShuffle128 rearrange(VectorShuffle<Float> shuffle) {
             FloatShuffle128 concreteShuffle = (FloatShuffle128) shuffle;
             return (FloatShuffle128) toBitsVector().rearrange(concreteShuffle.cast(IntVector.SPECIES_128))
-                    .toShuffle(vspecies(), false);
+                    .toShuffle(VSPECIES, false);
         }
 
         @ForceInline
@@ -896,7 +894,7 @@ final class FloatVector128 extends FloatVector {
                 v = (IntVector128) v.blend(v.lanewise(VectorOperators.ADD, length()),
                             v.compare(VectorOperators.LT, 0));
             }
-            return (FloatShuffle128) v.toShuffle(vspecies(), false);
+            return (FloatShuffle128) v.toShuffle(VSPECIES, false);
         }
 
         private static int[] prepare(int[] indices, int offset) {
diff --git a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/FloatVector256.java b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/FloatVector256.java
index 7badb71415e..ecbd80046f4 100644
--- a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/FloatVector256.java
+++ b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/FloatVector256.java
@@ -25,7 +25,6 @@
 package jdk.incubator.vector;
 
 import java.lang.foreign.MemorySegment;
-import java.lang.foreign.ValueLayout;
 import java.nio.ByteOrder;
 import java.util.Arrays;
 import java.util.Objects;
@@ -35,9 +34,8 @@ import jdk.internal.ValueBased;
 import jdk.internal.vm.annotation.ForceInline;
 import jdk.internal.vm.vector.VectorSupport;
 
-import static jdk.internal.vm.vector.VectorSupport.*;
-
 import static jdk.incubator.vector.VectorOperators.*;
+import static jdk.internal.vm.vector.VectorSupport.*;
 
 // -- This file was mechanically generated: Do not edit! -- //
 
@@ -360,7 +358,7 @@ final class FloatVector256 extends FloatVector {
     @Override
     @ForceInline
     public final FloatShuffle256 toShuffle() {
-        return (FloatShuffle256) toShuffle(vspecies(), false);
+        return (FloatShuffle256) toShuffle(VSPECIES, false);
     }
 
     // Specialized unary testing
@@ -621,7 +619,7 @@ final class FloatVector256 extends FloatVector {
 
         @Override
         FloatMask256 uOp(MUnOp f) {
-            boolean[] res = new boolean[vspecies().laneCount()];
+            boolean[] res = new boolean[VSPECIES.laneCount()];
             boolean[] bits = getBits();
             for (int i = 0; i < res.length; i++) {
                 res[i] = f.apply(i, bits[i]);
@@ -631,7 +629,7 @@ final class FloatVector256 extends FloatVector {
 
         @Override
         FloatMask256 bOp(VectorMask<Float> m, MBinOp f) {
-            boolean[] res = new boolean[vspecies().laneCount()];
+            boolean[] res = new boolean[VSPECIES.laneCount()];
             boolean[] bits = getBits();
             boolean[] mbits = ((FloatMask256)m).getBits();
             for (int i = 0; i < res.length; i++) {
@@ -781,16 +779,16 @@ final class FloatVector256 extends FloatVector {
         @ForceInline
         public boolean anyTrue() {
             return VectorSupport.test(BT_ne, FloatMask256.class, LANEBITS_TYPE_ORDINAL, VLENGTH,
-                                         this, vspecies().maskAll(true),
-                                         (m, __) -> anyTrueHelper(((FloatMask256)m).getBits()));
+                                         this, VSPECIES.maskAll(true),
+                                         (m, _) -> anyTrueHelper(((FloatMask256)m).getBits()));
         }
 
         @Override
         @ForceInline
         public boolean allTrue() {
             return VectorSupport.test(BT_overflow, FloatMask256.class, LANEBITS_TYPE_ORDINAL, VLENGTH,
-                                         this, vspecies().maskAll(true),
-                                         (m, __) -> allTrueHelper(((FloatMask256)m).getBits()));
+                                         this, VSPECIES.maskAll(true),
+                                         (m, _) -> allTrueHelper(((FloatMask256)m).getBits()));
         }
 
         @ForceInline
@@ -798,7 +796,7 @@ final class FloatVector256 extends FloatVector {
         static FloatMask256 maskAll(boolean bit) {
             return VectorSupport.fromBitsCoerced(FloatMask256.class, LANEBITS_TYPE_ORDINAL, VLENGTH,
                                                  (bit ? -1 : 0), MODE_BROADCAST, null,
-                                                 (v, __) -> (v != 0 ? TRUE_MASK : FALSE_MASK));
+                                                 (v, _) -> (v != 0 ? TRUE_MASK : FALSE_MASK));
         }
         private static final FloatMask256  TRUE_MASK = new FloatMask256(true);
         private static final FloatMask256 FALSE_MASK = new FloatMask256(false);
@@ -847,7 +845,7 @@ final class FloatVector256 extends FloatVector {
         @Override
         @ForceInline
         public FloatVector256 toVector() {
-            return (FloatVector256) toBitsVector().castShape(vspecies(), 0);
+            return (FloatVector256) toBitsVector().castShape(VSPECIES, 0);
         }
 
         @Override
@@ -858,7 +856,7 @@ final class FloatVector256 extends FloatVector {
 
         @Override
         IntVector256 toBitsVector0() {
-            return ((IntVector256) vspecies().asIntegral().dummyVector()).vectorFactory(indices());
+            return ((IntVector256) VSPECIES.asIntegral().dummyVector()).vectorFactory(indices());
         }
 
         @Override
@@ -883,7 +881,7 @@ final class FloatVector256 extends FloatVector {
         @ForceInline
         public final FloatMask256 laneIsValid() {
             return (FloatMask256) toBitsVector().compare(VectorOperators.GE, 0)
-                    .cast(vspecies());
+                    .cast(VSPECIES);
         }
 
         @ForceInline
@@ -891,7 +889,7 @@ final class FloatVector256 extends FloatVector {
         public final FloatShuffle256 rearrange(VectorShuffle<Float> shuffle) {
             FloatShuffle256 concreteShuffle = (FloatShuffle256) shuffle;
             return (FloatShuffle256) toBitsVector().rearrange(concreteShuffle.cast(IntVector.SPECIES_256))
-                    .toShuffle(vspecies(), false);
+                    .toShuffle(VSPECIES, false);
         }
 
         @ForceInline
@@ -904,7 +902,7 @@ final class FloatVector256 extends FloatVector {
                 v = (IntVector256) v.blend(v.lanewise(VectorOperators.ADD, length()),
                             v.compare(VectorOperators.LT, 0));
             }
-            return (FloatShuffle256) v.toShuffle(vspecies(), false);
+            return (FloatShuffle256) v.toShuffle(VSPECIES, false);
         }
 
         private static int[] prepare(int[] indices, int offset) {
diff --git a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/FloatVector512.java b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/FloatVector512.java
index 7c0786b7fcd..b5a934dd90c 100644
--- a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/FloatVector512.java
+++ b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/FloatVector512.java
@@ -25,7 +25,6 @@
 package jdk.incubator.vector;
 
 import java.lang.foreign.MemorySegment;
-import java.lang.foreign.ValueLayout;
 import java.nio.ByteOrder;
 import java.util.Arrays;
 import java.util.Objects;
@@ -35,9 +34,8 @@ import jdk.internal.ValueBased;
 import jdk.internal.vm.annotation.ForceInline;
 import jdk.internal.vm.vector.VectorSupport;
 
-import static jdk.internal.vm.vector.VectorSupport.*;
-
 import static jdk.incubator.vector.VectorOperators.*;
+import static jdk.internal.vm.vector.VectorSupport.*;
 
 // -- This file was mechanically generated: Do not edit! -- //
 
@@ -360,7 +358,7 @@ final class FloatVector512 extends FloatVector {
     @Override
     @ForceInline
     public final FloatShuffle512 toShuffle() {
-        return (FloatShuffle512) toShuffle(vspecies(), false);
+        return (FloatShuffle512) toShuffle(VSPECIES, false);
     }
 
     // Specialized unary testing
@@ -637,7 +635,7 @@ final class FloatVector512 extends FloatVector {
 
         @Override
         FloatMask512 uOp(MUnOp f) {
-            boolean[] res = new boolean[vspecies().laneCount()];
+            boolean[] res = new boolean[VSPECIES.laneCount()];
             boolean[] bits = getBits();
             for (int i = 0; i < res.length; i++) {
                 res[i] = f.apply(i, bits[i]);
@@ -647,7 +645,7 @@ final class FloatVector512 extends FloatVector {
 
         @Override
         FloatMask512 bOp(VectorMask<Float> m, MBinOp f) {
-            boolean[] res = new boolean[vspecies().laneCount()];
+            boolean[] res = new boolean[VSPECIES.laneCount()];
             boolean[] bits = getBits();
             boolean[] mbits = ((FloatMask512)m).getBits();
             for (int i = 0; i < res.length; i++) {
@@ -797,16 +795,16 @@ final class FloatVector512 extends FloatVector {
         @ForceInline
         public boolean anyTrue() {
             return VectorSupport.test(BT_ne, FloatMask512.class, LANEBITS_TYPE_ORDINAL, VLENGTH,
-                                         this, vspecies().maskAll(true),
-                                         (m, __) -> anyTrueHelper(((FloatMask512)m).getBits()));
+                                         this, VSPECIES.maskAll(true),
+                                         (m, _) -> anyTrueHelper(((FloatMask512)m).getBits()));
         }
 
         @Override
         @ForceInline
         public boolean allTrue() {
             return VectorSupport.test(BT_overflow, FloatMask512.class, LANEBITS_TYPE_ORDINAL, VLENGTH,
-                                         this, vspecies().maskAll(true),
-                                         (m, __) -> allTrueHelper(((FloatMask512)m).getBits()));
+                                         this, VSPECIES.maskAll(true),
+                                         (m, _) -> allTrueHelper(((FloatMask512)m).getBits()));
         }
 
         @ForceInline
@@ -814,7 +812,7 @@ final class FloatVector512 extends FloatVector {
         static FloatMask512 maskAll(boolean bit) {
             return VectorSupport.fromBitsCoerced(FloatMask512.class, LANEBITS_TYPE_ORDINAL, VLENGTH,
                                                  (bit ? -1 : 0), MODE_BROADCAST, null,
-                                                 (v, __) -> (v != 0 ? TRUE_MASK : FALSE_MASK));
+                                                 (v, _) -> (v != 0 ? TRUE_MASK : FALSE_MASK));
         }
         private static final FloatMask512  TRUE_MASK = new FloatMask512(true);
         private static final FloatMask512 FALSE_MASK = new FloatMask512(false);
@@ -863,7 +861,7 @@ final class FloatVector512 extends FloatVector {
         @Override
         @ForceInline
         public FloatVector512 toVector() {
-            return (FloatVector512) toBitsVector().castShape(vspecies(), 0);
+            return (FloatVector512) toBitsVector().castShape(VSPECIES, 0);
         }
 
         @Override
@@ -874,7 +872,7 @@ final class FloatVector512 extends FloatVector {
 
         @Override
         IntVector512 toBitsVector0() {
-            return ((IntVector512) vspecies().asIntegral().dummyVector()).vectorFactory(indices());
+            return ((IntVector512) VSPECIES.asIntegral().dummyVector()).vectorFactory(indices());
         }
 
         @Override
@@ -899,7 +897,7 @@ final class FloatVector512 extends FloatVector {
         @ForceInline
         public final FloatMask512 laneIsValid() {
             return (FloatMask512) toBitsVector().compare(VectorOperators.GE, 0)
-                    .cast(vspecies());
+                    .cast(VSPECIES);
         }
 
         @ForceInline
@@ -907,7 +905,7 @@ final class FloatVector512 extends FloatVector {
         public final FloatShuffle512 rearrange(VectorShuffle<Float> shuffle) {
             FloatShuffle512 concreteShuffle = (FloatShuffle512) shuffle;
             return (FloatShuffle512) toBitsVector().rearrange(concreteShuffle.cast(IntVector.SPECIES_512))
-                    .toShuffle(vspecies(), false);
+                    .toShuffle(VSPECIES, false);
         }
 
         @ForceInline
@@ -920,7 +918,7 @@ final class FloatVector512 extends FloatVector {
                 v = (IntVector512) v.blend(v.lanewise(VectorOperators.ADD, length()),
                             v.compare(VectorOperators.LT, 0));
             }
-            return (FloatShuffle512) v.toShuffle(vspecies(), false);
+            return (FloatShuffle512) v.toShuffle(VSPECIES, false);
         }
 
         private static int[] prepare(int[] indices, int offset) {
diff --git a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/FloatVector64.java b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/FloatVector64.java
index fc4877e5ae8..4d3118739ea 100644
--- a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/FloatVector64.java
+++ b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/FloatVector64.java
@@ -25,7 +25,6 @@
 package jdk.incubator.vector;
 
 import java.lang.foreign.MemorySegment;
-import java.lang.foreign.ValueLayout;
 import java.nio.ByteOrder;
 import java.util.Arrays;
 import java.util.Objects;
@@ -35,9 +34,8 @@ import jdk.internal.ValueBased;
 import jdk.internal.vm.annotation.ForceInline;
 import jdk.internal.vm.vector.VectorSupport;
 
-import static jdk.internal.vm.vector.VectorSupport.*;
-
 import static jdk.incubator.vector.VectorOperators.*;
+import static jdk.internal.vm.vector.VectorSupport.*;
 
 // -- This file was mechanically generated: Do not edit! -- //
 
@@ -360,7 +358,7 @@ final class FloatVector64 extends FloatVector {
     @Override
     @ForceInline
     public final FloatShuffle64 toShuffle() {
-        return (FloatShuffle64) toShuffle(vspecies(), false);
+        return (FloatShuffle64) toShuffle(VSPECIES, false);
     }
 
     // Specialized unary testing
@@ -609,7 +607,7 @@ final class FloatVector64 extends FloatVector {
 
         @Override
         FloatMask64 uOp(MUnOp f) {
-            boolean[] res = new boolean[vspecies().laneCount()];
+            boolean[] res = new boolean[VSPECIES.laneCount()];
             boolean[] bits = getBits();
             for (int i = 0; i < res.length; i++) {
                 res[i] = f.apply(i, bits[i]);
@@ -619,7 +617,7 @@ final class FloatVector64 extends FloatVector {
 
         @Override
         FloatMask64 bOp(VectorMask<Float> m, MBinOp f) {
-            boolean[] res = new boolean[vspecies().laneCount()];
+            boolean[] res = new boolean[VSPECIES.laneCount()];
             boolean[] bits = getBits();
             boolean[] mbits = ((FloatMask64)m).getBits();
             for (int i = 0; i < res.length; i++) {
@@ -769,16 +767,16 @@ final class FloatVector64 extends FloatVector {
         @ForceInline
         public boolean anyTrue() {
             return VectorSupport.test(BT_ne, FloatMask64.class, LANEBITS_TYPE_ORDINAL, VLENGTH,
-                                         this, vspecies().maskAll(true),
-                                         (m, __) -> anyTrueHelper(((FloatMask64)m).getBits()));
+                                         this, VSPECIES.maskAll(true),
+                                         (m, _) -> anyTrueHelper(((FloatMask64)m).getBits()));
         }
 
         @Override
         @ForceInline
         public boolean allTrue() {
             return VectorSupport.test(BT_overflow, FloatMask64.class, LANEBITS_TYPE_ORDINAL, VLENGTH,
-                                         this, vspecies().maskAll(true),
-                                         (m, __) -> allTrueHelper(((FloatMask64)m).getBits()));
+                                         this, VSPECIES.maskAll(true),
+                                         (m, _) -> allTrueHelper(((FloatMask64)m).getBits()));
         }
 
         @ForceInline
@@ -786,7 +784,7 @@ final class FloatVector64 extends FloatVector {
         static FloatMask64 maskAll(boolean bit) {
             return VectorSupport.fromBitsCoerced(FloatMask64.class, LANEBITS_TYPE_ORDINAL, VLENGTH,
                                                  (bit ? -1 : 0), MODE_BROADCAST, null,
-                                                 (v, __) -> (v != 0 ? TRUE_MASK : FALSE_MASK));
+                                                 (v, _) -> (v != 0 ? TRUE_MASK : FALSE_MASK));
         }
         private static final FloatMask64  TRUE_MASK = new FloatMask64(true);
         private static final FloatMask64 FALSE_MASK = new FloatMask64(false);
@@ -835,7 +833,7 @@ final class FloatVector64 extends FloatVector {
         @Override
         @ForceInline
         public FloatVector64 toVector() {
-            return (FloatVector64) toBitsVector().castShape(vspecies(), 0);
+            return (FloatVector64) toBitsVector().castShape(VSPECIES, 0);
         }
 
         @Override
@@ -846,7 +844,7 @@ final class FloatVector64 extends FloatVector {
 
         @Override
         IntVector64 toBitsVector0() {
-            return ((IntVector64) vspecies().asIntegral().dummyVector()).vectorFactory(indices());
+            return ((IntVector64) VSPECIES.asIntegral().dummyVector()).vectorFactory(indices());
         }
 
         @Override
@@ -871,7 +869,7 @@ final class FloatVector64 extends FloatVector {
         @ForceInline
         public final FloatMask64 laneIsValid() {
             return (FloatMask64) toBitsVector().compare(VectorOperators.GE, 0)
-                    .cast(vspecies());
+                    .cast(VSPECIES);
         }
 
         @ForceInline
@@ -879,7 +877,7 @@ final class FloatVector64 extends FloatVector {
         public final FloatShuffle64 rearrange(VectorShuffle<Float> shuffle) {
             FloatShuffle64 concreteShuffle = (FloatShuffle64) shuffle;
             return (FloatShuffle64) toBitsVector().rearrange(concreteShuffle.cast(IntVector.SPECIES_64))
-                    .toShuffle(vspecies(), false);
+                    .toShuffle(VSPECIES, false);
         }
 
         @ForceInline
@@ -892,7 +890,7 @@ final class FloatVector64 extends FloatVector {
                 v = (IntVector64) v.blend(v.lanewise(VectorOperators.ADD, length()),
                             v.compare(VectorOperators.LT, 0));
             }
-            return (FloatShuffle64) v.toShuffle(vspecies(), false);
+            return (FloatShuffle64) v.toShuffle(VSPECIES, false);
         }
 
         private static int[] prepare(int[] indices, int offset) {
diff --git a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/FloatVectorMax.java b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/FloatVectorMax.java
index 5cfafecdb58..f115a1c79b8 100644
--- a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/FloatVectorMax.java
+++ b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/FloatVectorMax.java
@@ -25,7 +25,6 @@
 package jdk.incubator.vector;
 
 import java.lang.foreign.MemorySegment;
-import java.lang.foreign.ValueLayout;
 import java.nio.ByteOrder;
 import java.util.Arrays;
 import java.util.Objects;
@@ -35,9 +34,8 @@ import jdk.internal.ValueBased;
 import jdk.internal.vm.annotation.ForceInline;
 import jdk.internal.vm.vector.VectorSupport;
 
-import static jdk.internal.vm.vector.VectorSupport.*;
-
 import static jdk.incubator.vector.VectorOperators.*;
+import static jdk.internal.vm.vector.VectorSupport.*;
 
 // -- This file was mechanically generated: Do not edit! -- //
 
@@ -360,7 +358,7 @@ final class FloatVectorMax extends FloatVector {
     @Override
     @ForceInline
     public final FloatShuffleMax toShuffle() {
-        return (FloatShuffleMax) toShuffle(vspecies(), false);
+        return (FloatShuffleMax) toShuffle(VSPECIES, false);
     }
 
     // Specialized unary testing
@@ -606,7 +604,7 @@ final class FloatVectorMax extends FloatVector {
 
         @Override
         FloatMaskMax uOp(MUnOp f) {
-            boolean[] res = new boolean[vspecies().laneCount()];
+            boolean[] res = new boolean[VSPECIES.laneCount()];
             boolean[] bits = getBits();
             for (int i = 0; i < res.length; i++) {
                 res[i] = f.apply(i, bits[i]);
@@ -616,7 +614,7 @@ final class FloatVectorMax extends FloatVector {
 
         @Override
         FloatMaskMax bOp(VectorMask<Float> m, MBinOp f) {
-            boolean[] res = new boolean[vspecies().laneCount()];
+            boolean[] res = new boolean[VSPECIES.laneCount()];
             boolean[] bits = getBits();
             boolean[] mbits = ((FloatMaskMax)m).getBits();
             for (int i = 0; i < res.length; i++) {
@@ -766,16 +764,16 @@ final class FloatVectorMax extends FloatVector {
         @ForceInline
         public boolean anyTrue() {
             return VectorSupport.test(BT_ne, FloatMaskMax.class, LANEBITS_TYPE_ORDINAL, VLENGTH,
-                                         this, vspecies().maskAll(true),
-                                         (m, __) -> anyTrueHelper(((FloatMaskMax)m).getBits()));
+                                         this, VSPECIES.maskAll(true),
+                                         (m, _) -> anyTrueHelper(((FloatMaskMax)m).getBits()));
         }
 
         @Override
         @ForceInline
         public boolean allTrue() {
             return VectorSupport.test(BT_overflow, FloatMaskMax.class, LANEBITS_TYPE_ORDINAL, VLENGTH,
-                                         this, vspecies().maskAll(true),
-                                         (m, __) -> allTrueHelper(((FloatMaskMax)m).getBits()));
+                                         this, VSPECIES.maskAll(true),
+                                         (m, _) -> allTrueHelper(((FloatMaskMax)m).getBits()));
         }
 
         @ForceInline
@@ -783,7 +781,7 @@ final class FloatVectorMax extends FloatVector {
         static FloatMaskMax maskAll(boolean bit) {
             return VectorSupport.fromBitsCoerced(FloatMaskMax.class, LANEBITS_TYPE_ORDINAL, VLENGTH,
                                                  (bit ? -1 : 0), MODE_BROADCAST, null,
-                                                 (v, __) -> (v != 0 ? TRUE_MASK : FALSE_MASK));
+                                                 (v, _) -> (v != 0 ? TRUE_MASK : FALSE_MASK));
         }
         private static final FloatMaskMax  TRUE_MASK = new FloatMaskMax(true);
         private static final FloatMaskMax FALSE_MASK = new FloatMaskMax(false);
@@ -832,7 +830,7 @@ final class FloatVectorMax extends FloatVector {
         @Override
         @ForceInline
         public FloatVectorMax toVector() {
-            return (FloatVectorMax) toBitsVector().castShape(vspecies(), 0);
+            return (FloatVectorMax) toBitsVector().castShape(VSPECIES, 0);
         }
 
         @Override
@@ -843,7 +841,7 @@ final class FloatVectorMax extends FloatVector {
 
         @Override
         IntVectorMax toBitsVector0() {
-            return ((IntVectorMax) vspecies().asIntegral().dummyVector()).vectorFactory(indices());
+            return ((IntVectorMax) VSPECIES.asIntegral().dummyVector()).vectorFactory(indices());
         }
 
         @Override
@@ -868,7 +866,7 @@ final class FloatVectorMax extends FloatVector {
         @ForceInline
         public final FloatMaskMax laneIsValid() {
             return (FloatMaskMax) toBitsVector().compare(VectorOperators.GE, 0)
-                    .cast(vspecies());
+                    .cast(VSPECIES);
         }
 
         @ForceInline
@@ -876,7 +874,7 @@ final class FloatVectorMax extends FloatVector {
         public final FloatShuffleMax rearrange(VectorShuffle<Float> shuffle) {
             FloatShuffleMax concreteShuffle = (FloatShuffleMax) shuffle;
             return (FloatShuffleMax) toBitsVector().rearrange(concreteShuffle.cast(IntVector.SPECIES_MAX))
-                    .toShuffle(vspecies(), false);
+                    .toShuffle(VSPECIES, false);
         }
 
         @ForceInline
@@ -889,7 +887,7 @@ final class FloatVectorMax extends FloatVector {
                 v = (IntVectorMax) v.blend(v.lanewise(VectorOperators.ADD, length()),
                             v.compare(VectorOperators.LT, 0));
             }
-            return (FloatShuffleMax) v.toShuffle(vspecies(), false);
+            return (FloatShuffleMax) v.toShuffle(VSPECIES, false);
         }
 
         private static int[] prepare(int[] indices, int offset) {
diff --git a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/IntVector.java b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/IntVector.java
index 445c4dfb006..37b7e3eeae4 100644
--- a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/IntVector.java
+++ b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/IntVector.java
@@ -49,7 +49,8 @@ import static jdk.incubator.vector.VectorOperators.*;
  * {@code int} values.
  */
 @SuppressWarnings("cast")  // warning: redundant cast
-public abstract class IntVector extends AbstractVector<Integer> {
+public abstract sealed class IntVector extends AbstractVector<Integer>
+         permits IntVector64, IntVector128, IntVector256, IntVector512, IntVectorMax {
 
     IntVector(int[] vec) {
         super(vec);
diff --git a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/IntVector128.java b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/IntVector128.java
index 04b10386127..f64328e2a1e 100644
--- a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/IntVector128.java
+++ b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/IntVector128.java
@@ -25,7 +25,6 @@
 package jdk.incubator.vector;
 
 import java.lang.foreign.MemorySegment;
-import java.lang.foreign.ValueLayout;
 import java.nio.ByteOrder;
 import java.util.Arrays;
 import java.util.Objects;
@@ -35,9 +34,8 @@ import jdk.internal.ValueBased;
 import jdk.internal.vm.annotation.ForceInline;
 import jdk.internal.vm.vector.VectorSupport;
 
-import static jdk.internal.vm.vector.VectorSupport.*;
-
 import static jdk.incubator.vector.VectorOperators.*;
+import static jdk.internal.vm.vector.VectorSupport.*;
 
 // -- This file was mechanically generated: Do not edit! -- //
 
@@ -373,7 +371,7 @@ final class IntVector128 extends IntVector {
     @Override
     @ForceInline
     public final IntShuffle128 toShuffle() {
-        return (IntShuffle128) toShuffle(vspecies(), false);
+        return (IntShuffle128) toShuffle(VSPECIES, false);
     }
 
     // Specialized unary testing
@@ -624,7 +622,7 @@ final class IntVector128 extends IntVector {
 
         @Override
         IntMask128 uOp(MUnOp f) {
-            boolean[] res = new boolean[vspecies().laneCount()];
+            boolean[] res = new boolean[VSPECIES.laneCount()];
             boolean[] bits = getBits();
             for (int i = 0; i < res.length; i++) {
                 res[i] = f.apply(i, bits[i]);
@@ -634,7 +632,7 @@ final class IntVector128 extends IntVector {
 
         @Override
         IntMask128 bOp(VectorMask<Integer> m, MBinOp f) {
-            boolean[] res = new boolean[vspecies().laneCount()];
+            boolean[] res = new boolean[VSPECIES.laneCount()];
             boolean[] bits = getBits();
             boolean[] mbits = ((IntMask128)m).getBits();
             for (int i = 0; i < res.length; i++) {
@@ -784,16 +782,16 @@ final class IntVector128 extends IntVector {
         @ForceInline
         public boolean anyTrue() {
             return VectorSupport.test(BT_ne, IntMask128.class, LANEBITS_TYPE_ORDINAL, VLENGTH,
-                                         this, vspecies().maskAll(true),
-                                         (m, __) -> anyTrueHelper(((IntMask128)m).getBits()));
+                                         this, VSPECIES.maskAll(true),
+                                         (m, _) -> anyTrueHelper(((IntMask128)m).getBits()));
         }
 
         @Override
         @ForceInline
         public boolean allTrue() {
             return VectorSupport.test(BT_overflow, IntMask128.class, LANEBITS_TYPE_ORDINAL, VLENGTH,
-                                         this, vspecies().maskAll(true),
-                                         (m, __) -> allTrueHelper(((IntMask128)m).getBits()));
+                                         this, VSPECIES.maskAll(true),
+                                         (m, _) -> allTrueHelper(((IntMask128)m).getBits()));
         }
 
         @ForceInline
@@ -801,7 +799,7 @@ final class IntVector128 extends IntVector {
         static IntMask128 maskAll(boolean bit) {
             return VectorSupport.fromBitsCoerced(IntMask128.class, LANEBITS_TYPE_ORDINAL, VLENGTH,
                                                  (bit ? -1 : 0), MODE_BROADCAST, null,
-                                                 (v, __) -> (v != 0 ? TRUE_MASK : FALSE_MASK));
+                                                 (v, _) -> (v != 0 ? TRUE_MASK : FALSE_MASK));
         }
         private static final IntMask128  TRUE_MASK = new IntMask128(true);
         private static final IntMask128 FALSE_MASK = new IntMask128(false);
@@ -861,7 +859,7 @@ final class IntVector128 extends IntVector {
 
         @Override
         IntVector128 toBitsVector0() {
-            return ((IntVector128) vspecies().asIntegral().dummyVector()).vectorFactory(indices());
+            return ((IntVector128) VSPECIES.asIntegral().dummyVector()).vectorFactory(indices());
         }
 
         @Override
@@ -886,7 +884,7 @@ final class IntVector128 extends IntVector {
         @ForceInline
         public final IntMask128 laneIsValid() {
             return (IntMask128) toBitsVector().compare(VectorOperators.GE, 0)
-                    .cast(vspecies());
+                    .cast(VSPECIES);
         }
 
         @ForceInline
@@ -894,7 +892,7 @@ final class IntVector128 extends IntVector {
         public final IntShuffle128 rearrange(VectorShuffle<Integer> shuffle) {
             IntShuffle128 concreteShuffle = (IntShuffle128) shuffle;
             return (IntShuffle128) toBitsVector().rearrange(concreteShuffle)
-                    .toShuffle(vspecies(), false);
+                    .toShuffle(VSPECIES, false);
         }
 
         @ForceInline
@@ -907,7 +905,7 @@ final class IntVector128 extends IntVector {
                 v = (IntVector128) v.blend(v.lanewise(VectorOperators.ADD, length()),
                             v.compare(VectorOperators.LT, 0));
             }
-            return (IntShuffle128) v.toShuffle(vspecies(), false);
+            return (IntShuffle128) v.toShuffle(VSPECIES, false);
         }
 
         private static int[] prepare(int[] indices, int offset) {
diff --git a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/IntVector256.java b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/IntVector256.java
index 20d9df1cd60..58a1667d2ac 100644
--- a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/IntVector256.java
+++ b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/IntVector256.java
@@ -25,7 +25,6 @@
 package jdk.incubator.vector;
 
 import java.lang.foreign.MemorySegment;
-import java.lang.foreign.ValueLayout;
 import java.nio.ByteOrder;
 import java.util.Arrays;
 import java.util.Objects;
@@ -35,9 +34,8 @@ import jdk.internal.ValueBased;
 import jdk.internal.vm.annotation.ForceInline;
 import jdk.internal.vm.vector.VectorSupport;
 
-import static jdk.internal.vm.vector.VectorSupport.*;
-
 import static jdk.incubator.vector.VectorOperators.*;
+import static jdk.internal.vm.vector.VectorSupport.*;
 
 // -- This file was mechanically generated: Do not edit! -- //
 
@@ -373,7 +371,7 @@ final class IntVector256 extends IntVector {
     @Override
     @ForceInline
     public final IntShuffle256 toShuffle() {
-        return (IntShuffle256) toShuffle(vspecies(), false);
+        return (IntShuffle256) toShuffle(VSPECIES, false);
     }
 
     // Specialized unary testing
@@ -632,7 +630,7 @@ final class IntVector256 extends IntVector {
 
         @Override
         IntMask256 uOp(MUnOp f) {
-            boolean[] res = new boolean[vspecies().laneCount()];
+            boolean[] res = new boolean[VSPECIES.laneCount()];
             boolean[] bits = getBits();
             for (int i = 0; i < res.length; i++) {
                 res[i] = f.apply(i, bits[i]);
@@ -642,7 +640,7 @@ final class IntVector256 extends IntVector {
 
         @Override
         IntMask256 bOp(VectorMask<Integer> m, MBinOp f) {
-            boolean[] res = new boolean[vspecies().laneCount()];
+            boolean[] res = new boolean[VSPECIES.laneCount()];
             boolean[] bits = getBits();
             boolean[] mbits = ((IntMask256)m).getBits();
             for (int i = 0; i < res.length; i++) {
@@ -792,16 +790,16 @@ final class IntVector256 extends IntVector {
         @ForceInline
         public boolean anyTrue() {
             return VectorSupport.test(BT_ne, IntMask256.class, LANEBITS_TYPE_ORDINAL, VLENGTH,
-                                         this, vspecies().maskAll(true),
-                                         (m, __) -> anyTrueHelper(((IntMask256)m).getBits()));
+                                         this, VSPECIES.maskAll(true),
+                                         (m, _) -> anyTrueHelper(((IntMask256)m).getBits()));
         }
 
         @Override
         @ForceInline
         public boolean allTrue() {
             return VectorSupport.test(BT_overflow, IntMask256.class, LANEBITS_TYPE_ORDINAL, VLENGTH,
-                                         this, vspecies().maskAll(true),
-                                         (m, __) -> allTrueHelper(((IntMask256)m).getBits()));
+                                         this, VSPECIES.maskAll(true),
+                                         (m, _) -> allTrueHelper(((IntMask256)m).getBits()));
         }
 
         @ForceInline
@@ -809,7 +807,7 @@ final class IntVector256 extends IntVector {
         static IntMask256 maskAll(boolean bit) {
             return VectorSupport.fromBitsCoerced(IntMask256.class, LANEBITS_TYPE_ORDINAL, VLENGTH,
                                                  (bit ? -1 : 0), MODE_BROADCAST, null,
-                                                 (v, __) -> (v != 0 ? TRUE_MASK : FALSE_MASK));
+                                                 (v, _) -> (v != 0 ? TRUE_MASK : FALSE_MASK));
         }
         private static final IntMask256  TRUE_MASK = new IntMask256(true);
         private static final IntMask256 FALSE_MASK = new IntMask256(false);
@@ -869,7 +867,7 @@ final class IntVector256 extends IntVector {
 
         @Override
         IntVector256 toBitsVector0() {
-            return ((IntVector256) vspecies().asIntegral().dummyVector()).vectorFactory(indices());
+            return ((IntVector256) VSPECIES.asIntegral().dummyVector()).vectorFactory(indices());
         }
 
         @Override
@@ -894,7 +892,7 @@ final class IntVector256 extends IntVector {
         @ForceInline
         public final IntMask256 laneIsValid() {
             return (IntMask256) toBitsVector().compare(VectorOperators.GE, 0)
-                    .cast(vspecies());
+                    .cast(VSPECIES);
         }
 
         @ForceInline
@@ -902,7 +900,7 @@ final class IntVector256 extends IntVector {
         public final IntShuffle256 rearrange(VectorShuffle<Integer> shuffle) {
             IntShuffle256 concreteShuffle = (IntShuffle256) shuffle;
             return (IntShuffle256) toBitsVector().rearrange(concreteShuffle)
-                    .toShuffle(vspecies(), false);
+                    .toShuffle(VSPECIES, false);
         }
 
         @ForceInline
@@ -915,7 +913,7 @@ final class IntVector256 extends IntVector {
                 v = (IntVector256) v.blend(v.lanewise(VectorOperators.ADD, length()),
                             v.compare(VectorOperators.LT, 0));
             }
-            return (IntShuffle256) v.toShuffle(vspecies(), false);
+            return (IntShuffle256) v.toShuffle(VSPECIES, false);
         }
 
         private static int[] prepare(int[] indices, int offset) {
diff --git a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/IntVector512.java b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/IntVector512.java
index 4f3a16e2777..ac48e589a05 100644
--- a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/IntVector512.java
+++ b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/IntVector512.java
@@ -25,7 +25,6 @@
 package jdk.incubator.vector;
 
 import java.lang.foreign.MemorySegment;
-import java.lang.foreign.ValueLayout;
 import java.nio.ByteOrder;
 import java.util.Arrays;
 import java.util.Objects;
@@ -35,9 +34,8 @@ import jdk.internal.ValueBased;
 import jdk.internal.vm.annotation.ForceInline;
 import jdk.internal.vm.vector.VectorSupport;
 
-import static jdk.internal.vm.vector.VectorSupport.*;
-
 import static jdk.incubator.vector.VectorOperators.*;
+import static jdk.internal.vm.vector.VectorSupport.*;
 
 // -- This file was mechanically generated: Do not edit! -- //
 
@@ -373,7 +371,7 @@ final class IntVector512 extends IntVector {
     @Override
     @ForceInline
     public final IntShuffle512 toShuffle() {
-        return (IntShuffle512) toShuffle(vspecies(), false);
+        return (IntShuffle512) toShuffle(VSPECIES, false);
     }
 
     // Specialized unary testing
@@ -648,7 +646,7 @@ final class IntVector512 extends IntVector {
 
         @Override
         IntMask512 uOp(MUnOp f) {
-            boolean[] res = new boolean[vspecies().laneCount()];
+            boolean[] res = new boolean[VSPECIES.laneCount()];
             boolean[] bits = getBits();
             for (int i = 0; i < res.length; i++) {
                 res[i] = f.apply(i, bits[i]);
@@ -658,7 +656,7 @@ final class IntVector512 extends IntVector {
 
         @Override
         IntMask512 bOp(VectorMask<Integer> m, MBinOp f) {
-            boolean[] res = new boolean[vspecies().laneCount()];
+            boolean[] res = new boolean[VSPECIES.laneCount()];
             boolean[] bits = getBits();
             boolean[] mbits = ((IntMask512)m).getBits();
             for (int i = 0; i < res.length; i++) {
@@ -808,16 +806,16 @@ final class IntVector512 extends IntVector {
         @ForceInline
         public boolean anyTrue() {
             return VectorSupport.test(BT_ne, IntMask512.class, LANEBITS_TYPE_ORDINAL, VLENGTH,
-                                         this, vspecies().maskAll(true),
-                                         (m, __) -> anyTrueHelper(((IntMask512)m).getBits()));
+                                         this, VSPECIES.maskAll(true),
+                                         (m, _) -> anyTrueHelper(((IntMask512)m).getBits()));
         }
 
         @Override
         @ForceInline
         public boolean allTrue() {
             return VectorSupport.test(BT_overflow, IntMask512.class, LANEBITS_TYPE_ORDINAL, VLENGTH,
-                                         this, vspecies().maskAll(true),
-                                         (m, __) -> allTrueHelper(((IntMask512)m).getBits()));
+                                         this, VSPECIES.maskAll(true),
+                                         (m, _) -> allTrueHelper(((IntMask512)m).getBits()));
         }
 
         @ForceInline
@@ -825,7 +823,7 @@ final class IntVector512 extends IntVector {
         static IntMask512 maskAll(boolean bit) {
             return VectorSupport.fromBitsCoerced(IntMask512.class, LANEBITS_TYPE_ORDINAL, VLENGTH,
                                                  (bit ? -1 : 0), MODE_BROADCAST, null,
-                                                 (v, __) -> (v != 0 ? TRUE_MASK : FALSE_MASK));
+                                                 (v, _) -> (v != 0 ? TRUE_MASK : FALSE_MASK));
         }
         private static final IntMask512  TRUE_MASK = new IntMask512(true);
         private static final IntMask512 FALSE_MASK = new IntMask512(false);
@@ -885,7 +883,7 @@ final class IntVector512 extends IntVector {
 
         @Override
         IntVector512 toBitsVector0() {
-            return ((IntVector512) vspecies().asIntegral().dummyVector()).vectorFactory(indices());
+            return ((IntVector512) VSPECIES.asIntegral().dummyVector()).vectorFactory(indices());
         }
 
         @Override
@@ -910,7 +908,7 @@ final class IntVector512 extends IntVector {
         @ForceInline
         public final IntMask512 laneIsValid() {
             return (IntMask512) toBitsVector().compare(VectorOperators.GE, 0)
-                    .cast(vspecies());
+                    .cast(VSPECIES);
         }
 
         @ForceInline
@@ -918,7 +916,7 @@ final class IntVector512 extends IntVector {
         public final IntShuffle512 rearrange(VectorShuffle<Integer> shuffle) {
             IntShuffle512 concreteShuffle = (IntShuffle512) shuffle;
             return (IntShuffle512) toBitsVector().rearrange(concreteShuffle)
-                    .toShuffle(vspecies(), false);
+                    .toShuffle(VSPECIES, false);
         }
 
         @ForceInline
@@ -931,7 +929,7 @@ final class IntVector512 extends IntVector {
                 v = (IntVector512) v.blend(v.lanewise(VectorOperators.ADD, length()),
                             v.compare(VectorOperators.LT, 0));
             }
-            return (IntShuffle512) v.toShuffle(vspecies(), false);
+            return (IntShuffle512) v.toShuffle(VSPECIES, false);
         }
 
         private static int[] prepare(int[] indices, int offset) {
diff --git a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/IntVector64.java b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/IntVector64.java
index dd51669943b..25329aa81aa 100644
--- a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/IntVector64.java
+++ b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/IntVector64.java
@@ -25,7 +25,6 @@
 package jdk.incubator.vector;
 
 import java.lang.foreign.MemorySegment;
-import java.lang.foreign.ValueLayout;
 import java.nio.ByteOrder;
 import java.util.Arrays;
 import java.util.Objects;
@@ -35,9 +34,8 @@ import jdk.internal.ValueBased;
 import jdk.internal.vm.annotation.ForceInline;
 import jdk.internal.vm.vector.VectorSupport;
 
-import static jdk.internal.vm.vector.VectorSupport.*;
-
 import static jdk.incubator.vector.VectorOperators.*;
+import static jdk.internal.vm.vector.VectorSupport.*;
 
 // -- This file was mechanically generated: Do not edit! -- //
 
@@ -373,7 +371,7 @@ final class IntVector64 extends IntVector {
     @Override
     @ForceInline
     public final IntShuffle64 toShuffle() {
-        return (IntShuffle64) toShuffle(vspecies(), false);
+        return (IntShuffle64) toShuffle(VSPECIES, false);
     }
 
     // Specialized unary testing
@@ -620,7 +618,7 @@ final class IntVector64 extends IntVector {
 
         @Override
         IntMask64 uOp(MUnOp f) {
-            boolean[] res = new boolean[vspecies().laneCount()];
+            boolean[] res = new boolean[VSPECIES.laneCount()];
             boolean[] bits = getBits();
             for (int i = 0; i < res.length; i++) {
                 res[i] = f.apply(i, bits[i]);
@@ -630,7 +628,7 @@ final class IntVector64 extends IntVector {
 
         @Override
         IntMask64 bOp(VectorMask<Integer> m, MBinOp f) {
-            boolean[] res = new boolean[vspecies().laneCount()];
+            boolean[] res = new boolean[VSPECIES.laneCount()];
             boolean[] bits = getBits();
             boolean[] mbits = ((IntMask64)m).getBits();
             for (int i = 0; i < res.length; i++) {
@@ -780,16 +778,16 @@ final class IntVector64 extends IntVector {
         @ForceInline
         public boolean anyTrue() {
             return VectorSupport.test(BT_ne, IntMask64.class, LANEBITS_TYPE_ORDINAL, VLENGTH,
-                                         this, vspecies().maskAll(true),
-                                         (m, __) -> anyTrueHelper(((IntMask64)m).getBits()));
+                                         this, VSPECIES.maskAll(true),
+                                         (m, _) -> anyTrueHelper(((IntMask64)m).getBits()));
         }
 
         @Override
         @ForceInline
         public boolean allTrue() {
             return VectorSupport.test(BT_overflow, IntMask64.class, LANEBITS_TYPE_ORDINAL, VLENGTH,
-                                         this, vspecies().maskAll(true),
-                                         (m, __) -> allTrueHelper(((IntMask64)m).getBits()));
+                                         this, VSPECIES.maskAll(true),
+                                         (m, _) -> allTrueHelper(((IntMask64)m).getBits()));
         }
 
         @ForceInline
@@ -797,7 +795,7 @@ final class IntVector64 extends IntVector {
         static IntMask64 maskAll(boolean bit) {
             return VectorSupport.fromBitsCoerced(IntMask64.class, LANEBITS_TYPE_ORDINAL, VLENGTH,
                                                  (bit ? -1 : 0), MODE_BROADCAST, null,
-                                                 (v, __) -> (v != 0 ? TRUE_MASK : FALSE_MASK));
+                                                 (v, _) -> (v != 0 ? TRUE_MASK : FALSE_MASK));
         }
         private static final IntMask64  TRUE_MASK = new IntMask64(true);
         private static final IntMask64 FALSE_MASK = new IntMask64(false);
@@ -857,7 +855,7 @@ final class IntVector64 extends IntVector {
 
         @Override
         IntVector64 toBitsVector0() {
-            return ((IntVector64) vspecies().asIntegral().dummyVector()).vectorFactory(indices());
+            return ((IntVector64) VSPECIES.asIntegral().dummyVector()).vectorFactory(indices());
         }
 
         @Override
@@ -882,7 +880,7 @@ final class IntVector64 extends IntVector {
         @ForceInline
         public final IntMask64 laneIsValid() {
             return (IntMask64) toBitsVector().compare(VectorOperators.GE, 0)
-                    .cast(vspecies());
+                    .cast(VSPECIES);
         }
 
         @ForceInline
@@ -890,7 +888,7 @@ final class IntVector64 extends IntVector {
         public final IntShuffle64 rearrange(VectorShuffle<Integer> shuffle) {
             IntShuffle64 concreteShuffle = (IntShuffle64) shuffle;
             return (IntShuffle64) toBitsVector().rearrange(concreteShuffle)
-                    .toShuffle(vspecies(), false);
+                    .toShuffle(VSPECIES, false);
         }
 
         @ForceInline
@@ -903,7 +901,7 @@ final class IntVector64 extends IntVector {
                 v = (IntVector64) v.blend(v.lanewise(VectorOperators.ADD, length()),
                             v.compare(VectorOperators.LT, 0));
             }
-            return (IntShuffle64) v.toShuffle(vspecies(), false);
+            return (IntShuffle64) v.toShuffle(VSPECIES, false);
         }
 
         private static int[] prepare(int[] indices, int offset) {
diff --git a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/IntVectorMax.java b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/IntVectorMax.java
index 0b785b01aec..348fda59381 100644
--- a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/IntVectorMax.java
+++ b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/IntVectorMax.java
@@ -25,7 +25,6 @@
 package jdk.incubator.vector;
 
 import java.lang.foreign.MemorySegment;
-import java.lang.foreign.ValueLayout;
 import java.nio.ByteOrder;
 import java.util.Arrays;
 import java.util.Objects;
@@ -35,9 +34,8 @@ import jdk.internal.ValueBased;
 import jdk.internal.vm.annotation.ForceInline;
 import jdk.internal.vm.vector.VectorSupport;
 
-import static jdk.internal.vm.vector.VectorSupport.*;
-
 import static jdk.incubator.vector.VectorOperators.*;
+import static jdk.internal.vm.vector.VectorSupport.*;
 
 // -- This file was mechanically generated: Do not edit! -- //
 
@@ -373,7 +371,7 @@ final class IntVectorMax extends IntVector {
     @Override
     @ForceInline
     public final IntShuffleMax toShuffle() {
-        return (IntShuffleMax) toShuffle(vspecies(), false);
+        return (IntShuffleMax) toShuffle(VSPECIES, false);
     }
 
     // Specialized unary testing
@@ -618,7 +616,7 @@ final class IntVectorMax extends IntVector {
 
         @Override
         IntMaskMax uOp(MUnOp f) {
-            boolean[] res = new boolean[vspecies().laneCount()];
+            boolean[] res = new boolean[VSPECIES.laneCount()];
             boolean[] bits = getBits();
             for (int i = 0; i < res.length; i++) {
                 res[i] = f.apply(i, bits[i]);
@@ -628,7 +626,7 @@ final class IntVectorMax extends IntVector {
 
         @Override
         IntMaskMax bOp(VectorMask<Integer> m, MBinOp f) {
-            boolean[] res = new boolean[vspecies().laneCount()];
+            boolean[] res = new boolean[VSPECIES.laneCount()];
             boolean[] bits = getBits();
             boolean[] mbits = ((IntMaskMax)m).getBits();
             for (int i = 0; i < res.length; i++) {
@@ -778,16 +776,16 @@ final class IntVectorMax extends IntVector {
         @ForceInline
         public boolean anyTrue() {
             return VectorSupport.test(BT_ne, IntMaskMax.class, LANEBITS_TYPE_ORDINAL, VLENGTH,
-                                         this, vspecies().maskAll(true),
-                                         (m, __) -> anyTrueHelper(((IntMaskMax)m).getBits()));
+                                         this, VSPECIES.maskAll(true),
+                                         (m, _) -> anyTrueHelper(((IntMaskMax)m).getBits()));
         }
 
         @Override
         @ForceInline
         public boolean allTrue() {
             return VectorSupport.test(BT_overflow, IntMaskMax.class, LANEBITS_TYPE_ORDINAL, VLENGTH,
-                                         this, vspecies().maskAll(true),
-                                         (m, __) -> allTrueHelper(((IntMaskMax)m).getBits()));
+                                         this, VSPECIES.maskAll(true),
+                                         (m, _) -> allTrueHelper(((IntMaskMax)m).getBits()));
         }
 
         @ForceInline
@@ -795,7 +793,7 @@ final class IntVectorMax extends IntVector {
         static IntMaskMax maskAll(boolean bit) {
             return VectorSupport.fromBitsCoerced(IntMaskMax.class, LANEBITS_TYPE_ORDINAL, VLENGTH,
                                                  (bit ? -1 : 0), MODE_BROADCAST, null,
-                                                 (v, __) -> (v != 0 ? TRUE_MASK : FALSE_MASK));
+                                                 (v, _) -> (v != 0 ? TRUE_MASK : FALSE_MASK));
         }
         private static final IntMaskMax  TRUE_MASK = new IntMaskMax(true);
         private static final IntMaskMax FALSE_MASK = new IntMaskMax(false);
@@ -866,7 +864,7 @@ final class IntVectorMax extends IntVector {
 
         @Override
         IntVectorMax toBitsVector0() {
-            return ((IntVectorMax) vspecies().asIntegral().dummyVector()).vectorFactory(indices());
+            return ((IntVectorMax) VSPECIES.asIntegral().dummyVector()).vectorFactory(indices());
         }
 
         @Override
@@ -891,7 +889,7 @@ final class IntVectorMax extends IntVector {
         @ForceInline
         public final IntMaskMax laneIsValid() {
             return (IntMaskMax) toBitsVector().compare(VectorOperators.GE, 0)
-                    .cast(vspecies());
+                    .cast(VSPECIES);
         }
 
         @ForceInline
@@ -899,7 +897,7 @@ final class IntVectorMax extends IntVector {
         public final IntShuffleMax rearrange(VectorShuffle<Integer> shuffle) {
             IntShuffleMax concreteShuffle = (IntShuffleMax) shuffle;
             return (IntShuffleMax) toBitsVector().rearrange(concreteShuffle)
-                    .toShuffle(vspecies(), false);
+                    .toShuffle(VSPECIES, false);
         }
 
         @ForceInline
@@ -912,7 +910,7 @@ final class IntVectorMax extends IntVector {
                 v = (IntVectorMax) v.blend(v.lanewise(VectorOperators.ADD, length()),
                             v.compare(VectorOperators.LT, 0));
             }
-            return (IntShuffleMax) v.toShuffle(vspecies(), false);
+            return (IntShuffleMax) v.toShuffle(VSPECIES, false);
         }
 
         private static int[] prepare(int[] indices, int offset) {
diff --git a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/LongVector.java b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/LongVector.java
index 7ba0af6c139..36300cf892b 100644
--- a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/LongVector.java
+++ b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/LongVector.java
@@ -49,7 +49,8 @@ import static jdk.incubator.vector.VectorOperators.*;
  * {@code long} values.
  */
 @SuppressWarnings("cast")  // warning: redundant cast
-public abstract class LongVector extends AbstractVector<Long> {
+public abstract sealed class LongVector extends AbstractVector<Long>
+         permits LongVector64, LongVector128, LongVector256, LongVector512, LongVectorMax {
 
     LongVector(long[] vec) {
         super(vec);
diff --git a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/LongVector128.java b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/LongVector128.java
index 594c82ca1fc..7ce60b2efe0 100644
--- a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/LongVector128.java
+++ b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/LongVector128.java
@@ -35,9 +35,8 @@ import jdk.internal.ValueBased;
 import jdk.internal.vm.annotation.ForceInline;
 import jdk.internal.vm.vector.VectorSupport;
 
-import static jdk.internal.vm.vector.VectorSupport.*;
-
 import static jdk.incubator.vector.VectorOperators.*;
+import static jdk.internal.vm.vector.VectorSupport.*;
 
 // -- This file was mechanically generated: Do not edit! -- //
 
@@ -368,7 +367,7 @@ final class LongVector128 extends LongVector {
     @Override
     @ForceInline
     public final LongShuffle128 toShuffle() {
-        return (LongShuffle128) toShuffle(vspecies(), false);
+        return (LongShuffle128) toShuffle(VSPECIES, false);
     }
 
     // Specialized unary testing
@@ -610,7 +609,7 @@ final class LongVector128 extends LongVector {
 
         @Override
         LongMask128 uOp(MUnOp f) {
-            boolean[] res = new boolean[vspecies().laneCount()];
+            boolean[] res = new boolean[VSPECIES.laneCount()];
             boolean[] bits = getBits();
             for (int i = 0; i < res.length; i++) {
                 res[i] = f.apply(i, bits[i]);
@@ -620,7 +619,7 @@ final class LongVector128 extends LongVector {
 
         @Override
         LongMask128 bOp(VectorMask<Long> m, MBinOp f) {
-            boolean[] res = new boolean[vspecies().laneCount()];
+            boolean[] res = new boolean[VSPECIES.laneCount()];
             boolean[] bits = getBits();
             boolean[] mbits = ((LongMask128)m).getBits();
             for (int i = 0; i < res.length; i++) {
@@ -770,16 +769,16 @@ final class LongVector128 extends LongVector {
         @ForceInline
         public boolean anyTrue() {
             return VectorSupport.test(BT_ne, LongMask128.class, LANEBITS_TYPE_ORDINAL, VLENGTH,
-                                         this, vspecies().maskAll(true),
-                                         (m, __) -> anyTrueHelper(((LongMask128)m).getBits()));
+                                         this, VSPECIES.maskAll(true),
+                                         (m, _) -> anyTrueHelper(((LongMask128)m).getBits()));
         }
 
         @Override
         @ForceInline
         public boolean allTrue() {
             return VectorSupport.test(BT_overflow, LongMask128.class, LANEBITS_TYPE_ORDINAL, VLENGTH,
-                                         this, vspecies().maskAll(true),
-                                         (m, __) -> allTrueHelper(((LongMask128)m).getBits()));
+                                         this, VSPECIES.maskAll(true),
+                                         (m, _) -> allTrueHelper(((LongMask128)m).getBits()));
         }
 
         @ForceInline
@@ -787,7 +786,7 @@ final class LongVector128 extends LongVector {
         static LongMask128 maskAll(boolean bit) {
             return VectorSupport.fromBitsCoerced(LongMask128.class, LANEBITS_TYPE_ORDINAL, VLENGTH,
                                                  (bit ? -1 : 0), MODE_BROADCAST, null,
-                                                 (v, __) -> (v != 0 ? TRUE_MASK : FALSE_MASK));
+                                                 (v, _) -> (v != 0 ? TRUE_MASK : FALSE_MASK));
         }
         private static final LongMask128  TRUE_MASK = new LongMask128(true);
         private static final LongMask128 FALSE_MASK = new LongMask128(false);
@@ -847,7 +846,7 @@ final class LongVector128 extends LongVector {
 
         @Override
         LongVector128 toBitsVector0() {
-            return ((LongVector128) vspecies().asIntegral().dummyVector()).vectorFactory(indices());
+            return ((LongVector128) VSPECIES.asIntegral().dummyVector()).vectorFactory(indices());
         }
 
         @Override
@@ -921,7 +920,7 @@ final class LongVector128 extends LongVector {
         @ForceInline
         public final LongMask128 laneIsValid() {
             return (LongMask128) toBitsVector().compare(VectorOperators.GE, 0)
-                    .cast(vspecies());
+                    .cast(VSPECIES);
         }
 
         @ForceInline
@@ -929,7 +928,7 @@ final class LongVector128 extends LongVector {
         public final LongShuffle128 rearrange(VectorShuffle<Long> shuffle) {
             LongShuffle128 concreteShuffle = (LongShuffle128) shuffle;
             return (LongShuffle128) toBitsVector().rearrange(concreteShuffle)
-                    .toShuffle(vspecies(), false);
+                    .toShuffle(VSPECIES, false);
         }
 
         @ForceInline
@@ -942,7 +941,7 @@ final class LongVector128 extends LongVector {
                 v = (LongVector128) v.blend(v.lanewise(VectorOperators.ADD, length()),
                             v.compare(VectorOperators.LT, 0));
             }
-            return (LongShuffle128) v.toShuffle(vspecies(), false);
+            return (LongShuffle128) v.toShuffle(VSPECIES, false);
         }
 
         private static long[] prepare(int[] indices, int offset) {
diff --git a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/LongVector256.java b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/LongVector256.java
index c3d1ff4c276..110a54c547f 100644
--- a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/LongVector256.java
+++ b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/LongVector256.java
@@ -35,9 +35,8 @@ import jdk.internal.ValueBased;
 import jdk.internal.vm.annotation.ForceInline;
 import jdk.internal.vm.vector.VectorSupport;
 
-import static jdk.internal.vm.vector.VectorSupport.*;
-
 import static jdk.incubator.vector.VectorOperators.*;
+import static jdk.internal.vm.vector.VectorSupport.*;
 
 // -- This file was mechanically generated: Do not edit! -- //
 
@@ -368,7 +367,7 @@ final class LongVector256 extends LongVector {
     @Override
     @ForceInline
     public final LongShuffle256 toShuffle() {
-        return (LongShuffle256) toShuffle(vspecies(), false);
+        return (LongShuffle256) toShuffle(VSPECIES, false);
     }
 
     // Specialized unary testing
@@ -614,7 +613,7 @@ final class LongVector256 extends LongVector {
 
         @Override
         LongMask256 uOp(MUnOp f) {
-            boolean[] res = new boolean[vspecies().laneCount()];
+            boolean[] res = new boolean[VSPECIES.laneCount()];
             boolean[] bits = getBits();
             for (int i = 0; i < res.length; i++) {
                 res[i] = f.apply(i, bits[i]);
@@ -624,7 +623,7 @@ final class LongVector256 extends LongVector {
 
         @Override
         LongMask256 bOp(VectorMask<Long> m, MBinOp f) {
-            boolean[] res = new boolean[vspecies().laneCount()];
+            boolean[] res = new boolean[VSPECIES.laneCount()];
             boolean[] bits = getBits();
             boolean[] mbits = ((LongMask256)m).getBits();
             for (int i = 0; i < res.length; i++) {
@@ -774,16 +773,16 @@ final class LongVector256 extends LongVector {
         @ForceInline
         public boolean anyTrue() {
             return VectorSupport.test(BT_ne, LongMask256.class, LANEBITS_TYPE_ORDINAL, VLENGTH,
-                                         this, vspecies().maskAll(true),
-                                         (m, __) -> anyTrueHelper(((LongMask256)m).getBits()));
+                                         this, VSPECIES.maskAll(true),
+                                         (m, _) -> anyTrueHelper(((LongMask256)m).getBits()));
         }
 
         @Override
         @ForceInline
         public boolean allTrue() {
             return VectorSupport.test(BT_overflow, LongMask256.class, LANEBITS_TYPE_ORDINAL, VLENGTH,
-                                         this, vspecies().maskAll(true),
-                                         (m, __) -> allTrueHelper(((LongMask256)m).getBits()));
+                                         this, VSPECIES.maskAll(true),
+                                         (m, _) -> allTrueHelper(((LongMask256)m).getBits()));
         }
 
         @ForceInline
@@ -791,7 +790,7 @@ final class LongVector256 extends LongVector {
         static LongMask256 maskAll(boolean bit) {
             return VectorSupport.fromBitsCoerced(LongMask256.class, LANEBITS_TYPE_ORDINAL, VLENGTH,
                                                  (bit ? -1 : 0), MODE_BROADCAST, null,
-                                                 (v, __) -> (v != 0 ? TRUE_MASK : FALSE_MASK));
+                                                 (v, _) -> (v != 0 ? TRUE_MASK : FALSE_MASK));
         }
         private static final LongMask256  TRUE_MASK = new LongMask256(true);
         private static final LongMask256 FALSE_MASK = new LongMask256(false);
@@ -851,7 +850,7 @@ final class LongVector256 extends LongVector {
 
         @Override
         LongVector256 toBitsVector0() {
-            return ((LongVector256) vspecies().asIntegral().dummyVector()).vectorFactory(indices());
+            return ((LongVector256) VSPECIES.asIntegral().dummyVector()).vectorFactory(indices());
         }
 
         @Override
@@ -925,7 +924,7 @@ final class LongVector256 extends LongVector {
         @ForceInline
         public final LongMask256 laneIsValid() {
             return (LongMask256) toBitsVector().compare(VectorOperators.GE, 0)
-                    .cast(vspecies());
+                    .cast(VSPECIES);
         }
 
         @ForceInline
@@ -933,7 +932,7 @@ final class LongVector256 extends LongVector {
         public final LongShuffle256 rearrange(VectorShuffle<Long> shuffle) {
             LongShuffle256 concreteShuffle = (LongShuffle256) shuffle;
             return (LongShuffle256) toBitsVector().rearrange(concreteShuffle)
-                    .toShuffle(vspecies(), false);
+                    .toShuffle(VSPECIES, false);
         }
 
         @ForceInline
@@ -946,7 +945,7 @@ final class LongVector256 extends LongVector {
                 v = (LongVector256) v.blend(v.lanewise(VectorOperators.ADD, length()),
                             v.compare(VectorOperators.LT, 0));
             }
-            return (LongShuffle256) v.toShuffle(vspecies(), false);
+            return (LongShuffle256) v.toShuffle(VSPECIES, false);
         }
 
         private static long[] prepare(int[] indices, int offset) {
diff --git a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/LongVector512.java b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/LongVector512.java
index b8c95967a99..3502f209c3b 100644
--- a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/LongVector512.java
+++ b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/LongVector512.java
@@ -35,9 +35,8 @@ import jdk.internal.ValueBased;
 import jdk.internal.vm.annotation.ForceInline;
 import jdk.internal.vm.vector.VectorSupport;
 
-import static jdk.internal.vm.vector.VectorSupport.*;
-
 import static jdk.incubator.vector.VectorOperators.*;
+import static jdk.internal.vm.vector.VectorSupport.*;
 
 // -- This file was mechanically generated: Do not edit! -- //
 
@@ -368,7 +367,7 @@ final class LongVector512 extends LongVector {
     @Override
     @ForceInline
     public final LongShuffle512 toShuffle() {
-        return (LongShuffle512) toShuffle(vspecies(), false);
+        return (LongShuffle512) toShuffle(VSPECIES, false);
     }
 
     // Specialized unary testing
@@ -622,7 +621,7 @@ final class LongVector512 extends LongVector {
 
         @Override
         LongMask512 uOp(MUnOp f) {
-            boolean[] res = new boolean[vspecies().laneCount()];
+            boolean[] res = new boolean[VSPECIES.laneCount()];
             boolean[] bits = getBits();
             for (int i = 0; i < res.length; i++) {
                 res[i] = f.apply(i, bits[i]);
@@ -632,7 +631,7 @@ final class LongVector512 extends LongVector {
 
         @Override
         LongMask512 bOp(VectorMask<Long> m, MBinOp f) {
-            boolean[] res = new boolean[vspecies().laneCount()];
+            boolean[] res = new boolean[VSPECIES.laneCount()];
             boolean[] bits = getBits();
             boolean[] mbits = ((LongMask512)m).getBits();
             for (int i = 0; i < res.length; i++) {
@@ -782,16 +781,16 @@ final class LongVector512 extends LongVector {
         @ForceInline
         public boolean anyTrue() {
             return VectorSupport.test(BT_ne, LongMask512.class, LANEBITS_TYPE_ORDINAL, VLENGTH,
-                                         this, vspecies().maskAll(true),
-                                         (m, __) -> anyTrueHelper(((LongMask512)m).getBits()));
+                                         this, VSPECIES.maskAll(true),
+                                         (m, _) -> anyTrueHelper(((LongMask512)m).getBits()));
         }
 
         @Override
         @ForceInline
         public boolean allTrue() {
             return VectorSupport.test(BT_overflow, LongMask512.class, LANEBITS_TYPE_ORDINAL, VLENGTH,
-                                         this, vspecies().maskAll(true),
-                                         (m, __) -> allTrueHelper(((LongMask512)m).getBits()));
+                                         this, VSPECIES.maskAll(true),
+                                         (m, _) -> allTrueHelper(((LongMask512)m).getBits()));
         }
 
         @ForceInline
@@ -799,7 +798,7 @@ final class LongVector512 extends LongVector {
         static LongMask512 maskAll(boolean bit) {
             return VectorSupport.fromBitsCoerced(LongMask512.class, LANEBITS_TYPE_ORDINAL, VLENGTH,
                                                  (bit ? -1 : 0), MODE_BROADCAST, null,
-                                                 (v, __) -> (v != 0 ? TRUE_MASK : FALSE_MASK));
+                                                 (v, _) -> (v != 0 ? TRUE_MASK : FALSE_MASK));
         }
         private static final LongMask512  TRUE_MASK = new LongMask512(true);
         private static final LongMask512 FALSE_MASK = new LongMask512(false);
@@ -859,7 +858,7 @@ final class LongVector512 extends LongVector {
 
         @Override
         LongVector512 toBitsVector0() {
-            return ((LongVector512) vspecies().asIntegral().dummyVector()).vectorFactory(indices());
+            return ((LongVector512) VSPECIES.asIntegral().dummyVector()).vectorFactory(indices());
         }
 
         @Override
@@ -933,7 +932,7 @@ final class LongVector512 extends LongVector {
         @ForceInline
         public final LongMask512 laneIsValid() {
             return (LongMask512) toBitsVector().compare(VectorOperators.GE, 0)
-                    .cast(vspecies());
+                    .cast(VSPECIES);
         }
 
         @ForceInline
@@ -941,7 +940,7 @@ final class LongVector512 extends LongVector {
         public final LongShuffle512 rearrange(VectorShuffle<Long> shuffle) {
             LongShuffle512 concreteShuffle = (LongShuffle512) shuffle;
             return (LongShuffle512) toBitsVector().rearrange(concreteShuffle)
-                    .toShuffle(vspecies(), false);
+                    .toShuffle(VSPECIES, false);
         }
 
         @ForceInline
@@ -954,7 +953,7 @@ final class LongVector512 extends LongVector {
                 v = (LongVector512) v.blend(v.lanewise(VectorOperators.ADD, length()),
                             v.compare(VectorOperators.LT, 0));
             }
-            return (LongShuffle512) v.toShuffle(vspecies(), false);
+            return (LongShuffle512) v.toShuffle(VSPECIES, false);
         }
 
         private static long[] prepare(int[] indices, int offset) {
diff --git a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/LongVector64.java b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/LongVector64.java
index 3c9b525f6d0..2a2fe4329a8 100644
--- a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/LongVector64.java
+++ b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/LongVector64.java
@@ -35,9 +35,8 @@ import jdk.internal.ValueBased;
 import jdk.internal.vm.annotation.ForceInline;
 import jdk.internal.vm.vector.VectorSupport;
 
-import static jdk.internal.vm.vector.VectorSupport.*;
-
 import static jdk.incubator.vector.VectorOperators.*;
+import static jdk.internal.vm.vector.VectorSupport.*;
 
 // -- This file was mechanically generated: Do not edit! -- //
 
@@ -368,7 +367,7 @@ final class LongVector64 extends LongVector {
     @Override
     @ForceInline
     public final LongShuffle64 toShuffle() {
-        return (LongShuffle64) toShuffle(vspecies(), false);
+        return (LongShuffle64) toShuffle(VSPECIES, false);
     }
 
     // Specialized unary testing
@@ -608,7 +607,7 @@ final class LongVector64 extends LongVector {
 
         @Override
         LongMask64 uOp(MUnOp f) {
-            boolean[] res = new boolean[vspecies().laneCount()];
+            boolean[] res = new boolean[VSPECIES.laneCount()];
             boolean[] bits = getBits();
             for (int i = 0; i < res.length; i++) {
                 res[i] = f.apply(i, bits[i]);
@@ -618,7 +617,7 @@ final class LongVector64 extends LongVector {
 
         @Override
         LongMask64 bOp(VectorMask<Long> m, MBinOp f) {
-            boolean[] res = new boolean[vspecies().laneCount()];
+            boolean[] res = new boolean[VSPECIES.laneCount()];
             boolean[] bits = getBits();
             boolean[] mbits = ((LongMask64)m).getBits();
             for (int i = 0; i < res.length; i++) {
@@ -768,16 +767,16 @@ final class LongVector64 extends LongVector {
         @ForceInline
         public boolean anyTrue() {
             return VectorSupport.test(BT_ne, LongMask64.class, LANEBITS_TYPE_ORDINAL, VLENGTH,
-                                         this, vspecies().maskAll(true),
-                                         (m, __) -> anyTrueHelper(((LongMask64)m).getBits()));
+                                         this, VSPECIES.maskAll(true),
+                                         (m, _) -> anyTrueHelper(((LongMask64)m).getBits()));
         }
 
         @Override
         @ForceInline
         public boolean allTrue() {
             return VectorSupport.test(BT_overflow, LongMask64.class, LANEBITS_TYPE_ORDINAL, VLENGTH,
-                                         this, vspecies().maskAll(true),
-                                         (m, __) -> allTrueHelper(((LongMask64)m).getBits()));
+                                         this, VSPECIES.maskAll(true),
+                                         (m, _) -> allTrueHelper(((LongMask64)m).getBits()));
         }
 
         @ForceInline
@@ -785,7 +784,7 @@ final class LongVector64 extends LongVector {
         static LongMask64 maskAll(boolean bit) {
             return VectorSupport.fromBitsCoerced(LongMask64.class, LANEBITS_TYPE_ORDINAL, VLENGTH,
                                                  (bit ? -1 : 0), MODE_BROADCAST, null,
-                                                 (v, __) -> (v != 0 ? TRUE_MASK : FALSE_MASK));
+                                                 (v, _) -> (v != 0 ? TRUE_MASK : FALSE_MASK));
         }
         private static final LongMask64  TRUE_MASK = new LongMask64(true);
         private static final LongMask64 FALSE_MASK = new LongMask64(false);
@@ -845,7 +844,7 @@ final class LongVector64 extends LongVector {
 
         @Override
         LongVector64 toBitsVector0() {
-            return ((LongVector64) vspecies().asIntegral().dummyVector()).vectorFactory(indices());
+            return ((LongVector64) VSPECIES.asIntegral().dummyVector()).vectorFactory(indices());
         }
 
         @Override
@@ -919,7 +918,7 @@ final class LongVector64 extends LongVector {
         @ForceInline
         public final LongMask64 laneIsValid() {
             return (LongMask64) toBitsVector().compare(VectorOperators.GE, 0)
-                    .cast(vspecies());
+                    .cast(VSPECIES);
         }
 
         @ForceInline
@@ -927,7 +926,7 @@ final class LongVector64 extends LongVector {
         public final LongShuffle64 rearrange(VectorShuffle<Long> shuffle) {
             LongShuffle64 concreteShuffle = (LongShuffle64) shuffle;
             return (LongShuffle64) toBitsVector().rearrange(concreteShuffle)
-                    .toShuffle(vspecies(), false);
+                    .toShuffle(VSPECIES, false);
         }
 
         @ForceInline
@@ -940,7 +939,7 @@ final class LongVector64 extends LongVector {
                 v = (LongVector64) v.blend(v.lanewise(VectorOperators.ADD, length()),
                             v.compare(VectorOperators.LT, 0));
             }
-            return (LongShuffle64) v.toShuffle(vspecies(), false);
+            return (LongShuffle64) v.toShuffle(VSPECIES, false);
         }
 
         private static long[] prepare(int[] indices, int offset) {
diff --git a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/LongVectorMax.java b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/LongVectorMax.java
index 4752959f884..157c58e20e8 100644
--- a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/LongVectorMax.java
+++ b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/LongVectorMax.java
@@ -35,9 +35,8 @@ import jdk.internal.ValueBased;
 import jdk.internal.vm.annotation.ForceInline;
 import jdk.internal.vm.vector.VectorSupport;
 
-import static jdk.internal.vm.vector.VectorSupport.*;
-
 import static jdk.incubator.vector.VectorOperators.*;
+import static jdk.internal.vm.vector.VectorSupport.*;
 
 // -- This file was mechanically generated: Do not edit! -- //
 
@@ -368,7 +367,7 @@ final class LongVectorMax extends LongVector {
     @Override
     @ForceInline
     public final LongShuffleMax toShuffle() {
-        return (LongShuffleMax) toShuffle(vspecies(), false);
+        return (LongShuffleMax) toShuffle(VSPECIES, false);
     }
 
     // Specialized unary testing
@@ -608,7 +607,7 @@ final class LongVectorMax extends LongVector {
 
         @Override
         LongMaskMax uOp(MUnOp f) {
-            boolean[] res = new boolean[vspecies().laneCount()];
+            boolean[] res = new boolean[VSPECIES.laneCount()];
             boolean[] bits = getBits();
             for (int i = 0; i < res.length; i++) {
                 res[i] = f.apply(i, bits[i]);
@@ -618,7 +617,7 @@ final class LongVectorMax extends LongVector {
 
         @Override
         LongMaskMax bOp(VectorMask<Long> m, MBinOp f) {
-            boolean[] res = new boolean[vspecies().laneCount()];
+            boolean[] res = new boolean[VSPECIES.laneCount()];
             boolean[] bits = getBits();
             boolean[] mbits = ((LongMaskMax)m).getBits();
             for (int i = 0; i < res.length; i++) {
@@ -768,16 +767,16 @@ final class LongVectorMax extends LongVector {
         @ForceInline
         public boolean anyTrue() {
             return VectorSupport.test(BT_ne, LongMaskMax.class, LANEBITS_TYPE_ORDINAL, VLENGTH,
-                                         this, vspecies().maskAll(true),
-                                         (m, __) -> anyTrueHelper(((LongMaskMax)m).getBits()));
+                                         this, VSPECIES.maskAll(true),
+                                         (m, _) -> anyTrueHelper(((LongMaskMax)m).getBits()));
         }
 
         @Override
         @ForceInline
         public boolean allTrue() {
             return VectorSupport.test(BT_overflow, LongMaskMax.class, LANEBITS_TYPE_ORDINAL, VLENGTH,
-                                         this, vspecies().maskAll(true),
-                                         (m, __) -> allTrueHelper(((LongMaskMax)m).getBits()));
+                                         this, VSPECIES.maskAll(true),
+                                         (m, _) -> allTrueHelper(((LongMaskMax)m).getBits()));
         }
 
         @ForceInline
@@ -785,7 +784,7 @@ final class LongVectorMax extends LongVector {
         static LongMaskMax maskAll(boolean bit) {
             return VectorSupport.fromBitsCoerced(LongMaskMax.class, LANEBITS_TYPE_ORDINAL, VLENGTH,
                                                  (bit ? -1 : 0), MODE_BROADCAST, null,
-                                                 (v, __) -> (v != 0 ? TRUE_MASK : FALSE_MASK));
+                                                 (v, _) -> (v != 0 ? TRUE_MASK : FALSE_MASK));
         }
         private static final LongMaskMax  TRUE_MASK = new LongMaskMax(true);
         private static final LongMaskMax FALSE_MASK = new LongMaskMax(false);
@@ -845,7 +844,7 @@ final class LongVectorMax extends LongVector {
 
         @Override
         LongVectorMax toBitsVector0() {
-            return ((LongVectorMax) vspecies().asIntegral().dummyVector()).vectorFactory(indices());
+            return ((LongVectorMax) VSPECIES.asIntegral().dummyVector()).vectorFactory(indices());
         }
 
         @Override
@@ -919,7 +918,7 @@ final class LongVectorMax extends LongVector {
         @ForceInline
         public final LongMaskMax laneIsValid() {
             return (LongMaskMax) toBitsVector().compare(VectorOperators.GE, 0)
-                    .cast(vspecies());
+                    .cast(VSPECIES);
         }
 
         @ForceInline
@@ -927,7 +926,7 @@ final class LongVectorMax extends LongVector {
         public final LongShuffleMax rearrange(VectorShuffle<Long> shuffle) {
             LongShuffleMax concreteShuffle = (LongShuffleMax) shuffle;
             return (LongShuffleMax) toBitsVector().rearrange(concreteShuffle)
-                    .toShuffle(vspecies(), false);
+                    .toShuffle(VSPECIES, false);
         }
 
         @ForceInline
@@ -940,7 +939,7 @@ final class LongVectorMax extends LongVector {
                 v = (LongVectorMax) v.blend(v.lanewise(VectorOperators.ADD, length()),
                             v.compare(VectorOperators.LT, 0));
             }
-            return (LongShuffleMax) v.toShuffle(vspecies(), false);
+            return (LongShuffleMax) v.toShuffle(VSPECIES, false);
         }
 
         private static long[] prepare(int[] indices, int offset) {
diff --git a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/ShortVector.java b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/ShortVector.java
index 7ba465706e8..21bc80a12bc 100644
--- a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/ShortVector.java
+++ b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/ShortVector.java
@@ -49,7 +49,8 @@ import static jdk.incubator.vector.VectorOperators.*;
  * {@code short} values.
  */
 @SuppressWarnings("cast")  // warning: redundant cast
-public abstract class ShortVector extends AbstractVector<Short> {
+public abstract sealed class ShortVector extends AbstractVector<Short>
+         permits ShortVector64, ShortVector128, ShortVector256, ShortVector512, ShortVectorMax {
 
     ShortVector(short[] vec) {
         super(vec);
diff --git a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/ShortVector128.java b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/ShortVector128.java
index 89ec97c6be0..22bbfce0928 100644
--- a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/ShortVector128.java
+++ b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/ShortVector128.java
@@ -25,7 +25,6 @@
 package jdk.incubator.vector;
 
 import java.lang.foreign.MemorySegment;
-import java.lang.foreign.ValueLayout;
 import java.nio.ByteOrder;
 import java.util.Arrays;
 import java.util.Objects;
@@ -35,9 +34,8 @@ import jdk.internal.ValueBased;
 import jdk.internal.vm.annotation.ForceInline;
 import jdk.internal.vm.vector.VectorSupport;
 
-import static jdk.internal.vm.vector.VectorSupport.*;
-
 import static jdk.incubator.vector.VectorOperators.*;
+import static jdk.internal.vm.vector.VectorSupport.*;
 
 // -- This file was mechanically generated: Do not edit! -- //
 
@@ -373,7 +371,7 @@ final class ShortVector128 extends ShortVector {
     @Override
     @ForceInline
     public final ShortShuffle128 toShuffle() {
-        return (ShortShuffle128) toShuffle(vspecies(), false);
+        return (ShortShuffle128) toShuffle(VSPECIES, false);
     }
 
     // Specialized unary testing
@@ -632,7 +630,7 @@ final class ShortVector128 extends ShortVector {
 
         @Override
         ShortMask128 uOp(MUnOp f) {
-            boolean[] res = new boolean[vspecies().laneCount()];
+            boolean[] res = new boolean[VSPECIES.laneCount()];
             boolean[] bits = getBits();
             for (int i = 0; i < res.length; i++) {
                 res[i] = f.apply(i, bits[i]);
@@ -642,7 +640,7 @@ final class ShortVector128 extends ShortVector {
 
         @Override
         ShortMask128 bOp(VectorMask<Short> m, MBinOp f) {
-            boolean[] res = new boolean[vspecies().laneCount()];
+            boolean[] res = new boolean[VSPECIES.laneCount()];
             boolean[] bits = getBits();
             boolean[] mbits = ((ShortMask128)m).getBits();
             for (int i = 0; i < res.length; i++) {
@@ -792,16 +790,16 @@ final class ShortVector128 extends ShortVector {
         @ForceInline
         public boolean anyTrue() {
             return VectorSupport.test(BT_ne, ShortMask128.class, LANEBITS_TYPE_ORDINAL, VLENGTH,
-                                         this, vspecies().maskAll(true),
-                                         (m, __) -> anyTrueHelper(((ShortMask128)m).getBits()));
+                                         this, VSPECIES.maskAll(true),
+                                         (m, _) -> anyTrueHelper(((ShortMask128)m).getBits()));
         }
 
         @Override
         @ForceInline
         public boolean allTrue() {
             return VectorSupport.test(BT_overflow, ShortMask128.class, LANEBITS_TYPE_ORDINAL, VLENGTH,
-                                         this, vspecies().maskAll(true),
-                                         (m, __) -> allTrueHelper(((ShortMask128)m).getBits()));
+                                         this, VSPECIES.maskAll(true),
+                                         (m, _) -> allTrueHelper(((ShortMask128)m).getBits()));
         }
 
         @ForceInline
@@ -809,7 +807,7 @@ final class ShortVector128 extends ShortVector {
         static ShortMask128 maskAll(boolean bit) {
             return VectorSupport.fromBitsCoerced(ShortMask128.class, LANEBITS_TYPE_ORDINAL, VLENGTH,
                                                  (bit ? -1 : 0), MODE_BROADCAST, null,
-                                                 (v, __) -> (v != 0 ? TRUE_MASK : FALSE_MASK));
+                                                 (v, _) -> (v != 0 ? TRUE_MASK : FALSE_MASK));
         }
         private static final ShortMask128  TRUE_MASK = new ShortMask128(true);
         private static final ShortMask128 FALSE_MASK = new ShortMask128(false);
@@ -869,7 +867,7 @@ final class ShortVector128 extends ShortVector {
 
         @Override
         ShortVector128 toBitsVector0() {
-            return ((ShortVector128) vspecies().asIntegral().dummyVector()).vectorFactory(indices());
+            return ((ShortVector128) VSPECIES.asIntegral().dummyVector()).vectorFactory(indices());
         }
 
         @Override
@@ -908,7 +906,7 @@ final class ShortVector128 extends ShortVector {
         @ForceInline
         public final ShortMask128 laneIsValid() {
             return (ShortMask128) toBitsVector().compare(VectorOperators.GE, 0)
-                    .cast(vspecies());
+                    .cast(VSPECIES);
         }
 
         @ForceInline
@@ -916,7 +914,7 @@ final class ShortVector128 extends ShortVector {
         public final ShortShuffle128 rearrange(VectorShuffle<Short> shuffle) {
             ShortShuffle128 concreteShuffle = (ShortShuffle128) shuffle;
             return (ShortShuffle128) toBitsVector().rearrange(concreteShuffle)
-                    .toShuffle(vspecies(), false);
+                    .toShuffle(VSPECIES, false);
         }
 
         @ForceInline
@@ -929,7 +927,7 @@ final class ShortVector128 extends ShortVector {
                 v = (ShortVector128) v.blend(v.lanewise(VectorOperators.ADD, length()),
                             v.compare(VectorOperators.LT, 0));
             }
-            return (ShortShuffle128) v.toShuffle(vspecies(), false);
+            return (ShortShuffle128) v.toShuffle(VSPECIES, false);
         }
 
         private static short[] prepare(int[] indices, int offset) {
diff --git a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/ShortVector256.java b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/ShortVector256.java
index 0f5751c27d8..6011695bf54 100644
--- a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/ShortVector256.java
+++ b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/ShortVector256.java
@@ -25,7 +25,6 @@
 package jdk.incubator.vector;
 
 import java.lang.foreign.MemorySegment;
-import java.lang.foreign.ValueLayout;
 import java.nio.ByteOrder;
 import java.util.Arrays;
 import java.util.Objects;
@@ -35,9 +34,8 @@ import jdk.internal.ValueBased;
 import jdk.internal.vm.annotation.ForceInline;
 import jdk.internal.vm.vector.VectorSupport;
 
-import static jdk.internal.vm.vector.VectorSupport.*;
-
 import static jdk.incubator.vector.VectorOperators.*;
+import static jdk.internal.vm.vector.VectorSupport.*;
 
 // -- This file was mechanically generated: Do not edit! -- //
 
@@ -373,7 +371,7 @@ final class ShortVector256 extends ShortVector {
     @Override
     @ForceInline
     public final ShortShuffle256 toShuffle() {
-        return (ShortShuffle256) toShuffle(vspecies(), false);
+        return (ShortShuffle256) toShuffle(VSPECIES, false);
     }
 
     // Specialized unary testing
@@ -648,7 +646,7 @@ final class ShortVector256 extends ShortVector {
 
         @Override
         ShortMask256 uOp(MUnOp f) {
-            boolean[] res = new boolean[vspecies().laneCount()];
+            boolean[] res = new boolean[VSPECIES.laneCount()];
             boolean[] bits = getBits();
             for (int i = 0; i < res.length; i++) {
                 res[i] = f.apply(i, bits[i]);
@@ -658,7 +656,7 @@ final class ShortVector256 extends ShortVector {
 
         @Override
         ShortMask256 bOp(VectorMask<Short> m, MBinOp f) {
-            boolean[] res = new boolean[vspecies().laneCount()];
+            boolean[] res = new boolean[VSPECIES.laneCount()];
             boolean[] bits = getBits();
             boolean[] mbits = ((ShortMask256)m).getBits();
             for (int i = 0; i < res.length; i++) {
@@ -808,16 +806,16 @@ final class ShortVector256 extends ShortVector {
         @ForceInline
         public boolean anyTrue() {
             return VectorSupport.test(BT_ne, ShortMask256.class, LANEBITS_TYPE_ORDINAL, VLENGTH,
-                                         this, vspecies().maskAll(true),
-                                         (m, __) -> anyTrueHelper(((ShortMask256)m).getBits()));
+                                         this, VSPECIES.maskAll(true),
+                                         (m, _) -> anyTrueHelper(((ShortMask256)m).getBits()));
         }
 
         @Override
         @ForceInline
         public boolean allTrue() {
             return VectorSupport.test(BT_overflow, ShortMask256.class, LANEBITS_TYPE_ORDINAL, VLENGTH,
-                                         this, vspecies().maskAll(true),
-                                         (m, __) -> allTrueHelper(((ShortMask256)m).getBits()));
+                                         this, VSPECIES.maskAll(true),
+                                         (m, _) -> allTrueHelper(((ShortMask256)m).getBits()));
         }
 
         @ForceInline
@@ -825,7 +823,7 @@ final class ShortVector256 extends ShortVector {
         static ShortMask256 maskAll(boolean bit) {
             return VectorSupport.fromBitsCoerced(ShortMask256.class, LANEBITS_TYPE_ORDINAL, VLENGTH,
                                                  (bit ? -1 : 0), MODE_BROADCAST, null,
-                                                 (v, __) -> (v != 0 ? TRUE_MASK : FALSE_MASK));
+                                                 (v, _) -> (v != 0 ? TRUE_MASK : FALSE_MASK));
         }
         private static final ShortMask256  TRUE_MASK = new ShortMask256(true);
         private static final ShortMask256 FALSE_MASK = new ShortMask256(false);
@@ -885,7 +883,7 @@ final class ShortVector256 extends ShortVector {
 
         @Override
         ShortVector256 toBitsVector0() {
-            return ((ShortVector256) vspecies().asIntegral().dummyVector()).vectorFactory(indices());
+            return ((ShortVector256) VSPECIES.asIntegral().dummyVector()).vectorFactory(indices());
         }
 
         @Override
@@ -924,7 +922,7 @@ final class ShortVector256 extends ShortVector {
         @ForceInline
         public final ShortMask256 laneIsValid() {
             return (ShortMask256) toBitsVector().compare(VectorOperators.GE, 0)
-                    .cast(vspecies());
+                    .cast(VSPECIES);
         }
 
         @ForceInline
@@ -932,7 +930,7 @@ final class ShortVector256 extends ShortVector {
         public final ShortShuffle256 rearrange(VectorShuffle<Short> shuffle) {
             ShortShuffle256 concreteShuffle = (ShortShuffle256) shuffle;
             return (ShortShuffle256) toBitsVector().rearrange(concreteShuffle)
-                    .toShuffle(vspecies(), false);
+                    .toShuffle(VSPECIES, false);
         }
 
         @ForceInline
@@ -945,7 +943,7 @@ final class ShortVector256 extends ShortVector {
                 v = (ShortVector256) v.blend(v.lanewise(VectorOperators.ADD, length()),
                             v.compare(VectorOperators.LT, 0));
             }
-            return (ShortShuffle256) v.toShuffle(vspecies(), false);
+            return (ShortShuffle256) v.toShuffle(VSPECIES, false);
         }
 
         private static short[] prepare(int[] indices, int offset) {
diff --git a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/ShortVector512.java b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/ShortVector512.java
index 3d38dfd88fd..e6101d2e6be 100644
--- a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/ShortVector512.java
+++ b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/ShortVector512.java
@@ -25,7 +25,6 @@
 package jdk.incubator.vector;
 
 import java.lang.foreign.MemorySegment;
-import java.lang.foreign.ValueLayout;
 import java.nio.ByteOrder;
 import java.util.Arrays;
 import java.util.Objects;
@@ -35,9 +34,8 @@ import jdk.internal.ValueBased;
 import jdk.internal.vm.annotation.ForceInline;
 import jdk.internal.vm.vector.VectorSupport;
 
-import static jdk.internal.vm.vector.VectorSupport.*;
-
 import static jdk.incubator.vector.VectorOperators.*;
+import static jdk.internal.vm.vector.VectorSupport.*;
 
 // -- This file was mechanically generated: Do not edit! -- //
 
@@ -373,7 +371,7 @@ final class ShortVector512 extends ShortVector {
     @Override
     @ForceInline
     public final ShortShuffle512 toShuffle() {
-        return (ShortShuffle512) toShuffle(vspecies(), false);
+        return (ShortShuffle512) toShuffle(VSPECIES, false);
     }
 
     // Specialized unary testing
@@ -680,7 +678,7 @@ final class ShortVector512 extends ShortVector {
 
         @Override
         ShortMask512 uOp(MUnOp f) {
-            boolean[] res = new boolean[vspecies().laneCount()];
+            boolean[] res = new boolean[VSPECIES.laneCount()];
             boolean[] bits = getBits();
             for (int i = 0; i < res.length; i++) {
                 res[i] = f.apply(i, bits[i]);
@@ -690,7 +688,7 @@ final class ShortVector512 extends ShortVector {
 
         @Override
         ShortMask512 bOp(VectorMask<Short> m, MBinOp f) {
-            boolean[] res = new boolean[vspecies().laneCount()];
+            boolean[] res = new boolean[VSPECIES.laneCount()];
             boolean[] bits = getBits();
             boolean[] mbits = ((ShortMask512)m).getBits();
             for (int i = 0; i < res.length; i++) {
@@ -840,16 +838,16 @@ final class ShortVector512 extends ShortVector {
         @ForceInline
         public boolean anyTrue() {
             return VectorSupport.test(BT_ne, ShortMask512.class, LANEBITS_TYPE_ORDINAL, VLENGTH,
-                                         this, vspecies().maskAll(true),
-                                         (m, __) -> anyTrueHelper(((ShortMask512)m).getBits()));
+                                         this, VSPECIES.maskAll(true),
+                                         (m, _) -> anyTrueHelper(((ShortMask512)m).getBits()));
         }
 
         @Override
         @ForceInline
         public boolean allTrue() {
             return VectorSupport.test(BT_overflow, ShortMask512.class, LANEBITS_TYPE_ORDINAL, VLENGTH,
-                                         this, vspecies().maskAll(true),
-                                         (m, __) -> allTrueHelper(((ShortMask512)m).getBits()));
+                                         this, VSPECIES.maskAll(true),
+                                         (m, _) -> allTrueHelper(((ShortMask512)m).getBits()));
         }
 
         @ForceInline
@@ -857,7 +855,7 @@ final class ShortVector512 extends ShortVector {
         static ShortMask512 maskAll(boolean bit) {
             return VectorSupport.fromBitsCoerced(ShortMask512.class, LANEBITS_TYPE_ORDINAL, VLENGTH,
                                                  (bit ? -1 : 0), MODE_BROADCAST, null,
-                                                 (v, __) -> (v != 0 ? TRUE_MASK : FALSE_MASK));
+                                                 (v, _) -> (v != 0 ? TRUE_MASK : FALSE_MASK));
         }
         private static final ShortMask512  TRUE_MASK = new ShortMask512(true);
         private static final ShortMask512 FALSE_MASK = new ShortMask512(false);
@@ -917,7 +915,7 @@ final class ShortVector512 extends ShortVector {
 
         @Override
         ShortVector512 toBitsVector0() {
-            return ((ShortVector512) vspecies().asIntegral().dummyVector()).vectorFactory(indices());
+            return ((ShortVector512) VSPECIES.asIntegral().dummyVector()).vectorFactory(indices());
         }
 
         @Override
@@ -956,7 +954,7 @@ final class ShortVector512 extends ShortVector {
         @ForceInline
         public final ShortMask512 laneIsValid() {
             return (ShortMask512) toBitsVector().compare(VectorOperators.GE, 0)
-                    .cast(vspecies());
+                    .cast(VSPECIES);
         }
 
         @ForceInline
@@ -964,7 +962,7 @@ final class ShortVector512 extends ShortVector {
         public final ShortShuffle512 rearrange(VectorShuffle<Short> shuffle) {
             ShortShuffle512 concreteShuffle = (ShortShuffle512) shuffle;
             return (ShortShuffle512) toBitsVector().rearrange(concreteShuffle)
-                    .toShuffle(vspecies(), false);
+                    .toShuffle(VSPECIES, false);
         }
 
         @ForceInline
@@ -977,7 +975,7 @@ final class ShortVector512 extends ShortVector {
                 v = (ShortVector512) v.blend(v.lanewise(VectorOperators.ADD, length()),
                             v.compare(VectorOperators.LT, 0));
             }
-            return (ShortShuffle512) v.toShuffle(vspecies(), false);
+            return (ShortShuffle512) v.toShuffle(VSPECIES, false);
         }
 
         private static short[] prepare(int[] indices, int offset) {
diff --git a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/ShortVector64.java b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/ShortVector64.java
index b319d98f784..31af959b4a8 100644
--- a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/ShortVector64.java
+++ b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/ShortVector64.java
@@ -25,7 +25,6 @@
 package jdk.incubator.vector;
 
 import java.lang.foreign.MemorySegment;
-import java.lang.foreign.ValueLayout;
 import java.nio.ByteOrder;
 import java.util.Arrays;
 import java.util.Objects;
@@ -35,9 +34,8 @@ import jdk.internal.ValueBased;
 import jdk.internal.vm.annotation.ForceInline;
 import jdk.internal.vm.vector.VectorSupport;
 
-import static jdk.internal.vm.vector.VectorSupport.*;
-
 import static jdk.incubator.vector.VectorOperators.*;
+import static jdk.internal.vm.vector.VectorSupport.*;
 
 // -- This file was mechanically generated: Do not edit! -- //
 
@@ -373,7 +371,7 @@ final class ShortVector64 extends ShortVector {
     @Override
     @ForceInline
     public final ShortShuffle64 toShuffle() {
-        return (ShortShuffle64) toShuffle(vspecies(), false);
+        return (ShortShuffle64) toShuffle(VSPECIES, false);
     }
 
     // Specialized unary testing
@@ -624,7 +622,7 @@ final class ShortVector64 extends ShortVector {
 
         @Override
         ShortMask64 uOp(MUnOp f) {
-            boolean[] res = new boolean[vspecies().laneCount()];
+            boolean[] res = new boolean[VSPECIES.laneCount()];
             boolean[] bits = getBits();
             for (int i = 0; i < res.length; i++) {
                 res[i] = f.apply(i, bits[i]);
@@ -634,7 +632,7 @@ final class ShortVector64 extends ShortVector {
 
         @Override
         ShortMask64 bOp(VectorMask<Short> m, MBinOp f) {
-            boolean[] res = new boolean[vspecies().laneCount()];
+            boolean[] res = new boolean[VSPECIES.laneCount()];
             boolean[] bits = getBits();
             boolean[] mbits = ((ShortMask64)m).getBits();
             for (int i = 0; i < res.length; i++) {
@@ -784,16 +782,16 @@ final class ShortVector64 extends ShortVector {
         @ForceInline
         public boolean anyTrue() {
             return VectorSupport.test(BT_ne, ShortMask64.class, LANEBITS_TYPE_ORDINAL, VLENGTH,
-                                         this, vspecies().maskAll(true),
-                                         (m, __) -> anyTrueHelper(((ShortMask64)m).getBits()));
+                                         this, VSPECIES.maskAll(true),
+                                         (m, _) -> anyTrueHelper(((ShortMask64)m).getBits()));
         }
 
         @Override
         @ForceInline
         public boolean allTrue() {
             return VectorSupport.test(BT_overflow, ShortMask64.class, LANEBITS_TYPE_ORDINAL, VLENGTH,
-                                         this, vspecies().maskAll(true),
-                                         (m, __) -> allTrueHelper(((ShortMask64)m).getBits()));
+                                         this, VSPECIES.maskAll(true),
+                                         (m, _) -> allTrueHelper(((ShortMask64)m).getBits()));
         }
 
         @ForceInline
@@ -801,7 +799,7 @@ final class ShortVector64 extends ShortVector {
         static ShortMask64 maskAll(boolean bit) {
             return VectorSupport.fromBitsCoerced(ShortMask64.class, LANEBITS_TYPE_ORDINAL, VLENGTH,
                                                  (bit ? -1 : 0), MODE_BROADCAST, null,
-                                                 (v, __) -> (v != 0 ? TRUE_MASK : FALSE_MASK));
+                                                 (v, _) -> (v != 0 ? TRUE_MASK : FALSE_MASK));
         }
         private static final ShortMask64  TRUE_MASK = new ShortMask64(true);
         private static final ShortMask64 FALSE_MASK = new ShortMask64(false);
@@ -861,7 +859,7 @@ final class ShortVector64 extends ShortVector {
 
         @Override
         ShortVector64 toBitsVector0() {
-            return ((ShortVector64) vspecies().asIntegral().dummyVector()).vectorFactory(indices());
+            return ((ShortVector64) VSPECIES.asIntegral().dummyVector()).vectorFactory(indices());
         }
 
         @Override
@@ -900,7 +898,7 @@ final class ShortVector64 extends ShortVector {
         @ForceInline
         public final ShortMask64 laneIsValid() {
             return (ShortMask64) toBitsVector().compare(VectorOperators.GE, 0)
-                    .cast(vspecies());
+                    .cast(VSPECIES);
         }
 
         @ForceInline
@@ -908,7 +906,7 @@ final class ShortVector64 extends ShortVector {
         public final ShortShuffle64 rearrange(VectorShuffle<Short> shuffle) {
             ShortShuffle64 concreteShuffle = (ShortShuffle64) shuffle;
             return (ShortShuffle64) toBitsVector().rearrange(concreteShuffle)
-                    .toShuffle(vspecies(), false);
+                    .toShuffle(VSPECIES, false);
         }
 
         @ForceInline
@@ -921,7 +919,7 @@ final class ShortVector64 extends ShortVector {
                 v = (ShortVector64) v.blend(v.lanewise(VectorOperators.ADD, length()),
                             v.compare(VectorOperators.LT, 0));
             }
-            return (ShortShuffle64) v.toShuffle(vspecies(), false);
+            return (ShortShuffle64) v.toShuffle(VSPECIES, false);
         }
 
         private static short[] prepare(int[] indices, int offset) {
diff --git a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/ShortVectorMax.java b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/ShortVectorMax.java
index 69b298857c9..fe0359c4711 100644
--- a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/ShortVectorMax.java
+++ b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/ShortVectorMax.java
@@ -25,7 +25,6 @@
 package jdk.incubator.vector;
 
 import java.lang.foreign.MemorySegment;
-import java.lang.foreign.ValueLayout;
 import java.nio.ByteOrder;
 import java.util.Arrays;
 import java.util.Objects;
@@ -35,9 +34,8 @@ import jdk.internal.ValueBased;
 import jdk.internal.vm.annotation.ForceInline;
 import jdk.internal.vm.vector.VectorSupport;
 
-import static jdk.internal.vm.vector.VectorSupport.*;
-
 import static jdk.incubator.vector.VectorOperators.*;
+import static jdk.internal.vm.vector.VectorSupport.*;
 
 // -- This file was mechanically generated: Do not edit! -- //
 
@@ -373,7 +371,7 @@ final class ShortVectorMax extends ShortVector {
     @Override
     @ForceInline
     public final ShortShuffleMax toShuffle() {
-        return (ShortShuffleMax) toShuffle(vspecies(), false);
+        return (ShortShuffleMax) toShuffle(VSPECIES, false);
     }
 
     // Specialized unary testing
@@ -618,7 +616,7 @@ final class ShortVectorMax extends ShortVector {
 
         @Override
         ShortMaskMax uOp(MUnOp f) {
-            boolean[] res = new boolean[vspecies().laneCount()];
+            boolean[] res = new boolean[VSPECIES.laneCount()];
             boolean[] bits = getBits();
             for (int i = 0; i < res.length; i++) {
                 res[i] = f.apply(i, bits[i]);
@@ -628,7 +626,7 @@ final class ShortVectorMax extends ShortVector {
 
         @Override
         ShortMaskMax bOp(VectorMask<Short> m, MBinOp f) {
-            boolean[] res = new boolean[vspecies().laneCount()];
+            boolean[] res = new boolean[VSPECIES.laneCount()];
             boolean[] bits = getBits();
             boolean[] mbits = ((ShortMaskMax)m).getBits();
             for (int i = 0; i < res.length; i++) {
@@ -778,16 +776,16 @@ final class ShortVectorMax extends ShortVector {
         @ForceInline
         public boolean anyTrue() {
             return VectorSupport.test(BT_ne, ShortMaskMax.class, LANEBITS_TYPE_ORDINAL, VLENGTH,
-                                         this, vspecies().maskAll(true),
-                                         (m, __) -> anyTrueHelper(((ShortMaskMax)m).getBits()));
+                                         this, VSPECIES.maskAll(true),
+                                         (m, _) -> anyTrueHelper(((ShortMaskMax)m).getBits()));
         }
 
         @Override
         @ForceInline
         public boolean allTrue() {
             return VectorSupport.test(BT_overflow, ShortMaskMax.class, LANEBITS_TYPE_ORDINAL, VLENGTH,
-                                         this, vspecies().maskAll(true),
-                                         (m, __) -> allTrueHelper(((ShortMaskMax)m).getBits()));
+                                         this, VSPECIES.maskAll(true),
+                                         (m, _) -> allTrueHelper(((ShortMaskMax)m).getBits()));
         }
 
         @ForceInline
@@ -795,7 +793,7 @@ final class ShortVectorMax extends ShortVector {
         static ShortMaskMax maskAll(boolean bit) {
             return VectorSupport.fromBitsCoerced(ShortMaskMax.class, LANEBITS_TYPE_ORDINAL, VLENGTH,
                                                  (bit ? -1 : 0), MODE_BROADCAST, null,
-                                                 (v, __) -> (v != 0 ? TRUE_MASK : FALSE_MASK));
+                                                 (v, _) -> (v != 0 ? TRUE_MASK : FALSE_MASK));
         }
         private static final ShortMaskMax  TRUE_MASK = new ShortMaskMax(true);
         private static final ShortMaskMax FALSE_MASK = new ShortMaskMax(false);
@@ -855,7 +853,7 @@ final class ShortVectorMax extends ShortVector {
 
         @Override
         ShortVectorMax toBitsVector0() {
-            return ((ShortVectorMax) vspecies().asIntegral().dummyVector()).vectorFactory(indices());
+            return ((ShortVectorMax) VSPECIES.asIntegral().dummyVector()).vectorFactory(indices());
         }
 
         @Override
@@ -894,7 +892,7 @@ final class ShortVectorMax extends ShortVector {
         @ForceInline
         public final ShortMaskMax laneIsValid() {
             return (ShortMaskMax) toBitsVector().compare(VectorOperators.GE, 0)
-                    .cast(vspecies());
+                    .cast(VSPECIES);
         }
 
         @ForceInline
@@ -902,7 +900,7 @@ final class ShortVectorMax extends ShortVector {
         public final ShortShuffleMax rearrange(VectorShuffle<Short> shuffle) {
             ShortShuffleMax concreteShuffle = (ShortShuffleMax) shuffle;
             return (ShortShuffleMax) toBitsVector().rearrange(concreteShuffle)
-                    .toShuffle(vspecies(), false);
+                    .toShuffle(VSPECIES, false);
         }
 
         @ForceInline
@@ -915,7 +913,7 @@ final class ShortVectorMax extends ShortVector {
                 v = (ShortVectorMax) v.blend(v.lanewise(VectorOperators.ADD, length()),
                             v.compare(VectorOperators.LT, 0));
             }
-            return (ShortShuffleMax) v.toShuffle(vspecies(), false);
+            return (ShortShuffleMax) v.toShuffle(VSPECIES, false);
         }
 
         private static short[] prepare(int[] indices, int offset) {
diff --git a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/Util.java b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/Util.java
index 8562d4b5d7a..133195fa54d 100644
--- a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/Util.java
+++ b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/Util.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2025, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -24,7 +24,7 @@
  */
 package jdk.incubator.vector;
 
-/*package-private*/ class Util {
+/*package-private*/ final class Util {
     public static void requires(boolean cond, String message) {
         if (!cond) {
             throw new InternalError(message);
diff --git a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/Vector.java b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/Vector.java
index 68b4a35067c..85b3bbca269 100644
--- a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/Vector.java
+++ b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/Vector.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2017, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2017, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -1170,9 +1170,10 @@ import java.util.Arrays;
  * @param <E> the boxed version of {@code ETYPE},
  *           the element type of a vector
  *
+ * @sealedGraph
  */
 @SuppressWarnings("exports")
-public abstract class Vector<E> extends jdk.internal.vm.vector.VectorSupport.Vector<E> {
+public abstract sealed class Vector<E> extends jdk.internal.vm.vector.VectorSupport.Vector<E> permits AbstractVector {
 
     // This type is sealed within its package.
     // Users cannot roll their own vector types.
diff --git a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/VectorIntrinsics.java b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/VectorIntrinsics.java
index 266a843083a..f0115371d48 100644
--- a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/VectorIntrinsics.java
+++ b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/VectorIntrinsics.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2020, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -28,7 +28,7 @@ import jdk.internal.vm.annotation.ForceInline;
 
 import java.util.Objects;
 
-/*non-public*/ class VectorIntrinsics {
+/*non-public*/ final class VectorIntrinsics {
     static final int VECTOR_ACCESS_OOB_CHECK =
             Integer.getInteger("jdk.incubator.vector.VECTOR_ACCESS_OOB_CHECK", 2);
 
diff --git a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/VectorMask.java b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/VectorMask.java
index 13ee9e27e0d..607b194946b 100644
--- a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/VectorMask.java
+++ b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/VectorMask.java
@@ -131,7 +131,7 @@ import java.util.Objects;
  *           the element type of a vector
  */
 @SuppressWarnings("exports")
-public abstract class VectorMask<E> extends jdk.internal.vm.vector.VectorSupport.VectorMask<E> {
+public abstract sealed class VectorMask<E> extends jdk.internal.vm.vector.VectorSupport.VectorMask<E> permits AbstractMask {
     VectorMask(boolean[] bits) { super(bits); }
 
     /**
diff --git a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/VectorMathLibrary.java b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/VectorMathLibrary.java
index 1c1cfcc78c7..823cebd85a9 100644
--- a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/VectorMathLibrary.java
+++ b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/VectorMathLibrary.java
@@ -42,7 +42,7 @@ import static jdk.internal.vm.vector.Utils.debug;
  * A wrapper for native vector math libraries bundled with the JDK (SVML and SLEEF).
  * Binds vector operations to native implementations provided by the libraries.
  */
-/*package-private*/ class VectorMathLibrary {
+/*package-private*/ final class VectorMathLibrary {
     private static final SymbolLookup LOOKUP = SymbolLookup.loaderLookup();
 
     interface Library {
diff --git a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/VectorOperators.java b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/VectorOperators.java
index 84009c55ac9..2f2d33ab130 100644
--- a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/VectorOperators.java
+++ b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/VectorOperators.java
@@ -24,13 +24,12 @@
  */
 package jdk.incubator.vector;
 
-import java.util.function.IntFunction;
-import java.util.HashMap;
 import java.util.ArrayList;
+import java.util.HashMap;
+import java.util.function.IntFunction;
 
 import jdk.internal.vm.annotation.ForceInline;
 import jdk.internal.vm.annotation.Stable;
-
 import jdk.internal.vm.vector.VectorSupport;
 
 import static jdk.internal.vm.vector.Utils.isNonCapturingLambda;
@@ -115,7 +114,7 @@ import static jdk.internal.vm.vector.Utils.isNonCapturingLambda;
  * operations on individual lane values.
  *
  */
-public abstract class VectorOperators {
+public final class VectorOperators {
     private VectorOperators() { }
 
     /**
@@ -131,12 +130,9 @@ public abstract class VectorOperators {
      * @see VectorOperators.Test Test
      * @see VectorOperators.Conversion Conversion
      *
-     * @apiNote
-     * User code should not implement this interface.  A future release of
-     * this type may restrict implementations to be members of the same
-     * package.
+     * @sealedGraph
      */
-    public interface Operator {
+    public sealed interface Operator {
         /**
          * Returns the symbolic name of this operator,
          * as a constant in {@link VectorOperators}.
@@ -235,13 +231,8 @@ public abstract class VectorOperators {
      * usable in expressions like {@code w = v0.}{@link
      * Vector#lanewise(VectorOperators.Unary)
      * lanewise}{@code (NEG)}.
-     *
-     * @apiNote
-     * User code should not implement this interface.  A future release of
-     * this type may restrict implementations to be members of the same
-     * package.
      */
-    public interface Unary extends Operator {
+    public sealed interface Unary extends Operator {
     }
 
     /**
@@ -252,12 +243,9 @@ public abstract class VectorOperators {
      * Vector#lanewise(VectorOperators.Binary,Vector)
      * lanewise}{@code (ADD, v1)}.
      *
-     * @apiNote
-     * User code should not implement this interface.  A future release of
-     * this type may restrict implementations to be members of the same
-     * package.
+     * @sealedGraph
      */
-    public interface Binary extends Operator {
+    public sealed interface Binary extends Operator {
     }
 
     /**
@@ -267,13 +255,8 @@ public abstract class VectorOperators {
      * usable in expressions like {@code w = v0.}{@link
      * Vector#lanewise(VectorOperators.Ternary,Vector,Vector)
      * lanewise}{@code (FMA, v1, v2)}.
-     *
-     * @apiNote
-     * User code should not implement this interface.  A future release of
-     * this type may restrict implementations to be members of the same
-     * package.
      */
-    public interface Ternary extends Operator {
+    public sealed interface Ternary extends Operator {
     }
 
     /**
@@ -283,13 +266,8 @@ public abstract class VectorOperators {
      * usable in expressions like {@code e = v0.}{@link
      * IntVector#reduceLanes(VectorOperators.Associative)
      * reduceLanes}{@code (ADD)}.
-     *
-     * @apiNote
-     * User code should not implement this interface.  A future release of
-     * this type may restrict implementations to be members of the same
-     * package.
      */
-    public interface Associative extends Binary {
+    public sealed interface Associative extends Binary {
     }
 
     /**
@@ -299,13 +277,8 @@ public abstract class VectorOperators {
      * usable in expressions like {@code m = v0.}{@link
      * FloatVector#test(VectorOperators.Test)
      * test}{@code (IS_FINITE)}.
-     *
-     * @apiNote
-     * User code should not implement this interface.  A future release of
-     * this type may restrict implementations to be members of the same
-     * package.
      */
-    public interface Test extends Operator {
+    public sealed interface Test extends Operator {
     }
 
     /**
@@ -315,13 +288,8 @@ public abstract class VectorOperators {
      * usable in expressions like {@code m = v0.}{@link
      * Vector#compare(VectorOperators.Comparison,Vector)
      * compare}{@code (LT, v1)}.
-     *
-     * @apiNote
-     * User code should not implement this interface.  A future release of
-     * this type may restrict implementations to be members of the same
-     * package.
      */
-    public interface Comparison extends Operator {
+    public sealed interface Comparison extends Operator {
     }
 
     /**
@@ -336,13 +304,8 @@ public abstract class VectorOperators {
      *        domain type (the input lane type)
      * @param <F> the boxed element type for the conversion
      *        range type (the output lane type)
-     *
-     * @apiNote
-     * User code should not implement this interface.  A future release of
-     * this type may restrict implementations to be members of the same
-     * package.
      */
-    public interface Conversion<E,F> extends Operator {
+    public sealed interface Conversion<E,F> extends Operator {
         /**
          * The domain of this conversion, a primitive type.
          * @return the domain of this conversion
@@ -831,7 +794,7 @@ public abstract class VectorOperators {
                                     kind, dom, ran);
     }
 
-    private abstract static class OperatorImpl implements Operator {
+    private abstract static sealed class OperatorImpl implements Operator {
         private final String symName;
         private final String opName;
         private final int opInfo;
@@ -956,35 +919,35 @@ public abstract class VectorOperators {
         }
     }
 
-    private static class UnaryImpl extends OperatorImpl implements Unary {
+    private static final class UnaryImpl extends OperatorImpl implements Unary {
         private UnaryImpl(String symName, String opName, int opInfo) {
             super(symName, opName, opInfo);
             assert((opInfo & VO_ARITY_MASK) == VO_UNARY);
         }
     }
 
-    private static class BinaryImpl extends OperatorImpl implements Binary {
+    private static sealed class BinaryImpl extends OperatorImpl implements Binary permits AssociativeImpl {
         private BinaryImpl(String symName, String opName, int opInfo) {
             super(symName, opName, opInfo);
             assert((opInfo & VO_ARITY_MASK) == VO_BINARY);
         }
     }
 
-    private static class TernaryImpl extends OperatorImpl implements Ternary {
+    private static final class TernaryImpl extends OperatorImpl implements Ternary {
         private TernaryImpl(String symName, String opName, int opInfo) {
             super(symName, opName, opInfo);
             assert((opInfo & VO_ARITY_MASK) == VO_TERNARY);
         }
     }
 
-    private static class AssociativeImpl extends BinaryImpl implements Associative {
+    private static final class AssociativeImpl extends BinaryImpl implements Associative {
         private AssociativeImpl(String symName, String opName, int opInfo) {
             super(symName, opName, opInfo);
         }
     }
 
     /*package-private*/
-    static
+    static final
     class ConversionImpl<E,F> extends OperatorImpl
                               implements Conversion<E,F> {
         private ConversionImpl(String symName, String opName, int opInfo,
@@ -1260,7 +1223,7 @@ public abstract class VectorOperators {
         }
     }
 
-    private static class TestImpl extends OperatorImpl implements Test {
+    private static final class TestImpl extends OperatorImpl implements Test {
         private TestImpl(String symName, String opName, int opInfo) {
             super(symName, opName, opInfo);
             assert((opInfo & VO_ARITY_MASK) == VO_UNARY);
@@ -1272,7 +1235,7 @@ public abstract class VectorOperators {
         }
     }
 
-    private static class ComparisonImpl extends OperatorImpl implements Comparison {
+    private static final class ComparisonImpl extends OperatorImpl implements Comparison {
         private ComparisonImpl(String symName, String opName, int opInfo) {
             super(symName, opName, opInfo);
             assert((opInfo & VO_ARITY_MASK) == VO_BINARY);
diff --git a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/VectorShuffle.java b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/VectorShuffle.java
index 9cde9d2315c..5da38a25e16 100644
--- a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/VectorShuffle.java
+++ b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/VectorShuffle.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2017, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2017, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -136,7 +136,7 @@ import java.util.function.IntUnaryOperator;
  *           the element type of a vector
  */
 @SuppressWarnings("exports")
-public abstract class VectorShuffle<E> extends jdk.internal.vm.vector.VectorSupport.VectorShuffle<E> {
+public abstract sealed class VectorShuffle<E> extends jdk.internal.vm.vector.VectorSupport.VectorShuffle<E> permits AbstractShuffle {
     VectorShuffle(Object indices) {
         super(indices);
     }
diff --git a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/VectorSpecies.java b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/VectorSpecies.java
index e80bbf231ea..4c3ef3f471d 100644
--- a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/VectorSpecies.java
+++ b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/VectorSpecies.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2017, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2017, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -36,11 +36,6 @@ import java.util.function.IntUnaryOperator;
  * of <a href="Vector.html#ETYPE">element type</a> ({@code ETYPE})
  * and {@link VectorShape shape}.
  *
- * @apiNote
- * User code should not implement this interface.  A future release of
- * this type may restrict implementations to be members of the same
- * package.
- *
  * @implNote
  * The string representation of an instance of this interface will
  * be of the form "Species[ETYPE, VLENGTH, SHAPE]", where {@code
@@ -57,7 +52,7 @@ import java.util.function.IntUnaryOperator;
  * @param <E> the boxed version of {@code ETYPE},
  *           the element type of a vector
  */
-public interface VectorSpecies<E> {
+public sealed interface VectorSpecies<E> permits AbstractSpecies {
     /**
      * Returns the primitive element type of vectors of this
      * species.
diff --git a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/X-Vector.java.template b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/X-Vector.java.template
index 95fe8ca35db..b3c5bfac302 100644
--- a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/X-Vector.java.template
+++ b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/X-Vector.java.template
@@ -49,7 +49,8 @@ import static jdk.incubator.vector.VectorOperators.*;
  * {@code $type$} values.
  */
 @SuppressWarnings("cast")  // warning: redundant cast
-public abstract class $abstractvectortype$ extends AbstractVector<$Boxtype$> {
+public abstract sealed class $abstractvectortype$ extends AbstractVector<$Boxtype$>
+         permits $Type$Vector64, $Type$Vector128, $Type$Vector256, $Type$Vector512, $Type$VectorMax {
 
     $abstractvectortype$($type$[] vec) {
         super(vec);
diff --git a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/X-VectorBits.java.template b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/X-VectorBits.java.template
index 35041a0b70f..d66d22cab19 100644
--- a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/X-VectorBits.java.template
+++ b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/X-VectorBits.java.template
@@ -25,7 +25,9 @@
 package jdk.incubator.vector;
 
 import java.lang.foreign.MemorySegment;
+#if[longOrDouble]
 import java.lang.foreign.ValueLayout;
+#end[longOrDouble]
 import java.nio.ByteOrder;
 import java.util.Arrays;
 import java.util.Objects;
@@ -35,9 +37,8 @@ import jdk.internal.ValueBased;
 import jdk.internal.vm.annotation.ForceInline;
 import jdk.internal.vm.vector.VectorSupport;
 
-import static jdk.internal.vm.vector.VectorSupport.*;
-
 import static jdk.incubator.vector.VectorOperators.*;
+import static jdk.internal.vm.vector.VectorSupport.*;
 
 #warn This file is preprocessed before being compiled
 
@@ -389,7 +390,7 @@ final class $vectortype$ extends $abstractvectortype$ {
     @Override
     @ForceInline
     public final $shuffletype$ toShuffle() {
-        return ($shuffletype$) toShuffle(vspecies(), false);
+        return ($shuffletype$) toShuffle(VSPECIES, false);
     }
 
     // Specialized unary testing
@@ -905,7 +906,7 @@ final class $vectortype$ extends $abstractvectortype$ {
 
         @Override
         $masktype$ uOp(MUnOp f) {
-            boolean[] res = new boolean[vspecies().laneCount()];
+            boolean[] res = new boolean[VSPECIES.laneCount()];
             boolean[] bits = getBits();
             for (int i = 0; i < res.length; i++) {
                 res[i] = f.apply(i, bits[i]);
@@ -915,7 +916,7 @@ final class $vectortype$ extends $abstractvectortype$ {
 
         @Override
         $masktype$ bOp(VectorMask<$Boxtype$> m, MBinOp f) {
-            boolean[] res = new boolean[vspecies().laneCount()];
+            boolean[] res = new boolean[VSPECIES.laneCount()];
             boolean[] bits = getBits();
             boolean[] mbits = (($masktype$)m).getBits();
             for (int i = 0; i < res.length; i++) {
@@ -1065,16 +1066,16 @@ final class $vectortype$ extends $abstractvectortype$ {
         @ForceInline
         public boolean anyTrue() {
             return VectorSupport.test(BT_ne, $masktype$.class, LANEBITS_TYPE_ORDINAL, VLENGTH,
-                                         this, vspecies().maskAll(true),
-                                         (m, __) -> anyTrueHelper((($masktype$)m).getBits()));
+                                         this, VSPECIES.maskAll(true),
+                                         (m, _) -> anyTrueHelper((($masktype$)m).getBits()));
         }
 
         @Override
         @ForceInline
         public boolean allTrue() {
             return VectorSupport.test(BT_overflow, $masktype$.class, LANEBITS_TYPE_ORDINAL, VLENGTH,
-                                         this, vspecies().maskAll(true),
-                                         (m, __) -> allTrueHelper((($masktype$)m).getBits()));
+                                         this, VSPECIES.maskAll(true),
+                                         (m, _) -> allTrueHelper((($masktype$)m).getBits()));
         }
 
         @ForceInline
@@ -1082,7 +1083,7 @@ final class $vectortype$ extends $abstractvectortype$ {
         static $masktype$ maskAll(boolean bit) {
             return VectorSupport.fromBitsCoerced($masktype$.class, LANEBITS_TYPE_ORDINAL, VLENGTH,
                                                  (bit ? -1 : 0), MODE_BROADCAST, null,
-                                                 (v, __) -> (v != 0 ? TRUE_MASK : FALSE_MASK));
+                                                 (v, _) -> (v != 0 ? TRUE_MASK : FALSE_MASK));
         }
         private static final $masktype$  TRUE_MASK = new $masktype$(true);
         private static final $masktype$ FALSE_MASK = new $masktype$(false);
@@ -1147,7 +1148,7 @@ final class $vectortype$ extends $abstractvectortype$ {
         @Override
         @ForceInline
         public $vectortype$ toVector() {
-            return ($vectortype$) toBitsVector().castShape(vspecies(), 0);
+            return ($vectortype$) toBitsVector().castShape(VSPECIES, 0);
         }
 #else[FP]
         @Override
@@ -1165,7 +1166,7 @@ final class $vectortype$ extends $abstractvectortype$ {
 
         @Override
         $bitsvectortype$ toBitsVector0() {
-            return (($bitsvectortype$) vspecies().asIntegral().dummyVector()).vectorFactory(indices());
+            return (($bitsvectortype$) VSPECIES.asIntegral().dummyVector()).vectorFactory(indices());
         }
 
         @Override
@@ -1301,7 +1302,7 @@ final class $vectortype$ extends $abstractvectortype$ {
         @ForceInline
         public final $masktype$ laneIsValid() {
             return ($masktype$) toBitsVector().compare(VectorOperators.GE, 0)
-                    .cast(vspecies());
+                    .cast(VSPECIES);
         }
 
         @ForceInline
@@ -1310,10 +1311,10 @@ final class $vectortype$ extends $abstractvectortype$ {
             $shuffletype$ concreteShuffle = ($shuffletype$) shuffle;
 #if[FP]
             return ($shuffletype$) toBitsVector().rearrange(concreteShuffle.cast($Bitstype$Vector.SPECIES_$BITS$))
-                    .toShuffle(vspecies(), false);
+                    .toShuffle(VSPECIES, false);
 #else[FP]
             return ($shuffletype$) toBitsVector().rearrange(concreteShuffle)
-                    .toShuffle(vspecies(), false);
+                    .toShuffle(VSPECIES, false);
 #end[FP]
         }
 
@@ -1327,7 +1328,7 @@ final class $vectortype$ extends $abstractvectortype$ {
                 v = ($bitsvectortype$) v.blend(v.lanewise(VectorOperators.ADD, length()),
                             v.compare(VectorOperators.LT, 0));
             }
-            return ($shuffletype$) v.toShuffle(vspecies(), false);
+            return ($shuffletype$) v.toShuffle(VSPECIES, false);
         }
 
         private static $bitstype$[] prepare(int[] indices, int offset) {

From 5164fbc9f841bec1ad4fb33b11a3ad11489d49d8 Mon Sep 17 00:00:00 2001
From: Rui Li <ruiamzn@amazon.com>
Date: Thu, 26 Mar 2026 23:47:12 +0000
Subject: [PATCH 378/655] 8374191: Shenandoah: Consider an assert in
 get_object_age

Reviewed-by: wkemper
---
 src/hotspot/share/gc/shenandoah/shenandoahHeap.inline.hpp | 2 ++
 1 file changed, 2 insertions(+)

diff --git a/src/hotspot/share/gc/shenandoah/shenandoahHeap.inline.hpp b/src/hotspot/share/gc/shenandoah/shenandoahHeap.inline.hpp
index 02f2beaf4e0..6d77cccaa6a 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahHeap.inline.hpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahHeap.inline.hpp
@@ -344,6 +344,8 @@ uint ShenandoahHeap::get_object_age(oop obj) {
   }
   if (w.has_monitor()) {
     w = w.monitor()->header();
+  } else {
+    assert(!w.has_displaced_mark_helper(), "Mark word should not be displaced");
   }
   assert(w.age() <= markWord::max_age, "Impossible!");
   return w.age();

From 1a9965555477ee2a6cb65e91ef54ed608e4bee66 Mon Sep 17 00:00:00 2001
From: Mohamed Issa <missa@openjdk.org>
Date: Fri, 27 Mar 2026 04:56:30 +0000
Subject: [PATCH 379/655] 8378295: Update scalar AVX10 floating point min/max
 definitions

Reviewed-by: sviswanathan, mhaessig, jbhateja, sparasa
---
 src/hotspot/cpu/x86/assembler_x86.cpp         | 160 ++++----
 src/hotspot/cpu/x86/assembler_x86.hpp         |  34 +-
 src/hotspot/cpu/x86/c2_MacroAssembler_x86.cpp |  77 +++-
 src/hotspot/cpu/x86/c2_MacroAssembler_x86.hpp |  26 +-
 src/hotspot/cpu/x86/macroAssembler_x86.cpp    |  46 ++-
 src/hotspot/cpu/x86/macroAssembler_x86.hpp    |  22 +-
 src/hotspot/cpu/x86/x86.ad                    | 353 +++++++++---------
 .../math/TestFpMinMaxReductions.java          |  32 +-
 .../compiler/lib/ir_framework/IRNode.java     |  36 +-
 .../vector/Float16OperationsBenchmark.java    |  38 +-
 .../bench/vm/compiler/FpMinMaxIntrinsics.java | 171 ++++++++-
 11 files changed, 650 insertions(+), 345 deletions(-)

diff --git a/src/hotspot/cpu/x86/assembler_x86.cpp b/src/hotspot/cpu/x86/assembler_x86.cpp
index 38a28a6ec49..a4f2968f0d1 100644
--- a/src/hotspot/cpu/x86/assembler_x86.cpp
+++ b/src/hotspot/cpu/x86/assembler_x86.cpp
@@ -3472,7 +3472,7 @@ void Assembler::vmovdqu(XMMRegister dst, XMMRegister src) {
   emit_int16(0x6F, (0xC0 | encode));
 }
 
-void Assembler::vmovw(XMMRegister dst, Register src) {
+void Assembler::evmovw(XMMRegister dst, Register src) {
   assert(VM_Version::supports_avx512_fp16(), "requires AVX512-FP16");
   InstructionAttr attributes(AVX_128bit, /* vex_w */ false, /* legacy_mode */ false, /* no_mask_reg */ true, /* uses_vl */ false);
   attributes.set_is_evex_instruction();
@@ -3480,7 +3480,7 @@ void Assembler::vmovw(XMMRegister dst, Register src) {
   emit_int16(0x6E, (0xC0 | encode));
 }
 
-void Assembler::vmovw(Register dst, XMMRegister src) {
+void Assembler::evmovw(Register dst, XMMRegister src) {
   assert(VM_Version::supports_avx512_fp16(), "requires AVX512-FP16");
   InstructionAttr attributes(AVX_128bit, /* vex_w */ false, /* legacy_mode */ false, /* no_mask_reg */ true, /* uses_vl */ false);
   attributes.set_is_evex_instruction();
@@ -3488,6 +3488,36 @@ void Assembler::vmovw(Register dst, XMMRegister src) {
   emit_int16(0x7E, (0xC0 | encode));
 }
 
+void Assembler::evmovw(XMMRegister dst, Address src) {
+  assert(VM_Version::supports_avx10_2(), "");
+  InstructionMark im(this);
+  InstructionAttr attributes(AVX_128bit, /* rex_w */ false, /* legacy_mode */ false, /* no_mask_reg */ true, /* uses_vl */ false);
+  attributes.set_address_attributes(/* tuple_type */ EVEX_T1S, /* input_size_in_bits */ EVEX_16bit);
+  attributes.set_is_evex_instruction();
+  vex_prefix(src, 0, dst->encoding(), VEX_SIMD_F3, VEX_OPCODE_MAP5, &attributes);
+  emit_int8(0x6E);
+  emit_operand(dst, src, 0);
+}
+
+void Assembler::evmovw(Address dst, XMMRegister src) {
+  assert(VM_Version::supports_avx10_2(), "");
+  InstructionMark im(this);
+  InstructionAttr attributes(AVX_128bit, /* rex_w */ false, /* legacy_mode */ false, /* no_mask_reg */ true, /* uses_vl */ false);
+  attributes.set_address_attributes(/* tuple_type */ EVEX_T1S, /* input_size_in_bits */ EVEX_16bit);
+  attributes.set_is_evex_instruction();
+  vex_prefix(dst, 0, src->encoding(), VEX_SIMD_F3, VEX_OPCODE_MAP5, &attributes);
+  emit_int8(0x7E);
+  emit_operand(src, dst, 0);
+}
+
+void Assembler::evmovw(XMMRegister dst, XMMRegister src) {
+  assert(VM_Version::supports_avx10_2(), "");
+  InstructionAttr attributes(AVX_128bit, /* rex_w */ false, /* legacy_mode */ false, /* no_mask_reg */ true, /* uses_vl */ false);
+  attributes.set_is_evex_instruction();
+  int encode = vex_prefix_and_encode(dst->encoding(), 0, src->encoding(), VEX_SIMD_F3, VEX_OPCODE_MAP5, &attributes);
+  emit_int16(0x6E, (0xC0 | encode));
+}
+
 void Assembler::vmovdqu(XMMRegister dst, Address src) {
   assert(UseAVX > 0, "");
   InstructionMark im(this);
@@ -7310,6 +7340,42 @@ void Assembler::etzcntq(Register dst, Address src, bool no_flags) {
   emit_operand(dst, src, 0);
 }
 
+void Assembler::evucomish(XMMRegister dst, Address src) {
+  InstructionMark im(this);
+  InstructionAttr attributes(AVX_128bit, /* rex_w */ false, /* legacy_mode */ false, /* no_mask_reg */ true, /* uses_vl */ false);
+  attributes.set_address_attributes(/* tuple_type */ EVEX_T1S, /* input_size_in_bits */ EVEX_16bit);
+  attributes.set_is_evex_instruction();
+  vex_prefix(src, 0, dst->encoding(), VEX_SIMD_NONE, VEX_OPCODE_MAP5, &attributes);
+  emit_int8(0x2E);
+  emit_operand(dst, src, 0);
+}
+
+void Assembler::evucomish(XMMRegister dst, XMMRegister src) {
+  InstructionAttr attributes(AVX_128bit, /* rex_w */ false, /* legacy_mode */ false, /* no_mask_reg */ true, /* uses_vl */ false);
+  attributes.set_is_evex_instruction();
+  int encode = vex_prefix_and_encode(dst->encoding(), 0, src->encoding(), VEX_SIMD_NONE, VEX_OPCODE_MAP5, &attributes);
+  emit_int16(0x2E, (0xC0 | encode));
+}
+
+void Assembler::evucomxsh(XMMRegister dst, Address src) {
+  assert(VM_Version::supports_avx10_2(), "");
+  InstructionMark im(this);
+  InstructionAttr attributes(AVX_128bit, /* rex_w */ false, /* legacy_mode */ false, /* no_mask_reg */ true, /* uses_vl */ false);
+  attributes.set_address_attributes(/* tuple_type */ EVEX_T1S, /* input_size_in_bits */ EVEX_16bit);
+  attributes.set_is_evex_instruction();
+  vex_prefix(src, 0, dst->encoding(), VEX_SIMD_F3, VEX_OPCODE_MAP5, &attributes);
+  emit_int8(0x2E);
+  emit_operand(dst, src, 0);
+}
+
+void Assembler::evucomxsh(XMMRegister dst, XMMRegister src) {
+  assert(VM_Version::supports_avx10_2(), "");
+  InstructionAttr attributes(AVX_128bit, /* rex_w */ false, /* legacy_mode */ false, /* no_mask_reg */ true, /* uses_vl */ false);
+  attributes.set_is_evex_instruction();
+  int encode = vex_prefix_and_encode(dst->encoding(), 0, src->encoding(), VEX_SIMD_F3, VEX_OPCODE_MAP5, &attributes);
+  emit_int16(0x2E, (0xC0 | encode));
+}
+
 void Assembler::ucomisd(XMMRegister dst, Address src) {
   InstructionMark im(this);
   InstructionAttr attributes(AVX_128bit, /* rex_w */ VM_Version::supports_evex(), /* legacy_mode */ false, /* no_mask_reg */ true, /* uses_vl */ false);
@@ -7327,7 +7393,7 @@ void Assembler::ucomisd(XMMRegister dst, XMMRegister src) {
   emit_int16(0x2E, (0xC0 | encode));
 }
 
-void Assembler::vucomxsd(XMMRegister dst, Address src) {
+void Assembler::evucomxsd(XMMRegister dst, Address src) {
   assert(VM_Version::supports_avx10_2(), "");
   InstructionMark im(this);
   InstructionAttr attributes(AVX_128bit, /* rex_w */ true, /* legacy_mode */ false, /* no_mask_reg */ true, /* uses_vl */ false);
@@ -7338,7 +7404,7 @@ void Assembler::vucomxsd(XMMRegister dst, Address src) {
   emit_operand(dst, src, 0);
 }
 
-void Assembler::vucomxsd(XMMRegister dst, XMMRegister src) {
+void Assembler::evucomxsd(XMMRegister dst, XMMRegister src) {
   assert(VM_Version::supports_avx10_2(), "");
   InstructionAttr attributes(AVX_128bit, /* rex_w */ true, /* legacy_mode */ false, /* no_mask_reg */ true, /* uses_vl */ false);
   attributes.set_is_evex_instruction();
@@ -7361,7 +7427,7 @@ void Assembler::ucomiss(XMMRegister dst, XMMRegister src) {
   emit_int16(0x2E, (0xC0 | encode));
 }
 
-void Assembler::vucomxss(XMMRegister dst, Address src) {
+void Assembler::evucomxss(XMMRegister dst, Address src) {
   assert(VM_Version::supports_avx10_2(), "");
   InstructionMark im(this);
   InstructionAttr attributes(AVX_128bit, /* rex_w */ false, /* legacy_mode */ false, /* no_mask_reg */ true, /* uses_vl */ false);
@@ -7372,7 +7438,7 @@ void Assembler::vucomxss(XMMRegister dst, Address src) {
   emit_operand(dst, src, 0);
 }
 
-void Assembler::vucomxss(XMMRegister dst, XMMRegister src) {
+void Assembler::evucomxss(XMMRegister dst, XMMRegister src) {
   assert(VM_Version::supports_avx10_2(), "");
   InstructionAttr attributes(AVX_128bit, /* rex_w */ false, /* legacy_mode */ false, /* no_mask_reg */ true, /* uses_vl */ false);
   attributes.set_is_evex_instruction();
@@ -8411,30 +8477,6 @@ void Assembler::vmulsh(XMMRegister dst, XMMRegister nds, XMMRegister src) {
   emit_int16(0x59, (0xC0 | encode));
 }
 
-void Assembler::vmaxsh(XMMRegister dst, XMMRegister nds, XMMRegister src) {
-  assert(VM_Version::supports_avx512_fp16(), "requires AVX512-FP16");
-  InstructionAttr attributes(AVX_128bit, /* vex_w */ false, /* legacy_mode */ false, /* no_mask_reg */ true, /* uses_vl */ false);
-  attributes.set_is_evex_instruction();
-  int encode = vex_prefix_and_encode(dst->encoding(), nds->encoding(), src->encoding(), VEX_SIMD_F3, VEX_OPCODE_MAP5, &attributes);
-  emit_int16(0x5F, (0xC0 | encode));
-}
-
-void Assembler::eminmaxsh(XMMRegister dst, XMMRegister nds, XMMRegister src, int imm8) {
-  assert(VM_Version::supports_avx10_2(), "");
-  InstructionAttr attributes(AVX_128bit, /* vex_w */ false, /* legacy_mode */ false, /* no_mask_reg */ true, /* uses_vl */ false);
-  attributes.set_is_evex_instruction();
-  int encode = vex_prefix_and_encode(dst->encoding(), nds->encoding(), src->encoding(), VEX_SIMD_NONE, VEX_OPCODE_0F_3A, &attributes);
-  emit_int24(0x53, (0xC0 | encode), imm8);
-}
-
-void Assembler::vminsh(XMMRegister dst, XMMRegister nds, XMMRegister src) {
-  assert(VM_Version::supports_avx512_fp16(), "requires AVX512-FP16");
-  InstructionAttr attributes(AVX_128bit, /* vex_w */ false, /* legacy_mode */ false, /* no_mask_reg */ true, /* uses_vl */ false);
-  attributes.set_is_evex_instruction();
-  int encode = vex_prefix_and_encode(dst->encoding(), nds->encoding(), src->encoding(), VEX_SIMD_F3, VEX_OPCODE_MAP5, &attributes);
-  emit_int16(0x5D, (0xC0 | encode));
-}
-
 void Assembler::vsqrtsh(XMMRegister dst, XMMRegister src) {
   assert(VM_Version::supports_avx512_fp16(), "requires AVX512-FP16");
   InstructionAttr attributes(AVX_128bit, /* vex_w */ false, /* legacy_mode */ false, /* no_mask_reg */ true, /* uses_vl */ false);
@@ -13369,48 +13411,38 @@ bool Assembler::is_demotable(bool no_flags, int dst_enc, int nds_enc) {
   return (!no_flags && dst_enc == nds_enc);
 }
 
-void Assembler::vmaxss(XMMRegister dst, XMMRegister nds, XMMRegister src) {
-  assert(VM_Version::supports_avx(), "");
-  InstructionAttr attributes(AVX_128bit, /* vex_w */ false, /* legacy_mode */ false, /* no_mask_reg */ true, /* uses_vl */ false);
-  int encode = vex_prefix_and_encode(dst->encoding(), nds->encoding(), src->encoding(), VEX_SIMD_F3, VEX_OPCODE_0F, &attributes);
-  emit_int16(0x5F, (0xC0 | encode));
-}
-
-void Assembler::vmaxsd(XMMRegister dst, XMMRegister nds, XMMRegister src) {
-  assert(VM_Version::supports_avx(), "");
-  InstructionAttr attributes(AVX_128bit, /* vex_w */ VM_Version::supports_evex(), /* legacy_mode */ false, /* no_mask_reg */ true, /* uses_vl */ false);
-  attributes.set_rex_vex_w_reverted();
-  int encode = vex_prefix_and_encode(dst->encoding(), nds->encoding(), src->encoding(), VEX_SIMD_F2, VEX_OPCODE_0F, &attributes);
-  emit_int16(0x5F, (0xC0 | encode));
-}
-
-void Assembler::vminss(XMMRegister dst, XMMRegister nds, XMMRegister src) {
-  assert(VM_Version::supports_avx(), "");
-  InstructionAttr attributes(AVX_128bit, /* vex_w */ false, /* legacy_mode */ false, /* no_mask_reg */ true, /* uses_vl */ false);
-  int encode = vex_prefix_and_encode(dst->encoding(), nds->encoding(), src->encoding(), VEX_SIMD_F3, VEX_OPCODE_0F, &attributes);
-  emit_int16(0x5D, (0xC0 | encode));
-}
-
-void Assembler::eminmaxss(XMMRegister dst, XMMRegister nds, XMMRegister src, int imm8) {
+void Assembler::evminmaxsh(XMMRegister dst, KRegister mask, XMMRegister nds, XMMRegister src, bool merge, int imm8) {
   assert(VM_Version::supports_avx10_2(), "");
-  InstructionAttr attributes(AVX_128bit, /* vex_w */ false, /* legacy_mode */ false, /* no_mask_reg */ true, /* uses_vl */ false);
+  InstructionAttr attributes(AVX_128bit, /* vex_w */ false, /* legacy_mode */ false, /* no_mask_reg */ false, /* uses_vl */ false);
   attributes.set_is_evex_instruction();
+  attributes.set_embedded_opmask_register_specifier(mask);
+  if (merge) {
+    attributes.reset_is_clear_context();
+  }
+  int encode = vex_prefix_and_encode(dst->encoding(), nds->encoding(), src->encoding(), VEX_SIMD_NONE, VEX_OPCODE_0F_3A, &attributes);
+  emit_int24(0x53, (0xC0 | encode), imm8);
+}
+
+void Assembler::evminmaxss(XMMRegister dst, KRegister mask, XMMRegister nds, XMMRegister src, bool merge, int imm8) {
+  assert(VM_Version::supports_avx10_2(), "");
+  InstructionAttr attributes(AVX_128bit, /* vex_w */ false, /* legacy_mode */ false, /* no_mask_reg */ false, /* uses_vl */ false);
+  attributes.set_is_evex_instruction();
+  attributes.set_embedded_opmask_register_specifier(mask);
+  if (merge) {
+    attributes.reset_is_clear_context();
+  }
   int encode = vex_prefix_and_encode(dst->encoding(), nds->encoding(), src->encoding(), VEX_SIMD_66, VEX_OPCODE_0F_3A, &attributes);
   emit_int24(0x53, (0xC0 | encode), imm8);
 }
 
-void Assembler::vminsd(XMMRegister dst, XMMRegister nds, XMMRegister src) {
-  assert(VM_Version::supports_avx(), "");
-  InstructionAttr attributes(AVX_128bit, /* vex_w */ VM_Version::supports_evex(), /* legacy_mode */ false, /* no_mask_reg */ true, /* uses_vl */ false);
-  attributes.set_rex_vex_w_reverted();
-  int encode = vex_prefix_and_encode(dst->encoding(), nds->encoding(), src->encoding(), VEX_SIMD_F2, VEX_OPCODE_0F, &attributes);
-  emit_int16(0x5D, (0xC0 | encode));
-}
-
-void Assembler::eminmaxsd(XMMRegister dst, XMMRegister nds, XMMRegister src, int imm8) {
+void Assembler::evminmaxsd(XMMRegister dst, KRegister mask, XMMRegister nds, XMMRegister src, bool merge, int imm8) {
   assert(VM_Version::supports_avx10_2(), "");
-  InstructionAttr attributes(AVX_128bit, /* vex_w */ true, /* legacy_mode */ false, /* no_mask_reg */ true, /* uses_vl */ false);
+  InstructionAttr attributes(AVX_128bit, /* vex_w */ true, /* legacy_mode */ false, /* no_mask_reg */ false, /* uses_vl */ false);
   attributes.set_is_evex_instruction();
+  attributes.set_embedded_opmask_register_specifier(mask);
+  if (merge) {
+    attributes.reset_is_clear_context();
+  }
   int encode = vex_prefix_and_encode(dst->encoding(), nds->encoding(), src->encoding(), VEX_SIMD_66, VEX_OPCODE_0F_3A, &attributes);
   emit_int24(0x53, (0xC0 | encode), imm8);
 }
diff --git a/src/hotspot/cpu/x86/assembler_x86.hpp b/src/hotspot/cpu/x86/assembler_x86.hpp
index 57a5e25d7a6..98684752b0c 100644
--- a/src/hotspot/cpu/x86/assembler_x86.hpp
+++ b/src/hotspot/cpu/x86/assembler_x86.hpp
@@ -1694,8 +1694,11 @@ private:
   void movsbl(Register dst, Address src);
   void movsbl(Register dst, Register src);
 
-  void vmovw(XMMRegister dst, Register src);
-  void vmovw(Register dst, XMMRegister src);
+  void evmovw(XMMRegister dst, Register src);
+  void evmovw(Register dst, XMMRegister src);
+  void evmovw(XMMRegister dst, Address src);
+  void evmovw(Address dst, XMMRegister src);
+  void evmovw(XMMRegister dst, XMMRegister src);
 
   void movsbq(Register dst, Address src);
   void movsbq(Register dst, Register src);
@@ -2329,17 +2332,23 @@ private:
   void tzcntq(Register dst, Address src);
   void etzcntq(Register dst, Address src, bool no_flags);
 
+  // Unordered Compare Scalar Half-Precision Floating-Point Values and set EFLAGS
+  void evucomish(XMMRegister dst, Address src);
+  void evucomish(XMMRegister dst, XMMRegister src);
+  void evucomxsh(XMMRegister dst, Address src);
+  void evucomxsh(XMMRegister dst, XMMRegister src);
+
   // Unordered Compare Scalar Double-Precision Floating-Point Values and set EFLAGS
   void ucomisd(XMMRegister dst, Address src);
   void ucomisd(XMMRegister dst, XMMRegister src);
-  void vucomxsd(XMMRegister dst, Address src);
-  void vucomxsd(XMMRegister dst, XMMRegister src);
+  void evucomxsd(XMMRegister dst, Address src);
+  void evucomxsd(XMMRegister dst, XMMRegister src);
 
   // Unordered Compare Scalar Single-Precision Floating-Point Values and set EFLAGS
   void ucomiss(XMMRegister dst, Address src);
   void ucomiss(XMMRegister dst, XMMRegister src);
-  void vucomxss(XMMRegister dst, Address src);
-  void vucomxss(XMMRegister dst, XMMRegister src);
+  void evucomxss(XMMRegister dst, Address src);
+  void evucomxss(XMMRegister dst, XMMRegister src);
 
   void xabort(int8_t imm8);
 
@@ -2417,11 +2426,6 @@ private:
   void vsubss(XMMRegister dst, XMMRegister nds, Address src);
   void vsubss(XMMRegister dst, XMMRegister nds, XMMRegister src);
 
-  void vmaxss(XMMRegister dst, XMMRegister nds, XMMRegister src);
-  void vmaxsd(XMMRegister dst, XMMRegister nds, XMMRegister src);
-  void vminss(XMMRegister dst, XMMRegister nds, XMMRegister src);
-  void vminsd(XMMRegister dst, XMMRegister nds, XMMRegister src);
-
   void sarxl(Register dst, Register src1, Register src2);
   void sarxl(Register dst, Address src1, Register src2);
   void sarxq(Register dst, Register src1, Register src2);
@@ -2552,8 +2556,6 @@ private:
   void vsubsh(XMMRegister dst, XMMRegister nds, XMMRegister src);
   void vmulsh(XMMRegister dst, XMMRegister nds, XMMRegister src);
   void vdivsh(XMMRegister dst, XMMRegister nds, XMMRegister src);
-  void vmaxsh(XMMRegister dst, XMMRegister nds, XMMRegister src);
-  void vminsh(XMMRegister dst, XMMRegister nds, XMMRegister src);
   void vsqrtsh(XMMRegister dst, XMMRegister src);
   void vfmadd132sh(XMMRegister dst, XMMRegister src1, XMMRegister src2);
 
@@ -2790,9 +2792,9 @@ private:
   void vminpd(XMMRegister dst, XMMRegister src1, XMMRegister src2, int vector_len);
 
   // AVX10.2 floating point minmax instructions
-  void eminmaxsh(XMMRegister dst, XMMRegister nds, XMMRegister src, int imm8);
-  void eminmaxss(XMMRegister dst, XMMRegister nds, XMMRegister src, int imm8);
-  void eminmaxsd(XMMRegister dst, XMMRegister nds, XMMRegister src, int imm8);
+  void evminmaxsh(XMMRegister dst, KRegister mask, XMMRegister nds, XMMRegister src, bool merge, int imm8);
+  void evminmaxss(XMMRegister dst, KRegister mask, XMMRegister nds, XMMRegister src, bool merge, int imm8);
+  void evminmaxsd(XMMRegister dst, KRegister mask, XMMRegister nds, XMMRegister src, bool merge, int imm8);
   void evminmaxph(XMMRegister dst, KRegister mask, XMMRegister nds, XMMRegister src, bool merge, int imm8, int vector_len);
   void evminmaxph(XMMRegister dst, KRegister mask, XMMRegister nds, Address src, bool merge, int imm8, int vector_len);
   void evminmaxps(XMMRegister dst, KRegister mask, XMMRegister nds, XMMRegister src, bool merge, int imm8, int vector_len);
diff --git a/src/hotspot/cpu/x86/c2_MacroAssembler_x86.cpp b/src/hotspot/cpu/x86/c2_MacroAssembler_x86.cpp
index 5b5fb02967c..c1df726b5ba 100644
--- a/src/hotspot/cpu/x86/c2_MacroAssembler_x86.cpp
+++ b/src/hotspot/cpu/x86/c2_MacroAssembler_x86.cpp
@@ -1037,8 +1037,8 @@ void C2_MacroAssembler::evminmax_fp(int opcode, BasicType elem_bt,
   }
 }
 
-void C2_MacroAssembler::vminmax_fp(int opc, BasicType elem_bt, XMMRegister dst, KRegister mask,
-                                   XMMRegister src1, XMMRegister src2, int vlen_enc) {
+void C2_MacroAssembler::vminmax_fp_avx10_2(int opc, BasicType elem_bt, XMMRegister dst, KRegister mask,
+                                           XMMRegister src1, XMMRegister src2, int vlen_enc) {
   assert(opc == Op_MinV || opc == Op_MinReductionV ||
          opc == Op_MaxV || opc == Op_MaxReductionV, "sanity");
 
@@ -1052,6 +1052,21 @@ void C2_MacroAssembler::vminmax_fp(int opc, BasicType elem_bt, XMMRegister dst,
   }
 }
 
+void C2_MacroAssembler::sminmax_fp_avx10_2(int opc, BasicType elem_bt, XMMRegister dst, KRegister mask,
+                                           XMMRegister src1, XMMRegister src2) {
+  assert(opc == Op_MinF || opc == Op_MaxF ||
+         opc == Op_MinD || opc == Op_MaxD, "sanity");
+
+  int imm8 = (opc == Op_MinF || opc == Op_MinD) ? AVX10_2_MINMAX_MIN_COMPARE_SIGN
+                                                : AVX10_2_MINMAX_MAX_COMPARE_SIGN;
+  if (elem_bt == T_FLOAT) {
+    evminmaxss(dst, mask, src1, src2, true, imm8);
+  } else {
+    assert(elem_bt == T_DOUBLE, "");
+    evminmaxsd(dst, mask, src1, src2, true, imm8);
+  }
+}
+
 // Float/Double signum
 void C2_MacroAssembler::signum_fp(int opcode, XMMRegister dst, XMMRegister zero, XMMRegister one) {
   assert(opcode == Op_SignumF || opcode == Op_SignumD, "sanity");
@@ -1063,7 +1078,7 @@ void C2_MacroAssembler::signum_fp(int opcode, XMMRegister dst, XMMRegister zero,
   // If other floating point comparison instructions used, ZF=1 for equal and unordered cases
   if (opcode == Op_SignumF) {
     if (VM_Version::supports_avx10_2()) {
-      vucomxss(dst, zero);
+      evucomxss(dst, zero);
       jcc(Assembler::negative, DONE_LABEL);
     } else {
       ucomiss(dst, zero);
@@ -1074,7 +1089,7 @@ void C2_MacroAssembler::signum_fp(int opcode, XMMRegister dst, XMMRegister zero,
     xorps(dst, ExternalAddress(StubRoutines::x86::vector_float_sign_flip()), noreg);
   } else if (opcode == Op_SignumD) {
     if (VM_Version::supports_avx10_2()) {
-      vucomxsd(dst, zero);
+      evucomxsd(dst, zero);
       jcc(Assembler::negative, DONE_LABEL);
     } else {
       ucomisd(dst, zero);
@@ -2400,7 +2415,7 @@ void C2_MacroAssembler::reduceFloatMinMax(int opcode, int vlen, bool is_dst_vali
     }
 
     if (VM_Version::supports_avx10_2()) {
-      vminmax_fp(opcode, T_FLOAT, wdst, k0, wtmp, wsrc, vlen_enc);
+      vminmax_fp_avx10_2(opcode, T_FLOAT, wdst, k0, wtmp, wsrc, vlen_enc);
     } else {
       vminmax_fp(opcode, T_FLOAT, wdst, wtmp, wsrc, tmp, atmp, btmp, vlen_enc);
     }
@@ -2409,7 +2424,7 @@ void C2_MacroAssembler::reduceFloatMinMax(int opcode, int vlen, bool is_dst_vali
   }
   if (is_dst_valid) {
     if (VM_Version::supports_avx10_2()) {
-      vminmax_fp(opcode, T_FLOAT, dst, k0, wdst, dst, Assembler::AVX_128bit);
+      vminmax_fp_avx10_2(opcode, T_FLOAT, dst, k0, wdst, dst, Assembler::AVX_128bit);
     } else {
       vminmax_fp(opcode, T_FLOAT, dst, wdst, dst, tmp, atmp, btmp, Assembler::AVX_128bit);
     }
@@ -2440,7 +2455,7 @@ void C2_MacroAssembler::reduceDoubleMinMax(int opcode, int vlen, bool is_dst_val
     }
 
     if (VM_Version::supports_avx10_2()) {
-      vminmax_fp(opcode, T_DOUBLE, wdst, k0, wtmp, wsrc, vlen_enc);
+      vminmax_fp_avx10_2(opcode, T_DOUBLE, wdst, k0, wtmp, wsrc, vlen_enc);
     } else {
       vminmax_fp(opcode, T_DOUBLE, wdst, wtmp, wsrc, tmp, atmp, btmp, vlen_enc);
     }
@@ -2451,7 +2466,7 @@ void C2_MacroAssembler::reduceDoubleMinMax(int opcode, int vlen, bool is_dst_val
 
   if (is_dst_valid) {
     if (VM_Version::supports_avx10_2()) {
-      vminmax_fp(opcode, T_DOUBLE, dst, k0, wdst, dst, Assembler::AVX_128bit);
+      vminmax_fp_avx10_2(opcode, T_DOUBLE, dst, k0, wdst, dst, Assembler::AVX_128bit);
     } else {
       vminmax_fp(opcode, T_DOUBLE, dst, wdst, dst, tmp, atmp, btmp, Assembler::AVX_128bit);
     }
@@ -7061,13 +7076,25 @@ void C2_MacroAssembler::evfp16ph(int opcode, XMMRegister dst, XMMRegister src1,
   }
 }
 
-void C2_MacroAssembler::scalar_max_min_fp16(int opcode, XMMRegister dst, XMMRegister src1, XMMRegister src2,
-                                            KRegister ktmp, XMMRegister xtmp1, XMMRegister xtmp2) {
-  vector_max_min_fp16(opcode, dst, src1, src2, ktmp, xtmp1, xtmp2, Assembler::AVX_128bit);
+void C2_MacroAssembler::sminmax_fp16(int opcode, XMMRegister dst, XMMRegister src1, XMMRegister src2,
+                                     KRegister ktmp, XMMRegister xtmp1, XMMRegister xtmp2) {
+  vminmax_fp16(opcode, dst, src1, src2, ktmp, xtmp1, xtmp2, Assembler::AVX_128bit);
 }
 
-void C2_MacroAssembler::vector_max_min_fp16(int opcode, XMMRegister dst, XMMRegister src1, XMMRegister src2,
-                                            KRegister ktmp, XMMRegister xtmp1, XMMRegister xtmp2, int vlen_enc) {
+void C2_MacroAssembler::sminmax_fp16_avx10_2(int opcode, XMMRegister dst, XMMRegister src1, XMMRegister src2,
+                                             KRegister ktmp) {
+  if (opcode == Op_MaxHF) {
+    // dst = max(src1, src2)
+    evminmaxsh(dst, ktmp, src1, src2, true, AVX10_2_MINMAX_MAX_COMPARE_SIGN);
+  } else {
+    assert(opcode == Op_MinHF, "");
+    // dst = min(src1, src2)
+    evminmaxsh(dst, ktmp, src1, src2, true, AVX10_2_MINMAX_MIN_COMPARE_SIGN);
+  }
+}
+
+void C2_MacroAssembler::vminmax_fp16(int opcode, XMMRegister dst, XMMRegister src1, XMMRegister src2,
+                                     KRegister ktmp, XMMRegister xtmp1, XMMRegister xtmp2, int vlen_enc) {
   if (opcode == Op_MaxVHF || opcode == Op_MaxHF) {
     // Move sign bits of src2 to mask register.
     evpmovw2m(ktmp, src2, vlen_enc);
@@ -7110,3 +7137,27 @@ void C2_MacroAssembler::vector_max_min_fp16(int opcode, XMMRegister dst, XMMRegi
     Assembler::evmovdquw(dst, ktmp, xtmp1, true, vlen_enc);
   }
 }
+
+void C2_MacroAssembler::vminmax_fp16_avx10_2(int opcode, XMMRegister dst, XMMRegister src1, XMMRegister src2,
+                                             KRegister ktmp, int vlen_enc) {
+  if (opcode == Op_MaxVHF) {
+    // dst = max(src1, src2)
+    evminmaxph(dst, ktmp, src1, src2, true, AVX10_2_MINMAX_MAX_COMPARE_SIGN, vlen_enc);
+  } else {
+    assert(opcode == Op_MinVHF, "");
+    // dst = min(src1, src2)
+    evminmaxph(dst, ktmp, src1, src2, true, AVX10_2_MINMAX_MIN_COMPARE_SIGN, vlen_enc);
+  }
+}
+
+void C2_MacroAssembler::vminmax_fp16_avx10_2(int opcode, XMMRegister dst, XMMRegister src1, Address src2,
+                                             KRegister ktmp, int vlen_enc) {
+  if (opcode == Op_MaxVHF) {
+    // dst = max(src1, src2)
+    evminmaxph(dst, ktmp, src1, src2, true, AVX10_2_MINMAX_MAX_COMPARE_SIGN, vlen_enc);
+  } else {
+    assert(opcode == Op_MinVHF, "");
+    // dst = min(src1, src2)
+    evminmaxph(dst, ktmp, src1, src2, true, AVX10_2_MINMAX_MIN_COMPARE_SIGN, vlen_enc);
+  }
+}
diff --git a/src/hotspot/cpu/x86/c2_MacroAssembler_x86.hpp b/src/hotspot/cpu/x86/c2_MacroAssembler_x86.hpp
index 6d8b0ceaebe..4e77f8a5f6f 100644
--- a/src/hotspot/cpu/x86/c2_MacroAssembler_x86.hpp
+++ b/src/hotspot/cpu/x86/c2_MacroAssembler_x86.hpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2020, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -67,8 +67,11 @@ public:
                   XMMRegister tmp, XMMRegister atmp, XMMRegister btmp,
                   int vlen_enc);
 
-  void vminmax_fp(int opc, BasicType elem_bt, XMMRegister dst, KRegister mask,
-                  XMMRegister src1, XMMRegister src2, int vlen_enc);
+  void vminmax_fp_avx10_2(int opc, BasicType elem_bt, XMMRegister dst, KRegister mask,
+                          XMMRegister src1, XMMRegister src2, int vlen_enc);
+
+  void sminmax_fp_avx10_2(int opc, BasicType elem_bt, XMMRegister dst, KRegister mask,
+                          XMMRegister src1, XMMRegister src2);
 
   void vpuminmaxq(int opcode, XMMRegister dst, XMMRegister src1, XMMRegister src2, XMMRegister xtmp1, XMMRegister xtmp2, int vlen_enc);
 
@@ -576,11 +579,20 @@ public:
 
   void evfp16ph(int opcode, XMMRegister dst, XMMRegister src1, Address src2, int vlen_enc);
 
-  void vector_max_min_fp16(int opcode, XMMRegister dst, XMMRegister src1, XMMRegister src2,
-                          KRegister ktmp, XMMRegister xtmp1, XMMRegister xtmp2, int vlen_enc);
+  void vminmax_fp16(int opcode, XMMRegister dst, XMMRegister src1, XMMRegister src2,
+                    KRegister ktmp, XMMRegister xtmp1, XMMRegister xtmp2, int vlen_enc);
 
-  void scalar_max_min_fp16(int opcode, XMMRegister dst, XMMRegister src1, XMMRegister src2,
-                          KRegister ktmp, XMMRegister xtmp1, XMMRegister xtmp2);
+  void vminmax_fp16_avx10_2(int opcode, XMMRegister dst, XMMRegister src1, XMMRegister src2,
+                            KRegister ktmp, int vlen_enc);
+
+  void vminmax_fp16_avx10_2(int opcode, XMMRegister dst, XMMRegister src1, Address src2,
+                            KRegister ktmp, int vlen_enc);
+
+  void sminmax_fp16(int opcode, XMMRegister dst, XMMRegister src1, XMMRegister src2,
+                    KRegister ktmp, XMMRegister xtmp1, XMMRegister xtmp2);
+
+  void sminmax_fp16_avx10_2(int opcode, XMMRegister dst, XMMRegister src1, XMMRegister src2,
+                            KRegister ktmp);
 
   void reconstruct_frame_pointer(Register rtmp);
 
diff --git a/src/hotspot/cpu/x86/macroAssembler_x86.cpp b/src/hotspot/cpu/x86/macroAssembler_x86.cpp
index a0f08145d55..356bf8af5c0 100644
--- a/src/hotspot/cpu/x86/macroAssembler_x86.cpp
+++ b/src/hotspot/cpu/x86/macroAssembler_x86.cpp
@@ -1958,6 +1958,16 @@ void MacroAssembler::movflt(XMMRegister dst, AddressLiteral src, Register rscrat
   }
 }
 
+void MacroAssembler::movhlf(XMMRegister dst, XMMRegister src, Register rscratch) {
+  if (VM_Version::supports_avx10_2()) {
+    evmovw(dst, src);
+  } else {
+    assert(rscratch != noreg, "missing");
+    evmovw(rscratch, src);
+    evmovw(dst, rscratch);
+  }
+}
+
 void MacroAssembler::mov64(Register dst, int64_t imm64) {
   if (is_uimm32(imm64)) {
     movl(dst, checked_cast<uint32_t>(imm64));
@@ -2661,14 +2671,14 @@ void MacroAssembler::ucomisd(XMMRegister dst, AddressLiteral src, Register rscra
   }
 }
 
-void MacroAssembler::vucomxsd(XMMRegister dst, AddressLiteral src, Register rscratch) {
+void MacroAssembler::evucomxsd(XMMRegister dst, AddressLiteral src, Register rscratch) {
   assert(rscratch != noreg || always_reachable(src), "missing");
 
   if (reachable(src)) {
-    Assembler::vucomxsd(dst, as_Address(src));
+    Assembler::evucomxsd(dst, as_Address(src));
   } else {
     lea(rscratch, src);
-    Assembler::vucomxsd(dst, Address(rscratch, 0));
+    Assembler::evucomxsd(dst, Address(rscratch, 0));
   }
 }
 
@@ -2683,14 +2693,36 @@ void MacroAssembler::ucomiss(XMMRegister dst, AddressLiteral src, Register rscra
   }
 }
 
-void MacroAssembler::vucomxss(XMMRegister dst, AddressLiteral src, Register rscratch) {
+void MacroAssembler::evucomxss(XMMRegister dst, AddressLiteral src, Register rscratch) {
   assert(rscratch != noreg || always_reachable(src), "missing");
 
   if (reachable(src)) {
-    Assembler::vucomxss(dst, as_Address(src));
+    Assembler::evucomxss(dst, as_Address(src));
   } else {
     lea(rscratch, src);
-    Assembler::vucomxss(dst, Address(rscratch, 0));
+    Assembler::evucomxss(dst, Address(rscratch, 0));
+  }
+}
+
+void MacroAssembler::evucomish(XMMRegister dst, AddressLiteral src, Register rscratch) {
+  assert(rscratch != noreg || always_reachable(src), "missing");
+
+  if (reachable(src)) {
+    Assembler::evucomish(dst, as_Address(src));
+  } else {
+    lea(rscratch, src);
+    Assembler::evucomish(dst, Address(rscratch, 0));
+  }
+}
+
+void MacroAssembler::evucomxsh(XMMRegister dst, AddressLiteral src, Register rscratch) {
+  assert(rscratch != noreg || always_reachable(src), "missing");
+
+  if (reachable(src)) {
+    Assembler::evucomxsh(dst, as_Address(src));
+  } else {
+    lea(rscratch, src);
+    Assembler::evucomxsh(dst, Address(rscratch, 0));
   }
 }
 
@@ -9163,7 +9195,7 @@ void MacroAssembler::evpmaxs(BasicType type, XMMRegister dst, KRegister mask, XM
     case T_FLOAT:
       evminmaxps(dst, mask, nds, src, merge, AVX10_2_MINMAX_MAX_COMPARE_SIGN, vector_len); break;
     case T_DOUBLE:
-      evminmaxps(dst, mask, nds, src, merge, AVX10_2_MINMAX_MAX_COMPARE_SIGN, vector_len); break;
+      evminmaxpd(dst, mask, nds, src, merge, AVX10_2_MINMAX_MAX_COMPARE_SIGN, vector_len); break;
     default:
       fatal("Unexpected type argument %s", type2name(type)); break;
   }
diff --git a/src/hotspot/cpu/x86/macroAssembler_x86.hpp b/src/hotspot/cpu/x86/macroAssembler_x86.hpp
index 3bdd1e4477a..021d2943ee8 100644
--- a/src/hotspot/cpu/x86/macroAssembler_x86.hpp
+++ b/src/hotspot/cpu/x86/macroAssembler_x86.hpp
@@ -162,6 +162,8 @@ class MacroAssembler: public Assembler {
 
   void incrementq(AddressLiteral dst, Register rscratch = noreg);
 
+  void movhlf(XMMRegister dst, XMMRegister src, Register rscratch = noreg);
+
   // Support optimal SSE move instructions.
   void movflt(XMMRegister dst, XMMRegister src) {
     if (dst-> encoding() == src->encoding()) return;
@@ -1308,21 +1310,29 @@ public:
   void subss(XMMRegister dst, Address        src) { Assembler::subss(dst, src); }
   void subss(XMMRegister dst, AddressLiteral src, Register rscratch = noreg);
 
+  void evucomish(XMMRegister dst, XMMRegister    src) { Assembler::evucomish(dst, src); }
+  void evucomish(XMMRegister dst, Address        src) { Assembler::evucomish(dst, src); }
+  void evucomish(XMMRegister dst, AddressLiteral src, Register rscratch = noreg);
+
+  void evucomxsh(XMMRegister dst, XMMRegister    src) { Assembler::evucomxsh(dst, src); }
+  void evucomxsh(XMMRegister dst, Address        src) { Assembler::evucomxsh(dst, src); }
+  void evucomxsh(XMMRegister dst, AddressLiteral src, Register rscratch = noreg);
+
   void ucomiss(XMMRegister dst, XMMRegister    src) { Assembler::ucomiss(dst, src); }
   void ucomiss(XMMRegister dst, Address        src) { Assembler::ucomiss(dst, src); }
   void ucomiss(XMMRegister dst, AddressLiteral src, Register rscratch = noreg);
 
-  void vucomxss(XMMRegister dst, XMMRegister    src) { Assembler::vucomxss(dst, src); }
-  void vucomxss(XMMRegister dst, Address        src) { Assembler::vucomxss(dst, src); }
-  void vucomxss(XMMRegister dst, AddressLiteral src, Register rscratch = noreg);
+  void evucomxss(XMMRegister dst, XMMRegister    src) { Assembler::evucomxss(dst, src); }
+  void evucomxss(XMMRegister dst, Address        src) { Assembler::evucomxss(dst, src); }
+  void evucomxss(XMMRegister dst, AddressLiteral src, Register rscratch = noreg);
 
   void ucomisd(XMMRegister dst, XMMRegister    src) { Assembler::ucomisd(dst, src); }
   void ucomisd(XMMRegister dst, Address        src) { Assembler::ucomisd(dst, src); }
   void ucomisd(XMMRegister dst, AddressLiteral src, Register rscratch = noreg);
 
-  void vucomxsd(XMMRegister dst, XMMRegister    src) { Assembler::vucomxsd(dst, src); }
-  void vucomxsd(XMMRegister dst, Address        src) { Assembler::vucomxsd(dst, src); }
-  void vucomxsd(XMMRegister dst, AddressLiteral src, Register rscratch = noreg);
+  void evucomxsd(XMMRegister dst, XMMRegister    src) { Assembler::evucomxsd(dst, src); }
+  void evucomxsd(XMMRegister dst, Address        src) { Assembler::evucomxsd(dst, src); }
+  void evucomxsd(XMMRegister dst, AddressLiteral src, Register rscratch = noreg);
 
   // Bitwise Logical XOR of Packed Double-Precision Floating-Point Values
   void xorpd(XMMRegister dst, XMMRegister    src);
diff --git a/src/hotspot/cpu/x86/x86.ad b/src/hotspot/cpu/x86/x86.ad
index f31d64f3d7e..d7014141234 100644
--- a/src/hotspot/cpu/x86/x86.ad
+++ b/src/hotspot/cpu/x86/x86.ad
@@ -1708,84 +1708,99 @@ static void emit_cmpfp3(MacroAssembler* masm, Register dst) {
   __ bind(done);
 }
 
-// Math.min()    # Math.max()
-// --------------------------
-// ucomis[s/d]   #
-// ja   -> b     # a
-// jp   -> NaN   # NaN
-// jb   -> a     # b
-// je            #
-// |-jz -> a | b # a & b
-// |    -> a     #
+enum FP_PREC {
+  fp_prec_hlf,
+  fp_prec_flt,
+  fp_prec_dbl
+};
+
+static inline void emit_fp_ucom(MacroAssembler* masm, enum FP_PREC pt,
+                                XMMRegister p, XMMRegister q) {
+  if (pt == fp_prec_hlf) {
+    __ evucomish(p, q);
+  } else if (pt == fp_prec_flt) {
+    __ ucomiss(p, q);
+  } else {
+    __ ucomisd(p, q);
+  }
+}
+
+static inline void movfp(MacroAssembler* masm, enum FP_PREC pt,
+                         XMMRegister dst, XMMRegister src, Register scratch) {
+  if (pt == fp_prec_hlf) {
+    __ movhlf(dst, src, scratch);
+  } else if (pt == fp_prec_flt) {
+    __ movflt(dst, src);
+  } else {
+    __ movdbl(dst, src);
+  }
+}
+
+// Math.min()          # Math.max()
+// -----------------------------
+// (v)ucomis[h/s/d]    #
+// ja   -> b           # a
+// jp   -> NaN         # NaN
+// jb   -> a           # b
+// je                  #
+// |-jz -> a | b       # a & b
+// |    -> a           #
 static void emit_fp_min_max(MacroAssembler* masm, XMMRegister dst,
                             XMMRegister a, XMMRegister b,
                             XMMRegister xmmt, Register rt,
-                            bool min, bool single) {
+                            bool min, enum FP_PREC pt) {
 
   Label nan, zero, below, above, done;
 
-  if (single)
-    __ ucomiss(a, b);
-  else
-    __ ucomisd(a, b);
+  emit_fp_ucom(masm, pt, a, b);
 
-  if (dst->encoding() != (min ? b : a)->encoding())
+  if (dst->encoding() != (min ? b : a)->encoding()) {
     __ jccb(Assembler::above, above); // CF=0 & ZF=0
-  else
+  } else {
     __ jccb(Assembler::above, done);
+  }
 
   __ jccb(Assembler::parity, nan);  // PF=1
   __ jccb(Assembler::below, below); // CF=1
 
   // equal
   __ vpxor(xmmt, xmmt, xmmt, Assembler::AVX_128bit);
-  if (single) {
-    __ ucomiss(a, xmmt);
-    __ jccb(Assembler::equal, zero);
+  emit_fp_ucom(masm, pt, a, xmmt);
 
-    __ movflt(dst, a);
-    __ jmp(done);
-  }
-  else {
-    __ ucomisd(a, xmmt);
-    __ jccb(Assembler::equal, zero);
+  __ jccb(Assembler::equal, zero);
+  movfp(masm, pt, dst, a, rt);
 
-    __ movdbl(dst, a);
-    __ jmp(done);
-  }
+  __ jmp(done);
 
   __ bind(zero);
-  if (min)
+  if (min) {
     __ vpor(dst, a, b, Assembler::AVX_128bit);
-  else
+  } else {
     __ vpand(dst, a, b, Assembler::AVX_128bit);
+  }
 
   __ jmp(done);
 
   __ bind(above);
-  if (single)
-    __ movflt(dst, min ? b : a);
-  else
-    __ movdbl(dst, min ? b : a);
+  movfp(masm, pt, dst, min ? b : a, rt);
 
   __ jmp(done);
 
   __ bind(nan);
-  if (single) {
+  if (pt == fp_prec_hlf) {
+    __ movl(rt, 0x00007e00); // Float16.NaN
+    __ evmovw(dst, rt);
+  } else if (pt == fp_prec_flt) {
     __ movl(rt, 0x7fc00000); // Float.NaN
     __ movdl(dst, rt);
-  }
-  else {
+  } else {
     __ mov64(rt, 0x7ff8000000000000L); // Double.NaN
     __ movdq(dst, rt);
   }
   __ jmp(done);
 
   __ bind(below);
-  if (single)
-    __ movflt(dst, min ? a : b);
-  else
-    __ movdbl(dst, min ? a : b);
+  movfp(masm, pt, dst, min ? a : b, rt);
 
   __ bind(done);
 }
@@ -7345,146 +7360,140 @@ instruct loadAOTRCAddress(rRegP dst, immAOTRuntimeConstantsAddress con)
   ins_pipe(ialu_reg_fat);
 %}
 
+// min = java.lang.Math.min(float a, float b)
 // max = java.lang.Math.max(float a, float b)
-instruct maxF_reg_avx10_2(regF dst, regF a, regF b) %{
-  predicate(VM_Version::supports_avx10_2());
+instruct minmaxF_reg_avx10_2(regF dst, regF a, regF b)
+%{
+  predicate(VM_Version::supports_avx10_2() && !VLoopReductions::is_reduction(n));
   match(Set dst (MaxF a b));
-  format %{ "maxF $dst, $a, $b" %}
-  ins_encode %{
-    __ eminmaxss($dst$$XMMRegister, $a$$XMMRegister, $b$$XMMRegister, AVX10_2_MINMAX_MAX_COMPARE_SIGN);
-  %}
-  ins_pipe( pipe_slow );
-%}
-
-// max = java.lang.Math.max(float a, float b)
-instruct maxF_reg(legRegF dst, legRegF a, legRegF b, legRegF tmp, legRegF atmp, legRegF btmp) %{
-  predicate(!VM_Version::supports_avx10_2() && UseAVX > 0 && !VLoopReductions::is_reduction(n));
-  match(Set dst (MaxF a b));
-  effect(USE a, USE b, TEMP tmp, TEMP atmp, TEMP btmp);
-  format %{ "maxF $dst, $a, $b \t! using $tmp, $atmp and $btmp as TEMP" %}
-  ins_encode %{
-    __ vminmax_fp(Op_MaxV, T_FLOAT, $dst$$XMMRegister, $a$$XMMRegister, $b$$XMMRegister, $tmp$$XMMRegister, $atmp$$XMMRegister, $btmp$$XMMRegister, Assembler::AVX_128bit);
-  %}
-  ins_pipe( pipe_slow );
-%}
-
-instruct maxF_reduction_reg(legRegF dst, legRegF a, legRegF b, legRegF xtmp, rRegI rtmp, rFlagsReg cr) %{
-  predicate(!VM_Version::supports_avx10_2() && UseAVX > 0 && VLoopReductions::is_reduction(n));
-  match(Set dst (MaxF a b));
-  effect(USE a, USE b, TEMP xtmp, TEMP rtmp, KILL cr);
-
-  format %{ "maxF_reduction $dst, $a, $b \t!using $xtmp and $rtmp as TEMP" %}
-  ins_encode %{
-    emit_fp_min_max(masm, $dst$$XMMRegister, $a$$XMMRegister, $b$$XMMRegister, $xtmp$$XMMRegister, $rtmp$$Register,
-                    false /*min*/, true /*single*/);
-  %}
-  ins_pipe( pipe_slow );
-%}
-
-// max = java.lang.Math.max(double a, double b)
-instruct maxD_reg_avx10_2(regD dst, regD a, regD b) %{
-  predicate(VM_Version::supports_avx10_2());
-  match(Set dst (MaxD a b));
-  format %{ "maxD $dst, $a, $b" %}
-  ins_encode %{
-    __ eminmaxsd($dst$$XMMRegister, $a$$XMMRegister, $b$$XMMRegister, AVX10_2_MINMAX_MAX_COMPARE_SIGN);
-  %}
-  ins_pipe( pipe_slow );
-%}
-
-// max = java.lang.Math.max(double a, double b)
-instruct maxD_reg(legRegD dst, legRegD a, legRegD b, legRegD tmp, legRegD atmp, legRegD btmp) %{
-  predicate(!VM_Version::supports_avx10_2() && UseAVX > 0 && !VLoopReductions::is_reduction(n));
-  match(Set dst (MaxD a b));
-  effect(USE a, USE b, TEMP atmp, TEMP btmp, TEMP tmp);
-  format %{ "maxD $dst, $a, $b \t! using $tmp, $atmp and $btmp as TEMP" %}
-  ins_encode %{
-    __ vminmax_fp(Op_MaxV, T_DOUBLE, $dst$$XMMRegister, $a$$XMMRegister, $b$$XMMRegister, $tmp$$XMMRegister, $atmp$$XMMRegister, $btmp$$XMMRegister, Assembler::AVX_128bit);
-  %}
-  ins_pipe( pipe_slow );
-%}
-
-instruct maxD_reduction_reg(legRegD dst, legRegD a, legRegD b, legRegD xtmp, rRegL rtmp, rFlagsReg cr) %{
-  predicate(!VM_Version::supports_avx10_2() && UseAVX > 0 && VLoopReductions::is_reduction(n));
-  match(Set dst (MaxD a b));
-  effect(USE a, USE b, TEMP xtmp, TEMP rtmp, KILL cr);
-
-  format %{ "maxD_reduction $dst, $a, $b \t! using $xtmp and $rtmp as TEMP" %}
-  ins_encode %{
-    emit_fp_min_max(masm, $dst$$XMMRegister, $a$$XMMRegister, $b$$XMMRegister, $xtmp$$XMMRegister, $rtmp$$Register,
-                    false /*min*/, false /*single*/);
-  %}
-  ins_pipe( pipe_slow );
-%}
-
-// max = java.lang.Math.min(float a, float b)
-instruct minF_reg_avx10_2(regF dst, regF a, regF b) %{
-  predicate(VM_Version::supports_avx10_2());
   match(Set dst (MinF a b));
-  format %{ "minF $dst, $a, $b" %}
+
+  format %{ "minmaxF $dst, $a, $b" %}
   ins_encode %{
-    __ eminmaxss($dst$$XMMRegister, $a$$XMMRegister, $b$$XMMRegister, AVX10_2_MINMAX_MIN_COMPARE_SIGN);
+    int opcode = this->ideal_Opcode();
+    __ sminmax_fp_avx10_2(opcode, T_FLOAT, $dst$$XMMRegister, k0, $a$$XMMRegister, $b$$XMMRegister);
+  %}
+  ins_pipe( pipe_slow );
+%}
+
+instruct minmaxF_reduction_reg_avx10_2(regF dst, regF a, regF b, regF xtmp, rRegI rtmp, rFlagsReg cr)
+%{
+  predicate(VM_Version::supports_avx10_2() && VLoopReductions::is_reduction(n));
+  match(Set dst (MaxF a b));
+  match(Set dst (MinF a b));
+  effect(USE a, USE b, TEMP xtmp, TEMP rtmp, KILL cr);
+
+  format %{ "minmaxF_reduction $dst, $a, $b \t! using $xtmp and $rtmp as TEMP" %}
+  ins_encode %{
+    int opcode = this->ideal_Opcode();
+    bool min = (opcode == Op_MinF) ? true : false;
+    emit_fp_min_max(masm, $dst$$XMMRegister, $a$$XMMRegister, $b$$XMMRegister, $xtmp$$XMMRegister, $rtmp$$Register,
+                    min, fp_prec_flt /*pt*/);
   %}
   ins_pipe( pipe_slow );
 %}
 
 // min = java.lang.Math.min(float a, float b)
-instruct minF_reg(legRegF dst, legRegF a, legRegF b, legRegF tmp, legRegF atmp, legRegF btmp) %{
+// max = java.lang.Math.max(float a, float b)
+instruct minmaxF_reg(legRegF dst, legRegF a, legRegF b, legRegF tmp, legRegF atmp, legRegF btmp)
+%{
   predicate(!VM_Version::supports_avx10_2() && UseAVX > 0 && !VLoopReductions::is_reduction(n));
+  match(Set dst (MaxF a b));
   match(Set dst (MinF a b));
   effect(USE a, USE b, TEMP tmp, TEMP atmp, TEMP btmp);
-  format %{ "minF $dst, $a, $b \t! using $tmp, $atmp and $btmp as TEMP" %}
+
+  format %{ "minmaxF $dst, $a, $b \t! using $tmp, $atmp and $btmp as TEMP" %}
   ins_encode %{
-    __ vminmax_fp(Op_MinV, T_FLOAT, $dst$$XMMRegister, $a$$XMMRegister, $b$$XMMRegister, $tmp$$XMMRegister, $atmp$$XMMRegister, $btmp$$XMMRegister, Assembler::AVX_128bit);
+    int opcode = this->ideal_Opcode();
+    int param_opcode = (opcode == Op_MinF) ? Op_MinV : Op_MaxV;
+    __ vminmax_fp(param_opcode, T_FLOAT, $dst$$XMMRegister, $a$$XMMRegister, $b$$XMMRegister, $tmp$$XMMRegister,
+                  $atmp$$XMMRegister, $btmp$$XMMRegister, Assembler::AVX_128bit);
   %}
   ins_pipe( pipe_slow );
 %}
 
-instruct minF_reduction_reg(legRegF dst, legRegF a, legRegF b, legRegF xtmp, rRegI rtmp, rFlagsReg cr) %{
+instruct minmaxF_reduction_reg(legRegF dst, legRegF a, legRegF b, legRegF xtmp, rRegI rtmp, rFlagsReg cr)
+%{
   predicate(!VM_Version::supports_avx10_2() && UseAVX > 0 && VLoopReductions::is_reduction(n));
+  match(Set dst (MaxF a b));
   match(Set dst (MinF a b));
   effect(USE a, USE b, TEMP xtmp, TEMP rtmp, KILL cr);
 
-  format %{ "minF_reduction $dst, $a, $b \t! using $xtmp and $rtmp as TEMP" %}
+  format %{ "minmaxF_reduction $dst, $a, $b \t!using $xtmp and $rtmp as TEMP" %}
   ins_encode %{
+    int opcode = this->ideal_Opcode();
+    bool min = (opcode == Op_MinF) ? true : false;
     emit_fp_min_max(masm, $dst$$XMMRegister, $a$$XMMRegister, $b$$XMMRegister, $xtmp$$XMMRegister, $rtmp$$Register,
-                    true /*min*/, true /*single*/);
-  %}
-  ins_pipe( pipe_slow );
-%}
-
-// max = java.lang.Math.min(double a, double b)
-instruct minD_reg_avx10_2(regD dst, regD a, regD b) %{
-  predicate(VM_Version::supports_avx10_2());
-  match(Set dst (MinD a b));
-  format %{ "minD $dst, $a, $b" %}
-  ins_encode %{
-    __ eminmaxsd($dst$$XMMRegister, $a$$XMMRegister, $b$$XMMRegister, AVX10_2_MINMAX_MIN_COMPARE_SIGN);
+                    min, fp_prec_flt /*pt*/);
   %}
   ins_pipe( pipe_slow );
 %}
 
 // min = java.lang.Math.min(double a, double b)
-instruct minD_reg(legRegD dst, legRegD a, legRegD b, legRegD tmp, legRegD atmp, legRegD btmp) %{
-  predicate(!VM_Version::supports_avx10_2() && UseAVX > 0 && !VLoopReductions::is_reduction(n));
+// max = java.lang.Math.max(double a, double b)
+instruct minmaxD_reg_avx10_2(regD dst, regD a, regD b)
+%{
+  predicate(VM_Version::supports_avx10_2() && !VLoopReductions::is_reduction(n));
+  match(Set dst (MaxD a b));
   match(Set dst (MinD a b));
-  effect(USE a, USE b, TEMP tmp, TEMP atmp, TEMP btmp);
-    format %{ "minD $dst, $a, $b \t! using $tmp, $atmp and $btmp as TEMP" %}
+
+  format %{ "minmaxD $dst, $a, $b" %}
   ins_encode %{
-    __ vminmax_fp(Op_MinV, T_DOUBLE, $dst$$XMMRegister, $a$$XMMRegister, $b$$XMMRegister, $tmp$$XMMRegister, $atmp$$XMMRegister, $btmp$$XMMRegister, Assembler::AVX_128bit);
+    int opcode = this->ideal_Opcode();
+    __ sminmax_fp_avx10_2(opcode, T_DOUBLE, $dst$$XMMRegister, k0, $a$$XMMRegister, $b$$XMMRegister);
   %}
   ins_pipe( pipe_slow );
 %}
 
-instruct minD_reduction_reg(legRegD dst, legRegD a, legRegD b, legRegD xtmp, rRegL rtmp, rFlagsReg cr) %{
-  predicate(!VM_Version::supports_avx10_2() && UseAVX > 0 && VLoopReductions::is_reduction(n));
+instruct minmaxD_reduction_reg_avx10_2(regD dst, regD a, regD b, regD xtmp, rRegI rtmp, rFlagsReg cr)
+%{
+  predicate(VM_Version::supports_avx10_2() && VLoopReductions::is_reduction(n));
+  match(Set dst (MaxD a b));
   match(Set dst (MinD a b));
   effect(USE a, USE b, TEMP xtmp, TEMP rtmp, KILL cr);
 
-  format %{ "maxD_reduction $dst, $a, $b \t! using $xtmp and $rtmp as TEMP" %}
+  format %{ "minmaxD_reduction $dst, $a, $b \t! using $xtmp and $rtmp as TEMP" %}
   ins_encode %{
+    int opcode = this->ideal_Opcode();
+    bool min = (opcode == Op_MinD) ? true : false;
     emit_fp_min_max(masm, $dst$$XMMRegister, $a$$XMMRegister, $b$$XMMRegister, $xtmp$$XMMRegister, $rtmp$$Register,
-                    true /*min*/, false /*single*/);
+                    min, fp_prec_dbl /*pt*/);
+  %}
+  ins_pipe( pipe_slow );
+%}
+
+// min = java.lang.Math.min(double a, double b)
+// max = java.lang.Math.max(double a, double b)
+instruct minmaxD_reg(legRegD dst, legRegD a, legRegD b, legRegD tmp, legRegD atmp, legRegD btmp)
+%{
+  predicate(!VM_Version::supports_avx10_2() && UseAVX > 0 && !VLoopReductions::is_reduction(n));
+  match(Set dst (MaxD a b));
+  match(Set dst (MinD a b));
+  effect(USE a, USE b, TEMP atmp, TEMP btmp, TEMP tmp);
+
+  format %{ "minmaxD $dst, $a, $b \t! using $tmp, $atmp and $btmp as TEMP" %}
+  ins_encode %{
+    int opcode = this->ideal_Opcode();
+    int param_opcode = (opcode == Op_MinD) ? Op_MinV : Op_MaxV;
+    __ vminmax_fp(param_opcode, T_DOUBLE, $dst$$XMMRegister, $a$$XMMRegister, $b$$XMMRegister, $tmp$$XMMRegister,
+                  $atmp$$XMMRegister, $btmp$$XMMRegister, Assembler::AVX_128bit);
+  %}
+  ins_pipe( pipe_slow );
+%}
+
+instruct minmaxD_reduction_reg(legRegD dst, legRegD a, legRegD b, legRegD xtmp, rRegL rtmp, rFlagsReg cr)
+%{
+  predicate(!VM_Version::supports_avx10_2() && UseAVX > 0 && VLoopReductions::is_reduction(n));
+  match(Set dst (MaxD a b));
+  match(Set dst (MinD a b));
+  effect(USE a, USE b, TEMP xtmp, TEMP rtmp, KILL cr);
+
+  format %{ "minmaxD_reduction $dst, $a, $b \t! using $xtmp and $rtmp as TEMP" %}
+  ins_encode %{
+    int opcode = this->ideal_Opcode();
+    bool min = (opcode == Op_MinD) ? true : false;
+    emit_fp_min_max(masm, $dst$$XMMRegister, $a$$XMMRegister, $b$$XMMRegister, $xtmp$$XMMRegister, $rtmp$$Register,
+                    min, fp_prec_dbl /*pt*/);
   %}
   ins_pipe( pipe_slow );
 %}
@@ -14394,9 +14403,9 @@ instruct cmpF_cc_regCFE(rFlagsRegUCFE cr, regF src1, regF src2) %{
   match(Set cr (CmpF src1 src2));
 
   ins_cost(100);
-  format %{ "vucomxss $src1, $src2" %}
+  format %{ "evucomxss $src1, $src2" %}
   ins_encode %{
-    __ vucomxss($src1$$XMMRegister, $src2$$XMMRegister);
+    __ evucomxss($src1$$XMMRegister, $src2$$XMMRegister);
   %}
   ins_pipe(pipe_slow);
 %}
@@ -14416,9 +14425,9 @@ instruct cmpF_cc_memCFE(rFlagsRegUCFE cr, regF src1, memory src2) %{
   match(Set cr (CmpF src1 (LoadF src2)));
 
   ins_cost(100);
-  format %{ "vucomxss $src1, $src2" %}
+  format %{ "evucomxss $src1, $src2" %}
   ins_encode %{
-    __ vucomxss($src1$$XMMRegister, $src2$$Address);
+    __ evucomxss($src1$$XMMRegister, $src2$$Address);
   %}
   ins_pipe(pipe_slow);
 %}
@@ -14438,9 +14447,9 @@ instruct cmpF_cc_immCFE(rFlagsRegUCFE cr, regF src, immF con) %{
   match(Set cr (CmpF src con));
 
   ins_cost(100);
-  format %{ "vucomxss $src, [$constantaddress]\t# load from constant table: float=$con" %}
+  format %{ "evucomxss $src, [$constantaddress]\t# load from constant table: float=$con" %}
   ins_encode %{
-    __ vucomxss($src$$XMMRegister, $constantaddress($con));
+    __ evucomxss($src$$XMMRegister, $constantaddress($con));
   %}
   ins_pipe(pipe_slow);
 %}
@@ -14479,9 +14488,9 @@ instruct cmpD_cc_regCFE(rFlagsRegUCFE cr, regD src1, regD src2) %{
   match(Set cr (CmpD src1 src2));
 
   ins_cost(100);
-  format %{ "vucomxsd $src1, $src2 test" %}
+  format %{ "evucomxsd $src1, $src2 test" %}
   ins_encode %{
-    __ vucomxsd($src1$$XMMRegister, $src2$$XMMRegister);
+    __ evucomxsd($src1$$XMMRegister, $src2$$XMMRegister);
   %}
   ins_pipe(pipe_slow);
 %}
@@ -14501,9 +14510,9 @@ instruct cmpD_cc_memCFE(rFlagsRegUCFE cr, regD src1, memory src2) %{
   match(Set cr (CmpD src1 (LoadD src2)));
 
   ins_cost(100);
-  format %{ "vucomxsd $src1, $src2" %}
+  format %{ "evucomxsd $src1, $src2" %}
   ins_encode %{
-    __ vucomxsd($src1$$XMMRegister, $src2$$Address);
+    __ evucomxsd($src1$$XMMRegister, $src2$$Address);
   %}
   ins_pipe(pipe_slow);
 %}
@@ -14522,9 +14531,9 @@ instruct cmpD_cc_immCFE(rFlagsRegUCFE cr, regD src, immD con) %{
   match(Set cr (CmpD src con));
 
   ins_cost(100);
-  format %{ "vucomxsd $src, [$constantaddress]\t# load from constant table: double=$con" %}
+  format %{ "evucomxsd $src, [$constantaddress]\t# load from constant table: double=$con" %}
   ins_encode %{
-    __ vucomxsd($src$$XMMRegister, $constantaddress($con));
+    __ evucomxsd($src$$XMMRegister, $constantaddress($con));
   %}
   ins_pipe(pipe_slow);
 %}
@@ -18832,7 +18841,7 @@ instruct ReplHF_reg(vec dst, regF src, rRegI rtmp) %{
   format %{ "replicateHF $dst, $src \t! using $rtmp as TEMP" %}
   ins_encode %{
     int vlen_enc = vector_length_encoding(this);
-    __ vmovw($rtmp$$Register, $src$$XMMRegister);
+    __ evmovw($rtmp$$Register, $src$$XMMRegister);
     __ evpbroadcastw($dst$$XMMRegister, $rtmp$$Register, vlen_enc);
   %}
   ins_pipe( pipe_slow );
@@ -20947,7 +20956,7 @@ instruct minmaxFP_reg_avx10_2(vec dst, vec a, vec b) %{
     int vlen_enc = vector_length_encoding(this);
     int opcode = this->ideal_Opcode();
     BasicType elem_bt = Matcher::vector_element_basic_type(this);
-    __ vminmax_fp(opcode, elem_bt, $dst$$XMMRegister, k0, $a$$XMMRegister, $b$$XMMRegister, vlen_enc);
+    __ vminmax_fp_avx10_2(opcode, elem_bt, $dst$$XMMRegister, k0, $a$$XMMRegister, $b$$XMMRegister, vlen_enc);
   %}
   ins_pipe( pipe_slow );
 %}
@@ -25291,9 +25300,9 @@ instruct vector_selectfrom_twovectors_reg_evex(vec index, vec src1, vec src2)
 instruct reinterpretS2HF(regF dst, rRegI src)
 %{
   match(Set dst (ReinterpretS2HF src));
-  format %{ "vmovw $dst, $src" %}
+  format %{ "evmovw $dst, $src" %}
   ins_encode %{
-    __ vmovw($dst$$XMMRegister, $src$$Register);
+    __ evmovw($dst$$XMMRegister, $src$$Register);
   %}
   ins_pipe(pipe_slow);
 %}
@@ -25301,9 +25310,9 @@ instruct reinterpretS2HF(regF dst, rRegI src)
 instruct reinterpretHF2S(rRegI dst, regF src)
 %{
   match(Set dst (ReinterpretHF2S src));
-  format %{ "vmovw $dst, $src" %}
+  format %{ "evmovw $dst, $src" %}
   ins_encode %{
-    __ vmovw($dst$$Register, $src$$XMMRegister);
+    __ evmovw($dst$$Register, $src$$XMMRegister);
   %}
   ins_pipe(pipe_slow);
 %}
@@ -25357,10 +25366,11 @@ instruct scalar_minmax_HF_reg_avx10_2(regF dst, regF src1, regF src2)
   predicate(VM_Version::supports_avx10_2());
   match(Set dst (MaxHF src1 src2));
   match(Set dst (MinHF src1 src2));
+
   format %{ "scalar_min_max_fp16 $dst, $src1, $src2" %}
   ins_encode %{
-    int function = this->ideal_Opcode() == Op_MinHF ? AVX10_2_MINMAX_MIN_COMPARE_SIGN : AVX10_2_MINMAX_MAX_COMPARE_SIGN;
-    __ eminmaxsh($dst$$XMMRegister, $src1$$XMMRegister, $src2$$XMMRegister, function);
+    int opcode = this->ideal_Opcode();
+    __ sminmax_fp16_avx10_2(opcode, $dst$$XMMRegister, $src1$$XMMRegister, $src2$$XMMRegister, k0);
   %}
   ins_pipe( pipe_slow );
 %}
@@ -25371,11 +25381,12 @@ instruct scalar_minmax_HF_reg(regF dst, regF src1, regF src2, kReg ktmp, regF xt
   match(Set dst (MaxHF src1 src2));
   match(Set dst (MinHF src1 src2));
   effect(TEMP_DEF dst, TEMP ktmp, TEMP xtmp1, TEMP xtmp2);
+
   format %{ "scalar_min_max_fp16 $dst, $src1, $src2\t using $ktmp, $xtmp1 and $xtmp2 as TEMP" %}
   ins_encode %{
     int opcode = this->ideal_Opcode();
-    __ scalar_max_min_fp16(opcode, $dst$$XMMRegister, $src1$$XMMRegister, $src2$$XMMRegister, $ktmp$$KRegister,
-                           $xtmp1$$XMMRegister, $xtmp2$$XMMRegister);
+    __ sminmax_fp16(opcode, $dst$$XMMRegister, $src1$$XMMRegister, $src2$$XMMRegister, $ktmp$$KRegister,
+                    $xtmp1$$XMMRegister, $xtmp2$$XMMRegister);
   %}
   ins_pipe( pipe_slow );
 %}
@@ -25475,8 +25486,9 @@ instruct vector_minmax_HF_mem_avx10_2(vec dst, vec src1, memory src2)
   format %{ "vector_min_max_fp16_mem $dst, $src1, $src2" %}
   ins_encode %{
     int vlen_enc = vector_length_encoding(this);
-    int function =  this->ideal_Opcode() == Op_MinVHF ? AVX10_2_MINMAX_MIN_COMPARE_SIGN : AVX10_2_MINMAX_MAX_COMPARE_SIGN;
-    __ evminmaxph($dst$$XMMRegister, k0, $src1$$XMMRegister, $src2$$Address, true, function, vlen_enc);
+    int opcode = this->ideal_Opcode();
+    __ vminmax_fp16_avx10_2(opcode, $dst$$XMMRegister, $src1$$XMMRegister, $src2$$Address,
+                            k0, vlen_enc);
   %}
   ins_pipe( pipe_slow );
 %}
@@ -25489,8 +25501,9 @@ instruct vector_minmax_HF_reg_avx10_2(vec dst, vec src1, vec src2)
   format %{ "vector_min_max_fp16 $dst, $src1, $src2" %}
   ins_encode %{
     int vlen_enc = vector_length_encoding(this);
-    int function =  this->ideal_Opcode() == Op_MinVHF ? AVX10_2_MINMAX_MIN_COMPARE_SIGN : AVX10_2_MINMAX_MAX_COMPARE_SIGN;
-    __ evminmaxph($dst$$XMMRegister, k0, $src1$$XMMRegister, $src2$$XMMRegister, true, function, vlen_enc);
+    int opcode = this->ideal_Opcode();
+    __ vminmax_fp16_avx10_2(opcode, $dst$$XMMRegister, $src1$$XMMRegister, $src2$$XMMRegister,
+                            k0, vlen_enc);
   %}
   ins_pipe( pipe_slow );
 %}
@@ -25505,8 +25518,8 @@ instruct vector_minmax_HF_reg(vec dst, vec src1, vec src2, kReg ktmp, vec xtmp1,
   ins_encode %{
     int vlen_enc = vector_length_encoding(this);
     int opcode = this->ideal_Opcode();
-    __ vector_max_min_fp16(opcode, $dst$$XMMRegister, $src2$$XMMRegister, $src1$$XMMRegister, $ktmp$$KRegister,
-                           $xtmp1$$XMMRegister, $xtmp2$$XMMRegister, vlen_enc);
+    __ vminmax_fp16(opcode, $dst$$XMMRegister, $src2$$XMMRegister, $src1$$XMMRegister, $ktmp$$KRegister,
+                    $xtmp1$$XMMRegister, $xtmp2$$XMMRegister, vlen_enc);
   %}
   ins_pipe( pipe_slow );
 %}
diff --git a/test/hotspot/jtreg/compiler/intrinsics/math/TestFpMinMaxReductions.java b/test/hotspot/jtreg/compiler/intrinsics/math/TestFpMinMaxReductions.java
index ff0277b33f7..5f516890dbe 100644
--- a/test/hotspot/jtreg/compiler/intrinsics/math/TestFpMinMaxReductions.java
+++ b/test/hotspot/jtreg/compiler/intrinsics/math/TestFpMinMaxReductions.java
@@ -55,21 +55,21 @@ public class TestFpMinMaxReductions {
     }
 
     @Test
-    @IR(counts = {IRNode.MIN_F_REG, "1"},
-        failOn = {IRNode.MIN_F_REDUCTION_REG})
+    @IR(counts = {IRNode.MINMAX_F_REG, "1"},
+        failOn = {IRNode.MINMAX_F_REDUCTION_REG})
     private static float testFloatMin() {
         return Math.min(floatInput1, floatInput2);
     }
 
     @Test
-    @IR(counts = {IRNode.MAX_F_REG, "1"},
-        failOn = {IRNode.MAX_F_REDUCTION_REG})
+    @IR(counts = {IRNode.MINMAX_F_REG, "1"},
+        failOn = {IRNode.MINMAX_F_REDUCTION_REG})
     private static float testFloatMax() {
         return Math.max(floatInput1, floatInput2);
     }
 
     @Test
-    @IR(counts = {IRNode.MIN_F_REDUCTION_REG, ">= 1"})
+    @IR(counts = {IRNode.MINMAX_F_REDUCTION_REG, ">= 1"})
     private static float testFloatMinReduction() {
         float fmin = Float.POSITIVE_INFINITY;
         for (int i = 0; i < floatArray.length; i++) {
@@ -79,7 +79,7 @@ public class TestFpMinMaxReductions {
     }
 
     @Test
-    @IR(counts = {IRNode.MIN_F_REDUCTION_REG, ">= 1"})
+    @IR(counts = {IRNode.MINMAX_F_REDUCTION_REG, ">= 1"})
     private static float testFloatMinReductionPartiallyUnrolled() {
         float fmin = Float.POSITIVE_INFINITY;
         for (int i = 0; i < floatArray.length / 2; i++) {
@@ -90,7 +90,7 @@ public class TestFpMinMaxReductions {
     }
 
     @Test
-    @IR(counts = {IRNode.MIN_F_REDUCTION_REG, ">= 1"})
+    @IR(counts = {IRNode.MINMAX_F_REDUCTION_REG, ">= 1"})
     private static float testFloatMinReductionNonCounted() {
         float fmin = Float.POSITIVE_INFINITY;
         for (int i = 0; i < floatArray.length; i += stride) {
@@ -100,7 +100,7 @@ public class TestFpMinMaxReductions {
     }
 
     @Test
-    @IR(counts = {IRNode.MIN_F_REDUCTION_REG, ">= 1"})
+    @IR(counts = {IRNode.MINMAX_F_REDUCTION_REG, ">= 1"})
     private static float testFloatMinReductionGlobalAccumulator() {
         acc = Float.POSITIVE_INFINITY;
         for (int i = 0; i < floatArray.length; i++) {
@@ -110,7 +110,7 @@ public class TestFpMinMaxReductions {
     }
 
     @Test
-    @IR(counts = {IRNode.MIN_F_REDUCTION_REG, ">= 1"})
+    @IR(counts = {IRNode.MINMAX_F_REDUCTION_REG, ">= 1"})
     private static float testFloatMinReductionInOuterLoop() {
         float fmin = Float.POSITIVE_INFINITY;
         int count = 0;
@@ -124,7 +124,7 @@ public class TestFpMinMaxReductions {
     }
 
     @Test
-    @IR(counts = {IRNode.MAX_F_REDUCTION_REG, ">= 1"})
+    @IR(counts = {IRNode.MINMAX_F_REDUCTION_REG, ">= 1"})
     private static float testFloatMaxReduction() {
         float fmax = Float.NEGATIVE_INFINITY;
         for (int i = 0; i < floatArray.length; i++) {
@@ -134,21 +134,21 @@ public class TestFpMinMaxReductions {
     }
 
     @Test
-    @IR(counts = {IRNode.MIN_D_REG, "1"},
-        failOn = {IRNode.MIN_D_REDUCTION_REG})
+    @IR(counts = {IRNode.MINMAX_D_REG, "1"},
+        failOn = {IRNode.MINMAX_D_REDUCTION_REG})
     private static double testDoubleMin() {
         return Math.min(doubleInput1, doubleInput2);
     }
 
     @Test
-    @IR(counts = {IRNode.MAX_D_REG, "1"},
-        failOn = {IRNode.MAX_D_REDUCTION_REG})
+    @IR(counts = {IRNode.MINMAX_D_REG, "1"},
+        failOn = {IRNode.MINMAX_D_REDUCTION_REG})
     private static double testDoubleMax() {
         return Math.max(doubleInput1, doubleInput2);
     }
 
     @Test
-    @IR(counts = {IRNode.MIN_D_REDUCTION_REG, ">= 1"})
+    @IR(counts = {IRNode.MINMAX_D_REDUCTION_REG, ">= 1"})
     private static double testDoubleMinReduction() {
         double fmin = Double.POSITIVE_INFINITY;
         for (int i = 0; i < doubleArray.length; i++) {
@@ -158,7 +158,7 @@ public class TestFpMinMaxReductions {
     }
 
     @Test
-    @IR(counts = {IRNode.MAX_D_REDUCTION_REG, ">= 1"})
+    @IR(counts = {IRNode.MINMAX_D_REDUCTION_REG, ">= 1"})
     private static double testDoubleMaxReduction() {
         double fmax = Double.NEGATIVE_INFINITY;
         for (int i = 0; i < doubleArray.length; i++) {
diff --git a/test/hotspot/jtreg/compiler/lib/ir_framework/IRNode.java b/test/hotspot/jtreg/compiler/lib/ir_framework/IRNode.java
index 8885d1283df..0753a0b04bc 100644
--- a/test/hotspot/jtreg/compiler/lib/ir_framework/IRNode.java
+++ b/test/hotspot/jtreg/compiler/lib/ir_framework/IRNode.java
@@ -1203,31 +1203,11 @@ public class IRNode {
         beforeMatchingNameRegex(MAX_D, "MaxD");
     }
 
-    public static final String MAX_D_REDUCTION_REG = PREFIX + "MAX_D_REDUCTION_REG" + POSTFIX;
-    static {
-        machOnlyNameRegex(MAX_D_REDUCTION_REG, "maxD_reduction_reg");
-    }
-
-    public static final String MAX_D_REG = PREFIX + "MAX_D_REG" + POSTFIX;
-    static {
-        machOnlyNameRegex(MAX_D_REG, "maxD_reg");
-    }
-
     public static final String MAX_F = PREFIX + "MAX_F" + POSTFIX;
     static {
         beforeMatchingNameRegex(MAX_F, "MaxF");
     }
 
-    public static final String MAX_F_REDUCTION_REG = PREFIX + "MAX_F_REDUCTION_REG" + POSTFIX;
-    static {
-        machOnlyNameRegex(MAX_F_REDUCTION_REG, "maxF_reduction_reg");
-    }
-
-    public static final String MAX_F_REG = PREFIX + "MAX_F_REG" + POSTFIX;
-    static {
-        machOnlyNameRegex(MAX_F_REG, "maxF_reg");
-    }
-
     public static final String MAX_I = PREFIX + "MAX_I" + POSTFIX;
     static {
         beforeMatchingNameRegex(MAX_I, "MaxI");
@@ -1309,14 +1289,14 @@ public class IRNode {
         beforeMatchingNameRegex(MIN_D, "MinD");
     }
 
-    public static final String MIN_D_REDUCTION_REG = PREFIX + "MIN_D_REDUCTION_REG" + POSTFIX;
+    public static final String MINMAX_D_REDUCTION_REG = PREFIX + "MINMAX_D_REDUCTION_REG" + POSTFIX;
     static {
-        machOnlyNameRegex(MIN_D_REDUCTION_REG, "minD_reduction_reg");
+        machOnlyNameRegex(MINMAX_D_REDUCTION_REG, "minmaxD_reduction_reg");
     }
 
-    public static final String MIN_D_REG = PREFIX + "MIN_D_REG" + POSTFIX;
+    public static final String MINMAX_D_REG = PREFIX + "MINMAX_D_REG" + POSTFIX;
     static {
-        machOnlyNameRegex(MIN_D_REG, "minD_reg");
+        machOnlyNameRegex(MINMAX_D_REG, "minmaxD_reg");
     }
 
     public static final String MIN_F = PREFIX + "MIN_F" + POSTFIX;
@@ -1324,14 +1304,14 @@ public class IRNode {
         beforeMatchingNameRegex(MIN_F, "MinF");
     }
 
-    public static final String MIN_F_REDUCTION_REG = PREFIX + "MIN_F_REDUCTION_REG" + POSTFIX;
+    public static final String MINMAX_F_REDUCTION_REG = PREFIX + "MINMAX_F_REDUCTION_REG" + POSTFIX;
     static {
-        machOnlyNameRegex(MIN_F_REDUCTION_REG, "minF_reduction_reg");
+        machOnlyNameRegex(MINMAX_F_REDUCTION_REG, "minmaxF_reduction_reg");
     }
 
-    public static final String MIN_F_REG = PREFIX + "MIN_F_REG" + POSTFIX;
+    public static final String MINMAX_F_REG = PREFIX + "MINMAX_F_REG" + POSTFIX;
     static {
-        machOnlyNameRegex(MIN_F_REG, "minF_reg");
+        machOnlyNameRegex(MINMAX_F_REG, "minmaxF_reg");
     }
 
     public static final String MIN_I = PREFIX + "MIN_I" + POSTFIX;
diff --git a/test/micro/org/openjdk/bench/jdk/incubator/vector/Float16OperationsBenchmark.java b/test/micro/org/openjdk/bench/jdk/incubator/vector/Float16OperationsBenchmark.java
index cbfe9958924..92c0b58005f 100644
--- a/test/micro/org/openjdk/bench/jdk/incubator/vector/Float16OperationsBenchmark.java
+++ b/test/micro/org/openjdk/bench/jdk/incubator/vector/Float16OperationsBenchmark.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2025, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -28,6 +28,7 @@ import jdk.incubator.vector.*;
 import org.openjdk.jmh.annotations.*;
 import static jdk.incubator.vector.Float16.*;
 import static java.lang.Float.*;
+import java.util.Random;
 
 @OutputTimeUnit(TimeUnit.MILLISECONDS)
 @State(Scope.Thread)
@@ -45,11 +46,20 @@ public class Float16OperationsBenchmark {
     short [] vector5;
     boolean [] vectorPredicate;
 
+    private int c0, c1, c2, s1, s2;
+
+    Random r;
+
     static final short f16_one = Float.floatToFloat16(1.0f);
     static final short f16_two = Float.floatToFloat16(2.0f);
 
     @Setup(Level.Trial)
     public void BmSetup() {
+        r = new Random();
+
+        c1 = s1 = step();
+        c2 = vectorDim - (s2 = step());
+
         rexp      = new int[vectorDim];
         vectorRes = new short[vectorDim];
         vector1   = new short[vectorDim];
@@ -84,6 +94,16 @@ public class Float16OperationsBenchmark {
         );
     }
 
+    private int step() {
+        return (r.nextInt() & 0xf) + 1;
+    }
+
+    private void inc() {
+        c1 = c1 + s1 < vectorDim ? c1 + s1 : (s1 = step());
+        c2 = c2 - s2 > 0 ? c2 - s2 : vectorDim - (s2 = step());
+        c0 = Math.abs(c2 - c1);
+    }
+
     @Benchmark
     public void addBenchmark() {
         for (int i = 0; i < vectorDim; i++) {
@@ -200,6 +220,14 @@ public class Float16OperationsBenchmark {
         }
     }
 
+    @Benchmark
+    public void maxScalarBenchmark() {
+        for (int i = 0; i < vectorDim; i++) {
+            inc(); // Ensures no auto-vectorization
+            vectorRes[c0] = float16ToRawShortBits(max(shortBitsToFloat16(vector1[c1]), shortBitsToFloat16(vector2[c2])));
+        }
+    }
+
     @Benchmark
     public void minBenchmark() {
         for (int i = 0; i < vectorDim; i++) {
@@ -207,6 +235,14 @@ public class Float16OperationsBenchmark {
         }
     }
 
+    @Benchmark
+    public void minScalarBenchmark() {
+        for (int i = 0; i < vectorDim; i++) {
+            inc(); // Ensures no auto-vectorization
+            vectorRes[c0] = float16ToRawShortBits(min(shortBitsToFloat16(vector1[c1]), shortBitsToFloat16(vector2[c2])));
+        }
+    }
+
     @Benchmark
     public void sqrtBenchmark() {
         for (int i = 0; i < vectorDim; i++) {
diff --git a/test/micro/org/openjdk/bench/vm/compiler/FpMinMaxIntrinsics.java b/test/micro/org/openjdk/bench/vm/compiler/FpMinMaxIntrinsics.java
index 27ae2214157..62c33f5fafe 100644
--- a/test/micro/org/openjdk/bench/vm/compiler/FpMinMaxIntrinsics.java
+++ b/test/micro/org/openjdk/bench/vm/compiler/FpMinMaxIntrinsics.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2019, 2023, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2019, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -45,14 +45,15 @@ public class FpMinMaxIntrinsics {
     private Random r = new Random();
 
     private static int stride = 1;
-    private static float acc;
+    private static float f_acc;
+    private static double d_acc;
 
     @Setup
     public void init() {
         c1 = s1 = step();
         c2 = COUNT - (s2 = step());
 
-        for (int i=0; i<COUNT; i++) {
+        for (int i = 0; i < COUNT; i++) {
             floats[i] = r.nextFloat();
             doubles[i] = r.nextDouble();
         }
@@ -64,25 +65,25 @@ public class FpMinMaxIntrinsics {
 
     @Benchmark
     public void dMax(Blackhole bh) {
-        for (int i=0; i<COUNT; i++)
+        for (int i = 0; i < COUNT; i++)
             bh.consume(dMaxBench());
     }
 
     @Benchmark
     public void dMin(Blackhole bh) {
-        for (int i=0; i<COUNT; i++)
+        for (int i = 0; i < COUNT; i++)
             bh.consume(dMinBench());
     }
 
     @Benchmark
     public void fMax(Blackhole bh) {
-        for (int i=0; i<COUNT; i++)
+        for (int i = 0; i < COUNT; i++)
             bh.consume(fMaxBench());
     }
 
     @Benchmark
     public void fMin(Blackhole bh) {
-        for (int i=0; i<COUNT; i++)
+        for (int i = 0; i < COUNT; i++)
             bh.consume(fMinBench());
     }
 
@@ -112,11 +113,11 @@ public class FpMinMaxIntrinsics {
     }
 
     @Benchmark
-    public float fMinReduce() {
-        float result = Float.MAX_VALUE;
+    public double dMaxReduce() {
+        double result = Double.MIN_VALUE;
 
-        for (int i=0; i<COUNT; i++)
-            result = Math.min(result, floats[i]);
+        for (int i = 0; i < COUNT; i++)
+            result = Math.max(result, doubles[i]);
 
         return result;
     }
@@ -125,12 +126,62 @@ public class FpMinMaxIntrinsics {
     public double dMinReduce() {
         double result = Double.MAX_VALUE;
 
-        for (int i=0; i<COUNT; i++)
+        for (int i = 0; i < COUNT; i++)
             result = Math.min(result, doubles[i]);
 
         return result;
     }
 
+    @Benchmark
+    public float fMaxReduce() {
+        float result = Float.MIN_VALUE;
+
+        for (int i = 0; i < COUNT; i++)
+            result = Math.max(result, floats[i]);
+
+        return result;
+    }
+
+    @Benchmark
+    public float fMinReduce() {
+        float result = Float.MAX_VALUE;
+
+        for (int i = 0; i < COUNT; i++)
+            result = Math.min(result, floats[i]);
+
+        return result;
+    }
+
+    @Benchmark
+    public double dMaxReducePartiallyUnrolled() {
+        double result = Double.MIN_VALUE;
+        for (int i = 0; i < COUNT / 2; i++) {
+            result = Math.max(result, doubles[2*i]);
+            result = Math.max(result, doubles[2*i + 1]);
+        }
+        return result;
+    }
+
+    @Benchmark
+    public double dMinReducePartiallyUnrolled() {
+        double result = Double.MAX_VALUE;
+        for (int i = 0; i < COUNT / 2; i++) {
+            result = Math.min(result, doubles[2*i]);
+            result = Math.min(result, doubles[2*i + 1]);
+        }
+        return result;
+    }
+
+    @Benchmark
+    public float fMaxReducePartiallyUnrolled() {
+        float result = Float.MIN_VALUE;
+        for (int i = 0; i < COUNT / 2; i++) {
+            result = Math.max(result, floats[2*i]);
+            result = Math.max(result, floats[2*i + 1]);
+        }
+        return result;
+    }
+
     @Benchmark
     public float fMinReducePartiallyUnrolled() {
         float result = Float.MAX_VALUE;
@@ -141,6 +192,30 @@ public class FpMinMaxIntrinsics {
         return result;
     }
 
+    @Benchmark
+    public double dMaxReduceNonCounted() {
+        double result = Double.MIN_VALUE;
+        for (int i = 0; i < COUNT; i += stride)
+            result = Math.max(result, doubles[i]);
+        return result;
+    }
+
+    @Benchmark
+    public double dMinReduceNonCounted() {
+        double result = Double.MAX_VALUE;
+        for (int i = 0; i < COUNT; i += stride)
+            result = Math.min(result, doubles[i]);
+        return result;
+    }
+
+    @Benchmark
+    public float fMaxReduceNonCounted() {
+        float result = Float.MIN_VALUE;
+        for (int i = 0; i < COUNT; i += stride)
+            result = Math.max(result, floats[i]);
+        return result;
+    }
+
     @Benchmark
     public float fMinReduceNonCounted() {
         float result = Float.MAX_VALUE;
@@ -150,11 +225,74 @@ public class FpMinMaxIntrinsics {
     }
 
     @Benchmark
-    public float fMinReduceGlobalAccumulator() {
-        acc = Float.MAX_VALUE;
+    public double dMaxReduceGlobalAccumulator() {
+        d_acc = Double.MIN_VALUE;
         for (int i = 0; i < COUNT; i += stride)
-            acc = Math.min(acc, floats[i]);
-        return acc;
+            d_acc = Math.max(d_acc, doubles[i]);
+        return d_acc;
+    }
+
+    @Benchmark
+    public double dMinReduceGlobalAccumulator() {
+        d_acc = Double.MAX_VALUE;
+        for (int i = 0; i < COUNT; i += stride)
+            d_acc = Math.min(d_acc, doubles[i]);
+        return d_acc;
+    }
+
+    @Benchmark
+    public float fMaxReduceGlobalAccumulator() {
+        f_acc = Float.MIN_VALUE;
+        for (int i = 0; i < COUNT; i += stride)
+            f_acc = Math.max(f_acc, floats[i]);
+        return f_acc;
+    }
+
+    @Benchmark
+    public float fMinReduceGlobalAccumulator() {
+        f_acc = Float.MAX_VALUE;
+        for (int i = 0; i < COUNT; i += stride)
+            f_acc = Math.min(f_acc, floats[i]);
+        return f_acc;
+    }
+
+    @Benchmark
+    public double dMaxReduceInOuterLoop() {
+        double result = Double.MIN_VALUE;
+        int count = 0;
+        for (int i = 0; i < COUNT; i++) {
+            result = Math.max(result, doubles[i]);
+            for (int j = 0; j < 10; j += stride) {
+                count++;
+            }
+        }
+        return result + count;
+    }
+
+    @Benchmark
+    public double dMinReduceInOuterLoop() {
+        double result = Double.MAX_VALUE;
+        int count = 0;
+        for (int i = 0; i < COUNT; i++) {
+            result = Math.min(result, doubles[i]);
+            for (int j = 0; j < 10; j += stride) {
+                count++;
+            }
+        }
+        return result + count;
+    }
+
+    @Benchmark
+    public float fMaxReduceInOuterLoop() {
+        float result = Float.MIN_VALUE;
+        int count = 0;
+        for (int i = 0; i < COUNT; i++) {
+            result = Math.max(result, floats[i]);
+            for (int j = 0; j < 10; j += stride) {
+                count++;
+            }
+        }
+        return result + count;
     }
 
     @Benchmark
@@ -169,5 +307,4 @@ public class FpMinMaxIntrinsics {
         }
         return result + count;
     }
-
 }

From 22bbf900e18da9b31114ecb60d53f297870a29f4 Mon Sep 17 00:00:00 2001
From: Stefan Karlsson <stefank@openjdk.org>
Date: Fri, 27 Mar 2026 07:13:56 +0000
Subject: [PATCH 380/655] 8380872: Remove lingering comments about the removed
 stack locking

Reviewed-by: aboldtch, dholmes
---
 src/hotspot/cpu/x86/c2_MacroAssembler_x86.cpp |  2 +-
 src/hotspot/share/oops/markWord.hpp           |  1 -
 src/hotspot/share/runtime/objectMonitor.hpp   |  6 ++----
 src/hotspot/share/runtime/synchronizer.cpp    | 13 +++++--------
 src/hotspot/share/runtime/vmOperations.cpp    |  3 ---
 5 files changed, 8 insertions(+), 17 deletions(-)

diff --git a/src/hotspot/cpu/x86/c2_MacroAssembler_x86.cpp b/src/hotspot/cpu/x86/c2_MacroAssembler_x86.cpp
index c1df726b5ba..23b9a77844d 100644
--- a/src/hotspot/cpu/x86/c2_MacroAssembler_x86.cpp
+++ b/src/hotspot/cpu/x86/c2_MacroAssembler_x86.cpp
@@ -152,7 +152,7 @@ inline Assembler::AvxVectorLen C2_MacroAssembler::vector_length_encoding(int vle
 
 // Because the transitions from emitted code to the runtime
 // monitorenter/exit helper stubs are so slow it's critical that
-// we inline both the stack-locking fast path and the inflated fast path.
+// we inline both the lock-stack fast path and the inflated fast path.
 //
 // See also: cmpFastLock and cmpFastUnlock.
 //
diff --git a/src/hotspot/share/oops/markWord.hpp b/src/hotspot/share/oops/markWord.hpp
index c54a9f1bf5d..4583e6bd3a1 100644
--- a/src/hotspot/share/oops/markWord.hpp
+++ b/src/hotspot/share/oops/markWord.hpp
@@ -54,7 +54,6 @@
 //
 //  - the two lock bits are used to describe three states: locked/unlocked and monitor.
 //
-//    [ptr             | 00]  locked             ptr points to real header on stack (stack-locking in use)
 //    [header          | 00]  locked             locked regular object header (fast-locking in use)
 //    [header          | 01]  unlocked           regular object header
 //    [ptr             | 10]  monitor            inflated lock (header is swapped out, UseObjectMonitorTable == false)
diff --git a/src/hotspot/share/runtime/objectMonitor.hpp b/src/hotspot/share/runtime/objectMonitor.hpp
index 842aa1b374e..3ab7b8ea519 100644
--- a/src/hotspot/share/runtime/objectMonitor.hpp
+++ b/src/hotspot/share/runtime/objectMonitor.hpp
@@ -89,10 +89,8 @@ class ObjectWaiter : public CHeapObj<mtThread> {
   }
 };
 
-// The ObjectMonitor class implements the heavyweight version of a
-// JavaMonitor. The lightweight BasicLock/stack lock version has been
-// inflated into an ObjectMonitor. This inflation is typically due to
-// contention or use of Object.wait().
+// The ObjectMonitor class implements the heavyweight version of a JavaMonitor.
+// This inflation is typically due to contention or use of Object.wait().
 //
 // WARNING: This is a very sensitive and fragile class. DO NOT make any
 // changes unless you are fully aware of the underlying semantics.
diff --git a/src/hotspot/share/runtime/synchronizer.cpp b/src/hotspot/share/runtime/synchronizer.cpp
index e3293f94eeb..fa178dcb5a1 100644
--- a/src/hotspot/share/runtime/synchronizer.cpp
+++ b/src/hotspot/share/runtime/synchronizer.cpp
@@ -830,8 +830,7 @@ void ObjectSynchronizer::owned_monitors_iterate_filtered(MonitorClosure* closure
   });
 }
 
-// Iterate ObjectMonitors where the owner == thread; this does NOT include
-// ObjectMonitors where owner is set to a stack-lock address in thread.
+// Iterate ObjectMonitors where the owner == thread.
 void ObjectSynchronizer::owned_monitors_iterate(MonitorClosure* closure, JavaThread* thread) {
   int64_t key = ObjectMonitor::owner_id_from(thread);
   auto thread_filter = [&](ObjectMonitor* monitor) { return monitor->owner() == key; };
@@ -1964,12 +1963,10 @@ ObjectMonitor* ObjectSynchronizer::inflate_into_object_header(oop object, Object
     const markWord mark = object->mark_acquire();
 
     // The mark can be in one of the following states:
-    // *  inflated     - Just return if using stack-locking.
-    //                   If using fast-locking and the ObjectMonitor owner
-    //                   is anonymous and the locking_thread owns the
-    //                   object lock, then we make the locking_thread
-    //                   the ObjectMonitor owner and remove the lock from
-    //                   the locking_thread's lock stack.
+    // *  inflated     - If the ObjectMonitor owner is anonymous and the
+    //                   locking_thread owns the object lock, then we make the
+    //                   locking_thread the ObjectMonitor owner and remove the
+    //                   lock from the locking_thread's lock stack.
     // *  fast-locked  - Coerce it to inflated from fast-locked.
     // *  unlocked     - Aggressively inflate the object.
 
diff --git a/src/hotspot/share/runtime/vmOperations.cpp b/src/hotspot/share/runtime/vmOperations.cpp
index ef480f04c57..c4a77ce3275 100644
--- a/src/hotspot/share/runtime/vmOperations.cpp
+++ b/src/hotspot/share/runtime/vmOperations.cpp
@@ -276,9 +276,6 @@ void VM_ThreadDump::doit_epilogue() {
 }
 
 // Hash table of int64_t to a list of ObjectMonitor* owned by the JavaThread.
-// The JavaThread's owner key is either a JavaThread* or a stack lock
-// address in the JavaThread so we use "int64_t".
-//
 class ObjectMonitorsDump : public MonitorClosure, public ObjectMonitorsView {
  private:
   static unsigned int ptr_hash(int64_t const& s1) {

From cee1e040b3729309e0f9515c4852670226e5ca88 Mon Sep 17 00:00:00 2001
From: Thomas Schatzl <tschatzl@openjdk.org>
Date: Fri, 27 Mar 2026 07:56:55 +0000
Subject: [PATCH 381/655] 8380541: G1: Add g1CollectorState.inline.hpp file

Reviewed-by: ayang, stefank
---
 src/hotspot/share/gc/g1/g1CollectedHeap.cpp   |   2 +-
 .../share/gc/g1/g1CollectedHeap.inline.hpp    |   1 -
 src/hotspot/share/gc/g1/g1CollectionSet.cpp   |   2 +-
 src/hotspot/share/gc/g1/g1CollectorState.cpp  |  36 ++---
 src/hotspot/share/gc/g1/g1CollectorState.hpp  |  74 +++-------
 .../share/gc/g1/g1CollectorState.inline.hpp   | 128 ++++++++++++++++++
 src/hotspot/share/gc/g1/g1ConcurrentMark.cpp  |   2 +-
 .../share/gc/g1/g1FullGCCompactTask.cpp       |   2 +-
 src/hotspot/share/gc/g1/g1HeapVerifier.cpp    |   1 +
 src/hotspot/share/gc/g1/g1PeriodicGCTask.cpp  |   1 +
 src/hotspot/share/gc/g1/g1Policy.cpp          |  12 ++
 src/hotspot/share/gc/g1/g1Policy.hpp          |  11 +-
 src/hotspot/share/gc/g1/g1RemSet.cpp          |   1 +
 src/hotspot/share/gc/g1/g1RootClosures.cpp    |   1 +
 src/hotspot/share/gc/g1/g1RootProcessor.cpp   |   3 +-
 src/hotspot/share/gc/g1/g1Trace.cpp           |   1 +
 src/hotspot/share/gc/g1/g1VMOperations.cpp    |   1 +
 src/hotspot/share/gc/g1/g1YoungCollector.cpp  |   2 +-
 .../g1/g1YoungGCAllocationFailureInjector.cpp |   1 +
 .../gc/g1/g1YoungGCPostEvacuateTasks.cpp      |   2 +-
 src/hotspot/share/prims/whitebox.cpp          |   1 +
 21 files changed, 190 insertions(+), 95 deletions(-)
 create mode 100644 src/hotspot/share/gc/g1/g1CollectorState.inline.hpp

diff --git a/src/hotspot/share/gc/g1/g1CollectedHeap.cpp b/src/hotspot/share/gc/g1/g1CollectedHeap.cpp
index be9ecf19123..e6dd91df84b 100644
--- a/src/hotspot/share/gc/g1/g1CollectedHeap.cpp
+++ b/src/hotspot/share/gc/g1/g1CollectedHeap.cpp
@@ -34,7 +34,7 @@
 #include "gc/g1/g1CollectedHeap.inline.hpp"
 #include "gc/g1/g1CollectionSet.hpp"
 #include "gc/g1/g1CollectionSetCandidates.hpp"
-#include "gc/g1/g1CollectorState.hpp"
+#include "gc/g1/g1CollectorState.inline.hpp"
 #include "gc/g1/g1ConcurrentMarkThread.inline.hpp"
 #include "gc/g1/g1ConcurrentRefine.hpp"
 #include "gc/g1/g1ConcurrentRefineThread.hpp"
diff --git a/src/hotspot/share/gc/g1/g1CollectedHeap.inline.hpp b/src/hotspot/share/gc/g1/g1CollectedHeap.inline.hpp
index 90e87607b87..bad9ac18eec 100644
--- a/src/hotspot/share/gc/g1/g1CollectedHeap.inline.hpp
+++ b/src/hotspot/share/gc/g1/g1CollectedHeap.inline.hpp
@@ -28,7 +28,6 @@
 #include "gc/g1/g1CollectedHeap.hpp"
 
 #include "gc/g1/g1BarrierSet.hpp"
-#include "gc/g1/g1CollectorState.hpp"
 #include "gc/g1/g1ConcurrentMark.inline.hpp"
 #include "gc/g1/g1EvacFailureRegions.hpp"
 #include "gc/g1/g1EvacStats.inline.hpp"
diff --git a/src/hotspot/share/gc/g1/g1CollectionSet.cpp b/src/hotspot/share/gc/g1/g1CollectionSet.cpp
index 978925d88cb..b3bcf6094ab 100644
--- a/src/hotspot/share/gc/g1/g1CollectionSet.cpp
+++ b/src/hotspot/share/gc/g1/g1CollectionSet.cpp
@@ -26,7 +26,7 @@
 #include "gc/g1/g1CollectedHeap.inline.hpp"
 #include "gc/g1/g1CollectionSet.inline.hpp"
 #include "gc/g1/g1CollectionSetCandidates.inline.hpp"
-#include "gc/g1/g1CollectorState.hpp"
+#include "gc/g1/g1CollectorState.inline.hpp"
 #include "gc/g1/g1HeapRegion.inline.hpp"
 #include "gc/g1/g1HeapRegionRemSet.inline.hpp"
 #include "gc/g1/g1HeapRegionSet.hpp"
diff --git a/src/hotspot/share/gc/g1/g1CollectorState.cpp b/src/hotspot/share/gc/g1/g1CollectorState.cpp
index 2b550f36904..76de9c65cc8 100644
--- a/src/hotspot/share/gc/g1/g1CollectorState.cpp
+++ b/src/hotspot/share/gc/g1/g1CollectorState.cpp
@@ -22,42 +22,32 @@
  *
  */
 
-#include "gc/g1/g1CollectedHeap.inline.hpp"
-#include "gc/g1/g1CollectorState.hpp"
-#include "gc/g1/g1ConcurrentMarkThread.inline.hpp"
+#include "gc/g1/g1CollectorState.inline.hpp"
 #include "runtime/safepoint.hpp"
+#include "utilities/debug.hpp"
 
 G1CollectorState::Pause G1CollectorState::gc_pause_type(bool concurrent_operation_is_full_mark) const {
   assert(SafepointSynchronize::is_at_safepoint(), "must be");
   switch (_phase) {
     case Phase::YoungNormal: return Pause::Normal;
-    case Phase::YoungPrepareMixed: return Pause::PrepareMixed;
     case Phase::YoungConcurrentStart:
         return concurrent_operation_is_full_mark ? Pause::ConcurrentStartFull :
                                                    Pause::ConcurrentStartUndo;
+    case Phase::YoungPrepareMixed: return Pause::PrepareMixed;
     case Phase::Mixed: return Pause::Mixed;
     case Phase::FullGC: return Pause::Full;
     default: ShouldNotReachHere();
   }
 }
 
-bool G1CollectorState::is_in_concurrent_cycle() const {
-  G1ConcurrentMark* cm = G1CollectedHeap::heap()->concurrent_mark();
-  return cm->is_in_concurrent_cycle();
+const char* G1CollectorState::to_string(Pause type) {
+  static const char* pause_strings[] = { "Normal",
+                                         "Concurrent Start", // Do not distinguish between the different
+                                         "Concurrent Start", // Concurrent Start pauses.
+                                         "Prepare Mixed",
+                                         "Cleanup",
+                                         "Remark",
+                                         "Mixed",
+                                         "Full" };
+  return pause_strings[static_cast<uint>(type)];
 }
-
-bool G1CollectorState::is_in_marking() const {
-  G1ConcurrentMark* cm = G1CollectedHeap::heap()->concurrent_mark();
-  return cm->is_in_marking();
-}
-
-bool G1CollectorState::is_in_mark_or_rebuild() const {
-  G1ConcurrentMark* cm = G1CollectedHeap::heap()->concurrent_mark();
-  return is_in_marking() || cm->is_in_rebuild_or_scrub();
-}
-
-bool G1CollectorState::is_in_reset_for_next_cycle() const {
-  G1ConcurrentMark* cm = G1CollectedHeap::heap()->concurrent_mark();
-  return cm->is_in_reset_for_next_cycle();
-}
-
diff --git a/src/hotspot/share/gc/g1/g1CollectorState.hpp b/src/hotspot/share/gc/g1/g1CollectorState.hpp
index 64c848959ae..42aaeab03b2 100644
--- a/src/hotspot/share/gc/g1/g1CollectorState.hpp
+++ b/src/hotspot/share/gc/g1/g1CollectorState.hpp
@@ -67,26 +67,25 @@ public:
     _initiate_conc_mark_if_possible(false) { }
 
   // Phase setters
-  void set_in_normal_young_gc() { _phase = Phase::YoungNormal; }
-  void set_in_space_reclamation_phase() { _phase = Phase::Mixed; }
-  void set_in_full_gc() { _phase = Phase::FullGC; }
+  inline void set_in_normal_young_gc();
+  inline void set_in_space_reclamation_phase();
+  inline void set_in_full_gc();
 
-  // Pause setters
-  void set_in_concurrent_start_gc() { _phase = Phase::YoungConcurrentStart; _initiate_conc_mark_if_possible = false; }
-  void set_in_prepare_mixed_gc() { _phase = Phase::YoungPrepareMixed; }
+  inline void set_in_concurrent_start_gc();
+  inline void set_in_prepare_mixed_gc();
 
-  void set_initiate_conc_mark_if_possible(bool v) { _initiate_conc_mark_if_possible = v; }
+  inline void set_initiate_conc_mark_if_possible(bool v);
 
   // Phase getters
-  bool is_in_young_only_phase() const { return _phase == Phase::YoungNormal || _phase == Phase::YoungConcurrentStart || _phase == Phase::YoungPrepareMixed; }
-  bool is_in_mixed_phase() const { return _phase == Phase::Mixed; }
+  inline bool is_in_young_only_phase() const;
+  inline bool is_in_mixed_phase() const;
 
   // Specific pauses
-  bool is_in_concurrent_start_gc() const { return _phase == Phase::YoungConcurrentStart; }
-  bool is_in_prepare_mixed_gc() const { return _phase == Phase::YoungPrepareMixed; }
-  bool is_in_full_gc() const { return _phase == Phase::FullGC; }
+  inline bool is_in_concurrent_start_gc() const;
+  inline bool is_in_prepare_mixed_gc() const;
+  inline bool is_in_full_gc() const;
 
-  bool initiate_conc_mark_if_possible() const { return _initiate_conc_mark_if_possible; }
+  inline bool initiate_conc_mark_if_possible() const;
 
   bool is_in_concurrent_cycle() const;
   bool is_in_marking() const;
@@ -107,50 +106,17 @@ public:
   // Calculate GC Pause Type from internal state.
   Pause gc_pause_type(bool concurrent_operation_is_full_mark) const;
 
-  static const char* to_string(Pause type) {
-    static const char* pause_strings[] = { "Normal",
-                                           "Concurrent Start", // Do not distinguish between the different
-                                           "Concurrent Start", // Concurrent Start pauses.
-                                           "Prepare Mixed",
-                                           "Cleanup",
-                                           "Remark",
-                                           "Mixed",
-                                           "Full" };
-    return pause_strings[static_cast<uint>(type)];
-  }
+  static const char* to_string(Pause type);
 
-  static void assert_is_young_pause(Pause type) {
-    assert(type != Pause::Full, "must be");
-    assert(type != Pause::Remark, "must be");
-    assert(type != Pause::Cleanup, "must be");
-  }
+  // Pause kind queries
+  inline static void assert_is_young_pause(Pause type);
 
-  static bool is_young_only_pause(Pause type) {
-    assert_is_young_pause(type);
-    return type == Pause::ConcurrentStartUndo ||
-           type == Pause::ConcurrentStartFull ||
-           type == Pause::PrepareMixed ||
-           type == Pause::Normal;
-  }
+  inline static bool is_young_only_pause(Pause type);
+  inline static bool is_concurrent_start_pause(Pause type);
+  inline static bool is_prepare_mixed_pause(Pause type);
+  inline static bool is_mixed_pause(Pause type);
 
-  static bool is_mixed_pause(Pause type) {
-    assert_is_young_pause(type);
-    return type == Pause::Mixed;
-  }
-
-  static bool is_prepare_mixed_pause(Pause type) {
-    assert_is_young_pause(type);
-    return type == Pause::PrepareMixed;
-  }
-
-  static bool is_concurrent_start_pause(Pause type) {
-    assert_is_young_pause(type);
-    return type == Pause::ConcurrentStartFull || type == Pause::ConcurrentStartUndo;
-  }
-
-  static bool is_concurrent_cycle_pause(Pause type) {
-    return type == Pause::Cleanup || type == Pause::Remark;
-  }
+  inline static bool is_concurrent_cycle_pause(Pause type);
 };
 
 ENUMERATOR_RANGE(G1CollectorState::Pause, G1CollectorState::Pause::Normal, G1CollectorState::Pause::Full)
diff --git a/src/hotspot/share/gc/g1/g1CollectorState.inline.hpp b/src/hotspot/share/gc/g1/g1CollectorState.inline.hpp
new file mode 100644
index 00000000000..0c6c9c879c3
--- /dev/null
+++ b/src/hotspot/share/gc/g1/g1CollectorState.inline.hpp
@@ -0,0 +1,128 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ *
+ */
+
+#ifndef SHARE_GC_G1_G1COLLECTORSTATE_INLINE_HPP
+#define SHARE_GC_G1_G1COLLECTORSTATE_INLINE_HPP
+
+#include "gc/g1/g1CollectorState.hpp"
+
+#include "gc/g1/g1CollectedHeap.hpp"
+#include "gc/g1/g1ConcurrentMark.inline.hpp"
+
+inline void G1CollectorState::set_in_normal_young_gc() {
+  _phase = Phase::YoungNormal;
+}
+inline void G1CollectorState::set_in_space_reclamation_phase() {
+  _phase = Phase::Mixed;
+}
+inline void G1CollectorState::set_in_full_gc() {
+  _phase = Phase::FullGC;
+}
+
+inline void G1CollectorState::set_in_concurrent_start_gc() {
+  _phase = Phase::YoungConcurrentStart;
+  _initiate_conc_mark_if_possible = false;
+}
+inline void G1CollectorState::set_in_prepare_mixed_gc() {
+  _phase = Phase::YoungPrepareMixed;
+}
+
+inline void G1CollectorState::set_initiate_conc_mark_if_possible(bool v) {
+  _initiate_conc_mark_if_possible = v;
+}
+
+inline bool G1CollectorState::is_in_young_only_phase() const {
+  return _phase == Phase::YoungNormal ||
+         _phase == Phase::YoungConcurrentStart ||
+         _phase == Phase::YoungPrepareMixed;
+}
+inline bool G1CollectorState::is_in_mixed_phase() const {
+  return _phase == Phase::Mixed;
+}
+
+inline bool G1CollectorState::is_in_prepare_mixed_gc() const {
+  return _phase == Phase::YoungPrepareMixed;
+}
+inline bool G1CollectorState::is_in_full_gc() const {
+  return _phase == Phase::FullGC;
+}
+inline bool G1CollectorState::is_in_concurrent_start_gc() const {
+  return _phase == Phase::YoungConcurrentStart;
+}
+
+inline bool G1CollectorState::initiate_conc_mark_if_possible() const {
+  return _initiate_conc_mark_if_possible;
+}
+
+inline bool G1CollectorState::is_in_concurrent_cycle() const {
+  G1ConcurrentMark* cm = G1CollectedHeap::heap()->concurrent_mark();
+  return cm->is_in_concurrent_cycle();
+}
+inline bool G1CollectorState::is_in_marking() const {
+  G1ConcurrentMark* cm = G1CollectedHeap::heap()->concurrent_mark();
+  return cm->is_in_marking();
+}
+inline bool G1CollectorState::is_in_mark_or_rebuild() const {
+  G1ConcurrentMark* cm = G1CollectedHeap::heap()->concurrent_mark();
+  return is_in_marking() || cm->is_in_rebuild_or_scrub();
+}
+inline bool G1CollectorState::is_in_reset_for_next_cycle() const {
+  G1ConcurrentMark* cm = G1CollectedHeap::heap()->concurrent_mark();
+  return cm->is_in_reset_for_next_cycle();
+}
+
+inline void G1CollectorState::assert_is_young_pause(Pause type) {
+  assert(type != Pause::Full, "must be");
+  assert(type != Pause::Remark, "must be");
+  assert(type != Pause::Cleanup, "must be");
+}
+
+inline bool G1CollectorState::is_young_only_pause(Pause type) {
+  assert_is_young_pause(type);
+  return type == Pause::ConcurrentStartUndo ||
+         type == Pause::ConcurrentStartFull ||
+         type == Pause::PrepareMixed ||
+         type == Pause::Normal;
+}
+
+inline bool G1CollectorState::is_mixed_pause(Pause type) {
+  assert_is_young_pause(type);
+  return type == Pause::Mixed;
+}
+
+inline bool G1CollectorState::is_prepare_mixed_pause(Pause type) {
+  assert_is_young_pause(type);
+  return type == Pause::PrepareMixed;
+}
+
+inline bool G1CollectorState::is_concurrent_start_pause(Pause type) {
+  assert_is_young_pause(type);
+  return type == Pause::ConcurrentStartFull || type == Pause::ConcurrentStartUndo;
+}
+
+inline bool G1CollectorState::is_concurrent_cycle_pause(Pause type) {
+  return type == Pause::Cleanup || type == Pause::Remark;
+}
+
+#endif // SHARE_GC_G1_G1COLLECTORSTATE_INLINE_HPP
diff --git a/src/hotspot/share/gc/g1/g1ConcurrentMark.cpp b/src/hotspot/share/gc/g1/g1ConcurrentMark.cpp
index 8fd355615d0..1caa8dbdd06 100644
--- a/src/hotspot/share/gc/g1/g1ConcurrentMark.cpp
+++ b/src/hotspot/share/gc/g1/g1ConcurrentMark.cpp
@@ -30,7 +30,7 @@
 #include "gc/g1/g1CardSetMemory.hpp"
 #include "gc/g1/g1CardTableClaimTable.inline.hpp"
 #include "gc/g1/g1CollectedHeap.inline.hpp"
-#include "gc/g1/g1CollectorState.hpp"
+#include "gc/g1/g1CollectorState.inline.hpp"
 #include "gc/g1/g1ConcurrentMark.inline.hpp"
 #include "gc/g1/g1ConcurrentMarkRemarkTasks.hpp"
 #include "gc/g1/g1ConcurrentMarkThread.inline.hpp"
diff --git a/src/hotspot/share/gc/g1/g1FullGCCompactTask.cpp b/src/hotspot/share/gc/g1/g1FullGCCompactTask.cpp
index 5dbf70f36b3..93d8da0d842 100644
--- a/src/hotspot/share/gc/g1/g1FullGCCompactTask.cpp
+++ b/src/hotspot/share/gc/g1/g1FullGCCompactTask.cpp
@@ -22,7 +22,7 @@
  *
  */
 
-#include "gc/g1/g1CollectedHeap.hpp"
+#include "gc/g1/g1CollectedHeap.inline.hpp"
 #include "gc/g1/g1ConcurrentMarkBitMap.inline.hpp"
 #include "gc/g1/g1FullCollector.inline.hpp"
 #include "gc/g1/g1FullGCCompactionPoint.hpp"
diff --git a/src/hotspot/share/gc/g1/g1HeapVerifier.cpp b/src/hotspot/share/gc/g1/g1HeapVerifier.cpp
index dd7a8aa117d..714a2473a08 100644
--- a/src/hotspot/share/gc/g1/g1HeapVerifier.cpp
+++ b/src/hotspot/share/gc/g1/g1HeapVerifier.cpp
@@ -25,6 +25,7 @@
 #include "code/nmethod.hpp"
 #include "gc/g1/g1Allocator.inline.hpp"
 #include "gc/g1/g1CollectedHeap.inline.hpp"
+#include "gc/g1/g1CollectorState.inline.hpp"
 #include "gc/g1/g1ConcurrentMarkThread.hpp"
 #include "gc/g1/g1HeapRegion.inline.hpp"
 #include "gc/g1/g1HeapRegionRemSet.hpp"
diff --git a/src/hotspot/share/gc/g1/g1PeriodicGCTask.cpp b/src/hotspot/share/gc/g1/g1PeriodicGCTask.cpp
index ee11bbd961f..b5ff4272764 100644
--- a/src/hotspot/share/gc/g1/g1PeriodicGCTask.cpp
+++ b/src/hotspot/share/gc/g1/g1PeriodicGCTask.cpp
@@ -23,6 +23,7 @@
  */
 
 #include "gc/g1/g1CollectedHeap.inline.hpp"
+#include "gc/g1/g1CollectorState.inline.hpp"
 #include "gc/g1/g1ConcurrentMark.inline.hpp"
 #include "gc/g1/g1ConcurrentMarkThread.inline.hpp"
 #include "gc/g1/g1GCCounters.hpp"
diff --git a/src/hotspot/share/gc/g1/g1Policy.cpp b/src/hotspot/share/gc/g1/g1Policy.cpp
index 05caff1257a..0145f1e6e1d 100644
--- a/src/hotspot/share/gc/g1/g1Policy.cpp
+++ b/src/hotspot/share/gc/g1/g1Policy.cpp
@@ -28,6 +28,7 @@
 #include "gc/g1/g1CollectedHeap.inline.hpp"
 #include "gc/g1/g1CollectionSet.hpp"
 #include "gc/g1/g1CollectionSetCandidates.inline.hpp"
+#include "gc/g1/g1CollectorState.inline.hpp"
 #include "gc/g1/g1ConcurrentMark.hpp"
 #include "gc/g1/g1ConcurrentMarkThread.inline.hpp"
 #include "gc/g1/g1ConcurrentRefine.hpp"
@@ -1133,6 +1134,17 @@ double G1Policy::predict_eden_copy_time_ms(uint count, size_t* bytes_to_copy) co
   return _analytics->predict_object_copy_time_ms(expected_bytes, collector_state()->is_in_young_only_phase());
 }
 
+bool G1Policy::should_update_surv_rate_group_predictors() {
+  return collector_state()->is_in_young_only_phase() && !collector_state()->is_in_mark_or_rebuild();
+}
+
+void G1Policy::cset_regions_freed() {
+  bool update = should_update_surv_rate_group_predictors();
+
+  _eden_surv_rate_group->all_surviving_words_recorded(predictor(), update);
+  _survivor_surv_rate_group->all_surviving_words_recorded(predictor(), update);
+}
+
 double G1Policy::predict_region_copy_time_ms(G1HeapRegion* hr, bool for_young_only_phase) const {
   size_t const bytes_to_copy = predict_bytes_to_copy(hr);
   return _analytics->predict_object_copy_time_ms(bytes_to_copy, for_young_only_phase);
diff --git a/src/hotspot/share/gc/g1/g1Policy.hpp b/src/hotspot/share/gc/g1/g1Policy.hpp
index 585e26441d5..bcc3bceda49 100644
--- a/src/hotspot/share/gc/g1/g1Policy.hpp
+++ b/src/hotspot/share/gc/g1/g1Policy.hpp
@@ -114,9 +114,7 @@ class G1Policy: public CHeapObj<mtGC> {
 
   G1ConcurrentStartToMixedTimeTracker _concurrent_start_to_mixed;
 
-  bool should_update_surv_rate_group_predictors() {
-    return collector_state()->is_in_young_only_phase() && !collector_state()->is_in_mark_or_rebuild();
-  }
+  bool should_update_surv_rate_group_predictors();
 
   double pending_cards_processing_time() const;
 public:
@@ -160,12 +158,7 @@ public:
   // bytes_to_copy is non-null.
   double predict_eden_copy_time_ms(uint count, size_t* bytes_to_copy = nullptr) const;
 
-  void cset_regions_freed() {
-    bool update = should_update_surv_rate_group_predictors();
-
-    _eden_surv_rate_group->all_surviving_words_recorded(predictor(), update);
-    _survivor_surv_rate_group->all_surviving_words_recorded(predictor(), update);
-  }
+  void cset_regions_freed();
 
   G1MMUTracker* mmu_tracker() {
     return _mmu_tracker;
diff --git a/src/hotspot/share/gc/g1/g1RemSet.cpp b/src/hotspot/share/gc/g1/g1RemSet.cpp
index 4b4a8a68c30..9f9f0ecdf3a 100644
--- a/src/hotspot/share/gc/g1/g1RemSet.cpp
+++ b/src/hotspot/share/gc/g1/g1RemSet.cpp
@@ -31,6 +31,7 @@
 #include "gc/g1/g1CardTableEntryClosure.hpp"
 #include "gc/g1/g1CollectedHeap.inline.hpp"
 #include "gc/g1/g1CollectionSet.inline.hpp"
+#include "gc/g1/g1CollectorState.inline.hpp"
 #include "gc/g1/g1ConcurrentRefine.hpp"
 #include "gc/g1/g1ConcurrentRefineSweepTask.hpp"
 #include "gc/g1/g1FromCardCache.hpp"
diff --git a/src/hotspot/share/gc/g1/g1RootClosures.cpp b/src/hotspot/share/gc/g1/g1RootClosures.cpp
index 2d5150c27aa..16c47cddea1 100644
--- a/src/hotspot/share/gc/g1/g1RootClosures.cpp
+++ b/src/hotspot/share/gc/g1/g1RootClosures.cpp
@@ -22,6 +22,7 @@
  *
  */
 
+#include "gc/g1/g1CollectorState.inline.hpp"
 #include "gc/g1/g1OopClosures.inline.hpp"
 #include "gc/g1/g1RootClosures.hpp"
 #include "gc/g1/g1SharedClosures.hpp"
diff --git a/src/hotspot/share/gc/g1/g1RootProcessor.cpp b/src/hotspot/share/gc/g1/g1RootProcessor.cpp
index dac237cb277..a534eefb428 100644
--- a/src/hotspot/share/gc/g1/g1RootProcessor.cpp
+++ b/src/hotspot/share/gc/g1/g1RootProcessor.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2015, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2015, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -27,7 +27,6 @@
 #include "code/codeCache.hpp"
 #include "gc/g1/g1BarrierSet.hpp"
 #include "gc/g1/g1CollectedHeap.inline.hpp"
-#include "gc/g1/g1CollectorState.hpp"
 #include "gc/g1/g1GCParPhaseTimesTracker.hpp"
 #include "gc/g1/g1GCPhaseTimes.hpp"
 #include "gc/g1/g1HeapRegion.inline.hpp"
diff --git a/src/hotspot/share/gc/g1/g1Trace.cpp b/src/hotspot/share/gc/g1/g1Trace.cpp
index 242a97ca4e3..d6eadda5d50 100644
--- a/src/hotspot/share/gc/g1/g1Trace.cpp
+++ b/src/hotspot/share/gc/g1/g1Trace.cpp
@@ -22,6 +22,7 @@
  *
  */
 
+#include "gc/g1/g1CollectorState.inline.hpp"
 #include "gc/g1/g1EvacInfo.hpp"
 #include "gc/g1/g1HeapRegionTraceType.hpp"
 #include "gc/g1/g1Trace.hpp"
diff --git a/src/hotspot/share/gc/g1/g1VMOperations.cpp b/src/hotspot/share/gc/g1/g1VMOperations.cpp
index f98f0b078f3..b0c6b680b78 100644
--- a/src/hotspot/share/gc/g1/g1VMOperations.cpp
+++ b/src/hotspot/share/gc/g1/g1VMOperations.cpp
@@ -23,6 +23,7 @@
  */
 
 #include "gc/g1/g1CollectedHeap.inline.hpp"
+#include "gc/g1/g1CollectorState.inline.hpp"
 #include "gc/g1/g1ConcurrentMarkThread.inline.hpp"
 #include "gc/g1/g1Policy.hpp"
 #include "gc/g1/g1Trace.hpp"
diff --git a/src/hotspot/share/gc/g1/g1YoungCollector.cpp b/src/hotspot/share/gc/g1/g1YoungCollector.cpp
index 04ccac5ff05..a4938416f25 100644
--- a/src/hotspot/share/gc/g1/g1YoungCollector.cpp
+++ b/src/hotspot/share/gc/g1/g1YoungCollector.cpp
@@ -31,7 +31,7 @@
 #include "gc/g1/g1CardSetMemory.hpp"
 #include "gc/g1/g1CollectedHeap.inline.hpp"
 #include "gc/g1/g1CollectionSetCandidates.inline.hpp"
-#include "gc/g1/g1CollectorState.hpp"
+#include "gc/g1/g1CollectorState.inline.hpp"
 #include "gc/g1/g1ConcurrentMark.hpp"
 #include "gc/g1/g1EvacFailureRegions.inline.hpp"
 #include "gc/g1/g1EvacInfo.hpp"
diff --git a/src/hotspot/share/gc/g1/g1YoungGCAllocationFailureInjector.cpp b/src/hotspot/share/gc/g1/g1YoungGCAllocationFailureInjector.cpp
index 2291a755cd3..2b33a85da29 100644
--- a/src/hotspot/share/gc/g1/g1YoungGCAllocationFailureInjector.cpp
+++ b/src/hotspot/share/gc/g1/g1YoungGCAllocationFailureInjector.cpp
@@ -23,6 +23,7 @@
  */
 
 #include "gc/g1/g1CollectedHeap.inline.hpp"
+#include "gc/g1/g1CollectorState.inline.hpp"
 #include "gc/g1/g1YoungGCAllocationFailureInjector.inline.hpp"
 #include "gc/shared/gc_globals.hpp"
 
diff --git a/src/hotspot/share/gc/g1/g1YoungGCPostEvacuateTasks.cpp b/src/hotspot/share/gc/g1/g1YoungGCPostEvacuateTasks.cpp
index 3d49b8f025b..14282383e29 100644
--- a/src/hotspot/share/gc/g1/g1YoungGCPostEvacuateTasks.cpp
+++ b/src/hotspot/share/gc/g1/g1YoungGCPostEvacuateTasks.cpp
@@ -29,7 +29,7 @@
 #include "gc/g1/g1CardTableEntryClosure.hpp"
 #include "gc/g1/g1CollectedHeap.inline.hpp"
 #include "gc/g1/g1CollectionSetCandidates.inline.hpp"
-#include "gc/g1/g1CollectorState.hpp"
+#include "gc/g1/g1CollectorState.inline.hpp"
 #include "gc/g1/g1ConcurrentMark.inline.hpp"
 #include "gc/g1/g1EvacFailureRegions.inline.hpp"
 #include "gc/g1/g1EvacInfo.hpp"
diff --git a/src/hotspot/share/prims/whitebox.cpp b/src/hotspot/share/prims/whitebox.cpp
index a13d0ba47c8..f50e6ddb3db 100644
--- a/src/hotspot/share/prims/whitebox.cpp
+++ b/src/hotspot/share/prims/whitebox.cpp
@@ -107,6 +107,7 @@
 #if INCLUDE_G1GC
 #include "gc/g1/g1Arguments.hpp"
 #include "gc/g1/g1CollectedHeap.inline.hpp"
+#include "gc/g1/g1CollectorState.inline.hpp"
 #include "gc/g1/g1ConcurrentMark.hpp"
 #include "gc/g1/g1ConcurrentMarkThread.inline.hpp"
 #include "gc/g1/g1HeapRegionManager.hpp"

From 53c864a881d2183d3664a6a5a56480bd99fffe45 Mon Sep 17 00:00:00 2001
From: Benjamin Peterson <benjamin@engflow.com>
Date: Fri, 27 Mar 2026 08:18:47 +0000
Subject: [PATCH 382/655] 8380960: "Foreign function access" discussion links
 to wrong downcallHandle overload

Reviewed-by: mcimadamore
---
 .../share/classes/java/lang/foreign/package-info.java         | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/src/java.base/share/classes/java/lang/foreign/package-info.java b/src/java.base/share/classes/java/lang/foreign/package-info.java
index 438d42ae7d1..2070f0c70a8 100644
--- a/src/java.base/share/classes/java/lang/foreign/package-info.java
+++ b/src/java.base/share/classes/java/lang/foreign/package-info.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2019, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2019, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -114,7 +114,7 @@
  * and we use it to {@linkplain java.lang.foreign.SymbolLookup#findOrThrow(java.lang.String) look up}
  * the {@code strlen} function in the standard C library; a <em>downcall method handle</em>
  * targeting said function is subsequently
- * {@linkplain java.lang.foreign.Linker#downcallHandle(FunctionDescriptor, Linker.Option...) obtained}.
+ * {@linkplain java.lang.foreign.Linker#downcallHandle(MemorySegment, FunctionDescriptor, Linker.Option...) obtained}.
  * To complete the linking successfully, we must provide a
  * {@link java.lang.foreign.FunctionDescriptor} instance, describing the signature of the
  * {@code strlen} function. From this information, the linker will uniquely determine

From c0e500ad996dd7174f6f37481f2da48dc6d98f56 Mon Sep 17 00:00:00 2001
From: Anton Seoane Ampudia <aseoane@openjdk.org>
Date: Fri, 27 Mar 2026 09:44:37 +0000
Subject: [PATCH 383/655] 8379794: C2: UBSAN runtime error: shift exponent 64
 is too large for 64-bit type 'long unsigned int'

Reviewed-by: rcastanedalo, qamai, dlong
---
 src/hotspot/cpu/x86/x86.ad | 8 ++++++--
 1 file changed, 6 insertions(+), 2 deletions(-)

diff --git a/src/hotspot/cpu/x86/x86.ad b/src/hotspot/cpu/x86/x86.ad
index d7014141234..eaa88d900c7 100644
--- a/src/hotspot/cpu/x86/x86.ad
+++ b/src/hotspot/cpu/x86/x86.ad
@@ -23972,8 +23972,12 @@ instruct vmask_gen_imm(kReg dst, immL len, rRegL temp) %{
   format %{ "vector_mask_gen $len \t! vector mask generator" %}
   effect(TEMP temp);
   ins_encode %{
-    __ mov64($temp$$Register, (0xFFFFFFFFFFFFFFFFUL >> (64 -$len$$constant)));
-    __ kmovql($dst$$KRegister, $temp$$Register);
+    if ($len$$constant > 0) {
+      __ mov64($temp$$Register, right_n_bits($len$$constant));
+      __ kmovql($dst$$KRegister, $temp$$Register);
+    } else {
+      __ kxorql($dst$$KRegister, $dst$$KRegister, $dst$$KRegister);
+    }
   %}
   ins_pipe( pipe_slow );
 %}

From cca8c23871f1669fdd002652a20a6b7935704e30 Mon Sep 17 00:00:00 2001
From: Serhiy Sachkov <serhiy.sachkov@oracle.com>
Date: Fri, 27 Mar 2026 10:36:34 +0000
Subject: [PATCH 384/655] 8380999: Update IPSupport by adding
 diagnoseConfigurationIssue() method

Reviewed-by: dfuchs
---
 test/lib/jdk/test/lib/net/IPSupport.java | 25 ++++++++++++++++++++++--
 1 file changed, 23 insertions(+), 2 deletions(-)

diff --git a/test/lib/jdk/test/lib/net/IPSupport.java b/test/lib/jdk/test/lib/net/IPSupport.java
index 31255e20c6a..4a77c3a9bae 100644
--- a/test/lib/jdk/test/lib/net/IPSupport.java
+++ b/test/lib/jdk/test/lib/net/IPSupport.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2019, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2019, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -34,6 +34,7 @@ import java.net.InetAddress;
 import java.net.ProtocolFamily;
 import java.net.StandardProtocolFamily;
 import java.nio.channels.SocketChannel;
+import java.util.Optional;
 
 import jtreg.SkippedException;
 
@@ -124,13 +125,33 @@ public class IPSupport {
      *         is non-operational
      */
     public static void throwSkippedExceptionIfNonOperational() throws SkippedException {
+        Optional<String> configurationIssue = diagnoseConfigurationIssue();
+        configurationIssue.map(SkippedException::new).ifPresent(x -> {
+            throw x;
+        });
+    }
+
+    /**
+     * Checks that the platform supports the ability to create a
+     * minimally-operational socket whose protocol is either one of IPv4
+     * or IPv6.
+     *
+     * <p> A minimally-operation socket is one that can be created and
+     * bound to an IP-specific loopback address. IP support is
+     * considered non-operational if a socket cannot be bound to either
+     * one of, an IPv4 loopback address, or the IPv6 loopback address.
+     *
+     * @return Optinal with config issue or empty Optinal if no issue found
+     */
+    public static Optional<String> diagnoseConfigurationIssue(){
         if (!currentConfigurationIsValid()) {
             ByteArrayOutputStream os = new ByteArrayOutputStream();
             PrintStream ps = new PrintStream(os);
             ps.println("Invalid networking configuration");
             printPlatformSupport(ps);
-            throw new SkippedException(os.toString());
+            return Optional.of(os.toString());
         }
+        return Optional.empty();
     }
 
     /**

From b242eef3123a936f53ea76b28b2f6350e52afa94 Mon Sep 17 00:00:00 2001
From: Ivan Walulya <iwalulya@openjdk.org>
Date: Fri, 27 Mar 2026 11:20:05 +0000
Subject: [PATCH 385/655] 8380656: G1: Refactor G1IHOPControl

Co-authored-by: Thomas Schatzl <tschatzl@openjdk.org>
Reviewed-by: ayang, tschatzl
---
 .../g1ConcurrentStartToMixedTimeTracker.hpp   |   8 +-
 src/hotspot/share/gc/g1/g1IHOPControl.cpp     | 115 ++++++++++--------
 src/hotspot/share/gc/g1/g1IHOPControl.hpp     |  43 ++++---
 src/hotspot/share/gc/g1/g1Policy.cpp          |  14 +--
 .../gtest/gc/g1/test_g1IHOPControl.cpp        |  38 +++---
 5 files changed, 121 insertions(+), 97 deletions(-)

diff --git a/src/hotspot/share/gc/g1/g1ConcurrentStartToMixedTimeTracker.hpp b/src/hotspot/share/gc/g1/g1ConcurrentStartToMixedTimeTracker.hpp
index 57372e695c8..f8bad4bdcd7 100644
--- a/src/hotspot/share/gc/g1/g1ConcurrentStartToMixedTimeTracker.hpp
+++ b/src/hotspot/share/gc/g1/g1ConcurrentStartToMixedTimeTracker.hpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2001, 2020, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2001, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -30,7 +30,7 @@
 
 // Used to track time from the end of concurrent start to the first mixed GC.
 // After calling the concurrent start/mixed gc notifications, the result can be
-// obtained in last_marking_time() once, after which the tracking resets.
+// obtained in get_and_reset_last_marking_time() once, after which the tracking resets.
 // Any pauses recorded by add_pause() will be subtracted from that results.
 class G1ConcurrentStartToMixedTimeTracker {
 private:
@@ -60,7 +60,7 @@ public:
     }
   }
 
-  double last_marking_time() {
+  double get_and_reset_last_marking_time() {
     assert(has_result(), "Do not have all measurements yet.");
     double result = (_mixed_start_time - _concurrent_start_end_time) - _total_pause_time;
     reset();
@@ -80,6 +80,8 @@ public:
     }
   }
 
+  bool is_active() const { return _active; }
+
   // Returns whether we have a result that can be retrieved.
   bool has_result() const { return _mixed_start_time > 0.0 && _concurrent_start_end_time > 0.0; }
 };
diff --git a/src/hotspot/share/gc/g1/g1IHOPControl.cpp b/src/hotspot/share/gc/g1/g1IHOPControl.cpp
index 43698e9f12b..1e1c52477f9 100644
--- a/src/hotspot/share/gc/g1/g1IHOPControl.cpp
+++ b/src/hotspot/share/gc/g1/g1IHOPControl.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2015, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2015, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -38,18 +38,18 @@ double G1IHOPControl::predict(const TruncatedSeq* seq) const {
 bool G1IHOPControl::have_enough_data_for_prediction() const {
   assert(_is_adaptive, "precondition");
 
-  return ((size_t)_marking_times_s.num() >= G1AdaptiveIHOPNumInitialSamples) &&
-         ((size_t)_allocation_rate_s.num() >= G1AdaptiveIHOPNumInitialSamples);
+  return ((size_t)_marking_start_to_mixed_time_s.num() >= G1AdaptiveIHOPNumInitialSamples) &&
+         ((size_t)_old_gen_alloc_rate.num() >= G1AdaptiveIHOPNumInitialSamples);
 }
 
-double G1IHOPControl::last_marking_length_s() const {
-  return _marking_times_s.last();
+double G1IHOPControl::last_marking_start_to_mixed_time_s() const {
+  return _marking_start_to_mixed_time_s.last();
 }
 
-size_t G1IHOPControl::actual_target_threshold() const {
+size_t G1IHOPControl::effective_target_occupancy() const {
   assert(_is_adaptive, "precondition");
 
-  // The actual target threshold takes the heap reserve and the expected waste in
+  // The effective target occupancy takes the heap reserve and the expected waste in
   // free space  into account.
   // _heap_reserve is that part of the total heap capacity that is reserved for
   // eventual promotion failure.
@@ -79,9 +79,9 @@ G1IHOPControl::G1IHOPControl(double ihop_percent,
     _last_allocation_time_s(0.0),
     _old_gen_alloc_tracker(old_gen_alloc_tracker),
     _predictor(predictor),
-    _marking_times_s(10, 0.05),
-    _allocation_rate_s(10, 0.05),
-    _last_unrestrained_young_size(0) {
+    _marking_start_to_mixed_time_s(10, 0.05),
+    _old_gen_alloc_rate(10, 0.05),
+    _expected_young_gen_at_first_mixed_gc(0) {
   assert(_initial_ihop_percent >= 0.0 && _initial_ihop_percent <= 100.0,
          "IHOP percent out of range: %.3f", ihop_percent);
   assert(!_is_adaptive || _predictor != nullptr, "precondition");
@@ -98,85 +98,104 @@ void G1IHOPControl::report_statistics(G1NewTracer* new_tracer, size_t non_young_
   send_trace_event(new_tracer, non_young_occupancy);
 }
 
-void G1IHOPControl::update_allocation_info(double allocation_time_s, size_t additional_buffer_size) {
+void G1IHOPControl::update_allocation_info(double allocation_time_s, size_t expected_young_gen_size) {
   assert(allocation_time_s > 0, "Invalid allocation time: %.3f", allocation_time_s);
   _last_allocation_time_s = allocation_time_s;
   double alloc_rate = _old_gen_alloc_tracker->last_period_old_gen_growth() / allocation_time_s;
-  _allocation_rate_s.add(alloc_rate);
-  _last_unrestrained_young_size = additional_buffer_size;
+  _old_gen_alloc_rate.add(alloc_rate);
+  _expected_young_gen_at_first_mixed_gc = expected_young_gen_size;
 }
 
-void G1IHOPControl::update_marking_length(double marking_length_s) {
-  assert(marking_length_s >= 0.0, "Invalid marking length: %.3f", marking_length_s);
-  _marking_times_s.add(marking_length_s);
+void G1IHOPControl::add_marking_start_to_mixed_length(double length_s) {
+  assert(length_s >= 0.0, "Invalid marking length: %.3f", length_s);
+  _marking_start_to_mixed_time_s.add(length_s);
 }
 
-size_t G1IHOPControl::get_conc_mark_start_threshold() {
+// Determine the old generation occupancy threshold at which to start
+// concurrent marking such that reclamation (first Mixed GC) begins
+// before the heap reaches a critical occupancy level.
+size_t G1IHOPControl::old_gen_threshold_for_conc_mark_start() {
   guarantee(_target_occupancy > 0, "Target occupancy must be initialized");
 
   if (!_is_adaptive || !have_enough_data_for_prediction()) {
     return (size_t)(_initial_ihop_percent * _target_occupancy / 100.0);
   }
 
-  double pred_marking_time = predict(&_marking_times_s);
-  double pred_rate = predict(&_allocation_rate_s);
-  size_t pred_bytes = (size_t)(pred_marking_time * pred_rate);
-  size_t predicted_needed = pred_bytes + _last_unrestrained_young_size;
-  size_t internal_threshold = actual_target_threshold();
+  // During the time between marking start and the first Mixed GC,
+  // additional memory will be consumed:
+  //   - Old gen grows due to allocations:
+  //       old_gen_alloc_bytes = old_gen_alloc_rate * marking_start_to_mixed_time
+  //   - Young gen will occupy a certain size at the first Mixed GC:
+  //       expected_young_gen_at_first_mixed_gc
+  double marking_start_to_mixed_time = predict(&_marking_start_to_mixed_time_s);
+  double old_gen_alloc_rate = predict(&_old_gen_alloc_rate);
+  size_t old_gen_alloc_bytes = (size_t)(marking_start_to_mixed_time * old_gen_alloc_rate);
 
-  return predicted_needed < internal_threshold
-         ? internal_threshold - predicted_needed
+  // Therefore, the total heap occupancy at the first Mixed GC is:
+  //   current_old_gen + old_gen_growth + expected_young_gen_at_first_mixed_gc
+  //
+  // To ensure this does not exceed the target_heap_occupancy, we work
+  // backwards to compute the old gen occupancy at which marking must start:
+  //   mark_start_threshold = target_heap_occupancy -
+  //                          (old_gen_growth + expected_young_gen_at_first_mixed_gc)
+
+  size_t predicted_needed = old_gen_alloc_bytes + _expected_young_gen_at_first_mixed_gc;
+  size_t target_heap_occupancy = effective_target_occupancy();
+
+  return predicted_needed < target_heap_occupancy
+         ? target_heap_occupancy - predicted_needed
          : 0;
 }
 
 void G1IHOPControl::print_log(size_t non_young_occupancy) {
   assert(_target_occupancy > 0, "Target occupancy still not updated yet.");
-  size_t cur_conc_mark_start_threshold = get_conc_mark_start_threshold();
-  log_debug(gc, ihop)("Basic information (value update), threshold: %zuB (%1.2f), target occupancy: %zuB, non-young occupancy: %zuB, "
-                      "recent allocation size: %zuB, recent allocation duration: %1.2fms, recent old gen allocation rate: %1.2fB/s, recent marking phase length: %1.2fms",
-                      cur_conc_mark_start_threshold,
-                      percent_of(cur_conc_mark_start_threshold, _target_occupancy),
+  size_t old_gen_mark_start_threshold = old_gen_threshold_for_conc_mark_start();
+  log_debug(gc, ihop)("Basic information (value update), old-gen threshold: %zuB (%1.2f%%), target occupancy: %zuB, old-gen occupancy: %zuB (%1.2f%%), "
+                      "recent old-gen allocation size: %zuB, recent allocation duration: %1.2fms, recent old-gen allocation rate: %1.2fB/s, recent marking phase length: %1.2fms",
+                      old_gen_mark_start_threshold,
+                      percent_of(old_gen_mark_start_threshold, _target_occupancy),
                       _target_occupancy,
                       non_young_occupancy,
+                      percent_of(non_young_occupancy, _target_occupancy),
                       _old_gen_alloc_tracker->last_period_old_gen_bytes(),
                       _last_allocation_time_s * 1000.0,
                       _last_allocation_time_s > 0.0 ? _old_gen_alloc_tracker->last_period_old_gen_bytes() / _last_allocation_time_s : 0.0,
-                      last_marking_length_s() * 1000.0);
+                      last_marking_start_to_mixed_time_s() * 1000.0);
 
   if (!_is_adaptive) {
     return;
   }
 
-  size_t actual_threshold = actual_target_threshold();
-  log_debug(gc, ihop)("Adaptive IHOP information (value update), threshold: %zuB (%1.2f), internal target threshold: %zuB, "
-                      "non-young occupancy: %zuB, additional buffer size: %zuB, predicted old gen allocation rate: %1.2fB/s, "
-                      "predicted marking phase length: %1.2fms, prediction active: %s",
-                      cur_conc_mark_start_threshold,
-                      percent_of(cur_conc_mark_start_threshold, actual_threshold),
-                      actual_threshold,
+  size_t effective_target = effective_target_occupancy();
+  log_debug(gc, ihop)("Adaptive IHOP information (value update), prediction active: %s, old-gen threshold: %zuB (%1.2f%%), internal target occupancy: %zuB, "
+                      "old-gen occupancy: %zuB, additional buffer size: %zuB, predicted old-gen allocation rate: %1.2fB/s, "
+                      "predicted marking phase length: %1.2fms",
+                      BOOL_TO_STR(have_enough_data_for_prediction()),
+                      old_gen_mark_start_threshold,
+                      percent_of(old_gen_mark_start_threshold, effective_target),
+                      effective_target,
                       non_young_occupancy,
-                      _last_unrestrained_young_size,
-                      predict(&_allocation_rate_s),
-                      predict(&_marking_times_s) * 1000.0,
-                      have_enough_data_for_prediction() ? "true" : "false");
+                      _expected_young_gen_at_first_mixed_gc,
+                      predict(&_old_gen_alloc_rate),
+                      predict(&_marking_start_to_mixed_time_s) * 1000.0);
 }
 
 void G1IHOPControl::send_trace_event(G1NewTracer* tracer, size_t non_young_occupancy) {
   assert(_target_occupancy > 0, "Target occupancy still not updated yet.");
-  tracer->report_basic_ihop_statistics(get_conc_mark_start_threshold(),
+  tracer->report_basic_ihop_statistics(old_gen_threshold_for_conc_mark_start(),
                                        _target_occupancy,
                                        non_young_occupancy,
                                        _old_gen_alloc_tracker->last_period_old_gen_bytes(),
                                        _last_allocation_time_s,
-                                       last_marking_length_s());
+                                       last_marking_start_to_mixed_time_s());
 
   if (_is_adaptive) {
-    tracer->report_adaptive_ihop_statistics(get_conc_mark_start_threshold(),
-                                            actual_target_threshold(),
+    tracer->report_adaptive_ihop_statistics(old_gen_threshold_for_conc_mark_start(),
+                                            effective_target_occupancy(),
                                             non_young_occupancy,
-                                            _last_unrestrained_young_size,
-                                            predict(&_allocation_rate_s),
-                                            predict(&_marking_times_s),
+                                            _expected_young_gen_at_first_mixed_gc,
+                                            predict(&_old_gen_alloc_rate),
+                                            predict(&_marking_start_to_mixed_time_s),
                                             have_enough_data_for_prediction());
   }
 }
diff --git a/src/hotspot/share/gc/g1/g1IHOPControl.hpp b/src/hotspot/share/gc/g1/g1IHOPControl.hpp
index 24061c026d1..ff209012f02 100644
--- a/src/hotspot/share/gc/g1/g1IHOPControl.hpp
+++ b/src/hotspot/share/gc/g1/g1IHOPControl.hpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2015, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2015, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -58,8 +58,11 @@ class G1IHOPControl : public CHeapObj<mtGC> {
   const G1OldGenAllocationTracker* _old_gen_alloc_tracker;
 
   const G1Predictions* _predictor;
-  TruncatedSeq _marking_times_s;
-  TruncatedSeq _allocation_rate_s;
+  // Wall-clock time in seconds from marking start to the first mixed GC,
+  // excluding GC Pause time.
+  TruncatedSeq _marking_start_to_mixed_time_s;
+  // Old generation allocation rate in bytes per second.
+  TruncatedSeq _old_gen_alloc_rate;
 
   // The most recent unrestrained size of the young gen. This is used as an additional
   // factor in the calculation of the threshold, as the threshold is based on
@@ -68,18 +71,18 @@ class G1IHOPControl : public CHeapObj<mtGC> {
   // Since we cannot know what young gen sizes are used in the future, we will just
   // use the current one. We expect that this one will be one with a fairly large size,
   // as there is no marking or mixed gc that could impact its size too much.
-  size_t _last_unrestrained_young_size;
+  size_t _expected_young_gen_at_first_mixed_gc;
 
   // Get a new prediction bounded below by zero from the given sequence.
   double predict(const TruncatedSeq* seq) const;
 
   bool have_enough_data_for_prediction() const;
-  double last_marking_length_s() const;
+  double last_marking_start_to_mixed_time_s() const;
 
-  // The "actual" target threshold the algorithm wants to keep during and at the
-  // end of marking. This is typically lower than the requested threshold, as the
+  // The "effective" target occupancy the algorithm wants to keep until the start
+  // of Mixed GCs. This is typically lower than the target occupancy, as the
   // algorithm needs to consider restrictions by the environment.
-  size_t actual_target_threshold() const;
+  size_t effective_target_occupancy() const;
 
  void print_log(size_t non_young_occupancy);
  void send_trace_event(G1NewTracer* tracer, size_t non_young_occupancy);
@@ -95,22 +98,24 @@ class G1IHOPControl : public CHeapObj<mtGC> {
   // Adjust target occupancy.
   void update_target_occupancy(size_t new_target_occupancy);
 
-  // Update information about time during which allocations in the Java heap occurred,
-  // how large these allocations were in bytes, and an additional buffer.
-  // The allocations should contain any amount of space made unusable for further
-  // allocation, e.g. any waste caused by TLAB allocation, space at the end of
-  // humongous objects that can not be used for allocation, etc.
-  // Together with the target occupancy, this additional buffer should contain the
-  // difference between old gen size and total heap size at the start of reclamation,
-  // and space required for that reclamation.
-  void update_allocation_info(double allocation_time_s, size_t additional_buffer_size);
+  void update_target_after_marking_phase();
+
+  // Update allocation rate information and current expected young gen size for the
+  // first mixed gc needed for the predictor. Allocation rate is given as the
+  // separately passed in allocation increment and the time passed (mutator time)
+  // for the latest allocation increment here. Allocation size is the memory needed
+  // during the mutator before and the first mixed gc pause itself.
+  // Contents include young gen at that point, and the memory required for evacuating
+  // the collection set in that first mixed gc (including waste caused by PLAB
+  // allocation etc.).
+  void update_allocation_info(double allocation_time_s, size_t expected_young_gen_size);
 
   // Update the time spent in the mutator beginning from the end of concurrent start to
   // the first mixed gc.
-  void update_marking_length(double marking_length_s);
+  void add_marking_start_to_mixed_length(double length_s);
 
   // Get the current non-young occupancy at which concurrent marking should start.
-  size_t get_conc_mark_start_threshold();
+  size_t old_gen_threshold_for_conc_mark_start();
 
   void report_statistics(G1NewTracer* tracer, size_t non_young_occupancy);
 };
diff --git a/src/hotspot/share/gc/g1/g1Policy.cpp b/src/hotspot/share/gc/g1/g1Policy.cpp
index 0145f1e6e1d..24a82113d20 100644
--- a/src/hotspot/share/gc/g1/g1Policy.cpp
+++ b/src/hotspot/share/gc/g1/g1Policy.cpp
@@ -738,15 +738,15 @@ bool G1Policy::need_to_start_conc_mark(const char* source, size_t allocation_wor
     return false;
   }
 
-  size_t marking_initiating_used_threshold = _ihop_control->get_conc_mark_start_threshold();
+  size_t marking_initiating_old_gen_threshold = _ihop_control->old_gen_threshold_for_conc_mark_start();
   size_t non_young_occupancy = _g1h->non_young_occupancy_after_allocation(allocation_word_size);
 
   bool result = false;
-  if (non_young_occupancy > marking_initiating_used_threshold) {
+  if (non_young_occupancy > marking_initiating_old_gen_threshold) {
     result = collector_state()->is_in_young_only_phase();
     log_debug(gc, ergo, ihop)("%s non-young occupancy: %zuB allocation request: %zuB threshold: %zuB (%1.2f) source: %s",
                               result ? "Request concurrent cycle initiation (occupancy higher than threshold)" : "Do not request concurrent cycle initiation (still doing mixed collections)",
-                              non_young_occupancy, allocation_word_size * HeapWordSize, marking_initiating_used_threshold, (double) marking_initiating_used_threshold / _g1h->capacity() * 100, source);
+                              non_young_occupancy, allocation_word_size * HeapWordSize, marking_initiating_old_gen_threshold, (double) marking_initiating_old_gen_threshold / _g1h->capacity() * 100, source);
   }
   return result;
 }
@@ -972,8 +972,7 @@ void G1Policy::record_young_collection_end(bool concurrent_operation_is_full_mar
     update_young_length_bounds();
 
     _old_gen_alloc_tracker.reset_after_gc(_g1h->humongous_regions_count() * G1HeapRegion::GrainBytes);
-    if (update_ihop_prediction(app_time_ms / 1000.0,
-                               G1CollectorState::is_young_only_pause(this_pause))) {
+    if (update_ihop_prediction(app_time_ms / 1000.0, is_young_only_pause)) {
       _ihop_control->report_statistics(_g1h->gc_tracer_stw(), _g1h->non_young_occupancy_after_allocation(allocation_word_size));
     }
   } else {
@@ -1030,14 +1029,13 @@ bool G1Policy::update_ihop_prediction(double mutator_time_s,
 
   bool report = false;
 
-  double marking_to_mixed_time = -1.0;
   if (!this_gc_was_young_only && _concurrent_start_to_mixed.has_result()) {
-    marking_to_mixed_time = _concurrent_start_to_mixed.last_marking_time();
+    double marking_to_mixed_time = _concurrent_start_to_mixed.get_and_reset_last_marking_time();
     assert(marking_to_mixed_time > 0.0,
            "Concurrent start to mixed time must be larger than zero but is %.3f",
            marking_to_mixed_time);
     if (marking_to_mixed_time > min_valid_time) {
-      _ihop_control->update_marking_length(marking_to_mixed_time);
+      _ihop_control->add_marking_start_to_mixed_length(marking_to_mixed_time);
       report = true;
     }
   }
diff --git a/test/hotspot/gtest/gc/g1/test_g1IHOPControl.cpp b/test/hotspot/gtest/gc/g1/test_g1IHOPControl.cpp
index ff661fde00d..0ee0889b6e5 100644
--- a/test/hotspot/gtest/gc/g1/test_g1IHOPControl.cpp
+++ b/test/hotspot/gtest/gc/g1/test_g1IHOPControl.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2016, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2016, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -40,7 +40,7 @@ static void test_update(G1IHOPControl* ctrl,
   test_update_allocation_tracker(alloc_tracker, alloc_amount);
   for (int i = 0; i < 100; i++) {
     ctrl->update_allocation_info(alloc_time, young_size);
-    ctrl->update_marking_length(mark_time);
+    ctrl->add_marking_start_to_mixed_length(mark_time);
   }
 }
 
@@ -57,7 +57,7 @@ static void test_update_humongous(G1IHOPControl* ctrl,
   alloc_tracker->reset_after_gc(humongous_bytes_after_last_gc);
   for (int i = 0; i < 100; i++) {
     ctrl->update_allocation_info(alloc_time, young_size);
-    ctrl->update_marking_length(mark_time);
+    ctrl->add_marking_start_to_mixed_length(mark_time);
   }
 }
 
@@ -74,26 +74,26 @@ TEST_VM(G1IHOPControl, static_simple) {
   G1IHOPControl ctrl(initial_ihop, &alloc_tracker, is_adaptive, nullptr, 0, 0);
   ctrl.update_target_occupancy(100);
 
-  size_t threshold = ctrl.get_conc_mark_start_threshold();
+  size_t threshold = ctrl.old_gen_threshold_for_conc_mark_start();
   EXPECT_EQ(initial_ihop, threshold);
 
   test_update_allocation_tracker(&alloc_tracker, 100);
   ctrl.update_allocation_info(100.0, 100);
-  threshold = ctrl.get_conc_mark_start_threshold();
+  threshold = ctrl.old_gen_threshold_for_conc_mark_start();
   EXPECT_EQ(initial_ihop, threshold);
 
-  ctrl.update_marking_length(1000.0);
-  threshold = ctrl.get_conc_mark_start_threshold();
+  ctrl.add_marking_start_to_mixed_length(1000.0);
+  threshold = ctrl.old_gen_threshold_for_conc_mark_start();
   EXPECT_EQ(initial_ihop, threshold);
 
   // Whatever we pass, the IHOP value must stay the same.
   test_update(&ctrl, &alloc_tracker, 2, 10, 10, 3);
-  threshold = ctrl.get_conc_mark_start_threshold();
+  threshold = ctrl.old_gen_threshold_for_conc_mark_start();
 
   EXPECT_EQ(initial_ihop, threshold);
 
   test_update(&ctrl, &alloc_tracker, 12, 10, 10, 3);
-  threshold = ctrl.get_conc_mark_start_threshold();
+  threshold = ctrl.old_gen_threshold_for_conc_mark_start();
 
   EXPECT_EQ(initial_ihop, threshold);
 }
@@ -126,23 +126,23 @@ TEST_VM(G1IHOPControl, adaptive_simple) {
           - (young_size + alloc_amount1 / alloc_time1 * marking_time1);
 
   size_t threshold;
-  threshold = ctrl.get_conc_mark_start_threshold();
+  threshold = ctrl.old_gen_threshold_for_conc_mark_start();
 
   EXPECT_EQ(initial_threshold, threshold);
 
   for (size_t i = 0; i < G1AdaptiveIHOPNumInitialSamples - 1; i++) {
     test_update_allocation_tracker(&alloc_tracker, alloc_amount1);
     ctrl.update_allocation_info(alloc_time1, young_size);
-    ctrl.update_marking_length(marking_time1);
+    ctrl.add_marking_start_to_mixed_length(marking_time1);
     // Not enough data yet.
-    threshold = ctrl.get_conc_mark_start_threshold();
+    threshold = ctrl.old_gen_threshold_for_conc_mark_start();
 
     ASSERT_EQ(initial_threshold, threshold) << "on step " << i;
   }
 
   test_update(&ctrl, &alloc_tracker, alloc_time1, alloc_amount1, young_size, marking_time1);
 
-  threshold = ctrl.get_conc_mark_start_threshold();
+  threshold = ctrl.old_gen_threshold_for_conc_mark_start();
 
   EXPECT_EQ(settled_ihop1, threshold);
 
@@ -155,7 +155,7 @@ TEST_VM(G1IHOPControl, adaptive_simple) {
 
   test_update(&ctrl, &alloc_tracker, alloc_time2, alloc_amount2, young_size, marking_time2);
 
-  threshold = ctrl.get_conc_mark_start_threshold();
+  threshold = ctrl.old_gen_threshold_for_conc_mark_start();
 
   EXPECT_LT(threshold, settled_ihop1);
 
@@ -166,14 +166,14 @@ TEST_VM(G1IHOPControl, adaptive_simple) {
   const size_t settled_ihop3 = 0;
 
   test_update(&ctrl, &alloc_tracker, alloc_time3, alloc_amount3, young_size, marking_time3);
-  threshold = ctrl.get_conc_mark_start_threshold();
+  threshold = ctrl.old_gen_threshold_for_conc_mark_start();
 
   EXPECT_EQ(settled_ihop3, threshold);
 
   // And back to some arbitrary value.
   test_update(&ctrl, &alloc_tracker, alloc_time2, alloc_amount2, young_size, marking_time2);
 
-  threshold = ctrl.get_conc_mark_start_threshold();
+  threshold = ctrl.old_gen_threshold_for_conc_mark_start();
 
   EXPECT_GT(threshold, settled_ihop3);
 }
@@ -205,7 +205,7 @@ TEST_VM(G1IHOPControl, adaptive_humongous) {
                         humongous_bytes_after_last_gc, young_size, marking_time);
   // Test threshold
   size_t threshold;
-  threshold = ctrl.get_conc_mark_start_threshold();
+  threshold = ctrl.old_gen_threshold_for_conc_mark_start();
   // Adjusted allocated bytes:
   // Total bytes: humongous_bytes
   // Freed hum bytes: humongous_bytes - humongous_bytes_after_last_gc
@@ -219,7 +219,7 @@ TEST_VM(G1IHOPControl, adaptive_humongous) {
   ctrl2.update_target_occupancy(target_size);
   test_update_humongous(&ctrl2, &alloc_tracker, duration, old_bytes, humongous_bytes,
                         humongous_bytes_after_gc, young_size, marking_time);
-  threshold = ctrl2.get_conc_mark_start_threshold();
+  threshold = ctrl2.old_gen_threshold_for_conc_mark_start();
   // Adjusted allocated bytes:
   // Total bytes: old_bytes + humongous_bytes
   // Freed hum bytes: humongous_bytes - (humongous_bytes_after_gc - humongous_bytes_after_last_gc)
@@ -235,7 +235,7 @@ TEST_VM(G1IHOPControl, adaptive_humongous) {
   ctrl3.update_target_occupancy(target_size);
   test_update_humongous(&ctrl3, &alloc_tracker, duration, old_bytes, humongous_bytes,
                         humongous_bytes_after_gc, young_size, marking_time);
-  threshold = ctrl3.get_conc_mark_start_threshold();
+  threshold = ctrl3.old_gen_threshold_for_conc_mark_start();
   // Adjusted allocated bytes:
   // All humongous are cleaned up since humongous_bytes_after_gc < humongous_bytes_after_last_gc
   // Total bytes: old_bytes + humongous_bytes

From 299452402551d5387eb41ad799ce6a05c05237b9 Mon Sep 17 00:00:00 2001
From: Yasumasa Suenaga <ysuenaga@openjdk.org>
Date: Fri, 27 Mar 2026 13:26:49 +0000
Subject: [PATCH 386/655] 8380956: HexFormat shoud have @ValueBased

Reviewed-by: rriggs, stuefe, liach
---
 src/java.base/share/classes/java/util/HexFormat.java | 5 +++--
 1 file changed, 3 insertions(+), 2 deletions(-)

diff --git a/src/java.base/share/classes/java/util/HexFormat.java b/src/java.base/share/classes/java/util/HexFormat.java
index aebb8b9af52..7d9fe08108d 100644
--- a/src/java.base/share/classes/java/util/HexFormat.java
+++ b/src/java.base/share/classes/java/util/HexFormat.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2020, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
  * Copyright (c) 2024, Alibaba Group Holding Limited. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
@@ -26,6 +26,7 @@
 
 package java.util;
 
+import jdk.internal.ValueBased;
 import jdk.internal.access.JavaLangAccess;
 import jdk.internal.access.SharedSecrets;
 import jdk.internal.util.HexDigits;
@@ -134,7 +135,7 @@ import java.nio.CharBuffer;
  * @since 17
  */
 
-
+@ValueBased
 public final class HexFormat {
 
     // Access to create strings from a byte array.

From 426547d2c8df1d6b9b494eb28d0fbbdfe58c8821 Mon Sep 17 00:00:00 2001
From: Benjamin Peterson <benjamin@engflow.com>
Date: Fri, 27 Mar 2026 14:56:54 +0000
Subject: [PATCH 387/655] 8380968: classfile package doc mentions nonexistent
 UtfEntry

Reviewed-by: liach
---
 .../classes/java/lang/classfile/package-info.java      | 10 +++++-----
 1 file changed, 5 insertions(+), 5 deletions(-)

diff --git a/src/java.base/share/classes/java/lang/classfile/package-info.java b/src/java.base/share/classes/java/lang/classfile/package-info.java
index 460f6699e7b..8bf5559df0a 100644
--- a/src/java.base/share/classes/java/lang/classfile/package-info.java
+++ b/src/java.base/share/classes/java/lang/classfile/package-info.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2022, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2022, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -493,9 +493,9 @@
  *
  * {@snippet lang="text" :
  * ClassElement =
- *     FieldModel*(UtfEntry name, Utf8Entry descriptor)
- *     | MethodModel*(UtfEntry name, Utf8Entry descriptor)
- *     | ModuleAttribute?(int flags, ModuleEntry moduleName, UtfEntry moduleVersion,
+ *     FieldModel*(Utf8Entry name, Utf8Entry descriptor)
+ *     | MethodModel*(Utf8Entry name, Utf8Entry descriptor)
+ *     | ModuleAttribute?(int flags, ModuleEntry moduleName, Utf8Entry moduleVersion,
  *                        List<ModuleRequireInfo> requires, List<ModuleOpenInfo> opens,
  *                        List<ModuleExportInfo> exports, List<ModuleProvidesInfo> provides,
  *                        List<ClassEntry> uses)
@@ -588,7 +588,7 @@
  *     | LabelTarget(Label label)
  *     | LineNumber(int line)
  *     | ExceptionCatch(Label tryStart, Label tryEnd, Label handler, ClassEntry exception)
- *     | LocalVariable(int slot, UtfEntry name, Utf8Entry type, Label startScope, Label endScope)
+ *     | LocalVariable(int slot, Utf8Entry name, Utf8Entry type, Label startScope, Label endScope)
  *     | LocalVariableType(int slot, Utf8Entry name, Utf8Entry type, Label startScope, Label endScope)
  *     | CharacterRange(int rangeStart, int rangeEnd, int flags, Label startScope, Label endScope)
  * }

From 1ed1bb8ccbc7ba0cbb54f4354c64d39b3ea64d90 Mon Sep 17 00:00:00 2001
From: Daisuke Yamazaki <dyama@openjdk.org>
Date: Fri, 27 Mar 2026 15:52:13 +0000
Subject: [PATCH 388/655] 8379818: Refactor
 java/nio/file/Files/StreamLinesTest.java to use JUnit

Reviewed-by: bpb
---
 .../java/nio/file/Files/StreamLinesTest.java  | 63 ++++++++-----------
 1 file changed, 25 insertions(+), 38 deletions(-)

diff --git a/test/jdk/java/nio/file/Files/StreamLinesTest.java b/test/jdk/java/nio/file/Files/StreamLinesTest.java
index 402b114ae0b..7812a4ceb89 100644
--- a/test/jdk/java/nio/file/Files/StreamLinesTest.java
+++ b/test/jdk/java/nio/file/Files/StreamLinesTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2015, 2017, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2015, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,18 +23,15 @@
 
 /* @test
  * @bug 8072773
- * @library /test/lib /lib/testlibrary/bootlib
- * @build java.base/java.util.stream.OpTestCase
- *        jdk.test.lib.RandomFactory
- * @run testng/othervm StreamLinesTest
+ * @library /test/lib
+ * @build jdk.test.lib.RandomFactory
+ * @run junit/othervm StreamLinesTest
  * @summary Tests streams returned from Files.lines, primarily focused on
  *          testing the file-channel-based stream stream with supported
  *          character sets
  * @key randomness
  */
 
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
 
 import java.io.BufferedReader;
 import java.io.BufferedWriter;
@@ -50,13 +47,16 @@ import java.util.EnumSet;
 import java.util.List;
 import java.util.Random;
 import java.util.function.IntFunction;
-import java.util.function.Supplier;
-import java.util.stream.OpTestCase;
 import java.util.stream.Stream;
-import java.util.stream.TestData;
 import jdk.test.lib.RandomFactory;
 
-public class StreamLinesTest extends OpTestCase {
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.Arguments;
+import org.junit.jupiter.params.provider.MethodSource;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+
+public class StreamLinesTest {
 
     enum LineSeparator {
         NONE(""),
@@ -120,16 +120,15 @@ public class StreamLinesTest extends OpTestCase {
         }
     }
 
-    static Object[] of(String description, IntFunction<String> lineGenerator,
+    static Arguments of(String description, IntFunction<String> lineGenerator,
                        IntFunction<LineSeparator> separatorGenerator, int n, Charset cs) {
-        return new Object[]{description, lineGenerator, separatorGenerator, n, cs};
+        return Arguments.argumentSet(description, lineGenerator, separatorGenerator, n, cs);
     }
 
     private static final Random random = RandomFactory.getRandom();
 
-    @DataProvider
-    public static Object[][] lines() {
-        List<Object[]> l = new ArrayList<>();
+    static Stream<Arguments> lines() {
+        List<Arguments> l = new ArrayList<>();
 
         // Include the three supported optimal-line charsets and one
         // which does not
@@ -175,38 +174,26 @@ public class StreamLinesTest extends OpTestCase {
                      1024, charset));
         }
 
-        return l.toArray(new Object[][]{});
+        return l.stream();
     }
 
-    @Test(dataProvider = "lines")
-    public void test(String description,
-                     IntFunction<String> lineGenerator, IntFunction<LineSeparator> separatorGenerator,
+    @ParameterizedTest
+    @MethodSource("lines")
+    public void test(IntFunction<String> lineGenerator, IntFunction<LineSeparator> separatorGenerator,
                      int lines, Charset cs) throws IOException {
         Path p = generateTempFileWithLines(lineGenerator, separatorGenerator, lines, cs, false);
 
-        Supplier<Stream<String>> ss = () -> {
-            try {
-                return Files.lines(p, cs);
-            }
-            catch (IOException e) {
-                throw new RuntimeException(e);
-            }
-        };
-
         // Test without a separator at the end
         List<String> expected = readAllLines(p, cs);
-        withData(TestData.Factory.ofSupplier("Lines with no separator at end", ss))
-                .stream(s -> s)
-                .expectedResult(expected)
-                .exercise();
+        try (Stream<String> s = Files.lines(p, cs)) {
+            assertEquals(expected, s.toList());
+        }
 
         // Test with a separator at the end
         writeLineSeparator(p, separatorGenerator, lines, cs);
         expected = readAllLines(p, cs);
-        withData(TestData.Factory.ofSupplier("Lines with separator at end", ss))
-                .stream(s -> s)
-                .expectedResult(expected)
-                .exercise();
+        try (Stream<String> s = Files.lines(p, cs)) {
+            assertEquals(expected, s.toList());
+        }
     }
-
 }

From ba700f105a1b65db8e905faa146884407ee13257 Mon Sep 17 00:00:00 2001
From: Vladimir Kozlov <kvn@openjdk.org>
Date: Fri, 27 Mar 2026 16:16:09 +0000
Subject: [PATCH 389/655] 8381059: Add class name to deoptimization events and
 -Xlog:deoptimization=debug output

Reviewed-by: dlong, aseoane
---
 src/hotspot/share/runtime/deoptimization.cpp | 53 ++++++++++++++------
 1 file changed, 37 insertions(+), 16 deletions(-)

diff --git a/src/hotspot/share/runtime/deoptimization.cpp b/src/hotspot/share/runtime/deoptimization.cpp
index 5fbe2842a2b..cfdcf52a5eb 100644
--- a/src/hotspot/share/runtime/deoptimization.cpp
+++ b/src/hotspot/share/runtime/deoptimization.cpp
@@ -2021,7 +2021,7 @@ static void post_deoptimization_event(nmethod* nm,
 #endif // INCLUDE_JFR
 
 static void log_deopt(nmethod* nm, Method* tm, intptr_t pc, frame& fr, int trap_bci,
-                              const char* reason_name, const char* reason_action) {
+                      const char* reason_name, const char* reason_action, const char* class_name) {
   LogTarget(Debug, deoptimization) lt;
   if (lt.is_enabled()) {
     LogStream ls(lt);
@@ -2035,6 +2035,9 @@ static void log_deopt(nmethod* nm, Method* tm, intptr_t pc, frame& fr, int trap_
     }
     ls.print("%s ", reason_name);
     ls.print("%s ", reason_action);
+    if (class_name != nullptr) {
+      ls.print("%s ", class_name);
+    }
     ls.print_cr("pc=" INTPTR_FORMAT " relative_pc=" INTPTR_FORMAT,
              pc, fr.pc() - nm->code_begin());
   }
@@ -2135,6 +2138,17 @@ JRT_ENTRY(void, Deoptimization::uncommon_trap_inner(JavaThread* current, jint tr
     MethodData* trap_mdo =
       get_method_data(current, profiled_method, create_if_missing);
 
+    Symbol* class_name = nullptr;
+    bool unresolved = false;
+    if (unloaded_class_index >= 0) {
+      constantPoolHandle constants (current, trap_method->constants());
+      if (constants->tag_at(unloaded_class_index).is_unresolved_klass()) {
+        class_name = constants->klass_name_at(unloaded_class_index);
+        unresolved = true;
+      } else if (constants->tag_at(unloaded_class_index).is_symbol()) {
+        class_name = constants->symbol_at(unloaded_class_index);
+      }
+    }
     { // Log Deoptimization event for JFR, UL and event system
       Method* tm = trap_method();
       const char* reason_name = trap_reason_name(reason);
@@ -2142,10 +2156,24 @@ JRT_ENTRY(void, Deoptimization::uncommon_trap_inner(JavaThread* current, jint tr
       intptr_t pc = p2i(fr.pc());
 
       JFR_ONLY(post_deoptimization_event(nm, tm, trap_bci, trap_bc, reason, action);)
-      log_deopt(nm, tm, pc, fr, trap_bci, reason_name, reason_action);
-      Events::log_deopt_message(current, "Uncommon trap: reason=%s action=%s pc=" INTPTR_FORMAT " method=%s @ %d %s",
+
+      ResourceMark rm;
+
+      const char* class_name_str = nullptr;
+      const char* class_name_msg = nullptr;
+      stringStream st, stm;
+      if (class_name != nullptr) {
+        class_name->print_symbol_on(&st);
+        class_name_str = st.freeze();
+        stm.print("class=%s ", class_name_str);
+        class_name_msg = stm.freeze();
+      } else {
+        class_name_msg = "";
+      }
+      log_deopt(nm, tm, pc, fr, trap_bci, reason_name, reason_action, class_name_str);
+      Events::log_deopt_message(current, "Uncommon trap: reason=%s action=%s pc=" INTPTR_FORMAT " method=%s @ %d %s%s",
                                 reason_name, reason_action, pc,
-                                tm->name_and_sig_as_C_string(), trap_bci, nm->compiler_name());
+                                tm->name_and_sig_as_C_string(), trap_bci, class_name_msg, nm->compiler_name());
     }
 
     // Print a bunch of diagnostics, if requested.
@@ -2173,20 +2201,13 @@ JRT_ENTRY(void, Deoptimization::uncommon_trap_inner(JavaThread* current, jint tr
 #endif
         nm->log_identity(xtty);
       }
-      Symbol* class_name = nullptr;
-      bool unresolved = false;
-      if (unloaded_class_index >= 0) {
-        constantPoolHandle constants (current, trap_method->constants());
-        if (constants->tag_at(unloaded_class_index).is_unresolved_klass()) {
-          class_name = constants->klass_name_at(unloaded_class_index);
-          unresolved = true;
-          if (xtty != nullptr)
+      if (class_name != nullptr) {
+        if (xtty != nullptr) {
+          if (unresolved) {
             xtty->print(" unresolved='1'");
-        } else if (constants->tag_at(unloaded_class_index).is_symbol()) {
-          class_name = constants->symbol_at(unloaded_class_index);
-        }
-        if (xtty != nullptr)
+          }
           xtty->name(class_name);
+        }
       }
       if (xtty != nullptr && trap_mdo != nullptr && (int)reason < (int)MethodData::_trap_hist_limit) {
         // Dump the relevant MDO state.

From a4d160e64614fa2f61a57b3eedb333fb665723f5 Mon Sep 17 00:00:00 2001
From: Vladimir Kozlov <kvn@openjdk.org>
Date: Fri, 27 Mar 2026 16:19:22 +0000
Subject: [PATCH 390/655] 8380828: AOTCodeReader::fix_relocations() should be
 called before ICache::invalidate_range() is called

Reviewed-by: adinn, asmehra
---
 src/hotspot/share/code/aotCodeCache.cpp | 65 +++++++++++++++----------
 src/hotspot/share/code/aotCodeCache.hpp | 17 +++++--
 src/hotspot/share/code/codeBlob.cpp     | 56 +++++++++------------
 src/hotspot/share/code/codeBlob.hpp     | 19 ++++----
 4 files changed, 84 insertions(+), 73 deletions(-)

diff --git a/src/hotspot/share/code/aotCodeCache.cpp b/src/hotspot/share/code/aotCodeCache.cpp
index 4ad5e12d808..030e2684bfc 100644
--- a/src/hotspot/share/code/aotCodeCache.cpp
+++ b/src/hotspot/share/code/aotCodeCache.cpp
@@ -539,6 +539,9 @@ AOTCodeReader::AOTCodeReader(AOTCodeCache* cache, AOTCodeEntry* entry) {
   _load_buffer = cache->cache_buffer();
   _read_position = 0;
   _lookup_failed = false;
+  _name          = nullptr;
+  _reloc_data    = nullptr;
+  _oop_maps      = nullptr;
 }
 
 void AOTCodeReader::set_read_position(uint pos) {
@@ -903,16 +906,6 @@ bool AOTCodeCache::store_code_blob(CodeBlob& blob, AOTCodeEntry::Kind entry_kind
     has_oop_maps = true;
   }
 
-#ifndef PRODUCT
-  // Write asm remarks
-  if (!cache->write_asm_remarks(blob)) {
-    return false;
-  }
-  if (!cache->write_dbg_strings(blob)) {
-    return false;
-  }
-#endif /* PRODUCT */
-
   if (!cache->write_relocations(blob)) {
     if (!cache->failed()) {
       // We may miss an address in AOT table - skip this code blob.
@@ -921,6 +914,16 @@ bool AOTCodeCache::store_code_blob(CodeBlob& blob, AOTCodeEntry::Kind entry_kind
     return false;
   }
 
+#ifndef PRODUCT
+  // Write asm remarks after relocation info
+  if (!cache->write_asm_remarks(blob)) {
+    return false;
+  }
+  if (!cache->write_dbg_strings(blob)) {
+    return false;
+  }
+#endif /* PRODUCT */
+
   uint entry_size = cache->_write_position - entry_position;
   AOTCodeEntry* entry = new(cache) AOTCodeEntry(entry_kind, encode_id(entry_kind, id),
                                                 entry_position, entry_size, name_offset, name_size,
@@ -982,39 +985,28 @@ CodeBlob* AOTCodeReader::compile_code_blob(const char* name) {
     set_lookup_failed(); // Skip this blob
     return nullptr;
   }
+  _name = stored_name;
 
   // Read archived code blob
   uint offset = entry_position + _entry->blob_offset();
   CodeBlob* archived_blob = (CodeBlob*)addr(offset);
   offset += archived_blob->size();
 
-  address reloc_data = (address)addr(offset);
+  _reloc_data = (address)addr(offset);
   offset += archived_blob->relocation_size();
   set_read_position(offset);
 
-  ImmutableOopMapSet* oop_maps = nullptr;
   if (_entry->has_oop_maps()) {
-    oop_maps = read_oop_map_set();
+    _oop_maps = read_oop_map_set();
   }
 
-  CodeBlob* code_blob = CodeBlob::create(archived_blob,
-                                         stored_name,
-                                         reloc_data,
-                                         oop_maps
-                                        );
+  // CodeBlob::restore() calls AOTCodeReader::restore()
+  CodeBlob* code_blob = CodeBlob::create(archived_blob, this);
+
   if (code_blob == nullptr) { // no space left in CodeCache
     return nullptr;
   }
 
-#ifndef PRODUCT
-  code_blob->asm_remarks().init();
-  read_asm_remarks(code_blob->asm_remarks());
-  code_blob->dbg_strings().init();
-  read_dbg_strings(code_blob->dbg_strings());
-#endif // PRODUCT
-
-  fix_relocations(code_blob);
-
 #ifdef ASSERT
   LogStreamHandle(Trace, aot, codecache, stubs) log;
   if (log.is_enabled()) {
@@ -1025,6 +1017,25 @@ CodeBlob* AOTCodeReader::compile_code_blob(const char* name) {
   return code_blob;
 }
 
+void AOTCodeReader::restore(CodeBlob* code_blob) {
+  precond(AOTCodeCache::is_on_for_use());
+  precond(_name != nullptr);
+  precond(_reloc_data != nullptr);
+
+  code_blob->set_name(_name);
+  code_blob->restore_mutable_data(_reloc_data);
+  code_blob->set_oop_maps(_oop_maps);
+
+  fix_relocations(code_blob);
+
+#ifndef PRODUCT
+  code_blob->asm_remarks().init();
+  read_asm_remarks(code_blob->asm_remarks());
+  code_blob->dbg_strings().init();
+  read_dbg_strings(code_blob->dbg_strings());
+#endif // PRODUCT
+}
+
 // ------------ process code and data --------------
 
 // Can't use -1. It is valid value for jump to iteself destination
diff --git a/src/hotspot/share/code/aotCodeCache.hpp b/src/hotspot/share/code/aotCodeCache.hpp
index 7996388faa6..b0d39ff3e08 100644
--- a/src/hotspot/share/code/aotCodeCache.hpp
+++ b/src/hotspot/share/code/aotCodeCache.hpp
@@ -402,11 +402,13 @@ private:
   void clear_lookup_failed()   { _lookup_failed = false; }
   bool lookup_failed()   const { return _lookup_failed; }
 
-  AOTCodeEntry* aot_code_entry() { return (AOTCodeEntry*)_entry; }
-public:
-  AOTCodeReader(AOTCodeCache* cache, AOTCodeEntry* entry);
+  // Values used by restore(code_blob).
+  // They should be set before calling it.
+  const char*         _name;
+  address             _reloc_data;
+  ImmutableOopMapSet* _oop_maps;
 
-  CodeBlob* compile_code_blob(const char* name);
+  AOTCodeEntry* aot_code_entry() { return (AOTCodeEntry*)_entry; }
 
   ImmutableOopMapSet* read_oop_map_set();
 
@@ -415,6 +417,13 @@ public:
   void read_asm_remarks(AsmRemarks& asm_remarks);
   void read_dbg_strings(DbgStrings& dbg_strings);
 #endif // PRODUCT
+
+public:
+  AOTCodeReader(AOTCodeCache* cache, AOTCodeEntry* entry);
+
+  CodeBlob* compile_code_blob(const char* name);
+
+  void restore(CodeBlob* code_blob);
 };
 
 // code cache internal runtime constants area used by AOT code
diff --git a/src/hotspot/share/code/codeBlob.cpp b/src/hotspot/share/code/codeBlob.cpp
index fcc0b42a461..5b68ce48c87 100644
--- a/src/hotspot/share/code/codeBlob.cpp
+++ b/src/hotspot/share/code/codeBlob.cpp
@@ -22,6 +22,7 @@
  *
  */
 
+#include "code/aotCodeCache.hpp"
 #include "code/codeBlob.hpp"
 #include "code/codeCache.hpp"
 #include "code/relocInfo.hpp"
@@ -188,22 +189,6 @@ CodeBlob::CodeBlob(const char* name, CodeBlobKind kind, int size, uint16_t heade
   assert(_mutable_data == blob_end(), "sanity");
 }
 
-void CodeBlob::restore_mutable_data(address reloc_data) {
-  // Relocation data is now stored as part of the mutable data area; allocate it before copy relocations
-  if (_mutable_data_size > 0) {
-    _mutable_data = (address)os::malloc(_mutable_data_size, mtCode);
-    if (_mutable_data == nullptr) {
-      vm_exit_out_of_memory(_mutable_data_size, OOM_MALLOC_ERROR, "codebuffer: no space for mutable data");
-    }
-  } else {
-    _mutable_data = blob_end(); // default value
-  }
-  if (_relocation_size > 0) {
-    assert(_mutable_data_size > 0, "relocation is part of mutable data section");
-    memcpy((address)relocation_begin(), reloc_data, relocation_size());
-  }
-}
-
 void CodeBlob::purge() {
   assert(_mutable_data != nullptr, "should never be null");
   if (_mutable_data != blob_end()) {
@@ -240,6 +225,23 @@ void CodeBlob::print_code_on(outputStream* st) {
   Disassembler::decode(this, st);
 }
 
+#if INCLUDE_CDS
+void CodeBlob::restore_mutable_data(address reloc_data) {
+  // Relocation data is now stored as part of the mutable data area; allocate it before copy relocations
+  if (_mutable_data_size > 0) {
+    _mutable_data = (address)os::malloc(_mutable_data_size, mtCode);
+    if (_mutable_data == nullptr) {
+      vm_exit_out_of_memory(_mutable_data_size, OOM_MALLOC_ERROR, "codebuffer: no space for mutable data");
+    }
+  } else {
+    _mutable_data = blob_end(); // default value
+  }
+  if (_relocation_size > 0) {
+    assert(_mutable_data_size > 0, "relocation is part of mutable data section");
+    memcpy((address)relocation_begin(), reloc_data, relocation_size());
+  }
+}
+
 void CodeBlob::prepare_for_archiving_impl() {
   set_name(nullptr);
   _oop_maps = nullptr;
@@ -269,24 +271,15 @@ void CodeBlob::post_restore() {
   vptr(_kind)->post_restore(this);
 }
 
-CodeBlob* CodeBlob::restore(address code_cache_buffer,
-                            const char* name,
-                            address archived_reloc_data,
-                            ImmutableOopMapSet* archived_oop_maps)
+CodeBlob* CodeBlob::restore(address code_cache_buffer, AOTCodeReader* reader)
 {
   copy_to(code_cache_buffer);
   CodeBlob* code_blob = (CodeBlob*)code_cache_buffer;
-  code_blob->set_name(name);
-  code_blob->restore_mutable_data(archived_reloc_data);
-  code_blob->set_oop_maps(archived_oop_maps);
+  reader->restore(code_blob);
   return code_blob;
 }
 
-CodeBlob* CodeBlob::create(CodeBlob* archived_blob,
-                           const char* name,
-                           address archived_reloc_data,
-                           ImmutableOopMapSet* archived_oop_maps
-                          )
+CodeBlob* CodeBlob::create(CodeBlob* archived_blob, AOTCodeReader* reader)
 {
   ThreadInVMfromUnknown __tiv;  // get to VM state in case we block on CodeCache_lock
 
@@ -298,10 +291,7 @@ CodeBlob* CodeBlob::create(CodeBlob* archived_blob,
     MutexLocker mu(CodeCache_lock, Mutex::_no_safepoint_check_flag);
     address code_cache_buffer = (address)CodeCache::allocate(size, CodeBlobType::NonNMethod);
     if (code_cache_buffer != nullptr) {
-      blob = archived_blob->restore(code_cache_buffer,
-                                    name,
-                                    archived_reloc_data,
-                                    archived_oop_maps);
+      blob = archived_blob->restore(code_cache_buffer, reader);
       assert(blob != nullptr, "sanity check");
 
       // Flush the code block
@@ -315,6 +305,8 @@ CodeBlob* CodeBlob::create(CodeBlob* archived_blob,
   return blob;
 }
 
+#endif // INCLUDE_CDS
+
 //-----------------------------------------------------------------------------------------
 // Creates a RuntimeBlob from a CodeBuffer and copy code and relocation info.
 
diff --git a/src/hotspot/share/code/codeBlob.hpp b/src/hotspot/share/code/codeBlob.hpp
index 0469b6c71b1..1f9cf0adcc3 100644
--- a/src/hotspot/share/code/codeBlob.hpp
+++ b/src/hotspot/share/code/codeBlob.hpp
@@ -34,6 +34,7 @@
 #include "utilities/align.hpp"
 #include "utilities/macros.hpp"
 
+class AOTCodeReader;
 class ImmutableOopMap;
 class ImmutableOopMapSet;
 class JNIHandleBlock;
@@ -107,9 +108,6 @@ class CodeBlob {
   friend class VMStructs;
   friend class JVMCIVMStructs;
 
-private:
-  void restore_mutable_data(address reloc_data);
-
 protected:
   // order fields from large to small to minimize padding between fields
   ImmutableOopMapSet* _oop_maps;   // OopMap for this CodeBlob
@@ -169,8 +167,8 @@ protected:
 
   void operator delete(void* p) { }
 
-  void prepare_for_archiving_impl();
-  void post_restore_impl();
+  void prepare_for_archiving_impl() NOT_CDS_RETURN;
+  void post_restore_impl() NOT_CDS_RETURN;
 
 public:
 
@@ -304,6 +302,9 @@ public:
   void use_strings(DbgStrings &strings) { _dbg_strings.share(strings); }
 #endif
 
+#if INCLUDE_CDS
+  void restore_mutable_data(address reloc_data);
+
   void copy_to(address buffer) {
     memcpy(buffer, this, this->size());
   }
@@ -314,11 +315,9 @@ public:
 
   // methods to restore a blob from AOT code cache into the CodeCache
   void post_restore();
-  CodeBlob* restore(address code_cache_buffer, const char* name, address archived_reloc_data, ImmutableOopMapSet* archived_oop_maps);
-  static CodeBlob* create(CodeBlob* archived_blob,
-                          const char* name,
-                          address archived_reloc_data,
-                          ImmutableOopMapSet* archived_oop_maps);
+  CodeBlob* restore(address code_cache_buffer, AOTCodeReader* reader);
+  static CodeBlob* create(CodeBlob* archived_blob, AOTCodeReader* reader);
+#endif
 };
 
 //----------------------------------------------------------------------------------------------------

From 28e96d76b0c7a792cc88bb9183e9cb6a83fcaba2 Mon Sep 17 00:00:00 2001
From: William Kemper <wkemper@openjdk.org>
Date: Fri, 27 Mar 2026 17:57:30 +0000
Subject: [PATCH 391/655] 8377976: GenShen: Explicit GC requests must clear
 concurrent gc request cancellation

Reviewed-by: kdnilsen
---
 .../shenandoah/shenandoahGenerationalControlThread.cpp   | 9 +++++----
 1 file changed, 5 insertions(+), 4 deletions(-)

diff --git a/src/hotspot/share/gc/shenandoah/shenandoahGenerationalControlThread.cpp b/src/hotspot/share/gc/shenandoah/shenandoahGenerationalControlThread.cpp
index ec33e671053..064f43ffd6b 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahGenerationalControlThread.cpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahGenerationalControlThread.cpp
@@ -121,10 +121,11 @@ void ShenandoahGenerationalControlThread::check_for_request(ShenandoahGCRequest&
       assert(request.generation != nullptr, "Must know which generation to use for degenerated cycle");
     }
   } else {
-    if (request.cause == GCCause::_shenandoah_concurrent_gc) {
-      // This is a regulator request. It is also possible that the regulator "canceled" an old mark,
-      // so we can clear that here. This clear operation will only clear the cancellation if it is
-      // a regulator request.
+    if (request.cause == GCCause::_shenandoah_concurrent_gc || ShenandoahCollectorPolicy::is_explicit_gc(request.cause)) {
+      // This is a regulator request or an explicit gc request. Note that an explicit gc request is allowed to
+      // "upgrade" a regulator request. It is possible that the regulator "canceled" an old mark, so we must
+      // clear that cancellation here or the explicit gc cycle will erroneously detect it as a cancellation.
+      // This clear operation will only clear the cancellation if it was set by regulator request.
       _heap->clear_cancellation(GCCause::_shenandoah_concurrent_gc);
     }
     request.generation = _requested_generation;

From 79668b007db71921938d7639ba15f8ce44682f4f Mon Sep 17 00:00:00 2001
From: Vladimir Kozlov <kvn@openjdk.org>
Date: Fri, 27 Mar 2026 18:13:38 +0000
Subject: [PATCH 392/655] 8380710: nmethod::finalize_relocations() should be
 called before ICache::invalidate_range() is called

Reviewed-by: adinn, dlong
---
 src/hotspot/share/asm/codeBuffer.cpp | 4 ----
 src/hotspot/share/code/codeBlob.cpp  | 4 ++++
 src/hotspot/share/code/nmethod.cpp   | 6 ++++--
 3 files changed, 8 insertions(+), 6 deletions(-)

diff --git a/src/hotspot/share/asm/codeBuffer.cpp b/src/hotspot/share/asm/codeBuffer.cpp
index ba525588f32..c6078c0ceee 100644
--- a/src/hotspot/share/asm/codeBuffer.cpp
+++ b/src/hotspot/share/asm/codeBuffer.cpp
@@ -32,7 +32,6 @@
 #include "oops/methodCounters.hpp"
 #include "oops/methodData.hpp"
 #include "oops/oop.inline.hpp"
-#include "runtime/icache.hpp"
 #include "runtime/safepointVerifiers.hpp"
 #include "utilities/align.hpp"
 #include "utilities/copy.hpp"
@@ -745,9 +744,6 @@ void CodeBuffer::copy_code_to(CodeBlob* dest_blob) {
 
   // Done moving code bytes; were they the right size?
   assert((int)align_up(dest.total_content_size(), oopSize) == dest_blob->content_size(), "sanity");
-
-  // Flush generated code
-  ICache::invalidate_range(dest_blob->code_begin(), dest_blob->code_size());
 }
 
 // Move all my code into another code buffer.  Consult applicable
diff --git a/src/hotspot/share/code/codeBlob.cpp b/src/hotspot/share/code/codeBlob.cpp
index 5b68ce48c87..9961381c31d 100644
--- a/src/hotspot/share/code/codeBlob.cpp
+++ b/src/hotspot/share/code/codeBlob.cpp
@@ -40,6 +40,7 @@
 #include "prims/forte.hpp"
 #include "prims/jvmtiExport.hpp"
 #include "runtime/handles.inline.hpp"
+#include "runtime/icache.hpp"
 #include "runtime/interfaceSupport.inline.hpp"
 #include "runtime/javaFrameAnchor.hpp"
 #include "runtime/jniHandles.inline.hpp"
@@ -324,6 +325,9 @@ RuntimeBlob::RuntimeBlob(
              align_up(cb->total_relocation_size(), oopSize))
 {
   cb->copy_code_and_locs_to(this);
+
+  // Flush generated code
+  ICache::invalidate_range(code_begin(), code_size());
 }
 
 void RuntimeBlob::free(RuntimeBlob* blob) {
diff --git a/src/hotspot/share/code/nmethod.cpp b/src/hotspot/share/code/nmethod.cpp
index 5a6ed8ab3ed..0e2aa208854 100644
--- a/src/hotspot/share/code/nmethod.cpp
+++ b/src/hotspot/share/code/nmethod.cpp
@@ -66,6 +66,7 @@
 #include "runtime/flags/flagSetting.hpp"
 #include "runtime/frame.inline.hpp"
 #include "runtime/handles.inline.hpp"
+#include "runtime/icache.hpp"
 #include "runtime/jniHandles.inline.hpp"
 #include "runtime/orderAccess.hpp"
 #include "runtime/os.hpp"
@@ -1253,6 +1254,9 @@ void nmethod::post_init() {
 
   finalize_relocations();
 
+  // Flush generated code
+  ICache::invalidate_range(code_begin(), code_size());
+
   Universe::heap()->register_nmethod(this);
   DEBUG_ONLY(Universe::heap()->verify_nmethod(this));
 
@@ -1584,8 +1588,6 @@ nmethod* nmethod::relocate(CodeBlobType code_blob_type) {
 
     // Attempt to start using the copy
     if (nm_copy->make_in_use()) {
-      ICache::invalidate_range(nm_copy->code_begin(), nm_copy->code_size());
-
       methodHandle mh(Thread::current(), nm_copy->method());
       nm_copy->method()->set_code(mh, nm_copy);
 

From 7ffc4a4fb4cc520c4f469865645764045e72cb26 Mon Sep 17 00:00:00 2001
From: Phil Race <prr@openjdk.org>
Date: Fri, 27 Mar 2026 19:23:39 +0000
Subject: [PATCH 393/655] 8381019: Remove AppContext usage from AccessBridge

Reviewed-by: serb, kizune
---
 .../accessibility/AccessibleContext.java      | 19 +---
 .../share/classes/module-info.java            |  3 +-
 .../share/classes/sun/awt/AWTAccessor.java    |  2 -
 .../accessibility/internal/AccessBridge.java  | 89 +++----------------
 4 files changed, 13 insertions(+), 100 deletions(-)

diff --git a/src/java.desktop/share/classes/javax/accessibility/AccessibleContext.java b/src/java.desktop/share/classes/javax/accessibility/AccessibleContext.java
index 096ca3aef44..e7fc58b0825 100644
--- a/src/java.desktop/share/classes/javax/accessibility/AccessibleContext.java
+++ b/src/java.desktop/share/classes/javax/accessibility/AccessibleContext.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1997, 2020, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -34,7 +34,6 @@ import java.beans.PropertyChangeSupport;
 import java.util.Locale;
 
 import sun.awt.AWTAccessor;
-import sun.awt.AppContext;
 
 /**
  * {@code AccessibleContext} represents the minimum information all accessible
@@ -84,24 +83,8 @@ public abstract class AccessibleContext {
      */
     protected AccessibleContext() {}
 
-    /**
-     * The {@code AppContext} that should be used to dispatch events for this
-     * {@code AccessibleContext}.
-     */
-    private volatile AppContext targetAppContext;
-
     static {
         AWTAccessor.setAccessibleContextAccessor(new AWTAccessor.AccessibleContextAccessor() {
-            @Override
-            public void setAppContext(AccessibleContext accessibleContext, AppContext appContext) {
-                accessibleContext.targetAppContext = appContext;
-            }
-
-            @Override
-            public AppContext getAppContext(AccessibleContext accessibleContext) {
-                return accessibleContext.targetAppContext;
-            }
-
             @Override
             public Object getNativeAXResource(AccessibleContext accessibleContext) {
                 return accessibleContext.nativeAXResource;
diff --git a/src/java.desktop/share/classes/module-info.java b/src/java.desktop/share/classes/module-info.java
index 6d34d934194..57392f71321 100644
--- a/src/java.desktop/share/classes/module-info.java
+++ b/src/java.desktop/share/classes/module-info.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2014, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2014, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -115,7 +115,6 @@ module java.desktop {
     // qualified exports may be inserted at build time
     // see make/GensrcModuleInfo.gmk
     exports sun.awt to
-        jdk.accessibility,
         jdk.unsupported.desktop;
 
     exports java.awt.dnd.peer to jdk.unsupported.desktop;
diff --git a/src/java.desktop/share/classes/sun/awt/AWTAccessor.java b/src/java.desktop/share/classes/sun/awt/AWTAccessor.java
index f98118171b4..143d7e6198c 100644
--- a/src/java.desktop/share/classes/sun/awt/AWTAccessor.java
+++ b/src/java.desktop/share/classes/sun/awt/AWTAccessor.java
@@ -755,8 +755,6 @@ public final class AWTAccessor {
      * An accessor object for the AccessibleContext class
      */
     public interface AccessibleContextAccessor {
-        void setAppContext(AccessibleContext accessibleContext, AppContext appContext);
-        AppContext getAppContext(AccessibleContext accessibleContext);
         Object getNativeAXResource(AccessibleContext accessibleContext);
         void setNativeAXResource(AccessibleContext accessibleContext, Object value);
     }
diff --git a/src/jdk.accessibility/windows/classes/com/sun/java/accessibility/internal/AccessBridge.java b/src/jdk.accessibility/windows/classes/com/sun/java/accessibility/internal/AccessBridge.java
index c932d0f73ff..718acf6a6b8 100644
--- a/src/jdk.accessibility/windows/classes/com/sun/java/accessibility/internal/AccessBridge.java
+++ b/src/jdk.accessibility/windows/classes/com/sun/java/accessibility/internal/AccessBridge.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2005, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2005, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -120,9 +120,6 @@ import com.sun.java.accessibility.util.AccessibilityEventMonitor;
 import com.sun.java.accessibility.util.EventQueueMonitor;
 import com.sun.java.accessibility.util.SwingEventMonitor;
 import com.sun.java.accessibility.util.Translator;
-import sun.awt.AWTAccessor;
-import sun.awt.AppContext;
-import sun.awt.SunToolkit;
 
 /*
  * Note: This class has to be public.  It's loaded from the VM like this:
@@ -5292,7 +5289,6 @@ public final class AccessBridge {
                         ac = a.getAccessibleContext();
                 }
                 if (ac != null) {
-                    InvocationUtils.registerAccessibleContext(ac, AppContext.getAppContext());
 
                     accessBridge.debugString("[INFO]: AccessibleContext: " + ac);
                     String propertyName = e.getPropertyName();
@@ -5385,11 +5381,9 @@ public final class AccessBridge {
 
                         if (e.getOldValue() instanceof AccessibleContext) {
                             oldAC = (AccessibleContext) e.getOldValue();
-                            InvocationUtils.registerAccessibleContext(oldAC, AppContext.getAppContext());
                         }
                         if (e.getNewValue() instanceof AccessibleContext) {
                             newAC = (AccessibleContext) e.getNewValue();
-                            InvocationUtils.registerAccessibleContext(newAC, AppContext.getAppContext());
                         }
                         accessBridge.debugString("[INFO]:  - about to call propertyChildChange()   old AC: " + oldAC + "new AC: " + newAC);
                         accessBridge.propertyChildChange(e, ac, oldAC, newAC);
@@ -5455,8 +5449,6 @@ public final class AccessBridge {
             prevAC = newAC;
 
             accessBridge.debugString("[INFO]:   - about to call propertyActiveDescendentChange()   AC: " + ac + "   old AC: " + oldAC + "new AC: " + newAC);
-            InvocationUtils.registerAccessibleContext(oldAC, AppContext.getAppContext());
-            InvocationUtils.registerAccessibleContext(newAC, AppContext.getAppContext());
             accessBridge.propertyActiveDescendentChange(e, ac, oldAC, newAC);
         }
 
@@ -5493,14 +5485,12 @@ public final class AccessBridge {
                         // selected. The menu itself is selected.
                         FocusEvent e = new FocusEvent(penult, FocusEvent.FOCUS_GAINED);
                         AccessibleContext context = penult.getAccessibleContext();
-                        InvocationUtils.registerAccessibleContext(context, SunToolkit.targetToAppContext(penult));
                         accessBridge.focusGained(e, context);
                     } else if (penult instanceof JPopupMenu) {
                         // This is a popup with an item selected
                         FocusEvent e =
                         new FocusEvent(last, FocusEvent.FOCUS_GAINED);
                         AccessibleContext focusedAC = last.getAccessibleContext();
-                        InvocationUtils.registerAccessibleContext(focusedAC, SunToolkit.targetToAppContext(last));
                         accessBridge.debugString("[INFO]:  - about to call focusGained()   AC: " + focusedAC);
                         accessBridge.focusGained(e, focusedAC);
                     }
@@ -5511,7 +5501,6 @@ public final class AccessBridge {
                     FocusEvent e = new FocusEvent(focusOwner,
                                                   FocusEvent.FOCUS_GAINED);
                     AccessibleContext focusedAC = focusOwner.getAccessibleContext();
-                    InvocationUtils.registerAccessibleContext(focusedAC, SunToolkit.targetToAppContext(focusOwner));
                     accessBridge.debugString("[INFO]:  - about to call focusGained()   AC: " + focusedAC);
                     accessBridge.focusGained(e, focusedAC);
                 }
@@ -5524,7 +5513,6 @@ public final class AccessBridge {
                 if (a != null) {
                     accessBridge.debugString("[INFO]:  - about to call focusLost()   AC: " + a.getAccessibleContext());
                     AccessibleContext context = a.getAccessibleContext();
-                    InvocationUtils.registerAccessibleContext(context, AppContext.getAppContext());
                     accessBridge.focusLost(e, context);
                 }
             }
@@ -5538,7 +5526,6 @@ public final class AccessBridge {
                 Accessible a = Translator.getAccessible(e.getSource());
                 if (a != null) {
                     AccessibleContext context = a.getAccessibleContext();
-                    InvocationUtils.registerAccessibleContext(context, AppContext.getAppContext());
                     accessBridge.caretUpdate(e, context);
                 }
             }
@@ -5553,7 +5540,6 @@ public final class AccessBridge {
                 Accessible a = Translator.getAccessible(e.getSource());
                 if (a != null) {
                     AccessibleContext context = a.getAccessibleContext();
-                    InvocationUtils.registerAccessibleContext(context, AppContext.getAppContext());
                     accessBridge.mouseClicked(e, context);
                 }
             }
@@ -5564,7 +5550,6 @@ public final class AccessBridge {
                 Accessible a = Translator.getAccessible(e.getSource());
                 if (a != null) {
                     AccessibleContext context = a.getAccessibleContext();
-                    InvocationUtils.registerAccessibleContext(context, AppContext.getAppContext());
                     accessBridge.mouseEntered(e, context);
                 }
             }
@@ -5575,7 +5560,6 @@ public final class AccessBridge {
                 Accessible a = Translator.getAccessible(e.getSource());
                 if (a != null) {
                     AccessibleContext context = a.getAccessibleContext();
-                    InvocationUtils.registerAccessibleContext(context, AppContext.getAppContext());
                     accessBridge.mouseExited(e, context);
                 }
             }
@@ -5586,7 +5570,6 @@ public final class AccessBridge {
                 Accessible a = Translator.getAccessible(e.getSource());
                 if (a != null) {
                     AccessibleContext context = a.getAccessibleContext();
-                    InvocationUtils.registerAccessibleContext(context, AppContext.getAppContext());
                     accessBridge.mousePressed(e, context);
                 }
             }
@@ -5597,7 +5580,6 @@ public final class AccessBridge {
                 Accessible a = Translator.getAccessible(e.getSource());
                 if (a != null) {
                     AccessibleContext context = a.getAccessibleContext();
-                    InvocationUtils.registerAccessibleContext(context, AppContext.getAppContext());
                     accessBridge.mouseReleased(e, context);
                 }
             }
@@ -5611,7 +5593,6 @@ public final class AccessBridge {
                 Accessible a = Translator.getAccessible(e.getSource());
                 if (a != null) {
                     AccessibleContext context = a.getAccessibleContext();
-                    InvocationUtils.registerAccessibleContext(context, AppContext.getAppContext());
                     accessBridge.menuCanceled(e, context);
                 }
             }
@@ -5622,7 +5603,6 @@ public final class AccessBridge {
                 Accessible a = Translator.getAccessible(e.getSource());
                 if (a != null) {
                     AccessibleContext context = a.getAccessibleContext();
-                    InvocationUtils.registerAccessibleContext(context, AppContext.getAppContext());
                     accessBridge.menuDeselected(e, context);
                 }
             }
@@ -5633,7 +5613,6 @@ public final class AccessBridge {
                 Accessible a = Translator.getAccessible(e.getSource());
                 if (a != null) {
                     AccessibleContext context = a.getAccessibleContext();
-                    InvocationUtils.registerAccessibleContext(context, AppContext.getAppContext());
                     accessBridge.menuSelected(e, context);
                 }
             }
@@ -5644,7 +5623,6 @@ public final class AccessBridge {
                 Accessible a = Translator.getAccessible(e.getSource());
                 if (a != null) {
                     AccessibleContext context = a.getAccessibleContext();
-                    InvocationUtils.registerAccessibleContext(context, AppContext.getAppContext());
                     accessBridge.popupMenuCanceled(e, context);
                 }
             }
@@ -5655,7 +5633,6 @@ public final class AccessBridge {
                 Accessible a = Translator.getAccessible(e.getSource());
                 if (a != null) {
                     AccessibleContext context = a.getAccessibleContext();
-                    InvocationUtils.registerAccessibleContext(context, AppContext.getAppContext());
                     accessBridge.popupMenuWillBecomeInvisible(e, context);
                 }
             }
@@ -5666,7 +5643,6 @@ public final class AccessBridge {
                 Accessible a = Translator.getAccessible(e.getSource());
                 if (a != null) {
                     AccessibleContext context = a.getAccessibleContext();
-                    InvocationUtils.registerAccessibleContext(context, AppContext.getAppContext());
                     accessBridge.popupMenuWillBecomeVisible(e, context);
                 }
             }
@@ -7227,8 +7203,7 @@ public final class AccessBridge {
     private static class InvocationUtils {
 
         /**
-         * Invokes a {@code Callable} in the {@code AppContext} of the given {@code Accessible}
-         * and waits for it to finish blocking the caller thread.
+         * Invokes a {@code Callable} and waits for it to finish blocking the caller thread.
          *
          * @param callable   the {@code Callable} to invoke
          * @param accessibleTable the {@code AccessibleExtendedTable} which would be used to find the right context
@@ -7246,8 +7221,7 @@ public final class AccessBridge {
         }
 
         /**
-         * Invokes a {@code Callable} in the {@code AppContext} of the given {@code Accessible}
-         * and waits for it to finish blocking the caller thread.
+         * Invokes a {@code Callable} and waits for it to finish blocking the caller thread.
          *
          * @param callable   the {@code Callable} to invoke
          * @param accessible the {@code Accessible} which would be used to find the right context
@@ -7269,8 +7243,7 @@ public final class AccessBridge {
         }
 
         /**
-         * Invokes a {@code Callable} in the {@code AppContext} of the given {@code Component}
-         * and waits for it to finish blocking the caller thread.
+         * Invokes a {@code Callable} and waits for it to finish blocking the caller thread.
          *
          * @param callable  the {@code Callable} to invoke
          * @param component the {@code Component} which would be used to find the right context
@@ -7281,12 +7254,11 @@ public final class AccessBridge {
          */
         public static <T> T invokeAndWait(final Callable<T> callable,
                                           final Component component) {
-            return invokeAndWait(callable, SunToolkit.targetToAppContext(component));
+            return invokeAndWait(callable);
         }
 
         /**
-         * Invokes a {@code Callable} in the {@code AppContext} mapped to the given {@code AccessibleContext}
-         * and waits for it to finish blocking the caller thread.
+         * Invokes a {@code Callable} and waits for it to finish blocking the caller thread.
          *
          * @param callable the {@code Callable} to invoke
          * @param accessibleContext the {@code AccessibleContext} which would be used to determine the right
@@ -7297,45 +7269,26 @@ public final class AccessBridge {
          */
         public static <T> T invokeAndWait(final Callable<T> callable,
                                           final AccessibleContext accessibleContext) {
-            AppContext targetContext = AWTAccessor.getAccessibleContextAccessor()
-                    .getAppContext(accessibleContext);
-            if (targetContext != null) {
-                return invokeAndWait(callable, targetContext);
-            } else {
-                // Normally this should not happen, unmapped context provided and
-                // the target AppContext is unknown.
-
-                // Try to recover in case the context is a translator.
-                if (accessibleContext instanceof Translator) {
-                    Object source = ((Translator)accessibleContext).getSource();
-                    if (source instanceof Component) {
-                        return invokeAndWait(callable, (Component)source);
-                    }
-                }
-            }
-            throw new RuntimeException("Unmapped AccessibleContext used to dispatch event: " + accessibleContext);
+            return invokeAndWait(callable);
         }
 
-        private static <T> T invokeAndWait(final Callable<T> callable,
-                                           final AppContext targetAppContext) {
+        private static <T> T invokeAndWait(final Callable<T> callable) {
             final CallableWrapper<T> wrapper = new CallableWrapper<T>(callable);
             try {
-                invokeAndWait(wrapper, targetAppContext);
+                invokeAndWait(wrapper);
                 T result = wrapper.getResult();
-                updateAppContextMap(result, targetAppContext);
                 return result;
             } catch (final Exception e) {
                 throw new RuntimeException(e);
             }
         }
 
-        private static void invokeAndWait(final Runnable runnable,
-                                        final AppContext appContext)
+        private static void invokeAndWait(final Runnable runnable)
                 throws InterruptedException, InvocationTargetException {
 
-            EventQueue eq = SunToolkit.getSystemEventQueueImplPP(appContext);
             Object lock = new Object();
             Toolkit source = Toolkit.getDefaultToolkit();
+            EventQueue eq = source.getSystemEventQueue();
             InvocationEvent event =
                     new InvocationEvent(source, runnable, lock, true);
             synchronized (lock) {
@@ -7349,26 +7302,6 @@ public final class AccessBridge {
             }
         }
 
-        /**
-         * Maps the {@code AccessibleContext} to the {@code AppContext} which should be used
-         * to dispatch events related to the {@code AccessibleContext}
-         * @param accessibleContext the {@code AccessibleContext} for the mapping
-         * @param targetContext the {@code AppContext} for the mapping
-         */
-        public static void registerAccessibleContext(final AccessibleContext accessibleContext,
-                                                     final AppContext targetContext) {
-            if (accessibleContext != null) {
-                AWTAccessor.getAccessibleContextAccessor().setAppContext(accessibleContext, targetContext);
-            }
-        }
-
-        private static <T> void updateAppContextMap(final T accessibleContext,
-                                                    final AppContext targetContext) {
-            if (accessibleContext instanceof AccessibleContext) {
-                registerAccessibleContext((AccessibleContext)accessibleContext, targetContext);
-            }
-        }
-
         private static class CallableWrapper<T> implements Runnable {
             private final Callable<T> callable;
             private volatile T object;

From 7e4ac140d9faad938bda3e60a00cc5e8ed0fe7d7 Mon Sep 17 00:00:00 2001
From: Coleen Phillimore <coleenp@openjdk.org>
Date: Fri, 27 Mar 2026 19:55:32 +0000
Subject: [PATCH 394/655] 8380686: GenerateOopMap logging crashes in rewriter

Reviewed-by: matsaave, phubner
---
 .../share/interpreter/bytecodeTracer.cpp      | 30 +++++++------
 .../jtreg/runtime/interpreter/JsrLogging.jasm | 43 +++++++++++++++++++
 .../runtime/interpreter/JsrLoggingTest.java   | 40 +++++++++++++++++
 3 files changed, 99 insertions(+), 14 deletions(-)
 create mode 100644 test/hotspot/jtreg/runtime/interpreter/JsrLogging.jasm
 create mode 100644 test/hotspot/jtreg/runtime/interpreter/JsrLoggingTest.java

diff --git a/src/hotspot/share/interpreter/bytecodeTracer.cpp b/src/hotspot/share/interpreter/bytecodeTracer.cpp
index 2610a8a2bd6..4578a3eec4e 100644
--- a/src/hotspot/share/interpreter/bytecodeTracer.cpp
+++ b/src/hotspot/share/interpreter/bytecodeTracer.cpp
@@ -52,9 +52,9 @@ class BytecodePrinter {
   Bytecodes::Code _code;
   address   _next_pc;                // current decoding position
   int       _flags;
-  bool      _is_linked;
+  bool      _use_cp_cache;
 
-  bool      is_linked() const        { return _is_linked; }
+  bool      use_cp_cache() const        { return _use_cp_cache; }
   void      align()                  { _next_pc = align_up(_next_pc, sizeof(jint)); }
   int       get_byte()               { return *(jbyte*) _next_pc++; }  // signed
   int       get_index_u1()           { return *(address)_next_pc++; }  // returns 0x00 - 0xff as an int
@@ -69,7 +69,7 @@ class BytecodePrinter {
   bool      is_wide() const          { return _is_wide; }
   Bytecodes::Code raw_code() const   { return Bytecodes::Code(_code); }
   ConstantPool* constants() const    { return method()->constants(); }
-  ConstantPoolCache* cpcache() const { assert(is_linked(), "must be"); return constants()->cache(); }
+  ConstantPoolCache* cpcache() const { assert(use_cp_cache(), "must be"); return constants()->cache(); }
 
   void      print_constant(int i, outputStream* st);
   void      print_cpcache_entry(int cpc_index, outputStream* st);
@@ -94,8 +94,9 @@ class BytecodePrinter {
     ResourceMark rm;
     bool method_changed = _current_method != method();
     _current_method = method();
-    _is_linked = method->method_holder()->is_linked();
-    assert(_is_linked, "this function must be called on methods that are already executing");
+    _use_cp_cache = method->constants()->cache() != nullptr;
+    assert(method->method_holder()->is_linked(),
+           "this function must be called on methods that are already executing");
 
     if (method_changed) {
       // Note 1: This code will not work as expected with true MT/MP.
@@ -150,7 +151,8 @@ class BytecodePrinter {
   // BytecodeStream, which will skip wide bytecodes.
   void trace(const methodHandle& method, address bcp, outputStream* st) {
     _current_method = method();
-    _is_linked = method->method_holder()->is_linked();
+    // This may be called during linking after bytecodes are rewritten to point to the cpCache.
+    _use_cp_cache = method->constants()->cache() != nullptr;
     ResourceMark rm;
     Bytecodes::Code code = Bytecodes::code_at(method(), bcp);
     // Set is_wide
@@ -301,7 +303,7 @@ void BytecodePrinter::print_invokedynamic(int indy_index, int cp_index, outputSt
   if (ClassPrinter::has_mode(_flags, ClassPrinter::PRINT_DYNAMIC)) {
     print_bsm(cp_index, st);
 
-    if (is_linked()) {
+    if (use_cp_cache()) {
       ResolvedIndyEntry* indy_entry = constants()->resolved_indy_entry_at(indy_index);
       st->print("  ResolvedIndyEntry: ");
       indy_entry->print_on(st);
@@ -365,7 +367,7 @@ void BytecodePrinter::print_attributes(int bci, outputStream* st) {
       {
         int cp_index;
         if (Bytecodes::uses_cp_cache(raw_code())) {
-          assert(is_linked(), "fast ldc bytecode must be in linked classes");
+          assert(use_cp_cache(), "fast ldc bytecode must be in linked classes");
           int obj_index = get_index_u1();
           cp_index = constants()->object_to_cp_index(obj_index);
         } else {
@@ -380,7 +382,7 @@ void BytecodePrinter::print_attributes(int bci, outputStream* st) {
       {
         int cp_index;
         if (Bytecodes::uses_cp_cache(raw_code())) {
-          assert(is_linked(), "fast ldc bytecode must be in linked classes");
+          assert(use_cp_cache(), "fast ldc bytecode must be in linked classes");
           int obj_index = get_native_index_u2();
           cp_index = constants()->object_to_cp_index(obj_index);
         } else {
@@ -510,7 +512,7 @@ void BytecodePrinter::print_attributes(int bci, outputStream* st) {
     case Bytecodes::_getfield:
       {
         int cp_index;
-        if (is_linked()) {
+        if (use_cp_cache()) {
           int field_index = get_native_index_u2();
           cp_index = cpcache()->resolved_field_entry_at(field_index)->constant_pool_index();
         } else {
@@ -525,7 +527,7 @@ void BytecodePrinter::print_attributes(int bci, outputStream* st) {
     case Bytecodes::_invokestatic:
       {
         int cp_index;
-        if (is_linked()) {
+        if (use_cp_cache()) {
           int method_index = get_native_index_u2();
           ResolvedMethodEntry* method_entry = cpcache()->resolved_method_entry_at(method_index);
           cp_index = method_entry->constant_pool_index();
@@ -533,7 +535,7 @@ void BytecodePrinter::print_attributes(int bci, outputStream* st) {
 
           if (raw_code() == Bytecodes::_invokehandle &&
               ClassPrinter::has_mode(_flags, ClassPrinter::PRINT_METHOD_HANDLE)) {
-            assert(is_linked(), "invokehandle is only in rewritten methods");
+            assert(use_cp_cache(), "invokehandle is only in rewritten methods");
             method_entry->print_on(st);
             if (method_entry->has_appendix()) {
               st->print("  appendix: ");
@@ -550,7 +552,7 @@ void BytecodePrinter::print_attributes(int bci, outputStream* st) {
     case Bytecodes::_invokeinterface:
       {
         int cp_index;
-        if (is_linked()) {
+        if (use_cp_cache()) {
           int method_index = get_native_index_u2();
           cp_index = cpcache()->resolved_method_entry_at(method_index)->constant_pool_index();
         } else {
@@ -566,7 +568,7 @@ void BytecodePrinter::print_attributes(int bci, outputStream* st) {
       {
         int indy_index;
         int cp_index;
-        if (is_linked()) {
+        if (use_cp_cache()) {
           indy_index = get_native_index_u4();
           cp_index = constants()->resolved_indy_entry_at(indy_index)->constant_pool_index();
         } else {
diff --git a/test/hotspot/jtreg/runtime/interpreter/JsrLogging.jasm b/test/hotspot/jtreg/runtime/interpreter/JsrLogging.jasm
new file mode 100644
index 00000000000..ac1d0fffa49
--- /dev/null
+++ b/test/hotspot/jtreg/runtime/interpreter/JsrLogging.jasm
@@ -0,0 +1,43 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ *
+ */
+
+public super class JsrLogging version 49:0
+{
+    static Field i:I;
+
+    public static Method test:"()V"
+    stack 3 locals 1
+    {
+        nop;
+        jsr LABEL;
+        bipush            66;
+    LABEL:
+        bipush            55;
+        putstatic         Field i:"I";
+        getstatic         Field java/lang/System.out:"Ljava/io/PrintStream;";
+        ldc               String "hello";
+        invokevirtual     Method java/io/PrintStream.println:"(Ljava/lang/String;)V";
+        return;
+    }
+}
diff --git a/test/hotspot/jtreg/runtime/interpreter/JsrLoggingTest.java b/test/hotspot/jtreg/runtime/interpreter/JsrLoggingTest.java
new file mode 100644
index 00000000000..36a8f7e9b76
--- /dev/null
+++ b/test/hotspot/jtreg/runtime/interpreter/JsrLoggingTest.java
@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+/*
+ * @test
+ * @bug 8380686
+ * @summary Ensure logging works while processing jsr while linking.
+ * @library /test/lib
+ * @compile JsrLogging.jasm
+ * @run main/othervm -Xlog:generateoopmap=debug JsrLoggingTest
+ */
+
+public class JsrLoggingTest {
+    public static void main(String[] args) {
+        for (int i = 0; i < 10; ++i) {
+            JsrLogging.test();
+        }
+        System.out.println("PASSED");
+    }
+}

From ac242550fea72a3c37e61014f5204f72e27e2cbd Mon Sep 17 00:00:00 2001
From: Jeremy Wood <jwood@openjdk.org>
Date: Sat, 28 Mar 2026 09:33:31 +0000
Subject: [PATCH 395/655] 8379347: VoiceOver Doesn't Correctly Identify
 JToggleButtons as "toggle buttons"

Reviewed-by: honkar, kizune, prr
---
 .../awt/a11y/CheckboxAccessibility.m          | 14 +++-
 .../awt/a11y/CommonComponentAccessibility.m   |  1 +
 .../8379347/VoiceOverToggleButtonRole.java    | 69 +++++++++++++++++++
 3 files changed, 83 insertions(+), 1 deletion(-)
 create mode 100644 test/jdk/javax/accessibility/8379347/VoiceOverToggleButtonRole.java

diff --git a/src/java.desktop/macosx/native/libawt_lwawt/awt/a11y/CheckboxAccessibility.m b/src/java.desktop/macosx/native/libawt_lwawt/awt/a11y/CheckboxAccessibility.m
index f2dbf60d92d..a5faf255440 100644
--- a/src/java.desktop/macosx/native/libawt_lwawt/awt/a11y/CheckboxAccessibility.m
+++ b/src/java.desktop/macosx/native/libawt_lwawt/awt/a11y/CheckboxAccessibility.m
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -36,6 +36,18 @@
     return NSAccessibilityCheckBoxRole;
 }
 
+- (NSAccessibilitySubrole _Nullable)accessibilitySubrole
+{
+    JNIEnv *env = [ThreadUtilities getJNIEnv];
+    if (env != NULL) {
+        NSString *javaRole = [self javaRole];
+        if ([javaRole isEqualToString:@"togglebutton"]) {
+            return NSAccessibilityToggleSubrole;
+        }
+    }
+    return [super accessibilitySubrole];
+}
+
 - (id _Nonnull) accessibilityValue
 {
     AWT_ASSERT_APPKIT_THREAD;
diff --git a/src/java.desktop/macosx/native/libawt_lwawt/awt/a11y/CommonComponentAccessibility.m b/src/java.desktop/macosx/native/libawt_lwawt/awt/a11y/CommonComponentAccessibility.m
index 0f0a395c597..45e8f981f50 100644
--- a/src/java.desktop/macosx/native/libawt_lwawt/awt/a11y/CommonComponentAccessibility.m
+++ b/src/java.desktop/macosx/native/libawt_lwawt/awt/a11y/CommonComponentAccessibility.m
@@ -136,6 +136,7 @@ static jobject sAccessibilityClass = NULL;
     [rolesMap setObject:@"StaticTextAccessibility" forKey:@"label"];
     [rolesMap setObject:@"RadiobuttonAccessibility" forKey:@"radiobutton"];
     [rolesMap setObject:@"CheckboxAccessibility" forKey:@"checkbox"];
+    [rolesMap setObject:@"CheckboxAccessibility" forKey:@"togglebutton"];
     [rolesMap setObject:@"SliderAccessibility" forKey:@"slider"];
     [rolesMap setObject:@"ScrollAreaAccessibility" forKey:@"scrollpane"];
     [rolesMap setObject:@"ScrollBarAccessibility" forKey:@"scrollbar"];
diff --git a/test/jdk/javax/accessibility/8379347/VoiceOverToggleButtonRole.java b/test/jdk/javax/accessibility/8379347/VoiceOverToggleButtonRole.java
new file mode 100644
index 00000000000..31264f69dd8
--- /dev/null
+++ b/test/jdk/javax/accessibility/8379347/VoiceOverToggleButtonRole.java
@@ -0,0 +1,69 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+import javax.swing.JToggleButton;
+import javax.swing.JFrame;
+
+/*
+ * @test
+ * @key headful
+ * @bug 8379347
+ * @summary manual test for VoiceOver reading JToggleButtons correctly
+ * @requires os.family == "mac"
+ * @library /java/awt/regtesthelpers
+ * @build PassFailJFrame
+ * @run main/manual VoiceOverToggleButtonRole
+ */
+
+public class VoiceOverToggleButtonRole {
+    public static void main(String[] args) throws Exception {
+        String INSTRUCTIONS = """
+                INSTRUCTIONS (Mac-only):
+                1. Open VoiceOver
+                2. Move the VoiceOver cursor over the JToggleButton.
+                3. Observe how VoiceOver identifies the toggle button.
+
+                Expected behavior: VoiceOver should identify it as a
+                "toggle button" initially. (VO does still say "to select
+                or deselect this checkbox", though.)
+
+                If you select the link using "Accessibility Inspector":
+                it should identify its subrole as AXToggle.
+                """;
+
+        PassFailJFrame.builder()
+                .title("VoiceOverToggleButtonRole Instruction")
+                .instructions(INSTRUCTIONS)
+                .columns(40)
+                .testUI(VoiceOverToggleButtonRole::createUI)
+                .build()
+                .awaitAndCheck();
+    }
+
+    private static JFrame createUI() {
+        JFrame frame = new JFrame();
+        frame.getContentPane().add(new JToggleButton("JToggleButton"));
+        frame.pack();
+        return frame;
+    }
+}

From 6520c95a79ee2e5a249827c49c75b0db48d63209 Mon Sep 17 00:00:00 2001
From: Andrew Dinn <adinn@openjdk.org>
Date: Sat, 28 Mar 2026 17:36:58 +0000
Subject: [PATCH 396/655] 8380771: Add missing CodeBlob Vptr implementations

Reviewed-by: kvn, asmehra
---
 src/hotspot/share/code/codeBlob.cpp | 30 +++++------
 src/hotspot/share/code/codeBlob.hpp | 77 +++++++++++++++++++++++++----
 2 files changed, 84 insertions(+), 23 deletions(-)

diff --git a/src/hotspot/share/code/codeBlob.cpp b/src/hotspot/share/code/codeBlob.cpp
index 9961381c31d..a7d939e590d 100644
--- a/src/hotspot/share/code/codeBlob.cpp
+++ b/src/hotspot/share/code/codeBlob.cpp
@@ -79,8 +79,10 @@ const BufferBlob::Vptr               BufferBlob::_vpntr;
 const RuntimeStub::Vptr              RuntimeStub::_vpntr;
 const SingletonBlob::Vptr            SingletonBlob::_vpntr;
 const DeoptimizationBlob::Vptr       DeoptimizationBlob::_vpntr;
+const SafepointBlob::Vptr            SafepointBlob::_vpntr;
 #ifdef COMPILER2
 const ExceptionBlob::Vptr            ExceptionBlob::_vpntr;
+const UncommonTrapBlob::Vptr         UncommonTrapBlob::_vpntr;
 #endif // COMPILER2
 const UpcallStub::Vptr               UpcallStub::_vpntr;
 
@@ -386,7 +388,7 @@ void RuntimeBlob::trace_new_stub(RuntimeBlob* stub, const char* name1, const cha
 // Implementation of BufferBlob
 
 BufferBlob::BufferBlob(const char* name, CodeBlobKind kind, int size, uint16_t header_size)
-: RuntimeBlob(name, kind, size, header_size)
+  : RuntimeBlob(name, kind, size, header_size)
 {}
 
 BufferBlob* BufferBlob::create(const char* name, uint buffer_size) {
@@ -621,8 +623,8 @@ DeoptimizationBlob::DeoptimizationBlob(
   int         unpack_with_reexecution_offset,
   int         frame_size
 )
-: SingletonBlob("DeoptimizationBlob", CodeBlobKind::Deoptimization, cb,
-                size, sizeof(DeoptimizationBlob), frame_size, oop_maps)
+  : SingletonBlob("DeoptimizationBlob", CodeBlobKind::Deoptimization, cb,
+                  size, sizeof(DeoptimizationBlob), frame_size, oop_maps)
 {
   _unpack_offset           = unpack_offset;
   _unpack_with_exception   = unpack_with_exception_offset;
@@ -671,8 +673,8 @@ UncommonTrapBlob::UncommonTrapBlob(
   OopMapSet*  oop_maps,
   int         frame_size
 )
-: SingletonBlob("UncommonTrapBlob", CodeBlobKind::UncommonTrap, cb,
-                size, sizeof(UncommonTrapBlob), frame_size, oop_maps)
+  : SingletonBlob("UncommonTrapBlob", CodeBlobKind::UncommonTrap, cb,
+                  size, sizeof(UncommonTrapBlob), frame_size, oop_maps)
 {}
 
 
@@ -703,8 +705,8 @@ ExceptionBlob::ExceptionBlob(
   OopMapSet*  oop_maps,
   int         frame_size
 )
-: SingletonBlob("ExceptionBlob", CodeBlobKind::Exception, cb,
-                size, sizeof(ExceptionBlob), frame_size, oop_maps)
+  : SingletonBlob("ExceptionBlob", CodeBlobKind::Exception, cb,
+                  size, sizeof(ExceptionBlob), frame_size, oop_maps)
 {}
 
 
@@ -737,8 +739,8 @@ SafepointBlob::SafepointBlob(
   OopMapSet*  oop_maps,
   int         frame_size
 )
-: SingletonBlob("SafepointBlob", CodeBlobKind::Safepoint, cb,
-                size, sizeof(SafepointBlob), frame_size, oop_maps)
+  : SingletonBlob(cb->name(), CodeBlobKind::Safepoint, cb,
+                  size, sizeof(SafepointBlob), frame_size, oop_maps)
 {}
 
 
@@ -755,7 +757,7 @@ SafepointBlob* SafepointBlob::create(
     blob = new (size) SafepointBlob(cb, size, oop_maps, frame_size);
   }
 
-  trace_new_stub(blob, "SafepointBlob");
+  trace_new_stub(blob, "SafepointBlob - ", blob->name());
 
   return blob;
 }
@@ -895,7 +897,7 @@ void CodeBlob::dump_for_addr(address addr, outputStream* st, bool verbose) const
     }
   }
   if (is_nmethod()) {
-    nmethod* nm = (nmethod*)this;
+    nmethod* nm = as_nmethod();
     ResourceMark rm;
     st->print(INTPTR_FORMAT " is at entry_point+%d in (nmethod*)" INTPTR_FORMAT,
               p2i(addr), (int)(addr - nm->entry_point()), p2i(nm));
@@ -931,7 +933,7 @@ void RuntimeStub::print_on_impl(outputStream* st) const {
   RuntimeBlob::print_on_impl(st);
   st->print("Runtime Stub (" INTPTR_FORMAT "): ", p2i(this));
   st->print_cr("%s", name());
-  Disassembler::decode((RuntimeBlob*)this, st);
+  Disassembler::decode((CodeBlob*)this, st);
 }
 
 void RuntimeStub::print_value_on_impl(outputStream* st) const {
@@ -942,7 +944,7 @@ void SingletonBlob::print_on_impl(outputStream* st) const {
   ttyLocker ttyl;
   RuntimeBlob::print_on_impl(st);
   st->print_cr("%s", name());
-  Disassembler::decode((RuntimeBlob*)this, st);
+  Disassembler::decode((CodeBlob*)this, st);
 }
 
 void SingletonBlob::print_value_on_impl(outputStream* st) const {
@@ -960,7 +962,7 @@ void UpcallStub::print_on_impl(outputStream* st) const {
   oop recv = JNIHandles::resolve(_receiver);
   st->print("Receiver MH=");
   recv->print_on(st);
-  Disassembler::decode((RuntimeBlob*)this, st);
+  Disassembler::decode((CodeBlob*)this, st);
 }
 
 void UpcallStub::print_value_on_impl(outputStream* st) const {
diff --git a/src/hotspot/share/code/codeBlob.hpp b/src/hotspot/share/code/codeBlob.hpp
index 1f9cf0adcc3..6a1686b80e2 100644
--- a/src/hotspot/share/code/codeBlob.hpp
+++ b/src/hotspot/share/code/codeBlob.hpp
@@ -98,7 +98,9 @@ enum class CodeBlobKind : u1 {
 class UpcallStub;      // for as_upcall_stub()
 class RuntimeStub;     // for as_runtime_stub()
 class JavaFrameAnchor; // for UpcallStub::jfa_for_frame
+class BufferBlob;
 class AdapterBlob;
+class SingletonBlob;
 class ExceptionBlob;
 class DeoptimizationBlob;
 class SafepointBlob;
@@ -185,8 +187,19 @@ public:
 
   // Typing
   bool is_nmethod() const                     { return _kind == CodeBlobKind::Nmethod; }
-  bool is_buffer_blob() const                 { return _kind == CodeBlobKind::Buffer; }
+  // we may want to check for an actual buffer blob or subtype instance
+  bool is_buffer_blob(bool strict=true) const {
+    if (strict) {
+      return _kind == CodeBlobKind::Buffer;
+    } else {
+      return (_kind == CodeBlobKind::Buffer ||
+              _kind == CodeBlobKind::Adapter ||
+              _kind == CodeBlobKind::Vtable ||
+              _kind == CodeBlobKind::MHAdapter);
+    }
+  }
   bool is_runtime_stub() const                { return _kind == CodeBlobKind::RuntimeStub; }
+  // singleton blobs are never directly implemented
   bool is_deoptimization_stub() const         { return _kind == CodeBlobKind::Deoptimization; }
 #ifdef COMPILER2
   bool is_uncommon_trap_stub() const          { return _kind == CodeBlobKind::UncommonTrap; }
@@ -196,6 +209,12 @@ public:
   bool is_exception_stub() const              { return false; }
 #endif
   bool is_safepoint_stub() const              { return _kind == CodeBlobKind::Safepoint; }
+  bool is_singleton_blob() const {
+    return (is_deoptimization_stub() ||
+            is_uncommon_trap_stub() ||
+            is_exception_stub() ||
+            is_safepoint_stub());
+  }
   bool is_adapter_blob() const                { return _kind == CodeBlobKind::Adapter; }
   bool is_vtable_blob() const                 { return _kind == CodeBlobKind::Vtable; }
   bool is_method_handles_adapter_blob() const { return _kind == CodeBlobKind::MHAdapter; }
@@ -205,8 +224,12 @@ public:
   nmethod* as_nmethod_or_null() const         { return is_nmethod() ? (nmethod*) this : nullptr; }
   nmethod* as_nmethod() const                 { assert(is_nmethod(), "must be nmethod"); return (nmethod*) this; }
   CodeBlob* as_codeblob() const               { return (CodeBlob*) this; }
+  // we may want to force an actual buffer blob or subtype instance
+  BufferBlob* as_buffer_blob(bool strict = true) const { assert(is_buffer_blob(), "must be %sbuffer blob", (strict ? "strict " : "")); return (BufferBlob*) this; }
   AdapterBlob* as_adapter_blob() const        { assert(is_adapter_blob(), "must be adapter blob"); return (AdapterBlob*) this; }
   ExceptionBlob* as_exception_blob() const    { assert(is_exception_stub(), "must be exception stub"); return (ExceptionBlob*) this; }
+  // this will always return a subtype instance
+  SingletonBlob* as_singleton_blob() const { assert(is_singleton_blob(), "must be singleton blob"); return (SingletonBlob*) this; }
   DeoptimizationBlob* as_deoptimization_blob() const { assert(is_deoptimization_stub(), "must be deopt stub"); return (DeoptimizationBlob*) this; }
   SafepointBlob* as_safepoint_blob() const    { assert(is_safepoint_stub(), "must be safepoint stub"); return (SafepointBlob*) this; }
   UpcallStub* as_upcall_stub() const          { assert(is_upcall_stub(), "must be upcall stub"); return (UpcallStub*) this; }
@@ -387,10 +410,10 @@ class BufferBlob: public RuntimeBlob {
 
   class Vptr : public RuntimeBlob::Vptr {
     void print_on(const CodeBlob* instance, outputStream* st) const override {
-      ((const BufferBlob*)instance)->print_on_impl(st);
+      instance->as_buffer_blob(false)->print_on_impl(st);
     }
     void print_value_on(const CodeBlob* instance, outputStream* st) const override {
-      ((const BufferBlob*)instance)->print_value_on_impl(st);
+      instance->as_buffer_blob(false)->print_value_on_impl(st);
     }
   };
 
@@ -486,10 +509,17 @@ class RuntimeStub: public RuntimeBlob {
 
   address entry_point() const         { return code_begin(); }
 
+  void post_restore_impl() {
+    trace_new_stub(this, "RuntimeStub - ", name());
+  }
+
   void print_on_impl(outputStream* st) const;
   void print_value_on_impl(outputStream* st) const;
 
   class Vptr : public RuntimeBlob::Vptr {
+    void post_restore(CodeBlob* instance) const override {
+      instance->as_runtime_stub()->post_restore_impl();
+    }
     void print_on(const CodeBlob* instance, outputStream* st) const override {
       instance->as_runtime_stub()->print_on_impl(st);
     }
@@ -531,10 +561,10 @@ class SingletonBlob: public RuntimeBlob {
 
   class Vptr : public RuntimeBlob::Vptr {
     void print_on(const CodeBlob* instance, outputStream* st) const override {
-      ((const SingletonBlob*)instance)->print_on_impl(st);
+      instance->as_singleton_blob()->print_on_impl(st);
     }
     void print_value_on(const CodeBlob* instance, outputStream* st) const override {
-      ((const SingletonBlob*)instance)->print_value_on_impl(st);
+      instance->as_singleton_blob()->print_value_on_impl(st);
     }
   };
 
@@ -605,20 +635,28 @@ class DeoptimizationBlob: public SingletonBlob {
     _uncommon_trap_offset = offset;
     assert(contains(code_begin() + _uncommon_trap_offset), "must be PC inside codeblob");
   }
-  address uncommon_trap() const                  { return code_begin() + _uncommon_trap_offset; }
+  address uncommon_trap() const                  { return (EnableJVMCI ? code_begin() + _uncommon_trap_offset : nullptr); }
 
   void set_implicit_exception_uncommon_trap_offset(int offset) {
     _implicit_exception_uncommon_trap_offset = offset;
     assert(contains(code_begin() + _implicit_exception_uncommon_trap_offset), "must be PC inside codeblob");
   }
-  address implicit_exception_uncommon_trap() const { return code_begin() + _implicit_exception_uncommon_trap_offset; }
+  address implicit_exception_uncommon_trap() const { return (EnableJVMCI ? code_begin() + _implicit_exception_uncommon_trap_offset : nullptr); }
 #endif // INCLUDE_JVMCI
 
+  void post_restore_impl() {
+    trace_new_stub(this, "DeoptimizationBlob");
+  }
+
   void print_value_on_impl(outputStream* st) const;
 
   class Vptr : public SingletonBlob::Vptr {
+    void post_restore(CodeBlob* instance) const override {
+      instance->as_deoptimization_blob()->post_restore_impl();
+    }
+
     void print_value_on(const CodeBlob* instance, outputStream* st) const override {
-      ((const DeoptimizationBlob*)instance)->print_value_on_impl(st);
+      instance->as_deoptimization_blob()->print_value_on_impl(st);
     }
   };
 
@@ -648,6 +686,16 @@ class UncommonTrapBlob: public SingletonBlob {
     OopMapSet*  oop_maps,
     int         frame_size
   );
+  void post_restore_impl() {
+    trace_new_stub(this, "UncommonTrapBlob");
+  }
+  class Vptr : public SingletonBlob::Vptr {
+    void post_restore(CodeBlob* instance) const override {
+      instance->as_uncommon_trap_blob()->post_restore_impl();
+    }
+  };
+
+  static const Vptr _vpntr;
 };
 
 
@@ -678,7 +726,7 @@ class ExceptionBlob: public SingletonBlob {
 
   class Vptr : public SingletonBlob::Vptr {
     void post_restore(CodeBlob* instance) const override {
-      ((ExceptionBlob*)instance)->post_restore_impl();
+      instance->as_exception_blob()->post_restore_impl();
     }
   };
 
@@ -708,6 +756,17 @@ class SafepointBlob: public SingletonBlob {
     OopMapSet*  oop_maps,
     int         frame_size
   );
+
+  void post_restore_impl() {
+    trace_new_stub(this, "SafepointBlob - ", name());
+  }
+  class Vptr : public SingletonBlob::Vptr {
+    void post_restore(CodeBlob* instance) const override {
+      instance->as_safepoint_blob()->post_restore_impl();
+    }
+  };
+
+  static const Vptr _vpntr;
 };
 
 //----------------------------------------------------------------------------------------------------

From 66a34be54a43c110f8dd577775fc213ed912faa7 Mon Sep 17 00:00:00 2001
From: Jaikiran Pai <jpai@openjdk.org>
Date: Sun, 29 Mar 2026 02:01:46 +0000
Subject: [PATCH 397/655] 8273874: LdapClient can trigger memory leak

Reviewed-by: dfuchs
---
 .../classes/com/sun/jndi/ldap/Connection.java |   9 +-
 .../classes/com/sun/jndi/ldap/EventQueue.java |   9 +-
 .../sun/jndi/ldap/NamingEventNotifier.java    |   6 +-
 test/jdk/com/sun/jndi/ldap/LdapTCCLTest.java  | 323 ++++++++++++++++++
 4 files changed, 336 insertions(+), 11 deletions(-)
 create mode 100644 test/jdk/com/sun/jndi/ldap/LdapTCCLTest.java

diff --git a/src/java.naming/share/classes/com/sun/jndi/ldap/Connection.java b/src/java.naming/share/classes/com/sun/jndi/ldap/Connection.java
index dcb739a8697..1e0a924f12c 100644
--- a/src/java.naming/share/classes/com/sun/jndi/ldap/Connection.java
+++ b/src/java.naming/share/classes/com/sun/jndi/ldap/Connection.java
@@ -57,6 +57,8 @@ import javax.net.ssl.HandshakeCompletedListener;
 import javax.net.ssl.SSLPeerUnverifiedException;
 import javax.security.sasl.SaslException;
 
+import jdk.internal.misc.InnocuousThread;
+
 /**
   * A thread that creates a connection to an LDAP server.
   * After the connection, the thread reads from the connection.
@@ -112,9 +114,6 @@ import javax.security.sasl.SaslException;
   * for v2.
   * %%% made public for access by LdapSasl %%%
   *
-  * @author Vincent Ryan
-  * @author Rosanna Lee
-  * @author Jagane Sundar
   */
 public final class Connection implements Runnable {
 
@@ -254,7 +253,7 @@ public final class Connection implements Runnable {
             throw ce;
         }
 
-        worker = new Thread(this);
+        worker = InnocuousThread.newSystemThread("LDAP Connection", this);
         worker.setDaemon(true);
         worker.start();
     }
@@ -912,7 +911,7 @@ public final class Connection implements Runnable {
     //
     ////////////////////////////////////////////////////////////////////////////
 
-
+    @Override
     public void run() {
         byte inbuf[];   // Buffer for reading incoming bytes
         int inMsgId;    // Message id of incoming response
diff --git a/src/java.naming/share/classes/com/sun/jndi/ldap/EventQueue.java b/src/java.naming/share/classes/com/sun/jndi/ldap/EventQueue.java
index 4f1cb9ec6a7..7d45d058c68 100644
--- a/src/java.naming/share/classes/com/sun/jndi/ldap/EventQueue.java
+++ b/src/java.naming/share/classes/com/sun/jndi/ldap/EventQueue.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1999, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1999, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -36,13 +36,13 @@ import javax.naming.event.NamingListener;
 import javax.naming.ldap.UnsolicitedNotificationEvent;
 import javax.naming.ldap.UnsolicitedNotificationListener;
 
+import jdk.internal.misc.InnocuousThread;
+
 /**
  * Package private class used by EventSupport to dispatch events.
  * This class implements an event queue, and a dispatcher thread that
  * dequeues and dispatches events from the queue.
  *
- * Pieces stolen from sun.misc.Queue.
- *
  * @author      Bill Shannon (from javax.mail.event)
  * @author      Rosanna Lee (modified for JNDI-related events)
  */
@@ -71,7 +71,7 @@ final class EventQueue implements Runnable {
 
     // package private
     EventQueue() {
-        qThread = new Thread(this);
+        qThread = InnocuousThread.newSystemThread("LDAP Event Dispatcher", this);
         qThread.setDaemon(true);  // not a user thread
         qThread.start();
     }
@@ -141,6 +141,7 @@ final class EventQueue implements Runnable {
     /**
      * Pull events off the queue and dispatch them.
      */
+    @Override
     public void run() {
         QueueElement qe;
 
diff --git a/src/java.naming/share/classes/com/sun/jndi/ldap/NamingEventNotifier.java b/src/java.naming/share/classes/com/sun/jndi/ldap/NamingEventNotifier.java
index 40a8173b768..0e30c1c1d38 100644
--- a/src/java.naming/share/classes/com/sun/jndi/ldap/NamingEventNotifier.java
+++ b/src/java.naming/share/classes/com/sun/jndi/ldap/NamingEventNotifier.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1999, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1999, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -33,6 +33,7 @@ import javax.naming.ldap.LdapName;
 
 import java.util.Vector;
 import com.sun.jndi.toolkit.ctx.Continuation;
+import jdk.internal.misc.InnocuousThread;
 
 /**
   * Gathers information to generate events by using the Persistent Search
@@ -86,7 +87,7 @@ final class NamingEventNotifier implements Runnable {
         namingListeners = new Vector<>();
         namingListeners.addElement(firstListener);
 
-        worker = new Thread(this);
+        worker = InnocuousThread.newSystemThread("LDAP Event Notifier", this);
         worker.setDaemon(true);  // not a user thread
         worker.start();
     }
@@ -111,6 +112,7 @@ final class NamingEventNotifier implements Runnable {
      * For each result, create the appropriate NamingEvent and
      * queue to be dispatched to listeners.
      */
+    @Override
     public void run() {
         try {
             Continuation cont = new Continuation();
diff --git a/test/jdk/com/sun/jndi/ldap/LdapTCCLTest.java b/test/jdk/com/sun/jndi/ldap/LdapTCCLTest.java
new file mode 100644
index 00000000000..21f355442d7
--- /dev/null
+++ b/test/jdk/com/sun/jndi/ldap/LdapTCCLTest.java
@@ -0,0 +1,323 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+import java.io.ByteArrayOutputStream;
+import java.io.IOException;
+import java.io.OutputStream;
+import java.net.Socket;
+import java.net.URL;
+import java.net.URLClassLoader;
+import java.util.Collection;
+import java.util.Collections;
+import java.util.Hashtable;
+
+import javax.naming.Context;
+import javax.naming.InitialContext;
+import javax.naming.event.EventContext;
+import javax.naming.event.NamingEvent;
+import javax.naming.event.NamingExceptionEvent;
+import javax.naming.event.ObjectChangeListener;
+
+import jdk.test.lib.net.URIBuilder;
+import org.junit.jupiter.api.AfterAll;
+import org.junit.jupiter.api.BeforeAll;
+import org.junit.jupiter.api.Test;
+import static java.nio.charset.StandardCharsets.US_ASCII;
+import static org.junit.jupiter.api.Assertions.assertNotNull;
+import static org.junit.jupiter.api.Assertions.fail;
+
+/*
+ * @test
+ * @bug 8273874
+ * @summary Verify that the system threads that LdapContext creates for its internal
+ *          use do not hold on to the application specific context classloaders
+ * @comment The test uses ThreadGroup.enumerate() to find live threads and check their
+ *          context classsloader, ThreadGroup of virtual threads don't enumerate threads,
+ *          so we skip this test when the main thread is a virtual thread.
+ * @requires test.thread.factory != "Virtual"
+ * @library lib/ /test/lib
+ * @build BaseLdapServer
+ *        LdapMessage
+ *        jdk.test.lib.net.URIBuilder
+ * @run junit ${test.main.class}
+ */
+class LdapTCCLTest {
+
+    private static final String LOOKUP_NAME = "CN=duke";
+
+    private static final byte BER_TYPE_LDAP_SEQUENCE = 0x30;
+    private static final byte BER_TYPE_INTEGER = 0x02;
+    private static final byte BER_TYPE_OCTET_STRING = 0x04;
+    private static final byte BER_TYPE_ENUM = 0x0a;
+    private static final byte BER_TYPE_LDAP_SEARCH_RESULT_ENTRY_OP = 0x64;
+    private static final byte BER_TYPE_LDAP_SEARCH_RESULT_DONE_OP = 0x65;
+    private static final byte LDAP_SEARCH_RESULT_DONE_SUCCESS = 0x00;
+
+    private static Server server;
+    private static Hashtable<String, String> envProps;
+
+    @BeforeAll
+    static void beforeAll() throws Exception {
+        server = new Server();
+        server.start();
+        System.err.println("server started at " + server.getInetAddress()
+                + ":" + server.getPort());
+
+        final Hashtable<String, String> props = new Hashtable<>();
+        props.put(Context.INITIAL_CONTEXT_FACTORY, "com.sun.jndi.ldap.LdapCtxFactory");
+        final String providerUrl = URIBuilder.newBuilder()
+                .scheme("ldap")
+                .host(server.getInetAddress().getHostAddress())
+                .port(server.getPort())
+                .build().toString();
+        props.put(Context.PROVIDER_URL, providerUrl);
+        // explicitly set LDAP version to 3 to prevent LDAP BIND requests
+        // during LdapCtx instantiation
+        props.put("java.naming.ldap.version", "3");
+
+        envProps = props;
+    }
+
+    @AfterAll
+    static void afterAll() throws Exception {
+        if (server != null) {
+            System.err.println("stopping server " + server.getInetAddress()
+                    + ":" + server.getPort());
+            server.close();
+        }
+    }
+
+    /*
+     * Sets a test specific Thread context classloader and then creates a InitialContext
+     * backed by a LdapCtxFactory and looks up an arbitrary name. The test then verifies
+     * that none of the live Threads (including any created for the internal LDAP connection
+     * management) have their context classloader set to the test specific classloader.
+     */
+    @Test
+    void testLdapCtxCreation() throws Exception {
+        try (final URLClassLoader urlc = new URLClassLoader(new URL[0])) {
+            final ClassLoader previous = Thread.currentThread().getContextClassLoader();
+            Context ctx = null;
+            try {
+                // switch the TCCL to a test specific one
+                Thread.currentThread().setContextClassLoader(urlc);
+
+                // create the LDAP Context and initiate a lookup()
+                // to allow for the underlying LDAP connection management
+                // infrastructure to create the necessary Thread(s)
+                ctx = new InitialContext(envProps);
+
+                System.err.println("issuing ldap request against "
+                        + envProps.get(Context.PROVIDER_URL) + " using context " + ctx);
+                final Object result = ctx.lookup(LOOKUP_NAME);
+                System.err.println("lookup returned " + result);
+                assertNotNull(result, "Context.lookup() returned null");
+
+                // verify that none of the live Thread(s) other than the current Thread
+                // have their TCCL set to the one set by the test. i.e. verify that the
+                // context classloader hasn't leaked into Thread(s) that may have been
+                // created by the LDAP connection management code.
+                assertTCCL(urlc, Collections.singleton(Thread.currentThread()));
+            } finally {
+                if (ctx != null) {
+                    ctx.close();
+                }
+                Thread.currentThread().setContextClassLoader(previous);
+            }
+        }
+    }
+
+    /*
+     * Sets a test specific Thread context classloader and then creates a InitialContext
+     * backed by a LdapCtxFactory and adds a NamingListener. The test then verifies
+     * that none of the live Threads (including any newly created ones during the
+     * NamingListener registration) have their context classloader set to the test
+     * specific classloader.
+     */
+    @Test
+    void testAddNamingListener() throws Exception {
+        try (final URLClassLoader urlc = new URLClassLoader(new URL[0])) {
+            final ClassLoader previous = Thread.currentThread().getContextClassLoader();
+            EventContext ctx = null;
+            try {
+                // switch the TCCL to a test specific one
+                Thread.currentThread().setContextClassLoader(urlc);
+
+                ctx = (EventContext) (new InitialContext(envProps).lookup(LOOKUP_NAME));
+                // add a NamingListener to exercise the Thread creation in the internals
+                // of LdapCtx
+                ctx.addNamingListener(LOOKUP_NAME, EventContext.OBJECT_SCOPE, new Listener());
+                // verify that none of the live Thread(s) other than the current Thread
+                // have their TCCL set to the one set by the test. i.e. verify that the
+                // context classloader hasn't leaked into Thread(s) that may have been
+                // created by the LDAP naming listener code.
+                assertTCCL(urlc, Collections.singleton(Thread.currentThread()));
+            } finally {
+                if (ctx != null) {
+                    ctx.close();
+                }
+                Thread.currentThread().setContextClassLoader(previous);
+            }
+        }
+    }
+
+    /*
+     * Verifies that none of the live threads have their context classloader set to
+     * the given "notExpected" classloader.
+     */
+    private static void assertTCCL(final ClassLoader notExpected,
+                                   final Collection<Thread> threadsToIgnore) {
+        ThreadGroup topMostThreadGroup = Thread.currentThread().getThreadGroup();
+        assertNotNull(topMostThreadGroup,
+                "ThreadGroup for current thread " + Thread.currentThread() + " was null");
+        while (topMostThreadGroup.getParent() != null) {
+            topMostThreadGroup = topMostThreadGroup.getParent();
+        }
+        // recursively enumerate the threads in the top most thread group
+        final Thread[] threads = new Thread[1024];
+        final int numThreads = topMostThreadGroup.enumerate(threads);
+        // verify the threads
+        int numFailedThreads = 0;
+        final StringBuilder diagnosticMsg = new StringBuilder();
+        for (int i = 0; i < numThreads; i++) {
+            final Thread t = threads[i];
+            if (threadsToIgnore.contains(t)) {
+                continue; // skip verification of the thread
+            }
+            System.err.println("verifying " + t);
+            if (t.getContextClassLoader() == notExpected) {
+                // Thread has an unexpected context classloader
+                numFailedThreads++;
+                // for debugging track the stacktrace of the thread
+                // that failed the check
+                diagnosticMsg.append("FAILED - ").append(t)
+                        .append(" is using unexpected context classloader: ")
+                        .append(notExpected)
+                        .append(", its current activity is:\n");
+                for (StackTraceElement ste : t.getStackTrace()) {
+                    diagnosticMsg.append("\t").append(ste).append("\n");
+                }
+            }
+        }
+        if (numFailedThreads > 0) {
+            // for debugging print out the stacktrace of the
+            // Thread(s) that failed the check
+            System.err.println(diagnosticMsg);
+            fail(numFailedThreads + " Thread(s) had unexpected context classloader "
+                    + notExpected);
+        }
+    }
+
+    private static final class Server extends BaseLdapServer {
+
+        private Server() throws IOException {
+            super();
+        }
+
+        // handles and responds to the incoming LDAP request
+        @Override
+        protected void handleRequest(final Socket socket,
+                                     final LdapMessage request,
+                                     final OutputStream out) throws IOException {
+            switch (request.getOperation()) {
+                case SEARCH_REQUEST: {
+                    System.err.println("responding to SEARCH_REQUEST with id: "
+                            + request.getMessageID() + " on socket " + socket);
+                    // write out a search response
+                    final byte[] rsp = makeSearchResponse((byte) request.getMessageID(), LOOKUP_NAME);
+                    out.write(rsp);
+                    out.flush();
+                    System.err.println("wrote response for message: " + request.getMessageID());
+                    break;
+                }
+                default: {
+                    throw new IOException("unexpected operation type: " + request.getOperation()
+                            + ", request: " + request);
+                }
+            }
+        }
+
+        // constructs and returns a byte[] response containing the following (in that order):
+        //  - Search Result Entry
+        //  - Search Result Done
+        private static byte[] makeSearchResponse(final byte msgId, final String dn)
+                throws IOException {
+            final ByteArrayOutputStream bout = new ByteArrayOutputStream();
+            final byte msgIdLen = 1;
+
+            // write the BER elements
+            // each BER element is 3 parts:
+            // Type, length, value
+
+            // Search Result Entry BER element (refer to LDAPv3 wire format for details)
+            bout.write(BER_TYPE_LDAP_SEQUENCE);
+            bout.write(dn.length() + 9);
+            bout.write(new byte[]{BER_TYPE_INTEGER, msgIdLen, msgId});
+            bout.write(BER_TYPE_LDAP_SEARCH_RESULT_ENTRY_OP);
+            bout.write(dn.length() + 2);
+            bout.write(BER_TYPE_OCTET_STRING);
+            bout.write(dn.length());
+            bout.write(dn.getBytes(US_ASCII));
+            bout.write(BER_TYPE_LDAP_SEQUENCE);
+            // 0 length for the LDAP sequence, implying no attributes in this Search Result Entry
+            bout.write(0);
+
+            bout.write(makeSearchResultDone(msgId));
+
+            return bout.toByteArray();
+        }
+
+        // Search Result Done BER element (refer to LDAPv3 wire format for details)
+        private static byte[] makeSearchResultDone(final byte msgId) throws IOException {
+            final ByteArrayOutputStream bout = new ByteArrayOutputStream();
+            final byte msgIdLen = 1;
+            final String matchedDN = "";
+            bout.write(BER_TYPE_LDAP_SEQUENCE);
+            bout.write(matchedDN.length() + 12);
+            bout.write(new byte[]{BER_TYPE_INTEGER, msgIdLen, msgId});
+            bout.write(BER_TYPE_LDAP_SEARCH_RESULT_DONE_OP);
+            bout.write(7);
+            bout.write(new byte[]{BER_TYPE_ENUM, 1, LDAP_SEARCH_RESULT_DONE_SUCCESS});
+            // the matched DN
+            bout.write(BER_TYPE_OCTET_STRING);
+            bout.write(matchedDN.length());
+            bout.write(matchedDN.getBytes(US_ASCII));
+            // 0 length implies no diagnostic message
+            bout.write(new byte[]{BER_TYPE_OCTET_STRING, 0});
+            return bout.toByteArray();
+        }
+    }
+
+    private static final class Listener implements ObjectChangeListener {
+
+        @Override
+        public void namingExceptionThrown(final NamingExceptionEvent evt) {
+            System.err.println("namingExceptionThrown() called for " + evt);
+        }
+
+        @Override
+        public void objectChanged(final NamingEvent evt) {
+            System.err.println("objectChanged() called for " + evt);
+        }
+    }
+}

From eb96bfb2a538e60f4ff0c682100931d3cf8da8d2 Mon Sep 17 00:00:00 2001
From: jonghoonpark <dev@jonghoonpark.com>
Date: Mon, 30 Mar 2026 02:58:19 +0000
Subject: [PATCH 398/655] 8379873: Remove undefined debugging declarations in
 os_windows.cpp

Reviewed-by: dholmes, ayang
---
 src/hotspot/os/windows/os_windows.cpp | 6 ------
 1 file changed, 6 deletions(-)

diff --git a/src/hotspot/os/windows/os_windows.cpp b/src/hotspot/os/windows/os_windows.cpp
index 18d047348cb..9d8fb45f0d1 100644
--- a/src/hotspot/os/windows/os_windows.cpp
+++ b/src/hotspot/os/windows/os_windows.cpp
@@ -2528,12 +2528,6 @@ LONG Handle_Exception(struct _EXCEPTION_POINTERS* exceptionInfo,
   return EXCEPTION_CONTINUE_EXECUTION;
 }
 
-
-// Used for PostMortemDump
-extern "C" void safepoints();
-extern "C" void find(int x);
-extern "C" void events();
-
 // According to Windows API documentation, an illegal instruction sequence should generate
 // the 0xC000001C exception code. However, real world experience shows that occasionnaly
 // the execution of an illegal instruction can generate the exception code 0xC000001E. This

From 7527da081b777f280144af5841874729a671e9c5 Mon Sep 17 00:00:00 2001
From: Trupti Patil <trupti.a.patil@oracle.com>
Date: Mon, 30 Mar 2026 04:40:26 +0000
Subject: [PATCH 399/655] 8377534: Test
 java/awt/print/PrinterJob/PrintNullString.java fails with FAILURE: No IAE for
 empty iterator, int

Reviewed-by: aivanov, prr
---
 .../awt/print/PrinterJob/PrintNullString.java | 20 ++++++-------------
 1 file changed, 6 insertions(+), 14 deletions(-)

diff --git a/test/jdk/java/awt/print/PrinterJob/PrintNullString.java b/test/jdk/java/awt/print/PrinterJob/PrintNullString.java
index 2bcee65fe9b..8feb50602f7 100644
--- a/test/jdk/java/awt/print/PrinterJob/PrintNullString.java
+++ b/test/jdk/java/awt/print/PrinterJob/PrintNullString.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2007, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2007, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -37,7 +37,7 @@ import javax.print.attribute.standard.Destination;
 
 /*
  * @test
- * @bug 4223328
+ * @bug 4223328 4138921
  * @summary Printer graphics must throw expected exceptions
  * @key printer
  * @run main PrintNullString
@@ -106,12 +106,8 @@ public class PrintNullString implements Printable {
             g2d.drawString("caught expected NPE for null iterator, int", 20, 120);
         }
 
-        try {
-            g2d.drawString(emptyIterator, 20, 140);
-            throw new RuntimeException("FAILURE: No IAE for empty iterator, int");
-        } catch (IllegalArgumentException e) {
-            g2d.drawString("caught expected IAE for empty iterator, int", 20, 140);
-        }
+        g2d.drawString(emptyIterator, 20, 140);
+        g2d.drawString("OK for empty iterator, int", 20, 140);
 
         // API 4: null & empty drawString(Iterator, float, int);
         try {
@@ -121,12 +117,8 @@ public class PrintNullString implements Printable {
             g2d.drawString("caught expected NPE for null iterator, float", 20, 160);
         }
 
-        try {
-            g2d.drawString(emptyIterator, 20.0f, 180.0f);
-            throw new RuntimeException("FAILURE: No IAE for empty iterator, float");
-        } catch (IllegalArgumentException e) {
-            g2d.drawString("caught expected IAE for empty iterator, float", 20, 180);
-        }
+        g2d.drawString(emptyIterator, 20.0f, 180.0f);
+        g2d.drawString("OK for empty iterator, float", 20.0f, 100.f);
 
         return PAGE_EXISTS;
     }

From ca3fe721ba23a1304089b71c1b58940f16a0d053 Mon Sep 17 00:00:00 2001
From: Thomas Stuefe <stuefe@openjdk.org>
Date: Mon, 30 Mar 2026 04:54:17 +0000
Subject: [PATCH 400/655] 8357089: Remove VFORK launch mechanism from Process
 implementation (linux)

Reviewed-by: rriggs, andrew
---
 .../unix/classes/java/lang/ProcessImpl.java   |  37 ++---
 .../unix/native/libjava/ProcessImpl_md.c      | 153 ++++--------------
 src/java.base/unix/native/libjava/childproc.c |  52 ++----
 src/java.base/unix/native/libjava/childproc.h |   1 -
 test/jdk/java/lang/ProcessBuilder/Basic.java  |  10 --
 .../ConcNativeForkTest.java                   |  10 --
 .../ProcessBuilder/FDLeakTest/FDLeakTest.java |   8 -
 .../ProcessBuilder/NonPipelineLeaksFD.java    |   8 -
 .../PipesCloseOnExecTest.java                 |  10 --
 .../lang/ProcessBuilder/RejectVFORKMode.java  |  59 +++++++
 .../TestChildSignalDisposition.java           |  11 +-
 11 files changed, 110 insertions(+), 249 deletions(-)
 create mode 100644 test/jdk/java/lang/ProcessBuilder/RejectVFORKMode.java

diff --git a/src/java.base/unix/classes/java/lang/ProcessImpl.java b/src/java.base/unix/classes/java/lang/ProcessImpl.java
index 00b51fb3389..d9a4547848f 100644
--- a/src/java.base/unix/classes/java/lang/ProcessImpl.java
+++ b/src/java.base/unix/classes/java/lang/ProcessImpl.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -82,8 +82,7 @@ final class ProcessImpl extends Process {
     private static enum LaunchMechanism {
         // order IS important!
         FORK,
-        POSIX_SPAWN,
-        VFORK
+        POSIX_SPAWN
     }
 
     /**
@@ -98,29 +97,16 @@ final class ProcessImpl extends Process {
 
         try {
             // Should be value of a LaunchMechanism enum
-            LaunchMechanism lm = LaunchMechanism.valueOf(s.toUpperCase(Locale.ROOT));
-            switch (OperatingSystem.current()) {
-                case LINUX: {
-                    // All options are valid for Linux, but VFORK is deprecated and results
-                    // in a warning
-                    if (lm == LaunchMechanism.VFORK) {
-                        System.err.println("VFORK MODE DEPRECATED");
-                        System.err.println("""
-                                          The VFORK launch mechanism has been deprecated for being dangerous.
-                                          It will be removed in a future java version. Either remove the
-                                          jdk.lang.Process.launchMechanism property (preferred) or use FORK mode
-                                          instead (-Djdk.lang.Process.launchMechanism=FORK).
-                                          """);
-                    }
-                    return lm;
-                }
-                case AIX:
-                case MACOS:
-                    if (lm != LaunchMechanism.VFORK) {
-                        return lm; // All but VFORK are valid
-                    }
-                    break;
+            String launchMechanism = s.toUpperCase(Locale.ROOT);
+            if (launchMechanism.equals("VFORK") && OperatingSystem.isLinux()) {
+                launchMechanism = "FORK";
+                System.err.println(String.format("""
+                                   The VFORK launch mechanism has been removed. Switching to %s instead.
+                                   Please remove the jdk.lang.Process.launchMechanism property (preferred)
+                                   or use FORK mode instead (-Djdk.lang.Process.launchMechanism=FORK).%n
+                                   """, launchMechanism));
             }
+            return LaunchMechanism.valueOf(launchMechanism);
         } catch (IllegalArgumentException e) {
         }
 
@@ -266,7 +252,6 @@ final class ProcessImpl extends Process {
      * <pre>
      *   1 - fork(2) and exec(2)
      *   2 - posix_spawn(3P)
-     *   3 - vfork(2) and exec(2)
      * </pre>
      * @param fds an array of three file descriptors.
      *        Indexes 0, 1, and 2 correspond to standard input,
diff --git a/src/java.base/unix/native/libjava/ProcessImpl_md.c b/src/java.base/unix/native/libjava/ProcessImpl_md.c
index f7d91166e76..69af948d2da 100644
--- a/src/java.base/unix/native/libjava/ProcessImpl_md.c
+++ b/src/java.base/unix/native/libjava/ProcessImpl_md.c
@@ -60,51 +60,33 @@
  *   changing paths...
  * - then exec(2) the target binary
  *
- * There are three ways to fork off:
+ * On the OS-side are three ways to fork off, but we only use two of them:
  *
- * A) fork(2). Portable and safe (no side effects) but may fail with ENOMEM on
- *    all Unices when invoked from a VM with a high memory footprint. On Unices
- *    with strict no-overcommit policy this problem is most visible.
+ * A) fork(2). Portable and safe (no side effects) but could fail on very ancient
+ *    Unices that don't employ COW on fork(2). The modern platforms we support
+ *    (Linux, MacOS, AIX) all do. It may have a small performance penalty compared
+ *    to modern posix_spawn(3) implementations - see below.
+ *    fork(2) can be used by specifying -Djdk.lang.Process.launchMechanism=FORK when starting
+ *    the (parent process) JVM.
  *
- *    This is because forking the VM will first create a child process with
- *    theoretically the same memory footprint as the parent - even if you plan
- *    to follow up with exec'ing a tiny binary. In reality techniques like
- *    copy-on-write etc mitigate the problem somewhat but we still run the risk
- *    of hitting system limits.
+ * B) vfork(2): Portable and fast but very unsafe. For details, see JDK-8357090.
+ *    We supported this mode in older releases but removed support for it in JDK 27.
+ *    Modern posix_spawn(3) implementations use techniques similar to vfork(2), but
+ *    in a much safer way
  *
- *    For a Linux centric description of this problem, see the documentation on
- *    /proc/sys/vm/overcommit_memory in Linux proc(5).
- *
- * B) vfork(2): Portable and fast but very unsafe. It bypasses the memory
- *    problems related to fork(2) by starting the child in the memory image of
- *    the parent. Things that can go wrong include:
- *    - Programming errors in the child process before the exec(2) call may
- *      trash memory in the parent process, most commonly the stack of the
- *      thread invoking vfork.
- *    - Signals received by the child before the exec(2) call may be at best
- *      misdirected to the parent, at worst immediately kill child and parent.
- *
- *    This is mitigated by very strict rules about what one is allowed to do in
- *    the child process between vfork(2) and exec(2), which is basically nothing.
- *    However, we always broke this rule by doing the pre-exec work between
- *    vfork(2) and exec(2).
- *
- *    Also note that vfork(2) has been deprecated by the OpenGroup, presumably
- *    because of its many dangers.
- *
- * C) clone(2): This is a Linux specific call which gives the caller fine
- *    grained control about how exactly the process fork is executed. It is
- *    powerful, but Linux-specific.
- *
- * Aside from these three possibilities there is a forth option:  posix_spawn(3).
- * Where fork/vfork/clone all fork off the process and leave pre-exec work and
- * calling exec(2) to the user, posix_spawn(3) offers the user fork+exec-like
- * functionality in one package, similar to CreateProcess() on Windows.
- *
- * It is not a system call in itself, but usually a wrapper implemented within
- * the libc in terms of one of (fork|vfork|clone)+exec - so whether or not it
- * has advantages over calling the naked (fork|vfork|clone) functions depends
- * on how posix_spawn(3) is implemented.
+ * C) posix_spawn(3): Where fork/vfork/clone all fork off the process and leave
+ *    pre-exec work and calling exec(2) to the user, posix_spawn(3) offers the user
+ *    fork+exec-like functionality in one package, similar to CreateProcess() on Windows.
+ *    It is not a system call, but a wrapper implemented in user-space libc in terms
+ *    of one of (fork|vfork|clone)+exec - so whether or not it has advantages over calling
+ *    the naked (fork|vfork|clone) functions depends on how posix_spawn(3) is implemented.
+ *    Modern posix_spawn(3) implementations, on Linux, use clone(2) with CLONE_VM | CLONE_VFORK,
+ *    giving us the best ratio between performance and safety.
+ *    Note however, that posix_spawn(3) can be buggy, depending on the libc implementation.
+ *    E.g., on MacOS, it is still fully not POSIX-compliant. Therefore, we need to retain the
+ *    FORK mode as a backup.
+ *    Posix_spawn mode is used by default, but can be explicitly enabled using
+ *    -Djdk.lang.Process.launchMechanism=POSIX_SPAWN when starting the (parent process) JVM.
  *
  * Note that when using posix_spawn(3), we exec twice: first a tiny binary called
  * the jspawnhelper, then in the jspawnhelper we do the pre-exec work and exec a
@@ -117,58 +99,14 @@
  * --- Linux-specific ---
  *
  * How does glibc implement posix_spawn?
- * (see: sysdeps/posix/spawni.c for glibc < 2.24,
- *       sysdeps/unix/sysv/linux/spawni.c for glibc >= 2.24):
  *
- * 1) Before glibc 2.4 (released 2006), posix_spawn(3) used just fork(2)/exec(2).
- *    This would be bad for the JDK since we would risk the known memory issues with
- *    fork(2). But since this only affects glibc variants which have long been
- *    phased out by modern distributions, this is irrelevant.
+ * Before glibc 2.4 (released 2006), posix_spawn(3) used just fork(2)/exec(2). From
+ * glibc 2.4 up to and including 2.23, it used either fork(2) or vfork(2). None of these
+ * versions still matter.
  *
- * 2) Between glibc 2.4 and glibc 2.23, posix_spawn uses either fork(2) or
- *    vfork(2) depending on how exactly the user called posix_spawn(3):
- *
- * <quote>
- *       The child process is created using vfork(2) instead of fork(2) when
- *       either of the following is true:
- *
- *       * the spawn-flags element of the attributes object pointed to by
- *          attrp contains the GNU-specific flag POSIX_SPAWN_USEVFORK; or
- *
- *       * file_actions is NULL and the spawn-flags element of the attributes
- *          object pointed to by attrp does not contain
- *          POSIX_SPAWN_SETSIGMASK, POSIX_SPAWN_SETSIGDEF,
- *          POSIX_SPAWN_SETSCHEDPARAM, POSIX_SPAWN_SETSCHEDULER,
- *          POSIX_SPAWN_SETPGROUP, or POSIX_SPAWN_RESETIDS.
- * </quote>
- *
- * Due to the way the JDK calls posix_spawn(3), it would therefore call vfork(2).
- * So we would avoid the fork(2) memory problems. However, there still remains the
- * risk associated with vfork(2). But it is smaller than were we to call vfork(2)
- * directly since we use the jspawnhelper, moving all pre-exec work off to after
- * the first exec, thereby reducing the vulnerable time window.
- *
- * 3) Since glibc >= 2.24, glibc uses clone+exec:
- *
- *    new_pid = CLONE (__spawni_child, STACK (stack, stack_size), stack_size,
- *                     CLONE_VM | CLONE_VFORK | SIGCHLD, &args);
- *
- * This is even better than (2):
- *
- * CLONE_VM means we run in the parent's memory image, as with (2)
- * CLONE_VFORK means parent waits until we exec, as with (2)
- *
- * However, error possibilities are further reduced since:
- * - posix_spawn(3) passes a separate stack for the child to run on, eliminating
- *   the danger of trashing the forking thread's stack in the parent process.
- * - posix_spawn(3) takes care to temporarily block all incoming signals to the
- *   child process until the first exec(2) has been called,
- *
- * TL;DR
- * Calling posix_spawn(3) for glibc
- * (2) < 2.24 is not perfect but still better than using plain vfork(2), since
- *     the chance of an error happening is greatly reduced
- * (3) >= 2.24 is the best option - portable, fast and as safe as possible.
+ * Since glibc >= 2.24, glibc uses clone+exec with CLONE_VM | CLONE_VFORK to emulate vfork
+ * performance but without the inherent dangers (we run inside the parent's memory image
+ * and stop the parent for as long as it takes the child process to exec).
  *
  * ---
  *
@@ -180,7 +118,6 @@
  *
  * </Linux-specific>
  *
- *
  * Based on the above analysis, we are currently defaulting to posix_spawn()
  * on all Unices including Linux.
  */
@@ -489,28 +426,6 @@ static int copystrings(char *buf, int offset, const char * const *arg) {
 __attribute_noinline__
 #endif
 
-/* vfork(2) is deprecated on Darwin */
-#ifndef __APPLE__
-static pid_t
-vforkChild(ChildStuff *c) {
-    volatile pid_t resultPid;
-
-    /*
-     * We separate the call to vfork into a separate function to make
-     * very sure to keep stack of child from corrupting stack of parent,
-     * as suggested by the scary gcc warning:
-     *  warning: variable 'foo' might be clobbered by 'longjmp' or 'vfork'
-     */
-    resultPid = vfork();
-
-    if (resultPid == 0) {
-        childProcess(c);
-    }
-    assert(resultPid != 0);  /* childProcess never returns */
-    return resultPid;
-}
-#endif
-
 static pid_t
 forkChild(ChildStuff *c) {
     pid_t resultPid;
@@ -734,11 +649,6 @@ spawnChild(JNIEnv *env, jobject process, ChildStuff *c, const char *helperpath)
 static pid_t
 startChild(JNIEnv *env, jobject process, ChildStuff *c, const char *helperpath) {
     switch (c->mode) {
-/* vfork(2) is deprecated on Darwin*/
-      #ifndef __APPLE__
-      case MODE_VFORK:
-        return vforkChild(c);
-      #endif
       case MODE_FORK:
         return forkChild(c);
       case MODE_POSIX_SPAWN:
@@ -872,9 +782,6 @@ Java_java_lang_ProcessImpl_forkAndExec(JNIEnv *env,
     if (resultPid < 0) {
         char * failMessage = "unknown";
         switch (c->mode) {
-          case MODE_VFORK:
-            failMessage = "vfork failed";
-            break;
           case MODE_FORK:
             failMessage = "fork failed";
             break;
diff --git a/src/java.base/unix/native/libjava/childproc.c b/src/java.base/unix/native/libjava/childproc.c
index 83ee782482f..6bc15dfb40c 100644
--- a/src/java.base/unix/native/libjava/childproc.c
+++ b/src/java.base/unix/native/libjava/childproc.c
@@ -271,31 +271,6 @@ initVectorFromBlock(const char**vector, const char* block, int count)
     vector[count] = NULL;
 }
 
-/**
- * Exec FILE as a traditional Bourne shell script (i.e. one without #!).
- * If we could do it over again, we would probably not support such an ancient
- * misfeature, but compatibility wins over sanity.  The original support for
- * this was imported accidentally from execvp().
- */
-static void
-execve_as_traditional_shell_script(const char *file,
-                                   const char *argv[],
-                                   const char *const envp[])
-{
-    /* Use the extra word of space provided for us in argv by caller. */
-    const char *argv0 = argv[0];
-    const char *const *end = argv;
-    while (*end != NULL)
-        ++end;
-    memmove(argv+2, argv+1, (end-argv) * sizeof(*end));
-    argv[0] = "/bin/sh";
-    argv[1] = file;
-    execve(argv[0], (char **) argv, (char **) envp);
-    /* Can't even exec /bin/sh?  Big trouble, but let's soldier on... */
-    memmove(argv+1, argv+2, (end-argv) * sizeof(*end));
-    argv[0] = argv0;
-}
-
 /**
  * Like execve(2), except that in case of ENOEXEC, FILE is assumed to
  * be a shell script and the system default shell is invoked to run it.
@@ -305,16 +280,9 @@ execve_with_shell_fallback(int mode, const char *file,
                            const char *argv[],
                            const char *const envp[])
 {
-    if (mode == MODE_VFORK) {
-        /* shared address space; be very careful. */
-        execve(file, (char **) argv, (char **) envp);
-        if (errno == ENOEXEC)
-            execve_as_traditional_shell_script(file, argv, envp);
-    } else {
-        /* unshared address space; we can mutate environ. */
-        environ = (char **) envp;
-        execvp(file, (char **) argv);
-    }
+    /* unshared address space; we can mutate environ. */
+    environ = (char **) envp;
+    execvp(file, (char **) argv);
 }
 
 /**
@@ -430,7 +398,7 @@ childProcess(void *arg)
 #endif
 
     /* File descriptor setup for non-Posix-spawn mode */
-    if (p->mode != MODE_POSIX_SPAWN) {
+    if (p->mode == MODE_FORK) {
 
         /* Close the parent sides of the pipes.
            Closing pipe fds here is redundant, since markDescriptorsCloseOnExec()
@@ -482,7 +450,7 @@ childProcess(void *arg)
         /* We moved the fail pipe fd */
         fail_pipe_fd = FAIL_FILENO;
 
-    } /* end: FORK/VFORK mode */
+    } /* end: FORK mode */
 
     assert(fail_pipe_fd == FAIL_FILENO);
 
@@ -508,12 +476,10 @@ childProcess(void *arg)
         goto WhyCantJohnnyExec;
     }
 
-    // Reset any mask signals from parent, but not in VFORK mode
-    if (p->mode != MODE_VFORK) {
-        sigset_t unblock_signals;
-        sigemptyset(&unblock_signals);
-        sigprocmask(SIG_SETMASK, &unblock_signals, NULL);
-    }
+    // Reset any mask signals from parent
+    sigset_t unblock_signals;
+    sigemptyset(&unblock_signals);
+    sigprocmask(SIG_SETMASK, &unblock_signals, NULL);
 
     // Children should be started with default signal disposition for SIGPIPE
     if (signal(SIGPIPE, SIG_DFL) == SIG_ERR) {
diff --git a/src/java.base/unix/native/libjava/childproc.h b/src/java.base/unix/native/libjava/childproc.h
index 27414e60137..0b02df7f3dd 100644
--- a/src/java.base/unix/native/libjava/childproc.h
+++ b/src/java.base/unix/native/libjava/childproc.h
@@ -81,7 +81,6 @@ extern char **environ;
  */
 #define MODE_FORK 1
 #define MODE_POSIX_SPAWN 2
-#define MODE_VFORK 3
 
 typedef struct _ChildStuff
 {
diff --git a/test/jdk/java/lang/ProcessBuilder/Basic.java b/test/jdk/java/lang/ProcessBuilder/Basic.java
index 70d6101c1a5..b150690ef48 100644
--- a/test/jdk/java/lang/ProcessBuilder/Basic.java
+++ b/test/jdk/java/lang/ProcessBuilder/Basic.java
@@ -50,16 +50,6 @@
  * @run main/othervm/native/timeout=360 -Djdk.lang.Process.launchMechanism=fork Basic
  */
 
-/*
- * @test id=VFORK
- * @modules java.base/java.lang:open
- *          java.base/java.io:open
- *          java.base/jdk.internal.misc
- * @requires (os.family == "linux")
- * @library /test/lib
- * @run main/othervm/timeout=300 -Djdk.lang.Process.launchMechanism=vfork Basic
- */
-
 import java.lang.ProcessBuilder.Redirect;
 import java.lang.ProcessHandle;
 import static java.lang.ProcessBuilder.Redirect.*;
diff --git a/test/jdk/java/lang/ProcessBuilder/ConcNativeForkTest/ConcNativeForkTest.java b/test/jdk/java/lang/ProcessBuilder/ConcNativeForkTest/ConcNativeForkTest.java
index f02e4991302..904a0e12f98 100644
--- a/test/jdk/java/lang/ProcessBuilder/ConcNativeForkTest/ConcNativeForkTest.java
+++ b/test/jdk/java/lang/ProcessBuilder/ConcNativeForkTest/ConcNativeForkTest.java
@@ -42,16 +42,6 @@
  * @run main/othervm/manual -Djdk.lang.Process.launchMechanism=FORK ConcNativeForkTest
  */
 
-/*
- * @test id=VFORK
- * @bug 8377907
- * @summary Test that demonstrates the hanging-parent-on-native-concurrent-forks problem
- * @requires os.family == "linux"
- * @requires vm.flagless
- * @library /test/lib
- * @run main/othervm/manual -Djdk.lang.Process.launchMechanism=VFORK ConcNativeForkTest
- */
-
 public class ConcNativeForkTest {
 
     // How this works:
diff --git a/test/jdk/java/lang/ProcessBuilder/FDLeakTest/FDLeakTest.java b/test/jdk/java/lang/ProcessBuilder/FDLeakTest/FDLeakTest.java
index aee85e2335f..02c60395f17 100644
--- a/test/jdk/java/lang/ProcessBuilder/FDLeakTest/FDLeakTest.java
+++ b/test/jdk/java/lang/ProcessBuilder/FDLeakTest/FDLeakTest.java
@@ -38,14 +38,6 @@
  * @run main/othervm/native -Djdk.lang.Process.launchMechanism=fork -agentlib:FDLeaker FDLeakTest
  */
 
-/**
- * @test id=vfork
- * @summary Check that we don't leak FDs to child processes
- * @requires os.family == "linux"
- * @library /test/lib
- * @run main/othervm/native -Djdk.lang.Process.launchMechanism=vfork -agentlib:FDLeaker FDLeakTest
- */
-
 import jdk.test.lib.process.ProcessTools;
 public class FDLeakTest {
     // This test has two native parts:
diff --git a/test/jdk/java/lang/ProcessBuilder/NonPipelineLeaksFD.java b/test/jdk/java/lang/ProcessBuilder/NonPipelineLeaksFD.java
index be2c4af3bbe..e43255d8c52 100644
--- a/test/jdk/java/lang/ProcessBuilder/NonPipelineLeaksFD.java
+++ b/test/jdk/java/lang/ProcessBuilder/NonPipelineLeaksFD.java
@@ -32,14 +32,6 @@ import java.io.*;
  * @run main/othervm -Djdk.lang.Process.launchMechanism=fork NonPipelineLeaksFD
  */
 
-/*
- * @test id=VFORK
- * @summary Check that we don't accumulate leaked FDs in the parent process
- * @requires os.family == "linux"
- * @library /test/lib
- * @run main/othervm -Djdk.lang.Process.launchMechanism=vfork NonPipelineLeaksFD
- */
-
 /*
  * @test id=POSIX_SPAWN
  * @summary Check that we don't accumulate leaked FDs in the parent process
diff --git a/test/jdk/java/lang/ProcessBuilder/PipesCloseOnExecTest/PipesCloseOnExecTest.java b/test/jdk/java/lang/ProcessBuilder/PipesCloseOnExecTest/PipesCloseOnExecTest.java
index 1e988f0496c..8390caae59a 100644
--- a/test/jdk/java/lang/ProcessBuilder/PipesCloseOnExecTest/PipesCloseOnExecTest.java
+++ b/test/jdk/java/lang/ProcessBuilder/PipesCloseOnExecTest/PipesCloseOnExecTest.java
@@ -32,16 +32,6 @@
  * @run main/othervm/native -Djdk.lang.Process.launchMechanism=FORK PipesCloseOnExecTest
  */
 
-/*
- * @test id=VFORK
- * @bug 8377907
- * @summary Check that we don't open pipes without CLOEXCEC
- * @requires os.family == "linux"
- * @requires vm.flagless
- * @library /test/lib
- * @run main/othervm/native -Djdk.lang.Process.launchMechanism=VFORK PipesCloseOnExecTest
- */
-
 /*
  * @test id=POSIX_SPAWN
  * @bug 8377907
diff --git a/test/jdk/java/lang/ProcessBuilder/RejectVFORKMode.java b/test/jdk/java/lang/ProcessBuilder/RejectVFORKMode.java
new file mode 100644
index 00000000000..db8387821f5
--- /dev/null
+++ b/test/jdk/java/lang/ProcessBuilder/RejectVFORKMode.java
@@ -0,0 +1,59 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2026, IBM Corp.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+/*
+ * @test
+ * @bug 8357089
+ * @summary Check that specifying VFORK correctly falls back to FORK with a clear warning to stderr.
+ * @requires (os.family == "linux")
+ * @library /test/lib
+ * @run main RejectVFORKMode GRANDPARENT
+ */
+
+import jdk.test.lib.process.OutputAnalyzer;
+import jdk.test.lib.process.ProcessTools;
+
+public class RejectVFORKMode {
+    public static void main(String[] args) throws Exception {
+
+        switch (args[0]) {
+            case "PARENT" -> {
+                ProcessBuilder pb = new ProcessBuilder("sh", "-c", "echo 'Child Process'; exit 12;");
+                // This should result in a (written to this process' stderr) warning about VFORK mode.
+                // But child should have been started successfully.
+                OutputAnalyzer outputAnalyzer = ProcessTools.executeCommand(pb);
+                outputAnalyzer.shouldHaveExitValue(12);
+                outputAnalyzer.shouldContain("Child Process");
+                System.exit(0);
+            }
+            case "GRANDPARENT" -> {
+                ProcessBuilder pb = ProcessTools.createLimitedTestJavaProcessBuilder("-Djdk.lang.Process.launchMechanism=VFORK", RejectVFORKMode.class.getName(), "PARENT");
+                OutputAnalyzer outputAnalyzer = ProcessTools.executeCommand(pb);
+                outputAnalyzer.shouldHaveExitValue(0);
+                outputAnalyzer.shouldContain("The VFORK launch mechanism has been removed. Switching to FORK instead.");
+            }
+            default -> throw new RuntimeException("Bad arg");
+        }
+    }
+}
diff --git a/test/jdk/java/lang/ProcessBuilder/childSignalDisposition/TestChildSignalDisposition.java b/test/jdk/java/lang/ProcessBuilder/childSignalDisposition/TestChildSignalDisposition.java
index 50fe054ee34..80b63b765da 100644
--- a/test/jdk/java/lang/ProcessBuilder/childSignalDisposition/TestChildSignalDisposition.java
+++ b/test/jdk/java/lang/ProcessBuilder/childSignalDisposition/TestChildSignalDisposition.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2025, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -39,15 +39,6 @@
  * @run main/othervm/native -Djdk.lang.Process.launchMechanism=fork -agentlib:ChangeSignalDisposition TestChildSignalDisposition
  */
 
-/**
- * @test id=vfork
- * @bug 8364611
- * @summary Check that childs start with SIG_DFL as SIGPIPE disposition
- * @requires os.family == "linux"
- * @library /test/lib
- * @run main/othervm/native -Djdk.lang.Process.launchMechanism=vfork -agentlib:ChangeSignalDisposition TestChildSignalDisposition
- */
-
 import jdk.test.lib.process.OutputAnalyzer;
 import jdk.test.lib.process.ProcessTools;
 public class TestChildSignalDisposition {

From 61df7cc8b91365e487591ec8402e797a25790a79 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Manuel=20H=C3=A4ssig?= <mhaessig@openjdk.org>
Date: Mon, 30 Mar 2026 06:27:30 +0000
Subject: [PATCH 401/655] 8380988: C2: Unexpected node in SuperWord truncation:
 UModI/UDivI

Reviewed-by: epeter, jkarthikeyan
---
 src/hotspot/share/opto/superword.cpp          |  2 +
 .../vectorization/TestSubwordTruncation.java  | 46 ++++++++++++++++++-
 2 files changed, 47 insertions(+), 1 deletion(-)

diff --git a/src/hotspot/share/opto/superword.cpp b/src/hotspot/share/opto/superword.cpp
index d878b2b1d3d..53845a94c1c 100644
--- a/src/hotspot/share/opto/superword.cpp
+++ b/src/hotspot/share/opto/superword.cpp
@@ -2500,7 +2500,9 @@ static bool can_subword_truncate(Node* in, const Type* type) {
   switch (opc) {
   case Op_AbsI:
   case Op_DivI:
+  case Op_UDivI:
   case Op_ModI:
+  case Op_UModI:
   case Op_MinI:
   case Op_MaxI:
   case Op_CMoveI:
diff --git a/test/hotspot/jtreg/compiler/vectorization/TestSubwordTruncation.java b/test/hotspot/jtreg/compiler/vectorization/TestSubwordTruncation.java
index 2f6296e41d2..0a80a59efd4 100644
--- a/test/hotspot/jtreg/compiler/vectorization/TestSubwordTruncation.java
+++ b/test/hotspot/jtreg/compiler/vectorization/TestSubwordTruncation.java
@@ -29,7 +29,7 @@ import compiler.lib.generators.*;
 
 /*
  * @test
- * @bug 8350177 8362171 8369881 8342095
+ * @bug 8350177 8362171 8369881 8342095 8380988
  * @summary Ensure that truncation of subword vectors produces correct results
  * @library /test/lib /
  * @run driver compiler.vectorization.TestSubwordTruncation
@@ -448,6 +448,50 @@ public class TestSubwordTruncation {
         }
     }
 
+    @Test
+    @IR(counts = { IRNode.UMOD_I, ">0" })
+    @Arguments(setup = "setupByteArray")
+    public Object[] testUMod(final byte[] in) {
+        int n = G.next().intValue();
+        for (int i = 1; i < SIZE; i++) {
+            in[i] = (byte) Integer.remainderUnsigned(n, i);
+        }
+
+        return new Object[] { Integer.valueOf(n), in };
+    }
+
+    @Check(test = "testUMod")
+    public void checkTestUMod(Object[] vals) {
+        int n = (Integer) vals[0];
+        byte[] res = (byte[]) vals[1];
+        for (int i = 1; i < SIZE; i++) {
+            byte val = (byte) Integer.remainderUnsigned(n, i);
+            Asserts.assertEQ(res[i], val);
+        }
+    }
+
+    @Test
+    @IR(counts = { IRNode.UDIV_I, ">0" })
+    @Arguments(setup = "setupByteArray")
+    public Object[] testUDiv(final byte[] in) {
+        int n = G.next().intValue();
+        for (int i = 1; i < SIZE; i++) {
+            in[i] = (byte) Integer.divideUnsigned(n, i);
+        }
+
+        return new Object[] { Integer.valueOf(n), in };
+    }
+
+    @Check(test = "testUDiv")
+    public void checkTestUDiv(Object[] vals) {
+        int n = (Integer) vals[0];
+        byte[] res = (byte[]) vals[1];
+        for (int i = 1; i < SIZE; i++) {
+            byte val = (byte) Integer.divideUnsigned(n, i);
+            Asserts.assertEQ(res[i], val);
+        }
+    }
+
     @Test
     @IR(counts = { IRNode.CMP_LT_MASK, ">0" })
     @Arguments(setup = "setupByteArray")

From bbbd5b9984c909773227123ad31b1dd8336df0d9 Mon Sep 17 00:00:00 2001
From: Stefan Johansson <sjohanss@openjdk.org>
Date: Mon, 30 Mar 2026 06:29:43 +0000
Subject: [PATCH 402/655] 8380773: Extend ContainerMemoryUsageEvent to include
 host memory usage

Reviewed-by: mgronlun, tkiriyama, sgehwolf
---
 src/hotspot/share/jfr/jni/jfrJniMethod.cpp               | 9 +++++++++
 src/hotspot/share/jfr/jni/jfrJniMethod.hpp               | 2 ++
 src/hotspot/share/jfr/jni/jfrJniMethodRegistration.cpp   | 1 +
 .../jdk/jfr/events/ContainerMemoryUsageEvent.java        | 5 +++++
 .../share/classes/jdk/jfr/internal/JDKEvents.java        | 1 +
 src/jdk.jfr/share/classes/jdk/jfr/internal/JVM.java      | 6 ++++++
 test/hotspot/jtreg/containers/docker/TestJFREvents.java  | 4 +++-
 7 files changed, 27 insertions(+), 1 deletion(-)

diff --git a/src/hotspot/share/jfr/jni/jfrJniMethod.cpp b/src/hotspot/share/jfr/jni/jfrJniMethod.cpp
index 885484020bd..0183bf634f6 100644
--- a/src/hotspot/share/jfr/jni/jfrJniMethod.cpp
+++ b/src/hotspot/share/jfr/jni/jfrJniMethod.cpp
@@ -410,6 +410,15 @@ JVM_ENTRY_NO_ENV(jlong, jfr_host_total_swap_memory(JNIEnv* env, jclass jvm))
   return static_cast<jlong>(total_swap_space);
 JVM_END
 
+JVM_ENTRY_NO_ENV(jlong, jfr_host_memory_usage(JNIEnv* env, jclass jvm))
+  physical_memory_size_type memory_usage = 0;
+  if (!os::Machine::used_memory(memory_usage)) {
+    // Return -1 to signal failure to get memory usage.
+    return static_cast<jlong>(-1);
+  }
+  return static_cast<jlong>(memory_usage);
+JVM_END
+
 JVM_ENTRY_NO_ENV(void, jfr_emit_data_loss(JNIEnv* env, jclass jvm, jlong bytes))
   EventDataLoss::commit(bytes, min_jlong);
 JVM_END
diff --git a/src/hotspot/share/jfr/jni/jfrJniMethod.hpp b/src/hotspot/share/jfr/jni/jfrJniMethod.hpp
index 9769df57bd3..bcdaf7a99b7 100644
--- a/src/hotspot/share/jfr/jni/jfrJniMethod.hpp
+++ b/src/hotspot/share/jfr/jni/jfrJniMethod.hpp
@@ -163,6 +163,8 @@ jlong JNICALL jfr_host_total_memory(JNIEnv* env, jclass jvm);
 
 jlong JNICALL jfr_host_total_swap_memory(JNIEnv* env, jclass jvm);
 
+jlong JNICALL jfr_host_memory_usage(JNIEnv* env, jclass jvm);
+
 void JNICALL jfr_emit_data_loss(JNIEnv* env, jclass jvm, jlong bytes);
 
 jlong JNICALL jfr_register_stack_filter(JNIEnv* env, jclass jvm, jobjectArray classes, jobjectArray methods);
diff --git a/src/hotspot/share/jfr/jni/jfrJniMethodRegistration.cpp b/src/hotspot/share/jfr/jni/jfrJniMethodRegistration.cpp
index 2979f5c5c2d..0813289e840 100644
--- a/src/hotspot/share/jfr/jni/jfrJniMethodRegistration.cpp
+++ b/src/hotspot/share/jfr/jni/jfrJniMethodRegistration.cpp
@@ -101,6 +101,7 @@ JfrJniMethodRegistration::JfrJniMethodRegistration(JNIEnv* env) {
       (char*)"isContainerized", (char*)"()Z", (void*) jfr_is_containerized,
       (char*)"hostTotalMemory", (char*)"()J", (void*) jfr_host_total_memory,
       (char*)"hostTotalSwapMemory", (char*)"()J", (void*) jfr_host_total_swap_memory,
+      (char*)"hostMemoryUsage", (char*)"()J", (void*) jfr_host_memory_usage,
       (char*)"emitDataLoss", (char*)"(J)V", (void*)jfr_emit_data_loss,
       (char*)"registerStackFilter", (char*)"([Ljava/lang/String;[Ljava/lang/String;)J", (void*)jfr_register_stack_filter,
       (char*)"unregisterStackFilter", (char*)"(J)V", (void*)jfr_unregister_stack_filter,
diff --git a/src/jdk.jfr/share/classes/jdk/jfr/events/ContainerMemoryUsageEvent.java b/src/jdk.jfr/share/classes/jdk/jfr/events/ContainerMemoryUsageEvent.java
index 285952d0c66..9a83877a967 100644
--- a/src/jdk.jfr/share/classes/jdk/jfr/events/ContainerMemoryUsageEvent.java
+++ b/src/jdk.jfr/share/classes/jdk/jfr/events/ContainerMemoryUsageEvent.java
@@ -50,4 +50,9 @@ public final class ContainerMemoryUsageEvent extends AbstractPeriodicEvent {
     @Description("Amount of physical memory and swap space, in bytes, that is currently allocated in the current container")
     @DataAmount
     public long swapMemoryUsage;
+
+    @Label("Host Memory Usage")
+    @Description("Amount of physical memory, in bytes, that is currently allocated in the host system")
+    @DataAmount
+    public long hostMemoryUsage;
 }
diff --git a/src/jdk.jfr/share/classes/jdk/jfr/internal/JDKEvents.java b/src/jdk.jfr/share/classes/jdk/jfr/internal/JDKEvents.java
index 53d40c1e5e1..79bc614545e 100644
--- a/src/jdk.jfr/share/classes/jdk/jfr/internal/JDKEvents.java
+++ b/src/jdk.jfr/share/classes/jdk/jfr/internal/JDKEvents.java
@@ -181,6 +181,7 @@ public final class JDKEvents {
             event.memoryFailCount = containerMetrics.getMemoryFailCount();
             event.memoryUsage = containerMetrics.getMemoryUsage();
             event.swapMemoryUsage = containerMetrics.getMemoryAndSwapUsage();
+            event.hostMemoryUsage = JVM.hostMemoryUsage();
             event.commit();
         }
     }
diff --git a/src/jdk.jfr/share/classes/jdk/jfr/internal/JVM.java b/src/jdk.jfr/share/classes/jdk/jfr/internal/JVM.java
index 24c92e81a4c..2aa7dfd6e97 100644
--- a/src/jdk.jfr/share/classes/jdk/jfr/internal/JVM.java
+++ b/src/jdk.jfr/share/classes/jdk/jfr/internal/JVM.java
@@ -657,6 +657,12 @@ public final class JVM {
      */
     public static native long hostTotalSwapMemory();
 
+    /**
+     * Returns the amount of memory used in the host system whether or not this
+     * JVM runs in a container.
+     */
+    public static native long hostMemoryUsage();
+
     /**
      * Emit a jdk.DataLoss event for the specified amount of bytes.
      *
diff --git a/test/hotspot/jtreg/containers/docker/TestJFREvents.java b/test/hotspot/jtreg/containers/docker/TestJFREvents.java
index d46c422723b..c3112310479 100644
--- a/test/hotspot/jtreg/containers/docker/TestJFREvents.java
+++ b/test/hotspot/jtreg/containers/docker/TestJFREvents.java
@@ -162,6 +162,7 @@ public class TestJFREvents {
         String memoryFailCountFld = "memoryFailCount";
         String memoryUsageFld = "memoryUsage";
         String swapMemoryUsageFld = "swapMemoryUsage";
+        String hostMemoryUsageFld = "hostMemoryUsage";
 
         DockerTestUtils.dockerRunJava(
                                       commonDockerOpts()
@@ -169,7 +170,8 @@ public class TestJFREvents {
             .shouldHaveExitValue(0)
             .shouldContain(memoryFailCountFld)
             .shouldContain(memoryUsageFld)
-            .shouldContain(swapMemoryUsageFld);
+            .shouldContain(swapMemoryUsageFld)
+            .shouldContain(hostMemoryUsageFld);
     }
 
     private static void testIOUsage() throws Exception {

From 0885a0c4c548532e87533467315b48465c8b6e20 Mon Sep 17 00:00:00 2001
From: Prasanta Sadhukhan <psadhukhan@openjdk.org>
Date: Mon, 30 Mar 2026 06:35:55 +0000
Subject: [PATCH 403/655] 4696824: In Metal and other L&F Button.focusInputMap,
 CheckBox.focusInputMap ... are same

Reviewed-by: tr, prr
---
 .../swing/plaf/motif/MotifLookAndFeel.java    | 27 +++++-----------
 .../swing/plaf/metal/MetalLookAndFeel.java    | 32 ++++++++-----------
 2 files changed, 21 insertions(+), 38 deletions(-)

diff --git a/src/java.desktop/share/classes/com/sun/java/swing/plaf/motif/MotifLookAndFeel.java b/src/java.desktop/share/classes/com/sun/java/swing/plaf/motif/MotifLookAndFeel.java
index d254443b8d1..5263d248f45 100644
--- a/src/java.desktop/share/classes/com/sun/java/swing/plaf/motif/MotifLookAndFeel.java
+++ b/src/java.desktop/share/classes/com/sun/java/swing/plaf/motif/MotifLookAndFeel.java
@@ -537,6 +537,10 @@ public class MotifLookAndFeel extends BasicLookAndFeel
 
         @SuppressWarnings("deprecation")
         final int metaMask = KeyEvent.META_MASK;
+        Object commonInputMap = new UIDefaults.LazyInputMap(new Object[] {
+                "SPACE", "pressed",
+                "released SPACE", "released"
+        });
         Object[] defaults = {
 
             "Desktop.background", table.get("desktop"),
@@ -593,20 +597,13 @@ public class MotifLookAndFeel extends BasicLookAndFeel
             "Button.foreground", table.get("controlText"),
             "Button.select", table.get("controlLightShadow"),
             "Button.font", dialogPlain12,
-            "Button.focusInputMap", new UIDefaults.LazyInputMap(new Object[] {
-                          "SPACE", "pressed",
-                 "released SPACE", "released"
-              }),
+            "Button.focusInputMap", commonInputMap,
 
             "CheckBox.textIconGap", 8,
             "CheckBox.margin", new InsetsUIResource(4, 2, 4, 2),
             "CheckBox.icon", checkBoxIcon,
             "CheckBox.focus", table.get("activeCaptionBorder"),
-            "CheckBox.focusInputMap",
-               new UIDefaults.LazyInputMap(new Object[] {
-                            "SPACE", "pressed",
-                   "released SPACE", "released"
-                 }),
+            "CheckBox.focusInputMap", commonInputMap,
 
             "RadioButton.margin", new InsetsUIResource(4, 2, 4, 2),
             "RadioButton.textIconGap", 8,
@@ -615,22 +612,14 @@ public class MotifLookAndFeel extends BasicLookAndFeel
             "RadioButton.icon", radioButtonIcon,
             "RadioButton.focus", table.get("activeCaptionBorder"),
             "RadioButton.icon", radioButtonIcon,
-            "RadioButton.focusInputMap",
-               new UIDefaults.LazyInputMap(new Object[] {
-                          "SPACE", "pressed",
-                 "released SPACE", "released"
-              }),
+            "RadioButton.focusInputMap", commonInputMap,
 
             "ToggleButton.border", toggleButtonBorder,
             "ToggleButton.background", table.get("control"),
             "ToggleButton.foreground", table.get("controlText"),
             "ToggleButton.focus", table.get("controlText"),
             "ToggleButton.select", table.get("controlLightShadow"),
-            "ToggleButton.focusInputMap",
-              new UIDefaults.LazyInputMap(new Object[] {
-                            "SPACE", "pressed",
-                   "released SPACE", "released"
-                }),
+            "ToggleButton.focusInputMap", commonInputMap,
 
             // Menus
             "Menu.border", menuMarginBorder,
diff --git a/src/java.desktop/share/classes/javax/swing/plaf/metal/MetalLookAndFeel.java b/src/java.desktop/share/classes/javax/swing/plaf/metal/MetalLookAndFeel.java
index 7c56c681423..461c597cc5f 100644
--- a/src/java.desktop/share/classes/javax/swing/plaf/metal/MetalLookAndFeel.java
+++ b/src/java.desktop/share/classes/javax/swing/plaf/metal/MetalLookAndFeel.java
@@ -706,6 +706,11 @@ public class MetalLookAndFeel extends BasicLookAndFeel
         // DEFAULTS TABLE
         //
 
+        Object commonInputMap = new UIDefaults.LazyInputMap(new Object[] {
+                "SPACE", "pressed",
+                "released SPACE", "released"
+        });
+
         Object[] defaults = {
             // *** Auditory Feedback
             "AuditoryCues.defaultCueList", defaultCueList,
@@ -791,6 +796,8 @@ public class MetalLookAndFeel extends BasicLookAndFeel
               }),
 
 
+
+
             // Buttons
             "Button.defaultButtonFollowsFocus", Boolean.FALSE,
             "Button.disabledText", inactiveControlTextColor,
@@ -798,10 +805,8 @@ public class MetalLookAndFeel extends BasicLookAndFeel
             "Button.border", buttonBorder,
             "Button.font", controlTextValue,
             "Button.focus", focusColor,
-            "Button.focusInputMap", new UIDefaults.LazyInputMap(new Object[] {
-                          "SPACE", "pressed",
-                 "released SPACE", "released"
-              }),
+            "Button.focusInputMap", commonInputMap,
+
             // Button default margin is (2, 14, 2, 14), defined in
             // BasicLookAndFeel via "Button.margin" UI property.
 
@@ -810,11 +815,8 @@ public class MetalLookAndFeel extends BasicLookAndFeel
             "CheckBox.font", controlTextValue,
             "CheckBox.focus", focusColor,
             "CheckBox.icon",(LazyValue) t -> MetalIconFactory.getCheckBoxIcon(),
-            "CheckBox.focusInputMap",
-               new UIDefaults.LazyInputMap(new Object[] {
-                            "SPACE", "pressed",
-                   "released SPACE", "released"
-                 }),
+            "CheckBox.focusInputMap", commonInputMap,
+
             // margin is 2 all the way around, BasicBorders.RadioButtonBorder
             // (checkbox uses RadioButtonBorder) is 2 all the way around too.
             "CheckBox.totalInsets", new Insets(4, 4, 4, 4),
@@ -824,11 +826,7 @@ public class MetalLookAndFeel extends BasicLookAndFeel
             "RadioButton.icon",(LazyValue) t -> MetalIconFactory.getRadioButtonIcon(),
             "RadioButton.font", controlTextValue,
             "RadioButton.focus", focusColor,
-            "RadioButton.focusInputMap",
-               new UIDefaults.LazyInputMap(new Object[] {
-                          "SPACE", "pressed",
-                 "released SPACE", "released"
-              }),
+            "RadioButton.focusInputMap", commonInputMap,
             // margin is 2 all the way around, BasicBorders.RadioButtonBorder
             // is 2 all the way around too.
             "RadioButton.totalInsets", new Insets(4, 4, 4, 4),
@@ -838,11 +836,7 @@ public class MetalLookAndFeel extends BasicLookAndFeel
             "ToggleButton.focus", focusColor,
             "ToggleButton.border", toggleButtonBorder,
             "ToggleButton.font", controlTextValue,
-            "ToggleButton.focusInputMap",
-              new UIDefaults.LazyInputMap(new Object[] {
-                            "SPACE", "pressed",
-                   "released SPACE", "released"
-                }),
+            "ToggleButton.focusInputMap", commonInputMap,
 
 
             // File View

From 45f9039513d08923e019b50ae5007d9339b9731f Mon Sep 17 00:00:00 2001
From: Matthias Baesken <mbaesken@openjdk.org>
Date: Mon, 30 Mar 2026 06:48:49 +0000
Subject: [PATCH 404/655] 8380030: [AIX] unify dladdr between hotspot and
 libawt

Reviewed-by: dholmes, stuefe, erikj
---
 make/common/modules/LauncherCommon.gmk        | 10 +--
 src/hotspot/os/aix/porting_aix.cpp            |  6 +-
 src/hotspot/os/posix/include/jvm_md.h         | 15 +++-
 .../aix/native/libawt/porting_aix.c           | 87 -------------------
 .../aix/native/libawt/porting_aix.h           | 40 ---------
 .../unix/native/libawt/awt/awt_LoadLibrary.c  |  4 +-
 6 files changed, 26 insertions(+), 136 deletions(-)
 delete mode 100644 src/java.desktop/aix/native/libawt/porting_aix.c
 delete mode 100644 src/java.desktop/aix/native/libawt/porting_aix.h

diff --git a/make/common/modules/LauncherCommon.gmk b/make/common/modules/LauncherCommon.gmk
index 859494861b2..8d45142ef4a 100644
--- a/make/common/modules/LauncherCommon.gmk
+++ b/make/common/modules/LauncherCommon.gmk
@@ -36,16 +36,16 @@ include $(TOPDIR)/make/ToolsJdk.gmk
 
 LAUNCHER_SRC := $(TOPDIR)/src/java.base/share/native/launcher
 
-ifeq ($(call isTargetOs, aix), true)
-  ADD_PLATFORM_INCLUDE_DIR := -I$(TOPDIR)/src/java.base/aix/native/include
-endif
-
 LAUNCHER_CFLAGS += -I$(TOPDIR)/src/java.base/share/native/launcher \
     -I$(TOPDIR)/src/java.base/share/native/libjli \
-    $(ADD_PLATFORM_INCLUDE_DIR) \
     -I$(TOPDIR)/src/java.base/$(OPENJDK_TARGET_OS_TYPE)/native/libjli \
     -I$(TOPDIR)/src/java.base/$(OPENJDK_TARGET_OS)/native/libjli \
     #
+
+ifeq ($(call isTargetOs, aix), true)
+  LAUNCHER_CFLAGS += -I$(TOPDIR)/src/java.base/aix/native/include
+endif
+
 MACOSX_PLIST_DIR := $(TOPDIR)/src/java.base/macosx/native/launcher
 JAVA_MANIFEST := $(TOPDIR)/src/java.base/windows/native/launcher/java.manifest
 
diff --git a/src/hotspot/os/aix/porting_aix.cpp b/src/hotspot/os/aix/porting_aix.cpp
index b3f878fbfdd..f0527136d90 100644
--- a/src/hotspot/os/aix/porting_aix.cpp
+++ b/src/hotspot/os/aix/porting_aix.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2012, 2024 SAP SE. All rights reserved.
+ * Copyright (c) 2012, 2026 SAP SE. All rights reserved.
  * Copyright (c) 2025, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
@@ -426,6 +426,10 @@ int dladdr(void* addr, Dl_info* info) {
 
 }
 
+int JVM_dladdr(void* addr, Dl_info* info) {
+  return dladdr(addr, info);
+}
+
 /////////////////////////////////////////////////////////////////////////////
 // Native callstack dumping
 
diff --git a/src/hotspot/os/posix/include/jvm_md.h b/src/hotspot/os/posix/include/jvm_md.h
index eb8e1f0d7e9..061ef17aaae 100644
--- a/src/hotspot/os/posix/include/jvm_md.h
+++ b/src/hotspot/os/posix/include/jvm_md.h
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1997, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -62,6 +62,19 @@
 #define JVM_X_OK    X_OK
 #define JVM_F_OK    F_OK
 
+#if defined(AIX)
+#include "jni_md.h"
+#include "dl_info.h"
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+JNIEXPORT int JVM_dladdr(void* addr, Dl_info* info);
+#ifdef __cplusplus
+}
+#endif
+#endif
+
 /*
  * File I/O
  */
diff --git a/src/java.desktop/aix/native/libawt/porting_aix.c b/src/java.desktop/aix/native/libawt/porting_aix.c
deleted file mode 100644
index d8688c212d7..00000000000
--- a/src/java.desktop/aix/native/libawt/porting_aix.c
+++ /dev/null
@@ -1,87 +0,0 @@
-/*
- * Copyright (c) 2012, 2026 SAP SE. All rights reserved.
- * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
- *
- * This code is free software; you can redistribute it and/or modify it
- * under the terms of the GNU General Public License version 2 only, as
- * published by the Free Software Foundation.  Oracle designates this
- * particular file as subject to the "Classpath" exception as provided
- * by Oracle in the LICENSE file that accompanied this code.
- *
- * This code is distributed in the hope that it will be useful, but WITHOUT
- * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
- * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
- * version 2 for more details (a copy is included in the LICENSE file that
- * accompanied this code).
- *
- * You should have received a copy of the GNU General Public License version
- * 2 along with this work; if not, write to the Free Software Foundation,
- * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
- *
- * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
- * or visit www.oracle.com if you need additional information or have any
- * questions.
- *
- */
-
-#include <stdio.h>
-#include <string.h>
-#include <sys/ldr.h>
-#include <errno.h>
-
-#include "porting_aix.h"
-
-static unsigned char dladdr_buffer[0x8000];
-
-static void fill_dll_info(void) {
-  int rc = loadquery(L_GETINFO,dladdr_buffer, sizeof(dladdr_buffer));
-  if (rc == -1) {
-    fprintf(stderr, "loadquery failed (%d %s)", errno, strerror(errno));
-    fflush(stderr);
-  }
-}
-
-static int dladdr_dont_reload(void* addr, Dl_info* info) {
-  const struct ld_info* p = (struct ld_info*) dladdr_buffer;
-  memset((void *)info, 0, sizeof(Dl_info));
-  for (;;) {
-    if (addr >= p->ldinfo_textorg &&
-        (char*)addr < (char*)(p->ldinfo_textorg) + p->ldinfo_textsize) {
-      info->dli_fname = p->ldinfo_filename;
-      return 1;
-    }
-    if (!p->ldinfo_next) {
-      break;
-    }
-    p = (struct ld_info*)(((char*)p) + p->ldinfo_next);
-  }
-  return 0;
-}
-
-#ifdef __cplusplus
-extern "C"
-#endif
-int dladdr(void *addr, Dl_info *info) {
-  static int loaded = 0;
-  if (!loaded) {
-    fill_dll_info();
-    loaded = 1;
-  }
-  if (!addr) {
-    return 0;
-  }
-  /* Address could be AIX function descriptor? */
-  void* const addr0 = *( (void**) addr );
-  int rc = dladdr_dont_reload(addr, info);
-  if (rc == 0) {
-    rc = dladdr_dont_reload(addr0, info);
-    if (rc == 0) {
-      fill_dll_info(); /* refill, maybe loadquery info is outdated */
-      rc = dladdr_dont_reload(addr, info);
-      if (rc == 0) {
-        rc = dladdr_dont_reload(addr0, info);
-      }
-    }
-  }
-  return rc;
-}
diff --git a/src/java.desktop/aix/native/libawt/porting_aix.h b/src/java.desktop/aix/native/libawt/porting_aix.h
deleted file mode 100644
index 04d11590915..00000000000
--- a/src/java.desktop/aix/native/libawt/porting_aix.h
+++ /dev/null
@@ -1,40 +0,0 @@
-/*
- * Copyright (c) 2012, 2026 SAP SE. All rights reserved.
- * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
- *
- * This code is free software; you can redistribute it and/or modify it
- * under the terms of the GNU General Public License version 2 only, as
- * published by the Free Software Foundation.  Oracle designates this
- * particular file as subject to the "Classpath" exception as provided
- * by Oracle in the LICENSE file that accompanied this code.
- *
- * This code is distributed in the hope that it will be useful, but WITHOUT
- * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
- * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
- * version 2 for more details (a copy is included in the LICENSE file that
- * accompanied this code).
- *
- * You should have received a copy of the GNU General Public License version
- * 2 along with this work; if not, write to the Free Software Foundation,
- * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
- *
- * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
- * or visit www.oracle.com if you need additional information or have any
- * questions.
- *
- */
-
-/*
- * Aix' own version of dladdr().
- * This function tries to mimic dladdr(3) on Linux
- * (see http://linux.die.net/man/3/dladdr)
- * dladdr(3) is not POSIX but a GNU extension, and is not available on AIX.
- *
- */
-
-#include "dl_info.h"
-
-#ifdef __cplusplus
-extern "C"
-#endif
-int dladdr(void *addr, Dl_info *info);
diff --git a/src/java.desktop/unix/native/libawt/awt/awt_LoadLibrary.c b/src/java.desktop/unix/native/libawt/awt/awt_LoadLibrary.c
index cd07c347c9e..af50fdbb5c0 100644
--- a/src/java.desktop/unix/native/libawt/awt/awt_LoadLibrary.c
+++ b/src/java.desktop/unix/native/libawt/awt/awt_LoadLibrary.c
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2000, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2000, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -36,7 +36,7 @@
 #include <sys/utsname.h>
 
 #ifdef AIX
-#include "porting_aix.h" /* For the 'dladdr' function. */
+#define dladdr JVM_dladdr
 #endif
 
 #ifdef DEBUG

From cd9724565d295e125484fb2933c0479ceabbaabe Mon Sep 17 00:00:00 2001
From: Albert Mingkun Yang <ayang@openjdk.org>
Date: Mon, 30 Mar 2026 08:37:25 +0000
Subject: [PATCH 405/655] 8381205: GHA: Upgrade Node.js 20 to 24

Reviewed-by: erikj
---
 .github/actions/build-jtreg/action.yml    | 6 +++---
 .github/actions/do-build/action.yml       | 4 ++--
 .github/actions/get-bootjdk/action.yml    | 2 +-
 .github/actions/get-bundles/action.yml    | 6 +++---
 .github/actions/get-gtest/action.yml      | 2 +-
 .github/actions/get-jtreg/action.yml      | 2 +-
 .github/actions/get-msys2/action.yml      | 2 +-
 .github/actions/upload-bundles/action.yml | 2 +-
 .github/workflows/build-alpine-linux.yml  | 2 +-
 .github/workflows/build-cross-compile.yml | 4 ++--
 .github/workflows/build-linux.yml         | 2 +-
 .github/workflows/build-macos.yml         | 2 +-
 .github/workflows/build-windows.yml       | 2 +-
 .github/workflows/main.yml                | 2 +-
 .github/workflows/test.yml                | 6 +++---
 15 files changed, 23 insertions(+), 23 deletions(-)

diff --git a/.github/actions/build-jtreg/action.yml b/.github/actions/build-jtreg/action.yml
index a9c046e9dd9..334812e8341 100644
--- a/.github/actions/build-jtreg/action.yml
+++ b/.github/actions/build-jtreg/action.yml
@@ -37,13 +37,13 @@ runs:
 
     - name: 'Check cache for already built JTReg'
       id: get-cached
-      uses: actions/cache@v4
+      uses: actions/cache@v5
       with:
         path: jtreg/installed
         key: jtreg-${{ steps.version.outputs.value }}
 
     - name: 'Checkout the JTReg source'
-      uses: actions/checkout@v4
+      uses: actions/checkout@v6
       with:
         repository: openjdk/jtreg
         ref: jtreg-${{ steps.version.outputs.value }}
@@ -61,7 +61,7 @@ runs:
       if: (steps.get-cached.outputs.cache-hit != 'true')
 
     - name: 'Upload JTReg artifact'
-      uses: actions/upload-artifact@v4
+      uses: actions/upload-artifact@v6
       with:
         name: bundles-jtreg-${{ steps.version.outputs.value }}
         path: jtreg/installed
diff --git a/.github/actions/do-build/action.yml b/.github/actions/do-build/action.yml
index 6f2c2ce0218..6f6bbdabb68 100644
--- a/.github/actions/do-build/action.yml
+++ b/.github/actions/do-build/action.yml
@@ -66,7 +66,7 @@ runs:
       shell: bash
 
     - name: 'Upload build logs'
-      uses: actions/upload-artifact@v4
+      uses: actions/upload-artifact@v6
       with:
         name: failure-logs-${{ inputs.platform }}${{ inputs.debug-suffix }}
         path: failure-logs
@@ -74,7 +74,7 @@ runs:
 
       # This is the best way I found to abort the job with an error message
     - name: 'Notify about build failures'
-      uses: actions/github-script@v7
+      uses: actions/github-script@v8
       with:
         script: core.setFailed('Build failed. See summary for details.')
       if: steps.check.outputs.failure == 'true'
diff --git a/.github/actions/get-bootjdk/action.yml b/.github/actions/get-bootjdk/action.yml
index 312fb642c82..d531358b7dd 100644
--- a/.github/actions/get-bootjdk/action.yml
+++ b/.github/actions/get-bootjdk/action.yml
@@ -65,7 +65,7 @@ runs:
 
     - name: 'Check cache for BootJDK'
       id: get-cached-bootjdk
-      uses: actions/cache@v4
+      uses: actions/cache@v5
       with:
         path: bootjdk/jdk
         key: boot-jdk-${{ inputs.platform }}-${{ steps.sha256.outputs.value }}
diff --git a/.github/actions/get-bundles/action.yml b/.github/actions/get-bundles/action.yml
index a356aa9fd8d..55fa0e842d2 100644
--- a/.github/actions/get-bundles/action.yml
+++ b/.github/actions/get-bundles/action.yml
@@ -54,14 +54,14 @@ runs:
   steps:
     - name: 'Download bundles artifact'
       id: download-bundles
-      uses: actions/download-artifact@v4
+      uses: actions/download-artifact@v8
       with:
         name: bundles-${{ inputs.platform }}${{ inputs.debug-suffix }}
         path: bundles
       continue-on-error: true
 
     - name: 'Download bundles artifact (retry)'
-      uses: actions/download-artifact@v4
+      uses: actions/download-artifact@v8
       with:
         name: bundles-${{ inputs.platform }}${{ inputs.debug-suffix }}
         path: bundles
@@ -69,7 +69,7 @@ runs:
 
     - name: 'Download static bundles artifact'
       id: download-static-bundles
-      uses: actions/download-artifact@v4
+      uses: actions/download-artifact@v8
       with:
         name: bundles-${{ inputs.platform }}${{ inputs.debug-suffix }}${{ inputs.static-suffix }}
         path: bundles
diff --git a/.github/actions/get-gtest/action.yml b/.github/actions/get-gtest/action.yml
index 7a329460a6e..bc53fa2a3b1 100644
--- a/.github/actions/get-gtest/action.yml
+++ b/.github/actions/get-gtest/action.yml
@@ -40,7 +40,7 @@ runs:
         var: GTEST_VERSION
 
     - name: 'Checkout GTest source'
-      uses: actions/checkout@v4
+      uses: actions/checkout@v6
       with:
         repository: google/googletest
         ref: 'v${{ steps.version.outputs.value }}'
diff --git a/.github/actions/get-jtreg/action.yml b/.github/actions/get-jtreg/action.yml
index 36c895fc59d..8c75ae10c7f 100644
--- a/.github/actions/get-jtreg/action.yml
+++ b/.github/actions/get-jtreg/action.yml
@@ -41,7 +41,7 @@ runs:
 
     - name: 'Download JTReg artifact'
       id: download-jtreg
-      uses: actions/download-artifact@v4
+      uses: actions/download-artifact@v8
       with:
         name: bundles-jtreg-${{ steps.version.outputs.value }}
         path: jtreg/installed
diff --git a/.github/actions/get-msys2/action.yml b/.github/actions/get-msys2/action.yml
index 308230ebf2e..7351a120ac4 100644
--- a/.github/actions/get-msys2/action.yml
+++ b/.github/actions/get-msys2/action.yml
@@ -31,7 +31,7 @@ runs:
   steps:
     - name: 'Install MSYS2'
       id: msys2
-      uses: msys2/setup-msys2@v2.28.0
+      uses: msys2/setup-msys2@v2.31.0
       with:
         install: 'autoconf tar unzip zip make'
         path-type: minimal
diff --git a/.github/actions/upload-bundles/action.yml b/.github/actions/upload-bundles/action.yml
index 78fb0a94bfd..94308002ea7 100644
--- a/.github/actions/upload-bundles/action.yml
+++ b/.github/actions/upload-bundles/action.yml
@@ -87,7 +87,7 @@ runs:
       shell: bash
 
     - name: 'Upload bundles artifact'
-      uses: actions/upload-artifact@v4
+      uses: actions/upload-artifact@v6
       with:
         name: bundles-${{ inputs.platform }}${{ inputs.debug-suffix }}${{ inputs.static-suffix }}${{ inputs.bundle-suffix }}
         path: bundles
diff --git a/.github/workflows/build-alpine-linux.yml b/.github/workflows/build-alpine-linux.yml
index c39962fa07f..6863da9016e 100644
--- a/.github/workflows/build-alpine-linux.yml
+++ b/.github/workflows/build-alpine-linux.yml
@@ -74,7 +74,7 @@ jobs:
 
     steps:
       - name: 'Checkout the JDK source'
-        uses: actions/checkout@v4
+        uses: actions/checkout@v6
 
       - name: 'Install toolchain and dependencies'
         run: |
diff --git a/.github/workflows/build-cross-compile.yml b/.github/workflows/build-cross-compile.yml
index a0642d469aa..99b6c40606c 100644
--- a/.github/workflows/build-cross-compile.yml
+++ b/.github/workflows/build-cross-compile.yml
@@ -94,7 +94,7 @@ jobs:
 
     steps:
       - name: 'Checkout the JDK source'
-        uses: actions/checkout@v4
+        uses: actions/checkout@v6
 
       - name: 'Get the BootJDK'
         id: bootjdk
@@ -122,7 +122,7 @@ jobs:
 
       - name: 'Check cache for sysroot'
         id: get-cached-sysroot
-        uses: actions/cache@v4
+        uses: actions/cache@v5
         with:
           path: sysroot
           key: sysroot-${{ matrix.debian-arch }}-${{ hashFiles('./.github/workflows/build-cross-compile.yml') }}
diff --git a/.github/workflows/build-linux.yml b/.github/workflows/build-linux.yml
index 791b53a3f04..c501670439e 100644
--- a/.github/workflows/build-linux.yml
+++ b/.github/workflows/build-linux.yml
@@ -84,7 +84,7 @@ jobs:
 
     steps:
       - name: 'Checkout the JDK source'
-        uses: actions/checkout@v4
+        uses: actions/checkout@v6
 
       - name: 'Get the BootJDK'
         id: bootjdk
diff --git a/.github/workflows/build-macos.yml b/.github/workflows/build-macos.yml
index 484e616fad7..435576f4afd 100644
--- a/.github/workflows/build-macos.yml
+++ b/.github/workflows/build-macos.yml
@@ -75,7 +75,7 @@ jobs:
 
     steps:
       - name: 'Checkout the JDK source'
-        uses: actions/checkout@v4
+        uses: actions/checkout@v6
 
       - name: 'Get the BootJDK'
         id: bootjdk
diff --git a/.github/workflows/build-windows.yml b/.github/workflows/build-windows.yml
index 4dafc016a99..3bb50a137ec 100644
--- a/.github/workflows/build-windows.yml
+++ b/.github/workflows/build-windows.yml
@@ -83,7 +83,7 @@ jobs:
 
     steps:
       - name: 'Checkout the JDK source'
-        uses: actions/checkout@v4
+        uses: actions/checkout@v6
 
       - name: 'Get MSYS2'
         uses: ./.github/actions/get-msys2
diff --git a/.github/workflows/main.yml b/.github/workflows/main.yml
index 85ec75f343c..20be196b128 100644
--- a/.github/workflows/main.yml
+++ b/.github/workflows/main.yml
@@ -75,7 +75,7 @@ jobs:
 
     steps:
       - name: 'Checkout the scripts'
-        uses: actions/checkout@v4
+        uses: actions/checkout@v6
         with:
           sparse-checkout: |
             .github
diff --git a/.github/workflows/test.yml b/.github/workflows/test.yml
index 8f33454305e..b240b42fb97 100644
--- a/.github/workflows/test.yml
+++ b/.github/workflows/test.yml
@@ -128,7 +128,7 @@ jobs:
 
     steps:
       - name: 'Checkout the JDK source'
-        uses: actions/checkout@v4
+        uses: actions/checkout@v6
 
       - name: 'Get MSYS2'
         uses: ./.github/actions/get-msys2
@@ -239,7 +239,7 @@ jobs:
         if: always()
 
       - name: 'Upload test results'
-        uses: actions/upload-artifact@v4
+        uses: actions/upload-artifact@v6
         with:
           path: results
           name: ${{ steps.package.outputs.artifact-name }}
@@ -247,7 +247,7 @@ jobs:
 
         # This is the best way I found to abort the job with an error message
       - name: 'Notify about test failures'
-        uses: actions/github-script@v7
+        uses: actions/github-script@v8
         with:
           script: core.setFailed('${{ steps.run-tests.outputs.error-message }}')
         if: steps.run-tests.outputs.failure == 'true'

From 29e1ee2eccd59e665827e0d42c490261002cf99e Mon Sep 17 00:00:00 2001
From: Martin Doerr <mdoerr@openjdk.org>
Date: Mon, 30 Mar 2026 08:58:21 +0000
Subject: [PATCH 406/655] 8380565: PPC64: deoptimization stub should save
 vector registers

Co-authored-by: Richard Reingruber <rrich@openjdk.org>
Reviewed-by: rrich, dbriemann
---
 src/hotspot/cpu/ppc/registerMap_ppc.cpp       |  46 ++
 src/hotspot/cpu/ppc/registerMap_ppc.hpp       |   8 +-
 src/hotspot/cpu/ppc/sharedRuntime_ppc.cpp     |  27 +-
 src/hotspot/cpu/ppc/vm_version_ppc.cpp        |   3 +-
 .../vectorapi/TestVectorReallocation.java     | 414 ++++++++++++++++++
 5 files changed, 483 insertions(+), 15 deletions(-)
 create mode 100644 src/hotspot/cpu/ppc/registerMap_ppc.cpp
 create mode 100644 test/hotspot/jtreg/compiler/vectorapi/TestVectorReallocation.java

diff --git a/src/hotspot/cpu/ppc/registerMap_ppc.cpp b/src/hotspot/cpu/ppc/registerMap_ppc.cpp
new file mode 100644
index 00000000000..2e7f8af89d3
--- /dev/null
+++ b/src/hotspot/cpu/ppc/registerMap_ppc.cpp
@@ -0,0 +1,46 @@
+/*
+ * Copyright (c) 2021, 2026, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2026 SAP SE. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+#include "runtime/registerMap.hpp"
+
+address RegisterMap::pd_location(VMReg base_reg, int slot_idx) const {
+  if (base_reg->is_VectorRegister()) {
+    // Not all physical slots belonging to a VectorRegister have corresponding
+    // valid VMReg locations in the RegisterMap.
+    // (See RegisterSaver::push_frame_reg_args_and_save_live_registers.)
+    // However, the slots are always saved to the stack in a contiguous region
+    // of memory so we can calculate the address of the upper slots by
+    // offsetting from the base address.
+    assert(base_reg->is_concrete(), "must pass base reg");
+    address base_location = location(base_reg, nullptr);
+    if (base_location != nullptr) {
+      intptr_t offset_in_bytes = slot_idx * VMRegImpl::stack_slot_size;
+      return base_location + offset_in_bytes;
+    } else {
+      return nullptr;
+    }
+  } else {
+    return location(base_reg->next(slot_idx), nullptr);
+  }
+}
diff --git a/src/hotspot/cpu/ppc/registerMap_ppc.hpp b/src/hotspot/cpu/ppc/registerMap_ppc.hpp
index 01eb642107c..607c712d10f 100644
--- a/src/hotspot/cpu/ppc/registerMap_ppc.hpp
+++ b/src/hotspot/cpu/ppc/registerMap_ppc.hpp
@@ -1,6 +1,6 @@
 /*
- * Copyright (c) 2000, 2023, Oracle and/or its affiliates. All rights reserved.
- * Copyright (c) 2012, 2013 SAP SE. All rights reserved.
+ * Copyright (c) 2000, 2026, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2012, 2026 SAP SE. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -35,9 +35,7 @@
   // Since there is none, we just return null.
   address pd_location(VMReg reg) const { return nullptr; }
 
-  address pd_location(VMReg base_reg, int slot_idx) const {
-    return location(base_reg->next(slot_idx), nullptr);
-  }
+  address pd_location(VMReg base_reg, int slot_idx) const;
 
   // no PD state to clear or copy:
   void pd_clear() {}
diff --git a/src/hotspot/cpu/ppc/sharedRuntime_ppc.cpp b/src/hotspot/cpu/ppc/sharedRuntime_ppc.cpp
index 5260ed978ff..53644210415 100644
--- a/src/hotspot/cpu/ppc/sharedRuntime_ppc.cpp
+++ b/src/hotspot/cpu/ppc/sharedRuntime_ppc.cpp
@@ -102,7 +102,7 @@ class RegisterSaver {
 
   // During deoptimization only the result registers need to be restored
   // all the other values have already been extracted.
-  static void restore_result_registers(MacroAssembler* masm, int frame_size_in_bytes);
+  static void restore_result_registers(MacroAssembler* masm, int frame_size_in_bytes, bool save_vectors);
 
   // Constants and data structures:
 
@@ -349,7 +349,7 @@ OopMap* RegisterSaver::push_frame_reg_args_and_save_live_registers(MacroAssemble
   }
 
   // Note that generate_oop_map in the following loop is only used for the
-  // polling_page_vectors_safepoint_handler_blob.
+  // polling_page_vectors_safepoint_handler_blob and the deopt_blob.
   // The order in which the vector contents are stored depends on Endianess and
   // the utilized instructions (PowerArchitecturePPC64).
   assert(is_aligned(offset, StackAlignmentInBytes), "should be");
@@ -361,6 +361,7 @@ OopMap* RegisterSaver::push_frame_reg_args_and_save_live_registers(MacroAssemble
 
       __ stxvp(as_VectorRegister(reg_num).to_vsr(), offset, R1_SP);
       // Note: The contents were read in the same order (see loadV16_Power9 node in ppc.ad).
+      // RegisterMap::pd_location only uses the first VMReg for each VectorRegister.
       if (generate_oop_map) {
         map->set_callee_saved(VMRegImpl::stack2reg(offset >> 2),
                               RegisterSaver_LiveVecRegs[i LITTLE_ENDIAN_ONLY(+1) ].vmreg);
@@ -380,6 +381,7 @@ OopMap* RegisterSaver::push_frame_reg_args_and_save_live_registers(MacroAssemble
         __ stxvd2x(as_VectorRegister(reg_num)->to_vsr(), R31, R1_SP);
       }
       // Note: The contents were read in the same order (see loadV16_Power8 / loadV16_Power9 node in ppc.ad).
+      // RegisterMap::pd_location only uses the first VMReg for each VectorRegister.
       if (generate_oop_map) {
         VMReg vsr = RegisterSaver_LiveVecRegs[i].vmreg;
         map->set_callee_saved(VMRegImpl::stack2reg(offset >> 2), vsr);
@@ -566,10 +568,14 @@ void RegisterSaver::restore_argument_registers_and_pop_frame(MacroAssembler*masm
 }
 
 // Restore the registers that might be holding a result.
-void RegisterSaver::restore_result_registers(MacroAssembler* masm, int frame_size_in_bytes) {
+void RegisterSaver::restore_result_registers(MacroAssembler* masm, int frame_size_in_bytes, bool save_vectors) {
   const int regstosave_num       = sizeof(RegisterSaver_LiveRegs) /
                                    sizeof(RegisterSaver::LiveRegType);
-  const int register_save_size   = regstosave_num * reg_size; // VS registers not relevant here.
+  const int vecregstosave_num    = save_vectors ? (sizeof(RegisterSaver_LiveVecRegs) /
+                                                   sizeof(RegisterSaver::LiveRegType))
+                                                : 0;
+  const int register_save_size   = regstosave_num * reg_size + vecregstosave_num * vec_reg_size;
+
   const int register_save_offset = frame_size_in_bytes - register_save_size;
 
   // restore all result registers (ints and floats)
@@ -598,7 +604,7 @@ void RegisterSaver::restore_result_registers(MacroAssembler* masm, int frame_siz
     offset += reg_size;
   }
 
-  assert(offset == frame_size_in_bytes, "consistency check");
+  assert(offset == frame_size_in_bytes - (save_vectors ? vecregstosave_num * vec_reg_size : 0), "consistency check");
 }
 
 // Is vector's size (in bytes) bigger than a size saved by default?
@@ -2909,7 +2915,8 @@ void SharedRuntime::generate_deopt_blob() {
   map = RegisterSaver::push_frame_reg_args_and_save_live_registers(masm,
                                                                    &first_frame_size_in_bytes,
                                                                    /*generate_oop_map=*/ true,
-                                                                   RegisterSaver::return_pc_is_lr);
+                                                                   RegisterSaver::return_pc_is_lr,
+                                                                   /*save_vectors*/ SuperwordUseVSX);
   assert(map != nullptr, "OopMap must have been created");
 
   __ li(exec_mode_reg, Deoptimization::Unpack_deopt);
@@ -2943,7 +2950,8 @@ void SharedRuntime::generate_deopt_blob() {
   RegisterSaver::push_frame_reg_args_and_save_live_registers(masm,
                                                              &first_frame_size_in_bytes,
                                                              /*generate_oop_map=*/ false,
-                                                             RegisterSaver::return_pc_is_pre_saved);
+                                                             RegisterSaver::return_pc_is_pre_saved,
+                                                             /*save_vectors*/ SuperwordUseVSX);
 
   // Deopt during an exception. Save exec mode for unpack_frames.
   __ li(exec_mode_reg, Deoptimization::Unpack_exception);
@@ -2958,7 +2966,8 @@ void SharedRuntime::generate_deopt_blob() {
   RegisterSaver::push_frame_reg_args_and_save_live_registers(masm,
                                                              &first_frame_size_in_bytes,
                                                              /*generate_oop_map=*/ false,
-                                                             RegisterSaver::return_pc_is_pre_saved);
+                                                             RegisterSaver::return_pc_is_pre_saved,
+                                                             /*save_vectors*/ SuperwordUseVSX);
   __ li(exec_mode_reg, Deoptimization::Unpack_reexecute);
 #endif
 
@@ -2984,7 +2993,7 @@ void SharedRuntime::generate_deopt_blob() {
 
   // Restore only the result registers that have been saved
   // by save_volatile_registers(...).
-  RegisterSaver::restore_result_registers(masm, first_frame_size_in_bytes);
+  RegisterSaver::restore_result_registers(masm, first_frame_size_in_bytes, /*save_vectors*/ SuperwordUseVSX);
 
   // reload the exec mode from the UnrollBlock (it might have changed)
   __ lwz(exec_mode_reg, in_bytes(Deoptimization::UnrollBlock::unpack_kind_offset()), unroll_block_reg);
diff --git a/src/hotspot/cpu/ppc/vm_version_ppc.cpp b/src/hotspot/cpu/ppc/vm_version_ppc.cpp
index e471f5a6e4f..0b69ef7d25a 100644
--- a/src/hotspot/cpu/ppc/vm_version_ppc.cpp
+++ b/src/hotspot/cpu/ppc/vm_version_ppc.cpp
@@ -25,6 +25,7 @@
 
 #include "asm/assembler.inline.hpp"
 #include "asm/macroAssembler.inline.hpp"
+#include "compiler/compilerDefinitions.inline.hpp"
 #include "compiler/disassembler.hpp"
 #include "jvm.h"
 #include "memory/resourceArea.hpp"
@@ -105,7 +106,7 @@ void VM_Version::initialize() {
 
   if (PowerArchitecturePPC64 >= 9) {
     // Performance is good since Power9.
-    if (FLAG_IS_DEFAULT(SuperwordUseVSX)) {
+    if (FLAG_IS_DEFAULT(SuperwordUseVSX) && CompilerConfig::is_c2_enabled()) {
       FLAG_SET_ERGO(SuperwordUseVSX, true);
     }
   }
diff --git a/test/hotspot/jtreg/compiler/vectorapi/TestVectorReallocation.java b/test/hotspot/jtreg/compiler/vectorapi/TestVectorReallocation.java
new file mode 100644
index 00000000000..1bdc6ea726d
--- /dev/null
+++ b/test/hotspot/jtreg/compiler/vectorapi/TestVectorReallocation.java
@@ -0,0 +1,414 @@
+/*
+ * Copyright (c) 2026 SAP SE. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ *
+ */
+
+package compiler.vectorapi;
+
+import java.util.Arrays;
+
+import compiler.lib.ir_framework.*;
+
+import jdk.incubator.vector.ByteVector;
+import jdk.incubator.vector.ShortVector;
+import jdk.incubator.vector.IntVector;
+import jdk.incubator.vector.LongVector;
+import jdk.incubator.vector.FloatVector;
+import jdk.incubator.vector.DoubleVector;
+import jdk.incubator.vector.VectorSpecies;
+
+import static jdk.test.lib.Asserts.*;
+
+/**
+ * @test
+ * @bug 8380565
+ * @library /test/lib /
+ * @summary Test deoptimization involving vector reallocation
+ * @modules jdk.incubator.vector
+ * @requires vm.opt.final.MaxVectorSize == null | vm.opt.final.MaxVectorSize >= 16
+ *
+ * @run driver compiler.vectorapi.TestVectorReallocation
+ */
+
+public class TestVectorReallocation {
+
+    private static final VectorSpecies<Byte>    B_SPECIES = ByteVector.SPECIES_PREFERRED;
+    private static final VectorSpecies<Short>   S_SPECIES = ShortVector.SPECIES_PREFERRED;
+    private static final VectorSpecies<Integer> I_SPECIES = IntVector.SPECIES_PREFERRED;
+    private static final VectorSpecies<Long>    L_SPECIES = LongVector.SPECIES_PREFERRED;
+    private static final VectorSpecies<Float>   F_SPECIES = FloatVector.SPECIES_PREFERRED;
+    private static final VectorSpecies<Double>  D_SPECIES = DoubleVector.SPECIES_PREFERRED;
+    private static final int B_LENGTH = B_SPECIES.length();
+    private static final int S_LENGTH = S_SPECIES.length();
+    private static final int I_LENGTH = I_SPECIES.length();
+    private static final int L_LENGTH = L_SPECIES.length();
+    private static final int F_LENGTH = F_SPECIES.length();
+    private static final int D_LENGTH = D_SPECIES.length();
+
+    // The input arrays for the @Test methods match the length of the preferred species for each type
+    private static byte[]   b_a;
+    private static short[]  s_a;
+    private static int[]    i_a;
+    private static long[]   l_a;
+    private static float[]  f_a;
+    private static double[] d_a;
+
+    // The output arrays for the @Test methods
+    private static byte[]   b_r;
+    private static short[]  s_r;
+    private static int[]    i_r;
+    private static long[]   l_r;
+    private static float[]  f_r;
+    private static double[] d_r;
+
+    public static void main(String[] args) {
+        TestFramework.runWithFlags("--add-modules=jdk.incubator.vector");
+    }
+
+    // The test methods annotated with @Test are warmed up by the framework. The calls are indirect
+    // through the runner methods annotated with @Run. Note that each @Test method has its own instance of
+    // the test class TestVectorReallocation as receiver of the calls.
+    //
+    // The @Test methods just copy the elements of the input array (0, 1, 2, 3, ...) to the output array
+    // by means of a vector add operation. The added value is computed but actually always zero. The
+    // computation is done in a loop with a virtual call that is inlined based on class hierarchy analysis
+    // when the method gets compiled.
+    //
+    // The final call after warmup of the now compiled @Test method is performed concurrently in a second
+    // thread. Before the variable `loopIterations` is set very high such that the loop runs practically
+    // infinitely. While the loop is running, a class with an overridden version of the method `value`
+    // (called in the loop) is loaded. This invalidates the result of the class hierarchy analysis that
+    // there is just one implementation of the method and causes deoptimization where the vector `v0` used
+    // in the @Test method is reallocated from a register to the java heap. Finally it is verified that
+    // input and ouput arrays are equal.
+    //
+    // NB: each @Test needs its own Zero class for the desired result of the class hierarchy analysis.
+
+    volatile boolean enteredLoop;
+    volatile long loopIterations;
+
+    void sharedRunner(RunInfo runInfo, Runnable test, Runnable loadOverridingClass, Runnable verify) {
+        enteredLoop = false;
+        if (runInfo.isWarmUp()) {
+            loopIterations = 100;
+            test.run();
+        } else {
+            loopIterations = 1L << 60; // basically infinite
+            Thread t = Thread.ofPlatform().start(test);
+            waitUntilLoopEntered();
+            loadOverridingClass.run(); // invalidates inlining causing deoptimization/reallocation of v0
+            loopIterations = 0;
+            waitUntilLoopLeft();
+            joinThread(t);
+            verify.run();              // verify that input and ouput arrays are equal
+        }
+    }
+
+    /////////////////////////////////////////////////////////////////////////////////////
+    // byte
+
+    static class ByteZero {
+        volatile byte zero;
+        byte value() {
+            return zero;
+        }
+    }
+    volatile ByteZero byteZero = new ByteZero();
+
+    @Run(test = "byteIdentityWithReallocation")
+    void byteIdentityWithReallocation_runner(RunInfo runInfo) {
+        sharedRunner(runInfo, () -> byteIdentityWithReallocation(), () -> {
+            // Loading the class with the overridden method will cause deoptimization and reallocation of v0
+            byteZero = new ByteZero() {
+                    @Override
+                    byte value() {
+                        return super.value(); // override but doing the same
+                    }
+                };
+            },
+            () -> assertTrue(Arrays.equals(b_a, b_r), "Input/Output arrays differ"));
+    }
+
+    @Test
+    @IR(counts = {IRNode.ADD_VB, " >0 "})
+    void byteIdentityWithReallocation() {
+        ByteVector v0 = ByteVector.fromArray(B_SPECIES, b_a, 0);
+        byte zeroSum = 0;
+        enteredLoop = true;
+        for (long i = 0; i < loopIterations; i++) {
+            zeroSum += byteZero.value(); // inlined based on class hierarchy analysis
+        }
+        v0.add(zeroSum).intoArray(b_r, 0);
+        enteredLoop = false;
+    }
+
+    /////////////////////////////////////////////////////////////////////////////////////
+    // short
+
+    static class ShortZero {
+        volatile short zero;
+        short value() {
+            return zero;
+        }
+    }
+    volatile ShortZero shortZero = new ShortZero();
+
+    @Run(test = "shortIdentityWithReallocation")
+    void shortIdentityWithReallocation_runner(RunInfo runInfo) {
+        sharedRunner(runInfo, () -> shortIdentityWithReallocation(), () -> {
+            // Loading the class with the overridden method will cause deoptimization and reallocation of v0
+            shortZero = new ShortZero() {
+                    @Override
+                    short value() {
+                        return super.value(); // override but doing the same
+                    }
+                };
+            },
+            () -> assertTrue(Arrays.equals(s_a, s_r), "Input/Output arrays differ"));
+    }
+
+    @Test
+    @IR(counts = {IRNode.ADD_VS, " >0 "})
+    void shortIdentityWithReallocation() {
+        ShortVector v0 = ShortVector.fromArray(S_SPECIES, s_a, 0);
+        short zeroSum = 0;
+        enteredLoop = true;
+        for (long i = 0; i < loopIterations; i++) {
+            zeroSum += shortZero.value(); // inlined based on class hierarchy analysis
+        }
+        v0.add(zeroSum).intoArray(s_r, 0);
+        enteredLoop = false;
+    }
+
+    /////////////////////////////////////////////////////////////////////////////////////
+    // int
+
+    static class IntZero {
+        volatile int zero;
+        int value() {
+            return zero;
+        }
+    }
+    volatile IntZero intZero = new IntZero();
+
+    @Run(test = "intIdentityWithReallocation")
+    void intIdentityWithReallocation_runner(RunInfo runInfo) {
+        sharedRunner(runInfo, () -> intIdentityWithReallocation(), () -> {
+            // Loading the class with the overridden method will cause deoptimization and reallocation of v0
+            intZero = new IntZero() {
+                    @Override
+                    int value() {
+                        return super.value(); // override but doing the same
+                    }
+                };
+            },
+            () -> assertTrue(Arrays.equals(i_a, i_r), "Input/Output arrays differ"));
+    }
+
+    @Test
+    @IR(counts = {IRNode.ADD_VI, " >0 "})
+    void intIdentityWithReallocation() {
+        IntVector v0 = IntVector.fromArray(I_SPECIES, i_a, 0);
+        int zeroSum = 0;
+        enteredLoop = true;
+        for (long i = 0; i < loopIterations; i++) {
+            zeroSum += intZero.value(); // inlined based on class hierarchy analysis
+        }
+        v0.add(zeroSum).intoArray(i_r, 0);
+        enteredLoop = false;
+    }
+
+    /////////////////////////////////////////////////////////////////////////////////////
+    // long
+
+    static class LongZero {
+        volatile long zero;
+        long value() {
+            return zero;
+        }
+    }
+    volatile LongZero longZero = new LongZero();
+
+    @Run(test = "longIdentityWithReallocation")
+    void longIdentityWithReallocation_runner(RunInfo runInfo) {
+        sharedRunner(runInfo, () -> longIdentityWithReallocation(), () -> {
+            // Loading the class with the overridden method will cause deoptimization and reallocation of v0
+            longZero = new LongZero() {
+                    @Override
+                    long value() {
+                        return super.value(); // override but doing the same
+                    }
+                };
+            },
+            () -> assertTrue(Arrays.equals(l_a, l_r), "Input/Output arrays differ"));
+    }
+
+    @Test
+    @IR(counts = {IRNode.ADD_VL, " >0 "})
+    void longIdentityWithReallocation() {
+        LongVector v0 = LongVector.fromArray(L_SPECIES, l_a, 0);
+        long zeroSum = 0;
+        enteredLoop = true;
+        for (long i = 0; i < loopIterations; i++) {
+            zeroSum += longZero.value(); // inlined based on class hierarchy analysis
+        }
+        v0.add(zeroSum).intoArray(l_r, 0);
+        enteredLoop = false;
+    }
+
+    /////////////////////////////////////////////////////////////////////////////////////
+    // float
+
+    static class FloatZero {
+        volatile float zero;
+        float value() {
+            return zero;
+        }
+    }
+    volatile FloatZero floatZero = new FloatZero();
+
+    @Run(test = "floatIdentityWithReallocation")
+    void floatIdentityWithReallocation_runner(RunInfo runInfo) {
+        sharedRunner(runInfo, () -> floatIdentityWithReallocation(), () -> {
+            // Loading the class with the overridden method will cause deoptimization and reallocation of v0
+            floatZero = new FloatZero() {
+                    @Override
+                    float value() {
+                        return super.value(); // override but doing the same
+                    }
+                };
+            },
+            () -> assertTrue(Arrays.equals(f_a, f_r), "Input/Output arrays differ"));
+    }
+
+    @Test
+    @IR(counts = {IRNode.ADD_VF, " >0 "})
+    void floatIdentityWithReallocation() {
+        FloatVector v0 = FloatVector.fromArray(F_SPECIES, f_a, 0);
+        float zeroSum = 0;
+        enteredLoop = true;
+        for (long i = 0; i < loopIterations; i++) {
+            zeroSum += floatZero.value(); // inlined based on class hierarchy analysis
+        }
+        v0.add(zeroSum).intoArray(f_r, 0);
+        enteredLoop = false;
+    }
+
+    /////////////////////////////////////////////////////////////////////////////////////
+    // double
+
+    static class DoubleZero {
+        volatile double zero;
+        double value() {
+            return zero;
+        }
+    }
+    volatile DoubleZero doubleZero = new DoubleZero();
+
+    @Run(test = "doubleIdentityWithReallocation")
+    void doubleIdentityWithReallocation_runner(RunInfo runInfo) {
+        sharedRunner(runInfo, () -> doubleIdentityWithReallocation(), () -> {
+            // Loading the class with the overridden method will cause deoptimization and reallocation of v0
+            doubleZero = new DoubleZero() {
+                    @Override
+                    double value() {
+                        return super.value(); // override but doing the same
+                    }
+                };
+            },
+            () -> assertTrue(Arrays.equals(d_a, d_r), "Input/Output arrays differ"));
+    }
+
+    @Test
+    @IR(counts = {IRNode.ADD_VD, " >0 "})
+    void doubleIdentityWithReallocation() {
+        DoubleVector v0 = DoubleVector.fromArray(D_SPECIES, d_a, 0);
+        double zeroSum = 0;
+        enteredLoop = true;
+        for (long i = 0; i < loopIterations; i++) {
+            zeroSum += doubleZero.value(); // inlined based on class hierarchy analysis
+        }
+        v0.add(zeroSum).intoArray(d_r, 0);
+        enteredLoop = false;
+    }
+
+    /////////////////////////////////////////////////////////////////////////////////////
+
+    private void waitUntilLoopEntered() {
+        while (!enteredLoop) {
+            sleep(10);
+        }
+    }
+
+    private void waitUntilLoopLeft() {
+        while (enteredLoop) {
+            sleep(10);
+        }
+    }
+
+    private static void sleep(int ms) {
+        try {
+            Thread.sleep(ms);
+        } catch (InterruptedException e) { /* ignore */ }
+    }
+
+    private static void joinThread(Thread t) {
+        try {
+            t.join();
+        } catch (InterruptedException e) { /* ignore */ }
+    }
+
+    static {
+        b_a = new byte[B_LENGTH];
+        s_a = new short[S_LENGTH];
+        i_a = new int[I_LENGTH];
+        l_a = new long[L_LENGTH];
+        f_a = new float[F_LENGTH];
+        d_a = new double[D_LENGTH];
+
+        b_r = new byte[B_LENGTH];
+        s_r = new short[S_LENGTH];
+        i_r = new int[I_LENGTH];
+        l_r = new long[L_LENGTH];
+        f_r = new float[F_LENGTH];
+        d_r = new double[D_LENGTH];
+
+        for (int i = 0; i < b_a.length ; i++) {
+            b_a[i] = (byte)i;
+        }
+        for (int i = 0; i < s_a.length ; i++) {
+            s_a[i] = (short)i;
+        }
+        for (int i = 0; i < i_a.length ; i++) {
+            i_a[i] = i;
+        }
+        for (int i = 0; i < l_a.length ; i++) {
+            l_a[i] = i;
+        }
+        for (int i = 0; i < f_a.length ; i++) {
+            f_a[i] = i;
+        }
+        for (int i = 0; i < d_a.length ; i++) {
+            d_a[i] = i;
+        }
+    }
+}

From 4d7c13950954950201834e9d4afebdd36a522a81 Mon Sep 17 00:00:00 2001
From: Casper Norrbin <cnorrbin@openjdk.org>
Date: Mon, 30 Mar 2026 09:28:51 +0000
Subject: [PATCH 407/655] 8379415: Contended classes can leave unused alignment
 padding

Reviewed-by: coleenp, fparain, lfoltan, liach
---
 .../share/classfile/fieldLayoutBuilder.cpp    |  24 +-
 .../share/classfile/fieldLayoutBuilder.hpp    |   4 +-
 .../runtime/contended/MixedPrimitives.java    | 356 ++++++++++++++++++
 3 files changed, 376 insertions(+), 8 deletions(-)
 create mode 100644 test/hotspot/jtreg/runtime/contended/MixedPrimitives.java

diff --git a/src/hotspot/share/classfile/fieldLayoutBuilder.cpp b/src/hotspot/share/classfile/fieldLayoutBuilder.cpp
index a87e12edc96..8a9f5946091 100644
--- a/src/hotspot/share/classfile/fieldLayoutBuilder.cpp
+++ b/src/hotspot/share/classfile/fieldLayoutBuilder.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2020, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -596,11 +596,13 @@ void FieldLayoutBuilder::regular_field_sorting() {
   }
 }
 
-void FieldLayoutBuilder::insert_contended_padding(LayoutRawBlock* slot) {
+LayoutRawBlock* FieldLayoutBuilder::insert_contended_padding(LayoutRawBlock* slot) {
+  LayoutRawBlock* padding = nullptr;
   if (ContendedPaddingWidth > 0) {
-    LayoutRawBlock* padding = new LayoutRawBlock(LayoutRawBlock::PADDING, ContendedPaddingWidth);
+    padding = new LayoutRawBlock(LayoutRawBlock::PADDING, ContendedPaddingWidth);
     _layout->insert(slot, padding);
   }
+  return padding;
 }
 
 // Computation of regular classes layout is an evolution of the previous default layout
@@ -620,10 +622,14 @@ void FieldLayoutBuilder::compute_regular_layout() {
   regular_field_sorting();
 
   if (_is_contended) {
-    _layout->set_start(_layout->last_block());
     // insertion is currently easy because the current strategy doesn't try to fill holes
     // in super classes layouts => the _start block is by consequence the _last_block
-    insert_contended_padding(_layout->start());
+    _layout->set_start(_layout->last_block());
+    LayoutRawBlock* padding = insert_contended_padding(_layout->start());
+    if (padding != nullptr) {
+      // Setting the padding block as start ensures we do not insert past it.
+      _layout->set_start(padding);
+    }
     need_tail_padding = true;
   }
 
@@ -639,7 +645,13 @@ void FieldLayoutBuilder::compute_regular_layout() {
     for (int i = 0; i < _contended_groups.length(); i++) {
       FieldGroup* cg = _contended_groups.at(i);
       LayoutRawBlock* start = _layout->last_block();
-      insert_contended_padding(start);
+      LayoutRawBlock* padding = insert_contended_padding(start);
+
+      // Do not insert fields past the padding block.
+      if (padding != nullptr) {
+        start = padding;
+      }
+
       _layout->add(cg->primitive_fields(), start);
       _layout->add(cg->oop_fields(), start);
       need_tail_padding = true;
diff --git a/src/hotspot/share/classfile/fieldLayoutBuilder.hpp b/src/hotspot/share/classfile/fieldLayoutBuilder.hpp
index 82bbaefc623..eab0b7d08a9 100644
--- a/src/hotspot/share/classfile/fieldLayoutBuilder.hpp
+++ b/src/hotspot/share/classfile/fieldLayoutBuilder.hpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2020, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -250,7 +250,7 @@ class FieldLayoutBuilder : public ResourceObj {
 
   void build_layout();
   void compute_regular_layout();
-  void insert_contended_padding(LayoutRawBlock* slot);
+  LayoutRawBlock* insert_contended_padding(LayoutRawBlock* slot);
 
  private:
   void prologue();
diff --git a/test/hotspot/jtreg/runtime/contended/MixedPrimitives.java b/test/hotspot/jtreg/runtime/contended/MixedPrimitives.java
new file mode 100644
index 00000000000..a7165578831
--- /dev/null
+++ b/test/hotspot/jtreg/runtime/contended/MixedPrimitives.java
@@ -0,0 +1,356 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+import java.lang.Class;
+import java.lang.reflect.Field;
+import java.lang.reflect.Modifier;
+import jdk.internal.misc.Unsafe;
+import jdk.internal.vm.annotation.Contended;
+
+/*
+ * @test
+ * @summary \@Contended with different sized primitive types
+ * @modules java.base/jdk.internal.misc
+ * @modules java.base/jdk.internal.vm.annotation
+ * @run main/othervm -XX:-RestrictContended MixedPrimitives
+ */
+public class MixedPrimitives {
+
+    private static final Unsafe U = Unsafe.getUnsafe();
+    private static final int ADDRESS_SIZE;
+    private static final int HEADER_SIZE;
+
+    static {
+        // When running with CompressedOops on 64-bit platform, the address size
+        // reported by Unsafe is still 8, while the real reference fields are 4 bytes long.
+        // Try to guess the reference field size with this naive trick.
+        try {
+            long off1 = U.objectFieldOffset(CompressedOopsClass.class.getField("obj1"));
+            long off2 = U.objectFieldOffset(CompressedOopsClass.class.getField("obj2"));
+            ADDRESS_SIZE = (int) Math.abs(off2 - off1);
+            HEADER_SIZE = (int) Math.min(off1, off2);
+        } catch (NoSuchFieldException e) {
+            throw new ExceptionInInitializerError(e);
+        }
+    }
+
+    static class CompressedOopsClass {
+        public Object obj1;
+        public Object obj2;
+    }
+
+    public static boolean arePaddedPairwise(Class klass, String field1, String field2) throws Exception {
+        Field f1 = klass.getDeclaredField(field1);
+        Field f2 = klass.getDeclaredField(field2);
+
+        if (isStatic(f1) != isStatic(f2)) {
+            return true; // these guys are in naturally disjoint locations
+        }
+
+        int diff = offset(f1) - offset(f2);
+        if (diff < 0) {
+            // f1 is first
+            return (offset(f2) - (offset(f1) + getSize(f1))) > 64;
+        } else {
+            // f2 is first
+            return (offset(f1) - (offset(f2) + getSize(f2))) > 64;
+        }
+    }
+
+    public static boolean isPadded(Class klass, String field1) throws Exception {
+        Field f1 = klass.getDeclaredField(field1);
+
+        if (isStatic(f1)) {
+            return offset(f1) > 128 + 64;
+        }
+
+        return offset(f1) > 64;
+    }
+
+    public static boolean sameLayout(Class klass1, Class klass2) throws Exception {
+        try {
+            for (Field f1 : klass1.getDeclaredFields()) {
+                Field f2 = klass2.getDeclaredField(f1.getName());
+                if (offset(f1) != offset(f2)) {
+                    return false;
+                }
+            }
+
+            for (Field f2 : klass1.getDeclaredFields()) {
+                Field f1 = klass2.getDeclaredField(f2.getName());
+                if (offset(f1) != offset(f2)) {
+                    return false;
+                }
+            }
+        } catch (Exception e) {
+            System.err.println("Failed getting layout from class: " + e.getMessage());
+            return false;
+        }
+
+        return true;
+    }
+
+    public static boolean isStatic(Field field) {
+        return Modifier.isStatic(field.getModifiers());
+    }
+
+    public static int offset(Field field) {
+        if (isStatic(field)) {
+            return (int) U.staticFieldOffset(field);
+        } else {
+            return (int) U.objectFieldOffset(field);
+        }
+    }
+
+    public static int getSize(Field field) {
+        Class type = field.getType();
+        if (type == byte.class)    { return 1; }
+        if (type == boolean.class) { return 1; }
+        if (type == short.class)   { return 2; }
+        if (type == char.class)    { return 2; }
+        if (type == int.class)     { return 4; }
+        if (type == float.class)   { return 4; }
+        if (type == long.class)    { return 8; }
+        if (type == double.class)  { return 8; }
+        return ADDRESS_SIZE;
+    }
+
+    public static void main(String[] args) throws Exception {
+        int failures = 0;
+
+        failures += Test1.checkLayout();
+        failures += Test2.checkLayout();
+        failures += Test3.checkLayout();
+        failures += Test4.checkLayout();
+        failures += Test5.checkLayout();
+        failures += Test6.checkLayout();
+        failures += Test7.checkLayout();
+        failures += Test8.checkLayout();
+        failures += Test9.checkLayout();
+
+        if (!sameLayout(Test4.class, Test7.class)) {
+            System.err.println("Test4 and Test7 have different layouts");
+            failures += 1;
+        }
+
+        if (!sameLayout(Test5.class, Test6.class)) {
+            System.err.println("Test5 and Test6 have different layouts");
+            failures += 1;
+        }
+
+        if (!sameLayout(Test8.class, Test9.class)) {
+            System.err.println("Test8 and Test9 have different layouts");
+            failures += 1;
+        }
+
+        System.out.println(failures == 0 ? "Test PASSES" : "Test FAILS");
+        if (failures > 0) {
+           throw new Error("Test failed. Incurred " + failures + " failures.");
+        }
+    }
+
+    // naturally packed
+    public static class Test1 {
+                                 private long long1;
+                                 private int int1;
+                                 private short short1;
+
+        public static int checkLayout() throws Exception {
+            if (arePaddedPairwise(Test1.class, "long1", "int1") ||
+                    arePaddedPairwise(Test1.class, "long1", "short1") ||
+                    arePaddedPairwise(Test1.class, "int1", "short1") ||
+                    isPadded(Test1.class, "long1") ||
+                    isPadded(Test1.class, "int1") ||
+                    isPadded(Test1.class, "short1")) {
+                System.err.println("Test1 failed");
+                return 1;
+            }
+            return 0;
+        }
+    }
+
+    // long1 is padded
+    public static class Test2 {
+        @Contended               private long long1;
+                                 private int int1;
+                                 private short short1;
+
+        public static int checkLayout() throws Exception {
+            if (!arePaddedPairwise(Test2.class, "long1", "int1") ||
+                    !arePaddedPairwise(Test2.class, "long1", "short1") ||
+                    arePaddedPairwise(Test2.class, "int1", "short1") ||
+                    !isPadded(Test2.class, "long1") ||
+                    isPadded(Test2.class, "int1") ||
+                    isPadded(Test2.class, "short1")) {
+                System.err.println("Test2 failed");
+                return 1;
+            }
+            return 0;
+        }
+    }
+
+    // both fields are padded
+    public static class Test3 {
+        @Contended               private long long1;
+        @Contended               private int int1;
+        @Contended               private short short1;
+
+        public static int checkLayout() throws Exception {
+            if (!arePaddedPairwise(Test3.class, "long1", "int1") ||
+                    !arePaddedPairwise(Test3.class, "long1", "short1") ||
+                    !arePaddedPairwise(Test3.class, "int1", "short1") ||
+                    !isPadded(Test3.class, "long1") ||
+                    !isPadded(Test3.class, "int1") ||
+                    !isPadded(Test3.class, "short1")) {
+                System.err.println("Test3 failed");
+                return 1;
+            }
+            return 0;
+        }
+    }
+
+    // fields are padded in the singular group
+    public static class Test4 {
+        @Contended("sameGroup")  private long long1;
+        @Contended("sameGroup")  private int int1;
+        @Contended("sameGroup")  private short short1;
+
+        public static int checkLayout() throws Exception {
+            if (arePaddedPairwise(Test4.class, "long1", "int1") ||
+                    arePaddedPairwise(Test4.class, "long1", "short1") ||
+                    arePaddedPairwise(Test4.class, "int1", "short1") ||
+                    !isPadded(Test4.class, "long1") ||
+                    !isPadded(Test4.class, "int1") ||
+                    !isPadded(Test4.class, "short1")) {
+                System.err.println("Test4 failed");
+                return 1;
+            }
+            return 0;
+        }
+    }
+
+    // fields are padded in disjoint groups
+    public static class Test5 {
+        @Contended("diffGroup1") private long long1;
+        @Contended("diffGroup2") private int int1;
+        @Contended("diffGroup3") private short short1;
+
+        public static int checkLayout() throws Exception {
+            if (!arePaddedPairwise(Test5.class, "long1", "int1") ||
+                    !arePaddedPairwise(Test5.class, "long1", "short1") ||
+                    !arePaddedPairwise(Test5.class, "int1", "short1") ||
+                    !isPadded(Test5.class, "long1") ||
+                    !isPadded(Test5.class, "int1") ||
+                    !isPadded(Test5.class, "short1")) {
+                System.err.println("Test5 failed");
+                return 1;
+            }
+            return 0;
+        }
+    }
+
+    // fields are padded in disjoint groups
+    public static class Test6 {
+        @Contended               private long long1;
+        @Contended("diffGroup2") private int int1;
+        @Contended("diffGroup3") private short short1;
+
+        public static int checkLayout() throws Exception {
+            if (!arePaddedPairwise(Test6.class, "long1", "int1") ||
+                    !arePaddedPairwise(Test6.class, "long1", "short1") ||
+                    !arePaddedPairwise(Test6.class, "int1", "short1") ||
+                    !isPadded(Test6.class, "long1") ||
+                    !isPadded(Test6.class, "int1") ||
+                    !isPadded(Test6.class, "short1")) {
+                System.err.println("Test6 failed");
+                return 1;
+            }
+            return 0;
+        }
+    }
+
+    // fields are padded in the singular group
+    @Contended
+    public static class Test7 {
+                                 private long long1;
+                                 private int int1;
+                                 private short short1;
+
+        public static int checkLayout() throws Exception {
+            if (arePaddedPairwise(Test7.class, "long1", "int1") ||
+                    arePaddedPairwise(Test7.class, "long1", "short1") ||
+                    arePaddedPairwise(Test7.class, "int1", "short1") ||
+                    !isPadded(Test7.class, "long1") ||
+                    !isPadded(Test7.class, "int1") ||
+                    !isPadded(Test7.class, "short1")) {
+                System.err.println("Test7 failed");
+                return 1;
+            }
+            return 0;
+        }
+    }
+
+    // all fields are padded as the group, and one field is padded specifically
+    @Contended
+    public static class Test8 {
+        @Contended               private long long1;
+                                 private int int1;
+                                 private short short1;
+
+        public static int checkLayout() throws Exception {
+            if (!arePaddedPairwise(Test8.class, "long1", "int1") ||
+                    !arePaddedPairwise(Test8.class, "long1", "short1") ||
+                    arePaddedPairwise(Test8.class, "int1", "short1") ||
+                    !isPadded(Test8.class, "long1") ||
+                    !isPadded(Test8.class, "int1") ||
+                    !isPadded(Test8.class, "short1")) {
+                System.err.println("Test8 failed");
+                return 1;
+            }
+            return 0;
+        }
+    }
+
+    // all fields are padded as the group, and one field is padded specifically
+    @Contended
+    public static class Test9 {
+        @Contended("group")      private long long1;
+                                 private int int1;
+                                 private short short1;
+
+        public static int checkLayout() throws Exception {
+            if (!arePaddedPairwise(Test9.class, "long1", "int1") ||
+                    !arePaddedPairwise(Test9.class, "long1", "short1") ||
+                    arePaddedPairwise(Test9.class, "int1", "short1") ||
+                    !isPadded(Test9.class, "long1") ||
+                    !isPadded(Test9.class, "int1") ||
+                    !isPadded(Test9.class, "short1")) {
+                System.err.println("Test9 failed");
+                return 1;
+            }
+            return 0;
+        }
+    }
+
+}
+

From 3eaeb9b1ad82d165798a986a2d9378d52af0ca38 Mon Sep 17 00:00:00 2001
From: Christian Hagedorn <chagedorn@openjdk.org>
Date: Mon, 30 Mar 2026 10:25:58 +0000
Subject: [PATCH 408/655] 8380945: [IR Framework] Test VM is finished before
 TestFrameworkSocket is ready to accept connection

Reviewed-by: mchevalier, thartmann
---
 .../ir_framework/driver/TestVMProcess.java    |  1 +
 .../shared/TestFrameworkSocket.java           | 49 +++++++++++++++----
 2 files changed, 40 insertions(+), 10 deletions(-)

diff --git a/test/hotspot/jtreg/compiler/lib/ir_framework/driver/TestVMProcess.java b/test/hotspot/jtreg/compiler/lib/ir_framework/driver/TestVMProcess.java
index 00a9b93d124..bfffbdbec7e 100644
--- a/test/hotspot/jtreg/compiler/lib/ir_framework/driver/TestVMProcess.java
+++ b/test/hotspot/jtreg/compiler/lib/ir_framework/driver/TestVMProcess.java
@@ -68,6 +68,7 @@ public class TestVMProcess {
         this.cmds = new ArrayList<>();
         TestFrameworkSocket socket = new TestFrameworkSocket();
         try (socket) {
+            socket.start();
             prepareTestVMFlags(additionalFlags, socket, testClass, helperClasses, defaultWarmup,
                                allowNotCompilable, testClassesOnBootClassPath);
             start();
diff --git a/test/hotspot/jtreg/compiler/lib/ir_framework/shared/TestFrameworkSocket.java b/test/hotspot/jtreg/compiler/lib/ir_framework/shared/TestFrameworkSocket.java
index 77d560952f1..44063a4bd43 100644
--- a/test/hotspot/jtreg/compiler/lib/ir_framework/shared/TestFrameworkSocket.java
+++ b/test/hotspot/jtreg/compiler/lib/ir_framework/shared/TestFrameworkSocket.java
@@ -42,9 +42,13 @@ public class TestFrameworkSocket implements AutoCloseable {
 
     private final int serverSocketPort;
     private final ServerSocket serverSocket;
-    private boolean running;
-    private final ExecutorService executor;
-    private Future<JavaMessages> javaFuture;
+    private final ExecutorService acceptExecutor;
+    private final ExecutorService clientExecutor;
+
+    // Make these volatile such that the main thread can observe an update written by the worker threads in the executor
+    // services to avoid stale values.
+    private volatile boolean running;
+    private volatile Future<JavaMessages> javaFuture;
 
     public TestFrameworkSocket() {
         try {
@@ -54,29 +58,53 @@ public class TestFrameworkSocket implements AutoCloseable {
             throw new TestFrameworkException("Failed to create TestFramework server socket", e);
         }
         serverSocketPort = serverSocket.getLocalPort();
-        executor = Executors.newCachedThreadPool();
+        acceptExecutor = Executors.newSingleThreadExecutor();
+        clientExecutor = Executors.newCachedThreadPool();
         if (TestFramework.VERBOSE) {
             System.out.println("TestFramework server socket uses port " + serverSocketPort);
         }
-        start();
     }
 
     public String getPortPropertyFlag() {
         return "-D" + SERVER_PORT_PROPERTY + "=" + serverSocketPort;
     }
 
-    private void start() {
+    public void start() {
         running = true;
-        executor.submit(this::acceptLoop);
+        CountDownLatch calledAcceptLoopLatch = new CountDownLatch(1);
+        startAcceptLoop(calledAcceptLoopLatch);
+    }
+
+    private void startAcceptLoop(CountDownLatch calledAcceptLoopLatch) {
+        acceptExecutor.submit(() -> acceptLoop(calledAcceptLoopLatch));
+        waitUntilAcceptLoopRuns(calledAcceptLoopLatch);
+    }
+
+    private void waitUntilAcceptLoopRuns(CountDownLatch calledAcceptLoopLatch) {
+        try {
+            if (!calledAcceptLoopLatch.await(10, TimeUnit.SECONDS)) {
+                throw new IllegalStateException("acceptLoop did not start in time");
+            }
+        } catch (Exception e) {
+            throw new TestFrameworkException("Could not start TestFrameworkSocket", e);
+        }
     }
 
     /**
      * Main loop to wait for new client connections and handling them upon connection request.
      */
-    private void acceptLoop() {
+    private void acceptLoop(CountDownLatch calledAcceptLoopLatch) {
+        calledAcceptLoopLatch.countDown();
         while (running) {
             try {
                 acceptNewClientConnection();
+            }  catch (SocketException e) {
+                if (!running || serverSocket.isClosed()) {
+                    // Normal shutdown
+                    return;
+                }
+                running = false;
+                throw new TestFrameworkException("Server socket error", e);
             } catch (TestFrameworkException e) {
                 running = false;
                 throw e;
@@ -101,7 +129,7 @@ public class TestFrameworkSocket implements AutoCloseable {
      * over that connection.
      */
     private void submitTask(Socket client, BufferedReader reader) {
-        javaFuture = executor.submit(new TestVmMessageReader(client, reader));
+        javaFuture = clientExecutor.submit(new TestVmMessageReader(client, reader));
     }
 
     @Override
@@ -112,7 +140,8 @@ public class TestFrameworkSocket implements AutoCloseable {
         } catch (IOException e) {
             throw new TestFrameworkException("Could not close socket", e);
         }
-        executor.shutdown();
+        acceptExecutor.shutdown();
+        clientExecutor.shutdown();
     }
 
     public TestVMData testVmData(String hotspotPidFileName, boolean allowNotCompilable) {

From 6b9887b4f518c5b26d6a9700b7ae0dea8b140164 Mon Sep 17 00:00:00 2001
From: Yasumasa Suenaga <ysuenaga@openjdk.org>
Date: Mon, 30 Mar 2026 11:53:03 +0000
Subject: [PATCH 409/655] 8378902: Test
 compiler/vectorapi/TestVectorLibraryUnaryOpAndBinaryOp.java failed

Reviewed-by: mbaesken, thartmann
---
 .../TestVectorLibraryUnaryOpAndBinaryOp.java  | 22 +++++++++++++++++--
 1 file changed, 20 insertions(+), 2 deletions(-)

diff --git a/test/hotspot/jtreg/compiler/vectorapi/TestVectorLibraryUnaryOpAndBinaryOp.java b/test/hotspot/jtreg/compiler/vectorapi/TestVectorLibraryUnaryOpAndBinaryOp.java
index f7837e1abfa..731c87e69f7 100644
--- a/test/hotspot/jtreg/compiler/vectorapi/TestVectorLibraryUnaryOpAndBinaryOp.java
+++ b/test/hotspot/jtreg/compiler/vectorapi/TestVectorLibraryUnaryOpAndBinaryOp.java
@@ -26,12 +26,13 @@ package compiler.vectorapi;
 
 import compiler.lib.ir_framework.*;
 import jdk.incubator.vector.*;
+import jtreg.SkippedException;
 
 /**
  * @test
- * @bug 8378312
+ * @bug 8378312 8378902
  * @library /test/lib /
- * @summary VectorAPI: libraryUnaryOp and libraryBinaryOp should be intrinsified.
+ * @summary VectorAPI: libraryUnaryOp and libraryBinaryOp should be intrinsified. This test would be run on SVML/SLEEF supported platforms only.
  * @modules jdk.incubator.vector
  *
  * @run driver compiler.vectorapi.TestVectorLibraryUnaryOpAndBinaryOp
@@ -53,7 +54,24 @@ public class TestVectorLibraryUnaryOpAndBinaryOp {
         vec.lanewise(VectorOperators.HYPOT, 1.0f);
     }
 
+    private static void checkVectorMathLib() {
+        try {
+            // Check jsvml first
+            System.loadLibrary("jsvml");
+        } catch (UnsatisfiedLinkError _) {
+            try {
+                // Check sleef if jsvml not found
+                System.loadLibrary("sleef");
+            } catch (UnsatisfiedLinkError _) {
+                // This test is run on unsupported platform - should be skipped
+                throw new SkippedException("SVML / SLEEF not found");
+            }
+        }
+    }
+
     public static void main(String[] args) {
+        checkVectorMathLib();
+
         TestFramework testFramework = new TestFramework();
         testFramework.addFlags("--add-modules=jdk.incubator.vector")
                      .start();

From 7e0a1499ee5743cb8b36ad0150fa3a538b368e27 Mon Sep 17 00:00:00 2001
From: Koushik Thirupattur <koushik.thirupattur@oracle.com>
Date: Mon, 30 Mar 2026 12:50:42 +0000
Subject: [PATCH 410/655] 8345954: Revisit Class Initializers and Locking in
 X509TrustManagerImpl

Reviewed-by: weijun
---
 .../sun/security/provider/X509Factory.java    | 83 +++++++++++--------
 1 file changed, 49 insertions(+), 34 deletions(-)

diff --git a/src/java.base/share/classes/sun/security/provider/X509Factory.java b/src/java.base/share/classes/sun/security/provider/X509Factory.java
index f732c7c0455..4be83d629bb 100644
--- a/src/java.base/share/classes/sun/security/provider/X509Factory.java
+++ b/src/java.base/share/classes/sun/security/provider/X509Factory.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1998, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1998, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -112,9 +112,10 @@ public class X509Factory extends CertificateFactorySpi {
         if (cert != null) {
             return cert;
         }
-        cert = new X509CertImpl(encoding);
-        addToCache(certCache, cert.getEncodedInternal(), cert);
-        return cert;
+        // Build outside lock
+        X509CertImpl newCert = new X509CertImpl(encoding);
+        byte[] enc = newCert.getEncodedInternal();
+        return addIfNotPresent(certCache, enc, newCert);
     }
 
     /**
@@ -156,7 +157,7 @@ public class X509Factory extends CertificateFactorySpi {
      * @throws CertificateException if failures occur while obtaining the DER
      *      encoding for certificate data.
      */
-    public static synchronized X509CertImpl intern(X509Certificate c)
+    public static X509CertImpl intern(X509Certificate c)
             throws CertificateException {
         if (c == null) {
             return null;
@@ -168,18 +169,23 @@ public class X509Factory extends CertificateFactorySpi {
         } else {
             encoding = c.getEncoded();
         }
-        X509CertImpl newC = getFromCache(certCache, encoding);
-        if (newC != null) {
-            return newC;
+        // First check under per-cache lock
+        X509CertImpl cached = getFromCache(certCache, encoding);
+        if (cached != null) {
+            return cached;
         }
+
+        // Build outside lock
+        X509CertImpl newC;
+        byte[] enc;
         if (isImpl) {
-            newC = (X509CertImpl)c;
+            newC = (X509CertImpl) c;
+            enc = encoding;
         } else {
             newC = new X509CertImpl(encoding);
-            encoding = newC.getEncodedInternal();
+            enc = newC.getEncodedInternal();
         }
-        addToCache(certCache, encoding, newC);
-        return newC;
+        return addIfNotPresent(certCache, enc, newC);
     }
 
     /**
@@ -192,7 +198,7 @@ public class X509Factory extends CertificateFactorySpi {
      * @throws CRLException if failures occur while obtaining the DER
      *      encoding for CRL data.
      */
-    public static synchronized X509CRLImpl intern(X509CRL c)
+    public static X509CRLImpl intern(X509CRL c)
             throws CRLException {
         if (c == null) {
             return null;
@@ -204,39 +210,47 @@ public class X509Factory extends CertificateFactorySpi {
         } else {
             encoding = c.getEncoded();
         }
-        X509CRLImpl newC = getFromCache(crlCache, encoding);
-        if (newC != null) {
-            return newC;
+        X509CRLImpl cached = getFromCache(crlCache, encoding);
+        if (cached != null) {
+            return cached;
         }
+
+        X509CRLImpl newC;
+        byte[] enc;
         if (isImpl) {
-            newC = (X509CRLImpl)c;
+            newC = (X509CRLImpl) c;
+            enc = encoding;
         } else {
             newC = new X509CRLImpl(encoding);
-            encoding = newC.getEncodedInternal();
+            enc = newC.getEncodedInternal();
         }
-        addToCache(crlCache, encoding, newC);
-        return newC;
+        return addIfNotPresent(crlCache, enc, newC);
     }
 
     /**
      * Get the X509CertImpl or X509CRLImpl from the cache.
      */
-    private static synchronized <K,V> V getFromCache(Cache<K,V> cache,
-            byte[] encoding) {
-        Object key = new Cache.EqualByteArray(encoding);
-        return cache.get(key);
+    private static <V> V getFromCache(Cache<Object, V> cache, byte[] encoding) {
+        return cache.get(new Cache.EqualByteArray(encoding));
     }
 
     /**
      * Add the X509CertImpl or X509CRLImpl to the cache.
      */
-    private static synchronized <V> void addToCache(Cache<Object, V> cache,
-            byte[] encoding, V value) {
+    private static <V> V addIfNotPresent(Cache<Object, V> cache, byte[] encoding, V value) {
         if (encoding.length > ENC_MAX_LENGTH) {
-            return;
+            return value;
         }
         Object key = new Cache.EqualByteArray(encoding);
-        cache.put(key, value);
+        // Synchronize only to make the "check + insert" decision atomic.
+        synchronized (cache) {
+            V existing = cache.get(key);
+            if (existing != null) {
+                return existing;
+            }
+            cache.put(key, value);
+            return value;
+        }
     }
 
     /**
@@ -389,13 +403,14 @@ public class X509Factory extends CertificateFactorySpi {
         try {
             byte[] encoding = readOneBlock(is);
             if (encoding != null) {
-                X509CRLImpl crl = getFromCache(crlCache, encoding);
-                if (crl != null) {
-                    return crl;
+                X509CRLImpl cached = getFromCache(crlCache, encoding);
+                if (cached != null) {
+                    return cached;
                 }
-                crl = new X509CRLImpl(encoding);
-                addToCache(crlCache, crl.getEncodedInternal(), crl);
-                return crl;
+                // Build outside lock
+                X509CRLImpl crl = new X509CRLImpl(encoding);
+                byte[] enc = crl.getEncodedInternal();
+                return addIfNotPresent(crlCache, enc, crl);
             } else {
                 throw new IOException("Empty input");
             }

From d58fb1e290cb8a28a04900e132ae09002ae62937 Mon Sep 17 00:00:00 2001
From: Daisuke Yamazaki <dyama@openjdk.org>
Date: Mon, 30 Mar 2026 12:58:07 +0000
Subject: [PATCH 411/655] 8374202: Simplify significand normalization in
 BigDecimal(double, MathContext) constructor

Reviewed-by: rgiulietti
---
 src/java.base/share/classes/java/math/BigDecimal.java | 9 ++++-----
 1 file changed, 4 insertions(+), 5 deletions(-)

diff --git a/src/java.base/share/classes/java/math/BigDecimal.java b/src/java.base/share/classes/java/math/BigDecimal.java
index 14d81d30c3d..6e651b4fde2 100644
--- a/src/java.base/share/classes/java/math/BigDecimal.java
+++ b/src/java.base/share/classes/java/math/BigDecimal.java
@@ -1026,12 +1026,11 @@ public class BigDecimal extends Number implements Comparable<BigDecimal> {
             return;
         }
         // Normalize
-        while ((significand & 1) == 0) { // i.e., significand is even
-            significand >>= 1;
-            exponent++;
-        }
-        int scl = 0;
+        int nTrailingZeros = Long.numberOfTrailingZeros(significand);
+        significand >>= nTrailingZeros;
+        exponent += nTrailingZeros;
         // Calculate intVal and scale
+        int scl = 0;
         BigInteger rb;
         long compactVal = sign * significand;
         if (exponent == 0) {

From 40e6069ff0558b1d5d0e520df7f23e59369867db Mon Sep 17 00:00:00 2001
From: Dusan Balek <dusan.balek@oracle.com>
Date: Mon, 30 Mar 2026 13:06:06 +0000
Subject: [PATCH 412/655] =?UTF-8?q?8371873:=20javac:=20U+001A=20(SUB=20/?=
 =?UTF-8?q?=20control-Z)=20after=20the=20last=20token=20makes=20the=20rest?=
 =?UTF-8?q?=20of=20the=20file=20silently=20ignored,=20which=20contradicts?=
 =?UTF-8?q?=20JLS=20=C2=A73.3=E2=80=93=C2=A73.5?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

Reviewed-by: jlahoda
---
 .../sun/tools/javac/parser/JavaTokenizer.java |   4 +-
 .../tools/javac/lexer/AsciiSubCharTest.java   | 116 ++++++++++++++++++
 2 files changed, 118 insertions(+), 2 deletions(-)
 create mode 100644 test/langtools/tools/javac/lexer/AsciiSubCharTest.java

diff --git a/src/jdk.compiler/share/classes/com/sun/tools/javac/parser/JavaTokenizer.java b/src/jdk.compiler/share/classes/com/sun/tools/javac/parser/JavaTokenizer.java
index babe372e7dc..55f2f76e358 100644
--- a/src/jdk.compiler/share/classes/com/sun/tools/javac/parser/JavaTokenizer.java
+++ b/src/jdk.compiler/share/classes/com/sun/tools/javac/parser/JavaTokenizer.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1999, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1999, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -1000,7 +1000,7 @@ public class JavaTokenizer extends UnicodeReader {
                             scanIdent();
                         } else if (digit(pos, 10) >= 0) {
                             scanNumber(pos, 10);
-                        } else if (is((char)EOI) || !isAvailable()) {
+                        } else if (is((char)EOI) && position() + 1 == length() || !isAvailable()) {
                             tk = TokenKind.EOF;
                             pos = position();
                         } else {
diff --git a/test/langtools/tools/javac/lexer/AsciiSubCharTest.java b/test/langtools/tools/javac/lexer/AsciiSubCharTest.java
new file mode 100644
index 00000000000..0c96b744d72
--- /dev/null
+++ b/test/langtools/tools/javac/lexer/AsciiSubCharTest.java
@@ -0,0 +1,116 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+/**
+ * @test
+ * @bug 8371873
+ * @summary Check for proper handling of trailing ASCII SUB character
+ * @library /tools/lib
+ * @modules
+ *      jdk.compiler/com.sun.tools.javac.api
+ *      jdk.compiler/com.sun.tools.javac.main
+ * @build toolbox.ToolBox toolbox.JavacTask
+ * @run junit AsciiSubCharTest
+ */
+
+import java.nio.file.Files;
+import java.nio.file.Path;
+import java.nio.file.Paths;
+import java.util.*;
+import org.junit.jupiter.api.BeforeEach;
+import org.junit.jupiter.api.Test;
+import org.junit.jupiter.api.TestInfo;
+
+import toolbox.JavacTask;
+import toolbox.Task;
+import toolbox.ToolBox;
+
+public class AsciiSubCharTest {
+
+    ToolBox tb = new ToolBox();
+    Path base;
+
+    @Test
+    public void testTrailingAsciiSubIsIgnored() throws Exception {
+        Path classes = base.resolve("classes");
+        Files.createDirectories(classes);
+        new JavacTask(tb)
+                .options("-d", classes.toString())
+                .sources("""
+                         public class Test {
+                            void main(String... args) { IO.println("\u001A"); }
+                         }
+                         \u001A""")
+                .run()
+                .writeAll();
+    }
+
+    @Test
+    public void testMultipleTrailingAsciiSubAreReported() throws Exception {
+        Path classes = base.resolve("classes");
+        Files.createDirectories(classes);
+        List<String> out = new JavacTask(tb)
+                .options("-d", classes.toString(), "-XDrawDiagnostics", "-nowarn")
+                .sources("""
+                         public class Test {
+                            void main(String... args) { IO.println("\u001A"); }
+                         }
+                         \u001A\u001A""")
+                .run(Task.Expect.FAIL)
+                .writeAll()
+                .getOutputLines(Task.OutputKind.DIRECT);
+        tb.checkEqual(out, List.of(
+                "Test.java:4:1: compiler.err.illegal.char: \\u001a",
+                "Test.java:4:2: compiler.err.premature.eof",
+                "2 errors"));
+    }
+
+    @Test
+    public void test8371873() throws Exception {
+        Path classes = base.resolve("classes");
+        Files.createDirectories(classes);
+        List<String> out = new JavacTask(tb)
+                .options("-d", classes.toString(), "-XDrawDiagnostics", "-nowarn")
+                .sources("""
+                         public class Test {
+                            void main(String... args) { IO.println("\u001A"); }
+                         }
+                         \u001A\u0001""")
+                .run(Task.Expect.FAIL)
+                .writeAll()
+                .getOutputLines(Task.OutputKind.DIRECT);
+        tb.checkEqual(out, List.of(
+                "Test.java:4:1: compiler.err.illegal.char: \\u001a",
+                "Test.java:4:2: compiler.err.illegal.char: \\u0001",
+                "Test.java:4:3: compiler.err.premature.eof",
+                "3 errors"));
+    }
+
+    @BeforeEach
+    public void setUp(TestInfo info) {
+        base = Paths.get(".")
+                    .resolve(info.getTestMethod()
+                                 .orElseThrow()
+                                 .getName());
+    }
+}

From 2449dc2e807c3a4708a89e52bb16434d4a85d3d2 Mon Sep 17 00:00:00 2001
From: Jan Lahoda <jlahoda@openjdk.org>
Date: Mon, 30 Mar 2026 13:06:40 +0000
Subject: [PATCH 413/655] 8377004: Java Launcher incorrectly allows inheriting
 a package-private main from another package

Reviewed-by: jpai, alanb
---
 .../jdk/internal/misc/MethodFinder.java       |  19 +-
 test/jdk/tools/launcher/InstanceMainTest.java | 224 +++++++++++++++++-
 test/jdk/tools/launcher/MethodFinderTest.java | 196 +++++++++++++++
 3 files changed, 423 insertions(+), 16 deletions(-)
 create mode 100644 test/jdk/tools/launcher/MethodFinderTest.java

diff --git a/src/java.base/share/classes/jdk/internal/misc/MethodFinder.java b/src/java.base/share/classes/jdk/internal/misc/MethodFinder.java
index 60895b8115a..1ee608f2caf 100644
--- a/src/java.base/share/classes/jdk/internal/misc/MethodFinder.java
+++ b/src/java.base/share/classes/jdk/internal/misc/MethodFinder.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2023, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2023, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -27,6 +27,7 @@ package jdk.internal.misc;
 
 import java.lang.reflect.Method;
 import java.lang.reflect.Modifier;
+import java.util.Objects;
 
 import jdk.internal.access.JavaLangAccess;
 import jdk.internal.access.SharedSecrets;
@@ -88,21 +89,27 @@ public class MethodFinder {
             mainMethod = JLA.findMethod(cls, false, "main", String[].class);
         }
 
-        if (mainMethod == null || !isValidMainMethod(mainMethod)) {
+        if (mainMethod == null || !isValidMainMethod(cls, mainMethod)) {
             mainMethod = JLA.findMethod(cls, false, "main");
         }
 
-        if (mainMethod == null || !isValidMainMethod(mainMethod)) {
+        if (mainMethod == null || !isValidMainMethod(cls, mainMethod)) {
             return null;
         }
 
         return mainMethod;
     }
 
-    private static boolean isValidMainMethod(Method mainMethodCandidate) {
+    private static boolean isValidMainMethod(Class<?> initialClass, Method mainMethodCandidate) {
         return mainMethodCandidate.getReturnType() == void.class &&
-               !Modifier.isPrivate(mainMethodCandidate.getModifiers());
-
+               !Modifier.isPrivate(mainMethodCandidate.getModifiers()) &&
+               (Modifier.isPublic(mainMethodCandidate.getModifiers()) ||
+                Modifier.isProtected(mainMethodCandidate.getModifiers()) ||
+                isInSameRuntimePackage(initialClass, mainMethodCandidate.getDeclaringClass()));
     }
 
+    private static boolean isInSameRuntimePackage(Class<?> c1, Class<?> c2) {
+        return Objects.equals(c1.getPackageName(), c2.getPackageName()) &&
+               c1.getClassLoader() == c2.getClassLoader();
+    }
 }
diff --git a/test/jdk/tools/launcher/InstanceMainTest.java b/test/jdk/tools/launcher/InstanceMainTest.java
index 273d56a86bd..3a2f8fe90c1 100644
--- a/test/jdk/tools/launcher/InstanceMainTest.java
+++ b/test/jdk/tools/launcher/InstanceMainTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2023, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2023, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -28,11 +28,12 @@ import java.util.function.Consumer;
 
 /**
  * @test
- * @bug 8329420
+ * @bug 8329420 8377004
  * @summary test execution priority and behavior of main methods
  * @run main/timeout=480 InstanceMainTest
  */
 public class InstanceMainTest extends TestHelper {
+    private static String JAVA_VERSION = System.getProperty("java.specification.version");
 
     private static final String[] SOURCES = new String[] {
             // static dominating with args
@@ -227,11 +228,7 @@ public class InstanceMainTest extends TestHelper {
     private static void testExecutionOrder() throws Exception {
         for (TestCase testCase : EXECUTION_ORDER) {
             performTest(testCase.sourceCode, testCase.enablePreview(), tr -> {
-                if (!Objects.equals(testCase.expectedOutput, tr.testOutput)) {
-                    throw new AssertionError("Unexpected output, " +
-                            "expected: " + testCase.expectedOutput +
-                            ", actual: " + tr.testOutput);
-                }
+                assertEquals(testCase.expectedOutput, tr.testOutput);
             });
         }
     }
@@ -350,20 +347,227 @@ public class InstanceMainTest extends TestHelper {
     private static void performTest(String source, boolean enablePreview, Consumer<TestResult> validator) throws Exception {
         Path mainClass = Path.of("MainClass.java");
         Files.writeString(mainClass, source);
-        var version = System.getProperty("java.specification.version");
         var previewRuntime = enablePreview ? "--enable-preview" : "-DtestNoPreview";
         var previewCompile = enablePreview ? "--enable-preview" : "-XDtestNoPreview";
-        var trSource = doExec(javaCmd, previewRuntime, "--source", version, "MainClass.java");
+        var trSource = doExec(javaCmd, previewRuntime, "--source", JAVA_VERSION, "MainClass.java");
         validator.accept(trSource);
-        compile(previewCompile, "--source", version, "MainClass.java");
+        compile(previewCompile, "--source", JAVA_VERSION, "MainClass.java");
         String cp = mainClass.toAbsolutePath().getParent().toString();
         var trCompile = doExec(javaCmd, previewRuntime, "--class-path", cp, "MainClass");
         validator.accept(trCompile);
     }
 
+    private static void testInheritance() throws Exception {
+        Path testInheritance = Path.of("testInheritance");
+        Path src = testInheritance.resolve("src");
+        Path classes = testInheritance.resolve("classes");
+        Path mainClass = src.resolve("Main.java");
+        Path libClass = src.resolve("p").resolve("Lib.java");
+
+        Files.createDirectories(libClass.getParent());
+
+        Files.writeString(mainClass,
+                          """
+                          import p.Lib;
+
+                          public class Main extends Lib {
+                              public void main() {
+                                  System.err.println("Main!");
+                              }
+                          }
+                          """);
+
+        {
+            Files.writeString(libClass,
+                              """
+                              package p;
+                              public class Lib {
+                                  void main(String... args) {
+                                      System.err.println("Lib!");
+                                  }
+                              }
+                              """);
+            compile("--release", JAVA_VERSION, "-d", classes.toString(), mainClass.toString(), libClass.toString());
+            var tr = doExec(javaCmd, "--class-path", classes.toString(), "Main");
+            assertEquals(List.of("Main!"), tr.testOutput);
+        }
+
+        {
+            Files.writeString(libClass,
+                              """
+                              package p;
+                              public class Lib {
+                                  protected void main(String... args) {
+                                      System.err.println("Lib!");
+                                  }
+                              }
+                              """);
+            compile("--release", JAVA_VERSION, "-d", classes.toString(), mainClass.toString(), libClass.toString());
+            var tr = doExec(javaCmd, "--class-path", classes.toString(), "Main");
+            assertEquals(List.of("Lib!"), tr.testOutput);
+        }
+
+        {
+            Files.writeString(libClass,
+                              """
+                              package p;
+                              public class Lib {
+                                  public void main(String... args) {
+                                      System.err.println("Lib!");
+                                  }
+                              }
+                              """);
+            compile("--release", JAVA_VERSION, "-d", classes.toString(), mainClass.toString(), libClass.toString());
+            var tr = doExec(javaCmd, "--class-path", classes.toString(), "Main");
+            assertEquals(List.of("Lib!"), tr.testOutput);
+        }
+
+        {
+            Files.writeString(mainClass,
+                              """
+                              package p;
+
+                              public class Main extends Lib {
+                                  public void main() {
+                                      System.err.println("Main!");
+                                  }
+                              }
+                              """);
+
+            Files.writeString(libClass,
+                              """
+                              package p;
+                              public class Lib {
+                                  void main(String... args) {
+                                      System.err.println("Lib!");
+                                  }
+                              }
+                              """);
+            compile("--release", JAVA_VERSION, "-d", classes.toString(), mainClass.toString(), libClass.toString());
+            var tr = doExec(javaCmd, "--class-path", classes.toString(), "p.Main");
+            assertEquals(List.of("Lib!"), tr.testOutput);
+        }
+
+        {
+            Files.writeString(mainClass,
+                              """
+                              package p;
+
+                              public class Main implements Lib {
+                                  public void main() {
+                                      System.err.println("Main!");
+                                  }
+                              }
+                              """);
+
+            Files.writeString(libClass,
+                              """
+                              package p;
+                              public interface Lib {
+                                  public default void main(String... args) {
+                                      System.err.println("Lib!");
+                                  }
+                              }
+                              """);
+            compile("--release", JAVA_VERSION, "-d", classes.toString(), mainClass.toString(), libClass.toString());
+            var tr = doExec(javaCmd, "--class-path", classes.toString(), "p.Main");
+            assertEquals(List.of("Lib!"), tr.testOutput);
+        }
+
+        {
+            Files.writeString(mainClass,
+                              """
+                              package p;
+
+                              public class Main implements Lib {
+                                  public void main() {
+                                      System.err.println("Main!");
+                                  }
+                              }
+                              """);
+
+            Files.writeString(libClass,
+                              """
+                              package p;
+                              public interface Lib {
+                                  public static void main(String... args) {
+                                      System.err.println("Lib!");
+                                  }
+                              }
+                              """);
+            compile("--release", JAVA_VERSION, "-d", classes.toString(), mainClass.toString(), libClass.toString());
+            var tr = doExec(javaCmd, "--class-path", classes.toString(), "p.Main");
+            assertEquals(List.of("Main!"), tr.testOutput);
+        }
+
+        {
+            Files.writeString(mainClass,
+                              """
+                              package p;
+
+                              public class Main extends AbstractClass implements Lib {
+                              }
+                              abstract class AbstractClass {
+                                   public void main(String... args) {
+                                       System.err.println("Correct.");
+                                   }
+                              }
+                              """);
+
+            Files.writeString(libClass,
+                              """
+                              package p;
+                              public interface Lib {
+                                  default void main(String... args) {
+                                      System.err.println("Incorrect!");
+                                  }
+                              }
+                              """);
+            compile("--release", JAVA_VERSION, "-d", classes.toString(), mainClass.toString(), libClass.toString());
+            var tr = doExec(javaCmd, "--class-path", classes.toString(), "p.Main");
+            assertEquals(List.of("Correct."), tr.testOutput);
+        }
+
+        {
+            Files.writeString(mainClass,
+                              """
+                              package p;
+
+                              public class Main extends AbstractClass implements Lib {
+                              }
+                              abstract class AbstractClass {
+                                   public void main() {
+                                       System.err.println("Incorrect!");
+                                   }
+                              }
+                              """);
+
+            Files.writeString(libClass,
+                              """
+                              package p;
+                              public interface Lib {
+                                  default void main(String... args) {
+                                      System.err.println("Correct.");
+                                  }
+                              }
+                              """);
+            compile("--release", JAVA_VERSION, "-d", classes.toString(), mainClass.toString(), libClass.toString());
+            var tr = doExec(javaCmd, "--class-path", classes.toString(), "p.Main");
+            assertEquals(List.of("Correct."), tr.testOutput);
+        }
+    }
+
+    private static void assertEquals(List<String> expected, List<String> actual) {
+        if (!Objects.equals(expected, actual)) {
+            throw new AssertionError("Unexpected output, " +
+                    "expected: " + expected +
+                    ", actual: " + actual);
+        }
+    }
     public static void main(String... args) throws Exception {
         testMethodOrder();
         testExecutionOrder();
         testExecutionErrors();
+        testInheritance();
     }
 }
diff --git a/test/jdk/tools/launcher/MethodFinderTest.java b/test/jdk/tools/launcher/MethodFinderTest.java
new file mode 100644
index 00000000000..6e1e68d8225
--- /dev/null
+++ b/test/jdk/tools/launcher/MethodFinderTest.java
@@ -0,0 +1,196 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+/**
+ * @test
+ * @bug 8377004
+ * @summary Whitebox test for MethodFinder
+ * @modules java.base/jdk.internal.misc
+ *          jdk.compiler
+ *          jdk.zipfs
+ * @run junit MethodFinderTest
+ */
+
+import java.lang.reflect.Method;
+import java.net.URL;
+import java.net.URLClassLoader;
+import java.nio.file.Files;
+import java.nio.file.Path;
+import jdk.internal.misc.MethodFinder;
+import org.junit.jupiter.api.Test;
+
+import static org.junit.jupiter.api.Assertions.*;
+
+public class MethodFinderTest {
+
+    private static final String JAVA_VERSION = System.getProperty("java.specification.version");
+
+    @Test
+    public void testDistinctClassLoaders() throws Exception {
+        Path base = Path.of("testDistinctClassLoaders");
+        Path libSrc = base.resolve("libSrc");
+        Path libClasses = base.resolve("libClasses");
+        Path libJava = libSrc.resolve("p").resolve("Lib.java");
+
+        Files.createDirectories(libJava.getParent());
+
+        Files.writeString(libJava,
+                          """
+                          package p;
+                          public class Lib {
+                              void main(String... args) {
+                                  System.err.println("Lib!");
+                              }
+                          }
+                          """);
+
+        TestHelper.compile("--release", JAVA_VERSION, "-d", libClasses.toString(), libJava.toString());
+
+        Path mainSrc = base.resolve("mainSrc");
+        Path mainClasses = base.resolve("mainClasses");
+        Path mainJava = mainSrc.resolve("p").resolve("Main.java");
+
+        Files.createDirectories(mainJava.getParent());
+
+        Files.writeString(mainJava,
+                          """
+                          package p;
+
+                          public class Main extends Lib {
+                              public void main() {
+                                  System.err.println("Main!");
+                              }
+                          }
+                          """);
+
+        TestHelper.compile("--release", JAVA_VERSION, "--class-path", libClasses.toString(), "-d", mainClasses.toString(), mainJava.toString());
+
+        {
+            ClassLoader cl = new URLClassLoader(new URL[] {
+                libClasses.toUri().toURL(),
+                mainClasses.toUri().toURL()
+            });
+            Class<?> mainClass = cl.loadClass("p.Main");
+            Method mainMethod = MethodFinder.findMainMethod(mainClass);
+
+            //p.Main and p.Lib are in the same runtime package:
+            assertEquals("p.Lib", mainMethod.getDeclaringClass().getName());
+        }
+
+        {
+            ClassLoader libCl = new URLClassLoader(new URL[] {
+                libClasses.toUri().toURL(),
+            });
+            ClassLoader mainCl = new URLClassLoader(new URL[] {
+                mainClasses.toUri().toURL()
+            }, libCl);
+            Class<?> mainClass = mainCl.loadClass("p.Main");
+            Method mainMethod = MethodFinder.findMainMethod(mainClass);
+
+            //p.Main and p.Lib are in the different runtime packages:
+            assertEquals("p.Main", mainMethod.getDeclaringClass().getName());
+        }
+    }
+
+    @Test
+    public void testWrongEquals() throws Exception {
+        Path base = Path.of("testDistinctClassLoaders");
+        Path libSrc = base.resolve("libSrc");
+        Path libClasses = base.resolve("libClasses");
+        Path libJava = libSrc.resolve("p").resolve("Lib.java");
+
+        Files.createDirectories(libJava.getParent());
+
+        Files.writeString(libJava,
+                          """
+                          package p;
+                          public class Lib {
+                              void main(String... args) {
+                                  System.err.println("Lib!");
+                              }
+                          }
+                          """);
+
+        TestHelper.compile("--release", JAVA_VERSION, "-d", libClasses.toString(), libJava.toString());
+
+        Path mainSrc = base.resolve("mainSrc");
+        Path mainClasses = base.resolve("mainClasses");
+        Path mainJava = mainSrc.resolve("p").resolve("Main.java");
+
+        Files.createDirectories(mainJava.getParent());
+
+        Files.writeString(mainJava,
+                          """
+                          package p;
+
+                          public class Main extends Lib {
+                              public void main() {
+                                  System.err.println("Main!");
+                              }
+                          }
+                          """);
+
+        TestHelper.compile("--release", JAVA_VERSION, "--class-path", libClasses.toString(), "-d", mainClasses.toString(), mainJava.toString());
+
+        {
+            ClassLoader cl = new URLClassLoader(new URL[] {
+                libClasses.toUri().toURL(),
+                mainClasses.toUri().toURL()
+            });
+            Class<?> mainClass = cl.loadClass("p.Main");
+            Method mainMethod = MethodFinder.findMainMethod(mainClass);
+
+            //p.Main and p.Lib are in the same runtime package:
+            assertEquals("p.Lib", mainMethod.getDeclaringClass().getName());
+        }
+
+        {
+            class WrongEquals extends URLClassLoader {
+
+                public WrongEquals(URL[] urls) {
+                    super(urls);
+                }
+
+                public WrongEquals(URL[] urls, ClassLoader parent) {
+                    super(urls, parent);
+                }
+
+                @Override
+                public boolean equals(Object obj) {
+                    return obj instanceof WrongEquals;
+                }
+            }
+            ClassLoader libCl = new WrongEquals(new URL[] {
+                libClasses.toUri().toURL(),
+            });
+            ClassLoader mainCl = new WrongEquals(new URL[] {
+                mainClasses.toUri().toURL()
+            }, libCl);
+            Class<?> mainClass = mainCl.loadClass("p.Main");
+            Method mainMethod = MethodFinder.findMainMethod(mainClass);
+
+            //p.Main and p.Lib are in the different runtime packages:
+            assertEquals("p.Main", mainMethod.getDeclaringClass().getName());
+        }
+    }
+}

From 88d4f1f7ce9662155f35197157abe341ba13c673 Mon Sep 17 00:00:00 2001
From: Liam Miller-Cushon <cushon@openjdk.org>
Date: Mon, 30 Mar 2026 13:09:18 +0000
Subject: [PATCH 414/655] 8380795: Consider omitting type annotations from
 method arguments in diagnostics

Co-authored-by: Liz Looney <lizlooney@google.com>
Reviewed-by: vromero
---
 .../com/sun/tools/javac/code/Printer.java     | 43 +++++++++--------
 .../failures/MethodArguments.java             | 47 +++++++++++++++++++
 .../failures/MethodArguments.out              |  8 ++++
 .../typeAnnotations/failures/p/A.java         | 30 ++++++++++++
 .../typeAnnotations/failures/p/B.java         | 41 ++++++++++++++++
 5 files changed, 150 insertions(+), 19 deletions(-)
 create mode 100644 test/langtools/tools/javac/annotations/typeAnnotations/failures/MethodArguments.java
 create mode 100644 test/langtools/tools/javac/annotations/typeAnnotations/failures/MethodArguments.out
 create mode 100644 test/langtools/tools/javac/annotations/typeAnnotations/failures/p/A.java
 create mode 100644 test/langtools/tools/javac/annotations/typeAnnotations/failures/p/B.java

diff --git a/src/jdk.compiler/share/classes/com/sun/tools/javac/code/Printer.java b/src/jdk.compiler/share/classes/com/sun/tools/javac/code/Printer.java
index d9781f19c5d..acd8a35a894 100644
--- a/src/jdk.compiler/share/classes/com/sun/tools/javac/code/Printer.java
+++ b/src/jdk.compiler/share/classes/com/sun/tools/javac/code/Printer.java
@@ -53,6 +53,7 @@ public abstract class Printer implements Type.Visitor<String, Locale>, Symbol.Vi
 
     List<Type> seenCaptured = List.nil();
     static final int PRIME = 997;  // largest prime less than 1000
+    private boolean printingMethodArgs;
 
     protected Printer() { }
 
@@ -195,6 +196,9 @@ public abstract class Printer implements Type.Visitor<String, Locale>, Symbol.Vi
     }
 
     private String printAnnotations(Type t, boolean prefix) {
+        if (printingMethodArgs) {
+            return "";
+        }
         StringBuilder sb = new StringBuilder();
         List<Attribute.TypeCompound> annos = t.getAnnotationMirrors();
         if (!annos.isEmpty()) {
@@ -337,27 +341,28 @@ public abstract class Printer implements Type.Visitor<String, Locale>, Symbol.Vi
      * @return localized string representation
      */
     protected String printMethodArgs(List<Type> args, boolean varArgs, Locale locale) {
-        if (!varArgs) {
-            return visitTypes(args, locale);
-        } else {
-            StringBuilder buf = new StringBuilder();
-            while (args.tail.nonEmpty()) {
-                buf.append(visit(args.head, locale));
-                args = args.tail;
-                buf.append(',');
-            }
-            if (args.head.hasTag(TypeTag.ARRAY)) {
-                buf.append(visit(((ArrayType) args.head).elemtype, locale));
-                if (args.head.getAnnotationMirrors().nonEmpty()) {
-                    buf.append(' ');
-                    buf.append(args.head.getAnnotationMirrors());
-                    buf.append(' ');
-                }
-                buf.append("...");
+        boolean prev = printingMethodArgs;
+        printingMethodArgs = true;
+        try {
+            if (!varArgs) {
+                return visitTypes(args, locale);
             } else {
-                buf.append(visit(args.head, locale));
+                StringBuilder buf = new StringBuilder();
+                while (args.tail.nonEmpty()) {
+                    buf.append(visit(args.head, locale));
+                    args = args.tail;
+                    buf.append(',');
+                }
+                if (args.head.hasTag(TypeTag.ARRAY)) {
+                    buf.append(visit(((ArrayType) args.head).elemtype, locale));
+                    buf.append("...");
+                } else {
+                    buf.append(visit(args.head, locale));
+                }
+                return buf.toString();
             }
-            return buf.toString();
+        } finally {
+          printingMethodArgs = prev;
         }
     }
 
diff --git a/test/langtools/tools/javac/annotations/typeAnnotations/failures/MethodArguments.java b/test/langtools/tools/javac/annotations/typeAnnotations/failures/MethodArguments.java
new file mode 100644
index 00000000000..e539721855b
--- /dev/null
+++ b/test/langtools/tools/javac/annotations/typeAnnotations/failures/MethodArguments.java
@@ -0,0 +1,47 @@
+/*
+ * @test /nodynamiccopyright/
+ * @summary Omit type-use annotations from diagnostics
+ * @compile/fail/ref=MethodArguments.out -XDrawDiagnostics MethodArguments.java p/A.java p/B.java
+ */
+
+import java.util.List;
+import p.A;
+import p.B;
+
+public final class MethodArguments {
+  public static void main(String[] args) {
+    // error non-static.cant.be.ref:
+    //     non-static ... cannot be referenced from a static context
+    B.one("bar");
+
+    B b = new B();
+
+    // error ref.ambiguous:
+    //     reference to ... is ambiguous
+    //     ...
+    //     both ... and ... match
+    b.one(null);
+
+    // error report.access:
+    //     ... has private access in ...
+    b.two("foo");
+    //     ... has protected access in ...
+    b.three("foo");
+
+    // error not.def.public.cant.access:
+    //     ... is not public in ... cannot be accessed from outside package
+    b.four("foo");
+  }
+
+  void five(@A String s) {
+  }
+
+  void five(@A String s) {
+  }
+
+  void six(List<@A String> s) {
+  }
+
+  void six(List<@A String> s) {
+  }
+}
diff --git a/test/langtools/tools/javac/annotations/typeAnnotations/failures/MethodArguments.out b/test/langtools/tools/javac/annotations/typeAnnotations/failures/MethodArguments.out
new file mode 100644
index 00000000000..b4ecee21403
--- /dev/null
+++ b/test/langtools/tools/javac/annotations/typeAnnotations/failures/MethodArguments.out
@@ -0,0 +1,8 @@
+MethodArguments.java:39:8: compiler.err.already.defined: kindname.method, five(java.lang.String), kindname.class, MethodArguments
+MethodArguments.java:45:8: compiler.err.already.defined: kindname.method, six(java.util.List<java.lang.String>), kindname.class, MethodArguments
+MethodArguments.java:15:6: compiler.err.non-static.cant.be.ref: kindname.method, one(java.lang.String)
+MethodArguments.java:23:6: compiler.err.ref.ambiguous: one, kindname.method, one(java.lang.String), p.B, kindname.method, one(java.lang.Integer), p.B
+MethodArguments.java:27:6: compiler.err.report.access: two(java.lang.String), private, p.B
+MethodArguments.java:29:6: compiler.err.report.access: three(java.lang.String), protected, p.B
+MethodArguments.java:33:6: compiler.err.not.def.public.cant.access: four(java.lang.String), p.B
+7 errors
diff --git a/test/langtools/tools/javac/annotations/typeAnnotations/failures/p/A.java b/test/langtools/tools/javac/annotations/typeAnnotations/failures/p/A.java
new file mode 100644
index 00000000000..9e3bb15dab5
--- /dev/null
+++ b/test/langtools/tools/javac/annotations/typeAnnotations/failures/p/A.java
@@ -0,0 +1,30 @@
+/*
+ * Copyright (c) 2026, Google LLC. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+package p;
+
+import java.lang.annotation.ElementType;
+import java.lang.annotation.Target;
+
+@Target(ElementType.TYPE_USE)
+public @interface A {}
diff --git a/test/langtools/tools/javac/annotations/typeAnnotations/failures/p/B.java b/test/langtools/tools/javac/annotations/typeAnnotations/failures/p/B.java
new file mode 100644
index 00000000000..4dfe16b312d
--- /dev/null
+++ b/test/langtools/tools/javac/annotations/typeAnnotations/failures/p/B.java
@@ -0,0 +1,41 @@
+/*
+ * Copyright (c) 2026, Google LLC. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+package p;
+
+public class B {
+  public void one(@A String s) {
+  }
+
+  public void one(@A Integer i) {
+  }
+
+  private void two(@A String s) {
+  }
+
+  protected void three(@A String s) {
+  }
+
+  void four(@A String s) {
+  }
+}

From 783f8f1adc4ea3ef7fd4c5ca5473aad76dfc7ed1 Mon Sep 17 00:00:00 2001
From: Christian Hagedorn <chagedorn@openjdk.org>
Date: Mon, 30 Mar 2026 14:06:05 +0000
Subject: [PATCH 415/655] 8381320: Problemlist
 compiler/vectorapi/TestVectorReallocation.java

Reviewed-by: thartmann
---
 test/hotspot/jtreg/ProblemList.txt | 1 +
 1 file changed, 1 insertion(+)

diff --git a/test/hotspot/jtreg/ProblemList.txt b/test/hotspot/jtreg/ProblemList.txt
index 3b871d9f4b6..7580ce4d165 100644
--- a/test/hotspot/jtreg/ProblemList.txt
+++ b/test/hotspot/jtreg/ProblemList.txt
@@ -56,6 +56,7 @@ compiler/c2/irTests/TestDuplicateBackedge.java 8318904 generic-all
 
 compiler/codecache/jmx/PoolsIndependenceTest.java 8264632 macosx-all
 
+compiler/vectorapi/TestVectorReallocation.java 8381315 generic-x64
 compiler/vectorapi/reshape/TestVectorReinterpret.java 8320897,8348519 aix-ppc64,linux-ppc64le,linux-s390x
 compiler/vectorapi/VectorRebracket128Test.java 8330538 generic-all
 

From ab83702428d8d73335aa57f2d6a27797b8afa687 Mon Sep 17 00:00:00 2001
From: Matias Saavedra Silva <matsaave@openjdk.org>
Date: Mon, 30 Mar 2026 16:43:00 +0000
Subject: [PATCH 416/655] 8366020: Assert that java code is not executed during
 the AOT assembly phase

Co-authored-by: Ioi Lam <iklam@openjdk.org>
Reviewed-by: kvn, coleenp, iklam
---
 src/hotspot/share/cds/aotClassInitializer.cpp | 33 +++++++++++++++++++
 test/lib/jdk/test/lib/cds/CDSTestUtils.java   |  2 +-
 2 files changed, 34 insertions(+), 1 deletion(-)

diff --git a/src/hotspot/share/cds/aotClassInitializer.cpp b/src/hotspot/share/cds/aotClassInitializer.cpp
index 41fdeb537cc..9ef96282aeb 100644
--- a/src/hotspot/share/cds/aotClassInitializer.cpp
+++ b/src/hotspot/share/cds/aotClassInitializer.cpp
@@ -59,6 +59,39 @@ bool AOTClassInitializer::can_archive_initialized_mirror(InstanceKlass* ik) {
     return false;
   }
 
+#ifdef ASSERT
+  // If code in ik is executed, then ik must be in the state of being_initialized or
+  // fully_initialized.
+  //
+  // Check that no user code is executed during the assembly phase. Otherwise the user
+  // code may introduce undesirable environment dependencies into the heap image.
+  // If any of these two flags are set, we allow user code to be executed
+  // in the assembly phase. Note that these flags are strictly for the purpose
+  // of testing HotSpot and are not available in product builds.
+  if (AOTInitTestClass == nullptr && ArchiveHeapTestClass == nullptr) {
+    if (ik->defined_by_boot_loader()) {
+      // We allow boot classes to be AOT-initialized, except for classes from
+      // -Xbootclasspath (cp index >= 1) be AOT-initialized, as such classes may be
+      // provided by the user application.
+      assert(ik->shared_classpath_index() <= 0,
+              "only boot classed loaded from the modules image can be AOT-initialized");
+    } else {
+      assert(ik->defined_by_platform_loader() || ik->defined_by_app_loader(),
+             "cannot AOT-initialized classed loaded by other loaders");
+
+      // Hidden classes from platform/app loaders need to be AOT-initialized to
+      // support AOT-linking of lambdas. These hidden classes are generated by the
+      // VM and do not contain user code.
+      if (!ik->is_hidden()) {
+        // OK: ik is an interface used by a lambda. When AOT-linking lambdas, we only
+        // support interfaces that are not interface_needs_clinit_execution_as_super().
+        // See AOTConstantPoolResolver::check_lambda_metafactory_signature().
+        assert(ik->is_interface() && !ik->interface_needs_clinit_execution_as_super(), "cannot execute Java code in assembly phase");
+      }
+    }
+  }
+#endif // ASSERT
+
   // About "static field that may hold a different value" errors:
   //
   // Automatic selection for aot-inited classes
diff --git a/test/lib/jdk/test/lib/cds/CDSTestUtils.java b/test/lib/jdk/test/lib/cds/CDSTestUtils.java
index 1c51a693907..59e4a1bbbde 100644
--- a/test/lib/jdk/test/lib/cds/CDSTestUtils.java
+++ b/test/lib/jdk/test/lib/cds/CDSTestUtils.java
@@ -324,7 +324,7 @@ public class CDSTestUtils {
     public static void checkCommonExecExceptions(OutputAnalyzer output, Exception e)
         throws Exception {
         if (output.getStdout().contains("https://bugreport.java.com/bugreport/crash.jsp")) {
-            throw new RuntimeException("Hotspot crashed");
+            throw new RuntimeException(getCrashMessage(output.getStdout()));
         }
         if (output.getStdout().contains("TEST FAILED")) {
             throw new RuntimeException("Test Failed");

From 73501b274faef43829ea8e2ec89706c72fcd2e68 Mon Sep 17 00:00:00 2001
From: Justin Lu <jlu@openjdk.org>
Date: Mon, 30 Mar 2026 16:49:09 +0000
Subject: [PATCH 417/655] 8380848: jdk/nio/zipfs/ZipFSTester.java fails after
 JDK-8378884

Reviewed-by: lancea, syan
---
 test/jdk/jdk/nio/zipfs/ZipFSTester.java | 46 +++++++++++++++----------
 1 file changed, 27 insertions(+), 19 deletions(-)

diff --git a/test/jdk/jdk/nio/zipfs/ZipFSTester.java b/test/jdk/jdk/nio/zipfs/ZipFSTester.java
index 84135fd0d7d..9d70350272f 100644
--- a/test/jdk/jdk/nio/zipfs/ZipFSTester.java
+++ b/test/jdk/jdk/nio/zipfs/ZipFSTester.java
@@ -21,6 +21,7 @@
  * questions.
  */
 
+import org.junit.jupiter.api.AfterAll;
 import org.junit.jupiter.api.BeforeAll;
 import org.junit.jupiter.api.Test;
 
@@ -97,14 +98,21 @@ public class ZipFSTester {
 
     // create JAR file for test, actual contents don't matter
     static Path jarFile;
+    static String[] jarContents = new String[]{
+            "META-INF/MANIFEST.MF",
+            "dir1/foo",
+            "dir2/bar",
+            "dir1/dir3/fooo"
+    };
 
     @BeforeAll
     static void setup() throws Exception {
-        jarFile = Utils.createJarFile("tester.jar",
-                "META-INF/MANIFEST.MF",
-                "dir1/foo",
-                "dir2/bar",
-                "dir1/dir3/fooo");
+        jarFile = Utils.createJarFile("tester.jar", jarContents);
+    }
+
+    @AfterAll
+    static void cleanup() throws IOException {
+        Files.deleteIfExists(jarFile);
     }
 
     @Test
@@ -583,19 +591,18 @@ public class ZipFSTester {
     // test file stamp
     @Test
     void testTime() throws Exception {
+        var jar = Utils.createJarFile(System.currentTimeMillis() + ".jar", jarContents);
         BasicFileAttributes attrs = Files
-                        .getFileAttributeView(jarFile, BasicFileAttributeView.class)
+                        .getFileAttributeView(jar, BasicFileAttributeView.class)
                         .readAttributes();
         // create a new filesystem, copy this file into it
-        Map<String, Object> env = new HashMap<String, Object>();
-        env.put("create", "true");
         Path fsPath = getTempPath();
-        try (FileSystem fs = newZipFileSystem(fsPath, env)) {
+        try (FileSystem fs = FileSystems.newFileSystem(fsPath, Map.of("create", "true"))) {
             System.out.println("test copy with timestamps...");
             // copyin
-            Path dst = getPathWithParents(fs, "me");
-            Files.copy(jarFile, dst, COPY_ATTRIBUTES);
-            checkEqual(jarFile, dst);
+            Path dst = fs.getPath("me");
+            Files.copy(jar, dst, COPY_ATTRIBUTES);
+            checkEqual(jar, dst);
             System.out.println("mtime: " + attrs.lastModifiedTime());
             System.out.println("ctime: " + attrs.creationTime());
             System.out.println("atime: " + attrs.lastAccessTime());
@@ -608,14 +615,15 @@ public class ZipFSTester {
             System.out.println("atime: " + dstAttrs.lastAccessTime());
 
             // 1-second granularity
-            assertFalse(attrs.lastModifiedTime().to(TimeUnit.SECONDS) !=
-                dstAttrs.lastModifiedTime().to(TimeUnit.SECONDS) ||
-                attrs.lastAccessTime().to(TimeUnit.SECONDS) !=
-                dstAttrs.lastAccessTime().to(TimeUnit.SECONDS) ||
-                attrs.creationTime().to(TimeUnit.SECONDS) !=
-                dstAttrs.creationTime().to(TimeUnit.SECONDS), "Timestamp Copy Failed!");
+            assertEquals(attrs.lastModifiedTime().to(TimeUnit.SECONDS),
+                    dstAttrs.lastModifiedTime().to(TimeUnit.SECONDS), "Last modified time incorrect");
+            assertEquals(attrs.lastAccessTime().to(TimeUnit.SECONDS),
+                    dstAttrs.lastAccessTime().to(TimeUnit.SECONDS), "Last access time incorrect");
+            assertEquals(attrs.creationTime().to(TimeUnit.SECONDS),
+                    dstAttrs.creationTime().to(TimeUnit.SECONDS), "Last creation time incorrect");
         } finally {
-            Files.delete(fsPath);
+            Files.deleteIfExists(fsPath);
+            Files.deleteIfExists(jar);
         }
     }
 

From 0c4156d599868992cce34605bc5bd1b9a072b502 Mon Sep 17 00:00:00 2001
From: Alexander Matveev <almatvee@openjdk.org>
Date: Mon, 30 Mar 2026 22:02:48 +0000
Subject: [PATCH 418/655] 8380634: [macos] Remove macOS version restrictions on
 start with zero and limit to three components

Reviewed-by: asemenyuk
---
 .../jpackage/internal/CFBundleVersion.java    | 25 +++++--------------
 .../resources/MacResources.properties         |  4 +--
 .../resources/MacResources_de.properties      |  2 --
 .../resources/MacResources_ja.properties      |  2 --
 .../resources/MacResources_zh_CN.properties   |  2 --
 .../internal/PlatformVersionTest.java         | 10 ++------
 .../cli/OptionsValidationFailTest.excludes    |  2 --
 .../tools/jpackage/share/AppVersionTest.java  | 22 +++++++++++++---
 test/jdk/tools/jpackage/share/ErrorTest.java  |  6 -----
 9 files changed, 27 insertions(+), 48 deletions(-)

diff --git a/src/jdk.jpackage/macosx/classes/jdk/jpackage/internal/CFBundleVersion.java b/src/jdk.jpackage/macosx/classes/jdk/jpackage/internal/CFBundleVersion.java
index 17c310dbe56..30b79b563da 100644
--- a/src/jdk.jpackage/macosx/classes/jdk/jpackage/internal/CFBundleVersion.java
+++ b/src/jdk.jpackage/macosx/classes/jdk/jpackage/internal/CFBundleVersion.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2020, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -24,7 +24,6 @@
  */
 package jdk.jpackage.internal;
 
-import java.math.BigInteger;
 import jdk.jpackage.internal.model.DottedVersion;
 
 
@@ -33,25 +32,13 @@ final class CFBundleVersion {
      * Parse the given string as OSX CFBundleVersion.
      * CFBundleVersion (String - iOS, OS X) specifies the build version number of
      * the bundle, which identifies an iteration (released or unreleased) of the
-     * bundle. The build version number should be a string comprised of at most three
-     * non-negative, period-separated integers with the first integer being greater
-     * than zero.
+     * bundle. The build version number should be a string comprised of non-negative,
+     * period-separated integers. macOS will ignore anything after 3 components, but
+     * it acceptable to have more then 3 components.
+     *
      * @throws IllegalArgumentException
      */
     static DottedVersion of(String value) {
-        DottedVersion ver = DottedVersion.greedy(value);
-
-        BigInteger[] components = ver.getComponents();
-        if (components.length > 3) {
-            throw new IllegalArgumentException(I18N.getString(
-                    "message.version-string-too-many-components"));
-        }
-
-        if (BigInteger.ZERO.equals(components[0])) {
-            throw new IllegalArgumentException(I18N.getString(
-                    "message.version-string-first-number-not-zero"));
-        }
-
-        return ver;
+        return DottedVersion.greedy(value);
     }
 }
diff --git a/src/jdk.jpackage/macosx/classes/jdk/jpackage/internal/resources/MacResources.properties b/src/jdk.jpackage/macosx/classes/jdk/jpackage/internal/resources/MacResources.properties
index 2ed1f740805..f181bbf79af 100644
--- a/src/jdk.jpackage/macosx/classes/jdk/jpackage/internal/resources/MacResources.properties
+++ b/src/jdk.jpackage/macosx/classes/jdk/jpackage/internal/resources/MacResources.properties
@@ -23,7 +23,7 @@
 # questions.
 #
 #
-error.invalid-cfbundle-version.advice=Set a compatible 'app-version' value. Valid versions are one to three integers separated by dots.
+error.invalid-cfbundle-version.advice=Set a compatible 'app-version' value. Valid version is a string comprised of non-negative, period-separated integers.
 error.certificate.outside-validity-period=The certificate "{0}" is outside its validity period
 error.cert.not.found=No certificate found matching [{0}] using keychain [{1}]
 error.multiple.certs.found=Multiple certificates matching name [{0}] found in keychain [{1}]
@@ -56,8 +56,6 @@ resource.launchd-plist-file=launchd plist file
 message.bundle-name-too-long-warning={0} is set to ''{1}'', which is longer than 16 characters. For a better Mac experience consider shortening it.
 message.preparing-info-plist=Preparing Info.plist: {0}.
 message.icon-not-icns= The specified icon "{0}" is not an ICNS file and will not be used. The default icon will be used in it's place.
-message.version-string-too-many-components='app-version' may have between 1 and 3 numbers: 1, 1.2, 1.2.3.
-message.version-string-first-number-not-zero=The first number in an app-version cannot be zero or negative.
 message.keychain.error=Unable to get keychain list.
 message.derived-bundle-identifier=Derived bundle identifier: {0}
 message.preparing-dmg-setup=Preparing dmg setup: {0}.
diff --git a/src/jdk.jpackage/macosx/classes/jdk/jpackage/internal/resources/MacResources_de.properties b/src/jdk.jpackage/macosx/classes/jdk/jpackage/internal/resources/MacResources_de.properties
index 367f3216f85..02e8c029ec6 100644
--- a/src/jdk.jpackage/macosx/classes/jdk/jpackage/internal/resources/MacResources_de.properties
+++ b/src/jdk.jpackage/macosx/classes/jdk/jpackage/internal/resources/MacResources_de.properties
@@ -54,8 +54,6 @@ resource.launchd-plist-file=launchd-PLIST-Datei
 message.bundle-name-too-long-warning={0} ist auf "{1}" gesetzt. Dies ist länger als 16 Zeichen. Kürzen Sie den Wert, um die Mac-Nutzungserfahrung zu verbessern.
 message.preparing-info-plist=Info.plist wird vorbereitet: {0}.
 message.icon-not-icns= Das angegebene Symbol "{0}" ist keine ICNS-Datei und wird nicht verwendet. Stattdessen wird das Standardsymbol verwendet.
-message.version-string-too-many-components="app-version" darf ein bis drei Zahlen aufweisen: 1, 1.2, 1.2.3.
-message.version-string-first-number-not-zero=Die erste Zahl in app-version darf nicht null oder negativ sein.
 message.keychain.error=Schlüsselbundliste kann nicht abgerufen werden.
 message.invalid-identifier=Ungültige Mac-Bundle-ID [{0}].
 message.invalid-identifier.advice=Geben Sie die ID mit "--mac-package-identifier" an.
diff --git a/src/jdk.jpackage/macosx/classes/jdk/jpackage/internal/resources/MacResources_ja.properties b/src/jdk.jpackage/macosx/classes/jdk/jpackage/internal/resources/MacResources_ja.properties
index ba2497d30dd..c9de142d796 100644
--- a/src/jdk.jpackage/macosx/classes/jdk/jpackage/internal/resources/MacResources_ja.properties
+++ b/src/jdk.jpackage/macosx/classes/jdk/jpackage/internal/resources/MacResources_ja.properties
@@ -54,8 +54,6 @@ resource.launchd-plist-file=launchd plistファイル
 message.bundle-name-too-long-warning={0}が16文字を超える''{1}''に設定されています。Macでの操作性をより良くするために短くすることを検討してください。
 message.preparing-info-plist=Info.plistを準備しています: {0}。
 message.icon-not-icns= 指定したアイコン"{0}"はICNSファイルではなく、使用されません。デフォルト・アイコンがその位置に使用されます。
-message.version-string-too-many-components='app-version'には、1、1.2、1.2.3など1から3の数字を使用できます。
-message.version-string-first-number-not-zero=pp-versionの最初の数字は、ゼロまたは負の値にできません。
 message.keychain.error=キーチェーン・リストを取得できません。
 message.invalid-identifier=macバンドル識別子[{0}]が無効です。
 message.invalid-identifier.advice="--mac-package-identifier"で識別子を指定してください。
diff --git a/src/jdk.jpackage/macosx/classes/jdk/jpackage/internal/resources/MacResources_zh_CN.properties b/src/jdk.jpackage/macosx/classes/jdk/jpackage/internal/resources/MacResources_zh_CN.properties
index f855a31caae..9a925859af5 100644
--- a/src/jdk.jpackage/macosx/classes/jdk/jpackage/internal/resources/MacResources_zh_CN.properties
+++ b/src/jdk.jpackage/macosx/classes/jdk/jpackage/internal/resources/MacResources_zh_CN.properties
@@ -54,8 +54,6 @@ resource.launchd-plist-file=launchd plist 文件
 message.bundle-name-too-long-warning={0}已设置为 ''{1}'', 其长度超过了 16 个字符。为了获得更好的 Mac 体验, 请考虑将其缩短。
 message.preparing-info-plist=正在准备 Info.plist: {0}。
 message.icon-not-icns= 指定的图标 "{0}" 不是 ICNS 文件, 不会使用。将使用默认图标代替。
-message.version-string-too-many-components='app-version' 可以包含 1 到 3 个数字：1、1.2、1.2.3。
-message.version-string-first-number-not-zero=app-version 中的第一个数字不能为零或负数。
 message.keychain.error=无法获取密钥链列表。
 message.invalid-identifier=mac 包标识符 [{0}] 无效。
 message.invalid-identifier.advice=请使用 "--mac-package-identifier" 指定标识符。
diff --git a/test/jdk/tools/jpackage/junit/share/jdk.jpackage/jdk/jpackage/internal/PlatformVersionTest.java b/test/jdk/tools/jpackage/junit/share/jdk.jpackage/jdk/jpackage/internal/PlatformVersionTest.java
index 5e3e27caced..60933214c59 100644
--- a/test/jdk/tools/jpackage/junit/share/jdk.jpackage/jdk/jpackage/internal/PlatformVersionTest.java
+++ b/test/jdk/tools/jpackage/junit/share/jdk.jpackage/jdk/jpackage/internal/PlatformVersionTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2019, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2019, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -62,17 +62,11 @@ public class PlatformVersionTest {
     }
 
     @ParameterizedTest
-    @ValueSource(strings = {"1", "1.2", "1.2.3"})
+    @ValueSource(strings = {"0", "0.1", "1", "1.2", "1.2.3", "1.2.3.4"})
     public void testValidCfBundleVersion(String version) {
         testImpl(PlatformVersion.MAC_CFBUNDLE_VERSION_CLASS, version, true);
     }
 
-    @ParameterizedTest
-    @ValueSource(strings = {"0", "0.1", "1.2.3.4"})
-    public void testInvalidCfBundleVersion(String version) {
-        testImpl(PlatformVersion.MAC_CFBUNDLE_VERSION_CLASS, version, false);
-    }
-
     private static void testImpl(PlatformVersion parser, String version, boolean valid) {
         assumeTrue(parser.parser != null);
         if (valid) {
diff --git a/test/jdk/tools/jpackage/junit/share/jdk.jpackage/jdk/jpackage/internal/cli/OptionsValidationFailTest.excludes b/test/jdk/tools/jpackage/junit/share/jdk.jpackage/jdk/jpackage/internal/cli/OptionsValidationFailTest.excludes
index a7a65402b9c..52da229afa7 100644
--- a/test/jdk/tools/jpackage/junit/share/jdk.jpackage/jdk/jpackage/internal/cli/OptionsValidationFailTest.excludes
+++ b/test/jdk/tools/jpackage/junit/share/jdk.jpackage/jdk/jpackage/internal/cli/OptionsValidationFailTest.excludes
@@ -1,5 +1,3 @@
-ErrorTest.test(IMAGE; app-desc=Hello; args-add=[--app-version, 0.2]; errors=[message.error-header+[message.version-string-first-number-not-zero], message.advice-header+[error.invalid-cfbundle-version.advice]])
-ErrorTest.test(IMAGE; app-desc=Hello; args-add=[--app-version, 1.2.3.4]; errors=[message.error-header+[message.version-string-too-many-components], message.advice-header+[error.invalid-cfbundle-version.advice]])
 ErrorTest.test(IMAGE; app-desc=Hello; args-add=[--app-version, 1.]; errors=[message.error-header+[error.version-string-zero-length-component, 1.], message.advice-header+[error.invalid-cfbundle-version.advice]])
 ErrorTest.test(IMAGE; app-desc=Hello; args-add=[--app-version, 1.]; errors=[message.error-header+[error.version-string-zero-length-component, 1.]])
 ErrorTest.test(IMAGE; app-desc=Hello; args-add=[--app-version, 1.b.3]; errors=[message.error-header+[error.version-string-invalid-component, 1.b.3, b.3], message.advice-header+[error.invalid-cfbundle-version.advice]])
diff --git a/test/jdk/tools/jpackage/share/AppVersionTest.java b/test/jdk/tools/jpackage/share/AppVersionTest.java
index 598ee1551b3..2dab3c7387b 100644
--- a/test/jdk/tools/jpackage/share/AppVersionTest.java
+++ b/test/jdk/tools/jpackage/share/AppVersionTest.java
@@ -47,6 +47,7 @@ import java.util.Set;
 import java.util.function.Consumer;
 import java.util.function.Predicate;
 import jdk.internal.util.OperatingSystem;
+import jdk.jpackage.internal.model.DottedVersion;
 import jdk.jpackage.internal.util.MacBundle;
 import jdk.jpackage.internal.util.RuntimeReleaseFile;
 import jdk.jpackage.internal.util.Slot;
@@ -173,6 +174,16 @@ public final class AppVersionTest {
             AppTestSpec.create(builder, testCases::add);
         }
 
+        if (TKit.isOSX()) {
+            // Ensure "0.1" is a valid version on macOS.
+            AppTestSpec.create("Hello", TestSpec.build()
+                    .versionFromCmdline("0.1"), testCases::add);
+
+            // Ensure "1.2.3.4.5" is a valid version on macOS.
+            AppTestSpec.create("Hello", TestSpec.build()
+                    .versionFromCmdline("1.2.3.4.5"), testCases::add);
+        }
+
         return testCases.stream().map(v -> {
             return new Object[] {v};
         }).toList();
@@ -484,10 +495,13 @@ public final class AppVersionTest {
                             : cmd.pathToUnpackedPackageFile(cmd.appInstallationDirectory());
                     var plist = MacHelper.readPListFromAppImage(bundleRoot);
                     var expectedVersion = expected.get(cmd.packageType()).version();
-                    for (var prop : List.of("CFBundleVersion", "CFBundleShortVersionString")) {
-                        TKit.assertEquals(expectedVersion, plist.queryValue(prop),
-                                String.format("Check the value of '%s' property in [%s] bundle", prop, bundleRoot));
-                    }
+                    TKit.assertEquals(expectedVersion, plist.queryValue("CFBundleVersion"),
+                            String.format("Check the value of '%s' property in [%s] bundle",
+                            "CFBundleVersion", bundleRoot));
+                    TKit.assertEquals(DottedVersion.lazy(expectedVersion).trim(3).toComponentsString(),
+                            plist.queryValue("CFBundleShortVersionString"),
+                            String.format("Check the value of '%s' property in [%s] bundle",
+                            "CFBundleShortVersionString", bundleRoot));
                 });
             }
         }
diff --git a/test/jdk/tools/jpackage/share/ErrorTest.java b/test/jdk/tools/jpackage/share/ErrorTest.java
index ed5865024fa..ba0f5663d45 100644
--- a/test/jdk/tools/jpackage/share/ErrorTest.java
+++ b/test/jdk/tools/jpackage/share/ErrorTest.java
@@ -1002,12 +1002,6 @@ public final class ErrorTest {
         final List<TestSpec> testCases = new ArrayList<>();
 
         testCases.addAll(Stream.of(
-                testSpec().addArgs("--app-version", "0.2")
-                        .error("message.version-string-first-number-not-zero")
-                        .advice("error.invalid-cfbundle-version.advice"),
-                testSpec().addArgs("--app-version", "1.2.3.4")
-                        .error("message.version-string-too-many-components")
-                        .advice("error.invalid-cfbundle-version.advice"),
                 testSpec().invalidTypeArg("--mac-installer-sign-identity", "foo"),
                 testSpec().type(PackageType.MAC_DMG).invalidTypeArg("--mac-installer-sign-identity", "foo"),
                 testSpec().invalidTypeArg("--mac-dmg-content", "foo"),

From 6350c3641e2a6cbb15aaaf2f62ebd2007eca3954 Mon Sep 17 00:00:00 2001
From: Ioi Lam <iklam@openjdk.org>
Date: Mon, 30 Mar 2026 23:14:13 +0000
Subject: [PATCH 419/655] 8377703: Assert that all AOT heap objects have valid
 classes

Reviewed-by: kvn, eosterlund
---
 src/hotspot/share/cds/archiveUtils.hpp | 38 +++++++++++++++++++++++++-
 src/hotspot/share/cds/heapShared.cpp   | 25 +++++++++++++++++
 2 files changed, 62 insertions(+), 1 deletion(-)

diff --git a/src/hotspot/share/cds/archiveUtils.hpp b/src/hotspot/share/cds/archiveUtils.hpp
index 84ad8e6bdf3..42455adedd0 100644
--- a/src/hotspot/share/cds/archiveUtils.hpp
+++ b/src/hotspot/share/cds/archiveUtils.hpp
@@ -36,6 +36,8 @@
 #include "runtime/semaphore.hpp"
 #include "utilities/bitMap.hpp"
 #include "utilities/exceptions.hpp"
+#include "utilities/growableArray.hpp"
+#include "utilities/hashTable.hpp"
 #include "utilities/macros.hpp"
 
 class BootstrapInfo;
@@ -44,7 +46,6 @@ class ReservedSpace;
 class VirtualSpace;
 
 template<class E> class Array;
-template<class E> class GrowableArray;
 
 // ArchivePtrMarker is used to mark the location of pointers embedded in a CDS archive. E.g., when an
 // InstanceKlass k is dumped, we mark the location of the k->_name pointer by effectively calling
@@ -401,4 +402,39 @@ public:
   void run_task(ArchiveWorkerTask* task);
 };
 
+// A utility class for writing an array of unique items into the
+// AOT cache. For determinism, the order of the array is the same
+// as calls to add(). I.e., if items are added in the order
+// of A, B, A, C, B, D, then the array will be written as {A, B, C, D}
+template <typename T, unsigned SIZE = 15889>
+class ArchivableTable : public AnyObj {
+  using Table = HashTable<T, bool, SIZE, AnyObj::C_HEAP, mtClassShared>;
+  Table* _seen_items;
+  GrowableArray<T>* _ordered_array;
+public:
+  ArchivableTable() {
+    _seen_items = new (mtClassShared)Table();
+     _ordered_array = new (mtClassShared)GrowableArray<T>(128, mtClassShared);
+  }
+
+  ~ArchivableTable() {
+    delete _seen_items;
+    delete _ordered_array;
+  }
+
+  void add(T t) {
+    bool created;
+    _seen_items->put_if_absent(t, &created);
+    if (created) {
+      _ordered_array->append(t);
+    }
+  }
+
+  Array<T>* write_ordered_array() {
+    return ArchiveUtils::archive_array(_ordered_array);
+  }
+};
+
+using ArchivableKlassTable = ArchivableTable<Klass*>;
+
 #endif // SHARE_CDS_ARCHIVEUTILS_HPP
diff --git a/src/hotspot/share/cds/heapShared.cpp b/src/hotspot/share/cds/heapShared.cpp
index 3d10e7e1f88..f721b4b370c 100644
--- a/src/hotspot/share/cds/heapShared.cpp
+++ b/src/hotspot/share/cds/heapShared.cpp
@@ -112,6 +112,11 @@ static Klass* _test_class = nullptr;
 static const ArchivedKlassSubGraphInfoRecord* _test_class_record = nullptr;
 #endif
 
+#ifdef ASSERT
+// All classes that have at least one instance in the cached heap.
+static ArchivableKlassTable* _dumptime_classes_with_cached_oops = nullptr;
+static Array<Klass*>* _runtime_classes_with_cached_oops = nullptr;
+#endif
 
 //
 // If you add new entries to the following tables, you should know what you're doing!
@@ -391,6 +396,21 @@ void HeapShared::initialize_streaming() {
 }
 
 void HeapShared::enable_gc() {
+#ifdef ASSERT
+  // At this point, a GC may start and will be able to see some or all
+  // of the cached oops. The class of each oop seen by the GC must have
+  // already been loaded. One function with such a requirement is
+  // ClaimMetadataVisitingOopIterateClosure::do_klass().
+  if (is_archived_heap_in_use()) {
+    Array<Klass*>* klasses = _runtime_classes_with_cached_oops;
+
+    for (int i = 0; i < klasses->length(); i++) {
+      assert(klasses->at(i)->class_loader_data() != nullptr,
+             "class of cached oop must have been loaded");
+    }
+  }
+#endif
+
   if (AOTStreamedHeapLoader::is_in_use()) {
     AOTStreamedHeapLoader::enable_gc();
   }
@@ -567,6 +587,7 @@ bool HeapShared::archive_object(oop obj, oop referrer, KlassSubGraphInfo* subgra
   AOTArtifactFinder::add_cached_class(obj->klass());
   AOTOopChecker::check(obj); // Make sure contents of this oop are safe.
   count_allocation(obj->size());
+  DEBUG_ONLY(_dumptime_classes_with_cached_oops->add(obj->klass()));
 
   if (HeapShared::is_writing_streaming_mode()) {
     AOTStreamedHeapWriter::add_source_obj(obj);
@@ -686,6 +707,7 @@ void HeapShared::init_dumping() {
   _scratch_objects_table = new (mtClass)MetaspaceObjToOopHandleTable();
   _pending_roots = new GrowableArrayCHeap<oop, mtClassShared>(500);
   _pending_roots->append(nullptr); // root index 0 represents a null oop
+  DEBUG_ONLY(_dumptime_classes_with_cached_oops = new (mtClassShared)ArchivableKlassTable());
 }
 
 void HeapShared::init_scratch_objects_for_basic_type_mirrors(TRAPS) {
@@ -967,6 +989,8 @@ void HeapShared::write_heap(AOTMappedHeapInfo* mapped_heap_info, AOTStreamedHeap
   ArchiveBuilder::OtherROAllocMark mark;
   write_subgraph_info_table();
 
+  DEBUG_ONLY(_runtime_classes_with_cached_oops = _dumptime_classes_with_cached_oops->write_ordered_array());
+
   delete _pending_roots;
   _pending_roots = nullptr;
 
@@ -1278,6 +1302,7 @@ void HeapShared::serialize_tables(SerializeClosure* soc) {
 
   _run_time_subgraph_info_table.serialize_header(soc);
   soc->do_ptr(&_run_time_special_subgraph);
+  DEBUG_ONLY(soc->do_ptr(&_runtime_classes_with_cached_oops));
 }
 
 static void verify_the_heap(Klass* k, const char* which) {

From 6649eee753760d192ee6be10d0e7b0ca09179bff Mon Sep 17 00:00:00 2001
From: Alexey Semenyuk <asemenyuk@openjdk.org>
Date: Tue, 31 Mar 2026 00:03:46 +0000
Subject: [PATCH 420/655] 8381367: [lworld]
 tools/jpackage/share/AppVersionTest.java timed out while reporting errors

Reviewed-by: almatvee
---
 .../tools/jpackage/helpers/jdk/jpackage/test/MacHelper.java | 6 +++---
 test/jdk/tools/jpackage/share/AppVersionTest.java           | 5 +----
 2 files changed, 4 insertions(+), 7 deletions(-)

diff --git a/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/MacHelper.java b/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/MacHelper.java
index 1372058d440..4e0d57631b9 100644
--- a/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/MacHelper.java
+++ b/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/MacHelper.java
@@ -557,10 +557,10 @@ public final class MacHelper {
 
         final var unpackedRuntimeBundleDir = runtimeBundleWorkDir.resolve("unpacked");
 
-        // Preferably create a DMG bundle, fallback to PKG if DMG packaging is disabled.
+        // Preferably create a PKG bundle, fallback to DMG if PKG packaging is disabled.
         new PackageTest().forTypes(Stream.of(
-                PackageType.MAC_DMG,
-                PackageType.MAC_PKG
+                PackageType.MAC_PKG,
+                PackageType.MAC_DMG
         ).filter(PackageType::isEnabled).findFirst().orElseThrow(PackageType::throwSkippedExceptionIfNativePackagingUnavailable))
         .addInitializer(cmd -> {
             cmd.useToolProvider(true)
diff --git a/test/jdk/tools/jpackage/share/AppVersionTest.java b/test/jdk/tools/jpackage/share/AppVersionTest.java
index 2dab3c7387b..2ef7f95398e 100644
--- a/test/jdk/tools/jpackage/share/AppVersionTest.java
+++ b/test/jdk/tools/jpackage/share/AppVersionTest.java
@@ -71,7 +71,7 @@ import jdk.jpackage.test.TKit;
  * @library /test/jdk/tools/jpackage/helpers
  * @build jdk.jpackage.test.*
  * @compile -Xlint:all -Werror AppVersionTest.java
- * @run main/othervm/timeout=1440 -Xmx512m jdk.jpackage.test.Main
+ * @run main/othervm/timeout=2880 -Xmx512m jdk.jpackage.test.Main
  *  --jpt-run=AppVersionTest
  */
 
@@ -1003,9 +1003,6 @@ public final class AppVersionTest {
                     });
                     yield MacBundle.fromPath(predefinedRuntimeDir).orElseThrow().homeDir();
                 }
-                default -> {
-                    throw new AssertionError();
-                }
             };
 
             releaseFileVersion.ifPresent(ver -> {

From 2eec71a500e8df02f5abc7d1e65bdf06da5a2efc Mon Sep 17 00:00:00 2001
From: Prasanta Sadhukhan <psadhukhan@openjdk.org>
Date: Tue, 31 Mar 2026 01:19:46 +0000
Subject: [PATCH 421/655] 8380422: Fix Formatting issues missed in JDK-8380125

Reviewed-by: dnguyen, serb
---
 .../classes/javax/swing/AbstractButton.java   |  2 +-
 .../swing/ActionPropertyChangeListener.java   |  2 +-
 .../classes/javax/swing/AncestorNotifier.java |  2 +-
 .../share/classes/javax/swing/ArrayTable.java |  8 +-
 .../share/classes/javax/swing/JComboBox.java  |  4 +-
 .../share/classes/javax/swing/JList.java      |  2 +-
 .../share/classes/javax/swing/JTextField.java |  4 +-
 .../share/classes/javax/swing/JTree.java      |  2 +-
 .../classes/javax/swing/KeyboardManager.java  |  2 +-
 .../share/classes/javax/swing/UIDefaults.java |  4 +-
 .../swing/plaf/basic/BasicComboPopup.java     | 76 +++++++++----------
 .../javax/swing/plaf/basic/BasicListUI.java   |  2 +-
 .../swing/plaf/basic/BasicMenuBarUI.java      |  8 +-
 .../swing/plaf/basic/BasicPopupMenuUI.java    |  2 +-
 .../swing/plaf/basic/BasicSpinnerUI.java      |  2 +-
 .../swing/plaf/basic/BasicTabbedPaneUI.java   | 26 +++----
 .../swing/plaf/basic/BasicToolBarUI.java      |  2 +-
 .../javax/swing/plaf/basic/BasicTreeUI.java   |  2 +-
 .../plaf/nimbus/AbstractRegionPainter.java    |  2 +-
 .../swing/plaf/nimbus/NimbusLookAndFeel.java  |  2 +-
 .../swing/plaf/nimbus/SynthPainterImpl.java   |  2 +-
 .../swing/plaf/synth/SynthComboBoxUI.java     |  2 +-
 .../swing/plaf/synth/SynthScrollPaneUI.java   |  2 +-
 .../classes/javax/swing/text/TextAction.java  |  2 +-
 .../swing/tree/DefaultTreeCellEditor.java     |  2 +-
 25 files changed, 83 insertions(+), 83 deletions(-)

diff --git a/src/java.desktop/share/classes/javax/swing/AbstractButton.java b/src/java.desktop/share/classes/javax/swing/AbstractButton.java
index a1961acce29..ad5f0eba3de 100644
--- a/src/java.desktop/share/classes/javax/swing/AbstractButton.java
+++ b/src/java.desktop/share/classes/javax/swing/AbstractButton.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1997, 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
diff --git a/src/java.desktop/share/classes/javax/swing/ActionPropertyChangeListener.java b/src/java.desktop/share/classes/javax/swing/ActionPropertyChangeListener.java
index 19b9152a1b5..7d33e936b7b 100644
--- a/src/java.desktop/share/classes/javax/swing/ActionPropertyChangeListener.java
+++ b/src/java.desktop/share/classes/javax/swing/ActionPropertyChangeListener.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1999, 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1999, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
diff --git a/src/java.desktop/share/classes/javax/swing/AncestorNotifier.java b/src/java.desktop/share/classes/javax/swing/AncestorNotifier.java
index a3ed463d2d5..3606bdc9c0b 100644
--- a/src/java.desktop/share/classes/javax/swing/AncestorNotifier.java
+++ b/src/java.desktop/share/classes/javax/swing/AncestorNotifier.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1997, 2012, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
diff --git a/src/java.desktop/share/classes/javax/swing/ArrayTable.java b/src/java.desktop/share/classes/javax/swing/ArrayTable.java
index 282bd3454ca..4941264c0fe 100644
--- a/src/java.desktop/share/classes/javax/swing/ArrayTable.java
+++ b/src/java.desktop/share/classes/javax/swing/ArrayTable.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -148,7 +148,7 @@ class ArrayTable implements Cloneable {
         if (table != null) {
             if (isArray()) {
                 Object[] array = (Object[])table;
-                for (int i = 0; i<array.length-1; i+=2) {
+                for (int i = 0; i < array.length-1; i += 2) {
                     if (array[i].equals(key)) {
                         value = array[i+1];
                         break;
@@ -184,7 +184,7 @@ class ArrayTable implements Cloneable {
         if (table != null) {
             if (isArray()) {
                 Object[] array = (Object[])table;
-                for (int i = 0; i<array.length-1; i+=2) {
+                for (int i = 0; i < array.length-1; i += 2) {
                     if (array[i].equals(key)) {
                         contains = true;
                         break;
@@ -203,7 +203,7 @@ class ArrayTable implements Cloneable {
      */
     public Object remove(Object key){
         Object value = null;
-        if (key==null) {
+        if (key == null) {
             return null;
         }
         if (table != null) {
diff --git a/src/java.desktop/share/classes/javax/swing/JComboBox.java b/src/java.desktop/share/classes/javax/swing/JComboBox.java
index af7c5a01a7e..5ab54119cde 100644
--- a/src/java.desktop/share/classes/javax/swing/JComboBox.java
+++ b/src/java.desktop/share/classes/javax/swing/JComboBox.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1997, 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -1101,7 +1101,7 @@ implements ItemSelectable,ListDataListener,ActionListener, Accessible {
             = "the Action instance connected with this ActionEvent source")
     public void setAction(Action a) {
         Action oldValue = getAction();
-        if (action==null || !action.equals(a)) {
+        if (action == null || !action.equals(a)) {
             action = a;
             if (oldValue != null) {
                 removeActionListener(oldValue);
diff --git a/src/java.desktop/share/classes/javax/swing/JList.java b/src/java.desktop/share/classes/javax/swing/JList.java
index f3620be02b4..75e88b75b5b 100644
--- a/src/java.desktop/share/classes/javax/swing/JList.java
+++ b/src/java.desktop/share/classes/javax/swing/JList.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1997, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
diff --git a/src/java.desktop/share/classes/javax/swing/JTextField.java b/src/java.desktop/share/classes/javax/swing/JTextField.java
index b6d8639c994..d56e450aca4 100644
--- a/src/java.desktop/share/classes/javax/swing/JTextField.java
+++ b/src/java.desktop/share/classes/javax/swing/JTextField.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1997, 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -579,7 +579,7 @@ public class JTextField extends JTextComponent implements SwingConstants {
             = "the Action instance connected with this ActionEvent source")
     public void setAction(Action a) {
         Action oldValue = getAction();
-        if (action==null || !action.equals(a)) {
+        if (action == null || !action.equals(a)) {
             action = a;
             if (oldValue != null) {
                 removeActionListener(oldValue);
diff --git a/src/java.desktop/share/classes/javax/swing/JTree.java b/src/java.desktop/share/classes/javax/swing/JTree.java
index 397584b6e4a..6af2ca31c5b 100644
--- a/src/java.desktop/share/classes/javax/swing/JTree.java
+++ b/src/java.desktop/share/classes/javax/swing/JTree.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1997, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
diff --git a/src/java.desktop/share/classes/javax/swing/KeyboardManager.java b/src/java.desktop/share/classes/javax/swing/KeyboardManager.java
index 8206ab5cea6..54a60b5d172 100644
--- a/src/java.desktop/share/classes/javax/swing/KeyboardManager.java
+++ b/src/java.desktop/share/classes/javax/swing/KeyboardManager.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1998, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1998, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
diff --git a/src/java.desktop/share/classes/javax/swing/UIDefaults.java b/src/java.desktop/share/classes/javax/swing/UIDefaults.java
index 67a739360f9..1d6b7257273 100644
--- a/src/java.desktop/share/classes/javax/swing/UIDefaults.java
+++ b/src/java.desktop/share/classes/javax/swing/UIDefaults.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1997, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -1171,7 +1171,7 @@ public class UIDefaults extends Hashtable<Object,Object>
             Class<?>[] types = null;
             if (args != null) {
                 types = new Class<?>[args.length];
-                for (int i = 0; i< args.length; i++) {
+                for (int i = 0; i < args.length; i++) {
                     /* PENDING(ges): At present only the primitive types
                        used are handled correctly; this should eventually
                        handle all primitive types */
diff --git a/src/java.desktop/share/classes/javax/swing/plaf/basic/BasicComboPopup.java b/src/java.desktop/share/classes/javax/swing/plaf/basic/BasicComboPopup.java
index 42791772c2d..d825dd73e9c 100644
--- a/src/java.desktop/share/classes/javax/swing/plaf/basic/BasicComboPopup.java
+++ b/src/java.desktop/share/classes/javax/swing/plaf/basic/BasicComboPopup.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1998, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1998, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -243,8 +243,8 @@ public class BasicComboPopup extends JPopupMenu implements ComboPopup {
     public void hide() {
         MenuSelectionManager manager = MenuSelectionManager.defaultManager();
         MenuElement [] selection = manager.getSelectedPath();
-        for ( int i = 0 ; i < selection.length ; i++ ) {
-            if ( selection[i] == this ) {
+        for (int i = 0 ; i < selection.length; i++ ) {
+            if (selection[i] == this) {
                 manager.clearSelectedPath();
                 break;
             }
@@ -924,7 +924,7 @@ public class BasicComboPopup extends JPopupMenu implements ComboPopup {
             if (!SwingUtilities.isLeftMouseButton(e) || !comboBox.isEnabled() || !comboBox.isShowing())
                 return;
 
-            if ( comboBox.isEditable() ) {
+            if (comboBox.isEditable()) {
                 Component comp = comboBox.getEditor().getEditorComponent();
                 if ((!(comp instanceof JComponent)) || ((JComponent)comp).isRequestFocusEnabled()) {
                     comp.requestFocus(FocusEvent.Cause.MOUSE_EVENT);
@@ -957,12 +957,12 @@ public class BasicComboPopup extends JPopupMenu implements ComboPopup {
             Component source = (Component)e.getSource();
             Dimension size = source.getSize();
             Rectangle bounds = new Rectangle( 0, 0, size.width, size.height);
-            if ( !bounds.contains( e.getPoint() ) ) {
+            if (!bounds.contains(e.getPoint())) {
                 MouseEvent newEvent = convertMouseEvent( e );
                 Point location = newEvent.getPoint();
                 Rectangle r = new Rectangle();
                 list.computeVisibleRect( r );
-                if ( r.contains( location ) ) {
+                if (r.contains(location)) {
                     if (comboBox.getSelectedIndex() == list.getSelectedIndex()) {
                         comboBox.getEditor().setItem(list.getSelectedValue());
                     }
@@ -989,7 +989,7 @@ public class BasicComboPopup extends JPopupMenu implements ComboPopup {
                 Point location = anEvent.getPoint();
                 Rectangle r = new Rectangle();
                 list.computeVisibleRect( r );
-                if ( r.contains( location ) ) {
+                if (r.contains(location)) {
                     updateListBoxSelectionForEvent( anEvent, false );
                 }
             }
@@ -999,34 +999,34 @@ public class BasicComboPopup extends JPopupMenu implements ComboPopup {
             if (e.getSource() == list) {
                 return;
             }
-            if ( isVisible() ) {
+            if (isVisible()) {
                 MouseEvent newEvent = convertMouseEvent( e );
                 Rectangle r = new Rectangle();
                 list.computeVisibleRect( r );
 
-                if ( newEvent.getPoint().y >= r.y && newEvent.getPoint().y <= r.y + r.height - 1 ) {
+                if (newEvent.getPoint().y >= r.y && newEvent.getPoint().y <= r.y + r.height - 1) {
                     hasEntered = true;
-                    if ( isAutoScrolling ) {
+                    if (isAutoScrolling) {
                         stopAutoScrolling();
                     }
                     Point location = newEvent.getPoint();
-                    if ( r.contains( location ) ) {
+                    if (r.contains(location)) {
                         updateListBoxSelectionForEvent( newEvent, false );
                     }
                 }
                 else {
-                    if ( hasEntered ) {
+                    if (hasEntered) {
                         int directionToScroll = newEvent.getPoint().y < r.y ? SCROLL_UP : SCROLL_DOWN;
-                        if ( isAutoScrolling && scrollDirection != directionToScroll ) {
+                        if (isAutoScrolling && scrollDirection != directionToScroll) {
                             stopAutoScrolling();
                             startAutoScrolling( directionToScroll );
                         }
-                        else if ( !isAutoScrolling ) {
+                        else if (!isAutoScrolling) {
                             startAutoScrolling( directionToScroll );
                         }
                     }
                     else {
-                        if ( e.getPoint().y < 0 ) {
+                        if (e.getPoint().y < 0) {
                             hasEntered = true;
                             startAutoScrolling( SCROLL_UP );
                         }
@@ -1043,7 +1043,7 @@ public class BasicComboPopup extends JPopupMenu implements ComboPopup {
             JComboBox<Object> comboBox = (JComboBox)e.getSource();
             String propertyName = e.getPropertyName();
 
-            if ( propertyName == "model" ) {
+            if (propertyName == "model") {
                 @SuppressWarnings("unchecked")
                 ComboBoxModel<Object> oldModel = (ComboBoxModel)e.getOldValue();
                 @SuppressWarnings("unchecked")
@@ -1053,13 +1053,13 @@ public class BasicComboPopup extends JPopupMenu implements ComboPopup {
 
                 list.setModel(newModel);
 
-                if ( isVisible() ) {
+                if (isVisible()) {
                     hide();
                 }
             }
-            else if ( propertyName == "renderer" ) {
+            else if (propertyName == "renderer") {
                 list.setCellRenderer( comboBox.getRenderer() );
-                if ( isVisible() ) {
+                if (isVisible()) {
                     hide();
                 }
             }
@@ -1067,18 +1067,18 @@ public class BasicComboPopup extends JPopupMenu implements ComboPopup {
                 // Pass along the new component orientation
                 // to the list and the scroller
 
-                ComponentOrientation o =(ComponentOrientation)e.getNewValue();
+                ComponentOrientation o = (ComponentOrientation)e.getNewValue();
 
                 JList<?> list = getList();
-                if (list != null && list.getComponentOrientation()!=o) {
+                if (list != null && list.getComponentOrientation() != o) {
                     list.setComponentOrientation(o);
                 }
 
-                if (scroller != null && scroller.getComponentOrientation()!=o) {
+                if (scroller != null && scroller.getComponentOrientation() != o) {
                     scroller.setComponentOrientation(o);
                 }
 
-                if (o!=getComponentOrientation()) {
+                if (o != getComponentOrientation()) {
                     setComponentOrientation(o);
                 }
             }
@@ -1134,13 +1134,13 @@ public class BasicComboPopup extends JPopupMenu implements ComboPopup {
     protected void startAutoScrolling( int direction ) {
         // XXX - should be a private method within InvocationMouseMotionHandler
         // if possible.
-        if ( isAutoScrolling ) {
+        if (isAutoScrolling) {
             autoscrollTimer.stop();
         }
 
         isAutoScrolling = true;
 
-        if ( direction == SCROLL_UP ) {
+        if (direction == SCROLL_UP) {
             scrollDirection = SCROLL_UP;
             Point convertedPoint = SwingUtilities.convertPoint( scroller, new Point( 1, 1 ), list );
             int top = list.locationToIndex( convertedPoint );
@@ -1149,7 +1149,7 @@ public class BasicComboPopup extends JPopupMenu implements ComboPopup {
             autoscrollTimer = new Timer( 100, new AutoScrollActionHandler(
                                              SCROLL_UP) );
         }
-        else if ( direction == SCROLL_DOWN ) {
+        else if (direction == SCROLL_DOWN) {
             scrollDirection = SCROLL_DOWN;
             Dimension size = scroller.getSize();
             Point convertedPoint = SwingUtilities.convertPoint( scroller,
@@ -1171,7 +1171,7 @@ public class BasicComboPopup extends JPopupMenu implements ComboPopup {
     protected void stopAutoScrolling() {
         isAutoScrolling = false;
 
-        if ( autoscrollTimer != null ) {
+        if (autoscrollTimer != null) {
             autoscrollTimer.stop();
             autoscrollTimer = null;
         }
@@ -1183,7 +1183,7 @@ public class BasicComboPopup extends JPopupMenu implements ComboPopup {
      */
     protected void autoScrollUp() {
         int index = list.getSelectedIndex();
-        if ( index > 0 ) {
+        if (index > 0) {
             list.setSelectedIndex( index - 1 );
             list.ensureIndexIsVisible( index - 1 );
         }
@@ -1196,7 +1196,7 @@ public class BasicComboPopup extends JPopupMenu implements ComboPopup {
     protected void autoScrollDown() {
         int index = list.getSelectedIndex();
         int lastItem = list.getModel().getSize() - 1;
-        if ( index < lastItem ) {
+        if (index < lastItem) {
             list.setSelectedIndex( index + 1 );
             list.ensureIndexIsVisible( index + 1 );
         }
@@ -1234,7 +1234,7 @@ public class BasicComboPopup extends JPopupMenu implements ComboPopup {
      * @param e a mouse event
      */
     protected void delegateFocus( MouseEvent e ) {
-        if ( comboBox.isEditable() ) {
+        if (comboBox.isEditable()) {
             Component comp = comboBox.getEditor().getEditorComponent();
             if ((!(comp instanceof JComponent)) || ((JComponent)comp).isRequestFocusEnabled()) {
                 if (e != null) {
@@ -1258,7 +1258,7 @@ public class BasicComboPopup extends JPopupMenu implements ComboPopup {
      * visible.
      */
     protected void togglePopup() {
-        if ( isVisible() ) {
+        if (isVisible()) {
             hide();
         }
         else {
@@ -1274,7 +1274,7 @@ public class BasicComboPopup extends JPopupMenu implements ComboPopup {
      * @param selectedIndex the index to set the list
      */
     private void setListSelection(int selectedIndex) {
-        if ( selectedIndex == -1 ) {
+        if (selectedIndex == -1) {
             list.clearSelection();
         }
         else {
@@ -1325,7 +1325,7 @@ public class BasicComboPopup extends JPopupMenu implements ComboPopup {
         ListCellRenderer<Object> renderer = list.getCellRenderer();
         Object value = null;
 
-        for ( int i = 0; i < minRowCount; ++i ) {
+        for (int i = 0; i < minRowCount; ++i) {
             value = list.getModel().getElementAt( i );
             Component c = renderer.getListCellRendererComponent( list, value, i, false, false );
             height += c.getPreferredSize().height;
@@ -1439,18 +1439,18 @@ public class BasicComboPopup extends JPopupMenu implements ComboPopup {
         // XXX - only seems to be called from this class. shouldScroll flag is
         // never true
         Point location = anEvent.getPoint();
-        if ( list == null )
+        if (list == null)
             return;
         int index = list.locationToIndex(location);
-        if ( index == -1 ) {
-            if ( location.y < 0 )
+        if (index == -1) {
+            if (location.y < 0)
                 index = 0;
             else
                 index = comboBox.getModel().getSize() - 1;
         }
-        if ( list.getSelectedIndex() != index ) {
+        if (list.getSelectedIndex() != index) {
             list.setSelectedIndex(index);
-            if ( shouldScroll )
+            if (shouldScroll)
                 list.ensureIndexIsVisible(index);
         }
     }
diff --git a/src/java.desktop/share/classes/javax/swing/plaf/basic/BasicListUI.java b/src/java.desktop/share/classes/javax/swing/plaf/basic/BasicListUI.java
index ab5fdb12c5a..37bcbec2156 100644
--- a/src/java.desktop/share/classes/javax/swing/plaf/basic/BasicListUI.java
+++ b/src/java.desktop/share/classes/javax/swing/plaf/basic/BasicListUI.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1997, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
diff --git a/src/java.desktop/share/classes/javax/swing/plaf/basic/BasicMenuBarUI.java b/src/java.desktop/share/classes/javax/swing/plaf/basic/BasicMenuBarUI.java
index b7310b56aef..a9abaee0129 100644
--- a/src/java.desktop/share/classes/javax/swing/plaf/basic/BasicMenuBarUI.java
+++ b/src/java.desktop/share/classes/javax/swing/plaf/basic/BasicMenuBarUI.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1997, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -237,10 +237,10 @@ public class BasicMenuBarUI extends MenuBarUI  {
         // ChangeListener
         //
         public void stateChanged(ChangeEvent e) {
-            int i,c;
-            for(i=0,c = menuBar.getMenuCount() ; i < c ; i++) {
+            final int c = menuBar.getMenuCount();
+            for (int i = 0; i < c; i++) {
                 JMenu menu = menuBar.getMenu(i);
-                if(menu != null && menu.isSelected()) {
+                if (menu != null && menu.isSelected()) {
                     menuBar.getSelectionModel().setSelectedIndex(i);
                     break;
                 }
diff --git a/src/java.desktop/share/classes/javax/swing/plaf/basic/BasicPopupMenuUI.java b/src/java.desktop/share/classes/javax/swing/plaf/basic/BasicPopupMenuUI.java
index b72a2d8a140..a3ffb034b4b 100644
--- a/src/java.desktop/share/classes/javax/swing/plaf/basic/BasicPopupMenuUI.java
+++ b/src/java.desktop/share/classes/javax/swing/plaf/basic/BasicPopupMenuUI.java
@@ -908,7 +908,7 @@ public class BasicPopupMenuUI extends PopupMenuUI {
         }
 
         boolean isInPopup(Component src) {
-            for (Component c=src; c != null; c=c.getParent()) {
+            for (Component c = src; c != null; c = c.getParent()) {
                 if (c instanceof Window) {
                     break;
                 } else if (c instanceof JPopupMenu) {
diff --git a/src/java.desktop/share/classes/javax/swing/plaf/basic/BasicSpinnerUI.java b/src/java.desktop/share/classes/javax/swing/plaf/basic/BasicSpinnerUI.java
index 7080fa3aac1..b523f8c7bd3 100644
--- a/src/java.desktop/share/classes/javax/swing/plaf/basic/BasicSpinnerUI.java
+++ b/src/java.desktop/share/classes/javax/swing/plaf/basic/BasicSpinnerUI.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2000, 2022, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2000, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
diff --git a/src/java.desktop/share/classes/javax/swing/plaf/basic/BasicTabbedPaneUI.java b/src/java.desktop/share/classes/javax/swing/plaf/basic/BasicTabbedPaneUI.java
index 6e0d0101b9c..de23dbab29a 100644
--- a/src/java.desktop/share/classes/javax/swing/plaf/basic/BasicTabbedPaneUI.java
+++ b/src/java.desktop/share/classes/javax/swing/plaf/basic/BasicTabbedPaneUI.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1997, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -504,7 +504,7 @@ public class BasicTabbedPaneUI extends TabbedPaneUI implements SwingConstants {
             tabPane.addFocusListener(focusListener);
         }
         tabPane.addContainerListener(getHandler());
-        if (tabPane.getTabCount()>0) {
+        if (tabPane.getTabCount() > 0) {
             Boolean htmlDisabled = (Boolean)
                                     tabPane.getClientProperty("html.disable");
             if (!(Boolean.TRUE.equals(htmlDisabled))) {
@@ -949,8 +949,8 @@ public class BasicTabbedPaneUI extends TabbedPaneUI implements SwingConstants {
         // Paint tabRuns of tabs from back to front
         for (int i = runCount - 1; i >= 0; i--) {
             int start = tabRuns[i];
-            int next = tabRuns[(i == runCount - 1)? 0 : i + 1];
-            int end = (next != 0? next - 1: tabCount - 1);
+            int next = tabRuns[(i == runCount - 1) ? 0 : i + 1];
+            int end = (next != 0 ? next - 1 : tabCount - 1);
             for (int j = start; j <= end; j++) {
                 if (j != selectedIndex && rects[j].intersects(clipRect)) {
                     paintTab(g, tabPlacement, rects, j, iconRect, textRect);
@@ -1118,7 +1118,7 @@ public class BasicTabbedPaneUI extends TabbedPaneUI implements SwingConstants {
             int xx = x;
             g.setColor(shadow);
             while(xx <= x+rects[tabIndex].width) {
-                for (int i=0; i < xCropLen.length; i+=2) {
+                for (int i = 0; i < xCropLen.length; i += 2) {
                     g.drawLine(xx+yCropLen[i],y-xCropLen[i],
                                xx+yCropLen[i+1]-1,y-xCropLen[i+1]);
                 }
@@ -1133,7 +1133,7 @@ public class BasicTabbedPaneUI extends TabbedPaneUI implements SwingConstants {
             int yy = y;
             g.setColor(shadow);
             while(yy <= y+rects[tabIndex].height) {
-                for (int i=0; i < xCropLen.length; i+=2) {
+                for (int i = 0; i < xCropLen.length; i += 2) {
                     g.drawLine(x-xCropLen[i],yy+yCropLen[i],
                                x-xCropLen[i+1],yy+yCropLen[i+1]-1);
                 }
@@ -1549,7 +1549,7 @@ public class BasicTabbedPaneUI extends TabbedPaneUI implements SwingConstants {
     protected void paintContentBorderTopEdge(Graphics g, int tabPlacement,
                                          int selectedIndex,
                                          int x, int y, int w, int h) {
-        Rectangle selRect = selectedIndex < 0? null :
+        Rectangle selRect = selectedIndex < 0 ? null :
                                getTabBounds(selectedIndex, calcRect);
 
         g.setColor(lightHighlight);
@@ -1588,7 +1588,7 @@ public class BasicTabbedPaneUI extends TabbedPaneUI implements SwingConstants {
     protected void paintContentBorderLeftEdge(Graphics g, int tabPlacement,
                                                int selectedIndex,
                                                int x, int y, int w, int h) {
-        Rectangle selRect = selectedIndex < 0? null :
+        Rectangle selRect = selectedIndex < 0 ? null :
                                getTabBounds(selectedIndex, calcRect);
 
         g.setColor(lightHighlight);
@@ -1624,7 +1624,7 @@ public class BasicTabbedPaneUI extends TabbedPaneUI implements SwingConstants {
     protected void paintContentBorderBottomEdge(Graphics g, int tabPlacement,
                                                int selectedIndex,
                                                int x, int y, int w, int h) {
-        Rectangle selRect = selectedIndex < 0? null :
+        Rectangle selRect = selectedIndex < 0 ? null :
                                getTabBounds(selectedIndex, calcRect);
 
         g.setColor(shadow);
@@ -1667,7 +1667,7 @@ public class BasicTabbedPaneUI extends TabbedPaneUI implements SwingConstants {
     protected void paintContentBorderRightEdge(Graphics g, int tabPlacement,
                                                int selectedIndex,
                                                int x, int y, int w, int h) {
-        Rectangle selRect = selectedIndex < 0? null :
+        Rectangle selRect = selectedIndex < 0 ? null :
                                getTabBounds(selectedIndex, calcRect);
 
         g.setColor(shadow);
@@ -4090,7 +4090,7 @@ public class BasicTabbedPaneUI extends TabbedPaneUI implements SwingConstants {
                     setHtmlView(v, inserted, index);
                 }
             } else {                             // Not HTML
-                if (htmlViews != null) {           // Add placeholder
+                if (htmlViews != null) {         // Add placeholder
                     setHtmlView(null, inserted, index);
                 }                                // else nada!
             }
@@ -4336,8 +4336,8 @@ public class BasicTabbedPaneUI extends TabbedPaneUI implements SwingConstants {
     private Vector<View> createHTMLVector() {
         Vector<View> htmlViews = new Vector<View>();
         int count = tabPane.getTabCount();
-        if (count>0) {
-            for (int i=0 ; i<count; i++) {
+        if (count > 0) {
+            for (int i = 0 ; i < count; i++) {
                 String title = tabPane.getTitleAt(i);
                 if (BasicHTML.isHTMLString(title)) {
                     htmlViews.addElement(BasicHTML.createHTMLView(tabPane, title));
diff --git a/src/java.desktop/share/classes/javax/swing/plaf/basic/BasicToolBarUI.java b/src/java.desktop/share/classes/javax/swing/plaf/basic/BasicToolBarUI.java
index 1bcd4a9be8d..9c07b6a03d1 100644
--- a/src/java.desktop/share/classes/javax/swing/plaf/basic/BasicToolBarUI.java
+++ b/src/java.desktop/share/classes/javax/swing/plaf/basic/BasicToolBarUI.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1997, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
diff --git a/src/java.desktop/share/classes/javax/swing/plaf/basic/BasicTreeUI.java b/src/java.desktop/share/classes/javax/swing/plaf/basic/BasicTreeUI.java
index 096fe7cc5f7..19a25005be9 100644
--- a/src/java.desktop/share/classes/javax/swing/plaf/basic/BasicTreeUI.java
+++ b/src/java.desktop/share/classes/javax/swing/plaf/basic/BasicTreeUI.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1997, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
diff --git a/src/java.desktop/share/classes/javax/swing/plaf/nimbus/AbstractRegionPainter.java b/src/java.desktop/share/classes/javax/swing/plaf/nimbus/AbstractRegionPainter.java
index cfcc014940a..d06406d69d6 100644
--- a/src/java.desktop/share/classes/javax/swing/plaf/nimbus/AbstractRegionPainter.java
+++ b/src/java.desktop/share/classes/javax/swing/plaf/nimbus/AbstractRegionPainter.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2005, 2023, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2005, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
diff --git a/src/java.desktop/share/classes/javax/swing/plaf/nimbus/NimbusLookAndFeel.java b/src/java.desktop/share/classes/javax/swing/plaf/nimbus/NimbusLookAndFeel.java
index 05fa3bbc9b6..7ef7beb5d1c 100644
--- a/src/java.desktop/share/classes/javax/swing/plaf/nimbus/NimbusLookAndFeel.java
+++ b/src/java.desktop/share/classes/javax/swing/plaf/nimbus/NimbusLookAndFeel.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2005, 2023, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2005, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
diff --git a/src/java.desktop/share/classes/javax/swing/plaf/nimbus/SynthPainterImpl.java b/src/java.desktop/share/classes/javax/swing/plaf/nimbus/SynthPainterImpl.java
index 1842073588b..fd761ac4730 100644
--- a/src/java.desktop/share/classes/javax/swing/plaf/nimbus/SynthPainterImpl.java
+++ b/src/java.desktop/share/classes/javax/swing/plaf/nimbus/SynthPainterImpl.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2005, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2005, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
diff --git a/src/java.desktop/share/classes/javax/swing/plaf/synth/SynthComboBoxUI.java b/src/java.desktop/share/classes/javax/swing/plaf/synth/SynthComboBoxUI.java
index ad10e70a837..0c373483153 100644
--- a/src/java.desktop/share/classes/javax/swing/plaf/synth/SynthComboBoxUI.java
+++ b/src/java.desktop/share/classes/javax/swing/plaf/synth/SynthComboBoxUI.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2002, 2023, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2002, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
diff --git a/src/java.desktop/share/classes/javax/swing/plaf/synth/SynthScrollPaneUI.java b/src/java.desktop/share/classes/javax/swing/plaf/synth/SynthScrollPaneUI.java
index 0c3a17fbdbb..c07feb8b56d 100644
--- a/src/java.desktop/share/classes/javax/swing/plaf/synth/SynthScrollPaneUI.java
+++ b/src/java.desktop/share/classes/javax/swing/plaf/synth/SynthScrollPaneUI.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2002, 2020, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2002, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
diff --git a/src/java.desktop/share/classes/javax/swing/text/TextAction.java b/src/java.desktop/share/classes/javax/swing/text/TextAction.java
index d05f7e24a6b..00da7bad93e 100644
--- a/src/java.desktop/share/classes/javax/swing/text/TextAction.java
+++ b/src/java.desktop/share/classes/javax/swing/text/TextAction.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1997, 2013, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
diff --git a/src/java.desktop/share/classes/javax/swing/tree/DefaultTreeCellEditor.java b/src/java.desktop/share/classes/javax/swing/tree/DefaultTreeCellEditor.java
index 3f3721dd30a..7595638dc66 100644
--- a/src/java.desktop/share/classes/javax/swing/tree/DefaultTreeCellEditor.java
+++ b/src/java.desktop/share/classes/javax/swing/tree/DefaultTreeCellEditor.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1998, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1998, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it

From 5fec4ed37a7acb42e290ba8d60565b20603195aa Mon Sep 17 00:00:00 2001
From: Chen Liang <liach@openjdk.org>
Date: Tue, 31 Mar 2026 03:46:23 +0000
Subject: [PATCH 422/655] 8379679: java/foreign/TestConcurrentClose.java
 awaitTermination times out on Windows debug builds

Reviewed-by: alanb
---
 .../jdk/java/foreign/TestConcurrentClose.java | 38 +++++++++----------
 1 file changed, 17 insertions(+), 21 deletions(-)

diff --git a/test/jdk/java/foreign/TestConcurrentClose.java b/test/jdk/java/foreign/TestConcurrentClose.java
index 82bb2492acf..74f0ca2a877 100644
--- a/test/jdk/java/foreign/TestConcurrentClose.java
+++ b/test/jdk/java/foreign/TestConcurrentClose.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2024, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2024, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -49,13 +49,11 @@ import java.lang.reflect.Method;
 import java.util.concurrent.CountDownLatch;
 import java.util.concurrent.ExecutorService;
 import java.util.concurrent.Executors;
-import java.util.concurrent.TimeUnit;
 import java.util.concurrent.atomic.AtomicBoolean;
 import java.util.concurrent.atomic.AtomicLong;
 
 import static java.lang.foreign.ValueLayout.JAVA_BYTE;
 import static org.testng.Assert.assertFalse;
-import static org.testng.Assert.assertTrue;
 
 public class TestConcurrentClose {
     static final WhiteBox WB = WhiteBox.getWhiteBox();
@@ -72,7 +70,6 @@ public class TestConcurrentClose {
 
     static final int ITERATIONS = 5;
     static final int SEGMENT_SIZE = 10_000;
-    static final int MAX_EXECUTOR_WAIT_SECONDS = 60;
     static final int NUM_ACCESSORS = 50;
 
     static final AtomicLong start = new AtomicLong();
@@ -82,25 +79,24 @@ public class TestConcurrentClose {
     public void testHandshake() throws InterruptedException {
         for (int it = 0; it < ITERATIONS; it++) {
             System.out.println("ITERATION " + it + " - starting");
-            ExecutorService accessExecutor = Executors.newCachedThreadPool();
-            start.set(System.currentTimeMillis());
-            started.set(false);
-            CountDownLatch startClosureLatch = new CountDownLatch(1);
+            try (ExecutorService accessExecutor = Executors.newCachedThreadPool()) {
+                start.set(System.currentTimeMillis());
+                started.set(false);
+                CountDownLatch startClosureLatch = new CountDownLatch(1);
 
-            for (int i = 0; i < NUM_ACCESSORS ; i++) {
-                Arena arena = Arena.ofShared();
-                MemorySegment segment = arena.allocate(SEGMENT_SIZE, 1);
-                accessExecutor.execute(new SegmentAccessor(i, segment));
-                accessExecutor.execute(new Closer(i, startClosureLatch, arena));
+                for (int i = 0; i < NUM_ACCESSORS; i++) {
+                    Arena arena = Arena.ofShared();
+                    MemorySegment segment = arena.allocate(SEGMENT_SIZE, 1);
+                    accessExecutor.execute(new SegmentAccessor(i, segment));
+                    accessExecutor.execute(new Closer(i, startClosureLatch, arena));
+                }
+
+                awaitCompilation();
+
+                long closeDelay = System.currentTimeMillis() - start.get();
+                System.out.println("Starting closers after delay of " + closeDelay + " millis");
+                startClosureLatch.countDown();
             }
-
-            awaitCompilation();
-
-            long closeDelay = System.currentTimeMillis() - start.get();
-            System.out.println("Starting closers after delay of " + closeDelay + " millis");
-            startClosureLatch.countDown();
-            accessExecutor.shutdown();
-            assertTrue(accessExecutor.awaitTermination(MAX_EXECUTOR_WAIT_SECONDS, TimeUnit.SECONDS));
             long finishDelay = System.currentTimeMillis() - start.get();
             System.out.println("ITERATION " + it + " - finished, after " + finishDelay + "milis");
         }

From 3aab51828582a48a9c7ee2729284fea8763050c6 Mon Sep 17 00:00:00 2001
From: Kirill Shirokov <kshiroko@openjdk.org>
Date: Tue, 31 Mar 2026 05:07:04 +0000
Subject: [PATCH 423/655] 8380074: Reflection::areNestMates should be used by
 Class::isNestmateOf

Reviewed-by: liach, dholmes
---
 src/java.base/share/classes/java/lang/Class.java | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/src/java.base/share/classes/java/lang/Class.java b/src/java.base/share/classes/java/lang/Class.java
index 8a2f722f3dd..f15291827d5 100644
--- a/src/java.base/share/classes/java/lang/Class.java
+++ b/src/java.base/share/classes/java/lang/Class.java
@@ -3841,7 +3841,7 @@ public final class Class<T> implements java.io.Serializable,
             return false;
         }
 
-        return getNestHost() == c.getNestHost();
+        return Reflection.areNestMates(this, c);
     }
 
     private native Class<?>[] getNestMembers0();

From 77cfead6fe84e254133681ee22d81fa190e0e371 Mon Sep 17 00:00:00 2001
From: Jayathirth D V <jdv@openjdk.org>
Date: Tue, 31 Mar 2026 05:32:33 +0000
Subject: [PATCH 424/655] 8380959: Update Libpng to 1.6.56

Reviewed-by: erikj, aivanov, honkar, prr
---
 .../java.desktop/lib/ClientLibraries.gmk      |  3 +-
 src/java.desktop/share/legal/libpng.md        |  5 +-
 .../native/libsplashscreen/libpng/CHANGES     | 31 ++++++++
 .../native/libsplashscreen/libpng/README      |  2 +-
 .../share/native/libsplashscreen/libpng/png.c | 16 ++--
 .../share/native/libsplashscreen/libpng/png.h | 16 ++--
 .../native/libsplashscreen/libpng/pngconf.h   |  2 +-
 .../libsplashscreen/libpng/pnglibconf.h       |  2 +-
 .../native/libsplashscreen/libpng/pngpriv.h   |  4 +-
 .../native/libsplashscreen/libpng/pngread.c   | 68 +++++++++--------
 .../native/libsplashscreen/libpng/pngrtran.c  | 30 +++++++-
 .../native/libsplashscreen/libpng/pngrutil.c  | 42 ++++-------
 .../native/libsplashscreen/libpng/pngset.c    | 73 ++++++++++++-------
 .../native/libsplashscreen/libpng/pngstruct.h |  6 +-
 .../native/libsplashscreen/libpng/pngtrans.c  | 40 ++++++++--
 15 files changed, 218 insertions(+), 122 deletions(-)

diff --git a/make/modules/java.desktop/lib/ClientLibraries.gmk b/make/modules/java.desktop/lib/ClientLibraries.gmk
index 13a74ab409f..3e37fe79643 100644
--- a/make/modules/java.desktop/lib/ClientLibraries.gmk
+++ b/make/modules/java.desktop/lib/ClientLibraries.gmk
@@ -1,5 +1,5 @@
 #
-# Copyright (c) 2011, 2025, Oracle and/or its affiliates. All rights reserved.
+# Copyright (c) 2011, 2026, Oracle and/or its affiliates. All rights reserved.
 # DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
 #
 # This code is free software; you can redistribute it and/or modify it
@@ -257,6 +257,7 @@ ifeq ($(ENABLE_HEADLESS_ONLY), false)
       DISABLED_WARNINGS_microsoft_dgif_lib.c := 4018 4267, \
       DISABLED_WARNINGS_microsoft_splashscreen_impl.c := 4018 4267 4244, \
       DISABLED_WARNINGS_microsoft_splashscreen_png.c := 4267, \
+      DISABLED_WARNINGS_microsoft_pngread.c := 4146, \
       DISABLED_WARNINGS_microsoft_splashscreen_sys.c := 4267 4244, \
       LDFLAGS := $(ICONV_LDFLAGS), \
       LDFLAGS_windows := -delayload:user32.dll, \
diff --git a/src/java.desktop/share/legal/libpng.md b/src/java.desktop/share/legal/libpng.md
index a2ffcca1974..034de22bf25 100644
--- a/src/java.desktop/share/legal/libpng.md
+++ b/src/java.desktop/share/legal/libpng.md
@@ -1,4 +1,4 @@
-## libpng v1.6.55
+## libpng v1.6.56
 
 ### libpng License
 <pre>
@@ -168,6 +168,7 @@ Authors, for copyright and licensing purposes.
  * Glenn Randers-Pehrson
  * Greg Roelofs
  * Guy Eric Schalnat
+ * Halil Oktay
  * James Yu
  * John Bowler
  * Joshua Inscoe
@@ -187,12 +188,14 @@ Authors, for copyright and licensing purposes.
  * Sam Bushell
  * Samuel Williams
  * Simon-Pierre Cadieux
+ * Taegu Ha (하태구)
  * Tim Wegner
  * Tobias Stoeckmann
  * Tom Lane
  * Tom Tanner
  * Vadim Barkov
  * Willem van Schaik
+ * Yuelin Wang (王跃林)
  * Zhijie Liang
  * Apple Inc.
     - Zixu Wang (王子旭)
diff --git a/src/java.desktop/share/native/libsplashscreen/libpng/CHANGES b/src/java.desktop/share/native/libsplashscreen/libpng/CHANGES
index af9fcff6eb3..673d4d50420 100644
--- a/src/java.desktop/share/native/libsplashscreen/libpng/CHANGES
+++ b/src/java.desktop/share/native/libsplashscreen/libpng/CHANGES
@@ -6337,6 +6337,37 @@ Version 1.6.55 [February 9, 2026]
   Resolved an oss-fuzz build issue involving nalloc.
     (Contributed by Philippe Antoine.)
 
+Version 1.6.56 [March 25, 2026]
+  Fixed CVE-2026-33416 (high severity):
+    Use-after-free via pointer aliasing in `png_set_tRNS` and `png_set_PLTE`.
+    (Reported by Halil Oktay and Ryo Shimada;
+    fixed by Halil Oktay and Cosmin Truta.)
+  Fixed CVE-2026-33636 (high severity):
+    Out-of-bounds read/write in the palette expansion on ARM Neon.
+    (Reported by Taegu Ha; fixed by Taegu Ha and Cosmin Truta.)
+  Fixed uninitialized reads beyond `num_trans` in `trans_alpha` buffers.
+    (Contributed by Halil Oktay.)
+  Fixed stale `info_ptr->palette` after in-place gamma and background
+    transforms.
+  Fixed wrong channel indices in `png_image_read_and_map` RGB_ALPHA path.
+    (Contributed by Yuelin Wang.)
+  Fixed wrong background color in colormap read.
+    (Contributed by Yuelin Wang.)
+  Fixed dead loop in sPLT write.
+    (Contributed by Yuelin Wang.)
+  Added missing null pointer checks in four public API functions.
+    (Contributed by Yuelin Wang.)
+  Validated shift bit depths in `png_set_shift` to prevent infinite loop.
+    (Contributed by Yuelin Wang.)
+  Avoided undefined behavior in library and tests.
+  Deprecated the hardly-ever-tested POINTER_INDEXING config option.
+  Added negative-stride test coverage for the simplified API.
+  Fixed memory leaks and API misuse in oss-fuzz.
+    (Contributed by Owen Sanzas.)
+  Implemented various fixes and improvements in oss-fuzz.
+    (Contributed by Bob Friesenhahn and Philippe Antoine.)
+  Performed various refactorings and cleanups.
+
 Send comments/corrections/commendations to png-mng-implement at lists.sf.net.
 Subscription is required; visit
 <https://lists.sourceforge.net/lists/listinfo/png-mng-implement>
diff --git a/src/java.desktop/share/native/libsplashscreen/libpng/README b/src/java.desktop/share/native/libsplashscreen/libpng/README
index 6e0d1e33137..d0b085f7933 100644
--- a/src/java.desktop/share/native/libsplashscreen/libpng/README
+++ b/src/java.desktop/share/native/libsplashscreen/libpng/README
@@ -1,4 +1,4 @@
-README for libpng version 1.6.55
+README for libpng version 1.6.56
 ================================
 
 See the note about version numbers near the top of `png.h`.
diff --git a/src/java.desktop/share/native/libsplashscreen/libpng/png.c b/src/java.desktop/share/native/libsplashscreen/libpng/png.c
index 955fda8dd7e..fd095b515b9 100644
--- a/src/java.desktop/share/native/libsplashscreen/libpng/png.c
+++ b/src/java.desktop/share/native/libsplashscreen/libpng/png.c
@@ -42,7 +42,7 @@
 #include "pngpriv.h"
 
 /* Generate a compiler error if there is an old png.h in the search path. */
-typedef png_libpng_version_1_6_55 Your_png_h_is_not_version_1_6_55;
+typedef png_libpng_version_1_6_56 Your_png_h_is_not_version_1_6_56;
 
 /* Sanity check the chunks definitions - PNG_KNOWN_CHUNKS from pngpriv.h and the
  * corresponding macro definitions.  This causes a compile time failure if
@@ -849,7 +849,7 @@ png_get_copyright(png_const_structrp png_ptr)
    return PNG_STRING_COPYRIGHT
 #else
    return PNG_STRING_NEWLINE \
-      "libpng version 1.6.55" PNG_STRING_NEWLINE \
+      "libpng version 1.6.56" PNG_STRING_NEWLINE \
       "Copyright (c) 2018-2026 Cosmin Truta" PNG_STRING_NEWLINE \
       "Copyright (c) 1998-2002,2004,2006-2018 Glenn Randers-Pehrson" \
       PNG_STRING_NEWLINE \
@@ -1199,7 +1199,7 @@ png_xy_from_XYZ(png_xy *xy, const png_XYZ *XYZ)
       return 1;
 
    /* The reference white is simply the sum of the end-point (X,Y,Z) vectors so
-    * the fillowing calculates (X+Y+Z) of the reference white (media white,
+    * the following calculates (X+Y+Z) of the reference white (media white,
     * encoding white) itself:
     */
    d = dblue;
@@ -1244,9 +1244,9 @@ png_XYZ_from_xy(png_XYZ *XYZ, const png_xy *xy)
     * (-0.0770) because the PNG spec itself requires the xy values to be
     * unsigned.  whitey is also required to be 5 or more to avoid overflow.
     *
-    * Instead the upper limits have been relaxed to accomodate ACES AP1 where
+    * Instead the upper limits have been relaxed to accommodate ACES AP1 where
     * redz ends up as -600 (-0.006).  ProPhotoRGB was already "in range."
-    * The new limit accomodates the AP0 and AP1 ranges for z but not AP0 redy.
+    * The new limit accommodates the AP0 and AP1 ranges for z but not AP0 redy.
     */
    const png_fixed_point fpLimit = PNG_FP_1+(PNG_FP_1/10);
    if (xy->redx   < 0 || xy->redx > fpLimit) return 1;
@@ -1357,7 +1357,7 @@ png_XYZ_from_xy(png_XYZ *XYZ, const png_xy *xy)
     *    red-scale + green-scale + blue-scale = 1/white-y = white-scale
     *
     * So now we have a Cramer's rule solution where the determinants are just
-    * 3x3 - far more tractible.  Unfortunately 3x3 determinants still involve
+    * 3x3 - far more tractable.  Unfortunately 3x3 determinants still involve
     * multiplication of three coefficients so we can't guarantee to avoid
     * overflow in the libpng fixed point representation.  Using Cramer's rule in
     * floating point is probably a good choice here, but it's not an option for
@@ -1726,7 +1726,7 @@ png_icc_check_header(png_const_structrp png_ptr, png_const_charp name,
     * into R, G and B channels.
     *
     * Previously it was suggested that an RGB profile on grayscale data could be
-    * handled.  However it it is clear that using an RGB profile in this context
+    * handled.  However it is clear that using an RGB profile in this context
     * must be an error - there is no specification of what it means.  Thus it is
     * almost certainly more correct to ignore the profile.
     */
@@ -2944,7 +2944,7 @@ png_gamma_significant(png_fixed_point gamma_val)
     *
     *    2.2/(2+51/256) == 1.00035524
     *
-    * I.e. vanishly small (<4E-4) but still detectable in 16-bit linear (+/-
+    * I.e. vanishingly small (<4E-4) but still detectable in 16-bit linear (+/-
     * 23).  Note that the Adobe choice seems to be something intended to give an
     * exact number with 8 binary fractional digits - it is the closest to 2.2
     * that is possible a base 2 .8p representation.
diff --git a/src/java.desktop/share/native/libsplashscreen/libpng/png.h b/src/java.desktop/share/native/libsplashscreen/libpng/png.h
index e95c0444399..56ec204cd1a 100644
--- a/src/java.desktop/share/native/libsplashscreen/libpng/png.h
+++ b/src/java.desktop/share/native/libsplashscreen/libpng/png.h
@@ -29,7 +29,7 @@
  * However, the following notice accompanied the original version of this
  * file and, per its terms, should not be removed:
  *
- * libpng version 1.6.55
+ * libpng version 1.6.56
  *
  * Copyright (c) 2018-2026 Cosmin Truta
  * Copyright (c) 1998-2002,2004,2006-2018 Glenn Randers-Pehrson
@@ -43,7 +43,7 @@
  *   libpng versions 0.89, June 1996, through 0.96, May 1997: Andreas Dilger
  *   libpng versions 0.97, January 1998, through 1.6.35, July 2018:
  *     Glenn Randers-Pehrson
- *   libpng versions 1.6.36, December 2018, through 1.6.55, February 2026:
+ *   libpng versions 1.6.36, December 2018, through 1.6.56, March 2026:
  *     Cosmin Truta
  *   See also "Contributing Authors", below.
  */
@@ -267,7 +267,7 @@
  *    ...
  *    1.5.30                  15    10530  15.so.15.30[.0]
  *    ...
- *    1.6.55                  16    10655  16.so.16.55[.0]
+ *    1.6.56                  16    10656  16.so.16.56[.0]
  *
  *    Henceforth the source version will match the shared-library major and
  *    minor numbers; the shared-library major version number will be used for
@@ -303,7 +303,7 @@
  */
 
 /* Version information for png.h - this should match the version in png.c */
-#define PNG_LIBPNG_VER_STRING "1.6.55"
+#define PNG_LIBPNG_VER_STRING "1.6.56"
 #define PNG_HEADER_VERSION_STRING " libpng version " PNG_LIBPNG_VER_STRING "\n"
 
 /* The versions of shared library builds should stay in sync, going forward */
@@ -314,7 +314,7 @@
 /* These should match the first 3 components of PNG_LIBPNG_VER_STRING: */
 #define PNG_LIBPNG_VER_MAJOR   1
 #define PNG_LIBPNG_VER_MINOR   6
-#define PNG_LIBPNG_VER_RELEASE 55
+#define PNG_LIBPNG_VER_RELEASE 56
 
 /* This should be zero for a public release, or non-zero for a
  * development version.
@@ -345,7 +345,7 @@
  * From version 1.0.1 it is:
  * XXYYZZ, where XX=major, YY=minor, ZZ=release
  */
-#define PNG_LIBPNG_VER 10655 /* 1.6.55 */
+#define PNG_LIBPNG_VER 10656 /* 1.6.56 */
 
 /* Library configuration: these options cannot be changed after
  * the library has been built.
@@ -455,7 +455,7 @@ extern "C" {
 /* This triggers a compiler error in png.c, if png.c and png.h
  * do not agree upon the version number.
  */
-typedef char *png_libpng_version_1_6_55;
+typedef char *png_libpng_version_1_6_56;
 
 /* Basic control structions.  Read libpng-manual.txt or libpng.3 for more info.
  *
@@ -2370,7 +2370,7 @@ PNG_EXPORT(162, int, png_get_text,
 #endif
 
 /* Note while png_set_text() will accept a structure whose text,
- * language, and  translated keywords are NULL pointers, the structure
+ * language, and translated keywords are NULL pointers, the structure
  * returned by png_get_text will always contain regular
  * zero-terminated C strings.  They might be empty strings but
  * they will never be NULL pointers.
diff --git a/src/java.desktop/share/native/libsplashscreen/libpng/pngconf.h b/src/java.desktop/share/native/libsplashscreen/libpng/pngconf.h
index b957f8b5061..5772e6ebb1c 100644
--- a/src/java.desktop/share/native/libsplashscreen/libpng/pngconf.h
+++ b/src/java.desktop/share/native/libsplashscreen/libpng/pngconf.h
@@ -29,7 +29,7 @@
  * However, the following notice accompanied the original version of this
  * file and, per its terms, should not be removed:
  *
- * libpng version 1.6.55
+ * libpng version 1.6.56
  *
  * Copyright (c) 2018-2026 Cosmin Truta
  * Copyright (c) 1998-2002,2004,2006-2016,2018 Glenn Randers-Pehrson
diff --git a/src/java.desktop/share/native/libsplashscreen/libpng/pnglibconf.h b/src/java.desktop/share/native/libsplashscreen/libpng/pnglibconf.h
index ae1ab462072..4a7e51d112d 100644
--- a/src/java.desktop/share/native/libsplashscreen/libpng/pnglibconf.h
+++ b/src/java.desktop/share/native/libsplashscreen/libpng/pnglibconf.h
@@ -31,7 +31,7 @@
  * However, the following notice accompanied the original version of this
  * file and, per its terms, should not be removed:
  */
-/* libpng version 1.6.55 */
+/* libpng version 1.6.56 */
 
 /* Copyright (c) 2018-2026 Cosmin Truta */
 /* Copyright (c) 1998-2002,2004,2006-2018 Glenn Randers-Pehrson */
diff --git a/src/java.desktop/share/native/libsplashscreen/libpng/pngpriv.h b/src/java.desktop/share/native/libsplashscreen/libpng/pngpriv.h
index ee91f58d4ba..086a2f76ee6 100644
--- a/src/java.desktop/share/native/libsplashscreen/libpng/pngpriv.h
+++ b/src/java.desktop/share/native/libsplashscreen/libpng/pngpriv.h
@@ -986,7 +986,7 @@
  *
  * At present these index values are not exported (not part of the public API)
  * so can be changed at will.  For convenience the names are in lexical sort
- * order but with the critical chunks at the start in the order of occurence in
+ * order but with the critical chunks at the start in the order of occurrence in
  * a PNG.
  *
  * PNG_INFO_ values do not exist for every one of these chunk handles; for
@@ -2115,7 +2115,7 @@ PNG_INTERNAL_FUNCTION(void, png_ascii_from_fixed,
  * not valid it will be the index of a character in the supposed number.
  *
  * The format of a number is defined in the PNG extensions specification
- * and this API is strictly conformant to that spec, not anyone elses!
+ * and this API is strictly conformant to that spec, not anyone else's!
  *
  * The format as a regular expression is:
  *
diff --git a/src/java.desktop/share/native/libsplashscreen/libpng/pngread.c b/src/java.desktop/share/native/libsplashscreen/libpng/pngread.c
index 79fd9ad6a82..70df18926f5 100644
--- a/src/java.desktop/share/native/libsplashscreen/libpng/pngread.c
+++ b/src/java.desktop/share/native/libsplashscreen/libpng/pngread.c
@@ -720,7 +720,7 @@ png_read_end(png_structrp png_ptr, png_inforp info_ptr)
       png_read_finish_IDAT(png_ptr);
 
 #ifdef PNG_READ_CHECK_FOR_INVALID_INDEX_SUPPORTED
-   /* Report invalid palette index; added at libng-1.5.10 */
+   /* Report invalid palette index; added at libpng-1.5.10 */
    if (png_ptr->color_type == PNG_COLOR_TYPE_PALETTE &&
        png_ptr->num_palette_max >= png_ptr->num_palette)
       png_benign_error(png_ptr, "Read palette index exceeding num_palette");
@@ -808,21 +808,19 @@ png_read_destroy(png_structrp png_ptr)
    png_ptr->quantize_index = NULL;
 #endif
 
-   if ((png_ptr->free_me & PNG_FREE_PLTE) != 0)
-   {
-      png_zfree(png_ptr, png_ptr->palette);
-      png_ptr->palette = NULL;
-   }
-   png_ptr->free_me &= ~PNG_FREE_PLTE;
+   /* png_ptr->palette is always independently allocated (not aliased
+    * with info_ptr->palette), so free it unconditionally.
+    */
+   png_free(png_ptr, png_ptr->palette);
+   png_ptr->palette = NULL;
 
 #if defined(PNG_tRNS_SUPPORTED) || \
     defined(PNG_READ_EXPAND_SUPPORTED) || defined(PNG_READ_BACKGROUND_SUPPORTED)
-   if ((png_ptr->free_me & PNG_FREE_TRNS) != 0)
-   {
-      png_free(png_ptr, png_ptr->trans_alpha);
-      png_ptr->trans_alpha = NULL;
-   }
-   png_ptr->free_me &= ~PNG_FREE_TRNS;
+   /* png_ptr->trans_alpha is always independently allocated (not aliased
+    * with info_ptr->trans_alpha), so free it unconditionally.
+    */
+   png_free(png_ptr, png_ptr->trans_alpha);
+   png_ptr->trans_alpha = NULL;
 #endif
 
    inflateEnd(&png_ptr->zstream);
@@ -1285,7 +1283,7 @@ png_image_is_not_sRGB(png_const_structrp png_ptr)
     * png_struct::chromaticities always exists since the simplified API
     * requires rgb-to-gray.  The mDCV, cICP and cHRM chunks may all set it to
     * a non-sRGB value, so it needs to be checked but **only** if one of
-    * those chunks occured in the file.
+    * those chunks occurred in the file.
     */
    /* Highest priority: check to be safe. */
    if (png_has_chunk(png_ptr, cICP) || png_has_chunk(png_ptr, mDCV))
@@ -2625,7 +2623,7 @@ png_image_read_colormap(png_voidp argument)
                   {
                      r = back_r;
                      g = back_g;
-                     b = back_g;
+                     b = back_b;
                   }
 
                   /* Compare the newly-created color-map entry with the one the
@@ -2903,9 +2901,9 @@ png_image_read_and_map(png_voidp argument)
          {
             png_bytep inrow = png_voidcast(png_bytep, display->local_row);
             png_bytep outrow = first_row + y * row_step;
-            png_const_bytep end_row = outrow + width;
+            png_const_bytep row_end = outrow + width;
 
-            /* Read read the libpng data into the temporary buffer. */
+            /* Read the libpng data into the temporary buffer. */
             png_read_row(png_ptr, inrow, NULL);
 
             /* Now process the row according to the processing option, note
@@ -2916,7 +2914,7 @@ png_image_read_and_map(png_voidp argument)
             switch (proc)
             {
                case PNG_CMAP_GA:
-                  for (; outrow < end_row; outrow += stepx)
+                  for (; outrow < row_end; outrow += stepx)
                   {
                      /* The data is always in the PNG order */
                      unsigned int gray = *inrow++;
@@ -2945,7 +2943,7 @@ png_image_read_and_map(png_voidp argument)
                   break;
 
                case PNG_CMAP_TRANS:
-                  for (; outrow < end_row; outrow += stepx)
+                  for (; outrow < row_end; outrow += stepx)
                   {
                      png_byte gray = *inrow++;
                      png_byte alpha = *inrow++;
@@ -2962,7 +2960,7 @@ png_image_read_and_map(png_voidp argument)
                   break;
 
                case PNG_CMAP_RGB:
-                  for (; outrow < end_row; outrow += stepx)
+                  for (; outrow < row_end; outrow += stepx)
                   {
                      *outrow = PNG_RGB_INDEX(inrow[0], inrow[1], inrow[2]);
                      inrow += 3;
@@ -2970,7 +2968,7 @@ png_image_read_and_map(png_voidp argument)
                   break;
 
                case PNG_CMAP_RGB_ALPHA:
-                  for (; outrow < end_row; outrow += stepx)
+                  for (; outrow < row_end; outrow += stepx)
                   {
                      unsigned int alpha = inrow[3];
 
@@ -3007,10 +3005,10 @@ png_image_read_and_map(png_voidp argument)
                          */
                         if (inrow[0] & 0x80) back_i += 9; /* red */
                         if (inrow[0] & 0x40) back_i += 9;
-                        if (inrow[0] & 0x80) back_i += 3; /* green */
-                        if (inrow[0] & 0x40) back_i += 3;
-                        if (inrow[0] & 0x80) back_i += 1; /* blue */
-                        if (inrow[0] & 0x40) back_i += 1;
+                        if (inrow[1] & 0x80) back_i += 3; /* green */
+                        if (inrow[1] & 0x40) back_i += 3;
+                        if (inrow[2] & 0x80) back_i += 1; /* blue */
+                        if (inrow[2] & 0x40) back_i += 1;
 
                         *outrow = (png_byte)back_i;
                      }
@@ -3277,18 +3275,18 @@ png_image_read_composite(png_voidp argument)
          {
             png_bytep inrow = png_voidcast(png_bytep, display->local_row);
             png_bytep outrow;
-            png_const_bytep end_row;
+            png_const_bytep row_end;
 
             /* Read the row, which is packed: */
             png_read_row(png_ptr, inrow, NULL);
 
             outrow = png_voidcast(png_bytep, display->first_row);
             outrow += y * row_step;
-            end_row = outrow + width * channels;
+            row_end = outrow + width * channels;
 
             /* Now do the composition on each pixel in this row. */
             outrow += startx;
-            for (; outrow < end_row; outrow += stepx)
+            for (; outrow < row_end; outrow += stepx)
             {
                png_byte alpha = inrow[channels];
 
@@ -3461,14 +3459,14 @@ png_image_read_background(png_voidp argument)
                      png_bytep inrow = png_voidcast(png_bytep,
                          display->local_row);
                      png_bytep outrow = first_row + y * row_step;
-                     png_const_bytep end_row = outrow + width;
+                     png_const_bytep row_end = outrow + width;
 
                      /* Read the row, which is packed: */
                      png_read_row(png_ptr, inrow, NULL);
 
                      /* Now do the composition on each pixel in this row. */
                      outrow += startx;
-                     for (; outrow < end_row; outrow += stepx)
+                     for (; outrow < row_end; outrow += stepx)
                      {
                         png_byte alpha = inrow[1];
 
@@ -3506,14 +3504,14 @@ png_image_read_background(png_voidp argument)
                      png_bytep inrow = png_voidcast(png_bytep,
                          display->local_row);
                      png_bytep outrow = first_row + y * row_step;
-                     png_const_bytep end_row = outrow + width;
+                     png_const_bytep row_end = outrow + width;
 
                      /* Read the row, which is packed: */
                      png_read_row(png_ptr, inrow, NULL);
 
                      /* Now do the composition on each pixel in this row. */
                      outrow += startx;
-                     for (; outrow < end_row; outrow += stepx)
+                     for (; outrow < row_end; outrow += stepx)
                      {
                         png_byte alpha = inrow[1];
 
@@ -3596,7 +3594,7 @@ png_image_read_background(png_voidp argument)
                {
                   png_const_uint_16p inrow;
                   png_uint_16p outrow = first_row + y * row_step;
-                  png_uint_16p end_row = outrow + width * outchannels;
+                  png_uint_16p row_end = outrow + width * outchannels;
 
                   /* Read the row, which is packed: */
                   png_read_row(png_ptr, png_voidcast(png_bytep,
@@ -3606,7 +3604,7 @@ png_image_read_background(png_voidp argument)
                   /* Now do the pre-multiplication on each pixel in this row.
                    */
                   outrow += startx;
-                  for (; outrow < end_row; outrow += stepx)
+                  for (; outrow < row_end; outrow += stepx)
                   {
                      png_uint_32 component = inrow[0];
                      png_uint_16 alpha = inrow[1];
@@ -4142,7 +4140,7 @@ png_image_finish_read(png_imagep image, png_const_colorp background,
             row_stride = (png_int_32)/*SAFE*/png_row_stride;
 
          if (row_stride < 0)
-            check = (png_uint_32)(-row_stride);
+            check = -(png_uint_32)row_stride;
 
          else
             check = (png_uint_32)row_stride;
diff --git a/src/java.desktop/share/native/libsplashscreen/libpng/pngrtran.c b/src/java.desktop/share/native/libsplashscreen/libpng/pngrtran.c
index fcce80da1cb..f0972ba9bef 100644
--- a/src/java.desktop/share/native/libsplashscreen/libpng/pngrtran.c
+++ b/src/java.desktop/share/native/libsplashscreen/libpng/pngrtran.c
@@ -259,7 +259,7 @@ png_set_strip_alpha(png_structrp png_ptr)
  *
  * Terminology (assuming power law, "gamma", encodings):
  *    "screen" gamma: a power law imposed by the output device when digital
- *    samples are converted to visible light output.  The EOTF - volage to
+ *    samples are converted to visible light output.  The EOTF - voltage to
  *    luminance on output.
  *
  *    "file" gamma: a power law used to encode luminance levels from the input
@@ -524,6 +524,9 @@ png_set_quantize(png_structrp png_ptr, png_colorp palette,
    if (png_rtran_ok(png_ptr, 0) == 0)
       return;
 
+   if (palette == NULL)
+      return;
+
    png_ptr->transformations |= PNG_QUANTIZE;
 
    if (full_quantize == 0)
@@ -840,7 +843,13 @@ png_set_quantize(png_structrp png_ptr, png_colorp palette,
    }
    if (png_ptr->palette == NULL)
    {
-      png_ptr->palette = palette;
+      /* Allocate an owned copy rather than aliasing the caller's pointer,
+       * so that png_read_destroy can free png_ptr->palette unconditionally.
+       */
+      png_ptr->palette = png_voidcast(png_colorp, png_calloc(png_ptr,
+          PNG_MAX_PALETTE_LENGTH * (sizeof (png_color))));
+      memcpy(png_ptr->palette, palette, (unsigned int)num_palette *
+          (sizeof (png_color)));
    }
    png_ptr->num_palette = (png_uint_16)num_palette;
 
@@ -1393,7 +1402,7 @@ png_resolve_file_gamma(png_const_structrp png_ptr)
    if (file_gamma != 0)
       return file_gamma;
 
-   /* If png_reciprocal oveflows it returns 0 which indicates to the caller that
+   /* If png_reciprocal overflows, it returns 0, indicating to the caller that
     * there is no usable file gamma.  (The checks added to png_set_gamma and
     * png_set_alpha_mode should prevent a screen_gamma which would overflow.)
     */
@@ -2090,6 +2099,21 @@ png_read_transform_info(png_structrp png_ptr, png_inforp info_ptr)
 {
    png_debug(1, "in png_read_transform_info");
 
+   if (png_ptr->transformations != 0)
+   {
+      if (info_ptr->color_type == PNG_COLOR_TYPE_PALETTE &&
+          info_ptr->palette != NULL && png_ptr->palette != NULL)
+      {
+         /* Sync info_ptr->palette with png_ptr->palette.
+          * The function png_init_read_transformations may have modified
+          * png_ptr->palette in place (e.g. for gamma correction or for
+          * background compositing).
+          */
+         memcpy(info_ptr->palette, png_ptr->palette,
+             PNG_MAX_PALETTE_LENGTH * (sizeof (png_color)));
+      }
+   }
+
 #ifdef PNG_READ_EXPAND_SUPPORTED
    if ((png_ptr->transformations & PNG_EXPAND) != 0)
    {
diff --git a/src/java.desktop/share/native/libsplashscreen/libpng/pngrutil.c b/src/java.desktop/share/native/libsplashscreen/libpng/pngrutil.c
index 01bb0c8bedc..4712dfd418a 100644
--- a/src/java.desktop/share/native/libsplashscreen/libpng/pngrutil.c
+++ b/src/java.desktop/share/native/libsplashscreen/libpng/pngrutil.c
@@ -465,7 +465,7 @@ png_inflate_claim(png_structrp png_ptr, png_uint_32 owner)
     * be gained by using this when it is known *if* the zlib stream itself does
     * not record the number; however, this is an illusion: the original writer
     * of the PNG may have selected a lower window size, and we really must
-    * follow that because, for systems with with limited capabilities, we
+    * follow that because, for systems with limited capabilities, we
     * would otherwise reject the application's attempts to use a smaller window
     * size (zlib doesn't have an interface to say "this or lower"!).
     *
@@ -1035,7 +1035,7 @@ png_handle_PLTE(png_structrp png_ptr, png_inforp info_ptr, png_uint_32 length)
     * in the case of an 8-bit display with a decoder which controls the palette.
     *
     * The alternative here is to ignore the error and store the palette anyway;
-    * destroying the tRNS will definately cause problems.
+    * destroying the tRNS will definitely cause problems.
     *
     * NOTE: the case of PNG_COLOR_TYPE_PALETTE need not be considered because
     * the png_handle_ routines for the three 'after PLTE' chunks tRNS, bKGD and
@@ -1082,19 +1082,6 @@ png_handle_PLTE(png_structrp png_ptr, png_inforp info_ptr, png_uint_32 length)
       /* A valid PLTE chunk has been read */
       png_ptr->mode |= PNG_HAVE_PLTE;
 
-      /* TODO: png_set_PLTE has the side effect of setting png_ptr->palette to
-       * its own copy of the palette.  This has the side effect that when
-       * png_start_row is called (this happens after any call to
-       * png_read_update_info) the info_ptr palette gets changed.  This is
-       * extremely unexpected and confusing.
-       *
-       * REVIEW: there have been consistent bugs in the past about gamma and
-       * similar transforms to colour mapped images being useless because the
-       * modified palette cannot be accessed because of the above.
-       *
-       * CONSIDER: Fix this by not sharing the palette in this way.  But does
-       * this completely fix the problem?
-       */
       png_set_PLTE(png_ptr, info_ptr, palette, num);
       return handled_ok;
    }
@@ -1296,7 +1283,7 @@ png_handle_cHRM(png_structrp png_ptr, png_inforp info_ptr, png_uint_32 length)
 
    /* png_set_cHRM may complain about some of the values but this doesn't matter
     * because it was a cHRM and it did have vaguely (if, perhaps, ridiculous)
-    * values.  Ridiculousity will be checked if the values are used later.
+    * values.  Ridiculosity will be checked if the values are used later.
     */
    png_set_cHRM_fixed(png_ptr, info_ptr, xy.whitex, xy.whitey, xy.redx, xy.redy,
          xy.greenx, xy.greeny, xy.bluex, xy.bluey);
@@ -1593,7 +1580,8 @@ static png_handle_result_code /* PRIVATE */
 png_handle_sPLT(png_structrp png_ptr, png_inforp info_ptr, png_uint_32 length)
 /* Note: this does not properly handle chunks that are > 64K under DOS */
 {
-   png_bytep entry_start, buffer;
+   png_bytep buffer;
+   png_bytep entry_start;
    png_sPLT_t new_palette;
    png_sPLT_entryp pp;
    png_uint_32 data_length;
@@ -1800,10 +1788,6 @@ png_handle_tRNS(png_structrp png_ptr, png_inforp info_ptr, png_uint_32 length)
       return handled_error;
    }
 
-   /* TODO: this is a horrible side effect in the palette case because the
-    * png_struct ends up with a pointer to the tRNS buffer owned by the
-    * png_info.  Fix this.
-    */
    png_set_tRNS(png_ptr, info_ptr, readbuf, png_ptr->num_trans,
        &(png_ptr->trans_color));
    return handled_ok;
@@ -2062,7 +2046,7 @@ png_handle_eXIf(png_structrp png_ptr, png_inforp info_ptr, png_uint_32 length)
       return handled_error;
 
    /* PNGv3: the code used to check the byte order mark at the start for MM or
-    * II, however PNGv3 states that the the first 4 bytes should be checked.
+    * II, however PNGv3 states that the first 4 bytes should be checked.
     * The caller ensures that there are four bytes available.
     */
    {
@@ -2184,9 +2168,13 @@ png_handle_oFFs(png_structrp png_ptr, png_inforp info_ptr, png_uint_32 length)
 static png_handle_result_code /* PRIVATE */
 png_handle_pCAL(png_structrp png_ptr, png_inforp info_ptr, png_uint_32 length)
 {
+   png_bytep buffer;
+   png_bytep buf;
+   png_bytep endptr;
    png_int_32 X0, X1;
-   png_byte type, nparams;
-   png_bytep buffer, buf, units, endptr;
+   png_byte type;
+   png_byte nparams;
+   png_byte *units;
    png_charpp params;
    int i;
 
@@ -3040,7 +3028,7 @@ static const struct
    png_uint_32 max_length :12; /* Length min, max in bytes */
    png_uint_32 min_length :8;
       /* Length errors on critical chunks have special handling to preserve the
-       * existing behaviour in libpng 1.6.  Anciallary chunks are checked below
+       * existing behaviour in libpng 1.6.  Ancillary chunks are checked below
        * and produce a 'benign' error.
        */
    png_uint_32 pos_before :4; /* PNG_HAVE_ values chunk must precede */
@@ -3048,7 +3036,7 @@ static const struct
       /* NOTE: PLTE, tRNS and bKGD require special handling which depends on
        * the colour type of the base image.
        */
-   png_uint_32 multiple   :1; /* Multiple occurences permitted */
+   png_uint_32 multiple   :1; /* Multiple occurrences permitted */
       /* This is enabled for PLTE because PLTE may, in practice, be optional */
 }
 read_chunks[PNG_INDEX_unknown] =
@@ -3082,7 +3070,7 @@ read_chunks[PNG_INDEX_unknown] =
 #  define CDIHDR      13U,   13U,  hIHDR,     0,        0
 #  define CDPLTE  NoCheck,    0U,      0, hIHDR,        1
       /* PLTE errors are only critical for colour-map images, consequently the
-       * hander does all the checks.
+       * handler does all the checks.
        */
 #  define CDIDAT  NoCheck,    0U,  aIDAT, hIHDR,        1
 #  define CDIEND  NoCheck,    0U,      0, aIDAT,        0
diff --git a/src/java.desktop/share/native/libsplashscreen/libpng/pngset.c b/src/java.desktop/share/native/libsplashscreen/libpng/pngset.c
index 0b2844f1864..05d18cd06b7 100644
--- a/src/java.desktop/share/native/libsplashscreen/libpng/pngset.c
+++ b/src/java.desktop/share/native/libsplashscreen/libpng/pngset.c
@@ -29,7 +29,7 @@
  * However, the following notice accompanied the original version of this
  * file and, per its terms, should not be removed:
  *
- * Copyright (c) 2018-2025 Cosmin Truta
+ * Copyright (c) 2018-2026 Cosmin Truta
  * Copyright (c) 1998-2018 Glenn Randers-Pehrson
  * Copyright (c) 1996-1997 Andreas Dilger
  * Copyright (c) 1995-1996 Guy Eric Schalnat, Group 42, Inc.
@@ -362,7 +362,8 @@ png_set_eXIf_1(png_const_structrp png_ptr, png_inforp info_ptr,
    png_debug1(1, "in %s storage function", "eXIf");
 
    if (png_ptr == NULL || info_ptr == NULL ||
-       (png_ptr->mode & PNG_WROTE_eXIf) != 0)
+       (png_ptr->mode & PNG_WROTE_eXIf) != 0 ||
+       exif == NULL)
       return;
 
    new_exif = png_voidcast(png_bytep, png_malloc_warn(png_ptr, num_exif));
@@ -417,7 +418,7 @@ png_set_hIST(png_const_structrp png_ptr, png_inforp info_ptr,
 
    png_debug1(1, "in %s storage function", "hIST");
 
-   if (png_ptr == NULL || info_ptr == NULL)
+   if (png_ptr == NULL || info_ptr == NULL || hist == NULL)
       return;
 
    if (info_ptr->num_palette == 0 || info_ptr->num_palette
@@ -804,28 +805,38 @@ png_set_PLTE(png_structrp png_ptr, png_inforp info_ptr,
       png_error(png_ptr, "Invalid palette");
    }
 
-   /* It may not actually be necessary to set png_ptr->palette here;
-    * we do it for backward compatibility with the way the png_handle_tRNS
-    * function used to do the allocation.
-    *
-    * 1.6.0: the above statement appears to be incorrect; something has to set
-    * the palette inside png_struct on read.
-    */
    png_free_data(png_ptr, info_ptr, PNG_FREE_PLTE, 0);
 
    /* Changed in libpng-1.2.1 to allocate PNG_MAX_PALETTE_LENGTH instead
     * of num_palette entries, in case of an invalid PNG file or incorrect
     * call to png_set_PLTE() with too-large sample values.
+    *
+    * Allocate independent buffers for info_ptr and png_ptr so that the
+    * lifetime of png_ptr->palette is decoupled from the lifetime of
+    * info_ptr->palette.  Previously, these two pointers were aliased,
+    * which caused a use-after-free vulnerability if png_free_data freed
+    * info_ptr->palette while png_ptr->palette was still in use by the
+    * row transform functions (e.g. png_do_expand_palette).
+    *
+    * Both buffers are allocated with png_calloc to zero-fill, because
+    * the ARM NEON palette riffle reads all 256 entries unconditionally,
+    * regardless of num_palette.
     */
+   png_free(png_ptr, png_ptr->palette);
    png_ptr->palette = png_voidcast(png_colorp, png_calloc(png_ptr,
        PNG_MAX_PALETTE_LENGTH * (sizeof (png_color))));
+   info_ptr->palette = png_voidcast(png_colorp, png_calloc(png_ptr,
+       PNG_MAX_PALETTE_LENGTH * (sizeof (png_color))));
+   png_ptr->num_palette = info_ptr->num_palette = (png_uint_16)num_palette;
 
    if (num_palette > 0)
+   {
+      memcpy(info_ptr->palette, palette, (unsigned int)num_palette *
+          (sizeof (png_color)));
       memcpy(png_ptr->palette, palette, (unsigned int)num_palette *
           (sizeof (png_color)));
+   }
 
-   info_ptr->palette = png_ptr->palette;
-   info_ptr->num_palette = png_ptr->num_palette = (png_uint_16)num_palette;
    info_ptr->free_me |= PNG_FREE_PLTE;
    info_ptr->valid |= PNG_INFO_PLTE;
 }
@@ -1183,28 +1194,40 @@ png_set_tRNS(png_structrp png_ptr, png_inforp info_ptr,
 
    if (trans_alpha != NULL)
    {
-       /* It may not actually be necessary to set png_ptr->trans_alpha here;
-        * we do it for backward compatibility with the way the png_handle_tRNS
-        * function used to do the allocation.
-        *
-        * 1.6.0: The above statement is incorrect; png_handle_tRNS effectively
-        * relies on png_set_tRNS storing the information in png_struct
-        * (otherwise it won't be there for the code in pngrtran.c).
-        */
-
        png_free_data(png_ptr, info_ptr, PNG_FREE_TRNS, 0);
 
        if (num_trans > 0 && num_trans <= PNG_MAX_PALETTE_LENGTH)
        {
-         /* Changed from num_trans to PNG_MAX_PALETTE_LENGTH in version 1.2.1 */
+          /* Allocate info_ptr's copy of the transparency data.
+           * Initialize all entries to fully opaque (0xff), then overwrite
+           * the first num_trans entries with the actual values.
+           */
           info_ptr->trans_alpha = png_voidcast(png_bytep,
               png_malloc(png_ptr, PNG_MAX_PALETTE_LENGTH));
+          memset(info_ptr->trans_alpha, 0xff, PNG_MAX_PALETTE_LENGTH);
           memcpy(info_ptr->trans_alpha, trans_alpha, (size_t)num_trans);
-
           info_ptr->free_me |= PNG_FREE_TRNS;
           info_ptr->valid |= PNG_INFO_tRNS;
+
+          /* Allocate an independent copy for png_struct, so that the
+           * lifetime of png_ptr->trans_alpha is decoupled from the
+           * lifetime of info_ptr->trans_alpha.  Previously these two
+           * pointers were aliased, which caused a use-after-free if
+           * png_free_data freed info_ptr->trans_alpha while
+           * png_ptr->trans_alpha was still in use by the row transform
+           * functions (e.g. png_do_expand_palette).
+           */
+          png_free(png_ptr, png_ptr->trans_alpha);
+          png_ptr->trans_alpha = png_voidcast(png_bytep,
+              png_malloc(png_ptr, PNG_MAX_PALETTE_LENGTH));
+          memset(png_ptr->trans_alpha, 0xff, PNG_MAX_PALETTE_LENGTH);
+          memcpy(png_ptr->trans_alpha, trans_alpha, (size_t)num_trans);
+       }
+       else
+       {
+          png_free(png_ptr, png_ptr->trans_alpha);
+          png_ptr->trans_alpha = NULL;
        }
-       png_ptr->trans_alpha = info_ptr->trans_alpha;
    }
 
    if (trans_color != NULL)
@@ -1902,7 +1925,7 @@ png_set_benign_errors(png_structrp png_ptr, int allowed)
 #endif /* BENIGN_ERRORS */
 
 #ifdef PNG_CHECK_FOR_INVALID_INDEX_SUPPORTED
-   /* Whether to report invalid palette index; added at libng-1.5.10.
+   /* Whether to report invalid palette index; added at libpng-1.5.10.
     * It is possible for an indexed (color-type==3) PNG file to contain
     * pixels with invalid (out-of-range) indexes if the PLTE chunk has
     * fewer entries than the image's bit-depth would allow. We recover
diff --git a/src/java.desktop/share/native/libsplashscreen/libpng/pngstruct.h b/src/java.desktop/share/native/libsplashscreen/libpng/pngstruct.h
index 8edb4bc393a..f02365e8d8e 100644
--- a/src/java.desktop/share/native/libsplashscreen/libpng/pngstruct.h
+++ b/src/java.desktop/share/native/libsplashscreen/libpng/pngstruct.h
@@ -29,7 +29,7 @@
  * However, the following notice accompanied the original version of this
  * file and, per its terms, should not be removed:
  *
- * Copyright (c) 2018-2025 Cosmin Truta
+ * Copyright (c) 2018-2026 Cosmin Truta
  * Copyright (c) 1998-2002,2004,2006-2018 Glenn Randers-Pehrson
  * Copyright (c) 1996-1997 Andreas Dilger
  * Copyright (c) 1995-1996 Guy Eric Schalnat, Group 42, Inc.
@@ -135,7 +135,7 @@ typedef enum
  * TODO: C23: convert these macros to C23 inlines (which are static).
  */
 #define png_chunk_flag_from_index(i) (0x80000000U >> (31 - (i)))
-   /* The flag coresponding to the given png_index enum value.  This is defined
+   /* The flag corresponding to the given png_index enum value.  This is defined
     * for png_unknown as well (until it reaches the value 32) but this should
     * not be relied on.
     */
@@ -144,7 +144,7 @@ typedef enum
    (((png_ptr)->chunks & png_chunk_flag_from_index(i)) != 0)
    /* The chunk has been recorded in png_struct */
 
-#define png_file_add_chunk(pnt_ptr, i)\
+#define png_file_add_chunk(png_ptr, i)\
    ((void)((png_ptr)->chunks |= png_chunk_flag_from_index(i)))
    /* Record the chunk in the png_struct */
 
diff --git a/src/java.desktop/share/native/libsplashscreen/libpng/pngtrans.c b/src/java.desktop/share/native/libsplashscreen/libpng/pngtrans.c
index b9f6cb5d437..86ff2812e23 100644
--- a/src/java.desktop/share/native/libsplashscreen/libpng/pngtrans.c
+++ b/src/java.desktop/share/native/libsplashscreen/libpng/pngtrans.c
@@ -29,7 +29,7 @@
  * However, the following notice accompanied the original version of this
  * file and, per its terms, should not be removed:
  *
- * Copyright (c) 2018-2024 Cosmin Truta
+ * Copyright (c) 2018-2026 Cosmin Truta
  * Copyright (c) 1998-2002,2004,2006-2018 Glenn Randers-Pehrson
  * Copyright (c) 1996-1997 Andreas Dilger
  * Copyright (c) 1995-1996 Guy Eric Schalnat, Group 42, Inc.
@@ -113,9 +113,38 @@ png_set_shift(png_structrp png_ptr, png_const_color_8p true_bits)
 {
    png_debug(1, "in png_set_shift");
 
-   if (png_ptr == NULL)
+   if (png_ptr == NULL || true_bits == NULL)
       return;
 
+   /* Check the shift values before passing them on to png_do_shift. */
+   {
+      png_byte bit_depth = png_ptr->bit_depth;
+      int invalid = 0;
+
+      if ((png_ptr->color_type & PNG_COLOR_MASK_COLOR) != 0)
+      {
+         if (true_bits->red == 0 || true_bits->red > bit_depth ||
+             true_bits->green == 0 || true_bits->green > bit_depth ||
+             true_bits->blue == 0 || true_bits->blue > bit_depth)
+            invalid = 1;
+      }
+      else
+      {
+         if (true_bits->gray == 0 || true_bits->gray > bit_depth)
+            invalid = 1;
+      }
+
+      if ((png_ptr->color_type & PNG_COLOR_MASK_ALPHA) != 0 &&
+          (true_bits->alpha == 0 || true_bits->alpha > bit_depth))
+         invalid = 1;
+
+      if (invalid)
+      {
+         png_app_error(png_ptr, "png_set_shift: invalid shift values");
+         return;
+      }
+   }
+
    png_ptr->transformations |= PNG_SHIFT;
    png_ptr->shift = *true_bits;
 }
@@ -486,10 +515,9 @@ png_do_packswap(png_row_infop row_info, png_bytep row)
 
    if (row_info->bit_depth < 8)
    {
+      png_const_bytep table;
       png_bytep rp;
-      png_const_bytep end, table;
-
-      end = row + row_info->rowbytes;
+      png_bytep row_end = row + row_info->rowbytes;
 
       if (row_info->bit_depth == 1)
          table = onebppswaptable;
@@ -503,7 +531,7 @@ png_do_packswap(png_row_infop row_info, png_bytep row)
       else
          return;
 
-      for (rp = row; rp < end; rp++)
+      for (rp = row; rp < row_end; rp++)
          *rp = table[*rp];
    }
 }

From ee0d6cd9aedc0d4c4232dccab310de188af4bebc Mon Sep 17 00:00:00 2001
From: Jatin Bhateja <jbhateja@openjdk.org>
Date: Tue, 31 Mar 2026 05:52:16 +0000
Subject: [PATCH 425/655] 8378250: C2 VectorAPI : wrong result with MUL
 reduction at various AVX levels

Reviewed-by: epeter
---
 src/hotspot/cpu/x86/c2_MacroAssembler_x86.cpp |   9 +-
 .../vectorapi/TestMultiplyReductionByte.java  | 133 ++++++++++++++++++
 .../incubator/vector/ByteVector128Tests.java  |   4 +
 .../incubator/vector/ByteVector256Tests.java  |   4 +
 .../incubator/vector/ByteVector512Tests.java  |   4 +
 .../incubator/vector/ByteVector64Tests.java   |   4 +
 .../incubator/vector/ByteVectorMaxTests.java  |   4 +
 .../vector/DoubleVector128Tests.java          |   4 +
 .../vector/DoubleVector256Tests.java          |   4 +
 .../vector/DoubleVector512Tests.java          |   4 +
 .../incubator/vector/DoubleVector64Tests.java |   4 +
 .../vector/DoubleVectorMaxTests.java          |   4 +
 .../incubator/vector/FloatVector128Tests.java |   4 +
 .../incubator/vector/FloatVector256Tests.java |   4 +
 .../incubator/vector/FloatVector512Tests.java |   4 +
 .../incubator/vector/FloatVector64Tests.java  |   4 +
 .../incubator/vector/FloatVectorMaxTests.java |   4 +
 .../incubator/vector/IntVector128Tests.java   |   4 +
 .../incubator/vector/IntVector256Tests.java   |   4 +
 .../incubator/vector/IntVector512Tests.java   |   4 +
 .../incubator/vector/IntVector64Tests.java    |   4 +
 .../incubator/vector/IntVectorMaxTests.java   |   4 +
 .../incubator/vector/LongVector128Tests.java  |   4 +
 .../incubator/vector/LongVector256Tests.java  |   4 +
 .../incubator/vector/LongVector512Tests.java  |   4 +
 .../incubator/vector/LongVector64Tests.java   |   4 +
 .../incubator/vector/LongVectorMaxTests.java  |   4 +
 .../incubator/vector/ShortVector128Tests.java |   4 +
 .../incubator/vector/ShortVector256Tests.java |   4 +
 .../incubator/vector/ShortVector512Tests.java |   4 +
 .../incubator/vector/ShortVector64Tests.java  |   4 +
 .../incubator/vector/ShortVectorMaxTests.java |   4 +
 .../vector/templates/Unit-header.template     |   4 +
 33 files changed, 263 insertions(+), 3 deletions(-)
 create mode 100644 test/hotspot/jtreg/compiler/vectorapi/TestMultiplyReductionByte.java

diff --git a/src/hotspot/cpu/x86/c2_MacroAssembler_x86.cpp b/src/hotspot/cpu/x86/c2_MacroAssembler_x86.cpp
index 23b9a77844d..f36c816dd5e 100644
--- a/src/hotspot/cpu/x86/c2_MacroAssembler_x86.cpp
+++ b/src/hotspot/cpu/x86/c2_MacroAssembler_x86.cpp
@@ -2150,8 +2150,8 @@ void C2_MacroAssembler::mulreduce16B(int opcode, Register dst, Register src1, XM
   } else {
     pmovsxbw(vtmp2, src2);
     reduce8S(opcode, dst, src1, vtmp2, vtmp1, vtmp2);
-    pshufd(vtmp2, src2, 0x1);
-    pmovsxbw(vtmp2, src2);
+    pshufd(vtmp2, src2, 0xe);
+    pmovsxbw(vtmp2, vtmp2);
     reduce8S(opcode, dst, dst, vtmp2, vtmp1, vtmp2);
   }
 }
@@ -2160,7 +2160,7 @@ void C2_MacroAssembler::mulreduce32B(int opcode, Register dst, Register src1, XM
   if (UseAVX > 2 && VM_Version::supports_avx512bw()) {
     int vector_len = Assembler::AVX_512bit;
     vpmovsxbw(vtmp1, src2, vector_len);
-    reduce32S(opcode, dst, src1, vtmp1, vtmp1, vtmp2);
+    reduce32S(opcode, dst, src1, vtmp1, vtmp2, vtmp1);
   } else {
     assert(UseAVX >= 2,"Should not reach here.");
     mulreduce16B(opcode, dst, src1, src2, vtmp1, vtmp2);
@@ -2207,6 +2207,7 @@ void C2_MacroAssembler::reduce8S(int opcode, Register dst, Register src1, XMMReg
     }
     phaddw(vtmp1, src2);
   } else {
+    assert_different_registers(src2, vtmp1);
     pshufd(vtmp1, src2, 0xE);
     reduce_operation_128(T_SHORT, opcode, vtmp1, src2);
   }
@@ -2219,6 +2220,7 @@ void C2_MacroAssembler::reduce16S(int opcode, Register dst, Register src1, XMMRe
     vphaddw(vtmp2, src2, src2, vector_len);
     vpermq(vtmp2, vtmp2, 0xD8, vector_len);
   } else {
+    assert_different_registers(src2, vtmp2);
     vextracti128_high(vtmp2, src2);
     reduce_operation_128(T_SHORT, opcode, vtmp2, src2);
   }
@@ -2226,6 +2228,7 @@ void C2_MacroAssembler::reduce16S(int opcode, Register dst, Register src1, XMMRe
 }
 
 void C2_MacroAssembler::reduce32S(int opcode, Register dst, Register src1, XMMRegister src2, XMMRegister vtmp1, XMMRegister vtmp2) {
+  assert_different_registers(src2, vtmp1);
   int vector_len = Assembler::AVX_256bit;
   vextracti64x4_high(vtmp1, src2);
   reduce_operation_256(T_SHORT, opcode, vtmp1, vtmp1, src2);
diff --git a/test/hotspot/jtreg/compiler/vectorapi/TestMultiplyReductionByte.java b/test/hotspot/jtreg/compiler/vectorapi/TestMultiplyReductionByte.java
new file mode 100644
index 00000000000..13eafd8dc26
--- /dev/null
+++ b/test/hotspot/jtreg/compiler/vectorapi/TestMultiplyReductionByte.java
@@ -0,0 +1,133 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+package compiler.vectorapi;
+
+import compiler.lib.ir_framework.*;
+
+import java.util.Arrays;
+
+import jdk.incubator.vector.ByteVector;
+import jdk.incubator.vector.VectorOperators;
+
+import jdk.test.lib.Asserts;
+import jdk.test.lib.Utils;
+
+/**
+ * @test
+ * @bug 8378250
+ * @summary Verify correctness of byte vector MUL reduction across all species.
+ *          A register aliasing bug in mulreduce32B caused the upper half of
+ *          sign-extended data to overwrite the source, producing wrong results
+ *          when most lanes are 1 and a single lane differs.
+ * @library /test/lib /
+ * @modules jdk.incubator.vector
+ * @run driver ${test.main.class}
+ */
+public class TestMultiplyReductionByte {
+
+    static byte[] input = new byte[64];
+
+    static int pos = Utils.getRandomInstance().nextInt(input.length);
+
+    static {
+        Arrays.fill(input, (byte) 1);
+        input[pos] = -3;
+    }
+
+    @Test
+    @IR(counts = {IRNode.MUL_REDUCTION_VI, ">=1"},
+        applyIfCPUFeatureOr = {"avx", "true", "asimd", "true"},
+        applyIf = {"MaxVectorSize", ">=8"})
+    static byte testMulReduce64() {
+        return ByteVector.fromArray(ByteVector.SPECIES_64, input, 0)
+                         .reduceLanes(VectorOperators.MUL);
+    }
+
+    @Run(test = "testMulReduce64")
+    static void runMulReduce64() {
+        input[pos] = 1;
+        pos = (pos + 1) % ByteVector.SPECIES_64.length();
+        input[pos] = -3;
+        byte result = testMulReduce64();
+        Asserts.assertEquals((byte) -3, result, "MUL reduction (64-bit), pos=" + pos);
+    }
+
+    @Test
+    @IR(counts = {IRNode.MUL_REDUCTION_VI, ">=1"},
+        applyIfCPUFeatureOr = {"avx", "true", "asimd", "true"},
+        applyIf = {"MaxVectorSize", ">=16"})
+    static byte testMulReduce128() {
+        return ByteVector.fromArray(ByteVector.SPECIES_128, input, 0)
+                         .reduceLanes(VectorOperators.MUL);
+    }
+
+    @Run(test = "testMulReduce128")
+    static void runMulReduce128() {
+        input[pos] = 1;
+        pos = (pos + 1) % ByteVector.SPECIES_128.length();
+        input[pos] = -3;
+        byte result = testMulReduce128();
+        Asserts.assertEquals((byte) -3, result, "MUL reduction (128-bit), pos=" + pos);
+    }
+
+    @Test
+    @IR(counts = {IRNode.MUL_REDUCTION_VI, ">=1"},
+        applyIfCPUFeatureOr = {"avx2", "true", "asimd", "true"},
+        applyIf = {"MaxVectorSize", ">=32"})
+    static byte testMulReduce256() {
+        return ByteVector.fromArray(ByteVector.SPECIES_256, input, 0)
+                         .reduceLanes(VectorOperators.MUL);
+    }
+
+    @Run(test = "testMulReduce256")
+    static void runMulReduce256() {
+        input[pos] = 1;
+        pos = (pos + 1) % ByteVector.SPECIES_256.length();
+        input[pos] = -3;
+        byte result = testMulReduce256();
+        Asserts.assertEquals((byte) -3, result, "MUL reduction (256-bit), pos=" + pos);
+    }
+
+    @Test
+    @IR(counts = {IRNode.MUL_REDUCTION_VI, ">=1"},
+        applyIfCPUFeatureOr = {"avx512f", "true", "asimd", "true"},
+        applyIf = {"MaxVectorSize", ">=64"})
+    static byte testMulReduce512() {
+        return ByteVector.fromArray(ByteVector.SPECIES_512, input, 0)
+                         .reduceLanes(VectorOperators.MUL);
+    }
+
+    @Run(test = "testMulReduce512")
+    static void runMulReduce512() {
+        input[pos] = 1;
+        pos = (pos + 1) % ByteVector.SPECIES_512.length();
+        input[pos] = -3;
+        byte result = testMulReduce512();
+        Asserts.assertEquals((byte) -3, result, "MUL reduction (512-bit), pos=" + pos);
+    }
+
+    public static void main(String[] args) {
+        TestFramework.runWithFlags("--add-modules=jdk.incubator.vector");
+    }
+}
diff --git a/test/jdk/jdk/incubator/vector/ByteVector128Tests.java b/test/jdk/jdk/incubator/vector/ByteVector128Tests.java
index ca6fa537ac4..b605182e496 100644
--- a/test/jdk/jdk/incubator/vector/ByteVector128Tests.java
+++ b/test/jdk/jdk/incubator/vector/ByteVector128Tests.java
@@ -1114,6 +1114,10 @@ public class ByteVector128Tests extends AbstractVectorTest {
                 return fill(s * BUFFER_REPS,
                             i -> (((byte)(i + 1) == 0) ? 1 : (byte)(i + 1)));
             }),
+            withToString("byte[smallOddValue(i)]", (int s) -> {
+                return fill(s * BUFFER_REPS,
+                            i -> (byte)(i % 7 == 0 ? -3 : (i % 3 == 0 ? -1 : 1)));
+            }),
             withToString("byte[cornerCaseValue(i)]", (int s) -> {
                 return fill(s * BUFFER_REPS,
                             i -> cornerCaseValue(i));
diff --git a/test/jdk/jdk/incubator/vector/ByteVector256Tests.java b/test/jdk/jdk/incubator/vector/ByteVector256Tests.java
index 5c32d4a7f74..bc05a0bd6ca 100644
--- a/test/jdk/jdk/incubator/vector/ByteVector256Tests.java
+++ b/test/jdk/jdk/incubator/vector/ByteVector256Tests.java
@@ -1114,6 +1114,10 @@ public class ByteVector256Tests extends AbstractVectorTest {
                 return fill(s * BUFFER_REPS,
                             i -> (((byte)(i + 1) == 0) ? 1 : (byte)(i + 1)));
             }),
+            withToString("byte[smallOddValue(i)]", (int s) -> {
+                return fill(s * BUFFER_REPS,
+                            i -> (byte)(i % 7 == 0 ? -3 : (i % 3 == 0 ? -1 : 1)));
+            }),
             withToString("byte[cornerCaseValue(i)]", (int s) -> {
                 return fill(s * BUFFER_REPS,
                             i -> cornerCaseValue(i));
diff --git a/test/jdk/jdk/incubator/vector/ByteVector512Tests.java b/test/jdk/jdk/incubator/vector/ByteVector512Tests.java
index 094f3bbebdc..45038c53824 100644
--- a/test/jdk/jdk/incubator/vector/ByteVector512Tests.java
+++ b/test/jdk/jdk/incubator/vector/ByteVector512Tests.java
@@ -1114,6 +1114,10 @@ public class ByteVector512Tests extends AbstractVectorTest {
                 return fill(s * BUFFER_REPS,
                             i -> (((byte)(i + 1) == 0) ? 1 : (byte)(i + 1)));
             }),
+            withToString("byte[smallOddValue(i)]", (int s) -> {
+                return fill(s * BUFFER_REPS,
+                            i -> (byte)(i % 7 == 0 ? -3 : (i % 3 == 0 ? -1 : 1)));
+            }),
             withToString("byte[cornerCaseValue(i)]", (int s) -> {
                 return fill(s * BUFFER_REPS,
                             i -> cornerCaseValue(i));
diff --git a/test/jdk/jdk/incubator/vector/ByteVector64Tests.java b/test/jdk/jdk/incubator/vector/ByteVector64Tests.java
index e8ff81678cd..b350d0a8ee0 100644
--- a/test/jdk/jdk/incubator/vector/ByteVector64Tests.java
+++ b/test/jdk/jdk/incubator/vector/ByteVector64Tests.java
@@ -1114,6 +1114,10 @@ public class ByteVector64Tests extends AbstractVectorTest {
                 return fill(s * BUFFER_REPS,
                             i -> (((byte)(i + 1) == 0) ? 1 : (byte)(i + 1)));
             }),
+            withToString("byte[smallOddValue(i)]", (int s) -> {
+                return fill(s * BUFFER_REPS,
+                            i -> (byte)(i % 7 == 0 ? -3 : (i % 3 == 0 ? -1 : 1)));
+            }),
             withToString("byte[cornerCaseValue(i)]", (int s) -> {
                 return fill(s * BUFFER_REPS,
                             i -> cornerCaseValue(i));
diff --git a/test/jdk/jdk/incubator/vector/ByteVectorMaxTests.java b/test/jdk/jdk/incubator/vector/ByteVectorMaxTests.java
index c53710c3fdd..ba2307f15b1 100644
--- a/test/jdk/jdk/incubator/vector/ByteVectorMaxTests.java
+++ b/test/jdk/jdk/incubator/vector/ByteVectorMaxTests.java
@@ -1120,6 +1120,10 @@ public class ByteVectorMaxTests extends AbstractVectorTest {
                 return fill(s * BUFFER_REPS,
                             i -> (((byte)(i + 1) == 0) ? 1 : (byte)(i + 1)));
             }),
+            withToString("byte[smallOddValue(i)]", (int s) -> {
+                return fill(s * BUFFER_REPS,
+                            i -> (byte)(i % 7 == 0 ? -3 : (i % 3 == 0 ? -1 : 1)));
+            }),
             withToString("byte[cornerCaseValue(i)]", (int s) -> {
                 return fill(s * BUFFER_REPS,
                             i -> cornerCaseValue(i));
diff --git a/test/jdk/jdk/incubator/vector/DoubleVector128Tests.java b/test/jdk/jdk/incubator/vector/DoubleVector128Tests.java
index 1457e5a51ca..7bec91b698b 100644
--- a/test/jdk/jdk/incubator/vector/DoubleVector128Tests.java
+++ b/test/jdk/jdk/incubator/vector/DoubleVector128Tests.java
@@ -1239,6 +1239,10 @@ relativeError));
                 return fill(s * BUFFER_REPS,
                             i -> (((double)(i + 1) == 0) ? 1 : (double)(i + 1)));
             }),
+            withToString("double[smallOddValue(i)]", (int s) -> {
+                return fill(s * BUFFER_REPS,
+                            i -> (double)(i % 7 == 0 ? -3 : (i % 3 == 0 ? -1 : 1)));
+            }),
             withToString("double[0.01 + (i / (i + 1))]", (int s) -> {
                 return fill(s * BUFFER_REPS,
                             i -> (double)0.01 + ((double)i / (i + 1)));
diff --git a/test/jdk/jdk/incubator/vector/DoubleVector256Tests.java b/test/jdk/jdk/incubator/vector/DoubleVector256Tests.java
index e417abe52e6..3da554e67e5 100644
--- a/test/jdk/jdk/incubator/vector/DoubleVector256Tests.java
+++ b/test/jdk/jdk/incubator/vector/DoubleVector256Tests.java
@@ -1239,6 +1239,10 @@ relativeError));
                 return fill(s * BUFFER_REPS,
                             i -> (((double)(i + 1) == 0) ? 1 : (double)(i + 1)));
             }),
+            withToString("double[smallOddValue(i)]", (int s) -> {
+                return fill(s * BUFFER_REPS,
+                            i -> (double)(i % 7 == 0 ? -3 : (i % 3 == 0 ? -1 : 1)));
+            }),
             withToString("double[0.01 + (i / (i + 1))]", (int s) -> {
                 return fill(s * BUFFER_REPS,
                             i -> (double)0.01 + ((double)i / (i + 1)));
diff --git a/test/jdk/jdk/incubator/vector/DoubleVector512Tests.java b/test/jdk/jdk/incubator/vector/DoubleVector512Tests.java
index d23b2bf1511..6c060714da8 100644
--- a/test/jdk/jdk/incubator/vector/DoubleVector512Tests.java
+++ b/test/jdk/jdk/incubator/vector/DoubleVector512Tests.java
@@ -1239,6 +1239,10 @@ relativeError));
                 return fill(s * BUFFER_REPS,
                             i -> (((double)(i + 1) == 0) ? 1 : (double)(i + 1)));
             }),
+            withToString("double[smallOddValue(i)]", (int s) -> {
+                return fill(s * BUFFER_REPS,
+                            i -> (double)(i % 7 == 0 ? -3 : (i % 3 == 0 ? -1 : 1)));
+            }),
             withToString("double[0.01 + (i / (i + 1))]", (int s) -> {
                 return fill(s * BUFFER_REPS,
                             i -> (double)0.01 + ((double)i / (i + 1)));
diff --git a/test/jdk/jdk/incubator/vector/DoubleVector64Tests.java b/test/jdk/jdk/incubator/vector/DoubleVector64Tests.java
index d2aff0b7ea5..9e34cbc3a31 100644
--- a/test/jdk/jdk/incubator/vector/DoubleVector64Tests.java
+++ b/test/jdk/jdk/incubator/vector/DoubleVector64Tests.java
@@ -1239,6 +1239,10 @@ relativeError));
                 return fill(s * BUFFER_REPS,
                             i -> (((double)(i + 1) == 0) ? 1 : (double)(i + 1)));
             }),
+            withToString("double[smallOddValue(i)]", (int s) -> {
+                return fill(s * BUFFER_REPS,
+                            i -> (double)(i % 7 == 0 ? -3 : (i % 3 == 0 ? -1 : 1)));
+            }),
             withToString("double[0.01 + (i / (i + 1))]", (int s) -> {
                 return fill(s * BUFFER_REPS,
                             i -> (double)0.01 + ((double)i / (i + 1)));
diff --git a/test/jdk/jdk/incubator/vector/DoubleVectorMaxTests.java b/test/jdk/jdk/incubator/vector/DoubleVectorMaxTests.java
index 2684ae2d0c6..74be9b42a8b 100644
--- a/test/jdk/jdk/incubator/vector/DoubleVectorMaxTests.java
+++ b/test/jdk/jdk/incubator/vector/DoubleVectorMaxTests.java
@@ -1245,6 +1245,10 @@ relativeError));
                 return fill(s * BUFFER_REPS,
                             i -> (((double)(i + 1) == 0) ? 1 : (double)(i + 1)));
             }),
+            withToString("double[smallOddValue(i)]", (int s) -> {
+                return fill(s * BUFFER_REPS,
+                            i -> (double)(i % 7 == 0 ? -3 : (i % 3 == 0 ? -1 : 1)));
+            }),
             withToString("double[0.01 + (i / (i + 1))]", (int s) -> {
                 return fill(s * BUFFER_REPS,
                             i -> (double)0.01 + ((double)i / (i + 1)));
diff --git a/test/jdk/jdk/incubator/vector/FloatVector128Tests.java b/test/jdk/jdk/incubator/vector/FloatVector128Tests.java
index 151ea17a886..eb4b686d41f 100644
--- a/test/jdk/jdk/incubator/vector/FloatVector128Tests.java
+++ b/test/jdk/jdk/incubator/vector/FloatVector128Tests.java
@@ -1256,6 +1256,10 @@ relativeError));
                 return fill(s * BUFFER_REPS,
                             i -> (((float)(i + 1) == 0) ? 1 : (float)(i + 1)));
             }),
+            withToString("float[smallOddValue(i)]", (int s) -> {
+                return fill(s * BUFFER_REPS,
+                            i -> (float)(i % 7 == 0 ? -3 : (i % 3 == 0 ? -1 : 1)));
+            }),
             withToString("float[0.01 + (i / (i + 1))]", (int s) -> {
                 return fill(s * BUFFER_REPS,
                             i -> (float)0.01 + ((float)i / (i + 1)));
diff --git a/test/jdk/jdk/incubator/vector/FloatVector256Tests.java b/test/jdk/jdk/incubator/vector/FloatVector256Tests.java
index 5315b69a5b6..f00bf19d383 100644
--- a/test/jdk/jdk/incubator/vector/FloatVector256Tests.java
+++ b/test/jdk/jdk/incubator/vector/FloatVector256Tests.java
@@ -1256,6 +1256,10 @@ relativeError));
                 return fill(s * BUFFER_REPS,
                             i -> (((float)(i + 1) == 0) ? 1 : (float)(i + 1)));
             }),
+            withToString("float[smallOddValue(i)]", (int s) -> {
+                return fill(s * BUFFER_REPS,
+                            i -> (float)(i % 7 == 0 ? -3 : (i % 3 == 0 ? -1 : 1)));
+            }),
             withToString("float[0.01 + (i / (i + 1))]", (int s) -> {
                 return fill(s * BUFFER_REPS,
                             i -> (float)0.01 + ((float)i / (i + 1)));
diff --git a/test/jdk/jdk/incubator/vector/FloatVector512Tests.java b/test/jdk/jdk/incubator/vector/FloatVector512Tests.java
index 6a958511439..573bcc59c63 100644
--- a/test/jdk/jdk/incubator/vector/FloatVector512Tests.java
+++ b/test/jdk/jdk/incubator/vector/FloatVector512Tests.java
@@ -1256,6 +1256,10 @@ relativeError));
                 return fill(s * BUFFER_REPS,
                             i -> (((float)(i + 1) == 0) ? 1 : (float)(i + 1)));
             }),
+            withToString("float[smallOddValue(i)]", (int s) -> {
+                return fill(s * BUFFER_REPS,
+                            i -> (float)(i % 7 == 0 ? -3 : (i % 3 == 0 ? -1 : 1)));
+            }),
             withToString("float[0.01 + (i / (i + 1))]", (int s) -> {
                 return fill(s * BUFFER_REPS,
                             i -> (float)0.01 + ((float)i / (i + 1)));
diff --git a/test/jdk/jdk/incubator/vector/FloatVector64Tests.java b/test/jdk/jdk/incubator/vector/FloatVector64Tests.java
index b06dff18194..8244ffabb51 100644
--- a/test/jdk/jdk/incubator/vector/FloatVector64Tests.java
+++ b/test/jdk/jdk/incubator/vector/FloatVector64Tests.java
@@ -1256,6 +1256,10 @@ relativeError));
                 return fill(s * BUFFER_REPS,
                             i -> (((float)(i + 1) == 0) ? 1 : (float)(i + 1)));
             }),
+            withToString("float[smallOddValue(i)]", (int s) -> {
+                return fill(s * BUFFER_REPS,
+                            i -> (float)(i % 7 == 0 ? -3 : (i % 3 == 0 ? -1 : 1)));
+            }),
             withToString("float[0.01 + (i / (i + 1))]", (int s) -> {
                 return fill(s * BUFFER_REPS,
                             i -> (float)0.01 + ((float)i / (i + 1)));
diff --git a/test/jdk/jdk/incubator/vector/FloatVectorMaxTests.java b/test/jdk/jdk/incubator/vector/FloatVectorMaxTests.java
index 9b84e852c1c..30c470e05f4 100644
--- a/test/jdk/jdk/incubator/vector/FloatVectorMaxTests.java
+++ b/test/jdk/jdk/incubator/vector/FloatVectorMaxTests.java
@@ -1262,6 +1262,10 @@ relativeError));
                 return fill(s * BUFFER_REPS,
                             i -> (((float)(i + 1) == 0) ? 1 : (float)(i + 1)));
             }),
+            withToString("float[smallOddValue(i)]", (int s) -> {
+                return fill(s * BUFFER_REPS,
+                            i -> (float)(i % 7 == 0 ? -3 : (i % 3 == 0 ? -1 : 1)));
+            }),
             withToString("float[0.01 + (i / (i + 1))]", (int s) -> {
                 return fill(s * BUFFER_REPS,
                             i -> (float)0.01 + ((float)i / (i + 1)));
diff --git a/test/jdk/jdk/incubator/vector/IntVector128Tests.java b/test/jdk/jdk/incubator/vector/IntVector128Tests.java
index d62f5d8df00..2b36a2802eb 100644
--- a/test/jdk/jdk/incubator/vector/IntVector128Tests.java
+++ b/test/jdk/jdk/incubator/vector/IntVector128Tests.java
@@ -1104,6 +1104,10 @@ public class IntVector128Tests extends AbstractVectorTest {
                 return fill(s * BUFFER_REPS,
                             i -> (((int)(i + 1) == 0) ? 1 : (int)(i + 1)));
             }),
+            withToString("int[smallOddValue(i)]", (int s) -> {
+                return fill(s * BUFFER_REPS,
+                            i -> (int)(i % 7 == 0 ? -3 : (i % 3 == 0 ? -1 : 1)));
+            }),
             withToString("int[cornerCaseValue(i)]", (int s) -> {
                 return fill(s * BUFFER_REPS,
                             i -> cornerCaseValue(i));
diff --git a/test/jdk/jdk/incubator/vector/IntVector256Tests.java b/test/jdk/jdk/incubator/vector/IntVector256Tests.java
index bb2d1d717f4..9d4632b88dd 100644
--- a/test/jdk/jdk/incubator/vector/IntVector256Tests.java
+++ b/test/jdk/jdk/incubator/vector/IntVector256Tests.java
@@ -1104,6 +1104,10 @@ public class IntVector256Tests extends AbstractVectorTest {
                 return fill(s * BUFFER_REPS,
                             i -> (((int)(i + 1) == 0) ? 1 : (int)(i + 1)));
             }),
+            withToString("int[smallOddValue(i)]", (int s) -> {
+                return fill(s * BUFFER_REPS,
+                            i -> (int)(i % 7 == 0 ? -3 : (i % 3 == 0 ? -1 : 1)));
+            }),
             withToString("int[cornerCaseValue(i)]", (int s) -> {
                 return fill(s * BUFFER_REPS,
                             i -> cornerCaseValue(i));
diff --git a/test/jdk/jdk/incubator/vector/IntVector512Tests.java b/test/jdk/jdk/incubator/vector/IntVector512Tests.java
index 5ceba4e88ec..aa3c3eccf5b 100644
--- a/test/jdk/jdk/incubator/vector/IntVector512Tests.java
+++ b/test/jdk/jdk/incubator/vector/IntVector512Tests.java
@@ -1104,6 +1104,10 @@ public class IntVector512Tests extends AbstractVectorTest {
                 return fill(s * BUFFER_REPS,
                             i -> (((int)(i + 1) == 0) ? 1 : (int)(i + 1)));
             }),
+            withToString("int[smallOddValue(i)]", (int s) -> {
+                return fill(s * BUFFER_REPS,
+                            i -> (int)(i % 7 == 0 ? -3 : (i % 3 == 0 ? -1 : 1)));
+            }),
             withToString("int[cornerCaseValue(i)]", (int s) -> {
                 return fill(s * BUFFER_REPS,
                             i -> cornerCaseValue(i));
diff --git a/test/jdk/jdk/incubator/vector/IntVector64Tests.java b/test/jdk/jdk/incubator/vector/IntVector64Tests.java
index 9d3849a2c04..89247f9f932 100644
--- a/test/jdk/jdk/incubator/vector/IntVector64Tests.java
+++ b/test/jdk/jdk/incubator/vector/IntVector64Tests.java
@@ -1104,6 +1104,10 @@ public class IntVector64Tests extends AbstractVectorTest {
                 return fill(s * BUFFER_REPS,
                             i -> (((int)(i + 1) == 0) ? 1 : (int)(i + 1)));
             }),
+            withToString("int[smallOddValue(i)]", (int s) -> {
+                return fill(s * BUFFER_REPS,
+                            i -> (int)(i % 7 == 0 ? -3 : (i % 3 == 0 ? -1 : 1)));
+            }),
             withToString("int[cornerCaseValue(i)]", (int s) -> {
                 return fill(s * BUFFER_REPS,
                             i -> cornerCaseValue(i));
diff --git a/test/jdk/jdk/incubator/vector/IntVectorMaxTests.java b/test/jdk/jdk/incubator/vector/IntVectorMaxTests.java
index 6c671a81bf1..3272dbbb3de 100644
--- a/test/jdk/jdk/incubator/vector/IntVectorMaxTests.java
+++ b/test/jdk/jdk/incubator/vector/IntVectorMaxTests.java
@@ -1110,6 +1110,10 @@ public class IntVectorMaxTests extends AbstractVectorTest {
                 return fill(s * BUFFER_REPS,
                             i -> (((int)(i + 1) == 0) ? 1 : (int)(i + 1)));
             }),
+            withToString("int[smallOddValue(i)]", (int s) -> {
+                return fill(s * BUFFER_REPS,
+                            i -> (int)(i % 7 == 0 ? -3 : (i % 3 == 0 ? -1 : 1)));
+            }),
             withToString("int[cornerCaseValue(i)]", (int s) -> {
                 return fill(s * BUFFER_REPS,
                             i -> cornerCaseValue(i));
diff --git a/test/jdk/jdk/incubator/vector/LongVector128Tests.java b/test/jdk/jdk/incubator/vector/LongVector128Tests.java
index 49e2e1a0078..30f1ecc2bf4 100644
--- a/test/jdk/jdk/incubator/vector/LongVector128Tests.java
+++ b/test/jdk/jdk/incubator/vector/LongVector128Tests.java
@@ -1088,6 +1088,10 @@ public class LongVector128Tests extends AbstractVectorTest {
                 return fill(s * BUFFER_REPS,
                             i -> (((long)(i + 1) == 0) ? 1 : (long)(i + 1)));
             }),
+            withToString("long[smallOddValue(i)]", (int s) -> {
+                return fill(s * BUFFER_REPS,
+                            i -> (long)(i % 7 == 0 ? -3 : (i % 3 == 0 ? -1 : 1)));
+            }),
             withToString("long[cornerCaseValue(i)]", (int s) -> {
                 return fill(s * BUFFER_REPS,
                             i -> cornerCaseValue(i));
diff --git a/test/jdk/jdk/incubator/vector/LongVector256Tests.java b/test/jdk/jdk/incubator/vector/LongVector256Tests.java
index 84c8da4e800..6dd2f359742 100644
--- a/test/jdk/jdk/incubator/vector/LongVector256Tests.java
+++ b/test/jdk/jdk/incubator/vector/LongVector256Tests.java
@@ -1088,6 +1088,10 @@ public class LongVector256Tests extends AbstractVectorTest {
                 return fill(s * BUFFER_REPS,
                             i -> (((long)(i + 1) == 0) ? 1 : (long)(i + 1)));
             }),
+            withToString("long[smallOddValue(i)]", (int s) -> {
+                return fill(s * BUFFER_REPS,
+                            i -> (long)(i % 7 == 0 ? -3 : (i % 3 == 0 ? -1 : 1)));
+            }),
             withToString("long[cornerCaseValue(i)]", (int s) -> {
                 return fill(s * BUFFER_REPS,
                             i -> cornerCaseValue(i));
diff --git a/test/jdk/jdk/incubator/vector/LongVector512Tests.java b/test/jdk/jdk/incubator/vector/LongVector512Tests.java
index 00d8c4b010a..6347a1b53a2 100644
--- a/test/jdk/jdk/incubator/vector/LongVector512Tests.java
+++ b/test/jdk/jdk/incubator/vector/LongVector512Tests.java
@@ -1088,6 +1088,10 @@ public class LongVector512Tests extends AbstractVectorTest {
                 return fill(s * BUFFER_REPS,
                             i -> (((long)(i + 1) == 0) ? 1 : (long)(i + 1)));
             }),
+            withToString("long[smallOddValue(i)]", (int s) -> {
+                return fill(s * BUFFER_REPS,
+                            i -> (long)(i % 7 == 0 ? -3 : (i % 3 == 0 ? -1 : 1)));
+            }),
             withToString("long[cornerCaseValue(i)]", (int s) -> {
                 return fill(s * BUFFER_REPS,
                             i -> cornerCaseValue(i));
diff --git a/test/jdk/jdk/incubator/vector/LongVector64Tests.java b/test/jdk/jdk/incubator/vector/LongVector64Tests.java
index d4cdfe54ad2..0518c17b75f 100644
--- a/test/jdk/jdk/incubator/vector/LongVector64Tests.java
+++ b/test/jdk/jdk/incubator/vector/LongVector64Tests.java
@@ -1088,6 +1088,10 @@ public class LongVector64Tests extends AbstractVectorTest {
                 return fill(s * BUFFER_REPS,
                             i -> (((long)(i + 1) == 0) ? 1 : (long)(i + 1)));
             }),
+            withToString("long[smallOddValue(i)]", (int s) -> {
+                return fill(s * BUFFER_REPS,
+                            i -> (long)(i % 7 == 0 ? -3 : (i % 3 == 0 ? -1 : 1)));
+            }),
             withToString("long[cornerCaseValue(i)]", (int s) -> {
                 return fill(s * BUFFER_REPS,
                             i -> cornerCaseValue(i));
diff --git a/test/jdk/jdk/incubator/vector/LongVectorMaxTests.java b/test/jdk/jdk/incubator/vector/LongVectorMaxTests.java
index 597169b00f5..f5ab956b5a7 100644
--- a/test/jdk/jdk/incubator/vector/LongVectorMaxTests.java
+++ b/test/jdk/jdk/incubator/vector/LongVectorMaxTests.java
@@ -1094,6 +1094,10 @@ public class LongVectorMaxTests extends AbstractVectorTest {
                 return fill(s * BUFFER_REPS,
                             i -> (((long)(i + 1) == 0) ? 1 : (long)(i + 1)));
             }),
+            withToString("long[smallOddValue(i)]", (int s) -> {
+                return fill(s * BUFFER_REPS,
+                            i -> (long)(i % 7 == 0 ? -3 : (i % 3 == 0 ? -1 : 1)));
+            }),
             withToString("long[cornerCaseValue(i)]", (int s) -> {
                 return fill(s * BUFFER_REPS,
                             i -> cornerCaseValue(i));
diff --git a/test/jdk/jdk/incubator/vector/ShortVector128Tests.java b/test/jdk/jdk/incubator/vector/ShortVector128Tests.java
index 85e7d715182..40de51c90ab 100644
--- a/test/jdk/jdk/incubator/vector/ShortVector128Tests.java
+++ b/test/jdk/jdk/incubator/vector/ShortVector128Tests.java
@@ -1104,6 +1104,10 @@ public class ShortVector128Tests extends AbstractVectorTest {
                 return fill(s * BUFFER_REPS,
                             i -> (((short)(i + 1) == 0) ? 1 : (short)(i + 1)));
             }),
+            withToString("short[smallOddValue(i)]", (int s) -> {
+                return fill(s * BUFFER_REPS,
+                            i -> (short)(i % 7 == 0 ? -3 : (i % 3 == 0 ? -1 : 1)));
+            }),
             withToString("short[cornerCaseValue(i)]", (int s) -> {
                 return fill(s * BUFFER_REPS,
                             i -> cornerCaseValue(i));
diff --git a/test/jdk/jdk/incubator/vector/ShortVector256Tests.java b/test/jdk/jdk/incubator/vector/ShortVector256Tests.java
index df379b64e3a..c28dd34c8ef 100644
--- a/test/jdk/jdk/incubator/vector/ShortVector256Tests.java
+++ b/test/jdk/jdk/incubator/vector/ShortVector256Tests.java
@@ -1104,6 +1104,10 @@ public class ShortVector256Tests extends AbstractVectorTest {
                 return fill(s * BUFFER_REPS,
                             i -> (((short)(i + 1) == 0) ? 1 : (short)(i + 1)));
             }),
+            withToString("short[smallOddValue(i)]", (int s) -> {
+                return fill(s * BUFFER_REPS,
+                            i -> (short)(i % 7 == 0 ? -3 : (i % 3 == 0 ? -1 : 1)));
+            }),
             withToString("short[cornerCaseValue(i)]", (int s) -> {
                 return fill(s * BUFFER_REPS,
                             i -> cornerCaseValue(i));
diff --git a/test/jdk/jdk/incubator/vector/ShortVector512Tests.java b/test/jdk/jdk/incubator/vector/ShortVector512Tests.java
index ae5804c3688..703ef7d358b 100644
--- a/test/jdk/jdk/incubator/vector/ShortVector512Tests.java
+++ b/test/jdk/jdk/incubator/vector/ShortVector512Tests.java
@@ -1104,6 +1104,10 @@ public class ShortVector512Tests extends AbstractVectorTest {
                 return fill(s * BUFFER_REPS,
                             i -> (((short)(i + 1) == 0) ? 1 : (short)(i + 1)));
             }),
+            withToString("short[smallOddValue(i)]", (int s) -> {
+                return fill(s * BUFFER_REPS,
+                            i -> (short)(i % 7 == 0 ? -3 : (i % 3 == 0 ? -1 : 1)));
+            }),
             withToString("short[cornerCaseValue(i)]", (int s) -> {
                 return fill(s * BUFFER_REPS,
                             i -> cornerCaseValue(i));
diff --git a/test/jdk/jdk/incubator/vector/ShortVector64Tests.java b/test/jdk/jdk/incubator/vector/ShortVector64Tests.java
index 5f84682f02f..ea6846498a3 100644
--- a/test/jdk/jdk/incubator/vector/ShortVector64Tests.java
+++ b/test/jdk/jdk/incubator/vector/ShortVector64Tests.java
@@ -1104,6 +1104,10 @@ public class ShortVector64Tests extends AbstractVectorTest {
                 return fill(s * BUFFER_REPS,
                             i -> (((short)(i + 1) == 0) ? 1 : (short)(i + 1)));
             }),
+            withToString("short[smallOddValue(i)]", (int s) -> {
+                return fill(s * BUFFER_REPS,
+                            i -> (short)(i % 7 == 0 ? -3 : (i % 3 == 0 ? -1 : 1)));
+            }),
             withToString("short[cornerCaseValue(i)]", (int s) -> {
                 return fill(s * BUFFER_REPS,
                             i -> cornerCaseValue(i));
diff --git a/test/jdk/jdk/incubator/vector/ShortVectorMaxTests.java b/test/jdk/jdk/incubator/vector/ShortVectorMaxTests.java
index 5451ad6c50e..6a85da12054 100644
--- a/test/jdk/jdk/incubator/vector/ShortVectorMaxTests.java
+++ b/test/jdk/jdk/incubator/vector/ShortVectorMaxTests.java
@@ -1110,6 +1110,10 @@ public class ShortVectorMaxTests extends AbstractVectorTest {
                 return fill(s * BUFFER_REPS,
                             i -> (((short)(i + 1) == 0) ? 1 : (short)(i + 1)));
             }),
+            withToString("short[smallOddValue(i)]", (int s) -> {
+                return fill(s * BUFFER_REPS,
+                            i -> (short)(i % 7 == 0 ? -3 : (i % 3 == 0 ? -1 : 1)));
+            }),
             withToString("short[cornerCaseValue(i)]", (int s) -> {
                 return fill(s * BUFFER_REPS,
                             i -> cornerCaseValue(i));
diff --git a/test/jdk/jdk/incubator/vector/templates/Unit-header.template b/test/jdk/jdk/incubator/vector/templates/Unit-header.template
index e1434dccb2b..b87012a2181 100644
--- a/test/jdk/jdk/incubator/vector/templates/Unit-header.template
+++ b/test/jdk/jdk/incubator/vector/templates/Unit-header.template
@@ -1375,6 +1375,10 @@ relativeError));
                 return fill(s * BUFFER_REPS,
                             i -> ((($type$)(i + 1) == 0) ? 1 : ($type$)(i + 1)));
             }),
+            withToString("$type$[smallOddValue(i)]", (int s) -> {
+                return fill(s * BUFFER_REPS,
+                            i -> ($type$)(i % 7 == 0 ? -3 : (i % 3 == 0 ? -1 : 1)));
+            }),
 #if[FP]
             withToString("$type$[0.01 + (i / (i + 1))]", (int s) -> {
                 return fill(s * BUFFER_REPS,

From 4a335f878c87b75a111252fafa80dbb96c52259a Mon Sep 17 00:00:00 2001
From: Alan Bateman <alanb@openjdk.org>
Date: Tue, 31 Mar 2026 06:56:56 +0000
Subject: [PATCH 426/655] 8381002: Thread dump should convert longs to json
 numbers if possible

Reviewed-by: kevinw, amenkov, sspitsyn, lmesnik
---
 .../classes/jdk/internal/vm/ThreadDumper.java |  69 ++++--
 .../doc-files/threadDump.schema.json          |  36 ++--
 .../crypto/provider/Cipher/HPKE/KAT9180.java  |  14 +-
 .../DumpThreadsFormat1.java                   |  97 +++++++++
 test/jdk/jdk/jfr/tool/TestPrintJSON.java      |   9 +-
 .../security/provider/acvp/ML_DSA_Test.java   |  28 +--
 .../security/provider/acvp/ML_KEM_Test.java   |  18 +-
 .../sun/security/provider/acvp/SHA_Test.java  |  26 +--
 test/lib/jdk/test/lib/json/JSONValue.java     | 197 ++++++++++++------
 .../jdk/test/lib/threaddump/ThreadDump.java   |  62 +++---
 10 files changed, 373 insertions(+), 183 deletions(-)
 create mode 100644 test/jdk/com/sun/management/HotSpotDiagnosticMXBean/DumpThreadsFormat1.java

diff --git a/src/java.base/share/classes/jdk/internal/vm/ThreadDumper.java b/src/java.base/share/classes/jdk/internal/vm/ThreadDumper.java
index 276c379a564..fa7d4bab076 100644
--- a/src/java.base/share/classes/jdk/internal/vm/ThreadDumper.java
+++ b/src/java.base/share/classes/jdk/internal/vm/ThreadDumper.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2020, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -250,18 +250,43 @@ public class ThreadDumper {
         }
     }
 
+    /**
+     * JSON is schema-less and the thread dump format will evolve over time.
+     * {@code HotSpotDiagnosticMXBean.dumpThreads} links to a JSON file that documents
+     * the latest/current format. A system property can be used to generate the thread
+     * dump in older formats if necessary.
+     */
+    private static class JsonFormat {
+        private static final String JSON_FORMAT_VERSION_PROP =
+                "com.sun.management.HotSpotDiagnosticMXBean.dumpThreads.format";
+        static final int JSON_FORMAT_V1 = 1;
+        static final int JSON_FORMAT_V2 = 2;
+        private static final int JSON_FORMAT_LATEST = JSON_FORMAT_V2;
+        private static final int JSON_FORMAT;
+        static {
+            int ver = Integer.getInteger(JSON_FORMAT_VERSION_PROP, JSON_FORMAT_LATEST);
+            JSON_FORMAT = Math.clamp(ver, JSON_FORMAT_V1, JSON_FORMAT_LATEST);
+        }
+
+        static int formatVersion() {
+            return JSON_FORMAT;
+        }
+    }
+
     /**
      * Generate a thread dump to the given text stream in JSON format.
      * @throws UncheckedIOException if an I/O error occurs
      */
     private static void dumpThreadsToJson(TextWriter textWriter) {
-        var jsonWriter = new JsonWriter(textWriter);
-
+        int format = JsonFormat.formatVersion();
+        var jsonWriter = new JsonWriter(textWriter, (format == JsonFormat.JSON_FORMAT_V1));
         jsonWriter.startObject();  // top-level object
-
         jsonWriter.startObject("threadDump");
+        if (format > JsonFormat.JSON_FORMAT_V1) {
+            jsonWriter.writeProperty("formatVersion", format);
+        }
 
-        jsonWriter.writeProperty("processId", processId());
+        jsonWriter.writeLongProperty("processId", processId());
         jsonWriter.writeProperty("time", Instant.now());
         jsonWriter.writeProperty("runtimeVersion", Runtime.version());
 
@@ -284,7 +309,11 @@ public class ThreadDumper {
         jsonWriter.writeProperty("parent", container.parent());
 
         Thread owner = container.owner();
-        jsonWriter.writeProperty("owner", (owner != null) ? owner.threadId() : null);
+        if (owner != null) {
+            jsonWriter.writeLongProperty("owner", owner.threadId());
+        } else {
+            jsonWriter.writeProperty("owner", null);  // owner is not optional
+        }
 
         long threadCount = 0;
         jsonWriter.startArray("threads");
@@ -301,7 +330,7 @@ public class ThreadDumper {
         if (!ThreadContainers.trackAllThreads()) {
             threadCount = Long.max(threadCount, container.threadCount());
         }
-        jsonWriter.writeProperty("threadCount", threadCount);
+        jsonWriter.writeLongProperty("threadCount", threadCount);
 
         jsonWriter.endObject();
 
@@ -324,7 +353,7 @@ public class ThreadDumper {
         StackTraceElement[] stackTrace = snapshot.stackTrace();
 
         jsonWriter.startObject();
-        jsonWriter.writeProperty("tid", thread.threadId());
+        jsonWriter.writeLongProperty("tid", thread.threadId());
         jsonWriter.writeProperty("time", now);
         if (thread.isVirtual()) {
             jsonWriter.writeProperty("virtual", Boolean.TRUE);
@@ -339,7 +368,7 @@ public class ThreadDumper {
             jsonWriter.startObject("parkBlocker");
             jsonWriter.writeProperty("object", Objects.toIdentityString(parkBlocker));
             if (snapshot.parkBlockerOwner() instanceof Thread owner) {
-                jsonWriter.writeProperty("owner", owner.threadId());
+                jsonWriter.writeLongProperty("owner", owner.threadId());
             }
             jsonWriter.endObject();
         }
@@ -380,7 +409,7 @@ public class ThreadDumper {
 
         // thread identifier of carrier, when mounted
         if (thread.isVirtual() && snapshot.carrierThread() instanceof Thread carrier) {
-            jsonWriter.writeProperty("carrier", carrier.threadId());
+            jsonWriter.writeLongProperty("carrier", carrier.threadId());
         }
 
         jsonWriter.endObject();
@@ -411,10 +440,12 @@ public class ThreadDumper {
             }
         }
         private final Deque<Node> stack = new ArrayDeque<>();
+        private final boolean generateLongsAsString;
         private final TextWriter writer;
 
-        JsonWriter(TextWriter writer) {
+        JsonWriter(TextWriter writer, boolean generateLongsAsString) {
             this.writer = writer;
+            this.generateLongsAsString = generateLongsAsString;
         }
 
         private void indent() {
@@ -461,6 +492,7 @@ public class ThreadDumper {
          */
         void writeProperty(String name, Object obj) {
             Node node = stack.peek();
+            assert node != null;
             if (node.getAndIncrementPropertyCount() > 0) {
                 writer.println(",");
             }
@@ -469,8 +501,6 @@ public class ThreadDumper {
                 writer.print("\"" + name + "\": ");
             }
             switch (obj) {
-                // Long may be larger than safe range of JSON integer value
-                case Long   _  -> writer.print("\"" + obj + "\"");
                 case Number _  -> writer.print(obj);
                 case Boolean _ -> writer.print(obj);
                 case null      -> writer.print("null");
@@ -478,6 +508,19 @@ public class ThreadDumper {
             }
         }
 
+        /**
+         * Write a property with a long value. If the value is outside the "interop"
+         * range of IEEE-754 double-precision floating point (64-bit) then it is
+         * written as a string.
+         */
+        void writeLongProperty(String name, long value) {
+            if (generateLongsAsString || value < -0x1FFFFFFFFFFFFFL || value > 0x1FFFFFFFFFFFFFL) {
+                writeProperty(name, Long.toString(value));
+            } else {
+                writeProperty(name, value);
+            }
+        }
+
         /**
          * Write an unnamed property.
          */
diff --git a/src/jdk.management/share/classes/com/sun/management/doc-files/threadDump.schema.json b/src/jdk.management/share/classes/com/sun/management/doc-files/threadDump.schema.json
index 1da3e3941ef..30161b0bb74 100644
--- a/src/jdk.management/share/classes/com/sun/management/doc-files/threadDump.schema.json
+++ b/src/jdk.management/share/classes/com/sun/management/doc-files/threadDump.schema.json
@@ -4,8 +4,12 @@
     "threadDump": {
       "type": "object",
       "properties": {
+        "formatVersion": {
+          "type": "integer",
+          "description": "Format version (2)."
+        },
         "processId": {
-          "type": "string",
+          "type": "integer",
           "description": "The native process id of the Java virtual machine."
         },
         "time": {
@@ -28,18 +32,12 @@
                   "description": "The container name. The container name is unique."
                 },
                 "parent": {
-                  "type": [
-                    "string",
-                    "null"
-                  ],
+                  "type": [ "string", "null" ],
                   "description": "The parent container name or null for the root container."
                 },
                 "owner": {
-                  "type": [
-                    "string",
-                    "null"
-                  ],
-                  "description": "The thread identifier of the owner thread if owned."
+                  "type": [ "integer", "null" ],
+                  "description": "The thread identifier of the owner thread or null if no owner."
                 },
                 "threads": {
                   "type": "array",
@@ -49,7 +47,7 @@
                       "type": "object",
                       "properties": {
                         "tid": {
-                          "type": "string",
+                          "type": "integer",
                           "description": "The thread identifier."
                         },
                         "time": {
@@ -69,9 +67,7 @@
                           "description": "true for a virtual thread."
                         },
                         "parkBlocker": {
-                          "type": [
-                            "object"
-                          ],
+                          "type": "object",
                           "properties": {
                             "object": {
                               "type": "string",
@@ -79,7 +75,7 @@
                             }
                           },
                           "owner": {
-                            "type": "string",
+                            "type": "integer",
                             "description": "The thread identifier of the owner when the parkBlocker is an AbstractOwnableSynchronizer."
                           },
                           "required": [
@@ -117,10 +113,7 @@
                               "locks": {
                                 "type": "array",
                                 "items": {
-                                  "type": [
-                                    "string",
-                                    "null"
-                                  ],
+                                  "type": [ "string", "null" ],
                                   "description": "The object for which the monitor is owned by the thread, null if eliminated."
                                 }
                               }
@@ -132,7 +125,7 @@
                           }
                         },
                         "carrier":  {
-                          "type": "string",
+                          "type": "integer",
                           "description": "The thread identifier of the carrier thread if mounted."
                         }
                       },
@@ -147,7 +140,7 @@
                   ]
                 },
                 "threadCount": {
-                  "type": "string",
+                  "type": "integer",
                   "description": "The number of threads in the thread container."
                 }
               },
@@ -162,6 +155,7 @@
         }
       },
       "required": [
+        "formatVersion",
         "processId",
         "time",
         "runtimeVersion",
diff --git a/test/jdk/com/sun/crypto/provider/Cipher/HPKE/KAT9180.java b/test/jdk/com/sun/crypto/provider/Cipher/HPKE/KAT9180.java
index 024d5f977a7..9b6fad6a90d 100644
--- a/test/jdk/com/sun/crypto/provider/Cipher/HPKE/KAT9180.java
+++ b/test/jdk/com/sun/crypto/provider/Cipher/HPKE/KAT9180.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2025, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -82,12 +82,12 @@ public class KAT9180 {
         var c1 = Cipher.getInstance("HPKE");
         var c2 = Cipher.getInstance("HPKE");
         var ts = JSONValue.parse(new String(Files.readAllBytes(archivePath), StandardCharsets.UTF_8));
-        for (var tg : ts.asArray()) {
-            var mode = Integer.parseInt(tg.get("mode").asString());
+        for (var tg : ts.elements()) {
+            var mode = tg.get("mode").asInt();
             System.err.print('I');
-            var kem_id = Integer.parseInt(tg.get("kem_id").asString());
-            var kdf_id = Integer.parseInt(tg.get("kdf_id").asString());
-            var aead_id = Integer.parseInt(tg.get("aead_id").asString());
+            var kem_id = tg.get("kem_id").asInt();
+            var kdf_id = tg.get("kdf_id").asInt();
+            var aead_id = tg.get("aead_id").asInt();
             var ikmR = h.parseHex(tg.get("ikmR").asString());
             var ikmE = h.parseHex(tg.get("ikmE").asString());
             var info = h.parseHex(tg.get("info").asString());
@@ -117,7 +117,7 @@ public class KAT9180 {
             if (enc != null) {
                 System.err.print('e');
                 var count = 0;
-                for (var p : enc.asArray()) {
+                for (var p : enc.elements()) {
                     var aad = h.parseHex(p.get("aad").asString());
                     var pt = h.parseHex(p.get("pt").asString());
                     var ct = h.parseHex(p.get("ct").asString());
diff --git a/test/jdk/com/sun/management/HotSpotDiagnosticMXBean/DumpThreadsFormat1.java b/test/jdk/com/sun/management/HotSpotDiagnosticMXBean/DumpThreadsFormat1.java
new file mode 100644
index 00000000000..5bc9ae2918f
--- /dev/null
+++ b/test/jdk/com/sun/management/HotSpotDiagnosticMXBean/DumpThreadsFormat1.java
@@ -0,0 +1,97 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+/*
+ * @test
+ * @bug 8381169
+ * @summary Basic com.sun.management.HotSpotDiagnosticMXBean.dumpThreads generating a
+ *    format version 1 thread dump
+ * @modules jdk.management
+ * @library /test/lib
+ * @run junit/othervm -Dcom.sun.management.HotSpotDiagnosticMXBean.dumpThreads.format=1 ${test.main.class}
+ */
+
+import java.lang.management.ManagementFactory;
+import java.nio.file.Files;
+import java.nio.file.FileAlreadyExistsException;
+import java.nio.file.Path;
+import java.util.List;
+import com.sun.management.HotSpotDiagnosticMXBean;
+import com.sun.management.HotSpotDiagnosticMXBean.ThreadDumpFormat;
+import jdk.test.lib.json.JSONValue;
+
+import org.junit.jupiter.api.Test;
+import org.junit.jupiter.api.BeforeAll;
+import static org.junit.jupiter.api.Assertions.*;
+
+class DumpThreadsFormat1 {
+    private static JSONValue threadDumpObj;
+
+    @BeforeAll
+    static void generateThreadDump() throws Exception {
+        Path dir = Path.of(".").toAbsolutePath();
+        Path file = Files.createTempFile(dir, "dump", ".json");
+        Files.delete(file);
+        var mbean = ManagementFactory.getPlatformMXBean(HotSpotDiagnosticMXBean.class);
+        mbean.dumpThreads(file.toString(), HotSpotDiagnosticMXBean.ThreadDumpFormat.JSON);
+        System.err.format("Dumped to %s%n", file.getFileName());
+        String json = Files.readString(file);
+        threadDumpObj = JSONValue.parse(json).get("threadDump");
+    }
+
+    /**
+     * Test that "formatVersion" is not present.
+     */
+    @Test
+    void testFormatVersion() {
+        threadDumpObj.getOrAbsent("formatVersion")
+                .ifPresent(_ -> { fail("formatVersion not expected"); });
+    }
+
+    /**
+     * Test "processId" is a string.
+     */
+    @Test
+    void testProcessId() {
+        String processId = "" + ProcessHandle.current().pid();
+        assertEquals(processId, threadDumpObj.get("processId").asString());
+    }
+
+    /**
+     * Test "tid" for current thread in root container is a string.
+     */
+    @Test
+    void testThreadId() throws Exception {
+        JSONValue rootContainerObj = threadDumpObj.get("threadContainers").element(0);
+        String name = rootContainerObj.get("container").asString();
+        assertEquals("<root>", name);
+
+        String tid = "" + Thread.currentThread().threadId();
+        boolean found = rootContainerObj.get("threads")
+                .elements()
+                .stream()
+                .map(t -> t.get("tid").asString())
+                .anyMatch(tid::equals);
+        assertTrue(found, "Current thread not found");
+    }
+}
diff --git a/test/jdk/jdk/jfr/tool/TestPrintJSON.java b/test/jdk/jdk/jfr/tool/TestPrintJSON.java
index 3d79c75300f..2abbff68338 100644
--- a/test/jdk/jdk/jfr/tool/TestPrintJSON.java
+++ b/test/jdk/jdk/jfr/tool/TestPrintJSON.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2016, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2016, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -28,6 +28,7 @@ import java.time.OffsetDateTime;
 import java.util.Collections;
 import java.util.Iterator;
 import java.util.List;
+import java.util.Map;
 
 import jdk.jfr.Timespan;
 import jdk.jfr.Timestamp;
@@ -62,7 +63,7 @@ public class TestPrintJSON {
 
         JSONValue o = JSONValue.parse(json);
         JSONValue recording = o.get("recording");
-        JSONArray jsonEvents = recording.get("events").asArray();
+        List<JSONValue> jsonEvents = recording.get("events").elements();
         List<RecordedEvent> events = RecordingFile.readAllEvents(recordingFile);
         Collections.sort(events, new EndTicksComparator());
         // Verify events are equal
@@ -79,7 +80,7 @@ public class TestPrintJSON {
     private static void assertEquals(Object jsonObject, Object jfrObject) throws Exception {
         // Check object
         if (jfrObject instanceof RecordedObject) {
-            JSONValue values = ((JSONValue) jsonObject).get("values");
+            Map<String, JSONValue> values = ((JSONValue) jsonObject).get("values").members();
             RecordedObject recObject = (RecordedObject) jfrObject;
             Asserts.assertEquals(values.size(), recObject.getFields().size());
             for (ValueDescriptor v : recObject.getFields()) {
@@ -102,7 +103,7 @@ public class TestPrintJSON {
         // Check array
         if (jfrObject != null && jfrObject.getClass().isArray()) {
             Object[] jfrArray = (Object[]) jfrObject;
-            JSONArray jsArray = ((JSONArray) jsonObject);
+            List<JSONValue> jsArray = ((JSONValue) jsonObject).elements();
             for (int i = 0; i < jfrArray.length; i++) {
                 assertEquals(jsArray.get(i), jfrArray[i]);
             }
diff --git a/test/jdk/sun/security/provider/acvp/ML_DSA_Test.java b/test/jdk/sun/security/provider/acvp/ML_DSA_Test.java
index f76f3d8b9a8..29b760e5d84 100644
--- a/test/jdk/sun/security/provider/acvp/ML_DSA_Test.java
+++ b/test/jdk/sun/security/provider/acvp/ML_DSA_Test.java
@@ -63,12 +63,12 @@ public class ML_DSA_Test {
         var f = p == null
                 ? KeyFactory.getInstance("ML-DSA")
                 : KeyFactory.getInstance("ML-DSA", p);
-        for (var t : kat.get("testGroups").asArray()) {
+        for (var t : kat.get("testGroups").elements()) {
             var pname = t.get("parameterSet").asString();
             var np = genParams(pname);
             System.out.println(">> " + pname);
-            for (var c : t.get("tests").asArray()) {
-                System.out.print(c.get("tcId").asString() + " ");
+            for (var c : t.get("tests").elements()) {
+                System.out.print(c.get("tcId").asInt() + " ");
                 var seed = toByteArray(c.get("seed").asString());
                 g.initialize(np, new FixedSecureRandom(seed));
                 var kp = g.generateKeyPair();
@@ -85,7 +85,7 @@ public class ML_DSA_Test {
         var s = p == null
                 ? Signature.getInstance("ML-DSA")
                 : Signature.getInstance("ML-DSA", p);
-        for (var t : kat.get("testGroups").asArray()) {
+        for (var t : kat.get("testGroups").elements()) {
             var pname = t.get("parameterSet").asString();
             System.out.println(">> " + pname + " sign");
             var det = t.get("deterministic").asBoolean();
@@ -97,14 +97,15 @@ public class ML_DSA_Test {
             if (t.get("externalMu").asBoolean()) {
                 continue; // Not supported
             }
-            for (var c : t.get("tests").asArray()) {
-                var cstr = c.get("context");
-                var ctxt = cstr == null ? new byte[0] : toByteArray(cstr.asString());
+            for (var c : t.get("tests").elements()) {
+                var ctxt =  c.getOrAbsent("context")
+                        .map(v -> toByteArray(v.asString()))
+                        .orElse(new byte[0]);
                 var hashAlg = c.get("hashAlg").asString();
                 if (!hashAlg.equals("none") || ctxt.length != 0) {
                     continue; // Not supported
                 }
-                System.out.print(Integer.parseInt(c.get("tcId").asString()) + " ");
+                System.out.print(c.get("tcId").asInt() + " ");
                 var sk = new PrivateKey() {
                     public String getAlgorithm() { return pname; }
                     public String getFormat() { return "RAW"; }
@@ -129,7 +130,7 @@ public class ML_DSA_Test {
         var s = p == null
                 ? Signature.getInstance("ML-DSA")
                 : Signature.getInstance("ML-DSA", p);
-        for (var t : kat.get("testGroups").asArray()) {
+        for (var t : kat.get("testGroups").elements()) {
             var pname = t.get("parameterSet").asString();
             System.out.println(">> " + pname + " verify");
 
@@ -143,14 +144,15 @@ public class ML_DSA_Test {
                 continue; // Not supported
             }
 
-            for (var c : t.get("tests").asArray()) {
-                var cstr = c.get("context");
-                var ctxt = cstr == null ? new byte[0] : toByteArray(cstr.asString());
+            for (var c : t.get("tests").elements()) {
+                var ctxt =  c.getOrAbsent("context")
+                        .map(v -> toByteArray(v.asString()))
+                        .orElse(new byte[0]);
                 var hashAlg = c.get("hashAlg").asString();
                 if (!hashAlg.equals("none") || ctxt.length != 0) {
                     continue; // Not supported
                 }
-                System.out.print(c.get("tcId").asString() + " ");
+                System.out.print(c.get("tcId").asInt() + " ");
                 var pk = new PublicKey() {
                     public String getAlgorithm() { return pname; }
                     public String getFormat() { return "RAW"; }
diff --git a/test/jdk/sun/security/provider/acvp/ML_KEM_Test.java b/test/jdk/sun/security/provider/acvp/ML_KEM_Test.java
index 35c1ce611da..5d969bc90ed 100644
--- a/test/jdk/sun/security/provider/acvp/ML_KEM_Test.java
+++ b/test/jdk/sun/security/provider/acvp/ML_KEM_Test.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2024, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2024, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -61,12 +61,12 @@ public class ML_KEM_Test {
         var f = p == null
                 ? KeyFactory.getInstance("ML-KEM")
                 : KeyFactory.getInstance("ML-KEM", p);
-        for (var t : kat.get("testGroups").asArray()) {
+        for (var t : kat.get("testGroups").elements()) {
             var pname = t.get("parameterSet").asString();
             var np = genParams(pname);
             System.out.println(">> " + pname);
-            for (var c : t.get("tests").asArray()) {
-                System.out.print(c.get("tcId").asString() + " ");
+            for (var c : t.get("tests").elements()) {
+                System.out.print(c.get("tcId").asInt() + " ");
                 var seed = toByteArray(c.get("d").asString() + c.get("z").asString());
                 g.initialize(np, new FixedSecureRandom(seed));
                 var kp = g.generateKeyPair();
@@ -84,13 +84,13 @@ public class ML_KEM_Test {
         var g = p == null
                 ? KEM.getInstance("ML-KEM")
                 : KEM.getInstance("ML-KEM", p);
-        for (var t : kat.get("testGroups").asArray()) {
+        for (var t : kat.get("testGroups").elements()) {
             var pname = t.get("parameterSet").asString();
             var function = t.get("function").asString();
             System.out.println(">> " + pname + " " + function);
             if (function.equals("encapsulation")) {
-                for (var c : t.get("tests").asArray()) {
-                    System.out.print(c.get("tcId").asString() + " ");
+                for (var c : t.get("tests").elements()) {
+                    System.out.print(c.get("tcId").asInt() + " ");
                     var ek = new PublicKey() {
                         public String getAlgorithm() { return pname; }
                         public String getFormat() { return "RAW"; }
@@ -111,8 +111,8 @@ public class ML_KEM_Test {
                     public String getFormat() { return "RAW"; }
                     public byte[] getEncoded() { return oct(toByteArray(t.get("dk").asString())); }
                 };
-                for (var c : t.get("tests").asArray()) {
-                    System.out.print(c.get("tcId").asString() + " ");
+                for (var c : t.get("tests").elements()) {
+                    System.out.print(c.get("tcId").asInt() + " ");
                     var d = g.newDecapsulator(dk);
                     var k = d.decapsulate(toByteArray(c.get("c").asString()));
                     Asserts.assertEqualsByteArray(toByteArray(c.get("k").asString()), k.getEncoded());
diff --git a/test/jdk/sun/security/provider/acvp/SHA_Test.java b/test/jdk/sun/security/provider/acvp/SHA_Test.java
index 4a64fb00c8c..9f68a583173 100644
--- a/test/jdk/sun/security/provider/acvp/SHA_Test.java
+++ b/test/jdk/sun/security/provider/acvp/SHA_Test.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2024, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -37,14 +37,14 @@ public class SHA_Test {
         if (alg.startsWith("SHA2-")) alg = "SHA-" + alg.substring(5);
         var md = provider == null ? MessageDigest.getInstance(alg)
                 : MessageDigest.getInstance(alg, provider);
-        for (var t : kat.get("testGroups").asArray()) {
+        for (var t : kat.get("testGroups").elements()) {
             var testType = t.get("testType").asString();
             switch (testType) {
                 case "AFT" -> {
-                    for (var c : t.get("tests").asArray()) {
-                        System.out.print(c.get("tcId").asString() + " ");
+                    for (var c : t.get("tests").elements()) {
+                        System.out.print(c.get("tcId").asInt() + " ");
                         var msg = toByteArray(c.get("msg").asString());
-                        var len = Integer.parseInt(c.get("len").asString());
+                        var len = c.get("len").asInt();
                         if (msg.length * 8 == len) {
                             Asserts.assertEqualsByteArray(
                                     toByteArray(c.get("md").asString()), md.digest(msg));
@@ -56,12 +56,12 @@ public class SHA_Test {
                 case "MCT" -> {
                     var mctVersion = t.get("mctVersion").asString();
                     var trunc = mctVersion.equals("alternate");
-                    for (var c : t.get("tests").asArray()) {
-                        System.out.print(c.get("tcId").asString() + " ");
+                    for (var c : t.get("tests").elements()) {
+                        System.out.print(c.get("tcId").asInt() + " ");
                         var SEED = toByteArray(c.get("msg").asString());
-                        var INITIAL_SEED_LENGTH = Integer.parseInt(c.get("len").asString());
+                        var INITIAL_SEED_LENGTH = c.get("len").asInt();
                         if (SEED.length * 8 == INITIAL_SEED_LENGTH) {
-                            for (var r : c.get("resultsArray").asArray()) {
+                            for (var r : c.get("resultsArray").elements()) {
                                 if (alg.startsWith("SHA3-")) {
                                     var MD = SEED;
                                     for (var i = 0; i < 1000; i++) {
@@ -99,12 +99,12 @@ public class SHA_Test {
                     }
                 }
                 case "LDT" -> {
-                    for (var c : t.get("tests").asArray()) {
-                        System.out.print(c.get("tcId").asString() + " ");
+                    for (var c : t.get("tests").elements()) {
+                        System.out.print(c.get("tcId").asInt() + " ");
                         var lm = c.get("largeMsg");
                         var ct = toByteArray(lm.get("content").asString());
-                        var flen = Long.parseLong(lm.get("fullLength").asString());
-                        var clen = Long.parseLong(lm.get("contentLength").asString());
+                        var flen = lm.get("fullLength").asLong();
+                        var clen = lm.get("contentLength").asLong();
                         var cc = 0L;
                         while (cc < flen) {
                             md.update(ct);
diff --git a/test/lib/jdk/test/lib/json/JSONValue.java b/test/lib/jdk/test/lib/json/JSONValue.java
index 72ed2fd917c..3ac6441b4c0 100644
--- a/test/lib/jdk/test/lib/json/JSONValue.java
+++ b/test/lib/jdk/test/lib/json/JSONValue.java
@@ -25,47 +25,55 @@ package jdk.test.lib.json;
 import java.math.BigInteger;
 import java.util.ArrayList;
 import java.util.HashMap;
-import java.util.Iterator;
 import java.util.List;
 import java.util.Map;
+import java.util.NoSuchElementException;
+import java.util.Objects;
 import java.util.Optional;
 
-public interface JSONValue {
+public sealed interface JSONValue
+        permits JSONValue.JSONObject, JSONValue.JSONArray, JSONValue.JSONString,
+                JSONValue.JSONNumber, JSONValue.JSONBoolean, JSONValue.JSONNull {
 
     public final class JSONObject implements JSONValue {
-        private final Map<String, JSONValue> value;
+        private final Map<String, JSONValue> members;
 
-        public JSONObject(Map<String, JSONValue> value) {
-            this.value = value;
+        private JSONObject(Map<String, ? extends JSONValue> members) {
+            this.members = Map.copyOf(members);
         }
 
         @Override
-        public JSONObject asObject() {
-            return this;
-        }
-
-        public JSONValue get(String k) {
-            return value.get(k);
+        public JSONValue get(String name) {
+            JSONValue v = members.get(name);
+            if (v == null) {
+                throw new NoSuchElementException("member " + name + " does not exist");
+            }
+            return v;
         }
 
         @Override
-        public int size() {
-            return value.size();
+        public Optional<JSONValue> getOrAbsent(String name) {
+            return Optional.ofNullable(members.get(name));
+        }
+
+        @Override
+        public Map<String, JSONValue> members() {
+            return members;
         }
 
         @Override
         public String toString() {
             var builder = new StringBuilder();
             builder.append("{");
-            for (var key : value.keySet()) {
+            for (String key : members.keySet()) {
                 builder.append("\"");
                 builder.append(key);
                 builder.append("\":");
-                builder.append(value.get(key).toString());
+                builder.append(members.get(key).toString());
                 builder.append(",");
             }
 
-            var end = builder.length() - 1;
+            int end = builder.length() - 1;
             if (builder.charAt(end) == ',') {
                 builder.deleteCharAt(end);
             }
@@ -73,13 +81,17 @@ public interface JSONValue {
             builder.append("}");
             return builder.toString();
         }
+
+        public static JSONObject of(Map<String, ? extends JSONValue> members) {
+            return new JSONObject(members);
+        }
     }
 
     public final class JSONString implements JSONValue {
         private final String value;
 
-        public JSONString(String value) {
-            this.value = value;
+        private JSONString(String value) {
+            this.value = Objects.requireNonNull(value);
         }
 
         @Override
@@ -129,26 +141,17 @@ public interface JSONValue {
             builder.append("\"");
             return builder.toString();
         }
+
+        public static JSONString of(String value) {
+            return new JSONString(value);
+        }
     }
 
-    public final class JSONArray implements JSONValue, Iterable<JSONValue> {
-        private final List<JSONValue> values;
+    public final class JSONArray implements JSONValue {
+        private final List<JSONValue> elements;
 
-        public JSONArray(List<JSONValue> array) {
-            this.values = array;
-        }
-
-        @Override
-        public JSONArray asArray() {
-            return this;
-        }
-
-        public JSONValue get(int i) {
-            return values.get(i);
-        }
-
-        public int size() {
-            return values.size();
+        JSONArray(List<? extends JSONValue> elements) {
+            this.elements = List.copyOf(elements);
         }
 
         @Override
@@ -156,9 +159,10 @@ public interface JSONValue {
             var builder = new StringBuilder();
 
             builder.append("[");
-            for (var i = 0; i < size(); i++) {
-                builder.append(get(i).toString());
-                if (i != (size() - 1)) {
+            int size = elements.size();
+            for (int i = 0; i < size; i++) {
+                builder.append(elements.get(i).toString());
+                if (i != (size - 1)) {
                     builder.append(",");
                 }
             }
@@ -167,13 +171,61 @@ public interface JSONValue {
         }
 
         @Override
-        public Iterator<JSONValue> iterator() {
-            return values.iterator();
+        public List<JSONValue> elements() {
+            return elements;
         }
 
         @Override
-        public List<JSONValue> elements() {
-            return List.copyOf(values);
+        public JSONValue element(int index) {
+            return elements.get(index);
+        }
+
+        public static JSONArray of(List<? extends JSONValue> elements) {
+            return new JSONArray(elements);
+        }
+    }
+
+    public final class JSONNumber implements JSONValue {
+        private final String value;
+
+        private JSONNumber(String value) {
+            this.value = Objects.requireNonNull(value);
+        }
+
+        @Override
+        public int asInt() {
+            return Integer.parseInt(value);
+        }
+
+        @Override
+        public long asLong() {
+            return Long.parseLong(value);
+        }
+
+        @Override
+        public double asDouble() {
+            return Double.parseDouble(value);
+        }
+
+        @Override
+        public String toString() {
+            return value;
+        }
+
+        public static JSONNumber of(String value) {
+            return new JSONNumber(value);
+        }
+
+        public static JSONNumber of(int value) {
+            return of(String.valueOf(value));
+        }
+
+        public static JSONNumber of(long value) {
+            return of(String.valueOf(value));
+        }
+
+        public static JSONNumber of(double value) {
+            return of(String.valueOf(value));
         }
     }
 
@@ -367,11 +419,10 @@ public interface JSONValue {
             var value = builder.toString();
             if (isInteger) {
                 new BigInteger(value);
-                return new JSONString(value);
             } else {
                 Double.parseDouble(value);
-                return new JSONString(value);
             }
+            return JSONNumber.of(value);
         }
 
         private JSONString parseString() {
@@ -422,7 +473,7 @@ public interface JSONValue {
             }
 
             advance(); // step beyond closing "
-            return new JSONString(builder.toString());
+            return JSONString.of(builder.toString());
         }
 
         private JSONArray parseArray() {
@@ -445,7 +496,7 @@ public interface JSONValue {
             }
 
             advance(); // step beyond closing ']'
-            return new JSONArray(list);
+            return JSONArray.of(list);
         }
 
         public JSONNull parseNull() {
@@ -486,7 +537,7 @@ public interface JSONValue {
             }
 
             advance(); // step beyond '}'
-            return new JSONObject(map);
+            return JSONObject.of(map);
         }
 
         private boolean isDigit(char c) {
@@ -574,43 +625,51 @@ public interface JSONValue {
         }
     }
 
-    public static JSONValue parse(String s) {
+    static JSONValue parse(String s) {
         return new JSONParser().parse(s);
     }
 
-    default int size() {
-        throw new UnsupportedOperationException("Size operation unsupported");
+    default JSONValue get(String name) {
+        throw new UnsupportedOperationException("Unsupported conversion to object");
+    }
+
+    default Optional<JSONValue> getOrAbsent(String name) {
+        throw new UnsupportedOperationException("Unsupported conversion to object");
+    }
+
+    default Optional<JSONValue> valueOrNull() {
+        return Optional.of(this);
+    }
+
+    default Map<String, JSONValue> members() {
+        throw new UnsupportedOperationException("Unsupported conversion to object");
     }
 
     default List<JSONValue> elements() {
         throw new UnsupportedOperationException("Unsupported conversion to array");
     }
 
-    default String asString() {
-        throw new UnsupportedOperationException("Unsupported conversion to String");
-    }
-
-    default JSONArray asArray() {
+    default JSONValue element(int index) {
         throw new UnsupportedOperationException("Unsupported conversion to array");
     }
 
-    default JSONObject asObject() {
-        throw new UnsupportedOperationException("Unsupported conversion to object");
+    default String asString() {
+        throw new UnsupportedOperationException("Unsupported conversion to string");
+    }
+
+    default int asInt() {
+        throw new UnsupportedOperationException("Unsupported conversion to number");
+    }
+
+    default long asLong() {
+        throw new UnsupportedOperationException("Unsupported conversion to number");
+    }
+
+    default double asDouble() {
+        throw new UnsupportedOperationException("Unsupported conversion to number");
     }
 
     default boolean asBoolean() {
         throw new UnsupportedOperationException("Unsupported conversion to boolean");
     }
-
-    default JSONValue get(String field) {
-        return asObject().get(field);
-    }
-
-    default Optional<JSONValue> getOrAbsent(String field) {
-        return Optional.ofNullable(get(field));
-    }
-
-    default Optional<JSONValue> valueOrNull() {
-        return Optional.of(this);
-    }
 }
diff --git a/test/lib/jdk/test/lib/threaddump/ThreadDump.java b/test/lib/jdk/test/lib/threaddump/ThreadDump.java
index 972d46675f4..77dd3dd8c03 100644
--- a/test/lib/jdk/test/lib/threaddump/ThreadDump.java
+++ b/test/lib/jdk/test/lib/threaddump/ThreadDump.java
@@ -50,9 +50,10 @@ import jdk.test.lib.json.JSONValue;
  * <pre>{@code
  * {
  *   "threadDump": {
- *     "processId": "63406",
- *     "time": "2022-05-20T07:37:16.308017Z",
- *     "runtimeVersion": "19",
+ *     "formatVersion": 2,
+ *     "processId": 63406,
+ *     "time": "2026-03-25T09:20:08.591503Z",
+ *     "runtimeVersion": "27",
  *     "threadContainers": [
  *       {
  *         "container": "<root>",
@@ -60,12 +61,12 @@ import jdk.test.lib.json.JSONValue;
  *         "owner": null,
  *         "threads": [
  *          {
- *            "tid": "1",
+ *            "tid": 1,
  *            "name": "main",
  *            "stack": [...]
  *          },
  *          {
- *            "tid": "8",
+ *            "tid": 8,
  *            "name": "Reference Handler",
  *            "state": "RUNNABLE",
  *            "stack": [
@@ -80,21 +81,21 @@ import jdk.test.lib.json.JSONValue;
  *          {"name": "Monitor Ctrl-Break"...},
  *          {"name": "Notification Thread"...}
  *         ],
- *         "threadCount": "7"
+ *         "threadCount": 7
  *       },
  *       {
  *         "container": "ForkJoinPool.commonPool\/jdk.internal.vm.SharedThreadContainer@56aac163",
  *         "parent": "<root>",
  *         "owner": null,
  *         "threads": [...],
- *         "threadCount": "1"
+ *         "threadCount": 1
  *       },
  *       {
  *         "container": "java.util.concurrent.ThreadPoolExecutor@20322d26\/jdk.internal.vm.SharedThreadContainer@184f6be2",
  *         "parent": "<root>",
  *         "owner": null,
  *         "threads": [...],
- *         "threadCount": "1"
+ *         "threadCount": 1
  *       }
  *     ]
  *   }
@@ -131,20 +132,6 @@ public final class ThreadDump {
         this.threadDumpObj = threadDumpObj;
     }
 
-    /**
-     * Assert that a JSONValue is a JSONString and parse the string as an int.
-     */
-    private static int parseStringAsInt(JSONValue valueObj) {
-        return Integer.parseInt(valueObj.asString());
-    }
-
-    /**
-     * Assert that a JSONValue is a JSONString and parse the string as a long.
-     */
-    private static long parseStringAsLong(JSONValue valueObj) {
-        return Long.parseLong(valueObj.asString());
-    }
-
     /**
      * Represents an element in the threadDump/threadContainers array.
      */
@@ -178,9 +165,9 @@ public final class ThreadDump {
          * Return the thread identifier of the owner or empty OptionalLong if not owned.
          */
         public OptionalLong owner() {
-            return containerObj.get("owner")  // string or null
+            return containerObj.get("owner")  // number or null
                     .valueOrNull()
-                    .map(v -> OptionalLong.of(parseStringAsLong(v)))
+                    .map(v -> OptionalLong.of(v.asLong()))
                     .orElse(OptionalLong.empty());
         }
 
@@ -245,7 +232,7 @@ public final class ThreadDump {
         private final JSONValue threadObj;
 
         ThreadInfo(JSONValue threadObj) {
-            this.tid = parseStringAsLong(threadObj.get("tid"));
+            this.tid = threadObj.get("tid").asLong();
             this.threadObj = threadObj;
         }
 
@@ -293,7 +280,7 @@ public final class ThreadDump {
          */
         public OptionalLong parkBlockerOwner() {
             return threadObj.getOrAbsent("parkBlocker")
-                    .map(v -> OptionalLong.of(parseStringAsLong(v.get("owner"))))
+                    .map(v -> OptionalLong.of(v.get("owner").asLong()))
                     .orElse(OptionalLong.empty());
         }
 
@@ -334,7 +321,7 @@ public final class ThreadDump {
                     .map(JSONValue::elements)
                     .orElse(List.of())
                     .forEach(e -> {
-                        int depth = parseStringAsInt(e.get("depth"));
+                        int depth = e.get("depth").asInt();
                         List<String> locks = e.get("locks")
                                 .elements()
                                 .stream()
@@ -354,7 +341,7 @@ public final class ThreadDump {
          */
         public OptionalLong carrier() {
             return threadObj.getOrAbsent("carrier")
-                    .map(s -> OptionalLong.of(parseStringAsLong(s)))
+                    .map(v -> OptionalLong.of(v.asLong()))
                     .orElse(OptionalLong.empty());
         }
 
@@ -389,8 +376,7 @@ public final class ThreadDump {
      * Returns the value of threadDump/processId.
      */
     public long processId() {
-        return parseStringAsLong(threadDumpObj.get("processId"));
-    }
+        return threadDumpObj.get("processId").asLong(); }
 
     /**
      * Returns the value of threadDump/time.
@@ -436,6 +422,10 @@ public final class ThreadDump {
      */
     public static ThreadDump parse(String json) {
         JSONValue threadDumpObj = JSONValue.parse(json).get("threadDump");
+        int formatVersion = threadDumpObj.get("formatVersion").asInt();
+        if (formatVersion != 2) {
+            fail("Format " + formatVersion + " not supported");
+        }
 
         // threadContainers array, preserve insertion order (parents are added before children)
         Map<String, JSONValue> containerObjs = threadDumpObj.get("threadContainers")
@@ -444,7 +434,7 @@ public final class ThreadDump {
                 .collect(Collectors.toMap(
                         c -> c.get("container").asString(),
                         Function.identity(),
-                        (a, b) -> { throw new RuntimeException("Duplicate container"); },
+                        (a, b) -> { fail("Duplicate container"); return null; },
                         LinkedHashMap::new
                 ));
 
@@ -456,7 +446,7 @@ public final class ThreadDump {
             JSONValue parentObj = containerObj.get("parent");
             if (parentObj instanceof JSONValue.JSONNull) {
                 if (root != null) {
-                    throw new RuntimeException("More than one root container");
+                    fail("More than one root container");
                 }
                 root = new ThreadContainer(name, null, containerObj);
                 map.put(name, root);
@@ -464,7 +454,7 @@ public final class ThreadDump {
                 String parentName = parentObj.asString();
                 ThreadContainer parent = map.get(parentName);
                 if (parent == null) {
-                    throw new RuntimeException("Thread container " + name + " found before " + parentName);
+                    fail("Thread container " + name + " found before " + parentName);
                 }
                 var container = new ThreadContainer(name, parent, containerObj);
                 parent.addChild(container);
@@ -472,9 +462,13 @@ public final class ThreadDump {
             }
         }
         if (root == null) {
-            throw new RuntimeException("No root container");
+            fail("No root container");
         }
 
         return new ThreadDump(root, map, threadDumpObj);
     }
+
+    private static void fail(String message) {
+        throw new RuntimeException(message);
+    }
 }

From e582a3cb002868d27c48bcf029a01cc7733d0edb Mon Sep 17 00:00:00 2001
From: Martin Doerr <mdoerr@openjdk.org>
Date: Tue, 31 Mar 2026 09:08:39 +0000
Subject: [PATCH 427/655] 8381315:
 compiler/vectorapi/TestVectorReallocation.java fails with -XX:UseAVX=1 after
 JDK-8380565

Reviewed-by: chagedorn, rrich
---
 test/hotspot/jtreg/ProblemList.txt                            | 1 -
 .../jtreg/compiler/vectorapi/TestVectorReallocation.java      | 4 ++--
 2 files changed, 2 insertions(+), 3 deletions(-)

diff --git a/test/hotspot/jtreg/ProblemList.txt b/test/hotspot/jtreg/ProblemList.txt
index 7580ce4d165..3b871d9f4b6 100644
--- a/test/hotspot/jtreg/ProblemList.txt
+++ b/test/hotspot/jtreg/ProblemList.txt
@@ -56,7 +56,6 @@ compiler/c2/irTests/TestDuplicateBackedge.java 8318904 generic-all
 
 compiler/codecache/jmx/PoolsIndependenceTest.java 8264632 macosx-all
 
-compiler/vectorapi/TestVectorReallocation.java 8381315 generic-x64
 compiler/vectorapi/reshape/TestVectorReinterpret.java 8320897,8348519 aix-ppc64,linux-ppc64le,linux-s390x
 compiler/vectorapi/VectorRebracket128Test.java 8330538 generic-all
 
diff --git a/test/hotspot/jtreg/compiler/vectorapi/TestVectorReallocation.java b/test/hotspot/jtreg/compiler/vectorapi/TestVectorReallocation.java
index 1bdc6ea726d..6b21b693d1e 100644
--- a/test/hotspot/jtreg/compiler/vectorapi/TestVectorReallocation.java
+++ b/test/hotspot/jtreg/compiler/vectorapi/TestVectorReallocation.java
@@ -301,7 +301,7 @@ public class TestVectorReallocation {
     }
 
     @Test
-    @IR(counts = {IRNode.ADD_VF, " >0 "})
+    @IR(counts = {IRNode.ADD_VF, IRNode.VECTOR_SIZE_ANY, " >0 "})
     void floatIdentityWithReallocation() {
         FloatVector v0 = FloatVector.fromArray(F_SPECIES, f_a, 0);
         float zeroSum = 0;
@@ -339,7 +339,7 @@ public class TestVectorReallocation {
     }
 
     @Test
-    @IR(counts = {IRNode.ADD_VD, " >0 "})
+    @IR(counts = {IRNode.ADD_VD, IRNode.VECTOR_SIZE_ANY, " >0 "})
     void doubleIdentityWithReallocation() {
         DoubleVector v0 = DoubleVector.fromArray(D_SPECIES, d_a, 0);
         double zeroSum = 0;

From 6652d69fd551591518a3870691bc44ea597ea936 Mon Sep 17 00:00:00 2001
From: Kerem Kat <krk@openjdk.org>
Date: Tue, 31 Mar 2026 09:45:44 +0000
Subject: [PATCH 428/655] 8374497: C2: assert(verify(phase)) failed: missing
 Value() optimization with -XX:+StressReflectiveCode

Reviewed-by: dfenacci, snatarajan, qamai
---
 src/hotspot/share/opto/subtypenode.cpp        |  3 +-
 .../TestSubTypeCheckStressReflectiveCode.java | 42 +++++++++++++++++++
 2 files changed, 44 insertions(+), 1 deletion(-)
 create mode 100644 test/hotspot/jtreg/compiler/types/TestSubTypeCheckStressReflectiveCode.java

diff --git a/src/hotspot/share/opto/subtypenode.cpp b/src/hotspot/share/opto/subtypenode.cpp
index 69b7058d053..317b839fbd4 100644
--- a/src/hotspot/share/opto/subtypenode.cpp
+++ b/src/hotspot/share/opto/subtypenode.cpp
@@ -1,5 +1,6 @@
 /*
  * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
+ * Copyright Amazon.com Inc. or its affiliates. All Rights Reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -177,7 +178,7 @@ bool SubTypeCheckNode::verify(PhaseGVN* phase) {
       return true;
     }
     const Type* cached_t = Value(phase); // cache the type to validate consistency
-    switch (C->static_subtype_check(superk, subk)) {
+    switch (C->static_subtype_check(superk, subk, false)) {
       case Compile::SSC_easy_test: {
         return verify_helper(phase, load_klass(phase), cached_t);
       }
diff --git a/test/hotspot/jtreg/compiler/types/TestSubTypeCheckStressReflectiveCode.java b/test/hotspot/jtreg/compiler/types/TestSubTypeCheckStressReflectiveCode.java
new file mode 100644
index 00000000000..5814a4a4b39
--- /dev/null
+++ b/test/hotspot/jtreg/compiler/types/TestSubTypeCheckStressReflectiveCode.java
@@ -0,0 +1,42 @@
+/*
+ * Copyright Amazon.com Inc. or its affiliates. All Rights Reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+/**
+ * @test
+ * @bug 8374497
+ * @summary SubTypeCheckNode::verify fails when StressReflectiveCode skips
+ *          static_subtype_check in verify() but not in sub()
+ * @run main/othervm -Xcomp -XX:CompileCommand=compileonly,*TimeZone::*
+ *                   -XX:+IgnoreUnrecognizedVMOptions -XX:+StressReflectiveCode
+ *                   ${test.main.class}
+ */
+
+package compiler.types;
+
+import java.util.TimeZone;
+
+public class TestSubTypeCheckStressReflectiveCode {
+    public static void main(String[] args) {
+        TimeZone.getDefault();
+    }
+}

From 46306d38ed4620480c66b6eded82985bdecb2218 Mon Sep 17 00:00:00 2001
From: Renjith Kannath Pariyangad <rkannathpari@openjdk.org>
Date: Tue, 31 Mar 2026 09:59:15 +0000
Subject: [PATCH 429/655] 8361493: RepaintManager.invalidComponents uses
 different equality when searching element

Co-authored-by: Alexey Ivanov <aivanov@openjdk.org>
Reviewed-by: aivanov, prr, serb, dmarkov
---
 .../classes/javax/swing/RepaintManager.java   |  8 +-
 .../RemoveInvalidComponentTest.java           | 96 +++++++++++++++++++
 2 files changed, 103 insertions(+), 1 deletion(-)
 create mode 100644 test/jdk/javax/swing/RepaintManager/RemoveInvalidComponentTest.java

diff --git a/src/java.desktop/share/classes/javax/swing/RepaintManager.java b/src/java.desktop/share/classes/javax/swing/RepaintManager.java
index b587cf2da84..ab21e555919 100644
--- a/src/java.desktop/share/classes/javax/swing/RepaintManager.java
+++ b/src/java.desktop/share/classes/javax/swing/RepaintManager.java
@@ -379,7 +379,13 @@ public class RepaintManager
             return;
         }
         if (invalidComponents != null) {
-            invalidComponents.remove(component);
+            int n = invalidComponents.size();
+            for (int i = 0; i < n; i++) {
+                if (component == invalidComponents.get(i)) {
+                    invalidComponents.remove(i);
+                    break;
+                }
+            }
         }
     }
 
diff --git a/test/jdk/javax/swing/RepaintManager/RemoveInvalidComponentTest.java b/test/jdk/javax/swing/RepaintManager/RemoveInvalidComponentTest.java
new file mode 100644
index 00000000000..bd40bab4c43
--- /dev/null
+++ b/test/jdk/javax/swing/RepaintManager/RemoveInvalidComponentTest.java
@@ -0,0 +1,96 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+import javax.swing.JFrame;
+import javax.swing.JLabel;
+import javax.swing.RepaintManager;
+import javax.swing.SwingUtilities;
+
+/*
+ * @test
+ * @bug 8361493
+ * @key headful
+ * @summary Verifies that RepaintManager's removeInvalidComponent
+ *          remove wrong component
+ * @run main/othervm RemoveInvalidComponentTest
+ */
+public final class RemoveInvalidComponentTest {
+    private static volatile boolean isValidateCalled;
+
+    private static final class EqualLabel extends JLabel {
+
+        public EqualLabel(String text) {
+            super(text);
+        }
+
+        @Override
+        public void validate() {
+            System.out.println("validate called");
+            isValidateCalled = true;
+            super.validate();
+        }
+
+        @Override
+        public boolean equals(Object obj) {
+            return obj instanceof EqualLabel el
+                   && el.getText().equals(getText());
+        }
+
+        @Override
+        public boolean isValidateRoot() {
+            return true;
+        }
+    }
+
+    private static void runTest() {
+        final RepaintManager repaintManager = new RepaintManager();
+
+        JLabel label1 = new EqualLabel("label");
+        JLabel label2 = new EqualLabel("label");
+
+        if (!label1.equals(label2)) {
+            throw new RuntimeException("label1.equals(label2) returned false");
+        }
+
+        JFrame frame = new JFrame("RemoveInvalidComponentTest");
+
+        frame.add(label1);
+        frame.add(label2);
+
+        frame.setVisible(true);
+
+        repaintManager.addInvalidComponent(label1);
+        repaintManager.removeInvalidComponent(label2);
+        repaintManager.validateInvalidComponents();
+
+        frame.dispose();
+    }
+
+    public static void main(String[] args) throws Exception {
+        SwingUtilities.invokeAndWait(RemoveInvalidComponentTest::runTest);
+
+        if (!isValidateCalled) {
+            throw new RuntimeException("Label1 was removed from repaint manager");
+        }
+    }
+}

From f45b48ba9867984cb0247e378dff5d0c84b9e08a Mon Sep 17 00:00:00 2001
From: David Beaumont <dbeaumont@openjdk.org>
Date: Tue, 31 Mar 2026 10:00:03 +0000
Subject: [PATCH 430/655] 8380307: Refactor miscellaneous JAXP tests in
 javax/xml/jaxp/unittest to JUnit

Reviewed-by: liach, joehw
---
 .../parsers/ptests/FactoryConfErrorTest.java  |   3 -
 .../xml/transform/ptests/TransformTest.java   |   3 -
 .../validation/ptests/SchemaFactoryTest.java  |   4 -
 .../xml/jaxp/unittest/bcel/UtilityTest.java   |   9 +-
 .../catalog/CatalogFileInputTest.java         | 190 ++++++------
 .../unittest/catalog/CatalogResolverTest.java |  51 ++--
 .../unittest/catalog/CatalogReuseTest.java    |  56 ++--
 .../jaxp/unittest/catalog/CatalogSupport.java |  67 +++--
 .../unittest/catalog/CatalogSupport1.java     |  69 ++---
 .../unittest/catalog/CatalogSupport2.java     | 153 +++++-----
 .../unittest/catalog/CatalogSupport3.java     | 151 +++++-----
 .../unittest/catalog/CatalogSupport4.java     |  74 +++--
 .../unittest/catalog/CatalogSupport5.java     | 120 ++++----
 .../unittest/catalog/CatalogSupportBase.java  | 103 +++----
 .../jaxp/unittest/catalog/CatalogTest.java    | 273 +++++++++---------
 .../xml/jaxp/unittest/catalog/GroupTest.java  |  29 +-
 .../jaxp/unittest/datatype/Bug6320118.java    |  30 +-
 .../unittest/datatype/Bug6937951Test.java     |  18 +-
 .../unittest/datatype/Bug6937964Test.java     | 187 +++++-------
 .../unittest/datatype/Bug7042647Test.java     |  18 +-
 .../datatype/DatatypeFactoryTest.java         |  68 ++---
 .../jaxp/unittest/datatype/DurationTest.java  | 262 +++++++----------
 .../unittest/datatype/FactoryFindTest.java    |  38 +--
 .../jaxp/unittest/datatype/HashCodeTest.java  |  53 ++--
 .../unittest/datatype/JDK8068839Test.java     |  13 +-
 .../datatype/XMLGregorianCalendarTest.java    | 111 +++----
 .../unittest/sax/Attributes2ImplTest.java     |  98 +++----
 .../xml/jaxp/unittest/sax/Bug6889654Test.java |  60 +---
 .../xml/jaxp/unittest/sax/Bug6925410Test.java |  35 +--
 .../xml/jaxp/unittest/sax/Bug6949607Test.java |  59 ++--
 .../xml/jaxp/unittest/sax/Bug6992561Test.java |  52 ++--
 .../xml/jaxp/unittest/sax/Bug7057778.xml      |   3 -
 .../xml/jaxp/unittest/sax/Bug7057778Test.java | 178 ++----------
 .../jaxp/unittest/sax/DeclarationTest.java    |  67 ++---
 .../unittest/sax/DefaultHandler2Test.java     | 266 ++++++-----------
 .../jaxp/unittest/sax/IssueTracker56Test.java |  99 ++-----
 .../xml/jaxp/unittest/sax/NSSupportTest.java  |  93 +++---
 .../unittest/sax/SAXExceptionInitCause.java   |  74 ++---
 .../xml/jaxp/unittest/sax/SAXParserTest.java  |  58 ++--
 .../unittest/sax/SymbolTableResetTest.java    |  23 +-
 .../xml/jaxp/unittest/sax/XMLReaderTest.java  |  40 ++-
 .../unittest/sbd/test/ExternalRefTest.java    |  21 +-
 42 files changed, 1457 insertions(+), 1922 deletions(-)
 delete mode 100644 test/jaxp/javax/xml/jaxp/unittest/sax/Bug7057778.xml

diff --git a/test/jaxp/javax/xml/jaxp/functional/javax/xml/parsers/ptests/FactoryConfErrorTest.java b/test/jaxp/javax/xml/jaxp/functional/javax/xml/parsers/ptests/FactoryConfErrorTest.java
index fe4288fc2b1..3ee91ff6555 100644
--- a/test/jaxp/javax/xml/jaxp/functional/javax/xml/parsers/ptests/FactoryConfErrorTest.java
+++ b/test/jaxp/javax/xml/jaxp/functional/javax/xml/parsers/ptests/FactoryConfErrorTest.java
@@ -26,8 +26,6 @@ package javax.xml.parsers.ptests;
 import org.junit.jupiter.api.AfterAll;
 import org.junit.jupiter.api.BeforeAll;
 import org.junit.jupiter.api.Test;
-import org.junit.jupiter.api.parallel.Execution;
-import org.junit.jupiter.api.parallel.ExecutionMode;
 
 import javax.xml.parsers.DocumentBuilderFactory;
 import javax.xml.parsers.FactoryConfigurationError;
@@ -44,7 +42,6 @@ import static org.junit.jupiter.api.Assertions.assertThrows;
  * @library /javax/xml/jaxp/libs
  * @run junit/othervm javax.xml.parsers.ptests.FactoryConfErrorTest
  */
-@Execution(ExecutionMode.SAME_THREAD)
 public class FactoryConfErrorTest {
 
     /**
diff --git a/test/jaxp/javax/xml/jaxp/functional/javax/xml/transform/ptests/TransformTest.java b/test/jaxp/javax/xml/jaxp/functional/javax/xml/transform/ptests/TransformTest.java
index 1d9600b330b..7ca7fc6c6d8 100644
--- a/test/jaxp/javax/xml/jaxp/functional/javax/xml/transform/ptests/TransformTest.java
+++ b/test/jaxp/javax/xml/jaxp/functional/javax/xml/transform/ptests/TransformTest.java
@@ -26,8 +26,6 @@ package javax.xml.transform.ptests;
 import org.junit.jupiter.api.BeforeAll;
 import org.junit.jupiter.api.TestInstance;
 import org.junit.jupiter.api.TestInstance.Lifecycle;
-import org.junit.jupiter.api.parallel.Execution;
-import org.junit.jupiter.api.parallel.ExecutionMode;
 import org.junit.jupiter.params.ParameterizedTest;
 import org.junit.jupiter.params.provider.MethodSource;
 import org.w3c.dom.Document;
@@ -77,7 +75,6 @@ import static javax.xml.transform.ptests.TransformerTestConst.XML_DIR;
  * @summary Tests for variable combination of Transformer.transform(Source, Result)
  */
 @TestInstance(Lifecycle.PER_CLASS)
-@Execution(ExecutionMode.SAME_THREAD)
 public class TransformTest {
 
     /*
diff --git a/test/jaxp/javax/xml/jaxp/functional/javax/xml/validation/ptests/SchemaFactoryTest.java b/test/jaxp/javax/xml/jaxp/functional/javax/xml/validation/ptests/SchemaFactoryTest.java
index dc5acdfe1a3..e7ebdb973f3 100644
--- a/test/jaxp/javax/xml/jaxp/functional/javax/xml/validation/ptests/SchemaFactoryTest.java
+++ b/test/jaxp/javax/xml/jaxp/functional/javax/xml/validation/ptests/SchemaFactoryTest.java
@@ -22,13 +22,10 @@
  */
 package javax.xml.validation.ptests;
 
-import jaxp.library.JAXPDataProvider;
 import org.junit.jupiter.api.BeforeAll;
 import org.junit.jupiter.api.Test;
 import org.junit.jupiter.api.TestInstance;
 import org.junit.jupiter.api.TestInstance.Lifecycle;
-import org.junit.jupiter.api.parallel.Execution;
-import org.junit.jupiter.api.parallel.ExecutionMode;
 import org.junit.jupiter.params.ParameterizedTest;
 import org.junit.jupiter.params.provider.MethodSource;
 import org.w3c.dom.Document;
@@ -78,7 +75,6 @@ import static org.junit.jupiter.api.Assertions.assertTrue;
  * @run junit/othervm javax.xml.validation.ptests.SchemaFactoryTest
  * @summary Class containing the test cases for SchemaFactory
  */
-@Execution(ExecutionMode.SAME_THREAD)
 @TestInstance(Lifecycle.PER_CLASS)
 public class SchemaFactoryTest {
 
diff --git a/test/jaxp/javax/xml/jaxp/unittest/bcel/UtilityTest.java b/test/jaxp/javax/xml/jaxp/unittest/bcel/UtilityTest.java
index 56545698778..020010628cf 100644
--- a/test/jaxp/javax/xml/jaxp/unittest/bcel/UtilityTest.java
+++ b/test/jaxp/javax/xml/jaxp/unittest/bcel/UtilityTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2021, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -24,14 +24,15 @@
 package bcel;
 
 import com.sun.org.apache.bcel.internal.classfile.Utility;
+import org.junit.jupiter.api.Test;
+
 import java.util.Base64;
-import org.testng.annotations.Test;
 
 /*
  * @test
  * @bug 8256919
  * @modules java.xml/com.sun.org.apache.bcel.internal.classfile
- * @run testng bcel.UtilityTest
+ * @run junit bcel.UtilityTest
  * @summary Tests the Utility.
  */
 public class UtilityTest {
@@ -42,7 +43,7 @@ public class UtilityTest {
      */
     @Test
     public void test() throws Exception {
-        /**
+        /*
          * public class Hello {
          *     public void hello(){
          *         System.out.println("Hello,world");
diff --git a/test/jaxp/javax/xml/jaxp/unittest/catalog/CatalogFileInputTest.java b/test/jaxp/javax/xml/jaxp/unittest/catalog/CatalogFileInputTest.java
index 9a19c0237d7..ece63b7e3f1 100644
--- a/test/jaxp/javax/xml/jaxp/unittest/catalog/CatalogFileInputTest.java
+++ b/test/jaxp/javax/xml/jaxp/unittest/catalog/CatalogFileInputTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2017, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2017, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,6 +23,24 @@
 
 package catalog;
 
+import com.sun.net.httpserver.HttpServer;
+import com.sun.net.httpserver.SimpleFileServer;
+import jdk.test.lib.net.URIBuilder;
+import jdk.test.lib.util.JarUtils;
+import org.junit.jupiter.api.AfterAll;
+import org.junit.jupiter.api.BeforeAll;
+import org.junit.jupiter.api.Test;
+import org.junit.jupiter.api.TestInstance;
+import org.junit.jupiter.api.TestInstance.Lifecycle;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
+import org.xml.sax.InputSource;
+
+import javax.xml.catalog.Catalog;
+import javax.xml.catalog.CatalogException;
+import javax.xml.catalog.CatalogFeatures;
+import javax.xml.catalog.CatalogManager;
+import javax.xml.catalog.CatalogResolver;
 import java.io.BufferedOutputStream;
 import java.io.BufferedReader;
 import java.io.BufferedWriter;
@@ -41,32 +59,18 @@ import java.nio.file.Paths;
 import java.util.concurrent.ExecutorService;
 import java.util.concurrent.Executors;
 
-import javax.xml.catalog.Catalog;
-import javax.xml.catalog.CatalogException;
-import javax.xml.catalog.CatalogFeatures;
-import javax.xml.catalog.CatalogManager;
-import javax.xml.catalog.CatalogResolver;
-
 import static java.nio.file.StandardOpenOption.APPEND;
 import static java.nio.file.StandardOpenOption.CREATE;
-import static jaxp.library.JAXPTestUtilities.getSystemProperty;
-
-import com.sun.net.httpserver.HttpServer;
-import com.sun.net.httpserver.SimpleFileServer;
-import jdk.test.lib.net.URIBuilder;
-import jdk.test.lib.util.JarUtils;
-import org.testng.Assert;
-import org.testng.annotations.AfterClass;
-import org.testng.annotations.BeforeClass;
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
-import org.xml.sax.InputSource;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertNotNull;
+import static org.junit.jupiter.api.Assertions.assertNull;
+import static org.junit.jupiter.api.Assertions.assertThrows;
 
 /*
  * @test
  * @bug 8151154 8171243
  * @library /javax/xml/jaxp/libs /javax/xml/jaxp/unittest /test/lib
- * @run testng/othervm catalog.CatalogFileInputTest
+ * @run junit/othervm catalog.CatalogFileInputTest
  * @summary Verifies that the Catalog API accepts valid URIs only;
  *          Verifies that the CatalogFeatures' builder throws
  *          IllegalArgumentException on invalid file inputs.
@@ -74,11 +78,12 @@ import org.xml.sax.InputSource;
  *          JDK-8168968, it has to only run without SecurityManager
  *          because an ACE will be thrown for invalid path.
  */
+@TestInstance(Lifecycle.PER_CLASS)
 public class CatalogFileInputTest extends CatalogSupportBase {
 
     static final CatalogFeatures FEATURES = CatalogFeatures.builder().
             with(CatalogFeatures.Feature.PREFER, "system").build();
-    static String CLS_DIR = getSystemProperty("test.classes");
+    static String CLS_DIR = System.getProperty("test.classes");
     static String SRC_DIR = System.getProperty("test.src");
     static String JAR_CONTENT = "META-INF";
     final static String SCHEME_JARFILE = "jar:";
@@ -91,7 +96,7 @@ public class CatalogFileInputTest extends CatalogSupportBase {
     /*
      * Initializing fields
      */
-    @BeforeClass
+    @BeforeAll
     public void setUpClass() throws Exception {
         super.setUp();
         // set up HttpServer
@@ -107,7 +112,7 @@ public class CatalogFileInputTest extends CatalogSupportBase {
                 .build().toString() + REMOTE_FILE_LOCATION;
     }
 
-    @AfterClass
+    @AfterAll
     protected void tearDown() {
         if (httpserver != null) {
             httpserver.stop(0);
@@ -119,87 +124,86 @@ public class CatalogFileInputTest extends CatalogSupportBase {
      * Verifies that the Catalog can be created with file system paths including JAR
      * and http URL, and used to resolve a systemId as expected.
      */
-    @Test(dataProvider = "acceptedURI")
-    public void testMatch(final String uri, final String sysId, final String pubId,
-            final String expectedId, final String msg) {
+    @ParameterizedTest
+    @MethodSource("acceptedURI")
+    public void testMatch(String uri, String sysId, String pubId, String expectedId, String msg) {
         CatalogResolver cr = CatalogManager.catalogResolver(FEATURES, URI.create(uri));
         InputSource is = cr.resolveEntity(pubId, sysId);
-        Assert.assertNotNull(is, msg);
-        Assert.assertEquals(expectedId, is.getSystemId(), msg);
+        assertNotNull(is, msg);
+        assertEquals(expectedId, is.getSystemId(), msg);
     }
 
-    @Test(dataProvider = "invalidCatalog")
-    public void testEmptyCatalog(final String uri, final String publicId, final String msg) {
+    @ParameterizedTest
+    @MethodSource("invalidCatalog")
+    public void testEmptyCatalog(String uri, String publicId, String msg) {
         Catalog c = CatalogManager.catalog(FEATURES, uri != null ? URI.create(uri) : null);
-        Assert.assertNull(c.matchSystem(publicId), msg);
+        assertNull(c.matchSystem(publicId), msg);
     }
 
-    @Test(dataProvider = "invalidCatalog", expectedExceptions = CatalogException.class)
-    public void testCatalogResolverWEmptyCatalog(final String uri, final String publicId, final String msg) {
+    @ParameterizedTest
+    @MethodSource("invalidCatalog")
+    public void testCatalogResolverWEmptyCatalog(String uri, String publicId, String msg) {
         CatalogResolver cr = CatalogManager.catalogResolver(
                 CatalogFeatures.builder().with(CatalogFeatures.Feature.RESOLVE, "strict").build(),
                 uri != null ? URI.create(uri) : null);
-        InputSource is = cr.resolveEntity(publicId, "");
+        assertThrows(CatalogException.class, () -> cr.resolveEntity(publicId, ""));
     }
 
-    @Test(dataProvider = "invalidCatalog")
-    public void testCatalogResolverWEmptyCatalog1(final String uri, final String publicId, final String msg) {
+    @ParameterizedTest
+    @MethodSource("invalidCatalog")
+    public void testCatalogResolverWEmptyCatalog1(String uri, String publicId, String msg) {
         CatalogResolver cr = CatalogManager.catalogResolver(
                 CatalogFeatures.builder().with(CatalogFeatures.Feature.RESOLVE, "continue").build(),
                 uri != null ? URI.create(uri) : null);
-        Assert.assertNull(cr.resolveEntity(publicId, ""), msg);
+        assertNull(cr.resolveEntity(publicId, ""), msg);
     }
 
-    @Test(dataProvider = "invalidInput", expectedExceptions = IllegalArgumentException.class)
-    public void testFileInput(final String file) {
-        CatalogFeatures features = CatalogFeatures.builder()
-            .with(CatalogFeatures.Feature.FILES, file)
-            .build();
+    @ParameterizedTest
+    @MethodSource("invalidInput")
+    public void testFileInput(String file) {
+        assertThrows(
+                IllegalArgumentException.class,
+                () -> CatalogFeatures.builder().with(CatalogFeatures.Feature.FILES, file));
     }
 
-    @Test(dataProvider = "invalidInput", expectedExceptions = IllegalArgumentException.class)
-    public void testInvalidUri(final String file) {
-        CatalogResolver cr = CatalogManager.catalogResolver(FEATURES, file != null ? URI.create(file) : null);
+    @ParameterizedTest
+    @MethodSource("invalidInput")
+    public void testInvalidUri(String file) {
+        URI uri = file != null ? URI.create(file) : null;
+        assertThrows(IllegalArgumentException.class, () -> CatalogManager.catalogResolver(FEATURES, uri));
     }
 
-    @Test(dataProvider = "invalidInput", expectedExceptions = IllegalArgumentException.class)
-    public void testInvalidUri1(final String file) {
-        Catalog c = CatalogManager.catalog(FEATURES, file != null ? URI.create(file) : null);
-        System.err.println("Catalog =" + c);
+    @ParameterizedTest
+    @MethodSource("invalidInput")
+    public void testInvalidUri1(String file) {
+        URI uri = file != null ? URI.create(file) : null;
+        assertThrows(IllegalArgumentException.class, () -> CatalogManager.catalog(FEATURES, uri));
     }
 
-
-    @Test(expectedExceptions = NullPointerException.class)
-    public void testNullFileInput() {
-        CatalogFeatures features = CatalogFeatures.builder()
-            .with(CatalogFeatures.Feature.FILES, null)
-            .build();
+    @Test
+    public void testNull() {
+        assertThrows(
+                NullPointerException.class,
+                () -> CatalogFeatures.builder().with(CatalogFeatures.Feature.FILES, null));
     }
 
-    @Test(expectedExceptions = NullPointerException.class)
+    @Test
     public void testNullUri() {
-        URI uri = null;
-        CatalogResolver cr = CatalogManager.catalogResolver(FEATURES, uri);
+        assertThrows(NullPointerException.class, () -> CatalogManager.catalogResolver(FEATURES, (URI) null));
+        assertThrows(NullPointerException.class, () -> CatalogManager.catalog(FEATURES, (URI) null));
     }
 
-    @Test(expectedExceptions = NullPointerException.class)
-    public void testNullUri1() {
-        URI uri = null;
-        Catalog c = CatalogManager.catalog(FEATURES, uri);
-    }
-
-    private String systemId = "http://www.sys00test.com/rewrite.dtd";
-    private String publicId = "PUB-404";
-    private String expected = "http://www.groupxmlbase.com/dtds/rewrite.dtd";
-    private String errMsg = "Relative rewriteSystem with xml:base at group level failed";
+    private static final String systemId = "http://www.sys00test.com/rewrite.dtd";
+    private static final String publicId = "PUB-404";
+    private static final String expected = "http://www.groupxmlbase.com/dtds/rewrite.dtd";
+    private static final String errMsg = "Relative rewriteSystem with xml:base at group level failed";
 
     /*
         DataProvider: used to verify CatalogResolver's resolveEntity function.
         Data columns:
         catalog, systemId, publicId, expectedUri, msg
      */
-    @DataProvider(name = "acceptedURI")
-    Object[][] getData() throws Exception {
+    Object[][] acceptedURI() throws IOException {
         String filename = "rewriteSystem_id.xml";
         String urlFile = getClass().getResource(filename).toExternalForm();
         String urlHttp = remoteFilePath + "/jax-ws-catalog.xml";
@@ -209,12 +213,7 @@ public class CatalogFileInputTest extends CatalogSupportBase {
         String xsd = jarPath.substring(0, jarPath.lastIndexOf("/")) + "/catalog/ws-addr.xsd";
 
         // create JAR file
-        try {
-            JarUtils.createJarFile(Paths.get(CLS_DIR + "/JDK8171243.jar"),
-                    Paths.get(SRC_DIR + "/jar"), JAR_CONTENT);
-        } catch (IOException ex) {
-            Assert.fail("Failed to create JAR: " + ex.getMessage());
-        }
+        JarUtils.createJarFile(Paths.get(CLS_DIR + "/JDK8171243.jar"), Paths.get(SRC_DIR + "/jar"), JAR_CONTENT);
 
         return new Object[][]{
             // URL
@@ -230,8 +229,7 @@ public class CatalogFileInputTest extends CatalogSupportBase {
      *  Note: the difference from invalidInput is that invalidInput is syntactically
      *  rejected with an IAE.
      */
-    @DataProvider(name = "invalidCatalog")
-    public Object[][] getInvalidCatalog() {
+    public Object[][] invalidCatalog() {
         String catalogUri = getClass().getResource("catalog_invalid.xml").toExternalForm();
         return new Object[][]{
             {catalogUri, "-//W3C//DTD XHTML 1.0 Strict//EN",
@@ -245,38 +243,24 @@ public class CatalogFileInputTest extends CatalogSupportBase {
      *  DataProvider: a list of invalid inputs, expects IAE
      *  Note: exclude null since NPE would have been expected
      */
-    @DataProvider(name = "invalidInput")
-    public Object[][] getFiles() throws Exception {
+    public Object[][] invalidInput() throws Exception {
         String filename = "rewriteSystem_id.xml";
         copyFile(Paths.get(SRC_DIR + "/" + filename), Paths.get(filename));
         String absolutePath = getClass().getResource(filename).getFile();
 
-        return new Object[][]{
-            {""},
-            {"file:a/b\\c"},
-            {"c:/te:t"},
-            {"c:/te?t"},
-            {"c/te*t"},
-            {"in|valid.txt"},
-            {"shema:invalid.txt"},
-            // relative file path
-            {filename},
-            // absolute file path
-            {absolutePath}
+        return new Object[][] {
+                { "c:/te:t" },
+                { "c:/te?t" },
+                { "c/te*t" },
+                { "shema:invalid.txt" },
+                // relative file path
+                { filename },
+                // absolute file path
+                { absolutePath }
         };
     }
 
-    /*
-       DataProvider: a list of invalid inputs
-     */
-    @DataProvider(name = "nullTest")
-    public Object[][] getNull() {
-        return new Object[][]{
-            {null},
-        };
-    }
-
-    void copyFile(final Path src, final Path target) throws Exception {
+    private static void copyFile(final Path src, final Path target) throws Exception {
         try (InputStream in = Files.newInputStream(src);
                 BufferedReader reader
                 = new BufferedReader(new InputStreamReader(in));
diff --git a/test/jaxp/javax/xml/jaxp/unittest/catalog/CatalogResolverTest.java b/test/jaxp/javax/xml/jaxp/unittest/catalog/CatalogResolverTest.java
index 6ad23785b64..b4a2d20efcc 100644
--- a/test/jaxp/javax/xml/jaxp/unittest/catalog/CatalogResolverTest.java
+++ b/test/jaxp/javax/xml/jaxp/unittest/catalog/CatalogResolverTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2023, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2023, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -22,36 +22,41 @@
  */
 package catalog;
 
-import java.net.URI;
-import java.nio.file.Paths;
+import org.junit.jupiter.api.BeforeAll;
+import org.junit.jupiter.api.TestInstance;
+import org.junit.jupiter.api.TestInstance.Lifecycle;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
+import org.xml.sax.InputSource;
+
 import javax.xml.catalog.Catalog;
 import javax.xml.catalog.CatalogException;
 import javax.xml.catalog.CatalogFeatures;
 import javax.xml.catalog.CatalogManager;
 import javax.xml.catalog.CatalogResolver;
 import javax.xml.catalog.CatalogResolver.NotFoundAction;
-import org.testng.Assert;
-import org.testng.annotations.BeforeClass;
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
-import org.xml.sax.InputSource;
+import java.net.URI;
+import java.nio.file.Paths;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertThrows;
 
 /*
  * @test
  * @bug 8316996
  * @library /javax/xml/jaxp/libs /javax/xml/jaxp/unittest
- * @run testng/othervm catalog.CatalogResolverTest
+ * @run junit/othervm catalog.CatalogResolverTest
  * @summary Tests CatalogResolver functions. See CatalogTest for existing basic
  * functional tests.
  */
+@TestInstance(Lifecycle.PER_CLASS)
 public class CatalogResolverTest extends CatalogSupportBase {
-    static final String KEY_FILES = "javax.xml.catalog.files";
     static final String SYSTEM_ID = "http://openjdk_java_net/xml/catalog/dtd/system.dtd";
 
     /*
      * Initializing fields
      */
-    @BeforeClass
+    @BeforeAll
     public void setUpClass() throws Exception {
         super.setUp();
     }
@@ -63,7 +68,6 @@ public class CatalogResolverTest extends CatalogSupportBase {
         resolve property for the Catalog, resolve property for the CatalogResolver,
         system ID to be resolved, expected result, expected exception
      */
-    @DataProvider(name = "factoryMethodInput")
     public Object[][] getInputs() throws Exception {
 
         return new Object[][]{
@@ -80,7 +84,6 @@ public class CatalogResolverTest extends CatalogSupportBase {
          };
     }
 
-    @DataProvider(name = "NPETest")
     public Object[][] getNPETest() throws Exception {
         return new Object[][]{
             {null, null},
@@ -104,22 +107,22 @@ public class CatalogResolverTest extends CatalogSupportBase {
      * @param expectedThrow the expected exception
      * @throws Exception if the test fails
      */
-    @Test(dataProvider = "factoryMethodInput")
+    @ParameterizedTest
+    @MethodSource("getInputs")
     public void testResolveProperty(String cResolve, NotFoundAction action,
             String systemId, String expectedResult, Class<Throwable> expectedThrow)
             throws Exception {
         Catalog c = getCatalog(cResolve);
 
         if (expectedThrow != null) {
-            Assert.assertThrows(expectedThrow,
-                () -> resolveRef(c, action, systemId));
+            assertThrows(expectedThrow, () -> resolveRef(c, action, systemId));
         } else {
-
             String sysId = resolveRef(c, action, systemId);
             System.out.println(sysId);
-            Assert.assertEquals(sysId,
-                    (expectedResult == null) ? null : Paths.get(filepath + expectedResult).toUri().toString().replace("///", "/"),
-                    "System ID match not right");
+            String expected = (expectedResult == null)
+                    ? null
+                    : Paths.get(filepath + expectedResult).toUri().toString().replace("///", "/");
+            assertEquals(expected, sysId, "System ID match not right");
         }
     }
 
@@ -127,9 +130,10 @@ public class CatalogResolverTest extends CatalogSupportBase {
      * Verifies that the catalogResolver method throws NullPointerException if
      * any of the parameters is null.
      */
-    @Test(dataProvider = "NPETest", expectedExceptions = NullPointerException.class)
+    @ParameterizedTest
+    @MethodSource("getNPETest")
     public void testCatalogProperty(Catalog c, NotFoundAction action) {
-        CatalogManager.catalogResolver(c, action);
+        assertThrows(NullPointerException.class, () -> CatalogManager.catalogResolver(c, action));
     }
 
     private String resolveRef(Catalog c, NotFoundAction action, String systemId) throws Exception {
@@ -140,9 +144,8 @@ public class CatalogResolverTest extends CatalogSupportBase {
 
     private Catalog getCatalog(String cResolve) throws Exception {
         URI catalogFile = getClass().getResource("catalog.xml").toURI();
-        Catalog c = CatalogManager.catalog(
+        return CatalogManager.catalog(
                 CatalogFeatures.builder().with(CatalogFeatures.Feature.RESOLVE, cResolve).build(),
                 catalogFile);
-        return c;
     }
 }
diff --git a/test/jaxp/javax/xml/jaxp/unittest/catalog/CatalogReuseTest.java b/test/jaxp/javax/xml/jaxp/unittest/catalog/CatalogReuseTest.java
index 6bc563f3df3..fc4329fa198 100644
--- a/test/jaxp/javax/xml/jaxp/unittest/catalog/CatalogReuseTest.java
+++ b/test/jaxp/javax/xml/jaxp/unittest/catalog/CatalogReuseTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2022, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2022, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -22,22 +22,27 @@
  */
 package catalog;
 
-import java.net.URI;
+import org.junit.jupiter.api.BeforeAll;
+import org.junit.jupiter.api.TestInstance;
+import org.junit.jupiter.api.TestInstance.Lifecycle;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
+
 import javax.xml.catalog.Catalog;
 import javax.xml.catalog.CatalogFeatures;
 import javax.xml.catalog.CatalogManager;
-import org.testng.Assert;
-import org.testng.annotations.BeforeClass;
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
+import java.net.URI;
+
+import static org.junit.jupiter.api.Assertions.assertTrue;
 
 /*
  * @test
  * @bug 8253569
  * @library /javax/xml/jaxp/libs /javax/xml/jaxp/unittest
- * @run testng catalog.CatalogReuseTest
+ * @run junit catalog.CatalogReuseTest
  * @summary Verifies that a catalog can be reused.
  */
+@TestInstance(Lifecycle.PER_CLASS)
 public class CatalogReuseTest extends CatalogSupportBase {
     static final CatalogFeatures FEATURES_STRICT = CatalogFeatures.builder().
             with(CatalogFeatures.Feature.RESOLVE, "strict").build();
@@ -46,7 +51,6 @@ public class CatalogReuseTest extends CatalogSupportBase {
         DataProvider: reuses a catalog. The length of the URIs is in descending order.
         Data columns: catalog, uri, expected
      */
-    @DataProvider(name = "dataWithCatalogD")
     public Object[][] dataWithCatalogD() {
         Catalog c = getCatalog();
         return new Object[][]{
@@ -59,7 +63,6 @@ public class CatalogReuseTest extends CatalogSupportBase {
         DataProvider: reuses a catalog. The length of the URIs is in ascending order.
         Data columns: catalog, uri, expected
      */
-    @DataProvider(name = "dataWithCatalogA")
     public Object[][] dataWithCatalogA() {
         Catalog c = getCatalog();
         return new Object[][]{
@@ -72,18 +75,17 @@ public class CatalogReuseTest extends CatalogSupportBase {
         DataProvider: provides no catalog. A new catalog will be created for each test.
         Data columns: uri, expected
      */
-    @DataProvider(name = "dataWithoutCatalog")
     public Object[][] dataWithoutCatalog() {
-        return new Object[][]{
-            {"http://entailments/example.org/A/B/derived.ttl", "derived/A/B/derived.ttl"},
-            {"http://example.org/A/B.owl", "sources/A/B.owl"},
-         };
+        return new Object[][] {
+                { "http://entailments/example.org/A/B/derived.ttl", "derived/A/B/derived.ttl" },
+                { "http://example.org/A/B.owl", "sources/A/B.owl" },
+        };
     }
 
     /*
      * Initializing fields
      */
-    @BeforeClass
+    @BeforeAll
     public void setUpClass() throws Exception {
         super.setUp();
     }
@@ -91,36 +93,38 @@ public class CatalogReuseTest extends CatalogSupportBase {
     /*
      * Verifies that a Catalog object can be reused, that no state data are
      * in the way of a subsequent matching attempt.
-    */
-    @Test(dataProvider = "dataWithCatalogD")
+     */
+    @ParameterizedTest
+    @MethodSource("dataWithCatalogD")
     public void testD(Catalog c, String uri, String expected) throws Exception {
         String m = c.matchURI(uri);
-        Assert.assertTrue(m.endsWith(expected), "Expected: " + expected);
+        assertTrue(m.endsWith(expected), "Expected: " + expected);
     }
 
     /*
      * Verifies that a Catalog object can be reused.
-    */
-    @Test(dataProvider = "dataWithCatalogA")
+     */
+    @ParameterizedTest
+    @MethodSource("dataWithCatalogA")
     public void testA(Catalog c, String uri, String expected) throws Exception {
         String m = c.matchURI(uri);
-        Assert.assertTrue(m.endsWith(expected), "Expected: " + expected);
+        assertTrue(m.endsWith(expected), "Expected: " + expected);
     }
 
     /*
      * Verifies that a match is found in a newly created Catalog.
-    */
-    @Test(dataProvider = "dataWithoutCatalog")
+     */
+    @ParameterizedTest
+    @MethodSource("dataWithoutCatalog")
     public void testNew(String uri, String expected) throws Exception {
         Catalog c = getCatalog();
         String m = c.matchURI(uri);
-        Assert.assertTrue(m.endsWith(expected), "Expected: " + expected);
+        assertTrue(m.endsWith(expected), "Expected: " + expected);
 
     }
 
     private Catalog getCatalog() {
         String uri = "file://" + slash + filepath + "/catalogReuse.xml";
-        Catalog c = CatalogManager.catalog(FEATURES_STRICT, uri != null? URI.create(uri) : null);
-        return c;
+        return CatalogManager.catalog(FEATURES_STRICT, URI.create(uri));
     }
 }
diff --git a/test/jaxp/javax/xml/jaxp/unittest/catalog/CatalogSupport.java b/test/jaxp/javax/xml/jaxp/unittest/catalog/CatalogSupport.java
index 4344bc1c623..1bd44d3c26b 100644
--- a/test/jaxp/javax/xml/jaxp/unittest/catalog/CatalogSupport.java
+++ b/test/jaxp/javax/xml/jaxp/unittest/catalog/CatalogSupport.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2016, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2016, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,8 +23,14 @@
 
 package catalog;
 
-import java.io.File;
-import java.io.StringReader;
+import org.junit.jupiter.api.BeforeAll;
+import org.junit.jupiter.api.TestInstance;
+import org.junit.jupiter.api.TestInstance.Lifecycle;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
+import org.w3c.dom.ls.LSResourceResolver;
+import org.xml.sax.InputSource;
+
 import javax.xml.stream.XMLResolver;
 import javax.xml.transform.Source;
 import javax.xml.transform.URIResolver;
@@ -32,17 +38,14 @@ import javax.xml.transform.dom.DOMSource;
 import javax.xml.transform.sax.SAXSource;
 import javax.xml.transform.stax.StAXSource;
 import javax.xml.transform.stream.StreamSource;
-import org.testng.annotations.BeforeClass;
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
-import org.w3c.dom.ls.LSResourceResolver;
-import org.xml.sax.InputSource;
+import java.io.File;
+import java.io.StringReader;
 
-/**
+/*
  * @test
  * @bug 8158084 8162438 8162442 8166220 8166398 8290740
  * @library /javax/xml/jaxp/libs /javax/xml/jaxp/unittest
- * @run testng/othervm catalog.CatalogSupport
+ * @run junit/othervm catalog.CatalogSupport
  * @summary verifies the use of Catalog in SAX/DOM/StAX/Validation/Transform.
  * The two main scenarios for all processors are:
  * A custom resolver is used whether or not there's a Catalog;
@@ -51,12 +54,12 @@ import org.xml.sax.InputSource;
 */
 
 /**
- * Support Catalog:
+ * <h3>Support Catalog:</h3>
  * With this patch, the Catalog features are supported by all of the JAXP processors.
  * The support is enabled by default. Using Catalog is as simple as setting a
  * path to a catalog, through the API, or System property, or jaxp.properties.
  *
- * Test notes:
+ * <h3>Test notes:</h3>
  * For all DataProviders, the 1st and 2nd columns determine whether to set USE_CATALOG
  * through the API and to use Catalog. When a custom resolver is specified, these
  * settings should not affect the operation, thus the tests are repeated for both
@@ -64,11 +67,12 @@ import org.xml.sax.InputSource;
  *
  * @author huizhe.wang@oracle.com
  */
+@TestInstance(Lifecycle.PER_CLASS)
 public class CatalogSupport extends CatalogSupportBase {
     /*
      * Initializing fields
      */
-    @BeforeClass
+    @BeforeAll
     public void setUpClass() throws Exception {
         setUp();
     }
@@ -76,7 +80,8 @@ public class CatalogSupport extends CatalogSupportBase {
     /*
        Verifies the Catalog support on SAXParser.
     */
-    @Test(dataProvider = "data_SAXA")
+    @ParameterizedTest
+    @MethodSource("getDataSAX")
     public void testSAXA(boolean setUseCatalog, boolean useCatalog, String catalog,
             String xml, MyHandler handler, String expected) throws Exception {
         testSAX(setUseCatalog, useCatalog, catalog, xml, handler, expected);
@@ -85,7 +90,8 @@ public class CatalogSupport extends CatalogSupportBase {
     /*
        Verifies the Catalog support on XMLReader.
     */
-    @Test(dataProvider = "data_SAXA")
+    @ParameterizedTest
+    @MethodSource("getDataSAX")
     public void testXMLReaderA(boolean setUseCatalog, boolean useCatalog, String catalog,
             String xml, MyHandler handler, String expected) throws Exception {
         testXMLReader(setUseCatalog, useCatalog, catalog, xml, handler, expected);
@@ -94,7 +100,8 @@ public class CatalogSupport extends CatalogSupportBase {
     /*
        Verifies the Catalog support on XInclude.
     */
-    @Test(dataProvider = "data_XIA")
+    @ParameterizedTest
+    @MethodSource("getDataXI")
     public void testXIncludeA(boolean setUseCatalog, boolean useCatalog, String catalog,
             String xml, MyHandler handler, String expected) throws Exception {
         testXInclude(setUseCatalog, useCatalog, catalog, xml, handler, expected);
@@ -104,7 +111,8 @@ public class CatalogSupport extends CatalogSupportBase {
        Verifies that the Catalog is used when the handler is null. The test shall
        run through without an Exception (that was thrown before the fix).
     */
-    @Test(dataProvider = "data_XIA")
+    @ParameterizedTest
+    @MethodSource("getDataXI")
     public void testXIncludeA_NullHandler(boolean setUseCatalog, boolean useCatalog, String catalog,
             String xml, MyHandler handler, String expected) throws Exception {
         handler = null;
@@ -114,7 +122,8 @@ public class CatalogSupport extends CatalogSupportBase {
     /*
        Verifies the Catalog support on DOM parser.
     */
-    @Test(dataProvider = "data_DOMA")
+    @ParameterizedTest
+    @MethodSource("getDataDOM")
     public void testDOMA(boolean setUseCatalog, boolean useCatalog, String catalog,
             String xml, MyHandler handler, String expected) throws Exception {
         testDOM(setUseCatalog, useCatalog, catalog, xml, handler, expected);
@@ -123,7 +132,8 @@ public class CatalogSupport extends CatalogSupportBase {
     /*
        Verifies the Catalog support on XMLStreamReader.
     */
-    @Test(dataProvider = "data_StAXA")
+    @ParameterizedTest
+    @MethodSource("getDataStAX")
     public void testStAXA(boolean setUseCatalog, boolean useCatalog, String catalog,
             String xml, XMLResolver resolver, String expected) throws Exception {
         testStAX(setUseCatalog, useCatalog, catalog, xml, resolver, expected);
@@ -133,7 +143,8 @@ public class CatalogSupport extends CatalogSupportBase {
        Verifies the Catalog support on resolving DTD, xsd import and include in
     Schema files.
     */
-    @Test(dataProvider = "data_SchemaA")
+    @ParameterizedTest
+    @MethodSource("getDataSchema")
     public void testValidationA(boolean setUseCatalog, boolean useCatalog,
             String catalog, String xsd, LSResourceResolver resolver)
             throws Exception {
@@ -145,7 +156,8 @@ public class CatalogSupport extends CatalogSupportBase {
        @bug 8158084 8162438 these tests also verifies the fix for 8162438
        Verifies the Catalog support on the Schema Validator.
     */
-    @Test(dataProvider = "data_ValidatorA")
+    @ParameterizedTest
+    @MethodSource("getDataValidator")
     public void testValidatorA(boolean setUseCatalog1, boolean setUseCatalog2, boolean useCatalog,
             Source source, LSResourceResolver resolver1, LSResourceResolver resolver2,
             String catalog1, String catalog2)
@@ -158,7 +170,8 @@ public class CatalogSupport extends CatalogSupportBase {
        Verifies the Catalog support on resolving DTD, xsl import and include in
     XSL files.
     */
-    @Test(dataProvider = "data_XSLA")
+    @ParameterizedTest
+    @MethodSource("getDataXSL")
     public void testXSLImportA(boolean setUseCatalog, boolean useCatalog, String catalog,
             SAXSource xsl, StreamSource xml, URIResolver resolver, String expected)
             throws Exception {
@@ -171,7 +184,8 @@ public class CatalogSupport extends CatalogSupportBase {
        Verifies the Catalog support on resolving DTD, xsl import and include in
     XSL files.
     */
-    @Test(dataProvider = "data_XSLA")
+    @ParameterizedTest
+    @MethodSource("getDataXSL")
     public void testXSLImportWTemplatesA(boolean setUseCatalog, boolean useCatalog,
             String catalog, SAXSource xsl, StreamSource xml, URIResolver resolver, String expected)
             throws Exception {
@@ -182,7 +196,6 @@ public class CatalogSupport extends CatalogSupportBase {
        DataProvider: for testing the SAX parser
        Data: set use_catalog, use_catalog, catalog file, xml file, handler, expected result string
      */
-    @DataProvider(name = "data_SAXA")
     public Object[][] getDataSAX() {
         String[] systemIds = {"system.dtd"};
         return new Object[][]{
@@ -198,7 +211,6 @@ public class CatalogSupport extends CatalogSupportBase {
        DataProvider: for testing XInclude
        Data: set use_catalog, use_catalog, catalog file, xml file, handler, expected result string
      */
-    @DataProvider(name = "data_XIA")
     public Object[][] getDataXI() {
         String[] systemIds = {"XI_simple.xml"};
         InputSource[] returnValues = {new InputSource(xml_xIncludeSimple)};
@@ -214,7 +226,6 @@ public class CatalogSupport extends CatalogSupportBase {
        DataProvider: for testing DOM parser
        Data: set use_catalog, use_catalog, catalog file, xml file, handler, expected result string
      */
-    @DataProvider(name = "data_DOMA")
     public Object[][] getDataDOM() {
         String[] systemIds = {"system.dtd"};
         InputSource[] returnValues = {new InputSource(new StringReader(dtd_systemResolved))};
@@ -232,7 +243,6 @@ public class CatalogSupport extends CatalogSupportBase {
        DataProvider: for testing the StAX parser
        Data: set use_catalog, use_catalog, catalog file, xml file, handler, expected result string
      */
-    @DataProvider(name = "data_StAXA")
     public Object[][] getDataStAX() {
 
         return new Object[][]{
@@ -250,7 +260,6 @@ public class CatalogSupport extends CatalogSupportBase {
        DataProvider: for testing Schema validation
        Data: set use_catalog, use_catalog, catalog file, xsd file, a LSResourceResolver
      */
-    @DataProvider(name = "data_SchemaA")
     public Object[][] getDataSchema() {
         String[] systemIds = {"pathto/XMLSchema.dtd", "datatypes.dtd"};
         XmlInput[] returnValues = {new XmlInput(null, dtd_xmlSchema, null), new XmlInput(null, dtd_datatypes, null)};
@@ -285,7 +294,6 @@ public class CatalogSupport extends CatalogSupportBase {
        DataProvider: for testing Schema Validator
        Data: source, resolver1, resolver2, catalog1, a catalog2
      */
-    @DataProvider(name = "data_ValidatorA")
     public Object[][] getDataValidator() {
         DOMSource ds = getDOMSource(xml_val_test, xml_val_test_id, false, true, xml_catalog);
 
@@ -325,7 +333,6 @@ public class CatalogSupport extends CatalogSupportBase {
        DataProvider: for testing XSL import and include
        Data: set use_catalog, use_catalog, catalog file, xsl file, xml file, a URIResolver, expected result
      */
-    @DataProvider(name = "data_XSLA")
     public Object[][] getDataXSL() {
         // XSLInclude.xsl has one import XSLImport_html.xsl and two includes,
         // XSLInclude_header.xsl and XSLInclude_footer.xsl;
diff --git a/test/jaxp/javax/xml/jaxp/unittest/catalog/CatalogSupport1.java b/test/jaxp/javax/xml/jaxp/unittest/catalog/CatalogSupport1.java
index 2025e2d14d3..d8e7f8bb77e 100644
--- a/test/jaxp/javax/xml/jaxp/unittest/catalog/CatalogSupport1.java
+++ b/test/jaxp/javax/xml/jaxp/unittest/catalog/CatalogSupport1.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2016, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2016, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,11 +23,14 @@
 
 package catalog;
 
-import static jaxp.library.JAXPTestUtilities.clearSystemProperty;
-import static jaxp.library.JAXPTestUtilities.setSystemProperty;
-
-import java.io.File;
-import java.io.StringReader;
+import org.junit.jupiter.api.AfterAll;
+import org.junit.jupiter.api.BeforeAll;
+import org.junit.jupiter.api.TestInstance;
+import org.junit.jupiter.api.TestInstance.Lifecycle;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
+import org.w3c.dom.ls.LSResourceResolver;
+import org.xml.sax.InputSource;
 
 import javax.xml.catalog.CatalogFeatures.Feature;
 import javax.xml.stream.XMLResolver;
@@ -37,19 +40,14 @@ import javax.xml.transform.dom.DOMSource;
 import javax.xml.transform.sax.SAXSource;
 import javax.xml.transform.stax.StAXSource;
 import javax.xml.transform.stream.StreamSource;
-
-import org.testng.annotations.AfterClass;
-import org.testng.annotations.BeforeClass;
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
-import org.w3c.dom.ls.LSResourceResolver;
-import org.xml.sax.InputSource;
+import java.io.File;
+import java.io.StringReader;
 
 /*
  * @test
  * @bug 8158084 8162438 8162442 8166220
  * @library /javax/xml/jaxp/libs /javax/xml/jaxp/unittest
- * @run testng/othervm catalog.CatalogSupport1
+ * @run junit/othervm catalog.CatalogSupport1
  * @summary extends CatalogSupport, verifies that the catalog file can be set
  * using the System property.
  */
@@ -60,25 +58,27 @@ import org.xml.sax.InputSource;
  *
  * @author huizhe.wang@oracle.com
  */
+@TestInstance(Lifecycle.PER_CLASS)
 public class CatalogSupport1 extends CatalogSupportBase {
     /*
      * Initializing fields
      */
-    @BeforeClass
+    @BeforeAll
     public void setUpClass() throws Exception {
         setUp();
-        setSystemProperty(Feature.FILES.getPropertyName(), xml_catalog);
+        System.setProperty(Feature.FILES.getPropertyName(), xml_catalog);
     }
 
-    @AfterClass
+    @AfterAll
     public void tearDownClass() throws Exception {
-        clearSystemProperty(Feature.FILES.getPropertyName());
+        System.clearProperty(Feature.FILES.getPropertyName());
     }
 
     /*
        Verifies the Catalog support on SAXParser.
     */
-    @Test(dataProvider = "data_SAXC")
+    @ParameterizedTest
+    @MethodSource("getDataSAXC")
     public void testSAXC(boolean setUseCatalog, boolean useCatalog, String catalog, String xml, MyHandler handler, String expected) throws Exception {
         testSAX(setUseCatalog, useCatalog, catalog, xml, handler, expected);
     }
@@ -86,7 +86,8 @@ public class CatalogSupport1 extends CatalogSupportBase {
     /*
        Verifies the Catalog support on XMLReader.
     */
-    @Test(dataProvider = "data_SAXC")
+    @ParameterizedTest
+    @MethodSource("getDataSAXC")
     public void testXMLReaderC(boolean setUseCatalog, boolean useCatalog, String catalog, String xml, MyHandler handler, String expected) throws Exception {
         testXMLReader(setUseCatalog, useCatalog, catalog, xml, handler, expected);
     }
@@ -94,7 +95,8 @@ public class CatalogSupport1 extends CatalogSupportBase {
     /*
        Verifies the Catalog support on XInclude.
     */
-    @Test(dataProvider = "data_XIC")
+    @ParameterizedTest
+    @MethodSource("getDataXIC")
     public void testXIncludeC(boolean setUseCatalog, boolean useCatalog, String catalog, String xml, MyHandler handler, String expected) throws Exception {
         testXInclude(setUseCatalog, useCatalog, catalog, xml, handler, expected);
     }
@@ -102,7 +104,8 @@ public class CatalogSupport1 extends CatalogSupportBase {
     /*
        Verifies the Catalog support on DOM parser.
     */
-    @Test(dataProvider = "data_DOMC")
+    @ParameterizedTest
+    @MethodSource("getDataDOMC")
     public void testDOMC(boolean setUseCatalog, boolean useCatalog, String catalog, String xml, MyHandler handler, String expected) throws Exception {
         testDOM(setUseCatalog, useCatalog, catalog, xml, handler, expected);
     }
@@ -110,7 +113,8 @@ public class CatalogSupport1 extends CatalogSupportBase {
     /*
        Verifies the Catalog support on XMLStreamReader.
     */
-    @Test(dataProvider = "data_StAXC")
+    @ParameterizedTest
+    @MethodSource("getDataStAX")
     public void testStAXC(boolean setUseCatalog, boolean useCatalog, String catalog,
             String xml, XMLResolver resolver, String expected) throws Exception {
         testStAX(setUseCatalog, useCatalog, catalog, xml, resolver, expected);
@@ -120,7 +124,8 @@ public class CatalogSupport1 extends CatalogSupportBase {
        Verifies the Catalog support on resolving DTD, xsd import and include in
     Schema files.
     */
-    @Test(dataProvider = "data_SchemaC")
+    @ParameterizedTest
+    @MethodSource("getDataSchemaC")
     public void testValidationC(boolean setUseCatalog, boolean useCatalog, String catalog, String xsd, LSResourceResolver resolver)
             throws Exception {
 
@@ -131,7 +136,8 @@ public class CatalogSupport1 extends CatalogSupportBase {
        @bug 8158084 8162438 these tests also verifies the fix for 8162438
        Verifies the Catalog support on the Schema Validator.
     */
-    @Test(dataProvider = "data_ValidatorC")
+    @ParameterizedTest
+    @MethodSource("getDataValidator")
     public void testValidatorA(boolean setUseCatalog1, boolean setUseCatalog2, boolean useCatalog,
             Source source, LSResourceResolver resolver1, LSResourceResolver resolver2,
             String catalog1, String catalog2)
@@ -144,7 +150,8 @@ public class CatalogSupport1 extends CatalogSupportBase {
        Verifies the Catalog support on resolving DTD, xsl import and include in
     XSL files.
     */
-    @Test(dataProvider = "data_XSLC")
+    @ParameterizedTest
+    @MethodSource("getDataXSLC")
     public void testXSLImportC(boolean setUseCatalog, boolean useCatalog, String catalog, SAXSource xsl, StreamSource xml,
         URIResolver resolver, String expected) throws Exception {
 
@@ -156,7 +163,8 @@ public class CatalogSupport1 extends CatalogSupportBase {
        Verifies the Catalog support on resolving DTD, xsl import and include in
     XSL files.
     */
-    @Test(dataProvider = "data_XSLC")
+    @ParameterizedTest
+    @MethodSource("getDataXSLC")
     public void testXSLImportWTemplatesC(boolean setUseCatalog, boolean useCatalog, String catalog, SAXSource xsl, StreamSource xml,
         URIResolver resolver, String expected) throws Exception {
         testXSLImportWTemplates(setUseCatalog, useCatalog, catalog, xsl, xml, resolver, expected);
@@ -166,7 +174,6 @@ public class CatalogSupport1 extends CatalogSupportBase {
        DataProvider: for testing the SAX parser
        Data: set use_catalog, use_catalog, catalog file, xml file, handler, expected result string
      */
-    @DataProvider(name = "data_SAXC")
     public Object[][] getDataSAXC() {
         return new Object[][]{
             {false, true, null, xml_system, new MyHandler(elementInSystem), expectedWCatalog}
@@ -178,7 +185,6 @@ public class CatalogSupport1 extends CatalogSupportBase {
        DataProvider: for testing XInclude
        Data: set use_catalog, use_catalog, catalog file, xml file, handler, expected result string
      */
-    @DataProvider(name = "data_XIC")
     public Object[][] getDataXIC() {
         return new Object[][]{
             {false, true, null, xml_xInclude, new MyHandler(elementInXISimple), contentInUIutf8Catalog},
@@ -189,7 +195,6 @@ public class CatalogSupport1 extends CatalogSupportBase {
        DataProvider: for testing DOM parser
        Data: set use_catalog, use_catalog, catalog file, xml file, handler, expected result string
      */
-    @DataProvider(name = "data_DOMC")
     public Object[][] getDataDOMC() {
         return new Object[][]{
             {false, true, null, xml_system, new MyHandler(elementInSystem), expectedWCatalog}
@@ -200,7 +205,6 @@ public class CatalogSupport1 extends CatalogSupportBase {
        DataProvider: for testing the StAX parser
        Data: set use_catalog, use_catalog, catalog file, xml file, handler, expected result string
      */
-    @DataProvider(name = "data_StAXC")
     public Object[][] getDataStAX() {
 
         return new Object[][]{
@@ -212,7 +216,6 @@ public class CatalogSupport1 extends CatalogSupportBase {
        DataProvider: for testing Schema validation
        Data: set use_catalog, use_catalog, catalog file, xsd file, a LSResourceResolver
      */
-    @DataProvider(name = "data_SchemaC")
     public Object[][] getDataSchemaC() {
 
         return new Object[][]{
@@ -230,7 +233,6 @@ public class CatalogSupport1 extends CatalogSupportBase {
        DataProvider: for testing Schema Validator
        Data: source, resolver1, resolver2, catalog1, a catalog2
      */
-    @DataProvider(name = "data_ValidatorC")
     public Object[][] getDataValidator() {
         DOMSource ds = getDOMSource(xml_val_test, xml_val_test_id, false, true, null);
 
@@ -270,7 +272,6 @@ public class CatalogSupport1 extends CatalogSupportBase {
        DataProvider: for testing XSL import and include
        Data: set use_catalog, use_catalog, catalog file, xsl file, xml file, a URIResolver, expected
      */
-    @DataProvider(name = "data_XSLC")
     public Object[][] getDataXSLC() {
         SAXSource xslSourceDTD = new SAXSource(new InputSource(new StringReader(xsl_includeDTD)));
         StreamSource xmlSourceDTD = new StreamSource(new StringReader(xml_xslDTD));
diff --git a/test/jaxp/javax/xml/jaxp/unittest/catalog/CatalogSupport2.java b/test/jaxp/javax/xml/jaxp/unittest/catalog/CatalogSupport2.java
index ecb88de1932..2346a8577b0 100644
--- a/test/jaxp/javax/xml/jaxp/unittest/catalog/CatalogSupport2.java
+++ b/test/jaxp/javax/xml/jaxp/unittest/catalog/CatalogSupport2.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2016, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2016, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,13 +23,17 @@
 
 package catalog;
 
-import static jaxp.library.JAXPTestUtilities.clearSystemProperty;
-import static jaxp.library.JAXPTestUtilities.getSystemProperty;
-import static jaxp.library.JAXPTestUtilities.setSystemProperty;
+import org.junit.jupiter.api.AfterAll;
+import org.junit.jupiter.api.BeforeAll;
+import org.junit.jupiter.api.TestInstance;
+import org.junit.jupiter.api.TestInstance.Lifecycle;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
+import org.w3c.dom.ls.LSResourceResolver;
+import org.xml.sax.InputSource;
+import org.xml.sax.SAXException;
+import org.xml.sax.SAXParseException;
 
-import java.io.File;
-import java.io.IOException;
-import java.io.StringReader;
 import javax.xml.stream.XMLResolver;
 import javax.xml.stream.XMLStreamException;
 import javax.xml.transform.Source;
@@ -39,21 +43,16 @@ import javax.xml.transform.dom.DOMSource;
 import javax.xml.transform.sax.SAXSource;
 import javax.xml.transform.stax.StAXSource;
 import javax.xml.transform.stream.StreamSource;
+import java.io.File;
+import java.io.StringReader;
 
-import org.testng.annotations.AfterClass;
-import org.testng.annotations.BeforeClass;
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
-import org.w3c.dom.ls.LSResourceResolver;
-import org.xml.sax.InputSource;
-import org.xml.sax.SAXException;
-import org.xml.sax.SAXParseException;
+import static org.junit.jupiter.api.Assertions.assertThrows;
 
 /*
  * @test
  * @bug 8158084 8162438 8162442 8163535 8166220 8344800
  * @library /javax/xml/jaxp/libs /javax/xml/jaxp/unittest
- * @run testng/othervm catalog.CatalogSupport2
+ * @run junit/othervm catalog.CatalogSupport2
  * @summary extends CatalogSupport tests, verifies that the use of the Catalog may
  * be disabled through the System property.
  */
@@ -65,108 +64,130 @@ import org.xml.sax.SAXParseException;
  *
  * @author huizhe.wang@oracle.com
  */
+@TestInstance(Lifecycle.PER_CLASS)
 public class CatalogSupport2 extends CatalogSupportBase {
     static final String TTIMEOUTREAD = "sun.net.client.defaultReadTimeout";
     static final String TIMEOUTCONNECT = "sun.net.client.defaultConnectTimeout";
-    static String timeoutRead = getSystemProperty(TTIMEOUTREAD);
-    static String timeoutConnect = getSystemProperty(TIMEOUTCONNECT);
+    static String timeoutRead = System.getProperty(TTIMEOUTREAD);
+    static String timeoutConnect = System.getProperty(TIMEOUTCONNECT);
 
     /*
      * Initializing fields
      */
-    @BeforeClass
+    @BeforeAll
     public void setUpClass() throws Exception {
         setUp();
-        setSystemProperty(SP_USE_CATALOG, "false");
-        setSystemProperty(SP_ACCESS_EXTERNAL_DTD, "file");
-        timeoutRead = getSystemProperty(TTIMEOUTREAD);
-        timeoutConnect = getSystemProperty(TIMEOUTCONNECT);
-        setSystemProperty(TTIMEOUTREAD, "1000");
-        setSystemProperty(TIMEOUTCONNECT, "1000");
+        System.setProperty(SP_USE_CATALOG, "false");
+        System.setProperty(SP_ACCESS_EXTERNAL_DTD, "file");
+        timeoutRead = System.getProperty(TTIMEOUTREAD);
+        timeoutConnect = System.getProperty(TIMEOUTCONNECT);
+        System.setProperty(TTIMEOUTREAD, "1000");
+        System.setProperty(TIMEOUTCONNECT, "1000");
     }
 
-    @AfterClass
-    public void tearDownClass() throws Exception {
-        clearSystemProperty(SP_USE_CATALOG);
-        clearSystemProperty(SP_ACCESS_EXTERNAL_DTD);
-        setSystemProperty(TIMEOUTCONNECT, "-1");
-        setSystemProperty(TTIMEOUTREAD, "-1");
+    @AfterAll
+    public void tearDownClass() {
+        System.clearProperty(SP_USE_CATALOG);
+        System.clearProperty(SP_ACCESS_EXTERNAL_DTD);
+        System.setProperty(TIMEOUTCONNECT, "-1");
+        System.setProperty(TTIMEOUTREAD, "-1");
     }
 
     /*
        Verifies the Catalog support on SAXParser.
     */
-    @Test(dataProvider = "data_SAXC", expectedExceptions = SAXParseException.class)
+    @ParameterizedTest
+    @MethodSource("getDataSAXC")
     public void testSAXC(boolean setUseCatalog, boolean useCatalog, String catalog, String
             xml, MyHandler handler, String expected) throws Exception {
-        testSAX(setUseCatalog, useCatalog, catalog, xml, handler, expected);
+        assertThrows(
+                SAXParseException.class,
+                () -> testSAX(setUseCatalog, useCatalog, catalog, xml, handler, expected));
     }
 
     /*
        Verifies the Catalog support on XMLReader.
     */
-    @Test(dataProvider = "data_SAXC", expectedExceptions = SAXParseException.class)
+    @ParameterizedTest
+    @MethodSource("getDataSAXC")
     public void testXMLReaderC(boolean setUseCatalog, boolean useCatalog, String catalog,
-            String xml, MyHandler handler, String expected) throws Exception {
-        testXMLReader(setUseCatalog, useCatalog, catalog, xml, handler, expected);
+                               String xml, MyHandler handler, String expected) throws Exception {
+        assertThrows(
+                SAXParseException.class,
+                () -> testXMLReader(setUseCatalog, useCatalog, catalog, xml, handler, expected));
     }
 
     /*
        Verifies the Catalog support on XInclude.
     */
-    @Test(dataProvider = "data_XIC", expectedExceptions = SAXParseException.class)
+    @ParameterizedTest
+    @MethodSource("getDataXIC")
     public void testXIncludeC(boolean setUseCatalog, boolean useCatalog, String catalog,
-            String xml, MyHandler handler, String expected) throws Exception {
-        testXInclude(setUseCatalog, useCatalog, catalog, xml, handler, expected);
+                              String xml, MyHandler handler, String expected) throws Exception {
+        assertThrows(
+                SAXParseException.class,
+                () -> testXInclude(setUseCatalog, useCatalog, catalog, xml, handler, expected));
     }
 
     /*
        Verifies the Catalog support on DOM parser.
     */
-    @Test(dataProvider = "data_DOMC", expectedExceptions = SAXParseException.class)
+    @ParameterizedTest
+    @MethodSource("getDataDOMC")
     public void testDOMC(boolean setUseCatalog, boolean useCatalog, String catalog,
-            String xml, MyHandler handler, String expected) throws Exception {
-        testDOM(setUseCatalog, useCatalog, catalog, xml, handler, expected);
+                         String xml, MyHandler handler, String expected) throws Exception {
+        assertThrows(
+                SAXParseException.class,
+                () -> testDOM(setUseCatalog, useCatalog, catalog, xml, handler, expected));
     }
 
     /*
        Verifies the Catalog support on XMLStreamReader.
     */
-    @Test(dataProvider = "data_StAXC", expectedExceptions = XMLStreamException.class)
+    @ParameterizedTest
+    @MethodSource("getDataStAX")
     public void testStAXC(boolean setUseCatalog, boolean useCatalog, String catalog,
-            String xml, XMLResolver resolver, String expected) throws Exception {
-        testStAXNegative(setUseCatalog, useCatalog, catalog, xml, resolver, expected);
+                          String xml, XMLResolver resolver, String expected) throws Exception {
+        assertThrows(
+                XMLStreamException.class,
+                () -> testStAXNegative(setUseCatalog, useCatalog, catalog, xml, resolver, expected));
     }
 
     /*
        Verifies the Catalog support on resolving DTD, xsd import and include in
     Schema files.
     */
-    @Test(dataProvider = "data_SchemaC", expectedExceptions = SAXParseException.class)
+    @ParameterizedTest
+    @MethodSource("getDataSchemaC")
     public void testValidationC(boolean setUseCatalog, boolean useCatalog, String catalog,
-            String xsd, LSResourceResolver resolver)
-            throws Exception {
-        testValidation(setUseCatalog, useCatalog, catalog, xsd, resolver) ;
+                                String xsd, LSResourceResolver resolver) {
+        assertThrows(
+                SAXParseException.class,
+                () -> testValidation(setUseCatalog, useCatalog, catalog, xsd, resolver));
     }
 
-    @Test(dataProvider = "data_ValidatorC", expectedExceptions = {SAXException.class, IOException.class})
+    @ParameterizedTest
+    @MethodSource("getDataValidator")
     public void testValidatorC(boolean setUseCatalog1, boolean setUseCatalog2, boolean useCatalog,
-            Source source, LSResourceResolver resolver1, LSResourceResolver resolver2,
-            String catalog1, String catalog2)
-            throws Exception {
-        testValidator(setUseCatalog1, setUseCatalog2, useCatalog, source,
-                resolver1, resolver2, catalog1, catalog2);
+                               Source source, LSResourceResolver resolver1, LSResourceResolver resolver2,
+                               String catalog1, String catalog2) {
+        assertThrows(
+                SAXException.class,
+                () -> testValidator(setUseCatalog1, setUseCatalog2, useCatalog, source, resolver1, resolver2, catalog1, catalog2));
     }
 
     /*
        Verifies the Catalog support on resolving DTD, xsl import and include in
     XSL files.
     */
-    @Test(dataProvider = "data_XSLC", expectedExceptions = TransformerException.class)
+    @ParameterizedTest
+    @MethodSource("getDataXSLC")
     public void testXSLImportC(boolean setUseCatalog, boolean useCatalog, String catalog,
-            SAXSource xsl, StreamSource xml, URIResolver resolver, String expected) throws Exception {
+                               SAXSource xsl, StreamSource xml, URIResolver resolver, String expected) {
 
-        testXSLImport(setUseCatalog, useCatalog, catalog, xsl, xml, resolver, expected);
+        assertThrows(
+                TransformerException.class,
+                () -> testXSLImport(setUseCatalog, useCatalog, catalog, xsl, xml, resolver, expected));
     }
 
     /*
@@ -174,17 +195,19 @@ public class CatalogSupport2 extends CatalogSupportBase {
        Verifies the Catalog support on resolving DTD, xsl import and include in
     XSL files.
     */
-    @Test(dataProvider = "data_XSLC", expectedExceptions = TransformerException.class)
+    @ParameterizedTest
+    @MethodSource("getDataXSLC")
     public void testXSLImportWTemplatesC(boolean setUseCatalog, boolean useCatalog, String catalog,
-            SAXSource xsl, StreamSource xml, URIResolver resolver, String expected) throws Exception {
-        testXSLImportWTemplates(setUseCatalog, useCatalog, catalog, xsl, xml, resolver, expected);
+                                         SAXSource xsl, StreamSource xml, URIResolver resolver, String expected) {
+        assertThrows(
+                TransformerException.class,
+                () -> testXSLImportWTemplates(setUseCatalog, useCatalog, catalog, xsl, xml, resolver, expected));
     }
 
     /*
        DataProvider: for testing the SAX parser
        Data: set use_catalog, use_catalog, catalog file, xml file, handler, expected result string
      */
-    @DataProvider(name = "data_SAXC")
     public Object[][] getDataSAXC() {
         return new Object[][]{
             {false, true, xml_catalog, xml_system, new MyHandler(elementInSystem), expectedWCatalog}
@@ -196,7 +219,6 @@ public class CatalogSupport2 extends CatalogSupportBase {
        DataProvider: for testing XInclude
        Data: set use_catalog, use_catalog, catalog file, xml file, handler, expected result string
      */
-    @DataProvider(name = "data_XIC")
     public Object[][] getDataXIC() {
         return new Object[][]{
             {false, true, xml_catalog, xml_xInclude, new MyHandler(elementInXISimple), contentInUIutf8Catalog},
@@ -207,7 +229,6 @@ public class CatalogSupport2 extends CatalogSupportBase {
        DataProvider: for testing DOM parser
        Data: set use_catalog, use_catalog, catalog file, xml file, handler, expected result string
      */
-    @DataProvider(name = "data_DOMC")
     public Object[][] getDataDOMC() {
         return new Object[][]{
             {false, true, xml_catalog, xml_system, new MyHandler(elementInSystem), expectedWCatalog}
@@ -218,7 +239,6 @@ public class CatalogSupport2 extends CatalogSupportBase {
        DataProvider: for testing the StAX parser
        Data: set use_catalog, use_catalog, catalog file, xml file, handler, expected result string
      */
-    @DataProvider(name = "data_StAXC")
     public Object[][] getDataStAX() {
         return new Object[][]{
             {false, true, xml_catalog, xml_system, null, "null"},
@@ -229,7 +249,6 @@ public class CatalogSupport2 extends CatalogSupportBase {
        DataProvider: for testing Schema validation
        Data: set use_catalog, use_catalog, catalog file, xsd file, a LSResourceResolver
      */
-    @DataProvider(name = "data_SchemaC")
     public Object[][] getDataSchemaC() {
 
         return new Object[][]{
@@ -247,7 +266,6 @@ public class CatalogSupport2 extends CatalogSupportBase {
        DataProvider: for testing Schema Validator
        Data: source, resolver1, resolver2, catalog1, a catalog2
      */
-    @DataProvider(name = "data_ValidatorC")
     public Object[][] getDataValidator() {
         DOMSource ds = getDOMSource(xml_val_test, xml_val_test_id, true, true, xml_catalog);
 
@@ -276,7 +294,6 @@ public class CatalogSupport2 extends CatalogSupportBase {
        DataProvider: for testing XSL import and include
        Data: set use_catalog, use_catalog, catalog file, xsl file, xml file, a URIResolver, expected
      */
-    @DataProvider(name = "data_XSLC")
     public Object[][] getDataXSLC() {
         SAXSource xslSourceDTD = new SAXSource(new InputSource(new StringReader(xsl_includeDTD)));
         StreamSource xmlSourceDTD = new StreamSource(new StringReader(xml_xslDTD));
diff --git a/test/jaxp/javax/xml/jaxp/unittest/catalog/CatalogSupport3.java b/test/jaxp/javax/xml/jaxp/unittest/catalog/CatalogSupport3.java
index 4d44ce80fe6..cd06c2b6cba 100644
--- a/test/jaxp/javax/xml/jaxp/unittest/catalog/CatalogSupport3.java
+++ b/test/jaxp/javax/xml/jaxp/unittest/catalog/CatalogSupport3.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2016, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2016, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,13 +23,17 @@
 
 package catalog;
 
-import static jaxp.library.JAXPTestUtilities.clearSystemProperty;
-import static jaxp.library.JAXPTestUtilities.getSystemProperty;
-import static jaxp.library.JAXPTestUtilities.setSystemProperty;
+import org.junit.jupiter.api.AfterAll;
+import org.junit.jupiter.api.BeforeAll;
+import org.junit.jupiter.api.TestInstance;
+import org.junit.jupiter.api.TestInstance.Lifecycle;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
+import org.w3c.dom.ls.LSResourceResolver;
+import org.xml.sax.InputSource;
+import org.xml.sax.SAXException;
+import org.xml.sax.SAXParseException;
 
-import java.io.File;
-import java.io.IOException;
-import java.io.StringReader;
 import javax.xml.stream.XMLResolver;
 import javax.xml.stream.XMLStreamException;
 import javax.xml.transform.Source;
@@ -39,21 +43,16 @@ import javax.xml.transform.dom.DOMSource;
 import javax.xml.transform.sax.SAXSource;
 import javax.xml.transform.stax.StAXSource;
 import javax.xml.transform.stream.StreamSource;
+import java.io.File;
+import java.io.StringReader;
 
-import org.testng.annotations.AfterClass;
-import org.testng.annotations.BeforeClass;
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
-import org.w3c.dom.ls.LSResourceResolver;
-import org.xml.sax.InputSource;
-import org.xml.sax.SAXException;
-import org.xml.sax.SAXParseException;
+import static org.junit.jupiter.api.Assertions.assertThrows;
 
 /*
  * @test
  * @bug 8158084 8162438 8162442 8163535 8166220 8344800
  * @library /javax/xml/jaxp/libs /javax/xml/jaxp/unittest
- * @run testng/othervm catalog.CatalogSupport3
+ * @run junit/othervm catalog.CatalogSupport3
  * @summary extends CatalogSupport tests, verifies that the use of the Catalog may
  * be disabled through the API property.
  */
@@ -65,109 +64,131 @@ import org.xml.sax.SAXParseException;
  *
  * @author huizhe.wang@oracle.com
  */
+@TestInstance(Lifecycle.PER_CLASS)
 public class CatalogSupport3 extends CatalogSupportBase {
     static final String TTIMEOUTREAD = "sun.net.client.defaultReadTimeout";
     static final String TIMEOUTCONNECT = "sun.net.client.defaultConnectTimeout";
-    static String timeoutRead = getSystemProperty(TTIMEOUTREAD);
-    static String timeoutConnect = getSystemProperty(TIMEOUTCONNECT);
+    static String timeoutRead = System.getProperty(TTIMEOUTREAD);
+    static String timeoutConnect = System.getProperty(TIMEOUTCONNECT);
     /*
      * Initializing fields
      */
-    @BeforeClass
+    @BeforeAll
     public void setUpClass() throws Exception {
         setUp();
-        timeoutRead = getSystemProperty(TTIMEOUTREAD);
-        timeoutConnect = getSystemProperty(TIMEOUTCONNECT);
-        setSystemProperty(TTIMEOUTREAD, "1000");
-        setSystemProperty(TIMEOUTCONNECT, "1000");
-        setSystemProperty(SP_ACCESS_EXTERNAL_DTD, "file");
+        timeoutRead = System.getProperty(TTIMEOUTREAD);
+        timeoutConnect = System.getProperty(TIMEOUTCONNECT);
+        System.setProperty(TTIMEOUTREAD, "1000");
+        System.setProperty(TIMEOUTCONNECT, "1000");
+        System.setProperty(SP_ACCESS_EXTERNAL_DTD, "file");
     }
 
-    @AfterClass
-    public void tearDownClass() throws Exception {
-        setSystemProperty(TIMEOUTCONNECT, "-1");
-        setSystemProperty(TTIMEOUTREAD, "-1");
-        clearSystemProperty(SP_ACCESS_EXTERNAL_DTD);
+    @AfterAll
+    public void tearDownClass() {
+        System.setProperty(TIMEOUTCONNECT, "-1");
+        System.setProperty(TTIMEOUTREAD, "-1");
+        System.clearProperty(SP_ACCESS_EXTERNAL_DTD);
     }
 
     /*
        Verifies the Catalog support on SAXParser.
     */
-    @Test(dataProvider = "data_SAXC", expectedExceptions = SAXParseException.class)
+    @ParameterizedTest
+    @MethodSource("getDataSAXC")
     public void testSAXC(boolean setUseCatalog, boolean useCatalog, String catalog,
-            String xml, MyHandler handler, String expected) throws Exception {
-        testSAX(setUseCatalog, useCatalog, catalog, xml, handler, expected);
+                         String xml, MyHandler handler, String expected) {
+        assertThrows(
+                SAXParseException.class,
+                () -> testSAX(setUseCatalog, useCatalog, catalog, xml, handler, expected));
     }
 
     /*
        Verifies the Catalog support on XMLReader.
     */
-    @Test(dataProvider = "data_SAXC", expectedExceptions = SAXParseException.class)
+    @ParameterizedTest
+    @MethodSource("getDataSAXC")
     public void testXMLReaderC(boolean setUseCatalog, boolean useCatalog, String catalog,
-            String xml, MyHandler handler, String expected) throws Exception {
-        testXMLReader(setUseCatalog, useCatalog, catalog, xml, handler, expected);
+                               String xml, MyHandler handler, String expected) {
+        assertThrows(
+                SAXParseException.class,
+                () -> testXMLReader(setUseCatalog, useCatalog, catalog, xml, handler, expected));
     }
 
     /*
        Verifies the Catalog support on XInclude.
     */
-    @Test(dataProvider = "data_XIC", expectedExceptions = SAXParseException.class)
+    @ParameterizedTest
+    @MethodSource("getDataXIC")
     public void testXIncludeC(boolean setUseCatalog, boolean useCatalog, String catalog,
-            String xml, MyHandler handler, String expected) throws Exception {
-        testXInclude(setUseCatalog, useCatalog, catalog, xml, handler, expected);
+                              String xml, MyHandler handler, String expected) {
+        assertThrows(
+                SAXParseException.class,
+                () -> testXInclude(setUseCatalog, useCatalog, catalog, xml, handler, expected));
     }
 
     /*
        Verifies the Catalog support on DOM parser.
     */
-    @Test(dataProvider = "data_DOMC", expectedExceptions = SAXParseException.class)
+    @ParameterizedTest
+    @MethodSource("getDataDOMC")
     public void testDOMC(boolean setUseCatalog, boolean useCatalog, String catalog,
-            String xml, MyHandler handler, String expected) throws Exception {
-        testDOM(setUseCatalog, useCatalog, catalog, xml, handler, expected);
+                         String xml, MyHandler handler, String expected) {
+        assertThrows(
+                SAXParseException.class,
+                () -> testDOM(setUseCatalog, useCatalog, catalog, xml, handler, expected));
     }
 
     /*
        Verifies the Catalog support on XMLStreamReader.
     */
-    @Test(dataProvider = "data_StAXC", expectedExceptions = XMLStreamException.class)
+    @ParameterizedTest
+    @MethodSource("getDataStAX")
     public void testStAXC(boolean setUseCatalog, boolean useCatalog, String catalog,
-            String xml, XMLResolver resolver, String expected) throws Exception {
-        testStAXNegative(setUseCatalog, useCatalog, catalog, xml, resolver, expected);
+                          String xml, XMLResolver resolver, String expected) {
+        assertThrows(
+                XMLStreamException.class,
+                () -> testStAXNegative(setUseCatalog, useCatalog, catalog, xml, resolver, expected));
     }
 
     /*
        Verifies the Catalog support on resolving DTD, xsd import and include in
     Schema files.
     */
-    @Test(dataProvider = "data_SchemaC", expectedExceptions = SAXParseException.class)
+    @ParameterizedTest
+    @MethodSource("getDataSchemaC")
     public void testValidationC(boolean setUseCatalog, boolean useCatalog, String catalog,
-            String xsd, LSResourceResolver resolver)
-            throws Exception {
-        testValidation(setUseCatalog, useCatalog, catalog, xsd, resolver) ;
+                                String xsd, LSResourceResolver resolver) {
+        assertThrows(
+                SAXParseException.class,
+                () -> testValidation(setUseCatalog, useCatalog, catalog, xsd, resolver));
     }
 
     /*
        @bug 8158084 8162438 these tests also verifies the fix for 8162438
        Verifies the Catalog support on the Schema Validator.
     */
-    @Test(dataProvider = "data_ValidatorC", expectedExceptions = {SAXException.class, IOException.class})
+    @ParameterizedTest
+    @MethodSource("getDataValidator")
     public void testValidatorC(boolean setUseCatalog1, boolean setUseCatalog2, boolean useCatalog,
-            Source source, LSResourceResolver resolver1, LSResourceResolver resolver2,
-            String catalog1, String catalog2)
-            throws Exception {
-        testValidator(setUseCatalog1, setUseCatalog2, useCatalog, source,
-                resolver1, resolver2, catalog1, catalog2);
+                               Source source, LSResourceResolver resolver1, LSResourceResolver resolver2,
+                               String catalog1, String catalog2) {
+        assertThrows(
+                SAXException.class,
+                () -> testValidator(setUseCatalog1, setUseCatalog2, useCatalog, source, resolver1, resolver2, catalog1, catalog2));
     }
 
     /*
        Verifies the Catalog support on resolving DTD, xsl import and include in
     XSL files.
     */
-    @Test(dataProvider = "data_XSLC", expectedExceptions = TransformerException.class)
+    @ParameterizedTest
+    @MethodSource("getDataXSLC")
     public void testXSLImportC(boolean setUseCatalog, boolean useCatalog, String catalog, SAXSource xsl, StreamSource xml,
         URIResolver resolver, String expected) throws Exception {
 
-        testXSLImport(setUseCatalog, useCatalog, catalog, xsl, xml, resolver, expected);
+        assertThrows(
+                TransformerException.class,
+                () -> testXSLImport(setUseCatalog, useCatalog, catalog, xsl, xml, resolver, expected));
     }
 
     /*
@@ -175,18 +196,20 @@ public class CatalogSupport3 extends CatalogSupportBase {
        Verifies the Catalog support on resolving DTD, xsl import and include in
     XSL files.
     */
-    @Test(dataProvider = "data_XSLC", expectedExceptions = TransformerException.class)
+    @ParameterizedTest
+    @MethodSource("getDataXSLC")
     public void testXSLImportWTemplatesC(boolean setUseCatalog, boolean useCatalog, String catalog,
-            SAXSource xsl, StreamSource xml,
-        URIResolver resolver, String expected) throws Exception {
-        testXSLImportWTemplates(setUseCatalog, useCatalog, catalog, xsl, xml, resolver, expected);
+                                         SAXSource xsl, StreamSource xml,
+                                         URIResolver resolver, String expected) throws Exception {
+        assertThrows(
+                TransformerException.class,
+                () -> testXSLImportWTemplates(setUseCatalog, useCatalog, catalog, xsl, xml, resolver, expected));
     }
 
     /*
        DataProvider: for testing the SAX parser
        Data: set use_catalog, use_catalog, catalog file, xml file, handler, expected result string
      */
-    @DataProvider(name = "data_SAXC")
     public Object[][] getDataSAXC() {
         return new Object[][]{
             {true, false, xml_catalog, xml_system, new MyHandler(elementInSystem), expectedWCatalog}
@@ -198,7 +221,6 @@ public class CatalogSupport3 extends CatalogSupportBase {
        DataProvider: for testing XInclude
        Data: set use_catalog, use_catalog, catalog file, xml file, handler, expected result string
      */
-    @DataProvider(name = "data_XIC")
     public Object[][] getDataXIC() {
         return new Object[][]{
             {true, false, xml_catalog, xml_xInclude, new MyHandler(elementInXISimple), contentInUIutf8Catalog},
@@ -209,7 +231,6 @@ public class CatalogSupport3 extends CatalogSupportBase {
        DataProvider: for testing DOM parser
        Data: set use_catalog, use_catalog, catalog file, xml file, handler, expected result string
      */
-    @DataProvider(name = "data_DOMC")
     public Object[][] getDataDOMC() {
         return new Object[][]{
             {true, false, xml_catalog, xml_system, new MyHandler(elementInSystem), expectedWCatalog}
@@ -220,7 +241,6 @@ public class CatalogSupport3 extends CatalogSupportBase {
        DataProvider: for testing the StAX parser
        Data: set use_catalog, use_catalog, catalog file, xml file, handler, expected result string
      */
-    @DataProvider(name = "data_StAXC")
     public Object[][] getDataStAX() {
         return new Object[][]{
             {true, false, xml_catalog, xml_system, null, "null"},
@@ -231,7 +251,6 @@ public class CatalogSupport3 extends CatalogSupportBase {
        DataProvider: for testing Schema validation
        Data: set use_catalog, use_catalog, catalog file, xsd file, a LSResourceResolver
      */
-    @DataProvider(name = "data_SchemaC")
     public Object[][] getDataSchemaC() {
 
         return new Object[][]{
@@ -249,7 +268,6 @@ public class CatalogSupport3 extends CatalogSupportBase {
        DataProvider: for testing Schema Validator
        Data: source, resolver1, resolver2, catalog1, a catalog2
      */
-    @DataProvider(name = "data_ValidatorC")
     public Object[][] getDataValidator() {
         DOMSource ds = getDOMSource(xml_val_test, xml_val_test_id, false, true, xml_catalog);
 
@@ -287,7 +305,6 @@ public class CatalogSupport3 extends CatalogSupportBase {
        DataProvider: for testing XSL import and include
        Data: set use_catalog, use_catalog, catalog file, xsl file, xml file, a URIResolver, expected
      */
-    @DataProvider(name = "data_XSLC")
     public Object[][] getDataXSLC() {
         SAXSource xslSourceDTD = new SAXSource(new InputSource(new StringReader(xsl_includeDTD)));
         StreamSource xmlSourceDTD = new StreamSource(new StringReader(xml_xslDTD));
diff --git a/test/jaxp/javax/xml/jaxp/unittest/catalog/CatalogSupport4.java b/test/jaxp/javax/xml/jaxp/unittest/catalog/CatalogSupport4.java
index 8d06cc61355..f666e198228 100644
--- a/test/jaxp/javax/xml/jaxp/unittest/catalog/CatalogSupport4.java
+++ b/test/jaxp/javax/xml/jaxp/unittest/catalog/CatalogSupport4.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2016, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2016, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,11 +23,15 @@
 
 package catalog;
 
-import static jaxp.library.JAXPTestUtilities.clearSystemProperty;
-import static jaxp.library.JAXPTestUtilities.setSystemProperty;
+import org.junit.jupiter.api.AfterAll;
+import org.junit.jupiter.api.BeforeAll;
+import org.junit.jupiter.api.TestInstance;
+import org.junit.jupiter.api.TestInstance.Lifecycle;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
+import org.w3c.dom.ls.LSResourceResolver;
+import org.xml.sax.InputSource;
 
-import java.io.File;
-import java.io.StringReader;
 import javax.xml.stream.XMLResolver;
 import javax.xml.transform.Source;
 import javax.xml.transform.URIResolver;
@@ -35,19 +39,14 @@ import javax.xml.transform.dom.DOMSource;
 import javax.xml.transform.sax.SAXSource;
 import javax.xml.transform.stax.StAXSource;
 import javax.xml.transform.stream.StreamSource;
+import java.io.File;
+import java.io.StringReader;
 
-import org.testng.annotations.AfterClass;
-import org.testng.annotations.BeforeClass;
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
-import org.w3c.dom.ls.LSResourceResolver;
-import org.xml.sax.InputSource;
-
-/**
+/*
  * @test
  * @bug 8158084 8162438 8162442 8166220
  * @library /javax/xml/jaxp/libs /javax/xml/jaxp/unittest
- * @run testng/othervm catalog.CatalogSupport4
+ * @run junit/othervm catalog.CatalogSupport4
  * @summary verifies the overriding over of the USE_CATALOG feature. Extending
  * CatalogSupport tests, the USE_CATALOG is turned off system-wide, however,
  * a JAXP processor may decide to use Catalog by enabling it through the factory
@@ -62,26 +61,28 @@ import org.xml.sax.InputSource;
  *
  * @author huizhe.wang@oracle.com
  */
+@TestInstance(Lifecycle.PER_CLASS)
 public class CatalogSupport4 extends CatalogSupportBase {
     /*
      * Initializing fields
      */
-    @BeforeClass
+    @BeforeAll
     public void setUpClass() throws Exception {
         setUp();
         //turn off USE_CATALOG system-wide
-        setSystemProperty(SP_USE_CATALOG, "false");
+        System.setProperty(SP_USE_CATALOG, "false");
     }
 
-    @AfterClass
+    @AfterAll
     public void tearDownClass() throws Exception {
-        clearSystemProperty(SP_USE_CATALOG);
+        System.clearProperty(SP_USE_CATALOG);
     }
 
     /*
        Verifies the Catalog support on SAXParser.
     */
-    @Test(dataProvider = "data_SAXA")
+    @ParameterizedTest
+    @MethodSource("getDataSAX")
     public void testSAXA(boolean setUseCatalog, boolean useCatalog, String catalog,
             String xml, MyHandler handler, String expected) throws Exception {
         testSAX(setUseCatalog, useCatalog, catalog, xml, handler, expected);
@@ -90,7 +91,8 @@ public class CatalogSupport4 extends CatalogSupportBase {
     /*
        Verifies the Catalog support on XMLReader.
     */
-    @Test(dataProvider = "data_SAXA")
+    @ParameterizedTest
+    @MethodSource("getDataSAX")
     public void testXMLReaderA(boolean setUseCatalog, boolean useCatalog, String catalog,
             String xml, MyHandler handler, String expected) throws Exception {
         testXMLReader(setUseCatalog, useCatalog, catalog, xml, handler, expected);
@@ -99,7 +101,8 @@ public class CatalogSupport4 extends CatalogSupportBase {
     /*
        Verifies the Catalog support on XInclude.
     */
-    @Test(dataProvider = "data_XIA")
+    @ParameterizedTest
+    @MethodSource("getDataXI")
     public void testXIncludeA(boolean setUseCatalog, boolean useCatalog, String catalog,
             String xml, MyHandler handler, String expected) throws Exception {
         testXInclude(setUseCatalog, useCatalog, catalog, xml, handler, expected);
@@ -108,7 +111,8 @@ public class CatalogSupport4 extends CatalogSupportBase {
     /*
        Verifies the Catalog support on DOM parser.
     */
-    @Test(dataProvider = "data_DOMA")
+    @ParameterizedTest
+    @MethodSource("getDataDOM")
     public void testDOMA(boolean setUseCatalog, boolean useCatalog, String catalog,
             String xml, MyHandler handler, String expected) throws Exception {
         testDOM(setUseCatalog, useCatalog, catalog, xml, handler, expected);
@@ -117,7 +121,8 @@ public class CatalogSupport4 extends CatalogSupportBase {
     /*
        Verifies the Catalog support on XMLStreamReader.
     */
-    @Test(dataProvider = "data_StAXA")
+    @ParameterizedTest
+    @MethodSource("getDataStAX")
     public void testStAXA(boolean setUseCatalog, boolean useCatalog, String catalog,
             String xml, XMLResolver resolver, String expected) throws Exception {
         testStAX(setUseCatalog, useCatalog, catalog, xml, resolver, expected);
@@ -127,7 +132,8 @@ public class CatalogSupport4 extends CatalogSupportBase {
        Verifies the Catalog support on resolving DTD, xsd import and include in
     Schema files.
     */
-    @Test(dataProvider = "data_SchemaA")
+    @ParameterizedTest
+    @MethodSource("getDataSchema")
     public void testValidationA(boolean setUseCatalog, boolean useCatalog,
             String catalog, String xsd, LSResourceResolver resolver)
             throws Exception {
@@ -139,7 +145,8 @@ public class CatalogSupport4 extends CatalogSupportBase {
        @bug 8158084 8162438 these tests also verifies the fix for 8162438
        Verifies the Catalog support on the Schema Validator.
     */
-    @Test(dataProvider = "data_ValidatorA")
+    @ParameterizedTest
+    @MethodSource("getDataValidator")
     public void testValidatorA(boolean setUseCatalog1, boolean setUseCatalog2, boolean useCatalog,
             Source source, LSResourceResolver resolver1, LSResourceResolver resolver2,
             String catalog1, String catalog2)
@@ -152,7 +159,8 @@ public class CatalogSupport4 extends CatalogSupportBase {
        Verifies the Catalog support on resolving DTD, xsl import and include in
     XSL files.
     */
-    @Test(dataProvider = "data_XSLA")
+    @ParameterizedTest
+    @MethodSource("getDataXSL")
     public void testXSLImportA(boolean setUseCatalog, boolean useCatalog, String catalog,
             SAXSource xsl, StreamSource xml, URIResolver resolver, String expected)
             throws Exception {
@@ -165,7 +173,8 @@ public class CatalogSupport4 extends CatalogSupportBase {
        Verifies the Catalog support on resolving DTD, xsl import and include in
     XSL files.
     */
-    @Test(dataProvider = "data_XSLA")
+    @ParameterizedTest
+    @MethodSource("getDataXSL")
     public void testXSLImportWTemplatesA(boolean setUseCatalog, boolean useCatalog,
             String catalog, SAXSource xsl, StreamSource xml, URIResolver resolver, String expected)
             throws Exception {
@@ -176,7 +185,6 @@ public class CatalogSupport4 extends CatalogSupportBase {
        DataProvider: for testing the SAX parser
        Data: set use_catalog, use_catalog, catalog file, xml file, handler, expected result string
      */
-    @DataProvider(name = "data_SAXA")
     public Object[][] getDataSAX() {
         return new Object[][]{
             {true, true, xml_catalog, xml_system, new MyHandler(elementInSystem), expectedWCatalog},
@@ -187,7 +195,6 @@ public class CatalogSupport4 extends CatalogSupportBase {
        DataProvider: for testing XInclude
        Data: set use_catalog, use_catalog, catalog file, xml file, handler, expected result string
      */
-    @DataProvider(name = "data_XIA")
     public Object[][] getDataXI() {
         return new Object[][]{
             {true, true, xml_catalog, xml_xInclude, new MyHandler(elementInXISimple), contentInUIutf8Catalog},
@@ -198,7 +205,6 @@ public class CatalogSupport4 extends CatalogSupportBase {
        DataProvider: for testing DOM parser
        Data: set use_catalog, use_catalog, catalog file, xml file, handler, expected result string
      */
-    @DataProvider(name = "data_DOMA")
     public Object[][] getDataDOM() {
         return new Object[][]{
             {true, true, xml_catalog, xml_system, new MyHandler(elementInSystem), expectedWCatalog},
@@ -209,7 +215,6 @@ public class CatalogSupport4 extends CatalogSupportBase {
        DataProvider: for testing the StAX parser
        Data: set use_catalog, use_catalog, catalog file, xml file, handler, expected result string
      */
-    @DataProvider(name = "data_StAXA")
     public Object[][] getDataStAX() {
 
         return new Object[][]{
@@ -217,15 +222,10 @@ public class CatalogSupport4 extends CatalogSupportBase {
         };
     }
 
-    MyEntityHandler getMyEntityHandler(String elementName, String[] systemIds, InputSource... returnValues) {
-       return new MyEntityHandler(systemIds, returnValues, elementName);
-    }
-
     /*
        DataProvider: for testing Schema validation
        Data: set use_catalog, use_catalog, catalog file, xsd file, a LSResourceResolver
      */
-    @DataProvider(name = "data_SchemaA")
     public Object[][] getDataSchema() {
         return new Object[][]{
             // for resolving DTD in xsd
@@ -241,7 +241,6 @@ public class CatalogSupport4 extends CatalogSupportBase {
        DataProvider: for testing Schema Validator
        Data: source, resolver1, resolver2, catalog1, a catalog2
      */
-    @DataProvider(name = "data_ValidatorA")
     public Object[][] getDataValidator() {
         DOMSource ds = getDOMSource(xml_val_test, xml_val_test_id, true, true, xml_catalog);
 
@@ -270,7 +269,6 @@ public class CatalogSupport4 extends CatalogSupportBase {
        DataProvider: for testing XSL import and include
        Data: set use_catalog, use_catalog, catalog file, xsl file, xml file, a URIResolver, expected result
      */
-    @DataProvider(name = "data_XSLA")
     public Object[][] getDataXSL() {
         // XSLInclude.xsl has one import XSLImport_html.xsl and two includes,
         // XSLInclude_header.xsl and XSLInclude_footer.xsl;
diff --git a/test/jaxp/javax/xml/jaxp/unittest/catalog/CatalogSupport5.java b/test/jaxp/javax/xml/jaxp/unittest/catalog/CatalogSupport5.java
index 564848e2e1a..9a09fb9a45e 100644
--- a/test/jaxp/javax/xml/jaxp/unittest/catalog/CatalogSupport5.java
+++ b/test/jaxp/javax/xml/jaxp/unittest/catalog/CatalogSupport5.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2016, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2016, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,8 +23,15 @@
 
 package catalog;
 
-import java.io.File;
-import java.io.StringReader;
+import org.junit.jupiter.api.BeforeAll;
+import org.junit.jupiter.api.TestInstance;
+import org.junit.jupiter.api.TestInstance.Lifecycle;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
+import org.w3c.dom.ls.LSResourceResolver;
+import org.xml.sax.InputSource;
+import org.xml.sax.SAXException;
+
 import javax.xml.stream.XMLResolver;
 import javax.xml.stream.XMLStreamException;
 import javax.xml.transform.Source;
@@ -34,19 +41,16 @@ import javax.xml.transform.dom.DOMSource;
 import javax.xml.transform.sax.SAXSource;
 import javax.xml.transform.stax.StAXSource;
 import javax.xml.transform.stream.StreamSource;
-import org.testng.annotations.AfterClass;
-import org.testng.annotations.BeforeClass;
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
-import org.w3c.dom.ls.LSResourceResolver;
-import org.xml.sax.InputSource;
-import org.xml.sax.SAXException;
+import java.io.File;
+import java.io.StringReader;
+
+import static org.junit.jupiter.api.Assertions.assertThrows;
 
 /*
  * @test
  * @bug 8158084 8163232 8166220
  * @library /javax/xml/jaxp/libs /javax/xml/jaxp/unittest
- * @run testng/othervm catalog.CatalogSupport5
+ * @run junit/othervm catalog.CatalogSupport5
  * @summary extends CatalogSupport tests, verifies that when errors occur,
  * relevant checked Exceptions are returned.
  */
@@ -58,12 +62,13 @@ import org.xml.sax.SAXException;
  *
  * @author huizhe.wang@oracle.com
  */
+@TestInstance(Lifecycle.PER_CLASS)
 public class CatalogSupport5 extends CatalogSupportBase {
 
     /*
      * Initializing fields
      */
-    @BeforeClass
+    @BeforeAll
     public void setUpClass() throws Exception {
         setUp();
     }
@@ -72,77 +77,98 @@ public class CatalogSupport5 extends CatalogSupportBase {
     /*
        Verifies the Catalog support on SAXParser.
     */
-    @Test(dataProvider = "data_SAXC", expectedExceptions = SAXException.class)
+    @ParameterizedTest
+    @MethodSource("getDataSAXC")
     public void testSAXC(boolean setUseCatalog, boolean useCatalog, String catalog, String
-            xml, MyHandler handler, String expected) throws Exception {
-        testSAX(setUseCatalog, useCatalog, catalog, xml, handler, expected);
+            xml, MyHandler handler, String expected) {
+        assertThrows(
+                SAXException.class,
+                () -> testSAX(setUseCatalog, useCatalog, catalog, xml, handler, expected));
     }
 
     /*
        Verifies the Catalog support on XMLReader.
     */
-    @Test(dataProvider = "data_SAXC", expectedExceptions = SAXException.class)
+    @ParameterizedTest
+    @MethodSource("getDataSAXC")
     public void testXMLReaderC(boolean setUseCatalog, boolean useCatalog, String catalog,
-            String xml, MyHandler handler, String expected) throws Exception {
-        testXMLReader(setUseCatalog, useCatalog, catalog, xml, handler, expected);
+                               String xml, MyHandler handler, String expected) {
+        assertThrows(
+                SAXException.class,
+                () -> testXMLReader(setUseCatalog, useCatalog, catalog, xml, handler, expected));
     }
 
     /*
        Verifies the Catalog support on XInclude.
     */
-    @Test(dataProvider = "data_XIC", expectedExceptions = SAXException.class)
+    @ParameterizedTest
+    @MethodSource("getDataXIC")
     public void testXIncludeC(boolean setUseCatalog, boolean useCatalog, String catalog,
-            String xml, MyHandler handler, String expected) throws Exception {
-        testXInclude(setUseCatalog, useCatalog, catalog, xml, handler, expected);
+                              String xml, MyHandler handler, String expected) {
+        assertThrows(
+                SAXException.class,
+                () -> testXInclude(setUseCatalog, useCatalog, catalog, xml, handler, expected));
     }
 
     /*
        Verifies the Catalog support on DOM parser.
     */
-    @Test(dataProvider = "data_DOMC", expectedExceptions = SAXException.class)
+    @ParameterizedTest
+    @MethodSource("getDataDOMC")
     public void testDOMC(boolean setUseCatalog, boolean useCatalog, String catalog,
-            String xml, MyHandler handler, String expected) throws Exception {
-        testDOM(setUseCatalog, useCatalog, catalog, xml, handler, expected);
+                         String xml, MyHandler handler, String expected) {
+        assertThrows(
+                SAXException.class,
+                () -> testDOM(setUseCatalog, useCatalog, catalog, xml, handler, expected));
     }
 
     /*
        Verifies the Catalog support on XMLStreamReader.
     */
-    @Test(dataProvider = "data_StAXC", expectedExceptions = XMLStreamException.class)
+    @ParameterizedTest
+    @MethodSource("getDataStAX")
     public void testStAXC(boolean setUseCatalog, boolean useCatalog, String catalog,
-            String xml, XMLResolver resolver, String expected) throws Exception {
-        testStAX(setUseCatalog, useCatalog, catalog, xml, resolver, expected);
+                          String xml, XMLResolver resolver, String expected) {
+        assertThrows(
+                XMLStreamException.class,
+                () -> testStAX(setUseCatalog, useCatalog, catalog, xml, resolver, expected));
     }
 
     /*
        Verifies the Catalog support on resolving DTD, xsd import and include in
     Schema files.
     */
-    @Test(dataProvider = "data_SchemaC", expectedExceptions = SAXException.class)
+    @ParameterizedTest
+    @MethodSource("getDataSchemaC")
     public void testValidationC(boolean setUseCatalog, boolean useCatalog, String catalog,
-            String xsd, LSResourceResolver resolver)
-            throws Exception {
-        testValidation(setUseCatalog, useCatalog, catalog, xsd, resolver) ;
+                                String xsd, LSResourceResolver resolver) {
+        assertThrows(
+                SAXException.class,
+                () -> testValidation(setUseCatalog, useCatalog, catalog, xsd, resolver));
     }
 
-    @Test(dataProvider = "data_ValidatorC", expectedExceptions = SAXException.class)
+    @ParameterizedTest
+    @MethodSource("getDataValidator")
     public void testValidatorC(boolean setUseCatalog1, boolean setUseCatalog2, boolean useCatalog,
-            Source source, LSResourceResolver resolver1, LSResourceResolver resolver2,
-            String catalog1, String catalog2)
-            throws Exception {
-        testValidator(setUseCatalog1, setUseCatalog2, useCatalog, source,
-                resolver1, resolver2, catalog1, catalog2);
+                               Source source, LSResourceResolver resolver1, LSResourceResolver resolver2,
+                               String catalog1, String catalog2) {
+        assertThrows(
+                SAXException.class,
+                () -> testValidator(setUseCatalog1, setUseCatalog2, useCatalog, source, resolver1, resolver2, catalog1, catalog2));
     }
 
     /*
        Verifies the Catalog support on resolving DTD, xsl import and include in
     XSL files.
     */
-    @Test(dataProvider = "data_XSLC", expectedExceptions = TransformerException.class)
+    @ParameterizedTest
+    @MethodSource("getDataXSLC")
     public void testXSLImportC(boolean setUseCatalog, boolean useCatalog, String catalog,
             SAXSource xsl, StreamSource xml, URIResolver resolver, String expected) throws Exception {
 
-        testXSLImport(setUseCatalog, useCatalog, catalog, xsl, xml, resolver, expected);
+        assertThrows(
+                TransformerException.class,
+                () -> testXSLImport(setUseCatalog, useCatalog, catalog, xsl, xml, resolver, expected));
     }
 
     /*
@@ -150,17 +176,19 @@ public class CatalogSupport5 extends CatalogSupportBase {
        Verifies the Catalog support on resolving DTD, xsl import and include in
     XSL files.
     */
-    @Test(dataProvider = "data_XSLC", expectedExceptions = TransformerException.class)
+    @ParameterizedTest
+    @MethodSource("getDataXSLC")
     public void testXSLImportWTemplatesC(boolean setUseCatalog, boolean useCatalog, String catalog,
-            SAXSource xsl, StreamSource xml, URIResolver resolver, String expected) throws Exception {
-        testXSLImportWTemplates(setUseCatalog, useCatalog, catalog, xsl, xml, resolver, expected);
+                                         SAXSource xsl, StreamSource xml, URIResolver resolver, String expected) throws Exception {
+        assertThrows(
+                TransformerException.class,
+                () -> testXSLImportWTemplates(setUseCatalog, useCatalog, catalog, xsl, xml, resolver, expected));
     }
 
     /*
        DataProvider: for testing the SAX parser
        Data: set use_catalog, use_catalog, catalog file, xml file, handler, expected result string
      */
-    @DataProvider(name = "data_SAXC")
     public Object[][] getDataSAXC() {
         return new Object[][]{
             {false, true, xml_bogus_catalog, xml_system, new MyHandler(elementInSystem), expectedWCatalog}
@@ -172,7 +200,6 @@ public class CatalogSupport5 extends CatalogSupportBase {
        DataProvider: for testing XInclude
        Data: set use_catalog, use_catalog, catalog file, xml file, handler, expected result string
      */
-    @DataProvider(name = "data_XIC")
     public Object[][] getDataXIC() {
         return new Object[][]{
             {false, true, xml_bogus_catalog, xml_xInclude, new MyHandler(elementInXISimple), contentInUIutf8Catalog},
@@ -183,7 +210,6 @@ public class CatalogSupport5 extends CatalogSupportBase {
        DataProvider: for testing DOM parser
        Data: set use_catalog, use_catalog, catalog file, xml file, handler, expected result string
      */
-    @DataProvider(name = "data_DOMC")
     public Object[][] getDataDOMC() {
         return new Object[][]{
             {false, true, xml_bogus_catalog, xml_system, new MyHandler(elementInSystem), expectedWCatalog}
@@ -194,7 +220,6 @@ public class CatalogSupport5 extends CatalogSupportBase {
        DataProvider: for testing the StAX parser
        Data: set use_catalog, use_catalog, catalog file, xml file, handler, expected result string
      */
-    @DataProvider(name = "data_StAXC")
     public Object[][] getDataStAX() {
 
         return new Object[][]{
@@ -206,7 +231,6 @@ public class CatalogSupport5 extends CatalogSupportBase {
        DataProvider: for testing Schema validation
        Data: set use_catalog, use_catalog, catalog file, xsd file, a LSResourceResolver
      */
-    @DataProvider(name = "data_SchemaC")
     public Object[][] getDataSchemaC() {
 
         return new Object[][]{
@@ -224,7 +248,6 @@ public class CatalogSupport5 extends CatalogSupportBase {
        Data: setUseCatalog1, setUseCatalog2, useCatalog, source, resolver1, resolver2,
              catalog1, catalog2
      */
-    @DataProvider(name = "data_ValidatorC")
     public Object[][] getDataValidator() {
         DOMSource ds = getDOMSource(xml_val_test, xml_val_test_id, true, true, xml_catalog);
 
@@ -253,7 +276,6 @@ public class CatalogSupport5 extends CatalogSupportBase {
        DataProvider: for testing XSL import and include
        Data: set use_catalog, use_catalog, catalog file, xsl file, xml file, a URIResolver, expected
      */
-    @DataProvider(name = "data_XSLC")
     public Object[][] getDataXSLC() {
         SAXSource xslSourceDTD = new SAXSource(new InputSource(new StringReader(xsl_includeDTD)));
         StreamSource xmlSourceDTD = new StreamSource(new StringReader(xml_xslDTD));
diff --git a/test/jaxp/javax/xml/jaxp/unittest/catalog/CatalogSupportBase.java b/test/jaxp/javax/xml/jaxp/unittest/catalog/CatalogSupportBase.java
index faa260b275e..52d0ccc8ce4 100644
--- a/test/jaxp/javax/xml/jaxp/unittest/catalog/CatalogSupportBase.java
+++ b/test/jaxp/javax/xml/jaxp/unittest/catalog/CatalogSupportBase.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2016, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2016, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,25 +23,17 @@
 
 package catalog;
 
-import static jaxp.library.JAXPTestUtilities.getSystemProperty;
+import org.w3c.dom.Document;
+import org.w3c.dom.Node;
+import org.w3c.dom.ls.LSInput;
+import org.w3c.dom.ls.LSResourceResolver;
+import org.xml.sax.Attributes;
+import org.xml.sax.ErrorHandler;
+import org.xml.sax.InputSource;
+import org.xml.sax.SAXException;
+import org.xml.sax.XMLReader;
+import org.xml.sax.ext.DefaultHandler2;
 
-import java.io.ByteArrayInputStream;
-import java.io.File;
-import java.io.FileInputStream;
-import java.io.FileNotFoundException;
-import java.io.IOException;
-import java.io.InputStream;
-import java.io.Reader;
-import java.io.StringReader;
-import java.io.StringWriter;
-import java.io.UnsupportedEncodingException;
-import java.nio.file.Paths;
-import java.security.CodeSource;
-import java.security.Permission;
-import java.security.PermissionCollection;
-import java.security.Permissions;
-import java.security.Policy;
-import java.security.ProtectionDomain;
 import javax.xml.XMLConstants;
 import javax.xml.catalog.CatalogFeatures;
 import javax.xml.catalog.CatalogResolver;
@@ -68,17 +60,26 @@ import javax.xml.transform.stream.StreamSource;
 import javax.xml.validation.Schema;
 import javax.xml.validation.SchemaFactory;
 import javax.xml.validation.Validator;
-import org.testng.Assert;
-import org.w3c.dom.Document;
-import org.w3c.dom.Node;
-import org.w3c.dom.ls.LSInput;
-import org.w3c.dom.ls.LSResourceResolver;
-import org.xml.sax.Attributes;
-import org.xml.sax.ErrorHandler;
-import org.xml.sax.InputSource;
-import org.xml.sax.SAXException;
-import org.xml.sax.XMLReader;
-import org.xml.sax.ext.DefaultHandler2;
+import java.io.ByteArrayInputStream;
+import java.io.File;
+import java.io.FileInputStream;
+import java.io.FileNotFoundException;
+import java.io.IOException;
+import java.io.InputStream;
+import java.io.Reader;
+import java.io.StringReader;
+import java.io.StringWriter;
+import java.io.UnsupportedEncodingException;
+import java.nio.file.Paths;
+import java.security.CodeSource;
+import java.security.Permission;
+import java.security.PermissionCollection;
+import java.security.Permissions;
+import java.security.Policy;
+import java.security.ProtectionDomain;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertTrue;
 
 /**
  * Base class:
@@ -99,7 +100,7 @@ public class CatalogSupportBase {
 
     protected void setUp() {
         String file1 = getClass().getResource("CatalogSupport.xml").getFile();
-        if (getSystemProperty("os.name").contains("Windows")) {
+        if (System.getProperty("os.name").contains("Windows")) {
             filepath = file1.substring(1, file1.lastIndexOf("/") + 1);
             slash = "/";
         } else {
@@ -285,7 +286,7 @@ public class CatalogSupportBase {
         SAXParser parser = getSAXParser(setUseCatalog, useCatalog, catalog);
 
         parser.parse(xml, handler);
-        Assert.assertEquals(handler.getResult().trim(), expected);
+        assertEquals(expected, handler.getResult().trim());
     }
 
     /*
@@ -298,7 +299,7 @@ public class CatalogSupportBase {
         reader.setContentHandler(handler);
         reader.setEntityResolver(handler);
         reader.parse(xml);
-        Assert.assertEquals(handler.getResult().trim(), expected);
+        assertEquals(expected, handler.getResult().trim());
     }
 
     /*
@@ -312,7 +313,7 @@ public class CatalogSupportBase {
         // is thrown if handler == null.
         if (handler != null) {
             debugPrint("handler.result:" + handler.getResult());
-            Assert.assertEquals(handler.getResult().trim(), expected);
+            assertEquals(expected, handler.getResult().trim());
         }
     }
 
@@ -327,7 +328,7 @@ public class CatalogSupportBase {
 
         Node node = doc.getElementsByTagName(elementInSystem).item(0);
         String result = node.getFirstChild().getTextContent();
-        Assert.assertEquals(result.trim(), expected);
+        assertEquals(expected, result.trim());
     }
 
     /*
@@ -336,10 +337,10 @@ public class CatalogSupportBase {
     public void testStAX(boolean setUseCatalog, boolean useCatalog, String catalog,
             String xml, XMLResolver resolver, String expected) throws Exception {
 
-            XMLStreamReader streamReader = getStreamReader(
-                    setUseCatalog, useCatalog, catalog, xml, resolver);
-            String text = getText(streamReader, XMLStreamConstants.CHARACTERS);
-            Assert.assertEquals(text.trim(), expected);
+        XMLStreamReader streamReader = getStreamReader(
+                setUseCatalog, useCatalog, catalog, xml, resolver);
+        String text = getText(streamReader, XMLStreamConstants.CHARACTERS);
+        assertEquals(expected, text.trim());
     }
 
     /*
@@ -349,10 +350,10 @@ public class CatalogSupportBase {
     public void testStAXNegative(boolean setUseCatalog, boolean useCatalog, String catalog,
             String xml, XMLResolver resolver, String expected) throws Exception {
 
-            XMLStreamReader streamReader = getStreamReader(
-                    setUseCatalog, useCatalog, catalog, xml, resolver);
-            String text = getText(streamReader, XMLStreamConstants.ENTITY_REFERENCE);
-            Assert.assertEquals(text.trim(), expected);
+        XMLStreamReader streamReader = getStreamReader(
+                setUseCatalog, useCatalog, catalog, xml, resolver);
+        String text = getText(streamReader, XMLStreamConstants.ENTITY_REFERENCE);
+        assertEquals(expected, text.trim());
     }
 
     /*
@@ -381,7 +382,6 @@ public class CatalogSupportBase {
         } else {
             Schema schema = factory.newSchema(new StreamSource(new StringReader(xsd)));
         }
-        success("XMLSchema.dtd and datatypes.dtd are resolved.");
     }
 
     /**
@@ -439,8 +439,7 @@ public class CatalogSupportBase {
 
         StringWriter out = new StringWriter();
         transformer.transform(xml, new StreamResult(out));
-        debugPrint("out:\n" + out.toString());
-        Assert.assertTrue(out.toString().contains(expected), "testXSLImport");
+        assertTrue(out.toString().contains(expected), "Output did not contain '" + expected + "':\n" + out);
     }
 
     /*
@@ -455,7 +454,7 @@ public class CatalogSupportBase {
         Transformer transformer = factory.newTemplates(xsl).newTransformer();
         StringWriter out = new StringWriter();
         transformer.transform(xml, new StreamResult(out));
-        Assert.assertTrue(out.toString().contains(expected), "testXSLImportWTemplates");
+        assertTrue(out.toString().contains(expected), "Output did not contain '" + expected + "':\n" + out);
     }
 
     /**
@@ -688,16 +687,6 @@ public class CatalogSupportBase {
         return factory;
     }
 
-    void fail(String msg) {
-        System.out.println("Test failed:");
-        System.out.println(msg);
-    }
-
-    void success(String msg) {
-        System.out.println("Test succeded:");
-        System.out.println(msg);
-    }
-
     void debugPrint(String msg) {
         if (debug) {
             System.out.println(msg);
diff --git a/test/jaxp/javax/xml/jaxp/unittest/catalog/CatalogTest.java b/test/jaxp/javax/xml/jaxp/unittest/catalog/CatalogTest.java
index 0c0e77bb952..1b2086f67b3 100644
--- a/test/jaxp/javax/xml/jaxp/unittest/catalog/CatalogTest.java
+++ b/test/jaxp/javax/xml/jaxp/unittest/catalog/CatalogTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2015, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2015, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -22,14 +22,19 @@
  */
 package catalog;
 
-import java.io.File;
-import java.io.FileInputStream;
-import java.io.IOException;
-import java.io.InputStream;
-import java.io.StringReader;
-import java.io.StringWriter;
-import java.net.URI;
-import java.nio.file.Paths;
+import org.junit.jupiter.api.BeforeAll;
+import org.junit.jupiter.api.Test;
+import org.junit.jupiter.api.TestInstance;
+import org.junit.jupiter.api.TestInstance.Lifecycle;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
+import org.xml.sax.Attributes;
+import org.xml.sax.ErrorHandler;
+import org.xml.sax.InputSource;
+import org.xml.sax.SAXException;
+import org.xml.sax.XMLReader;
+import org.xml.sax.ext.DefaultHandler2;
+
 import javax.xml.XMLConstants;
 import javax.xml.catalog.Catalog;
 import javax.xml.catalog.CatalogException;
@@ -52,26 +57,29 @@ import javax.xml.transform.stream.StreamSource;
 import javax.xml.validation.Schema;
 import javax.xml.validation.SchemaFactory;
 import javax.xml.validation.Validator;
-import static jaxp.library.JAXPTestUtilities.clearSystemProperty;
-import static jaxp.library.JAXPTestUtilities.setSystemProperty;
-import org.testng.Assert;
-import org.testng.annotations.BeforeClass;
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
-import org.xml.sax.Attributes;
-import org.xml.sax.ErrorHandler;
-import org.xml.sax.InputSource;
-import org.xml.sax.SAXException;
-import org.xml.sax.XMLReader;
-import org.xml.sax.ext.DefaultHandler2;
+import java.io.File;
+import java.io.FileInputStream;
+import java.io.InputStream;
+import java.io.StringReader;
+import java.io.StringWriter;
+import java.net.URI;
+import java.nio.file.Paths;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertFalse;
+import static org.junit.jupiter.api.Assertions.assertNotNull;
+import static org.junit.jupiter.api.Assertions.assertNull;
+import static org.junit.jupiter.api.Assertions.assertThrows;
+import static org.junit.jupiter.api.Assertions.assertTrue;
 
 /*
  * @test
  * @bug 8081248 8144966 8146606 8146237 8150969 8151162 8152527 8154220 8163232
  * @library /javax/xml/jaxp/libs /javax/xml/jaxp/unittest
- * @run testng/othervm catalog.CatalogTest
+ * @run junit/othervm catalog.CatalogTest
  * @summary Tests basic Catalog functions.
  */
+@TestInstance(Lifecycle.PER_CLASS)
 public class CatalogTest extends CatalogSupportBase {
     static final String KEY_FILES = "javax.xml.catalog.files";
 
@@ -79,7 +87,7 @@ public class CatalogTest extends CatalogSupportBase {
     /*
      * Initializing fields
      */
-    @BeforeClass
+    @BeforeAll
     public void setUpClass() throws Exception {
         super.setUp();
     }
@@ -98,8 +106,9 @@ public class CatalogTest extends CatalogSupportBase {
     /*
      * Verifies the support for org.xml.sax.EntityResolver.
      * Expected: the parser returns the expected string.
-    */
-    @Test(dataProvider = "supportXMLResolver")
+     */
+    @ParameterizedTest
+    @MethodSource("supportXMLResolver")
     public void supportEntityResolver(URI catalogFile, String xml, String expected) throws Exception {
         String xmlSource = getClass().getResource(xml).getFile();
 
@@ -108,14 +117,15 @@ public class CatalogTest extends CatalogSupportBase {
         SAXParser parser = getSAXParser(false, true, null);
         parser.parse(xmlSource, handler);
 
-        Assert.assertEquals(handler.getResult().trim(), expected);
+        assertEquals(expected, handler.getResult().trim());
     }
 
     /*
      * Verifies the support for javax.xml.stream.XMLResolver.
      * Expected: the parser returns the expected string.
-    */
-    @Test(dataProvider = "supportXMLResolver")
+     */
+    @ParameterizedTest
+    @MethodSource("supportXMLResolver")
     public void supportXMLResolver(URI catalogFile, String xml, String expected) throws Exception {
         String xmlSource = getClass().getResource(xml).getFile();
 
@@ -140,15 +150,16 @@ public class CatalogTest extends CatalogSupportBase {
         }
         System.out.println(": expected [" + expected + "] <> actual [" + result.trim() + "]");
 
-        Assert.assertEquals(result.trim(), expected);
+        assertEquals(expected, result.trim());
     }
 
     /*
      * Verifies the support for org.w3c.dom.ls.LSResourceResolver by ShemaFactory.
      * Success: parsing goes through with no error
      * Fail: throws Exception if references are not resolved (by the CatalogResolver)
-    */
-    @Test(dataProvider = "supportLSResourceResolver")
+     */
+    @ParameterizedTest
+    @MethodSource("supportLSResourceResolver")
     public void supportLSResourceResolver(URI catalogFile, Source schemaSource) throws SAXException {
 
         CatalogResolver cr = CatalogManager.catalogResolver(CatalogFeatures.defaults(), catalogFile);
@@ -163,8 +174,9 @@ public class CatalogTest extends CatalogSupportBase {
      * Verifies the support for org.w3c.dom.ls.LSResourceResolver by Validator.
      * Success: parsing goes through with no error
      * Fail: throws Exception if references are not resolved (by the CatalogResolver)
-    */
-    @Test(dataProvider = "supportLSResourceResolver1")
+     */
+    @ParameterizedTest
+    @MethodSource("supportLSResourceResolver1")
     public void supportLSResourceResolver1(URI catalogFile, Source source) throws Exception {
 
         CatalogResolver cr = CatalogManager.catalogResolver(CatalogFeatures.defaults(), catalogFile);
@@ -179,20 +191,21 @@ public class CatalogTest extends CatalogSupportBase {
      * Verifies the support for javax.xml.transform.URIResolver.
      * Success: parsing goes through with no error
      * Fail: throws Exception if references are not resolved (by the CatalogResolver)
-    */
-    @Test(dataProvider = "supportURIResolver")
+     */
+    @ParameterizedTest
+    @MethodSource("supportURIResolver")
     public void supportURIResolver(URI catalogFile, Source xsl, Source xml, String expected) throws Exception {
 
         CatalogResolver cr = CatalogManager.catalogResolver(CatalogFeatures.defaults(), catalogFile);
 
-            TransformerFactory factory = TransformerFactory.newInstance();
-            factory.setURIResolver(cr);
-            Transformer transformer = factory.newTransformer(xsl);
-            StringWriter out = new StringWriter();
-            transformer.transform(xml, new StreamResult(out));
-            if (expected != null) {
-                Assert.assertTrue(out.toString().contains(expected), "supportURIResolver");
-            }
+        TransformerFactory factory = TransformerFactory.newInstance();
+        factory.setURIResolver(cr);
+        Transformer transformer = factory.newTransformer(xsl);
+        StringWriter out = new StringWriter();
+        transformer.transform(xml, new StreamResult(out));
+        if (expected != null) {
+            assertTrue(out.toString().contains(expected), "supportURIResolver");
+        }
     }
 
     /*
@@ -200,7 +213,6 @@ public class CatalogTest extends CatalogSupportBase {
         Data columns:
         catalog filepath, xml source file, expected result
      */
-    @DataProvider(name = "supportXMLResolver")
     public Object[][] supportXMLResolver() throws Exception {
         URI catalogFile = getClass().getResource("catalog.xml").toURI();
         URI catalogFileUri = getClass().getResource("catalog_uri.xml").toURI();
@@ -228,7 +240,6 @@ public class CatalogTest extends CatalogSupportBase {
         Data columns:
         catalog filepath, schema source file
      */
-    @DataProvider(name = "supportLSResourceResolver")
     public Object[][] supportLSResourceResolver() throws Exception {
         URI catalogFile = getClass().getResource("CatalogSupport.xml").toURI();
         URI catalogFileUri = getClass().getResource("CatalogSupport_uri.xml").toURI();
@@ -252,7 +263,6 @@ public class CatalogTest extends CatalogSupportBase {
         Data columns:
         catalog filepath, source file
      */
-    @DataProvider(name = "supportLSResourceResolver1")
     public Object[][] supportLSResourceResolver1() throws Exception {
         URI catalogFile = getClass().getResource("CatalogSupport.xml").toURI();
         URI catalogFileUri = getClass().getResource("CatalogSupport_uri.xml").toURI();
@@ -275,7 +285,6 @@ public class CatalogTest extends CatalogSupportBase {
         Data columns:
         catalog filepath, xsl source, xml source file
      */
-    @DataProvider(name = "supportURIResolver")
     public Object[][] supportURIResolver() throws Exception {
         URI catalogFile = getClass().getResource("CatalogSupport.xml").toURI();
         URI catalogFileUri = getClass().getResource("CatalogSupport_uri.xml").toURI();
@@ -303,10 +312,12 @@ public class CatalogTest extends CatalogSupportBase {
      * requires a system identifier on all external entities, so this value is
      * always specified.
      */
-    @Test(expectedExceptions = NullPointerException.class)
+    @Test
     public void sysIdCantBeNull() {
         CatalogResolver catalogResolver = CatalogManager.catalogResolver(CatalogFeatures.defaults());
-        InputSource is = catalogResolver.resolveEntity("-//FOO//DTD XML Dummy V0.0//EN", null);
+        assertThrows(
+                NullPointerException.class,
+                () -> catalogResolver.resolveEntity("-//FOO//DTD XML Dummy V0.0//EN", null));
     }
 
     /*
@@ -318,14 +329,15 @@ public class CatalogTest extends CatalogSupportBase {
      * copying the JCK test and its dataProvider. This test may be reused for
      * other cases in that test.
      */
-    @Test(dataProvider = "resolveUri")
+    @ParameterizedTest
+    @MethodSource("getDataForUriResolver")
     public void testMatch1(String cFile, String href, String expectedFile,
             String expectedUri, String msg) throws Exception {
         URI catalogFile = getClass().getResource(cFile).toURI();
         CatalogResolver cur = CatalogManager.catalogResolver(CatalogFeatures.defaults(), catalogFile);
         Source source = cur.resolve(href, null);
-        Assert.assertNotNull(source, "Source returned is null");
-        Assert.assertEquals(expectedUri, source.getSystemId(), msg);
+        assertNotNull(source, "Source returned is null");
+        assertEquals(expectedUri, source.getSystemId(), msg);
     }
 
     /*
@@ -333,20 +345,21 @@ public class CatalogTest extends CatalogSupportBase {
      * Verifies that the file input is validated properly. Valid input includes
      * multiple file paths separated by semicolon.
      */
-    @Test(dataProvider = "hierarchyOfCatFilesData")
+    @ParameterizedTest
+    @MethodSource("getHierarchyOfCatFilesData")
     public void hierarchyOfCatFiles2(String systemId, String expectedUri) {
         String file1 = getClass().getResource("first_cat.xml").toExternalForm();
         String file2 = getClass().getResource("second_cat.xml").toExternalForm();
         String files = file1 + ";" + file2;
 
         try {
-            setSystemProperty(KEY_FILES, files);
+            System.setProperty(KEY_FILES, files);
             CatalogResolver catalogResolver = CatalogManager.catalogResolver(CatalogFeatures.defaults());
-            String sysId = catalogResolver.resolveEntity(null, systemId).getSystemId();
-            Assert.assertEquals(sysId, Paths.get(filepath + expectedUri).toUri().toString().replace("///", "/"),
-                    "System ID match not right");
+            String actualSysId = catalogResolver.resolveEntity(null, systemId).getSystemId();
+            String expectedSysId = Paths.get(filepath + expectedUri).toUri().toString().replace("///", "/");
+            assertEquals(expectedSysId, actualSysId, "System ID match not right");
         } finally {
-            clearSystemProperty(KEY_FILES);
+            System.clearProperty(KEY_FILES);
         }
 
     }
@@ -357,16 +370,17 @@ public class CatalogTest extends CatalogSupportBase {
      * Verifies that the CatalogResolver resolves a publicId and/or systemId as
      * expected.
      */
-    @Test(dataProvider = "resolveEntity")
+    @ParameterizedTest
+    @MethodSource("getDataForMatchingBothIds")
     public void testMatch1(String cfile, String prefer, String sysId, String pubId,
             String expectedUri, String expectedFile, String msg) throws Exception {
         URI catalogFile = getClass().getResource(cfile).toURI();
         CatalogFeatures features = CatalogFeatures.builder().with(CatalogFeatures.Feature.PREFER, prefer).build();
         CatalogResolver catalogResolver = CatalogManager.catalogResolver(features, catalogFile);
         InputSource is = catalogResolver.resolveEntity(pubId, sysId);
-        Assert.assertNotNull(is, msg);
+        assertNotNull(is, msg);
         String expected = (expectedUri == null) ? expectedFile : expectedUri;
-        Assert.assertEquals(expected, is.getSystemId(), msg);
+        assertEquals(expected, is.getSystemId(), msg);
     }
 
     /*
@@ -374,7 +388,8 @@ public class CatalogTest extends CatalogSupportBase {
      * Verifies that the Catalog matches specified publicId or systemId and returns
      * results as expected.
      */
-    @Test(dataProvider = "matchWithPrefer")
+    @ParameterizedTest
+    @MethodSource("getDataForMatch")
     public void matchWithPrefer(String prefer, String cfile, String publicId,
             String systemId, String expected) throws Exception {
         URI catalogFile = getClass().getResource(cfile).toURI();
@@ -387,7 +402,7 @@ public class CatalogTest extends CatalogSupportBase {
         } else {
             result = c.matchSystem(systemId);
         }
-        Assert.assertEquals(expected, result);
+        assertEquals(expected, result);
     }
 
     /*
@@ -401,7 +416,8 @@ public class CatalogTest extends CatalogSupportBase {
      *                  attempts to resolve with a public entry if no matching
      *                  system entry is found.
      */
-    @Test(dataProvider = "resolveWithPrefer")
+    @ParameterizedTest
+    @MethodSource("getDataForResolve")
     public void resolveWithPrefer(String prefer, String cfile, String publicId,
             String systemId, String expected) throws Exception {
         URI catalogFile = getClass().getResource(cfile).toURI();
@@ -411,7 +427,7 @@ public class CatalogTest extends CatalogSupportBase {
                 .build();
         CatalogResolver catalogResolver = CatalogManager.catalogResolver(f, catalogFile);
         String result = catalogResolver.resolveEntity(publicId, systemId).getSystemId();
-        Assert.assertEquals(expected, result);
+        assertEquals(expected, result);
     }
 
     /**
@@ -420,7 +436,8 @@ public class CatalogTest extends CatalogSupportBase {
      * over other settings, in which case, whether next and delegate Catalogs will
      * be loaded is determined by the defer attribute.
      */
-    @Test(dataProvider = "invalidAltCatalogs", expectedExceptions = CatalogException.class)
+    @ParameterizedTest
+    @MethodSource("getInvalidAltCatalogs")
     public void testDeferAltCatalogs(String file) throws Exception {
         URI catalogFile = getClass().getResource(file).toURI();
         CatalogFeatures features = CatalogFeatures.builder().
@@ -431,7 +448,7 @@ public class CatalogTest extends CatalogSupportBase {
           the parent catalog will try to load the alt catalog, which will fail
           since it points to an invalid catalog.
         */
-        Catalog catalog = CatalogManager.catalog(features, catalogFile);
+        assertThrows(CatalogException.class, () -> CatalogManager.catalog(features, catalogFile));
     }
 
 
@@ -443,22 +460,17 @@ public class CatalogTest extends CatalogSupportBase {
     public void testJDK8146237() throws Exception {
         URI catalogFile = getClass().getResource("JDK8146237_catalog.xml").toURI();
 
-        try {
-            CatalogFeatures features = CatalogFeatures.builder()
-                    .with(CatalogFeatures.Feature.PREFER, "system")
-                    .build();
-            Catalog catalog = CatalogManager.catalog(features, catalogFile);
-            CatalogResolver catalogResolver = CatalogManager.catalogResolver(catalog);
-            String actualSystemId = catalogResolver.resolveEntity(
-                    "-//FOO//DTD XML Dummy V0.0//EN",
-                    "http://www.oracle.com/alt1sys.dtd")
-                    .getSystemId();
-            Assert.assertTrue(actualSystemId.contains("dummy.dtd"),
-                    "Resulting id should contain dummy.dtd, indicating a match by publicId");
-
-        } catch (Exception e) {
-            Assert.fail(e.getMessage());
-        }
+        CatalogFeatures features = CatalogFeatures.builder()
+                .with(CatalogFeatures.Feature.PREFER, "system")
+                .build();
+        Catalog catalog = CatalogManager.catalog(features, catalogFile);
+        CatalogResolver catalogResolver = CatalogManager.catalogResolver(catalog);
+        String actualSystemId = catalogResolver.resolveEntity(
+                        "-//FOO//DTD XML Dummy V0.0//EN",
+                        "http://www.oracle.com/alt1sys.dtd")
+                .getSystemId();
+        assertTrue(actualSystemId.contains("dummy.dtd"),
+                "Resulting id should contain dummy.dtd, indicating a match by publicId");
     }
 
     /*
@@ -469,14 +481,9 @@ public class CatalogTest extends CatalogSupportBase {
     public void testRewriteSystem() throws Exception {
         URI catalog = getClass().getResource("rewriteCatalog.xml").toURI();
 
-        try {
-            CatalogResolver resolver = CatalogManager.catalogResolver(CatalogFeatures.defaults(), catalog);
-            String actualSystemId = resolver.resolveEntity(null, "http://remote.com/dtd/book.dtd").getSystemId();
-            Assert.assertTrue(!actualSystemId.contains("//"), "result contains duplicate slashes");
-        } catch (Exception e) {
-            Assert.fail(e.getMessage());
-        }
-
+        CatalogResolver resolver = CatalogManager.catalogResolver(CatalogFeatures.defaults(), catalog);
+        String actualSystemId = resolver.resolveEntity(null, "http://remote.com/dtd/book.dtd").getSystemId();
+        assertFalse(actualSystemId.contains("//"), "result contains duplicate slashes");
     }
 
     /*
@@ -487,23 +494,18 @@ public class CatalogTest extends CatalogSupportBase {
     public void testRewriteUri() throws Exception {
         URI catalog = getClass().getResource("rewriteCatalog.xml").toURI();
 
-        try {
-
-            CatalogResolver resolver = CatalogManager.catalogResolver(CatalogFeatures.defaults(), catalog);
-            String actualSystemId = resolver.resolve("http://remote.com/import/import.xsl", null).getSystemId();
-            Assert.assertTrue(!actualSystemId.contains("//"), "result contains duplicate slashes");
-        } catch (Exception e) {
-            Assert.fail(e.getMessage());
-        }
+        CatalogResolver resolver = CatalogManager.catalogResolver(CatalogFeatures.defaults(), catalog);
+        String actualSystemId = resolver.resolve("http://remote.com/import/import.xsl", null).getSystemId();
+        assertFalse(actualSystemId.contains("//"), "result contains duplicate slashes");
     }
 
     /*
        @bug 8144966
        Verifies that passing null as CatalogFeatures will result in a NPE.
     */
-    @Test(expectedExceptions = NullPointerException.class)
+    @Test
     public void testFeatureNull() {
-        CatalogResolver resolver = CatalogManager.catalogResolver((CatalogFeatures)null, (URI)null);
+        assertThrows(NullPointerException.class, () -> CatalogManager.catalogResolver((CatalogFeatures) null, (URI) null));
 
     }
 
@@ -511,10 +513,11 @@ public class CatalogTest extends CatalogSupportBase {
        @bug 8144966
        Verifies that passing null as the URI will result in a NPE.
     */
-    @Test(expectedExceptions = NullPointerException.class)
+    @Test
     public void testPathNull() {
-        URI uri = null;
-        CatalogResolver resolver = CatalogManager.catalogResolver(CatalogFeatures.defaults(), uri);
+        assertThrows(
+                NullPointerException.class,
+                () -> CatalogManager.catalogResolver(CatalogFeatures.defaults(), (URI) null));
     }
 
     /*
@@ -523,7 +526,8 @@ public class CatalogTest extends CatalogSupportBase {
     is successful, the Handler shall return the value of the entity reference
     that matches the expected value.
      */
-    @Test(dataProvider = "catalog")
+    @ParameterizedTest
+    @MethodSource("getCatalog")
     public void testCatalogResolver(String test, String expected, String catalogFile,
             String xml, SAXParser saxParser) throws Exception {
         URI catalog = null;
@@ -531,18 +535,14 @@ public class CatalogTest extends CatalogSupportBase {
             catalog = getClass().getResource(catalogFile).toURI();
         }
         String url = getClass().getResource(xml).getFile();
-        try {
-            CatalogResolver cr = CatalogManager.catalogResolver(CatalogFeatures.defaults(), catalog);
-            XMLReader reader = saxParser.getXMLReader();
-            reader.setEntityResolver(cr);
-            MyHandler handler = new MyHandler(saxParser);
-            reader.setContentHandler(handler);
-            reader.parse(url);
-            System.out.println(test + ": expected [" + expected + "] <> actual [" + handler.getResult() + "]");
-            Assert.assertEquals(handler.getResult(), expected);
-        } catch (SAXException | IOException e) {
-            Assert.fail(e.getMessage());
-        }
+        CatalogResolver cr = CatalogManager.catalogResolver(CatalogFeatures.defaults(), catalog);
+        XMLReader reader = saxParser.getXMLReader();
+        reader.setEntityResolver(cr);
+        MyHandler handler = new MyHandler(saxParser);
+        reader.setContentHandler(handler);
+        reader.parse(url);
+        System.out.println(test + ": expected [" + expected + "] <> actual [" + handler.getResult() + "]");
+        assertEquals(expected, handler.getResult());
     }
 
     /*
@@ -564,7 +564,7 @@ public class CatalogTest extends CatalogSupportBase {
         } catch (Exception e) {
             String msg = e.getMessage();
             if (msg != null) {
-                Assert.assertTrue(msg.contains(expectedMsgId),
+                assertTrue(msg.contains(expectedMsgId),
                         "Message shall contain the corrent message ID " + expectedMsgId);
             }
         }
@@ -585,19 +585,15 @@ public class CatalogTest extends CatalogSupportBase {
                 .build();
 
         String test = "testInvalidCatalog";
-        try {
-            CatalogResolver resolver = CatalogManager.catalogResolver(f);
-            String actualSystemId = resolver.resolveEntity(
-                    null,
-                    "http://remote/xml/dtd/sys/alice/docAlice.dtd")
-                    .getSystemId();
-            System.out.println("testIgnoreInvalidCatalog: expected [null]");
-            System.out.println("testIgnoreInvalidCatalog: expected [null]");
-            System.out.println("actual [" + actualSystemId + "]");
-            Assert.assertEquals(actualSystemId, null);
-        } catch (Exception e) {
-            Assert.fail(e.getMessage());
-        }
+        CatalogResolver resolver = CatalogManager.catalogResolver(f);
+        String actualSystemId = resolver.resolveEntity(
+                        null,
+                        "http://remote/xml/dtd/sys/alice/docAlice.dtd")
+                .getSystemId();
+        System.out.println("testIgnoreInvalidCatalog: expected [null]");
+        System.out.println("testIgnoreInvalidCatalog: expected [null]");
+        System.out.println("actual [" + actualSystemId + "]");
+        assertNull(actualSystemId);
     }
 
 
@@ -608,7 +604,6 @@ public class CatalogTest extends CatalogSupportBase {
 
         This DataProvider is copied from JCK ResolveTests' dataMatch1
      */
-    @DataProvider(name = "resolveUri")
     public Object[][] getDataForUriResolver() {
         return new Object[][]{
             {"uri.xml",
@@ -623,7 +618,6 @@ public class CatalogTest extends CatalogSupportBase {
         DataProvider: used to verify hierarchical catalogs. Refer to JCK test
     hierarchyOfCatFiles2.
      */
-    @DataProvider(name = "hierarchyOfCatFilesData")
     public Object[][] getHierarchyOfCatFilesData() {
         return new Object[][]{
             {"http://www.oracle.com/sequence.dtd", "first.dtd"},
@@ -637,7 +631,6 @@ public class CatalogTest extends CatalogSupportBase {
         Data columns:
         catalog, prefer, systemId, publicId, expectedUri, expectedFile, msg
      */
-    @DataProvider(name = "resolveEntity")
     public Object[][] getDataForMatchingBothIds() {
         String expected = "http://www.groupxmlbase.com/dtds/rewrite.dtd";
         return new Object[][]{
@@ -658,7 +651,6 @@ public class CatalogTest extends CatalogSupportBase {
         Data columns:
         prefer, catalog, publicId, systemId, expected result
      */
-    @DataProvider(name = "matchWithPrefer")
     public Object[][] getDataForMatch() {
         return new Object[][]{
             {"public", "pubOnly.xml", id, "", "http://local/base/dtd/public.dtd"},
@@ -682,7 +674,6 @@ public class CatalogTest extends CatalogSupportBase {
         Data columns:
         prefer, catalog, publicId, systemId, expected result
      */
-    @DataProvider(name = "resolveWithPrefer")
     public Object[][] getDataForResolve() {
         return new Object[][]{
             {"system", "pubOnly.xml", id, "", "http://local/base/dtd/public.dtd"},
@@ -709,11 +700,10 @@ public class CatalogTest extends CatalogSupportBase {
        DataProvider: catalogs that contain invalid next or delegate catalogs.
                      The defer attribute is set to false.
      */
-    @DataProvider(name = "invalidAltCatalogs")
-    public Object[][] getCatalogs() {
-        return new Object[][]{
-            {"defer_false_2.xml"},
-            {"defer_del_false.xml"}
+    public Object[][] getInvalidAltCatalogs() {
+        return new Object[][] {
+                { "defer_false_2.xml" },
+                { "defer_del_false.xml" }
         };
     }
 
@@ -722,7 +712,6 @@ public class CatalogTest extends CatalogSupportBase {
        DataProvider: provides test name, expected string, the catalog, and XML
        document.
      */
-    @DataProvider(name = "catalog")
     public Object[][] getCatalog() {
         return new Object[][]{
             {"testSystem", "Test system entry", "catalog.xml", "system.xml", getParser()},
diff --git a/test/jaxp/javax/xml/jaxp/unittest/catalog/GroupTest.java b/test/jaxp/javax/xml/jaxp/unittest/catalog/GroupTest.java
index 46aa46ee29f..6a5593db11b 100644
--- a/test/jaxp/javax/xml/jaxp/unittest/catalog/GroupTest.java
+++ b/test/jaxp/javax/xml/jaxp/unittest/catalog/GroupTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2019, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2019, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -22,31 +22,36 @@
  */
 package catalog;
 
-import java.net.URI;
-import java.nio.file.Paths;
+import org.junit.jupiter.api.BeforeAll;
+import org.junit.jupiter.api.TestInstance;
+import org.junit.jupiter.api.TestInstance.Lifecycle;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
+
 import javax.xml.catalog.CatalogFeatures;
 import javax.xml.catalog.CatalogManager;
 import javax.xml.catalog.CatalogResolver;
 import javax.xml.transform.Source;
-import org.testng.Assert;
-import org.testng.annotations.BeforeClass;
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
+import java.net.URI;
+import java.nio.file.Paths;
+
+import static org.junit.jupiter.api.Assertions.assertTrue;
 
 /*
  * @test
  * @bug 8215330
  * @library /javax/xml/jaxp/libs /javax/xml/jaxp/unittest
- * @run testng catalog.GroupTest
+ * @run junit catalog.GroupTest
  * @summary Tests catalog with Group entries.
  */
+@TestInstance(Lifecycle.PER_CLASS)
 public class GroupTest extends CatalogSupportBase {
 
     String catalogGroup;
     /*
      * Initializing fields
      */
-    @BeforeClass
+    @BeforeAll
     public void setUpClass() throws Exception {
         super.setUp();
         catalogGroup = Paths.get(filepath + "GroupTest.xml").toUri().toASCIIString();
@@ -60,13 +65,14 @@ public class GroupTest extends CatalogSupportBase {
      * @param expected the expected result string
      * @throws Exception
      */
-    @Test(dataProvider = "data_group")
+    @ParameterizedTest
+    @MethodSource("getDataDOM")
     public void testGroup(String catalog, String uri, String expected) throws Exception {
         CatalogResolver resolver = CatalogManager.catalogResolver(
                 CatalogFeatures.defaults(), URI.create(catalog));
 
         Source src = resolver.resolve(uri, null);
-        Assert.assertTrue(src.getSystemId().endsWith(expected), "uriSuffix match");
+        assertTrue(src.getSystemId().endsWith(expected), "uriSuffix match");
     }
 
 
@@ -74,7 +80,6 @@ public class GroupTest extends CatalogSupportBase {
        DataProvider: for testing catalogs with group entries
        Data: catalog file, uri, expected result string
      */
-    @DataProvider(name = "data_group")
     public Object[][] getDataDOM() {
         return new Object[][]{
             {catalogGroup, "http://openjdk_java_net/xml/catalog/A/CommonFileA1.xml", "LocalFileA1.xml"},
diff --git a/test/jaxp/javax/xml/jaxp/unittest/datatype/Bug6320118.java b/test/jaxp/javax/xml/jaxp/unittest/datatype/Bug6320118.java
index f22e95837bd..fa27d5102d4 100644
--- a/test/jaxp/javax/xml/jaxp/unittest/datatype/Bug6320118.java
+++ b/test/jaxp/javax/xml/jaxp/unittest/datatype/Bug6320118.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2014, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2014, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,26 +23,28 @@
 
 package datatype;
 
+import org.junit.jupiter.api.BeforeEach;
+import org.junit.jupiter.api.Test;
+
 import javax.xml.datatype.DatatypeConfigurationException;
 import javax.xml.datatype.DatatypeFactory;
 import javax.xml.datatype.XMLGregorianCalendar;
 
-import org.testng.Assert;
-import org.testng.annotations.BeforeClass;
-import org.testng.annotations.Test;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertThrows;
 
 /*
  * @test
  * @bug 6320118
  * @library /javax/xml/jaxp/libs /javax/xml/jaxp/unittest
- * @run testng/othervm datatype.Bug6320118
+ * @run junit/othervm datatype.Bug6320118
  * @summary Test xml datatype XMLGregorianCalendar.
  */
 public class Bug6320118 {
 
     DatatypeFactory df;
 
-    @BeforeClass
+    @BeforeEach
     public void createDataTypeFactory() throws DatatypeConfigurationException {
         df = DatatypeFactory.newInstance();
     }
@@ -50,30 +52,30 @@ public class Bug6320118 {
     @Test
     public void test1() {
         XMLGregorianCalendar calendar = df.newXMLGregorianCalendar(1970, 1, 1, 24, 0, 0, 0, 0);
-        Assert.assertEquals(calendar.getYear(), 1970);
-        Assert.assertEquals(calendar.getMonth(), 1);
-        Assert.assertEquals(calendar.getDay(), 2);
-        Assert.assertEquals(calendar.getHour(), 0, "hour 24 needs to be treated as hour 0 of next day");
+        assertEquals(1970, calendar.getYear());
+        assertEquals(1, calendar.getMonth());
+        assertEquals(2, calendar.getDay());
+        assertEquals(0, calendar.getHour(), "hour 24 needs to be treated as hour 0 of next day");
     }
 
     @Test
     public void test2() {
         XMLGregorianCalendar calendar = df.newXMLGregorianCalendarTime(24, 0, 0, 0);
-        Assert.assertEquals(calendar.getHour(), 0, "hour 24 needs to be treated as hour 0 of next day");
+        assertEquals(0, calendar.getHour(), "hour 24 needs to be treated as hour 0 of next day");
     }
 
-    @Test(expectedExceptions = IllegalArgumentException.class)
+    @Test
     public void test3() {
         XMLGregorianCalendar calendar = df.newXMLGregorianCalendar();
         // Must fail as other params are not 0 but undefined
-        calendar.setHour(24);
+        assertThrows(IllegalArgumentException.class, () -> calendar.setHour(24));
     }
 
     @Test
     public void test4() {
         XMLGregorianCalendar calendar = df.newXMLGregorianCalendar();
         calendar.setTime(24, 0, 0, 0);
-        Assert.assertEquals(calendar.getHour(), 0, "hour 24 needs to be treated as hour 0 of next day");
+        assertEquals(0, calendar.getHour(), "hour 24 needs to be treated as hour 0 of next day");
     }
 
 }
diff --git a/test/jaxp/javax/xml/jaxp/unittest/datatype/Bug6937951Test.java b/test/jaxp/javax/xml/jaxp/unittest/datatype/Bug6937951Test.java
index d1e5aea93da..bc32bc0374d 100644
--- a/test/jaxp/javax/xml/jaxp/unittest/datatype/Bug6937951Test.java
+++ b/test/jaxp/javax/xml/jaxp/unittest/datatype/Bug6937951Test.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2014, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2014, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,18 +23,19 @@
 
 package datatype;
 
+import org.junit.jupiter.api.Test;
+
 import javax.xml.datatype.DatatypeConfigurationException;
 import javax.xml.datatype.DatatypeFactory;
 import javax.xml.datatype.XMLGregorianCalendar;
 
-import org.testng.Assert;
-import org.testng.annotations.Test;
+import static org.junit.jupiter.api.Assertions.assertEquals;
 
 /*
  * @test
  * @bug 6937951
  * @library /javax/xml/jaxp/libs /javax/xml/jaxp/unittest
- * @run testng/othervm datatype.Bug6937951Test
+ * @run junit/othervm datatype.Bug6937951Test
  * @summary Test midnight is same as the start of the next day in XMLGregorianCalendar.
  */
 public class Bug6937951Test {
@@ -44,13 +45,10 @@ public class Bug6937951Test {
         DatatypeFactory dtf = DatatypeFactory.newInstance();
         XMLGregorianCalendar c1 = dtf.newXMLGregorianCalendar("1999-12-31T24:00:00");
         XMLGregorianCalendar c2 = dtf.newXMLGregorianCalendar("2000-01-01T00:00:00");
-        System.out.println("c1: " + c1.getYear() + "-" + c1.getMonth() + "-" + c1.getDay() + "T" + c1.getHour());
-        System.out.println(c1.equals(c2) ? "pass" : "fail"); // fails
-        if (!c1.equals(c2))
-            Assert.fail("hour 24 needs to be treated as equal to hour 0 of the next day");
-        if (c1.getYear() != 2000 && c1.getHour() != 0)
-            Assert.fail("hour 24 needs to be treated as equal to hour 0 of the next day");
 
+        assertEquals(2000, c1.getYear());
+        assertEquals(0, c1.getHour());
+        assertEquals(c1, c2, "hour 24 should treated as equal to hour 0 of the next day");
     }
 
 }
diff --git a/test/jaxp/javax/xml/jaxp/unittest/datatype/Bug6937964Test.java b/test/jaxp/javax/xml/jaxp/unittest/datatype/Bug6937964Test.java
index 8aa5d6369a3..571ca1b97d3 100644
--- a/test/jaxp/javax/xml/jaxp/unittest/datatype/Bug6937964Test.java
+++ b/test/jaxp/javax/xml/jaxp/unittest/datatype/Bug6937964Test.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2014, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2014, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,31 +23,29 @@
 
 package datatype;
 
-import java.math.BigDecimal;
-import java.math.BigInteger;
+import org.junit.jupiter.api.Test;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
 
 import javax.xml.datatype.DatatypeConfigurationException;
 import javax.xml.datatype.DatatypeConstants;
 import javax.xml.datatype.DatatypeFactory;
 import javax.xml.datatype.Duration;
 import javax.xml.namespace.QName;
+import java.math.BigDecimal;
+import java.math.BigInteger;
 
-import org.testng.Assert;
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertNotEquals;
 
 /*
  * @test
  * @bug 6937964
  * @library /javax/xml/jaxp/libs /javax/xml/jaxp/unittest
- * @run testng/othervm datatype.Bug6937964Test
+ * @run junit/othervm datatype.Bug6937964Test
  * @summary Test Duration is normalized.
  */
 public class Bug6937964Test {
-    /**
-     * Print debugging to System.err.
-     */
-    private static final boolean DEBUG = false;
     /**
      * Constant to indicate expected lexical test failure.
      */
@@ -57,7 +55,7 @@ public class Bug6937964Test {
     public void test() throws DatatypeConfigurationException {
         DatatypeFactory dtf = DatatypeFactory.newInstance();
         Duration d = dtf.newDurationYearMonth("P20Y15M");
-        System.out.println(d.getYears() == 21 ? "pass" : "fail");
+        assertEquals(21, d.getYears());
     }
 
     @Test
@@ -65,7 +63,7 @@ public class Bug6937964Test {
         DatatypeFactory dtf = DatatypeFactory.newInstance();
         Duration d = dtf.newDurationYearMonth("P20Y15M");
         int years = d.getYears();
-        Assert.assertEquals(years, 21, "Return value should be normalized");
+        assertEquals(21, years, "Return value should be normalized");
     }
 
     @Test
@@ -73,8 +71,7 @@ public class Bug6937964Test {
         DatatypeFactory dtf = DatatypeFactory.newInstance();
         Duration d = dtf.newDurationYearMonth(671976000000L);
         int years = d.getYears();
-        System.out.println("Years: " + years);
-        Assert.assertEquals(years, 21, "Return value should be normalized");
+        assertEquals(21, years, "Return value should be normalized");
     }
 
     @Test
@@ -84,7 +81,7 @@ public class Bug6937964Test {
         BigInteger mon = new BigInteger("15");
         Duration d = dtf.newDurationYearMonth(true, year, mon);
         int years = d.getYears();
-        Assert.assertEquals(years, 21, "Return value should be normalized");
+        assertEquals(21, years, "Return value should be normalized");
     }
 
     @Test
@@ -92,7 +89,7 @@ public class Bug6937964Test {
         DatatypeFactory dtf = DatatypeFactory.newInstance();
         Duration d = dtf.newDurationYearMonth(true, 20, 15);
         int years = d.getYears();
-        Assert.assertEquals(years, 21, "Return value should be normalized");
+        assertEquals(21, years, "Return value should be normalized");
     }
 
     @Test
@@ -100,7 +97,7 @@ public class Bug6937964Test {
         DatatypeFactory dtf = DatatypeFactory.newInstance();
         Duration d = dtf.newDurationDayTime("P1DT23H59M65S");
         int days = d.getDays();
-        Assert.assertEquals(days, 2, "Return value should be normalized");
+        assertEquals(2, days, "Return value should be normalized");
     }
 
     @Test
@@ -108,7 +105,7 @@ public class Bug6937964Test {
         DatatypeFactory dtf = DatatypeFactory.newInstance();
         Duration d = dtf.newDurationDayTime(172805000L);
         int days = d.getDays();
-        Assert.assertEquals(days, 2, "Return value should be normalized");
+        assertEquals(2, days, "Return value should be normalized");
     }
 
     @Test
@@ -120,8 +117,7 @@ public class Bug6937964Test {
         BigInteger sec = new BigInteger("65");
         Duration d = dtf.newDurationDayTime(true, day, hour, min, sec);
         int days = d.getDays();
-        System.out.println("Days: " + days);
-        Assert.assertEquals(days, 2, "Return value should be normalized");
+        assertEquals(2, days, "Return value should be normalized");
     }
 
     @Test
@@ -129,117 +125,88 @@ public class Bug6937964Test {
         DatatypeFactory dtf = DatatypeFactory.newInstance();
         Duration d = dtf.newDurationDayTime(true, 1, 23, 59, 65);
         int days = d.getDays();
-        System.out.println("Days: " + days);
-        Assert.assertEquals(days, 2, "Return value should be normalized");
+        assertEquals(2, days, "Return value should be normalized");
     }
 
-    @DataProvider(name = "lexicalvalues")
-    public Object[][] actualAndExpectedLexicals() {
-        Object actualAndExpected [][] = {
-                {"P13M", "P1Y1M"},
-                {"-P13M", "-P1Y1M"},
-                {"P1Y", "P1Y"},
-                {"-P1Y", "-P1Y"},
-                {"P1Y25M", "P3Y1M"},
-                {"-P1Y25M", "-P3Y1M"}
+    public static Object[][] lexicalvalues() {
+        return new Object[][] {
+                { "P13M", "P1Y1M" },
+                { "-P13M", "-P1Y1M" },
+                { "P1Y", "P1Y" },
+                { "-P1Y", "-P1Y" },
+                { "P1Y25M", "P3Y1M" },
+                { "-P1Y25M", "-P3Y1M" }
         };
-        return actualAndExpected;
     }
 
-    @Test(dataProvider = "lexicalvalues")
-    public void testNewDurationYearMonthLexicalRepresentation1(String actualLex, String expectedLex) {
-        /**
-         * Lexical test values to test.
-         */
-
-        DatatypeFactory datatypeFactory = null;
-        try {
-            datatypeFactory = DatatypeFactory.newInstance();
-        } catch (DatatypeConfigurationException datatypeConfigurationException) {
-            Assert.fail(datatypeConfigurationException.toString());
-        }
-
-        if (DEBUG) {
-            System.err.println("DatatypeFactory created: " + datatypeFactory.toString());
-        }
-        if (DEBUG) {
-            System.err.println("testing value: \"" + actualLex + "\", expecting: \"" + expectedLex + "\"");
-        }
+    @ParameterizedTest
+    @MethodSource("lexicalvalues")
+    public void testNewDurationYearMonthLexicalRepresentation1(String actualLex, String expectedLex)
+            throws DatatypeConfigurationException {
+        DatatypeFactory datatypeFactory = DatatypeFactory.newInstance();
 
         try {
             Duration duration = datatypeFactory.newDurationYearMonth(actualLex);
 
-            if (DEBUG) {
-                System.err.println("Duration created: \"" + duration.toString() + "\"");
-            }
-
             // was this expected to fail?
-            Assert.assertNotEquals(expectedLex, TEST_VALUE_FAIL, "the value \"" + actualLex + "\" is invalid " +
-                    "yet it created the Duration \"" + duration.toString() + "\"" );
+            assertNotEquals(TEST_VALUE_FAIL, expectedLex, "the value \"" + actualLex + "\" is invalid " +
+                    "yet it created the Duration \"" + duration.toString() + "\"");
 
             // right XMLSchemaType?
             // TODO: enable test, it should pass, it fails with Exception(s)
             // for now due to a bug
             try {
                 QName xmlSchemaType = duration.getXMLSchemaType();
-                Assert.assertEquals(xmlSchemaType, DatatypeConstants.DURATION_YEARMONTH, "Duration created with " +
+                assertEquals(DatatypeConstants.DURATION_YEARMONTH, xmlSchemaType, "Duration created with " +
                         "XMLSchemaType of\"" + xmlSchemaType + "\" was expected to be \""
-                        + DatatypeConstants.DURATION_YEARMONTH + "\" and has the value \"" + duration.toString() + "\"");
-                } catch (IllegalStateException illegalStateException) {
-                    // TODO; this test really should pass
-                    System.err.println("Please fix this bug that is being ignored, for now: " + illegalStateException.getMessage());
-                }
-
-                // does it have the right value?
-                Assert.assertEquals(duration.toString(), expectedLex, "Duration created with \"" + actualLex +
-                        "\" was expected to be \"" + expectedLex + "\" and has the value \"" + duration.toString() + "\"");
-                // Duration created with correct value
-            } catch (Exception exception) {
-                if (DEBUG) {
-                    System.err.println("Exception in creating duration: \"" + exception.toString() + "\"");
-                }
-
-                // was this expected to succed?
-                Assert.assertEquals(TEST_VALUE_FAIL, expectedLex, "the value \"" + actualLex + "\" is valid yet " +
-                        "it failed with \"" + exception.toString() + "\"");
-                // expected failure
+                        + DatatypeConstants.DURATION_YEARMONTH + "\" and has the value \"" + duration + "\"");
+            } catch (IllegalStateException illegalStateException) {
+                // TODO; this test really should pass
+                System.err.println("Please fix this bug that is being ignored, for now: " + illegalStateException.getMessage());
             }
+
+            // does it have the right value?
+            assertEquals(expectedLex, duration.toString(), "Duration created with \"" + actualLex +
+                    "\" was expected to be \"" + expectedLex + "\" and has the value \"" + duration + "\"");
+            // Duration created with correct value
+        } catch (Exception exception) {
+            // was this expected to succed?
+            assertEquals(TEST_VALUE_FAIL, expectedLex, "the value \"" + actualLex + "\" is valid yet " +
+                    "it failed with \"" + exception + "\"");
+            // expected failure
+        }
     }
 
-    @DataProvider(name = "lexDayTime")
-    public Object[][] lexDayTimeData() {
+    public static Object[][] lexDayTimeData() {
         BigInteger one = new BigInteger("1");
         BigInteger zero = new BigInteger("0");
         BigDecimal bdZero = new BigDecimal("0");
         BigDecimal bdOne = new BigDecimal("1");
-        Object[][] values = {
+        return new Object[][] {
                 // lex, isPositive, years, month, days, hours, minutes, seconds
-                { "P1D", Boolean.TRUE, null, null, one, zero, zero, bdZero }, { "PT1H", Boolean.TRUE, null, null, zero, one, zero, bdZero },
-                { "PT1M", Boolean.TRUE, null, null, zero, zero, one, bdZero }, { "PT1.1S", Boolean.TRUE, null, null, zero, zero, zero, bdOne },
+                { "P1D", Boolean.TRUE, null, null, one, zero, zero, bdZero },
+                { "PT1H", Boolean.TRUE, null, null, zero, one, zero, bdZero },
+                { "PT1M", Boolean.TRUE, null, null, zero, zero, one, bdZero },
+                { "PT1.1S", Boolean.TRUE, null, null, zero, zero, zero, bdOne },
                 { "-PT1H1.1S", Boolean.FALSE, null, null, zero, one, zero, bdOne }, };
-        return values;
     }
 
     /**
      * TCK test failure
      */
-    @Test(dataProvider = "lexDayTime")
+    @ParameterizedTest
+    @MethodSource("lexDayTimeData")
     public void testNewDurationDayTime005(String lex, boolean isPositive, BigInteger year, BigInteger month, BigInteger days,
-                                          BigInteger hour, BigInteger minutes, BigDecimal seconds) {
-        StringBuffer result = new StringBuffer();
-        DatatypeFactory df = null;
-
-        try {
-            df = DatatypeFactory.newInstance();
-        } catch (DatatypeConfigurationException e) {
-            Assert.fail(e.toString());
-        }
+                                          BigInteger hour, BigInteger minutes, BigDecimal seconds)
+            throws DatatypeConfigurationException {
+        StringBuilder result = new StringBuilder();
+        DatatypeFactory df = DatatypeFactory.newInstance();
 
         Duration duration = null;
         try {
             duration = df.newDurationDayTime(isPositive, days, hour, minutes, seconds.toBigInteger());
         } catch (IllegalArgumentException e) {
-            result.append("; unexpected " + e + " trying to create duration \'" + lex + "\'");
+            result.append("; unexpected " + e + " trying to create duration '" + lex + "'");
         }
         if (duration != null) {
             if ((duration.getSign() == 1) != isPositive) {
@@ -248,43 +215,39 @@ public class Bug6937964Test {
 
             Number value = duration.getField(DatatypeConstants.YEARS);
             if ((value != null && year == null) || (value == null && year != null) || (value != null && !value.equals(year))) {
-                result.append("; " + lex + ": wrong value of the field " + DatatypeConstants.YEARS + ": \'" + value + "\'" + ", expected \'"
-                        + year + "\'");
+                result.append("; " + lex + ": wrong value of the field " + DatatypeConstants.YEARS + ": '" + value + "'" + ", expected '"
+                        + year + "'");
             }
 
             value = duration.getField(DatatypeConstants.MONTHS);
             if ((value != null && month == null) || (value == null && month != null) || (value != null && !value.equals(month))) {
-                result.append("; " + lex + ": wrong value of the field " + DatatypeConstants.MONTHS + ": \'" + value + "\'" + ", expected \'"
-                        + month + "\'");
+                result.append("; " + lex + ": wrong value of the field " + DatatypeConstants.MONTHS + ": '" + value + "'" + ", expected '"
+                        + month + "'");
             }
 
             value = duration.getField(DatatypeConstants.DAYS);
             if ((value != null && days == null) || (value == null && days != null) || (value != null && !value.equals(days))) {
-                result.append("; " + lex + ": wrong value of the field " + DatatypeConstants.DAYS + ": \'" + value + "\'" + ", expected \'"
-                        + days + "\'");
+                result.append("; " + lex + ": wrong value of the field " + DatatypeConstants.DAYS + ": '" + value + "'" + ", expected '"
+                        + days + "'");
             }
 
             value = duration.getField(DatatypeConstants.HOURS);
             if ((value != null && hour == null) || (value == null && hour != null) || (value != null && !value.equals(hour))) {
-                result.append("; " + lex + ": wrong value of the field " + DatatypeConstants.HOURS + ": \'" + value + "\'" + ", expected \'"
-                        + hour + "\'");
+                result.append("; " + lex + ": wrong value of the field " + DatatypeConstants.HOURS + ": '" + value + "'" + ", expected '"
+                        + hour + "'");
             }
 
             value = duration.getField(DatatypeConstants.MINUTES);
             if ((value != null && minutes == null) || (value == null && minutes != null) || (value != null && !value.equals(minutes))) {
-                result.append("; " + lex + ": wrong value of the field " + DatatypeConstants.MINUTES + ": \'" + value + "\'" + ", expected \'"
-                        + minutes + "\'");
+                result.append("; " + lex + ": wrong value of the field " + DatatypeConstants.MINUTES + ": '" + value + "'" + ", expected '"
+                        + minutes + "'");
             }
 
             value = duration.getField(DatatypeConstants.SECONDS);
-            if ((value != null && seconds == null) || (value == null && seconds != null) || (value != null && !value.equals(seconds))) {
-                result.append("; " + lex + ": wrong value of the field " + DatatypeConstants.SECONDS + ": \'" + value + "\'" + ", expected \'"
-                        + seconds + "\'");
+            if (value == null || !value.equals(seconds)) {
+                result.append("; " + lex + ": wrong value of the field " + DatatypeConstants.SECONDS + ": '" + value + "'" + ", expected '"
+                        + seconds + "'");
             }
         }
-        if(result.length() > 0) {
-            Assert.fail(result.substring(2));
-        }
-        System.out.println("OK");
     }
 }
diff --git a/test/jaxp/javax/xml/jaxp/unittest/datatype/Bug7042647Test.java b/test/jaxp/javax/xml/jaxp/unittest/datatype/Bug7042647Test.java
index c6b143c1d5a..b434db0e4c4 100644
--- a/test/jaxp/javax/xml/jaxp/unittest/datatype/Bug7042647Test.java
+++ b/test/jaxp/javax/xml/jaxp/unittest/datatype/Bug7042647Test.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2014, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2014, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,21 +23,21 @@
 
 package datatype;
 
-import java.util.Calendar;
-import java.util.GregorianCalendar;
+import org.junit.jupiter.api.Test;
 
 import javax.xml.datatype.DatatypeConfigurationException;
 import javax.xml.datatype.DatatypeFactory;
 import javax.xml.datatype.XMLGregorianCalendar;
+import java.util.Calendar;
+import java.util.GregorianCalendar;
 
-import org.testng.Assert;
-import org.testng.annotations.Test;
+import static org.junit.jupiter.api.Assertions.assertEquals;
 
 /*
  * @test
  * @bug 7042647
  * @library /javax/xml/jaxp/libs /javax/xml/jaxp/unittest
- * @run testng/othervm datatype.Bug7042647Test
+ * @run junit/othervm datatype.Bug7042647Test
  * @summary Test getFirstDayOfWeek is correct after converting XMLGregorianCalendar to a GregorianCalendar.
  */
 public class Bug7042647Test {
@@ -49,11 +49,7 @@ public class Bug7042647Test {
         int firstDayOfWeek = calendar.getFirstDayOfWeek();
         Calendar defaultCalendar = Calendar.getInstance();
         int defaultFirstDayOfWeek = defaultCalendar.getFirstDayOfWeek();
-        if (firstDayOfWeek != defaultFirstDayOfWeek) {
-            Assert.fail("Failed firstDayOfWeek=" + firstDayOfWeek + " != defaultFirstDayOfWeek=" + defaultFirstDayOfWeek);
-        } else {
-            System.out.println("Success firstDayOfWeek=" + firstDayOfWeek + " == defaultFirstDayOfWeek=" + defaultFirstDayOfWeek);
-        }
+        assertEquals(defaultFirstDayOfWeek, firstDayOfWeek);
     }
 
 }
diff --git a/test/jaxp/javax/xml/jaxp/unittest/datatype/DatatypeFactoryTest.java b/test/jaxp/javax/xml/jaxp/unittest/datatype/DatatypeFactoryTest.java
index 3866ae6a70c..da5862f5adb 100644
--- a/test/jaxp/javax/xml/jaxp/unittest/datatype/DatatypeFactoryTest.java
+++ b/test/jaxp/javax/xml/jaxp/unittest/datatype/DatatypeFactoryTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2014, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2014, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,8 +23,7 @@
 
 package datatype;
 
-import java.math.BigDecimal;
-import java.math.BigInteger;
+import org.junit.jupiter.api.Test;
 
 import javax.xml.datatype.DatatypeConfigurationException;
 import javax.xml.datatype.DatatypeConstants;
@@ -32,14 +31,15 @@ import javax.xml.datatype.DatatypeFactory;
 import javax.xml.datatype.Duration;
 import javax.xml.datatype.XMLGregorianCalendar;
 import javax.xml.namespace.QName;
+import java.math.BigDecimal;
+import java.math.BigInteger;
 
-import org.testng.Assert;
-import org.testng.annotations.Test;
+import static org.junit.jupiter.api.Assertions.fail;
 
 /*
  * @test
  * @library /javax/xml/jaxp/libs /javax/xml/jaxp/unittest
- * @run testng/othervm datatype.DatatypeFactoryTest
+ * @run junit/othervm datatype.DatatypeFactoryTest
  * @summary Test DatatypeFactory.
  */
 public class DatatypeFactoryTest {
@@ -120,7 +120,7 @@ public class DatatypeFactoryTest {
         try {
             datatypeFactory = DatatypeFactory.newInstance();
         } catch (DatatypeConfigurationException datatypeConfigurationException) {
-            Assert.fail(datatypeConfigurationException.toString());
+            fail(datatypeConfigurationException.toString());
         }
 
         if (DEBUG) {
@@ -144,20 +144,20 @@ public class DatatypeFactoryTest {
 
                 // was this expected to fail?
                 if (TEST_VALUES_MILLISECONDS_RESULTS[onTestValue].equals(TEST_VALUE_FAIL)) {
-                    Assert.fail("the value \"" + TEST_VALUES_MILLISECONDS[onTestValue] + "\" is invalid yet it created the Duration \"" + duration.toString()
+                    fail("the value \"" + TEST_VALUES_MILLISECONDS[onTestValue] + "\" is invalid yet it created the Duration \"" + duration.toString()
                             + "\"");
                 }
 
                 // right XMLSchemaType?
                 QName xmlSchemaType = duration.getXMLSchemaType();
                 if (!xmlSchemaType.equals(DatatypeConstants.DURATION)) {
-                    Assert.fail("Duration created with XMLSchemaType of\"" + xmlSchemaType + "\" was expected to be \"" + DatatypeConstants.DURATION
+                    fail("Duration created with XMLSchemaType of\"" + xmlSchemaType + "\" was expected to be \"" + DatatypeConstants.DURATION
                             + "\" and has the value \"" + duration.toString() + "\"");
                 }
 
                 // does it have the right value?
                 if (!TEST_VALUES_MILLISECONDS_RESULTS[onTestValue].equals(duration.toString())) {
-                    Assert.fail("Duration created with \"" + TEST_VALUES_MILLISECONDS[onTestValue] + "\" was expected to be \""
+                    fail("Duration created with \"" + TEST_VALUES_MILLISECONDS[onTestValue] + "\" was expected to be \""
                             + TEST_VALUES_MILLISECONDS_RESULTS[onTestValue] + "\" and has the value \"" + duration.toString() + "\"");
                 }
 
@@ -170,7 +170,7 @@ public class DatatypeFactoryTest {
 
                 // was this expected to succed?
                 if (!TEST_VALUES_MILLISECONDS_RESULTS[onTestValue].equals(TEST_VALUE_FAIL)) {
-                    Assert.fail("the value \"" + TEST_VALUES_MILLISECONDS[onTestValue] + "\" is valid yet it failed with \"" + exception.toString() + "\"");
+                    fail("the value \"" + TEST_VALUES_MILLISECONDS[onTestValue] + "\" is valid yet it failed with \"" + exception.toString() + "\"");
                 }
                 // expected failure
             }
@@ -195,7 +195,7 @@ public class DatatypeFactoryTest {
         try {
             datatypeFactory = DatatypeFactory.newInstance();
         } catch (DatatypeConfigurationException datatypeConfigurationException) {
-            Assert.fail(datatypeConfigurationException.toString());
+            fail(datatypeConfigurationException.toString());
         }
 
         if (DEBUG) {
@@ -218,7 +218,7 @@ public class DatatypeFactoryTest {
 
                 // was this expected to fail?
                 if (TEST_VALUES_LEXICAL[onTestValue + 1].equals(TEST_VALUE_FAIL)) {
-                    Assert.fail("the value \"" + TEST_VALUES_LEXICAL[onTestValue] + "\" is invalid yet it created the Duration \"" + duration.toString() + "\"");
+                    fail("the value \"" + TEST_VALUES_LEXICAL[onTestValue] + "\" is invalid yet it created the Duration \"" + duration.toString() + "\"");
                 }
 
                 // right XMLSchemaType?
@@ -227,7 +227,7 @@ public class DatatypeFactoryTest {
                 try {
                     QName xmlSchemaType = duration.getXMLSchemaType();
                     if (!xmlSchemaType.equals(DatatypeConstants.DURATION_YEARMONTH)) {
-                        Assert.fail("Duration created with XMLSchemaType of\"" + xmlSchemaType + "\" was expected to be \""
+                        fail("Duration created with XMLSchemaType of\"" + xmlSchemaType + "\" was expected to be \""
                                 + DatatypeConstants.DURATION_YEARMONTH + "\" and has the value \"" + duration.toString() + "\"");
                     }
                 } catch (IllegalStateException illegalStateException) {
@@ -237,7 +237,7 @@ public class DatatypeFactoryTest {
 
                 // does it have the right value?
                 if (!TEST_VALUES_LEXICAL[onTestValue + 1].equals(duration.toString())) {
-                    Assert.fail("Duration created with \"" + TEST_VALUES_LEXICAL[onTestValue] + "\" was expected to be \""
+                    fail("Duration created with \"" + TEST_VALUES_LEXICAL[onTestValue] + "\" was expected to be \""
                             + TEST_VALUES_LEXICAL[onTestValue + 1] + "\" and has the value \"" + duration.toString() + "\"");
                 }
 
@@ -250,7 +250,7 @@ public class DatatypeFactoryTest {
 
                 // was this expected to succed?
                 if (!TEST_VALUES_LEXICAL[onTestValue + 1].equals(TEST_VALUE_FAIL)) {
-                    Assert.fail("the value \"" + TEST_VALUES_LEXICAL[onTestValue] + "\" is valid yet it failed with \"" + exception.toString() + "\"");
+                    fail("the value \"" + TEST_VALUES_LEXICAL[onTestValue] + "\" is valid yet it failed with \"" + exception.toString() + "\"");
                 }
                 // expected failure
             }
@@ -287,7 +287,7 @@ public class DatatypeFactoryTest {
         try {
             datatypeFactory = DatatypeFactory.newInstance();
         } catch (DatatypeConfigurationException datatypeConfigurationException) {
-            Assert.fail(datatypeConfigurationException.toString());
+            fail(datatypeConfigurationException.toString());
         }
 
         if (DEBUG) {
@@ -311,20 +311,20 @@ public class DatatypeFactoryTest {
 
                 // was this expected to fail?
                 if (TEST_VALUES_MILLISECONDS_RESULTS[onTestValue].equals(TEST_VALUE_FAIL)) {
-                    Assert.fail("the value \"" + TEST_VALUES_MILLISECONDS[onTestValue] + "\" is invalid yet it created the Duration \"" + duration.toString()
+                    fail("the value \"" + TEST_VALUES_MILLISECONDS[onTestValue] + "\" is invalid yet it created the Duration \"" + duration.toString()
                             + "\"");
                 }
 
                 // right XMLSchemaType?
                 QName xmlSchemaType = duration.getXMLSchemaType();
                 if (!xmlSchemaType.equals(DatatypeConstants.DURATION_YEARMONTH)) {
-                    Assert.fail("Duration created with XMLSchemaType of\"" + xmlSchemaType + "\" was expected to be \"" + DatatypeConstants.DURATION_YEARMONTH
+                    fail("Duration created with XMLSchemaType of\"" + xmlSchemaType + "\" was expected to be \"" + DatatypeConstants.DURATION_YEARMONTH
                             + "\" and has the value \"" + duration.toString() + "\"");
                 }
 
                 // does it have the right value?
                 if (!TEST_VALUES_MILLISECONDS_RESULTS[onTestValue].equals(duration.toString())) {
-                    Assert.fail("Duration created with \"" + TEST_VALUES_MILLISECONDS[onTestValue] + "\" was expected to be \""
+                    fail("Duration created with \"" + TEST_VALUES_MILLISECONDS[onTestValue] + "\" was expected to be \""
                             + TEST_VALUES_MILLISECONDS_RESULTS[onTestValue] + "\" and has the value \"" + duration.toString() + "\"");
                 }
 
@@ -333,7 +333,7 @@ public class DatatypeFactoryTest {
                 int hours = duration.getHours();
                 int minutes = duration.getMinutes();
                 if (days != 0 || hours != 0 || minutes != 0) {
-                    Assert.fail("xdt:yearMonthDuration created without discarding remaining milliseconds: " + " days = " + days + ", hours = " + hours
+                    fail("xdt:yearMonthDuration created without discarding remaining milliseconds: " + " days = " + days + ", hours = " + hours
                             + ", minutess = " + minutes);
                 }
 
@@ -346,7 +346,7 @@ public class DatatypeFactoryTest {
 
                 // was this expected to succed?
                 if (!TEST_VALUES_MILLISECONDS_RESULTS[onTestValue].equals(TEST_VALUE_FAIL)) {
-                    Assert.fail("the value \"" + TEST_VALUES_MILLISECONDS[onTestValue] + "\" is valid yet it failed with \"" + exception.toString() + "\"");
+                    fail("the value \"" + TEST_VALUES_MILLISECONDS[onTestValue] + "\" is valid yet it failed with \"" + exception.toString() + "\"");
                 }
                 // expected failure
             }
@@ -382,7 +382,7 @@ public class DatatypeFactoryTest {
         try {
             datatypeFactory = DatatypeFactory.newInstance();
         } catch (DatatypeConfigurationException datatypeConfigurationException) {
-            Assert.fail(datatypeConfigurationException.toString());
+            fail(datatypeConfigurationException.toString());
         }
 
         if (DEBUG) {
@@ -406,7 +406,7 @@ public class DatatypeFactoryTest {
 
                 // was this expected to fail?
                 if (TEST_VALUES_MILLISECONDS_RESULTS[onTestValue].equals(TEST_VALUE_FAIL)) {
-                    Assert.fail("the value \"" + TEST_VALUES_MILLISECONDS[onTestValue] + "\" is invalid yet it created the Duration \"" + duration.toString()
+                    fail("the value \"" + TEST_VALUES_MILLISECONDS[onTestValue] + "\" is invalid yet it created the Duration \"" + duration.toString()
                             + "\"");
                 }
 
@@ -414,7 +414,7 @@ public class DatatypeFactoryTest {
                 if (!TEST_VALUES_MILLISECONDS_RESULTS[onTestValue].equals(duration.toString())) {
                     // TODO: this is bug that should be fixed
                     if (false) {
-                        Assert.fail("Duration created with \"" + TEST_VALUES_MILLISECONDS[onTestValue] + "\" was expected to be \""
+                        fail("Duration created with \"" + TEST_VALUES_MILLISECONDS[onTestValue] + "\" was expected to be \""
                                 + TEST_VALUES_MILLISECONDS_RESULTS[onTestValue] + "\" and has the value \"" + duration.toString() + "\"");
                     } else {
                         System.err.println("Please fix this bug: " + "Duration created with \"" + TEST_VALUES_MILLISECONDS[onTestValue]
@@ -431,7 +431,7 @@ public class DatatypeFactoryTest {
                 if (!xmlSchemaType.equals(DatatypeConstants.DURATION_DAYTIME) || years != 0 || months != 0) {
                     // TODO: this is bug that should be fixed
                     if (false) {
-                        Assert.fail("xdt:dayTimeDuration created without discarding remaining milliseconds: " + " XMLSchemaType = " + xmlSchemaType
+                        fail("xdt:dayTimeDuration created without discarding remaining milliseconds: " + " XMLSchemaType = " + xmlSchemaType
                                 + ", years = " + years + ", months = " + months);
                     } else {
                         System.err.println("Please fix this bug: " + "xdt:dayTimeDuration created without discarding remaining milliseconds: "
@@ -448,7 +448,7 @@ public class DatatypeFactoryTest {
 
                 // was this expected to succed?
                 if (!TEST_VALUES_MILLISECONDS_RESULTS[onTestValue].equals(TEST_VALUE_FAIL)) {
-                    Assert.fail("the value \"" + TEST_VALUES_MILLISECONDS[onTestValue] + "\" is valid yet it failed with \"" + exception.toString() + "\"");
+                    fail("the value \"" + TEST_VALUES_MILLISECONDS[onTestValue] + "\" is valid yet it failed with \"" + exception.toString() + "\"");
                 }
                 // expected failure
             }
@@ -482,7 +482,7 @@ public class DatatypeFactoryTest {
         try {
             datatypeFactory = DatatypeFactory.newInstance();
         } catch (DatatypeConfigurationException datatypeConfigurationException) {
-            Assert.fail(datatypeConfigurationException.toString());
+            fail(datatypeConfigurationException.toString());
         }
 
         if (DEBUG) {
@@ -505,13 +505,13 @@ public class DatatypeFactoryTest {
 
                 // was this expected to fail?
                 if (TEST_VALUES_LEXICAL[onTestValue + 1].equals(TEST_VALUE_FAIL)) {
-                    Assert.fail("the value \"" + TEST_VALUES_LEXICAL[onTestValue] + "\" is invalid yet it created the XMLGregorianCalendar \""
+                    fail("the value \"" + TEST_VALUES_LEXICAL[onTestValue] + "\" is invalid yet it created the XMLGregorianCalendar \""
                             + xmlGregorianCalendar.toString() + "\"");
                 }
 
                 // does it have the right value?
                 if (!TEST_VALUES_LEXICAL[onTestValue + 1].equals(xmlGregorianCalendar.toString())) {
-                    Assert.fail("XMLGregorianCalendar created with \"" + TEST_VALUES_LEXICAL[onTestValue] + "\" was expected to be \""
+                    fail("XMLGregorianCalendar created with \"" + TEST_VALUES_LEXICAL[onTestValue] + "\" was expected to be \""
                             + TEST_VALUES_LEXICAL[onTestValue + 1] + "\" and has the value \"" + xmlGregorianCalendar.toString() + "\"");
                 }
 
@@ -524,7 +524,7 @@ public class DatatypeFactoryTest {
 
                 // was this expected to succed?
                 if (!TEST_VALUES_LEXICAL[onTestValue + 1].equals(TEST_VALUE_FAIL)) {
-                    Assert.fail("the value \"" + TEST_VALUES_LEXICAL[onTestValue] + "\" is valid yet it failed with \"" + exception.toString() + "\"");
+                    fail("the value \"" + TEST_VALUES_LEXICAL[onTestValue] + "\" is valid yet it failed with \"" + exception.toString() + "\"");
                 }
                 // expected failure
             }
@@ -563,7 +563,7 @@ public class DatatypeFactoryTest {
         try {
             datatypeFactory = DatatypeFactory.newInstance();
         } catch (DatatypeConfigurationException datatypeConfigurationException) {
-            Assert.fail(datatypeConfigurationException.toString());
+            fail(datatypeConfigurationException.toString());
         }
 
         if (DEBUG) {
@@ -591,7 +591,7 @@ public class DatatypeFactoryTest {
                 }
 
                 // unexpected success, should have failed
-                Assert.fail("expected IllegalArgumentException " + "for DatatypeFactory.newXMLGregorianCalendar(" + invalidDates[valueIndex][0] + ", "
+                fail("expected IllegalArgumentException " + "for DatatypeFactory.newXMLGregorianCalendar(" + invalidDates[valueIndex][0] + ", "
                         + invalidDates[valueIndex][1] + ", " + invalidDates[valueIndex][2] + ", " + invalidDates[valueIndex][3] + ", "
                         + invalidDates[valueIndex][4] + ", " + invalidDates[valueIndex][5] + ", " + invalidDates[valueIndex][6] + ", "
                         + invalidDates[valueIndex][7] + ").  " + "Instead, XMLGregorianCalendar: \"" + xmlGregorianCalendar.toString() + "\" was created.");
@@ -624,7 +624,7 @@ public class DatatypeFactoryTest {
                 }
 
                 // unexpected success, should have failed
-                Assert.fail("expected IllegalArgumentException " + "for DatatypeFactory.newXMLGregorianCalendar(" + invalidDates[valueIndex][0] + ", "
+                fail("expected IllegalArgumentException " + "for DatatypeFactory.newXMLGregorianCalendar(" + invalidDates[valueIndex][0] + ", "
                         + invalidDates[valueIndex][1] + ", " + invalidDates[valueIndex][2] + ", " + invalidDates[valueIndex][3] + ", "
                         + invalidDates[valueIndex][4] + ", " + invalidDates[valueIndex][5] + ", " + invalidDates[valueIndex][6] + ", "
                         + invalidDates[valueIndex][7] + ").  " + "Instead, XMLGregorianCalendar: \"" + xmlGregorianCalendar.toString() + "\" was created.");
diff --git a/test/jaxp/javax/xml/jaxp/unittest/datatype/DurationTest.java b/test/jaxp/javax/xml/jaxp/unittest/datatype/DurationTest.java
index d4d96449f82..6de8fe91370 100644
--- a/test/jaxp/javax/xml/jaxp/unittest/datatype/DurationTest.java
+++ b/test/jaxp/javax/xml/jaxp/unittest/datatype/DurationTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2014, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2014, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,6 +23,16 @@
 
 package datatype;
 
+import org.junit.jupiter.api.BeforeEach;
+import org.junit.jupiter.api.Test;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
+
+import javax.xml.datatype.DatatypeConfigurationException;
+import javax.xml.datatype.DatatypeConstants;
+import javax.xml.datatype.DatatypeFactory;
+import javax.xml.datatype.Duration;
+import javax.xml.namespace.QName;
 import java.math.BigDecimal;
 import java.math.BigInteger;
 import java.util.Calendar;
@@ -30,47 +40,37 @@ import java.util.Date;
 import java.util.GregorianCalendar;
 import java.util.TimeZone;
 
-import javax.xml.datatype.DatatypeConfigurationException;
-import javax.xml.datatype.DatatypeConstants;
-import javax.xml.datatype.DatatypeFactory;
-import javax.xml.datatype.Duration;
-import javax.xml.namespace.QName;
-
-import org.testng.Assert;
-import org.testng.AssertJUnit;
-import org.testng.annotations.BeforeMethod;
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertFalse;
+import static org.junit.jupiter.api.Assertions.assertThrows;
+import static org.junit.jupiter.api.Assertions.assertTrue;
+import static org.junit.jupiter.api.Assertions.fail;
 
 /*
  * @test
  * @bug 8190835
  * @library /javax/xml/jaxp/libs /javax/xml/jaxp/unittest
- * @run testng/othervm datatype.DurationTest
+ * @run junit/othervm datatype.DurationTest
  * @summary Test Duration.
  */
 public class DurationTest {
 
     private final static boolean DEBUG = true;
 
-    protected Duration duration = null;
+    private DatatypeFactory factory = null;
+    private Duration duration = null;
 
-    @BeforeMethod
-    public void setUp() {
-        try {
-            duration = DatatypeFactory.newInstance().newDuration(100);
-        } catch (DatatypeConfigurationException dce) {
-            dce.printStackTrace();
-            Assert.fail("Failed to create instance of DatatypeFactory " + dce.getMessage());
-        }
+    @BeforeEach
+    public void setUp() throws DatatypeConfigurationException {
+        factory = DatatypeFactory.newInstance();
+        duration = factory.newDuration(100);
     }
 
     /*
        DataProvider: for testDurationSubtract1
        Data: minuend, subtrahend, expected result
      */
-    @DataProvider(name = "DurationSubtract1")
-    public Object[][] getSubtract1() {
+    public static Object[][] getSubtract1() {
 
         return new Object[][]{
             {"P2Y2M", "P1Y5M", "P9M"},
@@ -84,8 +84,7 @@ public class DurationTest {
         };
     }
 
-    @DataProvider(name = "DurationSubtract2")
-    public Object[][] getSubtract2() {
+    public static Object[][] getSubtract2() {
 
         return new Object[][]{
             {"P2Y20D", "P1Y125D"},
@@ -96,67 +95,60 @@ public class DurationTest {
     /*
      * Verifies valid substraction operations.
      */
-    @Test(dataProvider = "DurationSubtract1")
-    public void testDurationSubtract1(String t1, String t2, String e) throws Exception {
-        DatatypeFactory factory = DatatypeFactory.newInstance();
+    @ParameterizedTest
+    @MethodSource("getSubtract1")
+    public void testDurationSubtract1(String t1, String t2, String e) {
         Duration dt1 = factory.newDuration(t1);
         Duration dt2 = factory.newDuration(t2);
 
         Duration result = dt1.subtract(dt2);
-        Duration expected = factory.newDuration(e);
-        Assert.assertTrue(result.equals(expected), "The result should be " + e);
+        assertEquals(factory.newDuration(e), result, "The result should be " + e);
 
     }
 
     /*
      * Verifies invalid substraction operations. These operations are invalid
      * since days in a month are indeterminate.
-    */
-    @Test(dataProvider = "DurationSubtract2", expectedExceptions = IllegalStateException.class)
-    public void testDurationSubtract2(String t1, String t2) throws Exception {
-        DatatypeFactory factory = DatatypeFactory.newInstance();
+     */
+    @ParameterizedTest
+    @MethodSource("getSubtract2")
+    public void testDurationSubtract2(String t1, String t2) {
         Duration dt1 = factory.newDuration(t1);
         Duration dt2 = factory.newDuration(t2);
-        Duration result = dt1.subtract(dt2);
+        assertThrows(IllegalStateException.class, () -> dt1.subtract(dt2));
     }
 
     @Test
     public void testDurationSubtract() {
-        try {
-            Duration bigDur = DatatypeFactory.newInstance().newDuration(20000);
-            Duration smallDur = DatatypeFactory.newInstance().newDuration(10000);
-            if (smallDur.subtract(bigDur).getSign() != -1) {
-                Assert.fail("smallDur.subtract(bigDur).getSign() is not -1");
-            }
-            if (bigDur.subtract(smallDur).getSign() != 1) {
-                Assert.fail("bigDur.subtract(smallDur).getSign() is not 1");
-            }
-            if (smallDur.subtract(smallDur).getSign() != 0) {
-                Assert.fail("smallDur.subtract(smallDur).getSign() is not 0");
-            }
-        } catch (DatatypeConfigurationException e) {
-            e.printStackTrace();
+        Duration bigDur = factory.newDuration(20000);
+        Duration smallDur = factory.newDuration(10000);
+        if (smallDur.subtract(bigDur).getSign() != -1) {
+            fail("smallDur.subtract(bigDur).getSign() is not -1");
         }
+        if (bigDur.subtract(smallDur).getSign() != 1) {
+            fail("bigDur.subtract(smallDur).getSign() is not 1");
+        }
+        if (smallDur.subtract(smallDur).getSign() != 0) {
+            fail("smallDur.subtract(smallDur).getSign() is not 0");
+        }
+
     }
 
     @Test
     public void testDurationMultiply() {
         int num = 5000; // millisends. 5 seconds
         int factor = 2;
-        try {
-            Duration dur = DatatypeFactory.newInstance().newDuration(num);
-            if (dur.multiply(factor).getSeconds() != 10) {
-                Assert.fail("duration.multiply() return wrong value");
-            }
-            // factor is 2*10^(-1)
-            if (dur.multiply(new BigDecimal(new BigInteger("2"), 1)).getSeconds() != 1) {
-                Assert.fail("duration.multiply() return wrong value");
-            }
-            if (dur.subtract(DatatypeFactory.newInstance().newDuration(1000)).multiply(new BigDecimal(new BigInteger("2"), 1)).getSeconds() != 0) {
-                Assert.fail("duration.multiply() return wrong value");
-            }
-        } catch (DatatypeConfigurationException e) {
-            e.printStackTrace();
+
+        Duration dur = factory.newDuration(num);
+        if (dur.multiply(factor).getSeconds() != 10) {
+            fail("duration.multiply() return wrong value");
+        }
+        // factor is 2*10^(-1)
+        if (dur.multiply(new BigDecimal(new BigInteger("2"), 1)).getSeconds() != 1) {
+            fail("duration.multiply() return wrong value");
+        }
+        if (dur.subtract(factory.newDuration(1000)).multiply(new BigDecimal(new BigInteger("2"), 1)).getSeconds() != 0) {
+            fail("duration.multiply() return wrong value");
         }
     }
 
@@ -169,73 +161,55 @@ public class DurationTest {
         int min = 5;
         int sec = 6;
         String lexicalRepresentation = "P" + year + "Y" + month + "M" + day + "DT" + hour + "H" + min + "M" + sec + "S";
-        try {
-            Duration dur = DatatypeFactory.newInstance().newDuration(lexicalRepresentation);
-            System.out.println(dur.toString());
-            AssertJUnit.assertTrue("year should be 1", dur.getYears() == year);
-            AssertJUnit.assertTrue("month should be 2", dur.getMonths() == month);
-            AssertJUnit.assertTrue("day should be 3", dur.getDays() == day);
-            AssertJUnit.assertTrue("hour should be 4", dur.getHours() == hour);
-            AssertJUnit.assertTrue("minute should be 5", dur.getMinutes() == min);
-            AssertJUnit.assertTrue("second should be 6", dur.getSeconds() == sec);
-        } catch (DatatypeConfigurationException e) {
-            e.printStackTrace();
-        }
+
+        Duration dur = factory.newDuration(lexicalRepresentation);
+        System.out.println(dur.toString());
+        assertEquals(year, dur.getYears(), "year should be 1");
+        assertEquals(month, dur.getMonths(), "month should be 2");
+        assertEquals(day, dur.getDays(), "day should be 3");
+        assertEquals(hour, dur.getHours(), "hour should be 4");
+        assertEquals(min, dur.getMinutes(), "minute should be 5");
+        assertEquals(sec, dur.getSeconds(), "second should be 6");
     }
 
     @Test
     public void testDurationAndCalendar2() {
-        try {
-            AssertJUnit.assertTrue("10.00099S means 10 sec since it will be rounded to zero", DatatypeFactory.newInstance().newDuration("PT10.00099S")
-                    .getTimeInMillis(new Date()) == 10000);
-            AssertJUnit.assertTrue("10.00099S means 10 sec since it will be rounded to zero", DatatypeFactory.newInstance().newDuration("-PT10.00099S")
-                    .getTimeInMillis(new Date()) == -10000);
-            AssertJUnit.assertTrue("10.00099S means 10 sec since it will be rounded to zero", DatatypeFactory.newInstance().newDuration("PT10.00099S")
-                    .getTimeInMillis(new GregorianCalendar()) == 10000);
-            AssertJUnit.assertTrue("10.00099S means 10 sec since it will be rounded to zero", DatatypeFactory.newInstance().newDuration("-PT10.00099S")
-                    .getTimeInMillis(new GregorianCalendar()) == -10000);
-        } catch (DatatypeConfigurationException e) {
-            e.printStackTrace();
-        }
+        assertEquals(10000, factory.newDuration("PT10.00099S")
+                .getTimeInMillis(new Date()), "10.00099S means 10 sec since it will be rounded to zero");
+        assertEquals(-10000, factory.newDuration("-PT10.00099S")
+                .getTimeInMillis(new Date()), "10.00099S means 10 sec since it will be rounded to zero");
+        assertEquals(10000, factory.newDuration("PT10.00099S")
+                .getTimeInMillis(new GregorianCalendar()), "10.00099S means 10 sec since it will be rounded to zero");
+        assertEquals(-10000, factory.newDuration("-PT10.00099S")
+                .getTimeInMillis(new GregorianCalendar()), "10.00099S means 10 sec since it will be rounded to zero");
     }
 
     @Test
     public void testDurationAndCalendar3() {
-        try {
-            Calendar cal = new GregorianCalendar();
-            cal.set(Calendar.SECOND, 59);
-            DatatypeFactory.newInstance().newDuration(10000).addTo(cal);
-            AssertJUnit.assertTrue("sec will be 9", cal.get(Calendar.SECOND) == 9);
+        Calendar cal = new GregorianCalendar();
+        cal.set(Calendar.SECOND, 59);
+        factory.newDuration(10000).addTo(cal);
+        assertEquals(9, cal.get(Calendar.SECOND), "sec will be 9");
 
-            Date date = new Date();
-            date.setSeconds(59);
-            DatatypeFactory.newInstance().newDuration(10000).addTo(date);
-            AssertJUnit.assertTrue("sec will be 9", date.getSeconds() == 9);
-        } catch (DatatypeConfigurationException e) {
-            e.printStackTrace();
-        }
+        Date date = new Date();
+        date.setSeconds(59);
+        factory.newDuration(10000).addTo(date);
+        assertEquals(9, date.getSeconds(), "sec will be 9");
     }
 
     @Test
     public void testEqualsWithDifferentObjectParam() {
-
-        AssertJUnit.assertFalse("equals method should return false for any object other than Duration", duration.equals(new Integer(0)));
+        assertFalse(duration.equals(new Integer(0)), "equals method should return false for any object other than Duration");
     }
 
     @Test
     public void testEqualsWithNullObjectParam() {
-
-        AssertJUnit.assertFalse("equals method should return false for null parameter", duration.equals(null));
+        assertFalse(duration.equals(null), "equals method should return false for null parameter");
     }
 
     @Test
     public void testEqualsWithEqualObjectParam() {
-        try {
-            AssertJUnit.assertTrue("equals method is expected to return true", duration.equals(DatatypeFactory.newInstance().newDuration(100)));
-        } catch (DatatypeConfigurationException dce) {
-            dce.printStackTrace();
-            Assert.fail("Failed to create instance of DatatypeFactory " + dce.getMessage());
-        }
+        assertTrue(duration.equals(factory.newDuration(100)), "equals method is expected to return true");
     }
 
     /**
@@ -250,13 +224,7 @@ public class DurationTest {
                 { "PT2678400S", "<>", "P1M" }, { "PT31536000S", "<>", "P1Y" }, { "PT31622400S", "<>", "P1Y" }, { "PT525600M", "<>", "P1Y" },
                 { "PT527040M", "<>", "P1Y" }, { "PT8760H", "<>", "P1Y" }, { "PT8784H", "<>", "P1Y" }, { "P365D", "<>", "P1Y" }, };
 
-        DatatypeFactory df = null;
-        try {
-            df = DatatypeFactory.newInstance();
-        } catch (DatatypeConfigurationException ex) {
-            ex.printStackTrace();
-            Assert.fail(ex.toString());
-        }
+        DatatypeFactory df = factory;
 
         boolean compareErrors = false;
 
@@ -272,7 +240,7 @@ public class DurationTest {
             // tested
             if (expected != cmp) {
                 compareErrors = true;
-                System.err.println("returned " + cmp2str(cmp) + " for durations \'" + duration1 + "\' and " + duration2 + "\', but expected "
+                System.err.println("returned " + cmp2str(cmp) + " for durations '" + duration1 + "' and " + duration2 + "', but expected "
                         + cmp2str(expected));
             }
         }
@@ -280,7 +248,7 @@ public class DurationTest {
         if (compareErrors) {
             // TODO; fix bug, these tests should pass
             if (false) {
-                Assert.fail("Errors in comparing indeterminate relations, see Stderr");
+                fail("Errors in comparing indeterminate relations, see Stderr");
             } else {
                 System.err.println("Please fix this bug: " + "Errors in comparing indeterminate relations, see Stderr");
             }
@@ -297,7 +265,7 @@ public class DurationTest {
      * description concerning return values range.
      */
     @Test
-    public void testNormalizedReturnValues() throws Exception {
+    public void testNormalizedReturnValues() {
 
         final Object[] TEST_VALUES = {
                 // test 61 seconds -> 1 minute, 1 second
@@ -348,9 +316,9 @@ public class DurationTest {
         };
 
         for (int onValue = 0; onValue < TEST_VALUES.length; onValue += 9) {
-            newDurationTester(((Boolean) TEST_VALUES[onValue]).booleanValue(), // isPositive,
-                    ((Boolean) NORM_VALUES[onValue]).booleanValue(), // normalized
-                                                                     // isPositive,
+            newDurationTester((Boolean) TEST_VALUES[onValue], // isPositive,
+                    (Boolean) NORM_VALUES[onValue], // normalized
+                    // isPositive,
                     (BigInteger) TEST_VALUES[onValue + 1], // years,
                     (BigInteger) NORM_VALUES[onValue + 1], // normalized years,
                     (BigInteger) TEST_VALUES[onValue + 2], // months
@@ -363,16 +331,16 @@ public class DurationTest {
                     (BigInteger) NORM_VALUES[onValue + 5], // normalized minutes
                     (BigDecimal) TEST_VALUES[onValue + 6], // seconds
                     (BigDecimal) NORM_VALUES[onValue + 6], // normalized seconds
-                    ((Long) TEST_VALUES[onValue + 7]).longValue(), // durationInMilliSeconds,
-                    ((Long) NORM_VALUES[onValue + 7]).longValue(), // normalized
-                                                                   // durationInMilliSeconds,
+                    (Long) TEST_VALUES[onValue + 7], // durationInMilliSeconds,
+                    (Long) NORM_VALUES[onValue + 7], // normalized
+                    // durationInMilliSeconds,
                     (String) TEST_VALUES[onValue + 8], // lexicalRepresentation
                     (String) NORM_VALUES[onValue + 8]); // normalized
                                                         // lexicalRepresentation
 
-            newDurationDayTimeTester(((Boolean) TEST_VALUES[onValue]).booleanValue(), // isPositive,
-                    ((Boolean) NORM_VALUES[onValue]).booleanValue(), // normalized
-                                                                     // isPositive,
+            newDurationDayTimeTester((Boolean) TEST_VALUES[onValue], // isPositive,
+                    (Boolean) NORM_VALUES[onValue], // normalized
+                    // isPositive,
                     BigInteger.ZERO, // years,
                     BigInteger.ZERO, // normalized years,
                     BigInteger.ZERO, // months
@@ -385,9 +353,9 @@ public class DurationTest {
                     (BigInteger) NORM_VALUES[onValue + 5], // normalized minutes
                     (BigDecimal) TEST_VALUES[onValue + 6], // seconds
                     (BigDecimal) NORM_VALUES[onValue + 6], // normalized seconds
-                    ((Long) TEST_VALUES[onValue + 7]).longValue(), // durationInMilliSeconds,
-                    ((Long) NORM_VALUES[onValue + 7]).longValue(), // normalized
-                                                                   // durationInMilliSeconds,
+                    (Long) TEST_VALUES[onValue + 7], // durationInMilliSeconds,
+                    (Long) NORM_VALUES[onValue + 7], // normalized
+                    // durationInMilliSeconds,
                     (String) TEST_VALUES[onValue + 8], // lexicalRepresentation
                     (String) NORM_VALUES[onValue + 8]); // normalized
                                                         // lexicalRepresentation
@@ -399,33 +367,24 @@ public class DurationTest {
             BigInteger normalizedMinutes, BigDecimal seconds, BigDecimal normalizedSeconds, long durationInMilliSeconds, long normalizedDurationInMilliSeconds,
             String lexicalRepresentation, String normalizedLexicalRepresentation) {
 
-        DatatypeFactory datatypeFactory = null;
-        try {
-            datatypeFactory = DatatypeFactory.newInstance();
-        } catch (DatatypeConfigurationException ex) {
-            ex.printStackTrace();
-            Assert.fail(ex.toString());
-        }
-
         // create 4 Durations using the 4 different constructors
-
-        Duration durationBigInteger = datatypeFactory.newDuration(isPositive, years, months, days, hours, minutes, seconds);
+        Duration durationBigInteger = factory.newDuration(isPositive, years, months, days, hours, minutes, seconds);
         durationAssertEquals(durationBigInteger, DatatypeConstants.DURATION, normalizedIsPositive, normalizedYears.intValue(), normalizedMonths.intValue(),
                 normalizedDays.intValue(), normalizedHours.intValue(), normalizedMinutes.intValue(), normalizedSeconds.intValue(),
                 normalizedDurationInMilliSeconds, normalizedLexicalRepresentation);
 
-        Duration durationInt = datatypeFactory.newDuration(isPositive, years.intValue(), months.intValue(), days.intValue(), hours.intValue(),
+        Duration durationInt = factory.newDuration(isPositive, years.intValue(), months.intValue(), days.intValue(), hours.intValue(),
                 minutes.intValue(), seconds.intValue());
         durationAssertEquals(durationInt, DatatypeConstants.DURATION, normalizedIsPositive, normalizedYears.intValue(), normalizedMonths.intValue(),
                 normalizedDays.intValue(), normalizedHours.intValue(), normalizedMinutes.intValue(), normalizedSeconds.intValue(),
                 normalizedDurationInMilliSeconds, normalizedLexicalRepresentation);
 
-        Duration durationMilliseconds = datatypeFactory.newDuration(durationInMilliSeconds);
+        Duration durationMilliseconds = factory.newDuration(durationInMilliSeconds);
         durationAssertEquals(durationMilliseconds, DatatypeConstants.DURATION, normalizedIsPositive, normalizedYears.intValue(), normalizedMonths.intValue(),
                 normalizedDays.intValue(), normalizedHours.intValue(), normalizedMinutes.intValue(), normalizedSeconds.intValue(),
                 normalizedDurationInMilliSeconds, normalizedLexicalRepresentation);
 
-        Duration durationLexical = datatypeFactory.newDuration(lexicalRepresentation);
+        Duration durationLexical = factory.newDuration(lexicalRepresentation);
         durationAssertEquals(durationLexical, DatatypeConstants.DURATION, normalizedIsPositive, normalizedYears.intValue(), normalizedMonths.intValue(),
                 normalizedDays.intValue(), normalizedHours.intValue(), normalizedMinutes.intValue(), normalizedSeconds.intValue(),
                 normalizedDurationInMilliSeconds, normalizedLexicalRepresentation);
@@ -436,17 +395,8 @@ public class DurationTest {
             BigInteger normalizedMinutes, BigDecimal seconds, BigDecimal normalizedSeconds, long durationInMilliSeconds, long normalizedDurationInMilliSeconds,
             String lexicalRepresentation, String normalizedLexicalRepresentation) {
 
-        DatatypeFactory datatypeFactory = null;
-        try {
-            datatypeFactory = DatatypeFactory.newInstance();
-        } catch (DatatypeConfigurationException ex) {
-            ex.printStackTrace();
-            Assert.fail(ex.toString());
-        }
-
         // create 4 dayTime Durations using the 4 different constructors
-
-        Duration durationDayTimeBigInteger = datatypeFactory.newDurationDayTime(isPositive, days, hours, minutes, seconds.toBigInteger());
+        Duration durationDayTimeBigInteger = factory.newDurationDayTime(isPositive, days, hours, minutes, seconds.toBigInteger());
         durationAssertEquals(durationDayTimeBigInteger, DatatypeConstants.DURATION_DAYTIME, normalizedIsPositive, normalizedYears.intValue(),
                 normalizedMonths.intValue(), normalizedDays.intValue(), normalizedHours.intValue(), normalizedMinutes.intValue(), normalizedSeconds.intValue(),
                 normalizedDurationInMilliSeconds, normalizedLexicalRepresentation);
@@ -482,7 +432,7 @@ public class DurationTest {
 
         // sign
         if (DEBUG) {
-            boolean actual = (duration.getSign() == 1) ? true : false;
+            boolean actual = duration.getSign() == 1;
             System.out.println("sign:");
             System.out.println("    expected: \"" + isPositive + "\"");
             System.out.println("    actual:   \"" + actual + "\"");
diff --git a/test/jaxp/javax/xml/jaxp/unittest/datatype/FactoryFindTest.java b/test/jaxp/javax/xml/jaxp/unittest/datatype/FactoryFindTest.java
index 47a965e8665..5c37c4f435c 100644
--- a/test/jaxp/javax/xml/jaxp/unittest/datatype/FactoryFindTest.java
+++ b/test/jaxp/javax/xml/jaxp/unittest/datatype/FactoryFindTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2014, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2014, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,48 +23,48 @@
 
 package datatype;
 
+import org.junit.jupiter.api.Test;
+
+import javax.xml.datatype.DatatypeFactory;
 import java.net.URL;
 import java.net.URLClassLoader;
-import javax.xml.datatype.DatatypeFactory;
-import org.testng.Assert;
-import org.testng.annotations.Test;
+
+import static org.junit.jupiter.api.Assertions.assertNotNull;
+import static org.junit.jupiter.api.Assertions.assertNull;
+import static org.junit.jupiter.api.Assertions.assertTrue;
 
 /*
  * @test
  * @library /javax/xml/jaxp/libs /javax/xml/jaxp/unittest
- * @run testng/othervm datatype.FactoryFindTest
+ * @run junit/othervm datatype.FactoryFindTest
  * @summary Test Classloader for DatatypeFactory.
  */
 public class FactoryFindTest {
 
-    boolean myClassLoaderUsed = false;
-
     @Test
     public void testFactoryFind() throws Exception {
         DatatypeFactory factory = DatatypeFactory.newInstance();
-        Assert.assertTrue(factory.getClass().getClassLoader() == null);
+        assertNull(factory.getClass().getClassLoader());
 
         Thread.currentThread().setContextClassLoader(null);
-
         factory = DatatypeFactory.newInstance();
-        Assert.assertTrue(factory.getClass().getClassLoader() == null);
+        assertNull(factory.getClass().getClassLoader());
 
-        Thread.currentThread().setContextClassLoader(new MyClassLoader());
-        factory = DatatypeFactory.newInstance();
-        if (System.getSecurityManager() == null)
-            Assert.assertTrue(myClassLoaderUsed);
-        else
-            Assert.assertFalse(myClassLoaderUsed);
+        MyClassLoader customLoader = new MyClassLoader();
+        Thread.currentThread().setContextClassLoader(customLoader);
+        assertNotNull(DatatypeFactory.newInstance());
+        assertTrue(customLoader.wasUsed);
     }
 
-    class MyClassLoader extends URLClassLoader {
+    static class MyClassLoader extends URLClassLoader {
+        boolean wasUsed = false;
 
         public MyClassLoader() {
             super(new URL[0]);
         }
 
-        public Class loadClass(String name) throws ClassNotFoundException {
-            myClassLoaderUsed = true;
+        public Class<?> loadClass(String name) throws ClassNotFoundException {
+            wasUsed = true;
             return super.loadClass(name);
         }
     }
diff --git a/test/jaxp/javax/xml/jaxp/unittest/datatype/HashCodeTest.java b/test/jaxp/javax/xml/jaxp/unittest/datatype/HashCodeTest.java
index 6d16c676918..9ade9bceb63 100644
--- a/test/jaxp/javax/xml/jaxp/unittest/datatype/HashCodeTest.java
+++ b/test/jaxp/javax/xml/jaxp/unittest/datatype/HashCodeTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2020, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,16 +23,19 @@
 
 package datatype;
 
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
+
 import javax.xml.datatype.DatatypeFactory;
 import javax.xml.datatype.XMLGregorianCalendar;
-import org.testng.annotations.Test;
-import org.testng.Assert;
-import org.testng.annotations.DataProvider;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertNotEquals;
 
 /*
  * @test
  * @bug 8246816
- * @run testng datatype.HashCodeTest
+ * @run junit datatype.HashCodeTest
  * @summary Test hashCode generation.
  */
 public class HashCodeTest {
@@ -40,26 +43,26 @@ public class HashCodeTest {
        DataProvider: for testHashCode
        Data: datetime1, datetime2, flag indicating if their hashCodes are equal
      */
-    @DataProvider(name = "testHashCode")
-    public Object[][] getData() {
+    public static Object[][] getData() {
 
-        return new Object[][]{
-            // the reported case: identical hash codes before the patch
-            {"2020-04-24T12:53:00+02:00", "2020-06-04T06:58:17.727Z", false},
-            // a case mentioned in the dev note of hashCode() implementation
-            {"2000-01-15T12:00:00-05:00", "2000-01-15T13:00:00-04:00", true},
-            /**
-             * Comparing with a datetime that needs to be normalized.
-             * Before the patch, XMLGregorianCalendarImpl called the normalizeToTimezone
-             * method that will set UNDEFINED fractional second to zero.
-             */
-            {"2000-01-01T03:19:04Z", "1999-12-31T23:49:04-03:30", true},
-            // another case mentioned in the javadoc of XMLGregorianCalendar::normalize()
-            {"2000-03-04T23:00:00+03:00", "2000-03-04T20:00:00Z", true},
+        return new Object[][] {
+                // the reported case: identical hash codes before the patch
+                { "2020-04-24T12:53:00+02:00", "2020-06-04T06:58:17.727Z", false },
+                // a case mentioned in the dev note of hashCode() implementation
+                { "2000-01-15T12:00:00-05:00", "2000-01-15T13:00:00-04:00", true },
+                /*
+                 * Comparing with a datetime that needs to be normalized.
+                 * Before the patch, XMLGregorianCalendarImpl called the normalizeToTimezone
+                 * method that will set UNDEFINED fractional second to zero.
+                 */
+                { "2000-01-01T03:19:04Z", "1999-12-31T23:49:04-03:30", true },
+                // another case mentioned in the javadoc of XMLGregorianCalendar::normalize()
+                { "2000-03-04T23:00:00+03:00", "2000-03-04T20:00:00Z", true },
         };
     }
 
-    @Test(dataProvider = "testHashCode")
+    @ParameterizedTest
+    @MethodSource("getData")
     public final void testHashCode(String dt1, String dt2, boolean equal) throws Exception {
         DatatypeFactory dataTypeFactory = DatatypeFactory.newInstance();
         XMLGregorianCalendar cal1 = dataTypeFactory.newXMLGregorianCalendar(dt1);
@@ -70,11 +73,11 @@ public class HashCodeTest {
         int hashCode2 = cal2.hashCode();
 
         if (equal) {
-            Assert.assertTrue(cal1.equals(cal2));
-            Assert.assertEquals(hashCode1, hashCode2);
+            assertEquals(cal1, cal2);
+            assertEquals(hashCode1, hashCode2);
         } else {
-            Assert.assertFalse(cal1.equals(cal2));
-            Assert.assertNotEquals(hashCode1, hashCode2);
+            assertNotEquals(cal1, cal2);
+            assertNotEquals(hashCode1, hashCode2);
         }
     }
 }
diff --git a/test/jaxp/javax/xml/jaxp/unittest/datatype/JDK8068839Test.java b/test/jaxp/javax/xml/jaxp/unittest/datatype/JDK8068839Test.java
index 7fe96d741ee..cebdf563946 100644
--- a/test/jaxp/javax/xml/jaxp/unittest/datatype/JDK8068839Test.java
+++ b/test/jaxp/javax/xml/jaxp/unittest/datatype/JDK8068839Test.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2015, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2015, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -22,18 +22,19 @@
  */
 package datatype;
 
+import org.junit.jupiter.api.Test;
+
 import javax.xml.datatype.DatatypeConfigurationException;
 import javax.xml.datatype.DatatypeFactory;
 import javax.xml.datatype.Duration;
 
-import org.testng.Assert;
-import org.testng.annotations.Test;
+import static org.junit.jupiter.api.Assertions.assertEquals;
 
 /*
  * @test
  * @bug 8068839
  * @library /javax/xml/jaxp/libs /javax/xml/jaxp/unittest
- * @run testng/othervm datatype.JDK8068839Test
+ * @run junit/othervm datatype.JDK8068839Test
  * @summary Verifies that Duration's edge cases
  */
 public class JDK8068839Test {
@@ -42,9 +43,9 @@ public class JDK8068839Test {
     public void test() throws DatatypeConfigurationException {
         DatatypeFactory df = DatatypeFactory.newInstance();
         Duration durationx = df.newDuration(Long.MIN_VALUE);
-        Assert.assertEquals(durationx.toString(), "-P292277024Y7M16DT7H12M55.808S");
+        assertEquals("-P292277024Y7M16DT7H12M55.808S", durationx.toString());
         durationx = df.newDuration(Long.MAX_VALUE);
-        Assert.assertEquals(durationx.toString(), "P292277024Y7M16DT7H12M55.807S");
+        assertEquals("P292277024Y7M16DT7H12M55.807S", durationx.toString());
     }
 
 }
diff --git a/test/jaxp/javax/xml/jaxp/unittest/datatype/XMLGregorianCalendarTest.java b/test/jaxp/javax/xml/jaxp/unittest/datatype/XMLGregorianCalendarTest.java
index df97f5c7a2b..3a5be07b02d 100644
--- a/test/jaxp/javax/xml/jaxp/unittest/datatype/XMLGregorianCalendarTest.java
+++ b/test/jaxp/javax/xml/jaxp/unittest/datatype/XMLGregorianCalendarTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2014, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2014, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,19 +23,23 @@
 
 package datatype;
 
+import org.junit.jupiter.api.BeforeEach;
+import org.junit.jupiter.api.Test;
+
 import javax.xml.datatype.DatatypeConfigurationException;
 import javax.xml.datatype.DatatypeConstants;
 import javax.xml.datatype.DatatypeFactory;
 import javax.xml.datatype.XMLGregorianCalendar;
 
-import org.testng.Assert;
-import org.testng.annotations.BeforeMethod;
-import org.testng.annotations.Test;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertFalse;
+import static org.junit.jupiter.api.Assertions.assertTrue;
+import static org.junit.jupiter.api.Assertions.fail;
 
 /*
  * @test
  * @library /javax/xml/jaxp/libs /javax/xml/jaxp/unittest
- * @run testng/othervm datatype.XMLGregorianCalendarTest
+ * @run junit/othervm datatype.XMLGregorianCalendarTest
  * @summary Test XMLGregorianCalendar.
  */
 public class XMLGregorianCalendarTest {
@@ -46,41 +50,26 @@ public class XMLGregorianCalendarTest {
 
     private static final int TEST_VALUE_PASS = 1;
 
+    private DatatypeFactory factory;
     private XMLGregorianCalendar calendar;
 
-    @BeforeMethod
-    public void setUp() {
-        try {
-            calendar = DatatypeFactory.newInstance().newXMLGregorianCalendar();
-        } catch (DatatypeConfigurationException dce) {
-            dce.printStackTrace();
-            Assert.fail("Failed to create instance of DatatypeFactory " + dce.getMessage());
-        }
+    @BeforeEach
+    public void setUp() throws DatatypeConfigurationException {
+        factory = DatatypeFactory.newInstance();
+        calendar = factory.newXMLGregorianCalendar();
     }
 
     @Test
     public final void testSetTime() {
 
-        /**
+        /*
          * Hour, minute, second values to test and expected result.
          */
         final int[] TEST_VALUES = { 24, 0, 0, TEST_VALUE_PASS, 24, 1, 0, TEST_VALUE_FAIL, 24, 0, 1, TEST_VALUE_FAIL, 24, DatatypeConstants.FIELD_UNDEFINED, 0,
                 TEST_VALUE_FAIL, 24, 0, DatatypeConstants.FIELD_UNDEFINED, TEST_VALUE_FAIL };
 
-        // create DatatypeFactory
-        DatatypeFactory datatypeFactory = null;
-        try {
-            datatypeFactory = DatatypeFactory.newInstance();
-        } catch (DatatypeConfigurationException datatypeConfigurationException) {
-            Assert.fail(datatypeConfigurationException.toString());
-        }
-
-        if (DEBUG) {
-            System.err.println("DatatypeFactory created: " + datatypeFactory.toString());
-        }
-
         // create XMLGregorianCalendar
-        XMLGregorianCalendar xmlGregorianCalendar = datatypeFactory.newXMLGregorianCalendar();
+        XMLGregorianCalendar xmlGregorianCalendar = factory.newXMLGregorianCalendar();
 
         // test each value
         for (int onTestValue = 0; onTestValue < TEST_VALUES.length; onTestValue = onTestValue + 4) {
@@ -95,24 +84,24 @@ public class XMLGregorianCalendarTest {
                 xmlGregorianCalendar.setTime(TEST_VALUES[onTestValue], TEST_VALUES[onTestValue + 1], TEST_VALUES[onTestValue + 2]);
 
                 if (DEBUG) {
-                    System.err.println("XMLGregorianCalendar created: \"" + xmlGregorianCalendar.toString() + "\"");
+                    System.err.println("XMLGregorianCalendar created: \"" + xmlGregorianCalendar + "\"");
                 }
 
                 // was this expected to fail?
                 if (TEST_VALUES[onTestValue + 3] == TEST_VALUE_FAIL) {
-                    Assert.fail("the values: (" + TEST_VALUES[onTestValue] + ", " + TEST_VALUES[onTestValue + 1] + ", " + TEST_VALUES[onTestValue + 2]
-                            + ") are invalid, " + "yet it created the XMLGregorianCalendar \"" + xmlGregorianCalendar.toString() + "\"");
+                    fail("the values: (" + TEST_VALUES[onTestValue] + ", " + TEST_VALUES[onTestValue + 1] + ", " + TEST_VALUES[onTestValue + 2]
+                            + ") are invalid, " + "yet it created the XMLGregorianCalendar \"" + xmlGregorianCalendar + "\"");
                 }
             } catch (Exception exception) {
 
                 if (DEBUG) {
-                    System.err.println("Exception in creating XMLGregorianCalendar: \"" + exception.toString() + "\"");
+                    System.err.println("Exception in creating XMLGregorianCalendar: \"" + exception + "\"");
                 }
 
                 // was this expected to succed?
                 if (TEST_VALUES[onTestValue + 3] == TEST_VALUE_PASS) {
-                    Assert.fail("the values: (" + TEST_VALUES[onTestValue] + ", " + TEST_VALUES[onTestValue + 1] + ", " + TEST_VALUES[onTestValue + 2]
-                            + ") are valid yet it failed with \"" + exception.toString() + "\"");
+                    fail("the values: (" + TEST_VALUES[onTestValue] + ", " + TEST_VALUES[onTestValue + 1] + ", " + TEST_VALUES[onTestValue + 2]
+                            + ") are valid yet it failed with \"" + exception + "\"");
                 }
                 // expected failure
             }
@@ -122,7 +111,7 @@ public class XMLGregorianCalendarTest {
     @Test
     public final void testSetHour() {
 
-        /**
+        /*
          * Hour values to test and expected result.
          */
         final int[] TEST_VALUES = {
@@ -133,20 +122,8 @@ public class XMLGregorianCalendarTest {
                 // violates Schema Errata
                 0, 0, 1, 24, TEST_VALUE_FAIL };
 
-        // create DatatypeFactory
-        DatatypeFactory datatypeFactory = null;
-        try {
-            datatypeFactory = DatatypeFactory.newInstance();
-        } catch (DatatypeConfigurationException datatypeConfigurationException) {
-            Assert.fail(datatypeConfigurationException.toString());
-        }
-
-        if (DEBUG) {
-            System.err.println("DatatypeFactory created: " + datatypeFactory.toString());
-        }
-
         // create XMLGregorianCalendar
-        XMLGregorianCalendar xmlGregorianCalendar = datatypeFactory.newXMLGregorianCalendar();
+        XMLGregorianCalendar xmlGregorianCalendar = factory.newXMLGregorianCalendar();
 
         // test each value
         for (int onTestValue = 0; onTestValue < TEST_VALUES.length; onTestValue = onTestValue + 5) {
@@ -163,25 +140,25 @@ public class XMLGregorianCalendarTest {
                 xmlGregorianCalendar.setHour(TEST_VALUES[onTestValue + 3]);
 
                 if (DEBUG) {
-                    System.err.println("XMLGregorianCalendar created: \"" + xmlGregorianCalendar.toString() + "\"");
+                    System.err.println("XMLGregorianCalendar created: \"" + xmlGregorianCalendar + "\"");
                 }
 
                 // was this expected to fail?
                 if (TEST_VALUES[onTestValue + 4] == TEST_VALUE_FAIL) {
-                    Assert.fail("the values: (" + TEST_VALUES[onTestValue] + ", " + TEST_VALUES[onTestValue + 1] + ", " + TEST_VALUES[onTestValue + 2] + ", "
-                            + TEST_VALUES[onTestValue + 3] + ") are invalid, " + "yet it created the XMLGregorianCalendar \"" + xmlGregorianCalendar.toString()
+                    fail("the values: (" + TEST_VALUES[onTestValue] + ", " + TEST_VALUES[onTestValue + 1] + ", " + TEST_VALUES[onTestValue + 2] + ", "
+                            + TEST_VALUES[onTestValue + 3] + ") are invalid, " + "yet it created the XMLGregorianCalendar \"" + xmlGregorianCalendar
                             + "\"");
                 }
             } catch (Exception exception) {
 
                 if (DEBUG) {
-                    System.err.println("Exception in creating XMLGregorianCalendar: \"" + exception.toString() + "\"");
+                    System.err.println("Exception in creating XMLGregorianCalendar: \"" + exception + "\"");
                 }
 
                 // was this expected to succed?
                 if (TEST_VALUES[onTestValue + 4] == TEST_VALUE_PASS) {
-                    Assert.fail("the values: (" + TEST_VALUES[onTestValue] + ", " + TEST_VALUES[onTestValue + 1] + ", " + TEST_VALUES[onTestValue + 2] + ", "
-                            + TEST_VALUES[onTestValue + 3] + ") are valid yet it failed with \"" + exception.toString() + "\"");
+                    fail("the values: (" + TEST_VALUES[onTestValue] + ", " + TEST_VALUES[onTestValue + 1] + ", " + TEST_VALUES[onTestValue + 2] + ", "
+                            + TEST_VALUES[onTestValue + 3] + ") are valid yet it failed with \"" + exception + "\"");
                 }
                 // expected failure
             }
@@ -190,38 +167,24 @@ public class XMLGregorianCalendarTest {
 
     @Test
     public void testEqualsWithDifferentObjectParam() {
-
-        Assert.assertFalse(calendar.equals(new Integer(0)), "equals method should return false for any object other" + " than XMLGregorianCalendar");
+        assertFalse(calendar.equals(new Integer(0)), "equals method should return false for any object other" + " than XMLGregorianCalendar");
     }
 
     @Test
     public void testEqualsWithNullObjectParam() {
-
-        Assert.assertFalse(calendar.equals(null), "equals method should return false for null parameter");
+        assertFalse(calendar.equals(null), "equals method should return false for null parameter");
     }
 
     @Test
     public void testEqualsWithEqualObjectParam() {
-
-        try {
-            Assert.assertTrue(calendar.equals(DatatypeFactory.newInstance().newXMLGregorianCalendar()), "equals method is expected to return true");
-        } catch (DatatypeConfigurationException dce) {
-            dce.printStackTrace();
-            Assert.fail("Failed to create instance of DatatypeFactory " + dce.getMessage());
-        }
+        assertTrue(calendar.equals(factory.newXMLGregorianCalendar()), "equals method is expected to return true");
     }
 
     @Test
     public void testToString() {
-        try {
-            String inputDateTime = "2006-10-23T22:15:01.000000135+08:00";
-            DatatypeFactory factory = DatatypeFactory.newInstance();
-            XMLGregorianCalendar calendar = factory.newXMLGregorianCalendar(inputDateTime);
-            String toStr = calendar.toString();
-            Assert.assertTrue(toStr.indexOf("E") == -1, "String value cannot contain exponent");
-        } catch (DatatypeConfigurationException dce) {
-            dce.printStackTrace();
-            Assert.fail("Failed to create instance of DatatypeFactory " + dce.getMessage());
-        }
+        String inputDateTime = "2006-10-23T22:15:01.000000135+08:00";
+        XMLGregorianCalendar calendar = factory.newXMLGregorianCalendar(inputDateTime);
+        String toStr = calendar.toString();
+        assertEquals(-1, toStr.indexOf("E"), "String value cannot contain exponent");
     }
 }
diff --git a/test/jaxp/javax/xml/jaxp/unittest/sax/Attributes2ImplTest.java b/test/jaxp/javax/xml/jaxp/unittest/sax/Attributes2ImplTest.java
index 8de2d8b1b22..71cbcb6a838 100644
--- a/test/jaxp/javax/xml/jaxp/unittest/sax/Attributes2ImplTest.java
+++ b/test/jaxp/javax/xml/jaxp/unittest/sax/Attributes2ImplTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2014, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2014, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,14 +23,18 @@
 
 package sax;
 
-import org.testng.Assert;
-import org.testng.annotations.Test;
+import org.junit.jupiter.api.Test;
 import org.xml.sax.ext.Attributes2Impl;
 
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertFalse;
+import static org.junit.jupiter.api.Assertions.assertThrows;
+import static org.junit.jupiter.api.Assertions.assertTrue;
+
 /*
  * @test
  * @library /javax/xml/jaxp/libs /javax/xml/jaxp/unittest
- * @run testng/othervm sax.Attributes2ImplTest
+ * @run junit/othervm sax.Attributes2ImplTest
  * @summary Test Attributes2Impl.
  */
 public class Attributes2ImplTest {
@@ -43,42 +47,25 @@ public class Attributes2ImplTest {
         impl.addAttribute("http://www.cars.com/xml", "attr2", "Qname2", "type", "value");
         impl.addAttribute("http://www.cars.com/xml", "attr3", "Qname3", "type", "value");
 
-        Assert.assertTrue(impl.isDeclared(0));
+        assertTrue(impl.isDeclared(0));
         impl.setDeclared(0, false);
-        Assert.assertFalse(impl.isDeclared(0));
+        assertFalse(impl.isDeclared(0));
 
-        Assert.assertTrue(impl.isDeclared("Qname2"));
+        assertTrue(impl.isDeclared("Qname2"));
         impl.setDeclared(1, false);
-        Assert.assertFalse(impl.isDeclared("Qname2"));
+        assertFalse(impl.isDeclared("Qname2"));
 
-        Assert.assertTrue(impl.isDeclared("http://www.cars.com/xml", "attr3"));
+        assertTrue(impl.isDeclared("http://www.cars.com/xml", "attr3"));
         impl.setDeclared(2, false);
-        Assert.assertFalse(impl.isDeclared(2));
+        assertFalse(impl.isDeclared(2));
 
-        try {
-            impl.isDeclared(3);
-        } catch (ArrayIndexOutOfBoundsException e) {
-            System.out.println("Expected ArrayIndexOutOfBoundsException");
-        }
+        assertThrows(ArrayIndexOutOfBoundsException.class, () -> impl.isDeclared(3));
 
-        try {
-            impl.isDeclared("wrongQname");
-        } catch (IllegalArgumentException e) {
-            System.out.println("Expected IllegalArgumentException");
-        }
-
-        try {
-            impl.isDeclared("http://www.cars.com/xml", "attr4");
-        } catch (IllegalArgumentException e) {
-            System.out.println("Expected IllegalArgumentException");
-        }
+        assertThrows(IllegalArgumentException.class, () -> impl.isDeclared("wrongQname"));
+        assertThrows(IllegalArgumentException.class, () -> impl.isDeclared("http://www.cars.com/xml", "attr4"));
 
         impl.removeAttribute(2);
-        try {
-            impl.isDeclared(2);
-        } catch (ArrayIndexOutOfBoundsException e) {
-            System.out.println("Expected ArrayIndexOutOfBoundsException on index=2 after removing");
-        }
+        assertThrows(ArrayIndexOutOfBoundsException.class, () -> impl.isDeclared(2));
     }
 
     @Test
@@ -89,42 +76,25 @@ public class Attributes2ImplTest {
         impl.addAttribute("http://www.cars.com/xml", "attr2", "Qname2", "type", "value");
         impl.addAttribute("http://www.cars.com/xml", "attr3", "Qname3", "type", "value");
 
-        Assert.assertTrue(impl.isSpecified(0));
+        assertTrue(impl.isSpecified(0));
         impl.setSpecified(0, false);
-        Assert.assertFalse(impl.isSpecified(0));
+        assertFalse(impl.isSpecified(0));
 
-        Assert.assertTrue(impl.isSpecified("Qname2"));
+        assertTrue(impl.isSpecified("Qname2"));
         impl.setSpecified(1, false);
-        Assert.assertFalse(impl.isSpecified("Qname2"));
+        assertFalse(impl.isSpecified("Qname2"));
 
-        Assert.assertTrue(impl.isSpecified("http://www.cars.com/xml", "attr3"));
+        assertTrue(impl.isSpecified("http://www.cars.com/xml", "attr3"));
         impl.setSpecified(2, false);
-        Assert.assertFalse(impl.isSpecified(2));
+        assertFalse(impl.isSpecified(2));
 
-        try {
-            impl.isSpecified(3);
-        } catch (ArrayIndexOutOfBoundsException e) {
-            System.out.println("Expected ArrayIndexOutOfBoundsException");
-        }
+        assertThrows(ArrayIndexOutOfBoundsException.class, () -> impl.isSpecified(3));
 
-        try {
-            impl.isSpecified("wrongQname");
-        } catch (IllegalArgumentException e) {
-            System.out.println("Expected IllegalArgumentException");
-        }
-
-        try {
-            impl.isSpecified("http://www.cars.com/xml", "attr4");
-        } catch (IllegalArgumentException e) {
-            System.out.println("Expected IllegalArgumentException");
-        }
+        assertThrows(IllegalArgumentException.class, () -> impl.isSpecified("wrongQname"));
+        assertThrows(IllegalArgumentException.class, () -> impl.isSpecified("http://www.cars.com/xml", "attr4"));
 
         impl.removeAttribute(2);
-        try {
-            impl.isSpecified(2);
-        } catch (ArrayIndexOutOfBoundsException e) {
-            System.out.println("Expected ArrayIndexOutOfBoundsException on index=2 after removing");
-        }
+        assertThrows(ArrayIndexOutOfBoundsException.class, () -> impl.isSpecified(2));
     }
 
     @Test
@@ -140,13 +110,13 @@ public class Attributes2ImplTest {
         Attributes2Impl impl3 = new Attributes2Impl();
         impl3.setAttributes(impl1);
 
-        Assert.assertTrue(impl1.getQName(0).equals(impl2.getQName(0)));
-        Assert.assertTrue(impl1.getQName(0).equals(impl3.getQName(0)));
+        assertEquals(impl1.getQName(0), impl2.getQName(0));
+        assertEquals(impl1.getQName(0), impl3.getQName(0));
 
-        Assert.assertTrue(impl1.getQName(1).equals(impl2.getQName(1)));
-        Assert.assertTrue(impl1.getQName(1).equals(impl3.getQName(1)));
+        assertEquals(impl1.getQName(1), impl2.getQName(1));
+        assertEquals(impl1.getQName(1), impl3.getQName(1));
 
-        Assert.assertTrue(impl1.getQName(2).equals(impl2.getQName(2)));
-        Assert.assertTrue(impl1.getQName(2).equals(impl3.getQName(2)));
+        assertEquals(impl1.getQName(2), impl2.getQName(2));
+        assertEquals(impl1.getQName(2), impl3.getQName(2));
     }
 }
diff --git a/test/jaxp/javax/xml/jaxp/unittest/sax/Bug6889654Test.java b/test/jaxp/javax/xml/jaxp/unittest/sax/Bug6889654Test.java
index 89f0ceebe61..62f16021af2 100644
--- a/test/jaxp/javax/xml/jaxp/unittest/sax/Bug6889654Test.java
+++ b/test/jaxp/javax/xml/jaxp/unittest/sax/Bug6889654Test.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2014, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2014, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,64 +23,26 @@
 
 package sax;
 
-import java.io.IOException;
-import java.io.StringReader;
-
-import javax.xml.parsers.ParserConfigurationException;
-import javax.xml.parsers.SAXParserFactory;
-
-import org.testng.Assert;
-import org.testng.annotations.Test;
-import org.xml.sax.InputSource;
+import org.junit.jupiter.api.Test;
 import org.xml.sax.SAXException;
-import org.xml.sax.helpers.DefaultHandler;
+
+import static org.junit.jupiter.api.Assertions.assertTrue;
 
 /*
  * @test
  * @bug 6889654
  * @library /javax/xml/jaxp/libs /javax/xml/jaxp/unittest
- * @run testng/othervm sax.Bug6889654Test
+ * @run junit/othervm sax.Bug6889654Test
  * @summary Test SAXException includes whole information.
  */
 public class Bug6889654Test {
-
-    final String MSG = "Failed to parse XML";
-
     @Test
     public void testException() {
-        try {
-            parse();
-        } catch (SAXException e) {
-            // e.printStackTrace();
-            String msg = e.toString();
-            if (msg.indexOf("systemId") == -1) {
-                Assert.fail("CR6889654 -- details should be returned.");
-            }
-            if (msg.indexOf(MSG) == -1) {
-                Assert.fail("CR6889649 -- additional error message not returned.");
-            }
-            System.out.println("error message:\n" + msg);
-        }
+        RuntimeException cause = new RuntimeException("<cause message>");
+        // The toString() of a SAXException includes the message of its cause.
+        SAXException wrapped = new SAXException("<wrapped message>", cause);
+
+        assertTrue(wrapped.toString().contains("<wrapped message>"));
+        assertTrue(wrapped.toString().contains("<cause message>"));
     }
-
-    void parse() throws SAXException {
-        String xml = "<data>\n<broken/>\u0000</data>";
-
-        try {
-            InputSource is = new InputSource(new StringReader(xml));
-            is.setSystemId("file:///path/to/some.xml");
-            // notice that exception thrown here doesn't include the line number
-            // information when reported by JVM -- CR6889654
-            SAXParserFactory.newInstance().newSAXParser().parse(is, new DefaultHandler());
-        } catch (SAXException e) {
-            // notice that this message isn't getting displayed -- CR6889649
-            throw new SAXException(MSG, e);
-        } catch (ParserConfigurationException pce) {
-
-        } catch (IOException ioe) {
-
-        }
-
-    }
-
 }
diff --git a/test/jaxp/javax/xml/jaxp/unittest/sax/Bug6925410Test.java b/test/jaxp/javax/xml/jaxp/unittest/sax/Bug6925410Test.java
index d0a41dc0cf1..4f6a88874d9 100644
--- a/test/jaxp/javax/xml/jaxp/unittest/sax/Bug6925410Test.java
+++ b/test/jaxp/javax/xml/jaxp/unittest/sax/Bug6925410Test.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2014, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2014, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,37 +23,30 @@
 
 package sax;
 
-import javax.xml.datatype.DatatypeConfigurationException;
-
-import org.testng.annotations.Test;
-import org.testng.Assert;
+import org.junit.jupiter.api.Test;
+import org.xml.sax.SAXException;
 import org.xml.sax.helpers.XMLReaderFactory;
 
+import javax.xml.datatype.DatatypeConfigurationException;
+
 /*
  * @test
  * @bug 6925410
  * @library /javax/xml/jaxp/libs /javax/xml/jaxp/unittest
- * @run testng/othervm sax.Bug6925410Test
+ * @run junit/othervm sax.Bug6925410Test
  * @summary Test XMLReaderFactory can createXMLReader repeatedly.
  */
 public class Bug6925410Test {
 
     @Test
-    public void test() throws DatatypeConfigurationException {
-        try {
-            int times = 100;
-            long start = System.currentTimeMillis();
-            for (int i = 0; i < times; i++) {
-                XMLReaderFactory.createXMLReader();
-            }
-            long end = System.currentTimeMillis();
-            double speed = ((end - start));
-            System.out.println(speed + "ms");
-        } catch (Throwable e) {
-            e.printStackTrace();
-            Assert.fail(e.toString());
+    public void test() throws DatatypeConfigurationException, SAXException {
+        int times = 100;
+        long start = System.currentTimeMillis();
+        for (int i = 0; i < times; i++) {
+            XMLReaderFactory.createXMLReader();
         }
-
+        long end = System.currentTimeMillis();
+        double speed = ((end - start));
+        System.out.println(speed + "ms");
     }
-
 }
diff --git a/test/jaxp/javax/xml/jaxp/unittest/sax/Bug6949607Test.java b/test/jaxp/javax/xml/jaxp/unittest/sax/Bug6949607Test.java
index 4aeb8ed603d..e1372e6fdb6 100644
--- a/test/jaxp/javax/xml/jaxp/unittest/sax/Bug6949607Test.java
+++ b/test/jaxp/javax/xml/jaxp/unittest/sax/Bug6949607Test.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2014, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2014, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,57 +23,52 @@
 
 package sax;
 
-import java.io.ByteArrayInputStream;
-
-import javax.xml.parsers.SAXParser;
-import javax.xml.parsers.SAXParserFactory;
-
-import org.testng.Assert;
-import org.testng.annotations.Test;
+import org.junit.jupiter.api.Test;
 import org.xml.sax.Attributes;
 import org.xml.sax.SAXException;
 import org.xml.sax.helpers.DefaultHandler;
 
+import javax.xml.parsers.SAXParser;
+import javax.xml.parsers.SAXParserFactory;
+import java.io.ByteArrayInputStream;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertNull;
+import static org.junit.jupiter.api.Assertions.assertTrue;
+
 /*
  * @test
  * @bug 6949607
  * @library /javax/xml/jaxp/libs /javax/xml/jaxp/unittest
- * @run testng/othervm sax.Bug6949607Test
+ * @run junit/othervm sax.Bug6949607Test
  * @summary Test Attributes.getValue returns null when parameter uri is empty.
  */
 public class Bug6949607Test {
-
-    final String MSG = "Failed to parse XML";
-    String textXML = "<prefix:rootElem xmlns:prefix=\"something\" prefix:attr=\"attrValue\" />";
+    private static final String TEXT_XML =
+            "<prefix:rootElem xmlns:prefix=\"something\" prefix:attr=\"attrValue\" />";
 
     @Test
-    public void testException() {
-        try {
-            SAXParserFactory factory = SAXParserFactory.newInstance();
-            factory.setNamespaceAware(true);
-            factory.setValidating(true);
-            SAXParser saxParser = factory.newSAXParser();
+    public void testException() throws Exception {
+        SAXParserFactory factory = SAXParserFactory.newInstance();
+        factory.setNamespaceAware(true);
+        factory.setValidating(true);
+        SAXParser saxParser = factory.newSAXParser();
 
-            saxParser.parse(new ByteArrayInputStream(textXML.getBytes()), new TestFilter());
-
-        } catch (Throwable t) {
-            t.printStackTrace();
-        }
+        TestFilter filter = new TestFilter();
+        saxParser.parse(new ByteArrayInputStream(TEXT_XML.getBytes()), filter);
+        assertTrue(filter.wasTested);
     }
 
-    class TestFilter extends DefaultHandler {
+    static class TestFilter extends DefaultHandler {
+        boolean wasTested = false;
+
         @Override
         public void startElement(String uri, String localName, String qName, Attributes atts) throws SAXException {
             super.startElement(uri, localName, qName, atts);
 
-            String attr_WithNs = atts.getValue("something", "attr");
-            String attr_NoNs = atts.getValue("", "attr");
-
-            System.out.println("withNs: " + attr_WithNs);
-            System.out.println("NoNs: " + attr_NoNs);
-
-            Assert.assertTrue(attr_NoNs == null, "Should return null when uri is empty.");
-
+            assertEquals("attrValue", atts.getValue("something", "attr"));
+            assertNull(atts.getValue("", "attr"), "Should return null when uri is empty.");
+            wasTested = true;
         }
     }
 
diff --git a/test/jaxp/javax/xml/jaxp/unittest/sax/Bug6992561Test.java b/test/jaxp/javax/xml/jaxp/unittest/sax/Bug6992561Test.java
index 58bdee54aca..37fe7f9976a 100644
--- a/test/jaxp/javax/xml/jaxp/unittest/sax/Bug6992561Test.java
+++ b/test/jaxp/javax/xml/jaxp/unittest/sax/Bug6992561Test.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2014, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2014, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,63 +23,49 @@
 
 package sax;
 
-import java.io.ByteArrayInputStream;
-import java.io.IOException;
-
-import javax.xml.parsers.ParserConfigurationException;
-import javax.xml.parsers.SAXParser;
-import javax.xml.parsers.SAXParserFactory;
-
-import org.testng.Assert;
-import org.testng.annotations.Test;
+import org.junit.jupiter.api.Test;
 import org.xml.sax.ContentHandler;
 import org.xml.sax.InputSource;
 import org.xml.sax.Locator;
-import org.xml.sax.SAXException;
 import org.xml.sax.XMLReader;
 import org.xml.sax.helpers.DefaultHandler;
 
+import javax.xml.parsers.SAXParser;
+import javax.xml.parsers.SAXParserFactory;
+import java.io.ByteArrayInputStream;
+
+import static org.junit.jupiter.api.Assertions.assertFalse;
+
 /*
  * @test
  * @bug 6992561
  * @library /javax/xml/jaxp/libs /javax/xml/jaxp/unittest
- * @run testng/othervm sax.Bug6992561Test
+ * @run junit/othervm sax.Bug6992561Test
  * @summary Test encoding of SystemId in Locator.
  */
 public class Bug6992561Test {
 
     @Test
-    public void test() {
+    public void test() throws Exception {
         ContentHandler handler = new DefaultHandler() {
             public void setDocumentLocator(Locator locator) {
                 String sysId = locator.getSystemId();
                 System.out.println(locator.getSystemId());
-                if (sysId.indexOf("%7") > 0) {
-                    Assert.fail("the original system id should be left as is and not encoded.");
-                }
+                assertFalse(sysId.contains("%7"), "the original system id should be left as is and not encoded.");
             }
         };
 
         SAXParserFactory spf = SAXParserFactory.newInstance();
         SAXParser parser;
-        try {
-            parser = spf.newSAXParser();
+        parser = spf.newSAXParser();
 
-            XMLReader reader = parser.getXMLReader();
-            reader.setContentHandler(handler);
-            String xml = "<test>abc</test>";
-            ByteArrayInputStream bis = new ByteArrayInputStream(xml.getBytes());
-            InputSource is = new InputSource("file:/home2/ramapulavarthi/w/bugs/jaxws861/foo~bla/test/src/wsdl/HelloTypes.xsd");
-            is.setByteStream(bis);
-            reader.parse(is);
-
-        } catch (ParserConfigurationException ex) {
-            Assert.fail(ex.toString());
-        } catch (SAXException ex) {
-            Assert.fail(ex.toString());
-        } catch (IOException ex) {
-            Assert.fail(ex.toString());
-        }
+        XMLReader reader = parser.getXMLReader();
+        reader.setContentHandler(handler);
+        String xml = "<test>abc</test>";
+        ByteArrayInputStream bis = new ByteArrayInputStream(xml.getBytes());
+        InputSource is = new InputSource("file:/home2/ramapulavarthi/w/bugs/jaxws861/foo~bla/test/src/wsdl/HelloTypes.xsd");
+        is.setByteStream(bis);
+        reader.parse(is);
     }
 
 }
diff --git a/test/jaxp/javax/xml/jaxp/unittest/sax/Bug7057778.xml b/test/jaxp/javax/xml/jaxp/unittest/sax/Bug7057778.xml
deleted file mode 100644
index b28b04f6431..00000000000
--- a/test/jaxp/javax/xml/jaxp/unittest/sax/Bug7057778.xml
+++ /dev/null
@@ -1,3 +0,0 @@
-
-
-
diff --git a/test/jaxp/javax/xml/jaxp/unittest/sax/Bug7057778Test.java b/test/jaxp/javax/xml/jaxp/unittest/sax/Bug7057778Test.java
index c2d377f7d7b..9c2e772c83f 100644
--- a/test/jaxp/javax/xml/jaxp/unittest/sax/Bug7057778Test.java
+++ b/test/jaxp/javax/xml/jaxp/unittest/sax/Bug7057778Test.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2014, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2014, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,171 +23,43 @@
 
 package sax;
 
-import static jaxp.library.JAXPTestUtilities.USER_DIR;
-import static jaxp.library.JAXPTestUtilities.getSystemProperty;
-import java.io.File;
-import java.io.FileInputStream;
-import java.io.FileNotFoundException;
-import java.io.FileOutputStream;
-import java.io.IOException;
-import java.io.InputStream;
-import java.io.OutputStream;
-import java.io.OutputStreamWriter;
-import java.io.UnsupportedEncodingException;
-import java.io.Writer;
-import javax.xml.parsers.ParserConfigurationException;
-import javax.xml.parsers.SAXParser;
-import javax.xml.parsers.SAXParserFactory;
-import org.testng.Assert;
-import org.testng.annotations.Test;
-import org.xml.sax.Attributes;
-import org.xml.sax.ErrorHandler;
-import org.xml.sax.SAXException;
+import org.junit.jupiter.api.Test;
 import org.xml.sax.SAXParseException;
 import org.xml.sax.XMLReader;
 import org.xml.sax.ext.DefaultHandler2;
 
+import javax.xml.parsers.SAXParser;
+import javax.xml.parsers.SAXParserFactory;
+import java.io.File;
+import java.nio.file.Files;
+import java.nio.file.Path;
+
+import static org.junit.jupiter.api.Assertions.assertThrows;
+import static org.junit.jupiter.api.Assertions.assertTrue;
+
 /*
  * @test
  * @bug 7057778
  * @library /javax/xml/jaxp/libs /javax/xml/jaxp/unittest
- * @run testng/othervm sax.Bug7057778Test
+ * @run junit/othervm sax.Bug7057778Test
  * @summary Test the file can be deleted after SAXParser.parse(File, DefaultHandler).
  */
 public class Bug7057778Test {
-
-    static final String xml = "Bug7057778.xml";
-    static final String xml1 = "Bug7057778_1.xml";
-
     @Test
-    public void testParse() {
-        File src = new File(getClass().getResource(xml).getFile());
-        File dst = new File(USER_DIR + xml1);
-        try {
-            copyFile(src, dst);
-            SAXParserFactory spf = SAXParserFactory.newInstance();
-            SAXParser parser = spf.newSAXParser();
-            XMLReader xmlReader = parser.getXMLReader();
-            xmlReader.setProperty("http://xml.org/sax/properties/lexical-handler", new MyHandler1());
-            parser.parse(dst, new MyHandler1());
-        } catch (SAXException ex) {
-            ex.printStackTrace();
-        } catch (IOException ex) {
-            // shouldn't happen
-        } catch (ParserConfigurationException ex) {
-            // shouldn't happen
-        } catch (Exception ex) {
-        }
-        if (dst != null) {
-            if (dst.delete()) {
-                System.out.println("Delete: OK");
-            } else {
-                System.out.println("Delete: NG");
-                Assert.fail("Error: denied to delete the file");
-            }
-        }
+    public void testParse() throws Exception {
+        Path badXml = Path.of("bad.xml");
+        Files.writeString(badXml, "\n\n\n\n");
 
-    }
-
-    private void copyFile(File src, File dst) throws FileNotFoundException, IOException {
-        InputStream in = new FileInputStream(src);
-        OutputStream out = new FileOutputStream(dst);
-        // Transfer bytes
-        byte[] buf = new byte[1024];
-        int len;
-        while ((len = in.read(buf)) > 0) {
-            out.write(buf, 0, len);
-        }
-        in.close();
-        out.close();
-    }
-
-    public class MyHandler1 extends DefaultHandler2 implements ErrorHandler {
-        private Writer out;
-
-        StringBuffer textBuffer;
-        private String indentString = "    "; // Amount to indent
-        private int indentLevel = 0;
-
-        public MyHandler1() {
-            try {
-                out = new OutputStreamWriter(System.out, "UTF8");
-            } catch (UnsupportedEncodingException ex) {
-                ex.printStackTrace();
-            }
-        }
-
-        public void startDocument() throws SAXException {
-        }
-
-        public void endDocument() throws SAXException {
-        }
-
-        public void startElement(String uri, String localName, String qName, Attributes attributes) throws SAXException {
-            try {
-                System.out.println("uri: " + uri);
-                System.out.println("localName: " + localName);
-                System.out.println("qName: " + qName);
-            } catch (Exception e) {
-                throw new SAXException(e);
-            }
-
-        }
-
-        public void endElement(String uri, String localName, String qName) throws SAXException {
-        }
-
-        public void characters(char ch[], int start, int length) throws SAXException {
-        }
-
-        public void comment(char[] ch, int start, int length) {
-            String text = new String(ch, start, length);
-            // System.out.println(text);
-            try {
-                nl();
-                emit("COMMENT: " + text);
-            } catch (Exception e) {
-                e.printStackTrace();
-            }
-        }
-
-        public void error(SAXParseException exception) {
-            exception.printStackTrace();
-        }
-
-        public void fatalError(SAXParseException exception) {
-            exception.printStackTrace();
-        }
-
-        public void warning(SAXParseException exception) {
-            exception.printStackTrace();
-        }
-
-        // Wrap I/O exceptions in SAX exceptions, to
-        // suit handler signature requirements
-        private void emit(String s) throws SAXException {
-            try {
-                out.write(s);
-                out.flush();
-            } catch (IOException e) {
-                throw new SAXException("I/O error", e);
-            }
-        }
-
-        // Start a new line
-        // and indent the next line appropriately
-        private void nl() throws SAXException {
-            String lineEnd = getSystemProperty("line.separator");
-
-            try {
-                out.write(lineEnd);
-
-                for (int i = 0; i < indentLevel; i++)
-                    out.write(indentString);
-            } catch (IOException e) {
-                throw new SAXException("I/O error", e);
-            }
-        }
+        SAXParserFactory spf = SAXParserFactory.newInstance();
+        SAXParser parser = spf.newSAXParser();
+        XMLReader xmlReader = parser.getXMLReader();
+        DefaultHandler2 noopHandler = new DefaultHandler2();
+        xmlReader.setProperty("http://xml.org/sax/properties/lexical-handler", noopHandler);
 
+        // Test file is empty and fails parsing.
+        File dst = badXml.toFile();
+        assertThrows(SAXParseException.class, () -> parser.parse(dst, noopHandler));
+        // But parse failure should not keep the destination file open.
+        assertTrue(dst.delete(), "could not delete the file");
     }
 }
diff --git a/test/jaxp/javax/xml/jaxp/unittest/sax/DeclarationTest.java b/test/jaxp/javax/xml/jaxp/unittest/sax/DeclarationTest.java
index f9d9b2a117e..19871b5ddf8 100644
--- a/test/jaxp/javax/xml/jaxp/unittest/sax/DeclarationTest.java
+++ b/test/jaxp/javax/xml/jaxp/unittest/sax/DeclarationTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2019, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2019, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,25 +23,25 @@
 
 package sax;
 
-import java.io.File;
-import java.io.StringReader;
-import javax.xml.parsers.SAXParser;
-import javax.xml.parsers.SAXParserFactory;
-import org.testng.Assert;
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Listeners;
-import org.testng.annotations.Test;
-import org.xml.sax.ContentHandler;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
 import org.xml.sax.InputSource;
 import org.xml.sax.SAXException;
 import org.xml.sax.XMLReader;
 import org.xml.sax.helpers.DefaultHandler;
 
+import javax.xml.parsers.SAXParser;
+import javax.xml.parsers.SAXParserFactory;
+import java.io.File;
+import java.io.StringReader;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertTrue;
 
 /*
  * @test
  * @bug 8230814
- * @run testng sax.DeclarationTest
+ * @run junit sax.DeclarationTest
  * @summary Test SAX Parser's handling of XML Declarations.
  */
 public class DeclarationTest {
@@ -56,12 +56,8 @@ public class DeclarationTest {
      *
      * Fields:
      * XML string, expected version, encoding and standalone strings
-     *
-     * @return data array for the test
-     * @throws Exception
      */
-    @DataProvider(name = "default")
-    public Object[][] forDefaultHandler() throws Exception {
+    public static Object[][] defaultHandlerData() throws Exception {
         return new Object[][] {
             { XML_NO_DECLARATION, null, null, null},
             { XML_NO_STANDALONE, null, null, null},
@@ -75,12 +71,8 @@ public class DeclarationTest {
      *
      * Fields:
      * XML string, expected version, encoding and standalone strings
-     *
-     * @return data array for the test
-     * @throws Exception
      */
-    @DataProvider(name = "sax-data")
-    public Object[][] xmlSAXData() throws Exception {
+    public static Object[][] xmlSAXData() throws Exception {
         return new Object[][] {
             { XML_NO_DECLARATION, null, null, null},
             { XML_NO_STANDALONE, "1.0", "ISO-8859-1", null},
@@ -95,12 +87,8 @@ public class DeclarationTest {
      *
      * Fields:
      * Source files, expected version, encoding and standalone strings
-     *
-     * @return data array for the test
-     * @throws Exception
      */
-    @DataProvider(name = "sax-data-files")
-    public Object[][] xmlSAXDataFiles() throws Exception {
+    public static Object[][] xmlSAXDataFiles() throws Exception {
         return new Object[][] {
             //the source contains no declaration
             { new File(SRC_DIR + "/../transform/SourceTest.xml"), null, null, null},
@@ -129,7 +117,8 @@ public class DeclarationTest {
      * @param standalone expected standalone string
      * @throws Exception if the test fails
      */
-    @Test(dataProvider = "default")
+    @ParameterizedTest
+    @MethodSource("defaultHandlerData")
     public void testDefault(String xml, String version, String encoding, String standalone)
             throws Exception {
         DefaultImpl h = new DefaultImpl();
@@ -145,7 +134,8 @@ public class DeclarationTest {
      * @param standalone expected standalone string
      * @throws Exception if the test fails
      */
-    @Test(dataProvider = "sax-data")
+    @ParameterizedTest
+    @MethodSource("xmlSAXData")
     public void test(String xml, String version, String encoding, String standalone)
             throws Exception {
         NewMethodImpl h = new NewMethodImpl();
@@ -161,15 +151,16 @@ public class DeclarationTest {
      * @param standalone expected standalone string
      * @throws Exception if the test fails
      */
-    @Test(dataProvider = "sax-data-files")
+    @ParameterizedTest
+    @MethodSource("xmlSAXDataFiles")
     public void testFiles(File xml, String version, String encoding, String standalone)
             throws Exception {
         SAXParser parser = SAXParserFactory.newDefaultInstance().newSAXParser();
         NewMethodImpl h = new NewMethodImpl();
         parser.parse(xml, h);
-        Assert.assertEquals(h.version, version);
-        Assert.assertEquals(h.encoding, encoding);
-        Assert.assertEquals(h.standalone, standalone);
+        assertEquals(version, h.version);
+        assertEquals(encoding, h.encoding);
+        assertEquals(standalone, h.standalone);
     }
 
     /**
@@ -187,12 +178,12 @@ public class DeclarationTest {
         XMLReader r = SAXParserFactory.newDefaultInstance().newSAXParser().getXMLReader();
         r.setContentHandler(h);
         r.parse(new InputSource(new StringReader(xml)));
-        Assert.assertEquals(h.version, version);
-        Assert.assertEquals(h.encoding, encoding);
-        Assert.assertEquals(h.standalone, standalone);
+        assertEquals(version, h.version);
+        assertEquals(encoding, h.encoding);
+        assertEquals(standalone, h.standalone);
     }
 
-    class DefaultImpl extends DefaultHandler{
+    static class DefaultImpl extends DefaultHandler {
         boolean startDocumentInvoked = false;
         String version, encoding, standalone;
 
@@ -202,7 +193,7 @@ public class DeclarationTest {
         }
     }
 
-    class NewMethodImpl extends DefaultImpl {
+    static class NewMethodImpl extends DefaultImpl {
 
         public void startDocument() throws SAXException {
             super.startDocument();
@@ -213,7 +204,7 @@ public class DeclarationTest {
                 throws SAXException
         {
             super.declaration(version, encoding, standalone);
-            Assert.assertTrue(startDocumentInvoked, "declaration follows startDocument");
+            assertTrue(startDocumentInvoked, "declaration follows startDocument");
             this.version = version;
             this.encoding = encoding;
             this.standalone = standalone;
diff --git a/test/jaxp/javax/xml/jaxp/unittest/sax/DefaultHandler2Test.java b/test/jaxp/javax/xml/jaxp/unittest/sax/DefaultHandler2Test.java
index 85e447783ca..4f50b23e8d6 100644
--- a/test/jaxp/javax/xml/jaxp/unittest/sax/DefaultHandler2Test.java
+++ b/test/jaxp/javax/xml/jaxp/unittest/sax/DefaultHandler2Test.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2014, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2014, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,16 +23,7 @@
 
 package sax;
 
-import java.io.IOException;
-
-import javax.xml.parsers.ParserConfigurationException;
-import javax.xml.parsers.SAXParser;
-import javax.xml.parsers.SAXParserFactory;
-
-import org.testng.Assert;
-import org.testng.AssertJUnit;
-import org.testng.annotations.Test;
-import org.xml.sax.SAXException;
+import org.junit.jupiter.api.Test;
 import org.xml.sax.SAXNotRecognizedException;
 import org.xml.sax.XMLReader;
 import org.xml.sax.ext.DefaultHandler2;
@@ -41,210 +32,135 @@ import org.xml.sax.helpers.ParserAdapter;
 import org.xml.sax.helpers.XMLFilterImpl;
 import org.xml.sax.helpers.XMLReaderFactory;
 
+import javax.xml.parsers.SAXParser;
+import javax.xml.parsers.SAXParserFactory;
+
+import static org.junit.jupiter.api.Assertions.assertInstanceOf;
+import static org.junit.jupiter.api.Assertions.assertThrows;
+
 /*
  * @test
  * @library /javax/xml/jaxp/libs /javax/xml/jaxp/unittest
- * @run testng/othervm sax.DefaultHandler2Test
+ * @run junit/othervm sax.DefaultHandler2Test
  * @summary Test DefaultHandler2.
  */
 public class DefaultHandler2Test {
 
     @Test
-    public void testParse01() {
-        System.out.println("===in testParse01===");
-        try {
-            DefaultHandler handler = new MyDefaultHandler2();
-            SAXParserFactory saxFac = SAXParserFactory.newInstance();
-            System.out.println(saxFac.getFeature("http://xml.org/sax/features/use-locator2"));
+    public void testParse01() throws Exception {
+        DefaultHandler handler = new MyDefaultHandler2();
+        SAXParserFactory saxFac = SAXParserFactory.newInstance();
+        System.out.println(saxFac.getFeature("http://xml.org/sax/features/use-locator2"));
 
-            // set use-entity-resolver2 as FALSE to use EntityResolver firstly.
-            saxFac.setFeature("http://xml.org/sax/features/use-entity-resolver2", false);
-            saxFac.setValidating(true);
+        // set use-entity-resolver2 as FALSE to use EntityResolver firstly.
+        saxFac.setFeature("http://xml.org/sax/features/use-entity-resolver2", false);
+        saxFac.setValidating(true);
 
-            SAXParser parser = saxFac.newSAXParser();
-            parser.setProperty("http://xml.org/sax/properties/lexical-handler", handler);
-            parser.setProperty("http://xml.org/sax/properties/declaration-handler", handler);
+        SAXParser parser = saxFac.newSAXParser();
+        parser.setProperty("http://xml.org/sax/properties/lexical-handler", handler);
+        parser.setProperty("http://xml.org/sax/properties/declaration-handler", handler);
 
-            parser.parse(this.getClass().getResource("toys.xml").getFile(), handler);
-        } catch (ParserConfigurationException e) {
-            e.printStackTrace();
-            Assert.fail("ParserConfigurationException in testParse01()");
-        } catch (SAXException e) {
-            e.printStackTrace();
-            Assert.fail("SAXException in testParse01()");
-        } catch (IOException e) {
-            e.printStackTrace();
-            Assert.fail("IOException in testParse01()");
-        }
+        parser.parse(this.getClass().getResource("toys.xml").getFile(), handler);
     }
 
     @Test
-    public void testParse02() {
-        System.out.println("===in testParse02===");
-        try {
-            DefaultHandler handler = new MyDefaultHandler2();
-            SAXParserFactory saxFac = SAXParserFactory.newInstance();
-            System.out.println(saxFac.getFeature("http://xml.org/sax/features/use-locator2"));
+    public void testParse02() throws Exception {
+        DefaultHandler handler = new MyDefaultHandler2();
+        SAXParserFactory saxFac = SAXParserFactory.newInstance();
+        System.out.println(saxFac.getFeature("http://xml.org/sax/features/use-locator2"));
 
-            // Enable namespace parsing
-            System.out.println(saxFac.getFeature("http://xml.org/sax/features/namespaces"));
-            saxFac.setNamespaceAware(true);
+        // Enable namespace parsing
+        System.out.println(saxFac.getFeature("http://xml.org/sax/features/namespaces"));
+        saxFac.setNamespaceAware(true);
 
-            saxFac.setValidating(true);
-            SAXParser parser = saxFac.newSAXParser();
-            parser.setProperty("http://xml.org/sax/properties/lexical-handler", handler);
-            parser.setProperty("http://xml.org/sax/properties/declaration-handler", handler);
+        saxFac.setValidating(true);
+        SAXParser parser = saxFac.newSAXParser();
+        parser.setProperty("http://xml.org/sax/properties/lexical-handler", handler);
+        parser.setProperty("http://xml.org/sax/properties/declaration-handler", handler);
 
-            parser.parse(this.getClass().getResource("toys.xml").getFile(), handler);
-        } catch (ParserConfigurationException e) {
-            e.printStackTrace();
-            Assert.fail("ParserConfigurationException in testParse02()");
-        } catch (SAXException e) {
-            e.printStackTrace();
-            Assert.fail("SAXException in testParse02()");
-        } catch (IOException e) {
-            e.printStackTrace();
-            Assert.fail("IOException in testParse02()");
-        }
+        parser.parse(this.getClass().getResource("toys.xml").getFile(), handler);
     }
 
     @Test
-    public void testParse03() {
-        System.out.println("===in testParse03===");
-        try {
-            DefaultHandler handler = new MyDefaultHandler2();
+    public void testParse03() throws Exception {
+        DefaultHandler handler = new MyDefaultHandler2();
 
-            XMLReader xmlReader = XMLReaderFactory.createXMLReader();
-            xmlReader.setProperty("http://xml.org/sax/properties/declaration-handler", handler);
-            System.out.println("XMLReader : " + xmlReader.getProperty("http://xml.org/sax/properties/declaration-handler"));
+        XMLReader xmlReader = XMLReaderFactory.createXMLReader();
+        xmlReader.setProperty("http://xml.org/sax/properties/declaration-handler", handler);
+        System.out.println("XMLReader : " + xmlReader.getProperty("http://xml.org/sax/properties/declaration-handler"));
 
-            SAXParserFactory saxFac = SAXParserFactory.newInstance();
-            SAXParser parser = saxFac.newSAXParser();
-            parser.setProperty("http://xml.org/sax/properties/declaration-handler", handler);
-            System.out.println("SAXParser : " + parser.getProperty("http://xml.org/sax/properties/declaration-handler"));
-
-            // From https://docs.oracle.com/javase/7/docs/api,
-            // ParserAdapter.setProperty() and ParserAdapter.getProperty() does
-            // not support any property currently.
-            try {
-                ParserAdapter adapter = new ParserAdapter(parser.getParser());
-                System.out.println("ParserAdapter : " + adapter.getProperty("http://xml.org/sax/properties/declaration-handler"));
-            } catch (SAXNotRecognizedException e) {
-                System.out.println("Expected  SAXNotRecognizedException since ParserAdapter.getProperty() does not support any property currently");
-            }
-            try {
-                ParserAdapter adapter = new ParserAdapter(parser.getParser());
-                adapter.setProperty("http://xml.org/sax/properties/declaration-handler", handler);
-            } catch (SAXNotRecognizedException e) {
-                System.out.println("Expected  SAXNotRecognizedException since ParserAdapter.setProperty() does not support any property currently");
-            }
-        } catch (SAXException e) {
-            e.printStackTrace();
-            Assert.fail("SAXException in testParse03()");
-        } catch (ParserConfigurationException e) {
-            e.printStackTrace();
-            Assert.fail("ParserConfigurationException in testParse03()");
-        }
+        SAXParserFactory saxFac = SAXParserFactory.newInstance();
+        SAXParser parser = saxFac.newSAXParser();
+        parser.setProperty("http://xml.org/sax/properties/declaration-handler", handler);
+        System.out.println("SAXParser : " + parser.getProperty("http://xml.org/sax/properties/declaration-handler"));
 
+        // From https://docs.oracle.com/javase/7/docs/api,
+        // ParserAdapter.setProperty() and ParserAdapter.getProperty() does
+        // not support any property currently.
+        ParserAdapter adapter = new ParserAdapter(parser.getParser());
+        assertThrows(SAXNotRecognizedException.class, () -> adapter.getProperty("http://xml.org/sax/properties/declaration-handler"));
+        assertThrows(SAXNotRecognizedException.class, () -> adapter.setProperty("http://xml.org/sax/properties/declaration-handler", handler));
     }
 
     @Test
-    public void testParse04() {
-        System.out.println("===in testParse04===");
-        try {
-            DefaultHandler handler = new MyDefaultHandler2();
-            XMLReader xmlReader = XMLReaderFactory.createXMLReader();
-            System.out.println(xmlReader.getFeature("http://xml.org/sax/features/namespaces"));
-            xmlReader.setProperty("http://xml.org/sax/properties/declaration-handler", handler);
-            xmlReader.setProperty("http://xml.org/sax/properties/lexical-handler", handler);
-            xmlReader.setContentHandler(handler);
+    public void testParse04() throws Exception {
+        DefaultHandler handler = new MyDefaultHandler2();
+        XMLReader xmlReader = XMLReaderFactory.createXMLReader();
+        System.out.println(xmlReader.getFeature("http://xml.org/sax/features/namespaces"));
+        xmlReader.setProperty("http://xml.org/sax/properties/declaration-handler", handler);
+        xmlReader.setProperty("http://xml.org/sax/properties/lexical-handler", handler);
+        xmlReader.setContentHandler(handler);
 
-            xmlReader.parse(this.getClass().getResource("toys.xml").getFile());
-
-        } catch (SAXException e) {
-            e.printStackTrace();
-            Assert.fail("SAXException in testParse04()");
-        } catch (IOException e) {
-            e.printStackTrace();
-            Assert.fail("IOException in testParse04()");
-        }
+        xmlReader.parse(this.getClass().getResource("toys.xml").getFile());
     }
 
     @Test
-    public void testParse05() {
-        System.out.println("===in testParse05===");
-        try {
-            DefaultHandler handler = new MyDefaultHandler2();
-            XMLReader xmlReader = XMLReaderFactory.createXMLReader();
-            XMLFilterImpl filterImpl = new XMLFilterImpl(xmlReader);
-            System.out.println(xmlReader.getFeature("http://xml.org/sax/features/namespaces"));
-            filterImpl.setProperty("http://xml.org/sax/properties/declaration-handler", handler);
-            filterImpl.setProperty("http://xml.org/sax/properties/lexical-handler", handler);
-            filterImpl.setContentHandler(handler);
+    public void testParse05() throws Exception {
+        DefaultHandler handler = new MyDefaultHandler2();
+        XMLReader xmlReader = XMLReaderFactory.createXMLReader();
+        XMLFilterImpl filterImpl = new XMLFilterImpl(xmlReader);
+        System.out.println(xmlReader.getFeature("http://xml.org/sax/features/namespaces"));
+        filterImpl.setProperty("http://xml.org/sax/properties/declaration-handler", handler);
+        filterImpl.setProperty("http://xml.org/sax/properties/lexical-handler", handler);
+        filterImpl.setContentHandler(handler);
 
-            filterImpl.parse(this.getClass().getResource("toys.xml").getFile());
-
-        } catch (SAXException e) {
-            e.printStackTrace();
-            Assert.fail("SAXException in testParse05()");
-        } catch (IOException e) {
-            e.printStackTrace();
-            Assert.fail("IOException in testParse05()");
-        }
+        filterImpl.parse(this.getClass().getResource("toys.xml").getFile());
     }
 
     @Test
-    public void testParse06() {
-        System.out.println("===in testParse06===");
-        try {
-            DefaultHandler handler = new MyDefaultHandler2();
-            XMLReader xmlReader = XMLReaderFactory.createXMLReader();
-            XMLFilterImpl filterImpl = new XMLFilterImpl(xmlReader);
-            System.out.println(xmlReader.getFeature("http://xml.org/sax/features/namespaces"));
-            filterImpl.setProperty("http://xml.org/sax/properties/declaration-handler", handler);
-            filterImpl.setProperty("http://xml.org/sax/properties/lexical-handler", handler);
-            filterImpl.setContentHandler(handler);
+    public void testParse06() throws Exception {
+        DefaultHandler handler = new MyDefaultHandler2();
+        XMLReader xmlReader = XMLReaderFactory.createXMLReader();
+        XMLFilterImpl filterImpl = new XMLFilterImpl(xmlReader);
+        System.out.println(xmlReader.getFeature("http://xml.org/sax/features/namespaces"));
+        filterImpl.setProperty("http://xml.org/sax/properties/declaration-handler", handler);
+        filterImpl.setProperty("http://xml.org/sax/properties/lexical-handler", handler);
+        filterImpl.setContentHandler(handler);
 
-            AssertJUnit.assertTrue(filterImpl.getProperty("http://xml.org/sax/properties/declaration-handler") instanceof DefaultHandler2);
+        assertInstanceOf(DefaultHandler2.class, filterImpl.getProperty("http://xml.org/sax/properties/declaration-handler"));
 
-            // filterImpl.setFeature("http://xml.org/sax/features/external-general-entities",
-            // false) ;
-            // filterImpl.setFeature("http://xml.org/sax/features/external-parameter-entities",
-            // false) ;
-            filterImpl.skippedEntity("name2");
+        // filterImpl.setFeature("http://xml.org/sax/features/external-general-entities",
+        // false) ;
+        // filterImpl.setFeature("http://xml.org/sax/features/external-parameter-entities",
+        // false) ;
+        filterImpl.skippedEntity("name2");
 
-            filterImpl.parse(this.getClass().getResource("toys.xml").getFile());
-        } catch (SAXException e) {
-            e.printStackTrace();
-            Assert.fail("SAXException in testParse06()");
-        } catch (IOException e) {
-            e.printStackTrace();
-            Assert.fail("IOException in testParse06()");
-        }
+        filterImpl.parse(this.getClass().getResource("toys.xml").getFile());
     }
 
     @Test
-    public void testParse07() {
-        System.out.println("===in testParse07===");
-        try {
-            DefaultHandler handler = new MyDefaultHandler2();
-            XMLReader xmlReader = XMLReaderFactory.createXMLReader();
-            XMLFilterImpl filterImpl = new XMLFilterImpl(xmlReader);
-            System.out.println(xmlReader.getFeature("http://xml.org/sax/features/namespaces"));
-            filterImpl.setProperty("http://xml.org/sax/properties/declaration-handler", handler);
-            filterImpl.setProperty("http://xml.org/sax/properties/lexical-handler", handler);
-            filterImpl.setContentHandler(handler);
-            filterImpl.setErrorHandler(handler);
-            AssertJUnit.assertTrue(filterImpl.getProperty("http://xml.org/sax/properties/declaration-handler") instanceof DefaultHandler2);
+    public void testParse07() throws Exception {
+        DefaultHandler handler = new MyDefaultHandler2();
+        XMLReader xmlReader = XMLReaderFactory.createXMLReader();
+        XMLFilterImpl filterImpl = new XMLFilterImpl(xmlReader);
+        System.out.println(xmlReader.getFeature("http://xml.org/sax/features/namespaces"));
+        filterImpl.setProperty("http://xml.org/sax/properties/declaration-handler", handler);
+        filterImpl.setProperty("http://xml.org/sax/properties/lexical-handler", handler);
+        filterImpl.setContentHandler(handler);
+        filterImpl.setErrorHandler(handler);
+        assertInstanceOf(DefaultHandler2.class, filterImpl.getProperty("http://xml.org/sax/properties/declaration-handler"));
 
-            filterImpl.setFeature("http://apache.org/xml/features/continue-after-fatal-error", true);
-            filterImpl.parse(this.getClass().getResource("toys_error.xml").getFile());
-        } catch (SAXException e) {
-            e.printStackTrace();
-            Assert.fail("SAXException in testParse07()");
-        } catch (IOException e) {
-            e.printStackTrace();
-            Assert.fail("IOException in testParse07()");
-        }
+        filterImpl.setFeature("http://apache.org/xml/features/continue-after-fatal-error", true);
+        filterImpl.parse(this.getClass().getResource("toys_error.xml").getFile());
     }
 }
diff --git a/test/jaxp/javax/xml/jaxp/unittest/sax/IssueTracker56Test.java b/test/jaxp/javax/xml/jaxp/unittest/sax/IssueTracker56Test.java
index bbec3104208..6588d787bfe 100644
--- a/test/jaxp/javax/xml/jaxp/unittest/sax/IssueTracker56Test.java
+++ b/test/jaxp/javax/xml/jaxp/unittest/sax/IssueTracker56Test.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2014, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2014, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,78 +23,50 @@
 
 package sax;
 
-import java.io.IOException;
-import java.io.StringReader;
-
-import javax.xml.parsers.ParserConfigurationException;
-import javax.xml.parsers.SAXParser;
-import javax.xml.parsers.SAXParserFactory;
-
-import org.testng.Assert;
-import org.testng.annotations.Test;
+import org.junit.jupiter.api.Test;
 import org.xml.sax.Attributes;
 import org.xml.sax.ErrorHandler;
 import org.xml.sax.InputSource;
 import org.xml.sax.SAXException;
 import org.xml.sax.helpers.DefaultHandler;
 
+import javax.xml.parsers.SAXParser;
+import javax.xml.parsers.SAXParserFactory;
+import java.io.StringReader;
+
+import static org.junit.jupiter.api.Assertions.assertNotNull;
+import static org.junit.jupiter.api.Assertions.assertThrows;
+
 /*
  * @test
  * @bug 6809409
  * @library /javax/xml/jaxp/libs /javax/xml/jaxp/unittest
- * @run testng/othervm sax.IssueTracker56Test
+ * @run junit/othervm sax.IssueTracker56Test
  * @summary Test SAXException has Cause.
  */
 public class IssueTracker56Test {
 
     @Test
-    public void testException() {
-        try {
-            SAXParserFactory spf = SAXParserFactory.newInstance();
-            SAXParser parser = spf.newSAXParser();
-            String xmlToParse = "<root>Issue 56: SAXException does not do the exception chaining properly</root>";
-            InputSource source = new InputSource(new StringReader(xmlToParse));
-            parser.parse(source, new MyHandler());
-        } catch (SAXException ex) {
-            System.out.println(ex.getCause());
-            if (ex.getCause() == null)
-                Assert.fail("failed chaining exception properly.");
-            // ex.printStackTrace(); //will not print out root cause without the
-            // fix
-        } catch (IOException ex) {
-            // shouldn't happen
-        } catch (ParserConfigurationException ex) {
-            // shouldn't happen
-        }
+    public void testException() throws Exception {
+        SAXParserFactory spf = SAXParserFactory.newInstance();
+        SAXParser parser = spf.newSAXParser();
+        String xmlToParse = "<root>Issue 56: SAXException does not do the exception chaining properly</root>";
+        InputSource source = new InputSource(new StringReader(xmlToParse));
+
+        SAXException ex = assertThrows(SAXException.class, () -> parser.parse(source, new MyHandler()));
+        assertNotNull(ex.getCause(), "failed chaining exception properly.");
     }
 
     @Test
     public void testWorkAround() throws Exception {
-        try {
-            SAXParserFactory spf = SAXParserFactory.newInstance();
-            SAXParser parser = spf.newSAXParser();
-            String xmlToParse = "<root>Issue 56: SAXException does not do the exception chaining properly</root>";
-            InputSource source = new InputSource(new StringReader(xmlToParse));
-            parser.parse(source, new MyHandler1());
-        } catch (SAXException ex) {
-            System.out.println(ex.getCause());
-            // ex.printStackTrace(); //will print out root cause
-        } catch (IOException ex) {
-            // shouldn't happen
-        } catch (ParserConfigurationException ex) {
-            // shouldn't happen
-        }
-
+        SAXParserFactory spf = SAXParserFactory.newInstance();
+        SAXParser parser = spf.newSAXParser();
+        String xmlToParse = "<root>Issue 56: SAXException does not do the exception chaining properly</root>";
+        InputSource source = new InputSource(new StringReader(xmlToParse));
+        assertThrows(SAXException.class, () -> parser.parse(source, new MyHandler1()));
     }
 
-    public class MyHandler extends DefaultHandler implements ErrorHandler {
-
-        public void startDocument() throws SAXException {
-        }
-
-        public void endDocument() throws SAXException {
-        }
-
+    public static class MyHandler extends DefaultHandler implements ErrorHandler {
         public void startElement(String uri, String localName, String qName, Attributes attributes) throws SAXException {
             try {
                 System.out.println(uri);
@@ -104,23 +76,9 @@ public class IssueTracker56Test {
             }
 
         }
-
-        public void endElement(String uri, String localName, String qName) throws SAXException {
-        }
-
-        public void characters(char ch[], int start, int length) throws SAXException {
-        }
-
     }
 
-    public class MyHandler1 extends DefaultHandler implements ErrorHandler {
-
-        public void startDocument() throws SAXException {
-        }
-
-        public void endDocument() throws SAXException {
-        }
-
+    public static class MyHandler1 extends DefaultHandler implements ErrorHandler {
         public void startElement(String uri, String localName, String qName, Attributes attributes) throws SAXExceptionExt {
             try {
                 System.out.println(uri);
@@ -130,12 +88,5 @@ public class IssueTracker56Test {
             }
 
         }
-
-        public void endElement(String uri, String localName, String qName) throws SAXException {
-        }
-
-        public void characters(char ch[], int start, int length) throws SAXException {
-        }
-
     }
 }
diff --git a/test/jaxp/javax/xml/jaxp/unittest/sax/NSSupportTest.java b/test/jaxp/javax/xml/jaxp/unittest/sax/NSSupportTest.java
index 7630d96a023..d4b05a0c366 100644
--- a/test/jaxp/javax/xml/jaxp/unittest/sax/NSSupportTest.java
+++ b/test/jaxp/javax/xml/jaxp/unittest/sax/NSSupportTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2014, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2014, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,17 +23,20 @@
 
 package sax;
 
+import org.junit.jupiter.api.Test;
+import org.xml.sax.helpers.NamespaceSupport;
+
 import java.util.Enumeration;
 
-import org.testng.Assert;
-import org.testng.AssertJUnit;
-import org.testng.annotations.Test;
-import org.xml.sax.helpers.NamespaceSupport;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertFalse;
+import static org.junit.jupiter.api.Assertions.assertNull;
+import static org.junit.jupiter.api.Assertions.assertTrue;
 
 /*
  * @test
  * @library /javax/xml/jaxp/libs /javax/xml/jaxp/unittest
- * @run testng/othervm sax.NSSupportTest
+ * @run junit/othervm sax.NSSupportTest
  * @summary Test NamespaceSupport.
  */
 public class NSSupportTest {
@@ -48,14 +51,14 @@ public class NSSupportTest {
 
         String[] parts = new String[3];
         nssupport.processName("dc:name1", parts, false);
-        Assert.assertTrue(parts[0].equals("http://www.purl.org/dc"));
-        Assert.assertTrue(parts[1].equals("name1"));
-        Assert.assertTrue(parts[2].equals("dc:name1"));
+        assertEquals("http://www.purl.org/dc", parts[0]);
+        assertEquals("name1", parts[1]);
+        assertEquals("dc:name1", parts[2]);
 
         nssupport.processName("name2", parts, false);
-        Assert.assertTrue(parts[0].equals("http://www.java.com"));
-        Assert.assertTrue(parts[1].equals("name2"));
-        Assert.assertTrue(parts[2].equals("name2"));
+        assertEquals("http://www.java.com", parts[0]);
+        assertEquals("name2", parts[1]);
+        assertEquals("name2", parts[2]);
     }
 
     @Test
@@ -64,30 +67,30 @@ public class NSSupportTest {
         NamespaceSupport nssupport = new NamespaceSupport();
 
         nssupport.pushContext();
-        Assert.assertFalse(nssupport.isNamespaceDeclUris());
+        assertFalse(nssupport.isNamespaceDeclUris());
         nssupport.declarePrefix("xmlns", "");
         nssupport.processName("xmlns:name", parts, true);
-        Assert.assertNull(parts[0]);
-        Assert.assertNull(parts[1]);
-        Assert.assertNull(parts[2]);
+        assertNull(parts[0]);
+        assertNull(parts[1]);
+        assertNull(parts[2]);
 
         nssupport.reset();
 
         nssupport.setNamespaceDeclUris(true);
         nssupport.declarePrefix("xmlns", "");
         nssupport.processName("xmlns:name", parts, true);
-        Assert.assertTrue(parts[0].equals(NamespaceSupport.NSDECL));
-        Assert.assertTrue(parts[1].equals("name"));
-        Assert.assertTrue(parts[2].equals("xmlns:name"));
+        assertEquals(NamespaceSupport.NSDECL, parts[0]);
+        assertEquals("name", parts[1]);
+        assertEquals("xmlns:name", parts[2]);
 
         nssupport.reset();
 
         nssupport.setNamespaceDeclUris(true);
         nssupport.declarePrefix("xml", "");
         nssupport.processName("xml:name", parts, true);
-        Assert.assertTrue(parts[0].equals(NamespaceSupport.XMLNS));
-        Assert.assertTrue(parts[1].equals("name"));
-        Assert.assertTrue(parts[2].equals("xml:name"));
+        assertEquals(NamespaceSupport.XMLNS, parts[0]);
+        assertEquals("name", parts[1]);
+        assertEquals("xml:name", parts[2]);
 
     }
 
@@ -98,14 +101,14 @@ public class NSSupportTest {
 
         nssupport.pushContext();
         nssupport.declarePrefix("dc", "http://www.purl.org/dc");
-        Assert.assertEquals(nssupport.getPrefix("http://www.purl.org/dc"), "dc");
+        assertEquals("dc", nssupport.getPrefix("http://www.purl.org/dc"));
 
         nssupport.popContext();
-        Assert.assertNull(nssupport.getPrefix("http://www.purl.org/dc"));
+        assertNull(nssupport.getPrefix("http://www.purl.org/dc"));
         nssupport.processName("dc:name1", parts, false);
-        Assert.assertNull(parts[0]);
-        Assert.assertNull(parts[1]);
-        Assert.assertNull(parts[2]);
+        assertNull(parts[0]);
+        assertNull(parts[1]);
+        assertNull(parts[2]);
     }
 
     @Test
@@ -124,9 +127,9 @@ public class NSSupportTest {
         nssupport.declarePrefix("dc2", "http://www.purl.org/dc2");
         nssupport.declarePrefix("dcnew", "http://www.purl.org/dcnew");
 
-        Enumeration enu1 = nssupport.getDeclaredPrefixes();
+        Enumeration<String> enu1 = nssupport.getDeclaredPrefixes();
         while (enu1.hasMoreElements()) {
-            String str = (String) enu1.nextElement();
+            String str = enu1.nextElement();
             if (str.equals("dc")) {
                 hasdc = true;
             } else if (str.equals("dc1")) {
@@ -137,8 +140,8 @@ public class NSSupportTest {
                 hasdcnew = true;
             }
         }
-        AssertJUnit.assertTrue(hasdcnew && hasdc1 && hasdc2);
-        AssertJUnit.assertFalse(hasdc);
+        assertTrue(hasdcnew && hasdc1 && hasdc2);
+        assertFalse(hasdc);
     }
 
     @Test
@@ -157,9 +160,9 @@ public class NSSupportTest {
         nssupport.declarePrefix("dc2", "http://www.purl.org/dc2");
         nssupport.declarePrefix("dcnew", "http://www.purl.org/dcnew");
 
-        Enumeration enu1 = nssupport.getPrefixes();
+        Enumeration<String> enu1 = nssupport.getPrefixes();
         while (enu1.hasMoreElements()) {
-            String str = (String) enu1.nextElement();
+            String str = enu1.nextElement();
             if (str.equals("dc")) {
                 hasdc = true;
             } else if (str.equals("dc1")) {
@@ -170,7 +173,7 @@ public class NSSupportTest {
                 hasdcnew = true;
             }
         }
-        AssertJUnit.assertTrue(hasdcnew && hasdc1 && hasdc2 && hasdc);
+        assertTrue(hasdcnew && hasdc1 && hasdc2 && hasdc);
     }
 
     @Test
@@ -189,9 +192,9 @@ public class NSSupportTest {
         nssupport.declarePrefix("dc2", "http://www.purl.org/dc2");
         nssupport.declarePrefix("dcnew", "http://www.purl.org/dcnew");
 
-        Enumeration enu1 = nssupport.getPrefixes("http://www.purl.org/dc");
+        Enumeration<String> enu1 = nssupport.getPrefixes("http://www.purl.org/dc");
         while (enu1.hasMoreElements()) {
-            String str = (String) enu1.nextElement();
+            String str = enu1.nextElement();
             if (str.equals("dc")) {
                 hasdc = true;
             } else if (str.equals("dc1")) {
@@ -202,9 +205,9 @@ public class NSSupportTest {
                 hasdcnew = true;
             }
         }
-        AssertJUnit.assertTrue(hasdc1 && hasdc);
-        AssertJUnit.assertFalse(hasdc2);
-        AssertJUnit.assertFalse(hasdcnew);
+        assertTrue(hasdc1 && hasdc);
+        assertFalse(hasdc2);
+        assertFalse(hasdcnew);
     }
 
     @Test
@@ -219,13 +222,13 @@ public class NSSupportTest {
         nssupport.declarePrefix("dc2", "http://www.purl.org/dc2");
         nssupport.declarePrefix("dcnew", "http://www.purl.org/dcnew");
 
-        AssertJUnit.assertTrue(nssupport.getURI("dc").equals("http://www.purl.org/dc"));
-        AssertJUnit.assertTrue(nssupport.getURI("dc1").equals("http://www.purl.org/dc"));
-        AssertJUnit.assertTrue(nssupport.getURI("dc2").equals("http://www.purl.org/dc2"));
-        AssertJUnit.assertTrue(nssupport.getURI("dcnew").equals("http://www.purl.org/dcnew"));
+        assertEquals("http://www.purl.org/dc", nssupport.getURI("dc"));
+        assertEquals("http://www.purl.org/dc", nssupport.getURI("dc1"));
+        assertEquals("http://www.purl.org/dc2", nssupport.getURI("dc2"));
+        assertEquals("http://www.purl.org/dcnew", nssupport.getURI("dcnew"));
 
         // Negative test
-        Assert.assertNull(nssupport.getURI("wrong_prefix"));
-        Assert.assertNull(nssupport.getURI(""));
+        assertNull(nssupport.getURI("wrong_prefix"));
+        assertNull(nssupport.getURI(""));
     }
 }
diff --git a/test/jaxp/javax/xml/jaxp/unittest/sax/SAXExceptionInitCause.java b/test/jaxp/javax/xml/jaxp/unittest/sax/SAXExceptionInitCause.java
index 4e5307b42ec..ee028d74611 100644
--- a/test/jaxp/javax/xml/jaxp/unittest/sax/SAXExceptionInitCause.java
+++ b/test/jaxp/javax/xml/jaxp/unittest/sax/SAXExceptionInitCause.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -27,12 +27,15 @@
  * @summary The initCause() incorrectly initialize the cause in
  * SAXException class when used with SAXException(String)
  * constructor.
- * @run testng/othervm sax.SAXExceptionInitCause
+ * @run junit/othervm sax.SAXExceptionInitCause
  * @author aleksej.efimov@oracle.com
  */
 
 package sax;
 
+import org.junit.jupiter.api.Test;
+import org.xml.sax.SAXException;
+
 import java.io.ByteArrayInputStream;
 import java.io.ByteArrayOutputStream;
 import java.io.IOException;
@@ -40,9 +43,11 @@ import java.io.InvalidClassException;
 import java.io.ObjectInputStream;
 import java.io.ObjectOutputStream;
 
-import org.testng.Assert;
-import org.testng.annotations.Test;
-import org.xml.sax.SAXException;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertNotNull;
+import static org.junit.jupiter.api.Assertions.assertNull;
+import static org.junit.jupiter.api.Assertions.assertSame;
+import static org.junit.jupiter.api.Assertions.assertThrows;
 
 public class SAXExceptionInitCause {
 
@@ -55,8 +60,8 @@ public class SAXExceptionInitCause {
         serialSAX = pickleException(noCauseException);
         deserializedException = unpickleException(serialSAX);
 
-        Assert.assertNull(deserializedException.getCause());
-        Assert.assertEquals(deserializedException.getMessage(), SAX_MESSAGE);
+        assertNull(deserializedException.getCause());
+        assertEquals(SAX_MESSAGE, deserializedException.getMessage());
     }
 
     @Test
@@ -69,18 +74,18 @@ public class SAXExceptionInitCause {
         serialSAX = pickleException(withCauseException);
         deserializedException = unpickleException(serialSAX);
 
-        Assert.assertNotNull(deserializedException.getCause());
-        Assert.assertEquals(deserializedException.getMessage(), SAX_MESSAGE);
-        Assert.assertEquals(deserializedException.getCause().getMessage(), SAX_CAUSE_MESSAGE);
+        assertNotNull(deserializedException.getCause());
+        assertEquals(SAX_MESSAGE, deserializedException.getMessage());
+        assertEquals(SAX_CAUSE_MESSAGE, deserializedException.getCause().getMessage());
     }
 
     @Test
-    public void testCauseInitByCtor() throws Exception {
+    public void testCauseInitByCtor() {
         // Check that constructor properly initializes cause
         Exception cause = new Exception(SAX_CAUSE_MESSAGE);
         SAXException exception = new SAXException(cause);
-        Assert.assertSame(exception.getCause(), cause);
-        Assert.assertSame(exception.getException(), cause);
+        assertSame(cause, exception.getCause());
+        assertSame(cause, exception.getException());
     }
 
     @Test
@@ -89,8 +94,8 @@ public class SAXExceptionInitCause {
         SAXException exception = new SAXException();
         Exception cause = new Exception(SAX_CAUSE_MESSAGE);
         exception.initCause(cause);
-        Assert.assertSame(exception.getCause(), cause);
-        Assert.assertSame(exception.getException(), cause);
+        assertSame(cause, exception.getCause());
+        assertSame(cause, exception.getException());
     }
 
     @Test
@@ -100,48 +105,51 @@ public class SAXExceptionInitCause {
         SAXException exception = new SAXException();
         Throwable cause = new Throwable(SAX_CAUSE_MESSAGE);
         exception.initCause(cause);
-        Assert.assertSame(exception.getCause(),cause);
-        Assert.assertNull(exception.getException());
+        assertSame(cause, exception.getCause());
+        assertNull(exception.getException());
     }
 
-    @Test(expectedExceptions = IllegalStateException.class)
+    @Test
     public void testInitCauseTwice() {
         SAXException exception = new SAXException(new Exception(SAX_CAUSE_MESSAGE));
-        // Expecting IllegalStateException at this point
-        exception.initCause(new Exception(SAX_CAUSE_MESSAGE));
+        assertThrows(
+                IllegalStateException.class,
+                () -> exception.initCause(new Exception(SAX_CAUSE_MESSAGE)));
     }
 
     @Test
     public void testLegacySerialCtor() throws Exception {
         SAXException saxException8 = unpickleException(JDK8_SET_WITH_CTOR_ONLY);
-        Assert.assertNotNull(saxException8.getCause());
-        Assert.assertNotNull(saxException8.getException());
+        assertNotNull(saxException8.getCause());
+        assertNotNull(saxException8.getException());
     }
 
     @Test
     public void testLegacySerialCtorAndInit() throws Exception {
         SAXException saxException8 = unpickleException(JDK8_SET_WITH_CTOR_AND_INIT);
-        Assert.assertNotNull(saxException8.getCause());
-        Assert.assertNotNull(saxException8.getException());
+        assertNotNull(saxException8.getCause());
+        assertNotNull(saxException8.getException());
     }
 
     @Test
     public void testLegacySerialInitCause() throws Exception {
         SAXException saxException8 = unpickleException(JDK8_WITH_INIT_ONLY);
-        Assert.assertNotNull(saxException8.getCause());
-        Assert.assertNotNull(saxException8.getException());
+        assertNotNull(saxException8.getCause());
+        assertNotNull(saxException8.getException());
     }
 
     @Test
     public void testLegacySerialNothingSet() throws Exception {
         SAXException saxException8 = unpickleException(JDK8_NOTHING_SET);
-        Assert.assertNull(saxException8.getCause());
-        Assert.assertNull(saxException8.getException());
+        assertNull(saxException8.getCause());
+        assertNull(saxException8.getException());
     }
 
-    @Test(expectedExceptions = InvalidClassException.class)
-    public void testReadObjectIllegalStateException() throws Exception {
-        SAXException saxException8 = unpickleException(JDK8_CHECK_ILLEGAL_STATE_EXCEPTION);
+    @Test
+    public void testReadObjectIllegalStateException() {
+        assertThrows(
+                InvalidClassException.class,
+                () -> unpickleException(JDK8_CHECK_ILLEGAL_STATE_EXCEPTION));
     }
 
     // Serialize SAXException to byte array
@@ -164,8 +172,8 @@ public class SAXExceptionInitCause {
         return saxException;
     }
 
-    private static String SAX_MESSAGE = "SAXException message";
-    private static String SAX_CAUSE_MESSAGE = "SAXException cause message";
+    private static final String SAX_MESSAGE = "SAXException message";
+    private static final String SAX_CAUSE_MESSAGE = "SAXException cause message";
 
     /* This is a serial form of ordinary SAXException serialized
      * by the following JDK8 code:
diff --git a/test/jaxp/javax/xml/jaxp/unittest/sax/SAXParserTest.java b/test/jaxp/javax/xml/jaxp/unittest/sax/SAXParserTest.java
index 708ae2178b0..ee7e81df5fb 100644
--- a/test/jaxp/javax/xml/jaxp/unittest/sax/SAXParserTest.java
+++ b/test/jaxp/javax/xml/jaxp/unittest/sax/SAXParserTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,24 +23,25 @@
 
 package sax;
 
-import static jaxp.library.JAXPTestUtilities.getSystemProperty;
-import java.io.IOException;
-import java.nio.charset.StandardCharsets;
-import java.nio.file.Files;
-import java.nio.file.Path;
-import javax.xml.parsers.SAXParser;
-import javax.xml.parsers.SAXParserFactory;
-import org.testng.annotations.Test;
+import org.junit.jupiter.api.Test;
 import org.xml.sax.Attributes;
 import org.xml.sax.SAXException;
 import org.xml.sax.helpers.DefaultHandler;
 
+import javax.xml.parsers.SAXParser;
+import javax.xml.parsers.SAXParserFactory;
+import java.io.IOException;
+import java.nio.file.Files;
+import java.nio.file.Path;
+
+import static org.junit.jupiter.api.Assertions.assertThrows;
+
 /*
  * @test
  * @bug 8213734
  * @library /javax/xml/jaxp/libs /javax/xml/jaxp/unittest
- * @run testng sax.SAXParserTest
- * @summary Tests functionalities for SAXParser.
+ * @run junit sax.SAXParserTest
+ * @summary Tests that failed parsing closes the file correctly.
  */
 public class SAXParserTest {
 
@@ -51,35 +52,24 @@ public class SAXParserTest {
      */
     @Test
     public void testCloseReaders() throws Exception {
-        if (!getSystemProperty("os.name").contains("Windows")) {
-            System.out.println("This test only needs to be run on Windows.");
-            return;
-        }
-        Path testFile = createTestFile(null, "Test");
+        Path testFile = createTestFile("Test");
         System.out.println("Test file: " + testFile.toString());
         SAXParserFactory factory = SAXParserFactory.newDefaultInstance();
         SAXParser parser = factory.newSAXParser();
-        try {
-            parser.parse(testFile.toFile(), new DefaultHandler() {
-                @Override
-                public void startElement(String uri, String localName, String qName, Attributes attributes) throws SAXException {
-                    throw new SAXException("Stop the parser.");
-                }
-            });
-        } catch (SAXException e) {
-            // Do nothing
-        }
-
-        // deletion failes on Windows when the file is not closed
-        Files.deleteIfExists(testFile);
+        DefaultHandler explodingHandler = new DefaultHandler() {
+            @Override
+            public void startElement(String uri, String localName, String qName, Attributes attributes) throws SAXException {
+                throw new SAXException("Stop the parser.");
+            }
+        };
+        assertThrows(SAXException.class, () -> parser.parse(testFile.toFile(), explodingHandler));
+        // Deletion would fail on Windows if the file was not closed.
+        Files.delete(testFile);
     }
 
-    private static Path createTestFile(Path dir, String name) throws IOException {
+    private static Path createTestFile(String name) throws IOException {
         Path path = Files.createTempFile(name, ".xml");
-            byte[] bytes = "<?xml version=\"1.0\"?><test a1=\"x\" a2=\"y\"/>"
-        .getBytes(StandardCharsets.UTF_8);
-
-        Files.write(path, bytes);
+        Files.writeString(path, "<?xml version=\"1.0\"?><test a1=\"x\" a2=\"y\"/>");
         return path;
     }
 }
diff --git a/test/jaxp/javax/xml/jaxp/unittest/sax/SymbolTableResetTest.java b/test/jaxp/javax/xml/jaxp/unittest/sax/SymbolTableResetTest.java
index ff961e8e9e2..6a934aed291 100644
--- a/test/jaxp/javax/xml/jaxp/unittest/sax/SymbolTableResetTest.java
+++ b/test/jaxp/javax/xml/jaxp/unittest/sax/SymbolTableResetTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2017, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2017, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,20 +23,23 @@
 
 package sax;
 
-import java.io.StringReader;
-import javax.xml.parsers.SAXParser;
-import javax.xml.parsers.SAXParserFactory;
-import org.testng.Assert;
-import org.testng.annotations.Test;
+import org.junit.jupiter.api.Test;
 import org.xml.sax.InputSource;
 import org.xml.sax.helpers.DefaultHandler;
 
+import javax.xml.parsers.SAXParser;
+import javax.xml.parsers.SAXParserFactory;
+import java.io.StringReader;
+
+import static org.junit.jupiter.api.Assertions.assertNotSame;
+import static org.junit.jupiter.api.Assertions.assertSame;
+
 /*
  * @test
  * @bug 8173390 8176168
  * @library /javax/xml/jaxp/libs /javax/xml/jaxp/unittest
- * @run testng/othervm -Djdk.xml.resetSymbolTable=false sax.SymbolTableResetTest
- * @run testng/othervm -Djdk.xml.resetSymbolTable=true sax.SymbolTableResetTest
+ * @run junit/othervm -Djdk.xml.resetSymbolTable=false sax.SymbolTableResetTest
+ * @run junit/othervm -Djdk.xml.resetSymbolTable=true sax.SymbolTableResetTest
  * @summary Test that SAXParser reallocates symbol table during
  *          subsequent parse operations
  */
@@ -115,9 +118,9 @@ public class SymbolTableResetTest {
 
         // Check symbol table references after two subsequent parse operations
         if (resetExpected) {
-            Assert.assertNotSame(symTable1, symTable2, "Symbol table references");
+            assertNotSame(symTable1, symTable2, "Symbol table references");
         } else {
-            Assert.assertSame(symTable1, symTable2, "Symbol table references");
+            assertSame(symTable1, symTable2, "Symbol table references");
         }
     }
 
diff --git a/test/jaxp/javax/xml/jaxp/unittest/sax/XMLReaderTest.java b/test/jaxp/javax/xml/jaxp/unittest/sax/XMLReaderTest.java
index ae235f32549..d625f835a52 100644
--- a/test/jaxp/javax/xml/jaxp/unittest/sax/XMLReaderTest.java
+++ b/test/jaxp/javax/xml/jaxp/unittest/sax/XMLReaderTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2016, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2016, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,36 +23,26 @@
 
 package sax;
 
-import static jaxp.library.JAXPTestUtilities.clearSystemProperty;
-import static jaxp.library.JAXPTestUtilities.setSystemProperty;
-
-import javax.xml.parsers.ParserConfigurationException;
-import javax.xml.parsers.SAXParserFactory;
-
-import org.testng.annotations.AfterClass;
-import org.testng.annotations.Test;
+import org.junit.jupiter.api.Test;
 import org.xml.sax.SAXException;
 import org.xml.sax.XMLReader;
 import org.xml.sax.helpers.XMLReaderAdapter;
 import org.xml.sax.helpers.XMLReaderFactory;
 
+import javax.xml.parsers.ParserConfigurationException;
+import javax.xml.parsers.SAXParserFactory;
+
+import static org.junit.jupiter.api.Assertions.assertThrows;
+
 /*
  * @test
  * @bug 8158246 8316383
  * @library /javax/xml/jaxp/libs /javax/xml/jaxp/unittest
- * @run testng/othervm sax.XMLReaderTest
+ * @run junit/othervm sax.XMLReaderTest
  * @summary This class contains tests that cover the creation of XMLReader.
  */
 public class XMLReaderTest {
-    private final String SAX_PROPNAME = "org.xml.sax.driver";
-
-    /*
-     * Clean up after test
-     */
-    @AfterClass
-    public void cleanUp() throws Exception {
-        clearSystemProperty(SAX_PROPNAME);
-    }
+    private static final String SAX_PROPNAME = "org.xml.sax.driver";
 
     /*
      * @bug 8158246
@@ -61,12 +51,16 @@ public class XMLReaderTest {
      *
      * Except test format, this test is the same as JCK's test Ctor003.
      */
-    @Test(expectedExceptions = SAXException.class)
+    @Test
     public void testcreateXMLReader() throws SAXException, ParserConfigurationException {
         String className = SAXParserFactory.newInstance().newSAXParser()
-                            .getXMLReader().getClass().getName();
-        setSystemProperty(SAX_PROPNAME, className + "nosuch");
-        XMLReaderAdapter adapter = new XMLReaderAdapter();
+                .getXMLReader().getClass().getName();
+        System.setProperty(SAX_PROPNAME, className + "nosuch");
+        try {
+            assertThrows(SAXException.class, XMLReaderAdapter::new);
+        } finally {
+            System.clearProperty(SAX_PROPNAME);
+        }
     }
 
     /*
diff --git a/test/jaxp/javax/xml/jaxp/unittest/sbd/test/ExternalRefTest.java b/test/jaxp/javax/xml/jaxp/unittest/sbd/test/ExternalRefTest.java
index 0b9daed0d83..273278f23e5 100644
--- a/test/jaxp/javax/xml/jaxp/unittest/sbd/test/ExternalRefTest.java
+++ b/test/jaxp/javax/xml/jaxp/unittest/sbd/test/ExternalRefTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2024, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -22,19 +22,21 @@
  */
 package sbd.test;
 
-import java.io.File;
-import javax.xml.parsers.SAXParser;
-import javax.xml.parsers.SAXParserFactory;
-import org.testng.Assert;
-import org.testng.annotations.Test;
+import org.junit.jupiter.api.Test;
 import org.xml.sax.SAXParseException;
 import org.xml.sax.helpers.DefaultHandler;
 
+import javax.xml.parsers.SAXParser;
+import javax.xml.parsers.SAXParserFactory;
+import java.io.File;
+
+import static org.junit.jupiter.api.Assertions.assertThrows;
+
 /*
  * @test
  * @bug 8326915
  * @library /javax/xml/jaxp/libs /javax/xml/jaxp/unittest
- * @run testng/othervm sbd.test.ExternalRefTest
+ * @run junit/othervm sbd.test.ExternalRefTest
  * @summary Part of the Secure-By-Default (SBD) project. This test verifies issues
  * and error message improvements related to external references.
  */
@@ -43,11 +45,10 @@ public class ExternalRefTest {
      * @bug 8326915
      * Verifies that SAXParseException rather than NPE is thrown when a validating
      * parser is restricted from processing external references.
-     * @throws Exception if the test fails
      */
     @Test
-    public void testValidatingParser() throws Exception {
-        Assert.assertThrows(SAXParseException.class, () -> validateWithParser());
+    public void testValidatingParser() {
+        assertThrows(SAXParseException.class, this::validateWithParser);
     }
 
     private void validateWithParser() throws Exception {

From dfe438d0570ada60de9d8dd7cdf97d229d91fc48 Mon Sep 17 00:00:00 2001
From: Ruben Ayrapetyan <ruben.ayrapetyan@arm.com>
Date: Tue, 31 Mar 2026 10:14:26 +0000
Subject: [PATCH 431/655] 8366441: AArch64: Support WFET in OnSpinWait

Co-authored-by: Stuart Monteith <smonteith@openjdk.org>
Co-authored-by: Andrew Haley <aph@openjdk.org>
Reviewed-by: aph, eastigeevich
---
 src/hotspot/cpu/aarch64/assembler_aarch64.hpp |    4 +
 src/hotspot/cpu/aarch64/globals_aarch64.hpp   |   14 +-
 .../cpu/aarch64/macroAssembler_aarch64.cpp    |   25 +
 .../cpu/aarch64/macroAssembler_aarch64.hpp    |    9 +
 src/hotspot/cpu/aarch64/spin_wait_aarch64.cpp |    3 +
 src/hotspot/cpu/aarch64/spin_wait_aarch64.hpp |   17 +-
 .../cpu/aarch64/vm_version_aarch64.cpp        |   26 +-
 .../cpu/aarch64/vm_version_aarch64.hpp        |    4 +-
 .../os_cpu/bsd_aarch64/os_bsd_aarch64.cpp     |    2 +
 .../vm_version_linux_aarch64.cpp              |   13 +
 .../flags/jvmFlagConstraintsRuntime.cpp       |   16 +-
 .../classes/jdk/vm/ci/aarch64/AArch64.java    |    2 +
 test/hotspot/gtest/aarch64/aarch64-asmtest.py |   13 +-
 test/hotspot/gtest/aarch64/asmtest.out.h      | 2253 +++++++++--------
 .../onSpinWait/TestOnSpinWaitAArch64.java     |   38 +-
 15 files changed, 1299 insertions(+), 1140 deletions(-)

diff --git a/src/hotspot/cpu/aarch64/assembler_aarch64.hpp b/src/hotspot/cpu/aarch64/assembler_aarch64.hpp
index 67cf77989d2..ebd8f3a9e03 100644
--- a/src/hotspot/cpu/aarch64/assembler_aarch64.hpp
+++ b/src/hotspot/cpu/aarch64/assembler_aarch64.hpp
@@ -1095,6 +1095,10 @@ public:
 
 #undef INSN
 
+  void wfet(Register rt) {
+    system(0b00, 0b011, 0b0001, 0b0000, 0b000, rt);
+  }
+
   // we only provide mrs and msr for the special purpose system
   // registers where op1 (instr[20:19]) == 11
   // n.b msr has L (instr[21]) == 0 mrs has L == 1
diff --git a/src/hotspot/cpu/aarch64/globals_aarch64.hpp b/src/hotspot/cpu/aarch64/globals_aarch64.hpp
index e6de2c798b1..0ca5cb25e0c 100644
--- a/src/hotspot/cpu/aarch64/globals_aarch64.hpp
+++ b/src/hotspot/cpu/aarch64/globals_aarch64.hpp
@@ -115,14 +115,18 @@ define_pd_global(intx, InlineSmallCode,          1000);
           "Value -1 means off.")                                        \
           range(-1, 4096)                                               \
   product(ccstr, OnSpinWaitInst, "yield", DIAGNOSTIC,                   \
-          "The instruction to use to implement "                        \
-          "java.lang.Thread.onSpinWait()."                              \
-          "Valid values are: none, nop, isb, yield, sb.")               \
+          "The instruction to use for java.lang.Thread.onSpinWait(). "  \
+          "Valid values are: none, nop, isb, yield, sb, wfet.")         \
           constraint(OnSpinWaitInstNameConstraintFunc, AtParse)         \
   product(uint, OnSpinWaitInstCount, 1, DIAGNOSTIC,                     \
-          "The number of OnSpinWaitInst instructions to generate."      \
-          "It cannot be used with OnSpinWaitInst=none.")                \
+          "The number of OnSpinWaitInst instructions to generate. "     \
+          "It cannot be used with OnSpinWaitInst=none. "                \
+          "For OnSpinWaitInst=wfet it must be 1.")                      \
           range(1, 99)                                                  \
+  product(uint, OnSpinWaitDelay, 40, DIAGNOSTIC,                        \
+          "The minimum delay (in nanoseconds) of the OnSpinWait loop. " \
+          "It can only be used with -XX:OnSpinWaitInst=wfet.")          \
+          range(1, 1000)                                                \
   product(ccstr, UseBranchProtection, "none",                           \
           "Branch Protection to use: none, standard, pac-ret")          \
   product(bool, AlwaysMergeDMB, true, DIAGNOSTIC,                       \
diff --git a/src/hotspot/cpu/aarch64/macroAssembler_aarch64.cpp b/src/hotspot/cpu/aarch64/macroAssembler_aarch64.cpp
index 732d94180ae..ebbc35ce20a 100644
--- a/src/hotspot/cpu/aarch64/macroAssembler_aarch64.cpp
+++ b/src/hotspot/cpu/aarch64/macroAssembler_aarch64.cpp
@@ -6807,6 +6807,9 @@ void MacroAssembler::spin_wait() {
         assert(VM_Version::supports_sb(), "current CPU does not support SB instruction");
         sb();
         break;
+      case SpinWait::WFET:
+        spin_wait_wfet(VM_Version::spin_wait_desc().delay());
+        break;
       default:
         ShouldNotReachHere();
     }
@@ -6814,6 +6817,28 @@ void MacroAssembler::spin_wait() {
   block_comment("}");
 }
 
+void MacroAssembler::spin_wait_wfet(int delay_ns) {
+  // The sequence assumes CNTFRQ_EL0 is fixed to 1GHz. The assumption is valid
+  // starting from Armv8.6, according to the "D12.1.2 The system counter" of the
+  // Arm Architecture Reference Manual for A-profile architecture version M.a.a.
+  // This is sufficient because FEAT_WFXT is introduced from Armv8.6.
+  Register target = rscratch1;
+  Register current = rscratch2;
+  get_cntvctss_el0(current);
+  add(target, current, delay_ns);
+
+  Label L_wait_loop;
+  bind(L_wait_loop);
+
+  wfet(target);
+  get_cntvctss_el0(current);
+
+  cmp(current, target);
+  br(LT, L_wait_loop);
+
+  sb();
+}
+
 // Stack frame creation/removal
 
 void MacroAssembler::enter(bool strip_ret_addr) {
diff --git a/src/hotspot/cpu/aarch64/macroAssembler_aarch64.hpp b/src/hotspot/cpu/aarch64/macroAssembler_aarch64.hpp
index fa32f3055b9..994fbe3c80f 100644
--- a/src/hotspot/cpu/aarch64/macroAssembler_aarch64.hpp
+++ b/src/hotspot/cpu/aarch64/macroAssembler_aarch64.hpp
@@ -660,6 +660,14 @@ public:
     msr(0b011, 0b0100, 0b0010, 0b000, reg);
   }
 
+  // CNTVCTSS_EL0:   op1 == 011
+  //                 CRn == 1110
+  //                 CRm == 0000
+  //                 op2 == 110
+  inline void get_cntvctss_el0(Register reg) {
+    mrs(0b011, 0b1110, 0b0000, 0b110, reg);
+  }
+
   // idiv variant which deals with MINLONG as dividend and -1 as divisor
   int corrected_idivl(Register result, Register ra, Register rb,
                       bool want_remainder, Register tmp = rscratch1);
@@ -1724,6 +1732,7 @@ public:
 
   // Code for java.lang.Thread::onSpinWait() intrinsic.
   void spin_wait();
+  void spin_wait_wfet(int delay_ns);
 
   void fast_lock(Register basic_lock, Register obj, Register t1, Register t2, Register t3, Label& slow);
   void fast_unlock(Register obj, Register t1, Register t2, Register t3, Label& slow);
diff --git a/src/hotspot/cpu/aarch64/spin_wait_aarch64.cpp b/src/hotspot/cpu/aarch64/spin_wait_aarch64.cpp
index 7da0151d834..97a981ab815 100644
--- a/src/hotspot/cpu/aarch64/spin_wait_aarch64.cpp
+++ b/src/hotspot/cpu/aarch64/spin_wait_aarch64.cpp
@@ -32,6 +32,7 @@ bool SpinWait::supports(const char *name) {
           strcmp(name, "isb")   == 0 ||
           strcmp(name, "yield") == 0 ||
           strcmp(name, "sb")    == 0 ||
+          strcmp(name, "wfet")  == 0 ||
           strcmp(name, "none")  == 0);
 }
 
@@ -46,6 +47,8 @@ SpinWait::Inst SpinWait::from_name(const char* name) {
     return SpinWait::YIELD;
   } else if (strcmp(name, "sb") == 0) {
     return SpinWait::SB;
+  } else if (strcmp(name, "wfet") == 0) {
+    return SpinWait::WFET;
   }
 
   return SpinWait::NONE;
diff --git a/src/hotspot/cpu/aarch64/spin_wait_aarch64.hpp b/src/hotspot/cpu/aarch64/spin_wait_aarch64.hpp
index 0e96a4b7157..6ebcd2477a8 100644
--- a/src/hotspot/cpu/aarch64/spin_wait_aarch64.hpp
+++ b/src/hotspot/cpu/aarch64/spin_wait_aarch64.hpp
@@ -24,6 +24,8 @@
 #ifndef CPU_AARCH64_SPIN_WAIT_AARCH64_HPP
 #define CPU_AARCH64_SPIN_WAIT_AARCH64_HPP
 
+#include "utilities/debug.hpp"
+
 class SpinWait {
 public:
   enum Inst {
@@ -31,21 +33,30 @@ public:
     NOP,
     ISB,
     YIELD,
-    SB
+    SB,
+    WFET
   };
 
 private:
   Inst _inst;
   int _count;
+  int _delay;
 
   Inst from_name(const char *name);
 
 public:
-  SpinWait(Inst inst = NONE, int count = 0) : _inst(inst), _count(inst == NONE ? 0 : count) {}
-  SpinWait(const char *name, int count) : SpinWait(from_name(name), count) {}
+  SpinWait(Inst inst = NONE, int count = 0, int delay = -1)
+    : _inst(inst), _count(inst == NONE ? 0 : count), _delay(delay) {}
+  SpinWait(const char *name, int count, int delay)
+    : SpinWait(from_name(name), count, delay) {}
 
   Inst inst() const { return _inst; }
   int inst_count() const { return _count; }
+  int delay() const {
+    assert(_inst == WFET, "Specifying the delay value is only supported for WFET");
+    assert(_delay > 0, "The delay value must be positive");
+    return _delay;
+  }
 
   static bool supports(const char *name);
 };
diff --git a/src/hotspot/cpu/aarch64/vm_version_aarch64.cpp b/src/hotspot/cpu/aarch64/vm_version_aarch64.cpp
index 4423d9c5b58..8ccffac25a8 100644
--- a/src/hotspot/cpu/aarch64/vm_version_aarch64.cpp
+++ b/src/hotspot/cpu/aarch64/vm_version_aarch64.cpp
@@ -1,7 +1,7 @@
 /*
  * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
  * Copyright (c) 2015, 2020, Red Hat Inc. All rights reserved.
- * Copyright 2025 Arm Limited and/or its affiliates.
+ * Copyright 2025, 2026 Arm Limited and/or its affiliates.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -55,11 +55,33 @@ SpinWait VM_Version::_spin_wait;
 const char* VM_Version::_features_names[MAX_CPU_FEATURES] = { nullptr };
 
 static SpinWait get_spin_wait_desc() {
-  SpinWait spin_wait(OnSpinWaitInst, OnSpinWaitInstCount);
+  SpinWait spin_wait(OnSpinWaitInst, OnSpinWaitInstCount, OnSpinWaitDelay);
   if (spin_wait.inst() == SpinWait::SB && !VM_Version::supports_sb()) {
     vm_exit_during_initialization("OnSpinWaitInst is SB but current CPU does not support SB instruction");
   }
 
+  if (spin_wait.inst() == SpinWait::WFET) {
+    if (!VM_Version::supports_wfxt()) {
+      vm_exit_during_initialization("OnSpinWaitInst is WFET but the CPU does not support the WFET instruction");
+    }
+
+    if (!VM_Version::supports_ecv()) {
+      vm_exit_during_initialization("The CPU does not support the FEAT_ECV required by the -XX:OnSpinWaitInst=wfet implementation");
+    }
+
+    if (!VM_Version::supports_sb()) {
+      vm_exit_during_initialization("The CPU does not support the SB instruction required by the -XX:OnSpinWaitInst=wfet implementation");
+    }
+
+    if (OnSpinWaitInstCount != 1) {
+      vm_exit_during_initialization("OnSpinWaitInstCount for OnSpinWaitInst 'wfet' must be 1");
+    }
+  } else {
+    if (!FLAG_IS_DEFAULT(OnSpinWaitDelay)) {
+      vm_exit_during_initialization("OnSpinWaitDelay can only be used with -XX:OnSpinWaitInst=wfet");
+    }
+  }
+
   return spin_wait;
 }
 
diff --git a/src/hotspot/cpu/aarch64/vm_version_aarch64.hpp b/src/hotspot/cpu/aarch64/vm_version_aarch64.hpp
index e8681611234..378524fe168 100644
--- a/src/hotspot/cpu/aarch64/vm_version_aarch64.hpp
+++ b/src/hotspot/cpu/aarch64/vm_version_aarch64.hpp
@@ -159,7 +159,9 @@ public:
     /* flags above must follow Linux HWCAP */ \
     decl(SVEBITPERM,    svebitperm,    27)    \
     decl(SVE2,          sve2,          28)    \
-    decl(A53MAC,        a53mac,        31)
+    decl(A53MAC,        a53mac,        31)    \
+    decl(ECV,           ecv,           32)    \
+    decl(WFXT,          wfxt,          33)
 
   enum Feature_Flag {
 #define DECLARE_CPU_FEATURE_FLAG(id, name, bit) CPU_##id = bit,
diff --git a/src/hotspot/os_cpu/bsd_aarch64/os_bsd_aarch64.cpp b/src/hotspot/os_cpu/bsd_aarch64/os_bsd_aarch64.cpp
index 36599594842..49d879731ff 100644
--- a/src/hotspot/os_cpu/bsd_aarch64/os_bsd_aarch64.cpp
+++ b/src/hotspot/os_cpu/bsd_aarch64/os_bsd_aarch64.cpp
@@ -620,6 +620,8 @@ extern "C" {
       assert(VM_Version::supports_sb(), "current CPU does not support SB instruction");
       asm volatile(".inst 0xd50330ff" : : : "memory");
       break;
+    case SpinWait::WFET:
+      ShouldNotReachHere();
 #ifdef ASSERT
     default:
       ShouldNotReachHere();
diff --git a/src/hotspot/os_cpu/linux_aarch64/vm_version_linux_aarch64.cpp b/src/hotspot/os_cpu/linux_aarch64/vm_version_linux_aarch64.cpp
index 1fe06dc640d..168fc622a0b 100644
--- a/src/hotspot/os_cpu/linux_aarch64/vm_version_linux_aarch64.cpp
+++ b/src/hotspot/os_cpu/linux_aarch64/vm_version_linux_aarch64.cpp
@@ -95,6 +95,13 @@
 #define HWCAP2_SVEBITPERM (1 << 4)
 #endif
 
+#ifndef HWCAP2_ECV
+#define HWCAP2_ECV (1 << 19)
+#endif
+
+#ifndef HWCAP2_WFXT
+#define HWCAP2_WFXT (1u << 31)
+#endif
 #ifndef PR_SVE_GET_VL
 // For old toolchains which do not have SVE related macros defined.
 #define PR_SVE_SET_VL   50
@@ -158,6 +165,12 @@ void VM_Version::get_os_cpu_info() {
   if (auxv2 & HWCAP2_SVEBITPERM) {
     set_feature(CPU_SVEBITPERM);
   }
+  if (auxv2 & HWCAP2_ECV) {
+    set_feature(CPU_ECV);
+  }
+  if (auxv2 & HWCAP2_WFXT) {
+    set_feature(CPU_WFXT);
+  }
 
   uint64_t ctr_el0;
   uint64_t dczid_el0;
diff --git a/src/hotspot/share/runtime/flags/jvmFlagConstraintsRuntime.cpp b/src/hotspot/share/runtime/flags/jvmFlagConstraintsRuntime.cpp
index 1e6efd893c8..1f16fada239 100644
--- a/src/hotspot/share/runtime/flags/jvmFlagConstraintsRuntime.cpp
+++ b/src/hotspot/share/runtime/flags/jvmFlagConstraintsRuntime.cpp
@@ -153,6 +153,20 @@ JVMFlag::Error OnSpinWaitInstNameConstraintFunc(ccstr value, bool verbose) {
     return JVMFlag::VIOLATES_CONSTRAINT;
   }
 
+#ifdef LINUX
+  if (strcmp(value, "wfet") == 0) {
+    if (UnlockExperimentalVMOptions) {
+      return JVMFlag::SUCCESS;
+    } else {
+      JVMFlag::printError(verbose,
+                          "'wfet' value for OnSpinWaitInst is experimental and "
+                          "must be enabled via -XX:+UnlockExperimentalVMOptions.\n"
+                          "Error: The unlock option must precede 'OnSpinWaitInst'.\n");
+      return JVMFlag::VIOLATES_CONSTRAINT;
+    }
+  }
+#endif
+
   if (strcmp(value, "nop")   != 0 &&
       strcmp(value, "isb")   != 0 &&
       strcmp(value, "yield") != 0 &&
@@ -160,7 +174,7 @@ JVMFlag::Error OnSpinWaitInstNameConstraintFunc(ccstr value, bool verbose) {
       strcmp(value, "none")  != 0) {
     JVMFlag::printError(verbose,
                         "Unrecognized value %s for OnSpinWaitInst. Must be one of the following: "
-                        "nop, isb, yield, sb, none\n",
+                        "nop, isb, yield, sb," LINUX_ONLY(" wfet,") " none\n",
                         value);
     return JVMFlag::VIOLATES_CONSTRAINT;
   }
diff --git a/src/jdk.internal.vm.ci/share/classes/jdk/vm/ci/aarch64/AArch64.java b/src/jdk.internal.vm.ci/share/classes/jdk/vm/ci/aarch64/AArch64.java
index 391ac224609..7790a9abd7c 100644
--- a/src/jdk.internal.vm.ci/share/classes/jdk/vm/ci/aarch64/AArch64.java
+++ b/src/jdk.internal.vm.ci/share/classes/jdk/vm/ci/aarch64/AArch64.java
@@ -184,6 +184,8 @@ public class AArch64 extends Architecture {
         SVEBITPERM,
         SVE2,
         A53MAC,
+        ECV,
+        WFXT,
         FPHP,
         ASIMDHP,
     }
diff --git a/test/hotspot/gtest/aarch64/aarch64-asmtest.py b/test/hotspot/gtest/aarch64/aarch64-asmtest.py
index 1ac2e1a89cd..bcf786d6f1f 100644
--- a/test/hotspot/gtest/aarch64/aarch64-asmtest.py
+++ b/test/hotspot/gtest/aarch64/aarch64-asmtest.py
@@ -391,6 +391,11 @@ class SystemRegOp(Instruction):
             self.CRn = 0b0100
             self.CRm = 0b0010
             self.op2 = 0b000
+        elif self.system_reg == 'cntvctss_el0':
+            self.op1 = 0b011
+            self.CRn = 0b1110
+            self.CRm = 0b0000
+            self.op2 = 0b110
 
     def generate(self):
         self.reg = [GeneralRegister().generate()]
@@ -1607,6 +1612,8 @@ generate (Op, ["nop", "yield", "wfe", "sev", "sevl",
                "pacia1716", "paciasp", "paciaz", "pacib1716", "pacibsp", "pacibz",
                "eret", "drps", "isb", "sb",])
 
+generate (OneRegOp, ["wfet"])
+
 # Ensure the "i" is not stripped off the end of the instruction
 generate (PostfixExceptionOp, ["wfi", "xpaclri"])
 
@@ -1623,7 +1630,7 @@ generate (OneRegOp, ["br", "blr",
 for system_reg in ["fpsr", "nzcv"]:
     generate (SystemOneRegOp, [ ["msr", system_reg] ])
 
-for system_reg in ["fpsr", "nzcv", "dczid_el0", "ctr_el0"]:
+for system_reg in ["fpsr", "nzcv", "dczid_el0", "ctr_el0", "cntvctss_el0"]:
     generate (OneRegSystemOp, [ ["mrs", system_reg] ])
 
 # Ensure the "i" is not stripped off the end of the instruction
@@ -2275,9 +2282,9 @@ outfile.write("forth:\n")
 
 outfile.close()
 
-# compile for sve with armv9-a+sha3+sve2-bitperm because of SHA3 crypto extension and SVE2 bitperm instructions.
+# compile for sve with armv9.2-a+sha3+sve2-bitperm because of SHA3 crypto extension and SVE2 bitperm instructions.
 # armv9-a enables sve and sve2 by default.
-subprocess.check_call([AARCH64_AS, "-march=armv9-a+sha3+sve2-bitperm", "aarch64ops.s", "-o", "aarch64ops.o"])
+subprocess.check_call([AARCH64_AS, "-march=armv9.2-a+sha3+sve2-bitperm", "aarch64ops.s", "-o", "aarch64ops.o"])
 
 print
 print "/*"
diff --git a/test/hotspot/gtest/aarch64/asmtest.out.h b/test/hotspot/gtest/aarch64/asmtest.out.h
index 22bb6c57784..cd9fd4cfe9a 100644
--- a/test/hotspot/gtest/aarch64/asmtest.out.h
+++ b/test/hotspot/gtest/aarch64/asmtest.out.h
@@ -189,756 +189,762 @@
     __ isb();                                          //       isb
     __ sb();                                           //       sb
 
+// OneRegOp
+    __ wfet(r26);                                      //       wfet    x26
+
 // PostfixExceptionOp
     __ wfi();                                          //       wfi
     __ xpaclri();                                      //       xpaclri
 
 // SystemOp
-    __ dsb(Assembler::ST);                             //       dsb     ST
-    __ dmb(Assembler::OSHST);                          //       dmb     OSHST
+    __ dsb(Assembler::OSHST);                          //       dsb     OSHST
+    __ dmb(Assembler::ISHLD);                          //       dmb     ISHLD
 
 // OneRegOp
-    __ br(r16);                                        //       br      x16
-    __ blr(r20);                                       //       blr     x20
-    __ paciza(r10);                                    //       paciza  x10
-    __ pacizb(r27);                                    //       pacizb  x27
-    __ pacdza(r8);                                     //       pacdza  x8
-    __ pacdzb(r0);                                     //       pacdzb  x0
-    __ autiza(r1);                                     //       autiza  x1
-    __ autizb(r21);                                    //       autizb  x21
-    __ autdza(r17);                                    //       autdza  x17
+    __ br(r20);                                        //       br      x20
+    __ blr(r10);                                       //       blr     x10
+    __ paciza(r27);                                    //       paciza  x27
+    __ pacizb(r8);                                     //       pacizb  x8
+    __ pacdza(r0);                                     //       pacdza  x0
+    __ pacdzb(r1);                                     //       pacdzb  x1
+    __ autiza(r21);                                    //       autiza  x21
+    __ autizb(r17);                                    //       autizb  x17
+    __ autdza(r29);                                    //       autdza  x29
     __ autdzb(r29);                                    //       autdzb  x29
-    __ xpacd(r29);                                     //       xpacd   x29
-    __ braaz(r28);                                     //       braaz   x28
-    __ brabz(r1);                                      //       brabz   x1
-    __ blraaz(r23);                                    //       blraaz  x23
-    __ blrabz(r21);                                    //       blrabz  x21
+    __ xpacd(r28);                                     //       xpacd   x28
+    __ braaz(r1);                                      //       braaz   x1
+    __ brabz(r23);                                     //       brabz   x23
+    __ blraaz(r21);                                    //       blraaz  x21
+    __ blrabz(r20);                                    //       blrabz  x20
 
 // SystemOneRegOp
-    __ msr(3, 4, 4, 1, r20);                           //       msr     fpsr, x20
+    __ msr(3, 4, 4, 1, r22);                           //       msr     fpsr, x22
 
 // SystemOneRegOp
-    __ msr(3, 4, 2, 0, r22);                           //       msr     nzcv, x22
+    __ msr(3, 4, 2, 0, r27);                           //       msr     nzcv, x27
 
 // OneRegSystemOp
-    __ mrs(3, 4, 4, 1, r27);                           //       mrs     x27, fpsr
+    __ mrs(3, 4, 4, 1, r19);                           //       mrs     x19, fpsr
 
 // OneRegSystemOp
-    __ mrs(3, 4, 2, 0, r19);                           //       mrs     x19, nzcv
+    __ mrs(3, 4, 2, 0, r11);                           //       mrs     x11, nzcv
 
 // OneRegSystemOp
-    __ mrs(3, 0, 0, 7, r11);                           //       mrs     x11, dczid_el0
+    __ mrs(3, 0, 0, 7, r16);                           //       mrs     x16, dczid_el0
 
 // OneRegSystemOp
-    __ mrs(3, 0, 0, 1, r16);                           //       mrs     x16, ctr_el0
+    __ mrs(3, 0, 0, 1, r6);                            //       mrs     x6, ctr_el0
+
+// OneRegSystemOp
+    __ mrs(3, 14, 0, 6, r17);                          //       mrs     x17, cntvctss_el0
 
 // PostfixExceptionOneRegOp
-    __ xpaci(r6);                                      //       xpaci   x6
+    __ xpaci(r0);                                      //       xpaci   x0
 
 // LoadStoreExclusiveOp
-    __ stxr(r17, r0, r4);                              //       stxr    w17, x0, [x4]
-    __ stlxr(r10, r24, r22);                           //       stlxr   w10, x24, [x22]
-    __ ldxr(r10, r19);                                 //       ldxr    x10, [x19]
-    __ ldaxr(r1, r5);                                  //       ldaxr   x1, [x5]
-    __ stlr(r30, r8);                                  //       stlr    x30, [x8]
-    __ ldar(r12, r17);                                 //       ldar    x12, [x17]
+    __ stxr(r4, r10, r24);                             //       stxr    w4, x10, [x24]
+    __ stlxr(r22, r10, r19);                           //       stlxr   w22, x10, [x19]
+    __ ldxr(r1, r5);                                   //       ldxr    x1, [x5]
+    __ ldaxr(r30, r8);                                 //       ldaxr   x30, [x8]
+    __ stlr(r12, r17);                                 //       stlr    x12, [x17]
+    __ ldar(r9, r14);                                  //       ldar    x9, [x14]
 
 // LoadStoreExclusiveOp
-    __ stxrw(r9, r14, r7);                             //       stxr    w9, w14, [x7]
-    __ stlxrw(r1, r5, r16);                            //       stlxr   w1, w5, [x16]
-    __ ldxrw(r2, r12);                                 //       ldxr    w2, [x12]
-    __ ldaxrw(r10, r12);                               //       ldaxr   w10, [x12]
-    __ stlrw(r3, r28);                                 //       stlr    w3, [x28]
-    __ ldarw(r14, r26);                                //       ldar    w14, [x26]
+    __ stxrw(r7, r1, r5);                              //       stxr    w7, w1, [x5]
+    __ stlxrw(r16, r2, r12);                           //       stlxr   w16, w2, [x12]
+    __ ldxrw(r10, r12);                                //       ldxr    w10, [x12]
+    __ ldaxrw(r3, r28);                                //       ldaxr   w3, [x28]
+    __ stlrw(r14, r26);                                //       stlr    w14, [x26]
+    __ ldarw(r30, r10);                                //       ldar    w30, [x10]
 
 // LoadStoreExclusiveOp
-    __ stxrh(r30, r10, r14);                           //       stxrh   w30, w10, [x14]
-    __ stlxrh(r21, r13, r9);                           //       stlxrh  w21, w13, [x9]
-    __ ldxrh(r22, r27);                                //       ldxrh   w22, [x27]
-    __ ldaxrh(r28, r19);                               //       ldaxrh  w28, [x19]
-    __ stlrh(r11, r30);                                //       stlrh   w11, [x30]
-    __ ldarh(r19, r2);                                 //       ldarh   w19, [x2]
+    __ stxrh(r14, r21, r13);                           //       stxrh   w14, w21, [x13]
+    __ stlxrh(r9, r22, r27);                           //       stlxrh  w9, w22, [x27]
+    __ ldxrh(r28, r19);                                //       ldxrh   w28, [x19]
+    __ ldaxrh(r11, r30);                               //       ldaxrh  w11, [x30]
+    __ stlrh(r19, r2);                                 //       stlrh   w19, [x2]
+    __ ldarh(r2, r23);                                 //       ldarh   w2, [x23]
 
 // LoadStoreExclusiveOp
-    __ stxrb(r2, r23, r1);                             //       stxrb   w2, w23, [x1]
-    __ stlxrb(r0, r12, r16);                           //       stlxrb  w0, w12, [x16]
-    __ ldxrb(r13, r15);                                //       ldxrb   w13, [x15]
-    __ ldaxrb(r17, r21);                               //       ldaxrb  w17, [x21]
-    __ stlrb(r13, r11);                                //       stlrb   w13, [x11]
-    __ ldarb(r30, r8);                                 //       ldarb   w30, [x8]
+    __ stxrb(r1, r0, r12);                             //       stxrb   w1, w0, [x12]
+    __ stlxrb(r16, r13, r15);                          //       stlxrb  w16, w13, [x15]
+    __ ldxrb(r17, r21);                                //       ldxrb   w17, [x21]
+    __ ldaxrb(r13, r11);                               //       ldaxrb  w13, [x11]
+    __ stlrb(r30, r8);                                 //       stlrb   w30, [x8]
+    __ ldarb(r24, r13);                                //       ldarb   w24, [x13]
 
 // LoadStoreExclusiveOp
-    __ ldxp(r24, r13, r11);                            //       ldxp    x24, x13, [x11]
-    __ ldaxp(r1, r26, r21);                            //       ldaxp   x1, x26, [x21]
-    __ stxp(r27, r13, r20, r3);                        //       stxp    w27, x13, x20, [x3]
-    __ stlxp(r12, r6, r1, r29);                        //       stlxp   w12, x6, x1, [x29]
+    __ ldxp(r11, r1, r26);                             //       ldxp    x11, x1, [x26]
+    __ ldaxp(r21, r27, r13);                           //       ldaxp   x21, x27, [x13]
+    __ stxp(r20, r3, r12, r6);                         //       stxp    w20, x3, x12, [x6]
+    __ stlxp(r1, r29, r6, r4);                         //       stlxp   w1, x29, x6, [x4]
 
 // LoadStoreExclusiveOp
-    __ ldxpw(r6, r4, r11);                             //       ldxp    w6, w4, [x11]
-    __ ldaxpw(r16, r4, r30);                           //       ldaxp   w16, w4, [x30]
-    __ stxpw(r30, r4, r12, r21);                       //       stxp    w30, w4, w12, [x21]
-    __ stlxpw(r27, r15, r28, r9);                      //       stlxp   w27, w15, w28, [x9]
+    __ ldxpw(r6, r11, r16);                            //       ldxp    w6, w11, [x16]
+    __ ldaxpw(r4, r30, r12);                           //       ldaxp   w4, w30, [x12]
+    __ stxpw(r21, r27, r15, r28);                      //       stxp    w21, w27, w15, [x28]
+    __ stlxpw(r9, r15, r20, r6);                       //       stlxp   w9, w15, w20, [x6]
 
 // base_plus_unscaled_offset
 // LoadStoreOp
-    __ str(r25, Address(r15, 1));                      //       str     x25, [x15, 1]
-    __ strw(r2, Address(r1, -79));                     //       str     w2, [x1, -79]
-    __ strb(r20, Address(r26, -22));                   //       strb    w20, [x26, -22]
-    __ strh(r23, Address(r30, 22));                    //       strh    w23, [x30, 22]
-    __ ldr(r26, Address(r28, -49));                    //       ldr     x26, [x28, -49]
-    __ ldrw(r9, Address(r24, -128));                   //       ldr     w9, [x24, -128]
-    __ ldrb(r12, Address(r12, -30));                   //       ldrb    w12, [x12, -30]
-    __ ldrh(r1, Address(r15, 5));                      //       ldrh    w1, [x15, 5]
-    __ ldrsb(r24, Address(r14, -31));                  //       ldrsb   x24, [x14, -31]
-    __ ldrsh(r24, Address(r15, -6));                   //       ldrsh   x24, [x15, -6]
-    __ ldrshw(r5, Address(r3, 12));                    //       ldrsh   w5, [x3, 12]
-    __ ldrsw(r27, Address(r24, 17));                   //       ldrsw   x27, [x24, 17]
-    __ ldrd(v13, Address(r29, -35));                   //       ldr     d13, [x29, -35]
-    __ ldrs(v23, Address(r9, -47));                    //       ldr     s23, [x9, -47]
-    __ strd(v11, Address(r0, 9));                      //       str     d11, [x0, 9]
-    __ strs(v21, Address(r0, -127));                   //       str     s21, [x0, -127]
+    __ str(r24, Address(r17, -125));                   //       str     x24, [x17, -125]
+    __ strw(r1, Address(r26, 10));                     //       str     w1, [x26, 10]
+    __ strb(r15, Address(r0, -17));                    //       strb    w15, [x0, -17]
+    __ strh(r17, Address(r17, 13));                    //       strh    w17, [x17, 13]
+    __ ldr(r5, Address(r25, 49));                      //       ldr     x5, [x25, 49]
+    __ ldrw(r19, Address(r15, -116));                  //       ldr     w19, [x15, -116]
+    __ ldrb(r20, Address(r3, 7));                      //       ldrb    w20, [x3, 7]
+    __ ldrh(r19, Address(r4, -25));                    //       ldrh    w19, [x4, -25]
+    __ ldrsb(r14, Address(r19, -6));                   //       ldrsb   x14, [x19, -6]
+    __ ldrsh(r28, Address(r19, -53));                  //       ldrsh   x28, [x19, -53]
+    __ ldrshw(r14, Address(r27, 13));                  //       ldrsh   w14, [x27, 13]
+    __ ldrsw(r6, Address(r24, -120));                  //       ldrsw   x6, [x24, -120]
+    __ ldrd(v18, Address(r2, 87));                     //       ldr     d18, [x2, 87]
+    __ ldrs(v0, Address(r28, -48));                    //       ldr     s0, [x28, -48]
+    __ strd(v31, Address(r28, 23));                    //       str     d31, [x28, 23]
+    __ strs(v11, Address(r25, 43));                    //       str     s11, [x25, 43]
 
 // pre
 // LoadStoreOp
-    __ str(r29, Address(__ pre(r3, -114)));            //       str     x29, [x3, -114]!
-    __ strw(r17, Address(__ pre(r4, -72)));            //       str     w17, [x4, -72]!
-    __ strb(r0, Address(__ pre(r2, -17)));             //       strb    w0, [x2, -17]!
-    __ strh(r29, Address(__ pre(r1, 7)));              //       strh    w29, [x1, 7]!
-    __ ldr(r16, Address(__ pre(r21, -133)));           //       ldr     x16, [x21, -133]!
-    __ ldrw(r20, Address(__ pre(r14, 19)));            //       ldr     w20, [x14, 19]!
-    __ ldrb(r22, Address(__ pre(r14, -3)));            //       ldrb    w22, [x14, -3]!
-    __ ldrh(r15, Address(__ pre(r17, 9)));             //       ldrh    w15, [x17, 9]!
-    __ ldrsb(r10, Address(__ pre(r15, -19)));          //       ldrsb   x10, [x15, -19]!
-    __ ldrsh(r20, Address(__ pre(r12, -25)));          //       ldrsh   x20, [x12, -25]!
-    __ ldrshw(r21, Address(__ pre(r10, -29)));         //       ldrsh   w21, [x10, -29]!
-    __ ldrsw(r19, Address(__ pre(r0, 5)));             //       ldrsw   x19, [x0, 5]!
-    __ ldrd(v0, Address(__ pre(r14, -54)));            //       ldr     d0, [x14, -54]!
-    __ ldrs(v3, Address(__ pre(r1, 40)));              //       ldr     s3, [x1, 40]!
-    __ strd(v4, Address(__ pre(r14, -94)));            //       str     d4, [x14, -94]!
-    __ strs(v18, Address(__ pre(r28, -54)));           //       str     s18, [x28, -54]!
+    __ str(r14, Address(__ pre(r8, -185)));            //       str     x14, [x8, -185]!
+    __ strw(r25, Address(__ pre(r9, -93)));            //       str     w25, [x9, -93]!
+    __ strb(r16, Address(__ pre(r23, -12)));           //       strb    w16, [x23, -12]!
+    __ strh(r22, Address(__ pre(r9, -56)));            //       strh    w22, [x9, -56]!
+    __ ldr(r11, Address(__ pre(r24, 109)));            //       ldr     x11, [x24, 109]!
+    __ ldrw(r21, Address(__ pre(r19, 52)));            //       ldr     w21, [x19, 52]!
+    __ ldrb(r6, Address(__ pre(r23, -2)));             //       ldrb    w6, [x23, -2]!
+    __ ldrh(r7, Address(__ pre(r8, 21)));              //       ldrh    w7, [x8, 21]!
+    __ ldrsb(r4, Address(__ pre(r12, -31)));           //       ldrsb   x4, [x12, -31]!
+    __ ldrsh(r8, Address(__ pre(r11, -4)));            //       ldrsh   x8, [x11, -4]!
+    __ ldrshw(r14, Address(__ pre(r21, -28)));         //       ldrsh   w14, [x21, -28]!
+    __ ldrsw(r0, Address(__ pre(r15, -71)));           //       ldrsw   x0, [x15, -71]!
+    __ ldrd(v27, Address(__ pre(r2, 29)));             //       ldr     d27, [x2, 29]!
+    __ ldrs(v13, Address(__ pre(r21, 16)));            //       ldr     s13, [x21, 16]!
+    __ strd(v12, Address(__ pre(r27, 16)));            //       str     d12, [x27, 16]!
+    __ strs(v2, Address(__ pre(r25, -91)));            //       str     s2, [x25, -91]!
 
 // post
 // LoadStoreOp
-    __ str(r22, Address(__ post(r15, -185)));          //       str     x22, [x15], -185
-    __ strw(r17, Address(__ post(r14, -7)));           //       str     w17, [x14], -7
-    __ strb(r30, Address(__ post(r11, -25)));          //       strb    w30, [x11], -25
-    __ strh(r1, Address(__ post(r11, 20)));            //       strh    w1, [x11], 20
-    __ ldr(r22, Address(__ post(r1, 2)));              //       ldr     x22, [x1], 2
-    __ ldrw(r2, Address(__ post(r23, -119)));          //       ldr     w2, [x23], -119
-    __ ldrb(r3, Address(__ post(r27, -12)));           //       ldrb    w3, [x27], -12
-    __ ldrh(r16, Address(__ post(r7, -37)));           //       ldrh    w16, [x7], -37
-    __ ldrsb(r15, Address(__ post(r26, 3)));           //       ldrsb   x15, [x26], 3
-    __ ldrsh(r7, Address(__ post(r15, -30)));          //       ldrsh   x7, [x15], -30
-    __ ldrshw(r3, Address(__ post(r11, -48)));         //       ldrsh   w3, [x11], -48
-    __ ldrsw(r25, Address(__ post(r23, 22)));          //       ldrsw   x25, [x23], 22
-    __ ldrd(v0, Address(__ post(r10, -215)));          //       ldr     d0, [x10], -215
-    __ ldrs(v19, Address(__ post(r6, 55)));            //       ldr     s19, [x6], 55
-    __ strd(v14, Address(__ post(r21, -234)));         //       str     d14, [x21], -234
-    __ strs(v0, Address(__ post(r22, -70)));           //       str     s0, [x22], -70
+    __ str(r10, Address(__ post(r13, -21)));           //       str     x10, [x13], -21
+    __ strw(r7, Address(__ post(r1, 50)));             //       str     w7, [x1], 50
+    __ strb(r10, Address(__ post(r3, 5)));             //       strb    w10, [x3], 5
+    __ strh(r5, Address(__ post(r6, -33)));            //       strh    w5, [x6], -33
+    __ ldr(r13, Address(__ post(r22, -158)));          //       ldr     x13, [x22], -158
+    __ ldrw(r13, Address(__ post(r2, -106)));          //       ldr     w13, [x2], -106
+    __ ldrb(r13, Address(__ post(r16, -24)));          //       ldrb    w13, [x16], -24
+    __ ldrh(r24, Address(__ post(r2, -22)));           //       ldrh    w24, [x2], -22
+    __ ldrsb(r3, Address(__ post(r23, -1)));           //       ldrsb   x3, [x23], -1
+    __ ldrsh(r19, Address(__ post(r8, -43)));          //       ldrsh   x19, [x8], -43
+    __ ldrshw(r2, Address(__ post(r23, -8)));          //       ldrsh   w2, [x23], -8
+    __ ldrsw(r19, Address(__ post(r28, -87)));         //       ldrsw   x19, [x28], -87
+    __ ldrd(v15, Address(__ post(r3, -81)));           //       ldr     d15, [x3], -81
+    __ ldrs(v12, Address(__ post(r29, -79)));          //       ldr     s12, [x29], -79
+    __ strd(v21, Address(__ post(r1, -124)));          //       str     d21, [x1], -124
+    __ strs(v7, Address(__ post(r9, -99)));            //       str     s7, [x9], -99
 
 // base_plus_reg
 // LoadStoreOp
-    __ str(r27, Address(r19, r0, Address::sxtx(0)));   //       str     x27, [x19, x0, sxtx #0]
-    __ strw(r8, Address(r6, r13, Address::lsl(0)));    //       str     w8, [x6, x13, lsl #0]
-    __ strb(r4, Address(r16, r22, Address::lsl(0)));   //       strb    w4, [x16, x22, lsl #0]
-    __ strh(r25, Address(r26, r15, Address::uxtw(0))); //       strh    w25, [x26, w15, uxtw #0]
-    __ ldr(r4, Address(r5, r24, Address::sxtw(0)));    //       ldr     x4, [x5, w24, sxtw #0]
-    __ ldrw(r4, Address(r17, r7, Address::uxtw(0)));   //       ldr     w4, [x17, w7, uxtw #0]
-    __ ldrb(r17, Address(r7, r11, Address::lsl(0)));   //       ldrb    w17, [x7, x11, lsl #0]
-    __ ldrh(r0, Address(r30, r23, Address::lsl(0)));   //       ldrh    w0, [x30, x23, lsl #0]
-    __ ldrsb(r10, Address(r22, r1, Address::uxtw(0))); //       ldrsb   x10, [x22, w1, uxtw #0]
-    __ ldrsh(r21, Address(r30, r30, Address::sxtw(1))); //      ldrsh   x21, [x30, w30, sxtw #1]
-    __ ldrshw(r11, Address(r10, r28, Address::sxtw(1))); //     ldrsh   w11, [x10, w28, sxtw #1]
-    __ ldrsw(r28, Address(r19, r10, Address::uxtw(0))); //      ldrsw   x28, [x19, w10, uxtw #0]
-    __ ldrd(v30, Address(r29, r14, Address::sxtw(0))); //       ldr     d30, [x29, w14, sxtw #0]
-    __ ldrs(v8, Address(r5, r5, Address::sxtw(2)));    //       ldr     s8, [x5, w5, sxtw #2]
-    __ strd(v25, Address(r8, r13, Address::sxtx(0)));  //       str     d25, [x8, x13, sxtx #0]
-    __ strs(v17, Address(r24, r26, Address::lsl(2)));  //       str     s17, [x24, x26, lsl #2]
+    __ str(r5, Address(r20, r2, Address::lsl(0)));     //       str     x5, [x20, x2, lsl #0]
+    __ strw(r14, Address(r10, r30, Address::sxtw(2))); //       str     w14, [x10, w30, sxtw #2]
+    __ strb(r4, Address(r1, r28, Address::sxtw(0)));   //       strb    w4, [x1, w28, sxtw #0]
+    __ strh(r5, Address(r10, r26, Address::sxtx(1)));  //       strh    w5, [x10, x26, sxtx #1]
+    __ ldr(r22, Address(r2, r28, Address::lsl(3)));    //       ldr     x22, [x2, x28, lsl #3]
+    __ ldrw(r12, Address(r0, r28, Address::lsl(2)));   //       ldr     w12, [x0, x28, lsl #2]
+    __ ldrb(r8, Address(r8, r15, Address::sxtx(0)));   //       ldrb    w8, [x8, x15, sxtx #0]
+    __ ldrh(r17, Address(r21, r14, Address::uxtw(1))); //       ldrh    w17, [x21, w14, uxtw #1]
+    __ ldrsb(r17, Address(r24, r8, Address::sxtx(0))); //       ldrsb   x17, [x24, x8, sxtx #0]
+    __ ldrsh(r10, Address(r10, r30, Address::sxtx(1))); //      ldrsh   x10, [x10, x30, sxtx #1]
+    __ ldrshw(r17, Address(r23, r0, Address::lsl(1))); //       ldrsh   w17, [x23, x0, lsl #1]
+    __ ldrsw(r25, Address(r30, r0, Address::lsl(2)));  //       ldrsw   x25, [x30, x0, lsl #2]
+    __ ldrd(v5, Address(r24, r23, Address::uxtw(3)));  //       ldr     d5, [x24, w23, uxtw #3]
+    __ ldrs(v22, Address(r3, r15, Address::lsl(2)));   //       ldr     s22, [x3, x15, lsl #2]
+    __ strd(v4, Address(r29, r16, Address::sxtx(3)));  //       str     d4, [x29, x16, sxtx #3]
+    __ strs(v7, Address(r20, r28, Address::sxtw(2)));  //       str     s7, [x20, w28, sxtw #2]
 
 // base_plus_scaled_offset
 // LoadStoreOp
-    __ str(r19, Address(r12, 15904));                  //       str     x19, [x12, 15904]
-    __ strw(r23, Address(r15, 7892));                  //       str     w23, [x15, 7892]
-    __ strb(r29, Address(r13, 1970));                  //       strb    w29, [x13, 1970]
-    __ strh(r11, Address(r7, 3094));                   //       strh    w11, [x7, 3094]
-    __ ldr(r10, Address(r24, 14992));                  //       ldr     x10, [x24, 14992]
-    __ ldrw(r16, Address(r0, 6160));                   //       ldr     w16, [x0, 6160]
-    __ ldrb(r20, Address(r1, 2032));                   //       ldrb    w20, [x1, 2032]
-    __ ldrh(r1, Address(r17, 4056));                   //       ldrh    w1, [x17, 4056]
-    __ ldrsb(r17, Address(r25, 1889));                 //       ldrsb   x17, [x25, 1889]
-    __ ldrsh(r27, Address(r25, 3964));                 //       ldrsh   x27, [x25, 3964]
-    __ ldrshw(r14, Address(r17, 3724));                //       ldrsh   w14, [x17, 3724]
-    __ ldrsw(r10, Address(r7, 6372));                  //       ldrsw   x10, [x7, 6372]
-    __ ldrd(v3, Address(r25, 12392));                  //       ldr     d3, [x25, 12392]
-    __ ldrs(v12, Address(r9, 7840));                   //       ldr     s12, [x9, 7840]
-    __ strd(v24, Address(r1, 12728));                  //       str     d24, [x1, 12728]
-    __ strs(v3, Address(r20, 6924));                   //       str     s3, [x20, 6924]
+    __ str(r27, Address(r0, 16360));                   //       str     x27, [x0, 16360]
+    __ strw(r21, Address(r8, 7984));                   //       str     w21, [x8, 7984]
+    __ strb(r17, Address(r29, 1795));                  //       strb    w17, [x29, 1795]
+    __ strh(r27, Address(r2, 3636));                   //       strh    w27, [x2, 3636]
+    __ ldr(r1, Address(r1, 12480));                    //       ldr     x1, [x1, 12480]
+    __ ldrw(r29, Address(r17, 6320));                  //       ldr     w29, [x17, 6320]
+    __ ldrb(r1, Address(r9, 1634));                    //       ldrb    w1, [x9, 1634]
+    __ ldrh(r23, Address(r3, 3736));                   //       ldrh    w23, [x3, 3736]
+    __ ldrsb(r21, Address(r19, 1857));                 //       ldrsb   x21, [x19, 1857]
+    __ ldrsh(r19, Address(r7, 3180));                  //       ldrsh   x19, [x7, 3180]
+    __ ldrshw(r10, Address(r1, 3560));                 //       ldrsh   w10, [x1, 3560]
+    __ ldrsw(r10, Address(r20, 7428));                 //       ldrsw   x10, [x20, 7428]
+    __ ldrd(v0, Address(r13, 14880));                  //       ldr     d0, [x13, 14880]
+    __ ldrs(v11, Address(r27, 6356));                  //       ldr     s11, [x27, 6356]
+    __ strd(v13, Address(r25, 13704));                 //       str     d13, [x25, 13704]
+    __ strs(v20, Address(r0, 7580));                   //       str     s20, [x0, 7580]
 
 // pcrel
 // LoadStoreOp
-    __ ldr(r2, back);                                  //       ldr     x2, back
-    __ ldrw(r29, __ pc());                             //       ldr     w29, .
+    __ ldr(r26, __ pc());                              //       ldr     x26, .
+    __ ldrw(r19, back);                                //       ldr     w19, back
 
 // LoadStoreOp
-    __ prfm(Address(r14, 93));                         //       prfm    PLDL1KEEP, [x14, 93]
+    __ prfm(Address(r8, -111));                        //       prfm    PLDL1KEEP, [x8, -111]
 
 // LoadStoreOp
-    __ prfm(back);                                     //       prfm    PLDL1KEEP, back
+    __ prfm(forth);                                    //       prfm    PLDL1KEEP, forth
 
 // LoadStoreOp
-    __ prfm(Address(r1, r7, Address::lsl(3)));         //       prfm    PLDL1KEEP, [x1, x7, lsl #3]
+    __ prfm(Address(r7, r7, Address::uxtw(3)));        //       prfm    PLDL1KEEP, [x7, w7, uxtw #3]
 
 // LoadStoreOp
-    __ prfm(Address(r17, 12288));                      //       prfm    PLDL1KEEP, [x17, 12288]
+    __ prfm(Address(r12, 12600));                      //       prfm    PLDL1KEEP, [x12, 12600]
 
 // AddSubCarryOp
-    __ adcw(r1, r24, r3);                              //       adc     w1, w24, w3
-    __ adcsw(r17, r24, r20);                           //       adcs    w17, w24, w20
-    __ sbcw(r11, r0, r13);                             //       sbc     w11, w0, w13
-    __ sbcsw(r28, r10, r7);                            //       sbcs    w28, w10, w7
-    __ adc(r4, r15, r16);                              //       adc     x4, x15, x16
-    __ adcs(r2, r12, r20);                             //       adcs    x2, x12, x20
-    __ sbc(r29, r13, r13);                             //       sbc     x29, x13, x13
-    __ sbcs(r14, r6, r12);                             //       sbcs    x14, x6, x12
+    __ adcw(r24, r20, r11);                            //       adc     w24, w20, w11
+    __ adcsw(r0, r13, r28);                            //       adcs    w0, w13, w28
+    __ sbcw(r10, r7, r4);                              //       sbc     w10, w7, w4
+    __ sbcsw(r15, r16, r2);                            //       sbcs    w15, w16, w2
+    __ adc(r12, r20, r29);                             //       adc     x12, x20, x29
+    __ adcs(r13, r13, r14);                            //       adcs    x13, x13, x14
+    __ sbc(r6, r12, r20);                              //       sbc     x6, x12, x20
+    __ sbcs(r12, r17, r25);                            //       sbcs    x12, x17, x25
 
 // AddSubExtendedOp
-    __ addw(r20, r12, r17, ext::sxtx, 4);              //       add     w20, w12, w17, sxtx #4
-    __ addsw(r27, r11, r0, ext::uxtx, 3);              //       adds    w27, w11, w0, uxtx #3
-    __ sub(r7, r1, r9, ext::sxtx, 4);                  //       sub     x7, x1, x9, sxtx #4
-    __ subsw(r3, r27, r1, ext::uxtb, 3);               //       subs    w3, w27, w1, uxtb #3
-    __ add(r13, r26, r12, ext::sxth, 4);               //       add     x13, x26, x12, sxth #4
-    __ adds(r17, r5, r10, ext::sxtb, 2);               //       adds    x17, x5, x10, sxtb #2
-    __ sub(r30, r8, r15, ext::uxtw, 4);                //       sub     x30, x8, x15, uxtw #4
-    __ subs(r19, r23, r19, ext::uxth, 4);              //       subs    x19, x23, x19, uxth #4
+    __ addw(r30, r27, r11, ext::sxtb, 1);              //       add     w30, w27, w11, sxtb #1
+    __ addsw(r14, r7, r1, ext::sxtw, 2);               //       adds    w14, w7, w1, sxtw #2
+    __ sub(r29, r3, r27, ext::sxth, 1);                //       sub     x29, x3, x27, sxth #1
+    __ subsw(r0, r13, r26, ext::sxtx, 2);              //       subs    w0, w13, w26, sxtx #2
+    __ add(r22, r17, r5, ext::uxtx, 2);                //       add     x22, x17, x5, uxtx #2
+    __ adds(r17, r30, r8, ext::sxtx, 3);               //       adds    x17, x30, x8, sxtx #3
+    __ sub(r10, r19, r23, ext::sxtw, 3);               //       sub     x10, x19, x23, sxtw #3
+    __ subs(r6, r29, r5, ext::uxtw, 3);                //       subs    x6, x29, x5, uxtw #3
 
 // ConditionalCompareOp
-    __ ccmnw(r29, r5, 10u, Assembler::LO);             //       ccmn    w29, w5, #10, LO
-    __ ccmpw(r9, r13, 11u, Assembler::LO);             //       ccmp    w9, w13, #11, LO
-    __ ccmn(r10, r4, 6u, Assembler::HS);               //       ccmn    x10, x4, #6, HS
-    __ ccmp(r12, r2, 12u, Assembler::HI);              //       ccmp    x12, x2, #12, HI
+    __ ccmnw(r19, r9, 4u, Assembler::HI);              //       ccmn    w19, w9, #4, HI
+    __ ccmpw(r22, r10, 2u, Assembler::VC);             //       ccmp    w22, w10, #2, VC
+    __ ccmn(r13, r12, 10u, Assembler::LS);             //       ccmn    x13, x12, #10, LS
+    __ ccmp(r24, r16, 3u, Assembler::HS);              //       ccmp    x24, x16, #3, HS
 
 // ConditionalCompareImmedOp
-    __ ccmnw(r16, 6, 2, Assembler::VS);                //       ccmn    w16, #6, #2, VS
-    __ ccmpw(r7, 11, 13, Assembler::VS);               //       ccmp    w7, #11, #13, VS
-    __ ccmn(r27, 10, 11, Assembler::LS);               //       ccmn    x27, #10, #11, LS
-    __ ccmp(r3, 13, 13, Assembler::LE);                //       ccmp    x3, #13, #13, LE
+    __ ccmnw(r7, 11, 13, Assembler::VS);               //       ccmn    w7, #11, #13, VS
+    __ ccmpw(r27, 10, 11, Assembler::LS);              //       ccmp    w27, #10, #11, LS
+    __ ccmn(r3, 13, 13, Assembler::LE);                //       ccmn    x3, #13, #13, LE
+    __ ccmp(r26, 16, 5, Assembler::GT);                //       ccmp    x26, #16, #5, GT
 
 // ConditionalSelectOp
-    __ cselw(r26, r27, r10, Assembler::VS);            //       csel    w26, w27, w10, VS
-    __ csincw(r10, r21, r28, Assembler::LE);           //       csinc   w10, w21, w28, LE
-    __ csinvw(r23, r9, r27, Assembler::LE);            //       csinv   w23, w9, w27, LE
-    __ csnegw(r10, r29, r15, Assembler::LE);           //       csneg   w10, w29, w15, LE
-    __ csel(r30, r25, r21, Assembler::HS);             //       csel    x30, x25, x21, HS
-    __ csinc(r0, r17, r21, Assembler::GT);             //       csinc   x0, x17, x21, GT
-    __ csinv(r16, r21, r20, Assembler::CS);            //       csinv   x16, x21, x20, CS
-    __ csneg(r19, r30, r3, Assembler::LS);             //       csneg   x19, x30, x3, LS
+    __ cselw(r10, r21, r28, Assembler::LE);            //       csel    w10, w21, w28, LE
+    __ csincw(r23, r9, r27, Assembler::LE);            //       csinc   w23, w9, w27, LE
+    __ csinvw(r10, r29, r15, Assembler::LE);           //       csinv   w10, w29, w15, LE
+    __ csnegw(r30, r25, r21, Assembler::HS);           //       csneg   w30, w25, w21, HS
+    __ csel(r0, r17, r21, Assembler::GT);              //       csel    x0, x17, x21, GT
+    __ csinc(r16, r21, r20, Assembler::CS);            //       csinc   x16, x21, x20, CS
+    __ csinv(r19, r30, r3, Assembler::LS);             //       csinv   x19, x30, x3, LS
+    __ csneg(r19, r11, r24, Assembler::EQ);            //       csneg   x19, x11, x24, EQ
 
 // TwoRegOp
-    __ rbitw(r19, r11);                                //       rbit    w19, w11
-    __ rev16w(r24, r0);                                //       rev16   w24, w0
-    __ revw(r27, r25);                                 //       rev     w27, w25
-    __ clzw(r14, r3);                                  //       clz     w14, w3
-    __ clsw(r14, r17);                                 //       cls     w14, w17
-    __ rbit(r7, r15);                                  //       rbit    x7, x15
-    __ rev16(r24, r28);                                //       rev16   x24, x28
-    __ rev32(r17, r25);                                //       rev32   x17, x25
-    __ rev(r2, r26);                                   //       rev     x2, x26
-    __ clz(r28, r5);                                   //       clz     x28, x5
-    __ cls(r25, r26);                                  //       cls     x25, x26
-    __ pacia(r27, r16);                                //       pacia   x27, x16
-    __ pacib(r17, r6);                                 //       pacib   x17, x6
-    __ pacda(r21, r12);                                //       pacda   x21, x12
-    __ pacdb(r0, r4);                                  //       pacdb   x0, x4
-    __ autia(r12, r27);                                //       autia   x12, x27
-    __ autib(r17, r28);                                //       autib   x17, x28
-    __ autda(r28, r2);                                 //       autda   x28, x2
-    __ autdb(r17, r10);                                //       autdb   x17, x10
-    __ braa(r15, r14);                                 //       braa    x15, x14
-    __ brab(r14, r3);                                  //       brab    x14, x3
-    __ blraa(r25, r15);                                //       blraa   x25, x15
-    __ blrab(r19, r14);                                //       blrab   x19, x14
+    __ rbitw(r27, r25);                                //       rbit    w27, w25
+    __ rev16w(r14, r3);                                //       rev16   w14, w3
+    __ revw(r14, r17);                                 //       rev     w14, w17
+    __ clzw(r7, r15);                                  //       clz     w7, w15
+    __ clsw(r24, r28);                                 //       cls     w24, w28
+    __ rbit(r17, r25);                                 //       rbit    x17, x25
+    __ rev16(r2, r26);                                 //       rev16   x2, x26
+    __ rev32(r28, r5);                                 //       rev32   x28, x5
+    __ rev(r25, r26);                                  //       rev     x25, x26
+    __ clz(r27, r16);                                  //       clz     x27, x16
+    __ cls(r17, r6);                                   //       cls     x17, x6
+    __ pacia(r21, r12);                                //       pacia   x21, x12
+    __ pacib(r0, r4);                                  //       pacib   x0, x4
+    __ pacda(r12, r27);                                //       pacda   x12, x27
+    __ pacdb(r17, r28);                                //       pacdb   x17, x28
+    __ autia(r28, r2);                                 //       autia   x28, x2
+    __ autib(r17, r10);                                //       autib   x17, x10
+    __ autda(r15, r14);                                //       autda   x15, x14
+    __ autdb(r14, r3);                                 //       autdb   x14, x3
+    __ braa(r25, r15);                                 //       braa    x25, x15
+    __ brab(r19, r14);                                 //       brab    x19, x14
+    __ blraa(r5, r16);                                 //       blraa   x5, x16
+    __ blrab(r4, r26);                                 //       blrab   x4, x26
 
 // ThreeRegOp
-    __ udivw(r5, r16, r4);                             //       udiv    w5, w16, w4
-    __ sdivw(r26, r25, r4);                            //       sdiv    w26, w25, w4
-    __ lslvw(r2, r2, r12);                             //       lslv    w2, w2, w12
-    __ lsrvw(r29, r17, r8);                            //       lsrv    w29, w17, w8
-    __ asrvw(r7, r3, r4);                              //       asrv    w7, w3, w4
-    __ rorvw(r25, r4, r26);                            //       rorv    w25, w4, w26
-    __ udiv(r25, r4, r17);                             //       udiv    x25, x4, x17
-    __ sdiv(r0, r26, r17);                             //       sdiv    x0, x26, x17
-    __ lslv(r23, r15, r21);                            //       lslv    x23, x15, x21
-    __ lsrv(r28, r17, r27);                            //       lsrv    x28, x17, x27
-    __ asrv(r10, r3, r0);                              //       asrv    x10, x3, x0
-    __ rorv(r7, r25, r9);                              //       rorv    x7, x25, x9
-    __ umulh(r6, r15, r29);                            //       umulh   x6, x15, x29
-    __ smulh(r15, r10, r2);                            //       smulh   x15, x10, x2
+    __ udivw(r25, r4, r2);                             //       udiv    w25, w4, w2
+    __ sdivw(r2, r12, r29);                            //       sdiv    w2, w12, w29
+    __ lslvw(r17, r8, r7);                             //       lslv    w17, w8, w7
+    __ lsrvw(r3, r4, r25);                             //       lsrv    w3, w4, w25
+    __ asrvw(r4, r26, r25);                            //       asrv    w4, w26, w25
+    __ rorvw(r4, r17, r0);                             //       rorv    w4, w17, w0
+    __ udiv(r26, r17, r23);                            //       udiv    x26, x17, x23
+    __ sdiv(r15, r21, r28);                            //       sdiv    x15, x21, x28
+    __ lslv(r17, r27, r10);                            //       lslv    x17, x27, x10
+    __ lsrv(r3, r0, r7);                               //       lsrv    x3, x0, x7
+    __ asrv(r25, r9, r6);                              //       asrv    x25, x9, x6
+    __ rorv(r15, r29, r15);                            //       rorv    x15, x29, x15
+    __ umulh(r10, r2, r17);                            //       umulh   x10, x2, x17
+    __ smulh(r7, r11, r11);                            //       smulh   x7, x11, x11
 
 // FourRegMulOp
-    __ maddw(r17, r7, r11, r11);                       //       madd    w17, w7, w11, w11
-    __ msubw(r23, r7, r29, r23);                       //       msub    w23, w7, w29, w23
-    __ madd(r14, r27, r11, r11);                       //       madd    x14, x27, x11, x11
-    __ msub(r4, r24, r12, r15);                        //       msub    x4, x24, x12, x15
-    __ smaddl(r14, r20, r11, r28);                     //       smaddl  x14, w20, w11, x28
-    __ smsubl(r13, r11, r12, r23);                     //       smsubl  x13, w11, w12, x23
-    __ umaddl(r30, r26, r14, r9);                      //       umaddl  x30, w26, w14, x9
-    __ umsubl(r13, r10, r7, r5);                       //       umsubl  x13, w10, w7, x5
+    __ maddw(r23, r7, r29, r23);                       //       madd    w23, w7, w29, w23
+    __ msubw(r14, r27, r11, r11);                      //       msub    w14, w27, w11, w11
+    __ madd(r4, r24, r12, r15);                        //       madd    x4, x24, x12, x15
+    __ msub(r14, r20, r11, r28);                       //       msub    x14, x20, x11, x28
+    __ smaddl(r13, r11, r12, r23);                     //       smaddl  x13, w11, w12, x23
+    __ smsubl(r30, r26, r14, r9);                      //       smsubl  x30, w26, w14, x9
+    __ umaddl(r13, r10, r7, r5);                       //       umaddl  x13, w10, w7, x5
+    __ umsubl(r29, r15, r3, r11);                      //       umsubl  x29, w15, w3, x11
 
 // ThreeRegFloatOp
-    __ fabdh(v30, v15, v3);                            //       fabd    h30, h15, h3
-    __ fmulh(v12, v12, v16);                           //       fmul    h12, h12, h16
-    __ fdivh(v31, v31, v18);                           //       fdiv    h31, h31, h18
-    __ faddh(v19, v21, v16);                           //       fadd    h19, h21, h16
-    __ fsubh(v15, v10, v21);                           //       fsub    h15, h10, h21
-    __ fmaxh(v2, v10, v28);                            //       fmax    h2, h10, h28
-    __ fminh(v7, v30, v31);                            //       fmin    h7, h30, h31
-    __ fnmulh(v18, v1, v2);                            //       fnmul   h18, h1, h2
-    __ fabds(v6, v10, v3);                             //       fabd    s6, s10, s3
-    __ fmuls(v25, v11, v7);                            //       fmul    s25, s11, s7
-    __ fdivs(v1, v12, v0);                             //       fdiv    s1, s12, s0
-    __ fadds(v3, v19, v29);                            //       fadd    s3, s19, s29
-    __ fsubs(v6, v23, v6);                             //       fsub    s6, s23, s6
-    __ fmaxs(v0, v28, v27);                            //       fmax    s0, s28, s27
-    __ fmins(v2, v5, v7);                              //       fmin    s2, s5, s7
-    __ fnmuls(v29, v12, v25);                          //       fnmul   s29, s12, s25
-    __ fabdd(v13, v12, v24);                           //       fabd    d13, d12, d24
-    __ fmuld(v19, v8, v18);                            //       fmul    d19, d8, d18
-    __ fdivd(v22, v26, v21);                           //       fdiv    d22, d26, d21
-    __ faddd(v20, v19, v2);                            //       fadd    d20, d19, d2
-    __ fsubd(v30, v22, v8);                            //       fsub    d30, d22, d8
-    __ fmaxd(v22, v19, v21);                           //       fmax    d22, d19, d21
-    __ fmind(v12, v18, v21);                           //       fmin    d12, d18, d21
-    __ fnmuld(v6, v16, v3);                            //       fnmul   d6, d16, d3
+    __ fabdh(v12, v16, v31);                           //       fabd    h12, h16, h31
+    __ fmulh(v31, v18, v19);                           //       fmul    h31, h18, h19
+    __ fdivh(v21, v16, v15);                           //       fdiv    h21, h16, h15
+    __ faddh(v10, v21, v2);                            //       fadd    h10, h21, h2
+    __ fsubh(v10, v28, v7);                            //       fsub    h10, h28, h7
+    __ fmaxh(v30, v31, v18);                           //       fmax    h30, h31, h18
+    __ fminh(v1, v2, v6);                              //       fmin    h1, h2, h6
+    __ fnmulh(v10, v3, v25);                           //       fnmul   h10, h3, h25
+    __ fabds(v11, v7, v1);                             //       fabd    s11, s7, s1
+    __ fmuls(v12, v0, v3);                             //       fmul    s12, s0, s3
+    __ fdivs(v19, v29, v6);                            //       fdiv    s19, s29, s6
+    __ fadds(v23, v6, v0);                             //       fadd    s23, s6, s0
+    __ fsubs(v28, v27, v2);                            //       fsub    s28, s27, s2
+    __ fmaxs(v5, v7, v29);                             //       fmax    s5, s7, s29
+    __ fmins(v12, v25, v13);                           //       fmin    s12, s25, s13
+    __ fnmuls(v12, v24, v19);                          //       fnmul   s12, s24, s19
+    __ fabdd(v8, v18, v22);                            //       fabd    d8, d18, d22
+    __ fmuld(v26, v21, v20);                           //       fmul    d26, d21, d20
+    __ fdivd(v19, v2, v30);                            //       fdiv    d19, d2, d30
+    __ faddd(v22, v8, v22);                            //       fadd    d22, d8, d22
+    __ fsubd(v19, v21, v12);                           //       fsub    d19, d21, d12
+    __ fmaxd(v18, v21, v6);                            //       fmax    d18, d21, d6
+    __ fmind(v16, v3, v3);                             //       fmin    d16, d3, d3
+    __ fnmuld(v29, v3, v28);                           //       fnmul   d29, d3, d28
 
 // FourRegFloatOp
-    __ fmaddh(v3, v29, v3, v28);                       //       fmadd   h3, h29, h3, h28
-    __ fmadds(v15, v14, v10, v13);                     //       fmadd   s15, s14, s10, s13
-    __ fmsubs(v12, v18, v10, v26);                     //       fmsub   s12, s18, s10, s26
-    __ fnmadds(v7, v7, v15, v29);                      //       fnmadd  s7, s7, s15, s29
+    __ fmaddh(v15, v14, v10, v13);                     //       fmadd   h15, h14, h10, h13
+    __ fmadds(v12, v18, v10, v26);                     //       fmadd   s12, s18, s10, s26
+    __ fmsubs(v7, v7, v15, v29);                       //       fmsub   s7, s7, s15, s29
     __ fnmadds(v0, v23, v0, v12);                      //       fnmadd  s0, s23, s0, s12
-    __ fmaddd(v24, v14, v13, v8);                      //       fmadd   d24, d14, d13, d8
-    __ fmsubd(v15, v7, v9, v20);                       //       fmsub   d15, d7, d9, d20
-    __ fnmaddd(v19, v29, v31, v16);                    //       fnmadd  d19, d29, d31, d16
+    __ fnmadds(v24, v14, v13, v8);                     //       fnmadd  s24, s14, s13, s8
+    __ fmaddd(v15, v7, v9, v20);                       //       fmadd   d15, d7, d9, d20
+    __ fmsubd(v19, v29, v31, v16);                     //       fmsub   d19, d29, d31, d16
     __ fnmaddd(v2, v9, v16, v21);                      //       fnmadd  d2, d9, d16, d21
+    __ fnmaddd(v30, v4, v1, v27);                      //       fnmadd  d30, d4, d1, d27
 
 // TwoRegFloatOp
-    __ fmovs(v30, v4);                                 //       fmov    s30, s4
-    __ fabss(v1, v27);                                 //       fabs    s1, s27
-    __ fnegs(v25, v24);                                //       fneg    s25, s24
-    __ fsqrts(v14, v21);                               //       fsqrt   s14, s21
-    __ fcvts(v13, v6);                                 //       fcvt    d13, s6
-    __ fcvtsh(v12, v25);                               //       fcvt    h12, s25
-    __ fcvths(v25, v30);                               //       fcvt    s25, h30
-    __ fmovd(v28, v21);                                //       fmov    d28, d21
-    __ fabsd(v16, v23);                                //       fabs    d16, d23
-    __ fnegd(v5, v29);                                 //       fneg    d5, d29
-    __ fsqrtd(v22, v19);                               //       fsqrt   d22, d19
-    __ fcvtd(v13, v20);                                //       fcvt    s13, d20
-    __ fsqrth(v19, v28);                               //       fsqrt   h19, h28
+    __ fmovs(v25, v24);                                //       fmov    s25, s24
+    __ fabss(v14, v21);                                //       fabs    s14, s21
+    __ fnegs(v13, v6);                                 //       fneg    s13, s6
+    __ fsqrts(v12, v25);                               //       fsqrt   s12, s25
+    __ fcvts(v25, v30);                                //       fcvt    d25, s30
+    __ fcvtsh(v28, v21);                               //       fcvt    h28, s21
+    __ fcvths(v16, v23);                               //       fcvt    s16, h23
+    __ fmovd(v5, v29);                                 //       fmov    d5, d29
+    __ fabsd(v22, v19);                                //       fabs    d22, d19
+    __ fnegd(v13, v20);                                //       fneg    d13, d20
+    __ fsqrtd(v19, v28);                               //       fsqrt   d19, d28
+    __ fcvtd(v18, v6);                                 //       fcvt    s18, d6
+    __ fsqrth(v14, v7);                                //       fsqrt   h14, h7
 
 // FloatConvertOp
-    __ fcvtzsw(r17, v6);                               //       fcvtzs  w17, s6
-    __ fcvtzs(r13, v7);                                //       fcvtzs  x13, s7
-    __ fcvtzdw(r28, v26);                              //       fcvtzs  w28, d26
-    __ fcvtzd(r17, v6);                                //       fcvtzs  x17, d6
-    __ scvtfws(v1, r4);                                //       scvtf   s1, w4
-    __ scvtfs(v14, r20);                               //       scvtf   s14, x20
-    __ scvtfwd(v7, r21);                               //       scvtf   d7, w21
-    __ scvtfd(v27, r23);                               //       scvtf   d27, x23
-    __ fcvtassw(r13, v20);                             //       fcvtas  w13, s20
-    __ fcvtasd(r30, v28);                              //       fcvtas  x30, d28
-    __ fcvtmssw(r10, v21);                             //       fcvtms  w10, s21
-    __ fcvtmsd(r5, v17);                               //       fcvtms  x5, d17
-    __ fmovs(r11, v14);                                //       fmov    w11, s14
-    __ fmovd(r13, v21);                                //       fmov    x13, d21
-    __ fmovs(v27, r14);                                //       fmov    s27, w14
-    __ fmovd(v4, r23);                                 //       fmov    d4, x23
+    __ fcvtzsw(r28, v26);                              //       fcvtzs  w28, s26
+    __ fcvtzs(r17, v6);                                //       fcvtzs  x17, s6
+    __ fcvtzdw(r1, v4);                                //       fcvtzs  w1, d4
+    __ fcvtzd(r13, v21);                               //       fcvtzs  x13, d21
+    __ scvtfws(v7, r21);                               //       scvtf   s7, w21
+    __ scvtfs(v27, r23);                               //       scvtf   s27, x23
+    __ scvtfwd(v13, r20);                              //       scvtf   d13, w20
+    __ scvtfd(v31, r27);                               //       scvtf   d31, x27
+    __ fcvtassw(r10, v21);                             //       fcvtas  w10, s21
+    __ fcvtasd(r5, v17);                               //       fcvtas  x5, d17
+    __ fcvtmssw(r11, v14);                             //       fcvtms  w11, s14
+    __ fcvtmsd(r13, v21);                              //       fcvtms  x13, d21
+    __ fmovs(r26, v14);                                //       fmov    w26, s14
+    __ fmovd(r4, v24);                                 //       fmov    x4, d24
+    __ fmovs(v24, r29);                                //       fmov    s24, w29
+    __ fmovd(v12, r14);                                //       fmov    d12, x14
 
 // TwoRegFloatOp
-    __ fcmps(v24, v30);                                //       fcmp    s24, s30
-    __ fcmpd(v12, v14);                                //       fcmp    d12, d14
-    __ fcmps(v17, 0.0);                                //       fcmp    s17, #0.0
-    __ fcmpd(v28, 0.0);                                //       fcmp    d28, #0.0
+    __ fcmps(v17, v28);                                //       fcmp    s17, s28
+    __ fcmpd(v22, v0);                                 //       fcmp    d22, d0
+    __ fcmps(v6, 0.0);                                 //       fcmp    s6, #0.0
+    __ fcmpd(v27, 0.0);                                //       fcmp    d27, #0.0
 
 // LoadStorePairOp
-    __ stpw(r0, r6, Address(r26, 16));                 //       stp     w0, w6, [x26, #16]
-    __ ldpw(r0, r30, Address(r6, -32));                //       ldp     w0, w30, [x6, #-32]
-    __ ldpsw(r16, r2, Address(r11, -208));             //       ldpsw   x16, x2, [x11, #-208]
-    __ stp(r15, r0, Address(r12, 128));                //       stp     x15, x0, [x12, #128]
-    __ ldp(r7, r30, Address(r23, 32));                 //       ldp     x7, x30, [x23, #32]
+    __ stpw(r27, r12, Address(r6, -32));               //       stp     w27, w12, [x6, #-32]
+    __ ldpw(r14, r11, Address(r19, -256));             //       ldp     w14, w11, [x19, #-256]
+    __ ldpsw(r0, r12, Address(r15, -48));              //       ldpsw   x0, x12, [x15, #-48]
+    __ stp(r9, r23, Address(r23, 32));                 //       stp     x9, x23, [x23, #32]
+    __ ldp(r15, r4, Address(r26, -176));               //       ldp     x15, x4, [x26, #-176]
 
 // LoadStorePairOp
-    __ stpw(r26, r15, Address(__ pre(r7, -256)));      //       stp     w26, w15, [x7, #-256]!
-    __ ldpw(r11, r15, Address(__ pre(r10, -32)));      //       ldp     w11, w15, [x10, #-32]!
-    __ ldpsw(r19, r16, Address(__ pre(r1, 64)));       //       ldpsw   x19, x16, [x1, #64]!
-    __ stp(r14, r9, Address(__ pre(r0, 128)));         //       stp     x14, x9, [x0, #128]!
-    __ ldp(r27, r3, Address(__ pre(r12, -96)));        //       ldp     x27, x3, [x12, #-96]!
+    __ stpw(r17, r8, Address(__ pre(r6, -160)));       //       stp     w17, w8, [x6, #-160]!
+    __ ldpw(r7, r2, Address(__ pre(r4, -112)));        //       ldp     w7, w2, [x4, #-112]!
+    __ ldpsw(r14, r9, Address(__ pre(r22, -16)));      //       ldpsw   x14, x9, [x22, #-16]!
+    __ stp(r13, r20, Address(__ pre(r24, -256)));      //       stp     x13, x20, [x24, #-256]!
+    __ ldp(r8, r11, Address(__ pre(r10, 96)));         //       ldp     x8, x11, [x10, #96]!
 
 // LoadStorePairOp
-    __ stpw(r8, r11, Address(__ post(r12, -256)));     //       stp     w8, w11, [x12], #-256
-    __ ldpw(r10, r16, Address(__ post(r4, 64)));       //       ldp     w10, w16, [x4], #64
-    __ ldpsw(r10, r30, Address(__ post(r19, -64)));    //       ldpsw   x10, x30, [x19], #-64
-    __ stp(r24, r2, Address(__ post(r15, -96)));       //       stp     x24, x2, [x15], #-96
-    __ ldp(r24, r10, Address(__ post(r16, 80)));       //       ldp     x24, x10, [x16], #80
+    __ stpw(r24, r5, Address(__ post(r16, -112)));     //       stp     w24, w5, [x16], #-112
+    __ ldpw(r0, r26, Address(__ post(r9, -128)));      //       ldp     w0, w26, [x9], #-128
+    __ ldpsw(r24, r2, Address(__ post(r17, -128)));    //       ldpsw   x24, x2, [x17], #-128
+    __ stp(r26, r17, Address(__ post(r14, -48)));      //       stp     x26, x17, [x14], #-48
+    __ ldp(r30, r21, Address(__ post(r29, 48)));       //       ldp     x30, x21, [x29], #48
 
 // LoadStorePairOp
-    __ stnpw(r30, r21, Address(r29, 16));              //       stnp    w30, w21, [x29, #16]
-    __ ldnpw(r8, r30, Address(r10, -112));             //       ldnp    w8, w30, [x10, #-112]
-    __ stnp(r30, r26, Address(r6, -128));              //       stnp    x30, x26, [x6, #-128]
-    __ ldnp(r24, r2, Address(r20, 64));                //       ldnp    x24, x2, [x20, #64]
+    __ stnpw(r17, r23, Address(r10, -112));            //       stnp    w17, w23, [x10, #-112]
+    __ ldnpw(r26, r6, Address(r30, -160));             //       ldnp    w26, w6, [x30, #-160]
+    __ stnp(r30, r8, Address(r20, 64));                //       stnp    x30, x8, [x20, #64]
+    __ ldnp(r22, r29, Address(r9, 48));                //       ldnp    x22, x29, [x9, #48]
 
 // LdStNEONOp
-    __ ld1(v31, __ T8B, Address(r25));                 //       ld1     {v31.8B}, [x25]
-    __ ld1(v5, v6, __ T16B, Address(__ post(r15, 32))); //      ld1     {v5.16B, v6.16B}, [x15], 32
-    __ ld1(v10, v11, v12, __ T1D, Address(__ post(r7, r13))); //        ld1     {v10.1D, v11.1D, v12.1D}, [x7], x13
-    __ ld1(v13, v14, v15, v16, __ T8H, Address(__ post(r16, 64))); //   ld1     {v13.8H, v14.8H, v15.8H, v16.8H}, [x16], 64
-    __ ld1r(v7, __ T8B, Address(r17));                 //       ld1r    {v7.8B}, [x17]
-    __ ld1r(v16, __ T4S, Address(__ post(r25, 4)));    //       ld1r    {v16.4S}, [x25], 4
-    __ ld1r(v11, __ T1D, Address(__ post(r3, r7)));    //       ld1r    {v11.1D}, [x3], x7
-    __ ld2(v13, v14, __ T2D, Address(r7));             //       ld2     {v13.2D, v14.2D}, [x7]
-    __ ld2(v9, v10, __ T4H, Address(__ post(r27, 16))); //      ld2     {v9.4H, v10.4H}, [x27], 16
-    __ ld2r(v6, v7, __ T16B, Address(r26));            //       ld2r    {v6.16B, v7.16B}, [x26]
-    __ ld2r(v23, v24, __ T2S, Address(__ post(r16, 8))); //     ld2r    {v23.2S, v24.2S}, [x16], 8
-    __ ld2r(v6, v7, __ T2D, Address(__ post(r13, r8))); //      ld2r    {v6.2D, v7.2D}, [x13], x8
-    __ ld3(v20, v21, v22, __ T4S, Address(__ post(r1, r26))); //        ld3     {v20.4S, v21.4S, v22.4S}, [x1], x26
-    __ ld3(v15, v16, v17, __ T2S, Address(r15));       //       ld3     {v15.2S, v16.2S, v17.2S}, [x15]
-    __ ld3r(v29, v30, v31, __ T8H, Address(r22));      //       ld3r    {v29.8H, v30.8H, v31.8H}, [x22]
-    __ ld3r(v6, v7, v8, __ T4S, Address(__ post(r10, 12))); //  ld3r    {v6.4S, v7.4S, v8.4S}, [x10], 12
-    __ ld3r(v15, v16, v17, __ T1D, Address(__ post(r6, r15))); //       ld3r    {v15.1D, v16.1D, v17.1D}, [x6], x15
-    __ ld4(v6, v7, v8, v9, __ T8H, Address(__ post(r10, 64))); //       ld4     {v6.8H, v7.8H, v8.8H, v9.8H}, [x10], 64
-    __ ld4(v11, v12, v13, v14, __ T8B, Address(__ post(r3, r7))); //    ld4     {v11.8B, v12.8B, v13.8B, v14.8B}, [x3], x7
-    __ ld4r(v12, v13, v14, v15, __ T8B, Address(r25)); //       ld4r    {v12.8B, v13.8B, v14.8B, v15.8B}, [x25]
-    __ ld4r(v11, v12, v13, v14, __ T4H, Address(__ post(r15, 8))); //   ld4r    {v11.4H, v12.4H, v13.4H, v14.4H}, [x15], 8
-    __ ld4r(v30, v31, v0, v1, __ T2S, Address(__ post(r6, r28))); //    ld4r    {v30.2S, v31.2S, v0.2S, v1.2S}, [x6], x28
+    __ ld1(v13, __ T8B, Address(r1));                  //       ld1     {v13.8B}, [x1]
+    __ ld1(v1, v2, __ T16B, Address(__ post(r16, 32))); //      ld1     {v1.16B, v2.16B}, [x16], 32
+    __ ld1(v22, v23, v24, __ T1D, Address(__ post(r25, r19))); //       ld1     {v22.1D, v23.1D, v24.1D}, [x25], x19
+    __ ld1(v25, v26, v27, v28, __ T8H, Address(__ post(r26, 64))); //   ld1     {v25.8H, v26.8H, v27.8H, v28.8H}, [x26], 64
+    __ ld1r(v9, __ T8B, Address(r15));                 //       ld1r    {v9.8B}, [x15]
+    __ ld1r(v12, __ T4S, Address(__ post(r25, 4)));    //       ld1r    {v12.4S}, [x25], 4
+    __ ld1r(v4, __ T1D, Address(__ post(r14, r29)));   //       ld1r    {v4.1D}, [x14], x29
+    __ ld2(v17, v18, __ T2D, Address(r17));            //       ld2     {v17.2D, v18.2D}, [x17]
+    __ ld2(v23, v24, __ T4H, Address(__ post(r27, 16))); //     ld2     {v23.4H, v24.4H}, [x27], 16
+    __ ld2r(v2, v3, __ T16B, Address(r24));            //       ld2r    {v2.16B, v3.16B}, [x24]
+    __ ld2r(v11, v12, __ T2S, Address(__ post(r0, 8))); //      ld2r    {v11.2S, v12.2S}, [x0], 8
+    __ ld2r(v2, v3, __ T2D, Address(__ post(r12, r22))); //     ld2r    {v2.2D, v3.2D}, [x12], x22
+    __ ld3(v21, v22, v23, __ T4S, Address(__ post(r13, r13))); //       ld3     {v21.4S, v22.4S, v23.4S}, [x13], x13
+    __ ld3(v12, v13, v14, __ T2S, Address(r11));       //       ld3     {v12.2S, v13.2S, v14.2S}, [x11]
+    __ ld3r(v18, v19, v20, __ T8H, Address(r14));      //       ld3r    {v18.8H, v19.8H, v20.8H}, [x14]
+    __ ld3r(v25, v26, v27, __ T4S, Address(__ post(r21, 12))); //       ld3r    {v25.4S, v26.4S, v27.4S}, [x21], 12
+    __ ld3r(v20, v21, v22, __ T1D, Address(__ post(r16, r27))); //      ld3r    {v20.1D, v21.1D, v22.1D}, [x16], x27
+    __ ld4(v0, v1, v2, v3, __ T8H, Address(__ post(r1, 64))); //        ld4     {v0.8H, v1.8H, v2.8H, v3.8H}, [x1], 64
+    __ ld4(v0, v1, v2, v3, __ T8B, Address(__ post(r27, r29))); //      ld4     {v0.8B, v1.8B, v2.8B, v3.8B}, [x27], x29
+    __ ld4r(v18, v19, v20, v21, __ T8B, Address(r17)); //       ld4r    {v18.8B, v19.8B, v20.8B, v21.8B}, [x17]
+    __ ld4r(v5, v6, v7, v8, __ T4H, Address(__ post(r24, 8))); //       ld4r    {v5.4H, v6.4H, v7.4H, v8.4H}, [x24], 8
+    __ ld4r(v28, v29, v30, v31, __ T2S, Address(__ post(r5, r20))); //  ld4r    {v28.2S, v29.2S, v30.2S, v31.2S}, [x5], x20
 
 // NEONReduceInstruction
-    __ addv(v27, __ T8B, v28);                         //       addv    b27, v28.8B
-    __ addv(v28, __ T16B, v29);                        //       addv    b28, v29.16B
-    __ addv(v1, __ T4H, v2);                           //       addv    h1, v2.4H
-    __ addv(v28, __ T8H, v29);                         //       addv    h28, v29.8H
-    __ addv(v1, __ T4S, v2);                           //       addv    s1, v2.4S
-    __ smaxv(v20, __ T8B, v21);                        //       smaxv   b20, v21.8B
+    __ addv(v1, __ T8B, v2);                           //       addv    b1, v2.8B
+    __ addv(v20, __ T16B, v21);                        //       addv    b20, v21.16B
+    __ addv(v29, __ T4H, v30);                         //       addv    h29, v30.4H
+    __ addv(v16, __ T8H, v17);                         //       addv    h16, v17.8H
+    __ addv(v13, __ T4S, v14);                         //       addv    s13, v14.4S
+    __ smaxv(v10, __ T8B, v11);                        //       smaxv   b10, v11.8B
     __ smaxv(v29, __ T16B, v30);                       //       smaxv   b29, v30.16B
-    __ smaxv(v16, __ T4H, v17);                        //       smaxv   h16, v17.4H
-    __ smaxv(v13, __ T8H, v14);                        //       smaxv   h13, v14.8H
-    __ smaxv(v10, __ T4S, v11);                        //       smaxv   s10, v11.4S
-    __ fmaxv(v29, __ T4S, v30);                        //       fmaxv   s29, v30.4S
-    __ sminv(v29, __ T8B, v30);                        //       sminv   b29, v30.8B
-    __ uminv(v19, __ T8B, v20);                        //       uminv   b19, v20.8B
-    __ sminv(v22, __ T16B, v23);                       //       sminv   b22, v23.16B
-    __ uminv(v10, __ T16B, v11);                       //       uminv   b10, v11.16B
-    __ sminv(v4, __ T4H, v5);                          //       sminv   h4, v5.4H
-    __ uminv(v31, __ T4H, v0);                         //       uminv   h31, v0.4H
-    __ sminv(v21, __ T8H, v22);                        //       sminv   h21, v22.8H
-    __ uminv(v8, __ T8H, v9);                          //       uminv   h8, v9.8H
-    __ sminv(v31, __ T4S, v0);                         //       sminv   s31, v0.4S
-    __ uminv(v19, __ T4S, v20);                        //       uminv   s19, v20.4S
-    __ fminv(v10, __ T4S, v11);                        //       fminv   s10, v11.4S
-    __ fmaxp(v28, v29, __ S);                          //       fmaxp   s28, v29.2S
-    __ fmaxp(v2, v3, __ D);                            //       fmaxp   d2, v3.2D
-    __ fminp(v25, v26, __ S);                          //       fminp   s25, v26.2S
-    __ fminp(v5, v6, __ D);                            //       fminp   d5, v6.2D
+    __ smaxv(v29, __ T4H, v30);                        //       smaxv   h29, v30.4H
+    __ smaxv(v19, __ T8H, v20);                        //       smaxv   h19, v20.8H
+    __ smaxv(v22, __ T4S, v23);                        //       smaxv   s22, v23.4S
+    __ fmaxv(v10, __ T4S, v11);                        //       fmaxv   s10, v11.4S
+    __ sminv(v4, __ T8B, v5);                          //       sminv   b4, v5.8B
+    __ uminv(v31, __ T8B, v0);                         //       uminv   b31, v0.8B
+    __ sminv(v21, __ T16B, v22);                       //       sminv   b21, v22.16B
+    __ uminv(v8, __ T16B, v9);                         //       uminv   b8, v9.16B
+    __ sminv(v31, __ T4H, v0);                         //       sminv   h31, v0.4H
+    __ uminv(v19, __ T4H, v20);                        //       uminv   h19, v20.4H
+    __ sminv(v10, __ T8H, v11);                        //       sminv   h10, v11.8H
+    __ uminv(v28, __ T8H, v29);                        //       uminv   h28, v29.8H
+    __ sminv(v2, __ T4S, v3);                          //       sminv   s2, v3.4S
+    __ uminv(v25, __ T4S, v26);                        //       uminv   s25, v26.4S
+    __ fminv(v5, __ T4S, v6);                          //       fminv   s5, v6.4S
+    __ fmaxp(v3, v4, __ S);                            //       fmaxp   s3, v4.2S
+    __ fmaxp(v8, v9, __ D);                            //       fmaxp   d8, v9.2D
+    __ fminp(v22, v23, __ S);                          //       fminp   s22, v23.2S
+    __ fminp(v19, v20, __ D);                          //       fminp   d19, v20.2D
 
 // NEONFloatCompareWithZero
-    __ fcm(Assembler::GT, v3, __ T2S, v4);             //       fcmgt   v3.2S, v4.2S, #0.0
-    __ fcm(Assembler::GT, v8, __ T4S, v9);             //       fcmgt   v8.4S, v9.4S, #0.0
-    __ fcm(Assembler::GT, v22, __ T2D, v23);           //       fcmgt   v22.2D, v23.2D, #0.0
-    __ fcm(Assembler::GE, v19, __ T2S, v20);           //       fcmge   v19.2S, v20.2S, #0.0
-    __ fcm(Assembler::GE, v13, __ T4S, v14);           //       fcmge   v13.4S, v14.4S, #0.0
-    __ fcm(Assembler::GE, v5, __ T2D, v6);             //       fcmge   v5.2D, v6.2D, #0.0
-    __ fcm(Assembler::EQ, v29, __ T2S, v30);           //       fcmeq   v29.2S, v30.2S, #0.0
-    __ fcm(Assembler::EQ, v24, __ T4S, v25);           //       fcmeq   v24.4S, v25.4S, #0.0
-    __ fcm(Assembler::EQ, v21, __ T2D, v22);           //       fcmeq   v21.2D, v22.2D, #0.0
+    __ fcm(Assembler::GT, v13, __ T2S, v14);           //       fcmgt   v13.2S, v14.2S, #0.0
+    __ fcm(Assembler::GT, v5, __ T4S, v6);             //       fcmgt   v5.4S, v6.4S, #0.0
+    __ fcm(Assembler::GT, v29, __ T2D, v30);           //       fcmgt   v29.2D, v30.2D, #0.0
+    __ fcm(Assembler::GE, v24, __ T2S, v25);           //       fcmge   v24.2S, v25.2S, #0.0
+    __ fcm(Assembler::GE, v21, __ T4S, v22);           //       fcmge   v21.4S, v22.4S, #0.0
+    __ fcm(Assembler::GE, v26, __ T2D, v27);           //       fcmge   v26.2D, v27.2D, #0.0
+    __ fcm(Assembler::EQ, v24, __ T2S, v25);           //       fcmeq   v24.2S, v25.2S, #0.0
+    __ fcm(Assembler::EQ, v3, __ T4S, v4);             //       fcmeq   v3.4S, v4.4S, #0.0
+    __ fcm(Assembler::EQ, v24, __ T2D, v25);           //       fcmeq   v24.2D, v25.2D, #0.0
     __ fcm(Assembler::LT, v26, __ T2S, v27);           //       fcmlt   v26.2S, v27.2S, #0.0
-    __ fcm(Assembler::LT, v24, __ T4S, v25);           //       fcmlt   v24.4S, v25.4S, #0.0
-    __ fcm(Assembler::LT, v3, __ T2D, v4);             //       fcmlt   v3.2D, v4.2D, #0.0
-    __ fcm(Assembler::LE, v24, __ T2S, v25);           //       fcmle   v24.2S, v25.2S, #0.0
-    __ fcm(Assembler::LE, v26, __ T4S, v27);           //       fcmle   v26.4S, v27.4S, #0.0
-    __ fcm(Assembler::LE, v23, __ T2D, v24);           //       fcmle   v23.2D, v24.2D, #0.0
+    __ fcm(Assembler::LT, v23, __ T4S, v24);           //       fcmlt   v23.4S, v24.4S, #0.0
+    __ fcm(Assembler::LT, v15, __ T2D, v16);           //       fcmlt   v15.2D, v16.2D, #0.0
+    __ fcm(Assembler::LE, v21, __ T2S, v22);           //       fcmle   v21.2S, v22.2S, #0.0
+    __ fcm(Assembler::LE, v3, __ T4S, v4);             //       fcmle   v3.4S, v4.4S, #0.0
+    __ fcm(Assembler::LE, v24, __ T2D, v25);           //       fcmle   v24.2D, v25.2D, #0.0
 
 // TwoRegNEONOp
-    __ absr(v15, __ T8B, v16);                         //       abs     v15.8B, v16.8B
-    __ absr(v21, __ T16B, v22);                        //       abs     v21.16B, v22.16B
-    __ absr(v3, __ T4H, v4);                           //       abs     v3.4H, v4.4H
-    __ absr(v24, __ T8H, v25);                         //       abs     v24.8H, v25.8H
-    __ absr(v8, __ T2S, v9);                           //       abs     v8.2S, v9.2S
-    __ absr(v25, __ T4S, v26);                         //       abs     v25.4S, v26.4S
-    __ absr(v20, __ T2D, v21);                         //       abs     v20.2D, v21.2D
-    __ fabs(v16, __ T2S, v17);                         //       fabs    v16.2S, v17.2S
-    __ fabs(v17, __ T4S, v18);                         //       fabs    v17.4S, v18.4S
-    __ fabs(v2, __ T2D, v3);                           //       fabs    v2.2D, v3.2D
-    __ fabs(v1, __ T4H, v2);                           //       fabs    v1.4H, v2.4H
-    __ fabs(v0, __ T8H, v1);                           //       fabs    v0.8H, v1.8H
-    __ fneg(v24, __ T2S, v25);                         //       fneg    v24.2S, v25.2S
-    __ fneg(v4, __ T4S, v5);                           //       fneg    v4.4S, v5.4S
-    __ fneg(v3, __ T2D, v4);                           //       fneg    v3.2D, v4.2D
-    __ fneg(v12, __ T4H, v13);                         //       fneg    v12.4H, v13.4H
-    __ fneg(v31, __ T8H, v0);                          //       fneg    v31.8H, v0.8H
-    __ fsqrt(v28, __ T2S, v29);                        //       fsqrt   v28.2S, v29.2S
-    __ fsqrt(v10, __ T4S, v11);                        //       fsqrt   v10.4S, v11.4S
-    __ fsqrt(v26, __ T2D, v27);                        //       fsqrt   v26.2D, v27.2D
-    __ fsqrt(v2, __ T4H, v3);                          //       fsqrt   v2.4H, v3.4H
-    __ fsqrt(v12, __ T8H, v13);                        //       fsqrt   v12.8H, v13.8H
-    __ notr(v18, __ T8B, v19);                         //       not     v18.8B, v19.8B
-    __ notr(v31, __ T16B, v0);                         //       not     v31.16B, v0.16B
+    __ absr(v8, __ T8B, v9);                           //       abs     v8.8B, v9.8B
+    __ absr(v25, __ T16B, v26);                        //       abs     v25.16B, v26.16B
+    __ absr(v20, __ T4H, v21);                         //       abs     v20.4H, v21.4H
+    __ absr(v16, __ T8H, v17);                         //       abs     v16.8H, v17.8H
+    __ absr(v17, __ T2S, v18);                         //       abs     v17.2S, v18.2S
+    __ absr(v2, __ T4S, v3);                           //       abs     v2.4S, v3.4S
+    __ absr(v1, __ T2D, v2);                           //       abs     v1.2D, v2.2D
+    __ fabs(v0, __ T2S, v1);                           //       fabs    v0.2S, v1.2S
+    __ fabs(v24, __ T4S, v25);                         //       fabs    v24.4S, v25.4S
+    __ fabs(v4, __ T2D, v5);                           //       fabs    v4.2D, v5.2D
+    __ fabs(v3, __ T4H, v4);                           //       fabs    v3.4H, v4.4H
+    __ fabs(v12, __ T8H, v13);                         //       fabs    v12.8H, v13.8H
+    __ fneg(v31, __ T2S, v0);                          //       fneg    v31.2S, v0.2S
+    __ fneg(v28, __ T4S, v29);                         //       fneg    v28.4S, v29.4S
+    __ fneg(v10, __ T2D, v11);                         //       fneg    v10.2D, v11.2D
+    __ fneg(v26, __ T4H, v27);                         //       fneg    v26.4H, v27.4H
+    __ fneg(v2, __ T8H, v3);                           //       fneg    v2.8H, v3.8H
+    __ fsqrt(v12, __ T2S, v13);                        //       fsqrt   v12.2S, v13.2S
+    __ fsqrt(v18, __ T4S, v19);                        //       fsqrt   v18.4S, v19.4S
+    __ fsqrt(v31, __ T2D, v0);                         //       fsqrt   v31.2D, v0.2D
+    __ fsqrt(v1, __ T4H, v2);                          //       fsqrt   v1.4H, v2.4H
+    __ fsqrt(v13, __ T8H, v14);                        //       fsqrt   v13.8H, v14.8H
+    __ notr(v29, __ T8B, v30);                         //       not     v29.8B, v30.8B
+    __ notr(v0, __ T16B, v1);                          //       not     v0.16B, v1.16B
 
 // ThreeRegNEONOp
-    __ andr(v1, __ T8B, v2, v3);                       //       and     v1.8B, v2.8B, v3.8B
-    __ andr(v13, __ T16B, v14, v15);                   //       and     v13.16B, v14.16B, v15.16B
-    __ orr(v29, __ T8B, v30, v31);                     //       orr     v29.8B, v30.8B, v31.8B
-    __ orr(v0, __ T16B, v1, v2);                       //       orr     v0.16B, v1.16B, v2.16B
-    __ eor(v19, __ T8B, v20, v21);                     //       eor     v19.8B, v20.8B, v21.8B
-    __ eor(v12, __ T16B, v13, v14);                    //       eor     v12.16B, v13.16B, v14.16B
-    __ addv(v17, __ T8B, v18, v19);                    //       add     v17.8B, v18.8B, v19.8B
-    __ addv(v22, __ T16B, v23, v24);                   //       add     v22.16B, v23.16B, v24.16B
-    __ addv(v13, __ T4H, v14, v15);                    //       add     v13.4H, v14.4H, v15.4H
-    __ addv(v28, __ T8H, v29, v30);                    //       add     v28.8H, v29.8H, v30.8H
-    __ addv(v30, __ T2S, v31, v0);                     //       add     v30.2S, v31.2S, v0.2S
-    __ addv(v31, __ T4S, v0, v1);                      //       add     v31.4S, v0.4S, v1.4S
-    __ addv(v1, __ T2D, v2, v3);                       //       add     v1.2D, v2.2D, v3.2D
-    __ sqaddv(v26, __ T8B, v27, v28);                  //       sqadd   v26.8B, v27.8B, v28.8B
-    __ sqaddv(v28, __ T16B, v29, v30);                 //       sqadd   v28.16B, v29.16B, v30.16B
-    __ sqaddv(v4, __ T4H, v5, v6);                     //       sqadd   v4.4H, v5.4H, v6.4H
-    __ sqaddv(v30, __ T8H, v31, v0);                   //       sqadd   v30.8H, v31.8H, v0.8H
-    __ sqaddv(v4, __ T2S, v5, v6);                     //       sqadd   v4.2S, v5.2S, v6.2S
-    __ sqaddv(v6, __ T4S, v7, v8);                     //       sqadd   v6.4S, v7.4S, v8.4S
-    __ sqaddv(v30, __ T2D, v31, v0);                   //       sqadd   v30.2D, v31.2D, v0.2D
-    __ uqaddv(v26, __ T8B, v27, v28);                  //       uqadd   v26.8B, v27.8B, v28.8B
-    __ uqaddv(v18, __ T16B, v19, v20);                 //       uqadd   v18.16B, v19.16B, v20.16B
-    __ uqaddv(v9, __ T4H, v10, v11);                   //       uqadd   v9.4H, v10.4H, v11.4H
-    __ uqaddv(v8, __ T8H, v9, v10);                    //       uqadd   v8.8H, v9.8H, v10.8H
-    __ uqaddv(v12, __ T2S, v13, v14);                  //       uqadd   v12.2S, v13.2S, v14.2S
-    __ uqaddv(v0, __ T4S, v1, v2);                     //       uqadd   v0.4S, v1.4S, v2.4S
-    __ uqaddv(v20, __ T2D, v21, v22);                  //       uqadd   v20.2D, v21.2D, v22.2D
-    __ fadd(v1, __ T2S, v2, v3);                       //       fadd    v1.2S, v2.2S, v3.2S
+    __ andr(v19, __ T8B, v20, v21);                    //       and     v19.8B, v20.8B, v21.8B
+    __ andr(v12, __ T16B, v13, v14);                   //       and     v12.16B, v13.16B, v14.16B
+    __ orr(v17, __ T8B, v18, v19);                     //       orr     v17.8B, v18.8B, v19.8B
+    __ orr(v22, __ T16B, v23, v24);                    //       orr     v22.16B, v23.16B, v24.16B
+    __ eor(v13, __ T8B, v14, v15);                     //       eor     v13.8B, v14.8B, v15.8B
+    __ eor(v28, __ T16B, v29, v30);                    //       eor     v28.16B, v29.16B, v30.16B
+    __ addv(v30, __ T8B, v31, v0);                     //       add     v30.8B, v31.8B, v0.8B
+    __ addv(v31, __ T16B, v0, v1);                     //       add     v31.16B, v0.16B, v1.16B
+    __ addv(v1, __ T4H, v2, v3);                       //       add     v1.4H, v2.4H, v3.4H
+    __ addv(v26, __ T8H, v27, v28);                    //       add     v26.8H, v27.8H, v28.8H
+    __ addv(v28, __ T2S, v29, v30);                    //       add     v28.2S, v29.2S, v30.2S
+    __ addv(v4, __ T4S, v5, v6);                       //       add     v4.4S, v5.4S, v6.4S
+    __ addv(v30, __ T2D, v31, v0);                     //       add     v30.2D, v31.2D, v0.2D
+    __ sqaddv(v4, __ T8B, v5, v6);                     //       sqadd   v4.8B, v5.8B, v6.8B
+    __ sqaddv(v6, __ T16B, v7, v8);                    //       sqadd   v6.16B, v7.16B, v8.16B
+    __ sqaddv(v30, __ T4H, v31, v0);                   //       sqadd   v30.4H, v31.4H, v0.4H
+    __ sqaddv(v26, __ T8H, v27, v28);                  //       sqadd   v26.8H, v27.8H, v28.8H
+    __ sqaddv(v18, __ T2S, v19, v20);                  //       sqadd   v18.2S, v19.2S, v20.2S
+    __ sqaddv(v9, __ T4S, v10, v11);                   //       sqadd   v9.4S, v10.4S, v11.4S
+    __ sqaddv(v8, __ T2D, v9, v10);                    //       sqadd   v8.2D, v9.2D, v10.2D
+    __ uqaddv(v12, __ T8B, v13, v14);                  //       uqadd   v12.8B, v13.8B, v14.8B
+    __ uqaddv(v0, __ T16B, v1, v2);                    //       uqadd   v0.16B, v1.16B, v2.16B
+    __ uqaddv(v20, __ T4H, v21, v22);                  //       uqadd   v20.4H, v21.4H, v22.4H
+    __ uqaddv(v1, __ T8H, v2, v3);                     //       uqadd   v1.8H, v2.8H, v3.8H
+    __ uqaddv(v24, __ T2S, v25, v26);                  //       uqadd   v24.2S, v25.2S, v26.2S
+    __ uqaddv(v2, __ T4S, v3, v4);                     //       uqadd   v2.4S, v3.4S, v4.4S
+    __ uqaddv(v0, __ T2D, v1, v2);                     //       uqadd   v0.2D, v1.2D, v2.2D
+    __ fadd(v9, __ T2S, v10, v11);                     //       fadd    v9.2S, v10.2S, v11.2S
     __ fadd(v24, __ T4S, v25, v26);                    //       fadd    v24.4S, v25.4S, v26.4S
-    __ fadd(v2, __ T2D, v3, v4);                       //       fadd    v2.2D, v3.2D, v4.2D
-    __ fadd(v0, __ T4H, v1, v2);                       //       fadd    v0.4H, v1.4H, v2.4H
-    __ fadd(v9, __ T8H, v10, v11);                     //       fadd    v9.8H, v10.8H, v11.8H
-    __ subv(v24, __ T8B, v25, v26);                    //       sub     v24.8B, v25.8B, v26.8B
-    __ subv(v26, __ T16B, v27, v28);                   //       sub     v26.16B, v27.16B, v28.16B
-    __ subv(v16, __ T4H, v17, v18);                    //       sub     v16.4H, v17.4H, v18.4H
-    __ subv(v30, __ T8H, v31, v0);                     //       sub     v30.8H, v31.8H, v0.8H
-    __ subv(v3, __ T2S, v4, v5);                       //       sub     v3.2S, v4.2S, v5.2S
-    __ subv(v10, __ T4S, v11, v12);                    //       sub     v10.4S, v11.4S, v12.4S
-    __ subv(v23, __ T2D, v24, v25);                    //       sub     v23.2D, v24.2D, v25.2D
-    __ sqsubv(v10, __ T8B, v11, v12);                  //       sqsub   v10.8B, v11.8B, v12.8B
-    __ sqsubv(v4, __ T16B, v5, v6);                    //       sqsub   v4.16B, v5.16B, v6.16B
-    __ sqsubv(v18, __ T4H, v19, v20);                  //       sqsub   v18.4H, v19.4H, v20.4H
-    __ sqsubv(v2, __ T8H, v3, v4);                     //       sqsub   v2.8H, v3.8H, v4.8H
-    __ sqsubv(v11, __ T2S, v12, v13);                  //       sqsub   v11.2S, v12.2S, v13.2S
-    __ sqsubv(v8, __ T4S, v9, v10);                    //       sqsub   v8.4S, v9.4S, v10.4S
+    __ fadd(v26, __ T2D, v27, v28);                    //       fadd    v26.2D, v27.2D, v28.2D
+    __ fadd(v16, __ T4H, v17, v18);                    //       fadd    v16.4H, v17.4H, v18.4H
+    __ fadd(v30, __ T8H, v31, v0);                     //       fadd    v30.8H, v31.8H, v0.8H
+    __ subv(v3, __ T8B, v4, v5);                       //       sub     v3.8B, v4.8B, v5.8B
+    __ subv(v10, __ T16B, v11, v12);                   //       sub     v10.16B, v11.16B, v12.16B
+    __ subv(v23, __ T4H, v24, v25);                    //       sub     v23.4H, v24.4H, v25.4H
+    __ subv(v10, __ T8H, v11, v12);                    //       sub     v10.8H, v11.8H, v12.8H
+    __ subv(v4, __ T2S, v5, v6);                       //       sub     v4.2S, v5.2S, v6.2S
+    __ subv(v18, __ T4S, v19, v20);                    //       sub     v18.4S, v19.4S, v20.4S
+    __ subv(v2, __ T2D, v3, v4);                       //       sub     v2.2D, v3.2D, v4.2D
+    __ sqsubv(v11, __ T8B, v12, v13);                  //       sqsub   v11.8B, v12.8B, v13.8B
+    __ sqsubv(v8, __ T16B, v9, v10);                   //       sqsub   v8.16B, v9.16B, v10.16B
+    __ sqsubv(v10, __ T4H, v11, v12);                  //       sqsub   v10.4H, v11.4H, v12.4H
+    __ sqsubv(v15, __ T8H, v16, v17);                  //       sqsub   v15.8H, v16.8H, v17.8H
+    __ sqsubv(v17, __ T2S, v18, v19);                  //       sqsub   v17.2S, v18.2S, v19.2S
+    __ sqsubv(v2, __ T4S, v3, v4);                     //       sqsub   v2.4S, v3.4S, v4.4S
     __ sqsubv(v10, __ T2D, v11, v12);                  //       sqsub   v10.2D, v11.2D, v12.2D
-    __ uqsubv(v15, __ T8B, v16, v17);                  //       uqsub   v15.8B, v16.8B, v17.8B
-    __ uqsubv(v17, __ T16B, v18, v19);                 //       uqsub   v17.16B, v18.16B, v19.16B
-    __ uqsubv(v2, __ T4H, v3, v4);                     //       uqsub   v2.4H, v3.4H, v4.4H
-    __ uqsubv(v10, __ T8H, v11, v12);                  //       uqsub   v10.8H, v11.8H, v12.8H
-    __ uqsubv(v12, __ T2S, v13, v14);                  //       uqsub   v12.2S, v13.2S, v14.2S
-    __ uqsubv(v12, __ T4S, v13, v14);                  //       uqsub   v12.4S, v13.4S, v14.4S
-    __ uqsubv(v15, __ T2D, v16, v17);                  //       uqsub   v15.2D, v16.2D, v17.2D
-    __ fsub(v13, __ T2S, v14, v15);                    //       fsub    v13.2S, v14.2S, v15.2S
-    __ fsub(v2, __ T4S, v3, v4);                       //       fsub    v2.4S, v3.4S, v4.4S
-    __ fsub(v7, __ T2D, v8, v9);                       //       fsub    v7.2D, v8.2D, v9.2D
-    __ fsub(v20, __ T4H, v21, v22);                    //       fsub    v20.4H, v21.4H, v22.4H
-    __ fsub(v26, __ T8H, v27, v28);                    //       fsub    v26.8H, v27.8H, v28.8H
-    __ mulv(v16, __ T8B, v17, v18);                    //       mul     v16.8B, v17.8B, v18.8B
-    __ mulv(v4, __ T16B, v5, v6);                      //       mul     v4.16B, v5.16B, v6.16B
-    __ mulv(v2, __ T4H, v3, v4);                       //       mul     v2.4H, v3.4H, v4.4H
-    __ mulv(v4, __ T8H, v5, v6);                       //       mul     v4.8H, v5.8H, v6.8H
-    __ mulv(v12, __ T2S, v13, v14);                    //       mul     v12.2S, v13.2S, v14.2S
-    __ mulv(v18, __ T4S, v19, v20);                    //       mul     v18.4S, v19.4S, v20.4S
+    __ uqsubv(v12, __ T8B, v13, v14);                  //       uqsub   v12.8B, v13.8B, v14.8B
+    __ uqsubv(v12, __ T16B, v13, v14);                 //       uqsub   v12.16B, v13.16B, v14.16B
+    __ uqsubv(v15, __ T4H, v16, v17);                  //       uqsub   v15.4H, v16.4H, v17.4H
+    __ uqsubv(v13, __ T8H, v14, v15);                  //       uqsub   v13.8H, v14.8H, v15.8H
+    __ uqsubv(v2, __ T2S, v3, v4);                     //       uqsub   v2.2S, v3.2S, v4.2S
+    __ uqsubv(v7, __ T4S, v8, v9);                     //       uqsub   v7.4S, v8.4S, v9.4S
+    __ uqsubv(v20, __ T2D, v21, v22);                  //       uqsub   v20.2D, v21.2D, v22.2D
+    __ fsub(v26, __ T2S, v27, v28);                    //       fsub    v26.2S, v27.2S, v28.2S
+    __ fsub(v16, __ T4S, v17, v18);                    //       fsub    v16.4S, v17.4S, v18.4S
+    __ fsub(v4, __ T2D, v5, v6);                       //       fsub    v4.2D, v5.2D, v6.2D
+    __ fsub(v2, __ T4H, v3, v4);                       //       fsub    v2.4H, v3.4H, v4.4H
+    __ fsub(v4, __ T8H, v5, v6);                       //       fsub    v4.8H, v5.8H, v6.8H
+    __ mulv(v12, __ T8B, v13, v14);                    //       mul     v12.8B, v13.8B, v14.8B
+    __ mulv(v18, __ T16B, v19, v20);                   //       mul     v18.16B, v19.16B, v20.16B
+    __ mulv(v21, __ T4H, v22, v23);                    //       mul     v21.4H, v22.4H, v23.4H
+    __ mulv(v16, __ T8H, v17, v18);                    //       mul     v16.8H, v17.8H, v18.8H
+    __ mulv(v18, __ T2S, v19, v20);                    //       mul     v18.2S, v19.2S, v20.2S
+    __ mulv(v11, __ T4S, v12, v13);                    //       mul     v11.4S, v12.4S, v13.4S
     __ fabd(v21, __ T2S, v22, v23);                    //       fabd    v21.2S, v22.2S, v23.2S
-    __ fabd(v16, __ T4S, v17, v18);                    //       fabd    v16.4S, v17.4S, v18.4S
-    __ fabd(v18, __ T2D, v19, v20);                    //       fabd    v18.2D, v19.2D, v20.2D
-    __ fabd(v11, __ T4H, v12, v13);                    //       fabd    v11.4H, v12.4H, v13.4H
-    __ fabd(v21, __ T8H, v22, v23);                    //       fabd    v21.8H, v22.8H, v23.8H
-    __ faddp(v23, __ T2S, v24, v25);                   //       faddp   v23.2S, v24.2S, v25.2S
-    __ faddp(v12, __ T4S, v13, v14);                   //       faddp   v12.4S, v13.4S, v14.4S
-    __ faddp(v26, __ T2D, v27, v28);                   //       faddp   v26.2D, v27.2D, v28.2D
-    __ faddp(v23, __ T4H, v24, v25);                   //       faddp   v23.4H, v24.4H, v25.4H
-    __ faddp(v28, __ T8H, v29, v30);                   //       faddp   v28.8H, v29.8H, v30.8H
-    __ fmul(v14, __ T2S, v15, v16);                    //       fmul    v14.2S, v15.2S, v16.2S
-    __ fmul(v11, __ T4S, v12, v13);                    //       fmul    v11.4S, v12.4S, v13.4S
-    __ fmul(v24, __ T2D, v25, v26);                    //       fmul    v24.2D, v25.2D, v26.2D
-    __ fmul(v1, __ T4H, v2, v3);                       //       fmul    v1.4H, v2.4H, v3.4H
-    __ fmul(v12, __ T8H, v13, v14);                    //       fmul    v12.8H, v13.8H, v14.8H
-    __ mlav(v31, __ T4H, v0, v1);                      //       mla     v31.4H, v0.4H, v1.4H
-    __ mlav(v10, __ T8H, v11, v12);                    //       mla     v10.8H, v11.8H, v12.8H
-    __ mlav(v16, __ T2S, v17, v18);                    //       mla     v16.2S, v17.2S, v18.2S
-    __ mlav(v7, __ T4S, v8, v9);                       //       mla     v7.4S, v8.4S, v9.4S
-    __ fmla(v2, __ T2S, v3, v4);                       //       fmla    v2.2S, v3.2S, v4.2S
-    __ fmla(v3, __ T4S, v4, v5);                       //       fmla    v3.4S, v4.4S, v5.4S
-    __ fmla(v13, __ T2D, v14, v15);                    //       fmla    v13.2D, v14.2D, v15.2D
-    __ fmla(v19, __ T4H, v20, v21);                    //       fmla    v19.4H, v20.4H, v21.4H
-    __ fmla(v17, __ T8H, v18, v19);                    //       fmla    v17.8H, v18.8H, v19.8H
-    __ mlsv(v16, __ T4H, v17, v18);                    //       mls     v16.4H, v17.4H, v18.4H
-    __ mlsv(v3, __ T8H, v4, v5);                       //       mls     v3.8H, v4.8H, v5.8H
-    __ mlsv(v1, __ T2S, v2, v3);                       //       mls     v1.2S, v2.2S, v3.2S
-    __ mlsv(v11, __ T4S, v12, v13);                    //       mls     v11.4S, v12.4S, v13.4S
-    __ fmls(v30, __ T2S, v31, v0);                     //       fmls    v30.2S, v31.2S, v0.2S
-    __ fmls(v5, __ T4S, v6, v7);                       //       fmls    v5.4S, v6.4S, v7.4S
-    __ fmls(v8, __ T2D, v9, v10);                      //       fmls    v8.2D, v9.2D, v10.2D
-    __ fmls(v15, __ T4H, v16, v17);                    //       fmls    v15.4H, v16.4H, v17.4H
-    __ fmls(v29, __ T8H, v30, v31);                    //       fmls    v29.8H, v30.8H, v31.8H
-    __ fdiv(v30, __ T2S, v31, v0);                     //       fdiv    v30.2S, v31.2S, v0.2S
-    __ fdiv(v0, __ T4S, v1, v2);                       //       fdiv    v0.4S, v1.4S, v2.4S
-    __ fdiv(v20, __ T2D, v21, v22);                    //       fdiv    v20.2D, v21.2D, v22.2D
-    __ fdiv(v7, __ T4H, v8, v9);                       //       fdiv    v7.4H, v8.4H, v9.4H
-    __ fdiv(v20, __ T8H, v21, v22);                    //       fdiv    v20.8H, v21.8H, v22.8H
-    __ maxv(v23, __ T8B, v24, v25);                    //       smax    v23.8B, v24.8B, v25.8B
-    __ maxv(v28, __ T16B, v29, v30);                   //       smax    v28.16B, v29.16B, v30.16B
-    __ maxv(v21, __ T4H, v22, v23);                    //       smax    v21.4H, v22.4H, v23.4H
-    __ maxv(v27, __ T8H, v28, v29);                    //       smax    v27.8H, v28.8H, v29.8H
-    __ maxv(v25, __ T2S, v26, v27);                    //       smax    v25.2S, v26.2S, v27.2S
-    __ maxv(v5, __ T4S, v6, v7);                       //       smax    v5.4S, v6.4S, v7.4S
-    __ umaxv(v1, __ T8B, v2, v3);                      //       umax    v1.8B, v2.8B, v3.8B
-    __ umaxv(v23, __ T16B, v24, v25);                  //       umax    v23.16B, v24.16B, v25.16B
-    __ umaxv(v16, __ T4H, v17, v18);                   //       umax    v16.4H, v17.4H, v18.4H
-    __ umaxv(v31, __ T8H, v0, v1);                     //       umax    v31.8H, v0.8H, v1.8H
-    __ umaxv(v5, __ T2S, v6, v7);                      //       umax    v5.2S, v6.2S, v7.2S
-    __ umaxv(v12, __ T4S, v13, v14);                   //       umax    v12.4S, v13.4S, v14.4S
-    __ smaxp(v9, __ T8B, v10, v11);                    //       smaxp   v9.8B, v10.8B, v11.8B
-    __ smaxp(v28, __ T16B, v29, v30);                  //       smaxp   v28.16B, v29.16B, v30.16B
-    __ smaxp(v15, __ T4H, v16, v17);                   //       smaxp   v15.4H, v16.4H, v17.4H
-    __ smaxp(v29, __ T8H, v30, v31);                   //       smaxp   v29.8H, v30.8H, v31.8H
-    __ smaxp(v22, __ T2S, v23, v24);                   //       smaxp   v22.2S, v23.2S, v24.2S
-    __ smaxp(v31, __ T4S, v0, v1);                     //       smaxp   v31.4S, v0.4S, v1.4S
-    __ fmax(v19, __ T2S, v20, v21);                    //       fmax    v19.2S, v20.2S, v21.2S
+    __ fabd(v23, __ T4S, v24, v25);                    //       fabd    v23.4S, v24.4S, v25.4S
+    __ fabd(v12, __ T2D, v13, v14);                    //       fabd    v12.2D, v13.2D, v14.2D
+    __ fabd(v26, __ T4H, v27, v28);                    //       fabd    v26.4H, v27.4H, v28.4H
+    __ fabd(v23, __ T8H, v24, v25);                    //       fabd    v23.8H, v24.8H, v25.8H
+    __ faddp(v28, __ T2S, v29, v30);                   //       faddp   v28.2S, v29.2S, v30.2S
+    __ faddp(v14, __ T4S, v15, v16);                   //       faddp   v14.4S, v15.4S, v16.4S
+    __ faddp(v11, __ T2D, v12, v13);                   //       faddp   v11.2D, v12.2D, v13.2D
+    __ faddp(v24, __ T4H, v25, v26);                   //       faddp   v24.4H, v25.4H, v26.4H
+    __ faddp(v1, __ T8H, v2, v3);                      //       faddp   v1.8H, v2.8H, v3.8H
+    __ fmul(v12, __ T2S, v13, v14);                    //       fmul    v12.2S, v13.2S, v14.2S
+    __ fmul(v31, __ T4S, v0, v1);                      //       fmul    v31.4S, v0.4S, v1.4S
+    __ fmul(v10, __ T2D, v11, v12);                    //       fmul    v10.2D, v11.2D, v12.2D
+    __ fmul(v16, __ T4H, v17, v18);                    //       fmul    v16.4H, v17.4H, v18.4H
+    __ fmul(v7, __ T8H, v8, v9);                       //       fmul    v7.8H, v8.8H, v9.8H
+    __ mlav(v2, __ T4H, v3, v4);                       //       mla     v2.4H, v3.4H, v4.4H
+    __ mlav(v3, __ T8H, v4, v5);                       //       mla     v3.8H, v4.8H, v5.8H
+    __ mlav(v13, __ T2S, v14, v15);                    //       mla     v13.2S, v14.2S, v15.2S
+    __ mlav(v19, __ T4S, v20, v21);                    //       mla     v19.4S, v20.4S, v21.4S
+    __ fmla(v17, __ T2S, v18, v19);                    //       fmla    v17.2S, v18.2S, v19.2S
+    __ fmla(v16, __ T4S, v17, v18);                    //       fmla    v16.4S, v17.4S, v18.4S
+    __ fmla(v3, __ T2D, v4, v5);                       //       fmla    v3.2D, v4.2D, v5.2D
+    __ fmla(v1, __ T4H, v2, v3);                       //       fmla    v1.4H, v2.4H, v3.4H
+    __ fmla(v11, __ T8H, v12, v13);                    //       fmla    v11.8H, v12.8H, v13.8H
+    __ mlsv(v30, __ T4H, v31, v0);                     //       mls     v30.4H, v31.4H, v0.4H
+    __ mlsv(v5, __ T8H, v6, v7);                       //       mls     v5.8H, v6.8H, v7.8H
+    __ mlsv(v8, __ T2S, v9, v10);                      //       mls     v8.2S, v9.2S, v10.2S
+    __ mlsv(v15, __ T4S, v16, v17);                    //       mls     v15.4S, v16.4S, v17.4S
+    __ fmls(v29, __ T2S, v30, v31);                    //       fmls    v29.2S, v30.2S, v31.2S
+    __ fmls(v30, __ T4S, v31, v0);                     //       fmls    v30.4S, v31.4S, v0.4S
+    __ fmls(v0, __ T2D, v1, v2);                       //       fmls    v0.2D, v1.2D, v2.2D
+    __ fmls(v20, __ T4H, v21, v22);                    //       fmls    v20.4H, v21.4H, v22.4H
+    __ fmls(v7, __ T8H, v8, v9);                       //       fmls    v7.8H, v8.8H, v9.8H
+    __ fdiv(v20, __ T2S, v21, v22);                    //       fdiv    v20.2S, v21.2S, v22.2S
+    __ fdiv(v23, __ T4S, v24, v25);                    //       fdiv    v23.4S, v24.4S, v25.4S
+    __ fdiv(v28, __ T2D, v29, v30);                    //       fdiv    v28.2D, v29.2D, v30.2D
+    __ fdiv(v21, __ T4H, v22, v23);                    //       fdiv    v21.4H, v22.4H, v23.4H
+    __ fdiv(v27, __ T8H, v28, v29);                    //       fdiv    v27.8H, v28.8H, v29.8H
+    __ maxv(v25, __ T8B, v26, v27);                    //       smax    v25.8B, v26.8B, v27.8B
+    __ maxv(v5, __ T16B, v6, v7);                      //       smax    v5.16B, v6.16B, v7.16B
+    __ maxv(v1, __ T4H, v2, v3);                       //       smax    v1.4H, v2.4H, v3.4H
+    __ maxv(v23, __ T8H, v24, v25);                    //       smax    v23.8H, v24.8H, v25.8H
+    __ maxv(v16, __ T2S, v17, v18);                    //       smax    v16.2S, v17.2S, v18.2S
+    __ maxv(v31, __ T4S, v0, v1);                      //       smax    v31.4S, v0.4S, v1.4S
+    __ umaxv(v5, __ T8B, v6, v7);                      //       umax    v5.8B, v6.8B, v7.8B
+    __ umaxv(v12, __ T16B, v13, v14);                  //       umax    v12.16B, v13.16B, v14.16B
+    __ umaxv(v9, __ T4H, v10, v11);                    //       umax    v9.4H, v10.4H, v11.4H
+    __ umaxv(v28, __ T8H, v29, v30);                   //       umax    v28.8H, v29.8H, v30.8H
+    __ umaxv(v15, __ T2S, v16, v17);                   //       umax    v15.2S, v16.2S, v17.2S
+    __ umaxv(v29, __ T4S, v30, v31);                   //       umax    v29.4S, v30.4S, v31.4S
+    __ smaxp(v22, __ T8B, v23, v24);                   //       smaxp   v22.8B, v23.8B, v24.8B
+    __ smaxp(v31, __ T16B, v0, v1);                    //       smaxp   v31.16B, v0.16B, v1.16B
+    __ smaxp(v19, __ T4H, v20, v21);                   //       smaxp   v19.4H, v20.4H, v21.4H
+    __ smaxp(v31, __ T8H, v0, v1);                     //       smaxp   v31.8H, v0.8H, v1.8H
+    __ smaxp(v5, __ T2S, v6, v7);                      //       smaxp   v5.2S, v6.2S, v7.2S
+    __ smaxp(v14, __ T4S, v15, v16);                   //       smaxp   v14.4S, v15.4S, v16.4S
+    __ fmax(v18, __ T2S, v19, v20);                    //       fmax    v18.2S, v19.2S, v20.2S
     __ fmax(v31, __ T4S, v0, v1);                      //       fmax    v31.4S, v0.4S, v1.4S
-    __ fmax(v5, __ T2D, v6, v7);                       //       fmax    v5.2D, v6.2D, v7.2D
-    __ fmax(v14, __ T4H, v15, v16);                    //       fmax    v14.4H, v15.4H, v16.4H
-    __ fmax(v18, __ T8H, v19, v20);                    //       fmax    v18.8H, v19.8H, v20.8H
-    __ minv(v31, __ T8B, v0, v1);                      //       smin    v31.8B, v0.8B, v1.8B
-    __ minv(v18, __ T16B, v19, v20);                   //       smin    v18.16B, v19.16B, v20.16B
-    __ minv(v27, __ T4H, v28, v29);                    //       smin    v27.4H, v28.4H, v29.4H
-    __ minv(v20, __ T8H, v21, v22);                    //       smin    v20.8H, v21.8H, v22.8H
-    __ minv(v16, __ T2S, v17, v18);                    //       smin    v16.2S, v17.2S, v18.2S
-    __ minv(v12, __ T4S, v13, v14);                    //       smin    v12.4S, v13.4S, v14.4S
-    __ uminv(v11, __ T8B, v12, v13);                   //       umin    v11.8B, v12.8B, v13.8B
-    __ uminv(v9, __ T16B, v10, v11);                   //       umin    v9.16B, v10.16B, v11.16B
-    __ uminv(v6, __ T4H, v7, v8);                      //       umin    v6.4H, v7.4H, v8.4H
+    __ fmax(v18, __ T2D, v19, v20);                    //       fmax    v18.2D, v19.2D, v20.2D
+    __ fmax(v27, __ T4H, v28, v29);                    //       fmax    v27.4H, v28.4H, v29.4H
+    __ fmax(v20, __ T8H, v21, v22);                    //       fmax    v20.8H, v21.8H, v22.8H
+    __ minv(v16, __ T8B, v17, v18);                    //       smin    v16.8B, v17.8B, v18.8B
+    __ minv(v12, __ T16B, v13, v14);                   //       smin    v12.16B, v13.16B, v14.16B
+    __ minv(v11, __ T4H, v12, v13);                    //       smin    v11.4H, v12.4H, v13.4H
+    __ minv(v9, __ T8H, v10, v11);                     //       smin    v9.8H, v10.8H, v11.8H
+    __ minv(v6, __ T2S, v7, v8);                       //       smin    v6.2S, v7.2S, v8.2S
+    __ minv(v30, __ T4S, v31, v0);                     //       smin    v30.4S, v31.4S, v0.4S
+    __ uminv(v17, __ T8B, v18, v19);                   //       umin    v17.8B, v18.8B, v19.8B
+    __ uminv(v27, __ T16B, v28, v29);                  //       umin    v27.16B, v28.16B, v29.16B
+    __ uminv(v28, __ T4H, v29, v30);                   //       umin    v28.4H, v29.4H, v30.4H
     __ uminv(v30, __ T8H, v31, v0);                    //       umin    v30.8H, v31.8H, v0.8H
-    __ uminv(v17, __ T2S, v18, v19);                   //       umin    v17.2S, v18.2S, v19.2S
-    __ uminv(v27, __ T4S, v28, v29);                   //       umin    v27.4S, v28.4S, v29.4S
-    __ sminp(v28, __ T8B, v29, v30);                   //       sminp   v28.8B, v29.8B, v30.8B
-    __ sminp(v30, __ T16B, v31, v0);                   //       sminp   v30.16B, v31.16B, v0.16B
-    __ sminp(v7, __ T4H, v8, v9);                      //       sminp   v7.4H, v8.4H, v9.4H
-    __ sminp(v10, __ T8H, v11, v12);                   //       sminp   v10.8H, v11.8H, v12.8H
-    __ sminp(v20, __ T2S, v21, v22);                   //       sminp   v20.2S, v21.2S, v22.2S
-    __ sminp(v10, __ T4S, v11, v12);                   //       sminp   v10.4S, v11.4S, v12.4S
-    __ uminp(v4, __ T8B, v5, v6);                      //       uminp   v4.8B, v5.8B, v6.8B
-    __ uminp(v24, __ T16B, v25, v26);                  //       uminp   v24.16B, v25.16B, v26.16B
-    __ uminp(v17, __ T4H, v18, v19);                   //       uminp   v17.4H, v18.4H, v19.4H
-    __ uminp(v17, __ T8H, v18, v19);                   //       uminp   v17.8H, v18.8H, v19.8H
+    __ uminv(v7, __ T2S, v8, v9);                      //       umin    v7.2S, v8.2S, v9.2S
+    __ uminv(v10, __ T4S, v11, v12);                   //       umin    v10.4S, v11.4S, v12.4S
+    __ sminp(v20, __ T8B, v21, v22);                   //       sminp   v20.8B, v21.8B, v22.8B
+    __ sminp(v10, __ T16B, v11, v12);                  //       sminp   v10.16B, v11.16B, v12.16B
+    __ sminp(v4, __ T4H, v5, v6);                      //       sminp   v4.4H, v5.4H, v6.4H
+    __ sminp(v24, __ T8H, v25, v26);                   //       sminp   v24.8H, v25.8H, v26.8H
+    __ sminp(v17, __ T2S, v18, v19);                   //       sminp   v17.2S, v18.2S, v19.2S
+    __ sminp(v17, __ T4S, v18, v19);                   //       sminp   v17.4S, v18.4S, v19.4S
+    __ uminp(v22, __ T8B, v23, v24);                   //       uminp   v22.8B, v23.8B, v24.8B
+    __ uminp(v3, __ T16B, v4, v5);                     //       uminp   v3.16B, v4.16B, v5.16B
+    __ uminp(v29, __ T4H, v30, v31);                   //       uminp   v29.4H, v30.4H, v31.4H
+    __ uminp(v15, __ T8H, v16, v17);                   //       uminp   v15.8H, v16.8H, v17.8H
     __ uminp(v22, __ T2S, v23, v24);                   //       uminp   v22.2S, v23.2S, v24.2S
-    __ uminp(v3, __ T4S, v4, v5);                      //       uminp   v3.4S, v4.4S, v5.4S
-    __ umaxp(v29, __ T8B, v30, v31);                   //       umaxp   v29.8B, v30.8B, v31.8B
-    __ umaxp(v15, __ T16B, v16, v17);                  //       umaxp   v15.16B, v16.16B, v17.16B
-    __ umaxp(v22, __ T4H, v23, v24);                   //       umaxp   v22.4H, v23.4H, v24.4H
-    __ umaxp(v19, __ T8H, v20, v21);                   //       umaxp   v19.8H, v20.8H, v21.8H
-    __ umaxp(v19, __ T2S, v20, v21);                   //       umaxp   v19.2S, v20.2S, v21.2S
-    __ umaxp(v22, __ T4S, v23, v24);                   //       umaxp   v22.4S, v23.4S, v24.4S
-    __ sqdmulh(v2, __ T4H, v3, v4);                    //       sqdmulh v2.4H, v3.4H, v4.4H
-    __ sqdmulh(v15, __ T8H, v16, v17);                 //       sqdmulh v15.8H, v16.8H, v17.8H
-    __ sqdmulh(v6, __ T2S, v7, v8);                    //       sqdmulh v6.2S, v7.2S, v8.2S
-    __ sqdmulh(v12, __ T4S, v13, v14);                 //       sqdmulh v12.4S, v13.4S, v14.4S
-    __ shsubv(v16, __ T8B, v17, v18);                  //       shsub   v16.8B, v17.8B, v18.8B
-    __ shsubv(v11, __ T16B, v12, v13);                 //       shsub   v11.16B, v12.16B, v13.16B
-    __ shsubv(v13, __ T4H, v14, v15);                  //       shsub   v13.4H, v14.4H, v15.4H
-    __ shsubv(v23, __ T8H, v24, v25);                  //       shsub   v23.8H, v24.8H, v25.8H
-    __ shsubv(v1, __ T2S, v2, v3);                     //       shsub   v1.2S, v2.2S, v3.2S
-    __ shsubv(v30, __ T4S, v31, v0);                   //       shsub   v30.4S, v31.4S, v0.4S
-    __ fmin(v19, __ T2S, v20, v21);                    //       fmin    v19.2S, v20.2S, v21.2S
-    __ fmin(v5, __ T4S, v6, v7);                       //       fmin    v5.4S, v6.4S, v7.4S
-    __ fmin(v17, __ T2D, v18, v19);                    //       fmin    v17.2D, v18.2D, v19.2D
-    __ fmin(v2, __ T4H, v3, v4);                       //       fmin    v2.4H, v3.4H, v4.4H
-    __ fmin(v16, __ T8H, v17, v18);                    //       fmin    v16.8H, v17.8H, v18.8H
-    __ facgt(v22, __ T2S, v23, v24);                   //       facgt   v22.2S, v23.2S, v24.2S
-    __ facgt(v13, __ T4S, v14, v15);                   //       facgt   v13.4S, v14.4S, v15.4S
-    __ facgt(v10, __ T2D, v11, v12);                   //       facgt   v10.2D, v11.2D, v12.2D
-    __ facgt(v21, __ T4H, v22, v23);                   //       facgt   v21.4H, v22.4H, v23.4H
-    __ facgt(v29, __ T8H, v30, v31);                   //       facgt   v29.8H, v30.8H, v31.8H
+    __ uminp(v19, __ T4S, v20, v21);                   //       uminp   v19.4S, v20.4S, v21.4S
+    __ umaxp(v19, __ T8B, v20, v21);                   //       umaxp   v19.8B, v20.8B, v21.8B
+    __ umaxp(v22, __ T16B, v23, v24);                  //       umaxp   v22.16B, v23.16B, v24.16B
+    __ umaxp(v2, __ T4H, v3, v4);                      //       umaxp   v2.4H, v3.4H, v4.4H
+    __ umaxp(v15, __ T8H, v16, v17);                   //       umaxp   v15.8H, v16.8H, v17.8H
+    __ umaxp(v6, __ T2S, v7, v8);                      //       umaxp   v6.2S, v7.2S, v8.2S
+    __ umaxp(v12, __ T4S, v13, v14);                   //       umaxp   v12.4S, v13.4S, v14.4S
+    __ sqdmulh(v16, __ T4H, v17, v18);                 //       sqdmulh v16.4H, v17.4H, v18.4H
+    __ sqdmulh(v11, __ T8H, v12, v13);                 //       sqdmulh v11.8H, v12.8H, v13.8H
+    __ sqdmulh(v13, __ T2S, v14, v15);                 //       sqdmulh v13.2S, v14.2S, v15.2S
+    __ sqdmulh(v23, __ T4S, v24, v25);                 //       sqdmulh v23.4S, v24.4S, v25.4S
+    __ shsubv(v1, __ T8B, v2, v3);                     //       shsub   v1.8B, v2.8B, v3.8B
+    __ shsubv(v30, __ T16B, v31, v0);                  //       shsub   v30.16B, v31.16B, v0.16B
+    __ shsubv(v19, __ T4H, v20, v21);                  //       shsub   v19.4H, v20.4H, v21.4H
+    __ shsubv(v5, __ T8H, v6, v7);                     //       shsub   v5.8H, v6.8H, v7.8H
+    __ shsubv(v17, __ T2S, v18, v19);                  //       shsub   v17.2S, v18.2S, v19.2S
+    __ shsubv(v2, __ T4S, v3, v4);                     //       shsub   v2.4S, v3.4S, v4.4S
+    __ fmin(v16, __ T2S, v17, v18);                    //       fmin    v16.2S, v17.2S, v18.2S
+    __ fmin(v22, __ T4S, v23, v24);                    //       fmin    v22.4S, v23.4S, v24.4S
+    __ fmin(v13, __ T2D, v14, v15);                    //       fmin    v13.2D, v14.2D, v15.2D
+    __ fmin(v10, __ T4H, v11, v12);                    //       fmin    v10.4H, v11.4H, v12.4H
+    __ fmin(v21, __ T8H, v22, v23);                    //       fmin    v21.8H, v22.8H, v23.8H
+    __ facgt(v29, __ T2S, v30, v31);                   //       facgt   v29.2S, v30.2S, v31.2S
+    __ facgt(v27, __ T4S, v28, v29);                   //       facgt   v27.4S, v28.4S, v29.4S
+    __ facgt(v12, __ T2D, v13, v14);                   //       facgt   v12.2D, v13.2D, v14.2D
+    __ facgt(v27, __ T4H, v28, v29);                   //       facgt   v27.4H, v28.4H, v29.4H
+    __ facgt(v3, __ T8H, v4, v5);                      //       facgt   v3.8H, v4.8H, v5.8H
 
 // VectorScalarNEONInstruction
-    __ fmlavs(v6, __ T2S, v7, v8, 1);                  //       fmla    v6.2S, v7.2S, v8.S[1]
-    __ mulvs(v1, __ T4S, v2, v3, 3);                   //       mul     v1.4S, v2.4S, v3.S[3]
-    __ fmlavs(v15, __ T2D, v0, v1, 0);                 //       fmla    v15.2D, v0.2D, v1.D[0]
-    __ fmlsvs(v9, __ T2S, v10, v11, 1);                //       fmls    v9.2S, v10.2S, v11.S[1]
-    __ mulvs(v4, __ T4S, v5, v6, 2);                   //       mul     v4.4S, v5.4S, v6.S[2]
-    __ fmlsvs(v13, __ T2D, v14, v15, 1);               //       fmls    v13.2D, v14.2D, v15.D[1]
-    __ fmulxvs(v3, __ T2S, v4, v5, 0);                 //       fmulx   v3.2S, v4.2S, v5.S[0]
-    __ mulvs(v11, __ T4S, v12, v13, 2);                //       mul     v11.4S, v12.4S, v13.S[2]
-    __ fmulxvs(v12, __ T2D, v13, v14, 1);              //       fmulx   v12.2D, v13.2D, v14.D[1]
-    __ mulvs(v15, __ T4H, v0, v1, 0);                  //       mul     v15.4H, v0.4H, v1.H[0]
-    __ mulvs(v9, __ T8H, v10, v11, 6);                 //       mul     v9.8H, v10.8H, v11.H[6]
-    __ mulvs(v11, __ T2S, v12, v13, 0);                //       mul     v11.2S, v12.2S, v13.S[0]
-    __ mulvs(v1, __ T4S, v2, v3, 2);                   //       mul     v1.4S, v2.4S, v3.S[2]
+    __ fmlavs(v15, __ T2S, v0, v1, 0);                 //       fmla    v15.2S, v0.2S, v1.S[0]
+    __ mulvs(v9, __ T4S, v10, v11, 3);                 //       mul     v9.4S, v10.4S, v11.S[3]
+    __ fmlavs(v4, __ T2D, v5, v6, 1);                  //       fmla    v4.2D, v5.2D, v6.D[1]
+    __ fmlsvs(v13, __ T2S, v14, v15, 1);               //       fmls    v13.2S, v14.2S, v15.S[1]
+    __ mulvs(v3, __ T4S, v4, v5, 1);                   //       mul     v3.4S, v4.4S, v5.S[1]
+    __ fmlsvs(v11, __ T2D, v12, v13, 1);               //       fmls    v11.2D, v12.2D, v13.D[1]
+    __ fmulxvs(v12, __ T2S, v13, v14, 1);              //       fmulx   v12.2S, v13.2S, v14.S[1]
+    __ mulvs(v15, __ T4S, v0, v1, 0);                  //       mul     v15.4S, v0.4S, v1.S[0]
+    __ fmulxvs(v9, __ T2D, v10, v11, 1);               //       fmulx   v9.2D, v10.2D, v11.D[1]
+    __ mulvs(v11, __ T4H, v12, v13, 1);                //       mul     v11.4H, v12.4H, v13.H[1]
+    __ mulvs(v1, __ T8H, v2, v3, 4);                   //       mul     v1.8H, v2.8H, v3.H[4]
+    __ mulvs(v0, __ T2S, v1, v2, 1);                   //       mul     v0.2S, v1.2S, v2.S[1]
+    __ mulvs(v13, __ T4S, v14, v15, 3);                //       mul     v13.4S, v14.4S, v15.S[3]
 
 // NEONVectorCompare
-    __ cm(Assembler::GT, v18, __ T8B, v19, v20);       //       cmgt    v18.8B, v19.8B, v20.8B
-    __ cm(Assembler::GT, v0, __ T16B, v1, v2);         //       cmgt    v0.16B, v1.16B, v2.16B
-    __ cm(Assembler::GT, v25, __ T4H, v26, v27);       //       cmgt    v25.4H, v26.4H, v27.4H
-    __ cm(Assembler::GT, v26, __ T8H, v27, v28);       //       cmgt    v26.8H, v27.8H, v28.8H
-    __ cm(Assembler::GT, v23, __ T2S, v24, v25);       //       cmgt    v23.2S, v24.2S, v25.2S
-    __ cm(Assembler::GT, v2, __ T4S, v3, v4);          //       cmgt    v2.4S, v3.4S, v4.4S
-    __ cm(Assembler::GT, v18, __ T2D, v19, v20);       //       cmgt    v18.2D, v19.2D, v20.2D
-    __ cm(Assembler::GE, v12, __ T8B, v13, v14);       //       cmge    v12.8B, v13.8B, v14.8B
-    __ cm(Assembler::GE, v4, __ T16B, v5, v6);         //       cmge    v4.16B, v5.16B, v6.16B
-    __ cm(Assembler::GE, v28, __ T4H, v29, v30);       //       cmge    v28.4H, v29.4H, v30.4H
-    __ cm(Assembler::GE, v30, __ T8H, v31, v0);        //       cmge    v30.8H, v31.8H, v0.8H
-    __ cm(Assembler::GE, v29, __ T2S, v30, v31);       //       cmge    v29.2S, v30.2S, v31.2S
-    __ cm(Assembler::GE, v16, __ T4S, v17, v18);       //       cmge    v16.4S, v17.4S, v18.4S
-    __ cm(Assembler::GE, v27, __ T2D, v28, v29);       //       cmge    v27.2D, v28.2D, v29.2D
-    __ cm(Assembler::EQ, v6, __ T8B, v7, v8);          //       cmeq    v6.8B, v7.8B, v8.8B
-    __ cm(Assembler::EQ, v9, __ T16B, v10, v11);       //       cmeq    v9.16B, v10.16B, v11.16B
-    __ cm(Assembler::EQ, v29, __ T4H, v30, v31);       //       cmeq    v29.4H, v30.4H, v31.4H
-    __ cm(Assembler::EQ, v18, __ T8H, v19, v20);       //       cmeq    v18.8H, v19.8H, v20.8H
-    __ cm(Assembler::EQ, v7, __ T2S, v8, v9);          //       cmeq    v7.2S, v8.2S, v9.2S
-    __ cm(Assembler::EQ, v4, __ T4S, v5, v6);          //       cmeq    v4.4S, v5.4S, v6.4S
-    __ cm(Assembler::EQ, v7, __ T2D, v8, v9);          //       cmeq    v7.2D, v8.2D, v9.2D
-    __ cm(Assembler::HI, v15, __ T8B, v16, v17);       //       cmhi    v15.8B, v16.8B, v17.8B
-    __ cm(Assembler::HI, v9, __ T16B, v10, v11);       //       cmhi    v9.16B, v10.16B, v11.16B
-    __ cm(Assembler::HI, v23, __ T4H, v24, v25);       //       cmhi    v23.4H, v24.4H, v25.4H
-    __ cm(Assembler::HI, v8, __ T8H, v9, v10);         //       cmhi    v8.8H, v9.8H, v10.8H
-    __ cm(Assembler::HI, v2, __ T2S, v3, v4);          //       cmhi    v2.2S, v3.2S, v4.2S
-    __ cm(Assembler::HI, v28, __ T4S, v29, v30);       //       cmhi    v28.4S, v29.4S, v30.4S
-    __ cm(Assembler::HI, v21, __ T2D, v22, v23);       //       cmhi    v21.2D, v22.2D, v23.2D
-    __ cm(Assembler::HS, v31, __ T8B, v0, v1);         //       cmhs    v31.8B, v0.8B, v1.8B
-    __ cm(Assembler::HS, v5, __ T16B, v6, v7);         //       cmhs    v5.16B, v6.16B, v7.16B
-    __ cm(Assembler::HS, v27, __ T4H, v28, v29);       //       cmhs    v27.4H, v28.4H, v29.4H
-    __ cm(Assembler::HS, v0, __ T8H, v1, v2);          //       cmhs    v0.8H, v1.8H, v2.8H
-    __ cm(Assembler::HS, v17, __ T2S, v18, v19);       //       cmhs    v17.2S, v18.2S, v19.2S
-    __ cm(Assembler::HS, v15, __ T4S, v16, v17);       //       cmhs    v15.4S, v16.4S, v17.4S
-    __ cm(Assembler::HS, v4, __ T2D, v5, v6);          //       cmhs    v4.2D, v5.2D, v6.2D
-    __ fcm(Assembler::EQ, v26, __ T2S, v27, v28);      //       fcmeq   v26.2S, v27.2S, v28.2S
-    __ fcm(Assembler::EQ, v8, __ T4S, v9, v10);        //       fcmeq   v8.4S, v9.4S, v10.4S
-    __ fcm(Assembler::EQ, v28, __ T2D, v29, v30);      //       fcmeq   v28.2D, v29.2D, v30.2D
-    __ fcm(Assembler::GT, v22, __ T2S, v23, v24);      //       fcmgt   v22.2S, v23.2S, v24.2S
-    __ fcm(Assembler::GT, v27, __ T4S, v28, v29);      //       fcmgt   v27.4S, v28.4S, v29.4S
-    __ fcm(Assembler::GT, v27, __ T2D, v28, v29);      //       fcmgt   v27.2D, v28.2D, v29.2D
-    __ fcm(Assembler::GE, v25, __ T2S, v26, v27);      //       fcmge   v25.2S, v26.2S, v27.2S
-    __ fcm(Assembler::GE, v23, __ T4S, v24, v25);      //       fcmge   v23.4S, v24.4S, v25.4S
+    __ cm(Assembler::GT, v23, __ T8B, v24, v25);       //       cmgt    v23.8B, v24.8B, v25.8B
+    __ cm(Assembler::GT, v2, __ T16B, v3, v4);         //       cmgt    v2.16B, v3.16B, v4.16B
+    __ cm(Assembler::GT, v18, __ T4H, v19, v20);       //       cmgt    v18.4H, v19.4H, v20.4H
+    __ cm(Assembler::GT, v12, __ T8H, v13, v14);       //       cmgt    v12.8H, v13.8H, v14.8H
+    __ cm(Assembler::GT, v4, __ T2S, v5, v6);          //       cmgt    v4.2S, v5.2S, v6.2S
+    __ cm(Assembler::GT, v28, __ T4S, v29, v30);       //       cmgt    v28.4S, v29.4S, v30.4S
+    __ cm(Assembler::GT, v30, __ T2D, v31, v0);        //       cmgt    v30.2D, v31.2D, v0.2D
+    __ cm(Assembler::GE, v29, __ T8B, v30, v31);       //       cmge    v29.8B, v30.8B, v31.8B
+    __ cm(Assembler::GE, v16, __ T16B, v17, v18);      //       cmge    v16.16B, v17.16B, v18.16B
+    __ cm(Assembler::GE, v27, __ T4H, v28, v29);       //       cmge    v27.4H, v28.4H, v29.4H
+    __ cm(Assembler::GE, v6, __ T8H, v7, v8);          //       cmge    v6.8H, v7.8H, v8.8H
+    __ cm(Assembler::GE, v9, __ T2S, v10, v11);        //       cmge    v9.2S, v10.2S, v11.2S
+    __ cm(Assembler::GE, v29, __ T4S, v30, v31);       //       cmge    v29.4S, v30.4S, v31.4S
+    __ cm(Assembler::GE, v18, __ T2D, v19, v20);       //       cmge    v18.2D, v19.2D, v20.2D
+    __ cm(Assembler::EQ, v7, __ T8B, v8, v9);          //       cmeq    v7.8B, v8.8B, v9.8B
+    __ cm(Assembler::EQ, v4, __ T16B, v5, v6);         //       cmeq    v4.16B, v5.16B, v6.16B
+    __ cm(Assembler::EQ, v7, __ T4H, v8, v9);          //       cmeq    v7.4H, v8.4H, v9.4H
+    __ cm(Assembler::EQ, v15, __ T8H, v16, v17);       //       cmeq    v15.8H, v16.8H, v17.8H
+    __ cm(Assembler::EQ, v9, __ T2S, v10, v11);        //       cmeq    v9.2S, v10.2S, v11.2S
+    __ cm(Assembler::EQ, v23, __ T4S, v24, v25);       //       cmeq    v23.4S, v24.4S, v25.4S
+    __ cm(Assembler::EQ, v8, __ T2D, v9, v10);         //       cmeq    v8.2D, v9.2D, v10.2D
+    __ cm(Assembler::HI, v2, __ T8B, v3, v4);          //       cmhi    v2.8B, v3.8B, v4.8B
+    __ cm(Assembler::HI, v28, __ T16B, v29, v30);      //       cmhi    v28.16B, v29.16B, v30.16B
+    __ cm(Assembler::HI, v21, __ T4H, v22, v23);       //       cmhi    v21.4H, v22.4H, v23.4H
+    __ cm(Assembler::HI, v31, __ T8H, v0, v1);         //       cmhi    v31.8H, v0.8H, v1.8H
+    __ cm(Assembler::HI, v5, __ T2S, v6, v7);          //       cmhi    v5.2S, v6.2S, v7.2S
+    __ cm(Assembler::HI, v27, __ T4S, v28, v29);       //       cmhi    v27.4S, v28.4S, v29.4S
+    __ cm(Assembler::HI, v0, __ T2D, v1, v2);          //       cmhi    v0.2D, v1.2D, v2.2D
+    __ cm(Assembler::HS, v17, __ T8B, v18, v19);       //       cmhs    v17.8B, v18.8B, v19.8B
+    __ cm(Assembler::HS, v15, __ T16B, v16, v17);      //       cmhs    v15.16B, v16.16B, v17.16B
+    __ cm(Assembler::HS, v4, __ T4H, v5, v6);          //       cmhs    v4.4H, v5.4H, v6.4H
+    __ cm(Assembler::HS, v26, __ T8H, v27, v28);       //       cmhs    v26.8H, v27.8H, v28.8H
+    __ cm(Assembler::HS, v8, __ T2S, v9, v10);         //       cmhs    v8.2S, v9.2S, v10.2S
+    __ cm(Assembler::HS, v28, __ T4S, v29, v30);       //       cmhs    v28.4S, v29.4S, v30.4S
+    __ cm(Assembler::HS, v22, __ T2D, v23, v24);       //       cmhs    v22.2D, v23.2D, v24.2D
+    __ fcm(Assembler::EQ, v27, __ T2S, v28, v29);      //       fcmeq   v27.2S, v28.2S, v29.2S
+    __ fcm(Assembler::EQ, v27, __ T4S, v28, v29);      //       fcmeq   v27.4S, v28.4S, v29.4S
+    __ fcm(Assembler::EQ, v25, __ T2D, v26, v27);      //       fcmeq   v25.2D, v26.2D, v27.2D
+    __ fcm(Assembler::GT, v23, __ T2S, v24, v25);      //       fcmgt   v23.2S, v24.2S, v25.2S
+    __ fcm(Assembler::GT, v0, __ T4S, v1, v2);         //       fcmgt   v0.4S, v1.4S, v2.4S
+    __ fcm(Assembler::GT, v4, __ T2D, v5, v6);         //       fcmgt   v4.2D, v5.2D, v6.2D
+    __ fcm(Assembler::GE, v6, __ T2S, v7, v8);         //       fcmge   v6.2S, v7.2S, v8.2S
+    __ fcm(Assembler::GE, v18, __ T4S, v19, v20);      //       fcmge   v18.4S, v19.4S, v20.4S
     __ fcm(Assembler::GE, v0, __ T2D, v1, v2);         //       fcmge   v0.2D, v1.2D, v2.2D
 
 // SVEComparisonWithZero
-    __ sve_fcm(Assembler::EQ, p2, __ D, p0, z6, 0.0);  //       fcmeq   p2.d, p0/z, z6.d, #0.0
-    __ sve_fcm(Assembler::GT, p2, __ S, p2, z15, 0.0); //       fcmgt   p2.s, p2/z, z15.s, #0.0
-    __ sve_fcm(Assembler::GE, p3, __ S, p7, z5, 0.0);  //       fcmge   p3.s, p7/z, z5.s, #0.0
-    __ sve_fcm(Assembler::LT, p3, __ D, p5, z20, 0.0); //       fcmlt   p3.d, p5/z, z20.d, #0.0
-    __ sve_fcm(Assembler::LE, p3, __ S, p4, z11, 0.0); //       fcmle   p3.s, p4/z, z11.s, #0.0
-    __ sve_fcm(Assembler::NE, p15, __ D, p0, z6, 0.0); //       fcmne   p15.d, p0/z, z6.d, #0.0
+    __ sve_fcm(Assembler::EQ, p2, __ S, p2, z15, 0.0); //       fcmeq   p2.s, p2/z, z15.s, #0.0
+    __ sve_fcm(Assembler::GT, p3, __ S, p7, z5, 0.0);  //       fcmgt   p3.s, p7/z, z5.s, #0.0
+    __ sve_fcm(Assembler::GE, p3, __ D, p5, z20, 0.0); //       fcmge   p3.d, p5/z, z20.d, #0.0
+    __ sve_fcm(Assembler::LT, p3, __ S, p4, z11, 0.0); //       fcmlt   p3.s, p4/z, z11.s, #0.0
+    __ sve_fcm(Assembler::LE, p15, __ D, p0, z6, 0.0); //       fcmle   p15.d, p0/z, z6.d, #0.0
+    __ sve_fcm(Assembler::NE, p6, __ D, p0, z30, 0.0); //       fcmne   p6.d, p0/z, z30.d, #0.0
 
 // SVEComparisonWithImm
-    __ sve_cmp(Assembler::EQ, p6, __ D, p0, z30, 11);  //       cmpeq   p6.d, p0/z, z30.d, #11
-    __ sve_cmp(Assembler::GT, p11, __ H, p3, z29, 12); //       cmpgt   p11.h, p3/z, z29.h, #12
-    __ sve_cmp(Assembler::GE, p8, __ B, p0, z24, -2);  //       cmpge   p8.b, p0/z, z24.b, #-2
-    __ sve_cmp(Assembler::LT, p5, __ H, p6, z16, 7);   //       cmplt   p5.h, p6/z, z16.h, #7
-    __ sve_cmp(Assembler::LE, p6, __ S, p4, z4, -12);  //       cmple   p6.s, p4/z, z4.s, #-12
-    __ sve_cmp(Assembler::NE, p0, __ S, p4, z19, -3);  //       cmpne   p0.s, p4/z, z19.s, #-3
-    __ sve_cmp(Assembler::HS, p7, __ B, p4, z12, 15);  //       cmphs   p7.b, p4/z, z12.b, #15
-    __ sve_cmp(Assembler::HI, p10, __ B, p1, z23, 30); //       cmphi   p10.b, p1/z, z23.b, #30
-    __ sve_cmp(Assembler::LS, p9, __ D, p4, z13, 67);  //       cmpls   p9.d, p4/z, z13.d, #67
-    __ sve_cmp(Assembler::LO, p3, __ D, p0, z2, 16);   //       cmplo   p3.d, p0/z, z2.d, #16
+    __ sve_cmp(Assembler::EQ, p13, __ D, p3, z22, -3); //       cmpeq   p13.d, p3/z, z22.d, #-3
+    __ sve_cmp(Assembler::GT, p14, __ D, p1, z17, -14); //      cmpgt   p14.d, p1/z, z17.d, #-14
+    __ sve_cmp(Assembler::GE, p7, __ S, p2, z10, 11);  //       cmpge   p7.s, p2/z, z10.s, #11
+    __ sve_cmp(Assembler::LT, p11, __ B, p5, z12, 1);  //       cmplt   p11.b, p5/z, z12.b, #1
+    __ sve_cmp(Assembler::LE, p2, __ S, p4, z1, 2);    //       cmple   p2.s, p4/z, z1.s, #2
+    __ sve_cmp(Assembler::NE, p6, __ H, p0, z14, 1);   //       cmpne   p6.h, p0/z, z14.h, #1
+    __ sve_cmp(Assembler::HS, p1, __ S, p1, z21, 25);  //       cmphs   p1.s, p1/z, z21.s, #25
+    __ sve_cmp(Assembler::HI, p3, __ H, p7, z19, 70);  //       cmphi   p3.h, p7/z, z19.h, #70
+    __ sve_cmp(Assembler::LS, p8, __ B, p7, z6, 12);   //       cmpls   p8.b, p7/z, z6.b, #12
+    __ sve_cmp(Assembler::LO, p2, __ S, p5, z6, 55);   //       cmplo   p2.s, p5/z, z6.s, #55
 
 // SpecialCases
     __ ccmn(zr, zr, 3u, Assembler::LE);                //       ccmn    xzr, xzr, #3, LE
@@ -1210,241 +1216,241 @@
     __ fmovd(v0, -1.0625);                             //       fmov d0, #-1.0625
 
 // LSEOp
-    __ swp(Assembler::xword, r6, r16, r20);            //       swp     x6, x16, [x20]
-    __ ldadd(Assembler::xword, r13, r12, r20);         //       ldadd   x13, x12, [x20]
-    __ ldbic(Assembler::xword, r8, r25, r20);          //       ldclr   x8, x25, [x20]
-    __ ldeor(Assembler::xword, r19, r0, r11);          //       ldeor   x19, x0, [x11]
-    __ ldorr(Assembler::xword, r24, r6, r20);          //       ldset   x24, x6, [x20]
-    __ ldsmin(Assembler::xword, zr, r14, r16);         //       ldsmin  xzr, x14, [x16]
-    __ ldsmax(Assembler::xword, r6, r0, r7);           //       ldsmax  x6, x0, [x7]
-    __ ldumin(Assembler::xword, r15, r19, r26);        //       ldumin  x15, x19, [x26]
-    __ ldumax(Assembler::xword, r9, r10, r23);         //       ldumax  x9, x10, [x23]
+    __ swp(Assembler::xword, r12, r20, r8);            //       swp     x12, x20, [x8]
+    __ ldadd(Assembler::xword, r25, r20, r19);         //       ldadd   x25, x20, [x19]
+    __ ldbic(Assembler::xword, r0, r11, r24);          //       ldclr   x0, x11, [x24]
+    __ ldeor(Assembler::xword, r6, r20, sp);           //       ldeor   x6, x20, [sp]
+    __ ldorr(Assembler::xword, r14, r16, r6);          //       ldset   x14, x16, [x6]
+    __ ldsmin(Assembler::xword, r0, r7, r15);          //       ldsmin  x0, x7, [x15]
+    __ ldsmax(Assembler::xword, r19, r26, r9);         //       ldsmax  x19, x26, [x9]
+    __ ldumin(Assembler::xword, r10, r23, r21);        //       ldumin  x10, x23, [x21]
+    __ ldumax(Assembler::xword, r22, r28, r2);         //       ldumax  x22, x28, [x2]
 
 // LSEOp
-    __ swpa(Assembler::xword, r21, r22, r28);          //       swpa    x21, x22, [x28]
-    __ ldadda(Assembler::xword, r2, r3, r15);          //       ldadda  x2, x3, [x15]
-    __ ldbica(Assembler::xword, r19, r20, r7);         //       ldclra  x19, x20, [x7]
-    __ ldeora(Assembler::xword, r4, r29, r7);          //       ldeora  x4, x29, [x7]
-    __ ldorra(Assembler::xword, r0, r9, r16);          //       ldseta  x0, x9, [x16]
-    __ ldsmina(Assembler::xword, r20, r23, r4);        //       ldsmina x20, x23, [x4]
-    __ ldsmaxa(Assembler::xword, r16, r10, r23);       //       ldsmaxa x16, x10, [x23]
-    __ ldumina(Assembler::xword, r11, r25, r6);        //       ldumina x11, x25, [x6]
-    __ ldumaxa(Assembler::xword, zr, r16, r13);        //       ldumaxa xzr, x16, [x13]
+    __ swpa(Assembler::xword, r3, r15, r19);           //       swpa    x3, x15, [x19]
+    __ ldadda(Assembler::xword, r20, r7, r4);          //       ldadda  x20, x7, [x4]
+    __ ldbica(Assembler::xword, r29, r7, r0);          //       ldclra  x29, x7, [x0]
+    __ ldeora(Assembler::xword, r9, r16, r20);         //       ldeora  x9, x16, [x20]
+    __ ldorra(Assembler::xword, r23, r4, r16);         //       ldseta  x23, x4, [x16]
+    __ ldsmina(Assembler::xword, r10, r23, r11);       //       ldsmina x10, x23, [x11]
+    __ ldsmaxa(Assembler::xword, r25, r6, sp);         //       ldsmaxa x25, x6, [sp]
+    __ ldumina(Assembler::xword, r16, r13, r23);       //       ldumina x16, x13, [x23]
+    __ ldumaxa(Assembler::xword, r12, r1, r14);        //       ldumaxa x12, x1, [x14]
 
 // LSEOp
-    __ swpal(Assembler::xword, r23, r12, r1);          //       swpal   x23, x12, [x1]
-    __ ldaddal(Assembler::xword, r14, r9, r21);        //       ldaddal x14, x9, [x21]
-    __ ldbical(Assembler::xword, r16, r26, r15);       //       ldclral x16, x26, [x15]
-    __ ldeoral(Assembler::xword, r4, r4, r15);         //       ldeoral x4, x4, [x15]
-    __ ldorral(Assembler::xword, r8, r6, r30);         //       ldsetal x8, x6, [x30]
-    __ ldsminal(Assembler::xword, r4, r29, r17);       //       ldsminal        x4, x29, [x17]
-    __ ldsmaxal(Assembler::xword, r29, r26, r9);       //       ldsmaxal        x29, x26, [x9]
-    __ lduminal(Assembler::xword, r15, r2, r11);       //       lduminal        x15, x2, [x11]
-    __ ldumaxal(Assembler::xword, r29, r3, r7);        //       ldumaxal        x29, x3, [x7]
+    __ swpal(Assembler::xword, r9, r21, r16);          //       swpal   x9, x21, [x16]
+    __ ldaddal(Assembler::xword, r26, r15, r4);        //       ldaddal x26, x15, [x4]
+    __ ldbical(Assembler::xword, r4, r16, r8);         //       ldclral x4, x16, [x8]
+    __ ldeoral(Assembler::xword, r6, r30, r4);         //       ldeoral x6, x30, [x4]
+    __ ldorral(Assembler::xword, r29, r17, r29);       //       ldsetal x29, x17, [x29]
+    __ ldsminal(Assembler::xword, r26, r9, r15);       //       ldsminal        x26, x9, [x15]
+    __ ldsmaxal(Assembler::xword, r2, r11, r29);       //       ldsmaxal        x2, x11, [x29]
+    __ lduminal(Assembler::xword, r3, r7, r1);         //       lduminal        x3, x7, [x1]
+    __ ldumaxal(Assembler::xword, r27, r21, r15);      //       ldumaxal        x27, x21, [x15]
 
 // LSEOp
-    __ swpl(Assembler::xword, r1, r27, r21);           //       swpl    x1, x27, [x21]
-    __ ldaddl(Assembler::xword, r16, r14, r8);         //       ldaddl  x16, x14, [x8]
-    __ ldbicl(Assembler::xword, r16, r22, r25);        //       ldclrl  x16, x22, [x25]
-    __ ldeorl(Assembler::xword, r5, r20, r21);         //       ldeorl  x5, x20, [x21]
-    __ ldorrl(Assembler::xword, r16, r23, r16);        //       ldsetl  x16, x23, [x16]
-    __ ldsminl(Assembler::xword, r30, r20, r20);       //       ldsminl x30, x20, [x20]
-    __ ldsmaxl(Assembler::xword, r0, r4, r19);         //       ldsmaxl x0, x4, [x19]
-    __ lduminl(Assembler::xword, r24, r4, r20);        //       lduminl x24, x4, [x20]
-    __ ldumaxl(Assembler::xword, r4, r24, r26);        //       ldumaxl x4, x24, [x26]
+    __ swpl(Assembler::xword, r14, r8, r15);           //       swpl    x14, x8, [x15]
+    __ ldaddl(Assembler::xword, r22, r25, r5);         //       ldaddl  x22, x25, [x5]
+    __ ldbicl(Assembler::xword, r20, r21, r15);        //       ldclrl  x20, x21, [x15]
+    __ ldeorl(Assembler::xword, r23, r16, r30);        //       ldeorl  x23, x16, [x30]
+    __ ldorrl(Assembler::xword, r20, r20, r0);         //       ldsetl  x20, x20, [x0]
+    __ ldsminl(Assembler::xword, r4, r19, r24);        //       ldsminl x4, x19, [x24]
+    __ ldsmaxl(Assembler::xword, r4, r20, r4);         //       ldsmaxl x4, x20, [x4]
+    __ lduminl(Assembler::xword, r24, r26, r19);       //       lduminl x24, x26, [x19]
+    __ ldumaxl(Assembler::xword, r2, r8, r8);          //       ldumaxl x2, x8, [x8]
 
 // LSEOp
-    __ swp(Assembler::word, r19, r2, r8);              //       swp     w19, w2, [x8]
-    __ ldadd(Assembler::word, r8, r14, r24);           //       ldadd   w8, w14, [x24]
-    __ ldbic(Assembler::word, r16, zr, r22);           //       ldclr   w16, wzr, [x22]
-    __ ldeor(Assembler::word, r4, zr, r1);             //       ldeor   w4, wzr, [x1]
-    __ ldorr(Assembler::word, r10, r20, r12);          //       ldset   w10, w20, [x12]
-    __ ldsmin(Assembler::word, r0, r9, r7);            //       ldsmin  w0, w9, [x7]
-    __ ldsmax(Assembler::word, r24, r16, r4);          //       ldsmax  w24, w16, [x4]
-    __ ldumin(Assembler::word, r27, r6, r10);          //       ldumin  w27, w6, [x10]
-    __ ldumax(Assembler::word, r27, r24, r13);         //       ldumax  w27, w24, [x13]
+    __ swp(Assembler::word, r14, r24, r15);            //       swp     w14, w24, [x15]
+    __ ldadd(Assembler::word, zr, r22, r4);            //       ldadd   wzr, w22, [x4]
+    __ ldbic(Assembler::word, zr, r1, r10);            //       ldclr   wzr, w1, [x10]
+    __ ldeor(Assembler::word, r20, r12, r0);           //       ldeor   w20, w12, [x0]
+    __ ldorr(Assembler::word, r9, r7, r24);            //       ldset   w9, w7, [x24]
+    __ ldsmin(Assembler::word, r16, r4, r27);          //       ldsmin  w16, w4, [x27]
+    __ ldsmax(Assembler::word, r6, r10, r27);          //       ldsmax  w6, w10, [x27]
+    __ ldumin(Assembler::word, r24, r13, r16);         //       ldumin  w24, w13, [x16]
+    __ ldumax(Assembler::word, zr, r22, r22);          //       ldumax  wzr, w22, [x22]
 
 // LSEOp
-    __ swpa(Assembler::word, r16, zr, r22);            //       swpa    w16, wzr, [x22]
-    __ ldadda(Assembler::word, r22, r20, sp);          //       ldadda  w22, w20, [sp]
-    __ ldbica(Assembler::word, r29, r9, r14);          //       ldclra  w29, w9, [x14]
-    __ ldeora(Assembler::word, r20, r7, r20);          //       ldeora  w20, w7, [x20]
-    __ ldorra(Assembler::word, r28, r9, r11);          //       ldseta  w28, w9, [x11]
-    __ ldsmina(Assembler::word, r14, r12, r20);        //       ldsmina w14, w12, [x20]
-    __ ldsmaxa(Assembler::word, r1, r24, r9);          //       ldsmaxa w1, w24, [x9]
-    __ ldumina(Assembler::word, r19, r13, r19);        //       ldumina w19, w13, [x19]
-    __ ldumaxa(Assembler::word, r16, r16, r5);         //       ldumaxa w16, w16, [x5]
+    __ swpa(Assembler::word, r20, zr, r29);            //       swpa    w20, wzr, [x29]
+    __ ldadda(Assembler::word, r9, r14, r20);          //       ldadda  w9, w14, [x20]
+    __ ldbica(Assembler::word, r7, r20, r28);          //       ldclra  w7, w20, [x28]
+    __ ldeora(Assembler::word, r9, r11, r14);          //       ldeora  w9, w11, [x14]
+    __ ldorra(Assembler::word, r12, r20, r1);          //       ldseta  w12, w20, [x1]
+    __ ldsmina(Assembler::word, r24, r9, r19);         //       ldsmina w24, w9, [x19]
+    __ ldsmaxa(Assembler::word, r13, r19, r15);        //       ldsmaxa w13, w19, [x15]
+    __ ldumina(Assembler::word, r16, r5, r0);          //       ldumina w16, w5, [x0]
+    __ ldumaxa(Assembler::word, r3, r12, r8);          //       ldumaxa w3, w12, [x8]
 
 // LSEOp
-    __ swpal(Assembler::word, r0, r3, r12);            //       swpal   w0, w3, [x12]
-    __ ldaddal(Assembler::word, r8, r15, r15);         //       ldaddal w8, w15, [x15]
-    __ ldbical(Assembler::word, r16, r4, r15);         //       ldclral w16, w4, [x15]
-    __ ldeoral(Assembler::word, r30, r5, r0);          //       ldeoral w30, w5, [x0]
-    __ ldorral(Assembler::word, r10, r22, r27);        //       ldsetal w10, w22, [x27]
-    __ ldsminal(Assembler::word, r3, r0, r9);          //       ldsminal        w3, w0, [x9]
-    __ ldsmaxal(Assembler::word, r19, r29, r10);       //       ldsmaxal        w19, w29, [x10]
-    __ lduminal(Assembler::word, r24, r4, r20);        //       lduminal        w24, w4, [x20]
-    __ ldumaxal(Assembler::word, r7, r24, r29);        //       ldumaxal        w7, w24, [x29]
+    __ swpal(Assembler::word, r15, r15, r16);          //       swpal   w15, w15, [x16]
+    __ ldaddal(Assembler::word, r4, r15, r30);         //       ldaddal w4, w15, [x30]
+    __ ldbical(Assembler::word, r5, r0, r10);          //       ldclral w5, w0, [x10]
+    __ ldeoral(Assembler::word, r22, r27, r3);         //       ldeoral w22, w27, [x3]
+    __ ldorral(Assembler::word, r0, r9, r19);          //       ldsetal w0, w9, [x19]
+    __ ldsminal(Assembler::word, r29, r10, r24);       //       ldsminal        w29, w10, [x24]
+    __ ldsmaxal(Assembler::word, r4, r20, r7);         //       ldsmaxal        w4, w20, [x7]
+    __ lduminal(Assembler::word, r24, r29, r14);       //       lduminal        w24, w29, [x14]
+    __ ldumaxal(Assembler::word, r21, r11, r27);       //       ldumaxal        w21, w11, [x27]
 
 // LSEOp
-    __ swpl(Assembler::word, r14, r21, r11);           //       swpl    w14, w21, [x11]
-    __ ldaddl(Assembler::word, r27, r13, r15);         //       ldaddl  w27, w13, [x15]
-    __ ldbicl(Assembler::word, zr, r17, r14);          //       ldclrl  wzr, w17, [x14]
-    __ ldeorl(Assembler::word, r3, r30, r16);          //       ldeorl  w3, w30, [x16]
-    __ ldorrl(Assembler::word, r22, r20, r7);          //       ldsetl  w22, w20, [x7]
-    __ ldsminl(Assembler::word, r20, r3, r1);          //       ldsminl w20, w3, [x1]
-    __ ldsmaxl(Assembler::word, r26, r19, r9);         //       ldsmaxl w26, w19, [x9]
-    __ lduminl(Assembler::word, r16, r17, r21);        //       lduminl w16, w17, [x21]
-    __ ldumaxl(Assembler::word, r0, r4, r2);           //       ldumaxl w0, w4, [x2]
+    __ swpl(Assembler::word, r13, r16, sp);            //       swpl    w13, w16, [sp]
+    __ ldaddl(Assembler::word, r17, r14, r3);          //       ldaddl  w17, w14, [x3]
+    __ ldbicl(Assembler::word, r30, r16, r22);         //       ldclrl  w30, w16, [x22]
+    __ ldeorl(Assembler::word, r20, r7, r20);          //       ldeorl  w20, w7, [x20]
+    __ ldorrl(Assembler::word, r3, r1, r26);           //       ldsetl  w3, w1, [x26]
+    __ ldsminl(Assembler::word, r19, r9, r16);         //       ldsminl w19, w9, [x16]
+    __ ldsmaxl(Assembler::word, r17, r21, r0);         //       ldsmaxl w17, w21, [x0]
+    __ lduminl(Assembler::word, r4, r2, r24);          //       lduminl w4, w2, [x24]
+    __ ldumaxl(Assembler::word, r14, r6, r11);         //       ldumaxl w14, w6, [x11]
 
 // SHA3SIMDOp
-    __ bcax(v24, __ T16B, v14, v6, v11);               //       bcax            v24.16B, v14.16B, v6.16B, v11.16B
-    __ eor3(v21, __ T16B, v14, v17, v30);              //       eor3            v21.16B, v14.16B, v17.16B, v30.16B
-    __ rax1(v12, __ T2D, v3, v3);                      //       rax1            v12.2D, v3.2D, v3.2D
-    __ xar(v23, __ T2D, v9, v3, 49);                   //       xar             v23.2D, v9.2D, v3.2D, #49
+    __ bcax(v21, __ T16B, v14, v17, v30);              //       bcax            v21.16B, v14.16B, v17.16B, v30.16B
+    __ eor3(v12, __ T16B, v3, v3, v23);                //       eor3            v12.16B, v3.16B, v3.16B, v23.16B
+    __ rax1(v9, __ T2D, v3, v24);                      //       rax1            v9.2D, v3.2D, v24.2D
+    __ xar(v28, __ T2D, v3, v19, 47);                  //       xar             v28.2D, v3.2D, v19.2D, #47
 
 // SHA512SIMDOp
-    __ sha512h(v28, __ T2D, v3, v19);                  //       sha512h         q28, q3, v19.2D
-    __ sha512h2(v23, __ T2D, v7, v26);                 //       sha512h2                q23, q7, v26.2D
-    __ sha512su0(v21, __ T2D, v14);                    //       sha512su0               v21.2D, v14.2D
-    __ sha512su1(v5, __ T2D, v8, v26);                 //       sha512su1               v5.2D, v8.2D, v26.2D
+    __ sha512h(v7, __ T2D, v26, v21);                  //       sha512h         q7, q26, v21.2D
+    __ sha512h2(v14, __ T2D, v5, v8);                  //       sha512h2                q14, q5, v8.2D
+    __ sha512su0(v26, __ T2D, v5);                     //       sha512su0               v26.2D, v5.2D
+    __ sha512su1(v22, __ T2D, v18, v17);               //       sha512su1               v22.2D, v18.2D, v17.2D
 
 // SVEBinaryImmOp
-    __ sve_add(z5, __ S, 146u);                        //       add     z5.s, z5.s, #0x92
-    __ sve_sub(z17, __ B, 31u);                        //       sub     z17.b, z17.b, #0x1f
-    __ sve_and(z9, __ S, 16744448u);                   //       and     z9.s, z9.s, #0xff8000
-    __ sve_eor(z12, __ H, 33279u);                     //       eor     z12.h, z12.h, #0x81ff
-    __ sve_orr(z11, __ H, 49663u);                     //       orr     z11.h, z11.h, #0xc1ff
+    __ sve_add(z0, __ B, 79u);                         //       add     z0.b, z0.b, #0x4f
+    __ sve_sub(z20, __ H, 65u);                        //       sub     z20.h, z20.h, #0x41
+    __ sve_and(z12, __ H, 33279u);                     //       and     z12.h, z12.h, #0x81ff
+    __ sve_eor(z11, __ H, 49663u);                     //       eor     z11.h, z11.h, #0xc1ff
+    __ sve_orr(z31, __ S, 2147484159u);                //       orr     z31.s, z31.s, #0x800001ff
 
 // SVEBinaryImmOp
-    __ sve_add(z31, __ S, 72u);                        //       add     z31.s, z31.s, #0x48
-    __ sve_sub(z16, __ H, 218u);                       //       sub     z16.h, z16.h, #0xda
-    __ sve_and(z23, __ D, 562675075514368u);           //       and     z23.d, z23.d, #0x1ffc000000000
-    __ sve_eor(z8, __ B, 243u);                        //       eor     z8.b, z8.b, #0xf3
-    __ sve_orr(z10, __ B, 239u);                       //       orr     z10.b, z10.b, #0xef
+    __ sve_add(z15, __ D, 188u);                       //       add     z15.d, z15.d, #0xbc
+    __ sve_sub(z28, __ S, 64u);                        //       sub     z28.s, z28.s, #0x40
+    __ sve_and(z8, __ B, 243u);                        //       and     z8.b, z8.b, #0xf3
+    __ sve_eor(z10, __ B, 239u);                       //       eor     z10.b, z10.b, #0xef
+    __ sve_orr(z22, __ S, 32768u);                     //       orr     z22.s, z22.s, #0x8000
 
 // SVEBinaryImmOp
-    __ sve_add(z22, __ S, 5u);                         //       add     z22.s, z22.s, #0x5
-    __ sve_sub(z3, __ S, 209u);                        //       sub     z3.s, z3.s, #0xd1
-    __ sve_and(z5, __ D, 17870287719452639231u);       //       and     z5.d, z5.d, #0xf80003ffffffffff
-    __ sve_eor(z17, __ B, 128u);                       //       eor     z17.b, z17.b, #0x80
-    __ sve_orr(z30, __ H, 49663u);                     //       orr     z30.h, z30.h, #0xc1ff
+    __ sve_add(z23, __ D, 46u);                        //       add     z23.d, z23.d, #0x2e
+    __ sve_sub(z26, __ D, 154u);                       //       sub     z26.d, z26.d, #0x9a
+    __ sve_and(z17, __ B, 128u);                       //       and     z17.b, z17.b, #0x80
+    __ sve_eor(z30, __ H, 49663u);                     //       eor     z30.h, z30.h, #0xc1ff
+    __ sve_orr(z2, __ D, 18444492273897963519u);       //       orr     z2.d, z2.d, #0xfff80000001fffff
 
 // SVEBinaryImmOp
-    __ sve_add(z2, __ D, 168u);                        //       add     z2.d, z2.d, #0xa8
-    __ sve_sub(z23, __ S, 240u);                       //       sub     z23.s, z23.s, #0xf0
-    __ sve_and(z12, __ H, 1u);                         //       and     z12.h, z12.h, #0x1
-    __ sve_eor(z15, __ S, 1u);                         //       eor     z15.s, z15.s, #0x1
-    __ sve_orr(z19, __ D, 18446532967477018623u);      //       orr     z19.d, z19.d, #0xffff3fffffffffff
+    __ sve_add(z22, __ D, 103u);                       //       add     z22.d, z22.d, #0x67
+    __ sve_sub(z8, __ B, 5u);                          //       sub     z8.b, z8.b, #0x5
+    __ sve_and(z15, __ S, 1u);                         //       and     z15.s, z15.s, #0x1
+    __ sve_eor(z19, __ D, 18446532967477018623u);      //       eor     z19.d, z19.d, #0xffff3fffffffffff
+    __ sve_orr(z13, __ S, 7168u);                      //       orr     z13.s, z13.s, #0x1c00
 
 // SVEBinaryImmOp
-    __ sve_add(z13, __ S, 179u);                       //       add     z13.s, z13.s, #0xb3
-    __ sve_sub(z2, __ B, 88u);                         //       sub     z2.b, z2.b, #0x58
-    __ sve_and(z20, __ H, 57855u);                     //       and     z20.h, z20.h, #0xe1ff
-    __ sve_eor(z24, __ H, 33279u);                     //       eor     z24.h, z24.h, #0x81ff
-    __ sve_orr(z20, __ S, 917504u);                    //       orr     z20.s, z20.s, #0xe0000
+    __ sve_add(z1, __ H, 164u);                        //       add     z1.h, z1.h, #0xa4
+    __ sve_sub(z12, __ S, 194u);                       //       sub     z12.s, z12.s, #0xc2
+    __ sve_and(z24, __ H, 33279u);                     //       and     z24.h, z24.h, #0x81ff
+    __ sve_eor(z20, __ S, 917504u);                    //       eor     z20.s, z20.s, #0xe0000
+    __ sve_orr(z21, __ H, 57343u);                     //       orr     z21.h, z21.h, #0xdfff
 
 // SVEBinaryImmOp
-    __ sve_add(z21, __ H, 247u);                       //       add     z21.h, z21.h, #0xf7
-    __ sve_sub(z22, __ D, 253u);                       //       sub     z22.d, z22.d, #0xfd
-    __ sve_and(z26, __ S, 1610637312u);                //       and     z26.s, z26.s, #0x60006000
-    __ sve_eor(z11, __ H, 51199u);                     //       eor     z11.h, z11.h, #0xc7ff
-    __ sve_orr(z5, __ B, 128u);                        //       orr     z5.b, z5.b, #0x80
+    __ sve_add(z31, __ D, 213u);                       //       add     z31.d, z31.d, #0xd5
+    __ sve_sub(z18, __ S, 120u);                       //       sub     z18.s, z18.s, #0x78
+    __ sve_and(z11, __ H, 51199u);                     //       and     z11.h, z11.h, #0xc7ff
+    __ sve_eor(z5, __ B, 128u);                        //       eor     z5.b, z5.b, #0x80
+    __ sve_orr(z2, __ B, 124u);                        //       orr     z2.b, z2.b, #0x7c
 
 // SVEVectorOp
-    __ sve_add(z2, __ H, z7, z10);                     //       add     z2.h, z7.h, z10.h
-    __ sve_sub(z19, __ H, z4, z26);                    //       sub     z19.h, z4.h, z26.h
-    __ sve_fadd(z2, __ S, z3, z30);                    //       fadd    z2.s, z3.s, z30.s
-    __ sve_fmul(z20, __ D, z5, z20);                   //       fmul    z20.d, z5.d, z20.d
-    __ sve_fsub(z29, __ S, z13, z13);                  //       fsub    z29.s, z13.s, z13.s
-    __ sve_sqadd(z14, __ H, z30, z1);                  //       sqadd   z14.h, z30.h, z1.h
-    __ sve_sqsub(z28, __ D, z3, z3);                   //       sqsub   z28.d, z3.d, z3.d
-    __ sve_uqadd(z9, __ B, z25, z9);                   //       uqadd   z9.b, z25.b, z9.b
-    __ sve_uqsub(z26, __ B, z10, z14);                 //       uqsub   z26.b, z10.b, z14.b
-    __ sve_abs(z20, __ D, p6, z7);                     //       abs     z20.d, p6/m, z7.d
-    __ sve_add(z20, __ D, p4, z6);                     //       add     z20.d, p4/m, z20.d, z6.d
-    __ sve_and(z13, __ H, p0, z29);                    //       and     z13.h, p0/m, z13.h, z29.h
-    __ sve_asr(z9, __ B, p0, z1);                      //       asr     z9.b, p0/m, z9.b, z1.b
-    __ sve_bic(z27, __ B, p6, z15);                    //       bic     z27.b, p6/m, z27.b, z15.b
-    __ sve_clz(z4, __ D, p7, z17);                     //       clz     z4.d, p7/m, z17.d
-    __ sve_cnt(z2, __ B, p0, z24);                     //       cnt     z2.b, p0/m, z24.b
-    __ sve_eor(z26, __ B, p7, z13);                    //       eor     z26.b, p7/m, z26.b, z13.b
-    __ sve_lsl(z22, __ D, p3, z16);                    //       lsl     z22.d, p3/m, z22.d, z16.d
-    __ sve_lsr(z17, __ D, p1, z11);                    //       lsr     z17.d, p1/m, z17.d, z11.d
-    __ sve_mul(z16, __ B, p0, z16);                    //       mul     z16.b, p0/m, z16.b, z16.b
-    __ sve_neg(z28, __ D, p1, z23);                    //       neg     z28.d, p1/m, z23.d
-    __ sve_not(z28, __ S, p4, z10);                    //       not     z28.s, p4/m, z10.s
-    __ sve_orr(z17, __ S, p7, z7);                     //       orr     z17.s, p7/m, z17.s, z7.s
-    __ sve_rbit(z4, __ H, p3, z24);                    //       rbit    z4.h, p3/m, z24.h
-    __ sve_revb(z9, __ H, p2, z11);                    //       revb    z9.h, p2/m, z11.h
-    __ sve_smax(z4, __ S, p5, z22);                    //       smax    z4.s, p5/m, z4.s, z22.s
-    __ sve_smin(z4, __ H, p0, z15);                    //       smin    z4.h, p0/m, z4.h, z15.h
-    __ sve_umax(z4, __ D, p7, z26);                    //       umax    z4.d, p7/m, z4.d, z26.d
-    __ sve_umin(z5, __ H, p5, z26);                    //       umin    z5.h, p5/m, z5.h, z26.h
-    __ sve_sub(z31, __ B, p0, z25);                    //       sub     z31.b, p0/m, z31.b, z25.b
-    __ sve_fabs(z8, __ D, p1, z3);                     //       fabs    z8.d, p1/m, z3.d
-    __ sve_fadd(z7, __ D, p6, z24);                    //       fadd    z7.d, p6/m, z7.d, z24.d
-    __ sve_fdiv(z24, __ S, p7, z17);                   //       fdiv    z24.s, p7/m, z24.s, z17.s
-    __ sve_fmax(z10, __ S, p3, z30);                   //       fmax    z10.s, p3/m, z10.s, z30.s
-    __ sve_fmin(z8, __ S, p6, z29);                    //       fmin    z8.s, p6/m, z8.s, z29.s
-    __ sve_fmul(z31, __ D, p5, z31);                   //       fmul    z31.d, p5/m, z31.d, z31.d
-    __ sve_fneg(z0, __ D, p5, z7);                     //       fneg    z0.d, p5/m, z7.d
-    __ sve_frintm(z29, __ S, p6, z22);                 //       frintm  z29.s, p6/m, z22.s
-    __ sve_frintn(z29, __ S, p6, z20);                 //       frintn  z29.s, p6/m, z20.s
-    __ sve_frintp(z6, __ S, p4, z18);                  //       frintp  z6.s, p4/m, z18.s
-    __ sve_fsqrt(z26, __ S, p5, z8);                   //       fsqrt   z26.s, p5/m, z8.s
-    __ sve_fsub(z19, __ S, p2, z28);                   //       fsub    z19.s, p2/m, z19.s, z28.s
-    __ sve_fmad(z17, __ D, p1, z30, z20);              //       fmad    z17.d, p1/m, z30.d, z20.d
-    __ sve_fmla(z28, __ D, p3, z17, z14);              //       fmla    z28.d, p3/m, z17.d, z14.d
-    __ sve_fmls(z10, __ S, p6, z11, z24);              //       fmls    z10.s, p6/m, z11.s, z24.s
-    __ sve_fmsb(z11, __ D, p3, z28, z23);              //       fmsb    z11.d, p3/m, z28.d, z23.d
-    __ sve_fnmad(z20, __ D, p7, z23, z20);             //       fnmad   z20.d, p7/m, z23.d, z20.d
-    __ sve_fnmsb(z24, __ D, p0, z27, z6);              //       fnmsb   z24.d, p0/m, z27.d, z6.d
-    __ sve_fnmla(z13, __ D, p3, z4, z13);              //       fnmla   z13.d, p3/m, z4.d, z13.d
-    __ sve_fnmls(z26, __ S, p5, z20, z6);              //       fnmls   z26.s, p5/m, z20.s, z6.s
-    __ sve_mla(z29, __ S, p7, z0, z29);                //       mla     z29.s, p7/m, z0.s, z29.s
-    __ sve_mls(z3, __ D, p1, z5, z8);                  //       mls     z3.d, p1/m, z5.d, z8.d
-    __ sve_and(z13, z17, z13);                         //       and     z13.d, z17.d, z13.d
-    __ sve_eor(z8, z10, z8);                           //       eor     z8.d, z10.d, z8.d
-    __ sve_orr(z19, z0, z29);                          //       orr     z19.d, z0.d, z29.d
-    __ sve_bic(z16, z13, z23);                         //       bic     z16.d, z13.d, z23.d
-    __ sve_uzp1(z23, __ B, z30, z13);                  //       uzp1    z23.b, z30.b, z13.b
-    __ sve_uzp2(z25, __ H, z22, z0);                   //       uzp2    z25.h, z22.h, z0.h
-    __ sve_fabd(z25, __ S, p7, z11);                   //       fabd    z25.s, p7/m, z25.s, z11.s
-    __ sve_bext(z14, __ H, z23, z22);                  //       bext    z14.h, z23.h, z22.h
-    __ sve_bdep(z5, __ H, z18, z0);                    //       bdep    z5.h, z18.h, z0.h
-    __ sve_eor3(z9, z2, z3);                           //       eor3    z9.d, z9.d, z2.d, z3.d
-    __ sve_sqadd(z14, __ H, p1, z29);                  //       sqadd   z14.h, p1/m, z14.h, z29.h
-    __ sve_sqsub(z14, __ D, p5, z4);                   //       sqsub   z14.d, p5/m, z14.d, z4.d
-    __ sve_uqadd(z27, __ S, p3, z22);                  //       uqadd   z27.s, p3/m, z27.s, z22.s
-    __ sve_uqsub(z31, __ S, p6, z11);                  //       uqsub   z31.s, p6/m, z31.s, z11.s
+    __ sve_add(z19, __ H, z4, z26);                    //       add     z19.h, z4.h, z26.h
+    __ sve_sub(z2, __ B, z3, z30);                     //       sub     z2.b, z3.b, z30.b
+    __ sve_fadd(z20, __ D, z5, z20);                   //       fadd    z20.d, z5.d, z20.d
+    __ sve_fmul(z29, __ S, z13, z13);                  //       fmul    z29.s, z13.s, z13.s
+    __ sve_fsub(z14, __ S, z30, z1);                   //       fsub    z14.s, z30.s, z1.s
+    __ sve_sqadd(z28, __ D, z3, z3);                   //       sqadd   z28.d, z3.d, z3.d
+    __ sve_sqsub(z9, __ B, z25, z9);                   //       sqsub   z9.b, z25.b, z9.b
+    __ sve_uqadd(z26, __ B, z10, z14);                 //       uqadd   z26.b, z10.b, z14.b
+    __ sve_uqsub(z20, __ D, z26, z7);                  //       uqsub   z20.d, z26.d, z7.d
+    __ sve_abs(z20, __ D, p4, z6);                     //       abs     z20.d, p4/m, z6.d
+    __ sve_add(z13, __ H, p0, z29);                    //       add     z13.h, p0/m, z13.h, z29.h
+    __ sve_and(z9, __ B, p0, z1);                      //       and     z9.b, p0/m, z9.b, z1.b
+    __ sve_asr(z27, __ B, p6, z15);                    //       asr     z27.b, p6/m, z27.b, z15.b
+    __ sve_bic(z4, __ D, p7, z17);                     //       bic     z4.d, p7/m, z4.d, z17.d
+    __ sve_clz(z2, __ B, p0, z24);                     //       clz     z2.b, p0/m, z24.b
+    __ sve_cnt(z26, __ B, p7, z13);                    //       cnt     z26.b, p7/m, z13.b
+    __ sve_eor(z22, __ D, p3, z16);                    //       eor     z22.d, p3/m, z22.d, z16.d
+    __ sve_lsl(z17, __ D, p1, z11);                    //       lsl     z17.d, p1/m, z17.d, z11.d
+    __ sve_lsr(z16, __ B, p0, z16);                    //       lsr     z16.b, p0/m, z16.b, z16.b
+    __ sve_mul(z28, __ D, p1, z23);                    //       mul     z28.d, p1/m, z28.d, z23.d
+    __ sve_neg(z28, __ S, p4, z10);                    //       neg     z28.s, p4/m, z10.s
+    __ sve_not(z17, __ S, p7, z7);                     //       not     z17.s, p7/m, z7.s
+    __ sve_orr(z4, __ H, p3, z24);                     //       orr     z4.h, p3/m, z4.h, z24.h
+    __ sve_rbit(z9, __ B, p2, z11);                    //       rbit    z9.b, p2/m, z11.b
+    __ sve_revb(z4, __ S, p5, z22);                    //       revb    z4.s, p5/m, z22.s
+    __ sve_smax(z4, __ H, p0, z15);                    //       smax    z4.h, p0/m, z4.h, z15.h
+    __ sve_smin(z4, __ D, p7, z26);                    //       smin    z4.d, p7/m, z4.d, z26.d
+    __ sve_umax(z5, __ H, p5, z26);                    //       umax    z5.h, p5/m, z5.h, z26.h
+    __ sve_umin(z31, __ B, p0, z25);                   //       umin    z31.b, p0/m, z31.b, z25.b
+    __ sve_sub(z8, __ S, p1, z3);                      //       sub     z8.s, p1/m, z8.s, z3.s
+    __ sve_fabs(z7, __ D, p6, z24);                    //       fabs    z7.d, p6/m, z24.d
+    __ sve_fadd(z24, __ S, p7, z17);                   //       fadd    z24.s, p7/m, z24.s, z17.s
+    __ sve_fdiv(z10, __ S, p3, z30);                   //       fdiv    z10.s, p3/m, z10.s, z30.s
+    __ sve_fmax(z8, __ S, p6, z29);                    //       fmax    z8.s, p6/m, z8.s, z29.s
+    __ sve_fmin(z31, __ D, p5, z31);                   //       fmin    z31.d, p5/m, z31.d, z31.d
+    __ sve_fmul(z0, __ D, p5, z7);                     //       fmul    z0.d, p5/m, z0.d, z7.d
+    __ sve_fneg(z29, __ S, p6, z22);                   //       fneg    z29.s, p6/m, z22.s
+    __ sve_frintm(z29, __ S, p6, z20);                 //       frintm  z29.s, p6/m, z20.s
+    __ sve_frintn(z6, __ S, p4, z18);                  //       frintn  z6.s, p4/m, z18.s
+    __ sve_frintp(z26, __ S, p5, z8);                  //       frintp  z26.s, p5/m, z8.s
+    __ sve_fsqrt(z19, __ S, p2, z28);                  //       fsqrt   z19.s, p2/m, z28.s
+    __ sve_fsub(z17, __ D, p1, z30);                   //       fsub    z17.d, p1/m, z17.d, z30.d
+    __ sve_fmad(z24, __ S, p7, z14, z17);              //       fmad    z24.s, p7/m, z14.s, z17.s
+    __ sve_fmla(z19, __ D, p2, z26, z11);              //       fmla    z19.d, p2/m, z26.d, z11.d
+    __ sve_fmls(z0, __ D, p2, z15, z28);               //       fmls    z0.d, p2/m, z15.d, z28.d
+    __ sve_fmsb(z23, __ D, p5, z28, z23);              //       fmsb    z23.d, p5/m, z28.d, z23.d
+    __ sve_fnmad(z29, __ S, p6, z0, z27);              //       fnmad   z29.s, p6/m, z0.s, z27.s
+    __ sve_fnmsb(z23, __ S, p3, z12, z4);              //       fnmsb   z23.s, p3/m, z12.s, z4.s
+    __ sve_fnmla(z31, __ S, p6, z23, z20);             //       fnmla   z31.s, p6/m, z23.s, z20.s
+    __ sve_fnmls(z2, __ D, p7, z29, z0);               //       fnmls   z2.d, p7/m, z29.d, z0.d
+    __ sve_mla(z23, __ H, p0, z4, z5);                 //       mla     z23.h, p0/m, z4.h, z5.h
+    __ sve_mls(z28, __ H, p3, z17, z13);               //       mls     z28.h, p3/m, z17.h, z13.h
+    __ sve_and(z8, z10, z8);                           //       and     z8.d, z10.d, z8.d
+    __ sve_eor(z19, z0, z29);                          //       eor     z19.d, z0.d, z29.d
+    __ sve_orr(z16, z13, z23);                         //       orr     z16.d, z13.d, z23.d
+    __ sve_bic(z23, z30, z13);                         //       bic     z23.d, z30.d, z13.d
+    __ sve_uzp1(z25, __ H, z22, z0);                   //       uzp1    z25.h, z22.h, z0.h
+    __ sve_uzp2(z25, __ H, z30, z11);                  //       uzp2    z25.h, z30.h, z11.h
+    __ sve_fabd(z14, __ S, p5, z22);                   //       fabd    z14.s, p5/m, z14.s, z22.s
+    __ sve_bext(z5, __ H, z18, z0);                    //       bext    z5.h, z18.h, z0.h
+    __ sve_bdep(z9, __ D, z2, z3);                     //       bdep    z9.d, z2.d, z3.d
+    __ sve_eor3(z14, z4, z29);                         //       eor3    z14.d, z14.d, z4.d, z29.d
+    __ sve_sqadd(z14, __ D, p5, z4);                   //       sqadd   z14.d, p5/m, z14.d, z4.d
+    __ sve_sqsub(z27, __ S, p3, z22);                  //       sqsub   z27.s, p3/m, z27.s, z22.s
+    __ sve_uqadd(z31, __ S, p6, z11);                  //       uqadd   z31.s, p6/m, z31.s, z11.s
+    __ sve_uqsub(z12, __ B, p4, z28);                  //       uqsub   z12.b, p4/m, z12.b, z28.b
 
 // SVEReductionOp
-    __ sve_andv(v12, __ B, p4, z28);                   //       andv b12, p4, z28.b
-    __ sve_orv(v28, __ D, p4, z4);                     //       orv d28, p4, z4.d
-    __ sve_eorv(v6, __ S, p0, z15);                    //       eorv s6, p0, z15.s
-    __ sve_smaxv(v1, __ S, p5, z18);                   //       smaxv s1, p5, z18.s
-    __ sve_sminv(v2, __ H, p2, z4);                    //       sminv h2, p2, z4.h
-    __ sve_umaxv(v11, __ S, p2, z28);                  //       umaxv s11, p2, z28.s
-    __ sve_uminv(v3, __ H, p5, z31);                   //       uminv h3, p5, z31.h
-    __ sve_fminv(v24, __ S, p5, z15);                  //       fminv s24, p5, z15.s
-    __ sve_fmaxv(v6, __ S, p3, z8);                    //       fmaxv s6, p3, z8.s
-    __ sve_fadda(v21, __ D, p7, z4);                   //       fadda d21, p7, d21, z4.d
-    __ sve_uaddv(v24, __ B, p5, z6);                   //       uaddv d24, p5, z6.b
+    __ sve_andv(v28, __ D, p4, z4);                    //       andv d28, p4, z4.d
+    __ sve_orv(v6, __ S, p0, z15);                     //       orv s6, p0, z15.s
+    __ sve_eorv(v1, __ S, p5, z18);                    //       eorv s1, p5, z18.s
+    __ sve_smaxv(v2, __ H, p2, z4);                    //       smaxv h2, p2, z4.h
+    __ sve_sminv(v11, __ S, p2, z28);                  //       sminv s11, p2, z28.s
+    __ sve_umaxv(v3, __ H, p5, z31);                   //       umaxv h3, p5, z31.h
+    __ sve_uminv(v24, __ H, p5, z15);                  //       uminv h24, p5, z15.h
+    __ sve_fminv(v6, __ S, p3, z8);                    //       fminv s6, p3, z8.s
+    __ sve_fmaxv(v21, __ D, p7, z4);                   //       fmaxv d21, p7, z4.d
+    __ sve_fadda(v24, __ S, p5, z6);                   //       fadda s24, p5, s24, z6.s
+    __ sve_uaddv(v4, __ D, p2, z9);                    //       uaddv d4, p2, z9.d
 
 // AddWideNEONOp
-    __ saddwv(v4, v5, __ T8H, v6, __ T8B);             //       saddw   v4.8H, v5.8H, v6.8B
-    __ saddwv2(v10, v11, __ T8H, v12, __ T16B);        //       saddw2  v10.8H, v11.8H, v12.16B
-    __ saddwv(v9, v10, __ T4S, v11, __ T4H);           //       saddw   v9.4S, v10.4S, v11.4H
-    __ saddwv2(v25, v26, __ T4S, v27, __ T8H);         //       saddw2  v25.4S, v26.4S, v27.8H
-    __ saddwv(v10, v11, __ T2D, v12, __ T2S);          //       saddw   v10.2D, v11.2D, v12.2S
-    __ saddwv2(v5, v6, __ T2D, v7, __ T4S);            //       saddw2  v5.2D, v6.2D, v7.4S
-    __ uaddwv(v31, v0, __ T8H, v1, __ T8B);            //       uaddw   v31.8H, v0.8H, v1.8B
-    __ uaddwv2(v22, v23, __ T8H, v24, __ T16B);        //       uaddw2  v22.8H, v23.8H, v24.16B
-    __ uaddwv(v25, v26, __ T4S, v27, __ T4H);          //       uaddw   v25.4S, v26.4S, v27.4H
-    __ uaddwv2(v15, v16, __ T4S, v17, __ T8H);         //       uaddw2  v15.4S, v16.4S, v17.8H
-    __ uaddwv(v3, v4, __ T2D, v5, __ T2S);             //       uaddw   v3.2D, v4.2D, v5.2S
-    __ uaddwv2(v18, v19, __ T2D, v20, __ T4S);         //       uaddw2  v18.2D, v19.2D, v20.4S
+    __ saddwv(v10, v11, __ T8H, v12, __ T8B);          //       saddw   v10.8H, v11.8H, v12.8B
+    __ saddwv2(v5, v6, __ T8H, v7, __ T16B);           //       saddw2  v5.8H, v6.8H, v7.16B
+    __ saddwv(v31, v0, __ T4S, v1, __ T4H);            //       saddw   v31.4S, v0.4S, v1.4H
+    __ saddwv2(v22, v23, __ T4S, v24, __ T8H);         //       saddw2  v22.4S, v23.4S, v24.8H
+    __ saddwv(v25, v26, __ T2D, v27, __ T2S);          //       saddw   v25.2D, v26.2D, v27.2S
+    __ saddwv2(v15, v16, __ T2D, v17, __ T4S);         //       saddw2  v15.2D, v16.2D, v17.4S
+    __ uaddwv(v3, v4, __ T8H, v5, __ T8B);             //       uaddw   v3.8H, v4.8H, v5.8B
+    __ uaddwv2(v18, v19, __ T8H, v20, __ T16B);        //       uaddw2  v18.8H, v19.8H, v20.16B
+    __ uaddwv(v14, v15, __ T4S, v16, __ T4H);          //       uaddw   v14.4S, v15.4S, v16.4H
+    __ uaddwv2(v10, v11, __ T4S, v12, __ T8H);         //       uaddw2  v10.4S, v11.4S, v12.8H
+    __ uaddwv(v2, v3, __ T2D, v4, __ T2S);             //       uaddw   v2.2D, v3.2D, v4.2S
+    __ uaddwv2(v10, v11, __ T2D, v12, __ T4S);         //       uaddw2  v10.2D, v11.2D, v12.4S
 
     __ bind(forth);
 
@@ -1463,312 +1469,313 @@
     0x9101a1a0,     0xb10a5cc8,     0xd10810aa,     0xf10fd061,
     0x120cb166,     0x321764bc,     0x52174681,     0x720c0227,
     0x9241018e,     0xb25a2969,     0xd278b411,     0xf26aad01,
-    0x14000000,     0x17ffffd7,     0x140004c9,     0x94000000,
-    0x97ffffd4,     0x940004c6,     0x3400000a,     0x34fffa2a,
-    0x3400986a,     0x35000008,     0x35fff9c8,     0x35009808,
-    0xb400000b,     0xb4fff96b,     0xb40097ab,     0xb500001d,
-    0xb5fff91d,     0xb500975d,     0x10000013,     0x10fff8b3,
-    0x100096f3,     0x90000013,     0x36300016,     0x3637f836,
-    0x36309676,     0x3758000c,     0x375ff7cc,     0x3758960c,
+    0x14000000,     0x17ffffd7,     0x140004cb,     0x94000000,
+    0x97ffffd4,     0x940004c8,     0x3400000a,     0x34fffa2a,
+    0x340098aa,     0x35000008,     0x35fff9c8,     0x35009848,
+    0xb400000b,     0xb4fff96b,     0xb40097eb,     0xb500001d,
+    0xb5fff91d,     0xb500979d,     0x10000013,     0x10fff8b3,
+    0x10009733,     0x90000013,     0x36300016,     0x3637f836,
+    0x363096b6,     0x3758000c,     0x375ff7cc,     0x3758964c,
     0x128313a0,     0x528a32c7,     0x7289173b,     0x92ab3acc,
     0xd2a0bf94,     0xf2c285e8,     0x9358722f,     0x330e652f,
     0x53067f3b,     0x93577c53,     0xb34a1aac,     0xd35a4016,
     0x13946c63,     0x93c3dbc8,     0x54000000,     0x54fff5a0,
-    0x540093e0,     0x54000001,     0x54fff541,     0x54009381,
-    0x54000002,     0x54fff4e2,     0x54009322,     0x54000002,
-    0x54fff482,     0x540092c2,     0x54000003,     0x54fff423,
-    0x54009263,     0x54000003,     0x54fff3c3,     0x54009203,
-    0x54000004,     0x54fff364,     0x540091a4,     0x54000005,
-    0x54fff305,     0x54009145,     0x54000006,     0x54fff2a6,
-    0x540090e6,     0x54000007,     0x54fff247,     0x54009087,
-    0x54000008,     0x54fff1e8,     0x54009028,     0x54000009,
-    0x54fff189,     0x54008fc9,     0x5400000a,     0x54fff12a,
-    0x54008f6a,     0x5400000b,     0x54fff0cb,     0x54008f0b,
-    0x5400000c,     0x54fff06c,     0x54008eac,     0x5400000d,
-    0x54fff00d,     0x54008e4d,     0x5400000e,     0x54ffefae,
-    0x54008dee,     0x5400000f,     0x54ffef4f,     0x54008d8f,
+    0x54009420,     0x54000001,     0x54fff541,     0x540093c1,
+    0x54000002,     0x54fff4e2,     0x54009362,     0x54000002,
+    0x54fff482,     0x54009302,     0x54000003,     0x54fff423,
+    0x540092a3,     0x54000003,     0x54fff3c3,     0x54009243,
+    0x54000004,     0x54fff364,     0x540091e4,     0x54000005,
+    0x54fff305,     0x54009185,     0x54000006,     0x54fff2a6,
+    0x54009126,     0x54000007,     0x54fff247,     0x540090c7,
+    0x54000008,     0x54fff1e8,     0x54009068,     0x54000009,
+    0x54fff189,     0x54009009,     0x5400000a,     0x54fff12a,
+    0x54008faa,     0x5400000b,     0x54fff0cb,     0x54008f4b,
+    0x5400000c,     0x54fff06c,     0x54008eec,     0x5400000d,
+    0x54fff00d,     0x54008e8d,     0x5400000e,     0x54ffefae,
+    0x54008e2e,     0x5400000f,     0x54ffef4f,     0x54008dcf,
     0xd40658e1,     0xd4014d22,     0xd4046543,     0xd4273f60,
     0xd44cad80,     0xd503201f,     0xd503203f,     0xd503205f,
     0xd503209f,     0xd50320bf,     0xd503219f,     0xd50323bf,
     0xd503239f,     0xd50321df,     0xd50323ff,     0xd50323df,
     0xd503211f,     0xd503233f,     0xd503231f,     0xd503215f,
     0xd503237f,     0xd503235f,     0xd69f03e0,     0xd6bf03e0,
-    0xd5033fdf,     0xd50330ff,     0xd503207f,     0xd50320ff,
-    0xd5033e9f,     0xd50332bf,     0xd61f0200,     0xd63f0280,
-    0xdac123ea,     0xdac127fb,     0xdac12be8,     0xdac12fe0,
-    0xdac133e1,     0xdac137f5,     0xdac13bf1,     0xdac13ffd,
-    0xdac147fd,     0xd61f0b9f,     0xd61f0c3f,     0xd63f0aff,
-    0xd63f0ebf,     0xd51b4434,     0xd51b4216,     0xd53b443b,
-    0xd53b4213,     0xd53b00eb,     0xd53b0030,     0xdac143e6,
-    0xc8117c80,     0xc80afed8,     0xc85f7e6a,     0xc85ffca1,
-    0xc89ffd1e,     0xc8dffe2c,     0x88097cee,     0x8801fe05,
-    0x885f7d82,     0x885ffd8a,     0x889fff83,     0x88dfff4e,
-    0x481e7dca,     0x4815fd2d,     0x485f7f76,     0x485ffe7c,
-    0x489fffcb,     0x48dffc53,     0x08027c37,     0x0800fe0c,
-    0x085f7ded,     0x085ffeb1,     0x089ffd6d,     0x08dffd1e,
-    0xc87f3578,     0xc87feaa1,     0xc83b506d,     0xc82c87a6,
-    0x887f1166,     0x887f93d0,     0x883e32a4,     0x883bf12f,
-    0xf80011f9,     0xb81b1022,     0x381ea354,     0x79002fd7,
-    0xf85cf39a,     0xb8580309,     0x385e218c,     0x784051e1,
-    0x389e11d8,     0x789fa1f8,     0x79c01865,     0xb881131b,
-    0xfc5dd3ad,     0xbc5d1137,     0xfc00900b,     0xbc181015,
-    0xf818ec7d,     0xb81b8c91,     0x381efc40,     0x78007c3d,
-    0xf857beb0,     0xb8413dd4,     0x385fddd6,     0x78409e2f,
-    0x389eddea,     0x789e7d94,     0x78de3d55,     0xb8805c13,
-    0xfc5cadc0,     0xbc428c23,     0xfc1a2dc4,     0xbc1caf92,
-    0xf81475f6,     0xb81f95d1,     0x381e757e,     0x78014561,
-    0xf8402436,     0xb85896e2,     0x385f4763,     0x785db4f0,
-    0x3880374f,     0x789e25e7,     0x78dd0563,     0xb88166f9,
-    0xfc529540,     0xbc4374d3,     0xfc1166ae,     0xbc1ba6c0,
-    0xf820ea7b,     0xb82d68c8,     0x38367a04,     0x782f4b59,
-    0xf878c8a4,     0xb8674a24,     0x386b78f1,     0x78776bc0,
-    0x38a15aca,     0x78bedbd5,     0x78fcd94b,     0xb8aa4a7c,
-    0xfc6ecbbe,     0xbc65d8a8,     0xfc2de919,     0xbc3a7b11,
-    0xf91f1193,     0xb91ed5f7,     0x391ec9bd,     0x79182ceb,
-    0xf95d4b0a,     0xb9581010,     0x395fc034,     0x795fb221,
-    0x399d8731,     0x799efb3b,     0x79dd1a2e,     0xb998e4ea,
-    0xfd583723,     0xbd5ea12c,     0xfd18dc38,     0xbd1b0e83,
-    0x58ffda82,     0x1800001d,     0xf885d1c0,     0xd8ffda20,
-    0xf8a77820,     0xf9980220,     0x1a030301,     0x3a140311,
-    0x5a0d000b,     0x7a07015c,     0x9a1001e4,     0xba140182,
-    0xda0d01bd,     0xfa0c00ce,     0x0b31f194,     0x2b206d7b,
-    0xcb29f027,     0x6b210f63,     0x8b2cb34d,     0xab2a88b1,
-    0xcb2f511e,     0xeb3332f3,     0x3a4533aa,     0x7a4d312b,
-    0xba442146,     0xfa42818c,     0x3a466a02,     0x7a4b68ed,
-    0xba4a9b6b,     0xfa4dd86d,     0x1a8a637a,     0x1a9cd6aa,
-    0x5a9bd137,     0x5a8fd7aa,     0x9a95233e,     0x9a95c620,
-    0xda9422b0,     0xda8397d3,     0x5ac00173,     0x5ac00418,
-    0x5ac00b3b,     0x5ac0106e,     0x5ac0162e,     0xdac001e7,
-    0xdac00798,     0xdac00b31,     0xdac00f42,     0xdac010bc,
-    0xdac01759,     0xdac1021b,     0xdac104d1,     0xdac10995,
-    0xdac10c80,     0xdac1136c,     0xdac11791,     0xdac1185c,
-    0xdac11d51,     0xd71f09ee,     0xd71f0dc3,     0xd73f0b2f,
-    0xd73f0e6e,     0x1ac40a05,     0x1ac40f3a,     0x1acc2042,
-    0x1ac8263d,     0x1ac42867,     0x1ada2c99,     0x9ad10899,
-    0x9ad10f40,     0x9ad521f7,     0x9adb263c,     0x9ac0286a,
-    0x9ac92f27,     0x9bdd7de6,     0x9b427d4f,     0x1b0b2cf1,
-    0x1b1ddcf7,     0x9b0b2f6e,     0x9b0cbf04,     0x9b2b728e,
-    0x9b2cdd6d,     0x9bae275e,     0x9ba7954d,     0x7ec315fe,
-    0x1ef0098c,     0x1ef21bff,     0x1ef02ab3,     0x1ef5394f,
-    0x1efc4942,     0x1eff5bc7,     0x1ee28832,     0x7ea3d546,
-    0x1e270979,     0x1e201981,     0x1e3d2a63,     0x1e263ae6,
-    0x1e3b4b80,     0x1e2758a2,     0x1e39899d,     0x7ef8d58d,
-    0x1e720913,     0x1e751b56,     0x1e622a74,     0x1e683ade,
-    0x1e754a76,     0x1e755a4c,     0x1e638a06,     0x1fc373a3,
-    0x1f0a35cf,     0x1f0aea4c,     0x1f2f74e7,     0x1f2032e0,
-    0x1f4d21d8,     0x1f49d0ef,     0x1f7f43b3,     0x1f705522,
-    0x1e20409e,     0x1e20c361,     0x1e214319,     0x1e21c2ae,
-    0x1e22c0cd,     0x1e23c32c,     0x1ee243d9,     0x1e6042bc,
-    0x1e60c2f0,     0x1e6143a5,     0x1e61c276,     0x1e62428d,
-    0x1ee1c393,     0x1e3800d1,     0x9e3800ed,     0x1e78035c,
-    0x9e7800d1,     0x1e220081,     0x9e22028e,     0x1e6202a7,
-    0x9e6202fb,     0x1e24028d,     0x9e64039e,     0x1e3002aa,
-    0x9e700225,     0x1e2601cb,     0x9e6602ad,     0x1e2701db,
-    0x9e6702e4,     0x1e3e2300,     0x1e6e2180,     0x1e202228,
-    0x1e602388,     0x29021b40,     0x297c78c0,     0x69660970,
-    0xa908018f,     0xa9427ae7,     0x29a03cfa,     0x29fc3d4b,
-    0x69c84033,     0xa988240e,     0xa9fa0d9b,     0x28a02d88,
-    0x28c8408a,     0x68f87a6a,     0xa8ba09f8,     0xa8c52a18,
-    0x280257be,     0x28727948,     0xa83868de,     0xa8440a98,
-    0x0c40733f,     0x4cdfa1e5,     0x0ccd6cea,     0x4cdf260d,
-    0x0d40c227,     0x4ddfcb30,     0x0dc7cc6b,     0x4c408ced,
-    0x0cdf8769,     0x4d60c346,     0x0dffca17,     0x4de8cda6,
-    0x4cda4834,     0x0c4049ef,     0x4d40e6dd,     0x4ddfe946,
-    0x0dcfeccf,     0x4cdf0546,     0x0cc7006b,     0x0d60e32c,
-    0x0dffe5eb,     0x0dfce8de,     0x0e31bb9b,     0x4e31bbbc,
-    0x0e71b841,     0x4e71bbbc,     0x4eb1b841,     0x0e30aab4,
-    0x4e30abdd,     0x0e70aa30,     0x4e70a9cd,     0x4eb0a96a,
-    0x6e30fbdd,     0x0e31abdd,     0x2e31aa93,     0x4e31aaf6,
-    0x6e31a96a,     0x0e71a8a4,     0x2e71a81f,     0x4e71aad5,
-    0x6e71a928,     0x4eb1a81f,     0x6eb1aa93,     0x6eb0f96a,
-    0x7e30fbbc,     0x7e70f862,     0x7eb0fb59,     0x7ef0f8c5,
-    0x0ea0c883,     0x4ea0c928,     0x4ee0caf6,     0x2ea0ca93,
-    0x6ea0c9cd,     0x6ee0c8c5,     0x0ea0dbdd,     0x4ea0db38,
-    0x4ee0dad5,     0x0ea0eb7a,     0x4ea0eb38,     0x4ee0e883,
-    0x2ea0db38,     0x6ea0db7a,     0x6ee0db17,     0x0e20ba0f,
-    0x4e20bad5,     0x0e60b883,     0x4e60bb38,     0x0ea0b928,
-    0x4ea0bb59,     0x4ee0bab4,     0x0ea0fa30,     0x4ea0fa51,
-    0x4ee0f862,     0x0ef8f841,     0x4ef8f820,     0x2ea0fb38,
-    0x6ea0f8a4,     0x6ee0f883,     0x2ef8f9ac,     0x6ef8f81f,
-    0x2ea1fbbc,     0x6ea1f96a,     0x6ee1fb7a,     0x2ef9f862,
-    0x6ef9f9ac,     0x2e205a72,     0x6e20581f,     0x0e231c41,
-    0x4e2f1dcd,     0x0ebf1fdd,     0x4ea21c20,     0x2e351e93,
-    0x6e2e1dac,     0x0e338651,     0x4e3886f6,     0x0e6f85cd,
-    0x4e7e87bc,     0x0ea087fe,     0x4ea1841f,     0x4ee38441,
-    0x0e3c0f7a,     0x4e3e0fbc,     0x0e660ca4,     0x4e600ffe,
-    0x0ea60ca4,     0x4ea80ce6,     0x4ee00ffe,     0x2e3c0f7a,
-    0x6e340e72,     0x2e6b0d49,     0x6e6a0d28,     0x2eae0dac,
-    0x6ea20c20,     0x6ef60eb4,     0x0e23d441,     0x4e3ad738,
-    0x4e64d462,     0x0e421420,     0x4e4b1549,     0x2e3a8738,
-    0x6e3c877a,     0x2e728630,     0x6e6087fe,     0x2ea58483,
-    0x6eac856a,     0x6ef98717,     0x0e2c2d6a,     0x4e262ca4,
-    0x0e742e72,     0x4e642c62,     0x0ead2d8b,     0x4eaa2d28,
-    0x4eec2d6a,     0x2e312e0f,     0x6e332e51,     0x2e642c62,
-    0x6e6c2d6a,     0x2eae2dac,     0x6eae2dac,     0x6ef12e0f,
-    0x0eafd5cd,     0x4ea4d462,     0x4ee9d507,     0x0ed616b4,
-    0x4edc177a,     0x0e329e30,     0x4e269ca4,     0x0e649c62,
-    0x4e669ca4,     0x0eae9dac,     0x4eb49e72,     0x2eb7d6d5,
-    0x6eb2d630,     0x6ef4d672,     0x2ecd158b,     0x6ed716d5,
-    0x2e39d717,     0x6e2ed5ac,     0x6e7cd77a,     0x2e591717,
-    0x6e5e17bc,     0x2e30ddee,     0x6e2ddd8b,     0x6e7adf38,
-    0x2e431c41,     0x6e4e1dac,     0x0e61941f,     0x4e6c956a,
-    0x0eb29630,     0x4ea99507,     0x0e24cc62,     0x4e25cc83,
-    0x4e6fcdcd,     0x0e550e93,     0x4e530e51,     0x2e729630,
-    0x6e659483,     0x2ea39441,     0x6ead958b,     0x0ea0cffe,
-    0x4ea7ccc5,     0x4eeacd28,     0x0ed10e0f,     0x4edf0fdd,
-    0x2e20fffe,     0x6e22fc20,     0x6e76feb4,     0x2e493d07,
-    0x6e563eb4,     0x0e396717,     0x4e3e67bc,     0x0e7766d5,
-    0x4e7d679b,     0x0ebb6759,     0x4ea764c5,     0x2e236441,
-    0x6e396717,     0x2e726630,     0x6e61641f,     0x2ea764c5,
-    0x6eae65ac,     0x0e2ba549,     0x4e3ea7bc,     0x0e71a60f,
-    0x4e7fa7dd,     0x0eb8a6f6,     0x4ea1a41f,     0x0e35f693,
-    0x4e21f41f,     0x4e67f4c5,     0x0e5035ee,     0x4e543672,
-    0x0e216c1f,     0x4e346e72,     0x0e7d6f9b,     0x4e766eb4,
-    0x0eb26e30,     0x4eae6dac,     0x2e2d6d8b,     0x6e2b6d49,
-    0x2e686ce6,     0x6e606ffe,     0x2eb36e51,     0x6ebd6f9b,
-    0x0e3eafbc,     0x4e20affe,     0x0e69ad07,     0x4e6cad6a,
-    0x0eb6aeb4,     0x4eacad6a,     0x2e26aca4,     0x6e3aaf38,
-    0x2e73ae51,     0x6e73ae51,     0x2eb8aef6,     0x6ea5ac83,
-    0x2e3fa7dd,     0x6e31a60f,     0x2e78a6f6,     0x6e75a693,
-    0x2eb5a693,     0x6eb8a6f6,     0x0e64b462,     0x4e71b60f,
-    0x0ea8b4e6,     0x4eaeb5ac,     0x0e322630,     0x4e2d258b,
-    0x0e6f25cd,     0x4e792717,     0x0ea32441,     0x4ea027fe,
-    0x0eb5f693,     0x4ea7f4c5,     0x4ef3f651,     0x0ec43462,
-    0x4ed23630,     0x2eb8eef6,     0x6eafedcd,     0x6eeced6a,
-    0x2ed72ed5,     0x6edf2fdd,     0x0fa810e6,     0x4fa38841,
-    0x4fc1100f,     0x0fab5149,     0x4f8688a4,     0x4fcf59cd,
-    0x2f859083,     0x4f8d898b,     0x6fce99ac,     0x0f41800f,
-    0x4f6b8949,     0x0f8d818b,     0x4f838841,     0x0e343672,
-    0x4e223420,     0x0e7b3759,     0x4e7c377a,     0x0eb93717,
-    0x4ea43462,     0x4ef43672,     0x0e2e3dac,     0x4e263ca4,
-    0x0e7e3fbc,     0x4e603ffe,     0x0ebf3fdd,     0x4eb23e30,
-    0x4efd3f9b,     0x2e288ce6,     0x6e2b8d49,     0x2e7f8fdd,
-    0x6e748e72,     0x2ea98d07,     0x6ea68ca4,     0x6ee98d07,
-    0x2e31360f,     0x6e2b3549,     0x2e793717,     0x6e6a3528,
-    0x2ea43462,     0x6ebe37bc,     0x6ef736d5,     0x2e213c1f,
-    0x6e273cc5,     0x2e7d3f9b,     0x6e623c20,     0x2eb33e51,
-    0x6eb13e0f,     0x6ee63ca4,     0x0e3ce77a,     0x4e2ae528,
-    0x4e7ee7bc,     0x2eb8e6f6,     0x6ebde79b,     0x6efde79b,
-    0x2e3be759,     0x6e39e717,     0x6e62e420,     0x65d220c2,
-    0x659029f2,     0x65903ca3,     0x65d13683,     0x65913173,
-    0x65d320cf,     0x25cb83c6,     0x254c0fbb,     0x251e0308,
-    0x25473a05,     0x25943096,     0x259d9270,     0x2423d187,
-    0x242786fa,     0x24f0f1b9,     0x24e42043,     0xba5fd3e3,
-    0x3a5f03e5,     0xfa411be4,     0x7a42cbe2,     0x93df03ff,
-    0xc820ffff,     0x8822fc7f,     0xc8247cbf,     0x88267fff,
-    0x4e010fe0,     0x5e040420,     0x4e081fe1,     0x4e0c1fe1,
-    0x4e0a1fe1,     0x4e071fe1,     0x4e042c20,     0x4e062c20,
-    0x4e052c20,     0x4e083c20,     0x0e0c3c20,     0x0e0a3c20,
-    0x0e073c20,     0x9eae0020,     0x0f03f409,     0x6f03f40e,
-    0x4cc0ac3f,     0x0ea1b820,     0x0ef9b820,     0x4ef9b820,
-    0x4e21c862,     0x0e79c862,     0x4e79c862,     0x4e61b8a4,
-    0x0e79b8a4,     0x4e79b8a4,     0x05a08020,     0x05104fe0,
-    0x05505001,     0x05906fe2,     0x05d03005,     0x05101fea,
-    0x05901feb,     0x0590cc0b,     0x0590de0b,     0x04b0e3e0,
-    0x0470e7e1,     0x042f9c20,     0x043f9c35,     0x047f9c20,
-    0x04ff9c20,     0x04299420,     0x04319160,     0x0461943e,
-    0x04a19020,     0x04038100,     0x040381a0,     0x040387e1,
-    0x04438be2,     0x04c38fe3,     0x040181e0,     0x04018100,
-    0x04018621,     0x04418b22,     0x04418822,     0x04818c23,
-    0x040081e0,     0x04008120,     0x04008761,     0x04008621,
-    0x04408822,     0x04808c23,     0x042053ff,     0x047f5401,
-    0x25208028,     0x2538cfe0,     0x2578d001,     0x25b8efe2,
-    0x25f8f007,     0x2538dfea,     0x25b8dfeb,     0xa400a3e0,
-    0xa420a7e0,     0xa4484be0,     0xa467afe0,     0xa4a8a7ea,
-    0xa547a814,     0xa4084ffe,     0xa55c53e0,     0xa5e1540b,
-    0xe400fbf6,     0xe408ffff,     0xe420e7e0,     0xe4484be0,
-    0xe460efe0,     0xe547e400,     0xe4014be0,     0xe4a84fe0,
-    0xe5f15000,     0x858043e0,     0x85a043ff,     0xe59f5d08,
-    0x0420e3e9,     0x0460e3ea,     0x04a0e3eb,     0x04e0e3ec,
-    0x25104042,     0x25104871,     0x25904861,     0x25904c92,
-    0x05344020,     0x05744041,     0x05b44062,     0x05f44083,
-    0x252c8840,     0x253c1420,     0x25681572,     0x25a21ce3,
-    0x25ea1e34,     0x253c0421,     0x25680572,     0x25a20ce3,
-    0x25ea0e34,     0x0522c020,     0x05e6c0a4,     0x2401a001,
-    0x2443a051,     0x24858881,     0x24c78cd1,     0x24850891,
-    0x24c70cc1,     0x250f9001,     0x25508051,     0x25802491,
-    0x25df28c1,     0x25850c81,     0x251e10d1,     0x65816001,
-    0x65c36051,     0x65854891,     0x65c74cc1,     0x05733820,
-    0x05b238a4,     0x05f138e6,     0x0570396a,     0x65d0a001,
-    0x65d6a443,     0x65d4a826,     0x6594ac26,     0x6554ac26,
-    0x6556ac26,     0x6552ac26,     0x65cbac85,     0x65caac01,
-    0x6589ac85,     0x6588ac01,     0x65c9ac85,     0x65c8ac01,
-    0x65dea833,     0x659ca509,     0x65d8a801,     0x65dcac01,
-    0x655cb241,     0x0520a1e0,     0x0521a601,     0x052281e0,
-    0x05238601,     0x04a14026,     0x042244a6,     0x046344a6,
-    0x04a444a6,     0x04e544a7,     0x0568aca7,     0x05b23230,
-    0x05302a30,     0x05702a30,     0x05b02a30,     0x05f02a30,
-    0x853040af,     0xc5b040af,     0xe57080af,     0xe5b080af,
-    0x25034440,     0x254054c4,     0x25034640,     0x25415a05,
-    0x25834440,     0x25c54489,     0x250b5d3a,     0x2550dc20,
-    0x2518e3e1,     0x2518e021,     0x2518e0a1,     0x2518e121,
-    0x2518e1a1,     0x2558e3e2,     0x2558e042,     0x2558e0c2,
-    0x2558e142,     0x2598e3e3,     0x2598e063,     0x2598e0e3,
-    0x2598e163,     0x25d8e3e4,     0x25d8e084,     0x25d8e104,
-    0x25d8e184,     0x2518e407,     0x05214800,     0x05614800,
-    0x05a14800,     0x05e14800,     0x05214c00,     0x05614c00,
-    0x05a14c00,     0x05e14c00,     0x05304001,     0x05314001,
-    0x05a18610,     0x05e18610,     0x0420bc31,     0x05271e11,
-    0x6545e891,     0x6585e891,     0x65c5e891,     0x6545c891,
-    0x6585c891,     0x65c5c891,     0x052c8020,     0x056c8020,
-    0x05ac8020,     0x05ec8020,     0x45b0c210,     0x45f1c231,
-    0x1e601000,     0x1e603000,     0x1e621000,     0x1e623000,
-    0x1e641000,     0x1e643000,     0x1e661000,     0x1e663000,
-    0x1e681000,     0x1e683000,     0x1e6a1000,     0x1e6a3000,
-    0x1e6c1000,     0x1e6c3000,     0x1e6e1000,     0x1e6e3000,
-    0x1e701000,     0x1e703000,     0x1e721000,     0x1e723000,
-    0x1e741000,     0x1e743000,     0x1e761000,     0x1e763000,
-    0x1e781000,     0x1e783000,     0x1e7a1000,     0x1e7a3000,
-    0x1e7c1000,     0x1e7c3000,     0x1e7e1000,     0x1e7e3000,
-    0xf8268290,     0xf82d028c,     0xf8281299,     0xf8332160,
-    0xf8383286,     0xf83f520e,     0xf82640e0,     0xf82f7353,
-    0xf82962ea,     0xf8b58396,     0xf8a201e3,     0xf8b310f4,
-    0xf8a420fd,     0xf8a03209,     0xf8b45097,     0xf8b042ea,
-    0xf8ab70d9,     0xf8bf61b0,     0xf8f7802c,     0xf8ee02a9,
-    0xf8f011fa,     0xf8e421e4,     0xf8e833c6,     0xf8e4523d,
-    0xf8fd413a,     0xf8ef7162,     0xf8fd60e3,     0xf86182bb,
-    0xf870010e,     0xf8701336,     0xf86522b4,     0xf8703217,
-    0xf87e5294,     0xf8604264,     0xf8787284,     0xf8646358,
-    0xb8338102,     0xb828030e,     0xb83012df,     0xb824203f,
-    0xb82a3194,     0xb82050e9,     0xb8384090,     0xb83b7146,
-    0xb83b61b8,     0xb8b082df,     0xb8b603f4,     0xb8bd11c9,
-    0xb8b42287,     0xb8bc3169,     0xb8ae528c,     0xb8a14138,
-    0xb8b3726d,     0xb8b060b0,     0xb8e08183,     0xb8e801ef,
-    0xb8f011e4,     0xb8fe2005,     0xb8ea3376,     0xb8e35120,
-    0xb8f3415d,     0xb8f87284,     0xb8e763b8,     0xb86e8175,
-    0xb87b01ed,     0xb87f11d1,     0xb863221e,     0xb87630f4,
-    0xb8745023,     0xb87a4133,     0xb87072b1,     0xb8606044,
-    0xce262dd8,     0xce1179d5,     0xce638c6c,     0xce83c537,
-    0xce73807c,     0xce7a84f7,     0xcec081d5,     0xce7a8905,
-    0x25a0d245,     0x2521c3f1,     0x05808909,     0x05400d2c,
-    0x0500154b,     0x25a0c91f,     0x2561db50,     0x0582d157,
-    0x054026a8,     0x05001eca,     0x25a0c0b6,     0x25a1da23,
-    0x05822dc5,     0x05400e11,     0x0500155e,     0x25e0d502,
-    0x25a1de17,     0x0580040c,     0x0540000f,     0x050287b3,
-    0x25a0d66d,     0x2521cb02,     0x05801d74,     0x05400d38,
-    0x05007854,     0x2560def5,     0x25e1dfb6,     0x05801c3a,
-    0x0540158b,     0x05000e05,     0x046a00e2,     0x047a0493,
-    0x659e0062,     0x65d408b4,     0x658d05bd,     0x046113ce,
-    0x04e3187c,     0x04291729,     0x042e1d5a,     0x04d6b8f4,
-    0x04c010d4,     0x045a03ad,     0x04108029,     0x041b19fb,
-    0x04d9be24,     0x041aa302,     0x04191dba,     0x04d38e16,
-    0x04d18571,     0x04100210,     0x04d7a6fc,     0x049eb15c,
-    0x04981cf1,     0x05678f04,     0x05648969,     0x048816c4,
-    0x044a01e4,     0x04c91f44,     0x044b1745,     0x0401033f,
-    0x04dca468,     0x65c09b07,     0x658d9e38,     0x65868fca,
-    0x65879ba8,     0x65c297ff,     0x04ddb4e0,     0x6582badd,
-    0x6580ba9d,     0x6581b246,     0x658db51a,     0x65818b93,
-    0x65f487d1,     0x65ee0e3c,     0x65b8396a,     0x65f7af8b,
-    0x65f4def4,     0x65e6e378,     0x65ed4c8d,     0x65a6769a,
-    0x049d5c1d,     0x04c864a3,     0x042d322d,     0x04a83148,
-    0x047d3013,     0x04f731b0,     0x052d6bd7,     0x05606ed9,
-    0x65889d79,     0x4556b2ee,     0x4540b645,     0x04223869,
-    0x445887ae,     0x44da948e,     0x44998edb,     0x449b997f,
-    0x041a338c,     0x04d8309c,     0x049921e6,     0x04883641,
-    0x044a2882,     0x04892b8b,     0x044b37e3,     0x658735f8,
-    0x65862d06,     0x65d83c95,     0x040134d8,     0x0e2610a4,
-    0x4e2c116a,     0x0e6b1149,     0x4e7b1359,     0x0eac116a,
-    0x4ea710c5,     0x2e21101f,     0x6e3812f6,     0x2e7b1359,
-    0x6e71120f,     0x2ea51083,     0x6eb41272,
+    0xd5033fdf,     0xd50330ff,     0xd503101a,     0xd503207f,
+    0xd50320ff,     0xd503329f,     0xd50339bf,     0xd61f0280,
+    0xd63f0140,     0xdac123fb,     0xdac127e8,     0xdac12be0,
+    0xdac12fe1,     0xdac133f5,     0xdac137f1,     0xdac13bfd,
+    0xdac13ffd,     0xdac147fc,     0xd61f083f,     0xd61f0eff,
+    0xd63f0abf,     0xd63f0e9f,     0xd51b4436,     0xd51b421b,
+    0xd53b4433,     0xd53b420b,     0xd53b00f0,     0xd53b0026,
+    0xd53be0d1,     0xdac143e0,     0xc8047f0a,     0xc816fe6a,
+    0xc85f7ca1,     0xc85ffd1e,     0xc89ffe2c,     0xc8dffdc9,
+    0x88077ca1,     0x8810fd82,     0x885f7d8a,     0x885fff83,
+    0x889fff4e,     0x88dffd5e,     0x480e7db5,     0x4809ff76,
+    0x485f7e7c,     0x485fffcb,     0x489ffc53,     0x48dffee2,
+    0x08017d80,     0x0810fded,     0x085f7eb1,     0x085ffd6d,
+    0x089ffd1e,     0x08dffdb8,     0xc87f074b,     0xc87fedb5,
+    0xc83430c3,     0xc821989d,     0x887f2e06,     0x887ff984,
+    0x88353f9b,     0x8829d0cf,     0xf8183238,     0xb800a341,
+    0x381ef00f,     0x7800d231,     0xf8431325,     0xb858c1f3,
+    0x39401c74,     0x785e7093,     0x389fa26e,     0x789cb27c,
+    0x78c0d36e,     0xb8988306,     0xfc457052,     0xbc5d0380,
+    0xfc01739f,     0xbc02b32b,     0xf8147d0e,     0xb81a3d39,
+    0x381f4ef0,     0x781c8d36,     0xf846df0b,     0xb8434e75,
+    0x385feee6,     0x78415d07,     0x389e1d84,     0x789fcd68,
+    0x78de4eae,     0xb89b9de0,     0xfc41dc5b,     0xbc410ead,
+    0xfc010f6c,     0xbc1a5f22,     0xf81eb5aa,     0xb8032427,
+    0x3800546a,     0x781df4c5,     0xf85626cd,     0xb859644d,
+    0x385e860d,     0x785ea458,     0x389ff6e3,     0x789d5513,
+    0x78df86e2,     0xb89a9793,     0xfc5af46f,     0xbc5b17ac,
+    0xfc184435,     0xbc19d527,     0xf8226a85,     0xb83ed94e,
+    0x383cd824,     0x783af945,     0xf87c7856,     0xb87c780c,
+    0x386ff908,     0x786e5ab1,     0x38a8fb11,     0x78bef94a,
+    0x78e07af1,     0xb8a07bd9,     0xfc775b05,     0xbc6f7876,
+    0xfc30fba4,     0xbc3cda87,     0xf91ff41b,     0xb91f3115,
+    0x391c0fb1,     0x791c685b,     0xf9586021,     0xb958b23d,
+    0x39598921,     0x795d3077,     0x399d0675,     0x7998d8f3,
+    0x79dbd02a,     0xb99d068a,     0xfd5d11a0,     0xbd58d76b,
+    0xfd1ac72d,     0xbd1d9c14,     0x5800001a,     0x18ffda33,
+    0xf8991100,     0xd8007880,     0xf8a758e0,     0xf9989d80,
+    0x1a0b0298,     0x3a1c01a0,     0x5a0400ea,     0x7a02020f,
+    0x9a1d028c,     0xba0e01ad,     0xda140186,     0xfa19022c,
+    0x0b2b877e,     0x2b21c8ee,     0xcb3ba47d,     0x6b3ae9a0,
+    0x8b256a36,     0xab28efd1,     0xcb37ce6a,     0xeb254fa6,
+    0x3a498264,     0x7a4a72c2,     0xba4c91aa,     0xfa502303,
+    0x3a4b68ed,     0x7a4a9b6b,     0xba4dd86d,     0xfa50cb45,
+    0x1a9cd2aa,     0x1a9bd537,     0x5a8fd3aa,     0x5a95273e,
+    0x9a95c220,     0x9a9426b0,     0xda8393d3,     0xda980573,
+    0x5ac0033b,     0x5ac0046e,     0x5ac00a2e,     0x5ac011e7,
+    0x5ac01798,     0xdac00331,     0xdac00742,     0xdac008bc,
+    0xdac00f59,     0xdac0121b,     0xdac014d1,     0xdac10195,
+    0xdac10480,     0xdac10b6c,     0xdac10f91,     0xdac1105c,
+    0xdac11551,     0xdac119cf,     0xdac11c6e,     0xd71f0b2f,
+    0xd71f0e6e,     0xd73f08b0,     0xd73f0c9a,     0x1ac20899,
+    0x1add0d82,     0x1ac72111,     0x1ad92483,     0x1ad92b44,
+    0x1ac02e24,     0x9ad70a3a,     0x9adc0eaf,     0x9aca2371,
+    0x9ac72403,     0x9ac62939,     0x9acf2faf,     0x9bd17c4a,
+    0x9b4b7d67,     0x1b1d5cf7,     0x1b0baf6e,     0x9b0c3f04,
+    0x9b0bf28e,     0x9b2c5d6d,     0x9b2ea75e,     0x9ba7154d,
+    0x9ba3adfd,     0x7edf160c,     0x1ef30a5f,     0x1eef1a15,
+    0x1ee22aaa,     0x1ee73b8a,     0x1ef24bfe,     0x1ee65841,
+    0x1ef9886a,     0x7ea1d4eb,     0x1e23080c,     0x1e261bb3,
+    0x1e2028d7,     0x1e223b7c,     0x1e3d48e5,     0x1e2d5b2c,
+    0x1e338b0c,     0x7ef6d648,     0x1e740aba,     0x1e7e1853,
+    0x1e762916,     0x1e6c3ab3,     0x1e664ab2,     0x1e635870,
+    0x1e7c887d,     0x1fca35cf,     0x1f0a6a4c,     0x1f0ff4e7,
+    0x1f2032e0,     0x1f2d21d8,     0x1f4950ef,     0x1f5fc3b3,
+    0x1f705522,     0x1f616c9e,     0x1e204319,     0x1e20c2ae,
+    0x1e2140cd,     0x1e21c32c,     0x1e22c3d9,     0x1e23c2bc,
+    0x1ee242f0,     0x1e6043a5,     0x1e60c276,     0x1e61428d,
+    0x1e61c393,     0x1e6240d2,     0x1ee1c0ee,     0x1e38035c,
+    0x9e3800d1,     0x1e780081,     0x9e7802ad,     0x1e2202a7,
+    0x9e2202fb,     0x1e62028d,     0x9e62037f,     0x1e2402aa,
+    0x9e640225,     0x1e3001cb,     0x9e7002ad,     0x1e2601da,
+    0x9e660304,     0x1e2703b8,     0x9e6701cc,     0x1e3c2220,
+    0x1e6022c0,     0x1e2020c8,     0x1e602368,     0x293c30db,
+    0x29602e6e,     0x697a31e0,     0xa9025ee9,     0xa975134f,
+    0x29ac20d1,     0x29f20887,     0x69fe26ce,     0xa9b0530d,
+    0xa9c62d48,     0x28b21618,     0x28f06920,     0x68f00a38,
+    0xa8bd45da,     0xa8c357be,     0x28325d51,     0x286c1bda,
+    0xa804229e,     0xa8437536,     0x0c40702d,     0x4cdfa201,
+    0x0cd36f36,     0x4cdf2759,     0x0d40c1e9,     0x4ddfcb2c,
+    0x0dddcdc4,     0x4c408e31,     0x0cdf8777,     0x4d60c302,
+    0x0dffc80b,     0x4df6cd82,     0x4ccd49b5,     0x0c40496c,
+    0x4d40e5d2,     0x4ddfeab9,     0x0ddbee14,     0x4cdf0420,
+    0x0cdd0360,     0x0d60e232,     0x0dffe705,     0x0df4e8bc,
+    0x0e31b841,     0x4e31bab4,     0x0e71bbdd,     0x4e71ba30,
+    0x4eb1b9cd,     0x0e30a96a,     0x4e30abdd,     0x0e70abdd,
+    0x4e70aa93,     0x4eb0aaf6,     0x6e30f96a,     0x0e31a8a4,
+    0x2e31a81f,     0x4e31aad5,     0x6e31a928,     0x0e71a81f,
+    0x2e71aa93,     0x4e71a96a,     0x6e71abbc,     0x4eb1a862,
+    0x6eb1ab59,     0x6eb0f8c5,     0x7e30f883,     0x7e70f928,
+    0x7eb0faf6,     0x7ef0fa93,     0x0ea0c9cd,     0x4ea0c8c5,
+    0x4ee0cbdd,     0x2ea0cb38,     0x6ea0cad5,     0x6ee0cb7a,
+    0x0ea0db38,     0x4ea0d883,     0x4ee0db38,     0x0ea0eb7a,
+    0x4ea0eb17,     0x4ee0ea0f,     0x2ea0dad5,     0x6ea0d883,
+    0x6ee0db38,     0x0e20b928,     0x4e20bb59,     0x0e60bab4,
+    0x4e60ba30,     0x0ea0ba51,     0x4ea0b862,     0x4ee0b841,
+    0x0ea0f820,     0x4ea0fb38,     0x4ee0f8a4,     0x0ef8f883,
+    0x4ef8f9ac,     0x2ea0f81f,     0x6ea0fbbc,     0x6ee0f96a,
+    0x2ef8fb7a,     0x6ef8f862,     0x2ea1f9ac,     0x6ea1fa72,
+    0x6ee1f81f,     0x2ef9f841,     0x6ef9f9cd,     0x2e205bdd,
+    0x6e205820,     0x0e351e93,     0x4e2e1dac,     0x0eb31e51,
+    0x4eb81ef6,     0x2e2f1dcd,     0x6e3e1fbc,     0x0e2087fe,
+    0x4e21841f,     0x0e638441,     0x4e7c877a,     0x0ebe87bc,
+    0x4ea684a4,     0x4ee087fe,     0x0e260ca4,     0x4e280ce6,
+    0x0e600ffe,     0x4e7c0f7a,     0x0eb40e72,     0x4eab0d49,
+    0x4eea0d28,     0x2e2e0dac,     0x6e220c20,     0x2e760eb4,
+    0x6e630c41,     0x2eba0f38,     0x6ea40c62,     0x6ee20c20,
+    0x0e2bd549,     0x4e3ad738,     0x4e7cd77a,     0x0e521630,
+    0x4e4017fe,     0x2e258483,     0x6e2c856a,     0x2e798717,
+    0x6e6c856a,     0x2ea684a4,     0x6eb48672,     0x6ee48462,
+    0x0e2d2d8b,     0x4e2a2d28,     0x0e6c2d6a,     0x4e712e0f,
+    0x0eb32e51,     0x4ea42c62,     0x4eec2d6a,     0x2e2e2dac,
+    0x6e2e2dac,     0x2e712e0f,     0x6e6f2dcd,     0x2ea42c62,
+    0x6ea92d07,     0x6ef62eb4,     0x0ebcd77a,     0x4eb2d630,
+    0x4ee6d4a4,     0x0ec41462,     0x4ec614a4,     0x0e2e9dac,
+    0x4e349e72,     0x0e779ed5,     0x4e729e30,     0x0eb49e72,
+    0x4ead9d8b,     0x2eb7d6d5,     0x6eb9d717,     0x6eeed5ac,
+    0x2edc177a,     0x6ed91717,     0x2e3ed7bc,     0x6e30d5ee,
+    0x6e6dd58b,     0x2e5a1738,     0x6e431441,     0x2e2eddac,
+    0x6e21dc1f,     0x6e6cdd6a,     0x2e521e30,     0x6e491d07,
+    0x0e649462,     0x4e659483,     0x0eaf95cd,     0x4eb59693,
+    0x0e33ce51,     0x4e32ce30,     0x4e65cc83,     0x0e430c41,
+    0x4e4d0d8b,     0x2e6097fe,     0x6e6794c5,     0x2eaa9528,
+    0x6eb1960f,     0x0ebfcfdd,     0x4ea0cffe,     0x4ee2cc20,
+    0x0ed60eb4,     0x4ec90d07,     0x2e36feb4,     0x6e39ff17,
+    0x6e7effbc,     0x2e573ed5,     0x6e5d3f9b,     0x0e3b6759,
+    0x4e2764c5,     0x0e636441,     0x4e796717,     0x0eb26630,
+    0x4ea1641f,     0x2e2764c5,     0x6e2e65ac,     0x2e6b6549,
+    0x6e7e67bc,     0x2eb1660f,     0x6ebf67dd,     0x0e38a6f6,
+    0x4e21a41f,     0x0e75a693,     0x4e61a41f,     0x0ea7a4c5,
+    0x4eb0a5ee,     0x0e34f672,     0x4e21f41f,     0x4e74f672,
+    0x0e5d379b,     0x4e5636b4,     0x0e326e30,     0x4e2e6dac,
+    0x0e6d6d8b,     0x4e6b6d49,     0x0ea86ce6,     0x4ea06ffe,
+    0x2e336e51,     0x6e3d6f9b,     0x2e7e6fbc,     0x6e606ffe,
+    0x2ea96d07,     0x6eac6d6a,     0x0e36aeb4,     0x4e2cad6a,
+    0x0e66aca4,     0x4e7aaf38,     0x0eb3ae51,     0x4eb3ae51,
+    0x2e38aef6,     0x6e25ac83,     0x2e7fafdd,     0x6e71ae0f,
+    0x2eb8aef6,     0x6eb5ae93,     0x2e35a693,     0x6e38a6f6,
+    0x2e64a462,     0x6e71a60f,     0x2ea8a4e6,     0x6eaea5ac,
+    0x0e72b630,     0x4e6db58b,     0x0eafb5cd,     0x4eb9b717,
+    0x0e232441,     0x4e2027fe,     0x0e752693,     0x4e6724c5,
+    0x0eb32651,     0x4ea42462,     0x0eb2f630,     0x4eb8f6f6,
+    0x4eeff5cd,     0x0ecc356a,     0x4ed736d5,     0x2ebfefdd,
+    0x6ebdef9b,     0x6eeeedac,     0x2edd2f9b,     0x6ec52c83,
+    0x0f81100f,     0x4fab8949,     0x4fc618a4,     0x0faf51cd,
+    0x4fa58083,     0x4fcd598b,     0x2fae91ac,     0x4f81800f,
+    0x6fcb9949,     0x0f5d818b,     0x4f438841,     0x0fa28020,
+    0x4faf89cd,     0x0e393717,     0x4e243462,     0x0e743672,
+    0x4e6e35ac,     0x0ea634a4,     0x4ebe37bc,     0x4ee037fe,
+    0x0e3f3fdd,     0x4e323e30,     0x0e7d3f9b,     0x4e683ce6,
+    0x0eab3d49,     0x4ebf3fdd,     0x4ef43e72,     0x2e298d07,
+    0x6e268ca4,     0x2e698d07,     0x6e718e0f,     0x2eab8d49,
+    0x6eb98f17,     0x6eea8d28,     0x2e243462,     0x6e3e37bc,
+    0x2e7736d5,     0x6e61341f,     0x2ea734c5,     0x6ebd379b,
+    0x6ee23420,     0x2e333e51,     0x6e313e0f,     0x2e663ca4,
+    0x6e7c3f7a,     0x2eaa3d28,     0x6ebe3fbc,     0x6ef83ef6,
+    0x0e3de79b,     0x4e3de79b,     0x4e7be759,     0x2eb9e717,
+    0x6ea2e420,     0x6ee6e4a4,     0x2e28e4e6,     0x6e34e672,
+    0x6e62e420,     0x659229e2,     0x65903cb3,     0x65d03683,
+    0x65913163,     0x65d120df,     0x65d323c6,     0x25dd8ecd,
+    0x25d2063e,     0x258b0947,     0x2501358b,     0x25823032,
+    0x254181d6,     0x24a646a1,     0x24719e73,     0x24233cd8,
+    0x24adf4c2,     0xba5fd3e3,     0x3a5f03e5,     0xfa411be4,
+    0x7a42cbe2,     0x93df03ff,     0xc820ffff,     0x8822fc7f,
+    0xc8247cbf,     0x88267fff,     0x4e010fe0,     0x5e040420,
+    0x4e081fe1,     0x4e0c1fe1,     0x4e0a1fe1,     0x4e071fe1,
+    0x4e042c20,     0x4e062c20,     0x4e052c20,     0x4e083c20,
+    0x0e0c3c20,     0x0e0a3c20,     0x0e073c20,     0x9eae0020,
+    0x0f03f409,     0x6f03f40e,     0x4cc0ac3f,     0x0ea1b820,
+    0x0ef9b820,     0x4ef9b820,     0x4e21c862,     0x0e79c862,
+    0x4e79c862,     0x4e61b8a4,     0x0e79b8a4,     0x4e79b8a4,
+    0x05a08020,     0x05104fe0,     0x05505001,     0x05906fe2,
+    0x05d03005,     0x05101fea,     0x05901feb,     0x0590cc0b,
+    0x0590de0b,     0x04b0e3e0,     0x0470e7e1,     0x042f9c20,
+    0x043f9c35,     0x047f9c20,     0x04ff9c20,     0x04299420,
+    0x04319160,     0x0461943e,     0x04a19020,     0x04038100,
+    0x040381a0,     0x040387e1,     0x04438be2,     0x04c38fe3,
+    0x040181e0,     0x04018100,     0x04018621,     0x04418b22,
+    0x04418822,     0x04818c23,     0x040081e0,     0x04008120,
+    0x04008761,     0x04008621,     0x04408822,     0x04808c23,
+    0x042053ff,     0x047f5401,     0x25208028,     0x2538cfe0,
+    0x2578d001,     0x25b8efe2,     0x25f8f007,     0x2538dfea,
+    0x25b8dfeb,     0xa400a3e0,     0xa420a7e0,     0xa4484be0,
+    0xa467afe0,     0xa4a8a7ea,     0xa547a814,     0xa4084ffe,
+    0xa55c53e0,     0xa5e1540b,     0xe400fbf6,     0xe408ffff,
+    0xe420e7e0,     0xe4484be0,     0xe460efe0,     0xe547e400,
+    0xe4014be0,     0xe4a84fe0,     0xe5f15000,     0x858043e0,
+    0x85a043ff,     0xe59f5d08,     0x0420e3e9,     0x0460e3ea,
+    0x04a0e3eb,     0x04e0e3ec,     0x25104042,     0x25104871,
+    0x25904861,     0x25904c92,     0x05344020,     0x05744041,
+    0x05b44062,     0x05f44083,     0x252c8840,     0x253c1420,
+    0x25681572,     0x25a21ce3,     0x25ea1e34,     0x253c0421,
+    0x25680572,     0x25a20ce3,     0x25ea0e34,     0x0522c020,
+    0x05e6c0a4,     0x2401a001,     0x2443a051,     0x24858881,
+    0x24c78cd1,     0x24850891,     0x24c70cc1,     0x250f9001,
+    0x25508051,     0x25802491,     0x25df28c1,     0x25850c81,
+    0x251e10d1,     0x65816001,     0x65c36051,     0x65854891,
+    0x65c74cc1,     0x05733820,     0x05b238a4,     0x05f138e6,
+    0x0570396a,     0x65d0a001,     0x65d6a443,     0x65d4a826,
+    0x6594ac26,     0x6554ac26,     0x6556ac26,     0x6552ac26,
+    0x65cbac85,     0x65caac01,     0x6589ac85,     0x6588ac01,
+    0x65c9ac85,     0x65c8ac01,     0x65dea833,     0x659ca509,
+    0x65d8a801,     0x65dcac01,     0x655cb241,     0x0520a1e0,
+    0x0521a601,     0x052281e0,     0x05238601,     0x04a14026,
+    0x042244a6,     0x046344a6,     0x04a444a6,     0x04e544a7,
+    0x0568aca7,     0x05b23230,     0x05302a30,     0x05702a30,
+    0x05b02a30,     0x05f02a30,     0x853040af,     0xc5b040af,
+    0xe57080af,     0xe5b080af,     0x25034440,     0x254054c4,
+    0x25034640,     0x25415a05,     0x25834440,     0x25c54489,
+    0x250b5d3a,     0x2550dc20,     0x2518e3e1,     0x2518e021,
+    0x2518e0a1,     0x2518e121,     0x2518e1a1,     0x2558e3e2,
+    0x2558e042,     0x2558e0c2,     0x2558e142,     0x2598e3e3,
+    0x2598e063,     0x2598e0e3,     0x2598e163,     0x25d8e3e4,
+    0x25d8e084,     0x25d8e104,     0x25d8e184,     0x2518e407,
+    0x05214800,     0x05614800,     0x05a14800,     0x05e14800,
+    0x05214c00,     0x05614c00,     0x05a14c00,     0x05e14c00,
+    0x05304001,     0x05314001,     0x05a18610,     0x05e18610,
+    0x0420bc31,     0x05271e11,     0x6545e891,     0x6585e891,
+    0x65c5e891,     0x6545c891,     0x6585c891,     0x65c5c891,
+    0x052c8020,     0x056c8020,     0x05ac8020,     0x05ec8020,
+    0x45b0c210,     0x45f1c231,     0x1e601000,     0x1e603000,
+    0x1e621000,     0x1e623000,     0x1e641000,     0x1e643000,
+    0x1e661000,     0x1e663000,     0x1e681000,     0x1e683000,
+    0x1e6a1000,     0x1e6a3000,     0x1e6c1000,     0x1e6c3000,
+    0x1e6e1000,     0x1e6e3000,     0x1e701000,     0x1e703000,
+    0x1e721000,     0x1e723000,     0x1e741000,     0x1e743000,
+    0x1e761000,     0x1e763000,     0x1e781000,     0x1e783000,
+    0x1e7a1000,     0x1e7a3000,     0x1e7c1000,     0x1e7c3000,
+    0x1e7e1000,     0x1e7e3000,     0xf82c8114,     0xf8390274,
+    0xf820130b,     0xf82623f4,     0xf82e30d0,     0xf82051e7,
+    0xf833413a,     0xf82a72b7,     0xf836605c,     0xf8a3826f,
+    0xf8b40087,     0xf8bd1007,     0xf8a92290,     0xf8b73204,
+    0xf8aa5177,     0xf8b943e6,     0xf8b072ed,     0xf8ac61c1,
+    0xf8e98215,     0xf8fa008f,     0xf8e41110,     0xf8e6209e,
+    0xf8fd33b1,     0xf8fa51e9,     0xf8e243ab,     0xf8e37027,
+    0xf8fb61f5,     0xf86e81e8,     0xf87600b9,     0xf87411f5,
+    0xf87723d0,     0xf8743014,     0xf8645313,     0xf8644094,
+    0xf878727a,     0xf8626108,     0xb82e81f8,     0xb83f0096,
+    0xb83f1141,     0xb834200c,     0xb8293307,     0xb8305364,
+    0xb826436a,     0xb838720d,     0xb83f62d6,     0xb8b483bf,
+    0xb8a9028e,     0xb8a71394,     0xb8a921cb,     0xb8ac3034,
+    0xb8b85269,     0xb8ad41f3,     0xb8b07005,     0xb8a3610c,
+    0xb8ef820f,     0xb8e403cf,     0xb8e51140,     0xb8f6207b,
+    0xb8e03269,     0xb8fd530a,     0xb8e440f4,     0xb8f871dd,
+    0xb8f5636b,     0xb86d83f0,     0xb871006e,     0xb87e12d0,
+    0xb8742287,     0xb8633341,     0xb8735209,     0xb8714015,
+    0xb8647302,     0xb86e6166,     0xce3179d5,     0xce035c6c,
+    0xce788c69,     0xce93bc7c,     0xce758347,     0xce6884ae,
+    0xcec080ba,     0xce718a56,     0x2520c9e0,     0x2561c834,
+    0x05800d2c,     0x0540154b,     0x0500093f,     0x25e0d78f,
+    0x25a1c81c,     0x058026a8,     0x05401eca,     0x05008816,
+    0x25e0c5d7,     0x25e1d35a,     0x05800e11,     0x0540155e,
+    0x05026c22,     0x25e0ccf6,     0x2521c0a8,     0x0580000f,
+    0x054287b3,     0x0500b04d,     0x2560d481,     0x25a1d84c,
+    0x05800d38,     0x05407854,     0x050015d5,     0x25e0dabf,
+    0x25a1cf12,     0x0580158b,     0x05400e05,     0x05003682,
+    0x047a0093,     0x043e0462,     0x65d400b4,     0x658d09bd,
+    0x658107ce,     0x04e3107c,     0x04291b29,     0x042e155a,
+    0x04e71f54,     0x04d6b0d4,     0x044003ad,     0x041a0029,
+    0x041099fb,     0x04db1e24,     0x0419a302,     0x041abdba,
+    0x04d90e16,     0x04d38571,     0x04118210,     0x04d006fc,
+    0x0497b15c,     0x049ebcf1,     0x04580f04,     0x05278969,
+    0x05a496c4,     0x044801e4,     0x04ca1f44,     0x04491745,
+    0x040b033f,     0x04810468,     0x04dcbb07,     0x65809e38,
+    0x658d8fca,     0x65869ba8,     0x65c797ff,     0x65c294e0,
+    0x049dbadd,     0x6582ba9d,     0x6580b246,     0x6581b51a,
+    0x658dab93,     0x65c187d1,     0x65b19dd8,     0x65eb0b53,
+    0x65fc29e0,     0x65f7b797,     0x65bbd81d,     0x65a4ed97,
+    0x65b45aff,     0x65e07fa2,     0x04454097,     0x044d6e3c,
+    0x04283148,     0x04bd3013,     0x047731b0,     0x04ed33d7,
+    0x05606ad9,     0x056b6fd9,     0x658896ce,     0x4540b245,
+    0x45c3b449,     0x04243bae,     0x44d8948e,     0x449a8edb,
+    0x4499997f,     0x441b938c,     0x04da309c,     0x049821e6,
+    0x04993641,     0x04482882,     0x048a2b8b,     0x044937e3,
+    0x044b35f8,     0x65872d06,     0x65c63c95,     0x659834d8,
+    0x04c12924,     0x0e2c116a,     0x4e2710c5,     0x0e61101f,
+    0x4e7812f6,     0x0ebb1359,     0x4eb1120f,     0x2e251083,
+    0x6e341272,     0x2e7011ee,     0x6e6c116a,     0x2ea41062,
+    0x6eac116a,
   };
 // END  Generated code -- do not edit
diff --git a/test/hotspot/jtreg/compiler/onSpinWait/TestOnSpinWaitAArch64.java b/test/hotspot/jtreg/compiler/onSpinWait/TestOnSpinWaitAArch64.java
index 3bcd60ed50c..e487e921dd2 100644
--- a/test/hotspot/jtreg/compiler/onSpinWait/TestOnSpinWaitAArch64.java
+++ b/test/hotspot/jtreg/compiler/onSpinWait/TestOnSpinWaitAArch64.java
@@ -22,7 +22,7 @@
  */
 
 /**
- * @test TestOnSpinWaitAArch64
+ * @test id=TestOnSpinWaitAArch64
  * @summary Checks that java.lang.Thread.onSpinWait is intrinsified with instructions specified with '-XX:OnSpinWaitInst' and '-XX:OnSpinWaitInstCount'
  * @bug 8186670
  * @library /test/lib
@@ -41,6 +41,22 @@
  * @run driver compiler.onSpinWait.TestOnSpinWaitAArch64 c1 sb 1
  */
 
+/**
+ * @test id=TestOnSpinWaitAArch64-wfet
+ * @summary Checks that java.lang.Thread.onSpinWait is intrinsified when -XX:OnSpinWaitInst=wfet is used
+ * @bug 8366441
+ * @library /test/lib
+ *
+ * @requires vm.flagless
+ * @requires (os.arch=="aarch64" & os.family=="linux")
+ * @requires vm.debug
+ *
+ * @run driver compiler.onSpinWait.TestOnSpinWaitAArch64 c2 wfet 1 1
+ * @run driver compiler.onSpinWait.TestOnSpinWaitAArch64 c2 wfet 1 1000
+ * @run driver compiler.onSpinWait.TestOnSpinWaitAArch64 c1 wfet 1 1
+ * @run driver compiler.onSpinWait.TestOnSpinWaitAArch64 c1 wfet 1 1000
+ */
+
 package compiler.onSpinWait;
 
 import java.util.Arrays;
@@ -56,6 +72,7 @@ public class TestOnSpinWaitAArch64 {
         String compiler = args[0];
         String spinWaitInst = args[1];
         String spinWaitInstCount = args[2];
+        String spinWaitDelay = (args.length >= 4 ? args[3] : "");
         ArrayList<String> command = new ArrayList<String>();
         command.add("-XX:+IgnoreUnrecognizedVMOptions");
         command.add("-showversion");
@@ -70,8 +87,14 @@ public class TestOnSpinWaitAArch64 {
             throw new RuntimeException("Unknown compiler: " + compiler);
         }
         command.add("-Xbatch");
+        if ("wfet".equals(spinWaitInst)) {
+          command.add("-XX:+UnlockExperimentalVMOptions");
+        }
         command.add("-XX:OnSpinWaitInst=" + spinWaitInst);
         command.add("-XX:OnSpinWaitInstCount=" + spinWaitInstCount);
+        if (!spinWaitDelay.isEmpty()) {
+          command.add("-XX:OnSpinWaitDelay=" + spinWaitDelay);
+        }
         command.add("-XX:CompileCommand=compileonly," + Launcher.class.getName() + "::" + "test");
         command.add("-XX:CompileCommand=print," + Launcher.class.getName() + "::" + "test");
         command.add(Launcher.class.getName());
@@ -85,6 +108,14 @@ public class TestOnSpinWaitAArch64 {
             return;
         }
 
+        if ("wfet".equals(spinWaitInst) &&
+            (analyzer.contains("CPU does not support the SB instruction") ||
+             analyzer.contains("CPU does not support the FEAT_ECV") ||
+             analyzer.contains("CPU does not support the WFET instruction"))) {
+            System.out.println("Skipping the test. The CPU does not support SB or WFET instruction, or FEAT_ECV.");
+            return;
+        }
+
         analyzer.shouldHaveExitValue(0);
 
         System.out.println(analyzer.getOutput());
@@ -101,6 +132,9 @@ public class TestOnSpinWaitAArch64 {
           return "3f2003d5";
       } else if ("sb".equals(spinWaitInst)) {
           return "ff3003d5";
+      } else if ("wfet".equals(spinWaitInst)) {
+          // This assumes rscratch1 is r8.
+          return "081003d5";
       } else {
           throw new RuntimeException("Unknown spin wait instruction: " + spinWaitInst);
       }
@@ -166,7 +200,7 @@ public class TestOnSpinWaitAArch64 {
             // When code is disassembled, we have one instruction per line.
             // Otherwise, there can be multiple hex instructions separated by '|'.
             foundCount += (int)Arrays.stream(line.split("\\|"))
-                                     .takeWhile(i -> i.startsWith(expectedInst))
+                                     .filter(i -> i.startsWith(expectedInst))
                                      .count();
         }
 

From 78e9df5088a89ca49a43c846dca0f5c47a482f0a Mon Sep 17 00:00:00 2001
From: Leo Korinth <lkorinth@openjdk.org>
Date: Tue, 31 Mar 2026 11:41:57 +0000
Subject: [PATCH 432/655] 8380987: Fix implicit narrowing conversion in
 klass.hpp

Reviewed-by: stefank, ayang
---
 src/hotspot/share/oops/klass.hpp | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/src/hotspot/share/oops/klass.hpp b/src/hotspot/share/oops/klass.hpp
index d59db9744cb..1c6b28127b8 100644
--- a/src/hotspot/share/oops/klass.hpp
+++ b/src/hotspot/share/oops/klass.hpp
@@ -466,9 +466,9 @@ protected:
   static const int _lh_log2_element_size_shift = BitsPerByte*0;
   static const int _lh_log2_element_size_mask  = BitsPerLong-1;
   static const int _lh_element_type_shift      = BitsPerByte*1;
-  static const int _lh_element_type_mask       = right_n_bits(BitsPerByte);  // shifted mask
+  static const int _lh_element_type_mask       = right_n_bits<int>(BitsPerByte);  // shifted mask
   static const int _lh_header_size_shift       = BitsPerByte*2;
-  static const int _lh_header_size_mask        = right_n_bits(BitsPerByte);  // shifted mask
+  static const int _lh_header_size_mask        = right_n_bits<int>(BitsPerByte);  // shifted mask
   static const int _lh_array_tag_bits          = 2;
   static const int _lh_array_tag_shift         = BitsPerInt - _lh_array_tag_bits;
   static const int _lh_array_tag_obj_value     = ~0x01;   // 0x80000000 >> 30

From 8c38e725a57e2b20c27da170b99b8768253603b4 Mon Sep 17 00:00:00 2001
From: Ashutosh Mehra <asmehra@openjdk.org>
Date: Tue, 31 Mar 2026 14:11:06 +0000
Subject: [PATCH 433/655] 8380464: Inconsistency in emitting warning messages
 in vm_version_x86.cpp

Reviewed-by: kvn, dholmes
---
 src/hotspot/cpu/x86/vm_version_x86.cpp | 111 ++++++++++++++++---------
 1 file changed, 74 insertions(+), 37 deletions(-)

diff --git a/src/hotspot/cpu/x86/vm_version_x86.cpp b/src/hotspot/cpu/x86/vm_version_x86.cpp
index 4301bd328d6..a77105efbbf 100644
--- a/src/hotspot/cpu/x86/vm_version_x86.cpp
+++ b/src/hotspot/cpu/x86/vm_version_x86.cpp
@@ -1264,8 +1264,9 @@ void VM_Version::get_processor_features() {
       UseGHASHIntrinsics = true;
     }
   } else if (UseGHASHIntrinsics) {
-    if (!FLAG_IS_DEFAULT(UseGHASHIntrinsics))
+    if (!FLAG_IS_DEFAULT(UseGHASHIntrinsics)) {
       warning("GHASH intrinsic requires CLMUL and SSE2 instructions on this CPU");
+    }
     FLAG_SET_DEFAULT(UseGHASHIntrinsics, false);
   }
 
@@ -1275,26 +1276,27 @@ void VM_Version::get_processor_features() {
   // based on the VM capabilities whether to use an AVX2 or AVX512-enabled
   // version.
   if (UseAVX >= 1) {
-      if (FLAG_IS_DEFAULT(UseChaCha20Intrinsics)) {
-          UseChaCha20Intrinsics = true;
-      }
+    if (FLAG_IS_DEFAULT(UseChaCha20Intrinsics)) {
+      UseChaCha20Intrinsics = true;
+    }
   } else if (UseChaCha20Intrinsics) {
-      if (!FLAG_IS_DEFAULT(UseChaCha20Intrinsics)) {
-          warning("ChaCha20 intrinsic requires AVX instructions");
-      }
-      FLAG_SET_DEFAULT(UseChaCha20Intrinsics, false);
+    if (!FLAG_IS_DEFAULT(UseChaCha20Intrinsics)) {
+      warning("ChaCha20 intrinsic requires AVX instructions");
+    }
+    FLAG_SET_DEFAULT(UseChaCha20Intrinsics, false);
   }
 
   // Kyber Intrinsics
   // Currently we only have them for AVX512
   if (supports_evex() && supports_avx512bw()) {
-      if (FLAG_IS_DEFAULT(UseKyberIntrinsics)) {
-          UseKyberIntrinsics = true;
-      }
-  } else
-  if (UseKyberIntrinsics) {
-     warning("Intrinsics for ML-KEM are not available on this CPU.");
-     FLAG_SET_DEFAULT(UseKyberIntrinsics, false);
+    if (FLAG_IS_DEFAULT(UseKyberIntrinsics)) {
+      UseKyberIntrinsics = true;
+    }
+  } else if (UseKyberIntrinsics) {
+    if (!FLAG_IS_DEFAULT(UseKyberIntrinsics)) {
+      warning("Intrinsics for ML-KEM are not available on this CPU.");
+    }
+    FLAG_SET_DEFAULT(UseKyberIntrinsics, false);
   }
 
   // Dilithium Intrinsics
@@ -1303,8 +1305,10 @@ void VM_Version::get_processor_features() {
           UseDilithiumIntrinsics = true;
       }
   } else if (UseDilithiumIntrinsics) {
+    if (!FLAG_IS_DEFAULT(UseDilithiumIntrinsics)) {
       warning("Intrinsics for ML-DSA are not available on this CPU.");
-      FLAG_SET_DEFAULT(UseDilithiumIntrinsics, false);
+    }
+    FLAG_SET_DEFAULT(UseDilithiumIntrinsics, false);
   }
 
   // Base64 Intrinsics (Check the condition for which the intrinsic will be active)
@@ -1313,8 +1317,9 @@ void VM_Version::get_processor_features() {
       UseBASE64Intrinsics = true;
     }
   } else if (UseBASE64Intrinsics) {
-     if (!FLAG_IS_DEFAULT(UseBASE64Intrinsics))
+    if (!FLAG_IS_DEFAULT(UseBASE64Intrinsics)) {
       warning("Base64 intrinsic requires EVEX instructions on this CPU");
+    }
     FLAG_SET_DEFAULT(UseBASE64Intrinsics, false);
   }
 
@@ -1323,7 +1328,9 @@ void VM_Version::get_processor_features() {
       UseFMA = true;
     }
   } else if (UseFMA) {
-    warning("FMA instructions are not available on this CPU");
+    if (!FLAG_IS_DEFAULT(UseFMA)) {
+      warning("FMA instructions are not available on this CPU");
+    }
     FLAG_SET_DEFAULT(UseFMA, false);
   }
 
@@ -1336,7 +1343,9 @@ void VM_Version::get_processor_features() {
       UseSHA = true;
     }
   } else if (UseSHA) {
-    warning("SHA instructions are not available on this CPU");
+    if (!FLAG_IS_DEFAULT(UseSHA)) {
+      warning("SHA instructions are not available on this CPU");
+    }
     FLAG_SET_DEFAULT(UseSHA, false);
   }
 
@@ -1345,7 +1354,9 @@ void VM_Version::get_processor_features() {
       FLAG_SET_DEFAULT(UseSHA1Intrinsics, true);
     }
   } else if (UseSHA1Intrinsics) {
-    warning("Intrinsics for SHA-1 crypto hash functions not available on this CPU.");
+    if (!FLAG_IS_DEFAULT(UseSHA1Intrinsics)) {
+      warning("Intrinsics for SHA-1 crypto hash functions not available on this CPU.");
+    }
     FLAG_SET_DEFAULT(UseSHA1Intrinsics, false);
   }
 
@@ -1354,7 +1365,9 @@ void VM_Version::get_processor_features() {
       FLAG_SET_DEFAULT(UseSHA256Intrinsics, true);
     }
   } else if (UseSHA256Intrinsics) {
-    warning("Intrinsics for SHA-224 and SHA-256 crypto hash functions not available on this CPU.");
+    if (!FLAG_IS_DEFAULT(UseSHA256Intrinsics)) {
+      warning("Intrinsics for SHA-224 and SHA-256 crypto hash functions not available on this CPU.");
+    }
     FLAG_SET_DEFAULT(UseSHA256Intrinsics, false);
   }
 
@@ -1363,7 +1376,9 @@ void VM_Version::get_processor_features() {
       FLAG_SET_DEFAULT(UseSHA512Intrinsics, true);
     }
   } else if (UseSHA512Intrinsics) {
-    warning("Intrinsics for SHA-384 and SHA-512 crypto hash functions not available on this CPU.");
+    if (!FLAG_IS_DEFAULT(UseSHA512Intrinsics)) {
+      warning("Intrinsics for SHA-384 and SHA-512 crypto hash functions not available on this CPU.");
+    }
     FLAG_SET_DEFAULT(UseSHA512Intrinsics, false);
   }
 
@@ -1372,7 +1387,9 @@ void VM_Version::get_processor_features() {
       FLAG_SET_DEFAULT(UseSHA3Intrinsics, true);
     }
   } else if (UseSHA3Intrinsics) {
-    warning("Intrinsics for SHA3-224, SHA3-256, SHA3-384 and SHA3-512 crypto hash functions not available on this CPU.");
+    if (!FLAG_IS_DEFAULT(UseSHA3Intrinsics)) {
+      warning("Intrinsics for SHA3-224, SHA3-256, SHA3-384 and SHA3-512 crypto hash functions not available on this CPU.");
+    }
     FLAG_SET_DEFAULT(UseSHA3Intrinsics, false);
   }
 
@@ -1435,7 +1452,9 @@ void VM_Version::get_processor_features() {
       FLAG_SET_DEFAULT(UsePoly1305Intrinsics, true);
     }
   } else if (UsePoly1305Intrinsics) {
-    warning("Intrinsics for Poly1305 crypto hash functions not available on this CPU.");
+    if (!FLAG_IS_DEFAULT(UsePoly1305Intrinsics)) {
+      warning("Intrinsics for Poly1305 crypto hash functions not available on this CPU.");
+    }
     FLAG_SET_DEFAULT(UsePoly1305Intrinsics, false);
   }
 
@@ -1444,7 +1463,9 @@ void VM_Version::get_processor_features() {
       FLAG_SET_DEFAULT(UseIntPolyIntrinsics, true);
     }
   } else if (UseIntPolyIntrinsics) {
-    warning("Intrinsics for Polynomial crypto functions not available on this CPU.");
+    if (!FLAG_IS_DEFAULT(UseIntPolyIntrinsics)) {
+      warning("Intrinsics for Polynomial crypto functions not available on this CPU.");
+    }
     FLAG_SET_DEFAULT(UseIntPolyIntrinsics, false);
   }
 
@@ -1694,8 +1715,8 @@ void VM_Version::get_processor_features() {
     if (FLAG_IS_DEFAULT(UseSSE42Intrinsics)) {
       FLAG_SET_DEFAULT(UseSSE42Intrinsics, true);
     }
-  } else {
-    if (UseSSE42Intrinsics && !FLAG_IS_DEFAULT(UseSSE42Intrinsics)) {
+  } else if (UseSSE42Intrinsics) {
+    if (!FLAG_IS_DEFAULT(UseSSE42Intrinsics)) {
       warning("SSE4.2 intrinsics require SSE4.2 instructions or higher. Intrinsics will be disabled.");
     }
     FLAG_SET_DEFAULT(UseSSE42Intrinsics, false);
@@ -1705,15 +1726,17 @@ void VM_Version::get_processor_features() {
       UseVectorizedMismatchIntrinsic = true;
     }
   } else if (UseVectorizedMismatchIntrinsic) {
-    if (!FLAG_IS_DEFAULT(UseVectorizedMismatchIntrinsic))
+    if (!FLAG_IS_DEFAULT(UseVectorizedMismatchIntrinsic)) {
       warning("vectorizedMismatch intrinsics are not available on this CPU");
+    }
     FLAG_SET_DEFAULT(UseVectorizedMismatchIntrinsic, false);
   }
   if (UseAVX >= 2) {
     FLAG_SET_DEFAULT(UseVectorizedHashCodeIntrinsic, true);
   } else if (UseVectorizedHashCodeIntrinsic) {
-    if (!FLAG_IS_DEFAULT(UseVectorizedHashCodeIntrinsic))
+    if (!FLAG_IS_DEFAULT(UseVectorizedHashCodeIntrinsic)) {
       warning("vectorizedHashCode intrinsics are not available on this CPU");
+    }
     FLAG_SET_DEFAULT(UseVectorizedHashCodeIntrinsic, false);
   }
 
@@ -1723,7 +1746,9 @@ void VM_Version::get_processor_features() {
       UseCountLeadingZerosInstruction = true;
     }
    } else if (UseCountLeadingZerosInstruction) {
-    warning("lzcnt instruction is not available on this CPU");
+    if (!FLAG_IS_DEFAULT(UseCountLeadingZerosInstruction)) {
+      warning("lzcnt instruction is not available on this CPU");
+    }
     FLAG_SET_DEFAULT(UseCountLeadingZerosInstruction, false);
   }
 
@@ -1739,7 +1764,9 @@ void VM_Version::get_processor_features() {
       }
     }
   } else if (UseCountTrailingZerosInstruction) {
-    warning("tzcnt instruction is not available on this CPU");
+    if (!FLAG_IS_DEFAULT(UseCountTrailingZerosInstruction)) {
+      warning("tzcnt instruction is not available on this CPU");
+    }
     FLAG_SET_DEFAULT(UseCountTrailingZerosInstruction, false);
   }
 
@@ -1750,7 +1777,9 @@ void VM_Version::get_processor_features() {
       UseBMI1Instructions = true;
     }
   } else if (UseBMI1Instructions) {
-    warning("BMI1 instructions are not available on this CPU (AVX is also required)");
+    if (!FLAG_IS_DEFAULT(UseBMI1Instructions)) {
+      warning("BMI1 instructions are not available on this CPU (AVX is also required)");
+    }
     FLAG_SET_DEFAULT(UseBMI1Instructions, false);
   }
 
@@ -1759,7 +1788,9 @@ void VM_Version::get_processor_features() {
       UseBMI2Instructions = true;
     }
   } else if (UseBMI2Instructions) {
-    warning("BMI2 instructions are not available on this CPU (AVX is also required)");
+    if (!FLAG_IS_DEFAULT(UseBMI2Instructions)) {
+      warning("BMI2 instructions are not available on this CPU (AVX is also required)");
+    }
     FLAG_SET_DEFAULT(UseBMI2Instructions, false);
   }
 
@@ -1769,7 +1800,9 @@ void VM_Version::get_processor_features() {
       UsePopCountInstruction = true;
     }
   } else if (UsePopCountInstruction) {
-    warning("POPCNT instruction is not available on this CPU");
+    if (!FLAG_IS_DEFAULT(UsePopCountInstruction)) {
+      warning("POPCNT instruction is not available on this CPU");
+    }
     FLAG_SET_DEFAULT(UsePopCountInstruction, false);
   }
 
@@ -1779,7 +1812,9 @@ void VM_Version::get_processor_features() {
       UseFastStosb = true;
     }
   } else if (UseFastStosb) {
-    warning("fast-string operations are not available on this CPU");
+    if (!FLAG_IS_DEFAULT(UseFastStosb)) {
+      warning("fast-string operations are not available on this CPU");
+    }
     FLAG_SET_DEFAULT(UseFastStosb, false);
   }
 
@@ -1805,7 +1840,9 @@ void VM_Version::get_processor_features() {
       UseXMMForObjInit = true;
     }
   } else if (UseXMMForObjInit) {
-    warning("UseXMMForObjInit requires SSE2 and unaligned load/stores. Feature is switched off.");
+    if (!FLAG_IS_DEFAULT(UseXMMForObjInit)) {
+      warning("UseXMMForObjInit requires SSE2 and unaligned load/stores. Feature is switched off.");
+    }
     FLAG_SET_DEFAULT(UseXMMForObjInit, false);
   }
 
@@ -1885,7 +1922,7 @@ void VM_Version::get_processor_features() {
 
   if (FLAG_IS_DEFAULT(ContendedPaddingWidth) &&
      (cache_line_size > ContendedPaddingWidth))
-     ContendedPaddingWidth = cache_line_size;
+    ContendedPaddingWidth = cache_line_size;
 
   // This machine allows unaligned memory accesses
   if (FLAG_IS_DEFAULT(UseUnalignedAccesses)) {

From e3a66f0170ed8e6ca4a16d4897d7d3ffceb2553c Mon Sep 17 00:00:00 2001
From: Albert Mingkun Yang <ayang@openjdk.org>
Date: Tue, 31 Mar 2026 15:01:10 +0000
Subject: [PATCH 434/655] 8380649: Parallel: Inline initialize_region_data and
 create_vspace of ParallelCompactData

Reviewed-by: iwalulya, tschatzl
---
 .../share/gc/parallel/psParallelCompact.cpp   | 39 ++++++-------------
 .../share/gc/parallel/psParallelCompact.hpp   |  3 --
 2 files changed, 12 insertions(+), 30 deletions(-)

diff --git a/src/hotspot/share/gc/parallel/psParallelCompact.cpp b/src/hotspot/share/gc/parallel/psParallelCompact.cpp
index d03bc3cda45..ca1fd2c120b 100644
--- a/src/hotspot/share/gc/parallel/psParallelCompact.cpp
+++ b/src/hotspot/share/gc/parallel/psParallelCompact.cpp
@@ -232,14 +232,10 @@ bool ParallelCompactData::initialize(MemRegion reserved_heap)
 
   assert(region_align_down(_heap_start) == _heap_start,
          "region start not aligned");
+  assert(is_aligned(heap_size, RegionSize), "precondition");
 
-  return initialize_region_data(heap_size);
-}
-
-PSVirtualSpace*
-ParallelCompactData::create_vspace(size_t count, size_t element_size)
-{
-  const size_t raw_bytes = count * element_size;
+  const size_t count = heap_size >> Log2RegionSize;
+  const size_t raw_bytes = count * sizeof(RegionData);
   const size_t page_sz = os::page_size_for_region_aligned(raw_bytes, 10);
   const size_t granularity = os::vm_allocation_granularity();
   const size_t rs_align = MAX2(page_sz, granularity);
@@ -253,7 +249,7 @@ ParallelCompactData::create_vspace(size_t count, size_t element_size)
 
   if (!rs.is_reserved()) {
     // Failed to reserve memory.
-    return nullptr;
+    return false;
   }
 
   os::trace_page_sizes("Parallel Compact Data", raw_bytes, raw_bytes, rs.base(),
@@ -261,34 +257,23 @@ ParallelCompactData::create_vspace(size_t count, size_t element_size)
 
   MemTracker::record_virtual_memory_tag(rs, mtGC);
 
-  PSVirtualSpace* vspace = new PSVirtualSpace(rs, page_sz);
+  PSVirtualSpace* region_vspace = new PSVirtualSpace(rs, page_sz);
 
-  if (!vspace->expand_by(_reserved_byte_size)) {
+  if (!region_vspace->expand_by(_reserved_byte_size)) {
     // Failed to commit memory.
 
-    delete vspace;
+    delete region_vspace;
 
     // Release memory reserved in the space.
     MemoryReserver::release(rs);
 
-    return nullptr;
+    return false;
   }
 
-  return vspace;
-}
-
-bool ParallelCompactData::initialize_region_data(size_t heap_size)
-{
-  assert(is_aligned(heap_size, RegionSize), "precondition");
-
-  const size_t count = heap_size >> Log2RegionSize;
-  _region_vspace = create_vspace(count, sizeof(RegionData));
-  if (_region_vspace != nullptr) {
-    _region_data = (RegionData*)_region_vspace->reserved_low_addr();
-    _region_count = count;
-    return true;
-  }
-  return false;
+  _region_vspace = region_vspace;
+  _region_data = (RegionData*)_region_vspace->reserved_low_addr();
+  _region_count = count;
+  return true;
 }
 
 void ParallelCompactData::clear_range(size_t beg_region, size_t end_region) {
diff --git a/src/hotspot/share/gc/parallel/psParallelCompact.hpp b/src/hotspot/share/gc/parallel/psParallelCompact.hpp
index f5ab041fa97..25f4f66de6f 100644
--- a/src/hotspot/share/gc/parallel/psParallelCompact.hpp
+++ b/src/hotspot/share/gc/parallel/psParallelCompact.hpp
@@ -395,9 +395,6 @@ public:
 #endif  // #ifdef ASSERT
 
 private:
-  bool initialize_region_data(size_t heap_size);
-  PSVirtualSpace* create_vspace(size_t count, size_t element_size);
-
   HeapWord*       _heap_start;
 #ifdef  ASSERT
   HeapWord*       _heap_end;

From 819533964cb0fc015f51cd1deb44649f87b06f94 Mon Sep 17 00:00:00 2001
From: Chen Liang <liach@openjdk.org>
Date: Tue, 31 Mar 2026 15:08:02 +0000
Subject: [PATCH 435/655] 8380913: Sealed graph taglet omits public subtypes of
 invisible subtypes

Reviewed-by: hannesw, vromero
---
 .../build/tools/taglet/SealedGraph.java       |  45 +++++---
 .../TestSerializedFormWithClassFile.java      |   4 +-
 .../TestVisibleMembers.java                   |  12 +--
 .../jdk/javadoc/taglet/JdkTaglets.java        |  53 +++++++++
 .../taglet/sealedGraph/TestSealedTaglet.java  | 101 ++++++++++++++++++
 .../tools/lib/builder/AbstractBuilder.java    |   9 +-
 .../tools/lib/builder/ClassBuilder.java       |  48 ++++++---
 test/langtools/tools/lib/toolbox/ToolBox.java |  23 +++-
 8 files changed, 256 insertions(+), 39 deletions(-)
 create mode 100644 test/langtools/jdk/javadoc/taglet/JdkTaglets.java
 create mode 100644 test/langtools/jdk/javadoc/taglet/sealedGraph/TestSealedTaglet.java

diff --git a/make/jdk/src/classes/build/tools/taglet/SealedGraph.java b/make/jdk/src/classes/build/tools/taglet/SealedGraph.java
index 3e93826c180..2ffd92e3409 100644
--- a/make/jdk/src/classes/build/tools/taglet/SealedGraph.java
+++ b/make/jdk/src/classes/build/tools/taglet/SealedGraph.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2022, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2022, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -138,20 +138,25 @@ public final class SealedGraph implements Taglet {
 
         // Generates a graph in DOT format
         String graph(TypeElement rootClass, Set<String> exports) {
+            if (!isInPublicApi(rootClass, exports)) {
+                // Alternatively we can return "" for the graph since there is no single root to render
+                throw new IllegalArgumentException("Root not in public API: " + rootClass.getQualifiedName());
+            }
             final State state = new State(rootClass);
             traverse(state, rootClass, exports);
             return state.render();
         }
 
         static void traverse(State state, TypeElement node, Set<String> exports) {
+            if (!isInPublicApi(node, exports)) {
+                throw new IllegalArgumentException("Bad request, not in public API: " + node.getQualifiedName());
+            }
             state.addNode(node);
             if (!(node.getModifiers().contains(Modifier.SEALED) || node.getModifiers().contains(Modifier.FINAL))) {
                 state.addNonSealedEdge(node);
             } else {
                 for (TypeElement subNode : permittedSubclasses(node, exports)) {
-                    if (isInPublicApi(node, exports) && isInPublicApi(subNode, exports)) {
-                        state.addEdge(node, subNode);
-                    }
+                    state.addEdge(node, subNode);
                     traverse(state, subNode, exports);
                 }
             }
@@ -292,14 +297,30 @@ public final class SealedGraph implements Taglet {
         }
 
         private static List<TypeElement> permittedSubclasses(TypeElement node, Set<String> exports) {
-            return node.getPermittedSubclasses().stream()
-                    .filter(DeclaredType.class::isInstance)
-                    .map(DeclaredType.class::cast)
-                    .map(DeclaredType::asElement)
-                    .filter(TypeElement.class::isInstance)
-                    .map(TypeElement.class::cast)
-                    .filter(te -> isInPublicApi(te, exports))
-                    .toList();
+            List<TypeElement> dfsStack = new ArrayList<TypeElement>().reversed(); // Faster operations to head
+            SequencedCollection<TypeElement> result = new LinkedHashSet<>(); // Deduplicate diamond interface inheritance
+            // The starting node may be in the public API - still expand it
+            prependSubclasses(node, dfsStack);
+
+            while (!dfsStack.isEmpty()) {
+                TypeElement now = dfsStack.removeFirst();
+                if (isInPublicApi(now, exports)) {
+                    result.addLast(now);
+                } else {
+                    // Skip the non-exported classes in the hierarchy
+                    prependSubclasses(now, dfsStack);
+                }
+            }
+
+            return List.copyOf(result);
+        }
+
+        private static void prependSubclasses(TypeElement node, List<TypeElement> dfs) {
+            for (var e : node.getPermittedSubclasses().reversed()) {
+                if (e instanceof DeclaredType dt && dt.asElement() instanceof TypeElement te) {
+                    dfs.addFirst(te);
+                }
+            }
         }
 
         private static boolean isInPublicApi(TypeElement typeElement, Set<String> exports) {
diff --git a/test/langtools/jdk/javadoc/doclet/testSerializedFormWithClassFile/TestSerializedFormWithClassFile.java b/test/langtools/jdk/javadoc/doclet/testSerializedFormWithClassFile/TestSerializedFormWithClassFile.java
index 25613dffd95..1db0b6af8d4 100644
--- a/test/langtools/jdk/javadoc/doclet/testSerializedFormWithClassFile/TestSerializedFormWithClassFile.java
+++ b/test/langtools/jdk/javadoc/doclet/testSerializedFormWithClassFile/TestSerializedFormWithClassFile.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2022, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -106,8 +106,8 @@ public class TestSerializedFormWithClassFile extends JavadocTester {
         new JavacTask(tb).files(srcDir.resolve("A.java")).outdir(classes).run();
 
         new ClassBuilder(tb, "B")
-                .setExtends("A")
                 .setModifiers("public", "class")
+                .setExtends("A")
                 .write(srcDir);
     }
 }
diff --git a/test/langtools/jdk/javadoc/doclet/testVisibleMembers/TestVisibleMembers.java b/test/langtools/jdk/javadoc/doclet/testVisibleMembers/TestVisibleMembers.java
index 09f6f92e2b6..fe5f1212b09 100644
--- a/test/langtools/jdk/javadoc/doclet/testVisibleMembers/TestVisibleMembers.java
+++ b/test/langtools/jdk/javadoc/doclet/testVisibleMembers/TestVisibleMembers.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2002, 2022, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2002, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -135,7 +135,7 @@ public class TestVisibleMembers extends JavadocTester {
                 "@param lvalue an lvalue", "@return something");
 
         new ClassBuilder(tb, "p.B")
-                .setModifiers( "public", "interface")
+                .setModifiers("public", "interface")
                 .setExtends("A")
                 .addMembers(mbWith1, mbWith2)
                 .write(srcDir);
@@ -358,7 +358,7 @@ public class TestVisibleMembers extends JavadocTester {
                         MethodBuilder.parse("public I sub() {return null;}"),
                         MethodBuilder.parse("public I sub1() {return null;}")
                                 .setComments(Kind.INHERIT_DOC),
-                        MethodBuilder.parse(" public void method() {}")
+                        MethodBuilder.parse("public void method() {}")
                                 .setComments("A method ", "@see #sub", "@see #sub1"),
                         MethodBuilder.parse("public int length(){return 1;}")
                                 .setComments(Kind.NO_API_COMMENT)
@@ -380,7 +380,7 @@ public class TestVisibleMembers extends JavadocTester {
                 ).write(srcDir);
 
         new ClassBuilder(tb, "p.QLong<P, Q, R>")
-                .setModifiers("public interface")
+                .setModifiers("public", "interface")
                 .addMembers(
                         MethodBuilder.parse("default void forEach(Q action) {}")
                 ).write(srcDir);
@@ -663,7 +663,7 @@ public class TestVisibleMembers extends JavadocTester {
                 ).write(srcDir);
 
         new ClassBuilder(tb, "p.I3")
-                .setExtends("I1, I2")
+                .addImplements("I1", "I2")
                 .setModifiers("public", "interface")
                 .addMembers(
                         FieldBuilder.parse("public static int field = 3;"),
@@ -677,8 +677,8 @@ public class TestVisibleMembers extends JavadocTester {
                 .write(srcDir);
 
         new ClassBuilder(tb, "p.C2")
-                .setExtends("C1")
                 .setModifiers("public", "abstract", "class")
+                .setExtends("C1")
                 .addMembers(
                         FieldBuilder.parse("public int field;"),
                         MethodBuilder.parse("public void method(){}"),
diff --git a/test/langtools/jdk/javadoc/taglet/JdkTaglets.java b/test/langtools/jdk/javadoc/taglet/JdkTaglets.java
new file mode 100644
index 00000000000..537904450aa
--- /dev/null
+++ b/test/langtools/jdk/javadoc/taglet/JdkTaglets.java
@@ -0,0 +1,53 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+import java.io.IOException;
+import java.nio.file.Files;
+import java.nio.file.Path;
+import java.util.stream.Stream;
+
+import toolbox.JavacTask;
+import toolbox.ToolBox;
+
+/// Utilities to build the JDK-specific taglets.
+/// This guy uses JavacTask so can't be in javadoc.tester.
+public final class JdkTaglets {
+
+    /// Build a taglet and return its path for `-tagletpath`.
+    public static Path build(ToolBox tb, Path base, String... tagletFiles) throws IOException {
+        Path tagletOutDir = base.resolve("tagletClasses");
+        Files.createDirectories(tagletOutDir);
+        tb.cleanDirectory(tagletOutDir);
+        Path tagletRoot = tb.findFromTestRoot("../../make/jdk/src/classes/build/tools/taglet");
+
+        new JavacTask(tb)
+                .files(Stream.of(tagletFiles)
+                        .map(tagletFile -> tagletRoot.resolve(tagletFile + ".java"))
+                        .toArray(Path[]::new))
+                .outdir(tagletOutDir)
+                .run(JavacTask.Expect.SUCCESS);
+        return tagletOutDir;
+    }
+
+    private JdkTaglets() {}
+}
diff --git a/test/langtools/jdk/javadoc/taglet/sealedGraph/TestSealedTaglet.java b/test/langtools/jdk/javadoc/taglet/sealedGraph/TestSealedTaglet.java
new file mode 100644
index 00000000000..3ac6f0601b2
--- /dev/null
+++ b/test/langtools/jdk/javadoc/taglet/sealedGraph/TestSealedTaglet.java
@@ -0,0 +1,101 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+/*
+ * @test
+ * @summary General tests for SealedGraph block tag
+ * @bug 8380913
+ * @library /tools/lib /jdk/javadoc/lib ../
+ * @modules jdk.compiler/com.sun.tools.javac.api
+ *          jdk.compiler/com.sun.tools.javac.main
+ *          jdk.javadoc/jdk.javadoc.internal.tool
+ * @build javadoc.tester.* toolbox.ToolBox builder.ClassBuilder JdkTaglets
+ * @run main ${test.main.class}
+ */
+
+import java.nio.file.Path;
+
+import builder.ClassBuilder;
+import javadoc.tester.JavadocTester;
+import toolbox.ToolBox;
+
+public class TestSealedTaglet extends JavadocTester {
+
+    final ToolBox tb;
+    final Path tagletPath;
+
+    public static void main(String... args) throws Exception {
+        var tester = new TestSealedTaglet();
+        tester.runTests();
+    }
+
+    TestSealedTaglet() throws Exception {
+        tb = new ToolBox();
+        tagletPath = JdkTaglets.build(tb, Path.of(""), "SealedGraph");
+        setAutomaticCheckLinks(false); // Don't fail for missing svg
+    }
+
+    @Test
+    public void testInvisibleInMiddle(Path base) throws Exception {
+        Path srcDir = base.resolve("src");
+        Path outDir = base.resolve("out");
+
+        tb.writeFile(srcDir.resolve("module-info.java"),
+                """
+                module test {
+                    exports pkg;
+                }
+                """);
+        new ClassBuilder(tb, "pkg.A")
+                .setModifiers("public", "abstract", "sealed", "interface")
+                .setComments("@sealedGraph")
+                .addPermits("pkg.B")
+                .write(srcDir);
+        new ClassBuilder(tb, "pkg.B")
+                .setModifiers("abstract", "sealed", "interface")
+                .addImplements("pkg.A")
+                .addPermits("pkg.C", "pkg.D")
+                .write(srcDir);
+        new ClassBuilder(tb, "pkg.C")
+                .setModifiers("abstract", "sealed", "interface")
+                .addImplements("pkg.A", "pkg.B")
+                .addPermits("pkg.D")
+                .write(srcDir);
+        new ClassBuilder(tb, "pkg.D")
+                .setModifiers("public", "final", "class")
+                .addImplements("pkg.B", "pkg.C")
+                .write(srcDir);
+
+        System.setProperty("sealedDotOutputDir", outDir.toString());
+
+        javadoc("-tagletpath", tagletPath.toString(),
+                "-taglet", "build.tools.taglet.SealedGraph",
+                "-d", outDir.toString(),
+                "-sourcepath", srcDir.toString(),
+                "pkg");
+
+        checkExit(Exit.OK);
+        // D is displayed as a direct subtype of A, bypassing B, C, one link only
+        checkUnique("test_pkg.A.dot", "\"pkg.D\" -> \"pkg.A\";");
+    }
+}
diff --git a/test/langtools/tools/lib/builder/AbstractBuilder.java b/test/langtools/tools/lib/builder/AbstractBuilder.java
index e528fe60792..4717f456d08 100644
--- a/test/langtools/tools/lib/builder/AbstractBuilder.java
+++ b/test/langtools/tools/lib/builder/AbstractBuilder.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -203,6 +203,13 @@ public abstract class AbstractBuilder {
             this.modifiers = modifiers;
         }
 
+        boolean isInterface() {
+            if (modifiers.isEmpty()) {
+                throw new IllegalStateException("modifiers not initialized");
+            }
+            return modifiers.getLast().endsWith("interface");
+        }
+
         @Override
         public String toString() {
             OutputWriter ow = new OutputWriter();
diff --git a/test/langtools/tools/lib/builder/ClassBuilder.java b/test/langtools/tools/lib/builder/ClassBuilder.java
index feafa77db56..2c57f0e0c13 100644
--- a/test/langtools/tools/lib/builder/ClassBuilder.java
+++ b/test/langtools/tools/lib/builder/ClassBuilder.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2022, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -30,6 +30,7 @@ import java.nio.file.Files;
 import java.nio.file.Path;
 import java.nio.file.Paths;
 import java.util.ArrayList;
+import java.util.Arrays;
 import java.util.List;
 import java.util.ListIterator;
 import java.util.regex.Matcher;
@@ -54,6 +55,7 @@ public class ClassBuilder extends AbstractBuilder {
 
     private String extendsType;
     private final List<String> implementsTypes;
+    private final List<String> permitsTypes;
     private final List<MemberBuilder> members;
     private final List<ClassBuilder> inners;
     private final List<ClassBuilder> nested;
@@ -86,6 +88,7 @@ public class ClassBuilder extends AbstractBuilder {
         }
         imports = new ArrayList<>();
         implementsTypes = new ArrayList<>();
+        permitsTypes = new ArrayList<>();
         members = new ArrayList<>();
         nested = new ArrayList<>();
         inners = new ArrayList<>();
@@ -153,7 +156,11 @@ public class ClassBuilder extends AbstractBuilder {
      * @return this builder.
      */
     public ClassBuilder setExtends(String name) {
-        extendsType = name;
+        if (modifiers.isInterface()) {
+            implementsTypes.add(name);
+        } else {
+            extendsType = name;
+        }
         return this;
     }
 
@@ -163,7 +170,17 @@ public class ClassBuilder extends AbstractBuilder {
      * @return this builder.
      */
     public ClassBuilder addImplements(String... names) {
-        implementsTypes.addAll(List.of(names));
+        implementsTypes.addAll(Arrays.asList(names));
+        return this;
+    }
+
+    /**
+     * Adds a permits declaration(s).
+     * @param names the subtypes
+     * @return this builder
+     */
+    public ClassBuilder addPermits(String... names) {
+        permitsTypes.addAll(Arrays.asList(names));
         return this;
     }
 
@@ -225,28 +242,25 @@ public class ClassBuilder extends AbstractBuilder {
                 ow.println("// NO_API_COMMENT");
                 break;
         }
+        assert !modifiers.modifiers.isEmpty();
         ow.print(modifiers.toString());
         ow.print(clsname);
         if (typeParameter != null) {
-            ow.print(typeParameter + " ");
-        } else {
-            ow.print(" ");
+            ow.print(typeParameter);
         }
         if (extendsType != null && !extendsType.isEmpty()) {
-            ow.print("extends " + extendsType + " ");
+            assert !modifiers.isInterface();
+            ow.print(" extends " + extendsType);
         }
         if (!implementsTypes.isEmpty()) {
-            ow.print("implements ");
-
-            ListIterator<String> iter = implementsTypes.listIterator();
-            while (iter.hasNext()) {
-                String s = iter.next() ;
-                ow.print(s);
-                if (iter.hasNext())
-                    ow.print(", ");
-            }
+            ow.print(modifiers.isInterface() ? " extends " : " implements ");
+            ow.print(String.join(", ", implementsTypes));
         }
-        ow.print("{");
+        if (!permitsTypes.isEmpty()) {
+            ow.print(" permits ");
+            ow.print(String.join(", ", permitsTypes));
+        }
+        ow.print(" {");
         if (!nested.isEmpty()) {
             ow.println("");
             nested.forEach(m -> ow.println(m.toString()));
diff --git a/test/langtools/tools/lib/toolbox/ToolBox.java b/test/langtools/tools/lib/toolbox/ToolBox.java
index ee217ab2c0c..1cb2fa6d3f9 100644
--- a/test/langtools/tools/lib/toolbox/ToolBox.java
+++ b/test/langtools/tools/lib/toolbox/ToolBox.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2013, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2013, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -666,6 +666,27 @@ public class ToolBox {
         return Path.of(testJDK, "bin", tool);
     }
 
+    /**
+     * Finds a file with a path relative to the langtools test root directory.
+     *
+     * @param path the desired path from test/langtools
+     * @return the file, if found
+     */
+    public Path findFromTestRoot(String path) {
+        Path testSrc = Path.of(System.getProperty("test.src", "."));
+
+        for (Path d = testSrc; d != null; d = d.getParent()) {
+            if (Files.exists(d.resolve("TEST.ROOT"))) {
+                Path file = d.resolve(path);
+                if (Files.exists(file)) {
+                    return file;
+                }
+            }
+        }
+
+        return null;
+    }
+
     /**
      * Returns a string representing the contents of an {@code Iterable} as a list.
      *

From 74eff77554acf6186e7f12546215efb493d0f90d Mon Sep 17 00:00:00 2001
From: Matias Saavedra Silva <matsaave@openjdk.org>
Date: Tue, 31 Mar 2026 15:51:40 +0000
Subject: [PATCH 436/655] 8347462: Improve TraceClassLoading to add link
 information

Reviewed-by: dholmes, coleenp
---
 src/hotspot/share/oops/instanceKlass.cpp      |  6 ++
 .../jtreg/runtime/logging/LogLinkingTest.java | 48 ++++++++++++++
 .../logging/classes/test/LinkageErrorApp.java | 64 +++++++++++++++++++
 3 files changed, 118 insertions(+)
 create mode 100644 test/hotspot/jtreg/runtime/logging/LogLinkingTest.java
 create mode 100644 test/hotspot/jtreg/runtime/logging/classes/test/LinkageErrorApp.java

diff --git a/src/hotspot/share/oops/instanceKlass.cpp b/src/hotspot/share/oops/instanceKlass.cpp
index d3333e72c2a..cb071f2abf0 100644
--- a/src/hotspot/share/oops/instanceKlass.cpp
+++ b/src/hotspot/share/oops/instanceKlass.cpp
@@ -1121,6 +1121,12 @@ bool InstanceKlass::link_class_impl(TRAPS) {
       }
     }
   }
+
+  if (log_is_enabled(Info, class, link))  {
+    ResourceMark rm(THREAD);
+    log_info(class, link)("Linked class %s", external_name());
+  }
+
   return true;
 }
 
diff --git a/test/hotspot/jtreg/runtime/logging/LogLinkingTest.java b/test/hotspot/jtreg/runtime/logging/LogLinkingTest.java
new file mode 100644
index 00000000000..86958a60ca0
--- /dev/null
+++ b/test/hotspot/jtreg/runtime/logging/LogLinkingTest.java
@@ -0,0 +1,48 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+
+/*
+ * @test LogLinkingTest
+ * @bug 8347462
+ * @library /test/lib
+ * @library classes
+ * @requires vm.flagless
+ * @build test.LinkageErrorApp
+ * @run driver LogLinkingTest
+ */
+
+import jdk.test.lib.process.ProcessTools;
+import jdk.test.lib.process.OutputAnalyzer;
+
+public class LogLinkingTest {
+    public static void main(String[] args) throws Exception {
+        ProcessBuilder pb = ProcessTools.createLimitedTestJavaProcessBuilder("-Xlog:class+load,class+link", "LinkageErrorApp");
+        OutputAnalyzer output = new OutputAnalyzer(pb.start());
+        output.shouldHaveExitValue(1);
+        output.shouldMatch("class,load.*SingleDefinition source");
+        output.shouldMatch("class,load.*DuplicateDefinition source");
+        output.shouldMatch("class,link.*Linked class.*SingleDefinition");
+        output.shouldNotMatch("class,link.*Linked class.*DuplicateDefinition");
+    }
+}
diff --git a/test/hotspot/jtreg/runtime/logging/classes/test/LinkageErrorApp.java b/test/hotspot/jtreg/runtime/logging/classes/test/LinkageErrorApp.java
new file mode 100644
index 00000000000..79b8781a468
--- /dev/null
+++ b/test/hotspot/jtreg/runtime/logging/classes/test/LinkageErrorApp.java
@@ -0,0 +1,64 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+import java.io.IOException;
+import java.io.InputStream;
+
+public class LinkageErrorApp {
+
+    static class SingleDefinition { }
+    static class DuplicateDefinition { }
+
+    static class DuplicateLoader extends ClassLoader {
+        DuplicateLoader() {
+            super(null);
+        }
+
+        Class<?> define(byte[] bytes, String classname) {
+            return defineClass(classname, bytes, 0, bytes.length);
+        }
+    }
+
+    private static byte[] readClassBytes(Class<?> clazz) throws IOException {
+        String resource = clazz.getName().replace('.', '/') + ".class";
+        ClassLoader loader = clazz.getClassLoader();
+        if (loader != null) {
+            InputStream in = loader.getResourceAsStream(resource);
+            if (in == null) {
+                throw new RuntimeException("Could not find " + clazz.getName());
+            }
+            return in.readAllBytes();
+        }
+        return null;
+    }
+
+    public static void main(String[] args) throws Exception {
+        byte[] duplicateDefBytes = readClassBytes(DuplicateDefinition.class);
+        DuplicateLoader loader = new DuplicateLoader();
+
+        SingleDefinition s = new SingleDefinition();
+        loader.define(duplicateDefBytes, "LinkageErrorApp$DuplicateDefinition");
+        // This will throw a LinkageError
+        loader.define(duplicateDefBytes, "LinkageErrorApp$DuplicateDefinition");
+    }
+}

From ba34f300db6388d343dd9c496de4830dc62d31a7 Mon Sep 17 00:00:00 2001
From: Dingli Zhang <dzhang@openjdk.org>
Date: Tue, 31 Mar 2026 15:56:48 +0000
Subject: [PATCH 437/655] 8381250: Enable VectorLogicalOpIdentityTest.java IR
 tests for RISC-V

Reviewed-by: fyang
---
 .../vectorapi/VectorLogicalOpIdentityTest.java  | 17 +++++++++--------
 1 file changed, 9 insertions(+), 8 deletions(-)

diff --git a/test/hotspot/jtreg/compiler/vectorapi/VectorLogicalOpIdentityTest.java b/test/hotspot/jtreg/compiler/vectorapi/VectorLogicalOpIdentityTest.java
index 1a2402222ed..df178f5363e 100644
--- a/test/hotspot/jtreg/compiler/vectorapi/VectorLogicalOpIdentityTest.java
+++ b/test/hotspot/jtreg/compiler/vectorapi/VectorLogicalOpIdentityTest.java
@@ -1,6 +1,6 @@
 /*
  * Copyright (c) 2022, 2023, Arm Limited. All rights reserved.
- * Copyright (c) 2023, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2023, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -45,7 +45,8 @@ import jdk.test.lib.Utils;
  * @key randomness
  * @library /test/lib /
  * @summary Add identity transformations for vector logic operations
- * @requires (os.simpleArch == "x64" & vm.cpu.features ~= ".*avx.*") | os.arch=="aarch64"
+ * @requires (os.simpleArch == "x64" & vm.cpu.features ~= ".*avx.*") | os.arch=="aarch64" |
+             (os.arch == "riscv64" & vm.cpu.features ~= ".*rvv.*")
  * @modules jdk.incubator.vector
  *
  * @run driver compiler.vectorapi.VectorLogicalOpIdentityTest
@@ -302,7 +303,7 @@ public class VectorLogicalOpIdentityTest {
     // Transform AndV(AndV(a, b, m), b, m) ==> AndV(a, b, m)
     @Test
     @Warmup(10000)
-    @IR(counts = {IRNode.AND_VI, "1"}, applyIfCPUFeatureOr = {"sve", "true", "avx512", "true"})
+    @IR(counts = {IRNode.AND_VI, "1"}, applyIfCPUFeatureOr = {"sve", "true", "avx512", "true", "rvv", "true"})
     public static void testAndMaskSameValue1() {
         VectorMask<Integer> mask = VectorMask.fromArray(I_SPECIES, m, 0);
         IntVector av = IntVector.fromArray(I_SPECIES, ia, 0);
@@ -323,7 +324,7 @@ public class VectorLogicalOpIdentityTest {
     // Transform AndV(AndV(a, b, m), a, m) ==> AndV(a, b, m)
     @Test
     @Warmup(10000)
-    @IR(counts = {IRNode.AND_VL, "1"}, applyIfCPUFeatureOr = {"sve", "true", "avx512", "true"})
+    @IR(counts = {IRNode.AND_VL, "1"}, applyIfCPUFeatureOr = {"sve", "true", "avx512", "true", "rvv", "true"})
     public static void testAndMaskSameValue2() {
         VectorMask<Long> mask = VectorMask.fromArray(L_SPECIES, m, 0);
         LongVector av = LongVector.fromArray(L_SPECIES, la, 0);
@@ -344,7 +345,7 @@ public class VectorLogicalOpIdentityTest {
     // Transform AndV(a, AndV(a, b, m), m) ==> AndV(a, b, m)
     @Test
     @Warmup(10000)
-    @IR(counts = {IRNode.AND_VI, "1"}, applyIfCPUFeatureOr = {"sve", "true", "avx512", "true"})
+    @IR(counts = {IRNode.AND_VI, "1"}, applyIfCPUFeatureOr = {"sve", "true", "avx512", "true", "rvv", "true"})
     public static void testAndMaskSameValue3() {
         VectorMask<Integer> mask = VectorMask.fromArray(I_SPECIES, m, 0);
         IntVector av = IntVector.fromArray(I_SPECIES, ia, 0);
@@ -566,7 +567,7 @@ public class VectorLogicalOpIdentityTest {
     // Transform OrV(OrV(a, b, m), b, m) ==> OrV(a, b, m)
     @Test
     @Warmup(10000)
-    @IR(counts = {IRNode.OR_VI, "1"}, applyIfCPUFeatureOr = {"sve", "true", "avx512", "true"})
+    @IR(counts = {IRNode.OR_VI, "1"}, applyIfCPUFeatureOr = {"sve", "true", "avx512", "true", "rvv", "true"})
     public static void testOrMaskSameValue1() {
         VectorMask<Integer> mask = VectorMask.fromArray(I_SPECIES, m, 0);
         IntVector av = IntVector.fromArray(I_SPECIES, ia, 0);
@@ -587,7 +588,7 @@ public class VectorLogicalOpIdentityTest {
     // Transform OrV(OrV(a, b, m), a, m) ==> OrV(a, b, m)
     @Test
     @Warmup(10000)
-    @IR(counts = {IRNode.OR_VL, "1"}, applyIfCPUFeatureOr = {"sve", "true", "avx512", "true"})
+    @IR(counts = {IRNode.OR_VL, "1"}, applyIfCPUFeatureOr = {"sve", "true", "avx512", "true", "rvv", "true"})
     public static void testOrMaskSameValue2() {
         VectorMask<Long> mask = VectorMask.fromArray(L_SPECIES, m, 0);
         LongVector av = LongVector.fromArray(L_SPECIES, la, 0);
@@ -608,7 +609,7 @@ public class VectorLogicalOpIdentityTest {
     // Transform OrV(a, OrV(a, b, m), m) ==> OrV(a, b, m)
     @Test
     @Warmup(10000)
-    @IR(counts = {IRNode.OR_VI, "1"}, applyIfCPUFeatureOr = {"sve", "true", "avx512", "true"})
+    @IR(counts = {IRNode.OR_VI, "1"}, applyIfCPUFeatureOr = {"sve", "true", "avx512", "true", "rvv", "true"})
     public static void testOrMaskSameValue3() {
         VectorMask<Integer> mask = VectorMask.fromArray(I_SPECIES, m, 0);
         IntVector av = IntVector.fromArray(I_SPECIES, ia, 0);

From 207bb159b2bc53348599b256c3b3b16137c6b4b0 Mon Sep 17 00:00:00 2001
From: Coleen Phillimore <coleenp@openjdk.org>
Date: Tue, 31 Mar 2026 16:52:34 +0000
Subject: [PATCH 438/655] 8381409: Fix whitespace and variable name in
 classfile code

Reviewed-by: liach, lfoltan
---
 .../share/classfile/classFileParser.cpp       | 18 +++++-----
 .../share/classfile/fieldLayoutBuilder.cpp    | 26 +++++++-------
 .../share/classfile/fieldLayoutBuilder.hpp    |  6 ++--
 .../share/classfile/stackMapTableFormat.hpp   | 35 ++++++++++++-------
 .../share/classfile/systemDictionary.cpp      |  4 +--
 5 files changed, 50 insertions(+), 39 deletions(-)

diff --git a/src/hotspot/share/classfile/classFileParser.cpp b/src/hotspot/share/classfile/classFileParser.cpp
index c1f00cbe536..404693f5cee 100644
--- a/src/hotspot/share/classfile/classFileParser.cpp
+++ b/src/hotspot/share/classfile/classFileParser.cpp
@@ -194,7 +194,7 @@ void ClassFileParser::parse_constant_pool_entries(const ClassFileStream* const s
     // so we don't need bounds-check for reading tag.
     const u1 tag = cfs->get_u1_fast();
     switch (tag) {
-      case JVM_CONSTANT_Class : {
+      case JVM_CONSTANT_Class: {
         cfs->guarantee_more(3, CHECK);  // name_index, tag/access_flags
         const u2 name_index = cfs->get_u2_fast();
         cp->klass_index_at_put(index, name_index);
@@ -4403,14 +4403,14 @@ void ClassFileParser::verify_legal_field_modifiers(jint flags,
                                                    TRAPS) const {
   if (!_need_verify) { return; }
 
-  const bool is_public    = (flags & JVM_ACC_PUBLIC)    != 0;
-  const bool is_protected = (flags & JVM_ACC_PROTECTED) != 0;
-  const bool is_private   = (flags & JVM_ACC_PRIVATE)   != 0;
-  const bool is_static    = (flags & JVM_ACC_STATIC)    != 0;
-  const bool is_final     = (flags & JVM_ACC_FINAL)     != 0;
-  const bool is_volatile  = (flags & JVM_ACC_VOLATILE)  != 0;
-  const bool is_transient = (flags & JVM_ACC_TRANSIENT) != 0;
-  const bool is_enum      = (flags & JVM_ACC_ENUM)      != 0;
+  const bool is_public    = (flags & JVM_ACC_PUBLIC)      != 0;
+  const bool is_protected = (flags & JVM_ACC_PROTECTED)   != 0;
+  const bool is_private   = (flags & JVM_ACC_PRIVATE)     != 0;
+  const bool is_static    = (flags & JVM_ACC_STATIC)      != 0;
+  const bool is_final     = (flags & JVM_ACC_FINAL)       != 0;
+  const bool is_volatile  = (flags & JVM_ACC_VOLATILE)    != 0;
+  const bool is_transient = (flags & JVM_ACC_TRANSIENT)   != 0;
+  const bool is_enum      = (flags & JVM_ACC_ENUM)        != 0;
   const bool major_gte_1_5 = _major_version >= JAVA_1_5_VERSION;
 
   bool is_illegal = false;
diff --git a/src/hotspot/share/classfile/fieldLayoutBuilder.cpp b/src/hotspot/share/classfile/fieldLayoutBuilder.cpp
index 8a9f5946091..adf4e1e63fa 100644
--- a/src/hotspot/share/classfile/fieldLayoutBuilder.cpp
+++ b/src/hotspot/share/classfile/fieldLayoutBuilder.cpp
@@ -37,7 +37,7 @@
 LayoutRawBlock::LayoutRawBlock(Kind kind, int size) :
   _next_block(nullptr),
   _prev_block(nullptr),
-  _kind(kind),
+  _block_kind(kind),
   _offset(-1),
   _alignment(1),
   _size(size),
@@ -52,7 +52,7 @@ LayoutRawBlock::LayoutRawBlock(Kind kind, int size) :
 LayoutRawBlock::LayoutRawBlock(int index, Kind kind, int size, int alignment, bool is_reference) :
  _next_block(nullptr),
  _prev_block(nullptr),
- _kind(kind),
+ _block_kind(kind),
  _offset(-1),
  _alignment(alignment),
  _size(size),
@@ -148,8 +148,8 @@ void FieldLayout::initialize_instance_layout(const InstanceKlass* super_klass, b
 
 LayoutRawBlock* FieldLayout::first_field_block() {
   LayoutRawBlock* block = _start;
-  while (block->kind() != LayoutRawBlock::INHERITED && block->kind() != LayoutRawBlock::REGULAR
-      && block->kind() != LayoutRawBlock::FLATTENED && block->kind() != LayoutRawBlock::PADDING) {
+  while (block->block_kind() != LayoutRawBlock::INHERITED && block->block_kind() != LayoutRawBlock::REGULAR
+      && block->block_kind() != LayoutRawBlock::FLATTENED && block->block_kind() != LayoutRawBlock::PADDING) {
     block = block->next_block();
   }
   return block;
@@ -190,7 +190,7 @@ void FieldLayout::add(GrowableArray<LayoutRawBlock*>* list, LayoutRawBlock* star
       assert(cursor != nullptr, "Sanity check");
       last_search_success = true;
       while (cursor != start) {
-        if (cursor->kind() == LayoutRawBlock::EMPTY && cursor->fit(b->size(), b->alignment())) {
+        if (cursor->block_kind() == LayoutRawBlock::EMPTY && cursor->fit(b->size(), b->alignment())) {
           if (candidate == nullptr || cursor->size() < candidate->size()) {
             candidate = cursor;
           }
@@ -202,7 +202,7 @@ void FieldLayout::add(GrowableArray<LayoutRawBlock*>* list, LayoutRawBlock* star
         last_search_success = false;
       }
       assert(candidate != nullptr, "Candidate must not be null");
-      assert(candidate->kind() == LayoutRawBlock::EMPTY, "Candidate must be an empty block");
+      assert(candidate->block_kind() == LayoutRawBlock::EMPTY, "Candidate must be an empty block");
       assert(candidate->fit(b->size(), b->alignment()), "Candidate must be able to store the block");
     }
 
@@ -221,7 +221,7 @@ void FieldLayout::add_field_at_offset(LayoutRawBlock* block, int offset, LayoutR
   while (slot != nullptr) {
     if ((slot->offset() <= block->offset() && (slot->offset() + slot->size()) > block->offset()) ||
         slot == _last){
-      assert(slot->kind() == LayoutRawBlock::EMPTY, "Matching slot must be an empty slot");
+      assert(slot->block_kind() == LayoutRawBlock::EMPTY, "Matching slot must be an empty slot");
       assert(slot->size() >= block->offset() + block->size() ,"Matching slot must be big enough");
       if (slot->offset() < block->offset()) {
         int adjustment = block->offset() - slot->offset();
@@ -261,7 +261,7 @@ void FieldLayout::add_contiguously(GrowableArray<LayoutRawBlock*>* list, LayoutR
   } else {
     LayoutRawBlock* first = list->at(0);
     candidate = last_block()->prev_block();
-    while (candidate->kind() != LayoutRawBlock::EMPTY || !candidate->fit(size, first->alignment())) {
+    while (candidate->block_kind() != LayoutRawBlock::EMPTY || !candidate->fit(size, first->alignment())) {
       if (candidate == start) {
         candidate = last_block();
         break;
@@ -269,7 +269,7 @@ void FieldLayout::add_contiguously(GrowableArray<LayoutRawBlock*>* list, LayoutR
       candidate = candidate->prev_block();
     }
     assert(candidate != nullptr, "Candidate must not be null");
-    assert(candidate->kind() == LayoutRawBlock::EMPTY, "Candidate must be an empty block");
+    assert(candidate->block_kind() == LayoutRawBlock::EMPTY, "Candidate must be an empty block");
     assert(candidate->fit(size, first->alignment()), "Candidate must be able to store the whole contiguous block");
   }
 
@@ -281,7 +281,7 @@ void FieldLayout::add_contiguously(GrowableArray<LayoutRawBlock*>* list, LayoutR
 }
 
 LayoutRawBlock* FieldLayout::insert_field_block(LayoutRawBlock* slot, LayoutRawBlock* block) {
-  assert(slot->kind() == LayoutRawBlock::EMPTY, "Blocks can only be inserted in empty blocks");
+  assert(slot->block_kind() == LayoutRawBlock::EMPTY, "Blocks can only be inserted in empty blocks");
   if (slot->offset() % block->alignment() != 0) {
     int adjustment = block->alignment() - (slot->offset() % block->alignment());
     LayoutRawBlock* adj = new LayoutRawBlock(LayoutRawBlock::EMPTY, adjustment);
@@ -362,7 +362,7 @@ void FieldLayout::fill_holes(const InstanceKlass* super_klass) {
     b = b->next_block();
   }
   assert(b->next_block() == nullptr, "Invariant at this point");
-  assert(b->kind() != LayoutRawBlock::EMPTY, "Sanity check");
+  assert(b->block_kind() != LayoutRawBlock::EMPTY, "Sanity check");
 
   // If the super class has @Contended annotation, a padding block is
   // inserted at the end to ensure that fields from the subclasses won't share
@@ -384,7 +384,7 @@ void FieldLayout::fill_holes(const InstanceKlass* super_klass) {
 }
 
 LayoutRawBlock* FieldLayout::insert(LayoutRawBlock* slot, LayoutRawBlock* block) {
-  assert(slot->kind() == LayoutRawBlock::EMPTY, "Blocks can only be inserted in empty blocks");
+  assert(slot->block_kind() == LayoutRawBlock::EMPTY, "Blocks can only be inserted in empty blocks");
   assert(slot->offset() % block->alignment() == 0, "Incompatible alignment");
   block->set_offset(slot->offset());
   slot->set_offset(slot->offset() + block->size());
@@ -425,7 +425,7 @@ void FieldLayout::print(outputStream* output, bool is_static, const InstanceKlas
   ResourceMark rm;
   LayoutRawBlock* b = _blocks;
   while(b != _last) {
-    switch(b->kind()) {
+    switch(b->block_kind()) {
       case LayoutRawBlock::REGULAR: {
         FieldInfo* fi = _field_info->adr_at(b->field_index());
         output->print_cr(" @%d \"%s\" %s %d/%d %s",
diff --git a/src/hotspot/share/classfile/fieldLayoutBuilder.hpp b/src/hotspot/share/classfile/fieldLayoutBuilder.hpp
index eab0b7d08a9..a45131ec9a3 100644
--- a/src/hotspot/share/classfile/fieldLayoutBuilder.hpp
+++ b/src/hotspot/share/classfile/fieldLayoutBuilder.hpp
@@ -65,7 +65,7 @@ class LayoutRawBlock : public ResourceObj {
  private:
   LayoutRawBlock* _next_block;
   LayoutRawBlock* _prev_block;
-  Kind _kind;
+  Kind _block_kind;
   int _offset;
   int _alignment;
   int _size;
@@ -79,7 +79,7 @@ class LayoutRawBlock : public ResourceObj {
   void set_next_block(LayoutRawBlock* next) { _next_block = next; }
   LayoutRawBlock* prev_block() const { return _prev_block; }
   void set_prev_block(LayoutRawBlock* prev) { _prev_block = prev; }
-  Kind kind() const { return _kind; }
+  Kind block_kind() const { return _block_kind; }
   int offset() const {
     assert(_offset >= 0, "Must be initialized");
     return _offset;
@@ -173,7 +173,7 @@ class FieldLayout : public ResourceObj {
 
   LayoutRawBlock* first_empty_block() {
     LayoutRawBlock* block = _start;
-    while (block->kind() != LayoutRawBlock::EMPTY) {
+    while (block->block_kind() != LayoutRawBlock::EMPTY) {
       block = block->next_block();
     }
     return block;
diff --git a/src/hotspot/share/classfile/stackMapTableFormat.hpp b/src/hotspot/share/classfile/stackMapTableFormat.hpp
index 2b89c53278a..4906f4b9d80 100644
--- a/src/hotspot/share/classfile/stackMapTableFormat.hpp
+++ b/src/hotspot/share/classfile/stackMapTableFormat.hpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2010, 2023, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2010, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -221,9 +221,11 @@ class stack_map_frame {
 class same_frame : public stack_map_frame {
  private:
   static int frame_type_to_offset_delta(u1 frame_type) {
-      return frame_type + 1; }
+    return frame_type + 1;
+  }
   static u1 offset_delta_to_frame_type(int offset_delta) {
-      return checked_cast<u1>(offset_delta - 1); }
+    return checked_cast<u1>(offset_delta - 1);
+  }
 
  public:
 
@@ -327,9 +329,11 @@ class same_locals_1_stack_item_frame : public stack_map_frame {
   address type_addr() const { return frame_type_addr() + sizeof(u1); }
 
   static int frame_type_to_offset_delta(u1 frame_type) {
-      return frame_type - 63; }
+    return frame_type - 63;
+  }
   static u1 offset_delta_to_frame_type(int offset_delta) {
-      return (u1)(offset_delta + 63); }
+    return (u1)(offset_delta + 63);
+  }
 
  public:
   static bool is_frame_type(u1 tag) {
@@ -657,9 +661,11 @@ class full_frame : public stack_map_frame {
   address num_locals_addr() const { return offset_delta_addr() + sizeof(u2); }
   address locals_addr() const { return num_locals_addr() + sizeof(u2); }
   address stack_slots_addr(address end_of_locals) const {
-      return end_of_locals; }
+    return end_of_locals;
+  }
   address stack_addr(address end_of_locals) const {
-      return stack_slots_addr(end_of_locals) + sizeof(u2); }
+    return stack_slots_addr(end_of_locals) + sizeof(u2);
+  }
 
   enum { _frame_id = 255 };
 
@@ -930,11 +936,14 @@ class stack_map_table {
 class stack_map_table_attribute {
  private:
   address name_index_addr() const {
-      return (address)this; }
+    return (address)this;
+  }
   address attribute_length_addr() const {
-      return name_index_addr() + sizeof(u2); }
+    return name_index_addr() + sizeof(u2);
+  }
   address stack_map_table_addr() const {
-      return attribute_length_addr() + sizeof(u4); }
+    return attribute_length_addr() + sizeof(u4);
+  }
   NONCOPYABLE(stack_map_table_attribute);
 
  protected:
@@ -948,9 +957,11 @@ class stack_map_table_attribute {
   }
 
   u2 name_index() const {
-    return Bytes::get_Java_u2(name_index_addr()); }
+    return Bytes::get_Java_u2(name_index_addr());
+  }
   u4 attribute_length() const {
-    return Bytes::get_Java_u4(attribute_length_addr()); }
+    return Bytes::get_Java_u4(attribute_length_addr());
+  }
   stack_map_table* table() const {
     return stack_map_table::at(stack_map_table_addr());
   }
diff --git a/src/hotspot/share/classfile/systemDictionary.cpp b/src/hotspot/share/classfile/systemDictionary.cpp
index 0b47c749df8..8483551fd4f 100644
--- a/src/hotspot/share/classfile/systemDictionary.cpp
+++ b/src/hotspot/share/classfile/systemDictionary.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1997, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -416,7 +416,7 @@ static inline void log_circularity_error(Symbol* name, PlaceholderEntry* probe)
 //
 // resolve_with_circularity_detection adds a DETECT_CIRCULARITY placeholder to the placeholder table before calling
 // resolve_instance_class_or_null. ClassCircularityError is detected when a DETECT_CIRCULARITY or LOAD_INSTANCE
-// placeholder for the same thread, class, classloader is found.
+// placeholder for the same thread, class, and classloader is found.
 // This can be seen with logging option: -Xlog:class+load+placeholders=debug.
 //
 InstanceKlass* SystemDictionary::resolve_with_circularity_detection(Symbol* class_name,

From abeceb1f8c7b09a396c5152f499c84d3c72a920b Mon Sep 17 00:00:00 2001
From: Vladimir Kozlov <kvn@openjdk.org>
Date: Tue, 31 Mar 2026 17:07:33 +0000
Subject: [PATCH 439/655] 8379687: Reduce C heap usage when VerifyMethodHandles
 flags is on

Reviewed-by: mhaessig, chagedorn
---
 src/hotspot/cpu/arm/methodHandles_arm.cpp   |  9 ++++-----
 src/hotspot/cpu/ppc/methodHandles_ppc.cpp   | 13 ++++++-------
 src/hotspot/cpu/s390/methodHandles_s390.cpp | 14 +++++---------
 src/hotspot/cpu/x86/methodHandles_x86.cpp   | 13 ++++++-------
 src/hotspot/share/prims/methodHandles.cpp   | 13 +++++++++++++
 src/hotspot/share/prims/methodHandles.hpp   |  2 ++
 6 files changed, 36 insertions(+), 28 deletions(-)

diff --git a/src/hotspot/cpu/arm/methodHandles_arm.cpp b/src/hotspot/cpu/arm/methodHandles_arm.cpp
index 3710fa33f36..2da14d8ffed 100644
--- a/src/hotspot/cpu/arm/methodHandles_arm.cpp
+++ b/src/hotspot/cpu/arm/methodHandles_arm.cpp
@@ -104,14 +104,13 @@ void MethodHandles::verify_ref_kind(MacroAssembler* _masm, int ref_kind, Registe
   __ andr(temp, temp, (unsigned)java_lang_invoke_MemberName::MN_REFERENCE_KIND_MASK);
   __ cmp(temp, ref_kind);
   __ b(L, eq);
-  { char* buf = NEW_C_HEAP_ARRAY(char, 100, mtInternal);
-  jio_snprintf(buf, 100, "verify_ref_kind expected %x", ref_kind);
+  const char* msg = ref_kind_to_verify_msg(ref_kind);
   if (ref_kind == JVM_REF_invokeVirtual ||
-      ref_kind == JVM_REF_invokeSpecial)
+      ref_kind == JVM_REF_invokeSpecial) {
     // could do this for all ref_kinds, but would explode assembly code size
-    trace_method_handle(_masm, buf);
-  __ stop(buf);
+    trace_method_handle(_masm, msg);
   }
+  __ stop(msg);
   BLOCK_COMMENT("} verify_ref_kind");
   __ bind(L);
 }
diff --git a/src/hotspot/cpu/ppc/methodHandles_ppc.cpp b/src/hotspot/cpu/ppc/methodHandles_ppc.cpp
index 45537e0ea96..ae94a9618b5 100644
--- a/src/hotspot/cpu/ppc/methodHandles_ppc.cpp
+++ b/src/hotspot/cpu/ppc/methodHandles_ppc.cpp
@@ -104,14 +104,13 @@ void MethodHandles::verify_ref_kind(MacroAssembler* _masm, int ref_kind, Registe
   __ andi(temp, temp, java_lang_invoke_MemberName::MN_REFERENCE_KIND_MASK);
   __ cmpwi(CR1, temp, ref_kind);
   __ beq(CR1, L);
-  { char* buf = NEW_C_HEAP_ARRAY(char, 100, mtInternal);
-    jio_snprintf(buf, 100, "verify_ref_kind expected %x", ref_kind);
-    if (ref_kind == JVM_REF_invokeVirtual ||
-        ref_kind == JVM_REF_invokeSpecial)
-      // could do this for all ref_kinds, but would explode assembly code size
-      trace_method_handle(_masm, buf);
-    __ stop(buf);
+  const char* msg = ref_kind_to_verify_msg(ref_kind);
+  if (ref_kind == JVM_REF_invokeVirtual ||
+      ref_kind == JVM_REF_invokeSpecial) {
+    // could do this for all ref_kinds, but would explode assembly code size
+    trace_method_handle(_masm, msg);
   }
+  __ stop(msg);
   BLOCK_COMMENT("} verify_ref_kind");
   __ BIND(L);
 }
diff --git a/src/hotspot/cpu/s390/methodHandles_s390.cpp b/src/hotspot/cpu/s390/methodHandles_s390.cpp
index e3de6d911be..dfb8ce09b27 100644
--- a/src/hotspot/cpu/s390/methodHandles_s390.cpp
+++ b/src/hotspot/cpu/s390/methodHandles_s390.cpp
@@ -120,16 +120,12 @@ void MethodHandles::verify_ref_kind(MacroAssembler* _masm, int ref_kind,
   __ z_nilf(temp, java_lang_invoke_MemberName::MN_REFERENCE_KIND_MASK);
   __ compare32_and_branch(temp, constant(ref_kind), Assembler::bcondEqual, L);
 
-  {
-    char *buf = NEW_C_HEAP_ARRAY(char, 100, mtInternal);
-
-    jio_snprintf(buf, 100, "verify_ref_kind expected %x", ref_kind);
-    if (ref_kind == JVM_REF_invokeVirtual || ref_kind == JVM_REF_invokeSpecial) {
-      // Could do this for all ref_kinds, but would explode assembly code size.
-      trace_method_handle(_masm, buf);
-    }
-    __ stop(buf);
+  const char* msg = ref_kind_to_verify_msg(ref_kind);
+  if (ref_kind == JVM_REF_invokeVirtual || ref_kind == JVM_REF_invokeSpecial) {
+    // Could do this for all ref_kinds, but would explode assembly code size.
+    trace_method_handle(_masm, msg);
   }
+  __ stop(msg);
 
   BLOCK_COMMENT("} verify_ref_kind");
 
diff --git a/src/hotspot/cpu/x86/methodHandles_x86.cpp b/src/hotspot/cpu/x86/methodHandles_x86.cpp
index 54376c6ad9a..5b15444bc32 100644
--- a/src/hotspot/cpu/x86/methodHandles_x86.cpp
+++ b/src/hotspot/cpu/x86/methodHandles_x86.cpp
@@ -110,14 +110,13 @@ void MethodHandles::verify_ref_kind(MacroAssembler* _masm, int ref_kind, Registe
   __ andl(temp, java_lang_invoke_MemberName::MN_REFERENCE_KIND_MASK);
   __ cmpl(temp, ref_kind);
   __ jcc(Assembler::equal, L);
-  { char* buf = NEW_C_HEAP_ARRAY(char, 100, mtInternal);
-    jio_snprintf(buf, 100, "verify_ref_kind expected %x", ref_kind);
-    if (ref_kind == JVM_REF_invokeVirtual ||
-        ref_kind == JVM_REF_invokeSpecial)
-      // could do this for all ref_kinds, but would explode assembly code size
-      trace_method_handle(_masm, buf);
-    __ STOP(buf);
+  const char* msg = ref_kind_to_verify_msg(ref_kind);
+  if (ref_kind == JVM_REF_invokeVirtual ||
+      ref_kind == JVM_REF_invokeSpecial) {
+    // could do this for all ref_kinds, but would explode assembly code size
+    trace_method_handle(_masm, msg);
   }
+  __ STOP(msg);
   BLOCK_COMMENT("} verify_ref_kind");
   __ bind(L);
 }
diff --git a/src/hotspot/share/prims/methodHandles.cpp b/src/hotspot/share/prims/methodHandles.cpp
index 584f077eddc..03cb98d8e75 100644
--- a/src/hotspot/share/prims/methodHandles.cpp
+++ b/src/hotspot/share/prims/methodHandles.cpp
@@ -157,6 +157,19 @@ int MethodHandles::ref_kind_to_flags(int ref_kind) {
   return flags;
 }
 
+#ifdef ASSERT
+const char* MethodHandles::ref_kind_to_verify_msg(int ref_kind) {
+  switch (ref_kind) {
+    case JVM_REF_invokeSpecial:   return "verify_ref_kind expected invokeSpecial";
+    case JVM_REF_invokeStatic:    return "verify_ref_kind expected invokeStatic";
+    case JVM_REF_invokeVirtual:   return "verify_ref_kind expected invokeVirtual";
+    case JVM_REF_invokeInterface: return "verify_ref_kind expected invokeInterface";
+    default:  assert(false, "unexpected ref_kind: %d", ref_kind);
+  }
+  return "";
+}
+#endif
+
 Handle MethodHandles::resolve_MemberName_type(Handle mname, Klass* caller, TRAPS) {
   Handle empty;
   Handle type(THREAD, java_lang_invoke_MemberName::type(mname()));
diff --git a/src/hotspot/share/prims/methodHandles.hpp b/src/hotspot/share/prims/methodHandles.hpp
index 73da28a6cf5..a2a549fe051 100644
--- a/src/hotspot/share/prims/methodHandles.hpp
+++ b/src/hotspot/share/prims/methodHandles.hpp
@@ -182,6 +182,8 @@ public:
 
   static int ref_kind_to_flags(int ref_kind);
 
+  DEBUG_ONLY( static const char* ref_kind_to_verify_msg(int ref_kind); )
+
 #include CPU_HEADER(methodHandles)
 
   // Tracing

From 48132fbb65bd4938debf360f806d5fd7dd39856c Mon Sep 17 00:00:00 2001
From: Erik Gahlin <egahlin@openjdk.org>
Date: Tue, 31 Mar 2026 17:13:58 +0000
Subject: [PATCH 440/655] 8381170: JFR: Recursion in jdk.MethodTrace caused by
 Integer::reverseBytes

Reviewed-by: shade
---
 .../classes/jdk/jfr/internal/tracing/ExcludeList.java | 11 +++++++++--
 1 file changed, 9 insertions(+), 2 deletions(-)

diff --git a/src/jdk.jfr/share/classes/jdk/jfr/internal/tracing/ExcludeList.java b/src/jdk.jfr/share/classes/jdk/jfr/internal/tracing/ExcludeList.java
index 58408da811e..4ba6887e6a5 100644
--- a/src/jdk.jfr/share/classes/jdk/jfr/internal/tracing/ExcludeList.java
+++ b/src/jdk.jfr/share/classes/jdk/jfr/internal/tracing/ExcludeList.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2025, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -59,7 +59,14 @@ public final class ExcludeList {
         "java.lang.String::checkIndex", // Used by charAt(int)
         "java.lang.String::isLatin1", // Used by charAt()
         "java.lang.String::equals", // Used by StringPool
-        "java.lang.String::hashCode" // Used by StringPool
+        "java.lang.String::hashCode", // Used by StringPool
+        // Used by Bits during Event::commit(), directly or indirectly
+        "java.lang.Integer::reverseBytes",
+        "java.lang.Long::reverseBytes",
+        "java.lang.Float::floatToIntBits",
+        "java.lang.Float::isNaN",
+        "java.lang.Double::doubleToLongBits",
+        "java.lang.Double::isNaN"
     );
 
     public static boolean containsMethod(String methodName) {

From e191df7f156e43cc350e0dcc2ef126d9ef3cf24a Mon Sep 17 00:00:00 2001
From: Phil Race <prr@openjdk.org>
Date: Tue, 31 Mar 2026 17:54:55 +0000
Subject: [PATCH 441/655] 8134541: latent concurrency bug in ScriptRunData

Reviewed-by: honkar, dnguyen, serb
---
 src/java.desktop/share/classes/sun/font/ScriptRunData.java | 7 ++++---
 1 file changed, 4 insertions(+), 3 deletions(-)

diff --git a/src/java.desktop/share/classes/sun/font/ScriptRunData.java b/src/java.desktop/share/classes/sun/font/ScriptRunData.java
index 1f1f6b44d59..4e13fb5bbd0 100644
--- a/src/java.desktop/share/classes/sun/font/ScriptRunData.java
+++ b/src/java.desktop/share/classes/sun/font/ScriptRunData.java
@@ -38,11 +38,12 @@ public final class ScriptRunData {
     private static final int CHAR_START = 0;
     private static final int CHAR_LIMIT = 0x110000;
 
-    private static int cache = 0;
+    private static volatile int cache = 0;
     public static int getScript(int cp) {
+        int lcache = cache;
         // optimize for runs of characters in the same script
-        if (cp >= data[cache] && cp < data[cache+2]) {
-            return data[cache+1];
+        if (cp >= data[lcache] && cp < data[lcache+2]) {
+            return data[lcache+1];
         }
         if ((cp >= CHAR_START) && (cp < CHAR_LIMIT)) {
             int probe = dataPower;

From 644cccae78d65de347f965e4a2f652422a415330 Mon Sep 17 00:00:00 2001
From: Phil Race <prr@openjdk.org>
Date: Tue, 31 Mar 2026 17:58:53 +0000
Subject: [PATCH 442/655] 8381020: Remove AppContext from java.awt.Dialog

Reviewed-by: dnguyen, kizune
---
 .../share/classes/java/awt/Dialog.java        | 37 +------------------
 1 file changed, 2 insertions(+), 35 deletions(-)

diff --git a/src/java.desktop/share/classes/java/awt/Dialog.java b/src/java.desktop/share/classes/java/awt/Dialog.java
index 83aa89b9bf7..038aa5b65e3 100644
--- a/src/java.desktop/share/classes/java/awt/Dialog.java
+++ b/src/java.desktop/share/classes/java/awt/Dialog.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1995, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1995, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -41,7 +41,6 @@ import javax.accessibility.AccessibleRole;
 import javax.accessibility.AccessibleState;
 import javax.accessibility.AccessibleStateSet;
 
-import sun.awt.AppContext;
 import sun.awt.SunToolkit;
 import sun.awt.util.IdentityArrayList;
 
@@ -1013,30 +1012,12 @@ public class Dialog extends Window {
         if (!isModal()) {
             conditionalShow(null, null);
         } else {
-            AppContext showAppContext = AppContext.getAppContext();
-
             AtomicLong time = new AtomicLong();
             Component predictedFocusOwner = null;
             try {
                 predictedFocusOwner = getMostRecentFocusOwner();
                 if (conditionalShow(predictedFocusOwner, time)) {
                     modalFilter = ModalEventFilter.createFilterForDialog(this);
-                    // if this dialog is toolkit-modal, the filter should be added
-                    // to all EDTs (for all AppContexts)
-                    if (modalityType == ModalityType.TOOLKIT_MODAL) {
-                        for (AppContext appContext : AppContext.getAppContexts()) {
-                            if (appContext == showAppContext) {
-                                continue;
-                            }
-                            EventQueue eventQueue = (EventQueue)appContext.get(AppContext.EVENT_QUEUE_KEY);
-                            // it may occur that EDT for appContext hasn't been started yet, so
-                            // we post an empty invocation event to trigger EDT initialization
-                            eventQueue.postEvent(new InvocationEvent(this, () -> {}));
-                            EventDispatchThread edt = eventQueue.getDispatchThread();
-                            edt.addEventFilter(modalFilter);
-                        }
-                    }
-
                     modalityPushed();
                     try {
                         EventQueue eventQueue = Toolkit.getDefaultToolkit().getSystemEventQueue();
@@ -1047,19 +1028,6 @@ public class Dialog extends Window {
                     } finally {
                         modalityPopped();
                     }
-
-                    // if this dialog is toolkit-modal, its filter must be removed
-                    // from all EDTs (for all AppContexts)
-                    if (modalityType == ModalityType.TOOLKIT_MODAL) {
-                        for (AppContext appContext : AppContext.getAppContexts()) {
-                            if (appContext == showAppContext) {
-                                continue;
-                            }
-                            EventQueue eventQueue = (EventQueue)appContext.get(AppContext.EVENT_QUEUE_KEY);
-                            EventDispatchThread edt = eventQueue.getDispatchThread();
-                            edt.removeEventFilter(modalFilter);
-                        }
-                    }
                 }
             } finally {
                 if (predictedFocusOwner != null) {
@@ -1482,8 +1450,7 @@ public class Dialog extends Window {
                     return getDocumentRoot() == w.getDocumentRoot();
                 }
             case APPLICATION_MODAL:
-                return !w.isModalExcluded(ModalExclusionType.APPLICATION_EXCLUDE) &&
-                    (appContext == w.appContext);
+                return !w.isModalExcluded(ModalExclusionType.APPLICATION_EXCLUDE);
             case TOOLKIT_MODAL:
                 return !w.isModalExcluded(ModalExclusionType.TOOLKIT_EXCLUDE);
         }

From 20c3082aac4381a5d38ed3abb34b3651b2d28e08 Mon Sep 17 00:00:00 2001
From: Phil Race <prr@openjdk.org>
Date: Tue, 31 Mar 2026 18:41:51 +0000
Subject: [PATCH 443/655] 8380578: Remove miscellaneous AppContext uses, mostly
 in XAWT

Reviewed-by: serb, azvegint
---
 .../classes/sun/awt/util/PerformanceLogger.java  |  7 +------
 .../unix/classes/sun/awt/X11/InfoWindow.java     |  7 ++++---
 .../classes/sun/awt/X11/XBaseMenuWindow.java     |  8 ++------
 .../sun/awt/X11/XEmbedChildProxyPeer.java        |  8 ++++----
 .../unix/classes/sun/awt/X11/XTaskbarPeer.java   |  4 ++--
 .../unix/classes/sun/awt/X11/XToolkit.java       | 16 +---------------
 .../unix/classes/sun/awt/X11/XTrayIconPeer.java  | 12 ++++++------
 .../unix/classes/sun/awt/X11InputMethodBase.java |  4 ++--
 .../unix/native/common/awt/awt_Component.h       |  3 +--
 .../unix/native/libawt_xawt/xawt/XToolkit.c      |  6 +-----
 .../native/libawt/windows/awt_Component.cpp      |  8 +-------
 .../native/libawt/windows/awt_Component.h        |  3 +--
 12 files changed, 26 insertions(+), 60 deletions(-)

diff --git a/src/java.desktop/share/classes/sun/awt/util/PerformanceLogger.java b/src/java.desktop/share/classes/sun/awt/util/PerformanceLogger.java
index 4a1dde6538d..cf0ff1d9958 100644
--- a/src/java.desktop/share/classes/sun/awt/util/PerformanceLogger.java
+++ b/src/java.desktop/share/classes/sun/awt/util/PerformanceLogger.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2002, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2002, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -43,11 +43,6 @@ import java.io.Writer;
  * for setting and getting all times and for doing whatever
  * analysis is interesting; this class is merely a central container
  * for those timing values.
- * Note that, due to the variables in this class being static,
- * use of particular time values by multiple AppContexts will cause
- * confusing results.  For example, if two contexts run
- * simultaneously, the initTime for those will collide
- * and the results may be undefined.
  * <P>
  * To automatically track startup performance in an app
  * use the command-line parameter sun.perflog as follows:<BR>
diff --git a/src/java.desktop/unix/classes/sun/awt/X11/InfoWindow.java b/src/java.desktop/unix/classes/sun/awt/X11/InfoWindow.java
index bab0f34f90f..c03eae62225 100644
--- a/src/java.desktop/unix/classes/sun/awt/X11/InfoWindow.java
+++ b/src/java.desktop/unix/classes/sun/awt/X11/InfoWindow.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2009, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2009, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -31,6 +31,7 @@ import java.awt.Color;
 import java.awt.Component;
 import java.awt.Container;
 import java.awt.Dimension;
+import java.awt.EventQueue;
 import java.awt.Font;
 import java.awt.Frame;
 import java.awt.GridLayout;
@@ -91,7 +92,7 @@ public abstract class InfoWindow extends Window {
     // Must be executed on EDT.
     @SuppressWarnings("deprecation")
     protected void show(Point corner, int indent) {
-        assert SunToolkit.isDispatchThreadForAppContext(this);
+        assert EventQueue.isDispatchThread();
 
         pack();
 
@@ -464,7 +465,7 @@ public abstract class InfoWindow extends Window {
                     ActionEvent aev = new ActionEvent(target, ActionEvent.ACTION_PERFORMED,
                                                       liveArguments.getActionCommand(),
                                                       e.getWhen(), e.getModifiers());
-                    XToolkit.postEvent(XToolkit.targetToAppContext(aev.getSource()), aev);
+                    XToolkit.postEvent(aev);
                 }
             }
         }
diff --git a/src/java.desktop/unix/classes/sun/awt/X11/XBaseMenuWindow.java b/src/java.desktop/unix/classes/sun/awt/X11/XBaseMenuWindow.java
index f8fcb30d8d8..9512d1d0351 100644
--- a/src/java.desktop/unix/classes/sun/awt/X11/XBaseMenuWindow.java
+++ b/src/java.desktop/unix/classes/sun/awt/X11/XBaseMenuWindow.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2005, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2005, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -114,8 +114,6 @@ public abstract class XBaseMenuWindow extends XWindow {
     protected Point grabInputPoint = null;
     protected boolean hasPointerMoved = false;
 
-    private AppContext disposeAppContext;
-
     /************************************************
      *
      * Mapping data
@@ -175,8 +173,6 @@ public abstract class XBaseMenuWindow extends XWindow {
     XBaseMenuWindow() {
         super(new XCreateWindowParams(new Object[] {
             DELAYED, Boolean.TRUE}));
-
-        disposeAppContext = AppContext.getAppContext();
     }
 
     /************************************************
@@ -920,7 +916,7 @@ public abstract class XBaseMenuWindow extends XWindow {
     public void dispose() {
         setDisposed(true);
 
-        SunToolkit.invokeLaterOnAppContext(disposeAppContext, new Runnable()  {
+        SunToolkit.invokeLater(new Runnable()  {
             public void run() {
                 doDispose();
             }
diff --git a/src/java.desktop/unix/classes/sun/awt/X11/XEmbedChildProxyPeer.java b/src/java.desktop/unix/classes/sun/awt/X11/XEmbedChildProxyPeer.java
index efae47d6f23..03593761111 100644
--- a/src/java.desktop/unix/classes/sun/awt/X11/XEmbedChildProxyPeer.java
+++ b/src/java.desktop/unix/classes/sun/awt/X11/XEmbedChildProxyPeer.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -201,7 +201,7 @@ public final class XEmbedChildProxyPeer implements ComponentPeer, XEventDispatch
     public void                 updateCursorImmediately() {}
 
     void postEvent(AWTEvent event) {
-        XToolkit.postEvent(XToolkit.targetToAppContext(proxy), event);
+        XToolkit.postEvent(event);
     }
 
     boolean simulateMotifRequestFocus(Component lightweightChild, boolean temporary,
@@ -323,9 +323,9 @@ public final class XEmbedChildProxyPeer implements ComponentPeer, XEventDispatch
     }
 
     void childResized() {
-        XToolkit.postEvent(XToolkit.targetToAppContext(proxy), new ComponentEvent(proxy, ComponentEvent.COMPONENT_RESIZED));
+        XToolkit.postEvent(new ComponentEvent(proxy, ComponentEvent.COMPONENT_RESIZED));
         container.childResized(proxy);
-//         XToolkit.postEvent(XToolkit.targetToAppContext(proxy), new InvocationEvent(proxy, new Runnable() {
+//         XToolkit.postEvent(new InvocationEvent(proxy, new Runnable() {
 //                 public void run() {
 //                     getTopLevel(proxy).invalidate();
 //                     getTopLevel(proxy).pack();
diff --git a/src/java.desktop/unix/classes/sun/awt/X11/XTaskbarPeer.java b/src/java.desktop/unix/classes/sun/awt/X11/XTaskbarPeer.java
index 7f0629e101e..cb80f0abd0e 100644
--- a/src/java.desktop/unix/classes/sun/awt/X11/XTaskbarPeer.java
+++ b/src/java.desktop/unix/classes/sun/awt/X11/XTaskbarPeer.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2016, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2016, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -152,7 +152,7 @@ final class XTaskbarPeer implements TaskbarPeer {
                     mi.getActionCommand());
             try {
                 XToolkit.awtLock();
-                XToolkit.postEvent(XToolkit.targetToAppContext(ae.getSource()), ae);
+                XToolkit.postEvent(ae);
             } finally {
                 XToolkit.awtUnlock();
             }
diff --git a/src/java.desktop/unix/classes/sun/awt/X11/XToolkit.java b/src/java.desktop/unix/classes/sun/awt/X11/XToolkit.java
index 5dcd1b763e1..1ec0039febd 100644
--- a/src/java.desktop/unix/classes/sun/awt/X11/XToolkit.java
+++ b/src/java.desktop/unix/classes/sun/awt/X11/XToolkit.java
@@ -625,14 +625,8 @@ public final class XToolkit extends UNIXToolkit implements Runnable {
         while(true) {
             // Fix for 6829923: we should gracefully handle toolkit thread interruption
             if (Thread.currentThread().isInterrupted()) {
-                // We expect interruption from the AppContext.dispose() method only.
                 // If the thread is interrupted from another place, let's skip it
-                // for compatibility reasons. Probably some time later we'll remove
-                // the check for AppContext.isDisposed() and will unconditionally
-                // break the loop here.
-                if (AppContext.getAppContext().isDisposed()) {
-                    break;
-                }
+                // for compatibility reasons.
             }
             awtLock();
             try {
@@ -2054,14 +2048,6 @@ public final class XToolkit extends UNIXToolkit implements Runnable {
                (exclusionType == Dialog.ModalExclusionType.TOOLKIT_EXCLUDE);
     }
 
-    static EventQueue getEventQueue(Object target) {
-        AppContext appContext = targetToAppContext(target);
-        if (appContext != null) {
-            return (EventQueue)appContext.get(AppContext.EVENT_QUEUE_KEY);
-        }
-        return null;
-    }
-
     static void removeSourceEvents(EventQueue queue,
                                    Object source,
                                    boolean removeAllEvents) {
diff --git a/src/java.desktop/unix/classes/sun/awt/X11/XTrayIconPeer.java b/src/java.desktop/unix/classes/sun/awt/X11/XTrayIconPeer.java
index 9f0ac241f5b..5ab97125991 100644
--- a/src/java.desktop/unix/classes/sun/awt/X11/XTrayIconPeer.java
+++ b/src/java.desktop/unix/classes/sun/awt/X11/XTrayIconPeer.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2005, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2005, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -269,7 +269,7 @@ public final class XTrayIconPeer implements TrayIconPeer,
 
     @Override
     public void dispose() {
-        if (SunToolkit.isDispatchThreadForAppContext(target)) {
+        if (EventQueue.isDispatchThread()) {
             disposeOnEDT();
         } else {
             try {
@@ -329,7 +329,7 @@ public final class XTrayIconPeer implements TrayIconPeer,
                 }
             };
 
-        if (!SunToolkit.isDispatchThreadForAppContext(target)) {
+        if (!EventQueue.isDispatchThread()) {
             SunToolkit.executeOnEventHandlerThread(target, r);
         } else {
             r.run();
@@ -355,7 +355,7 @@ public final class XTrayIconPeer implements TrayIconPeer,
         if (isDisposed())
             return;
 
-        assert SunToolkit.isDispatchThreadForAppContext(target);
+        assert EventQueue.isDispatchThread();
 
         PopupMenu newPopup = target.getPopupMenu();
         if (popup != newPopup) {
@@ -476,7 +476,7 @@ public final class XTrayIconPeer implements TrayIconPeer,
             // other class tries to cast source field to Component).
             // We already filter DRAG events out (CR 6565779).
             e.setSource(xtiPeer.target);
-            XToolkit.postEvent(XToolkit.targetToAppContext(e.getSource()), e);
+            XToolkit.postEvent(e);
         }
         @Override
         @SuppressWarnings("deprecation")
@@ -487,7 +487,7 @@ public final class XTrayIconPeer implements TrayIconPeer,
                 ActionEvent aev = new ActionEvent(xtiPeer.target, ActionEvent.ACTION_PERFORMED,
                                                   xtiPeer.target.getActionCommand(), e.getWhen(),
                                                   e.getModifiers());
-                XToolkit.postEvent(XToolkit.targetToAppContext(aev.getSource()), aev);
+                XToolkit.postEvent(aev);
             }
             if (xtiPeer.balloon.isVisible()) {
                 xtiPeer.balloon.hide();
diff --git a/src/java.desktop/unix/classes/sun/awt/X11InputMethodBase.java b/src/java.desktop/unix/classes/sun/awt/X11InputMethodBase.java
index d9eaa9629d1..3aa1624a1dd 100644
--- a/src/java.desktop/unix/classes/sun/awt/X11InputMethodBase.java
+++ b/src/java.desktop/unix/classes/sun/awt/X11InputMethodBase.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1997, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -434,7 +434,7 @@ public abstract class X11InputMethodBase extends InputMethodAdapter {
         if (source != null) {
             InputMethodEvent event = new InputMethodEvent(source,
                 id, when, text, committedCharacterCount, caret, visiblePosition);
-            SunToolkit.postEvent(SunToolkit.targetToAppContext(source), (AWTEvent)event);
+            SunToolkit.postEvent((AWTEvent)event);
         }
     }
 
diff --git a/src/java.desktop/unix/native/common/awt/awt_Component.h b/src/java.desktop/unix/native/common/awt/awt_Component.h
index 089691a8a4d..7ef0a0de94b 100644
--- a/src/java.desktop/unix/native/common/awt/awt_Component.h
+++ b/src/java.desktop/unix/native/common/awt/awt_Component.h
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1998, 2011, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1998, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -38,7 +38,6 @@ struct ComponentIDs {
     jfieldID graphicsConfig;
     jfieldID name;
     jfieldID isProxyActive;
-    jfieldID appContext;
     jmethodID getParent;
     jmethodID getLocationOnScreen;
 };
diff --git a/src/java.desktop/unix/native/libawt_xawt/xawt/XToolkit.c b/src/java.desktop/unix/native/libawt_xawt/xawt/XToolkit.c
index d5f3130386d..c84aa4ff8f9 100644
--- a/src/java.desktop/unix/native/libawt_xawt/xawt/XToolkit.c
+++ b/src/java.desktop/unix/native/libawt_xawt/xawt/XToolkit.c
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2002, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2002, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -195,10 +195,6 @@ Java_java_awt_Component_initIDs
                            "Z");
     CHECK_NULL(componentIDs.isProxyActive);
 
-    componentIDs.appContext =
-        (*env)->GetFieldID(env, cls, "appContext",
-                           "Lsun/awt/AppContext;");
-
     (*env)->DeleteLocalRef(env, keyclass);
 }
 
diff --git a/src/java.desktop/windows/native/libawt/windows/awt_Component.cpp b/src/java.desktop/windows/native/libawt/windows/awt_Component.cpp
index b67c5dfcf8d..eca8290a1aa 100644
--- a/src/java.desktop/windows/native/libawt/windows/awt_Component.cpp
+++ b/src/java.desktop/windows/native/libawt/windows/awt_Component.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1996, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1996, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -178,7 +178,6 @@ jfieldID AwtComponent::parentID;
 jfieldID AwtComponent::graphicsConfigID;
 jfieldID AwtComponent::peerGCID;
 jfieldID AwtComponent::focusableID;
-jfieldID AwtComponent::appContextID;
 jfieldID AwtComponent::cursorID;
 jfieldID AwtComponent::hwndID;
 
@@ -6573,11 +6572,6 @@ Java_java_awt_Component_initIDs(JNIEnv *env, jclass cls)
     DASSERT(AwtComponent::focusableID);
     CHECK_NULL(AwtComponent::focusableID);
 
-    AwtComponent::appContextID = env->GetFieldID(cls, "appContext",
-                                                 "Lsun/awt/AppContext;");
-    DASSERT(AwtComponent::appContextID);
-    CHECK_NULL(AwtComponent::appContextID);
-
     AwtComponent::peerGCID = env->GetFieldID(peerCls, "winGraphicsConfig",
                                         "Lsun/awt/Win32GraphicsConfig;");
     DASSERT(AwtComponent::peerGCID);
diff --git a/src/java.desktop/windows/native/libawt/windows/awt_Component.h b/src/java.desktop/windows/native/libawt/windows/awt_Component.h
index 740eb8c72f9..1246f6cb06e 100644
--- a/src/java.desktop/windows/native/libawt/windows/awt_Component.h
+++ b/src/java.desktop/windows/native/libawt/windows/awt_Component.h
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1996, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1996, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -112,7 +112,6 @@ public:
     static jfieldID graphicsConfigID;
     static jfieldID peerGCID;
     static jfieldID focusableID;
-    static jfieldID appContextID;
     static jfieldID hwndID;
 
     static jmethodID getFontMID;

From f46a6981137bd09e9387c168eb24e4bc2edf32c4 Mon Sep 17 00:00:00 2001
From: Daniel Gredler <dgredler@openjdk.org>
Date: Tue, 31 Mar 2026 21:46:05 +0000
Subject: [PATCH 444/655] 8381015: CharsetEncoder.canEncode(CharSequence) is
 slow for UTF-8, UTF-16, UTF-32

Reviewed-by: naoto, vyazici
---
 .../share/classes/sun/nio/cs/UTF_32Coder.java |  9 +++-
 .../share/classes/sun/nio/cs/UTF_8.java       |  4 ++
 .../share/classes/sun/nio/cs/Unicode.java     | 21 ++++++++-
 .../classes/sun/nio/cs/UnicodeEncoder.java    |  6 ++-
 .../nio/charset/CharsetEncoder/CanEncode.java | 46 +++++++++++++++----
 .../bench/java/nio/CharsetCanEncode.java      | 23 ++++++++++
 6 files changed, 97 insertions(+), 12 deletions(-)

diff --git a/src/java.base/share/classes/sun/nio/cs/UTF_32Coder.java b/src/java.base/share/classes/sun/nio/cs/UTF_32Coder.java
index c6f38ec9bfc..72e59d22e2c 100644
--- a/src/java.base/share/classes/sun/nio/cs/UTF_32Coder.java
+++ b/src/java.base/share/classes/sun/nio/cs/UTF_32Coder.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2005, 2010, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2005, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -185,5 +185,12 @@ class UTF_32Coder {
             doneBOM = !doBOM;
         }
 
+        public boolean canEncode(char c) {
+            return !Character.isSurrogate(c);
+        }
+
+        public boolean canEncode(CharSequence cs) {
+            return Unicode.isValidUnicode(cs);
+        }
     }
 }
diff --git a/src/java.base/share/classes/sun/nio/cs/UTF_8.java b/src/java.base/share/classes/sun/nio/cs/UTF_8.java
index 2928ae6d509..fda8e5eec1f 100644
--- a/src/java.base/share/classes/sun/nio/cs/UTF_8.java
+++ b/src/java.base/share/classes/sun/nio/cs/UTF_8.java
@@ -424,6 +424,10 @@ public final class UTF_8 extends Unicode {
             return !Character.isSurrogate(c);
         }
 
+        public boolean canEncode(CharSequence cs) {
+            return Unicode.isValidUnicode(cs);
+        }
+
         public boolean isLegalReplacement(byte[] repl) {
             return ((repl.length == 1 && repl[0] >= 0) ||
                     super.isLegalReplacement(repl));
diff --git a/src/java.base/share/classes/sun/nio/cs/Unicode.java b/src/java.base/share/classes/sun/nio/cs/Unicode.java
index aac77a13ffb..06a50f125c5 100644
--- a/src/java.base/share/classes/sun/nio/cs/Unicode.java
+++ b/src/java.base/share/classes/sun/nio/cs/Unicode.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2005, 2023, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2005, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -95,4 +95,23 @@ abstract class Unicode extends Charset
                 || (cs.name().equals("x-Johab"))
                 || (cs.name().equals("Shift_JIS")));
     }
+
+    static boolean isValidUnicode(CharSequence cs) {
+        int length = cs.length();
+        for (int i = 0; i < length;) {
+            char c = cs.charAt(i++);
+            if (Character.isHighSurrogate(c)) {
+                if (i == length) {
+                    return false;
+                }
+                char low = cs.charAt(i++);
+                if (!Character.isLowSurrogate(low)) {
+                    return false;
+                }
+            } else if (Character.isLowSurrogate(c)) {
+                return false;
+            }
+        }
+        return true;
+    }
 }
diff --git a/src/java.base/share/classes/sun/nio/cs/UnicodeEncoder.java b/src/java.base/share/classes/sun/nio/cs/UnicodeEncoder.java
index 7b34fb2d512..6f7413dcbf8 100644
--- a/src/java.base/share/classes/sun/nio/cs/UnicodeEncoder.java
+++ b/src/java.base/share/classes/sun/nio/cs/UnicodeEncoder.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2000, 2010, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2000, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -108,4 +108,8 @@ public abstract class UnicodeEncoder extends CharsetEncoder {
     public boolean canEncode(char c) {
         return ! Character.isSurrogate(c);
     }
+
+    public boolean canEncode(CharSequence cs) {
+        return Unicode.isValidUnicode(cs);
+    }
 }
diff --git a/test/jdk/java/nio/charset/CharsetEncoder/CanEncode.java b/test/jdk/java/nio/charset/CharsetEncoder/CanEncode.java
index 8545ef61be9..d4dabf70910 100644
--- a/test/jdk/java/nio/charset/CharsetEncoder/CanEncode.java
+++ b/test/jdk/java/nio/charset/CharsetEncoder/CanEncode.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2010, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2010, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -66,14 +66,21 @@ public class CanEncode {
         Charset cs = Charset.forName(csn);
         CharsetEncoder ce = cs.newEncoder();
 
-        if (cs.name().equals("US-ASCII")) {
-            ck(ce, 'x', true);
-            ck(ce, '\u00B6', false);
-            ck(ce, "x", true);
-            ck(ce, "\u00B6", false);
-            ck(ce, "xyzzy", true);
-            ck(ce, "xy\u00B6", false);
-        }
+        // Basic multilingual plane
+        boolean utf = csn.startsWith("UTF-");
+        ck(ce, 'x', true);
+        ck(ce, '\u00B6', utf);
+        ck(ce, "", true);
+        ck(ce, "x", true);
+        ck(ce, "\u00B6", utf);
+        ck(ce, "xyzzy", true);
+        ck(ce, "xy\u00B6", utf);
+
+        // Paired surrogates
+        ck(ce, "\uD83D\uDE00", utf);
+        ck(ce, "XX\uD83D\uDE00", utf);
+        ck(ce, "\uD83D\uDE00XX", utf);
+        ck(ce, "X\uD83D\uDE00X", utf);
 
         // Unpaired surrogates should never be encodable
         ck(ce, '\ud800', false);
@@ -81,15 +88,36 @@ public class CanEncode {
         ck(ce, '\udffe', false);
         ck(ce, '\udfff', false);
         ck(ce, "\ud800", false);
+        ck(ce, "XX\ud800", false);
+        ck(ce, "\ud800XX", false);
+        ck(ce, "X\ud800X", false);
         ck(ce, "\ud801", false);
+        ck(ce, "XX\ud801", false);
+        ck(ce, "\ud801XX", false);
+        ck(ce, "X\ud801X", false);
         ck(ce, "\udffe", false);
+        ck(ce, "XX\udffe", false);
+        ck(ce, "\udffeXX", false);
+        ck(ce, "X\udffeX", false);
         ck(ce, "\udfff", false);
+        ck(ce, "XX\udfff", false);
+        ck(ce, "\udfffXX", false);
+        ck(ce, "X\udfffX", false);
 
+        if (errors > 0) {
+            throw new RuntimeException(errors + " errors for Charset " + csn);
+        }
     }
 
     public static void main(String[] args) throws Exception {
         test("US-ASCII");
         test("UTF-8");
+        test("UTF-16");
+        test("UTF-16LE");
+        test("UTF-16BE");
+        test("UTF-32");
+        test("UTF-32LE");
+        test("UTF-32BE");
     }
 
 }
diff --git a/test/micro/org/openjdk/bench/java/nio/CharsetCanEncode.java b/test/micro/org/openjdk/bench/java/nio/CharsetCanEncode.java
index ebfbc217a95..8c08a876696 100644
--- a/test/micro/org/openjdk/bench/java/nio/CharsetCanEncode.java
+++ b/test/micro/org/openjdk/bench/java/nio/CharsetCanEncode.java
@@ -65,6 +65,9 @@ public class CharsetCanEncode {
     // sun.nio.cs.UTF_16LE
     private CharsetEncoder utf16le = Charset.forName("UTF-16LE").newEncoder();
 
+    // sun.nio.cs.UTF_32LE
+    private CharsetEncoder utf32le = Charset.forName("UTF-32LE").newEncoder();
+
     @Benchmark
     public boolean asciiCanEncodeCharYes() {
         return ascii.canEncode('D');
@@ -184,4 +187,24 @@ public class CharsetCanEncode {
     public boolean utf16leCanEncodeStringNo() {
         return utf16le.canEncode(String.valueOf(Character.MIN_SURROGATE));
     }
+
+    @Benchmark
+    public boolean utf32leCanEncodeCharYes() {
+        return utf32le.canEncode('D');
+    }
+
+    @Benchmark
+    public boolean utf32leCanEncodeStringYes() {
+        return utf32le.canEncode("D");
+    }
+
+    @Benchmark
+    public boolean utf32leCanEncodeCharNo() {
+        return utf32le.canEncode(Character.MIN_SURROGATE);
+    }
+
+    @Benchmark
+    public boolean utf32leCanEncodeStringNo() {
+        return utf32le.canEncode(String.valueOf(Character.MIN_SURROGATE));
+    }
 }

From 3f6271b2b91c096d1b6fcb74c279c5607e116357 Mon Sep 17 00:00:00 2001
From: Kerem Kat <krk@openjdk.org>
Date: Wed, 1 Apr 2026 00:10:02 +0000
Subject: [PATCH 445/655] 8375442: C2: Notify nodes that inspect the graph
 deeply of changes far away during IGVN

Reviewed-by: qamai, aseoane
---
 src/hotspot/share/opto/c2_globals.hpp         |   4 +
 src/hotspot/share/opto/cfgnode.cpp            |   4 +-
 src/hotspot/share/opto/compile.cpp            |  10 +-
 src/hotspot/share/opto/escape.cpp             |   2 +-
 src/hotspot/share/opto/graphKit.cpp           |   4 +-
 src/hotspot/share/opto/ifnode.cpp             |  29 +-
 src/hotspot/share/opto/loopnode.cpp           |   8 +-
 src/hotspot/share/opto/loopopts.cpp           |  18 +-
 src/hotspot/share/opto/macro.cpp              |  24 +-
 src/hotspot/share/opto/memnode.cpp            |   2 +-
 src/hotspot/share/opto/phaseX.cpp             | 290 +++++++++++-------
 src/hotspot/share/opto/phaseX.hpp             |  78 ++++-
 src/hotspot/share/opto/split_if.cpp           |  24 +-
 .../compiler/arraycopy/TestCloneAccess.java   |  12 +-
 .../compiler/c2/igvn/TestDeepIGVNRevisit.java |  83 +++++
 .../igvn/TestFoldComparesCleanup.java         |  56 ++++
 .../compiler/lib/ir_framework/IRNode.java     |   5 +
 17 files changed, 467 insertions(+), 186 deletions(-)
 create mode 100644 test/hotspot/jtreg/compiler/c2/igvn/TestDeepIGVNRevisit.java
 create mode 100644 test/hotspot/jtreg/compiler/igvn/TestFoldComparesCleanup.java

diff --git a/src/hotspot/share/opto/c2_globals.hpp b/src/hotspot/share/opto/c2_globals.hpp
index a4f6d04f6a3..983ac8a32c6 100644
--- a/src/hotspot/share/opto/c2_globals.hpp
+++ b/src/hotspot/share/opto/c2_globals.hpp
@@ -705,6 +705,10 @@
   develop(bool, TraceIterativeGVN, false,                                   \
           "Print progress during Iterative Global Value Numbering")         \
                                                                             \
+  develop(bool, UseDeepIGVNRevisit, true,                                   \
+          "Re-process nodes that could benefit from a deep revisit after "  \
+          "the IGVN worklist drains")                                       \
+                                                                            \
   develop(uint, VerifyIterativeGVN, 0,                                      \
           "Verify Iterative Global Value Numbering =FEDCBA, with:"          \
           "  F: verify Node::Ideal does not return nullptr if the node"     \
diff --git a/src/hotspot/share/opto/cfgnode.cpp b/src/hotspot/share/opto/cfgnode.cpp
index 0915f79a503..828e5bf299f 100644
--- a/src/hotspot/share/opto/cfgnode.cpp
+++ b/src/hotspot/share/opto/cfgnode.cpp
@@ -735,7 +735,7 @@ Node *RegionNode::Ideal(PhaseGVN *phase, bool can_reshape) {
 #endif
       }
       // Remove the RegionNode itself from DefUse info
-      igvn->remove_dead_node(this);
+      igvn->remove_dead_node(this, PhaseIterGVN::NodeOrigin::Graph);
       return nullptr;
     }
     return this;                // Record progress
@@ -1007,7 +1007,7 @@ bool RegionNode::optimize_trichotomy(PhaseIterGVN* igvn) {
     BoolNode* new_bol = new BoolNode(bol2->in(1), res);
     igvn->replace_input_of(iff2, 1, igvn->transform((proj2->_con == 1) ? new_bol : new_bol->negate(igvn)));
     if (new_bol->outcnt() == 0) {
-      igvn->remove_dead_node(new_bol);
+      igvn->remove_dead_node(new_bol, PhaseIterGVN::NodeOrigin::Speculative);
     }
   }
   return false;
diff --git a/src/hotspot/share/opto/compile.cpp b/src/hotspot/share/opto/compile.cpp
index 7ab384a29c7..7b5f78a8ad3 100644
--- a/src/hotspot/share/opto/compile.cpp
+++ b/src/hotspot/share/opto/compile.cpp
@@ -2277,7 +2277,7 @@ void Compile::remove_root_to_sfpts_edges(PhaseIterGVN& igvn) {
       if (n != nullptr && n->is_SafePoint()) {
         r->rm_prec(i);
         if (n->outcnt() == 0) {
-          igvn.remove_dead_node(n);
+          igvn.remove_dead_node(n, PhaseIterGVN::NodeOrigin::Graph);
         }
         --i;
       }
@@ -2321,7 +2321,7 @@ void Compile::Optimize() {
 #endif
   {
     TracePhase tp(_t_iterGVN);
-    igvn.optimize();
+    igvn.optimize(true);
   }
 
   if (failing())  return;
@@ -2385,7 +2385,7 @@ void Compile::Optimize() {
       PhaseRenumberLive prl(initial_gvn(), *igvn_worklist());
     }
     igvn.reset();
-    igvn.optimize();
+    igvn.optimize(true);
     if (failing()) return;
   }
 
@@ -2418,7 +2418,7 @@ void Compile::Optimize() {
       int mcount = macro_count(); // Record number of allocations and locks before IGVN
 
       // Optimize out fields loads from scalar replaceable allocations.
-      igvn.optimize();
+      igvn.optimize(true);
       print_method(PHASE_ITER_GVN_AFTER_EA, 2);
 
       if (failing()) return;
@@ -2498,7 +2498,7 @@ void Compile::Optimize() {
   {
     TracePhase tp(_t_iterGVN2);
     igvn.reset_from_igvn(&ccp);
-    igvn.optimize();
+    igvn.optimize(true);
   }
   print_method(PHASE_ITER_GVN2, 2);
 
diff --git a/src/hotspot/share/opto/escape.cpp b/src/hotspot/share/opto/escape.cpp
index 7041eb0b810..64ee60037d6 100644
--- a/src/hotspot/share/opto/escape.cpp
+++ b/src/hotspot/share/opto/escape.cpp
@@ -933,7 +933,7 @@ void ConnectionGraph::reduce_phi_on_castpp_field_load(Node* curr_castpp, Growabl
         j = MIN2(j, (int)use->outcnt()-1);
       }
 
-      _igvn->remove_dead_node(use);
+      _igvn->remove_dead_node(use, PhaseIterGVN::NodeOrigin::Graph);
     }
     --i;
     i = MIN2(i, (int)curr_castpp->outcnt()-1);
diff --git a/src/hotspot/share/opto/graphKit.cpp b/src/hotspot/share/opto/graphKit.cpp
index e297292770e..8d32694e9a5 100644
--- a/src/hotspot/share/opto/graphKit.cpp
+++ b/src/hotspot/share/opto/graphKit.cpp
@@ -2911,8 +2911,8 @@ Node* Phase::gen_subtype_check(Node* subklass, Node* superklass, Node** ctrl, No
     *ctrl = iftrue1; // We need exactly the 1 test above
     PhaseIterGVN* igvn = gvn.is_IterGVN();
     if (igvn != nullptr) {
-      igvn->remove_globally_dead_node(r_ok_subtype);
-      igvn->remove_globally_dead_node(r_not_subtype);
+      igvn->remove_globally_dead_node(r_ok_subtype, PhaseIterGVN::NodeOrigin::Speculative);
+      igvn->remove_globally_dead_node(r_not_subtype, PhaseIterGVN::NodeOrigin::Speculative);
     }
     return not_subtype_ctrl;
   }
diff --git a/src/hotspot/share/opto/ifnode.cpp b/src/hotspot/share/opto/ifnode.cpp
index 762791d467d..ad8f0ced6ea 100644
--- a/src/hotspot/share/opto/ifnode.cpp
+++ b/src/hotspot/share/opto/ifnode.cpp
@@ -132,7 +132,7 @@ static Node* split_if(IfNode *iff, PhaseIterGVN *igvn) {
   cmp2->set_req(2,con2);
   const Type *t = cmp2->Value(igvn);
   // This compare is dead, so whack it!
-  igvn->remove_dead_node(cmp2);
+  igvn->remove_dead_node(cmp2, PhaseIterGVN::NodeOrigin::Speculative);
   if( !t->singleton() ) return nullptr;
 
   // No intervening control, like a simple Call
@@ -443,7 +443,7 @@ static Node* split_if(IfNode *iff, PhaseIterGVN *igvn) {
       }
       l -= uses_found;    // we deleted 1 or more copies of this edge
     }
-    igvn->remove_dead_node(p);
+    igvn->remove_dead_node(p, PhaseIterGVN::NodeOrigin::Graph);
   }
 
   // Force the original merge dead
@@ -455,14 +455,14 @@ static Node* split_if(IfNode *iff, PhaseIterGVN *igvn) {
       r->set_req(0, nullptr);
     } else {
       assert(u->outcnt() == 0, "only dead users");
-      igvn->remove_dead_node(u);
+      igvn->remove_dead_node(u, PhaseIterGVN::NodeOrigin::Graph);
     }
     l -= 1;
   }
-  igvn->remove_dead_node(r);
+  igvn->remove_dead_node(r, PhaseIterGVN::NodeOrigin::Graph);
 
   // Now remove the bogus extra edges used to keep things alive
-  igvn->remove_dead_node( hook );
+  igvn->remove_dead_node(hook, PhaseIterGVN::NodeOrigin::Speculative);
 
   // Must return either the original node (now dead) or a new node
   // (Do not return a top here, since that would break the uniqueness of top.)
@@ -905,6 +905,7 @@ bool IfNode::fold_compares_helper(IfProjNode* proj, IfProjNode* success, IfProjN
   IfNode* dom_iff = proj->in(0)->as_If();
   BoolNode* dom_bool = dom_iff->in(1)->as_Bool();
   Node* lo = dom_iff->in(1)->in(1)->in(2);
+  Node* orig_lo = lo;
   Node* hi = this_cmp->in(2);
   Node* n = this_cmp->in(1);
   IfProjNode* otherproj = proj->other_if_proj();
@@ -916,6 +917,7 @@ bool IfNode::fold_compares_helper(IfProjNode* proj, IfProjNode* success, IfProjN
   BoolTest::mask hi_test = this_bool->_test._test;
   BoolTest::mask cond = hi_test;
 
+  PhaseTransform::SpeculativeProgressGuard progress_guard(igvn);
   // convert:
   //
   //          dom_bool = x {<,<=,>,>=} a
@@ -1053,6 +1055,7 @@ bool IfNode::fold_compares_helper(IfProjNode* proj, IfProjNode* success, IfProjN
           // previous if determines the result of this if so
           // replace Bool with constant
           igvn->replace_input_of(this, 1, igvn->intcon(success->_con));
+          progress_guard.commit();
           return true;
         }
       }
@@ -1087,11 +1090,14 @@ bool IfNode::fold_compares_helper(IfProjNode* proj, IfProjNode* success, IfProjN
     // min(limit, max(-2 + min_jint + 1, min_jint))
     // = min(limit, min_jint)
     // = min_jint
+    if (lo != orig_lo && lo->outcnt() == 0) {
+      igvn->remove_dead_node(lo, PhaseIterGVN::NodeOrigin::Speculative);
+    }
     if (adjusted_val->outcnt() == 0) {
-      igvn->remove_dead_node(adjusted_val);
+      igvn->remove_dead_node(adjusted_val, PhaseIterGVN::NodeOrigin::Speculative);
     }
     if (adjusted_lim->outcnt() == 0) {
-      igvn->remove_dead_node(adjusted_lim);
+      igvn->remove_dead_node(adjusted_lim, PhaseIterGVN::NodeOrigin::Speculative);
     }
     igvn->C->record_for_post_loop_opts_igvn(this);
     return false;
@@ -1103,6 +1109,7 @@ bool IfNode::fold_compares_helper(IfProjNode* proj, IfProjNode* success, IfProjN
   igvn->replace_input_of(dom_iff, 1, igvn->intcon(proj->_con));
   igvn->replace_input_of(this, 1, newbool);
 
+  progress_guard.commit();
   return true;
 }
 
@@ -1592,11 +1599,11 @@ Node* IfNode::dominated_by(Node* prev_dom, PhaseIterGVN* igvn, bool prev_dom_not
       }
     } // End for each child of a projection
 
-    igvn->remove_dead_node(ifp);
+    igvn->remove_dead_node(ifp, PhaseIterGVN::NodeOrigin::Graph);
   } // End for each IfTrue/IfFalse child of If
 
   // Kill the IfNode
-  igvn->remove_dead_node(this);
+  igvn->remove_dead_node(this, PhaseIterGVN::NodeOrigin::Graph);
 
   // Must return either the original node (now dead) or a new node
   // (Do not return a top here, since that would break the uniqueness of top.)
@@ -1758,7 +1765,7 @@ Node* IfNode::simple_subsuming(PhaseIterGVN* igvn) {
   }
 
   if (bol->outcnt() == 0) {
-    igvn->remove_dead_node(bol);    // Kill the BoolNode.
+    igvn->remove_dead_node(bol, PhaseIterGVN::NodeOrigin::Graph);    // Kill the BoolNode.
   }
   return this;
 }
@@ -1903,7 +1910,7 @@ static IfNode* idealize_test(PhaseGVN* phase, IfNode* iff) {
 
   Node *prior = igvn->hash_find_insert(iff);
   if( prior ) {
-    igvn->remove_dead_node(iff);
+    igvn->remove_dead_node(iff, PhaseIterGVN::NodeOrigin::Graph);
     iff = (IfNode*)prior;
   } else {
     // Cannot call transform on it just yet
diff --git a/src/hotspot/share/opto/loopnode.cpp b/src/hotspot/share/opto/loopnode.cpp
index 23186a25320..6963a67118f 100644
--- a/src/hotspot/share/opto/loopnode.cpp
+++ b/src/hotspot/share/opto/loopnode.cpp
@@ -697,7 +697,7 @@ SafePointNode* PhaseIdealLoop::find_safepoint(Node* back_control, const Node* he
     }
 #ifdef ASSERT
     if (mm != nullptr) {
-      _igvn.remove_dead_node(mm);
+      _igvn.remove_dead_node(mm, PhaseIterGVN::NodeOrigin::Speculative);
     }
 #endif
   }
@@ -2002,7 +2002,7 @@ bool CountedLoopConverter::stress_long_counted_loop() {
       Node* n = iv_nodes.at(i);
       Node* clone = old_new[n->_idx];
       if (clone != nullptr) {
-        igvn->remove_dead_node(clone);
+        igvn->remove_dead_node(clone, PhaseIterGVN::NodeOrigin::Speculative);
       }
     }
     return false;
@@ -4676,7 +4676,7 @@ void PhaseIdealLoop::replace_parallel_iv(IdealLoopTree *loop) {
     _igvn.replace_node( phi2, add );
     // Sometimes an induction variable is unused
     if (add->outcnt() == 0) {
-      _igvn.remove_dead_node(add);
+      _igvn.remove_dead_node(add, PhaseIterGVN::NodeOrigin::Graph);
     }
     --i; // deleted this phi; rescan starting with next position
   }
@@ -5354,7 +5354,7 @@ void PhaseIdealLoop::build_and_optimize() {
 
   // clear out the dead code after build_loop_late
   while (_deadlist.size()) {
-    _igvn.remove_globally_dead_node(_deadlist.pop());
+    _igvn.remove_globally_dead_node(_deadlist.pop(), PhaseIterGVN::NodeOrigin::Graph);
   }
 
   eliminate_useless_zero_trip_guard();
diff --git a/src/hotspot/share/opto/loopopts.cpp b/src/hotspot/share/opto/loopopts.cpp
index 4e447edee8d..11b23d7c365 100644
--- a/src/hotspot/share/opto/loopopts.cpp
+++ b/src/hotspot/share/opto/loopopts.cpp
@@ -161,7 +161,7 @@ Node* PhaseIdealLoop::split_thru_phi(Node* n, Node* region, int policy) {
     }
 
     if (the_clone != x) {
-      _igvn.remove_dead_node(the_clone);
+      _igvn.remove_dead_node(the_clone, PhaseIterGVN::NodeOrigin::Speculative);
     } else if (region->is_Loop() && i == LoopNode::LoopBackControl &&
                n->is_Load() && can_move_to_inner_loop(n, region->as_Loop(), x)) {
       // it is not a win if 'x' moved from an outer to an inner loop
@@ -172,7 +172,7 @@ Node* PhaseIdealLoop::split_thru_phi(Node* n, Node* region, int policy) {
   }
   // Too few wins?
   if (!wins.profitable(policy)) {
-    _igvn.remove_dead_node(phi);
+    _igvn.remove_dead_node(phi, PhaseIterGVN::NodeOrigin::Speculative);
     return nullptr;
   }
 
@@ -1866,7 +1866,7 @@ void PhaseIdealLoop::try_sink_out_of_loop(Node* n) {
             assert(cast != nullptr, "must have added a cast to pin the node");
           }
         }
-        _igvn.remove_dead_node(n);
+        _igvn.remove_dead_node(n, PhaseIterGVN::NodeOrigin::Graph);
       }
       _dom_lca_tags_round = 0;
     }
@@ -2082,7 +2082,7 @@ Node* PhaseIdealLoop::clone_iff(PhiNode* phi) {
   // Register with optimizer
   Node *hit1 = _igvn.hash_find_insert(phi1);
   if (hit1) {                   // Hit, toss just made Phi
-    _igvn.remove_dead_node(phi1); // Remove new phi
+    _igvn.remove_dead_node(phi1, PhaseIterGVN::NodeOrigin::Speculative); // Remove new phi
     assert(hit1->is_Phi(), "" );
     phi1 = (PhiNode*)hit1;      // Use existing phi
   } else {                      // Miss
@@ -2090,7 +2090,7 @@ Node* PhaseIdealLoop::clone_iff(PhiNode* phi) {
   }
   Node *hit2 = _igvn.hash_find_insert(phi2);
   if (hit2) {                   // Hit, toss just made Phi
-    _igvn.remove_dead_node(phi2); // Remove new phi
+    _igvn.remove_dead_node(phi2, PhaseIterGVN::NodeOrigin::Speculative); // Remove new phi
     assert(hit2->is_Phi(), "" );
     phi2 = (PhiNode*)hit2;      // Use existing phi
   } else {                      // Miss
@@ -2165,7 +2165,7 @@ CmpNode*PhaseIdealLoop::clone_bool(PhiNode* phi) {
   // Register with optimizer
   Node *hit1 = _igvn.hash_find_insert(phi1);
   if( hit1 ) {                  // Hit, toss just made Phi
-    _igvn.remove_dead_node(phi1); // Remove new phi
+    _igvn.remove_dead_node(phi1, PhaseIterGVN::NodeOrigin::Speculative); // Remove new phi
     assert( hit1->is_Phi(), "" );
     phi1 = (PhiNode*)hit1;      // Use existing phi
   } else {                      // Miss
@@ -2173,7 +2173,7 @@ CmpNode*PhaseIdealLoop::clone_bool(PhiNode* phi) {
   }
   Node *hit2 = _igvn.hash_find_insert(phi2);
   if( hit2 ) {                  // Hit, toss just made Phi
-    _igvn.remove_dead_node(phi2); // Remove new phi
+    _igvn.remove_dead_node(phi2, PhaseIterGVN::NodeOrigin::Speculative); // Remove new phi
     assert( hit2->is_Phi(), "" );
     phi2 = (PhiNode*)hit2;      // Use existing phi
   } else {                      // Miss
@@ -2324,7 +2324,7 @@ void PhaseIdealLoop::clone_loop_handle_data_uses(Node* old, Node_List &old_new,
           _igvn.register_new_node_with_optimizer(phi); // Register new phi
         } else {                                      // or
           // Remove the new phi from the graph and use the hit
-          _igvn.remove_dead_node(phi);
+          _igvn.remove_dead_node(phi, phi == prev ? PhaseIterGVN::NodeOrigin::Graph : PhaseIterGVN::NodeOrigin::Speculative);
           phi = hit;                                  // Use existing phi
         }
         set_ctrl(phi, prev);
@@ -3472,7 +3472,7 @@ void PhaseIdealLoop::insert_phi_for_loop( Node* use, uint idx, Node* lp_entry_va
     set_ctrl(phi, lp);
   } else {
     // Remove the new phi from the graph and use the hit
-    _igvn.remove_dead_node(phi);
+    _igvn.remove_dead_node(phi, PhaseIterGVN::NodeOrigin::Speculative);
     phi = hit;
   }
   _igvn.replace_input_of(use, idx, phi);
diff --git a/src/hotspot/share/opto/macro.cpp b/src/hotspot/share/opto/macro.cpp
index c78f6533840..1c54a11e2a4 100644
--- a/src/hotspot/share/opto/macro.cpp
+++ b/src/hotspot/share/opto/macro.cpp
@@ -973,7 +973,7 @@ void PhaseMacroExpand::process_users_of_allocation(CallNode *alloc) {
           }
           k -= (oc2 - use->outcnt());
         }
-        _igvn.remove_dead_node(use);
+        _igvn.remove_dead_node(use, PhaseIterGVN::NodeOrigin::Graph);
       } else if (use->is_ArrayCopy()) {
         // Disconnect ArrayCopy node
         ArrayCopyNode* ac = use->as_ArrayCopy();
@@ -1008,7 +1008,7 @@ void PhaseMacroExpand::process_users_of_allocation(CallNode *alloc) {
           // src can be top at this point if src and dest of the
           // arraycopy were the same
           if (src->outcnt() == 0 && !src->is_top()) {
-            _igvn.remove_dead_node(src);
+            _igvn.remove_dead_node(src, PhaseIterGVN::NodeOrigin::Graph);
           }
         }
         _igvn._worklist.push(ac);
@@ -1018,7 +1018,7 @@ void PhaseMacroExpand::process_users_of_allocation(CallNode *alloc) {
       j -= (oc1 - res->outcnt());
     }
     assert(res->outcnt() == 0, "all uses of allocated objects must be deleted");
-    _igvn.remove_dead_node(res);
+    _igvn.remove_dead_node(res, PhaseIterGVN::NodeOrigin::Graph);
   }
 
   //
@@ -1502,7 +1502,7 @@ void PhaseMacroExpand::expand_allocate_common(
       transform_later(_callprojs.fallthrough_memproj);
     }
     migrate_outs(_callprojs.catchall_memproj, _callprojs.fallthrough_memproj);
-    _igvn.remove_dead_node(_callprojs.catchall_memproj);
+    _igvn.remove_dead_node(_callprojs.catchall_memproj, PhaseIterGVN::NodeOrigin::Graph);
   }
 
   // An allocate node has separate i_o projections for the uses on the control
@@ -1521,7 +1521,7 @@ void PhaseMacroExpand::expand_allocate_common(
       transform_later(_callprojs.fallthrough_ioproj);
     }
     migrate_outs(_callprojs.catchall_ioproj, _callprojs.fallthrough_ioproj);
-    _igvn.remove_dead_node(_callprojs.catchall_ioproj);
+    _igvn.remove_dead_node(_callprojs.catchall_ioproj, PhaseIterGVN::NodeOrigin::Graph);
   }
 
   // if we generated only a slow call, we are done
@@ -1585,11 +1585,11 @@ void PhaseMacroExpand::yank_alloc_node(AllocateNode* alloc) {
       --i; // back up iterator
     }
     assert(_callprojs.resproj->outcnt() == 0, "all uses must be deleted");
-    _igvn.remove_dead_node(_callprojs.resproj);
+    _igvn.remove_dead_node(_callprojs.resproj, PhaseIterGVN::NodeOrigin::Graph);
   }
   if (_callprojs.fallthrough_catchproj != nullptr) {
     migrate_outs(_callprojs.fallthrough_catchproj, ctrl);
-    _igvn.remove_dead_node(_callprojs.fallthrough_catchproj);
+    _igvn.remove_dead_node(_callprojs.fallthrough_catchproj, PhaseIterGVN::NodeOrigin::Graph);
   }
   if (_callprojs.catchall_catchproj != nullptr) {
     _igvn.rehash_node_delayed(_callprojs.catchall_catchproj);
@@ -1597,16 +1597,16 @@ void PhaseMacroExpand::yank_alloc_node(AllocateNode* alloc) {
   }
   if (_callprojs.fallthrough_proj != nullptr) {
     Node* catchnode = _callprojs.fallthrough_proj->unique_ctrl_out();
-    _igvn.remove_dead_node(catchnode);
-    _igvn.remove_dead_node(_callprojs.fallthrough_proj);
+    _igvn.remove_dead_node(catchnode, PhaseIterGVN::NodeOrigin::Graph);
+    _igvn.remove_dead_node(_callprojs.fallthrough_proj, PhaseIterGVN::NodeOrigin::Graph);
   }
   if (_callprojs.fallthrough_memproj != nullptr) {
     migrate_outs(_callprojs.fallthrough_memproj, mem);
-    _igvn.remove_dead_node(_callprojs.fallthrough_memproj);
+    _igvn.remove_dead_node(_callprojs.fallthrough_memproj, PhaseIterGVN::NodeOrigin::Graph);
   }
   if (_callprojs.fallthrough_ioproj != nullptr) {
     migrate_outs(_callprojs.fallthrough_ioproj, i_o);
-    _igvn.remove_dead_node(_callprojs.fallthrough_ioproj);
+    _igvn.remove_dead_node(_callprojs.fallthrough_ioproj, PhaseIterGVN::NodeOrigin::Graph);
   }
   if (_callprojs.catchall_memproj != nullptr) {
     _igvn.rehash_node_delayed(_callprojs.catchall_memproj);
@@ -1625,7 +1625,7 @@ void PhaseMacroExpand::yank_alloc_node(AllocateNode* alloc) {
     }
   }
 #endif
-  _igvn.remove_dead_node(alloc);
+  _igvn.remove_dead_node(alloc, PhaseIterGVN::NodeOrigin::Graph);
 }
 
 void PhaseMacroExpand::expand_initialize_membar(AllocateNode* alloc, InitializeNode* init,
diff --git a/src/hotspot/share/opto/memnode.cpp b/src/hotspot/share/opto/memnode.cpp
index 46f6729c82f..c8723d6ec0f 100644
--- a/src/hotspot/share/opto/memnode.cpp
+++ b/src/hotspot/share/opto/memnode.cpp
@@ -1889,7 +1889,7 @@ Node* LoadNode::split_through_phi(PhaseGVN* phase, bool ignore_missing_instance_
       }
     }
     if (x != the_clone && the_clone != nullptr) {
-      igvn->remove_dead_node(the_clone);
+      igvn->remove_dead_node(the_clone, PhaseIterGVN::NodeOrigin::Speculative);
     }
     phi->set_req(i, x);
   }
diff --git a/src/hotspot/share/opto/phaseX.cpp b/src/hotspot/share/opto/phaseX.cpp
index 29961e152b3..06963eff4cf 100644
--- a/src/hotspot/share/opto/phaseX.cpp
+++ b/src/hotspot/share/opto/phaseX.cpp
@@ -575,7 +575,7 @@ PhaseValues::~PhaseValues() {
   _table.dump();
   // Statistics for value progress and efficiency
   if( PrintCompilation && Verbose && WizardMode ) {
-    tty->print("\n%sValues: %d nodes ---> %d/%d (%d)",
+    tty->print("\n%sValues: %d nodes ---> " UINT64_FORMAT "/%d (%d)",
       is_IterGVN() ? "Iter" : "    ", C->unique(), made_progress(), made_transforms(), made_new_values());
     if( made_transforms() != 0 ) {
       tty->print_cr("  ratio %f", made_progress()/(float)made_transforms() );
@@ -731,14 +731,14 @@ Node* PhaseGVN::transform(Node* n) {
   }
 
   if (t->singleton() && !k->is_Con()) {
-    NOT_PRODUCT(set_progress();)
+    set_progress();
     return makecon(t);          // Turn into a constant
   }
 
   // Now check for Identities
   i = k->Identity(this);        // Look for a nearby replacement
   if (i != k) {                 // Found? Return replacement!
-    NOT_PRODUCT(set_progress();)
+    set_progress();
     return i;
   }
 
@@ -746,7 +746,7 @@ Node* PhaseGVN::transform(Node* n) {
   i = hash_find_insert(k);      // Insert if new
   if (i && (i != k)) {
     // Return the pre-existing node
-    NOT_PRODUCT(set_progress();)
+    set_progress();
     return i;
   }
 
@@ -977,7 +977,7 @@ void PhaseIterGVN::init_verifyPhaseIterGVN() {
 #endif
 }
 
-void PhaseIterGVN::verify_PhaseIterGVN() {
+void PhaseIterGVN::verify_PhaseIterGVN(bool deep_revisit_converged) {
 #ifdef ASSERT
   // Verify nodes with changed inputs.
   Unique_Node_List* modified_list = C->modified_nodes();
@@ -1010,7 +1010,7 @@ void PhaseIterGVN::verify_PhaseIterGVN() {
     }
   }
 
-  verify_optimize();
+  verify_optimize(deep_revisit_converged);
 #endif
 }
 #endif /* PRODUCT */
@@ -1040,38 +1040,54 @@ void PhaseIterGVN::trace_PhaseIterGVN_verbose(Node* n, int num_processed) {
 }
 #endif /* ASSERT */
 
-void PhaseIterGVN::optimize() {
-  DEBUG_ONLY(uint num_processed  = 0;)
-  NOT_PRODUCT(init_verifyPhaseIterGVN();)
-  NOT_PRODUCT(C->reset_igv_phase_iter(PHASE_AFTER_ITER_GVN_STEP);)
-  C->print_method(PHASE_BEFORE_ITER_GVN, 3);
-  if (StressIGVN) {
-    shuffle_worklist();
+bool PhaseIterGVN::needs_deep_revisit(const Node* n) const {
+  // LoadNode::Value() -> can_see_stored_value() walks up through many memory
+  // nodes. LoadNode::Ideal() -> find_previous_store() also walks up to 50
+  // nodes through stores and arraycopy nodes.
+  if (n->is_Load()) {
+    return true;
   }
+  // CmpPNode::sub() -> detect_ptr_independence() -> all_controls_dominate()
+  // walks CFG dominator relationships extensively. This only triggers when
+  // both inputs are oop pointers (subnode.cpp:984).
+  if (n->Opcode() == Op_CmpP) {
+    const Type* t1 = type_or_null(n->in(1));
+    const Type* t2 = type_or_null(n->in(2));
+    return t1 != nullptr && t1->isa_oopptr() &&
+           t2 != nullptr && t2->isa_oopptr();
+  }
+  // IfNode::Ideal() -> search_identical() walks up the CFG dominator tree.
+  // RangeCheckNode::Ideal() scans up to ~999 nodes up the chain.
+  // CountedLoopEndNode/LongCountedLoopEndNode::Ideal() via simple_subsuming
+  // looks for dominating test that subsumes the current test.
+  switch (n->Opcode()) {
+  case Op_If:
+  case Op_RangeCheck:
+  case Op_CountedLoopEnd:
+  case Op_LongCountedLoopEnd:
+    return true;
+  default:
+    break;
+  }
+  return false;
+}
 
-  // The node count check in the loop below (check_node_count) assumes that we
-  // increase the live node count with at most
-  // max_live_nodes_increase_per_iteration in between checks. If this
-  // assumption does not hold, there is a risk that we exceed the max node
-  // limit in between checks and trigger an assert during node creation.
+bool PhaseIterGVN::drain_worklist() {
+  uint loop_count = 1;
   const int max_live_nodes_increase_per_iteration = NodeLimitFudgeFactor * 3;
-
-  uint loop_count = 0;
-  // Pull from worklist and transform the node. If the node has changed,
-  // update edge info and put uses on worklist.
-  while (_worklist.size() > 0) {
+  while (_worklist.size() != 0) {
     if (C->check_node_count(max_live_nodes_increase_per_iteration, "Out of nodes")) {
       C->print_method(PHASE_AFTER_ITER_GVN, 3);
-      return;
+      return true;
     }
     Node* n  = _worklist.pop();
     if (loop_count >= K * C->live_nodes()) {
-      DEBUG_ONLY(dump_infinite_loop_info(n, "PhaseIterGVN::optimize");)
-      C->record_method_not_compilable("infinite loop in PhaseIterGVN::optimize");
+      DEBUG_ONLY(dump_infinite_loop_info(n, "PhaseIterGVN::drain_worklist");)
+      C->record_method_not_compilable("infinite loop in PhaseIterGVN::drain_worklist");
       C->print_method(PHASE_AFTER_ITER_GVN, 3);
-      return;
+      return true;
     }
-    DEBUG_ONLY(trace_PhaseIterGVN_verbose(n, num_processed++);)
+    DEBUG_ONLY(trace_PhaseIterGVN_verbose(n, _num_processed++);)
     if (n->outcnt() != 0) {
       NOT_PRODUCT(const Type* oldtype = type_or_null(n));
       // Do the transformation
@@ -1079,7 +1095,7 @@ void PhaseIterGVN::optimize() {
       Node* nn = transform_old(n);
       DEBUG_ONLY(int live_nodes_after = C->live_nodes();)
       // Ensure we did not increase the live node count with more than
-      // max_live_nodes_increase_per_iteration during the call to transform_old
+      // max_live_nodes_increase_per_iteration during the call to transform_old.
       DEBUG_ONLY(int increase = live_nodes_after - live_nodes_before;)
       assert(increase < max_live_nodes_increase_per_iteration,
              "excessive live node increase in single iteration of IGVN: %d "
@@ -1087,16 +1103,115 @@ void PhaseIterGVN::optimize() {
              increase, max_live_nodes_increase_per_iteration);
       NOT_PRODUCT(trace_PhaseIterGVN(n, nn, oldtype);)
     } else if (!n->is_top()) {
-      remove_dead_node(n);
+      remove_dead_node(n, NodeOrigin::Graph);
     }
     loop_count++;
   }
-  NOT_PRODUCT(verify_PhaseIterGVN();)
+  return false;
+}
+
+void PhaseIterGVN::push_deep_revisit_candidates() {
+  ResourceMark rm;
+  Unique_Node_List all_nodes;
+  all_nodes.push(C->root());
+  for (uint j = 0; j < all_nodes.size(); j++) {
+    Node* n = all_nodes.at(j);
+    if (needs_deep_revisit(n)) {
+      _worklist.push(n);
+    }
+    for (DUIterator_Fast imax, i = n->fast_outs(imax); i < imax; i++) {
+      all_nodes.push(n->fast_out(i));
+    }
+  }
+}
+
+bool PhaseIterGVN::deep_revisit() {
+  // Re-process nodes that inspect the graph deeply. After the main worklist drains, walk
+  // the graph to find all live deep-inspection nodes and push them to the worklist
+  // for re-evaluation. If any produce changes, drain the worklist again.
+  // Repeat until stable. This mirrors PhaseCCP::analyze()'s revisit loop.
+  const uint max_deep_revisit_rounds = 10; // typically converges in <2 rounds
+  uint round = 0;
+  for (; round < max_deep_revisit_rounds; round++) {
+    push_deep_revisit_candidates();
+    if (_worklist.size() == 0) {
+      break; // No deep-inspection nodes to revisit, done.
+    }
+
+#ifndef PRODUCT
+    uint candidates = _worklist.size();
+    uint n_if = 0; uint n_rc = 0; uint n_load = 0; uint n_cmpp = 0; uint n_cle = 0; uint n_lcle = 0;
+    if (TraceIterativeGVN) {
+      for (uint i = 0; i < _worklist.size(); i++) {
+        Node* n = _worklist.at(i);
+        switch (n->Opcode()) {
+        case Op_If:                 n_if++;   break;
+        case Op_RangeCheck:         n_rc++;   break;
+        case Op_CountedLoopEnd:     n_cle++;  break;
+        case Op_LongCountedLoopEnd: n_lcle++; break;
+        case Op_CmpP:               n_cmpp++; break;
+        default: if (n->is_Load())  n_load++; break;
+        }
+      }
+    }
+#endif
+
+    // Convergence: if the drain does not make progress (no Ideal, Value, Identity or GVN changes),
+    // we are at a fixed point. We use made_progress() rather than live_nodes because live_nodes
+    // misses non-structural changes like a LoadNode dropping its control input.
+    uint progress_before = made_progress();
+    if (drain_worklist()) {
+      return false;
+    }
+    uint progress = made_progress() - progress_before;
+
+#ifndef PRODUCT
+    if (TraceIterativeGVN) {
+      tty->print("deep_revisit round %u: %u candidates (If=%u RC=%u Load=%u CmpP=%u CLE=%u LCLE=%u), progress=%u (%s)",
+                 round, candidates, n_if, n_rc, n_load, n_cmpp, n_cle, n_lcle, progress, progress != 0 ? "changed" : "converged");
+      if (C->method() != nullptr) {
+        tty->print(", ");
+        C->method()->print_short_name(tty);
+      }
+      tty->cr();
+    }
+#endif
+
+    if (progress == 0) {
+      break;
+    }
+  }
+  return round < max_deep_revisit_rounds;
+}
+
+void PhaseIterGVN::optimize(bool deep) {
+  bool deep_revisit_converged = false;
+  DEBUG_ONLY(_num_processed = 0;)
+  NOT_PRODUCT(init_verifyPhaseIterGVN();)
+  NOT_PRODUCT(C->reset_igv_phase_iter(PHASE_AFTER_ITER_GVN_STEP);)
+  C->print_method(PHASE_BEFORE_ITER_GVN, 3);
+  if (StressIGVN) {
+    shuffle_worklist();
+  }
+
+  // Pull from worklist and transform the node.
+  if (drain_worklist()) {
+    return;
+  }
+
+  if (deep && UseDeepIGVNRevisit) {
+    deep_revisit_converged = deep_revisit();
+    if (C->failing()) {
+      return;
+    }
+  }
+
+  NOT_PRODUCT(verify_PhaseIterGVN(deep_revisit_converged);)
   C->print_method(PHASE_AFTER_ITER_GVN, 3);
 }
 
 #ifdef ASSERT
-void PhaseIterGVN::verify_optimize() {
+void PhaseIterGVN::verify_optimize(bool deep_revisit_converged) {
   assert(_worklist.size() == 0, "igvn worklist must be empty before verify");
 
   if (is_verify_Value() ||
@@ -1114,11 +1229,11 @@ void PhaseIterGVN::verify_optimize() {
       // in PhaseIterGVN::add_users_to_worklist to update it again or add an exception
       // in the verification methods below if that is not possible for some reason (like Load nodes).
       if (is_verify_Value()) {
-        verify_Value_for(n);
+        verify_Value_for(n, deep_revisit_converged /* strict */);
       }
       if (is_verify_Ideal()) {
-        verify_Ideal_for(n, false);
-        verify_Ideal_for(n, true);
+        verify_Ideal_for(n, false /* can_reshape */, deep_revisit_converged);
+        verify_Ideal_for(n, true  /* can_reshape */, deep_revisit_converged);
       }
       if (is_verify_Identity()) {
         verify_Identity_for(n);
@@ -1240,52 +1355,15 @@ void PhaseIterGVN::verify_Value_for(const Node* n, bool strict) {
 // Check that all Ideal optimizations that could be done were done.
 // Asserts if it found missed optimization opportunities or encountered unexpected changes, and
 //         returns normally otherwise (no missed optimization, or skipped verification).
-void PhaseIterGVN::verify_Ideal_for(Node* n, bool can_reshape) {
+void PhaseIterGVN::verify_Ideal_for(Node* n, bool can_reshape, bool deep_revisit_converged) {
+  if (!deep_revisit_converged && needs_deep_revisit(n)) {
+    return;
+  }
+
   // First, we check a list of exceptions, where we skip verification,
   // because there are known cases where Ideal can optimize after IGVN.
   // Some may be expected and cannot be fixed, and others should be fixed.
   switch (n->Opcode()) {
-    // RangeCheckNode::Ideal looks up the chain for about 999 nodes
-    // (see "Range-Check scan limit"). So, it is possible that something
-    // is optimized in that input subgraph, and the RangeCheck was not
-    // added to the worklist because it would be too expensive to walk
-    // down the graph for 1000 nodes and put all on the worklist.
-    //
-    // Found with:
-    //   java -XX:VerifyIterativeGVN=0100 -Xbatch --version
-    case Op_RangeCheck:
-      return;
-
-    // IfNode::Ideal does:
-    //   Node* prev_dom = search_identical(dist, igvn);
-    // which means we seach up the CFG, traversing at most up to a distance.
-    // If anything happens rather far away from the If, we may not put the If
-    // back on the worklist.
-    //
-    // Found with:
-    //   java -XX:VerifyIterativeGVN=0100 -Xcomp --version
-    case Op_If:
-      return;
-
-    // IfNode::simple_subsuming
-    // Looks for dominating test that subsumes the current test.
-    // Notification could be difficult because of larger distance.
-    //
-    // Found with:
-    //   runtime/exceptionMsgs/ArrayIndexOutOfBoundsException/ArrayIndexOutOfBoundsExceptionTest.java#id1
-    //   -XX:VerifyIterativeGVN=1110
-    case Op_CountedLoopEnd:
-      return;
-
-    // LongCountedLoopEndNode::Ideal
-    // Probably same issue as above.
-    //
-    // Found with:
-    //   compiler/predicates/assertion/TestAssertionPredicates.java#NoLoopPredicationXbatch
-    //   -XX:StressLongCountedLoop=2000000 -XX:+IgnoreUnrecognizedVMOptions -XX:VerifyIterativeGVN=1110
-    case Op_LongCountedLoopEnd:
-      return;
-
     // RegionNode::Ideal does "Skip around the useless IF diamond".
     //   245  IfTrue  === 244
     //   258  If  === 245 257
@@ -1757,22 +1835,6 @@ void PhaseIterGVN::verify_Ideal_for(Node* n, bool can_reshape) {
       return;
   }
 
-  if (n->is_Load()) {
-    // LoadNode::Ideal uses tries to find an earlier memory state, and
-    // checks can_see_stored_value for it.
-    //
-    // Investigate why this was not already done during IGVN.
-    // A similar issue happens with Identity.
-    //
-    // There seem to be other cases where loads go up some steps, like
-    // LoadNode::Ideal going up 10x steps to find dominating load.
-    //
-    // Found with:
-    //   test/hotspot/jtreg/compiler/arraycopy/TestCloneAccess.java
-    //   -XX:VerifyIterativeGVN=1110
-    return;
-  }
-
   if (n->is_Store()) {
     // StoreNode::Ideal can do this:
     //  // Capture an unaliased, unconditional, simple store into an initializer.
@@ -1857,8 +1919,16 @@ void PhaseIterGVN::verify_Ideal_for(Node* n, bool can_reshape) {
     return;
   }
 
-  // The number of nodes shoud not increase.
-  uint old_unique = C->unique();
+  // Ideal should not make progress if it returns nullptr.
+  // We use made_progress() rather than unique() or live_nodes() because some
+  // Ideal implementations speculatively create nodes and kill them before
+  // returning nullptr (e.g. split_if clones a Cmp to check is_canonical).
+  // unique() is a high-water mark that is not decremented by remove_dead_node,
+  // so it would cause false-positives. live_nodes() accounts for dead nodes but can
+  // decrease when Ideal removes existing nodes as side effects.
+  // made_progress() precisely tracks meaningful transforms, and speculative
+  // work killed via NodeOrigin::Speculative does not increment it.
+  uint old_progress = made_progress();
   // The hash of a node should not change, this would indicate different inputs
   uint old_hash = n->hash();
   // Remove 'n' from hash table in case it gets modified. We want to avoid
@@ -1870,14 +1940,15 @@ void PhaseIterGVN::verify_Ideal_for(Node* n, bool can_reshape) {
   Node* i = n->Ideal(this, can_reshape);
   // If there was no new Idealization, we are probably happy.
   if (i == nullptr) {
-    if (old_unique < C->unique()) {
+    uint progress = made_progress() - old_progress;
+    if (progress != 0) {
       stringStream ss; // Print as a block without tty lock.
       ss.cr();
-      ss.print_cr("Ideal optimization did not make progress but created new unused nodes.");
-      ss.print_cr("  old_unique = %d, unique = %d", old_unique, C->unique());
+      ss.print_cr("Ideal optimization did not make progress but had side effects.");
+      ss.print_cr("  %u transforms made progress", progress);
       n->dump_bfs(1, nullptr, "", &ss);
       tty->print_cr("%s", ss.as_string());
-      assert(false, "Unexpected new unused nodes from applying Ideal optimization on %s", n->Name());
+      assert(false, "Unexpected side effects from applying Ideal optimization on %s", n->Name());
     }
 
     if (old_hash != n->hash()) {
@@ -2152,6 +2223,9 @@ Node *PhaseIterGVN::transform_old(Node* n) {
 #endif
 
   DEBUG_ONLY(uint loop_count = 1;)
+  if (i != nullptr) {
+    set_progress();
+  }
   while (i != nullptr) {
 #ifdef ASSERT
     if (loop_count >= K + C->live_nodes()) {
@@ -2197,10 +2271,8 @@ Node *PhaseIterGVN::transform_old(Node* n) {
   // cache Value.  Later requests for the local phase->type of this Node can
   // use the cached Value instead of suffering with 'bottom_type'.
   if (type_or_null(k) != t) {
-#ifndef PRODUCT
-    inc_new_values();
+    NOT_PRODUCT(inc_new_values();)
     set_progress();
-#endif
     set_type(k, t);
     // If k is a TypeNode, capture any more-precise type permanently into Node
     k->raise_bottom_type(t);
@@ -2209,7 +2281,7 @@ Node *PhaseIterGVN::transform_old(Node* n) {
   }
   // If 'k' computes a constant, replace it with a constant
   if (t->singleton() && !k->is_Con()) {
-    NOT_PRODUCT(set_progress();)
+    set_progress();
     Node* con = makecon(t);     // Make a constant
     add_users_to_worklist(k);
     subsume_node(k, con);       // Everybody using k now uses con
@@ -2219,7 +2291,7 @@ Node *PhaseIterGVN::transform_old(Node* n) {
   // Now check for Identities
   i = k->Identity(this);      // Look for a nearby replacement
   if (i != k) {                // Found? Return replacement!
-    NOT_PRODUCT(set_progress();)
+    set_progress();
     add_users_to_worklist(k);
     subsume_node(k, i);       // Everybody using k now uses i
     return i;
@@ -2229,7 +2301,7 @@ Node *PhaseIterGVN::transform_old(Node* n) {
   i = hash_find_insert(k);      // Check for pre-existing node
   if (i && (i != k)) {
     // Return the pre-existing node if it isn't dead
-    NOT_PRODUCT(set_progress();)
+    set_progress();
     add_users_to_worklist(k);
     subsume_node(k, i);       // Everybody using k now uses i
     return i;
@@ -2248,7 +2320,7 @@ const Type* PhaseIterGVN::saturate(const Type* new_type, const Type* old_type,
 //------------------------------remove_globally_dead_node----------------------
 // Kill a globally dead Node.  All uses are also globally dead and are
 // aggressively trimmed.
-void PhaseIterGVN::remove_globally_dead_node( Node *dead ) {
+void PhaseIterGVN::remove_globally_dead_node(Node* dead, NodeOrigin origin) {
   enum DeleteProgress {
     PROCESS_INPUTS,
     PROCESS_OUTPUTS
@@ -2265,11 +2337,13 @@ void PhaseIterGVN::remove_globally_dead_node( Node *dead ) {
     uint progress_state = stack.index();
     assert(dead != C->root(), "killing root, eh?");
     assert(!dead->is_top(), "add check for top when pushing");
-    NOT_PRODUCT( set_progress(); )
     if (progress_state == PROCESS_INPUTS) {
       // After following inputs, continue to outputs
       stack.set_index(PROCESS_OUTPUTS);
       if (!dead->is_Con()) { // Don't kill cons but uses
+        if (origin != NodeOrigin::Speculative) {
+          set_progress();
+        }
         bool recurse = false;
         // Remove from hash table
         _table.hash_delete( dead );
@@ -2379,7 +2453,7 @@ void PhaseIterGVN::subsume_node( Node *old, Node *nn ) {
   // Smash all inputs to 'old', isolating him completely
   Node *temp = new Node(1);
   temp->init_req(0,nn);     // Add a use to nn to prevent him from dying
-  remove_dead_node( old );
+  remove_dead_node(old, NodeOrigin::Graph);
   temp->del_req(0);         // Yank bogus edge
   if (nn != nullptr && nn->outcnt() == 0) {
     _worklist.push(nn);
diff --git a/src/hotspot/share/opto/phaseX.hpp b/src/hotspot/share/opto/phaseX.hpp
index 94890c250c4..cef273ff3df 100644
--- a/src/hotspot/share/opto/phaseX.hpp
+++ b/src/hotspot/share/opto/phaseX.hpp
@@ -187,8 +187,8 @@ public:
 class PhaseTransform : public Phase {
 public:
   PhaseTransform(PhaseNumber pnum) : Phase(pnum) {
-#ifndef PRODUCT
     clear_progress();
+#ifndef PRODUCT
     clear_transforms();
     set_allow_progress(true);
 #endif
@@ -201,12 +201,31 @@ public:
   // true if CFG node d dominates CFG node n
   virtual bool is_dominator(Node *d, Node *n) { fatal("unimplemented for this pass"); return false; };
 
-#ifndef PRODUCT
-  uint   _count_progress;       // For profiling, count transforms that make progress
-  void   set_progress()        { ++_count_progress; assert( allow_progress(),"No progress allowed during verification"); }
-  void   clear_progress()      { _count_progress = 0; }
-  uint   made_progress() const { return _count_progress; }
+  uint64_t _count_progress;      // Count transforms that make progress
+  void     set_progress()        { ++_count_progress; assert(allow_progress(), "No progress allowed during verification"); }
+  void     clear_progress()      { _count_progress = 0; }
+  uint64_t made_progress() const { return _count_progress; }
 
+  // RAII guard for speculative transforms. Restores _count_progress in the destructor
+  // unless commit() is called, so that abandoned speculative work does not count as progress.
+  // In case multiple nodes are created and only some are speculative, commit() should still be called.
+  class SpeculativeProgressGuard {
+    PhaseTransform* _phase;
+    uint64_t _saved_progress;
+    bool _committed;
+  public:
+    SpeculativeProgressGuard(PhaseTransform* phase) :
+      _phase(phase), _saved_progress(phase->made_progress()), _committed(false) {}
+    ~SpeculativeProgressGuard() {
+      if (!_committed) {
+        _phase->_count_progress = _saved_progress;
+      }
+    }
+
+    void commit() { _committed = true; }
+  };
+
+#ifndef PRODUCT
   uint   _count_transforms;     // For profiling, count transforms performed
   void   set_transforms()      { ++_count_transforms; }
   void   clear_transforms()    { _count_transforms = 0; }
@@ -446,10 +465,30 @@ class PhaseIterGVN : public PhaseGVN {
 private:
   bool _delay_transform;  // When true simply register the node when calling transform
                           // instead of actually optimizing it
+  DEBUG_ONLY(uint _num_processed;) // Running count for trace_PhaseIterGVN_verbose
 
   // Idealize old Node 'n' with respect to its inputs and its value
   virtual Node *transform_old( Node *a_node );
 
+  // Drain the IGVN worklist: process nodes until the worklist is empty.
+  // Returns true if compilation was aborted (node limit or infinite loop),
+  // false on normal completion.
+  bool drain_worklist();
+
+  // Walk all live nodes and push deep-inspection candidates to _worklist.
+  void push_deep_revisit_candidates();
+
+  // After the main worklist drains, re-process deep-inspection nodes to
+  // catch optimization opportunities from far-away changes. Repeats until
+  // convergence (no progress made) or max rounds reached.
+  // Returns true if converged.
+  bool deep_revisit();
+
+  // Returns true for nodes that inspect the graph beyond their direct
+  // inputs, and therefore may miss optimization opportunities when
+  // changes happen far away.
+  bool needs_deep_revisit(const Node* n) const;
+
   // Subsume users of node 'old' into node 'nn'
   void subsume_node( Node *old, Node *nn );
 
@@ -493,11 +532,16 @@ public:
   // Given def-use info and an initial worklist, apply Node::Ideal,
   // Node::Value, Node::Identity, hash-based value numbering, Node::Ideal_DU
   // and dominator info to a fixed point.
-  void optimize();
+  // When deep is true, after the main worklist drains, re-process
+  // nodes that inspect the graph deeply (Load, CmpP, If, RangeCheck,
+  // CountedLoopEnd, LongCountedLoopEnd) to catch optimization opportunities
+  // from changes far away that the normal notification mechanism misses.
+  void optimize(bool deep = false);
+
 #ifdef ASSERT
-  void verify_optimize();
+  void verify_optimize(bool deep_revisit_converged);
   void verify_Value_for(const Node* n, bool strict = false);
-  void verify_Ideal_for(Node* n, bool can_reshape);
+  void verify_Ideal_for(Node* n, bool can_reshape, bool deep_revisit_converged);
   void verify_Identity_for(Node* n);
   void verify_node_invariants_for(const Node* n);
   void verify_empty_worklist(Node* n);
@@ -506,7 +550,7 @@ public:
 #ifndef PRODUCT
   void trace_PhaseIterGVN(Node* n, Node* nn, const Type* old_type);
   void init_verifyPhaseIterGVN();
-  void verify_PhaseIterGVN();
+  void verify_PhaseIterGVN(bool deep_revisit_converged);
 #endif
 
 #ifdef ASSERT
@@ -522,15 +566,21 @@ public:
   // It is significant only for debugging and profiling.
   Node* register_new_node_with_optimizer(Node* n, Node* orig = nullptr);
 
-  // Kill a globally dead Node.  All uses are also globally dead and are
+  // Origin of a dead node, describing why it is dying.
+  // Speculative: a temporarily created node that was never part of the graph
+  // (e.g., a speculative clone in split_if to test constant foldability).
+  // Its death does not count as progress for convergence tracking.
+  enum class NodeOrigin { Graph, Speculative };
+
+  // Kill a globally dead Node. All uses are also globally dead and are
   // aggressively trimmed.
-  void remove_globally_dead_node( Node *dead );
+  void remove_globally_dead_node(Node* dead, NodeOrigin origin);
 
   // Kill all inputs to a dead node, recursively making more dead nodes.
   // The Node must be dead locally, i.e., have no uses.
-  void remove_dead_node( Node *dead ) {
+  void remove_dead_node(Node* dead, NodeOrigin origin) {
     assert(dead->outcnt() == 0 && !dead->is_top(), "node must be dead");
-    remove_globally_dead_node(dead);
+    remove_globally_dead_node(dead, origin);
   }
 
   // Add users of 'n' to worklist
diff --git a/src/hotspot/share/opto/split_if.cpp b/src/hotspot/share/opto/split_if.cpp
index 91595c57a10..c1303f0d0db 100644
--- a/src/hotspot/share/opto/split_if.cpp
+++ b/src/hotspot/share/opto/split_if.cpp
@@ -85,7 +85,7 @@ bool PhaseIdealLoop::split_up( Node *n, Node *blk1, Node *blk2 ) {
     if( split_up( n->in(i), blk1, blk2 ) ) {
       // Got split recursively and self went dead?
       if (n->outcnt() == 0)
-        _igvn.remove_dead_node(n);
+        _igvn.remove_dead_node(n, PhaseIterGVN::NodeOrigin::Graph);
       return true;
     }
   }
@@ -273,7 +273,7 @@ void PhaseIdealLoop::clone_loadklass_nodes_at_cmp_index(const Node* n, Node* cmp
         _igvn.replace_input_of(decode_clone, 1, loadklass_clone);
         _igvn.replace_input_of(loadklass_clone, MemNode::Address, addp_clone);
         if (decode->outcnt() == 0) {
-          _igvn.remove_dead_node(decode);
+          _igvn.remove_dead_node(decode, PhaseIterGVN::NodeOrigin::Graph);
         }
       }
     }
@@ -290,7 +290,7 @@ void PhaseIdealLoop::clone_loadklass_nodes_at_cmp_index(const Node* n, Node* cmp
         _igvn.replace_input_of(cmp, i, loadklass_clone);
         _igvn.replace_input_of(loadklass_clone, MemNode::Address, addp_clone);
         if (loadklass->outcnt() == 0) {
-          _igvn.remove_dead_node(loadklass);
+          _igvn.remove_dead_node(loadklass, PhaseIterGVN::NodeOrigin::Graph);
         }
       }
     }
@@ -369,7 +369,7 @@ bool PhaseIdealLoop::clone_cmp_down(Node* n, const Node* blk1, const Node* blk2)
                   _igvn.replace_input_of(x2, 1, x1);
                   _igvn.replace_input_of(iff, 1, x2);
                 }
-                _igvn.remove_dead_node(u);
+                _igvn.remove_dead_node(u, PhaseIterGVN::NodeOrigin::Graph);
                 --j;
               } else {
                 // We might see an Opaque1 from a loop limit check here
@@ -385,7 +385,7 @@ bool PhaseIdealLoop::clone_cmp_down(Node* n, const Node* blk1, const Node* blk2)
                 --j;
               }
             }
-            _igvn.remove_dead_node(bol);
+            _igvn.remove_dead_node(bol, PhaseIterGVN::NodeOrigin::Graph);
             --i;
           }
         }
@@ -403,7 +403,7 @@ bool PhaseIdealLoop::clone_cmp_down(Node* n, const Node* blk1, const Node* blk2)
         register_new_node(x, ctrl_or_self(use));
         _igvn.replace_input_of(use, pos, x);
       }
-      _igvn.remove_dead_node(n);
+      _igvn.remove_dead_node(n, PhaseIterGVN::NodeOrigin::Graph);
 
       return true;
     }
@@ -517,7 +517,7 @@ Node *PhaseIdealLoop::spinup( Node *iff_dom, Node *new_false, Node *new_true, No
       Node *t = _igvn.hash_find_insert(phi_post);
       if( t ) {                 // See if we already have this one
         // phi_post will not be used, so kill it
-        _igvn.remove_dead_node(phi_post);
+        _igvn.remove_dead_node(phi_post, PhaseIterGVN::NodeOrigin::Speculative);
         phi_post->destruct(&_igvn);
         phi_post = t;
       } else {
@@ -647,7 +647,7 @@ void PhaseIdealLoop::do_split_if(Node* iff, RegionNode** new_false_region, Regio
         Node* m = n->out(j);
         // If m is dead, throw it away, and declare progress
         if (_loop_or_ctrl[m->_idx] == nullptr) {
-          _igvn.remove_dead_node(m);
+          _igvn.remove_dead_node(m, PhaseIterGVN::NodeOrigin::Graph);
           // fall through
         }
         else if (m != iff && split_up(m, region, iff)) {
@@ -704,7 +704,7 @@ void PhaseIdealLoop::do_split_if(Node* iff, RegionNode** new_false_region, Regio
       new_true = ifpx;
     }
   }
-  _igvn.remove_dead_node(new_iff);
+  _igvn.remove_dead_node(new_iff, PhaseIterGVN::NodeOrigin::Speculative);
   // Lazy replace IDOM info with the region's dominator
   replace_node_and_forward_ctrl(iff, region_dom);
   // Break the self-cycle. Required for forward_ctrl to work on region.
@@ -720,7 +720,7 @@ void PhaseIdealLoop::do_split_if(Node* iff, RegionNode** new_false_region, Regio
   for (DUIterator k = region->outs(); region->has_out(k); k++) {
     Node* phi = region->out(k);
     if (!phi->in(0)) {         // Dead phi?  Remove it
-      _igvn.remove_dead_node(phi);
+      _igvn.remove_dead_node(phi, PhaseIterGVN::NodeOrigin::Graph);
     } else if (phi == region) { // Found the self-reference
       continue;                 // No roll-back of DUIterator
     } else if (phi->is_Phi()) { // Expected common case: Phi hanging off of Region
@@ -739,7 +739,7 @@ void PhaseIdealLoop::do_split_if(Node* iff, RegionNode** new_false_region, Regio
         handle_use(use, phi, &phi_cache, region_dom, new_false, new_true, old_false, old_true);
       } // End of while phi has uses
       // Remove the dead Phi
-      _igvn.remove_dead_node( phi );
+      _igvn.remove_dead_node(phi, PhaseIterGVN::NodeOrigin::Graph);
     } else {
       assert(phi->in(0) == region, "Inconsistent graph");
       // Random memory op guarded by Region.  Compute new DEF for USE.
@@ -752,7 +752,7 @@ void PhaseIdealLoop::do_split_if(Node* iff, RegionNode** new_false_region, Regio
     --k;
   } // End of while merge point has phis
 
-  _igvn.remove_dead_node(region);
+  _igvn.remove_dead_node(region, PhaseIterGVN::NodeOrigin::Graph);
 
   // Control is updated here to a region, which is not a test, so any node that
   // depends_only_on_test must be pinned
diff --git a/test/hotspot/jtreg/compiler/arraycopy/TestCloneAccess.java b/test/hotspot/jtreg/compiler/arraycopy/TestCloneAccess.java
index a0da0741cad..22bf1f88ae7 100644
--- a/test/hotspot/jtreg/compiler/arraycopy/TestCloneAccess.java
+++ b/test/hotspot/jtreg/compiler/arraycopy/TestCloneAccess.java
@@ -23,16 +23,18 @@
 
 /*
  * @test
- * @bug 8248791
+ * @bug 8248791 8375442
  * @summary Test cloning with more than 8 (=ArrayCopyLoadStoreMaxElem) where loads are wrongly replaced by zero.
  * @requires vm.compiler2.enabled | vm.graal.enabled
  *
  * @run main/othervm -XX:-ReduceBulkZeroing
- *                   -XX:CompileCommand=dontinline,compiler.arraycopy.TestCloneAccess::*
- *                   compiler.arraycopy.TestCloneAccess
+ *                   -XX:CompileCommand=dontinline,${test.main.class}::*
+ *                   ${test.main.class}
  * @run main/othervm -XX:-ReduceBulkZeroing -XX:-ReduceInitialCardMarks
- *                   -XX:CompileCommand=dontinline,compiler.arraycopy.TestCloneAccess::*
- *                   compiler.arraycopy.TestCloneAccess
+ *                   -XX:CompileCommand=dontinline,${test.main.class}::*
+ *                   ${test.main.class}
+ * @run main/othervm -XX:-ReduceBulkZeroing -XX:+IgnoreUnrecognizedVMOptions -XX:VerifyIterativeGVN=1110
+ *                   ${test.main.class}
  */
 package compiler.arraycopy;
 
diff --git a/test/hotspot/jtreg/compiler/c2/igvn/TestDeepIGVNRevisit.java b/test/hotspot/jtreg/compiler/c2/igvn/TestDeepIGVNRevisit.java
new file mode 100644
index 00000000000..228357f953d
--- /dev/null
+++ b/test/hotspot/jtreg/compiler/c2/igvn/TestDeepIGVNRevisit.java
@@ -0,0 +1,83 @@
+/*
+ * Copyright Amazon.com Inc. or its affiliates. All Rights Reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+package compiler.c2.igvn;
+
+import compiler.lib.ir_framework.*;
+
+/*
+ * @test
+ * @bug 8375442
+ * @summary Test deep IGVN revisit for RangeCheck elimination. Other deep-revisit node types
+ *          (If, Load, CmpP, CountedLoopEnd, LongCountedLoopEnd) benefit in large methods
+ *          but require graph complexity beyond this test.
+ * @library /test/lib /
+ * @run driver ${test.main.class}
+ */
+public class TestDeepIGVNRevisit {
+    static boolean c1, c2, c3, c4;
+    static volatile int volatileField;
+
+    public static void main(String[] args) {
+        TestFramework tf = new TestFramework();
+        tf.setDefaultWarmup(0);
+        tf.addFlags("-XX:+IgnoreUnrecognizedVMOptions",
+                    "-XX:+AlwaysIncrementalInline",
+                    "-XX:-PartialPeelLoop",
+                    "-XX:-LoopUnswitching");
+        tf.addScenarios(
+            new Scenario(1, "-XX:-StressIGVN", "-XX:+UseDeepIGVNRevisit"),
+            new Scenario(2, "-XX:+StressIGVN", "-XX:+UseDeepIGVNRevisit"),
+            new Scenario(3, "-XX:-StressIGVN", "-XX:-UseDeepIGVNRevisit"),
+            new Scenario(4, "-XX:+StressIGVN", "-XX:-UseDeepIGVNRevisit"));
+        tf.start();
+    }
+
+    static void lateInline() {}
+
+    // Deferred calls create separate LoadRange nodes for the two arr[idx]
+    // accesses. After inlining, LoadRanges CSE but RangeCheck#2 is already
+    // processed. Deep revisit re-processes it with matching range pointers.
+    @Setup
+    static Object[] setupRangeCheck() {
+        return new Object[] { new int[100], 42 };
+    }
+
+    @Test
+    @Arguments(setup = "setupRangeCheck")
+    @IR(phase = CompilePhase.ITER_GVN2,
+        applyIf = {"UseDeepIGVNRevisit", "true"},
+        counts = {IRNode.RANGE_CHECK, "1"})
+    @IR(phase = CompilePhase.ITER_GVN2,
+        applyIf = {"UseDeepIGVNRevisit", "false"},
+        counts = {IRNode.RANGE_CHECK, "2"})
+    static int testRangeCheck(int[] arr, int idx) {
+        int r = arr[idx];              // RangeCheck #1
+        if (c1) { lateInline(); }
+        if (c2) { lateInline(); }
+        if (c3) { lateInline(); }
+        if (c4) { lateInline(); }
+        volatileField = r;
+        r += arr[idx];                 // RangeCheck #2
+        return r;
+    }
+}
diff --git a/test/hotspot/jtreg/compiler/igvn/TestFoldComparesCleanup.java b/test/hotspot/jtreg/compiler/igvn/TestFoldComparesCleanup.java
new file mode 100644
index 00000000000..bcc3b9541ba
--- /dev/null
+++ b/test/hotspot/jtreg/compiler/igvn/TestFoldComparesCleanup.java
@@ -0,0 +1,56 @@
+/*
+ * Copyright Amazon.com Inc. or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+/**
+ * @test
+ * @bug 8375442
+ * @summary fold_compares_helper must clean up speculative lo node when bailing out with deep revisit
+ * @library /test/lib /
+ * @run main/othervm -XX:-TieredCompilation -Xbatch -XX:+IgnoreUnrecognizedVMOptions -XX:VerifyIterativeGVN=1110
+ *                   -XX:CompileCommand=compileonly,${test.main.class}::test
+ *                   ${test.main.class}
+ *
+ * @run main ${test.main.class}
+ */
+package compiler.igvn;
+
+import jdk.test.lib.Asserts;
+
+public class TestFoldComparesCleanup {
+    // Constants chosen so that fold_compares_helper computes adjusted_lim which overflows negative.
+    static final int A = -2_000_000_000;
+    static final int B =  2_000_000_000;
+
+    static int test(int z) {
+        int sum = 0;
+        if (z > A) sum += 1;
+        if (z < B) sum += 2;
+        return sum;
+    }
+
+    public static void main(String[] args) {
+        for (int i = 0; i < 50_000; i++) {
+            Asserts.assertEquals(3, test(i));
+        }
+    }
+}
diff --git a/test/hotspot/jtreg/compiler/lib/ir_framework/IRNode.java b/test/hotspot/jtreg/compiler/lib/ir_framework/IRNode.java
index 0753a0b04bc..0e1accf8a50 100644
--- a/test/hotspot/jtreg/compiler/lib/ir_framework/IRNode.java
+++ b/test/hotspot/jtreg/compiler/lib/ir_framework/IRNode.java
@@ -1776,6 +1776,11 @@ public class IRNode {
         trapNodes(PREDICATE_TRAP, "predicate");
     }
 
+    public static final String RANGE_CHECK = PREFIX + "RANGE_CHECK" + POSTFIX;
+    static {
+        beforeMatchingNameRegex(RANGE_CHECK, "RangeCheck");
+    }
+
     public static final String RANGE_CHECK_TRAP = PREFIX + "RANGE_CHECK_TRAP" + POSTFIX;
     static {
         trapNodes(RANGE_CHECK_TRAP, "range_check");

From c76381996a9f2c90213ed8d5f84526c82fe07a67 Mon Sep 17 00:00:00 2001
From: Alexey Semenyuk <asemenyuk@openjdk.org>
Date: Wed, 1 Apr 2026 00:29:44 +0000
Subject: [PATCH 446/655] 8381384: jpackage: add test coverage to WiX discovery

Reviewed-by: almatvee
---
 .../internal/EnvironmentProvider.java         |  45 ++
 .../jdk/jpackage/internal/Globals.java        |   8 +
 .../jdk/jpackage/internal/util/PathUtils.java |  33 +-
 .../jdk/jpackage/internal/WixTool.java        | 284 +++----
 .../jdk/jpackage/internal/WixToolset.java     |  29 +-
 .../resources/WinResources.properties         |   5 +-
 .../test/mock/MockingToolProvider.java        |   2 +-
 .../test/stdmock/EnvironmentProviderMock.java |  64 ++
 .../jpackage/test/stdmock/WixToolMock.java    | 173 ++++
 .../jpackage/internal/util/PathUtilsTest.java | 213 +++++
 .../jdk/jpackage/internal/WixToolTest.java    | 754 ++++++++++++++++++
 .../tools/jpackage/junit/windows/junit.java   |  12 +
 12 files changed, 1459 insertions(+), 163 deletions(-)
 create mode 100644 src/jdk.jpackage/share/classes/jdk/jpackage/internal/EnvironmentProvider.java
 create mode 100644 test/jdk/tools/jpackage/helpers/jdk/jpackage/test/stdmock/EnvironmentProviderMock.java
 create mode 100644 test/jdk/tools/jpackage/helpers/jdk/jpackage/test/stdmock/WixToolMock.java
 create mode 100644 test/jdk/tools/jpackage/junit/share/jdk.jpackage/jdk/jpackage/internal/util/PathUtilsTest.java
 create mode 100644 test/jdk/tools/jpackage/junit/windows/jdk.jpackage/jdk/jpackage/internal/WixToolTest.java

diff --git a/src/jdk.jpackage/share/classes/jdk/jpackage/internal/EnvironmentProvider.java b/src/jdk.jpackage/share/classes/jdk/jpackage/internal/EnvironmentProvider.java
new file mode 100644
index 00000000000..de364129256
--- /dev/null
+++ b/src/jdk.jpackage/share/classes/jdk/jpackage/internal/EnvironmentProvider.java
@@ -0,0 +1,45 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.  Oracle designates this
+ * particular file as subject to the "Classpath" exception as provided
+ * by Oracle in the LICENSE file that accompanied this code.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+package jdk.jpackage.internal;
+
+public interface EnvironmentProvider {
+
+    String getProperty(String propertyName);
+
+    String getenv(String envVarName);
+
+    public static EnvironmentProvider DEFAULT = new EnvironmentProvider() {
+
+        @Override
+        public String getenv(String envVarName) {
+            return System.getenv(envVarName);
+        }
+
+        @Override
+        public String getProperty(String propertyName) {
+            return System.getProperty(propertyName);
+        }
+    };
+}
diff --git a/src/jdk.jpackage/share/classes/jdk/jpackage/internal/Globals.java b/src/jdk.jpackage/share/classes/jdk/jpackage/internal/Globals.java
index 0128d050c25..2fc0046fad5 100644
--- a/src/jdk.jpackage/share/classes/jdk/jpackage/internal/Globals.java
+++ b/src/jdk.jpackage/share/classes/jdk/jpackage/internal/Globals.java
@@ -65,6 +65,14 @@ public final class Globals {
         return this;
     }
 
+    public EnvironmentProvider system() {
+        return this.<EnvironmentProvider>findProperty(EnvironmentProvider.class).orElse(EnvironmentProvider.DEFAULT);
+    }
+
+    public Globals system(EnvironmentProvider v) {
+        return setProperty(EnvironmentProvider.class, v);
+    }
+
     Log.Logger logger() {
         return logger;
     }
diff --git a/src/jdk.jpackage/share/classes/jdk/jpackage/internal/util/PathUtils.java b/src/jdk.jpackage/share/classes/jdk/jpackage/internal/util/PathUtils.java
index a8944a67ae0..707dd2784ce 100644
--- a/src/jdk.jpackage/share/classes/jdk/jpackage/internal/util/PathUtils.java
+++ b/src/jdk.jpackage/share/classes/jdk/jpackage/internal/util/PathUtils.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2024, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2024, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -24,6 +24,7 @@
  */
 package jdk.jpackage.internal.util;
 
+import java.nio.file.InvalidPathException;
 import java.nio.file.Path;
 import java.util.Objects;
 import java.util.Optional;
@@ -31,18 +32,26 @@ import java.util.function.UnaryOperator;
 
 public final class PathUtils {
 
+    private PathUtils() {
+    }
+
     public static String getSuffix(Path path) {
         String filename = replaceSuffix(path.getFileName(), null).toString();
         return path.getFileName().toString().substring(filename.length());
     }
 
     public static Path addSuffix(Path path, String suffix) {
+        Objects.requireNonNull(path);
+        Objects.requireNonNull(suffix);
+
         Path parent = path.getParent();
         String filename = path.getFileName().toString() + suffix;
         return parent != null ? parent.resolve(filename) : Path.of(filename);
     }
 
     public static Path replaceSuffix(Path path, String suffix) {
+        Objects.requireNonNull(path);
+
         Path parent = path.getParent();
         String filename = path.getFileName().toString().replaceAll("\\.[^.]*$",
                 "") + Optional.ofNullable(suffix).orElse("");
@@ -59,18 +68,22 @@ public final class PathUtils {
     }
 
     public static Path normalizedAbsolutePath(Path path) {
-        if (path != null) {
+        return mapNullablePath(_ -> {
             return path.normalize().toAbsolutePath();
-        } else {
-            return null;
-        }
+        }, path);
     }
 
     public static String normalizedAbsolutePathString(Path path) {
-        if (path != null) {
-            return normalizedAbsolutePath(path).toString();
-        } else {
-            return null;
-        }
+        return Optional.ofNullable(normalizedAbsolutePath(path)).map(Path::toString).orElse(null);
+    }
+
+    public static Optional<Path> asPath(String value) {
+        return Optional.ofNullable(value).map(v -> {
+            try {
+                return Path.of(v);
+            } catch (InvalidPathException ex) {
+                return null;
+            }
+        });
     }
 }
diff --git a/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/WixTool.java b/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/WixTool.java
index c4f8610312a..d0c5e6ca3b0 100644
--- a/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/WixTool.java
+++ b/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/WixTool.java
@@ -23,14 +23,14 @@
  * questions.
  */
 package jdk.jpackage.internal;
+import static java.util.stream.Collectors.groupingBy;
+import static java.util.stream.Collectors.toMap;
+import static java.util.stream.Collectors.toSet;
 
 import java.io.IOException;
 import java.nio.file.FileSystems;
 import java.nio.file.Files;
-import java.nio.file.InvalidPathException;
 import java.nio.file.Path;
-import java.nio.file.PathMatcher;
-import java.text.MessageFormat;
 import java.util.Comparator;
 import java.util.List;
 import java.util.Map;
@@ -38,12 +38,13 @@ import java.util.Objects;
 import java.util.Optional;
 import java.util.Set;
 import java.util.function.Function;
-import java.util.stream.Collectors;
+import java.util.function.Supplier;
 import java.util.stream.Stream;
 import jdk.jpackage.internal.WixToolset.WixToolsetType;
 import jdk.jpackage.internal.model.ConfigException;
 import jdk.jpackage.internal.model.DottedVersion;
 import jdk.jpackage.internal.util.PathUtils;
+import jdk.jpackage.internal.util.Slot;
 
 /**
  * WiX tool.
@@ -58,16 +59,20 @@ public enum WixTool {
         this.minimalVersion = minimalVersion;
     }
 
-    interface ToolInfo {
+    Path fileName() {
+        return toolFileName;
+    }
+
+    sealed interface ToolInfo {
         Path path();
         DottedVersion version();
     }
 
-    interface CandleInfo extends ToolInfo {
+    sealed interface CandleInfo extends ToolInfo {
         boolean fips();
     }
 
-    private record DefaultToolInfo(Path path, DottedVersion version) implements ToolInfo {
+    record DefaultToolInfo(Path path, DottedVersion version) implements ToolInfo {
         DefaultToolInfo {
             Objects.requireNonNull(path);
             Objects.requireNonNull(version);
@@ -76,9 +81,14 @@ public enum WixTool {
         DefaultToolInfo(Path path, String version) {
             this(path, DottedVersion.lazy(version));
         }
+
+        @Override
+        public String toString() {
+            return String.format("%s|ver=%s", path, version);
+        }
     }
 
-    private record DefaultCandleInfo(Path path, DottedVersion version, boolean fips) implements CandleInfo {
+    record DefaultCandleInfo(Path path, DottedVersion version, boolean fips) implements CandleInfo {
         DefaultCandleInfo {
             Objects.requireNonNull(path);
             Objects.requireNonNull(version);
@@ -87,25 +97,42 @@ public enum WixTool {
         DefaultCandleInfo(ToolInfo info, boolean fips) {
             this(info.path(), info.version(), fips);
         }
+
+        @Override
+        public String toString() {
+            var sb = new StringBuffer();
+            sb.append(path);
+            if (fips) {
+                sb.append("|fips");
+            }
+            sb.append("|ver=").append(version);
+            return sb.toString();
+        }
     }
 
     static WixToolset createToolset() {
+        return createToolset(WixTool::findWixInstallDirs, true);
+    }
+
+    static WixToolset createToolset(Supplier<List<Path>> wixInstallDirs, boolean searchInPath) {
+
         Function<List<ToolLookupResult>, Map<WixTool, ToolInfo>> conv = lookupResults -> {
-            return lookupResults.stream().filter(ToolLookupResult::isValid).collect(Collectors.
-                    groupingBy(lookupResult -> {
+            return lookupResults.stream().filter(ToolLookupResult::isValid).collect(groupingBy(lookupResult -> {
                 return lookupResult.info().version().toString();
             })).values().stream().filter(sameVersionLookupResults -> {
-                Set<WixTool> sameVersionTools = sameVersionLookupResults.stream().map(
-                        ToolLookupResult::tool).collect(Collectors.toSet());
-                if (sameVersionTools.equals(Set.of(Candle3)) || sameVersionTools.equals(Set.of(
-                        Light3))) {
+                var sameVersionTools = sameVersionLookupResults.stream()
+                        .map(ToolLookupResult::tool)
+                        .collect(toSet());
+                if (sameVersionTools.equals(Set.of(Candle3)) || sameVersionTools.equals(Set.of(Light3))) {
                     // There is only one tool from WiX v3 toolset of some version available. Discard it.
                     return false;
                 } else {
                     return true;
                 }
-            }).flatMap(List::stream).collect(Collectors.toMap(ToolLookupResult::tool,
-                    ToolLookupResult::info, (ToolInfo x, ToolInfo y) -> {
+            }).flatMap(List::stream).collect(toMap(
+                    ToolLookupResult::tool,
+                    ToolLookupResult::info,
+                    (ToolInfo x, ToolInfo y) -> {
                         return Stream.of(x, y).sorted(Comparator.comparing((ToolInfo toolInfo) -> {
                             return toolInfo.version().toComponentsString();
                         }).reversed()).findFirst().get();
@@ -115,58 +142,53 @@ public enum WixTool {
         Function<List<ToolLookupResult>, Optional<WixToolset>> createToolset = lookupResults -> {
             var tools = conv.apply(lookupResults);
             // Try to build a toolset found in the PATH and in known locations.
-            return Stream.of(WixToolsetType.values()).map(toolsetType -> {
-                return WixToolset.create(toolsetType.getTools(), tools);
-            }).filter(Objects::nonNull).findFirst();
+            return Stream.of(WixToolsetType.values()).flatMap(toolsetType -> {
+                return WixToolset.create(toolsetType, tools).stream();
+            }).findFirst();
         };
 
-        var toolsInPath = Stream.of(values()).map(tool -> {
-            return ToolLookupResult.lookup(tool, Optional.empty());
-        }).filter(Optional::isPresent).map(Optional::get).toList();
+        final List<ToolLookupResult> toolsInPath;
+        if (searchInPath) {
+            toolsInPath = Stream.of(values()).flatMap(tool -> {
+                return ToolLookupResult.lookup(tool, Optional.empty()).stream();
+            }).toList();
+        } else {
+            toolsInPath = List.of();
+        }
 
         // Try to build a toolset from tools in the PATH first.
-        var toolset = createToolset.apply(toolsInPath);
-        if (toolset.isPresent()) {
-            return toolset.get();
-        }
+        var toolset = createToolset.apply(toolsInPath).orElseGet(() -> {
+            // Look up for WiX tools in known locations.
+            var toolsInKnownWiXDirs = wixInstallDirs.get().stream().flatMap(dir -> {
+                return Stream.of(values()).flatMap(tool -> {
+                    return ToolLookupResult.lookup(tool, Optional.of(dir)).stream();
+                });
+            }).toList();
 
-        // Look up for WiX tools in known locations.
-        var toolsInKnownWiXDirs = findWixInstallDirs().stream().map(dir -> {
-            return Stream.of(values()).map(tool -> {
-                return ToolLookupResult.lookup(tool, Optional.of(dir));
+            // Build a toolset found in the PATH and in known locations.
+            var allValidFoundTools = Stream.of(toolsInPath, toolsInKnownWiXDirs)
+                    .flatMap(List::stream)
+                    .filter(ToolLookupResult::isValid)
+                    .toList();
+
+            return createToolset.apply(allValidFoundTools).orElseThrow(() -> {
+                return new ConfigException(
+                        I18N.getString("error.no-wix-tools"),
+                        I18N.getString("error.no-wix-tools.advice"));
             });
-        }).flatMap(Function.identity()).filter(Optional::isPresent).map(Optional::get).toList();
+        });
 
-        // Build a toolset found in the PATH and in known locations.
-        var allFoundTools = Stream.of(toolsInPath, toolsInKnownWiXDirs).flatMap(List::stream).filter(
-                ToolLookupResult::isValid).toList();
-        toolset = createToolset.apply(allFoundTools);
-        if (toolset.isPresent()) {
-            return toolset.get();
-        } else if (allFoundTools.isEmpty()) {
-            throw new ConfigException(I18N.getString("error.no-wix-tools"), I18N.getString(
-                    "error.no-wix-tools.advice"));
-        } else {
-            var toolOldVerErr = allFoundTools.stream().map(lookupResult -> {
-                if (lookupResult.versionTooOld) {
-                    return new ConfigException(MessageFormat.format(I18N.getString(
-                            "message.wrong-tool-version"), lookupResult.info().path(),
-                            lookupResult.info().version(), lookupResult.tool().minimalVersion),
-                            I18N.getString("error.no-wix-tools.advice"));
-                } else {
-                    return null;
-                }
-            }).filter(Objects::nonNull).findAny();
-            if (toolOldVerErr.isPresent()) {
-                throw toolOldVerErr.get();
-            } else {
-                throw new ConfigException(I18N.getString("error.no-wix-tools"), I18N.getString(
-                        "error.no-wix-tools.advice"));
-            }
-        }
+        return toolset;
     }
 
-    private record ToolLookupResult(WixTool tool, ToolInfo info, boolean versionTooOld) {
+    static List<Path> findWixInstallDirs() {
+        return Stream.of(
+                findWixCurrentInstallDirs(),
+                findWix3InstallDirs()
+        ).flatMap(List::stream).toList();
+    }
+
+    private record ToolLookupResult(WixTool tool, ToolInfo info) {
 
         ToolLookupResult {
             Objects.requireNonNull(tool);
@@ -177,58 +199,59 @@ public enum WixTool {
             Objects.requireNonNull(tool);
             Objects.requireNonNull(lookupDir);
 
-            final Path toolPath = lookupDir.map(p -> p.resolve(
-                    tool.toolFileName)).orElse(tool.toolFileName);
+            final Path toolPath = lookupDir.map(p -> {
+                return p.resolve(tool.toolFileName);
+            }).orElse(tool.toolFileName);
 
-            final boolean[] tooOld = new boolean[1];
-            final String[] parsedVersion = new String[1];
+            final var validator = new ToolValidator(toolPath).setMinimalVersion(tool.minimalVersion);
 
-            final var validator = new ToolValidator(toolPath)
-                    .setMinimalVersion(tool.minimalVersion)
-                    .setToolOldVersionErrorHandler((name, version) -> {
-                        tooOld[0] = true;
-                        return null;
-                    });
-
-            final Function<Stream<String>, String> versionParser;
-
-            if (Set.of(Candle3, Light3).contains(tool)) {
-                final String printVersionArg;
-                if (tool == Candle3) {
+            final var printVersionArg = switch (tool) {
+                case Candle3 -> {
                     // Add '-fips' to make "candle.exe" print help message and return
                     // 0 exit code instead of returning error exit code and printing
                     // "error CNDL0308 : The Federal Information Processing Standard (FIPS) appears to be enabled on the machine..."
                     // error message if FIPS is enabled.
                     // If FIPS is disabled, passing '-fips' parameter still makes
                     // "candle.exe" print help message and return 0 exit code.
-                    printVersionArg = "-fips";
-                } else {
-                    printVersionArg = "-?";
+                    yield "-fips";
                 }
-                validator.setCommandLine(printVersionArg);
-                versionParser = output -> {
-                    String firstLineOfOutput = output.findFirst().orElse("");
-                    int separatorIdx = firstLineOfOutput.lastIndexOf(' ');
-                    if (separatorIdx == -1) {
-                        return null;
-                    }
-                    return firstLineOfOutput.substring(separatorIdx + 1);
-                };
-            } else {
-                validator.setCommandLine("--version");
-                versionParser = output -> {
-                    return output.findFirst().orElse("");
-                };
-            }
+                case Light3 -> {
+                    yield "-?";
+                }
+                default -> {
+                    yield "--version";
+                }
+            };
+            validator.setCommandLine(printVersionArg);
 
+            final Function<Stream<String>, Optional<String>> versionParser = switch (tool) {
+                case Candle3, Light3 -> {
+                    yield output -> {
+                        return output.findFirst().map(firstLineOfOutput -> {
+                            int separatorIdx = firstLineOfOutput.lastIndexOf(' ');
+                            if (separatorIdx == -1) {
+                                return null;
+                            }
+                            return firstLineOfOutput.substring(separatorIdx + 1);
+                        });
+                    };
+                }
+                default -> {
+                    yield output -> {
+                        return output.findFirst();
+                    };
+                }
+            };
+
+            final var parsedVersion = Slot.<String>createEmpty();
             validator.setVersionParser(output -> {
-                parsedVersion[0] = versionParser.apply(output);
-                return parsedVersion[0];
+                versionParser.apply(output).ifPresent(parsedVersion::set);
+                return parsedVersion.find().orElse(null);
             });
 
             if (validator.validate() == null) {
                 // Tool found
-                ToolInfo info = new DefaultToolInfo(toolPath, parsedVersion[0]);
+                ToolInfo info = new DefaultToolInfo(toolPath, parsedVersion.get());
                 if (tool == Candle3) {
                     // Detect FIPS mode
                     var fips = false;
@@ -242,63 +265,52 @@ public enum WixTool {
                             }
                         }
                     } catch (IOException ex) {
-                        Log.verbose(ex);
                     }
                     info = new DefaultCandleInfo(info, fips);
                 }
-                return Optional.of(new ToolLookupResult(tool, info, tooOld[0]));
+
+                return Optional.of(new ToolLookupResult(tool, info));
             } else {
                 return Optional.empty();
             }
         }
 
+        boolean versionTooOld() {
+            return DottedVersion.compareComponents(info.version(), tool.minimalVersion) < 0;
+        }
+
         boolean isValid() {
-            return !versionTooOld;
+            return !versionTooOld();
         }
     }
 
-    private static Path getSystemDir(String envVar, String knownDir) {
-        return Optional
-                .ofNullable(getEnvVariableAsPath(envVar))
-                .orElseGet(() -> Optional
-                .ofNullable(getEnvVariableAsPath("SystemDrive"))
-                .orElseGet(() -> Path.of("C:")).resolve(knownDir));
+    private static Path getSystemDir(String envVar, Path knownDir) {
+        return getEnvVariableAsPath(envVar).orElseGet(() -> {
+            return getEnvVariableAsPath("SystemDrive").orElseGet(() -> {
+                return Path.of("C:");
+            }).resolve(knownDir);
+        });
     }
 
-    private static Path getEnvVariableAsPath(String envVar) {
-        String path = System.getenv(envVar);
-        if (path != null) {
-            try {
-                return Path.of(path);
-            } catch (InvalidPathException ex) {
-                Log.error(MessageFormat.format(I18N.getString(
-                        "error.invalid-envvar"), envVar));
-            }
-        }
-        return null;
-    }
-
-    private static List<Path> findWixInstallDirs() {
-        return Stream.of(findWixCurrentInstallDirs(), findWix3InstallDirs()).
-                flatMap(List::stream).toList();
+    private static Optional<Path> getEnvVariableAsPath(String envVar) {
+        Objects.requireNonNull(envVar);
+        return Optional.ofNullable(Globals.instance().system().getenv(envVar)).flatMap(PathUtils::asPath);
     }
 
     private static List<Path> findWixCurrentInstallDirs() {
-        return Stream.of(getEnvVariableAsPath("USERPROFILE"), Optional.ofNullable(System.
-                getProperty("user.home")).map(Path::of).orElse(null)).filter(Objects::nonNull).map(
-                path -> {
-                    return path.resolve(".dotnet/tools");
-                }).filter(Files::isDirectory).distinct().toList();
+        return Stream.of(
+                getEnvVariableAsPath("USERPROFILE"),
+                Optional.ofNullable(Globals.instance().system().getProperty("user.home")).flatMap(PathUtils::asPath)
+        ).flatMap(Optional::stream).map(path -> {
+            return path.resolve(".dotnet/tools");
+        }).filter(Files::isDirectory).distinct().toList();
     }
 
     private static List<Path> findWix3InstallDirs() {
-        PathMatcher wixInstallDirMatcher = FileSystems.getDefault().
-                getPathMatcher(
-                        "glob:WiX Toolset v*");
+        var wixInstallDirMatcher = FileSystems.getDefault().getPathMatcher("glob:WiX Toolset v*");
 
-        Path programFiles = getSystemDir("ProgramFiles", "\\Program Files");
-        Path programFilesX86 = getSystemDir("ProgramFiles(x86)",
-                "\\Program Files (x86)");
+        var programFiles = getSystemDir("ProgramFiles", Path.of("Program Files"));
+        var programFilesX86 = getSystemDir("ProgramFiles(x86)", Path.of("Program Files (x86)"));
 
         // Returns list of WiX install directories ordered by WiX version number.
         // Newer versions go first.
@@ -306,13 +318,11 @@ public enum WixTool {
             try (var paths = Files.walk(path, 1)) {
                 return paths.toList();
             } catch (IOException ex) {
-                Log.verbose(ex);
-                List<Path> empty = List.of();
-                return empty;
+                return List.<Path>of();
             }
         }).flatMap(List::stream)
-                .filter(path -> wixInstallDirMatcher.matches(path.getFileName())).
-                sorted(Comparator.comparing(Path::getFileName).reversed())
+                .filter(path -> wixInstallDirMatcher.matches(path.getFileName()))
+                .sorted(Comparator.comparing(Path::getFileName).reversed())
                 .map(path -> path.resolve("bin"))
                 .toList();
     }
diff --git a/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/WixToolset.java b/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/WixToolset.java
index e7bdbede368..1694503a8c8 100644
--- a/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/WixToolset.java
+++ b/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/WixToolset.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2024, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2024, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -26,14 +26,20 @@ package jdk.jpackage.internal;
 
 import java.nio.file.Path;
 import java.util.Map;
+import java.util.Objects;
+import java.util.Optional;
 import java.util.Set;
 import java.util.stream.Collectors;
 import java.util.stream.Stream;
 import jdk.jpackage.internal.model.DottedVersion;
 
-final class WixToolset {
+record WixToolset(Map<WixTool, WixTool.ToolInfo> tools) {
 
-    static enum WixToolsetType {
+    WixToolset {
+        tools = Map.copyOf(tools);
+    }
+
+    enum WixToolsetType {
         // Wix v4+
         Wix4(WixTool.Wix4),
         // Wix v3+
@@ -50,10 +56,6 @@ final class WixToolset {
         private final Set<WixTool> tools;
     }
 
-    private WixToolset(Map<WixTool, WixTool.ToolInfo> tools) {
-        this.tools = tools;
-    }
-
     WixToolsetType getType() {
         return Stream.of(WixToolsetType.values()).filter(toolsetType -> {
             return toolsetType.getTools().equals(tools.keySet());
@@ -75,16 +77,19 @@ final class WixToolset {
                 .anyMatch(WixTool.CandleInfo::fips);
     }
 
-    static WixToolset create(Set<WixTool> requiredTools, Map<WixTool, WixTool.ToolInfo> allTools) {
+    static Optional<WixToolset> create(WixToolsetType type, Map<WixTool, WixTool.ToolInfo> allTools) {
+        Objects.requireNonNull(type);
+        Objects.requireNonNull(allTools);
+
+        var requiredTools = type.getTools();
+
         var filteredTools = allTools.entrySet().stream().filter(e -> {
             return requiredTools.contains(e.getKey());
         }).collect(Collectors.toMap(Map.Entry::getKey, Map.Entry::getValue));
         if (filteredTools.keySet().equals(requiredTools)) {
-            return new WixToolset(filteredTools);
+            return Optional.of(new WixToolset(filteredTools));
         } else {
-            return null;
+            return Optional.empty();
         }
     }
-
-    private final Map<WixTool, WixTool.ToolInfo> tools;
 }
diff --git a/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/resources/WinResources.properties b/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/resources/WinResources.properties
index 0f3dcab8260..a11a8a6b41e 100644
--- a/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/resources/WinResources.properties
+++ b/src/jdk.jpackage/windows/classes/jdk/jpackage/internal/resources/WinResources.properties
@@ -36,8 +36,8 @@ resource.launcher-as-service-wix-file=Service installer WiX project file
 resource.wix-src-conv=XSLT stylesheet converting WiX sources from WiX v3 to WiX v4 format
 resource.installer-exe=installer executable
 
-error.no-wix-tools=Can not find WiX tools. Was looking for WiX v3 light.exe and candle.exe or WiX v4/v5 wix.exe and none was found
-error.no-wix-tools.advice=Download WiX 3.0 or later from https://wixtoolset.org and add it to the PATH.
+error.no-wix-tools=No usable WiX Toolset installation found
+error.no-wix-tools.advice=Install the latest WiX v3 from https://github.com/wixtoolset/wix3/releases or WiX v4+ from https://github.com/wixtoolset/wix/releases
 error.version-string-wrong-format.advice=Set value of --app-version parameter to a valid Windows Installer ProductVersion.
 error.msi-product-version-components=Version string [{0}] must have between 2 and 4 components.
 error.msi-product-version-major-out-of-range=Major version must be in the range [0, 255]
@@ -56,7 +56,6 @@ error.missing-service-installer.advice=Add 'service-installer.exe' service insta
 
 message.icon-not-ico=The specified icon "{0}" is not an ICO file and will not be used. The default icon will be used in it's place.
 message.tool-version=Detected [{0}] version [{1}].
-message.wrong-tool-version=Detected [{0}] version {1} but version {2} is required.
 message.product-code=MSI ProductCode: {0}.
 message.upgrade-code=MSI UpgradeCode: {0}.
 message.preparing-msi-config=Preparing MSI config: {0}.
diff --git a/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/mock/MockingToolProvider.java b/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/mock/MockingToolProvider.java
index f8c04cc3927..2c46d02e7ce 100644
--- a/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/mock/MockingToolProvider.java
+++ b/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/mock/MockingToolProvider.java
@@ -160,5 +160,5 @@ abstract sealed class MockingToolProvider implements ToolProviderCommandMock {
     private final String name;
     private final Iterator<CommandAction> actionIter;
 
-    static ToolProviderCommandMock UNREACHABLE = new MockingToolProvider.NonCompletable("<unreachable>", List.of());
+    static final ToolProviderCommandMock UNREACHABLE = new MockingToolProvider.NonCompletable("<unreachable>", List.of());
 }
diff --git a/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/stdmock/EnvironmentProviderMock.java b/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/stdmock/EnvironmentProviderMock.java
new file mode 100644
index 00000000000..1e12078ec66
--- /dev/null
+++ b/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/stdmock/EnvironmentProviderMock.java
@@ -0,0 +1,64 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+package jdk.jpackage.test.stdmock;
+
+import jdk.jpackage.internal.EnvironmentProvider;
+import java.util.ArrayList;
+import java.util.Map;
+import java.util.Objects;
+
+public record EnvironmentProviderMock(
+        Map<String, String> envVariables,
+        Map<String, String> systemProperties) implements EnvironmentProvider {
+
+    public EnvironmentProviderMock {
+        envVariables.keySet().forEach(Objects::requireNonNull);
+        envVariables.values().forEach(Objects::requireNonNull);
+
+        systemProperties.keySet().forEach(Objects::requireNonNull);
+        systemProperties.values().forEach(Objects::requireNonNull);
+    }
+
+    @Override
+    public String getenv(String envVarName) {
+        return envVariables.get(Objects.requireNonNull(envVarName));
+    }
+
+    @Override
+    public String getProperty(String propertyName) {
+        return systemProperties.get(Objects.requireNonNull(propertyName));
+    }
+
+    @Override
+    public String toString() {
+        var tokens = new ArrayList<String>();
+        if (!envVariables.isEmpty()) {
+            tokens.add(String.format("env=%s", envVariables));
+        }
+        if (!systemProperties.isEmpty()) {
+            tokens.add(String.format("props=%s", systemProperties));
+        }
+        return String.join(", ", tokens);
+    }
+}
diff --git a/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/stdmock/WixToolMock.java b/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/stdmock/WixToolMock.java
new file mode 100644
index 00000000000..9cd00f61082
--- /dev/null
+++ b/test/jdk/tools/jpackage/helpers/jdk/jpackage/test/stdmock/WixToolMock.java
@@ -0,0 +1,173 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+package jdk.jpackage.test.stdmock;
+
+import java.nio.file.Path;
+import java.util.List;
+import java.util.Objects;
+import java.util.Optional;
+import jdk.jpackage.internal.util.PathUtils;
+import jdk.jpackage.test.mock.CommandActionSpec;
+import jdk.jpackage.test.mock.CommandActionSpecs;
+import jdk.jpackage.test.mock.CommandMockSpec;
+
+public final class WixToolMock {
+
+    public CommandMockSpec create() {
+        Objects.requireNonNull(type);
+        Objects.requireNonNull(version);
+
+        CommandActionSpec action = switch (type) {
+            case CANDLE3 -> {
+                yield candleAction(fips, version);
+            }
+            case LIGHT3 -> {
+                yield lightAction(version);
+            }
+            case WIX4 -> {
+                yield wixAction(version);
+            }
+        };
+
+        var toolPath = Optional.ofNullable(dir).map(d -> {
+            return d.resolve(type.fileName);
+        }).orElse(type.fileName);
+        var mockName = PathUtils.replaceSuffix(toolPath, "");
+
+        return new CommandMockSpec(toolPath, mockName, CommandActionSpecs.build().action(action).create());
+    }
+
+    public WixToolMock fips(Boolean v) {
+        fips = v;
+        return this;
+    }
+
+    public WixToolMock fips() {
+        return fips(true);
+    }
+
+    public WixToolMock dir(Path v) {
+        dir = v;
+        return this;
+    }
+
+    public WixToolMock version(String v) {
+        version = v;
+        return this;
+    }
+
+    public WixToolMock candle(String version) {
+        return type(WixTool.CANDLE3).version(version);
+    }
+
+    public WixToolMock light(String version) {
+        return type(WixTool.LIGHT3).version(version);
+    }
+
+    public WixToolMock wix(String version) {
+        return type(WixTool.WIX4).version(version);
+    }
+
+    private WixToolMock type(WixTool v) {
+        type = v;
+        return this;
+    }
+
+    private static CommandActionSpec candleAction(boolean fips, String version) {
+        Objects.requireNonNull(version);
+        var sb = new StringBuilder();
+        sb.append(version);
+        if (fips) {
+            sb.append("; fips");
+        }
+        return CommandActionSpec.create(sb.toString(), context -> {
+            if (List.of("-?").equals(context.args())) {
+                if (fips) {
+                    context.err().println("error CNDL0308 : The Federal Information Processing Standard (FIPS) appears to be enabled on the machine");
+                    return Optional.of(308);
+                }
+            } else if (!List.of("-fips").equals(context.args())) {
+                throw context.unexpectedArguments();
+            }
+
+            var out = context.out();
+            List.of(
+                    "Windows Installer XML Toolset Compiler version " + version,
+                    "Copyright (c) .NET Foundation and contributors. All rights reserved.",
+                    "",
+                    " usage:  candle.exe [-?] [-nologo] [-out outputFile] sourceFile [sourceFile ...] [@responseFile]"
+            ).forEach(out::println);
+
+            return Optional.of(0);
+        });
+    }
+
+    private static CommandActionSpec lightAction(String version) {
+        Objects.requireNonNull(version);
+        return CommandActionSpec.create(version, context -> {
+            if (List.of("-?").equals(context.args())) {
+                var out = context.out();
+                List.of(
+                        "Windows Installer XML Toolset Linker version " + version,
+                        "Copyright (c) .NET Foundation and contributors. All rights reserved.",
+                        "",
+                        " usage:  light.exe [-?] [-b bindPath] [-nologo] [-out outputFile] objectFile [objectFile ...] [@responseFile]"
+                ).forEach(out::println);
+                return Optional.of(0);
+            } else {
+                throw context.unexpectedArguments();
+            }
+        });
+    }
+
+    private static CommandActionSpec wixAction(String version) {
+        Objects.requireNonNull(version);
+        return CommandActionSpec.create(version, context -> {
+            if (List.of("--version").equals(context.args())) {
+                context.out().println(version);
+                return Optional.of(0);
+            } else {
+                throw context.unexpectedArguments();
+            }
+        });
+    }
+
+    private enum WixTool {
+        CANDLE3("candle"),
+        LIGHT3("light"),
+        WIX4("wix"),
+        ;
+
+        WixTool(String name) {
+            this.fileName = Path.of(Objects.requireNonNull(name) + ".exe");
+        }
+
+        final Path fileName;
+    }
+
+    private Path dir;
+    private WixTool type;
+    private String version;
+    private boolean fips;
+}
diff --git a/test/jdk/tools/jpackage/junit/share/jdk.jpackage/jdk/jpackage/internal/util/PathUtilsTest.java b/test/jdk/tools/jpackage/junit/share/jdk.jpackage/jdk/jpackage/internal/util/PathUtilsTest.java
new file mode 100644
index 00000000000..7ed679ea3b5
--- /dev/null
+++ b/test/jdk/tools/jpackage/junit/share/jdk.jpackage/jdk/jpackage/internal/util/PathUtilsTest.java
@@ -0,0 +1,213 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+package jdk.jpackage.internal.util;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertThrowsExactly;
+
+import java.nio.file.Path;
+import java.util.Optional;
+import java.util.function.UnaryOperator;
+import org.junit.jupiter.api.Test;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.CsvSource;
+
+
+class PathUtilsTest {
+
+    @ParameterizedTest
+    @CsvSource({
+        "foo,''",
+        "foo.bar,.bar",
+        "foo..bar,.bar",
+        ".bar,.bar",
+        "foo.bar.buz,.buz",
+        ".,.",
+        "...,.",
+        "..,.",
+    })
+    void test_getSuffix(Path path, String expected) {
+
+        var suffix = PathUtils.getSuffix(path);
+
+        assertEquals(expected, suffix);
+    }
+
+    @Test
+    void test_getSuffix_null() {
+        assertThrowsExactly(NullPointerException.class, () -> {
+            PathUtils.getSuffix(null);
+        });
+    }
+
+    @ParameterizedTest
+    @CsvSource({
+        "foo,'',foo",
+        "a/b/foo.exe,.ico,a/b/foo.exe.ico",
+        "foo,bar,foobar",
+        "'',bar,bar",
+        ".,bar,.bar",
+    })
+    void test_addSuffix(Path path, String suffix, Path expected) {
+
+        var newPath = PathUtils.addSuffix(path, suffix);
+
+        assertEquals(expected, newPath);
+    }
+
+    @Test
+    void test_addSuffix_null() {
+        assertThrowsExactly(NullPointerException.class, () -> {
+            PathUtils.addSuffix(null, "foo");
+        });
+        assertThrowsExactly(NullPointerException.class, () -> {
+            PathUtils.addSuffix(Path.of("foo"), null);
+        });
+    }
+
+    @ParameterizedTest
+    @CsvSource({
+        "foo.exe,.ico,foo.ico",
+        "foo.exe,,foo",
+        "foo.exe,'',foo",
+        "a/b/foo.exe,.ico,a/b/foo.ico",
+        "foo,'',foo",
+        "foo,bar,foobar",
+        "'',bar,bar",
+        ".,bar,bar",
+        ".,.bar,.bar",
+    })
+    void test_replaceSuffix(Path path, String newSuffix, Path expected) {
+
+        var newPath = PathUtils.replaceSuffix(path, newSuffix);
+
+        assertEquals(expected, newPath);
+    }
+
+    @Test
+    void test_replaceSuffix_null() {
+        assertThrowsExactly(NullPointerException.class, () -> {
+            PathUtils.replaceSuffix(null, "foo");
+        });
+
+        assertEquals(Path.of("foo"), PathUtils.replaceSuffix(Path.of("foo.a"), null));
+    }
+
+    @ParameterizedTest
+    @CsvSource({
+        "IDENTITY,a,a",
+        "IDENTITY,,",
+        "RETURN_NULL,a,",
+        "RETURN_NULL,,",
+        "FOO,a,foo",
+        "FOO,,",
+    })
+    void test_mapNullablePath(PathMapper mapper, Path path, Path expected) {
+
+        var newPath = PathUtils.mapNullablePath(mapper, path);
+
+        assertEquals(expected, newPath);
+    }
+
+    @Test
+    void test_mapNullablePath_null() {
+        assertThrowsExactly(NullPointerException.class, () -> {
+            PathUtils.mapNullablePath(null, Path.of(""));
+        });
+    }
+
+    @ParameterizedTest
+    @CsvSource(nullValues = {"N/A"}, value = {
+        "foo.exe",
+        "N/A",
+    })
+    void test_normalizedAbsolutePath(Path path) {
+
+        var newPath = PathUtils.normalizedAbsolutePath(path);
+
+        var expected = Optional.ofNullable(path).map(v -> {
+            return v.normalize().toAbsolutePath();
+        }).orElse(null);
+
+        assertEquals(expected, newPath);
+    }
+
+    @ParameterizedTest
+    @CsvSource(nullValues = {"N/A"}, value = {
+        "foo.exe",
+        "N/A",
+    })
+    void test_normalizedAbsolutePathString(Path path) {
+
+        var newPath = PathUtils.normalizedAbsolutePathString(path);
+
+        var expected = Optional.ofNullable(path).map(v -> {
+            return v.normalize().toAbsolutePath().toString();
+        }).orElse(null);
+
+        assertEquals(expected, newPath);
+    }
+
+    @ParameterizedTest
+    @CsvSource(nullValues = {"N/A"}, value = {
+        "N/A",
+        "foo",
+        "*",
+        ":",
+    })
+    void test_asPath(String str) {
+
+        var path = PathUtils.asPath(str);
+
+        var expected = Optional.ofNullable(str).flatMap(v -> {
+            return Result.of(() -> {
+                return Path.of(v);
+            }).value();
+        });
+
+        assertEquals(expected, path);
+    }
+
+    enum PathMapper implements UnaryOperator<Path> {
+        IDENTITY {
+            @Override
+            public Path apply(Path path) {
+                return path;
+            }
+        },
+        RETURN_NULL {
+            @Override
+            public Path apply(Path path) {
+                return null;
+            }
+        },
+        FOO {
+            @Override
+            public Path apply(Path path) {
+                return Path.of("foo");
+            }
+        },
+        ;
+    }
+}
diff --git a/test/jdk/tools/jpackage/junit/windows/jdk.jpackage/jdk/jpackage/internal/WixToolTest.java b/test/jdk/tools/jpackage/junit/windows/jdk.jpackage/jdk/jpackage/internal/WixToolTest.java
new file mode 100644
index 00000000000..d4881069844
--- /dev/null
+++ b/test/jdk/tools/jpackage/junit/windows/jdk.jpackage/jdk/jpackage/internal/WixToolTest.java
@@ -0,0 +1,754 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+package jdk.jpackage.internal;
+
+import static java.util.stream.Collectors.toMap;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertNotEquals;
+import static org.junit.jupiter.api.Assertions.assertThrows;
+
+import java.io.IOException;
+import java.nio.file.Files;
+import java.nio.file.Path;
+import java.util.ArrayList;
+import java.util.Collection;
+import java.util.Collections;
+import java.util.HashMap;
+import java.util.List;
+import java.util.Map;
+import java.util.Objects;
+import java.util.Optional;
+import java.util.function.Consumer;
+import java.util.function.Function;
+import java.util.function.Predicate;
+import java.util.function.Supplier;
+import java.util.stream.Collectors;
+import java.util.stream.Stream;
+import jdk.jpackage.internal.WixTool.ToolInfo;
+import jdk.jpackage.internal.WixToolset.WixToolsetType;
+import jdk.jpackage.internal.model.ConfigException;
+import jdk.jpackage.internal.util.TokenReplace;
+import jdk.jpackage.test.CannedFormattedString;
+import jdk.jpackage.test.JPackageStringBundle;
+import jdk.jpackage.test.mock.CommandActionSpecs;
+import jdk.jpackage.test.mock.CommandMock;
+import jdk.jpackage.test.mock.CommandMockSpec;
+import jdk.jpackage.test.mock.Script;
+import jdk.jpackage.test.stdmock.EnvironmentProviderMock;
+import jdk.jpackage.test.stdmock.JPackageMockUtils;
+import jdk.jpackage.test.stdmock.WixToolMock;
+import org.junit.jupiter.api.io.TempDir;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
+
+
+class WixToolTest {
+
+    @ParameterizedTest
+    @MethodSource
+    void testLookup(TestSpec spec, @TempDir Path workDir) throws IOException {
+        spec.run(workDir);
+    }
+
+    @ParameterizedTest
+    @MethodSource
+    void testLookupDirs(EnvironmentTestSpec spec, @TempDir Path workDir) throws IOException {
+        spec.run(workDir);
+    }
+
+    private static Collection<TestSpec> testLookup() {
+
+        List<TestSpec> testCases = new ArrayList<>();
+
+        Consumer<TestSpec.Builder> appendTestCases = builder -> {
+            testCases.add(builder.create());
+        };
+
+        Stream.of(
+                // Simple WiX3 of a minimal acceptable version
+                TestSpec.build()
+                        .expect(toolset().version("3.0").put(WixToolsetType.Wix3, "foo"))
+                        .tool(tool("foo").candle("3.0"))
+                        .tool(tool("foo").light("3.0")),
+                // Simple WiX3 with FIPS
+                TestSpec.build()
+                        .expect(toolset().version("3.14.1.8722").put(WixToolsetType.Wix3, "foo").fips())
+                        .tool(tool("foo").candle("3.14.1.8722").fips())
+                        .tool(tool("foo").light("3.14.1.8722")),
+                // Simple WiX4+ of a minimal acceptable version
+                TestSpec.build()
+                        .expect(toolset().version("4.0.4").put(WixToolsetType.Wix4, "foo"))
+                        .tool(tool("foo").wix("4.0.4")),
+                // WiX3 with light and candle from different directories and non-existent directory
+                TestSpec.build()
+                        .expect(toolset().version("3.11.2").put(WixTool.Candle3, "foo").put(WixTool.Light3, "bar"))
+                        .lookupDir("buz")
+                        .tool(tool("foo").candle("3.11.2"))
+                        .tool(tool("bar").light("3.11.2"))
+                        .tool(tool("bar").candle("3.11.1"))
+                        .tool(tool("foo").light("3.11.1")),
+                // WiX3, WiX4+ same directory
+                TestSpec.build()
+                        .expect(toolset().version("5.0.2+aa65968c").put(WixToolsetType.Wix4, "foo"))
+                        .tool(tool("foo").candle("3.14.1.8722"))
+                        .tool(tool("foo").light("3.14.1.8722"))
+                        .tool(tool("foo").wix("5.0.2+aa65968c")),
+                // WiX3 (good), WiX4+ (bad version)
+                TestSpec.build()
+                        .expect(toolset().version("3.14.1.8722").put(WixToolsetType.Wix3, "foo"))
+                        .tool(tool("foo").candle("3.14.1.8722"))
+                        .tool(tool("foo").light("3.14.1.8722"))
+                        .tool(tool("foo").wix("Blah-blah-blah")),
+                // WiX3 (incomplete), WiX4+ (good)
+                TestSpec.build()
+                        .expect(toolset().version("5.0").put(WixToolsetType.Wix4, "foo"))
+                        .tool(tool("foo").candle("3.14.1.8722"))
+                        .tool(tool("foo").wix("5.0")),
+                // WiX5 in the PATH and in the directory, same version; PATH always wins
+                TestSpec.build()
+                        .expect(toolset().version("5.0").put(WixToolsetType.Wix4))
+                        .tool(tool().wix("5.0"))
+                        .tool(tool("foo").wix("5.0")),
+                 // WiX5 in the PATH and in the directory; the one in the directory is newer; PATH always wins
+                 TestSpec.build()
+                         .expect(toolset().version("5.0").put(WixToolsetType.Wix4))
+                         .tool(tool().wix("5.0"))
+                         .tool(tool("foo").wix("5.1")),
+                 // WiX5 in the PATH and in the directory; the one in the PATH is newer; PATH always wins
+                 TestSpec.build()
+                         .expect(toolset().version("5.1").put(WixToolsetType.Wix4))
+                         .tool(tool().wix("5.1"))
+                         .tool(tool("foo").wix("5.0")),
+                 // WiX3 in the PATH, WiX3 in the directory; PATH always wins
+                 TestSpec.build()
+                         .expect(toolset().version("3.20").put(WixToolsetType.Wix3))
+                         .tool(tool().candle("3.20"))
+                         .tool(tool().light("3.20"))
+                         .tool(tool("foo").wix("5.0")),
+                 // Old WiX3 in the PATH, WiX3 in the directory
+                 TestSpec.build()
+                         .expect(toolset().version("3.20").put(WixToolsetType.Wix3, "foo"))
+                         .tool(tool().candle("2.9"))
+                         .tool(tool().light("2.9"))
+                         .tool(tool("foo").candle("3.20"))
+                         .tool(tool("foo").light("3.20"))
+        ).forEach(appendTestCases);
+
+        for (var oldLightStatus : ToolStatus.values()) {
+            for (var oldCandleStatus : ToolStatus.values()) {
+                for (var newLightStatus : ToolStatus.values()) {
+                    for (var newCandleStatus : ToolStatus.values()) {
+                        boolean newGood = ToolStatus.isAllGood(newLightStatus, newCandleStatus);
+                        if (!ToolStatus.isAllGood(oldLightStatus, oldCandleStatus) && !newGood) {
+                            continue;
+                        }
+
+                        var builder = TestSpec.build();
+                        if (newGood) {
+                            builder.expect(toolset().version("3.14").put(WixToolsetType.Wix3, "new"));
+                        } else {
+                            builder.expect(toolset().version("3.11").put(WixToolsetType.Wix3, "old"));
+                        }
+
+                        oldCandleStatus.map(tool("old").candle("3.11")).ifPresent(builder::tool);
+                        oldLightStatus.map(tool("old").light("3.11")).ifPresent(builder::tool);
+
+                        newCandleStatus.map(tool("new").candle("3.14")).ifPresent(builder::tool);
+                        newLightStatus.map(tool("new").light("3.14")).ifPresent(builder::tool);
+
+                        appendTestCases.accept(builder);
+                    }
+                }
+            }
+        }
+
+        Stream.of(
+                // No WiX tools
+                TestSpec.build(),
+                TestSpec.build()
+                        .lookupDir("foo"),
+                TestSpec.build()
+                        .lookupDir(LOOKUP_IN_PATH),
+                // Incomplete WiX3: missing candle.exe
+                TestSpec.build()
+                        .tool(tool("foo").light("3.14.1.8722")),
+                // Incomplete WiX3: missing light.exe
+                TestSpec.build()
+                        .tool(tool("foo").candle("3.14.1.8722")),
+                // Incomplete WiX3: version mismatch of light.exe and candle.exe
+                TestSpec.build()
+                        .tool(tool("foo").candle("3.14"))
+                        .tool(tool("foo").light("3.15")),
+                // WiX3 too old
+                TestSpec.build()
+                        .tool(tool("foo").candle("2.9"))
+                        .tool(tool("foo").light("2.9")),
+                // WiX4+ too old
+                TestSpec.build()
+                        .tool(tool("foo").wix("4.0.3"))
+        ).forEach(appendTestCases);
+
+        return testCases;
+    }
+
+    private static Collection<EnvironmentTestSpec> testLookupDirs() {
+
+        List<EnvironmentTestSpec> testCases = new ArrayList<>();
+
+        Stream.of(
+                EnvironmentTestSpec.build()
+                        .env(EnvironmentVariable.USERPROFILE, "@@/foo")
+                        .expect("@USERPROFILE@/.dotnet/tools"),
+                EnvironmentTestSpec.build()
+                        .env(SystemProperty.USER_HOME, "@@/bar")
+                        .expect("@user.home@/.dotnet/tools"),
+                // "USERPROFILE" environment variable and "user.home" system property set to different values,
+                // the order should be "USERPROFILE" followed by "user.home".
+                EnvironmentTestSpec.build()
+                        .env(EnvironmentVariable.USERPROFILE, "@@/foo")
+                        .env(SystemProperty.USER_HOME, "@@/bar")
+                        .expect("@USERPROFILE@/.dotnet/tools")
+                        .expect("@user.home@/.dotnet/tools"),
+                // "USERPROFILE" environment variable and "user.home" system property set to the same value.
+                EnvironmentTestSpec.build()
+                        .env(EnvironmentVariable.USERPROFILE, "@@/buz")
+                        .env(SystemProperty.USER_HOME, "@@/buz")
+                        .expect("@USERPROFILE@/.dotnet/tools"),
+                // WiX3: newer versions first; 32bit after 64bit
+                EnvironmentTestSpec.build()
+                        .standardEnv(EnvironmentVariable.PROGRAM_FILES_X86)
+                        .standardEnv(EnvironmentVariable.PROGRAM_FILES)
+                        .expect(String.format("@%s@/WiX Toolset v3.11/bin", EnvironmentVariable.PROGRAM_FILES_X86.variableName()))
+                        .expect(String.format("@%s@/WiX Toolset v3.10/bin", EnvironmentVariable.PROGRAM_FILES.variableName()))
+                        .expect(String.format("@%s@/WiX Toolset v3.10/bin", EnvironmentVariable.PROGRAM_FILES_X86.variableName())),
+                // Malformed installation directory should be accepted
+                EnvironmentTestSpec.build()
+                        .standardEnv(EnvironmentVariable.PROGRAM_FILES_X86)
+                        .expect(String.format("@%s@/WiX Toolset vb/bin", EnvironmentVariable.PROGRAM_FILES_X86.variableName()))
+                        .expect(String.format("@%s@/WiX Toolset va/bin", EnvironmentVariable.PROGRAM_FILES_X86.variableName()))
+                        .expect(String.format("@%s@/WiX Toolset v/bin", EnvironmentVariable.PROGRAM_FILES_X86.variableName())),
+                // No directories
+                EnvironmentTestSpec.build()
+        ).map(EnvironmentTestSpec.Builder::create).forEach(testCases::add);
+
+        return testCases;
+    }
+
+    private enum ToolStatus {
+        GOOD,
+        MISSING,
+        UNEXPECTED_STDOUT,
+        ;
+
+        static boolean isAllGood(ToolStatus... status) {
+            return Stream.of(status).allMatch(Predicate.isEqual(GOOD));
+        }
+
+        Optional<CommandMockSpec> map(WixToolMock builder) {
+            return switch (this) {
+                case MISSING -> {
+                    yield Optional.empty();
+                }
+                case UNEXPECTED_STDOUT -> {
+                    var mock = builder.create();
+                    yield Optional.of(new CommandMockSpec(
+                            mock.name(),
+                            mock.mockName(),
+                            CommandActionSpecs.build().stdout("Blah-Blah-Blah").exit().create()));
+                }
+                case GOOD -> {
+                    yield Optional.of(builder.create());
+                }
+            };
+        }
+    }
+
+    record TestSpec(
+            Optional<WixToolset> expected,
+            List<Path> lookupDirs,
+            boolean lookupInPATH,
+            Collection<CommandMockSpec> mocks,
+            List<CannedFormattedString> expectedErrors) {
+
+        TestSpec {
+            Objects.requireNonNull(expected);
+            lookupDirs.forEach(Objects::requireNonNull);
+            mocks.forEach(Objects::requireNonNull);
+            expectedErrors.forEach(Objects::requireNonNull);
+
+            if (expected.isEmpty() == expectedErrors.isEmpty()) {
+                // It should be either toolset or errors, not both or non both.
+                throw new IllegalArgumentException();
+            }
+
+            lookupDirs.forEach(WixToolTest::assertIsRelative);
+
+            lookupDirs.forEach(path -> {
+                assertNotEquals(LOOKUP_IN_PATH, path);
+            });
+
+            // Ensure tool paths are unique.
+            mocks.stream().map(CommandMockSpec::name).collect(toMap(x -> x, x -> x));
+        }
+
+        @Override
+        public String toString() {
+            var tokens = new ArrayList<String>();
+            expected.map(Object::toString).ifPresent(tokens::add);
+            if (!expectedErrors.isEmpty()) {
+                tokens.add(String.format("errors=%s", expectedErrors));
+            }
+
+            List<Path> lookupPaths;
+            if (lookupInPATH) {
+                lookupPaths = new ArrayList<>();
+                lookupPaths.add(Path.of("${PATH}"));
+                lookupPaths.addAll(lookupDirs);
+            } else {
+                lookupPaths = lookupDirs;
+            }
+
+            if (!lookupPaths.isEmpty()) {
+                tokens.add(String.format("lookup-dirs=%s", lookupPaths));
+            }
+            if (!mocks.isEmpty()) {
+                tokens.add(mocks.toString());
+            }
+            return String.join(", ", tokens);
+        }
+
+        void run(Path workDir) {
+            var scriptBuilder = Script.build().commandMockBuilderMutator(CommandMock.Builder::repeatInfinitely);
+            mocks.stream().map(mockSpec -> {
+                Path toolPath = mockSpec.name();
+                if (toolPath.getNameCount() > 1) {
+                    toolPath = workDir.resolve(toolPath);
+                }
+                return new CommandMockSpec(toolPath, mockSpec.mockName(), mockSpec.actions());
+            }).forEach(scriptBuilder::map);
+
+            scriptBuilder.map(_ -> true, CommandMock.ioerror("non-existent"));
+
+            var script = scriptBuilder.createLoop();
+
+            Supplier<WixToolset> createToolset = () -> {
+                return WixTool.createToolset(() -> {
+                    return lookupDirs.stream().map(workDir::resolve).toList();
+                }, lookupInPATH());
+            };
+
+            Globals.main(() -> {
+                JPackageMockUtils.buildJPackage()
+                        .script(script)
+                        .listener(System.out::println)
+                        .applyToGlobals();
+
+                expected.ifPresentOrElse(expectedToolset -> {
+                    var toolset = createToolset.get();
+                    assertEquals(resolveAt(expectedToolset, workDir), toolset);
+                }, () -> {
+                    var ex = assertThrows(RuntimeException.class, createToolset::get);
+                    assertEquals(expectedErrors.getFirst().getValue(), ex.getMessage());
+                    if (ex instanceof ConfigException cfgEx) {
+                        assertEquals(expectedErrors.getLast().getValue(), cfgEx.getAdvice());
+                        assertEquals(2, expectedErrors.size());
+                    } else {
+                        assertEquals(1, expectedErrors.size());
+                    }
+                });
+
+                return 0;
+            });
+        }
+
+        static Builder build() {
+            return new Builder();
+        }
+
+        static final class Builder {
+
+            TestSpec create() {
+                if (expected == null && expectedErrors.isEmpty()) {
+                    return copy()
+                            .expect("error.no-wix-tools")
+                            .expect("error.no-wix-tools.advice")
+                            .create();
+                } else {
+                    var allLookupDirs = Stream.concat(
+                            lookupDirs.stream(),
+                            tools.stream().map(CommandMockSpec::name).map(toolPath -> {
+                                if (toolPath.getNameCount() == 1) {
+                                    return LOOKUP_IN_PATH;
+                                } else {
+                                    return toolPath.getParent();
+                                }
+                            })
+                    ).distinct().collect(Collectors.toCollection(ArrayList::new));
+
+                    var lookupInPATH = allLookupDirs.contains(LOOKUP_IN_PATH);
+                    if (lookupInPATH) {
+                        allLookupDirs.remove(LOOKUP_IN_PATH);
+                    }
+
+                    return new TestSpec(
+                            Optional.ofNullable(expected),
+                            Collections.unmodifiableList(allLookupDirs),
+                            lookupInPATH,
+                            List.copyOf(tools),
+                            List.copyOf(expectedErrors));
+                }
+            }
+
+            Builder copy() {
+                return new Builder(this);
+            }
+
+            private Builder() {
+                expectedErrors = new ArrayList<>();
+                lookupDirs = new ArrayList<>();
+                tools = new ArrayList<>();
+            }
+
+            private Builder(Builder other) {
+                expected = other.expected;
+                expectedErrors = new ArrayList<>(other.expectedErrors);
+                lookupDirs = new ArrayList<>(other.lookupDirs);
+                tools = new ArrayList<>(other.tools);
+            }
+
+            Builder expect(WixToolset v) {
+                expected = v;
+                return this;
+            }
+
+            Builder expect(String formatKey, Object ... args) {
+                expectedErrors.add(JPackageStringBundle.MAIN.cannedFormattedString(formatKey, args));
+                return this;
+            }
+
+            Builder expect(WixToolsetBuilder builder) {
+                return expect(builder.create());
+            }
+
+            Builder lookupDir(String v) {
+                return lookupDir(Path.of(v));
+            }
+
+            Builder lookupDir(Path v) {
+                lookupDirs.add(Objects.requireNonNull(v));
+                return this;
+            }
+
+            Builder tool(CommandMockSpec v) {
+                tools.add(Objects.requireNonNull(v));
+                return this;
+            }
+
+            Builder tool(WixToolMock v) {
+                return tool(v.create());
+            }
+
+            private WixToolset expected;
+            private final List<CannedFormattedString> expectedErrors;
+            private final List<Path> lookupDirs;
+            private final List<CommandMockSpec> tools;
+        }
+    }
+
+    private static final class WixToolsetBuilder {
+
+        WixToolset create() {
+            return new WixToolset(tools.entrySet().stream().collect(toMap(Map.Entry::getKey, e -> {
+                ToolInfo toolInfo = new WixTool.DefaultToolInfo(e.getValue(), version);
+                if (e.getKey() == WixTool.Candle3) {
+                    toolInfo = new WixTool.DefaultCandleInfo(toolInfo, fips);
+                }
+                return toolInfo;
+            })));
+        }
+
+        WixToolsetBuilder version(String v) {
+            version = v;
+            return this;
+        }
+
+        WixToolsetBuilder put(WixTool tool, String path) {
+            return put(tool, Path.of(path));
+        }
+
+        WixToolsetBuilder put(WixTool tool, Path path) {
+            tools.put(Objects.requireNonNull(tool), path.resolve(tool.fileName()));
+            return this;
+        }
+
+        WixToolsetBuilder put(WixTool tool) {
+            return put(tool, LOOKUP_IN_PATH);
+        }
+
+        WixToolsetBuilder put(WixToolsetType type, Path path) {
+            type.getTools().forEach(tool -> {
+                put(tool, path);
+            });
+            return this;
+        }
+
+        WixToolsetBuilder put(WixToolsetType type, String path) {
+            return put(type, Path.of(path));
+        }
+
+        WixToolsetBuilder put(WixToolsetType type) {
+            return put(type, LOOKUP_IN_PATH);
+        }
+
+        WixToolsetBuilder fips(boolean v) {
+            fips = true;
+            return this;
+        }
+
+        WixToolsetBuilder fips() {
+            return fips(true);
+        }
+
+        private Map<WixTool, Path> tools = new HashMap<>();
+        private boolean fips;
+        private String version;
+    }
+
+    enum EnvironmentVariable {
+        USERPROFILE("USERPROFILE"),
+        PROGRAM_FILES("ProgramFiles"),
+        PROGRAM_FILES_X86("ProgramFiles(x86)"),
+        SYSTEM_DRIVE("SystemDrive"),
+        ;
+
+        EnvironmentVariable(String variableName) {
+            this.variableName = Objects.requireNonNull(variableName);
+        }
+
+        String variableName() {
+            return variableName;
+        }
+
+        private final String variableName;
+    }
+
+    enum SystemProperty {
+        USER_HOME("user.home"),
+        ;
+
+        SystemProperty(String propertyName) {
+            this.propertyName = Objects.requireNonNull(propertyName);
+        }
+
+        String propertyName() {
+            return propertyName;
+        }
+
+        private final String propertyName;
+    }
+
+    record EnvironmentTestSpec(EnvironmentProviderMock env, List<Path> expectedDirs) {
+
+        EnvironmentTestSpec {
+            Objects.requireNonNull(env);
+            expectedDirs.forEach(dir -> {
+                if (dir.isAbsolute()) {
+                    throw new IllegalArgumentException();
+                }
+            });
+        }
+
+        @Override
+        public String toString() {
+            var tokens = new ArrayList<String>();
+            tokens.add(String.format("expect=%s", expectedDirs));
+            tokens.add(env.toString());
+            return String.join(", ", tokens);
+        }
+
+        void run(Path workDir) throws IOException {
+            var allResolved = resolve(workDir,  Stream.of(
+                    env.envVariables().entrySet().stream(),
+                    env.systemProperties().entrySet().stream(),
+                    expectedDirs.stream().map(Path::toString).map(dir -> {
+                        return Map.entry(dir, dir);
+                    })
+            ).flatMap(x -> x).collect(Collectors.toMap(Map.Entry::getKey, Map.Entry::getValue)));
+
+            Function<Supplier<Map<String, String>>, Map<String, String>> filterAllResolved = filterSupplier -> {
+                var filter = filterSupplier.get();
+                return allResolved.entrySet().stream().filter(e -> {
+                    return filter.containsKey(e.getKey());
+                }).collect(Collectors.toMap(Map.Entry::getKey, Map.Entry::getValue));
+            };
+
+            var resolvedEnv = new EnvironmentProviderMock(
+                    filterAllResolved.apply(env::envVariables),
+                    filterAllResolved.apply(env::systemProperties));
+
+            var resolvedDirs = expectedDirs.stream().map(Path::toString).map(allResolved::get).map(Path::of).toList();
+
+            for (var dir : resolvedDirs) {
+                Files.createDirectories(dir);
+            }
+
+            Globals.main(() -> {
+                Globals.instance().system(resolvedEnv);
+                assertEquals(resolvedDirs, WixTool.findWixInstallDirs());
+                return 0;
+            });
+        }
+
+        static Builder build() {
+            return new Builder();
+        }
+
+        static final class Builder {
+
+            EnvironmentTestSpec create() {
+                var env = envVariables.entrySet().stream().collect(Collectors.toMap(e -> {
+                    return e.getKey().variableName();
+                }, Map.Entry::getValue));
+
+                var props = systemProperties.entrySet().stream().collect(Collectors.toMap(e -> {
+                    return e.getKey().propertyName();
+                }, Map.Entry::getValue));
+
+                return new EnvironmentTestSpec(new EnvironmentProviderMock(env, props), List.copyOf(expectedDirs));
+            }
+
+            Builder expect(List<Path> dirs) {
+                expectedDirs.addAll(dirs);
+                return this;
+            }
+
+            Builder expect(Path... dirs) {
+                return expect(List.of(dirs));
+            }
+
+            Builder expect(String... dirs) {
+                return expect(List.of(dirs).stream().map(Path::of).toList());
+            }
+
+            Builder env(SystemProperty k, String v) {
+                systemProperties.put(Objects.requireNonNull(k), Objects.requireNonNull(v));
+                return this;
+            }
+
+            Builder env(EnvironmentVariable k, String v) {
+                envVariables.put(Objects.requireNonNull(k), Objects.requireNonNull(v));
+                return this;
+            }
+
+            Builder standardEnv(EnvironmentVariable k) {
+                var value = switch (k) {
+                    case PROGRAM_FILES -> "Program Files";
+                    case PROGRAM_FILES_X86 -> "Program Files(x86)";
+                    default -> {
+                        throw new IllegalArgumentException();
+                    }
+                };
+                return env(k, "@@/" + value);
+            }
+
+            private final Map<EnvironmentVariable, String> envVariables = new HashMap<>();
+            private final Map<SystemProperty, String> systemProperties = new HashMap<>();
+            private final List<Path> expectedDirs = new ArrayList<>();
+        }
+
+        private static Map<String, String> resolve(Path workDir, Map<String, String> props) {
+
+            var tokens = new ArrayList<String>();
+
+            Stream.of(
+                    Stream.of(EnvironmentVariable.values()).map(EnvironmentVariable::variableName),
+                    Stream.of(SystemProperty.values()).map(SystemProperty::propertyName)
+            ).flatMap(x -> x).map(str -> {
+                return String.format("@%s@", str);
+            }).forEach(tokens::add);
+
+            tokens.add(TOKEN_WORKDIR);
+
+            var tokenReplace = new TokenReplace(tokens.toArray(String[]::new));
+
+            return props.entrySet().stream().collect(Collectors.toMap(Map.Entry::getKey, e -> {
+                return tokenReplace.recursiveApplyTo(e.getValue(), token -> {
+                    if (token.equals(TOKEN_WORKDIR)) {
+                        return workDir;
+                    } else {
+                        return Objects.requireNonNull(props.get(token.substring(1, token.length() - 1)), () -> {
+                            return String.format("Unrecognized token: [%s]", token);
+                        });
+                    }
+                });
+            }));
+        }
+
+        static final String TOKEN_WORKDIR = "@@";
+    }
+
+    private static WixToolsetBuilder toolset() {
+        return new WixToolsetBuilder();
+    }
+
+    private static WixToolMock tool() {
+        return new WixToolMock();
+    }
+
+    private static WixToolMock tool(Path dir) {
+        return tool().dir(dir);
+    }
+
+    private static WixToolMock tool(String dir) {
+        return tool(Path.of(dir));
+    }
+
+    private static WixToolset resolveAt(WixToolset toolset, Path root) {
+        return new WixToolset(toolset.tools().entrySet().stream().collect(toMap(Map.Entry::getKey, e -> {
+            var toolInfo = e.getValue();
+
+            assertIsRelative(toolInfo.path());
+
+            if (toolInfo.path().getNameCount() == 1) {
+                // The tool is picked from the PATH.
+                return toolInfo;
+            }
+
+            ToolInfo newToolInfo = new WixTool.DefaultToolInfo(root.resolve(toolInfo.path()), toolInfo.version());
+            if (toolInfo instanceof WixTool.CandleInfo candleInfo) {
+                newToolInfo = new WixTool.DefaultCandleInfo(newToolInfo, candleInfo.fips());
+            }
+            return newToolInfo;
+        })));
+    }
+
+    private static void assertIsRelative(Path path) {
+        if (path.isAbsolute()) {
+            throw new IllegalArgumentException();
+        }
+    }
+
+    static final Path LOOKUP_IN_PATH = Path.of("");
+}
+
diff --git a/test/jdk/tools/jpackage/junit/windows/junit.java b/test/jdk/tools/jpackage/junit/windows/junit.java
index 1a1d0d58f7e..8c290c2c87f 100644
--- a/test/jdk/tools/jpackage/junit/windows/junit.java
+++ b/test/jdk/tools/jpackage/junit/windows/junit.java
@@ -45,3 +45,15 @@
  *    jdk/jpackage/internal/wixui/UISpecTest.java
  * @run junit jdk.jpackage/jdk.jpackage.internal.wixui.UISpecTest
  */
+
+/* @test
+ * @summary Test WiX Toolset lookup algorithm
+ * @requires (os.family == "windows")
+ * @library /test/jdk/tools/jpackage/helpers
+ * @build jdk.jpackage.test.*
+ * @build jdk.jpackage.test.mock.*
+ * @build jdk.jpackage.test.stdmock.*
+ * @compile/module=jdk.jpackage -Xlint:all -Werror
+ *    jdk/jpackage/internal/WixToolTest.java
+ * @run junit jdk.jpackage/jdk.jpackage.internal.WixToolTest
+ */

From 52fd46d3a614106df6ee4ca35b322dcec37329f2 Mon Sep 17 00:00:00 2001
From: Dhamoder Nalla <dhanalla@openjdk.org>
Date: Wed, 1 Apr 2026 01:42:33 +0000
Subject: [PATCH 447/655] 8371651: [AArch64] Populate CPU _features flag on
 Windows

Reviewed-by: dholmes, bstafford, aph
---
 .../windows_aarch64/sve_windows_aarch64.S     | 42 +++++++++++++++++++
 .../vm_version_windows_aarch64.cpp            | 35 ++++++++++++----
 2 files changed, 70 insertions(+), 7 deletions(-)
 create mode 100644 src/hotspot/os_cpu/windows_aarch64/sve_windows_aarch64.S

diff --git a/src/hotspot/os_cpu/windows_aarch64/sve_windows_aarch64.S b/src/hotspot/os_cpu/windows_aarch64/sve_windows_aarch64.S
new file mode 100644
index 00000000000..e0c85830bd4
--- /dev/null
+++ b/src/hotspot/os_cpu/windows_aarch64/sve_windows_aarch64.S
@@ -0,0 +1,42 @@
+;
+; Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+; DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+;
+; This code is free software; you can redistribute it and/or modify it
+; under the terms of the GNU General Public License version 2 only, as
+; published by the Free Software Foundation.
+;
+; This code is distributed in the hope that it will be useful, but WITHOUT
+; ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+; FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+; version 2 for more details (a copy is included in the LICENSE file that
+; accompanied this code).
+;
+; You should have received a copy of the GNU General Public License version
+; 2 along with this work; if not, write to the Free Software Foundation,
+; Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+;
+; Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+; or visit www.oracle.com if you need additional information or have any
+; questions.
+;
+
+    ; Support for int get_sve_vector_length();
+    ;
+    ; Returns the current SVE vector length in bytes.
+    ; This function uses the INCB instruction which increments a register
+    ; by the number of bytes in an SVE vector register.
+    ;
+    ; Note: This function will fault if SVE is not available or enabled.
+    ; The caller must ensure SVE support is detected before calling.
+
+    ALIGN  4
+    EXPORT get_sve_vector_length
+    AREA sve_text, CODE
+
+get_sve_vector_length
+    mov      x0, #0
+    incb     x0
+    ret
+
+    END
diff --git a/src/hotspot/os_cpu/windows_aarch64/vm_version_windows_aarch64.cpp b/src/hotspot/os_cpu/windows_aarch64/vm_version_windows_aarch64.cpp
index 93beb549366..e78a37b4178 100644
--- a/src/hotspot/os_cpu/windows_aarch64/vm_version_windows_aarch64.cpp
+++ b/src/hotspot/os_cpu/windows_aarch64/vm_version_windows_aarch64.cpp
@@ -26,16 +26,19 @@
 #include "runtime/os.hpp"
 #include "runtime/vm_version.hpp"
 
+// Assembly function to get SVE vector length using INCB instruction
+extern "C" int get_sve_vector_length();
+
 int VM_Version::get_current_sve_vector_length() {
   assert(VM_Version::supports_sve(), "should not call this");
-  ShouldNotReachHere();
-  return 0;
+  // Use assembly instruction to get the actual SVE vector length
+  return  VM_Version::supports_sve() ? get_sve_vector_length() : 0; // This value is in bytes
 }
 
 int VM_Version::set_and_get_current_sve_vector_length(int length) {
   assert(VM_Version::supports_sve(), "should not call this");
-  ShouldNotReachHere();
-  return 0;
+  // Use assembly instruction to get the SVE vector length
+  return VM_Version::supports_sve() ? get_sve_vector_length() : 0; // This value is in bytes
 }
 
 void VM_Version::get_os_cpu_info() {
@@ -47,11 +50,29 @@ void VM_Version::get_os_cpu_info() {
     set_feature(CPU_AES);
     set_feature(CPU_SHA1);
     set_feature(CPU_SHA2);
+    set_feature(CPU_PMULL);
   }
   if (IsProcessorFeaturePresent(PF_ARM_VFP_32_REGISTERS_AVAILABLE)) {
     set_feature(CPU_ASIMD);
   }
-  // No check for CPU_PMULL, CPU_SVE, CPU_SVE2
+  if (IsProcessorFeaturePresent(PF_ARM_V81_ATOMIC_INSTRUCTIONS_AVAILABLE)) {
+    set_feature(CPU_LSE);
+  }
+  if (IsProcessorFeaturePresent(PF_ARM_SVE_INSTRUCTIONS_AVAILABLE)) {
+    set_feature(CPU_SVE);
+  }
+  if (IsProcessorFeaturePresent(PF_ARM_SVE2_INSTRUCTIONS_AVAILABLE)) {
+    set_feature(CPU_SVE2);
+  }
+  if (IsProcessorFeaturePresent(PF_ARM_SVE_BITPERM_INSTRUCTIONS_AVAILABLE)) {
+    set_feature(CPU_SVEBITPERM);
+  }
+  if (IsProcessorFeaturePresent(PF_ARM_SHA3_INSTRUCTIONS_AVAILABLE)) {
+    set_feature(CPU_SHA3);
+  }
+  if (IsProcessorFeaturePresent(PF_ARM_SHA512_INSTRUCTIONS_AVAILABLE)) {
+    set_feature(CPU_SHA512);
+  }
 
   __int64 dczid_el0 = _ReadStatusReg(0x5807 /* ARM64_DCZID_EL0 */);
 
@@ -102,8 +123,8 @@ void VM_Version::get_os_cpu_info() {
       SYSTEM_INFO si;
       GetSystemInfo(&si);
       _model = si.wProcessorLevel;
-      _variant = si.wProcessorRevision / 0xFF;
-      _revision = si.wProcessorRevision & 0xFF;
+      _variant = (si.wProcessorRevision >> 8) & 0xFF; // Variant is the upper byte of wProcessorRevision
+      _revision = si.wProcessorRevision & 0xFF; // Revision is the lower byte of wProcessorRevision
     }
   }
 }

From 2e0ce34d3cbb2abca4efbf8d5598cdc679b72e90 Mon Sep 17 00:00:00 2001
From: Guanqiang Han <ghan@openjdk.org>
Date: Wed, 1 Apr 2026 06:20:26 +0000
Subject: [PATCH 448/655] 8380579: C2: Intermittent fastdebug assert in
 Parse::sharpen_type_after_if: missing type check info

Reviewed-by: rcastanedalo, vlivanov
---
 src/hotspot/share/opto/parse2.cpp             |  6 ++
 ...harpenTypeAfterIfMissingTypeCheckInfo.java | 57 +++++++++++++++++++
 2 files changed, 63 insertions(+)
 create mode 100644 test/hotspot/jtreg/compiler/reflection/TestSharpenTypeAfterIfMissingTypeCheckInfo.java

diff --git a/src/hotspot/share/opto/parse2.cpp b/src/hotspot/share/opto/parse2.cpp
index 7f41870ccea..a7c5398171b 100644
--- a/src/hotspot/share/opto/parse2.cpp
+++ b/src/hotspot/share/opto/parse2.cpp
@@ -1757,6 +1757,12 @@ static bool match_type_check(PhaseGVN& gvn,
     //   Bool(CmpP(LoadKlass(obj._klass), ConP(Foo.klass)), [eq])
     // or the narrowOop equivalent.
     (*obj) = extract_obj_from_klass_load(&gvn, val);
+    // Some klass comparisons are not directly in the form
+    // Bool(CmpP(LoadKlass(obj._klass), ConP(Foo.klass)), [eq]),
+    // e.g. Bool(CmpP(CastPP(LoadKlass(...)), ConP(klass)), [eq]).
+    // These patterns with nullable klasses arise from example from
+    // load_array_klass_from_mirror.
+    if (*obj == nullptr) { return false; }
     (*cast_type) = tcon->isa_klassptr()->as_instance_type();
     return true; // found
   }
diff --git a/test/hotspot/jtreg/compiler/reflection/TestSharpenTypeAfterIfMissingTypeCheckInfo.java b/test/hotspot/jtreg/compiler/reflection/TestSharpenTypeAfterIfMissingTypeCheckInfo.java
new file mode 100644
index 00000000000..7199ad74717
--- /dev/null
+++ b/test/hotspot/jtreg/compiler/reflection/TestSharpenTypeAfterIfMissingTypeCheckInfo.java
@@ -0,0 +1,57 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+/*
+ * @test
+ * @bug 8380579
+ * @summary Test that C2 match_type_check handles Bool(CmpP(CastPP(LoadKlass(...)), ConP(klass)), eq)
+ * @run main/othervm
+ *      -XX:-TieredCompilation
+ *      -Xcomp
+ *      -XX:CompileCommand=compileonly,${test.main.class}::test
+ *      ${test.main.class}
+ */
+
+package compiler.reflection;
+
+import java.lang.reflect.Array;
+
+public class TestSharpenTypeAfterIfMissingTypeCheckInfo {
+
+    public static void main(String[] args) {
+        for (int i = 0; i < 20_000; i++) {
+            test(i);
+        }
+    }
+
+    static boolean test(int i) {
+        Class componentType;
+        if (i % 2 == 0) {
+            componentType = Object.class;
+        } else {
+            componentType = Integer.class;
+        }
+        Object array = Array.newInstance(componentType, 1);
+        return array.getClass() == Object[].class;
+    }
+}
\ No newline at end of file

From 3dcf2a3bac491ba4344bde9701628c41b8b46749 Mon Sep 17 00:00:00 2001
From: Quan Anh Mai <qamai@openjdk.org>
Date: Wed, 1 Apr 2026 06:59:27 +0000
Subject: [PATCH 449/655] 8379790: MemNode::can_see_stored_value incorrectly
 walks past barriers

Reviewed-by: chagedorn, dfenacci
---
 src/hotspot/share/opto/memnode.cpp | 67 +++++++++++++++++-------------
 src/hotspot/share/opto/memnode.hpp |  1 +
 2 files changed, 39 insertions(+), 29 deletions(-)

diff --git a/src/hotspot/share/opto/memnode.cpp b/src/hotspot/share/opto/memnode.cpp
index c8723d6ec0f..9ec3402c701 100644
--- a/src/hotspot/share/opto/memnode.cpp
+++ b/src/hotspot/share/opto/memnode.cpp
@@ -1156,40 +1156,38 @@ Node* LoadNode::can_see_arraycopy_value(Node* st, PhaseGVN* phase) const {
   return nullptr;
 }
 
-
-//---------------------------can_see_stored_value------------------------------
 // This routine exists to make sure this set of tests is done the same
 // everywhere.  We need to make a coordinated change: first LoadNode::Ideal
 // will change the graph shape in a way which makes memory alive twice at the
 // same time (uses the Oracle model of aliasing), then some
 // LoadXNode::Identity will fold things back to the equivalence-class model
 // of aliasing.
-Node* MemNode::can_see_stored_value(Node* st, PhaseValues* phase) const {
+Node* LoadNode::can_see_stored_value_through_membars(Node* st, PhaseValues* phase) const {
   Node* ld_adr = in(MemNode::Address);
-  intptr_t ld_off = 0;
-  Node* ld_base = AddPNode::Ideal_base_and_offset(ld_adr, phase, ld_off);
-  Node* ld_alloc = AllocateNode::Ideal_allocation(ld_base);
   const TypeInstPtr* tp = phase->type(ld_adr)->isa_instptr();
   Compile::AliasType* atp = (tp != nullptr) ? phase->C->alias_type(tp) : nullptr;
-  // This is more general than load from boxing objects.
+
   if (skip_through_membars(atp, tp, phase->C->eliminate_boxing())) {
     uint alias_idx = atp->index();
     Node* result = nullptr;
     Node* current = st;
-    // Skip through chains of MemBarNodes checking the MergeMems for
-    // new states for the slice of this load.  Stop once any other
-    // kind of node is encountered.  Loads from final memory can skip
-    // through any kind of MemBar but normal loads shouldn't skip
-    // through MemBarAcquire since the could allow them to move out of
-    // a synchronized region. It is not safe to step over MemBarCPUOrder,
-    // because alias info above them may be inaccurate (e.g., due to
-    // mixed/mismatched unsafe accesses).
+    // Skip through chains of MemBarNodes checking the MergeMems for new states for the slice of
+    // this load. Stop once any other kind of node is encountered.
+    //
+    // In principle, folding a load is moving it up until it meets a matching store.
+    //
+    // store(ptr, v);          store(ptr, v);          store(ptr, v);
+    // membar1;          ->    membar1;          ->    load(ptr);
+    // membar2;                load(ptr);              membar1;
+    // load(ptr);              membar2;                membar2;
+    //
+    // So, we can decide which kinds of barriers we can walk past. It is not safe to step over
+    // MemBarCPUOrder, even if the memory is not rewritable, because alias info above them may be
+    // inaccurate (e.g., due to mixed/mismatched unsafe accesses).
     bool is_final_mem = !atp->is_rewritable();
     while (current->is_Proj()) {
       int opc = current->in(0)->Opcode();
-      if ((is_final_mem && (opc == Op_MemBarAcquire ||
-                            opc == Op_MemBarAcquireLock ||
-                            opc == Op_LoadFence)) ||
+      if ((is_final_mem && (opc == Op_MemBarAcquire || opc == Op_MemBarAcquireLock || opc == Op_LoadFence)) ||
           opc == Op_MemBarRelease ||
           opc == Op_StoreFence ||
           opc == Op_MemBarReleaseLock ||
@@ -1216,6 +1214,17 @@ Node* MemNode::can_see_stored_value(Node* st, PhaseValues* phase) const {
     }
   }
 
+  return can_see_stored_value(st, phase);
+}
+
+// If st is a store to the same location as this, return the stored value
+Node* MemNode::can_see_stored_value(Node* st, PhaseValues* phase) const {
+  Node* ld_adr = in(MemNode::Address);
+  intptr_t ld_off = 0;
+  Node* ld_base = AddPNode::Ideal_base_and_offset(ld_adr, phase, ld_off);
+  Node* ld_alloc = AllocateNode::Ideal_allocation(ld_base);
+  const TypeInstPtr* tp = phase->type(ld_adr)->isa_instptr();
+
   // Loop around twice in the case Load -> Initialize -> Store.
   // (See PhaseIterGVN::add_users_to_worklist, which knows about this case.)
   for (int trip = 0; trip <= 1; trip++) {
@@ -1344,7 +1353,7 @@ Node* LoadNode::Identity(PhaseGVN* phase) {
   // If the previous store-maker is the right kind of Store, and the store is
   // to the same address, then we are equal to the value stored.
   Node* mem = in(Memory);
-  Node* value = can_see_stored_value(mem, phase);
+  Node* value = can_see_stored_value_through_membars(mem, phase);
   if( value ) {
     // byte, short & char stores truncate naturally.
     // A load has to load the truncated value which requires
@@ -2042,7 +2051,7 @@ Node *LoadNode::Ideal(PhaseGVN *phase, bool can_reshape) {
     // (c) See if we can fold up on the spot, but don't fold up here.
     // Fold-up might require truncation (for LoadB/LoadS/LoadUS) or
     // just return a prior value, which is done by Identity calls.
-    if (can_see_stored_value(prev_mem, phase)) {
+    if (can_see_stored_value_through_membars(prev_mem, phase)) {
       // Make ready for step (d):
       set_req_X(MemNode::Memory, prev_mem, phase);
       return this;
@@ -2099,7 +2108,7 @@ const Type* LoadNode::Value(PhaseGVN* phase) const {
   Compile* C = phase->C;
 
   // If load can see a previous constant store, use that.
-  Node* value = can_see_stored_value(mem, phase);
+  Node* value = can_see_stored_value_through_membars(mem, phase);
   if (value != nullptr && value->is_Con()) {
     assert(value->bottom_type()->higher_equal(_type), "sanity");
     return value->bottom_type();
@@ -2350,7 +2359,7 @@ uint LoadNode::match_edge(uint idx) const {
 //
 Node* LoadBNode::Ideal(PhaseGVN* phase, bool can_reshape) {
   Node* mem = in(MemNode::Memory);
-  Node* value = can_see_stored_value(mem,phase);
+  Node* value = can_see_stored_value_through_membars(mem, phase);
   if (value != nullptr) {
     Node* narrow = Compile::narrow_value(T_BYTE, value, _type, phase, false);
     if (narrow != value) {
@@ -2363,7 +2372,7 @@ Node* LoadBNode::Ideal(PhaseGVN* phase, bool can_reshape) {
 
 const Type* LoadBNode::Value(PhaseGVN* phase) const {
   Node* mem = in(MemNode::Memory);
-  Node* value = can_see_stored_value(mem,phase);
+  Node* value = can_see_stored_value_through_membars(mem, phase);
   if (value != nullptr && value->is_Con() &&
       !value->bottom_type()->higher_equal(_type)) {
     // If the input to the store does not fit with the load's result type,
@@ -2384,7 +2393,7 @@ const Type* LoadBNode::Value(PhaseGVN* phase) const {
 //
 Node* LoadUBNode::Ideal(PhaseGVN* phase, bool can_reshape) {
   Node* mem = in(MemNode::Memory);
-  Node* value = can_see_stored_value(mem, phase);
+  Node* value = can_see_stored_value_through_membars(mem, phase);
   if (value != nullptr) {
     Node* narrow = Compile::narrow_value(T_BOOLEAN, value, _type, phase, false);
     if (narrow != value) {
@@ -2397,7 +2406,7 @@ Node* LoadUBNode::Ideal(PhaseGVN* phase, bool can_reshape) {
 
 const Type* LoadUBNode::Value(PhaseGVN* phase) const {
   Node* mem = in(MemNode::Memory);
-  Node* value = can_see_stored_value(mem,phase);
+  Node* value = can_see_stored_value_through_membars(mem, phase);
   if (value != nullptr && value->is_Con() &&
       !value->bottom_type()->higher_equal(_type)) {
     // If the input to the store does not fit with the load's result type,
@@ -2418,7 +2427,7 @@ const Type* LoadUBNode::Value(PhaseGVN* phase) const {
 //
 Node* LoadUSNode::Ideal(PhaseGVN* phase, bool can_reshape) {
   Node* mem = in(MemNode::Memory);
-  Node* value = can_see_stored_value(mem,phase);
+  Node* value = can_see_stored_value_through_membars(mem, phase);
   if (value != nullptr) {
     Node* narrow = Compile::narrow_value(T_CHAR, value, _type, phase, false);
     if (narrow != value) {
@@ -2431,7 +2440,7 @@ Node* LoadUSNode::Ideal(PhaseGVN* phase, bool can_reshape) {
 
 const Type* LoadUSNode::Value(PhaseGVN* phase) const {
   Node* mem = in(MemNode::Memory);
-  Node* value = can_see_stored_value(mem,phase);
+  Node* value = can_see_stored_value_through_membars(mem, phase);
   if (value != nullptr && value->is_Con() &&
       !value->bottom_type()->higher_equal(_type)) {
     // If the input to the store does not fit with the load's result type,
@@ -2452,7 +2461,7 @@ const Type* LoadUSNode::Value(PhaseGVN* phase) const {
 //
 Node* LoadSNode::Ideal(PhaseGVN* phase, bool can_reshape) {
   Node* mem = in(MemNode::Memory);
-  Node* value = can_see_stored_value(mem,phase);
+  Node* value = can_see_stored_value_through_membars(mem, phase);
   if (value != nullptr) {
     Node* narrow = Compile::narrow_value(T_SHORT, value, _type, phase, false);
     if (narrow != value) {
@@ -2465,7 +2474,7 @@ Node* LoadSNode::Ideal(PhaseGVN* phase, bool can_reshape) {
 
 const Type* LoadSNode::Value(PhaseGVN* phase) const {
   Node* mem = in(MemNode::Memory);
-  Node* value = can_see_stored_value(mem,phase);
+  Node* value = can_see_stored_value_through_membars(mem, phase);
   if (value != nullptr && value->is_Con() &&
       !value->bottom_type()->higher_equal(_type)) {
     // If the input to the store does not fit with the load's result type,
diff --git a/src/hotspot/share/opto/memnode.hpp b/src/hotspot/share/opto/memnode.hpp
index 7fa238f574d..8efb5521e7c 100644
--- a/src/hotspot/share/opto/memnode.hpp
+++ b/src/hotspot/share/opto/memnode.hpp
@@ -266,6 +266,7 @@ protected:
   const Type* const _type;      // What kind of value is loaded?
 
   virtual Node* find_previous_arraycopy(PhaseValues* phase, Node* ld_alloc, Node*& mem, bool can_see_stored_value) const;
+  Node* can_see_stored_value_through_membars(Node* st, PhaseValues* phase) const;
 public:
 
   LoadNode(Node *c, Node *mem, Node *adr, const TypePtr* at, const Type *rt, MemOrd mo, ControlDependency control_dependency)

From 32e8aa45828a7dbaf5ed558efd5870c9c5a149de Mon Sep 17 00:00:00 2001
From: Andrew Dinn <adinn@openjdk.org>
Date: Wed, 1 Apr 2026 07:47:17 +0000
Subject: [PATCH 450/655] 8379811: Disable AOTCodeCache if Assembly intrinsics
 use differs from Production use

Reviewed-by: kvn, asmehra
---
 src/hotspot/share/code/aotCodeCache.cpp | 312 ++++++++++++++++++++++--
 src/hotspot/share/code/aotCodeCache.hpp |  94 ++++++-
 2 files changed, 384 insertions(+), 22 deletions(-)

diff --git a/src/hotspot/share/code/aotCodeCache.cpp b/src/hotspot/share/code/aotCodeCache.cpp
index 030e2684bfc..938cf4eaa41 100644
--- a/src/hotspot/share/code/aotCodeCache.cpp
+++ b/src/hotspot/share/code/aotCodeCache.cpp
@@ -380,37 +380,110 @@ void AOTCodeCache::init_early_c1_table() {
   }
 }
 
+// macro to record which flags are set -- flag_type selects the
+// relevant accessor e.g. set_flag, set_x86_flag, set_x86_use_flag.
+// n.b. flag_enum_name and global_flag_name are both needed because we
+// don't have consistent conventions for naming global flags e.g.
+// EnableContended vs UseMulAddIntrinsic vs UseCRC32Intrinsics
+
+#define RECORD_FLAG(flag_type, flag_enum_name, global_flag_name)        \
+  if (global_flag_name) {                                               \
+    set_ ## flag_type ## flag(flag_enum_name);                          \
+  }
+
 void AOTCodeCache::Config::record(uint cpu_features_offset) {
   _flags = 0;
 #ifdef ASSERT
-  _flags |= debugVM;
+  set_flag(debugVM);
 #endif
-  if (UseCompressedOops) {
-    _flags |= compressedOops;
-  }
-  if (UseTLAB) {
-    _flags |= useTLAB;
-  }
+  RECORD_FLAG(, compressedOops, UseCompressedOops);
+  RECORD_FLAG(, useTLAB, UseTLAB);
   if (JavaAssertions::systemClassDefault()) {
-    _flags |= systemClassAssertions;
+    set_flag(systemClassAssertions);
   }
   if (JavaAssertions::userClassDefault()) {
-    _flags |= userClassAssertions;
-  }
-  if (EnableContended) {
-    _flags |= enableContendedPadding;
-  }
-  if (RestrictContended) {
-    _flags |= restrictContendedPadding;
+    set_flag(userClassAssertions);
   }
+  RECORD_FLAG(, enableContendedPadding, EnableContended);
+  RECORD_FLAG(, restrictContendedPadding, RestrictContended);
+
   _compressedOopShift    = CompressedOops::shift();
   _compressedOopBase     = CompressedOops::base();
   _compressedKlassShift  = CompressedKlassPointers::shift();
   _contendedPaddingWidth = ContendedPaddingWidth;
   _gc                    = (uint)Universe::heap()->kind();
+  _optoLoopAlignment               = (uint)OptoLoopAlignment;
+  _codeEntryAlignment              = (uint)CodeEntryAlignment;
+  _allocatePrefetchLines           = (uint)AllocatePrefetchLines;
+  _allocateInstancePrefetchLines   = (uint)AllocateInstancePrefetchLines;
+  _allocatePrefetchDistance        = (uint)AllocatePrefetchDistance;
+  _allocatePrefetchStepSize        = (uint)AllocatePrefetchStepSize;
+  _use_intrinsics_flags = 0;
+  RECORD_FLAG(use_, useCRC32, UseCRC32Intrinsics);
+  RECORD_FLAG(use_, useCRC32C, UseCRC32CIntrinsics);
+#ifdef COMPILER2
+  _maxVectorSize                   = (uint)MaxVectorSize;
+  _arrayOperationPartialInlineSize = (uint)ArrayOperationPartialInlineSize;
+  RECORD_FLAG(use_, useMultiplyToLen, UseMultiplyToLenIntrinsic);
+  RECORD_FLAG(use_, useSquareToLen, UseSquareToLenIntrinsic);
+  RECORD_FLAG(use_, useMulAdd, UseMulAddIntrinsic);
+  RECORD_FLAG(use_, useMontgomeryMultiply, UseMontgomeryMultiplyIntrinsic);
+  RECORD_FLAG(use_, useMontgomerySquare, UseMontgomerySquareIntrinsic);
+#endif // COMPILER2
+  RECORD_FLAG(use_, useChaCha20, UseChaCha20Intrinsics);
+  RECORD_FLAG(use_, useDilithium, UseDilithiumIntrinsics);
+  RECORD_FLAG(use_, useKyber, UseKyberIntrinsics);
+  RECORD_FLAG(use_, useBASE64, UseBASE64Intrinsics);
+  RECORD_FLAG(use_, useAdler32, UseAdler32Intrinsics);
+  RECORD_FLAG(use_, useAES, UseAESIntrinsics);
+  RECORD_FLAG(use_, useAESCTR, UseAESCTRIntrinsics);
+  RECORD_FLAG(use_, useGHASH, UseGHASHIntrinsics);
+  RECORD_FLAG(use_, useMD5, UseMD5Intrinsics);
+  RECORD_FLAG(use_, useSHA1, UseSHA1Intrinsics);
+  RECORD_FLAG(use_, useSHA256, UseSHA256Intrinsics);
+  RECORD_FLAG(use_, useSHA512, UseSHA512Intrinsics);
+  RECORD_FLAG(use_, useSHA3, UseSHA3Intrinsics);
+  RECORD_FLAG(use_, usePoly1305, UsePoly1305Intrinsics);
+  RECORD_FLAG(use_, useVectorizedMismatch,UseVectorizedMismatchIntrinsic );
+  RECORD_FLAG(use_, useSecondarySupersTable, UseSecondarySupersTable);
+#if defined(X86) && !defined(ZERO)
+  _avx3threshold                   = (uint)AVX3Threshold;
+  _useAVX                          = (uint)UseAVX;
+  _x86_flags                       = 0;
+  RECORD_FLAG(x86_, x86_enableX86ECoreOpts, EnableX86ECoreOpts);
+  RECORD_FLAG(x86_, x86_useUnalignedLoadStores, UseUnalignedLoadStores);
+  RECORD_FLAG(x86_, x86_useAPX, UseAPX);
+
+  _x86_use_intrinsics_flags            = 0;
+  RECORD_FLAG(x86_use_, x86_useLibm, UseLibmIntrinsic);
+  RECORD_FLAG(x86_use_, x86_useIntPoly, UseIntPolyIntrinsics);
+#endif // defined(X86) && !defined(ZERO)
+#if defined(AARCH64)  && !defined(ZERO)
+  _prefetchCopyIntervalInBytes     = (uint)PrefetchCopyIntervalInBytes;
+  _blockZeroingLowLimit            = (uint)BlockZeroingLowLimit;
+  _softwarePrefetchHintDistance    = (uint)SoftwarePrefetchHintDistance;
+  _useSVE                          = (uint)UseSVE;
+  _aarch64_flags                   = 0;
+  RECORD_FLAG(aarch64_, aarch64_avoidUnalignedAccesses, AvoidUnalignedAccesses);
+  RECORD_FLAG(aarch64_, aarch64_useSIMDForMemoryOps, UseSIMDForMemoryOps);
+  RECORD_FLAG(aarch64_, aarch64_useSIMDForArrayEquals, UseSIMDForArrayEquals);
+  RECORD_FLAG(aarch64_, aarch64_useSIMDForSHA3, UseSIMDForSHA3Intrinsic);
+  RECORD_FLAG(aarch64_, aarch64_useLSE, UseLSE);
+
+  _aarch64_use_intrinsics_flags     = 0;
+  RECORD_FLAG(aarch64_use_, aarch64_useBlockZeroing, UseBlockZeroing);
+  RECORD_FLAG(aarch64_use_, aarch64_useSIMDForBigIntegerShift, UseSIMDForBigIntegerShiftIntrinsics);
+  RECORD_FLAG(aarch64_use_, aarch64_useSimpleArrayEquals, UseSimpleArrayEquals);
+  RECORD_FLAG(aarch64_use_, aarch64_useSecondarySupersCache, UseSecondarySupersCache);
+#endif // defined(AARCH64) && !defined(ZERO)
+#if INCLUDE_JVMCI
+  _enableJVMCI                     = (uint)EnableJVMCI;
+#endif
   _cpu_features_offset   = cpu_features_offset;
 }
 
+#undef RECORD_FLAG
+
 bool AOTCodeCache::Config::verify_cpu_features(AOTCodeCache* cache) const {
   LogStreamHandle(Debug, aot, codecache, init) log;
   uint offset = _cpu_features_offset;
@@ -451,15 +524,27 @@ bool AOTCodeCache::Config::verify_cpu_features(AOTCodeCache* cache) const {
   return true;
 }
 
+// macro to do *standard* flag eq checks -- flag_type selects the
+// relevant accessor e.g. test_flag, test_x86_flag, test_x86_use_flag.
+// n.b. flag_enum_name and global_flag_name are both needed because we
+// don't have consistent conventions for naming global flags e.g.
+// EnableContended vs UseMulAddIntrinsic vs UseCRC32Intrinsics
+
+#define CHECK_FLAG(flag_type, flag_enum_name, global_flag_name)         \
+  if (test_ ## flag_type ## flag(flag_enum_name) != global_flag_name) {   \
+    log_debug(aot, codecache, init)("AOT Code Cache disabled: it was created with " # global_flag_name " = %s vs current %s" , (global_flag_name ? "false" : "true"), (global_flag_name ? "true" : "false")); \
+    return false;                                                       \
+  }
+
 bool AOTCodeCache::Config::verify(AOTCodeCache* cache) const {
   // First checks affect all cached AOT code
 #ifdef ASSERT
-  if ((_flags & debugVM) == 0) {
+  if (!test_flag(debugVM)) {
     log_debug(aot, codecache, init)("AOT Code Cache disabled: it was created by product VM, it can't be used by debug VM");
     return false;
   }
 #else
-  if ((_flags & debugVM) != 0) {
+  if (test_flag(debugVM)) {
     log_debug(aot, codecache, init)("AOT Code Cache disabled: it was created by debug VM, it can't be used by product VM");
     return false;
   }
@@ -476,9 +561,195 @@ bool AOTCodeCache::Config::verify(AOTCodeCache* cache) const {
     return false;
   }
 
+  // check CPU features before checking flags that may be
+  // auto-configured in response to them
+  if (!verify_cpu_features(cache)) {
+    return false;
+  }
+
+  // change to EnableContended can affect validity of nmethods
+  CHECK_FLAG(, enableContendedPadding, EnableContended);
+  // change to RestrictContended can affect validity of nmethods
+  CHECK_FLAG(, restrictContendedPadding, RestrictContended);
+
+  // Tests for config options which might affect validity of adapters,
+  // stubs or nmethods. Currently we take a pessemistic stand and
+  // drop the whole cache if any of these are changed.
+
+  // change to opto alignment can affect performance of array copy
+  // stubs and nmethods
+  if (_optoLoopAlignment != (uint)OptoLoopAlignment) {
+    log_debug(aot, codecache, init)("AOT Code Cache disabled: it was created with OptoLoopAlignment = %d vs current %d", (int)_optoLoopAlignment, (int)OptoLoopAlignment);
+    return false;
+  }
+
+  // change to CodeEntryAlignment can affect performance of array
+  // copy stubs and nmethods
+  if (_codeEntryAlignment != CodeEntryAlignment) {
+    log_debug(aot, codecache, init)("AOT Code Cache disabled: it was created with CodeEntryAlignment = %d vs current %d", _codeEntryAlignment, CodeEntryAlignment);
+    return false;
+  }
+
+  // changing Prefetch configuration can affect validity of nmethods
+  // and stubs
+  if (_allocatePrefetchLines != (uint)AllocatePrefetchLines) {
+    log_debug(aot, codecache, init)("AOT Code Cache disabled: it was created with  = %d vs current %d", (int)_allocatePrefetchLines, (int)AllocatePrefetchLines);
+    return false;
+  }
+  if (_allocateInstancePrefetchLines != (uint)AllocateInstancePrefetchLines) {
+    log_debug(aot, codecache, init)("AOT Code Cache disabled: it was created with  = %d vs current %d", (int)_allocateInstancePrefetchLines, (int)AllocateInstancePrefetchLines);
+    return false;
+  }
+  if (_allocatePrefetchDistance != (uint)AllocatePrefetchDistance) {
+    log_debug(aot, codecache, init)("AOT Code Cache disabled: it was created with  = %d vs current %d", (int)_allocatePrefetchDistance, (int)AllocatePrefetchDistance);
+    return false;
+  }
+  if (_allocatePrefetchStepSize != (uint)AllocatePrefetchStepSize) {
+    log_debug(aot, codecache, init)("AOT Code Cache disabled: it was created with  = %d vs current %d", (int)_allocatePrefetchStepSize, (int)AllocatePrefetchStepSize);
+    return false;
+  }
+
+  // check intrinsic use settings are compatible
+
+  CHECK_FLAG(use_, useCRC32, UseCRC32Intrinsics);
+  CHECK_FLAG(use_, useCRC32C, UseCRC32CIntrinsics);
+
+#ifdef COMPILER2
+  // change to MaxVectorSize can affect validity of array copy/fill
+  // stubs
+  if (_maxVectorSize != (uint)MaxVectorSize) {
+    log_debug(aot, codecache, init)("AOT Code Cache disabled: it was created with MaxVectorSize = %d vs current %d", (int)_maxVectorSize, (int)MaxVectorSize);
+    return false;
+  }
+
+  // changing ArrayOperationPartialInlineSize can affect validity of
+  // nmethods and stubs
+  if (_arrayOperationPartialInlineSize != (uint)ArrayOperationPartialInlineSize) {
+    log_debug(aot, codecache, init)("AOT Code Cache disabled: it was created with ArrayOperationPartialInlineSize = %d vs current %d", (int)_arrayOperationPartialInlineSize, (int)ArrayOperationPartialInlineSize);
+    return false;
+  }
+  CHECK_FLAG(use_, useMultiplyToLen, UseMultiplyToLenIntrinsic);
+  CHECK_FLAG(use_, useSquareToLen, UseSquareToLenIntrinsic);
+  CHECK_FLAG(use_, useMulAdd, UseMulAddIntrinsic);
+  CHECK_FLAG(use_, useMontgomeryMultiply,UseMontgomeryMultiplyIntrinsic);
+  CHECK_FLAG(use_, useMontgomerySquare, UseMontgomerySquareIntrinsic);
+#endif // COMPILER2
+  CHECK_FLAG(use_, useChaCha20, UseChaCha20Intrinsics);
+  CHECK_FLAG(use_, useDilithium, UseDilithiumIntrinsics);
+  CHECK_FLAG(use_, useKyber, UseKyberIntrinsics);
+  CHECK_FLAG(use_, useBASE64, UseBASE64Intrinsics);
+  CHECK_FLAG(use_, useAES, UseAESIntrinsics);
+  CHECK_FLAG(use_, useAESCTR, UseAESCTRIntrinsics);
+  CHECK_FLAG(use_, useGHASH, UseGHASHIntrinsics);
+  CHECK_FLAG(use_, useMD5, UseMD5Intrinsics);
+  CHECK_FLAG(use_, useSHA1, UseSHA1Intrinsics);
+  CHECK_FLAG(use_, useSHA256, UseSHA256Intrinsics);
+  CHECK_FLAG(use_, useSHA512, UseSHA512Intrinsics);
+  CHECK_FLAG(use_, useSHA3, UseSHA3Intrinsics);
+  CHECK_FLAG(use_, usePoly1305, UsePoly1305Intrinsics);
+  CHECK_FLAG(use_, useVectorizedMismatch, UseVectorizedMismatchIntrinsic);
+  CHECK_FLAG(use_, useSecondarySupersTable, UseSecondarySupersTable);
+
+#if defined(X86) && !defined(ZERO)
+  // change to AVX3Threshold may affect validity of array copy stubs
+  // and nmethods
+  if (_avx3threshold != (uint)AVX3Threshold) {
+    log_debug(aot, codecache, init)("AOT Code Cache disabled: it was created with AVX3Threshold = %d vs current %d", (int)_avx3threshold, AVX3Threshold);
+    return false;
+  }
+
+  // change to UseAVX may affect validity of array copy stubs and
+  // nmethods
+  if (_useAVX != (uint)UseAVX) {
+    log_debug(aot, codecache, init)("AOT Code Cache disabled: it was created with useAVX = %d vs current %d", (int)_useAVX, UseAVX);
+    return false;
+  }
+
+  // change to EnableX86ECoreOpts may affect validity of nmethods
+  CHECK_FLAG(x86_, x86_enableX86ECoreOpts, EnableX86ECoreOpts);
+
+  // switching off UseUnalignedLoadStores can affect validity of fill
+  // stubs
+  if (test_x86_flag(x86_useUnalignedLoadStores) && !UseUnalignedLoadStores) {
+    log_debug(aot, codecache, init)("AOT Code Cache disabled: it was created with UseUnalignedLoadStores = true vs current = false");
+    return false;
+  }
+
+  // change to UseAPX can affect validity of nmethods and stubs
+  CHECK_FLAG(x86_, x86_useAPX, UseAPX);
+
+  // check x86-specific intrinsic use settings are compatible
+
+  CHECK_FLAG(x86_use_, x86_useLibm, UseLibmIntrinsic);
+  CHECK_FLAG(x86_use_, x86_useIntPoly, UseIntPolyIntrinsics);
+#endif // defined(X86) && !defined(ZERO)
+
+#if defined(AARCH64) && !defined(ZERO)
+  // change to PrefetchCopyIntervalInBytes may affect validity of
+  // array copy stubs
+  if (_prefetchCopyIntervalInBytes != (uint)PrefetchCopyIntervalInBytes) {
+    log_debug(aot, codecache, init)("AOT Code Cache disabled: it was created with PrefetchCopyIntervalInBytes = %d vs current %d", (int)_prefetchCopyIntervalInBytes, (int)PrefetchCopyIntervalInBytes);
+    return false;
+  }
+
+  // change to BlockZeroingLowLimit may affect validity of array fill
+  // stubs
+  if (_blockZeroingLowLimit != (uint)BlockZeroingLowLimit) {
+    log_debug(aot, codecache, init)("AOT Code Cache disabled: it was created with BlockZeroingLowLimit = %d vs current %d", (int)_blockZeroingLowLimit, (int)BlockZeroingLowLimit);
+    return false;
+  }
+
+  // change to SoftwarePrefetchHintDistance may affect validity of array fill
+  // stubs
+  if (_softwarePrefetchHintDistance != (uint)SoftwarePrefetchHintDistance) {
+    log_debug(aot, codecache, init)("AOT Code Cache disabled: it was created with SoftwarePrefetchHintDistance = %d vs current %d", (int)_softwarePrefetchHintDistance, (int)SoftwarePrefetchHintDistance);
+    return false;
+  }
+
+  // change to UseSVE may affect validity of stubs and nmethods
+  if (_useSVE != (uint)UseSVE) {
+  log_debug(aot, codecache, init)("AOT Code Cache disabled: it was created with UseSVE = %d vs current %d",(int)_useSVE, UseSVE);
+    return false;
+  }
+
+  // switching on AvoidUnalignedAccesses may affect validity of array
+  // copy stubs and nmethods
+  if (!test_aarch64_flag(aarch64_avoidUnalignedAccesses) && AvoidUnalignedAccesses) {
+    log_debug(aot, codecache, init)("AOT Code Cache disabled: it was created with AvoidUnalignedAccesses = false vs current = true");
+    return false;
+  }
+
+  // change to UseSIMDForMemoryOps may affect validity of array
+  // copy stubs and nmethods
+  CHECK_FLAG(aarch64_, aarch64_useSIMDForMemoryOps, UseSIMDForMemoryOps);
+  // change to UseSIMDForArrayEquals may affect validity of array
+  // copy stubs and nmethods
+  CHECK_FLAG(aarch64_, aarch64_useSIMDForArrayEquals, UseSIMDForArrayEquals);
+  // change to useSIMDForSHA3 may affect validity of SHA3 stubs
+  CHECK_FLAG(aarch64_, aarch64_useSIMDForSHA3, UseSIMDForSHA3Intrinsic);
+  // change to UseLSE may affect validity of stubs and nmethods
+  CHECK_FLAG(aarch64_, aarch64_useLSE, UseLSE);
+
+  // check aarch64-specific intrinsic use settings are compatible
+
+  CHECK_FLAG(aarch64_use_, aarch64_useBlockZeroing, UseBlockZeroing);
+  CHECK_FLAG(aarch64_use_, aarch64_useSIMDForBigIntegerShift, UseSIMDForBigIntegerShiftIntrinsics);
+  CHECK_FLAG(aarch64_use_, aarch64_useSimpleArrayEquals, UseSimpleArrayEquals);
+  CHECK_FLAG(aarch64_use_, aarch64_useSecondarySupersCache, UseSecondarySupersCache);
+#endif // defined(AARCH64) && !defined(ZERO)
+
+#if INCLUDE_JVMCI
+  // change to EnableJVMCI will affect validity of adapters and
+  // nmethods
+  if (_enableJVMCI != (uint)EnableJVMCI) {
+    log_debug(aot, codecache, init)("AOT Code Cache disabled: it was created with EnableJVMCI = %s vs current %s", (_enableJVMCI ? "true" : "false"), (EnableJVMCI ? "true" : "false"));
+    return false;
+  }
+#endif // INCLUDE_JVMCI
+
   // The following checks do not affect AOT adapters caching
 
-  if (((_flags & compressedOops) != 0) != UseCompressedOops) {
+  if (test_flag(compressedOops) != UseCompressedOops) {
     log_debug(aot, codecache, init)("AOT Code Cache disabled: it was created with UseCompressedOops = %s", UseCompressedOops ? "false" : "true");
     AOTStubCaching = false;
   }
@@ -493,12 +764,11 @@ bool AOTCodeCache::Config::verify(AOTCodeCache* cache) const {
     AOTStubCaching = false;
   }
 
-  if (!verify_cpu_features(cache)) {
-    return false;
-  }
   return true;
 }
 
+#undef TEST_FLAG
+
 bool AOTCodeCache::Header::verify(uint load_size) const {
   if (_version != AOT_CODE_VERSION) {
     log_debug(aot, codecache, init)("AOT Code Cache disabled: different AOT Code version %d vs %d recorded in AOT Code header", AOT_CODE_VERSION, _version);
diff --git a/src/hotspot/share/code/aotCodeCache.hpp b/src/hotspot/share/code/aotCodeCache.hpp
index b0d39ff3e08..52b0adfba48 100644
--- a/src/hotspot/share/code/aotCodeCache.hpp
+++ b/src/hotspot/share/code/aotCodeCache.hpp
@@ -173,6 +173,16 @@ protected:
     uint _compressedKlassShift;
     uint _contendedPaddingWidth;
     uint _gc;
+    uint _optoLoopAlignment;
+    uint _codeEntryAlignment;
+    uint _allocatePrefetchLines;
+    uint _allocateInstancePrefetchLines;
+    uint _allocatePrefetchDistance;
+    uint _allocatePrefetchStepSize;
+#ifdef COMPILER2
+    uint _maxVectorSize;
+    uint _arrayOperationPartialInlineSize;
+#endif // COMPILER2
     enum Flags {
       none                     = 0,
       debugVM                  = 1,
@@ -184,8 +194,90 @@ protected:
       restrictContendedPadding = 64
     };
     uint _flags;
+    enum IntrinsicsUseFlags {
+      use_none                = 0,
+      useCRC32                = 1 << 0,
+      useCRC32C               = 1 << 1,
+      useMultiplyToLen        = 1 << 2,
+      useSquareToLen          = 1 << 3,
+      useMulAdd               = 1 << 4,
+      useMontgomeryMultiply   = 1 << 5,
+      useMontgomerySquare     = 1 << 6,
+      useChaCha20             = 1 << 7,
+      useDilithium            = 1 << 8,
+      useKyber                = 1 << 9,
+      useBASE64               = 1 << 10,
+      useAdler32              = 1 << 11,
+      useAES                  = 1 << 12,
+      useAESCTR               = 1 << 13,
+      useGHASH                = 1 << 14,
+      useMD5                  = 1 << 15,
+      useSHA1                 = 1 << 16,
+      useSHA256               = 1 << 17,
+      useSHA512               = 1 << 18,
+      useSHA3                 = 1 << 19,
+      usePoly1305             = 1 << 20,
+      useVectorizedMismatch   = 1 << 21,
+      useSecondarySupersTable = 1 << 22,
+    };
+    uint _use_intrinsics_flags;
+    bool test_flag(enum Flags flag) const { return (_flags & flag) != 0; }
+    bool test_use_flag(enum IntrinsicsUseFlags flag) const { return (_use_intrinsics_flags & flag) != 0; }
+    void set_flag(enum Flags flag) { _flags |= flag; }
+    void set_use_flag(enum IntrinsicsUseFlags flag) { _use_intrinsics_flags |= flag; }
+#if defined(X86) && !defined(ZERO)
+    uint _avx3threshold;
+    uint _useAVX;
+    enum X86Flags {
+      x86_none                   = 0,
+      x86_enableX86ECoreOpts     = 1,
+      x86_useUnalignedLoadStores = 2,
+      x86_useAPX                 = 4
+    };
+    uint _x86_flags;
+    enum X86IntrinsicsUseFlags {
+      x86_use_none              = 0,
+      x86_useLibm               = 1 << 1,
+      x86_useIntPoly            = 1 << 2,
+    };
+    uint _x86_use_intrinsics_flags;
+    bool test_x86_flag(enum X86Flags flag) const { return (_x86_flags & flag) != 0; }
+    bool test_x86_use_flag(enum X86IntrinsicsUseFlags flag) const { return (_x86_use_intrinsics_flags & flag) != 0; }
+    void set_x86_flag(enum X86Flags flag) { _x86_flags |= flag; }
+    void set_x86_use_flag(enum X86IntrinsicsUseFlags flag) { _x86_use_intrinsics_flags |= flag; }
+#endif // defined(X86) && !defined(ZERO)
+#if defined(AARCH64) && !defined(ZERO)
+    // this is global but x86 does not use it and aarch64 does
+    uint _prefetchCopyIntervalInBytes;
+    uint _blockZeroingLowLimit;
+    uint _softwarePrefetchHintDistance;
+    uint _useSVE;
+    enum AArch64Flags {
+      aarch64_none = 0,
+      aarch64_avoidUnalignedAccesses = 1,
+      aarch64_useSIMDForMemoryOps    = 2,
+      aarch64_useSIMDForArrayEquals  = 4,
+      aarch64_useSIMDForSHA3         = 8,
+      aarch64_useLSE                 = 16,
+    };
+    uint _aarch64_flags;
+    enum AArch64IntrinsicsUseFlags {
+      aarch64_use_none                  = 0,
+      aarch64_useBlockZeroing           = 1 << 0,
+      aarch64_useSIMDForBigIntegerShift = 1 << 1,
+      aarch64_useSimpleArrayEquals      = 1 << 2,
+      aarch64_useSecondarySupersCache   = 1 << 3,
+    };
+    uint _aarch64_use_intrinsics_flags;
+    bool test_aarch64_flag(enum AArch64Flags flag) const { return (_aarch64_flags & flag) != 0; }
+    bool test_aarch64_use_flag(enum AArch64IntrinsicsUseFlags flag) const { return (_aarch64_use_intrinsics_flags & flag) != 0; }
+    void set_aarch64_flag(enum AArch64Flags flag) { _aarch64_flags |= flag; }
+    void set_aarch64_use_flag(enum AArch64IntrinsicsUseFlags flag) { _aarch64_use_intrinsics_flags |= flag; }
+#endif // defined(AARCH64) && !defined(ZERO)
+#if INCLUDE_JVMCI
+    uint _enableJVMCI;
+#endif // INCLUDE_JVMCI
     uint _cpu_features_offset; // offset in the cache where cpu features are stored
-
   public:
     void record(uint cpu_features_offset);
     bool verify_cpu_features(AOTCodeCache* cache) const;

From b58d1ad1ee9aa30d97286b3b78054488e083c351 Mon Sep 17 00:00:00 2001
From: Thomas Schatzl <tschatzl@openjdk.org>
Date: Wed, 1 Apr 2026 08:14:59 +0000
Subject: [PATCH 451/655] 8372016: G1: Root scanning not yielding to safepoints
 causes crashes

Reviewed-by: iwalulya, ayang
---
 src/hotspot/share/gc/g1/g1CollectedHeap.cpp   |   1 +
 src/hotspot/share/gc/g1/g1ConcurrentMark.cpp  | 212 +++++++++---------
 src/hotspot/share/gc/g1/g1ConcurrentMark.hpp  |  71 +++---
 .../share/gc/g1/g1ConcurrentMarkThread.cpp    |   7 +-
 src/hotspot/share/gc/g1/g1GCPhaseTimes.cpp    |   6 +-
 src/hotspot/share/gc/g1/g1GCPhaseTimes.hpp    |  10 +-
 src/hotspot/share/gc/g1/g1VMOperations.cpp    |   5 +-
 src/hotspot/share/gc/g1/g1YoungCollector.cpp  |  18 +-
 src/hotspot/share/gc/g1/g1YoungCollector.hpp  |   2 +-
 src/hotspot/share/runtime/mutexLocker.cpp     |   2 -
 src/hotspot/share/runtime/mutexLocker.hpp     |   1 -
 11 files changed, 165 insertions(+), 170 deletions(-)

diff --git a/src/hotspot/share/gc/g1/g1CollectedHeap.cpp b/src/hotspot/share/gc/g1/g1CollectedHeap.cpp
index e6dd91df84b..fe286793ae7 100644
--- a/src/hotspot/share/gc/g1/g1CollectedHeap.cpp
+++ b/src/hotspot/share/gc/g1/g1CollectedHeap.cpp
@@ -1652,6 +1652,7 @@ jint G1CollectedHeap::initialize() {
 }
 
 void G1CollectedHeap::stop() {
+  assert_not_at_safepoint();
   // Stop all concurrent threads. We do this to make sure these threads
   // do not continue to execute and access resources (e.g. logging)
   // that are destroyed during shutdown.
diff --git a/src/hotspot/share/gc/g1/g1ConcurrentMark.cpp b/src/hotspot/share/gc/g1/g1ConcurrentMark.cpp
index 1caa8dbdd06..84a0b7588ef 100644
--- a/src/hotspot/share/gc/g1/g1ConcurrentMark.cpp
+++ b/src/hotspot/share/gc/g1/g1ConcurrentMark.cpp
@@ -372,63 +372,56 @@ void G1CMMarkStack::set_empty() {
 G1CMRootMemRegions::G1CMRootMemRegions(uint const max_regions) :
     _root_regions(MemRegion::create_array(max_regions, mtGC)),
     _max_regions(max_regions),
-    _num_root_regions(0),
-    _claimed_root_regions(0),
-    _scan_in_progress(false),
-    _should_abort(false) { }
+    _num_regions(0),
+    _num_claimed_regions(0) { }
 
 G1CMRootMemRegions::~G1CMRootMemRegions() {
   MemRegion::destroy_array(_root_regions, _max_regions);
 }
 
 void G1CMRootMemRegions::reset() {
-  _num_root_regions.store_relaxed(0);
+  assert_at_safepoint();
+  assert(G1CollectedHeap::heap()->collector_state()->is_in_concurrent_start_gc(), "must be");
+
+  _num_regions.store_relaxed(0);
+  _num_claimed_regions.store_relaxed(0);
 }
 
 void G1CMRootMemRegions::add(HeapWord* start, HeapWord* end) {
   assert_at_safepoint();
-  size_t idx = _num_root_regions.fetch_then_add(1u);
-  assert(idx < _max_regions, "Trying to add more root MemRegions than there is space %zu", _max_regions);
+  uint idx = _num_regions.fetch_then_add(1u);
+  assert(idx < _max_regions, "Trying to add more root MemRegions than there is space %u", _max_regions);
   assert(start != nullptr && end != nullptr && start <= end, "Start (" PTR_FORMAT ") should be less or equal to "
          "end (" PTR_FORMAT ")", p2i(start), p2i(end));
   _root_regions[idx].set_start(start);
   _root_regions[idx].set_end(end);
 }
 
-void G1CMRootMemRegions::prepare_for_scan() {
-  assert(!scan_in_progress(), "pre-condition");
-
-  _scan_in_progress.store_relaxed(num_root_regions() > 0);
-
-  _claimed_root_regions.store_relaxed(0);
-  _should_abort.store_relaxed(false);
-}
-
 const MemRegion* G1CMRootMemRegions::claim_next() {
-  if (_should_abort.load_relaxed()) {
-    // If someone has set the should_abort flag, we return null to
-    // force the caller to bail out of their loop.
+  uint local_num_regions = num_regions();
+  if (num_claimed_regions() >= local_num_regions) {
     return nullptr;
   }
 
-  uint local_num_root_regions = num_root_regions();
-  if (_claimed_root_regions.load_relaxed() >= local_num_root_regions) {
-    return nullptr;
-  }
-
-  size_t claimed_index = _claimed_root_regions.fetch_then_add(1u);
-  if (claimed_index < local_num_root_regions) {
+  uint claimed_index = _num_claimed_regions.fetch_then_add(1u);
+  if (claimed_index < local_num_regions) {
     return &_root_regions[claimed_index];
   }
   return nullptr;
 }
 
-uint G1CMRootMemRegions::num_root_regions() const {
-  return (uint)_num_root_regions.load_relaxed();
+bool G1CMRootMemRegions::work_completed() const {
+  return num_remaining_regions() == 0;
+}
+
+uint G1CMRootMemRegions::num_remaining_regions() const {
+  uint total = num_regions();
+  uint claimed = num_claimed_regions();
+  return (total > claimed) ? total - claimed : 0;
 }
 
 bool G1CMRootMemRegions::contains(const MemRegion mr) const {
-  uint local_num_root_regions = num_root_regions();
+  uint local_num_root_regions = num_regions();
   for (uint i = 0; i < local_num_root_regions; i++) {
     if (_root_regions[i].equals(mr)) {
       return true;
@@ -437,42 +430,6 @@ bool G1CMRootMemRegions::contains(const MemRegion mr) const {
   return false;
 }
 
-void G1CMRootMemRegions::notify_scan_done() {
-  MutexLocker x(G1RootRegionScan_lock, Mutex::_no_safepoint_check_flag);
-  _scan_in_progress.store_relaxed(false);
-  G1RootRegionScan_lock->notify_all();
-}
-
-void G1CMRootMemRegions::cancel_scan() {
-  notify_scan_done();
-}
-
-void G1CMRootMemRegions::scan_finished() {
-  assert(scan_in_progress(), "pre-condition");
-
-  if (!_should_abort.load_relaxed()) {
-    assert(_claimed_root_regions.load_relaxed() >= num_root_regions(),
-           "we should have claimed all root regions, claimed %zu, length = %u",
-           _claimed_root_regions.load_relaxed(), num_root_regions());
-  }
-
-  notify_scan_done();
-}
-
-bool G1CMRootMemRegions::wait_until_scan_finished() {
-  if (!scan_in_progress()) {
-    return false;
-  }
-
-  {
-    MonitorLocker ml(G1RootRegionScan_lock, Mutex::_no_safepoint_check_flag);
-    while (scan_in_progress()) {
-      ml.wait();
-    }
-  }
-  return true;
-}
-
 G1ConcurrentMark::G1ConcurrentMark(G1CollectedHeap* g1h,
                                    G1RegionToSpaceMapper* bitmap_storage) :
   _cm_thread(nullptr),
@@ -483,6 +440,7 @@ G1ConcurrentMark::G1ConcurrentMark(G1CollectedHeap* g1h,
   _heap(_g1h->reserved()),
 
   _root_regions(_g1h->max_num_regions()),
+  _root_region_scan_aborted(false),
 
   _global_mark_stack(),
 
@@ -614,6 +572,7 @@ void G1ConcurrentMark::reset() {
     _region_mark_stats[i].clear();
   }
 
+  _root_region_scan_aborted.store_relaxed(false);
   _root_regions.reset();
 }
 
@@ -970,8 +929,6 @@ void G1ConcurrentMark::start_full_concurrent_cycle() {
   satb_mq_set.set_active_all_threads(true, /* new active value */
                                      false /* expected_active */);
 
-  _root_regions.prepare_for_scan();
-
   // update_g1_committed() will be called at the end of an evac pause
   // when marking is on. So, it's also called at the end of the
   // concurrent start pause to update the heap end, if the heap expands
@@ -982,7 +939,11 @@ void G1ConcurrentMark::start_full_concurrent_cycle() {
 }
 
 void G1ConcurrentMark::start_undo_concurrent_cycle() {
-  root_regions()->cancel_scan();
+  assert_at_safepoint_on_vm_thread();
+  // At this time this GC is not a concurrent start gc any more, can only check for young only gc/phase.
+  assert(_g1h->collector_state()->is_in_young_only_phase(), "must be");
+
+  abort_root_region_scan_at_safepoint();
 
   // Signal the thread to start work.
   cm_thread()->start_undo_cycle();
@@ -1094,6 +1055,16 @@ uint G1ConcurrentMark::calc_active_marking_workers() {
   return result;
 }
 
+bool G1ConcurrentMark::has_root_region_scan_aborted() const {
+  return _root_region_scan_aborted.load_relaxed();
+}
+
+#ifndef PRODUCT
+void G1ConcurrentMark::assert_root_region_scan_completed_or_aborted() {
+  assert(root_regions()->work_completed() || has_root_region_scan_aborted(), "must be");
+}
+#endif
+
 void G1ConcurrentMark::scan_root_region(const MemRegion* region, uint worker_id) {
 #ifdef ASSERT
   HeapWord* last = region->last();
@@ -1120,45 +1091,76 @@ void G1ConcurrentMark::scan_root_region(const MemRegion* region, uint worker_id)
 
 class G1CMRootRegionScanTask : public WorkerTask {
   G1ConcurrentMark* _cm;
+  bool _should_yield;
+
 public:
-  G1CMRootRegionScanTask(G1ConcurrentMark* cm) :
-    WorkerTask("G1 Root Region Scan"), _cm(cm) { }
+  G1CMRootRegionScanTask(G1ConcurrentMark* cm, bool should_yield) :
+    WorkerTask("G1 Root Region Scan"), _cm(cm), _should_yield(should_yield) { }
 
   void work(uint worker_id) {
-    G1CMRootMemRegions* root_regions = _cm->root_regions();
-    const MemRegion* region = root_regions->claim_next();
-    while (region != nullptr) {
+    SuspendibleThreadSetJoiner sts_join(_should_yield);
+
+    while (true) {
+      if (_cm->has_root_region_scan_aborted()) {
+        return;
+      }
+      G1CMRootMemRegions* root_regions = _cm->root_regions();
+      const MemRegion* region = root_regions->claim_next();
+      if (region == nullptr) {
+        return;
+      }
       _cm->scan_root_region(region, worker_id);
-      region = root_regions->claim_next();
+      if (_should_yield) {
+        SuspendibleThreadSet::yield();
+        // If we yielded, a GC may have processed all root regions,
+        // so this loop will naturally exit on the next claim_next() call.
+        // Same if a Full GC signalled abort of the concurrent mark.
+      }
     }
   }
 };
 
-void G1ConcurrentMark::scan_root_regions() {
-  // scan_in_progress() will have been set to true only if there was
-  // at least one root region to scan. So, if it's false, we
-  // should not attempt to do any further work.
-  if (root_regions()->scan_in_progress()) {
-    assert(!has_aborted(), "Aborting before root region scanning is finished not supported.");
-
+bool G1ConcurrentMark::scan_root_regions(WorkerThreads* workers, bool concurrent) {
+  // We first check whether there is any work to do as we might have already aborted
+  // the concurrent cycle, or ran into a GC that did the actual work when we reach here.
+  // We want to avoid spinning up the worker threads if that happened.
+  // (Note that due to races reading the abort-flag, we might spin up the threads anyway).
+  //
+  // Abort happens if a Full GC occurs right after starting the concurrent cycle or
+  // a young gc doing the work.
+  //
+  // Concurrent gc threads enter an STS when starting the task, so they stop, then
+  // continue after that safepoint.
+  bool do_scan = !root_regions()->work_completed() && !has_root_region_scan_aborted();
+  if (do_scan) {
     // Assign one worker to each root-region but subject to the max constraint.
-    const uint num_workers = MIN2(root_regions()->num_root_regions(),
+    // The constraint is also important to avoid accesses beyond the allocated per-worker
+    // marking helper data structures. We might get passed different WorkerThreads with
+    // different number of threads (potential worker ids) than helper data structures when
+    // completing this work during GC.
+    const uint num_workers = MIN2(root_regions()->num_remaining_regions(),
                                   _max_concurrent_workers);
+    assert(num_workers > 0, "no more remaining root regions to process");
 
-    G1CMRootRegionScanTask task(this);
+    G1CMRootRegionScanTask task(this, concurrent);
     log_debug(gc, ergo)("Running %s using %u workers for %u work units.",
-                        task.name(), num_workers, root_regions()->num_root_regions());
-    _concurrent_workers->run_task(&task, num_workers);
-
-    // It's possible that has_aborted() is true here without actually
-    // aborting the survivor scan earlier. This is OK as it's
-    // mainly used for sanity checking.
-    root_regions()->scan_finished();
+                        task.name(), num_workers, root_regions()->num_remaining_regions());
+    workers->run_task(&task, num_workers);
   }
+
+  assert_root_region_scan_completed_or_aborted();
+
+  return do_scan;
 }
 
-bool G1ConcurrentMark::wait_until_root_region_scan_finished() {
-  return root_regions()->wait_until_scan_finished();
+void G1ConcurrentMark::scan_root_regions_concurrently() {
+  assert(Thread::current() == cm_thread(), "must be on Concurrent Mark Thread");
+  scan_root_regions(_concurrent_workers, true /* concurrent */);
+}
+
+bool G1ConcurrentMark::complete_root_regions_scan_in_safepoint() {
+  assert_at_safepoint_on_vm_thread();
+  return scan_root_regions(_g1h->workers(), false /* concurrent */);
 }
 
 void G1ConcurrentMark::add_root_region(G1HeapRegion* r) {
@@ -1169,9 +1171,16 @@ bool G1ConcurrentMark::is_root_region(G1HeapRegion* r) {
   return root_regions()->contains(MemRegion(top_at_mark_start(r), r->top()));
 }
 
-void G1ConcurrentMark::root_region_scan_abort_and_wait() {
-  root_regions()->abort();
-  root_regions()->wait_until_scan_finished();
+void G1ConcurrentMark::abort_root_region_scan() {
+  assert_not_at_safepoint();
+
+  _root_region_scan_aborted.store_relaxed(true);
+}
+
+void G1ConcurrentMark::abort_root_region_scan_at_safepoint() {
+  assert_at_safepoint_on_vm_thread();
+
+  _root_region_scan_aborted.store_relaxed(true);
 }
 
 void G1ConcurrentMark::concurrent_cycle_start() {
@@ -1948,12 +1957,15 @@ void G1ConcurrentMark::print_stats() {
 }
 
 bool G1ConcurrentMark::concurrent_cycle_abort() {
+  assert_at_safepoint_on_vm_thread();
+  assert(_g1h->collector_state()->is_in_full_gc(), "must be");
+
   // If we start the compaction before the CM threads finish
   // scanning the root regions we might trip them over as we'll
-  // be moving objects / updating references. So let's wait until
-  // they are done. By telling them to abort, they should complete
-  // early.
-  root_region_scan_abort_and_wait();
+  // be moving objects / updating references. Since the root region
+  // scan synchronized with the safepoint, just tell it to abort.
+  // It will notice when the threads start up again later.
+  abort_root_region_scan_at_safepoint();
 
   // We haven't started a concurrent cycle no need to do anything; we might have
   // aborted the marking because of shutting down though. In this case the marking
@@ -1983,7 +1995,7 @@ bool G1ConcurrentMark::concurrent_cycle_abort() {
 }
 
 void G1ConcurrentMark::abort_marking_threads() {
-  assert(!_root_regions.scan_in_progress(), "still doing root region scan");
+  assert_root_region_scan_completed_or_aborted();
   _has_aborted.store_relaxed(true);
   _first_overflow_barrier_sync.abort();
   _second_overflow_barrier_sync.abort();
diff --git a/src/hotspot/share/gc/g1/g1ConcurrentMark.hpp b/src/hotspot/share/gc/g1/g1ConcurrentMark.hpp
index de97179d210..7aa93947204 100644
--- a/src/hotspot/share/gc/g1/g1ConcurrentMark.hpp
+++ b/src/hotspot/share/gc/g1/g1ConcurrentMark.hpp
@@ -288,57 +288,36 @@ private:
 class G1CMRootMemRegions {
   // The set of root MemRegions.
   MemRegion* _root_regions;
-  size_t const _max_regions;
+  uint const _max_regions;
 
-  Atomic<size_t> _num_root_regions;  // Actual number of root regions.
+  Atomic<uint> _num_regions;  // Actual number of root regions.
+  Atomic<uint> _num_claimed_regions; // Number of root regions currently claimed.
 
-  Atomic<size_t> _claimed_root_regions; // Number of root regions currently claimed.
-
-  Atomic<bool> _scan_in_progress;
-  Atomic<bool> _should_abort;
-
-  void notify_scan_done();
+  uint num_regions() const { return _num_regions.load_relaxed(); }
+  uint num_claimed_regions() const { return _num_claimed_regions.load_relaxed(); }
 
 public:
   G1CMRootMemRegions(uint const max_regions);
   ~G1CMRootMemRegions();
 
-  // Reset the data structure to allow addition of new root regions.
-  void reset();
-
   void add(HeapWord* start, HeapWord* end);
 
-  // Reset the claiming / scanning of the root regions.
-  void prepare_for_scan();
-
-  // Forces get_next() to return null so that the iteration aborts early.
-  void abort() { _should_abort.store_relaxed(true); }
-
-  // Return true if the CM thread are actively scanning root regions,
-  // false otherwise.
-  bool scan_in_progress() { return _scan_in_progress.load_relaxed(); }
+  // Reset data structure to initial state.
+  void reset();
 
   // Claim the next root MemRegion to scan atomically, or return null if
   // all have been claimed.
   const MemRegion* claim_next();
 
-  // The number of root regions to scan.
-  uint num_root_regions() const;
+  // Number of root regions to still process.
+  uint num_remaining_regions() const;
+
+  // Returns whether all root regions have been processed or the processing been aborted.
+  bool work_completed() const;
 
   // Is the given memregion contained in the root regions; the MemRegion must
   // match exactly.
   bool contains(const MemRegion mr) const;
-
-  void cancel_scan();
-
-  // Flag that we're done with root region scanning and notify anyone
-  // who's waiting on it. If aborted is false, assume that all regions
-  // have been claimed.
-  void scan_finished();
-
-  // If CM threads are still scanning root regions, wait until they
-  // are done. Return true if we had to wait, false otherwise.
-  bool wait_until_scan_finished();
 };
 
 // This class manages data structures and methods for doing liveness analysis in
@@ -367,6 +346,7 @@ class G1ConcurrentMark : public CHeapObj<mtGC> {
 
   // Root region tracking and claiming
   G1CMRootMemRegions      _root_regions;
+  Atomic<bool>            _root_region_scan_aborted;
 
   // For grey objects
   G1CMMarkStack           _global_mark_stack; // Grey objects behind global finger
@@ -600,7 +580,7 @@ public:
 
   // Notifies marking threads to abort. This is a best-effort notification. Does not
   // guarantee or update any state after the call. Root region scan must not be
-  // running.
+  // running or being aborted.
   void abort_marking_threads();
 
   // Total cpu time spent in mark worker threads in seconds.
@@ -651,17 +631,30 @@ public:
   // Stop active components/the concurrent mark thread.
   void stop();
 
-  // Scan all the root regions and mark everything reachable from
-  // them.
-  void scan_root_regions();
-  bool wait_until_root_region_scan_finished();
   void add_root_region(G1HeapRegion* r);
   bool is_root_region(G1HeapRegion* r);
-  void root_region_scan_abort_and_wait();
+
+  // Scan all the root regions concurrently and mark everything reachable from
+  // them.
+  void scan_root_regions_concurrently();
+  // Complete root region scan work in the safepoint, return if we did some work.
+  bool complete_root_regions_scan_in_safepoint();
+
+  // Abort an active concurrent root region scan outside safepoint.
+  void abort_root_region_scan();
+
+  bool has_root_region_scan_aborted() const;
 
 private:
+  // Abort an active concurrent root region scan during safepoint.
+  void abort_root_region_scan_at_safepoint();
+
+  void assert_root_region_scan_completed_or_aborted() PRODUCT_RETURN;
   G1CMRootMemRegions* root_regions() { return &_root_regions; }
 
+  // Perform root region scan until all root regions have been processed, or
+  // the process has been aborted. Returns true if we did some work.
+  bool scan_root_regions(WorkerThreads* workers, bool concurrent);
   // Scan a single root MemRegion to mark everything reachable from it.
   void scan_root_region(const MemRegion* region, uint worker_id);
 
diff --git a/src/hotspot/share/gc/g1/g1ConcurrentMarkThread.cpp b/src/hotspot/share/gc/g1/g1ConcurrentMarkThread.cpp
index 31d61b8b388..b8c97acd1b0 100644
--- a/src/hotspot/share/gc/g1/g1ConcurrentMarkThread.cpp
+++ b/src/hotspot/share/gc/g1/g1ConcurrentMarkThread.cpp
@@ -131,14 +131,11 @@ void G1ConcurrentMarkThread::run_service() {
 
     update_perf_counter_cpu_time();
   }
-  _cm->root_regions()->cancel_scan();
 }
 
 void G1ConcurrentMarkThread::stop_service() {
   if (is_in_progress()) {
-    // We are not allowed to abort the marking threads during root region scan.
-    // Needs to be done separately.
-    _cm->root_region_scan_abort_and_wait();
+    _cm->abort_root_region_scan();
 
     _cm->abort_marking_threads();
   }
@@ -164,7 +161,7 @@ bool G1ConcurrentMarkThread::phase_clear_cld_claimed_marks() {
 
 bool G1ConcurrentMarkThread::phase_scan_root_regions() {
   G1ConcPhaseTimer p(_cm, "Concurrent Scan Root Regions");
-  _cm->scan_root_regions();
+  _cm->scan_root_regions_concurrently();
   update_perf_counter_cpu_time();
   return _cm->has_aborted();
 }
diff --git a/src/hotspot/share/gc/g1/g1GCPhaseTimes.cpp b/src/hotspot/share/gc/g1/g1GCPhaseTimes.cpp
index a5013ddbb40..023790a2422 100644
--- a/src/hotspot/share/gc/g1/g1GCPhaseTimes.cpp
+++ b/src/hotspot/share/gc/g1/g1GCPhaseTimes.cpp
@@ -180,7 +180,7 @@ void G1GCPhaseTimes::reset() {
   _cur_post_evacuate_cleanup_2_time_ms = 0.0;
   _cur_resize_heap_time_ms = 0.0;
   _cur_ref_proc_time_ms = 0.0;
-  _root_region_scan_wait_time_ms = 0.0;
+  _root_region_scan_time_ms = 0.0;
   _external_accounted_time_ms = 0.0;
   _recorded_prepare_heap_roots_time_ms = 0.0;
   _recorded_young_cset_choice_time_ms = 0.0;
@@ -549,8 +549,8 @@ void G1GCPhaseTimes::print_other(double accounted_ms) const {
 // In addition, these are not included in G1GCPhaseTimes::_gc_pause_time_ms.
 // See G1YoungCollector::collect().
 void G1GCPhaseTimes::print(bool evacuation_failed) {
-  if (_root_region_scan_wait_time_ms > 0.0) {
-    debug_time("Root Region Scan Waiting", _root_region_scan_wait_time_ms);
+  if (_root_region_scan_time_ms > 0.0) {
+    debug_time("Root Region Scan", _root_region_scan_time_ms);
   }
 
   // Check if some time has been recorded for verification and only then print
diff --git a/src/hotspot/share/gc/g1/g1GCPhaseTimes.hpp b/src/hotspot/share/gc/g1/g1GCPhaseTimes.hpp
index 8223148b791..b57bf0d617e 100644
--- a/src/hotspot/share/gc/g1/g1GCPhaseTimes.hpp
+++ b/src/hotspot/share/gc/g1/g1GCPhaseTimes.hpp
@@ -191,7 +191,7 @@ class G1GCPhaseTimes : public CHeapObj<mtGC> {
   double _cur_ref_proc_time_ms;
 
   // Not included in _gc_pause_time_ms
-  double _root_region_scan_wait_time_ms;
+  double _root_region_scan_time_ms;
 
   double _external_accounted_time_ms;
 
@@ -325,8 +325,8 @@ class G1GCPhaseTimes : public CHeapObj<mtGC> {
     _cur_prepare_concurrent_task_time_ms = ms;
   }
 
-  void record_root_region_scan_wait_time(double time_ms) {
-    _root_region_scan_wait_time_ms = time_ms;
+  void record_root_region_scan_time(double time_ms) {
+    _root_region_scan_time_ms = time_ms;
   }
 
   void record_serial_free_cset_time_ms(double time_ms) {
@@ -399,8 +399,8 @@ class G1GCPhaseTimes : public CHeapObj<mtGC> {
     return _cur_resize_heap_time_ms;
   }
 
-  double root_region_scan_wait_time_ms() {
-    return _root_region_scan_wait_time_ms;
+  double root_region_scan_time_ms() {
+    return _root_region_scan_time_ms;
   }
 
   double young_cset_choice_time_ms() {
diff --git a/src/hotspot/share/gc/g1/g1VMOperations.cpp b/src/hotspot/share/gc/g1/g1VMOperations.cpp
index b0c6b680b78..891432e20a7 100644
--- a/src/hotspot/share/gc/g1/g1VMOperations.cpp
+++ b/src/hotspot/share/gc/g1/g1VMOperations.cpp
@@ -152,8 +152,9 @@ bool VM_G1PauseConcurrent::doit_prologue() {
   G1CollectedHeap* g1h = G1CollectedHeap::heap();
   if (g1h->is_shutting_down()) {
     Heap_lock->unlock();
-    // JVM shutdown has started. This ensures that any further operations will be properly aborted
-    // and will not interfere with the shutdown process.
+    // JVM shutdown has started. Abort concurrent marking to ensure that any further
+    // concurrent VM operations will not try to start and interfere with the shutdown
+    // process.
     g1h->concurrent_mark()->abort_marking_threads();
     return false;
   }
diff --git a/src/hotspot/share/gc/g1/g1YoungCollector.cpp b/src/hotspot/share/gc/g1/g1YoungCollector.cpp
index a4938416f25..9c12127c864 100644
--- a/src/hotspot/share/gc/g1/g1YoungCollector.cpp
+++ b/src/hotspot/share/gc/g1/g1YoungCollector.cpp
@@ -244,19 +244,13 @@ G1YoungGCAllocationFailureInjector* G1YoungCollector::allocation_failure_injecto
   return _g1h->allocation_failure_injector();
 }
 
-
-void G1YoungCollector::wait_for_root_region_scanning() {
+void G1YoungCollector::complete_root_region_scan() {
   Ticks start = Ticks::now();
-  // We have to wait until the CM threads finish scanning the
-  // root regions as it's the only way to ensure that all the
-  // objects on them have been correctly scanned before we start
-  // moving them during the GC.
-  bool waited = concurrent_mark()->wait_until_root_region_scan_finished();
-  Tickspan wait_time;
-  if (waited) {
-    wait_time = (Ticks::now() - start);
+  // We have to complete root region scan as it's the only way to ensure that all the
+  // objects on them have been correctly scanned before we start moving them during the GC.
+  if (concurrent_mark()->complete_root_regions_scan_in_safepoint()) {
+    phase_times()->record_root_region_scan_time((Ticks::now() - start).seconds() * MILLIUNITS);
   }
-  phase_times()->record_root_region_scan_wait_time(wait_time.seconds() * MILLIUNITS);
 }
 
 class G1PrintCollectionSetClosure : public G1HeapRegionClosure {
@@ -1147,7 +1141,7 @@ void G1YoungCollector::collect() {
   // Wait for root region scan here to make sure that it is done before any
   // use of the STW workers to maximize cpu use (i.e. all cores are available
   // just to do that).
-  wait_for_root_region_scanning();
+  complete_root_region_scan();
 
   G1YoungGCVerifierMark vm(this);
   {
diff --git a/src/hotspot/share/gc/g1/g1YoungCollector.hpp b/src/hotspot/share/gc/g1/g1YoungCollector.hpp
index 76d443b1a9f..ab32ca770a4 100644
--- a/src/hotspot/share/gc/g1/g1YoungCollector.hpp
+++ b/src/hotspot/share/gc/g1/g1YoungCollector.hpp
@@ -89,7 +89,7 @@ class G1YoungCollector {
   // returning the total time taken.
   Tickspan run_task_timed(WorkerTask* task);
 
-  void wait_for_root_region_scanning();
+  void complete_root_region_scan();
 
   void calculate_collection_set(G1EvacInfo* evacuation_info, double target_pause_time_ms);
 
diff --git a/src/hotspot/share/runtime/mutexLocker.cpp b/src/hotspot/share/runtime/mutexLocker.cpp
index b102e6424f1..3dd61374d03 100644
--- a/src/hotspot/share/runtime/mutexLocker.cpp
+++ b/src/hotspot/share/runtime/mutexLocker.cpp
@@ -105,7 +105,6 @@ Mutex*   G1MarkStackFreeList_lock     = nullptr;
 Monitor* G1OldGCCount_lock            = nullptr;
 Mutex*   G1OldSets_lock               = nullptr;
 Mutex*   G1ReviseYoungLength_lock     = nullptr;
-Monitor* G1RootRegionScan_lock        = nullptr;
 Mutex*   G1RareEvent_lock             = nullptr;
 Mutex*   G1Uncommit_lock              = nullptr;
 #endif
@@ -216,7 +215,6 @@ void mutex_init() {
     MUTEX_DEFN(G1MarkStackChunkList_lock     , PaddedMutex  , nosafepoint);
     MUTEX_DEFN(G1MarkStackFreeList_lock      , PaddedMutex  , nosafepoint);
     MUTEX_DEFN(G1OldSets_lock                , PaddedMutex  , nosafepoint);
-    MUTEX_DEFN(G1RootRegionScan_lock         , PaddedMonitor, nosafepoint-1);
     MUTEX_DEFN(G1Uncommit_lock               , PaddedMutex  , service-2);
   }
 #endif
diff --git a/src/hotspot/share/runtime/mutexLocker.hpp b/src/hotspot/share/runtime/mutexLocker.hpp
index f6c0a967718..682383de401 100644
--- a/src/hotspot/share/runtime/mutexLocker.hpp
+++ b/src/hotspot/share/runtime/mutexLocker.hpp
@@ -101,7 +101,6 @@ extern Monitor* G1OldGCCount_lock;               // in support of "concurrent" f
 extern Mutex*   G1OldSets_lock;                  // protects the G1 old region sets
 extern Mutex*   G1RareEvent_lock;                // Synchronizes (rare) parallel GC operations.
 extern Mutex*   G1ReviseYoungLength_lock;        // Protects access to young gen length revising operations.
-extern Monitor* G1RootRegionScan_lock;           // used to notify that the G1 CM threads have finished scanning the root regions
 extern Mutex*   G1Uncommit_lock;                 // protects the G1 uncommit list when not at safepoints
 #endif
 

From 9bf67a64f0a83a07dd292b679beaffd8b65b8c37 Mon Sep 17 00:00:00 2001
From: Anton Artemov <aartemov@openjdk.org>
Date: Wed, 1 Apr 2026 08:34:48 +0000
Subject: [PATCH 452/655] 8371596: Nits and typos found during review of fix
 for JDK-8366659

Reviewed-by: dholmes, dcubed, fbredberg
---
 src/hotspot/share/runtime/objectMonitor.cpp | 163 +++++++++++---------
 1 file changed, 94 insertions(+), 69 deletions(-)

diff --git a/src/hotspot/share/runtime/objectMonitor.cpp b/src/hotspot/share/runtime/objectMonitor.cpp
index 94399088464..9fc834f4b6b 100644
--- a/src/hotspot/share/runtime/objectMonitor.cpp
+++ b/src/hotspot/share/runtime/objectMonitor.cpp
@@ -155,7 +155,7 @@ static const jlong MAX_RECHECK_INTERVAL = 1000;
 //
 //   Succession is provided for by a policy of competitive handoff.
 //   The exiting thread does _not_ grant or pass ownership to the
-//   successor thread.  (This is also referred to as "handoff succession").
+//   successor thread. (This is also referred to as "handoff succession").
 //   Instead the exiting thread releases ownership and possibly wakes
 //   a successor, so the successor can (re)compete for ownership of the lock.
 //
@@ -189,7 +189,7 @@ static const jlong MAX_RECHECK_INTERVAL = 1000;
 //
 //   Once we have formed a doubly linked list it's easy to find the
 //   successor (A), wake it up, have it remove itself, and update the
-//   tail pointer, as seen in and 3) below.
+//   tail pointer, see 3) below.
 //
 //      3)  entry_list       ->F<=>E<=>D<=>C<=>B->null
 //          entry_list_tail  ------------------^
@@ -223,7 +223,7 @@ static const jlong MAX_RECHECK_INTERVAL = 1000;
 //   remove itself) or update the tail.
 //
 // * The monitor entry list operations avoid locks, but strictly speaking
-//   they're not lock-free.  Enter is lock-free, exit is not.
+//   they're not lock-free. Enter is lock-free, exit is not.
 //   For a description of 'Methods and apparatus providing non-blocking access
 //   to a resource,' see U.S. Pat. No. 7844973.
 //
@@ -387,7 +387,7 @@ bool ObjectMonitor::try_lock_with_contention_mark(JavaThread* locking_thread, Ob
     prev_owner = try_set_owner_from(DEFLATER_MARKER, locking_thread);
     if (prev_owner == DEFLATER_MARKER) {
       // We successfully cancelled the in-progress async deflation by
-      // changing owner from DEFLATER_MARKER to current.  We now extend
+      // changing owner from DEFLATER_MARKER to current. We now extend
       // the lifetime of the contention_mark (e.g. contentions++) here
       // to prevent the deflater thread from winning the last part of
       // the 2-part async deflation protocol after the regular
@@ -633,14 +633,14 @@ void ObjectMonitor::enter_with_contention_mark(JavaThread* current, ObjectMonito
 
   // The thread -- now the owner -- is back in vm mode.
   // Report the glorious news via TI,DTrace and jvmstat.
-  // The probe effect is non-trivial.  All the reportage occurs
+  // The probe effect is non-trivial. All the reportage occurs
   // while we hold the monitor, increasing the length of the critical
-  // section.  Amdahl's parallel speedup law comes vividly into play.
+  // section. Amdahl's parallel speedup law comes vividly into play.
   //
   // Another option might be to aggregate the events (thread local or
   // per-monitor aggregation) and defer reporting until a more opportune
   // time -- such as next time some thread encounters contention but has
-  // yet to acquire the lock.  While spinning that thread could
+  // yet to acquire the lock. While spinning that thread could
   // spinning we could increment JVMStat counters, etc.
 
   DTRACE_MONITOR_PROBE(contended__entered, this, object(), current);
@@ -739,11 +739,11 @@ bool ObjectMonitor::try_lock_or_add_to_entry_list(JavaThread* current, ObjectWai
       return false;
     }
 
-    // Interference - the CAS failed because _entry_list changed.  Before
+    // Interference - the CAS failed because _entry_list changed. Before
     // retrying the CAS retry taking the lock as it may now be free.
     if (try_lock(current) == TryLockResult::Success) {
-      assert(!has_successor(current), "invariant");
       assert(has_owner(current), "invariant");
+      assert(!has_successor(current), "invariant");
       node->TState = ObjectWaiter::TS_RUN;
       return true;
     }
@@ -953,8 +953,8 @@ bool ObjectMonitor::try_enter_fast(JavaThread* current, ObjectWaiter* current_no
 
   // Try the lock - TATAS
   if (try_lock(current) == TryLockResult::Success) {
-    assert(!has_successor(current), "invariant");
     assert(has_owner(current), "invariant");
+    assert(!has_successor(current), "invariant");
     return true;
   }
 
@@ -964,7 +964,7 @@ bool ObjectMonitor::try_enter_fast(JavaThread* current, ObjectWaiter* current_no
   //
   // If the _owner is ready but OFFPROC we could use a YieldTo()
   // operation to donate the remainder of this thread's quantum
-  // to the owner.  This has subtle but beneficial affinity
+  // to the owner. This has subtle but beneficial affinity
   // effects.
 
   if (try_spin(current)) {
@@ -974,15 +974,15 @@ bool ObjectMonitor::try_enter_fast(JavaThread* current, ObjectWaiter* current_no
   }
 
   // The Spin failed -- Enqueue and park the thread ...
-  assert(!has_successor(current), "invariant");
   assert(!has_owner(current), "invariant");
+  assert(!has_successor(current), "invariant");
 
   // Enqueue "current" on ObjectMonitor's _entry_list.
   //
   // current_node acts as a proxy for current.
   // As an aside, if were to ever rewrite the synchronization code mostly
   // in Java, WaitNodes, ObjectMonitors, and Events would become 1st-class
-  // Java objects.  This would avoid awkward lifecycle and liveness issues,
+  // Java objects. This would avoid awkward lifecycle and liveness issues,
   // as well as eliminate a subset of ABA issues.
   // TODO: eliminate ObjectWaiter and enqueue either Threads or Events.
 
@@ -995,7 +995,7 @@ bool ObjectMonitor::try_enter_fast(JavaThread* current, ObjectWaiter* current_no
   // This thread is now added to the _entry_list.
 
   // The lock might have been released while this thread was occupied queueing
-  // itself onto _entry_list.  To close the race and avoid "stranding" and
+  // itself onto _entry_list. To close the race and avoid "stranding" and
   // progress-liveness failure the caller must resample-retry _owner before parking.
   // Note the Dekker/Lamport duality: ST _entry_list; MEMBAR; LD Owner.
   // In this case the ST-MEMBAR is accomplished with CAS() in try_lock_or_add_to_entry_list.
@@ -1051,13 +1051,13 @@ void ObjectMonitor::enter_internal(JavaThread* current, ObjectWaiter* current_no
     }
 
     // Try again, but just so we distinguish between futile wakeups and
-    // successful wakeups.  The following test isn't algorithmically
+    // successful wakeups. The following test isn't algorithmically
     // necessary, but it helps us maintain sensible statistics.
     if (try_lock(current) == TryLockResult::Success) {
       break;
     }
 
-    // The lock is still contested.
+    // The lock is still contended.
 
     if (!reenter_path) {
       // Assuming this is not a spurious wakeup we'll normally find _succ == current.
@@ -1070,9 +1070,9 @@ void ObjectMonitor::enter_internal(JavaThread* current, ObjectWaiter* current_no
     }
 
     // We can find that we were unpark()ed and redesignated _succ while
-    // we were spinning.  That's harmless.  If we iterate and call park(),
+    // we were spinning. That's harmless. If we iterate and call park(),
     // park() will consume the event and return immediately and we'll
-    // just spin again.  This pattern can repeat, leaving _succ to simply
+    // just spin again. This pattern can repeat, leaving _succ to simply
     // spin on a CPU.
 
     if (has_successor(current)) {
@@ -1092,9 +1092,9 @@ void ObjectMonitor::enter_internal(JavaThread* current, ObjectWaiter* current_no
   // Current has acquired the lock -- Unlink current from the _entry_list.
   unlink_after_acquire(current, current_node);
   if (has_successor(current)) {
-    clear_successor();
     // Note that we don't need to do OrderAccess::fence() after clearing
     // _succ here, since we own the lock.
+    clear_successor();
   }
 
   // We've acquired ownership with CAS().
@@ -1146,7 +1146,9 @@ bool ObjectMonitor::vthread_monitor_enter(JavaThread* current, ObjectWaiter* wai
 
   if (try_lock_or_add_to_entry_list(current, node)) {
     // We got the lock.
-    if (waiter == nullptr) delete node;  // for Object.wait() don't delete yet
+    if (waiter == nullptr) {
+      delete node;  // for Object.wait() don't delete yet
+    }
     dec_unmounted_vthreads();
     return true;
   }
@@ -1157,8 +1159,14 @@ bool ObjectMonitor::vthread_monitor_enter(JavaThread* current, ObjectWaiter* wai
   if (try_lock(current) == TryLockResult::Success) {
     assert(has_owner(current), "invariant");
     unlink_after_acquire(current, node);
-    if (has_successor(current)) clear_successor();
-    if (waiter == nullptr) delete node;  // for Object.wait() don't delete yet
+    if (has_successor(current)) {
+      // Note that we don't need to do OrderAccess::fence() after clearing
+      // _succ here, since we own the lock.
+      clear_successor();
+    }
+    if (waiter == nullptr) {
+      delete node;  // for Object.wait() don't delete yet
+    }
     dec_unmounted_vthreads();
     return true;
   }
@@ -1182,7 +1190,9 @@ bool ObjectMonitor::resume_operation(JavaThread* current, ObjectWaiter* node, Co
 
   if (node->is_wait() && !node->at_reenter()) {
     bool acquired_monitor = vthread_wait_reenter(current, node, cont);
-    if (acquired_monitor) return true;
+    if (acquired_monitor) {
+      return true;
+    }
   }
 
   // Retry acquiring monitor...
@@ -1196,7 +1206,9 @@ bool ObjectMonitor::resume_operation(JavaThread* current, ObjectWaiter* node, Co
   }
 
   oop vthread = current->vthread();
-  if (has_successor(current)) clear_successor();
+  if (has_successor(current)) {
+    clear_successor();
+  }
 
   // Invariant: after clearing _succ a thread *must* retry acquiring the monitor.
   OrderAccess::fence();
@@ -1217,7 +1229,11 @@ void ObjectMonitor::vthread_epilog(JavaThread* current, ObjectWaiter* node) {
   add_to_contentions(-1);
   dec_unmounted_vthreads();
 
-  if (has_successor(current)) clear_successor();
+  if (has_successor(current)) {
+    // Note that we don't need to do OrderAccess::fence() after clearing
+    // _succ here, since we own the lock.
+    clear_successor();
+  }
 
   guarantee(_recursions == 0, "invariant");
 
@@ -1419,7 +1435,7 @@ void ObjectMonitor::unlink_after_acquire(JavaThread* current, ObjectWaiter* curr
 // inopportune) reclamation of "this".
 //
 // We'd like to assert that: (THREAD->thread_state() != _thread_blocked) ;
-// There's one exception to the claim above, however.  enter_internal() can call
+// There's one exception to the claim above, however. enter_internal() can call
 // exit() to drop a lock if the acquirer has been externally suspended.
 // In that case exit() is called with _thread_state == _thread_blocked,
 // but the monitor's _contentions field is > 0, which inhibits reclamation.
@@ -1507,12 +1523,12 @@ void ObjectMonitor::exit(JavaThread* current, bool not_suspended) {
         w = entry_list_tail(current);
         // I'd like to write: guarantee (w->_thread != current).
         // But in practice an exiting thread may find itself on the entry_list.
-        // Let's say thread T1 calls O.wait().  Wait() enqueues T1 on O's waitset and
-        // then calls exit().  Exit release the lock by setting O._owner to null.
-        // Let's say T1 then stalls.  T2 acquires O and calls O.notify().  The
+        // Let's say thread T1 calls O.wait(). Wait() enqueues T1 on O's waitset and
+        // then calls exit(). Exit releases the lock by setting O._owner to null.
+        // Let's say T1 then stalls. T2 acquires O and calls O.notify(). The
         // notify() operation moves T1 from O's waitset to O's entry_list. T2 then
-        // release the lock "O".  T1 resumes immediately after the ST of null into
-        // _owner, above.  T1 notices that the entry_list is populated, so it
+        // releases the lock "O". T1 resumes immediately after the ST of null into
+        // _owner, above. T1 notices that the entry_list is populated, so it
         // reacquires the lock and then finds itself on the entry_list.
         // Given all that, we have to tolerate the circumstance where "w" is
         // associated with current.
@@ -1534,26 +1550,26 @@ void ObjectMonitor::exit(JavaThread* current, bool not_suspended) {
     // Normally the exiting thread is responsible for ensuring succession,
     // but if this thread observes other successors are ready or other
     // entering threads are spinning after it has stored null into _owner
-    // then it can exit without waking a successor.  The existence of
+    // then it can exit without waking a successor. The existence of
     // spinners or ready successors guarantees proper succession (liveness).
-    // Responsibility passes to the ready or running successors.  The exiting
-    // thread delegates the duty.  More precisely, if a successor already
+    // Responsibility passes to the ready or running successors. The exiting
+    // thread delegates the duty. More precisely, if a successor already
     // exists this thread is absolved of the responsibility of waking
     // (unparking) one.
 
     // The _succ variable is critical to reducing futile wakeup frequency.
     // _succ identifies the "heir presumptive" thread that has been made
-    // ready (unparked) but that has not yet run.  We need only one such
+    // ready (unparked) but that has not yet run. We need only one such
     // successor thread to guarantee progress.
     // See http://www.usenix.org/events/jvm01/full_papers/dice/dice.pdf
     // section 3.3 "Futile Wakeup Throttling" for details.
     //
-    // Note that spinners in Enter() also set _succ non-null.
-    // In the current implementation spinners opportunistically set
+    // Note that spinners in enter(), try_enter_fast() and enter_internal() also
+    // set _succ non-null. In the current implementation spinners opportunistically set
     // _succ so that exiting threads might avoid waking a successor.
     // Which means that the exiting thread could exit immediately without
     // waking a successor, if it observes a successor after it has dropped
-    // the lock.  Note that the dropped lock needs to become visible to the
+    // the lock. Note that the dropped lock needs to become visible to the
     // spinner.
 
     if (_entry_list == nullptr || has_successor()) {
@@ -1730,7 +1746,7 @@ void ObjectMonitor::wait(jlong millis, bool interruptible, TRAPS) {
     if (JvmtiExport::should_post_monitor_wait()) {
       JvmtiExport::post_monitor_wait(current, object(), millis);
     }
-    // post monitor waited event.  Note that this is past-tense, we are done waiting.
+    // post monitor waited event. Note that this is past-tense, we are done waiting.
     if (JvmtiExport::should_post_monitor_waited()) {
       // Note: 'false' parameter is passed here because the
       // wait was not timed out due to thread interrupt.
@@ -1791,9 +1807,9 @@ void ObjectMonitor::wait(jlong millis, bool interruptible, TRAPS) {
 
   // Enter the waiting queue, which is a circular doubly linked list in this case
   // but it could be a priority queue or any data structure.
-  // _wait_set_lock protects the wait queue.  Normally the wait queue is accessed only
+  // _wait_set_lock protects the wait queue. Normally the wait queue is accessed only
   // by the owner of the monitor *except* in the case where park()
-  // returns because of a timeout of interrupt.  Contention is exceptionally rare
+  // returns because of a timeout of interrupt. Contention is exceptionally rare
   // so we use a simple spin-lock instead of a heavier-weight blocking lock.
 
   {
@@ -1850,7 +1866,7 @@ void ObjectMonitor::wait(jlong millis, bool interruptible, TRAPS) {
     // written by the is thread. (perhaps the fetch might even be satisfied
     // by a look-aside into the processor's own store buffer, although given
     // the length of the code path between the prior ST and this load that's
-    // highly unlikely).  If the following LD fetches a stale TS_WAIT value
+    // highly unlikely). If the following LD fetches a stale TS_WAIT value
     // then we'll acquire the lock and then re-fetch a fresh TState value.
     // That is, we fail toward safety.
 
@@ -1868,7 +1884,12 @@ void ObjectMonitor::wait(jlong millis, bool interruptible, TRAPS) {
     // No other threads will asynchronously modify TState.
     guarantee(node.TState != ObjectWaiter::TS_WAIT, "invariant");
     OrderAccess::loadload();
-    if (has_successor(current)) clear_successor();
+    if (has_successor(current)) {
+      clear_successor();
+      // Note that we do not need a fence here, as, regardless of the path taken,
+      // there is a fence either in ThreadBlockInVM's destructor or
+      // right after a call to post_monitor_wait_event().
+    }
 
     // Reentry phase -- reacquire the monitor.
     // re-enter contended monitor after object.wait().
@@ -2046,11 +2067,11 @@ bool ObjectMonitor::notify_internal(JavaThread* current) {
       }
     }
 
-    // _wait_set_lock protects the wait queue, not the entry_list.  We could
+    // _wait_set_lock protects the wait queue, not the entry_list. We could
     // move the add-to-entry_list operation, above, outside the critical section
-    // protected by _wait_set_lock.  In practice that's not useful.  With the
+    // protected by _wait_set_lock. In practice that's not useful. With the
     // exception of wait() timeouts and interrupts the monitor owner
-    // is the only thread that grabs _wait_set_lock.  There's almost no contention
+    // is the only thread that grabs _wait_set_lock. There's almost no contention
     // on _wait_set_lock so it's not profitable to reduce the length of the
     // critical section.
   }
@@ -2151,9 +2172,9 @@ void ObjectMonitor::vthread_wait(JavaThread* current, jlong millis, bool interru
 
   // Enter the waiting queue, which is a circular doubly linked list in this case
   // but it could be a priority queue or any data structure.
-  // _wait_set_lock protects the wait queue.  Normally the wait queue is accessed only
+  // _wait_set_lock protects the wait queue. Normally the wait queue is accessed only
   // by the owner of the monitor *except* in the case where park()
-  // returns because of a timeout or interrupt.  Contention is exceptionally rare
+  // returns because of a timeout or interrupt. Contention is exceptionally rare
   // so we use a simple spin-lock instead of a heavier-weight blocking lock.
 
   {
@@ -2243,25 +2264,25 @@ bool ObjectMonitor::vthread_wait_reenter(JavaThread* current, ObjectWaiter* node
 // algorithm.
 //
 // Broadly, we can fix the spin frequency -- that is, the % of contended lock
-// acquisition attempts where we opt to spin --  at 100% and vary the spin count
+// acquisition attempts where we opt to spin -- at 100% and vary the spin count
 // (duration) or we can fix the count at approximately the duration of
-// a context switch and vary the frequency.   Of course we could also
+// a context switch and vary the frequency. Of course we could also
 // vary both satisfying K == Frequency * Duration, where K is adaptive by monitor.
 // For a description of 'Adaptive spin-then-block mutual exclusion in
 // multi-threaded processing,' see U.S. Pat. No. 8046758.
 //
 // This implementation varies the duration "D", where D varies with
 // the success rate of recent spin attempts. (D is capped at approximately
-// length of a round-trip context switch).  The success rate for recent
+// length of a round-trip context switch). The success rate for recent
 // spin attempts is a good predictor of the success rate of future spin
-// attempts.  The mechanism adapts automatically to varying critical
+// attempts. The mechanism adapts automatically to varying critical
 // section length (lock modality), system load and degree of parallelism.
 // D is maintained per-monitor in _SpinDuration and is initialized
-// optimistically.  Spin frequency is fixed at 100%.
+// optimistically. Spin frequency is fixed at 100%.
 //
 // Note that _SpinDuration is volatile, but we update it without locks
-// or atomics.  The code is designed so that _SpinDuration stays within
-// a reasonable range even in the presence of races.  The arithmetic
+// or atomics. The code is designed so that _SpinDuration stays within
+// a reasonable range even in the presence of races. The arithmetic
 // operations on _SpinDuration are closed over the domain of legal values,
 // so at worst a race will install and older but still legal value.
 // At the very worst this introduces some apparent non-determinism.
@@ -2269,28 +2290,28 @@ bool ObjectMonitor::vthread_wait_reenter(JavaThread* current, ObjectWaiter* node
 // count are relatively short, even in the worst case, the effect is harmless.
 //
 // Care must be taken that a low "D" value does not become an
-// an absorbing state.  Transient spinning failures -- when spinning
+// an absorbing state. Transient spinning failures -- when spinning
 // is overall profitable -- should not cause the system to converge
-// on low "D" values.  We want spinning to be stable and predictable
+// on low "D" values. We want spinning to be stable and predictable
 // and fairly responsive to change and at the same time we don't want
 // it to oscillate, become metastable, be "too" non-deterministic,
 // or converge on or enter undesirable stable absorbing states.
 //
 // We implement a feedback-based control system -- using past behavior
-// to predict future behavior.  We face two issues: (a) if the
+// to predict future behavior. We face two issues: (a) if the
 // input signal is random then the spin predictor won't provide optimal
 // results, and (b) if the signal frequency is too high then the control
 // system, which has some natural response lag, will "chase" the signal.
-// (b) can arise from multimodal lock hold times.  Transient preemption
+// (b) can arise from multimodal lock hold times. Transient preemption
 // can also result in apparent bimodal lock hold times.
 // Although sub-optimal, neither condition is particularly harmful, as
 // in the worst-case we'll spin when we shouldn't or vice-versa.
 // The maximum spin duration is rather short so the failure modes aren't bad.
 // To be conservative, I've tuned the gain in system to bias toward
-// _not spinning.  Relatedly, the system can sometimes enter a mode where it
-// "rings" or oscillates between spinning and not spinning.  This happens
+// _not spinning. Relatedly, the system can sometimes enter a mode where it
+// "rings" or oscillates between spinning and not spinning. This happens
 // when spinning is just on the cusp of profitability, however, so the
-// situation is not dire.  The state is benign -- there's no need to add
+// situation is not dire. The state is benign -- there's no need to add
 // hysteresis control to damp the transition rate between spinning and
 // not spinning.
 
@@ -2322,7 +2343,9 @@ inline static int adjust_down(int spin_duration) {
     // Consider an AIMD scheme like: x -= (x >> 3) + 100
     // This is globally sample and tends to damp the response.
     x -= Knob_Penalty;
-    if (x < 0) { x = 0; }
+    if (x < 0) {
+      x = 0;
+    }
     return x;
   } else {
     return spin_duration;
@@ -2348,7 +2371,7 @@ bool ObjectMonitor::short_fixed_spin(JavaThread* current, int spin_count, bool a
 // Spinning: Fixed frequency (100%), vary duration
 bool ObjectMonitor::try_spin(JavaThread* current) {
 
-  // Dumb, brutal spin.  Good for comparative measurements against adaptive spinning.
+  // Dumb, brutal spin. Good for comparative measurements against adaptive spinning.
   int knob_fixed_spin = Knob_FixedSpin;  // 0 (don't spin: default), 2000 good test
   if (knob_fixed_spin > 0) {
     return short_fixed_spin(current, knob_fixed_spin, false);
@@ -2357,7 +2380,7 @@ bool ObjectMonitor::try_spin(JavaThread* current) {
   // Admission control - verify preconditions for spinning
   //
   // We always spin a little bit, just to prevent _SpinDuration == 0 from
-  // becoming an absorbing state.  Put another way, we spin briefly to
+  // becoming an absorbing state. Put another way, we spin briefly to
   // sample, just in case the system load, parallelism, contention, or lock
   // modality changed.
 
@@ -2369,7 +2392,7 @@ bool ObjectMonitor::try_spin(JavaThread* current) {
   //
   // Consider the following alternative:
   // Periodically set _SpinDuration = _SpinLimit and try a long/full
-  // spin attempt.  "Periodically" might mean after a tally of
+  // spin attempt. "Periodically" might mean after a tally of
   // the # of failed spin attempts (or iterations) reaches some threshold.
   // This takes us into the realm of 1-out-of-N spinning, where we
   // hold the duration constant but vary the frequency.
@@ -2416,9 +2439,9 @@ bool ObjectMonitor::try_spin(JavaThread* current) {
     // If this thread observes the monitor transition or flicker
     // from locked to unlocked to locked, then the odds that this
     // thread will acquire the lock in this spin attempt go down
-    // considerably.  The same argument applies if the CAS fails
+    // considerably. The same argument applies if the CAS fails
     // or if we observe _owner change from one non-null value to
-    // another non-null value.   In such cases we might abort
+    // another non-null value. In such cases we might abort
     // the spin without prejudice or apply a "penalty" to the
     // spin count-down variable "ctr", reducing it by 100, say.
 
@@ -2429,6 +2452,8 @@ bool ObjectMonitor::try_spin(JavaThread* current) {
         // The CAS succeeded -- this thread acquired ownership
         // Take care of some bookkeeping to exit spin state.
         if (has_successor(current)) {
+          // Note that we don't need to do OrderAccess::fence() after clearing
+          // _succ here, since we own the lock.
           clear_successor();
         }
 
@@ -2470,7 +2495,7 @@ bool ObjectMonitor::try_spin(JavaThread* current) {
   if (has_successor(current)) {
     clear_successor();
     // Invariant: after setting succ=null a contending thread
-    // must recheck-retry _owner before parking.  This usually happens
+    // must recheck-retry _owner before parking. This usually happens
     // in the normal usage of try_spin(), but it's safest
     // to make try_spin() as foolproof as possible.
     OrderAccess::fence();

From 0dfa22f27d71808c5a777c073a2a3acdd4c13945 Mon Sep 17 00:00:00 2001
From: Thomas Schatzl <tschatzl@openjdk.org>
Date: Wed, 1 Apr 2026 09:08:54 +0000
Subject: [PATCH 453/655] 8381397: G1: Inline
 initiate_conc_mark/record_conc_mark_init_end

Reviewed-by: ayang, iwalulya
---
 src/hotspot/share/gc/g1/g1Policy.cpp | 21 +++++----------------
 src/hotspot/share/gc/g1/g1Policy.hpp |  8 --------
 2 files changed, 5 insertions(+), 24 deletions(-)

diff --git a/src/hotspot/share/gc/g1/g1Policy.cpp b/src/hotspot/share/gc/g1/g1Policy.cpp
index 24a82113d20..b1c9f3a5b6f 100644
--- a/src/hotspot/share/gc/g1/g1Policy.cpp
+++ b/src/hotspot/share/gc/g1/g1Policy.cpp
@@ -690,11 +690,6 @@ void G1Policy::record_young_collection_start() {
   assert(_g1h->collection_set()->verify_young_ages(), "region age verification failed");
 }
 
-void G1Policy::record_concurrent_mark_init_end() {
-  assert(!collector_state()->initiate_conc_mark_if_possible(), "we should have cleared it by now");
-  collector_state()->set_in_normal_young_gc();
-}
-
 void G1Policy::record_concurrent_mark_remark_end() {
   double end_time_sec = os::elapsedTime();
   double start_time_sec = cur_pause_start_sec();
@@ -795,7 +790,8 @@ void G1Policy::record_young_collection_end(bool concurrent_operation_is_full_mar
   bool is_young_only_pause = G1CollectorState::is_young_only_pause(this_pause);
 
   if (G1CollectorState::is_concurrent_start_pause(this_pause)) {
-    record_concurrent_mark_init_end();
+    assert(!collector_state()->initiate_conc_mark_if_possible(), "we should have cleared it by now");
+    collector_state()->set_in_normal_young_gc();
   } else {
     maybe_start_marking(allocation_word_size);
   }
@@ -1245,10 +1241,6 @@ bool G1Policy::force_concurrent_start_if_outside_cycle(GCCause::Cause gc_cause)
   }
 }
 
-void G1Policy::initiate_conc_mark() {
-  collector_state()->set_in_concurrent_start_gc();
-}
-
 static const char* requester_for_mixed_abort(GCCause::Cause cause) {
   if (cause == GCCause::_wb_breakpoint) {
     return "run_to breakpoint";
@@ -1283,22 +1275,19 @@ void G1Policy::decide_on_concurrent_start_pause() {
       log_debug(gc, ergo)("Do not initiate concurrent cycle (whitebox controlled)");
     } else if (!about_to_start_mixed_phase() && collector_state()->is_in_young_only_phase()) {
       // Initiate a new concurrent start if there is no marking or reclamation going on.
-      initiate_conc_mark();
+      collector_state()->set_in_concurrent_start_gc();
       log_debug(gc, ergo)("Initiate concurrent cycle (concurrent cycle initiation requested)");
     } else if (_g1h->is_user_requested_concurrent_full_gc(cause) ||
                GCCause::is_codecache_requested_gc(cause) ||
                (cause == GCCause::_wb_breakpoint)) {
-      // Initiate a concurrent start.  A concurrent start must be a young only
-      // GC, so the collector state must be updated to reflect this.
-      collector_state()->set_in_normal_young_gc();
-
+      // Force concurrent start.
+      collector_state()->set_in_concurrent_start_gc();
       // We might have ended up coming here about to start a mixed phase with a collection set
       // active. The following remark might change the change the "evacuation efficiency" of
       // the regions in this set, leading to failing asserts later.
       // Since the concurrent cycle will recreate the collection set anyway, simply drop it here.
       abandon_collection_set_candidates();
       abort_time_to_mixed_tracking();
-      initiate_conc_mark();
       log_debug(gc, ergo)("Initiate concurrent cycle (%s requested concurrent cycle)",
                           requester_for_mixed_abort(cause));
     } else {
diff --git a/src/hotspot/share/gc/g1/g1Policy.hpp b/src/hotspot/share/gc/g1/g1Policy.hpp
index bcc3bceda49..5c5c2bc3572 100644
--- a/src/hotspot/share/gc/g1/g1Policy.hpp
+++ b/src/hotspot/share/gc/g1/g1Policy.hpp
@@ -313,9 +313,6 @@ public:
   void record_full_collection_start();
   void record_full_collection_end(size_t allocation_word_size);
 
-  // Must currently be called while the world is stopped.
-  void record_concurrent_mark_init_end();
-
   void record_concurrent_mark_remark_end();
 
   // Record start, end, and completion of cleanup.
@@ -332,11 +329,6 @@ private:
   // regions and update the associated members.
   void update_survival_estimates_for_next_collection();
 
-  // Set the state to start a concurrent marking cycle and clear
-  // _initiate_conc_mark_if_possible because it has now been
-  // acted on.
-  void initiate_conc_mark();
-
 public:
   // This sets the initiate_conc_mark_if_possible() flag to start a
   // new cycle, as long as we are not already in one. It's best if it

From e340aeeee010baf2773fd0d50ce59aa55a823de3 Mon Sep 17 00:00:00 2001
From: Guanqiang Han <ghan@openjdk.org>
Date: Wed, 1 Apr 2026 09:12:51 +0000
Subject: [PATCH 454/655] 8379174: G1: Too high G1RemSetArrayOfCardsEntriesBase
 causes invalid ergonomic G1RemSetArrayOfCardsEntries

Reviewed-by: tschatzl, iwalulya
---
 src/hotspot/share/gc/g1/g1Arguments.cpp       |  3 +-
 ...tG1RemSetArrayOfCardsEntriesErgoLimit.java | 43 +++++++++++++++++++
 2 files changed, 45 insertions(+), 1 deletion(-)
 create mode 100644 test/hotspot/jtreg/gc/g1/TestG1RemSetArrayOfCardsEntriesErgoLimit.java

diff --git a/src/hotspot/share/gc/g1/g1Arguments.cpp b/src/hotspot/share/gc/g1/g1Arguments.cpp
index 8bec6e7e86f..c3bbd5a3b52 100644
--- a/src/hotspot/share/gc/g1/g1Arguments.cpp
+++ b/src/hotspot/share/gc/g1/g1Arguments.cpp
@@ -148,8 +148,9 @@ void G1Arguments::initialize_card_set_configuration() {
 
   if (FLAG_IS_DEFAULT(G1RemSetArrayOfCardsEntries)) {
     uint max_cards_in_inline_ptr = G1CardSetConfiguration::max_cards_in_inline_ptr(G1HeapRegion::LogCardsPerRegion);
+    const JVMTypedFlagLimit<uint>* limit = JVMFlagLimit::get_range_at(FLAG_MEMBER_ENUM(G1RemSetArrayOfCardsEntries))->cast<uint>();
     FLAG_SET_ERGO(G1RemSetArrayOfCardsEntries, MAX2(max_cards_in_inline_ptr * 2,
-                                                    G1RemSetArrayOfCardsEntriesBase << region_size_log_mb));
+                                                    MIN2(G1RemSetArrayOfCardsEntriesBase << region_size_log_mb, limit->max())));
   }
 
   // Howl card set container globals.
diff --git a/test/hotspot/jtreg/gc/g1/TestG1RemSetArrayOfCardsEntriesErgoLimit.java b/test/hotspot/jtreg/gc/g1/TestG1RemSetArrayOfCardsEntriesErgoLimit.java
new file mode 100644
index 00000000000..4af09066def
--- /dev/null
+++ b/test/hotspot/jtreg/gc/g1/TestG1RemSetArrayOfCardsEntriesErgoLimit.java
@@ -0,0 +1,43 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+/**
+ * @test
+ * @bug 8379174
+ * @summary Test for G1 ergonomics deriving an out-of-range
+ *          G1RemSetArrayOfCardsEntries value from G1RemSetArrayOfCardsEntriesBase
+ * @requires vm.gc.G1
+ * @run main/othervm -XX:+IgnoreUnrecognizedVMOptions
+ *                   -XX:+UseG1GC
+ *                   -XX:G1RemSetArrayOfCardsEntriesBase=62117
+ *                   -XX:G1HeapRegionSize=4m
+ *                   ${test.main.class}
+ */
+
+package gc.g1;
+
+public class TestG1RemSetArrayOfCardsEntriesErgoLimit {
+    public static void main(String[] args) {
+        System.out.println("passed");
+    }
+}

From 2caf253017d00f758a038a16ba9d64d52dd1c202 Mon Sep 17 00:00:00 2001
From: Martin Doerr <mdoerr@openjdk.org>
Date: Wed, 1 Apr 2026 09:20:10 +0000
Subject: [PATCH 455/655] 8381412: [PPC64] unproblemlist JDK-8320897

Reviewed-by: mbaesken
---
 test/hotspot/jtreg/ProblemList.txt | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/test/hotspot/jtreg/ProblemList.txt b/test/hotspot/jtreg/ProblemList.txt
index 3b871d9f4b6..d4efaa7e631 100644
--- a/test/hotspot/jtreg/ProblemList.txt
+++ b/test/hotspot/jtreg/ProblemList.txt
@@ -56,7 +56,7 @@ compiler/c2/irTests/TestDuplicateBackedge.java 8318904 generic-all
 
 compiler/codecache/jmx/PoolsIndependenceTest.java 8264632 macosx-all
 
-compiler/vectorapi/reshape/TestVectorReinterpret.java 8320897,8348519 aix-ppc64,linux-ppc64le,linux-s390x
+compiler/vectorapi/reshape/TestVectorReinterpret.java 8348519 linux-s390x
 compiler/vectorapi/VectorRebracket128Test.java 8330538 generic-all
 
 compiler/vectorization/TestVectorAlgorithms.java#noSuperWord 8376803 aix-ppc64,linux-s390x

From 3459f6b124c34f3187050495e34c690c017a0687 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Eirik=20Bj=C3=B8rsn=C3=B8s?= <eirbjo@openjdk.org>
Date: Wed, 1 Apr 2026 09:50:37 +0000
Subject: [PATCH 456/655] 8380452: ZipOutputStream::putNextEntry(ZipEntry)
 throws unspecified IllegalArgumentException for unmappable entry name

Reviewed-by: jpai, lancea, alanb
---
 .../java/util/zip/ZipOutputStream.java        | 21 ++++-
 .../UnmappableZipEntryNameOrComment.java      | 76 +++++++++++++++++++
 2 files changed, 93 insertions(+), 4 deletions(-)
 create mode 100644 test/jdk/java/util/zip/ZipOutputStream/UnmappableZipEntryNameOrComment.java

diff --git a/src/java.base/share/classes/java/util/zip/ZipOutputStream.java b/src/java.base/share/classes/java/util/zip/ZipOutputStream.java
index 47499858a37..4ea4a103fef 100644
--- a/src/java.base/share/classes/java/util/zip/ZipOutputStream.java
+++ b/src/java.base/share/classes/java/util/zip/ZipOutputStream.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1996, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1996, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -257,6 +257,11 @@ public class ZipOutputStream extends DeflaterOutputStream implements ZipConstant
         default:
             throw new ZipException("unsupported compression method");
         }
+        // Verify that entry name and comment can be encoded
+        byte[] nameBytes = checkEncodable(e.name, "unmappable character in ZIP entry name");
+        if (e.comment != null) {
+            checkEncodable(e.comment, "unmappable character in ZIP entry comment");
+        }
         if (! names.add(e.name)) {
             throw new ZipException("duplicate entry: " + e.name);
         }
@@ -270,7 +275,16 @@ public class ZipOutputStream extends DeflaterOutputStream implements ZipConstant
         }
         current = new XEntry(e, written);
         xentries.add(current);
-        writeLOC(current);
+        writeLOC(current, nameBytes);
+    }
+
+    // Throws ZipException if the given string cannot be encoded
+    private byte[] checkEncodable(String str, String msg) throws ZipException {
+        try {
+            return zc.getBytes(str);
+        } catch (IllegalArgumentException ex) {
+            throw (ZipException) new ZipException(msg).initCause(ex);
+        }
     }
 
     /**
@@ -424,7 +438,7 @@ public class ZipOutputStream extends DeflaterOutputStream implements ZipConstant
     /*
      * Writes local file (LOC) header for specified entry.
      */
-    private void writeLOC(XEntry xentry) throws IOException {
+    private void writeLOC(XEntry xentry, byte[] nameBytes) throws IOException {
         ZipEntry e = xentry.entry;
         int flag = e.flag;
         boolean hasZip64 = false;
@@ -461,7 +475,6 @@ public class ZipOutputStream extends DeflaterOutputStream implements ZipConstant
                 writeInt(e.size);   // uncompressed size
             }
         }
-        byte[] nameBytes = zc.getBytes(e.name);
         writeShort(nameBytes.length);
 
         int elenEXTT = 0;         // info-zip extended timestamp
diff --git a/test/jdk/java/util/zip/ZipOutputStream/UnmappableZipEntryNameOrComment.java b/test/jdk/java/util/zip/ZipOutputStream/UnmappableZipEntryNameOrComment.java
new file mode 100644
index 00000000000..af08de2adcf
--- /dev/null
+++ b/test/jdk/java/util/zip/ZipOutputStream/UnmappableZipEntryNameOrComment.java
@@ -0,0 +1,76 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+import org.junit.jupiter.api.Test;
+
+import java.io.IOException;
+import java.nio.charset.Charset;
+import java.nio.charset.StandardCharsets;
+import java.util.zip.ZipEntry;
+import java.util.zip.ZipException;
+import java.util.zip.ZipOutputStream;
+
+import static java.io.OutputStream.nullOutputStream;
+import static org.junit.jupiter.api.Assertions.assertThrows;
+
+/* @test
+ * @bug 8380452
+ * @summary Unmappable characters in ZipEntry name or comment should be rejected with ZipException
+ * @run junit ${test.main.class}
+ */
+public class UnmappableZipEntryNameOrComment {
+
+    // Charset used by any ZipOutputStream in this test
+    static final Charset CHARSET = StandardCharsets.US_ASCII;
+    // 'ø' is an unmappable character in US_ASCII
+    static final String UNMAPPABLE = "\u00f8";
+
+    /**
+     * Verify that calling ZipOutputStream.putNextEntry with an unmappable ZipEntry
+     * name is rejected with a ZipException.
+     *
+     * @throws IOException if an unexpected IO error occurs
+     */
+    @Test
+    void rejectUnmappableZipEntryName() throws IOException {
+        ZipEntry e = new ZipEntry(UNMAPPABLE);
+        try (var out = new ZipOutputStream(nullOutputStream(), CHARSET)) {
+            assertThrows(ZipException.class, () -> out.putNextEntry(e));
+        }
+    }
+
+    /**
+     * Verify that calling ZipOutputStream.putNextEntry with an unmappable ZipEntry
+     * comment is rejected with a ZipException.
+     *
+     * @throws IOException if an unexpected IO error occurs
+     */
+    @Test
+    void rejectUnmappableZipEntryComment() throws IOException {
+        ZipEntry e = new ZipEntry("file.txt");
+        e.setComment(UNMAPPABLE);
+        try (var out = new ZipOutputStream(nullOutputStream(), CHARSET)) {
+            assertThrows(ZipException.class, () -> out.putNextEntry(e));
+        }
+    }
+}

From 92b1d8237ec0feaba44ff875cdd92fbb78896eae Mon Sep 17 00:00:00 2001
From: Liam Miller-Cushon <cushon@openjdk.org>
Date: Wed, 1 Apr 2026 10:10:03 +0000
Subject: [PATCH 457/655] 8380147: Don't require a CompilationUnit for end
 position APIs

Reviewed-by: vromero
---
 .../sun/source/util/DocSourcePositions.java   | 59 +++++++++++++++++-
 .../com/sun/source/util/SourcePositions.java  | 53 +++++++++++++++-
 .../com/sun/tools/javac/api/JavacTrees.java   |  8 +--
 .../internal/doclets/toolkit/util/Utils.java  |  2 +-
 .../jdk/javadoc/internal/doclint/Env.java     |  2 +-
 .../jdk/javadoc/internal/tool/JavadocLog.java |  4 +-
 .../shellsupport/doc/JavadocHelper.java       | 62 +++++++++----------
 .../jdk/jshell/SourceCodeAnalysisImpl.java    | 30 ++++-----
 .../classes/jdk/jshell/TreeDissector.java     |  4 +-
 9 files changed, 163 insertions(+), 61 deletions(-)

diff --git a/src/jdk.compiler/share/classes/com/sun/source/util/DocSourcePositions.java b/src/jdk.compiler/share/classes/com/sun/source/util/DocSourcePositions.java
index 520943c464d..d0afd126bf6 100644
--- a/src/jdk.compiler/share/classes/com/sun/source/util/DocSourcePositions.java
+++ b/src/jdk.compiler/share/classes/com/sun/source/util/DocSourcePositions.java
@@ -28,6 +28,7 @@ package com.sun.source.util;
 import com.sun.source.doctree.DocCommentTree;
 import com.sun.source.doctree.DocTree;
 import com.sun.source.tree.CompilationUnitTree;
+import com.sun.source.tree.Tree;
 
 /**
  * Provides methods to obtain the position of a DocTree within a javadoc comment.
@@ -59,8 +60,31 @@ public interface DocSourcePositions extends SourcePositions {
      *                position is being sought
      * @param tree tree for which a position is sought
      * @return the start position of tree
+     * @deprecated use {@link #getStartPosition(DocCommentTree, DocTree)} instead
      */
-    long getStartPosition(CompilationUnitTree file, DocCommentTree comment, DocTree tree);
+    @Deprecated(since = "27", forRemoval = true)
+    default long getStartPosition(CompilationUnitTree file, DocCommentTree comment, DocTree tree) {
+        return getStartPosition(comment, tree);
+    }
+
+    /**
+     * {@return the starting position of the given {@link Tree}. If the starting position is not available, returns
+     * {@link javax.tools.Diagnostic#NOPOS}}
+     *
+     * <p>The given tree should be under the given comment tree. The returned position must be at the start of the
+     * yield of this tree, that is for any sub-tree of this tree, the following must hold:
+     *
+     * <p>
+     * {@code getStartPosition(comment, tree) <= getStartPosition(comment, subtree)} or <br>
+     * {@code getStartPosition(comment, tree) == NOPOS} or <br>
+     * {@code getStartPosition(comment, subtree) == NOPOS}
+     * </p>
+     *
+     * @param comment the comment tree that encloses the tree for which the
+     *                position is being sought
+     * @param tree tree for which a position is sought
+     */
+    long getStartPosition(DocCommentTree comment, DocTree tree);
 
     /**
      * Returns the ending position of the tree within the comment within the file.  If tree is not found within
@@ -91,7 +115,38 @@ public interface DocSourcePositions extends SourcePositions {
      *                position is being sought
      * @param tree tree for which a position is sought
      * @return the end position of tree
+     * @deprecated use {@link #getEndPosition(DocCommentTree, DocTree)} instead
      */
-    long getEndPosition(CompilationUnitTree file, DocCommentTree comment, DocTree tree);
+    @Deprecated(since = "27", forRemoval = true)
+    default long getEndPosition(CompilationUnitTree file, DocCommentTree comment, DocTree tree) {
+        return getEndPosition(comment, tree);
+    }
+
+    /**
+     * {@return the ending position of the given {@link Tree}. If the ending position is not available, returns
+     * {@link javax.tools.Diagnostic#NOPOS}}
+     *
+     * <p>The given tree should be under the given comment tree. The returned position must be at the end of the yield
+     * of this tree, that is for any sub-tree of this tree, the following must hold:
+     *
+     * <p>
+     * {@code getEndPosition(comment, tree) >= getEndPosition(comment, subtree)} or <br>
+     * {@code getEndPosition(comment, tree) == NOPOS} or <br>
+     * {@code getEndPosition(comment, subtree) == NOPOS}
+     * </p>
+     *
+     * In addition, the following must hold:
+     *
+     * <p>
+     * {@code getStartPosition(comment, tree) <= getEndPosition(comment, tree)} or <br>
+     * {@code getStartPosition(comment, tree) == NOPOS} or <br>
+     * {@code getEndPosition(comment, tree) == NOPOS}
+     * </p>
+     *
+     * @param comment the comment tree that encloses the tree for which the
+     *                position is being sought
+     * @param tree tree for which a position is sought
+     */
+    long getEndPosition(DocCommentTree comment, DocTree tree);
 
 }
diff --git a/src/jdk.compiler/share/classes/com/sun/source/util/SourcePositions.java b/src/jdk.compiler/share/classes/com/sun/source/util/SourcePositions.java
index b6112fd32e6..460f4f2a1ce 100644
--- a/src/jdk.compiler/share/classes/com/sun/source/util/SourcePositions.java
+++ b/src/jdk.compiler/share/classes/com/sun/source/util/SourcePositions.java
@@ -53,8 +53,29 @@ public interface SourcePositions {
      * @param file CompilationUnit in which to find tree
      * @param tree tree for which a position is sought
      * @return the start position of tree
+     * @deprecated use {@link #getStartPosition(Tree)} instead
      */
-     long getStartPosition(CompilationUnitTree file, Tree tree);
+    @Deprecated(since = "27", forRemoval = true)
+    default long getStartPosition(CompilationUnitTree file, Tree tree) {
+        return getStartPosition(tree);
+    }
+
+    /**
+     * {@return the starting position of the given {@link Tree}, or if the starting position is not available, returns
+     * {@link javax.tools.Diagnostic#NOPOS}}
+     *
+     * <p>The returned position must be at the start of the yield of this tree, that is for any sub-tree of this tree,
+     * the following must hold:
+     *
+     * <p>
+     * {@code getStartPosition(tree) <= getStartPosition(subtree)} or <br>
+     * {@code getStartPosition(tree) == NOPOS} or <br>
+     * {@code getStartPosition(subtree) == NOPOS}
+     * </p>
+     *
+     * @param tree tree for which a position is sought
+     */
+     long getStartPosition(Tree tree);
 
     /**
      * Returns the ending position of tree within file.  If tree is not found within
@@ -80,7 +101,35 @@ public interface SourcePositions {
      * @param file CompilationUnit in which to find tree
      * @param tree tree for which a position is sought
      * @return the end position of tree
+     * @deprecated use {@link #getEndPosition(Tree)} instead
      */
-     long getEndPosition(CompilationUnitTree file, Tree tree);
+     @Deprecated(since = "27", forRemoval = true)
+     default long getEndPosition(CompilationUnitTree file, Tree tree) {
+         return getEndPosition(tree);
+     }
 
+    /**
+     * {@return the ending position of the given {@link Tree}. If the ending position is not available,
+     * returns {@link javax.tools.Diagnostic#NOPOS}}
+     *
+     * <p>The returned position must be at the end of the yield of this tree, that is for any sub-tree of this tree,
+     * the following must hold:
+     *
+     * <p>
+     * {@code getEndPosition(tree) >= getEndPosition(subtree)} or <br>
+     * {@code getEndPosition(tree) == NOPOS} or <br>
+     * {@code getEndPosition(subtree) == NOPOS}
+     * </p>
+     *
+     * In addition, the following must hold:
+     *
+     * <p>
+     * {@code getStartPosition(tree) <= getEndPosition(tree)} or <br>
+     * {@code getStartPosition(tree) == NOPOS} or <br>
+     * {@code getEndPosition(tree) == NOPOS}
+     * </p>
+     *
+     * @param tree tree for which a position is sought
+     */
+    long getEndPosition(Tree tree);
 }
diff --git a/src/jdk.compiler/share/classes/com/sun/tools/javac/api/JavacTrees.java b/src/jdk.compiler/share/classes/com/sun/tools/javac/api/JavacTrees.java
index ecd7f5b101a..41dd904bc8a 100644
--- a/src/jdk.compiler/share/classes/com/sun/tools/javac/api/JavacTrees.java
+++ b/src/jdk.compiler/share/classes/com/sun/tools/javac/api/JavacTrees.java
@@ -233,24 +233,24 @@ public class JavacTrees extends DocTrees {
     public DocSourcePositions getSourcePositions() {
         return new DocSourcePositions() {
                 @Override @DefinedBy(Api.COMPILER_TREE)
-                public long getStartPosition(CompilationUnitTree file, Tree tree) {
+                public long getStartPosition(Tree tree) {
                     return TreeInfo.getStartPos((JCTree) tree);
                 }
 
                 @Override @DefinedBy(Api.COMPILER_TREE)
-                public long getEndPosition(CompilationUnitTree file, Tree tree) {
+                public long getEndPosition(Tree tree) {
                     return TreeInfo.getEndPos((JCTree) tree);
                 }
 
                 @Override @DefinedBy(Api.COMPILER_TREE)
-                public long getStartPosition(CompilationUnitTree file, DocCommentTree comment, DocTree tree) {
+                public long getStartPosition(DocCommentTree comment, DocTree tree) {
                     DCDocComment dcComment = (DCDocComment) comment;
                     DCTree dcTree = (DCTree) tree;
                     return dcComment.getSourcePosition(dcTree.getStartPosition());
                 }
 
                 @Override  @DefinedBy(Api.COMPILER_TREE)
-                public long getEndPosition(CompilationUnitTree file, DocCommentTree comment, DocTree tree) {
+                public long getEndPosition(DocCommentTree comment, DocTree tree) {
                     DCDocComment dcComment = (DCDocComment) comment;
                     DCTree dcTree = (DCTree) tree;
                     return dcComment.getSourcePosition(dcTree.getEndPosition());
diff --git a/src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclets/toolkit/util/Utils.java b/src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclets/toolkit/util/Utils.java
index ddadd33a18b..0b3b767ea39 100644
--- a/src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclets/toolkit/util/Utils.java
+++ b/src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclets/toolkit/util/Utils.java
@@ -1618,7 +1618,7 @@ public class Utils {
         CompilationUnitTree cu = path.getCompilationUnit();
         LineMap lineMap = cu.getLineMap();
         DocSourcePositions spos = docTrees.getSourcePositions();
-        long pos = spos.getStartPosition(cu, path.getLeaf());
+        long pos = spos.getStartPosition(path.getLeaf());
         return lineMap.getLineNumber(pos);
     }
 
diff --git a/src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclint/Env.java b/src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclint/Env.java
index f2940963f17..ba7f68cccf6 100644
--- a/src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclint/Env.java
+++ b/src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclint/Env.java
@@ -211,7 +211,7 @@ public class Env {
 
     long getStartPos(TreePath p) {
         SourcePositions sp = trees.getSourcePositions();
-        return sp.getStartPosition(p.getCompilationUnit(), p.getLeaf());
+        return sp.getStartPosition(p.getLeaf());
     }
 
     boolean shouldCheck(CompilationUnitTree unit) {
diff --git a/src/jdk.javadoc/share/classes/jdk/javadoc/internal/tool/JavadocLog.java b/src/jdk.javadoc/share/classes/jdk/javadoc/internal/tool/JavadocLog.java
index b3bf1c14cb1..39bc58dff59 100644
--- a/src/jdk.javadoc/share/classes/jdk/javadoc/internal/tool/JavadocLog.java
+++ b/src/jdk.javadoc/share/classes/jdk/javadoc/internal/tool/JavadocLog.java
@@ -582,9 +582,9 @@ public class JavadocLog extends Log implements Reporter {
         }
         CompilationUnitTree compUnit = tp.getCompilationUnit();
         JCTree tree = (JCTree) tp.getLeaf();
-        int start = (int) posns.getStartPosition(compUnit, tree);
+        int start = (int) posns.getStartPosition(tree);
         int pos = tree.getPreferredPosition();
-        int end = (int) posns.getEndPosition(compUnit, tree);
+        int end = (int) posns.getEndPosition(tree);
         return createDiagnosticPosition(tree, start, pos, end);
     }
 
diff --git a/src/jdk.jshell/share/classes/jdk/internal/shellsupport/doc/JavadocHelper.java b/src/jdk.jshell/share/classes/jdk/internal/shellsupport/doc/JavadocHelper.java
index 7a1dd6c9877..112808420bc 100644
--- a/src/jdk.jshell/share/classes/jdk/internal/shellsupport/doc/JavadocHelper.java
+++ b/src/jdk.jshell/share/classes/jdk/internal/shellsupport/doc/JavadocHelper.java
@@ -543,9 +543,9 @@ public abstract class JavadocHelper implements AutoCloseable {
 
                         for (DocTree t : inheritedText.get(0)) {
                             start = Math.min(start,
-                                             sp.getStartPosition(null, inheritedDocTree, t) - offset);
+                                             sp.getStartPosition(inheritedDocTree, t) - offset);
                             end   = Math.max(end,
-                                             sp.getEndPosition(null, inheritedDocTree, t) - offset);
+                                             sp.getEndPosition(inheritedDocTree, t) - offset);
                         }
                         String text = end >= 0 ? inherited.substring((int) start, (int) end) : "";
 
@@ -559,8 +559,8 @@ public abstract class JavadocHelper implements AutoCloseable {
                         } else {
                             //replace the {@inheritDoc} with the full text from
                             //the overridden method:
-                            long inheritedStart = sp.getStartPosition(null, dcTree, node);
-                            long inheritedEnd   = sp.getEndPosition(null, dcTree, node);
+                            long inheritedStart = sp.getStartPosition(dcTree, node);
+                            long inheritedEnd   = sp.getEndPosition(dcTree, node);
                             int[] span = new int[] {(int) inheritedStart, (int) inheritedEnd};
 
                             replace.computeIfAbsent(span, s -> new ArrayList<>())
@@ -571,11 +571,11 @@ public abstract class JavadocHelper implements AutoCloseable {
                 }
                 @Override
                 public Void visitLink(LinkTree node, Void p) {
-                    if (sp.isRewrittenTree(null, dcTree, node)) {
+                    if (sp.isRewrittenTree(dcTree, node)) {
                         //this link is a synthetic rewritten link, replace
                         //the original span with the new link:
-                        int start = (int) sp.getStartPosition(null, dcTree, node);
-                        int end   = (int) sp.getEndPosition(null, dcTree, node);
+                        int start = (int) sp.getStartPosition(dcTree, node);
+                        int end   = (int) sp.getEndPosition(dcTree, node);
 
                         replace.computeIfAbsent(new int[] {start, end}, _ -> new ArrayList<>())
                                .add(node.toString());
@@ -601,7 +601,7 @@ public abstract class JavadocHelper implements AutoCloseable {
                             //this tree)
                             //if there is a newline immediately behind this tree, insert behind
                             //the newline:
-                            long endPos = sp.getEndPosition(null, dcTree, tree);
+                            long endPos = sp.getEndPosition(dcTree, tree);
                             if (endPos >= offset) {
                                 if (endPos - offset + 1 < docComment.length() &&
                                     docComment.charAt((int) (endPos - offset + 1)) == '\n') {
@@ -744,7 +744,7 @@ public abstract class JavadocHelper implements AutoCloseable {
                         }
                     };
                 DocCommentTree tree = trees.getDocCommentTree(fo);
-                offset += (int) trees.getSourcePositions().getStartPosition(null, tree, tree);
+                offset += (int) trees.getSourcePositions().getStartPosition(tree, tree);
                 return Pair.of(tree, offset);
             } catch (URISyntaxException ex) {
                 throw new IllegalStateException(ex);
@@ -939,7 +939,7 @@ public abstract class JavadocHelper implements AutoCloseable {
                                                    Iterable<? extends DocTree> trees) {
             StringBuilder sourceBuilder = new StringBuilder();
             List<int[]> replaceSpans = new ArrayList<>();
-            int currentSpanStart = (int) sp.getStartPosition(null, comment, trees.iterator().next());
+            int currentSpanStart = (int) sp.getStartPosition(comment, trees.iterator().next());
             DocTree lastTree = null;
 
             for (DocTree tree : trees) {
@@ -958,8 +958,8 @@ public abstract class JavadocHelper implements AutoCloseable {
                     }
                     sourceBuilder.append(code);
                 } else {
-                    int treeStart = (int) sp.getStartPosition(null, comment, tree);
-                    int treeEnd = (int) sp.getEndPosition(null, comment, tree);
+                    int treeStart = (int) sp.getStartPosition(comment, tree);
+                    int treeEnd = (int) sp.getEndPosition(comment, tree);
                     replaceSpans.add(new int[] {currentSpanStart, treeStart});
                     currentSpanStart = treeEnd;
                     sourceBuilder.append(PLACEHOLDER);
@@ -967,7 +967,7 @@ public abstract class JavadocHelper implements AutoCloseable {
                 lastTree = tree;
             }
 
-            int end = (int) sp.getEndPosition(null, comment, lastTree);
+            int end = (int) sp.getEndPosition(comment, lastTree);
 
             replaceSpans.add(new int[] {currentSpanStart, end});
 
@@ -1006,8 +1006,8 @@ public abstract class JavadocHelper implements AutoCloseable {
             }
 
             @Override
-            public long getStartPosition(CompilationUnitTree file, DocCommentTree comment, DocTree tree) {
-                ensureAdjustedSpansFilled(file, comment, tree);
+            public long getStartPosition(DocCommentTree comment, DocTree tree) {
+                ensureAdjustedSpansFilled(comment, tree);
 
                 long[] adjusted = adjustedSpan.get(tree);
 
@@ -1015,12 +1015,12 @@ public abstract class JavadocHelper implements AutoCloseable {
                     return adjusted[0];
                 }
 
-                return delegate.getStartPosition(file, comment, tree);
+                return delegate.getStartPosition(comment, tree);
             }
 
             @Override
-            public long getEndPosition(CompilationUnitTree file, DocCommentTree comment, DocTree tree) {
-                ensureAdjustedSpansFilled(file, comment, tree);
+            public long getEndPosition(DocCommentTree comment, DocTree tree) {
+                ensureAdjustedSpansFilled(comment, tree);
 
                 long[] adjusted = adjustedSpan.get(tree);
 
@@ -1028,28 +1028,26 @@ public abstract class JavadocHelper implements AutoCloseable {
                     return adjusted[1];
                 }
 
-                return delegate.getEndPosition(file, comment, tree);
+                return delegate.getEndPosition(comment, tree);
             }
 
             @Override
-            public long getStartPosition(CompilationUnitTree file, Tree tree) {
-                return delegate.getStartPosition(file, tree);
+            public long getStartPosition(Tree tree) {
+                return delegate.getStartPosition(tree);
             }
 
             @Override
-            public long getEndPosition(CompilationUnitTree file, Tree tree) {
-                return delegate.getEndPosition(file, tree);
+            public long getEndPosition(Tree tree) {
+                return delegate.getEndPosition(tree);
             }
 
-            boolean isRewrittenTree(CompilationUnitTree file,
-                                    DocCommentTree comment,
+            boolean isRewrittenTree(DocCommentTree comment,
                                     DocTree tree) {
-                ensureAdjustedSpansFilled(file, comment, tree);
+                ensureAdjustedSpansFilled(comment, tree);
                 return rewrittenTrees.contains(tree);
             }
 
-            private void ensureAdjustedSpansFilled(CompilationUnitTree file,
-                                                   DocCommentTree comment,
+            private void ensureAdjustedSpansFilled(DocCommentTree comment,
                                                    DocTree tree) {
                 if (tree.getKind() != DocTree.Kind.LINK &&
                     tree.getKind() != DocTree.Kind.LINK_PLAIN) {
@@ -1057,7 +1055,7 @@ public abstract class JavadocHelper implements AutoCloseable {
                 }
 
                 long[] span;
-                long treeStart = delegate.getStartPosition(file, comment, tree);
+                long treeStart = delegate.getStartPosition(comment, tree);
 
                 if (treeStart == (-1)) {
                     LinkTree link = (LinkTree) tree;
@@ -1069,15 +1067,15 @@ public abstract class JavadocHelper implements AutoCloseable {
 
                     for (DocTree t : nested) {
                         start = Math.min(start,
-                                         delegate.getStartPosition(file, comment, t));
+                                         delegate.getStartPosition(comment, t));
                         end   = Math.max(end,
-                                         delegate.getEndPosition(file, comment, t));
+                                         delegate.getEndPosition(comment, t));
                     }
 
                     span = new long[] {(int) start - 1, (int) end + 1};
                     rewrittenTrees.add(tree);
                 } else {
-                    long treeEnd = delegate.getEndPosition(file, comment, tree);
+                    long treeEnd = delegate.getEndPosition(comment, tree);
                     span = new long[] {treeStart, treeEnd};
                 }
 
diff --git a/src/jdk.jshell/share/classes/jdk/jshell/SourceCodeAnalysisImpl.java b/src/jdk.jshell/share/classes/jdk/jshell/SourceCodeAnalysisImpl.java
index 35faab231af..215b412003d 100644
--- a/src/jdk.jshell/share/classes/jdk/jshell/SourceCodeAnalysisImpl.java
+++ b/src/jdk.jshell/share/classes/jdk/jshell/SourceCodeAnalysisImpl.java
@@ -464,7 +464,7 @@ class SourceCodeAnalysisImpl extends SourceCodeAnalysis {
                         ImportTree it = findImport(tp);
 
                         if (it != null && it.isModule()) {
-                            int selectStart = (int) sp.getStartPosition(topLevel, tp.getLeaf());
+                            int selectStart = (int) sp.getStartPosition(tp.getLeaf());
                             String qualifiedPrefix = it.getQualifiedIdentifier().getKind() == Kind.MEMBER_SELECT
                                 ? ((MemberSelectTree) it.getQualifiedIdentifier()).getExpression().toString() + "."
                                 : "";
@@ -634,7 +634,7 @@ class SourceCodeAnalysisImpl extends SourceCodeAnalysis {
                             Element annotationType = tp.getParentPath().getParentPath().getLeaf().getKind() == Kind.ANNOTATION
                                     ? at.trees().getElement(tp.getParentPath().getParentPath())
                                     : at.trees().getElement(tp.getParentPath().getParentPath().getParentPath());
-                            if (sp.getEndPosition(topLevel, tp.getParentPath().getLeaf()) == (-1)) {
+                            if (sp.getEndPosition(tp.getParentPath().getLeaf()) == (-1)) {
                                 //synthetic 'value':
                                 //TODO: filter out existing:
                                 addElements(javadoc, ElementFilter.methodsIn(annotationType.getEnclosedElements()), TRUE, TRUE, cursor, prefix, result);
@@ -846,14 +846,14 @@ class SourceCodeAnalysisImpl extends SourceCodeAnalysis {
             new TreePathScanner<Void, Void>() {
                 @Override
                 public Void visitIdentifier(IdentifierTree node, Void p) {
-                    long start = sp.getStartPosition(cut, node);
-                    long end = sp.getEndPosition(cut, node);
+                    long start = sp.getStartPosition(node);
+                    long end = sp.getEndPosition(node);
                     handleElement(false, start, end);
                     return super.visitIdentifier(node, p);
                 }
                 @Override
                 public Void visitMemberSelect(MemberSelectTree node, Void p) {
-                    long exprEnd = sp.getEndPosition(cut, node.getExpression());
+                    long exprEnd = sp.getEndPosition(node.getExpression());
                     Token ident = findTokensFrom(exprEnd, TokenKind.DOT, TokenKind.IDENTIFIER);
                     if (ident != null) {
                         handleElement(false, ident.pos, ident.endPos);
@@ -866,16 +866,16 @@ class SourceCodeAnalysisImpl extends SourceCodeAnalysis {
                     if (mods.getFlags().contains(Modifier.SEALED) ||
                         mods.getFlags().contains(Modifier.NON_SEALED)) {
                         List<Token> modifierTokens = new ArrayList<>();
-                        long modsStart = sp.getStartPosition(cut, mods);
-                        long modsEnd = sp.getEndPosition(cut, mods);
+                        long modsStart = sp.getStartPosition(mods);
+                        long modsEnd = sp.getEndPosition(mods);
                         for (Token t : tokens) {
                             if (t.pos >= modsStart && t.endPos <= modsEnd) {
                                 modifierTokens.add(t);
                             }
                         }
                         for (AnnotationTree at : mods.getAnnotations()) {
-                            long annStart = sp.getStartPosition(cut, at);
-                            long annEnd = sp.getEndPosition(cut, at);
+                            long annStart = sp.getStartPosition(at);
+                            long annEnd = sp.getEndPosition(at);
                             modifierTokens.removeIf(t -> t.pos >= annStart && t.endPos <= annEnd);
                         }
                         OUTER: for (int i = 0; i < modifierTokens.size(); i++) {
@@ -912,7 +912,7 @@ class SourceCodeAnalysisImpl extends SourceCodeAnalysis {
                         handleElement(true, ident.pos, ident.endPos);
                     }
                     if (!node.getPermitsClause().isEmpty()) {
-                        long start = sp.getStartPosition(cut, node.getPermitsClause().get(0));
+                        long start = sp.getStartPosition(node.getPermitsClause().get(0));
                         Token permitsCandidate = findTokensBefore(start, TokenKind.IDENTIFIER);
                         if (permitsCandidate != null && permitsCandidate.name().contentEquals("permits")) {
                             addKeyword.accept(permitsCandidate);
@@ -946,7 +946,7 @@ class SourceCodeAnalysisImpl extends SourceCodeAnalysis {
                 }
                 @Override
                 public Void visitYield(YieldTree node, Void p) {
-                    long start = sp.getStartPosition(cut, node);
+                    long start = sp.getStartPosition(node);
                     Token yield = findTokensFrom(start, TokenKind.IDENTIFIER);
                     addKeyword.accept(yield);
                     return super.visitYield(node, p);
@@ -961,7 +961,7 @@ class SourceCodeAnalysisImpl extends SourceCodeAnalysis {
                 @Override
                 public Void scan(Tree tree, Void p) {
                     if (tree != null) {
-                        long end = sp.getEndPosition(cut, tree);
+                        long end = sp.getEndPosition(tree);
                         if (end == (-1)) {
                             //synthetic
                             return null;
@@ -1072,14 +1072,14 @@ class SourceCodeAnalysisImpl extends SourceCodeAnalysis {
                 if (tree == null)
                     return null;
 
-                long start = sp.getStartPosition(topLevel, tree);
-                long end = sp.getEndPosition(topLevel, tree);
+                long start = sp.getStartPosition(tree);
+                long end = sp.getEndPosition(tree);
 
                 if (end == (-1) && tree.getKind() == Kind.ASSIGNMENT &&
                     getCurrentPath() != null &&
                     getCurrentPath().getLeaf().getKind() == Kind.ANNOTATION) {
                     //the assignment is synthetically generated, take the end pos of the nested tree:
-                    end = sp.getEndPosition(topLevel, ((AssignmentTree) tree).getExpression());
+                    end = sp.getEndPosition(((AssignmentTree) tree).getExpression());
                 }
                 if (start <= wrapEndPos && wrapEndPos <= end &&
                     (deepest[0] == null || deepest[0].getLeaf() == getCurrentPath().getLeaf())) {
diff --git a/src/jdk.jshell/share/classes/jdk/jshell/TreeDissector.java b/src/jdk.jshell/share/classes/jdk/jshell/TreeDissector.java
index ef50f8ce71c..e5817f84206 100644
--- a/src/jdk.jshell/share/classes/jdk/jshell/TreeDissector.java
+++ b/src/jdk.jshell/share/classes/jdk/jshell/TreeDissector.java
@@ -119,11 +119,11 @@ class TreeDissector {
     }
 
     int getStartPosition(Tree tree) {
-        return (int) getSourcePositions().getStartPosition(targetCompilationUnit, tree);
+        return (int) getSourcePositions().getStartPosition(tree);
     }
 
     int getEndPosition(Tree tree) {
-        return (int) getSourcePositions().getEndPosition(targetCompilationUnit, tree);
+        return (int) getSourcePositions().getEndPosition(tree);
     }
 
     Range treeToRange(Tree tree) {

From 7df06d1489164e7668e5ca43ba256c76acc7bd33 Mon Sep 17 00:00:00 2001
From: Emanuel Peter <epeter@openjdk.org>
Date: Wed, 1 Apr 2026 12:18:29 +0000
Subject: [PATCH 458/655] 8379395: [VectorAlgorithms] new dot-product
 implementation using fma

Reviewed-by: mchevalier, chagedorn
---
 .../vectorization/TestVectorAlgorithms.java       | 12 ++++++++++++
 .../vectorization/VectorAlgorithmsImpl.java       | 15 +++++++++++++++
 .../bench/vm/compiler/VectorAlgorithms.java       |  5 +++++
 .../bench/vm/compiler/VectorAlgorithmsImpl.java   | 15 +++++++++++++++
 4 files changed, 47 insertions(+)

diff --git a/test/hotspot/jtreg/compiler/vectorization/TestVectorAlgorithms.java b/test/hotspot/jtreg/compiler/vectorization/TestVectorAlgorithms.java
index 2667ac59471..70dc9a4a0b4 100644
--- a/test/hotspot/jtreg/compiler/vectorization/TestVectorAlgorithms.java
+++ b/test/hotspot/jtreg/compiler/vectorization/TestVectorAlgorithms.java
@@ -122,6 +122,7 @@ public class TestVectorAlgorithms {
         testGroups.get("dotProductF").put("dotProductF_loop",                           i -> { return dotProductF_loop(d.aF, d.bF); });
         testGroups.get("dotProductF").put("dotProductF_VectorAPI_naive",                i -> { return dotProductF_VectorAPI_naive(d.aF, d.bF); });
         testGroups.get("dotProductF").put("dotProductF_VectorAPI_reduction_after_loop", i -> { return dotProductF_VectorAPI_reduction_after_loop(d.aF, d.bF); });
+        testGroups.get("dotProductF").put("dotProductF_VectorAPI_fma",                  i -> { return dotProductF_VectorAPI_fma(d.aF, d.bF); });
 
         testGroups.put("hashCodeB", new HashMap<String,TestFunction>());
         testGroups.get("hashCodeB").put("hashCodeB_loop",         i -> { return hashCodeB_loop(d.aB); });
@@ -192,6 +193,7 @@ public class TestVectorAlgorithms {
                  "dotProductF_loop",
                  "dotProductF_VectorAPI_naive",
                  "dotProductF_VectorAPI_reduction_after_loop",
+                 "dotProductF_VectorAPI_fma",
                  "hashCodeB_loop",
                  "hashCodeB_Arrays",
                  "hashCodeB_VectorAPI_v1",
@@ -409,6 +411,16 @@ public class TestVectorAlgorithms {
         return VectorAlgorithmsImpl.dotProductF_VectorAPI_reduction_after_loop(a, b);
     }
 
+    @Test
+    @IR(counts = {IRNode.LOAD_VECTOR_F,   "> 0",
+                  IRNode.ADD_REDUCTION_V, "> 0",
+                  IRNode.FMA_VF,          "> 0"},
+        applyIfCPUFeatureOr = {"avx2", "true", "asimd", "true", "rvv", "true"},
+        applyIf = {"UseSuperWord", "true"})
+    public float dotProductF_VectorAPI_fma(float[] a, float[] b) {
+        return VectorAlgorithmsImpl.dotProductF_VectorAPI_fma(a, b);
+    }
+
     @Test
     public int hashCodeB_loop(byte[] a) {
         return VectorAlgorithmsImpl.hashCodeB_loop(a);
diff --git a/test/hotspot/jtreg/compiler/vectorization/VectorAlgorithmsImpl.java b/test/hotspot/jtreg/compiler/vectorization/VectorAlgorithmsImpl.java
index 8276d90509f..e4c9eb74e7d 100644
--- a/test/hotspot/jtreg/compiler/vectorization/VectorAlgorithmsImpl.java
+++ b/test/hotspot/jtreg/compiler/vectorization/VectorAlgorithmsImpl.java
@@ -348,6 +348,21 @@ public class VectorAlgorithmsImpl {
         return sum;
     }
 
+    public static float dotProductF_VectorAPI_fma(float[] a, float[] b) {
+        var sums = FloatVector.broadcast(SPECIES_F, 0.0f);
+        int i;
+        for (i = 0; i < SPECIES_F.loopBound(a.length); i += SPECIES_F.length()) {
+            var va = FloatVector.fromArray(SPECIES_F, a, i);
+            var vb = FloatVector.fromArray(SPECIES_F, b, i);
+            sums = va.fma(vb, sums);
+        }
+        float sum = sums.reduceLanes(VectorOperators.ADD);
+        for (; i < a.length; i++) {
+            sum = Math.fma(a[i], b[i], sum);
+        }
+        return sum;
+    }
+
     public static int hashCodeB_loop(byte[] a) {
         int h = 1;
         for (int i = 0; i < a.length; i++) {
diff --git a/test/micro/org/openjdk/bench/vm/compiler/VectorAlgorithms.java b/test/micro/org/openjdk/bench/vm/compiler/VectorAlgorithms.java
index f60dfcb2d7c..0a6aa03586b 100644
--- a/test/micro/org/openjdk/bench/vm/compiler/VectorAlgorithms.java
+++ b/test/micro/org/openjdk/bench/vm/compiler/VectorAlgorithms.java
@@ -165,6 +165,11 @@ public class VectorAlgorithms {
         return VectorAlgorithmsImpl.dotProductF_VectorAPI_reduction_after_loop(d.aF, d.bF);
     }
 
+    @Benchmark
+    public float dotProductF_VectorAPI_fma() {
+        return VectorAlgorithmsImpl.dotProductF_VectorAPI_fma(d.aF, d.bF);
+    }
+
     @Benchmark
     public int hashCodeB_loop() {
         return VectorAlgorithmsImpl.hashCodeB_loop(d.aB);
diff --git a/test/micro/org/openjdk/bench/vm/compiler/VectorAlgorithmsImpl.java b/test/micro/org/openjdk/bench/vm/compiler/VectorAlgorithmsImpl.java
index 3ae4ed81634..0d33a109d5b 100644
--- a/test/micro/org/openjdk/bench/vm/compiler/VectorAlgorithmsImpl.java
+++ b/test/micro/org/openjdk/bench/vm/compiler/VectorAlgorithmsImpl.java
@@ -348,6 +348,21 @@ public class VectorAlgorithmsImpl {
         return sum;
     }
 
+    public static float dotProductF_VectorAPI_fma(float[] a, float[] b) {
+        var sums = FloatVector.broadcast(SPECIES_F, 0.0f);
+        int i;
+        for (i = 0; i < SPECIES_F.loopBound(a.length); i += SPECIES_F.length()) {
+            var va = FloatVector.fromArray(SPECIES_F, a, i);
+            var vb = FloatVector.fromArray(SPECIES_F, b, i);
+            sums = va.fma(vb, sums);
+        }
+        float sum = sums.reduceLanes(VectorOperators.ADD);
+        for (; i < a.length; i++) {
+            sum = Math.fma(a[i], b[i], sum);
+        }
+        return sum;
+    }
+
     public static int hashCodeB_loop(byte[] a) {
         int h = 1;
         for (int i = 0; i < a.length; i++) {

From 9607a7284d5858aee735c7a0db36c88d5d2a3a24 Mon Sep 17 00:00:00 2001
From: Emanuel Peter <epeter@openjdk.org>
Date: Wed, 1 Apr 2026 12:18:49 +0000
Subject: [PATCH 459/655] 8380513: [VectorAlgorithms] mismatch benchmark and
 test

Reviewed-by: mchevalier, galder, chagedorn
---
 .../vectorization/TestVectorAlgorithms.java   | 38 ++++++++++
 .../vectorization/VectorAlgorithmsImpl.java   | 72 +++++++++++++++++++
 .../bench/vm/compiler/VectorAlgorithms.java   | 20 ++++++
 .../vm/compiler/VectorAlgorithmsImpl.java     | 72 +++++++++++++++++++
 4 files changed, 202 insertions(+)

diff --git a/test/hotspot/jtreg/compiler/vectorization/TestVectorAlgorithms.java b/test/hotspot/jtreg/compiler/vectorization/TestVectorAlgorithms.java
index 70dc9a4a0b4..ec1b43dd3f2 100644
--- a/test/hotspot/jtreg/compiler/vectorization/TestVectorAlgorithms.java
+++ b/test/hotspot/jtreg/compiler/vectorization/TestVectorAlgorithms.java
@@ -143,6 +143,12 @@ public class TestVectorAlgorithms {
         testGroups.get("findI").put("findI_loop",      i -> { return findI_loop(d.aI, d.eI_findI[i]); });
         testGroups.get("findI").put("findI_VectorAPI", i -> { return findI_VectorAPI(d.aI, d.eI_findI[i]); });
 
+        testGroups.put("mismatchB", new HashMap<String,TestFunction>());
+        testGroups.get("mismatchB").put("mismatchB_loop",          i -> { return d.wrap_mismatchB(i, TestVectorAlgorithms::mismatchB_loop); });
+        testGroups.get("mismatchB").put("mismatchB_Arrays",        i -> { return d.wrap_mismatchB(i, TestVectorAlgorithms::mismatchB_Arrays); });
+        testGroups.get("mismatchB").put("mismatchB_MemorySegment", i -> { return d.wrap_mismatchB(i, TestVectorAlgorithms::mismatchB_MemorySegment); });
+        testGroups.get("mismatchB").put("mismatchB_VectorAPI",     i -> { return d.wrap_mismatchB(i, TestVectorAlgorithms::mismatchB_VectorAPI); });
+
         testGroups.put("reverseI", new HashMap<String,TestFunction>());
         testGroups.get("reverseI").put("reverseI_loop",      i -> { return reverseI_loop(d.aI, d.rI1); });
         testGroups.get("reverseI").put("reverseI_VectorAPI", i -> { return reverseI_VectorAPI(d.aI, d.rI2); });
@@ -205,6 +211,10 @@ public class TestVectorAlgorithms {
                  "findMinIndexI_VectorAPI",
                  "findI_loop",
                  "findI_VectorAPI",
+                 "mismatchB_loop",
+                 "mismatchB_Arrays",
+                 "mismatchB_MemorySegment",
+                 "mismatchB_VectorAPI",
                  "reverseI_loop",
                  "reverseI_VectorAPI",
                  "filterI_loop",
@@ -521,6 +531,34 @@ public class TestVectorAlgorithms {
         return VectorAlgorithmsImpl.findI_VectorAPI(a, e);
     }
 
+    @Test
+    @IR(counts = {IRNode.LOAD_VECTOR_B, "= 0"})
+    // Currently does not vectorize, but might in the future.
+    public static int mismatchB_loop(byte[] a, byte[] b) {
+        return VectorAlgorithmsImpl.mismatchB_loop(a, b);
+    }
+
+    @Test
+    // Inlining makes IR rules difficult. Just keep this as a correctness test.
+    public static int mismatchB_Arrays(byte[] a, byte[] b) {
+        return VectorAlgorithmsImpl.mismatchB_Arrays(a, b);
+    }
+
+    @Test
+    // Inlining makes IR rules difficult. Just keep this as a correctness test.
+    public static int mismatchB_MemorySegment(byte[] a, byte[] b) {
+        return VectorAlgorithmsImpl.mismatchB_MemorySegment(a, b);
+    }
+
+    @Test
+    @IR(counts = {IRNode.LOAD_VECTOR_B,   "> 0",
+                  IRNode.VECTOR_MASK_CMP, "> 0",
+                  IRNode.VECTOR_TEST,     "> 0"},
+        applyIfCPUFeatureOr = {"avx", "true", "asimd", "true", "rvv", "true"})
+    public static int mismatchB_VectorAPI(byte[] a, byte[] b) {
+        return VectorAlgorithmsImpl.mismatchB_VectorAPI(a, b);
+    }
+
     @Test
     @IR(counts = {IRNode.LOAD_VECTOR_I, "= 0",
                   IRNode.STORE_VECTOR,  "= 0"})
diff --git a/test/hotspot/jtreg/compiler/vectorization/VectorAlgorithmsImpl.java b/test/hotspot/jtreg/compiler/vectorization/VectorAlgorithmsImpl.java
index e4c9eb74e7d..c06473d26c5 100644
--- a/test/hotspot/jtreg/compiler/vectorization/VectorAlgorithmsImpl.java
+++ b/test/hotspot/jtreg/compiler/vectorization/VectorAlgorithmsImpl.java
@@ -26,6 +26,7 @@ package compiler.vectorization;
 
 import java.util.Arrays;
 import java.util.Random;
+import java.lang.foreign.MemorySegment;
 import jdk.incubator.vector.*;
 
 /**
@@ -94,6 +95,15 @@ public class VectorAlgorithmsImpl {
         public int[] oopsX4;
         public int[] memX4;
 
+        // Input for mismatchB
+        // We set m1B and m2B to have identical data, temporarily edit m2B at one position,
+        // run the mismatch implementation, and then reset that position. This means we
+        // perform as little mutation while randomizing the input data.
+        public byte[] m1B;
+        public byte[] m2B;
+        public int[] mismatchB_idx;
+        public int mismatchB_idx_idx = 0;
+
         public Data(int size, int seed, int numX4Objects, float branchProbability) {
             Random random = new Random(seed);
 
@@ -165,6 +175,30 @@ public class VectorAlgorithmsImpl {
                           ? (byte)(random.nextInt(16) + 'A')
                           : (byte)(random.nextInt(16) + 'a');
             }
+
+            // Input data for mismatchB
+            m1B = new byte[size];
+            m2B = new byte[size];
+            random.nextBytes(m1B);
+            System.arraycopy(m1B, 0, m2B, 0, size);
+
+            mismatchB_idx = new int[0x10000];
+            for (int i = 0; i < mismatchB_idx.length; i++) {
+                // Sometimes make no mutation (-1), sometimes pick index for mutation.
+                mismatchB_idx[i] = (random.nextInt(10) == 0) ? -1 : random.nextInt(m1B.length);
+            }
+        }
+
+        public interface MismatchBImpl {
+            int run(byte[] a, byte[] b);
+        }
+
+        public int wrap_mismatchB(int idx, MismatchBImpl impl) {
+            int i = mismatchB_idx[idx & 0xffff];
+            if (i != -1) { m2B[i]++; }
+            int res = impl.run(m1B, m2B);
+            if (i != -1) { m2B[i]--; }
+            return res;
         }
     }
 
@@ -671,6 +705,44 @@ public class VectorAlgorithmsImpl {
         return -1;
     }
 
+    public static int mismatchB_loop(byte[] a, byte[] b) {
+        for (int i = 0; i < a.length; i++) {
+            if (a[i] != b[i]) {
+                return i;
+            }
+        }
+        return -1;
+    }
+
+    public static int mismatchB_Arrays(byte[] a, byte[] b) {
+        return Arrays.mismatch(a, b);
+    }
+
+    public static int mismatchB_MemorySegment(byte[] a, byte[] b) {
+        var aMS = MemorySegment.ofArray(a);
+        var bMS = MemorySegment.ofArray(b);
+        return (int) aMS.mismatch(bMS);
+    }
+
+    public static int mismatchB_VectorAPI(byte[] a, byte[] b) {
+        int i = 0;
+        for (; i < SPECIES_B.loopBound(a.length); i += SPECIES_B.length()) {
+            ByteVector va = ByteVector.fromArray(SPECIES_B, a, i);
+            ByteVector vb = ByteVector.fromArray(SPECIES_B, b, i);
+            var mask = va.compare(VectorOperators.NE, vb);
+            if (mask.anyTrue()) {
+                return i + mask.firstTrue();
+            }
+        }
+        for (; i < a.length; i++) {
+            if (a[i] != b[i]) {
+                return i;
+            }
+        }
+        return -1;
+    }
+
+
     public static Object reverseI_loop(int[] a, int[] r) {
         for (int i = 0; i < a.length; i++) {
             r[a.length - i - 1] = a[i];
diff --git a/test/micro/org/openjdk/bench/vm/compiler/VectorAlgorithms.java b/test/micro/org/openjdk/bench/vm/compiler/VectorAlgorithms.java
index 0a6aa03586b..8f5d83c4ae3 100644
--- a/test/micro/org/openjdk/bench/vm/compiler/VectorAlgorithms.java
+++ b/test/micro/org/openjdk/bench/vm/compiler/VectorAlgorithms.java
@@ -232,6 +232,26 @@ public class VectorAlgorithms {
         return VectorAlgorithmsImpl.findI_VectorAPI(d.aI, e);
     }
 
+    @Benchmark
+    public int mismatchB_loop() {
+        return d.wrap_mismatchB(d.mismatchB_idx_idx++, VectorAlgorithmsImpl::mismatchB_loop);
+    }
+
+    @Benchmark
+    public int mismatchB_Arrays() {
+        return d.wrap_mismatchB(d.mismatchB_idx_idx++, VectorAlgorithmsImpl::mismatchB_Arrays);
+    }
+
+    @Benchmark
+    public int mismatchB_MemorySegment() {
+        return d.wrap_mismatchB(d.mismatchB_idx_idx++, VectorAlgorithmsImpl::mismatchB_MemorySegment);
+    }
+
+    @Benchmark
+    public int mismatchB_VectorAPI() {
+        return d.wrap_mismatchB(d.mismatchB_idx_idx++, VectorAlgorithmsImpl::mismatchB_VectorAPI);
+    }
+
     @Benchmark
     public Object reverseI_loop() {
         return VectorAlgorithmsImpl.reverseI_loop(d.aI, d.rI1);
diff --git a/test/micro/org/openjdk/bench/vm/compiler/VectorAlgorithmsImpl.java b/test/micro/org/openjdk/bench/vm/compiler/VectorAlgorithmsImpl.java
index 0d33a109d5b..a60ecc0f41a 100644
--- a/test/micro/org/openjdk/bench/vm/compiler/VectorAlgorithmsImpl.java
+++ b/test/micro/org/openjdk/bench/vm/compiler/VectorAlgorithmsImpl.java
@@ -26,6 +26,7 @@ package org.openjdk.bench.vm.compiler;
 
 import java.util.Arrays;
 import java.util.Random;
+import java.lang.foreign.MemorySegment;
 import jdk.incubator.vector.*;
 
 /**
@@ -94,6 +95,15 @@ public class VectorAlgorithmsImpl {
         public int[] oopsX4;
         public int[] memX4;
 
+        // Input for mismatchB
+        // We set m1B and m2B to have identical data, temporarily edit m2B at one position,
+        // run the mismatch implementation, and then reset that position. This means we
+        // perform as little mutation while randomizing the input data.
+        public byte[] m1B;
+        public byte[] m2B;
+        public int[] mismatchB_idx;
+        public int mismatchB_idx_idx = 0;
+
         public Data(int size, int seed, int numX4Objects, float branchProbability) {
             Random random = new Random(seed);
 
@@ -165,6 +175,30 @@ public class VectorAlgorithmsImpl {
                           ? (byte)(random.nextInt(16) + 'A')
                           : (byte)(random.nextInt(16) + 'a');
             }
+
+            // Input data for mismatchB
+            m1B = new byte[size];
+            m2B = new byte[size];
+            random.nextBytes(m1B);
+            System.arraycopy(m1B, 0, m2B, 0, size);
+
+            mismatchB_idx = new int[0x10000];
+            for (int i = 0; i < mismatchB_idx.length; i++) {
+                // Sometimes make no mutation (-1), sometimes pick index for mutation.
+                mismatchB_idx[i] = (random.nextInt(10) == 0) ? -1 : random.nextInt(m1B.length);
+            }
+        }
+
+        public interface MismatchBImpl {
+            int run(byte[] a, byte[] b);
+        }
+
+        public int wrap_mismatchB(int idx, MismatchBImpl impl) {
+            int i = mismatchB_idx[idx & 0xffff];
+            if (i != -1) { m2B[i]++; }
+            int res = impl.run(m1B, m2B);
+            if (i != -1) { m2B[i]--; }
+            return res;
         }
     }
 
@@ -671,6 +705,44 @@ public class VectorAlgorithmsImpl {
         return -1;
     }
 
+    public static int mismatchB_loop(byte[] a, byte[] b) {
+        for (int i = 0; i < a.length; i++) {
+            if (a[i] != b[i]) {
+                return i;
+            }
+        }
+        return -1;
+    }
+
+    public static int mismatchB_Arrays(byte[] a, byte[] b) {
+        return Arrays.mismatch(a, b);
+    }
+
+    public static int mismatchB_MemorySegment(byte[] a, byte[] b) {
+        var aMS = MemorySegment.ofArray(a);
+        var bMS = MemorySegment.ofArray(b);
+        return (int) aMS.mismatch(bMS);
+    }
+
+    public static int mismatchB_VectorAPI(byte[] a, byte[] b) {
+        int i = 0;
+        for (; i < SPECIES_B.loopBound(a.length); i += SPECIES_B.length()) {
+            ByteVector va = ByteVector.fromArray(SPECIES_B, a, i);
+            ByteVector vb = ByteVector.fromArray(SPECIES_B, b, i);
+            var mask = va.compare(VectorOperators.NE, vb);
+            if (mask.anyTrue()) {
+                return i + mask.firstTrue();
+            }
+        }
+        for (; i < a.length; i++) {
+            if (a[i] != b[i]) {
+                return i;
+            }
+        }
+        return -1;
+    }
+
+
     public static Object reverseI_loop(int[] a, int[] r) {
         for (int i = 0; i < a.length; i++) {
             r[a.length - i - 1] = a[i];

From f3a1c67b1cc2db2d6b3c0519737a6519ea4fbeea Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Paul=20H=C3=BCbner?= <phubner@openjdk.org>
Date: Wed, 1 Apr 2026 13:03:01 +0000
Subject: [PATCH 460/655] 8381464: Typo in Linker::captureCallState JavaDoc

Reviewed-by: liach, pminborg
---
 src/java.base/share/classes/java/lang/foreign/Linker.java | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/src/java.base/share/classes/java/lang/foreign/Linker.java b/src/java.base/share/classes/java/lang/foreign/Linker.java
index 1a7d33266aa..f597e4ee52e 100644
--- a/src/java.base/share/classes/java/lang/foreign/Linker.java
+++ b/src/java.base/share/classes/java/lang/foreign/Linker.java
@@ -833,7 +833,7 @@ public sealed interface Linker permits AbstractLinker {
          * <p>
          * Captured state can be stored in, or retrieved from the capture state segment by
          * constructing var handles from the {@linkplain #captureStateLayout capture state layout}.
-         * Some functions require this state the be initialized to a particular value before
+         * Some functions require this state to be initialized to a particular value before
          * invoking the downcall.
          * <p>
          * The following example demonstrates the use of this linker option:

From d2c1907349afcbc40b2626060960511e2dca01d4 Mon Sep 17 00:00:00 2001
From: Albert Mingkun Yang <ayang@openjdk.org>
Date: Wed, 1 Apr 2026 14:20:53 +0000
Subject: [PATCH 461/655] 8381466: G1: Fix outdated name in
 G1Policy::decide_on_concurrent_start_pause

Reviewed-by: tschatzl
---
 src/hotspot/share/gc/g1/g1Policy.cpp | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/src/hotspot/share/gc/g1/g1Policy.cpp b/src/hotspot/share/gc/g1/g1Policy.cpp
index b1c9f3a5b6f..5744bbc2f03 100644
--- a/src/hotspot/share/gc/g1/g1Policy.cpp
+++ b/src/hotspot/share/gc/g1/g1Policy.cpp
@@ -1256,7 +1256,7 @@ void G1Policy::decide_on_concurrent_start_pause() {
   // We are about to decide on whether this pause will be a
   // concurrent start pause.
 
-  // First, collector_state()->in_concurrent_start_gc() should not be already set. We
+  // First, collector_state()->is_in_concurrent_start_gc() should not already be set. We
   // will set it here if we have to. However, it should be cleared by
   // the end of the pause (it's only set for the duration of a
   // concurrent start pause).

From 3fba38ab74aafab07e2cbec5f159e0d4cccaa440 Mon Sep 17 00:00:00 2001
From: Mikael Vidstedt <mikael@openjdk.org>
Date: Wed, 1 Apr 2026 16:51:28 +0000
Subject: [PATCH 462/655] 8373521: Bump minimum boot jdk to JDK 26

Reviewed-by: liach, darcy, iris, erikj
---
 make/conf/github-actions.conf  | 20 ++++++++++----------
 make/conf/jib-profiles.js      |  4 ++--
 make/conf/version-numbers.conf |  4 ++--
 3 files changed, 14 insertions(+), 14 deletions(-)

diff --git a/make/conf/github-actions.conf b/make/conf/github-actions.conf
index ebfc9191535..6771e8923dc 100644
--- a/make/conf/github-actions.conf
+++ b/make/conf/github-actions.conf
@@ -29,21 +29,21 @@ GTEST_VERSION=1.14.0
 JTREG_VERSION=8.2.1+1
 
 LINUX_X64_BOOT_JDK_EXT=tar.gz
-LINUX_X64_BOOT_JDK_URL=https://download.java.net/java/GA/jdk25/bd75d5f9689641da8e1daabeccb5528b/36/GPL/openjdk-25_linux-x64_bin.tar.gz
-LINUX_X64_BOOT_JDK_SHA256=59cdcaf255add4721de38eb411d4ecfe779356b61fb671aee63c7dec78054c2b
+LINUX_X64_BOOT_JDK_URL=https://download.java.net/java/GA/jdk26/c3cc523845074aa0af4f5e1e1ed4151d/35/GPL/openjdk-26_linux-x64_bin.tar.gz
+LINUX_X64_BOOT_JDK_SHA256=83c78367f8c81257beef72aca4bbbf8e6dac8ca2b3a4546a85879a09e6e4e128
 
 ALPINE_LINUX_X64_BOOT_JDK_EXT=tar.gz
-ALPINE_LINUX_X64_BOOT_JDK_URL=https://github.com/adoptium/temurin25-binaries/releases/download/jdk-25%2B36/OpenJDK25U-jdk_x64_alpine-linux_hotspot_25_36.tar.gz
-ALPINE_LINUX_X64_BOOT_JDK_SHA256=637e47474d411ed86134f413af7d5fef4180ddb0bf556347b7e74a88cf8904c8
+ALPINE_LINUX_X64_BOOT_JDK_URL=https://github.com/adoptium/temurin26-binaries/releases/download/jdk-26%2B35/OpenJDK26U-jdk_x64_alpine-linux_hotspot_26_35.tar.gz
+ALPINE_LINUX_X64_BOOT_JDK_SHA256=c105e581fdccb4e7120d889235d1ad8d5b2bed0af4972bc881e0a8ba687c94a4
 
 MACOS_AARCH64_BOOT_JDK_EXT=tar.gz
-MACOS_AARCH64_BOOT_JDK_URL=https://download.java.net/java/GA/jdk25/bd75d5f9689641da8e1daabeccb5528b/36/GPL/openjdk-25_macos-aarch64_bin.tar.gz
-MACOS_AARCH64_BOOT_JDK_SHA256=2006337bf326fdfdf6117081751ba38c1c8706d63419ecac7ff102ff7c776876
+MACOS_AARCH64_BOOT_JDK_URL=https://download.java.net/java/GA/jdk26/c3cc523845074aa0af4f5e1e1ed4151d/35/GPL/openjdk-26_macos-aarch64_bin.tar.gz
+MACOS_AARCH64_BOOT_JDK_SHA256=254586bcd1bf6dcd125ad667ac32562cb1e2ab1abf3a61fb117b6fabb571e765
 
 MACOS_X64_BOOT_JDK_EXT=tar.gz
-MACOS_X64_BOOT_JDK_URL=https://download.java.net/java/GA/jdk25/bd75d5f9689641da8e1daabeccb5528b/36/GPL/openjdk-25_macos-x64_bin.tar.gz
-MACOS_X64_BOOT_JDK_SHA256=47482ad9888991ecac9b2bcc131e2b53ff78aff275104cef85f66252308e8a09
+MACOS_X64_BOOT_JDK_URL=https://download.java.net/java/GA/jdk26/c3cc523845074aa0af4f5e1e1ed4151d/35/GPL/openjdk-26_macos-x64_bin.tar.gz
+MACOS_X64_BOOT_JDK_SHA256=8642b89d889c14ede2c446fd5bbe3621c8a3082e3df02013fd1658e39f52929a
 
 WINDOWS_X64_BOOT_JDK_EXT=zip
-WINDOWS_X64_BOOT_JDK_URL=https://download.java.net/java/GA/jdk25/bd75d5f9689641da8e1daabeccb5528b/36/GPL/openjdk-25_windows-x64_bin.zip
-WINDOWS_X64_BOOT_JDK_SHA256=85bcc178461e2cb3c549ab9ca9dfa73afd54c09a175d6510d0884071867137d3
+WINDOWS_X64_BOOT_JDK_URL=https://download.java.net/java/GA/jdk26/c3cc523845074aa0af4f5e1e1ed4151d/35/GPL/openjdk-26_windows-x64_bin.zip
+WINDOWS_X64_BOOT_JDK_SHA256=2dd2d92c9374cd49a120fe9d916732840bf6bb9f0e0cc29794917a3c08b99c5f
diff --git a/make/conf/jib-profiles.js b/make/conf/jib-profiles.js
index 76a94b7789e..4c1d2835054 100644
--- a/make/conf/jib-profiles.js
+++ b/make/conf/jib-profiles.js
@@ -387,8 +387,8 @@ var getJibProfilesCommon = function (input, data) {
         };
     };
 
-    common.boot_jdk_version = "25";
-    common.boot_jdk_build_number = "37";
+    common.boot_jdk_version = "26";
+    common.boot_jdk_build_number = "35";
     common.boot_jdk_home = input.get("boot_jdk", "install_path") + "/jdk-"
         + common.boot_jdk_version
         + (input.build_os == "macosx" ? ".jdk/Contents/Home" : "");
diff --git a/make/conf/version-numbers.conf b/make/conf/version-numbers.conf
index 4392d86ac33..4f63179ae05 100644
--- a/make/conf/version-numbers.conf
+++ b/make/conf/version-numbers.conf
@@ -1,5 +1,5 @@
 #
-# Copyright (c) 2011, 2025, Oracle and/or its affiliates. All rights reserved.
+# Copyright (c) 2011, 2026, Oracle and/or its affiliates. All rights reserved.
 # DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
 #
 # This code is free software; you can redistribute it and/or modify it
@@ -37,6 +37,6 @@ DEFAULT_VERSION_DATE=2026-09-15
 DEFAULT_VERSION_CLASSFILE_MAJOR=71  # "`$EXPR $DEFAULT_VERSION_FEATURE + 44`"
 DEFAULT_VERSION_CLASSFILE_MINOR=0
 DEFAULT_VERSION_DOCS_API_SINCE=11
-DEFAULT_ACCEPTABLE_BOOT_VERSIONS="25 26 27"
+DEFAULT_ACCEPTABLE_BOOT_VERSIONS="26 27"
 DEFAULT_JDK_SOURCE_TARGET_VERSION=27
 DEFAULT_PROMOTED_VERSION_PRE=ea

From eed91689f347e1e0491c4197ede680ef17d01062 Mon Sep 17 00:00:00 2001
From: Ioi Lam <iklam@openjdk.org>
Date: Wed, 1 Apr 2026 17:10:40 +0000
Subject: [PATCH 463/655] 8381117: AOT training run fails if memory for
 ConstantPool is reused

Reviewed-by: asmehra, iveresov, kvn
---
 .../share/cds/aotLinkedClassBulkLoader.cpp    |   4 +
 src/hotspot/share/cds/aotMetaspace.cpp        |  13 +-
 src/hotspot/share/cds/heapShared.cpp          |  11 +-
 src/hotspot/share/cds/heapShared.hpp          |   1 +
 .../share/classfile/classLoaderData.cpp       |   4 +-
 src/hotspot/share/oops/instanceKlass.cpp      |   1 +
 .../aotCache/RedefineClassesInProfile.java    | 178 ++++++++++++++++++
 .../test-classes/RedefGeneration0.java        |  75 ++++++++
 .../test-classes/RedefGeneration1.java        |  54 ++++++
 .../runtime/cds/appcds/test-classes/Util.java |   5 +-
 10 files changed, 336 insertions(+), 10 deletions(-)
 create mode 100644 test/hotspot/jtreg/runtime/cds/appcds/aotCache/RedefineClassesInProfile.java
 create mode 100644 test/hotspot/jtreg/runtime/cds/appcds/aotCache/test-classes/RedefGeneration0.java
 create mode 100644 test/hotspot/jtreg/runtime/cds/appcds/aotCache/test-classes/RedefGeneration1.java

diff --git a/src/hotspot/share/cds/aotLinkedClassBulkLoader.cpp b/src/hotspot/share/cds/aotLinkedClassBulkLoader.cpp
index 6a60177fc40..8129e6a5a81 100644
--- a/src/hotspot/share/cds/aotLinkedClassBulkLoader.cpp
+++ b/src/hotspot/share/cds/aotLinkedClassBulkLoader.cpp
@@ -280,6 +280,10 @@ void AOTLinkedClassBulkLoader::init_non_javabase_classes_impl(TRAPS) {
     tty->print_cr("==================== archived_training_data ** after all classes preloaded ====================");
     TrainingData::print_archived_training_data_on(tty);
   }
+  LogStreamHandle(Info, aot, training, data) log;
+  if (log.is_enabled()) {
+    TrainingData::print_archived_training_data_on(&log);
+  }
 }
 
 // For the AOT cache to function properly, all classes in the AOTLinkedClassTable
diff --git a/src/hotspot/share/cds/aotMetaspace.cpp b/src/hotspot/share/cds/aotMetaspace.cpp
index 55e9f93b3ab..4c23ede9cb8 100644
--- a/src/hotspot/share/cds/aotMetaspace.cpp
+++ b/src/hotspot/share/cds/aotMetaspace.cpp
@@ -949,11 +949,18 @@ void AOTMetaspace::dump_static_archive(TRAPS) {
   ResourceMark rm(THREAD);
   HandleMark hm(THREAD);
 
- if (CDSConfig::is_dumping_final_static_archive() && AOTPrintTrainingInfo) {
-   tty->print_cr("==================== archived_training_data ** before dumping ====================");
-   TrainingData::print_archived_training_data_on(tty);
+ if (CDSConfig::is_dumping_final_static_archive()) {
+   if (AOTPrintTrainingInfo) {
+     tty->print_cr("==================== archived_training_data ** before dumping ====================");
+     TrainingData::print_archived_training_data_on(tty);
+   }
+   LogStreamHandle(Info, aot, training, data) log;
+   if (log.is_enabled()) {
+     TrainingData::print_archived_training_data_on(&log);
+   }
  }
 
+
   StaticArchiveBuilder builder;
   dump_static_archive_impl(builder, THREAD);
   if (HAS_PENDING_EXCEPTION) {
diff --git a/src/hotspot/share/cds/heapShared.cpp b/src/hotspot/share/cds/heapShared.cpp
index f721b4b370c..d75816656b0 100644
--- a/src/hotspot/share/cds/heapShared.cpp
+++ b/src/hotspot/share/cds/heapShared.cpp
@@ -689,11 +689,6 @@ public:
 };
 
 void HeapShared::add_scratch_resolved_references(ConstantPool* src, objArrayOop dest) {
-  if (CDSConfig::is_dumping_preimage_static_archive() && scratch_resolved_references(src) != nullptr) {
-    // We are in AOT training run. The class has been redefined and we are giving it a new resolved_reference.
-    // Ignore it, as this class will be excluded from the AOT config.
-    return;
-  }
   if (SystemDictionaryShared::is_builtin_loader(src->pool_holder()->class_loader_data())) {
     _scratch_objects_table->set_oop(src, dest);
   }
@@ -703,6 +698,12 @@ objArrayOop HeapShared::scratch_resolved_references(ConstantPool* src) {
   return (objArrayOop)_scratch_objects_table->get_oop(src);
 }
 
+void HeapShared::remove_scratch_resolved_references(ConstantPool* src) {
+  if (CDSConfig::is_dumping_heap()) {
+    _scratch_objects_table->remove_oop(src);
+  }
+}
+
 void HeapShared::init_dumping() {
   _scratch_objects_table = new (mtClass)MetaspaceObjToOopHandleTable();
   _pending_roots = new GrowableArrayCHeap<oop, mtClassShared>(500);
diff --git a/src/hotspot/share/cds/heapShared.hpp b/src/hotspot/share/cds/heapShared.hpp
index c3ad1f666b1..10ea35ab56e 100644
--- a/src/hotspot/share/cds/heapShared.hpp
+++ b/src/hotspot/share/cds/heapShared.hpp
@@ -451,6 +451,7 @@ private:
   static void write_heap(AOTMappedHeapInfo* mapped_heap_info, AOTStreamedHeapInfo* streamed_heap_info) NOT_CDS_JAVA_HEAP_RETURN;
   static objArrayOop scratch_resolved_references(ConstantPool* src);
   static void add_scratch_resolved_references(ConstantPool* src, objArrayOop dest) NOT_CDS_JAVA_HEAP_RETURN;
+  static void remove_scratch_resolved_references(ConstantPool* src) NOT_CDS_JAVA_HEAP_RETURN;
   static void init_dumping() NOT_CDS_JAVA_HEAP_RETURN;
   static void init_scratch_objects_for_basic_type_mirrors(TRAPS) NOT_CDS_JAVA_HEAP_RETURN;
   static void init_box_classes(TRAPS) NOT_CDS_JAVA_HEAP_RETURN;
diff --git a/src/hotspot/share/classfile/classLoaderData.cpp b/src/hotspot/share/classfile/classLoaderData.cpp
index dfc3b74db96..d1ea9c09d4c 100644
--- a/src/hotspot/share/classfile/classLoaderData.cpp
+++ b/src/hotspot/share/classfile/classLoaderData.cpp
@@ -1,5 +1,5 @@
  /*
- * Copyright (c) 2012, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2012, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -46,6 +46,7 @@
 // The bootstrap loader (represented by null) also has a ClassLoaderData,
 // the singleton class the_null_class_loader_data().
 
+#include "cds/heapShared.hpp"
 #include "classfile/classLoaderData.inline.hpp"
 #include "classfile/classLoaderDataGraph.inline.hpp"
 #include "classfile/dictionary.hpp"
@@ -899,6 +900,7 @@ void ClassLoaderData::free_deallocate_list() {
       if (m->is_method()) {
         MetadataFactory::free_metadata(this, (Method*)m);
       } else if (m->is_constantPool()) {
+        HeapShared::remove_scratch_resolved_references((ConstantPool*)m);
         MetadataFactory::free_metadata(this, (ConstantPool*)m);
       } else if (m->is_klass()) {
         MetadataFactory::free_metadata(this, (InstanceKlass*)m);
diff --git a/src/hotspot/share/oops/instanceKlass.cpp b/src/hotspot/share/oops/instanceKlass.cpp
index cb071f2abf0..d675e61cc05 100644
--- a/src/hotspot/share/oops/instanceKlass.cpp
+++ b/src/hotspot/share/oops/instanceKlass.cpp
@@ -704,6 +704,7 @@ void InstanceKlass::deallocate_contents(ClassLoaderData* loader_data) {
   if (constants() != nullptr) {
     assert (!constants()->on_stack(), "shouldn't be called if anything is onstack");
     if (!constants()->in_aot_cache()) {
+      HeapShared::remove_scratch_resolved_references(constants());
       MetadataFactory::free_metadata(loader_data, constants());
     }
     // Delete any cached resolution errors for the constant pool
diff --git a/test/hotspot/jtreg/runtime/cds/appcds/aotCache/RedefineClassesInProfile.java b/test/hotspot/jtreg/runtime/cds/appcds/aotCache/RedefineClassesInProfile.java
new file mode 100644
index 00000000000..f311629b2de
--- /dev/null
+++ b/test/hotspot/jtreg/runtime/cds/appcds/aotCache/RedefineClassesInProfile.java
@@ -0,0 +1,178 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ *
+ */
+
+
+/*
+ * @test
+ * @summary Class redefinition during training run
+ * @bug 8381117
+ * @requires vm.cds.supports.aot.class.linking
+ * @library /test/lib /test/hotspot/jtreg/runtime/cds/appcds/test-classes
+ *
+ * @compile test-classes/RedefGeneration0.java
+ * @run driver jdk.test.lib.helpers.ClassFileInstaller -jar redef0.jar
+ *             RedefFoo RedefBar
+ *             RedefTaz0 RedefTaz1 RedefTaz2 RedefTaz3 RedefTaz4
+ *             Qux0 Qux1 Qux2 Qux3 Qux4
+ *             Qux5 Qux6 Qux7 Qux8 Qux9
+ *
+ * @compile test-classes/RedefGeneration1.java
+ * @run driver jdk.test.lib.helpers.ClassFileInstaller -jar redef1.jar
+ *             RedefFoo RedefBar
+ *             RedefTaz0 RedefTaz1 RedefTaz2 RedefTaz3 RedefTaz4
+
+ * @run driver RedefineClassHelper
+ * @build RedefineClassesInProfile
+ * @run driver jdk.test.lib.helpers.ClassFileInstaller -jar app.jar RedefineClassesInProfileApp Util
+ * @run driver RedefineClassesInProfile
+ */
+
+import java.io.File;
+import jdk.test.lib.cds.SimpleCDSAppTester;
+import jdk.test.lib.process.OutputAnalyzer;
+import jdk.test.lib.process.ProcessTools;
+
+public class RedefineClassesInProfile {
+    public static void main(String... args) throws Exception {
+        SimpleCDSAppTester.of("RedefineClassesInProfile")
+            // redefineagent.jar is created by "@run driver RedefineClassHelper"
+            .addVmArgs("-javaagent:redefineagent.jar")
+            .addVmArgs("-Xlog:aot,aot+class=debug")
+            .addVmArgs("-Xlog:redefine+class+load")
+            .addVmArgs("-Xlog:aot+training+data")
+            .classpath("redef0.jar" +  File.pathSeparator + "app.jar")
+            .appCommandLine("RedefineClassesInProfileApp")
+            .setTrainingChecker((OutputAnalyzer out) -> {
+                    out.shouldContain("Skipping RedefFoo: Has been redefined");
+                    out.shouldContain("Skipping RedefBar: Has been redefined");
+
+                    for (int i = 0; i < RedefineClassesInProfileApp.num_taz; i++) {
+                        out.shouldMatch("redefine,class,load.*redefined name=RedefTaz" + i);
+                    }
+                    for (int i = 0; i < RedefineClassesInProfileApp.num_qux; i++) {
+                        out.shouldMatch("aot,class.*klasses.*app *Qux" + i);
+                    }
+                })
+            .setAssemblyChecker((OutputAnalyzer out) -> {
+                    out.shouldNotContain("RedefFoo");
+
+                    // The names of the Redef* classes should not appear in training data,
+                    // as these classes have been redefined and excluded from the AOT cache.
+                    //
+                    // Note: do not pass Redef* as parameters in any of the methods that can be
+                    // stored into the AOT cache, or else the substring Redef* may appear in
+                    // method signatures, and make the following checks fail.
+                    String prefix = "aot,training,data.*";
+
+                    out.shouldMatch(prefix + "RedefineClassesInProfileApp"); // sanity
+                    out.shouldNotMatch(prefix + "RedefFoo");
+                    out.shouldNotMatch(prefix + "RedefBar");
+                    out.shouldNotMatch(prefix + "RedefTaz");
+                })
+            .setProductionChecker((OutputAnalyzer out) -> {
+                    out.shouldContain("Redefined: class RedefBar");
+                    out.shouldContain("Redefined: class RedefFoo");
+                })
+            .runAOTWorkflow();
+    }
+}
+
+class RedefineClassesInProfileApp {
+    static final int num_taz = 5;
+    static final int num_qux = 10;
+
+    public static void main(String[] args) throws Exception {
+        test1();
+    }
+
+    // test1
+    // (1) Training run should work fine even if ConstantPool from redefined classes
+    //     are reused by classes that are loaded later. See JDK-8381117
+    // (2) Pointers to redefined classes should be cleaned from TrainingData.
+    static void test1() throws Exception {
+        String jarFile = "redef1.jar";
+        Runnable dummy = () -> {};
+        Runnable redef_bar = () -> { redefine(jarFile, RedefBar.class); };
+        Runnable redef_foo = () -> { redefine(jarFile, RedefFoo.class); };
+
+        hotspot1();
+
+        int c1 = RedefFoo.foo1(dummy);
+        check("c1", c1, 1);
+
+        int c2 = RedefFoo.foo1(redef_bar);
+        check("c2", c2, 12);
+
+        int c3 = RedefFoo.foo1(redef_foo);
+        check("c3", c3, 22);
+
+        int c4 = RedefFoo.foo1(dummy);
+        check("c4", c4, 22);
+
+        // Redefine the RedefTaz* classes. This should free some constant pools
+        for (int i = 0; i < num_taz; i++) {
+            Class.forName("RedefTaz" + i);
+        }
+        for (int i = 0; i < num_taz; i++) {
+            redefine(jarFile, Class.forName("RedefTaz" + i));
+        }
+
+        // Load the Qux* classes. They *might* reuse the constant pools
+        // freed from above. See comments in test-classes/RedefGeneration0.java
+        // about the crash condition for JDK-8381117.
+        for (int i = 0; i < num_qux; i++) {
+            Class.forName("Qux" + i);
+        }
+    }
+
+    static volatile int x;
+    static void hotspot1() {
+        long start = System.currentTimeMillis();
+        // run this loop long enough (400ms) for it to be JIT compiled.
+        while (System.currentTimeMillis() - start < 400) {
+            // RedefFoo will be excluded fro the AOT configuration file, so
+            // any reference to RedefFoo recorded in TrainingData should be
+            // also be removed. If not, we are likely to see a crash in
+            // the assembly phase or production run.
+            x += RedefFoo.foo0();
+        }
+    }
+
+    static void check(String name, int actual, int expect) {
+        System.out.println(name + " = " + actual);
+        if (actual != expect) {
+            throw new RuntimeException(name + " should be " + expect + ", but is " + actual);
+        }
+    }
+
+    static void redefine(String jarFile, Class c) {
+        try {
+            byte[] b = Util.getClassFileFromJar(jarFile, c.getName());
+            RedefineClassHelper.redefineClass(c, b);
+            System.out.println("Redefined: " + c + ", Length = " + b.length);
+        } catch (Throwable t) {
+            throw new RuntimeException("Unexpected failure", t);
+        }
+    }
+}
diff --git a/test/hotspot/jtreg/runtime/cds/appcds/aotCache/test-classes/RedefGeneration0.java b/test/hotspot/jtreg/runtime/cds/appcds/aotCache/test-classes/RedefGeneration0.java
new file mode 100644
index 00000000000..27542b94e98
--- /dev/null
+++ b/test/hotspot/jtreg/runtime/cds/appcds/aotCache/test-classes/RedefGeneration0.java
@@ -0,0 +1,75 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ *
+ */
+
+// These are "generation 0" test classes used in redefinition tests.
+// These classes are loaded from the classpath, and will later be redefined
+// with the versions in RedefGeneration1.java
+
+class RedefFoo {
+    static int foo0() {
+        return 10;
+    }
+    static int foo1(Runnable r) {
+        return RedefBar.bar0(r);
+    }
+}
+
+class RedefBar {
+    static int bar0(Runnable r) {
+        r.run();
+        return bar1();
+    }
+    static int bar1() {
+        return 1;
+    }
+}
+
+// The following classes will be redefined
+class RedefTaz0 { static int x1, x2, x3, x4, x5; int a; Runnable x() { return () -> {a += 1;}; } }
+class RedefTaz1 { static int x1, x2, x3, x4, x5; int a; Runnable x() { return () -> {a += 1;}; } }
+class RedefTaz2 { static int x1, x2, x3, x4, x5; int a; Runnable x() { return () -> {a += 1;}; } }
+class RedefTaz3 { static int x1, x2, x3, x4, x5; int a; Runnable x() { return () -> {a += 1;}; } }
+class RedefTaz4 { static int x1, x2, x3, x4, x5; int a; Runnable x() { return () -> {a += 1;}; } }
+
+// The following classes will be loaded after the RedefTaz* classes are redefined.
+// They may reuse the constant pools that were freed during the redefinitions of RedefTaz*.
+//
+// These classes are NOT redefined in the training run, so they should be stored into AOT
+// configuration and AOT cache.
+//
+// The Qux classes have a smaller constant pool size (as defined in the classfile) than the
+// Taz classes, so they are likely to reuse the space of the constant pools freed from Taz.
+// However, Qux uses a larger ConstantPool::resolved_reference(), as it has one extra
+// String. Without the JDK-8381117 fix, the JVM would crash during the training run inside
+// ConstantPool::prepare_resolved_references_for_archiving().
+class Qux0 { static final String s = "x"; int a; Runnable x() { return () -> {a += 1;}; } }
+class Qux1 { static final String s = "x"; int a; Runnable x() { return () -> {a += 1;}; } }
+class Qux2 { static final String s = "x"; int a; Runnable x() { return () -> {a += 1;}; } }
+class Qux3 { static final String s = "x"; int a; Runnable x() { return () -> {a += 1;}; } }
+class Qux4 { static final String s = "x"; int a; Runnable x() { return () -> {a += 1;}; } }
+class Qux5 { static final String s = "x"; int a; Runnable x() { return () -> {a += 1;}; } }
+class Qux6 { static final String s = "x"; int a; Runnable x() { return () -> {a += 1;}; } }
+class Qux7 { static final String s = "x"; int a; Runnable x() { return () -> {a += 1;}; } }
+class Qux8 { static final String s = "x"; int a; Runnable x() { return () -> {a += 1;}; } }
+class Qux9 { static final String s = "x"; int a; Runnable x() { return () -> {a += 1;}; } }
diff --git a/test/hotspot/jtreg/runtime/cds/appcds/aotCache/test-classes/RedefGeneration1.java b/test/hotspot/jtreg/runtime/cds/appcds/aotCache/test-classes/RedefGeneration1.java
new file mode 100644
index 00000000000..56261aefe16
--- /dev/null
+++ b/test/hotspot/jtreg/runtime/cds/appcds/aotCache/test-classes/RedefGeneration1.java
@@ -0,0 +1,54 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ *
+ */
+
+// These are "generation 1" test classes used in redefinition tests.
+// They are used to redefine the classes that were compiled from RedefGeneration0.java.
+
+class RedefFoo {
+    static int foo0() {
+        // WAS: return 10
+        return 20;
+    }
+    static int foo1(Runnable r) {
+        return RedefBar.bar0(r);
+    }
+}
+
+class RedefBar {
+    static int bar0(Runnable r) {
+        r.run();
+        return bar1();
+    }
+
+    static int bar1() {
+        // WAS: return 1;
+        return 2 + RedefFoo.foo0();
+    }
+}
+
+class RedefTaz0 { static int x1, x2, x3, x4, x5; int a; Runnable x() { return () -> {a += 2;}; } }
+class RedefTaz1 { static int x1, x2, x3, x4, x5; int a; Runnable x() { return () -> {a += 2;}; } }
+class RedefTaz2 { static int x1, x2, x3, x4, x5; int a; Runnable x() { return () -> {a += 2;}; } }
+class RedefTaz3 { static int x1, x2, x3, x4, x5; int a; Runnable x() { return () -> {a += 2;}; } }
+class RedefTaz4 { static int x1, x2, x3, x4, x5; int a; Runnable x() { return () -> {a += 2;}; } }
diff --git a/test/hotspot/jtreg/runtime/cds/appcds/test-classes/Util.java b/test/hotspot/jtreg/runtime/cds/appcds/test-classes/Util.java
index 295505003a8..e83865d5f03 100644
--- a/test/hotspot/jtreg/runtime/cds/appcds/test-classes/Util.java
+++ b/test/hotspot/jtreg/runtime/cds/appcds/test-classes/Util.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2015, 2019, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2015, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -104,6 +104,9 @@ public class Util {
         return b;
     }
 
+    public static byte[] getClassFileFromJar(String jarFile, String className) throws FileNotFoundException, IOException {
+        return getClassFileFromJar(new File(jarFile), className);
+    }
     public static byte[] getClassFileFromJar(File jarFile, String className) throws FileNotFoundException, IOException {
         JarFile jf = new JarFile(jarFile);
         JarEntry ent = jf.getJarEntry(className.replace('.', '/') + ".class");

From 9131c72d63cac7d2a0e845952cee0e3c7edbfc93 Mon Sep 17 00:00:00 2001
From: Weijun Wang <weijun@openjdk.org>
Date: Wed, 1 Apr 2026 17:49:31 +0000
Subject: [PATCH 464/655] 8368692: Restrict Password::readPassword from reading
 from System.in

Reviewed-by: mullan
---
 .../classes/sun/security/util/Password.java   | 47 +++++++++----
 .../share/conf/security/java.security         | 29 ++++++++
 .../security/tools/keytool/AllowSystemIn.java | 70 +++++++++++++++++++
 3 files changed, 133 insertions(+), 13 deletions(-)
 create mode 100644 test/jdk/sun/security/tools/keytool/AllowSystemIn.java

diff --git a/src/java.base/share/classes/sun/security/util/Password.java b/src/java.base/share/classes/sun/security/util/Password.java
index 02cdcaf53fd..c1b44856c8b 100644
--- a/src/java.base/share/classes/sun/security/util/Password.java
+++ b/src/java.base/share/classes/sun/security/util/Password.java
@@ -29,6 +29,7 @@ import java.io.*;
 import java.nio.*;
 import java.nio.charset.*;
 import java.util.Arrays;
+import java.util.Locale;
 
 import jdk.internal.access.SharedSecrets;
 import jdk.internal.io.JdkConsoleImpl;
@@ -43,6 +44,22 @@ public class Password {
         return readPassword(in, false);
     }
 
+    private static final boolean ALLOW_STDIN;
+    static {
+        var value = SecurityProperties.getOverridableProperty(
+                "jdk.security.password.allowSystemIn");
+        if (value != null) {
+            value = value.toLowerCase(Locale.ROOT);
+        }
+        ALLOW_STDIN = switch (value) {
+            case null -> true; // Default true now
+            case "true" -> true;
+            case "false" -> false;
+            default -> throw new IllegalArgumentException(
+                    "Invalid jdk.security.password.allowSystemIn value: " + value);
+        };
+    }
+
     /** Reads user password from given input stream.
      * @param isEchoOn true if the password should be echoed on the screen
      */
@@ -66,19 +83,23 @@ public class Password {
                     }
                     consoleBytes = ConsoleHolder.convertToBytes(consoleEntered);
                     in = new ByteArrayInputStream(consoleBytes);
-                } else if (in == System.in && VM.isBooted()
-                            && System.in.available() == 0) {
-                    // Warn if reading password from System.in but it's empty.
-                    // This may be running in an IDE Run Window or in JShell,
-                    // which acts like an interactive console and echoes the
-                    // entered password. In this case, print a warning that
-                    // the password might be echoed. If available() is not zero,
-                    // it's more likely the input comes from a pipe, such as
-                    // "echo password |" or "cat password_file |" where input
-                    // will be silently consumed without echoing to the screen.
-                    // Warn only if VM is booted and ResourcesMgr is available.
-                    System.err.print(ResourcesMgr.getString
-                            ("warning.input.may.be.visible.on.screen"));
+                } else if (in == System.in) {
+                    if (!ALLOW_STDIN) {
+                        throw new UnsupportedOperationException("Console not available." +
+                                " Reading passwords from standard input is disallowed.");
+                    } else if (VM.isBooted() && in.available() == 0) {
+                        // Warn if reading password from System.in but it's empty.
+                        // This may be running in an IDE Run Window or in JShell,
+                        // which acts like an interactive console and echoes the
+                        // entered password. In this case, print a warning that
+                        // the password might be echoed. If available() is not zero,
+                        // it's more likely the input comes from a pipe, such as
+                        // "echo password |" or "cat password_file |" where input
+                        // will be silently consumed without echoing to the screen.
+                        // Warn only if VM is booted and ResourcesMgr is available.
+                        System.err.print(ResourcesMgr.getString
+                                ("warning.input.may.be.visible.on.screen"));
+                    }
                 }
             }
 
diff --git a/src/java.base/share/conf/security/java.security b/src/java.base/share/conf/security/java.security
index d5d0488a004..976604b5cbc 100644
--- a/src/java.base/share/conf/security/java.security
+++ b/src/java.base/share/conf/security/java.security
@@ -1725,3 +1725,32 @@ com.sun.security.allowedAIALocations=
 #
 #jdk.mlkem.pkcs8.encoding = seed
 #jdk.mldsa.pkcs8.encoding = seed
+
+#
+# Policy for reading passwords from System.in
+#
+# When Java needs to read a password, whether it's via a tool such as keytool or
+# kinit, or by an API such as PasswordCallback with echo off, it normally reads
+# directly from the console. If the console is not available, Java falls back
+# to reading from the standard input stream ("System.in"), which typically
+# represents a redirected file or an inter-process pipe. This fallback is not
+# formally specified, and is not widely adopted by tools from other vendors.
+#
+# This security property determines whether passwords can be read from the
+# standard input stream when a console is not available. The value can be set
+# to either "true" or "false". If the value is set to "false", attempting
+# to read passwords from the standard input stream without a console will
+# throw an exception. The default value is "true". This default may change
+# in a future release.
+#
+# If a system property of the same name is also specified, it supersedes the
+# security property value defined here.
+#
+# Note: This property applies only to password reading from the standard input
+# stream. It does not affect other supported password sources. For example, the
+# JAAS KeyStoreLoginModule allows a password to be read from the user-specified
+# "keyStorePasswordURL" option. The keytool and jarsigner commands also support
+# options such as "-storepass:env" and "-storepass:file" that read passwords
+# from an environment variable or a file.
+#
+#jdk.security.password.allowSystemIn = true
diff --git a/test/jdk/sun/security/tools/keytool/AllowSystemIn.java b/test/jdk/sun/security/tools/keytool/AllowSystemIn.java
new file mode 100644
index 00000000000..04373f8ba26
--- /dev/null
+++ b/test/jdk/sun/security/tools/keytool/AllowSystemIn.java
@@ -0,0 +1,70 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+/*
+ * @test
+ * @bug 8368692
+ * @summary Restrict Password::readPassword from reading from System.in
+ * @library /test/lib
+ * @run main AllowSystemIn succeed
+ * @run main/othervm -Djdk.security.password.allowSystemIn=true AllowSystemIn succeed
+ * @run main/othervm -Djdk.security.password.allowSystemIn=false AllowSystemIn fail
+ * @run main/othervm -Djdk.security.password.allowSystemIn=bogus AllowSystemIn invalid
+ */
+
+import com.sun.security.auth.callback.TextCallbackHandler;
+import jdk.test.lib.Asserts;
+
+import javax.security.auth.callback.Callback;
+import javax.security.auth.callback.PasswordCallback;
+import java.io.ByteArrayInputStream;
+import java.nio.charset.StandardCharsets;
+
+public class AllowSystemIn{
+
+    public static void main(String[] args) throws Exception {
+        switch (args[0]) {
+            case "succeed" -> Asserts.assertEQ("password", getPassword());
+            case "fail" -> Asserts.assertThrows(
+                    UnsupportedOperationException.class,
+                    AllowSystemIn::getPassword);
+            case "invalid" -> Asserts.assertThrows(
+                    ExceptionInInitializerError.class, // implementation detail
+                    AllowSystemIn::getPassword);
+        }
+    }
+
+    static String getPassword() throws Exception {
+        var in = System.in;
+        try {
+            var bin = new ByteArrayInputStream(
+                    "password".getBytes(StandardCharsets.UTF_8));
+            System.setIn(bin);
+            var pb = new PasswordCallback("> ", false);
+            new TextCallbackHandler().handle(new Callback[]{pb});
+            return new String(pb.getPassword());
+        } finally {
+            System.setIn(in);
+        }
+    }
+}

From 3cb4d7db19bb7b3daf5921dd5d98e3cbc6608051 Mon Sep 17 00:00:00 2001
From: Phil Race <prr@openjdk.org>
Date: Wed, 1 Apr 2026 18:36:47 +0000
Subject: [PATCH 465/655] 8381037: Remove AppContext from miscellaneous awt
 shared classes

Reviewed-by: azvegint, dnguyen
---
 .../classes/java/awt/EventDispatchThread.java |   6 +-
 .../java/awt/KeyboardFocusManager.java        |   5 +-
 .../share/classes/java/awt/SentEvent.java     |  15 +-
 .../classes/java/awt/WaitDispatchSupport.java |   4 +-
 .../share/classes/sun/awt/EmbeddedFrame.java  |   9 +-
 .../classes/sun/awt/GlobalCursorManager.java  |   4 +-
 .../sun/awt/KeyboardFocusManagerPeerImpl.java |   6 +-
 .../classes/sun/awt/PaintEventDispatcher.java |   4 +-
 .../classes/sun/font/SunFontManager.java      |  24 +-
 .../swing/system/6799345/TestShutdown.java    | 205 ------------------
 .../awt/AppContext/8012933/Test8012933.java   |  93 --------
 11 files changed, 20 insertions(+), 355 deletions(-)
 delete mode 100644 test/jdk/javax/swing/system/6799345/TestShutdown.java
 delete mode 100644 test/jdk/sun/awt/AppContext/8012933/Test8012933.java

diff --git a/src/java.desktop/share/classes/java/awt/EventDispatchThread.java b/src/java.desktop/share/classes/java/awt/EventDispatchThread.java
index b817ca12ece..1a991741fab 100644
--- a/src/java.desktop/share/classes/java/awt/EventDispatchThread.java
+++ b/src/java.desktop/share/classes/java/awt/EventDispatchThread.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1996, 2022, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1996, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -203,8 +203,8 @@ class EventDispatchThread extends Thread {
             eq.dispatchEvent(event);
         }
         catch (InterruptedException interruptedException) {
-            doDispatch = false; // AppContext.dispose() interrupts all
-                                // Threads in the AppContext
+            // keep this catch case for compatibility
+            doDispatch = false;
         }
         catch (Throwable e) {
             processException(e);
diff --git a/src/java.desktop/share/classes/java/awt/KeyboardFocusManager.java b/src/java.desktop/share/classes/java/awt/KeyboardFocusManager.java
index 06932d33f8a..9b55e754a64 100644
--- a/src/java.desktop/share/classes/java/awt/KeyboardFocusManager.java
+++ b/src/java.desktop/share/classes/java/awt/KeyboardFocusManager.java
@@ -2264,15 +2264,14 @@ public abstract class KeyboardFocusManager
                                        temporary, descendant, cause);
                     // Fix 5028014. Rolled out.
                     // SunToolkit.postPriorityEvent(currentFocusOwnerEvent);
-                    SunToolkit.postEvent(currentFocusOwner.appContext,
-                                         currentFocusOwnerEvent);
+                    SunToolkit.postEvent(currentFocusOwnerEvent);
                 }
                 FocusEvent newFocusOwnerEvent =
                     new FocusEvent(descendant, FocusEvent.FOCUS_GAINED,
                                    temporary, currentFocusOwner, cause);
                 // Fix 5028014. Rolled out.
                 // SunToolkit.postPriorityEvent(newFocusOwnerEvent);
-                SunToolkit.postEvent(descendant.appContext, newFocusOwnerEvent);
+                SunToolkit.postEvent(newFocusOwnerEvent);
 
                 if (focusLog.isLoggable(PlatformLogger.Level.FINEST))
                     focusLog.finest("2. SNFH_HANDLED for {0}", String.valueOf(descendant));
diff --git a/src/java.desktop/share/classes/java/awt/SentEvent.java b/src/java.desktop/share/classes/java/awt/SentEvent.java
index 632b4ee85a8..eb85fa1453d 100644
--- a/src/java.desktop/share/classes/java/awt/SentEvent.java
+++ b/src/java.desktop/share/classes/java/awt/SentEvent.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2000, 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2000, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -27,7 +27,6 @@ package java.awt;
 
 import java.io.Serial;
 
-import sun.awt.AppContext;
 import sun.awt.SunToolkit;
 
 /**
@@ -51,22 +50,16 @@ class SentEvent extends AWTEvent implements ActiveEvent {
 
     boolean dispatched;
     private AWTEvent nested;
-    @SuppressWarnings("serial") // Not statically typed as Serializable
-    private AppContext toNotify;
 
     SentEvent() {
         this(null);
     }
     SentEvent(AWTEvent nested) {
-        this(nested, null);
-    }
-    SentEvent(AWTEvent nested, AppContext toNotify) {
         super((nested != null)
                   ? nested.getSource()
                   : Toolkit.getDefaultToolkit(),
               ID);
         this.nested = nested;
-        this.toNotify = toNotify;
     }
 
     public void dispatch() {
@@ -76,9 +69,6 @@ class SentEvent extends AWTEvent implements ActiveEvent {
             }
         } finally {
             dispatched = true;
-            if (toNotify != null) {
-                SunToolkit.postEvent(toNotify, new SentEvent());
-            }
             synchronized (this) {
                 notifyAll();
             }
@@ -86,9 +76,6 @@ class SentEvent extends AWTEvent implements ActiveEvent {
     }
     final void dispose() {
         dispatched = true;
-        if (toNotify != null) {
-            SunToolkit.postEvent(toNotify, new SentEvent());
-        }
         synchronized (this) {
             notifyAll();
         }
diff --git a/src/java.desktop/share/classes/java/awt/WaitDispatchSupport.java b/src/java.desktop/share/classes/java/awt/WaitDispatchSupport.java
index 71e8b3086a1..3e567f538b1 100644
--- a/src/java.desktop/share/classes/java/awt/WaitDispatchSupport.java
+++ b/src/java.desktop/share/classes/java/awt/WaitDispatchSupport.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2010, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2010, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -211,8 +211,6 @@ class WaitDispatchSupport implements SecondaryLoop {
                         }
                     }, interval);
                 }
-                // Dispose SequencedEvent we are dispatching on the current
-                // AppContext, to prevent us from hang - see 4531693 for details
                 SequencedEvent currentSE = KeyboardFocusManager.
                         getCurrentKeyboardFocusManager().getCurrentSequencedEvent();
                 if (currentSE != null) {
diff --git a/src/java.desktop/share/classes/sun/awt/EmbeddedFrame.java b/src/java.desktop/share/classes/sun/awt/EmbeddedFrame.java
index ab2ad5dfbf0..fa8ed1e707c 100644
--- a/src/java.desktop/share/classes/sun/awt/EmbeddedFrame.java
+++ b/src/java.desktop/share/classes/sun/awt/EmbeddedFrame.java
@@ -164,11 +164,8 @@ public abstract class EmbeddedFrame extends Frame
     }
 
     /**
-     * Because there may be many AppContexts, and we can't be sure where this
-     * EmbeddedFrame is first created or shown, we can't automatically determine
-     * the correct KeyboardFocusManager to attach to as KeyEventDispatcher.
      * Those who want to use the functionality of traversing out of the EmbeddedFrame
-     * must call this method on the AppContext. After that, all the changes
+     * must call this method. After that, all the changes
      * can be handled automatically, including possible replacement of
      * KeyboardFocusManager.
      */
@@ -184,7 +181,7 @@ public abstract class EmbeddedFrame extends Frame
 
     /**
      * Needed to avoid memory leak: we register this EmbeddedFrame as a listener with
-     * KeyboardFocusManager of an AppContext. We don't want the KFM to keep
+     * the KeyboardFocusManager. We don't want the KFM to keep
      * reference to our EmbeddedFrame forever if the Frame is no longer in use, so we
      * add listeners in show() and remove them in hide().
      */
@@ -198,7 +195,7 @@ public abstract class EmbeddedFrame extends Frame
 
     /**
      * Needed to avoid memory leak: we register this EmbeddedFrame as a listener with
-     * KeyboardFocusManager of an AppContext. We don't want the KFM to keep
+     * the KeyboardFocusManager. We don't want the KFM to keep
      * reference to our EmbeddedFrame forever if the Frame is no longer in use, so we
      * add listeners in show() and remove them in hide().
      */
diff --git a/src/java.desktop/share/classes/sun/awt/GlobalCursorManager.java b/src/java.desktop/share/classes/sun/awt/GlobalCursorManager.java
index 27893d0ce87..8638bf81921 100644
--- a/src/java.desktop/share/classes/sun/awt/GlobalCursorManager.java
+++ b/src/java.desktop/share/classes/sun/awt/GlobalCursorManager.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1999, 2013, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1999, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -61,7 +61,7 @@ public abstract class GlobalCursorManager {
                 }
             }
             if (shouldPost) {
-                SunToolkit.postEvent(SunToolkit.targetToAppContext(heavy), in);
+                SunToolkit.postEvent(in);
             }
         }
     }
diff --git a/src/java.desktop/share/classes/sun/awt/KeyboardFocusManagerPeerImpl.java b/src/java.desktop/share/classes/sun/awt/KeyboardFocusManagerPeerImpl.java
index ef50d883ee5..909c0b58136 100644
--- a/src/java.desktop/share/classes/sun/awt/KeyboardFocusManagerPeerImpl.java
+++ b/src/java.desktop/share/classes/sun/awt/KeyboardFocusManagerPeerImpl.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -127,7 +127,7 @@ public abstract class KeyboardFocusManagerPeerImpl implements KeyboardFocusManag
             if (focusLog.isLoggable(PlatformLogger.Level.FINER)) {
                 focusLog.finer("Posting focus event: " + fl);
             }
-            SunToolkit.postEvent(SunToolkit.targetToAppContext(currentOwner), fl);
+            SunToolkit.postEvent(fl);
         }
 
         FocusEvent fg = new FocusEvent(lightweightChild, FocusEvent.FOCUS_GAINED,
@@ -136,7 +136,7 @@ public abstract class KeyboardFocusManagerPeerImpl implements KeyboardFocusManag
         if (focusLog.isLoggable(PlatformLogger.Level.FINER)) {
             focusLog.finer("Posting focus event: " + fg);
         }
-        SunToolkit.postEvent(SunToolkit.targetToAppContext(lightweightChild), fg);
+        SunToolkit.postEvent(fg);
         return true;
     }
 
diff --git a/src/java.desktop/share/classes/sun/awt/PaintEventDispatcher.java b/src/java.desktop/share/classes/sun/awt/PaintEventDispatcher.java
index eec1fc93c66..831c67e1e4f 100644
--- a/src/java.desktop/share/classes/sun/awt/PaintEventDispatcher.java
+++ b/src/java.desktop/share/classes/sun/awt/PaintEventDispatcher.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2005, 2011, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2005, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -93,7 +93,7 @@ public class PaintEventDispatcher {
      * This method is invoked from the toolkit thread when the surface
      * data of the component needs to be replaced. The method run() of
      * the Runnable argument performs surface data replacing, run()
-     * should be invoked on the EDT of this component's AppContext.
+     * should be invoked on the EDT.
      * Returns true if the Runnable has been enqueued to be invoked
      * on the EDT.
      * (Fix 6255371.)
diff --git a/src/java.desktop/share/classes/sun/font/SunFontManager.java b/src/java.desktop/share/classes/sun/font/SunFontManager.java
index 85a948ef594..323f0d056e1 100644
--- a/src/java.desktop/share/classes/sun/font/SunFontManager.java
+++ b/src/java.desktop/share/classes/sun/font/SunFontManager.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2008, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2008, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -2480,30 +2480,12 @@ public abstract class SunFontManager implements FontSupport, FontManagerForSGE {
      * SunGraphicsEnvironment it performs the same initialization as is
      * performed normally. There may be some duplication of effort, but
      * that code is already written to be able to perform properly if called
-     * to duplicate work. The main difference is that if we detect we are
-     * in an AppContext environment these new fonts
-     * are not placed in the "default" maps but into an AppContext instance.
-     * The font lookup mechanism in java.awt.Font.getFont2D() is also updated
-     * so that look-up for composite fonts will in that case always
-     * do a lookup rather than returning a cached result.
-     * This is inefficient but necessary else singleton java.awt.Font
-     * instances would not retrieve the correct Font2D for the appcontext.
-     * sun.font.FontManager.findFont2D is also updated to that it uses
-     * a name map cache specific to that appcontext.
-     *
-     * Getting an AppContext is expensive, so there is a global variable
-     * that records whether these methods have ever been called and can
-     * avoid the expense for almost all applications. Once the correct
-     * CompositeFont is associated with the Font, everything should work
-     * through existing mechanisms.
-     * A special case is that GraphicsEnvironment.getAllFonts() must
-     * return an AppContext specific list.
+     * to duplicate work.
      *
      * Calling the methods below is "heavyweight" but it is expected that
      * these methods will be called very rarely.
      *
-     * If _usingAlternateComposites is true, we are not in an "AppContext"
-     * environment and the (single) application has selected
+     * If _usingAlternateComposites is true, the application has selected
      * an alternate composite font behaviour.
      *
      * - Printing: The implementation delegates logical fonts to an AWT
diff --git a/test/jdk/javax/swing/system/6799345/TestShutdown.java b/test/jdk/javax/swing/system/6799345/TestShutdown.java
deleted file mode 100644
index 54ae1e227df..00000000000
--- a/test/jdk/javax/swing/system/6799345/TestShutdown.java
+++ /dev/null
@@ -1,205 +0,0 @@
-/*
- * Copyright (c) 2009, 2017, Oracle and/or its affiliates. All rights reserved.
- * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
- *
- * This code is free software; you can redistribute it and/or modify it
- * under the terms of the GNU General Public License version 2 only, as
- * published by the Free Software Foundation.
- *
- * This code is distributed in the hope that it will be useful, but WITHOUT
- * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
- * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
- * version 2 for more details (a copy is included in the LICENSE file that
- * accompanied this code).
- *
- * You should have received a copy of the GNU General Public License version
- * 2 along with this work; if not, write to the Free Software Foundation,
- * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
- *
- * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
- * or visit www.oracle.com if you need additional information or have any
- * questions.
- */
-
-/**
- * @test
- * @bug 6799345
- * @key headful
- * @summary Tests that no exceptions are thrown from TimerQueue and
- * SwingWorker on AppContext shutdown
- * @author art
- * @modules java.desktop/sun.awt
- * @run main TestShutdown
- */
-
-import java.awt.*;
-import java.awt.event.*;
-
-import java.util.*;
-
-import javax.swing.*;
-
-import sun.awt.*;
-
-public class TestShutdown
-{
-    private static AppContext targetAppContext;
-
-    private static JFrame f;
-    private static JTextField tf;
-
-    private static volatile boolean exceptionsOccurred = false;
-    private static volatile boolean appcontextInitDone = false;
-
-    private static int timerValue = 0;
-
-    public static void main(String[] args)
-        throws Exception
-    {
-        ThreadGroup tg = new TestThreadGroup("TTG");
-        Thread t = new Thread(tg, new TestRunnable(), "InitThread");
-        t.start();
-
-        while (!appcontextInitDone)
-        {
-            Thread.sleep(1000);
-        }
-
-        targetAppContext.dispose();
-
-        if (exceptionsOccurred)
-        {
-            throw new RuntimeException("Test FAILED: some exceptions occurred");
-        }
-    }
-
-    static void initGUI()
-    {
-        f = new JFrame("F");
-        f.setBounds(100, 100, 200, 100);
-        tf = new JTextField("Test");
-        f.add(tf);
-        f.setVisible(true);
-    }
-
-    static void startGUI()
-    {
-        // caret blink Timer
-        tf.requestFocusInWindow();
-
-        // misc Timer
-        ActionListener al = new ActionListener()
-        {
-            @Override
-            public void actionPerformed(ActionEvent ae)
-            {
-                System.out.println("Timer tick: " + timerValue++);
-            }
-        };
-        new javax.swing.Timer(30, al).start();
-    }
-
-    static class TestThreadGroup extends ThreadGroup
-    {
-        public TestThreadGroup(String name)
-        {
-            super(name);
-        }
-
-        @Override
-        public synchronized void uncaughtException(Thread thread, Throwable t)
-        {
-            if (t instanceof ThreadDeath)
-            {
-                // this one is expected, rethrow
-                throw (ThreadDeath)t;
-            }
-            System.err.println("Test FAILED: an exception is caught in the " +
-                               "target thread group on thread " + thread.getName());
-            t.printStackTrace(System.err);
-            exceptionsOccurred = true;
-        }
-    }
-
-    static class TestRunnable implements Runnable
-    {
-        @Override
-        public void run()
-        {
-            SunToolkit stk = (SunToolkit)Toolkit.getDefaultToolkit();
-            targetAppContext = stk.createNewAppContext();
-
-            // create and show frame and text field
-            SwingUtilities.invokeLater(new Runnable()
-            {
-                @Override
-                public void run()
-                {
-                    initGUI();
-                }
-            });
-            stk.realSync();
-
-            // start some Timers
-            SwingUtilities.invokeLater(new Runnable()
-            {
-                @Override
-                public void run()
-                {
-                    startGUI();
-                }
-            });
-
-            // start multiple SwingWorkers
-            while (!Thread.interrupted())
-            {
-                try
-                {
-                    new TestSwingWorker().execute();
-                    Thread.sleep(40);
-                }
-                catch (Exception e)
-                {
-                    // exception here is expected, skip
-                    break;
-                }
-            }
-        }
-    }
-
-    static class TestSwingWorker extends SwingWorker<String, Integer>
-    {
-        @Override
-        public String doInBackground()
-        {
-            Random r = new Random();
-            for (int i = 0; i < 10; i++)
-            {
-                try
-                {
-                    int delay = r.nextInt() % 50;
-                    Thread.sleep(delay);
-                    publish(delay);
-                }
-                catch (Exception z)
-                {
-                    break;
-                }
-            }
-            if (!appcontextInitDone)
-            {
-                appcontextInitDone = true;
-            }
-            return "Done";
-        }
-
-        @Override
-        public void process(java.util.List<Integer> chunks)
-        {
-            for (Integer i : chunks)
-            {
-                System.err.println("Processed: " + i);
-            }
-        }
-    }
-}
diff --git a/test/jdk/sun/awt/AppContext/8012933/Test8012933.java b/test/jdk/sun/awt/AppContext/8012933/Test8012933.java
deleted file mode 100644
index 51c5250f3ac..00000000000
--- a/test/jdk/sun/awt/AppContext/8012933/Test8012933.java
+++ /dev/null
@@ -1,93 +0,0 @@
-/*
- * Copyright (c) 2013, 2015, Oracle and/or its affiliates. All rights reserved.
- * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
- *
- * This code is free software; you can redistribute it and/or modify it
- * under the terms of the GNU General Public License version 2 only, as
- * published by the Free Software Foundation.
- *
- * This code is distributed in the hope that it will be useful, but WITHOUT
- * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
- * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
- * version 2 for more details (a copy is included in the LICENSE file that
- * accompanied this code).
- *
- * You should have received a copy of the GNU General Public License version
- * 2 along with this work; if not, write to the Free Software Foundation,
- * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
- *
- * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
- * or visit www.oracle.com if you need additional information or have any
- * questions.
- */
-
-/*
- * @test
- * @bug 8012933
- * @summary Tests (although somewhat indirectly) that createNewAppContext()
- * immediately followed by dispose() works correctly
- * @author Leonid Romanov
- * @modules java.desktop/sun.awt
- */
-
-import sun.awt.SunToolkit;
-import sun.awt.AppContext;
-
-public class Test8012933 {
-    private AppContext appContext = null;
-    final ThreadGroup threadGroup = new ThreadGroup("test thread group");
-    final Object lock = new Object();
-    boolean isCreated = false;
-
-    public static void main(String[] args) throws Exception {
-        SunToolkit.createNewAppContext();
-        new Test8012933().test();
-    }
-
-    private void test() throws Exception {
-        createAppContext();
-        long startTime = System.currentTimeMillis();
-        appContext.dispose();
-        long endTime = System.currentTimeMillis();
-
-        // In case of the bug, calling dispose() when there is no EQ
-        // dispatch thread running fails to create it, so it takes
-        // almost 10 sec to return from dispose(), which is spent
-        // waiting on the notificationLock.
-        if ((endTime - startTime) > 9000) {
-            throw new RuntimeException("Returning from dispose() took too much time, probably a bug");
-        }
-    }
-
-    private void createAppContext() {
-        isCreated = false;
-        final Runnable runnable = new Runnable() {
-                public void run() {
-                    appContext = SunToolkit.createNewAppContext();
-                    synchronized (lock) {
-                        isCreated = true;
-                        lock.notifyAll();
-                    }
-                }
-            };
-
-        final Thread thread = new Thread(threadGroup, runnable, "creates app context");
-        synchronized (lock) {
-            thread.start();
-            while (!isCreated) {
-                try {
-                    lock.wait();
-                } catch (InterruptedException ie) {
-                    ie.printStackTrace();
-                }
-            }
-        }
-
-        if (appContext == null) {
-            throw new RuntimeException("failed to create app context.");
-        } else {
-            System.out.println("app context was created.");
-        }
-    }
-
-}

From 40e5745dea472621651fe495d27eef3563714157 Mon Sep 17 00:00:00 2001
From: Phil Race <prr@openjdk.org>
Date: Wed, 1 Apr 2026 19:10:39 +0000
Subject: [PATCH 466/655] 8380714: sun.font.HBShaper : use getUpcallStub to
 create all up call stubs

Reviewed-by: serb, psadhukhan
---
 .../share/classes/sun/font/HBShaper.java      | 55 +++++++------------
 1 file changed, 20 insertions(+), 35 deletions(-)

diff --git a/src/java.desktop/share/classes/sun/font/HBShaper.java b/src/java.desktop/share/classes/sun/font/HBShaper.java
index 3a532072004..dea8a9e22dd 100644
--- a/src/java.desktop/share/classes/sun/font/HBShaper.java
+++ b/src/java.desktop/share/classes/sun/font/HBShaper.java
@@ -216,45 +216,30 @@ public class HBShaper {
                 JAVA_INT,           // return type
                 JAVA_INT, ADDRESS); // arg types
 
-        FunctionDescriptor get_var_glyph_fd = getFunctionDescriptor(JAVA_INT,  // return type
-              ADDRESS, ADDRESS, JAVA_INT, JAVA_INT, ADDRESS, ADDRESS); // arg types
-        MethodHandle get_var_glyph_mh =
-            getMethodHandle("get_variation_glyph", get_var_glyph_fd);
-        @SuppressWarnings("restricted")
-        MemorySegment tmp5 = LINKER.upcallStub(get_var_glyph_mh, get_var_glyph_fd, garena);
-        get_var_glyph_stub = tmp5;
+        get_var_glyph_stub = getUpcallStub(garena,
+                "get_variation_glyph", // method name
+                JAVA_INT,              // return type
+                ADDRESS, ADDRESS, JAVA_INT, JAVA_INT, ADDRESS, ADDRESS); // arg types
 
-        FunctionDescriptor get_nominal_glyph_fd = getFunctionDescriptor(JAVA_INT, // return type
-                   ADDRESS, ADDRESS, JAVA_INT, ADDRESS, ADDRESS); // arg types
-        MethodHandle get_nominal_glyph_mh =
-            getMethodHandle("get_nominal_glyph", get_nominal_glyph_fd);
-        @SuppressWarnings("restricted")
-        MemorySegment tmp6 = LINKER.upcallStub(get_nominal_glyph_mh, get_nominal_glyph_fd, garena);
-        get_nominal_glyph_stub = tmp6;
+        get_nominal_glyph_stub = getUpcallStub(garena,
+                "get_nominal_glyph", // method name
+                JAVA_INT,            // return type
+                ADDRESS, ADDRESS, JAVA_INT, ADDRESS, ADDRESS); // arg types
 
-        FunctionDescriptor get_h_adv_fd = getFunctionDescriptor(JAVA_INT,  // return type
-                   ADDRESS, ADDRESS, JAVA_INT, ADDRESS); // arg types
-        MethodHandle get_h_adv_mh =
-            getMethodHandle("get_glyph_h_advance", get_h_adv_fd);
-        @SuppressWarnings("restricted")
-        MemorySegment tmp7 = LINKER.upcallStub(get_h_adv_mh, get_h_adv_fd, garena);
-        get_h_advance_stub = tmp7;
+        get_h_advance_stub = getUpcallStub(garena,
+                "get_glyph_h_advance", // method name
+                JAVA_INT,              // return type
+                ADDRESS, ADDRESS, JAVA_INT, ADDRESS); // arg types
 
-        FunctionDescriptor get_v_adv_fd = getFunctionDescriptor(JAVA_INT,  // return type
-                   ADDRESS, ADDRESS, JAVA_INT, ADDRESS); // arg types
-        MethodHandle get_v_adv_mh =
-            getMethodHandle("get_glyph_v_advance", get_v_adv_fd);
-        @SuppressWarnings("restricted")
-        MemorySegment tmp8 = LINKER.upcallStub(get_v_adv_mh, get_v_adv_fd, garena);
-        get_v_advance_stub = tmp8;
+        get_v_advance_stub = getUpcallStub(garena,
+                "get_glyph_v_advance", // method name
+                JAVA_INT,              // return type
+                ADDRESS, ADDRESS, JAVA_INT, ADDRESS); // arg types
 
-        FunctionDescriptor get_contour_pt_fd = getFunctionDescriptor(JAVA_INT,  // return type
-            ADDRESS, ADDRESS, JAVA_INT, JAVA_INT, ADDRESS, ADDRESS, ADDRESS); // arg types
-        MethodHandle get_contour_pt_mh =
-            getMethodHandle("get_glyph_contour_point", get_contour_pt_fd);
-        @SuppressWarnings("restricted")
-        MemorySegment tmp9 = LINKER.upcallStub(get_contour_pt_mh, get_contour_pt_fd, garena);
-        get_contour_pt_stub = tmp9;
+        get_contour_pt_stub = getUpcallStub(garena,
+                "get_glyph_contour_point", // method name
+                JAVA_INT,                  // return type
+                ADDRESS, ADDRESS, JAVA_INT, JAVA_INT, ADDRESS, ADDRESS, ADDRESS); // arg types
 
        /* Having now created the font upcall stubs, we can call down to create
         * the native harfbuzz object holding these.

From ce9b3b59aa7477cf399716022204c1d5e83676f4 Mon Sep 17 00:00:00 2001
From: Phil Race <prr@openjdk.org>
Date: Wed, 1 Apr 2026 19:10:55 +0000
Subject: [PATCH 467/655] 8380941: Remove AppContext from java.awt.Window
 implementation

Reviewed-by: azvegint, kizune
---
 .../share/classes/java/awt/Window.java        | 85 +++++++------------
 1 file changed, 30 insertions(+), 55 deletions(-)

diff --git a/src/java.desktop/share/classes/java/awt/Window.java b/src/java.desktop/share/classes/java/awt/Window.java
index b41409a138e..23aefd8860d 100644
--- a/src/java.desktop/share/classes/java/awt/Window.java
+++ b/src/java.desktop/share/classes/java/awt/Window.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1995, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1995, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -64,7 +64,6 @@ import javax.accessibility.AccessibleState;
 import javax.accessibility.AccessibleStateSet;
 
 import sun.awt.AWTAccessor;
-import sun.awt.AppContext;
 import sun.awt.DebugSettings;
 import sun.awt.SunToolkit;
 import sun.awt.util.IdentityArrayList;
@@ -259,7 +258,7 @@ public class Window extends Container implements Accessible {
     /**
      * Contains all the windows that have a peer object associated,
      * i. e. between addNotify() and removeNotify() calls. The list
-     * of all Window instances can be obtained from AppContext object.
+     * of all Window instances can be obtained from {@link #getWindows()}
      *
      * @since 1.6
      */
@@ -275,7 +274,7 @@ public class Window extends Container implements Accessible {
                                             new Vector<WeakReference<Window>>();
 
     /*
-     * We insert a weak reference into the Vector of all Windows in AppContext
+     * We insert a weak reference into the Vector of all Windows
      * instead of 'this' so that garbage collection can still take place
      * correctly.
      */
@@ -427,11 +426,9 @@ public class Window extends Container implements Accessible {
     static class WindowDisposerRecord implements sun.java2d.DisposerRecord {
         WeakReference<Window> owner;
         final WeakReference<Window> weakThis;
-        final WeakReference<AppContext> context;
 
-        WindowDisposerRecord(AppContext context, Window victim) {
+        WindowDisposerRecord(Window victim) {
             weakThis = victim.weakThis;
-            this.context = new WeakReference<AppContext>(context);
         }
 
         public void updateOwner() {
@@ -448,10 +445,7 @@ public class Window extends Container implements Accessible {
                     parent.removeOwnedWindow(weakThis);
                 }
             }
-            AppContext ac = context.get();
-            if (null != ac) {
-                Window.removeFromWindowList(ac, weakThis);
-            }
+            Window.removeFromWindowList(weakThis);
         }
     }
 
@@ -499,7 +493,7 @@ public class Window extends Container implements Accessible {
         }
 
         modalExclusionType = Dialog.ModalExclusionType.NO_EXCLUDE;
-        disposerRecord = new WindowDisposerRecord(appContext, this);
+        disposerRecord = new WindowDisposerRecord(this);
         sun.java2d.Disposer.addRecord(anchor, disposerRecord);
 
         SunToolkit.checkAndSetPolicy(this);
@@ -1489,34 +1483,6 @@ public class Window extends Container implements Accessible {
         }
     }
 
-    private static Window[] getWindows(AppContext appContext) {
-        synchronized (Window.class) {
-            Window[] realCopy;
-            @SuppressWarnings("unchecked")
-            Vector<WeakReference<Window>> windowList =
-                (Vector<WeakReference<Window>>)appContext.get(Window.class);
-            if (windowList != null) {
-                int fullSize = windowList.size();
-                int realSize = 0;
-                Window[] fullCopy = new Window[fullSize];
-                for (int i = 0; i < fullSize; i++) {
-                    Window w = windowList.get(i).get();
-                    if (w != null) {
-                        fullCopy[realSize++] = w;
-                    }
-                }
-                if (fullSize != realSize) {
-                    realCopy = Arrays.copyOf(fullCopy, realSize);
-                } else {
-                    realCopy = fullCopy;
-                }
-            } else {
-                realCopy = new Window[0];
-            }
-            return realCopy;
-        }
-    }
-
     /**
      * Returns an array of all {@code Window}s, both owned and ownerless,
      * created by this application.
@@ -1534,7 +1500,24 @@ public class Window extends Container implements Accessible {
      * @since 1.6
      */
     public static Window[] getWindows() {
-        return getWindows(AppContext.getAppContext());
+        synchronized (Window.class) {
+            Window[] realCopy;
+            int fullSize = windowList.size();
+            int realSize = 0;
+            Window[] fullCopy = new Window[fullSize];
+            for (int i = 0; i < fullSize; i++) {
+                Window w = windowList.get(i).get();
+                if (w != null) {
+                    fullCopy[realSize++] = w;
+                }
+            }
+            if (fullSize != realSize) {
+                realCopy = Arrays.copyOf(fullCopy, realSize);
+            } else {
+                realCopy = fullCopy;
+            }
+            return realCopy;
+        }
     }
 
     /**
@@ -2746,30 +2729,22 @@ public class Window extends Container implements Accessible {
         child.disposerRecord.updateOwner();
     }
 
+    private static final Vector<WeakReference<Window>> windowList = new Vector<>();
+
     private void addToWindowList() {
         synchronized (Window.class) {
-            @SuppressWarnings("unchecked")
-            Vector<WeakReference<Window>> windowList = (Vector<WeakReference<Window>>)appContext.get(Window.class);
-            if (windowList == null) {
-                windowList = new Vector<WeakReference<Window>>();
-                appContext.put(Window.class, windowList);
-            }
             windowList.add(weakThis);
         }
     }
 
-    private static void removeFromWindowList(AppContext context, WeakReference<Window> weakThis) {
+    private static void removeFromWindowList(WeakReference<Window> weakThis) {
         synchronized (Window.class) {
-            @SuppressWarnings("unchecked")
-            Vector<WeakReference<Window>> windowList = (Vector<WeakReference<Window>>)context.get(Window.class);
-            if (windowList != null) {
-                windowList.remove(weakThis);
-            }
+            windowList.remove(weakThis);
         }
     }
 
     private void removeFromWindowList() {
-        removeFromWindowList(appContext, weakThis);
+        removeFromWindowList(weakThis);
     }
 
     /**
@@ -2909,7 +2884,7 @@ public class Window extends Container implements Accessible {
         weakThis = new WeakReference<>(this);
 
         anchor = new Object();
-        disposerRecord = new WindowDisposerRecord(appContext, this);
+        disposerRecord = new WindowDisposerRecord(this);
         sun.java2d.Disposer.addRecord(anchor, disposerRecord);
 
         addToWindowList();

From cddee6d6eb3e048635c380a32bd2f6ebfd2c18b5 Mon Sep 17 00:00:00 2001
From: Daniel Gredler <dgredler@openjdk.org>
Date: Wed, 1 Apr 2026 20:37:24 +0000
Subject: [PATCH 468/655] 8380028: Fix Page8 of manual test
 java/awt/print/PrinterJob/PrintTextTest.java on macOS

Reviewed-by: prr, psadhukhan
---
 .../classes/sun/lwawt/macosx/CTextPipe.java   | 33 +++++++++++++++----
 .../java/awt/geom/AffineTransform.java        |  4 +--
 .../classes/sun/java2d/SunGraphics2D.java     |  4 ++-
 .../awt/print/PrinterJob/PrintTextTest.java   |  4 +--
 4 files changed, 33 insertions(+), 12 deletions(-)

diff --git a/src/java.desktop/macosx/classes/sun/lwawt/macosx/CTextPipe.java b/src/java.desktop/macosx/classes/sun/lwawt/macosx/CTextPipe.java
index cf4a6e72136..ba5bb769ad5 100644
--- a/src/java.desktop/macosx/classes/sun/lwawt/macosx/CTextPipe.java
+++ b/src/java.desktop/macosx/classes/sun/lwawt/macosx/CTextPipe.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2011, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2011, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,7 +25,6 @@
 
 package sun.lwawt.macosx;
 
-
 import java.awt.*;
 import java.awt.font.*;
 
@@ -73,12 +72,17 @@ public class CTextPipe implements TextPipe {
 
     @Override
     public void drawString(final SunGraphics2D sg2d, final String s, final double x, final double y) {
+
+        FontInfo info = sg2d.getFontInfo();
+        double dx = x + info.originX;
+        double dy = y + info.originY;
+
         final long nativeStrikePtr = getNativeStrikePtr(sg2d);
         if (OSXSurfaceData.IsSimpleColor(sg2d.paint) && nativeStrikePtr != 0) {
             final OSXSurfaceData surfaceData = (OSXSurfaceData)sg2d.getSurfaceData();
-            surfaceData.drawString(this, sg2d, nativeStrikePtr, s, x, y);
+            surfaceData.drawString(this, sg2d, nativeStrikePtr, s, dx, dy);
         } else {
-            drawTextAsShape(sg2d, s, x, y);
+            drawTextAsShape(sg2d, s, dx, dy);
         }
     }
 
@@ -153,6 +157,15 @@ public class CTextPipe implements TextPipe {
         final Font prevFont = sg2d.getFont();
         sg2d.setFont(gV.getFont());
 
+        int flags = gV.getLayoutFlags();
+        boolean positionAdjustments = (flags & GlyphVector.FLAG_HAS_POSITION_ADJUSTMENTS) != 0;
+        if (positionAdjustments) {
+            // make sure GV positions are initialized, so they are available later in native code; this
+            // will already be the case if the user explicitly set the glyph positions, but not if the
+            // position adjustment flag was set because of a font translation transform or font tracking
+            gV.getGlyphPosition(0);
+        }
+
         if (hasSlotData(gV)) {
             final int length = gV.getNumGlyphs();
             float[] positions = gV.getGlyphPositions(0, length, null);
@@ -177,12 +190,17 @@ public class CTextPipe implements TextPipe {
 
     @Override
     public void drawChars(final SunGraphics2D sg2d, final char[] data, final int offset, final int length, final int x, final int y) {
+
+        FontInfo info = sg2d.getFontInfo();
+        double dx = x + info.originX;
+        double dy = y + info.originY;
+
         final long nativeStrikePtr = getNativeStrikePtr(sg2d);
         if (OSXSurfaceData.IsSimpleColor(sg2d.paint) && nativeStrikePtr != 0) {
             final OSXSurfaceData surfaceData = (OSXSurfaceData)sg2d.getSurfaceData();
-            surfaceData.drawUnicodes(this, sg2d, nativeStrikePtr, data, offset, length, x, y);
+            surfaceData.drawUnicodes(this, sg2d, nativeStrikePtr, data, offset, length, (float) dx, (float) dy);
         } else {
-            drawTextAsShape(sg2d, new String(data, offset, length), x, y);
+            drawTextAsShape(sg2d, new String(data, offset, length), dx, dy);
         }
     }
 
@@ -191,7 +209,8 @@ public class CTextPipe implements TextPipe {
     }
 
     public static final class Tracer extends CTextPipe {
-        void doDrawString(final SurfaceData sData, final long nativeStrikePtr, final String s, final float x, final float y) {
+        @Override
+        public void doDrawString(final SurfaceData sData, final long nativeStrikePtr, final String s, final double x, final double y) {
             GraphicsPrimitive.tracePrimitive("QuartzDrawString");
             super.doDrawString(sData, nativeStrikePtr, s, x, y);
         }
diff --git a/src/java.desktop/share/classes/java/awt/geom/AffineTransform.java b/src/java.desktop/share/classes/java/awt/geom/AffineTransform.java
index 9abc55d8e6f..a6869369714 100644
--- a/src/java.desktop/share/classes/java/awt/geom/AffineTransform.java
+++ b/src/java.desktop/share/classes/java/awt/geom/AffineTransform.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1996, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1996, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -1137,7 +1137,7 @@ public class AffineTransform implements Cloneable, java.io.Serializable {
      * The values are stored in the array as
      * {&nbsp;m00&nbsp;m10&nbsp;m01&nbsp;m11&nbsp;m02&nbsp;m12&nbsp;}.
      * An array of 4 doubles can also be specified, in which case only the
-     * first four elements representing the non-transform
+     * first four elements representing the non-translation
      * parts of the array are retrieved and the values are stored into
      * the array as {&nbsp;m00&nbsp;m10&nbsp;m01&nbsp;m11&nbsp;}
      * @param flatmatrix the double array used to store the returned
diff --git a/src/java.desktop/share/classes/sun/java2d/SunGraphics2D.java b/src/java.desktop/share/classes/sun/java2d/SunGraphics2D.java
index 891a15f24de..d66cd3fe3d5 100644
--- a/src/java.desktop/share/classes/sun/java2d/SunGraphics2D.java
+++ b/src/java.desktop/share/classes/sun/java2d/SunGraphics2D.java
@@ -596,7 +596,9 @@ public final class SunGraphics2D
             textAt.scale(ptSize, ptSize);
             info.originX = (float)textAt.getTranslateX();
             info.originY = (float)textAt.getTranslateY();
-            textAt.translate(-info.originX, -info.originY);
+            textAt.setTransform(textAt.getScaleX(), textAt.getShearY(),
+                                textAt.getShearX(), textAt.getScaleY(),
+                                0, 0);
             if (transformState >= TRANSFORM_TRANSLATESCALE) {
                 transform.getMatrix(info.devTx = new double[4]);
                 devAt = new AffineTransform(info.devTx);
diff --git a/test/jdk/java/awt/print/PrinterJob/PrintTextTest.java b/test/jdk/java/awt/print/PrinterJob/PrintTextTest.java
index defca807fc0..0b9663a9e99 100644
--- a/test/jdk/java/awt/print/PrinterJob/PrintTextTest.java
+++ b/test/jdk/java/awt/print/PrinterJob/PrintTextTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2007, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2007, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,7 +23,7 @@
 
 /*
  * @test
- * @bug 6425068 7156751 7157659 8029204 8132890 8148334 8344637 8368702
+ * @bug 6425068 7156751 7157659 8029204 8132890 8148334 8344637 8368702 8380028
  * @key printer
  * @summary Confirm that text prints where we expect to the length we expect.
  * @library /java/awt/regtesthelpers

From c18e3a3377e67f50ab065d1ac9365c7d43950fb6 Mon Sep 17 00:00:00 2001
From: Igor Veresov <iveresov@openjdk.org>
Date: Thu, 2 Apr 2026 00:18:11 +0000
Subject: [PATCH 469/655] 8379819: Creating AOT configuration crashes in
 MethodTrainingData::prepare

Reviewed-by: iklam, kvn
---
 src/hotspot/share/oops/methodData.cpp         |  2 +-
 src/hotspot/share/oops/trainingData.cpp       | 49 ++++++++++++++-----
 src/hotspot/share/oops/trainingData.hpp       |  4 +-
 .../share/prims/jvmtiRedefineClasses.cpp      |  5 ++
 .../aotCache/RedefineClassesInProfile.java    | 35 ++++++++++++-
 .../aotCache/test-classes/CustomLoadee.java   | 38 ++++++++++++++
 6 files changed, 117 insertions(+), 16 deletions(-)
 create mode 100644 test/hotspot/jtreg/runtime/cds/appcds/aotCache/test-classes/CustomLoadee.java

diff --git a/src/hotspot/share/oops/methodData.cpp b/src/hotspot/share/oops/methodData.cpp
index 38bdc33c628..ad1049ffa34 100644
--- a/src/hotspot/share/oops/methodData.cpp
+++ b/src/hotspot/share/oops/methodData.cpp
@@ -329,7 +329,7 @@ static bool is_excluded(Klass* k) {
       log_debug(aot, training)("Purged %s from MDO: unloaded class", k->name()->as_C_string());
       return true;
     } else {
-      bool excluded = SystemDictionaryShared::should_be_excluded(k);
+      bool excluded = SystemDictionaryShared::should_be_excluded(k) || !SystemDictionaryShared::is_builtin_loader(k->class_loader_data());
       if (excluded) {
         log_debug(aot, training)("Purged %s from MDO: excluded class", k->name()->as_C_string());
       }
diff --git a/src/hotspot/share/oops/trainingData.cpp b/src/hotspot/share/oops/trainingData.cpp
index f52c22ad38a..7976da35374 100644
--- a/src/hotspot/share/oops/trainingData.cpp
+++ b/src/hotspot/share/oops/trainingData.cpp
@@ -118,10 +118,23 @@ void TrainingData::verify() {
   }
 }
 
+static bool is_excluded(InstanceKlass* k) {
+  if (!k->is_loaded() || k->has_been_redefined()) {
+    return true;
+  }
+  if (CDSConfig::is_at_aot_safepoint()) {
+    // Check for AOT exclusion only at AOT safe point.
+    return SystemDictionaryShared::should_be_excluded(k) || !SystemDictionaryShared::is_builtin_loader(k->class_loader_data());
+  }
+  return false;
+}
+
 MethodTrainingData* MethodTrainingData::make(const methodHandle& method, bool null_if_not_found, bool use_cache) {
-  MethodTrainingData* mtd = nullptr;
   if (!have_data() && !need_data()) {
-    return mtd;
+    return nullptr;
+  }
+  if (is_excluded(method->method_holder())) {
+    return nullptr;
   }
   // Try grabbing the cached value first.
   // Cache value is stored in MethodCounters and the following are the
@@ -133,6 +146,7 @@ MethodTrainingData* MethodTrainingData::make(const methodHandle& method, bool nu
   //    i.e. null_if_no_found == true, then just return a null.
   // 3. Cache value is not null.
   //    Return it, the value of training_data_lookup_failed doesn't matter.
+  MethodTrainingData* mtd = nullptr;
   MethodCounters* mcs = method->method_counters();
   if (mcs != nullptr) {
     mtd = mcs->method_training_data();
@@ -175,6 +189,7 @@ MethodTrainingData* MethodTrainingData::make(const methodHandle& method, bool nu
           return nullptr; // allocation failure
         }
         td = training_data_set()->install(mtd);
+        assert(!is_excluded(method->method_holder()), "Should not be excluded");
         assert(td == mtd, "");
       } else {
         mtd = nullptr;
@@ -376,6 +391,9 @@ void CompileTrainingData::prepare(Visitor& visitor) {
 }
 
 KlassTrainingData* KlassTrainingData::make(InstanceKlass* holder, bool null_if_not_found) {
+  if (is_excluded(holder)) {
+    return nullptr;
+  }
   Key key(holder);
   TrainingData* td = CDS_ONLY(have_data() ? lookup_archived_training_data(&key) :) nullptr;
   KlassTrainingData* ktd = nullptr;
@@ -401,6 +419,7 @@ KlassTrainingData* KlassTrainingData::make(InstanceKlass* holder, bool null_if_n
       }
       td = training_data_set()->install(ktd);
       assert(ktd == td, "");
+      assert(!is_excluded(holder), "Should not be excluded");
     } else {
       ktd = td->as_KlassTrainingData();
       guarantee(ktd->holder() != nullptr, "null holder");
@@ -543,18 +562,24 @@ void TrainingData::cleanup_training_data() {
   }
 }
 
+void TrainingData::cleanup_after_redefinition() {
+  if (need_data()) {
+    TrainingDataLocker l;
+    ResourceMark rm;
+    Visitor visitor(training_data_set()->size());
+    training_data_set()->iterate([&](TrainingData* td) {
+      td->cleanup(visitor);
+    });
+  }
+}
+
 void KlassTrainingData::cleanup(Visitor& visitor) {
   if (visitor.is_visited(this)) {
     return;
   }
   visitor.visit(this);
   if (has_holder()) {
-    bool is_excluded = !holder()->is_loaded();
-    if (CDSConfig::is_at_aot_safepoint()) {
-      // Check for AOT exclusion only at AOT safe point.
-      is_excluded |= SystemDictionaryShared::should_be_excluded(holder());
-    }
-    if (is_excluded) {
+    if (is_excluded(holder())) {
       ResourceMark rm;
       log_debug(aot, training)("Cleanup KTD %s", name()->as_klass_external_name());
       _holder = nullptr;
@@ -572,12 +597,8 @@ void MethodTrainingData::cleanup(Visitor& visitor) {
   }
   visitor.visit(this);
   if (has_holder()) {
-    if (CDSConfig::is_at_aot_safepoint() && SystemDictionaryShared::should_be_excluded(holder()->method_holder())) {
-      // Check for AOT exclusion only at AOT safe point.
+    if (is_excluded(holder()->method_holder())) {
       log_debug(aot, training)("Cleanup MTD %s::%s", name()->as_klass_external_name(), signature()->as_utf8());
-      if (_final_profile != nullptr && _final_profile->method() != _holder) {
-        log_warning(aot, training)("Stale MDO for  %s::%s", name()->as_klass_external_name(), signature()->as_utf8());
-      }
       _final_profile = nullptr;
       _final_counters = nullptr;
       _holder = nullptr;
@@ -593,6 +614,7 @@ void MethodTrainingData::cleanup(Visitor& visitor) {
 }
 
 void KlassTrainingData::verify() {
+  guarantee(!has_holder() || !is_excluded(holder()), "Bad holder");
   for (int i = 0; i < comp_dep_count(); i++) {
     CompileTrainingData* ctd = comp_dep(i);
     if (!ctd->_init_deps.contains(this)) {
@@ -604,6 +626,7 @@ void KlassTrainingData::verify() {
 }
 
 void MethodTrainingData::verify(bool verify_dep_counter) {
+  guarantee(!has_holder() || !is_excluded(holder()->method_holder()), "Bad holder");
   iterate_compiles([&](CompileTrainingData* ctd) {
     ctd->verify(verify_dep_counter);
   });
diff --git a/src/hotspot/share/oops/trainingData.hpp b/src/hotspot/share/oops/trainingData.hpp
index c549004e76e..bd696f52a8b 100644
--- a/src/hotspot/share/oops/trainingData.hpp
+++ b/src/hotspot/share/oops/trainingData.hpp
@@ -310,7 +310,7 @@ private:
   static void iterate(Function& fn) { // lambda enabled API
     TrainingDataLocker l;
     if (have_data()) {
-      archived_training_data_dictionary()->iterate(fn);
+      archived_training_data_dictionary()->iterate_all(fn);
     }
     if (need_data()) {
       training_data_set()->iterate(fn);
@@ -431,6 +431,8 @@ private:
     }
     return nullptr;
   }
+
+  static void cleanup_after_redefinition();
 };
 
 // Training data that is associated with an InstanceKlass
diff --git a/src/hotspot/share/prims/jvmtiRedefineClasses.cpp b/src/hotspot/share/prims/jvmtiRedefineClasses.cpp
index c594cfc6816..8beddc5d406 100644
--- a/src/hotspot/share/prims/jvmtiRedefineClasses.cpp
+++ b/src/hotspot/share/prims/jvmtiRedefineClasses.cpp
@@ -53,6 +53,7 @@
 #include "oops/method.hpp"
 #include "oops/oop.inline.hpp"
 #include "oops/recordComponent.hpp"
+#include "oops/trainingData.hpp"
 #include "prims/jvmtiImpl.hpp"
 #include "prims/jvmtiRedefineClasses.hpp"
 #include "prims/jvmtiThreadState.inline.hpp"
@@ -274,6 +275,10 @@ void VM_RedefineClasses::doit() {
     redefine_single_class(current, _class_defs[i].klass, _scratch_classes[i]);
   }
 
+#if INCLUDE_CDS
+  TrainingData::cleanup_after_redefinition();
+#endif
+
   // Flush all compiled code that depends on the classes redefined.
   flush_dependent_code();
 
diff --git a/test/hotspot/jtreg/runtime/cds/appcds/aotCache/RedefineClassesInProfile.java b/test/hotspot/jtreg/runtime/cds/appcds/aotCache/RedefineClassesInProfile.java
index f311629b2de..bb1992d5c82 100644
--- a/test/hotspot/jtreg/runtime/cds/appcds/aotCache/RedefineClassesInProfile.java
+++ b/test/hotspot/jtreg/runtime/cds/appcds/aotCache/RedefineClassesInProfile.java
@@ -41,7 +41,10 @@
  * @run driver jdk.test.lib.helpers.ClassFileInstaller -jar redef1.jar
  *             RedefFoo RedefBar
  *             RedefTaz0 RedefTaz1 RedefTaz2 RedefTaz3 RedefTaz4
-
+ *
+ * @compile test-classes/CustomLoadee.java
+ * @run driver jdk.test.lib.helpers.ClassFileInstaller -jar cust.jar CustomLoadee
+ *
  * @run driver RedefineClassHelper
  * @build RedefineClassesInProfile
  * @run driver jdk.test.lib.helpers.ClassFileInstaller -jar app.jar RedefineClassesInProfileApp Util
@@ -49,6 +52,8 @@
  */
 
 import java.io.File;
+import java.net.URL;
+import java.net.URLClassLoader;
 import jdk.test.lib.cds.SimpleCDSAppTester;
 import jdk.test.lib.process.OutputAnalyzer;
 import jdk.test.lib.process.ProcessTools;
@@ -89,6 +94,7 @@ public class RedefineClassesInProfile {
                     out.shouldNotMatch(prefix + "RedefFoo");
                     out.shouldNotMatch(prefix + "RedefBar");
                     out.shouldNotMatch(prefix + "RedefTaz");
+                    out.shouldNotMatch(prefix + "CustomLoadee");
                 })
             .setProductionChecker((OutputAnalyzer out) -> {
                     out.shouldContain("Redefined: class RedefBar");
@@ -104,6 +110,7 @@ class RedefineClassesInProfileApp {
 
     public static void main(String[] args) throws Exception {
         test1();
+        test2();
     }
 
     // test1
@@ -175,4 +182,30 @@ class RedefineClassesInProfileApp {
             throw new RuntimeException("Unexpected failure", t);
         }
     }
+
+    // Test 2 -- TrainingData interaction with custom class loaders.
+    static void test2() throws Exception {
+        // Do this several times. The AOT cache should contain only one
+        // copy of CustomLoadee as an "unregistered" class, which will be
+        // used in the first iteration of this loop.
+        //
+        // The JVM should work well even if the cached version of CustomLoadee
+        // has been unloaded.
+        for (int i = 0; i < 4; i++) {
+            test2_inner();
+            System.gc(); // trigger unloading of CustomLoadee.
+        }
+    }
+
+    static void test2_inner() throws Exception {
+        // Load a class and run a loop to make sure it's compiled, but
+        // TrainingData should not record any class/method that are loaded
+        // by custom class loaders
+        File custJar = new File("cust.jar");
+        URL[] urls = new URL[] {custJar.toURI().toURL()};
+        URLClassLoader loader = new URLClassLoader(urls, RedefineClassesInProfileApp.class.getClassLoader());
+        Class<?> c = loader.loadClass("CustomLoadee");
+        System.out.println(c.newInstance());
+    }
 }
+
diff --git a/test/hotspot/jtreg/runtime/cds/appcds/aotCache/test-classes/CustomLoadee.java b/test/hotspot/jtreg/runtime/cds/appcds/aotCache/test-classes/CustomLoadee.java
new file mode 100644
index 00000000000..aa78f2ba57a
--- /dev/null
+++ b/test/hotspot/jtreg/runtime/cds/appcds/aotCache/test-classes/CustomLoadee.java
@@ -0,0 +1,38 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ *
+ */
+
+public class CustomLoadee {
+    public CustomLoadee() {
+        hotspot2();
+    }
+
+    static volatile int x;
+    static void hotspot2() {
+        long start = System.currentTimeMillis();
+        // run this loop long enough (400ms) for it to be JIT compiled.
+        while (System.currentTimeMillis() - start < 400) {
+            x += 1;
+        }
+    }
+}

From fa5ec62405af5ca104ca269d3470e07de690386f Mon Sep 17 00:00:00 2001
From: Dusan Balek <dusan.balek@oracle.com>
Date: Thu, 2 Apr 2026 08:20:47 +0000
Subject: [PATCH 470/655] 8378950: Repeated warnings when annotation processing
 is happening

Co-authored-by: Archie Cobbs <acobbs@openjdk.org>
Reviewed-by: jlahoda
---
 .../JavacProcessingEnvironment.java           | 15 ++++--
 .../APImplicitClassesWarnings.java            | 53 +++++++++++++++++--
 .../tools/javac/modules/IncubatingTest.java   | 46 ++++++++++++++--
 .../rounds/OverwriteBetweenCompilations_2.out |  2 -
 4 files changed, 103 insertions(+), 13 deletions(-)

diff --git a/src/jdk.compiler/share/classes/com/sun/tools/javac/processing/JavacProcessingEnvironment.java b/src/jdk.compiler/share/classes/com/sun/tools/javac/processing/JavacProcessingEnvironment.java
index 74d082d4b64..809c19d5012 100644
--- a/src/jdk.compiler/share/classes/com/sun/tools/javac/processing/JavacProcessingEnvironment.java
+++ b/src/jdk.compiler/share/classes/com/sun/tools/javac/processing/JavacProcessingEnvironment.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2005, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2005, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -1104,7 +1104,7 @@ public class JavacProcessingEnvironment implements ProcessingEnvironment, Closea
                 return true;
 
             return deferredDiagnosticHandler.getDiagnostics().stream()
-              .anyMatch(d -> (d.getKind() == Diagnostic.Kind.WARNING && werror) ||
+              .anyMatch(d -> (d.getKind() == Diagnostic.Kind.WARNING && werror && ACCEPT_NON_RECOVERABLE_LINTS.test(d)) ||
                              (d.getKind() == Diagnostic.Kind.ERROR && (fatalErrors || !d.isFlagSet(RECOVERABLE))));
         }
 
@@ -1195,12 +1195,19 @@ public class JavacProcessingEnvironment implements ProcessingEnvironment, Closea
         }
 
         void showDiagnostics(boolean showAll) {
-            deferredDiagnosticHandler.reportDeferredDiagnostics(showAll ? ACCEPT_ALL
-                                                                        : ACCEPT_NON_RECOVERABLE);
+            deferredDiagnosticHandler.reportDeferredDiagnostics(
+                    ACCEPT_NON_RECOVERABLE_LINTS.and(showAll ? ACCEPT_ALL
+                                                             : ACCEPT_NON_RECOVERABLE));
             log.popDiagnosticHandler(deferredDiagnosticHandler);
             compiler.setDeferredDiagnosticHandler(null);
         }
         //where:
+            private final Predicate<JCDiagnostic> ACCEPT_NON_RECOVERABLE_LINTS =
+                    d -> !Optional.of(d)
+                            .map(JCDiagnostic::getLintCategory)
+                            .map(lc -> lc.annotationSuppression ||
+                                       lc == Lint.LintCategory.INCUBATING)
+                            .orElse(false);
             private final Predicate<JCDiagnostic> ACCEPT_NON_RECOVERABLE =
                     d -> d.getKind() != JCDiagnostic.Kind.ERROR ||
                          !d.isFlagSet(DiagnosticFlag.RECOVERABLE) ||
diff --git a/test/langtools/tools/javac/implicitCompile/APImplicitClassesWarnings.java b/test/langtools/tools/javac/implicitCompile/APImplicitClassesWarnings.java
index dc60c6cc78a..8c1e356217c 100644
--- a/test/langtools/tools/javac/implicitCompile/APImplicitClassesWarnings.java
+++ b/test/langtools/tools/javac/implicitCompile/APImplicitClassesWarnings.java
@@ -23,7 +23,7 @@
 
 /*
  * @test
- * @bug 8378740
+ * @bug 8378740 8378950
  * @summary Verify warnings are properly suppressed for the combination of
  *          annotation processing and implicit compilation
  * @library /tools/lib
@@ -96,9 +96,7 @@ public class APImplicitClassesWarnings {
 
         List<String> expected = List.of(
             "Use.java:4:5: compiler.warn.has.been.deprecated.for.removal: test.Depr, test",
-            "Use.java:4:5: compiler.warn.has.been.deprecated.for.removal: test.Depr, test",
-            "Use.java:4:5: compiler.warn.has.been.deprecated.for.removal: test.Depr, test",
-            "3 warnings"
+            "1 warning"
         );
 
         tb.checkEqual(expected, log);
@@ -143,6 +141,53 @@ public class APImplicitClassesWarnings {
                 .writeAll();
     }
 
+    @Test
+    public void testCorrectImport() throws Exception {
+        Path src = base.resolve("src");
+        Path classes = base.resolve("classes");
+        tb.writeJavaFiles(src,
+                          """
+                          package test;
+
+                          @Deprecated(forRemoval=true)
+                          public class Depr {
+                              public static class Nested {}
+                          }
+                          """,
+                          """
+                          package test;
+                          import test.Depr.Nested;
+                          public class Use {
+                              Implicit implicit;
+                              Nested nest;
+                          }
+                          """,
+                          """
+                          package test;
+                          public interface Implicit {}
+                          """);
+        Files.createDirectories(classes);
+
+        List<String> log = new JavacTask(tb)
+            .options("-d", classes.toString(),
+                     "-XDrawDiagnostics",
+                     "-implicit:class",
+                     "-sourcepath", src.toString())
+            .files(src.resolve("test").resolve("Depr.java"),
+                    src.resolve("test").resolve("Use.java"))
+            .processors(new ProcessorImpl())
+            .run()
+            .writeAll()
+            .getOutputLines(Task.OutputKind.DIRECT);
+
+        List<String> expected = List.of(
+            "Use.java:2:12: compiler.warn.has.been.deprecated.for.removal: test.Depr, test",
+            "1 warning"
+        );
+
+        tb.checkEqual(expected, log);
+    }
+
     @SupportedAnnotationTypes("*")
     private static class ProcessorImpl extends AbstractProcessor {
         @Override
diff --git a/test/langtools/tools/javac/modules/IncubatingTest.java b/test/langtools/tools/javac/modules/IncubatingTest.java
index 68f615abc04..6ff1a0a29c8 100644
--- a/test/langtools/tools/javac/modules/IncubatingTest.java
+++ b/test/langtools/tools/javac/modules/IncubatingTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2015, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2015, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,7 +23,7 @@
 
 /*
  * @test
- * @bug 8171177 8187591
+ * @bug 8171177 8187591 8378950
  * @summary Verify that ModuleResolution attribute flags are honored.
  * @library /tools/lib
  * @modules jdk.compiler/com.sun.tools.javac.api
@@ -46,10 +46,15 @@ import java.util.Arrays;
 import java.util.HashMap;
 import java.util.List;
 import java.util.Map;
-
+import java.util.Set;
 import java.lang.classfile.*;
 import java.lang.classfile.attribute.ModuleResolutionAttribute;
 import java.lang.classfile.constantpool.*;
+import javax.annotation.processing.AbstractProcessor;
+import javax.annotation.processing.RoundEnvironment;
+import javax.annotation.processing.SupportedAnnotationTypes;
+import javax.lang.model.SourceVersion;
+import javax.lang.model.element.TypeElement;
 import toolbox.JavacTask;
 import toolbox.Task;
 import toolbox.Task.Expect;
@@ -242,6 +247,29 @@ public class IncubatingTest extends ModuleTestBase {
                 .outdir(testModuleClasses)
                 .files(findJavaFiles(testModuleSrc))
                 .run(Expect.SUCCESS);
+
+        //test with annotation processing
+        log = new JavacTask(tb)
+                .options("--module-path", classes.toString(),
+                         "-XDrawDiagnostics",
+                         "-Werror")
+                .outdir(testModuleClasses)
+                .files(findJavaFiles(testModuleSrc))
+                .processors(new ProcessorImpl())
+                .run(Expect.FAIL)
+                .writeAll()
+                .getOutputLines(Task.OutputKind.DIRECT);
+
+        expected = Arrays.asList(
+                "- compiler.warn.incubating.modules: jdk.i",
+                "- compiler.err.warnings.and.werror",
+                "1 error",
+                "1 warning"
+        );
+
+        if (!expected.equals(log)) {
+            throw new AssertionError("Unexpected output: " + log);
+        }
     }
 
     private void copyJavaBase(Path targetDir) throws IOException {
@@ -270,4 +298,16 @@ public class IncubatingTest extends ModuleTestBase {
             out.write(newBytes);
         }
     }
+
+    @SupportedAnnotationTypes("*")
+    private static class ProcessorImpl extends AbstractProcessor {
+        @Override
+        public boolean process(Set<? extends TypeElement> annotations, RoundEnvironment roundEnv) {
+            return false;
+        }
+        @Override
+        public SourceVersion getSupportedSourceVersion() {
+            return SourceVersion.latest();
+        }
+    }
 }
diff --git a/test/langtools/tools/javac/processing/rounds/OverwriteBetweenCompilations_2.out b/test/langtools/tools/javac/processing/rounds/OverwriteBetweenCompilations_2.out
index 826e2b4bcb0..431fd3d9079 100644
--- a/test/langtools/tools/javac/processing/rounds/OverwriteBetweenCompilations_2.out
+++ b/test/langtools/tools/javac/processing/rounds/OverwriteBetweenCompilations_2.out
@@ -53,5 +53,3 @@ public abstract class GeneratedClass<E extends java.lang.Number> extends java.ut
 
   public void test(long a);
 }
-- compiler.note.deprecated.filename: OverwriteBetweenCompilationsSource.java
-- compiler.note.deprecated.recompile

From a506853a8267e5e4a5395ea0303e054d19acdbac Mon Sep 17 00:00:00 2001
From: Jan Lahoda <jlahoda@openjdk.org>
Date: Thu, 2 Apr 2026 08:53:05 +0000
Subject: [PATCH 471/655] 8374020: Inconsistent handling of type updates in
 typeWithAnnotations

Reviewed-by: abimpoudis
---
 .../sun/tools/javac/code/TypeAnnotations.java |  17 ++-
 .../TypeAnnotationsOnTypes.java               | 143 ++++++++++++++++++
 2 files changed, 152 insertions(+), 8 deletions(-)
 create mode 100644 test/langtools/tools/javac/annotations/typeAnnotations/TypeAnnotationsOnTypes.java

diff --git a/src/jdk.compiler/share/classes/com/sun/tools/javac/code/TypeAnnotations.java b/src/jdk.compiler/share/classes/com/sun/tools/javac/code/TypeAnnotations.java
index 8eba79c7480..0393ed79897 100644
--- a/src/jdk.compiler/share/classes/com/sun/tools/javac/code/TypeAnnotations.java
+++ b/src/jdk.compiler/share/classes/com/sun/tools/javac/code/TypeAnnotations.java
@@ -472,11 +472,12 @@ public class TypeAnnotations {
                 Assert.check(tc.position == pos);
             }
 
-            if (type.hasTag(TypeTag.ARRAY))
-                return rewriteArrayType(typetree, (ArrayType)type, annotations, onlyTypeAnnotations, pos);
+            Type ret;
 
-            if (type.hasTag(TypeTag.TYPEVAR)) {
-                return type.annotatedType(onlyTypeAnnotations);
+            if (type.hasTag(TypeTag.ARRAY)) {
+                ret = rewriteArrayType(typetree, (ArrayType)type, annotations, onlyTypeAnnotations, pos);
+            } else if (type.hasTag(TypeTag.TYPEVAR)) {
+                ret = type.annotatedType(onlyTypeAnnotations);
             } else if (type.getKind() == TypeKind.UNION) {
                 // There is a TypeKind, but no TypeTag.
                 UnionClassType ut = (UnionClassType) type;
@@ -487,7 +488,7 @@ public class TypeAnnotations {
                 ListBuffer<Type> alternatives = new ListBuffer<>();
                 alternatives.add(res);
                 alternatives.addAll(ut.alternatives_field.tail);
-                return new UnionClassType((ClassType) ut.getLub(), alternatives.toList());
+                ret = new UnionClassType((ClassType) ut.getLub(), alternatives.toList());
             } else {
                 Type enclTy = type;
                 Element enclEl = type.asElement();
@@ -567,10 +568,10 @@ public class TypeAnnotations {
                     pos.location = pos.location.appendList(depth.toList());
                 }
 
-                Type ret = typeWithAnnotations(type, enclTy, annotations);
-                typetree.type = ret;
-                return ret;
+                ret = typeWithAnnotations(type, enclTy, annotations);
             }
+            typetree.type = ret;
+            return ret;
         }
 
         /**
diff --git a/test/langtools/tools/javac/annotations/typeAnnotations/TypeAnnotationsOnTypes.java b/test/langtools/tools/javac/annotations/typeAnnotations/TypeAnnotationsOnTypes.java
new file mode 100644
index 00000000000..5ae6b17a24c
--- /dev/null
+++ b/test/langtools/tools/javac/annotations/typeAnnotations/TypeAnnotationsOnTypes.java
@@ -0,0 +1,143 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+/*
+ * @test
+ * @bug 8374020
+ * @summary Verify types are set back to the AST.
+ * @library /tools/lib
+ * @modules
+ *      jdk.compiler/com.sun.tools.javac.api
+ *      jdk.compiler/com.sun.tools.javac.main
+ * @build toolbox.ToolBox toolbox.JavacTask
+ * @compile TypeAnnotationsOnTypes.java
+ * @run main TypeAnnotationsOnTypes
+ */
+
+import com.sun.source.tree.VariableTree;
+import com.sun.source.util.TaskEvent;
+import com.sun.source.util.TaskListener;
+import com.sun.source.util.TreePath;
+import com.sun.source.util.TreePathScanner;
+import com.sun.source.util.Trees;
+import java.nio.file.Files;
+import java.nio.file.Path;
+import java.nio.file.Paths;
+import java.util.ArrayList;
+import java.util.List;
+import java.util.stream.Collectors;
+import javax.lang.model.type.TypeKind;
+import javax.lang.model.type.TypeMirror;
+import javax.lang.model.type.UnionType;
+import toolbox.JavacTask;
+import toolbox.ToolBox;
+
+public class TypeAnnotationsOnTypes {
+
+    public static void main(String... args) throws Exception {
+        new TypeAnnotationsOnTypes().run();
+    }
+
+    ToolBox tb = new ToolBox();
+
+    void run() throws Exception {
+        typeAnnotationInConstantExpressionFieldInit(Paths.get("."));
+    }
+
+    void typeAnnotationInConstantExpressionFieldInit(Path base) throws Exception {
+        Path src = base.resolve("src");
+        Path classes = base.resolve("classes");
+        tb.writeJavaFiles(src,
+                          """
+                          import java.lang.annotation.ElementType;
+                          import java.util.List;
+                          import java.lang.annotation.Target;
+
+                          class Test<TypeVar> {
+
+                              void f() {
+                                  @TA List<String> l1;
+                                  @TA String[] l2;
+                                  @TA TypeVar l3;
+                                  try {
+                                  } catch (@TA IllegalStateException |  NullPointerException | @TA IllegalArgumentException ex) {}
+                              }
+
+                              @Target(ElementType.TYPE_USE)
+                              @interface TA {}
+                          }
+                          """);
+        Files.createDirectories(classes);
+        List<String> actual = new ArrayList<>();
+        new JavacTask(tb)
+                .options("-d", classes.toString())
+                .files(tb.findJavaFiles(src))
+                .callback(task -> {
+                    task.addTaskListener(new TaskListener() {
+                        @Override
+                        public void finished(TaskEvent e) {
+                            if (e.getKind() != TaskEvent.Kind.ANALYZE) {
+                                return ;
+                            }
+                            Trees trees = Trees.instance(task);
+                            new TreePathScanner<Void, Void>() {
+                                @Override
+                                public Void visitVariable(VariableTree node, Void p) {
+                                    TreePath typePath =
+                                            new TreePath(getCurrentPath(), node.getType());
+                                    actual.add(node.getName() +
+                                               ": type on variable: " +
+                                               typeToString(trees.getTypeMirror(getCurrentPath())) +
+                                               ": type on type: " +
+                                               typeToString(trees.getTypeMirror(typePath)));
+                                    return super.visitVariable(node, p);
+                                }
+                            }.scan(e.getCompilationUnit(), null);
+                        }
+                    });
+                })
+                .run()
+                .writeAll();
+
+        List<String> expected = List.of(
+            "l1: type on variable: java.util.@Test.TA List<java.lang.String>: type on type: java.util.@Test.TA List<java.lang.String>",
+            "l2: type on variable: java.lang.@Test.TA String[]: type on type: java.lang.@Test.TA String[]",
+            "l3: type on variable: @Test.TA TypeVar: type on type: @Test.TA TypeVar",
+            "ex: type on variable: java.lang.@Test.TA IllegalStateException | java.lang.NullPointerException | java.lang.@Test.TA IllegalArgumentException: " +
+                    "type on type: java.lang.@Test.TA IllegalStateException | java.lang.NullPointerException | java.lang.@Test.TA IllegalArgumentException"
+        );
+
+        actual.forEach(System.out::println);
+        if (!expected.equals(actual)) {
+            throw new AssertionError("Expected: " + expected + ", but got: " + actual);
+        }
+    }
+
+    static String typeToString(TypeMirror type) {
+        if (type != null && type.getKind() == TypeKind.UNION) {
+            return ((UnionType) type).getAlternatives().stream().map(t -> typeToString(t)).collect(Collectors.joining(" | "));
+        } else {
+            return String.valueOf(type);
+        }
+    }
+}

From 262f574abcea619c4159ff7d47d3d538953ddfac Mon Sep 17 00:00:00 2001
From: Alan Bateman <alanb@openjdk.org>
Date: Thu, 2 Apr 2026 13:06:06 +0000
Subject: [PATCH 472/655] 8381487: Replace threadDump.schema.json with document
 to describe format

Reviewed-by: kevinw
---
 .../management/HotSpotDiagnosticMXBean.java   |   9 +-
 .../sun/management/doc-files/threadDump.html  | 283 ++++++++++++++++++
 .../doc-files/threadDump.schema.json          | 169 -----------
 3 files changed, 286 insertions(+), 175 deletions(-)
 create mode 100644 src/jdk.management/share/classes/com/sun/management/doc-files/threadDump.html
 delete mode 100644 src/jdk.management/share/classes/com/sun/management/doc-files/threadDump.schema.json

diff --git a/src/jdk.management/share/classes/com/sun/management/HotSpotDiagnosticMXBean.java b/src/jdk.management/share/classes/com/sun/management/HotSpotDiagnosticMXBean.java
index 8ce7c03f62d..9ed1069155b 100644
--- a/src/jdk.management/share/classes/com/sun/management/HotSpotDiagnosticMXBean.java
+++ b/src/jdk.management/share/classes/com/sun/management/HotSpotDiagnosticMXBean.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2005, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2005, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -117,11 +117,8 @@ public interface HotSpotDiagnosticMXBean extends PlatformManagedObject {
      * does not exist.
      *
      * <p> When the format is specified as {@link ThreadDumpFormat#JSON JSON}, the
-     * thread dump is generated in JavaScript Object Notation.
-     * <a href="doc-files/threadDump.schema.json">threadDump.schema.json</a>
-     * describes the thread dump format in draft
-     * <a href="https://tools.ietf.org/html/draft-json-schema-language-02">
-     * JSON Schema Language version 2</a>.
+     * thread dump is generated as JSON text in the <a href="doc-files/threadDump.html">
+     * JSON Thread Dump Format</a>.
      *
      * <p> The thread dump will include output for all platform threads. It may
      * include output for some or all virtual threads.
diff --git a/src/jdk.management/share/classes/com/sun/management/doc-files/threadDump.html b/src/jdk.management/share/classes/com/sun/management/doc-files/threadDump.html
new file mode 100644
index 00000000000..f7dd84d4f32
--- /dev/null
+++ b/src/jdk.management/share/classes/com/sun/management/doc-files/threadDump.html
@@ -0,0 +1,283 @@
+<!doctype html>
+<!--
+ Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+
+ This code is free software; you can redistribute it and/or modify it
+ under the terms of the GNU General Public License version 2 only, as
+ published by the Free Software Foundation.  Oracle designates this
+ particular file as subject to the "Classpath" exception as provided
+ by Oracle in the LICENSE file that accompanied this code.
+
+ This code is distributed in the hope that it will be useful, but WITHOUT
+ ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ version 2 for more details (a copy is included in the LICENSE file that
+ accompanied this code).
+
+ You should have received a copy of the GNU General Public License version
+ 2 along with this work; if not, write to the Free Software Foundation,
+ Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+
+ Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ or visit www.oracle.com if you need additional information or have any
+ questions.
+-->
+<html lang="en">
+<head>
+    <title>JSON Thread Dump Format</title>
+</head>
+<body>
+
+<h1>JSON Thread Dump Format</h1>
+
+The JSON text is an object with a member named "threadDump" that is an object with the
+following members:
+<table class="striped">
+    <caption style="display:none">threadDump members</caption>
+    <thead>
+    <tr>
+        <th scope="col">Name</th>
+        <th scope="col">Data type</th>
+        <th scope="col">Optional</th>
+        <th scope="col">Description</th>
+    </tr>
+</thead>
+    <tbody>
+    <tr>
+        <th scope="row"> formatVersion </th>
+        <td> number </td>
+        <td> no </td>
+        <td> The format version. Its value is 2. </td>
+    </tr>
+    <tr>
+        <th scope="row"> processId </th>
+        <td> number </td>
+        <td> no </td>
+        <td> The process identifier (pid) of the VM that generated the thread dump. </td>
+    </tr>
+    <tr>
+        <th scope="row"> time </th>
+        <td> string </td>
+        <td> no </td>
+        <td> The timestamp, in ISO 8601 format, when the thread dump was generated. </td>
+    </tr>
+    <tr>
+        <th scope="row"> runtimeVersion </th>
+        <td> string </td>
+        <td> no </td>
+        <td> The {@linkplain java.lang.Runtime.Version runtime version} of the VM that
+            generated the thread dump. </td>
+    </tr>
+    <tr>
+        <th scope="row"> threadContainers </th>
+        <td> array </td>
+        <td> no </td>
+        <td> The array of thread "groupings". The first element is the root grouping/container
+            with name "&lt;root&gt;". </td>
+    </tr>
+    </tbody>
+</table>
+
+<p> Each element in the "threadContainers" array is an object that represents a
+    grouping/container of threads with the following members:
+<table class="striped">
+    <caption style="display:none">threadContainers members</caption>
+    <thead>
+    <tr>
+        <th scope="col">Name</th>
+        <th scope="col">Data type</th>
+        <th scope="col">Optional</th>
+        <th scope="col">Description</th>
+    </tr>
+    </thead>
+    <tbody>
+    <tr>
+        <th scope="row"> container </th>
+        <td> string </td>
+        <td> no </td>
+        <td> The thread container name. The name is unique. </td>
+    </tr>
+    <tr>
+        <th scope="row"> parent </th>
+        <td> string or null </td>
+        <td> no </td>
+        <td> The thread container parent's name or {@code null} for the root container. </td>
+    </tr>
+    <tr>
+        <th scope="row"> owner </th>
+        <td> number or null </td>
+        <td> no </td>
+        <td> The {@linkplain java.lang.Thread#threadId() thread identifier} of the thread
+            that owns the thread container or {@code null} if no owner. </td>
+    </tr>
+    <tr>
+        <th scope="row"> threads </th>
+        <td> array </td>
+        <td> no </td>
+        <td> The array of threads in the thread grouping/container. </td>
+    </tr>
+    <tr>
+        <th scope="row"> threadCount </th>
+        <td> number </td>
+        <td> yes </td>
+        <td> The number of threads in the thread grouping/container. If the thread dump
+            includes all virtual threads then this count is the same as the number of
+            elements in the threads array. If all virtual threads are not included then
+            it may be larger than the number of elements in the threads array. </td>
+    </tr>
+    </tbody>
+</table>
+
+<p> Each element in a "threads" array is an object with the following members:
+<table class="striped">
+    <caption style="display:none">threads members</caption>
+    <thead>
+    <tr>
+        <th scope="col">Name</th>
+        <th scope="col">Data type</th>
+        <th scope="col">Optional</th>
+        <th scope="col">Description</th>
+    </tr>
+    </thead>
+    <tbody>
+    <tr>
+        <th scope="row"> tid </th>
+        <td> number </td>
+        <td> no </td>
+        <td> The {@linkplain java.lang.Thread#threadId() thread identifier}. </td>
+    </tr>
+    <tr>
+        <th scope="row"> time </th>
+        <td> string </td>
+        <td> no </td>
+        <td> The timestamp, in ISO 8601 format, when the thread was sampled. </td>
+    </tr>
+    <tr>
+        <th scope="row"> name </th>
+        <td> string </td>
+        <td> no </td>
+        <td> The {@linkplain java.lang.Thread#getName() thread name}. </td>
+    </tr>
+    <tr>
+        <th scope="row"> state </th>
+        <td> string </td>
+        <td> no </td>
+        <td> The string representation of the {@linkplain java.lang.Thread#getState() thread state}. </td>
+    </tr>
+    <tr>
+        <th scope="row"> virtual </th>
+        <td> boolean </td>
+        <td> yes </td>
+        <td> {@code true} if the thread is a {@linkplain java.lang.Thread#isVirtual() virtual thread}. </td>
+    </tr>
+    <tr>
+        <th scope="row"> carrier </th>
+        <td> number </td>
+        <td> yes </td>
+        <td> The thread identifier of the carrier thread when this thread is a <em>mounted</em>
+            virtual thread. </td>
+    </tr>
+    <tr>
+        <th scope="row"> stack </th>
+        <td> array </td>
+        <td> no </td>
+        <td> The thread stack. The elements in the array are of type string with the string
+            representation of a {@linkplain java.lang.StackTraceElement stack trace element}.
+            If the thread stack has one or more elements, then the first element is the top
+            of the stack. </td>
+    </tr>
+    <tr>
+        <th scope="row"> parkBlocker </th>
+        <td> object </td>
+        <td> yes </td>
+        <td> The object responsible for the thread parking. Its members identify the
+             blocker object, and the exclusive owner thread if owned. </td>
+    </tr>
+    <tr>
+        <th scope="row"> blockedOn </th>
+        <td> string </td>
+        <td> yes </td>
+        <td> The {@linkplain java.util.Objects#toIdentityString(Object) identity string} of the
+            object that the thread is blocked on waiting to enter/re-enter a synchronization
+            method or block. </td>
+    </tr>
+    <tr>
+        <th scope="row"> waitingOn </th>
+        <td> string </td>
+        <td> yes </td>
+        <td> The {@linkplain java.util.Objects#toIdentityString(Object) identity string}
+            of the object that the thread is {@linkplain java.lang.Object#wait() waiting}
+            to be notified. </td>
+    </tr>
+    <tr>
+        <th scope="row"> monitorsOwned </th>
+        <td> array </td>
+        <td> yes </td>
+        <td> The objects for which a monitor is owned by the thread. </td>
+    </tr>
+    </tbody>
+</table>
+
+<p> A "parkBlocker" object has the following members:
+<table class="striped">
+    <caption style="display:none">parkBlocker members</caption>
+    <thead>
+    <tr>
+        <th scope="col">Name</th>
+        <th scope="col">Data type</th>
+        <th scope="col">Optional</th>
+        <th scope="col">Description</th>
+    </tr>
+    </thead>
+    <tbody>
+    <tr>
+        <th scope="row"> object </th>
+        <td> string </td>
+        <td> no </td>
+        <td> The {@linkplain java.util.Objects#toIdentityString(Object) identity string}
+             of the {@linkplain java.util.concurrent.locks.LockSupport#park(Object) blocker
+             object} responsible for the thread parking. </td>
+    </tr>
+    <tr>
+        <th scope="row"> owner </th>
+        <td> number </td>
+        <td> yes </td>
+        <td> The thread identifier of the exclusive owner thread when the parkBlocker is
+             an {@link java.util.concurrent.locks.AbstractOwnableSynchronizer}. </td>
+    </tr>
+    </tbody>
+</table>
+
+<p> Each element in a "monitorsOwned" array is an object with the following members: </p>
+<table class="striped">
+    <caption style="display:none">monitorsOwned members</caption>
+    <thead>
+    <tr>
+        <th scope="col">Name</th>
+        <th scope="col">Data type</th>
+        <th scope="col">Optional</th>
+        <th scope="col">Description</th>
+    </tr>
+    </thead>
+    <tbody>
+    <tr>
+        <th scope="row"> depth </th>
+        <td> number </td>
+        <td> no </td>
+        <td> The stack depth at which the monitors are owned. </td>
+    </tr>
+    <tr>
+        <th scope="row"> locks </th>
+        <td> array </td>
+        <td> no </td>
+        <td> The elements of the array are of type string or null. An element of type string
+            has a value that is the {@linkplain java.util.Objects#toIdentityString(Object)
+            identity string} of the object for which the monitor is owned by the thread.
+            The element is of type null when the object has been eliminated. </td>
+    </tr>
+    </tbody>
+</table>
+
+</body>
+</html>
diff --git a/src/jdk.management/share/classes/com/sun/management/doc-files/threadDump.schema.json b/src/jdk.management/share/classes/com/sun/management/doc-files/threadDump.schema.json
deleted file mode 100644
index 30161b0bb74..00000000000
--- a/src/jdk.management/share/classes/com/sun/management/doc-files/threadDump.schema.json
+++ /dev/null
@@ -1,169 +0,0 @@
-{
-  "type": "object",
-  "properties": {
-    "threadDump": {
-      "type": "object",
-      "properties": {
-        "formatVersion": {
-          "type": "integer",
-          "description": "Format version (2)."
-        },
-        "processId": {
-          "type": "integer",
-          "description": "The native process id of the Java virtual machine."
-        },
-        "time": {
-          "type": "string",
-          "description": "The time in ISO 8601 format when the thread dump was generated."
-        },
-        "runtimeVersion": {
-          "type": "string",
-          "description": "The runtime version, see java.lang.Runtime.Version"
-        },
-        "threadContainers": {
-          "type": "array",
-          "description": "The array of thread containers (thread groupings).",
-          "items": [
-            {
-              "type": "object",
-              "properties": {
-                "container": {
-                  "type": "string",
-                  "description": "The container name. The container name is unique."
-                },
-                "parent": {
-                  "type": [ "string", "null" ],
-                  "description": "The parent container name or null for the root container."
-                },
-                "owner": {
-                  "type": [ "integer", "null" ],
-                  "description": "The thread identifier of the owner thread or null if no owner."
-                },
-                "threads": {
-                  "type": "array",
-                  "description": "The array of threads in the thread container.",
-                  "items": [
-                    {
-                      "type": "object",
-                      "properties": {
-                        "tid": {
-                          "type": "integer",
-                          "description": "The thread identifier."
-                        },
-                        "time": {
-                          "type": "string",
-                          "description": "The time in ISO 8601 format that the thread was sampled."
-                        },
-                        "name": {
-                          "type": "string",
-                          "description": "The thread name."
-                        },
-                        "state": {
-                          "type": "string",
-                          "description": "The thread state (Thread::getState)."
-                        },
-                        "virtual" : {
-                          "type": "boolean",
-                          "description": "true for a virtual thread."
-                        },
-                        "parkBlocker": {
-                          "type": "object",
-                          "properties": {
-                            "object": {
-                              "type": "string",
-                              "description": "The blocker object responsible for the thread parking."
-                            }
-                          },
-                          "owner": {
-                            "type": "integer",
-                            "description": "The thread identifier of the owner when the parkBlocker is an AbstractOwnableSynchronizer."
-                          },
-                          "required": [
-                            "object"
-                          ]
-                        },
-                        "blockedOn": {
-                          "type": "string",
-                          "description": "The object that the thread is blocked on waiting to enter/re-enter a synchronization block/method."
-                        },
-                        "waitingOn": {
-                          "type": "string",
-                          "description": "The object that the thread is waiting to be notified (Object.wait)."
-                        },
-                        "stack": {
-                          "type": "array",
-                          "description": "The thread stack. The first element is the top of the stack.",
-                          "items": [
-                            {
-                              "type": "string",
-                              "description": "A stack trace element (java.lang.StackTraceElement)."
-                            }
-                          ]
-                        },
-                        "monitorsOwned": {
-                          "type": "array",
-                          "description": "The objects for which monitors are owned by the thread.",
-                          "items": {
-                            "type": "object",
-                            "properties": {
-                              "depth": {
-                                "type": "integer",
-                                "description": "The stack depth at which the monitors are owned."
-                              },
-                              "locks": {
-                                "type": "array",
-                                "items": {
-                                  "type": [ "string", "null" ],
-                                  "description": "The object for which the monitor is owned by the thread, null if eliminated."
-                                }
-                              }
-                            },
-                            "required": [
-                              "depth",
-                              "locks"
-                            ]
-                          }
-                        },
-                        "carrier":  {
-                          "type": "integer",
-                          "description": "The thread identifier of the carrier thread if mounted."
-                        }
-                      },
-                      "required": [
-                        "tid",
-                        "time",
-                        "name",
-                        "state",
-                        "stack"
-                      ]
-                    }
-                  ]
-                },
-                "threadCount": {
-                  "type": "integer",
-                  "description": "The number of threads in the thread container."
-                }
-              },
-              "required": [
-                "container",
-                "parent",
-                "owner",
-                "threads"
-              ]
-            }
-          ]
-        }
-      },
-      "required": [
-        "formatVersion",
-        "processId",
-        "time",
-        "runtimeVersion",
-        "threadContainers"
-      ]
-    }
-  },
-  "required": [
-    "threadDump"
-  ]
-}

From 81b6fcc3e9e6a5a53a7a53d8371d86a2f48f3d90 Mon Sep 17 00:00:00 2001
From: Vladimir Petko <vpetko@openjdk.org>
Date: Thu, 2 Apr 2026 13:12:48 +0000
Subject: [PATCH 473/655] 8381555:
 test/hotspot/jtreg/gc/arguments/TestG1CompressedOops.java fails on 32 bit
 architectures

Reviewed-by: jsikstro
---
 test/hotspot/jtreg/gc/arguments/TestG1CompressedOops.java | 1 +
 1 file changed, 1 insertion(+)

diff --git a/test/hotspot/jtreg/gc/arguments/TestG1CompressedOops.java b/test/hotspot/jtreg/gc/arguments/TestG1CompressedOops.java
index 3aec113990c..c4c1d364308 100644
--- a/test/hotspot/jtreg/gc/arguments/TestG1CompressedOops.java
+++ b/test/hotspot/jtreg/gc/arguments/TestG1CompressedOops.java
@@ -27,6 +27,7 @@ package gc.arguments;
 /*
  * @test TestG1CompressedOops
  * @bug 8354145
+ * @requires vm.bits == 64
  * @requires vm.flagless
  * @summary Verify that the flag UseCompressedOops is updated properly
  * @library /test/lib

From 06c9aebce3aefec4c75c5ebb46bd9ffc62d09266 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Daniel=20Jeli=C5=84ski?= <djelinski@openjdk.org>
Date: Thu, 2 Apr 2026 13:40:51 +0000
Subject: [PATCH 474/655] 8377550: [REDO] Need to keep leading zeros in
 TlsPremasterSecret of TLS1.3 DHKeyAgreement

Reviewed-by: hchao, mullan
---
 .../share/classes/sun/security/ssl/KAKeyDerivation.java    | 7 +++++--
 1 file changed, 5 insertions(+), 2 deletions(-)

diff --git a/src/java.base/share/classes/sun/security/ssl/KAKeyDerivation.java b/src/java.base/share/classes/sun/security/ssl/KAKeyDerivation.java
index dea86351cc8..0ca197160a9 100644
--- a/src/java.base/share/classes/sun/security/ssl/KAKeyDerivation.java
+++ b/src/java.base/share/classes/sun/security/ssl/KAKeyDerivation.java
@@ -49,6 +49,9 @@ import sun.security.util.KeyUtil;
  */
 public class KAKeyDerivation implements SSLKeyDerivation {
 
+    // Algorithm used to derive TLS 1.3 shared secrets
+    private static final String t13KeyDerivationAlgorithm =
+            System.getProperty("jdk.tls.t13KeyDerivationAlgorithm", "Generic");
     private final String algorithmName;
     private final HandshakeContext context;
     private final PrivateKey localPrivateKey;
@@ -234,7 +237,7 @@ public class KAKeyDerivation implements SSLKeyDerivation {
                     var decapsulator = kem.newDecapsulator(localPrivateKey);
                     sharedSecret = decapsulator.decapsulate(
                             keyshare, 0, decapsulator.secretSize(),
-                            "TlsPremasterSecret");
+                            t13KeyDerivationAlgorithm);
                 } catch (IllegalArgumentException | InvalidKeyException |
                         DecapsulateException e) {
                     // Peer validation failure
@@ -252,7 +255,7 @@ public class KAKeyDerivation implements SSLKeyDerivation {
                 KeyAgreement ka = KeyAgreement.getInstance(algorithmName);
                 ka.init(localPrivateKey);
                 ka.doPhase(peerPublicKey, true);
-                sharedSecret = ka.generateSecret("TlsPremasterSecret");
+                sharedSecret = ka.generateSecret(t13KeyDerivationAlgorithm);
             }
 
             return deriveHandshakeSecret(type, sharedSecret);

From 0ada293cb4b1e7ec492d20fb8d99bb3db35974c8 Mon Sep 17 00:00:00 2001
From: Matias Saavedra Silva <matsaave@openjdk.org>
Date: Thu, 2 Apr 2026 14:10:46 +0000
Subject: [PATCH 475/655] 8380091: Tests in runtime/cds are failing with log
 parsing errors - missing output - but the output seems present

Reviewed-by: coleenp, dholmes
---
 .../jtreg/runtime/cds/BootAppendTests.java    | 10 +++++-----
 .../cds/appcds/SpecifySysLoaderProp.java      | 20 +++++++++++--------
 2 files changed, 17 insertions(+), 13 deletions(-)

diff --git a/test/hotspot/jtreg/runtime/cds/BootAppendTests.java b/test/hotspot/jtreg/runtime/cds/BootAppendTests.java
index 43466734fa3..642aa2209f4 100644
--- a/test/hotspot/jtreg/runtime/cds/BootAppendTests.java
+++ b/test/hotspot/jtreg/runtime/cds/BootAppendTests.java
@@ -162,7 +162,7 @@ public class BootAppendTests {
                 .addSuffix("-Xlog:class+load=info",
                            APP_CLASS, BOOT_APPEND_DUPLICATE_MODULE_CLASS_NAME);
 
-            String MATCH_PATTERN = ".class.load. javax.annotation.processing.FilerException source:.*bootAppend.jar*";
+            String MATCH_PATTERN = ".class.load.*javax.annotation.processing.FilerException source:.*bootAppend.jar*";
             CDSTestUtils.run(opts)
                 .assertNormalExit(out -> {
                     out.shouldNotMatch(MATCH_PATTERN);
@@ -188,7 +188,7 @@ public class BootAppendTests {
                            APP_CLASS, BOOT_APPEND_MODULE_CLASS_NAME);
             CDSTestUtils.Result res = CDSTestUtils.run(opts);
             String MATCH_PATTERN =
-                ".class.load. javax.sound.sampled.MyClass source:.*bootAppend.jar*";
+                ".class.load.*javax.sound.sampled.MyClass source:.*bootAppend.jar*";
             if (mode.equals("on")) {
                 res.assertSilentlyDisabledCDS(out -> {
                     out.shouldHaveExitValue(0)
@@ -225,7 +225,7 @@ public class BootAppendTests {
 
             CDSTestUtils.Result res = CDSTestUtils.run(opts);
             String MATCH_PATTERN =
-                ".class.load. javax.annotation.processing.FilerException source:.*bootAppend.jar*";
+                ".class.load.*javax.annotation.processing.FilerException source:.*bootAppend.jar*";
             if (mode.equals("on")) {
                 res.assertSilentlyDisabledCDS(out -> {
                     out.shouldHaveExitValue(0)
@@ -258,7 +258,7 @@ public class BootAppendTests {
 
             CDSTestUtils.Result res = CDSTestUtils.run(opts);
             String MATCH_PATTERN =
-                ".class.load. nonjdk.myPackage.MyClass source:.*bootAppend.jar*";
+                ".class.load.*nonjdk.myPackage.MyClass source:.*bootAppend.jar*";
             if (mode.equals("on")) {
                 res.assertSilentlyDisabledCDS(out -> {
                     out.shouldHaveExitValue(0)
@@ -287,7 +287,7 @@ public class BootAppendTests {
 
             CDSTestUtils.Result res = CDSTestUtils.run(opts);
             String MATCH_PATTERN =
-                ".class.load. nonjdk.myPackage.MyClass source:.*bootAppend.jar*";
+                ".class.load.*nonjdk.myPackage.MyClass source:.*bootAppend.jar*";
             if (mode.equals("on")) {
                 res.assertSilentlyDisabledCDS(out -> {
                     out.shouldHaveExitValue(0)
diff --git a/test/hotspot/jtreg/runtime/cds/appcds/SpecifySysLoaderProp.java b/test/hotspot/jtreg/runtime/cds/appcds/SpecifySysLoaderProp.java
index ed7f02569ef..8548f76d2ec 100644
--- a/test/hotspot/jtreg/runtime/cds/appcds/SpecifySysLoaderProp.java
+++ b/test/hotspot/jtreg/runtime/cds/appcds/SpecifySysLoaderProp.java
@@ -53,8 +53,10 @@ public class SpecifySysLoaderProp {
         "-verbose:class",
         "-cp", appJar,
         "ReportMyLoader")
-      .assertNormalExit("[class,load] ReportMyLoader source: shared objects file",
-                        "ReportMyLoader's loader = jdk.internal.loader.ClassLoaders$AppClassLoader@");
+      .assertNormalExit(output -> {
+        output.shouldMatch(".class,load.*ReportMyLoader source: shared objects file");
+        output.shouldContain("ReportMyLoader's loader = jdk.internal.loader.ClassLoaders$AppClassLoader@");
+      });
 
     // (1) Try to execute the archive with -Djava.system.class.loader=no.such.Klass,
     //     it should fail
@@ -79,8 +81,8 @@ public class SpecifySysLoaderProp {
              "TestClassLoader.called = true", //<-but this proves that TestClassLoader was indeed called.
              "TestClassLoader: loadClass(\"ReportMyLoader\",") //<- this also proves that TestClassLoader was indeed called.
       .assertNormalExit(output -> {
-        output.shouldMatch(".class,load. TestClassLoader source: file:");
-        output.shouldMatch(".class,load. ReportMyLoader source: file:.*" + jarFileName);
+        output.shouldMatch(".class,load.*TestClassLoader source: file:");
+        output.shouldMatch(".class,load.*ReportMyLoader source: file:.*" + jarFileName);
         output.shouldContain("full module graph: disabled due to incompatible property: java.system.class.loader=");
         });
 
@@ -91,9 +93,11 @@ public class SpecifySysLoaderProp {
         "-verbose:class",
         "-cp", appJar,
         "TrySwitchMyLoader")
-      .assertNormalExit("[class,load] ReportMyLoader source: shared objects file",
-             "TrySwitchMyLoader's loader = jdk.internal.loader.ClassLoaders$AppClassLoader@",
-             "ReportMyLoader's loader = jdk.internal.loader.ClassLoaders$AppClassLoader@",
-             "TestClassLoader.called = false");
+      .assertNormalExit(output -> {
+        output.shouldMatch(".class,load.*ReportMyLoader source: shared objects file");
+        output.shouldContain("TrySwitchMyLoader's loader = jdk.internal.loader.ClassLoaders$AppClassLoader@");
+        output.shouldContain("ReportMyLoader's loader = jdk.internal.loader.ClassLoaders$AppClassLoader@");
+        output.shouldContain("TestClassLoader.called = false");
+      });
   }
 }

From 5e89669d180a4ac969f13cf6c066efbdb9998dc5 Mon Sep 17 00:00:00 2001
From: Mahendra Chhipa <mchhipa@openjdk.org>
Date: Thu, 2 Apr 2026 19:59:21 +0000
Subject: [PATCH 476/655] 8381568: Refactor
 java/net/spi/InetAddressResolverProvider test from testNg to use JUnit

Reviewed-by: dfuchs
---
 .../AddressesCachingTest.java                 | 37 +++++++------
 .../AddressesStaleCachingTest.java            | 24 +++++----
 .../BootstrapResolverUsageTest.java           | 12 ++---
 .../BuiltInResolverTest.java                  | 22 ++++----
 .../EmptyResultsStreamTest.java               | 28 +++++-----
 .../InetAddressUsageInGetProviderTest.java    |  7 ++-
 .../LookupPolicyMappingTest.java              | 53 ++++++++++---------
 .../LookupPolicyOfTest.java                   | 25 ++++-----
 .../ProviderGetExceptionTest.java             | 20 +++----
 .../ResolutionWithExceptionTest.java          | 18 ++++---
 .../ReverseLookupDelegationTest.java          | 14 ++---
 .../classpath/ClasspathProviderTest.java      |  9 ++--
 .../module/ModularProviderTest.java           |  7 +--
 13 files changed, 148 insertions(+), 128 deletions(-)

diff --git a/test/jdk/java/net/spi/InetAddressResolverProvider/AddressesCachingTest.java b/test/jdk/java/net/spi/InetAddressResolverProvider/AddressesCachingTest.java
index 26dabc00063..f4fa2016983 100644
--- a/test/jdk/java/net/spi/InetAddressResolverProvider/AddressesCachingTest.java
+++ b/test/jdk/java/net/spi/InetAddressResolverProvider/AddressesCachingTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2021, 2023, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2021, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -24,10 +24,13 @@
 import java.net.InetAddress;
 import java.net.UnknownHostException;
 
-import org.testng.Assert;
-import org.testng.annotations.Test;
 
 import impl.SimpleResolverProviderImpl;
+import org.junit.jupiter.api.Test;
+
+import static org.junit.jupiter.api.Assertions.assertFalse;
+import static org.junit.jupiter.api.Assertions.assertTrue;
+import static org.junit.jupiter.api.Assertions.fail;
 
 
 /*
@@ -37,26 +40,26 @@ import impl.SimpleResolverProviderImpl;
  * @library lib providers/simple
  * @build test.library/testlib.ResolutionRegistry
  *  simple.provider/impl.SimpleResolverProviderImpl AddressesCachingTest
- * @run testng/othervm -Djava.security.properties=${test.src}/props/NeverCache.props
+ * @run junit/othervm -Djava.security.properties=${test.src}/props/NeverCache.props
  *  -Dtest.cachingDisabled=true AddressesCachingTest
- * @run testng/othervm -Djava.security.properties=${test.src}/props/ForeverCache.props
+ * @run junit/othervm -Djava.security.properties=${test.src}/props/ForeverCache.props
  *  -Dtest.cachingDisabled=false AddressesCachingTest
- * @run testng/othervm
+ * @run junit/othervm
  *  -Djava.security.properties=${test.src}/props/NeverCacheIgnoreMinusStale.props
  *  -Dtest.cachingDisabled=true AddressesCachingTest
- * @run testng/othervm
+ * @run junit/othervm
  *  -Djava.security.properties=${test.src}/props/NeverCacheIgnorePositiveStale.props
  *  -Dtest.cachingDisabled=true AddressesCachingTest
- * @run testng/othervm
+ * @run junit/othervm
  *  -Djava.security.properties=${test.src}/props/NeverCacheIgnoreZeroStale.props
  *  -Dtest.cachingDisabled=true AddressesCachingTest
- * @run testng/othervm
+ * @run junit/othervm
  *  -Djava.security.properties=${test.src}/props/ForeverCacheIgnoreMinusStale.props
  *  -Dtest.cachingDisabled=false AddressesCachingTest
- * @run testng/othervm
+ * @run junit/othervm
  *  -Djava.security.properties=${test.src}/props/ForeverCacheIgnorePositiveStale.props
  *  -Dtest.cachingDisabled=false AddressesCachingTest
- * @run testng/othervm
+ * @run junit/othervm
  *  -Djava.security.properties=${test.src}/props/ForeverCacheIgnoreZeroStale.props
  *  -Dtest.cachingDisabled=false AddressesCachingTest
  */
@@ -66,10 +69,10 @@ public class AddressesCachingTest {
     public void testPositiveCaching() {
         boolean observedTwoLookups = performLookups(false);
         if (CACHING_DISABLED) {
-            Assert.assertTrue(observedTwoLookups,
+            assertTrue(observedTwoLookups,
                     "Two positive lookups are expected with caching disabled");
         } else {
-            Assert.assertFalse(observedTwoLookups,
+            assertFalse(observedTwoLookups,
                     "Only one positive lookup is expected with caching enabled");
         }
     }
@@ -78,10 +81,10 @@ public class AddressesCachingTest {
     public void testNegativeCaching() {
         boolean observedTwoLookups = performLookups(true);
         if (CACHING_DISABLED) {
-            Assert.assertTrue(observedTwoLookups,
+            assertTrue(observedTwoLookups,
                     "Two negative lookups are expected with caching disabled");
         } else {
-            Assert.assertFalse(observedTwoLookups,
+            assertFalse(observedTwoLookups,
                     "Only one negative lookup is expected with caching enabled");
         }
     }
@@ -107,11 +110,11 @@ public class AddressesCachingTest {
         try {
             InetAddress.getByName(hostName);
             if (performNegativeLookup) {
-                Assert.fail("Host name is expected to get unresolved");
+                fail("Host name is expected to get unresolved");
             }
         } catch (UnknownHostException uhe) {
             if (!performNegativeLookup) {
-                Assert.fail("Host name is expected to get resolved");
+                fail("Host name is expected to get resolved");
             }
         }
     }
diff --git a/test/jdk/java/net/spi/InetAddressResolverProvider/AddressesStaleCachingTest.java b/test/jdk/java/net/spi/InetAddressResolverProvider/AddressesStaleCachingTest.java
index a8393221a72..a2c5c3e8443 100644
--- a/test/jdk/java/net/spi/InetAddressResolverProvider/AddressesStaleCachingTest.java
+++ b/test/jdk/java/net/spi/InetAddressResolverProvider/AddressesStaleCachingTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2023, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2023, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -27,8 +27,11 @@ import java.util.concurrent.CountDownLatch;
 import java.util.concurrent.TimeUnit;
 
 import impl.SimpleResolverProviderImpl;
-import org.testng.Assert;
-import org.testng.annotations.Test;
+import org.junit.jupiter.api.Test;
+
+import static org.junit.jupiter.api.Assertions.assertArrayEquals;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertNotEquals;
 
 
 /*
@@ -38,7 +41,7 @@ import org.testng.annotations.Test;
  * @library lib providers/simple
  * @build test.library/testlib.ResolutionRegistry
  *  simple.provider/impl.SimpleResolverProviderImpl AddressesStaleCachingTest
- * @run testng/othervm -Djava.security.properties=${test.src}/props/CacheStale.props AddressesStaleCachingTest
+ * @run junit/othervm -Djava.security.properties=${test.src}/props/CacheStale.props AddressesStaleCachingTest
  */
 public class AddressesStaleCachingTest {
 
@@ -64,20 +67,21 @@ public class AddressesStaleCachingTest {
         Thread.sleep(10000); // intentionally big delay > x2 stale property
         // The refreshTime is expired, we will do the successful lookup.
         Lookup second = doLookup(false, 0);
-        Assert.assertNotEquals(first.timestamp, second.timestamp,
+        assertNotEquals(first.timestamp, second.timestamp,
                                "Two lookups are expected");
 
         Thread.sleep(10000); // intentionally big delay > x2 stale property
         // The refreshTime is expired again, we will do the failed lookup.
         Lookup third = doLookup(true, 0);
-        Assert.assertNotEquals(second.timestamp, third.timestamp,
+        assertNotEquals(second.timestamp, third.timestamp,
                                "Two lookups are expected");
 
         // The stale cache is enabled, so we should get valid/same data for
         // all requests(even for the failed request).
-        Assert.assertEquals(first.address, second.address,
+        assertArrayEquals(first.address, second.address,
                             "Same address is expected");
-        Assert.assertEquals(second.address, third.address,
+
+        assertArrayEquals(second.address, third.address,
                             "Same address is expected");
     }
 
@@ -133,10 +137,10 @@ public class AddressesStaleCachingTest {
             byte[] secondAddress = InetAddress.getByName("javaTest.org").getAddress();
             long secondTimestamp = SimpleResolverProviderImpl.getLastLookupTimestamp();
 
-            Assert.assertEquals(firstAddress, secondAddress,
+            assertArrayEquals(firstAddress, secondAddress,
                                 "Same address is expected");
             if (timeout == 0 || timeout - System.nanoTime() > 0) {
-                Assert.assertEquals(firstTimestamp, secondTimestamp,
+                assertEquals(firstTimestamp, secondTimestamp,
                         "Only one positive lookup is expected with caching enabled");
             }
             return new Lookup(firstAddress, firstTimestamp);
diff --git a/test/jdk/java/net/spi/InetAddressResolverProvider/BootstrapResolverUsageTest.java b/test/jdk/java/net/spi/InetAddressResolverProvider/BootstrapResolverUsageTest.java
index 9f0902d2c1d..012410c1566 100644
--- a/test/jdk/java/net/spi/InetAddressResolverProvider/BootstrapResolverUsageTest.java
+++ b/test/jdk/java/net/spi/InetAddressResolverProvider/BootstrapResolverUsageTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2021, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -21,12 +21,13 @@
  * questions.
  */
 
+import org.junit.jupiter.api.Test;
+
 import java.net.InetAddress;
 
-import org.testng.Assert;
-import org.testng.annotations.Test;
 
 import static impl.WithBootstrapResolverUsageProvider.numberOfGetCalls;
+import static org.junit.jupiter.api.Assertions.assertEquals;
 
 /**
  * @test
@@ -35,7 +36,7 @@ import static impl.WithBootstrapResolverUsageProvider.numberOfGetCalls;
  * InetAddressResolverProvider.get method uses InetAddress lookup API.
  * @library providers/bootstrapUsage
  * @build bootstrap.usage.provider/impl.WithBootstrapResolverUsageProvider
- * @run testng/othervm BootstrapResolverUsageTest
+ * @run junit/othervm BootstrapResolverUsageTest
  */
 
 public class BootstrapResolverUsageTest {
@@ -43,7 +44,6 @@ public class BootstrapResolverUsageTest {
     @Test
     public void testSuccessfulProviderInstantiationTest() throws Exception {
         System.err.println(InetAddress.getAllByName(InetAddress.getLocalHost().getHostName()));
-        Assert.assertEquals(numberOfGetCalls, 1,
-                "InetAddressResolverProvider.get was called more than once");
+        assertEquals(1, numberOfGetCalls, "InetAddressResolverProvider.get was called more than once");
     }
 }
diff --git a/test/jdk/java/net/spi/InetAddressResolverProvider/BuiltInResolverTest.java b/test/jdk/java/net/spi/InetAddressResolverProvider/BuiltInResolverTest.java
index 8b8b866d7b2..e91446e540a 100644
--- a/test/jdk/java/net/spi/InetAddressResolverProvider/BuiltInResolverTest.java
+++ b/test/jdk/java/net/spi/InetAddressResolverProvider/BuiltInResolverTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2021, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -21,30 +21,34 @@
  * questions.
  */
 
-import org.testng.annotations.BeforeTest;
-import org.testng.annotations.Test;
+
+import org.junit.jupiter.api.BeforeAll;
+import org.junit.jupiter.api.Test;
 
 import java.lang.reflect.Field;
 import java.net.InetAddress;
 import java.net.UnknownHostException;
 import java.net.spi.InetAddressResolver;
 
-import static org.testng.Assert.*;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertNotNull;
+import static org.junit.jupiter.api.Assertions.assertTrue;
+
 
 /*
  * @test
  * @summary white-box test to check that the built-in resolver
  *  is used by default.
  * @modules java.base/java.net:open
- * @run testng/othervm BuiltInResolverTest
+ * @run junit/othervm BuiltInResolverTest
  */
 
 public class BuiltInResolverTest {
 
-    private Field builtInResolverField, resolverField;
+    private static Field builtInResolverField, resolverField;
 
-    @BeforeTest
-    public void beforeTest() throws NoSuchFieldException {
+    @BeforeAll
+    public static void beforeTest() throws NoSuchFieldException {
         Class<InetAddress> inetAddressClass = InetAddress.class;
         // Needs to happen for InetAddress.resolver to be initialized
         try {
@@ -72,7 +76,7 @@ public class BuiltInResolverTest {
         assertNotNull(defaultClassName, "defaultClassName not set");
         assertNotNull(currentClassName, "currentClassName name not set");
 
-        assertEquals(currentClassName, defaultClassName,
+        assertEquals(defaultClassName, currentClassName,
                 "BUILTIN_RESOLVER resolver was not used.");
         System.err.println("Resolver used by default is the built-in resolver");
     }
diff --git a/test/jdk/java/net/spi/InetAddressResolverProvider/EmptyResultsStreamTest.java b/test/jdk/java/net/spi/InetAddressResolverProvider/EmptyResultsStreamTest.java
index 17b9aa5d011..db0f293b712 100644
--- a/test/jdk/java/net/spi/InetAddressResolverProvider/EmptyResultsStreamTest.java
+++ b/test/jdk/java/net/spi/InetAddressResolverProvider/EmptyResultsStreamTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2021, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -21,32 +21,36 @@
  * questions.
  */
 
-import org.testng.Assert;
-import org.testng.annotations.Test;
+import org.junit.jupiter.api.Test;
 
 import java.net.InetAddress;
 import java.net.UnknownHostException;
 import java.util.Arrays;
 
+import static org.junit.jupiter.api.Assertions.assertThrows;
 /*
  * @test
  * @summary checks that InetAddress forward lookup API throw UnknownHostException
  *   when resolver returns empty address stream.
  * @library providers/empty
  * @build empty.results.provider/impl.EmptyResultsProviderImpl
- * @run testng/othervm EmptyResultsStreamTest
+ * @run junit/othervm EmptyResultsStreamTest
  */
 public class EmptyResultsStreamTest {
 
-    @Test(expectedExceptions = UnknownHostException.class)
-    public void getAllByNameTest() throws UnknownHostException {
-        System.err.println("getAllByName unexpectedly completed: " +
-                Arrays.deepToString(InetAddress.getAllByName("test1.org")));
+    @Test()
+    public void getAllByNameTest() {
+        assertThrows(UnknownHostException.class, () -> {
+            System.err.println("getAllByName unexpectedly completed: " +
+                    Arrays.deepToString(InetAddress.getAllByName("test1.org")));
+        });
     }
 
-    @Test(expectedExceptions = UnknownHostException.class)
-    public void getByNameTest() throws UnknownHostException {
-        System.err.println("getByName unexpectedly completed: " +
-                InetAddress.getByName("test2.org"));
+    @Test()
+    public void getByNameTest() {
+        assertThrows(UnknownHostException.class, () -> {
+            System.err.println("getByName unexpectedly completed: " +
+                    InetAddress.getByName("test2.org"));
+        });
     }
 }
diff --git a/test/jdk/java/net/spi/InetAddressResolverProvider/InetAddressUsageInGetProviderTest.java b/test/jdk/java/net/spi/InetAddressResolverProvider/InetAddressUsageInGetProviderTest.java
index dd52893c1e8..3458270960b 100644
--- a/test/jdk/java/net/spi/InetAddressResolverProvider/InetAddressUsageInGetProviderTest.java
+++ b/test/jdk/java/net/spi/InetAddressResolverProvider/InetAddressUsageInGetProviderTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2021, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -21,8 +21,7 @@
  * questions.
  */
 
-import org.testng.Assert;
-import org.testng.annotations.Test;
+import org.junit.jupiter.api.Test;
 
 import java.net.InetAddress;
 
@@ -32,7 +31,7 @@ import java.net.InetAddress;
  * wouldn't cause stack overflow and will be successfully installed.
  * @library providers/recursive
  * @build recursive.init.provider/impl.InetAddressUsageInGetProviderImpl
- * @run testng/othervm InetAddressUsageInGetProviderTest
+ * @run junit/othervm InetAddressUsageInGetProviderTest
  */
 
 public class InetAddressUsageInGetProviderTest {
diff --git a/test/jdk/java/net/spi/InetAddressResolverProvider/LookupPolicyMappingTest.java b/test/jdk/java/net/spi/InetAddressResolverProvider/LookupPolicyMappingTest.java
index e845e2e0461..bbfa9f5555c 100644
--- a/test/jdk/java/net/spi/InetAddressResolverProvider/LookupPolicyMappingTest.java
+++ b/test/jdk/java/net/spi/InetAddressResolverProvider/LookupPolicyMappingTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2021, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -34,9 +34,10 @@ import static java.net.spi.InetAddressResolver.LookupPolicy.IPV6_FIRST;
 
 import jdk.test.lib.net.IPSupport;
 import jdk.test.lib.NetworkConfiguration;
-import org.testng.annotations.Test;
-import org.testng.Assert;
-import org.testng.SkipException;
+import org.junit.jupiter.api.Test;
+
+import static org.junit.jupiter.api.Assertions.assertTrue;
+import static org.junit.jupiter.api.Assumptions.abort;
 
 /*
  * @test
@@ -45,26 +46,26 @@ import org.testng.SkipException;
  * @library lib providers/simple /test/lib
  * @build test.library/testlib.ResolutionRegistry simple.provider/impl.SimpleResolverProviderImpl
  *        jdk.test.lib.net.IPSupport LookupPolicyMappingTest
- * @run testng/othervm LookupPolicyMappingTest
- * @run testng/othervm -Djava.net.preferIPv4Stack=true -Djava.net.preferIPv6Addresses=true LookupPolicyMappingTest
- * @run testng/othervm -Djava.net.preferIPv4Stack=true -Djava.net.preferIPv6Addresses=false LookupPolicyMappingTest
- * @run testng/othervm -Djava.net.preferIPv4Stack=true -Djava.net.preferIPv6Addresses=system LookupPolicyMappingTest
- * @run testng/othervm -Djava.net.preferIPv4Stack=true -Djava.net.preferIPv6Addresses LookupPolicyMappingTest
- * @run testng/othervm -Djava.net.preferIPv4Stack=true LookupPolicyMappingTest
- * @run testng/othervm -Djava.net.preferIPv4Stack=false -Djava.net.preferIPv6Addresses=true LookupPolicyMappingTest
- * @run testng/othervm -Djava.net.preferIPv4Stack=false -Djava.net.preferIPv6Addresses=false LookupPolicyMappingTest
- * @run testng/othervm -Djava.net.preferIPv4Stack=false -Djava.net.preferIPv6Addresses=system LookupPolicyMappingTest
- * @run testng/othervm -Djava.net.preferIPv4Stack=false -Djava.net.preferIPv6Addresses LookupPolicyMappingTest
- * @run testng/othervm -Djava.net.preferIPv4Stack=false LookupPolicyMappingTest
- * @run testng/othervm -Djava.net.preferIPv4Stack -Djava.net.preferIPv6Addresses=true LookupPolicyMappingTest
- * @run testng/othervm -Djava.net.preferIPv4Stack -Djava.net.preferIPv6Addresses=false LookupPolicyMappingTest
- * @run testng/othervm -Djava.net.preferIPv4Stack -Djava.net.preferIPv6Addresses=system LookupPolicyMappingTest
- * @run testng/othervm -Djava.net.preferIPv4Stack -Djava.net.preferIPv6Addresses LookupPolicyMappingTest
- * @run testng/othervm -Djava.net.preferIPv4Stack LookupPolicyMappingTest
- * @run testng/othervm -Djava.net.preferIPv6Addresses=true LookupPolicyMappingTest
- * @run testng/othervm -Djava.net.preferIPv6Addresses=false LookupPolicyMappingTest
- * @run testng/othervm -Djava.net.preferIPv6Addresses=system LookupPolicyMappingTest
- * @run testng/othervm -Djava.net.preferIPv6Addresses LookupPolicyMappingTest
+ * @run junit/othervm LookupPolicyMappingTest
+ * @run junit/othervm -Djava.net.preferIPv4Stack=true -Djava.net.preferIPv6Addresses=true LookupPolicyMappingTest
+ * @run junit/othervm -Djava.net.preferIPv4Stack=true -Djava.net.preferIPv6Addresses=false LookupPolicyMappingTest
+ * @run junit/othervm -Djava.net.preferIPv4Stack=true -Djava.net.preferIPv6Addresses=system LookupPolicyMappingTest
+ * @run junit/othervm -Djava.net.preferIPv4Stack=true -Djava.net.preferIPv6Addresses LookupPolicyMappingTest
+ * @run junit/othervm -Djava.net.preferIPv4Stack=true LookupPolicyMappingTest
+ * @run junit/othervm -Djava.net.preferIPv4Stack=false -Djava.net.preferIPv6Addresses=true LookupPolicyMappingTest
+ * @run junit/othervm -Djava.net.preferIPv4Stack=false -Djava.net.preferIPv6Addresses=false LookupPolicyMappingTest
+ * @run junit/othervm -Djava.net.preferIPv4Stack=false -Djava.net.preferIPv6Addresses=system LookupPolicyMappingTest
+ * @run junit/othervm -Djava.net.preferIPv4Stack=false -Djava.net.preferIPv6Addresses LookupPolicyMappingTest
+ * @run junit/othervm -Djava.net.preferIPv4Stack=false LookupPolicyMappingTest
+ * @run junit/othervm -Djava.net.preferIPv4Stack -Djava.net.preferIPv6Addresses=true LookupPolicyMappingTest
+ * @run junit/othervm -Djava.net.preferIPv4Stack -Djava.net.preferIPv6Addresses=false LookupPolicyMappingTest
+ * @run junit/othervm -Djava.net.preferIPv4Stack -Djava.net.preferIPv6Addresses=system LookupPolicyMappingTest
+ * @run junit/othervm -Djava.net.preferIPv4Stack -Djava.net.preferIPv6Addresses LookupPolicyMappingTest
+ * @run junit/othervm -Djava.net.preferIPv4Stack LookupPolicyMappingTest
+ * @run junit/othervm -Djava.net.preferIPv6Addresses=true LookupPolicyMappingTest
+ * @run junit/othervm -Djava.net.preferIPv6Addresses=false LookupPolicyMappingTest
+ * @run junit/othervm -Djava.net.preferIPv6Addresses=system LookupPolicyMappingTest
+ * @run junit/othervm -Djava.net.preferIPv6Addresses LookupPolicyMappingTest
  */
 
 public class LookupPolicyMappingTest {
@@ -88,7 +89,7 @@ public class LookupPolicyMappingTest {
         String expectedResultsKey = calculateMapKey(preferIPv4Stack, preferIPv6Addresses);
         int expectedCharacteristics = EXPECTED_RESULTS_MAP.get(expectedResultsKey);
 
-        Assert.assertTrue(characteristicsMatch(
+        assertTrue(characteristicsMatch(
                 runtimeCharacteristics, expectedCharacteristics), "Unexpected LookupPolicy observed");
     }
 
@@ -100,7 +101,7 @@ public class LookupPolicyMappingTest {
         // If preferIPv4=true and no IPv4 - skip
         if (IPSupport.preferIPv4Stack()) {
             if (!IPSupport.hasIPv4()) {
-                throw new SkipException("Skip tests - IPv4 support required");
+                abort("Skip tests - IPv4 support required");
             }
             return;
         }
diff --git a/test/jdk/java/net/spi/InetAddressResolverProvider/LookupPolicyOfTest.java b/test/jdk/java/net/spi/InetAddressResolverProvider/LookupPolicyOfTest.java
index 73e2581f5cd..09585322c83 100644
--- a/test/jdk/java/net/spi/InetAddressResolverProvider/LookupPolicyOfTest.java
+++ b/test/jdk/java/net/spi/InetAddressResolverProvider/LookupPolicyOfTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2021, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,11 +25,11 @@
  * @test
  * @summary check if LookupPolicy.of correctly handles valid and illegal
  * combinations of characteristics bit mask flags.
- * @run testng LookupPolicyOfTest
+ * @run junit LookupPolicyOfTest
  */
 
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
 
 import java.net.spi.InetAddressResolver.LookupPolicy;
 import java.util.List;
@@ -38,21 +38,23 @@ import static java.net.spi.InetAddressResolver.LookupPolicy.IPV4;
 import static java.net.spi.InetAddressResolver.LookupPolicy.IPV4_FIRST;
 import static java.net.spi.InetAddressResolver.LookupPolicy.IPV6;
 import static java.net.spi.InetAddressResolver.LookupPolicy.IPV6_FIRST;
+import static org.junit.jupiter.api.Assertions.assertThrows;
 
 public class LookupPolicyOfTest {
 
-    @Test(dataProvider = "validCharacteristics")
+    @ParameterizedTest
+    @MethodSource("validCharacteristicValue")
     public void testValidCharacteristicCombinations(List<Integer> validCombination) {
         LookupPolicy.of(bitFlagsToCharacteristicsValue(validCombination));
     }
 
-    @Test(dataProvider = "invalidCharacteristics", expectedExceptions = IllegalArgumentException.class)
-    public void testInvalidCharacteristicCombinations(List<Integer> invalidCombination) {
-        LookupPolicy.of(bitFlagsToCharacteristicsValue(invalidCombination));
+    @ParameterizedTest
+    @MethodSource("illegalCharacteristicValue")
+    public void testInvalidCharacteristicCombination(List<Integer> invalidCombination) {
+        assertThrows(IllegalArgumentException.class, () -> LookupPolicy.of(bitFlagsToCharacteristicsValue(invalidCombination)));
     }
 
-    @DataProvider(name = "validCharacteristics")
-    public Object[][] validCharacteristicValue() {
+    public static Object[][] validCharacteristicValue() {
         return new Object[][]{
                 {List.of(IPV4)},
                 {List.of(IPV4, IPV4_FIRST)},
@@ -68,8 +70,7 @@ public class LookupPolicyOfTest {
         };
     }
 
-    @DataProvider(name = "invalidCharacteristics")
-    public Object[][] illegalCharacteristicValue() {
+    public static Object[][] illegalCharacteristicValue() {
         return new Object[][]{
                 {List.of()},
                 {List.of(IPV4_FIRST)},
diff --git a/test/jdk/java/net/spi/InetAddressResolverProvider/ProviderGetExceptionTest.java b/test/jdk/java/net/spi/InetAddressResolverProvider/ProviderGetExceptionTest.java
index fe5269c7b46..7df304bc235 100644
--- a/test/jdk/java/net/spi/InetAddressResolverProvider/ProviderGetExceptionTest.java
+++ b/test/jdk/java/net/spi/InetAddressResolverProvider/ProviderGetExceptionTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2021, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -21,13 +21,15 @@
  * questions.
  */
 
+import org.junit.jupiter.api.Test;
+import org.junit.jupiter.api.function.Executable;
 import java.net.InetAddress;
 import java.util.Arrays;
 
-import org.testng.Assert;
-import org.testng.annotations.Test;
-
 import static impl.FaultyResolverProviderGetImpl.EXCEPTION_MESSAGE;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertNull;
+import static org.junit.jupiter.api.Assertions.assertThrows;
 
 /*
  * @test
@@ -35,7 +37,7 @@ import static impl.FaultyResolverProviderGetImpl.EXCEPTION_MESSAGE;
  *  instantiate a resolver.
  * @library providers/faulty
  * @build faulty.provider/impl.FaultyResolverProviderGetImpl
- * @run testng/othervm ProviderGetExceptionTest
+ * @run junit/othervm ProviderGetExceptionTest
  */
 
 public class ProviderGetExceptionTest {
@@ -54,10 +56,10 @@ public class ProviderGetExceptionTest {
         callInetAddressAndCheckException(() -> InetAddress.getByAddress(address).getHostName());
     }
 
-    private void callInetAddressAndCheckException(Assert.ThrowingRunnable apiCall) {
-        IllegalArgumentException iae = Assert.expectThrows(IllegalArgumentException.class, apiCall);
+    private void callInetAddressAndCheckException(Executable apiCall) {
+        IllegalArgumentException iae = assertThrows(IllegalArgumentException.class, apiCall);
         System.out.println("Got exception of expected type:" + iae);
-        Assert.assertNull(iae.getCause(), "cause is not null");
-        Assert.assertEquals(iae.getMessage(), EXCEPTION_MESSAGE);
+        assertNull(iae.getCause(), "cause is not null");
+        assertEquals(EXCEPTION_MESSAGE, iae.getMessage());
     }
 }
diff --git a/test/jdk/java/net/spi/InetAddressResolverProvider/ResolutionWithExceptionTest.java b/test/jdk/java/net/spi/InetAddressResolverProvider/ResolutionWithExceptionTest.java
index dd17c1d987c..ce68f8a8e6f 100644
--- a/test/jdk/java/net/spi/InetAddressResolverProvider/ResolutionWithExceptionTest.java
+++ b/test/jdk/java/net/spi/InetAddressResolverProvider/ResolutionWithExceptionTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2021, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -27,9 +27,11 @@ import java.net.UnknownHostException;
 import impl.ThrowingLookupsProviderImpl;
 
 import static impl.ThrowingLookupsProviderImpl.RUNTIME_EXCEPTION_MESSAGE;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.fail;
 
-import org.testng.Assert;
-import org.testng.annotations.Test;
+import org.junit.jupiter.api.Assertions;
+import org.junit.jupiter.api.Test;
 
 /*
  * @test
@@ -37,7 +39,7 @@ import org.testng.annotations.Test;
  * implementation throws RuntimeException during forward or reverse lookup.
  * @library providers/throwing
  * @build throwing.lookups.provider/impl.ThrowingLookupsProviderImpl
- * @run testng/othervm ResolutionWithExceptionTest
+ * @run junit/othervm ResolutionWithExceptionTest
  */
 
 public class ResolutionWithExceptionTest {
@@ -68,7 +70,7 @@ public class ResolutionWithExceptionTest {
 
     private void runGetByNameTest() {
         // InetAddress.getByName() is expected to throw UnknownHostException in all cases
-        UnknownHostException uhe = Assert.expectThrows(UnknownHostException.class,
+        UnknownHostException uhe = Assertions.assertThrows(UnknownHostException.class,
                 () -> InetAddress.getByName("doesnt.matter.com"));
         // If provider is expected to throw RuntimeException - check that UnknownHostException
         // is set as its cause
@@ -76,10 +78,10 @@ public class ResolutionWithExceptionTest {
             Throwable cause = uhe.getCause();
             if (cause instanceof RuntimeException re) {
                 // Check RuntimeException message
-                Assert.assertEquals(re.getMessage(), RUNTIME_EXCEPTION_MESSAGE,
+                assertEquals(RUNTIME_EXCEPTION_MESSAGE, re.getMessage(),
                         "incorrect exception message");
             } else {
-                Assert.fail("UnknownHostException cause is not RuntimeException");
+                fail("UnknownHostException cause is not RuntimeException");
             }
         }
     }
@@ -89,6 +91,6 @@ public class ResolutionWithExceptionTest {
         // if there is an error during reverse lookup operation the literal IP
         // address String will be returned.
         String literalIP = InetAddress.getByAddress(new byte[]{1, 2, 3, 4}).getCanonicalHostName();
-        Assert.assertEquals(literalIP, "1.2.3.4");
+        assertEquals("1.2.3.4", literalIP);
     }
 }
diff --git a/test/jdk/java/net/spi/InetAddressResolverProvider/ReverseLookupDelegationTest.java b/test/jdk/java/net/spi/InetAddressResolverProvider/ReverseLookupDelegationTest.java
index 439521736db..d72a6b1fc0e 100644
--- a/test/jdk/java/net/spi/InetAddressResolverProvider/ReverseLookupDelegationTest.java
+++ b/test/jdk/java/net/spi/InetAddressResolverProvider/ReverseLookupDelegationTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2021, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -21,9 +21,9 @@
  * questions.
  */
 
-import impl.DelegatingProviderImpl;
-import org.testng.Assert;
-import org.testng.annotations.Test;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertTrue;
+import org.junit.jupiter.api.Test;
 
 import java.net.InetAddress;
 import java.net.UnknownHostException;
@@ -37,7 +37,7 @@ import static impl.DelegatingProviderImpl.lastReverseLookupThrowable;
  *  InetAddressResolver.
  * @library providers/delegating
  * @build delegating.provider/impl.DelegatingProviderImpl
- * @run testng/othervm ReverseLookupDelegationTest
+ * @run junit/othervm ReverseLookupDelegationTest
  */
 public class ReverseLookupDelegationTest {
 
@@ -53,10 +53,10 @@ public class ReverseLookupDelegationTest {
 
         // Check that originally supplied byte array was used to construct canonical host name after
         // failed reverse lookup.
-        Assert.assertEquals("1.2.3.4", canonicalHostName, "unexpected canonical hostname");
+        assertEquals("1.2.3.4", canonicalHostName, "unexpected canonical hostname");
 
         // Check that on a provider side the IllegalArgumentException has been thrown by the built-in resolver
-        Assert.assertTrue(lastReverseLookupThrowable instanceof IllegalArgumentException,
+        assertTrue(lastReverseLookupThrowable instanceof IllegalArgumentException,
                 "wrong exception type is thrown by the built-in resolver");
     }
 }
diff --git a/test/jdk/java/net/spi/InetAddressResolverProvider/serviceProviderOriginType/classpath/ClasspathProviderTest.java b/test/jdk/java/net/spi/InetAddressResolverProvider/serviceProviderOriginType/classpath/ClasspathProviderTest.java
index 51285fb045c..c82f2442831 100644
--- a/test/jdk/java/net/spi/InetAddressResolverProvider/serviceProviderOriginType/classpath/ClasspathProviderTest.java
+++ b/test/jdk/java/net/spi/InetAddressResolverProvider/serviceProviderOriginType/classpath/ClasspathProviderTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2021, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -21,18 +21,17 @@
  * questions.
  */
 
+import org.junit.jupiter.api.Test;
+
 import java.net.InetAddress;
 
-import org.testng.annotations.Test;
-
-import static org.testng.Assert.assertThrows;
 
 /*
  * @test
  * @summary Test that InetAddressResolverProvider implementation can be installed to a class path.
  * @library ../../lib
  * @build test.library/testlib.ResolutionRegistry ClasspathResolverProviderImpl
- * @run testng/othervm ClasspathProviderTest
+ * @run junit/othervm ClasspathProviderTest
  */
 
 public class ClasspathProviderTest {
diff --git a/test/jdk/java/net/spi/InetAddressResolverProvider/serviceProviderOriginType/module/ModularProviderTest.java b/test/jdk/java/net/spi/InetAddressResolverProvider/serviceProviderOriginType/module/ModularProviderTest.java
index 410f25aa9c3..56e52d52729 100644
--- a/test/jdk/java/net/spi/InetAddressResolverProvider/serviceProviderOriginType/module/ModularProviderTest.java
+++ b/test/jdk/java/net/spi/InetAddressResolverProvider/serviceProviderOriginType/module/ModularProviderTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2021, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -21,9 +21,10 @@
  * questions.
  */
 
+import org.junit.jupiter.api.Test;
+
 import java.net.InetAddress;
 
-import org.testng.annotations.Test;
 
 /*
  * @test
@@ -31,7 +32,7 @@ import org.testng.annotations.Test;
  * @library ../../lib ../../providers/simple
  * @build test.library/testlib.ResolutionRegistry simple.provider/impl.SimpleResolverProviderImpl
  *        ModularProviderTest
- * @run testng/othervm ModularProviderTest
+ * @run junit/othervm ModularProviderTest
  */
 
 

From e05eb1418e73b69c9c4571006a009bb1d3cf21ce Mon Sep 17 00:00:00 2001
From: Vicente Romero <vromero@openjdk.org>
Date: Thu, 2 Apr 2026 22:57:35 +0000
Subject: [PATCH 477/655] 8381475: Test
 tools/sincechecker/modules/jdk.compiler/JdkCompilerCheckSince.java fails for
 DocSourcePositions.java

Reviewed-by: mikael
---
 .../share/classes/com/sun/source/util/DocSourcePositions.java   | 2 ++
 .../share/classes/com/sun/source/util/SourcePositions.java      | 2 ++
 .../modules/jdk.compiler/JdkCompilerCheckSince.java             | 2 +-
 3 files changed, 5 insertions(+), 1 deletion(-)

diff --git a/src/jdk.compiler/share/classes/com/sun/source/util/DocSourcePositions.java b/src/jdk.compiler/share/classes/com/sun/source/util/DocSourcePositions.java
index d0afd126bf6..4eb6d12fd38 100644
--- a/src/jdk.compiler/share/classes/com/sun/source/util/DocSourcePositions.java
+++ b/src/jdk.compiler/share/classes/com/sun/source/util/DocSourcePositions.java
@@ -83,6 +83,7 @@ public interface DocSourcePositions extends SourcePositions {
      * @param comment the comment tree that encloses the tree for which the
      *                position is being sought
      * @param tree tree for which a position is sought
+     * @since 27
      */
     long getStartPosition(DocCommentTree comment, DocTree tree);
 
@@ -146,6 +147,7 @@ public interface DocSourcePositions extends SourcePositions {
      * @param comment the comment tree that encloses the tree for which the
      *                position is being sought
      * @param tree tree for which a position is sought
+     * @since 27
      */
     long getEndPosition(DocCommentTree comment, DocTree tree);
 
diff --git a/src/jdk.compiler/share/classes/com/sun/source/util/SourcePositions.java b/src/jdk.compiler/share/classes/com/sun/source/util/SourcePositions.java
index 460f4f2a1ce..3ff6fafe58b 100644
--- a/src/jdk.compiler/share/classes/com/sun/source/util/SourcePositions.java
+++ b/src/jdk.compiler/share/classes/com/sun/source/util/SourcePositions.java
@@ -74,6 +74,7 @@ public interface SourcePositions {
      * </p>
      *
      * @param tree tree for which a position is sought
+     * @since 27
      */
      long getStartPosition(Tree tree);
 
@@ -130,6 +131,7 @@ public interface SourcePositions {
      * </p>
      *
      * @param tree tree for which a position is sought
+     * @since 27
      */
     long getEndPosition(Tree tree);
 }
diff --git a/test/jdk/tools/sincechecker/modules/jdk.compiler/JdkCompilerCheckSince.java b/test/jdk/tools/sincechecker/modules/jdk.compiler/JdkCompilerCheckSince.java
index 5eb819786e9..bf4b906b623 100644
--- a/test/jdk/tools/sincechecker/modules/jdk.compiler/JdkCompilerCheckSince.java
+++ b/test/jdk/tools/sincechecker/modules/jdk.compiler/JdkCompilerCheckSince.java
@@ -23,7 +23,7 @@
 
 /*
  * @test
- * @bug 8341399
+ * @bug 8341399 8381475
  * @summary Test for `@since` in jdk.compiler module
  * @library /test/lib /test/jdk/tools/sincechecker
  * @run main SinceChecker jdk.compiler

From f1a414b61cab8bf839e3d6e4437ad4ef527c9aa3 Mon Sep 17 00:00:00 2001
From: Shiv Shah <shiv.shah@oracle.com>
Date: Fri, 3 Apr 2026 00:44:00 +0000
Subject: [PATCH 478/655] 8338594: Update nsk/aod tests to use driver instead
 of othervm

Reviewed-by: lmesnik, cjplummer
---
 .../AttachProvider/AttachProvider01/AttachProvider01.java  | 5 ++---
 .../VirtualMachine/VirtualMachine01/VirtualMachine01.java  | 5 ++---
 .../VirtualMachine/VirtualMachine04/VirtualMachine04.java  | 5 ++---
 .../VirtualMachine/VirtualMachine05/VirtualMachine05.java  | 5 ++---
 .../VirtualMachine/VirtualMachine06/VirtualMachine06.java  | 5 ++---
 .../VirtualMachine/VirtualMachine07/VirtualMachine07.java  | 3 +--
 .../VirtualMachine/VirtualMachine08/TestDescription.java   | 3 +--
 .../VirtualMachine/VirtualMachine09/VirtualMachine09.java  | 3 +--
 .../VirtualMachine/VirtualMachine10/TestDescription.java   | 3 +--
 .../VirtualMachineDescriptor01.java                        | 5 ++---
 .../jtreg/vmTestbase/nsk/share/aod/AODTestRunner.java      | 7 ++++++-
 11 files changed, 22 insertions(+), 27 deletions(-)

diff --git a/test/hotspot/jtreg/vmTestbase/nsk/aod/AttachProvider/AttachProvider01/AttachProvider01.java b/test/hotspot/jtreg/vmTestbase/nsk/aod/AttachProvider/AttachProvider01/AttachProvider01.java
index 7e3f7a9687d..dbe640a8719 100644
--- a/test/hotspot/jtreg/vmTestbase/nsk/aod/AttachProvider/AttachProvider01/AttachProvider01.java
+++ b/test/hotspot/jtreg/vmTestbase/nsk/aod/AttachProvider/AttachProvider01/AttachProvider01.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2008, 2020, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2008, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -36,8 +36,7 @@
  * @library /vmTestbase /test/hotspot/jtreg/vmTestbase
  *          /test/lib
  * @build nsk.share.aod.DummyTargetApplication
- * @run main/othervm
- *      -XX:+UsePerfData
+ * @run driver
  *      nsk.aod.AttachProvider.AttachProvider01.AttachProvider01
  *      -jdk ${test.jdk}
  *      -javaOpts="-XX:+UsePerfData ${test.vm.opts} ${test.java.opts}"
diff --git a/test/hotspot/jtreg/vmTestbase/nsk/aod/VirtualMachine/VirtualMachine01/VirtualMachine01.java b/test/hotspot/jtreg/vmTestbase/nsk/aod/VirtualMachine/VirtualMachine01/VirtualMachine01.java
index 257d4022d2b..3f171367361 100644
--- a/test/hotspot/jtreg/vmTestbase/nsk/aod/VirtualMachine/VirtualMachine01/VirtualMachine01.java
+++ b/test/hotspot/jtreg/vmTestbase/nsk/aod/VirtualMachine/VirtualMachine01/VirtualMachine01.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2008, 2020, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2008, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -40,8 +40,7 @@
  * @library /vmTestbase /test/hotspot/jtreg/vmTestbase
  *          /test/lib
  * @build nsk.share.aod.DummyTargetApplication
- * @run main/othervm
- *      -XX:+UsePerfData
+ * @run driver
  *      nsk.aod.VirtualMachine.VirtualMachine01.VirtualMachine01
  *      -jdk ${test.jdk}
  *      -javaOpts="-XX:+UsePerfData ${test.vm.opts} ${test.java.opts}"
diff --git a/test/hotspot/jtreg/vmTestbase/nsk/aod/VirtualMachine/VirtualMachine04/VirtualMachine04.java b/test/hotspot/jtreg/vmTestbase/nsk/aod/VirtualMachine/VirtualMachine04/VirtualMachine04.java
index 3bd98cd5043..066b2ef8a0f 100644
--- a/test/hotspot/jtreg/vmTestbase/nsk/aod/VirtualMachine/VirtualMachine04/VirtualMachine04.java
+++ b/test/hotspot/jtreg/vmTestbase/nsk/aod/VirtualMachine/VirtualMachine04/VirtualMachine04.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2008, 2020, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2008, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -39,8 +39,7 @@
  * @library /vmTestbase /test/hotspot/jtreg/vmTestbase
  *          /test/lib
  * @build nsk.aod.VirtualMachine.VirtualMachine04.VM04Target
- * @run main/othervm
- *      -XX:+UsePerfData
+ * @run driver
  *      nsk.aod.VirtualMachine.VirtualMachine04.VirtualMachine04
  *      -jdk ${test.jdk}
  *      -javaOpts="-XX:+UsePerfData ${test.vm.opts} ${test.java.opts}"
diff --git a/test/hotspot/jtreg/vmTestbase/nsk/aod/VirtualMachine/VirtualMachine05/VirtualMachine05.java b/test/hotspot/jtreg/vmTestbase/nsk/aod/VirtualMachine/VirtualMachine05/VirtualMachine05.java
index 3c7e90a7ffa..c8e7299fd39 100644
--- a/test/hotspot/jtreg/vmTestbase/nsk/aod/VirtualMachine/VirtualMachine05/VirtualMachine05.java
+++ b/test/hotspot/jtreg/vmTestbase/nsk/aod/VirtualMachine/VirtualMachine05/VirtualMachine05.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2008, 2020, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2008, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -36,8 +36,7 @@
  * @library /vmTestbase /test/hotspot/jtreg/vmTestbase
  *          /test/lib
  * @build nsk.share.aod.DummyTargetApplication
- * @run main/othervm
- *      -XX:+UsePerfData
+ * @run driver
  *      nsk.aod.VirtualMachine.VirtualMachine05.VirtualMachine05
  *      -jdk ${test.jdk}
  *      -javaOpts="-XX:+UsePerfData ${test.vm.opts} ${test.java.opts}"
diff --git a/test/hotspot/jtreg/vmTestbase/nsk/aod/VirtualMachine/VirtualMachine06/VirtualMachine06.java b/test/hotspot/jtreg/vmTestbase/nsk/aod/VirtualMachine/VirtualMachine06/VirtualMachine06.java
index 0fd11e6b8d5..f9bf43d2fe0 100644
--- a/test/hotspot/jtreg/vmTestbase/nsk/aod/VirtualMachine/VirtualMachine06/VirtualMachine06.java
+++ b/test/hotspot/jtreg/vmTestbase/nsk/aod/VirtualMachine/VirtualMachine06/VirtualMachine06.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2008, 2020, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2008, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -76,8 +76,7 @@
  *
  *
  * @build nsk.share.aod.TargetApplicationWaitingAgents
- * @run main/othervm
- *      -XX:+UsePerfData
+ * @run driver
  *      nsk.aod.VirtualMachine.VirtualMachine06.VirtualMachine06
  *      -jdk ${test.jdk}
  *      -javaOpts="-XX:+UsePerfData ${test.vm.opts} ${test.java.opts}"
diff --git a/test/hotspot/jtreg/vmTestbase/nsk/aod/VirtualMachine/VirtualMachine07/VirtualMachine07.java b/test/hotspot/jtreg/vmTestbase/nsk/aod/VirtualMachine/VirtualMachine07/VirtualMachine07.java
index 73b4522ae6e..ab37e253fc8 100644
--- a/test/hotspot/jtreg/vmTestbase/nsk/aod/VirtualMachine/VirtualMachine07/VirtualMachine07.java
+++ b/test/hotspot/jtreg/vmTestbase/nsk/aod/VirtualMachine/VirtualMachine07/VirtualMachine07.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2008, 2020, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2008, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -42,7 +42,6 @@
  *          /test/lib
  * @build nsk.share.aod.TargetApplicationWaitingAgents
  * @run main/othervm/native
- *      -XX:+UsePerfData
  *      nsk.aod.VirtualMachine.VirtualMachine07.VirtualMachine07
  *      -jdk ${test.jdk}
  *      -javaOpts="-XX:+UsePerfData ${test.vm.opts} ${test.java.opts}"
diff --git a/test/hotspot/jtreg/vmTestbase/nsk/aod/VirtualMachine/VirtualMachine08/TestDescription.java b/test/hotspot/jtreg/vmTestbase/nsk/aod/VirtualMachine/VirtualMachine08/TestDescription.java
index e484641dd2a..14a05f53702 100644
--- a/test/hotspot/jtreg/vmTestbase/nsk/aod/VirtualMachine/VirtualMachine08/TestDescription.java
+++ b/test/hotspot/jtreg/vmTestbase/nsk/aod/VirtualMachine/VirtualMachine08/TestDescription.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2020, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -43,7 +43,6 @@
  *          /test/lib
  * @build nsk.share.aod.TargetApplicationWaitingAgents
  * @run main/othervm/native
- *      -XX:+UsePerfData
  *      nsk.aod.VirtualMachine.VirtualMachine07.VirtualMachine07
  *      -jdk ${test.jdk}
  *      -javaOpts="-XX:+UsePerfData ${test.vm.opts} ${test.java.opts}"
diff --git a/test/hotspot/jtreg/vmTestbase/nsk/aod/VirtualMachine/VirtualMachine09/VirtualMachine09.java b/test/hotspot/jtreg/vmTestbase/nsk/aod/VirtualMachine/VirtualMachine09/VirtualMachine09.java
index 47d1a718e88..3b2852fc0ad 100644
--- a/test/hotspot/jtreg/vmTestbase/nsk/aod/VirtualMachine/VirtualMachine09/VirtualMachine09.java
+++ b/test/hotspot/jtreg/vmTestbase/nsk/aod/VirtualMachine/VirtualMachine09/VirtualMachine09.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2008, 2020, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2008, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -39,7 +39,6 @@
  *          /test/lib
  * @build nsk.aod.VirtualMachine.VirtualMachine09.VM09Target
  * @run main/othervm/native
- *      -XX:+UsePerfData
  *      nsk.aod.VirtualMachine.VirtualMachine09.VirtualMachine09
  *      -jdk ${test.jdk}
  *      -javaOpts="-agentlib:VirtualMachine09agent00 -XX:+UsePerfData ${test.vm.opts} ${test.java.opts}"
diff --git a/test/hotspot/jtreg/vmTestbase/nsk/aod/VirtualMachine/VirtualMachine10/TestDescription.java b/test/hotspot/jtreg/vmTestbase/nsk/aod/VirtualMachine/VirtualMachine10/TestDescription.java
index c9c5b1ee64f..139fe236635 100644
--- a/test/hotspot/jtreg/vmTestbase/nsk/aod/VirtualMachine/VirtualMachine10/TestDescription.java
+++ b/test/hotspot/jtreg/vmTestbase/nsk/aod/VirtualMachine/VirtualMachine10/TestDescription.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2020, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -40,7 +40,6 @@
  *          /test/lib
  * @build nsk.aod.VirtualMachine.VirtualMachine09.VM09Target
  * @run main/othervm/native
- *      -XX:+UsePerfData
  *      nsk.aod.VirtualMachine.VirtualMachine09.VirtualMachine09
  *      -jdk ${test.jdk}
  *      -javaOpts="-agentlib:VirtualMachine09agent00 -XX:+UsePerfData ${test.vm.opts} ${test.java.opts}"
diff --git a/test/hotspot/jtreg/vmTestbase/nsk/aod/VirtualMachineDescriptor/VirtualMachineDescriptor01/VirtualMachineDescriptor01.java b/test/hotspot/jtreg/vmTestbase/nsk/aod/VirtualMachineDescriptor/VirtualMachineDescriptor01/VirtualMachineDescriptor01.java
index 47f837a110f..02448528f12 100644
--- a/test/hotspot/jtreg/vmTestbase/nsk/aod/VirtualMachineDescriptor/VirtualMachineDescriptor01/VirtualMachineDescriptor01.java
+++ b/test/hotspot/jtreg/vmTestbase/nsk/aod/VirtualMachineDescriptor/VirtualMachineDescriptor01/VirtualMachineDescriptor01.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2008, 2020, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2008, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -38,8 +38,7 @@
  * @library /vmTestbase /test/hotspot/jtreg/vmTestbase
  *          /test/lib
  * @build nsk.share.aod.DummyTargetApplication
- * @run main/othervm
- *      -XX:+UsePerfData
+ * @run driver
  *      nsk.aod.VirtualMachineDescriptor.VirtualMachineDescriptor01.VirtualMachineDescriptor01
  *      -jdk ${test.jdk}
  *      -javaOpts="-XX:+UsePerfData ${test.vm.opts} ${test.java.opts}"
diff --git a/test/hotspot/jtreg/vmTestbase/nsk/share/aod/AODTestRunner.java b/test/hotspot/jtreg/vmTestbase/nsk/share/aod/AODTestRunner.java
index 9899c762a7a..abfca89ca4d 100644
--- a/test/hotspot/jtreg/vmTestbase/nsk/share/aod/AODTestRunner.java
+++ b/test/hotspot/jtreg/vmTestbase/nsk/share/aod/AODTestRunner.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2008, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2008, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -103,9 +103,14 @@ public class AODTestRunner {
             /*
              * Create target application id required by the Utils.findVMIdUsingJPS
              */
+            String classPath = System.getProperty("test.class.path");
+            if (classPath == null) {
+                throw new RuntimeException("test.class.path is not set");
+            }
             String targetAppCmd =
                     // path to java
                     argParser.getTestedJDK() + File.separator + "bin" + File.separator + "java " +
+                            "-classpath " + classPath + " " +
                             // VM property to identify VM running target application
                             "-D" + appIdProperty + "=" + targetAppId +  " " +
                             // VM opts

From fbbf2c3af34411f108bf983e52faf8f63a224a31 Mon Sep 17 00:00:00 2001
From: Shiv Shah <shiv.shah@oracle.com>
Date: Fri, 3 Apr 2026 00:52:00 +0000
Subject: [PATCH 479/655] 8269613:
 vmTestbase/vm/mlvm/mixed/stress/java/findDeadlock/TestDescription.java fails
 with OOME in CodeCache

Reviewed-by: lmesnik, epavlova
---
 .../mlvm/mixed/stress/java/findDeadlock/TestDescription.java  | 4 +++-
 1 file changed, 3 insertions(+), 1 deletion(-)

diff --git a/test/hotspot/jtreg/vmTestbase/vm/mlvm/mixed/stress/java/findDeadlock/TestDescription.java b/test/hotspot/jtreg/vmTestbase/vm/mlvm/mixed/stress/java/findDeadlock/TestDescription.java
index ec2b2753340..ed186aa3f84 100644
--- a/test/hotspot/jtreg/vmTestbase/vm/mlvm/mixed/stress/java/findDeadlock/TestDescription.java
+++ b/test/hotspot/jtreg/vmTestbase/vm/mlvm/mixed/stress/java/findDeadlock/TestDescription.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -40,6 +40,8 @@
  * @library /vmTestbase
  *          /test/lib
  *
+ * @requires vm.compMode != "Xcomp"
+ *
  * @comment build test class and indify classes
  * @build vm.mlvm.mixed.stress.java.findDeadlock.INDIFY_Test
  * @run driver vm.mlvm.share.IndifiedClassesBuilder

From 95e90299b47c3f82c8711ba8799810fbb01ab5df Mon Sep 17 00:00:00 2001
From: Ioi Lam <iklam@openjdk.org>
Date: Fri, 3 Apr 2026 03:20:38 +0000
Subject: [PATCH 480/655] 8381553: Clean up AOTCodeCache configuration checks

Reviewed-by: kvn, asmehra
---
 src/hotspot/share/code/aotCodeCache.cpp       | 386 ++++--------------
 src/hotspot/share/code/aotCodeCache.hpp       | 216 +++++-----
 .../aotCode/AOTCodeCompressedOopsTest.java    |  14 +-
 .../JDKMethodHandlesTestRunner.java           |   4 +-
 4 files changed, 201 insertions(+), 419 deletions(-)

diff --git a/src/hotspot/share/code/aotCodeCache.cpp b/src/hotspot/share/code/aotCodeCache.cpp
index 938cf4eaa41..e3cbc3c3c8b 100644
--- a/src/hotspot/share/code/aotCodeCache.cpp
+++ b/src/hotspot/share/code/aotCodeCache.cpp
@@ -73,11 +73,23 @@ const char* aot_code_entry_kind_name[] = {
 #undef DECL_KIND_STRING
 };
 
+// Stream to printing AOTCodeCache loading failure.
+// Print to error channel when -XX:AOTMode is set to "on"
+static LogStream& load_failure_log() {
+  static LogStream err_stream(LogLevel::Error, LogTagSetMapping<LOG_TAGS(aot, codecache, init)>::tagset());
+  static LogStream dbg_stream(LogLevel::Debug, LogTagSetMapping<LOG_TAGS(aot, codecache, init)>::tagset());
+  if (RequireSharedSpaces) {
+    return err_stream;
+  } else {
+    return dbg_stream;
+  }
+}
+
 static void report_load_failure() {
   if (AbortVMOnAOTCodeFailure) {
     vm_exit_during_initialization("Unable to use AOT Code Cache.", nullptr);
   }
-  log_info(aot, codecache, init)("Unable to use AOT Code Cache.");
+  load_failure_log().print_cr("Unable to use AOT Code Cache.");
   AOTCodeCache::disable_caching();
 }
 
@@ -86,7 +98,7 @@ static void report_store_failure() {
     tty->print_cr("Unable to create AOT Code Cache.");
     vm_abort(false);
   }
-  log_info(aot, codecache, exit)("Unable to create AOT Code Cache.");
+  log_error(aot, codecache, exit)("Unable to create AOT Code Cache.");
   AOTCodeCache::disable_caching();
 }
 
@@ -380,110 +392,27 @@ void AOTCodeCache::init_early_c1_table() {
   }
 }
 
-// macro to record which flags are set -- flag_type selects the
-// relevant accessor e.g. set_flag, set_x86_flag, set_x86_use_flag.
-// n.b. flag_enum_name and global_flag_name are both needed because we
-// don't have consistent conventions for naming global flags e.g.
-// EnableContended vs UseMulAddIntrinsic vs UseCRC32Intrinsics
-
-#define RECORD_FLAG(flag_type, flag_enum_name, global_flag_name)        \
-  if (global_flag_name) {                                               \
-    set_ ## flag_type ## flag(flag_enum_name);                          \
-  }
-
 void AOTCodeCache::Config::record(uint cpu_features_offset) {
-  _flags = 0;
-#ifdef ASSERT
-  set_flag(debugVM);
-#endif
-  RECORD_FLAG(, compressedOops, UseCompressedOops);
-  RECORD_FLAG(, useTLAB, UseTLAB);
-  if (JavaAssertions::systemClassDefault()) {
-    set_flag(systemClassAssertions);
-  }
-  if (JavaAssertions::userClassDefault()) {
-    set_flag(userClassAssertions);
-  }
-  RECORD_FLAG(, enableContendedPadding, EnableContended);
-  RECORD_FLAG(, restrictContendedPadding, RestrictContended);
 
-  _compressedOopShift    = CompressedOops::shift();
+#define AOTCODECACHE_SAVE_VAR(type, name) _saved_ ## name =  name;
+#define AOTCODECACHE_SAVE_FUN(type, name, fun) _saved_ ## name =  fun;
+
+  AOTCODECACHE_CONFIGS_DO(AOTCODECACHE_SAVE_VAR, AOTCODECACHE_SAVE_FUN);
+
+  // Special configs that cannot be checked with macros
   _compressedOopBase     = CompressedOops::base();
-  _compressedKlassShift  = CompressedKlassPointers::shift();
-  _contendedPaddingWidth = ContendedPaddingWidth;
-  _gc                    = (uint)Universe::heap()->kind();
-  _optoLoopAlignment               = (uint)OptoLoopAlignment;
-  _codeEntryAlignment              = (uint)CodeEntryAlignment;
-  _allocatePrefetchLines           = (uint)AllocatePrefetchLines;
-  _allocateInstancePrefetchLines   = (uint)AllocateInstancePrefetchLines;
-  _allocatePrefetchDistance        = (uint)AllocatePrefetchDistance;
-  _allocatePrefetchStepSize        = (uint)AllocatePrefetchStepSize;
-  _use_intrinsics_flags = 0;
-  RECORD_FLAG(use_, useCRC32, UseCRC32Intrinsics);
-  RECORD_FLAG(use_, useCRC32C, UseCRC32CIntrinsics);
-#ifdef COMPILER2
-  _maxVectorSize                   = (uint)MaxVectorSize;
-  _arrayOperationPartialInlineSize = (uint)ArrayOperationPartialInlineSize;
-  RECORD_FLAG(use_, useMultiplyToLen, UseMultiplyToLenIntrinsic);
-  RECORD_FLAG(use_, useSquareToLen, UseSquareToLenIntrinsic);
-  RECORD_FLAG(use_, useMulAdd, UseMulAddIntrinsic);
-  RECORD_FLAG(use_, useMontgomeryMultiply, UseMontgomeryMultiplyIntrinsic);
-  RECORD_FLAG(use_, useMontgomerySquare, UseMontgomerySquareIntrinsic);
-#endif // COMPILER2
-  RECORD_FLAG(use_, useChaCha20, UseChaCha20Intrinsics);
-  RECORD_FLAG(use_, useDilithium, UseDilithiumIntrinsics);
-  RECORD_FLAG(use_, useKyber, UseKyberIntrinsics);
-  RECORD_FLAG(use_, useBASE64, UseBASE64Intrinsics);
-  RECORD_FLAG(use_, useAdler32, UseAdler32Intrinsics);
-  RECORD_FLAG(use_, useAES, UseAESIntrinsics);
-  RECORD_FLAG(use_, useAESCTR, UseAESCTRIntrinsics);
-  RECORD_FLAG(use_, useGHASH, UseGHASHIntrinsics);
-  RECORD_FLAG(use_, useMD5, UseMD5Intrinsics);
-  RECORD_FLAG(use_, useSHA1, UseSHA1Intrinsics);
-  RECORD_FLAG(use_, useSHA256, UseSHA256Intrinsics);
-  RECORD_FLAG(use_, useSHA512, UseSHA512Intrinsics);
-  RECORD_FLAG(use_, useSHA3, UseSHA3Intrinsics);
-  RECORD_FLAG(use_, usePoly1305, UsePoly1305Intrinsics);
-  RECORD_FLAG(use_, useVectorizedMismatch,UseVectorizedMismatchIntrinsic );
-  RECORD_FLAG(use_, useSecondarySupersTable, UseSecondarySupersTable);
+
 #if defined(X86) && !defined(ZERO)
-  _avx3threshold                   = (uint)AVX3Threshold;
-  _useAVX                          = (uint)UseAVX;
-  _x86_flags                       = 0;
-  RECORD_FLAG(x86_, x86_enableX86ECoreOpts, EnableX86ECoreOpts);
-  RECORD_FLAG(x86_, x86_useUnalignedLoadStores, UseUnalignedLoadStores);
-  RECORD_FLAG(x86_, x86_useAPX, UseAPX);
-
-  _x86_use_intrinsics_flags            = 0;
-  RECORD_FLAG(x86_use_, x86_useLibm, UseLibmIntrinsic);
-  RECORD_FLAG(x86_use_, x86_useIntPoly, UseIntPolyIntrinsics);
-#endif // defined(X86) && !defined(ZERO)
-#if defined(AARCH64)  && !defined(ZERO)
-  _prefetchCopyIntervalInBytes     = (uint)PrefetchCopyIntervalInBytes;
-  _blockZeroingLowLimit            = (uint)BlockZeroingLowLimit;
-  _softwarePrefetchHintDistance    = (uint)SoftwarePrefetchHintDistance;
-  _useSVE                          = (uint)UseSVE;
-  _aarch64_flags                   = 0;
-  RECORD_FLAG(aarch64_, aarch64_avoidUnalignedAccesses, AvoidUnalignedAccesses);
-  RECORD_FLAG(aarch64_, aarch64_useSIMDForMemoryOps, UseSIMDForMemoryOps);
-  RECORD_FLAG(aarch64_, aarch64_useSIMDForArrayEquals, UseSIMDForArrayEquals);
-  RECORD_FLAG(aarch64_, aarch64_useSIMDForSHA3, UseSIMDForSHA3Intrinsic);
-  RECORD_FLAG(aarch64_, aarch64_useLSE, UseLSE);
-
-  _aarch64_use_intrinsics_flags     = 0;
-  RECORD_FLAG(aarch64_use_, aarch64_useBlockZeroing, UseBlockZeroing);
-  RECORD_FLAG(aarch64_use_, aarch64_useSIMDForBigIntegerShift, UseSIMDForBigIntegerShiftIntrinsics);
-  RECORD_FLAG(aarch64_use_, aarch64_useSimpleArrayEquals, UseSimpleArrayEquals);
-  RECORD_FLAG(aarch64_use_, aarch64_useSecondarySupersCache, UseSecondarySupersCache);
-#endif // defined(AARCH64) && !defined(ZERO)
-#if INCLUDE_JVMCI
-  _enableJVMCI                     = (uint)EnableJVMCI;
+  _useUnalignedLoadStores = UseUnalignedLoadStores;
 #endif
+
+#if defined(AARCH64)  && !defined(ZERO)
+  _avoidUnalignedAccesses = AvoidUnalignedAccesses;
+#endif
+
   _cpu_features_offset   = cpu_features_offset;
 }
 
-#undef RECORD_FLAG
-
 bool AOTCodeCache::Config::verify_cpu_features(AOTCodeCache* cache) const {
   LogStreamHandle(Debug, aot, codecache, init) log;
   uint offset = _cpu_features_offset;
@@ -511,271 +440,114 @@ bool AOTCodeCache::Config::verify_cpu_features(AOTCodeCache* cache) const {
       }
     }
   } else {
-    if (log.is_enabled()) {
+    if (load_failure_log().is_enabled()) {
       ResourceMark rm; // required for stringStream::as_string()
       stringStream ss;
       char* runtime_cpu_features = NEW_RESOURCE_ARRAY(char, VM_Version::cpu_features_size());
       VM_Version::store_cpu_features(runtime_cpu_features);
       VM_Version::get_missing_features_name(cached_cpu_features_buffer, runtime_cpu_features, ss);
-      log.print_cr("AOT Code Cache disabled: required cpu features are missing: %s", ss.as_string());
+      load_failure_log().print_cr("AOT Code Cache disabled: required cpu features are missing: %s", ss.as_string());
     }
     return false;
   }
   return true;
 }
 
-// macro to do *standard* flag eq checks -- flag_type selects the
-// relevant accessor e.g. test_flag, test_x86_flag, test_x86_use_flag.
-// n.b. flag_enum_name and global_flag_name are both needed because we
-// don't have consistent conventions for naming global flags e.g.
-// EnableContended vs UseMulAddIntrinsic vs UseCRC32Intrinsics
+#define AOTCODECACHE_DISABLED_MSG "AOT Code Cache disabled: it was created with %s = "
 
-#define CHECK_FLAG(flag_type, flag_enum_name, global_flag_name)         \
-  if (test_ ## flag_type ## flag(flag_enum_name) != global_flag_name) {   \
-    log_debug(aot, codecache, init)("AOT Code Cache disabled: it was created with " # global_flag_name " = %s vs current %s" , (global_flag_name ? "false" : "true"), (global_flag_name ? "true" : "false")); \
-    return false;                                                       \
-  }
+// Special case, print "GC = ..." to be more understandable.
+inline void log_config_mismatch(CollectedHeap::Name saved, CollectedHeap::Name current, const char* name/*unused*/) {
+  load_failure_log().print_cr("AOT Code Cache disabled: it was created with GC = \"%s\" vs current \"%s\"",
+                              GCConfig::hs_err_name(saved), GCConfig::hs_err_name(current));
+}
 
-bool AOTCodeCache::Config::verify(AOTCodeCache* cache) const {
-  // First checks affect all cached AOT code
-#ifdef ASSERT
-  if (!test_flag(debugVM)) {
-    log_debug(aot, codecache, init)("AOT Code Cache disabled: it was created by product VM, it can't be used by debug VM");
-    return false;
-  }
-#else
-  if (test_flag(debugVM)) {
-    log_debug(aot, codecache, init)("AOT Code Cache disabled: it was created by debug VM, it can't be used by product VM");
-    return false;
-  }
+inline void log_config_mismatch(bool saved, bool current, const char* name) {
+  load_failure_log().print_cr(AOTCODECACHE_DISABLED_MSG "%s vs current %s", name,
+                              saved ? "true" : "false", current ? "true" : "false");
+}
+
+inline void log_config_mismatch(int saved, int current, const char* name) {
+  load_failure_log().print_cr(AOTCODECACHE_DISABLED_MSG "%d vs current %d", name, saved, current);
+}
+
+inline void log_config_mismatch(uint saved, uint current, const char* name) {
+  load_failure_log().print_cr(AOTCODECACHE_DISABLED_MSG "%u vs current %u", name, saved, current);
+}
+
+#ifdef _LP64
+inline void log_config_mismatch(intx saved, intx current, const char* name) {
+  load_failure_log().print_cr(AOTCODECACHE_DISABLED_MSG "%zd vs current %zd", name, saved, current);
+}
+
+inline void log_config_mismatch(uintx saved, uintx current, const char* name) {
+  load_failure_log().print_cr(AOTCODECACHE_DISABLED_MSG "%zu vs current %zu", name, saved, current);
+}
 #endif
 
-  CollectedHeap::Name aot_gc = (CollectedHeap::Name)_gc;
-  if (aot_gc != Universe::heap()->kind()) {
-    log_debug(aot, codecache, init)("AOT Code Cache disabled: it was created with different GC: %s vs current %s", GCConfig::hs_err_name(aot_gc), GCConfig::hs_err_name());
-    return false;
-  }
-
-  if (_compressedKlassShift != (uint)CompressedKlassPointers::shift()) {
-    log_debug(aot, codecache, init)("AOT Code Cache disabled: it was created with CompressedKlassPointers::shift() = %d vs current %d", _compressedKlassShift, CompressedKlassPointers::shift());
+template <typename T>
+bool check_config(T saved, T current, const char* name) {
+  if (saved != current) {
+    log_config_mismatch(saved, current, name);
     return false;
+  } else {
+    return true;
   }
+}
 
+bool AOTCodeCache::Config::verify(AOTCodeCache* cache) const {
   // check CPU features before checking flags that may be
   // auto-configured in response to them
   if (!verify_cpu_features(cache)) {
     return false;
   }
 
-  // change to EnableContended can affect validity of nmethods
-  CHECK_FLAG(, enableContendedPadding, EnableContended);
-  // change to RestrictContended can affect validity of nmethods
-  CHECK_FLAG(, restrictContendedPadding, RestrictContended);
-
   // Tests for config options which might affect validity of adapters,
   // stubs or nmethods. Currently we take a pessemistic stand and
   // drop the whole cache if any of these are changed.
 
-  // change to opto alignment can affect performance of array copy
-  // stubs and nmethods
-  if (_optoLoopAlignment != (uint)OptoLoopAlignment) {
-    log_debug(aot, codecache, init)("AOT Code Cache disabled: it was created with OptoLoopAlignment = %d vs current %d", (int)_optoLoopAlignment, (int)OptoLoopAlignment);
-    return false;
-  }
+#define AOTCODECACHE_CHECK_VAR(type, name) \
+  if (!check_config(_saved_ ## name, name, #name)) { return false; }
+#define AOTCODECACHE_CHECK_FUN(type, name, fun) \
+  if (!check_config(_saved_ ## name, fun, #fun)) { return false; }
 
-  // change to CodeEntryAlignment can affect performance of array
-  // copy stubs and nmethods
-  if (_codeEntryAlignment != CodeEntryAlignment) {
-    log_debug(aot, codecache, init)("AOT Code Cache disabled: it was created with CodeEntryAlignment = %d vs current %d", _codeEntryAlignment, CodeEntryAlignment);
-    return false;
-  }
+  AOTCODECACHE_CONFIGS_DO(AOTCODECACHE_CHECK_VAR, AOTCODECACHE_CHECK_FUN);
 
-  // changing Prefetch configuration can affect validity of nmethods
-  // and stubs
-  if (_allocatePrefetchLines != (uint)AllocatePrefetchLines) {
-    log_debug(aot, codecache, init)("AOT Code Cache disabled: it was created with  = %d vs current %d", (int)_allocatePrefetchLines, (int)AllocatePrefetchLines);
-    return false;
-  }
-  if (_allocateInstancePrefetchLines != (uint)AllocateInstancePrefetchLines) {
-    log_debug(aot, codecache, init)("AOT Code Cache disabled: it was created with  = %d vs current %d", (int)_allocateInstancePrefetchLines, (int)AllocateInstancePrefetchLines);
-    return false;
-  }
-  if (_allocatePrefetchDistance != (uint)AllocatePrefetchDistance) {
-    log_debug(aot, codecache, init)("AOT Code Cache disabled: it was created with  = %d vs current %d", (int)_allocatePrefetchDistance, (int)AllocatePrefetchDistance);
-    return false;
-  }
-  if (_allocatePrefetchStepSize != (uint)AllocatePrefetchStepSize) {
-    log_debug(aot, codecache, init)("AOT Code Cache disabled: it was created with  = %d vs current %d", (int)_allocatePrefetchStepSize, (int)AllocatePrefetchStepSize);
-    return false;
-  }
+  // Special configs that cannot be checked with macros
 
-  // check intrinsic use settings are compatible
-
-  CHECK_FLAG(use_, useCRC32, UseCRC32Intrinsics);
-  CHECK_FLAG(use_, useCRC32C, UseCRC32CIntrinsics);
-
-#ifdef COMPILER2
-  // change to MaxVectorSize can affect validity of array copy/fill
-  // stubs
-  if (_maxVectorSize != (uint)MaxVectorSize) {
-    log_debug(aot, codecache, init)("AOT Code Cache disabled: it was created with MaxVectorSize = %d vs current %d", (int)_maxVectorSize, (int)MaxVectorSize);
+  if ((_compressedOopBase == nullptr || CompressedOops::base() == nullptr) && (_compressedOopBase != CompressedOops::base())) {
+    load_failure_log().print_cr("AOT Code Cache disabled: incompatible CompressedOops::base(): %p vs current %p",
+                                _compressedOopBase, CompressedOops::base());
     return false;
   }
 
-  // changing ArrayOperationPartialInlineSize can affect validity of
-  // nmethods and stubs
-  if (_arrayOperationPartialInlineSize != (uint)ArrayOperationPartialInlineSize) {
-    log_debug(aot, codecache, init)("AOT Code Cache disabled: it was created with ArrayOperationPartialInlineSize = %d vs current %d", (int)_arrayOperationPartialInlineSize, (int)ArrayOperationPartialInlineSize);
-    return false;
-  }
-  CHECK_FLAG(use_, useMultiplyToLen, UseMultiplyToLenIntrinsic);
-  CHECK_FLAG(use_, useSquareToLen, UseSquareToLenIntrinsic);
-  CHECK_FLAG(use_, useMulAdd, UseMulAddIntrinsic);
-  CHECK_FLAG(use_, useMontgomeryMultiply,UseMontgomeryMultiplyIntrinsic);
-  CHECK_FLAG(use_, useMontgomerySquare, UseMontgomerySquareIntrinsic);
-#endif // COMPILER2
-  CHECK_FLAG(use_, useChaCha20, UseChaCha20Intrinsics);
-  CHECK_FLAG(use_, useDilithium, UseDilithiumIntrinsics);
-  CHECK_FLAG(use_, useKyber, UseKyberIntrinsics);
-  CHECK_FLAG(use_, useBASE64, UseBASE64Intrinsics);
-  CHECK_FLAG(use_, useAES, UseAESIntrinsics);
-  CHECK_FLAG(use_, useAESCTR, UseAESCTRIntrinsics);
-  CHECK_FLAG(use_, useGHASH, UseGHASHIntrinsics);
-  CHECK_FLAG(use_, useMD5, UseMD5Intrinsics);
-  CHECK_FLAG(use_, useSHA1, UseSHA1Intrinsics);
-  CHECK_FLAG(use_, useSHA256, UseSHA256Intrinsics);
-  CHECK_FLAG(use_, useSHA512, UseSHA512Intrinsics);
-  CHECK_FLAG(use_, useSHA3, UseSHA3Intrinsics);
-  CHECK_FLAG(use_, usePoly1305, UsePoly1305Intrinsics);
-  CHECK_FLAG(use_, useVectorizedMismatch, UseVectorizedMismatchIntrinsic);
-  CHECK_FLAG(use_, useSecondarySupersTable, UseSecondarySupersTable);
-
 #if defined(X86) && !defined(ZERO)
-  // change to AVX3Threshold may affect validity of array copy stubs
-  // and nmethods
-  if (_avx3threshold != (uint)AVX3Threshold) {
-    log_debug(aot, codecache, init)("AOT Code Cache disabled: it was created with AVX3Threshold = %d vs current %d", (int)_avx3threshold, AVX3Threshold);
-    return false;
-  }
-
-  // change to UseAVX may affect validity of array copy stubs and
-  // nmethods
-  if (_useAVX != (uint)UseAVX) {
-    log_debug(aot, codecache, init)("AOT Code Cache disabled: it was created with useAVX = %d vs current %d", (int)_useAVX, UseAVX);
-    return false;
-  }
-
-  // change to EnableX86ECoreOpts may affect validity of nmethods
-  CHECK_FLAG(x86_, x86_enableX86ECoreOpts, EnableX86ECoreOpts);
-
   // switching off UseUnalignedLoadStores can affect validity of fill
   // stubs
-  if (test_x86_flag(x86_useUnalignedLoadStores) && !UseUnalignedLoadStores) {
-    log_debug(aot, codecache, init)("AOT Code Cache disabled: it was created with UseUnalignedLoadStores = true vs current = false");
+  if (_useUnalignedLoadStores && !UseUnalignedLoadStores) {
+    log_config_mismatch(_useUnalignedLoadStores, UseUnalignedLoadStores, "UseUnalignedLoadStores");
     return false;
   }
-
-  // change to UseAPX can affect validity of nmethods and stubs
-  CHECK_FLAG(x86_, x86_useAPX, UseAPX);
-
-  // check x86-specific intrinsic use settings are compatible
-
-  CHECK_FLAG(x86_use_, x86_useLibm, UseLibmIntrinsic);
-  CHECK_FLAG(x86_use_, x86_useIntPoly, UseIntPolyIntrinsics);
 #endif // defined(X86) && !defined(ZERO)
 
 #if defined(AARCH64) && !defined(ZERO)
-  // change to PrefetchCopyIntervalInBytes may affect validity of
-  // array copy stubs
-  if (_prefetchCopyIntervalInBytes != (uint)PrefetchCopyIntervalInBytes) {
-    log_debug(aot, codecache, init)("AOT Code Cache disabled: it was created with PrefetchCopyIntervalInBytes = %d vs current %d", (int)_prefetchCopyIntervalInBytes, (int)PrefetchCopyIntervalInBytes);
-    return false;
-  }
-
-  // change to BlockZeroingLowLimit may affect validity of array fill
-  // stubs
-  if (_blockZeroingLowLimit != (uint)BlockZeroingLowLimit) {
-    log_debug(aot, codecache, init)("AOT Code Cache disabled: it was created with BlockZeroingLowLimit = %d vs current %d", (int)_blockZeroingLowLimit, (int)BlockZeroingLowLimit);
-    return false;
-  }
-
-  // change to SoftwarePrefetchHintDistance may affect validity of array fill
-  // stubs
-  if (_softwarePrefetchHintDistance != (uint)SoftwarePrefetchHintDistance) {
-    log_debug(aot, codecache, init)("AOT Code Cache disabled: it was created with SoftwarePrefetchHintDistance = %d vs current %d", (int)_softwarePrefetchHintDistance, (int)SoftwarePrefetchHintDistance);
-    return false;
-  }
-
-  // change to UseSVE may affect validity of stubs and nmethods
-  if (_useSVE != (uint)UseSVE) {
-  log_debug(aot, codecache, init)("AOT Code Cache disabled: it was created with UseSVE = %d vs current %d",(int)_useSVE, UseSVE);
-    return false;
-  }
-
   // switching on AvoidUnalignedAccesses may affect validity of array
   // copy stubs and nmethods
-  if (!test_aarch64_flag(aarch64_avoidUnalignedAccesses) && AvoidUnalignedAccesses) {
-    log_debug(aot, codecache, init)("AOT Code Cache disabled: it was created with AvoidUnalignedAccesses = false vs current = true");
+  if (!_avoidUnalignedAccesses && AvoidUnalignedAccesses) {
+    log_config_mismatch(_avoidUnalignedAccesses, AvoidUnalignedAccesses, "AvoidUnalignedAccesses");
     return false;
   }
-
-  // change to UseSIMDForMemoryOps may affect validity of array
-  // copy stubs and nmethods
-  CHECK_FLAG(aarch64_, aarch64_useSIMDForMemoryOps, UseSIMDForMemoryOps);
-  // change to UseSIMDForArrayEquals may affect validity of array
-  // copy stubs and nmethods
-  CHECK_FLAG(aarch64_, aarch64_useSIMDForArrayEquals, UseSIMDForArrayEquals);
-  // change to useSIMDForSHA3 may affect validity of SHA3 stubs
-  CHECK_FLAG(aarch64_, aarch64_useSIMDForSHA3, UseSIMDForSHA3Intrinsic);
-  // change to UseLSE may affect validity of stubs and nmethods
-  CHECK_FLAG(aarch64_, aarch64_useLSE, UseLSE);
-
-  // check aarch64-specific intrinsic use settings are compatible
-
-  CHECK_FLAG(aarch64_use_, aarch64_useBlockZeroing, UseBlockZeroing);
-  CHECK_FLAG(aarch64_use_, aarch64_useSIMDForBigIntegerShift, UseSIMDForBigIntegerShiftIntrinsics);
-  CHECK_FLAG(aarch64_use_, aarch64_useSimpleArrayEquals, UseSimpleArrayEquals);
-  CHECK_FLAG(aarch64_use_, aarch64_useSecondarySupersCache, UseSecondarySupersCache);
 #endif // defined(AARCH64) && !defined(ZERO)
 
-#if INCLUDE_JVMCI
-  // change to EnableJVMCI will affect validity of adapters and
-  // nmethods
-  if (_enableJVMCI != (uint)EnableJVMCI) {
-    log_debug(aot, codecache, init)("AOT Code Cache disabled: it was created with EnableJVMCI = %s vs current %s", (_enableJVMCI ? "true" : "false"), (EnableJVMCI ? "true" : "false"));
-    return false;
-  }
-#endif // INCLUDE_JVMCI
-
-  // The following checks do not affect AOT adapters caching
-
-  if (test_flag(compressedOops) != UseCompressedOops) {
-    log_debug(aot, codecache, init)("AOT Code Cache disabled: it was created with UseCompressedOops = %s", UseCompressedOops ? "false" : "true");
-    AOTStubCaching = false;
-  }
-  if (_compressedOopShift != (uint)CompressedOops::shift()) {
-    log_debug(aot, codecache, init)("AOT Code Cache disabled: it was created with different CompressedOops::shift(): %d vs current %d", _compressedOopShift, CompressedOops::shift());
-    AOTStubCaching = false;
-  }
-
-  // This should be the last check as it only disables AOTStubCaching
-  if ((_compressedOopBase == nullptr || CompressedOops::base() == nullptr) && (_compressedOopBase != CompressedOops::base())) {
-    log_debug(aot, codecache, init)("AOTStubCaching is disabled: incompatible CompressedOops::base(): %p vs current %p", _compressedOopBase, CompressedOops::base());
-    AOTStubCaching = false;
-  }
-
   return true;
 }
 
-#undef TEST_FLAG
-
 bool AOTCodeCache::Header::verify(uint load_size) const {
   if (_version != AOT_CODE_VERSION) {
-    log_debug(aot, codecache, init)("AOT Code Cache disabled: different AOT Code version %d vs %d recorded in AOT Code header", AOT_CODE_VERSION, _version);
+    load_failure_log().print_cr("AOT Code Cache disabled: different AOT Code version %d vs %d recorded in AOT Code header", AOT_CODE_VERSION, _version);
     return false;
   }
   if (load_size < _cache_size) {
-    log_debug(aot, codecache, init)("AOT Code Cache disabled: AOT Code Cache size %d < %d recorded in AOT Code header", load_size, _cache_size);
+    load_failure_log().print_cr("AOT Code Cache disabled: AOT Code Cache size %d < %d recorded in AOT Code header", load_size, _cache_size);
     return false;
   }
   return true;
diff --git a/src/hotspot/share/code/aotCodeCache.hpp b/src/hotspot/share/code/aotCodeCache.hpp
index 52b0adfba48..179f131c639 100644
--- a/src/hotspot/share/code/aotCodeCache.hpp
+++ b/src/hotspot/share/code/aotCodeCache.hpp
@@ -25,6 +25,7 @@
 #ifndef SHARE_CODE_AOTCODECACHE_HPP
 #define SHARE_CODE_AOTCODECACHE_HPP
 
+#include "gc/shared/collectedHeap.hpp"
 #include "gc/shared/gc_globals.hpp"
 #include "runtime/stubInfo.hpp"
 
@@ -163,120 +164,123 @@ public:
   address address_for_id(int id);
 };
 
+#define AOTCODECACHE_CONFIGS_GENERIC_DO(do_var, do_fun) \
+  do_var(int,   AllocateInstancePrefetchLines)          /* stubs and nmethods */ \
+  do_var(int,   AllocatePrefetchDistance)               /* stubs and nmethods */ \
+  do_var(int,   AllocatePrefetchLines)                  /* stubs and nmethods */ \
+  do_var(int,   AllocatePrefetchStepSize)               /* stubs and nmethods */ \
+  do_var(uint,  CodeEntryAlignment)                     /* array copy stubs and nmethods */ \
+  do_var(bool,  UseCompressedOops)                      /* stubs and nmethods */ \
+  do_var(bool,  EnableContended)                        /* nmethods */ \
+  do_var(intx,  OptoLoopAlignment)                      /* array copy stubs and nmethods */ \
+  do_var(bool,  RestrictContended)                      /* nmethods */ \
+  do_var(bool,  UseAESCTRIntrinsics) \
+  do_var(bool,  UseAESIntrinsics) \
+  do_var(bool,  UseBASE64Intrinsics) \
+  do_var(bool,  UseChaCha20Intrinsics) \
+  do_var(bool,  UseCRC32CIntrinsics) \
+  do_var(bool,  UseCRC32Intrinsics) \
+  do_var(bool,  UseDilithiumIntrinsics) \
+  do_var(bool,  UseGHASHIntrinsics) \
+  do_var(bool,  UseKyberIntrinsics) \
+  do_var(bool,  UseMD5Intrinsics) \
+  do_var(bool,  UsePoly1305Intrinsics) \
+  do_var(bool,  UseSecondarySupersTable) \
+  do_var(bool,  UseSHA1Intrinsics) \
+  do_var(bool,  UseSHA256Intrinsics) \
+  do_var(bool,  UseSHA3Intrinsics) \
+  do_var(bool,  UseSHA512Intrinsics) \
+  do_var(bool,  UseVectorizedMismatchIntrinsic) \
+  do_fun(int,   CompressedKlassPointers_shift,          CompressedKlassPointers::shift()) \
+  do_fun(int,   CompressedOops_shift,                   CompressedOops::shift()) \
+  do_fun(bool,  JavaAssertions_systemClassDefault,      JavaAssertions::systemClassDefault()) \
+  do_fun(bool,  JavaAssertions_userClassDefault,        JavaAssertions::userClassDefault()) \
+  do_fun(CollectedHeap::Name, Universe_heap_kind,       Universe::heap()->kind()) \
+  // END
+
+#ifdef COMPILER2
+#define AOTCODECACHE_CONFIGS_COMPILER2_DO(do_var, do_fun) \
+  do_var(intx,  ArrayOperationPartialInlineSize)        /* array copy stubs and nmethods */ \
+  do_var(intx,  MaxVectorSize)                          /* array copy/fill stubs */ \
+  do_var(bool,  UseMontgomeryMultiplyIntrinsic) \
+  do_var(bool,  UseMontgomerySquareIntrinsic) \
+  do_var(bool,  UseMulAddIntrinsic) \
+  do_var(bool,  UseMultiplyToLenIntrinsic) \
+  do_var(bool,  UseSquareToLenIntrinsic) \
+  // END
+#else
+#define AOTCODECACHE_CONFIGS_COMPILER2_DO(do_var, do_fun)
+#endif
+
+#if INCLUDE_JVMCI
+#define AOTCODECACHE_CONFIGS_JVMCI_DO(do_var, do_fun) \
+  do_var(bool,  EnableJVMCI)                            /* adapters and nmethods */ \
+  // END
+#else
+#define AOTCODECACHE_CONFIGS_JVMCI_DO(do_var, do_fun)
+#endif
+
+#if defined(AARCH64) && !defined(ZERO)
+#define AOTCODECACHE_CONFIGS_AARCH64_DO(do_var, do_fun) \
+  do_var(intx,  BlockZeroingLowLimit)                   /* array fill stubs */ \
+  do_var(intx,  PrefetchCopyIntervalInBytes)            /* array copy stubs */ \
+  do_var(int,   SoftwarePrefetchHintDistance)           /* array fill stubs */ \
+  do_var(bool,  UseBlockZeroing) \
+  do_var(bool,  UseLSE)                                 /* stubs and nmethods */ \
+  do_var(uint,  UseSVE)                                 /* stubs and nmethods */ \
+  do_var(bool,  UseSecondarySupersCache) \
+  do_var(bool,  UseSIMDForArrayEquals)                  /* array copy stubs and nmethods */ \
+  do_var(bool,  UseSIMDForBigIntegerShiftIntrinsics) \
+  do_var(bool,  UseSIMDForMemoryOps)                    /* array copy stubs and nmethods */ \
+  do_var(bool,  UseSIMDForSHA3Intrinsic)                /* SHA3 stubs */  \
+  do_var(bool,  UseSimpleArrayEquals) \
+  // END
+#else
+#define AOTCODECACHE_CONFIGS_AARCH64_DO(do_var, do_fun)
+#endif
+
+#if defined(X86) && !defined(ZERO)
+#define AOTCODECACHE_CONFIGS_X86_DO(do_var, do_fun) \
+  do_var(int,   AVX3Threshold)                          /* array copy stubs and nmethods */ \
+  do_var(bool,  EnableX86ECoreOpts)                     /* nmethods */ \
+  do_var(int,   UseAVX)                                 /* array copy stubs and nmethods */ \
+  do_var(bool,  UseAPX)                                 /* nmethods and stubs */ \
+  do_var(bool,  UseLibmIntrinsic) \
+  do_var(bool,  UseIntPolyIntrinsics) \
+  // END
+#else
+#define AOTCODECACHE_CONFIGS_X86_DO(do_var, do_fun)
+#endif
+
+#define AOTCODECACHE_CONFIGS_DO(do_var, do_fun) \
+  AOTCODECACHE_CONFIGS_GENERIC_DO(do_var, do_fun) \
+  AOTCODECACHE_CONFIGS_COMPILER2_DO(do_var, do_fun) \
+  AOTCODECACHE_CONFIGS_JVMCI_DO(do_var, do_fun) \
+  AOTCODECACHE_CONFIGS_AARCH64_DO(do_var, do_fun) \
+  AOTCODECACHE_CONFIGS_X86_DO(do_var, do_fun) \
+  // END
+
+#define AOTCODECACHE_DECLARE_VAR(type, name) type _saved_ ## name;
+#define AOTCODECACHE_DECLARE_FUN(type, name, func) type _saved_ ## name;
+
 class AOTCodeCache : public CHeapObj<mtCode> {
 
 // Classes used to describe AOT code cache.
 protected:
   class Config {
+    AOTCODECACHE_CONFIGS_DO(AOTCODECACHE_DECLARE_VAR, AOTCODECACHE_DECLARE_FUN)
+
+    // Special configs that cannot be checked with macros
     address _compressedOopBase;
-    uint _compressedOopShift;
-    uint _compressedKlassShift;
-    uint _contendedPaddingWidth;
-    uint _gc;
-    uint _optoLoopAlignment;
-    uint _codeEntryAlignment;
-    uint _allocatePrefetchLines;
-    uint _allocateInstancePrefetchLines;
-    uint _allocatePrefetchDistance;
-    uint _allocatePrefetchStepSize;
-#ifdef COMPILER2
-    uint _maxVectorSize;
-    uint _arrayOperationPartialInlineSize;
-#endif // COMPILER2
-    enum Flags {
-      none                     = 0,
-      debugVM                  = 1,
-      compressedOops           = 2,
-      useTLAB                  = 4,
-      systemClassAssertions    = 8,
-      userClassAssertions      = 16,
-      enableContendedPadding   = 32,
-      restrictContendedPadding = 64
-    };
-    uint _flags;
-    enum IntrinsicsUseFlags {
-      use_none                = 0,
-      useCRC32                = 1 << 0,
-      useCRC32C               = 1 << 1,
-      useMultiplyToLen        = 1 << 2,
-      useSquareToLen          = 1 << 3,
-      useMulAdd               = 1 << 4,
-      useMontgomeryMultiply   = 1 << 5,
-      useMontgomerySquare     = 1 << 6,
-      useChaCha20             = 1 << 7,
-      useDilithium            = 1 << 8,
-      useKyber                = 1 << 9,
-      useBASE64               = 1 << 10,
-      useAdler32              = 1 << 11,
-      useAES                  = 1 << 12,
-      useAESCTR               = 1 << 13,
-      useGHASH                = 1 << 14,
-      useMD5                  = 1 << 15,
-      useSHA1                 = 1 << 16,
-      useSHA256               = 1 << 17,
-      useSHA512               = 1 << 18,
-      useSHA3                 = 1 << 19,
-      usePoly1305             = 1 << 20,
-      useVectorizedMismatch   = 1 << 21,
-      useSecondarySupersTable = 1 << 22,
-    };
-    uint _use_intrinsics_flags;
-    bool test_flag(enum Flags flag) const { return (_flags & flag) != 0; }
-    bool test_use_flag(enum IntrinsicsUseFlags flag) const { return (_use_intrinsics_flags & flag) != 0; }
-    void set_flag(enum Flags flag) { _flags |= flag; }
-    void set_use_flag(enum IntrinsicsUseFlags flag) { _use_intrinsics_flags |= flag; }
+
 #if defined(X86) && !defined(ZERO)
-    uint _avx3threshold;
-    uint _useAVX;
-    enum X86Flags {
-      x86_none                   = 0,
-      x86_enableX86ECoreOpts     = 1,
-      x86_useUnalignedLoadStores = 2,
-      x86_useAPX                 = 4
-    };
-    uint _x86_flags;
-    enum X86IntrinsicsUseFlags {
-      x86_use_none              = 0,
-      x86_useLibm               = 1 << 1,
-      x86_useIntPoly            = 1 << 2,
-    };
-    uint _x86_use_intrinsics_flags;
-    bool test_x86_flag(enum X86Flags flag) const { return (_x86_flags & flag) != 0; }
-    bool test_x86_use_flag(enum X86IntrinsicsUseFlags flag) const { return (_x86_use_intrinsics_flags & flag) != 0; }
-    void set_x86_flag(enum X86Flags flag) { _x86_flags |= flag; }
-    void set_x86_use_flag(enum X86IntrinsicsUseFlags flag) { _x86_use_intrinsics_flags |= flag; }
-#endif // defined(X86) && !defined(ZERO)
+    bool _useUnalignedLoadStores;
+#endif
+
 #if defined(AARCH64) && !defined(ZERO)
-    // this is global but x86 does not use it and aarch64 does
-    uint _prefetchCopyIntervalInBytes;
-    uint _blockZeroingLowLimit;
-    uint _softwarePrefetchHintDistance;
-    uint _useSVE;
-    enum AArch64Flags {
-      aarch64_none = 0,
-      aarch64_avoidUnalignedAccesses = 1,
-      aarch64_useSIMDForMemoryOps    = 2,
-      aarch64_useSIMDForArrayEquals  = 4,
-      aarch64_useSIMDForSHA3         = 8,
-      aarch64_useLSE                 = 16,
-    };
-    uint _aarch64_flags;
-    enum AArch64IntrinsicsUseFlags {
-      aarch64_use_none                  = 0,
-      aarch64_useBlockZeroing           = 1 << 0,
-      aarch64_useSIMDForBigIntegerShift = 1 << 1,
-      aarch64_useSimpleArrayEquals      = 1 << 2,
-      aarch64_useSecondarySupersCache   = 1 << 3,
-    };
-    uint _aarch64_use_intrinsics_flags;
-    bool test_aarch64_flag(enum AArch64Flags flag) const { return (_aarch64_flags & flag) != 0; }
-    bool test_aarch64_use_flag(enum AArch64IntrinsicsUseFlags flag) const { return (_aarch64_use_intrinsics_flags & flag) != 0; }
-    void set_aarch64_flag(enum AArch64Flags flag) { _aarch64_flags |= flag; }
-    void set_aarch64_use_flag(enum AArch64IntrinsicsUseFlags flag) { _aarch64_use_intrinsics_flags |= flag; }
-#endif // defined(AARCH64) && !defined(ZERO)
-#if INCLUDE_JVMCI
-    uint _enableJVMCI;
-#endif // INCLUDE_JVMCI
+    bool _avoidUnalignedAccesses;
+#endif
+
     uint _cpu_features_offset; // offset in the cache where cpu features are stored
   public:
     void record(uint cpu_features_offset);
diff --git a/test/hotspot/jtreg/runtime/cds/appcds/aotCode/AOTCodeCompressedOopsTest.java b/test/hotspot/jtreg/runtime/cds/appcds/aotCode/AOTCodeCompressedOopsTest.java
index 09290960d2f..3b9458c14da 100644
--- a/test/hotspot/jtreg/runtime/cds/appcds/aotCode/AOTCodeCompressedOopsTest.java
+++ b/test/hotspot/jtreg/runtime/cds/appcds/aotCode/AOTCodeCompressedOopsTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2025, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -201,12 +201,18 @@ public class AOTCodeCompressedOopsTest {
                  if (aotCacheShift == -1 || currentShift == -1 || aotCacheBase == -1 || currentBase == -1) {
                      throw new RuntimeException("Failed to find CompressedOops settings");
                  }
+
+                 // Changes in compressed oop encoding could randomly affect flags like AllocatePrefetchDistance
+                 // due to the OS-assigned range of the Java heap. If that happens, the exact error message may vary
+                 String disabledMsg = "AOT Code Cache disabled:";
                  if (aotCacheShift != currentShift) {
-                     out.shouldContain("AOT Code Cache disabled: it was created with different CompressedOops::shift()");
+                     out.shouldContain(disabledMsg);
                  } else if ((aotCacheBase == 0 || currentBase == 0) && (aotCacheBase != currentBase)) {
-                     out.shouldContain("AOTStubCaching is disabled: incompatible CompressedOops::base()");
+                     out.shouldContain(disabledMsg);
                  } else {
-                     out.shouldMatch("Read \\d+ entries table at offset \\d+ from AOT Code Cache");
+                     if (!out.contains(disabledMsg)) {
+                         out.shouldMatch("Read \\d+ entries table at offset \\d+ from AOT Code Cache");
+                     }
                  }
             }
         }
diff --git a/test/hotspot/jtreg/runtime/cds/appcds/methodHandles/JDKMethodHandlesTestRunner.java b/test/hotspot/jtreg/runtime/cds/appcds/methodHandles/JDKMethodHandlesTestRunner.java
index 19ab392c036..d9e1b15602c 100644
--- a/test/hotspot/jtreg/runtime/cds/appcds/methodHandles/JDKMethodHandlesTestRunner.java
+++ b/test/hotspot/jtreg/runtime/cds/appcds/methodHandles/JDKMethodHandlesTestRunner.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2025, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -91,7 +91,7 @@ public class JDKMethodHandlesTestRunner {
                 public void checkExecution(OutputAnalyzer out, RunMode runMode) throws Exception {
                     out.shouldHaveExitValue(0);
                     if (runMode.isProductionRun()) {
-                        out.shouldMatch(".class.load. test.java.lang.invoke." + testClassName +
+                        out.shouldMatch(".class.load.* test.java.lang.invoke." + testClassName +
                                         "[$][$]Lambda.*/0x.*source:.*shared.*objects.*file");
                     }
                 }

From 4253db22526da9997f3b0140995cac09c41aeb22 Mon Sep 17 00:00:00 2001
From: Dean Long <dlong@openjdk.org>
Date: Fri, 3 Apr 2026 04:08:21 +0000
Subject: [PATCH 481/655] 8350208: CTW: GraphKit::add_safepoint_edges asserts
 "not enough operands for reexecution"

Co-authored-by: Quan Anh Mai <qamai@openjdk.org>
Reviewed-by: mhaessig, vlivanov
---
 src/hotspot/share/opto/doCall.cpp             |  15 +--
 src/hotspot/share/opto/parse.hpp              |   6 +-
 src/hotspot/share/opto/parse1.cpp             |  11 +-
 .../TestDebugDuringExceptionCatching.java     | 126 ++++++++++++++++++
 .../lang/invoke/lib/InstructionHelper.java    |  25 +++-
 5 files changed, 166 insertions(+), 17 deletions(-)
 create mode 100644 test/hotspot/jtreg/compiler/exceptions/TestDebugDuringExceptionCatching.java

diff --git a/src/hotspot/share/opto/doCall.cpp b/src/hotspot/share/opto/doCall.cpp
index e4418631d17..9a1da726f00 100644
--- a/src/hotspot/share/opto/doCall.cpp
+++ b/src/hotspot/share/opto/doCall.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1998, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1998, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -37,6 +37,7 @@
 #include "opto/callGenerator.hpp"
 #include "opto/castnode.hpp"
 #include "opto/cfgnode.hpp"
+#include "opto/graphKit.hpp"
 #include "opto/mulnode.hpp"
 #include "opto/parse.hpp"
 #include "opto/rootnode.hpp"
@@ -909,8 +910,7 @@ void Parse::catch_call_exceptions(ciExceptionHandlerStream& handlers) {
     if (handler_bci < 0) {     // merge with corresponding rethrow node
       throw_to_exit(make_exception_state(ex_oop));
     } else {                      // Else jump to corresponding handle
-      push_ex_oop(ex_oop);        // Clear stack and push just the oop.
-      merge_exception(handler_bci);
+      push_and_merge_exception(handler_bci, ex_oop);
     }
   }
 
@@ -1008,13 +1008,10 @@ void Parse::catch_inline_exceptions(SafePointNode* ex_map) {
     int handler_bci = handler->handler_bci();
 
     if (remaining == 1) {
-      push_ex_oop(ex_node);        // Push exception oop for handler
       if (PrintOpto && WizardMode) {
         tty->print_cr("  Catching every inline exception bci:%d -> handler_bci:%d", bci(), handler_bci);
       }
-      // If this is a backwards branch in the bytecodes, add safepoint
-      maybe_add_safepoint(handler_bci);
-      merge_exception(handler_bci); // jump to handler
+      push_and_merge_exception(handler_bci, ex_node); // jump to handler
       return;                   // No more handling to be done here!
     }
 
@@ -1039,15 +1036,13 @@ void Parse::catch_inline_exceptions(SafePointNode* ex_map) {
       const TypeInstPtr* tinst = TypeOopPtr::make_from_klass_unique(klass)->cast_to_ptr_type(TypePtr::NotNull)->is_instptr();
       assert(klass->has_subklass() || tinst->klass_is_exact(), "lost exactness");
       Node* ex_oop = _gvn.transform(new CheckCastPPNode(control(), ex_node, tinst));
-      push_ex_oop(ex_oop);      // Push exception oop for handler
       if (PrintOpto && WizardMode) {
         tty->print("  Catching inline exception bci:%d -> handler_bci:%d -- ", bci(), handler_bci);
         klass->print_name();
         tty->cr();
       }
       // If this is a backwards branch in the bytecodes, add safepoint
-      maybe_add_safepoint(handler_bci);
-      merge_exception(handler_bci);
+      push_and_merge_exception(handler_bci, ex_oop);
     }
     set_control(not_subtype_ctrl);
 
diff --git a/src/hotspot/share/opto/parse.hpp b/src/hotspot/share/opto/parse.hpp
index 397a7796f88..42f44f0f7ea 100644
--- a/src/hotspot/share/opto/parse.hpp
+++ b/src/hotspot/share/opto/parse.hpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1997, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -474,8 +474,8 @@ class Parse : public GraphKit {
   void merge(          int target_bci);
   // Same as plain merge, except that it allocates a new path number.
   void merge_new_path( int target_bci);
-  // Merge the current mapping into an exception handler.
-  void merge_exception(int target_bci);
+  // Push the exception oop and merge the current mapping into an exception handler.
+  void push_and_merge_exception(int target_bci, Node* ex_oop);
   // Helper: Merge the current mapping into the given basic block
   void merge_common(Block* target, int pnum);
   // Helper functions for merging individual cells.
diff --git a/src/hotspot/share/opto/parse1.cpp b/src/hotspot/share/opto/parse1.cpp
index 647e8515b30..683633f6355 100644
--- a/src/hotspot/share/opto/parse1.cpp
+++ b/src/hotspot/share/opto/parse1.cpp
@@ -1651,9 +1651,14 @@ void Parse::merge_new_path(int target_bci) {
 }
 
 //-------------------------merge_exception-------------------------------------
-// Merge the current mapping into the basic block starting at bci
-// The ex_oop must be pushed on the stack, unlike throw_to_exit.
-void Parse::merge_exception(int target_bci) {
+// Push the given ex_oop onto the stack, then merge the current mapping into
+// the basic block starting at target_bci.
+void Parse::push_and_merge_exception(int target_bci, Node* ex_oop) {
+  // Add the safepoint before trimming the stack and pushing the exception oop.
+  // We could add the safepoint after, but then the bci would also need to be
+  // advanced to target_bci first, so the stack state matches.
+  maybe_add_safepoint(target_bci);
+  push_ex_oop(ex_oop);      // Push exception oop for handler
 #ifdef ASSERT
   if (target_bci <= bci()) {
     C->set_exception_backedge();
diff --git a/test/hotspot/jtreg/compiler/exceptions/TestDebugDuringExceptionCatching.java b/test/hotspot/jtreg/compiler/exceptions/TestDebugDuringExceptionCatching.java
new file mode 100644
index 00000000000..999c73fb73a
--- /dev/null
+++ b/test/hotspot/jtreg/compiler/exceptions/TestDebugDuringExceptionCatching.java
@@ -0,0 +1,126 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+package compiler.exceptions;
+
+import compiler.lib.ir_framework.Run;
+import compiler.lib.ir_framework.Test;
+import compiler.lib.ir_framework.TestFramework;
+
+import java.lang.classfile.Label;
+import java.lang.constant.ClassDesc;
+import java.lang.invoke.MethodHandle;
+import java.lang.invoke.MethodHandles;
+import java.lang.invoke.MethodType;
+
+import jdk.test.lib.Asserts;
+import test.java.lang.invoke.lib.InstructionHelper;
+
+/**
+ * @test
+ * @bug 8350208
+ * @summary Safepoints added during the processing of exception handlers should never reexecute
+ * @library /test/lib /test/jdk/java/lang/invoke/common /
+ * @build test.java.lang.invoke.lib.InstructionHelper
+ *
+ * @run main/othervm ${test.main.class}
+ */
+public class TestDebugDuringExceptionCatching {
+
+    public static class V {
+        int v;
+    }
+
+    static final int ITERATIONS = 100;
+    static final RuntimeException EXCEPTION = new RuntimeException();
+
+    /**
+     * Construct something that looks like this:
+     * <pre>{@code
+     * int snippet(V v) {
+     *     int i = 0;
+     *     LoopHead: {
+     *         if (i >= 100) {
+     *             goto LoopEnd;
+     *         }
+     *         i++;
+     *         try {
+     *             v.v = 1;
+     *         } catch (Throwable) {
+     *             // Not really, the LoopHead is the exception Handler
+     *             goto LoopHead;
+     *         }
+     *     }
+     *     LoopEnd:
+     *     return i;
+     * }
+     * }</pre>
+     */
+    static final MethodHandle SNIPPET_HANDLE;
+    static final ClassDesc CLASS_DESC = TestDebugDuringExceptionCatching.class.describeConstable().get();
+    static {
+        SNIPPET_HANDLE = InstructionHelper.buildMethodHandle(MethodHandles.lookup(),
+                "snippet",
+                MethodType.methodType(int.class, V.class),
+                CODE -> {
+                    Label loopHead = CODE.newLabel();
+                    Label loopEnd = CODE.newLabel();
+                    Label tryStart = CODE.newLabel();
+                    Label tryEnd = CODE.newLabel();
+                    CODE.
+                            iconst_0().
+                            istore(1).
+                            // The loop head should have a RuntimeException as the sole element on the stack
+                            getstatic(CLASS_DESC, "EXCEPTION", RuntimeException.class.describeConstable().get()).
+                            labelBinding(loopHead).
+                            pop().
+                            iload(1).
+                            ldc(ITERATIONS).
+                            if_icmpge(loopEnd).
+                            iinc(1, 1).
+                            aload(0).
+                            iconst_1().
+                            labelBinding(tryStart).
+                            putfield(V.class.describeConstable().get(), "v", int.class.describeConstable().get()).
+                            labelBinding(tryEnd).
+                            // The stack is empty here
+                            labelBinding(loopEnd).
+                            iload(1).
+                            ireturn();
+                    CODE.exceptionCatchAll(tryStart, tryEnd, loopHead);
+                });
+    }
+
+    @Test
+    private static int testBackwardHandler(V v) throws Throwable {
+        return (int) SNIPPET_HANDLE.invokeExact(v);
+    }
+
+    @Run(test = "testBackwardHandler")
+    public void run() throws Throwable {
+        Asserts.assertEQ(ITERATIONS, testBackwardHandler(null));
+    }
+
+    public static void main(String[] args) {
+        TestFramework.run();
+    }
+}
diff --git a/test/jdk/java/lang/invoke/common/test/java/lang/invoke/lib/InstructionHelper.java b/test/jdk/java/lang/invoke/common/test/java/lang/invoke/lib/InstructionHelper.java
index 123cccd53e7..c7185f691b2 100644
--- a/test/jdk/java/lang/invoke/common/test/java/lang/invoke/lib/InstructionHelper.java
+++ b/test/jdk/java/lang/invoke/common/test/java/lang/invoke/lib/InstructionHelper.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2010, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2010, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,6 +25,7 @@ package test.java.lang.invoke.lib;
 
 import java.lang.classfile.ClassBuilder;
 import java.lang.classfile.ClassFile;
+import java.lang.classfile.CodeBuilder;
 import java.lang.classfile.TypeKind;
 
 import java.lang.constant.*;
@@ -32,6 +33,7 @@ import java.lang.invoke.MethodHandle;
 import java.lang.invoke.MethodHandles;
 import java.lang.invoke.MethodType;
 import java.util.concurrent.atomic.AtomicInteger;
+import java.util.function.Consumer;
 
 import static java.lang.invoke.MethodType.fromMethodDescriptorString;
 
@@ -135,4 +137,25 @@ public class InstructionHelper {
         String classDescStr = sb.insert(sb.length() - 1, suffix).toString();
         return ClassDesc.ofDescriptor(classDescStr);
     }
+
+    public static MethodHandle buildMethodHandle(MethodHandles.Lookup l, String methodName, MethodType methodType, Consumer<? super CodeBuilder> builder) {
+        ClassDesc genClassDesc = classDesc(l.lookupClass(), "$Code_" + COUNT.getAndIncrement());
+        return buildMethodHandle(l, genClassDesc, methodName, methodType, builder);
+    }
+
+    private static MethodHandle buildMethodHandle(MethodHandles.Lookup l, ClassDesc classDesc, String methodName, MethodType methodType, Consumer<? super CodeBuilder> builder) {
+        try {
+            byte[] bytes = ClassFile.of().build(classDesc, classBuilder -> {
+                classBuilder.withMethod(methodName,
+                        MethodTypeDesc.ofDescriptor(methodType.toMethodDescriptorString()),
+                        ClassFile.ACC_PUBLIC + ClassFile.ACC_STATIC,
+                        methodBuilder -> methodBuilder.withCode(builder));
+            });
+            Class<?> clazz = l.defineClass(bytes);
+            return l.findStatic(clazz, methodName, methodType);
+        } catch (Throwable t) {
+            t.printStackTrace();
+            throw new RuntimeException("Failed to buildMethodHandle: " + methodName + " type " + methodType);
+        }
+    }
 }

From 4bb7204fa91cc86daca35f816265e2258bd95a7f Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Daniel=20Jeli=C5=84ski?= <djelinski@openjdk.org>
Date: Fri, 3 Apr 2026 05:48:24 +0000
Subject: [PATCH 482/655] 8377181: HttpClient may leak closed QUIC connection
 objects

Reviewed-by: dfuchs
---
 .../http/quic/ConnectionTerminatorImpl.java   |  8 +++++-
 .../net/http/quic/PeerConnIdManager.java      | 25 ++++++++++++++++---
 .../net/http/quic/QuicConnectionImpl.java     |  4 +++
 .../internal/net/http/quic/QuicEndpoint.java  | 12 +++++----
 .../net/httpclient/CancelRequestTest.java     |  2 +-
 .../httpclient/http3/H3ErrorHandlingTest.java |  2 +-
 6 files changed, 41 insertions(+), 12 deletions(-)

diff --git a/src/java.net.http/share/classes/jdk/internal/net/http/quic/ConnectionTerminatorImpl.java b/src/java.net.http/share/classes/jdk/internal/net/http/quic/ConnectionTerminatorImpl.java
index 5e2384dce27..3fc013b4fde 100644
--- a/src/java.net.http/share/classes/jdk/internal/net/http/quic/ConnectionTerminatorImpl.java
+++ b/src/java.net.http/share/classes/jdk/internal/net/http/quic/ConnectionTerminatorImpl.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2024, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2024, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -203,6 +203,9 @@ final class ConnectionTerminatorImpl implements ConnectionTerminator {
             // an endpoint has been established (which is OK)
             return;
         }
+        // close the connection ID managers; any in-flight connection ID changes should be ignored.
+        connection.localConnectionIdManager().close();
+        connection.peerConnectionIdManager().close();
         endpoint.removeConnection(this.connection);
     }
 
@@ -434,6 +437,9 @@ final class ConnectionTerminatorImpl implements ConnectionTerminator {
         final QuicPacket packet = connection.newQuicPacket(keySpace, List.of(toSend));
         final ProtectionRecord protectionRecord = ProtectionRecord.single(packet,
                 connection::allocateDatagramForEncryption);
+        // close the connection ID managers; any in-flight connection ID changes should be ignored.
+        connection.localConnectionIdManager().close();
+        connection.peerConnectionIdManager().close();
         // while sending the packet containing the CONNECTION_CLOSE frame, the pushDatagram will
         // remap the QuicConnectionImpl in QuicEndpoint.
         connection.pushDatagram(protectionRecord);
diff --git a/src/java.net.http/share/classes/jdk/internal/net/http/quic/PeerConnIdManager.java b/src/java.net.http/share/classes/jdk/internal/net/http/quic/PeerConnIdManager.java
index 2bc759a920a..0646026e28b 100644
--- a/src/java.net.http/share/classes/jdk/internal/net/http/quic/PeerConnIdManager.java
+++ b/src/java.net.http/share/classes/jdk/internal/net/http/quic/PeerConnIdManager.java
@@ -65,6 +65,7 @@ final class PeerConnIdManager {
     private final QuicConnectionImpl connection;
     private final String logTag;
     private final boolean isClient;
+    private boolean closed; // when true, no more reset tokens are registered
 
     private enum State {
         INITIAL_PKT_NOT_RECEIVED_FROM_PEER,
@@ -267,6 +268,7 @@ final class PeerConnIdManager {
             if (handshakeConnId == null) {
                 throw new IllegalStateException("No handshake peer connection available");
             }
+            if (closed) return;
             // recreate the conn id with the stateless token
             this.peerConnectionIds.put(0L, new PeerConnectionId(handshakeConnId.asReadOnlyBuffer(),
                     statelessResetToken));
@@ -283,6 +285,10 @@ final class PeerConnIdManager {
     public List<byte[]> activeResetTokens() {
         lock.lock();
         try {
+            // this method is currently only used to remove a connection from the endpoint
+            // after the connection is closed.
+            // The below assert can be removed if the method is needed elsewhere.
+            assert closed;
             // we only support one active connection ID at the time
             PeerConnectionId cid = peerConnectionIds.get(activeConnIdSeq);
             byte[] statelessResetToken = null;
@@ -305,7 +311,7 @@ final class PeerConnIdManager {
     QuicConnectionId getPeerConnId() {
         lock.lock();
         try {
-            if (activeConnIdSeq < largestReceivedRetirePriorTo) {
+            if (activeConnIdSeq < largestReceivedRetirePriorTo && !closed) {
                 // stop using the old connection ID
                 switchConnectionId();
             }
@@ -496,9 +502,11 @@ final class PeerConnIdManager {
             // connection ids. It does however store the peer-issued stateless reset token of a
             // peer connection id, so we let the endpoint know that the stateless reset token needs
             // to be forgotten since the corresponding peer connection id is being retired
-            final byte[] resetTokenToForget = entry.getValue().getStatelessResetToken();
-            if (resetTokenToForget != null) {
-                this.connection.endpoint().forgetStatelessResetToken(resetTokenToForget);
+            if (seqNumToRetire == activeConnIdSeq) {
+                final byte[] resetTokenToForget = entry.getValue().getStatelessResetToken();
+                if (resetTokenToForget != null) {
+                    this.connection.endpoint().forgetStatelessResetToken(resetTokenToForget);
+                }
             }
         }
         for (Iterator<Long> iterator = gaps.iterator(); iterator.hasNext(); ) {
@@ -540,4 +548,13 @@ final class PeerConnIdManager {
             lock.unlock();
         }
     }
+
+    public void close() {
+        lock.lock();
+        try {
+            closed = true;
+        } finally {
+            lock.unlock();
+        }
+    }
 }
diff --git a/src/java.net.http/share/classes/jdk/internal/net/http/quic/QuicConnectionImpl.java b/src/java.net.http/share/classes/jdk/internal/net/http/quic/QuicConnectionImpl.java
index 41b814a551c..b13d49ead7d 100644
--- a/src/java.net.http/share/classes/jdk/internal/net/http/quic/QuicConnectionImpl.java
+++ b/src/java.net.http/share/classes/jdk/internal/net/http/quic/QuicConnectionImpl.java
@@ -1758,6 +1758,10 @@ public class QuicConnectionImpl extends QuicConnection implements QuicPacketRece
         return localConnIdManager;
     }
 
+    PeerConnIdManager peerConnectionIdManager() {
+        return peerConnIdManager;
+    }
+
     /**
      * {@return the local connection id}
      */
diff --git a/src/java.net.http/share/classes/jdk/internal/net/http/quic/QuicEndpoint.java b/src/java.net.http/share/classes/jdk/internal/net/http/quic/QuicEndpoint.java
index ef342d4cb56..3dee814e1f1 100644
--- a/src/java.net.http/share/classes/jdk/internal/net/http/quic/QuicEndpoint.java
+++ b/src/java.net.http/share/classes/jdk/internal/net/http/quic/QuicEndpoint.java
@@ -1532,12 +1532,16 @@ public abstract sealed class QuicEndpoint implements AutoCloseable
      */
     void removeConnection(final QuicPacketReceiver connection) {
         if (debug.on()) debug.log("removing connection " + connection);
-        // remove the connection completely
-        connection.connectionIds().forEach(connections::remove);
-        assert !connections.containsValue(connection) : connection;
         // remove references to this connection from the map which holds the peer issued
         // reset tokens
         dropPeerIssuedResetTokensFor(connection);
+        // remove the connection completely
+        connection.connectionIds().forEach(connections::remove);
+        assert !connections.containsValue(connection) : connection;
+        // Check that if there are no connections, there are no reset tokens either.
+        // This is safe because connections are added before reset tokens and removed after,
+        // except when we're closing the endpoint and don't bother with removing tokens.
+        assert peerIssuedResetTokens.isEmpty() || !connections.isEmpty() || closed : peerIssuedResetTokens;
     }
 
     /**
@@ -1587,7 +1591,6 @@ public abstract sealed class QuicEndpoint implements AutoCloseable
         if (closed) return;
 
         final long idleTimeout = connection.peerPtoMs() * 3; // 3 PTO
-        connection.localConnectionIdManager().close();
         DrainingConnection draining = new DrainingConnection(connection.connectionIds(),
                 connection.activeResetTokens(), idleTimeout);
         // we can ignore stateless reset in the draining state.
@@ -1626,7 +1629,6 @@ public abstract sealed class QuicEndpoint implements AutoCloseable
         closingDatagram.flip();
 
         final long idleTimeout = connection.peerPtoMs() * 3; // 3 PTO
-        connection.localConnectionIdManager().close();
         var closingConnection = new ClosingConnection(connection.connectionIds(),
                 connection.activeResetTokens(), idleTimeout, datagram);
         remapPeerIssuedResetToken(closingConnection);
diff --git a/test/jdk/java/net/httpclient/CancelRequestTest.java b/test/jdk/java/net/httpclient/CancelRequestTest.java
index df808ad2dab..dcb60a55061 100644
--- a/test/jdk/java/net/httpclient/CancelRequestTest.java
+++ b/test/jdk/java/net/httpclient/CancelRequestTest.java
@@ -23,7 +23,7 @@
 
 /*
  * @test
- * @bug 8245462 8229822 8254786 8297075 8297149 8298340 8302635
+ * @bug 8245462 8229822 8254786 8297075 8297149 8298340 8302635 8377181
  * @summary Tests cancelling the request.
  * @library /test/lib /test/jdk/java/net/httpclient/lib
  * @key randomness
diff --git a/test/jdk/java/net/httpclient/http3/H3ErrorHandlingTest.java b/test/jdk/java/net/httpclient/http3/H3ErrorHandlingTest.java
index 8dfef7417e3..8e20eac95fa 100644
--- a/test/jdk/java/net/httpclient/http3/H3ErrorHandlingTest.java
+++ b/test/jdk/java/net/httpclient/http3/H3ErrorHandlingTest.java
@@ -71,7 +71,7 @@ import static org.junit.jupiter.api.Assertions.*;
 
 /*
  * @test
- * @bug 8373409
+ * @bug 8373409 8377181
  * @key intermittent
  * @comment testResetControlStream may fail if the client doesn't read the stream type
  *              before the stream is reset,

From f8ca6f6f09908c5106d262cfaaf82e88f37e9a32 Mon Sep 17 00:00:00 2001
From: Dingli Zhang <dzhang@openjdk.org>
Date: Fri, 3 Apr 2026 06:15:19 +0000
Subject: [PATCH 483/655] 8381554: RISC-V: Small refactoring for
 cmp_klass_compressed macro-assembler routine

Reviewed-by: fyang, gcao, wenanjian
---
 .../riscv/c1_LIRAssembler_arraycopy_riscv.cpp | 52 ++++++++-----------
 .../riscv/c1_LIRAssembler_arraycopy_riscv.hpp |  3 +-
 .../cpu/riscv/macroAssembler_riscv.cpp        | 25 ++++++---
 .../cpu/riscv/macroAssembler_riscv.hpp        |  9 +++-
 4 files changed, 49 insertions(+), 40 deletions(-)

diff --git a/src/hotspot/cpu/riscv/c1_LIRAssembler_arraycopy_riscv.cpp b/src/hotspot/cpu/riscv/c1_LIRAssembler_arraycopy_riscv.cpp
index 58eb1a55553..8aced227a06 100644
--- a/src/hotspot/cpu/riscv/c1_LIRAssembler_arraycopy_riscv.cpp
+++ b/src/hotspot/cpu/riscv/c1_LIRAssembler_arraycopy_riscv.cpp
@@ -240,35 +240,6 @@ void LIR_Assembler::arraycopy_type_check(Register src, Register src_pos, Registe
   }
 }
 
-void LIR_Assembler::arraycopy_assert(Register src, Register dst, Register tmp, ciArrayKlass *default_type, int flags) {
-  assert(default_type != nullptr, "null default_type!");
-  BasicType basic_type = default_type->element_type()->basic_type();
-  if (basic_type == T_ARRAY) { basic_type = T_OBJECT; }
-  if (basic_type != T_OBJECT || !(flags & LIR_OpArrayCopy::type_check)) {
-    // Sanity check the known type with the incoming class.  For the
-    // primitive case the types must match exactly with src.klass and
-    // dst.klass each exactly matching the default type.  For the
-    // object array case, if no type check is needed then either the
-    // dst type is exactly the expected type and the src type is a
-    // subtype which we can't check or src is the same array as dst
-    // but not necessarily exactly of type default_type.
-    Label known_ok, halt;
-    __ mov_metadata(tmp, default_type->constant_encoding());
-    __ encode_klass_not_null(tmp);
-
-    if (basic_type != T_OBJECT) {
-      __ cmp_klass_compressed(dst, tmp, t0, halt, false);
-      __ cmp_klass_compressed(src, tmp, t0, known_ok, true);
-    } else {
-      __ cmp_klass_compressed(dst, tmp, t0, known_ok, true);
-      __ beq(src, dst, known_ok);
-    }
-    __ bind(halt);
-    __ stop("incorrect type information in arraycopy");
-    __ bind(known_ok);
-  }
-}
-
 void LIR_Assembler::emit_arraycopy(LIR_OpArrayCopy* op) {
   ciArrayKlass *default_type = op->expected_type();
   Register src = op->src()->as_register();
@@ -299,7 +270,28 @@ void LIR_Assembler::emit_arraycopy(LIR_OpArrayCopy* op) {
   }
 
 #ifdef ASSERT
-  arraycopy_assert(src, dst, tmp, default_type, flags);
+  if (basic_type != T_OBJECT || !(flags & LIR_OpArrayCopy::type_check)) {
+    // Sanity check the known type with the incoming class.  For the
+    // primitive case the types must match exactly with src.klass and
+    // dst.klass each exactly matching the default type.  For the
+    // object array case, if no type check is needed then either the
+    // dst type is exactly the expected type and the src type is a
+    // subtype which we can't check or src is the same array as dst
+    // but not necessarily exactly of type default_type.
+    Label known_ok, halt;
+    __ mov_metadata(tmp, default_type->constant_encoding());
+
+    if (basic_type != T_OBJECT) {
+      __ cmp_klass_bne(dst, tmp, t0, t1, halt);
+      __ cmp_klass_beq(src, tmp, t0, t1, known_ok);
+    } else {
+      __ cmp_klass_beq(dst, tmp, t0, t1, known_ok);
+      __ beq(src, dst, known_ok);
+    }
+    __ bind(halt);
+    __ stop("incorrect type information in arraycopy");
+    __ bind(known_ok);
+  }
 #endif
 
 #ifndef PRODUCT
diff --git a/src/hotspot/cpu/riscv/c1_LIRAssembler_arraycopy_riscv.hpp b/src/hotspot/cpu/riscv/c1_LIRAssembler_arraycopy_riscv.hpp
index 06a0f248ca6..b5452f3e4cd 100644
--- a/src/hotspot/cpu/riscv/c1_LIRAssembler_arraycopy_riscv.hpp
+++ b/src/hotspot/cpu/riscv/c1_LIRAssembler_arraycopy_riscv.hpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2000, 2019, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2000, 2026, Oracle and/or its affiliates. All rights reserved.
  * Copyright (c) 2020, 2021, Huawei Technologies Co., Ltd. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
@@ -39,7 +39,6 @@
   void arraycopy_type_check(Register src, Register src_pos, Register length,
                             Register dst, Register dst_pos, Register tmp,
                             CodeStub *stub, BasicType basic_type, int flags);
-  void arraycopy_assert(Register src, Register dst, Register tmp, ciArrayKlass *default_type, int flags);
   void arraycopy_prepare_params(Register src, Register src_pos, Register length,
                                 Register dst, Register dst_pos, BasicType basic_type);
   void arraycopy_checkcast_prepare_params(Register src, Register src_pos, Register length,
diff --git a/src/hotspot/cpu/riscv/macroAssembler_riscv.cpp b/src/hotspot/cpu/riscv/macroAssembler_riscv.cpp
index b0305fa2977..d031161db87 100644
--- a/src/hotspot/cpu/riscv/macroAssembler_riscv.cpp
+++ b/src/hotspot/cpu/riscv/macroAssembler_riscv.cpp
@@ -3511,17 +3511,30 @@ void MacroAssembler::orptr(Address adr, RegisterOrConstant src, Register tmp1, R
   sd(tmp1, adr);
 }
 
-void MacroAssembler::cmp_klass_compressed(Register oop, Register trial_klass, Register tmp, Label &L, bool equal) {
+void MacroAssembler::cmp_klass_beq(Register obj, Register klass,
+                                   Register tmp1, Register tmp2,
+                                   Label &L, bool is_far) {
+  assert_different_registers(obj, klass, tmp1, tmp2);
   if (UseCompactObjectHeaders) {
-    load_narrow_klass_compact(tmp, oop);
+    load_narrow_klass_compact(tmp1, obj);
   } else {
-    lwu(tmp, Address(oop, oopDesc::klass_offset_in_bytes()));
+    lwu(tmp1, Address(obj, oopDesc::klass_offset_in_bytes()));
   }
-  if (equal) {
-    beq(trial_klass, tmp, L);
+  decode_klass_not_null(tmp1, tmp2);
+  beq(klass, tmp1, L, is_far);
+}
+
+void MacroAssembler::cmp_klass_bne(Register obj, Register klass,
+                                   Register tmp1, Register tmp2,
+                                   Label &L, bool is_far) {
+  assert_different_registers(obj, klass, tmp1, tmp2);
+  if (UseCompactObjectHeaders) {
+    load_narrow_klass_compact(tmp1, obj);
   } else {
-    bne(trial_klass, tmp, L);
+    lwu(tmp1, Address(obj, oopDesc::klass_offset_in_bytes()));
   }
+  decode_klass_not_null(tmp1, tmp2);
+  bne(klass, tmp1, L, is_far);
 }
 
 // Move an oop into a register.
diff --git a/src/hotspot/cpu/riscv/macroAssembler_riscv.hpp b/src/hotspot/cpu/riscv/macroAssembler_riscv.hpp
index f5e985c28a2..95821c29eec 100644
--- a/src/hotspot/cpu/riscv/macroAssembler_riscv.hpp
+++ b/src/hotspot/cpu/riscv/macroAssembler_riscv.hpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1997, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
  * Copyright (c) 2014, 2020, Red Hat Inc. All rights reserved.
  * Copyright (c) 2020, 2024, Huawei Technologies Co., Ltd. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
@@ -198,7 +198,12 @@ class MacroAssembler: public Assembler {
   void load_klass(Register dst, Register src, Register tmp = t0);
   void load_narrow_klass_compact(Register dst, Register src);
   void store_klass(Register dst, Register src, Register tmp = t0);
-  void cmp_klass_compressed(Register oop, Register trial_klass, Register tmp, Label &L, bool equal);
+  void cmp_klass_beq(Register obj, Register klass,
+                     Register tmp1, Register tmp2,
+                     Label &L, bool is_far = false);
+  void cmp_klass_bne(Register obj, Register klass,
+                     Register tmp1, Register tmp2,
+                     Label &L, bool is_far = false);
 
   void encode_klass_not_null(Register r, Register tmp = t0);
   void decode_klass_not_null(Register r, Register tmp = t0);

From 4a4701106c68aee7ba33c41d1e4f72d72ac1a3d6 Mon Sep 17 00:00:00 2001
From: Emanuel Peter <epeter@openjdk.org>
Date: Fri, 3 Apr 2026 12:39:49 +0000
Subject: [PATCH 484/655] 8369699: Template Framework Library: add VectorAPI
 types and operations

Reviewed-by: mhaessig, vlivanov, galder
---
 .../jtreg/compiler/igvn/ExpressionFuzzer.java |   9 +-
 .../library/CodeGenerationDataNameType.java   |  78 ++-
 .../library/Expression.java                   |  68 ++-
 .../library/Operations.java                   | 548 +++++++++++++++++-
 .../library/PrimitiveType.java                |  17 +
 .../lib/template_framework/library/Utils.java |  41 ++
 .../library/VectorType.java                   | 237 ++++++++
 .../vectorapi/VectorExpressionFuzzer.java     | 345 +++++++++++
 .../examples/TestExpressions.java             |  21 +-
 .../examples/TestPrimitiveTypes.java          |  12 +
 .../examples/TestVectorTypes.java             | 134 +++++
 11 files changed, 1479 insertions(+), 31 deletions(-)
 create mode 100644 test/hotspot/jtreg/compiler/lib/template_framework/library/Utils.java
 create mode 100644 test/hotspot/jtreg/compiler/lib/template_framework/library/VectorType.java
 create mode 100644 test/hotspot/jtreg/compiler/vectorapi/VectorExpressionFuzzer.java
 create mode 100644 test/hotspot/jtreg/testlibrary_tests/template_framework/examples/TestVectorTypes.java

diff --git a/test/hotspot/jtreg/compiler/igvn/ExpressionFuzzer.java b/test/hotspot/jtreg/compiler/igvn/ExpressionFuzzer.java
index 33be24a0367..dfb2ec1405c 100644
--- a/test/hotspot/jtreg/compiler/igvn/ExpressionFuzzer.java
+++ b/test/hotspot/jtreg/compiler/igvn/ExpressionFuzzer.java
@@ -30,7 +30,7 @@
  * @modules jdk.incubator.vector
  * @library /test/lib /
  * @compile ../lib/verify/Verify.java
- * @run main/othervm -XX:+IgnoreUnrecognizedVMOptions -XX:CompileTaskTimeout=10000 compiler.igvn.ExpressionFuzzer
+ * @run driver compiler.igvn.ExpressionFuzzer
  */
 
 package compiler.igvn;
@@ -73,6 +73,10 @@ import static compiler.lib.template_framework.library.CodeGenerationDataNameType
 // - Some basic IR tests to ensure that the constraints / checksum mechanics work.
 //   We may even have to add some IGVN optimizations to be able to better observe things right.
 // - Lower the CompileTaskTimeout, if possible. It is chosen conservatively (rather high) for now.
+// - I also had to exclude the compilation of the following method. It would lead to compilation
+//   timeouts and even compilation memory limit reached. It is a really large method, so I'm not
+//   sure if that is to be expected, or if we could still improve the situation.
+//   compiler.lib.template_framework.library.Operations::generateVectorOperations
 public class ExpressionFuzzer {
     private static final Random RANDOM = Utils.getRandomInstance();
 
@@ -93,7 +97,8 @@ public class ExpressionFuzzer {
         comp.invoke("compiler.igvn.templated.ExpressionFuzzerInnerTest", "main", new Object[] {new String[] {
             "--add-modules=jdk.incubator.vector",
             "--add-opens", "jdk.incubator.vector/jdk.incubator.vector=ALL-UNNAMED",
-            "--add-opens", "java.base/java.lang=ALL-UNNAMED"
+            "--add-opens", "java.base/java.lang=ALL-UNNAMED",
+            "-XX:+IgnoreUnrecognizedVMOptions", "-XX:CompileTaskTimeout=10000"
         }});
     }
 
diff --git a/test/hotspot/jtreg/compiler/lib/template_framework/library/CodeGenerationDataNameType.java b/test/hotspot/jtreg/compiler/lib/template_framework/library/CodeGenerationDataNameType.java
index b461e3e857f..33eba66cd8c 100644
--- a/test/hotspot/jtreg/compiler/lib/template_framework/library/CodeGenerationDataNameType.java
+++ b/test/hotspot/jtreg/compiler/lib/template_framework/library/CodeGenerationDataNameType.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2025, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -132,6 +132,14 @@ public interface CodeGenerationDataNameType extends DataName.Type {
         longs()
     );
 
+    /**
+     * List of {@link PrimitiveType}s (int, long).
+     */
+    List<PrimitiveType> INT_LONG_TYPES = List.of(
+        ints(),
+        longs()
+    );
+
     /**
      * List of all subword {@link PrimitiveType}s (byte, char, short).
      */
@@ -176,4 +184,72 @@ public interface CodeGenerationDataNameType extends DataName.Type {
         booleans(),
         float16()
     );
+
+    List<VectorType.Vector> VECTOR_BYTE_VECTOR_TYPES = List.of(
+        VectorType.BYTE_64,
+        VectorType.BYTE_128,
+        VectorType.BYTE_256,
+        VectorType.BYTE_512
+    );
+
+    List<VectorType.Vector> VECTOR_SHORT_VECTOR_TYPES = List.of(
+        VectorType.SHORT_64,
+        VectorType.SHORT_128,
+        VectorType.SHORT_256,
+        VectorType.SHORT_512
+    );
+
+    List<VectorType.Vector> VECTOR_INT_VECTOR_TYPES = List.of(
+        VectorType.INT_64,
+        VectorType.INT_128,
+        VectorType.INT_256,
+        VectorType.INT_512
+    );
+
+    List<VectorType.Vector> VECTOR_LONG_VECTOR_TYPES = List.of(
+        VectorType.LONG_64,
+        VectorType.LONG_128,
+        VectorType.LONG_256,
+        VectorType.LONG_512
+    );
+
+    List<VectorType.Vector> VECTOR_FLOAT_VECTOR_TYPES = List.of(
+        VectorType.FLOAT_64,
+        VectorType.FLOAT_128,
+        VectorType.FLOAT_256,
+        VectorType.FLOAT_512
+    );
+
+    List<VectorType.Vector> VECTOR_DOUBLE_VECTOR_TYPES = List.of(
+        VectorType.DOUBLE_64,
+        VectorType.DOUBLE_128,
+        VectorType.DOUBLE_256,
+        VectorType.DOUBLE_512
+    );
+
+    List<VectorType.Vector> VECTOR_VECTOR_TYPES = Utils.concat(
+        VECTOR_BYTE_VECTOR_TYPES,
+        VECTOR_SHORT_VECTOR_TYPES,
+        VECTOR_INT_VECTOR_TYPES,
+        VECTOR_LONG_VECTOR_TYPES,
+        VECTOR_FLOAT_VECTOR_TYPES,
+        VECTOR_DOUBLE_VECTOR_TYPES
+    );
+
+    List<VectorType.Mask> VECTOR_MASK_TYPES =
+        VECTOR_VECTOR_TYPES.stream().map(t -> t.maskType).toList();
+
+    List<VectorType.Shuffle> VECTOR_SHUFFLE_TYPES =
+        VECTOR_VECTOR_TYPES.stream().map(t -> t.shuffleType).toList();
+
+    List<VectorType> VECTOR_TYPES = Utils.concat(
+        VECTOR_VECTOR_TYPES,
+        VECTOR_MASK_TYPES,
+        VECTOR_SHUFFLE_TYPES
+    );
+
+    List<CodeGenerationDataNameType> ALL_TYPES = Utils.concat(
+        SCALAR_NUMERIC_TYPES,
+        VECTOR_TYPES
+    );
 }
diff --git a/test/hotspot/jtreg/compiler/lib/template_framework/library/Expression.java b/test/hotspot/jtreg/compiler/lib/template_framework/library/Expression.java
index 37ad4debde6..f3e7b6ed0d3 100644
--- a/test/hotspot/jtreg/compiler/lib/template_framework/library/Expression.java
+++ b/test/hotspot/jtreg/compiler/lib/template_framework/library/Expression.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2025, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -332,6 +332,72 @@ public class Expression {
         return new Expression(returnType, List.of(t0, t1, t2, t3), List.of(s0, s1, s2, s3, s4), info);
     }
 
+    /**
+     * Creates a new Expression with 5 arguments.
+     *
+     * @param returnType The return type of the {@link Expression}.
+     * @param s0 The first string, to be placed before {@code t0}.
+     * @param t0 The type of the first argument.
+     * @param s1 The second string, to be placed before {@code t1}.
+     * @param t1 The type of the second argument.
+     * @param s2 The third string, to be placed before {@code t2}.
+     * @param t2 The type of the third argument.
+     * @param s3 The fourth string, to be placed before {@code t3}.
+     * @param t3 The type of the fourth argument.
+     * @param s4 The fifth string, to be placed before {@code t4}.
+     * @param t4 The type of the fifth argument.
+     * @param s5 The last string, finishing the {@link Expression}.
+     * @return the new {@link Expression}.
+     */
+    public static Expression make(CodeGenerationDataNameType returnType,
+                                  String s0,
+                                  CodeGenerationDataNameType t0,
+                                  String s1,
+                                  CodeGenerationDataNameType t1,
+                                  String s2,
+                                  CodeGenerationDataNameType t2,
+                                  String s3,
+                                  CodeGenerationDataNameType t3,
+                                  String s4,
+                                  CodeGenerationDataNameType t4,
+                                  String s5) {
+        return make(returnType, s0, t0, s1, t1, s2, t2, s3, t3, s4, t4, s5, new Info());
+    }
+
+    /**
+     * Creates a new Expression with 5 arguments.
+     *
+     * @param returnType The return type of the {@link Expression}.
+     * @param s0 The first string, to be placed before {@code t0}.
+     * @param t0 The type of the first argument.
+     * @param s1 The second string, to be placed before {@code t1}.
+     * @param t1 The type of the second argument.
+     * @param s2 The third string, to be placed before {@code t2}.
+     * @param t2 The type of the third argument.
+     * @param s3 The fourth string, to be placed before {@code t3}.
+     * @param t3 The type of the fourth argument.
+     * @param s4 The fifth string, to be placed before {@code t4}.
+     * @param t4 The type of the fifth argument.
+     * @param s5 The last string, finishing the {@link Expression}.
+     * @param info Additional information about the {@link Expression}.
+     * @return the new {@link Expression}.
+     */
+    public static Expression make(CodeGenerationDataNameType returnType,
+                                  String s0,
+                                  CodeGenerationDataNameType t0,
+                                  String s1,
+                                  CodeGenerationDataNameType t1,
+                                  String s2,
+                                  CodeGenerationDataNameType t2,
+                                  String s3,
+                                  CodeGenerationDataNameType t3,
+                                  String s4,
+                                  CodeGenerationDataNameType t4,
+                                  String s5,
+                                  Info info) {
+        return new Expression(returnType, List.of(t0, t1, t2, t3, t4), List.of(s0, s1, s2, s3, s4, s5), info);
+    }
+
     /**
      * Creates a {@link TemplateToken} for the use in a {@link Template} by applying the
      * {@code arguments} to the {@link Expression}. It is the users responsibility to
diff --git a/test/hotspot/jtreg/compiler/lib/template_framework/library/Operations.java b/test/hotspot/jtreg/compiler/lib/template_framework/library/Operations.java
index 2ea251cc5e5..4c598506e70 100644
--- a/test/hotspot/jtreg/compiler/lib/template_framework/library/Operations.java
+++ b/test/hotspot/jtreg/compiler/lib/template_framework/library/Operations.java
@@ -24,11 +24,8 @@
 package compiler.lib.template_framework.library;
 
 import java.util.ArrayList;
-import java.util.Arrays;
 import java.util.List;
 import java.util.Set;
-import java.util.stream.Collectors;
-import java.util.stream.Stream;
 
 import static compiler.lib.template_framework.library.PrimitiveType.BYTES;
 import static compiler.lib.template_framework.library.PrimitiveType.SHORTS;
@@ -39,6 +36,10 @@ import static compiler.lib.template_framework.library.PrimitiveType.FLOATS;
 import static compiler.lib.template_framework.library.PrimitiveType.DOUBLES;
 import static compiler.lib.template_framework.library.PrimitiveType.BOOLEANS;
 import static compiler.lib.template_framework.library.Float16Type.FLOAT16;
+import static compiler.lib.template_framework.library.CodeGenerationDataNameType.PRIMITIVE_TYPES;
+import static compiler.lib.template_framework.library.CodeGenerationDataNameType.INTEGRAL_TYPES;
+import static compiler.lib.template_framework.library.CodeGenerationDataNameType.FLOATING_TYPES;
+import static compiler.lib.template_framework.library.CodeGenerationDataNameType.INT_LONG_TYPES;
 
 /**
  * This class provides various lists of {@link Expression}s, that represent Java operators or library
@@ -51,27 +52,8 @@ public final class Operations {
 
     private static Expression.Info WITH_ARITHMETIC_EXCEPTION = new Expression.Info().withExceptions(Set.of("ArithmeticException"));
     private static Expression.Info WITH_NONDETERMINISTIC_RESULT = new Expression.Info().withNondeterministicResult();
-
-
-    /**
-     * Provides a lits of operations on {@link PrimitiveType}s, such as arithmetic, logical,
-     * and cast operations.
-     */
-    public static final List<Expression> PRIMITIVE_OPERATIONS = generatePrimitiveOperations();
-
-    public static final List<Expression> FLOAT16_OPERATIONS = generateFloat16Operations();
-
-    public static final List<Expression> SCALAR_NUMERIC_OPERATIONS = concat(
-            PRIMITIVE_OPERATIONS,
-            FLOAT16_OPERATIONS
-    );
-
-    @SafeVarargs
-    private static List<Expression> concat(List<Expression>... lists) {
-        return Arrays.stream(lists)
-                     .flatMap(List::stream)
-                     .collect(Collectors.toList());
-    }
+    private static Expression.Info WITH_ILLEGAL_ARGUMENT_EXCEPTION = new Expression.Info().withExceptions(Set.of("IllegalArgumentException"));
+    private static Expression.Info WITH_OUT_OF_BOUNDS_EXCEPTION = new Expression.Info().withExceptions(Set.of("IndexOutOfBoundsException"));
 
     private static void addComparisonOperations(List<Expression> ops, String operatorName, CodeGenerationDataNameType type) {
         for (String mask : List.of("==", "!=", "<", ">", "<=", ">=")) {
@@ -332,4 +314,522 @@ public final class Operations {
         // Make sure the list is not modifiable.
         return List.copyOf(ops);
     }
+
+    private enum VOPType {
+        UNARY,
+        BINARY,
+        ASSOCIATIVE, // Binary and associative - safe for reductions of any type
+        INTEGRAL_ASSOCIATIVE, // Binary - but only safe for integral reductions
+        TERNARY
+    }
+    private record VOP(String name, VOPType type, List<PrimitiveType> elementTypes, boolean isDeterministic) {
+        VOP(String name, VOPType type, List<PrimitiveType> elementTypes) {
+            this(name, type, elementTypes, true);
+        }
+    }
+
+    // TODO: consider enforcing precision instead of just blanket non-determinism
+    //       We could annotate the exact ulp, and so if some test can use it: great
+    //       But if a test is just interested in determinism, they are still
+    //       non-deterministic.
+    private static final List<VOP> VECTOR_OPS = List.of(
+        new VOP("ABS",                  VOPType.UNARY,                PRIMITIVE_TYPES),
+        new VOP("ACOS",                 VOPType.UNARY,                FLOATING_TYPES,     false), // 1 ulp
+        new VOP("ADD",                  VOPType.INTEGRAL_ASSOCIATIVE, PRIMITIVE_TYPES),
+        new VOP("AND",                  VOPType.ASSOCIATIVE,          INTEGRAL_TYPES),
+        new VOP("AND_NOT",              VOPType.BINARY,               INTEGRAL_TYPES),
+        new VOP("ASHR",                 VOPType.BINARY,               INTEGRAL_TYPES),
+        new VOP("ASIN",                 VOPType.UNARY,                FLOATING_TYPES,     false), // 1 ulp
+        new VOP("ATAN",                 VOPType.UNARY,                FLOATING_TYPES,     false), // 1 ulp
+        new VOP("ATAN2",                VOPType.BINARY,               FLOATING_TYPES,     false), // 2 ulp
+        new VOP("BIT_COUNT",            VOPType.UNARY,                INTEGRAL_TYPES),
+        new VOP("BITWISE_BLEND",        VOPType.TERNARY,              INTEGRAL_TYPES),
+        new VOP("CBRT",                 VOPType.UNARY,                FLOATING_TYPES,     false), // 1 ulp
+        new VOP("COMPRESS_BITS",        VOPType.BINARY,               INT_LONG_TYPES),
+        new VOP("COS",                  VOPType.UNARY,                FLOATING_TYPES,     false), // 1 ulp
+        new VOP("COSH",                 VOPType.UNARY,                FLOATING_TYPES,     false), // 2.5 ulp
+        new VOP("DIV",                  VOPType.BINARY,               FLOATING_TYPES),
+        new VOP("EXP",                  VOPType.UNARY,                FLOATING_TYPES,     false), // 1 ulp
+        new VOP("EXPAND_BITS",          VOPType.BINARY,               INT_LONG_TYPES),
+        new VOP("EXPM1",                VOPType.UNARY,                FLOATING_TYPES,     false), // 1 ulp
+        new VOP("FIRST_NONZERO",        VOPType.ASSOCIATIVE,          PRIMITIVE_TYPES),
+        new VOP("FMA",                  VOPType.TERNARY,              FLOATING_TYPES),
+        new VOP("HYPOT",                VOPType.BINARY,               FLOATING_TYPES,     false), // 1.5 ulp
+        new VOP("LEADING_ZEROS_COUNT",  VOPType.UNARY,                INTEGRAL_TYPES),
+        new VOP("LOG",                  VOPType.UNARY,                FLOATING_TYPES,     false), // 1 ulp
+        new VOP("LOG10",                VOPType.UNARY,                FLOATING_TYPES,     false), // 1 ulp
+        new VOP("LOG1P",                VOPType.UNARY,                FLOATING_TYPES,     false), // 1 ulp
+        new VOP("LSHL",                 VOPType.BINARY,               INTEGRAL_TYPES),
+        new VOP("LSHR",                 VOPType.BINARY,               INTEGRAL_TYPES),
+        new VOP("MIN",                  VOPType.ASSOCIATIVE,          PRIMITIVE_TYPES),
+        new VOP("MAX",                  VOPType.ASSOCIATIVE,          PRIMITIVE_TYPES),
+        new VOP("MUL",                  VOPType.INTEGRAL_ASSOCIATIVE, PRIMITIVE_TYPES),
+        new VOP("NEG",                  VOPType.UNARY,                PRIMITIVE_TYPES),
+        new VOP("NOT",                  VOPType.UNARY,                INTEGRAL_TYPES),
+        new VOP("OR",                   VOPType.ASSOCIATIVE,          INTEGRAL_TYPES),
+        new VOP("POW",                  VOPType.BINARY,               FLOATING_TYPES,     false), // 1 ulp
+        new VOP("REVERSE",              VOPType.UNARY,                INTEGRAL_TYPES),
+        new VOP("REVERSE_BYTES",        VOPType.UNARY,                INTEGRAL_TYPES),
+        new VOP("ROL",                  VOPType.BINARY,               INTEGRAL_TYPES),
+        new VOP("ROR",                  VOPType.BINARY,               INTEGRAL_TYPES),
+        new VOP("SADD",                 VOPType.BINARY,               INTEGRAL_TYPES),
+        new VOP("SIN",                  VOPType.UNARY,                FLOATING_TYPES,     false), // 1 ulp
+        new VOP("SINH",                 VOPType.UNARY,                FLOATING_TYPES,     false), // 2.5 ulp
+        new VOP("SQRT",                 VOPType.UNARY,                FLOATING_TYPES),
+        new VOP("SSUB",                 VOPType.BINARY,               INTEGRAL_TYPES),
+        new VOP("SUADD",                VOPType.BINARY,               INTEGRAL_TYPES),
+        new VOP("SUB",                  VOPType.BINARY,               PRIMITIVE_TYPES),
+        new VOP("SUSUB",                VOPType.BINARY,               INTEGRAL_TYPES),
+        new VOP("TAN",                  VOPType.UNARY,                FLOATING_TYPES,     false), // 1.25 ulp
+        new VOP("TANH",                 VOPType.UNARY,                FLOATING_TYPES,     false), // 2.5 ulp
+        new VOP("TRAILING_ZEROS_COUNT", VOPType.UNARY,                INTEGRAL_TYPES),
+        new VOP("UMAX",                 VOPType.ASSOCIATIVE,          INTEGRAL_TYPES),
+        new VOP("UMIN",                 VOPType.ASSOCIATIVE,          INTEGRAL_TYPES),
+        new VOP("XOR",                  VOPType.ASSOCIATIVE,          INTEGRAL_TYPES),
+        new VOP("ZOMO",                 VOPType.UNARY,                INTEGRAL_TYPES)
+    );
+
+    private static final List<VOP> VECTOR_CMP = List.of(
+        new VOP("EQ",                   VOPType.ASSOCIATIVE, PRIMITIVE_TYPES),
+        new VOP("GE",                   VOPType.ASSOCIATIVE, PRIMITIVE_TYPES),
+        new VOP("GT",                   VOPType.ASSOCIATIVE, PRIMITIVE_TYPES),
+        new VOP("LE",                   VOPType.ASSOCIATIVE, PRIMITIVE_TYPES),
+        new VOP("LT",                   VOPType.ASSOCIATIVE, PRIMITIVE_TYPES),
+        new VOP("NE",                   VOPType.ASSOCIATIVE, PRIMITIVE_TYPES),
+        new VOP("UGE",                  VOPType.ASSOCIATIVE, INTEGRAL_TYPES),
+        new VOP("UGT",                  VOPType.ASSOCIATIVE, INTEGRAL_TYPES),
+        new VOP("ULE",                  VOPType.ASSOCIATIVE, INTEGRAL_TYPES),
+        new VOP("ULT",                  VOPType.ASSOCIATIVE, INTEGRAL_TYPES)
+    );
+
+    private static final List<VOP> VECTOR_TEST = List.of(
+        new VOP("IS_DEFAULT",           VOPType.UNARY, PRIMITIVE_TYPES),
+        new VOP("IS_NEGATIVE",          VOPType.UNARY, PRIMITIVE_TYPES),
+        new VOP("IS_FINITE",            VOPType.UNARY, FLOATING_TYPES),
+        new VOP("IS_NAN",               VOPType.UNARY, FLOATING_TYPES),
+        new VOP("IS_INFINITE",          VOPType.UNARY, FLOATING_TYPES)
+    );
+
+    // TODO: Conversion VectorOperators -> convertShape
+
+    private static List<Expression> generateVectorOperations() {
+        List<Expression> ops = new ArrayList<>();
+
+        for (var type : CodeGenerationDataNameType.VECTOR_VECTOR_TYPES) {
+            // ----------------- IntVector, FloatVector, ... --------------------
+            ops.add(Expression.make(type, "", type, ".abs()"));
+            ops.add(Expression.make(type, "", type, ".add(", type.elementType, ")"));
+            ops.add(Expression.make(type, "", type, ".add(", type.elementType, ", ", type.maskType, ")"));
+            ops.add(Expression.make(type, "", type, ".add(", type, ")"));
+            ops.add(Expression.make(type, "", type, ".add(", type, ", ", type.maskType, ")"));
+
+            // If VLENGTH*scale overflows, then a IllegalArgumentException is thrown.
+            ops.add(Expression.make(type, "", type, ".addIndex(1)"));
+            ops.add(Expression.make(type, "", type, ".addIndex(", INTS, ")", WITH_ILLEGAL_ARGUMENT_EXCEPTION));
+
+            if (!type.elementType.isFloating()) {
+                ops.add(Expression.make(type, "", type, ".and(", type.elementType, ")"));
+                ops.add(Expression.make(type, "", type, ".and(", type, ")"));
+                ops.add(Expression.make(type, "", type, ".bitwiseBlend(", type.elementType, ", ", type.elementType, ")"));
+                ops.add(Expression.make(type, "", type, ".bitwiseBlend(", type.elementType, ", ", type,             ")"));
+                ops.add(Expression.make(type, "", type, ".bitwiseBlend(", type,             ", ", type.elementType, ")"));
+                ops.add(Expression.make(type, "", type, ".bitwiseBlend(", type,             ", ", type,             ")"));
+                ops.add(Expression.make(type, "", type, ".not()"));
+                ops.add(Expression.make(type, "", type, ".or(", type.elementType, ")"));
+                ops.add(Expression.make(type, "", type, ".or(", type, ")"));
+            }
+
+            ops.add(Expression.make(type, "", type, ".blend(", type.elementType, ", ", type.maskType, ")"));
+            ops.add(Expression.make(type, "", type, ".blend(", LONGS, ", ", type.maskType, ")", WITH_ILLEGAL_ARGUMENT_EXCEPTION));
+            ops.add(Expression.make(type, "", type, ".blend(", type, ", ", type.maskType, ")"));
+
+            ops.add(Expression.make(type, type.name() + ".broadcast(" + type.speciesName + ", ", type.elementType, ")"));
+            ops.add(Expression.make(type, type.name() + ".broadcast(" + type.speciesName + ", ", LONGS, ")", WITH_ILLEGAL_ARGUMENT_EXCEPTION));
+
+            for (var type2 : CodeGenerationDataNameType.VECTOR_VECTOR_TYPES) {
+                ops.add(Expression.make(type, "((" + type.name() + ")", type2 , ".castShape(" + type.speciesName + ", 0))"));
+                ops.add(Expression.make(type, "((" + type.name() + ")", type2 , ".castShape(" + type.speciesName + ", ", INTS, "))", WITH_OUT_OF_BOUNDS_EXCEPTION));
+            }
+
+            // skip check
+
+            for (VOP cmp : VECTOR_CMP) {
+                if (cmp.elementTypes().contains(type.elementType)) {
+                    ops.add(Expression.make(type.maskType, "", type, ".compare(VectorOperators." + cmp.name() + ", ", type.elementType, ")"));
+                    ops.add(Expression.make(type.maskType, "", type, ".compare(VectorOperators." + cmp.name() + ", ", type.elementType, ", ", type.maskType, ")"));
+                    ops.add(Expression.make(type.maskType, "", type, ".compare(VectorOperators." + cmp.name() + ", ", LONGS, ")", WITH_ILLEGAL_ARGUMENT_EXCEPTION));
+                    ops.add(Expression.make(type.maskType, "", type, ".compare(VectorOperators." + cmp.name() + ", ", LONGS, ", ", type.maskType, ")", WITH_ILLEGAL_ARGUMENT_EXCEPTION));
+                    ops.add(Expression.make(type.maskType, "", type, ".compare(VectorOperators." + cmp.name() + ", ", type, ")"));
+                }
+            }
+
+            ops.add(Expression.make(type, "", type, ".compress(", type.maskType, ")"));
+
+            for (var type2 : CodeGenerationDataNameType.VECTOR_VECTOR_TYPES) {
+                // "convert" keeps the same shape, i.e. length of the vector in bits.
+                if (type.byteSize() == type2.byteSize()) {
+                    ops.add(Expression.make(type,
+                                                "((" + type.name() + ")",
+                                                type2,
+                                                ".convert(VectorOperators.Conversion.ofCast("
+                                                    + type2.elementType.name() +  ".class, "
+                                                    + type.elementType.name() + ".class), 0))"));
+                    ops.add(Expression.make(type,
+                                                "((" + type.name() + ")",
+                                                type2,
+                                                ".convert(VectorOperators.Conversion.ofCast("
+                                                    + type2.elementType.name() +  ".class, "
+                                                    + type.elementType.name() + ".class),",
+                                                INTS, // part
+                                                "))", WITH_OUT_OF_BOUNDS_EXCEPTION));
+                }
+
+                // Reinterpretation FROM floating is not safe, because of different NaN encodings, i.e.
+                // we will not get deterministic results.
+                var reinterpretInfo = type2.elementType.isFloating() ? WITH_NONDETERMINISTIC_RESULT : new Expression.Info();
+
+                // The following "reinterpret" operations require same input and output shape.
+                if (type.byteSize() == type2.byteSize()) {
+                    ops.add(Expression.make(type,
+                                            "((" + type.name() + ")",
+                                            type2,
+                                            ".convert(VectorOperators.Conversion.ofReinterpret("
+                                                + type2.elementType.name() +  ".class, "
+                                                + type.elementType.name() + ".class), 0))", reinterpretInfo));
+                    ops.add(Expression.make(type,
+                                            "((" + type.name() + ")",
+                                            type2,
+                                            ".convert(VectorOperators.Conversion.ofReinterpret("
+                                                + type2.elementType.name() +  ".class, "
+                                                + type.elementType.name() + ".class),",
+                                            INTS, // part
+                                            "))", reinterpretInfo.combineWith(WITH_OUT_OF_BOUNDS_EXCEPTION)));
+                    if (type.elementType == BYTES) {
+                        ops.add(Expression.make(type, "", type2, ".reinterpretAsBytes()", reinterpretInfo));
+                    }
+                    if (type.elementType == SHORTS) {
+                        ops.add(Expression.make(type, "", type2, ".reinterpretAsShorts()", reinterpretInfo));
+                    }
+                    if (type.elementType == INTS) {
+                        ops.add(Expression.make(type, "", type2, ".reinterpretAsInts()", reinterpretInfo));
+                    }
+                    if (type.elementType == LONGS) {
+                        ops.add(Expression.make(type, "", type2, ".reinterpretAsLongs()", reinterpretInfo));
+                    }
+                    if (type.elementType == FLOATS) {
+                        ops.add(Expression.make(type, "", type2, ".reinterpretAsFloats()", reinterpretInfo));
+                    }
+                    if (type.elementType == DOUBLES) {
+                        ops.add(Expression.make(type, "", type2, ".reinterpretAsDoubles()", reinterpretInfo));
+                    }
+                    if (type.elementType.isFloating() && type.elementType.byteSize() == type2.elementType.byteSize()) {
+                        ops.add(Expression.make(type, "", type2, ".viewAsFloatingLanes()", reinterpretInfo));
+                    }
+                    if (!type.elementType.isFloating() && type.elementType.byteSize() == type2.elementType.byteSize()) {
+                        ops.add(Expression.make(type, "", type2, ".viewAsIntegralLanes()", reinterpretInfo));
+                    }
+                }
+
+                // reinterpretShape
+                if (type2.byteSize() >= type.byteSize()) {
+                    // Output overflows, is truncated (Expansion): part >= 0
+                    int partMask = type2.byteSize() / type.byteSize() - 1;
+                    ops.add(Expression.make(type,
+                                            "((" + type.name() + ")",
+                                            type2,
+                                            ".reinterpretShape(" + type.speciesName + ", ",
+                                            INTS, " & " + partMask + "))", reinterpretInfo));
+                } else {
+                    // Logical output too small to fill output vector (Contraction): part <= 0
+                    int partMask = type.byteSize() / type2.byteSize() - 1;
+                    ops.add(Expression.make(type,
+                                            "((" + type.name() + ")",
+                                            type2,
+                                            ".reinterpretShape(" + type.speciesName + ", "
+                                            + "-(", INTS, " & " + partMask + ")))", reinterpretInfo));
+                }
+
+                // convertShape - Cast/Reinterpret
+                ops.add(Expression.make(type,
+                                        "((" + type.name() + ")",
+                                        type2,
+                                        ".convertShape(VectorOperators.Conversion.ofCast("
+                                            + type2.elementType.name() +  ".class, "
+                                            + type.elementType.name() + ".class), "
+                                        + type.speciesName + ", ",
+                                        INTS, // part
+                                        "))", WITH_OUT_OF_BOUNDS_EXCEPTION));
+                ops.add(Expression.make(type,
+                                        "((" + type.name() + ")",
+                                        type2,
+                                        ".convertShape(VectorOperators.Conversion.ofReinterpret("
+                                            + type2.elementType.name() +  ".class, "
+                                            + type.elementType.name() + ".class), "
+                                        + type.speciesName + ", ",
+                                        INTS, // part
+                                        "))", reinterpretInfo.combineWith(WITH_OUT_OF_BOUNDS_EXCEPTION)));
+                // Compute size of logical output, before it is "fit" into the output vector.
+                // Each element is cast/reinterpret individually, and so the logical output
+                // has the lane count of the input vector, and the element size that of the output element size.
+                // Note: reinterpret of float -> long means we expand each element from 4->8 bytes, and so
+                // we take the lower 4 bytes from the float and add 4 bytes of zero padding.
+                int conversionLogicalByteSize = type2.length * type.elementType.byteSize();
+                if (conversionLogicalByteSize >= type.byteSize()) {
+                    // Output overflows, is truncated (Expansion): part >= 0
+                    int partMask = conversionLogicalByteSize / type.byteSize() - 1;
+                    ops.add(Expression.make(type,
+                                            "((" + type.name() + ")",
+                                            type2,
+                                            ".convertShape(VectorOperators.Conversion.ofCast("
+                                                + type2.elementType.name() +  ".class, "
+                                                + type.elementType.name() + ".class), "
+                                            + type.speciesName + ", ",
+                                            INTS, " & " + partMask + "))"));
+                    ops.add(Expression.make(type,
+                                            "((" + type.name() + ")",
+                                            type2,
+                                            ".convertShape(VectorOperators.Conversion.ofReinterpret("
+                                                + type2.elementType.name() +  ".class, "
+                                                + type.elementType.name() + ".class), "
+                                            + type.speciesName + ", ",
+                                            INTS, " & " + partMask + "))", reinterpretInfo));
+                } else {
+                    // Logical output too small to fill output vector (Contraction): part <= 0
+                    int partMask = type.byteSize() / conversionLogicalByteSize - 1;
+                    ops.add(Expression.make(type,
+                                            "((" + type.name() + ")",
+                                            type2,
+                                            ".convertShape(VectorOperators.Conversion.ofCast("
+                                                + type2.elementType.name() +  ".class, "
+                                                + type.elementType.name() + ".class), "
+                                            + type.speciesName + ", "
+                                            + "-(", INTS, " & " + partMask + ")))"));
+                    ops.add(Expression.make(type,
+                                            "((" + type.name() + ")",
+                                            type2,
+                                            ".convertShape(VectorOperators.Conversion.ofReinterpret("
+                                                + type2.elementType.name() +  ".class, "
+                                                + type.elementType.name() + ".class), "
+                                            + type.speciesName + ", "
+                                            + "-(", INTS, " & " + partMask + ")))", reinterpretInfo));
+                }
+                // TODO: convertShape - using VectorOperators.I2S,REINTERPRET_I2F,ZERO_EXTEND_B2I etc.
+            }
+
+            ops.add(Expression.make(type, "", type, ".div(", type.elementType, ")", WITH_ARITHMETIC_EXCEPTION));
+            ops.add(Expression.make(type, "", type, ".div(", type.elementType, ", ", type.maskType, ")", WITH_ARITHMETIC_EXCEPTION));
+            ops.add(Expression.make(type, "", type, ".div(", type, ")", WITH_ARITHMETIC_EXCEPTION));
+            ops.add(Expression.make(type, "", type, ".div(", type, ", ", type.maskType, ")", WITH_ARITHMETIC_EXCEPTION));
+
+            ops.add(Expression.make(type.maskType, "", type, ".eq(", type.elementType, ")"));
+            ops.add(Expression.make(type.maskType, "", type, ".eq(", type, ")"));
+            // skip equals
+            ops.add(Expression.make(type, "", type, ".expand(", type.maskType, ")"));
+            // skip fromArray
+            // skip fromMemorySegment
+            // skip hashCode
+            // skip intoArray
+            // skip intoMemorySegment
+            // TODO: memory accesses. It is not clear yet if these are to be modeled as Expressions, or rather statements.
+            ops.add(Expression.make(type.elementType, "", type, ".lane(", INTS, " & " + (type.length-1) + ")"));
+            ops.add(Expression.make(type.elementType, "", type, ".lane(", INTS, ")", WITH_ILLEGAL_ARGUMENT_EXCEPTION));
+
+            for (VOP vop : VECTOR_OPS) {
+                var vopInfo = vop.isDeterministic ? new Expression.Info() : WITH_NONDETERMINISTIC_RESULT;
+                if (vop.elementTypes().contains(type.elementType)) {
+                    switch(vop.type()) {
+                    case VOPType.UNARY:
+                        ops.add(Expression.make(type, "", type, ".lanewise(VectorOperators." + vop.name() + ")", vopInfo));
+                        ops.add(Expression.make(type, "", type, ".lanewise(VectorOperators." + vop.name() + ", ", type.maskType, ")", vopInfo));
+                        break;
+                    case VOPType.ASSOCIATIVE:
+                    case VOPType.INTEGRAL_ASSOCIATIVE:
+                        if (vop.type() == VOPType.ASSOCIATIVE || !type.elementType.isFloating()) {
+                            ops.add(Expression.make(type.elementType, "", type, ".reduceLanes(VectorOperators." + vop.name() + ")", vopInfo));
+                            ops.add(Expression.make(type.elementType, "", type, ".reduceLanes(VectorOperators." + vop.name() + ", ", type.maskType, ")", vopInfo));
+                        }
+                        // fall-through
+                    case VOPType.BINARY:
+                        ops.add(Expression.make(type, "", type, ".lanewise(VectorOperators." + vop.name() + ", ", type.elementType, ")", vopInfo));
+                        ops.add(Expression.make(type, "", type, ".lanewise(VectorOperators." + vop.name() + ", ", type.elementType, ", ", type.maskType, ")", vopInfo));
+                        ops.add(Expression.make(type, "", type, ".lanewise(VectorOperators." + vop.name() + ", ", LONGS, ")", vopInfo.combineWith(WITH_ILLEGAL_ARGUMENT_EXCEPTION)));
+                        ops.add(Expression.make(type, "", type, ".lanewise(VectorOperators." + vop.name() + ", ", LONGS, ", ", type.maskType, ")", vopInfo.combineWith(WITH_ILLEGAL_ARGUMENT_EXCEPTION)));
+                        ops.add(Expression.make(type, "", type, ".lanewise(VectorOperators." + vop.name() + ", ", type, ")", vopInfo));
+                        ops.add(Expression.make(type, "", type, ".lanewise(VectorOperators." + vop.name() + ", ", type, ", ", type.maskType, ")", vopInfo));
+                        break;
+                    case VOPType.TERNARY:
+                        ops.add(Expression.make(type, "", type, ".lanewise(VectorOperators." + vop.name() + ", ", type.elementType, ", ", type.elementType, ")", vopInfo));
+                        ops.add(Expression.make(type, "", type, ".lanewise(VectorOperators." + vop.name() + ", ", type.elementType, ", ", type.elementType, ", ", type.maskType, ")", vopInfo));
+                        ops.add(Expression.make(type, "", type, ".lanewise(VectorOperators." + vop.name() + ", ", type.elementType, ", ", type, ")", vopInfo));
+                        ops.add(Expression.make(type, "", type, ".lanewise(VectorOperators." + vop.name() + ", ", type.elementType, ", ", type, ", ", type.maskType, ")", vopInfo));
+                        ops.add(Expression.make(type, "", type, ".lanewise(VectorOperators." + vop.name() + ", ", type, ", ", type.elementType, ")", vopInfo));
+                        ops.add(Expression.make(type, "", type, ".lanewise(VectorOperators." + vop.name() + ", ", type, ", ", type.elementType, ", ", type.maskType, ")", vopInfo));
+                        ops.add(Expression.make(type, "", type, ".lanewise(VectorOperators." + vop.name() + ", ", type, ", ", type, ")", vopInfo));
+                        ops.add(Expression.make(type, "", type, ".lanewise(VectorOperators." + vop.name() + ", ", type, ", ", type, ", ", type.maskType, ")", vopInfo));
+                        break;
+                    }
+                }
+            }
+
+            ops.add(Expression.make(type.maskType, "", type, ".lt(", type.elementType, ")"));
+            ops.add(Expression.make(type.maskType, "", type, ".lt(", type, ")"));
+
+            ops.add(Expression.make(type.maskType, "", type, ".maskAll(", BOOLEANS, ")"));
+
+            ops.add(Expression.make(type, "", type, ".max(", type.elementType, ")"));
+            ops.add(Expression.make(type, "", type, ".max(", type, ")"));
+            ops.add(Expression.make(type, "", type, ".min(", type.elementType, ")"));
+            ops.add(Expression.make(type, "", type, ".min(", type, ")"));
+
+            ops.add(Expression.make(type, "", type, ".mul(", type.elementType, ")"));
+            ops.add(Expression.make(type, "", type, ".mul(", type.elementType, ", ", type.maskType, ")"));
+            ops.add(Expression.make(type, "", type, ".mul(", type, ")"));
+            ops.add(Expression.make(type, "", type, ".mul(", type, ", ", type.maskType, ")"));
+
+            ops.add(Expression.make(type, "", type, ".neg()"));
+
+            ops.add(Expression.make(type, "", type, ".rearrange(", type.shuffleType, ")"));
+            ops.add(Expression.make(type, "", type, ".rearrange(", type.shuffleType, ", ", type, ")"));
+            ops.add(Expression.make(type, "", type, ".rearrange(", type.shuffleType, ", ", type.maskType, ")"));
+
+            ops.add(Expression.make(type, "", type, ".selectFrom(", type, ")"));
+            ops.add(Expression.make(type, "", type, ".selectFrom(", type, ", ", type, ")"));
+            ops.add(Expression.make(type, "", type, ".selectFrom(", type, ", ", type.maskType, ")"));
+
+            ops.add(Expression.make(type, "", type, ".slice(", INTS, ")", WITH_OUT_OF_BOUNDS_EXCEPTION));
+            ops.add(Expression.make(type, "", type, ".slice(", INTS, ", ", type, ")", WITH_OUT_OF_BOUNDS_EXCEPTION));
+            ops.add(Expression.make(type, "", type, ".slice(", INTS, ", ", type, ", ", type.maskType, ")", WITH_OUT_OF_BOUNDS_EXCEPTION));
+
+            ops.add(Expression.make(type, "", type, ".sub(", type.elementType, ")"));
+            ops.add(Expression.make(type, "", type, ".sub(", type.elementType, ", ", type.maskType, ")"));
+            ops.add(Expression.make(type, "", type, ".sub(", type, ")"));
+            ops.add(Expression.make(type, "", type, ".sub(", type, ", ", type.maskType, ")"));
+
+
+            for (VOP test : VECTOR_TEST) {
+                if (test.elementTypes().contains(type.elementType)) {
+                    ops.add(Expression.make(type.maskType, "", type, ".test(VectorOperators." + test.name() + ")"));
+                    ops.add(Expression.make(type.maskType, "", type, ".test(VectorOperators." + test.name() + ", ", type.maskType, ")"));
+                }
+            }
+
+            // skip toArray and friends
+
+            ops.add(Expression.make(type, "", type, ".unslice(", INTS, " & " + (type.length-1) + ")"));
+            ops.add(Expression.make(type, "", type, ".unslice(", INTS, ")", WITH_OUT_OF_BOUNDS_EXCEPTION));
+            ops.add(Expression.make(type, "", type, ".unslice(", INTS, " & " + (type.length-1) + ", ", type, ", ", INTS, " & 2)"));
+            ops.add(Expression.make(type, "", type, ".unslice(", INTS, ", ", type, ", 0)", WITH_OUT_OF_BOUNDS_EXCEPTION));
+            ops.add(Expression.make(type, "", type, ".unslice(", INTS, ", ", type, ", ", INTS, ")", WITH_OUT_OF_BOUNDS_EXCEPTION));
+            ops.add(Expression.make(type, "", type, ".unslice(", INTS, ", ", type, ", 0, ", type.maskType, ")", WITH_OUT_OF_BOUNDS_EXCEPTION));
+            ops.add(Expression.make(type, "", type, ".unslice(", INTS, ", ", type, ", ", INTS, ", ", type.maskType, ")", WITH_OUT_OF_BOUNDS_EXCEPTION));
+
+            ops.add(Expression.make(type, "", type, ".withLane(", INTS, ", ", type.elementType, ")", WITH_ILLEGAL_ARGUMENT_EXCEPTION));
+
+            if (type.elementType.isFloating()) {
+                ops.add(Expression.make(type, "", type, ".fma(", type.elementType, ", ", type.elementType, ")"));
+                ops.add(Expression.make(type, "", type, ".fma(", type, ", ", type, ")"));
+
+                // TODO: enforce precision instead of just making it non-deterministic?
+                //       See similar comment at VOP definition.
+                ops.add(Expression.make(type, "", type, ".pow(", type.elementType, ")", WITH_NONDETERMINISTIC_RESULT));
+                ops.add(Expression.make(type, "", type, ".pow(", type, ")", WITH_NONDETERMINISTIC_RESULT));
+                ops.add(Expression.make(type, "", type, ".sqrt()"));
+            }
+
+            ops.add(Expression.make(type.shuffleType, "", type, ".toShuffle()"));
+            // skip zero - can get it from type.con() anyway.
+
+            // ----------------- MaskVector --------------------
+            // skip fromValues, too many inputs
+            // skip fromArray
+            ops.add(Expression.make(type.maskType, "VectorMask.fromLong(" + type.speciesName + ", ", LONGS, ")"));
+            for (var type2 : CodeGenerationDataNameType.VECTOR_VECTOR_TYPES) {
+                var mask = type.maskType;
+                var mask2 = type2.maskType;
+                if (type.length == type2.length) {
+                    ops.add(Expression.make(mask, "((" + mask.name() + ")", mask2 , ".cast(" + type.speciesName + "))"));
+                }
+            }
+            ops.add(Expression.make(LONGS, "", type.maskType , ".toLong()"));
+            // skip toArray
+            // skip intoArray
+            ops.add(Expression.make(BOOLEANS, "", type.maskType , ".anyTrue()"));
+            ops.add(Expression.make(BOOLEANS, "", type.maskType , ".allTrue()"));
+            ops.add(Expression.make(INTS, "", type.maskType , ".trueCount()"));
+            ops.add(Expression.make(INTS, "", type.maskType , ".firstTrue()"));
+            ops.add(Expression.make(INTS, "", type.maskType , ".lastTrue()"));
+            ops.add(Expression.make(type.maskType, "", type.maskType , ".and(", type.maskType, ")"));
+            ops.add(Expression.make(type.maskType, "", type.maskType , ".or(", type.maskType, ")"));
+            ops.add(Expression.make(type.maskType, "", type.maskType , ".xor(", type.maskType, ")"));
+            ops.add(Expression.make(type.maskType, "", type.maskType , ".andNot(", type.maskType, ")"));
+            ops.add(Expression.make(type.maskType, "", type.maskType , ".eq(", type.maskType, ")"));
+            ops.add(Expression.make(type.maskType, "", type.maskType , ".not()"));
+            ops.add(Expression.make(type.maskType, "", type.maskType , ".indexInRange(", INTS, ", ", INTS,")"));
+            ops.add(Expression.make(type.maskType, "", type.maskType , ".indexInRange(", LONGS, ", ", LONGS,")"));
+            ops.add(Expression.make(type, "((" + type.name() + ")", type.maskType , ".toVector())"));
+            ops.add(Expression.make(BOOLEANS, "", type.maskType , ".laneIsSet(", INTS, ")", WITH_OUT_OF_BOUNDS_EXCEPTION));
+            ops.add(Expression.make(BOOLEANS, "", type.maskType , ".laneIsSet(", INTS, " & " + (type.length-1) + ")"));
+            // skip check
+            // skip toString
+            // skip equals
+            // skip hashCode
+            ops.add(Expression.make(type.maskType, "", type.maskType , ".compress()"));
+
+            // ----------------- ShuffleVector --------------------
+            for (var type2 : CodeGenerationDataNameType.VECTOR_VECTOR_TYPES) {
+                var shuffle = type.shuffleType;
+                var shuffle2 = type2.shuffleType;
+                if (type.length == type2.length) {
+                    ops.add(Expression.make(shuffle, "((" + shuffle.name() + ")", shuffle2 , ".cast(" + type.speciesName + "))"));
+                }
+            }
+            ops.add(Expression.make(INTS, "", type.shuffleType , ".checkIndex(", INTS, ")", WITH_OUT_OF_BOUNDS_EXCEPTION));
+            ops.add(Expression.make(INTS, "", type.shuffleType , ".wrapIndex(", INTS, ")"));
+            ops.add(Expression.make(type.shuffleType, "", type.shuffleType , ".checkIndexes()", WITH_OUT_OF_BOUNDS_EXCEPTION));
+            ops.add(Expression.make(type.shuffleType, "", type.shuffleType , ".wrapIndexes()"));
+            ops.add(Expression.make(type.maskType, "", type.shuffleType , ".laneIsValid()"));
+            // skip fromValues, too many inputs
+            // skip fromArray
+            // skip fromMemorySegment
+            // skip fromOp
+            // skip iota
+            // skip makeZip
+            // skip makeUnzip
+            // skip toArray
+            // skip intoArray
+            // skip intoMemorySegment
+            ops.add(Expression.make(type, "((" + type.name() + ")", type.shuffleType , ".toVector())"));
+            ops.add(Expression.make(INTS, "", type.shuffleType , ".laneSource(", INTS,")", WITH_ILLEGAL_ARGUMENT_EXCEPTION));
+            ops.add(Expression.make(INTS, "", type.shuffleType , ".laneSource(", INTS," & " + (type.length-1) + ")"));
+            ops.add(Expression.make(type.shuffleType, "", type.shuffleType, ".rearrange(", type.shuffleType, ")"));
+            // skip toString
+            // skip equals
+            // skip hashCode
+        }
+
+        // TODO: VectorSpecies API methods
+
+        // Make sure the list is not modifiable.
+        return List.copyOf(ops);
+    }
+
+    /**
+     * Provides a lits of operations on {@link PrimitiveType}s, such as arithmetic, logical,
+     * and cast operations.
+     */
+    public static final List<Expression> PRIMITIVE_OPERATIONS = generatePrimitiveOperations();
+
+    public static final List<Expression> FLOAT16_OPERATIONS = generateFloat16Operations();
+
+    public static final List<Expression> SCALAR_NUMERIC_OPERATIONS = Utils.concat(
+        PRIMITIVE_OPERATIONS,
+        FLOAT16_OPERATIONS
+    );
+
+    public static final List<Expression> VECTOR_OPERATIONS = generateVectorOperations();
+
+    public static final List<Expression> ALL_OPERATIONS = Utils.concat(
+        SCALAR_NUMERIC_OPERATIONS,
+        VECTOR_OPERATIONS
+    );
 }
diff --git a/test/hotspot/jtreg/compiler/lib/template_framework/library/PrimitiveType.java b/test/hotspot/jtreg/compiler/lib/template_framework/library/PrimitiveType.java
index b20dbb28d22..cd796fd0d31 100644
--- a/test/hotspot/jtreg/compiler/lib/template_framework/library/PrimitiveType.java
+++ b/test/hotspot/jtreg/compiler/lib/template_framework/library/PrimitiveType.java
@@ -34,6 +34,7 @@ import compiler.lib.template_framework.DataName;
 import compiler.lib.template_framework.Template;
 import compiler.lib.template_framework.TemplateToken;
 import static compiler.lib.template_framework.Template.scope;
+import static compiler.lib.template_framework.Template.let;
 
 /**
  * The {@link PrimitiveType} models Java's primitive types, and provides a set
@@ -281,6 +282,22 @@ public final class PrimitiveType implements CodeGenerationDataNameType {
                 public static boolean nextBoolean() {
                     return RANDOM.nextBoolean();
                 }
+
+            """,
+            CodeGenerationDataNameType.PRIMITIVE_TYPES.stream().map(type -> scope(
+                let("type", type),
+                """
+                public static void fill(#type[] a) {
+                    for (int i = 0; i < a.length; i++) {
+                """,
+                "        a[i] = ", type.callLibraryRNG(), ";\n",
+                """
+                    }
+                }
+                """
+            )).toList(),
+            """
+
             }
             """
         ));
diff --git a/test/hotspot/jtreg/compiler/lib/template_framework/library/Utils.java b/test/hotspot/jtreg/compiler/lib/template_framework/library/Utils.java
new file mode 100644
index 00000000000..b96ad830a4b
--- /dev/null
+++ b/test/hotspot/jtreg/compiler/lib/template_framework/library/Utils.java
@@ -0,0 +1,41 @@
+/*
+ * Copyright (c) 2025, 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+package compiler.lib.template_framework.library;
+
+import java.util.Arrays;
+import java.util.List;
+import java.util.stream.Collectors;
+
+/**
+ * Package private class with some helpful utility methods, used in multiple
+ * places of the template library.
+ */
+final class Utils {
+    @SafeVarargs
+    public static <T> List<T> concat(List<? extends T>... lists) {
+        return Arrays.stream(lists)
+                     .flatMap(List::stream)
+                     .collect(Collectors.toList());
+    }
+}
diff --git a/test/hotspot/jtreg/compiler/lib/template_framework/library/VectorType.java b/test/hotspot/jtreg/compiler/lib/template_framework/library/VectorType.java
new file mode 100644
index 00000000000..7eabd42a723
--- /dev/null
+++ b/test/hotspot/jtreg/compiler/lib/template_framework/library/VectorType.java
@@ -0,0 +1,237 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+package compiler.lib.template_framework.library;
+
+import java.util.List;
+import java.util.stream.Stream;
+import java.util.Random;
+import jdk.test.lib.Utils;
+
+import compiler.lib.template_framework.DataName;
+import static compiler.lib.template_framework.library.PrimitiveType.BYTES;
+import static compiler.lib.template_framework.library.PrimitiveType.SHORTS;
+import static compiler.lib.template_framework.library.PrimitiveType.INTS;
+import static compiler.lib.template_framework.library.PrimitiveType.LONGS;
+import static compiler.lib.template_framework.library.PrimitiveType.FLOATS;
+import static compiler.lib.template_framework.library.PrimitiveType.DOUBLES;
+import static compiler.lib.template_framework.library.PrimitiveType.BOOLEANS;
+
+/**
+ * The {@link VectorType} models the Vector API types.
+ */
+public abstract class VectorType implements CodeGenerationDataNameType {
+    private static final Random RANDOM = Utils.getRandomInstance();
+
+    public static final VectorType.Vector BYTE_64  = new VectorType.Vector(BYTES, 8);
+    public static final VectorType.Vector BYTE_128 = new VectorType.Vector(BYTES, 16);
+    public static final VectorType.Vector BYTE_256 = new VectorType.Vector(BYTES, 32);
+    public static final VectorType.Vector BYTE_512 = new VectorType.Vector(BYTES, 64);
+
+    public static final VectorType.Vector SHORT_64  = new VectorType.Vector(SHORTS, 4);
+    public static final VectorType.Vector SHORT_128 = new VectorType.Vector(SHORTS, 8);
+    public static final VectorType.Vector SHORT_256 = new VectorType.Vector(SHORTS, 16);
+    public static final VectorType.Vector SHORT_512 = new VectorType.Vector(SHORTS, 32);
+
+    public static final VectorType.Vector INT_64  = new VectorType.Vector(INTS, 2);
+    public static final VectorType.Vector INT_128 = new VectorType.Vector(INTS, 4);
+    public static final VectorType.Vector INT_256 = new VectorType.Vector(INTS, 8);
+    public static final VectorType.Vector INT_512 = new VectorType.Vector(INTS, 16);
+
+    public static final VectorType.Vector LONG_64  = new VectorType.Vector(LONGS, 1);
+    public static final VectorType.Vector LONG_128 = new VectorType.Vector(LONGS, 2);
+    public static final VectorType.Vector LONG_256 = new VectorType.Vector(LONGS, 4);
+    public static final VectorType.Vector LONG_512 = new VectorType.Vector(LONGS, 8);
+
+    public static final VectorType.Vector FLOAT_64  = new VectorType.Vector(FLOATS, 2);
+    public static final VectorType.Vector FLOAT_128 = new VectorType.Vector(FLOATS, 4);
+    public static final VectorType.Vector FLOAT_256 = new VectorType.Vector(FLOATS, 8);
+    public static final VectorType.Vector FLOAT_512 = new VectorType.Vector(FLOATS, 16);
+
+    public static final VectorType.Vector DOUBLE_64  = new VectorType.Vector(DOUBLES, 1);
+    public static final VectorType.Vector DOUBLE_128 = new VectorType.Vector(DOUBLES, 2);
+    public static final VectorType.Vector DOUBLE_256 = new VectorType.Vector(DOUBLES, 4);
+    public static final VectorType.Vector DOUBLE_512 = new VectorType.Vector(DOUBLES, 8);
+
+    private final String vectorTypeName;
+
+    private VectorType(String vectorTypeName) {
+        this.vectorTypeName = vectorTypeName;
+    }
+
+    @Override
+    public final String name() {
+        return vectorTypeName;
+    }
+
+    @Override
+    public String toString() {
+        return name();
+    }
+
+    @Override
+    public boolean isSubtypeOf(DataName.Type other) {
+        // Each type has a unique instance.
+        return this == other;
+    }
+
+    private static final String vectorTypeName(PrimitiveType elementType) {
+        return switch(elementType.name()) {
+            case "byte"   -> "ByteVector";
+            case "short"  -> "ShortVector";
+            case "char"   -> throw new UnsupportedOperationException("VectorAPI has no char vector type");
+            case "int"    -> "IntVector";
+            case "long"   -> "LongVector";
+            case "float"  -> "FloatVector";
+            case "double" -> "DoubleVector";
+            default       -> throw new UnsupportedOperationException("Not supported: " + elementType.name());
+        };
+    }
+
+    public static final class Vector extends VectorType {
+        public final PrimitiveType elementType;
+        public final int length; // lane count
+        public final String speciesName;
+
+        public final Mask maskType;
+        public final Shuffle shuffleType;
+
+        private Vector(PrimitiveType elementType, int length) {
+            super(vectorTypeName(elementType));
+            this.elementType = elementType;
+            this.length = length;
+            this.speciesName = name() + ".SPECIES_" + (byteSize() * 8);
+            this.maskType = new Mask(this);
+            this.shuffleType = new Shuffle(this);
+        }
+
+        @Override
+        public final Object con() {
+            int r = RANDOM.nextInt(64);
+            if (r == 0) {
+                return List.of(name(), ".zero(", speciesName, ")");
+            } else if (r <= 8) {
+                return List.of(
+                    name(), ".fromArray(", speciesName, ", new ", elementType.name(), "[] {",
+                    elementType.con(),
+                    Stream.generate(() ->
+                        List.of(", ", elementType.con())
+                    ).limit(length - 1).toList(),
+                    "}, 0)"
+                );
+            } else {
+                return List.of(name(), ".broadcast(", speciesName, ", ", elementType.con(), ")");
+            }
+        }
+
+        public int byteSize() {
+            return elementType.byteSize() * length;
+        }
+    }
+
+    public static final class Mask extends VectorType {
+        public final Vector vectorType;
+
+        private Mask(Vector vectorType) {
+            super("VectorMask<" + vectorType.elementType.boxedTypeName() + ">");
+            this.vectorType = vectorType;
+        }
+
+        @Override
+        public final Object con() {
+            int r = RANDOM.nextInt(64);
+            if (r <= 8) {
+                return List.of(
+                    "VectorMask.fromArray(", vectorType.speciesName, ", new boolean[] {",
+                    BOOLEANS.con(),
+                    Stream.generate(() ->
+                        List.of(", ", BOOLEANS.con())
+                    ).limit(vectorType.length - 1).toList(),
+                    "}, 0)"
+                );
+            } else if (r <= 16) {
+                return List.of(
+                    "VectorMask.fromValues(", vectorType.speciesName,
+                    Stream.generate(() ->
+                        List.of(", ", BOOLEANS.con())
+                    ).limit(vectorType.length).toList(),
+                    ")"
+                );
+            } else if (r <= 24) {
+                // All true or all false
+                var tf = BOOLEANS.con();
+                return List.of(
+                    "VectorMask.fromValues(", vectorType.speciesName,
+                    Stream.generate(() ->
+                        List.of(", ", tf)
+                    ).limit(vectorType.length).toList(),
+                    ")"
+                );
+            } else {
+                return List.of("VectorMask.fromLong(", vectorType.speciesName, ", ", LONGS.con(), ")");
+            }
+        }
+    }
+
+    public static final class Shuffle extends VectorType {
+        public final Vector vectorType;
+
+        private Shuffle(Vector vectorType) {
+            super("VectorShuffle<" + vectorType.elementType.boxedTypeName() + ">");
+            this.vectorType = vectorType;
+        }
+
+        @Override
+        public final Object con() {
+            int r = RANDOM.nextInt(64);
+            if (r <= 8) {
+                return List.of(
+                    "VectorShuffle.fromArray(", vectorType.speciesName, ", new int[] {",
+                    INTS.con(),
+                    Stream.generate(() ->
+                        List.of(", ", INTS.con())
+                    ).limit(vectorType.length - 1).toList(),
+                    "}, 0)"
+                );
+            } else if (r <= 16) {
+                return List.of(
+                    "VectorShuffle.fromValues(", vectorType.speciesName,
+                    Stream.generate(() ->
+                        List.of(", ", INTS.con())
+                    ).limit(vectorType.length).toList(),
+                    ")"
+                );
+            } else if (r <= 24) {
+                return List.of("VectorShuffle.makeZip(", vectorType.speciesName, ", ", RANDOM.nextInt(2), ")");
+            } else if (r <= 32) {
+                return List.of("VectorShuffle.makeUnzip(", vectorType.speciesName, ", ", RANDOM.nextInt(2), ")");
+            } else if (r <= 40) {
+                return List.of("VectorShuffle.fromOp(", vectorType.speciesName, ", i -> ",
+                               INTS.con(), " + i * ", INTS.con(), " + i * i * ", INTS.con(), ")");
+            } else {
+                return List.of("VectorShuffle.iota(", vectorType.speciesName, ", ",
+                               INTS.con(), ", ", INTS.con(), ", true)");
+            }
+        }
+    }
+}
diff --git a/test/hotspot/jtreg/compiler/vectorapi/VectorExpressionFuzzer.java b/test/hotspot/jtreg/compiler/vectorapi/VectorExpressionFuzzer.java
new file mode 100644
index 00000000000..ea36cca4b92
--- /dev/null
+++ b/test/hotspot/jtreg/compiler/vectorapi/VectorExpressionFuzzer.java
@@ -0,0 +1,345 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+/*
+ * @test id=AVX2
+ * @bug 8369699
+ * @key randomness
+ * @summary Test the Template Library's expression generation for the Vector API.
+ * @requires os.family == "linux" & os.simpleArch == "x64"
+ * @modules jdk.incubator.vector
+ * @modules java.base/jdk.internal.misc
+ * @library /test/lib /
+ * @compile ../../compiler/lib/verify/Verify.java
+ * @run driver ${test.main.class} -XX:UseAVX=2
+ */
+
+// TODO: remove the x64 and linux restriction above. I added that for now so we are not flooded
+//       with failures in the CI. We should remove these restriction once more bugs are fixed.
+//       x64 linux is the easiest to debug on for me, that's why I picked it.
+//       In addition, I put a UseAVX=2 restriction below, to avoid AVX512 bugs for now.
+//
+//       A trick to extend this to other platforms: create a new run block, so you have full
+//       freedom to restrict it as necessary for platform and vector features.
+
+package compiler.vectorapi;
+
+import java.util.List;
+import java.util.Arrays;
+import java.util.ArrayList;
+import java.util.Set;
+import java.util.Random;
+import jdk.test.lib.Utils;
+import java.util.stream.IntStream;
+
+import compiler.lib.compile_framework.CompileFramework;
+
+import compiler.lib.template_framework.Template;
+import compiler.lib.template_framework.TemplateToken;
+import static compiler.lib.template_framework.Template.scope;
+import static compiler.lib.template_framework.Template.let;
+import static compiler.lib.template_framework.Template.$;
+import compiler.lib.template_framework.library.CodeGenerationDataNameType;
+import compiler.lib.template_framework.library.Expression;
+import compiler.lib.template_framework.library.Expression.Nesting;
+import compiler.lib.template_framework.library.Operations;
+import compiler.lib.template_framework.library.TestFrameworkClass;
+import compiler.lib.template_framework.library.PrimitiveType;
+import compiler.lib.template_framework.library.VectorType;
+
+/**
+ * Basic Expression Fuzzer for Vector API.
+ */
+public class VectorExpressionFuzzer {
+    private static final Random RANDOM = Utils.getRandomInstance();
+
+    public static void main(String[] args) {
+        // Create a new CompileFramework instance.
+        CompileFramework comp = new CompileFramework();
+
+        // Add a java source file.
+        comp.addJavaSourceCode("compiler.vectorapi.templated.Templated", generate(comp));
+
+        // Compile the source file.
+        comp.compile("--add-modules=jdk.incubator.vector");
+
+        List<String> vmArgs = new ArrayList<>(List.of(
+            "--add-modules=jdk.incubator.vector",
+            "--add-opens", "jdk.incubator.vector/jdk.incubator.vector=ALL-UNNAMED",
+            "--add-opens", "java.base/java.lang=ALL-UNNAMED"
+        ));
+        vmArgs.addAll(Arrays.asList(args)); // Forward args
+        String[] vmArgsArray = vmArgs.toArray(new String[0]);
+
+        // compiler.vectorapi.templated.InnterTest.main(new String[] {});
+        comp.invoke("compiler.vectorapi.templated.Templated", "main", new Object[] { vmArgsArray } );
+    }
+
+    // For Example 2 below.
+    record TestArgument(
+        Object defineAndFill,         // used once: to define and fill the input value
+        Object passMethodArgument,    // used twice: to pass argument to test and reference
+        Object receiveMethodArgument, // used twice: to receive argument in test and reference
+        Object use) {}                // used twice: to use the value as expression argument
+
+    // Generate a source Java file as String
+    public static String generate(CompileFramework comp) {
+        // Generate a list of test methods.
+        List<TemplateToken> tests = new ArrayList<>();
+
+        // We are going to use some random numbers in our tests, so import some good methods for that.
+        tests.add(PrimitiveType.generateLibraryRNG());
+
+        // Example 1:
+        // To start simple, we just call the expression with the same constant arguments
+        // every time. We can still compare the "gold" value obtained via interpreter with
+        // later results obtained from the compiled method.
+        var template1 = Template.make("type", (VectorType.Vector type) -> {
+            // The depth determines roughly how many operations are going to be used in the expression.
+            int depth = RANDOM.nextInt(1, 10);
+            Expression expression = Expression.nestRandomly(type, Operations.ALL_OPERATIONS, depth, Nesting.EXACT);
+            List<Object> expressionArguments = expression.argumentTypes.stream().map(CodeGenerationDataNameType::con).toList();
+            return scope(
+                """
+                // --- $test start ---
+                // Using $GOLD
+                // type: #type
+
+                static final Object $GOLD = $test();
+
+                @Test
+                public static Object $test() {
+                    try {
+                """,
+                "        return ", expression.asToken(expressionArguments), ";\n",
+                expression.info.exceptions.stream().map(exception ->
+                    "        } catch (" + exception + " e) { return e;\n"
+                ).toList(),
+                """
+                    } finally {
+                        // Just so javac is happy if there are no exceptions to catch.
+                    }
+                }
+
+                @Check(test = "$test")
+                public static void $check(Object result) {
+                """,
+                expression.info.isResultDeterministic
+                    ? "    Verify.checkEQ(result, $GOLD);\n"
+                    : "    // result not deterministic - don't verify.\n",
+                """
+                }
+
+                // --- $test end   ---
+                """
+            );
+        });
+
+        // Example 2:
+        // Now a more complicated case. We want:
+        // - For every invocation of the test method, we want to have different inputs for the arguments.
+        // - We check correctness with a reference method that does the same but runs in the interpreter.
+        // - Input values are delivered via fields or array loads.
+        // - The final vector is written into an array, and that array is returned.
+        var template2Body = Template.make("expression", "arguments", (Expression expression, List<Object> arguments) -> scope(
+            let("elementType", ((VectorType.Vector)expression.returnType).elementType),
+            """
+            try {
+            #elementType[] out = new #elementType[1000];
+            """,
+            expression.asToken(arguments), ".intoArray(out, 0);\n",
+            "return out;\n",
+            expression.info.exceptions.stream().map(exception ->
+                "} catch (" + exception + " e) { return e;\n"
+            ).toList(),
+            """
+            } finally {
+                // Just javac is happy if there are no exceptions to catch.
+            }
+            """
+        ));
+
+        var template2 = Template.make("type", (VectorType.Vector type) -> {
+            // The depth determines roughly how many operations are going to be used in the expression.
+            int depth = RANDOM.nextInt(1, 10);
+            Expression expression = Expression.nestRandomly(type, Operations.ALL_OPERATIONS, depth, Nesting.EXACT);
+
+            List<TestArgument> arguments = new ArrayList<>();
+            for (int i = 0; i < expression.argumentTypes.size(); i++) {
+                String name = "arg_" + i;
+                CodeGenerationDataNameType argumentType = expression.argumentTypes.get(i);
+                switch(RANDOM.nextInt(4)) {
+                    case 0 -> {
+                        // Use the constant directly, no argument passing needed.
+                        // To make the logic of passing arguments easy, we just pass null and receive an unused argument anyway.
+                        arguments.add(new TestArgument(
+                            "",
+                            "null",
+                            "Object unused_" + i,
+                            argumentType.con()
+                        ));
+                    }
+                    case 1 -> {
+                        // Create the constant outside, and pass it.
+                        arguments.add(new TestArgument(
+                            List.of(argumentType.name(), " ", name, " = ", argumentType.con(), ";\n"),
+                            name,
+                            List.of(argumentType.name(), " ", name),
+                            name
+                        ));
+                    }
+                    default -> {
+                        if (argumentType instanceof PrimitiveType t) {
+                            // We can use the LibraryRGN to create a new value for the primitive in each
+                            // invocation. We have to make sure to call the LibraryRNG in the "defineAndFill",
+                            // so we get the same value for both test and reference. If we called LibraryRNG
+                            // for "use", we would get separate values, which is not helpful.
+                            arguments.add(new TestArgument(
+                                List.of(t.name(), " ", name, " = ", t.callLibraryRNG(), ";\n"),
+                                name,
+                                List.of(t.name(), " ", name),
+                                name
+                            ));
+                        } else if (argumentType instanceof VectorType.Vector t) {
+                            PrimitiveType et = t.elementType;
+                            arguments.add(new TestArgument(
+                                List.of(et.name(), "[] ", name, " = new ", et.name(), "[1000];\n",
+                                        "LibraryRNG.fill(", name,");\n"),
+                                name,
+                                List.of(et.name(), "[] ", name),
+                                List.of(t.name(), ".fromArray(", t.speciesName, ", ", name, ", 0)")
+                            ));
+                        } else if (argumentType instanceof VectorType.Mask t) {
+                            arguments.add(new TestArgument(
+                                List.of("boolean[] ", name, " = new boolean[1000];\n",
+                                        "LibraryRNG.fill(", name,");\n"),
+                                name,
+                                List.of("boolean[] ", name),
+                                List.of("VectorMask.fromArray(", t.vectorType.speciesName, ", ", name, ", 0)")
+                            ));
+                        } else if (argumentType instanceof VectorType.Shuffle t) {
+                            arguments.add(new TestArgument(
+                                List.of("int[] ", name, " = new int[1000];\n",
+                                        "LibraryRNG.fill(", name,");\n"),
+                                name,
+                                List.of("int[] ", name),
+                                List.of("VectorShuffle.fromArray(", t.vectorType.speciesName, ", ", name, ", 0)")
+                            ));
+                        } else {
+                            // We don't know anything special how to create different values
+                            // each time, so let's just crate the same constant each time.
+                            arguments.add(new TestArgument(
+                                List.of(argumentType.name(), " ", name, " = ", argumentType.con(), ";\n"),
+                                name,
+                                List.of(argumentType.name(), " ", name),
+                                name
+                            ));
+                        }
+                    }
+                }
+            }
+
+            // "join" together the arguments to make a comma separated list.
+            List<Object> passArguments = IntStream.range(0, arguments.size() * 2 - 1).mapToObj(i ->
+                (i % 2 == 0) ? arguments.get(i / 2).passMethodArgument() : ", "
+            ).toList();
+            List<Object> receiveArguments = IntStream.range(0, arguments.size() * 2 - 1).mapToObj(i ->
+                (i % 2 == 0) ? arguments.get(i / 2).receiveMethodArgument() : ", "
+            ).toList();
+
+            List<Object> useArguments = arguments.stream().map(TestArgument::use).toList();
+
+            return scope(
+                """
+                // --- $test start ---
+                // type: #type
+
+                @Run(test = "$test")
+                public void $run() {
+                """,
+                arguments.stream().map(TestArgument::defineAndFill).toList(),
+                """
+                Object v0 = $test(
+                """,
+                passArguments,
+                """
+                );
+                Object v1 = $reference(
+                """,
+                passArguments,
+                """
+                );
+                """,
+                expression.info.isResultDeterministic
+                    ? "Verify.checkEQ(v0, v1);\n"
+                    : "// result not deterministic - don't verify.\n",
+                """
+                }
+
+                @Test
+                public static Object $test(
+                """,
+                receiveArguments,
+                """
+                ) {
+                """,
+                template2Body.asToken(expression, useArguments),
+                """
+                }
+
+                @DontCompile
+                public static Object $reference(
+                """,
+                receiveArguments,
+                """
+                ) {
+                """,
+                template2Body.asToken(expression, useArguments),
+                """
+                }
+                // --- $test end   ---
+                """
+            );
+        });
+
+        for (VectorType.Vector type : CodeGenerationDataNameType.VECTOR_VECTOR_TYPES) {
+            tests.add(template1.asToken(type));
+            tests.add(template2.asToken(type));
+        }
+
+        // Create the test class, which runs all tests.
+        return TestFrameworkClass.render(
+            // package and class name.
+            "compiler.vectorapi.templated", "Templated",
+            // Set of imports.
+            Set.of("compiler.lib.verify.*",
+                   "java.util.Random",
+                   "jdk.test.lib.Utils",
+                   "compiler.lib.generators.*",
+                   "jdk.incubator.vector.*"),
+            // classpath, so the Test VM has access to the compiled class files.
+            comp.getEscapedClassPathOfCompiledClasses(),
+            // The list of tests.
+            tests);
+    }
+}
diff --git a/test/hotspot/jtreg/testlibrary_tests/template_framework/examples/TestExpressions.java b/test/hotspot/jtreg/testlibrary_tests/template_framework/examples/TestExpressions.java
index 4bec633553b..8e87985e3d3 100644
--- a/test/hotspot/jtreg/testlibrary_tests/template_framework/examples/TestExpressions.java
+++ b/test/hotspot/jtreg/testlibrary_tests/template_framework/examples/TestExpressions.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2025, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,7 +23,8 @@
 
 /*
  * @test
- * @bug 8359412 8370922
+ * @bug 8359412 8370922 8369699
+ * @key randomness
  * @summary Demonstrate the use of Expressions from the Template Library.
  * @modules java.base/jdk.internal.misc
  * @modules jdk.incubator.vector
@@ -37,6 +38,8 @@ package template_framework.examples;
 import java.util.List;
 import java.util.ArrayList;
 import java.util.Set;
+import java.util.Random;
+import jdk.test.lib.Utils;
 
 import compiler.lib.compile_framework.*;
 import compiler.lib.template_framework.Template;
@@ -48,6 +51,8 @@ import compiler.lib.template_framework.library.Operations;
 import compiler.lib.template_framework.library.TestFrameworkClass;
 
 public class TestExpressions {
+    private static final Random RANDOM = Utils.getRandomInstance();
+
     public static void main(String[] args) {
         // Create a new CompileFramework instance.
         CompileFramework comp = new CompileFramework();
@@ -126,16 +131,26 @@ public class TestExpressions {
             );
         });
 
+        // The scalar operations are very important and we would like to always test them all.
         for (Expression operation : Operations.SCALAR_NUMERIC_OPERATIONS) {
             tests.add(withConstantsTemplate.asToken(operation));
         }
 
+        // There are a LOT of instructions, especially a lot of vector instructions.
+        // A bit too many to run them all in an individual test.
+        // So let's just sample some at random.
+        for (int i = 0; i < 100; i++) {
+            int r = RANDOM.nextInt(Operations.ALL_OPERATIONS.size());
+            Expression operation = Operations.ALL_OPERATIONS.get(r);
+            tests.add(withConstantsTemplate.asToken(operation));
+        }
+
         // Create the test class, which runs all tests.
         return TestFrameworkClass.render(
             // package and class name.
             "p.xyz", "InnerTest",
             // Set of imports.
-            Set.of("compiler.lib.verify.*", "jdk.incubator.vector.Float16"),
+            Set.of("compiler.lib.verify.*", "jdk.incubator.vector.*"),
             // classpath, so the Test VM has access to the compiled class files.
             comp.getEscapedClassPathOfCompiledClasses(),
             // The list of tests.
diff --git a/test/hotspot/jtreg/testlibrary_tests/template_framework/examples/TestPrimitiveTypes.java b/test/hotspot/jtreg/testlibrary_tests/template_framework/examples/TestPrimitiveTypes.java
index facaefaa8f3..861298c7da7 100644
--- a/test/hotspot/jtreg/testlibrary_tests/template_framework/examples/TestPrimitiveTypes.java
+++ b/test/hotspot/jtreg/testlibrary_tests/template_framework/examples/TestPrimitiveTypes.java
@@ -254,6 +254,18 @@ public class TestPrimitiveTypes {
                 }
                 if (allSame) { throw new RuntimeException("all values were the same for #type"); }
             }
+            {
+                #type[] a = new #type[1_000];
+                LibraryRNG.fill(a);
+                boolean allSame = true;
+                for (int i = 0; i < a.length; i++) {
+                    if (a[i] != a[0]) {
+                        allSame = false;
+                        break;
+                    }
+                }
+                if (allSame) { throw new RuntimeException("all values were the same for #type"); }
+            }
             """
         ));
 
diff --git a/test/hotspot/jtreg/testlibrary_tests/template_framework/examples/TestVectorTypes.java b/test/hotspot/jtreg/testlibrary_tests/template_framework/examples/TestVectorTypes.java
new file mode 100644
index 00000000000..554cdc1094c
--- /dev/null
+++ b/test/hotspot/jtreg/testlibrary_tests/template_framework/examples/TestVectorTypes.java
@@ -0,0 +1,134 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+/*
+ * @test
+ * @bug 8358772
+ * @summary Demonstrate the use of VectorTypes (Vector API) form the Template Library.
+ * @modules java.base/jdk.internal.misc
+ * @modules jdk.incubator.vector
+ * @library /test/lib /
+ * @compile ../../../compiler/lib/verify/Verify.java
+ * @run main ${test.main.class}
+ */
+
+package template_framework.examples;
+
+import java.util.List;
+import java.util.ArrayList;
+import java.util.Set;
+
+import compiler.lib.compile_framework.*;
+import compiler.lib.template_framework.Template;
+import compiler.lib.template_framework.TemplateToken;
+import static compiler.lib.template_framework.Template.scope;
+import static compiler.lib.template_framework.Template.let;
+import static compiler.lib.template_framework.Template.$;
+
+import compiler.lib.template_framework.library.CodeGenerationDataNameType;
+import compiler.lib.template_framework.library.VectorType;
+import compiler.lib.template_framework.library.TestFrameworkClass;
+
+/**
+ * This test shows the use of {@link VectorType}.
+ */
+public class TestVectorTypes {
+
+    public static void main(String[] args) {
+        // Create a new CompileFramework instance.
+        CompileFramework comp = new CompileFramework();
+
+        // Add a java source file.
+        comp.addJavaSourceCode("p.xyz.InnerTest", generate(comp));
+
+        // Compile the source file.
+        comp.compile("--add-modules=jdk.incubator.vector");
+
+        // p.xyz.InnerTest.main();
+        comp.invoke("p.xyz.InnerTest", "main", new Object[] {new String[] {
+            "--add-modules=jdk.incubator.vector",
+            "--add-opens", "jdk.incubator.vector/jdk.incubator.vector=ALL-UNNAMED",
+            "--add-opens", "java.base/java.lang=ALL-UNNAMED"
+        }});
+    }
+
+    // Generate a Java source file as String
+    public static String generate(CompileFramework comp) {
+        // Generate a list of test methods.
+        List<TemplateToken> tests = new ArrayList<>();
+
+        var vectorTemplate = Template.make("type", (VectorType.Vector type) -> {
+            return scope(
+                let("elementType", type.elementType),
+                let("length", type.length),
+                let("SPECIES", type.speciesName),
+                let("maskType", type.maskType),
+                let("shuffleType", type.shuffleType),
+                """
+                // #type #elementType #length #SPECIES
+                @Test
+                public static void $test() {
+                """,
+                "    #elementType scalar = ", type.elementType.con(), ";\n",
+                "    #maskType mask = ", type.maskType.con(), ";\n",
+                "    #shuffleType shuffle = ", type.shuffleType.con(), ";\n",
+                """
+                    #type zeros = #{type}.zero(#SPECIES);
+                    #type zeros2 = #{type}.broadcast(#SPECIES, 0);
+                    #type vector = #{type}.broadcast(#SPECIES, scalar);
+                    Verify.checkEQ(zeros, zeros2);
+                    Verify.checkEQ(zeros.add(vector), vector.add(zeros));
+                    Verify.checkEQ(vector.length(), #length);
+                    Verify.checkEQ(vector.lane(#length-1), scalar);
+
+                    #type v1 = zeros.blend(vector, mask);
+                    #type v2 = vector.blend(zeros, mask.not());
+                    Verify.checkEQ(v1, v2);
+
+                    #type iota = zeros.addIndex(1);
+                    #type v3 = iota.rearrange(iota.toShuffle());
+                    Verify.checkEQ(iota, v3);
+                    #type v4 = iota.rearrange(shuffle);
+                    Verify.checkEQ(shuffle.wrapIndexes(), v4.toShuffle());
+                    Verify.checkEQ(shuffle.wrapIndexes().toVector(), v4);
+                }
+                """
+            );
+        });
+
+        for (var type : CodeGenerationDataNameType.VECTOR_VECTOR_TYPES) {
+            tests.add(vectorTemplate.asToken(type));
+        }
+
+        // Create the test class, which runs all tests.
+        return TestFrameworkClass.render(
+            // package and class name.
+            "p.xyz", "InnerTest",
+            // Set of imports.
+            Set.of("compiler.lib.verify.*", "jdk.incubator.vector.*"),
+            // classpath, so the Test VM has access to the compiled class files.
+            comp.getEscapedClassPathOfCompiledClasses(),
+            // The list of tests.
+            tests);
+    }
+}

From ba0aefba9cd558cf41c26f68e9d9668d9198d3c6 Mon Sep 17 00:00:00 2001
From: Vladimir Kozlov <kvn@openjdk.org>
Date: Fri, 3 Apr 2026 15:58:48 +0000
Subject: [PATCH 485/655] 8381596: Adjust checks which use supports_ht() on x86
 for hybrid CPUs

Reviewed-by: iklam, iveresov
---
 src/hotspot/cpu/x86/vm_version_x86.cpp | 6 +++---
 src/hotspot/cpu/x86/vm_version_x86.hpp | 6 ++++++
 2 files changed, 9 insertions(+), 3 deletions(-)

diff --git a/src/hotspot/cpu/x86/vm_version_x86.cpp b/src/hotspot/cpu/x86/vm_version_x86.cpp
index a77105efbbf..fc4cfbc5a8b 100644
--- a/src/hotspot/cpu/x86/vm_version_x86.cpp
+++ b/src/hotspot/cpu/x86/vm_version_x86.cpp
@@ -1647,7 +1647,7 @@ void VM_Version::get_processor_features() {
       }
 #endif // COMPILER2
 
-      if ((supports_sse4_2() && supports_ht()) || supports_avx()) { // Newest Intel cpus
+      if (is_intel_modern_cpu()) { // Newest Intel cpus
         if (FLAG_IS_DEFAULT(UseUnalignedLoadStores)) {
           UseUnalignedLoadStores = true; // use movdqu on newest Intel cpus
         }
@@ -1883,7 +1883,7 @@ void VM_Version::get_processor_features() {
 
   if (is_intel() && is_intel_server_family() && supports_sse3()) {
     if (FLAG_IS_DEFAULT(AllocatePrefetchLines) &&
-        supports_sse4_2() && supports_ht()) { // Nehalem based cpus
+        is_intel_modern_cpu()) { // Nehalem based cpus
       FLAG_SET_DEFAULT(AllocatePrefetchLines, 4);
     }
 #ifdef COMPILER2
@@ -3316,7 +3316,7 @@ int VM_Version::allocate_prefetch_distance(bool use_watermark_prefetch) {
     }
   } else { // Intel
     if (supports_sse3() && is_intel_server_family()) {
-      if (supports_sse4_2() && supports_ht()) { // Nehalem based cpus
+      if (is_intel_modern_cpu()) { // Nehalem based cpus
         return 192;
       } else if (use_watermark_prefetch) { // watermark prefetching on Core
         return 384;
diff --git a/src/hotspot/cpu/x86/vm_version_x86.hpp b/src/hotspot/cpu/x86/vm_version_x86.hpp
index a42558a8023..4f3580d216c 100644
--- a/src/hotspot/cpu/x86/vm_version_x86.hpp
+++ b/src/hotspot/cpu/x86/vm_version_x86.hpp
@@ -958,6 +958,12 @@ public:
 
   static bool is_intel_darkmont();
 
+  static bool is_intel_modern_cpu() {
+    precond(is_intel()); // should be called only for intel CPU
+    // Efficient cores in hybrid CPU may not support hyper-threads.
+    return (supports_avx() || (supports_sse4_2() && (supports_ht() || supports_hybrid())));
+  }
+
   static bool is_intel_tsc_synched_at_init();
 
   static void insert_features_names(VM_Version::VM_Features features, stringStream& ss);

From 0c98ab8dc9736f73a5fde2247ca335c1b12075c7 Mon Sep 17 00:00:00 2001
From: Justin Lu <jlu@openjdk.org>
Date: Fri, 3 Apr 2026 16:24:59 +0000
Subject: [PATCH 486/655] 8380936: Cleanup temp dir usage in ZipFSTester

Reviewed-by: jpai
---
 test/jdk/jdk/nio/zipfs/ZipFSTester.java | 591 +++++++++++++-----------
 1 file changed, 326 insertions(+), 265 deletions(-)

diff --git a/test/jdk/jdk/nio/zipfs/ZipFSTester.java b/test/jdk/jdk/nio/zipfs/ZipFSTester.java
index 9d70350272f..2ca4686ff14 100644
--- a/test/jdk/jdk/nio/zipfs/ZipFSTester.java
+++ b/test/jdk/jdk/nio/zipfs/ZipFSTester.java
@@ -30,11 +30,13 @@ import java.io.IOException;
 import java.io.InputStream;
 import java.io.OutputStream;
 import java.net.URI;
+import java.net.URISyntaxException;
 import java.net.URLDecoder;
 import java.nio.ByteBuffer;
 import java.nio.channels.Channels;
 import java.nio.channels.FileChannel;
 import java.nio.channels.SeekableByteChannel;
+import java.nio.charset.StandardCharsets;
 import java.nio.file.DirectoryStream;
 import java.nio.file.FileAlreadyExistsException;
 import java.nio.file.FileStore;
@@ -56,8 +58,6 @@ import java.util.ArrayList;
 import java.util.Arrays;
 import java.util.Collections;
 import java.util.Enumeration;
-import java.util.HashMap;
-import java.util.HashSet;
 import java.util.Iterator;
 import java.util.LinkedList;
 import java.util.List;
@@ -73,6 +73,7 @@ import java.util.zip.ZipOutputStream;
 import static java.nio.file.StandardOpenOption.*;
 import static java.nio.file.StandardCopyOption.*;
 import static org.junit.jupiter.api.Assertions.assertArrayEquals;
+import static org.junit.jupiter.api.Assertions.assertDoesNotThrow;
 import static org.junit.jupiter.api.Assertions.assertEquals;
 import static org.junit.jupiter.api.Assertions.assertFalse;
 import static org.junit.jupiter.api.Assertions.assertNotEquals;
@@ -116,9 +117,9 @@ public class ZipFSTester {
     }
 
     @Test
-    void test0() throws Exception {
+    void entryParentTest() throws Exception {
         List<String> list = new LinkedList<>();
-        try (var fs = newZipFileSystem(jarFile, Map.of());
+        try (var fs = FileSystems.newFileSystem(jarFile, Map.of());
              ZipFile zf = new ZipFile(fs.toString())) {
             Enumeration<? extends ZipEntry> zes = zf.entries();
             while (zes.hasMoreElements()) {
@@ -134,25 +135,177 @@ public class ZipFSTester {
         }
     }
 
+    // Validates ZipFS provider for expected UOE on directory and non-zip file input
     @Test
-    void test1() throws Exception {
-        // prepare a src for testing
-        Path src = getTempPath();
-        String tmpName = src.toString();
-        try (OutputStream os = Files.newOutputStream(src)) {
-            byte[] bits = new byte[12345];
-            RDM.nextBytes(bits);
-            os.write(bits);
+    void providerValidationUOETest() throws Exception {
+        var nonZipFile = getNonZipFile();
+        var tmpfsPath = getTempZipPath();
+        createClonedZip(tmpfsPath);
+        try (FileSystem fs = FileSystems.newFileSystem(pathToJarURI(tmpfsPath), Map.of())) {
+            FileSystemProvider provider = fs.provider();
+            assertThrows(UnsupportedOperationException.class,
+                    () -> provider.newFileSystem(new File(System.getProperty("test.src", ".")).toPath(),
+                            Map.of()), "newFileSystem() opens a directory as zipfs");
+            assertThrows(UnsupportedOperationException.class,
+                    () -> provider.newFileSystem(nonZipFile, Map.of()),
+                    "newFileSystem() opens a non-zip file as zipfs");
+        } finally {
+            Files.deleteIfExists(tmpfsPath);
+            Files.deleteIfExists(nonZipFile);
         }
+    }
 
-        // clone a fs from fs0 and test on it
-        Path tmpfsPath = getTempPath();
-        Map<String, Object> env = new HashMap<String, Object>();
-        env.put("create", "true");
-        try (var fs = newZipFileSystem(jarFile, Map.of());
-             FileSystem copy = newZipFileSystem(tmpfsPath, env)) {
+    // Validates ZipFS provider for expected FSAE on duplicate input
+    @Test
+    void providerValidationFSAETest() throws Exception {
+        var tmpfsPath = getTempZipPath();
+        createClonedZip(tmpfsPath);
+        try (FileSystem fs = FileSystems.newFileSystem(pathToJarURI(tmpfsPath), Map.of())) {
+            FileSystemProvider provider = fs.provider();
+            assertThrows(FileSystemAlreadyExistsException.class,
+                    () -> provider.newFileSystem(pathToJarURI(tmpfsPath),
+                            Map.of()), "newFileSystem(URI...) does not throw exception");
+        } finally {
+            Files.deleteIfExists(tmpfsPath);
+        }
+    }
+
+    // Validates ZipFS provider for newFileSystem(Path, ...)
+    @Test
+    void providerValidationTest() throws Exception {
+        var tmpfsPath = getTempZipPath();
+        createClonedZip(tmpfsPath);
+        try (FileSystem fs = FileSystems.newFileSystem(pathToJarURI(tmpfsPath), Map.of())) {
+            FileSystemProvider provider = fs.provider();
+            try (FileSystem _ = provider.newFileSystem(tmpfsPath, Map.of())) {}
+        } finally {
+            Files.deleteIfExists(tmpfsPath);
+        }
+    }
+
+    // Performs a sequence of operations where subsequent ops depend on previous state.
+    // Covers ops such as `copy`, `delete`, `move`
+    @Test
+    void entryCopyMoveDeleteFlowTest() throws Exception {
+        var src = getFile();
+        Path tmpfsPath = getTempZipPath();
+        createClonedZip(tmpfsPath);
+        try (FileSystem fs = FileSystems.newFileSystem(pathToJarURI(tmpfsPath), Map.of())) {
+            // walk
+            walk(fs.getPath("/"));
+            // copyin
+            Path dst = getPathWithParents(fs, src.toString());
+            Files.copy(src, dst);
+            checkEqual(src, dst);
+            // copy
+            Path dst2 = getPathWithParents(fs, "/xyz" + RDM.nextInt(100) +
+                    "/efg" + RDM.nextInt(100) + "/foo.class");
+            Files.copy(dst, dst2);
+            // dst.moveTo(dst2);
+            checkEqual(src, dst2);
+            // delete
+            Files.delete(dst);
+            assertFalse(Files.exists(dst));
+            // moveout
+            Path dst3 = Paths.get(src + "_Tmp");
+            Files.move(dst2, dst3);
+            checkEqual(src, dst3);
+            assertFalse(Files.exists(dst2));
+            // copyback + move
+            Files.copy(dst3, dst);
+            Path dst4 = getPathWithParents(fs, src + "_Tmp0");
+            Files.move(dst, dst4);
+            checkEqual(src, dst4);
+            // delete
+            Files.delete(dst4);
+            assertFalse(Files.exists(dst4));
+            Files.delete(dst3);
+            assertFalse(Files.exists(dst3));
+        } finally {
+            Files.deleteIfExists(tmpfsPath);
+            Files.deleteIfExists(src);
+        }
+    }
+
+    // Verify existing entry can be renamed within zfs
+    @Test
+    void existingEntryMoveTest() throws Exception {
+        Path tmpfsPath = getTempZipPath();
+        createClonedZip(tmpfsPath);
+        try (FileSystem fs = FileSystems.newFileSystem(pathToJarURI(tmpfsPath), Map.of())) {
+            // move (existing entry)
+            Path manifest = fs.getPath("META-INF/MANIFEST.MF");
+            if (Files.exists(manifest)) {
+                Path movedManifest = fs.getPath("META-INF/MANIFEST.MF_TMP");
+                Files.move(manifest, movedManifest);
+                // Ensure the move operation was successful
+                assertFalse(Files.exists(manifest));
+                assertTrue(Files.exists(movedManifest));
+                walk(fs.getPath("/"));
+            } else {
+                fail("Unexpected failure, manifest does not exist");
+            }
+        } finally {
+            Files.deleteIfExists(tmpfsPath);
+        }
+    }
+
+    // Verify some directory behavior: open dir as stream fails, correct cleanup of empty parent dir
+    @Test
+    void directoryOpsTest() throws Exception {
+        var src = getFile();
+        Path tmpfsPath = getTempZipPath();
+        createClonedZip(tmpfsPath);
+        try (FileSystem fs = FileSystems.newFileSystem(pathToJarURI(tmpfsPath), Map.of())) {
+            Path pathWithParents = getPathWithParents(fs, "/xyz" + RDM.nextInt(100) +
+                    "/efg" + RDM.nextInt(100) + "/foo.class");
+            Files.copy(src, pathWithParents);
+            // Invoking `newInputStream` on directory should fail
+            Path parent = pathWithParents.getParent();
+            assertThrows(FileSystemException.class, () -> Files.newInputStream(parent));
+            Files.delete(pathWithParents);
+            // Clean up directory (when nested child is removed)
+            assertDoesNotThrow(() -> rmdirs(parent));
+            assertFalse(Files.exists(parent));
+        } finally {
+            Files.deleteIfExists(tmpfsPath);
+            Files.deleteIfExists(src);
+        }
+    }
+
+    // Verify some channel ops
+    @Test
+    void channelTest() throws Exception {
+        var src = getFile();
+        Path tmpfsPath = getTempZipPath();
+        createClonedZip(tmpfsPath);
+        try (FileSystem fs = FileSystems.newFileSystem(pathToJarURI(tmpfsPath), Map.of())) {
+            Path dst = getPathWithParents(fs, src.toString());
+            // newFileChannel() copy in, out and verify via fch
+            fchCopy(src, dst);    // in
+            checkEqual(src, dst);
+            Path tmp = Paths.get(src + "_Tmp");
+            fchCopy(dst, tmp);   //  out
+            checkEqual(src, tmp);
+            Files.delete(tmp);
+            // test channels
+            channel(fs, dst);
+            Files.delete(dst);
+        } finally {
+            Files.deleteIfExists(tmpfsPath);
+            Files.deleteIfExists(src);
+        }
+    }
+
+    // Verify ZipFS can operate on nested zip file entry in another zip
+    @Test
+    void nestedZipContentsTest() throws Exception {
+        // Set up the nested behavior
+        var src = getFile();
+        Path tmpfsPath = getTempZipPath();
+        try (var fs = FileSystems.newFileSystem(jarFile, Map.of());
+             FileSystem copy = FileSystems.newFileSystem(tmpfsPath, Map.of("create", "true"))) {
             z2zcopy(fs, copy, "/", 0);
-
             // copy the test jar itself in
             Files.copy(Paths.get(fs.toString()), copy.getPath("/foo.jar"));
             Path zpath = copy.getPath("/foo.jar");
@@ -160,106 +313,21 @@ public class ZipFSTester {
                 Files.copy(src, zzfs.getPath("/srcInjarjar"));
             }
         }
-
-        try (FileSystem fs = newZipFileSystem(tmpfsPath, new HashMap<String, Object>())) {
-
-            FileSystemProvider provider = fs.provider();
-            // newFileSystem(path...) should not throw exception
-            try (FileSystem fsPath = provider.newFileSystem(tmpfsPath, new HashMap<String, Object>())){}
-            assertThrows(FileSystemAlreadyExistsException.class,
-                    () -> provider.newFileSystem(new URI("jar", tmpfsPath.toUri().toString(), null),
-                    new HashMap<>()), "newFileSystem(URI...) does not throw exception");
-            assertThrows(UnsupportedOperationException.class,
-                    () -> provider.newFileSystem(new File(System.getProperty("test.src", ".")).toPath(),
-                    new HashMap<>()), "newFileSystem() opens a directory as zipfs");
-            assertThrows(UnsupportedOperationException.class,
-                    () -> provider.newFileSystem(src, new HashMap<String, Object>()),
-                    "newFileSystem() opens a non-zip file as zipfs");
-
-            // walk
-            walk(fs.getPath("/"));
-
-            // copyin
-            Path dst = getPathWithParents(fs, tmpName);
-            Files.copy(src, dst);
-            checkEqual(src, dst);
-
-            // copy
-            Path dst2 = getPathWithParents(fs, "/xyz" + RDM.nextInt(100) +
-                                           "/efg" + RDM.nextInt(100) + "/foo.class");
-            Files.copy(dst, dst2);
-            //dst.moveTo(dst2);
-            checkEqual(src, dst2);
-
-            // delete
-            Files.delete(dst);
-            assertFalse(Files.exists(dst));
-
-            // moveout
-            Path dst3 = Paths.get(tmpName + "_Tmp");
-            Files.move(dst2, dst3);
-            checkEqual(src, dst3);
-            assertFalse(Files.exists(dst2));
-
-            // copyback + move
-            Files.copy(dst3, dst);
-            Path dst4 = getPathWithParents(fs, tmpName + "_Tmp0");
-            Files.move(dst, dst4);
-            checkEqual(src, dst4);
-
-            // delete
-            Files.delete(dst4);
-            assertFalse(Files.exists(dst4));
-            Files.delete(dst3);
-            assertFalse(Files.exists(dst3));
-
-            // move (existing entry)
-            Path dst5 = fs.getPath("META-INF/MANIFEST.MF");
-            if (Files.exists(dst5)) {
-                Path dst6 = fs.getPath("META-INF/MANIFEST.MF_TMP");
-                Files.move(dst5, dst6);
-                walk(fs.getPath("/"));
-            }
-
-            // newInputStream on dir
-            Path parent = dst2.getParent();
-            assertThrows(FileSystemException.class, () -> Files.newInputStream(parent));
-
-            // rmdirs
-            try {
-                rmdirs(parent);
-            } catch (IOException x) {
-                x.printStackTrace();
-            }
-
-            // newFileChannel() copy in, out and verify via fch
-            fchCopy(src, dst);    // in
-            checkEqual(src, dst);
-            Path tmp = Paths.get(tmpName + "_Tmp");
-            fchCopy(dst, tmp);   //  out
-            checkEqual(src, tmp);
-            Files.delete(tmp);
-
-            // test channels
-            channel(fs, dst);
-            Files.delete(dst);
-
+        // Assertions
+        try (FileSystem fs = FileSystems.newFileSystem(pathToJarURI(tmpfsPath), Map.of())) {
             // test foo.jar in jar/zipfs #8034802
             Path jpath = fs.getPath("/foo.jar");
-            System.out.println("walking: " + jpath);
             try (FileSystem zzfs = FileSystems.newFileSystem(jpath)) {
                 walk(zzfs.getPath("/"));
                 // foojar:/srcInjarjar
                 checkEqual(src, zzfs.getPath("/srcInjarjar"));
-
-                dst = getPathWithParents(zzfs, tmpName);
+                var dst = getPathWithParents(zzfs, src.toString());
                 fchCopy(src, dst);
                 checkEqual(src, dst);
-                tmp = Paths.get(tmpName + "_Tmp");
+                Path tmp = Paths.get(src + "_Tmp");
                 fchCopy(dst, tmp);   //  out
                 checkEqual(src, tmp);
                 Files.delete(tmp);
-
                 channel(zzfs, dst);
                 Files.delete(dst);
             }
@@ -270,100 +338,86 @@ public class ZipFSTester {
     }
 
     @Test
-    void test2() throws Exception {
-        Path fs1Path = getTempPath();
-        Path fs2Path = getTempPath();
-        Path fs3Path = getTempPath();
+    void concurrentCopyTest() throws Exception {
+        Path fs1Path = getTempZipPath();
+        Path fs2Path = getTempZipPath();
+        Path fs3Path = getTempZipPath();
 
         // create a new filesystem, copy everything from fs
-        Map<String, Object> env = new HashMap<String, Object>();
-        env.put("create", "true");
-        FileSystem fs0 = newZipFileSystem(fs1Path, env);
+        var env = Map.of("create", "true");
+        FileSystem fs0 = FileSystems.newFileSystem(fs1Path, env);
 
-        final FileSystem fs2 = newZipFileSystem(fs2Path, env);
-        final FileSystem fs3 = newZipFileSystem(fs3Path, env);
+        final FileSystem fs2 = FileSystems.newFileSystem(fs2Path, env);
+        final FileSystem fs3 = FileSystems.newFileSystem(fs3Path, env);
 
         System.out.println("copy src: fs -> fs0...");
-        try (var fs = newZipFileSystem(jarFile, Map.of())) {
+        try (var fs = FileSystems.newFileSystem(jarFile, Map.of())) {
             z2zcopy(fs, fs0, "/", 0);   // copy fs -> fs1
             fs0.close();                // dump to file
 
             System.out.println("open fs0 as fs1");
-            env = new HashMap<String, Object>();
-            final FileSystem fs1 = newZipFileSystem(fs1Path, env);
+            final FileSystem fs1 = FileSystems.newFileSystem(fs1Path, Map.of());
 
             System.out.println("listing...");
             final ArrayList<String> files = new ArrayList<>();
             final ArrayList<String> dirs = new ArrayList<>();
             list(fs1.getPath("/"), files, dirs);
 
-            Thread t0 = new Thread(new Runnable() {
-                public void run() {
-                    List<String> list = new ArrayList<>(dirs);
-                    Collections.shuffle(list);
-                    for (String path : list) {
-                        try {
-                            z2zcopy(fs1, fs2, path, 0);
-                        } catch (Exception x) {
-                            x.printStackTrace();
-                        }
+            Thread t0 = new Thread(() -> {
+                List<String> list = new ArrayList<>(dirs);
+                Collections.shuffle(list);
+                for (String path : list) {
+                    try {
+                        z2zcopy(fs1, fs2, path, 0);
+                    } catch (Exception x) {
+                        x.printStackTrace();
                     }
                 }
-
             });
 
-            Thread t1 = new Thread(new Runnable() {
-                public void run() {
-                    List<String> list = new ArrayList<>(dirs);
-                    Collections.shuffle(list);
-                    for (String path : list) {
-                        try {
-                            z2zcopy(fs1, fs2, path, 1);
-                        } catch (Exception x) {
-                            x.printStackTrace();
-                        }
+            Thread t1 = new Thread(() -> {
+                List<String> list = new ArrayList<>(dirs);
+                Collections.shuffle(list);
+                for (String path : list) {
+                    try {
+                        z2zcopy(fs1, fs2, path, 1);
+                    } catch (Exception x) {
+                        x.printStackTrace();
                     }
                 }
-
             });
 
-            Thread t2 = new Thread(new Runnable() {
-                public void run() {
-                    List<String> list = new ArrayList<>(dirs);
-                    Collections.shuffle(list);
-                    for (String path : list) {
-                        try {
-                            z2zcopy(fs1, fs2, path, 2);
-                        } catch (Exception x) {
-                            x.printStackTrace();
-                        }
+            Thread t2 = new Thread(() -> {
+                List<String> list = new ArrayList<>(dirs);
+                Collections.shuffle(list);
+                for (String path : list) {
+                    try {
+                        z2zcopy(fs1, fs2, path, 2);
+                    } catch (Exception x) {
+                        x.printStackTrace();
                     }
                 }
-
             });
 
-            Thread t3 = new Thread(new Runnable() {
-                public void run() {
-                    List<String> list = new ArrayList<>(files);
-                    Collections.shuffle(list);
-                    while (!list.isEmpty()) {
-                        Iterator<String> itr = list.iterator();
-                        while (itr.hasNext()) {
-                            String path = itr.next();
-                            try {
-                                if (Files.exists(fs2.getPath(path))) {
-                                    z2zmove(fs2, fs3, path);
-                                    itr.remove();
-                                }
-                            } catch (FileAlreadyExistsException x) {
+            Thread t3 = new Thread(() -> {
+                List<String> list = new ArrayList<>(files);
+                Collections.shuffle(list);
+                while (!list.isEmpty()) {
+                    Iterator<String> itr = list.iterator();
+                    while (itr.hasNext()) {
+                        String path = itr.next();
+                        try {
+                            if (Files.exists(fs2.getPath(path))) {
+                                z2zmove(fs2, fs3, path);
                                 itr.remove();
-                            } catch (Exception x) {
-                                x.printStackTrace();
                             }
+                        } catch (FileAlreadyExistsException x) {
+                            itr.remove();
+                        } catch (Exception x) {
+                            x.printStackTrace();
                         }
                     }
                 }
-
             });
 
             System.out.println("copying/removing...");
@@ -394,7 +448,7 @@ public class ZipFSTester {
             fs3.close();
 
             System.out.println("opening: fs3 as fs4");
-            FileSystem fs4 = newZipFileSystem(fs3Path, env);
+            FileSystem fs4 = FileSystems.newFileSystem(fs3Path, Map.of());
 
 
             ArrayList<String> files2 = new ArrayList<>();
@@ -503,7 +557,7 @@ public class ZipFSTester {
     // test entry stream/channel reading
     @Test
     void testStreamChannel() throws Exception {
-        Path zpath = getTempPath();
+        Path zpath = getTempZipPath();
         try {
             var crc = new CRC32();
             Object[][] entries = getEntries();
@@ -527,7 +581,7 @@ public class ZipFSTester {
                    zos.closeEntry();
                 }
             }
-            try (var zfs = newZipFileSystem(zpath, Map.of())) {
+            try (var zfs = FileSystems.newFileSystem(zpath, Map.of())) {
                 for (Object[] e : entries) {
                     Path path = zfs.getPath((String)e[0]);
                     byte[] bytes = (byte[])e[2];
@@ -537,7 +591,7 @@ public class ZipFSTester {
             Files.deleteIfExists(zpath);
 
             // [2] create zip via zfs.newByteChannel
-            try (var zfs = newZipFileSystem(zpath, Map.of("create", "true"))) {
+            try (var zfs = FileSystems.newFileSystem(zpath, Map.of("create", "true"))) {
                 for (Object[] e : entries) {
                     //  tbd: method is not used
                     try (var sbc = Files.newByteChannel(zfs.getPath((String)e[0]),
@@ -546,7 +600,7 @@ public class ZipFSTester {
                     }
                 }
             }
-            try (var zfs = newZipFileSystem(zpath, Map.of())) {
+            try (var zfs = FileSystems.newFileSystem(zpath, Map.of())) {
                 for (Object[] e : entries) {
                     checkRead(zfs.getPath((String)e[0]), (byte[])e[2]);
                 }
@@ -554,12 +608,12 @@ public class ZipFSTester {
             Files.deleteIfExists(zpath);
 
             // [3] create zip via Files.write()/newoutputStream/
-            try (var zfs = newZipFileSystem(zpath, Map.of("create", "true"))) {
+            try (var zfs = FileSystems.newFileSystem(zpath, Map.of("create", "true"))) {
                 for (Object[] e : entries) {
                     Files.write(zfs.getPath((String)e[0]), (byte[])e[2]);
                 }
             }
-            try (var zfs = newZipFileSystem(zpath, Map.of())) {
+            try (var zfs = FileSystems.newFileSystem(zpath, Map.of())) {
                 for (Object[] e : entries) {
                     checkRead(zfs.getPath((String)e[0]), (byte[])e[2]);
                 }
@@ -567,7 +621,7 @@ public class ZipFSTester {
             Files.deleteIfExists(zpath);
 
             // [4] create zip via zfs.newByteChannel, with "method_stored"
-            try (var zfs = newZipFileSystem(zpath,
+            try (var zfs = FileSystems.newFileSystem(zpath,
                     Map.of("create", true, "noCompression", true))) {
                 for (Object[] e : entries) {
                     try (var sbc = Files.newByteChannel(zfs.getPath((String)e[0]),
@@ -576,7 +630,7 @@ public class ZipFSTester {
                     }
                 }
             }
-            try (var zfs = newZipFileSystem(zpath, Map.of())) {
+            try (var zfs = FileSystems.newFileSystem(zpath, Map.of())) {
                 for (Object[] e : entries) {
                     checkRead(zfs.getPath((String)e[0]), (byte[])e[2]);
                 }
@@ -596,7 +650,7 @@ public class ZipFSTester {
                         .getFileAttributeView(jar, BasicFileAttributeView.class)
                         .readAttributes();
         // create a new filesystem, copy this file into it
-        Path fsPath = getTempPath();
+        Path fsPath = getTempZipPath();
         try (FileSystem fs = FileSystems.newFileSystem(fsPath, Map.of("create", "true"))) {
             System.out.println("test copy with timestamps...");
             // copyin
@@ -630,20 +684,18 @@ public class ZipFSTester {
     @Test
     void test8069211() throws Exception {
         // create a new filesystem, copy this file into it
-        Map<String, Object> env = new HashMap<String, Object>();
-        env.put("create", "true");
-        Path fsPath = getTempPath();
-        try (FileSystem fs = newZipFileSystem(fsPath, env);) {
+        Path fsPath = getTempZipPath();
+        try (FileSystem fs = FileSystems.newFileSystem(fsPath, Map.of("create", "true"))) {
             OutputStream out = Files.newOutputStream(fs.getPath("/foo"));
             out.write("hello".getBytes());
             out.close();
-            out.close();
+            out.close(); // Intentional second `close` invocation
         }
-        try (FileSystem fs = newZipFileSystem(fsPath, new HashMap<String, Object>())) {
+        try (FileSystem fs = FileSystems.newFileSystem(fsPath, Map.of())) {
             assertArrayEquals("hello".getBytes(), Files.readAllBytes(fs.getPath("/foo")),
-                    "entry close() failed");
+                    "Second `close` on entry output stream corrupted /foo");
         } catch (Exception x) {
-            fail("entry close() failed", x);
+            fail("Second `close` on entry output stream causes unexpected error", x);
         } finally {
             Files.delete(fsPath);
         }
@@ -651,26 +703,9 @@ public class ZipFSTester {
 
     @Test
     void test8131067() throws Exception {
-        Map<String, Object> env = new HashMap<String, Object>();
-        env.put("create", "true");
-
         // file name with space character for URI to quote it
-        File tmp = File.createTempFile("test zipfs", "zip");
-        tmp.delete();    // we need a clean path, no file
-        Path fsPath = tmp.toPath();
-        try (FileSystem fs = newZipFileSystem(fsPath, env);) {
-            Files.write(fs.getPath("/foo"), "hello".getBytes());
-            URI fooUri = fs.getPath("/foo").toUri();
-            assertArrayEquals("hello".getBytes(), Files.readAllBytes(Paths.get(fooUri)),
-                    "entry close() failed");
-        } finally {
-            Files.delete(fsPath);
-        }
-    }
-
-    private static FileSystem newZipFileSystem(Path path, Map<String, ?> env)
-        throws Exception
-    {
+        Path fsPath = Files.createTempFile(Path.of("."), "test zipfs", ".zip");
+        Files.delete(fsPath); // we need a clean path, no file
         // Use URLDecoder (for test only) to remove the double escaped space
         // character. For the path which is not encoded by UTF-8, we need to
         // replace "+" by "%2b" manually before feeding into the decoder.
@@ -682,16 +717,83 @@ public class ZipFSTester {
         //
         // Also, we should not use URLEncoder in case of the path has been
         // encoded.
-        return FileSystems.newFileSystem(
-            new URI("jar", URLDecoder.decode(path.toUri().toString()
-                            .replace("+", "%2b"), "utf8"), null), env, null);
+        try (FileSystem fs = FileSystems.newFileSystem(new URI("jar",
+                URLDecoder.decode(fsPath.toUri().toString().replace("+", "%2b"), StandardCharsets.UTF_8),
+                null), Map.of("create", "true"))) {
+            Files.write(fs.getPath("/foo"), "hello".getBytes());
+            URI fooUri = fs.getPath("/foo").toUri();
+            assertArrayEquals("hello".getBytes(), Files.readAllBytes(Paths.get(fooUri)),
+                    "entry close() failed");
+        } finally {
+            Files.deleteIfExists(fsPath);
+        }
     }
 
-    private static Path getTempPath() throws IOException
-    {
-        File tmp = File.createTempFile("testzipfs_", "zip");
-        tmp.delete();    // we need a clean path, no file
-        return tmp.toPath();
+    /**
+     * Tests if certain methods throw a NullPointerException if invoked with null
+     * as specified in java.nio.file.package-info.java
+     *
+     * @see 8299864
+     */
+    @Test
+    void testFileStoreNullArgs() throws Exception {
+        try (var fs = FileSystems.newFileSystem(jarFile, Map.of())) {
+            // file system containing at least one ZipFileStore
+            FileStore store = fs.getFileStores().iterator().next();
+
+            // Make sure we are testing the right thing
+            assertEquals("jdk.nio.zipfs.ZipFileStore", store.getClass().getName());
+
+            assertThrows(NullPointerException.class, () -> store.supportsFileAttributeView((String) null));
+            assertThrows(NullPointerException.class, () -> store.supportsFileAttributeView((Class<? extends FileAttributeView>) null));
+            assertThrows(NullPointerException.class, () -> store.getAttribute(null));
+            assertThrows(NullPointerException.class, () -> store.getFileStoreAttributeView(null));
+        }
+    }
+
+    private static Path getTempNonZipPath() throws IOException {
+        var path = Files.createTempFile(
+                Path.of("."), "testzipfs_", ".foo");
+        Files.delete(path);
+        return path;
+    }
+
+    private static Path getTempZipPath() throws IOException {
+        var path = Files.createTempFile(
+                Path.of("."), "testzipfs_", ".zip");
+        Files.delete(path);
+        return path;
+    }
+
+    private static Path getNonZipFile() throws IOException {
+        var src = getTempNonZipPath();
+        writeRandomBytes(src);
+        return src;
+    }
+
+    static Path getFile() throws IOException {
+        Path src = getTempZipPath();
+        writeRandomBytes(src);
+        return src;
+    }
+
+    private static void writeRandomBytes(Path src) throws IOException {
+        try (OutputStream os = Files.newOutputStream(src)) {
+            byte[] bits = new byte[12345];
+            RDM.nextBytes(bits);
+            os.write(bits);
+        }
+    }
+
+    private static void createClonedZip(Path tmpfsPath) throws Exception {
+        try (var fs = FileSystems.newFileSystem(jarFile, Map.of());
+             FileSystem copy = FileSystems.newFileSystem(tmpfsPath, Map.of("create", "true"))) {
+            z2zcopy(fs, copy, "/", 0);
+        }
+    }
+
+    private static URI pathToJarURI(Path path) throws URISyntaxException {
+        return new URI("jar", path.toUri().toString(), null);
     }
 
     private static void list(Path path, List<String> files, List<String> dirs )
@@ -718,7 +820,7 @@ public class ZipFSTester {
         if (Files.isDirectory(srcPath)) {
             if (!Files.exists(dstPath)) {
                 try {
-                    mkdirs(dstPath);
+                    Files.createDirectories(dstPath);
                 } catch (FileAlreadyExistsException x) {}
             }
             try (DirectoryStream<Path> ds = Files.newDirectoryStream(srcPath)) {
@@ -756,7 +858,7 @@ public class ZipFSTester {
 
         if (Files.isDirectory(srcPath)) {
             if (!Files.exists(dstPath))
-                mkdirs(dstPath);
+                Files.createDirectories(dstPath);
             try (DirectoryStream<Path> ds = Files.newDirectoryStream(srcPath)) {
                 for (Path child : ds) {
                     z2zmove(src, dst,
@@ -767,7 +869,7 @@ public class ZipFSTester {
             //System.out.println("moving..." + path);
             Path parent = dstPath.getParent();
             if (parent != null && Files.notExists(parent))
-                mkdirs(parent);
+                Files.createDirectories(parent);
             Files.move(srcPath, dstPath);
         }
     }
@@ -814,18 +916,6 @@ public class ZipFSTester {
         });
     }
 
-    private static void mkdirs(Path path) throws IOException {
-        if (Files.exists(path))
-            return;
-        path = path.toAbsolutePath();
-        Path parent = path.getParent();
-        if (parent != null) {
-            if (Files.notExists(parent))
-                mkdirs(parent);
-        }
-        Files.createDirectory(path);
-    }
-
     private static void rmdirs(Path path) throws IOException {
         while (path != null && path.getNameCount() != 0) {
             Files.delete(path);
@@ -915,11 +1005,8 @@ public class ZipFSTester {
 
     private static void fchCopy(Path src, Path dst) throws IOException
     {
-        Set<OpenOption> read = new HashSet<>();
-        read.add(READ);
-        Set<OpenOption> openwrite = new HashSet<>();
-        openwrite.add(CREATE_NEW);
-        openwrite.add(WRITE);
+        Set<OpenOption> read = Set.of(READ);
+        Set<OpenOption> openwrite = Set.of(CREATE_NEW, WRITE);
 
         try (FileChannel srcFc = src.getFileSystem()
                                     .provider()
@@ -939,11 +1026,8 @@ public class ZipFSTester {
 
     private static void chCopy(Path src, Path dst) throws IOException
     {
-        Set<OpenOption> read = new HashSet<>();
-        read.add(READ);
-        Set<OpenOption> openwrite = new HashSet<>();
-        openwrite.add(CREATE_NEW);
-        openwrite.add(WRITE);
+        Set<OpenOption> read = Set.of(READ);
+        Set<OpenOption> openwrite = Set.of(CREATE_NEW, WRITE);
 
         try (SeekableByteChannel srcCh = Files.newByteChannel(src, read);
              SeekableByteChannel dstCh = Files.newByteChannel(dst, openwrite))
@@ -983,8 +1067,7 @@ public class ZipFSTester {
         throws Exception
     {
         System.out.println("test ByteChannel...");
-        Set<OpenOption> read = new HashSet<>();
-        read.add(READ);
+        Set<OpenOption> read = Set.of(READ);
         int n = 0;
         ByteBuffer bb = null;
         ByteBuffer bb2 = null;
@@ -1027,29 +1110,7 @@ public class ZipFSTester {
         Path path = fs.getPath(name);
         Path parent = path.getParent();
         if (parent != null && Files.notExists(parent))
-            mkdirs(parent);
+            Files.createDirectories(parent);
         return path;
     }
-
-    /**
-     * Tests if certain methods throw a NullPointerException if invoked with null
-     * as specified in java.nio.file.package-info.java
-     *
-     * @see 8299864
-     */
-    @Test
-    void testFileStoreNullArgs() throws Exception {
-        try (var fs = newZipFileSystem(jarFile, Map.of())) {
-            // file system containing at least one ZipFileStore
-            FileStore store = fs.getFileStores().iterator().next();
-
-            // Make sure we are testing the right thing
-            assertEquals("jdk.nio.zipfs.ZipFileStore", store.getClass().getName());
-
-            assertThrows(NullPointerException.class, () -> store.supportsFileAttributeView((String) null));
-            assertThrows(NullPointerException.class, () -> store.supportsFileAttributeView((Class<? extends FileAttributeView>) null));
-            assertThrows(NullPointerException.class, () -> store.getAttribute(null));
-            assertThrows(NullPointerException.class, () -> store.getFileStoreAttributeView(null));
-        }
-    }
 }

From 410b3e816a73f00ffbb93e01707e33ea9cd2ecd5 Mon Sep 17 00:00:00 2001
From: Naoto Sato <naoto@openjdk.org>
Date: Fri, 3 Apr 2026 19:37:33 +0000
Subject: [PATCH 487/655] 8381606: Javadoc typo in ResourceBundle example

Reviewed-by: iris, jlu
---
 src/java.base/share/classes/java/util/ResourceBundle.java | 8 ++++----
 1 file changed, 4 insertions(+), 4 deletions(-)

diff --git a/src/java.base/share/classes/java/util/ResourceBundle.java b/src/java.base/share/classes/java/util/ResourceBundle.java
index db19eda6399..f91db79891b 100644
--- a/src/java.base/share/classes/java/util/ResourceBundle.java
+++ b/src/java.base/share/classes/java/util/ResourceBundle.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1996, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1996, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -1119,15 +1119,15 @@ public abstract class ResourceBundle {
      * sequence of bundle names generated by truncating the last underscore and
      * the part following it is inserted after a candidate bundle name with the
      * original variant.  For example, for a locale with language "en", script
-     * "Latn, country "US" and variant "WINDOWS_VISTA", and bundle base name
+     * "Latn", country "US" and variant "WINDOWS_WIN11", and bundle base name
      * "MyResource", the list of candidate bundle names below is generated:
      *
      * <pre>
-     * MyResource_en_Latn_US_WINDOWS_VISTA
+     * MyResource_en_Latn_US_WINDOWS_WIN11
      * MyResource_en_Latn_US_WINDOWS
      * MyResource_en_Latn_US
      * MyResource_en_Latn
-     * MyResource_en_US_WINDOWS_VISTA
+     * MyResource_en_US_WINDOWS_WIN11
      * MyResource_en_US_WINDOWS
      * MyResource_en_US
      * MyResource_en

From e254526f4a2647996c808e66b294f33fe38d57af Mon Sep 17 00:00:00 2001
From: William Kemper <wkemper@openjdk.org>
Date: Fri, 3 Apr 2026 20:10:26 +0000
Subject: [PATCH 488/655] 8380958: GenShen: Regulator thread may observe
 inconsistent old generation state

Reviewed-by: kdnilsen, xpeng
---
 .../heuristics/shenandoahOldHeuristics.cpp    |  2 +-
 .../gc/shenandoah/shenandoahDegeneratedGC.cpp |  2 +-
 .../shenandoahGenerationalControlThread.cpp   | 17 ++----
 .../gc/shenandoah/shenandoahOldGeneration.cpp | 60 +++++++------------
 .../gc/shenandoah/shenandoahOldGeneration.hpp | 12 ++--
 5 files changed, 33 insertions(+), 60 deletions(-)

diff --git a/src/hotspot/share/gc/shenandoah/heuristics/shenandoahOldHeuristics.cpp b/src/hotspot/share/gc/shenandoah/heuristics/shenandoahOldHeuristics.cpp
index 33c91e27be5..0789fd5cb1c 100644
--- a/src/hotspot/share/gc/shenandoah/heuristics/shenandoahOldHeuristics.cpp
+++ b/src/hotspot/share/gc/shenandoah/heuristics/shenandoahOldHeuristics.cpp
@@ -576,7 +576,7 @@ void ShenandoahOldHeuristics::prepare_for_old_collections() {
   } else if (has_coalesce_and_fill_candidates()) {
     _old_generation->transition_to(ShenandoahOldGeneration::FILLING);
   } else {
-    _old_generation->transition_to(ShenandoahOldGeneration::WAITING_FOR_BOOTSTRAP);
+    _old_generation->transition_to(ShenandoahOldGeneration::IDLE);
   }
 }
 
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahDegeneratedGC.cpp b/src/hotspot/share/gc/shenandoah/shenandoahDegeneratedGC.cpp
index 8cd8a390c4a..1873d818093 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahDegeneratedGC.cpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahDegeneratedGC.cpp
@@ -55,7 +55,7 @@ bool ShenandoahDegenGC::collect(GCCause::Cause cause) {
   vmop_degenerated();
   ShenandoahHeap* heap = ShenandoahHeap::heap();
   if (heap->mode()->is_generational()) {
-    bool is_bootstrap_gc = heap->old_generation()->is_bootstrapping();
+    bool is_bootstrap_gc = heap->young_generation()->is_bootstrap_cycle();
     heap->mmu_tracker()->record_degenerated(GCId::current(), is_bootstrap_gc);
     const char* msg = is_bootstrap_gc? "At end of Degenerated Bootstrap Old GC": "At end of Degenerated Young GC";
     heap->log_heap_status(msg);
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahGenerationalControlThread.cpp b/src/hotspot/share/gc/shenandoah/shenandoahGenerationalControlThread.cpp
index 064f43ffd6b..aa6a4a9bab2 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahGenerationalControlThread.cpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahGenerationalControlThread.cpp
@@ -422,12 +422,11 @@ void ShenandoahGenerationalControlThread::service_concurrent_old_cycle(const She
       }
 
       // Coalescing threads completed and nothing was cancelled. it is safe to transition from this state.
-      old_generation->transition_to(ShenandoahOldGeneration::WAITING_FOR_BOOTSTRAP);
+      old_generation->transition_to(ShenandoahOldGeneration::IDLE);
       return;
     }
-    case ShenandoahOldGeneration::WAITING_FOR_BOOTSTRAP:
-      old_generation->transition_to(ShenandoahOldGeneration::BOOTSTRAPPING);
-    case ShenandoahOldGeneration::BOOTSTRAPPING: {
+    case ShenandoahOldGeneration::IDLE:
+      old_generation->transition_to(ShenandoahOldGeneration::MARKING);
       // Configure the young generation's concurrent mark to put objects in
       // old regions into the concurrent mark queues associated with the old
       // generation. The young cycle will run as normal except that rather than
@@ -450,8 +449,6 @@ void ShenandoahGenerationalControlThread::service_concurrent_old_cycle(const She
       // and init mark for the concurrent mark. All of that work will have been
       // done by the bootstrapping young cycle.
       set_gc_mode(servicing_old);
-      old_generation->transition_to(ShenandoahOldGeneration::MARKING);
-    }
     case ShenandoahOldGeneration::MARKING: {
       ShenandoahGCSession session(request.cause, old_generation);
       bool marking_complete = resume_concurrent_old_cycle(old_generation, request.cause);
@@ -644,12 +641,6 @@ void ShenandoahGenerationalControlThread::service_stw_degenerated_cycle(const Sh
   if (request.generation->is_global()) {
     assert(_heap->old_generation()->task_queues()->is_empty(), "Unexpected old generation marking tasks");
     assert(_heap->global_generation()->task_queues()->is_empty(), "Unexpected global generation marking tasks");
-  } else {
-    assert(request.generation->is_young(), "Expected degenerated young cycle, if not global.");
-    ShenandoahOldGeneration* old = _heap->old_generation();
-    if (old->is_bootstrapping()) {
-      old->transition_to(ShenandoahOldGeneration::MARKING);
-    }
   }
 }
 
@@ -681,7 +672,7 @@ bool ShenandoahGenerationalControlThread::request_concurrent_gc(ShenandoahGenera
     // Cancel the old GC and wait for the control thread to start servicing the new request.
     log_info(gc)("Preempting old generation mark to allow %s GC", generation->name());
     while (gc_mode() == servicing_old) {
-      ShenandoahHeap::heap()->cancel_gc(GCCause::_shenandoah_concurrent_gc);
+      _heap->cancel_gc(GCCause::_shenandoah_concurrent_gc);
       notify_control_thread(ml, GCCause::_shenandoah_concurrent_gc, generation);
       ml.wait();
     }
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahOldGeneration.cpp b/src/hotspot/share/gc/shenandoah/shenandoahOldGeneration.cpp
index 16a24da8b1c..bbfa0961e86 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahOldGeneration.cpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahOldGeneration.cpp
@@ -114,7 +114,7 @@ ShenandoahOldGeneration::ShenandoahOldGeneration(uint max_queues)
     _promotable_regular_regions(0),
     _is_parsable(true),
     _card_scan(nullptr),
-    _state(WAITING_FOR_BOOTSTRAP),
+    _state(IDLE),
     _growth_percent_before_collection(INITIAL_GROWTH_PERCENT_BEFORE_COLLECTION)
 {
   assert(type() == ShenandoahGenerationType::OLD, "OO sanity");
@@ -339,7 +339,7 @@ void ShenandoahOldGeneration::cancel_gc() {
   shenandoah_assert_safepoint();
   if (is_idle()) {
 #ifdef ASSERT
-    validate_waiting_for_bootstrap();
+    validate_idle();
 #endif
   } else {
     log_info(gc)("Terminating old gc cycle.");
@@ -350,7 +350,7 @@ void ShenandoahOldGeneration::cancel_gc() {
     // Remove old generation access to young generation mark queues
     ShenandoahHeap::heap()->young_generation()->set_old_gen_task_queues(nullptr);
     // Transition to IDLE now.
-    transition_to(ShenandoahOldGeneration::WAITING_FOR_BOOTSTRAP);
+    transition_to(ShenandoahOldGeneration::IDLE);
   }
 }
 
@@ -477,9 +477,8 @@ void ShenandoahOldGeneration::prepare_regions_and_collection_set(bool concurrent
 
 const char* ShenandoahOldGeneration::state_name(State state) {
   switch (state) {
-    case WAITING_FOR_BOOTSTRAP:   return "Waiting for Bootstrap";
+    case IDLE:                    return "Idle";
     case FILLING:                 return "Coalescing";
-    case BOOTSTRAPPING:           return "Bootstrapping";
     case MARKING:                 return "Marking";
     case EVACUATING:              return "Evacuating";
     case EVACUATING_AFTER_GLOBAL: return "Evacuating (G)";
@@ -517,7 +516,7 @@ void ShenandoahOldGeneration::transition_to(State new_state) {
 // the old generation in the respective states (EVACUATING or FILLING). After a Full GC,
 // the mark bitmaps are all reset, all regions are parsable and the mark context will
 // not be "complete". After a Full GC, remembered set scans will _not_ use the mark bitmap
-// and we expect the old generation to be waiting for bootstrap.
+// and we expect the old generation to be idle.
 //
 //                              +-----------------+
 //               +------------> |     FILLING     | <---+
@@ -526,19 +525,12 @@ void ShenandoahOldGeneration::transition_to(State new_state) {
 //               |   |            |                     |
 //               |   |            | Filling Complete    | <-> A global collection may
 //               |   |            v                     |     move the old generation
-//               |   |          +-----------------+     |     directly from waiting for
-//           +-- |-- |--------> |     WAITING     |     |     bootstrap to filling or
-//           |   |   |    +---- |  FOR BOOTSTRAP  | ----+     evacuating. It may also
-//           |   |   |    |     +-----------------+           move from filling to waiting
-//           |   |   |    |       |                           for bootstrap.
-//           |   |   |    |       | Reset Bitmap
-//           |   |   |    |       v
-//           |   |   |    |     +-----------------+     +----------------------+
-//           |   |   |    |     |    BOOTSTRAP    | <-> |       YOUNG GC       |
-//           |   |   |    |     |                 |     | (RSet Parses Region) |
-//           |   |   |    |     +-----------------+     +----------------------+
+//               |   |          +-----------------+     |     directly from idle to
+//           +-- |-- |--------> |      IDLE       |     |     filling or evacuating.
+//           |   |   |    +---- |                 | ----+     It may also move from
+//           |   |   |    |     +-----------------+           filling to idle.
 //           |   |   |    |       |
-//           |   |   |    |       | Old Marking
+//           |   |   |    |       | Reset Bitmap + Start Marking
 //           |   |   |    |       v
 //           |   |   |    |     +-----------------+     +----------------------+
 //           |   |   |    |     |     MARKING     | <-> |       YOUNG GC       |
@@ -564,29 +556,23 @@ void ShenandoahOldGeneration::validate_transition(State new_state) {
   ShenandoahGenerationalHeap* heap = ShenandoahGenerationalHeap::heap();
   switch (new_state) {
     case FILLING:
-      assert(_state != BOOTSTRAPPING, "Cannot begin making old regions parsable after bootstrapping");
       assert(is_mark_complete(), "Cannot begin filling without first completing marking, state is '%s'", state_name(_state));
       assert(_old_heuristics->has_coalesce_and_fill_candidates(), "Cannot begin filling without something to fill.");
       break;
-    case WAITING_FOR_BOOTSTRAP:
+    case IDLE:
       // GC cancellation can send us back here from any state.
-      validate_waiting_for_bootstrap();
-      break;
-    case BOOTSTRAPPING:
-      assert(_state == WAITING_FOR_BOOTSTRAP, "Cannot reset bitmap without making old regions parsable, state is '%s'", state_name(_state));
-      assert(_old_heuristics->unprocessed_old_collection_candidates() == 0, "Cannot bootstrap with mixed collection candidates");
-      assert(!heap->is_prepare_for_old_mark_in_progress(), "Cannot still be making old regions parsable.");
+      validate_idle();
       break;
     case MARKING:
-      assert(_state == BOOTSTRAPPING, "Must have finished bootstrapping before marking, state is '%s'", state_name(_state));
-      assert(heap->young_generation()->old_gen_task_queues() != nullptr, "Young generation needs old mark queues.");
-      assert(heap->is_concurrent_old_mark_in_progress(), "Should be marking old now.");
+      assert(_state == IDLE, "Must be idle before marking, state is '%s'", state_name(_state));
+      assert(_old_heuristics->unprocessed_old_collection_candidates() == 0, "Cannot start marking with mixed collection candidates");
+      assert(!heap->is_prepare_for_old_mark_in_progress(), "Cannot still be making old regions parsable.");
       break;
     case EVACUATING_AFTER_GLOBAL:
       assert(_state == EVACUATING, "Must have been evacuating, state is '%s'", state_name(_state));
       break;
     case EVACUATING:
-      assert(_state == WAITING_FOR_BOOTSTRAP || _state == MARKING, "Cannot have old collection candidates without first marking, state is '%s'", state_name(_state));
+      assert(_state == IDLE || _state == MARKING, "Cannot have old collection candidates without first marking, state is '%s'", state_name(_state));
       assert(_old_heuristics->unprocessed_old_collection_candidates() > 0, "Must have collection candidates here.");
       break;
     default:
@@ -594,10 +580,10 @@ void ShenandoahOldGeneration::validate_transition(State new_state) {
   }
 }
 
-bool ShenandoahOldGeneration::validate_waiting_for_bootstrap() {
+bool ShenandoahOldGeneration::validate_idle() {
   ShenandoahHeap* heap = ShenandoahHeap::heap();
-  assert(!heap->is_concurrent_old_mark_in_progress(), "Cannot become ready for bootstrap during old mark.");
-  assert(heap->young_generation()->old_gen_task_queues() == nullptr, "Cannot become ready for bootstrap when still setup for bootstrapping.");
+  assert(!heap->is_concurrent_old_mark_in_progress(), "Cannot be idle during old mark.");
+  assert(heap->young_generation()->old_gen_task_queues() == nullptr, "Cannot be idle when still setup for bootstrapping.");
   assert(!is_concurrent_mark_in_progress(), "Cannot be marking in IDLE");
   assert(!heap->young_generation()->is_bootstrap_cycle(), "Cannot have old mark queues if IDLE");
   assert(!_old_heuristics->has_coalesce_and_fill_candidates(), "Cannot have coalesce and fill candidates in IDLE");
@@ -733,7 +719,7 @@ void ShenandoahOldGeneration::set_parsable(bool parsable) {
         // that we would unload classes and make everything parsable. But, we know
         // that now so we can override this state.
         abandon_collection_candidates();
-        transition_to(ShenandoahOldGeneration::WAITING_FOR_BOOTSTRAP);
+        transition_to(ShenandoahOldGeneration::IDLE);
         break;
       default:
         // We can get here during a full GC. The full GC will cancel anything
@@ -750,7 +736,7 @@ void ShenandoahOldGeneration::complete_mixed_evacuations() {
   assert(is_doing_mixed_evacuations(), "Mixed evacuations should be in progress");
   if (!_old_heuristics->has_coalesce_and_fill_candidates()) {
     // No candidate regions to coalesce and fill
-    transition_to(ShenandoahOldGeneration::WAITING_FOR_BOOTSTRAP);
+    transition_to(ShenandoahOldGeneration::IDLE);
     return;
   }
 
@@ -764,7 +750,7 @@ void ShenandoahOldGeneration::complete_mixed_evacuations() {
   // more to do.
   assert(state() == ShenandoahOldGeneration::EVACUATING_AFTER_GLOBAL, "Should be evacuating after a global cycle");
   abandon_collection_candidates();
-  transition_to(ShenandoahOldGeneration::WAITING_FOR_BOOTSTRAP);
+  transition_to(ShenandoahOldGeneration::IDLE);
 }
 
 void ShenandoahOldGeneration::abandon_mixed_evacuations() {
@@ -774,7 +760,7 @@ void ShenandoahOldGeneration::abandon_mixed_evacuations() {
       break;
     case ShenandoahOldGeneration::EVACUATING_AFTER_GLOBAL:
       abandon_collection_candidates();
-      transition_to(ShenandoahOldGeneration::WAITING_FOR_BOOTSTRAP);
+      transition_to(ShenandoahOldGeneration::IDLE);
       break;
     default:
       log_warning(gc)("Abandon mixed evacuations in unexpected state: %s", state_name(state()));
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahOldGeneration.hpp b/src/hotspot/share/gc/shenandoah/shenandoahOldGeneration.hpp
index 12e046a1afc..8a356fc9b92 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahOldGeneration.hpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahOldGeneration.hpp
@@ -256,11 +256,7 @@ public:
   }
 
   bool is_idle() const {
-    return state() == WAITING_FOR_BOOTSTRAP;
-  }
-
-  bool is_bootstrapping() const {
-    return state() == BOOTSTRAPPING;
+    return state() == IDLE;
   }
 
   // Amount of live memory (bytes) in regions waiting for mixed collections
@@ -271,11 +267,11 @@ public:
 
 public:
   enum State {
-    FILLING, WAITING_FOR_BOOTSTRAP, BOOTSTRAPPING, MARKING, EVACUATING, EVACUATING_AFTER_GLOBAL
+    FILLING, IDLE, MARKING, EVACUATING, EVACUATING_AFTER_GLOBAL
   };
 
 #ifdef ASSERT
-  bool validate_waiting_for_bootstrap();
+  bool validate_idle();
 #endif
 
 private:
@@ -318,7 +314,7 @@ public:
   size_t usage_trigger_threshold() const;
 
   bool can_start_gc() {
-    return _state == WAITING_FOR_BOOTSTRAP;
+    return _state == IDLE;
   }
 
   static const char* state_name(State state);

From a333111bd866b2da356b13ea9b8d362ae1c94107 Mon Sep 17 00:00:00 2001
From: Ioi Lam <iklam@openjdk.org>
Date: Fri, 3 Apr 2026 20:28:45 +0000
Subject: [PATCH 489/655] 8380291: AOT cache should store only unregistered
 classes with file: code source

Reviewed-by: kvn, iveresov
---
 .../share/classfile/classFileParser.cpp       |  7 +--
 .../classfile/systemDictionaryShared.cpp      | 14 ++++++
 .../classfile/systemDictionaryShared.hpp      |  1 +
 .../AOTCacheSupportForCustomLoaders.java      | 48 ++++++++++++++++++-
 4 files changed, 65 insertions(+), 5 deletions(-)

diff --git a/src/hotspot/share/classfile/classFileParser.cpp b/src/hotspot/share/classfile/classFileParser.cpp
index 404693f5cee..a9ea6fbea11 100644
--- a/src/hotspot/share/classfile/classFileParser.cpp
+++ b/src/hotspot/share/classfile/classFileParser.cpp
@@ -34,6 +34,7 @@
 #include "classfile/packageEntry.hpp"
 #include "classfile/symbolTable.hpp"
 #include "classfile/systemDictionary.hpp"
+#include "classfile/systemDictionaryShared.hpp"
 #include "classfile/verificationType.hpp"
 #include "classfile/verifier.hpp"
 #include "classfile/vmClasses.hpp"
@@ -86,9 +87,6 @@
 #include "utilities/macros.hpp"
 #include "utilities/ostream.hpp"
 #include "utilities/utf8.hpp"
-#if INCLUDE_CDS
-#include "classfile/systemDictionaryShared.hpp"
-#endif
 
 // We generally try to create the oops directly when parsing, rather than
 // allocating temporary data structures and copying the bytes twice. A
@@ -5256,6 +5254,9 @@ void ClassFileParser::fill_instance_klass(InstanceKlass* ik,
 
   if (!is_internal()) {
     ik->print_class_load_logging(_loader_data, module_entry, _stream);
+    if (CDSConfig::is_dumping_archive()) {
+      SystemDictionaryShared::check_code_source(ik, _stream);
+    }
 
     if (ik->minor_version() == JAVA_PREVIEW_MINOR_VERSION &&
         ik->major_version() == JVM_CLASSFILE_MAJOR_VERSION &&
diff --git a/src/hotspot/share/classfile/systemDictionaryShared.cpp b/src/hotspot/share/classfile/systemDictionaryShared.cpp
index 58d432a628c..fd30fc6766f 100644
--- a/src/hotspot/share/classfile/systemDictionaryShared.cpp
+++ b/src/hotspot/share/classfile/systemDictionaryShared.cpp
@@ -202,6 +202,20 @@ DumpTimeClassInfo* SystemDictionaryShared::get_info_locked(InstanceKlass* k) {
   return info;
 }
 
+void SystemDictionaryShared::check_code_source(InstanceKlass* ik, const ClassFileStream* cfs) {
+  if (CDSConfig::is_dumping_preimage_static_archive() && !is_builtin_loader(ik->class_loader_data())) {
+    if (cfs == nullptr || cfs->source() == nullptr || strncmp(cfs->source(), "file:", 5) != 0) {
+      // AOT cache filtering:
+      // For non-built-in loaders, cache only the classes that have a file: code source, so
+      // we can avoid caching dynamically generated classes that are likely to change from
+      // run to run. This is similar to the filtering in ClassListWriter::write_to_stream()
+      // for the classic CDS static archive.
+      SystemDictionaryShared::log_exclusion(ik, "Not loaded from \"file:\" code source");
+      SystemDictionaryShared::set_excluded(ik);
+    }
+  }
+}
+
 bool SystemDictionaryShared::should_be_excluded_impl(InstanceKlass* k, DumpTimeClassInfo* info) {
   assert_lock_strong(DumpTimeTable_lock);
 
diff --git a/src/hotspot/share/classfile/systemDictionaryShared.hpp b/src/hotspot/share/classfile/systemDictionaryShared.hpp
index 33b245e26fc..c837a386344 100644
--- a/src/hotspot/share/classfile/systemDictionaryShared.hpp
+++ b/src/hotspot/share/classfile/systemDictionaryShared.hpp
@@ -235,6 +235,7 @@ public:
   static void update_shared_entry(InstanceKlass* klass, int id);
   static void set_shared_class_misc_info(InstanceKlass* k, ClassFileStream* cfs);
 
+  static void check_code_source(InstanceKlass* ik, const ClassFileStream* cfs) NOT_CDS_RETURN;
   static InstanceKlass* lookup_from_stream(Symbol* class_name,
                                            Handle class_loader,
                                            Handle protection_domain,
diff --git a/test/hotspot/jtreg/runtime/cds/appcds/aotCache/AOTCacheSupportForCustomLoaders.java b/test/hotspot/jtreg/runtime/cds/appcds/aotCache/AOTCacheSupportForCustomLoaders.java
index 1a8313a3058..9fef0845d1d 100644
--- a/test/hotspot/jtreg/runtime/cds/appcds/aotCache/AOTCacheSupportForCustomLoaders.java
+++ b/test/hotspot/jtreg/runtime/cds/appcds/aotCache/AOTCacheSupportForCustomLoaders.java
@@ -31,7 +31,10 @@
  * @build ReturnIntegerAsString
  * @build AOTCacheSupportForCustomLoaders
  * @run driver jdk.test.lib.helpers.ClassFileInstaller -jar app.jar AppWithCustomLoaders AppWithCustomLoaders$MyLoader
- * @run driver jdk.test.lib.helpers.ClassFileInstaller -jar cust.jar AppWithCustomLoaders$MyLoadeeA AppWithCustomLoaders$MyLoadeeB ReturnIntegerAsString
+ * @run driver jdk.test.lib.helpers.ClassFileInstaller -jar cust.jar
+ *                 AppWithCustomLoaders$MyLoadeeA AppWithCustomLoaders$MyLoadeeB
+ *                 AppWithCustomLoaders$MyLoadeeC AppWithCustomLoaders$MyLoadeeD
+ *                 ReturnIntegerAsString
  * @run driver AOTCacheSupportForCustomLoaders AOT
  */
 
@@ -40,6 +43,7 @@ import java.lang.module.ModuleFinder;
 import java.net.URL;
 import java.net.URLClassLoader;
 import java.io.File;
+import java.io.InputStream;
 import java.nio.file.Path;
 import java.nio.file.Paths;
 import java.util.Set;
@@ -62,10 +66,17 @@ public class AOTCacheSupportForCustomLoaders {
                        "--module-path=" + modulePath,
                        "--add-modules=com.test")
             .appCommandLine("AppWithCustomLoaders", modulePath)
+            .setTrainingChecker((OutputAnalyzer out) -> {
+                    out.shouldContain("Skipping AppWithCustomLoaders$MyLoadeeC: Not loaded from \"file:\" code source")
+                       .shouldContain("Skipping AppWithCustomLoaders$MyLoadeeD: super AppWithCustomLoaders$MyLoadeeC is excluded")
+                       .shouldContain("Skipping ReturnIntegerAsString: Failed verification");
+                })
             .setAssemblyChecker((OutputAnalyzer out) -> {
                     out.shouldMatch(",class.*unreg AppWithCustomLoaders[$]MyLoadeeA")
                        .shouldMatch(",class.*unreg com.test.Foo")
                        .shouldMatch(",class.*array \\[LAppWithCustomLoaders[$]MyLoadeeA;")
+                       .shouldNotMatch("class.*unreg.*MyLoadeeC") // not from "file:" code source
+                       .shouldNotMatch("class.*unreg.*MyLoadeeD") // parent is not from "file:" code source
                        .shouldNotMatch(",class.* ReturnIntegerAsString");
                 })
             .setProductionChecker((OutputAnalyzer out) -> {
@@ -76,7 +87,7 @@ public class AOTCacheSupportForCustomLoaders {
 }
 
 class AppWithCustomLoaders {
-    static MyLoader loader; // keep alive so its classes can be cached.
+    static MyLoader loader; // keep alive
 
     public static void main(String args[]) throws Exception {
         File custJar = new File("cust.jar");
@@ -86,6 +97,7 @@ class AppWithCustomLoaders {
         test1(loader);
         test2(loader);
         test3(args[0]);
+        test4(loader);
 
         // TODO: more test cases JDK-8354557
     }
@@ -147,10 +159,37 @@ class AppWithCustomLoaders {
         }
     }
 
+    // Test 4: classes that don't use file: code source should be excluded
+    static void test4(MyLoader loader) throws Exception {
+        Class c = loader.loadLoadeeC();
+        Class d = loader.loadClass("AppWithCustomLoaders$MyLoadeeD");
+
+        URL ccs = c.getProtectionDomain().getCodeSource().getLocation();
+
+        if (ccs != null) {
+            throw new RuntimeException("MyLoadeeC should have null CodeSource but got: " + ccs);
+        }
+
+        if (d.getSuperclass() != c) {
+            throw new RuntimeException("MyLoadeeC should be super class of MyLoadeeD");
+        }
+    }
+
     public static class MyLoader extends URLClassLoader {
         public MyLoader(URL[] urls, ClassLoader parent) {
             super(urls, parent);
         }
+
+        public Class<?> loadLoadeeC() throws Exception {
+            try (InputStream in = getResourceAsStream("AppWithCustomLoaders$MyLoadeeC.class")) {
+                byte[] b = in.readAllBytes();
+                // Define MyLoadeeC without specifying a ProtectionDomain. As a result, this
+                // class will get an empty ProtectionDomain whose CodeSource location will be null.
+                //
+                // This class should be excluded from the AOT cache. See JDK-8380291
+                return defineClass(b, 0, b.length);
+            }
+        }
     }
 
     public static class MyLoadeeA {
@@ -180,4 +219,9 @@ class AppWithCustomLoaders {
     }
 
     public static class MyLoadeeB extends MyLoadeeA {}
+
+
+    public static class MyLoadeeC {}
+
+    public static class MyLoadeeD extends MyLoadeeC {}
 }

From f21e47db805b56d5bf183d7a2cfba076f380612a Mon Sep 17 00:00:00 2001
From: William Kemper <wkemper@openjdk.org>
Date: Fri, 3 Apr 2026 21:04:52 +0000
Subject: [PATCH 490/655] 8381549: GenShen: Global collections skip coalesce
 and fill when the collection set is empty

Reviewed-by: kdnilsen, xpeng, ysr
---
 .../heuristics/shenandoahGenerationalHeuristics.cpp           | 4 ++--
 src/hotspot/share/gc/shenandoah/shenandoahOldGeneration.cpp   | 2 +-
 src/hotspot/share/gc/shenandoah/shenandoahOldGeneration.hpp   | 2 +-
 3 files changed, 4 insertions(+), 4 deletions(-)

diff --git a/src/hotspot/share/gc/shenandoah/heuristics/shenandoahGenerationalHeuristics.cpp b/src/hotspot/share/gc/shenandoah/heuristics/shenandoahGenerationalHeuristics.cpp
index d5622ed5d79..45ba2740ea5 100644
--- a/src/hotspot/share/gc/shenandoah/heuristics/shenandoahGenerationalHeuristics.cpp
+++ b/src/hotspot/share/gc/shenandoah/heuristics/shenandoahGenerationalHeuristics.cpp
@@ -84,7 +84,7 @@ void ShenandoahGenerationalHeuristics::choose_collection_set(ShenandoahCollectio
   // Choose the collection set
   filter_regions(collection_set);
 
-  if (!collection_set->is_empty() && _generation->is_global()) {
+  if (_generation->is_global()) {
     // We have just chosen a collection set for a global cycle. The mark bitmap covering old regions is complete, so
     // the remembered set scan can use that to avoid walking into garbage. When the next old mark begins, we will
     // use the mark bitmap to make the old regions parsable by coalescing and filling any unmarked objects. Thus,
@@ -94,7 +94,7 @@ void ShenandoahGenerationalHeuristics::choose_collection_set(ShenandoahCollectio
     // coalesce those regions. Only the old regions which are not part of the collection set at this point are
     // eligible for coalescing. As implemented now, this has the side effect of possibly initiating mixed-evacuations
     // after a global cycle for old regions that were not included in this collection set.
-    heap->old_generation()->prepare_for_mixed_collections_after_global_gc();
+    heap->old_generation()->transition_old_generation_after_global_gc();
   }
 }
 
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahOldGeneration.cpp b/src/hotspot/share/gc/shenandoah/shenandoahOldGeneration.cpp
index bbfa0961e86..4ad7d2a1ae5 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahOldGeneration.cpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahOldGeneration.cpp
@@ -685,7 +685,7 @@ void ShenandoahOldGeneration::abandon_collection_candidates() {
   _old_heuristics->abandon_collection_candidates();
 }
 
-void ShenandoahOldGeneration::prepare_for_mixed_collections_after_global_gc() {
+void ShenandoahOldGeneration::transition_old_generation_after_global_gc() {
   assert(is_mark_complete(), "Expected old generation mark to be complete after global cycle.");
   _old_heuristics->prepare_for_old_collections();
   log_info(gc, ergo)("After choosing global collection set, mixed candidates: " UINT32_FORMAT ", coalescing candidates: %zu",
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahOldGeneration.hpp b/src/hotspot/share/gc/shenandoah/shenandoahOldGeneration.hpp
index 8a356fc9b92..630736190f0 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahOldGeneration.hpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahOldGeneration.hpp
@@ -213,7 +213,7 @@ public:
   bool is_concurrent_mark_in_progress() override;
 
   bool entry_coalesce_and_fill();
-  void prepare_for_mixed_collections_after_global_gc();
+  void transition_old_generation_after_global_gc();
   void prepare_gc() override;
   void prepare_regions_and_collection_set(bool concurrent) override;
   void record_success_concurrent(bool abbreviated) override;

From 1d290109d33a1b4bac671bb8d530a2d15424a683 Mon Sep 17 00:00:00 2001
From: Daisuke Yamazaki <dyama@openjdk.org>
Date: Mon, 6 Apr 2026 03:08:19 +0000
Subject: [PATCH 491/655] 8379675:
 test/jdk/sun/security/pkcs11/rsa/GenKeyStore.java uses removed methods

Reviewed-by: weijun
---
 test/jdk/sun/security/rsa/GenKeyStore.java | 29 +++++++++++-----------
 1 file changed, 14 insertions(+), 15 deletions(-)

diff --git a/test/jdk/sun/security/rsa/GenKeyStore.java b/test/jdk/sun/security/rsa/GenKeyStore.java
index 26178e9a576..8b0016e77af 100644
--- a/test/jdk/sun/security/rsa/GenKeyStore.java
+++ b/test/jdk/sun/security/rsa/GenKeyStore.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2012, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2012, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,6 +25,9 @@
 // program to generate rsakeys.ks. does not need to run during testing
 // checked into the workspace so that the keystore file can be recreated
 // in the future if needed.
+//
+// To run:
+//   java --add-exports java.base/sun.security.x509=ALL-UNNAMED GenKeyStore.java
 
 // @author Andreas Sterbenz
 
@@ -43,26 +46,22 @@ public class GenKeyStore {
 
     static final char[] password = "test12".toCharArray();
 
-    private static X509Certificate getCertificate(String suffix, PublicKey publicKey, PrivateKey privateKey) throws Exception {
+    private static X509Certificate getCertificate(String suffix,
+                                                    PublicKey publicKey,
+                                                    PrivateKey privateKey) throws Exception {
         X500Name name = new X500Name("CN=Dummy Certificate " + suffix);
         String algorithm = "SHA1with" + publicKey.getAlgorithm();
         Date date = new Date();
-        AlgorithmId algID = AlgorithmId.getAlgorithmId(algorithm);
 
         X509CertInfo certInfo = new X509CertInfo();
+        certInfo.setVersion(new CertificateVersion(CertificateVersion.V1));
+        certInfo.setSerialNumber(new CertificateSerialNumber(1));
+        certInfo.setSubject(name);
+        certInfo.setIssuer(name);
+        certInfo.setKey(new CertificateX509Key(publicKey));
+        certInfo.setValidity(new CertificateValidity(date, date));
 
-        certInfo.set(X509CertInfo.VERSION, new CertificateVersion(CertificateVersion.V1));
-        certInfo.set(X509CertInfo.SERIAL_NUMBER, new CertificateSerialNumber(1));
-        certInfo.set(X509CertInfo.ALGORITHM_ID, new CertificateAlgorithmId(algID));
-        certInfo.set(X509CertInfo.SUBJECT, name);
-        certInfo.set(X509CertInfo.ISSUER, name);
-        certInfo.set(X509CertInfo.KEY, new CertificateX509Key(publicKey));
-        certInfo.set(X509CertInfo.VALIDITY, new CertificateValidity(date, date));
-
-        X509CertImpl cert = new X509CertImpl(certInfo);
-        cert.sign(privateKey, algorithm);
-
-        return cert;
+        return X509CertImpl.newSigned(certInfo, privateKey, algorithm);
     }
 
     private static void addToKeyStore(KeyStore ks, KeyPair kp, String name) throws Exception {

From f40a359df36edef8df5a72e3c072967924636264 Mon Sep 17 00:00:00 2001
From: Jaikiran Pai <jpai@openjdk.org>
Date: Mon, 6 Apr 2026 13:21:44 +0000
Subject: [PATCH 492/655] 8373778: java.util.NoSuchElementException in
 HttpURLConnection.doTunneling0 when connecting via HTTPS

Reviewed-by: michaelm, vyazici
---
 .../www/protocol/http/HttpURLConnection.java  |  43 ++-
 .../HttpURLConnection/ProxyBadStatusLine.java | 266 ++++++++++++++++++
 2 files changed, 306 insertions(+), 3 deletions(-)
 create mode 100644 test/jdk/java/net/HttpURLConnection/ProxyBadStatusLine.java

diff --git a/src/java.base/share/classes/sun/net/www/protocol/http/HttpURLConnection.java b/src/java.base/share/classes/sun/net/www/protocol/http/HttpURLConnection.java
index 3a915cf96df..480553e9a62 100644
--- a/src/java.base/share/classes/sun/net/www/protocol/http/HttpURLConnection.java
+++ b/src/java.base/share/classes/sun/net/www/protocol/http/HttpURLConnection.java
@@ -1924,9 +1924,15 @@ public class HttpURLConnection extends java.net.HttpURLConnection {
                 }
 
                 statusLine = responses.getValue(0);
-                StringTokenizer st = new StringTokenizer(statusLine);
-                st.nextToken();
-                respCode = Integer.parseInt(st.nextToken().trim());
+                respCode = parseConnectResponseCode(statusLine);
+                if (respCode == -1) {
+                    // a respCode of -1, due to a invalid status line,
+                    // will (rightly) result in an IOException being thrown
+                    // later in this code. here we merely log the invalid status line.
+                    if (logger.isLoggable(PlatformLogger.Level.FINE)) {
+                        logger.fine("invalid status line: \"" + statusLine + "\"");
+                    }
+                }
                 if (respCode == HTTP_PROXY_AUTH) {
                     // Read comments labeled "Failed Negotiate" for details.
                     boolean dontUseNegotiate = false;
@@ -2027,6 +2033,37 @@ public class HttpURLConnection extends java.net.HttpURLConnection {
         responses.reset();
     }
 
+    // parses the status line, that was returned for a CONNECT request, and returns
+    // the response code from that line. returns -1 if the response code could not be
+    // parsed.
+    private static int parseConnectResponseCode(final String statusLine) {
+        final int invalidStatusLine = -1;
+        if (statusLine == null || statusLine.isBlank()) {
+            return invalidStatusLine;
+        }
+        //
+        // status-line = HTTP-version SP status-code SP [ reason-phrase ]
+        // SP = space character
+        //
+        final StringTokenizer st = new StringTokenizer(statusLine, " ");
+        if (!st.hasMoreTokens()) {
+            return invalidStatusLine;
+        }
+        st.nextToken(); // the HTTP version part (ex: HTTP/1.1)
+        if (!st.hasMoreTokens()) {
+            return invalidStatusLine;
+        }
+        final String v = st.nextToken().trim(); // status code
+        try {
+            return Integer.parseInt(v);
+        } catch (NumberFormatException nfe) {
+            if (logger.isLoggable(PlatformLogger.Level.FINE)) {
+                logger.fine("invalid response code: " + v);
+            }
+        }
+        return invalidStatusLine;
+    }
+
     /**
      * Overridden in https to also include the server certificate
      */
diff --git a/test/jdk/java/net/HttpURLConnection/ProxyBadStatusLine.java b/test/jdk/java/net/HttpURLConnection/ProxyBadStatusLine.java
new file mode 100644
index 00000000000..be881030715
--- /dev/null
+++ b/test/jdk/java/net/HttpURLConnection/ProxyBadStatusLine.java
@@ -0,0 +1,266 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+import java.io.IOException;
+import java.io.InputStream;
+import java.io.OutputStream;
+import java.net.HttpURLConnection;
+import java.net.InetAddress;
+import java.net.InetSocketAddress;
+import java.net.Proxy;
+import java.net.ServerSocket;
+import java.net.Socket;
+import java.net.URL;
+import java.util.List;
+
+import jdk.test.lib.net.URIBuilder;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.Arguments;
+import org.junit.jupiter.params.provider.MethodSource;
+import static java.net.Proxy.Type.HTTP;
+import static java.nio.charset.StandardCharsets.ISO_8859_1;
+import static org.junit.jupiter.api.Assertions.assertThrows;
+
+/* @test
+ * @bug 8373778
+ * @summary Verify that a IOException gets thrown from HttpURLConnection, if the proxy returns
+ *          an invalid status line in response to a CONNECT request
+ * @library /test/lib
+ * @build jdk.test.lib.net.URIBuilder
+ * @run junit ${test.main.class}
+ */
+class ProxyBadStatusLine {
+
+    static List<Arguments> badStatusLines() {
+        return List.of(
+                Arguments.of("", "Unexpected end of file from server"),
+                Arguments.of(" ", "Unexpected end of file from server"),
+                Arguments.of("\t", "Unexpected end of file from server"),
+                Arguments.of("\r\n", "Unexpected end of file from server"),
+
+                Arguments.of("HTTP/1.", "Unable to tunnel through proxy"),
+                Arguments.of("HTTP/1.1", "Unable to tunnel through proxy"),
+                Arguments.of("HTTP/1.0", "Unable to tunnel through proxy"),
+                Arguments.of("HTTP/1.1     ", "Unable to tunnel through proxy"),
+                Arguments.of("HTTP/1.1\r\n", "Unable to tunnel through proxy"),
+                Arguments.of("HTTP/1.1\n", "Unable to tunnel through proxy"),
+                Arguments.of("HTTP/1.1 301 ", "Unable to tunnel through proxy"),
+                Arguments.of("HTTP/1.1 404 ", "Unable to tunnel through proxy"),
+                Arguments.of("HTTP/1.1 503 ", "Unable to tunnel through proxy"),
+                Arguments.of("HTTP/1.1\n200 ", "Unable to tunnel through proxy"),
+                Arguments.of("HTTP/1.1\r200 ", "Unable to tunnel through proxy"),
+                Arguments.of("HTTP/1.1\f200 ", "Unable to tunnel through proxy")
+        );
+    }
+
+    /*
+     * Uses HttpURLConnection to initiate a HTTP request that results in a CONNECT
+     * request to a proxy server. The proxy server then responds with a bad status line.
+     * The test expects that an IOException gets thrown back to the application (instead
+     * of some unspecified exception).
+     */
+    @ParameterizedTest
+    @MethodSource(value = "badStatusLines")
+    void testProxyConnectResponse(final String badStatusLine, final String expectedExceptionMsg)
+            throws Exception {
+        final InetSocketAddress irrelevantTargetServerAddr =
+                new InetSocketAddress(InetAddress.getLoopbackAddress(), 12345);
+        final URL url = URIBuilder.newBuilder()
+                .scheme("https")
+                .host(irrelevantTargetServerAddr.getAddress())
+                .port(irrelevantTargetServerAddr.getPort())
+                .path("/doesnotmatter")
+                .build().toURL();
+
+        Thread proxyServerThread = null;
+        try (final BadProxyServer proxy = new BadProxyServer(badStatusLine)) {
+
+            proxyServerThread = Thread.ofPlatform().name("proxy-server").start(proxy);
+            final HttpURLConnection urlc = (HttpURLConnection)
+                    url.openConnection(new Proxy(HTTP, proxy.getAddress()));
+
+            final IOException ioe = assertThrows(IOException.class, () -> urlc.getInputStream());
+            final String exMsg = ioe.getMessage();
+            if (exMsg == null || !exMsg.contains(expectedExceptionMsg)) {
+                // unexpected message in the exception, propagate the exception
+                throw ioe;
+            }
+            System.err.println("got excepted exception: " + ioe);
+        } finally {
+            if (proxyServerThread != null) {
+                System.err.println("waiting for proxy server thread to complete");
+                proxyServerThread.join();
+            }
+        }
+    }
+
+    private static final class BadProxyServer implements Runnable, AutoCloseable {
+        private static final int CR = '\r';
+        private static final int LF = '\n';
+
+        private final ServerSocket serverSocket;
+        private final String connectRespStatusLine;
+        private volatile boolean closed;
+
+        /**
+         *
+         * @param connectRespStatusLine the status line that this server writes
+         *                              out in response to a CONNECT request
+         * @throws IOException
+         */
+        BadProxyServer(final String connectRespStatusLine) throws IOException {
+            this.connectRespStatusLine = connectRespStatusLine;
+            final int port = 0;
+            final int backlog = 0;
+            this.serverSocket = new ServerSocket(port, backlog, InetAddress.getLoopbackAddress());
+        }
+
+        InetSocketAddress getAddress() {
+            return (InetSocketAddress) this.serverSocket.getLocalSocketAddress();
+        }
+
+        @Override
+        public void close() {
+            if (this.closed) {
+                return;
+            }
+            synchronized (this) {
+                if (this.closed) {
+                    return;
+                }
+                this.closed = true;
+            }
+            try {
+                this.serverSocket.close();
+            } catch (IOException e) {
+                System.err.println("failed to close proxy server: " + e);
+                e.printStackTrace();
+            }
+        }
+
+        @Override
+        public void run() {
+            try {
+                doRun();
+            } catch (Throwable t) {
+                if (!closed) {
+                    System.err.println("Proxy server ran into exception: " + t);
+                    t.printStackTrace();
+                }
+            }
+            System.err.println("Proxy server " + this.serverSocket + " exiting");
+        }
+
+        private void doRun() throws IOException {
+            while (!closed) {
+                System.err.println("waiting for incoming connection at " + this.serverSocket);
+                try (final Socket accepted = this.serverSocket.accept()) {
+                    System.err.println("accepted incoming connection from " + accepted);
+                    handleIncomingConnection(accepted);
+                }
+            }
+        }
+
+        private static int findCRLF(final byte[] b) {
+            for (int i = 0; i < b.length - 1; i++) {
+                if (b[i] == CR && b[i + 1] == LF) {
+                    return i;
+                }
+            }
+            return -1;
+        }
+
+        // writes out a status line in response to a CONNECT request
+        private void handleIncomingConnection(final Socket acceptedSocket) throws IOException {
+            final byte[] req = readRequest(acceptedSocket.getInputStream());
+            final int crlfIndex = findCRLF(req);
+            if (crlfIndex < 0) {
+                System.err.println("unexpected request content from " + acceptedSocket);
+                // nothing to process, ignore this connection
+                return;
+            }
+            final String requestLine = new String(req, 0, crlfIndex, ISO_8859_1);
+            System.err.println("received request line: \"" + requestLine + "\"");
+            final String[] parts = requestLine.split(" ");
+            if (parts[0].equals("CONNECT")) {
+                // reply back with the status line
+                try (final OutputStream os = acceptedSocket.getOutputStream()) {
+                    System.err.println("responding to CONNECT request from " + acceptedSocket
+                            + ", response status line: \"" + connectRespStatusLine + "\"");
+                    final byte[] statusLine = connectRespStatusLine.getBytes(ISO_8859_1);
+                    os.write(statusLine);
+                }
+            } else {
+                System.err.println("unexpected request from " + acceptedSocket + ": \"" + requestLine + "\"");
+                return;
+            }
+        }
+
+        private static byte[] readRequest(InputStream is) throws IOException {
+            // we don't expect the HTTP request body in this test to be larger than this size
+            final byte[] buff = new byte[4096];
+            int crlfcount = 0;
+            int numRead = 0;
+            int c;
+            while ((c = is.read()) != -1 && numRead < buff.length) {
+                buff[numRead++] = (byte) c;
+                //
+                // HTTP-message = start-line CRLF
+                //               *( field-line CRLF )
+                //               CRLF
+                //               [ message-body ]
+                //
+                // start-line = request-line / status-line
+                //
+                // we are not interested in the message body, so this loop is
+                // looking for the CRLFCRLF sequence to stop parsing the request
+                // content
+                if (c == CR || c == LF) {
+                    switch (crlfcount) {
+                        case 0, 2 -> {
+                            if (c == CR) {
+                                crlfcount++;
+                            }
+                        }
+                        case 1, 3 -> {
+                            if (c == LF) {
+                                crlfcount++;
+                            }
+                        }
+                    }
+                } else {
+                    crlfcount = 0;
+                }
+                if (crlfcount == 4) {
+                    break;
+                }
+            }
+            if (crlfcount != 4) {
+                throw new IOException("Could not locate a CRLFCRLF sequence in the request");
+            }
+            final byte[] request = new byte[numRead];
+            System.arraycopy(buff, 0, request, 0, numRead);
+            return request;
+        }
+    }
+}

From 4fcf913b93bb58d49be20fb99ee4431200ce0dd5 Mon Sep 17 00:00:00 2001
From: Vicente Romero <vromero@openjdk.org>
Date: Mon, 6 Apr 2026 13:48:34 +0000
Subject: [PATCH 493/655] 8381639: Remove bug id 8381475 from
 test/jdk/tools/sincechecker/modules/jdk.compiler/JdkCompilerCheckSince.java

Reviewed-by: liach
---
 .../modules/jdk.compiler/JdkCompilerCheckSince.java             | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/test/jdk/tools/sincechecker/modules/jdk.compiler/JdkCompilerCheckSince.java b/test/jdk/tools/sincechecker/modules/jdk.compiler/JdkCompilerCheckSince.java
index bf4b906b623..5eb819786e9 100644
--- a/test/jdk/tools/sincechecker/modules/jdk.compiler/JdkCompilerCheckSince.java
+++ b/test/jdk/tools/sincechecker/modules/jdk.compiler/JdkCompilerCheckSince.java
@@ -23,7 +23,7 @@
 
 /*
  * @test
- * @bug 8341399 8381475
+ * @bug 8341399
  * @summary Test for `@since` in jdk.compiler module
  * @library /test/lib /test/jdk/tools/sincechecker
  * @run main SinceChecker jdk.compiler

From 133c0424b9df25ec8fb95404ee64e611ebad31e2 Mon Sep 17 00:00:00 2001
From: Ashutosh Mehra <asmehra@openjdk.org>
Date: Mon, 6 Apr 2026 15:30:55 +0000
Subject: [PATCH 494/655] 8364584: Inconsistency in setting up cpu feature bits

Reviewed-by: kvn, iklam
---
 .../cpu/aarch64/vm_version_aarch64.cpp        | 113 ++++++-------
 .../cpu/aarch64/vm_version_aarch64.hpp        |   2 +
 .../cpu/x86/stubGenerator_x86_64_aes.cpp      |   2 +-
 .../cpu/x86/stubGenerator_x86_64_fmod.cpp     |   2 +-
 src/hotspot/cpu/x86/vm_version_x86.cpp        | 153 ++++++++----------
 src/hotspot/cpu/x86/vm_version_x86.hpp        |   5 +
 .../share/runtime/abstract_vm_version.hpp     |  15 ++
 .../cpuflags/CPUFeaturesClearTest.java        | 143 ++++++++++++++++
 8 files changed, 286 insertions(+), 149 deletions(-)
 create mode 100644 test/hotspot/jtreg/compiler/cpuflags/CPUFeaturesClearTest.java

diff --git a/src/hotspot/cpu/aarch64/vm_version_aarch64.cpp b/src/hotspot/cpu/aarch64/vm_version_aarch64.cpp
index 8ccffac25a8..b39d1618b3d 100644
--- a/src/hotspot/cpu/aarch64/vm_version_aarch64.cpp
+++ b/src/hotspot/cpu/aarch64/vm_version_aarch64.cpp
@@ -97,8 +97,9 @@ void VM_Version::initialize() {
   _supports_atomic_getadd8 = true;
 
   get_os_cpu_info();
+  _cpu_features = _features;
 
-  int dcache_line = VM_Version::dcache_line_size();
+  int dcache_line = dcache_line_size();
 
   // Limit AllocatePrefetchDistance so that it does not exceed the
   // static constraint of 512 defined in runtime/globals.hpp.
@@ -146,7 +147,7 @@ void VM_Version::initialize() {
     // if dcpop is available publish data cache line flush size via
     // generic field, otherwise let if default to zero thereby
     // disabling writeback
-    if (VM_Version::supports_dcpop()) {
+    if (supports_dcpop()) {
       _data_cache_line_flush_size = dcache_line;
     }
   }
@@ -267,14 +268,24 @@ void VM_Version::initialize() {
     }
   }
 
-  if (FLAG_IS_DEFAULT(UseCRC32)) {
-    UseCRC32 = VM_Version::supports_crc32();
+  if (supports_sha1() || supports_sha256() ||
+      supports_sha3() || supports_sha512()) {
+    if (FLAG_IS_DEFAULT(UseSHA)) {
+      FLAG_SET_DEFAULT(UseSHA, true);
+    } else if (!UseSHA) {
+      clear_feature(CPU_SHA1);
+      clear_feature(CPU_SHA2);
+      clear_feature(CPU_SHA3);
+      clear_feature(CPU_SHA512);
+    }
+  } else if (UseSHA) {
+    warning("SHA instructions are not available on this CPU");
+    FLAG_SET_DEFAULT(UseSHA, false);
   }
 
-  if (UseCRC32 && !VM_Version::supports_crc32()) {
-    warning("UseCRC32 specified, but not supported on this CPU");
-    FLAG_SET_DEFAULT(UseCRC32, false);
-  }
+  CHECK_CPU_FEATURE(supports_crc32, CRC32);
+  CHECK_CPU_FEATURE(supports_lse, LSE);
+  CHECK_CPU_FEATURE(supports_aes, AES);
 
   if (_cpu == CPU_ARM &&
       model_is_in({ CPU_MODEL_ARM_NEOVERSE_V1, CPU_MODEL_ARM_NEOVERSE_V2,
@@ -287,7 +298,7 @@ void VM_Version::initialize() {
     }
   }
 
-  if (UseCryptoPmullForCRC32 && (!VM_Version::supports_pmull() || !VM_Version::supports_sha3() || !VM_Version::supports_crc32())) {
+  if (UseCryptoPmullForCRC32 && (!supports_pmull() || !supports_sha3() || !supports_crc32())) {
     warning("UseCryptoPmullForCRC32 specified, but not supported on this CPU");
     FLAG_SET_DEFAULT(UseCryptoPmullForCRC32, false);
   }
@@ -301,48 +312,40 @@ void VM_Version::initialize() {
     FLAG_SET_DEFAULT(UseVectorizedMismatchIntrinsic, false);
   }
 
-  if (VM_Version::supports_lse()) {
-    if (FLAG_IS_DEFAULT(UseLSE))
-      FLAG_SET_DEFAULT(UseLSE, true);
-  } else {
-    if (UseLSE) {
-      warning("UseLSE specified, but not supported on this CPU");
-      FLAG_SET_DEFAULT(UseLSE, false);
-    }
-  }
-
-  if (VM_Version::supports_aes()) {
-    UseAES = UseAES || FLAG_IS_DEFAULT(UseAES);
-    UseAESIntrinsics =
-        UseAESIntrinsics || (UseAES && FLAG_IS_DEFAULT(UseAESIntrinsics));
-    if (UseAESIntrinsics && !UseAES) {
-      warning("UseAESIntrinsics enabled, but UseAES not, enabling");
-      UseAES = true;
+  if (supports_aes()) {
+    if (FLAG_IS_DEFAULT(UseAESIntrinsics)) {
+      FLAG_SET_DEFAULT(UseAESIntrinsics, true);
     }
     if (FLAG_IS_DEFAULT(UseAESCTRIntrinsics)) {
       FLAG_SET_DEFAULT(UseAESCTRIntrinsics, true);
     }
   } else {
-    if (UseAES) {
-      warning("AES instructions are not available on this CPU");
-      FLAG_SET_DEFAULT(UseAES, false);
-    }
-    if (UseAESIntrinsics) {
-      warning("AES intrinsics are not available on this CPU");
-      FLAG_SET_DEFAULT(UseAESIntrinsics, false);
-    }
-    if (UseAESCTRIntrinsics) {
-      warning("AES/CTR intrinsics are not available on this CPU");
-      FLAG_SET_DEFAULT(UseAESCTRIntrinsics, false);
+    if (!UseAES) {
+      if (UseAESIntrinsics) {
+        warning("AES intrinsics require UseAES flag to be enabled. Intrinsics will be disabled.");
+        FLAG_SET_DEFAULT(UseAESIntrinsics, false);
+      }
+      if (UseAESCTRIntrinsics) {
+        warning("AES/CTR intrinsics require UseAES flag to be enabled. Intrinsics will be disabled.");
+        FLAG_SET_DEFAULT(UseAESCTRIntrinsics, false);
+      }
+    } else if (!cpu_supports_aes()) {
+      if (UseAESIntrinsics) {
+        warning("AES intrinsics are not available on this CPU");
+        FLAG_SET_DEFAULT(UseAESIntrinsics, false);
+      }
+      if (UseAESCTRIntrinsics) {
+        warning("AES/CTR intrinsics are not available on this CPU");
+        FLAG_SET_DEFAULT(UseAESCTRIntrinsics, false);
+      }
     }
   }
 
-
   if (FLAG_IS_DEFAULT(UseCRC32Intrinsics)) {
     UseCRC32Intrinsics = true;
   }
 
-  if (VM_Version::supports_crc32()) {
+  if (supports_crc32()) {
     if (FLAG_IS_DEFAULT(UseCRC32CIntrinsics)) {
       FLAG_SET_DEFAULT(UseCRC32CIntrinsics, true);
     }
@@ -359,17 +362,7 @@ void VM_Version::initialize() {
     UseMD5Intrinsics = true;
   }
 
-  if (VM_Version::supports_sha1() || VM_Version::supports_sha256() ||
-      VM_Version::supports_sha3() || VM_Version::supports_sha512()) {
-    if (FLAG_IS_DEFAULT(UseSHA)) {
-      FLAG_SET_DEFAULT(UseSHA, true);
-    }
-  } else if (UseSHA) {
-    warning("SHA instructions are not available on this CPU");
-    FLAG_SET_DEFAULT(UseSHA, false);
-  }
-
-  if (UseSHA && VM_Version::supports_sha1()) {
+  if (UseSHA && supports_sha1()) {
     if (FLAG_IS_DEFAULT(UseSHA1Intrinsics)) {
       FLAG_SET_DEFAULT(UseSHA1Intrinsics, true);
     }
@@ -378,7 +371,7 @@ void VM_Version::initialize() {
     FLAG_SET_DEFAULT(UseSHA1Intrinsics, false);
   }
 
-  if (UseSHA && VM_Version::supports_sha256()) {
+  if (UseSHA && supports_sha256()) {
     if (FLAG_IS_DEFAULT(UseSHA256Intrinsics)) {
       FLAG_SET_DEFAULT(UseSHA256Intrinsics, true);
     }
@@ -388,7 +381,7 @@ void VM_Version::initialize() {
   }
 
   if (UseSHA) {
-    // No need to check VM_Version::supports_sha3(), since a fallback GPR intrinsic implementation is provided.
+    // No need to check supports_sha3(), since a fallback GPR intrinsic implementation is provided.
     if (FLAG_IS_DEFAULT(UseSHA3Intrinsics)) {
       FLAG_SET_DEFAULT(UseSHA3Intrinsics, true);
     }
@@ -398,7 +391,7 @@ void VM_Version::initialize() {
     FLAG_SET_DEFAULT(UseSHA3Intrinsics, false);
   }
 
-  if (UseSHA3Intrinsics && VM_Version::supports_sha3()) {
+  if (UseSHA3Intrinsics && supports_sha3()) {
     // Auto-enable UseSIMDForSHA3Intrinsic on hardware with performance benefit.
     // Note that the evaluation of SHA3 extension Intrinsics shows better performance
     // on Apple and Qualcomm silicon but worse performance on Neoverse V1 and N2.
@@ -408,12 +401,12 @@ void VM_Version::initialize() {
       }
     }
   }
-  if (UseSHA3Intrinsics && UseSIMDForSHA3Intrinsic && !VM_Version::supports_sha3()) {
+  if (UseSHA3Intrinsics && UseSIMDForSHA3Intrinsic && !supports_sha3()) {
     warning("Intrinsics for SHA3-224, SHA3-256, SHA3-384 and SHA3-512 crypto hash functions not available on this CPU.");
     FLAG_SET_DEFAULT(UseSHA3Intrinsics, false);
   }
 
-  if (UseSHA && VM_Version::supports_sha512()) {
+  if (UseSHA && supports_sha512()) {
     if (FLAG_IS_DEFAULT(UseSHA512Intrinsics)) {
       FLAG_SET_DEFAULT(UseSHA512Intrinsics, true);
     }
@@ -426,7 +419,7 @@ void VM_Version::initialize() {
     FLAG_SET_DEFAULT(UseSHA, false);
   }
 
-  if (VM_Version::supports_pmull()) {
+  if (supports_pmull()) {
     if (FLAG_IS_DEFAULT(UseGHASHIntrinsics)) {
       FLAG_SET_DEFAULT(UseGHASHIntrinsics, true);
     }
@@ -477,7 +470,7 @@ void VM_Version::initialize() {
       FLAG_SET_DEFAULT(UseBlockZeroing, true);
     }
     if (FLAG_IS_DEFAULT(BlockZeroingLowLimit)) {
-      FLAG_SET_DEFAULT(BlockZeroingLowLimit, 4 * VM_Version::zva_length());
+      FLAG_SET_DEFAULT(BlockZeroingLowLimit, 4 * zva_length());
     }
   } else if (UseBlockZeroing) {
     if (!FLAG_IS_DEFAULT(UseBlockZeroing)) {
@@ -486,11 +479,11 @@ void VM_Version::initialize() {
     FLAG_SET_DEFAULT(UseBlockZeroing, false);
   }
 
-  if (VM_Version::supports_sve2()) {
+  if (supports_sve2()) {
     if (FLAG_IS_DEFAULT(UseSVE)) {
       FLAG_SET_DEFAULT(UseSVE, 2);
     }
-  } else if (VM_Version::supports_sve()) {
+  } else if (supports_sve()) {
     if (FLAG_IS_DEFAULT(UseSVE)) {
       FLAG_SET_DEFAULT(UseSVE, 1);
     } else if (UseSVE > 1) {
@@ -541,7 +534,7 @@ void VM_Version::initialize() {
     // 1) this code has been built with branch-protection and
     // 2) the CPU/OS supports it
 #ifdef __ARM_FEATURE_PAC_DEFAULT
-    if (!VM_Version::supports_paca()) {
+    if (!supports_paca()) {
       // Disable PAC to prevent illegal instruction crashes.
       warning("ROP-protection specified, but not supported on this CPU. Disabling ROP-protection.");
     } else {
diff --git a/src/hotspot/cpu/aarch64/vm_version_aarch64.hpp b/src/hotspot/cpu/aarch64/vm_version_aarch64.hpp
index 378524fe168..f8274554f1c 100644
--- a/src/hotspot/cpu/aarch64/vm_version_aarch64.hpp
+++ b/src/hotspot/cpu/aarch64/vm_version_aarch64.hpp
@@ -193,6 +193,8 @@ public:
     return (features & BIT_MASK(flag)) != 0;
   }
 
+  static bool cpu_supports_aes()      { return supports_feature(_cpu_features, CPU_AES); }
+
   static int cpu_family()                     { return _cpu; }
   static int cpu_model()                      { return _model; }
   static int cpu_model2()                     { return _model2; }
diff --git a/src/hotspot/cpu/x86/stubGenerator_x86_64_aes.cpp b/src/hotspot/cpu/x86/stubGenerator_x86_64_aes.cpp
index 1fa80c9d967..162c92d5190 100644
--- a/src/hotspot/cpu/x86/stubGenerator_x86_64_aes.cpp
+++ b/src/hotspot/cpu/x86/stubGenerator_x86_64_aes.cpp
@@ -220,7 +220,7 @@ void StubGenerator::generate_aes_stubs() {
       StubRoutines::_cipherBlockChaining_decryptAESCrypt = generate_cipherBlockChaining_decryptAESCrypt_Parallel();
       StubRoutines::_electronicCodeBook_encryptAESCrypt = generate_electronicCodeBook_encryptAESCrypt_Parallel();
       StubRoutines::_electronicCodeBook_decryptAESCrypt = generate_electronicCodeBook_decryptAESCrypt_Parallel();
-      if (VM_Version::supports_avx2()) {
+      if (VM_Version::supports_avx2() && VM_Version::supports_clmul()) {
           StubRoutines::_galoisCounterMode_AESCrypt = generate_avx2_galoisCounterMode_AESCrypt();
       }
     }
diff --git a/src/hotspot/cpu/x86/stubGenerator_x86_64_fmod.cpp b/src/hotspot/cpu/x86/stubGenerator_x86_64_fmod.cpp
index b1eaa4b8031..a0962943556 100644
--- a/src/hotspot/cpu/x86/stubGenerator_x86_64_fmod.cpp
+++ b/src/hotspot/cpu/x86/stubGenerator_x86_64_fmod.cpp
@@ -78,7 +78,7 @@ address StubGenerator::generate_libmFmod() {
   address start = __ pc();
   __ enter(); // required for proper stackwalking of RuntimeStub frame
 
-  if (VM_Version::supports_avx512vlbwdq()) {     // AVX512 version
+  if (VM_Version::supports_avx512vlbwdq() && VM_Version::supports_fma()) {     // AVX512 version
 
     // Source used to generate the AVX512 fmod assembly below:
     //
diff --git a/src/hotspot/cpu/x86/vm_version_x86.cpp b/src/hotspot/cpu/x86/vm_version_x86.cpp
index fc4cfbc5a8b..7899a2f7e51 100644
--- a/src/hotspot/cpu/x86/vm_version_x86.cpp
+++ b/src/hotspot/cpu/x86/vm_version_x86.cpp
@@ -1094,15 +1094,35 @@ void VM_Version::get_processor_features() {
     }
   }
 
-    // Currently APX support is only enabled for targets supporting AVX512VL feature.
-  bool apx_supported = os_supports_apx_egprs() && supports_apx_f() && supports_avx512vl();
-  if (UseAPX && !apx_supported) {
-    warning("UseAPX is not supported on this CPU, setting it to false");
+  // Currently APX support is only enabled for targets supporting AVX512VL feature.
+  if (supports_apx_f() && os_supports_apx_egprs() && supports_avx512vl()) {
+    if (FLAG_IS_DEFAULT(UseAPX)) {
+      UseAPX = false; // by default UseAPX is false
+    } else if (!UseAPX) {
+      _features.clear_feature(CPU_APX_F);
+    }
+  } else if (UseAPX) {
+    if (!FLAG_IS_DEFAULT(UseAPX)) {
+      warning("APX is not supported on this CPU, setting it to false)");
+    }
     FLAG_SET_DEFAULT(UseAPX, false);
   }
 
-  if (!UseAPX) {
-    _features.clear_feature(CPU_APX_F);
+  CHECK_CPU_FEATURE(supports_clmul, CLMUL);
+  CHECK_CPU_FEATURE(supports_aes, AES);
+  CHECK_CPU_FEATURE(supports_fma, FMA);
+
+  if (supports_sha() || (supports_avx2() && supports_bmi2())) {
+    if (FLAG_IS_DEFAULT(UseSHA)) {
+      UseSHA = true;
+    } else if (!UseSHA) {
+      _features.clear_feature(CPU_SHA);
+    }
+  } else if (UseSHA) {
+    if (!FLAG_IS_DEFAULT(UseSHA)) {
+      warning("SHA instructions are not available on this CPU");
+    }
+    FLAG_SET_DEFAULT(UseSHA, false);
   }
 
   if (FLAG_IS_DEFAULT(IntelJccErratumMitigation)) {
@@ -1152,9 +1172,40 @@ void VM_Version::get_processor_features() {
 
   // Use AES instructions if available.
   if (supports_aes()) {
-    if (FLAG_IS_DEFAULT(UseAES)) {
-      FLAG_SET_DEFAULT(UseAES, true);
+    if (supports_sse3()) {
+      if (FLAG_IS_DEFAULT(UseAESIntrinsics)) {
+        FLAG_SET_DEFAULT(UseAESIntrinsics, true);
+      }
+    } else if (UseAESIntrinsics) {
+      // The AES intrinsic stubs require AES instruction support (of course)
+      // but also require sse3 mode or higher for instructions it use.
+      if (!FLAG_IS_DEFAULT(UseAESIntrinsics)) {
+        warning("X86 AES intrinsics require SSE3 instructions or higher. Intrinsics will be disabled.");
+      }
+      FLAG_SET_DEFAULT(UseAESIntrinsics, false);
     }
+    if (!UseAESIntrinsics) {
+      if (UseAESCTRIntrinsics) {
+        if (FLAG_IS_DEFAULT(UseAESCTRIntrinsics)) {
+          warning("AES-CTR intrinsics require UseAESIntrinsics flag to be enabled. Intrinsics will be disabled.");
+        }
+        FLAG_SET_DEFAULT(UseAESCTRIntrinsics, false);
+      }
+    } else {
+      if (supports_sse4_1()) {
+        if (FLAG_IS_DEFAULT(UseAESCTRIntrinsics)) {
+          FLAG_SET_DEFAULT(UseAESCTRIntrinsics, true);
+        }
+      } else if (UseAESCTRIntrinsics) {
+        // The AES-CTR intrinsic stubs require AES instruction support (of course)
+        // but also require sse4.1 mode or higher for instructions it use.
+        if (!FLAG_IS_DEFAULT(UseAESCTRIntrinsics)) {
+          warning("X86 AES-CTR intrinsics require SSE4.1 instructions or higher. Intrinsics will be disabled.");
+        }
+        FLAG_SET_DEFAULT(UseAESCTRIntrinsics, false);
+      }
+    }
+  } else {
     if (!UseAES) {
       if (UseAESIntrinsics && !FLAG_IS_DEFAULT(UseAESIntrinsics)) {
         warning("AES intrinsics require UseAES flag to be enabled. Intrinsics will be disabled.");
@@ -1164,66 +1215,16 @@ void VM_Version::get_processor_features() {
         warning("AES_CTR intrinsics require UseAES flag to be enabled. AES_CTR intrinsics will be disabled.");
       }
       FLAG_SET_DEFAULT(UseAESCTRIntrinsics, false);
-    } else {
-      if (UseSSE > 2) {
-        if (FLAG_IS_DEFAULT(UseAESIntrinsics)) {
-          FLAG_SET_DEFAULT(UseAESIntrinsics, true);
-        }
-      } else {
-        // The AES intrinsic stubs require AES instruction support (of course)
-        // but also require sse3 mode or higher for instructions it use.
-        if (UseAESIntrinsics && !FLAG_IS_DEFAULT(UseAESIntrinsics)) {
-          warning("X86 AES intrinsics require SSE3 instructions or higher. Intrinsics will be disabled.");
-        }
-        FLAG_SET_DEFAULT(UseAESIntrinsics, false);
+    } else if (!cpu_supports_aes()) {
+      if (UseAESIntrinsics && !FLAG_IS_DEFAULT(UseAESIntrinsics)) {
+        warning("AES intrinsics are not available on this CPU");
       }
-
-      // --AES-CTR begins--
-      if (!UseAESIntrinsics) {
-        if (UseAESCTRIntrinsics && !FLAG_IS_DEFAULT(UseAESCTRIntrinsics)) {
-          warning("AES-CTR intrinsics require UseAESIntrinsics flag to be enabled. Intrinsics will be disabled.");
-        }
-        FLAG_SET_DEFAULT(UseAESCTRIntrinsics, false);
-      } else {
-        if (supports_sse4_1()) {
-          if (FLAG_IS_DEFAULT(UseAESCTRIntrinsics)) {
-            FLAG_SET_DEFAULT(UseAESCTRIntrinsics, true);
-          }
-        } else {
-           // The AES-CTR intrinsic stubs require AES instruction support (of course)
-           // but also require sse4.1 mode or higher for instructions it use.
-          if (UseAESCTRIntrinsics && !FLAG_IS_DEFAULT(UseAESCTRIntrinsics)) {
-             warning("X86 AES-CTR intrinsics require SSE4.1 instructions or higher. Intrinsics will be disabled.");
-           }
-           FLAG_SET_DEFAULT(UseAESCTRIntrinsics, false);
-        }
+      FLAG_SET_DEFAULT(UseAESIntrinsics, false);
+      if (UseAESCTRIntrinsics && !FLAG_IS_DEFAULT(UseAESCTRIntrinsics)) {
+        warning("AES-CTR intrinsics are not available on this CPU");
       }
-      // --AES-CTR ends--
+      FLAG_SET_DEFAULT(UseAESCTRIntrinsics, false);
     }
-  } else if (UseAES || UseAESIntrinsics || UseAESCTRIntrinsics) {
-    if (UseAES && !FLAG_IS_DEFAULT(UseAES)) {
-      warning("AES instructions are not available on this CPU");
-    }
-    FLAG_SET_DEFAULT(UseAES, false);
-    if (UseAESIntrinsics && !FLAG_IS_DEFAULT(UseAESIntrinsics)) {
-      warning("AES intrinsics are not available on this CPU");
-    }
-    FLAG_SET_DEFAULT(UseAESIntrinsics, false);
-    if (UseAESCTRIntrinsics && !FLAG_IS_DEFAULT(UseAESCTRIntrinsics)) {
-      warning("AES-CTR intrinsics are not available on this CPU");
-    }
-    FLAG_SET_DEFAULT(UseAESCTRIntrinsics, false);
-  }
-
-  // Use CLMUL instructions if available.
-  if (supports_clmul()) {
-    if (FLAG_IS_DEFAULT(UseCLMUL)) {
-      UseCLMUL = true;
-    }
-  } else if (UseCLMUL) {
-    if (!FLAG_IS_DEFAULT(UseCLMUL))
-      warning("CLMUL instructions not available on this CPU (AVX may also be required)");
-    FLAG_SET_DEFAULT(UseCLMUL, false);
   }
 
   if (UseCLMUL && (UseSSE > 2)) {
@@ -1323,32 +1324,10 @@ void VM_Version::get_processor_features() {
     FLAG_SET_DEFAULT(UseBASE64Intrinsics, false);
   }
 
-  if (supports_fma()) {
-    if (FLAG_IS_DEFAULT(UseFMA)) {
-      UseFMA = true;
-    }
-  } else if (UseFMA) {
-    if (!FLAG_IS_DEFAULT(UseFMA)) {
-      warning("FMA instructions are not available on this CPU");
-    }
-    FLAG_SET_DEFAULT(UseFMA, false);
-  }
-
   if (FLAG_IS_DEFAULT(UseMD5Intrinsics)) {
     UseMD5Intrinsics = true;
   }
 
-  if (supports_sha() || (supports_avx2() && supports_bmi2())) {
-    if (FLAG_IS_DEFAULT(UseSHA)) {
-      UseSHA = true;
-    }
-  } else if (UseSHA) {
-    if (!FLAG_IS_DEFAULT(UseSHA)) {
-      warning("SHA instructions are not available on this CPU");
-    }
-    FLAG_SET_DEFAULT(UseSHA, false);
-  }
-
   if (supports_sha() && supports_sse4_1() && UseSHA) {
     if (FLAG_IS_DEFAULT(UseSHA1Intrinsics)) {
       FLAG_SET_DEFAULT(UseSHA1Intrinsics, true);
diff --git a/src/hotspot/cpu/x86/vm_version_x86.hpp b/src/hotspot/cpu/x86/vm_version_x86.hpp
index 4f3580d216c..f721635a02e 100644
--- a/src/hotspot/cpu/x86/vm_version_x86.hpp
+++ b/src/hotspot/cpu/x86/vm_version_x86.hpp
@@ -535,6 +535,10 @@ protected:
 
   static const char* _features_names[];
 
+  static void clear_feature(Feature_Flag feature) {
+    _features.clear_feature(feature);
+  }
+
   static void clear_cpu_features() {
     _features = VM_Features();
     _cpu_features = VM_Features();
@@ -930,6 +934,7 @@ public:
   // Feature identification not affected by VM flags
   //
   static bool cpu_supports_evex()     { return _cpu_features.supports_feature(CPU_AVX512F); }
+  static bool cpu_supports_aes()      { return _cpu_features.supports_feature(CPU_AES); }
 
   static bool supports_avx512_simd_sort() {
     if (supports_avx512dq()) {
diff --git a/src/hotspot/share/runtime/abstract_vm_version.hpp b/src/hotspot/share/runtime/abstract_vm_version.hpp
index 17ade2c068d..61a8aa84080 100644
--- a/src/hotspot/share/runtime/abstract_vm_version.hpp
+++ b/src/hotspot/share/runtime/abstract_vm_version.hpp
@@ -45,6 +45,21 @@ class outputStream;
 class stringStream;
 enum class vmIntrinsicID;
 
+// Helper macro to test and set VM flag and corresponding cpu feature
+#define CHECK_CPU_FEATURE(feature_test_fn, feature) \
+  if (feature_test_fn()) { \
+    if (FLAG_IS_DEFAULT(Use##feature)) { \
+      FLAG_SET_DEFAULT(Use##feature, true); \
+    } else if (!Use##feature) { \
+      clear_feature(CPU_##feature); \
+    } \
+  } else if (Use##feature) { \
+    if (!FLAG_IS_DEFAULT(Use##feature)) { \
+      warning(#feature " instructions not available on this CPU"); \
+    } \
+    FLAG_SET_DEFAULT(Use##feature, false); \
+  }
+
 // Abstract_VM_Version provides information about the VM.
 
 class Abstract_VM_Version: AllStatic {
diff --git a/test/hotspot/jtreg/compiler/cpuflags/CPUFeaturesClearTest.java b/test/hotspot/jtreg/compiler/cpuflags/CPUFeaturesClearTest.java
new file mode 100644
index 00000000000..a0fb3525381
--- /dev/null
+++ b/test/hotspot/jtreg/compiler/cpuflags/CPUFeaturesClearTest.java
@@ -0,0 +1,143 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+/*
+ * @test
+ * @library /test/lib /
+ * @modules java.base/jdk.internal.misc
+ *          java.management
+ * @requires os.simpleArch == "x64" | os.simpleArch == "aarch64"
+ * @build jdk.test.whitebox.WhiteBox
+ * @run driver jdk.test.lib.helpers.ClassFileInstaller jdk.test.whitebox.WhiteBox
+ * @run main/othervm/timeout=600 -Xbootclasspath/a:.
+ *                   -XX:+UnlockDiagnosticVMOptions
+ *                   -XX:+WhiteBoxAPI -Xbatch
+ *                   compiler.cpuflags.CPUFeaturesClearTest
+ */
+
+package compiler.cpuflags;
+
+import java.util.List;
+
+import jdk.test.lib.process.OutputAnalyzer;
+import jdk.test.lib.Platform;
+import jdk.test.lib.process.ProcessTools;
+import jdk.test.whitebox.WhiteBox;
+import jdk.test.whitebox.cpuinfo.CPUInfo;
+import static jdk.test.lib.cli.CommandLineOptionTest.*;
+
+public class CPUFeaturesClearTest {
+    private static List<String> cpuFeaturesList;
+    public void runTestCases() throws Throwable {
+        if (Platform.isX64()) {
+            testX86Flags();
+        } else if (Platform.isAArch64()) {
+            testAArch64Flags();
+        }
+    }
+
+    String[] generateArgs(String vmFlag) {
+        String[] args = {"-Xlog:os+cpu", "-XX:+UnlockDiagnosticVMOptions", vmFlag, "-version"};
+        return args;
+    }
+
+    public void testX86Flags() throws Throwable {
+        OutputAnalyzer outputAnalyzer;
+        String vmFlagsToTest[] = {"UseCLMUL", "UseAES", "UseFMA", "UseSHA"};
+        String cpuFeatures[] =   {"clmul",    "aes",    "fma",    "sha"};
+        for (int i = 0; i < vmFlagsToTest.length; i++) {
+            String vmFlag = vmFlagsToTest[i];
+            String cpuFeature = cpuFeatures[i];
+            outputAnalyzer = ProcessTools.executeTestJava(generateArgs(prepareBooleanFlag(vmFlag, false)));
+            outputAnalyzer.shouldNotMatch("[os,cpu] CPU: .* " + cpuFeatures[i] + ".*");
+        }
+        if (isCpuFeatureSupported("sse4")) {
+            outputAnalyzer = ProcessTools.executeTestJava(generateArgs(prepareNumericFlag("UseSSE", 3)));
+            outputAnalyzer.shouldNotMatch("[os,cpu] CPU: .* sse4.*");
+        }
+        if (isCpuFeatureSupported("sse3")) {
+            outputAnalyzer = ProcessTools.executeTestJava(generateArgs(prepareNumericFlag("UseSSE", 2)));
+            outputAnalyzer.shouldNotMatch("[os,cpu] CPU: .* sse3.*");
+            outputAnalyzer.shouldNotMatch("[os,cpu] CPU: .* ssse3.*");
+        }
+        if (isCpuFeatureSupported("sse2")) {
+            outputAnalyzer = ProcessTools.executeTestJava(generateArgs(prepareNumericFlag("UseSSE", 1)));
+            outputAnalyzer.shouldNotMatch("[os,cpu] CPU: .* sse2.*");
+        }
+        if (isCpuFeatureSupported("sse")) {
+            outputAnalyzer = ProcessTools.executeTestJava(generateArgs(prepareNumericFlag("UseSSE", 0)));
+            outputAnalyzer.shouldNotMatch("[os,cpu] CPU: .* sse.*");
+        }
+        if (isCpuFeatureSupported("avx512f")) {
+            outputAnalyzer = ProcessTools.executeTestJava(generateArgs(prepareNumericFlag("UseAVX", 2)));
+            outputAnalyzer.shouldNotMatch("[os,cpu] CPU: .* avx512.*");
+        }
+        if (isCpuFeatureSupported("avx2")) {
+            outputAnalyzer = ProcessTools.executeTestJava(generateArgs(prepareNumericFlag("UseAVX", 1)));
+            outputAnalyzer.shouldNotMatch("[os,cpu] CPU: .* avx2.*");
+        }
+        if (isCpuFeatureSupported("avx")) {
+            outputAnalyzer = ProcessTools.executeTestJava(generateArgs(prepareNumericFlag("UseAVX", 0)));
+            outputAnalyzer.shouldNotMatch("[os,cpu] CPU: .* avx.*");
+        }
+    }
+
+    public void testAArch64Flags() throws Throwable {
+        OutputAnalyzer outputAnalyzer;
+        String vmFlagsToTest[] = {"UseCRC32", "UseLSE", "UseAES"};
+        String cpuFeatures[] =   {"crc32",    "lse",    "aes"};
+        for (int i = 0; i < vmFlagsToTest.length; i++) {
+            String vmFlag = vmFlagsToTest[i];
+            String cpuFeature = cpuFeatures[i];
+            outputAnalyzer = ProcessTools.executeTestJava(generateArgs(prepareBooleanFlag(vmFlag, false)));
+            outputAnalyzer.shouldNotMatch("[os,cpu] CPU: .* " + cpuFeatures[i] + ".*");
+        }
+
+        // Disabling UseSHA should clear all shaXXX cpu features
+        outputAnalyzer = ProcessTools.executeTestJava(generateArgs(prepareBooleanFlag("UseSHA", false)));
+        outputAnalyzer.shouldNotMatch("[os,cpu] CPU: .* sha1.*");
+        outputAnalyzer.shouldNotMatch("[os,cpu] CPU: .* sha256.*");
+        outputAnalyzer.shouldNotMatch("[os,cpu] CPU: .* sha3.*");
+        outputAnalyzer.shouldNotMatch("[os,cpu] CPU: .* sha512.*");
+
+        if (isCpuFeatureSupported("sve2")) {
+            outputAnalyzer = ProcessTools.executeTestJava(generateArgs(prepareNumericFlag("UseSVE", 1)));
+            outputAnalyzer.shouldNotMatch("[os,cpu] CPU: .* sve2.*");
+            verifyOutput(null, new String[]{"sve2"}, null, outputAnalyzer);
+        }
+        if (isCpuFeatureSupported("sve")) {
+            outputAnalyzer = ProcessTools.executeTestJava(generateArgs(prepareNumericFlag("UseSVE", 0)));
+            outputAnalyzer.shouldNotMatch("[os,cpu] CPU: .* sve.*");
+            verifyOutput(null, new String[]{"sve"}, null, outputAnalyzer);
+        }
+    }
+
+    static boolean isCpuFeatureSupported(String feature) {
+        return cpuFeaturesList.contains(feature);
+    }
+
+    public static void main(String args[]) throws Throwable {
+        cpuFeaturesList = CPUInfo.getFeatures();
+        new CPUFeaturesClearTest().runTestCases();
+    }
+}

From e79692881fab1d4c986b72a08f73bfc1b19f39b7 Mon Sep 17 00:00:00 2001
From: Ashay Rane <253344819+raneashay@users.noreply.github.com>
Date: Mon, 6 Apr 2026 15:44:19 +0000
Subject: [PATCH 495/655] 8381449: Build fails when Windows is not installed on
 C:

Reviewed-by: ysuenaga, erikj, lmesnik
---
 make/autoconf/toolchain_microsoft.m4     | 12 +++++++-----
 make/scripts/fixpath.sh                  |  5 ++++-
 test/jdk/com/sun/jdi/JdbReadTwiceTest.sh | 12 +++++++++---
 3 files changed, 20 insertions(+), 9 deletions(-)

diff --git a/make/autoconf/toolchain_microsoft.m4 b/make/autoconf/toolchain_microsoft.m4
index f577cf1a2a1..afe04acf029 100644
--- a/make/autoconf/toolchain_microsoft.m4
+++ b/make/autoconf/toolchain_microsoft.m4
@@ -217,10 +217,12 @@ AC_DEFUN([TOOLCHAIN_FIND_VISUAL_STUDIO_BAT_FILE],
     TOOLCHAIN_CHECK_POSSIBLE_VISUAL_STUDIO_ROOT([$TARGET_CPU], [$VS_VERSION],
         [$PROGRAMFILES_X86/$VS_INSTALL_DIR], [well-known name])
   fi
+  # Derive system drive root from CMD (which is at <drive>/windows/system32/cmd.exe)
+  WINSYSDRIVE_ROOT="$(dirname "$(dirname "$(dirname "$CMD")")")"
   TOOLCHAIN_CHECK_POSSIBLE_VISUAL_STUDIO_ROOT([$TARGET_CPU], [$VS_VERSION],
-      [c:/program files/$VS_INSTALL_DIR], [well-known name])
+      [$WINSYSDRIVE_ROOT/program files/$VS_INSTALL_DIR], [well-known name])
   TOOLCHAIN_CHECK_POSSIBLE_VISUAL_STUDIO_ROOT([$TARGET_CPU], [$VS_VERSION],
-      [c:/program files (x86)/$VS_INSTALL_DIR], [well-known name])
+      [$WINSYSDRIVE_ROOT/program files (x86)/$VS_INSTALL_DIR], [well-known name])
   if test "x$SDK_INSTALL_DIR" != x; then
     if test "x$ProgramW6432" != x; then
       TOOLCHAIN_CHECK_POSSIBLE_WIN_SDK_ROOT([$TARGET_CPU], [$VS_VERSION],
@@ -235,9 +237,9 @@ AC_DEFUN([TOOLCHAIN_FIND_VISUAL_STUDIO_BAT_FILE],
           [$PROGRAMFILES/$SDK_INSTALL_DIR], [well-known name])
     fi
     TOOLCHAIN_CHECK_POSSIBLE_WIN_SDK_ROOT([$TARGET_CPU], [$VS_VERSION],
-        [c:/program files/$SDK_INSTALL_DIR], [well-known name])
+        [$WINSYSDRIVE_ROOT/program files/$SDK_INSTALL_DIR], [well-known name])
     TOOLCHAIN_CHECK_POSSIBLE_WIN_SDK_ROOT([$TARGET_CPU], [$VS_VERSION],
-        [c:/program files (x86)/$SDK_INSTALL_DIR], [well-known name])
+        [$WINSYSDRIVE_ROOT/program files (x86)/$SDK_INSTALL_DIR], [well-known name])
   fi
 
   VCVARS_VER=auto
@@ -338,7 +340,7 @@ AC_DEFUN([TOOLCHAIN_EXTRACT_VISUAL_STUDIO_ENV],
   OLDPATH="$PATH"
   # Make sure we only capture additions to PATH needed by VS.
   # Clear out path, but need system dir present for vsvars cmd file to be able to run
-  export PATH=$WINENV_PREFIX/c/windows/system32
+  export PATH="$(dirname "$CMD")"
   # The "| cat" is to stop SetEnv.Cmd to mess with system colors on some systems
   # We can't pass -vcvars_ver=$VCVARS_VER here because cmd.exe eats all '='
   # in bat file arguments. :-(
diff --git a/make/scripts/fixpath.sh b/make/scripts/fixpath.sh
index 6a524df4c68..78690f1f2cc 100644
--- a/make/scripts/fixpath.sh
+++ b/make/scripts/fixpath.sh
@@ -88,7 +88,10 @@ function setup() {
   fi
 
   if [[ -z ${CMD+x} ]]; then
-    CMD="$DRIVEPREFIX/c/windows/system32/cmd.exe"
+    CMD="$(type -p cmd.exe 2>/dev/null)"
+    if [[ -z "$CMD" ]]; then
+      CMD="$DRIVEPREFIX/c/windows/system32/cmd.exe"
+    fi
   fi
 
   if [[ -z ${WINTEMP+x} ]]; then
diff --git a/test/jdk/com/sun/jdi/JdbReadTwiceTest.sh b/test/jdk/com/sun/jdi/JdbReadTwiceTest.sh
index 5902abe50ad..8103fb6f01d 100644
--- a/test/jdk/com/sun/jdi/JdbReadTwiceTest.sh
+++ b/test/jdk/com/sun/jdi/JdbReadTwiceTest.sh
@@ -68,6 +68,12 @@ jdbFiles="$HOME/jdb.ini $HOME/.jdbrc $here/jdb.ini $here/.jdbrc $tmpResult $fred
 cd $here
 failed=
 
+target_os=$($TESTJAVA/bin/java -XshowSettings:all 2>&1 | grep 'os.name' | grep -i 'windows')
+if [ -n "$target_os" ]; then
+    IS_WINDOWS=true
+else
+    IS_WINDOWS=false
+fi
 
 mkFiles()
 {
@@ -84,7 +90,7 @@ failIfNot()
     # $1 is the expected number of occurances of $2 in the jdb output.
     count=$1
     shift
-    if [ -r c:/ ] ; then
+    if [ "${IS_WINDOWS}" = "true" ] ; then
        sed -e 's@\\@/@g' $tmpResult > $tmpResult.1
        mv $tmpResult.1 $tmpResult
     fi
@@ -177,7 +183,7 @@ mkFiles $HOME/.jdbrc $here/jdb.ini
     clean
 
 
-if [ ! -r c:/ ] ; then
+if [ "${IS_WINDOWS}" != "true" ] ; then
     # No symlinks on windows.
     echo
     echo "+++++++++++++++++++++++++++++++++++"
@@ -191,7 +197,7 @@ if [ ! -r c:/ ] ; then
 fi
 
 
-if [ ! -r c:/ ] ; then
+if [ "${IS_WINDOWS}" != "true" ] ; then
     # No symlinks on windows.
     echo
     echo "+++++++++++++++++++++++++++++++++++"

From ef2e5379f5290fd1d8a57c9e11544b03c86d1b3b Mon Sep 17 00:00:00 2001
From: Robert Toyonaga <rtoyonag@redhat.com>
Date: Mon, 6 Apr 2026 21:00:36 +0000
Subject: [PATCH 496/655] 8380467: JFR: RepositoryFiles.updatePaths() searches
 for chunkfiles incorrectly

Reviewed-by: egahlin
---
 .../internal/consumer/RepositoryFiles.java    |  8 +-
 .../streaming/TestRepositoryFilesRescan.java  | 97 +++++++++++++++++++
 2 files changed, 101 insertions(+), 4 deletions(-)
 create mode 100644 test/jdk/jdk/jfr/api/consumer/streaming/TestRepositoryFilesRescan.java

diff --git a/src/jdk.jfr/share/classes/jdk/jfr/internal/consumer/RepositoryFiles.java b/src/jdk.jfr/share/classes/jdk/jfr/internal/consumer/RepositoryFiles.java
index 09b64efbdd0..1e875691537 100644
--- a/src/jdk.jfr/share/classes/jdk/jfr/internal/consumer/RepositoryFiles.java
+++ b/src/jdk.jfr/share/classes/jdk/jfr/internal/consumer/RepositoryFiles.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2019, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2019, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -181,9 +181,9 @@ public final class RepositoryFiles {
             List<Path> added = new ArrayList<>();
             Set<Path> current = new HashSet<>();
             for (Path p : dirStream) {
-                if (!pathLookup.containsKey(p)) {
-                    String s = p.toString();
-                    if (s.endsWith(".jfr")) {
+                String s = p.toString();
+                if (s.endsWith(".jfr")) {
+                    if (!pathLookup.containsKey(p)) {
                         added.add(p);
                         Logger.log(LogTag.JFR_SYSTEM_STREAMING, LogLevel.DEBUG, "New file found: " + p.toAbsolutePath());
                     }
diff --git a/test/jdk/jdk/jfr/api/consumer/streaming/TestRepositoryFilesRescan.java b/test/jdk/jdk/jfr/api/consumer/streaming/TestRepositoryFilesRescan.java
new file mode 100644
index 00000000000..0cb80d18698
--- /dev/null
+++ b/test/jdk/jdk/jfr/api/consumer/streaming/TestRepositoryFilesRescan.java
@@ -0,0 +1,97 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+package jdk.jfr.api.consumer.streaming;
+
+import java.nio.file.Files;
+import java.nio.file.Path;
+
+import jdk.jfr.Recording;
+import jdk.jfr.internal.consumer.RepositoryFiles;
+import jdk.test.lib.Asserts;
+
+/**
+ * @test
+ * @summary Verifies that RepositoryFiles does not oscillate between
+ *          forgetting and rediscovering chunk files between scans
+ * @requires vm.hasJFR
+ * @library /test/lib
+ * @modules jdk.jfr/jdk.jfr.internal.consumer
+ * @run main/othervm jdk.jfr.api.consumer.streaming.TestRepositoryFilesRescan
+ */
+public class TestRepositoryFilesRescan {
+
+    public static void main(String... args) throws Exception {
+        Path dir = Files.createTempDirectory("jfr-rescan-test");
+        try {
+            createChunkFile(dir, "chunk1.jfr");
+            createChunkFile(dir, "chunk2.jfr");
+            testNoOscillation(dir);
+        } finally {
+            deleteDirectory(dir);
+        }
+    }
+
+    /**
+     * firstPath(0, false) will return non-null only when updatePaths discovers
+     * genuinely new chunk files; with no files added or removed between
+     * calls the result must be null after the first successful call.
+     */
+    private static void testNoOscillation(Path dir) {
+        RepositoryFiles rf = new RepositoryFiles(dir, false);
+        Asserts.assertNotNull(rf.firstPath(0, false), "Call 1: expected non-null (initial discovery of .jfr files)");
+
+        Path p2 = rf.firstPath(0, false);
+        Asserts.assertNull(p2, "Call 2: expected null (no new chunks), got " + p2);
+
+        // Call 3: still no new files.  This confirms call 2 did not wipe pathLookup, making all files look "new" again.
+        Path p3 = rf.firstPath(0, false);
+        Asserts.assertNull(p3, "Call 3: expected null (no new chunks), got " + p3
+            + " — pathLookup is oscillating between populated and empty");
+    }
+
+    private static void createChunkFile(Path dir, String name) throws Exception {
+        try (Recording r = new Recording()) {
+            r.start();
+            Thread.sleep(20);
+            r.stop();
+            r.dump(dir.resolve(name));
+        }
+    }
+
+    private static void deleteDirectory(Path dir) {
+        try {
+            try (var stream = Files.list(dir)) {
+                stream.forEach(p -> {
+                    try {
+                        Files.deleteIfExists(p);
+                    } catch (Exception e) {
+                        // Do nothing
+                    }
+                });
+            }
+            Files.deleteIfExists(dir);
+        } catch (Exception e) {
+            // best-effort cleanup
+        }
+    }
+}

From 273167f7236682401f1ea852b4b7c97445965952 Mon Sep 17 00:00:00 2001
From: Vladimir Kozlov <kvn@openjdk.org>
Date: Mon, 6 Apr 2026 23:25:36 +0000
Subject: [PATCH 497/655] 8381683: Pass temp registers and use them in
 CardTableBarrierSetAssembler::store_check() on Aarch64

Reviewed-by: iveresov, vlivanov, aph
---
 .../cardTableBarrierSetAssembler_aarch64.cpp  | 20 ++++++++++---------
 .../cardTableBarrierSetAssembler_aarch64.hpp  |  2 +-
 .../cardTableBarrierSetAssembler_x86.cpp      |  4 +++-
 3 files changed, 15 insertions(+), 11 deletions(-)

diff --git a/src/hotspot/cpu/aarch64/gc/shared/cardTableBarrierSetAssembler_aarch64.cpp b/src/hotspot/cpu/aarch64/gc/shared/cardTableBarrierSetAssembler_aarch64.cpp
index 0bfc320179d..a9c320912cb 100644
--- a/src/hotspot/cpu/aarch64/gc/shared/cardTableBarrierSetAssembler_aarch64.cpp
+++ b/src/hotspot/cpu/aarch64/gc/shared/cardTableBarrierSetAssembler_aarch64.cpp
@@ -56,8 +56,10 @@ void CardTableBarrierSetAssembler::store_at(MacroAssembler* masm, DecoratorSet d
   }
 }
 
-void CardTableBarrierSetAssembler::store_check(MacroAssembler* masm, Register obj, Address dst) {
-
+void CardTableBarrierSetAssembler::store_check(MacroAssembler* masm, Register obj, Address dst, Register tmp1, Register tmp2) {
+  precond(tmp1 != noreg);
+  precond(tmp2 != noreg);
+  assert_different_registers(obj, tmp1, tmp2);
   BarrierSet* bs = BarrierSet::barrier_set();
   assert(bs->kind() == BarrierSet::CardTableBarrierSet, "Wrong barrier set kind");
 
@@ -65,16 +67,16 @@ void CardTableBarrierSetAssembler::store_check(MacroAssembler* masm, Register ob
 
   assert(CardTable::dirty_card_val() == 0, "must be");
 
-  __ load_byte_map_base(rscratch1);
+  __ load_byte_map_base(tmp1);
 
   if (UseCondCardMark) {
     Label L_already_dirty;
-    __ ldrb(rscratch2,  Address(obj, rscratch1));
-    __ cbz(rscratch2, L_already_dirty);
-    __ strb(zr, Address(obj, rscratch1));
+    __ ldrb(tmp2,  Address(obj, tmp1));
+    __ cbz(tmp2, L_already_dirty);
+    __ strb(zr, Address(obj, tmp1));
     __ bind(L_already_dirty);
   } else {
-    __ strb(zr, Address(obj, rscratch1));
+    __ strb(zr, Address(obj, tmp1));
   }
 }
 
@@ -112,10 +114,10 @@ void CardTableBarrierSetAssembler::oop_store_at(MacroAssembler* masm, DecoratorS
   if (needs_post_barrier) {
     // flatten object address if needed
     if (!precise || (dst.index() == noreg && dst.offset() == 0)) {
-      store_check(masm, dst.base(), dst);
+      store_check(masm, dst.base(), dst, tmp1, tmp2);
     } else {
       __ lea(tmp3, dst);
-      store_check(masm, tmp3, dst);
+      store_check(masm, tmp3, dst, tmp1, tmp2);
     }
   }
 }
diff --git a/src/hotspot/cpu/aarch64/gc/shared/cardTableBarrierSetAssembler_aarch64.hpp b/src/hotspot/cpu/aarch64/gc/shared/cardTableBarrierSetAssembler_aarch64.hpp
index 07dd8eb5565..e05e9e90e5d 100644
--- a/src/hotspot/cpu/aarch64/gc/shared/cardTableBarrierSetAssembler_aarch64.hpp
+++ b/src/hotspot/cpu/aarch64/gc/shared/cardTableBarrierSetAssembler_aarch64.hpp
@@ -46,7 +46,7 @@ protected:
   virtual void store_at(MacroAssembler* masm, DecoratorSet decorators, BasicType type,
                         Address dst, Register val, Register tmp1, Register tmp2, Register tmp3);
 
-  void store_check(MacroAssembler* masm, Register obj, Address dst);
+  void store_check(MacroAssembler* masm, Register obj, Address dst, Register tmp1, Register tmp2);
 };
 
 #endif // CPU_AARCH64_GC_SHARED_CARDTABLEBARRIERSETASSEMBLER_AARCH64_HPP
diff --git a/src/hotspot/cpu/x86/gc/shared/cardTableBarrierSetAssembler_x86.cpp b/src/hotspot/cpu/x86/gc/shared/cardTableBarrierSetAssembler_x86.cpp
index 0ea769dd488..1de147926bb 100644
--- a/src/hotspot/cpu/x86/gc/shared/cardTableBarrierSetAssembler_x86.cpp
+++ b/src/hotspot/cpu/x86/gc/shared/cardTableBarrierSetAssembler_x86.cpp
@@ -138,6 +138,8 @@ void CardTableBarrierSetAssembler::store_check(MacroAssembler* masm, Register ob
   __ shrptr(obj, CardTable::card_shift());
 
   Address card_addr;
+  precond(rscratch != noreg);
+  assert_different_registers(obj, rscratch);
 
   // The calculation for byte_map_base is as follows:
   // byte_map_base = _byte_map - (uintptr_t(low_bound) >> card_shift);
@@ -161,7 +163,7 @@ void CardTableBarrierSetAssembler::store_check(MacroAssembler* masm, Register ob
     // entry and that entry is not properly handled by the relocation code.
     AddressLiteral cardtable((address)byte_map_base, relocInfo::none);
     Address index(noreg, obj, Address::times_1);
-    card_addr = __ as_Address(ArrayAddress(cardtable, index), rscratch1);
+    card_addr = __ as_Address(ArrayAddress(cardtable, index), rscratch);
   }
 
   int dirty = CardTable::dirty_card_val();

From 1688d0f936be0ab15916f339997a8e35d611302b Mon Sep 17 00:00:00 2001
From: Vladimir Kozlov <kvn@openjdk.org>
Date: Mon, 6 Apr 2026 23:32:33 +0000
Subject: [PATCH 498/655] 8381655: Port JDK-8363978 fix from leyden repo to
 mainline

Reviewed-by: iveresov, iklam
---
 src/hotspot/cpu/aarch64/c1_LIRAssembler_aarch64.cpp | 5 +++++
 src/hotspot/cpu/x86/c1_LIRAssembler_x86.cpp         | 5 +++++
 2 files changed, 10 insertions(+)

diff --git a/src/hotspot/cpu/aarch64/c1_LIRAssembler_aarch64.cpp b/src/hotspot/cpu/aarch64/c1_LIRAssembler_aarch64.cpp
index e7d8c2d3648..4de6237304d 100644
--- a/src/hotspot/cpu/aarch64/c1_LIRAssembler_aarch64.cpp
+++ b/src/hotspot/cpu/aarch64/c1_LIRAssembler_aarch64.cpp
@@ -42,6 +42,7 @@
 #include "runtime/frame.inline.hpp"
 #include "runtime/sharedRuntime.hpp"
 #include "runtime/stubRoutines.hpp"
+#include "runtime/threadIdentifier.hpp"
 #include "utilities/powerOfTwo.hpp"
 #include "vmreg_aarch64.inline.hpp"
 
@@ -520,6 +521,10 @@ void LIR_Assembler::const2reg(LIR_Opr src, LIR_Opr dest, LIR_PatchCode patch_cod
 #if INCLUDE_CDS
       if (AOTCodeCache::is_on_for_dump()) {
         address b = c->as_pointer();
+        if (b == (address)ThreadIdentifier::unsafe_offset()) {
+          __ lea(dest->as_register_lo(), ExternalAddress(b));
+          break;
+        }
         if (AOTRuntimeConstants::contains(b)) {
           __ load_aotrc_address(dest->as_register_lo(), b);
           break;
diff --git a/src/hotspot/cpu/x86/c1_LIRAssembler_x86.cpp b/src/hotspot/cpu/x86/c1_LIRAssembler_x86.cpp
index 5397a230642..1242078e11d 100644
--- a/src/hotspot/cpu/x86/c1_LIRAssembler_x86.cpp
+++ b/src/hotspot/cpu/x86/c1_LIRAssembler_x86.cpp
@@ -42,6 +42,7 @@
 #include "runtime/safepointMechanism.hpp"
 #include "runtime/sharedRuntime.hpp"
 #include "runtime/stubRoutines.hpp"
+#include "runtime/threadIdentifier.hpp"
 #include "utilities/powerOfTwo.hpp"
 #include "vmreg_x86.inline.hpp"
 
@@ -522,6 +523,10 @@ void LIR_Assembler::const2reg(LIR_Opr src, LIR_Opr dest, LIR_PatchCode patch_cod
 #if INCLUDE_CDS
       if (AOTCodeCache::is_on_for_dump()) {
         address b = c->as_pointer();
+        if (b == (address)ThreadIdentifier::unsafe_offset()) {
+          __ lea(dest->as_register_lo(), ExternalAddress(b));
+          break;
+        }
         if (AOTRuntimeConstants::contains(b)) {
           __ load_aotrc_address(dest->as_register_lo(), b);
           break;

From a90f5a6300b80b5bb0db639337442c6663fae7fa Mon Sep 17 00:00:00 2001
From: Dingli Zhang <dzhang@openjdk.org>
Date: Tue, 7 Apr 2026 01:08:11 +0000
Subject: [PATCH 499/655] 8381611: RISC-V: Factor out function cmpptr from
 MacroAssembler

Reviewed-by: fyang, gcao
---
 src/hotspot/cpu/riscv/macroAssembler_riscv.cpp |  7 -------
 src/hotspot/cpu/riscv/macroAssembler_riscv.hpp |  3 +--
 src/hotspot/cpu/riscv/methodHandles_riscv.cpp  | 11 ++++++++---
 3 files changed, 9 insertions(+), 12 deletions(-)

diff --git a/src/hotspot/cpu/riscv/macroAssembler_riscv.cpp b/src/hotspot/cpu/riscv/macroAssembler_riscv.cpp
index d031161db87..a2b7970f9f6 100644
--- a/src/hotspot/cpu/riscv/macroAssembler_riscv.cpp
+++ b/src/hotspot/cpu/riscv/macroAssembler_riscv.cpp
@@ -5540,13 +5540,6 @@ void MacroAssembler::decrementw(const Address dst, int32_t value, Register tmp1,
   sw(tmp1, adr);
 }
 
-void MacroAssembler::cmpptr(Register src1, const Address &src2, Label& equal, Register tmp) {
-  assert_different_registers(src1, tmp);
-  assert(src2.getMode() == Address::literal, "must be applied to a literal address");
-  ld(tmp, src2);
-  beq(src1, tmp, equal);
-}
-
 void MacroAssembler::load_method_holder_cld(Register result, Register method) {
   load_method_holder(result, method);
   ld(result, Address(result, InstanceKlass::class_loader_data_offset()));
diff --git a/src/hotspot/cpu/riscv/macroAssembler_riscv.hpp b/src/hotspot/cpu/riscv/macroAssembler_riscv.hpp
index 95821c29eec..a51a6aea468 100644
--- a/src/hotspot/cpu/riscv/macroAssembler_riscv.hpp
+++ b/src/hotspot/cpu/riscv/macroAssembler_riscv.hpp
@@ -1353,9 +1353,8 @@ public:
   void decrement(const Address dst, int64_t value = 1, Register tmp1 = t0, Register tmp2 = t1);
   void decrementw(const Address dst, int32_t value = 1, Register tmp1 = t0, Register tmp2 = t1);
 
-  void cmpptr(Register src1, const Address &src2, Label& equal, Register tmp = t0);
-
   void clinit_barrier(Register klass, Register tmp, Label* L_fast_path = nullptr, Label* L_slow_path = nullptr);
+
   void load_method_holder_cld(Register result, Register method);
   void load_method_holder(Register holder, Register method);
 
diff --git a/src/hotspot/cpu/riscv/methodHandles_riscv.cpp b/src/hotspot/cpu/riscv/methodHandles_riscv.cpp
index d770999df96..e80dedf58ed 100644
--- a/src/hotspot/cpu/riscv/methodHandles_riscv.cpp
+++ b/src/hotspot/cpu/riscv/methodHandles_riscv.cpp
@@ -72,17 +72,22 @@ void MethodHandles::verify_klass(MacroAssembler* _masm,
   InstanceKlass** klass_addr = vmClasses::klass_addr_at(klass_id);
   Klass* klass = vmClasses::klass_at(klass_id);
   Register temp1 = t1;
-  Register temp2 = t0; // used by MacroAssembler::cmpptr
+  Register temp2 = t0;
   Label L_ok, L_bad;
   BLOCK_COMMENT("verify_klass {");
   __ verify_oop(obj);
   __ beqz(obj, L_bad);
+
   __ push_reg(RegSet::of(temp1, temp2), sp);
   __ load_klass(temp1, obj, temp2);
-  __ cmpptr(temp1, ExternalAddress((address) klass_addr), L_ok);
+  __ ld(temp2, ExternalAddress((address)klass_addr));
+  __ beq(temp1, temp2, L_ok);
+
   intptr_t super_check_offset = klass->super_check_offset();
   __ ld(temp1, Address(temp1, super_check_offset));
-  __ cmpptr(temp1, ExternalAddress((address) klass_addr), L_ok);
+  __ ld(temp2, ExternalAddress((address)klass_addr));
+  __ beq(temp1, temp2, L_ok);
+
   __ pop_reg(RegSet::of(temp1, temp2), sp);
   __ bind(L_bad);
   __ stop(error_message);

From 132a8d118be66ad5f3d83d098f7df996c27da497 Mon Sep 17 00:00:00 2001
From: Ashay Rane <253344819+raneashay@users.noreply.github.com>
Date: Tue, 7 Apr 2026 05:38:50 +0000
Subject: [PATCH 500/655] 8381451: Prefetch support on Windows/x86 and
 Windows/AArch64

Reviewed-by: dholmes, jwaters
---
 .../prefetch_windows_aarch64.inline.hpp           | 14 ++++++++++++++
 .../windows_x86/prefetch_windows_x86.inline.hpp   | 15 +++++++++++++--
 2 files changed, 27 insertions(+), 2 deletions(-)

diff --git a/src/hotspot/os_cpu/windows_aarch64/prefetch_windows_aarch64.inline.hpp b/src/hotspot/os_cpu/windows_aarch64/prefetch_windows_aarch64.inline.hpp
index a360ee342be..a2c8f0c685c 100644
--- a/src/hotspot/os_cpu/windows_aarch64/prefetch_windows_aarch64.inline.hpp
+++ b/src/hotspot/os_cpu/windows_aarch64/prefetch_windows_aarch64.inline.hpp
@@ -27,10 +27,24 @@
 
 // Included in runtime/prefetch.inline.hpp
 
+#include <intrin.h>
+
+// __prefetch2(addr, prfop) emits a PRFM instruction.
+// The prfop encoding is: <type><target><policy>
+//   type:   PLD = 00, PLI = 01, PST = 10
+//   target: L1  = 00, L2  = 01, L3  = 10
+//   policy: KEEP = 0, STRM = 1
+
 inline void Prefetch::read (const void *loc, intx interval) {
+  if (interval >= 0) {
+    __prefetch2((const char*) loc + interval, /* PLD + L1 + KEEP */ 0);
+  }
 }
 
 inline void Prefetch::write(void *loc, intx interval) {
+  if (interval >= 0) {
+    __prefetch2((char*) loc + interval, /* PST + L1 + KEEP */ 16);
+  }
 }
 
 #endif // OS_CPU_WINDOWS_AARCH64_PREFETCH_WINDOWS_AARCH64_INLINE_HPP
diff --git a/src/hotspot/os_cpu/windows_x86/prefetch_windows_x86.inline.hpp b/src/hotspot/os_cpu/windows_x86/prefetch_windows_x86.inline.hpp
index 645fbe99a22..575eabc97dd 100644
--- a/src/hotspot/os_cpu/windows_x86/prefetch_windows_x86.inline.hpp
+++ b/src/hotspot/os_cpu/windows_x86/prefetch_windows_x86.inline.hpp
@@ -27,7 +27,18 @@
 
 // Included in runtime/prefetch.inline.hpp
 
-inline void Prefetch::read (const void *loc, intx interval) {}
-inline void Prefetch::write(void *loc, intx interval) {}
+#include <intrin.h>
+
+inline void Prefetch::read (const void *loc, intx interval) {
+  if (interval >= 0) {
+    _mm_prefetch((const char*) loc + interval, _MM_HINT_T0);
+  }
+}
+
+inline void Prefetch::write(void *loc, intx interval) {
+  if (interval >= 0) {
+    _mm_prefetch((const char*) loc + interval, _MM_HINT_T0);
+  }
+}
 
 #endif // OS_CPU_WINDOWS_X86_PREFETCH_WINDOWS_X86_INLINE_HPP

From 06b797ec6b5e9a7aca3f196fb4b932d662e9a4a8 Mon Sep 17 00:00:00 2001
From: Anton Seoane Ampudia <aseoane@openjdk.org>
Date: Tue, 7 Apr 2026 07:22:22 +0000
Subject: [PATCH 501/655] 8350603: Several more compiler tests ignore vm flags
 and don't have vm.flagless

Reviewed-by: dfenacci, rcastanedalo, syan
---
 test/hotspot/jtreg/compiler/codecache/CheckLargePages.java    | 4 ++--
 test/hotspot/jtreg/compiler/debug/TestGenerateStressSeed.java | 3 ++-
 test/hotspot/jtreg/compiler/debug/TestStressCM.java           | 4 ++--
 test/hotspot/jtreg/compiler/debug/VerifyAdapterSharing.java   | 4 ++--
 .../compiler/jvmci/TestUncaughtErrorInCompileMethod.java      | 3 ++-
 .../loopopts/TestStressLongCountedLoopLimitChecks.java        | 1 +
 .../onSpinWait/TestOnSpinWaitAArch64DefaultFlags.java         | 1 +
 7 files changed, 12 insertions(+), 8 deletions(-)

diff --git a/test/hotspot/jtreg/compiler/codecache/CheckLargePages.java b/test/hotspot/jtreg/compiler/codecache/CheckLargePages.java
index a7935928cab..3b2451cb740 100644
--- a/test/hotspot/jtreg/compiler/codecache/CheckLargePages.java
+++ b/test/hotspot/jtreg/compiler/codecache/CheckLargePages.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2023, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2023, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -26,7 +26,7 @@
  * @bug 8304954
  * @summary Code cache reservation should gracefully downgrade to using smaller pages if the code cache size is too small to host the requested page size.
  * @requires os.family == "linux"
- * @requires vm.gc != "Z"
+ * @requires vm.flagless
  * @library /test/lib
  * @build jdk.test.whitebox.WhiteBox
  * @run driver jdk.test.lib.helpers.ClassFileInstaller jdk.test.whitebox.WhiteBox
diff --git a/test/hotspot/jtreg/compiler/debug/TestGenerateStressSeed.java b/test/hotspot/jtreg/compiler/debug/TestGenerateStressSeed.java
index 9542e48e54e..60185fa91ad 100644
--- a/test/hotspot/jtreg/compiler/debug/TestGenerateStressSeed.java
+++ b/test/hotspot/jtreg/compiler/debug/TestGenerateStressSeed.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2020, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -32,6 +32,7 @@ import jdk.test.lib.process.ProcessTools;
  * @key stress randomness
  * @bug 8252219 8256535 8325478
  * @requires vm.compiler2.enabled
+ * @requires vm.flagless
  * @summary Tests that using a stress option without -XX:StressSeed=N generates
  *          and logs a random seed.
  * @library /test/lib /
diff --git a/test/hotspot/jtreg/compiler/debug/TestStressCM.java b/test/hotspot/jtreg/compiler/debug/TestStressCM.java
index 0fb624bc16f..a6065fa4d09 100644
--- a/test/hotspot/jtreg/compiler/debug/TestStressCM.java
+++ b/test/hotspot/jtreg/compiler/debug/TestStressCM.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2020, 2023, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -48,7 +48,7 @@ public class TestStressCM {
             "-XX:CompileOnly=" + className + "::sum",
             "-XX:+TraceOptoPipelining", "-XX:+" + stressOpt,
             "-XX:StressSeed=" + stressSeed, className, "10"};
-        ProcessBuilder pb  = ProcessTools.createLimitedTestJavaProcessBuilder(procArgs);
+        ProcessBuilder pb  = ProcessTools.createTestJavaProcessBuilder(procArgs);
         OutputAnalyzer out = new OutputAnalyzer(pb.start());
         out.shouldHaveExitValue(0);
         // Extract the trace of our method (the last one after those of all
diff --git a/test/hotspot/jtreg/compiler/debug/VerifyAdapterSharing.java b/test/hotspot/jtreg/compiler/debug/VerifyAdapterSharing.java
index 89da61a5763..1e76887732f 100644
--- a/test/hotspot/jtreg/compiler/debug/VerifyAdapterSharing.java
+++ b/test/hotspot/jtreg/compiler/debug/VerifyAdapterSharing.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2013, 2023, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2013, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -42,7 +42,7 @@ public class VerifyAdapterSharing {
         ProcessBuilder pb;
         OutputAnalyzer out;
 
-        pb = ProcessTools.createLimitedTestJavaProcessBuilder("-Xcomp", "-XX:+IgnoreUnrecognizedVMOptions",
+        pb = ProcessTools.createTestJavaProcessBuilder("-Xcomp", "-XX:+IgnoreUnrecognizedVMOptions",
                 "-XX:+VerifyAdapterSharing", "-version");
         out = new OutputAnalyzer(pb.start());
         out.shouldHaveExitValue(0);
diff --git a/test/hotspot/jtreg/compiler/jvmci/TestUncaughtErrorInCompileMethod.java b/test/hotspot/jtreg/compiler/jvmci/TestUncaughtErrorInCompileMethod.java
index bfb617a0a3a..1c2d07d3255 100644
--- a/test/hotspot/jtreg/compiler/jvmci/TestUncaughtErrorInCompileMethod.java
+++ b/test/hotspot/jtreg/compiler/jvmci/TestUncaughtErrorInCompileMethod.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2023, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2023, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -28,6 +28,7 @@
  *          which is only read in a debug VM.
  * @requires vm.jvmci
  * @requires vm.debug
+ * @requires vm.flagless
  * @library /test/lib /
  * @modules jdk.internal.vm.ci/jdk.vm.ci.hotspot
  *          jdk.internal.vm.ci/jdk.vm.ci.code
diff --git a/test/hotspot/jtreg/compiler/loopopts/TestStressLongCountedLoopLimitChecks.java b/test/hotspot/jtreg/compiler/loopopts/TestStressLongCountedLoopLimitChecks.java
index fd0143acdb6..764acba567f 100644
--- a/test/hotspot/jtreg/compiler/loopopts/TestStressLongCountedLoopLimitChecks.java
+++ b/test/hotspot/jtreg/compiler/loopopts/TestStressLongCountedLoopLimitChecks.java
@@ -37,6 +37,7 @@ import java.util.stream.Stream;
  * @summary test loop limit checks are inserted when stressing int counted loops to long counted loops
  * @library /test/lib
  * @requires vm.debug == true
+ * @requires vm.flagless
  * @run driver compiler.loopopts.TestStressLongCountedLoopLimitChecks
  */
 public class TestStressLongCountedLoopLimitChecks {
diff --git a/test/hotspot/jtreg/compiler/onSpinWait/TestOnSpinWaitAArch64DefaultFlags.java b/test/hotspot/jtreg/compiler/onSpinWait/TestOnSpinWaitAArch64DefaultFlags.java
index f7ed6096080..337012d834f 100644
--- a/test/hotspot/jtreg/compiler/onSpinWait/TestOnSpinWaitAArch64DefaultFlags.java
+++ b/test/hotspot/jtreg/compiler/onSpinWait/TestOnSpinWaitAArch64DefaultFlags.java
@@ -28,6 +28,7 @@
  * @library /test/lib /
  *
  * @requires os.arch=="aarch64"
+ * @requires vm.flagless
  *
  * @build jdk.test.whitebox.WhiteBox
  * @run driver jdk.test.lib.helpers.ClassFileInstaller jdk.test.whitebox.WhiteBox

From f31421266f1b1e68fe1dfcc9eb1514af845e74ac Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Manuel=20H=C3=A4ssig?= <mhaessig@openjdk.org>
Date: Tue, 7 Apr 2026 07:35:50 +0000
Subject: [PATCH 502/655] 8370416: C2: Optimizing away arraycopy leads to wrong
 execution

Co-authored-by: Olivier Mattmann <olivier.mattmann@bluewin.ch>
Co-authored-by: Roland Westrelin <roland@openjdk.org>
Co-authored-by: Emanuel Peter <epeter@openjdk.org>
Co-authored-by: Tobias Hartmann <thartmann@openjdk.org>
Co-authored-by: Christian Hagedorn <chagedorn@openjdk.org>
Co-authored-by: Quan Anh Mai <qamai@openjdk.org>
Reviewed-by: epeter, qamai
---
 src/hotspot/share/opto/arraycopynode.cpp      |   6 +-
 src/hotspot/share/opto/arraycopynode.hpp      |   5 +-
 src/hotspot/share/opto/callnode.cpp           |   4 +-
 src/hotspot/share/opto/callnode.hpp           |   8 +-
 src/hotspot/share/opto/macro.cpp              | 191 +++--
 src/hotspot/share/opto/macro.hpp              |   4 +-
 ...ayCopyEliminationUncRematerialization.java | 666 ++++++++++++++++++
 7 files changed, 808 insertions(+), 76 deletions(-)
 create mode 100644 test/hotspot/jtreg/compiler/escapeAnalysis/TestArrayCopyEliminationUncRematerialization.java

diff --git a/src/hotspot/share/opto/arraycopynode.cpp b/src/hotspot/share/opto/arraycopynode.cpp
index 82d17440c56..dab0ca98911 100644
--- a/src/hotspot/share/opto/arraycopynode.cpp
+++ b/src/hotspot/share/opto/arraycopynode.cpp
@@ -383,6 +383,10 @@ const TypePtr* ArrayCopyNode::get_address_type(PhaseGVN* phase, const TypePtr* a
   return atp->add_offset(Type::OffsetBot);
 }
 
+const TypePtr* ArrayCopyNode::get_src_adr_type(PhaseGVN* phase) const {
+  return get_address_type(phase, _src_type, in(Src));
+}
+
 void ArrayCopyNode::array_copy_test_overlap(PhaseGVN *phase, bool can_reshape, bool disjoint_bases, int count, Node*& forward_ctl, Node*& backward_ctl) {
   Node* ctl = in(TypeFunc::Control);
   if (!disjoint_bases && count > 1) {
@@ -688,7 +692,7 @@ Node *ArrayCopyNode::Ideal(PhaseGVN *phase, bool can_reshape) {
   return mem;
 }
 
-bool ArrayCopyNode::may_modify(const TypeOopPtr* t_oop, PhaseValues* phase) {
+bool ArrayCopyNode::may_modify(const TypeOopPtr* t_oop, PhaseValues* phase) const {
   Node* dest = in(ArrayCopyNode::Dest);
   if (dest->is_top()) {
     return false;
diff --git a/src/hotspot/share/opto/arraycopynode.hpp b/src/hotspot/share/opto/arraycopynode.hpp
index 83c085fd5db..483a3a86267 100644
--- a/src/hotspot/share/opto/arraycopynode.hpp
+++ b/src/hotspot/share/opto/arraycopynode.hpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2016, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2016, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -95,6 +95,7 @@ public:
     _arraycopy_type_Type =  TypeFunc::make(domain, range);
   }
 
+  const TypePtr* get_src_adr_type(PhaseGVN* phase) const;
 private:
   ArrayCopyNode(Compile* C, bool alloc_tightly_coupled, bool has_negative_length_guard);
 
@@ -183,7 +184,7 @@ public:
   virtual bool guaranteed_safepoint()  { return false; }
   virtual Node *Ideal(PhaseGVN *phase, bool can_reshape);
 
-  virtual bool may_modify(const TypeOopPtr* t_oop, PhaseValues* phase);
+  virtual bool may_modify(const TypeOopPtr* t_oop, PhaseValues* phase) const;
 
   bool is_alloc_tightly_coupled() const { return _alloc_tightly_coupled; }
 
diff --git a/src/hotspot/share/opto/callnode.cpp b/src/hotspot/share/opto/callnode.cpp
index c7c0810ae85..b2b01079379 100644
--- a/src/hotspot/share/opto/callnode.cpp
+++ b/src/hotspot/share/opto/callnode.cpp
@@ -827,7 +827,7 @@ uint CallNode::match_edge(uint idx) const {
 // Determine whether the call could modify the field of the specified
 // instance at the specified offset.
 //
-bool CallNode::may_modify(const TypeOopPtr* t_oop, PhaseValues* phase) {
+bool CallNode::may_modify(const TypeOopPtr* t_oop, PhaseValues* phase) const {
   assert((t_oop != nullptr), "sanity");
   if (is_call_to_arraycopystub() && strcmp(_name, "unsafe_arraycopy") != 0) {
     const TypeTuple* args = _tf->domain();
@@ -2413,7 +2413,7 @@ void AbstractLockNode::log_lock_optimization(Compile *C, const char * tag, Node*
   }
 }
 
-bool CallNode::may_modify_arraycopy_helper(const TypeOopPtr* dest_t, const TypeOopPtr* t_oop, PhaseValues* phase) {
+bool CallNode::may_modify_arraycopy_helper(const TypeOopPtr* dest_t, const TypeOopPtr* t_oop, PhaseValues* phase) const {
   if (dest_t->is_known_instance() && t_oop->is_known_instance()) {
     return dest_t->instance_id() == t_oop->instance_id();
   }
diff --git a/src/hotspot/share/opto/callnode.hpp b/src/hotspot/share/opto/callnode.hpp
index a5131676347..5241ae6cd2b 100644
--- a/src/hotspot/share/opto/callnode.hpp
+++ b/src/hotspot/share/opto/callnode.hpp
@@ -685,7 +685,7 @@ class CallGenerator;
 class CallNode : public SafePointNode {
 
 protected:
-  bool may_modify_arraycopy_helper(const TypeOopPtr* dest_t, const TypeOopPtr* t_oop, PhaseValues* phase);
+  bool may_modify_arraycopy_helper(const TypeOopPtr* dest_t, const TypeOopPtr* t_oop, PhaseValues* phase) const;
 
 public:
   const TypeFunc* _tf;          // Function type
@@ -734,7 +734,7 @@ public:
   virtual bool needs_deep_clone_jvms(Compile* C) { return _generator != nullptr || C->needs_deep_clone_jvms(); }
 
   // Returns true if the call may modify n
-  virtual bool        may_modify(const TypeOopPtr* t_oop, PhaseValues* phase);
+  virtual bool        may_modify(const TypeOopPtr* t_oop, PhaseValues* phase) const;
   // Does this node have a use of n other than in debug information?
   bool                has_non_debug_use(Node* n);
   // Returns the unique CheckCastPP of a call
@@ -1044,7 +1044,7 @@ public:
   virtual bool        guaranteed_safepoint()  { return false; }
 
   // allocations do not modify their arguments
-  virtual bool        may_modify(const TypeOopPtr* t_oop, PhaseValues* phase) { return false;}
+  virtual bool may_modify(const TypeOopPtr* t_oop, PhaseValues* phase) const { return false; }
 
   // Pattern-match a possible usage of AllocateNode.
   // Return null if no allocation is recognized.
@@ -1208,7 +1208,7 @@ public:
   bool is_balanced();
 
   // locking does not modify its arguments
-  virtual bool may_modify(const TypeOopPtr* t_oop, PhaseValues* phase){ return false; }
+  virtual bool may_modify(const TypeOopPtr* t_oop, PhaseValues* phase) const { return false; }
 
 #ifndef PRODUCT
   void create_lock_counter(JVMState* s);
diff --git a/src/hotspot/share/opto/macro.cpp b/src/hotspot/share/opto/macro.cpp
index 1c54a11e2a4..01c67187883 100644
--- a/src/hotspot/share/opto/macro.cpp
+++ b/src/hotspot/share/opto/macro.cpp
@@ -52,6 +52,7 @@
 #include "prims/jvmtiExport.hpp"
 #include "runtime/continuation.hpp"
 #include "runtime/sharedRuntime.hpp"
+#include "utilities/globalDefinitions.hpp"
 #include "utilities/macros.hpp"
 #include "utilities/powerOfTwo.hpp"
 #if INCLUDE_G1GC
@@ -261,74 +262,128 @@ static Node *scan_mem_chain(Node *mem, int alias_idx, int offset, Node *start_me
   }
 }
 
-// Generate loads from source of the arraycopy for fields of
-// destination needed at a deoptimization point
-Node* PhaseMacroExpand::make_arraycopy_load(ArrayCopyNode* ac, intptr_t offset, Node* ctl, Node* mem, BasicType ft, const Type *ftype, AllocateNode *alloc) {
+// Determine if there is an interfering store between a rematerialization load and an arraycopy that is in the process
+// of being elided. Starting from the given rematerialization load this method starts a BFS traversal upwards through
+// the memory graph towards the provided ArrayCopyNode. For every node encountered on the traversal, check that it is
+// independent from the provided rematerialization. Returns false if every node on the traversal is independent and
+// true otherwise.
+bool has_interfering_store(const ArrayCopyNode* ac, LoadNode* load, PhaseGVN* phase) {
+  assert(ac != nullptr && load != nullptr, "sanity");
+  AccessAnalyzer acc(phase, load);
+  ResourceMark rm;
+  Unique_Node_List to_visit;
+  to_visit.push(load->in(MemNode::Memory));
+
+  for (uint worklist_idx = 0; worklist_idx < to_visit.size(); worklist_idx++) {
+    Node* mem = to_visit.at(worklist_idx);
+
+    if (mem->is_Proj() && mem->in(0) == ac) {
+      // Reached the target, so visit what is left on the worklist.
+      continue;
+    }
+
+    if (mem->is_Phi()) {
+      assert(mem->bottom_type() == Type::MEMORY, "do not leave memory graph");
+      // Add all non-control inputs of phis to be visited.
+      for (uint phi_in = 1; phi_in < mem->len(); phi_in++) {
+        Node* input = mem->in(phi_in);
+        if (input != nullptr) {
+          to_visit.push(input);
+        }
+      }
+      continue;
+    }
+
+    AccessAnalyzer::AccessIndependence ind = acc.detect_access_independence(mem);
+    if (ind.independent) {
+      to_visit.push(ind.mem);
+    } else {
+      return true;
+    }
+  }
+  // Did not find modification of source element in memory graph.
+  return false;
+}
+
+// Generate loads from source of the arraycopy for fields of destination needed at a deoptimization point.
+// Returns nullptr if the load cannot be created because the arraycopy is not suitable for elimination
+// (e.g. copy inside the array with non-constant offsets) or the inputs do not match our assumptions (e.g.
+// the arraycopy does not actually write something at the provided offset).
+Node* PhaseMacroExpand::make_arraycopy_load(ArrayCopyNode* ac, intptr_t offset, Node* ctl, Node* mem, BasicType ft, const Type* ftype, AllocateNode* alloc) {
+  assert((ctl == ac->control() && mem == ac->memory()) != (mem != ac->memory() && ctl->is_Proj() && ctl->as_Proj()->is_uncommon_trap_proj()),
+    "Either the control and memory are the same as for the arraycopy or they are pinned in an uncommon trap.");
   BasicType bt = ft;
   const Type *type = ftype;
   if (ft == T_NARROWOOP) {
     bt = T_OBJECT;
     type = ftype->make_oopptr();
   }
-  Node* res = nullptr;
+  Node* base = ac->in(ArrayCopyNode::Src);
+  Node* adr = nullptr;
+  const TypePtr* adr_type = nullptr;
+
   if (ac->is_clonebasic()) {
     assert(ac->in(ArrayCopyNode::Src) != ac->in(ArrayCopyNode::Dest), "clone source equals destination");
-    Node* base = ac->in(ArrayCopyNode::Src);
-    Node* adr = _igvn.transform(AddPNode::make_with_base(base, _igvn.MakeConX(offset)));
-    const TypePtr* adr_type = _igvn.type(base)->is_ptr()->add_offset(offset);
-    MergeMemNode* mergemen = _igvn.transform(MergeMemNode::make(mem))->as_MergeMem();
-    BarrierSetC2* bs = BarrierSet::barrier_set()->barrier_set_c2();
-    res = ArrayCopyNode::load(bs, &_igvn, ctl, mergemen, adr, adr_type, type, bt);
+    adr = _igvn.transform(AddPNode::make_with_base(base, _igvn.MakeConX(offset)));
+    adr_type = _igvn.type(base)->is_ptr()->add_offset(offset);
   } else {
-    if (ac->modifies(offset, offset, &_igvn, true)) {
-      assert(ac->in(ArrayCopyNode::Dest) == alloc->result_cast(), "arraycopy destination should be allocation's result");
-      uint shift = exact_log2(type2aelembytes(bt));
-      Node* src_pos = ac->in(ArrayCopyNode::SrcPos);
-      Node* dest_pos = ac->in(ArrayCopyNode::DestPos);
-      const TypeInt* src_pos_t = _igvn.type(src_pos)->is_int();
-      const TypeInt* dest_pos_t = _igvn.type(dest_pos)->is_int();
+    if (!ac->modifies(offset, offset, &_igvn, true)) {
+      // If the arraycopy does not copy to this offset, we cannot generate a rematerialization load for it.
+      return nullptr;
+    }
+    assert(ac->in(ArrayCopyNode::Dest) == alloc->result_cast(), "arraycopy destination should be allocation's result");
+    uint shift = exact_log2(type2aelembytes(bt));
+    Node* src_pos = ac->in(ArrayCopyNode::SrcPos);
+    Node* dest_pos = ac->in(ArrayCopyNode::DestPos);
+    const TypeInt* src_pos_t = _igvn.type(src_pos)->is_int();
+    const TypeInt* dest_pos_t = _igvn.type(dest_pos)->is_int();
 
-      Node* adr = nullptr;
-      const TypePtr* adr_type = nullptr;
-      if (src_pos_t->is_con() && dest_pos_t->is_con()) {
-        intptr_t off = ((src_pos_t->get_con() - dest_pos_t->get_con()) << shift) + offset;
-        Node* base = ac->in(ArrayCopyNode::Src);
-        adr = _igvn.transform(AddPNode::make_with_base(base, _igvn.MakeConX(off)));
-        adr_type = _igvn.type(base)->is_ptr()->add_offset(off);
-        if (ac->in(ArrayCopyNode::Src) == ac->in(ArrayCopyNode::Dest)) {
-          // Don't emit a new load from src if src == dst but try to get the value from memory instead
-          return value_from_mem(ac->in(TypeFunc::Memory), ctl, ft, ftype, adr_type->isa_oopptr(), alloc);
-        }
-      } else {
-        Node* diff = _igvn.transform(new SubINode(ac->in(ArrayCopyNode::SrcPos), ac->in(ArrayCopyNode::DestPos)));
-#ifdef _LP64
-        diff = _igvn.transform(new ConvI2LNode(diff));
-#endif
-        diff = _igvn.transform(new LShiftXNode(diff, _igvn.intcon(shift)));
-
-        Node* off = _igvn.transform(new AddXNode(_igvn.MakeConX(offset), diff));
-        Node* base = ac->in(ArrayCopyNode::Src);
-        adr = _igvn.transform(AddPNode::make_with_base(base, off));
-        adr_type = _igvn.type(base)->is_ptr()->add_offset(Type::OffsetBot);
-        if (ac->in(ArrayCopyNode::Src) == ac->in(ArrayCopyNode::Dest)) {
-          // Non constant offset in the array: we can't statically
-          // determine the value
-          return nullptr;
-        }
+    if (src_pos_t->is_con() && dest_pos_t->is_con()) {
+      intptr_t off = ((src_pos_t->get_con() - dest_pos_t->get_con()) << shift) + offset;
+      adr = _igvn.transform(AddPNode::make_with_base(base, _igvn.MakeConX(off)));
+      adr_type = _igvn.type(base)->is_ptr()->add_offset(off);
+      if (ac->in(ArrayCopyNode::Src) == ac->in(ArrayCopyNode::Dest)) {
+        // Don't emit a new load from src if src == dst but try to get the value from memory instead
+        return value_from_mem(ac, ctl, ft, ftype, adr_type->isa_oopptr(), alloc);
+      }
+    } else {
+      Node* diff = _igvn.transform(new SubINode(ac->in(ArrayCopyNode::SrcPos), ac->in(ArrayCopyNode::DestPos)));
+#ifdef _LP64
+      diff = _igvn.transform(new ConvI2LNode(diff));
+#endif
+      diff = _igvn.transform(new LShiftXNode(diff, _igvn.intcon(shift)));
+
+      Node* off = _igvn.transform(new AddXNode(_igvn.MakeConX(offset), diff));
+      adr = _igvn.transform(AddPNode::make_with_base(base, off));
+      adr_type = _igvn.type(base)->is_ptr()->add_offset(Type::OffsetBot);
+      if (ac->in(ArrayCopyNode::Src) == ac->in(ArrayCopyNode::Dest)) {
+        // Non constant offset in the array: we can't statically
+        // determine the value
+        return nullptr;
       }
-      MergeMemNode* mergemen = _igvn.transform(MergeMemNode::make(mem))->as_MergeMem();
-      BarrierSetC2* bs = BarrierSet::barrier_set()->barrier_set_c2();
-      res = ArrayCopyNode::load(bs, &_igvn, ctl, mergemen, adr, adr_type, type, bt);
     }
   }
-  if (res != nullptr) {
-    if (ftype->isa_narrowoop()) {
-      // PhaseMacroExpand::scalar_replacement adds DecodeN nodes
-      res = _igvn.transform(new EncodePNode(res, ftype));
-    }
-    return res;
+  assert(adr != nullptr && adr_type != nullptr, "sanity");
+
+  // Create the rematerialization load ...
+  MergeMemNode* mergemem = _igvn.transform(MergeMemNode::make(mem))->as_MergeMem();
+  BarrierSetC2* bs = BarrierSet::barrier_set()->barrier_set_c2();
+  Node* res = ArrayCopyNode::load(bs, &_igvn, ctl, mergemem, adr, adr_type, type, bt);
+  assert(res != nullptr, "load should have been created");
+
+  // ... and ensure that pinning the rematerialization load inside the uncommon path is safe.
+  if (mem != ac->memory() && ctl->is_Proj() && ctl->as_Proj()->is_uncommon_trap_proj() && res->is_Load() &&
+      has_interfering_store(ac, res->as_Load(), &_igvn)) {
+    // Not safe: use control and memory from the arraycopy to ensure correct memory state.
+    _igvn.remove_dead_node(res, PhaseIterGVN::NodeOrigin::Graph); // Clean up the unusable rematerialization load.
+    return make_arraycopy_load(ac, offset, ac->control(), ac->memory(), ft, ftype, alloc);
   }
-  return nullptr;
+
+  if (ftype->isa_narrowoop()) {
+    // PhaseMacroExpand::scalar_replacement adds DecodeN nodes
+    res = _igvn.transform(new EncodePNode(res, ftype));
+  }
+  return res;
 }
 
 //
@@ -441,21 +496,22 @@ Node *PhaseMacroExpand::value_from_mem_phi(Node *mem, BasicType ft, const Type *
 }
 
 // Search the last value stored into the object's field.
-Node *PhaseMacroExpand::value_from_mem(Node *sfpt_mem, Node *sfpt_ctl, BasicType ft, const Type *ftype, const TypeOopPtr *adr_t, AllocateNode *alloc) {
+Node* PhaseMacroExpand::value_from_mem(Node* origin, Node* ctl, BasicType ft, const Type* ftype, const TypeOopPtr* adr_t, AllocateNode* alloc) {
   assert(adr_t->is_known_instance_field(), "instance required");
   int instance_id = adr_t->instance_id();
   assert((uint)instance_id == alloc->_idx, "wrong allocation");
 
   int alias_idx = C->get_alias_index(adr_t);
   int offset = adr_t->offset();
+  Node* orig_mem = origin->in(TypeFunc::Memory);
   Node *start_mem = C->start()->proj_out_or_null(TypeFunc::Memory);
   Node *alloc_ctrl = alloc->in(TypeFunc::Control);
   Node *alloc_mem = alloc->proj_out_or_null(TypeFunc::Memory, /*io_use:*/false);
   assert(alloc_mem != nullptr, "Allocation without a memory projection.");
   VectorSet visited;
 
-  bool done = sfpt_mem == alloc_mem;
-  Node *mem = sfpt_mem;
+  bool done = orig_mem == alloc_mem;
+  Node *mem = orig_mem;
   while (!done) {
     if (visited.test_set(mem->_idx)) {
       return nullptr;  // found a loop, give up
@@ -535,17 +591,22 @@ Node *PhaseMacroExpand::value_from_mem(Node *sfpt_mem, Node *sfpt_ctl, BasicType
         }
       }
     } else if (mem->is_ArrayCopy()) {
-      Node* ctl = mem->in(0);
-      Node* m = mem->in(TypeFunc::Memory);
-      if (sfpt_ctl->is_Proj() && sfpt_ctl->as_Proj()->is_uncommon_trap_proj()) {
+      // Rematerialize the scalar-replaced array. If possible, pin the loads to the uncommon path of the uncommon trap.
+      // Check for each element of the source array, whether it was modified. If not, pin both memory and control to
+      // the uncommon path. Otherwise, use the control and memory state of the arraycopy. Control and memory state must
+      // come from the same source to prevent anti-dependence problems in the backend.
+      ArrayCopyNode* ac = mem->as_ArrayCopy();
+      Node* ac_ctl = ac->control();
+      Node* ac_mem = ac->memory();
+      if (ctl->is_Proj() && ctl->as_Proj()->is_uncommon_trap_proj()) {
         // pin the loads in the uncommon trap path
-        ctl = sfpt_ctl;
-        m = sfpt_mem;
+        ac_ctl = ctl;
+        ac_mem = orig_mem;
       }
-      return make_arraycopy_load(mem->as_ArrayCopy(), offset, ctl, m, ft, ftype, alloc);
+      return make_arraycopy_load(ac, offset, ac_ctl, ac_mem, ft, ftype, alloc);
     }
   }
-  // Something go wrong.
+  // Something went wrong.
   return nullptr;
 }
 
@@ -852,7 +913,7 @@ SafePointScalarObjectNode* PhaseMacroExpand::create_scalarized_object_descriptio
 
     const TypeOopPtr *field_addr_type = res_type->add_offset(offset)->isa_oopptr();
 
-    Node *field_val = value_from_mem(sfpt->memory(), sfpt->control(), basic_elem_type, field_type, field_addr_type, alloc);
+    Node* field_val = value_from_mem(sfpt, sfpt->control(), basic_elem_type, field_type, field_addr_type, alloc);
 
     // We weren't able to find a value for this field,
     // give up on eliminating this allocation.
diff --git a/src/hotspot/share/opto/macro.hpp b/src/hotspot/share/opto/macro.hpp
index 59a455cae6d..e4b20402e63 100644
--- a/src/hotspot/share/opto/macro.hpp
+++ b/src/hotspot/share/opto/macro.hpp
@@ -104,7 +104,7 @@ private:
                               address slow_call_address,
                               Node* valid_length_test);
   void yank_alloc_node(AllocateNode* alloc);
-  Node *value_from_mem(Node *mem, Node *ctl, BasicType ft, const Type *ftype, const TypeOopPtr *adr_t, AllocateNode *alloc);
+  Node* value_from_mem(Node* start, Node* ctl, BasicType ft, const Type* ftype, const TypeOopPtr* adr_t, AllocateNode* alloc);
   Node *value_from_mem_phi(Node *mem, BasicType ft, const Type *ftype, const TypeOopPtr *adr_t, AllocateNode *alloc, Node_Stack *value_phis, int level);
 
   bool eliminate_boxing_node(CallStaticJavaNode *boxing);
@@ -205,7 +205,7 @@ private:
                           Node* klass_node, Node* length,
                           Node* size_in_bytes);
 
-  Node* make_arraycopy_load(ArrayCopyNode* ac, intptr_t offset, Node* ctl, Node* mem, BasicType ft, const Type *ftype, AllocateNode *alloc);
+  Node* make_arraycopy_load(ArrayCopyNode* ac, intptr_t offset, Node* ctl, Node* mem, BasicType ft, const Type* ftype, AllocateNode* alloc);
 
 public:
   PhaseMacroExpand(PhaseIterGVN &igvn) : Phase(Macro_Expand), _igvn(igvn) {
diff --git a/test/hotspot/jtreg/compiler/escapeAnalysis/TestArrayCopyEliminationUncRematerialization.java b/test/hotspot/jtreg/compiler/escapeAnalysis/TestArrayCopyEliminationUncRematerialization.java
new file mode 100644
index 00000000000..a2a0a1a05f6
--- /dev/null
+++ b/test/hotspot/jtreg/compiler/escapeAnalysis/TestArrayCopyEliminationUncRematerialization.java
@@ -0,0 +1,666 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+/**
+ * @test
+ * @bug 8370416
+ * @key randomness
+ * @summary Ensure that rematerialization loads for a scalarized arraycopy destination use the correct control and memory state.
+ * @library /test/lib /
+ * @run driver ${test.main.class}
+ */
+
+package compiler.escapeAnalysis;
+
+import java.util.List;
+import java.util.ArrayList;
+import java.util.HashSet;
+import java.util.Set;
+import java.util.Random;
+import java.util.stream.Collectors;
+
+import jdk.test.lib.Utils;
+import compiler.lib.compile_framework.*;
+import compiler.lib.template_framework.Template;
+import compiler.lib.template_framework.Template.ZeroArgs;
+import compiler.lib.template_framework.TemplateToken;
+import static compiler.lib.template_framework.Template.scope;
+import static compiler.lib.template_framework.Template.let;
+import compiler.lib.template_framework.library.CodeGenerationDataNameType;
+import compiler.lib.template_framework.library.Hooks;
+import compiler.lib.template_framework.library.PrimitiveType;
+import compiler.lib.template_framework.library.TestFrameworkClass;
+
+
+public class TestArrayCopyEliminationUncRematerialization {
+    private static final Random RANDOM = Utils.getRandomInstance();
+    private static final String PACKAGE = "compiler.escapeAnalysis.templated";
+    private static final String CLASS_NAME = "TestArrayCopyEliminationUncRematerializationGenerated";
+
+    // This generates a test containing test methods of the form
+    //  static int testStore(int[] src, boolean flag) {
+    //      int[] dst = new int[COPY_LEN];
+    //      System.arraycopy(src, 0, dst, 0, COPY_LEN);
+    //      src[WRITE_IDX] = WRITE_VAL_I; // Pollute the element in the source array corresponding to the returned element in dst.
+    //      if (flag) { // Compiles to unstable if trap when called exclusively with flag = false.
+    //          dst[0] = (byte) 0x7f;
+    //      }
+    //      return dst[RETURN_IDX]; // Corresponds to src[WRITE_IDX]
+    //  }
+    // for all primitive types except boolean and for different methods of polluting the source
+    // array and producing an unstable if trap.
+    // The templates below generate an IR test that validates that as many rematerialization loads
+    // as possible are placed in the uncommon path and that the returned result is in fact from
+    // the source array.
+    // Between different runs of the test, it will generate different sized arrays and indices
+    // to read from and store to (see TestConfig below). Further, this generates a variant of the
+    // test method, where the offset into src is provided in an argument. C2 cannot put any rematerialization
+    // loads in the uncommon path then, but it is useful for checking the correct result.
+    public static void main(String[] args) {
+        final CompileFramework comp = new CompileFramework();
+
+        comp.addJavaSourceCode(PACKAGE + "." + CLASS_NAME, generate(comp));
+
+        comp.compile();
+
+        // Ensure consistent results for the node counts in the arraycopy subtests.
+        comp.invoke(PACKAGE + "." + CLASS_NAME, "main", new Object[] { new String[] { } });
+    }
+
+    private record TestConfig(int srcSize, int copyLen, int copyIdx, int writeIdx, int returnIdx) {
+        static TestConfig make() {
+            int copyLen = RANDOM.nextInt(10, 64); // 64 is the default value for -XX:EliminateAllocationArraySizeLimit.
+            int srcSize = RANDOM.nextInt(copyLen + 20, 1000);
+            int copyIdx = RANDOM.nextInt(1, srcSize - copyLen); // The index we start arraycopying src from.
+            int returnIdx = RANDOM.nextInt(0, copyLen); // The index where dst returns from. Must correspond to writeIdx in src.
+            int writeIdx = copyIdx + returnIdx; // The index we write to in src.
+
+            return new TestConfig(srcSize, copyLen, copyIdx, writeIdx, returnIdx);
+        }
+
+        public TemplateToken constDefinitions() {
+            return Template.make(() -> scope(
+                Hooks.CLASS_HOOK.insert(scope(
+                    String.format("private static final int SRC_SIZE = %d;\n", srcSize),
+                    String.format("private static final int COPY_LEN = %d;\n", copyLen),
+                    String.format("private static final int COPY_IDX = %d;\n", copyIdx),
+                    String.format("private static final int WRITE_IDX = %d;\n", writeIdx),
+                    String.format("private static final int RETURN_IDX = %d;\n", returnIdx)
+            )))).asToken();
+        }
+
+        public int copyEnd() {
+            return copyIdx + copyLen;
+        }
+    }
+
+    private static String generate(CompileFramework comp) {
+        TestConfig config = TestConfig.make();
+
+        final List<TemplateToken> tests = new ArrayList<>();
+        tests.add(config.constDefinitions());
+        tests.add(PrimitiveType.generateLibraryRNG());
+
+        // Generate all testcases for all primitive types except boolean.
+        tests.addAll(CodeGenerationDataNameType.INTEGRAL_AND_FLOATING_TYPES
+                         .stream()
+                         .map(pty -> new TestsPerType(pty).generate(config))
+                         .collect(Collectors.toList()));
+
+        final Set<String> imports = Set.of("java.lang.foreign.MemorySegment",
+                                           "java.lang.foreign.ValueLayout",
+                                           "java.lang.invoke.MethodHandles",
+                                           "java.lang.invoke.VarHandle",
+                                           "java.util.Arrays",
+                                           "java.util.Random",
+                                           "jdk.test.lib.Asserts",
+                                           "jdk.test.lib.Utils",
+                                           "compiler.lib.generators.*");
+
+        return TestFrameworkClass.render(PACKAGE, CLASS_NAME, imports, comp.getEscapedClassPathOfCompiledClasses(), tests);
+    }
+
+    record TestsPerType(PrimitiveType pty) {
+        private record TestTemplates(ZeroArgs store, ZeroArgs trap, ZeroArgs prelude) {
+            TestTemplates(ZeroArgs store, ZeroArgs trap) {
+                this(store, trap, Template.make(() -> scope("")));
+            }
+        }
+
+        TemplateToken generate(TestConfig config) {
+            final String srcArray = "src" + pty.abbrev();
+            final String handle = pty.name().toUpperCase() + "_ARR";
+
+            var runTestConst = Template.make("testName", (String testName) -> scope(
+                let("type", pty),
+                let("typeAbbrev", pty.abbrev()),
+                let("srcField", srcArray),
+                """
+                @Run(test = "test#{testName}")
+                static void run#{testName}(RunInfo info) {
+                    Arrays.fill(#{srcField}, SRC_VAL_#{typeAbbrev});
+                    #type res = test#{testName}(#{srcField}, #{srcField}, info.isWarmUp());
+                    Asserts.assertEQ((#type) SRC_VAL_#{typeAbbrev}, res, "Wrong result from " + info.getTest().getName() + " with flag " + info.isWarmUp());
+                }
+                """
+            ));
+
+            var runTestIdx = Template.make("testName", (String testName) -> scope(
+                let("type", pty),
+                let("typeAbbrev", pty.abbrev()),
+                let("srcField", srcArray),
+                """
+                @Run(test = "test#{testName}")
+                static void run#{testName}(RunInfo info) {
+                    Arrays.fill(#{srcField}, SRC_VAL_#{typeAbbrev});
+                    #type res = test#{testName}(#{srcField}, COPY_IDX, info.isWarmUp());
+                    Asserts.assertEQ((#type) SRC_VAL_#{typeAbbrev}, res, "Wrong result from " + info.getTest().getName() + " with flag " + info.isWarmUp());
+                }
+                """
+            ));
+
+            var testMethodConst = Template.make("testName", "tmp", (String TestName, TestTemplates templates) -> scope(
+                let("type", pty),
+                """
+                static #type test#{testName}(#type[] src, #type[] alias, boolean flag) {
+                    """,
+                    templates.prelude.asToken(),
+                    """
+                    #type[] dst = new #type[COPY_LEN];
+                    System.arraycopy(src, COPY_IDX, dst, 0, COPY_LEN);
+                    """,
+                    templates.store.asToken(),
+                    templates.trap.asToken(),
+                    """
+                    return dst[RETURN_IDX];
+                }
+                """
+            ));
+
+            var testMethodIdx = Template.make("testName", "tmp", (String TestName, TestTemplates templates) -> scope(
+                let("type", pty),
+                """
+                static #type test#{testName}(#type[] src, int idx, boolean flag) {
+                    """,
+                    templates.prelude.asToken(),
+                    """
+                    #type[] dst = new #type[COPY_LEN];
+                    System.arraycopy(src, idx, dst, 0, COPY_LEN);
+                    """,
+                    templates.store.asToken(),
+                    templates.trap.asToken(),
+                    """
+                    return dst[RETURN_IDX];
+                }
+                """
+            ));
+
+            var testMethodClone = Template.make("testName", "tmp", (String testName, TestTemplates templates) -> scope(
+                let("type", pty),
+                """
+                static #type test#{testName}(#type[] realSrc, #type[] alias, boolean flag) {
+                    """,
+                    templates.prelude.asToken(),
+                    """
+                    // Set up a src array with statically known length, so scalar replacement works.
+                    #type[] src = new #type[COPY_LEN];
+                    System.arraycopy(realSrc, COPY_IDX, src, 0, COPY_LEN);
+
+                    // Clone the src array into a dst array to get the clonebasic variant of the ArraycopyNode.
+                    #type[] dst = src.clone();
+                    """,
+                    templates.store.asToken(),
+                    templates.trap.asToken(),
+                    """
+                    return dst[RETURN_IDX];
+                }
+                """
+            ));
+
+            // For methods with a constant offset into src, validate that only the necessary rematerialization nodes are
+            // in the common path.
+            var testCaseConst = Template.make("testName", "loadCount", "tmp", (String testName, Integer loadCount, TestTemplates templates) -> scope(
+                let("typeAbbrev", pty.abbrev().equals("C") ? "US" : pty.abbrev()),
+                runTestConst.asToken(testName),
+                """
+                @Test
+                @IR(counts = { IRNode.LOAD_#{typeAbbrev}, "=#{loadCount}" },
+                    applyIf = { "TieredCompilation", "true"})
+                """,
+                testMethodConst.asToken(testName, templates)
+            ));
+
+            var testCaseConstPlusOne = Template.make("testName", "loadCount", "tmp", (String testName, Integer loadCount, TestTemplates templates) -> scope(
+                let("typeAbbrev", pty.abbrev().equals("C") ? "US" : pty.abbrev()),
+                runTestConst.asToken(testName),
+                let("countPlusOne", loadCount + 1),
+                """
+                @Test
+                @IR(counts = { IRNode.LOAD_#{typeAbbrev}, ">=#{loadCount}",
+                               IRNode.LOAD_#{typeAbbrev}, "<=#{countPlusOne}" },
+                    applyIf = { "TieredCompilation", "true"})
+                """,
+                testMethodConst.asToken(testName, templates)
+            ));
+
+            // Some test cases can not be reliably verified due to varying numbers of loads generated from run to run.
+            var testCaseConstNoVerify = Template.make("testName", "tmp", (String testName, TestTemplates templates) -> scope(
+                runTestConst.asToken(testName),
+                """
+                @Test
+                """,
+                testMethodConst.asToken(testName, templates)
+            ));
+
+            // For methods with a parametrized offset into src, only validate the correctness of the return value.
+            var testCaseIdx = Template.make("testName", "tmp", (String testName, TestTemplates templates) -> scope(
+                runTestIdx.asToken(testName),
+                """
+                @Test
+                """,
+                testMethodIdx.asToken(testName, templates)
+            ));
+
+            // Generates tests with the clonebasic variant of the ArraycopyNode.
+            var testCaseClone = Template.make("testName", "loadCount", "tmp", (String testName, Integer loadCount, TestTemplates templates) -> scope(
+                let("typeAbbrev", pty.abbrev().equals("C") ? "US" : pty.abbrev()),
+                runTestConst.asToken(testName),
+                """
+                @Test
+                @IR(counts = { IRNode.LOAD_#{typeAbbrev}, "=#{loadCount}" },
+                    applyIf = { "TieredCompilation", "true"})
+                """,
+                testMethodClone.asToken(testName, templates)
+            ));
+
+            var storeConst = Template.make(() -> scope(
+                let("typeAbbrev", pty.abbrev()),
+                """
+                    src[WRITE_IDX] = WRITE_VAL_#{typeAbbrev};
+                """
+            ));
+
+            var storeIdx = Template.make(() -> scope(
+                let("typeAbbrev", pty.abbrev()),
+                """
+                    src[idx + RETURN_IDX] = WRITE_VAL_#{typeAbbrev};
+                """
+            ));
+
+            var storeClone = Template.make(() -> scope(
+                let("typeAbbrev", pty.abbrev()),
+                """
+                    src[RETURN_IDX] = WRITE_VAL_#{typeAbbrev};
+                """
+            ));
+
+            var storeAlias = Template.make(() -> scope(
+                let("typeAbbrev", pty.abbrev()),
+                """
+                    alias[WRITE_IDX] = WRITE_VAL_#{typeAbbrev};
+                """
+            ));
+
+            var unstableTrap = Template.make(() -> scope(
+                let("typeAbbrev", pty.abbrev()),
+                """
+                if (flag) {
+                    src[0] = WRITE_VAL_#{typeAbbrev};
+                }
+                """
+            ));
+
+            // This generates test with a store to the returned src element and a simple unstable if trap.
+            // Only one rematerialization load is in the common path.
+            var testStore = Template.make(() -> {
+                final String testName = "Store" + pty.abbrev();
+                return scope(
+                    testCaseConst.asToken("Const" + testName, 2 * config.copyLen - 1, new TestTemplates(storeConst, unstableTrap)),
+                    testCaseIdx.asToken("Idx" + testName, new TestTemplates(storeIdx, unstableTrap)),
+                    testCaseClone.asToken("Clone" + testName, config.copyLen, new TestTemplates(storeClone, unstableTrap)),
+                    testCaseConst.asToken("Alias" + testName, 3 * config.copyLen - 2, new TestTemplates(storeAlias, unstableTrap))
+                );
+            });
+
+            // This generates tests with multiple interfering stores forcing elements to be put into the common path.
+            var testMultiStore = Template.make(() -> {
+                final String testName = "MultiStore" + pty.abbrev();
+                final int numStores = RANDOM.nextInt(1, config.copyLen - 1);
+                // Get numStores different store locations.
+                final Set<Integer> storeIdxs = new HashSet<>();
+                storeIdxs.add(config.returnIdx); // Always store at the WRITE_IDX to potentially trigger the bug.
+                while (storeIdxs.size() < numStores) {
+                    storeIdxs.add(RANDOM.nextInt(0, config.copyLen));
+                }
+                var multiStoresConst = Template.make(() -> scope(
+                    let("typeAbbrev", pty.abbrev()),
+                    storeIdxs.stream()
+                             .map(idx -> scope(let("idx", idx), "src[COPY_IDX + #idx] = WRITE_VAL_#{typeAbbrev};\n"))
+                             .toList()
+                ));
+                var multiStoresIdx = Template.make(() -> scope(
+                    let("typeAbbrev", pty.abbrev()),
+                    storeIdxs.stream()
+                             .map(idx -> scope(let("idx", idx), "src[idx + #idx] = WRITE_VAL_#{typeAbbrev};\n"))
+                             .toList()
+                ));
+                var multiStoresClone = Template.make(() -> scope(
+                    let("typeAbbrev", pty.abbrev()),
+                    storeIdxs.stream()
+                             .map(idx -> scope(let("idx",  idx), "src[#idx] = WRITE_VAL_#{typeAbbrev};\n"))
+                             .toList()
+                ));
+                var multiStoresAlias = Template.make(() -> scope(
+                    let("typeAbbrev", pty.abbrev()),
+                    storeIdxs.stream()
+                             .map(idx -> scope(let("idx", idx), "alias[COPY_IDX + #idx] = WRITE_VAL_#{typeAbbrev};\n"))
+                             .toList()
+                ));
+                return scope(
+                    // Sometimes we get one more load depending on the position of the range checks of the different stores.
+                    testCaseConstPlusOne.asToken("Const" + testName, 2 * config.copyLen - numStores, new TestTemplates(multiStoresConst, unstableTrap)),
+                    testCaseIdx.asToken("Idx" + testName, new TestTemplates(multiStoresIdx, unstableTrap)),
+                    testCaseClone.asToken("Clone" + testName, config.copyLen, new TestTemplates(multiStoresClone, unstableTrap)),
+                    testCaseConstPlusOne.asToken("Alias" + testName, 3 * config.copyLen - 2 * numStores, new TestTemplates(multiStoresAlias, unstableTrap))
+                );
+            });
+
+            // This generates test with a store to the returned src element and the unstable if trap inside a loop.
+            // Only one rematerialization load is in the common path.
+            var testStoreTrapLoop = Template.make(() -> {
+                final String testName = "StoreTrapLoop" + pty.abbrev();
+                var trapTemplate = Template.make(() -> scope(
+                    """
+                    for (int i = 0; i < 1234; i++) {
+                    """,
+                        unstableTrap.asToken(),
+                    """
+                    }
+                    """
+                ));
+                return scope(
+                    testCaseConst.asToken("Const" + testName, 2 * config.copyLen - 1, new TestTemplates(storeConst, trapTemplate)),
+                    testCaseIdx.asToken("Idx" + testName, new TestTemplates(storeIdx, trapTemplate)),
+                    testCaseConst.asToken("Alias" + testName, 2 * config.copyLen - 1, new TestTemplates(storeAlias, trapTemplate))
+                );
+            });
+
+            // This generates tests with atomic operations (LoadStores) as polluting store.
+            // Only one rematerialization load is in the common path.
+            var testAtomics = Template.make(() -> {
+                var getAndSetStoreConst = Template.make(() -> scope(
+                    let("type", pty),
+                    let("typeAbbrev", pty.abbrev()),
+                    let("handle", handle),
+                    """
+                    #{handle}.getAndSet(src, WRITE_IDX, (#type) WRITE_VAL_#{typeAbbrev});
+                    """
+                ));
+                var getAndSetStoreIdx = Template.make(() -> scope(
+                    let("type", pty),
+                    let("typeAbbrev", pty.abbrev()),
+                    let("handle", handle),
+                    """
+                    #{handle}.getAndSet(src, idx + RETURN_IDX, (#type) WRITE_VAL_#{typeAbbrev});
+                    """
+                ));
+                var casStoreConst = Template.make(() -> scope(
+                    let("type", pty),
+                    let("typeAbbrev", pty.abbrev()),
+                    let("handle", handle),
+                    """
+                    #{handle}.compareAndSet(src, WRITE_IDX, (#type) SRC_VAL_#{typeAbbrev}, (#type) WRITE_VAL_#{typeAbbrev});
+                    """
+                ));
+                var casStoreIdx = Template.make(() -> scope(
+                    let("type", pty),
+                    let("typeAbbrev", pty.abbrev()),
+                    let("handle", handle),
+                    """
+                    #{handle}.compareAndSet(src, idx + RETURN_IDX, (#type) SRC_VAL_#{typeAbbrev}, (#type) WRITE_VAL_#{typeAbbrev});
+                    """
+                ));
+                return scope(let("type", pty),
+                    let("handle", handle),
+                    Hooks.CLASS_HOOK.insert(scope(
+                        """
+                        private static final VarHandle #handle = MethodHandles.arrayElementVarHandle(#type[].class);
+                        """
+                    )),
+                    // We cannot look through MemBars emitted by the atomic operations, so all rematerialization loads are
+                    // commoned up in the common path.
+                    pty.abbrev().equals("S") || pty.abbrev().equals("B") || pty.abbrev().equals("C") ?
+                        testCaseConstNoVerify.asToken("ConstGetAndSet" + pty.abbrev(), new TestTemplates(getAndSetStoreConst, unstableTrap)) :
+                        testCaseConst.asToken("ConstGetAndSet" + pty.abbrev(), config.copyLen, new TestTemplates(getAndSetStoreConst, unstableTrap)),
+                    testCaseIdx.asToken("IdxGetAndSet" + pty.abbrev(), new TestTemplates(getAndSetStoreIdx, unstableTrap)),
+                    testCaseConst.asToken("ConstCompareAndSet" + pty.abbrev(), config.copyLen, new TestTemplates(casStoreConst, unstableTrap)),
+                    testCaseIdx.asToken("IdxCompareAndSet" + pty.abbrev(), new TestTemplates(casStoreIdx, unstableTrap))
+                );
+            });
+
+            var testMemorySegments = Template.make(() -> {
+                final String layout = String.format("JAVA_%s", pty.toString().toUpperCase());
+                var memorySegmentCreation = Template.make(() -> scope(
+                    """
+                    MemorySegment srcMS = MemorySegment.ofArray(src);
+                    """
+                ));
+                var memorySegmentCreationAlias = Template.make(() -> scope(
+                    """
+                    MemorySegment srcMS = MemorySegment.ofArray(alias);
+                    """
+                ));
+                // Just write using a memory segment
+                var memorySegmentStoreConst = Template.make(() -> scope(
+                    let("typeAbbrev", pty.abbrev()),
+                    let("layout", layout),
+                    """
+                    srcMS.setAtIndex(ValueLayout.#{layout}, WRITE_IDX, WRITE_VAL_#{typeAbbrev});
+                    """
+                ));
+                var memorySegmentStoreIdx = Template.make(() -> scope(
+                    let("typeAbbrev", pty.abbrev()),
+                    let("layout", layout),
+                    """
+                    srcMS.setAtIndex(ValueLayout.#{layout}, RETURN_IDX + idx, WRITE_VAL_#{typeAbbrev});
+                    """
+                ));
+                // Write a single byte somewhere within the returned value.
+                var memorySegmentStoreSmallConst = Template.make(() -> scope(
+                    let("offset", RANDOM.nextInt(pty.byteSize())),
+                    let("byteSize", pty.byteSize()),
+                    """
+                    srcMS.set(ValueLayout.JAVA_BYTE, WRITE_IDX * #byteSize - #offset, (byte)-1);
+                    """
+                ));
+                var memorySegmentStoreSmallIdx = Template.make(() -> scope(
+                    let("offset", RANDOM.nextInt(pty.byteSize())),
+                    let("byteSize", pty.byteSize()),
+                    """
+                    srcMS.set(ValueLayout.JAVA_BYTE, (RETURN_IDX + idx) * #byteSize - #offset, (byte)-1);
+                    """
+                ));
+                // Write 8 bytes overlapping multiple array elements.
+                int offsetMut = RANDOM.nextInt(pty.byteSize());
+                if (config.writeIdx * pty.byteSize() - offsetMut + 8 >= config.srcSize * pty.byteSize()) {
+                    // This will not fit. Adjust offset.
+                    offsetMut = (config.writeIdx * pty.byteSize() + 8) - (config.srcSize * pty.byteSize());
+                }
+                final int offset = offsetMut;
+                var memorySegmentStoreOverlappingConst = Template.make(() -> scope(
+                    let("offset", offset),
+                    let("byteSize", pty.byteSize()),
+                    """
+                    srcMS.set(ValueLayout.JAVA_LONG_UNALIGNED, WRITE_IDX * #byteSize - #offset, -1);
+                    """
+                ));
+                var memorySegmentStoreOverlappingIdx = Template.make(() -> scope(
+                    let("offset", offset),
+                    let("byteSize", pty.byteSize()),
+                    """
+                    srcMS.set(ValueLayout.JAVA_LONG_UNALIGNED, (RETURN_IDX + idx) * #byteSize - #offset, -1);
+                    """
+                ));
+                return scope(
+                    let("type", pty),
+                    // The number of loads differs run to run (probably due to the amount of inlining going on), so
+                    // we do not verify the number of loads in the uncommon path, even though only the polluted loads
+                    // end up in the common path for all const cases.
+                    testCaseConstNoVerify.asToken("MemorySegmentStoreConst" + pty.abbrev(), new TestTemplates(memorySegmentStoreConst, unstableTrap, memorySegmentCreation)),
+                    testCaseIdx.asToken("MemorySegmentStoreIdx" + pty.abbrev(), new TestTemplates(memorySegmentStoreIdx, unstableTrap, memorySegmentCreation)),
+                    testCaseConstNoVerify.asToken("MemorySegmentStoreAlias" + pty.abbrev(), new TestTemplates(memorySegmentStoreConst, unstableTrap, memorySegmentCreationAlias)),
+                    testCaseConstNoVerify.asToken("MemorySegmentStoreSmallConst" + pty.abbrev(), new TestTemplates(memorySegmentStoreSmallConst, unstableTrap, memorySegmentCreation)),
+                    testCaseIdx.asToken("MemorySegmentStoreSmallIdx" + pty.abbrev(), new TestTemplates(memorySegmentStoreSmallIdx, unstableTrap, memorySegmentCreation)),
+                    testCaseConstNoVerify.asToken("MemorySegmentStoreSmallAlias" + pty.abbrev(), new TestTemplates(memorySegmentStoreSmallConst, unstableTrap, memorySegmentCreationAlias)),
+                    testCaseConstNoVerify.asToken("MemorySegmentStoreOverlappingConst" + pty.abbrev(), new TestTemplates(memorySegmentStoreOverlappingConst, unstableTrap, memorySegmentCreation)),
+                    testCaseIdx.asToken("MemorySegmentStoreOverlappingIdx" + pty.abbrev(), new TestTemplates(memorySegmentStoreOverlappingIdx, unstableTrap, memorySegmentCreation)),
+                    testCaseConstNoVerify.asToken("MemorySegmentStoreOverlappingAlias" + pty.abbrev(), new TestTemplates(memorySegmentStoreOverlappingConst, unstableTrap, memorySegmentCreationAlias))
+                );
+            });
+
+            // C2 is not able to put any rematerialization load in the uncommon path for this test.
+            // Thus, we do not check the number of loads.
+            var testSwitch = Template.make(() -> {
+                final String testName = "Switch" + pty.abbrev();
+                return scope(
+                    let("type", pty),
+                    let("typeAbbrev", pty.abbrev()),
+                    let("testName", testName),
+                    let("src", srcArray),
+                    """
+                    @Run(test = "test#testName")
+                    @Warmup(10000)
+                    static void run#testName(RunInfo info) {
+                        Arrays.fill(#src, SRC_VAL_#{typeAbbrev});
+                        #type res = test#testName(#src);
+                        Asserts.assertEQ((#type) SRC_VAL_#{typeAbbrev}, res, "Wrong Result from " + info.getTest().getName());
+                    }
+
+                    @Test
+                    static #type test#testName(#type[] src) {
+                        #type[] dst = new #type[COPY_LEN];
+                        System.arraycopy(src, COPY_IDX, dst, 0, COPY_LEN);
+
+                        for (int i = 0; i < 4; i++) {
+                            for (int j = 0; j < 8; j++) {
+                                switch (i) {
+                                    case -1 -> { /*nop*/ }
+                                    case 0 -> src[WRITE_IDX] = WRITE_VAL_#{typeAbbrev};
+                                }
+                            }
+                        }
+
+                        return dst[1];
+                    }
+                    """
+                );
+            });
+
+            // This generates tests where the polluting store to src is an arraycopy.
+            // In this case, the rematerialization loads for all elements that are written to
+            // have to be in the common path.
+            var testArraycopy = Template.make(() -> {
+                final String testName = "Arraycopy" + pty.abbrev();
+                final int arraycopyLen = RANDOM.nextInt(1, Math.min(config.copyLen, config.srcSize - config.writeIdx));
+                final int otherLen = RANDOM.nextInt(arraycopyLen + 1, arraycopyLen + 10);
+                final int copyOtherIdx = RANDOM.nextInt(0, otherLen - arraycopyLen);
+                var arraycopyStoreConst = Template.make(() -> scope(
+                    let("type", pty),
+                    let("typeAbbrev", pty.abbrev()),
+                    let("arraycopyLen", arraycopyLen),
+                    let("other", "other" + pty.abbrev()),
+                    let("otherLen", otherLen),
+                    let("copyOtherIdx", copyOtherIdx),
+                    Hooks.CLASS_HOOK.insert(scope(
+                        """
+                        private static final #type[] #other = new #type[#otherLen];
+                        static { Arrays.fill(#other, WRITE_VAL_#{typeAbbrev}); }
+                        """
+                    )),
+                    """
+                        System.arraycopy(#other, #copyOtherIdx, src, WRITE_IDX, #arraycopyLen);
+                    """
+                ));
+                var arraycopyStoreIdx = Template.make(() -> scope(
+                    let("type", pty),
+                    let("arraycopyLen", arraycopyLen),
+                    let("other", "other" + pty.abbrev()),
+                    let("copyOtherIdx", copyOtherIdx),
+                    """
+                        System.arraycopy(#other, #copyOtherIdx, src, idx + RETURN_IDX, #arraycopyLen);
+                    """
+                ));
+                var arraycopyStoreAlias = Template.make(() -> scope(
+                    let("type", pty),
+                    let("arraycopyLen", arraycopyLen),
+                    let("other", "other" + pty.abbrev()),
+                    let("copyOtherIdx", copyOtherIdx),
+                    """
+                        System.arraycopy(#other, #copyOtherIdx, alias, WRITE_IDX, #arraycopyLen);
+                    """
+                ));
+                // Unfortunately, it is not possible to validate the placement of rematerialization nodes because
+                // the number of uncomon traps is sensitive to changes in the profile, which leads to a bimodal count
+                // of load nodes.
+                return scope(
+                    testCaseConstNoVerify.asToken("Const" + testName, new TestTemplates(arraycopyStoreConst, unstableTrap)),
+                    testCaseIdx.asToken("Idx" + testName, new TestTemplates(arraycopyStoreIdx, unstableTrap)),
+                    testCaseConstNoVerify.asToken("Alias" + testName, new TestTemplates(arraycopyStoreAlias, unstableTrap))
+                );
+            });
+
+            return Template.make(() -> scope(
+                let("type", pty),
+                let("typeAbbrev", pty.abbrev()),
+                let("writeVal", pty.con()),
+                let("rng", pty.callLibraryRNG()),
+                let("src", srcArray),
+                Hooks.CLASS_HOOK.insert(scope(
+                    """
+                    private static final #type SRC_VAL_#{typeAbbrev};
+                    private static final #type WRITE_VAL_#{typeAbbrev} = #writeVal;
+                    private static final #type[] #src = new #type[SRC_SIZE];
+
+                    static {
+                        #type srcVal;
+                        do {
+                            srcVal = #rng;
+                        } while (srcVal == WRITE_VAL_#{typeAbbrev});
+                        SRC_VAL_#{typeAbbrev} = srcVal;
+                    }
+                    """
+                )),
+                List.of(testStore,
+                        testMultiStore,
+                        testStoreTrapLoop,
+                        testAtomics,
+                        testMemorySegments,
+                        testSwitch,
+                        testArraycopy)
+                    .stream()
+                    .map(t -> t.asToken())
+                    .collect(Collectors.toList())
+            )).asToken();
+        }
+    }
+}

From 0b803bd34e7c6da9e5fcf2d544312d0412838820 Mon Sep 17 00:00:00 2001
From: Casper Norrbin <cnorrbin@openjdk.org>
Date: Tue, 7 Apr 2026 08:09:00 +0000
Subject: [PATCH 503/655] 8380103: Perfdata shared memory file flock failures

Reviewed-by: dholmes, aartemov
---
 src/hotspot/os/posix/perfMemory_posix.cpp     | 110 +++++++++++++-----
 .../jtreg/containers/docker/ShareTmpDir.java  |  10 +-
 2 files changed, 91 insertions(+), 29 deletions(-)

diff --git a/src/hotspot/os/posix/perfMemory_posix.cpp b/src/hotspot/os/posix/perfMemory_posix.cpp
index b8be77c5e05..c5046797e02 100644
--- a/src/hotspot/os/posix/perfMemory_posix.cpp
+++ b/src/hotspot/os/posix/perfMemory_posix.cpp
@@ -701,6 +701,39 @@ static void remove_file(const char* path) {
   }
 }
 
+// Files newer than this threshold are considered to belong to a JVM that may
+// still be starting up and are therefore not candidates for stale-file
+// cleanup. This avoids racing a concurrent JVM startup while scanning the
+// hsperfdata directory.
+static const time_t cleanup_grace_period_seconds = 5;
+
+static bool is_cleanup_candidate(const char* filename, const char* dirname) {
+  struct stat statbuf;
+  int result;
+
+  RESTARTABLE(::lstat(filename, &statbuf), result);
+  if (result == OS_ERR) {
+    log_debug(perf, memops)("lstat failed for %s/%s: %s", dirname, filename, os::strerror(errno));
+    return false;
+  }
+
+  if (!S_ISREG(statbuf.st_mode)) {
+    return false;
+  }
+
+  const time_t now = time(nullptr);
+  if (now == (time_t)-1) {
+    return false;
+  }
+
+  if (statbuf.st_mtime >= now - cleanup_grace_period_seconds) {
+    log_debug(perf, memops)("Skip cleanup of fresh file %s/%s", dirname, filename);
+    return false;
+  }
+
+  return true;
+}
+
 // cleanup stale shared memory files
 //
 // This method attempts to remove all stale shared memory files in
@@ -744,6 +777,11 @@ static void cleanup_sharedmem_files(const char* dirname) {
       continue;
     }
 
+    if (!is_cleanup_candidate(filename, dirname)) {
+      errno = 0;
+      continue;
+    }
+
 #if defined(LINUX)
     // Special case on Linux, if multiple containers share the
     // same /tmp directory:
@@ -872,16 +910,56 @@ static int create_sharedmem_file(const char* dirname, const char* filename, size
     return -1;
   }
 
-  // Open the filename in the current directory.
-  // Cannot use O_TRUNC here; truncation of an existing file has to happen
-  // after the is_file_secure() check below.
-  int fd;
-  RESTARTABLE(os::open(filename, O_RDWR|O_CREAT|O_NOFOLLOW, S_IRUSR|S_IWUSR), fd);
+  int fd = OS_ERR;
+  static const int create_sharedmem_file_retry_count = LINUX_ONLY(3) NOT_LINUX(1);
+  for (int attempt = 0; attempt < create_sharedmem_file_retry_count; attempt++) {
+    // Open the filename in the current directory.
+    // Use O_EXCL so that startup never reuses an existing pid file unless it
+    // has first been proven stale and removed in `cleanup_sharedmem_files`.
+    RESTARTABLE(os::open(filename, O_RDWR|O_CREAT|O_EXCL|O_NOFOLLOW, S_IRUSR|S_IWUSR), fd);
+    if (fd == OS_ERR) {
+      break;
+    }
+
+#if defined(LINUX)
+    // On Linux, different containerized processes that share the same /tmp
+    // directory (e.g., with "docker --volume ...") may have the same pid and
+    // try to use the same file. To avoid conflicts among such processes, we
+    // allow only one of them (the winner of the flock() call) to write to the
+    // file. If we lose the race, assume we may have collided with a concurrent
+    // scavenger briefly holding the lock on a fresh file and retry a few times
+    // before giving up.
+    int n;
+    RESTARTABLE(::flock(fd, LOCK_EX|LOCK_NB), n);
+    if (n == 0) {
+      break;
+    }
+
+    const int flock_errno = errno;
+    ::close(fd);
+    fd = OS_ERR;
+
+    if (attempt + 1 == create_sharedmem_file_retry_count || flock_errno != EWOULDBLOCK) {
+      log_warning(perf, memops)("Cannot use file %s/%s because %s (errno = %d)", dirname, filename,
+                                (flock_errno == EWOULDBLOCK) ?
+                                "it is locked by another process" :
+                                "flock() failed", flock_errno);
+      errno = flock_errno;
+      break;
+    }
+
+    // Short sleep to allow the lock to free up.
+    os::naked_short_sleep(1);
+#endif
+  }
+
   if (fd == OS_ERR) {
     if (log_is_enabled(Debug, perf)) {
       LogStreamHandle(Debug, perf) log;
       if (errno == ELOOP) {
         log.print_cr("file %s is a symlink and is not secure", filename);
+      } else if (errno == EEXIST) {
+        log.print_cr("could not create file %s: existing file is not provably stale", filename);
       } else {
         log.print_cr("could not create file %s: %s", filename, os::strerror(errno));
       }
@@ -901,27 +979,7 @@ static int create_sharedmem_file(const char* dirname, const char* filename, size
   }
 
 #if defined(LINUX)
-  // On Linux, different containerized processes that share the same /tmp
-  // directory (e.g., with "docker --volume ...") may have the same pid and
-  // try to use the same file. To avoid conflicts among such
-  // processes, we allow only one of them (the winner of the flock() call)
-  // to write to the file. All the other processes will give up and will
-  // have perfdata disabled.
-  //
-  // Note that the flock will be automatically given up when the winner
-  // process exits.
-  //
-  // The locking protocol works only with other JVMs that have the JDK-8286030
-  // fix. If you are sharing the /tmp difrectory among different containers,
-  // do not use older JVMs that don't have this fix, or the behavior is undefined.
-  int n;
-  RESTARTABLE(::flock(fd, LOCK_EX|LOCK_NB), n);
-  if (n != 0) {
-    log_warning(perf, memops)("Cannot use file %s/%s because %s (errno = %d)", dirname, filename,
-                              (errno == EWOULDBLOCK) ?
-                              "it is locked by another process" :
-                              "flock() failed", errno);
-    ::close(fd);
+  if (fd == OS_ERR) {
     return -1;
   }
 #endif
diff --git a/test/hotspot/jtreg/containers/docker/ShareTmpDir.java b/test/hotspot/jtreg/containers/docker/ShareTmpDir.java
index 986cd044737..4240ba408b7 100644
--- a/test/hotspot/jtreg/containers/docker/ShareTmpDir.java
+++ b/test/hotspot/jtreg/containers/docker/ShareTmpDir.java
@@ -76,7 +76,7 @@ public class ShareTmpDir {
         Object lock = new Object();
         opts.addDockerOpts("--volume", Utils.TEST_CLASSES + ":/test-classes/");
         opts.addDockerOpts("--volume", sharedtmpdir.getAbsolutePath() + ":/tmp/");
-        opts.addJavaOpts("-Xlog:os+container=trace", "-Xlog:perf+memops=debug", "-cp", "/test-classes/");
+        opts.addJavaOpts("-Xlog:os+container=trace", "-Xlog:perf*=debug", "-cp", "/test-classes/");
 
         Thread t1 = new Thread() {
                 public void run() {
@@ -115,12 +115,13 @@ public class ShareTmpDir {
         t1.join();
         t2.join();
 
-        Pattern pattern = Pattern.compile("perf,memops.*Trying to open (/tmp/hsperfdata_[a-z0-9]*/[0-9]*)");
+        Pattern pattern = Pattern.compile("perf,memops.*Trying to open (/tmp/hsperfdata_[a-z0-9]*/(\\d+))");
         Matcher matcher;
 
         matcher = pattern.matcher(out1.getStdout());
         Asserts.assertTrue(matcher.find());
         String file1 =  matcher.group(1);
+        String pid1  = matcher.group(2);
 
         matcher = pattern.matcher(out2.getStdout());
         Asserts.assertTrue(matcher.find());
@@ -134,8 +135,11 @@ public class ShareTmpDir {
             // have pid==1.
             // One of the two containers must fail to create the hsperf file.
             String s = "Cannot use file " + file1 + " because it is locked by another process";
+            String s2 = "could not create file " + pid1 + ": existing file is not provably stale";
             Asserts.assertTrue(out1.getStdout().contains(s) ||
-                               out2.getStdout().contains(s));
+                               out2.getStdout().contains(s) ||
+                               out1.getStdout().contains(s2) ||
+                               out2.getStdout().contains(s2));
         } else {
             throw new SkippedException("Java in the two containers don't have the same pid: " + file1 + " vs " + file2);
         }

From 9cf2b686bd42f0e185a59b0cf89ceb5717cdc910 Mon Sep 17 00:00:00 2001
From: Evgeny Astigeevich <eastigeevich@openjdk.org>
Date: Tue, 7 Apr 2026 10:35:31 +0000
Subject: [PATCH 504/655] 8381003: [REDO] Mitigate Neoverse-N1 erratum 1542419
 negative impact on GCs and JIT performance

Reviewed-by: aph
---
 .../gc/z/zBarrierSetAssembler_aarch64.cpp     |   4 +-
 src/hotspot/cpu/aarch64/globals_aarch64.hpp   |   4 +
 src/hotspot/cpu/aarch64/relocInfo_aarch64.cpp |   7 +-
 .../cpu/aarch64/vm_version_aarch64.cpp        |  59 +++
 .../cpu/aarch64/vm_version_aarch64.hpp        |  10 +
 .../ic_ivau_probe_linux_aarch64.S             |  69 +++
 .../linux_aarch64/icache_linux_aarch64.cpp    |  28 ++
 .../linux_aarch64/icache_linux_aarch64.hpp    | 104 ++++-
 .../os_cpu/linux_aarch64/os_linux_aarch64.cpp |  11 +
 .../vm_version_linux_aarch64.cpp              |  10 +
 src/hotspot/share/code/codeBlob.cpp           |   5 +
 src/hotspot/share/code/nmethod.cpp            |  32 +-
 src/hotspot/share/code/nmethod.hpp            |   7 +-
 src/hotspot/share/code/relocInfo.cpp          |   9 -
 src/hotspot/share/code/relocInfo.hpp          |   2 -
 src/hotspot/share/gc/z/zBarrierSetNMethod.cpp |  14 +-
 src/hotspot/share/gc/z/zGeneration.cpp        |  14 +-
 src/hotspot/share/gc/z/zMark.cpp              |  31 +-
 src/hotspot/share/gc/z/zNMethod.cpp           |  16 +-
 src/hotspot/share/gc/z/zNMethod.hpp           |   2 +
 src/hotspot/share/runtime/icache.hpp          |  23 +
 ...tDeferredICacheInvalidationCmdOptions.java | 434 ++++++++++++++++++
 .../gc/TestDeferredICacheInvalidation.java    | 316 +++++++++++++
 .../bench/vm/gc/GCPatchingNmethodCost.java    | 206 +++++++++
 24 files changed, 1371 insertions(+), 46 deletions(-)
 create mode 100644 src/hotspot/os_cpu/linux_aarch64/ic_ivau_probe_linux_aarch64.S
 create mode 100644 src/hotspot/os_cpu/linux_aarch64/icache_linux_aarch64.cpp
 create mode 100644 test/hotspot/jtreg/compiler/runtime/TestDeferredICacheInvalidationCmdOptions.java
 create mode 100644 test/hotspot/jtreg/gc/TestDeferredICacheInvalidation.java
 create mode 100644 test/micro/org/openjdk/bench/vm/gc/GCPatchingNmethodCost.java

diff --git a/src/hotspot/cpu/aarch64/gc/z/zBarrierSetAssembler_aarch64.cpp b/src/hotspot/cpu/aarch64/gc/z/zBarrierSetAssembler_aarch64.cpp
index 4f0977a414f..f0885fee93d 100644
--- a/src/hotspot/cpu/aarch64/gc/z/zBarrierSetAssembler_aarch64.cpp
+++ b/src/hotspot/cpu/aarch64/gc/z/zBarrierSetAssembler_aarch64.cpp
@@ -879,7 +879,9 @@ void ZBarrierSetAssembler::patch_barrier_relocation(address addr, int format) {
     ShouldNotReachHere();
   }
 
-  ICache::invalidate_word((address)patch_addr);
+  if (!UseSingleICacheInvalidation) {
+    ICache::invalidate_word((address)patch_addr);
+  }
 }
 
 #ifdef COMPILER1
diff --git a/src/hotspot/cpu/aarch64/globals_aarch64.hpp b/src/hotspot/cpu/aarch64/globals_aarch64.hpp
index 0ca5cb25e0c..dfeba73bede 100644
--- a/src/hotspot/cpu/aarch64/globals_aarch64.hpp
+++ b/src/hotspot/cpu/aarch64/globals_aarch64.hpp
@@ -131,6 +131,10 @@ define_pd_global(intx, InlineSmallCode,          1000);
           "Branch Protection to use: none, standard, pac-ret")          \
   product(bool, AlwaysMergeDMB, true, DIAGNOSTIC,                       \
           "Always merge DMB instructions in code emission")             \
+  product(bool, NeoverseN1ICacheErratumMitigation, false, DIAGNOSTIC,   \
+          "Enable workaround for Neoverse N1 erratum 1542419")          \
+  product(bool, UseSingleICacheInvalidation, false, DIAGNOSTIC,         \
+          "Defer multiple ICache invalidation to single invalidation")  \
 
 // end of ARCH_FLAGS
 
diff --git a/src/hotspot/cpu/aarch64/relocInfo_aarch64.cpp b/src/hotspot/cpu/aarch64/relocInfo_aarch64.cpp
index dbec2d76d4f..f1b9fb213a2 100644
--- a/src/hotspot/cpu/aarch64/relocInfo_aarch64.cpp
+++ b/src/hotspot/cpu/aarch64/relocInfo_aarch64.cpp
@@ -54,7 +54,12 @@ void Relocation::pd_set_data_value(address x, bool verify_only) {
     bytes = MacroAssembler::pd_patch_instruction_size(addr(), x);
     break;
   }
-  ICache::invalidate_range(addr(), bytes);
+
+  if (UseSingleICacheInvalidation) {
+    assert(_binding != nullptr, "expect to be called with RelocIterator in use");
+  } else {
+    ICache::invalidate_range(addr(), bytes);
+  }
 }
 
 address Relocation::pd_call_destination(address orig_addr) {
diff --git a/src/hotspot/cpu/aarch64/vm_version_aarch64.cpp b/src/hotspot/cpu/aarch64/vm_version_aarch64.cpp
index b39d1618b3d..15af2d5c4e2 100644
--- a/src/hotspot/cpu/aarch64/vm_version_aarch64.cpp
+++ b/src/hotspot/cpu/aarch64/vm_version_aarch64.cpp
@@ -24,6 +24,7 @@
  *
  */
 
+#include "logging/log.hpp"
 #include "pauth_aarch64.hpp"
 #include "register_aarch64.hpp"
 #include "runtime/arguments.hpp"
@@ -52,6 +53,10 @@ uintptr_t VM_Version::_pac_mask;
 
 SpinWait VM_Version::_spin_wait;
 
+bool VM_Version::_cache_dic_enabled;
+bool VM_Version::_cache_idc_enabled;
+bool VM_Version::_ic_ivau_trapped;
+
 const char* VM_Version::_features_names[MAX_CPU_FEATURES] = { nullptr };
 
 static SpinWait get_spin_wait_desc() {
@@ -85,6 +90,19 @@ static SpinWait get_spin_wait_desc() {
   return spin_wait;
 }
 
+static bool has_neoverse_n1_errata_1542419() {
+  const int major_rev_num = VM_Version::cpu_variant();
+  const int minor_rev_num = VM_Version::cpu_revision();
+  // Neoverse N1: 0xd0c
+  // Erratum 1542419 affects r3p0, r3p1 and r4p0.
+  // It is fixed in r4p1 and later revisions, which are not affected.
+  return (VM_Version::cpu_family() == VM_Version::CPU_ARM &&
+          VM_Version::model_is(0xd0c) &&
+          ((major_rev_num == 3 && minor_rev_num == 0) ||
+           (major_rev_num == 3 && minor_rev_num == 1) ||
+           (major_rev_num == 4 && minor_rev_num == 0)));
+}
+
 void VM_Version::initialize() {
 #define SET_CPU_FEATURE_NAME(id, name, bit) \
   _features_names[bit] = XSTR(name);
@@ -96,6 +114,10 @@ void VM_Version::initialize() {
   _supports_atomic_getset8 = true;
   _supports_atomic_getadd8 = true;
 
+  _cache_dic_enabled = false;
+  _cache_idc_enabled = false;
+  _ic_ivau_trapped = false;
+
   get_os_cpu_info();
   _cpu_features = _features;
 
@@ -676,6 +698,43 @@ void VM_Version::initialize() {
     clear_feature(CPU_SVE);
   }
 
+  if (FLAG_IS_DEFAULT(UseSingleICacheInvalidation) && is_cache_idc_enabled() && is_cache_dic_enabled()) {
+    FLAG_SET_DEFAULT(UseSingleICacheInvalidation, true);
+  }
+
+  if (FLAG_IS_DEFAULT(NeoverseN1ICacheErratumMitigation) && has_neoverse_n1_errata_1542419()
+      && is_cache_idc_enabled() && !is_cache_dic_enabled()) {
+    if (_ic_ivau_trapped) {
+      FLAG_SET_DEFAULT(NeoverseN1ICacheErratumMitigation, true);
+    } else {
+      log_info(os)("IC IVAU is not trapped; disabling NeoverseN1ICacheErratumMitigation");
+      FLAG_SET_DEFAULT(NeoverseN1ICacheErratumMitigation, false);
+    }
+  }
+
+  if (NeoverseN1ICacheErratumMitigation) {
+    if (!has_neoverse_n1_errata_1542419()) {
+      vm_exit_during_initialization("NeoverseN1ICacheErratumMitigation is set for the CPU not having Neoverse N1 errata 1542419");
+    }
+    // If the user explicitly set the flag, verify the trap is active.
+    if (!FLAG_IS_DEFAULT(NeoverseN1ICacheErratumMitigation) && !_ic_ivau_trapped) {
+      vm_exit_during_initialization("NeoverseN1ICacheErratumMitigation is set but IC IVAU is not trapped. "
+                                    "The optimization is not safe on this system.");
+    }
+    if (FLAG_IS_DEFAULT(UseSingleICacheInvalidation)) {
+      FLAG_SET_DEFAULT(UseSingleICacheInvalidation, true);
+    }
+
+    if (!UseSingleICacheInvalidation) {
+      vm_exit_during_initialization("NeoverseN1ICacheErratumMitigation is set but UseSingleICacheInvalidation is not enabled");
+    }
+  }
+
+  if (UseSingleICacheInvalidation
+      && (!is_cache_idc_enabled() || (!is_cache_dic_enabled() && !NeoverseN1ICacheErratumMitigation))) {
+    vm_exit_during_initialization("UseSingleICacheInvalidation is set but neither IDC nor DIC nor NeoverseN1ICacheErratumMitigation is enabled");
+  }
+
   // Construct the "features" string
   stringStream ss(512);
   ss.print("0x%02x:0x%x:0x%03x:%d", _cpu, _variant, _model, _revision);
diff --git a/src/hotspot/cpu/aarch64/vm_version_aarch64.hpp b/src/hotspot/cpu/aarch64/vm_version_aarch64.hpp
index f8274554f1c..30f1a5d86ca 100644
--- a/src/hotspot/cpu/aarch64/vm_version_aarch64.hpp
+++ b/src/hotspot/cpu/aarch64/vm_version_aarch64.hpp
@@ -58,6 +58,12 @@ protected:
   // When _prefer_sve_merging_mode_cpy is true, `cpy (imm, zeroing)` is
   // implemented as `movi; cpy(imm, merging)`.
   static constexpr bool _prefer_sve_merging_mode_cpy = true;
+  static bool _cache_dic_enabled;
+  static bool _cache_idc_enabled;
+
+  // IC IVAU trap probe for Neoverse N1 erratum 1542419.
+  // Set by get_os_cpu_info() on Linux via ic_ivau_probe_linux_aarch64.S.
+  static bool _ic_ivau_trapped;
 
   static SpinWait _spin_wait;
 
@@ -257,6 +263,10 @@ public:
     return vector_length_in_bytes <= 16;
   }
 
+  static bool is_cache_dic_enabled() { return _cache_dic_enabled; }
+  static bool is_cache_idc_enabled() { return _cache_idc_enabled; }
+  static bool is_ic_ivau_trapped()   { return _ic_ivau_trapped; }
+
   static void get_cpu_features_name(void* features_buffer, stringStream& ss);
 
   // Returns names of features present in features_set1 but not in features_set2
diff --git a/src/hotspot/os_cpu/linux_aarch64/ic_ivau_probe_linux_aarch64.S b/src/hotspot/os_cpu/linux_aarch64/ic_ivau_probe_linux_aarch64.S
new file mode 100644
index 00000000000..b82053d37b9
--- /dev/null
+++ b/src/hotspot/os_cpu/linux_aarch64/ic_ivau_probe_linux_aarch64.S
@@ -0,0 +1,69 @@
+/*
+ * Copyright Amazon.com Inc. or its affiliates. All Rights Reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ *
+ */
+
+#include "defs.S.inc"
+
+    # Probe whether IC IVAU is trapped.
+    #
+    # Returns 1 if IC IVAU is trapped (did not fault), 0 if not trapped
+    # (faulted on VA 0x0, signal handler redirected to continuation).
+    #
+    # int ic_ivau_probe(void);
+DECLARE_FUNC(ic_ivau_probe):
+DECLARE_FUNC(_ic_ivau_probe_fault):
+    ic      ivau, xzr
+    mov     x0, #1
+    ret
+DECLARE_FUNC(_ic_ivau_probe_continuation):
+    mov     x0, #0
+    ret
+
+/* Emit .note.gnu.property section in case of PAC or BTI being enabled. */
+#ifdef __ARM_FEATURE_BTI_DEFAULT
+    #ifdef __ARM_FEATURE_PAC_DEFAULT
+        #define GNU_PROPERTY_AARCH64_FEATURE 3
+    #else
+        #define GNU_PROPERTY_AARCH64_FEATURE 1
+    #endif
+#else
+    #ifdef __ARM_FEATURE_PAC_DEFAULT
+        #define GNU_PROPERTY_AARCH64_FEATURE 2
+    #else
+        #define GNU_PROPERTY_AARCH64_FEATURE 0
+    #endif
+#endif
+
+#if (GNU_PROPERTY_AARCH64_FEATURE != 0)
+        .pushsection .note.gnu.property, "a"
+        .align  3
+        .long   4          /* name length */
+        .long   0x10       /* data length */
+        .long   5          /* note type: NT_GNU_PROPERTY_TYPE_0 */
+        .string "GNU"      /* vendor name */
+        .long   0xc0000000 /* GNU_PROPERTY_AARCH64_FEATURE_1_AND */
+        .long   4          /* pr_datasze */
+        .long   GNU_PROPERTY_AARCH64_FEATURE
+        .long   0
+        .popsection
+#endif
diff --git a/src/hotspot/os_cpu/linux_aarch64/icache_linux_aarch64.cpp b/src/hotspot/os_cpu/linux_aarch64/icache_linux_aarch64.cpp
new file mode 100644
index 00000000000..41cad5af325
--- /dev/null
+++ b/src/hotspot/os_cpu/linux_aarch64/icache_linux_aarch64.cpp
@@ -0,0 +1,28 @@
+/*
+ * Copyright Amazon.com Inc. or its affiliates. All Rights Reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ *
+ */
+
+#include "runtime/icache.hpp"
+#include "utilities/globalDefinitions.hpp"
+
+NOT_PRODUCT(THREAD_LOCAL AArch64ICacheInvalidationContext* AArch64ICacheInvalidationContext::_current_context = nullptr;)
diff --git a/src/hotspot/os_cpu/linux_aarch64/icache_linux_aarch64.hpp b/src/hotspot/os_cpu/linux_aarch64/icache_linux_aarch64.hpp
index 8fbaa7a6b6e..444b3c3ebd6 100644
--- a/src/hotspot/os_cpu/linux_aarch64/icache_linux_aarch64.hpp
+++ b/src/hotspot/os_cpu/linux_aarch64/icache_linux_aarch64.hpp
@@ -26,6 +26,11 @@
 #ifndef OS_CPU_LINUX_AARCH64_ICACHE_AARCH64_HPP
 #define OS_CPU_LINUX_AARCH64_ICACHE_AARCH64_HPP
 
+#include "memory/allocation.hpp"
+#include "runtime/vm_version.hpp"
+#include "utilities/globalDefinitions.hpp"
+#include "vm_version_aarch64.hpp"
+
 // Interface for updating the instruction cache.  Whenever the VM
 // modifies code, part of the processor instruction cache potentially
 // has to be flushed.
@@ -37,8 +42,105 @@ class ICache : public AbstractICache {
     __builtin___clear_cache((char *)addr, (char *)(addr + 4));
   }
   static void invalidate_range(address start, int nbytes) {
-    __builtin___clear_cache((char *)start, (char *)(start + nbytes));
+    if (NeoverseN1ICacheErratumMitigation) {
+      assert(VM_Version::is_cache_idc_enabled(),
+             "Expect CTR_EL0.IDC to be enabled for Neoverse N1 with erratum "
+             "1542419");
+      assert(!VM_Version::is_cache_dic_enabled(),
+             "Expect CTR_EL0.DIC to be disabled for Neoverse N1 with erratum "
+             "1542419");
+      assert(VM_Version::is_ic_ivau_trapped(), "Expect 'ic ivau, xzr' to be trapped");
+      asm volatile("dsb ish       \n"
+                   "ic  ivau, xzr \n"
+                   "dsb ish       \n"
+                   "isb           \n"
+                   : : : "memory");
+    } else {
+      __builtin___clear_cache((char *)start, (char *)(start + nbytes));
+    }
   }
 };
 
+class AArch64ICacheInvalidationContext : StackObj {
+ private:
+
+#ifdef ASSERT
+  static THREAD_LOCAL AArch64ICacheInvalidationContext* _current_context;
+#endif
+
+  bool _has_modified_code;
+
+ public:
+  NONCOPYABLE(AArch64ICacheInvalidationContext);
+
+  AArch64ICacheInvalidationContext()
+      : _has_modified_code(false) {
+    assert(_current_context == nullptr, "nested ICacheInvalidationContext not supported");
+#ifdef ASSERT
+    _current_context = this;
+#endif
+  }
+
+  ~AArch64ICacheInvalidationContext() {
+    NOT_PRODUCT(_current_context = nullptr);
+
+    if (!_has_modified_code || !UseSingleICacheInvalidation) {
+      return;
+    }
+
+    assert(VM_Version::is_cache_idc_enabled(), "Expect CTR_EL0.IDC to be enabled");
+
+    asm volatile("dsb ish" : : : "memory");
+
+    if (NeoverseN1ICacheErratumMitigation) {
+      assert(!VM_Version::is_cache_dic_enabled(),
+             "Expect CTR_EL0.DIC to be disabled for Neoverse N1 with erratum "
+             "1542419");
+      assert(VM_Version::is_ic_ivau_trapped(), "Expect 'ic ivau, xzr' to be trapped");
+
+      // Errata 1542419: Neoverse N1 cores with the 'COHERENT_ICACHE' feature
+      // may fetch stale instructions when software depends on
+      // prefetch-speculation-protection instead of explicit synchronization.
+      //
+      // Neoverse-N1 implementation mitigates the errata 1542419 with a
+      // workaround:
+      // - Disable coherent icache.
+      // - Trap IC IVAU instructions.
+      // - Execute:
+      //   - tlbi vae3is, xzr
+      //   - dsb sy
+      // - Ignore trapped IC IVAU instructions.
+      //
+      // `tlbi vae3is, xzr` invalidates all translation entries (all VAs, all
+      // possible levels). It waits for all memory accesses using in-scope old
+      // translation information to complete before it is considered complete.
+      //
+      // As this workaround has significant overhead, Arm Neoverse N1 (MP050)
+      // Software Developer Errata Notice version 29.0 suggests:
+      //
+      // "Since one TLB inner-shareable invalidation is enough to avoid this
+      // erratum, the number of injected TLB invalidations should be minimized
+      // in the trap handler to mitigate the performance impact due to this
+      // workaround."
+      // As the address for icache invalidation is not relevant and
+      // IC IVAU instruction is ignored, we use XZR in it.
+      asm volatile(
+          "ic  ivau, xzr \n"
+          "dsb ish       \n"
+          :
+          :
+          : "memory");
+    } else {
+      assert(VM_Version::is_cache_dic_enabled(), "Expect CTR_EL0.DIC to be enabled");
+    }
+    asm volatile("isb" : : : "memory");
+  }
+
+  void set_has_modified_code() {
+    _has_modified_code = true;
+  }
+};
+
+#define PD_ICACHE_INVALIDATION_CONTEXT AArch64ICacheInvalidationContext
+
 #endif // OS_CPU_LINUX_AARCH64_ICACHE_AARCH64_HPP
diff --git a/src/hotspot/os_cpu/linux_aarch64/os_linux_aarch64.cpp b/src/hotspot/os_cpu/linux_aarch64/os_linux_aarch64.cpp
index da9e7e159f1..67e0569bf31 100644
--- a/src/hotspot/os_cpu/linux_aarch64/os_linux_aarch64.cpp
+++ b/src/hotspot/os_cpu/linux_aarch64/os_linux_aarch64.cpp
@@ -77,6 +77,11 @@
 #define REG_LR 30
 #define REG_BCP 22
 
+// IC IVAU trap probe.
+// Defined in ic_ivau_probe_linux_aarch64.S.
+extern "C" char _ic_ivau_probe_fault[] __attribute__ ((visibility ("hidden")));
+extern "C" char _ic_ivau_probe_continuation[] __attribute__ ((visibility ("hidden")));
+
 NOINLINE address os::current_stack_pointer() {
   return (address)__builtin_frame_address(0);
 }
@@ -228,6 +233,12 @@ bool PosixSignals::pd_hotspot_signal_handler(int sig, siginfo_t* info,
       }
     }
 
+    // IC IVAU trap probe during VM_Version initialization.
+    // If IC IVAU is not trapped, it faults on unmapped VA 0x0.
+    if (sig == SIGSEGV && pc == (address)_ic_ivau_probe_fault) {
+      stub = (address)_ic_ivau_probe_continuation;
+    }
+
     if (thread->thread_state() == _thread_in_Java) {
       // Java thread running in Java code => find exception handler if any
       // a fault inside compiled code, the interpreter, or a stub
diff --git a/src/hotspot/os_cpu/linux_aarch64/vm_version_linux_aarch64.cpp b/src/hotspot/os_cpu/linux_aarch64/vm_version_linux_aarch64.cpp
index 168fc622a0b..ee2d3013c4c 100644
--- a/src/hotspot/os_cpu/linux_aarch64/vm_version_linux_aarch64.cpp
+++ b/src/hotspot/os_cpu/linux_aarch64/vm_version_linux_aarch64.cpp
@@ -31,6 +31,10 @@
 #include <sys/auxv.h>
 #include <sys/prctl.h>
 
+// IC IVAU trap probe.
+// Defined in ic_ivau_probe_linux_aarch64.S.
+extern "C" int ic_ivau_probe(void);
+
 #ifndef HWCAP_AES
 #define HWCAP_AES   (1<<3)
 #endif
@@ -182,6 +186,12 @@ void VM_Version::get_os_cpu_info() {
 
   _icache_line_size = (1 << (ctr_el0 & 0x0f)) * 4;
   _dcache_line_size = (1 << ((ctr_el0 >> 16) & 0x0f)) * 4;
+  _cache_idc_enabled = ((ctr_el0 >> 28) & 0x1) != 0;
+  _cache_dic_enabled = ((ctr_el0 >> 29) & 0x1) != 0;
+
+  // Probe whether IC IVAU is trapped.
+  // Must run before VM_Version::initialize() sets NeoverseN1ICacheErratumMitigation.
+  _ic_ivau_trapped = (ic_ivau_probe() == 1);
 
   if (!(dczid_el0 & 0x10)) {
     _zva_length = 4 << (dczid_el0 & 0xf);
diff --git a/src/hotspot/share/code/codeBlob.cpp b/src/hotspot/share/code/codeBlob.cpp
index a7d939e590d..e0c286937d0 100644
--- a/src/hotspot/share/code/codeBlob.cpp
+++ b/src/hotspot/share/code/codeBlob.cpp
@@ -326,6 +326,11 @@ RuntimeBlob::RuntimeBlob(
   : CodeBlob(name, kind, cb, size, header_size, frame_complete, frame_size, oop_maps, caller_must_gc_arguments,
              align_up(cb->total_relocation_size(), oopSize))
 {
+  if (code_size() == 0) {
+    // Nothing to copy
+    return;
+  }
+
   cb->copy_code_and_locs_to(this);
 
   // Flush generated code
diff --git a/src/hotspot/share/code/nmethod.cpp b/src/hotspot/share/code/nmethod.cpp
index 0e2aa208854..de2c826667f 100644
--- a/src/hotspot/share/code/nmethod.cpp
+++ b/src/hotspot/share/code/nmethod.cpp
@@ -1332,6 +1332,7 @@ nmethod::nmethod(
     code_buffer->copy_values_to(this);
 
     post_init();
+    ICache::invalidate_range(code_begin(), code_size());
   }
 
   if (PrintNativeNMethods || PrintDebugInfo || PrintRelocations || PrintDependencies) {
@@ -1811,6 +1812,7 @@ nmethod::nmethod(
     init_immutable_data_ref_count();
 
     post_init();
+    ICache::invalidate_range(code_begin(), code_size());
 
     // we use the information of entry points to find out if a method is
     // static or non static
@@ -2038,7 +2040,7 @@ void nmethod::copy_values(GrowableArray<jobject>* array) {
   // The code and relocations have already been initialized by the
   // CodeBlob constructor, so it is valid even at this early point to
   // iterate over relocations and patch the code.
-  fix_oop_relocations(nullptr, nullptr, /*initialize_immediates=*/ true);
+  fix_oop_relocations(/*initialize_immediates=*/ true);
 }
 
 void nmethod::copy_values(GrowableArray<Metadata*>* array) {
@@ -2050,24 +2052,42 @@ void nmethod::copy_values(GrowableArray<Metadata*>* array) {
   }
 }
 
-void nmethod::fix_oop_relocations(address begin, address end, bool initialize_immediates) {
+bool nmethod::fix_oop_relocations(bool initialize_immediates) {
   // re-patch all oop-bearing instructions, just in case some oops moved
-  RelocIterator iter(this, begin, end);
+  RelocIterator iter(this);
+  bool modified_code = false;
   while (iter.next()) {
     if (iter.type() == relocInfo::oop_type) {
       oop_Relocation* reloc = iter.oop_reloc();
-      if (initialize_immediates && reloc->oop_is_immediate()) {
+      if (!reloc->oop_is_immediate()) {
+        // Refresh the oop-related bits of this instruction.
+        reloc->set_value(reloc->value());
+        modified_code = true;
+      } else if (initialize_immediates) {
         oop* dest = reloc->oop_addr();
         jobject obj = *reinterpret_cast<jobject*>(dest);
         initialize_immediate_oop(dest, obj);
       }
-      // Refresh the oop-related bits of this instruction.
-      reloc->fix_oop_relocation();
     } else if (iter.type() == relocInfo::metadata_type) {
       metadata_Relocation* reloc = iter.metadata_reloc();
       reloc->fix_metadata_relocation();
+      modified_code |= !reloc->metadata_is_immediate();
     }
   }
+  return modified_code;
+}
+
+void nmethod::fix_oop_relocations() {
+  ICacheInvalidationContext icic;
+  fix_oop_relocations(&icic);
+}
+
+void nmethod::fix_oop_relocations(ICacheInvalidationContext* icic) {
+  assert(icic != nullptr, "must provide context to track if code was modified");
+  bool modified_code = fix_oop_relocations(/*initialize_immediates=*/ false);
+  if (modified_code) {
+    icic->set_has_modified_code();
+  }
 }
 
 static void install_post_call_nop_displacement(nmethod* nm, address pc) {
diff --git a/src/hotspot/share/code/nmethod.hpp b/src/hotspot/share/code/nmethod.hpp
index 092da181f12..ea8c0e2ad5d 100644
--- a/src/hotspot/share/code/nmethod.hpp
+++ b/src/hotspot/share/code/nmethod.hpp
@@ -41,6 +41,7 @@ class Dependencies;
 class DirectiveSet;
 class DebugInformationRecorder;
 class ExceptionHandlerTable;
+class ICacheInvalidationContext;
 class ImplicitExceptionTable;
 class JvmtiThreadState;
 class MetadataClosure;
@@ -801,15 +802,15 @@ public:
 
   // Relocation support
 private:
-  void fix_oop_relocations(address begin, address end, bool initialize_immediates);
+  bool fix_oop_relocations(bool initialize_immediates);
   inline void initialize_immediate_oop(oop* dest, jobject handle);
 
 protected:
   address oops_reloc_begin() const;
 
 public:
-  void fix_oop_relocations(address begin, address end) { fix_oop_relocations(begin, end, false); }
-  void fix_oop_relocations()                           { fix_oop_relocations(nullptr, nullptr, false); }
+  void fix_oop_relocations(ICacheInvalidationContext* icic);
+  void fix_oop_relocations();
 
   bool is_at_poll_return(address pc);
   bool is_at_poll_or_poll_return(address pc);
diff --git a/src/hotspot/share/code/relocInfo.cpp b/src/hotspot/share/code/relocInfo.cpp
index 2a6335e2118..25d91edc20f 100644
--- a/src/hotspot/share/code/relocInfo.cpp
+++ b/src/hotspot/share/code/relocInfo.cpp
@@ -590,15 +590,6 @@ oop oop_Relocation::oop_value() {
   return *oop_addr();
 }
 
-
-void oop_Relocation::fix_oop_relocation() {
-  if (!oop_is_immediate()) {
-    // get the oop from the pool, and re-insert it into the instruction:
-    set_value(value());
-  }
-}
-
-
 void oop_Relocation::verify_oop_relocation() {
   if (!oop_is_immediate()) {
     // get the oop from the pool, and re-insert it into the instruction:
diff --git a/src/hotspot/share/code/relocInfo.hpp b/src/hotspot/share/code/relocInfo.hpp
index 6f1778ef479..bb2b2b5693f 100644
--- a/src/hotspot/share/code/relocInfo.hpp
+++ b/src/hotspot/share/code/relocInfo.hpp
@@ -988,8 +988,6 @@ class oop_Relocation : public DataRelocation {
   void pack_data_to(CodeSection* dest) override;
   void unpack_data() override;
 
-  void fix_oop_relocation();        // reasserts oop value
-
   void verify_oop_relocation();
 
   address value() override { return *reinterpret_cast<address*>(oop_addr()); }
diff --git a/src/hotspot/share/gc/z/zBarrierSetNMethod.cpp b/src/hotspot/share/gc/z/zBarrierSetNMethod.cpp
index d80ce4e149d..a439b3a167b 100644
--- a/src/hotspot/share/gc/z/zBarrierSetNMethod.cpp
+++ b/src/hotspot/share/gc/z/zBarrierSetNMethod.cpp
@@ -33,6 +33,7 @@
 #include "gc/z/zThreadLocalData.hpp"
 #include "gc/z/zUncoloredRoot.inline.hpp"
 #include "logging/log.hpp"
+#include "runtime/icache.hpp"
 #include "runtime/threadWXSetters.inline.hpp"
 
 bool ZBarrierSetNMethod::nmethod_entry_barrier(nmethod* nm) {
@@ -70,12 +71,15 @@ bool ZBarrierSetNMethod::nmethod_entry_barrier(nmethod* nm) {
     return false;
   }
 
-  // Heal barriers
-  ZNMethod::nmethod_patch_barriers(nm);
+  {
+    ICacheInvalidationContext icic;
+    // Heal barriers
+    ZNMethod::nmethod_patch_barriers(nm, &icic);
 
-  // Heal oops
-  ZUncoloredRootProcessWeakOopClosure cl(ZNMethod::color(nm));
-  ZNMethod::nmethod_oops_do_inner(nm, &cl);
+    // Heal oops
+    ZUncoloredRootProcessWeakOopClosure cl(ZNMethod::color(nm));
+    ZNMethod::nmethod_oops_do_inner(nm, &cl, &icic);
+  }
 
   const uintptr_t prev_color = ZNMethod::color(nm);
   const uintptr_t new_color = *ZPointerStoreGoodMaskLowOrderBitsAddr;
diff --git a/src/hotspot/share/gc/z/zGeneration.cpp b/src/hotspot/share/gc/z/zGeneration.cpp
index 27f352a624f..0f9f4e34a5e 100644
--- a/src/hotspot/share/gc/z/zGeneration.cpp
+++ b/src/hotspot/share/gc/z/zGeneration.cpp
@@ -58,6 +58,7 @@
 #include "prims/jvmtiTagMap.hpp"
 #include "runtime/continuation.hpp"
 #include "runtime/handshake.hpp"
+#include "runtime/icache.hpp"
 #include "runtime/safepoint.hpp"
 #include "runtime/threads.hpp"
 #include "runtime/vmOperations.hpp"
@@ -1434,12 +1435,15 @@ public:
   virtual void do_nmethod(nmethod* nm) {
     ZLocker<ZReentrantLock> locker(ZNMethod::lock_for_nmethod(nm));
     if (_bs_nm->is_armed(nm)) {
-      // Heal barriers
-      ZNMethod::nmethod_patch_barriers(nm);
+      {
+        ICacheInvalidationContext icic;
+        // Heal barriers
+        ZNMethod::nmethod_patch_barriers(nm, &icic);
 
-      // Heal oops
-      ZUncoloredRootProcessOopClosure cl(ZNMethod::color(nm));
-      ZNMethod::nmethod_oops_do_inner(nm, &cl);
+        // Heal oops
+        ZUncoloredRootProcessOopClosure cl(ZNMethod::color(nm));
+        ZNMethod::nmethod_oops_do_inner(nm, &cl, &icic);
+      }
 
       log_trace(gc, nmethod)("nmethod: " PTR_FORMAT " visited by old remapping", p2i(nm));
 
diff --git a/src/hotspot/share/gc/z/zMark.cpp b/src/hotspot/share/gc/z/zMark.cpp
index 03701ae9998..ac7d86db240 100644
--- a/src/hotspot/share/gc/z/zMark.cpp
+++ b/src/hotspot/share/gc/z/zMark.cpp
@@ -59,6 +59,7 @@
 #include "oops/oop.inline.hpp"
 #include "runtime/continuation.hpp"
 #include "runtime/handshake.hpp"
+#include "runtime/icache.hpp"
 #include "runtime/javaThread.hpp"
 #include "runtime/prefetch.inline.hpp"
 #include "runtime/safepointMechanism.hpp"
@@ -718,12 +719,15 @@ public:
   virtual void do_nmethod(nmethod* nm) {
     ZLocker<ZReentrantLock> locker(ZNMethod::lock_for_nmethod(nm));
     if (_bs_nm->is_armed(nm)) {
-      // Heal barriers
-      ZNMethod::nmethod_patch_barriers(nm);
+      {
+         ICacheInvalidationContext icic;
+         // Heal barriers
+         ZNMethod::nmethod_patch_barriers(nm, &icic);
 
-      // Heal oops
-      ZUncoloredRootMarkOopClosure cl(ZNMethod::color(nm));
-      ZNMethod::nmethod_oops_do_inner(nm, &cl);
+         // Heal oops
+         ZUncoloredRootMarkOopClosure cl(ZNMethod::color(nm));
+         ZNMethod::nmethod_oops_do_inner(nm, &cl, &icic);
+      }
 
       // CodeCache unloading support
       nm->mark_as_maybe_on_stack();
@@ -753,10 +757,6 @@ public:
     if (_bs_nm->is_armed(nm)) {
       const uintptr_t prev_color = ZNMethod::color(nm);
 
-      // Heal oops
-      ZUncoloredRootMarkYoungOopClosure cl(prev_color);
-      ZNMethod::nmethod_oops_do_inner(nm, &cl);
-
       // Disarm only the young marking, not any potential old marking cycle
 
       const uintptr_t old_marked_mask = ZPointerMarkedMask ^ (ZPointerMarkedYoung0 | ZPointerMarkedYoung1);
@@ -767,9 +767,16 @@ public:
       // Check if disarming for young mark, completely disarms the nmethod entry barrier
       const bool complete_disarm = ZPointer::is_store_good(new_disarm_value_ptr);
 
-      if (complete_disarm) {
-        // We are about to completely disarm the nmethod, must take responsibility to patch all barriers before disarming
-        ZNMethod::nmethod_patch_barriers(nm);
+      {
+        ICacheInvalidationContext icic;
+        if (complete_disarm) {
+          // We are about to completely disarm the nmethod, must take responsibility to patch all barriers before disarming
+          ZNMethod::nmethod_patch_barriers(nm, &icic);
+        }
+
+        // Heal oops
+        ZUncoloredRootMarkYoungOopClosure cl(prev_color);
+        ZNMethod::nmethod_oops_do_inner(nm, &cl, &icic);
       }
 
       _bs_nm->guard_with(nm, (int)untype(new_disarm_value_ptr));
diff --git a/src/hotspot/share/gc/z/zNMethod.cpp b/src/hotspot/share/gc/z/zNMethod.cpp
index 780bc9e3bf7..a1348b63b6f 100644
--- a/src/hotspot/share/gc/z/zNMethod.cpp
+++ b/src/hotspot/share/gc/z/zNMethod.cpp
@@ -50,6 +50,7 @@
 #include "oops/oop.inline.hpp"
 #include "runtime/atomicAccess.hpp"
 #include "runtime/continuation.hpp"
+#include "runtime/icache.hpp"
 #include "utilities/debug.hpp"
 
 static ZNMethodData* gc_data(const nmethod* nm) {
@@ -245,8 +246,16 @@ void ZNMethod::set_guard_value(nmethod* nm, int value) {
 }
 
 void ZNMethod::nmethod_patch_barriers(nmethod* nm) {
+  ICacheInvalidationContext icic;
+  nmethod_patch_barriers(nm, &icic);
+}
+
+void ZNMethod::nmethod_patch_barriers(nmethod* nm, ICacheInvalidationContext* icic) {
   ZBarrierSetAssembler* const bs_asm = ZBarrierSet::assembler();
   ZArrayIterator<ZNMethodDataBarrier> iter(gc_data(nm)->barriers());
+  if (gc_data(nm)->barriers()->is_nonempty()) {
+    icic->set_has_modified_code();
+  }
   for (ZNMethodDataBarrier barrier; iter.next(&barrier);) {
     bs_asm->patch_barrier_relocation(barrier._reloc_addr, barrier._reloc_format);
   }
@@ -258,6 +267,11 @@ void ZNMethod::nmethod_oops_do(nmethod* nm, OopClosure* cl) {
 }
 
 void ZNMethod::nmethod_oops_do_inner(nmethod* nm, OopClosure* cl) {
+  ICacheInvalidationContext icic;
+  nmethod_oops_do_inner(nm, cl, &icic);
+}
+
+void ZNMethod::nmethod_oops_do_inner(nmethod* nm, OopClosure* cl, ICacheInvalidationContext* icic) {
   // Process oops table
   {
     oop* const begin = nm->oops_begin();
@@ -283,7 +297,7 @@ void ZNMethod::nmethod_oops_do_inner(nmethod* nm, OopClosure* cl) {
 
   // Process non-immediate oops
   if (data->has_non_immediate_oops()) {
-    nm->fix_oop_relocations();
+    nm->fix_oop_relocations(icic);
   }
 }
 
diff --git a/src/hotspot/share/gc/z/zNMethod.hpp b/src/hotspot/share/gc/z/zNMethod.hpp
index 865ea11e7b9..2779151c576 100644
--- a/src/hotspot/share/gc/z/zNMethod.hpp
+++ b/src/hotspot/share/gc/z/zNMethod.hpp
@@ -56,9 +56,11 @@ public:
   static void set_guard_value(nmethod* nm, int value);
 
   static void nmethod_patch_barriers(nmethod* nm);
+  static void nmethod_patch_barriers(nmethod* nm, ICacheInvalidationContext* icic);
 
   static void nmethod_oops_do(nmethod* nm, OopClosure* cl);
   static void nmethod_oops_do_inner(nmethod* nm, OopClosure* cl);
+  static void nmethod_oops_do_inner(nmethod* nm, OopClosure* cl, ICacheInvalidationContext* icic);
 
   static void nmethods_do_begin(bool secondary);
   static void nmethods_do_end(bool secondary);
diff --git a/src/hotspot/share/runtime/icache.hpp b/src/hotspot/share/runtime/icache.hpp
index bc153862323..692a876d9a6 100644
--- a/src/hotspot/share/runtime/icache.hpp
+++ b/src/hotspot/share/runtime/icache.hpp
@@ -129,4 +129,27 @@ class ICacheStubGenerator : public StubCodeGenerator {
   void generate_icache_flush(ICache::flush_icache_stub_t* flush_icache_stub);
 };
 
+class DefaultICacheInvalidationContext : StackObj {
+ public:
+  NONCOPYABLE(DefaultICacheInvalidationContext);
+
+  DefaultICacheInvalidationContext() {}
+
+  ~DefaultICacheInvalidationContext() {}
+
+  void set_has_modified_code() {}
+};
+
+#ifndef PD_ICACHE_INVALIDATION_CONTEXT
+#define PD_ICACHE_INVALIDATION_CONTEXT DefaultICacheInvalidationContext
+#endif // PD_ICACHE_INVALIDATION_CONTEXT
+
+class ICacheInvalidationContext final : public PD_ICACHE_INVALIDATION_CONTEXT {
+ private:
+  NONCOPYABLE(ICacheInvalidationContext);
+
+ public:
+  using PD_ICACHE_INVALIDATION_CONTEXT::PD_ICACHE_INVALIDATION_CONTEXT;
+};
+
 #endif // SHARE_RUNTIME_ICACHE_HPP
diff --git a/test/hotspot/jtreg/compiler/runtime/TestDeferredICacheInvalidationCmdOptions.java b/test/hotspot/jtreg/compiler/runtime/TestDeferredICacheInvalidationCmdOptions.java
new file mode 100644
index 00000000000..c46f1ecab98
--- /dev/null
+++ b/test/hotspot/jtreg/compiler/runtime/TestDeferredICacheInvalidationCmdOptions.java
@@ -0,0 +1,434 @@
+/*
+ * Copyright Amazon.com Inc. or its affiliates. All Rights Reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ *
+ */
+
+package compiler.runtime;
+
+import jdk.test.lib.process.OutputAnalyzer;
+import jdk.test.lib.process.ProcessTools;
+import jdk.test.whitebox.WhiteBox;
+import jtreg.SkippedException;
+
+/*
+ * @test
+ * @bug 8370947 8381003
+ * @summary Test command-line options for UseSingleICacheInvalidation and NeoverseN1ICacheErratumMitigation
+ * @library /test/lib
+ * @requires os.arch == "aarch64"
+ * @requires os.family == "linux"
+ * @build jdk.test.whitebox.WhiteBox
+ * @run driver jdk.test.lib.helpers.ClassFileInstaller jdk.test.whitebox.WhiteBox
+ * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions -XX:+WhiteBoxAPI compiler.runtime.TestDeferredICacheInvalidationCmdOptions
+ */
+
+public class TestDeferredICacheInvalidationCmdOptions {
+
+    // CPU identifiers
+    private static final int CPU_ARM = 0x41;
+    private static final int NEOVERSE_N1_MODEL = 0xd0c;
+
+    // Known ARM Neoverse models where we can predict UseSingleICacheInvalidation
+    // behavior.
+    private static final int[] KNOWN_NEOVERSE_MODELS = {
+        NEOVERSE_N1_MODEL,
+        0xd40, // Neoverse V1
+        0xd49, // Neoverse N2
+        0xd4f, // Neoverse V2
+        0xd83, // Neoverse V3AE
+        0xd84, // Neoverse V3
+        0xd8e, // Neoverse N3
+    };
+
+    private static boolean isAffected;
+    private static boolean isKnownModel;
+
+    public static void main(String[] args) throws Exception {
+        // This test does not depend on CPU identification — run it first.
+        testDisableBothFlags();
+
+        // Parse CPU features and print CPU info
+        parseCPUFeatures();
+
+        if (!isKnownModel) {
+            throw new SkippedException("Unknown CPU model - skipping remaining tests.");
+        }
+
+        if (isAffected) {
+            // Detect whether IC IVAU is trapped on this system.
+            ProcessBuilder pb = ProcessTools.createTestJavaProcessBuilder(
+                "-XX:+UnlockDiagnosticVMOptions",
+                "-XX:+NeoverseN1ICacheErratumMitigation",
+                "-version");
+            OutputAnalyzer output = new OutputAnalyzer(pb.start());
+
+            if (output.getExitValue() != 0) {
+                // Verify the failure is the expected probe error, not something else.
+                output.shouldContain("IC IVAU is not trapped");
+                throw new SkippedException("IC IVAU is not trapped - skipping remaining tests.");
+            } else {
+                System.out.println("IC IVAU trap active.");
+            }
+        }
+
+        if (isAffected) {
+            // Check defaults on Neoverse N1 pre-r4p1
+            testCase_DefaultsOnNeoverseN1();
+
+            // Check if NeoverseN1ICacheErratumMitigation is set to false on affected CPUs,
+            // UseSingleICacheInvalidation is also set to false
+            testCase_ExplicitlyDisableErrataAffectsDeferred();
+
+            // Check JVM error if UseSingleICacheInvalidation=true
+            // but NeoverseN1ICacheErratumMitigation=false on affected CPUs
+            testCase_ConflictingFlagsOnAffectedCPUs();
+
+            // Check explicit NeoverseN1ICacheErratumMitigation=true enables UseSingleICacheInvalidation
+            testCase_ExplicitlyEnableErrataEnablesDeferred();
+
+            // Check UseSingleICacheInvalidation=false with NeoverseN1ICacheErratumMitigation=true
+            testCase_ConflictingErrataWithoutDeferred();
+        } else {
+            // Check NeoverseN1ICacheErratumMitigation is false on unaffected CPUs
+            testCase_DefaultsOnUnaffectedCPUs();
+
+            // Check setting NeoverseN1ICacheErratumMitigation=true on unaffected CPU causes an error
+            testCase_EnablingErrataOnUnaffectedCPU();
+        }
+
+        System.out.println("All test cases passed!");
+    }
+
+    /**
+     * Parse CPU features string from WhiteBox.getCPUFeatures() to extract:
+     * - cpuFamily: 0x41 for ARM
+     * - cpuVariant: major revision
+     * - cpuModel: e.g., 0xd0c for Neoverse N1
+     * - cpuRevision: minor revision
+     * - cpuModel2: secondary model (if present, in parentheses)
+     *
+     * Sets the static fields isAffected and isKnownModel, and prints CPU info.
+     *
+     * Format: 0x%02x:0x%x:0x%03x:%d[(0x%03x)]
+     * Example: "0x41:0x3:0xd0c:0" or "0x41:0x3:0xd0c:0(0xd0c)"
+     *
+     * @throws SkippedException if not running on ARM CPU
+     */
+    private static void parseCPUFeatures() {
+        WhiteBox wb = WhiteBox.getWhiteBox();
+        String cpuFeatures = wb.getCPUFeatures();
+        System.out.println("CPU Features string: " + cpuFeatures);
+
+        if (cpuFeatures == null || cpuFeatures.isEmpty()) {
+            throw new RuntimeException("No CPU features available");
+        }
+
+        int commaIndex = cpuFeatures.indexOf(",");
+        if (commaIndex == -1) {
+            throw new RuntimeException("Unexpected CPU features format (no comma): " + cpuFeatures);
+        }
+
+        String cpuPart = cpuFeatures.substring(0, commaIndex).trim();
+
+        String[] parts = cpuPart.split(":");
+        if (parts.length < 4) {
+            throw new RuntimeException("Unexpected CPU features format: " + cpuPart);
+        }
+
+        int cpuFamily = Integer.parseInt(parts[0].substring(2), 16);
+        if (cpuFamily != CPU_ARM) {
+            throw new SkippedException("Not running on ARM CPU (cpuFamily=0x" + Integer.toHexString(cpuFamily) + ")");
+        }
+
+        int cpuVariant = Integer.parseInt(parts[1].substring(2), 16);
+        int cpuModel = Integer.parseInt(parts[2].substring(2), 16);
+        int cpuModel2 = 0;
+
+        int model2Start = parts[3].indexOf("(");
+        String revisionStr = parts[3];
+        if (model2Start != -1) {
+            if (!parts[3].endsWith(")")) {
+                throw new RuntimeException("Unexpected CPU features format (missing closing parenthesis): " + parts[3]);
+            }
+            String model2Str = parts[3].substring(model2Start + 1, parts[3].length() - 1);
+            cpuModel2 = Integer.parseInt(model2Str.substring(2), 16);
+            revisionStr = parts[3].substring(0, model2Start);
+        }
+        int cpuRevision = Integer.parseInt(revisionStr);
+
+        // Neoverse N1 errata 1542419 affects r3p0, r3p1 and r4p0.
+        // It is fixed in r4p1 and later revisions.
+        if (cpuModel == NEOVERSE_N1_MODEL || cpuModel2 == NEOVERSE_N1_MODEL) {
+            isAffected = (cpuVariant == 3 && cpuRevision == 0) ||
+                         (cpuVariant == 3 && cpuRevision == 1) ||
+                         (cpuVariant == 4 && cpuRevision == 0);
+        }
+
+        // Check if this is a known Neoverse model.
+        isKnownModel = false;
+        for (int model : KNOWN_NEOVERSE_MODELS) {
+            if (cpuModel == model || cpuModel2 == model) {
+                isKnownModel = true;
+                break;
+            }
+        }
+
+        printCPUInfo(cpuFamily, cpuVariant, cpuModel, cpuModel2, cpuRevision);
+    }
+
+    private static void printCPUInfo(int cpuFamily, int cpuVariant, int cpuModel, int cpuModel2, int cpuRevision) {
+        boolean isNeoverseN1 = (cpuFamily == CPU_ARM) &&
+                               (cpuModel == NEOVERSE_N1_MODEL || cpuModel2 == NEOVERSE_N1_MODEL);
+        System.out.println("\n=== CPU Information ===");
+        System.out.println("CPU Family: 0x" + Integer.toHexString(cpuFamily));
+        System.out.println("CPU Variant: 0x" + Integer.toHexString(cpuVariant));
+        System.out.println("CPU Model: 0x" + Integer.toHexString(cpuModel));
+        if (cpuModel2 != 0) {
+            System.out.println("CPU Model2: 0x" + Integer.toHexString(cpuModel2));
+        }
+        System.out.println("CPU Revision: " + cpuRevision);
+        System.out.println("Is Neoverse N1: " + isNeoverseN1);
+        System.out.println("Is affected by errata 1542419: " + isAffected);
+        System.out.println("Is known model: " + isKnownModel);
+        System.out.println("======================\n");
+    }
+
+    /**
+     * Test that UseSingleICacheInvalidation and NeoverseN1ICacheErratumMitigation flags
+     * can be explicitly set to false on any system.
+     */
+    private static void testDisableBothFlags() throws Exception {
+        System.out.println("\nTest: Explicitly disable both flags");
+
+        ProcessBuilder pb = ProcessTools.createTestJavaProcessBuilder(
+            "-XX:+UnlockDiagnosticVMOptions",
+            "-XX:-UseSingleICacheInvalidation",
+            "-XX:-NeoverseN1ICacheErratumMitigation",
+            "-XX:+PrintFlagsFinal",
+            "-version");
+
+        OutputAnalyzer output = new OutputAnalyzer(pb.start());
+        output.shouldHaveExitValue(0);
+
+        String output_str = output.getOutput();
+        boolean hasSingleDisabled = output_str.matches("(?s).*bool\\s+UseSingleICacheInvalidation\\s*=\\s*false.*");
+        boolean hasErrataDisabled = output_str.matches("(?s).*bool\\s+NeoverseN1ICacheErratumMitigation\\s*=\\s*false.*");
+
+        System.out.println("UseSingleICacheInvalidation disabled: " + hasSingleDisabled);
+        System.out.println("NeoverseN1ICacheErratumMitigation disabled: " + hasErrataDisabled);
+
+        if (!hasErrataDisabled) {
+            throw new RuntimeException("Failed to disable NeoverseN1ICacheErratumMitigation via command line");
+        }
+
+        if (!hasSingleDisabled) {
+            throw new RuntimeException("Failed to disable UseSingleICacheInvalidation via command line");
+        }
+
+        System.out.println("Successfully disabled both flags");
+    }
+
+    /**
+     * Check defaults on Neoverse N1 affected revisions.
+     * UseSingleICacheInvalidation and NeoverseN1ICacheErratumMitigation flags should be true.
+     */
+    private static void testCase_DefaultsOnNeoverseN1() throws Exception {
+        System.out.println("\nTest: Check defaults on Neoverse N1 affected revisions");
+
+        ProcessBuilder pb = ProcessTools.createTestJavaProcessBuilder(
+            "-XX:+UnlockDiagnosticVMOptions",
+            "-XX:+PrintFlagsFinal",
+            "-version");
+
+        OutputAnalyzer output = new OutputAnalyzer(pb.start());
+        output.shouldHaveExitValue(0);
+
+        String output_str = output.getOutput();
+        boolean hasSingleEnabled = output_str.matches("(?s).*bool\\s+UseSingleICacheInvalidation\\s*=\\s*true.*");
+        boolean hasErrataEnabled = output_str.matches("(?s).*bool\\s+NeoverseN1ICacheErratumMitigation\\s*=\\s*true.*");
+
+        System.out.println("UseSingleICacheInvalidation enabled: " + hasSingleEnabled);
+        System.out.println("NeoverseN1ICacheErratumMitigation enabled: " + hasErrataEnabled);
+
+        if (!hasSingleEnabled || !hasErrataEnabled) {
+            throw new RuntimeException("On affected Neoverse N1 with trap active, " +
+                 "UseSingleICacheInvalidation and NeoverseN1ICacheErratumMitigation flags should be enabled by default");
+        }
+        System.out.println("Correctly enabled on affected Neoverse N1");
+    }
+
+    /**
+     * Check NeoverseN1ICacheErratumMitigation is false on unaffected CPUs.
+     */
+    private static void testCase_DefaultsOnUnaffectedCPUs() throws Exception {
+        System.out.println("\nTest: Check NeoverseN1ICacheErratumMitigation is false on unaffected CPUs");
+
+        ProcessBuilder pb = ProcessTools.createTestJavaProcessBuilder(
+            "-XX:+UnlockDiagnosticVMOptions",
+            "-XX:+PrintFlagsFinal",
+            "-version");
+
+        OutputAnalyzer output = new OutputAnalyzer(pb.start());
+        output.shouldHaveExitValue(0);
+
+        String output_str = output.getOutput();
+        boolean hasErrataEnabled = output_str.matches("(?s).*bool\\s+NeoverseN1ICacheErratumMitigation\\s*=\\s*true.*");
+
+        System.out.println("NeoverseN1ICacheErratumMitigation enabled: " + hasErrataEnabled);
+
+        if (hasErrataEnabled) {
+            throw new RuntimeException("On unaffected CPUs, NeoverseN1ICacheErratumMitigation should be disabled");
+        }
+        System.out.println("Correctly disabled on unaffected CPU");
+    }
+
+    /**
+     * Check if NeoverseN1ICacheErratumMitigation is set to false via cmd on affected CPUs,
+     * UseSingleICacheInvalidation is set to false.
+     */
+    private static void testCase_ExplicitlyDisableErrataAffectsDeferred() throws Exception {
+        System.out.println("\nTest: Explicitly disable NeoverseN1ICacheErratumMitigation, check UseSingleICacheInvalidation");
+
+        ProcessBuilder pb = ProcessTools.createTestJavaProcessBuilder(
+            "-XX:+UnlockDiagnosticVMOptions",
+            "-XX:-NeoverseN1ICacheErratumMitigation",
+            "-XX:+PrintFlagsFinal",
+            "-version");
+
+        OutputAnalyzer output = new OutputAnalyzer(pb.start());
+        output.shouldHaveExitValue(0);
+
+        String output_str = output.getOutput();
+        boolean hasSingleDisabled = output_str.matches("(?s).*bool\\s+UseSingleICacheInvalidation\\s*=\\s*false.*");
+        boolean hasErrataDisabled = output_str.matches("(?s).*bool\\s+NeoverseN1ICacheErratumMitigation\\s*=\\s*false.*");
+
+        System.out.println("NeoverseN1ICacheErratumMitigation disabled: " + hasErrataDisabled);
+        System.out.println("UseSingleICacheInvalidation disabled: " + hasSingleDisabled);
+
+        if (!hasErrataDisabled) {
+            throw new RuntimeException("Failed to disable NeoverseN1ICacheErratumMitigation via command line");
+        }
+
+        if (!hasSingleDisabled) {
+            throw new RuntimeException("On affected CPU, disabling NeoverseN1ICacheErratumMitigation should also disable UseSingleICacheInvalidation");
+        }
+        System.out.println("Correctly synchronized on affected CPU");
+    }
+
+    /**
+     * Check JVM reports an error if UseSingleICacheInvalidation is set to true
+     * but NeoverseN1ICacheErratumMitigation is set to false on affected CPUs.
+     */
+    private static void testCase_ConflictingFlagsOnAffectedCPUs() throws Exception {
+        System.out.println("\nTest: Try to set UseSingleICacheInvalidation=true with NeoverseN1ICacheErratumMitigation=false");
+
+        ProcessBuilder pb = ProcessTools.createTestJavaProcessBuilder(
+            "-XX:+UnlockDiagnosticVMOptions",
+            "-XX:+UseSingleICacheInvalidation",
+            "-XX:-NeoverseN1ICacheErratumMitigation",
+            "-version");
+
+        OutputAnalyzer output = new OutputAnalyzer(pb.start());
+
+        if (output.getExitValue() == 0) {
+            throw new RuntimeException("On affected CPU, setting UseSingleICacheInvalidation=true " +
+                "with NeoverseN1ICacheErratumMitigation=false should cause error");
+        }
+        output.shouldContain("Error");
+        System.out.println("JVM correctly rejected conflicting flags on affected CPU");
+    }
+
+    /**
+     * Check explicit NeoverseN1ICacheErratumMitigation=true enables UseSingleICacheInvalidation.
+     */
+    private static void testCase_ExplicitlyEnableErrataEnablesDeferred() throws Exception {
+        System.out.println("\nTest: Explicitly enable NeoverseN1ICacheErratumMitigation, check UseSingleICacheInvalidation");
+
+        ProcessBuilder pb = ProcessTools.createTestJavaProcessBuilder(
+            "-XX:+UnlockDiagnosticVMOptions",
+            "-XX:+NeoverseN1ICacheErratumMitigation",
+            "-XX:+PrintFlagsFinal",
+            "-version");
+
+        OutputAnalyzer output = new OutputAnalyzer(pb.start());
+        output.shouldHaveExitValue(0);
+
+        String output_str = output.getOutput();
+        boolean hasSingleEnabled = output_str.matches("(?s).*bool\\s+UseSingleICacheInvalidation\\s*=\\s*true.*");
+        boolean hasErrataEnabled = output_str.matches("(?s).*bool\\s+NeoverseN1ICacheErratumMitigation\\s*=\\s*true.*");
+
+        System.out.println("NeoverseN1ICacheErratumMitigation enabled: " + hasErrataEnabled);
+        System.out.println("UseSingleICacheInvalidation enabled: " + hasSingleEnabled);
+
+        if (!hasErrataEnabled) {
+            throw new RuntimeException("Failed to enable NeoverseN1ICacheErratumMitigation via command line");
+        }
+
+        if (!hasSingleEnabled) {
+            throw new RuntimeException("On affected CPU, enabling NeoverseN1ICacheErratumMitigation should also enable UseSingleICacheInvalidation");
+        }
+        System.out.println("Correctly synchronized on affected CPU");
+    }
+
+    /**
+     * Check JVM reports an error if UseSingleICacheInvalidation is set to false
+     * and NeoverseN1ICacheErratumMitigation is set to true on affected CPUs.
+     */
+    private static void testCase_ConflictingErrataWithoutDeferred() throws Exception {
+        System.out.println("\nTest: Try to set NeoverseN1ICacheErratumMitigation=true with UseSingleICacheInvalidation=false");
+
+        ProcessBuilder pb = ProcessTools.createTestJavaProcessBuilder(
+            "-XX:+UnlockDiagnosticVMOptions",
+            "-XX:-UseSingleICacheInvalidation",
+            "-XX:+NeoverseN1ICacheErratumMitigation",
+            "-XX:+PrintFlagsFinal",
+            "-version");
+
+        OutputAnalyzer output = new OutputAnalyzer(pb.start());
+
+        if (output.getExitValue() == 0) {
+            throw new RuntimeException("On affected CPU, setting NeoverseN1ICacheErratumMitigation=true with UseSingleICacheInvalidation=false should cause an error");
+        }
+        output.shouldContain("Error");
+        System.out.println("JVM correctly rejected conflicting flags on affected CPU");
+    }
+
+    /**
+     * Check setting NeoverseN1ICacheErratumMitigation=true on unaffected CPU causes an error.
+     */
+    private static void testCase_EnablingErrataOnUnaffectedCPU() throws Exception {
+        System.out.println("\nTest: Try to set NeoverseN1ICacheErratumMitigation=true on unaffected CPU");
+
+        ProcessBuilder pb = ProcessTools.createTestJavaProcessBuilder(
+            "-XX:+UnlockDiagnosticVMOptions",
+            "-XX:+NeoverseN1ICacheErratumMitigation",
+            "-version");
+
+        OutputAnalyzer output = new OutputAnalyzer(pb.start());
+
+        if (output.getExitValue() == 0) {
+            throw new RuntimeException("On unaffected CPU, setting NeoverseN1ICacheErratumMitigation=true should cause error");
+        }
+        output.shouldContain("Error");
+        System.out.println("JVM correctly rejected enabling errata flag on unaffected CPU");
+    }
+}
diff --git a/test/hotspot/jtreg/gc/TestDeferredICacheInvalidation.java b/test/hotspot/jtreg/gc/TestDeferredICacheInvalidation.java
new file mode 100644
index 00000000000..dc7e500ec9d
--- /dev/null
+++ b/test/hotspot/jtreg/gc/TestDeferredICacheInvalidation.java
@@ -0,0 +1,316 @@
+/*
+ * Copyright Amazon.com Inc. or its affiliates. All Rights Reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ *
+ */
+
+package gc;
+
+/*
+ * @test id=parallel
+ * @bug 8370947
+ * @summary Check no assertion is triggered when UseSingleICacheInvalidation is enabled for ParallelGC
+ * @library /test/lib
+ * @requires vm.debug
+ * @requires vm.gc.Parallel
+ * @requires os.arch == "aarch64"
+ * @requires os.family == "linux"
+ * @build jdk.test.whitebox.WhiteBox
+ * @run driver jdk.test.lib.helpers.ClassFileInstaller jdk.test.whitebox.WhiteBox
+ * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions -XX:+WhiteBoxAPI -XX:+UseParallelGC -XX:-UseCodeCacheFlushing gc.TestDeferredICacheInvalidation youngGC C1
+ * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions -XX:+WhiteBoxAPI -XX:+UseParallelGC -XX:-UseCodeCacheFlushing gc.TestDeferredICacheInvalidation fullGC C1
+ * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions -XX:+WhiteBoxAPI -XX:+UseParallelGC -XX:-UseCodeCacheFlushing gc.TestDeferredICacheInvalidation youngGC C2
+ * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions -XX:+WhiteBoxAPI -XX:+UseParallelGC -XX:-UseCodeCacheFlushing gc.TestDeferredICacheInvalidation fullGC C2
+ */
+
+/*
+ * @test id=g1
+ * @bug 8370947
+ * @summary Check no assertion is triggered when UseSingleICacheInvalidation is enabled for G1GC
+ * @library /test/lib
+ * @requires vm.debug
+ * @requires vm.gc.G1
+ * @requires os.arch == "aarch64"
+ * @requires os.family == "linux"
+ * @build jdk.test.whitebox.WhiteBox
+ * @run driver jdk.test.lib.helpers.ClassFileInstaller jdk.test.whitebox.WhiteBox
+ * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions -XX:+WhiteBoxAPI -XX:+UseG1GC -XX:-UseCodeCacheFlushing gc.TestDeferredICacheInvalidation youngGC C1
+ * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions -XX:+WhiteBoxAPI -XX:+UseG1GC -XX:-UseCodeCacheFlushing gc.TestDeferredICacheInvalidation fullGC C1
+ * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions -XX:+WhiteBoxAPI -XX:+UseG1GC -XX:-UseCodeCacheFlushing gc.TestDeferredICacheInvalidation youngGC C2
+ * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions -XX:+WhiteBoxAPI -XX:+UseG1GC -XX:-UseCodeCacheFlushing gc.TestDeferredICacheInvalidation fullGC C2
+ */
+
+/*
+ * @test id=shenandoah
+ * @bug 8370947
+ * @summary Check no assertion is triggered when UseSingleICacheInvalidation is enabled for ShenandoahGC
+ * @library /test/lib
+ * @requires vm.debug
+ * @requires vm.gc.Shenandoah
+ * @requires os.arch == "aarch64"
+ * @requires os.family == "linux"
+ * @build jdk.test.whitebox.WhiteBox
+ * @run driver jdk.test.lib.helpers.ClassFileInstaller jdk.test.whitebox.WhiteBox
+ * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions -XX:+WhiteBoxAPI -XX:+UseShenandoahGC -XX:-UseCodeCacheFlushing gc.TestDeferredICacheInvalidation fullGC C1
+ * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions -XX:+WhiteBoxAPI -XX:+UseShenandoahGC -XX:-UseCodeCacheFlushing gc.TestDeferredICacheInvalidation fullGC C2
+ */
+
+/*
+ * @test id=genshen
+ * @bug 8370947
+ * @summary Check no assertion is triggered when UseSingleICacheInvalidation is enabled for generational ShenandoahGC
+ * @library /test/lib
+ * @requires vm.debug
+ * @requires vm.gc.Shenandoah
+ * @requires os.arch == "aarch64"
+ * @requires os.family == "linux"
+ * @build jdk.test.whitebox.WhiteBox
+ * @run driver jdk.test.lib.helpers.ClassFileInstaller jdk.test.whitebox.WhiteBox
+ * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions -XX:+WhiteBoxAPI -XX:+UseShenandoahGC -XX:+UnlockExperimentalVMOptions -XX:ShenandoahGCMode=generational -XX:-UseCodeCacheFlushing gc.TestDeferredICacheInvalidation youngGC C1
+ * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions -XX:+WhiteBoxAPI -XX:+UseShenandoahGC -XX:+UnlockExperimentalVMOptions -XX:ShenandoahGCMode=generational -XX:-UseCodeCacheFlushing gc.TestDeferredICacheInvalidation fullGC C1
+ * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions -XX:+WhiteBoxAPI -XX:+UseShenandoahGC -XX:+UnlockExperimentalVMOptions -XX:ShenandoahGCMode=generational -XX:-UseCodeCacheFlushing gc.TestDeferredICacheInvalidation youngGC C2
+ * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions -XX:+WhiteBoxAPI -XX:+UseShenandoahGC -XX:+UnlockExperimentalVMOptions -XX:ShenandoahGCMode=generational -XX:-UseCodeCacheFlushing gc.TestDeferredICacheInvalidation fullGC C2
+ */
+
+/*
+ * @test id=z
+ * @bug 8370947
+ * @summary Check no assertion is triggered when UseSingleICacheInvalidation is enabled for ZGC
+ * @library /test/lib
+ * @requires vm.debug
+ * @requires vm.gc.Z
+ * @requires os.arch == "aarch64"
+ * @requires os.family == "linux"
+ * @build jdk.test.whitebox.WhiteBox
+ * @run driver jdk.test.lib.helpers.ClassFileInstaller jdk.test.whitebox.WhiteBox
+ * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions -XX:+WhiteBoxAPI -XX:+UseZGC -XX:-UseCodeCacheFlushing gc.TestDeferredICacheInvalidation youngGC C1
+ * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions -XX:+WhiteBoxAPI -XX:+UseZGC -XX:-UseCodeCacheFlushing gc.TestDeferredICacheInvalidation fullGC C1
+ * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions -XX:+WhiteBoxAPI -XX:+UseZGC -XX:-UseCodeCacheFlushing gc.TestDeferredICacheInvalidation youngGC C2
+ * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions -XX:+WhiteBoxAPI -XX:+UseZGC -XX:-UseCodeCacheFlushing gc.TestDeferredICacheInvalidation fullGC C2
+ */
+
+/*
+ * Nmethods have GC barriers and OOPs embedded into their code. GCs can patch nmethod's code
+ * which requires icache invalidation. Doing invalidation per instruction can be expensive.
+ * CPU can support hardware dcache and icache coherence. This would allow to defer cache
+ * invalidation.
+ *
+ * There are assertions for deferred cache invalidation. This test checks that all of them
+ * are passed.
+ */
+
+import java.util.concurrent.atomic.AtomicBoolean;
+import java.util.concurrent.locks.ReentrantReadWriteLock;
+
+import jdk.test.whitebox.WhiteBox;
+import jtreg.SkippedException;
+
+public class TestDeferredICacheInvalidation {
+
+    private static final WhiteBox WB = WhiteBox.getWhiteBox();
+
+    public static class A {
+        public String s1;
+        public String s2;
+        public String s3;
+        public String s4;
+        public String s5;
+        public String s6;
+        public String s7;
+        public String s8;
+        public String s9;
+    }
+
+    public static A a = new A();
+
+    private static int compLevel;
+
+    public static class B {
+        public static void test0() {
+        }
+
+        public static void test1() {
+            a.s1 = a.s1 + "1";
+        }
+
+        public static void test2() {
+            a.s1 = a.s1 + "1";
+            a.s2 = a.s2 + "2";
+        }
+
+        public static void test3() {
+            a.s1 = a.s1 + "1";
+            a.s2 = a.s2 + "2";
+            a.s3 = a.s3 + "3";
+        }
+
+        public static void test4() {
+            a.s1 = a.s1 + "1";
+            a.s2 = a.s2 + "2";
+            a.s3 = a.s3 + "3";
+            a.s4 = a.s4 + "4";
+        }
+
+        public static void test5() {
+            a.s1 = a.s1 + "1";
+            a.s2 = a.s2 + "2";
+            a.s3 = a.s3 + "3";
+            a.s4 = a.s4 + "4";
+            a.s5 = a.s5 + "5";
+        }
+
+        public static void test6() {
+            a.s1 = a.s1 + "1";
+            a.s2 = a.s2 + "2";
+            a.s3 = a.s3 + "3";
+            a.s4 = a.s4 + "4";
+            a.s5 = a.s5 + "5";
+            a.s6 = a.s6 + "6";
+        }
+
+        public static void test7() {
+            a.s1 = a.s1 + "1";
+            a.s2 = a.s2 + "2";
+            a.s3 = a.s3 + "3";
+            a.s4 = a.s4 + "4";
+            a.s5 = a.s5 + "5";
+            a.s6 = a.s6 + "6";
+            a.s7 = a.s7 + "7";
+        }
+
+        public static void test8() {
+            a.s1 = a.s1 + "1";
+            a.s2 = a.s2 + "2";
+            a.s3 = a.s3 + "3";
+            a.s4 = a.s4 + "4";
+            a.s5 = a.s5 + "5";
+            a.s6 = a.s6 + "6";
+            a.s7 = a.s7 + "7";
+            a.s8 = a.s8 + "8";
+        }
+
+        public static void test9() {
+            a.s1 = a.s1 + "1";
+            a.s2 = a.s2 + "2";
+            a.s3 = a.s3 + "3";
+            a.s4 = a.s4 + "4";
+            a.s5 = a.s5 + "5";
+            a.s6 = a.s6 + "6";
+            a.s7 = a.s7 + "7";
+            a.s8 = a.s8 + "8";
+            a.s9 = a.s9 + "9";
+        }
+    }
+
+    private static void compileMethods() throws Exception {
+        for (var m : B.class.getDeclaredMethods()) {
+            if (!m.getName().startsWith("test")) {
+                continue;
+            }
+            m.invoke(null);
+            WB.markMethodProfiled(m);
+            WB.enqueueMethodForCompilation(m, compLevel);
+            while (WB.isMethodQueuedForCompilation(m)) {
+                Thread.sleep(100);
+            }
+            if (WB.getMethodCompilationLevel(m) != compLevel) {
+                throw new IllegalStateException("Method " + m + " is not compiled at the compilation level: " + compLevel + ". Got: " + WB.getMethodCompilationLevel(m));
+            }
+        }
+    }
+
+    public static void youngGC() throws Exception {
+        a = null;
+        WB.youngGC();
+    }
+
+    public static void fullGC() throws Exception {
+        // Thread synchronization
+        final ReentrantReadWriteLock rwLock = new ReentrantReadWriteLock();
+        final ReentrantReadWriteLock.ReadLock readLock = rwLock.readLock();
+        final ReentrantReadWriteLock.WriteLock writeLock = rwLock.writeLock();
+        final AtomicBoolean running = new AtomicBoolean(true);
+
+        // Thread 1: GC thread that runs for 1 second with 100ms sleep intervals
+        Thread gcThread = new Thread(() -> {
+            final long startTime = System.currentTimeMillis();
+            final long duration = 1000;
+            try {
+                while (System.currentTimeMillis() - startTime < duration) {
+                    writeLock.lock();
+                    try {
+                        a = new A();
+                        WB.fullGC();
+                    } finally {
+                        writeLock.unlock();
+                    }
+                    Thread.sleep(100);
+                }
+            } catch (InterruptedException e) {
+                // Thread interrupted, exit
+            }
+            running.set(false);
+        });
+
+        // Threads 2-11: Test threads that execute test0() through test9()
+        Thread[] testThreads = new Thread[10];
+        for (int i = 0; i < 10; i++) {
+            final int testIdx = i;
+            testThreads[i] = new Thread(() -> {
+                try {
+                    var method = B.class.getDeclaredMethod("test" + testIdx);
+                    while (running.get()) {
+                        readLock.lock();
+                        try {
+                            method.invoke(null);
+                        } finally {
+                            readLock.unlock();
+                        }
+                    }
+                } catch (Exception e) {
+                    e.printStackTrace();
+                    System.exit(10);
+                }
+            });
+        }
+
+        // Start all threads
+        gcThread.start();
+        for (Thread t : testThreads) {
+            t.start();
+        }
+
+        // Wait for all threads to complete
+        gcThread.join();
+        for (Thread t : testThreads) {
+            t.join();
+        }
+    }
+
+    public static void main(String[] args) throws Exception {
+        if (!Boolean.TRUE.equals(WB.getBooleanVMFlag("UseSingleICacheInvalidation"))) {
+            throw new SkippedException("Skip. Test requires UseSingleICacheInvalidation enabled.");
+        }
+        compLevel = (args[1].equals("C1")) ? 1 : 4;
+        compileMethods();
+        TestDeferredICacheInvalidation.class.getMethod(args[0]).invoke(null);
+    }
+}
diff --git a/test/micro/org/openjdk/bench/vm/gc/GCPatchingNmethodCost.java b/test/micro/org/openjdk/bench/vm/gc/GCPatchingNmethodCost.java
new file mode 100644
index 00000000000..53fa2378ead
--- /dev/null
+++ b/test/micro/org/openjdk/bench/vm/gc/GCPatchingNmethodCost.java
@@ -0,0 +1,206 @@
+/*
+ * Copyright Amazon.com Inc. or its affiliates. All Rights Reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ *
+ */
+
+package org.openjdk.bench.vm.gc;
+
+import java.lang.reflect.Method;
+import java.util.*;
+import java.util.concurrent.TimeUnit;
+
+import org.openjdk.jmh.annotations.Benchmark;
+import org.openjdk.jmh.annotations.BenchmarkMode;
+import org.openjdk.jmh.annotations.CompilerControl;
+import org.openjdk.jmh.annotations.Fork;
+import org.openjdk.jmh.annotations.Level;
+import org.openjdk.jmh.annotations.Mode;
+import org.openjdk.jmh.annotations.Measurement;
+import org.openjdk.jmh.annotations.OutputTimeUnit;
+import org.openjdk.jmh.annotations.Param;
+import org.openjdk.jmh.annotations.Scope;
+import org.openjdk.jmh.annotations.Setup;
+import org.openjdk.jmh.annotations.State;
+import org.openjdk.jmh.annotations.Warmup;
+
+import org.openjdk.bench.util.InMemoryJavaCompiler;
+
+import jdk.test.whitebox.WhiteBox;
+import jdk.test.whitebox.code.NMethod;
+
+/*
+ * Nmethods have OOPs and GC barriers emmedded into their code.
+ * GCs patch them which causes invalidation of nmethods' code.
+ *
+ * This benchmark can be used to estimate the cost of patching
+ * OOPs and GC barriers.
+ *
+ * We create 5000 nmethods which access fields of a class.
+ * We measure the time of different GC cycles to see
+ * the impact of patching nmethods.
+ *
+ * The benchmark parameters are method count and accessed field count.
+ */
+
+@BenchmarkMode(Mode.SingleShotTime)
+@OutputTimeUnit(TimeUnit.MILLISECONDS)
+@State(Scope.Benchmark)
+@Fork(value = 1, jvmArgsAppend = {
+    "-XX:+UnlockDiagnosticVMOptions",
+    "-XX:+UnlockExperimentalVMOptions",
+    "-XX:+WhiteBoxAPI",
+    "-Xbootclasspath/a:lib-test/wb.jar",
+    "-XX:-UseCodeCacheFlushing"
+})
+@Warmup(iterations = 5)
+@Measurement(iterations = 5)
+public class GCPatchingNmethodCost {
+
+    private static final int COMP_LEVEL = 1;
+    private static final String FIELD_USER = "FieldUser";
+
+    public static Fields fields;
+
+    private static TestMethod[] methods = {};
+    private static byte[] BYTE_CODE;
+    private static WhiteBox WB;
+
+    @Param({"5000"})
+    public int methodCount;
+
+    @Param({"0", "2", "4", "8"})
+    public int accessedFieldCount;
+
+    public static class Fields {
+        public String f1;
+        public String f2;
+        public String f3;
+        public String f4;
+        public String f5;
+        public String f6;
+        public String f7;
+        public String f8;
+        public String f9;
+    }
+
+    private static final class TestMethod {
+        private final Method method;
+
+        public TestMethod(Method method) throws Exception {
+            this.method = method;
+            WB.testSetDontInlineMethod(method, true);
+        }
+
+        public void profile() throws Exception {
+            method.invoke(null);
+            WB.markMethodProfiled(method);
+        }
+
+        public void invoke() throws Exception {
+            method.invoke(null);
+        }
+
+        public void compile() throws Exception {
+            WB.enqueueMethodForCompilation(method, COMP_LEVEL);
+            while (WB.isMethodQueuedForCompilation(method)) {
+                Thread.onSpinWait();
+            }
+            if (WB.getMethodCompilationLevel(method) != COMP_LEVEL) {
+                throw new IllegalStateException("Method " + method + " is not compiled at the compilation level: " + COMP_LEVEL + ". Got: " + WB.getMethodCompilationLevel(method));
+            }
+        }
+
+        public NMethod getNMethod() {
+            return NMethod.get(method, false);
+        }
+    }
+
+    private static ClassLoader createClassLoader() {
+        return new ClassLoader() {
+            @Override
+            public Class<?> loadClass(String name) throws ClassNotFoundException {
+                if (!name.equals(FIELD_USER)) {
+                    return super.loadClass(name);
+                }
+
+                return defineClass(name, BYTE_CODE, 0, BYTE_CODE.length);
+            }
+        };
+    }
+
+    private static void createTestMethods(int accessedFieldCount, int count) throws Exception {
+        String javaCode = "public class " + FIELD_USER + " {";
+        String field = GCPatchingNmethodCost.class.getName() + ".fields.f";
+        javaCode += "public static void accessFields() {";
+        for (int i = 1; i <= accessedFieldCount; i++) {
+            javaCode += field + i + "= " + field + i + " + " + i + ";";
+        }
+        javaCode += "}}";
+
+        BYTE_CODE = InMemoryJavaCompiler.compile(FIELD_USER, javaCode);
+
+        fields = new Fields();
+
+        methods = new TestMethod[count];
+        for (int i = 0; i < count; i++) {
+            var cl = createClassLoader().loadClass(FIELD_USER);
+            Method method = cl.getMethod("accessFields");
+            methods[i] = new TestMethod(method);
+            methods[i].profile();
+            methods[i].compile();
+        }
+    }
+
+    private static void initWhiteBox() {
+        WB = WhiteBox.getWhiteBox();
+    }
+
+    @Setup(Level.Trial)
+    public void setupCodeCache() throws Exception {
+        initWhiteBox();
+        createTestMethods(accessedFieldCount, methodCount);
+        System.gc();
+    }
+
+    @Setup(Level.Iteration)
+    public void setupIteration() {
+        fields = new Fields();
+    }
+
+    @Benchmark
+    public void youngGC() throws Exception {
+        fields = null;
+        WB.youngGC();
+    }
+
+    @Benchmark
+    public void fullGC() throws Exception {
+        fields = null;
+        WB.fullGC();
+    }
+
+    @Benchmark
+    public void systemGC() throws Exception {
+        fields = null;
+        System.gc();
+    }
+}

From c267c84ff62e3ed4991a789eaf54c51c41eff12b Mon Sep 17 00:00:00 2001
From: Anton Seoane Ampudia <aseoane@openjdk.org>
Date: Tue, 7 Apr 2026 11:27:18 +0000
Subject: [PATCH 505/655] 8358766: Improve detection of changes to print IGVN
 steps

Reviewed-by: qamai, bmaillard, krk
---
 src/hotspot/share/opto/phaseX.cpp | 8 +++++---
 src/hotspot/share/opto/phaseX.hpp | 2 +-
 2 files changed, 6 insertions(+), 4 deletions(-)

diff --git a/src/hotspot/share/opto/phaseX.cpp b/src/hotspot/share/opto/phaseX.cpp
index 06963eff4cf..0fecc14f31a 100644
--- a/src/hotspot/share/opto/phaseX.cpp
+++ b/src/hotspot/share/opto/phaseX.cpp
@@ -909,9 +909,9 @@ void PhaseIterGVN::verify_step(Node* n) {
   }
 }
 
-void PhaseIterGVN::trace_PhaseIterGVN(Node* n, Node* nn, const Type* oldtype) {
+void PhaseIterGVN::trace_PhaseIterGVN(Node* n, Node* nn, const Type* oldtype, bool progress) {
   const Type* newtype = type_or_null(n);
-  if (nn != n || oldtype != newtype) {
+  if (progress) {
     C->print_method(PHASE_AFTER_ITER_GVN_STEP, 5, n);
   }
   if (TraceIterativeGVN) {
@@ -1092,7 +1092,9 @@ bool PhaseIterGVN::drain_worklist() {
       NOT_PRODUCT(const Type* oldtype = type_or_null(n));
       // Do the transformation
       DEBUG_ONLY(int live_nodes_before = C->live_nodes();)
+      NOT_PRODUCT(uint progress_before = made_progress();)
       Node* nn = transform_old(n);
+      NOT_PRODUCT(bool progress = (made_progress() - progress_before) > 0;)
       DEBUG_ONLY(int live_nodes_after = C->live_nodes();)
       // Ensure we did not increase the live node count with more than
       // max_live_nodes_increase_per_iteration during the call to transform_old.
@@ -1101,7 +1103,7 @@ bool PhaseIterGVN::drain_worklist() {
              "excessive live node increase in single iteration of IGVN: %d "
              "(should be at most %d)",
              increase, max_live_nodes_increase_per_iteration);
-      NOT_PRODUCT(trace_PhaseIterGVN(n, nn, oldtype);)
+      NOT_PRODUCT(trace_PhaseIterGVN(n, nn, oldtype, progress);)
     } else if (!n->is_top()) {
       remove_dead_node(n, NodeOrigin::Graph);
     }
diff --git a/src/hotspot/share/opto/phaseX.hpp b/src/hotspot/share/opto/phaseX.hpp
index cef273ff3df..014d16f92f6 100644
--- a/src/hotspot/share/opto/phaseX.hpp
+++ b/src/hotspot/share/opto/phaseX.hpp
@@ -548,7 +548,7 @@ public:
 #endif
 
 #ifndef PRODUCT
-  void trace_PhaseIterGVN(Node* n, Node* nn, const Type* old_type);
+  void trace_PhaseIterGVN(Node* n, Node* nn, const Type* old_type, bool progress);
   void init_verifyPhaseIterGVN();
   void verify_PhaseIterGVN(bool deep_revisit_converged);
 #endif

From 69c4a211ee0a1a1701f6aa61c95e2ce3f2bd8a6d Mon Sep 17 00:00:00 2001
From: Stefan Karlsson <stefank@openjdk.org>
Date: Tue, 7 Apr 2026 11:30:23 +0000
Subject: [PATCH 506/655] 8381561: G1: Cleanup patch in preparation for eager
 reclamation of flat arrays

Reviewed-by: tschatzl, ayang, iwalulya
---
 src/hotspot/share/gc/g1/g1ConcurrentMark.cpp  | 18 +++-----
 src/hotspot/share/gc/g1/g1ConcurrentMark.hpp  |  7 +--
 .../share/gc/g1/g1ConcurrentMark.inline.hpp   | 44 +++++++++----------
 3 files changed, 31 insertions(+), 38 deletions(-)

diff --git a/src/hotspot/share/gc/g1/g1ConcurrentMark.cpp b/src/hotspot/share/gc/g1/g1ConcurrentMark.cpp
index 84a0b7588ef..4c646c82b8a 100644
--- a/src/hotspot/share/gc/g1/g1ConcurrentMark.cpp
+++ b/src/hotspot/share/gc/g1/g1ConcurrentMark.cpp
@@ -2341,20 +2341,16 @@ void G1CMTask::drain_local_queue(bool partially) {
   }
 }
 
-size_t G1CMTask::start_partial_array_processing(oop obj) {
-  assert(should_be_sliced(obj), "Must be an array object %d and large %zu", obj->is_objArray(), obj->size());
-
-  objArrayOop obj_array = objArrayOop(obj);
-  size_t array_length = obj_array->length();
-
-  size_t initial_chunk_size = _partial_array_splitter.start(_task_queue, obj_array, nullptr, array_length);
+size_t G1CMTask::start_partial_array_processing(objArrayOop obj) {
+  assert(obj->length() >= (int)ObjArrayMarkingStride, "Must be a large array object %d", obj->length());
 
   // Mark objArray klass metadata
-  if (_cm_oop_closure->do_metadata()) {
-    _cm_oop_closure->do_klass(obj_array->klass());
-  }
+  process_klass(obj->klass());
 
-  process_array_chunk(obj_array, 0, initial_chunk_size);
+  size_t array_length = obj->length();
+  size_t initial_chunk_size = _partial_array_splitter.start(_task_queue, obj, nullptr, array_length);
+
+  process_array_chunk(obj, 0, initial_chunk_size);
 
   // Include object header size
   return objArrayOopDesc::object_size(checked_cast<int>(initial_chunk_size));
diff --git a/src/hotspot/share/gc/g1/g1ConcurrentMark.hpp b/src/hotspot/share/gc/g1/g1ConcurrentMark.hpp
index 7aa93947204..f9287f673d2 100644
--- a/src/hotspot/share/gc/g1/g1ConcurrentMark.hpp
+++ b/src/hotspot/share/gc/g1/g1ConcurrentMark.hpp
@@ -844,12 +844,10 @@ private:
   // mark bitmap scan, and so needs to be pushed onto the mark stack.
   bool is_below_finger(oop obj, HeapWord* global_finger) const;
 
-  template<bool scan> void process_grey_task_entry(G1TaskQueueEntry task_entry, bool stolen);
-
   static bool should_be_sliced(oop obj);
   // Start processing the given objArrayOop by first pushing its continuations and
   // then scanning the first chunk including the header.
-  size_t start_partial_array_processing(oop obj);
+  size_t start_partial_array_processing(objArrayOop obj);
   // Process the given continuation. Returns the number of words scanned.
   size_t process_partial_array(const G1TaskQueueEntry& task, bool stolen);
   // Apply the closure to the given range of elements in the objArray.
@@ -918,6 +916,9 @@ public:
   template <class T>
   inline bool deal_with_reference(T* p);
 
+  // Scan the klass and visit its children.
+  inline void process_klass(Klass* klass);
+
   // Scans an object and visits its children.
   inline void process_entry(G1TaskQueueEntry task_entry, bool stolen);
 
diff --git a/src/hotspot/share/gc/g1/g1ConcurrentMark.inline.hpp b/src/hotspot/share/gc/g1/g1ConcurrentMark.inline.hpp
index 21167d5cae9..094f4dca994 100644
--- a/src/hotspot/share/gc/g1/g1ConcurrentMark.inline.hpp
+++ b/src/hotspot/share/gc/g1/g1ConcurrentMark.inline.hpp
@@ -106,9 +106,27 @@ inline void G1CMMarkStack::iterate(Fn fn) const {
 }
 #endif
 
+inline void G1CMTask::process_klass(Klass* klass) {
+  _cm_oop_closure->do_klass(klass);
+}
+
 // It scans an object and visits its children.
 inline void G1CMTask::process_entry(G1TaskQueueEntry task_entry, bool stolen) {
-  process_grey_task_entry<true>(task_entry, stolen);
+  assert(task_entry.is_partial_array_state() || _mark_bitmap->is_marked(cast_from_oop<HeapWord*>(task_entry.to_oop())),
+         "Any stolen object should be a slice or marked");
+
+  if (task_entry.is_partial_array_state()) {
+    _words_scanned += process_partial_array(task_entry, stolen);
+  } else {
+    oop obj = task_entry.to_oop();
+    if (should_be_sliced(obj)) {
+      _words_scanned += start_partial_array_processing(objArrayOop(obj));
+    } else {
+      _words_scanned += obj->oop_iterate_size(_cm_oop_closure);
+    }
+  }
+
+  check_limits();
 }
 
 inline void G1CMTask::push(G1TaskQueueEntry task_entry) {
@@ -160,27 +178,6 @@ inline bool G1CMTask::is_below_finger(oop obj, HeapWord* global_finger) const {
   return objAddr < global_finger;
 }
 
-template<bool scan>
-inline void G1CMTask::process_grey_task_entry(G1TaskQueueEntry task_entry, bool stolen) {
-  assert(scan || (!task_entry.is_partial_array_state() && task_entry.to_oop()->is_typeArray()), "Skipping scan of grey non-typeArray");
-  assert(task_entry.is_partial_array_state() || _mark_bitmap->is_marked(cast_from_oop<HeapWord*>(task_entry.to_oop())),
-         "Any stolen object should be a slice or marked");
-
-  if (scan) {
-    if (task_entry.is_partial_array_state()) {
-      _words_scanned += process_partial_array(task_entry, stolen);
-    } else {
-      oop obj = task_entry.to_oop();
-      if (should_be_sliced(obj)) {
-        _words_scanned += start_partial_array_processing(obj);
-      } else {
-        _words_scanned += obj->oop_iterate_size(_cm_oop_closure);
-      }
-    }
-  }
-  check_limits();
-}
-
 inline bool G1CMTask::should_be_sliced(oop obj) {
   return obj->is_objArray() && ((objArrayOop)obj)->length() >= (int)ObjArrayMarkingStride;
 }
@@ -272,7 +269,6 @@ inline bool G1CMTask::make_reference_grey(oop obj) {
   // be pushed on the stack. So, some duplicate work, but no
   // correctness problems.
   if (is_below_finger(obj, global_finger)) {
-    G1TaskQueueEntry entry(obj);
     if (obj->is_typeArray()) {
       // Immediately process arrays of primitive types, rather
       // than pushing on the mark stack.  This keeps us from
@@ -284,8 +280,8 @@ inline bool G1CMTask::make_reference_grey(oop obj) {
       // by only doing a bookkeeping update and avoiding the
       // actual scan of the object - a typeArray contains no
       // references, and the metadata is built-in.
-      process_grey_task_entry<false>(entry, false /* stolen */);
     } else {
+      G1TaskQueueEntry entry(obj);
       push(entry);
     }
   }

From 547ebe7236fee5b85888a808922e33c03ee3df23 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Daniel=20Jeli=C5=84ski?= <djelinski@openjdk.org>
Date: Tue, 7 Apr 2026 11:48:01 +0000
Subject: [PATCH 507/655] 8381316: HttpClient / Http3: poor exception messages
 on SSL handshake errors

Reviewed-by: dfuchs
---
 .../sun/security/ssl/QuicTLSEngineImpl.java   |  4 +-
 .../net/http/quic/TerminationCause.java       |  5 +-
 .../net/httpclient/InvalidSSLContextTest.java | 62 +++++++++++--------
 3 files changed, 42 insertions(+), 29 deletions(-)

diff --git a/src/java.base/share/classes/sun/security/ssl/QuicTLSEngineImpl.java b/src/java.base/share/classes/sun/security/ssl/QuicTLSEngineImpl.java
index 74975fc1e5b..b5f1eff179c 100644
--- a/src/java.base/share/classes/sun/security/ssl/QuicTLSEngineImpl.java
+++ b/src/java.base/share/classes/sun/security/ssl/QuicTLSEngineImpl.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2021, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2021, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -660,7 +660,7 @@ public final class QuicTLSEngineImpl implements QuicTLSEngine, SSLTransport {
             }
             Alert alert = ((QuicEngineOutputRecord)
                     conContext.outputRecord).getAlert();
-            throw new QuicTransportException(alert.description, keySpace, 0,
+            throw new QuicTransportException(e.getMessage(), keySpace, 0,
                     BASE_CRYPTO_ERROR + alert.id, e);
         } catch (IOException e) {
             throw new RuntimeException(e);
diff --git a/src/java.net.http/share/classes/jdk/internal/net/http/quic/TerminationCause.java b/src/java.net.http/share/classes/jdk/internal/net/http/quic/TerminationCause.java
index 9e441cf7873..df8c229a000 100644
--- a/src/java.net.http/share/classes/jdk/internal/net/http/quic/TerminationCause.java
+++ b/src/java.net.http/share/classes/jdk/internal/net/http/quic/TerminationCause.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2024, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2024, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -128,6 +128,9 @@ public abstract sealed class TerminationCause {
                     ? new IOException("connection terminated")
                     : new IOException(fallbackExceptionMsg);
         } else if (original instanceof QuicTransportException qte) {
+            if (qte.getCause() instanceof IOException ioe) {
+                return ioe;
+            }
             return new IOException(qte.getMessage());
         } else if (original instanceof IOException ioe) {
             return ioe;
diff --git a/test/jdk/java/net/httpclient/InvalidSSLContextTest.java b/test/jdk/java/net/httpclient/InvalidSSLContextTest.java
index 0027a7956d5..bbbd1e486ca 100644
--- a/test/jdk/java/net/httpclient/InvalidSSLContextTest.java
+++ b/test/jdk/java/net/httpclient/InvalidSSLContextTest.java
@@ -23,10 +23,12 @@
 
 /*
  * @test
+ * @bug 8381316
  * @summary Test to ensure the HTTP client throws an appropriate SSL exception
  *          when SSL context is not valid.
- * @library /test/lib
+ * @library /test/lib /test/jdk/java/net/httpclient/lib
  * @build jdk.test.lib.net.SimpleSSLContext
+ *        jdk.httpclient.test.lib.common.HttpServerAdapters
  * @run junit/othervm -Djdk.internal.httpclient.debug=true InvalidSSLContextTest
  */
 
@@ -44,14 +46,18 @@ import javax.net.ssl.SSLServerSocket;
 import javax.net.ssl.SSLSocket;
 import java.net.http.HttpClient;
 import java.net.http.HttpClient.Version;
+import java.net.http.HttpOption;
 import java.net.http.HttpRequest;
 import java.net.http.HttpResponse;
 import java.net.http.HttpResponse.BodyHandlers;
+
+import jdk.httpclient.test.lib.common.HttpServerAdapters.HttpTestServer;
 import jdk.test.lib.net.SimpleSSLContext;
 
 import static java.net.http.HttpClient.Builder.NO_PROXY;
-import static java.net.http.HttpClient.Version.HTTP_1_1;
-import static java.net.http.HttpClient.Version.HTTP_2;
+import static java.net.http.HttpClient.Version.*;
+import static java.net.http.HttpOption.Http3DiscoveryMode.HTTP_3_URI_ONLY;
+import static jdk.httpclient.test.lib.common.HttpServerAdapters.createClientBuilderForH3;
 
 import org.junit.jupiter.api.AfterAll;
 import org.junit.jupiter.api.Assertions;
@@ -64,25 +70,29 @@ public class InvalidSSLContextTest {
     private static final SSLContext sslContext = SimpleSSLContext.findSSLContext();
     static volatile SSLServerSocket sslServerSocket;
     static volatile String uri;
+    private static HttpTestServer h3Server;
+    private static String h3Uri;
 
     public static Object[][] versions() {
         return new Object[][]{
-                { HTTP_1_1 },
-                { HTTP_2   }
+                { HTTP_1_1, uri },
+                { HTTP_2  , uri },
+                { HTTP_3  , h3Uri }
         };
     }
 
     @ParameterizedTest
     @MethodSource("versions")
-    public void testSync(Version version) throws Exception {
+    public void testSync(Version version, String uri) throws Exception {
         // client-side uses a different context to that of the server-side
-        HttpClient client = HttpClient.newBuilder()
+        HttpClient client = createClientBuilderForH3()
                 .proxy(NO_PROXY)
                 .sslContext(SSLContext.getDefault())
                 .build();
 
         HttpRequest request = HttpRequest.newBuilder(URI.create(uri))
                 .version(version)
+                .setOption(HttpOption.H3_DISCOVERY, HTTP_3_URI_ONLY)
                 .build();
 
         try {
@@ -90,21 +100,22 @@ public class InvalidSSLContextTest {
             Assertions.fail("UNEXPECTED response" + response);
         } catch (IOException ex) {
             System.out.println("Caught expected: " + ex);
-            assertExceptionOrCause(SSLException.class, ex);
+            assertException(SSLException.class, ex);
         }
     }
 
     @ParameterizedTest
     @MethodSource("versions")
-    public void testAsync(Version version) throws Exception {
+    public void testAsync(Version version, String uri) throws Exception {
         // client-side uses a different context to that of the server-side
-        HttpClient client = HttpClient.newBuilder()
+        HttpClient client = createClientBuilderForH3()
                 .proxy(NO_PROXY)
                 .sslContext(SSLContext.getDefault())
                 .build();
 
         HttpRequest request = HttpRequest.newBuilder(URI.create(uri))
                 .version(version)
+                .setOption(HttpOption.H3_DISCOVERY, HTTP_3_URI_ONLY)
                 .build();
 
         assertExceptionally(SSLException.class,
@@ -123,26 +134,20 @@ public class InvalidSSLContextTest {
                 if (cause == null) {
                     Assertions.fail("Unexpected null cause: " + error);
                 }
-                assertExceptionOrCause(clazz, cause);
+                System.out.println("Caught expected: " + cause);
+                assertException(clazz, cause);
             } else {
-                assertExceptionOrCause(clazz, error);
+                System.out.println("Caught expected: " + error);
+                assertException(clazz, error);
             }
             return null;
         }).join();
     }
 
-    static void assertExceptionOrCause(Class<? extends Throwable> clazz, Throwable t) {
-        if (t == null) {
-            Assertions.fail("Expected " + clazz + ", caught nothing");
-        }
-        final Throwable original = t;
-        do {
-            if (clazz.isInstance(t)) {
-                return; // found
-            }
-        } while ((t = t.getCause()) != null);
-        original.printStackTrace(System.out);
-        Assertions.fail("Expected " + clazz + "in " + original);
+    static void assertException(Class<? extends Throwable> clazz, Throwable t) {
+        Assertions.assertInstanceOf(clazz, t);
+        Assertions.assertTrue(t.getMessage().contains("unable to find valid certification path to requested target"),
+                "Unexpected exception message: " + t);
     }
 
     @BeforeAll
@@ -159,7 +164,7 @@ public class InvalidSSLContextTest {
         Thread t = new Thread("SSL-Server-Side") {
             @Override
             public void run() {
-                while (true) {
+                while (!sslServerSocket.isClosed()) {
                     try {
                         SSLSocket s = (SSLSocket) sslServerSocket.accept();
                         System.out.println("SERVER: accepted: " + s);
@@ -177,7 +182,6 @@ public class InvalidSSLContextTest {
                         if (!sslServerSocket.isClosed()) {
                             throw new UncheckedIOException(e);
                         }
-                        break;
                     } catch (InterruptedException ie) {
                         throw new RuntimeException(ie);
                     }
@@ -185,10 +189,16 @@ public class InvalidSSLContextTest {
             }
         };
         t.start();
+
+        h3Server = HttpTestServer.create(HTTP_3_URI_ONLY, sslContext);
+        h3Server.addHandler((exchange) -> exchange.sendResponseHeaders(200, 0), "/hello");
+        h3Server.start();
+        h3Uri = "https://" + h3Server.serverAuthority() + "/hello";
     }
 
     @AfterAll
     public static void teardown() throws Exception {
+        h3Server.stop();
         sslServerSocket.close();
     }
 }

From 34ac926d9ccc3256112340355ea587a0f5d63a1c Mon Sep 17 00:00:00 2001
From: Daisuke Yamazaki <dyama@openjdk.org>
Date: Tue, 7 Apr 2026 12:23:03 +0000
Subject: [PATCH 508/655] 8378157: Section hyperlink in doc/testing.md refers
 to building.html instead of building.md

Reviewed-by: erikj, iris, ayang
---
 doc/testing.html | 7 ++++---
 doc/testing.md   | 4 ++--
 2 files changed, 6 insertions(+), 5 deletions(-)

diff --git a/doc/testing.html b/doc/testing.html
index 195153c8612..c8d0b928bb0 100644
--- a/doc/testing.html
+++ b/doc/testing.html
@@ -284,9 +284,10 @@ possible, or if you want to use a fully qualified test descriptor, add
 <h3 id="gtest">Gtest</h3>
 <p><strong>Note:</strong> To be able to run the Gtest suite, you need to
 configure your build to be able to find a proper version of the gtest
-source. For details, see the section <a
-href="building.html#running-tests">"Running Tests" in the build
-documentation</a>.</p>
+source. For details, see the section <strong>"Running Tests" in the
+build documentation</strong> (<a
+href="building.html#running-tests">html</a>, <a
+href="building.md#running-tests">markdown</a>).</p>
 <p>Since the Hotspot Gtest suite is so quick, the default is to run all
 tests. This is specified by just <code>gtest</code>, or as a fully
 qualified test descriptor <code>gtest:all</code>.</p>
diff --git a/doc/testing.md b/doc/testing.md
index d0e54aab02b..5f70f2796ad 100644
--- a/doc/testing.md
+++ b/doc/testing.md
@@ -198,8 +198,8 @@ use a fully qualified test descriptor, add `jtreg:`, e.g.
 
 **Note:** To be able to run the Gtest suite, you need to configure your build
 to be able to find a proper version of the gtest source. For details, see the
-section ["Running Tests" in the build
-documentation](building.html#running-tests).
+section **"Running Tests" in the build
+documentation** ([html](building.html#running-tests), [markdown](building.md#running-tests)).
 
 Since the Hotspot Gtest suite is so quick, the default is to run all tests.
 This is specified by just `gtest`, or as a fully qualified test descriptor

From b297f59dc9f8eca19d54b5966f8ced6c9b278538 Mon Sep 17 00:00:00 2001
From: Vladimir Kozlov <kvn@openjdk.org>
Date: Tue, 7 Apr 2026 14:01:55 +0000
Subject: [PATCH 509/655] 8381659: Determine actual jump instruction when AOT
 and JITed code are used

Reviewed-by: dlong, iveresov
---
 src/hotspot/cpu/aarch64/compiledIC_aarch64.cpp     | 13 +++++++++----
 src/hotspot/cpu/aarch64/macroAssembler_aarch64.cpp |  5 ++++-
 2 files changed, 13 insertions(+), 5 deletions(-)

diff --git a/src/hotspot/cpu/aarch64/compiledIC_aarch64.cpp b/src/hotspot/cpu/aarch64/compiledIC_aarch64.cpp
index 6fe3315014b..640cd495383 100644
--- a/src/hotspot/cpu/aarch64/compiledIC_aarch64.cpp
+++ b/src/hotspot/cpu/aarch64/compiledIC_aarch64.cpp
@@ -89,16 +89,21 @@ void CompiledDirectCall::set_to_interpreted(const methodHandle& callee, address
   NativeMovConstReg* method_holder
     = nativeMovConstReg_at(stub + NativeInstruction::instruction_size);
 
+  // In AOT "production" run we have mixture of AOTed and normal JITed code.
+  // Static call stub in AOTed nmethod always has far jump.
+  // Normal JITed nmethod may have short or far jump depending on distance.
+  // Determine actual jump instruction we have in code.
+  address next_instr = method_holder->next_instruction_address();
+  bool is_general_jump = nativeInstruction_at(next_instr)->is_general_jump();
+
 #ifdef ASSERT
-  NativeJump* jump = MacroAssembler::codestub_branch_needs_far_jump()
-                         ? nativeGeneralJump_at(method_holder->next_instruction_address())
-                         : nativeJump_at(method_holder->next_instruction_address());
+  NativeJump* jump = is_general_jump ? nativeGeneralJump_at(next_instr) : nativeJump_at(next_instr);
   verify_mt_safe(callee, entry, method_holder, jump);
 #endif
 
   // Update stub.
   method_holder->set_data((intptr_t)callee());
-  MacroAssembler::pd_patch_instruction(method_holder->next_instruction_address(), entry);
+  MacroAssembler::pd_patch_instruction(next_instr, entry);
   ICache::invalidate_range(stub, to_interp_stub_size());
   // Update jump to call.
   set_destination_mt_safe(stub);
diff --git a/src/hotspot/cpu/aarch64/macroAssembler_aarch64.cpp b/src/hotspot/cpu/aarch64/macroAssembler_aarch64.cpp
index ebbc35ce20a..b5e15402941 100644
--- a/src/hotspot/cpu/aarch64/macroAssembler_aarch64.cpp
+++ b/src/hotspot/cpu/aarch64/macroAssembler_aarch64.cpp
@@ -952,7 +952,10 @@ void MacroAssembler::emit_static_call_stub() {
 }
 
 int MacroAssembler::static_call_stub_size() {
-  if (!codestub_branch_needs_far_jump()) {
+  // During AOT production run AOT and JIT compiled code
+  // are used at the same time. We need this size
+  // to be the same for both types of code.
+  if (!codestub_branch_needs_far_jump() && !AOTCodeCache::is_on_for_use()) {
     // isb; movk; movz; movz; b
     return 5 * NativeInstruction::instruction_size;
   }

From da16b409c3784d1ff5cd3076c1aebfe7c76664cc Mon Sep 17 00:00:00 2001
From: Vladimir Kozlov <kvn@openjdk.org>
Date: Tue, 7 Apr 2026 14:18:01 +0000
Subject: [PATCH 510/655] 8381656: Take into account trampoline stub size and
 its relocations on Aarch64

Reviewed-by: dlong
---
 src/hotspot/cpu/aarch64/aarch64.ad | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/src/hotspot/cpu/aarch64/aarch64.ad b/src/hotspot/cpu/aarch64/aarch64.ad
index 05b2514a456..53fa4e3066c 100644
--- a/src/hotspot/cpu/aarch64/aarch64.ad
+++ b/src/hotspot/cpu/aarch64/aarch64.ad
@@ -1182,12 +1182,12 @@ class CallStubImpl {
  public:
   // Size of call trampoline stub.
   static uint size_call_trampoline() {
-    return 0; // no call trampolines on this platform
+    return MacroAssembler::max_trampoline_stub_size();
   }
 
   // number of relocations needed by a call trampoline stub
   static uint reloc_call_trampoline() {
-    return 0; // no call trampolines on this platform
+    return 5; // metadata; call dest; trampoline address; trampoline destination; trampoline_owner_metadata
   }
 };
 

From 67c6990f9aaa54246c2e816e1ff1f0af15c71486 Mon Sep 17 00:00:00 2001
From: Daisuke Yamazaki <dyama@openjdk.org>
Date: Tue, 7 Apr 2026 16:30:17 +0000
Subject: [PATCH 511/655] 8344212: Bring back @see GraphicsConfiguration to
 MouseInfo.getPointerInfo()

Reviewed-by: aivanov, dmarkov, serb
---
 src/java.desktop/share/classes/java/awt/MouseInfo.java | 3 ++-
 1 file changed, 2 insertions(+), 1 deletion(-)

diff --git a/src/java.desktop/share/classes/java/awt/MouseInfo.java b/src/java.desktop/share/classes/java/awt/MouseInfo.java
index 6b913adf06e..7a30243b06c 100644
--- a/src/java.desktop/share/classes/java/awt/MouseInfo.java
+++ b/src/java.desktop/share/classes/java/awt/MouseInfo.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -58,6 +58,7 @@ public class MouseInfo {
      *
      * @throws HeadlessException if GraphicsEnvironment.isHeadless() returns true
      * @return    location of the mouse pointer
+     * @see       GraphicsConfiguration
      * @since     1.5
      */
     public static PointerInfo getPointerInfo() throws HeadlessException {

From f6baab704e868386c66b79072ae05d2b24bf8632 Mon Sep 17 00:00:00 2001
From: Jan Lahoda <jlahoda@openjdk.org>
Date: Wed, 8 Apr 2026 06:23:42 +0000
Subject: [PATCH 512/655] 8379550: Bad bytecode offset after JDK-8371155

Reviewed-by: vromero, abimpoudis
---
 .../sun/tools/javac/code/TypeAnnotations.java |   8 +
 .../TypeAnnotationsOnVariables.java           | 245 ++++++++++++++++--
 2 files changed, 237 insertions(+), 16 deletions(-)

diff --git a/src/jdk.compiler/share/classes/com/sun/tools/javac/code/TypeAnnotations.java b/src/jdk.compiler/share/classes/com/sun/tools/javac/code/TypeAnnotations.java
index 0393ed79897..452d15ed219 100644
--- a/src/jdk.compiler/share/classes/com/sun/tools/javac/code/TypeAnnotations.java
+++ b/src/jdk.compiler/share/classes/com/sun/tools/javac/code/TypeAnnotations.java
@@ -154,6 +154,14 @@ public class TypeAnnotations {
                 } else {
                     pos.push(env.enclMethod);
                 }
+                Env<AttrContext> env1 = env;
+                while (env1 != null && !env1.tree.hasTag(Tag.CLASSDEF)) {
+                    if (env1.tree instanceof JCLambda l) {
+                        pos.currentLambda = l;
+                        break;
+                    }
+                    env1 = env1.next;
+                }
                 pos.scan(tree);
             } finally {
                 log.useSource(oldSource);
diff --git a/test/langtools/tools/javac/annotations/typeAnnotations/TypeAnnotationsOnVariables.java b/test/langtools/tools/javac/annotations/typeAnnotations/TypeAnnotationsOnVariables.java
index 2e68e18f8f7..e5a1e5650d3 100644
--- a/test/langtools/tools/javac/annotations/typeAnnotations/TypeAnnotationsOnVariables.java
+++ b/test/langtools/tools/javac/annotations/typeAnnotations/TypeAnnotationsOnVariables.java
@@ -23,15 +23,16 @@
 
 /*
  * @test
- * @bug 8371155
+ * @bug 8371155 8379550
  * @summary Verify type annotations on local-like variables are propagated to
  *          their types at an appropriate time.
  * @library /tools/lib
  * @modules
  *      jdk.compiler/com.sun.tools.javac.api
  *      jdk.compiler/com.sun.tools.javac.main
+ *      jdk.jdeps/com.sun.tools.javap
  * @build toolbox.ToolBox toolbox.JavacTask
- * @run main TypeAnnotationsOnVariables
+ * @run junit TypeAnnotationsOnVariables
  */
 
 import com.sun.source.tree.LambdaExpressionTree;
@@ -41,31 +42,44 @@ import com.sun.source.util.TaskEvent;
 import com.sun.source.util.TaskListener;
 import com.sun.source.util.TreePathScanner;
 import com.sun.source.util.Trees;
+import java.io.IOException;
+import java.lang.classfile.Attributes;
+import java.lang.classfile.ClassFile;
+import java.lang.classfile.ClassModel;
+import java.lang.classfile.MethodModel;
+import java.lang.classfile.attribute.RuntimeInvisibleTypeAnnotationsAttribute;
+import java.lang.classfile.constantpool.ConstantPool;
+import java.lang.classfile.constantpool.Utf8Entry;
 import java.nio.file.Files;
 import java.nio.file.Path;
-import java.nio.file.Paths;
 import java.util.ArrayList;
+import java.util.HashMap;
 import java.util.List;
+import java.util.Map;
+import java.util.Optional;
+import java.util.regex.Matcher;
+import java.util.regex.Pattern;
 import java.util.stream.Collectors;
 import javax.lang.model.type.TypeKind;
 import javax.lang.model.type.TypeMirror;
 import javax.lang.model.type.UnionType;
+import static org.junit.jupiter.api.Assertions.*;
+import org.junit.jupiter.api.BeforeEach;
+import org.junit.jupiter.api.Test;
+import org.junit.jupiter.api.TestInfo;
 import toolbox.JavacTask;
+import toolbox.JavapTask;
+import toolbox.Task;
 import toolbox.ToolBox;
 
 public class TypeAnnotationsOnVariables {
 
-    public static void main(String... args) throws Exception {
-        new TypeAnnotationsOnVariables().run();
-    }
+    private static final Pattern CP_REFERENCE = Pattern.compile("#([1-9][0-9]*)");
+    final ToolBox tb = new ToolBox();
+    Path base;
 
-    ToolBox tb = new ToolBox();
-
-    void run() throws Exception {
-        typeAnnotationInConstantExpressionFieldInit(Paths.get("."));
-    }
-
-    void typeAnnotationInConstantExpressionFieldInit(Path base) throws Exception {
+    @Test
+    void typeAnnotationInConstantExpressionFieldInit() throws Exception {
         Path src = base.resolve("src");
         Path classes = base.resolve("classes");
         tb.writeJavaFiles(src,
@@ -203,9 +217,208 @@ public class TypeAnnotationsOnVariables {
     }
 
     static String treeToString(Tree tree) {
-        if (tree.toString().contains("\n")) {
-            System.err.println("!!!");
-        }
         return String.valueOf(tree).replaceAll("\\R", " ");
     }
+
+    @Test
+    void properPathForLocalVarsInLambdas() throws Exception {
+        Path src = base.resolve("src");
+        Path classes = base.resolve("classes");
+        tb.writeJavaFiles(src,
+                          """
+                          import java.lang.annotation.ElementType;
+                          import java.lang.annotation.Target;
+                          import java.util.function.Supplier;
+
+                          class Test {
+                              @Target(ElementType.TYPE_USE)
+                              @interface TypeAnno { }
+
+                              void o() {
+                                  Runnable r = () -> {
+                                      @TypeAnno long test1 = 0;
+                                      while (true) {
+                                          @TypeAnno long test2 = 0;
+                                          System.err.println(test2);
+                                          try (@TypeAnno AutoCloseable ac = null) {
+                                              System.err.println(ac);
+                                          } catch (@TypeAnno Exception e1) {
+                                              System.err.println(e1);
+                                          }
+                                          try {
+                                              "".length();
+                                          } catch (@TypeAnno final Exception e2) {
+                                              System.err.println(e2);
+                                          }
+                                          try {
+                                              "".length();
+                                          } catch (@TypeAnno IllegalStateException | @TypeAnno NullPointerException | IllegalArgumentException e3) {
+                                              System.err.println(e3);
+                                          }
+                                          Runnable r2 = () -> {
+                                              @TypeAnno long test3 = 0;
+                                              while (true) {
+                                                  @TypeAnno long test4 = 0;
+                                                  System.err.println(test4);
+                                              }
+                                          };
+                                          Object o = null;
+                                          if (o instanceof @TypeAnno String s) {
+                                              System.err.println(s);
+                                          }
+                                      }
+                                  };
+                              }
+                              void lambdaInClass() {
+                                  class C {
+                                      Runnable r = () -> {
+                                          @TypeAnno long test1 = 0;
+                                          System.err.println(test1);
+                                      };
+                                  }
+                              }
+                              void classInLambda() {
+                                  Runnable r = () -> {
+                                      class C {
+                                          void method() {
+                                              @TypeAnno long test1 = 0;
+                                              System.err.println(test1);
+                                          }
+                                      }
+                                  };
+                              }
+                          }
+                          """);
+        Files.createDirectories(classes);
+        new JavacTask(tb)
+                .options("-d", classes.toString())
+                .files(tb.findJavaFiles(src))
+                .run()
+                .writeAll();
+
+        Path testClass = classes.resolve("Test.class");
+        TestClassDesc testClassDesc = TestClassDesc.create(testClass);
+        MethodModel oMethod = singletonValue(testClassDesc.name2Method().get("o"));
+        var oTypeAnnos = getAnnotations(oMethod);
+        assertFalse(oTypeAnnos.isPresent(), () -> oTypeAnnos.toString());
+
+        checkTypeAnnotations(testClassDesc,
+                             "lambda$o$0",
+                             "        0: LTest$TypeAnno;(): LOCAL_VARIABLE, {start_pc=2, length=151, index=0}",
+                             "          Test$TypeAnno",
+                             "        1: LTest$TypeAnno;(): LOCAL_VARIABLE, {start_pc=4, length=146, index=2}",
+                             "          Test$TypeAnno",
+                             "        2: LTest$TypeAnno;(): RESOURCE_VARIABLE, {start_pc=14, length=52, index=4}",
+                             "          Test$TypeAnno",
+                             "        3: LTest$TypeAnno;(): EXCEPTION_PARAMETER, exception_index=2",
+                             "          Test$TypeAnno",
+                             "        4: LTest$TypeAnno;(): EXCEPTION_PARAMETER, exception_index=3",
+                             "          Test$TypeAnno",
+                             "        5: LTest$TypeAnno;(): EXCEPTION_PARAMETER, exception_index=4",
+                             "          Test$TypeAnno",
+                             "        6: LTest$TypeAnno;(): EXCEPTION_PARAMETER, exception_index=5",
+                             "          Test$TypeAnno",
+                             "        7: LTest$TypeAnno;(): LOCAL_VARIABLE, {start_pc=142, length=8, index=6}",
+                             "          Test$TypeAnno");
+
+        checkTypeAnnotations(testClassDesc,
+                             "lambda$o$1",
+                             "        0: LTest$TypeAnno;(): LOCAL_VARIABLE, {start_pc=2, length=12, index=0}",
+                             "          Test$TypeAnno",
+                             "        1: LTest$TypeAnno;(): LOCAL_VARIABLE, {start_pc=4, length=7, index=2}",
+                             "          Test$TypeAnno");
+
+        checkTypeAnnotations(testClassDesc,
+                             "lambda$classInLambda$0");
+
+        checkTypeAnnotations(TestClassDesc.create(classes.resolve("Test$1C.class")),
+                             "lambda$new$0",
+                             "        0: LTest$TypeAnno;(): LOCAL_VARIABLE, {start_pc=2, length=8, index=0}",
+                             "          Test$TypeAnno");
+    }
+
+    private void checkTypeAnnotations(TestClassDesc testClassDesc,
+                                      String lambdaMethodName,
+                                      String... expectedEntries) throws IOException {
+        MethodModel lambdaMethod = singletonValue(testClassDesc.name2Method().get(lambdaMethodName));
+        var lambdaTypeAnnos = getAnnotations(lambdaMethod);
+        if (expectedEntries.length == 0) {
+            assertFalse(lambdaTypeAnnos.isPresent(), () -> lambdaTypeAnnos.toString());
+        } else {
+            assertTrue(lambdaTypeAnnos.isPresent(), () -> lambdaTypeAnnos.toString());
+            assertEquals(expectedEntries.length / 2,
+                         lambdaTypeAnnos.orElseThrow().annotations().size(),
+                         () -> lambdaTypeAnnos.orElseThrow().annotations().toString());
+
+            checkJavapOutput(testClassDesc,
+                             List.of(expectedEntries));
+        }
+    }
+
+    private <T> T singletonValue(List<T> values) {
+        assertEquals(1, values.size());
+        return values.get(0);
+    }
+
+    private Optional<RuntimeInvisibleTypeAnnotationsAttribute> getAnnotations(MethodModel m) {
+        return m.findAttribute(Attributes.code())
+                .orElseThrow()
+                .findAttribute(Attributes.runtimeInvisibleTypeAnnotations());
+    }
+
+    void checkJavapOutput(TestClassDesc testClassDesc, List<String> expectedOutput) throws IOException {
+        String javapOut = new JavapTask(tb)
+                .options("-v", "-p")
+                .classes(testClassDesc.pathToClass().toString())
+                .run()
+                .getOutput(Task.OutputKind.DIRECT);
+
+        StringBuilder expandedJavapOutBuilder = new StringBuilder();
+        Matcher m = CP_REFERENCE.matcher(javapOut);
+
+        while (m.find()) {
+            String cpIndexText = m.group(1);
+            int cpIndex = Integer.parseInt(cpIndexText);
+            m.appendReplacement(expandedJavapOutBuilder, Matcher.quoteReplacement(testClassDesc.cpIndex2Name().getOrDefault(cpIndex, cpIndexText)));
+        }
+
+        m.appendTail(expandedJavapOutBuilder);
+
+        String expandedJavapOut = expandedJavapOutBuilder.toString();
+
+        for (String expected : expectedOutput) {
+            if (!expandedJavapOut.contains(expected)) {
+                System.err.println(expandedJavapOut);
+                throw new AssertionError("unexpected output");
+            }
+        }
+    }
+
+    record TestClassDesc(Path pathToClass,
+                     Map<String, List<MethodModel>> name2Method,
+                     Map<Integer, String> cpIndex2Name) {
+        public static TestClassDesc create(Path pathToClass) throws IOException{
+            ClassModel model = ClassFile.of().parse(pathToClass);
+            Map<String, List<MethodModel>> name2Method =
+                    model.methods()
+                         .stream()
+                         .collect(Collectors.groupingBy(m -> m.methodName().stringValue()));
+            ConstantPool cp = model.constantPool();
+            int cpSize = cp.size();
+            Map<Integer, String> cpIndex2Name = new HashMap<>();
+
+            for (int i = 1; i < cpSize; i++) {
+                if (cp.entryByIndex(i) instanceof Utf8Entry string) {
+                    cpIndex2Name.put(i, string.stringValue());
+                }
+            }
+
+            return new TestClassDesc(pathToClass, name2Method, cpIndex2Name);
+        }
+    }
+
+    @BeforeEach
+    void setUp(TestInfo thisTest) {
+        base = Path.of(thisTest.getTestMethod().orElseThrow().getName());
+    }
 }

From 7a11bdd25725749aa98a5fb865020b57f7c15869 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Daniel=20Jeli=C5=84ski?= <djelinski@openjdk.org>
Date: Wed, 8 Apr 2026 06:58:46 +0000
Subject: [PATCH 513/655] 8381722: Incremental build fails with
 FileAlreadyExistsException: PreviewFeature.java

Reviewed-by: jpai, erikj, jlahoda
---
 make/langtools/tools/previewfeature/SetupPreviewFeature.java | 3 ++-
 1 file changed, 2 insertions(+), 1 deletion(-)

diff --git a/make/langtools/tools/previewfeature/SetupPreviewFeature.java b/make/langtools/tools/previewfeature/SetupPreviewFeature.java
index 2d5207f0e17..5f9b00edc6d 100644
--- a/make/langtools/tools/previewfeature/SetupPreviewFeature.java
+++ b/make/langtools/tools/previewfeature/SetupPreviewFeature.java
@@ -30,6 +30,7 @@ import java.io.StringWriter;
 import java.lang.reflect.Field;
 import java.nio.file.Files;
 import java.nio.file.Path;
+import java.nio.file.StandardCopyOption;
 import java.util.HashSet;
 import java.util.Set;
 import java.util.stream.Collectors;
@@ -76,7 +77,7 @@ public class SetupPreviewFeature {
             var target = Path.of(args[1]);
             Files.createDirectories(target.getParent());
             if (constantsToAdd.isEmpty()) {
-                Files.copy(source, target);
+                Files.copy(source, target, StandardCopyOption.REPLACE_EXISTING);
             } else {
                 String sourceCode = Files.readString(source);
                 try (var out = Files.newBufferedWriter(target)) {

From cbef44cbc0bfcf0b5314b05292ff24d7e4322df7 Mon Sep 17 00:00:00 2001
From: Matthias Baesken <mbaesken@openjdk.org>
Date: Wed, 8 Apr 2026 08:21:52 +0000
Subject: [PATCH 514/655] 8381008: [aix] Test
 java/net/DatagramSocket/SendReceiveMaxSize.java#preferIPv6Loopback fails
 after JDK-8380824

Co-authored-by: Daniel Fuchs <dfuchs@openjdk.org>
Reviewed-by: mdoerr, jpai, dfuchs
---
 test/jdk/java/net/DatagramSocket/SendReceiveMaxSize.java | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/test/jdk/java/net/DatagramSocket/SendReceiveMaxSize.java b/test/jdk/java/net/DatagramSocket/SendReceiveMaxSize.java
index 86936ae41d0..97a415dd6f8 100644
--- a/test/jdk/java/net/DatagramSocket/SendReceiveMaxSize.java
+++ b/test/jdk/java/net/DatagramSocket/SendReceiveMaxSize.java
@@ -115,8 +115,8 @@ public class SendReceiveMaxSize {
 
     private int BUF_LIMIT;
     private InetAddress HOST_ADDR;
-    private final static int IPV4_SNDBUF = 65507;
-    private final static int IPV6_SNDBUF = 65527;
+    private final static int IPV4_SNDBUF = IPSupport.getMaxUDPSendBufSizeIPv4();
+    private final static int IPV6_SNDBUF = IPSupport.getMaxUDPSendBufSizeIPv6();
     private final static Class<IOException> IOE = IOException.class;
     private final static Random random = RandomFactory.getRandom();
 

From 6e1a1f927f123cbb48f328d53e5b13b97079cf85 Mon Sep 17 00:00:00 2001
From: Dingli Zhang <dzhang@openjdk.org>
Date: Wed, 8 Apr 2026 08:43:19 +0000
Subject: [PATCH 515/655] 8381724: RISC-V: Pass temp registers and use them in
 CardTableBarrierSetAssembler::store_check()

Reviewed-by: fyang, ayang, wenanjian
---
 .../cardTableBarrierSetAssembler_riscv.cpp    | 24 ++++++++++---------
 .../cardTableBarrierSetAssembler_riscv.hpp    |  4 ++--
 2 files changed, 15 insertions(+), 13 deletions(-)

diff --git a/src/hotspot/cpu/riscv/gc/shared/cardTableBarrierSetAssembler_riscv.cpp b/src/hotspot/cpu/riscv/gc/shared/cardTableBarrierSetAssembler_riscv.cpp
index d94bf428fd2..9eb546a1888 100644
--- a/src/hotspot/cpu/riscv/gc/shared/cardTableBarrierSetAssembler_riscv.cpp
+++ b/src/hotspot/cpu/riscv/gc/shared/cardTableBarrierSetAssembler_riscv.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * Copyright (c) 2020, 2022, Huawei Technologies Co., Ltd. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
@@ -56,8 +56,10 @@ void CardTableBarrierSetAssembler::store_at(MacroAssembler* masm, DecoratorSet d
   }
 }
 
-void CardTableBarrierSetAssembler::store_check(MacroAssembler* masm, Register obj, Register tmp) {
-  assert_different_registers(obj, tmp);
+void CardTableBarrierSetAssembler::store_check(MacroAssembler* masm, Register obj, Register tmp1, Register tmp2) {
+  precond(tmp1 != noreg);
+  precond(tmp2 != noreg);
+  assert_different_registers(obj, tmp1, tmp2);
   BarrierSet* bs = BarrierSet::barrier_set();
   assert(bs->kind() == BarrierSet::CardTableBarrierSet, "Wrong barrier set kind");
 
@@ -65,17 +67,17 @@ void CardTableBarrierSetAssembler::store_check(MacroAssembler* masm, Register ob
 
   assert(CardTable::dirty_card_val() == 0, "must be");
 
-  __ load_byte_map_base(tmp);
-  __ add(tmp, obj, tmp);
+  __ load_byte_map_base(tmp1);
+  __ add(tmp1, obj, tmp1);
 
   if (UseCondCardMark) {
     Label L_already_dirty;
-    __ lbu(t1,  Address(tmp));
-    __ beqz(t1, L_already_dirty);
-    __ sb(zr, Address(tmp));
+    __ lbu(tmp2,  Address(tmp1));
+    __ beqz(tmp2, L_already_dirty);
+    __ sb(zr, Address(tmp1));
     __ bind(L_already_dirty);
   } else {
-    __ sb(zr, Address(tmp));
+    __ sb(zr, Address(tmp1));
   }
 }
 
@@ -119,10 +121,10 @@ void CardTableBarrierSetAssembler::oop_store_at(MacroAssembler* masm, DecoratorS
   if (needs_post_barrier) {
     // flatten object address if needed
     if (!precise || dst.offset() == 0) {
-      store_check(masm, dst.base(), tmp3);
+      store_check(masm, dst.base(), tmp1, tmp2);
     } else {
       __ la(tmp3, dst);
-      store_check(masm, tmp3, t0);
+      store_check(masm, tmp3, tmp1, tmp2);
     }
   }
 }
diff --git a/src/hotspot/cpu/riscv/gc/shared/cardTableBarrierSetAssembler_riscv.hpp b/src/hotspot/cpu/riscv/gc/shared/cardTableBarrierSetAssembler_riscv.hpp
index 6f6e9065103..1576f0a6dd8 100644
--- a/src/hotspot/cpu/riscv/gc/shared/cardTableBarrierSetAssembler_riscv.hpp
+++ b/src/hotspot/cpu/riscv/gc/shared/cardTableBarrierSetAssembler_riscv.hpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * Copyright (c) 2020, 2022, Huawei Technologies Co., Ltd. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
@@ -31,7 +31,7 @@
 
 class CardTableBarrierSetAssembler: public BarrierSetAssembler {
 protected:
-  void store_check(MacroAssembler* masm, Register obj, Register tmp);
+  void store_check(MacroAssembler* masm, Register obj, Register tmp1, Register tmp2);
 
   virtual void gen_write_ref_array_pre_barrier(MacroAssembler* masm, DecoratorSet decorators,
                                                Register addr, Register count, RegSet saved_regs) {}

From cfae18fa606d8924f1f020b0f2de8617dd648bb2 Mon Sep 17 00:00:00 2001
From: Alexey Ivanov <aivanov@openjdk.org>
Date: Wed, 8 Apr 2026 08:56:58 +0000
Subject: [PATCH 516/655] 8381745: Ensure Modal/FileDialog tests explicitly
 reference Asserts class

Reviewed-by: serb, dmarkov
---
 .../FileDialog/FileDialogAppModal1Test.java   |  3 ++-
 .../FileDialog/FileDialogAppModal2Test.java   |  3 ++-
 .../FileDialog/FileDialogAppModal3Test.java   |  3 ++-
 .../FileDialog/FileDialogAppModal4Test.java   |  3 ++-
 .../FileDialog/FileDialogAppModal5Test.java   |  3 ++-
 .../FileDialog/FileDialogAppModal6Test.java   |  3 ++-
 .../Modal/FileDialog/FileDialogDWDTest.java   |  8 +++++--
 .../FileDialog/FileDialogDocModal1Test.java   |  3 ++-
 .../FileDialog/FileDialogDocModal2Test.java   |  3 ++-
 .../FileDialog/FileDialogDocModal3Test.java   |  3 ++-
 .../FileDialog/FileDialogDocModal4Test.java   |  3 ++-
 .../FileDialog/FileDialogDocModal5Test.java   |  3 ++-
 .../FileDialog/FileDialogDocModal6Test.java   |  3 ++-
 .../FileDialog/FileDialogDocModal7Test.java   |  3 ++-
 .../Modal/FileDialog/FileDialogFWDTest.java   |  9 +++++---
 .../FileDialog/FileDialogModal1Test.java      |  3 ++-
 .../FileDialog/FileDialogModal2Test.java      |  3 ++-
 .../FileDialog/FileDialogModal3Test.java      |  3 ++-
 .../FileDialog/FileDialogModal4Test.java      |  3 ++-
 .../FileDialog/FileDialogModal5Test.java      |  3 ++-
 .../FileDialog/FileDialogModal6Test.java      |  3 ++-
 .../FileDialog/FileDialogModalityTest.java    |  8 +++++--
 .../FileDialog/FileDialogNonModal1Test.java   |  3 ++-
 .../FileDialog/FileDialogNonModal2Test.java   |  3 ++-
 .../FileDialog/FileDialogNonModal3Test.java   |  3 ++-
 .../FileDialog/FileDialogNonModal4Test.java   |  3 ++-
 .../FileDialog/FileDialogNonModal5Test.java   |  3 ++-
 .../FileDialog/FileDialogNonModal6Test.java   |  3 ++-
 .../FileDialog/FileDialogNonModal7Test.java   |  3 ++-
 .../FileDialog/FileDialogTKModal1Test.java    |  3 ++-
 .../FileDialog/FileDialogTKModal2Test.java    |  3 ++-
 .../FileDialog/FileDialogTKModal3Test.java    |  3 ++-
 .../FileDialog/FileDialogTKModal4Test.java    |  3 ++-
 .../FileDialog/FileDialogTKModal5Test.java    |  3 ++-
 .../FileDialog/FileDialogTKModal6Test.java    |  3 ++-
 .../FileDialog/FileDialogTKModal7Test.java    |  3 ++-
 .../java/awt/Modal/helpers/TestDialog.java    | 22 ++++++++++++++-----
 .../jdk/java/awt/Modal/helpers/TestFrame.java | 21 +++++++++++++-----
 .../java/awt/Modal/helpers/TestWindow.java    | 22 ++++++++++++++-----
 39 files changed, 134 insertions(+), 55 deletions(-)

diff --git a/test/jdk/java/awt/Modal/FileDialog/FileDialogAppModal1Test.java b/test/jdk/java/awt/Modal/FileDialog/FileDialogAppModal1Test.java
index 7f2ae2361ae..7ee265cf34f 100644
--- a/test/jdk/java/awt/Modal/FileDialog/FileDialogAppModal1Test.java
+++ b/test/jdk/java/awt/Modal/FileDialog/FileDialogAppModal1Test.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2007, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2007, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -35,6 +35,7 @@ import java.awt.Dialog;
  * @library ../helpers /lib/client/
  * @library /test/lib
  * @build ExtendedRobot
+ * @build jdk.test.lib.Asserts
  * @build Flag
  * @build TestDialog
  * @build TestFrame
diff --git a/test/jdk/java/awt/Modal/FileDialog/FileDialogAppModal2Test.java b/test/jdk/java/awt/Modal/FileDialog/FileDialogAppModal2Test.java
index 5fef862611d..53a7d002a49 100644
--- a/test/jdk/java/awt/Modal/FileDialog/FileDialogAppModal2Test.java
+++ b/test/jdk/java/awt/Modal/FileDialog/FileDialogAppModal2Test.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2007, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2007, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -35,6 +35,7 @@ import java.awt.Dialog;
  * @library ../helpers /lib/client/
  * @library /test/lib
  * @build ExtendedRobot
+ * @build jdk.test.lib.Asserts
  * @build Flag
  * @build TestDialog
  * @build TestFrame
diff --git a/test/jdk/java/awt/Modal/FileDialog/FileDialogAppModal3Test.java b/test/jdk/java/awt/Modal/FileDialog/FileDialogAppModal3Test.java
index d054050faba..9718a05e53b 100644
--- a/test/jdk/java/awt/Modal/FileDialog/FileDialogAppModal3Test.java
+++ b/test/jdk/java/awt/Modal/FileDialog/FileDialogAppModal3Test.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2007, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2007, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -35,6 +35,7 @@ import java.awt.Dialog;
  * @library ../helpers /lib/client/
  * @library /test/lib
  * @build ExtendedRobot
+ * @build jdk.test.lib.Asserts
  * @build Flag
  * @build TestDialog
  * @build TestFrame
diff --git a/test/jdk/java/awt/Modal/FileDialog/FileDialogAppModal4Test.java b/test/jdk/java/awt/Modal/FileDialog/FileDialogAppModal4Test.java
index c3dea7cd590..7ae3898637e 100644
--- a/test/jdk/java/awt/Modal/FileDialog/FileDialogAppModal4Test.java
+++ b/test/jdk/java/awt/Modal/FileDialog/FileDialogAppModal4Test.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2007, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2007, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -35,6 +35,7 @@ import java.awt.Dialog;
  * @library ../helpers /lib/client/
  * @library /test/lib
  * @build ExtendedRobot
+ * @build jdk.test.lib.Asserts
  * @build Flag
  * @build TestDialog
  * @build TestFrame
diff --git a/test/jdk/java/awt/Modal/FileDialog/FileDialogAppModal5Test.java b/test/jdk/java/awt/Modal/FileDialog/FileDialogAppModal5Test.java
index 503c2f1cd01..026baab2229 100644
--- a/test/jdk/java/awt/Modal/FileDialog/FileDialogAppModal5Test.java
+++ b/test/jdk/java/awt/Modal/FileDialog/FileDialogAppModal5Test.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2007, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2007, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -35,6 +35,7 @@ import java.awt.Dialog;
  * @library ../helpers /lib/client/
  * @library /test/lib
  * @build ExtendedRobot
+ * @build jdk.test.lib.Asserts
  * @build Flag
  * @build TestDialog
  * @build TestFrame
diff --git a/test/jdk/java/awt/Modal/FileDialog/FileDialogAppModal6Test.java b/test/jdk/java/awt/Modal/FileDialog/FileDialogAppModal6Test.java
index 5fbbf040c58..0a93c77a7fa 100644
--- a/test/jdk/java/awt/Modal/FileDialog/FileDialogAppModal6Test.java
+++ b/test/jdk/java/awt/Modal/FileDialog/FileDialogAppModal6Test.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2007, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2007, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -35,6 +35,7 @@ import java.awt.Dialog;
  * @library ../helpers /lib/client/
  * @library /test/lib
  * @build ExtendedRobot
+ * @build jdk.test.lib.Asserts
  * @build Flag
  * @build TestDialog
  * @build TestFrame
diff --git a/test/jdk/java/awt/Modal/FileDialog/FileDialogDWDTest.java b/test/jdk/java/awt/Modal/FileDialog/FileDialogDWDTest.java
index 045c7e5ad49..5424744ad43 100644
--- a/test/jdk/java/awt/Modal/FileDialog/FileDialogDWDTest.java
+++ b/test/jdk/java/awt/Modal/FileDialog/FileDialogDWDTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2007, 2014, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2007, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -22,7 +22,11 @@
  */
 
 
-import java.awt.*;
+import java.awt.Dialog;
+import java.awt.EventQueue;
+import java.awt.FileDialog;
+import java.awt.Frame;
+import java.awt.Toolkit;
 
 
 // DWD: Dialog, Window, Dialog
diff --git a/test/jdk/java/awt/Modal/FileDialog/FileDialogDocModal1Test.java b/test/jdk/java/awt/Modal/FileDialog/FileDialogDocModal1Test.java
index c115fde948b..1f5871caf6d 100644
--- a/test/jdk/java/awt/Modal/FileDialog/FileDialogDocModal1Test.java
+++ b/test/jdk/java/awt/Modal/FileDialog/FileDialogDocModal1Test.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2007, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2007, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -35,6 +35,7 @@ import java.awt.Dialog;
  * @library ../helpers /lib/client/
  * @library /test/lib
  * @build ExtendedRobot
+ * @build jdk.test.lib.Asserts
  * @build Flag
  * @build TestDialog
  * @build TestFrame
diff --git a/test/jdk/java/awt/Modal/FileDialog/FileDialogDocModal2Test.java b/test/jdk/java/awt/Modal/FileDialog/FileDialogDocModal2Test.java
index 604d3d41f1b..3b4092d3b01 100644
--- a/test/jdk/java/awt/Modal/FileDialog/FileDialogDocModal2Test.java
+++ b/test/jdk/java/awt/Modal/FileDialog/FileDialogDocModal2Test.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2007, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2007, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -35,6 +35,7 @@ import java.awt.Dialog;
  * @library ../helpers /lib/client/
  * @library /test/lib
  * @build ExtendedRobot
+ * @build jdk.test.lib.Asserts
  * @build Flag
  * @build TestDialog
  * @build TestFrame
diff --git a/test/jdk/java/awt/Modal/FileDialog/FileDialogDocModal3Test.java b/test/jdk/java/awt/Modal/FileDialog/FileDialogDocModal3Test.java
index b0a12d43cd4..d59cbd31396 100644
--- a/test/jdk/java/awt/Modal/FileDialog/FileDialogDocModal3Test.java
+++ b/test/jdk/java/awt/Modal/FileDialog/FileDialogDocModal3Test.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2007, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2007, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -35,6 +35,7 @@ import java.awt.Dialog;
  * @library ../helpers /lib/client/
  * @library /test/lib
  * @build ExtendedRobot
+ * @build jdk.test.lib.Asserts
  * @build Flag
  * @build TestDialog
  * @build TestFrame
diff --git a/test/jdk/java/awt/Modal/FileDialog/FileDialogDocModal4Test.java b/test/jdk/java/awt/Modal/FileDialog/FileDialogDocModal4Test.java
index 4a392c399db..6a4a967672c 100644
--- a/test/jdk/java/awt/Modal/FileDialog/FileDialogDocModal4Test.java
+++ b/test/jdk/java/awt/Modal/FileDialog/FileDialogDocModal4Test.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2007, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2007, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -35,6 +35,7 @@ import java.awt.Dialog;
  * @library ../helpers /lib/client/
  * @library /test/lib
  * @build ExtendedRobot
+ * @build jdk.test.lib.Asserts
  * @build Flag
  * @build TestDialog
  * @build TestFrame
diff --git a/test/jdk/java/awt/Modal/FileDialog/FileDialogDocModal5Test.java b/test/jdk/java/awt/Modal/FileDialog/FileDialogDocModal5Test.java
index 8eacf51cd5e..6bcb7fa6c54 100644
--- a/test/jdk/java/awt/Modal/FileDialog/FileDialogDocModal5Test.java
+++ b/test/jdk/java/awt/Modal/FileDialog/FileDialogDocModal5Test.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2007, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2007, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -35,6 +35,7 @@ import java.awt.Dialog;
  * @library ../helpers /lib/client/
  * @library /test/lib
  * @build ExtendedRobot
+ * @build jdk.test.lib.Asserts
  * @build Flag
  * @build TestDialog
  * @build TestFrame
diff --git a/test/jdk/java/awt/Modal/FileDialog/FileDialogDocModal6Test.java b/test/jdk/java/awt/Modal/FileDialog/FileDialogDocModal6Test.java
index 0d50231522c..aff84c3b40f 100644
--- a/test/jdk/java/awt/Modal/FileDialog/FileDialogDocModal6Test.java
+++ b/test/jdk/java/awt/Modal/FileDialog/FileDialogDocModal6Test.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2007, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2007, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -35,6 +35,7 @@ import java.awt.Dialog;
  * @library ../helpers /lib/client/
  * @library /test/lib
  * @build ExtendedRobot
+ * @build jdk.test.lib.Asserts
  * @build Flag
  * @build TestDialog
  * @build TestFrame
diff --git a/test/jdk/java/awt/Modal/FileDialog/FileDialogDocModal7Test.java b/test/jdk/java/awt/Modal/FileDialog/FileDialogDocModal7Test.java
index cde4592be91..9fd7d72a399 100644
--- a/test/jdk/java/awt/Modal/FileDialog/FileDialogDocModal7Test.java
+++ b/test/jdk/java/awt/Modal/FileDialog/FileDialogDocModal7Test.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2007, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2007, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -32,6 +32,7 @@ import java.awt.Dialog;
  * @library ../helpers /lib/client/
  * @library /test/lib
  * @build ExtendedRobot
+ * @build jdk.test.lib.Asserts
  * @build Flag
  * @build TestDialog
  * @build TestFrame
diff --git a/test/jdk/java/awt/Modal/FileDialog/FileDialogFWDTest.java b/test/jdk/java/awt/Modal/FileDialog/FileDialogFWDTest.java
index 0026c0da50f..e77024d68e2 100644
--- a/test/jdk/java/awt/Modal/FileDialog/FileDialogFWDTest.java
+++ b/test/jdk/java/awt/Modal/FileDialog/FileDialogFWDTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2007, 2014, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2007, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -21,8 +21,11 @@
  * questions.
  */
 
-import java.awt.*;
-
+import java.awt.Dialog;
+import java.awt.EventQueue;
+import java.awt.FileDialog;
+import java.awt.Frame;
+import java.awt.Toolkit;
 
 
 // FWD: Frame, Window, Dialog
diff --git a/test/jdk/java/awt/Modal/FileDialog/FileDialogModal1Test.java b/test/jdk/java/awt/Modal/FileDialog/FileDialogModal1Test.java
index cd845cf3a75..b7080d2081b 100644
--- a/test/jdk/java/awt/Modal/FileDialog/FileDialogModal1Test.java
+++ b/test/jdk/java/awt/Modal/FileDialog/FileDialogModal1Test.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2007, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2007, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -34,6 +34,7 @@
  * @library ../helpers /lib/client/
  * @library /test/lib
  * @build ExtendedRobot
+ * @build jdk.test.lib.Asserts
  * @build Flag
  * @build TestDialog
  * @build TestFrame
diff --git a/test/jdk/java/awt/Modal/FileDialog/FileDialogModal2Test.java b/test/jdk/java/awt/Modal/FileDialog/FileDialogModal2Test.java
index 5fe63428bb7..349c5900a41 100644
--- a/test/jdk/java/awt/Modal/FileDialog/FileDialogModal2Test.java
+++ b/test/jdk/java/awt/Modal/FileDialog/FileDialogModal2Test.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2007, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2007, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -34,6 +34,7 @@
  * @library ../helpers /lib/client/
  * @library /test/lib
  * @build ExtendedRobot
+ * @build jdk.test.lib.Asserts
  * @build Flag
  * @build TestDialog
  * @build TestFrame
diff --git a/test/jdk/java/awt/Modal/FileDialog/FileDialogModal3Test.java b/test/jdk/java/awt/Modal/FileDialog/FileDialogModal3Test.java
index 37da58a4bfe..911a2fb068a 100644
--- a/test/jdk/java/awt/Modal/FileDialog/FileDialogModal3Test.java
+++ b/test/jdk/java/awt/Modal/FileDialog/FileDialogModal3Test.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2007, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2007, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -34,6 +34,7 @@
  * @library ../helpers /lib/client/
  * @library /test/lib
  * @build ExtendedRobot
+ * @build jdk.test.lib.Asserts
  * @build Flag
  * @build TestDialog
  * @build TestFrame
diff --git a/test/jdk/java/awt/Modal/FileDialog/FileDialogModal4Test.java b/test/jdk/java/awt/Modal/FileDialog/FileDialogModal4Test.java
index 2761a842c86..431e2302215 100644
--- a/test/jdk/java/awt/Modal/FileDialog/FileDialogModal4Test.java
+++ b/test/jdk/java/awt/Modal/FileDialog/FileDialogModal4Test.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2007, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2007, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -34,6 +34,7 @@
  * @library ../helpers /lib/client/
  * @library /test/lib
  * @build ExtendedRobot
+ * @build jdk.test.lib.Asserts
  * @build Flag
  * @build TestDialog
  * @build TestFrame
diff --git a/test/jdk/java/awt/Modal/FileDialog/FileDialogModal5Test.java b/test/jdk/java/awt/Modal/FileDialog/FileDialogModal5Test.java
index d8e29db02b7..29ad342b71a 100644
--- a/test/jdk/java/awt/Modal/FileDialog/FileDialogModal5Test.java
+++ b/test/jdk/java/awt/Modal/FileDialog/FileDialogModal5Test.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2007, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2007, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -34,6 +34,7 @@
  * @library ../helpers /lib/client/
  * @library /test/lib
  * @build ExtendedRobot
+ * @build jdk.test.lib.Asserts
  * @build Flag
  * @build TestDialog
  * @build TestFrame
diff --git a/test/jdk/java/awt/Modal/FileDialog/FileDialogModal6Test.java b/test/jdk/java/awt/Modal/FileDialog/FileDialogModal6Test.java
index d70bd001ad1..88c7dd5e29e 100644
--- a/test/jdk/java/awt/Modal/FileDialog/FileDialogModal6Test.java
+++ b/test/jdk/java/awt/Modal/FileDialog/FileDialogModal6Test.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2007, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2007, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -34,6 +34,7 @@
  * @library ../helpers /lib/client/
  * @library /test/lib
  * @build ExtendedRobot
+ * @build jdk.test.lib.Asserts
  * @build Flag
  * @build TestDialog
  * @build TestFrame
diff --git a/test/jdk/java/awt/Modal/FileDialog/FileDialogModalityTest.java b/test/jdk/java/awt/Modal/FileDialog/FileDialogModalityTest.java
index 7f69d6176d0..00a6a58bd73 100644
--- a/test/jdk/java/awt/Modal/FileDialog/FileDialogModalityTest.java
+++ b/test/jdk/java/awt/Modal/FileDialog/FileDialogModalityTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2007, 2014, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2007, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -21,7 +21,11 @@
  * questions.
  */
 
-import java.awt.*;
+import java.awt.Dialog;
+import java.awt.EventQueue;
+import java.awt.FileDialog;
+import java.awt.Frame;
+import java.awt.Toolkit;
 
 public class FileDialogModalityTest {
 
diff --git a/test/jdk/java/awt/Modal/FileDialog/FileDialogNonModal1Test.java b/test/jdk/java/awt/Modal/FileDialog/FileDialogNonModal1Test.java
index a02860c25fb..e6463081a81 100644
--- a/test/jdk/java/awt/Modal/FileDialog/FileDialogNonModal1Test.java
+++ b/test/jdk/java/awt/Modal/FileDialog/FileDialogNonModal1Test.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2007, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2007, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -34,6 +34,7 @@
  * @library ../helpers /lib/client/
  * @library /test/lib
  * @build ExtendedRobot
+ * @build jdk.test.lib.Asserts
  * @build Flag
  * @build TestDialog
  * @build TestFrame
diff --git a/test/jdk/java/awt/Modal/FileDialog/FileDialogNonModal2Test.java b/test/jdk/java/awt/Modal/FileDialog/FileDialogNonModal2Test.java
index 47667d4b7ba..0fff3b3c43f 100644
--- a/test/jdk/java/awt/Modal/FileDialog/FileDialogNonModal2Test.java
+++ b/test/jdk/java/awt/Modal/FileDialog/FileDialogNonModal2Test.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2007, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2007, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -34,6 +34,7 @@
  * @library ../helpers /lib/client/
  * @library /test/lib
  * @build ExtendedRobot
+ * @build jdk.test.lib.Asserts
  * @build Flag
  * @build TestDialog
  * @build TestFrame
diff --git a/test/jdk/java/awt/Modal/FileDialog/FileDialogNonModal3Test.java b/test/jdk/java/awt/Modal/FileDialog/FileDialogNonModal3Test.java
index 6d3354a7472..31c1f42ca93 100644
--- a/test/jdk/java/awt/Modal/FileDialog/FileDialogNonModal3Test.java
+++ b/test/jdk/java/awt/Modal/FileDialog/FileDialogNonModal3Test.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2007, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2007, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -34,6 +34,7 @@
  * @library ../helpers /lib/client/
  * @library /test/lib
  * @build ExtendedRobot
+ * @build jdk.test.lib.Asserts
  * @build Flag
  * @build TestDialog
  * @build TestFrame
diff --git a/test/jdk/java/awt/Modal/FileDialog/FileDialogNonModal4Test.java b/test/jdk/java/awt/Modal/FileDialog/FileDialogNonModal4Test.java
index 1854dd367c5..0050d57839b 100644
--- a/test/jdk/java/awt/Modal/FileDialog/FileDialogNonModal4Test.java
+++ b/test/jdk/java/awt/Modal/FileDialog/FileDialogNonModal4Test.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2007, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2007, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -34,6 +34,7 @@
  * @library ../helpers /lib/client/
  * @library /test/lib
  * @build ExtendedRobot
+ * @build jdk.test.lib.Asserts
  * @build Flag
  * @build TestDialog
  * @build TestFrame
diff --git a/test/jdk/java/awt/Modal/FileDialog/FileDialogNonModal5Test.java b/test/jdk/java/awt/Modal/FileDialog/FileDialogNonModal5Test.java
index 9425fe5288d..c05af4c399e 100644
--- a/test/jdk/java/awt/Modal/FileDialog/FileDialogNonModal5Test.java
+++ b/test/jdk/java/awt/Modal/FileDialog/FileDialogNonModal5Test.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2007, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2007, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -34,6 +34,7 @@
  * @library ../helpers /lib/client/
  * @library /test/lib
  * @build ExtendedRobot
+ * @build jdk.test.lib.Asserts
  * @build Flag
  * @build TestDialog
  * @build TestFrame
diff --git a/test/jdk/java/awt/Modal/FileDialog/FileDialogNonModal6Test.java b/test/jdk/java/awt/Modal/FileDialog/FileDialogNonModal6Test.java
index 70ec49a038c..98cb842e65c 100644
--- a/test/jdk/java/awt/Modal/FileDialog/FileDialogNonModal6Test.java
+++ b/test/jdk/java/awt/Modal/FileDialog/FileDialogNonModal6Test.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2007, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2007, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -34,6 +34,7 @@
  * @library ../helpers /lib/client/
  * @library /test/lib
  * @build ExtendedRobot
+ * @build jdk.test.lib.Asserts
  * @build Flag
  * @build TestDialog
  * @build TestFrame
diff --git a/test/jdk/java/awt/Modal/FileDialog/FileDialogNonModal7Test.java b/test/jdk/java/awt/Modal/FileDialog/FileDialogNonModal7Test.java
index c34e9201f40..7c29610e205 100644
--- a/test/jdk/java/awt/Modal/FileDialog/FileDialogNonModal7Test.java
+++ b/test/jdk/java/awt/Modal/FileDialog/FileDialogNonModal7Test.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2007, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2007, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -32,6 +32,7 @@ import java.awt.Dialog;
  * @library ../helpers /lib/client/
  * @library /test/lib
  * @build ExtendedRobot
+ * @build jdk.test.lib.Asserts
  * @build Flag
  * @build TestDialog
  * @build TestFrame
diff --git a/test/jdk/java/awt/Modal/FileDialog/FileDialogTKModal1Test.java b/test/jdk/java/awt/Modal/FileDialog/FileDialogTKModal1Test.java
index 7278a9db0a1..8578a69bed4 100644
--- a/test/jdk/java/awt/Modal/FileDialog/FileDialogTKModal1Test.java
+++ b/test/jdk/java/awt/Modal/FileDialog/FileDialogTKModal1Test.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2007, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2007, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -35,6 +35,7 @@ import java.awt.Dialog;
  * @library ../helpers /lib/client/
  * @library /test/lib
  * @build ExtendedRobot
+ * @build jdk.test.lib.Asserts
  * @build Flag
  * @build TestDialog
  * @build TestFrame
diff --git a/test/jdk/java/awt/Modal/FileDialog/FileDialogTKModal2Test.java b/test/jdk/java/awt/Modal/FileDialog/FileDialogTKModal2Test.java
index 282c84f64dc..182ebfd43ec 100644
--- a/test/jdk/java/awt/Modal/FileDialog/FileDialogTKModal2Test.java
+++ b/test/jdk/java/awt/Modal/FileDialog/FileDialogTKModal2Test.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2007, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2007, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -35,6 +35,7 @@ import java.awt.Dialog;
  * @library ../helpers /lib/client/
  * @library /test/lib
  * @build ExtendedRobot
+ * @build jdk.test.lib.Asserts
  * @build Flag
  * @build TestDialog
  * @build TestFrame
diff --git a/test/jdk/java/awt/Modal/FileDialog/FileDialogTKModal3Test.java b/test/jdk/java/awt/Modal/FileDialog/FileDialogTKModal3Test.java
index e09227564ef..78344558b40 100644
--- a/test/jdk/java/awt/Modal/FileDialog/FileDialogTKModal3Test.java
+++ b/test/jdk/java/awt/Modal/FileDialog/FileDialogTKModal3Test.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2007, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2007, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -35,6 +35,7 @@ import java.awt.Dialog;
  * @library ../helpers /lib/client/
  * @library /test/lib
  * @build ExtendedRobot
+ * @build jdk.test.lib.Asserts
  * @build Flag
  * @build TestDialog
  * @build TestFrame
diff --git a/test/jdk/java/awt/Modal/FileDialog/FileDialogTKModal4Test.java b/test/jdk/java/awt/Modal/FileDialog/FileDialogTKModal4Test.java
index d23e781a3c8..3157ebe9a2c 100644
--- a/test/jdk/java/awt/Modal/FileDialog/FileDialogTKModal4Test.java
+++ b/test/jdk/java/awt/Modal/FileDialog/FileDialogTKModal4Test.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2007, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2007, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -35,6 +35,7 @@ import java.awt.Dialog;
  * @library ../helpers /lib/client/
  * @library /test/lib
  * @build ExtendedRobot
+ * @build jdk.test.lib.Asserts
  * @build Flag
  * @build TestDialog
  * @build TestFrame
diff --git a/test/jdk/java/awt/Modal/FileDialog/FileDialogTKModal5Test.java b/test/jdk/java/awt/Modal/FileDialog/FileDialogTKModal5Test.java
index 515bd0072c2..11d10557006 100644
--- a/test/jdk/java/awt/Modal/FileDialog/FileDialogTKModal5Test.java
+++ b/test/jdk/java/awt/Modal/FileDialog/FileDialogTKModal5Test.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2007, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2007, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -35,6 +35,7 @@ import java.awt.Dialog;
  * @library ../helpers /lib/client/
  * @library /test/lib
  * @build ExtendedRobot
+ * @build jdk.test.lib.Asserts
  * @build Flag
  * @build TestDialog
  * @build TestFrame
diff --git a/test/jdk/java/awt/Modal/FileDialog/FileDialogTKModal6Test.java b/test/jdk/java/awt/Modal/FileDialog/FileDialogTKModal6Test.java
index 725924ca1c5..4ef7699fb0b 100644
--- a/test/jdk/java/awt/Modal/FileDialog/FileDialogTKModal6Test.java
+++ b/test/jdk/java/awt/Modal/FileDialog/FileDialogTKModal6Test.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2007, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2007, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -35,6 +35,7 @@ import java.awt.Dialog;
  * @library ../helpers /lib/client/
  * @library /test/lib
  * @build ExtendedRobot
+ * @build jdk.test.lib.Asserts
  * @build Flag
  * @build TestDialog
  * @build TestFrame
diff --git a/test/jdk/java/awt/Modal/FileDialog/FileDialogTKModal7Test.java b/test/jdk/java/awt/Modal/FileDialog/FileDialogTKModal7Test.java
index f6e5bb80a38..bb416493a36 100644
--- a/test/jdk/java/awt/Modal/FileDialog/FileDialogTKModal7Test.java
+++ b/test/jdk/java/awt/Modal/FileDialog/FileDialogTKModal7Test.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2007, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2007, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -32,6 +32,7 @@ import java.awt.Dialog;
  * @library ../helpers /lib/client/
  * @library /test/lib
  * @build ExtendedRobot
+ * @build jdk.test.lib.Asserts
  * @build Flag
  * @build TestDialog
  * @build TestFrame
diff --git a/test/jdk/java/awt/Modal/helpers/TestDialog.java b/test/jdk/java/awt/Modal/helpers/TestDialog.java
index 2ae93f835b9..a56ce1f5164 100644
--- a/test/jdk/java/awt/Modal/helpers/TestDialog.java
+++ b/test/jdk/java/awt/Modal/helpers/TestDialog.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2007, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2007, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -22,11 +22,23 @@
  */
 
 
-import java.awt.*;
-import java.awt.event.*;
-
-import static jdk.test.lib.Asserts.*;
+import java.awt.Button;
+import java.awt.Dialog;
+import java.awt.Frame;
+import java.awt.GridLayout;
+import java.awt.Panel;
+import java.awt.event.ActionEvent;
+import java.awt.event.ActionListener;
+import java.awt.event.FocusEvent;
+import java.awt.event.FocusListener;
+import java.awt.event.KeyEvent;
+import java.awt.event.WindowEvent;
+import java.awt.event.WindowFocusListener;
+import java.awt.event.WindowListener;
 
+import static jdk.test.lib.Asserts.assertEQ;
+import static jdk.test.lib.Asserts.assertFalse;
+import static jdk.test.lib.Asserts.assertTrue;
 
 
 public class TestDialog extends Dialog implements ActionListener,
diff --git a/test/jdk/java/awt/Modal/helpers/TestFrame.java b/test/jdk/java/awt/Modal/helpers/TestFrame.java
index dd8ed1530ef..d002d6faf8e 100644
--- a/test/jdk/java/awt/Modal/helpers/TestFrame.java
+++ b/test/jdk/java/awt/Modal/helpers/TestFrame.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2007, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2007, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -21,11 +21,22 @@
  * questions.
  */
 
-import java.awt.*;
-import java.awt.event.*;
-
-import static jdk.test.lib.Asserts.*;
+import java.awt.Button;
+import java.awt.Frame;
+import java.awt.GridLayout;
+import java.awt.Panel;
+import java.awt.event.ActionEvent;
+import java.awt.event.ActionListener;
+import java.awt.event.FocusEvent;
+import java.awt.event.FocusListener;
+import java.awt.event.KeyEvent;
+import java.awt.event.WindowEvent;
+import java.awt.event.WindowFocusListener;
+import java.awt.event.WindowListener;
 
+import static jdk.test.lib.Asserts.assertEQ;
+import static jdk.test.lib.Asserts.assertFalse;
+import static jdk.test.lib.Asserts.assertTrue;
 
 
 public class TestFrame extends Frame implements ActionListener,
diff --git a/test/jdk/java/awt/Modal/helpers/TestWindow.java b/test/jdk/java/awt/Modal/helpers/TestWindow.java
index 1e2ffb078c8..249f56ead7d 100644
--- a/test/jdk/java/awt/Modal/helpers/TestWindow.java
+++ b/test/jdk/java/awt/Modal/helpers/TestWindow.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2007, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2007, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -21,11 +21,23 @@
  * questions.
  */
 
-import java.awt.*;
-import java.awt.event.*;
-
-import static jdk.test.lib.Asserts.*;
+import java.awt.Button;
+import java.awt.Frame;
+import java.awt.GridLayout;
+import java.awt.Panel;
+import java.awt.Window;
+import java.awt.event.ActionEvent;
+import java.awt.event.ActionListener;
+import java.awt.event.FocusEvent;
+import java.awt.event.FocusListener;
+import java.awt.event.KeyEvent;
+import java.awt.event.WindowEvent;
+import java.awt.event.WindowFocusListener;
+import java.awt.event.WindowListener;
 
+import static jdk.test.lib.Asserts.assertEQ;
+import static jdk.test.lib.Asserts.assertFalse;
+import static jdk.test.lib.Asserts.assertTrue;
 
 
 public class TestWindow extends Window implements ActionListener,

From d7bace12ff72d9ab5be53cd1ef3a2b839ff9ddea Mon Sep 17 00:00:00 2001
From: Serhiy Sachkov <serhiy.sachkov@oracle.com>
Date: Wed, 8 Apr 2026 09:29:59 +0000
Subject: [PATCH 517/655] 8380990: Update testng and junit tests to use
 diagnoseConfigurationIssue() method and post processing

Reviewed-by: dfuchs
---
 .../lang/ProcessBuilder/ReaderWriterTest.java   |  5 ++---
 .../net/DatagramSocket/SendReceiveMaxSize.java  | 17 +++++++----------
 .../java/net/InetSocketAddress/ToString.java    | 12 +++++++++---
 .../java/net/MulticastSocket/IPMulticastIF.java | 12 +++++++++---
 .../NetworkInterfaceStreamTest.java             | 11 ++++++++---
 .../net/NetworkInterface/NullMacAddress.java    | 12 +++++++++---
 .../java/net/SocketOption/ImmutableOptions.java | 13 +++++++++----
 .../net/httpclient/quic/VariableLengthTest.java |  5 ++---
 .../LookupPolicyMappingTest.java                |  4 +++-
 .../DatagramChannel/AfterDisconnect.java        |  6 +++++-
 .../DatagramChannel/SendReceiveMaxSize.java     |  8 ++++----
 .../channels/etc/LocalSocketAddressType.java    |  9 ++-------
 .../java/nio/channels/etc/OpenAndConnect.java   |  8 +-------
 .../java/nio/channels/etc/ProtocolFamilies.java |  8 +-------
 .../text/Format/DecimalFormat/CloneTest.java    |  8 ++++----
 .../AsynchronousSocketChannelNAPITest.java      | 10 +++++++---
 .../DatagramChannelNAPITest.java                | 10 +++++++---
 .../DatagramSocketNAPITest.java                 | 10 +++++++---
 .../SocketChannelNAPITest.java                  | 10 +++++++---
 .../ExtendedSocketOption/SocketNAPITest.java    | 10 +++++++---
 20 files changed, 110 insertions(+), 78 deletions(-)

diff --git a/test/jdk/java/lang/ProcessBuilder/ReaderWriterTest.java b/test/jdk/java/lang/ProcessBuilder/ReaderWriterTest.java
index 6bff8d5e592..0f5acf607ba 100644
--- a/test/jdk/java/lang/ProcessBuilder/ReaderWriterTest.java
+++ b/test/jdk/java/lang/ProcessBuilder/ReaderWriterTest.java
@@ -37,12 +37,11 @@ import java.nio.charset.StandardCharsets;
 import java.nio.charset.UnsupportedCharsetException;
 import java.util.stream.Stream;
 
-import jtreg.SkippedException;
 import org.junit.jupiter.api.Test;
-import org.junit.jupiter.api.TestInstance;
 import org.junit.jupiter.params.ParameterizedTest;
 import org.junit.jupiter.params.provider.Arguments;
 import org.junit.jupiter.params.provider.MethodSource;
+import org.opentest4j.TestAbortedException;
 
 /*
  * @test
@@ -180,7 +179,7 @@ public class ReaderWriterTest {
             cs = Charset.forName(encoding);
             System.out.println("Charset: " + cs);
         } catch (UnsupportedCharsetException use) {
-            throw new SkippedException("Charset not supported: " + encoding);
+            throw new TestAbortedException("Charset not supported: " + encoding);
         }
         String cleanCSName = cleanCharsetName(cs);
 
diff --git a/test/jdk/java/net/DatagramSocket/SendReceiveMaxSize.java b/test/jdk/java/net/DatagramSocket/SendReceiveMaxSize.java
index 97a415dd6f8..2b68af9cbf2 100644
--- a/test/jdk/java/net/DatagramSocket/SendReceiveMaxSize.java
+++ b/test/jdk/java/net/DatagramSocket/SendReceiveMaxSize.java
@@ -87,8 +87,6 @@
 
 import jdk.test.lib.RandomFactory;
 import jdk.test.lib.Platform;
-import jdk.test.lib.net.IPSupport;
-import jtreg.SkippedException;
 import org.testng.SkipException;
 import org.testng.annotations.BeforeTest;
 import org.testng.annotations.DataProvider;
@@ -102,9 +100,11 @@ import java.net.InetAddress;
 import java.net.InetSocketAddress;
 import java.net.MulticastSocket;
 import java.nio.channels.DatagramChannel;
+import java.util.Optional;
 import java.util.Random;
 
 import static java.net.StandardSocketOptions.SO_RCVBUF;
+import static jdk.test.lib.net.IPSupport.diagnoseConfigurationIssue;
 import static org.testng.Assert.assertTrue;
 import static org.testng.Assert.assertEquals;
 import static org.testng.Assert.expectThrows;
@@ -127,14 +127,11 @@ public class SendReceiveMaxSize {
 
     @BeforeTest
     public void setUp() throws IOException {
-        try {
-            // This method throws jtreg.SkippedException, which is
-            // interpreted as a test failure by testng
-            IPSupport.throwSkippedExceptionIfNonOperational();
-        } catch (SkippedException skip) {
-            // throws the appropriate TestNG SkipException
-            throw new SkipException(skip.getMessage(), skip);
-        }
+        Optional<String> configurationIssue = diagnoseConfigurationIssue();
+        configurationIssue.map(SkipException::new).ifPresent(x -> {
+            throw x;
+        });
+
         HOST_ADDR = PREFER_LOOPBACK ? InetAddress.getLoopbackAddress() : InetAddress.getLocalHost();
         BUF_LIMIT = (HOST_ADDR instanceof Inet6Address) ? IPV6_SNDBUF : IPV4_SNDBUF;
         System.out.printf("Host address: %s, Buffer limit: %d%n", HOST_ADDR, BUF_LIMIT);
diff --git a/test/jdk/java/net/InetSocketAddress/ToString.java b/test/jdk/java/net/InetSocketAddress/ToString.java
index 33fd1dd6a73..12eb599b872 100644
--- a/test/jdk/java/net/InetSocketAddress/ToString.java
+++ b/test/jdk/java/net/InetSocketAddress/ToString.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2001, 2019, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2001, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -32,12 +32,15 @@
  */
 
 import java.net.*;
+import java.util.Optional;
 
-import jdk.test.lib.net.IPSupport;
+import org.testng.SkipException;
 import org.testng.annotations.BeforeTest;
 import org.testng.annotations.DataProvider;
 import org.testng.annotations.Test;
 
+import static jdk.test.lib.net.IPSupport.diagnoseConfigurationIssue;
+
 public class ToString {
 
     private static final String loopbackAddr;
@@ -74,7 +77,10 @@ public class ToString {
 
     @BeforeTest
     public void setup() {
-        IPSupport.throwSkippedExceptionIfNonOperational();
+        Optional<String> configurationIssue = diagnoseConfigurationIssue();
+        configurationIssue.map(SkipException::new).ifPresent(x -> {
+            throw x;
+        });
     }
 
     @Test
diff --git a/test/jdk/java/net/MulticastSocket/IPMulticastIF.java b/test/jdk/java/net/MulticastSocket/IPMulticastIF.java
index 3909f6d6276..6f6e7dd1942 100644
--- a/test/jdk/java/net/MulticastSocket/IPMulticastIF.java
+++ b/test/jdk/java/net/MulticastSocket/IPMulticastIF.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2019, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2019, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -27,8 +27,10 @@ import java.net.MulticastSocket;
 import java.net.NetworkInterface;
 import java.util.ArrayList;
 import java.util.List;
+import java.util.Optional;
+
 import jdk.test.lib.NetworkConfiguration;
-import jdk.test.lib.net.IPSupport;
+import org.testng.SkipException;
 import org.testng.annotations.BeforeTest;
 import org.testng.annotations.DataProvider;
 import org.testng.annotations.Test;
@@ -36,6 +38,7 @@ import static java.lang.String.format;
 import static java.lang.System.out;
 import static java.net.StandardSocketOptions.IP_MULTICAST_IF;
 import static java.util.stream.Collectors.toList;
+import static jdk.test.lib.net.IPSupport.diagnoseConfigurationIssue;
 import static org.testng.Assert.assertEquals;
 import static org.testng.Assert.assertTrue;
 
@@ -53,7 +56,10 @@ public class IPMulticastIF {
 
     @BeforeTest
     public void sanity() {
-        IPSupport.throwSkippedExceptionIfNonOperational();
+        Optional<String> configurationIssue = diagnoseConfigurationIssue();
+        configurationIssue.map(SkipException::new).ifPresent(x -> {
+            throw x;
+        });
         NetworkConfiguration.printSystemConfiguration(out);
     }
 
diff --git a/test/jdk/java/net/NetworkInterface/NetworkInterfaceStreamTest.java b/test/jdk/java/net/NetworkInterface/NetworkInterfaceStreamTest.java
index 63093e4b9fa..000b802d9a9 100644
--- a/test/jdk/java/net/NetworkInterface/NetworkInterfaceStreamTest.java
+++ b/test/jdk/java/net/NetworkInterface/NetworkInterfaceStreamTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2015, 2017, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2015, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -30,6 +30,7 @@
  * @run testng/othervm -Djava.net.preferIPv4Stack=true NetworkInterfaceStreamTest
  */
 
+import org.testng.SkipException;
 import org.testng.annotations.BeforeTest;
 import org.testng.annotations.Test;
 
@@ -39,12 +40,13 @@ import java.net.SocketException;
 import java.util.ArrayList;
 import java.util.Collection;
 import java.util.Collections;
+import java.util.Optional;
 import java.util.function.Supplier;
 import java.util.stream.OpTestCase;
 import java.util.stream.Stream;
 import java.util.stream.TestData;
 
-import jdk.test.lib.net.IPSupport;
+import static jdk.test.lib.net.IPSupport.diagnoseConfigurationIssue;
 
 public class NetworkInterfaceStreamTest extends OpTestCase {
 
@@ -52,7 +54,10 @@ public class NetworkInterfaceStreamTest extends OpTestCase {
 
     @BeforeTest
     void setup() {
-        IPSupport.throwSkippedExceptionIfNonOperational();
+        Optional<String> configurationIssue = diagnoseConfigurationIssue();
+        configurationIssue.map(SkipException::new).ifPresent(x -> {
+            throw x;
+        });
     }
 
     @Test
diff --git a/test/jdk/java/net/NetworkInterface/NullMacAddress.java b/test/jdk/java/net/NetworkInterface/NullMacAddress.java
index b31e93d39f2..8161670860e 100644
--- a/test/jdk/java/net/NetworkInterface/NullMacAddress.java
+++ b/test/jdk/java/net/NetworkInterface/NullMacAddress.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2020, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -31,8 +31,11 @@
  * @run testng/othervm -Djava.net.preferIPv4Stack=true NullMacAddress
  */
 
+import org.testng.SkipException;
 import org.testng.annotations.BeforeTest;
 import org.testng.annotations.Test;
+
+import static jdk.test.lib.net.IPSupport.diagnoseConfigurationIssue;
 import static org.testng.Assert.*;
 
 import java.io.UncheckedIOException;
@@ -40,14 +43,17 @@ import java.math.BigInteger;
 import java.net.NetworkInterface;
 import java.net.SocketException;
 import java.util.Locale;
+import java.util.Optional;
 
-import jdk.test.lib.net.IPSupport;
 
 public class NullMacAddress {
 
     @BeforeTest
     void setup() {
-        IPSupport.throwSkippedExceptionIfNonOperational();
+        Optional<String> configurationIssue = diagnoseConfigurationIssue();
+        configurationIssue.map(SkipException::new).ifPresent(x -> {
+            throw x;
+        });
     }
 
     @Test
diff --git a/test/jdk/java/net/SocketOption/ImmutableOptions.java b/test/jdk/java/net/SocketOption/ImmutableOptions.java
index f15734edddc..372a0322a35 100644
--- a/test/jdk/java/net/SocketOption/ImmutableOptions.java
+++ b/test/jdk/java/net/SocketOption/ImmutableOptions.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2016, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2016, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -33,18 +33,23 @@ import java.io.IOException;
 import java.io.InputStream;
 import java.io.OutputStream;
 import java.net.*;
+import java.util.Optional;
 import java.util.Set;
 
-import jdk.test.lib.net.IPSupport;
-
+import org.testng.SkipException;
 import org.testng.annotations.BeforeTest;
 import org.testng.annotations.Test;
 
+import static jdk.test.lib.net.IPSupport.diagnoseConfigurationIssue;
+
 public class ImmutableOptions {
 
     @BeforeTest
     void setupServerSocketFactory() throws IOException {
-        IPSupport.throwSkippedExceptionIfNonOperational();
+        Optional<String> configurationIssue = diagnoseConfigurationIssue();
+        configurationIssue.map(SkipException::new).ifPresent(x -> {
+            throw x;
+        });
         ServerSocket.setSocketFactory(new ServerSocketImplFactory());
     }
 
diff --git a/test/jdk/java/net/httpclient/quic/VariableLengthTest.java b/test/jdk/java/net/httpclient/quic/VariableLengthTest.java
index cf05b91b18f..6d805fbad5a 100644
--- a/test/jdk/java/net/httpclient/quic/VariableLengthTest.java
+++ b/test/jdk/java/net/httpclient/quic/VariableLengthTest.java
@@ -21,7 +21,6 @@
  * questions.
  */
 import jdk.internal.net.http.quic.VariableLengthEncoder;
-import jtreg.SkippedException;
 
 import java.io.IOException;
 import java.nio.ByteBuffer;
@@ -31,9 +30,9 @@ import static org.junit.jupiter.api.Assertions.assertEquals;
 import static org.junit.jupiter.api.Assertions.assertFalse;
 import static org.junit.jupiter.api.Assertions.assertThrows;
 import static org.junit.jupiter.api.Assertions.assertTrue;
-import static org.junit.jupiter.api.Assertions.assertThrows;
 import org.junit.jupiter.params.ParameterizedTest;
 import org.junit.jupiter.params.provider.MethodSource;
+import org.opentest4j.TestAbortedException;
 
 /*
  * @test
@@ -345,7 +344,7 @@ public class VariableLengthTest {
             case 2 -> ByteBuffer.allocate(capacity).putShort((short) length);
             case 4 -> ByteBuffer.allocate(capacity).putInt((int) length);
             case 8 -> ByteBuffer.allocate(capacity).putLong(length);
-            default -> throw new SkippedException("bad value used for capacity");
+            default -> throw new TestAbortedException("bad value used for capacity");
         };
     }
 }
diff --git a/test/jdk/java/net/spi/InetAddressResolverProvider/LookupPolicyMappingTest.java b/test/jdk/java/net/spi/InetAddressResolverProvider/LookupPolicyMappingTest.java
index bbfa9f5555c..13ca6e50aaf 100644
--- a/test/jdk/java/net/spi/InetAddressResolverProvider/LookupPolicyMappingTest.java
+++ b/test/jdk/java/net/spi/InetAddressResolverProvider/LookupPolicyMappingTest.java
@@ -31,9 +31,11 @@ import static java.net.spi.InetAddressResolver.LookupPolicy.IPV4;
 import static java.net.spi.InetAddressResolver.LookupPolicy.IPV4_FIRST;
 import static java.net.spi.InetAddressResolver.LookupPolicy.IPV6;
 import static java.net.spi.InetAddressResolver.LookupPolicy.IPV6_FIRST;
+import static jdk.test.lib.net.IPSupport.diagnoseConfigurationIssue;
 
 import jdk.test.lib.net.IPSupport;
 import jdk.test.lib.NetworkConfiguration;
+import org.junit.jupiter.api.Assumptions;
 import org.junit.jupiter.api.Test;
 
 import static org.junit.jupiter.api.Assertions.assertTrue;
@@ -95,7 +97,7 @@ public class LookupPolicyMappingTest {
 
     // Throws SkipException if platform doesn't support required IP address types
     static void checkPlatformNetworkConfiguration() {
-        IPSupport.throwSkippedExceptionIfNonOperational();
+        diagnoseConfigurationIssue().ifPresent(Assumptions::abort);
         IPSupport.printPlatformSupport(System.err);
         NetworkConfiguration.printSystemConfiguration(System.err);
         // If preferIPv4=true and no IPv4 - skip
diff --git a/test/jdk/java/nio/channels/DatagramChannel/AfterDisconnect.java b/test/jdk/java/nio/channels/DatagramChannel/AfterDisconnect.java
index 44a34ea3e55..285e98c0fc6 100644
--- a/test/jdk/java/nio/channels/DatagramChannel/AfterDisconnect.java
+++ b/test/jdk/java/nio/channels/DatagramChannel/AfterDisconnect.java
@@ -49,8 +49,11 @@ import java.util.HashMap;
 import java.util.Map;
 import java.util.function.Predicate;
 
+import static jdk.test.lib.net.IPSupport.diagnoseConfigurationIssue;
+
 import jdk.test.lib.net.IPSupport;
 
+import org.junit.jupiter.api.Assumptions;
 import org.junit.jupiter.api.Test;
 
 import static java.nio.charset.StandardCharsets.UTF_8;
@@ -92,7 +95,8 @@ public class AfterDisconnect {
 
     @Test
     public void execute() throws IOException {
-        IPSupport.throwSkippedExceptionIfNonOperational();
+        diagnoseConfigurationIssue().ifPresent(Assumptions::abort);
+
         boolean preferIPv6 = Boolean.getBoolean("java.net.preferIPv6Addresses");
         InetAddress lb = InetAddress.getLoopbackAddress();
 
diff --git a/test/jdk/java/nio/channels/DatagramChannel/SendReceiveMaxSize.java b/test/jdk/java/nio/channels/DatagramChannel/SendReceiveMaxSize.java
index cb6e66dd5de..7d41382cf65 100644
--- a/test/jdk/java/nio/channels/DatagramChannel/SendReceiveMaxSize.java
+++ b/test/jdk/java/nio/channels/DatagramChannel/SendReceiveMaxSize.java
@@ -83,14 +83,14 @@ import static java.net.StandardProtocolFamily.INET;
 import static java.net.StandardProtocolFamily.INET6;
 import static java.net.StandardSocketOptions.SO_SNDBUF;
 import static java.net.StandardSocketOptions.SO_RCVBUF;
-import static jdk.test.lib.net.IPSupport.hasIPv4;
-import static jdk.test.lib.net.IPSupport.hasIPv6;
-import static jdk.test.lib.net.IPSupport.preferIPv4Stack;
 
 import org.junit.jupiter.api.BeforeAll;
 import org.junit.jupiter.params.ParameterizedTest;
 import org.junit.jupiter.params.provider.Arguments;
 import org.junit.jupiter.params.provider.MethodSource;
+import org.junit.jupiter.api.Assumptions;
+
+import static jdk.test.lib.net.IPSupport.*;
 import static org.junit.jupiter.api.Assertions.assertEquals;
 import static org.junit.jupiter.api.Assertions.assertThrows;
 import static org.junit.jupiter.api.Assertions.assertTrue;
@@ -107,7 +107,7 @@ public class SendReceiveMaxSize {
 
     @BeforeAll
     public static void setUp() {
-        IPSupport.throwSkippedExceptionIfNonOperational();
+        diagnoseConfigurationIssue().ifPresent(Assumptions::abort);
     }
 
     public static List<Arguments> testCases() throws IOException {
diff --git a/test/jdk/java/nio/channels/etc/LocalSocketAddressType.java b/test/jdk/java/nio/channels/etc/LocalSocketAddressType.java
index 60e41af6288..7439c7e436b 100644
--- a/test/jdk/java/nio/channels/etc/LocalSocketAddressType.java
+++ b/test/jdk/java/nio/channels/etc/LocalSocketAddressType.java
@@ -42,9 +42,9 @@ import java.util.Iterator;
 import java.util.stream.Stream;
 
 import static java.lang.System.out;
+
 import static jdk.test.lib.net.IPSupport.*;
 
-import jtreg.SkippedException;
 import org.junit.jupiter.api.Assumptions;
 import org.junit.jupiter.api.BeforeAll;
 import org.junit.jupiter.params.ParameterizedTest;
@@ -56,12 +56,7 @@ public class LocalSocketAddressType {
     @BeforeAll()
     public static void setup() {
         IPSupport.printPlatformSupport(out);
-        try {
-            throwSkippedExceptionIfNonOperational();
-        } catch (SkippedException skippedException) {
-            // jtreg.SkippedException would cause a JUnit test to fail
-            Assumptions.assumeTrue(false, skippedException.getMessage());
-        }
+        diagnoseConfigurationIssue().ifPresent(Assumptions::abort);
     }
 
     public static Iterator<Object[]> addresses() throws Exception {
diff --git a/test/jdk/java/nio/channels/etc/OpenAndConnect.java b/test/jdk/java/nio/channels/etc/OpenAndConnect.java
index 0e0347ebb57..ffdbebcc9a5 100644
--- a/test/jdk/java/nio/channels/etc/OpenAndConnect.java
+++ b/test/jdk/java/nio/channels/etc/OpenAndConnect.java
@@ -42,7 +42,6 @@ import static java.net.StandardProtocolFamily.INET;
 import static java.net.StandardProtocolFamily.INET6;
 import static jdk.test.lib.net.IPSupport.*;
 
-import jtreg.SkippedException;
 import org.junit.jupiter.api.Assumptions;
 import org.junit.jupiter.api.BeforeAll;
 import org.junit.jupiter.params.ParameterizedTest;
@@ -89,12 +88,7 @@ public class OpenAndConnect {
     public static void setup() {
         NetworkConfiguration.printSystemConfiguration(out);
         IPSupport.printPlatformSupport(out);
-        try {
-            throwSkippedExceptionIfNonOperational();
-        } catch (SkippedException skippedException) {
-            // jtreg.SkippedException would cause a JUnit test to fail
-            Assumptions.assumeTrue(false, skippedException.getMessage());
-        }
+        diagnoseConfigurationIssue().ifPresent(Assumptions::abort);
 
         out.println("IA4LOCAL:    " + IA4LOCAL);
         out.println("IA6LOCAL:    " + IA6LOCAL);
diff --git a/test/jdk/java/nio/channels/etc/ProtocolFamilies.java b/test/jdk/java/nio/channels/etc/ProtocolFamilies.java
index 7f823ff35a8..2419cdd73cf 100644
--- a/test/jdk/java/nio/channels/etc/ProtocolFamilies.java
+++ b/test/jdk/java/nio/channels/etc/ProtocolFamilies.java
@@ -45,7 +45,6 @@ import static java.net.StandardProtocolFamily.INET;
 import static java.net.StandardProtocolFamily.INET6;
 import static jdk.test.lib.net.IPSupport.*;
 
-import jtreg.SkippedException;
 import org.junit.jupiter.api.Assumptions;
 import org.junit.jupiter.api.BeforeAll;
 import org.junit.jupiter.api.Test;
@@ -77,12 +76,7 @@ public class ProtocolFamilies {
     public static void setup() throws Exception {
         NetworkConfiguration.printSystemConfiguration(out);
         IPSupport.printPlatformSupport(out);
-        try {
-            throwSkippedExceptionIfNonOperational();
-        } catch (SkippedException skippedException) {
-            // jtreg.SkippedException would cause a JUnit test to fail
-            Assumptions.assumeTrue(false, skippedException.getMessage());
-        }
+        diagnoseConfigurationIssue().ifPresent(Assumptions::abort);
 
         ia4 = getLocalIPv4Address();
         ia6 = getLocalIPv6Address();
diff --git a/test/jdk/java/text/Format/DecimalFormat/CloneTest.java b/test/jdk/java/text/Format/DecimalFormat/CloneTest.java
index dabdd137f5f..1a6821777be 100644
--- a/test/jdk/java/text/Format/DecimalFormat/CloneTest.java
+++ b/test/jdk/java/text/Format/DecimalFormat/CloneTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2025, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -29,8 +29,8 @@
  * @run junit/othervm --add-opens=java.base/java.text=ALL-UNNAMED CloneTest
  */
 
-import jtreg.SkippedException;
 import org.junit.jupiter.api.Test;
+import org.opentest4j.TestAbortedException;
 
 import java.lang.reflect.Field;
 import java.math.BigDecimal;
@@ -78,7 +78,7 @@ public class CloneTest {
 
                 digitListClass = digitList.getClass();
             } catch (ReflectiveOperationException e) {
-                throw new SkippedException("reflective access in white-box test failed", e);
+                throw new TestAbortedException("reflective access in white-box test failed", e);
             }
         }
 
@@ -91,7 +91,7 @@ public class CloneTest {
 
                 assertEquals(digitListField.get(original), digitListField.get(dfClone));
             } catch (ReflectiveOperationException e) {
-                throw new SkippedException("reflective access in white-box test failed", e);
+                throw new TestAbortedException("reflective access in white-box test failed", e);
             }
         }
 
diff --git a/test/jdk/jdk/net/ExtendedSocketOption/AsynchronousSocketChannelNAPITest.java b/test/jdk/jdk/net/ExtendedSocketOption/AsynchronousSocketChannelNAPITest.java
index d5994ce0add..7fc86ff9f8f 100644
--- a/test/jdk/jdk/net/ExtendedSocketOption/AsynchronousSocketChannelNAPITest.java
+++ b/test/jdk/jdk/net/ExtendedSocketOption/AsynchronousSocketChannelNAPITest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2020, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -32,7 +32,6 @@
  * @run testng/othervm -Djava.net.preferIPv4Stack=true AsynchronousSocketChannelNAPITest
  */
 
-import jdk.test.lib.net.IPSupport;
 import org.testng.SkipException;
 import org.testng.annotations.BeforeTest;
 import org.testng.annotations.Test;
@@ -44,7 +43,9 @@ import java.net.SocketException;
 import java.nio.ByteBuffer;
 import java.nio.channels.AsynchronousServerSocketChannel;
 import java.nio.channels.AsynchronousSocketChannel;
+import java.util.Optional;
 
+import static jdk.test.lib.net.IPSupport.diagnoseConfigurationIssue;
 import static org.testng.Assert.assertEquals;
 import static org.testng.Assert.assertThrows;
 import static org.testng.Assert.assertTrue;
@@ -59,7 +60,10 @@ public class AsynchronousSocketChannelNAPITest {
 
     @BeforeTest
     public void setup() throws IOException {
-        IPSupport.throwSkippedExceptionIfNonOperational();
+        Optional<String> configurationIssue = diagnoseConfigurationIssue();
+        configurationIssue.map(SkipException::new).ifPresent(x -> {
+            throw x;
+        });
         try (var sc = AsynchronousSocketChannel.open();
              var ssc = AsynchronousServerSocketChannel.open()) {
             if (!sc.supportedOptions().contains(SO_INCOMING_NAPI_ID)) {
diff --git a/test/jdk/jdk/net/ExtendedSocketOption/DatagramChannelNAPITest.java b/test/jdk/jdk/net/ExtendedSocketOption/DatagramChannelNAPITest.java
index 24623e52cf1..d38b0c5da88 100644
--- a/test/jdk/jdk/net/ExtendedSocketOption/DatagramChannelNAPITest.java
+++ b/test/jdk/jdk/net/ExtendedSocketOption/DatagramChannelNAPITest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2020, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -31,7 +31,6 @@
  * @run testng/othervm -Djava.net.preferIPv4Stack=true DatagramChannelNAPITest
  */
 
-import jdk.test.lib.net.IPSupport;
 import org.testng.SkipException;
 import org.testng.annotations.BeforeTest;
 import org.testng.annotations.Test;
@@ -42,7 +41,9 @@ import java.net.InetSocketAddress;
 import java.net.SocketException;
 import java.nio.ByteBuffer;
 import java.nio.channels.DatagramChannel;
+import java.util.Optional;
 
+import static jdk.test.lib.net.IPSupport.diagnoseConfigurationIssue;
 import static org.testng.Assert.assertEquals;
 import static org.testng.Assert.assertThrows;
 import static org.testng.Assert.assertTrue;
@@ -56,7 +57,10 @@ public class DatagramChannelNAPITest {
 
     @BeforeTest
     public void setup() throws IOException {
-        IPSupport.throwSkippedExceptionIfNonOperational();
+        Optional<String> configurationIssue = diagnoseConfigurationIssue();
+        configurationIssue.map(SkipException::new).ifPresent(x -> {
+            throw x;
+        });
         try (var dc = DatagramChannel.open()) {
             if (!dc.supportedOptions().contains(SO_INCOMING_NAPI_ID)) {
                 assertThrows(UOE, () -> dc.getOption(SO_INCOMING_NAPI_ID));
diff --git a/test/jdk/jdk/net/ExtendedSocketOption/DatagramSocketNAPITest.java b/test/jdk/jdk/net/ExtendedSocketOption/DatagramSocketNAPITest.java
index 446b74355b6..1ece78adec1 100644
--- a/test/jdk/jdk/net/ExtendedSocketOption/DatagramSocketNAPITest.java
+++ b/test/jdk/jdk/net/ExtendedSocketOption/DatagramSocketNAPITest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2020, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -37,12 +37,13 @@ import java.net.DatagramPacket;
 import java.net.InetAddress;
 import java.net.InetSocketAddress;
 import java.net.SocketException;
+import java.util.Optional;
 
-import jdk.test.lib.net.IPSupport;
 import org.testng.SkipException;
 import org.testng.annotations.BeforeTest;
 import org.testng.annotations.Test;
 
+import static jdk.test.lib.net.IPSupport.diagnoseConfigurationIssue;
 import static org.testng.Assert.assertEquals;
 import static org.testng.Assert.assertTrue;
 import static org.testng.Assert.assertThrows;
@@ -56,7 +57,10 @@ public class DatagramSocketNAPITest {
 
     @BeforeTest
     public void setup() throws IOException {
-        IPSupport.throwSkippedExceptionIfNonOperational();
+        Optional<String> configurationIssue = diagnoseConfigurationIssue();
+        configurationIssue.map(SkipException::new).ifPresent(x -> {
+            throw x;
+        });
         try (var ds = new DatagramSocket()) {
             if (!ds.supportedOptions().contains(SO_INCOMING_NAPI_ID)) {
                 assertThrows(UOE, () -> ds.getOption(SO_INCOMING_NAPI_ID));
diff --git a/test/jdk/jdk/net/ExtendedSocketOption/SocketChannelNAPITest.java b/test/jdk/jdk/net/ExtendedSocketOption/SocketChannelNAPITest.java
index 898b9725310..b1427d22db6 100644
--- a/test/jdk/jdk/net/ExtendedSocketOption/SocketChannelNAPITest.java
+++ b/test/jdk/jdk/net/ExtendedSocketOption/SocketChannelNAPITest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2020, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -32,7 +32,6 @@
  * @run testng/othervm -Djava.net.preferIPv4Stack=true SocketChannelNAPITest
  */
 
-import jdk.test.lib.net.IPSupport;
 import org.testng.SkipException;
 import org.testng.annotations.BeforeTest;
 import org.testng.annotations.Test;
@@ -44,7 +43,9 @@ import java.net.SocketException;
 import java.nio.ByteBuffer;
 import java.nio.channels.ServerSocketChannel;
 import java.nio.channels.SocketChannel;
+import java.util.Optional;
 
+import static jdk.test.lib.net.IPSupport.diagnoseConfigurationIssue;
 import static org.testng.Assert.assertEquals;
 import static org.testng.Assert.assertThrows;
 import static org.testng.Assert.assertTrue;
@@ -59,7 +60,10 @@ public class SocketChannelNAPITest {
 
     @BeforeTest
     public void setup() throws IOException {
-        IPSupport.throwSkippedExceptionIfNonOperational();
+        Optional<String> configurationIssue = diagnoseConfigurationIssue();
+        configurationIssue.map(SkipException::new).ifPresent(x -> {
+            throw x;
+        });
         try (var s = SocketChannel.open();
              var ssc = ServerSocketChannel.open()) {
             if (!s.supportedOptions().contains(SO_INCOMING_NAPI_ID)) {
diff --git a/test/jdk/jdk/net/ExtendedSocketOption/SocketNAPITest.java b/test/jdk/jdk/net/ExtendedSocketOption/SocketNAPITest.java
index 2947c6ce878..057bf7cc91d 100644
--- a/test/jdk/jdk/net/ExtendedSocketOption/SocketNAPITest.java
+++ b/test/jdk/jdk/net/ExtendedSocketOption/SocketNAPITest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2020, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -41,12 +41,13 @@ import java.net.InetSocketAddress;
 import java.net.ServerSocket;
 import java.net.Socket;
 import java.net.SocketException;
+import java.util.Optional;
 
-import jdk.test.lib.net.IPSupport;
 import org.testng.SkipException;
 import org.testng.annotations.BeforeTest;
 import org.testng.annotations.Test;
 
+import static jdk.test.lib.net.IPSupport.diagnoseConfigurationIssue;
 import static org.testng.Assert.assertEquals;
 import static org.testng.Assert.assertThrows;
 import static org.testng.Assert.assertTrue;
@@ -61,7 +62,10 @@ public class SocketNAPITest {
 
     @BeforeTest
     public void setup() throws IOException {
-        IPSupport.throwSkippedExceptionIfNonOperational();
+        Optional<String> configurationIssue = diagnoseConfigurationIssue();
+        configurationIssue.map(SkipException::new).ifPresent(x -> {
+            throw x;
+        });
         try (var s = new Socket();
              var ss = new ServerSocket()) {
             if (!s.supportedOptions().contains(SO_INCOMING_NAPI_ID)) {

From a27e7ca7565ad0e0e4acfae22ebd3f9191966edc Mon Sep 17 00:00:00 2001
From: Coleen Phillimore <coleenp@openjdk.org>
Date: Wed, 8 Apr 2026 11:43:45 +0000
Subject: [PATCH 518/655] 8381793: Clean up unused ProblemList-coh.txt

Reviewed-by: dholmes
---
 test/jdk/ProblemList-coh.txt | 41 ------------------------------------
 1 file changed, 41 deletions(-)

diff --git a/test/jdk/ProblemList-coh.txt b/test/jdk/ProblemList-coh.txt
index b3bddb0c9f4..e69de29bb2d 100644
--- a/test/jdk/ProblemList-coh.txt
+++ b/test/jdk/ProblemList-coh.txt
@@ -1,41 +0,0 @@
-#
-# Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
-# DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
-#
-# This code is free software; you can redistribute it and/or modify it
-# under the terms of the GNU General Public License version 2 only, as
-# published by the Free Software Foundation.
-#
-# This code is distributed in the hope that it will be useful, but WITHOUT
-# ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-# FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
-# version 2 for more details (a copy is included in the LICENSE file that
-# accompanied this code).
-#
-# You should have received a copy of the GNU General Public License version
-# 2 along with this work; if not, write to the Free Software Foundation,
-# Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
-#
-# Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
-# or visit www.oracle.com if you need additional information or have any
-# questions.
-#
-
-#############################################################################
-#
-# List of quarantined tests for testing with -XX:+UseCompactObjectHeaders
-#
-#############################################################################
-
-#############################################################################
-
-# Preview project specific failures go here at the end of the file.
-#
-# These are NOT failures that occur with the '--enable-preview' option
-# specified; those go in the appropriate ProblemList-enable-preview.txt file.
-# These are failures that occur WITHOUT the '--enable-preview' option
-# specified AND occur because of some issue with preview project code,
-# in either implementation or test code.
-
-#############################################################################
-

From 2ff1a29212f7767ff9d22050c39d573d59821dfb Mon Sep 17 00:00:00 2001
From: Thomas Schatzl <tschatzl@openjdk.org>
Date: Wed, 8 Apr 2026 11:44:12 +0000
Subject: [PATCH 519/655] 8381703: G1: Racy re-read of
 G1CMRootRegion::num_remaining_regions causes assertion failures

Reviewed-by: iwalulya, ayang
---
 src/hotspot/share/gc/g1/g1ConcurrentMark.cpp | 17 ++++++++++++++---
 1 file changed, 14 insertions(+), 3 deletions(-)

diff --git a/src/hotspot/share/gc/g1/g1ConcurrentMark.cpp b/src/hotspot/share/gc/g1/g1ConcurrentMark.cpp
index 4c646c82b8a..a72d5fc5cf9 100644
--- a/src/hotspot/share/gc/g1/g1ConcurrentMark.cpp
+++ b/src/hotspot/share/gc/g1/g1ConcurrentMark.cpp
@@ -1131,23 +1131,34 @@ bool G1ConcurrentMark::scan_root_regions(WorkerThreads* workers, bool concurrent
   //
   // Concurrent gc threads enter an STS when starting the task, so they stop, then
   // continue after that safepoint.
-  bool do_scan = !root_regions()->work_completed() && !has_root_region_scan_aborted();
+  //
+  // Must not use G1CMRootMemRegions::work_completed() here because we need to get a
+  // consistent view of the value containing the number of remaining regions across the
+  // usages below. The safepoint/gc may already be running and modifying it
+  // while this code is still executing.
+  uint num_remaining = root_regions()->num_remaining_regions();
+  bool do_scan = num_remaining > 0 && !has_root_region_scan_aborted();
   if (do_scan) {
     // Assign one worker to each root-region but subject to the max constraint.
     // The constraint is also important to avoid accesses beyond the allocated per-worker
     // marking helper data structures. We might get passed different WorkerThreads with
     // different number of threads (potential worker ids) than helper data structures when
     // completing this work during GC.
-    const uint num_workers = MIN2(root_regions()->num_remaining_regions(),
+    const uint num_workers = MIN2(num_remaining,
                                   _max_concurrent_workers);
     assert(num_workers > 0, "no more remaining root regions to process");
 
     G1CMRootRegionScanTask task(this, concurrent);
     log_debug(gc, ergo)("Running %s using %u workers for %u work units.",
-                        task.name(), num_workers, root_regions()->num_remaining_regions());
+                        task.name(), num_workers, num_remaining);
     workers->run_task(&task, num_workers);
   }
 
+  // At the end of this method, we can re-read num_remaining() in the assert: either
+  // we got non-zero above and we processed all root regions (and it must be zero
+  // after the worker task synchronization) or it had already been zero. We also
+  // can't have started another concurrent cycle that could have set it to something else
+  // while still in the concurrent cycle (if called concurrently).
   assert_root_region_scan_completed_or_aborted();
 
   return do_scan;

From 28a91d0e3ab630be8893483a71b9198340677408 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Manuel=20H=C3=A4ssig?= <mhaessig@openjdk.org>
Date: Wed, 8 Apr 2026 12:00:42 +0000
Subject: [PATCH 520/655] 8381795: AArch64: Optimized build is broken after
 JDK-8381003

Reviewed-by: chagedorn, jsikstro, eastigeevich
---
 src/hotspot/os_cpu/linux_aarch64/icache_linux_aarch64.cpp | 2 +-
 src/hotspot/os_cpu/linux_aarch64/icache_linux_aarch64.hpp | 2 +-
 2 files changed, 2 insertions(+), 2 deletions(-)

diff --git a/src/hotspot/os_cpu/linux_aarch64/icache_linux_aarch64.cpp b/src/hotspot/os_cpu/linux_aarch64/icache_linux_aarch64.cpp
index 41cad5af325..11911a48e06 100644
--- a/src/hotspot/os_cpu/linux_aarch64/icache_linux_aarch64.cpp
+++ b/src/hotspot/os_cpu/linux_aarch64/icache_linux_aarch64.cpp
@@ -25,4 +25,4 @@
 #include "runtime/icache.hpp"
 #include "utilities/globalDefinitions.hpp"
 
-NOT_PRODUCT(THREAD_LOCAL AArch64ICacheInvalidationContext* AArch64ICacheInvalidationContext::_current_context = nullptr;)
+DEBUG_ONLY(THREAD_LOCAL AArch64ICacheInvalidationContext* AArch64ICacheInvalidationContext::_current_context = nullptr;)
diff --git a/src/hotspot/os_cpu/linux_aarch64/icache_linux_aarch64.hpp b/src/hotspot/os_cpu/linux_aarch64/icache_linux_aarch64.hpp
index 444b3c3ebd6..5121a875701 100644
--- a/src/hotspot/os_cpu/linux_aarch64/icache_linux_aarch64.hpp
+++ b/src/hotspot/os_cpu/linux_aarch64/icache_linux_aarch64.hpp
@@ -82,7 +82,7 @@ class AArch64ICacheInvalidationContext : StackObj {
   }
 
   ~AArch64ICacheInvalidationContext() {
-    NOT_PRODUCT(_current_context = nullptr);
+    DEBUG_ONLY(_current_context = nullptr);
 
     if (!_has_modified_code || !UseSingleICacheInvalidation) {
       return;

From cc1c427f476601d33ed13307f5a1febc0100d53e Mon Sep 17 00:00:00 2001
From: Erik Gahlin <egahlin@openjdk.org>
Date: Wed, 8 Apr 2026 12:19:07 +0000
Subject: [PATCH 521/655] 8380755:
 jdk/jfr/event/gc/heapsummary/TestHeapSummaryEventG1.java fails gcId should be
 increasing

Reviewed-by: dholmes, mgronlun
---
 .../gc/heapsummary/HeapSummaryEventAllGcs.java  |  4 ++--
 test/lib/jdk/test/lib/jfr/Events.java           | 17 ++++++++++++++++-
 2 files changed, 18 insertions(+), 3 deletions(-)

diff --git a/test/jdk/jdk/jfr/event/gc/heapsummary/HeapSummaryEventAllGcs.java b/test/jdk/jdk/jfr/event/gc/heapsummary/HeapSummaryEventAllGcs.java
index 2baf87eae31..178d796e1b0 100644
--- a/test/jdk/jdk/jfr/event/gc/heapsummary/HeapSummaryEventAllGcs.java
+++ b/test/jdk/jdk/jfr/event/gc/heapsummary/HeapSummaryEventAllGcs.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2013, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2013, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -48,7 +48,7 @@ public class HeapSummaryEventAllGcs {
         GCHelper.callSystemGc(5, true);
         recording.stop();
 
-        List<RecordedEvent> allEvents = Events.fromRecording(recording);
+        List<RecordedEvent> allEvents = Events.fromRecordingOrdered(recording);
         if (!checkCollectors(allEvents, expectedYoungCollector, expectedOldCollector)) {
             return;
         }
diff --git a/test/lib/jdk/test/lib/jfr/Events.java b/test/lib/jdk/test/lib/jfr/Events.java
index 8bbf22ca63a..03e1e39cfe3 100644
--- a/test/lib/jdk/test/lib/jfr/Events.java
+++ b/test/lib/jdk/test/lib/jfr/Events.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2013, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2013, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -33,6 +33,7 @@ import java.io.IOException;
 import java.nio.file.Path;
 import java.time.Duration;
 import java.time.Instant;
+import java.util.Comparator;
 import java.util.List;
 
 import jdk.jfr.AnnotationElement;
@@ -280,6 +281,20 @@ public class Events {
         return RecordingFile.readAllEvents(makeCopy(recording));
     }
 
+    /**
+     * Creates a list of events from a recording, ordered by the end time.
+     *
+     * @param recording recording, not {@code null}
+     * @return a list, not null
+     * @throws IOException if an event set could not be created due to I/O
+     *         errors.
+     */
+    public static List<RecordedEvent> fromRecordingOrdered(Recording recording) throws IOException {
+       List<RecordedEvent> events = fromRecording(recording);
+       events.sort(Comparator.comparing(RecordedEvent::getEndTime));
+       return events;
+    }
+
     public static RecordingFile copyTo(Recording r) throws IOException {
         return new RecordingFile(makeCopy(r));
     }

From 988ec86dc6137d3798030a188bb9b214120a553d Mon Sep 17 00:00:00 2001
From: Serhiy Sachkov <serhiy.sachkov@oracle.com>
Date: Wed, 8 Apr 2026 13:02:51 +0000
Subject: [PATCH 522/655] 8381838:
 java/net/DatagramSocket/SendReceiveMaxSize.java fails to compile after
 JDK-8381008

Reviewed-by: ayang, jpai, dfuchs
---
 test/jdk/java/net/DatagramSocket/SendReceiveMaxSize.java | 1 +
 1 file changed, 1 insertion(+)

diff --git a/test/jdk/java/net/DatagramSocket/SendReceiveMaxSize.java b/test/jdk/java/net/DatagramSocket/SendReceiveMaxSize.java
index 2b68af9cbf2..36eae0b5c32 100644
--- a/test/jdk/java/net/DatagramSocket/SendReceiveMaxSize.java
+++ b/test/jdk/java/net/DatagramSocket/SendReceiveMaxSize.java
@@ -87,6 +87,7 @@
 
 import jdk.test.lib.RandomFactory;
 import jdk.test.lib.Platform;
+import jdk.test.lib.net.IPSupport;
 import org.testng.SkipException;
 import org.testng.annotations.BeforeTest;
 import org.testng.annotations.DataProvider;

From 52a54dacb82e172192d143fb44cf53c299e6b08b Mon Sep 17 00:00:00 2001
From: Daniel Fuchs <dfuchs@openjdk.org>
Date: Wed, 8 Apr 2026 15:41:27 +0000
Subject: [PATCH 523/655] 8381616: Refactor various java/net/*Socket*/ TestNG
 tests to use JUnit

Reviewed-by: alanb
---
 .../net/DatagramSocketImpl/TestCreate.java    |   9 +-
 .../TestDefaultBehavior.java                  |  38 ++---
 .../java/net/MulticastSocket/Constructor.java |   8 +-
 .../net/MulticastSocket/IPMulticastIF.java    |  75 ++++-----
 .../net/MulticastSocket/SendPortZero.java     |  49 +++---
 .../MulticastSocket/SetLoopbackOption.java    |  15 +-
 test/jdk/java/net/Socket/ConnectionReset.java | 117 +++++++-------
 test/jdk/java/net/Socket/UdpSocket.java       |   8 +-
 test/jdk/java/net/SocketImpl/BadUsages.java   | 144 +++++++++++-------
 .../net/SocketImpl/ImplSupportedOptions.java  |  51 ++++---
 .../SocketImpl/SocketImplCombinations.java    | 123 ++++++++++-----
 .../net/SocketImpl/TestDefaultBehavior.java   |  38 ++---
 12 files changed, 374 insertions(+), 301 deletions(-)

diff --git a/test/jdk/java/net/DatagramSocketImpl/TestCreate.java b/test/jdk/java/net/DatagramSocketImpl/TestCreate.java
index 81772074ae2..8d526cf0530 100644
--- a/test/jdk/java/net/DatagramSocketImpl/TestCreate.java
+++ b/test/jdk/java/net/DatagramSocketImpl/TestCreate.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2020, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,10 +25,9 @@
  * @test
  * @bug 8238231
  * @summary test that DatagramSocket calls java.net.DatagramSocketImpl::create
- * @run testng/othervm TestCreate
+ * @run junit/othervm ${test.main.class}
  */
 
-import org.testng.annotations.Test;
 
 import java.io.IOException;
 import java.net.DatagramPacket;
@@ -44,7 +43,9 @@ import java.util.Iterator;
 import java.util.List;
 import java.util.Set;
 import java.util.concurrent.atomic.AtomicBoolean;
-import static org.testng.Assert.assertTrue;
+
+import org.junit.jupiter.api.Test;
+import static org.junit.jupiter.api.Assertions.assertTrue;
 
 public class TestCreate {
 
diff --git a/test/jdk/java/net/DatagramSocketImpl/TestDefaultBehavior.java b/test/jdk/java/net/DatagramSocketImpl/TestDefaultBehavior.java
index 2e223f1820c..c4e88b6a2c0 100644
--- a/test/jdk/java/net/DatagramSocketImpl/TestDefaultBehavior.java
+++ b/test/jdk/java/net/DatagramSocketImpl/TestDefaultBehavior.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2019, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2019, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,7 +25,7 @@
  * @test
  * @bug 8224477
  * @summary Basic test for java.net.DatagramSocketImpl default behavior
- * @run testng TestDefaultBehavior
+ * @run junit ${test.main.class}
  */
 
 import java.io.IOException;
@@ -36,11 +36,13 @@ import java.net.NetworkInterface;
 import java.net.SocketAddress;
 import java.net.SocketOption;
 import java.util.Set;
-import org.testng.annotations.Test;
 import static java.lang.Boolean.*;
 import static java.net.StandardSocketOptions.*;
-import static org.testng.Assert.assertEquals;
-import static org.testng.Assert.expectThrows;
+
+import org.junit.jupiter.api.Test;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertThrows;
+
 
 public class TestDefaultBehavior {
 
@@ -51,21 +53,21 @@ public class TestDefaultBehavior {
     public void datagramSocketImpl() {
         CustomDatagramSocketImpl dsi = new CustomDatagramSocketImpl();
 
-        assertEquals(dsi.supportedOptions().size(), 0);
+        assertEquals(0, dsi.supportedOptions().size());
 
-        expectThrows(NPE, () -> dsi.setOption(null, null));
-        expectThrows(NPE, () -> dsi.setOption(null, 1));
-        expectThrows(UOE, () -> dsi.setOption(SO_RCVBUF, 100));
-        expectThrows(UOE, () -> dsi.setOption(SO_KEEPALIVE, TRUE));
-        expectThrows(UOE, () -> dsi.setOption(SO_KEEPALIVE, FALSE));
-        expectThrows(UOE, () -> dsi.setOption(FAKE_SOCK_OPT, TRUE));
-        expectThrows(UOE, () -> dsi.setOption(FAKE_SOCK_OPT, FALSE));
-        expectThrows(UOE, () -> dsi.setOption(SO_KEEPALIVE, TRUE));
+        assertThrows(NPE, () -> dsi.setOption(null, null));
+        assertThrows(NPE, () -> dsi.setOption(null, 1));
+        assertThrows(UOE, () -> dsi.setOption(SO_RCVBUF, 100));
+        assertThrows(UOE, () -> dsi.setOption(SO_KEEPALIVE, TRUE));
+        assertThrows(UOE, () -> dsi.setOption(SO_KEEPALIVE, FALSE));
+        assertThrows(UOE, () -> dsi.setOption(FAKE_SOCK_OPT, TRUE));
+        assertThrows(UOE, () -> dsi.setOption(FAKE_SOCK_OPT, FALSE));
+        assertThrows(UOE, () -> dsi.setOption(SO_KEEPALIVE, TRUE));
 
-        expectThrows(NPE, () -> dsi.getOption(null));
-        expectThrows(UOE, () -> dsi.getOption(SO_RCVBUF));
-        expectThrows(UOE, () -> dsi.getOption(SO_KEEPALIVE));
-        expectThrows(UOE, () -> dsi.getOption(FAKE_SOCK_OPT));
+        assertThrows(NPE, () -> dsi.getOption(null));
+        assertThrows(UOE, () -> dsi.getOption(SO_RCVBUF));
+        assertThrows(UOE, () -> dsi.getOption(SO_KEEPALIVE));
+        assertThrows(UOE, () -> dsi.getOption(FAKE_SOCK_OPT));
     }
 
     static final SocketOption<Boolean> FAKE_SOCK_OPT = new SocketOption<>() {
diff --git a/test/jdk/java/net/MulticastSocket/Constructor.java b/test/jdk/java/net/MulticastSocket/Constructor.java
index 6a765cc2f04..296fe1ab105 100644
--- a/test/jdk/java/net/MulticastSocket/Constructor.java
+++ b/test/jdk/java/net/MulticastSocket/Constructor.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2020, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -24,15 +24,15 @@
 /* @test
  * @bug 8243999
  * @summary Checks to ensure that Multicast constructors behave as expected
- * @run testng Constructor
+ * @run junit ${test.main.class}
  */
 
-import org.testng.annotations.Test;
 
 import java.io.IOException;
 import java.net.MulticastSocket;
 
-import static org.testng.Assert.assertTrue;
+import org.junit.jupiter.api.Test;
+import static org.junit.jupiter.api.Assertions.assertTrue;
 
 public class Constructor {
     @Test
diff --git a/test/jdk/java/net/MulticastSocket/IPMulticastIF.java b/test/jdk/java/net/MulticastSocket/IPMulticastIF.java
index 6f6e7dd1942..3d526c9b3d3 100644
--- a/test/jdk/java/net/MulticastSocket/IPMulticastIF.java
+++ b/test/jdk/java/net/MulticastSocket/IPMulticastIF.java
@@ -27,44 +27,41 @@ import java.net.MulticastSocket;
 import java.net.NetworkInterface;
 import java.util.ArrayList;
 import java.util.List;
-import java.util.Optional;
 
 import jdk.test.lib.NetworkConfiguration;
-import org.testng.SkipException;
-import org.testng.annotations.BeforeTest;
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
+import static jdk.test.lib.net.IPSupport.diagnoseConfigurationIssue;
 import static java.lang.String.format;
 import static java.lang.System.out;
 import static java.net.StandardSocketOptions.IP_MULTICAST_IF;
 import static java.util.stream.Collectors.toList;
-import static jdk.test.lib.net.IPSupport.diagnoseConfigurationIssue;
-import static org.testng.Assert.assertEquals;
-import static org.testng.Assert.assertTrue;
+
+import org.junit.jupiter.api.Assumptions;
+import org.junit.jupiter.api.BeforeAll;
+import org.junit.jupiter.api.Test;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertTrue;
 
 /**
  * @test
  * @bug 8236441
  * @summary Bound MulticastSocket fails when setting outbound interface on Windows
  * @library /test/lib
- * @run testng IPMulticastIF
- * @run testng/othervm -Djava.net.preferIPv4Stack=true IPMulticastIF
- * @run testng/othervm -Djava.net.preferIPv6Addresses=true IPMulticastIF
- * @run testng/othervm -Djava.net.preferIPv6Addresses=true -Djava.net.preferIPv4Stack=true IPMulticastIF
+ * @run junit ${test.main.class}
+ * @run junit/othervm -Djava.net.preferIPv4Stack=true ${test.main.class}
+ * @run junit/othervm -Djava.net.preferIPv6Addresses=true ${test.main.class}
+ * @run junit/othervm -Djava.net.preferIPv6Addresses=true -Djava.net.preferIPv4Stack=true ${test.main.class}
  */
 public class IPMulticastIF {
 
-    @BeforeTest
-    public void sanity() {
-        Optional<String> configurationIssue = diagnoseConfigurationIssue();
-        configurationIssue.map(SkipException::new).ifPresent(x -> {
-            throw x;
-        });
+    @BeforeAll
+    public static void sanity() {
+        diagnoseConfigurationIssue().ifPresent(Assumptions::abort);
         NetworkConfiguration.printSystemConfiguration(out);
     }
 
-    @DataProvider(name = "scenarios")
-    public Object[][] positive() throws Exception {
+    public static Object[][] positive() throws Exception {
         List<InetAddress> addrs = List.of(InetAddress.getLocalHost(),
                                           InetAddress.getLoopbackAddress());
         List<Object[]> list = new ArrayList<>();
@@ -81,8 +78,7 @@ public class IPMulticastIF {
         return list.stream().toArray(Object[][]::new);
     }
 
-    @DataProvider(name = "interfaces")
-    public Object[][] interfaces() throws Exception {
+    public static Object[][] interfaces() throws Exception {
         List<Object[]> list = new ArrayList<>();
         NetworkConfiguration nc = NetworkConfiguration.probe();
         nc.multicastInterfaces(true)
@@ -92,7 +88,8 @@ public class IPMulticastIF {
         return list.stream().toArray(Object[][]::new);
     }
 
-    @Test(dataProvider = "scenarios")
+    @ParameterizedTest
+    @MethodSource("positive")
     public void testSetGetInterfaceBound(InetSocketAddress bindAddr, NetworkInterface nif)
         throws Exception
     {
@@ -100,11 +97,12 @@ public class IPMulticastIF {
         try (MulticastSocket ms = new MulticastSocket(bindAddr)) {
             ms.setNetworkInterface(nif);
             NetworkInterface msNetIf = ms.getNetworkInterface();
-            assertEquals(msNetIf, nif);
+            assertEquals(nif, msNetIf);
         }
     }
 
-    @Test(dataProvider = "interfaces")
+    @ParameterizedTest
+    @MethodSource("interfaces")
     public void testSetGetInterfaceUnbound(NetworkInterface nif)
         throws Exception
     {
@@ -112,11 +110,12 @@ public class IPMulticastIF {
         try (MulticastSocket ms = new MulticastSocket()) {
             ms.setNetworkInterface(nif);
             NetworkInterface msNetIf = ms.getNetworkInterface();
-            assertEquals(msNetIf, nif);
+            assertEquals(nif, msNetIf);
         }
     }
 
-    @Test(dataProvider = "scenarios")
+    @ParameterizedTest
+    @MethodSource("positive")
     public void testSetGetOptionBound(InetSocketAddress bindAddr, NetworkInterface nif)
         throws Exception
     {
@@ -124,11 +123,12 @@ public class IPMulticastIF {
         try (MulticastSocket ms = new MulticastSocket(bindAddr)) {
             ms.setOption(IP_MULTICAST_IF, nif);
             NetworkInterface msNetIf = ms.getOption(IP_MULTICAST_IF);
-            assertEquals(msNetIf, nif);
+            assertEquals(nif, msNetIf);
         }
     }
 
-    @Test(dataProvider = "interfaces")
+    @ParameterizedTest
+    @MethodSource("interfaces")
     public void testSetGetOptionUnbound(NetworkInterface nif)
         throws Exception
     {
@@ -136,21 +136,21 @@ public class IPMulticastIF {
         try (MulticastSocket ms = new MulticastSocket()) {
             ms.setOption(IP_MULTICAST_IF, nif);
             NetworkInterface msNetIf = ms.getOption(IP_MULTICAST_IF);
-            assertEquals(msNetIf, nif);
+            assertEquals(nif, msNetIf);
         }
     }
 
     // -- get without set
 
-    @DataProvider(name = "bindAddresses")
-    public Object[][] bindAddresses() throws Exception {
+    public static Object[][] bindAddresses() throws Exception {
         return new Object[][] {
             { new InetSocketAddress(InetAddress.getLocalHost(), 0)       },
             { new InetSocketAddress(InetAddress.getLoopbackAddress(), 0) },
         };
     }
 
-    @Test(dataProvider = "bindAddresses")
+    @ParameterizedTest
+    @MethodSource("bindAddresses")
     public void testGetInterfaceBound(InetSocketAddress bindAddr)
         throws Exception
     {
@@ -168,13 +168,14 @@ public class IPMulticastIF {
         }
     }
 
-    @Test(dataProvider = "bindAddresses")
+    @ParameterizedTest
+    @MethodSource("bindAddresses")
     public void testGetOptionBound(InetSocketAddress bindAddr)
         throws Exception
     {
         out.println(format("\n\n--- testGetOptionBound bindAddr=[%s]", bindAddr));
         try (MulticastSocket ms = new MulticastSocket(bindAddr)) {
-            assertEquals(ms.getOption(IP_MULTICAST_IF), null);
+            assertEquals(null, ms.getOption(IP_MULTICAST_IF));
         }
     }
 
@@ -182,7 +183,7 @@ public class IPMulticastIF {
     public void testGetOptionUnbound() throws Exception {
         out.println("\n\n--- testGetOptionUnbound ");
         try (MulticastSocket ms = new MulticastSocket()) {
-            assertEquals(ms.getOption(IP_MULTICAST_IF), null);
+            assertEquals(null, ms.getOption(IP_MULTICAST_IF));
         }
     }
 
@@ -190,7 +191,7 @@ public class IPMulticastIF {
     // that represent any local address.
     static void assertPlaceHolder(NetworkInterface nif) {
         List<InetAddress> addrs = nif.inetAddresses().collect(toList());
-        assertEquals(addrs.size(), 1);
+        assertEquals(1, addrs.size());
         assertTrue(addrs.get(0).isAnyLocalAddress());
     }
 }
diff --git a/test/jdk/java/net/MulticastSocket/SendPortZero.java b/test/jdk/java/net/MulticastSocket/SendPortZero.java
index 0d8acd86c8c..ab06dfdd45d 100644
--- a/test/jdk/java/net/MulticastSocket/SendPortZero.java
+++ b/test/jdk/java/net/MulticastSocket/SendPortZero.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2020, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -21,39 +21,39 @@
  * questions.
  */
 
-import org.testng.annotations.AfterTest;
-import org.testng.annotations.BeforeTest;
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
 
 import java.io.IOException;
 import java.net.DatagramPacket;
 import java.net.MulticastSocket;
 import java.net.InetAddress;
 import java.net.InetSocketAddress;
-import java.net.MulticastSocket;
 import java.net.SocketException;
-import java.nio.channels.DatagramChannel;
 
-import static org.testng.Assert.assertThrows;
+import org.junit.jupiter.api.AfterAll;
+
+import org.junit.jupiter.api.BeforeAll;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
+import static org.junit.jupiter.api.Assertions.assertFalse;
+import static org.junit.jupiter.api.Assertions.assertThrows;
 
 /*
  * @test
  * @bug 8243408
  * @summary Check that MulticastSocket throws expected
  *          Exception when sending a DatagramPacket with port 0
- * @run testng/othervm SendPortZero
+ * @run junit/othervm ${test.main.class}
  */
 
 public class SendPortZero {
-    private InetAddress loopbackAddr, wildcardAddr;
-    private MulticastSocket multicastSocket;
-    private DatagramPacket loopbackZeroPkt, wildcardZeroPkt, wildcardValidPkt;
+    private static InetAddress loopbackAddr, wildcardAddr;
+    private static MulticastSocket multicastSocket;
+    private static DatagramPacket loopbackZeroPkt, wildcardZeroPkt, wildcardValidPkt;
 
     private static final Class<SocketException> SE = SocketException.class;
 
-    @BeforeTest
-    public void setUp() throws IOException {
+    @BeforeAll
+    public static void setUp() throws IOException {
         multicastSocket = new MulticastSocket();
 
         byte[] buf = "test".getBytes();
@@ -80,23 +80,26 @@ public class SendPortZero {
         wildcardValidPkt.setPort(multicastSocket.getLocalPort());
     }
 
-    @DataProvider(name = "data")
-    public Object[][] variants() {
+    public static Object[][] testCases() throws IOException {
         return new Object[][]{
-                { multicastSocket,       loopbackZeroPkt },
-                { multicastSocket,       wildcardZeroPkt },
+                { new MulticastSocket(),       loopbackZeroPkt },
+                { new MulticastSocket(),       wildcardZeroPkt },
                 // Not currently tested. See JDK-8236807
-                //{ multicastSocket,       wildcardValidPkt }
+                //{ new MulticastSocket(),       wildcardValidPkt }
         };
     }
 
-    @Test(dataProvider = "data")
+    @ParameterizedTest
+    @MethodSource("testCases")
     public void testSend(MulticastSocket ms, DatagramPacket pkt) {
-        assertThrows(SE, () -> ms.send(pkt));
+        try (ms) {
+            assertFalse(ms.isClosed());
+            assertThrows(SE, () -> ms.send(pkt));
+        }
     }
 
-    @AfterTest
-    public void tearDown() {
+    @AfterAll
+    public static void tearDown() {
         multicastSocket.close();
     }
 }
diff --git a/test/jdk/java/net/MulticastSocket/SetLoopbackOption.java b/test/jdk/java/net/MulticastSocket/SetLoopbackOption.java
index ed831cfbdf7..8185c71345d 100644
--- a/test/jdk/java/net/MulticastSocket/SetLoopbackOption.java
+++ b/test/jdk/java/net/MulticastSocket/SetLoopbackOption.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2019, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2019, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -28,9 +28,9 @@
  *          return the correct result for StandardSocketOptions.IP_MULTICAST_LOOP.
  *          The test sets a DatagramSocketImplFactory and needs to run in /othervm
  *          mode.
- * @run testng/othervm SetLoopbackOption
- * @run testng/othervm -Djava.net.preferIPv4Stack=true SetLoopbackOption
- * @run testng/othervm -Djava.net.preferIPv6Addresses=true SetLoopbackOption
+ * @run junit/othervm ${test.main.class}
+ * @run junit/othervm -Djava.net.preferIPv4Stack=true ${test.main.class}
+ * @run junit/othervm -Djava.net.preferIPv6Addresses=true ${test.main.class}
  */
 
 import java.io.FileDescriptor;
@@ -52,11 +52,12 @@ import java.util.HashMap;
 import java.util.Map;
 import java.util.Set;
 
-import org.testng.annotations.Test;
-import static org.testng.Assert.*;
-
 import static java.lang.System.out;
 
+import org.junit.jupiter.api.Test;
+import static org.junit.jupiter.api.Assertions.assertFalse;
+import static org.junit.jupiter.api.Assertions.assertTrue;
+
 public class SetLoopbackOption {
 
     final InetAddress loopbackAddress = InetAddress.getLoopbackAddress();
diff --git a/test/jdk/java/net/Socket/ConnectionReset.java b/test/jdk/java/net/Socket/ConnectionReset.java
index 41be61ac7e1..630bd61a606 100644
--- a/test/jdk/java/net/Socket/ConnectionReset.java
+++ b/test/jdk/java/net/Socket/ConnectionReset.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2019, 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2019, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,7 +23,7 @@
 
 /**
  * @test
- * @run testng ConnectionReset
+ * @run junit ${test.main.class}
  * @summary Test behavior of read and available when a connection is reset
  */
 
@@ -34,10 +34,13 @@ import java.net.InetSocketAddress;
 import java.net.ServerSocket;
 import java.net.Socket;
 
-import org.testng.annotations.Test;
-import static org.testng.Assert.*;
+import org.junit.jupiter.api.Test;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertNotEquals;
+import static org.junit.jupiter.api.Assertions.assertThrows;
+import static org.junit.jupiter.api.Assertions.assertTrue;
 
-@Test
 public class ConnectionReset {
 
     static final int REPEAT_COUNT = 5;
@@ -45,25 +48,23 @@ public class ConnectionReset {
     /**
      * Tests available before read when there are no bytes to read
      */
+    @Test
     public void testAvailableBeforeRead1() throws IOException {
-        System.out.println("testAvailableBeforeRead1");
         withResetConnection(null, s -> {
             InputStream in = s.getInputStream();
             for (int i=0; i<REPEAT_COUNT; i++) {
                 int bytesAvailable = in.available();
-                System.out.format("available => %d%n", bytesAvailable);
-                assertTrue(bytesAvailable == 0);
-                try {
+                System.err.format("available => %d%n", bytesAvailable);
+                assertEquals(0, bytesAvailable);
+                IOException ioe = assertThrows(IOException.class, () -> {
                     int bytesRead = in.read();
                     if (bytesRead == -1) {
-                        System.out.println("read => EOF");
+                        System.err.println("read => EOF");
                     } else {
-                        System.out.println("read => 1 byte");
+                        System.err.println("read => 1 byte");
                     }
-                    assertTrue(false);
-                } catch (IOException ioe) {
-                    System.out.format("read => %s (expected)%n", ioe);
-                }
+                });
+                System.err.format("read => %s (expected)%n", ioe);
             }
         });
     }
@@ -71,28 +72,25 @@ public class ConnectionReset {
     /**
      * Tests available before read when there are bytes to read
      */
+    @Test
     public void testAvailableBeforeRead2() throws IOException {
-        System.out.println("testAvailableBeforeRead2");
         byte[] data = { 1, 2, 3 };
         withResetConnection(data, s -> {
             InputStream in = s.getInputStream();
             int remaining = data.length;
             for (int i=0; i<REPEAT_COUNT; i++) {
                 int bytesAvailable = in.available();
-                System.out.format("available => %d%n", bytesAvailable);
+                System.err.format("available => %d%n", bytesAvailable);
                 assertTrue(bytesAvailable <= remaining);
                 try {
                     int bytesRead = in.read();
-                    if (bytesRead == -1) {
-                        System.out.println("read => EOF");
-                        assertTrue(false);
-                    } else {
-                        System.out.println("read => 1 byte");
-                        assertTrue(remaining > 0);
-                        remaining--;
-                    }
+                    assertNotEquals(-1, bytesRead, "EOF not expected");
+
+                    System.err.println("read => 1 byte");
+                    assertTrue(remaining > 0);
+                    remaining--;
                 } catch (IOException ioe) {
-                    System.out.format("read => %s%n", ioe);
+                    System.err.format("read => %s%n", ioe);
                     remaining = 0;
                 }
             }
@@ -102,25 +100,24 @@ public class ConnectionReset {
     /**
      * Tests read before available when there are no bytes to read
      */
+    @Test
     public void testReadBeforeAvailable1() throws IOException {
-        System.out.println("testReadBeforeAvailable1");
         withResetConnection(null, s -> {
             InputStream in = s.getInputStream();
             for (int i=0; i<REPEAT_COUNT; i++) {
-                try {
+                IOException ioe = assertThrows(IOException.class, () -> {
                     int bytesRead = in.read();
                     if (bytesRead == -1) {
-                        System.out.println("read => EOF");
+                        System.err.println("read => EOF");
                     } else {
-                        System.out.println("read => 1 byte");
+                        System.err.println("read => 1 byte");
                     }
-                    assertTrue(false);
-                } catch (IOException ioe) {
-                    System.out.format("read => %s (expected)%n", ioe);
-                }
+                });
+                System.err.format("read => %s (expected)%n", ioe);
+
                 int bytesAvailable = in.available();
-                System.out.format("available => %d%n", bytesAvailable);
-                assertTrue(bytesAvailable == 0);
+                System.err.format("available => %d%n", bytesAvailable);
+                assertEquals(0, bytesAvailable);
             }
         });
     }
@@ -128,8 +125,8 @@ public class ConnectionReset {
     /**
      * Tests read before available when there are bytes to read
      */
+    @Test
     public void testReadBeforeAvailable2() throws IOException {
-        System.out.println("testReadBeforeAvailable2");
         byte[] data = { 1, 2, 3 };
         withResetConnection(data, s -> {
             InputStream in = s.getInputStream();
@@ -137,20 +134,17 @@ public class ConnectionReset {
             for (int i=0; i<REPEAT_COUNT; i++) {
                 try {
                     int bytesRead = in.read();
-                    if (bytesRead == -1) {
-                        System.out.println("read => EOF");
-                        assertTrue(false);
-                    } else {
-                        System.out.println("read => 1 byte");
-                        assertTrue(remaining > 0);
-                        remaining--;
-                    }
+                    assertNotEquals(-1, bytesRead, "EOF not expected");
+
+                    System.err.println("read => 1 byte");
+                    assertTrue(remaining > 0);
+                    remaining--;
                 } catch (IOException ioe) {
-                    System.out.format("read => %s%n", ioe);
+                    System.err.format("read => %s%n", ioe);
                     remaining = 0;
                 }
                 int bytesAvailable = in.available();
-                System.out.format("available => %d%n", bytesAvailable);
+                System.err.format("available => %d%n", bytesAvailable);
                 assertTrue(bytesAvailable <= remaining);
             }
         });
@@ -159,31 +153,22 @@ public class ConnectionReset {
     /**
      * Tests available and read on a socket closed after connection reset
      */
+    @Test
     public void testAfterClose() throws IOException {
-        System.out.println("testAfterClose");
         withResetConnection(null, s -> {
             InputStream in = s.getInputStream();
-            try {
-                in.read();
-                assertTrue(false);
-            } catch (IOException ioe) {
-                // expected
-            }
+            assertThrows(IOException.class, () -> in.read());
             s.close();
-            try {
+            IOException ioe = assertThrows(IOException.class, () -> {
                 int bytesAvailable = in.available();
-                System.out.format("available => %d%n", bytesAvailable);
-                assertTrue(false);
-            } catch (IOException ioe) {
-                System.out.format("available => %s (expected)%n", ioe);
-            }
-            try {
+                System.err.format("available => %d%n", bytesAvailable);
+            });
+            System.err.format("available => %s (expected)%n", ioe);
+            ioe = assertThrows(IOException.class, () -> {
                 int n = in.read();
-                System.out.format("read => %d%n", n);
-                assertTrue(false);
-            } catch (IOException ioe) {
-                System.out.format("read => %s (expected)%n", ioe);
-            }
+                System.err.format("read => %d%n", n);
+            });
+            System.err.format("read => %s (expected)%n", ioe);
         });
     }
 
diff --git a/test/jdk/java/net/Socket/UdpSocket.java b/test/jdk/java/net/Socket/UdpSocket.java
index 7e93343cefb..47bf09d1334 100644
--- a/test/jdk/java/net/Socket/UdpSocket.java
+++ b/test/jdk/java/net/Socket/UdpSocket.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2019, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2019, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -24,13 +24,13 @@
 import java.net.InetAddress;
 import java.net.Socket;
 
-import org.testng.annotations.Test;
-import static org.testng.Assert.fail;
+import org.junit.jupiter.api.Test;
+import static org.junit.jupiter.api.Assertions.fail;
 
 /*
  * @test
  * @summary Basic test for the UDP sockets through the java.net.Socket constructors
- * @run testng UdpSocket
+ * @run junit ${test.main.class}
  */
 public class UdpSocket {
 
diff --git a/test/jdk/java/net/SocketImpl/BadUsages.java b/test/jdk/java/net/SocketImpl/BadUsages.java
index b5d85708dde..ca0ab6fe71e 100644
--- a/test/jdk/java/net/SocketImpl/BadUsages.java
+++ b/test/jdk/java/net/SocketImpl/BadUsages.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2019, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2019, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -26,7 +26,7 @@
  * @bug 8221481
  * @summary Test the platform SocketImpl when used in unintended ways
  * @compile/module=java.base java/net/PlatformSocketImpl.java
- * @run testng/othervm BadUsages
+ * @run junit/othervm ${test.main.class}
  */
 
 import java.io.IOException;
@@ -41,8 +41,8 @@ import java.net.StandardSocketOptions;
 
 import java.net.PlatformSocketImpl;  // test helper
 
-import org.testng.annotations.Test;
-import static org.testng.Assert.*;
+import org.junit.jupiter.api.Test;
+import static org.junit.jupiter.api.Assertions.*;
 
 /**
  * SocketImpl does not specify how the SocketImpl behaves when used in ways
@@ -54,74 +54,80 @@ import static org.testng.Assert.*;
  * throws reasonable exceptions, for these scenarios.
  */
 
-@Test
 public class BadUsages {
 
     /**
      * Test create when already created.
      */
+    @Test
     public void testCreate1() throws IOException {
         try (var impl = new PlatformSocketImpl(false)) {
             impl.create(true);
-            expectThrows(IOException.class, () -> impl.create(true));
+            assertThrows(IOException.class, () -> impl.create(true));
         }
     }
 
     /**
      * Test create when closed.
      */
+    @Test
     public void testCreate2() throws IOException {
         var impl = new PlatformSocketImpl(false);
         impl.close();
-        expectThrows(IOException.class, () -> impl.create(true));
+        assertThrows(IOException.class, () -> impl.create(true));
     }
 
     /**
      * Test create when not a stream socket.
      */
+    @Test
     public void testCreate3() throws IOException {
         try (var impl = new PlatformSocketImpl(false)) {
-            expectThrows(IOException.class, () -> impl.create(false));
+            assertThrows(IOException.class, () -> impl.create(false));
         }
     }
 
     /**
      * Test connect when not created.
      */
+    @Test
     public void testConnect1() throws IOException {
         try (var ss = new ServerSocket(0)) {
             var impl = new PlatformSocketImpl(false);
             var address = ss.getInetAddress();
             int port = ss.getLocalPort();
-            expectThrows(IOException.class, () -> impl.connect(address, port));
+            assertThrows(IOException.class, () -> impl.connect(address, port));
         }
     }
 
     /**
      * Test connect with unsupported address type.
      */
+    @Test
     public void testConnect2() throws IOException {
         try (var impl = new PlatformSocketImpl(false)) {
             impl.create(true);
             var remote = new SocketAddress() { };
-            expectThrows(IOException.class, () -> impl.connect(remote, 0));
+            assertThrows(IOException.class, () -> impl.connect(remote, 0));
         }
     }
 
     /**
      * Test connect with an unresolved address.
      */
+    @Test
     public void testConnect3() throws IOException {
         try (var impl = new PlatformSocketImpl(false)) {
             impl.create(true);
             var remote = new InetSocketAddress("blah-blah.blah-blah", 80);
-            expectThrows(IOException.class, () -> impl.connect(remote, 0));
+            assertThrows(IOException.class, () -> impl.connect(remote, 0));
         }
     }
 
     /**
      * Test connect when already connected.
      */
+    @Test
     public void testConnect4() throws IOException {
         try (var ss = new ServerSocket();
              var impl = new PlatformSocketImpl(false)) {
@@ -130,47 +136,51 @@ public class BadUsages {
             impl.create(true);
             int port = ss.getLocalPort();
             impl.connect(loopback, port);
-            expectThrows(IOException.class, () -> impl.connect(loopback, port));
+            assertThrows(IOException.class, () -> impl.connect(loopback, port));
         }
     }
 
     /**
      * Test connect when closed.
      */
+    @Test
     public void testConnect5() throws IOException {
         try (var ss = new ServerSocket(0)) {
             var impl = new PlatformSocketImpl(false);
             impl.close();
             String host = ss.getInetAddress().getHostAddress();
             int port = ss.getLocalPort();
-            expectThrows(IOException.class, () -> impl.connect(host, port));
+            assertThrows(IOException.class, () -> impl.connect(host, port));
         }
     }
 
     /**
      * Test bind when not created.
      */
+    @Test
     public void testBind1() throws IOException {
         var impl = new PlatformSocketImpl(false);
         var loopback = InetAddress.getLoopbackAddress();
-        expectThrows(IOException.class, () -> impl.bind(loopback, 0));
+        assertThrows(IOException.class, () -> impl.bind(loopback, 0));
     }
 
     /**
      * Test bind when already bound.
      */
+    @Test
     public void testBind2() throws IOException {
         try (var impl = new PlatformSocketImpl(false)) {
             impl.create(true);
             var loopback = InetAddress.getLoopbackAddress();
             impl.bind(loopback, 0);
-            expectThrows(IOException.class, () -> impl.bind(loopback, 0));
+            assertThrows(IOException.class, () -> impl.bind(loopback, 0));
         }
     }
 
     /**
      * Test bind when connected.
      */
+    @Test
     public void testBind3() throws IOException {
         try (var ss = new ServerSocket();
              var impl = new PlatformSocketImpl(false)) {
@@ -178,94 +188,103 @@ public class BadUsages {
             ss.bind(new InetSocketAddress(loopback, 0));
             impl.create(true);
             impl.connect(ss.getLocalSocketAddress(), 0);
-            expectThrows(IOException.class, () -> impl.bind(loopback, 0));
+            assertThrows(IOException.class, () -> impl.bind(loopback, 0));
         }
     }
 
     /**
      * Test bind when closed.
      */
+    @Test
     public void testBind4() throws IOException {
         var impl = new PlatformSocketImpl(false);
         impl.close();
         var loopback = InetAddress.getLoopbackAddress();
-        expectThrows(IOException.class, () -> impl.bind(loopback, 0));
+        assertThrows(IOException.class, () -> impl.bind(loopback, 0));
     }
 
 
     /**
      * Test listen when not created.
      */
+    @Test
     public void testListen1() {
         var impl = new PlatformSocketImpl(false);
-        expectThrows(IOException.class, () -> impl.listen(16));
+        assertThrows(IOException.class, () -> impl.listen(16));
     }
 
     /**
      * Test listen when not bound.
      */
+    @Test
     public void testListen2() throws IOException {
         try (var impl = new PlatformSocketImpl(false)) {
             impl.create(true);
-            expectThrows(IOException.class, () -> impl.listen(16));
+            assertThrows(IOException.class, () -> impl.listen(16));
         }
     }
 
     /**
      * Test listen when closed.
      */
+    @Test
     public void testListen3() throws IOException {
         var impl = new PlatformSocketImpl(false);
         impl.close();
-        expectThrows(IOException.class, () -> impl.listen(16));
+        assertThrows(IOException.class, () -> impl.listen(16));
     }
 
     /**
      * Test accept when not created.
      */
+    @Test
     public void testAccept1() throws IOException {
         var impl = new PlatformSocketImpl(true);
         var si = new PlatformSocketImpl(false);
-        expectThrows(IOException.class, () -> impl.accept(si));
+        assertThrows(IOException.class, () -> impl.accept(si));
     }
 
     /**
      * Test accept when not bound.
      */
+    @Test
     public void testAccept2() throws IOException {
         try (var impl = new PlatformSocketImpl(true)) {
             impl.create(true);
             var si = new PlatformSocketImpl(false);
-            expectThrows(IOException.class, () -> impl.accept(si));
+            assertThrows(IOException.class, () -> impl.accept(si));
         }
     }
 
     /**
      * Test accept when closed.
      */
+    @Test
     public void testAccept4() throws IOException {
         var impl = new PlatformSocketImpl(true);
         impl.close();
         var si = new PlatformSocketImpl(false);
-        expectThrows(IOException.class, () -> impl.accept(si));
+        assertThrows(IOException.class, () -> impl.accept(si));
     }
 
     /**
      * Test accept with SocketImpl that is already created.
      */
+    @Test
     public void testAccept5() throws IOException {
         try (var impl = new PlatformSocketImpl(true);
              var si = new PlatformSocketImpl(false)) {
             impl.create(true);
             impl.bind(InetAddress.getLoopbackAddress(), 0);
             si.create(true);
-            expectThrows(IOException.class, () -> impl.accept(si));
+            assertThrows(IOException.class, () -> impl.accept(si));
         }
     }
 
     /**
      * Test accept with SocketImpl that is closed.
      */
+    @Test
     public void testAccept6() throws IOException {
         try (var impl = new PlatformSocketImpl(true);
              var si = new PlatformSocketImpl(false)) {
@@ -273,65 +292,71 @@ public class BadUsages {
             impl.bind(InetAddress.getLoopbackAddress(), 0);
             si.create(true);
             si.close();
-            expectThrows(IOException.class, () -> impl.accept(si));
+            assertThrows(IOException.class, () -> impl.accept(si));
         }
     }
 
     /**
      * Test available when not created.
      */
+    @Test
     public void testAvailable1() throws IOException {
         var impl = new PlatformSocketImpl(false);
-        expectThrows(IOException.class, () -> impl.available());
+        assertThrows(IOException.class, () -> impl.available());
     }
 
     /**
      * Test available when created but not connected.
      */
+    @Test
     public void testAvailable2() throws IOException {
         try (var impl = new PlatformSocketImpl(false)) {
             impl.create(true);
-            expectThrows(IOException.class, () -> impl.available());
+            assertThrows(IOException.class, () -> impl.available());
         }
     }
 
     /**
      * Test available when closed.
      */
+    @Test
     public void testAvailable3() throws IOException {
         var impl = new PlatformSocketImpl(false);
         impl.close();
-        expectThrows(IOException.class, () -> impl.available());
+        assertThrows(IOException.class, () -> impl.available());
     }
 
     /**
      * Test setOption when not created.
      */
+    @Test
     public void testSetOption1() throws IOException {
         var impl = new PlatformSocketImpl(false);
-        expectThrows(IOException.class,
+        assertThrows(IOException.class,
                      () -> impl.setOption(StandardSocketOptions.SO_REUSEADDR, true));
         // legacy
-        expectThrows(SocketException.class,
+        assertThrows(SocketException.class,
                      () -> impl.setOption(SocketOptions.SO_REUSEADDR, true));
     }
 
     /**
      * Test setOption when closed.
      */
+    @Test
     public void testSetOption2() throws IOException {
         var impl = new PlatformSocketImpl(false);
         impl.close();
-        expectThrows(IOException.class,
+        assertThrows(IOException.class,
                      () -> impl.setOption(StandardSocketOptions.SO_REUSEADDR, true));
         // legacy
-        expectThrows(SocketException.class,
+        assertThrows(SocketException.class,
                      () -> impl.setOption(SocketOptions.SO_REUSEADDR, true));
     }
 
     /**
      * Test setOption with unsupported option.
      */
+    @Test
     public void testSetOption3() throws IOException {
         try (var impl = new PlatformSocketImpl(false)) {
             impl.create(true);
@@ -339,25 +364,26 @@ public class BadUsages {
                 @Override public String name() { return "birthday"; }
                 @Override public Class<String> type() { return String.class; }
             };
-            expectThrows(UnsupportedOperationException.class, () -> impl.setOption(opt, ""));
+            assertThrows(UnsupportedOperationException.class, () -> impl.setOption(opt, ""));
             // legacy
-            expectThrows(SocketException.class, () -> impl.setOption(-1, ""));
+            assertThrows(SocketException.class, () -> impl.setOption(-1, ""));
         }
     }
 
     /**
      * Test setOption(int, Object) with invalid values.
      */
+    @Test
     public void testSetOption4() throws IOException {
         try (var impl = new PlatformSocketImpl(false)) {
             impl.create(true);
-            expectThrows(SocketException.class,
+            assertThrows(SocketException.class,
                          () -> impl.setOption(SocketOptions.SO_REUSEADDR, -1));
-            expectThrows(SocketException.class,
+            assertThrows(SocketException.class,
                          () -> impl.setOption(SocketOptions.SO_TIMEOUT, -1));
-            expectThrows(SocketException.class,
+            assertThrows(SocketException.class,
                          () -> impl.setOption(SocketOptions.SO_SNDBUF, -1));
-            expectThrows(SocketException.class,
+            assertThrows(SocketException.class,
                          () -> impl.setOption(SocketOptions.SO_RCVBUF, -1));
         }
     }
@@ -365,29 +391,32 @@ public class BadUsages {
     /**
      * Test getOption when not created.
      */
+    @Test
     public void testGetOption1() throws IOException {
         var impl = new PlatformSocketImpl(false);
-        expectThrows(IOException.class,
+        assertThrows(IOException.class,
                      () -> impl.getOption(StandardSocketOptions.SO_REUSEADDR));
-        expectThrows(SocketException.class,
+        assertThrows(SocketException.class,
                      () -> impl.getOption(-1));
     }
 
     /**
      * Test getOption when closed.
      */
+    @Test
     public void testGetOption2() throws IOException {
         var impl = new PlatformSocketImpl(false);
         impl.close();
-        expectThrows(IOException.class,
+        assertThrows(IOException.class,
                      () -> impl.getOption(StandardSocketOptions.SO_REUSEADDR));
-        expectThrows(SocketException.class,
+        assertThrows(SocketException.class,
                      () -> impl.getOption(SocketOptions.SO_REUSEADDR));
     }
 
     /**
      * Test getOption with unsupported option.
      */
+    @Test
     public void testGetOption3() throws IOException {
         try (var impl = new PlatformSocketImpl(false)) {
             impl.create(true);
@@ -395,89 +424,98 @@ public class BadUsages {
                 @Override public String name() { return "birthday"; }
                 @Override public Class<String> type() { return String.class; }
             };
-            expectThrows(UnsupportedOperationException.class, () -> impl.getOption(opt));
-            expectThrows(SocketException.class, () -> impl.getOption(-1));
+            assertThrows(UnsupportedOperationException.class, () -> impl.getOption(opt));
+            assertThrows(SocketException.class, () -> impl.getOption(-1));
         }
     }
 
     /**
      * Test shutdownInput when not created.
      */
+    @Test
     public void testShutdownInput1() throws IOException {
         var impl = new PlatformSocketImpl(false);
-        expectThrows(IOException.class, () -> impl.shutdownInput());
+        assertThrows(IOException.class, () -> impl.shutdownInput());
     }
 
     /**
      * Test shutdownInput when not connected.
      */
+    @Test
     public void testShutdownInput2() throws IOException {
         try (var impl = new PlatformSocketImpl(false)) {
             impl.create(true);
-            expectThrows(IOException.class, () -> impl.shutdownInput());
+            assertThrows(IOException.class, () -> impl.shutdownInput());
         }
     }
 
     /**
      * Test shutdownInput when closed.
      */
+    @Test
     public void testShutdownInput3() throws IOException {
         var impl = new PlatformSocketImpl(false);
         impl.close();
-        expectThrows(IOException.class, () -> impl.shutdownInput());
+        assertThrows(IOException.class, () -> impl.shutdownInput());
     }
 
     /**
      * Test shutdownOutput when not created.
      */
+    @Test
     public void testShutdownOutput1() throws IOException {
         var impl = new PlatformSocketImpl(false);
-        expectThrows(IOException.class, () -> impl.shutdownOutput());
+        assertThrows(IOException.class, () -> impl.shutdownOutput());
     }
 
     /**
      * Test shutdownOutput when not connected.
      */
+    @Test
     public void testShutdownOutput2() throws IOException {
         try (var impl = new PlatformSocketImpl(false)) {
             impl.create(true);
-            expectThrows(IOException.class, () -> impl.shutdownOutput());
+            assertThrows(IOException.class, () -> impl.shutdownOutput());
         }
     }
 
     /**
      * Test shutdownOutput when closed.
      */
+    @Test
     public void testShutdownOutput3() throws IOException {
         var impl = new PlatformSocketImpl(false);
         impl.close();
-        expectThrows(IOException.class, () -> impl.shutdownOutput());
+        assertThrows(IOException.class, () -> impl.shutdownOutput());
     }
 
     /**
      * Test sendUrgentData when not created.
      */
+    @Test
     public void testSendUrgentData1() throws IOException {
         var impl = new PlatformSocketImpl(false);
-        expectThrows(IOException.class, () -> impl.sendUrgentData(0));
+        assertThrows(IOException.class, () -> impl.sendUrgentData(0));
     }
 
     /**
      * Test sendUrgentData when not connected.
      */
+    @Test
     public void testSendUrgentData2() throws IOException {
         try (var impl = new PlatformSocketImpl(false)) {
             impl.create(true);
-            expectThrows(IOException.class, () -> impl.sendUrgentData(0));
+            assertThrows(IOException.class, () -> impl.sendUrgentData(0));
         }
     }
 
     /**
      * Test sendUrgentData when closed.
      */
+    @Test
     public void testSendUrgentData3() throws IOException {
         var impl = new PlatformSocketImpl(false);
         impl.close();
-        expectThrows(IOException.class, () -> impl.sendUrgentData(0));
+        assertThrows(IOException.class, () -> impl.sendUrgentData(0));
     }
 }
diff --git a/test/jdk/java/net/SocketImpl/ImplSupportedOptions.java b/test/jdk/java/net/SocketImpl/ImplSupportedOptions.java
index 51d523dce82..422f292bd97 100644
--- a/test/jdk/java/net/SocketImpl/ImplSupportedOptions.java
+++ b/test/jdk/java/net/SocketImpl/ImplSupportedOptions.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,7 +25,7 @@
  * @test
  * @bug 8213418
  * @summary Ensure correct impl supported socket options
- * @run testng ImplSupportedOptions
+ * @run junit ${test.main.class}
  */
 
 import java.io.IOException;
@@ -40,9 +40,10 @@ import java.net.SocketImpl;
 import java.net.SocketOption;
 import java.net.StandardSocketOptions;
 import java.util.Set;
-import org.testng.annotations.Test;
-import static org.testng.Assert.assertEquals;
-import static org.testng.Assert.assertTrue;
+
+import org.junit.jupiter.api.Test;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertTrue;
 
 public class ImplSupportedOptions {
 
@@ -52,29 +53,29 @@ public class ImplSupportedOptions {
         Set<?> standardOptions = s.supportedOptions();
         assertTrue(standardOptions.contains(StandardSocketOptions.SO_LINGER),
                    "Expected SO_LINGER, in:" + standardOptions);
-        assertEquals(standardOptions, s.supportedOptions());
-        assertEquals(standardOptions, s.supportedOptions());
+        assertEquals(s.supportedOptions(), standardOptions);
+        assertEquals(s.supportedOptions(), standardOptions);
 
         s = new DummySocket();
         Set<?> dummyOptions = s.supportedOptions();
-        assertEquals(dummyOptions.size(), 1);
+        assertEquals(1, dummyOptions.size());
         assertTrue(dummyOptions.contains(DummySocketImpl.SOCKET_OPT));
-        assertEquals(dummyOptions, s.supportedOptions());
-        assertEquals(dummyOptions, s.supportedOptions());
+        assertEquals(s.supportedOptions(), dummyOptions);
+        assertEquals(s.supportedOptions(), dummyOptions);
 
         s = new Socket();
         standardOptions = s.supportedOptions();
         assertTrue(standardOptions.contains(StandardSocketOptions.SO_LINGER),
                    "Expected SO_LINGER, in:" + standardOptions);
-        assertEquals(standardOptions, s.supportedOptions());
-        assertEquals(standardOptions, s.supportedOptions());
+        assertEquals(s.supportedOptions(), standardOptions);
+        assertEquals(s.supportedOptions(), standardOptions);
 
         s = new DummySocket();
         dummyOptions = s.supportedOptions();
-        assertEquals(dummyOptions.size(), 1);
+        assertEquals(1, dummyOptions.size());
         assertTrue(dummyOptions.contains(DummySocketImpl.SOCKET_OPT));
-        assertEquals(dummyOptions, s.supportedOptions());
-        assertEquals(dummyOptions, s.supportedOptions());
+        assertEquals(s.supportedOptions(), dummyOptions);
+        assertEquals(s.supportedOptions(), dummyOptions);
     }
 
     @Test
@@ -83,29 +84,29 @@ public class ImplSupportedOptions {
         Set<?> standardOptions = s.supportedOptions();
         assertTrue(standardOptions.contains(StandardSocketOptions.SO_REUSEADDR),
                    "Expected SO_REUSEADDR, in:" + standardOptions);
-        assertEquals(standardOptions, s.supportedOptions());
-        assertEquals(standardOptions, s.supportedOptions());
+        assertEquals(s.supportedOptions(), standardOptions);
+        assertEquals(s.supportedOptions(), standardOptions);
 
         s = new DummyServerSocket();
         Set<?> dummyOptions = s.supportedOptions();
-        assertEquals(dummyOptions.size(), 1);
+        assertEquals(1, dummyOptions.size());
         assertTrue(dummyOptions.contains(DummySocketImpl.SOCKET_OPT));
-        assertEquals(dummyOptions, s.supportedOptions());
-        assertEquals(dummyOptions, s.supportedOptions());
+        assertEquals(s.supportedOptions(), dummyOptions);
+        assertEquals(s.supportedOptions(), dummyOptions);
 
         s = new ServerSocket();
         standardOptions = s.supportedOptions();
         assertTrue(standardOptions.contains(StandardSocketOptions.SO_REUSEADDR),
                    "Expected SO_REUSEADDR, in:" + standardOptions);
-        assertEquals(standardOptions, s.supportedOptions());
-        assertEquals(standardOptions, s.supportedOptions());
+        assertEquals(s.supportedOptions(), standardOptions);
+        assertEquals(s.supportedOptions(), standardOptions);
 
         s = new DummyServerSocket();
         dummyOptions = s.supportedOptions();
-        assertEquals(dummyOptions.size(), 1);
+        assertEquals(1, dummyOptions.size());
         assertTrue(dummyOptions.contains(DummySocketImpl.SOCKET_OPT));
-        assertEquals(dummyOptions, s.supportedOptions());
-        assertEquals(dummyOptions, s.supportedOptions());
+        assertEquals(s.supportedOptions(), dummyOptions);
+        assertEquals(s.supportedOptions(), dummyOptions);
     }
 
     static class DummySocket extends Socket {
diff --git a/test/jdk/java/net/SocketImpl/SocketImplCombinations.java b/test/jdk/java/net/SocketImpl/SocketImplCombinations.java
index 8fe8600bbb3..3a7968db909 100644
--- a/test/jdk/java/net/SocketImpl/SocketImplCombinations.java
+++ b/test/jdk/java/net/SocketImpl/SocketImplCombinations.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2019, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2019, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,7 +25,7 @@
  * @test
  * @bug 8220493
  * @modules java.base/java.net:+open java.base/sun.nio.ch:+open
- * @run testng/othervm SocketImplCombinations
+ * @run junit/othervm ${test.main.class}
  * @summary Test Socket and ServerSocket with combinations of SocketImpls
  */
 
@@ -46,15 +46,22 @@ import java.nio.channels.ServerSocketChannel;
 import java.nio.channels.SocketChannel;
 import java.util.function.BiConsumer;
 
-import org.testng.annotations.Test;
-import static org.testng.Assert.*;
+import org.junit.jupiter.api.Test;
+
+import static org.junit.jupiter.api.Assertions.assertInstanceOf;
+import static org.junit.jupiter.api.Assertions.assertNotEquals;
+import static org.junit.jupiter.api.Assertions.assertNotNull;
+import static org.junit.jupiter.api.Assertions.assertNull;
+import static org.junit.jupiter.api.Assertions.assertSame;
+import static org.junit.jupiter.api.Assertions.assertThrows;
+import static org.junit.jupiter.api.Assertions.assertTrue;
 
-@Test
 public class SocketImplCombinations {
 
     /**
      * Test creating an unconnected Socket, it should be created with a platform SocketImpl.
      */
+    @Test
     public void testNewSocket1() throws IOException {
         try (Socket s = new Socket()) {
             SocketImpl si = getSocketImpl(s);
@@ -67,6 +74,7 @@ public class SocketImplCombinations {
     /**
      * Test creating a connected Socket, it should be created with a platform SocketImpl.
      */
+    @Test
     public void testNewSocket2() throws IOException {
         try (ServerSocket ss = boundServerSocket()) {
             try (Socket s = new Socket(ss.getInetAddress(), ss.getLocalPort())) {
@@ -82,6 +90,7 @@ public class SocketImplCombinations {
      * Test creating a Socket for a DIRECT connection, it should be created with a
      * platform SocketImpl.
      */
+    @Test
     public void testNewSocket3() throws IOException {
         try (Socket s = new Socket(Proxy.NO_PROXY)) {
             SocketImpl si = getSocketImpl(s);
@@ -93,6 +102,7 @@ public class SocketImplCombinations {
      * Test creating a Socket for a SOCKS connection, it should be created with a
      * SOCKS SocketImpl.
      */
+    @Test
     public void testNewSocket4() throws IOException {
         var address = new InetSocketAddress("127.0.0.1", 1080);
         var socksProxy = new Proxy(Proxy.Type.SOCKS, address);
@@ -105,9 +115,10 @@ public class SocketImplCombinations {
     }
 
     /**
-     * Test creating a Socket for a HTTP proxy connection, it should be created with
-     * a HTTP proxy SocketImpl.
+     * Test creating a Socket for an HTTP proxy connection, it should be created with
+     * an HTTP proxy SocketImpl.
      */
+    @Test
     public void testNewSocket5() throws IOException {
         var address = new InetSocketAddress("127.0.0.1", 8080);
         var httpProxy = new Proxy(Proxy.Type.HTTP, address);
@@ -123,10 +134,11 @@ public class SocketImplCombinations {
      * Test creating a Socket no SocketImpl. A platform SocketImpl should be
      * created lazily.
      */
+    @Test
     public void testNewSocket6() throws IOException {
         Socket s = new Socket((SocketImpl) null) { };
         try (s) {
-            assertTrue(getSocketImpl(s) == null);
+            assertNull(getSocketImpl(s));
             s.bind(loopbackSocketAddress());   // force SocketImpl to be created
             SocketImpl si = getSocketImpl(s);
             assertTrue(isSocksSocketImpl(si));
@@ -138,22 +150,24 @@ public class SocketImplCombinations {
     /**
      * Test creating a Socket with a custom SocketImpl.
      */
+    @Test
     public void testNewSocket7() throws IOException {
         Socket s = new Socket(new CustomSocketImpl(false)) { };
         try (s) {
             SocketImpl si = getSocketImpl(s);
-            assertTrue(si instanceof CustomSocketImpl);
+            assertInstanceOf(CustomSocketImpl.class, si);
         }
     }
 
     /**
      * Test creating a Socket when there is a SocketImplFactory set.
      */
+    @Test
     public void testNewSocket8() throws IOException {
         setSocketSocketImplFactory(() -> new CustomSocketImpl(false));
         try (Socket s = new Socket()) {
             SocketImpl si = getSocketImpl(s);
-            assertTrue(si instanceof CustomSocketImpl);
+            assertInstanceOf(CustomSocketImpl.class, si);
         } finally {
             setSocketSocketImplFactory(null);
         }
@@ -163,11 +177,12 @@ public class SocketImplCombinations {
      * Test creating a Socket for a DIRECT connection when there is a
      * SocketImplFactory set.
      */
+    @Test
     public void testNewSocket9() throws IOException {
         setSocketSocketImplFactory(() -> new CustomSocketImpl(false));
         try (Socket s = new Socket(Proxy.NO_PROXY)) {
             SocketImpl si = getSocketImpl(s);
-            assertTrue(si instanceof CustomSocketImpl);
+            assertInstanceOf(CustomSocketImpl.class, si);
         } finally {
             setSocketSocketImplFactory(null);
         }
@@ -177,6 +192,7 @@ public class SocketImplCombinations {
      * Test creating a Socket for a SOCKS connection when there is a
      * SocketImplFactory set.
      */
+    @Test
     public void testNewSocket10() throws IOException {
         var address = new InetSocketAddress("127.0.0.1", 1080);
         var socksProxy = new Proxy(Proxy.Type.SOCKS, address);
@@ -192,9 +208,10 @@ public class SocketImplCombinations {
     }
 
     /**
-     * Test creating a Socket for a HTTP proxy connection when there is a
+     * Test creating a Socket for an HTTP proxy connection when there is a
      * SocketImplFactory set.
      */
+    @Test
     public void testNewSocket11() throws IOException {
         var address = new InetSocketAddress("127.0.0.1", 8080);
         var httpProxy = new Proxy(Proxy.Type.HTTP, address);
@@ -212,14 +229,15 @@ public class SocketImplCombinations {
     /**
      * Test creating a Socket no SocketImpl when there is a SocketImplFactory set.
      */
+    @Test
     public void testNewSocket12() throws IOException {
         setSocketSocketImplFactory(() -> new CustomSocketImpl(false));
         try {
             Socket s = new Socket((SocketImpl) null) { };
             try (s) {
-                assertTrue(getSocketImpl(s) == null);
+                assertNull(getSocketImpl(s));
                 s.bind(loopbackSocketAddress());   // force SocketImpl to be created
-                assertTrue(getSocketImpl(s) instanceof CustomSocketImpl);
+                assertInstanceOf(CustomSocketImpl.class, getSocketImpl(s));
             }
         } finally {
             setSocketSocketImplFactory(null);
@@ -230,6 +248,7 @@ public class SocketImplCombinations {
      * Test creating an unbound ServerSocket, it should be created with a platform
      * SocketImpl.
      */
+    @Test
     public void testNewServerSocket1() throws IOException {
         try (ServerSocket ss = new ServerSocket()) {
             SocketImpl si = getSocketImpl(ss);
@@ -241,6 +260,7 @@ public class SocketImplCombinations {
      * Test creating a bound ServerSocket, it should be created with a platform
      * SocketImpl.
      */
+    @Test
     public void testNewServerSocket2() throws IOException {
         try (ServerSocket ss = new ServerSocket(0)) {
             SocketImpl si = getSocketImpl(ss);
@@ -251,22 +271,24 @@ public class SocketImplCombinations {
     /**
      * Test creating a ServerSocket with a custom SocketImpl.
      */
+    @Test
     public void testNewServerSocket3() throws IOException {
         ServerSocket ss = new ServerSocket(new CustomSocketImpl(true)) { };
         try (ss) {
             SocketImpl si = getSocketImpl(ss);
-            assertTrue(si instanceof CustomSocketImpl);
+            assertInstanceOf(CustomSocketImpl.class, si);
         }
     }
 
     /**
      * Test creating an unbound ServerSocket when there is a SocketImplFactory set.
      */
+    @Test
     public void testNewServerSocket4() throws IOException {
         setServerSocketImplFactory(() -> new CustomSocketImpl(true));
         try (ServerSocket ss = new ServerSocket()) {
             SocketImpl si = getSocketImpl(ss);
-            assertTrue(si instanceof CustomSocketImpl);
+            assertInstanceOf(CustomSocketImpl.class, si);
         } finally {
             setServerSocketImplFactory(null);
         }
@@ -275,11 +297,12 @@ public class SocketImplCombinations {
     /**
      * Test creating a bound ServerSocket when there is a SocketImplFactory set.
      */
+    @Test
     public void testNewServerSocket5() throws IOException {
         setServerSocketImplFactory(() -> new CustomSocketImpl(true));
         try (ServerSocket ss = new ServerSocket(0)) {
             SocketImpl si = getSocketImpl(ss);
-            assertTrue(si instanceof CustomSocketImpl);
+            assertInstanceOf(CustomSocketImpl.class, si);
         } finally {
             setServerSocketImplFactory(null);
         }
@@ -289,13 +312,14 @@ public class SocketImplCombinations {
      * Test ServerSocket.accept. The ServerSocket uses a platform SocketImpl,
      * the Socket to accept is created with no SocketImpl.
      */
+    @Test
     public void testServerSocketAccept1() throws IOException {
         var socket = new Socket((SocketImpl) null) { };
-        assertTrue(getSocketImpl(socket) == null);
+        assertNull(getSocketImpl(socket));
 
         serverSocketAccept(socket, (ss, s) -> {
             assertTrue(isPlatformSocketImpl(getSocketImpl(ss)));
-            assertTrue(s == socket);
+            assertSame(socket, s);
             SocketImpl si = getSocketImpl(s);
             assertTrue(isPlatformSocketImpl(si));
             checkFields(si);
@@ -307,13 +331,14 @@ public class SocketImplCombinations {
      * the Socket to accept is created with no SocketImpl, and there is a custom
      * client SocketImplFactory set.
      */
+    @Test
     public void testServerSocketAccept2() throws IOException {
         var socket = new Socket((SocketImpl) null) { };
-        assertTrue(getSocketImpl(socket) == null);
+        assertNull(getSocketImpl(socket));
 
         serverSocketAccept(socket, () -> new CustomSocketImpl(false), (ss, s) -> {
             assertTrue(isPlatformSocketImpl(getSocketImpl(ss)));
-            assertTrue(s == socket);
+            assertSame(socket, s);
             SocketImpl si = getSocketImpl(s);
             assertTrue(isPlatformSocketImpl(si));
             checkFields(si);
@@ -325,6 +350,7 @@ public class SocketImplCombinations {
      * the Socket to accept is created with a SocketImpl that delegates to a
      * platform SocketImpl.
      */
+    @Test
     public void testServerSocketAccept3() throws IOException {
         var socket = new Socket();
         SocketImpl si = getSocketImpl(socket);
@@ -334,7 +360,7 @@ public class SocketImplCombinations {
 
         serverSocketAccept(socket, (ss, s) -> {
             assertTrue(isPlatformSocketImpl(getSocketImpl(ss)));
-            assertTrue(s == socket);
+            assertSame(socket, s);
             SocketImpl psi = getSocketImpl(socket);
             assertTrue(isPlatformSocketImpl(psi));
             checkFields(psi);
@@ -345,26 +371,28 @@ public class SocketImplCombinations {
      * Test ServerSocket.accept. The ServerSocket uses a platform SocketImpl,
      * the Socket to accept is created with a custom SocketImpl.
      */
+    @Test
     public void testServerSocketAccept4a() throws IOException {
         SocketImpl clientImpl = new CustomSocketImpl(false);
         Socket socket = new Socket(clientImpl) { };
-        assertTrue(getSocketImpl(socket) == clientImpl);
+        assertSame(clientImpl, getSocketImpl(socket));
 
         try (ServerSocket ss = serverSocketToAccept(socket)) {
-            expectThrows(IOException.class, ss::accept);
+            assertThrows(IOException.class, ss::accept);
         } finally {
             socket.close();
         }
     }
 
+    @Test
     public void testServerSocketAccept4b() throws IOException {
         SocketImpl clientImpl = new CustomSocketImpl(false);
         Socket socket = new Socket(clientImpl) { };
-        assertTrue(getSocketImpl(socket) == clientImpl);
+        assertSame(clientImpl, getSocketImpl(socket));
 
         setSocketSocketImplFactory(() -> new CustomSocketImpl(false));
         try (ServerSocket ss = serverSocketToAccept(socket)) {
-            expectThrows(IOException.class, ss::accept);
+            assertThrows(IOException.class, ss::accept);
         } finally {
             setSocketSocketImplFactory(null);
             socket.close();
@@ -375,42 +403,46 @@ public class SocketImplCombinations {
      * Test ServerSocket.accept. The ServerSocket uses a custom SocketImpl,
      * the Socket to accept is created no SocketImpl.
      */
+    @Test
     public void testServerSocketAccept5a() throws IOException {
         SocketImpl serverImpl = new CustomSocketImpl(true);
         try (ServerSocket ss = new ServerSocket(serverImpl) { }) {
             ss.bind(loopbackSocketAddress());
-            expectThrows(IOException.class, ss::accept);
+            assertThrows(IOException.class, ss::accept);
         }
     }
 
+    @Test
     public void testServerSocketAccept5b() throws IOException {
         var socket = new Socket((SocketImpl) null) { };
-        assertTrue(getSocketImpl(socket) == null);
+        assertNull(getSocketImpl(socket));
 
         SocketImpl serverImpl = new CustomSocketImpl(true);
         try (ServerSocket ss = serverSocketToAccept(serverImpl, socket)) {
-            expectThrows(IOException.class, ss::accept);
+            assertThrows(IOException.class, ss::accept);
         } finally {
             socket.close();
         }
     }
 
+    @Test
     public void testServerSocketAccept5c() throws IOException {
         setServerSocketImplFactory(() -> new CustomSocketImpl(true));
         try (ServerSocket ss = new ServerSocket(0)) {
-            expectThrows(IOException.class, ss::accept);
+            assertThrows(IOException.class, ss::accept);
         } finally {
             setServerSocketImplFactory(null);
         }
     }
 
+    @Test
     public void testServerSocketAccept5d() throws IOException {
         var socket = new Socket((SocketImpl) null) { };
-        assertTrue(getSocketImpl(socket) == null);
+        assertNull(getSocketImpl(socket));
 
         setServerSocketImplFactory(() -> new CustomSocketImpl(true));
         try (ServerSocket ss = serverSocketToAccept(socket)) {
-            expectThrows(IOException.class, ss::accept);
+            assertThrows(IOException.class, ss::accept);
         } finally {
             setServerSocketImplFactory(null);
             socket.close();
@@ -422,16 +454,17 @@ public class SocketImplCombinations {
      * the Socket to accept is created with no SocketImpl, and there is a custom
      * client SocketImplFactory set.
      */
+    @Test
     public void testServerSocketAccept6() throws Exception {
         var socket = new Socket((SocketImpl) null) { };
-        assertTrue(getSocketImpl(socket) == null);
+        assertNull(getSocketImpl(socket));
 
         SocketImpl serverImpl = new CustomSocketImpl(true);
         SocketImplFactory clientFactory = () -> new CustomSocketImpl(false);
         serverSocketAccept(serverImpl, socket, clientFactory, (ss, s) -> {
-            assertTrue(getSocketImpl(ss) == serverImpl);
+            assertSame(serverImpl, getSocketImpl(ss));
             SocketImpl si = getSocketImpl(s);
-            assertTrue(si instanceof CustomSocketImpl);
+            assertInstanceOf(CustomSocketImpl.class, si);
             checkFields(si);
         });
     }
@@ -441,6 +474,7 @@ public class SocketImplCombinations {
      * the Socket to accept is created with a SocketImpl that delegates to a
      * platform SocketImpl.
      */
+    @Test
     public void testServerSocketAccept7a() throws IOException {
         var socket = new Socket();
         SocketImpl si = getSocketImpl(socket);
@@ -450,12 +484,13 @@ public class SocketImplCombinations {
 
         SocketImpl serverImpl = new CustomSocketImpl(true);
         try (ServerSocket ss = serverSocketToAccept(serverImpl, socket)) {
-            expectThrows(IOException.class, ss::accept);
+            assertThrows(IOException.class, ss::accept);
         } finally {
             socket.close();
         }
     }
 
+    @Test
     public void testServerSocketAccept7b() throws IOException {
         var socket = new Socket();
         SocketImpl si = getSocketImpl(socket);
@@ -465,7 +500,7 @@ public class SocketImplCombinations {
 
         setServerSocketImplFactory(() -> new CustomSocketImpl(true));
         try (ServerSocket ss = serverSocketToAccept(socket)) {
-            expectThrows(IOException.class, ss::accept);
+            assertThrows(IOException.class, ss::accept);
         } finally {
             setServerSocketImplFactory(null);
             socket.close();
@@ -476,16 +511,17 @@ public class SocketImplCombinations {
      * Test ServerSocket.accept. The ServerSocket uses a custom SocketImpl,
      * the Socket to accept is created with a custom SocketImpl.
      */
+    @Test
     public void testServerSocketAccept8() throws Exception {
         SocketImpl clientImpl = new CustomSocketImpl(false);
         Socket socket = new Socket(clientImpl) { };
-        assertTrue(getSocketImpl(socket) == clientImpl);
+        assertSame(clientImpl, getSocketImpl(socket));
 
         SocketImpl serverImpl = new CustomSocketImpl(true);
         SocketImplFactory clientFactory = () -> new CustomSocketImpl(false);
         serverSocketAccept(serverImpl, socket, clientFactory, (ss, s) -> {
-            assertTrue(getSocketImpl(ss) == serverImpl);
-            assertTrue(getSocketImpl(s) == clientImpl);
+            assertSame(serverImpl, getSocketImpl(ss));
+            assertSame(clientImpl, getSocketImpl(s));
             checkFields(clientImpl);
         });
     }
@@ -751,11 +787,14 @@ public class SocketImplCombinations {
         InetAddress address = get(si, "address");
         int port = get(si, "port");
         int localport = get(si, "localport");
-        assertTrue(fd.valid() && address != null && port != 0 && localport != 0);
+        assertTrue(fd.valid());
+        assertNotNull(address);
+        assertNotEquals(0, port);
+        assertNotEquals(0, localport);
     }
 
     /**
-     * Custom SocketImpl that is layed on a SocketChannel or ServerSocketChannel
+     * Custom SocketImpl that is layered on a SocketChannel or ServerSocketChannel
      */
     static class CustomSocketImpl extends SocketImpl {
         private final boolean server;
diff --git a/test/jdk/java/net/SocketImpl/TestDefaultBehavior.java b/test/jdk/java/net/SocketImpl/TestDefaultBehavior.java
index 6ee01a56a1e..c08d652270d 100644
--- a/test/jdk/java/net/SocketImpl/TestDefaultBehavior.java
+++ b/test/jdk/java/net/SocketImpl/TestDefaultBehavior.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2019, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2019, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,7 +25,7 @@
  * @test
  * @bug 8224477
  * @summary Basic test for java.net.SocketImpl default behavior
- * @run testng TestDefaultBehavior
+ * @run junit ${test.main.class}
  */
 
 import java.io.IOException;
@@ -36,11 +36,13 @@ import java.net.SocketAddress;
 import java.net.SocketImpl;
 import java.net.SocketOption;
 import java.util.Set;
-import org.testng.annotations.Test;
 import static java.lang.Boolean.*;
 import static java.net.StandardSocketOptions.*;
-import static org.testng.Assert.assertEquals;
-import static org.testng.Assert.expectThrows;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertThrows;
+
+import org.junit.jupiter.api.Test;
 
 public class TestDefaultBehavior {
 
@@ -51,21 +53,21 @@ public class TestDefaultBehavior {
     public void socketImpl() {
         CustomSocketImpl csi = new CustomSocketImpl();
 
-        assertEquals(csi.supportedOptions().size(), 0);
+        assertEquals(0, csi.supportedOptions().size());
 
-        expectThrows(NPE, () -> csi.setOption(null, null));
-        expectThrows(NPE, () -> csi.setOption(null, 1));
-        expectThrows(UOE, () -> csi.setOption(SO_RCVBUF, 100));
-        expectThrows(UOE, () -> csi.setOption(SO_KEEPALIVE, TRUE));
-        expectThrows(UOE, () -> csi.setOption(SO_KEEPALIVE, FALSE));
-        expectThrows(UOE, () -> csi.setOption(FAKE_SOCK_OPT, TRUE));
-        expectThrows(UOE, () -> csi.setOption(FAKE_SOCK_OPT, FALSE));
-        expectThrows(UOE, () -> csi.setOption(SO_KEEPALIVE, TRUE));
+        assertThrows(NPE, () -> csi.setOption(null, null));
+        assertThrows(NPE, () -> csi.setOption(null, 1));
+        assertThrows(UOE, () -> csi.setOption(SO_RCVBUF, 100));
+        assertThrows(UOE, () -> csi.setOption(SO_KEEPALIVE, TRUE));
+        assertThrows(UOE, () -> csi.setOption(SO_KEEPALIVE, FALSE));
+        assertThrows(UOE, () -> csi.setOption(FAKE_SOCK_OPT, TRUE));
+        assertThrows(UOE, () -> csi.setOption(FAKE_SOCK_OPT, FALSE));
+        assertThrows(UOE, () -> csi.setOption(SO_KEEPALIVE, TRUE));
 
-        expectThrows(NPE, () -> csi.getOption(null));
-        expectThrows(UOE, () -> csi.getOption(SO_RCVBUF));
-        expectThrows(UOE, () -> csi.getOption(SO_KEEPALIVE));
-        expectThrows(UOE, () -> csi.getOption(FAKE_SOCK_OPT));
+        assertThrows(NPE, () -> csi.getOption(null));
+        assertThrows(UOE, () -> csi.getOption(SO_RCVBUF));
+        assertThrows(UOE, () -> csi.getOption(SO_KEEPALIVE));
+        assertThrows(UOE, () -> csi.getOption(FAKE_SOCK_OPT));
     }
 
     static final SocketOption<Boolean> FAKE_SOCK_OPT = new SocketOption<>() {

From 34686923aaf9695aefe4ec23a0dae6b11ef2ad46 Mon Sep 17 00:00:00 2001
From: Andrew Dinn <adinn@openjdk.org>
Date: Wed, 8 Apr 2026 15:44:39 +0000
Subject: [PATCH 524/655] 8372617: Save and restore stubgen stubs when using an
 AOT code cache

Reviewed-by: kvn, asmehra
---
 .../cpu/aarch64/macroAssembler_aarch64.cpp    |    7 +-
 src/hotspot/cpu/aarch64/runtime_aarch64.cpp   |    2 +-
 .../cpu/aarch64/stubDeclarations_aarch64.hpp  |   50 +-
 .../cpu/aarch64/stubGenerator_aarch64.cpp     | 1720 +++++++++++++----
 .../cpu/aarch64/stubRoutines_aarch64.cpp      |   36 +
 .../cpu/aarch64/stubRoutines_aarch64.hpp      |    5 +
 src/hotspot/cpu/arm/stubGenerator_arm.cpp     |    6 +-
 src/hotspot/cpu/arm/stubRoutines_arm.cpp      |    6 +
 src/hotspot/cpu/ppc/stubGenerator_ppc.cpp     |    6 +-
 src/hotspot/cpu/ppc/stubRoutines_ppc_64.cpp   |    6 +
 src/hotspot/cpu/riscv/stubGenerator_riscv.cpp |    6 +-
 src/hotspot/cpu/riscv/stubRoutines_riscv.cpp  |    6 +
 src/hotspot/cpu/s390/stubGenerator_s390.cpp   |    6 +-
 src/hotspot/cpu/s390/stubRoutines_s390.cpp    |    6 +
 src/hotspot/cpu/x86/c1_LIRAssembler_x86.cpp   |   20 +
 src/hotspot/cpu/x86/c1_LIRAssembler_x86.hpp   |    3 +
 .../cpu/x86/gc/z/zBarrierSetAssembler_x86.cpp |   74 +-
 .../cpu/x86/gc/z/zBarrierSetAssembler_x86.hpp |    6 +-
 src/hotspot/cpu/x86/macroAssembler_x86.cpp    |   29 +-
 .../cpu/x86/macroAssembler_x86_sha.cpp        |   34 +-
 src/hotspot/cpu/x86/stubDeclarations_x86.hpp  |    9 +
 src/hotspot/cpu/x86/stubGenerator_x86_64.cpp  |  957 +++++++--
 src/hotspot/cpu/x86/stubGenerator_x86_64.hpp  |   31 +-
 .../cpu/x86/stubGenerator_x86_64_adler.cpp    |   20 +-
 .../cpu/x86/stubGenerator_x86_64_aes.cpp      |  178 +-
 .../x86/stubGenerator_x86_64_arraycopy.cpp    |  633 +++++-
 .../cpu/x86/stubGenerator_x86_64_cbrt.cpp     |   35 +-
 .../cpu/x86/stubGenerator_x86_64_chacha.cpp   |   38 +-
 .../x86/stubGenerator_x86_64_constants.cpp    |   26 +
 .../cpu/x86/stubGenerator_x86_64_cos.cpp      |   11 +-
 .../x86/stubGenerator_x86_64_dilithium.cpp    |   83 +-
 .../cpu/x86/stubGenerator_x86_64_exp.cpp      |   32 +-
 .../cpu/x86/stubGenerator_x86_64_fmod.cpp     |   25 +-
 .../cpu/x86/stubGenerator_x86_64_ghash.cpp    |   40 +-
 .../cpu/x86/stubGenerator_x86_64_kyber.cpp    |  118 +-
 .../cpu/x86/stubGenerator_x86_64_log.cpp      |   44 +-
 .../cpu/x86/stubGenerator_x86_64_poly1305.cpp |   25 +-
 .../x86/stubGenerator_x86_64_poly_mont.cpp    |   43 +-
 .../cpu/x86/stubGenerator_x86_64_pow.cpp      |   41 +-
 .../cpu/x86/stubGenerator_x86_64_sha3.cpp     |   36 +-
 .../cpu/x86/stubGenerator_x86_64_sin.cpp      |   19 +-
 .../cpu/x86/stubGenerator_x86_64_sinh.cpp     |   33 +-
 .../cpu/x86/stubGenerator_x86_64_tan.cpp      |   34 +-
 .../cpu/x86/stubGenerator_x86_64_tanh.cpp     |   33 +-
 src/hotspot/cpu/x86/stubRoutines_x86.cpp      |   47 +
 src/hotspot/cpu/x86/stubRoutines_x86.hpp      |    2 +
 src/hotspot/cpu/zero/stubGenerator_zero.cpp   |    6 +-
 src/hotspot/cpu/zero/stubRoutines_zero.cpp    |    6 +
 src/hotspot/share/asm/codeBuffer.cpp          |    2 +-
 src/hotspot/share/c1/c1_Runtime1.cpp          |    6 +-
 src/hotspot/share/code/aotCodeCache.cpp       | 1329 ++++++++++---
 src/hotspot/share/code/aotCodeCache.hpp       |  227 ++-
 .../share/gc/z/zBarrierSetAssembler.hpp       |    3 +
 src/hotspot/share/opto/runtime.cpp            |    4 +-
 src/hotspot/share/prims/downcallLinker.hpp    |    2 +-
 src/hotspot/share/runtime/init.cpp            |   15 +-
 src/hotspot/share/runtime/sharedRuntime.cpp   |    5 +
 .../share/runtime/stubCodeGenerator.cpp       |  136 +-
 .../share/runtime/stubCodeGenerator.hpp       |   72 +-
 .../share/runtime/stubDeclarations.hpp        |    6 +
 src/hotspot/share/runtime/stubInfo.cpp        |    9 +
 src/hotspot/share/runtime/stubInfo.hpp        |    5 +
 src/hotspot/share/runtime/stubRoutines.cpp    |   91 +-
 src/hotspot/share/runtime/stubRoutines.hpp    |    8 +
 .../cds/appcds/aotCode/AOTCodeFlags.java      |   98 +-
 65 files changed, 5582 insertions(+), 1075 deletions(-)

diff --git a/src/hotspot/cpu/aarch64/macroAssembler_aarch64.cpp b/src/hotspot/cpu/aarch64/macroAssembler_aarch64.cpp
index b5e15402941..7fa2e8086ad 100644
--- a/src/hotspot/cpu/aarch64/macroAssembler_aarch64.cpp
+++ b/src/hotspot/cpu/aarch64/macroAssembler_aarch64.cpp
@@ -3454,7 +3454,7 @@ void MacroAssembler::subw(Register Rd, Register Rn, RegisterOrConstant decrement
 void MacroAssembler::reinit_heapbase()
 {
   if (UseCompressedOops) {
-    if (Universe::is_fully_initialized()) {
+    if (Universe::is_fully_initialized() && !AOTCodeCache::is_on_for_dump()) {
       mov(rheapbase, CompressedOops::base());
     } else {
       lea(rheapbase, ExternalAddress(CompressedOops::base_addr()));
@@ -5128,7 +5128,8 @@ void MacroAssembler::cmp_klass(Register obj, Register klass, Register tmp) {
   if (CompressedKlassPointers::base() == nullptr) {
     cmp(klass, tmp, LSL, CompressedKlassPointers::shift());
     return;
-  } else if (((uint64_t)CompressedKlassPointers::base() & 0xffffffff) == 0
+  } else if (!AOTCodeCache::is_on_for_dump() &&
+             ((uint64_t)CompressedKlassPointers::base() & 0xffffffff) == 0
              && CompressedKlassPointers::shift() == 0) {
     // Only the bottom 32 bits matter
     cmpw(klass, tmp);
@@ -5371,7 +5372,7 @@ void MacroAssembler::encode_klass_not_null_for_aot(Register dst, Register src) {
 }
 
 void MacroAssembler::encode_klass_not_null(Register dst, Register src) {
-  if (AOTCodeCache::is_on_for_dump()) {
+  if (CompressedKlassPointers::base() != nullptr && AOTCodeCache::is_on_for_dump()) {
     encode_klass_not_null_for_aot(dst, src);
     return;
   }
diff --git a/src/hotspot/cpu/aarch64/runtime_aarch64.cpp b/src/hotspot/cpu/aarch64/runtime_aarch64.cpp
index e36aa21b567..638e57b03fe 100644
--- a/src/hotspot/cpu/aarch64/runtime_aarch64.cpp
+++ b/src/hotspot/cpu/aarch64/runtime_aarch64.cpp
@@ -290,7 +290,7 @@ ExceptionBlob* OptoRuntime::generate_exception_blob() {
   assert(SimpleRuntimeFrame::framesize % 4 == 0, "sp not 16-byte aligned");
 
   const char* name = OptoRuntime::stub_name(StubId::c2_exception_id);
-  CodeBlob* blob = AOTCodeCache::load_code_blob(AOTCodeEntry::C2Blob, (uint)BlobId::c2_exception_id, name);
+  CodeBlob* blob = AOTCodeCache::load_code_blob(AOTCodeEntry::C2Blob, BlobId::c2_exception_id);
   if (blob != nullptr) {
     return blob->as_exception_blob();
   }
diff --git a/src/hotspot/cpu/aarch64/stubDeclarations_aarch64.hpp b/src/hotspot/cpu/aarch64/stubDeclarations_aarch64.hpp
index 695534604b8..9dac6a39b82 100644
--- a/src/hotspot/cpu/aarch64/stubDeclarations_aarch64.hpp
+++ b/src/hotspot/cpu/aarch64/stubDeclarations_aarch64.hpp
@@ -84,8 +84,7 @@
   do_stub(compiler, count_positives)                                    \
   do_arch_entry(aarch64, compiler, count_positives, count_positives,    \
                 count_positives)                                        \
-  do_stub(compiler, count_positives_long)                               \
-  do_arch_entry(aarch64, compiler, count_positives_long,                \
+  do_arch_entry(aarch64, compiler, count_positives,                     \
                 count_positives_long, count_positives_long)             \
   do_stub(compiler, compare_long_string_LL)                             \
   do_arch_entry(aarch64, compiler, compare_long_string_LL,              \
@@ -108,8 +107,9 @@
   do_stub(compiler, string_indexof_linear_ul)                           \
   do_arch_entry(aarch64, compiler, string_indexof_linear_ul,            \
                 string_indexof_linear_ul, string_indexof_linear_ul)     \
-  /* this uses the entry for ghash_processBlocks */                     \
-  do_stub(compiler, ghash_processBlocks_wide)                           \
+  do_stub(compiler, ghash_processBlocks_small)                          \
+  do_arch_entry(aarch64, compiler, ghash_processBlocks_small,           \
+           ghash_processBlocks_small, ghash_processBlocks_small)        \
 
 
 #define STUBGEN_FINAL_BLOBS_ARCH_DO(do_stub,                            \
@@ -139,9 +139,49 @@
   do_stub(final, spin_wait)                                             \
   do_arch_entry_init(aarch64, final, spin_wait, spin_wait,              \
                      spin_wait, empty_spin_wait)                        \
-  /* stub only -- entries are not stored in StubRoutines::aarch64 */    \
   /* n.b. these are not the same as the generic atomic stubs */         \
   do_stub(final, atomic_entry_points)                                   \
+  do_arch_entry(aarch64, final, atomic_entry_points,                    \
+                atomic_fetch_add_4_impl, atomic_fetch_add_4_impl)       \
+  do_arch_entry(aarch64, final, atomic_entry_points,                    \
+                atomic_fetch_add_8_impl, atomic_fetch_add_8_impl)       \
+  do_arch_entry(aarch64, final, atomic_entry_points,                    \
+                atomic_fetch_add_4_relaxed_impl,                        \
+                atomic_fetch_add_4_relaxed_impl)                        \
+  do_arch_entry(aarch64, final, atomic_entry_points,                    \
+                atomic_fetch_add_8_relaxed_impl,                        \
+                atomic_fetch_add_8_relaxed_impl)                        \
+  do_arch_entry(aarch64, final, atomic_entry_points,                    \
+                atomic_xchg_4_impl, atomic_xchg_4_impl)                 \
+  do_arch_entry(aarch64, final, atomic_entry_points,                    \
+                atomic_xchg_8_impl, atomic_xchg_8_impl)                 \
+  do_arch_entry(aarch64, final, atomic_entry_points,                    \
+                atomic_cmpxchg_1_impl, atomic_cmpxchg_1_impl)           \
+  do_arch_entry(aarch64, final, atomic_entry_points,                    \
+                atomic_cmpxchg_4_impl, atomic_cmpxchg_4_impl)           \
+  do_arch_entry(aarch64, final, atomic_entry_points,                    \
+                atomic_cmpxchg_8_impl, atomic_cmpxchg_8_impl)           \
+  do_arch_entry(aarch64, final, atomic_entry_points,                    \
+                atomic_cmpxchg_1_relaxed_impl,                          \
+                atomic_cmpxchg_1_relaxed_impl)                          \
+  do_arch_entry(aarch64, final, atomic_entry_points,                    \
+                atomic_cmpxchg_4_relaxed_impl,                          \
+                atomic_cmpxchg_4_relaxed_impl)                          \
+  do_arch_entry(aarch64, final, atomic_entry_points,                    \
+                atomic_cmpxchg_8_relaxed_impl,                          \
+                atomic_cmpxchg_8_relaxed_impl)                          \
+  do_arch_entry(aarch64, final, atomic_entry_points,                    \
+                atomic_cmpxchg_4_release_impl,                          \
+                atomic_cmpxchg_4_release_impl)                          \
+  do_arch_entry(aarch64, final, atomic_entry_points,                    \
+                atomic_cmpxchg_8_release_impl,                          \
+                atomic_cmpxchg_8_release_impl)                          \
+  do_arch_entry(aarch64, final, atomic_entry_points,                    \
+                atomic_cmpxchg_4_seq_cst_impl,                          \
+                atomic_cmpxchg_4_seq_cst_impl)                          \
+  do_arch_entry(aarch64, final, atomic_entry_points,                    \
+                atomic_cmpxchg_8_seq_cst_impl,                          \
+                atomic_cmpxchg_8_seq_cst_impl)                          \
 
 
 #endif // CPU_AARCH64_STUBDECLARATIONS_HPP
diff --git a/src/hotspot/cpu/aarch64/stubGenerator_aarch64.cpp b/src/hotspot/cpu/aarch64/stubGenerator_aarch64.cpp
index 21a1124a8ec..32fd8afb268 100644
--- a/src/hotspot/cpu/aarch64/stubGenerator_aarch64.cpp
+++ b/src/hotspot/cpu/aarch64/stubGenerator_aarch64.cpp
@@ -79,6 +79,166 @@
 
 #define BIND(label) bind(label); BLOCK_COMMENT(#label ":")
 
+// Constant data definitions
+
+static const uint32_t _sha256_round_consts[64] = {
+  0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5,
+  0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5,
+  0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3,
+  0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174,
+  0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc,
+  0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da,
+  0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7,
+  0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967,
+  0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13,
+  0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85,
+  0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3,
+  0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070,
+  0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5,
+  0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3,
+  0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208,
+  0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2,
+};
+
+static const uint64_t _sha512_round_consts[80] = {
+  0x428A2F98D728AE22L, 0x7137449123EF65CDL, 0xB5C0FBCFEC4D3B2FL,
+  0xE9B5DBA58189DBBCL, 0x3956C25BF348B538L, 0x59F111F1B605D019L,
+  0x923F82A4AF194F9BL, 0xAB1C5ED5DA6D8118L, 0xD807AA98A3030242L,
+  0x12835B0145706FBEL, 0x243185BE4EE4B28CL, 0x550C7DC3D5FFB4E2L,
+  0x72BE5D74F27B896FL, 0x80DEB1FE3B1696B1L, 0x9BDC06A725C71235L,
+  0xC19BF174CF692694L, 0xE49B69C19EF14AD2L, 0xEFBE4786384F25E3L,
+  0x0FC19DC68B8CD5B5L, 0x240CA1CC77AC9C65L, 0x2DE92C6F592B0275L,
+  0x4A7484AA6EA6E483L, 0x5CB0A9DCBD41FBD4L, 0x76F988DA831153B5L,
+  0x983E5152EE66DFABL, 0xA831C66D2DB43210L, 0xB00327C898FB213FL,
+  0xBF597FC7BEEF0EE4L, 0xC6E00BF33DA88FC2L, 0xD5A79147930AA725L,
+  0x06CA6351E003826FL, 0x142929670A0E6E70L, 0x27B70A8546D22FFCL,
+  0x2E1B21385C26C926L, 0x4D2C6DFC5AC42AEDL, 0x53380D139D95B3DFL,
+  0x650A73548BAF63DEL, 0x766A0ABB3C77B2A8L, 0x81C2C92E47EDAEE6L,
+  0x92722C851482353BL, 0xA2BFE8A14CF10364L, 0xA81A664BBC423001L,
+  0xC24B8B70D0F89791L, 0xC76C51A30654BE30L, 0xD192E819D6EF5218L,
+  0xD69906245565A910L, 0xF40E35855771202AL, 0x106AA07032BBD1B8L,
+  0x19A4C116B8D2D0C8L, 0x1E376C085141AB53L, 0x2748774CDF8EEB99L,
+  0x34B0BCB5E19B48A8L, 0x391C0CB3C5C95A63L, 0x4ED8AA4AE3418ACBL,
+  0x5B9CCA4F7763E373L, 0x682E6FF3D6B2B8A3L, 0x748F82EE5DEFB2FCL,
+  0x78A5636F43172F60L, 0x84C87814A1F0AB72L, 0x8CC702081A6439ECL,
+  0x90BEFFFA23631E28L, 0xA4506CEBDE82BDE9L, 0xBEF9A3F7B2C67915L,
+  0xC67178F2E372532BL, 0xCA273ECEEA26619CL, 0xD186B8C721C0C207L,
+  0xEADA7DD6CDE0EB1EL, 0xF57D4F7FEE6ED178L, 0x06F067AA72176FBAL,
+  0x0A637DC5A2C898A6L, 0x113F9804BEF90DAEL, 0x1B710B35131C471BL,
+  0x28DB77F523047D84L, 0x32CAAB7B40C72493L, 0x3C9EBE0A15C9BEBCL,
+  0x431D67C49C100D4CL, 0x4CC5D4BECB3E42B6L, 0x597F299CFC657E2AL,
+  0x5FCB6FAB3AD6FAECL, 0x6C44198C4A475817L
+};
+
+static const uint64_t _sha3_round_consts[24] = {
+  0x0000000000000001L, 0x0000000000008082L, 0x800000000000808AL,
+  0x8000000080008000L, 0x000000000000808BL, 0x0000000080000001L,
+  0x8000000080008081L, 0x8000000000008009L, 0x000000000000008AL,
+  0x0000000000000088L, 0x0000000080008009L, 0x000000008000000AL,
+  0x000000008000808BL, 0x800000000000008BL, 0x8000000000008089L,
+  0x8000000000008003L, 0x8000000000008002L, 0x8000000000000080L,
+  0x000000000000800AL, 0x800000008000000AL, 0x8000000080008081L,
+  0x8000000000008080L, 0x0000000080000001L, 0x8000000080008008L
+};
+
+static const uint64_t _double_keccak_round_consts[24] = {
+  0x0000000000000001L, 0x0000000000008082L, 0x800000000000808AL,
+  0x8000000080008000L, 0x000000000000808BL, 0x0000000080000001L,
+  0x8000000080008081L, 0x8000000000008009L, 0x000000000000008AL,
+  0x0000000000000088L, 0x0000000080008009L, 0x000000008000000AL,
+  0x000000008000808BL, 0x800000000000008BL, 0x8000000000008089L,
+  0x8000000000008003L, 0x8000000000008002L, 0x8000000000000080L,
+  0x000000000000800AL, 0x800000008000000AL, 0x8000000080008081L,
+  0x8000000000008080L, 0x0000000080000001L, 0x8000000080008008L
+};
+
+static const char _encodeBlock_toBase64[64] = {
+  'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M',
+  'N', 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z',
+  'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm',
+  'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z',
+  '0', '1', '2', '3', '4', '5', '6', '7', '8', '9', '+', '/'
+};
+
+static const char _encodeBlock_toBase64URL[64] = {
+  'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M',
+  'N', 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z',
+  'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm',
+  'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z',
+  '0', '1', '2', '3', '4', '5', '6', '7', '8', '9', '-', '_'
+};
+
+// Non-SIMD lookup tables are mostly dumped from fromBase64 array used in java.util.Base64,
+// except the trailing character '=' is also treated illegal value in this intrinsic. That
+// is java.util.Base64.fromBase64['='] = -2, while fromBase(URL)64ForNoSIMD['='] = 255 here.
+static const uint8_t _decodeBlock_fromBase64ForNoSIMD[256] = {
+  255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u,
+  255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u,
+  255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u,  62u, 255u, 255u, 255u,  63u,
+  52u,  53u,  54u,  55u,  56u,  57u,  58u,  59u,  60u,  61u, 255u, 255u, 255u, 255u, 255u, 255u,
+  255u,   0u,   1u,   2u,   3u,   4u,   5u,   6u,   7u,   8u,   9u,  10u,  11u,  12u,  13u,  14u,
+  15u,  16u,  17u,  18u,  19u,  20u,  21u,  22u,  23u,  24u,  25u, 255u, 255u, 255u, 255u, 255u,
+  255u,  26u,  27u,  28u,  29u,  30u,  31u,  32u,  33u,  34u,  35u,  36u,  37u,  38u,  39u,  40u,
+  41u,  42u,  43u,  44u,  45u,  46u,  47u,  48u,  49u,  50u,  51u, 255u, 255u, 255u, 255u, 255u,
+  255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u,
+  255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u,
+  255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u,
+  255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u,
+  255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u,
+  255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u,
+  255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u,
+  255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u,
+};
+
+static const uint8_t _decodeBlock_fromBase64URLForNoSIMD[256] = {
+  255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u,
+  255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u,
+  255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u,  62u, 255u, 255u,
+  52u,  53u,  54u,  55u,  56u,  57u,  58u,  59u,  60u,  61u, 255u, 255u, 255u, 255u, 255u, 255u,
+  255u,   0u,   1u,   2u,   3u,   4u,   5u,   6u,   7u,   8u,   9u,  10u,  11u,  12u,  13u,  14u,
+  15u,  16u,  17u,  18u,  19u,  20u,  21u,  22u,  23u,  24u,  25u, 255u, 255u, 255u, 255u,  63u,
+  255u,  26u,  27u,  28u,  29u,  30u,  31u,  32u,  33u,  34u,  35u,  36u,  37u,  38u,  39u,  40u,
+  41u,  42u,  43u,  44u,  45u,  46u,  47u,  48u,  49u,  50u,  51u, 255u, 255u, 255u, 255u, 255u,
+  255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u,
+  255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u,
+  255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u,
+  255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u,
+  255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u,
+  255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u,
+  255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u,
+  255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u,
+};
+
+// A legal value of base64 code is in range [0, 127].  We need two lookups
+// with tbl/tbx and combine them to get the decode data. The 1st table vector
+// lookup use tbl, out of range indices are set to 0 in destination. The 2nd
+// table vector lookup use tbx, out of range indices are unchanged in
+// destination. Input [64..126] is mapped to index [65, 127] in second lookup.
+// The value of index 64 is set to 0, so that we know that we already get the
+// decoded data with the 1st lookup.
+static const uint8_t _decodeBlock_fromBase64ForSIMD[128] = {
+  255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u,
+  255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u,
+  255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u,  62u, 255u, 255u, 255u,  63u,
+  52u,  53u,  54u,  55u,  56u,  57u,  58u,  59u,  60u,  61u, 255u, 255u, 255u, 255u, 255u, 255u,
+  0u, 255u,   0u,   1u,   2u,   3u,   4u,   5u,   6u,   7u,   8u,   9u,  10u,  11u,  12u,  13u,
+  14u,  15u,  16u,  17u,  18u,  19u,  20u,  21u,  22u,  23u,  24u,  25u, 255u, 255u, 255u, 255u,
+  255u, 255u,  26u,  27u,  28u,  29u,  30u,  31u,  32u,  33u,  34u,  35u,  36u,  37u,  38u,  39u,
+  40u,  41u,  42u,  43u,  44u,  45u,  46u,  47u,  48u,  49u,  50u,  51u, 255u, 255u, 255u, 255u,
+};
+
+static const uint8_t _decodeBlock_fromBase64URLForSIMD[128] = {
+  255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u,
+  255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u,
+  255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u,  62u, 255u, 255u,
+  52u,  53u,  54u,  55u,  56u,  57u,  58u,  59u,  60u,  61u, 255u, 255u, 255u, 255u, 255u, 255u,
+  0u, 255u,   0u,   1u,   2u,   3u,   4u,   5u,   6u,   7u,   8u,   9u,  10u,  11u,  12u,  13u,
+  14u,  15u,  16u,  17u,  18u,  19u,  20u,  21u,  22u,  23u,  24u,  25u, 255u, 255u, 255u, 255u,
+  63u, 255u,  26u,  27u,  28u,  29u,  30u,  31u,  32u,  33u,  34u,  35u,  36u,  37u,  38u,  39u,
+  40u,  41u,  42u,  43u,  44u,  45u,  46u,  47u,  48u,  49u,  50u,  51u, 255u, 255u, 255u, 255u,
+};
+
+
 // Stub Code definitions
 
 class StubGenerator: public StubCodeGenerator {
@@ -203,8 +363,17 @@ class StubGenerator: public StubCodeGenerator {
            "adjust this code");
 
     StubId stub_id = StubId::stubgen_call_stub_id;
+    GrowableArray<address> entries;
+    int entry_count = StubInfo::entry_count(stub_id);
+    assert(entry_count == 2, "sanity check");
+    address start = load_archive_data(stub_id, &entries);
+    if (start != nullptr) {
+      assert(entries.length() == 1, "expected 1 extra entry");
+      return_address = entries.at(0);
+      return start;
+    }
     StubCodeMark mark(this, stub_id);
-    address start = __ pc();
+    start = __ pc();
 
     const Address sp_after_call (rfp, sp_after_call_off * wordSize);
 
@@ -323,6 +492,7 @@ class StubGenerator: public StubCodeGenerator {
     // save current address for use by exception handling code
 
     return_address = __ pc();
+    entries.append(return_address);
 
     // store result depending on type (everything that is not
     // T_OBJECT, T_LONG, T_FLOAT or T_DOUBLE is treated as T_INT)
@@ -406,6 +576,9 @@ class StubGenerator: public StubCodeGenerator {
     __ strd(j_farg0, Address(j_rarg2, 0));
     __ br(Assembler::AL, exit);
 
+    // record the stub entry and end plus the auxiliary entry
+    store_archive_data(stub_id, start, __ pc(), &entries);
+
     return start;
   }
 
@@ -423,8 +596,14 @@ class StubGenerator: public StubCodeGenerator {
 
   address generate_catch_exception() {
     StubId stub_id = StubId::stubgen_catch_exception_id;
+    int entry_count = StubInfo::entry_count(stub_id);
+    assert(entry_count == 1, "sanity check");
+    address start = load_archive_data(stub_id);
+    if (start != nullptr) {
+      return start;
+    }
     StubCodeMark mark(this, stub_id);
-    address start = __ pc();
+    start = __ pc();
 
     // same as in generate_call_stub():
     const Address sp_after_call(rfp, sp_after_call_off * wordSize);
@@ -450,7 +629,9 @@ class StubGenerator: public StubCodeGenerator {
     __ verify_oop(r0);
 
     __ str(r0, Address(rthread, Thread::pending_exception_offset()));
-    __ mov(rscratch1, (address)__FILE__);
+    // special case -- add file name string to AOT address table
+    address file = (address)AOTCodeCache::add_C_string(__FILE__);
+    __ lea(rscratch1, ExternalAddress(file));
     __ str(rscratch1, Address(rthread, Thread::exception_file_offset()));
     __ movw(rscratch1, (int)__LINE__);
     __ strw(rscratch1, Address(rthread, Thread::exception_line_offset()));
@@ -458,7 +639,10 @@ class StubGenerator: public StubCodeGenerator {
     // complete return to VM
     assert(StubRoutines::_call_stub_return_address != nullptr,
            "_call_stub_return_address must have been generated before");
-    __ b(StubRoutines::_call_stub_return_address);
+    __ b(RuntimeAddress(StubRoutines::_call_stub_return_address));
+
+    // record the stub entry and end
+    store_archive_data(stub_id, start, __ pc());
 
     return start;
   }
@@ -479,8 +663,14 @@ class StubGenerator: public StubCodeGenerator {
 
   address generate_forward_exception() {
     StubId stub_id = StubId::stubgen_forward_exception_id;
+    int entry_count = StubInfo::entry_count(stub_id);
+    assert(entry_count == 1, "sanity check");
+    address start = load_archive_data(stub_id);
+    if (start != nullptr) {
+      return start;
+    }
     StubCodeMark mark(this, stub_id);
-    address start = __ pc();
+    start = __ pc();
 
     // Upon entry, LR points to the return address returning into
     // Java (interpreted or compiled) code; i.e., the return address
@@ -551,6 +741,9 @@ class StubGenerator: public StubCodeGenerator {
     __ verify_oop(r0);
     __ br(r19);
 
+    // record the stub entry and end
+    store_archive_data(stub_id, start, __ pc());
+
     return start;
   }
 
@@ -569,8 +762,14 @@ class StubGenerator: public StubCodeGenerator {
   //    [tos + 5]: saved rscratch1
   address generate_verify_oop() {
     StubId stub_id = StubId::stubgen_verify_oop_id;
+    int entry_count = StubInfo::entry_count(stub_id);
+    assert(entry_count == 1, "sanity check");
+    address start = load_archive_data(stub_id);
+    if (start != nullptr) {
+      return start;
+    }
     StubCodeMark mark(this, stub_id);
-    address start = __ pc();
+    start = __ pc();
 
     Label exit, error;
 
@@ -613,14 +812,23 @@ class StubGenerator: public StubCodeGenerator {
     __ blr(rscratch1);
     __ hlt(0);
 
+    // record the stub entry and end
+    store_archive_data(stub_id, start, __ pc());
+
     return start;
   }
 
   // Generate indices for iota vector.
   address generate_iota_indices(StubId stub_id) {
+    int entry_count = StubInfo::entry_count(stub_id);
+    assert(entry_count == 1, "sanity check");
+    address start = load_archive_data(stub_id);
+    if (start != nullptr) {
+      return start;
+    }
     __ align(CodeEntryAlignment);
     StubCodeMark mark(this, stub_id);
-    address start = __ pc();
+    start = __ pc();
     // B
     __ emit_data64(0x0706050403020100, relocInfo::none);
     __ emit_data64(0x0F0E0D0C0B0A0908, relocInfo::none);
@@ -639,6 +847,10 @@ class StubGenerator: public StubCodeGenerator {
     // D - FP
     __ emit_data64(0x0000000000000000, relocInfo::none); // 0.0d
     __ emit_data64(0x3FF0000000000000, relocInfo::none); // 1.0d
+
+    // record the stub entry and end
+    store_archive_data(stub_id, start, __ pc());
+
     return start;
   }
 
@@ -656,15 +868,21 @@ class StubGenerator: public StubCodeGenerator {
   //      r11 < MacroAssembler::zero_words_block_size.
 
   address generate_zero_blocks() {
+    StubId stub_id = StubId::stubgen_zero_blocks_id;
+    int entry_count = StubInfo::entry_count(stub_id);
+    assert(entry_count == 1, "sanity check");
+    address start = load_archive_data(stub_id);
+    if (start != nullptr) {
+      return start;
+    }
+    __ align(CodeEntryAlignment);
+    StubCodeMark mark(this, stub_id);
     Label done;
     Label base_aligned;
 
     Register base = r10, cnt = r11;
 
-    __ align(CodeEntryAlignment);
-    StubId stub_id = StubId::stubgen_zero_blocks_id;
-    StubCodeMark mark(this, stub_id);
-    address start = __ pc();
+    start = __ pc();
 
     if (UseBlockZeroing) {
       int zva_length = VM_Version::zva_length();
@@ -707,6 +925,9 @@ class StubGenerator: public StubCodeGenerator {
 
     __ ret(lr);
 
+    // record the stub entry and end
+    store_archive_data(stub_id, start, __ pc());
+
     return start;
   }
 
@@ -803,6 +1024,12 @@ class StubGenerator: public StubCodeGenerator {
   // s and d are adjusted to point to the remaining words to copy
   //
   address generate_copy_longs(StubId stub_id, DecoratorSet decorators, Register s, Register d, Register count) {
+    int entry_count = StubInfo::entry_count(stub_id);
+    assert(entry_count == 1, "sanity check");
+    address start = load_archive_data(stub_id);
+    if (start != nullptr) {
+      return start;
+    }
     BasicType type;
     copy_direction direction;
 
@@ -854,7 +1081,7 @@ class StubGenerator: public StubCodeGenerator {
 
     StubCodeMark mark(this, stub_id);
 
-    address start = __ pc();
+    start = __ pc();
 
     Label unaligned_copy_long;
     if (AvoidUnalignedAccesses) {
@@ -1154,6 +1381,9 @@ class StubGenerator: public StubCodeGenerator {
       __ ret(lr);
     }
 
+    // record the stub entry and end
+    store_archive_data(stub_id, start, __ pc());
+
     return start;
   }
 
@@ -1445,19 +1675,25 @@ class StubGenerator: public StubCodeGenerator {
     }
     if (direction == copy_forwards) {
       if (type != T_OBJECT) {
-        __ bl(StubRoutines::aarch64::copy_byte_f());
+        __ lea(rscratch1, RuntimeAddress(StubRoutines::aarch64::copy_byte_f()));
+        __ blr(rscratch1);
       } else if ((decorators & IS_DEST_UNINITIALIZED) != 0) {
-        __ bl(StubRoutines::aarch64::copy_oop_uninit_f());
+        __ lea(rscratch1, RuntimeAddress(StubRoutines::aarch64::copy_oop_uninit_f()));
+        __ blr(rscratch1);
       } else {
-        __ bl(StubRoutines::aarch64::copy_oop_f());
+        __ lea(rscratch1, RuntimeAddress(StubRoutines::aarch64::copy_oop_f()));
+        __ blr(rscratch1);
       }
     } else {
       if (type != T_OBJECT) {
-        __ bl(StubRoutines::aarch64::copy_byte_b());
+        __ lea(rscratch1, RuntimeAddress(StubRoutines::aarch64::copy_byte_b()));
+        __ blr(rscratch1);
       } else if ((decorators & IS_DEST_UNINITIALIZED) != 0) {
-        __ bl(StubRoutines::aarch64::copy_oop_uninit_b());
+        __ lea(rscratch1, RuntimeAddress(StubRoutines::aarch64::copy_oop_uninit_b()));
+        __ blr(rscratch1);
       } else {
-        __ bl(StubRoutines::aarch64::copy_oop_b());
+        __ lea(rscratch1, RuntimeAddress(StubRoutines::aarch64::copy_oop_b()));
+        __ blr(rscratch1);
       }
     }
 
@@ -1508,8 +1744,8 @@ class StubGenerator: public StubCodeGenerator {
   //   stub_id - is used to name the stub and identify all details of
   //             how to perform the copy.
   //
-  //   entry - is assigned to the stub's post push entry point unless
-  //           it is null
+  //   nopush_entry - is assigned to the stub's post push entry point
+  //                  unless it is null
   //
   // Inputs:
   //   c_rarg0   - source array address
@@ -1525,8 +1761,6 @@ class StubGenerator: public StubCodeGenerator {
   //               copy method
   //
   address generate_disjoint_copy(StubId stub_id, address *nopush_entry) {
-    Register s = c_rarg0, d = c_rarg1, count = c_rarg2;
-    RegSet saved_reg = RegSet::of(s, d, count);
     int size;
     bool aligned;
     bool is_oop;
@@ -1607,17 +1841,45 @@ class StubGenerator: public StubCodeGenerator {
       ShouldNotReachHere();
       break;
     }
+    // all stubs provide a 2nd entry which omits the frame push for
+    // use when bailing out from a conjoint copy. However we may also
+    // need some extra addressses for memory access protection.
+    int entry_count = StubInfo::entry_count(stub_id);
+    assert(entry_count == 2, "sanity check");
+    assert(nopush_entry != nullptr, "all disjoint copy stubs export a nopush entry");
+
+    bool add_extras = !is_oop && (!aligned || sizeof(jlong) == size);
+    int extra_count = ((add_extras ? 1 : 0) * UnsafeMemoryAccess::COLUMN_COUNT);
+    GrowableArray<address> entries;
+    GrowableArray<address> extras;
+    GrowableArray<address> *extras_ptr = (extra_count > 0 ? &extras : nullptr);
+    address start = load_archive_data(stub_id, &entries, extras_ptr);
+    if (start != nullptr) {
+      assert(entries.length() == entry_count - 1,
+             "unexpected entries count %d", entries.length());
+      *nopush_entry = entries.at(0);
+      assert(extras.length() == extra_count,
+             "unexpected extra count %d", extras.length());
+      if (add_extras) {
+        // register one handler at offset 0
+        register_unsafe_access_handlers(extras, 0, 1);
+      }
+      return start;
+    }
+
+    Register s = c_rarg0, d = c_rarg1, count = c_rarg2;
+    RegSet saved_reg = RegSet::of(s, d, count);
 
     __ align(CodeEntryAlignment);
     StubCodeMark mark(this, stub_id);
-    address start = __ pc();
+    start = __ pc();
     __ enter();
 
-    if (nopush_entry != nullptr) {
-      *nopush_entry = __ pc();
-      // caller can pass a 64-bit byte count here (from Unsafe.copyMemory)
-      BLOCK_COMMENT("Entry:");
-    }
+    *nopush_entry = __ pc();
+    entries.append(*nopush_entry);
+
+    // caller can pass a 64-bit byte count here (from Unsafe.copyMemory)
+    BLOCK_COMMENT("Post-Push Entry:");
 
     DecoratorSet decorators = IN_HEAP | IS_ARRAY | ARRAYCOPY_DISJOINT;
     if (dest_uninitialized) {
@@ -1636,8 +1898,7 @@ class StubGenerator: public StubCodeGenerator {
     }
     {
       // UnsafeMemoryAccess page error: continue after unsafe access
-      bool add_entry = !is_oop && (!aligned || sizeof(jlong) == size);
-      UnsafeMemoryAccessMark umam(this, add_entry, true);
+      UnsafeMemoryAccessMark umam(this, add_extras, true);
       copy_memory(decorators, is_oop ? T_OBJECT : T_BYTE, aligned, s, d, count, size);
     }
 
@@ -1652,6 +1913,20 @@ class StubGenerator: public StubCodeGenerator {
     __ leave();
     __ mov(r0, zr); // return 0
     __ ret(lr);
+
+    address end = __ pc();
+
+    if (add_extras) {
+      // retrieve the registered handler addresses
+      retrieve_unsafe_access_handlers(start, end, extras);
+      assert(extras.length() == extra_count
+             , "incorrect handlers count %d", extras.length());
+    }
+
+    // record the stub entry and end plus the no_push entry and any
+    // extra handler addresses
+    store_archive_data(stub_id, start, end, &entries, extras_ptr);
+
     return start;
   }
 
@@ -1663,8 +1938,8 @@ class StubGenerator: public StubCodeGenerator {
   //             corresponding disjoint copy routine which can be
   //             jumped to if the ranges do not actually overlap
   //
-  //   entry - is assigned to the stub's post push entry point unless
-  //           it is null
+  //   nopush_entry - is assigned to the stub's post push entry point
+  //                  unless it is null
   //
   //
   // Inputs:
@@ -1681,8 +1956,6 @@ class StubGenerator: public StubCodeGenerator {
   //   used by some other conjoint copy method
   //
   address generate_conjoint_copy(StubId stub_id, address nooverlap_target, address *nopush_entry) {
-    Register s = c_rarg0, d = c_rarg1, count = c_rarg2;
-    RegSet saved_regs = RegSet::of(s, d, count);
     int size;
     bool aligned;
     bool is_oop;
@@ -1762,15 +2035,47 @@ class StubGenerator: public StubCodeGenerator {
     default:
       ShouldNotReachHere();
     }
+    // only some conjoint stubs generate a 2nd entry
+    int entry_count = StubInfo::entry_count(stub_id);
+    int expected_entry_count = (nopush_entry == nullptr ? 1 : 2);
+    assert(entry_count == expected_entry_count,
+           "expected entry count %d does not match declared entry count %d for stub %s",
+           expected_entry_count, entry_count, StubInfo::name(stub_id));
 
+    // We need to protect memory accesses in certain cases
+    bool add_extras = !is_oop && (!aligned || sizeof(jlong) == size);
+    int extra_count = ((add_extras ? 1 : 0) * UnsafeMemoryAccess::COLUMN_COUNT);
+    GrowableArray<address> entries;
+    GrowableArray<address> extras;
+    GrowableArray<address> *entries_ptr = (nopush_entry != nullptr ? &entries : nullptr);
+    GrowableArray<address> *extras_ptr = (extra_count > 0 ? &extras : nullptr);
+    address start = load_archive_data(stub_id, entries_ptr, extras_ptr);
+    if (start != nullptr) {
+      assert(entries.length() == expected_entry_count - 1,
+             "unexpected entries count %d", entries.length());
+      assert(extras.length() == extra_count,
+             "unexpected extra count %d", extras.length());
+      if (nopush_entry != nullptr) {
+        *nopush_entry = entries.at(0);
+      }
+      if (add_extras) {
+        // register one handler at offset 0
+        register_unsafe_access_handlers(extras, 0, 1);
+      }
+      return start;
+    }
+
+    Register s = c_rarg0, d = c_rarg1, count = c_rarg2;
+    RegSet saved_regs = RegSet::of(s, d, count);
     StubCodeMark mark(this, stub_id);
-    address start = __ pc();
+    start = __ pc();
     __ enter();
 
     if (nopush_entry != nullptr) {
       *nopush_entry = __ pc();
+      entries.append(*nopush_entry);
       // caller can pass a 64-bit byte count here (from Unsafe.copyMemory)
-      BLOCK_COMMENT("Entry:");
+      BLOCK_COMMENT("Post-Push Entry:");
     }
 
     // use fwd copy when (d-s) above_equal (count*size)
@@ -1798,8 +2103,7 @@ class StubGenerator: public StubCodeGenerator {
     }
     {
       // UnsafeMemoryAccess page error: continue after unsafe access
-      bool add_entry = !is_oop && (!aligned || sizeof(jlong) == size);
-      UnsafeMemoryAccessMark umam(this, add_entry, true);
+      UnsafeMemoryAccessMark umam(this, add_extras, true);
       copy_memory(decorators, is_oop ? T_OBJECT : T_BYTE, aligned, s, d, count, -size);
     }
     if (is_oop) {
@@ -1811,6 +2115,23 @@ class StubGenerator: public StubCodeGenerator {
     __ leave();
     __ mov(r0, zr); // return 0
     __ ret(lr);
+
+    assert(entries.length() == expected_entry_count - 1,
+           "unexpected entries count %d", entries.length());
+
+    address end = __ pc();
+
+    if (add_extras) {
+      // retrieve the registered handler addresses
+      retrieve_unsafe_access_handlers(start, end, extras);
+      assert(extras.length() == extra_count,
+             "incorrect handlers count %d", extras.length());
+    }
+
+    // record the stub entry and end plus any no_push entry and/or
+    // extra handler addresses
+    store_archive_data(stub_id, start, end, entries_ptr, extras_ptr);
+
     return start;
   }
 
@@ -1864,6 +2185,27 @@ class StubGenerator: public StubCodeGenerator {
       ShouldNotReachHere();
     }
 
+    // The normal stub provides a 2nd entry which omits the frame push
+    // for use when bailing out from a disjoint copy.
+    // Only some conjoint stubs generate a 2nd entry
+    int entry_count = StubInfo::entry_count(stub_id);
+    int expected_entry_count = (nopush_entry == nullptr ? 1 : 2);
+    GrowableArray<address> entries;
+    GrowableArray<address> *entries_ptr = (expected_entry_count == 1 ? nullptr : &entries);
+    assert(entry_count == expected_entry_count,
+           "expected entry count %d does not match declared entry count %d for stub %s",
+           expected_entry_count, entry_count, StubInfo::name(stub_id));
+    address start = load_archive_data(stub_id, entries_ptr);
+    if (start != nullptr) {
+      assert(entries.length() + 1 == expected_entry_count,
+             "expected entry count %d does not match return entry count %d for stub %s",
+             expected_entry_count, entries.length() + 1, StubInfo::name(stub_id));
+      if (nopush_entry != nullptr) {
+        *nopush_entry = entries.at(0);
+      }
+      return start;
+    }
+
     Label L_load_element, L_store_element, L_do_card_marks, L_done, L_done_pop;
 
     // Input registers (after setup_arg_regs)
@@ -1896,7 +2238,7 @@ class StubGenerator: public StubCodeGenerator {
 
     __ align(CodeEntryAlignment);
     StubCodeMark mark(this, stub_id);
-    address start = __ pc();
+    start = __ pc();
 
     __ enter(); // required for proper stackwalking of RuntimeStub frame
 
@@ -1913,6 +2255,7 @@ class StubGenerator: public StubCodeGenerator {
     // Caller of this entry point must set up the argument registers.
     if (nopush_entry != nullptr) {
       *nopush_entry = __ pc();
+      entries.append(*nopush_entry);
       BLOCK_COMMENT("Entry:");
     }
 
@@ -2010,6 +2353,8 @@ class StubGenerator: public StubCodeGenerator {
     __ leave();
     __ ret(lr);
 
+    // record the stub entry and end plus any no_push entry
+    store_archive_data(stub_id, start, __ pc() , entries_ptr);
     return start;
   }
 
@@ -2072,13 +2417,18 @@ class StubGenerator: public StubCodeGenerator {
                                address int_copy_entry,
                                address long_copy_entry) {
     StubId stub_id = StubId::stubgen_unsafe_arraycopy_id;
-
+    int entry_count = StubInfo::entry_count(stub_id);
+    assert(entry_count == 1, "sanity check");
+    address start = load_archive_data(stub_id);
+    if (start != nullptr) {
+      return start;
+    }
     Label L_long_aligned, L_int_aligned, L_short_aligned;
     Register s = c_rarg0, d = c_rarg1, count = c_rarg2;
 
     __ align(CodeEntryAlignment);
     StubCodeMark mark(this, stub_id);
-    address start = __ pc();
+    start = __ pc();
     __ enter(); // required for proper stackwalking of RuntimeStub frame
 
     // bump this on entry, not on exit:
@@ -2104,6 +2454,9 @@ class StubGenerator: public StubCodeGenerator {
     __ lsr(count, count, LogBytesPerLong);   // size => long_count
     __ b(RuntimeAddress(long_copy_entry));
 
+    // record the stub entry and end
+    store_archive_data(stub_id, start, __ pc());
+
     return start;
   }
 
@@ -2125,7 +2478,12 @@ class StubGenerator: public StubCodeGenerator {
                                 address int_copy_entry, address oop_copy_entry,
                                 address long_copy_entry, address checkcast_copy_entry) {
     StubId stub_id = StubId::stubgen_generic_arraycopy_id;
-
+    int entry_count = StubInfo::entry_count(stub_id);
+    assert(entry_count == 1, "sanity check");
+    address start = load_archive_data(stub_id);
+    if (start != nullptr) {
+      return start;
+    }
     Label L_failed, L_objArray;
     Label L_copy_bytes, L_copy_shorts, L_copy_ints, L_copy_longs;
 
@@ -2144,7 +2502,7 @@ class StubGenerator: public StubCodeGenerator {
 
     StubCodeMark mark(this, stub_id);
 
-    address start = __ pc();
+    start = __ pc();
 
     __ enter(); // required for proper stackwalking of RuntimeStub frame
 
@@ -2383,6 +2741,9 @@ class StubGenerator: public StubCodeGenerator {
     __ leave();   // required for proper stackwalking of RuntimeStub frame
     __ ret(lr);
 
+    // record the stub entry and end
+    store_archive_data(stub_id, start, __ pc());
+
     return start;
   }
 
@@ -2427,10 +2788,15 @@ class StubGenerator: public StubCodeGenerator {
     default:
       ShouldNotReachHere();
     };
-
+    int entry_count = StubInfo::entry_count(stub_id);
+    assert(entry_count == 1, "sanity check");
+    address start = load_archive_data(stub_id);
+    if (start != nullptr) {
+      return start;
+    }
     __ align(CodeEntryAlignment);
     StubCodeMark mark(this, stub_id);
-    address start = __ pc();
+    start = __ pc();
 
     BLOCK_COMMENT("Entry:");
 
@@ -2563,15 +2929,32 @@ class StubGenerator: public StubCodeGenerator {
     __ bind(L_exit2);
     __ leave();
     __ ret(lr);
+
+    // record the stub entry and end
+    store_archive_data(stub_id, start, __ pc());
+
     return start;
   }
 
   address generate_unsafecopy_common_error_exit() {
-    address start_pc = __ pc();
+    StubId stub_id = StubId::stubgen_unsafecopy_common_id;
+    int entry_count = StubInfo::entry_count(stub_id);
+    assert(entry_count == 1, "sanity check");
+    address start = load_archive_data(stub_id);
+    if (start != nullptr) {
+      return start;
+    }
+    __ align(CodeEntryAlignment);
+    StubCodeMark mark(this, stub_id);
+    start = __ pc();
       __ leave();
       __ mov(r0, 0);
       __ ret(lr);
-    return start_pc;
+
+    // record the stub entry and end
+    store_archive_data(stub_id, start, __ pc());
+
+    return start;
   }
 
   //
@@ -2589,13 +2972,28 @@ class StubGenerator: public StubCodeGenerator {
   //    c_rarg2   - byte value
   //
   address generate_unsafe_setmemory() {
+    StubId stub_id = StubId::stubgen_unsafe_setmemory_id;
+    int entry_count = StubInfo::entry_count(stub_id);
+    assert(entry_count == 1, "sanity check");
+    // we expect one set of extra unsafememory access handler entries
+    GrowableArray<address> extras;
+    int extra_count =  1 * UnsafeMemoryAccess::COLUMN_COUNT;
+    address start = load_archive_data(stub_id, nullptr, &extras);
+    if (start != nullptr) {
+      assert(extras.length() == extra_count,
+             "unexpected extra entry count %d", extras.length());
+      register_unsafe_access_handlers(extras, 0, 1);
+      return start;
+    }
+
     __ align(CodeEntryAlignment);
-    StubCodeMark mark(this, StubId::stubgen_unsafe_setmemory_id);
-    address start = __ pc();
+    StubCodeMark mark(this, stub_id);
+    start = __ pc();
 
     Register dest = c_rarg0, count = c_rarg1, value = c_rarg2;
     Label tail;
 
+    {
     UnsafeMemoryAccessMark umam(this, true, false);
 
     __ enter(); // required for proper stackwalking of RuntimeStub frame
@@ -2679,6 +3077,17 @@ class StubGenerator: public StubCodeGenerator {
     __ bind(finished);
     __ leave();
     __ ret(lr);
+    // have to exit the block and destroy the UnsafeMemoryAccessMark
+    // in order to retrieve the handler end address
+    }
+
+    // install saved handler addresses in extras
+    address end = __ pc();
+    retrieve_unsafe_access_handlers(start, end, extras);
+    assert(extras.length() == extra_count,
+           "incorrect handlers count %d", extras.length());
+    // record the stub entry and end plus the extras
+    store_archive_data(stub_id, start, end, nullptr, &extras);
 
     return start;
   }
@@ -2686,33 +3095,45 @@ class StubGenerator: public StubCodeGenerator {
   address generate_data_cache_writeback() {
     const Register line        = c_rarg0;  // address of line to write back
 
-    __ align(CodeEntryAlignment);
-
     StubId stub_id = StubId::stubgen_data_cache_writeback_id;
+    int entry_count = StubInfo::entry_count(stub_id);
+    assert(entry_count == 1, "sanity check");
+    address start = load_archive_data(stub_id);
+    if (start != nullptr) {
+      return start;
+    }
+    __ align(CodeEntryAlignment);
     StubCodeMark mark(this, stub_id);
 
-    address start = __ pc();
+    start = __ pc();
     __ enter();
     __ cache_wb(Address(line, 0));
     __ leave();
     __ ret(lr);
 
+    // record the stub entry and end
+    store_archive_data(stub_id, start, __ pc());
+
     return start;
   }
 
   address generate_data_cache_writeback_sync() {
-    const Register is_pre     = c_rarg0;  // pre or post sync
-
-    __ align(CodeEntryAlignment);
-
     StubId stub_id = StubId::stubgen_data_cache_writeback_sync_id;
+    int entry_count = StubInfo::entry_count(stub_id);
+    assert(entry_count == 1, "sanity check");
+    address start = load_archive_data(stub_id);
+    if (start != nullptr) {
+      return start;
+    }
+    const Register is_pre     = c_rarg0;  // pre or post sync
+    __ align(CodeEntryAlignment);
     StubCodeMark mark(this, stub_id);
 
     // pre wbsync is a no-op
     // post wbsync translates to an sfence
 
     Label skip;
-    address start = __ pc();
+    start = __ pc();
     __ enter();
     __ cbnz(is_pre, skip);
     __ cache_wbsync(false);
@@ -2720,6 +3141,9 @@ class StubGenerator: public StubCodeGenerator {
     __ leave();
     __ ret(lr);
 
+    // record the stub entry and end
+    store_archive_data(stub_id, start, __ pc());
+
     return start;
   }
 
@@ -2882,8 +3306,15 @@ class StubGenerator: public StubCodeGenerator {
   //   c_rarg2   - sessionKe (key) in little endian int array
   //
   address generate_aescrypt_encryptBlock() {
-    __ align(CodeEntryAlignment);
+    assert(UseAES, "need AES cryptographic extension support");
     StubId stub_id = StubId::stubgen_aescrypt_encryptBlock_id;
+    int entry_count = StubInfo::entry_count(stub_id);
+    assert(entry_count == 1, "sanity check");
+    address start = load_archive_data(stub_id);
+    if (start != nullptr) {
+      return start;
+    }
+    __ align(CodeEntryAlignment);
     StubCodeMark mark(this, stub_id);
 
     const Register from        = c_rarg0;  // source array address
@@ -2891,7 +3322,7 @@ class StubGenerator: public StubCodeGenerator {
     const Register key         = c_rarg2;  // key array address
     const Register keylen      = rscratch1;
 
-    address start = __ pc();
+    start = __ pc();
     __ enter();
 
     __ ldrw(keylen, Address(key, arrayOopDesc::length_offset_in_bytes() - arrayOopDesc::base_offset_in_bytes(T_INT)));
@@ -2904,6 +3335,9 @@ class StubGenerator: public StubCodeGenerator {
     __ leave();
     __ ret(lr);
 
+    // record the stub entry and end
+    store_archive_data(stub_id, start, __ pc());
+
     return start;
   }
 
@@ -2916,8 +3350,14 @@ class StubGenerator: public StubCodeGenerator {
   //
   address generate_aescrypt_decryptBlock() {
     assert(UseAES, "need AES cryptographic extension support");
-    __ align(CodeEntryAlignment);
     StubId stub_id = StubId::stubgen_aescrypt_decryptBlock_id;
+    int entry_count = StubInfo::entry_count(stub_id);
+    assert(entry_count == 1, "sanity check");
+    address start = load_archive_data(stub_id);
+    if (start != nullptr) {
+      return start;
+    }
+    __ align(CodeEntryAlignment);
     StubCodeMark mark(this, stub_id);
     Label L_doLast;
 
@@ -2926,7 +3366,7 @@ class StubGenerator: public StubCodeGenerator {
     const Register key         = c_rarg2;  // key array address
     const Register keylen      = rscratch1;
 
-    address start = __ pc();
+    start = __ pc();
     __ enter(); // required for proper stackwalking of RuntimeStub frame
 
     __ ldrw(keylen, Address(key, arrayOopDesc::length_offset_in_bytes() - arrayOopDesc::base_offset_in_bytes(T_INT)));
@@ -2938,6 +3378,9 @@ class StubGenerator: public StubCodeGenerator {
     __ leave();
     __ ret(lr);
 
+    // record the stub entry and end
+    store_archive_data(stub_id, start, __ pc());
+
     return start;
   }
 
@@ -2955,8 +3398,14 @@ class StubGenerator: public StubCodeGenerator {
   //
   address generate_cipherBlockChaining_encryptAESCrypt() {
     assert(UseAES, "need AES cryptographic extension support");
-    __ align(CodeEntryAlignment);
     StubId stub_id = StubId::stubgen_cipherBlockChaining_encryptAESCrypt_id;
+    int entry_count = StubInfo::entry_count(stub_id);
+    assert(entry_count == 1, "sanity check");
+    address start = load_archive_data(stub_id);
+    if (start != nullptr) {
+      return start;
+    }
+    __ align(CodeEntryAlignment);
     StubCodeMark mark(this, stub_id);
 
     Label L_loadkeys_44, L_loadkeys_52, L_aes_loop, L_rounds_44, L_rounds_52;
@@ -2969,7 +3418,7 @@ class StubGenerator: public StubCodeGenerator {
     const Register len_reg     = c_rarg4;  // src len (must be multiple of blocksize 16)
     const Register keylen      = rscratch1;
 
-    address start = __ pc();
+    start = __ pc();
 
       __ enter();
 
@@ -3043,6 +3492,9 @@ class StubGenerator: public StubCodeGenerator {
       __ leave();
       __ ret(lr);
 
+      // record the stub entry and end
+      store_archive_data(stub_id, start, __ pc());
+
       return start;
   }
 
@@ -3060,8 +3512,14 @@ class StubGenerator: public StubCodeGenerator {
   //
   address generate_cipherBlockChaining_decryptAESCrypt() {
     assert(UseAES, "need AES cryptographic extension support");
-    __ align(CodeEntryAlignment);
     StubId stub_id = StubId::stubgen_cipherBlockChaining_decryptAESCrypt_id;
+    int entry_count = StubInfo::entry_count(stub_id);
+    assert(entry_count == 1, "sanity check");
+    address start = load_archive_data(stub_id);
+    if (start != nullptr) {
+      return start;
+    }
+    __ align(CodeEntryAlignment);
     StubCodeMark mark(this, stub_id);
 
     Label L_loadkeys_44, L_loadkeys_52, L_aes_loop, L_rounds_44, L_rounds_52;
@@ -3074,7 +3532,7 @@ class StubGenerator: public StubCodeGenerator {
     const Register len_reg     = c_rarg4;  // src len (must be multiple of blocksize 16)
     const Register keylen      = rscratch1;
 
-    address start = __ pc();
+    start = __ pc();
 
       __ enter();
 
@@ -3152,6 +3610,9 @@ class StubGenerator: public StubCodeGenerator {
       __ leave();
       __ ret(lr);
 
+    // record the stub entry and end
+    store_archive_data(stub_id, start, __ pc());
+
     return start;
   }
 
@@ -3188,6 +3649,13 @@ class StubGenerator: public StubCodeGenerator {
   //   r0       - input length
   //
   address generate_counterMode_AESCrypt() {
+    StubId stub_id = StubId::stubgen_counterMode_AESCrypt_id;
+    int entry_count = StubInfo::entry_count(stub_id);
+    assert(entry_count == 1, "sanity check");
+    address start = load_archive_data(stub_id);
+    if (start != nullptr) {
+      return start;
+    }
     const Register in = c_rarg0;
     const Register out = c_rarg1;
     const Register key = c_rarg2;
@@ -3248,9 +3716,8 @@ class StubGenerator: public StubCodeGenerator {
     //    Wide bulk encryption of whole blocks.
 
     __ align(CodeEntryAlignment);
-    StubId stub_id = StubId::stubgen_counterMode_AESCrypt_id;
     StubCodeMark mark(this, stub_id);
-    const address start = __ pc();
+    start = __ pc();
     __ enter();
 
     Label DONE, CTR_large_block, large_block_return;
@@ -3435,6 +3902,9 @@ class StubGenerator: public StubCodeGenerator {
     __ strw(used, Address(used_ptr));
     __ b(large_block_return);
 
+    // record the stub entry and end
+    store_archive_data(stub_id, start, __ pc());
+
     return start;
   }
 
@@ -3451,11 +3921,16 @@ class StubGenerator: public StubCodeGenerator {
   // return - number of processed bytes
   address generate_galoisCounterMode_AESCrypt() {
     Label ghash_polynomial; // local data generated after code
-
-   __ align(CodeEntryAlignment);
     StubId stub_id = StubId::stubgen_galoisCounterMode_AESCrypt_id;
+    int entry_count = StubInfo::entry_count(stub_id);
+    assert(entry_count == 1, "sanity check");
+    address start = load_archive_data(stub_id);
+    if (start != nullptr) {
+      return start;
+    }
+    __ align(CodeEntryAlignment);
     StubCodeMark mark(this, stub_id);
-    address start = __ pc();
+    start = __ pc();
     __ enter();
 
     const Register in = c_rarg0;
@@ -3567,6 +4042,9 @@ class StubGenerator: public StubCodeGenerator {
                           // 128-bit vector
     __ emit_int64(0x87);
 
+    // record the stub entry and end
+    store_archive_data(stub_id, start, __ pc());
+
     return start;
   }
 
@@ -3685,10 +4163,16 @@ class StubGenerator: public StubCodeGenerator {
     default:
       ShouldNotReachHere();
     }
+    int entry_count = StubInfo::entry_count(stub_id);
+    assert(entry_count == 1, "sanity check");
+    address start = load_archive_data(stub_id);
+    if (start != nullptr) {
+      return start;
+    }
     __ align(CodeEntryAlignment);
 
     StubCodeMark mark(this, stub_id);
-    address start = __ pc();
+    start = __ pc();
 
     Register buf       = c_rarg0;
     Register state     = c_rarg1;
@@ -3815,6 +4299,9 @@ class StubGenerator: public StubCodeGenerator {
 
     __ ret(lr);
 
+    // record the stub entry and end
+    store_archive_data(stub_id, start, __ pc());
+
     return start;
   }
 
@@ -3838,11 +4325,16 @@ class StubGenerator: public StubCodeGenerator {
     default:
       ShouldNotReachHere();
     }
-
+    int entry_count = StubInfo::entry_count(stub_id);
+    assert(entry_count == 1, "sanity check");
+    address start = load_archive_data(stub_id);
+    if (start != nullptr) {
+      return start;
+    }
     __ align(CodeEntryAlignment);
 
     StubCodeMark mark(this, stub_id);
-    address start = __ pc();
+    start = __ pc();
 
     Register buf   = c_rarg0;
     Register state = c_rarg1;
@@ -3919,6 +4411,9 @@ class StubGenerator: public StubCodeGenerator {
     __ emit_int32(0x8f1bbcdc);
     __ emit_int32(0xca62c1d6);
 
+    // record the stub entry and end
+    store_archive_data(stub_id, start, __ pc());
+
     return start;
   }
 
@@ -3943,30 +4438,15 @@ class StubGenerator: public StubCodeGenerator {
     default:
       ShouldNotReachHere();
     }
-
-    static const uint32_t round_consts[64] = {
-      0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5,
-      0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5,
-      0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3,
-      0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174,
-      0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc,
-      0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da,
-      0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7,
-      0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967,
-      0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13,
-      0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85,
-      0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3,
-      0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070,
-      0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5,
-      0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3,
-      0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208,
-      0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2,
-    };
-
+    int entry_count = StubInfo::entry_count(stub_id);
+    assert(entry_count == 1, "sanity check");
+    address start = load_archive_data(stub_id);
+    if (start != nullptr) {
+      return start;
+    }
     __ align(CodeEntryAlignment);
-
     StubCodeMark mark(this, stub_id);
-    address start = __ pc();
+    start = __ pc();
 
     Register buf   = c_rarg0;
     Register state = c_rarg1;
@@ -3987,7 +4467,7 @@ class StubGenerator: public StubCodeGenerator {
 // t1 == v7
 
     // load 16 keys to v16..v31
-    __ lea(rscratch1, ExternalAddress((address)round_consts));
+    __ lea(rscratch1, ExternalAddress((address)_sha256_round_consts));
     __ ld1(v16, v17, v18, v19, __ T4S, __ post(rscratch1, 64));
     __ ld1(v20, v21, v22, v23, __ T4S, __ post(rscratch1, 64));
     __ ld1(v24, v25, v26, v27, __ T4S, __ post(rscratch1, 64));
@@ -4048,6 +4528,9 @@ class StubGenerator: public StubCodeGenerator {
 
     __ ret(lr);
 
+    // record the stub entry and end
+    store_archive_data(stub_id, start, __ pc());
+
     return start;
   }
 
@@ -4099,41 +4582,15 @@ class StubGenerator: public StubCodeGenerator {
     default:
       ShouldNotReachHere();
     }
-
-    static const uint64_t round_consts[80] = {
-      0x428A2F98D728AE22L, 0x7137449123EF65CDL, 0xB5C0FBCFEC4D3B2FL,
-      0xE9B5DBA58189DBBCL, 0x3956C25BF348B538L, 0x59F111F1B605D019L,
-      0x923F82A4AF194F9BL, 0xAB1C5ED5DA6D8118L, 0xD807AA98A3030242L,
-      0x12835B0145706FBEL, 0x243185BE4EE4B28CL, 0x550C7DC3D5FFB4E2L,
-      0x72BE5D74F27B896FL, 0x80DEB1FE3B1696B1L, 0x9BDC06A725C71235L,
-      0xC19BF174CF692694L, 0xE49B69C19EF14AD2L, 0xEFBE4786384F25E3L,
-      0x0FC19DC68B8CD5B5L, 0x240CA1CC77AC9C65L, 0x2DE92C6F592B0275L,
-      0x4A7484AA6EA6E483L, 0x5CB0A9DCBD41FBD4L, 0x76F988DA831153B5L,
-      0x983E5152EE66DFABL, 0xA831C66D2DB43210L, 0xB00327C898FB213FL,
-      0xBF597FC7BEEF0EE4L, 0xC6E00BF33DA88FC2L, 0xD5A79147930AA725L,
-      0x06CA6351E003826FL, 0x142929670A0E6E70L, 0x27B70A8546D22FFCL,
-      0x2E1B21385C26C926L, 0x4D2C6DFC5AC42AEDL, 0x53380D139D95B3DFL,
-      0x650A73548BAF63DEL, 0x766A0ABB3C77B2A8L, 0x81C2C92E47EDAEE6L,
-      0x92722C851482353BL, 0xA2BFE8A14CF10364L, 0xA81A664BBC423001L,
-      0xC24B8B70D0F89791L, 0xC76C51A30654BE30L, 0xD192E819D6EF5218L,
-      0xD69906245565A910L, 0xF40E35855771202AL, 0x106AA07032BBD1B8L,
-      0x19A4C116B8D2D0C8L, 0x1E376C085141AB53L, 0x2748774CDF8EEB99L,
-      0x34B0BCB5E19B48A8L, 0x391C0CB3C5C95A63L, 0x4ED8AA4AE3418ACBL,
-      0x5B9CCA4F7763E373L, 0x682E6FF3D6B2B8A3L, 0x748F82EE5DEFB2FCL,
-      0x78A5636F43172F60L, 0x84C87814A1F0AB72L, 0x8CC702081A6439ECL,
-      0x90BEFFFA23631E28L, 0xA4506CEBDE82BDE9L, 0xBEF9A3F7B2C67915L,
-      0xC67178F2E372532BL, 0xCA273ECEEA26619CL, 0xD186B8C721C0C207L,
-      0xEADA7DD6CDE0EB1EL, 0xF57D4F7FEE6ED178L, 0x06F067AA72176FBAL,
-      0x0A637DC5A2C898A6L, 0x113F9804BEF90DAEL, 0x1B710B35131C471BL,
-      0x28DB77F523047D84L, 0x32CAAB7B40C72493L, 0x3C9EBE0A15C9BEBCL,
-      0x431D67C49C100D4CL, 0x4CC5D4BECB3E42B6L, 0x597F299CFC657E2AL,
-      0x5FCB6FAB3AD6FAECL, 0x6C44198C4A475817L
-    };
-
+    int entry_count = StubInfo::entry_count(stub_id);
+    assert(entry_count == 1, "sanity check");
+    address start = load_archive_data(stub_id);
+    if (start != nullptr) {
+      return start;
+    }
     __ align(CodeEntryAlignment);
-
     StubCodeMark mark(this, stub_id);
-    address start = __ pc();
+    start = __ pc();
 
     Register buf   = c_rarg0;
     Register state = c_rarg1;
@@ -4151,7 +4608,7 @@ class StubGenerator: public StubCodeGenerator {
     __ ld1(v8, v9, v10, v11, __ T2D, state);
 
     // load first 4 round constants
-    __ lea(rscratch1, ExternalAddress((address)round_consts));
+    __ lea(rscratch1, ExternalAddress((address)_sha512_round_consts));
     __ ld1(v20, v21, v22, v23, __ T2D, __ post(rscratch1, 64));
 
     __ BIND(sha512_loop);
@@ -4236,6 +4693,9 @@ class StubGenerator: public StubCodeGenerator {
 
     __ ret(lr);
 
+    // record the stub entry and end
+    store_archive_data(stub_id, start, __ pc());
+
     return start;
   }
 
@@ -4349,22 +4809,15 @@ class StubGenerator: public StubCodeGenerator {
     default:
       ShouldNotReachHere();
     }
-
-    static const uint64_t round_consts[24] = {
-      0x0000000000000001L, 0x0000000000008082L, 0x800000000000808AL,
-      0x8000000080008000L, 0x000000000000808BL, 0x0000000080000001L,
-      0x8000000080008081L, 0x8000000000008009L, 0x000000000000008AL,
-      0x0000000000000088L, 0x0000000080008009L, 0x000000008000000AL,
-      0x000000008000808BL, 0x800000000000008BL, 0x8000000000008089L,
-      0x8000000000008003L, 0x8000000000008002L, 0x8000000000000080L,
-      0x000000000000800AL, 0x800000008000000AL, 0x8000000080008081L,
-      0x8000000000008080L, 0x0000000080000001L, 0x8000000080008008L
-    };
-
+    int entry_count = StubInfo::entry_count(stub_id);
+    assert(entry_count == 1, "sanity check");
+    address start = load_archive_data(stub_id);
+    if (start != nullptr) {
+      return start;
+    }
     __ align(CodeEntryAlignment);
-
     StubCodeMark mark(this, stub_id);
-    address start = __ pc();
+    start = __ pc();
 
     Register buf           = c_rarg0;
     Register state         = c_rarg1;
@@ -4396,7 +4849,7 @@ class StubGenerator: public StubCodeGenerator {
     __ movw(rscratch2, 24);
 
     // load round_constants base
-    __ lea(rscratch1, ExternalAddress((address) round_consts));
+    __ lea(rscratch1, ExternalAddress((address) _sha3_round_consts));
 
     // load input
     __ ld1(v25, v26, v27, v28, __ T8B, __ post(buf, 32));
@@ -4488,6 +4941,9 @@ class StubGenerator: public StubCodeGenerator {
 
     __ ret(lr);
 
+    // record the stub entry and end
+    store_archive_data(stub_id, start, __ pc());
+
     return start;
   }
 
@@ -4495,22 +4951,18 @@ class StubGenerator: public StubCodeGenerator {
   //   c_rarg0   - long[]  state0
   //   c_rarg1   - long[]  state1
   address generate_double_keccak() {
-    static const uint64_t round_consts[24] = {
-      0x0000000000000001L, 0x0000000000008082L, 0x800000000000808AL,
-      0x8000000080008000L, 0x000000000000808BL, 0x0000000080000001L,
-      0x8000000080008081L, 0x8000000000008009L, 0x000000000000008AL,
-      0x0000000000000088L, 0x0000000080008009L, 0x000000008000000AL,
-      0x000000008000808BL, 0x800000000000008BL, 0x8000000000008089L,
-      0x8000000000008003L, 0x8000000000008002L, 0x8000000000000080L,
-      0x000000000000800AL, 0x800000008000000AL, 0x8000000080008081L,
-      0x8000000000008080L, 0x0000000080000001L, 0x8000000080008008L
-    };
-
+    StubId stub_id = StubId::stubgen_double_keccak_id;
+    int entry_count = StubInfo::entry_count(stub_id);
+    assert(entry_count == 1, "sanity check");
+    address start = load_archive_data(stub_id);
+    if (start != nullptr) {
+      return start;
+    }
     // Implements the double_keccak() method of the
     // sun.secyrity.provider.SHA3Parallel class
     __ align(CodeEntryAlignment);
-    StubCodeMark mark(this, "StubRoutines", "double_keccak");
-    address start = __ pc();
+    StubCodeMark mark(this, stub_id);
+    start = __ pc();
     __ enter();
 
     Register state0        = c_rarg0;
@@ -4546,7 +4998,7 @@ class StubGenerator: public StubCodeGenerator {
     __ movw(rscratch2, 24);
 
     // load round_constants base
-    __ lea(rscratch1, ExternalAddress((address) round_consts));
+    __ lea(rscratch1, ExternalAddress((address) _double_keccak_round_consts));
 
     __ BIND(rounds24_loop);
     __ subw(rscratch2, rscratch2, 1);
@@ -4578,6 +5030,9 @@ class StubGenerator: public StubCodeGenerator {
     __ mov(r0, zr); // return 0
     __ ret(lr);
 
+    // record the stub entry and end
+    store_archive_data(stub_id, start, __ pc());
+
     return start;
   }
 
@@ -4611,11 +5066,17 @@ class StubGenerator: public StubCodeGenerator {
   // vectors write their first lane back to the keystream buffer, followed
   // by the second lane from all vectors and so on.
   address generate_chacha20Block_blockpar() {
+    StubId stub_id = StubId::stubgen_chacha20Block_id;
+    int entry_count = StubInfo::entry_count(stub_id);
+    assert(entry_count == 1, "sanity check");
+    address start = load_archive_data(stub_id);
+    if (start != nullptr) {
+      return start;
+    }
     Label L_twoRounds, L_cc20_const;
     __ align(CodeEntryAlignment);
-    StubId stub_id = StubId::stubgen_chacha20Block_id;
     StubCodeMark mark(this, stub_id);
-    address start = __ pc();
+    start = __ pc();
     __ enter();
 
     int i, j;
@@ -4770,6 +5231,9 @@ class StubGenerator: public StubCodeGenerator {
     __ emit_int64(0x0605040702010003UL);
     __ emit_int64(0x0E0D0C0F0A09080BUL);
 
+    // record the stub entry and end
+    store_archive_data(stub_id, start, __ pc());
+
     return start;
   }
 
@@ -5258,11 +5722,16 @@ class StubGenerator: public StubCodeGenerator {
   // coeffs (short[256]) = c_rarg0
   // ntt_zetas (short[256]) = c_rarg1
   address generate_kyberNtt() {
-
-    __ align(CodeEntryAlignment);
     StubId stub_id = StubId::stubgen_kyberNtt_id;
+    int entry_count = StubInfo::entry_count(stub_id);
+    assert(entry_count == 1, "sanity check");
+    address start = load_archive_data(stub_id);
+    if (start != nullptr) {
+      return start;
+    }
+    __ align(CodeEntryAlignment);
     StubCodeMark mark(this, stub_id);
-    address start = __ pc();
+    start = __ pc();
     __ enter();
 
     const Register coeffs = c_rarg0;
@@ -5486,6 +5955,9 @@ class StubGenerator: public StubCodeGenerator {
     __ mov(r0, zr); // return 0
     __ ret(lr);
 
+    // record the stub entry and end
+    store_archive_data(stub_id, start, __ pc());
+
     return start;
   }
 
@@ -5496,11 +5968,16 @@ class StubGenerator: public StubCodeGenerator {
   // coeffs (short[256]) = c_rarg0
   // ntt_zetas (short[256]) = c_rarg1
   address generate_kyberInverseNtt() {
-
-    __ align(CodeEntryAlignment);
     StubId stub_id = StubId::stubgen_kyberInverseNtt_id;
+    int entry_count = StubInfo::entry_count(stub_id);
+    assert(entry_count == 1, "sanity check");
+    address start = load_archive_data(stub_id);
+    if (start != nullptr) {
+      return start;
+    }
+    __ align(CodeEntryAlignment);
     StubCodeMark mark(this, stub_id);
-    address start = __ pc();
+    start = __ pc();
     __ enter();
 
     const Register coeffs = c_rarg0;
@@ -5770,6 +6247,9 @@ class StubGenerator: public StubCodeGenerator {
     __ mov(r0, zr); // return 0
     __ ret(lr);
 
+    // record the stub entry and end
+    store_archive_data(stub_id, start, __ pc());
+
     return start;
   }
 
@@ -5783,11 +6263,16 @@ class StubGenerator: public StubCodeGenerator {
   // nttb (short[256]) = c_rarg2
   // zetas (short[128]) = c_rarg3
   address generate_kyberNttMult() {
-
-    __ align(CodeEntryAlignment);
     StubId stub_id = StubId::stubgen_kyberNttMult_id;
+    int entry_count = StubInfo::entry_count(stub_id);
+    assert(entry_count == 1, "sanity check");
+    address start = load_archive_data(stub_id);
+    if (start != nullptr) {
+      return start;
+    }
+    __ align(CodeEntryAlignment);
     StubCodeMark mark(this, stub_id);
-    address start = __ pc();
+    start = __ pc();
     __ enter();
 
     const Register result = c_rarg0;
@@ -5889,6 +6374,9 @@ class StubGenerator: public StubCodeGenerator {
     __ mov(r0, zr); // return 0
     __ ret(lr);
 
+    // record the stub entry and end
+    store_archive_data(stub_id, start, __ pc());
+
     return start;
   }
 
@@ -5900,11 +6388,16 @@ class StubGenerator: public StubCodeGenerator {
   // a (short[256]) = c_rarg1
   // b (short[256]) = c_rarg2
   address generate_kyberAddPoly_2() {
-
-    __ align(CodeEntryAlignment);
     StubId stub_id = StubId::stubgen_kyberAddPoly_2_id;
+    int entry_count = StubInfo::entry_count(stub_id);
+    assert(entry_count == 1, "sanity check");
+    address start = load_archive_data(stub_id);
+    if (start != nullptr) {
+      return start;
+    }
+    __ align(CodeEntryAlignment);
     StubCodeMark mark(this, stub_id);
-    address start = __ pc();
+    start = __ pc();
     __ enter();
 
     const Register result = c_rarg0;
@@ -5973,6 +6466,9 @@ class StubGenerator: public StubCodeGenerator {
     __ mov(r0, zr); // return 0
     __ ret(lr);
 
+    // record the stub entry and end
+    store_archive_data(stub_id, start, __ pc());
+
     return start;
   }
 
@@ -5985,11 +6481,16 @@ class StubGenerator: public StubCodeGenerator {
   // b (short[256]) = c_rarg2
   // c (short[256]) = c_rarg3
   address generate_kyberAddPoly_3() {
-
-    __ align(CodeEntryAlignment);
     StubId stub_id = StubId::stubgen_kyberAddPoly_3_id;
+    int entry_count = StubInfo::entry_count(stub_id);
+    assert(entry_count == 1, "sanity check");
+    address start = load_archive_data(stub_id);
+    if (start != nullptr) {
+      return start;
+    }
+    __ align(CodeEntryAlignment);
     StubCodeMark mark(this, stub_id);
-    address start = __ pc();
+    start = __ pc();
     __ enter();
 
     const Register result = c_rarg0;
@@ -6072,6 +6573,9 @@ class StubGenerator: public StubCodeGenerator {
     __ mov(r0, zr); // return 0
     __ ret(lr);
 
+    // record the stub entry and end
+    store_archive_data(stub_id, start, __ pc());
+
     return start;
   }
 
@@ -6092,12 +6596,18 @@ class StubGenerator: public StubCodeGenerator {
   // parsed (short[]) = c_rarg2
   // parsedLength = c_rarg3
   address generate_kyber12To16() {
+    StubId stub_id = StubId::stubgen_kyber12To16_id;
+    int entry_count = StubInfo::entry_count(stub_id);
+    assert(entry_count == 1, "sanity check");
+    address start = load_archive_data(stub_id);
+    if (start != nullptr) {
+      return start;
+    }
     Label L_F00, L_loop;
 
     __ align(CodeEntryAlignment);
-    StubId stub_id = StubId::stubgen_kyber12To16_id;
     StubCodeMark mark(this, stub_id);
-    address start = __ pc();
+    start = __ pc();
     __ enter();
 
     const Register condensed = c_rarg0;
@@ -6225,6 +6735,9 @@ class StubGenerator: public StubCodeGenerator {
     __ emit_int64(0x0f000f000f000f00);
     __ emit_int64(0x0f000f000f000f00);
 
+    // record the stub entry and end
+    store_archive_data(stub_id, start, __ pc());
+
     return start;
   }
 
@@ -6234,11 +6747,16 @@ class StubGenerator: public StubCodeGenerator {
   //
   // coeffs (short[256]) = c_rarg0
   address generate_kyberBarrettReduce() {
-
-    __ align(CodeEntryAlignment);
     StubId stub_id = StubId::stubgen_kyberBarrettReduce_id;
+    int entry_count = StubInfo::entry_count(stub_id);
+    assert(entry_count == 1, "sanity check");
+    address start = load_archive_data(stub_id);
+    if (start != nullptr) {
+      return start;
+    }
+    __ align(CodeEntryAlignment);
     StubCodeMark mark(this, stub_id);
-    address start = __ pc();
+    start = __ pc();
     __ enter();
 
     const Register coeffs = c_rarg0;
@@ -6318,6 +6836,9 @@ class StubGenerator: public StubCodeGenerator {
     __ mov(r0, zr); // return 0
     __ ret(lr);
 
+    // record the stub entry and end
+    store_archive_data(stub_id, start, __ pc());
+
     return start;
   }
 
@@ -6481,11 +7002,16 @@ class StubGenerator: public StubCodeGenerator {
   // coeffs (int[256]) = c_rarg0
   // zetas (int[256]) = c_rarg1
   address generate_dilithiumAlmostNtt() {
-
-    __ align(CodeEntryAlignment);
     StubId stub_id = StubId::stubgen_dilithiumAlmostNtt_id;
+    int entry_count = StubInfo::entry_count(stub_id);
+    assert(entry_count == 1, "sanity check");
+    address start = load_archive_data(stub_id);
+    if (start != nullptr) {
+      return start;
+    }
+    __ align(CodeEntryAlignment);
     StubCodeMark mark(this, stub_id);
-    address start = __ pc();
+    start = __ pc();
     __ enter();
 
     const Register coeffs = c_rarg0;
@@ -6596,6 +7122,9 @@ class StubGenerator: public StubCodeGenerator {
     __ mov(r0, zr); // return 0
     __ ret(lr);
 
+    // record the stub entry and end
+    store_archive_data(stub_id, start, __ pc());
+
     return start;
   }
 
@@ -6688,11 +7217,16 @@ class StubGenerator: public StubCodeGenerator {
   // coeffs (int[256]) = c_rarg0
   // zetas (int[256]) = c_rarg1
   address generate_dilithiumAlmostInverseNtt() {
-
-    __ align(CodeEntryAlignment);
     StubId stub_id = StubId::stubgen_dilithiumAlmostInverseNtt_id;
+    int entry_count = StubInfo::entry_count(stub_id);
+    assert(entry_count == 1, "sanity check");
+    address start = load_archive_data(stub_id);
+    if (start != nullptr) {
+      return start;
+    }
+    __ align(CodeEntryAlignment);
     StubCodeMark mark(this, stub_id);
-    address start = __ pc();
+    start = __ pc();
     __ enter();
 
     const Register coeffs = c_rarg0;
@@ -6788,6 +7322,9 @@ class StubGenerator: public StubCodeGenerator {
     __ mov(r0, zr); // return 0
     __ ret(lr);
 
+    // record the stub entry and end
+    store_archive_data(stub_id, start, __ pc());
+
     return start;
   }
 
@@ -6801,11 +7338,16 @@ class StubGenerator: public StubCodeGenerator {
   // poly1 (int[256]) = c_rarg1
   // poly2 (int[256]) = c_rarg2
   address generate_dilithiumNttMult() {
-
-        __ align(CodeEntryAlignment);
     StubId stub_id = StubId::stubgen_dilithiumNttMult_id;
+    int entry_count = StubInfo::entry_count(stub_id);
+    assert(entry_count == 1, "sanity check");
+    address start = load_archive_data(stub_id);
+    if (start != nullptr) {
+      return start;
+    }
+    __ align(CodeEntryAlignment);
     StubCodeMark mark(this, stub_id);
-    address start = __ pc();
+    start = __ pc();
     __ enter();
 
     Label L_loop;
@@ -6854,6 +7396,9 @@ class StubGenerator: public StubCodeGenerator {
     __ mov(r0, zr); // return 0
     __ ret(lr);
 
+    // record the stub entry and end
+    store_archive_data(stub_id, start, __ pc());
+
     return start;
   }
 
@@ -6865,11 +7410,16 @@ class StubGenerator: public StubCodeGenerator {
   // coeffs (int[256]) = c_rarg0
   // constant (int) = c_rarg1
   address generate_dilithiumMontMulByConstant() {
-
-    __ align(CodeEntryAlignment);
     StubId stub_id = StubId::stubgen_dilithiumMontMulByConstant_id;
+    int entry_count = StubInfo::entry_count(stub_id);
+    assert(entry_count == 1, "sanity check");
+    address start = load_archive_data(stub_id);
+    if (start != nullptr) {
+      return start;
+    }
+    __ align(CodeEntryAlignment);
     StubCodeMark mark(this, stub_id);
-    address start = __ pc();
+    start = __ pc();
     __ enter();
 
     Label L_loop;
@@ -6915,6 +7465,9 @@ class StubGenerator: public StubCodeGenerator {
     __ mov(r0, zr); // return 0
     __ ret(lr);
 
+    // record the stub entry and end
+    store_archive_data(stub_id, start, __ pc());
+
     return start;
   }
 
@@ -6929,11 +7482,16 @@ class StubGenerator: public StubCodeGenerator {
   // twoGamma2  (int) = c_rarg3
   // multiplier (int) = c_rarg4
   address generate_dilithiumDecomposePoly() {
-
-    __ align(CodeEntryAlignment);
     StubId stub_id = StubId::stubgen_dilithiumDecomposePoly_id;
+    int entry_count = StubInfo::entry_count(stub_id);
+    assert(entry_count == 1, "sanity check");
+    address start = load_archive_data(stub_id);
+    if (start != nullptr) {
+      return start;
+    }
+    __ align(CodeEntryAlignment);
     StubCodeMark mark(this, stub_id);
-    address start = __ pc();
+    start = __ pc();
     Label L_loop;
 
     const Register input = c_rarg0;
@@ -7073,6 +7631,9 @@ class StubGenerator: public StubCodeGenerator {
     __ mov(r0, zr); // return 0
     __ ret(lr);
 
+    // record the stub entry and end
+    store_archive_data(stub_id, start, __ pc());
+
     return start;
   }
 
@@ -7212,21 +7773,15 @@ class StubGenerator: public StubCodeGenerator {
     default:
       ShouldNotReachHere();
     }
-
-    static const uint64_t round_consts[24] = {
-      0x0000000000000001L, 0x0000000000008082L, 0x800000000000808AL,
-      0x8000000080008000L, 0x000000000000808BL, 0x0000000080000001L,
-      0x8000000080008081L, 0x8000000000008009L, 0x000000000000008AL,
-      0x0000000000000088L, 0x0000000080008009L, 0x000000008000000AL,
-      0x000000008000808BL, 0x800000000000008BL, 0x8000000000008089L,
-      0x8000000000008003L, 0x8000000000008002L, 0x8000000000000080L,
-      0x000000000000800AL, 0x800000008000000AL, 0x8000000080008081L,
-      0x8000000000008080L, 0x0000000080000001L, 0x8000000080008008L
-    };
-
+    int entry_count = StubInfo::entry_count(stub_id);
+    assert(entry_count == 1, "sanity check");
+    address start = load_archive_data(stub_id);
+    if (start != nullptr) {
+      return start;
+    }
     __ align(CodeEntryAlignment);
     StubCodeMark mark(this, stub_id);
-    address start = __ pc();
+    start = __ pc();
 
     Register buf           = c_rarg0;
     Register state         = c_rarg1;
@@ -7378,7 +7933,7 @@ class StubGenerator: public StubCodeGenerator {
     __ fmovs(v1, 1.0);  // exact representation
 
     __ str(buf, Address(sp, 16));
-    __ lea(tmp3, ExternalAddress((address) round_consts));
+    __ lea(tmp3, ExternalAddress((address) _sha3_round_consts));
 
     __ BIND(loop_body);
     keccak_round_gpr(can_use_fp, can_use_r18, tmp3,
@@ -7433,6 +7988,9 @@ class StubGenerator: public StubCodeGenerator {
 
     __ ret(lr);
 
+    // record the stub entry and end
+    store_archive_data(stub_id, start, __ pc());
+
     return start;
   }
 
@@ -7449,12 +8007,17 @@ class StubGenerator: public StubCodeGenerator {
    */
   address generate_updateBytesCRC32() {
     assert(UseCRC32Intrinsics, "what are we doing here?");
-
-    __ align(CodeEntryAlignment);
     StubId stub_id = StubId::stubgen_updateBytesCRC32_id;
+    int entry_count = StubInfo::entry_count(stub_id);
+    assert(entry_count == 1, "sanity check");
+    address start = load_archive_data(stub_id);
+    if (start != nullptr) {
+      return start;
+    }
+    __ align(CodeEntryAlignment);
     StubCodeMark mark(this, stub_id);
 
-    address start = __ pc();
+    start = __ pc();
 
     const Register crc   = c_rarg0;  // crc
     const Register buf   = c_rarg1;  // source java byte array address
@@ -7474,6 +8037,9 @@ class StubGenerator: public StubCodeGenerator {
     __ leave(); // required for proper stackwalking of RuntimeStub frame
     __ ret(lr);
 
+    // record the stub entry and end
+    store_archive_data(stub_id, start, __ pc());
+
     return start;
   }
 
@@ -7491,12 +8057,17 @@ class StubGenerator: public StubCodeGenerator {
    */
   address generate_updateBytesCRC32C() {
     assert(UseCRC32CIntrinsics, "what are we doing here?");
-
-    __ align(CodeEntryAlignment);
     StubId stub_id = StubId::stubgen_updateBytesCRC32C_id;
+    int entry_count = StubInfo::entry_count(stub_id);
+    assert(entry_count == 1, "sanity check");
+    address start = load_archive_data(stub_id);
+    if (start != nullptr) {
+      return start;
+    }
+    __ align(CodeEntryAlignment);
     StubCodeMark mark(this, stub_id);
 
-    address start = __ pc();
+    start = __ pc();
 
     const Register crc   = c_rarg0;  // crc
     const Register buf   = c_rarg1;  // source java byte array address
@@ -7516,6 +8087,9 @@ class StubGenerator: public StubCodeGenerator {
     __ leave(); // required for proper stackwalking of RuntimeStub frame
     __ ret(lr);
 
+    // record the stub entry and end
+    store_archive_data(stub_id, start, __ pc());
+
     return start;
   }
 
@@ -7531,10 +8105,16 @@ class StubGenerator: public StubCodeGenerator {
    *   c_rarg0   - int adler result
    */
   address generate_updateBytesAdler32() {
-    __ align(CodeEntryAlignment);
     StubId stub_id = StubId::stubgen_updateBytesAdler32_id;
+    int entry_count = StubInfo::entry_count(stub_id);
+    assert(entry_count == 1, "sanity check");
+    address start = load_archive_data(stub_id);
+    if (start != nullptr) {
+      return start;
+    }
+    __ align(CodeEntryAlignment);
     StubCodeMark mark(this, stub_id);
-    address start = __ pc();
+    start = __ pc();
 
     Label L_simple_by1_loop, L_nmax, L_nmax_loop, L_by16, L_by16_loop, L_by1_loop, L_do_mod, L_combine, L_by1;
 
@@ -7702,6 +8282,9 @@ class StubGenerator: public StubCodeGenerator {
 
     __ ret(lr);
 
+    // record the stub entry and end
+    store_archive_data(stub_id, start, __ pc());
+
     return start;
   }
 
@@ -7753,11 +8336,17 @@ class StubGenerator: public StubCodeGenerator {
    *    c_rarg4   - z address
    */
   address generate_multiplyToLen() {
-    __ align(CodeEntryAlignment);
     StubId stub_id = StubId::stubgen_multiplyToLen_id;
+    int entry_count = StubInfo::entry_count(stub_id);
+    assert(entry_count == 1, "sanity check");
+    address start = load_archive_data(stub_id);
+    if (start != nullptr) {
+      return start;
+    }
+    __ align(CodeEntryAlignment);
     StubCodeMark mark(this, stub_id);
 
-    address start = __ pc();
+    start = __ pc();
     const Register x     = r0;
     const Register xlen  = r1;
     const Register y     = r2;
@@ -7779,6 +8368,9 @@ class StubGenerator: public StubCodeGenerator {
     __ leave(); // required for proper stackwalking of RuntimeStub frame
     __ ret(lr);
 
+    // record the stub entry and end
+    store_archive_data(stub_id, start, __ pc());
+
     return start;
   }
 
@@ -7786,10 +8378,16 @@ class StubGenerator: public StubCodeGenerator {
     // squareToLen algorithm for sizes 1..127 described in java code works
     // faster than multiply_to_len on some CPUs and slower on others, but
     // multiply_to_len shows a bit better overall results
-    __ align(CodeEntryAlignment);
     StubId stub_id = StubId::stubgen_squareToLen_id;
+    int entry_count = StubInfo::entry_count(stub_id);
+    assert(entry_count == 1, "sanity check");
+    address start = load_archive_data(stub_id);
+    if (start != nullptr) {
+      return start;
+    }
+    __ align(CodeEntryAlignment);
     StubCodeMark mark(this, stub_id);
-    address start = __ pc();
+    start = __ pc();
 
     const Register x     = r0;
     const Register xlen  = r1;
@@ -7816,15 +8414,25 @@ class StubGenerator: public StubCodeGenerator {
     __ pop(spilled_regs, sp);
     __ leave();
     __ ret(lr);
+
+    // record the stub entry and end
+    store_archive_data(stub_id, start, __ pc());
+
     return start;
   }
 
   address generate_mulAdd() {
-    __ align(CodeEntryAlignment);
     StubId stub_id = StubId::stubgen_mulAdd_id;
+    int entry_count = StubInfo::entry_count(stub_id);
+    assert(entry_count == 1, "sanity check");
+    address start = load_archive_data(stub_id);
+    if (start != nullptr) {
+      return start;
+    }
+    __ align(CodeEntryAlignment);
     StubCodeMark mark(this, stub_id);
 
-    address start = __ pc();
+    start = __ pc();
 
     const Register out     = r0;
     const Register in      = r1;
@@ -7838,6 +8446,9 @@ class StubGenerator: public StubCodeGenerator {
     __ leave();
     __ ret(lr);
 
+    // record the stub entry and end
+    store_archive_data(stub_id, start, __ pc());
+
     return start;
   }
 
@@ -7851,10 +8462,16 @@ class StubGenerator: public StubCodeGenerator {
   //   c_rarg4   - numIter
   //
   address generate_bigIntegerRightShift() {
-    __ align(CodeEntryAlignment);
     StubId stub_id = StubId::stubgen_bigIntegerRightShiftWorker_id;
+    int entry_count = StubInfo::entry_count(stub_id);
+    assert(entry_count == 1, "sanity check");
+    address start = load_archive_data(stub_id);
+    if (start != nullptr) {
+      return start;
+    }
+    __ align(CodeEntryAlignment);
     StubCodeMark mark(this, stub_id);
-    address start = __ pc();
+    start = __ pc();
 
     Label ShiftSIMDLoop, ShiftTwoLoop, ShiftThree, ShiftTwo, ShiftOne, Exit;
 
@@ -7961,6 +8578,9 @@ class StubGenerator: public StubCodeGenerator {
     __ BIND(Exit);
     __ ret(lr);
 
+    // record the stub entry and end
+    store_archive_data(stub_id, start, __ pc());
+
     return start;
   }
 
@@ -7974,10 +8594,16 @@ class StubGenerator: public StubCodeGenerator {
   //   c_rarg4   - numIter
   //
   address generate_bigIntegerLeftShift() {
-    __ align(CodeEntryAlignment);
     StubId stub_id = StubId::stubgen_bigIntegerLeftShiftWorker_id;
+    int entry_count = StubInfo::entry_count(stub_id);
+    assert(entry_count == 1, "sanity check");
+    address start = load_archive_data(stub_id);
+    if (start != nullptr) {
+      return start;
+    }
+    __ align(CodeEntryAlignment);
     StubCodeMark mark(this, stub_id);
-    address start = __ pc();
+    start = __ pc();
 
     Label ShiftSIMDLoop, ShiftTwoLoop, ShiftThree, ShiftTwo, ShiftOne, Exit;
 
@@ -8072,10 +8698,25 @@ class StubGenerator: public StubCodeGenerator {
     __ BIND(Exit);
     __ ret(lr);
 
+    // record the stub entry and end
+    store_archive_data(stub_id, start, __ pc());
+
     return start;
   }
 
   address generate_count_positives(address &count_positives_long) {
+    StubId stub_id = StubId::stubgen_count_positives_id;
+    GrowableArray<address> entries;
+    int entry_count = StubInfo::entry_count(stub_id);
+    // We have an extra entry for count_positives_long.
+    assert(entry_count == 2, "sanity check");
+    address start = load_archive_data(stub_id, &entries);
+    if (start != nullptr) {
+      assert(entries.length() == 1,
+             "unexpected extra entry count %d", entries.length());
+      count_positives_long = entries.at(0);
+      return start;
+    }
     const u1 large_loop_size = 64;
     const uint64_t UPPER_BIT_MASK=0x8080808080808080;
     int dcache_line = VM_Version::dcache_line_size();
@@ -8083,8 +8724,6 @@ class StubGenerator: public StubCodeGenerator {
     Register ary1 = r1, len = r2, result = r0;
 
     __ align(CodeEntryAlignment);
-
-    StubId stub_id = StubId::stubgen_count_positives_id;
     StubCodeMark mark(this, stub_id);
 
     address entry = __ pc();
@@ -8127,6 +8766,7 @@ class StubGenerator: public StubCodeGenerator {
   const RegSet spilled_regs = RegSet::range(tmp1, tmp5) + tmp6;
 
   count_positives_long = __ pc(); // 2nd entry point
+  entries.append(count_positives_long);
 
   __ enter();
 
@@ -8241,6 +8881,9 @@ class StubGenerator: public StubCodeGenerator {
     __ sub(result, result, len);
     __ ret(lr);
 
+    // record the stub entry and end plus the extra entry
+    store_archive_data(stub_id, entry, __ pc(), &entries);
+
     return entry;
   }
 
@@ -8331,6 +8974,13 @@ class StubGenerator: public StubCodeGenerator {
   // r3-r5 are reserved temporary registers
   // Clobbers: v0-v7 when UseSIMDForArrayEquals, rscratch1, rscratch2
   address generate_large_array_equals() {
+    StubId stub_id = StubId::stubgen_large_array_equals_id;
+    int entry_count = StubInfo::entry_count(stub_id);
+    assert(entry_count == 1, "sanity check");
+    address start = load_archive_data(stub_id);
+    if (start != nullptr) {
+      return start;
+    }
     Register a1 = r1, a2 = r2, result = r0, cnt1 = r10, tmp1 = rscratch1,
         tmp2 = rscratch2, tmp3 = r3, tmp4 = r4, tmp5 = r5, tmp6 = r11,
         tmp7 = r12, tmp8 = r13;
@@ -8346,7 +8996,6 @@ class StubGenerator: public StubCodeGenerator {
 
     __ align(CodeEntryAlignment);
 
-    StubId stub_id = StubId::stubgen_large_array_equals_id;
     StubCodeMark mark(this, stub_id);
 
     address entry = __ pc();
@@ -8421,6 +9070,10 @@ class StubGenerator: public StubCodeGenerator {
     __ bind(NOT_EQUAL_NO_POP);
     __ leave();
     __ ret(lr);
+
+    // record the stub entry and end
+    store_archive_data(stub_id, entry, __ pc());
+
     return entry;
   }
 
@@ -8429,6 +9082,33 @@ class StubGenerator: public StubCodeGenerator {
   // cnt = r2 - elements count
   // Clobbers: v0-v13, rscratch1, rscratch2
   address generate_large_arrays_hashcode(BasicType eltype) {
+    StubId stub_id;
+    switch (eltype) {
+    case T_BOOLEAN:
+      stub_id = StubId::stubgen_large_arrays_hashcode_boolean_id;
+      break;
+    case T_BYTE:
+      stub_id = StubId::stubgen_large_arrays_hashcode_byte_id;
+      break;
+    case T_CHAR:
+      stub_id = StubId::stubgen_large_arrays_hashcode_char_id;
+      break;
+    case T_SHORT:
+      stub_id = StubId::stubgen_large_arrays_hashcode_short_id;
+      break;
+    case T_INT:
+      stub_id = StubId::stubgen_large_arrays_hashcode_int_id;
+      break;
+    default:
+      stub_id = StubId::NO_STUBID;
+      ShouldNotReachHere();
+    };
+    int entry_count = StubInfo::entry_count(stub_id);
+    assert(entry_count == 1, "sanity check");
+    address start = load_archive_data(stub_id);
+    if (start != nullptr) {
+      return start;
+    }
     const Register result = r0, ary = r1, cnt = r2;
     const FloatRegister vdata0 = v3, vdata1 = v2, vdata2 = v1, vdata3 = v0;
     const FloatRegister vmul0 = v4, vmul1 = v5, vmul2 = v6, vmul3 = v7;
@@ -8472,28 +9152,6 @@ class StubGenerator: public StubCodeGenerator {
 
     __ align(CodeEntryAlignment);
 
-    StubId stub_id;
-    switch (eltype) {
-    case T_BOOLEAN:
-      stub_id = StubId::stubgen_large_arrays_hashcode_boolean_id;
-      break;
-    case T_BYTE:
-      stub_id = StubId::stubgen_large_arrays_hashcode_byte_id;
-      break;
-    case T_CHAR:
-      stub_id = StubId::stubgen_large_arrays_hashcode_char_id;
-      break;
-    case T_SHORT:
-      stub_id = StubId::stubgen_large_arrays_hashcode_short_id;
-      break;
-    case T_INT:
-      stub_id = StubId::stubgen_large_arrays_hashcode_int_id;
-      break;
-    default:
-      stub_id = StubId::NO_STUBID;
-      ShouldNotReachHere();
-    };
-
     StubCodeMark mark(this, stub_id);
 
     address entry = __ pc();
@@ -8728,19 +9386,32 @@ class StubGenerator: public StubCodeGenerator {
     __ leave();
     __ ret(lr);
 
+    // record the stub entry and end
+    store_archive_data(stub_id, entry, __ pc());
+
     return entry;
   }
 
   address generate_dsin_dcos(bool isCos) {
-    __ align(CodeEntryAlignment);
     StubId stub_id = (isCos ? StubId::stubgen_dcos_id : StubId::stubgen_dsin_id);
+    int entry_count = StubInfo::entry_count(stub_id);
+    assert(entry_count == 1, "sanity check");
+    address start = load_archive_data(stub_id);
+    if (start != nullptr) {
+      return start;
+    }
+    __ align(CodeEntryAlignment);
     StubCodeMark mark(this, stub_id);
-    address start = __ pc();
+    start = __ pc();
     __ generate_dsin_dcos(isCos, (address)StubRoutines::aarch64::_npio2_hw,
         (address)StubRoutines::aarch64::_two_over_pi,
         (address)StubRoutines::aarch64::_pio2,
         (address)StubRoutines::aarch64::_dsin_coef,
         (address)StubRoutines::aarch64::_dcos_coef);
+
+    // record the stub entry and end
+    store_archive_data(stub_id, start, __ pc());
+
     return start;
   }
 
@@ -8784,8 +9455,14 @@ class StubGenerator: public StubCodeGenerator {
   // r10 = tmp1
   // r11 = tmp2
   address generate_compare_long_string_different_encoding(bool isLU) {
-    __ align(CodeEntryAlignment);
     StubId stub_id = (isLU ? StubId::stubgen_compare_long_string_LU_id : StubId::stubgen_compare_long_string_UL_id);
+    int entry_count = StubInfo::entry_count(stub_id);
+    assert(entry_count == 1, "sanity check");
+    address start = load_archive_data(stub_id);
+    if (start != nullptr) {
+      return start;
+    }
+    __ align(CodeEntryAlignment);
     StubCodeMark mark(this, stub_id);
     address entry = __ pc();
     Label SMALL_LOOP, TAIL, TAIL_LOAD_16, LOAD_LAST, DIFF1, DIFF2,
@@ -8887,20 +9564,34 @@ class StubGenerator: public StubCodeGenerator {
       __ subw(result, tmp1, rscratch1);
     __ bind(DONE);
       __ ret(lr);
-    return entry;
+
+      // record the stub entry and end
+      store_archive_data(stub_id, entry, __ pc());
+
+      return entry;
   }
 
   // r0 = input (float16)
   // v0 = result (float)
   // v1 = temporary float register
   address generate_float16ToFloat() {
-    __ align(CodeEntryAlignment);
     StubId stub_id = StubId::stubgen_hf2f_id;
+    int entry_count = StubInfo::entry_count(stub_id);
+    assert(entry_count == 1, "sanity check");
+    address start = load_archive_data(stub_id);
+    if (start != nullptr) {
+      return start;
+    }
+    __ align(CodeEntryAlignment);
     StubCodeMark mark(this, stub_id);
     address entry = __ pc();
     BLOCK_COMMENT("Entry:");
     __ flt16_to_flt(v0, r0, v1);
     __ ret(lr);
+
+    // record the stub entry and end
+    store_archive_data(stub_id, entry, __ pc());
+
     return entry;
   }
 
@@ -8908,24 +9599,40 @@ class StubGenerator: public StubCodeGenerator {
   // r0 = result (float16)
   // v1 = temporary float register
   address generate_floatToFloat16() {
-    __ align(CodeEntryAlignment);
     StubId stub_id = StubId::stubgen_f2hf_id;
+    int entry_count = StubInfo::entry_count(stub_id);
+    assert(entry_count == 1, "sanity check");
+    address start = load_archive_data(stub_id);
+    if (start != nullptr) {
+      return start;
+    }
+    __ align(CodeEntryAlignment);
     StubCodeMark mark(this, stub_id);
     address entry = __ pc();
     BLOCK_COMMENT("Entry:");
     __ flt_to_flt16(r0, v0, v1);
     __ ret(lr);
+
+    // record the stub entry and end
+    store_archive_data(stub_id, entry, __ pc());
+
     return entry;
   }
 
   address generate_method_entry_barrier() {
-    __ align(CodeEntryAlignment);
     StubId stub_id = StubId::stubgen_method_entry_barrier_id;
+    int entry_count = StubInfo::entry_count(stub_id);
+    assert(entry_count == 1, "sanity check");
+    address start = load_archive_data(stub_id);
+    if (start != nullptr) {
+      return start;
+    }
+    __ align(CodeEntryAlignment);
     StubCodeMark mark(this, stub_id);
 
     Label deoptimize_label;
 
-    address start = __ pc();
+    start = __ pc();
 
     BarrierSetAssembler* bs_asm = BarrierSet::barrier_set()->barrier_set_assembler();
 
@@ -8974,6 +9681,9 @@ class StubGenerator: public StubCodeGenerator {
     __ mov(sp, rscratch1);
     __ br(rscratch2);
 
+    // record the stub entry and end
+    store_archive_data(stub_id, start, __ pc());
+
     return start;
   }
 
@@ -8985,8 +9695,14 @@ class StubGenerator: public StubCodeGenerator {
   // r10 = tmp1
   // r11 = tmp2
   address generate_compare_long_string_same_encoding(bool isLL) {
-    __ align(CodeEntryAlignment);
     StubId stub_id = (isLL ? StubId::stubgen_compare_long_string_LL_id : StubId::stubgen_compare_long_string_UU_id);
+    int entry_count = StubInfo::entry_count(stub_id);
+    assert(entry_count == 1, "sanity check");
+    address start = load_archive_data(stub_id);
+    if (start != nullptr) {
+      return start;
+    }
+    __ align(CodeEntryAlignment);
     StubCodeMark mark(this, stub_id);
     address entry = __ pc();
     Register result = r0, str1 = r1, cnt1 = r2, str2 = r3, cnt2 = r4,
@@ -9094,6 +9810,10 @@ class StubGenerator: public StubCodeGenerator {
 
     __ bind(LENGTH_DIFF);
       __ ret(lr);
+
+    // record the stub entry and end
+    store_archive_data(stub_id, entry, __ pc());
+
     return entry;
   }
 
@@ -9125,8 +9845,14 @@ class StubGenerator: public StubCodeGenerator {
       case UU: stub_id = StubId::stubgen_compare_long_string_UU_id; break;
       default: ShouldNotReachHere();
     }
-
+    int entry_count = StubInfo::entry_count(stub_id);
+    assert(entry_count == 1, "sanity check");
+    address start = load_archive_data(stub_id);
+    if (start != nullptr) {
+      return start;
+    }
     __ align(CodeEntryAlignment);
+    StubCodeMark mark(this, stub_id);
     address entry = __ pc();
     Register result = r0, str1 = r1, cnt1 = r2, str2 = r3, cnt2 = r4,
              tmp1 = r10, tmp2 = r11;
@@ -9161,8 +9887,6 @@ class StubGenerator: public StubCodeGenerator {
         ShouldNotReachHere();                                                  \
     }
 
-    StubCodeMark mark(this, stub_id);
-
     __ mov(idx, 0);
     __ sve_whilelt(pgtmp1, mode == LL ? __ B : __ H, idx, cnt);
 
@@ -9206,6 +9930,10 @@ class StubGenerator: public StubCodeGenerator {
     __ bind(DONE);
     __ ret(lr);
 #undef LOAD_PAIR
+
+    // record the stub entry and end
+    store_archive_data(stub_id, entry, __ pc());
+
     return entry;
   }
 
@@ -9267,6 +9995,12 @@ class StubGenerator: public StubCodeGenerator {
         stub_id = StubId::stubgen_string_indexof_linear_uu_id;
       }
     }
+    int entry_count = StubInfo::entry_count(stub_id);
+    assert(entry_count == 1, "sanity check");
+    address start = load_archive_data(stub_id);
+    if (start != nullptr) {
+      return start;
+    }
     __ align(CodeEntryAlignment);
     StubCodeMark mark(this, stub_id);
     address entry = __ pc();
@@ -9535,6 +10269,10 @@ class StubGenerator: public StubCodeGenerator {
     __ BIND(DONE);
       __ pop(spilled_regs, sp);
       __ ret(lr);
+
+    // record the stub entry and end
+    store_archive_data(stub_id, entry, __ pc());
+
     return entry;
   }
 
@@ -9565,8 +10303,14 @@ class StubGenerator: public StubCodeGenerator {
   // v1 = loaded 8 bytes
   // Clobbers: r0, r1, r3, rscratch1, rflags, v0-v6
   address generate_large_byte_array_inflate() {
-    __ align(CodeEntryAlignment);
     StubId stub_id = StubId::stubgen_large_byte_array_inflate_id;
+    int entry_count = StubInfo::entry_count(stub_id);
+    assert(entry_count == 1, "sanity check");
+    address start = load_archive_data(stub_id);
+    if (start != nullptr) {
+      return start;
+    }
+    __ align(CodeEntryAlignment);
     StubCodeMark mark(this, stub_id);
     address entry = __ pc();
     Label LOOP, LOOP_START, LOOP_PRFM, LOOP_PRFM_START, DONE;
@@ -9605,6 +10349,10 @@ class StubGenerator: public StubCodeGenerator {
       __ br(__ GE, LOOP);
     __ bind(DONE);
       __ ret(lr);
+
+    // record the stub entry and end
+    store_archive_data(stub_id, entry, __ pc());
+
     return entry;
   }
 
@@ -9620,7 +10368,7 @@ class StubGenerator: public StubCodeGenerator {
    *  Output:
    *  Updated state at c_rarg0
    */
-  address generate_ghash_processBlocks() {
+  address generate_ghash_processBlocks_small() {
     // Bafflingly, GCM uses little-endian for the byte order, but
     // big-endian for the bit order.  For example, the polynomial 1 is
     // represented as the 16-byte string 80 00 00 00 | 12 bytes of 00.
@@ -9632,11 +10380,17 @@ class StubGenerator: public StubCodeGenerator {
     // that) and keep the data in little-endian bit order through the
     // calculation, bit-reversing the inputs and outputs.
 
-    StubId stub_id = StubId::stubgen_ghash_processBlocks_id;
+    StubId stub_id = StubId::stubgen_ghash_processBlocks_small_id;
+    int entry_count = StubInfo::entry_count(stub_id);
+    assert(entry_count == 1, "sanity check");
+    address start = load_archive_data(stub_id);
+    if (start != nullptr) {
+      return start;
+    }
+    __ align(CodeEntryAlignment);
     StubCodeMark mark(this, stub_id);
     Label polynomial; // local data generated at end of stub
-    __ align(CodeEntryAlignment);
-    address start = __ pc();
+    start = __ pc();
 
     Register state   = c_rarg0;
     Register subkeyH = c_rarg1;
@@ -9696,17 +10450,24 @@ class StubGenerator: public StubCodeGenerator {
                           // 128-bit vector
     __ emit_int64(0x87);
 
+    // record the stub entry and end
+    store_archive_data(stub_id, start, __ pc());
+
     return start;
   }
 
-  address generate_ghash_processBlocks_wide() {
-    address small = generate_ghash_processBlocks();
-
-    StubId stub_id = StubId::stubgen_ghash_processBlocks_wide_id;
-    StubCodeMark mark(this, stub_id);
+  address generate_ghash_processBlocks(address small) {
+    StubId stub_id = StubId::stubgen_ghash_processBlocks_id;
+    int entry_count = StubInfo::entry_count(stub_id);
+    assert(entry_count == 1, "sanity check");
+    address start = load_archive_data(stub_id);
+    if (start != nullptr) {
+      return start;
+    }
     Label polynomial;           // local data generated after stub
     __ align(CodeEntryAlignment);
-    address start = __ pc();
+    StubCodeMark mark(this, stub_id);
+    start = __ pc();
 
     Register state   = c_rarg0;
     Register subkeyH = c_rarg1;
@@ -9748,8 +10509,10 @@ class StubGenerator: public StubCodeGenerator {
                           // 128-bit vector
     __ emit_int64(0x87);
 
-    return start;
+    // record the stub entry and end
+    store_archive_data(stub_id, start, __ pc());
 
+    return start;
   }
 
   void generate_base64_encode_simdround(Register src, Register dst,
@@ -9800,26 +10563,16 @@ class StubGenerator: public StubCodeGenerator {
    */
   address generate_base64_encodeBlock() {
 
-    static const char toBase64[64] = {
-      'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M',
-      'N', 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z',
-      'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm',
-      'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z',
-      '0', '1', '2', '3', '4', '5', '6', '7', '8', '9', '+', '/'
-    };
-
-    static const char toBase64URL[64] = {
-      'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M',
-      'N', 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z',
-      'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm',
-      'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z',
-      '0', '1', '2', '3', '4', '5', '6', '7', '8', '9', '-', '_'
-    };
-
-    __ align(CodeEntryAlignment);
     StubId stub_id = StubId::stubgen_base64_encodeBlock_id;
+    int entry_count = StubInfo::entry_count(stub_id);
+    assert(entry_count == 1, "sanity check");
+    address start = load_archive_data(stub_id);
+    if (start != nullptr) {
+      return start;
+    }
+    __ align(CodeEntryAlignment);
     StubCodeMark mark(this, stub_id);
-    address start = __ pc();
+    start = __ pc();
 
     Register src   = c_rarg0;  // source array
     Register soff  = c_rarg1;  // source start offset
@@ -9839,9 +10592,9 @@ class StubGenerator: public StubCodeGenerator {
     __ sub(length, send, soff);
 
     // load the codec base address
-    __ lea(codec, ExternalAddress((address) toBase64));
+    __ lea(codec, ExternalAddress((address) _encodeBlock_toBase64));
     __ cbz(isURL, ProcessData);
-    __ lea(codec, ExternalAddress((address) toBase64URL));
+    __ lea(codec, ExternalAddress((address) _encodeBlock_toBase64URL));
 
     __ BIND(ProcessData);
 
@@ -9894,6 +10647,9 @@ class StubGenerator: public StubCodeGenerator {
     __ BIND(Exit);
     __ ret(lr);
 
+    // record the stub entry and end
+    store_archive_data(stub_id, start, __ pc());
+
     return start;
   }
 
@@ -10015,80 +10771,16 @@ class StubGenerator: public StubCodeGenerator {
     // on http://0x80.pl/articles/base64-simd-neon.html#encoding-quadwords, in section
     // titled "Base64 decoding".
 
-    // Non-SIMD lookup tables are mostly dumped from fromBase64 array used in java.util.Base64,
-    // except the trailing character '=' is also treated illegal value in this intrinsic. That
-    // is java.util.Base64.fromBase64['='] = -2, while fromBase(URL)64ForNoSIMD['='] = 255 here.
-    static const uint8_t fromBase64ForNoSIMD[256] = {
-      255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u,
-      255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u,
-      255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u,  62u, 255u, 255u, 255u,  63u,
-       52u,  53u,  54u,  55u,  56u,  57u,  58u,  59u,  60u,  61u, 255u, 255u, 255u, 255u, 255u, 255u,
-      255u,   0u,   1u,   2u,   3u,   4u,   5u,   6u,   7u,   8u,   9u,  10u,  11u,  12u,  13u,  14u,
-       15u,  16u,  17u,  18u,  19u,  20u,  21u,  22u,  23u,  24u,  25u, 255u, 255u, 255u, 255u, 255u,
-      255u,  26u,  27u,  28u,  29u,  30u,  31u,  32u,  33u,  34u,  35u,  36u,  37u,  38u,  39u,  40u,
-       41u,  42u,  43u,  44u,  45u,  46u,  47u,  48u,  49u,  50u,  51u, 255u, 255u, 255u, 255u, 255u,
-      255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u,
-      255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u,
-      255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u,
-      255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u,
-      255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u,
-      255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u,
-      255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u,
-      255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u,
-    };
-
-    static const uint8_t fromBase64URLForNoSIMD[256] = {
-      255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u,
-      255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u,
-      255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u,  62u, 255u, 255u,
-       52u,  53u,  54u,  55u,  56u,  57u,  58u,  59u,  60u,  61u, 255u, 255u, 255u, 255u, 255u, 255u,
-      255u,   0u,   1u,   2u,   3u,   4u,   5u,   6u,   7u,   8u,   9u,  10u,  11u,  12u,  13u,  14u,
-       15u,  16u,  17u,  18u,  19u,  20u,  21u,  22u,  23u,  24u,  25u, 255u, 255u, 255u, 255u,  63u,
-      255u,  26u,  27u,  28u,  29u,  30u,  31u,  32u,  33u,  34u,  35u,  36u,  37u,  38u,  39u,  40u,
-       41u,  42u,  43u,  44u,  45u,  46u,  47u,  48u,  49u,  50u,  51u, 255u, 255u, 255u, 255u, 255u,
-      255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u,
-      255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u,
-      255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u,
-      255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u,
-      255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u,
-      255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u,
-      255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u,
-      255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u,
-    };
-
-    // A legal value of base64 code is in range [0, 127].  We need two lookups
-    // with tbl/tbx and combine them to get the decode data. The 1st table vector
-    // lookup use tbl, out of range indices are set to 0 in destination. The 2nd
-    // table vector lookup use tbx, out of range indices are unchanged in
-    // destination. Input [64..126] is mapped to index [65, 127] in second lookup.
-    // The value of index 64 is set to 0, so that we know that we already get the
-    // decoded data with the 1st lookup.
-    static const uint8_t fromBase64ForSIMD[128] = {
-      255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u,
-      255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u,
-      255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u,  62u, 255u, 255u, 255u,  63u,
-       52u,  53u,  54u,  55u,  56u,  57u,  58u,  59u,  60u,  61u, 255u, 255u, 255u, 255u, 255u, 255u,
-        0u, 255u,   0u,   1u,   2u,   3u,   4u,   5u,   6u,   7u,   8u,   9u,  10u,  11u,  12u,  13u,
-       14u,  15u,  16u,  17u,  18u,  19u,  20u,  21u,  22u,  23u,  24u,  25u, 255u, 255u, 255u, 255u,
-      255u, 255u,  26u,  27u,  28u,  29u,  30u,  31u,  32u,  33u,  34u,  35u,  36u,  37u,  38u,  39u,
-       40u,  41u,  42u,  43u,  44u,  45u,  46u,  47u,  48u,  49u,  50u,  51u, 255u, 255u, 255u, 255u,
-    };
-
-    static const uint8_t fromBase64URLForSIMD[128] = {
-      255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u,
-      255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u,
-      255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u, 255u,  62u, 255u, 255u,
-       52u,  53u,  54u,  55u,  56u,  57u,  58u,  59u,  60u,  61u, 255u, 255u, 255u, 255u, 255u, 255u,
-        0u, 255u,   0u,   1u,   2u,   3u,   4u,   5u,   6u,   7u,   8u,   9u,  10u,  11u,  12u,  13u,
-       14u,  15u,  16u,  17u,  18u,  19u,  20u,  21u,  22u,  23u,  24u,  25u, 255u, 255u, 255u, 255u,
-       63u, 255u,  26u,  27u,  28u,  29u,  30u,  31u,  32u,  33u,  34u,  35u,  36u,  37u,  38u,  39u,
-       40u,  41u,  42u,  43u,  44u,  45u,  46u,  47u,  48u,  49u,  50u,  51u, 255u, 255u, 255u, 255u,
-    };
-
-    __ align(CodeEntryAlignment);
     StubId stub_id = StubId::stubgen_base64_decodeBlock_id;
+    int entry_count = StubInfo::entry_count(stub_id);
+    assert(entry_count == 1, "sanity check");
+    address start = load_archive_data(stub_id);
+    if (start != nullptr) {
+      return start;
+    }
+    __ align(CodeEntryAlignment);
     StubCodeMark mark(this, stub_id);
-    address start = __ pc();
+    start = __ pc();
 
     Register src    = c_rarg0;  // source array
     Register soff   = c_rarg1;  // source start offset
@@ -10115,9 +10807,9 @@ class StubGenerator: public StubCodeGenerator {
     __ sub(length, send, soff);
     __ bfm(length, zr, 0, 1);
 
-    __ lea(nosimd_codec, ExternalAddress((address) fromBase64ForNoSIMD));
+    __ lea(nosimd_codec, ExternalAddress((address) _decodeBlock_fromBase64ForNoSIMD));
     __ cbz(isURL, ProcessData);
-    __ lea(nosimd_codec, ExternalAddress((address) fromBase64URLForNoSIMD));
+    __ lea(nosimd_codec, ExternalAddress((address) _decodeBlock_fromBase64URLForNoSIMD));
 
     __ BIND(ProcessData);
     __ mov(rscratch1, length);
@@ -10162,9 +10854,9 @@ class StubGenerator: public StubCodeGenerator {
     __ cbzw(rscratch1, Exit);
     __ sub(length, length, 80);
 
-    __ lea(simd_codec, ExternalAddress((address) fromBase64ForSIMD));
+    __ lea(simd_codec, ExternalAddress((address) _decodeBlock_fromBase64ForSIMD));
     __ cbz(isURL, SIMDEnter);
-    __ lea(simd_codec, ExternalAddress((address) fromBase64URLForSIMD));
+    __ lea(simd_codec, ExternalAddress((address) _decodeBlock_fromBase64URLForSIMD));
 
     __ BIND(SIMDEnter);
     __ ld1(v0, v1, v2, v3, __ T16B, __ post(simd_codec, 64));
@@ -10197,24 +10889,50 @@ class StubGenerator: public StubCodeGenerator {
     __ leave();
     __ ret(lr);
 
+    // record the stub entry and end
+    store_archive_data(stub_id, start, __ pc());
+
     return start;
   }
 
   // Support for spin waits.
   address generate_spin_wait() {
-    __ align(CodeEntryAlignment);
     StubId stub_id = StubId::stubgen_spin_wait_id;
+    int entry_count = StubInfo::entry_count(stub_id);
+    assert(entry_count == 1, "sanity check");
+    address start = load_archive_data(stub_id);
+    if (start != nullptr) {
+      return start;
+    }
+    __ align(CodeEntryAlignment);
     StubCodeMark mark(this, stub_id);
-    address start = __ pc();
+    start = __ pc();
 
     __ spin_wait();
     __ ret(lr);
 
+    // record the stub entry and end
+    store_archive_data(stub_id, start, __ pc());
+
     return start;
   }
 
   void generate_lookup_secondary_supers_table_stub() {
     StubId stub_id = StubId::stubgen_lookup_secondary_supers_table_id;
+    GrowableArray<address> entries;
+    int entry_count = StubInfo::entry_count(stub_id);
+    assert(entry_count == Klass::SECONDARY_SUPERS_TABLE_SIZE, "sanity check");
+    address start = load_archive_data(stub_id, &entries);
+    if (start != nullptr) {
+      assert(entries.length() == Klass::SECONDARY_SUPERS_TABLE_SIZE - 1,
+             "unexpected extra entry count %d", entries.length());
+      StubRoutines::_lookup_secondary_supers_table_stubs[0] = start;
+      for (int slot = 1; slot < Klass::SECONDARY_SUPERS_TABLE_SIZE; slot++) {
+        StubRoutines::_lookup_secondary_supers_table_stubs[slot] = entries.at(slot - 1);
+      }
+      return;
+    }
+
     StubCodeMark mark(this, stub_id);
 
     const Register
@@ -10229,7 +10947,13 @@ class StubGenerator: public StubCodeGenerator {
       vtemp          = v0;
 
     for (int slot = 0; slot < Klass::SECONDARY_SUPERS_TABLE_SIZE; slot++) {
-      StubRoutines::_lookup_secondary_supers_table_stubs[slot] = __ pc();
+      address next_entry = __ pc();
+      StubRoutines::_lookup_secondary_supers_table_stubs[slot] = next_entry;
+      if (slot == 0) {
+        start = next_entry;
+      } else {
+        entries.append(next_entry);
+      }
       Label L_success;
       __ enter();
       __ lookup_secondary_supers_table_const(r_sub_klass, r_super_klass,
@@ -10239,14 +10963,21 @@ class StubGenerator: public StubCodeGenerator {
       __ leave();
       __ ret(lr);
     }
+    // record the stub entry and end plus all the auxiliary entries
+    store_archive_data(stub_id, start, __ pc(), &entries);
   }
 
   // Slow path implementation for UseSecondarySupersTable.
   address generate_lookup_secondary_supers_table_slow_path_stub() {
     StubId stub_id = StubId::stubgen_lookup_secondary_supers_table_slow_path_id;
+    int entry_count = StubInfo::entry_count(stub_id);
+    assert(entry_count == 1, "sanity check");
+    address start = load_archive_data(stub_id);
+    if (start != nullptr) {
+      return start;
+    }
     StubCodeMark mark(this, stub_id);
-
-    address start = __ pc();
+    start = __ pc();
     const Register
       r_super_klass  = r0,        // argument
       r_array_base   = r1,        // argument
@@ -10258,6 +10989,9 @@ class StubGenerator: public StubCodeGenerator {
     __ lookup_secondary_supers_table_slow_path(r_super_klass, r_array_base, r_array_index, r_bitmap, temp1, result);
     __ ret(lr);
 
+    // record the stub entry and end
+    store_archive_data(stub_id, start, __ pc());
+
     return start;
   }
 
@@ -10397,14 +11131,43 @@ class StubGenerator: public StubCodeGenerator {
     if (! UseLSE) {
       return;
     }
-    __ align(CodeEntryAlignment);
     StubId stub_id = StubId::stubgen_atomic_entry_points_id;
-    StubCodeMark mark(this, stub_id);
-    address first_entry = __ pc();
+    GrowableArray<address> entries;
+    int entry_count = StubInfo::entry_count(stub_id);
+    address start = load_archive_data(stub_id, &entries);
+    if (start != nullptr) {
+      assert(entries.length() == entry_count - 1,
+             "unexpected extra entry count %d", entries.length());
+      aarch64_atomic_fetch_add_4_impl = (aarch64_atomic_stub_t)start;
+      int idx = 0;
+      aarch64_atomic_fetch_add_8_impl = (aarch64_atomic_stub_t)entries.at(idx++);
+      aarch64_atomic_fetch_add_4_relaxed_impl = (aarch64_atomic_stub_t)entries.at(idx++);
+      aarch64_atomic_fetch_add_8_relaxed_impl = (aarch64_atomic_stub_t)entries.at(idx++);
+      aarch64_atomic_xchg_4_impl = (aarch64_atomic_stub_t)entries.at(idx++);
+      aarch64_atomic_xchg_8_impl = (aarch64_atomic_stub_t)entries.at(idx++);
+      aarch64_atomic_cmpxchg_1_impl = (aarch64_atomic_stub_t)entries.at(idx++);
+      aarch64_atomic_cmpxchg_4_impl = (aarch64_atomic_stub_t)entries.at(idx++);
+      aarch64_atomic_cmpxchg_8_impl = (aarch64_atomic_stub_t)entries.at(idx++);
+      aarch64_atomic_cmpxchg_1_relaxed_impl = (aarch64_atomic_stub_t)entries.at(idx++);
+      aarch64_atomic_cmpxchg_4_relaxed_impl = (aarch64_atomic_stub_t)entries.at(idx++);
+      aarch64_atomic_cmpxchg_8_relaxed_impl = (aarch64_atomic_stub_t)entries.at(idx++);
+      aarch64_atomic_cmpxchg_4_release_impl = (aarch64_atomic_stub_t)entries.at(idx++);
+      aarch64_atomic_cmpxchg_8_release_impl = (aarch64_atomic_stub_t)entries.at(idx++);
+      aarch64_atomic_cmpxchg_4_seq_cst_impl = (aarch64_atomic_stub_t)entries.at(idx++);
+      aarch64_atomic_cmpxchg_8_seq_cst_impl = (aarch64_atomic_stub_t)entries.at(idx++);
+      assert(idx == entries.length(), "sanity!");
+      return;
+    }
 
+    __ align(CodeEntryAlignment);
+    StubCodeMark mark(this, stub_id);
+    start = __ pc();
+    address end;
+    {
     // ADD, memory_order_conservative
     AtomicStubMark mark_fetch_add_4(_masm, &aarch64_atomic_fetch_add_4_impl);
     gen_ldadd_entry(Assembler::word, memory_order_conservative);
+
     AtomicStubMark mark_fetch_add_8(_masm, &aarch64_atomic_fetch_add_8_impl);
     gen_ldadd_entry(Assembler::xword, memory_order_conservative);
 
@@ -10412,6 +11175,7 @@ class StubGenerator: public StubCodeGenerator {
     AtomicStubMark mark_fetch_add_4_relaxed
       (_masm, &aarch64_atomic_fetch_add_4_relaxed_impl);
     gen_ldadd_entry(MacroAssembler::word, memory_order_relaxed);
+
     AtomicStubMark mark_fetch_add_8_relaxed
       (_masm, &aarch64_atomic_fetch_add_8_relaxed_impl);
     gen_ldadd_entry(MacroAssembler::xword, memory_order_relaxed);
@@ -10419,14 +11183,17 @@ class StubGenerator: public StubCodeGenerator {
     // XCHG, memory_order_conservative
     AtomicStubMark mark_xchg_4(_masm, &aarch64_atomic_xchg_4_impl);
     gen_swpal_entry(Assembler::word);
-    AtomicStubMark mark_xchg_8_impl(_masm, &aarch64_atomic_xchg_8_impl);
+
+    AtomicStubMark mark_xchg_8(_masm, &aarch64_atomic_xchg_8_impl);
     gen_swpal_entry(Assembler::xword);
 
     // CAS, memory_order_conservative
     AtomicStubMark mark_cmpxchg_1(_masm, &aarch64_atomic_cmpxchg_1_impl);
     gen_cas_entry(MacroAssembler::byte, memory_order_conservative);
+
     AtomicStubMark mark_cmpxchg_4(_masm, &aarch64_atomic_cmpxchg_4_impl);
     gen_cas_entry(MacroAssembler::word, memory_order_conservative);
+
     AtomicStubMark mark_cmpxchg_8(_masm, &aarch64_atomic_cmpxchg_8_impl);
     gen_cas_entry(MacroAssembler::xword, memory_order_conservative);
 
@@ -10434,9 +11201,11 @@ class StubGenerator: public StubCodeGenerator {
     AtomicStubMark mark_cmpxchg_1_relaxed
       (_masm, &aarch64_atomic_cmpxchg_1_relaxed_impl);
     gen_cas_entry(MacroAssembler::byte, memory_order_relaxed);
+
     AtomicStubMark mark_cmpxchg_4_relaxed
       (_masm, &aarch64_atomic_cmpxchg_4_relaxed_impl);
     gen_cas_entry(MacroAssembler::word, memory_order_relaxed);
+
     AtomicStubMark mark_cmpxchg_8_relaxed
       (_masm, &aarch64_atomic_cmpxchg_8_relaxed_impl);
     gen_cas_entry(MacroAssembler::xword, memory_order_relaxed);
@@ -10444,6 +11213,7 @@ class StubGenerator: public StubCodeGenerator {
     AtomicStubMark mark_cmpxchg_4_release
       (_masm, &aarch64_atomic_cmpxchg_4_release_impl);
     gen_cas_entry(MacroAssembler::word, memory_order_release);
+
     AtomicStubMark mark_cmpxchg_8_release
       (_masm, &aarch64_atomic_cmpxchg_8_release_impl);
     gen_cas_entry(MacroAssembler::xword, memory_order_release);
@@ -10451,11 +11221,41 @@ class StubGenerator: public StubCodeGenerator {
     AtomicStubMark mark_cmpxchg_4_seq_cst
       (_masm, &aarch64_atomic_cmpxchg_4_seq_cst_impl);
     gen_cas_entry(MacroAssembler::word, memory_order_seq_cst);
+
     AtomicStubMark mark_cmpxchg_8_seq_cst
       (_masm, &aarch64_atomic_cmpxchg_8_seq_cst_impl);
     gen_cas_entry(MacroAssembler::xword, memory_order_seq_cst);
 
-    ICache::invalidate_range(first_entry, __ pc() - first_entry);
+    end = __ pc();
+
+    ICache::invalidate_range(start, end - start);
+    // exit block to force update of AtomicStubMark targets
+    }
+
+    assert(start == (address)aarch64_atomic_fetch_add_4_impl,
+           "atomic stub should be at start of buffer");
+    // record the stub start and end plus all the entries saved by the
+    // AtomicStubMark destructor
+    entries.append((address)aarch64_atomic_fetch_add_8_impl);
+    entries.append((address)aarch64_atomic_fetch_add_4_relaxed_impl);
+    entries.append((address)aarch64_atomic_fetch_add_8_relaxed_impl);
+    entries.append((address)aarch64_atomic_xchg_4_impl);
+    entries.append((address)aarch64_atomic_xchg_8_impl);
+    entries.append((address)aarch64_atomic_cmpxchg_1_impl);
+    entries.append((address)aarch64_atomic_cmpxchg_4_impl);
+    entries.append((address)aarch64_atomic_cmpxchg_8_impl);
+    entries.append((address)aarch64_atomic_cmpxchg_1_relaxed_impl);
+    entries.append((address)aarch64_atomic_cmpxchg_4_relaxed_impl);
+    entries.append((address)aarch64_atomic_cmpxchg_8_relaxed_impl);
+    entries.append((address)aarch64_atomic_cmpxchg_4_release_impl);
+    entries.append((address)aarch64_atomic_cmpxchg_8_release_impl);
+    entries.append((address)aarch64_atomic_cmpxchg_4_seq_cst_impl);
+    entries.append((address)aarch64_atomic_cmpxchg_8_seq_cst_impl);
+
+    assert(entries.length() == entry_count - 1,
+           "unexpected extra entry count %d", entries.length());
+
+    store_archive_data(stub_id, start, end, &entries);
   }
 #endif // LINUX
 
@@ -10559,9 +11359,19 @@ class StubGenerator: public StubCodeGenerator {
     if (!Continuations::enabled()) return nullptr;
 
     StubId stub_id = StubId::stubgen_cont_thaw_id;
+    int entry_count = StubInfo::entry_count(stub_id);
+    assert(entry_count == 1, "sanity check");
+    address start = load_archive_data(stub_id);
+    if (start != nullptr) {
+      return start;
+    }
     StubCodeMark mark(this, stub_id);
-    address start = __ pc();
+    start = __ pc();
     generate_cont_thaw(Continuation::thaw_top);
+
+    // record the stub start and end
+    store_archive_data(stub_id, start, __ pc());
+
     return start;
   }
 
@@ -10570,11 +11380,20 @@ class StubGenerator: public StubCodeGenerator {
 
     // TODO: will probably need multiple return barriers depending on return type
     StubId stub_id = StubId::stubgen_cont_returnBarrier_id;
+    int entry_count = StubInfo::entry_count(stub_id);
+    assert(entry_count == 1, "sanity check");
+    address start = load_archive_data(stub_id);
+    if (start != nullptr) {
+      return start;
+    }
     StubCodeMark mark(this, stub_id);
-    address start = __ pc();
+    start = __ pc();
 
     generate_cont_thaw(Continuation::thaw_return_barrier);
 
+    // record the stub start and end
+    store_archive_data(stub_id, start, __ pc());
+
     return start;
   }
 
@@ -10582,19 +11401,34 @@ class StubGenerator: public StubCodeGenerator {
     if (!Continuations::enabled()) return nullptr;
 
     StubId stub_id = StubId::stubgen_cont_returnBarrierExc_id;
+    int entry_count = StubInfo::entry_count(stub_id);
+    assert(entry_count == 1, "sanity check");
+    address start = load_archive_data(stub_id);
+    if (start != nullptr) {
+      return start;
+    }
     StubCodeMark mark(this, stub_id);
-    address start = __ pc();
+    start = __ pc();
 
     generate_cont_thaw(Continuation::thaw_return_barrier_exception);
 
+    // record the stub start and end
+    store_archive_data(stub_id, start, __ pc());
+
     return start;
   }
 
   address generate_cont_preempt_stub() {
     if (!Continuations::enabled()) return nullptr;
     StubId stub_id = StubId::stubgen_cont_preempt_id;
+    int entry_count = StubInfo::entry_count(stub_id);
+    assert(entry_count == 1, "sanity check");
+    address start = load_archive_data(stub_id);
+    if (start != nullptr) {
+      return start;
+    }
     StubCodeMark mark(this, stub_id);
-    address start = __ pc();
+    start = __ pc();
 
     __ reset_last_Java_frame(true);
 
@@ -10619,6 +11453,9 @@ class StubGenerator: public StubCodeGenerator {
     __ ldr(rscratch1, Address(rscratch1));
     __ br(rscratch1);
 
+    // record the stub start and end
+    store_archive_data(stub_id, start, __ pc());
+
     return start;
   }
 
@@ -10674,10 +11511,16 @@ class StubGenerator: public StubCodeGenerator {
   // computation.
 
   address generate_poly1305_processBlocks() {
-    __ align(CodeEntryAlignment);
     StubId stub_id = StubId::stubgen_poly1305_processBlocks_id;
+    int entry_count = StubInfo::entry_count(stub_id);
+    assert(entry_count == 1, "sanity check");
+    address start = load_archive_data(stub_id);
+    if (start != nullptr) {
+      return start;
+    }
+    __ align(CodeEntryAlignment);
     StubCodeMark mark(this, stub_id);
-    address start = __ pc();
+    start = __ pc();
     Label here;
     __ enter();
     RegSet callee_saved = RegSet::range(r19, r28);
@@ -10785,14 +11628,23 @@ class StubGenerator: public StubCodeGenerator {
     __ leave();
     __ ret(lr);
 
+    // record the stub start and end
+    store_archive_data(stub_id, start, __ pc());
+
     return start;
   }
 
   // exception handler for upcall stubs
   address generate_upcall_stub_exception_handler() {
     StubId stub_id = StubId::stubgen_upcall_stub_exception_handler_id;
+    int entry_count = StubInfo::entry_count(stub_id);
+    assert(entry_count == 1, "sanity check");
+    address start = load_archive_data(stub_id);
+    if (start != nullptr) {
+      return start;
+    }
     StubCodeMark mark(this, stub_id);
-    address start = __ pc();
+    start = __ pc();
 
     // Native caller has no idea how to handle exceptions,
     // so we just crash here. Up to callee to catch exceptions.
@@ -10801,6 +11653,9 @@ class StubGenerator: public StubCodeGenerator {
     __ blr(rscratch1);
     __ should_not_reach_here();
 
+    // record the stub start and end
+    store_archive_data(stub_id, start, __ pc());
+
     return start;
   }
 
@@ -10809,8 +11664,14 @@ class StubGenerator: public StubCodeGenerator {
   // rmethod = result
   address generate_upcall_stub_load_target() {
     StubId stub_id = StubId::stubgen_upcall_stub_load_target_id;
+    int entry_count = StubInfo::entry_count(stub_id);
+    assert(entry_count == 1, "sanity check");
+    address start = load_archive_data(stub_id);
+    if (start != nullptr) {
+      return start;
+    }
     StubCodeMark mark(this, stub_id);
-    address start = __ pc();
+    start = __ pc();
 
     __ resolve_global_jobject(j_rarg0, rscratch1, rscratch2);
       // Load target method from receiver
@@ -10824,6 +11685,9 @@ class StubGenerator: public StubCodeGenerator {
 
     __ ret(lr);
 
+    // record the stub start and end
+    store_archive_data(stub_id, start, __ pc());
+
     return start;
   }
 
@@ -11223,8 +12087,6 @@ class StubGenerator: public StubCodeGenerator {
      */
     address generate_multiply() {
       Label argh, nothing;
-      bind(argh);
-      stop("MontgomeryMultiply total_allocation must be <= 8192");
 
       align(CodeEntryAlignment);
       address entry = pc();
@@ -11331,6 +12193,10 @@ class StubGenerator: public StubCodeGenerator {
       bind(nothing);
       ret(lr);
 
+      // handler for error case
+      bind(argh);
+      stop("MontgomeryMultiply total_allocation must be <= 8192");
+
       return entry;
     }
     // In C, approximately:
@@ -11434,8 +12300,6 @@ class StubGenerator: public StubCodeGenerator {
      */
     address generate_square() {
       Label argh;
-      bind(argh);
-      stop("MontgomeryMultiply total_allocation must be <= 8192");
 
       align(CodeEntryAlignment);
       address entry = pc();
@@ -11544,6 +12408,10 @@ class StubGenerator: public StubCodeGenerator {
       leave();
       ret(lr);
 
+      // handler for error case
+      bind(argh);
+      stop("MontgomeryMultiply total_allocation must be <= 8192");
+
       return entry;
     }
     // In C, approximately:
@@ -11798,18 +12666,32 @@ class StubGenerator: public StubCodeGenerator {
 
     if (UseMontgomeryMultiplyIntrinsic) {
       StubId stub_id = StubId::stubgen_montgomeryMultiply_id;
-      StubCodeMark mark(this, stub_id);
-      MontgomeryMultiplyGenerator g(_masm, /*squaring*/false);
-      StubRoutines::_montgomeryMultiply = g.generate_multiply();
+      address start = load_archive_data(stub_id);
+      if (start == nullptr) {
+        // we have to generate it
+        StubCodeMark mark(this, stub_id);
+        MontgomeryMultiplyGenerator g(_masm, /*squaring*/false);
+        start = g.generate_multiply();
+        // record the stub start and end
+        store_archive_data(stub_id, start, _masm->pc());
+      }
+      StubRoutines::_montgomeryMultiply = start;
     }
 
     if (UseMontgomerySquareIntrinsic) {
       StubId stub_id = StubId::stubgen_montgomerySquare_id;
-      StubCodeMark mark(this, stub_id);
-      MontgomeryMultiplyGenerator g(_masm, /*squaring*/true);
-      // We use generate_multiply() rather than generate_square()
-      // because it's faster for the sizes of modulus we care about.
-      StubRoutines::_montgomerySquare = g.generate_multiply();
+      address start = load_archive_data(stub_id);
+      if (start == nullptr) {
+        // we have to generate it
+        StubCodeMark mark(this, stub_id);
+        MontgomeryMultiplyGenerator g(_masm, /*squaring*/true);
+        // We use generate_multiply() rather than generate_square()
+        // because it's faster for the sizes of modulus we care about.
+        start = g.generate_multiply();
+        // record the stub start and end
+        store_archive_data(stub_id, start, _masm->pc());
+      }
+      StubRoutines::_montgomerySquare = start;
     }
 
 #endif // COMPILER2
@@ -11854,7 +12736,8 @@ class StubGenerator: public StubCodeGenerator {
     }
     if (UseGHASHIntrinsics) {
       // StubRoutines::_ghash_processBlocks = generate_ghash_processBlocks();
-      StubRoutines::_ghash_processBlocks = generate_ghash_processBlocks_wide();
+      StubRoutines::aarch64::_ghash_processBlocks_small = generate_ghash_processBlocks_small();
+      StubRoutines::_ghash_processBlocks = generate_ghash_processBlocks(StubRoutines::aarch64::_ghash_processBlocks_small);
     }
     if (UseAESIntrinsics && UseGHASHIntrinsics) {
       StubRoutines::_galoisCounterMode_AESCrypt = generate_galoisCounterMode_AESCrypt();
@@ -11898,7 +12781,7 @@ class StubGenerator: public StubCodeGenerator {
   }
 
  public:
-  StubGenerator(CodeBuffer* code, BlobId blob_id) : StubCodeGenerator(code, blob_id) {
+  StubGenerator(CodeBuffer* code, BlobId blob_id, AOTStubData* stub_data) : StubCodeGenerator(code, blob_id, stub_data) {
     switch(blob_id) {
     case BlobId::stubgen_preuniverse_id:
       generate_preuniverse_stubs();
@@ -11920,12 +12803,35 @@ class StubGenerator: public StubCodeGenerator {
       break;
     };
   }
+
+#if INCLUDE_CDS
+  static void init_AOTAddressTable(GrowableArray<address>& external_addresses) {
+    // external data defined in this file
+#define ADD(addr) external_addresses.append((address)addr);
+    ADD(_sha256_round_consts);
+    ADD(_sha512_round_consts);
+    ADD(_sha3_round_consts);
+    ADD(_double_keccak_round_consts);
+    ADD(_encodeBlock_toBase64);
+    ADD(_encodeBlock_toBase64URL);
+    ADD(_decodeBlock_fromBase64ForNoSIMD);
+    ADD(_decodeBlock_fromBase64URLForNoSIMD);
+    ADD(_decodeBlock_fromBase64ForSIMD);
+    ADD(_decodeBlock_fromBase64URLForSIMD);
+#undef ADD
+  }
+#endif // INCLUDE_CDS
 }; // end class declaration
 
-void StubGenerator_generate(CodeBuffer* code, BlobId blob_id) {
-  StubGenerator g(code, blob_id);
+void StubGenerator_generate(CodeBuffer* code, BlobId blob_id, AOTStubData* stub_data) {
+  StubGenerator g(code, blob_id, stub_data);
 }
 
+#if INCLUDE_CDS
+void StubGenerator_init_AOTAddressTable(GrowableArray<address>& addresses) {
+  StubGenerator::init_AOTAddressTable(addresses);
+}
+#endif // INCLUDE_CDS
 
 #if defined (LINUX)
 
diff --git a/src/hotspot/cpu/aarch64/stubRoutines_aarch64.cpp b/src/hotspot/cpu/aarch64/stubRoutines_aarch64.cpp
index 88993818b47..35ec22b0897 100644
--- a/src/hotspot/cpu/aarch64/stubRoutines_aarch64.cpp
+++ b/src/hotspot/cpu/aarch64/stubRoutines_aarch64.cpp
@@ -413,3 +413,39 @@ ATTRIBUTE_ALIGNED(64) jdouble StubRoutines::aarch64::_pio2[] = {
   2.73370053816464559624e-44, // 0x36E3822280000000
   2.16741683877804819444e-51, // 0x3569F31D00000000
 };
+
+#if INCLUDE_CDS
+extern void StubGenerator_init_AOTAddressTable(GrowableArray<address>& addresses);
+
+void StubRoutines::init_AOTAddressTable() {
+  ResourceMark rm;
+  GrowableArray<address> external_addresses;
+  // publish static addresses referred to by aarch64 generator
+  // n.b. we have to use use an extern call here because class
+  // StubGenerator, which provides the static method that knows how to
+  // add the relevant addresses, is declared in a source file rather
+  // than in a separately includeable header.
+  StubGenerator_init_AOTAddressTable(external_addresses);
+  // publish external data addresses defined in nested aarch64 class
+  StubRoutines::aarch64::init_AOTAddressTable(external_addresses);
+  AOTCodeCache::publish_external_addresses(external_addresses);
+}
+
+
+#define ADD(addr) external_addresses.append((address)addr);
+
+void StubRoutines::aarch64::init_AOTAddressTable(GrowableArray<address>& external_addresses) {
+  ADD(_kyberConsts);
+  ADD(_dilithiumConsts);
+  // this is added in generic code
+  // ADD(_crc_table);
+  ADD(_adler_table);
+  ADD(_npio2_hw);
+  ADD(_dsin_coef);
+  ADD(_dcos_coef);
+  ADD(_two_over_pi);
+  ADD(_pio2);
+}
+
+#undef ADD
+#endif // INCLUDE_CDS
diff --git a/src/hotspot/cpu/aarch64/stubRoutines_aarch64.hpp b/src/hotspot/cpu/aarch64/stubRoutines_aarch64.hpp
index c35371e1083..f77192a3741 100644
--- a/src/hotspot/cpu/aarch64/stubRoutines_aarch64.hpp
+++ b/src/hotspot/cpu/aarch64/stubRoutines_aarch64.hpp
@@ -110,6 +110,11 @@ private:
     _completed = true;
   }
 
+#if INCLUDE_CDS
+  static void init_AOTAddressTable(GrowableArray<address>& external_addresses);
+#endif // INCLUDE_CDS
+
+
 private:
   static uint16_t  _kyberConsts[];
   static uint32_t _dilithiumConsts[];
diff --git a/src/hotspot/cpu/arm/stubGenerator_arm.cpp b/src/hotspot/cpu/arm/stubGenerator_arm.cpp
index a36ad3a0c47..a705b15eff5 100644
--- a/src/hotspot/cpu/arm/stubGenerator_arm.cpp
+++ b/src/hotspot/cpu/arm/stubGenerator_arm.cpp
@@ -3211,7 +3211,7 @@ class StubGenerator: public StubCodeGenerator {
   }
 
  public:
-  StubGenerator(CodeBuffer* code, BlobId blob_id) : StubCodeGenerator(code, blob_id) {
+  StubGenerator(CodeBuffer* code, BlobId blob_id, AOTStubData* stub_data) : StubCodeGenerator(code, blob_id, stub_data) {
     switch(blob_id) {
     case BlobId::stubgen_preuniverse_id:
       generate_preuniverse_stubs();
@@ -3235,8 +3235,8 @@ class StubGenerator: public StubCodeGenerator {
   }
 }; // end class declaration
 
-void StubGenerator_generate(CodeBuffer* code, BlobId blob_id) {
-  StubGenerator g(code, blob_id);
+void StubGenerator_generate(CodeBuffer* code, BlobId blob_id, AOTStubData* stub_data) {
+  StubGenerator g(code, blob_id, stub_data);
 }
 
 // implementation of internal development flag
diff --git a/src/hotspot/cpu/arm/stubRoutines_arm.cpp b/src/hotspot/cpu/arm/stubRoutines_arm.cpp
index a4f2b5e1bd9..3ed747ea11a 100644
--- a/src/hotspot/cpu/arm/stubRoutines_arm.cpp
+++ b/src/hotspot/cpu/arm/stubRoutines_arm.cpp
@@ -39,3 +39,9 @@ STUBGEN_ARCH_ENTRIES_DO(DEFINE_ARCH_ENTRY, DEFINE_ARCH_ENTRY_INIT)
 
 address StubRoutines::crc_table_addr()    { ShouldNotCallThis(); return nullptr; }
 address StubRoutines::crc32c_table_addr() { ShouldNotCallThis(); return nullptr; }
+
+#if INCLUDE_CDS
+// nothing to do for arm
+void StubRoutines::init_AOTAddressTable() {
+}
+#endif // INCLUDE_CDS
diff --git a/src/hotspot/cpu/ppc/stubGenerator_ppc.cpp b/src/hotspot/cpu/ppc/stubGenerator_ppc.cpp
index e48778a8b9f..f528587a8bb 100644
--- a/src/hotspot/cpu/ppc/stubGenerator_ppc.cpp
+++ b/src/hotspot/cpu/ppc/stubGenerator_ppc.cpp
@@ -5095,7 +5095,7 @@ void generate_lookup_secondary_supers_table_stub() {
   }
 
  public:
-  StubGenerator(CodeBuffer* code, BlobId blob_id) : StubCodeGenerator(code, blob_id) {
+  StubGenerator(CodeBuffer* code, BlobId blob_id, AOTStubData *stub_data) : StubCodeGenerator(code, blob_id, stub_data) {
     switch(blob_id) {
     case BlobId::stubgen_preuniverse_id:
       generate_preuniverse_stubs();
@@ -5119,7 +5119,7 @@ void generate_lookup_secondary_supers_table_stub() {
   }
 };
 
-void StubGenerator_generate(CodeBuffer* code, BlobId blob_id) {
-  StubGenerator g(code, blob_id);
+void StubGenerator_generate(CodeBuffer* code, BlobId blob_id, AOTStubData *stub_data) {
+  StubGenerator g(code, blob_id, stub_data);
 }
 
diff --git a/src/hotspot/cpu/ppc/stubRoutines_ppc_64.cpp b/src/hotspot/cpu/ppc/stubRoutines_ppc_64.cpp
index 914c5a17a19..3b7ee66348a 100644
--- a/src/hotspot/cpu/ppc/stubRoutines_ppc_64.cpp
+++ b/src/hotspot/cpu/ppc/stubRoutines_ppc_64.cpp
@@ -183,3 +183,9 @@ address StubRoutines::ppc::generate_crc_constants(juint reverse_poly) {
 
   return consts;
 }
+
+#if INCLUDE_CDS
+// nothing to do for ppc
+void StubRoutines::init_AOTAddressTable() {
+}
+#endif // INCLUDE_CDS
diff --git a/src/hotspot/cpu/riscv/stubGenerator_riscv.cpp b/src/hotspot/cpu/riscv/stubGenerator_riscv.cpp
index 964c6d98e9c..4656b5c0d41 100644
--- a/src/hotspot/cpu/riscv/stubGenerator_riscv.cpp
+++ b/src/hotspot/cpu/riscv/stubGenerator_riscv.cpp
@@ -7348,7 +7348,7 @@ static const int64_t right_3_bits = right_n_bits(3);
   }
 
  public:
-  StubGenerator(CodeBuffer* code, BlobId blob_id) : StubCodeGenerator(code, blob_id) {
+  StubGenerator(CodeBuffer* code, BlobId blob_id, AOTStubData* stub_data) : StubCodeGenerator(code, blob_id, stub_data) {
     switch(blob_id) {
     case BlobId::stubgen_preuniverse_id:
       generate_preuniverse_stubs();
@@ -7372,6 +7372,6 @@ static const int64_t right_3_bits = right_n_bits(3);
   }
 }; // end class declaration
 
-void StubGenerator_generate(CodeBuffer* code, BlobId blob_id) {
-  StubGenerator g(code, blob_id);
+void StubGenerator_generate(CodeBuffer* code, BlobId blob_id, AOTStubData* stub_data) {
+  StubGenerator g(code, blob_id, stub_data);
 }
diff --git a/src/hotspot/cpu/riscv/stubRoutines_riscv.cpp b/src/hotspot/cpu/riscv/stubRoutines_riscv.cpp
index 2aac95d71fa..51e31aa3672 100644
--- a/src/hotspot/cpu/riscv/stubRoutines_riscv.cpp
+++ b/src/hotspot/cpu/riscv/stubRoutines_riscv.cpp
@@ -501,3 +501,9 @@ ATTRIBUTE_ALIGNED(4096) juint StubRoutines::riscv::_crc_table[] =
     0x751997d0UL, 0x00000001UL,
     0xccaa009eUL, 0x00000000UL,
 };
+
+#if INCLUDE_CDS
+// nothing to do for riscv
+void StubRoutines::init_AOTAddressTable() {
+}
+#endif // INCLUDE_CDS
diff --git a/src/hotspot/cpu/s390/stubGenerator_s390.cpp b/src/hotspot/cpu/s390/stubGenerator_s390.cpp
index 2aa365be999..3f16312eb48 100644
--- a/src/hotspot/cpu/s390/stubGenerator_s390.cpp
+++ b/src/hotspot/cpu/s390/stubGenerator_s390.cpp
@@ -3422,7 +3422,7 @@ class StubGenerator: public StubCodeGenerator {
   }
 
  public:
-  StubGenerator(CodeBuffer* code, BlobId blob_id) : StubCodeGenerator(code, blob_id) {
+  StubGenerator(CodeBuffer* code, BlobId blob_id, AOTStubData* stub_data) : StubCodeGenerator(code, blob_id, stub_data) {
     switch(blob_id) {
     case BlobId::stubgen_preuniverse_id:
       generate_preuniverse_stubs();
@@ -3479,6 +3479,6 @@ class StubGenerator: public StubCodeGenerator {
 
 };
 
-void StubGenerator_generate(CodeBuffer* code, BlobId blob_id) {
-  StubGenerator g(code, blob_id);
+void StubGenerator_generate(CodeBuffer* code, BlobId blob_id, AOTStubData* stub_data) {
+  StubGenerator g(code, blob_id, stub_data);
 }
diff --git a/src/hotspot/cpu/s390/stubRoutines_s390.cpp b/src/hotspot/cpu/s390/stubRoutines_s390.cpp
index 6feb20f9604..3db4995338d 100644
--- a/src/hotspot/cpu/s390/stubRoutines_s390.cpp
+++ b/src/hotspot/cpu/s390/stubRoutines_s390.cpp
@@ -736,3 +736,9 @@ juint StubRoutines::zarch::_crc32c_table[CRC32_TABLES][CRC32_COLUMN_SIZE] = {
     }
   #endif
   };
+
+#if INCLUDE_CDS
+// nothing to do for s390
+void StubRoutines::init_AOTAddressTable() {
+}
+#endif // INCLUDE_CDS
diff --git a/src/hotspot/cpu/x86/c1_LIRAssembler_x86.cpp b/src/hotspot/cpu/x86/c1_LIRAssembler_x86.cpp
index 1242078e11d..29925e71aaf 100644
--- a/src/hotspot/cpu/x86/c1_LIRAssembler_x86.cpp
+++ b/src/hotspot/cpu/x86/c1_LIRAssembler_x86.cpp
@@ -71,6 +71,17 @@ static jlong *double_signmask_pool = double_quadword(&fp_signmask_pool[2*2],
 static jlong *float_signflip_pool  = double_quadword(&fp_signmask_pool[3*2], (jlong)UCONST64(0x8000000080000000), (jlong)UCONST64(0x8000000080000000));
 static jlong *double_signflip_pool = double_quadword(&fp_signmask_pool[4*2], (jlong)UCONST64(0x8000000000000000), (jlong)UCONST64(0x8000000000000000));
 
+#if INCLUDE_CDS
+// publish external addresses defined in this file
+void LIR_Assembler::init_AOTAddressTable(GrowableArray<address>& external_addresses) {
+#define ADD(addr) external_addresses.append((address)addr);
+  ADD(float_signmask_pool);
+  ADD(double_signmask_pool);
+  ADD(float_signflip_pool);
+  ADD(double_signflip_pool);
+#undef ADD
+}
+#endif // INCLUDE_CDS
 
 NEEDS_CLEANUP // remove this definitions ?
 const Register SYNC_header = rax;   // synchronization header
@@ -519,6 +530,15 @@ void LIR_Assembler::const2reg(LIR_Opr src, LIR_Opr dest, LIR_PatchCode patch_cod
     }
 
     case T_LONG: {
+#if INCLUDE_CDS
+      if (AOTCodeCache::is_on_for_dump()) {
+        address b = c->as_pointer();
+        if (b == (address)ThreadIdentifier::unsafe_offset()) {
+          __ lea(dest->as_register_lo(), ExternalAddress(b));
+          break;
+        }
+      }
+#endif
       assert(patch_code == lir_patch_none, "no patching handled here");
 #if INCLUDE_CDS
       if (AOTCodeCache::is_on_for_dump()) {
diff --git a/src/hotspot/cpu/x86/c1_LIRAssembler_x86.hpp b/src/hotspot/cpu/x86/c1_LIRAssembler_x86.hpp
index c4a368b54d8..6f179255e4a 100644
--- a/src/hotspot/cpu/x86/c1_LIRAssembler_x86.hpp
+++ b/src/hotspot/cpu/x86/c1_LIRAssembler_x86.hpp
@@ -58,4 +58,7 @@ public:
   void store_parameter(jobject c,   int offset_from_esp_in_words);
   void store_parameter(Metadata* c, int offset_from_esp_in_words);
 
+#if INCLUDE_CDS
+  void static init_AOTAddressTable(GrowableArray<address>& external_addresses);
+#endif // INCLUDE_CDS
 #endif // CPU_X86_C1_LIRASSEMBLER_X86_HPP
diff --git a/src/hotspot/cpu/x86/gc/z/zBarrierSetAssembler_x86.cpp b/src/hotspot/cpu/x86/gc/z/zBarrierSetAssembler_x86.cpp
index 47a3dad54e7..c20551b5084 100644
--- a/src/hotspot/cpu/x86/gc/z/zBarrierSetAssembler_x86.cpp
+++ b/src/hotspot/cpu/x86/gc/z/zBarrierSetAssembler_x86.cpp
@@ -31,6 +31,7 @@
 #include "gc/z/zBarrierSetAssembler.hpp"
 #include "gc/z/zBarrierSetRuntime.hpp"
 #include "gc/z/zThreadLocalData.hpp"
+#include "logging/log.hpp"
 #include "memory/resourceArea.hpp"
 #include "runtime/jniHandles.hpp"
 #include "runtime/sharedRuntime.hpp"
@@ -1391,10 +1392,13 @@ static uint16_t patch_barrier_relocation_value(int format) {
   }
 }
 
-void ZBarrierSetAssembler::patch_barrier_relocation(address addr, int format) {
+void ZBarrierSetAssembler::patch_barrier_relocation(address addr, int format, bool log) {
   const int offset = patch_barrier_relocation_offset(format);
   const uint16_t value = patch_barrier_relocation_value(format);
   uint8_t* const patch_addr = (uint8_t*)addr + offset;
+  if (log) {
+    log_trace(aot, codecache, stubs)("patching address " INTPTR_FORMAT " offset %d value 0x%x", p2i(addr), offset, value);
+  }
   if (format == ZBarrierRelocationFormatLoadGoodBeforeShl) {
     if (VM_Version::supports_apx_f()) {
       NativeInstruction* instruction = nativeInstruction_at(addr);
@@ -1426,6 +1430,74 @@ void ZBarrierSetAssembler::patch_barriers() {
 #undef __
 #define __ masm->
 
+void ZBarrierSetAssembler::register_reloc_addresses(GrowableArray<address> &entries, int begin, int count) {
+  int formats[] = {
+    ZBarrierRelocationFormatLoadBadAfterTest,
+    ZBarrierRelocationFormatStoreBadAfterTest,
+    ZBarrierRelocationFormatStoreGoodAfterOr,
+    -1
+  };
+  int format_idx = 0;
+  int format = formats[format_idx++];
+  for (int i = begin; i < begin + count; i++) {
+    address addr = entries.at(i);
+    // reloc addresses occur in 3 groups terminated with a nullptr
+    if (addr == nullptr) {
+      assert(format_idx < (int)(sizeof(formats) / sizeof(formats[0])),
+             "too many reloc groups");
+      format = formats[format_idx++];
+    } else {
+      switch(format) {
+      case ZBarrierRelocationFormatLoadBadAfterTest:
+        _load_bad_relocations.append(addr);
+        break;
+      case ZBarrierRelocationFormatStoreBadAfterTest:
+        _store_bad_relocations.append(addr);
+        break;
+      case ZBarrierRelocationFormatStoreGoodAfterOr:
+        _store_good_relocations.append(addr);
+        break;
+      default:
+        ShouldNotReachHere();
+        break;
+      }
+      patch_barrier_relocation(addr, format, true);
+    }
+  }
+  assert(format == -1, "unterminated format list");
+}
+
+void ZBarrierSetAssembler::retrieve_reloc_addresses(address start, address end, GrowableArray<address> &entries) {
+  assert(start != nullptr, "start address must not be null");
+  assert(end != nullptr, "start address must not be null");
+  assert(start < end, "stub range must not be empty");
+  for (int i = 0; i < _load_bad_relocations.length(); i++) {
+    address addr = _load_bad_relocations.at(i);
+    assert(addr != nullptr, "load bad reloc address shoudl not be null!");
+    if (start <= addr && addr < end) {
+      entries.append(addr);
+    }
+  }
+  entries.append(nullptr);
+  for (int i = 0; i < _store_bad_relocations.length(); i++) {
+    address addr = _store_bad_relocations.at(i);
+    assert(addr != nullptr, "store bad reloc address shoudl not be null!");
+    if (start <= addr && addr < end) {
+      entries.append(addr);
+    }
+  }
+  entries.append(nullptr);
+  for (int i = 0; i < _store_good_relocations.length(); i++) {
+    address addr = _store_good_relocations.at(i);
+    assert(addr != nullptr, "store good reloc address shoudl not be null!");
+    if (start <= addr && addr < end) {
+      entries.append(addr);
+    }
+  }
+  entries.append(nullptr);
+}
+
+
 void ZBarrierSetAssembler::check_oop(MacroAssembler* masm, Register obj, Register tmp1, Register tmp2, Label& error) {
   // C1 calls verfy_oop in the middle of barriers, before they have been uncolored
   // and after being colored. Therefore, we must deal with colored oops as well.
diff --git a/src/hotspot/cpu/x86/gc/z/zBarrierSetAssembler_x86.hpp b/src/hotspot/cpu/x86/gc/z/zBarrierSetAssembler_x86.hpp
index e91e2b9ea20..ce0c4769716 100644
--- a/src/hotspot/cpu/x86/gc/z/zBarrierSetAssembler_x86.hpp
+++ b/src/hotspot/cpu/x86/gc/z/zBarrierSetAssembler_x86.hpp
@@ -189,10 +189,14 @@ public:
                             Label& slow_path,
                             Label& slow_path_continuation) const;
 
-  void patch_barrier_relocation(address addr, int format);
+  void patch_barrier_relocation(address addr, int format, bool log = false);
 
   void patch_barriers();
 
+  void register_reloc_addresses(GrowableArray<address> &entries, int begin, int count);
+
+  void retrieve_reloc_addresses(address start, address end, GrowableArray<address> &entries);
+
   void check_oop(MacroAssembler* masm, Register obj, Register tmp1, Register tmp2, Label& error);
 };
 
diff --git a/src/hotspot/cpu/x86/macroAssembler_x86.cpp b/src/hotspot/cpu/x86/macroAssembler_x86.cpp
index 356bf8af5c0..5ab3ca339aa 100644
--- a/src/hotspot/cpu/x86/macroAssembler_x86.cpp
+++ b/src/hotspot/cpu/x86/macroAssembler_x86.cpp
@@ -385,7 +385,8 @@ void MacroAssembler::warn(const char* msg) {
   // Windows always allocates space for its register args
   subq(rsp,  frame::arg_reg_save_area_bytes);
 #endif
-  lea(c_rarg0, ExternalAddress((address) msg));
+  const char* str = (code_section()->scratch_emit()) ? msg : AOTCodeCache::add_C_string(msg);
+  lea(c_rarg0, ExternalAddress((address) str));
   call(RuntimeAddress(CAST_FROM_FN_PTR(address, warning)));
 
 #ifdef _WIN64
@@ -5672,7 +5673,12 @@ void MacroAssembler::encode_and_move_klass_not_null(Register dst, Register src)
   BLOCK_COMMENT("encode_and_move_klass_not_null {");
   assert_different_registers(src, dst);
   if (CompressedKlassPointers::base() != nullptr) {
-    movptr(dst, -(intptr_t)CompressedKlassPointers::base());
+    if (AOTCodeCache::is_on_for_dump()) {
+      movptr(dst, ExternalAddress(CompressedKlassPointers::base_addr()));
+      negq(dst);
+    } else {
+      movptr(dst, -(intptr_t)CompressedKlassPointers::base());
+    }
     addq(dst, src);
   } else {
     movptr(dst, src);
@@ -5720,7 +5726,11 @@ void  MacroAssembler::decode_and_move_klass_not_null(Register dst, Register src)
   } else {
     if (CompressedKlassPointers::shift() <= Address::times_8) {
       if (CompressedKlassPointers::base() != nullptr) {
-        movptr(dst, (intptr_t)CompressedKlassPointers::base());
+        if (AOTCodeCache::is_on_for_dump()) {
+          movptr(dst, ExternalAddress(CompressedKlassPointers::base_addr()));
+        } else {
+          movptr(dst, (intptr_t)CompressedKlassPointers::base());
+        }
       } else {
         xorq(dst, dst);
       }
@@ -5732,9 +5742,14 @@ void  MacroAssembler::decode_and_move_klass_not_null(Register dst, Register src)
       }
     } else {
       if (CompressedKlassPointers::base() != nullptr) {
-        const intptr_t base_right_shifted =
-            (intptr_t)CompressedKlassPointers::base() >> CompressedKlassPointers::shift();
-        movptr(dst, base_right_shifted);
+        if (AOTCodeCache::is_on_for_dump()) {
+          movptr(dst, ExternalAddress(CompressedKlassPointers::base_addr()));
+          shrq(dst, CompressedKlassPointers::shift());
+        } else {
+          const intptr_t base_right_shifted =
+               (intptr_t)CompressedKlassPointers::base() >> CompressedKlassPointers::shift();
+          movptr(dst, base_right_shifted);
+        }
       } else {
         xorq(dst, dst);
       }
@@ -5811,7 +5826,7 @@ void  MacroAssembler::cmp_narrow_klass(Address dst, Klass* k) {
 
 void MacroAssembler::reinit_heapbase() {
   if (UseCompressedOops) {
-    if (Universe::heap() != nullptr) {
+    if (Universe::heap() != nullptr && !AOTCodeCache::is_on_for_dump()) {
       if (CompressedOops::base() == nullptr) {
         MacroAssembler::xorptr(r12_heapbase, r12_heapbase);
       } else {
diff --git a/src/hotspot/cpu/x86/macroAssembler_x86_sha.cpp b/src/hotspot/cpu/x86/macroAssembler_x86_sha.cpp
index 9f0232075cd..401d5dc22cc 100644
--- a/src/hotspot/cpu/x86/macroAssembler_x86_sha.cpp
+++ b/src/hotspot/cpu/x86/macroAssembler_x86_sha.cpp
@@ -242,7 +242,6 @@ void MacroAssembler::fast_sha256(XMMRegister msg, XMMRegister state0, XMMRegiste
   Label done_hash, loop0;
 
   address K256 = StubRoutines::x86::k256_addr();
-  address pshuffle_byte_flip_mask = StubRoutines::x86::pshuffle_byte_flip_mask_addr();
 
   movdqu(state0, Address(state, 0));
   movdqu(state1, Address(state, 16));
@@ -253,7 +252,7 @@ void MacroAssembler::fast_sha256(XMMRegister msg, XMMRegister state0, XMMRegiste
   palignr(state0, state1, 8);
   pblendw(state1, msgtmp4, 0xF0);
 
-  movdqu(shuf_mask, ExternalAddress(pshuffle_byte_flip_mask));
+  movdqu(shuf_mask, ExternalAddress(StubRoutines::x86::pshuffle_byte_flip_mask_addr()));
   lea(rax, ExternalAddress(K256));
 
   bind(loop0);
@@ -661,8 +660,6 @@ void MacroAssembler::sha256_AVX2(XMMRegister msg, XMMRegister state0, XMMRegiste
         compute_size1, compute_size_end1;
 
   address K256_W = StubRoutines::x86::k256_W_addr();
-  address pshuffle_byte_flip_mask = StubRoutines::x86::pshuffle_byte_flip_mask_addr();
-  address pshuffle_byte_flip_mask_addr = nullptr;
 
 const XMMRegister& SHUF_00BA        = xmm10;    // ymm10: shuffle xBxA -> 00BA
 const XMMRegister& SHUF_DC00        = xmm12;    // ymm12: shuffle xDxC -> DC00
@@ -791,10 +788,14 @@ enum {
   // load g - r10 after it is used as scratch
   movl(h, Address(CTX, 4*7));
 
-  pshuffle_byte_flip_mask_addr = pshuffle_byte_flip_mask;
-  vmovdqu(BYTE_FLIP_MASK, ExternalAddress(pshuffle_byte_flip_mask_addr +  0)); // [PSHUFFLE_BYTE_FLIP_MASK wrt rip]
-  vmovdqu(SHUF_00BA,      ExternalAddress(pshuffle_byte_flip_mask_addr + 32)); // [_SHUF_00BA wrt rip]
-  vmovdqu(SHUF_DC00,      ExternalAddress(pshuffle_byte_flip_mask_addr + 64)); // [_SHUF_DC00 wrt rip]
+  // the three successive pshuffle_byte_flip_mask stub entries should
+  // be offset by 32 bytes
+  assert(StubRoutines::x86::pshuffle_byte_flip_mask_addr() + 32 == StubRoutines::x86::pshuffle_byte_flip_mask_00ba_addr(), "sanity");
+  assert(StubRoutines::x86::pshuffle_byte_flip_mask_addr() + 64 == StubRoutines::x86::pshuffle_byte_flip_mask_dc00_addr(), "sanity");
+
+  vmovdqu(BYTE_FLIP_MASK, ExternalAddress(StubRoutines::x86::pshuffle_byte_flip_mask_addr())); // [PSHUFFLE_BYTE_FLIP_MASK wrt rip]
+  vmovdqu(SHUF_00BA,      ExternalAddress(StubRoutines::x86::pshuffle_byte_flip_mask_00ba_addr())); // [_SHUF_00BA wrt rip]
+  vmovdqu(SHUF_DC00,      ExternalAddress(StubRoutines::x86::pshuffle_byte_flip_mask_dc00_addr())); // [_SHUF_DC00 wrt rip]
 
   movl(g, Address(CTX, 4*6));
 
@@ -953,11 +954,9 @@ bind(only_one_block);
   // load g - r10 after use as scratch
   movl(h, Address(CTX, 4*7));   // 0x5be0cd19
 
-
-  pshuffle_byte_flip_mask_addr = pshuffle_byte_flip_mask;
-  vmovdqu(BYTE_FLIP_MASK, ExternalAddress(pshuffle_byte_flip_mask_addr +  0)); // [PSHUFFLE_BYTE_FLIP_MASK wrt rip]
-  vmovdqu(SHUF_00BA,      ExternalAddress(pshuffle_byte_flip_mask_addr + 32)); // [_SHUF_00BA wrt rip]
-  vmovdqu(SHUF_DC00,      ExternalAddress(pshuffle_byte_flip_mask_addr + 64)); // [_SHUF_DC00 wrt rip]
+  vmovdqu(BYTE_FLIP_MASK, ExternalAddress(StubRoutines::x86::pshuffle_byte_flip_mask_addr())); // [PSHUFFLE_BYTE_FLIP_MASK wrt rip]
+  vmovdqu(SHUF_00BA,      ExternalAddress(StubRoutines::x86::pshuffle_byte_flip_mask_00ba_addr())); // [_SHUF_00BA wrt rip]
+  vmovdqu(SHUF_DC00,      ExternalAddress(StubRoutines::x86::pshuffle_byte_flip_mask_dc00_addr())); // [_SHUF_DC00 wrt rip]
 
   movl(g, Address(CTX, 4*6));   // 0x1f83d9ab
 
@@ -1346,9 +1345,12 @@ void MacroAssembler::sha512_AVX2(XMMRegister msg, XMMRegister state0, XMMRegiste
     // load g - r10 after it is used as scratch
     movq(h, Address(CTX, 8 * 7));
 
-    pshuffle_byte_flip_mask_addr = pshuffle_byte_flip_mask_sha512;
-    vmovdqu(BYTE_FLIP_MASK, ExternalAddress(pshuffle_byte_flip_mask_addr +  0)); // PSHUFFLE_BYTE_FLIP_MASK wrt rip
-    vmovdqu(YMM_MASK_LO,    ExternalAddress(pshuffle_byte_flip_mask_addr + 32));
+    // the two successive pshuffle_byte_flip_mask_sha512 stub entries should
+    // be offset by 32 bytes
+    assert(StubRoutines::x86::pshuffle_byte_flip_mask_addr_sha512() + 32 == StubRoutines::x86::pshuffle_byte_flip_mask_ymm_lo_addr_sha512(), "sanity");
+
+    vmovdqu(BYTE_FLIP_MASK, ExternalAddress(StubRoutines::x86::pshuffle_byte_flip_mask_addr_sha512())); // PSHUFFLE_BYTE_FLIP_MASK wrt rip
+    vmovdqu(YMM_MASK_LO,    ExternalAddress(StubRoutines::x86::pshuffle_byte_flip_mask_ymm_lo_addr_sha512())); // MASK_YMM_LO wrt rip
 
     movq(g, Address(CTX, 8 * 6));
 
diff --git a/src/hotspot/cpu/x86/stubDeclarations_x86.hpp b/src/hotspot/cpu/x86/stubDeclarations_x86.hpp
index 971c8fd3c44..07a1ab622ed 100644
--- a/src/hotspot/cpu/x86/stubDeclarations_x86.hpp
+++ b/src/hotspot/cpu/x86/stubDeclarations_x86.hpp
@@ -161,6 +161,12 @@
   do_arch_entry(x86, compiler, pshuffle_byte_flip_mask,                 \
                 pshuffle_byte_flip_mask_addr,                           \
                 pshuffle_byte_flip_mask_addr)                           \
+  do_arch_entry(x86, compiler, pshuffle_byte_flip_mask,                 \
+                pshuffle_byte_flip_mask_00ba_addr,                      \
+                pshuffle_byte_flip_mask_00ba_addr)                      \
+  do_arch_entry(x86, compiler, pshuffle_byte_flip_mask,                 \
+                pshuffle_byte_flip_mask_dc00_addr,                      \
+                pshuffle_byte_flip_mask_dc00_addr)                      \
   /* x86_64 exposes these 3 stubs via a generic entry array */          \
   /* other arches use arch-specific entries */                          \
   /* this really needs rationalising */                                 \
@@ -171,6 +177,9 @@
   do_arch_entry(x86, compiler, pshuffle_byte_flip_mask_sha512,          \
                 pshuffle_byte_flip_mask_addr_sha512,                    \
                 pshuffle_byte_flip_mask_addr_sha512)                    \
+  do_arch_entry(x86, compiler, pshuffle_byte_flip_mask_sha512,          \
+                pshuffle_byte_flip_mask_ymm_lo_addr_sha512,             \
+                pshuffle_byte_flip_mask_ymm_lo_addr_sha512)             \
   do_stub(compiler, compress_perm_table32)                              \
   do_arch_entry(x86, compiler, compress_perm_table32,                   \
                 compress_perm_table32, compress_perm_table32)           \
diff --git a/src/hotspot/cpu/x86/stubGenerator_x86_64.cpp b/src/hotspot/cpu/x86/stubGenerator_x86_64.cpp
index efb0411aa39..40be816fbf0 100644
--- a/src/hotspot/cpu/x86/stubGenerator_x86_64.cpp
+++ b/src/hotspot/cpu/x86/stubGenerator_x86_64.cpp
@@ -188,8 +188,18 @@ address StubGenerator::generate_call_stub(address& return_address) {
          (int)frame::entry_frame_call_wrapper_offset == (int)call_wrapper_off,
          "adjust this code");
   StubId stub_id = StubId::stubgen_call_stub_id;
+  GrowableArray<address> entries;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 2, "sanity check");
+  address start = load_archive_data(stub_id, &entries);
+  if (start != nullptr) {
+    assert(entries.length() == 1, "expected 1 extra entry");
+    return_address = entries.at(0);
+    return start;
+  }
+
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
 
   // same as in generate_catch_exception()!
   const Address rsp_after_call(rbp, rsp_after_call_off * wordSize);
@@ -298,6 +308,7 @@ address StubGenerator::generate_call_stub(address& return_address) {
 
   BLOCK_COMMENT("call_stub_return_address:");
   return_address = __ pc();
+  entries.append(return_address);
 
   // store result depending on type (everything that is not
   // T_OBJECT, T_LONG, T_FLOAT or T_DOUBLE is treated as T_INT)
@@ -394,6 +405,9 @@ address StubGenerator::generate_call_stub(address& return_address) {
   __ movdbl(Address(c_rarg0, 0), xmm0);
   __ jmp(exit);
 
+  // record the stub entry and end plus the auxiliary entry
+  store_archive_data(stub_id, start, __ pc(), &entries);
+
   return start;
 }
 
@@ -411,8 +425,15 @@ address StubGenerator::generate_call_stub(address& return_address) {
 
 address StubGenerator::generate_catch_exception() {
   StubId stub_id = StubId::stubgen_catch_exception_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
+
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
 
   // same as in generate_call_stub():
   const Address rsp_after_call(rbp, rsp_after_call_off * wordSize);
@@ -442,7 +463,9 @@ address StubGenerator::generate_catch_exception() {
   __ verify_oop(rax);
 
   __ movptr(Address(r15_thread, Thread::pending_exception_offset()), rax);
-  __ lea(rscratch1, ExternalAddress((address)__FILE__));
+  // special case -- add file name string to AOT address table
+  address file = (address)AOTCodeCache::add_C_string(__FILE__);
+  __ lea(rscratch1, ExternalAddress(file));
   __ movptr(Address(r15_thread, Thread::exception_file_offset()), rscratch1);
   __ movl(Address(r15_thread, Thread::exception_line_offset()), (int)  __LINE__);
 
@@ -451,6 +474,9 @@ address StubGenerator::generate_catch_exception() {
          "_call_stub_return_address must have been generated before");
   __ jump(RuntimeAddress(StubRoutines::_call_stub_return_address));
 
+  // record the stub entry and end
+  store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
@@ -467,8 +493,14 @@ address StubGenerator::generate_catch_exception() {
 
 address StubGenerator::generate_forward_exception() {
   StubId stub_id = StubId::stubgen_forward_exception_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
 
   // Upon entry, the sp points to the return address returning into
   // Java (interpreted or compiled) code; i.e., the return address
@@ -521,6 +553,9 @@ address StubGenerator::generate_forward_exception() {
   __ verify_oop(rax);
   __ jmp(rbx);
 
+  // record the stub entry and end
+  store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
@@ -531,12 +566,21 @@ address StubGenerator::generate_forward_exception() {
 // Result:
 address StubGenerator::generate_orderaccess_fence() {
   StubId stub_id = StubId::stubgen_fence_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
 
   __ membar(Assembler::StoreLoad);
   __ ret(0);
 
+  // record the stub entry and end
+  store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
@@ -550,8 +594,14 @@ address StubGenerator::generate_orderaccess_fence() {
 
 address StubGenerator::generate_verify_mxcsr() {
   StubId stub_id = StubId::stubgen_verify_mxcsr_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
 
   const Address mxcsr_save(rsp, 0);
 
@@ -574,15 +624,24 @@ address StubGenerator::generate_verify_mxcsr() {
 
   __ ret(0);
 
+  // record the stub entry and end
+  store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
 address StubGenerator::generate_f2i_fixup() {
   StubId stub_id = StubId::stubgen_f2i_fixup_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
   StubCodeMark mark(this, stub_id);
   Address inout(rsp, 5 * wordSize); // return address + 4 saves
 
-  address start = __ pc();
+  start = __ pc();
 
   Label L;
 
@@ -613,14 +672,23 @@ address StubGenerator::generate_f2i_fixup() {
 
   __ ret(0);
 
+  // record the stub entry and end
+  store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
 address StubGenerator::generate_f2l_fixup() {
   StubId stub_id = StubId::stubgen_f2l_fixup_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
   StubCodeMark mark(this, stub_id);
   Address inout(rsp, 5 * wordSize); // return address + 4 saves
-  address start = __ pc();
+  start = __ pc();
 
   Label L;
 
@@ -651,15 +719,24 @@ address StubGenerator::generate_f2l_fixup() {
 
   __ ret(0);
 
+  // record the stub entry and end
+  store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
 address StubGenerator::generate_d2i_fixup() {
   StubId stub_id = StubId::stubgen_d2i_fixup_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
   StubCodeMark mark(this, stub_id);
   Address inout(rsp, 6 * wordSize); // return address + 5 saves
 
-  address start = __ pc();
+  start = __ pc();
 
   Label L;
 
@@ -699,15 +776,24 @@ address StubGenerator::generate_d2i_fixup() {
 
   __ ret(0);
 
+  // record the stub entry and end
+  store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
 address StubGenerator::generate_d2l_fixup() {
   StubId stub_id = StubId::stubgen_d2l_fixup_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
   StubCodeMark mark(this, stub_id);
   Address inout(rsp, 6 * wordSize); // return address + 5 saves
 
-  address start = __ pc();
+  start = __ pc();
 
   Label L;
 
@@ -747,14 +833,23 @@ address StubGenerator::generate_d2l_fixup() {
 
   __ ret(0);
 
+  // record the stub entry and end
+  store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
 address StubGenerator::generate_count_leading_zeros_lut() {
-  __ align64();
   StubId stub_id = StubId::stubgen_vector_count_leading_zeros_lut_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
+  __ align64();
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
 
   __ emit_data64(0x0101010102020304, relocInfo::none);
   __ emit_data64(0x0000000000000000, relocInfo::none);
@@ -765,14 +860,23 @@ address StubGenerator::generate_count_leading_zeros_lut() {
   __ emit_data64(0x0101010102020304, relocInfo::none);
   __ emit_data64(0x0000000000000000, relocInfo::none);
 
+  // record the stub entry and end
+  store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
 address StubGenerator::generate_popcount_avx_lut() {
-  __ align64();
   StubId stub_id = StubId::stubgen_vector_popcount_lut_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
+  __ align64();
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
 
   __ emit_data64(0x0302020102010100, relocInfo::none);
   __ emit_data64(0x0403030203020201, relocInfo::none);
@@ -783,14 +887,23 @@ address StubGenerator::generate_popcount_avx_lut() {
   __ emit_data64(0x0302020102010100, relocInfo::none);
   __ emit_data64(0x0403030203020201, relocInfo::none);
 
+  // record the stub entry and end
+  store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
 address StubGenerator::generate_iota_indices() {
-  __ align(CodeEntryAlignment);
   StubId stub_id = StubId::stubgen_vector_iota_indices_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
+  __ align(CodeEntryAlignment);
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
   // B
   __ emit_data64(0x0706050403020100, relocInfo::none);
   __ emit_data64(0x0F0E0D0C0B0A0908, relocInfo::none);
@@ -845,14 +958,24 @@ address StubGenerator::generate_iota_indices() {
   __ emit_data64(0x4014000000000000, relocInfo::none); // 5.0d
   __ emit_data64(0x4018000000000000, relocInfo::none); // 6.0d
   __ emit_data64(0x401c000000000000, relocInfo::none); // 7.0d
+
+  // record the stub entry and end
+  store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
 address StubGenerator::generate_vector_reverse_bit_lut() {
-  __ align(CodeEntryAlignment);
   StubId stub_id = StubId::stubgen_vector_reverse_bit_lut_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
+  __ align(CodeEntryAlignment);
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
 
   __ emit_data64(0x0E060A020C040800, relocInfo::none);
   __ emit_data64(0x0F070B030D050901, relocInfo::none);
@@ -863,14 +986,23 @@ address StubGenerator::generate_vector_reverse_bit_lut() {
   __ emit_data64(0x0E060A020C040800, relocInfo::none);
   __ emit_data64(0x0F070B030D050901, relocInfo::none);
 
+  // record the stub entry and end
+  store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
 address StubGenerator::generate_vector_reverse_byte_perm_mask_long() {
-  __ align(CodeEntryAlignment);
   StubId stub_id = StubId::stubgen_vector_reverse_byte_perm_mask_long_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
+  __ align(CodeEntryAlignment);
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
 
   __ emit_data64(0x0001020304050607, relocInfo::none);
   __ emit_data64(0x08090A0B0C0D0E0F, relocInfo::none);
@@ -881,14 +1013,23 @@ address StubGenerator::generate_vector_reverse_byte_perm_mask_long() {
   __ emit_data64(0x0001020304050607, relocInfo::none);
   __ emit_data64(0x08090A0B0C0D0E0F, relocInfo::none);
 
+  // record the stub entry and end
+  store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
 address StubGenerator::generate_vector_reverse_byte_perm_mask_int() {
-  __ align(CodeEntryAlignment);
   StubId stub_id = StubId::stubgen_vector_reverse_byte_perm_mask_int_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
+  __ align(CodeEntryAlignment);
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
 
   __ emit_data64(0x0405060700010203, relocInfo::none);
   __ emit_data64(0x0C0D0E0F08090A0B, relocInfo::none);
@@ -899,14 +1040,23 @@ address StubGenerator::generate_vector_reverse_byte_perm_mask_int() {
   __ emit_data64(0x0405060700010203, relocInfo::none);
   __ emit_data64(0x0C0D0E0F08090A0B, relocInfo::none);
 
+  // record the stub entry and end
+  store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
 address StubGenerator::generate_vector_reverse_byte_perm_mask_short() {
-  __ align(CodeEntryAlignment);
   StubId stub_id = StubId::stubgen_vector_reverse_byte_perm_mask_short_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
+  __ align(CodeEntryAlignment);
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
 
   __ emit_data64(0x0607040502030001, relocInfo::none);
   __ emit_data64(0x0E0F0C0D0A0B0809, relocInfo::none);
@@ -917,31 +1067,52 @@ address StubGenerator::generate_vector_reverse_byte_perm_mask_short() {
   __ emit_data64(0x0607040502030001, relocInfo::none);
   __ emit_data64(0x0E0F0C0D0A0B0809, relocInfo::none);
 
+  // record the stub entry and end
+  store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
 address StubGenerator::generate_vector_byte_shuffle_mask() {
-  __ align(CodeEntryAlignment);
   StubId stub_id = StubId::stubgen_vector_byte_shuffle_mask_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
+  __ align(CodeEntryAlignment);
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
 
   __ emit_data64(0x7070707070707070, relocInfo::none);
   __ emit_data64(0x7070707070707070, relocInfo::none);
   __ emit_data64(0xF0F0F0F0F0F0F0F0, relocInfo::none);
   __ emit_data64(0xF0F0F0F0F0F0F0F0, relocInfo::none);
 
+  // record the stub entry and end
+  store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
 address StubGenerator::generate_fp_mask(StubId stub_id, int64_t mask) {
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
   __ align(CodeEntryAlignment);
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
 
   __ emit_data64( mask, relocInfo::none );
   __ emit_data64( mask, relocInfo::none );
 
+  // record the stub entry and end
+  store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
@@ -957,9 +1128,15 @@ address StubGenerator::generate_compress_perm_table(StubId stub_id) {
   default:
     ShouldNotReachHere();
   }
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
   __ align(CodeEntryAlignment);
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
   if (esize == 32) {
     // Loop to generate 256 x 8 int compression permute index table. A row is
     // accessed using 8 bit index computed using vector mask. An entry in
@@ -997,6 +1174,9 @@ address StubGenerator::generate_compress_perm_table(StubId stub_id) {
       }
     }
   }
+  // record the stub entry and end
+  store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
@@ -1012,9 +1192,15 @@ address StubGenerator::generate_expand_perm_table(StubId stub_id) {
   default:
     ShouldNotReachHere();
   }
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
   __ align(CodeEntryAlignment);
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
   if (esize == 32) {
     // Loop to generate 256 x 8 int expand permute index table. A row is accessed
     // using 8 bit index computed using vector mask. An entry in a row holds either
@@ -1050,13 +1236,22 @@ address StubGenerator::generate_expand_perm_table(StubId stub_id) {
       }
     }
   }
+  // record the stub entry and end
+  store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
 address StubGenerator::generate_vector_mask(StubId stub_id, int64_t mask) {
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
   __ align(CodeEntryAlignment);
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
 
   __ emit_data64(mask, relocInfo::none);
   __ emit_data64(mask, relocInfo::none);
@@ -1067,14 +1262,23 @@ address StubGenerator::generate_vector_mask(StubId stub_id, int64_t mask) {
   __ emit_data64(mask, relocInfo::none);
   __ emit_data64(mask, relocInfo::none);
 
+  // record the stub entry and end
+  store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
 address StubGenerator::generate_vector_byte_perm_mask() {
-  __ align(CodeEntryAlignment);
   StubId stub_id = StubId::stubgen_vector_byte_perm_mask_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
+  __ align(CodeEntryAlignment);
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
 
   __ emit_data64(0x0000000000000001, relocInfo::none);
   __ emit_data64(0x0000000000000003, relocInfo::none);
@@ -1085,13 +1289,22 @@ address StubGenerator::generate_vector_byte_perm_mask() {
   __ emit_data64(0x0000000000000004, relocInfo::none);
   __ emit_data64(0x0000000000000006, relocInfo::none);
 
+  // record the stub entry and end
+  store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
 address StubGenerator::generate_vector_fp_mask(StubId stub_id, int64_t mask) {
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
   __ align(CodeEntryAlignment);
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
 
   __ emit_data64(mask, relocInfo::none);
   __ emit_data64(mask, relocInfo::none);
@@ -1102,6 +1315,9 @@ address StubGenerator::generate_vector_fp_mask(StubId stub_id, int64_t mask) {
   __ emit_data64(mask, relocInfo::none);
   __ emit_data64(mask, relocInfo::none);
 
+  // record the stub entry and end
+  store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
@@ -1110,9 +1326,15 @@ address StubGenerator::generate_vector_custom_i32(StubId stub_id, Assembler::Avx
                                    int32_t val4, int32_t val5, int32_t val6, int32_t val7,
                                    int32_t val8, int32_t val9, int32_t val10, int32_t val11,
                                    int32_t val12, int32_t val13, int32_t val14, int32_t val15) {
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
   __ align(CodeEntryAlignment);
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
 
   assert(len != Assembler::AVX_NoVec, "vector len must be specified");
   __ emit_data(val0, relocInfo::none, 0);
@@ -1135,6 +1357,9 @@ address StubGenerator::generate_vector_custom_i32(StubId stub_id, Assembler::Avx
       __ emit_data(val15, relocInfo::none, 0);
     }
   }
+  // record the stub entry and end
+  store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
@@ -1156,8 +1381,14 @@ address StubGenerator::generate_vector_custom_i32(StubId stub_id, Assembler::Avx
 //  * = popped on exit
 address StubGenerator::generate_verify_oop() {
   StubId stub_id = StubId::stubgen_verify_oop_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
 
   Label exit, error;
 
@@ -1235,6 +1466,9 @@ address StubGenerator::generate_verify_oop() {
   __ call(RuntimeAddress(CAST_FROM_FN_PTR(address, MacroAssembler::debug64)));
   __ hlt();
 
+  // record the stub entry and end
+  store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
@@ -1350,35 +1584,46 @@ void StubGenerator::restore_argument_regs(BasicType type) {
 
 address StubGenerator::generate_data_cache_writeback() {
   const Register src        = c_rarg0;  // source address
-
-  __ align(CodeEntryAlignment);
-
   StubId stub_id = StubId::stubgen_data_cache_writeback_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
+  __ align(CodeEntryAlignment);
   StubCodeMark mark(this, stub_id);
 
-  address start = __ pc();
+  start = __ pc();
 
   __ enter();
   __ cache_wb(Address(src, 0));
   __ leave();
   __ ret(0);
 
+  // record the stub entry and end
+  store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
 address StubGenerator::generate_data_cache_writeback_sync() {
   const Register is_pre    = c_rarg0;  // pre or post sync
-
-  __ align(CodeEntryAlignment);
-
   StubId stub_id = StubId::stubgen_data_cache_writeback_sync_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
+  __ align(CodeEntryAlignment);
   StubCodeMark mark(this, stub_id);
 
   // pre wbsync is a no-op
   // post wbsync translates to an sfence
 
   Label skip;
-  address start = __ pc();
+  start = __ pc();
 
   __ enter();
   __ cmpl(is_pre, 0);
@@ -1388,6 +1633,9 @@ address StubGenerator::generate_data_cache_writeback_sync() {
   __ leave();
   __ ret(0);
 
+  // record the stub entry and end
+  store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
@@ -1405,9 +1653,15 @@ address StubGenerator::generate_md5_implCompress(StubId stub_id) {
   default:
     ShouldNotReachHere();
   }
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
   __ align(CodeEntryAlignment);
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
 
   const Register buf_param = r15;
   const Address state_param(rsp, 0 * wordSize);
@@ -1437,30 +1691,51 @@ address StubGenerator::generate_md5_implCompress(StubId stub_id) {
   __ leave();
   __ ret(0);
 
+  // record the stub entry and end
+  store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
 address StubGenerator::generate_upper_word_mask() {
-  __ align64();
   StubId stub_id = StubId::stubgen_upper_word_mask_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
+  __ align64();
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
 
   __ emit_data64(0x0000000000000000, relocInfo::none);
   __ emit_data64(0xFFFFFFFF00000000, relocInfo::none);
 
+  // record the stub entry and end
+  store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
 address StubGenerator::generate_shuffle_byte_flip_mask() {
-  __ align64();
   StubId stub_id = StubId::stubgen_shuffle_byte_flip_mask_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
+  __ align64();
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
 
   __ emit_data64(0x08090a0b0c0d0e0f, relocInfo::none);
   __ emit_data64(0x0001020304050607, relocInfo::none);
 
+  // record the stub entry and end
+  store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
@@ -1478,9 +1753,15 @@ address StubGenerator::generate_sha1_implCompress(StubId stub_id) {
   default:
     ShouldNotReachHere();
   }
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
   __ align(CodeEntryAlignment);
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
 
   Register buf = c_rarg0;
   Register state = c_rarg1;
@@ -1509,15 +1790,32 @@ address StubGenerator::generate_sha1_implCompress(StubId stub_id) {
   __ leave();
   __ ret(0);
 
+  // record the stub entry and end
+  store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
-address StubGenerator::generate_pshuffle_byte_flip_mask() {
-  __ align64();
+address StubGenerator::generate_pshuffle_byte_flip_mask(address& entry_00ba, address& entry_dc00) {
   StubId stub_id = StubId::stubgen_pshuffle_byte_flip_mask_id;
+  GrowableArray<address> entries;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 3, "sanity check");
+  address start = load_archive_data(stub_id, &entries);
+  if (start != nullptr) {
+    assert(entries.length() == entry_count - 1,
+           "unexpected extra entry count %d", entries.length());
+    entry_00ba = entries.at(0);
+    entry_dc00 = entries.at(1);
+    assert(VM_Version::supports_avx2() == (entry_00ba != nullptr && entry_dc00 != nullptr),
+           "entries cannot be null when avx2 is enabled");
+    return start;
+  }
+  __ align64();
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
-
+  start = __ pc();
+  address entry2 = nullptr;
+  address entry3 = nullptr;
   __ emit_data64(0x0405060700010203, relocInfo::none);
   __ emit_data64(0x0c0d0e0f08090a0b, relocInfo::none);
 
@@ -1525,37 +1823,66 @@ address StubGenerator::generate_pshuffle_byte_flip_mask() {
     __ emit_data64(0x0405060700010203, relocInfo::none); // second copy
     __ emit_data64(0x0c0d0e0f08090a0b, relocInfo::none);
     // _SHUF_00BA
+    entry2 = __ pc();
     __ emit_data64(0x0b0a090803020100, relocInfo::none);
     __ emit_data64(0xFFFFFFFFFFFFFFFF, relocInfo::none);
     __ emit_data64(0x0b0a090803020100, relocInfo::none);
     __ emit_data64(0xFFFFFFFFFFFFFFFF, relocInfo::none);
     // _SHUF_DC00
+    entry3 = __ pc();
     __ emit_data64(0xFFFFFFFFFFFFFFFF, relocInfo::none);
     __ emit_data64(0x0b0a090803020100, relocInfo::none);
     __ emit_data64(0xFFFFFFFFFFFFFFFF, relocInfo::none);
     __ emit_data64(0x0b0a090803020100, relocInfo::none);
   }
+  // have to track the 2nd and 3rd entries even if they are null
+  entry_00ba = entry2;
+  entries.push(entry_00ba);
+  entry_dc00 = entry3;
+  entries.push(entry_dc00);
+
+  // record the stub entry and end plus all the auxiliary entries
+  store_archive_data(stub_id, start, __ pc(), &entries);
 
   return start;
 }
 
 //Mask for byte-swapping a couple of qwords in an XMM register using (v)pshufb.
-address StubGenerator::generate_pshuffle_byte_flip_mask_sha512() {
-  __ align32();
+address StubGenerator::generate_pshuffle_byte_flip_mask_sha512(address& entry_ymm_lo) {
   StubId stub_id = StubId::stubgen_pshuffle_byte_flip_mask_sha512_id;
+  GrowableArray<address> entries;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 2, "sanity check");
+  address start = load_archive_data(stub_id, &entries);
+  if (start != nullptr) {
+    assert(entries.length() == entry_count - 1,
+           "unexpected extra entry count %d", entries.length());
+    entry_ymm_lo = entries.at(0);
+    assert(VM_Version::supports_avx2() == (entry_ymm_lo != nullptr),
+           "entry cannot be null when avx2 is enabled");
+    return start;
+  }
+  __ align32();
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
-
+  start = __ pc();
+  address entry2 = nullptr;
   if (VM_Version::supports_avx2()) {
     __ emit_data64(0x0001020304050607, relocInfo::none); // PSHUFFLE_BYTE_FLIP_MASK
     __ emit_data64(0x08090a0b0c0d0e0f, relocInfo::none);
     __ emit_data64(0x1011121314151617, relocInfo::none);
     __ emit_data64(0x18191a1b1c1d1e1f, relocInfo::none);
+    // capture 2nd entry
+    entry2 = __ pc();
     __ emit_data64(0x0000000000000000, relocInfo::none); //MASK_YMM_LO
     __ emit_data64(0x0000000000000000, relocInfo::none);
     __ emit_data64(0xFFFFFFFFFFFFFFFF, relocInfo::none);
     __ emit_data64(0xFFFFFFFFFFFFFFFF, relocInfo::none);
   }
+  // have to track the 2nd entry even if it is null
+  entry_ymm_lo = entry2;
+  entries.push(entry2);
+  // record the stub entry and end
+  store_archive_data(stub_id, start, __ pc(), &entries);
 
   return start;
 }
@@ -1575,9 +1902,15 @@ address StubGenerator::generate_sha256_implCompress(StubId stub_id) {
     ShouldNotReachHere();
   }
   assert(VM_Version::supports_sha() || VM_Version::supports_avx2(), "");
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
   __ align(CodeEntryAlignment);
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
 
   Register buf = c_rarg0;
   Register state = c_rarg1;
@@ -1612,6 +1945,9 @@ address StubGenerator::generate_sha256_implCompress(StubId stub_id) {
   __ leave();
   __ ret(0);
 
+  // record the stub entry and end
+  store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
@@ -1629,9 +1965,15 @@ address StubGenerator::generate_sha512_implCompress(StubId stub_id) {
   }
   assert(VM_Version::supports_avx2(), "");
   assert(VM_Version::supports_bmi2() || VM_Version::supports_sha512(), "");
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
   __ align(CodeEntryAlignment);
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
 
   Register buf = c_rarg0;
   Register state = c_rarg1;
@@ -1660,14 +2002,23 @@ address StubGenerator::generate_sha512_implCompress(StubId stub_id) {
   __ leave();
   __ ret(0);
 
+  // record the stub entry and end
+  store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
 address StubGenerator::base64_shuffle_addr() {
-  __ align64();
   StubId stub_id = StubId::stubgen_shuffle_base64_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
+  __ align64();
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
 
   assert(((unsigned long long)start & 0x3f) == 0,
          "Alignment problem (0x%08llx)", (unsigned long long)start);
@@ -1680,42 +2031,69 @@ address StubGenerator::base64_shuffle_addr() {
   __ emit_data64(0x2829272825262425, relocInfo::none);
   __ emit_data64(0x2e2f2d2e2b2c2a2b, relocInfo::none);
 
+  // record the stub entry and end
+  store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
 address StubGenerator::base64_avx2_shuffle_addr() {
-  __ align32();
   StubId stub_id = StubId::stubgen_avx2_shuffle_base64_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
+  __ align32();
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
 
   __ emit_data64(0x0809070805060405, relocInfo::none);
   __ emit_data64(0x0e0f0d0e0b0c0a0b, relocInfo::none);
   __ emit_data64(0x0405030401020001, relocInfo::none);
   __ emit_data64(0x0a0b090a07080607, relocInfo::none);
 
+  // record the stub entry and end
+  store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
 address StubGenerator::base64_avx2_input_mask_addr() {
-  __ align32();
   StubId stub_id = StubId::stubgen_avx2_input_mask_base64_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
+  __ align32();
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
 
   __ emit_data64(0x8000000000000000, relocInfo::none);
   __ emit_data64(0x8000000080000000, relocInfo::none);
   __ emit_data64(0x8000000080000000, relocInfo::none);
   __ emit_data64(0x8000000080000000, relocInfo::none);
 
+  // record the stub entry and end
+  store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
 address StubGenerator::base64_avx2_lut_addr() {
-  __ align32();
   StubId stub_id = StubId::stubgen_avx2_lut_base64_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
+  __ align32();
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
 
   __ emit_data64(0xfcfcfcfcfcfc4741, relocInfo::none);
   __ emit_data64(0x0000f0edfcfcfcfc, relocInfo::none);
@@ -1728,14 +2106,23 @@ address StubGenerator::base64_avx2_lut_addr() {
   __ emit_data64(0xfcfcfcfcfcfc4741, relocInfo::none);
   __ emit_data64(0x000020effcfcfcfc, relocInfo::none);
 
+  // record the stub entry and end
+  store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
 address StubGenerator::base64_encoding_table_addr() {
-  __ align64();
   StubId stub_id = StubId::stubgen_encoding_table_base64_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
+  __ align64();
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
 
   assert(((unsigned long long)start & 0x3f) == 0, "Alignment problem (0x%08llx)", (unsigned long long)start);
   __ emit_data64(0x4847464544434241, relocInfo::none);
@@ -1757,6 +2144,9 @@ address StubGenerator::base64_encoding_table_addr() {
   __ emit_data64(0x333231307a797877, relocInfo::none);
   __ emit_data64(0x5f2d393837363534, relocInfo::none);
 
+  // record the stub entry and end
+  store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
@@ -1766,10 +2156,16 @@ address StubGenerator::base64_encoding_table_addr() {
 // boolean isURL) {
 address StubGenerator::generate_base64_encodeBlock()
 {
-  __ align(CodeEntryAlignment);
   StubId stub_id = StubId::stubgen_base64_encodeBlock_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
+  __ align(CodeEntryAlignment);
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
 
   __ enter();
 
@@ -2144,15 +2540,24 @@ address StubGenerator::generate_base64_encodeBlock()
   __ leave();
   __ ret(0);
 
+  // record the stub entry and end
+  store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
 // base64 AVX512vbmi tables
 address StubGenerator::base64_vbmi_lookup_lo_addr() {
-  __ align64();
   StubId stub_id = StubId::stubgen_lookup_lo_base64_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
+  __ align64();
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
 
   assert(((unsigned long long)start & 0x3f) == 0,
          "Alignment problem (0x%08llx)", (unsigned long long)start);
@@ -2165,14 +2570,23 @@ address StubGenerator::base64_vbmi_lookup_lo_addr() {
   __ emit_data64(0x3b3a393837363534, relocInfo::none);
   __ emit_data64(0x8080808080803d3c, relocInfo::none);
 
+  // record the stub entry and end
+  store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
 address StubGenerator::base64_vbmi_lookup_hi_addr() {
-  __ align64();
   StubId stub_id = StubId::stubgen_lookup_hi_base64_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
+  __ align64();
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
 
   assert(((unsigned long long)start & 0x3f) == 0,
          "Alignment problem (0x%08llx)", (unsigned long long)start);
@@ -2185,13 +2599,22 @@ address StubGenerator::base64_vbmi_lookup_hi_addr() {
   __ emit_data64(0x302f2e2d2c2b2a29, relocInfo::none);
   __ emit_data64(0x8080808080333231, relocInfo::none);
 
+  // record the stub entry and end
+  store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 address StubGenerator::base64_vbmi_lookup_lo_url_addr() {
-  __ align64();
   StubId stub_id = StubId::stubgen_lookup_lo_base64url_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
+  __ align64();
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
 
   assert(((unsigned long long)start & 0x3f) == 0,
          "Alignment problem (0x%08llx)", (unsigned long long)start);
@@ -2204,14 +2627,23 @@ address StubGenerator::base64_vbmi_lookup_lo_url_addr() {
   __ emit_data64(0x3b3a393837363534, relocInfo::none);
   __ emit_data64(0x8080808080803d3c, relocInfo::none);
 
+  // record the stub entry and end
+  store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
 address StubGenerator::base64_vbmi_lookup_hi_url_addr() {
-  __ align64();
   StubId stub_id = StubId::stubgen_lookup_hi_base64url_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
+  __ align64();
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
 
   assert(((unsigned long long)start & 0x3f) == 0,
          "Alignment problem (0x%08llx)", (unsigned long long)start);
@@ -2224,14 +2656,23 @@ address StubGenerator::base64_vbmi_lookup_hi_url_addr() {
   __ emit_data64(0x302f2e2d2c2b2a29, relocInfo::none);
   __ emit_data64(0x8080808080333231, relocInfo::none);
 
+  // record the stub entry and end
+  store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
 address StubGenerator::base64_vbmi_pack_vec_addr() {
-  __ align64();
   StubId stub_id = StubId::stubgen_pack_vec_base64_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
+  __ align64();
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
 
   assert(((unsigned long long)start & 0x3f) == 0,
          "Alignment problem (0x%08llx)", (unsigned long long)start);
@@ -2244,14 +2685,23 @@ address StubGenerator::base64_vbmi_pack_vec_addr() {
   __ emit_data64(0x0000000000000000, relocInfo::none);
   __ emit_data64(0x0000000000000000, relocInfo::none);
 
+  // record the stub entry and end
+  store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
 address StubGenerator::base64_vbmi_join_0_1_addr() {
-  __ align64();
   StubId stub_id = StubId::stubgen_join_0_1_base64_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
+  __ align64();
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
 
   assert(((unsigned long long)start & 0x3f) == 0,
          "Alignment problem (0x%08llx)", (unsigned long long)start);
@@ -2264,14 +2714,23 @@ address StubGenerator::base64_vbmi_join_0_1_addr() {
   __ emit_data64(0x494a444546404142, relocInfo::none);
   __ emit_data64(0x565051524c4d4e48, relocInfo::none);
 
+  // record the stub entry and end
+  store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
 address StubGenerator::base64_vbmi_join_1_2_addr() {
-  __ align64();
   StubId stub_id = StubId::stubgen_join_1_2_base64_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
+  __ align64();
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
 
   assert(((unsigned long long)start & 0x3f) == 0,
          "Alignment problem (0x%08llx)", (unsigned long long)start);
@@ -2284,14 +2743,23 @@ address StubGenerator::base64_vbmi_join_1_2_addr() {
   __ emit_data64(0x5c5d5e58595a5455, relocInfo::none);
   __ emit_data64(0x696a646566606162, relocInfo::none);
 
+  // record the stub entry and end
+  store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
 address StubGenerator::base64_vbmi_join_2_3_addr() {
-  __ align64();
   StubId stub_id = StubId::stubgen_join_2_3_base64_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
+  __ align64();
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
 
   assert(((unsigned long long)start & 0x3f) == 0,
          "Alignment problem (0x%08llx)", (unsigned long long)start);
@@ -2304,14 +2772,23 @@ address StubGenerator::base64_vbmi_join_2_3_addr() {
   __ emit_data64(0x767071726c6d6e68, relocInfo::none);
   __ emit_data64(0x7c7d7e78797a7475, relocInfo::none);
 
+  // record the stub entry and end
+  store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
 address StubGenerator::base64_AVX2_decode_tables_addr() {
-  __ align64();
   StubId stub_id = StubId::stubgen_avx2_decode_tables_base64_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
+  __ align64();
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
 
   assert(((unsigned long long)start & 0x3f) == 0,
          "Alignment problem (0x%08llx)", (unsigned long long)start);
@@ -2339,14 +2816,23 @@ address StubGenerator::base64_AVX2_decode_tables_addr() {
   // merge multiplier
   __ emit_data(0x00011000, relocInfo::none, 0);
 
+  // record the stub entry and end
+  store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
 address StubGenerator::base64_AVX2_decode_LUT_tables_addr() {
-  __ align64();
   StubId stub_id = StubId::stubgen_avx2_decode_lut_tables_base64_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
+  __ align64();
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
 
   assert(((unsigned long long)start & 0x3f) == 0,
          "Alignment problem (0x%08llx)", (unsigned long long)start);
@@ -2380,13 +2866,22 @@ address StubGenerator::base64_AVX2_decode_LUT_tables_addr() {
   __ emit_data64(0x0804080402011010, relocInfo::none);
   __ emit_data64(0x1010101010101010, relocInfo::none);
 
+  // record the stub entry and end
+  store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
 address StubGenerator::base64_decoding_table_addr() {
   StubId stub_id = StubId::stubgen_decoding_table_base64_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
 
   __ emit_data64(0xffffffffffffffff, relocInfo::none);
   __ emit_data64(0xffffffffffffffff, relocInfo::none);
@@ -2455,6 +2950,9 @@ address StubGenerator::base64_decoding_table_addr() {
   __ emit_data64(0xffffffffffffffff, relocInfo::none);
   __ emit_data64(0xffffffffffffffff, relocInfo::none);
 
+  // record the stub entry and end
+  store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
@@ -2466,10 +2964,16 @@ address StubGenerator::base64_decoding_table_addr() {
 // Intrinsic function prototype in Base64.java:
 // private void decodeBlock(byte[] src, int sp, int sl, byte[] dst, int dp, boolean isURL, isMIME) {
 address StubGenerator::generate_base64_decodeBlock() {
-  __ align(CodeEntryAlignment);
   StubId stub_id = StubId::stubgen_base64_decodeBlock_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
+  __ align(CodeEntryAlignment);
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
 
   __ enter();
 
@@ -2982,6 +3486,9 @@ address StubGenerator::generate_base64_decodeBlock() {
   __ leave();
   __ ret(0);
 
+  // record the stub entry and end
+  store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
@@ -3000,11 +3507,17 @@ address StubGenerator::generate_base64_decodeBlock() {
 address StubGenerator::generate_updateBytesCRC32() {
   assert(UseCRC32Intrinsics, "need AVX and CLMUL instructions");
 
-  __ align(CodeEntryAlignment);
   StubId stub_id = StubId::stubgen_updateBytesCRC32_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
+  __ align(CodeEntryAlignment);
   StubCodeMark mark(this, stub_id);
 
-  address start = __ pc();
+  start = __ pc();
 
   // Win64: rcx, rdx, r8, r9 (c_rarg0, c_rarg1, ...)
   // Unix:  rdi, rsi, rdx, rcx, r8, r9 (c_rarg0, c_rarg1, ...)
@@ -3039,6 +3552,9 @@ address StubGenerator::generate_updateBytesCRC32() {
   __ leave(); // required for proper stackwalking of RuntimeStub frame
   __ ret(0);
 
+  // record the stub entry and end
+  store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
@@ -3057,10 +3573,16 @@ address StubGenerator::generate_updateBytesCRC32() {
 */
 address StubGenerator::generate_updateBytesCRC32C(bool is_pclmulqdq_supported) {
   assert(UseCRC32CIntrinsics, "need SSE4_2");
-  __ align(CodeEntryAlignment);
   StubId stub_id = StubId::stubgen_updateBytesCRC32C_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
+  __ align(CodeEntryAlignment);
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
 
   //reg.arg        int#0        int#1        int#2        int#3        int#4        int#5        float regs
   //Windows        RCX          RDX          R8           R9           none         none         XMM0..XMM3
@@ -3120,6 +3642,9 @@ address StubGenerator::generate_updateBytesCRC32C(bool is_pclmulqdq_supported) {
   __ leave(); // required for proper stackwalking of RuntimeStub frame
   __ ret(0);
 
+  // record the stub entry and end
+  store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
@@ -3138,10 +3663,16 @@ address StubGenerator::generate_updateBytesCRC32C(bool is_pclmulqdq_supported) {
  *    rsp+40    - z address
  */
 address StubGenerator::generate_multiplyToLen() {
-  __ align(CodeEntryAlignment);
   StubId stub_id = StubId::stubgen_multiplyToLen_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
+  __ align(CodeEntryAlignment);
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
 
   // Win64: rcx, rdx, r8, r9 (c_rarg0, c_rarg1, ...)
   // Unix:  rdi, rsi, rdx, rcx, r8, r9 (c_rarg0, c_rarg1, ...)
@@ -3179,6 +3710,9 @@ address StubGenerator::generate_multiplyToLen() {
   __ leave(); // required for proper stackwalking of RuntimeStub frame
   __ ret(0);
 
+  // record the stub entry and end
+  store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
@@ -3195,10 +3729,16 @@ address StubGenerator::generate_multiplyToLen() {
 *        rax   - int >= mismatched index, < 0 bitwise complement of tail
 */
 address StubGenerator::generate_vectorizedMismatch() {
-  __ align(CodeEntryAlignment);
   StubId stub_id = StubId::stubgen_vectorizedMismatch_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
+  __ align(CodeEntryAlignment);
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
 
   BLOCK_COMMENT("Entry:");
   __ enter();
@@ -3232,6 +3772,9 @@ address StubGenerator::generate_vectorizedMismatch() {
   __ leave();
   __ ret(0);
 
+  // record the stub entry and end
+  store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
@@ -3247,10 +3790,16 @@ address StubGenerator::generate_vectorizedMismatch() {
  */
 address StubGenerator::generate_squareToLen() {
 
-  __ align(CodeEntryAlignment);
   StubId stub_id = StubId::stubgen_squareToLen_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
+  __ align(CodeEntryAlignment);
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
 
   // Win64: rcx, rdx, r8, r9 (c_rarg0, c_rarg1, ...)
   // Unix:  rdi, rsi, rdx, rcx (c_rarg0, c_rarg1, ...)
@@ -3279,14 +3828,23 @@ address StubGenerator::generate_squareToLen() {
   __ leave(); // required for proper stackwalking of RuntimeStub frame
   __ ret(0);
 
+  // record the stub entry and end
+  store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
 address StubGenerator::generate_method_entry_barrier() {
-  __ align(CodeEntryAlignment);
   StubId stub_id = StubId::stubgen_method_entry_barrier_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
+  __ align(CodeEntryAlignment);
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
 
   Label deoptimize_label;
 
@@ -3356,6 +3914,9 @@ address StubGenerator::generate_method_entry_barrier() {
   __ movptr(rsp, Address(rsp, 0)); // new rsp was written in the barrier
   __ jmp(Address(rsp, -1 * wordSize)); // jmp target should be callers verified_entry_point
 
+  // record the stub entry and end
+  store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
@@ -3373,10 +3934,16 @@ address StubGenerator::generate_method_entry_barrier() {
  *    rsp+40    - k
  */
 address StubGenerator::generate_mulAdd() {
-  __ align(CodeEntryAlignment);
   StubId stub_id = StubId::stubgen_mulAdd_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
+  __ align(CodeEntryAlignment);
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
 
   // Win64: rcx, rdx, r8, r9 (c_rarg0, c_rarg1, ...)
   // Unix:  rdi, rsi, rdx, rcx, r8, r9 (c_rarg0, c_rarg1, ...)
@@ -3411,14 +3978,23 @@ address StubGenerator::generate_mulAdd() {
   __ leave(); // required for proper stackwalking of RuntimeStub frame
   __ ret(0);
 
+  // record the stub entry and end
+  store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
 address StubGenerator::generate_bigIntegerRightShift() {
-  __ align(CodeEntryAlignment);
   StubId stub_id = StubId::stubgen_bigIntegerRightShiftWorker_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
+  __ align(CodeEntryAlignment);
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
 
   Label Shift512Loop, ShiftTwo, ShiftTwoLoop, ShiftOne, Exit;
   // For Unix, the arguments are as follows: rdi, rsi, rdx, rcx, r8.
@@ -3534,6 +4110,9 @@ address StubGenerator::generate_bigIntegerRightShift() {
   __ leave(); // required for proper stackwalking of RuntimeStub frame
   __ ret(0);
 
+  // record the stub entry and end
+  store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
@@ -3551,10 +4130,16 @@ address StubGenerator::generate_bigIntegerRightShift() {
  *    rsp40    - numIter
  */
 address StubGenerator::generate_bigIntegerLeftShift() {
-  __ align(CodeEntryAlignment);
   StubId stub_id = StubId::stubgen_bigIntegerLeftShiftWorker_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
+  __ align(CodeEntryAlignment);
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
 
   Label Shift512Loop, ShiftTwo, ShiftTwoLoop, ShiftOne, Exit;
   // For Unix, the arguments are as follows: rdi, rsi, rdx, rcx, r8.
@@ -3659,6 +4244,9 @@ address StubGenerator::generate_bigIntegerLeftShift() {
   __ leave(); // required for proper stackwalking of RuntimeStub frame
   __ ret(0);
 
+  // record the stub entry and end
+  store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
@@ -3708,9 +4296,15 @@ void StubGenerator::generate_libm_stubs() {
 */
 address StubGenerator::generate_float16ToFloat() {
   StubId stub_id = StubId::stubgen_hf2f_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
   StubCodeMark mark(this, stub_id);
 
-  address start = __ pc();
+  start = __ pc();
 
   BLOCK_COMMENT("Entry:");
   // No need for RuntimeStub frame since it is called only during JIT compilation
@@ -3720,6 +4314,9 @@ address StubGenerator::generate_float16ToFloat() {
 
   __ ret(0);
 
+  // record the stub entry and end
+  store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
@@ -3734,9 +4331,15 @@ address StubGenerator::generate_float16ToFloat() {
 */
 address StubGenerator::generate_floatToFloat16() {
   StubId stub_id = StubId::stubgen_f2hf_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
   StubCodeMark mark(this, stub_id);
 
-  address start = __ pc();
+  start = __ pc();
 
   BLOCK_COMMENT("Entry:");
   // No need for RuntimeStub frame since it is called only during JIT compilation
@@ -3746,6 +4349,9 @@ address StubGenerator::generate_floatToFloat16() {
 
   __ ret(0);
 
+  // record the stub entry and end
+  store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
@@ -3775,8 +4381,14 @@ address StubGenerator::generate_cont_thaw(StubId stub_id) {
   default:
     ShouldNotReachHere();
   }
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
 
   // TODO: Handle Valhalla return types. May require generating different return barriers.
 
@@ -3889,6 +4501,9 @@ address StubGenerator::generate_cont_thaw(StubId stub_id) {
     __ ret(0);
   }
 
+  // record the stub entry and end
+  store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
@@ -3909,8 +4524,14 @@ address StubGenerator::generate_cont_returnBarrier_exception() {
 address StubGenerator::generate_cont_preempt_stub() {
   if (!Continuations::enabled()) return nullptr;
   StubId stub_id = StubId::stubgen_cont_preempt_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
 
   __ reset_last_Java_frame(true);
 
@@ -3934,14 +4555,23 @@ address StubGenerator::generate_cont_preempt_stub() {
   __ movptr(rscratch1, ExternalAddress(ContinuationEntry::thaw_call_pc_address()));
   __ jmp(rscratch1);
 
+  // record the stub entry and end
+  store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
 // exception handler for upcall stubs
 address StubGenerator::generate_upcall_stub_exception_handler() {
   StubId stub_id = StubId::stubgen_upcall_stub_exception_handler_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
 
   // native caller has no idea how to handle exceptions
   // we just crash here. Up to callee to catch exceptions.
@@ -3953,6 +4583,9 @@ address StubGenerator::generate_upcall_stub_exception_handler() {
   __ call(RuntimeAddress(CAST_FROM_FN_PTR(address, UpcallLinker::handle_uncaught_exception)));
   __ should_not_reach_here();
 
+  // record the stub entry and end
+  store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
@@ -3961,8 +4594,14 @@ address StubGenerator::generate_upcall_stub_exception_handler() {
 // rbx = result
 address StubGenerator::generate_upcall_stub_load_target() {
   StubId stub_id = StubId::stubgen_upcall_stub_load_target_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
 
   __ resolve_global_jobject(j_rarg0, rscratch1);
     // Load target method from receiver
@@ -3976,11 +4615,27 @@ address StubGenerator::generate_upcall_stub_load_target() {
 
   __ ret(0);
 
+  // record the stub entry and end
+  store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
 void StubGenerator::generate_lookup_secondary_supers_table_stub() {
   StubId stub_id = StubId::stubgen_lookup_secondary_supers_table_id;
+  GrowableArray<address> entries;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == Klass::SECONDARY_SUPERS_TABLE_SIZE, "sanity check");
+  address start = load_archive_data(stub_id, &entries);
+  if (start != nullptr) {
+    assert(entries.length() == Klass::SECONDARY_SUPERS_TABLE_SIZE - 1,
+           "unexpected extra entry count %d", entries.length());
+    StubRoutines::_lookup_secondary_supers_table_stubs[0] = start;
+    for (int slot = 1; slot < Klass::SECONDARY_SUPERS_TABLE_SIZE; slot++) {
+      StubRoutines::_lookup_secondary_supers_table_stubs[slot] = entries.at(slot - 1);
+    }
+    return;
+  }
   StubCodeMark mark(this, stub_id);
 
   const Register
@@ -3989,21 +4644,35 @@ void StubGenerator::generate_lookup_secondary_supers_table_stub() {
       result        = rdi;
 
   for (int slot = 0; slot < Klass::SECONDARY_SUPERS_TABLE_SIZE; slot++) {
-    StubRoutines::_lookup_secondary_supers_table_stubs[slot] = __ pc();
+    address next_entry = __ pc();
+    if (slot == 0) {
+      start = next_entry;
+    } else {
+      entries.append(next_entry);
+    }
+    StubRoutines::_lookup_secondary_supers_table_stubs[slot] = next_entry;
     __ lookup_secondary_supers_table_const(r_sub_klass, r_super_klass,
                                            rdx, rcx, rbx, r11, // temps
                                            result,
                                            slot);
     __ ret(0);
   }
+
+  // record the stub entry and end plus all the auxiliary entries
+  store_archive_data(stub_id, start, __ pc(), &entries);
 }
 
 // Slow path implementation for UseSecondarySupersTable.
 address StubGenerator::generate_lookup_secondary_supers_table_slow_path_stub() {
   StubId stub_id = StubId::stubgen_lookup_secondary_supers_table_slow_path_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
   StubCodeMark mark(this, stub_id);
-
-  address start = __ pc();
+  start = __ pc();
 
   const Register
       r_super_klass  = rax,
@@ -4025,6 +4694,9 @@ address StubGenerator::generate_lookup_secondary_supers_table_slow_path_stub() {
   __ movl(result, 0);
   __ ret(0);
 
+  // record the stub entry and end
+  store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
@@ -4232,6 +4904,8 @@ void StubGenerator::generate_compiler_stubs() {
   }
 
   if (UseSHA256Intrinsics) {
+    address entry2 = nullptr;
+    address entry3 = nullptr;
     StubRoutines::x86::_k256_adr = (address)StubRoutines::x86::_k256;
     char* dst = (char*)StubRoutines::x86::_k256_W;
     char* src = (char*)StubRoutines::x86::_k256;
@@ -4240,14 +4914,18 @@ void StubGenerator::generate_compiler_stubs() {
       memcpy(dst + 32 * ii + 16, src + 16 * ii, 16);
     }
     StubRoutines::x86::_k256_W_adr = (address)StubRoutines::x86::_k256_W;
-    StubRoutines::x86::_pshuffle_byte_flip_mask_addr = generate_pshuffle_byte_flip_mask();
+    StubRoutines::x86::_pshuffle_byte_flip_mask_addr = generate_pshuffle_byte_flip_mask(entry2, entry3);
+    StubRoutines::x86::_pshuffle_byte_flip_mask_00ba_addr = entry2;
+    StubRoutines::x86::_pshuffle_byte_flip_mask_dc00_addr = entry3;
     StubRoutines::_sha256_implCompress = generate_sha256_implCompress(StubId::stubgen_sha256_implCompress_id);
     StubRoutines::_sha256_implCompressMB = generate_sha256_implCompress(StubId::stubgen_sha256_implCompressMB_id);
   }
 
   if (UseSHA512Intrinsics) {
+    address entry2 = nullptr;
     StubRoutines::x86::_k512_W_addr = (address)StubRoutines::x86::_k512_W;
-    StubRoutines::x86::_pshuffle_byte_flip_mask_addr_sha512 = generate_pshuffle_byte_flip_mask_sha512();
+    StubRoutines::x86::_pshuffle_byte_flip_mask_addr_sha512 = generate_pshuffle_byte_flip_mask_sha512(entry2);
+    StubRoutines::x86::_pshuffle_byte_flip_mask_ymm_lo_addr_sha512 = entry2;
     StubRoutines::_sha512_implCompress = generate_sha512_implCompress(StubId::stubgen_sha512_implCompress_id);
     StubRoutines::_sha512_implCompressMB = generate_sha512_implCompress(StubId::stubgen_sha512_implCompressMB_id);
   }
@@ -4325,7 +5003,7 @@ void StubGenerator::generate_compiler_stubs() {
 #endif // COMPILER2_OR_JVMCI
 }
 
-StubGenerator::StubGenerator(CodeBuffer* code, BlobId blob_id) : StubCodeGenerator(code, blob_id) {
+StubGenerator::StubGenerator(CodeBuffer* code, BlobId blob_id, AOTStubData* stub_data) : StubCodeGenerator(code, blob_id, stub_data) {
   switch(blob_id) {
   case BlobId::stubgen_preuniverse_id:
     generate_preuniverse_stubs();
@@ -4348,8 +5026,35 @@ StubGenerator::StubGenerator(CodeBuffer* code, BlobId blob_id) : StubCodeGenerat
   };
 }
 
-void StubGenerator_generate(CodeBuffer* code, BlobId blob_id) {
-  StubGenerator g(code, blob_id);
+#if INCLUDE_CDS
+// publish addresses of static data defined in this file and in other
+// stubgen stub generator files
+void StubGenerator::init_AOTAddressTable(GrowableArray<address>& external_addresses) {
+  init_AOTAddressTable_adler(external_addresses);
+  init_AOTAddressTable_aes(external_addresses);
+  init_AOTAddressTable_cbrt(external_addresses);
+  init_AOTAddressTable_chacha(external_addresses);
+  // constants publishes for all of address use by cos and almost all of sin
+  init_AOTAddressTable_constants(external_addresses);
+  init_AOTAddressTable_dilithium(external_addresses);
+  init_AOTAddressTable_exp(external_addresses);
+  init_AOTAddressTable_fmod(external_addresses);
+  init_AOTAddressTable_ghash(external_addresses);
+  init_AOTAddressTable_kyber(external_addresses);
+  init_AOTAddressTable_log(external_addresses);
+  init_AOTAddressTable_poly1305(external_addresses);
+  init_AOTAddressTable_poly_mont(external_addresses);
+  init_AOTAddressTable_pow(external_addresses);
+  init_AOTAddressTable_sha3(external_addresses);
+  init_AOTAddressTable_sin(external_addresses);
+  init_AOTAddressTable_sinh(external_addresses);
+  init_AOTAddressTable_tan(external_addresses);
+  init_AOTAddressTable_tanh(external_addresses);
+}
+#endif // INCLUDE_CDS
+
+void StubGenerator_generate(CodeBuffer* code, BlobId blob_id, AOTStubData* stub_data) {
+  StubGenerator g(code, blob_id, stub_data);
 }
 
 #undef __
diff --git a/src/hotspot/cpu/x86/stubGenerator_x86_64.hpp b/src/hotspot/cpu/x86/stubGenerator_x86_64.hpp
index 332add6dcd4..05e8384d636 100644
--- a/src/hotspot/cpu/x86/stubGenerator_x86_64.hpp
+++ b/src/hotspot/cpu/x86/stubGenerator_x86_64.hpp
@@ -303,11 +303,11 @@ class StubGenerator: public StubCodeGenerator {
   address generate_sha512_implCompress(StubId stub_id);
 
   // Mask for byte-swapping a couple of qwords in an XMM register using (v)pshufb.
-  address generate_pshuffle_byte_flip_mask_sha512();
+  address generate_pshuffle_byte_flip_mask_sha512(address& entry_ymm_lo);
 
   address generate_upper_word_mask();
   address generate_shuffle_byte_flip_mask();
-  address generate_pshuffle_byte_flip_mask();
+  address generate_pshuffle_byte_flip_mask(address& entry_00ba, address& entry_dc0);
 
 
   // AES intrinsic stubs
@@ -650,8 +650,33 @@ class StubGenerator: public StubCodeGenerator {
   void generate_compiler_stubs();
   void generate_final_stubs();
 
+#if INCLUDE_CDS
+  static void init_AOTAddressTable_adler(GrowableArray<address>& external_addresses);
+  static void init_AOTAddressTable_aes(GrowableArray<address>& external_addresses);
+  static void init_AOTAddressTable_cbrt(GrowableArray<address>& external_addresses);
+  static void init_AOTAddressTable_chacha(GrowableArray<address>& external_addresses);
+  static void init_AOTAddressTable_constants(GrowableArray<address>& external_addresses);
+  static void init_AOTAddressTable_dilithium(GrowableArray<address>& external_addresses);
+  static void init_AOTAddressTable_exp(GrowableArray<address>& external_addresses);
+  static void init_AOTAddressTable_fmod(GrowableArray<address>& external_addresses);
+  static void init_AOTAddressTable_ghash(GrowableArray<address>& external_addresses);
+  static void init_AOTAddressTable_kyber(GrowableArray<address>& external_addresses);
+  static void init_AOTAddressTable_log(GrowableArray<address>& external_addresses);
+  static void init_AOTAddressTable_poly1305(GrowableArray<address>& external_addresses);
+  static void init_AOTAddressTable_poly_mont(GrowableArray<address>& external_addresses);
+  static void init_AOTAddressTable_pow(GrowableArray<address>& external_addresses);
+  static void init_AOTAddressTable_sha3(GrowableArray<address>& external_addresses);
+  static void init_AOTAddressTable_sin(GrowableArray<address>& external_addresses);
+  static void init_AOTAddressTable_sinh(GrowableArray<address>& external_addresses);
+  static void init_AOTAddressTable_tan(GrowableArray<address>& external_addresses);
+  static void init_AOTAddressTable_tanh(GrowableArray<address>& external_addresses);
+#endif // INCLUDE_CDS
+
 public:
-  StubGenerator(CodeBuffer* code, BlobId blob_id);
+  StubGenerator(CodeBuffer* code, BlobId blob_id, AOTStubData* stub_data);
+#if INCLUDE_CDS
+  static void init_AOTAddressTable(GrowableArray<address>& external_addresses);
+#endif // INCLUDE_CDS
 };
 
 #endif // CPU_X86_STUBGENERATOR_X86_64_HPP
diff --git a/src/hotspot/cpu/x86/stubGenerator_x86_64_adler.cpp b/src/hotspot/cpu/x86/stubGenerator_x86_64_adler.cpp
index 1d3e7afde1d..a9424978e0e 100644
--- a/src/hotspot/cpu/x86/stubGenerator_x86_64_adler.cpp
+++ b/src/hotspot/cpu/x86/stubGenerator_x86_64_adler.cpp
@@ -67,8 +67,14 @@ address StubGenerator::generate_updateBytesAdler32() {
 
   __ align(CodeEntryAlignment);
   StubId stub_id = StubId::stubgen_updateBytesAdler32_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
 
   // Choose an appropriate LIMIT for inner loop based on the granularity
   // of intermediate results. For int, LIMIT of 5552 will ensure intermediate
@@ -334,7 +340,19 @@ address StubGenerator::generate_updateBytesAdler32() {
   __ leave();
   __ ret(0);
 
+  // record the stub entry and end
+  store_archive_data(stub_id, start, __ pc());
   return start;
 }
 
 #undef __
+
+#if INCLUDE_CDS
+void StubGenerator::init_AOTAddressTable_adler(GrowableArray<address>& external_addresses) {
+#define ADD(addr) external_addresses.append((address)(addr))
+  ADD(ADLER32_ASCALE_TABLE);
+  ADD(ADLER32_SHUF0_TABLE);
+  ADD(ADLER32_SHUF1_TABLE);
+#undef ADD
+}
+#endif // INCLUDE_CDS
diff --git a/src/hotspot/cpu/x86/stubGenerator_x86_64_aes.cpp b/src/hotspot/cpu/x86/stubGenerator_x86_64_aes.cpp
index 162c92d5190..b95aa5f8818 100644
--- a/src/hotspot/cpu/x86/stubGenerator_x86_64_aes.cpp
+++ b/src/hotspot/cpu/x86/stubGenerator_x86_64_aes.cpp
@@ -250,10 +250,16 @@ void StubGenerator::generate_aes_stubs() {
 // Output:
 //   rax - number of processed bytes
 address StubGenerator::generate_galoisCounterMode_AESCrypt() {
-  __ align(CodeEntryAlignment);
   StubId stub_id = StubId::stubgen_galoisCounterMode_AESCrypt_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
+  __ align(CodeEntryAlignment);
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
 
   const Register in = c_rarg0;
   const Register len = c_rarg1;
@@ -319,6 +325,9 @@ address StubGenerator::generate_galoisCounterMode_AESCrypt() {
   __ leave(); // required for proper stackwalking of RuntimeStub frame
   __ ret(0);
 
+  // record the stub entry and end
+  store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
@@ -337,10 +346,16 @@ address StubGenerator::generate_galoisCounterMode_AESCrypt() {
 // Output:
 //   rax - number of processed bytes
 address StubGenerator::generate_avx2_galoisCounterMode_AESCrypt() {
-  __ align(CodeEntryAlignment);
   StubId stub_id = StubId::stubgen_galoisCounterMode_AESCrypt_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
+  __ align(CodeEntryAlignment);
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
 
   const Register in = c_rarg0;
   const Register len = c_rarg1;
@@ -404,15 +419,24 @@ address StubGenerator::generate_avx2_galoisCounterMode_AESCrypt() {
   __ leave(); // required for proper stackwalking of RuntimeStub frame
   __ ret(0);
 
+  // record the stub entry and end
+  store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
 // Vector AES Counter implementation
 address StubGenerator::generate_counterMode_VectorAESCrypt()  {
-  __ align(CodeEntryAlignment);
   StubId stub_id = StubId::stubgen_counterMode_AESCrypt_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
+  __ align(CodeEntryAlignment);
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
 
   const Register from = c_rarg0; // source array address
   const Register to = c_rarg1; // destination array address
@@ -471,6 +495,9 @@ address StubGenerator::generate_counterMode_VectorAESCrypt()  {
   __ leave(); // required for proper stackwalking of RuntimeStub frame
   __ ret(0);
 
+  // record the stub entry and end
+  store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
@@ -498,10 +525,16 @@ address StubGenerator::generate_counterMode_VectorAESCrypt()  {
 //
 address StubGenerator::generate_counterMode_AESCrypt_Parallel() {
   assert(UseAES, "need AES instructions and misaligned SSE support");
-  __ align(CodeEntryAlignment);
   StubId stub_id = StubId::stubgen_counterMode_AESCrypt_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
+  __ align(CodeEntryAlignment);
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
 
   const Register from = c_rarg0; // source array address
   const Register to = c_rarg1; // destination array address
@@ -781,15 +814,24 @@ address StubGenerator::generate_counterMode_AESCrypt_Parallel() {
   __ leave(); // required for proper stackwalking of RuntimeStub frame
   __ ret(0);
 
+  // record the stub entry and end
+  store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
 address StubGenerator::generate_cipherBlockChaining_decryptVectorAESCrypt() {
   assert(VM_Version::supports_avx512_vaes(), "need AES instructions and misaligned SSE support");
-  __ align(CodeEntryAlignment);
   StubId stub_id = StubId::stubgen_cipherBlockChaining_decryptAESCrypt_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
+  __ align(CodeEntryAlignment);
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
 
   const Register from = c_rarg0;  // source array address
   const Register to = c_rarg1;  // destination array address
@@ -1057,6 +1099,9 @@ address StubGenerator::generate_cipherBlockChaining_decryptVectorAESCrypt() {
   __ leave(); // required for proper stackwalking of RuntimeStub frame
   __ ret(0);
 
+  // record the stub entry and end
+  store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
@@ -1069,11 +1114,17 @@ address StubGenerator::generate_cipherBlockChaining_decryptVectorAESCrypt() {
 //
 address StubGenerator::generate_aescrypt_encryptBlock() {
   assert(UseAES, "need AES instructions and misaligned SSE support");
-  __ align(CodeEntryAlignment);
   StubId stub_id = StubId::stubgen_aescrypt_encryptBlock_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
+  __ align(CodeEntryAlignment);
   StubCodeMark mark(this, stub_id);
   Label L_doLast;
-  address start = __ pc();
+  start = __ pc();
 
   const Register from        = c_rarg0;  // source array address
   const Register to          = c_rarg1;  // destination array address
@@ -1152,6 +1203,9 @@ address StubGenerator::generate_aescrypt_encryptBlock() {
   __ leave(); // required for proper stackwalking of RuntimeStub frame
   __ ret(0);
 
+  // record the stub entry and end
+  store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
@@ -1164,11 +1218,17 @@ address StubGenerator::generate_aescrypt_encryptBlock() {
 //
 address StubGenerator::generate_aescrypt_decryptBlock() {
   assert(UseAES, "need AES instructions and misaligned SSE support");
-  __ align(CodeEntryAlignment);
   StubId stub_id = StubId::stubgen_aescrypt_decryptBlock_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
+  __ align(CodeEntryAlignment);
   StubCodeMark mark(this, stub_id);
   Label L_doLast;
-  address start = __ pc();
+  start = __ pc();
 
   const Register from        = c_rarg0;  // source array address
   const Register to          = c_rarg1;  // destination array address
@@ -1248,6 +1308,9 @@ address StubGenerator::generate_aescrypt_decryptBlock() {
   __ leave(); // required for proper stackwalking of RuntimeStub frame
   __ ret(0);
 
+  // record the stub entry and end
+  store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
@@ -1266,10 +1329,16 @@ address StubGenerator::generate_aescrypt_decryptBlock() {
 //
 address StubGenerator::generate_cipherBlockChaining_encryptAESCrypt() {
   assert(UseAES, "need AES instructions and misaligned SSE support");
-  __ align(CodeEntryAlignment);
   StubId stub_id = StubId::stubgen_cipherBlockChaining_encryptAESCrypt_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
+  __ align(CodeEntryAlignment);
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
 
   Label L_exit, L_key_192_256, L_key_256, L_loopTop_128, L_loopTop_192, L_loopTop_256;
   const Register from        = c_rarg0;  // source array address
@@ -1398,6 +1467,9 @@ address StubGenerator::generate_cipherBlockChaining_encryptAESCrypt() {
   __ jcc(Assembler::notEqual, L_loopTop_256);
   __ jmp(L_exit);
 
+  // record the stub entry and end
+  store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
@@ -1422,11 +1494,15 @@ address StubGenerator::generate_cipherBlockChaining_encryptAESCrypt() {
 //
 address StubGenerator::generate_electronicCodeBook_AESCrypt_Parallel(bool is_encrypt) {
   assert(UseAES, "need AES instructions and misaligned SSE support");
-  __ align(CodeEntryAlignment);
   StubId stub_id = is_encrypt ? StubId::stubgen_electronicCodeBook_encryptAESCrypt_id
                               : StubId::stubgen_electronicCodeBook_decryptAESCrypt_id;
+  address start = load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
+  __ align(CodeEntryAlignment);
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
 
   const Register from    = c_rarg0;  // source array address
   const Register to      = c_rarg1;  // destination array address
@@ -1581,6 +1657,9 @@ __ opc(xmm_result0, reg);
   __ leave(); // required for proper stackwalking of RuntimeStub frame
   __ ret(0);
 
+  // record the stub entry and end
+  store_archive_data(stub_id, start, __ pc());
+
   return start;
 
 #undef DoFour
@@ -1612,10 +1691,16 @@ address StubGenerator::generate_electronicCodeBook_decryptAESCrypt_Parallel() {
 //
 address StubGenerator::generate_cipherBlockChaining_decryptAESCrypt_Parallel() {
   assert(UseAES, "need AES instructions and misaligned SSE support");
-  __ align(CodeEntryAlignment);
   StubId stub_id = StubId::stubgen_cipherBlockChaining_decryptAESCrypt_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
+  __ align(CodeEntryAlignment);
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
 
   const Register from        = c_rarg0;  // source array address
   const Register to          = c_rarg1;  // destination array address
@@ -1851,14 +1936,23 @@ __ opc(xmm_result3, src_reg);
   __ leave(); // required for proper stackwalking of RuntimeStub frame
   __ ret(0);
 
+  // record the stub entry and end
+  store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
 address StubGenerator::generate_electronicCodeBook_encryptAESCrypt() {
-  __ align(CodeEntryAlignment);
   StubId stub_id = StubId::stubgen_electronicCodeBook_encryptAESCrypt_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
+  __ align(CodeEntryAlignment);
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
 
   const Register from = c_rarg0;  // source array address
   const Register to = c_rarg1;  // destination array address
@@ -1872,14 +1966,23 @@ address StubGenerator::generate_electronicCodeBook_encryptAESCrypt() {
   __ leave(); // required for proper stackwalking of RuntimeStub frame
   __ ret(0);
 
+  // record the stub entry and end
+  store_archive_data(stub_id, start, __ pc());
+
   return start;
  }
 
 address StubGenerator::generate_electronicCodeBook_decryptAESCrypt() {
-  __ align(CodeEntryAlignment);
   StubId stub_id = StubId::stubgen_electronicCodeBook_decryptAESCrypt_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
+  __ align(CodeEntryAlignment);
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
 
   const Register from = c_rarg0;  // source array address
   const Register to = c_rarg1;  // destination array address
@@ -1893,6 +1996,9 @@ address StubGenerator::generate_electronicCodeBook_decryptAESCrypt() {
   __ leave(); // required for proper stackwalking of RuntimeStub frame
   __ ret(0);
 
+  // record the stub entry and end
+  store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
@@ -4292,3 +4398,27 @@ void StubGenerator::aesgcm_avx2(Register in, Register len, Register ct, Register
  }
 
 #undef __
+
+#if INCLUDE_CDS
+void StubGenerator::init_AOTAddressTable_aes(GrowableArray<address>& external_addresses) {
+#define ADD(addr) external_addresses.append((address)(addr))
+  ADD(key_shuffle_mask_addr());
+  ADD(counter_shuffle_mask_addr());
+  ADD(counter_mask_linc0_addr());
+  ADD(counter_mask_linc1_addr());
+  ADD(counter_mask_linc1f_addr());
+  ADD(counter_mask_linc2_addr());
+  ADD(counter_mask_linc2f_addr());
+  ADD(counter_mask_linc4_addr());
+  ADD(counter_mask_linc8_addr());
+  ADD(counter_mask_linc16_addr());
+  ADD(counter_mask_linc32_addr());
+  ADD(counter_mask_ones_addr());
+  ADD(ghash_polynomial_reduction_addr());
+  ADD(ghash_polynomial_two_one_addr());
+  ADD(counter_mask_addbe_4444_addr());
+  ADD(counter_mask_addbe_1234_addr());
+  ADD(counter_mask_add_1234_addr());
+#undef ADD
+}
+#endif // INCLUDE_CDS
diff --git a/src/hotspot/cpu/x86/stubGenerator_x86_64_arraycopy.cpp b/src/hotspot/cpu/x86/stubGenerator_x86_64_arraycopy.cpp
index 01e004b7b43..5530e5325de 100644
--- a/src/hotspot/cpu/x86/stubGenerator_x86_64_arraycopy.cpp
+++ b/src/hotspot/cpu/x86/stubGenerator_x86_64_arraycopy.cpp
@@ -570,10 +570,45 @@ address StubGenerator::generate_disjoint_copy_avx3_masked(StubId stub_id, addres
   default:
     ShouldNotReachHere();
   }
+  GrowableArray<address> entries;
+  GrowableArray<address> extras;
+  bool add_handlers = !is_oop && !aligned;
+  bool add_relocs = UseZGC && is_oop;
+  bool add_extras = add_handlers || add_relocs;
+  // The stub employs one unsafe handler region by default but has two
+  // when MaxVectorSize == 64 So we may expect 0, 3 or 6 extras.
+  int handlers_count = (MaxVectorSize == 64 ? 2 : 1);
+  int expected_entry_count = (entry != nullptr ? 2 : 1);
+  int expected_extra_count = (add_handlers ? handlers_count : 0) * UnsafeMemoryAccess::COLUMN_COUNT; // 0/1/2 x UMAM {start,end,handler}
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == expected_entry_count, "sanity check");
+  GrowableArray<address>* entries_ptr = (entry_count == 1 ? nullptr : &entries);
+  GrowableArray<address>* extras_ptr = (add_extras ? &extras : nullptr);
+  address start = load_archive_data(stub_id, entries_ptr, extras_ptr);
+  if (start != nullptr) {
+    assert(entries.length() == expected_entry_count - 1,
+           "unexpected entry count %d", entries.length());
+    assert(!add_handlers || extras.length() == expected_extra_count,
+           "unexpected handler addresses count %d", extras.length());
+    if (entry != nullptr) {
+      *entry = entries.at(0);
+    }
+    if (add_handlers) {
+      // restore 1/2 x UMAM {start,end,handler} addresses from extras
+      register_unsafe_access_handlers(extras, 0, handlers_count);
+    }
+#if INCLUDE_ZGC
+    // register addresses at which ZGC does colour patching
+    if (add_relocs)  {
+      register_reloc_addresses(extras, 0, extras.length());
+    }
+#endif // INCLUDE_ZGC
+    return start;
+  }
 
   __ align(CodeEntryAlignment);
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
 
   bool use64byteVector = (MaxVectorSize > 32) && (CopyAVX3Threshold == 0);
   const int large_threshold = 2621440; // 2.5 MB
@@ -595,6 +630,7 @@ address StubGenerator::generate_disjoint_copy_avx3_masked(StubId stub_id, addres
 
   if (entry != nullptr) {
     *entry = __ pc();
+    entries.append(*entry);
      // caller can pass a 64-bit byte count here (from Unsafe.copyMemory)
     BLOCK_COMMENT("Entry:");
   }
@@ -620,7 +656,7 @@ address StubGenerator::generate_disjoint_copy_avx3_masked(StubId stub_id, addres
     int threshold[]        = { 4096,    2048,     1024,    512};
 
     // UnsafeMemoryAccess page error: continue after unsafe access
-    UnsafeMemoryAccessMark umam(this, !is_oop && !aligned, true);
+    UnsafeMemoryAccessMark umam(this, add_handlers, true);
     // 'from', 'to' and 'count' are now valid
 
     // temp1 holds remaining count and temp4 holds running count used to compute
@@ -789,10 +825,28 @@ address StubGenerator::generate_disjoint_copy_avx3_masked(StubId stub_id, addres
 
   if (MaxVectorSize == 64) {
     __ BIND(L_copy_large);
-      UnsafeMemoryAccessMark umam(this, !is_oop && !aligned, false, ucme_exit_pc);
+      UnsafeMemoryAccessMark umam(this, add_handlers, false, ucme_exit_pc);
       arraycopy_avx3_large(to, from, temp1, temp2, temp3, temp4, count, xmm1, xmm2, xmm3, xmm4, shift);
     __ jmp(L_finish);
   }
+  // retrieve the registered handler addresses
+  address end = __ pc();
+  if (add_handlers) {
+    retrieve_unsafe_access_handlers(start, end, extras);
+  }
+  assert(extras.length() == expected_extra_count,
+         "unexpected handler addresses count %d", extras.length());
+#if INCLUDE_ZGC
+  // retrieve addresses at which ZGC does colour patching
+  if (add_relocs) {
+    retrieve_reloc_addresses(start, end, extras);
+  }
+#endif // INCLUDE_ZGC
+
+  // record the stub entry and end plus the no_push entry and any
+  // extra handler addresses
+  store_archive_data(stub_id, start, end, entries_ptr, extras_ptr);
+
   return start;
 }
 
@@ -907,10 +961,41 @@ address StubGenerator::generate_conjoint_copy_avx3_masked(StubId stub_id, addres
   default:
     ShouldNotReachHere();
   }
-
+  GrowableArray<address> entries;
+  GrowableArray<address> extras;
+  bool add_handlers = !is_oop && !aligned;
+  bool add_relocs = UseZGC && is_oop;
+  bool add_extras = add_handlers || add_relocs;
+  int expected_entry_count = (entry != nullptr ? 2 : 1);
+  int expected_handler_count = (add_handlers ? 1 : 0) * UnsafeMemoryAccess::COLUMN_COUNT; // 0/1 x UMAM {start,end,handler}
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == expected_entry_count, "sanity check");
+  GrowableArray<address>* entries_ptr = (entry_count == 1 ? nullptr : &entries);
+  GrowableArray<address>* extras_ptr = (add_extras ? &extras : nullptr);
+  address start = load_archive_data(stub_id, entries_ptr, extras_ptr);
+  if (start != nullptr) {
+    assert(entries.length() == expected_entry_count - 1,
+           "unexpected entry count %d", entries.length());
+    assert(!add_handlers || extras.length() == expected_handler_count,
+           "unexpected handler addresses count %d", extras.length());
+    if (entry != nullptr) {
+      *entry = entries.at(0);
+    }
+    if (add_handlers) {
+      // restore 1 x UMAM {start,end,handler} addresses from extras
+      register_unsafe_access_handlers(extras, 0, 1);
+    }
+#if INCLUDE_ZGC
+    if (add_relocs)  {
+      // register addresses at which ZGC does colour patching
+      register_reloc_addresses(extras, 0, extras.length());
+    }
+#endif // INCLUDE_ZGC
+    return start;
+  }
   __ align(CodeEntryAlignment);
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
 
   bool use64byteVector = (MaxVectorSize > 32) && (CopyAVX3Threshold == 0);
 
@@ -931,6 +1016,7 @@ address StubGenerator::generate_conjoint_copy_avx3_masked(StubId stub_id, addres
 
   if (entry != nullptr) {
     *entry = __ pc();
+    entries.append(*entry);
      // caller can pass a 64-bit byte count here (from Unsafe.copyMemory)
     BLOCK_COMMENT("Entry:");
   }
@@ -957,7 +1043,7 @@ address StubGenerator::generate_conjoint_copy_avx3_masked(StubId stub_id, addres
     int threshold[]   = { 4096,    2048,     1024,    512};
 
     // UnsafeMemoryAccess page error: continue after unsafe access
-    UnsafeMemoryAccessMark umam(this, !is_oop && !aligned, true);
+    UnsafeMemoryAccessMark umam(this, add_handlers, true);
     // 'from', 'to' and 'count' are now valid
 
     // temp1 holds remaining count.
@@ -1071,6 +1157,23 @@ address StubGenerator::generate_conjoint_copy_avx3_masked(StubId stub_id, addres
   __ leave(); // required for proper stackwalking of RuntimeStub frame
   __ ret(0);
 
+  // retrieve the registered handler addresses
+  address end = __ pc();
+  if (add_handlers) {
+    retrieve_unsafe_access_handlers(start, end, extras);
+  }
+  assert(extras.length() == expected_handler_count,
+         "unexpected handler addresses count %d", extras.length());
+#if INCLUDE_ZGC
+  // retrieve addresses at which ZGC does colour patching
+  if (add_relocs) {
+    retrieve_reloc_addresses(start, end, extras);
+  }
+#endif // INCLUDE_ZGC
+  // record the stub entry and end plus the no_push entry and any
+  // extra handler addresses
+  store_archive_data(stub_id, start, end, entries_ptr, extras_ptr);
+
   return start;
 }
 
@@ -1385,9 +1488,29 @@ address StubGenerator::generate_disjoint_byte_copy(address* entry) {
     return generate_disjoint_copy_avx3_masked(stub_id, entry);
   }
 #endif
+  GrowableArray<address> entries;
+  GrowableArray<address> extras;
+  int expected_entry_count = (entry != nullptr ? 2 : 1);
+  int expected_handler_count = (2 * UnsafeMemoryAccess::COLUMN_COUNT); // 2 x UMAM {start,end,handler}
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == expected_entry_count, "sanity check");
+  GrowableArray<address>* entries_ptr = (entry_count == 1 ? nullptr : &entries);
+  address start = load_archive_data(stub_id, entries_ptr, &extras);
+  if (start != nullptr) {
+    assert(entries.length() == expected_entry_count - 1,
+           "unexpected entry count %d", entries.length());
+    assert(extras.length() == expected_handler_count,
+           "unexpected handler addresses count %d", extras.length());
+    if (entry != nullptr) {
+      *entry = entries.at(0);
+    }
+    // restore 2 UMAM {start,end,handler} addresses from extras
+    register_unsafe_access_handlers(extras, 0, 2);
+    return start;
+  }
   __ align(CodeEntryAlignment);
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
   DecoratorSet decorators = IN_HEAP | IS_ARRAY | ARRAYCOPY_DISJOINT;
 
   Label L_copy_bytes, L_copy_8_bytes, L_copy_4_bytes, L_copy_2_bytes;
@@ -1407,6 +1530,7 @@ address StubGenerator::generate_disjoint_byte_copy(address* entry) {
 
   if (entry != nullptr) {
     *entry = __ pc();
+    entries.append(*entry);
      // caller can pass a 64-bit byte count here (from Unsafe.copyMemory)
     BLOCK_COMMENT("Entry:");
   }
@@ -1476,6 +1600,17 @@ __ BIND(L_exit);
     copy_bytes_forward(end_from, end_to, qword_count, rax, r10, L_copy_bytes, L_copy_8_bytes, decorators, T_BYTE);
     __ jmp(L_copy_4_bytes);
   }
+
+  // retrieve the registered handler addresses
+  address end = __ pc();
+  retrieve_unsafe_access_handlers(start, end, extras);
+  assert(extras.length() == expected_handler_count,
+         "unexpected handler addresses count %d", extras.length());
+
+  // record the stub entry and end plus the no_push entry and any
+  // extra handler addresses
+  store_archive_data(stub_id, start, end, entries_ptr, &extras);
+
   return start;
 }
 
@@ -1503,9 +1638,29 @@ address StubGenerator::generate_conjoint_byte_copy(address nooverlap_target, add
     return generate_conjoint_copy_avx3_masked(stub_id, entry, nooverlap_target);
   }
 #endif
+  GrowableArray<address> entries;
+  GrowableArray<address> extras;
+  int expected_entry_count = (entry != nullptr ? 2 : 1);
+  int expected_handler_count = (2 * UnsafeMemoryAccess::COLUMN_COUNT); // 2 x UMAM {start,end,handler}
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == expected_entry_count, "sanity check");
+  GrowableArray<address>* entries_ptr = (entry_count == 1 ? nullptr : &entries);
+  address start = load_archive_data(stub_id, entries_ptr, &extras);
+  if (start != nullptr) {
+    assert(entries.length() == expected_entry_count - 1,
+           "unexpected entry count %d", entries.length());
+    assert(extras.length() == expected_handler_count,
+           "unexpected handler addresses count %d", extras.length());
+    if (entry != nullptr) {
+      *entry = entries.at(0);
+    }
+    // restore 2 UMAM {start,end,handler} addresses from extras
+    register_unsafe_access_handlers(extras, 0, 2);
+    return start;
+  }
   __ align(CodeEntryAlignment);
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
   DecoratorSet decorators = IN_HEAP | IS_ARRAY;
 
   Label L_copy_bytes, L_copy_8_bytes, L_copy_4_bytes, L_copy_2_bytes;
@@ -1520,6 +1675,7 @@ address StubGenerator::generate_conjoint_byte_copy(address nooverlap_target, add
 
   if (entry != nullptr) {
     *entry = __ pc();
+    entries.append(*entry);
     // caller can pass a 64-bit byte count here (from Unsafe.copyMemory)
     BLOCK_COMMENT("Entry:");
   }
@@ -1586,6 +1742,16 @@ address StubGenerator::generate_conjoint_byte_copy(address nooverlap_target, add
   __ leave(); // required for proper stackwalking of RuntimeStub frame
   __ ret(0);
 
+  // retrieve the registered handler addresses
+  address end = __ pc();
+  retrieve_unsafe_access_handlers(start, end, extras);
+  assert(extras.length() == expected_handler_count,
+         "unexpected handler addresses count %d", extras.length());
+
+  // record the stub entry and end plus the no_push entry and any
+  // extra handler addresses
+  store_archive_data(stub_id, start, end, entries_ptr, &extras);
+
   return start;
 }
 
@@ -1616,10 +1782,29 @@ address StubGenerator::generate_disjoint_short_copy(address *entry) {
     return generate_disjoint_copy_avx3_masked(stub_id, entry);
   }
 #endif
-
+  GrowableArray<address> entries;
+  GrowableArray<address> extras;
+  int expected_entry_count = (entry != nullptr ? 2 : 1);
+  int expected_handler_count = (2 * UnsafeMemoryAccess::COLUMN_COUNT); // 2 x UMAM {start,end,handler}
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == expected_entry_count, "sanity check");
+  GrowableArray<address>* entries_ptr = (entry_count == 1 ? nullptr : &entries);
+  address start = load_archive_data(stub_id, entries_ptr, &extras);
+  if (start != nullptr) {
+    assert(entries.length() == expected_entry_count - 1,
+           "unexpected entry count %d", entries.length());
+    assert(extras.length() == expected_handler_count,
+           "unexpected handler addresses count %d", extras.length());
+    if (entry != nullptr) {
+      *entry = entries.at(0);
+    }
+    // restore 2 UMAM {start,end,handler} addresses from extras
+    register_unsafe_access_handlers(extras, 0, 2);
+    return start;
+  }
   __ align(CodeEntryAlignment);
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
   DecoratorSet decorators = IN_HEAP | IS_ARRAY | ARRAYCOPY_DISJOINT;
 
   Label L_copy_bytes, L_copy_8_bytes, L_copy_4_bytes,L_copy_2_bytes,L_exit;
@@ -1638,6 +1823,7 @@ address StubGenerator::generate_disjoint_short_copy(address *entry) {
 
   if (entry != nullptr) {
     *entry = __ pc();
+    entries.append(*entry);
     // caller can pass a 64-bit byte count here (from Unsafe.copyMemory)
     BLOCK_COMMENT("Entry:");
   }
@@ -1701,6 +1887,16 @@ __ BIND(L_exit);
     __ jmp(L_copy_4_bytes);
   }
 
+  // retrieve the registered handler addresses
+  address end = __ pc();
+  retrieve_unsafe_access_handlers(start, end, extras);
+  assert(extras.length() == expected_handler_count,
+         "unexpected handler addresses count %d", extras.length());
+
+  // record the stub entry and end plus the no_push entry and any
+  // extra handler addresses
+  store_archive_data(stub_id, start, end, entries_ptr, &extras);
+
   return start;
 }
 
@@ -1708,7 +1904,6 @@ __ BIND(L_exit);
 address StubGenerator::generate_fill(StubId stub_id) {
   BasicType t;
   bool aligned;
-
   switch (stub_id) {
   case StubId::stubgen_jbyte_fill_id:
     t = T_BYTE;
@@ -1737,10 +1932,27 @@ address StubGenerator::generate_fill(StubId stub_id) {
   default:
     ShouldNotReachHere();
   }
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  GrowableArray<address> extras;
+  bool add_handlers = ((t == T_BYTE) && !aligned);
+  int handlers_count = (add_handlers ? 1 : 0);
+  int expected_extras_count = (handlers_count * UnsafeMemoryAccess::COLUMN_COUNT); // 0/1 x UMAM {start,end,handler}
+  GrowableArray<address>* extras_ptr = (add_handlers ? &extras : nullptr);
+  address start = load_archive_data(stub_id, nullptr, extras_ptr);
+  if (start != nullptr) {
+    assert(extras.length() == expected_extras_count,
+           "unexpected handler addresses count %d", extras.length());
+    if (add_handlers) {
+      // restore 1 x UMAM {start,end,handler} addresses from extras
+      register_unsafe_access_handlers(extras, 0, 1);
+    }
+    return start;
+  }
 
   __ align(CodeEntryAlignment);
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
 
   BLOCK_COMMENT("Entry:");
 
@@ -1753,7 +1965,7 @@ address StubGenerator::generate_fill(StubId stub_id) {
 
   {
     // Add set memory mark to protect against unsafe accesses faulting
-    UnsafeMemoryAccessMark umam(this, ((t == T_BYTE) && !aligned), true);
+    UnsafeMemoryAccessMark umam(this, add_handlers, true);
     __ generate_fill(t, aligned, to, value, r11, rax, xmm0);
   }
 
@@ -1761,6 +1973,15 @@ address StubGenerator::generate_fill(StubId stub_id) {
   __ leave(); // required for proper stackwalking of RuntimeStub frame
   __ ret(0);
 
+  address end = __ pc();
+  if (add_handlers) {
+    retrieve_unsafe_access_handlers(start, end, extras);
+  }
+  assert(extras.length() == expected_extras_count,
+         "unexpected handler addresses count %d", extras.length());
+  // record the stub entry and end
+  store_archive_data(stub_id, start, end, nullptr, extras_ptr);
+
   return start;
 }
 
@@ -1788,10 +2009,29 @@ address StubGenerator::generate_conjoint_short_copy(address nooverlap_target, ad
     return generate_conjoint_copy_avx3_masked(stub_id, entry, nooverlap_target);
   }
 #endif
-
+  GrowableArray<address> entries;
+  GrowableArray<address> extras;
+  int expected_entry_count = (entry != nullptr ? 2 : 1);
+  int expected_handler_count = (2 * UnsafeMemoryAccess::COLUMN_COUNT); // 2 x UMAM {start,end,handler}
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == expected_entry_count, "sanity check");
+  GrowableArray<address>* entries_ptr = (entry_count == 1 ? nullptr : &entries);
+  address start = load_archive_data(stub_id, entries_ptr, &extras);
+  if (start != nullptr) {
+    assert(entries.length() == expected_entry_count - 1,
+           "unexpected entry count %d", entries.length());
+    assert(extras.length() == expected_handler_count,
+           "unexpected handler addresses count %d", extras.length());
+    if (entry != nullptr) {
+      *entry = entries.at(0);
+    }
+    // restore 2 UMAM {start,end,handler} addresses from extras
+    register_unsafe_access_handlers(extras, 0, 2);
+    return start;
+  }
   __ align(CodeEntryAlignment);
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
   DecoratorSet decorators = IN_HEAP | IS_ARRAY;
 
   Label L_copy_bytes, L_copy_8_bytes, L_copy_4_bytes;
@@ -1806,6 +2046,7 @@ address StubGenerator::generate_conjoint_short_copy(address nooverlap_target, ad
 
   if (entry != nullptr) {
     *entry = __ pc();
+    entries.append(*entry);
     // caller can pass a 64-bit byte count here (from Unsafe.copyMemory)
     BLOCK_COMMENT("Entry:");
   }
@@ -1864,6 +2105,16 @@ address StubGenerator::generate_conjoint_short_copy(address nooverlap_target, ad
   __ leave(); // required for proper stackwalking of RuntimeStub frame
   __ ret(0);
 
+  // retrieve the registered handler addresses
+  address end = __ pc();
+  retrieve_unsafe_access_handlers(start, end, extras);
+  assert(extras.length() == expected_handler_count,
+         "unexpected handler addresses count %d", extras.length());
+
+  // record the stub entry and end plus the no_push entry and any
+  // extra handler addresses
+  store_archive_data(stub_id, start, end, entries_ptr, &extras);
+
   return start;
 }
 
@@ -1916,10 +2167,42 @@ address StubGenerator::generate_disjoint_int_oop_copy(StubId stub_id, address* e
     return generate_disjoint_copy_avx3_masked(stub_id, entry);
   }
 #endif
+  GrowableArray<address> entries;
+  GrowableArray<address> extras;
+  bool add_handlers = !is_oop && !aligned;
+  bool add_relocs = UseZGC && is_oop;
+  bool add_extras = add_handlers || add_relocs;
+  int expected_entry_count = (entry != nullptr ? 2 : 1);
+  int expected_handler_count = (add_handlers ? 2 : 0) * UnsafeMemoryAccess::COLUMN_COUNT; // 0/2 x UMAM {start,end,handler}
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == expected_entry_count, "sanity check");
+  GrowableArray<address>* entries_ptr = (entry_count == 1 ? nullptr : &entries);
+  GrowableArray<address>* extras_ptr = (add_extras ? &extras : nullptr);
+  address start = load_archive_data(stub_id, entries_ptr, extras_ptr);
+  if (start != nullptr) {
+    assert(entries.length() == expected_entry_count - 1,
+           "unexpected entry count %d", entries.length());
+    assert(!add_handlers || extras.length() == expected_handler_count,
+           "unexpected handler addresses count %d", extras.length());
+    if (entry != nullptr) {
+      *entry = entries.at(0);
+    }
+    if (add_handlers) {
+      // restore 2 UMAM {start,end,handler} addresses from extras
+      register_unsafe_access_handlers(extras, 0, 2);
+    }
+#if INCLUDE_ZGC
+    // register addresses at which ZGC does colour patching
+    if (add_relocs)  {
+      register_reloc_addresses(extras, 0, extras.length());
+    }
+#endif // INCLUDE_ZGC
+    return start;
+  }
 
   __ align(CodeEntryAlignment);
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
 
   Label L_copy_bytes, L_copy_8_bytes, L_copy_4_bytes, L_exit;
   const Register from        = rdi;  // source array address
@@ -1937,6 +2220,7 @@ address StubGenerator::generate_disjoint_int_oop_copy(StubId stub_id, address* e
 
   if (entry != nullptr) {
     *entry = __ pc();
+    entries.append(*entry);
     // caller can pass a 64-bit byte count here (from Unsafe.copyMemory)
     BLOCK_COMMENT("Entry:");
   }
@@ -1957,7 +2241,7 @@ address StubGenerator::generate_disjoint_int_oop_copy(StubId stub_id, address* e
 
   {
     // UnsafeMemoryAccess page error: continue after unsafe access
-    UnsafeMemoryAccessMark umam(this, !is_oop && !aligned, true);
+    UnsafeMemoryAccessMark umam(this, add_handlers, true);
     // 'from', 'to' and 'count' are now valid
     __ movptr(dword_count, count);
     __ shrptr(count, 1); // count => qword_count
@@ -1969,20 +2253,20 @@ address StubGenerator::generate_disjoint_int_oop_copy(StubId stub_id, address* e
     __ jmp(L_copy_bytes);
 
     // Copy trailing qwords
-  __ BIND(L_copy_8_bytes);
+    __ BIND(L_copy_8_bytes);
     __ movq(rax, Address(end_from, qword_count, Address::times_8, 8));
     __ movq(Address(end_to, qword_count, Address::times_8, 8), rax);
     __ increment(qword_count);
     __ jcc(Assembler::notZero, L_copy_8_bytes);
 
     // Check for and copy trailing dword
-  __ BIND(L_copy_4_bytes);
+    __ BIND(L_copy_4_bytes);
     __ testl(dword_count, 1); // Only byte test since the value is 0 or 1
     __ jccb(Assembler::zero, L_exit);
     __ movl(rax, Address(end_from, 8));
     __ movl(Address(end_to, 8), rax);
   }
-__ BIND(L_exit);
+  __ BIND(L_exit);
   address ucme_exit_pc = __ pc();
   bs->arraycopy_epilogue(_masm, decorators, type, from, to, dword_count);
   restore_arg_regs_using_thread();
@@ -1993,12 +2277,30 @@ __ BIND(L_exit);
   __ ret(0);
 
   {
-    UnsafeMemoryAccessMark umam(this, !is_oop && !aligned, false, ucme_exit_pc);
+    UnsafeMemoryAccessMark umam(this, add_handlers, false, ucme_exit_pc);
     // Copy in multi-bytes chunks
     copy_bytes_forward(end_from, end_to, qword_count, rax, r10, L_copy_bytes, L_copy_8_bytes, decorators, is_oop ? T_OBJECT : T_INT);
     __ jmp(L_copy_4_bytes);
   }
 
+  // retrieve the registered handler addresses
+  address end = __ pc();
+  if (add_handlers) {
+    retrieve_unsafe_access_handlers(start, end, extras);
+  }
+  assert(extras.length() == expected_handler_count,
+         "unexpected handler addresses count %d", extras.length());
+#if INCLUDE_ZGC
+  // retrieve addresses at which ZGC does colour patching
+  if (add_relocs) {
+    retrieve_reloc_addresses(start, end, extras);
+  }
+#endif // INCLUDE_ZGC
+
+  // record the stub entry and end plus the no_push entry and any
+  // extra handler addresses
+  store_archive_data(stub_id, start, end, entries_ptr, extras_ptr);
+
   return start;
 }
 
@@ -2047,10 +2349,42 @@ address StubGenerator::generate_conjoint_int_oop_copy(StubId stub_id, address no
     return generate_conjoint_copy_avx3_masked(stub_id, entry, nooverlap_target);
   }
 #endif
+  bool add_handlers = !is_oop && !aligned;
+  bool add_relocs = UseZGC && is_oop;
+  bool add_extras = add_handlers || add_relocs;
+  GrowableArray<address> entries;
+  GrowableArray<address> extras;
+  int expected_entry_count = (entry != nullptr ? 2 : 1);
+  int expected_handler_count = (add_handlers ? 2 : 0) * UnsafeMemoryAccess::COLUMN_COUNT; // 0/2 x UMAM {start,end,handler}
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == expected_entry_count, "sanity check");
+  GrowableArray<address>* entries_ptr = (entry_count == 1 ? nullptr : &entries);
+  GrowableArray<address>* extras_ptr = (add_extras ? &extras : nullptr);
+  address start = load_archive_data(stub_id, entries_ptr, extras_ptr);
+  if (start != nullptr) {
+    assert(entries.length() == expected_entry_count - 1,
+           "unexpected entry count %d", entries.length());
+    assert(!add_handlers || extras.length() == expected_handler_count,
+           "unexpected handler addresses count %d", extras.length());
+    if (entry != nullptr) {
+      *entry = entries.at(0);
+    }
+    if (add_handlers) {
+      // restore 2 UMAM {start,end,handler} addresses from extras
+      register_unsafe_access_handlers(extras, 0, 2);
+    }
+#if INCLUDE_ZGC
+    // register addresses at which ZGC does colour patching
+    if (add_relocs)  {
+      register_reloc_addresses(extras, 6, extras.length());
+    }
+#endif // INCLUDE_ZGC
+    return start;
+  }
 
   __ align(CodeEntryAlignment);
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
 
   Label L_copy_bytes, L_copy_8_bytes, L_exit;
   const Register from        = rdi;  // source array address
@@ -2064,7 +2398,8 @@ address StubGenerator::generate_conjoint_int_oop_copy(StubId stub_id, address no
 
   if (entry != nullptr) {
     *entry = __ pc();
-     // caller can pass a 64-bit byte count here (from Unsafe.copyMemory)
+    entries.append(*entry);
+    // caller can pass a 64-bit byte count here (from Unsafe.copyMemory)
     BLOCK_COMMENT("Entry:");
   }
 
@@ -2087,7 +2422,7 @@ address StubGenerator::generate_conjoint_int_oop_copy(StubId stub_id, address no
   assert_clean_int(count, rax); // Make sure 'count' is clean int.
   {
     // UnsafeMemoryAccess page error: continue after unsafe access
-    UnsafeMemoryAccessMark umam(this, !is_oop && !aligned, true);
+    UnsafeMemoryAccessMark umam(this, add_handlers, true);
     // 'from', 'to' and 'count' are now valid
     __ movptr(dword_count, count);
     __ shrptr(count, 1); // count => qword_count
@@ -2102,7 +2437,7 @@ address StubGenerator::generate_conjoint_int_oop_copy(StubId stub_id, address no
     __ jmp(L_copy_bytes);
 
     // Copy trailing qwords
-  __ BIND(L_copy_8_bytes);
+    __ BIND(L_copy_8_bytes);
     __ movq(rax, Address(from, qword_count, Address::times_8, -8));
     __ movq(Address(to, qword_count, Address::times_8, -8), rax);
     __ decrement(qword_count);
@@ -2120,12 +2455,12 @@ address StubGenerator::generate_conjoint_int_oop_copy(StubId stub_id, address no
 
   {
     // UnsafeMemoryAccess page error: continue after unsafe access
-    UnsafeMemoryAccessMark umam(this, !is_oop && !aligned, true);
+    UnsafeMemoryAccessMark umam(this, add_handlers, true);
     // Copy in multi-bytes chunks
     copy_bytes_backward(from, to, qword_count, rax, r10, L_copy_bytes, L_copy_8_bytes, decorators, is_oop ? T_OBJECT : T_INT);
   }
 
-__ BIND(L_exit);
+  __ BIND(L_exit);
   bs->arraycopy_epilogue(_masm, decorators, type, from, to, dword_count);
   restore_arg_regs_using_thread();
   INC_COUNTER_NP(SharedRuntime::_jint_array_copy_ctr, rscratch1); // Update counter after rscratch1 is free
@@ -2134,6 +2469,23 @@ __ BIND(L_exit);
   __ leave(); // required for proper stackwalking of RuntimeStub frame
   __ ret(0);
 
+  // retrieve the registered handler addresses
+  address end = __ pc();
+  if (add_handlers) {
+    retrieve_unsafe_access_handlers(start, end, extras);
+  }
+  assert(extras.length() == expected_handler_count,
+         "unexpected handler addresses count %d", extras.length());
+#if INCLUDE_ZGC
+  // retrieve addresses at which ZGC does colour patching
+  if (add_relocs) {
+    retrieve_reloc_addresses(start, end, extras);
+  }
+#endif // INCLUDE_ZGC
+  // record the stub entry and end plus the no_push entry and any
+  // extra handler addresses
+  store_archive_data(stub_id, start, end, entries_ptr, extras_ptr);
+
   return start;
 }
 
@@ -2180,10 +2532,42 @@ address StubGenerator::generate_disjoint_long_oop_copy(StubId stub_id, address *
     return generate_disjoint_copy_avx3_masked(stub_id, entry);
   }
 #endif
+  bool add_handlers = !is_oop && !aligned;
+  bool add_relocs = UseZGC && is_oop;
+  bool add_extras = add_handlers || add_relocs;
+  GrowableArray<address> entries;
+  GrowableArray<address> extras;
+  int expected_entry_count = (entry != nullptr ? 2 : 1);
+  int expected_handler_count = (add_handlers ? 2 : 0) * UnsafeMemoryAccess::COLUMN_COUNT; // 0/2 x UMAM {start,end,handler}
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == expected_entry_count, "sanity check");
+  GrowableArray<address>* entries_ptr = (entry_count == 1 ? nullptr : &entries);
+  GrowableArray<address>* extras_ptr = (add_extras ? &extras : nullptr);
+  address start = load_archive_data(stub_id, entries_ptr, extras_ptr);
+  if (start != nullptr) {
+    assert(entries.length() == expected_entry_count - 1,
+           "unexpected entry count %d", entries.length());
+    assert(!add_handlers || extras.length() == expected_handler_count,
+           "unexpected handler addresses count %d", extras.length());
+    if (entry != nullptr) {
+      *entry = entries.at(0);
+    }
+    if (add_handlers) {
+      // restore 2 UMAM {start,end,handler} addresses from extras
+      register_unsafe_access_handlers(extras, 0, 2);
+    }
+#if INCLUDE_ZGC
+    // register addresses at which ZGC does colour patching
+    if (add_relocs)  {
+      register_reloc_addresses(extras, 0, extras.length());
+    }
+#endif // INCLUDE_ZGC
+    return start;
+  }
 
   __ align(CodeEntryAlignment);
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
 
   Label L_copy_bytes, L_copy_8_bytes, L_exit;
   const Register from        = rdi;  // source array address
@@ -2201,6 +2585,7 @@ address StubGenerator::generate_disjoint_long_oop_copy(StubId stub_id, address *
 
   if (entry != nullptr) {
     *entry = __ pc();
+    entries.append(*entry);
     // caller can pass a 64-bit byte count here (from Unsafe.copyMemory)
     BLOCK_COMMENT("Entry:");
   }
@@ -2221,7 +2606,7 @@ address StubGenerator::generate_disjoint_long_oop_copy(StubId stub_id, address *
   bs->arraycopy_prologue(_masm, decorators, type, from, to, qword_count);
   {
     // UnsafeMemoryAccess page error: continue after unsafe access
-    UnsafeMemoryAccessMark umam(this, !is_oop && !aligned, true);
+    UnsafeMemoryAccessMark umam(this, add_handlers, true);
 
     // Copy from low to high addresses.  Use 'to' as scratch.
     __ lea(end_from, Address(from, qword_count, Address::times_8, -8));
@@ -2253,7 +2638,7 @@ address StubGenerator::generate_disjoint_long_oop_copy(StubId stub_id, address *
 
   {
     // UnsafeMemoryAccess page error: continue after unsafe access
-    UnsafeMemoryAccessMark umam(this, !is_oop && !aligned, true);
+    UnsafeMemoryAccessMark umam(this, add_handlers, true);
     // Copy in multi-bytes chunks
     copy_bytes_forward(end_from, end_to, qword_count, rax, r10, L_copy_bytes, L_copy_8_bytes, decorators, is_oop ? T_OBJECT : T_LONG);
   }
@@ -2269,6 +2654,23 @@ address StubGenerator::generate_disjoint_long_oop_copy(StubId stub_id, address *
   __ leave(); // required for proper stackwalking of RuntimeStub frame
   __ ret(0);
 
+  // retrieve the registered handler addresses
+  address end = __ pc();
+  if (add_handlers) {
+    retrieve_unsafe_access_handlers(start, end, extras);
+  }
+  assert(extras.length() == expected_handler_count,
+         "unexpected handler addresses count %d", extras.length());
+#if INCLUDE_ZGC
+  // retrieve addresses at which ZGC does colour patching
+  if (add_relocs) {
+    retrieve_reloc_addresses(start, end, extras);
+  }
+#endif // INCLUDE_ZGC
+  // record the stub entry and end plus the no_push entry and any
+  // extra handler addresses
+  store_archive_data(stub_id, start, end, entries_ptr, extras_ptr);
+
   return start;
 }
 
@@ -2313,10 +2715,42 @@ address StubGenerator::generate_conjoint_long_oop_copy(StubId stub_id, address n
     return generate_conjoint_copy_avx3_masked(stub_id, entry, nooverlap_target);
   }
 #endif
+  bool add_handlers = !is_oop && !aligned;
+  bool add_relocs = UseZGC && is_oop;
+  bool add_extras = add_handlers || add_relocs;
+  GrowableArray<address> entries;
+  GrowableArray<address> extras;
+  int expected_entry_count = (entry != nullptr ? 2 : 1);
+  int expected_handler_count = (add_handlers ? 2 : 0) * UnsafeMemoryAccess::COLUMN_COUNT; // 0/2 x UMAM {start,end,handler}
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == expected_entry_count, "sanity check");
+  GrowableArray<address>* entries_ptr = (entry_count == 1 ? nullptr : &entries);
+  GrowableArray<address>* extras_ptr = (add_extras ? &extras : nullptr);
+  address start = load_archive_data(stub_id, entries_ptr, extras_ptr);
+  if (start != nullptr) {
+    assert(entries.length() == expected_entry_count - 1,
+           "unexpected entry count %d", entries.length());
+    assert(!add_handlers || extras.length() == expected_handler_count,
+           "unexpected handler addresses count %d", extras.length());
+    if (entry != nullptr) {
+      *entry = entries.at(0);
+    }
+    if (add_handlers) {
+      // restore 2 UMAM {start,end,handler} addresses from extras
+      register_unsafe_access_handlers(extras, 0, 2);
+    }
+#if INCLUDE_ZGC
+    // register addresses at which ZGC does colour patching
+    if (add_relocs)  {
+      register_reloc_addresses(extras, 0, extras.length());
+    }
+#endif // INCLUDE_ZGC
+    return start;
+  }
 
   __ align(CodeEntryAlignment);
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
 
   Label L_copy_bytes, L_copy_8_bytes, L_exit;
   const Register from        = rdi;  // source array address
@@ -2329,6 +2763,7 @@ address StubGenerator::generate_conjoint_long_oop_copy(StubId stub_id, address n
 
   if (entry != nullptr) {
     *entry = __ pc();
+    entries.append(*entry);
     // caller can pass a 64-bit byte count here (from Unsafe.copyMemory)
     BLOCK_COMMENT("Entry:");
   }
@@ -2350,7 +2785,7 @@ address StubGenerator::generate_conjoint_long_oop_copy(StubId stub_id, address n
   bs->arraycopy_prologue(_masm, decorators, type, from, to, qword_count);
   {
     // UnsafeMemoryAccess page error: continue after unsafe access
-    UnsafeMemoryAccessMark umam(this, !is_oop && !aligned, true);
+    UnsafeMemoryAccessMark umam(this, add_handlers, true);
 
     __ jmp(L_copy_bytes);
 
@@ -2377,7 +2812,7 @@ address StubGenerator::generate_conjoint_long_oop_copy(StubId stub_id, address n
   }
   {
     // UnsafeMemoryAccess page error: continue after unsafe access
-    UnsafeMemoryAccessMark umam(this, !is_oop && !aligned, true);
+    UnsafeMemoryAccessMark umam(this, add_handlers, true);
 
     // Copy in multi-bytes chunks
     copy_bytes_backward(from, to, qword_count, rax, r10, L_copy_bytes, L_copy_8_bytes, decorators, is_oop ? T_OBJECT : T_LONG);
@@ -2393,6 +2828,24 @@ address StubGenerator::generate_conjoint_long_oop_copy(StubId stub_id, address n
   __ leave(); // required for proper stackwalking of RuntimeStub frame
   __ ret(0);
 
+
+  // retrieve the registered handler addresses
+  address end = __ pc();
+  if (add_handlers) {
+    retrieve_unsafe_access_handlers(start, end, extras);
+  }
+  assert(extras.length() == expected_handler_count,
+         "unexpected handler addresses count %d", extras.length());
+#if INCLUDE_ZGC
+  // retrieve addresses at which ZGC does colour patching
+  if ((UseZGC && is_oop)) {
+    retrieve_reloc_addresses(start, end, extras);
+  }
+#endif // INCLUDE_ZGC
+  // record the stub entry and end plus the no_push entry and any
+  // extra handler addresses
+  store_archive_data(stub_id, start, end, entries_ptr, extras_ptr);
+
   return start;
 }
 
@@ -2448,6 +2901,28 @@ address StubGenerator::generate_checkcast_copy(StubId stub_id, address *entry) {
     ShouldNotReachHere();
   }
 
+  GrowableArray<address> entries;
+  GrowableArray<address> extras;
+  int expected_entry_count = (entry != nullptr ? 2 : 1);
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == expected_entry_count, "sanity check");
+  GrowableArray<address>* entries_ptr = (entry_count == 1 ? nullptr : &entries);
+  GrowableArray<address>* extras_ptr = (UseZGC ? &extras : nullptr);
+  address start = load_archive_data(stub_id, entries_ptr, extras_ptr);
+  if (start != nullptr) {
+    assert(entries.length() == expected_entry_count - 1,
+           "unexpected addresses count %d", entries.length());
+    if (entry != nullptr) {
+      *entry = entries.at(0);
+    }
+#if INCLUDE_ZGC
+    if (UseZGC)  {
+      register_reloc_addresses(extras, 0, extras.length());
+    }
+#endif // INCLUDE_ZGC
+    return start;
+  }
+
   Label L_load_element, L_store_element, L_do_card_marks, L_done;
 
   // Input registers (after setup_arg_regs)
@@ -2477,7 +2952,7 @@ address StubGenerator::generate_checkcast_copy(StubId stub_id, address *entry) {
 
   __ align(CodeEntryAlignment);
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
 
   __ enter(); // required for proper stackwalking of RuntimeStub frame
 
@@ -2502,6 +2977,7 @@ address StubGenerator::generate_checkcast_copy(StubId stub_id, address *entry) {
   // Caller of this entry point must set up the argument registers.
   if (entry != nullptr) {
     *entry = __ pc();
+    entries.append(*entry);
     BLOCK_COMMENT("Entry:");
   }
 
@@ -2636,6 +3112,16 @@ address StubGenerator::generate_checkcast_copy(StubId stub_id, address *entry) {
   __ leave(); // required for proper stackwalking of RuntimeStub frame
   __ ret(0);
 
+  address end = __ pc();
+#if INCLUDE_ZGC
+  // retrieve addresses at which ZGC does colour patching
+  if (UseZGC) {
+    retrieve_reloc_addresses(start, end, extras);
+  }
+#endif // INCLUDE_ZGC
+  // record the stub entry and end plus the no_push entry
+    store_archive_data(stub_id, start, end, entries_ptr, extras_ptr);
+
   return start;
 }
 
@@ -2655,6 +3141,14 @@ address StubGenerator::generate_checkcast_copy(StubId stub_id, address *entry) {
 address StubGenerator::generate_unsafe_copy(address byte_copy_entry, address short_copy_entry,
                                             address int_copy_entry, address long_copy_entry) {
 
+  StubId stub_id = StubId::stubgen_unsafe_arraycopy_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
+
   Label L_long_aligned, L_int_aligned, L_short_aligned;
 
   // Input registers (before setup_arg_regs)
@@ -2666,9 +3160,8 @@ address StubGenerator::generate_unsafe_copy(address byte_copy_entry, address sho
   const Register bits        = rax;      // test copy of low bits
 
   __ align(CodeEntryAlignment);
-  StubId stub_id = StubId::stubgen_unsafe_arraycopy_id;
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
 
   __ enter(); // required for proper stackwalking of RuntimeStub frame
 
@@ -2700,6 +3193,9 @@ address StubGenerator::generate_unsafe_copy(address byte_copy_entry, address sho
   __ shrptr(size, LogBytesPerLong); // size => qword_count
   __ jump(RuntimeAddress(long_copy_entry));
 
+  // record the stub entry and end plus
+  store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
@@ -2801,10 +3297,23 @@ static void do_setmemory_atomic_loop(USM_TYPE type, Register dest,
 // to an int, short, or byte fill loop.
 //
 address StubGenerator::generate_unsafe_setmemory(address unsafe_byte_fill) {
-  __ align(CodeEntryAlignment);
   StubId stub_id = StubId::stubgen_unsafe_setmemory_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  // we expect three set of extra unsafememory access handler entries
+  GrowableArray<address> extras;
+  int expected_handler_count = 3 * UnsafeMemoryAccess::COLUMN_COUNT;
+  address start = load_archive_data(stub_id, nullptr, &extras);
+  if (start != nullptr) {
+    assert(extras.length() == expected_handler_count,
+           "unexpected handler addresses count %d", extras.length());
+    register_unsafe_access_handlers(extras, 0, 3);
+    return start;
+  }
+
+  __ align(CodeEntryAlignment);
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
   __ enter();   // required for proper stackwalking of RuntimeStub frame
 
   assert(unsafe_byte_fill != nullptr, "Invalid call");
@@ -2894,6 +3403,16 @@ address StubGenerator::generate_unsafe_setmemory(address unsafe_byte_fill) {
     __ jump(RuntimeAddress(unsafe_byte_fill));
   }
 
+  // retrieve the registered handler addresses
+  address end = __ pc();
+  retrieve_unsafe_access_handlers(start, end, extras);
+  assert(extras.length() == expected_handler_count,
+         "unexpected handler addresses count %d", extras.length());
+
+  // record the stub entry and end plus the no_push entry and any
+  // extra handler addresses
+  store_archive_data(stub_id, start, end, nullptr, &extras);
+
   return start;
 }
 
@@ -2950,7 +3469,15 @@ address StubGenerator::generate_generic_copy(address byte_copy_entry, address sh
                                              address int_copy_entry, address oop_copy_entry,
                                              address long_copy_entry, address checkcast_copy_entry) {
 
-  Label L_failed, L_failed_0, L_objArray;
+  StubId stub_id = StubId::stubgen_generic_arraycopy_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
+
+  Label L_failed, L_failed_0, L_skip_failed_0, L_objArray;
   Label L_copy_shorts, L_copy_ints, L_copy_longs;
 
   // Input registers
@@ -2966,22 +3493,9 @@ address StubGenerator::generate_generic_copy(address byte_copy_entry, address sh
   const Register rklass_tmp = rdi;  // load_klass
 #endif
 
-  { int modulus = CodeEntryAlignment;
-    int target  = modulus - 5; // 5 = sizeof jmp(L_failed)
-    int advance = target - (__ offset() % modulus);
-    if (advance < 0)  advance += modulus;
-    if (advance > 0)  __ nop(advance);
-  }
-  StubId stub_id = StubId::stubgen_generic_arraycopy_id;
   StubCodeMark mark(this, stub_id);
-
-  // Short-hop target to L_failed.  Makes for denser prologue code.
-  __ BIND(L_failed_0);
-  __ jmp(L_failed);
-  assert(__ offset() % CodeEntryAlignment == 0, "no further alignment needed");
-
   __ align(CodeEntryAlignment);
-  address start = __ pc();
+  start = __ pc();
 
   __ enter(); // required for proper stackwalking of RuntimeStub frame
 
@@ -3022,7 +3536,8 @@ address StubGenerator::generate_generic_copy(address byte_copy_entry, address sh
   //  if (dst_pos < 0) return -1;
   __ testl(dst_pos, dst_pos); // dst_pos (32-bits)
   size_t j4off = __ offset();
-  __ jccb(Assembler::negative, L_failed_0);
+  // skip over the failure trampoline
+  __ jccb(Assembler::positive, L_skip_failed_0);
 
   // The first four tests are very dense code,
   // but not quite dense enough to put four
@@ -3032,6 +3547,13 @@ address StubGenerator::generate_generic_copy(address byte_copy_entry, address sh
   // Make sure of this.
   guarantee(((j1off ^ j4off) & ~15) != 0, "I$ line of 1st & 4th jumps");
 
+  // Short-hop target to L_failed.  Makes for denser prologue code.
+  __ BIND(L_failed_0);
+  __ jmp(L_failed);
+
+  // continue here if first 4 checks pass
+  __ bind(L_skip_failed_0);
+
   // registers used as temp
   const Register r11_length    = r11; // elements count to copy
   const Register r10_src_klass = r10; // array klass
@@ -3254,6 +3776,9 @@ __ BIND(L_failed);
   __ leave();   // required for proper stackwalking of RuntimeStub frame
   __ ret(0);
 
+  // record the stub entry and end
+  store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
diff --git a/src/hotspot/cpu/x86/stubGenerator_x86_64_cbrt.cpp b/src/hotspot/cpu/x86/stubGenerator_x86_64_cbrt.cpp
index 73330dedc0f..4c647b7d9dc 100644
--- a/src/hotspot/cpu/x86/stubGenerator_x86_64_cbrt.cpp
+++ b/src/hotspot/cpu/x86/stubGenerator_x86_64_cbrt.cpp
@@ -191,8 +191,14 @@ ATTRIBUTE_ALIGNED(4) static const juint _D_table[] =
 
 address StubGenerator::generate_libmCbrt() {
   StubId stub_id = StubId::stubgen_dcbrt_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
 
   Label L_2TAG_PACKET_0_0_1, L_2TAG_PACKET_1_0_1, L_2TAG_PACKET_2_0_1;
   Label B1_1, B1_2, B1_4;
@@ -335,7 +341,34 @@ address StubGenerator::generate_libmCbrt() {
   __ leave(); // required for proper stackwalking of RuntimeStub frame
   __ ret(0);
 
+  // record the stub entry and end
+  store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
 #undef __
+
+#if INCLUDE_CDS
+void StubGenerator::init_AOTAddressTable_cbrt(GrowableArray<address>& external_addresses) {
+#define ADD(addr) external_addresses.append((address)(addr))
+  ADD(_ABS_MASK);
+  ADD(_SIG_MASK);
+  ADD(_EXP_MASK);
+  ADD(_EXP_MSK2);
+  ADD(_EXP_MSK3);
+  ADD(_SCALE63);
+  ADD(_ZERON);
+  ADD(_INF);
+  ADD(_NEG_INF);
+  address coeff_table = (address)_coeff_table;
+  ADD(coeff_table);
+  ADD(coeff_table + 16);
+  ADD(coeff_table + 32);
+  ADD(coeff_table + 48);
+  ADD(_rcp_table);
+  ADD(_cbrt_table);
+  ADD(_D_table);
+#undef ADD
+}
+#endif // INCLUDE_CDS
diff --git a/src/hotspot/cpu/x86/stubGenerator_x86_64_chacha.cpp b/src/hotspot/cpu/x86/stubGenerator_x86_64_chacha.cpp
index 7afaf34e031..1fa51cd2f18 100644
--- a/src/hotspot/cpu/x86/stubGenerator_x86_64_chacha.cpp
+++ b/src/hotspot/cpu/x86/stubGenerator_x86_64_chacha.cpp
@@ -111,10 +111,16 @@ void StubGenerator::generate_chacha_stubs() {
 
 /* The 2-block AVX/AVX2-enabled ChaCha20 block function implementation */
 address StubGenerator::generate_chacha20Block_avx() {
-  __ align(CodeEntryAlignment);
   StubId stub_id = StubId::stubgen_chacha20Block_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
+  __ align(CodeEntryAlignment);
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
 
   Label L_twoRounds;
   const Register state        = c_rarg0;
@@ -295,15 +301,25 @@ address StubGenerator::generate_chacha20Block_avx() {
   }
   __ leave();
   __ ret(0);
+
+  // record the stub entry and end
+  store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
 /* The 4-block AVX512-enabled ChaCha20 block function implementation */
 address StubGenerator::generate_chacha20Block_avx512() {
-  __ align(CodeEntryAlignment);
   StubId stub_id = StubId::stubgen_chacha20Block_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
+  __ align(CodeEntryAlignment);
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
 
   Label L_twoRounds;
   const Register state        = c_rarg0;
@@ -466,6 +482,10 @@ address StubGenerator::generate_chacha20Block_avx512() {
   __ vzeroupper();
   __ leave();
   __ ret(0);
+
+  // record the stub entry and end
+  store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
@@ -584,3 +604,13 @@ bVec,
 }
 
 #undef __
+
+#if INCLUDE_CDS
+void StubGenerator::init_AOTAddressTable_chacha(GrowableArray<address>& external_addresses) {
+#define ADD(addr) external_addresses.append((address)(addr))
+  ADD(CC20_COUNTER_ADD_AVX);
+  ADD(CC20_COUNTER_ADD_AVX512);
+  ADD(CC20_LROT_CONSTS);
+#undef ADD
+}
+#endif // INCLUDE_CDS
diff --git a/src/hotspot/cpu/x86/stubGenerator_x86_64_constants.cpp b/src/hotspot/cpu/x86/stubGenerator_x86_64_constants.cpp
index 93fa7e650db..45c13b7b397 100644
--- a/src/hotspot/cpu/x86/stubGenerator_x86_64_constants.cpp
+++ b/src/hotspot/cpu/x86/stubGenerator_x86_64_constants.cpp
@@ -233,3 +233,29 @@ ATTRIBUTE_ALIGNED(16) static const juint _Ctable[] = {
 };
 address StubGenerator::Ctable = (address)_Ctable;
 
+#if INCLUDE_CDS
+void StubGenerator::init_AOTAddressTable_constants(GrowableArray<address>& external_addresses) {
+#define ADD(addr) external_addresses.append((address)(addr))
+  ADD(_ONE);
+  ADD(_ONEHALF);
+  ADD(_SIGN_MASK);
+  ADD(_TWO_POW_55);
+  ADD(_TWO_POW_M55);
+  ADD(_SHIFTER);
+  ADD(_ZERO);
+  ADD(_SC_1);
+  ADD(_SC_2);
+  ADD(_SC_3);
+  ADD(_SC_4);
+  ADD(_PI_4);
+  ADD(((address)_PI_4+8));
+  ADD(_PI32INV);
+  ADD(_NEG_ZERO);
+  ADD(_P_1);
+  ADD(_P_2);
+  ADD(_P_3);
+  ADD(_PI_INV_TABLE);
+  ADD(_Ctable);
+#undef ADD
+}
+#endif // INCLUDE_CDS
diff --git a/src/hotspot/cpu/x86/stubGenerator_x86_64_cos.cpp b/src/hotspot/cpu/x86/stubGenerator_x86_64_cos.cpp
index 8cb6ead21fd..8dedd50cd97 100644
--- a/src/hotspot/cpu/x86/stubGenerator_x86_64_cos.cpp
+++ b/src/hotspot/cpu/x86/stubGenerator_x86_64_cos.cpp
@@ -174,8 +174,14 @@
 
 address StubGenerator::generate_libmCos() {
   StubId stub_id = StubId::stubgen_dcos_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
 
   Label L_2TAG_PACKET_0_0_1, L_2TAG_PACKET_1_0_1, L_2TAG_PACKET_2_0_1, L_2TAG_PACKET_3_0_1;
   Label L_2TAG_PACKET_4_0_1, L_2TAG_PACKET_5_0_1, L_2TAG_PACKET_6_0_1, L_2TAG_PACKET_7_0_1;
@@ -619,6 +625,9 @@ address StubGenerator::generate_libmCos() {
   __ leave(); // required for proper stackwalking of RuntimeStub frame
   __ ret(0);
 
+  // record the stub entry and end
+  store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
diff --git a/src/hotspot/cpu/x86/stubGenerator_x86_64_dilithium.cpp b/src/hotspot/cpu/x86/stubGenerator_x86_64_dilithium.cpp
index b9590939468..de8f52a3c05 100644
--- a/src/hotspot/cpu/x86/stubGenerator_x86_64_dilithium.cpp
+++ b/src/hotspot/cpu/x86/stubGenerator_x86_64_dilithium.cpp
@@ -401,10 +401,16 @@ static void storeXmms(Register destination, int offset, const XMMRegister xmmReg
 //
 static address generate_dilithiumAlmostNtt_avx(StubGenerator *stubgen,
                                                int vector_len, MacroAssembler *_masm) {
-  __ align(CodeEntryAlignment);
   StubId stub_id = StubId::stubgen_dilithiumAlmostNtt_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = stubgen->load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
+  __ align(CodeEntryAlignment);
   StubCodeMark mark(stubgen, stub_id);
-  address start = __ pc();
+  start = __ pc();
   __ enter();
 
   const Register coeffs = c_rarg0;
@@ -646,6 +652,9 @@ static address generate_dilithiumAlmostNtt_avx(StubGenerator *stubgen,
   __ mov64(rax, 0); // return 0
   __ ret(0);
 
+  // record the stub entry and end
+  stubgen->store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
@@ -657,10 +666,16 @@ static address generate_dilithiumAlmostNtt_avx(StubGenerator *stubgen,
 // zetas (int[128*8]) = c_rarg1
 static address generate_dilithiumAlmostInverseNtt_avx(StubGenerator *stubgen,
                                         int vector_len, MacroAssembler *_masm) {
-  __ align(CodeEntryAlignment);
   StubId stub_id = StubId::stubgen_dilithiumAlmostInverseNtt_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = stubgen->load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
+  __ align(CodeEntryAlignment);
   StubCodeMark mark(stubgen, stub_id);
-  address start = __ pc();
+  start = __ pc();
   __ enter();
 
   const Register coeffs = c_rarg0;
@@ -886,6 +901,9 @@ static address generate_dilithiumAlmostInverseNtt_avx(StubGenerator *stubgen,
   __ mov64(rax, 0); // return 0
   __ ret(0);
 
+  // record the stub entry and end
+  stubgen->store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
@@ -900,10 +918,16 @@ static address generate_dilithiumAlmostInverseNtt_avx(StubGenerator *stubgen,
 static address generate_dilithiumNttMult_avx(StubGenerator *stubgen,
                                      int vector_len, MacroAssembler *_masm) {
 
-  __ align(CodeEntryAlignment);
   StubId stub_id = StubId::stubgen_dilithiumNttMult_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = stubgen->load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
+  __ align(CodeEntryAlignment);
   StubCodeMark mark(stubgen, stub_id);
-  address start = __ pc();
+  start = __ pc();
   __ enter();
 
   Label L_loop;
@@ -972,6 +996,9 @@ static address generate_dilithiumNttMult_avx(StubGenerator *stubgen,
   __ mov64(rax, 0); // return 0
   __ ret(0);
 
+  // record the stub entry and end
+  stubgen->store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
@@ -984,10 +1011,16 @@ static address generate_dilithiumNttMult_avx(StubGenerator *stubgen,
 static address generate_dilithiumMontMulByConstant_avx(StubGenerator *stubgen,
                                         int vector_len, MacroAssembler *_masm) {
 
-  __ align(CodeEntryAlignment);
   StubId stub_id = StubId::stubgen_dilithiumMontMulByConstant_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = stubgen->load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
+  __ align(CodeEntryAlignment);
   StubCodeMark mark(stubgen, stub_id);
-  address start = __ pc();
+  start = __ pc();
   __ enter();
 
   Label L_loop;
@@ -1059,6 +1092,9 @@ static address generate_dilithiumMontMulByConstant_avx(StubGenerator *stubgen,
   __ mov64(rax, 0); // return 0
   __ ret(0);
 
+  // record the stub entry and end
+  stubgen->store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
@@ -1073,10 +1109,16 @@ static address generate_dilithiumMontMulByConstant_avx(StubGenerator *stubgen,
 // multiplier (int) = c_rarg4
 static address generate_dilithiumDecomposePoly_avx(StubGenerator *stubgen,
                                       int vector_len, MacroAssembler *_masm) {
-  __ align(CodeEntryAlignment);
   StubId stub_id = StubId::stubgen_dilithiumDecomposePoly_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = stubgen->load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
+  __ align(CodeEntryAlignment);
   StubCodeMark mark(stubgen, stub_id);
-  address start = __ pc();
+  start = __ pc();
   __ enter();
 
   Label L_loop;
@@ -1318,6 +1360,9 @@ static address generate_dilithiumDecomposePoly_avx(StubGenerator *stubgen,
   __ mov64(rax, 0); // return 0
   __ ret(0);
 
+  // record the stub entry and end
+  stubgen->store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
@@ -1340,3 +1385,21 @@ void StubGenerator::generate_dilithium_stubs() {
         generate_dilithiumDecomposePoly_avx(this, vector_len, _masm);
   }
 }
+
+#if INCLUDE_CDS
+void StubGenerator::init_AOTAddressTable_dilithium(GrowableArray<address>& external_addresses) {
+#define ADD(addr) external_addresses.append((address)(addr))
+  // use accessors to correctly identify the relevant addresses
+  ADD(unshufflePermsAddr(0));
+  ADD(unshufflePermsAddr(1));
+  ADD(unshufflePermsAddr(2));
+  ADD(unshufflePermsAddr(3));
+  ADD(unshufflePermsAddr(4));
+  ADD(unshufflePermsAddr(5));
+  ADD(dilithiumAvx512ConstsAddr(montQInvModRIdx));
+  ADD(dilithiumAvx512ConstsAddr(dilithium_qIdx));
+  ADD(dilithiumAvx512ConstsAddr(montRSquareModQIdx));
+  ADD(dilithiumAvx512ConstsAddr(barrettAddendIdx));
+#undef ADD
+}
+#endif // INCLUDE_CDS
diff --git a/src/hotspot/cpu/x86/stubGenerator_x86_64_exp.cpp b/src/hotspot/cpu/x86/stubGenerator_x86_64_exp.cpp
index 5130fd2c9d2..2ed9858bf0c 100644
--- a/src/hotspot/cpu/x86/stubGenerator_x86_64_exp.cpp
+++ b/src/hotspot/cpu/x86/stubGenerator_x86_64_exp.cpp
@@ -166,8 +166,14 @@ ATTRIBUTE_ALIGNED(4) static const juint _INF[] =
 
 address StubGenerator::generate_libmExp() {
   StubId stub_id = StubId::stubgen_dexp_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
 
   Label L_2TAG_PACKET_0_0_2, L_2TAG_PACKET_1_0_2, L_2TAG_PACKET_2_0_2, L_2TAG_PACKET_3_0_2;
   Label L_2TAG_PACKET_4_0_2, L_2TAG_PACKET_5_0_2, L_2TAG_PACKET_6_0_2, L_2TAG_PACKET_7_0_2;
@@ -381,7 +387,31 @@ address StubGenerator::generate_libmExp() {
   __ leave(); // required for proper stackwalking of RuntimeStub frame
   __ ret(0);
 
+  // record the stub entry and end
+  store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
 #undef __
+
+#if INCLUDE_CDS
+void StubGenerator::init_AOTAddressTable_exp(GrowableArray<address>& external_addresses) {
+#define ADD(addr) external_addresses.append((address)addr);
+  ADD(_cv);
+  ADD(((address)_cv+16));
+  ADD(((address)_cv+32));
+  ADD(((address)_cv+48));
+  ADD(((address)_cv+64));
+  ADD(((address)_cv+80));
+  ADD(_mmask);
+  ADD(_bias);
+  ADD(_Tbl_addr);
+  ADD(_ALLONES);
+  ADD(_ebias);
+  ADD(_XMAX);
+  ADD(_XMIN);
+  ADD(_INF);
+#undef ADD
+}
+#endif // INCLUDE_CDS
diff --git a/src/hotspot/cpu/x86/stubGenerator_x86_64_fmod.cpp b/src/hotspot/cpu/x86/stubGenerator_x86_64_fmod.cpp
index a0962943556..f73c8ed459e 100644
--- a/src/hotspot/cpu/x86/stubGenerator_x86_64_fmod.cpp
+++ b/src/hotspot/cpu/x86/stubGenerator_x86_64_fmod.cpp
@@ -72,10 +72,16 @@ ATTRIBUTE_ALIGNED(32) static const uint64_t CONST_e307[] = {
 };
 
 address StubGenerator::generate_libmFmod() {
-  __ align(CodeEntryAlignment);
   StubId stub_id = StubId::stubgen_fmod_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
+  __ align(CodeEntryAlignment);
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
   __ enter(); // required for proper stackwalking of RuntimeStub frame
 
   if (VM_Version::supports_avx512vlbwdq() && VM_Version::supports_fma()) {     // AVX512 version
@@ -521,7 +527,22 @@ address StubGenerator::generate_libmFmod() {
   __ leave(); // required for proper stackwalking of RuntimeStub frame
   __ ret(0);
 
+  // record the stub entry and end
+  store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
 #undef __
+
+#if INCLUDE_CDS
+void StubGenerator::init_AOTAddressTable_fmod(GrowableArray<address>& external_addresses) {
+#define ADD(addr) external_addresses.append((address)addr);
+  ADD(CONST_NaN);
+  ADD(CONST_1p260);
+  ADD(CONST_MAX);
+  ADD(CONST_INF);
+  ADD(CONST_e307);
+#undef ADD
+}
+#endif // INCLUDE_CDS
diff --git a/src/hotspot/cpu/x86/stubGenerator_x86_64_ghash.cpp b/src/hotspot/cpu/x86/stubGenerator_x86_64_ghash.cpp
index 6f05b1ab5e6..557fe623351 100644
--- a/src/hotspot/cpu/x86/stubGenerator_x86_64_ghash.cpp
+++ b/src/hotspot/cpu/x86/stubGenerator_x86_64_ghash.cpp
@@ -80,11 +80,17 @@ void StubGenerator::generate_ghash_stubs() {
 
 // Single and multi-block ghash operations.
 address StubGenerator::generate_ghash_processBlocks() {
-  __ align(CodeEntryAlignment);
-  Label L_ghash_loop, L_exit;
   StubId stub_id = StubId::stubgen_ghash_processBlocks_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
+  Label L_ghash_loop, L_exit;
+  __ align(CodeEntryAlignment);
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
 
   const Register state        = c_rarg0;
   const Register subkeyH      = c_rarg1;
@@ -211,17 +217,25 @@ address StubGenerator::generate_ghash_processBlocks() {
   __ leave();
   __ ret(0);
 
+  // record the stub entry and end
+  store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
 
 // Ghash single and multi block operations using AVX instructions
 address StubGenerator::generate_avx_ghash_processBlocks() {
-  __ align(CodeEntryAlignment);
-
   StubId stub_id = StubId::stubgen_ghash_processBlocks_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
+  __ align(CodeEntryAlignment);
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
 
   // arguments
   const Register state = c_rarg0;
@@ -237,6 +251,9 @@ address StubGenerator::generate_avx_ghash_processBlocks() {
   __ leave(); // required for proper stackwalking of RuntimeStub frame
   __ ret(0);
 
+  // record the stub entry and end
+  store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
@@ -538,3 +555,14 @@ void StubGenerator::generateHtbl_eight_blocks(Register htbl) {
 }
 
 #undef __
+
+#if INCLUDE_CDS
+void StubGenerator::init_AOTAddressTable_ghash(GrowableArray<address>& external_addresses) {
+#define ADD(addr) external_addresses.append((address)addr);
+  ADD(GHASH_SHUFFLE_MASK);
+  ADD(GHASH_LONG_SWAP_MASK);
+  ADD(GHASH_BYTE_SWAP_MASK);
+  ADD(GHASH_POLYNOMIAL);
+#undef ADD
+}
+#endif // INCLUDE_CDS
diff --git a/src/hotspot/cpu/x86/stubGenerator_x86_64_kyber.cpp b/src/hotspot/cpu/x86/stubGenerator_x86_64_kyber.cpp
index 7d5dee6a5df..347a9b936a8 100644
--- a/src/hotspot/cpu/x86/stubGenerator_x86_64_kyber.cpp
+++ b/src/hotspot/cpu/x86/stubGenerator_x86_64_kyber.cpp
@@ -400,10 +400,16 @@ static int xmm29_29[] = {29, 29, 29, 29};
 // ntt_zetas (short[256]) = c_rarg1
 address generate_kyberNtt_avx512(StubGenerator *stubgen,
                                  MacroAssembler *_masm) {
-  __ align(CodeEntryAlignment);
   StubId stub_id = StubId::stubgen_kyberNtt_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = stubgen->load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
+  __ align(CodeEntryAlignment);
   StubCodeMark mark(stubgen, stub_id);
-  address start = __ pc();
+  start = __ pc();
   __ enter();
 
   const Register coeffs = c_rarg0;
@@ -487,6 +493,9 @@ address generate_kyberNtt_avx512(StubGenerator *stubgen,
   __ mov64(rax, 0); // return 0
   __ ret(0);
 
+  // record the stub entry and end
+  stubgen->store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
@@ -496,11 +505,16 @@ address generate_kyberNtt_avx512(StubGenerator *stubgen,
 // ntt_zetas (short[256]) = c_rarg1
 address generate_kyberInverseNtt_avx512(StubGenerator *stubgen,
                                         MacroAssembler *_masm) {
-
-  __ align(CodeEntryAlignment);
   StubId stub_id = StubId::stubgen_kyberInverseNtt_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = stubgen->load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
+  __ align(CodeEntryAlignment);
   StubCodeMark mark(stubgen, stub_id);
-  address start = __ pc();
+  start = __ pc();
   __ enter();
 
   const Register coeffs = c_rarg0;
@@ -610,6 +624,9 @@ address generate_kyberInverseNtt_avx512(StubGenerator *stubgen,
   __ mov64(rax, 0); // return 0
   __ ret(0);
 
+  // record the stub entry and end
+  stubgen->store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
@@ -621,11 +638,16 @@ address generate_kyberInverseNtt_avx512(StubGenerator *stubgen,
 // zetas (short[128]) = c_rarg3
 address generate_kyberNttMult_avx512(StubGenerator *stubgen,
                                      MacroAssembler *_masm) {
-
-  __ align(CodeEntryAlignment);
   StubId stub_id = StubId::stubgen_kyberNttMult_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = stubgen->load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
+  __ align(CodeEntryAlignment);
   StubCodeMark mark(stubgen, stub_id);
-  address start = __ pc();
+  start = __ pc();
   __ enter();
 
   const Register result = c_rarg0;
@@ -731,6 +753,9 @@ address generate_kyberNttMult_avx512(StubGenerator *stubgen,
   __ mov64(rax, 0); // return 0
   __ ret(0);
 
+  // record the stub entry and end
+  stubgen->store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
@@ -741,11 +766,16 @@ address generate_kyberNttMult_avx512(StubGenerator *stubgen,
 // b (short[256]) = c_rarg2
 address generate_kyberAddPoly_2_avx512(StubGenerator *stubgen,
                                        MacroAssembler *_masm) {
-
-  __ align(CodeEntryAlignment);
   StubId stub_id = StubId::stubgen_kyberAddPoly_2_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = stubgen->load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
+  __ align(CodeEntryAlignment);
   StubCodeMark mark(stubgen, stub_id);
-  address start = __ pc();
+  start = __ pc();
   __ enter();
 
   const Register result = c_rarg0;
@@ -776,6 +806,9 @@ address generate_kyberAddPoly_2_avx512(StubGenerator *stubgen,
   __ mov64(rax, 0); // return 0
   __ ret(0);
 
+  // record the stub entry and end
+  stubgen->store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
@@ -787,11 +820,16 @@ address generate_kyberAddPoly_2_avx512(StubGenerator *stubgen,
 // c (short[256]) = c_rarg3
 address generate_kyberAddPoly_3_avx512(StubGenerator *stubgen,
                                        MacroAssembler *_masm) {
-
-  __ align(CodeEntryAlignment);
   StubId stub_id = StubId::stubgen_kyberAddPoly_3_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = stubgen->load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
+  __ align(CodeEntryAlignment);
   StubCodeMark mark(stubgen, stub_id);
-  address start = __ pc();
+  start = __ pc();
   __ enter();
 
   const Register result = c_rarg0;
@@ -830,6 +868,9 @@ address generate_kyberAddPoly_3_avx512(StubGenerator *stubgen,
   __ mov64(rax, 0); // return 0
   __ ret(0);
 
+  // record the stub entry and end
+  stubgen->store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
@@ -841,11 +882,16 @@ address generate_kyberAddPoly_3_avx512(StubGenerator *stubgen,
 // parsedLength (int) = c_rarg3
 address generate_kyber12To16_avx512(StubGenerator *stubgen,
                                     MacroAssembler *_masm) {
-
-  __ align(CodeEntryAlignment);
   StubId stub_id = StubId::stubgen_kyber12To16_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = stubgen->load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
+  __ align(CodeEntryAlignment);
   StubCodeMark mark(stubgen, stub_id);
-  address start = __ pc();
+  start = __ pc();
   __ enter();
 
   const Register condensed = c_rarg0;
@@ -984,6 +1030,9 @@ address generate_kyber12To16_avx512(StubGenerator *stubgen,
   __ mov64(rax, 0); // return 0
   __ ret(0);
 
+  // record the stub entry and end
+  stubgen->store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
@@ -993,11 +1042,16 @@ address generate_kyber12To16_avx512(StubGenerator *stubgen,
 // coeffs (short[256]) = c_rarg0
 address generate_kyberBarrettReduce_avx512(StubGenerator *stubgen,
                                            MacroAssembler *_masm) {
-
-  __ align(CodeEntryAlignment);
   StubId stub_id = StubId::stubgen_kyberBarrettReduce_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = stubgen->load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
+  __ align(CodeEntryAlignment);
   StubCodeMark mark(stubgen, stub_id);
-  address start = __ pc();
+  start = __ pc();
   __ enter();
 
   const Register coeffs = c_rarg0;
@@ -1021,6 +1075,9 @@ address generate_kyberBarrettReduce_avx512(StubGenerator *stubgen,
   __ mov64(rax, 0); // return 0
   __ ret(0);
 
+  // record the stub entry and end
+  stubgen->store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
@@ -1038,3 +1095,24 @@ void StubGenerator::generate_kyber_stubs() {
     }
   }
 }
+
+#if INCLUDE_CDS
+void StubGenerator::init_AOTAddressTable_kyber(GrowableArray<address>& external_addresses) {
+#define ADD(addr) external_addresses.append((address)(addr))
+  // use accessors to correctly identify the relevant addresses
+  ADD(kyberAvx512NttPermsAddr());
+  ADD(kyberAvx512InverseNttPermsAddr());
+  ADD(kyberAvx512_nttMultPermsAddr());
+  ADD(kyberAvx512_12To16PermsAddr());
+  ADD(kyberAvx512_12To16DupAddr());
+  ADD(kyberAvx512_12To16ShiftAddr());
+  ADD(kyberAvx512_12To16AndAddr());
+  ADD(kyberAvx512ConstsAddr(qOffset));
+  ADD(kyberAvx512ConstsAddr(qInvModROffset));
+  ADD(kyberAvx512ConstsAddr(dimHalfInverseOffset));
+  ADD(kyberAvx512ConstsAddr(barretMultiplierOffset));
+  ADD(kyberAvx512ConstsAddr(montRSquareModqOffset));
+  ADD(kyberAvx512ConstsAddr(f00Offset));
+#undef ADD
+}
+#endif // INCLUDE_CDS
diff --git a/src/hotspot/cpu/x86/stubGenerator_x86_64_log.cpp b/src/hotspot/cpu/x86/stubGenerator_x86_64_log.cpp
index 6b5b4d704e3..8849597c94b 100644
--- a/src/hotspot/cpu/x86/stubGenerator_x86_64_log.cpp
+++ b/src/hotspot/cpu/x86/stubGenerator_x86_64_log.cpp
@@ -177,8 +177,14 @@ ATTRIBUTE_ALIGNED(16) static const juint _coeff[] =
 
 address StubGenerator::generate_libmLog() {
   StubId stub_id = StubId::stubgen_dlog_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
 
   Label L_2TAG_PACKET_0_0_2, L_2TAG_PACKET_1_0_2, L_2TAG_PACKET_2_0_2, L_2TAG_PACKET_3_0_2;
   Label L_2TAG_PACKET_4_0_2, L_2TAG_PACKET_5_0_2, L_2TAG_PACKET_6_0_2, L_2TAG_PACKET_7_0_2;
@@ -359,6 +365,9 @@ address StubGenerator::generate_libmLog() {
   __ leave(); // required for proper stackwalking of RuntimeStub frame
   __ ret(0);
 
+  // record the stub entry and end
+  store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
@@ -516,8 +525,14 @@ ATTRIBUTE_ALIGNED(16) static const juint _coeff_log10[] =
 
 address StubGenerator::generate_libmLog10() {
   StubId stub_id = StubId::stubgen_dlog10_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
 
   Label L_2TAG_PACKET_0_0_2, L_2TAG_PACKET_1_0_2, L_2TAG_PACKET_2_0_2, L_2TAG_PACKET_3_0_2;
   Label L_2TAG_PACKET_4_0_2, L_2TAG_PACKET_5_0_2, L_2TAG_PACKET_6_0_2, L_2TAG_PACKET_7_0_2;
@@ -704,7 +719,32 @@ address StubGenerator::generate_libmLog10() {
   __ leave(); // required for proper stackwalking of RuntimeStub frame
   __ ret(0);
 
+  // record the stub entry and end
+  store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
 #undef __
+
+#if INCLUDE_CDS
+void StubGenerator::init_AOTAddressTable_log(GrowableArray<address>& external_addresses) {
+#define ADD(addr) external_addresses.append((address)addr);
+  ADD(_L_tbl);
+  ADD(_log2);
+  ADD(((address)_log2+8));
+  ADD(_coeff);
+  ADD(((address)_coeff+16));
+  ADD(((address)_coeff+32));
+  ADD(_HIGHSIGMASK_log10);
+  ADD(_LOG10_E);
+  ADD(((address)_LOG10_E+8));
+  ADD(_L_tbl_log10);
+  ADD(_log2_log10);
+  ADD(((address)_log2_log10+8));
+  ADD(_coeff_log10);
+  ADD(((address)_coeff_log10+16));
+  ADD(((address)_coeff_log10+32));
+#undef ADD
+}
+#endif // INCLUDE_CDS
diff --git a/src/hotspot/cpu/x86/stubGenerator_x86_64_poly1305.cpp b/src/hotspot/cpu/x86/stubGenerator_x86_64_poly1305.cpp
index c80b2d16181..1d0e961c82d 100644
--- a/src/hotspot/cpu/x86/stubGenerator_x86_64_poly1305.cpp
+++ b/src/hotspot/cpu/x86/stubGenerator_x86_64_poly1305.cpp
@@ -909,10 +909,16 @@ void StubGenerator::poly1305_process_blocks_avx512(
 // After execution, input and length will point at remaining (unprocessed) data
 // and accumulator will point to the current accumulator value
 address StubGenerator::generate_poly1305_processBlocks() {
-  __ align(CodeEntryAlignment);
   StubId stub_id = StubId::stubgen_poly1305_processBlocks_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
+  __ align(CodeEntryAlignment);
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
   __ enter();
 
   // Save all 'SOE' registers
@@ -1028,6 +1034,10 @@ address StubGenerator::generate_poly1305_processBlocks() {
 
   __ leave();
   __ ret(0);
+
+  // record the stub entry and end
+  store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
@@ -1695,3 +1705,14 @@ void StubGenerator::poly1305_msg_mul_reduce_vec4_avx2(
   __ vpaddq(A1, A1, YTMP2, Assembler::AVX_256bit); //Add medium 42-bit bits from new blocks to accumulator
   __ vpaddq(A1, A1, YTMP5, Assembler::AVX_256bit);
 }
+#undef __
+
+#if INCLUDE_CDS
+void StubGenerator::init_AOTAddressTable_poly1305(GrowableArray<address>& external_addresses) {
+#define ADD(addr) external_addresses.append((address)addr);
+  ADD(POLY1305_PAD_MSG);
+  ADD(POLY1305_MASK42);
+  ADD(POLY1305_MASK44);
+#undef ADD
+}
+#endif // INCLUDE_CDS
diff --git a/src/hotspot/cpu/x86/stubGenerator_x86_64_poly_mont.cpp b/src/hotspot/cpu/x86/stubGenerator_x86_64_poly_mont.cpp
index c439e0b370f..4648fe03aa0 100644
--- a/src/hotspot/cpu/x86/stubGenerator_x86_64_poly_mont.cpp
+++ b/src/hotspot/cpu/x86/stubGenerator_x86_64_poly_mont.cpp
@@ -558,10 +558,16 @@ void montgomeryMultiplyAVX2(const Register aLimbs, const Register bLimbs, const
 }
 
 address StubGenerator::generate_intpoly_montgomeryMult_P256() {
-  __ align(CodeEntryAlignment);
   StubId stub_id = StubId::stubgen_intpoly_montgomeryMult_P256_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
+  __ align(CodeEntryAlignment);
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
   __ enter();
 
   if (VM_Version::supports_avx512ifma() && VM_Version::supports_avx512vlbw()) {
@@ -620,6 +626,10 @@ address StubGenerator::generate_intpoly_montgomeryMult_P256() {
 
   __ leave();
   __ ret(0);
+
+  // record the stub entry and end
+  store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
@@ -680,10 +690,16 @@ address StubGenerator::generate_intpoly_assign() {
   //   P521OrderField:         19 = 8 + 8 + 2 + 1
   // Special Cases 5, 10, 14, 16, 19
 
-  __ align(CodeEntryAlignment);
   StubId stub_id = StubId::stubgen_intpoly_assign_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
+  __ align(CodeEntryAlignment);
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
   __ enter();
 
   // Inputs
@@ -762,5 +778,24 @@ address StubGenerator::generate_intpoly_assign() {
   __ bind(L_Done);
   __ leave();
   __ ret(0);
+
+  // record the stub entry and end
+  store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
+#undef __
+
+#if INCLUDE_CDS
+void StubGenerator::init_AOTAddressTable_poly_mont(GrowableArray<address>& external_addresses) {
+#define ADD(addr) external_addresses.append((address)addr);
+  // use accessors to retrieve all correct addresses
+  ADD(shift_1L());
+  ADD(shift_1R());
+  ADD(p256_mask52());
+  ADD(mask_limb5());
+  ADD(modulus_p256());
+  ADD(modulus_p256(1));
+#undef ADD
+}
+#endif // INCLUDE_CDS
diff --git a/src/hotspot/cpu/x86/stubGenerator_x86_64_pow.cpp b/src/hotspot/cpu/x86/stubGenerator_x86_64_pow.cpp
index 3c3df7e6ac4..5ff09e2b377 100644
--- a/src/hotspot/cpu/x86/stubGenerator_x86_64_pow.cpp
+++ b/src/hotspot/cpu/x86/stubGenerator_x86_64_pow.cpp
@@ -760,8 +760,14 @@ ATTRIBUTE_ALIGNED(8) static const juint _DOUBLE0DOT5[] = {
 
 address StubGenerator::generate_libmPow() {
   StubId stub_id = StubId::stubgen_dpow_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
 
   Label L_2TAG_PACKET_0_0_2, L_2TAG_PACKET_1_0_2, L_2TAG_PACKET_2_0_2, L_2TAG_PACKET_3_0_2;
   Label L_2TAG_PACKET_4_0_2, L_2TAG_PACKET_5_0_2, L_2TAG_PACKET_6_0_2, L_2TAG_PACKET_7_0_2;
@@ -1859,7 +1865,40 @@ address StubGenerator::generate_libmPow() {
   __ leave(); // required for proper stackwalking of RuntimeStub frame
   __ ret(0);
 
+  // record the stub entry and end
+  store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
 #undef __
+
+#if INCLUDE_CDS
+void StubGenerator::init_AOTAddressTable_pow(GrowableArray<address>& external_addresses) {
+#define ADD(addr) external_addresses.append((address)addr);
+  ADD(_HIGHSIGMASK);
+  ADD(_LOG2_E);
+  ADD(_HIGHMASK_Y);
+  ADD((address)_HIGHMASK_Y+8);
+  ADD(_T_exp);
+  ADD(_e_coeff);
+  ADD((address)_e_coeff+16);
+  ADD((address)_e_coeff+32);
+  ADD(_coeff_h);
+  ADD((address)_coeff_h+8);
+  ADD(_HIGHMASK_LOG_X);
+  ADD(_HALFMASK);
+  ADD(_coeff_pow);
+  ADD((address)_coeff_pow+16);
+  ADD((address)_coeff_pow+32);
+  ADD((address)_coeff_pow+48);
+  ADD((address)_coeff_pow+64);
+  ADD((address)_coeff_pow+80);
+  ADD(_L_tbl_pow);
+  ADD(_log2_pow);
+  ADD(_DOUBLE2);
+  ADD(_DOUBLE0);
+  ADD(_DOUBLE0DOT5);
+#undef ADD
+}
+#endif // INCLUDE_CDS
diff --git a/src/hotspot/cpu/x86/stubGenerator_x86_64_sha3.cpp b/src/hotspot/cpu/x86/stubGenerator_x86_64_sha3.cpp
index f9d876f34f3..075d25dcac8 100644
--- a/src/hotspot/cpu/x86/stubGenerator_x86_64_sha3.cpp
+++ b/src/hotspot/cpu/x86/stubGenerator_x86_64_sha3.cpp
@@ -104,10 +104,15 @@ static address generate_sha3_implCompress(StubId stub_id,
   default:
     ShouldNotReachHere();
   }
-
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = stubgen->load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
   __ align(CodeEntryAlignment);
   StubCodeMark mark(stubgen, stub_id);
-  address start = __ pc();
+  start = __ pc();
 
   const Register buf          = c_rarg0;
   const Register state        = c_rarg1;
@@ -316,6 +321,9 @@ static address generate_sha3_implCompress(StubId stub_id,
   __ leave(); // required for proper stackwalking of RuntimeStub frame
   __ ret(0);
 
+  // record the stub entry and end
+  stubgen->store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
@@ -326,10 +334,16 @@ static address generate_sha3_implCompress(StubId stub_id,
 // Performs two keccak() computations in parallel. The steps of the
 // two computations are executed interleaved.
 static address generate_double_keccak(StubGenerator *stubgen, MacroAssembler *_masm) {
-  __ align(CodeEntryAlignment);
   StubId stub_id = StubId::stubgen_double_keccak_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = stubgen->load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
+  __ align(CodeEntryAlignment);
   StubCodeMark mark(stubgen, stub_id);
-  address start = __ pc();
+  start = __ pc();
 
   const Register state0 = c_rarg0;
   const Register state1 = c_rarg1;
@@ -495,6 +509,9 @@ static address generate_double_keccak(StubGenerator *stubgen, MacroAssembler *_m
   __ leave(); // required for proper stackwalking of RuntimeStub frame
   __ ret(0);
 
+  // record the stub entry and end
+  stubgen->store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
@@ -508,3 +525,14 @@ void StubGenerator::generate_sha3_stubs() {
       generate_sha3_implCompress(StubId::stubgen_sha3_implCompressMB_id, this, _masm);
   }
 }
+
+#undef __
+
+#if INCLUDE_CDS
+void StubGenerator::init_AOTAddressTable_sha3(GrowableArray<address>& external_addresses) {
+#define ADD(addr) external_addresses.append((address)addr);
+  ADD(round_constsAddr());
+  ADD(permsAndRotsAddr());
+#undef ADD
+}
+#endif // INCLUDE_CDS
diff --git a/src/hotspot/cpu/x86/stubGenerator_x86_64_sin.cpp b/src/hotspot/cpu/x86/stubGenerator_x86_64_sin.cpp
index 5290e737581..eaeaea2c566 100644
--- a/src/hotspot/cpu/x86/stubGenerator_x86_64_sin.cpp
+++ b/src/hotspot/cpu/x86/stubGenerator_x86_64_sin.cpp
@@ -181,8 +181,14 @@ ATTRIBUTE_ALIGNED(8) static const juint _ALL_ONES[] =
 
 address StubGenerator::generate_libmSin() {
   StubId stub_id = StubId::stubgen_dsin_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
 
   Label L_2TAG_PACKET_0_0_1, L_2TAG_PACKET_1_0_1, L_2TAG_PACKET_2_0_1, L_2TAG_PACKET_3_0_1;
   Label L_2TAG_PACKET_4_0_1, L_2TAG_PACKET_5_0_1, L_2TAG_PACKET_6_0_1, L_2TAG_PACKET_7_0_1;
@@ -645,7 +651,18 @@ address StubGenerator::generate_libmSin() {
   __ leave(); // required for proper stackwalking of RuntimeStub frame
   __ ret(0);
 
+  // record the stub entry and end
+  store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
 #undef __
+
+#if INCLUDE_CDS
+void StubGenerator::init_AOTAddressTable_sin(GrowableArray<address>& external_addresses) {
+#define ADD(addr) external_addresses.append((address)addr);
+  ADD(_ALL_ONES);
+#undef ADD
+}
+#endif // INCLUDE_CDS
diff --git a/src/hotspot/cpu/x86/stubGenerator_x86_64_sinh.cpp b/src/hotspot/cpu/x86/stubGenerator_x86_64_sinh.cpp
index 86e4ac20176..f6e1d241948 100644
--- a/src/hotspot/cpu/x86/stubGenerator_x86_64_sinh.cpp
+++ b/src/hotspot/cpu/x86/stubGenerator_x86_64_sinh.cpp
@@ -290,8 +290,14 @@ ATTRIBUTE_ALIGNED(16) static const juint _T2_neg_f[] =
 
 address StubGenerator::generate_libmSinh() {
   StubId stub_id = StubId::stubgen_dsinh_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
 
   Label L_2TAG_PACKET_0_0_2, L_2TAG_PACKET_1_0_2, L_2TAG_PACKET_3_0_2, L_2TAG_PACKET_4_0_2;
   Label L_2TAG_PACKET_5_0_2, L_2TAG_PACKET_6_0_2;
@@ -519,7 +525,32 @@ address StubGenerator::generate_libmSinh() {
   __ leave(); // required for proper stackwalking of RuntimeStub frame
   __ ret(0);
 
+  // record the stub entry and end
+  store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
 #undef __
+
+#if INCLUDE_CDS
+void StubGenerator::init_AOTAddressTable_sinh(GrowableArray<address>& external_addresses) {
+#define ADD(addr) external_addresses.append((address)addr);
+  ADD(_L2E);
+  ADD(_L2E + 8);
+  ADD(_HALFMASK);
+  ADD(_Shifter);
+  ADD(_cv);
+  ADD(_cv + 16);
+  ADD(_cv + 32);
+  ADD(_cv + 48);
+  ADD(_cv + 64);
+  ADD(_T2f);
+  ADD(_T2_neg_f);
+  ADD(_pv);
+  ADD(_pv + 16);
+  ADD(_pv + 32);
+  ADD(_MASK3);
+#undef ADD
+}
+#endif // INCLUDE_CDS
diff --git a/src/hotspot/cpu/x86/stubGenerator_x86_64_tan.cpp b/src/hotspot/cpu/x86/stubGenerator_x86_64_tan.cpp
index 4f14414652c..3bfa5a7277f 100644
--- a/src/hotspot/cpu/x86/stubGenerator_x86_64_tan.cpp
+++ b/src/hotspot/cpu/x86/stubGenerator_x86_64_tan.cpp
@@ -456,8 +456,14 @@ ATTRIBUTE_ALIGNED(8) static const juint _QQ_2_tan[] =
 
 address StubGenerator::generate_libmTan() {
   StubId stub_id = StubId::stubgen_dtan_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
 
   Label L_2TAG_PACKET_0_0_1, L_2TAG_PACKET_1_0_1, L_2TAG_PACKET_2_0_1, L_2TAG_PACKET_3_0_1;
   Label L_2TAG_PACKET_4_0_1, L_2TAG_PACKET_5_0_1, L_2TAG_PACKET_6_0_1, L_2TAG_PACKET_7_0_1;
@@ -1025,7 +1031,33 @@ address StubGenerator::generate_libmTan() {
   __ leave(); // required for proper stackwalking of RuntimeStub frame
   __ ret(0);
 
+  // record the stub entry and end
+  store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
 #undef __
+
+#if INCLUDE_CDS
+void StubGenerator::init_AOTAddressTable_tan(GrowableArray<address>& external_addresses) {
+#define ADD(addr) external_addresses.append((address)addr);
+  ADD(_MUL16);
+  ADD(_sign_mask_tan);
+  ADD(_PI32INV_tan);
+  ADD(_P_1_tan);
+  ADD(_P_2_tan);
+  ADD(_P_3_tan);
+  ADD(_Ctable_tan);
+  ADD(_MASK_35_tan);
+  ADD(_Q_11_tan);
+  ADD(_Q_9_tan);
+  ADD(_Q_7_tan);
+  ADD(_Q_5_tan);
+  ADD(_Q_3_tan);
+  ADD(_PI_4_tan);
+  ADD(((address)_PI_4_tan+8));
+  ADD(_QQ_2_tan);
+#undef ADD
+}
+#endif // INCLUDE_CDS
diff --git a/src/hotspot/cpu/x86/stubGenerator_x86_64_tanh.cpp b/src/hotspot/cpu/x86/stubGenerator_x86_64_tanh.cpp
index dce4fbfc455..dcf5f3eb824 100644
--- a/src/hotspot/cpu/x86/stubGenerator_x86_64_tanh.cpp
+++ b/src/hotspot/cpu/x86/stubGenerator_x86_64_tanh.cpp
@@ -303,8 +303,14 @@ ATTRIBUTE_ALIGNED(16) static const juint _T2_neg_f[] =
 
 address StubGenerator::generate_libmTanh() {
   StubId stub_id = StubId::stubgen_dtanh_id;
+  int entry_count = StubInfo::entry_count(stub_id);
+  assert(entry_count == 1, "sanity check");
+  address start = load_archive_data(stub_id);
+  if (start != nullptr) {
+    return start;
+  }
   StubCodeMark mark(this, stub_id);
-  address start = __ pc();
+  start = __ pc();
 
   Label L_2TAG_PACKET_0_0_1, L_2TAG_PACKET_1_0_1, L_2TAG_PACKET_2_0_1, L_2TAG_PACKET_3_0_1;
   Label L_2TAG_PACKET_4_0_1, L_2TAG_PACKET_5_0_1;
@@ -495,7 +501,32 @@ address StubGenerator::generate_libmTanh() {
   __ leave(); // required for proper stackwalking of RuntimeStub frame
   __ ret(0);
 
+  // record the stub entry and end
+  store_archive_data(stub_id, start, __ pc());
+
   return start;
 }
 
 #undef __
+
+#if INCLUDE_CDS
+void StubGenerator::init_AOTAddressTable_tanh(GrowableArray<address>& external_addresses) {
+#define ADD(addr) external_addresses.append((address)addr);
+  ADD(_L2E);
+  ADD(_L2E + 8);
+  ADD(_HALFMASK);
+  ADD(_ONEMASK);
+  ADD(_TWOMASK);
+  ADD(_Shifter);
+  ADD(_cv);
+  ADD(_cv + 16);
+  ADD(_cv + 32);
+  ADD(_T2_neg_f);
+  ADD(_pv);
+  ADD(_pv + 16);
+  ADD(_pv + 32);
+  ADD(_MASK3);
+  ADD(_RMASK);
+#undef ADD
+}
+#endif // INCLUDE_CDS
diff --git a/src/hotspot/cpu/x86/stubRoutines_x86.cpp b/src/hotspot/cpu/x86/stubRoutines_x86.cpp
index ee9cea08e64..8696180c512 100644
--- a/src/hotspot/cpu/x86/stubRoutines_x86.cpp
+++ b/src/hotspot/cpu/x86/stubRoutines_x86.cpp
@@ -28,6 +28,10 @@
 #include "runtime/stubRoutines.hpp"
 #include "utilities/globalDefinitions.hpp"
 #include "crc32c.h"
+#include "stubGenerator_x86_64.hpp"
+#ifdef COMPILER1
+#include "c1/c1_LIRAssembler.hpp"
+#endif
 
 // Implementation of the platform-specific part of StubRoutines - for
 // a description of how to extend it, see the stubRoutines.hpp file.
@@ -411,3 +415,46 @@ ATTRIBUTE_ALIGNED(64) const julong StubRoutines::x86::_k512_W[] =
     0x4cc5d4becb3e42b6ULL, 0x597f299cfc657e2aULL,
     0x5fcb6fab3ad6faecULL, 0x6c44198c4a475817ULL,
 };
+
+#if INCLUDE_CDS
+
+void StubRoutines::init_AOTAddressTable() {
+  ResourceMark rm;
+  GrowableArray<address> external_addresses;
+  // publish static addresses referred to by main x86 generator and
+  // auxiliary x86 generators
+  StubGenerator::init_AOTAddressTable(external_addresses);
+  // publish external data addresses defined in nested x86 class
+  StubRoutines::x86::init_AOTAddressTable(external_addresses);
+#ifdef COMPILER1
+  LIR_Assembler::init_AOTAddressTable(external_addresses);
+#endif
+  AOTCodeCache::publish_external_addresses(external_addresses);
+}
+
+// publish addresses of external data defined in this file which may
+// be referenced from stub or code
+void StubRoutines::x86::init_AOTAddressTable(GrowableArray<address>& external_addresses) {
+#define ADD(addr) external_addresses.append((address)addr);
+  ADD(&_mxcsr_std);
+  ADD(&_mxcsr_rz);
+  ADD(crc_by128_masks_addr());
+  ADD(crc_by128_masks_addr() + 16);
+  ADD(crc_by128_masks_addr() + 32);
+  // this is added in generic code
+  // ADD(_crc_table);
+  ADD(crc_by128_masks_avx512_addr());
+  ADD(crc_by128_masks_avx512_addr() + 16);
+  ADD(crc_by128_masks_avx512_addr() + 32);
+  ADD(_crc_table_avx512);
+  ADD(_crc32c_table_avx512);
+  ADD(_shuf_table_crc32_avx512);
+  // n.b. call accessor for this one to ensure the table is generated
+  ADD(crc32c_table_addr());
+  ADD(_arrays_hashcode_powers_of_31);
+  ADD(_k256);
+  ADD(_k256_W);
+  ADD(_k512_W);
+#undef ADD
+}
+#endif // INCLUDE_CDS
diff --git a/src/hotspot/cpu/x86/stubRoutines_x86.hpp b/src/hotspot/cpu/x86/stubRoutines_x86.hpp
index 3654b644131..3c6d75c1d4e 100644
--- a/src/hotspot/cpu/x86/stubRoutines_x86.hpp
+++ b/src/hotspot/cpu/x86/stubRoutines_x86.hpp
@@ -112,6 +112,8 @@ public:
 
   static address arrays_hashcode_powers_of_31() { return (address)_arrays_hashcode_powers_of_31; }
   static void generate_CRC32C_table(bool is_pclmulqdq_supported);
+
+  static void init_AOTAddressTable(GrowableArray<address>& external_addresses);
 };
 
 #endif // CPU_X86_STUBROUTINES_X86_HPP
diff --git a/src/hotspot/cpu/zero/stubGenerator_zero.cpp b/src/hotspot/cpu/zero/stubGenerator_zero.cpp
index 08cb173b507..569a2fa8ca9 100644
--- a/src/hotspot/cpu/zero/stubGenerator_zero.cpp
+++ b/src/hotspot/cpu/zero/stubGenerator_zero.cpp
@@ -213,7 +213,7 @@ class StubGenerator: public StubCodeGenerator {
   }
 
  public:
-  StubGenerator(CodeBuffer* code, BlobId blob_id) : StubCodeGenerator(code, blob_id) {
+  StubGenerator(CodeBuffer* code, BlobId blob_id, AOTStubData *stub_data) : StubCodeGenerator(code, blob_id, stub_data) {
     switch(blob_id) {
     case BlobId::stubgen_preuniverse_id:
       generate_preuniverse_stubs();
@@ -237,8 +237,8 @@ class StubGenerator: public StubCodeGenerator {
   }
 };
 
-void StubGenerator_generate(CodeBuffer* code, BlobId blob_id) {
-  StubGenerator g(code, blob_id);
+void StubGenerator_generate(CodeBuffer* code, BlobId blob_id, AOTStubData *stub_data) {
+  StubGenerator g(code, blob_id, stub_data);
 }
 
 EntryFrame *EntryFrame::build(const intptr_t*  parameters,
diff --git a/src/hotspot/cpu/zero/stubRoutines_zero.cpp b/src/hotspot/cpu/zero/stubRoutines_zero.cpp
index 9b53f09be5d..196907b061f 100644
--- a/src/hotspot/cpu/zero/stubRoutines_zero.cpp
+++ b/src/hotspot/cpu/zero/stubRoutines_zero.cpp
@@ -30,3 +30,9 @@
 
 address StubRoutines::crc_table_addr()    { ShouldNotCallThis(); return nullptr; }
 address StubRoutines::crc32c_table_addr() { ShouldNotCallThis(); return nullptr; }
+
+#if INCLUDE_CDS
+// nothing to do for zero
+void StubRoutines::init_AOTAddressTable() {
+}
+#endif // INCLUDE_CDS
diff --git a/src/hotspot/share/asm/codeBuffer.cpp b/src/hotspot/share/asm/codeBuffer.cpp
index c6078c0ceee..6a288e0dad0 100644
--- a/src/hotspot/share/asm/codeBuffer.cpp
+++ b/src/hotspot/share/asm/codeBuffer.cpp
@@ -1136,7 +1136,7 @@ void AsmRemarks::clear() {
 uint AsmRemarks::print(uint offset, outputStream* strm) const {
   uint count = 0;
   const char* prefix = " ;; ";
-  const char* remstr = _remarks->lookup(offset);
+  const char* remstr = (_remarks ? _remarks->lookup(offset) : nullptr);
   while (remstr != nullptr) {
     strm->bol();
     strm->print("%s", prefix);
diff --git a/src/hotspot/share/c1/c1_Runtime1.cpp b/src/hotspot/share/c1/c1_Runtime1.cpp
index 63764dd113a..38f563935e0 100644
--- a/src/hotspot/share/c1/c1_Runtime1.cpp
+++ b/src/hotspot/share/c1/c1_Runtime1.cpp
@@ -278,11 +278,9 @@ bool Runtime1::initialize(BufferBlob* blob) {
     if (!generate_blob_for(blob, id)) {
       return false;
     }
-    if (id == StubId::c1_forward_exception_id) {
-      // publish early c1 stubs at this point so later stubs can refer to them
-      AOTCodeCache::init_early_c1_table();
-    }
   }
+  // disallow any further c1 stub generation
+  AOTCodeCache::set_c1_stubs_complete();
   // printing
 #ifndef PRODUCT
   if (PrintSimpleStubs) {
diff --git a/src/hotspot/share/code/aotCodeCache.cpp b/src/hotspot/share/code/aotCodeCache.cpp
index e3cbc3c3c8b..d3888d1b7eb 100644
--- a/src/hotspot/share/code/aotCodeCache.cpp
+++ b/src/hotspot/share/code/aotCodeCache.cpp
@@ -33,13 +33,18 @@
 #include "classfile/javaAssertions.hpp"
 #include "code/aotCodeCache.hpp"
 #include "code/codeCache.hpp"
+#include "gc/shared/barrierSetAssembler.hpp"
+#include "gc/shared/barrierSetNMethod.hpp"
 #include "gc/shared/cardTableBarrierSet.hpp"
 #include "gc/shared/gcConfig.hpp"
 #include "logging/logStream.hpp"
 #include "memory/memoryReserver.hpp"
+#include "prims/jvmtiThreadState.hpp"
+#include "prims/upcallLinker.hpp"
 #include "runtime/deoptimization.hpp"
 #include "runtime/flags/flagSetting.hpp"
 #include "runtime/globals_extension.hpp"
+#include "runtime/icache.hpp"
 #include "runtime/java.hpp"
 #include "runtime/mutexLocker.hpp"
 #include "runtime/os.inline.hpp"
@@ -168,10 +173,13 @@ static uint32_t encode_id(AOTCodeEntry::Kind kind, int id) {
   } else if (kind == AOTCodeEntry::C1Blob) {
     assert(StubInfo::is_c1(static_cast<BlobId>(id)), "not a c1 blob id %d", id);
     return id;
-  } else {
-    // kind must be AOTCodeEntry::C2Blob
+  } else if (kind == AOTCodeEntry::C2Blob) {
     assert(StubInfo::is_c2(static_cast<BlobId>(id)), "not a c2 blob id %d", id);
     return id;
+  } else {
+    // kind must be AOTCodeEntry::StubGenBlob
+    assert(StubInfo::is_stubgen(static_cast<BlobId>(id)), "not a stubgen blob id %d", id);
+    return id;
   }
 }
 
@@ -196,9 +204,6 @@ void AOTCodeCache::initialize() {
     return; // AOTCache must be specified to dump and use AOT code
   }
 
-  // Disable stubs caching until JDK-8357398 is fixed.
-  FLAG_SET_ERGO(AOTStubCaching, false);
-
   if (VerifyOops) {
     // Disable AOT stubs caching when VerifyOops flag is on.
     // Verify oops code generated a lot of C strings which overflow
@@ -296,6 +301,19 @@ bool AOTCodeCache::open_cache(bool is_dumping, bool is_using) {
   return true;
 }
 
+// Called after continuations_init() when continuation stub callouts
+// have been initialized
+void AOTCodeCache::init3() {
+  if (opened_cache == nullptr) {
+    return;
+  }
+  // initialize external routines for continuations so we can save
+  // generated continuation blob that references them
+  AOTCodeAddressTable* table = opened_cache->_table;
+  assert(table != nullptr, "should be initialized already");
+  table->init_extrs2();
+}
+
 void AOTCodeCache::dump() {
   if (is_on()) {
     assert(is_on_for_dump(), "should be called only when dumping AOT code");
@@ -354,6 +372,7 @@ AOTCodeCache::AOTCodeCache(bool is_dumping, bool is_using) :
     log_info (aot, codecache, init)("Loaded %u AOT code entries from AOT Code Cache", _load_header->entries_count());
     log_debug(aot, codecache, init)("  Adapters:  total=%u", _load_header->adapters_count());
     log_debug(aot, codecache, init)("  Shared Blobs: total=%u", _load_header->shared_blobs_count());
+    log_debug(aot, codecache, init)("  StubGen Blobs:  total=%d", _load_header->stubgen_blobs_count());
     log_debug(aot, codecache, init)("  C1 Blobs: total=%u", _load_header->C1_blobs_count());
     log_debug(aot, codecache, init)("  C2 Blobs: total=%u", _load_header->C2_blobs_count());
     log_debug(aot, codecache, init)("  AOT code cache size: %u bytes", _load_header->cache_size());
@@ -371,24 +390,59 @@ AOTCodeCache::AOTCodeCache(bool is_dumping, bool is_using) :
   _table = new AOTCodeAddressTable();
 }
 
-void AOTCodeCache::init_early_stubs_table() {
-  AOTCodeAddressTable* table = addr_table();
-  if (table != nullptr) {
-    table->init_early_stubs();
+void AOTCodeCache::add_stub_entries(StubId stub_id, address start, GrowableArray<address> *entries, int begin_idx) {
+  EntryId entry_id = StubInfo::entry_base(stub_id);
+  add_stub_entry(entry_id, start);
+  // skip past first entry
+  entry_id = StubInfo::next_in_stub(stub_id, entry_id);
+  // now check for any more entries
+  int count = StubInfo::entry_count(stub_id) - 1;
+  assert(start != nullptr, "invalid start address for stub %s", StubInfo::name(stub_id));
+  assert(entries == nullptr || begin_idx + count <= entries->length(), "sanity");
+  // write any extra entries
+  for (int i = 0; i < count; i++) {
+    assert(entry_id != EntryId::NO_ENTRYID, "not enough entries for stub %s", StubInfo::name(stub_id));
+    address a = entries->at(begin_idx + i);
+    add_stub_entry(entry_id, a);
+    entry_id = StubInfo::next_in_stub(stub_id, entry_id);
+  }
+  assert(entry_id == EntryId::NO_ENTRYID, "too many entries for stub %s", StubInfo::name(stub_id));
+}
+
+void AOTCodeCache::add_stub_entry(EntryId entry_id, address a) {
+  if (a != nullptr) {
+    if (_table != nullptr) {
+      log_trace(aot, codecache, stubs)("Publishing stub entry %s at address " INTPTR_FORMAT, StubInfo::name(entry_id), p2i(a));
+      return _table->add_stub_entry(entry_id, a);
+    }
   }
 }
 
-void AOTCodeCache::init_shared_blobs_table() {
+void AOTCodeCache::set_shared_stubs_complete() {
   AOTCodeAddressTable* table = addr_table();
   if (table != nullptr) {
-    table->init_shared_blobs();
+    table->set_shared_stubs_complete();
   }
 }
 
-void AOTCodeCache::init_early_c1_table() {
+void AOTCodeCache::set_c1_stubs_complete() {
   AOTCodeAddressTable* table = addr_table();
   if (table != nullptr) {
-    table->init_early_c1();
+    table->set_c1_stubs_complete();
+  }
+}
+
+void AOTCodeCache::set_c2_stubs_complete() {
+  AOTCodeAddressTable* table = addr_table();
+  if (table != nullptr) {
+    table->set_c2_stubs_complete();
+  }
+}
+
+void AOTCodeCache::set_stubgen_stubs_complete() {
+  AOTCodeAddressTable* table = addr_table();
+  if (table != nullptr) {
+    table->set_stubgen_stubs_complete();
   }
 }
 
@@ -583,7 +637,11 @@ AOTCodeReader::AOTCodeReader(AOTCodeCache* cache, AOTCodeEntry* entry) {
   _lookup_failed = false;
   _name          = nullptr;
   _reloc_data    = nullptr;
+  _reloc_count   = 0;
   _oop_maps      = nullptr;
+  _entry_kind    = AOTCodeEntry::None;
+  _stub_data     = nullptr;
+  _id            = -1;
 }
 
 void AOTCodeReader::set_read_position(uint pos) {
@@ -801,6 +859,7 @@ bool AOTCodeCache::finish_write() {
     AOTCodeEntry* entries_address = _store_entries; // Pointer to latest entry
     uint adapters_count = 0;
     uint shared_blobs_count = 0;
+    uint stubgen_blobs_count = 0;
     uint C1_blobs_count = 0;
     uint C2_blobs_count = 0;
     uint max_size = 0;
@@ -828,6 +887,8 @@ bool AOTCodeCache::finish_write() {
         adapters_count++;
       } else if (kind == AOTCodeEntry::SharedBlob) {
         shared_blobs_count++;
+      } else if (kind == AOTCodeEntry::StubGenBlob) {
+        stubgen_blobs_count++;
       } else if (kind == AOTCodeEntry::C1Blob) {
         C1_blobs_count++;
       } else if (kind == AOTCodeEntry::C2Blob) {
@@ -864,6 +925,7 @@ bool AOTCodeCache::finish_write() {
 
     log_debug(aot, codecache, exit)("  Adapters:  total=%u", adapters_count);
     log_debug(aot, codecache, exit)("  Shared Blobs:  total=%d", shared_blobs_count);
+    log_debug(aot, codecache, exit)("  StubGen Blobs:  total=%d", stubgen_blobs_count);
     log_debug(aot, codecache, exit)("  C1 Blobs:      total=%d", C1_blobs_count);
     log_debug(aot, codecache, exit)("  C2 Blobs:      total=%d", C2_blobs_count);
     log_debug(aot, codecache, exit)("  AOT code cache size: %u bytes, max entry's size: %u bytes", size, max_size);
@@ -873,7 +935,8 @@ bool AOTCodeCache::finish_write() {
     header->init(size, (uint)strings_count, strings_offset,
                  entries_count, new_entries_offset,
                  adapters_count, shared_blobs_count,
-                 C1_blobs_count, C2_blobs_count, cpu_features_offset);
+                 stubgen_blobs_count, C1_blobs_count,
+                 C2_blobs_count, cpu_features_offset);
 
     log_info(aot, codecache, exit)("Wrote %d AOT code entries to AOT Code Cache", entries_count);
   }
@@ -882,19 +945,53 @@ bool AOTCodeCache::finish_write() {
 
 //------------------Store/Load AOT code ----------------------
 
-bool AOTCodeCache::store_code_blob(CodeBlob& blob, AOTCodeEntry::Kind entry_kind, uint id, const char* name) {
+bool AOTCodeCache::store_code_blob(CodeBlob& blob, AOTCodeEntry::Kind entry_kind, uint id, const char* name, AOTStubData* stub_data, CodeBuffer* code_buffer) {
+  assert(AOTCodeEntry::is_valid_entry_kind(entry_kind), "invalid entry_kind %d", entry_kind);
+
+  // we only expect stub data and a code buffer for a multi stub blob
+  assert(AOTCodeEntry::is_multi_stub_blob(entry_kind) == (stub_data != nullptr),
+         "entry_kind %d does not match stub_data pointer %p",
+         entry_kind, stub_data);
+
+  assert((stub_data == nullptr) == (code_buffer == nullptr),
+         "stub data and code buffer must both be null or both non null");
+
+  // If this is a stub and the cache is on for either load or dump we
+  // need to insert the stub entries into the AOTCacheAddressTable so
+  // that relocs which refer to entries defined by this blob get
+  // translated correctly.
+  //
+  // Entry insertion needs to be be done up front before writing the
+  // blob because some blobs rely on internal daisy-chain references
+  // from one entry to another.
+  //
+  // Entry insertion also needs to be done even if the cache is open
+  // for use but not for dump. This may be needed when an archived
+  // blob omits some entries -- either because of a config change or a
+  // load failure -- with the result that the entries end up being
+  // generated. These generated entry addresses may be needed to
+  // resolve references from subsequently loaded blobs (for either
+  // stubs or nmethods).
+
+  if (is_on() && AOTCodeEntry::is_blob(entry_kind)) {
+    publish_stub_addresses(blob, (BlobId)id, stub_data);
+  }
+
   AOTCodeCache* cache = open_for_dump();
   if (cache == nullptr) {
     return false;
   }
-  assert(AOTCodeEntry::is_valid_entry_kind(entry_kind), "invalid entry_kind %d", entry_kind);
-
   if (AOTCodeEntry::is_adapter(entry_kind) && !is_dumping_adapter()) {
     return false;
   }
   if (AOTCodeEntry::is_blob(entry_kind) && !is_dumping_stub()) {
     return false;
   }
+  // we do not currently store C2 stubs because we are seeing weird
+  // memory errors when loading them -- see JDK-8357593
+  if (entry_kind == AOTCodeEntry::C2Blob) {
+    return false;
+  }
   log_debug(aot, codecache, stubs)("Writing blob '%s' (id=%u, kind=%s) to AOT Code Cache", name, id, aot_code_entry_kind_name[entry_kind]);
 
 #ifdef ASSERT
@@ -934,8 +1031,44 @@ bool AOTCodeCache::store_code_blob(CodeBlob& blob, AOTCodeEntry::Kind entry_kind
   }
   CodeBlob::archive_blob(&blob, archive_buffer);
 
-  uint reloc_data_size = blob.relocation_size();
-  n = cache->write_bytes((address)blob.relocation_begin(), reloc_data_size);
+  // For a relocatable code blob its relocations are linked from the
+  // blob. However, for a non-relocatable (stubgen) blob we only have
+  // transient relocations attached to the code buffer that are added
+  // in order to support AOT-load time patching. in either case, we
+  // need to explicitly save these relocs when storing the blob to the
+  // archive so we can then reload them and reattach them to either
+  // the blob or to a code buffer when we reload the blob into a
+  // production JVM.
+  //
+  // Either way we are then in a position to iterate over the relocs
+  // and AOT patch the ones that refer to code that may move between
+  // assembly and production time. We also need to save and restore
+  // AOT address table indexes for the target addresses of affected
+  // relocs. That happens below.
+
+  int reloc_count;
+  address reloc_data;
+  if (AOTCodeEntry::is_multi_stub_blob(entry_kind)) {
+    CodeSection* cs = code_buffer->code_section(CodeBuffer::SECT_INSTS);
+    reloc_count = (cs->has_locs() ? cs->locs_count() : 0);
+    reloc_data = (reloc_count > 0 ? (address)cs->locs_start() : nullptr);
+  } else {
+    reloc_count = blob.relocation_size() / sizeof(relocInfo);
+    reloc_data = (address)blob.relocation_begin();
+  }
+  n = cache->write_bytes(&reloc_count, sizeof(int));
+  if (n != sizeof(int)) {
+    return false;
+  }
+  if (AOTCodeEntry::is_multi_stub_blob(entry_kind)) {
+    // align to heap word size before writing the relocs so we can
+    // install them into a code buffer when they get restored
+    if (!cache->align_write()) {
+      return false;
+    }
+  }
+  uint reloc_data_size = (uint)(reloc_count * sizeof(relocInfo));
+  n = cache->write_bytes(reloc_data, reloc_data_size);
   if (n != reloc_data_size) {
     return false;
   }
@@ -948,7 +1081,29 @@ bool AOTCodeCache::store_code_blob(CodeBlob& blob, AOTCodeEntry::Kind entry_kind
     has_oop_maps = true;
   }
 
-  if (!cache->write_relocations(blob)) {
+  // In the case of a multi-stub blob we need to write start, end,
+  // secondary entries and extras. For any other blob entry addresses
+  // beyond the blob start will be stored in the blob as offsets.
+  if (stub_data != nullptr) {
+    if (!cache->write_stub_data(blob, stub_data)) {
+      return false;
+    }
+  }
+
+  // now we have added all the other data we can write details of any
+  // extra the AOT relocations
+
+  bool write_ok;
+  if (AOTCodeEntry::is_multi_stub_blob(entry_kind)) {
+    CodeSection* cs = code_buffer->code_section(CodeBuffer::SECT_INSTS);
+    RelocIterator iter(cs);
+    write_ok = cache->write_relocations(blob, iter);
+  } else {
+    RelocIterator iter(&blob);
+    write_ok = cache->write_relocations(blob, iter);
+  }
+
+  if (!write_ok) {
     if (!cache->failed()) {
       // We may miss an address in AOT table - skip this code blob.
       cache->set_write_position(entry_position);
@@ -967,6 +1122,7 @@ bool AOTCodeCache::store_code_blob(CodeBlob& blob, AOTCodeEntry::Kind entry_kind
 #endif /* PRODUCT */
 
   uint entry_size = cache->_write_position - entry_position;
+
   AOTCodeEntry* entry = new(cache) AOTCodeEntry(entry_kind, encode_id(entry_kind, id),
                                                 entry_position, entry_size, name_offset, name_size,
                                                 blob_offset, has_oop_maps, blob.content_begin());
@@ -974,25 +1130,141 @@ bool AOTCodeCache::store_code_blob(CodeBlob& blob, AOTCodeEntry::Kind entry_kind
   return true;
 }
 
-bool AOTCodeCache::store_code_blob(CodeBlob& blob, AOTCodeEntry::Kind entry_kind, BlobId id) {
-  assert(AOTCodeEntry::is_blob(entry_kind),
-         "wrong entry kind for blob id %s", StubInfo::name(id));
-  return store_code_blob(blob, entry_kind, (uint)id, StubInfo::name(id));
+bool AOTCodeCache::store_code_blob(CodeBlob& blob, AOTCodeEntry::Kind entry_kind, uint id, const char* name) {
+  assert(!AOTCodeEntry::is_blob(entry_kind),
+         "wrong entry kind for numeric id %d", id);
+  return store_code_blob(blob, entry_kind, (uint)id, name, nullptr, nullptr);
 }
 
-CodeBlob* AOTCodeCache::load_code_blob(AOTCodeEntry::Kind entry_kind, uint id, const char* name) {
+bool AOTCodeCache::store_code_blob(CodeBlob& blob, AOTCodeEntry::Kind entry_kind, BlobId id) {
+  assert(AOTCodeEntry::is_single_stub_blob(entry_kind),
+         "wrong entry kind for blob id %s", StubInfo::name(id));
+  return store_code_blob(blob, entry_kind, (uint)id, StubInfo::name(id), nullptr, nullptr);
+}
+
+bool AOTCodeCache::store_code_blob(CodeBlob& blob, AOTCodeEntry::Kind entry_kind, BlobId id, AOTStubData* stub_data, CodeBuffer* code_buffer) {
+  assert(AOTCodeEntry::is_multi_stub_blob(entry_kind),
+         "wrong entry kind for multi stub blob id %s", StubInfo::name(id));
+  return store_code_blob(blob, entry_kind, (uint)id, StubInfo::name(id), stub_data, code_buffer);
+}
+
+bool AOTCodeCache::write_stub_data(CodeBlob &blob, AOTStubData *stub_data) {
+  BlobId blob_id = stub_data->blob_id();
+  StubId stub_id = StubInfo::stub_base(blob_id);
+  address blob_base = blob.code_begin();
+  int stub_cnt = StubInfo::stub_count(blob_id);
+  int n;
+
+  LogStreamHandle(Trace, aot, codecache, stubs) log;
+
+  if (log.is_enabled()) {
+    log.print_cr("======== Stub data starts at offset %d", _write_position);
+  }
+
+  for (int i = 0; i < stub_cnt; i++, stub_id = StubInfo::next_in_blob(blob_id, stub_id)) {
+    // for each stub we find in the ranges list we write an int
+    // sequence <stubid,start,end,N,offset1, ... offsetN> where
+    //
+    // - start_pos is the stub start address encoded as a code section offset
+    //
+    // - end is the stub end address encoded as an offset from start
+    //
+    // - N counts the number of stub-local entries/extras
+    //
+    // - offseti is a stub-local entry/extra address encoded as len for
+    // a null address otherwise as an offset in range [1,len-1]
+
+    StubAddrRange& range = stub_data->get_range(i);
+    GrowableArray<address>& addresses = stub_data->address_array();
+    int base = range.start_index();
+    if (base >= 0) {
+      n = write_bytes(&stub_id, sizeof(StubId));
+      if (n != sizeof(StubId)) {
+        return false;
+      }
+      address start = addresses.at(base);
+      assert (blob_base <= start, "sanity");
+      uint offset = (uint)(start - blob_base);
+      n = write_bytes(&offset, sizeof(uint));
+      if (n != sizeof(int)) {
+        return false;
+      }
+      address end = addresses.at(base + 1);
+      assert (start < end, "sanity");
+      offset = (uint)(end - start);
+      n = write_bytes(&offset, sizeof(uint));
+      if (n != sizeof(int)) {
+        return false;
+      }
+      // write number of secondary and extra entries
+      int count =  range.count() - 2;
+      n = write_bytes(&count, sizeof(int));
+      if (n != sizeof(int)) {
+        return false;
+      }
+      for (int j = 0; j < count; j++) {
+        address next = addresses.at(base + 2 + j);
+        if (next != nullptr) {
+          // n.b. This maps next == end to the stub length which
+          // means we will reconstitute the address as nullptr. That
+          // happens when we have a handler range covers the end of
+          // a stub and needs to be handled specially by the client
+          // that restores the extras.
+          assert(start <= next && next <= end, "sanity");
+          offset = (uint)(next - start);
+        } else {
+          // this can happen when a stub is not generated or an
+          // extra is the common handler target
+          offset = NULL_ADDRESS_MARKER;
+        }
+        n = write_bytes(&offset, sizeof(uint));
+        if (n != sizeof(int)) {
+          return false;
+        }
+      }
+      if (log.is_enabled()) {
+        log.print_cr("======== wrote stub %s and %d addresses up to offset %d",
+                     StubInfo::name(stub_id), range.count(), _write_position);
+      }
+    }
+  }
+  // we should have exhausted all stub ids in the blob
+  assert(stub_id == StubId::NO_STUBID, "sanity");
+  // write NO_STUBID as an end marker
+  n = write_bytes(&stub_id, sizeof(StubId));
+  if (n != sizeof(StubId)) {
+    return false;
+  }
+
+  if (log.is_enabled()) {
+    log.print_cr("======== Stub data ends at offset %d", _write_position);
+  }
+
+  return true;
+}
+
+CodeBlob* AOTCodeCache::load_code_blob(AOTCodeEntry::Kind entry_kind, uint id, const char* name, AOTStubData* stub_data) {
   AOTCodeCache* cache = open_for_use();
   if (cache == nullptr) {
     return nullptr;
   }
   assert(AOTCodeEntry::is_valid_entry_kind(entry_kind), "invalid entry_kind %d", entry_kind);
 
+  assert(AOTCodeEntry::is_multi_stub_blob(entry_kind) == (stub_data != nullptr),
+         "entry_kind %d does not match stub_data pointer %p",
+         entry_kind, stub_data);
+
   if (AOTCodeEntry::is_adapter(entry_kind) && !is_using_adapter()) {
     return nullptr;
   }
   if (AOTCodeEntry::is_blob(entry_kind) && !is_using_stub()) {
     return nullptr;
   }
+  // we do not currently load C2 stubs because we are seeing weird
+  // memory errors when loading them -- see JDK-8357593
+  if (entry_kind == AOTCodeEntry::C2Blob) {
+    return nullptr;
+  }
   log_debug(aot, codecache, stubs)("Reading blob '%s' (id=%u, kind=%s) from AOT Code Cache", name, id, aot_code_entry_kind_name[entry_kind]);
 
   AOTCodeEntry* entry = cache->find_entry(entry_kind, encode_id(entry_kind, id));
@@ -1000,20 +1272,32 @@ CodeBlob* AOTCodeCache::load_code_blob(AOTCodeEntry::Kind entry_kind, uint id, c
     return nullptr;
   }
   AOTCodeReader reader(cache, entry);
-  CodeBlob* blob = reader.compile_code_blob(name);
+  CodeBlob* blob = reader.compile_code_blob(name, entry_kind, id, stub_data);
 
   log_debug(aot, codecache, stubs)("%sRead blob '%s' (id=%u, kind=%s) from AOT Code Cache",
                                    (blob == nullptr? "Failed to " : ""), name, id, aot_code_entry_kind_name[entry_kind]);
   return blob;
 }
 
-CodeBlob* AOTCodeCache::load_code_blob(AOTCodeEntry::Kind entry_kind, BlobId id) {
-  assert(AOTCodeEntry::is_blob(entry_kind),
-         "wrong entry kind for blob id %s", StubInfo::name(id));
-  return load_code_blob(entry_kind, (uint)id, StubInfo::name(id));
+CodeBlob* AOTCodeCache::load_code_blob(AOTCodeEntry::Kind entry_kind, uint id, const char* name) {
+  assert(!AOTCodeEntry::is_blob(entry_kind),
+         "wrong entry kind for numeric id %d", id);
+  return load_code_blob(entry_kind, (uint)id, name, nullptr);
 }
 
-CodeBlob* AOTCodeReader::compile_code_blob(const char* name) {
+CodeBlob* AOTCodeCache::load_code_blob(AOTCodeEntry::Kind entry_kind, BlobId id) {
+  assert(AOTCodeEntry::is_single_stub_blob(entry_kind),
+         "wrong entry kind for blob id %s", StubInfo::name(id));
+  return load_code_blob(entry_kind, (uint)id, StubInfo::name(id), nullptr);
+}
+
+CodeBlob* AOTCodeCache::load_code_blob(AOTCodeEntry::Kind entry_kind, BlobId id, AOTStubData* stub_data) {
+  assert(AOTCodeEntry::is_multi_stub_blob(entry_kind),
+         "wrong entry kind for blob id %s", StubInfo::name(id));
+  return load_code_blob(entry_kind, (uint)id, StubInfo::name(id), stub_data);
+}
+
+CodeBlob* AOTCodeReader::compile_code_blob(const char* name, AOTCodeEntry::Kind entry_kind, int id, AOTStubData* stub_data) {
   uint entry_position = _entry->offset();
 
   // Read name
@@ -1029,20 +1313,32 @@ CodeBlob* AOTCodeReader::compile_code_blob(const char* name) {
   }
   _name = stored_name;
 
-  // Read archived code blob
+  // Read archived code blob and related info
   uint offset = entry_position + _entry->blob_offset();
   CodeBlob* archived_blob = (CodeBlob*)addr(offset);
   offset += archived_blob->size();
 
+  _reloc_count = *(int*)addr(offset); offset += sizeof(int);
+  if (AOTCodeEntry::is_multi_stub_blob(entry_kind)) {
+    // position of relocs will have been aligned to heap word size so
+    // we can install them into a code buffer
+    offset = align_up(offset, DATA_ALIGNMENT);
+  }
   _reloc_data = (address)addr(offset);
-  offset += archived_blob->relocation_size();
+  offset += _reloc_count * sizeof(relocInfo);
   set_read_position(offset);
 
   if (_entry->has_oop_maps()) {
     _oop_maps = read_oop_map_set();
   }
 
+  // record current context for use by that callback
+  _stub_data = stub_data;
+  _entry_kind = entry_kind;
+  _id = id;
+
   // CodeBlob::restore() calls AOTCodeReader::restore()
+
   CodeBlob* code_blob = CodeBlob::create(archived_blob, this);
 
   if (code_blob == nullptr) { // no space left in CodeCache
@@ -1065,10 +1361,60 @@ void AOTCodeReader::restore(CodeBlob* code_blob) {
   precond(_reloc_data != nullptr);
 
   code_blob->set_name(_name);
-  code_blob->restore_mutable_data(_reloc_data);
+  // Saved relocations need restoring except for the case of a
+  // multi-stub blob which has no runtime relocations. However, we may
+  // still have saved some (re-)load time relocs that were attached to
+  // the generator's code buffer. We don't attach them to the blob but
+  // they get processed below by fix_relocations.
+  if (!AOTCodeEntry::is_multi_stub_blob(_entry_kind)) {
+    code_blob->restore_mutable_data(_reloc_data);
+  }
   code_blob->set_oop_maps(_oop_maps);
 
-  fix_relocations(code_blob);
+  // if this is a multi stub blob load its entries
+  if (AOTCodeEntry::is_blob(_entry_kind)) {
+    BlobId blob_id = static_cast<BlobId>(_id);
+    if (StubInfo::is_stubgen(blob_id)) {
+      assert(_stub_data != nullptr, "sanity");
+      read_stub_data(code_blob, _stub_data);
+    }
+    // publish entries found either in stub_data or as offsets in blob
+    AOTCodeCache::publish_stub_addresses(*code_blob, blob_id, _stub_data);
+  }
+
+  // Now that all the entry points are in the address table we can
+  // read all the extra reloc info and fix up any addresses that need
+  // patching to adjust for a new location in a new JVM. We can be
+  // sure to correctly update all runtime references, including
+  // cross-linked stubs that are internally daisy-chained. If
+  // relocation fails and we have to re-generate any of the stubs then
+  // the entry points for newly generated stubs will get updated,
+  // ensuring that any other stubs or nmethods we need to relocate
+  // will use the correct address.
+
+  // if we have a relocatable code blob then the relocs are already
+  // attached to the blob and we can iterate over it to find the ones
+  // we need to patch. With a non-relocatable code blob we need to
+  // wrap it with a CodeBuffer and then reattach the relocs to the
+  // code buffer.
+
+  if (AOTCodeEntry::is_multi_stub_blob(_entry_kind)) {
+    // the blob doesn't have any proper runtime relocs but we can
+    // reinstate the AOT-load time relocs we saved from the code
+    // buffer that generated this blob in a new code buffer and use
+    // the latter to iterate over them
+    CodeBuffer code_buffer(code_blob);
+    relocInfo* locs = (relocInfo*)_reloc_data;
+    code_buffer.insts()->initialize_shared_locs(locs, _reloc_count);
+    code_buffer.insts()->set_locs_end(locs + _reloc_count);
+    CodeSection *cs = code_buffer.code_section(CodeBuffer::SECT_INSTS);
+    RelocIterator reloc_iter(cs);
+    fix_relocations(code_blob, reloc_iter);
+  } else {
+    // the AOT-load time relocs will be in the blob's restored relocs
+    RelocIterator reloc_iter(code_blob);
+    fix_relocations(code_blob, reloc_iter);
+  }
 
 #ifndef PRODUCT
   code_blob->asm_remarks().init();
@@ -1078,15 +1424,150 @@ void AOTCodeReader::restore(CodeBlob* code_blob) {
 #endif // PRODUCT
 }
 
+void AOTCodeReader::read_stub_data(CodeBlob* code_blob, AOTStubData* stub_data) {
+  GrowableArray<address>& addresses = stub_data->address_array();
+  // Read the list of stub ids and associated start, end, secondary
+  // and extra addresses and install them in the stub data.
+  //
+  // Also insert all start and secondary addresses into the AOTCache
+  // address table so we correctly relocate this blob and any followng
+  // blobs/nmethods.
+  //
+  // n.b. if an error occurs and we need to regenerate any of these
+  // stubs the address table will be updated as a side-effect of
+  // regeneration.
+
+  address blob_base = code_blob->code_begin();
+  uint blob_size = (uint)(code_blob->code_end() - blob_base);
+  int offset = read_position();
+  LogStreamHandle(Trace, aot, codecache, stubs) log;
+  if (log.is_enabled()) {
+    log.print_cr("======== Stub data starts at offset %d", offset);
+  }
+  // read stub and entries until we see NO_STUBID
+  StubId stub_id = *(StubId*)addr(offset); offset += sizeof(StubId);
+  // we ought to have at least one saved stub in the blob
+  assert(stub_id != StubId::NO_STUBID, "blob %s contains no stubs!", StubInfo::name(stub_data->blob_id()));
+  while (stub_id != StubId::NO_STUBID) {
+    assert(StubInfo::blob(stub_id) == stub_data->blob_id(), "sanity");
+    int idx = StubInfo::stubgen_offset_in_blob(stub_data->blob_id(), stub_id);
+    StubAddrRange& range = stub_data->get_range(idx);
+    // we should only see a stub once
+    assert(range.start_index() < 0, "repeated entry for stub %s", StubInfo::name(stub_id));
+    int address_base = addresses.length();
+    // start is an offset from the blob base
+    uint start = *(uint*)addr(offset); offset += sizeof(uint);
+    assert(start < blob_size, "stub %s start offset %d exceeds buffer length %d", StubInfo::name(stub_id), start, blob_size);
+    address stub_start = blob_base + start;
+    addresses.append(stub_start);
+    // end is an offset from the stub start
+    uint end = *(uint*)addr(offset); offset += sizeof(uint);
+    assert(start + end <= blob_size, "stub %s end offset %d exceeds remaining buffer length %d", StubInfo::name(stub_id), end, blob_size - start);
+    addresses.append(stub_start + end);
+    // read count of secondary entries plus extras
+    int entries_count = *(int*)addr(offset); offset += sizeof(int);
+    assert(entries_count >= (StubInfo::entry_count(stub_id) - 1), "not enough entries for %s", StubInfo::name(stub_id));
+    for (int i = 0; i < entries_count; i++) {
+      // entry offset is an offset from the stub start less than or
+      // equal to end
+      uint entry = *(uint*)addr(offset); offset += sizeof(uint);
+      if (entry <= end) {
+        // entry addresses may not address end but extras can
+        assert(entry < end || i >= StubInfo::entry_count(stub_id),
+               "entry offset 0x%x exceeds stub length 0x%x for stub %s",
+               entry, end, StubInfo::name(stub_id));
+        addresses.append(stub_start + entry);
+      } else {
+        // special case: entry encodes a nullptr
+        assert(entry == AOTCodeCache::NULL_ADDRESS_MARKER, "stub %s entry offset %d lies beyond stub end %d and does not equal NULL_ADDRESS_MARKER", StubInfo::name(stub_id), entry, end);
+        addresses.append(nullptr);
+      }
+    }
+    if (log.is_enabled()) {
+      log.print_cr("======== read stub %s and %d addresses up to offset %d",
+                   StubInfo::name(stub_id),  2 + entries_count, offset);
+    }
+    range.init_entry(address_base, 2 + entries_count);
+    // move on to next stub or NO_STUBID
+    stub_id = *(StubId*)addr(offset); offset += sizeof(StubId);
+  }
+  if (log.is_enabled()) {
+    log.print_cr("======== Stub data ends at offset %d", offset);
+  }
+
+  set_read_position(offset);
+}
+
+void AOTCodeCache::publish_external_addresses(GrowableArray<address>& addresses) {
+  DEBUG_ONLY( _passed_init2 = true; )
+  if (opened_cache == nullptr) {
+    return;
+  }
+
+  cache()->_table->add_external_addresses(addresses);
+}
+
+void AOTCodeCache::publish_stub_addresses(CodeBlob &code_blob, BlobId blob_id, AOTStubData *stub_data) {
+  if (stub_data != nullptr) {
+    // register all entries in stub
+    assert(StubInfo::stub_count(blob_id) > 1,
+           "multiple stub data provided for single stub blob %s",
+           StubInfo::name(blob_id));
+    assert(blob_id == stub_data->blob_id(),
+           "blob id %s does not match id in stub data %s",
+           StubInfo::name(blob_id),
+           StubInfo::name(stub_data->blob_id()));
+    // iterate over all stubs in the blob
+    StubId stub_id = StubInfo::stub_base(blob_id);
+    int stub_cnt = StubInfo::stub_count(blob_id);
+    GrowableArray<address>& addresses = stub_data->address_array();
+    for (int i = 0; i < stub_cnt; i++) {
+      assert(stub_id != StubId::NO_STUBID, "sanity");
+      StubAddrRange& range = stub_data->get_range(i);
+      int base = range.start_index();
+      if (base >= 0) {
+        cache()->add_stub_entries(stub_id, addresses.at(base), &addresses, base + 2);
+      }
+      stub_id = StubInfo::next_in_blob(blob_id, stub_id);
+    }
+    // we should have exhausted all stub ids in the blob
+    assert(stub_id == StubId::NO_STUBID, "sanity");
+  } else {
+    // register entry or entries for a single stub blob
+    StubId stub_id = StubInfo::stub_base(blob_id);
+    assert(StubInfo::stub_count(blob_id) == 1,
+           "multiple stub blob %s provided without stub data",
+           StubInfo::name(blob_id));
+    address start = code_blob.code_begin();
+    if (StubInfo::entry_count(stub_id) == 1) {
+      assert(!code_blob.is_deoptimization_stub(), "expecting multiple entries for stub %s", StubInfo::name(stub_id));
+      // register the blob base address as the only entry
+      cache()->add_stub_entries(stub_id, start);
+    } else {
+      assert(code_blob.is_deoptimization_stub(), "only expecting one entry for stub %s", StubInfo::name(stub_id));
+      DeoptimizationBlob *deopt_blob = code_blob.as_deoptimization_blob();
+      assert(deopt_blob->unpack() == start, "unexpected offset 0x%x for deopt stub entry", (int)(deopt_blob->unpack() - start));
+      GrowableArray<address> addresses;
+      addresses.append(deopt_blob->unpack_with_exception());
+      addresses.append(deopt_blob->unpack_with_reexecution());
+      addresses.append(deopt_blob->unpack_with_exception_in_tls());
+#if INCLUDE_JVMCI
+      addresses.append(deopt_blob->uncommon_trap());
+      addresses.append(deopt_blob->implicit_exception_uncommon_trap());
+#endif // INCLUDE_JVMCI
+      cache()->add_stub_entries(stub_id, start, &addresses, 0);
+    }
+  }
+}
+
 // ------------ process code and data --------------
 
 // Can't use -1. It is valid value for jump to iteself destination
 // used by static call stub: see NativeJump::jump_destination().
 #define BAD_ADDRESS_ID -2
 
-bool AOTCodeCache::write_relocations(CodeBlob& code_blob) {
+bool AOTCodeCache::write_relocations(CodeBlob& code_blob, RelocIterator& iter) {
   GrowableArray<uint> reloc_data;
-  RelocIterator iter(&code_blob);
   LogStreamHandle(Trace, aot, codecache, reloc) log;
   while (iter.next()) {
     int idx = reloc_data.append(0); // default value
@@ -1140,6 +1621,11 @@ bool AOTCodeCache::write_relocations(CodeBlob& code_blob) {
   // Write the count first
   int count = reloc_data.length();
   write_bytes(&count, sizeof(int));
+  if (log.is_enabled()) {
+    log.print_cr("======== extra relocations count=%d", count);
+    log.print(   "  {");
+  }
+  bool first = true;
   for (GrowableArrayIterator<uint> iter = reloc_data.begin();
        iter != reloc_data.end(); ++iter) {
     uint value = *iter;
@@ -1147,23 +1633,43 @@ bool AOTCodeCache::write_relocations(CodeBlob& code_blob) {
     if (n != sizeof(uint)) {
       return false;
     }
+    if (log.is_enabled()) {
+      if (first) {
+        first = false;
+        log.print("%d", value);
+      } else {
+        log.print(", %d", value);
+      }
+    }
+  }
+  if (log.is_enabled()) {
+    log.print_cr("}");
   }
   return true;
 }
 
-void AOTCodeReader::fix_relocations(CodeBlob* code_blob) {
-  LogStreamHandle(Trace, aot, reloc) log;
+void AOTCodeReader::fix_relocations(CodeBlob *code_blob, RelocIterator& iter) {
   uint offset = read_position();
-  int count = *(int*)addr(offset);
+  int reloc_count = *(int*)addr(offset);
   offset += sizeof(int);
-  if (log.is_enabled()) {
-    log.print_cr("======== extra relocations count=%d", count);
-  }
   uint* reloc_data = (uint*)addr(offset);
-  offset += (count * sizeof(uint));
+  offset += (reloc_count * sizeof(uint));
   set_read_position(offset);
 
-  RelocIterator iter(code_blob);
+  LogStreamHandle(Trace, aot, codecache, reloc) log;
+  if (log.is_enabled()) {
+    log.print_cr("======== extra relocations count=%d", reloc_count);
+    log.print("  {");
+    for(int i = 0; i < reloc_count; i++) {
+      if (i == 0) {
+        log.print("%d", reloc_data[i]);
+      } else {
+        log.print(", %d", reloc_data[i]);
+      }
+    }
+    log.print_cr("}");
+  }
+
   int j = 0;
   while (iter.next()) {
     switch (iter.type()) {
@@ -1212,7 +1718,7 @@ void AOTCodeReader::fix_relocations(CodeBlob* code_blob) {
     }
     j++;
   }
-  assert(j == count, "sanity");
+  assert(j == reloc_count, "sanity");
 }
 
 bool AOTCodeCache::write_oop_map_set(CodeBlob& cb) {
@@ -1322,249 +1828,360 @@ void AOTCodeReader::read_dbg_strings(DbgStrings& dbg_strings) {
 
 //======================= AOTCodeAddressTable ===============
 
-// address table ids for generated routines, external addresses and C
-// string addresses are partitioned into positive integer ranges
-// defined by the following positive base and max values
-// i.e. [_extrs_base, _extrs_base + _extrs_max -1],
-//      [_blobs_base, _blobs_base + _blobs_max -1],
-//      ...
-//      [_c_str_base, _c_str_base + _c_str_max -1],
+// address table ids for generated routine entry adresses, external
+// addresses and C string addresses are partitioned into positive
+// integer ranges defined by the following positive base and max
+// values i.e. [_extrs_base, _extrs_base + _extrs_max -1],
+// [_stubs_base, _stubs_base + _stubs_max -1], [_c_str_base,
+// _c_str_base + _c_str_max -1],
 
-#define _extrs_max 100
-#define _stubs_max 3
-
-#define _shared_blobs_max 20
-#define _C1_blobs_max 10
-#define _blobs_max (_shared_blobs_max+_C1_blobs_max)
-#define _all_max (_extrs_max+_stubs_max+_blobs_max)
+#define _extrs_max 380
+#define _stubs_max static_cast<int>(EntryId::NUM_ENTRYIDS)
 
 #define _extrs_base 0
 #define _stubs_base (_extrs_base + _extrs_max)
-#define _shared_blobs_base (_stubs_base + _stubs_max)
-#define _C1_blobs_base (_shared_blobs_base + _shared_blobs_max)
-#define _blobs_end  (_shared_blobs_base + _blobs_max)
+#define _all_max    (_stubs_base + _stubs_max)
 
-#define SET_ADDRESS(type, addr)                           \
-  {                                                       \
-    type##_addr[type##_length++] = (address) (addr);      \
-    assert(type##_length <= type##_max, "increase size"); \
+// setter for external addresses and string addresses inserts new
+// addresses in the order they are encountered them which must remain
+// the same across an assembly run and subsequent production run
+
+#define ADD_EXTERNAL_ADDRESS(addr)                               \
+  {                                                              \
+    hash_address((address) addr, _extrs_base + _extrs_length);   \
+    _extrs_addr[_extrs_length++] = (address) (addr);             \
+    assert(_extrs_length <= _extrs_max, "increase size");        \
   }
 
+// insert into to the address hash table the index of an external
+// address or a stub address in the list of external or stub
+// addresses, respectively, keyed by the relevant address
+
+void AOTCodeAddressTable::hash_address(address addr, int idx) {
+  // only do this if we are caching stubs and we have a non-null
+  // address to record
+  if (!AOTStubCaching) {
+    return;
+  }
+  if (addr == nullptr) {
+    return;
+  }
+  // check opened_cache because this can be called before the cache is
+  // properly initialized and only continue when dumping is enabled
+  if (opened_cache != nullptr && opened_cache->for_dump()) {
+    if (_hash_table == nullptr) {
+      _hash_table = new (mtCode) AOTCodeAddressHashTable();
+    }
+    assert(_hash_table->get(addr) == nullptr, "repeated insert of address " INTPTR_FORMAT, p2i(addr));
+    _hash_table->put(addr, idx);
+    log_trace(aot, codecache)("Address " INTPTR_FORMAT " inserted into AOT Code Cache address hash table with index '%d'",
+                              p2i(addr), idx);
+  }
+}
+
 static bool initializing_extrs = false;
 
 void AOTCodeAddressTable::init_extrs() {
   if (_extrs_complete || initializing_extrs) return; // Done already
 
-  assert(_blobs_end <= _all_max, "AOTCodeAddress table ranges need adjusting");
-
   initializing_extrs = true;
   _extrs_addr = NEW_C_HEAP_ARRAY(address, _extrs_max, mtCode);
 
   _extrs_length = 0;
 
+  {
+    // Required by initial stubs
+    ADD_EXTERNAL_ADDRESS(SharedRuntime::exception_handler_for_return_address); // used by forward_exception
+    ADD_EXTERNAL_ADDRESS(CompressedOops::base_addr()); // used by call_stub
+    ADD_EXTERNAL_ADDRESS(Thread::current); // used by call_stub
+    ADD_EXTERNAL_ADDRESS(SharedRuntime::throw_StackOverflowError);
+    ADD_EXTERNAL_ADDRESS(SharedRuntime::throw_delayed_StackOverflowError);
+  }
+
   // Record addresses of VM runtime methods
-  SET_ADDRESS(_extrs, SharedRuntime::fixup_callers_callsite);
-  SET_ADDRESS(_extrs, SharedRuntime::handle_wrong_method);
-  SET_ADDRESS(_extrs, SharedRuntime::handle_wrong_method_abstract);
-  SET_ADDRESS(_extrs, SharedRuntime::handle_wrong_method_ic_miss);
+  ADD_EXTERNAL_ADDRESS(SharedRuntime::fixup_callers_callsite);
+  ADD_EXTERNAL_ADDRESS(SharedRuntime::handle_wrong_method);
+  ADD_EXTERNAL_ADDRESS(SharedRuntime::handle_wrong_method_abstract);
+  ADD_EXTERNAL_ADDRESS(SharedRuntime::handle_wrong_method_ic_miss);
 #if defined(AARCH64) && !defined(ZERO)
-  SET_ADDRESS(_extrs, JavaThread::aarch64_get_thread_helper);
+  ADD_EXTERNAL_ADDRESS(JavaThread::aarch64_get_thread_helper);
 #endif
+
+#if defined(AARCH64)
+  ADD_EXTERNAL_ADDRESS(BarrierSetAssembler::patching_epoch_addr());
+#endif
+
+#ifndef PRODUCT
+  ADD_EXTERNAL_ADDRESS(&SharedRuntime::_jbyte_array_copy_ctr); // used by arraycopy stub on arm32 and x86_64
+  ADD_EXTERNAL_ADDRESS(&SharedRuntime::_jshort_array_copy_ctr); // used by arraycopy stub
+  ADD_EXTERNAL_ADDRESS(&SharedRuntime::_jint_array_copy_ctr); // used by arraycopy stub
+  ADD_EXTERNAL_ADDRESS(&SharedRuntime::_jlong_array_copy_ctr); // used by arraycopy stub
+  ADD_EXTERNAL_ADDRESS(&SharedRuntime::_oop_array_copy_ctr); // used by arraycopy stub
+  ADD_EXTERNAL_ADDRESS(&SharedRuntime::_checkcast_array_copy_ctr); // used by arraycopy stub
+  ADD_EXTERNAL_ADDRESS(&SharedRuntime::_unsafe_array_copy_ctr); // used by arraycopy stub
+  ADD_EXTERNAL_ADDRESS(&SharedRuntime::_generic_array_copy_ctr); // used by arraycopy stub
+  ADD_EXTERNAL_ADDRESS(&SharedRuntime::_unsafe_set_memory_ctr); // used by arraycopy stub
+#endif /* PRODUCT */
+
+  ADD_EXTERNAL_ADDRESS(SharedRuntime::enable_stack_reserved_zone);
+
+#if defined(AMD64) && !defined(ZERO)
+  ADD_EXTERNAL_ADDRESS(SharedRuntime::montgomery_multiply);
+  ADD_EXTERNAL_ADDRESS(SharedRuntime::montgomery_square);
+#endif // defined(AMD64) && !defined(ZERO)
+
+  ADD_EXTERNAL_ADDRESS(SharedRuntime::d2f);
+  ADD_EXTERNAL_ADDRESS(SharedRuntime::d2i);
+  ADD_EXTERNAL_ADDRESS(SharedRuntime::d2l);
+  ADD_EXTERNAL_ADDRESS(SharedRuntime::dcos);
+  ADD_EXTERNAL_ADDRESS(SharedRuntime::dexp);
+  ADD_EXTERNAL_ADDRESS(SharedRuntime::dlog);
+  ADD_EXTERNAL_ADDRESS(SharedRuntime::dlog10);
+  ADD_EXTERNAL_ADDRESS(SharedRuntime::dpow);
+#ifndef ZERO
+  ADD_EXTERNAL_ADDRESS(SharedRuntime::drem);
+#endif
+  ADD_EXTERNAL_ADDRESS(SharedRuntime::dsin);
+  ADD_EXTERNAL_ADDRESS(SharedRuntime::dtan);
+  ADD_EXTERNAL_ADDRESS(SharedRuntime::f2i);
+  ADD_EXTERNAL_ADDRESS(SharedRuntime::f2l);
+#ifndef ZERO
+  ADD_EXTERNAL_ADDRESS(SharedRuntime::frem);
+#endif
+  ADD_EXTERNAL_ADDRESS(SharedRuntime::l2d);
+  ADD_EXTERNAL_ADDRESS(SharedRuntime::l2f);
+  ADD_EXTERNAL_ADDRESS(SharedRuntime::ldiv);
+  ADD_EXTERNAL_ADDRESS(SharedRuntime::lmul);
+  ADD_EXTERNAL_ADDRESS(SharedRuntime::lrem);
+
+#if INCLUDE_JVMTI
+  ADD_EXTERNAL_ADDRESS(&JvmtiExport::_should_notify_object_alloc);
+#endif /* INCLUDE_JVMTI */
+
+  ADD_EXTERNAL_ADDRESS(ThreadIdentifier::unsafe_offset());
+  // already added
+  // ADD_EXTERNAL_ADDRESS(Thread::current);
+
+  ADD_EXTERNAL_ADDRESS(os::javaTimeMillis);
+  ADD_EXTERNAL_ADDRESS(os::javaTimeNanos);
+#ifndef PRODUCT
+  ADD_EXTERNAL_ADDRESS(os::breakpoint);
+#endif
+
+  ADD_EXTERNAL_ADDRESS(StubRoutines::crc_table_addr());
+#ifndef PRODUCT
+  ADD_EXTERNAL_ADDRESS(&SharedRuntime::_partial_subtype_ctr);
+#endif
+
+#if INCLUDE_JFR
+  ADD_EXTERNAL_ADDRESS(JfrIntrinsicSupport::write_checkpoint);
+  ADD_EXTERNAL_ADDRESS(JfrIntrinsicSupport::return_lease);
+#endif
+
+  ADD_EXTERNAL_ADDRESS(UpcallLinker::handle_uncaught_exception); // used by upcall_stub_exception_handler
+
   {
     // Required by Shared blobs
-    SET_ADDRESS(_extrs, Deoptimization::fetch_unroll_info);
-    SET_ADDRESS(_extrs, Deoptimization::unpack_frames);
-    SET_ADDRESS(_extrs, SafepointSynchronize::handle_polling_page_exception);
-    SET_ADDRESS(_extrs, SharedRuntime::resolve_opt_virtual_call_C);
-    SET_ADDRESS(_extrs, SharedRuntime::resolve_virtual_call_C);
-    SET_ADDRESS(_extrs, SharedRuntime::resolve_static_call_C);
-    SET_ADDRESS(_extrs, SharedRuntime::throw_StackOverflowError);
-    SET_ADDRESS(_extrs, SharedRuntime::throw_delayed_StackOverflowError);
-    SET_ADDRESS(_extrs, SharedRuntime::throw_AbstractMethodError);
-    SET_ADDRESS(_extrs, SharedRuntime::throw_IncompatibleClassChangeError);
-    SET_ADDRESS(_extrs, SharedRuntime::throw_NullPointerException_at_call);
+    ADD_EXTERNAL_ADDRESS(Deoptimization::fetch_unroll_info);
+    ADD_EXTERNAL_ADDRESS(Deoptimization::unpack_frames);
+    ADD_EXTERNAL_ADDRESS(SafepointSynchronize::handle_polling_page_exception);
+    ADD_EXTERNAL_ADDRESS(SharedRuntime::resolve_opt_virtual_call_C);
+    ADD_EXTERNAL_ADDRESS(SharedRuntime::resolve_virtual_call_C);
+    ADD_EXTERNAL_ADDRESS(SharedRuntime::resolve_static_call_C);
+    // already added
+    // ADD_EXTERNAL_ADDRESS(SharedRuntime::throw_delayed_StackOverflowError);
+    ADD_EXTERNAL_ADDRESS(SharedRuntime::throw_AbstractMethodError);
+    ADD_EXTERNAL_ADDRESS(SharedRuntime::throw_IncompatibleClassChangeError);
+    ADD_EXTERNAL_ADDRESS(SharedRuntime::throw_NullPointerException_at_call);
   }
 
 #ifdef COMPILER1
   {
     // Required by C1 blobs
-    SET_ADDRESS(_extrs, static_cast<int (*)(oopDesc*)>(SharedRuntime::dtrace_object_alloc));
-    SET_ADDRESS(_extrs, SharedRuntime::exception_handler_for_return_address);
-    SET_ADDRESS(_extrs, SharedRuntime::register_finalizer);
-    SET_ADDRESS(_extrs, Runtime1::is_instance_of);
-    SET_ADDRESS(_extrs, Runtime1::exception_handler_for_pc);
-    SET_ADDRESS(_extrs, Runtime1::check_abort_on_vm_exception);
-    SET_ADDRESS(_extrs, Runtime1::new_instance);
-    SET_ADDRESS(_extrs, Runtime1::counter_overflow);
-    SET_ADDRESS(_extrs, Runtime1::new_type_array);
-    SET_ADDRESS(_extrs, Runtime1::new_object_array);
-    SET_ADDRESS(_extrs, Runtime1::new_multi_array);
-    SET_ADDRESS(_extrs, Runtime1::throw_range_check_exception);
-    SET_ADDRESS(_extrs, Runtime1::throw_index_exception);
-    SET_ADDRESS(_extrs, Runtime1::throw_div0_exception);
-    SET_ADDRESS(_extrs, Runtime1::throw_null_pointer_exception);
-    SET_ADDRESS(_extrs, Runtime1::throw_array_store_exception);
-    SET_ADDRESS(_extrs, Runtime1::throw_class_cast_exception);
-    SET_ADDRESS(_extrs, Runtime1::throw_incompatible_class_change_error);
-    SET_ADDRESS(_extrs, Runtime1::is_instance_of);
-    SET_ADDRESS(_extrs, Runtime1::monitorenter);
-    SET_ADDRESS(_extrs, Runtime1::monitorexit);
-    SET_ADDRESS(_extrs, Runtime1::deoptimize);
-    SET_ADDRESS(_extrs, Runtime1::access_field_patching);
-    SET_ADDRESS(_extrs, Runtime1::move_klass_patching);
-    SET_ADDRESS(_extrs, Runtime1::move_mirror_patching);
-    SET_ADDRESS(_extrs, Runtime1::move_appendix_patching);
-    SET_ADDRESS(_extrs, Runtime1::predicate_failed_trap);
-    SET_ADDRESS(_extrs, Runtime1::unimplemented_entry);
-    SET_ADDRESS(_extrs, Thread::current);
-    SET_ADDRESS(_extrs, CompressedKlassPointers::base_addr());
-#ifndef PRODUCT
-    SET_ADDRESS(_extrs, os::breakpoint);
-#endif
+    ADD_EXTERNAL_ADDRESS(static_cast<int (*)(oopDesc*)>(SharedRuntime::dtrace_object_alloc));
+    ADD_EXTERNAL_ADDRESS(SharedRuntime::register_finalizer);
+    ADD_EXTERNAL_ADDRESS(Runtime1::is_instance_of);
+    ADD_EXTERNAL_ADDRESS(Runtime1::exception_handler_for_pc);
+    ADD_EXTERNAL_ADDRESS(Runtime1::check_abort_on_vm_exception);
+    ADD_EXTERNAL_ADDRESS(Runtime1::new_instance);
+    ADD_EXTERNAL_ADDRESS(Runtime1::counter_overflow);
+    ADD_EXTERNAL_ADDRESS(Runtime1::new_type_array);
+    ADD_EXTERNAL_ADDRESS(Runtime1::new_object_array);
+    ADD_EXTERNAL_ADDRESS(Runtime1::new_multi_array);
+    ADD_EXTERNAL_ADDRESS(Runtime1::throw_range_check_exception);
+    ADD_EXTERNAL_ADDRESS(Runtime1::throw_index_exception);
+    ADD_EXTERNAL_ADDRESS(Runtime1::throw_div0_exception);
+    ADD_EXTERNAL_ADDRESS(Runtime1::throw_null_pointer_exception);
+    ADD_EXTERNAL_ADDRESS(Runtime1::throw_array_store_exception);
+    ADD_EXTERNAL_ADDRESS(Runtime1::throw_class_cast_exception);
+    ADD_EXTERNAL_ADDRESS(Runtime1::throw_incompatible_class_change_error);
+    ADD_EXTERNAL_ADDRESS(Runtime1::monitorenter);
+    ADD_EXTERNAL_ADDRESS(Runtime1::monitorexit);
+    ADD_EXTERNAL_ADDRESS(Runtime1::deoptimize);
+    ADD_EXTERNAL_ADDRESS(Runtime1::access_field_patching);
+    ADD_EXTERNAL_ADDRESS(Runtime1::move_klass_patching);
+    ADD_EXTERNAL_ADDRESS(Runtime1::move_mirror_patching);
+    ADD_EXTERNAL_ADDRESS(Runtime1::move_appendix_patching);
+    ADD_EXTERNAL_ADDRESS(Runtime1::predicate_failed_trap);
+    ADD_EXTERNAL_ADDRESS(Runtime1::unimplemented_entry);
+    // already added
+    // ADD_EXTERNAL_ADDRESS(Thread::current);
+    ADD_EXTERNAL_ADDRESS(CompressedKlassPointers::base_addr());
   }
 #endif
 
 #ifdef COMPILER2
   {
     // Required by C2 blobs
-    SET_ADDRESS(_extrs, Deoptimization::uncommon_trap);
-    SET_ADDRESS(_extrs, OptoRuntime::handle_exception_C);
-    SET_ADDRESS(_extrs, OptoRuntime::new_instance_C);
-    SET_ADDRESS(_extrs, OptoRuntime::new_array_C);
-    SET_ADDRESS(_extrs, OptoRuntime::new_array_nozero_C);
-    SET_ADDRESS(_extrs, OptoRuntime::multianewarray2_C);
-    SET_ADDRESS(_extrs, OptoRuntime::multianewarray3_C);
-    SET_ADDRESS(_extrs, OptoRuntime::multianewarray4_C);
-    SET_ADDRESS(_extrs, OptoRuntime::multianewarray5_C);
-    SET_ADDRESS(_extrs, OptoRuntime::multianewarrayN_C);
-    SET_ADDRESS(_extrs, OptoRuntime::complete_monitor_locking_C);
-    SET_ADDRESS(_extrs, OptoRuntime::monitor_notify_C);
-    SET_ADDRESS(_extrs, OptoRuntime::monitor_notifyAll_C);
-    SET_ADDRESS(_extrs, OptoRuntime::rethrow_C);
-    SET_ADDRESS(_extrs, OptoRuntime::slow_arraycopy_C);
-    SET_ADDRESS(_extrs, OptoRuntime::register_finalizer_C);
-    SET_ADDRESS(_extrs, OptoRuntime::vthread_end_first_transition_C);
-    SET_ADDRESS(_extrs, OptoRuntime::vthread_start_final_transition_C);
-    SET_ADDRESS(_extrs, OptoRuntime::vthread_start_transition_C);
-    SET_ADDRESS(_extrs, OptoRuntime::vthread_end_transition_C);
-#if defined(AARCH64)
-    SET_ADDRESS(_extrs, JavaThread::verify_cross_modify_fence_failure);
-#endif // AARCH64
+    ADD_EXTERNAL_ADDRESS(Deoptimization::uncommon_trap);
+    ADD_EXTERNAL_ADDRESS(OptoRuntime::handle_exception_C);
+    ADD_EXTERNAL_ADDRESS(OptoRuntime::new_instance_C);
+    ADD_EXTERNAL_ADDRESS(OptoRuntime::new_array_C);
+    ADD_EXTERNAL_ADDRESS(OptoRuntime::new_array_nozero_C);
+    ADD_EXTERNAL_ADDRESS(OptoRuntime::multianewarray2_C);
+    ADD_EXTERNAL_ADDRESS(OptoRuntime::multianewarray3_C);
+    ADD_EXTERNAL_ADDRESS(OptoRuntime::multianewarray4_C);
+    ADD_EXTERNAL_ADDRESS(OptoRuntime::multianewarray5_C);
+    ADD_EXTERNAL_ADDRESS(OptoRuntime::multianewarrayN_C);
+    ADD_EXTERNAL_ADDRESS(OptoRuntime::complete_monitor_locking_C);
+    ADD_EXTERNAL_ADDRESS(OptoRuntime::monitor_notify_C);
+    ADD_EXTERNAL_ADDRESS(OptoRuntime::monitor_notifyAll_C);
+    ADD_EXTERNAL_ADDRESS(OptoRuntime::rethrow_C);
+    ADD_EXTERNAL_ADDRESS(OptoRuntime::slow_arraycopy_C);
+    ADD_EXTERNAL_ADDRESS(OptoRuntime::register_finalizer_C);
+    ADD_EXTERNAL_ADDRESS(OptoRuntime::vthread_end_first_transition_C);
+    ADD_EXTERNAL_ADDRESS(OptoRuntime::vthread_start_final_transition_C);
+    ADD_EXTERNAL_ADDRESS(OptoRuntime::vthread_start_transition_C);
+    ADD_EXTERNAL_ADDRESS(OptoRuntime::vthread_end_transition_C);
+    // already added for
+#if defined(AARCH64) && ! defined(PRODUCT)
+    ADD_EXTERNAL_ADDRESS(JavaThread::verify_cross_modify_fence_failure);
+#endif // AARCH64 && !PRODUCT
   }
 #endif // COMPILER2
 
 #if INCLUDE_G1GC
-  SET_ADDRESS(_extrs, G1BarrierSetRuntime::write_ref_field_pre_entry);
+  ADD_EXTERNAL_ADDRESS(G1BarrierSetRuntime::write_ref_field_pre_entry);
+  ADD_EXTERNAL_ADDRESS(G1BarrierSetRuntime::write_ref_array_pre_narrow_oop_entry); // used by arraycopy stubs
+  ADD_EXTERNAL_ADDRESS(G1BarrierSetRuntime::write_ref_array_pre_oop_entry); // used by arraycopy stubs
+  ADD_EXTERNAL_ADDRESS(G1BarrierSetRuntime::write_ref_array_post_entry); // used by arraycopy stubs
+  ADD_EXTERNAL_ADDRESS(BarrierSetNMethod::nmethod_stub_entry_barrier); // used by method_entry_barrier
+
 #endif
 #if INCLUDE_SHENANDOAHGC
-  SET_ADDRESS(_extrs, ShenandoahRuntime::write_barrier_pre);
-  SET_ADDRESS(_extrs, ShenandoahRuntime::load_reference_barrier_phantom);
-  SET_ADDRESS(_extrs, ShenandoahRuntime::load_reference_barrier_phantom_narrow);
+  ADD_EXTERNAL_ADDRESS(ShenandoahRuntime::write_barrier_pre);
+  ADD_EXTERNAL_ADDRESS(ShenandoahRuntime::load_reference_barrier_strong);
+  ADD_EXTERNAL_ADDRESS(ShenandoahRuntime::load_reference_barrier_strong_narrow);
+  ADD_EXTERNAL_ADDRESS(ShenandoahRuntime::load_reference_barrier_weak);
+  ADD_EXTERNAL_ADDRESS(ShenandoahRuntime::load_reference_barrier_weak_narrow);
+  ADD_EXTERNAL_ADDRESS(ShenandoahRuntime::load_reference_barrier_phantom);
+  ADD_EXTERNAL_ADDRESS(ShenandoahRuntime::load_reference_barrier_phantom_narrow);
+  ADD_EXTERNAL_ADDRESS(ShenandoahRuntime::arraycopy_barrier_oop);
+  ADD_EXTERNAL_ADDRESS(ShenandoahRuntime::arraycopy_barrier_narrow_oop);
 #endif
 #if INCLUDE_ZGC
-  SET_ADDRESS(_extrs, ZBarrierSetRuntime::load_barrier_on_oop_field_preloaded_addr());
-  SET_ADDRESS(_extrs, ZBarrierSetRuntime::load_barrier_on_phantom_oop_field_preloaded_addr());
+  ADD_EXTERNAL_ADDRESS(ZBarrierSetRuntime::load_barrier_on_oop_field_preloaded_addr());
+  ADD_EXTERNAL_ADDRESS(ZBarrierSetRuntime::load_barrier_on_oop_field_preloaded_store_good_addr());
+  ADD_EXTERNAL_ADDRESS(ZBarrierSetRuntime::load_barrier_on_weak_oop_field_preloaded_addr());
+  ADD_EXTERNAL_ADDRESS(ZBarrierSetRuntime::load_barrier_on_phantom_oop_field_preloaded_addr());
+  ADD_EXTERNAL_ADDRESS(ZBarrierSetRuntime::no_keepalive_load_barrier_on_weak_oop_field_preloaded_addr());
+  ADD_EXTERNAL_ADDRESS(ZBarrierSetRuntime::no_keepalive_load_barrier_on_phantom_oop_field_preloaded_addr());
+  ADD_EXTERNAL_ADDRESS(ZBarrierSetRuntime::store_barrier_on_oop_field_with_healing_addr());
+  ADD_EXTERNAL_ADDRESS(ZBarrierSetRuntime::store_barrier_on_oop_field_without_healing_addr());
+  ADD_EXTERNAL_ADDRESS(ZBarrierSetRuntime::no_keepalive_store_barrier_on_oop_field_without_healing_addr());
+  ADD_EXTERNAL_ADDRESS(ZBarrierSetRuntime::store_barrier_on_native_oop_field_without_healing_addr());
+  ADD_EXTERNAL_ADDRESS(ZBarrierSetRuntime::load_barrier_on_oop_array_addr());
+
+  ADD_EXTERNAL_ADDRESS(ZPointerVectorLoadBadMask);
+  ADD_EXTERNAL_ADDRESS(ZPointerVectorStoreBadMask);
+  ADD_EXTERNAL_ADDRESS(ZPointerVectorStoreGoodMask);
 #if defined(AMD64)
-  SET_ADDRESS(_extrs, &ZPointerLoadShift);
+  ADD_EXTERNAL_ADDRESS(&ZPointerLoadShift);
+  ADD_EXTERNAL_ADDRESS(&ZPointerLoadShiftTable);
 #endif
 #endif
 #ifndef ZERO
 #if defined(AMD64) || defined(AARCH64) || defined(RISCV64)
-  SET_ADDRESS(_extrs, MacroAssembler::debug64);
-#endif
+  ADD_EXTERNAL_ADDRESS(MacroAssembler::debug64);
+#endif // defined(AMD64) || defined(AARCH64) || defined(RISCV64)
+#if defined(AMD64)
+  ADD_EXTERNAL_ADDRESS(warning);
+#endif // defined(AMD64)
 #endif // ZERO
 
   // addresses of fields in AOT runtime constants area
   address* p = AOTRuntimeConstants::field_addresses_list();
   while (*p != nullptr) {
-    SET_ADDRESS(_extrs, *p++);
+    address to_add = (address)*p++;
+    ADD_EXTERNAL_ADDRESS(to_add);
   }
 
-  _extrs_complete = true;
-  log_debug(aot, codecache, init)("External addresses recorded");
+  log_debug(aot, codecache, init)("External addresses opened and recorded");
+  // allocate storage for stub entries
+  _stubs_addr = NEW_C_HEAP_ARRAY(address, _stubs_max, mtCode);
+  log_debug(aot, codecache, init)("Stub addresses opened");
 }
 
-static bool initializing_early_stubs = false;
-
-void AOTCodeAddressTable::init_early_stubs() {
-  if (_complete || initializing_early_stubs) return; // Done already
-  initializing_early_stubs = true;
-  _stubs_addr = NEW_C_HEAP_ARRAY(address, _stubs_max, mtCode);
-  _stubs_length = 0;
-  SET_ADDRESS(_stubs, StubRoutines::forward_exception_entry());
+void AOTCodeAddressTable::init_extrs2() {
+  assert(initializing_extrs && !_extrs_complete,
+         "invalid sequence for init_extrs2");
 
   {
-    // Required by C1 blobs
-#if defined(AMD64) && !defined(ZERO)
-    SET_ADDRESS(_stubs, StubRoutines::x86::double_sign_flip());
-    SET_ADDRESS(_stubs, StubRoutines::x86::d2l_fixup());
-#endif // AMD64
+  ADD_EXTERNAL_ADDRESS(Continuation::prepare_thaw); // used by cont_thaw
+  ADD_EXTERNAL_ADDRESS(Continuation::thaw_entry()); // used by cont_thaw
+  ADD_EXTERNAL_ADDRESS(ContinuationEntry::thaw_call_pc_address()); // used by cont_preempt_stub
   }
-
-  _early_stubs_complete = true;
-  log_info(aot, codecache, init)("Early stubs recorded");
+  _extrs_complete = true;
+  initializing_extrs = false;
+  log_debug(aot, codecache, init)("External addresses recorded and closed");
 }
 
-static bool initializing_shared_blobs = false;
-
-void AOTCodeAddressTable::init_shared_blobs() {
-  if (_complete || initializing_shared_blobs) return; // Done already
-  initializing_shared_blobs = true;
-  address* blobs_addr = NEW_C_HEAP_ARRAY(address, _blobs_max, mtCode);
-
-  // Divide _shared_blobs_addr array to chunks because they could be initialized in parrallel
-  _shared_blobs_addr = blobs_addr;
-  _C1_blobs_addr = _shared_blobs_addr + _shared_blobs_max;
-
-  _shared_blobs_length = 0;
-  _C1_blobs_length = 0;
-
-  // clear the address table
-  memset(blobs_addr, 0, sizeof(address)* _blobs_max);
-
-  // Record addresses of generated code blobs
-  SET_ADDRESS(_shared_blobs, SharedRuntime::get_handle_wrong_method_stub());
-  SET_ADDRESS(_shared_blobs, SharedRuntime::get_ic_miss_stub());
-  SET_ADDRESS(_shared_blobs, SharedRuntime::deopt_blob()->unpack());
-  SET_ADDRESS(_shared_blobs, SharedRuntime::deopt_blob()->unpack_with_exception());
-  SET_ADDRESS(_shared_blobs, SharedRuntime::deopt_blob()->unpack_with_reexecution());
-  SET_ADDRESS(_shared_blobs, SharedRuntime::deopt_blob()->unpack_with_exception_in_tls());
-#if INCLUDE_JVMCI
-  if (EnableJVMCI) {
-    SET_ADDRESS(_shared_blobs, SharedRuntime::deopt_blob()->uncommon_trap());
-    SET_ADDRESS(_shared_blobs, SharedRuntime::deopt_blob()->implicit_exception_uncommon_trap());
+void AOTCodeAddressTable::add_external_addresses(GrowableArray<address>& addresses) {
+  assert(initializing_extrs && !_extrs_complete,
+         "invalid sequence for add_external_addresses");
+  for (int i = 0; i < addresses.length(); i++) {
+    ADD_EXTERNAL_ADDRESS(addresses.at(i));
   }
-#endif
-
-  _shared_blobs_complete = true;
-  log_debug(aot, codecache, init)("Early shared blobs recorded");
-  _complete = true;
+  log_debug(aot, codecache, init)("Recorded %d additional external addresses",
+                                  addresses.length());
 }
 
-void AOTCodeAddressTable::init_early_c1() {
-#ifdef COMPILER1
-  // Runtime1 Blobs
-  StubId id = StubInfo::stub_base(StubGroup::C1);
-  // include forward_exception in range we publish
-  StubId limit = StubInfo::next(StubId::c1_forward_exception_id);
-  for (; id != limit; id = StubInfo::next(id)) {
-    if (Runtime1::blob_for(id) == nullptr) {
-      log_info(aot, codecache, init)("C1 blob %s is missing", Runtime1::name_for(id));
-      continue;
-    }
-    if (Runtime1::entry_for(id) == nullptr) {
-      log_info(aot, codecache, init)("C1 blob %s is missing entry", Runtime1::name_for(id));
-      continue;
-    }
-    address entry = Runtime1::entry_for(id);
-    SET_ADDRESS(_C1_blobs, entry);
-  }
-#endif // COMPILER1
-  assert(_C1_blobs_length <= _C1_blobs_max, "increase _C1_blobs_max to %d", _C1_blobs_length);
-  _early_c1_complete = true;
+void AOTCodeAddressTable::add_stub_entry(EntryId entry_id, address a) {
+  assert(_extrs_complete || initializing_extrs,
+         "recording stub entry address before external addresses complete");
+  assert(!(StubInfo::is_shared(StubInfo::stub(entry_id)) && _shared_stubs_complete), "too late to add shared entry");
+  assert(!(StubInfo::is_stubgen(StubInfo::stub(entry_id)) && _stubgen_stubs_complete), "too late to add stubgen entry");
+  assert(!(StubInfo::is_c1(StubInfo::stub(entry_id)) && _c1_stubs_complete), "too late to add c1 entry");
+  assert(!(StubInfo::is_c2(StubInfo::stub(entry_id)) && _c2_stubs_complete), "too late to add c2 entry");
+  log_debug(aot, stubs)("Recording address 0x%p for %s entry %s", a, StubInfo::name(StubInfo::stubgroup(entry_id)), StubInfo::name(entry_id));
+  int idx = static_cast<int>(entry_id);
+  hash_address(a, _stubs_base + idx);
+  _stubs_addr[idx] = a;
 }
 
-#undef SET_ADDRESS
+void AOTCodeAddressTable::set_shared_stubs_complete() {
+  assert(!_shared_stubs_complete, "repeated close for shared stubs!");
+  _shared_stubs_complete = true;
+  log_debug(aot, codecache, init)("Shared stubs closed");
+}
+
+void AOTCodeAddressTable::set_c1_stubs_complete() {
+  assert(!_c1_stubs_complete, "repeated close for c1 stubs!");
+  _c1_stubs_complete = true;
+  log_debug(aot, codecache, init)("C1 stubs closed");
+}
+
+void AOTCodeAddressTable::set_c2_stubs_complete() {
+  assert(!_c2_stubs_complete, "repeated close for c2 stubs!");
+  _c2_stubs_complete = true;
+  log_debug(aot, codecache, init)("C2 stubs closed");
+}
+
+void AOTCodeAddressTable::set_stubgen_stubs_complete() {
+  assert(!_stubgen_stubs_complete, "repeated close for stubgen stubs!");
+  _stubgen_stubs_complete = true;
+  log_debug(aot, codecache, init)("StubGen stubs closed");
+}
 
 #ifdef PRODUCT
 #define MAX_STR_COUNT 200
@@ -1602,6 +2219,7 @@ void AOTCodeCache::load_strings() {
     uint len = string_lengths[i];
     _C_strings_s[i] = i;
     _C_strings_id[i] = i;
+    log_trace(aot, codecache, stringtable)("load_strings: _C_strings[%d] " INTPTR_FORMAT " '%s'", i, p2i(p), p);
     p += len;
   }
   assert((uint)(p - _C_strings_buf) <= strings_size, "(" INTPTR_FORMAT " - " INTPTR_FORMAT ") = %d > %d ", p2i(p), p2i(_C_strings_buf), (uint)(p - _C_strings_buf), strings_size);
@@ -1621,6 +2239,7 @@ int AOTCodeCache::store_strings() {
     }
     for (int i = 0; i < _C_strings_used; i++) {
       const char* str = _C_strings[_C_strings_s[i]];
+      log_trace(aot, codecache, stringtable)("store_strings: _C_strings[%d] " INTPTR_FORMAT " '%s'", i, p2i(str), str);
       uint len = (uint)strlen(str) + 1;
       length += len;
       assert(len < 1000, "big string: %s", str);
@@ -1648,7 +2267,7 @@ const char* AOTCodeCache::add_C_string(const char* str) {
 }
 
 const char* AOTCodeAddressTable::add_C_string(const char* str) {
-  if (_extrs_complete) {
+  if (_extrs_complete || initializing_extrs) {
     // Check previous strings address
     for (int i = 0; i < _C_strings_count; i++) {
       if (_C_strings_in[i] == str) {
@@ -1686,6 +2305,7 @@ int AOTCodeAddressTable::id_for_C_string(address str) {
         assert(id < _C_strings_used, "%d >= %d", id , _C_strings_used);
         return id; // Found recorded
       }
+      log_trace(aot, codecache, stringtable)("id_for_C_string: _C_strings[%d ==> %d] " INTPTR_FORMAT " '%s'", i, _C_strings_used, p2i(str), str);
       // Not found in recorded, add new
       id = _C_strings_used++;
       _C_strings_s[id] = i;
@@ -1711,7 +2331,7 @@ static int search_address(address addr, address* table, uint length) {
 }
 
 address AOTCodeAddressTable::address_for_id(int idx) {
-  assert(_extrs_complete, "AOT Code Cache VM runtime addresses table is not complete");
+  assert(_extrs_complete || initializing_extrs, "AOT Code Cache VM runtime addresses table is not complete");
   if (idx == -1) {
     return (address)-1;
   }
@@ -1728,15 +2348,9 @@ address AOTCodeAddressTable::address_for_id(int idx) {
   if (/* id >= _extrs_base && */ id < _extrs_length) {
     return _extrs_addr[id - _extrs_base];
   }
-  if (id >= _stubs_base && id < _stubs_base + _stubs_length) {
+  if (id >= _stubs_base && id < _c_str_base) {
     return _stubs_addr[id - _stubs_base];
   }
-  if (id >= _shared_blobs_base && id < _shared_blobs_base + _shared_blobs_length) {
-    return _shared_blobs_addr[id - _shared_blobs_base];
-  }
-  if (id >= _C1_blobs_base && id < _C1_blobs_base + _C1_blobs_length) {
-    return _C1_blobs_addr[id - _C1_blobs_base];
-  }
   if (id >= _c_str_base && id < (_c_str_base + (uint)_C_strings_count)) {
     return address_for_C_string(id - _c_str_base);
   }
@@ -1745,7 +2359,7 @@ address AOTCodeAddressTable::address_for_id(int idx) {
 }
 
 int AOTCodeAddressTable::id_for_address(address addr, RelocIterator reloc, CodeBlob* code_blob) {
-  assert(_extrs_complete, "AOT Code Cache VM runtime addresses table is not complete");
+  assert(_extrs_complete || initializing_extrs, "AOT Code Cache VM runtime addresses table is not complete");
   int id = -1;
   if (addr == (address)-1) { // Static call stub has jump to itself
     return id;
@@ -1754,15 +2368,24 @@ int AOTCodeAddressTable::id_for_address(address addr, RelocIterator reloc, CodeB
   BarrierSet* bs = BarrierSet::barrier_set();
   bool is_const_card_table_base = !UseG1GC && !UseShenandoahGC && bs->is_a(BarrierSet::CardTableBarrierSet);
   guarantee(!is_const_card_table_base || addr != ci_card_table_address_const(), "sanity");
-
+  // fast path for stubs and external addresses
+  if (_hash_table != nullptr) {
+    int *result = _hash_table->get(addr);
+    if (result != nullptr) {
+      id = *result;
+      log_trace(aot, codecache)("Address " INTPTR_FORMAT " retrieved from AOT Code Cache address hash table with index '%d'",
+                                p2i(addr), id);
+      return id;
+    }
+  }
   // Seach for C string
   id = id_for_C_string(addr);
   if (id >= 0) {
     return id + _c_str_base;
   }
-  if (StubRoutines::contains(addr)) {
-    // Search in stubs
-    id = search_address(addr, _stubs_addr, _stubs_length);
+  if (StubRoutines::contains(addr) || CodeCache::find_blob(addr) != nullptr) {
+    // Search for a matching stub entry
+    id = search_address(addr, _stubs_addr, _stubs_max);
     if (id < 0) {
       StubCodeDesc* desc = StubCodeDesc::desc_for(addr);
       if (desc == nullptr) {
@@ -1774,51 +2397,39 @@ int AOTCodeAddressTable::id_for_address(address addr, RelocIterator reloc, CodeB
       return id + _stubs_base;
     }
   } else {
-    CodeBlob* cb = CodeCache::find_blob(addr);
-    if (cb != nullptr) {
-      // Search in code blobs
-      int id_base = _shared_blobs_base;
-      id = search_address(addr, _shared_blobs_addr, _blobs_max);
-      if (id < 0) {
-        assert(false, "Address " INTPTR_FORMAT " for Blob:%s is missing in AOT Code Cache addresses table", p2i(addr), cb->name());
+    // Search in runtime functions
+    id = search_address(addr, _extrs_addr, _extrs_length);
+    if (id < 0) {
+      ResourceMark rm;
+      const int buflen = 1024;
+      char* func_name = NEW_RESOURCE_ARRAY(char, buflen);
+      int offset = 0;
+      if (os::dll_address_to_function_name(addr, func_name, buflen, &offset)) {
+        if (offset > 0) {
+          // Could be address of C string
+          uint dist = (uint)pointer_delta(addr, (address)os::init, 1);
+          log_debug(aot, codecache)("Address " INTPTR_FORMAT " (offset %d) for runtime target '%s' is missing in AOT Code Cache addresses table",
+                                    p2i(addr), dist, (const char*)addr);
+          assert(dist > (uint)(_all_max + MAX_STR_COUNT), "change encoding of distance");
+          return dist;
+        }
+#ifdef ASSERT
+        reloc.print_current_on(tty);
+        code_blob->print_on(tty);
+        code_blob->print_code_on(tty);
+        assert(false, "Address " INTPTR_FORMAT " for runtime target '%s+%d' is missing in AOT Code Cache addresses table", p2i(addr), func_name, offset);
+#endif
       } else {
-        return id_base + id;
+#ifdef ASSERT
+        reloc.print_current_on(tty);
+        code_blob->print_on(tty);
+        code_blob->print_code_on(tty);
+        os::find(addr, tty);
+        assert(false, "Address " INTPTR_FORMAT " for <unknown>/('%s') is missing in AOT Code Cache addresses table", p2i(addr), (const char*)addr);
+#endif
       }
     } else {
-      // Search in runtime functions
-      id = search_address(addr, _extrs_addr, _extrs_length);
-      if (id < 0) {
-        ResourceMark rm;
-        const int buflen = 1024;
-        char* func_name = NEW_RESOURCE_ARRAY(char, buflen);
-        int offset = 0;
-        if (os::dll_address_to_function_name(addr, func_name, buflen, &offset)) {
-          if (offset > 0) {
-            // Could be address of C string
-            uint dist = (uint)pointer_delta(addr, (address)os::init, 1);
-            log_debug(aot, codecache)("Address " INTPTR_FORMAT " (offset %d) for runtime target '%s' is missing in AOT Code Cache addresses table",
-                                      p2i(addr), dist, (const char*)addr);
-            assert(dist > (uint)(_all_max + MAX_STR_COUNT), "change encoding of distance");
-            return dist;
-          }
-#ifdef ASSERT
-          reloc.print_current_on(tty);
-          code_blob->print_on(tty);
-          code_blob->print_code_on(tty);
-          assert(false, "Address " INTPTR_FORMAT " for runtime target '%s+%d' is missing in AOT Code Cache addresses table", p2i(addr), func_name, offset);
-#endif
-        } else {
-#ifdef ASSERT
-          reloc.print_current_on(tty);
-          code_blob->print_on(tty);
-          code_blob->print_code_on(tty);
-          os::find(addr, tty);
-          assert(false, "Address " INTPTR_FORMAT " for <unknown>/('%s') is missing in AOT Code Cache addresses table", p2i(addr), (const char*)addr);
-#endif
-        }
-      } else {
-        return _extrs_base + id;
-      }
+      return _extrs_base + id;
     }
   }
   return id;
@@ -1885,3 +2496,161 @@ void AOTCodeCache::print_on(outputStream* st) {
     }
   }
 }
+
+// methods for managing entries in multi-stub blobs
+
+
+AOTStubData::AOTStubData(BlobId blob_id) :
+  _blob_id(blob_id),
+  _cached_blob(nullptr),
+  _stub_cnt(0),
+  _ranges(nullptr),
+  _flags(0) {
+  assert(StubInfo::is_stubgen(blob_id),
+         "AOTStubData expects a multi-stub blob not %s",
+         StubInfo::name(blob_id));
+
+  // we cannot save or restore preuniversestubs because the cache
+  // cannot be accessed before initialising the universe
+  if (blob_id == BlobId::stubgen_preuniverse_id) {
+    // invalidate any attempt to use this
+    _flags |= INVALID;
+    return;
+  }
+  if (AOTCodeCache::is_on()) {
+    // allow update of stub entry addresses
+    if (AOTCodeCache::is_using_stub()) {
+      // allow stub loading
+      _flags |= USING;
+    }
+    if (AOTCodeCache::is_dumping_stub()) {
+      // allow stub saving
+      _flags |= DUMPING;
+    }
+    // we need to track all the blob's entries
+    _stub_cnt = StubInfo::stub_count(_blob_id);
+    _ranges = NEW_C_HEAP_ARRAY(StubAddrRange, _stub_cnt, mtCode);
+    for (int i = 0; i < _stub_cnt; i++) {
+      _ranges[i].default_init();
+    }
+  }
+}
+
+bool AOTStubData::load_code_blob() {
+  assert(is_using(), "should not call");
+  assert(!is_invalid() && _cached_blob == nullptr, "repeated init");
+  _cached_blob = AOTCodeCache::load_code_blob(AOTCodeEntry::StubGenBlob,
+                                              _blob_id,
+                                              this);
+  if (_cached_blob == nullptr) {
+    set_invalid();
+    return false;
+  } else {
+    return true;
+  }
+}
+
+bool AOTStubData::store_code_blob(CodeBlob& new_blob, CodeBuffer *code_buffer) {
+  assert(is_dumping(), "should not call");
+  assert(_cached_blob == nullptr, "should not be loading and storing!");
+  if (!AOTCodeCache::store_code_blob(new_blob,
+                                     AOTCodeEntry::StubGenBlob,
+                                     _blob_id, this, code_buffer)) {
+    set_invalid();
+    return false;
+  } else {
+    return true;
+  }
+}
+
+address AOTStubData::load_archive_data(StubId stub_id, address& end, GrowableArray<address>* entries, GrowableArray<address>* extras) {
+  assert(StubInfo::blob(stub_id) == _blob_id, "sanity check");
+  if (is_invalid()) {
+    return nullptr;
+  }
+  int idx = StubInfo::stubgen_offset_in_blob(_blob_id, stub_id);
+  assert(idx >= 0 && idx < _stub_cnt, "invalid index %d for stub count %d", idx, _stub_cnt);
+  // ensure we have a valid associated range
+  StubAddrRange &range = _ranges[idx];
+  int base = range.start_index();
+  if (base < 0) {
+#ifdef DEBUG
+    // reset index so we can idenitfy which ones we failed to find
+    range.init_entry(-2, 0);
+#endif
+    return nullptr;
+  }
+  int count = range.count();
+  assert(base >= 0, "sanity");
+  assert(count >= 2, "sanity");
+  // first two saved addresses are start and end
+  address start = _address_array.at(base);
+  end = _address_array.at(base + 1);
+  assert(start != nullptr, "failed to load start address of stub %s", StubInfo::name(stub_id));
+  assert(end != nullptr, "failed to load end address of stub %s", StubInfo::name(stub_id));
+  assert(start < end, "start address %p should be less than end %p address for stub %s", start, end, StubInfo::name(stub_id));
+
+  int entry_count = StubInfo::entry_count(stub_id);
+  // the address count must at least include the stub start, end
+  // and secondary addresses
+  assert(count >= entry_count + 1, "stub %s requires %d saved addresses but only has %d", StubInfo::name(stub_id), entry_count + 1, count);
+
+  // caller must retrieve secondary entries if and only if they exist
+  assert((entry_count == 1) == (entries == nullptr), "trying to retrieve wrong number of entries for stub %s", StubInfo::name(stub_id));
+  int index = 2;
+  if (entries != nullptr) {
+    assert(entries->length() == 0, "non-empty array when retrieving entries for stub %s!", StubInfo::name(stub_id));
+    while (index < entry_count + 1) {
+      address entry = _address_array.at(base + index++);
+      assert(entry == nullptr || (start < entry && entry < end), "entry address %p not in range (%p, %p) for stub %s", entry, start, end, StubInfo::name(stub_id));
+      entries->append(entry);
+    }
+  }
+  // caller must retrieve extras if and only if they exist
+  assert((index < count) == (extras != nullptr), "trying to retrieve wrong number of extras for stub %s", StubInfo::name(stub_id));
+  if (extras != nullptr) {
+    assert(extras->length() == 0, "non-empty array when retrieving extras for stub %s!", StubInfo::name(stub_id));
+    while (index < count) {
+      address extra = _address_array.at(base + index++);
+      assert(extra == nullptr || (start <= extra && extra <= end), "extra address %p not in range (%p, %p) for stub %s", extra, start, end, StubInfo::name(stub_id));
+      extras->append(extra);
+    }
+  }
+
+  return start;
+}
+
+void AOTStubData::store_archive_data(StubId stub_id, address start, address end, GrowableArray<address>* entries, GrowableArray<address>* extras) {
+  assert(StubInfo::blob(stub_id) == _blob_id, "sanity check");
+  assert(start != nullptr, "start address cannot be null");
+  assert(end != nullptr, "end address cannot be null");
+  assert(start < end, "start address %p should be less than end %p address for stub %s", start, end, StubInfo::name(stub_id));
+  int idx = StubInfo::stubgen_offset_in_blob(_blob_id, stub_id);
+  StubAddrRange& range = _ranges[idx];
+  assert(range.start_index() == -1, "sanity");
+  int base = _address_array.length();
+  assert(base >= 0, "sanity");
+  // first two saved addresses are start and end
+  _address_array.append(start);
+  _address_array.append(end);
+  // caller must save secondary entries if and only if they exist
+  assert((StubInfo::entry_count(stub_id) == 1) == (entries == nullptr), "trying to save wrong number of entries for stub %s", StubInfo::name(stub_id));
+  if (entries != nullptr) {
+    assert(entries->length() == StubInfo::entry_count(stub_id) - 1, "incorrect entry count %d when saving entries for stub %s!", entries->length(), StubInfo::name(stub_id));
+    for (int i = 0; i < entries->length(); i++) {
+      address entry = entries->at(i);
+      assert(entry == nullptr || (start < entry && entry < end), "entry address %p not in range (%p, %p) for stub %s", entry, start, end, StubInfo::name(stub_id));
+      _address_array.append(entry);
+    }
+  }
+  // caller may wish to save extra addresses
+  if (extras != nullptr) {
+    for (int i = 0; i < extras->length(); i++) {
+      address extra = extras->at(i);
+      // handler range end may be end -- it gets restored as nullptr
+      assert(extra == nullptr || (start <= extra && extra <= end), "extra address %p not in range (%p, %p) for stub %s", extra, start, end, StubInfo::name(stub_id));
+      _address_array.append(extra);
+    }
+  }
+  range.init_entry(base, _address_array.length() - base);
+}
diff --git a/src/hotspot/share/code/aotCodeCache.hpp b/src/hotspot/share/code/aotCodeCache.hpp
index 179f131c639..c4ebe271767 100644
--- a/src/hotspot/share/code/aotCodeCache.hpp
+++ b/src/hotspot/share/code/aotCodeCache.hpp
@@ -28,6 +28,7 @@
 #include "gc/shared/collectedHeap.hpp"
 #include "gc/shared/gc_globals.hpp"
 #include "runtime/stubInfo.hpp"
+#include "utilities/hashTable.hpp"
 
 /*
  * AOT Code Cache collects code from Code Cache and corresponding metadata
@@ -39,6 +40,7 @@
 class CodeBuffer;
 class RelocIterator;
 class AOTCodeCache;
+class AOTCodeReader;
 class AdapterBlob;
 class ExceptionBlob;
 class ImmutableOopMapSet;
@@ -54,6 +56,7 @@ enum CompLevel : signed char;
   Fn(SharedBlob) \
   Fn(C1Blob) \
   Fn(C2Blob) \
+  Fn(StubGenBlob) \
 
 // Descriptor of AOT Code Cache's entry
 class AOTCodeEntry {
@@ -115,48 +118,57 @@ public:
   address dumptime_content_start_addr() const { return _dumptime_content_start_addr; }
 
   static bool is_valid_entry_kind(Kind kind) { return kind > None && kind < Kind_count; }
-  static bool is_blob(Kind kind) { return kind == SharedBlob || kind == C1Blob || kind == C2Blob; }
+  static bool is_blob(Kind kind) { return kind == SharedBlob || kind == C1Blob || kind == C2Blob || kind == StubGenBlob; }
+  static bool is_single_stub_blob(Kind kind) { return kind == SharedBlob || kind == C1Blob || kind == C2Blob; }
+  static bool is_multi_stub_blob(Kind kind) { return kind == StubGenBlob; }
   static bool is_adapter(Kind kind) { return kind == Adapter; }
 };
 
+// we use a hash table to speed up translation of external addresses
+// or stub addresses to their corresponding indexes when dumping stubs
+// or nmethods to the AOT code cache.
+class AOTCodeAddressHashTable : public HashTable<
+  address,
+  int,
+  36137, // prime number
+  AnyObj::C_HEAP,
+  mtCode> {};
+
 // Addresses of stubs, blobs and runtime finctions called from compiled code.
 class AOTCodeAddressTable : public CHeapObj<mtCode> {
 private:
   address* _extrs_addr;
   address* _stubs_addr;
-  address* _shared_blobs_addr;
-  address* _C1_blobs_addr;
   uint     _extrs_length;
-  uint     _stubs_length;
-  uint     _shared_blobs_length;
-  uint     _C1_blobs_length;
 
   bool _extrs_complete;
-  bool _early_stubs_complete;
-  bool _shared_blobs_complete;
-  bool _early_c1_complete;
-  bool _complete;
+  bool _shared_stubs_complete;
+  bool _c1_stubs_complete;
+  bool _c2_stubs_complete;
+  bool _stubgen_stubs_complete;
+  AOTCodeAddressHashTable* _hash_table;
 
+  void hash_address(address addr, int idx);
 public:
   AOTCodeAddressTable() :
     _extrs_addr(nullptr),
     _stubs_addr(nullptr),
-    _shared_blobs_addr(nullptr),
-    _C1_blobs_addr(nullptr),
     _extrs_length(0),
-    _stubs_length(0),
-    _shared_blobs_length(0),
-    _C1_blobs_length(0),
     _extrs_complete(false),
-    _early_stubs_complete(false),
-    _shared_blobs_complete(false),
-    _early_c1_complete(false),
-    _complete(false)
+    _shared_stubs_complete(false),
+    _c1_stubs_complete(false),
+    _c2_stubs_complete(false),
+    _stubgen_stubs_complete(false),
+    _hash_table(nullptr)
   { }
   void init_extrs();
-  void init_early_stubs();
-  void init_shared_blobs();
-  void init_early_c1();
+  void init_extrs2();
+  void add_stub_entry(EntryId entry_id, address entry);
+  void add_external_addresses(GrowableArray<address>& addresses) NOT_CDS_RETURN;
+  void set_shared_stubs_complete();
+  void set_c1_stubs_complete();
+  void set_c2_stubs_complete();
+  void set_stubgen_stubs_complete();
   const char* add_C_string(const char* str);
   int  id_for_C_string(address str);
   address address_for_C_string(int idx);
@@ -164,7 +176,98 @@ public:
   address address_for_id(int id);
 };
 
-#define AOTCODECACHE_CONFIGS_GENERIC_DO(do_var, do_fun) \
+// Auxiliary class used by AOTStubData to locate addresses owned by a
+// stub in the _address_array.
+
+class StubAddrRange {
+private:
+  // Index of the first address owned by a stub or -1 if none present
+  int _start_index;
+  // Total number of addresses owned by a stub, including in order:
+  // start address for stub code and first entry, (exclusive) end
+  // address for stub code, all secondary entry addresses, any
+  // auxiliary addresses
+  uint _naddr;
+ public:
+  StubAddrRange() : _start_index(-1), _naddr(0) {}
+  int start_index() { return _start_index; }
+  int count() { return _naddr; }
+
+  void default_init() {
+    _start_index = -1;
+    _naddr = 0;
+  }
+
+  void init_entry(int start_index, int naddr) {
+    _start_index = start_index;
+    _naddr = naddr;
+  }
+};
+
+// class used to save and restore details of stubs embedded in a
+// multi-stub (StubGen) blob
+
+class AOTStubData : public StackObj {
+  friend class AOTCodeCache;
+  friend class AOTCodeReader;
+private:
+  BlobId _blob_id; // must be a stubgen blob id
+  // whatever buffer blob was successfully loaded from the AOT cache
+  // following a call to load_code_blob or nullptr
+  CodeBlob *_cached_blob;
+  // Array of addresses owned by stubs. Each stub appends addresses to
+  // this array as a block, whether at the end of generation or at the
+  // end of restoration from the cache. The first two addresses in
+  // each block are the "start" and "end2 address of the stub. Any
+  // other visible addresses located within the range [start,end)
+  // follow, either extra entries, data addresses or SEGV-protected
+  // subrange start, end and handler addresses. In the special case
+  // that the SEGV handler address is the (external) common address
+  // handler the array will hold value nullptr.
+  GrowableArray<address> _address_array;
+  // count of how many stubs exist in the current blob (not all of
+  // which may actually be generated)
+  int _stub_cnt;
+  // array identifying range of entries in _address_array for each stub
+  // indexed by offset of stub in blob
+  StubAddrRange* _ranges;
+
+  // flags indicating whether the AOT code cache is open and, if so,
+  // whether we are loading or storing stubs or have encountered any
+  // invalid stubs.
+  enum Flags {
+    USING   = 1 << 0,            // open and loading stubs
+    DUMPING = 1 << 1,            // open and storing stubs
+    INVALID = 1 << 2,            // found invalid stub when loading
+  };
+
+  uint32_t _flags;
+
+  void set_invalid() { _flags |= INVALID; }
+
+  StubAddrRange& get_range(int idx) const { return _ranges[idx]; }
+  GrowableArray<address>& address_array() { return _address_array; }
+  // accessor for entry/auxiliary addresses defaults to start entry
+public:
+  AOTStubData(BlobId blob_id) NOT_CDS({});
+
+  ~AOTStubData()    CDS_ONLY({FREE_C_HEAP_ARRAY(StubAddrRange, _ranges);}) NOT_CDS({})
+
+  bool is_using()   CDS_ONLY({ return (_flags & USING) != 0; }) NOT_CDS_RETURN_(false);
+  bool is_dumping() CDS_ONLY({ return (_flags & DUMPING) != 0; }) NOT_CDS_RETURN_(false);
+  bool is_invalid() CDS_ONLY({ return (_flags & INVALID) != 0; }) NOT_CDS_RETURN_(false);
+
+  BlobId blob_id() { return _blob_id; }
+  bool load_code_blob() NOT_CDS_RETURN_(true);
+  bool store_code_blob(CodeBlob& new_blob, CodeBuffer *code_buffer) NOT_CDS_RETURN_(true);
+
+  address load_archive_data(StubId stub_id, address &end, GrowableArray<address>* entries = nullptr, GrowableArray<address>* extras = nullptr) NOT_CDS_RETURN_(nullptr);
+  void store_archive_data(StubId stub_id, address start, address end, GrowableArray<address>* entries = nullptr, GrowableArray<address>* extras = nullptr) NOT_CDS_RETURN;
+
+  const AOTStubData* as_const() { return (const AOTStubData*)this; }
+};
+
+#define AOTCODECACHE_CONFIGS_GENERIC_DO(do_var, do_fun)                 \
   do_var(int,   AllocateInstancePrefetchLines)          /* stubs and nmethods */ \
   do_var(int,   AllocatePrefetchDistance)               /* stubs and nmethods */ \
   do_var(int,   AllocatePrefetchLines)                  /* stubs and nmethods */ \
@@ -301,17 +404,18 @@ protected:
     uint   _entries_offset;  // offset of AOTCodeEntry array describing entries
     uint   _adapters_count;
     uint   _shared_blobs_count;
+    uint   _stubgen_blobs_count;
     uint   _C1_blobs_count;
     uint   _C2_blobs_count;
     Config _config; // must be the last element as there is trailing data stored immediately after Config
 
   public:
     void init(uint cache_size,
-              uint strings_count,  uint strings_offset,
-              uint entries_count,  uint entries_offset,
-              uint adapters_count, uint shared_blobs_count,
-              uint C1_blobs_count, uint C2_blobs_count,
-              uint cpu_features_offset) {
+              uint strings_count,       uint strings_offset,
+              uint entries_count,       uint entries_offset,
+              uint adapters_count,      uint shared_blobs_count,
+              uint stubgen_blobs_count, uint C1_blobs_count,
+              uint C2_blobs_count,      uint cpu_features_offset) {
       _version        = AOT_CODE_VERSION;
       _cache_size     = cache_size;
       _strings_count  = strings_count;
@@ -320,6 +424,7 @@ protected:
       _entries_offset = entries_offset;
       _adapters_count = adapters_count;
       _shared_blobs_count = shared_blobs_count;
+      _stubgen_blobs_count = stubgen_blobs_count;
       _C1_blobs_count = C1_blobs_count;
       _C2_blobs_count = C2_blobs_count;
       _config.record(cpu_features_offset);
@@ -332,6 +437,7 @@ protected:
     uint entries_count()  const { return _entries_count; }
     uint entries_offset() const { return _entries_offset; }
     uint adapters_count() const { return _adapters_count; }
+    uint stubgen_blobs_count()   const { return _stubgen_blobs_count; }
     uint shared_blobs_count()    const { return _shared_blobs_count; }
     uint C1_blobs_count() const { return _C1_blobs_count; }
     uint C2_blobs_count() const { return _C2_blobs_count; }
@@ -381,6 +487,7 @@ private:
   void clear_lookup_failed()   { _lookup_failed = false; }
   bool lookup_failed()   const { return _lookup_failed; }
 
+  void add_stub_entry(EntryId entry_id, address entry) NOT_CDS_RETURN;
 public:
   AOTCodeCache(bool is_dumping, bool is_using);
 
@@ -396,9 +503,12 @@ public:
   void load_strings();
   int store_strings();
 
-  static void init_early_stubs_table() NOT_CDS_RETURN;
-  static void init_shared_blobs_table() NOT_CDS_RETURN;
-  static void init_early_c1_table() NOT_CDS_RETURN;
+  static void set_shared_stubs_complete() NOT_CDS_RETURN;
+  static void set_c1_stubs_complete() NOT_CDS_RETURN ;
+  static void set_c2_stubs_complete() NOT_CDS_RETURN;
+  static void set_stubgen_stubs_complete() NOT_CDS_RETURN;
+
+  void add_stub_entries(StubId stub_id, address start, GrowableArray<address> *entries = nullptr, int offset = -1) NOT_CDS_RETURN;
 
   address address_for_C_string(int idx) const { return _table->address_for_C_string(idx); }
   address address_for_id(int id) const { return _table->address_for_id(id); }
@@ -418,22 +528,41 @@ public:
 
   bool finish_write();
 
-  bool write_relocations(CodeBlob& code_blob);
+  bool write_relocations(CodeBlob& code_blob, RelocIterator& iter);
   bool write_oop_map_set(CodeBlob& cb);
+  bool write_stub_data(CodeBlob& blob, AOTStubData *stub_data);
 #ifndef PRODUCT
   bool write_asm_remarks(CodeBlob& cb);
   bool write_dbg_strings(CodeBlob& cb);
 #endif // PRODUCT
 
+private:
+  // internal private API to save and restore blobs
+  static bool store_code_blob(CodeBlob& blob,
+                              AOTCodeEntry::Kind entry_kind,
+                              uint id,
+                              const char* name,
+                              AOTStubData* stub_data,
+                              CodeBuffer* code_buffer) NOT_CDS_RETURN_(false);
+
+  static CodeBlob* load_code_blob(AOTCodeEntry::Kind kind,
+                                  uint id,
+                                  const char* name,
+                                  AOTStubData* stub_data) NOT_CDS_RETURN_(nullptr);
+
+public:
   // save and restore API for non-enumerable code blobs
   static bool store_code_blob(CodeBlob& blob,
                               AOTCodeEntry::Kind entry_kind,
-                              uint id, const char* name) NOT_CDS_RETURN_(false);
+                              uint id,
+                              const char* name) NOT_CDS_RETURN_(false);
 
   static CodeBlob* load_code_blob(AOTCodeEntry::Kind kind,
                                   uint id, const char* name) NOT_CDS_RETURN_(nullptr);
 
   // save and restore API for enumerable code blobs
+
+  // API for single-stub blobs
   static bool store_code_blob(CodeBlob& blob,
                               AOTCodeEntry::Kind entry_kind,
                               BlobId id) NOT_CDS_RETURN_(false);
@@ -441,6 +570,22 @@ public:
   static CodeBlob* load_code_blob(AOTCodeEntry::Kind kind,
                                   BlobId id) NOT_CDS_RETURN_(nullptr);
 
+  // API for multi-stub blobs -- for use by class StubGenerator.
+
+  static bool store_code_blob(CodeBlob& blob,
+                              AOTCodeEntry::Kind kind,
+                              BlobId id,
+                              AOTStubData* stub_data,
+                              CodeBuffer *code_buffer) NOT_CDS_RETURN_(false);
+
+  static CodeBlob* load_code_blob(AOTCodeEntry::Kind kind,
+                                  BlobId id,
+                                  AOTStubData* stub_data) NOT_CDS_RETURN_(nullptr);
+
+  static void publish_external_addresses(GrowableArray<address>& addresses) NOT_CDS_RETURN;
+  // publish all entries for a code blob in code cache address table
+  static void publish_stub_addresses(CodeBlob &code_blob, BlobId id, AOTStubData *stub_data) NOT_CDS_RETURN;
+
   static uint store_entries_cnt() {
     if (is_on_for_dump()) {
       return cache()->_store_entries_cnt;
@@ -462,9 +607,14 @@ private:
     return true;
   }
 public:
+  // marker used where an address offset needs to be stored for later
+  // retrieval and the address turns out to be null
+  static const uint NULL_ADDRESS_MARKER = UINT_MAX;
+
   static AOTCodeCache* cache() { assert(_passed_init2, "Too early to ask"); return _cache; }
   static void initialize() NOT_CDS_RETURN;
   static void init2() NOT_CDS_RETURN;
+  static void init3() NOT_CDS_RETURN;
   static void dump() NOT_CDS_RETURN;
   static bool is_on() CDS_ONLY({ return cache() != nullptr; }) NOT_CDS_RETURN_(false);
   static bool is_on_for_use()  CDS_ONLY({ return is_on() && _cache->for_use(); }) NOT_CDS_RETURN_(false);
@@ -485,7 +635,7 @@ public:
 // Concurent AOT code reader
 class AOTCodeReader {
 private:
-  const AOTCodeCache*  _cache;
+  AOTCodeCache*  _cache;
   const AOTCodeEntry*  _entry;
   const char*          _load_buffer; // Loaded cached code buffer
   uint  _read_position;              // Position in _load_buffer
@@ -502,13 +652,18 @@ private:
   // They should be set before calling it.
   const char*         _name;
   address             _reloc_data;
+  int                 _reloc_count;
   ImmutableOopMapSet* _oop_maps;
+  AOTCodeEntry::Kind  _entry_kind;
+  int                 _id;
+  AOTStubData*        _stub_data;
 
   AOTCodeEntry* aot_code_entry() { return (AOTCodeEntry*)_entry; }
 
   ImmutableOopMapSet* read_oop_map_set();
+  void read_stub_data(CodeBlob* code_blob, AOTStubData *stub_data);
 
-  void fix_relocations(CodeBlob* code_blob);
+  void fix_relocations(CodeBlob* code_blob, RelocIterator& iter);
 #ifndef PRODUCT
   void read_asm_remarks(AsmRemarks& asm_remarks);
   void read_dbg_strings(DbgStrings& dbg_strings);
@@ -517,7 +672,7 @@ private:
 public:
   AOTCodeReader(AOTCodeCache* cache, AOTCodeEntry* entry);
 
-  CodeBlob* compile_code_blob(const char* name);
+  CodeBlob* compile_code_blob(const char* name, AOTCodeEntry::Kind entry_kind, int id, AOTStubData* stub_data = nullptr);
 
   void restore(CodeBlob* code_blob);
 };
diff --git a/src/hotspot/share/gc/z/zBarrierSetAssembler.hpp b/src/hotspot/share/gc/z/zBarrierSetAssembler.hpp
index bcc757d6132..7b15813678a 100644
--- a/src/hotspot/share/gc/z/zBarrierSetAssembler.hpp
+++ b/src/hotspot/share/gc/z/zBarrierSetAssembler.hpp
@@ -34,6 +34,9 @@ public:
 
   static Address load_bad_mask_from_jni_env(Register env);
   static Address mark_bad_mask_from_jni_env(Register env);
+
+  virtual void register_reloc_addresses(GrowableArray<address> &entries, int begin, int count) { }
+  virtual void retrieve_reloc_addresses(address start, address end, GrowableArray<address> &entries) { }
 };
 
 // Needs to be included after definition of ZBarrierSetAssemblerBase
diff --git a/src/hotspot/share/opto/runtime.cpp b/src/hotspot/share/opto/runtime.cpp
index 0d2dbb813bd..c01e8578e43 100644
--- a/src/hotspot/share/opto/runtime.cpp
+++ b/src/hotspot/share/opto/runtime.cpp
@@ -24,6 +24,7 @@
 
 #include "classfile/vmClasses.hpp"
 #include "classfile/vmSymbols.hpp"
+#include "code/aotCodeCache.hpp"
 #include "code/codeCache.hpp"
 #include "code/compiledIC.hpp"
 #include "code/nmethod.hpp"
@@ -154,7 +155,8 @@ static bool check_compiled_frame(JavaThread* thread) {
 bool OptoRuntime::generate(ciEnv* env) {
 
   C2_STUBS_DO(GEN_C2_BLOB, GEN_C2_STUB)
-
+  // disallow any further c2 stub generation
+  AOTCodeCache::set_c2_stubs_complete();
   return true;
 }
 
diff --git a/src/hotspot/share/prims/downcallLinker.hpp b/src/hotspot/share/prims/downcallLinker.hpp
index 2c2cf053033..519e84281ce 100644
--- a/src/hotspot/share/prims/downcallLinker.hpp
+++ b/src/hotspot/share/prims/downcallLinker.hpp
@@ -72,7 +72,7 @@ public:
                   bool needs_return_buffer,
                   int captured_state_mask,
                   bool needs_transition)
-    : StubCodeGenerator(buffer, PrintMethodHandleStubs),
+      : StubCodeGenerator(buffer, PrintMethodHandleStubs),
       _signature(signature),
       _num_args(num_args),
       _ret_bt(ret_bt),
diff --git a/src/hotspot/share/runtime/init.cpp b/src/hotspot/share/runtime/init.cpp
index adc49f84358..d820968495e 100644
--- a/src/hotspot/share/runtime/init.cpp
+++ b/src/hotspot/share/runtime/init.cpp
@@ -70,6 +70,10 @@ void VM_Version_init();
 void icache_init2();
 void initialize_stub_info();    // must precede all blob/stub generation
 void preuniverse_stubs_init();
+
+#if INCLUDE_CDS
+void stubs_AOTAddressTable_init();
+#endif // INCLUDE_CDS
 void initial_stubs_init();
 
 jint universe_init();           // depends on codeCache_init and preuniverse_stubs_init
@@ -149,13 +153,19 @@ jint init_globals() {
   AOTCodeCache::init2();     // depends on universe_init, must be before initial_stubs_init
   AsyncLogWriter::initialize();
 
+#if INCLUDE_CDS
+  stubs_AOTAddressTable_init(); // publish external addresses used by stubs
+                                // depends on AOTCodeCache::init2
+#endif // INCLUDE_CDS
   initial_stubs_init();      // stubgen initial stub routines
   // stack overflow exception blob is referenced by the interpreter
-  AOTCodeCache::init_early_stubs_table();  // need this after stubgen initial stubs and before shared runtime initial stubs
   SharedRuntime::generate_initial_stubs();
   gc_barrier_stubs_init();   // depends on universe_init, must be before interpreter_init
   continuations_init();      // must precede continuation stub generation
-  continuation_stubs_init(); // depends on continuations_init
+  AOTCodeCache::init3();     // depends on stubs_AOTAddressTable_init
+                             // and continuations_init and must
+                             // precede continuation stub generation
+  continuation_stubs_init(); // depends on continuations_init and AOTCodeCache::init3
 #if INCLUDE_JFR
   SharedRuntime::generate_jfr_stubs();
 #endif
@@ -164,7 +174,6 @@ jint init_globals() {
   InterfaceSupport_init();
   VMRegImpl::set_regName();  // need this before generate_stubs (for printing oop maps).
   SharedRuntime::generate_stubs();
-  AOTCodeCache::init_shared_blobs_table();  // need this after generate_stubs
   SharedRuntime::init_adapter_library(); // do this after AOTCodeCache::init_shared_blobs_table
   return JNI_OK;
 }
diff --git a/src/hotspot/share/runtime/sharedRuntime.cpp b/src/hotspot/share/runtime/sharedRuntime.cpp
index 917ff5b4545..352c90f913b 100644
--- a/src/hotspot/share/runtime/sharedRuntime.cpp
+++ b/src/hotspot/share/runtime/sharedRuntime.cpp
@@ -177,6 +177,11 @@ void SharedRuntime::generate_stubs() {
                           CAST_FROM_FN_PTR(address, SafepointSynchronize::handle_polling_page_exception));
 
   generate_deopt_blob();
+
+#if INCLUDE_CDS
+  // disallow any further generation of runtime stubs
+  AOTCodeCache::set_shared_stubs_complete();
+#endif // INCLUDE_CDS
 }
 
 void SharedRuntime::init_adapter_library() {
diff --git a/src/hotspot/share/runtime/stubCodeGenerator.cpp b/src/hotspot/share/runtime/stubCodeGenerator.cpp
index 43250c004ca..45e40f4a754 100644
--- a/src/hotspot/share/runtime/stubCodeGenerator.cpp
+++ b/src/hotspot/share/runtime/stubCodeGenerator.cpp
@@ -23,6 +23,7 @@
  */
 
 #include "asm/macroAssembler.inline.hpp"
+#include "code/aotCodeCache.hpp"
 #include "code/codeCache.hpp"
 #include "compiler/disassembler.hpp"
 #include "oops/oop.inline.hpp"
@@ -30,7 +31,9 @@
 #include "prims/jvmtiExport.hpp"
 #include "runtime/stubCodeGenerator.hpp"
 #include "runtime/stubRoutines.hpp"
-
+#if INCLUDE_ZGC
+#include "gc/z/zBarrierSetAssembler.hpp"
+#endif // INCLUDE_ZGC
 
 // Implementation of StubCodeDesc
 
@@ -69,14 +72,16 @@ void StubCodeDesc::print() const { print_on(tty); }
 StubCodeGenerator::StubCodeGenerator(CodeBuffer* code, bool print_code) {
   _masm = new MacroAssembler(code);
   _blob_id = BlobId::NO_BLOBID;
+  _stub_data = nullptr;
   _print_code = PrintStubCode || print_code;
 }
 
-StubCodeGenerator::StubCodeGenerator(CodeBuffer* code, BlobId blob_id, bool print_code) {
+StubCodeGenerator::StubCodeGenerator(CodeBuffer* code, BlobId blob_id, AOTStubData* stub_data, bool print_code) {
   assert(StubInfo::is_stubgen(blob_id),
          "not a stubgen blob %s", StubInfo::name(blob_id));
   _masm = new MacroAssembler(code);
   _blob_id = blob_id;
+  _stub_data = stub_data;
   _print_code = PrintStubCode || print_code;
 }
 
@@ -91,11 +96,92 @@ StubCodeGenerator::~StubCodeGenerator() {
 #endif
 }
 
+void StubCodeGenerator::setup_code_desc(const char* name, address start, address end, bool loaded_from_cache) {
+  StubCodeDesc* cdesc = new StubCodeDesc("StubRoutines", name, start, end);
+  cdesc->set_disp(uint(start - _masm->code_section()->outer()->insts_begin()));
+  if (loaded_from_cache) {
+    cdesc->set_loaded_from_cache();
+  }
+  print_stub_code_desc(cdesc);
+  // copied from ~StubCodeMark()
+  Forte::register_stub(cdesc->name(), cdesc->begin(), cdesc->end());
+  if (JvmtiExport::should_post_dynamic_code_generated()) {
+    JvmtiExport::post_dynamic_code_generated(cdesc->name(), cdesc->begin(), cdesc->end());
+  }
+}
+
+// Helper used to restore ranges and handler addresses restored from
+// AOT cache. Expects entries to contain 3 * count addresses beginning
+// at offset begin which identify start of range, end of range and
+// address of handler pc. start and end of range may not be null.
+// handler pc may be null in which case it defaults to the
+// default_handler.
+
+void StubCodeGenerator::register_unsafe_access_handlers(GrowableArray<address> &entries, int begin, int count) {
+  for (int i = 0; i < count; i++) {
+    int offset = begin + 3 * i;
+    address start = entries.at(offset);
+    address end = entries.at(offset + 1);
+    address handler = entries.at(offset + 2);
+    assert(start != nullptr, "sanity");
+    assert(end != nullptr, "sanity");
+    if (handler == nullptr) {
+      assert(UnsafeMemoryAccess::common_exit_stub_pc() != nullptr,
+             "default unsafe handler must be set before registering unsafe rgeionwiht no handler!");
+      handler = UnsafeMemoryAccess::common_exit_stub_pc();
+    }
+    UnsafeMemoryAccess::add_to_table(start, end, handler);
+  }
+}
+
+// Helper used to retrieve ranges and handler addresses registered
+// during generation of the stub which spans [start, end) in order to
+// allow them to be saved to an AOT cache.
+void StubCodeGenerator::retrieve_unsafe_access_handlers(address start, address end, GrowableArray<address> &entries) {
+  UnsafeMemoryAccess::collect_entries(start, end, entries);
+}
+
+#if INCLUDE_ZGC
+// Helper used to restore ZGC pointer colouring relocation addresses
+// retrieved from the AOT cache.
+void StubCodeGenerator::register_reloc_addresses(GrowableArray<address> &entries, int begin, int count) {
+  LogTarget(Trace, aot, codecache, stubs) lt;
+  if (lt.is_enabled()) {
+    LogStream ls(lt);
+    for (int i = begin; i < count; i++) {
+      ls.print_cr("Registered reloc address " INTPTR_FORMAT, p2i(entries.at(i)));
+    }
+  }
+  ZBarrierSetAssembler *zbs = (ZBarrierSetAssembler*)BarrierSet::barrier_set()->barrier_set_assembler();
+  zbs->register_reloc_addresses(entries, begin, count);
+}
+
+// Helper used to retrieve ranges and handler addresses registered
+// during generation of the stub which spans [start, end) in order to
+// allow them to be saved to an AOT cache.
+void StubCodeGenerator::retrieve_reloc_addresses(address start, address end, GrowableArray<address> &entries) {
+  int l = entries.length();
+  ZBarrierSetAssembler *zbs = (ZBarrierSetAssembler*)BarrierSet::barrier_set()->barrier_set_assembler();
+  zbs->retrieve_reloc_addresses(start, end, entries);
+  LogTarget(Trace, aot, codecache, stubs) lt;
+  if (lt.is_enabled()) {
+    LogStream ls(lt);
+    for (int i = l; i < entries.length(); i++) {
+      ls.print_cr("retrieved reloc address " INTPTR_FORMAT, p2i(entries.at(i)));
+    }
+  }
+}
+#endif // INCLUDE_ZGC
+
 void StubCodeGenerator::stub_prolog(StubCodeDesc* cdesc) {
   // default implementation - do nothing
 }
 
 void StubCodeGenerator::stub_epilog(StubCodeDesc* cdesc) {
+  print_stub_code_desc(cdesc);
+}
+
+void StubCodeGenerator::print_stub_code_desc(StubCodeDesc* cdesc) {
   LogTarget(Debug, stubs) lt;
   if (lt.is_enabled()) {
     LogStream ls(lt);
@@ -119,6 +205,52 @@ void StubCodeGenerator::stub_epilog(StubCodeDesc* cdesc) {
   }
 }
 
+address StubCodeGenerator::load_archive_data(StubId stub_id, GrowableArray<address> *entries, GrowableArray<address>* extras) {
+  // punt to stub data if it exists and is not for dumping
+  if (_stub_data == nullptr || _stub_data->is_dumping()) {
+    return nullptr;
+  }
+  // punt to stub data
+  address start, end;
+  start = _stub_data->load_archive_data(stub_id, end, entries, extras);
+
+  if (start != nullptr) {
+    setup_code_desc(StubInfo::name(stub_id), start, end, true);
+  }
+
+  return start;
+}
+
+void StubCodeGenerator::store_archive_data(StubId stub_id, address start, address end, GrowableArray<address>* entries, GrowableArray<address>* extras) {
+  // punt to stub data if we have any
+  if (_stub_data != nullptr) {
+    _stub_data->store_archive_data(stub_id, start, end, entries, extras);
+  }
+}
+
+void StubCodeGenerator::print_statistics_on(outputStream* st) {
+  st->print_cr("StubRoutines Stubs:");
+  st->print_cr("  Initial stubs:         %d", StubInfo::stub_count(BlobId::stubgen_initial_id));
+  st->print_cr("  Continuation stubs:    %d", StubInfo::stub_count(BlobId::stubgen_continuation_id));
+  st->print_cr("  Compiler stubs:        %d", StubInfo::stub_count(BlobId::stubgen_compiler_id));
+  st->print_cr("  Final stubs:           %d", StubInfo::stub_count(BlobId::stubgen_final_id));
+
+  int emitted = 0;
+  int loaded_from_cache = 0;
+
+  StubCodeDesc* scd = StubCodeDesc::first();
+  while (scd != nullptr) {
+    if (!strcmp(scd->group(), "StubRoutines")) {
+      emitted += 1;
+      if (scd->loaded_from_cache()) {
+        loaded_from_cache += 1;
+      }
+    }
+    scd = StubCodeDesc::next(scd);
+  }
+  st->print_cr("Total stubroutines stubs emitted: %d (generated=%d, loaded from cache=%d)", emitted, emitted - loaded_from_cache, loaded_from_cache);
+}
+
 #ifdef ASSERT
 void StubCodeGenerator::verify_stub(StubId stub_id) {
   assert(StubRoutines::stub_to_blob(stub_id) == blob_id(), "wrong blob %s for generation of stub %s", StubRoutines::get_blob_name(blob_id()), StubRoutines::get_stub_name(stub_id));
diff --git a/src/hotspot/share/runtime/stubCodeGenerator.hpp b/src/hotspot/share/runtime/stubCodeGenerator.hpp
index 7d8944c85ea..958fa76543b 100644
--- a/src/hotspot/share/runtime/stubCodeGenerator.hpp
+++ b/src/hotspot/share/runtime/stubCodeGenerator.hpp
@@ -26,6 +26,7 @@
 #define SHARE_RUNTIME_STUBCODEGENERATOR_HPP
 
 #include "asm/assembler.hpp"
+#include "code/aotCodeCache.hpp"
 #include "memory/allocation.hpp"
 #include "runtime/stubInfo.hpp"
 
@@ -48,6 +49,7 @@ class StubCodeDesc: public CHeapObj<mtCode> {
   address              _begin;    // points to the first byte of the stub code    (included)
   address              _end;      // points to the first byte after the stub code (excluded)
   uint                 _disp;     // Displacement relative base address in buffer.
+  bool                 _loaded_from_cache;
 
   friend class StubCodeMark;
   friend class StubCodeGenerator;
@@ -65,6 +67,8 @@ class StubCodeDesc: public CHeapObj<mtCode> {
 
   void set_disp(uint disp) { _disp = disp; }
 
+  void set_loaded_from_cache() { _loaded_from_cache = true; }
+
  public:
   static StubCodeDesc* first() { return _list; }
   static StubCodeDesc* next(StubCodeDesc* desc)  { return desc->_next; }
@@ -81,6 +85,7 @@ class StubCodeDesc: public CHeapObj<mtCode> {
     _end            = end;
     _disp           = 0;
     _list           = this;
+    _loaded_from_cache = false;
   };
 
   static void freeze();
@@ -93,12 +98,11 @@ class StubCodeDesc: public CHeapObj<mtCode> {
   uint        disp() const                       { return _disp; }
   int         size_in_bytes() const              { return pointer_delta_as_int(_end, _begin); }
   bool        contains(address pc) const         { return _begin <= pc && pc < _end; }
+  bool        loaded_from_cache() const          { return _loaded_from_cache; }
   void        print_on(outputStream* st) const;
   void        print() const;
 };
 
-// forward declare blob and stub id enums
-
 // The base class for all stub-generating code generators.
 // Provides utility functions.
 
@@ -108,10 +112,20 @@ class StubCodeGenerator: public StackObj {
   BlobId _blob_id;
  protected:
   MacroAssembler*  _masm;
+  AOTStubData* _stub_data;
 
- public:
+  void setup_code_desc(const char* name, address start, address end, bool loaded_from_cache);
+  // unsafe handler management
+  void register_unsafe_access_handlers(GrowableArray<address> &entries, int begin, int count);
+  void retrieve_unsafe_access_handlers(address start, address end, GrowableArray<address> &entries);
+#if INCLUDE_ZGC
+  void register_reloc_addresses(GrowableArray<address> &entries, int begin, int count);
+  void retrieve_reloc_addresses(address start, address end, GrowableArray<address> &entries);
+#endif // INCLUDE_ZGC
+
+public:
   StubCodeGenerator(CodeBuffer* code, bool print_code = false);
-  StubCodeGenerator(CodeBuffer* code, BlobId blob_id, bool print_code = false);
+  StubCodeGenerator(CodeBuffer* code, BlobId blob_id, AOTStubData* stub_data = nullptr, bool print_code = false);
   ~StubCodeGenerator();
 
   MacroAssembler* assembler() const              { return _masm; }
@@ -120,9 +134,59 @@ class StubCodeGenerator: public StackObj {
   virtual void stub_prolog(StubCodeDesc* cdesc); // called by StubCodeMark constructor
   virtual void stub_epilog(StubCodeDesc* cdesc); // called by StubCodeMark destructor
 
+  void print_stub_code_desc(StubCodeDesc* cdesc);
+
+  static void print_statistics_on(outputStream* st);
+
+  // load_archive_data should be called before generating the stub
+  // identified by stub_id. If AOT caching of stubs is enabled and the
+  // stubis found then the address of the stub's first and, possibly,
+  // only entry is returned and the caller should use it instead of
+  // generating thestub. Otherwise a null address is returned and the
+  // caller should proceed to generate the stub.
+  //
+  // store_archive_data should be called when a stub has been
+  // successfully generated into the current blob irrespctive of
+  // whether the current JVM is generating or consuming an AOT archive
+  // (the caller should not check for either case). When generating an
+  // archive the stub entry and end addresses are recorded for storage
+  // along with the current blob and also to allow rences to the stub
+  // from other stubs or from compiled Java methods can be detected
+  // and marked as requiring relocation. When consuming an archive the
+  // stub entry address is still inorer to identify it as a relocation
+  // target. When no archive is in use the call has no side effects.
+  //
+  // start and end identify the inclusive start and exclusive end
+  // address for stub code and must lie in the current blob's code
+  // range. Stubs presented via this interface must declare at least
+  // one entry and start is always taken to be the first entry.
+  //
+  // Optional arrays entries and extras store other addresses of
+  // interest all of which must either lie in the interval (start,
+  // end) or be nullptr (verified by load and store methods).
+  //
+  // entries lists secondary entries for the stub each of which must
+  // match a corresponding entry declaration for the stub (entry count
+  // verified by load and store methods). Null entry addresses are
+  // allowed when an architecture does not require a specific entry
+  // but may not vary from one run to the next. If the cache is in use
+  // at a store (for loading or saving code) then non-null entry
+  // addresses are entered into the AOT cache stub address table
+  // allowing references to them from other stubs or nmethods to be
+  // relocated.
+  //
+  // extras lists other non-entry stub addresses of interest such as
+  // memory protection ranges and associated handler addresses
+  // (potentially including a null address). These do do not need to
+  // be declared as entries and their number and meaning may vary
+  // according to the architecture.
+
+  address load_archive_data(StubId stub_id, GrowableArray<address> *entries = nullptr, GrowableArray<address>* extras = nullptr);
+  void store_archive_data(StubId stub_id, address start, address end, GrowableArray<address> *entries = nullptr, GrowableArray<address>* extras = nullptr);
 #ifdef ASSERT
   void verify_stub(StubId stub_id);
 #endif
+
 };
 
 // Stack-allocated helper class used to associate a stub code with a name.
diff --git a/src/hotspot/share/runtime/stubDeclarations.hpp b/src/hotspot/share/runtime/stubDeclarations.hpp
index 7dc0f2d2bed..d1ce378ee20 100644
--- a/src/hotspot/share/runtime/stubDeclarations.hpp
+++ b/src/hotspot/share/runtime/stubDeclarations.hpp
@@ -952,9 +952,15 @@
   do_entry_init(final, arrayof_jlong_arraycopy,                         \
                 arrayof_jlong_arraycopy, arrayof_jlong_arraycopy,       \
                 StubRoutines::arrayof_jlong_copy)                       \
+  do_entry(final, arrayof_jlong_arraycopy,                             \
+            arrayof_jlong_arraycopy_nopush,                             \
+            arrayof_jlong_arraycopy_nopush)                             \
   do_stub(final, arrayof_oop_arraycopy)                                 \
   do_entry_init(final, arrayof_oop_arraycopy, arrayof_oop_arraycopy,    \
                 arrayof_oop_arraycopy, StubRoutines::arrayof_oop_copy)  \
+  do_entry(final, arrayof_oop_arraycopy,                                \
+           arrayof_oop_arraycopy_nopush,                                \
+           arrayof_oop_arraycopy_nopush)                                \
   do_stub(final, arrayof_oop_arraycopy_uninit)                          \
   do_entry_init(final, arrayof_oop_arraycopy_uninit,                    \
                 arrayof_oop_arraycopy_uninit,                           \
diff --git a/src/hotspot/share/runtime/stubInfo.cpp b/src/hotspot/share/runtime/stubInfo.cpp
index ee90631145a..c07c0298f2b 100644
--- a/src/hotspot/share/runtime/stubInfo.cpp
+++ b/src/hotspot/share/runtime/stubInfo.cpp
@@ -1087,6 +1087,15 @@ int StubInfo::stubgen_offset(StubId id) {
   return local_offset(StubGroup::STUBGEN, id);
 }
 
+int StubInfo::stubgen_offset_in_blob(BlobId blob_id, StubId id) {
+  assert(blob(id) == blob_id, "sanity!");
+  StubGroup group = StubGroup::STUBGEN;
+  assert(stubgroup(blob_id) == group, "sanity");
+  StubId base_id = stub_base(blob_id);
+  assert(base_id != StubId::NO_STUBID, "sanity");
+  return local_offset(group, id) - local_offset(group, base_id);
+}
+
 // initialization function called to populate blob. stub and entry
 // tables. this must be called before any stubs are generated
 void initialize_stub_info() {
diff --git a/src/hotspot/share/runtime/stubInfo.hpp b/src/hotspot/share/runtime/stubInfo.hpp
index 9ed6e0cb9f9..447f7d3a582 100644
--- a/src/hotspot/share/runtime/stubInfo.hpp
+++ b/src/hotspot/share/runtime/stubInfo.hpp
@@ -669,6 +669,11 @@ public:
   static int  c1_offset(StubId id);
   static int  c2_offset(StubId id);
   static int  stubgen_offset(StubId id);
+
+  // Convert a stub id to a unique, zero-based offset in the range of
+  // stub ids for a given blob in the stubgen stub group.
+
+  static int  stubgen_offset_in_blob(BlobId blob_id, StubId id);
 };
 
 
diff --git a/src/hotspot/share/runtime/stubRoutines.cpp b/src/hotspot/share/runtime/stubRoutines.cpp
index 56d832d3fef..0bc71c65471 100644
--- a/src/hotspot/share/runtime/stubRoutines.cpp
+++ b/src/hotspot/share/runtime/stubRoutines.cpp
@@ -102,8 +102,7 @@ BlobId StubRoutines::stub_to_blob(StubId id) {
 
 // Initialization
 
-extern void StubGenerator_generate(CodeBuffer* code, BlobId blob_id); // only interface to generators
-
+extern void StubGenerator_generate(CodeBuffer* code, BlobId blob_id, AOTStubData* stub_data); // only interface to generators
 void UnsafeMemoryAccess::create_table(int max_size) {
   UnsafeMemoryAccess::_table = new UnsafeMemoryAccess[max_size];
   UnsafeMemoryAccess::_table_max_length = max_size;
@@ -154,7 +153,8 @@ void UnsafeMemoryAccess::collect_entries(address range_start, address range_end,
       if (e._error_exit_pc != _common_exit_stub_pc) {
         entries.append(e._error_exit_pc);
       } else {
-        // an address outside the stub must be the common exit stub address
+        // an address outside the stub must be the common exit stub
+        // address which is marked with a null address
         entries.append(nullptr);
       }
     }
@@ -169,6 +169,33 @@ static BufferBlob* initialize_stubs(BlobId blob_id,
   assert(StubInfo::is_stubgen(blob_id), "not a stubgen blob %s", StubInfo::name(blob_id));
   ResourceMark rm;
   TraceTime timer(timer_msg, TRACETIME_LOG(Info, startuptime));
+  // If we are loading stubs we need to check if we can retrieve a
+  // blob and/or an associated archived stub descriptor from the
+  // AOTCodeCache. If we are storing stubs we need to create a blob
+  // but we still need a stub data descriptor to fill in during
+  // generation.
+  AOTStubData stub_data(blob_id);
+  AOTStubData* stub_data_p = nullptr;
+  LogTarget(Info, stubs) lt;
+
+  if (code_size > 0 && stub_data.is_using()) {
+    // AOTCodeEntry tracks and logs status of any cached blob
+    bool loaded = stub_data.load_code_blob();
+    if (loaded) {
+      if (lt.is_enabled()) {
+        LogStream ls(lt);
+        ls.print_cr("Found blob %s in AOT cache", StubInfo::name(blob_id));
+      }
+      stub_data_p = &stub_data;
+    }
+  } else if (stub_data.is_dumping()) {
+    stub_data_p = &stub_data;
+  }
+
+  // Even if we managed to load a blob from the AOT cache we still
+  // need to allocate a code blob and associated buffer. The AOT blob
+  // may not include all the stubs we need for this runtime.
+
   // Add extra space for large CodeEntryAlignment
   int size = code_size + CodeEntryAlignment * max_aligned_stubs;
   BufferBlob* stubs_code = BufferBlob::create(buffer_name, size);
@@ -178,6 +205,10 @@ static BufferBlob* initialize_stubs(BlobId blob_id,
     // In that case we can tolerate an allocation failure because the
     // compiler will have been shut down and we have no need of the
     // blob.
+    // TODO: Ideally we would still like to try to use any AOT cached
+    // blob here but we don't have a fallback if we find that it is
+    // missing stubs we need so for now we exit. This should only
+    // happen in cases where we have a very small code cache.
     if (Thread::current()->is_Compiler_thread()) {
       assert(blob_id == BlobId::stubgen_compiler_id, "sanity");
       assert(DelayCompilerStubsGeneration, "sanity");
@@ -187,10 +218,12 @@ static BufferBlob* initialize_stubs(BlobId blob_id,
     vm_exit_out_of_memory(code_size, OOM_MALLOC_ERROR, "CodeCache: no room for %s", buffer_name);
   }
   CodeBuffer buffer(stubs_code);
-  StubGenerator_generate(&buffer, blob_id);
+  short buffer_locs[20];
+  buffer.insts()->initialize_shared_locs((relocInfo*)buffer_locs,
+                                         sizeof(buffer_locs)/sizeof(relocInfo));
+  StubGenerator_generate(&buffer, blob_id, stub_data_p);
   if (code_size == 0) {
     assert(buffer.insts_size() == 0, "should not write into buffer when bob size declared as 0");
-    LogTarget(Info, stubs) lt;
     if (lt.is_enabled()) {
       LogStream ls(lt);
       ls.print_cr("%s\t not generated", buffer_name);
@@ -203,7 +236,35 @@ static BufferBlob* initialize_stubs(BlobId blob_id,
          "increase %s, code_size: %d, used: %d, free: %d",
          assert_msg, code_size, buffer.total_content_size(), buffer.insts_remaining());
 
-  LogTarget(Info, stubs) lt;
+  if (stub_data.is_using()) {
+    // we generated some new entries so republish all entries TODO -
+    // ensure we publish collect and publish the preuniverse stubs but
+    // don't try to save them
+    AOTCodeCache::publish_stub_addresses(*stubs_code, blob_id, &stub_data);
+    if (lt.is_enabled()) {
+      LogStream ls(lt);
+      ls.print_cr("Republished entries for blob '%s'", buffer_name);
+    }
+  } else if (stub_data.is_dumping()) {
+    // save the blob and publihs the entry addresses
+    if (stub_data.store_code_blob(*stubs_code, &buffer)) {
+      if (lt.is_enabled()) {
+        LogStream ls(lt);
+        ls.print_cr("Stored blob '%s' to Startup Code Cache", buffer_name);
+      }
+    } else {
+      if (lt.is_enabled()) {
+        LogStream ls(lt);
+        ls.print_cr("Failed to store blob '%s' to Startup Code Cache", buffer_name);
+      }
+    }
+  }
+
+  // close off recording of any further stubgen generation
+  if (blob_id == BlobId::stubgen_final_id) {
+    AOTCodeCache::set_stubgen_stubs_complete();
+  }
+
   if (lt.is_enabled()) {
     LogStream ls(lt);
     ls.print_cr("%s\t [" INTPTR_FORMAT ", " INTPTR_FORMAT "] used: %d, free: %d",
@@ -214,6 +275,8 @@ static BufferBlob* initialize_stubs(BlobId blob_id,
   return stubs_code;
 }
 
+// per blob initializer methods StubRoutines::initialize_xxx_stubs()
+
 #define DEFINE_BLOB_INIT_METHOD(blob_name)                              \
   void StubRoutines::initialize_ ## blob_name ## _stubs() {             \
     if (STUBGEN_BLOB_FIELD_NAME(blob_name) == nullptr) {                \
@@ -234,6 +297,7 @@ STUBGEN_BLOBS_DO(DEFINE_BLOB_INIT_METHOD)
 
 #undef DEFINE_BLOB_INIT_METHOD
 
+// external driver API functions for per blob init: xxx_stubs_init()
 
 #define DEFINE_BLOB_INIT_FUNCTION(blob_name)            \
   void blob_name ## _stubs_init()  {                    \
@@ -244,11 +308,18 @@ STUBGEN_BLOBS_DO(DEFINE_BLOB_INIT_FUNCTION)
 
 #undef DEFINE_BLOB_INIT_FUNCTION
 
+
+#if INCLUDE_CDS
+// non-generated external API init driver function
+
+void stubs_AOTAddressTable_init() { StubRoutines::init_AOTAddressTable(); }
+#endif // INCLUDE_CDS
+
 /*
- * we generate the underlying driver method but this wrapper is needed
- * to perform special handling depending on where the compiler init
- * gets called from. it ought to be possible to remove this at some
- * point and have a determinate ordered init.
+ * we generate the underlying driver function compiler_stubs_init()
+ * but this wrapper is needed to perform special handling depending on
+ * where the compiler init gets called from. it ought to be possible
+ * to remove this at some point and have a determinate ordered init.
  */
 
 void compiler_stubs_init(bool in_compiler_thread) {
diff --git a/src/hotspot/share/runtime/stubRoutines.hpp b/src/hotspot/share/runtime/stubRoutines.hpp
index 97e3e46b870..894bd47faab 100644
--- a/src/hotspot/share/runtime/stubRoutines.hpp
+++ b/src/hotspot/share/runtime/stubRoutines.hpp
@@ -112,6 +112,8 @@ class UnsafeMemoryAccess : public CHeapObj<mtCode> {
   address _end_pc;
   address _error_exit_pc;
  public:
+  // each table entry requires 3 addresses
+  static const int COLUMN_COUNT = 3;
   static address           _common_exit_stub_pc;
   static UnsafeMemoryAccess* _table;
   static int               _table_length;
@@ -130,6 +132,7 @@ class UnsafeMemoryAccess : public CHeapObj<mtCode> {
   static UnsafeMemoryAccess* add_to_table(address start_pc, address end_pc, address error_exit_pc) {
     guarantee(_table_length < _table_max_length, "Incorrect UnsafeMemoryAccess::_table_max_length");
     UnsafeMemoryAccess* entry = &_table[_table_length];
+    assert(start_pc != nullptr, "invalid start address");
     entry->set_start_pc(start_pc);
     entry->set_end_pc(end_pc);
     entry->set_error_exit_pc(error_exit_pc);
@@ -283,6 +286,11 @@ public:
   static BlobId stub_to_blob(StubId id);
 #endif
 
+#if INCLUDE_CDS
+  // AOT Initalization -- implementation is arch-specific
+  static void    init_AOTAddressTable();
+#endif // INCLUDE_CDS
+
   // Debugging
   static jint    verify_oop_count()                        { return _verify_oop_count; }
   static jint*   verify_oop_count_addr()                   { return &_verify_oop_count; }
diff --git a/test/hotspot/jtreg/runtime/cds/appcds/aotCode/AOTCodeFlags.java b/test/hotspot/jtreg/runtime/cds/appcds/aotCode/AOTCodeFlags.java
index 761c2c5382d..d3c6a23efa0 100644
--- a/test/hotspot/jtreg/runtime/cds/appcds/aotCode/AOTCodeFlags.java
+++ b/test/hotspot/jtreg/runtime/cds/appcds/aotCode/AOTCodeFlags.java
@@ -23,7 +23,8 @@
  */
 
 /**
- * @test
+ * @test id=default_gc
+ * @requires vm.gc != "Z"
  * @summary Sanity test of combinations of the AOT Code Caching diagnostic flags
  * @requires vm.cds.supports.aot.code.caching
  * @requires vm.compiler1.enabled & vm.compiler2.enabled
@@ -38,7 +39,64 @@
  *                 JavacBenchApp$ClassFile
  *                 JavacBenchApp$FileManager
  *                 JavacBenchApp$SourceFile
- * @run driver AOTCodeFlags
+ * @run driver/timeout=1500 AOTCodeFlags
+ */
+/**
+ * @test id=Z
+ * @requires vm.gc.Z
+ * @summary Sanity test of combinations of the AOT Code Caching diagnostic flags
+ * @requires vm.cds.supports.aot.code.caching
+ * @requires vm.compiler1.enabled & vm.compiler2.enabled
+ * @comment Both C1 and C2 JIT compilers are required because the test verifies
+ *          compiler's runtime blobs generation.
+ * @requires vm.opt.VerifyOops == null | vm.opt.VerifyOops == false
+ * @comment VerifyOops flag switch off AOT code generation. Skip it.
+ * @library /test/lib /test/setup_aot
+ * @build AOTCodeFlags JavacBenchApp
+ * @run driver jdk.test.lib.helpers.ClassFileInstaller -jar app.jar
+ *                 JavacBenchApp
+ *                 JavacBenchApp$ClassFile
+ *                 JavacBenchApp$FileManager
+ *                 JavacBenchApp$SourceFile
+ * @run driver/timeout=1500 AOTCodeFlags Z
+ */
+/**
+ * @test id=shenandoah
+ * @requires vm.gc.Shenandoah
+ * @summary Sanity test of combinations of the AOT Code Caching diagnostic flags
+ * @requires vm.cds.supports.aot.code.caching
+ * @requires vm.compiler1.enabled & vm.compiler2.enabled
+ * @comment Both C1 and C2 JIT compilers are required because the test verifies
+ *          compiler's runtime blobs generation.
+ * @requires vm.opt.VerifyOops == null | vm.opt.VerifyOops == false
+ * @comment VerifyOops flag switch off AOT code generation. Skip it.
+ * @library /test/lib /test/setup_aot
+ * @build AOTCodeFlags JavacBenchApp
+ * @run driver jdk.test.lib.helpers.ClassFileInstaller -jar app.jar
+ *                 JavacBenchApp
+ *                 JavacBenchApp$ClassFile
+ *                 JavacBenchApp$FileManager
+ *                 JavacBenchApp$SourceFile
+ * @run driver/timeout=1500 AOTCodeFlags Shenandoah
+ */
+/**
+ * @test id=parallel
+ * @requires vm.gc.Parallel
+ * @summary Sanity test of combinations of the AOT Code Caching diagnostic flags
+ * @requires vm.cds.supports.aot.code.caching
+ * @requires vm.compiler1.enabled & vm.compiler2.enabled
+ * @comment Both C1 and C2 JIT compilers are required because the test verifies
+ *          compiler's runtime blobs generation.
+ * @requires vm.opt.VerifyOops == null | vm.opt.VerifyOops == false
+ * @comment VerifyOops flag switch off AOT code generation. Skip it.
+ * @library /test/lib /test/setup_aot
+ * @build AOTCodeFlags JavacBenchApp
+ * @run driver jdk.test.lib.helpers.ClassFileInstaller -jar app.jar
+ *                 JavacBenchApp
+ *                 JavacBenchApp$ClassFile
+ *                 JavacBenchApp$FileManager
+ *                 JavacBenchApp$SourceFile
+ * @run driver/timeout=1500 AOTCodeFlags Parallel
  */
 
 import java.util.ArrayList;
@@ -48,20 +106,23 @@ import jdk.test.lib.cds.CDSAppTester;
 import jdk.test.lib.process.OutputAnalyzer;
 
 public class AOTCodeFlags {
+    private static String gcName = null;
     public static void main(String... args) throws Exception {
-        Tester t = new Tester();
+        Tester t = new Tester(args.length == 0 ? null : args[0]);
         // Run only 2 modes (0 - no AOT code, 1 - AOT adapters) until JDK-8357398 is fixed
-        for (int mode = 0; mode < 2; mode++) {
+        for (int mode = 0; mode < 4; mode++) {
             t.setTestMode(mode);
             t.run(new String[] {"AOT", "--two-step-training"});
         }
     }
     static class Tester extends CDSAppTester {
         private int testMode;
+        private String gcName;
 
-        public Tester() {
+        public Tester(String name) {
             super("AOTCodeFlags");
             testMode = 0;
+            gcName = name;
         }
 
         boolean isAdapterCachingOn() {
@@ -84,6 +145,24 @@ public class AOTCodeFlags {
             return list;
         }
 
+        public List<String> getGCArgs() {
+            List<String> args = new ArrayList<String>();
+            args.add("-Xmx100M");
+            if (gcName == null) {
+                return args;
+            }
+            switch (gcName) {
+            case "G1":
+            case "Z":
+            case "Shenandoah":
+            case "Parallel":
+                args.add("-XX:+Use" + gcName + "GC");
+            return args;
+            default:
+                throw new RuntimeException("Unexpected GC name " + gcName);
+            }
+        }
+
         @Override
         public String classpath(RunMode runMode) {
             return "app.jar";
@@ -97,10 +176,12 @@ public class AOTCodeFlags {
                     List<String> args = getVMArgsForTestMode();
                     args.addAll(List.of("-Xlog:aot+codecache+init=debug",
                                         "-Xlog:aot+codecache+exit=debug"));
+                    args.addAll(getGCArgs());
                     return args.toArray(new String[0]);
                 }
             }
-            return new String[] {};
+            List<String> args = getGCArgs();
+            return args.toArray(new String[args.size()]);
         }
 
         @Override
@@ -147,7 +228,10 @@ public class AOTCodeFlags {
                         // AOTStubCaching is on, non-zero stubs should be stored/loaded
                         out.shouldMatch("Shared Blobs:\\s+total=[1-9][0-9]+");
                         out.shouldMatch("C1 Blobs:\\s+total=[1-9][0-9]+");
-                        out.shouldMatch("C2 Blobs:\\s+total=[1-9][0-9]+");
+                        // we do not currently load or store C2 stubs
+                        // because we are seeing weird memory errors
+                        // when loading them -- see JDK-8357593
+                        out.shouldMatch("C2 Blobs:\\s+total=0");
                         break;
                     }
                 } else {

From 1e2aa616c9bfeaf09e3df7226e693d23d92d818a Mon Sep 17 00:00:00 2001
From: Evgeny Astigeevich <eastigeevich@openjdk.org>
Date: Wed, 8 Apr 2026 15:47:50 +0000
Subject: [PATCH 525/655] 8381770: Revert some shared changes done by
 JDK-8381003

Reviewed-by: kvn
---
 src/hotspot/share/code/nmethod.cpp   | 2 --
 src/hotspot/share/code/relocInfo.cpp | 9 +++++++++
 src/hotspot/share/code/relocInfo.hpp | 2 ++
 3 files changed, 11 insertions(+), 2 deletions(-)

diff --git a/src/hotspot/share/code/nmethod.cpp b/src/hotspot/share/code/nmethod.cpp
index de2c826667f..a302df418d7 100644
--- a/src/hotspot/share/code/nmethod.cpp
+++ b/src/hotspot/share/code/nmethod.cpp
@@ -1332,7 +1332,6 @@ nmethod::nmethod(
     code_buffer->copy_values_to(this);
 
     post_init();
-    ICache::invalidate_range(code_begin(), code_size());
   }
 
   if (PrintNativeNMethods || PrintDebugInfo || PrintRelocations || PrintDependencies) {
@@ -1812,7 +1811,6 @@ nmethod::nmethod(
     init_immutable_data_ref_count();
 
     post_init();
-    ICache::invalidate_range(code_begin(), code_size());
 
     // we use the information of entry points to find out if a method is
     // static or non static
diff --git a/src/hotspot/share/code/relocInfo.cpp b/src/hotspot/share/code/relocInfo.cpp
index 25d91edc20f..73e4b6de7b4 100644
--- a/src/hotspot/share/code/relocInfo.cpp
+++ b/src/hotspot/share/code/relocInfo.cpp
@@ -590,6 +590,15 @@ oop oop_Relocation::oop_value() {
   return *oop_addr();
 }
 
+void oop_Relocation::fix_oop_relocation() {
+  // TODO: we need to add some assert here that ICache::invalidate_range is called in the code
+  // which uses this function.
+  if (!oop_is_immediate()) {
+    // get the oop from the pool, and re-insert it into the instruction:
+    set_value(value());
+  }
+}
+
 void oop_Relocation::verify_oop_relocation() {
   if (!oop_is_immediate()) {
     // get the oop from the pool, and re-insert it into the instruction:
diff --git a/src/hotspot/share/code/relocInfo.hpp b/src/hotspot/share/code/relocInfo.hpp
index bb2b2b5693f..6f1778ef479 100644
--- a/src/hotspot/share/code/relocInfo.hpp
+++ b/src/hotspot/share/code/relocInfo.hpp
@@ -988,6 +988,8 @@ class oop_Relocation : public DataRelocation {
   void pack_data_to(CodeSection* dest) override;
   void unpack_data() override;
 
+  void fix_oop_relocation();        // reasserts oop value
+
   void verify_oop_relocation();
 
   address value() override { return *reinterpret_cast<address*>(oop_addr()); }

From 67f590d8ba580d5cebbd041a30fef85c13d21e3b Mon Sep 17 00:00:00 2001
From: Justin Lu <jlu@openjdk.org>
Date: Wed, 8 Apr 2026 16:08:02 +0000
Subject: [PATCH 526/655] 8381681: Clarify locale usage in Javadoc for the
 Locale display methods

Reviewed-by: naoto
---
 .../share/classes/java/util/Locale.java       | 59 ++++++++++---------
 1 file changed, 31 insertions(+), 28 deletions(-)

diff --git a/src/java.base/share/classes/java/util/Locale.java b/src/java.base/share/classes/java/util/Locale.java
index 682476d8082..6b071cd15b2 100644
--- a/src/java.base/share/classes/java/util/Locale.java
+++ b/src/java.base/share/classes/java/util/Locale.java
@@ -1932,7 +1932,7 @@ public final class Locale implements Cloneable, Serializable {
     }
 
     /**
-     * Returns a name for the locale's language that is appropriate for display to the
+     * Returns a name for {@code this} locale's language that is appropriate for display to the
      * user.
      * If possible, the name returned will be localized for the default
      * {@link Locale.Category#DISPLAY DISPLAY} locale.
@@ -1946,14 +1946,15 @@ public final class Locale implements Cloneable, Serializable {
      * this function falls back on the English name, and uses the ISO code as a last-resort
      * value.  If the locale doesn't specify a language, this function returns the empty string.
      *
-     * @return The name of the display language.
+     * @return The name of the display language appropriate to the default
+     *      {@link Locale.Category#DISPLAY DISPLAY} locale.
      */
-    public final String getDisplayLanguage() {
+    public String getDisplayLanguage() {
         return getDisplayLanguage(getDefault(Category.DISPLAY));
     }
 
     /**
-     * Returns a name for the locale's language that is appropriate for display to the
+     * Returns a name for {@code this} locale's language that is appropriate for display to the
      * user.
      * If possible, the name returned will be localized according to inLocale.
      * For example, if the locale is fr_FR and inLocale
@@ -1964,7 +1965,7 @@ public final class Locale implements Cloneable, Serializable {
      * on the ISO code as a last-resort value.  If the locale doesn't specify a language,
      * this function returns the empty string.
      *
-     * @param inLocale The locale for which to retrieve the display language.
+     * @param inLocale The locale in which to localize the display language.
      * @return The name of the display language appropriate to the given locale.
      * @throws    NullPointerException if {@code inLocale} is {@code null}
      */
@@ -1973,13 +1974,13 @@ public final class Locale implements Cloneable, Serializable {
     }
 
     /**
-     * Returns a name for the locale's script that is appropriate for display to
+     * Returns a name for {@code this} locale's script that is appropriate for display to
      * the user. If possible, the name will be localized for the default
      * {@link Locale.Category#DISPLAY DISPLAY} locale.  Returns
      * the empty string if this locale doesn't specify a script code.
      *
-     * @return the display name of the script code for the current default
-     *     {@link Locale.Category#DISPLAY DISPLAY} locale
+     * @return The display name of the script code appropriate to the default
+     *     {@link Locale.Category#DISPLAY DISPLAY} locale.
      * @since 1.7
      */
     public String getDisplayScript() {
@@ -1987,14 +1988,13 @@ public final class Locale implements Cloneable, Serializable {
     }
 
     /**
-     * Returns a name for the locale's script that is appropriate
+     * Returns a name for {@code this} locale's script that is appropriate
      * for display to the user. If possible, the name will be
      * localized for the given locale. Returns the empty string if
      * this locale doesn't specify a script code.
      *
-     * @param inLocale The locale for which to retrieve the display script.
-     * @return the display name of the script code for the current default
-     * {@link Locale.Category#DISPLAY DISPLAY} locale
+     * @param inLocale The locale in which to localize the display script.
+     * @return The display name of the script code appropriate to the given locale.
      * @throws NullPointerException if {@code inLocale} is {@code null}
      * @since 1.7
      */
@@ -2003,7 +2003,7 @@ public final class Locale implements Cloneable, Serializable {
     }
 
     /**
-     * Returns a name for the locale's country that is appropriate for display to the
+     * Returns a name for {@code this} locale's country that is appropriate for display to the
      * user.
      * If possible, the name returned will be localized for the default
      * {@link Locale.Category#DISPLAY DISPLAY} locale.
@@ -2017,14 +2017,15 @@ public final class Locale implements Cloneable, Serializable {
      * this function falls back on the English name, and uses the ISO code as a last-resort
      * value.  If the locale doesn't specify a country, this function returns the empty string.
      *
-     * @return The name of the country appropriate to the locale.
+     * @return The name of the country appropriate to the default
+     *      {@link Locale.Category#DISPLAY DISPLAY} locale.
      */
-    public final String getDisplayCountry() {
+    public String getDisplayCountry() {
         return getDisplayCountry(getDefault(Category.DISPLAY));
     }
 
     /**
-     * Returns a name for the locale's country that is appropriate for display to the
+     * Returns a name for {@code this} locale's country that is appropriate for display to the
      * user.
      * If possible, the name returned will be localized according to inLocale.
      * For example, if the locale is fr_FR and inLocale
@@ -2035,7 +2036,7 @@ public final class Locale implements Cloneable, Serializable {
      * on the ISO code as a last-resort value.  If the locale doesn't specify a country,
      * this function returns the empty string.
      *
-     * @param inLocale The locale for which to retrieve the display country.
+     * @param inLocale The locale in which to localize the display country.
      * @return The name of the country appropriate to the given locale.
      * @throws    NullPointerException if {@code inLocale} is {@code null}
      */
@@ -2061,23 +2062,24 @@ public final class Locale implements Cloneable, Serializable {
     }
 
     /**
-     * Returns a name for the locale's variant code that is appropriate for display to the
+     * Returns a name for {@code this} locale's variant code that is appropriate for display to the
      * user.  If possible, the name will be localized for the default
      * {@link Locale.Category#DISPLAY DISPLAY} locale.  If the locale
      * doesn't specify a variant code, this function returns the empty string.
      *
-     * @return The name of the display variant code appropriate to the locale.
+     * @return The name of the display variant code appropriate to the default
+     *      {@link Locale.Category#DISPLAY DISPLAY} locale.
      */
-    public final String getDisplayVariant() {
+    public String getDisplayVariant() {
         return getDisplayVariant(getDefault(Category.DISPLAY));
     }
 
     /**
-     * Returns a name for the locale's variant code that is appropriate for display to the
+     * Returns a name for {@code this} locale's variant code that is appropriate for display to the
      * user.  If possible, the name will be localized for inLocale.  If the locale
      * doesn't specify a variant code, this function returns the empty string.
      *
-     * @param inLocale The locale for which to retrieve the display variant code.
+     * @param inLocale The locale in which to localize the display variant code.
      * @return The name of the display variant code appropriate to the given locale.
      * @throws    NullPointerException if {@code inLocale} is {@code null}
      */
@@ -2098,7 +2100,7 @@ public final class Locale implements Cloneable, Serializable {
     }
 
     /**
-     * Returns a name for the locale that is appropriate for display to the
+     * Returns a name for {@code this} locale that is appropriate for display to the
      * user. This will be the values returned by getDisplayLanguage(),
      * getDisplayScript(), getDisplayCountry(), getDisplayVariant() and
      * optional {@linkplain ##def_locale_extension Unicode extensions}
@@ -2116,14 +2118,15 @@ public final class Locale implements Cloneable, Serializable {
      * be localized depending on the locale. If the language, script, country,
      * and variant fields are all empty, this function returns the empty string.
      *
-     * @return The name of the locale appropriate to display.
+     * @return The display name appropriate to the default
+     *      {@link Locale.Category#DISPLAY DISPLAY} locale.
      */
-    public final String getDisplayName() {
+    public String getDisplayName() {
         return getDisplayName(getDefault(Category.DISPLAY));
     }
 
     /**
-     * Returns a name for the locale that is appropriate for display
+     * Returns a name for {@code this} locale that is appropriate for display
      * to the user.  This will be the values returned by
      * getDisplayLanguage(), getDisplayScript(), getDisplayCountry(),
      * getDisplayVariant(), and optional {@linkplain ##def_locale_extension
@@ -2142,8 +2145,8 @@ public final class Locale implements Cloneable, Serializable {
      * be localized depending on the locale. If the language, script, country,
      * and variant fields are all empty, this function returns the empty string.
      *
-     * @param inLocale The locale for which to retrieve the display name.
-     * @return The name of the locale appropriate to display.
+     * @param inLocale The locale in which to localize the display name.
+     * @return The display name appropriate to the given locale.
      * @throws NullPointerException if {@code inLocale} is {@code null}
      */
     public String getDisplayName(Locale inLocale) {

From 13633c0825cc44e7a40b652b3c70334d1cfa621e Mon Sep 17 00:00:00 2001
From: Naoto Sato <naoto@openjdk.org>
Date: Wed, 8 Apr 2026 18:35:40 +0000
Subject: [PATCH 527/655] 8381379: Support std/dstOffset attributes in CLDR's
 metazone definitions

Reviewed-by: jlu
---
 .../tools/cldrconverter/CLDRConverter.java    | 12 +++++++
 .../cldrconverter/MetaZonesParseHandler.java  | 10 +++++-
 .../ResourceBundleGenerator.java              |  5 +--
 .../classes/java/text/SimpleDateFormat.java   | 27 ++++++++------
 .../time/format/DateTimeFormatterBuilder.java |  8 +++--
 .../util/locale/provider/LocaleResources.java |  9 +++--
 .../locale/provider/TimeZoneNameUtility.java  | 16 +++++++--
 .../util/resources/TimeZoneNamesBundle.java   |  4 +--
 .../resources/cldr/TimeZoneNamesTest.java     | 35 ++++++++++++++++++-
 9 files changed, 103 insertions(+), 23 deletions(-)

diff --git a/make/jdk/src/classes/build/tools/cldrconverter/CLDRConverter.java b/make/jdk/src/classes/build/tools/cldrconverter/CLDRConverter.java
index ab878a4d2a5..de496b3f606 100644
--- a/make/jdk/src/classes/build/tools/cldrconverter/CLDRConverter.java
+++ b/make/jdk/src/classes/build/tools/cldrconverter/CLDRConverter.java
@@ -87,6 +87,7 @@ public class CLDRConverter {
     static final String EXEMPLAR_CITY_PREFIX = "timezone.excity.";
     static final String ZONE_NAME_PREFIX = "timezone.displayname.";
     static final String METAZONE_ID_PREFIX = "metazone.id.";
+    static final String METAZONE_DSTOFFSET_PREFIX = "metazone.dstoffset.";
     static final String PARENT_LOCALE_PREFIX = "parentLocale.";
     static final String LIKELY_SCRIPT_PREFIX = "likelyScript.";
     static final String META_EMPTY_ZONE_NAME = "EMPTY_ZONE";
@@ -139,6 +140,11 @@ public class CLDRConverter {
     private static final Map<String, String> tzdbSubstLetters = HashMap.newHashMap(512);
     private static final Map<String, String> tzdbLinks = HashMap.newHashMap(512);
 
+    // Map of explicit dst offsets for metazones
+    // key: time zone ID
+    // value: explicit dstOffset for the corresponding metazone name
+    static final Map<String, String> explicitDstOffsets = HashMap.newHashMap(32);
+
     static enum DraftType {
         UNCONFIRMED,
         PROVISIONAL,
@@ -867,6 +873,12 @@ public class CLDRConverter {
             .collect(Collectors.toMap(Map.Entry::getKey, Map.Entry::getValue));
         names.putAll(exCities);
 
+        // Explicit metazone offsets
+        if (id.equals("root")) {
+            explicitDstOffsets.forEach((k, v) ->
+                names.put(METAZONE_DSTOFFSET_PREFIX + k, v));
+        }
+
         // If there's no UTC entry at this point, add an empty one
         if (!names.isEmpty() && !names.containsKey("UTC")) {
             names.putIfAbsent(METAZONE_ID_PREFIX + META_EMPTY_ZONE_NAME, EMPTY_ZONE);
diff --git a/make/jdk/src/classes/build/tools/cldrconverter/MetaZonesParseHandler.java b/make/jdk/src/classes/build/tools/cldrconverter/MetaZonesParseHandler.java
index 2c3757b7a47..45de46d2476 100644
--- a/make/jdk/src/classes/build/tools/cldrconverter/MetaZonesParseHandler.java
+++ b/make/jdk/src/classes/build/tools/cldrconverter/MetaZonesParseHandler.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2012, 2020, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2012, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -84,7 +84,15 @@ class MetaZonesParseHandler extends AbstractLDMLHandler<String> {
 
             if (fromLDT.isBefore(now) && toLDT.isAfter(now)) {
                 metazone = attributes.getValue("mzone");
+
+                // Explicit metazone DST offsets. Only the "dst" offset is needed,
+                // as "std" is used by default when it doesn't match.
+                String dstOffset = attributes.getValue("dstOffset");
+                if (dstOffset != null) {
+                    CLDRConverter.explicitDstOffsets.put(tzid, dstOffset);
+                }
             }
+
             pushIgnoredContainer(qName);
             break;
 
diff --git a/make/jdk/src/classes/build/tools/cldrconverter/ResourceBundleGenerator.java b/make/jdk/src/classes/build/tools/cldrconverter/ResourceBundleGenerator.java
index 3953f38f653..8278bf6bcfa 100644
--- a/make/jdk/src/classes/build/tools/cldrconverter/ResourceBundleGenerator.java
+++ b/make/jdk/src/classes/build/tools/cldrconverter/ResourceBundleGenerator.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2012, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2012, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -198,7 +198,8 @@ class ResourceBundleGenerator implements BundleGenerator {
                     } else if (value instanceof String) {
                         String valStr = (String)value;
                         if (type == BundleType.TIMEZONE &&
-                            !key.startsWith(CLDRConverter.EXEMPLAR_CITY_PREFIX) ||
+                            !(key.startsWith(CLDRConverter.EXEMPLAR_CITY_PREFIX) ||
+                              key.startsWith(CLDRConverter.METAZONE_DSTOFFSET_PREFIX)) ||
                             valStr.startsWith(META_VALUE_PREFIX)) {
                             out.printf("            { \"%s\", %s },\n", key, CLDRConverter.saveConvert(valStr, useJava));
                         } else {
diff --git a/src/java.base/share/classes/java/text/SimpleDateFormat.java b/src/java.base/share/classes/java/text/SimpleDateFormat.java
index ba73e5b5a86..4c57214dbba 100644
--- a/src/java.base/share/classes/java/text/SimpleDateFormat.java
+++ b/src/java.base/share/classes/java/text/SimpleDateFormat.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1996, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1996, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -41,7 +41,7 @@ package java.text;
 import java.io.IOException;
 import java.io.InvalidObjectException;
 import java.io.ObjectInputStream;
-import static java.text.DateFormatSymbols.*;
+import java.time.ZoneOffset;
 import java.util.Calendar;
 import java.util.Date;
 import java.util.GregorianCalendar;
@@ -57,6 +57,8 @@ import sun.util.calendar.ZoneInfoFile;
 import sun.util.locale.provider.LocaleProviderAdapter;
 import sun.util.locale.provider.TimeZoneNameUtility;
 
+import static java.text.DateFormatSymbols.*;
+
 /**
  * {@code SimpleDateFormat} is a concrete class for formatting and
  * parsing dates in a locale-sensitive manner. It allows for formatting
@@ -1293,15 +1295,22 @@ public class SimpleDateFormat extends DateFormat {
 
         case PATTERN_ZONE_NAME: // 'z'
             if (current == null) {
+                TimeZone tz = calendar.getTimeZone();
+                String tzid = tz.getID();
+                int zoneOffset = calendar.get(Calendar.ZONE_OFFSET);
+                int dstOffset = calendar.get(Calendar.DST_OFFSET) + zoneOffset;
+
+                // Check if an explicit metazone DST offset exists
+                String explicitDstOffset = TimeZoneNameUtility.explicitDstOffset(tzid);
+                boolean daylight = explicitDstOffset != null ?
+                    dstOffset == ZoneOffset.of(explicitDstOffset).getTotalSeconds() * 1_000 :
+                    dstOffset != zoneOffset;
                 if (formatData.locale == null || formatData.isZoneStringsSet) {
-                    int zoneIndex =
-                        formatData.getZoneIndex(calendar.getTimeZone().getID());
+                    int zoneIndex = formatData.getZoneIndex(tzid);
                     if (zoneIndex == -1) {
-                        value = calendar.get(Calendar.ZONE_OFFSET) +
-                            calendar.get(Calendar.DST_OFFSET);
-                        buffer.append(ZoneInfoFile.toCustomID(value));
+                        buffer.append(ZoneInfoFile.toCustomID(dstOffset));
                     } else {
-                        int index = (calendar.get(Calendar.DST_OFFSET) == 0) ? 1: 3;
+                        int index = daylight ? 3 : 1;
                         if (count < 4) {
                             // Use the short name
                             index++;
@@ -1310,8 +1319,6 @@ public class SimpleDateFormat extends DateFormat {
                         buffer.append(zoneStrings[zoneIndex][index]);
                     }
                 } else {
-                    TimeZone tz = calendar.getTimeZone();
-                    boolean daylight = (calendar.get(Calendar.DST_OFFSET) != 0);
                     int tzstyle = (count < 4 ? TimeZone.SHORT : TimeZone.LONG);
                     buffer.append(tz.getDisplayName(daylight, tzstyle, formatData.locale));
                 }
diff --git a/src/java.base/share/classes/java/time/format/DateTimeFormatterBuilder.java b/src/java.base/share/classes/java/time/format/DateTimeFormatterBuilder.java
index 4708094effb..4594dc6f1dc 100644
--- a/src/java.base/share/classes/java/time/format/DateTimeFormatterBuilder.java
+++ b/src/java.base/share/classes/java/time/format/DateTimeFormatterBuilder.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2012, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2012, 2026, Oracle and/or its affiliates. All rights reserved.
  * Copyright (c) 2025, Alibaba Group Holding Limited. All Rights Reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
@@ -4513,7 +4513,11 @@ public final class DateTimeFormatterBuilder {
                 TemporalAccessor dt = context.getTemporal();
                 int type = GENERIC;
                 if (!isGeneric) {
-                    if (dt.isSupported(ChronoField.INSTANT_SECONDS)) {
+                    // Check if an explicit metazone DST offset exists
+                    String dstOffset = TimeZoneNameUtility.explicitDstOffset(zname);
+                    if (dt.isSupported(OFFSET_SECONDS) && dstOffset != null) {
+                        type = ZoneOffset.from(dt).equals(ZoneOffset.of(dstOffset)) ? DST : STD;
+                    } else if (dt.isSupported(ChronoField.INSTANT_SECONDS)) {
                         type = zone.getRules().isDaylightSavings(Instant.from(dt)) ? DST : STD;
                     } else if (dt.isSupported(ChronoField.EPOCH_DAY) &&
                                dt.isSupported(ChronoField.NANO_OF_DAY)) {
diff --git a/src/java.base/share/classes/sun/util/locale/provider/LocaleResources.java b/src/java.base/share/classes/sun/util/locale/provider/LocaleResources.java
index ac43b22a3bd..76b383c03e1 100644
--- a/src/java.base/share/classes/sun/util/locale/provider/LocaleResources.java
+++ b/src/java.base/share/classes/sun/util/locale/provider/LocaleResources.java
@@ -105,6 +105,9 @@ public class LocaleResources {
     // TimeZoneNamesBundle exemplar city prefix
     private static final String TZNB_EXCITY_PREFIX = "timezone.excity.";
 
+    // TimeZoneNamesBundle explicit metazone dst offset prefix
+    private static final String TZNB_METAZONE_DSTOFFSET_PREFIX = "metazone.dstoffset.";
+
     // null singleton cache value
     private static final Object NULLOBJECT = new Object();
 
@@ -321,7 +324,8 @@ public class LocaleResources {
 
         if (Objects.isNull(data) || Objects.isNull(val = data.get())) {
             TimeZoneNamesBundle tznb = localeData.getTimeZoneNames(locale);
-            if (key.startsWith(TZNB_EXCITY_PREFIX)) {
+            if (key.startsWith(TZNB_EXCITY_PREFIX) ||
+                key.startsWith(TZNB_METAZONE_DSTOFFSET_PREFIX)) {
                 if (tznb.containsKey(key)) {
                     val = tznb.getString(key);
                     assert val instanceof String;
@@ -378,7 +382,8 @@ public class LocaleResources {
         Set<String[]> value = new LinkedHashSet<>();
         Set<String> tzIds = new HashSet<>(Arrays.asList(TimeZone.getAvailableIDs()));
         for (String key : keyset) {
-            if (!key.startsWith(TZNB_EXCITY_PREFIX)) {
+            if (!key.startsWith(TZNB_EXCITY_PREFIX) &&
+                !key.startsWith(TZNB_METAZONE_DSTOFFSET_PREFIX)) {
                 value.add(rb.getStringArray(key));
                 tzIds.remove(key);
             }
diff --git a/src/java.base/share/classes/sun/util/locale/provider/TimeZoneNameUtility.java b/src/java.base/share/classes/sun/util/locale/provider/TimeZoneNameUtility.java
index fd3d4965db3..6c684e176c8 100644
--- a/src/java.base/share/classes/sun/util/locale/provider/TimeZoneNameUtility.java
+++ b/src/java.base/share/classes/sun/util/locale/provider/TimeZoneNameUtility.java
@@ -37,7 +37,7 @@ import java.util.concurrent.ConcurrentHashMap;
 import java.util.spi.TimeZoneNameProvider;
 import sun.util.calendar.ZoneInfo;
 import sun.util.cldr.CLDRLocaleProviderAdapter;
-import static sun.util.locale.provider.LocaleProviderAdapter.Type;
+import static sun.util.locale.provider.LocaleProviderAdapter.Type.CLDR;
 
 /**
  * Utility class that deals with the localized time zone names
@@ -169,10 +169,22 @@ public final class TimeZoneNameUtility {
      * Returns the canonical ID for the given ID
      */
     public static Optional<String> canonicalTZID(String id) {
-        return ((CLDRLocaleProviderAdapter)LocaleProviderAdapter.forType(Type.CLDR))
+        return ((CLDRLocaleProviderAdapter)LocaleProviderAdapter.forType(CLDR))
                     .canonicalTZID(id);
     }
 
+    /**
+     * {@return the explicit metazone DST offset for the specified time zone ID, if exists}
+     * @param tzid the time zone ID
+     */
+    public static String explicitDstOffset(String tzid) {
+        return (String) (LocaleProviderAdapter.forType(CLDR) instanceof CLDRLocaleProviderAdapter ca ?
+            ca.getLocaleResources(Locale.ROOT)
+                .getTimeZoneNames("metazone.dstoffset." +
+                    ca.canonicalTZID(tzid).orElse(tzid)) :
+            null);
+    }
+
     private static String[] retrieveDisplayNamesImpl(String id, Locale locale) {
         LocaleServiceProviderPool pool =
             LocaleServiceProviderPool.getPool(TimeZoneNameProvider.class);
diff --git a/src/java.base/share/classes/sun/util/resources/TimeZoneNamesBundle.java b/src/java.base/share/classes/sun/util/resources/TimeZoneNamesBundle.java
index a30b84c6872..c5e95c8a404 100644
--- a/src/java.base/share/classes/sun/util/resources/TimeZoneNamesBundle.java
+++ b/src/java.base/share/classes/sun/util/resources/TimeZoneNamesBundle.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2005, 2022, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2005, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -43,8 +43,6 @@ package sun.util.resources;
 import java.util.Map;
 import java.util.LinkedHashMap;
 import java.util.LinkedHashSet;
-import java.util.MissingResourceException;
-import java.util.Objects;
 import java.util.Set;
 
 /**
diff --git a/test/jdk/sun/util/resources/cldr/TimeZoneNamesTest.java b/test/jdk/sun/util/resources/cldr/TimeZoneNamesTest.java
index 6d21cd5613a..4d9b7500d87 100644
--- a/test/jdk/sun/util/resources/cldr/TimeZoneNamesTest.java
+++ b/test/jdk/sun/util/resources/cldr/TimeZoneNamesTest.java
@@ -24,7 +24,7 @@
  /*
  * @test
  * @bug 8181157 8202537 8234347 8236548 8261279 8322647 8174269 8346948
- *      8354548
+ *      8354548 8381379
  * @modules jdk.localedata
  * @summary Checks CLDR time zone names are generated correctly at
  * either build or runtime
@@ -32,15 +32,21 @@
  */
 
 import java.text.DateFormatSymbols;
+import java.text.SimpleDateFormat;
 import java.time.ZoneId;
+import java.time.ZonedDateTime;
+import java.time.format.DateTimeFormatter;
 import java.time.format.TextStyle;
 import java.util.Arrays;
+import java.util.Date;
 import java.util.Locale;
 import java.util.Objects;
 import java.util.TimeZone;
+import java.util.stream.Stream;
 
 import org.junit.jupiter.api.Test;
 import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.Arguments;
 import org.junit.jupiter.params.provider.MethodSource;
 import static org.junit.jupiter.api.Assertions.assertEquals;
 import static org.junit.jupiter.api.Assertions.assertFalse;
@@ -217,6 +223,18 @@ public class TimeZoneNamesTest {
         };
     }
 
+    private static Stream<Arguments> explicitDstOffsets() {
+        return Stream.of(
+            Arguments.of(ZonedDateTime.of(2026, 4, 5, 0, 0, 0, 0, ZoneId.of("Europe/Dublin")), "Irish Standard Time"),
+            Arguments.of(ZonedDateTime.of(2026, 12, 5, 0, 0, 0, 0, ZoneId.of("Europe/Dublin")), "Greenwich Mean Time"),
+            Arguments.of(ZonedDateTime.of(2026, 4, 5, 0, 0, 0, 0, ZoneId.of("Eire")), "Irish Standard Time"),
+            Arguments.of(ZonedDateTime.of(2026, 12, 5, 0, 0, 0, 0, ZoneId.of("Eire")), "Greenwich Mean Time"),
+            Arguments.of(ZonedDateTime.of(2026, 4, 5, 0, 0, 0, 0, ZoneId.of("America/Vancouver")), "Pacific Daylight Time"),
+            // This needs to change once TZDB adopts -7 offset year round, and CLDR uses explicit dst offset
+            // namely, "Pacific Standard Time" -> "Pacific Daylight Time"
+            Arguments.of(ZonedDateTime.of(2026, 12, 5, 0, 0, 0, 0, ZoneId.of("America/Vancouver")), "Pacific Standard Time")
+        );
+    }
 
     @ParameterizedTest
     @MethodSource("sampleTZs")
@@ -248,4 +266,19 @@ public class TimeZoneNamesTest {
                 .anyMatch(name -> Objects.isNull(name) || name.isEmpty()),
             "getZoneStrings() returned array containing non-empty string element(s)");
     }
+
+    // Explicit metazone dst offset test. As of CLDR v48, only Europe/Dublin utilizes
+    // this attribute, but will be used for America/Vancouver once CLDR adopts the
+    // explicit offset for that zone, which warrants the test data modification.
+    @ParameterizedTest
+    @MethodSource("explicitDstOffsets")
+    public void test_ExplicitMetazoneOffsets(ZonedDateTime zdt, String expected) {
+        // java.time
+        assertEquals(expected, DateTimeFormatter.ofPattern("zzzz").format(zdt));
+
+        // java.text/util
+        var sdf = new SimpleDateFormat("zzzz");
+        sdf.setTimeZone(TimeZone.getTimeZone(zdt.getZone()));
+        assertEquals(expected, sdf.format(Date.from(zdt.toInstant())));
+    }
 }

From 67a71249a17b3fb9f9263df239fc25b0df22757c Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Eirik=20Bj=C3=B8rsn=C3=B8s?= <eirbjo@openjdk.org>
Date: Wed, 8 Apr 2026 19:06:40 +0000
Subject: [PATCH 528/655] 8381772: Remove mention of "mutable strings" in
 java.lang.String Javadocs

Reviewed-by: alanb, liach
---
 src/java.base/share/classes/java/lang/String.java | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/src/java.base/share/classes/java/lang/String.java b/src/java.base/share/classes/java/lang/String.java
index c6c08ed4473..760f3ebc255 100644
--- a/src/java.base/share/classes/java/lang/String.java
+++ b/src/java.base/share/classes/java/lang/String.java
@@ -70,9 +70,9 @@ import sun.nio.cs.UTF_8;
  * string literals in Java programs, such as {@code "abc"}, are
  * implemented as instances of this class.
  * <p>
- * Strings are constant; their values cannot be changed after they
- * are created. String buffers support mutable strings.
- * Because String objects are immutable they can be shared. For example:
+ * Strings are immutable; their values cannot be changed after they
+ * are created. Because String objects are immutable they can be shared.
+ * For example:
  * <blockquote><pre>
  *     String str = "abc";
  * </pre></blockquote><p>

From d3afc857698c3c79d1eca48d5b47061f4b472081 Mon Sep 17 00:00:00 2001
From: Dean Long <dlong@openjdk.org>
Date: Wed, 8 Apr 2026 20:04:20 +0000
Subject: [PATCH 529/655] 8381662: New test
 compiler/exceptions/TestDebugDuringExceptionCatching.java failing with
 C1-only

Reviewed-by: kvn, mhaessig
---
 .../exceptions/TestDebugDuringExceptionCatching.java         | 5 +++--
 1 file changed, 3 insertions(+), 2 deletions(-)

diff --git a/test/hotspot/jtreg/compiler/exceptions/TestDebugDuringExceptionCatching.java b/test/hotspot/jtreg/compiler/exceptions/TestDebugDuringExceptionCatching.java
index 999c73fb73a..9be192d1f55 100644
--- a/test/hotspot/jtreg/compiler/exceptions/TestDebugDuringExceptionCatching.java
+++ b/test/hotspot/jtreg/compiler/exceptions/TestDebugDuringExceptionCatching.java
@@ -22,6 +22,7 @@
  */
 package compiler.exceptions;
 
+import compiler.lib.ir_framework.CompLevel;
 import compiler.lib.ir_framework.Run;
 import compiler.lib.ir_framework.Test;
 import compiler.lib.ir_framework.TestFramework;
@@ -38,7 +39,7 @@ import test.java.lang.invoke.lib.InstructionHelper;
 /**
  * @test
  * @bug 8350208
- * @summary Safepoints added during the processing of exception handlers should never reexecute
+ * @summary Safepoints added during the processing of exception handlers need correct stack state
  * @library /test/lib /test/jdk/java/lang/invoke/common /
  * @build test.java.lang.invoke.lib.InstructionHelper
  *
@@ -110,7 +111,7 @@ public class TestDebugDuringExceptionCatching {
                 });
     }
 
-    @Test
+    @Test(compLevel = CompLevel.C2) // see JDK-8381786
     private static int testBackwardHandler(V v) throws Throwable {
         return (int) SNIPPET_HANDLE.invokeExact(v);
     }

From dc8163052ce6350e419641467a37089697e49aa6 Mon Sep 17 00:00:00 2001
From: Srinivas Vamsi Parasa <sparasa@openjdk.org>
Date: Wed, 8 Apr 2026 20:52:28 +0000
Subject: [PATCH 530/655] 8381865: Fix debug build failure caused by not
 clearing CPU_APX_F feature after JDK-8364584

Reviewed-by: sviswanathan, kvn, asmehra
---
 src/hotspot/cpu/x86/vm_version_x86.cpp | 1 +
 1 file changed, 1 insertion(+)

diff --git a/src/hotspot/cpu/x86/vm_version_x86.cpp b/src/hotspot/cpu/x86/vm_version_x86.cpp
index 7899a2f7e51..d8f998520d1 100644
--- a/src/hotspot/cpu/x86/vm_version_x86.cpp
+++ b/src/hotspot/cpu/x86/vm_version_x86.cpp
@@ -1098,6 +1098,7 @@ void VM_Version::get_processor_features() {
   if (supports_apx_f() && os_supports_apx_egprs() && supports_avx512vl()) {
     if (FLAG_IS_DEFAULT(UseAPX)) {
       UseAPX = false; // by default UseAPX is false
+      _features.clear_feature(CPU_APX_F);
     } else if (!UseAPX) {
       _features.clear_feature(CPU_APX_F);
     }

From 78580f1e4ea86eda0f8f737fa679f0b730075d54 Mon Sep 17 00:00:00 2001
From: Jaikiran Pai <jpai@openjdk.org>
Date: Thu, 9 Apr 2026 04:56:30 +0000
Subject: [PATCH 531/655] 8378291: Test vector in
 test/jdk/java/util/jar/JarEntry/GetMethodsReturnClones.java is effectively
 unsigned

Reviewed-by: eirbjo, lancea
---
 .../jar/JarEntry/GetMethodsReturnClones.java  | 151 ++++++++++++++----
 test/jdk/java/util/jar/JarEntry/test.jar      | Bin 3022 -> 0 bytes
 2 files changed, 121 insertions(+), 30 deletions(-)
 delete mode 100644 test/jdk/java/util/jar/JarEntry/test.jar

diff --git a/test/jdk/java/util/jar/JarEntry/GetMethodsReturnClones.java b/test/jdk/java/util/jar/JarEntry/GetMethodsReturnClones.java
index a9b35220de3..d2ab41cb831 100644
--- a/test/jdk/java/util/jar/JarEntry/GetMethodsReturnClones.java
+++ b/test/jdk/java/util/jar/JarEntry/GetMethodsReturnClones.java
@@ -21,72 +21,163 @@
  * questions.
  */
 
+import java.io.IOException;
+import java.io.InputStream;
+import java.io.OutputStream;
+import java.nio.file.Files;
+import java.nio.file.Path;
+import java.security.CodeSigner;
+import java.security.KeyStore;
+import java.security.cert.Certificate;
+import java.util.ArrayList;
+import java.util.Arrays;
+import java.util.Enumeration;
+import java.util.List;
+import java.util.concurrent.TimeUnit;
+import java.util.jar.JarEntry;
+import java.util.jar.JarFile;
+import java.util.jar.JarOutputStream;
+import java.util.zip.ZipFile;
+
+import jdk.security.jarsigner.JarSigner;
+import org.junit.jupiter.api.BeforeAll;
+import org.junit.jupiter.api.Test;
+import sun.security.tools.keytool.CertAndKeyGen;
+import sun.security.x509.X500Name;
+import static java.nio.charset.StandardCharsets.US_ASCII;
+import static org.junit.jupiter.api.Assertions.assertNotNull;
+import static org.junit.jupiter.api.Assertions.assertNull;
+
 /*
  * @test
  * @bug 6337925
  * @summary Ensure that callers cannot modify the internal JarEntry cert and
  *          codesigner arrays.
+ * @modules java.base/sun.security.tools.keytool
+ *          java.base/sun.security.x509
  * @run junit GetMethodsReturnClones
  */
-import org.junit.jupiter.api.BeforeAll;
-import org.junit.jupiter.api.Test;
+class GetMethodsReturnClones {
 
-import java.io.IOException;
-import java.io.InputStream;
-import java.security.CodeSigner;
-import java.security.cert.Certificate;
-import java.util.*;
-import java.util.jar.*;
 
-import static org.junit.jupiter.api.Assertions.assertNotNull;
+    private static final String ENTRY_NAME = "foobar.txt";
+    private static final String SIGNER_NAME = "DUMMY";
+    private static final String DIGEST_ALGORITHM = "SHA-256";
+    private static final String SIGNATURE_ALGORITHM = "SHA256withRSA";
+    private static final String KEY_TYPE = "RSA";
 
-public class GetMethodsReturnClones {
-
-    private static final String BASE = System.getProperty("test.src", ".") +
-        System.getProperty("file.separator");
     private static List<JarEntry> jarEntries;
 
+    /*
+     * Creates a signed JAR file and initializes the "jarEntries"
+     */
     @BeforeAll()
-    static void setupEntries() throws IOException {
+    static void setupJarEntries() throws Exception {
+        Path unsigned = createJar();
+        Path signed = signJar(unsigned);
+        System.err.println("created signed JAR file at " + signed.toAbsolutePath());
         List<JarEntry> entries = new ArrayList<>();
-        try (JarFile jf = new JarFile(BASE + "test.jar", true)) {
-            byte[] buffer = new byte[8192];
+        try (JarFile jf = new JarFile(signed.toFile(), true)) {
             Enumeration<JarEntry> e = jf.entries();
             while (e.hasMoreElements()) {
                 JarEntry je = e.nextElement();
                 entries.add(je);
                 try (InputStream is = jf.getInputStream(je)) {
-                    while (is.read(buffer, 0, buffer.length) != -1) {
-                        // we just read. this will throw a SecurityException
-                        // if  a signature/digest check fails.
-                    }
+                    // we just read. this will throw a SecurityException
+                    // if a signature/digest check fails.
+                    var _ = is.readAllBytes();
                 }
             }
         }
         jarEntries = entries;
     }
 
+    /*
+     * For entries in the signed JAR file, this test verifies that if a non-null
+     * array is returned by the JarEntry.getCertificates() method, then any subsequent
+     * updates to that returned array do not propagate back to the original array.
+     */
     @Test
-    void certsTest() {
+    void testCertificatesArray() {
         for (JarEntry je : jarEntries) {
             Certificate[] certs = je.getCertificates();
-            if (certs != null) {
-                certs[0] = null;
-                certs = je.getCertificates();
-                assertNotNull(certs[0], "Modified internal certs array");
+            System.err.println("Certificates for " + je.getName() + " " + Arrays.toString(certs));
+            if (isSignatureRelated(je)) {
+                // we don't expect this entry to be signed
+                assertNull(certs, "JarEntry.getCertificates() returned non-null for " + je.getName());
+                continue;
             }
+            assertNotNull(certs, "JarEntry.getCertificates() returned null for " + je.getName());
+            assertNotNull(certs[0], "Certificate is null");
+
+            certs[0] = null; // intentionally update the returned array
+            certs = je.getCertificates(); // now get the certs again
+            assertNotNull(certs, "JarEntry.getCertificates() returned null for " + je.getName());
+            // verify that the newly returned array doesn't have the overwritten value
+            assertNotNull(certs[0], "Internal certificates array was modified");
         }
     }
 
+    /*
+     * For entries in the signed JAR file, this test verifies that if a non-null
+     * array is returned by the JarEntry.getCodeSigners() method, then any subsequent
+     * updates to that returned array do not propagate back to the original array.
+     */
     @Test
-    void signersTest() {
+    void testCodeSignersArray() {
         for (JarEntry je : jarEntries) {
             CodeSigner[] signers = je.getCodeSigners();
-            if (signers != null) {
-                signers[0] = null;
-                signers = je.getCodeSigners();
-                assertNotNull(signers[0], "Modified internal codesigners array");
+            System.err.println("CodeSigners for " + je.getName() + " " + Arrays.toString(signers));
+            if (isSignatureRelated(je)) {
+                // we don't expect this entry to be signed
+                assertNull(signers, "JarEntry.getCodeSigners() returned non-null for " + je.getName());
+                continue;
             }
+            assertNotNull(signers, "JarEntry.getCodeSigners() returned null for " + je.getName());
+            assertNotNull(signers[0], "CodeSigner is null");
+
+            signers[0] = null; // intentionally update the array
+            signers = je.getCodeSigners(); // now get the codesigners again
+            assertNotNull(signers, "JarEntry.getCodeSigners() returned null for " + je.getName());
+            // verify that the newly returned array doesn't have the overwritten value
+            assertNotNull(signers[0], "CodeSigner is null");
         }
     }
+
+    private static Path createJar() throws IOException {
+        final Path unsigned = Path.of("unsigned.jar");
+        try (JarOutputStream out = new JarOutputStream(Files.newOutputStream(unsigned))) {
+            out.putNextEntry(new JarEntry(ENTRY_NAME));
+            out.write("hello world".getBytes(US_ASCII));
+        }
+        return unsigned;
+    }
+
+    private static Path signJar(final Path unsigned) throws Exception {
+        final Path signed = Path.of("signed.jar");
+        final JarSigner signer = new JarSigner.Builder(privateKeyEntry())
+                .signerName(SIGNER_NAME)
+                .digestAlgorithm(DIGEST_ALGORITHM)
+                .signatureAlgorithm(SIGNATURE_ALGORITHM)
+                .build();
+        try (ZipFile zip = new ZipFile(unsigned.toFile());
+             OutputStream out = Files.newOutputStream(signed)) {
+            signer.sign(zip, out);
+        }
+        return signed;
+    }
+
+    private static KeyStore.PrivateKeyEntry privateKeyEntry() throws Exception {
+        final CertAndKeyGen gen = new CertAndKeyGen(KEY_TYPE, SIGNATURE_ALGORITHM);
+        gen.generate(4096);
+        final long oneDayInSecs = TimeUnit.SECONDS.convert(1, TimeUnit.DAYS);
+        Certificate cert = gen.getSelfCertificate(new X500Name("cn=duke"), oneDayInSecs);
+        return new KeyStore.PrivateKeyEntry(gen.getPrivateKey(), new Certificate[] {cert});
+    }
+
+    private static boolean isSignatureRelated(final JarEntry entry) {
+        final String entryName = entry.getName();
+        return entryName.equals("META-INF/" + SIGNER_NAME + ".SF")
+                || entryName.equals("META-INF/" + SIGNER_NAME + ".RSA");
+    }
 }
diff --git a/test/jdk/java/util/jar/JarEntry/test.jar b/test/jdk/java/util/jar/JarEntry/test.jar
deleted file mode 100644
index fb9e4c1734966f2a72279b65426359002e48c81a..0000000000000000000000000000000000000000
GIT binary patch
literal 0
HcmV?d00001

literal 3022
zcmaKuXH-+!0)<2Gf&!s~g5c1J2!e<ZI)q+_BE5I%H4!CXNa%=w5{h(1ibzomNGL(7
zfE0-nDFQ)|DqVbG*38JvoA>rvcdc{Rx%=F+?~m_pV+aK$8-SKHMv`=70H?%8nj2`E
zgC%thwWJNehPqmsX68}`TI~IG^c^xRfMMk{7_LJ7PBpD*U<I(+k?*NRh|;X6)wFrg
zSt4QjSwIApLX;p)EO=<FMMKkFq^nzqGG-}MMa|b)PPEOC-8HsHna0<8HDAt5v_wG-
ziFg@B-&{&Pr0(HM(Qld+$xTGrQwWRQY_E(AXQ|p({(*;btt{td(^N#r-GCWGXlTDh
z??xn$PKhF2#{V-1%jq2ECmGDNEKo)acVu`~*E%rR6wUt2;*cdrt;wPa388>dXiBfV
zlWjHuqtfJ`O0!n_NYq<^TZj6?x)yvgSR03sGiC^{U&c7kM#YOW*qFpc6V+$<q(fb<
zxq!J_ElQ`g4f8bkt%Iq%Gx#i84^;0l%lK!Y_`2D74!puxBbAldkJZjdLFUhU7zxMk
zRkgsGI0BC~{6#B3Ff0pmfpq@R!xz`X{N9b1+d3jEQ00g1M>hga(x$R=H`bD}y#2pv
z&;D0hQ!}uvr?afb+?e;4=iy)<Zm^*cVSpuFa76mMw4vLH$rOUv&bMzJ+mnrZnhO!1
z>%gpL4Pe%}bgF)Rl)k=1Sa0|^*Luf$nR>trSI!`wz<N+(eJ!0VoEodZ+o3<0k|0Q}
zcK*yOneaeod)?wY!G_Kz#TQb^ICQcgIf@EnL&n3m1v=+|3+s9k5XM0xaS)pv3pE{x
zVJl+cehKh%S(&Ryb_q8QvBk}Kw=g}uGQAGWmgYk~&kb&&)*TC{QyFe@d{7I&2rMnn
z=Daefy`v%|P7&-PeHZL<$;?FvTjZdEjg%`Ph>GGra;_}2gnsWpN}^K-<s-*qCx}eY
z+9*q^A3su8A0<Q)rLj-_ui1a=ds>g-ABemkK7d!RL5U2=9A>rU?dv=$7BV7wL#$Ih
zp14O>*s)6z+@^o4G+UQ_>YHf4JrOgo%mg&Gxy)n!4CzVbGcE9Gxus<4gF~I?aruCL
zKZ+5B6lUyX)R<IY{cxRg8md6{5w}+Whvy=|0Lj^$I4OTdG|OCeo9^sFt~H0P?U&3+
z{_+(E?sHp_o5+vk{m)=8ITT!buLTWUVcv=cB^tSJhA=0G8sHgIW2zph6sWYjh>1Ua
z2)pu`!75`{KC=pPbeJiR@kGDet1Wg~Z?Y>*@_CN`c;u^C|2cNj@<<_Mcl(21jhf<@
z5j}Hq*!$;^lCONvv(V_<GquluJD1*S`S?<e^Rjl;ojBf$rd>$WQKTsnDZ8~50x?BG
zLXewVkdS;n6SKT@MLj)=AY#tKMrjih!*NVOoxUp8_S$N1XF=1N5o^7!A}bFxVB$`w
z(;E&c`w0TCM|w*vboTo|q9RPJO)r`d^KENEdo77SLL7kzJ<5a~&OFLk5uPrDL-=EV
z$!WIh4oH1NXOgS5xO0n7)}9w?Drd4beyiq-Gok=*Y4|#{7NJrdG3!>H;zbo85>91x
zAhxSE@-QV1IKJIYdxpl^iKPI0n@I-*y6mWXH^u0RI?_#LTWZ)!bY&mQf1Y;@JJ6zp
zGr#H#*<Ro<Z0akuiW)j=_ue}#B)B`s_K@Z`6XcEM8VNK9FKm9a={xG$&HlyD1PR^T
zW~J@A<M+Y|<8ItgV7Q<Me`+9RVYj2}XtxyD`(Wa0F6Kit@!8uA39Sc{+6M_nVa@)2
zx1!wf*@8zswFr}QIn<hQT}5EB@6JG*oMK>Gg~`CkWExJSFAOx<yD+zdnW7FJS2>c#
zSZ%`ER=X%X%G|6<`d?V>JY1=Y*(;iq8+S-d(fyj+wpI|hb%@@S<}-2_R1&dou*I1>
zFOoe_5n$Ho)A2AEnFPT$U$p7J;Mld`!#oMy$|sI7@1`b6MV6Y_zw;lO>A*KM1rO{K
zIDp|-@qIh?pSCrZg-F<>q0LT^aNwo{0F<atV|39IBuQe)U!nt0{`?&rlORO#yZL0D
z{EvrzGC1oWW>(S@RzY4NZdzWxZsu;mAyO{BPQk&+7Jg<t7Hm){x|Mo~G~Y;3X*GJu
zcvV($i=M{2jb4?Nt=4Hen)#5ROkabraQRoI3XkUq>zPoW!#B+RIwR@tpu5_N=vQ>0
z1|llAS227I{b2F>;{5y??0Apif*t(vY*EsX#iSU<)Wq1t{FZGO1^X8<eo+?s5&Ey<
zwQMovpM0p;sg&p&*;d5%G{Cx80I>Ae@!>?~D~uPOIdN9nb4D0pX`l6u9*)f4^vW1!
z>9UAyy4ZE672<tQ2XxPe`{341ZLY&>o4BRDb7d(*wN-Nr_~DJSnEL_54XLlV(FC@u
zp}dZ^J$ctxoiuwy{E5wpyx329UI?bPp!0Y>s4<Z7yVrD86n---a;n@za%~gqHzZdr
zc(-mRM`fn+a#K=e_eX<-nZ1Wi46hg|l6^)EtMlBz2_IgUE6zlS2uC2T5>SnPgaJBY
z2aA`iVpUXeM`2lOQl{9XJl3w9C7;D!fg)qd7wotsP9M<sf^Q~Dn^75mEB?L*ZI|#K
z?u!$rRvvM$=)udipmNuRDsa(Uwc1)xYQO<{E_(iA1U!hx%ip?@Ln*|-sFU8@5>@od
zc;|_*n0&LrgJuY7DeM#1lPG9Wy9_V@uFPTT?z#;vW-7w%vn^FrH^<?VV`uxOE;W+Z
zCkPy5dsu3$khOH7X`A%IDB;S*Xb)jV-Tjn`s7}q#6>ombbKOy*)NK|dq{LtFwGqjE
zf{yJ@ceaV#2+91!<!9FugqP071w~8`eU8T=WBMD&^>9d4R9opdN@Coz_N#*1OsPLj
zl4<$sbu!*n8S-3xmxC2v>9wGVtYCxfFeQ8g?m3~Mao+1@gz&?I*V}Dn6=1+O*{mkf
zNu9-AjoUX3Y+BWZvm|ag31n<^?GWBXQYX&x(Tpohq?I%j?t3z;8@v>ra&Wqb0p0f#
zbtu5O=ePy~R9ie>1Dp;<&cq!JN6}uX&QTrRInO0HEn%q(Wo>16jNA@=d?+k34opUK
zFT8@rp=Dkg%4{*drc*CcpJlrnjUa%`dhm2*=ZaYM`7;Hui5JTY(^j;ZCEIEJnn5<O
z(fD5w48NB7^|o(#2?;$+<SvZSd?y0a+EX}N_A9b{Y5K`r{TpviS+#h02vZ%-*tH@7
zk_B~KV^iPe^XiDWlvJ?HS>tj*`8-6<XL~%*gx{Of56)o5=|xBamU|A>KJv4!$d@dh
z(p2|RhNIP$>|rTiORadotI}#3^XD)<%;v>o8eBxex`3#-2BnPNn1pGsi^dS8wf^Wa
zMnf|1%?<b7!^_Z4_DwXlCg;)*(bi7#<BJ3H4yw-$Oh!;4;l(N9J>aWcH$<l3JwM1#
zXyatnZn91R04)Db8!~b>z|Z=5y3n1}&%f*6%BV5q?>n3>Nhihcr*Nd{UpxF!1OMqh
zO~R8R^;3;x|8$dT)oJ^mxcrlaC%F76W>VO{UVZ}4)7BGMp8hH)u>2`~lJ#HEX$+wv
SEdT&iq@hGQTrB;`-G2b2MhxQs


From 61b2508224ada9bc968ccdf7ae47b3e6bb1dff80 Mon Sep 17 00:00:00 2001
From: Martin Doerr <mdoerr@openjdk.org>
Date: Thu, 9 Apr 2026 08:38:59 +0000
Subject: [PATCH 532/655] 8320897:
 compiler/vectorapi/reshape/TestVectorReinterpret.java fails on ppc64(le)
 platforms 8348519: [s390x] test failure TestVectorReinterpret.java

Reviewed-by: amitkumar, rrich
---
 test/hotspot/jtreg/ProblemList.txt            |  1 -
 .../tests/TestVectorDoubleExpandShrink.java   |  4 +-
 .../reshape/tests/TestVectorExpandShrink.java |  6 +-
 .../reshape/tests/TestVectorRebracket.java    | 62 +++++++++----------
 4 files changed, 36 insertions(+), 37 deletions(-)

diff --git a/test/hotspot/jtreg/ProblemList.txt b/test/hotspot/jtreg/ProblemList.txt
index d4efaa7e631..b4f9efff830 100644
--- a/test/hotspot/jtreg/ProblemList.txt
+++ b/test/hotspot/jtreg/ProblemList.txt
@@ -56,7 +56,6 @@ compiler/c2/irTests/TestDuplicateBackedge.java 8318904 generic-all
 
 compiler/codecache/jmx/PoolsIndependenceTest.java 8264632 macosx-all
 
-compiler/vectorapi/reshape/TestVectorReinterpret.java 8348519 linux-s390x
 compiler/vectorapi/VectorRebracket128Test.java 8330538 generic-all
 
 compiler/vectorization/TestVectorAlgorithms.java#noSuperWord 8376803 aix-ppc64,linux-s390x
diff --git a/test/hotspot/jtreg/compiler/vectorapi/reshape/tests/TestVectorDoubleExpandShrink.java b/test/hotspot/jtreg/compiler/vectorapi/reshape/tests/TestVectorDoubleExpandShrink.java
index 91b7113ac14..2d6ca8222a4 100644
--- a/test/hotspot/jtreg/compiler/vectorapi/reshape/tests/TestVectorDoubleExpandShrink.java
+++ b/test/hotspot/jtreg/compiler/vectorapi/reshape/tests/TestVectorDoubleExpandShrink.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2021, 2022, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2021, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -71,7 +71,7 @@ public class TestVectorDoubleExpandShrink {
     }
 
     @Test
-    @IR(counts = {REINTERPRET_NODE, "2"})
+    @IR(applyIfPlatformOr = {"x64", "true", "aarch64", "true", "riscv64", "true"}, counts = {REINTERPRET_NODE, "2"})
     public static void testB128toB64(MemorySegment input, MemorySegment output) {
         vectorDoubleExpandShrink(BSPEC128, BSPEC64, input, output);
     }
diff --git a/test/hotspot/jtreg/compiler/vectorapi/reshape/tests/TestVectorExpandShrink.java b/test/hotspot/jtreg/compiler/vectorapi/reshape/tests/TestVectorExpandShrink.java
index bd3a8f6c12d..92755b96acb 100644
--- a/test/hotspot/jtreg/compiler/vectorapi/reshape/tests/TestVectorExpandShrink.java
+++ b/test/hotspot/jtreg/compiler/vectorapi/reshape/tests/TestVectorExpandShrink.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2021, 2022, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2021, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -38,7 +38,7 @@ import static compiler.vectorapi.reshape.utils.VectorReshapeHelper.*;
  */
 public class TestVectorExpandShrink {
     @Test
-    @IR(counts = {REINTERPRET_NODE, "1"})
+    @IR(applyIfPlatformOr = {"x64", "true", "aarch64", "true", "riscv64", "true"}, counts = {REINTERPRET_NODE, "1"})
     public static void testB64toB128(MemorySegment input, MemorySegment output) {
         vectorExpandShrink(BSPEC64, BSPEC128, input, output);
     }
@@ -71,7 +71,7 @@ public class TestVectorExpandShrink {
     }
 
     @Test
-    @IR(counts = {REINTERPRET_NODE, "1"})
+    @IR(applyIfPlatformOr = {"x64", "true", "aarch64", "true", "riscv64", "true"}, counts = {REINTERPRET_NODE, "1"})
     public static void testB128toB64(MemorySegment input, MemorySegment output) {
         vectorExpandShrink(BSPEC128, BSPEC64, input, output);
     }
diff --git a/test/hotspot/jtreg/compiler/vectorapi/reshape/tests/TestVectorRebracket.java b/test/hotspot/jtreg/compiler/vectorapi/reshape/tests/TestVectorRebracket.java
index 2143eb3b500..d3283e991a4 100644
--- a/test/hotspot/jtreg/compiler/vectorapi/reshape/tests/TestVectorRebracket.java
+++ b/test/hotspot/jtreg/compiler/vectorapi/reshape/tests/TestVectorRebracket.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2021, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -41,7 +41,7 @@ import static compiler.vectorapi.reshape.utils.VectorReshapeHelper.*;
  */
 public class TestVectorRebracket {
     @Test
-    @IR(counts = {REINTERPRET_NODE, "1"})
+    @IR(applyIfPlatformOr = {"x64", "true", "aarch64", "true", "riscv64", "true"}, counts = {REINTERPRET_NODE, "1"})
     public static void testB64toS64(byte[] input, short[] output) {
         vectorRebracket(BSPEC64, SSPEC64, input, output);
     }
@@ -52,7 +52,7 @@ public class TestVectorRebracket {
     }
 
     @Test
-    @IR(counts = {REINTERPRET_NODE, "1"})
+    @IR(applyIfPlatformOr = {"x64", "true", "aarch64", "true", "riscv64", "true"}, counts = {REINTERPRET_NODE, "1"})
     public static void testB64toI64(byte[] input, int[] output) {
         vectorRebracket(BSPEC64, ISPEC64, input, output);
     }
@@ -63,7 +63,7 @@ public class TestVectorRebracket {
     }
 
     @Test
-    @IR(counts = {REINTERPRET_NODE, "1"})
+    @IR(applyIfPlatformOr = {"x64", "true", "aarch64", "true", "riscv64", "true"}, counts = {REINTERPRET_NODE, "1"})
     public static void testB64toL64(byte[] input, long[] output) {
         vectorRebracket(BSPEC64, LSPEC64, input, output);
     }
@@ -74,7 +74,7 @@ public class TestVectorRebracket {
     }
 
     @Test
-    @IR(counts = {REINTERPRET_NODE, "1"})
+    @IR(applyIfPlatformOr = {"x64", "true", "aarch64", "true", "riscv64", "true"}, counts = {REINTERPRET_NODE, "1"})
     public static void testB64toF64(byte[] input, float[] output) {
         vectorRebracket(BSPEC64, FSPEC64, input, output);
     }
@@ -85,7 +85,7 @@ public class TestVectorRebracket {
     }
 
     @Test
-    @IR(counts = {REINTERPRET_NODE, "1"})
+    @IR(applyIfPlatformOr = {"x64", "true", "aarch64", "true", "riscv64", "true"}, counts = {REINTERPRET_NODE, "1"})
     public static void testB64toD64(byte[] input, double[] output) {
         vectorRebracket(BSPEC64, DSPEC64, input, output);
     }
@@ -96,7 +96,7 @@ public class TestVectorRebracket {
     }
 
     @Test
-    @IR(counts = {REINTERPRET_NODE, "1"})
+    @IR(applyIfPlatformOr = {"x64", "true", "aarch64", "true", "riscv64", "true"}, counts = {REINTERPRET_NODE, "1"})
     public static void testS64toB64(short[] input, byte[] output) {
         vectorRebracket(SSPEC64, BSPEC64, input, output);
     }
@@ -107,7 +107,7 @@ public class TestVectorRebracket {
     }
 
     @Test
-    @IR(counts = {REINTERPRET_NODE, "1"})
+    @IR(applyIfPlatformOr = {"x64", "true", "aarch64", "true", "riscv64", "true"}, counts = {REINTERPRET_NODE, "1"})
     public static void testS64toI64(short[] input, int[] output) {
         vectorRebracket(SSPEC64, ISPEC64, input, output);
     }
@@ -118,7 +118,7 @@ public class TestVectorRebracket {
     }
 
     @Test
-    @IR(counts = {REINTERPRET_NODE, "1"})
+    @IR(applyIfPlatformOr = {"x64", "true", "aarch64", "true", "riscv64", "true"}, counts = {REINTERPRET_NODE, "1"})
     public static void testS64toL64(short[] input, long[] output) {
         vectorRebracket(SSPEC64, LSPEC64, input, output);
     }
@@ -129,7 +129,7 @@ public class TestVectorRebracket {
     }
 
     @Test
-    @IR(counts = {REINTERPRET_NODE, "1"})
+    @IR(applyIfPlatformOr = {"x64", "true", "aarch64", "true", "riscv64", "true"}, counts = {REINTERPRET_NODE, "1"})
     public static void testS64toF64(short[] input, float[] output) {
         vectorRebracket(SSPEC64, FSPEC64, input, output);
     }
@@ -140,7 +140,7 @@ public class TestVectorRebracket {
     }
 
     @Test
-    @IR(counts = {REINTERPRET_NODE, "1"})
+    @IR(applyIfPlatformOr = {"x64", "true", "aarch64", "true", "riscv64", "true"}, counts = {REINTERPRET_NODE, "1"})
     public static void testS64toD64(short[] input, double[] output) {
         vectorRebracket(SSPEC64, DSPEC64, input, output);
     }
@@ -151,7 +151,7 @@ public class TestVectorRebracket {
     }
 
     @Test
-    @IR(counts = {REINTERPRET_NODE, "1"})
+    @IR(applyIfPlatformOr = {"x64", "true", "aarch64", "true", "riscv64", "true"}, counts = {REINTERPRET_NODE, "1"})
     public static void testI64toB64(int[] input, byte[] output) {
         vectorRebracket(ISPEC64, BSPEC64, input, output);
     }
@@ -162,7 +162,7 @@ public class TestVectorRebracket {
     }
 
     @Test
-    @IR(counts = {REINTERPRET_NODE, "1"})
+    @IR(applyIfPlatformOr = {"x64", "true", "aarch64", "true", "riscv64", "true"}, counts = {REINTERPRET_NODE, "1"})
     public static void testI64toS64(int[] input, short[] output) {
         vectorRebracket(ISPEC64, SSPEC64, input, output);
     }
@@ -173,7 +173,7 @@ public class TestVectorRebracket {
     }
 
     @Test
-    @IR(counts = {REINTERPRET_NODE, "1"})
+    @IR(applyIfPlatformOr = {"x64", "true", "aarch64", "true", "riscv64", "true"}, counts = {REINTERPRET_NODE, "1"})
     public static void testI64toL64(int[] input, long[] output) {
         vectorRebracket(ISPEC64, LSPEC64, input, output);
     }
@@ -184,7 +184,7 @@ public class TestVectorRebracket {
     }
 
     @Test
-    @IR(counts = {REINTERPRET_NODE, "1"})
+    @IR(applyIfPlatformOr = {"x64", "true", "aarch64", "true", "riscv64", "true"}, counts = {REINTERPRET_NODE, "1"})
     public static void testI64toF64(int[] input, float[] output) {
         vectorRebracket(ISPEC64, FSPEC64, input, output);
     }
@@ -195,7 +195,7 @@ public class TestVectorRebracket {
     }
 
     @Test
-    @IR(counts = {REINTERPRET_NODE, "1"})
+    @IR(applyIfPlatformOr = {"x64", "true", "aarch64", "true", "riscv64", "true"}, counts = {REINTERPRET_NODE, "1"})
     public static void testI64toD64(int[] input, double[] output) {
         vectorRebracket(ISPEC64, DSPEC64, input, output);
     }
@@ -206,7 +206,7 @@ public class TestVectorRebracket {
     }
 
     @Test
-    @IR(counts = {REINTERPRET_NODE, "1"})
+    @IR(applyIfPlatformOr = {"x64", "true", "aarch64", "true", "riscv64", "true"}, counts = {REINTERPRET_NODE, "1"})
     public static void testL64toB64(long[] input, byte[] output) {
         vectorRebracket(LSPEC64, BSPEC64, input, output);
     }
@@ -217,7 +217,7 @@ public class TestVectorRebracket {
     }
 
     @Test
-    @IR(counts = {REINTERPRET_NODE, "1"})
+    @IR(applyIfPlatformOr = {"x64", "true", "aarch64", "true", "riscv64", "true"}, counts = {REINTERPRET_NODE, "1"})
     public static void testL64toS64(long[] input, short[] output) {
         vectorRebracket(LSPEC64, SSPEC64, input, output);
     }
@@ -228,7 +228,7 @@ public class TestVectorRebracket {
     }
 
     @Test
-    @IR(counts = {REINTERPRET_NODE, "1"})
+    @IR(applyIfPlatformOr = {"x64", "true", "aarch64", "true", "riscv64", "true"}, counts = {REINTERPRET_NODE, "1"})
     public static void testL64toI64(long[] input, int[] output) {
         vectorRebracket(LSPEC64, ISPEC64, input, output);
     }
@@ -239,7 +239,7 @@ public class TestVectorRebracket {
     }
 
     @Test
-    @IR(counts = {REINTERPRET_NODE, "1"})
+    @IR(applyIfPlatformOr = {"x64", "true", "aarch64", "true", "riscv64", "true"}, counts = {REINTERPRET_NODE, "1"})
     public static void testL64toF64(long[] input, float[] output) {
         vectorRebracket(LSPEC64, FSPEC64, input, output);
     }
@@ -250,7 +250,7 @@ public class TestVectorRebracket {
     }
 
     @Test
-    @IR(counts = {REINTERPRET_NODE, "1"})
+    @IR(applyIfPlatformOr = {"x64", "true", "aarch64", "true", "riscv64", "true"}, counts = {REINTERPRET_NODE, "1"})
     public static void testL64toD64(long[] input, double[] output) {
         vectorRebracket(LSPEC64, DSPEC64, input, output);
     }
@@ -261,7 +261,7 @@ public class TestVectorRebracket {
     }
 
     @Test
-    @IR(counts = {REINTERPRET_NODE, "1"})
+    @IR(applyIfPlatformOr = {"x64", "true", "aarch64", "true", "riscv64", "true"}, counts = {REINTERPRET_NODE, "1"})
     public static void testF64toB64(float[] input, byte[] output) {
         vectorRebracket(FSPEC64, BSPEC64, input, output);
     }
@@ -272,7 +272,7 @@ public class TestVectorRebracket {
     }
 
     @Test
-    @IR(counts = {REINTERPRET_NODE, "1"})
+    @IR(applyIfPlatformOr = {"x64", "true", "aarch64", "true", "riscv64", "true"}, counts = {REINTERPRET_NODE, "1"})
     public static void testF64toS64(float[] input, short[] output) {
         vectorRebracket(FSPEC64, SSPEC64, input, output);
     }
@@ -283,7 +283,7 @@ public class TestVectorRebracket {
     }
 
     @Test
-    @IR(counts = {REINTERPRET_NODE, "1"})
+    @IR(applyIfPlatformOr = {"x64", "true", "aarch64", "true", "riscv64", "true"}, counts = {REINTERPRET_NODE, "1"})
     public static void testF64toI64(float[] input, int[] output) {
         vectorRebracket(FSPEC64, ISPEC64, input, output);
     }
@@ -294,7 +294,7 @@ public class TestVectorRebracket {
     }
 
     @Test
-    @IR(counts = {REINTERPRET_NODE, "1"})
+    @IR(applyIfPlatformOr = {"x64", "true", "aarch64", "true", "riscv64", "true"}, counts = {REINTERPRET_NODE, "1"})
     public static void testF64toL64(float[] input, long[] output) {
         vectorRebracket(FSPEC64, LSPEC64, input, output);
     }
@@ -305,7 +305,7 @@ public class TestVectorRebracket {
     }
 
     @Test
-    @IR(counts = {REINTERPRET_NODE, "1"})
+    @IR(applyIfPlatformOr = {"x64", "true", "aarch64", "true", "riscv64", "true"}, counts = {REINTERPRET_NODE, "1"})
     public static void testF64toD64(float[] input, double[] output) {
         vectorRebracket(FSPEC64, DSPEC64, input, output);
     }
@@ -316,7 +316,7 @@ public class TestVectorRebracket {
     }
 
     @Test
-    @IR(counts = {REINTERPRET_NODE, "1"})
+    @IR(applyIfPlatformOr = {"x64", "true", "aarch64", "true", "riscv64", "true"}, counts = {REINTERPRET_NODE, "1"})
     public static void testD64toB64(double[] input, byte[] output) {
         vectorRebracket(DSPEC64, BSPEC64, input, output);
     }
@@ -327,7 +327,7 @@ public class TestVectorRebracket {
     }
 
     @Test
-    @IR(counts = {REINTERPRET_NODE, "1"})
+    @IR(applyIfPlatformOr = {"x64", "true", "aarch64", "true", "riscv64", "true"}, counts = {REINTERPRET_NODE, "1"})
     public static void testD64toS64(double[] input, short[] output) {
         vectorRebracket(DSPEC64, SSPEC64, input, output);
     }
@@ -338,7 +338,7 @@ public class TestVectorRebracket {
     }
 
     @Test
-    @IR(counts = {REINTERPRET_NODE, "1"})
+    @IR(applyIfPlatformOr = {"x64", "true", "aarch64", "true", "riscv64", "true"}, counts = {REINTERPRET_NODE, "1"})
     public static void testD64toI64(double[] input, int[] output) {
         vectorRebracket(DSPEC64, ISPEC64, input, output);
     }
@@ -349,7 +349,7 @@ public class TestVectorRebracket {
     }
 
     @Test
-    @IR(counts = {REINTERPRET_NODE, "1"})
+    @IR(applyIfPlatformOr = {"x64", "true", "aarch64", "true", "riscv64", "true"}, counts = {REINTERPRET_NODE, "1"})
     public static void testD64toL64(double[] input, long[] output) {
         vectorRebracket(DSPEC64, LSPEC64, input, output);
     }
@@ -360,7 +360,7 @@ public class TestVectorRebracket {
     }
 
     @Test
-    @IR(counts = {REINTERPRET_NODE, "1"})
+    @IR(applyIfPlatformOr = {"x64", "true", "aarch64", "true", "riscv64", "true"}, counts = {REINTERPRET_NODE, "1"})
     public static void testD64toF64(double[] input, float[] output) {
         vectorRebracket(DSPEC64, FSPEC64, input, output);
     }

From 60115c0bbfb564dc9acf7741505d22dd1ceddf95 Mon Sep 17 00:00:00 2001
From: Roland Westrelin <roland@openjdk.org>
Date: Thu, 9 Apr 2026 09:35:13 +0000
Subject: [PATCH 533/655] 8380158: C2: compiler/c2/TestGVNCrash.java asserts
 with adr and adr_type must agree

Reviewed-by: chagedorn, dfenacci
---
 src/hotspot/share/opto/arraycopynode.cpp      | 67 +++++++++++--------
 src/hotspot/share/opto/arraycopynode.hpp      |  4 ++
 .../TestACNonEscapingSrcBadAddPBaseType.java  | 65 ++++++++++++++++++
 3 files changed, 109 insertions(+), 27 deletions(-)
 create mode 100644 test/hotspot/jtreg/compiler/arraycopy/TestACNonEscapingSrcBadAddPBaseType.java

diff --git a/src/hotspot/share/opto/arraycopynode.cpp b/src/hotspot/share/opto/arraycopynode.cpp
index dab0ca98911..2f64482f55b 100644
--- a/src/hotspot/share/opto/arraycopynode.cpp
+++ b/src/hotspot/share/opto/arraycopynode.cpp
@@ -258,6 +258,19 @@ Node* ArrayCopyNode::try_clone_instance(PhaseGVN *phase, bool can_reshape, int c
   return mem;
 }
 
+// We may have narrowed the type of base because this runs with PhaseIterGVN::_delay_transform true, explicitly
+// update the type of the AddP so it's consistent with its base and load() picks the right memory slice.
+Node* ArrayCopyNode::make_and_transform_addp(PhaseGVN* phase, Node* base, Node* offset) {
+  return make_and_transform_addp(phase, base, base, offset);
+}
+
+Node* ArrayCopyNode::make_and_transform_addp(PhaseGVN* phase, Node* base, Node* ptr, Node* offset) {
+  assert(phase->is_IterGVN() == nullptr || phase->is_IterGVN()->delay_transform(), "helper method when delay transform is set");
+  Node* addp = phase->transform(AddPNode::make_with_base(base, ptr, offset));
+  phase->set_type(addp, addp->Value(phase));
+  return addp;
+}
+
 bool ArrayCopyNode::prepare_array_copy(PhaseGVN *phase, bool can_reshape,
                                        Node*& adr_src,
                                        Node*& base_src,
@@ -332,12 +345,11 @@ bool ArrayCopyNode::prepare_array_copy(PhaseGVN *phase, bool can_reshape,
 
     Node* dest_scale = phase->transform(new LShiftXNode(dest_offset, phase->intcon(shift)));
 
-    adr_src = phase->transform(AddPNode::make_with_base(base_src, src_scale));
-    adr_dest = phase->transform(AddPNode::make_with_base(base_dest, dest_scale));
-
-    adr_src = phase->transform(AddPNode::make_with_base(base_src, adr_src, phase->MakeConX(header)));
-    adr_dest = phase->transform(AddPNode::make_with_base(base_dest, adr_dest, phase->MakeConX(header)));
+    adr_src = make_and_transform_addp(phase, base_src, src_scale);
+    adr_dest = make_and_transform_addp(phase, base_dest, dest_scale);
 
+    adr_src = make_and_transform_addp(phase, base_src, adr_src, phase->MakeConX(header));
+    adr_dest = make_and_transform_addp(phase, base_dest, adr_dest, phase->MakeConX(header));
     copy_type = dest_elem;
   } else {
     assert(ary_src != nullptr, "should be a clone");
@@ -355,8 +367,8 @@ bool ArrayCopyNode::prepare_array_copy(PhaseGVN *phase, bool can_reshape,
       return false;
     }
 
-    adr_src = phase->transform(AddPNode::make_with_base(base_src, src_offset));
-    adr_dest = phase->transform(AddPNode::make_with_base(base_dest, dest_offset));
+    adr_src = make_and_transform_addp(phase, base_src, src_offset);
+    adr_dest = make_and_transform_addp(phase, base_dest, dest_offset);
 
     // The address is offsetted to an aligned address where a raw copy would start.
     // If the clone copy is decomposed into load-stores - the address is adjusted to
@@ -366,8 +378,8 @@ bool ArrayCopyNode::prepare_array_copy(PhaseGVN *phase, bool can_reshape,
     int diff = arrayOopDesc::base_offset_in_bytes(elem) - offset;
     assert(diff >= 0, "clone should not start after 1st array element");
     if (diff > 0) {
-      adr_src = phase->transform(AddPNode::make_with_base(base_src, adr_src, phase->MakeConX(diff)));
-      adr_dest = phase->transform(AddPNode::make_with_base(base_dest, adr_dest, phase->MakeConX(diff)));
+      adr_src = make_and_transform_addp(phase, base_src, adr_src, phase->MakeConX(diff));
+      adr_dest = make_and_transform_addp(phase, base_dest, adr_dest, phase->MakeConX(diff));
     }
     copy_type = elem;
     value_type = ary_src->elem();
@@ -429,12 +441,8 @@ Node* ArrayCopyNode::array_copy_forward(PhaseGVN *phase,
       store(bs, phase, forward_ctl, mm, adr_dest, atp_dest, v, value_type, copy_type);
       for (int i = 1; i < count; i++) {
         Node* off  = phase->MakeConX(type2aelembytes(copy_type) * i);
-        Node* next_src = phase->transform(AddPNode::make_with_base(base_src,adr_src,off));
-        // We may have narrowed the type of next_src right before calling this method but because this runs with
-        // PhaseIterGVN::_delay_transform true, explicitly update the type of the AddP so it's consistent  with its
-        // base and load() picks the right memory slice.
-        phase->set_type(next_src, next_src->Value(phase));
-        Node* next_dest = phase->transform(AddPNode::make_with_base(base_dest,adr_dest,off));
+        Node* next_src = make_and_transform_addp(phase, base_src,adr_src,off);
+        Node* next_dest = make_and_transform_addp(phase, base_dest,adr_dest,off);
         // Same as above
         phase->set_type(next_dest, next_dest->Value(phase));
         v = load(bs, phase, forward_ctl, mm, next_src, atp_src, value_type, copy_type);
@@ -473,13 +481,8 @@ Node* ArrayCopyNode::array_copy_backward(PhaseGVN *phase,
     if (count > 0) {
       for (int i = count-1; i >= 1; i--) {
         Node* off  = phase->MakeConX(type2aelembytes(copy_type) * i);
-        Node* next_src = phase->transform(AddPNode::make_with_base(base_src,adr_src,off));
-        // We may have narrowed the type of next_src right before calling this method but because this runs with
-        // PhaseIterGVN::_delay_transform true, explicitly update the type of the AddP so it's consistent  with its
-        // base and store() picks the right memory slice.
-        phase->set_type(next_src, next_src->Value(phase));
-        Node* next_dest = phase->transform(AddPNode::make_with_base(base_dest,adr_dest,off));
-        phase->set_type(next_dest, next_dest->Value(phase));
+        Node* next_src = make_and_transform_addp(phase, base_src,adr_src,off);
+        Node* next_dest = make_and_transform_addp(phase, base_dest,adr_dest,off);
         Node* v = load(bs, phase, backward_ctl, mm, next_src, atp_src, value_type, copy_type);
         store(bs, phase, backward_ctl, mm, next_dest, atp_dest, v, value_type, copy_type);
       }
@@ -618,21 +621,31 @@ Node *ArrayCopyNode::Ideal(PhaseGVN *phase, bool can_reshape) {
   phase->set_type(src, phase->type(src)->join_speculative(atp_src));
   phase->set_type(dest, phase->type(dest)->join_speculative(atp_dest));
 
+  // Control flow is going to be created, it's easier to do with _delay_transform set to true.
+
+  // prepare_array_copy() doesn't build control flow, but it creates AddP nodes. The src/dest type possibly gets
+  // narrowed above. If a newly created AddP node is commoned with a pre-existing one, then the type narrowing is lost.
+  // Setting _delay_transform before prepare_array_copy() guarantees this doesn't happen.
+  if (can_reshape) {
+    assert(!phase->is_IterGVN()->delay_transform(), "cannot delay transforms");
+    phase->is_IterGVN()->set_delay_transform(true);
+  }
+
   if (!prepare_array_copy(phase, can_reshape,
                           adr_src, base_src, adr_dest, base_dest,
                           copy_type, value_type, disjoint_bases)) {
     assert(adr_src == nullptr, "no node can be left behind");
     assert(adr_dest == nullptr, "no node can be left behind");
+    if (can_reshape) {
+      assert(phase->is_IterGVN()->delay_transform(), "cannot delay transforms");
+      phase->is_IterGVN()->set_delay_transform(false);
+    }
+
     return nullptr;
   }
 
   Node* in_mem = in(TypeFunc::Memory);
 
-  if (can_reshape) {
-    assert(!phase->is_IterGVN()->delay_transform(), "cannot delay transforms");
-    phase->is_IterGVN()->set_delay_transform(true);
-  }
-
   Node* backward_ctl = phase->C->top();
   Node* forward_ctl = phase->C->top();
   array_copy_test_overlap(phase, can_reshape, disjoint_bases, count, forward_ctl, backward_ctl);
diff --git a/src/hotspot/share/opto/arraycopynode.hpp b/src/hotspot/share/opto/arraycopynode.hpp
index 483a3a86267..aa62ee05cd0 100644
--- a/src/hotspot/share/opto/arraycopynode.hpp
+++ b/src/hotspot/share/opto/arraycopynode.hpp
@@ -104,6 +104,10 @@ private:
   static const TypePtr* get_address_type(PhaseGVN* phase, const TypePtr* atp, Node* n);
 
   Node* try_clone_instance(PhaseGVN *phase, bool can_reshape, int count);
+
+  Node* make_and_transform_addp(PhaseGVN* phase, Node* base, Node* offset);
+  Node* make_and_transform_addp(PhaseGVN* phase, Node* base, Node* ptr, Node* offset);
+
   bool prepare_array_copy(PhaseGVN *phase, bool can_reshape,
                           Node*& adr_src, Node*& base_src, Node*& adr_dest, Node*& base_dest,
                           BasicType& copy_type, const Type*& value_type, bool& disjoint_bases);
diff --git a/test/hotspot/jtreg/compiler/arraycopy/TestACNonEscapingSrcBadAddPBaseType.java b/test/hotspot/jtreg/compiler/arraycopy/TestACNonEscapingSrcBadAddPBaseType.java
new file mode 100644
index 00000000000..251c053ff5d
--- /dev/null
+++ b/test/hotspot/jtreg/compiler/arraycopy/TestACNonEscapingSrcBadAddPBaseType.java
@@ -0,0 +1,65 @@
+/*
+ * Copyright (c) 2026 IBM Corporation. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+/**
+ * @test
+ * @bug 8380158
+ * @summary C2: compiler/c2/TestGVNCrash.java asserts with adr and adr_type must agree
+ * @run main/othervm -XX:-TieredCompilation -XX:-UseOnStackReplacement -XX:-BackgroundCompilation
+ *                   -XX:CompileOnly=compiler.arraycopy.TestACNonEscapingSrcBadAddPBaseType::test1
+ *                   -XX:+UnlockDiagnosticVMOptions -XX:+StressIGVN -XX:StressSeed=946074051 ${test.main.class}
+ * @run main/othervm -XX:-TieredCompilation -XX:-UseOnStackReplacement -XX:-BackgroundCompilation
+ *                   -XX:CompileOnly=compiler.arraycopy.TestACNonEscapingSrcBadAddPBaseType::test1
+ *                   -XX:+UnlockDiagnosticVMOptions -XX:+StressIGVN ${test.main.class}
+ * @run main ${test.main.class}
+ */
+
+package compiler.arraycopy;
+
+public class TestACNonEscapingSrcBadAddPBaseType {
+    private static volatile int volatileField;
+
+    public static void main(String[] args) {
+        int[] dst = new int[2];
+        for (int i = 0; i < 20_000; i++) {
+            test1(dst);
+        }
+    }
+
+    private static void test1(int[] dst) {
+        int[] array = new int[2];
+        A a = new A(array);
+        volatileField = 42;
+        int[] src = a.src;
+        System.arraycopy(src, 0, dst, 0, src.length);
+        System.arraycopy(src, 0, dst, 0, src.length);
+    }
+
+    private static class A {
+        private final int[] src;
+
+        public A(int[] src) {
+            this.src = src;
+        }
+    }
+}

From 261011ab138685102166336ad1a1e5f757f6937e Mon Sep 17 00:00:00 2001
From: Daisuke Yamazaki <dyama@openjdk.org>
Date: Thu, 9 Apr 2026 10:51:53 +0000
Subject: [PATCH 534/655] 8372325: Refactor tests under jdk/java/net/httpclient
 to use ${test.main.class}

Reviewed-by: dfuchs, syan
---
 .../java/net/httpclient/ALPNFailureTest.java  |  6 ++--
 .../net/httpclient/ALPNProxyFailureTest.java  |  6 ++--
 .../httpclient/AggregateRequestBodyTest.java  |  2 +-
 .../net/httpclient/AltServiceUsageTest.java   |  2 +-
 .../net/httpclient/AsFileDownloadTest.java    |  2 +-
 .../net/httpclient/AsyncExecutorShutdown.java |  2 +-
 .../java/net/httpclient/AsyncShutdownNow.java |  2 +-
 .../net/httpclient/AuthFilterCacheTest.java   |  2 +-
 .../java/net/httpclient/AuthSchemesTest.java  |  4 +--
 .../java/net/httpclient/BasicAuthTest.java    |  4 +--
 .../java/net/httpclient/BasicHTTP2Test.java   |  2 +-
 .../java/net/httpclient/BasicHTTP3Test.java   |  2 +-
 .../net/httpclient/BasicRedirectTest.java     |  2 +-
 .../BodyProcessorInputStreamTest.java         |  4 +--
 .../net/httpclient/BodySubscribersTest.java   |  2 +-
 .../java/net/httpclient/BufferSize1Test.java  |  4 +--
 .../BufferSizePropertyClampTest.java          |  8 ++---
 .../BufferingSubscriberCancelTest.java        |  2 +-
 .../BufferingSubscriberErrorCompleteTest.java |  2 +-
 .../httpclient/BufferingSubscriberTest.java   |  2 +-
 .../net/httpclient/ByteArrayPublishers.java   |  4 +--
 .../net/httpclient/CancelRequestTest.java     |  2 +-
 .../httpclient/CancelStreamedBodyTest.java    |  2 +-
 .../CancelledPartialResponseTest.java         |  2 +-
 .../net/httpclient/CancelledResponse.java     |  6 ++--
 .../net/httpclient/CancelledResponse2.java    |  2 +-
 .../net/httpclient/ConcurrentResponses.java   |  2 +-
 .../net/httpclient/ConnectExceptionTest.java  |  2 +-
 .../ConnectTimeoutHandshakeAsync.java         |  2 +-
 .../ConnectTimeoutHandshakeSync.java          |  2 +-
 .../httpclient/ContentLengthHeaderTest.java   |  2 +-
 .../java/net/httpclient/CookieHeaderTest.java |  2 +-
 .../httpclient/CustomRequestPublisher.java    |  2 +-
 .../httpclient/CustomResponseSubscriber.java  |  2 +-
 .../java/net/httpclient/DebugLoggerTest.java  | 24 +++++++-------
 .../net/httpclient/DependentActionsTest.java  |  2 +-
 .../DependentPromiseActionsTest.java          |  2 +-
 .../java/net/httpclient/DigestEchoClient.java |  6 ++--
 .../net/httpclient/DigestEchoClientSSL.java   |  8 ++---
 .../net/httpclient/DurationOverflowTest.java  | 10 +++---
 .../net/httpclient/EmptyAuthenticate.java     |  4 +--
 .../net/httpclient/EncodedCharsInURI.java     |  2 +-
 .../net/httpclient/EscapedOctetsInURI.java    |  2 +-
 .../java/net/httpclient/ExecutorShutdown.java |  2 +-
 .../java/net/httpclient/ExpectContinue.java   |  2 +-
 .../net/httpclient/ExpectContinueTest.java    |  2 +-
 .../net/httpclient/FilePublisherTest.java     |  2 +-
 .../httpclient/FlowAdapterPublisherTest.java  |  2 +-
 .../httpclient/FlowAdapterSubscriberTest.java |  2 +-
 .../net/httpclient/ForbiddenHeadTest.java     |  2 +-
 .../net/httpclient/GZIPInputStreamTest.java   |  2 +-
 .../net/httpclient/HandshakeFailureTest.java  |  8 ++---
 test/jdk/java/net/httpclient/HeadTest.java    |  2 +-
 .../net/httpclient/HeadersLowerCaseTest.java  |  2 +-
 .../jdk/java/net/httpclient/HeadersTest1.java |  2 +-
 .../java/net/httpclient/Http1ChunkedTest.java |  4 +--
 .../HttpClientAuthRetryLimitTest.java         | 10 +++---
 .../net/httpclient/HttpClientBuilderTest.java |  2 +-
 .../java/net/httpclient/HttpClientClose.java  |  2 +-
 .../httpclient/HttpClientExceptionTest.java   |  2 +-
 .../httpclient/HttpClientLocalAddrTest.java   |  2 +-
 .../net/httpclient/HttpClientSNITest.java     |  4 +--
 .../HttpClientSendAsyncExceptionTest.java     |  4 +--
 .../net/httpclient/HttpClientShutdown.java    |  2 +-
 .../httpclient/HttpGetInCancelledFuture.java  |  6 ++--
 .../java/net/httpclient/HttpHeadersOf.java    |  2 +-
 .../HttpInputStreamAvailableTest.java         |  2 +-
 .../net/httpclient/HttpInputStreamTest.java   |  4 +--
 .../java/net/httpclient/HttpRedirectTest.java |  2 +-
 .../OfByteArraysTest.java                     |  4 +--
 .../httpclient/HttpRequestNewBuilderTest.java |  2 +-
 .../HttpResponseConnectionLabelTest.java      |  4 +--
 .../HttpResponseInputStreamInterruptTest.java |  2 +-
 .../HttpResponseInputStreamTest.java          |  2 +-
 .../httpclient/HttpResponseLimitingTest.java  |  4 +--
 .../net/httpclient/HttpSlowServerTest.java    |  4 +--
 .../java/net/httpclient/HttpVersionsTest.java |  2 +-
 .../net/httpclient/HttpsTunnelAuthTest.java   |  4 +--
 .../java/net/httpclient/HttpsTunnelTest.java  |  6 ++--
 .../java/net/httpclient/ISO_8859_1_Test.java  |  2 +-
 .../httpclient/IdleConnectionTimeoutTest.java | 20 ++++++------
 .../net/httpclient/ImmutableFlowItems.java    |  2 +-
 .../java/net/httpclient/ImmutableHeaders.java |  4 +--
 .../httpclient/ImmutableSSLSessionTest.java   |  4 +--
 .../httpclient/InterruptedBlockingSend.java   |  4 +--
 ...InvalidInputStreamSubscriptionRequest.java |  6 ++--
 .../net/httpclient/InvalidSSLContextTest.java |  2 +-
 .../InvalidSubscriptionRequest.java           |  2 +-
 .../net/httpclient/LargeHandshakeTest.java    |  4 +--
 .../net/httpclient/LargeResponseContent.java  |  4 +--
 .../net/httpclient/LargeResponseTest.java     |  4 +--
 .../net/httpclient/LineBodyHandlerTest.java   |  2 +-
 .../LineStreamsAndSurrogatesTest.java         |  2 +-
 .../LineSubscribersAndSurrogatesTest.java     |  2 +-
 .../jdk/java/net/httpclient/ManyRequests.java | 10 +++---
 .../java/net/httpclient/ManyRequests2.java    |  8 ++---
 .../net/httpclient/ManyRequestsLegacy.java    |  8 ++---
 test/jdk/java/net/httpclient/MaxStreams.java  |  2 +-
 .../net/httpclient/MessageHeadersTest.java    |  4 +--
 .../java/net/httpclient/MultiAuthTest.java    |  4 +--
 .../java/net/httpclient/NoBodyPartOne.java    |  2 +-
 .../java/net/httpclient/NoBodyPartThree.java  |  2 +-
 .../java/net/httpclient/NoBodyPartTwo.java    |  2 +-
 .../net/httpclient/NonAsciiCharsInURI.java    |  2 +-
 test/jdk/java/net/httpclient/OriginTest.java  |  4 +--
 .../BodyHandlerOfFileDownloadTest.java        |  2 +-
 .../PathSubscriber/BodyHandlerOfFileTest.java |  2 +-
 .../BodySubscriberOfFileTest.java             |  2 +-
 .../httpclient/PlainProxyConnectionTest.java  |  2 +-
 .../httpclient/ProxyAuthDisabledSchemes.java  |  8 ++---
 .../ProxyAuthDisabledSchemesSSL.java          | 10 +++---
 .../java/net/httpclient/ProxyAuthTest.java    |  4 +--
 .../net/httpclient/ProxySelectorTest.java     |  2 +-
 test/jdk/java/net/httpclient/ProxyTest.java   |  4 +--
 .../net/httpclient/RedirectMethodChange.java  |  2 +-
 .../net/httpclient/RedirectTimeoutTest.java   |  4 +--
 .../net/httpclient/RedirectWithCookie.java    |  2 +-
 .../java/net/httpclient/RequestBodyTest.java  |  2 +-
 .../net/httpclient/RequestBuilderTest.java    |  2 +-
 .../java/net/httpclient/Response1xxTest.java  |  2 +-
 test/jdk/java/net/httpclient/Response204.java |  4 +--
 .../net/httpclient/Response204V2Test.java     |  2 +-
 .../httpclient/ResponseBodyBeforeError.java   |  2 +-
 .../net/httpclient/ResponsePublisher.java     |  2 +-
 .../net/httpclient/RestrictedHeadersTest.java | 10 +++---
 test/jdk/java/net/httpclient/RetryPost.java   |  4 +--
 .../java/net/httpclient/RetryWithCookie.java  |  2 +-
 .../java/net/httpclient/SSLExceptionTest.java |  2 +-
 .../httpclient/SendResponseHeadersTest.java   |  2 +-
 .../java/net/httpclient/ServerCloseTest.java  |  2 +-
 .../java/net/httpclient/ShortRequestBody.java |  4 +--
 .../net/httpclient/ShortResponseBodyGet.java  |  2 +-
 .../net/httpclient/ShortResponseBodyPost.java |  2 +-
 test/jdk/java/net/httpclient/ShutdownNow.java |  2 +-
 .../jdk/java/net/httpclient/SmallTimeout.java |  6 ++--
 test/jdk/java/net/httpclient/SmokeTest.java   |  2 +-
 .../net/httpclient/SpecialHeadersTest.java    |  4 +--
 .../java/net/httpclient/SplitResponse.java    |  4 +--
 .../java/net/httpclient/StreamCloseTest.java  |  2 +-
 .../httpclient/SubscriberAPIExceptions.java   |  2 +-
 test/jdk/java/net/httpclient/TestKitTest.java |  2 +-
 .../ThrowingPublishersCustomAfterCancel.java  |  4 +--
 .../ThrowingPublishersCustomBeforeCancel.java |  4 +--
 .../ThrowingPublishersIOAfterCancel.java      |  4 +--
 .../ThrowingPublishersIOBeforeCancel.java     |  4 +--
 .../ThrowingPublishersInNextRequest.java      |  4 +--
 .../ThrowingPublishersInRequest.java          |  4 +--
 .../ThrowingPublishersInSubscribe.java        |  4 +--
 .../httpclient/ThrowingPublishersSanity.java  |  4 +--
 ...rowingPushPromisesAsInputStreamCustom.java |  4 +--
 .../ThrowingPushPromisesAsInputStreamIO.java  |  4 +--
 .../ThrowingPushPromisesAsLinesCustom.java    |  4 +--
 .../ThrowingPushPromisesAsLinesIO.java        |  4 +--
 .../ThrowingPushPromisesAsStringCustom.java   |  4 +--
 .../ThrowingPushPromisesAsStringIO.java       |  4 +--
 .../ThrowingPushPromisesSanity.java           |  4 +--
 .../ThrowingSubscribersAsInputStream.java     |  4 +--
 ...ThrowingSubscribersAsInputStreamAsync.java |  4 +--
 .../ThrowingSubscribersAsLimiting.java        |  4 +--
 .../ThrowingSubscribersAsLimitingAsync.java   |  4 +--
 .../ThrowingSubscribersAsLines.java           |  4 +--
 .../ThrowingSubscribersAsLinesAsync.java      |  4 +--
 .../ThrowingSubscribersAsString.java          |  4 +--
 .../ThrowingSubscribersAsStringAsync.java     |  4 +--
 .../httpclient/ThrowingSubscribersSanity.java |  4 +--
 .../jdk/java/net/httpclient/TimeoutBasic.java |  4 +--
 .../java/net/httpclient/TimeoutOrdering.java  |  6 ++--
 .../httpclient/TimeoutResponseBodyTest.java   |  6 ++--
 .../httpclient/TimeoutResponseHeaderTest.java |  6 ++--
 .../java/net/httpclient/TlsContextTest.java   |  2 +-
 .../java/net/httpclient/UnauthorizedTest.java |  2 +-
 .../net/httpclient/UnknownBodyLengthTest.java | 10 +++---
 .../httpclient/UserAuthWithAuthenticator.java |  2 +-
 .../java/net/httpclient/UserCookieTest.java   |  2 +-
 test/jdk/java/net/httpclient/VersionTest.java |  4 +--
 .../java/net/httpclient/ZeroRedirects.java    |  4 +--
 .../altsvc/AltServiceReasonableAssurance.java |  4 +--
 .../net/httpclient/http2/BadHeadersTest.java  |  4 +--
 .../httpclient/http2/BadPushPromiseTest.java  |  4 +--
 .../java/net/httpclient/http2/BasicTest.java  |  2 +-
 .../http2/ConnectionFlowControlTest.java      |  4 +--
 .../httpclient/http2/ConnectionReuseTest.java |  6 ++--
 .../http2/ContinuationFrameTest.java          |  4 +--
 .../java/net/httpclient/http2/ErrorTest.java  |  2 +-
 .../httpclient/http2/FixedThreadPoolTest.java |  2 +-
 .../net/httpclient/http2/H2GoAwayTest.java    |  4 +--
 .../httpclient/http2/H2SelectorVTTest.java    | 12 +++----
 .../http2/IdlePooledConnectionTest.java       |  4 +--
 .../httpclient/http2/ImplicitPushCancel.java  |  2 +-
 .../java/net/httpclient/http2/NoBodyTest.java |  2 +-
 .../net/httpclient/http2/PostPutTest.java     |  4 +--
 .../java/net/httpclient/http2/ProxyTest2.java |  4 +--
 .../http2/PushPromiseContinuation.java        |  2 +-
 .../net/httpclient/http2/RedirectTest.java    |  2 +-
 .../java/net/httpclient/http2/ServerPush.java |  2 +-
 .../http2/ServerPushWithDiffTypes.java        |  2 +-
 .../java/net/httpclient/http2/SimpleGet.java  |  6 ++--
 .../net/httpclient/http2/TLSConnection.java   |  4 +--
 .../java/net/httpclient/http2/Timeout.java    |  4 +--
 .../httpclient/http2/TrailingHeadersTest.java |  4 +--
 .../net/httpclient/http2/UserInfoTest.java    |  4 +--
 .../http3/BadCipherSuiteErrorTest.java        |  2 +-
 .../httpclient/http3/FramesDecoderTest.java   |  4 +--
 .../net/httpclient/http3/GetHTTP3Test.java    |  2 +-
 .../httpclient/http3/H3BadHeadersTest.java    |  2 +-
 .../net/httpclient/http3/H3BasicTest.java     |  2 +-
 .../httpclient/http3/H3ConcurrentPush.java    |  2 +-
 .../http3/H3ConnectionPoolTest.java           |  2 +-
 .../httpclient/http3/H3DataLimitsTest.java    |  2 +-
 .../httpclient/http3/H3ErrorHandlingTest.java |  2 +-
 .../net/httpclient/http3/H3GoAwayTest.java    |  4 +--
 .../http3/H3HeaderSizeLimitTest.java          |  2 +-
 .../httpclient/http3/H3HeadersEncoding.java   |  2 +-
 .../http3/H3ImplicitPushCancel.java           |  2 +-
 .../http3/H3InsertionsLimitTest.java          |  2 +-
 .../http3/H3LogHandshakeErrors.java           |  2 +-
 .../http3/H3MaxInitialTimeoutTest.java        |  6 ++--
 .../http3/H3MemoryHandlingTest.java           |  2 +-
 .../H3MultipleConnectionsToSameHost.java      |  8 ++---
 .../net/httpclient/http3/H3ProxyTest.java     |  4 +--
 .../net/httpclient/http3/H3PushCancel.java    |  2 +-
 .../httpclient/http3/H3QuicTLSConnection.java |  4 +--
 .../net/httpclient/http3/H3QuicVTTest.java    | 12 +++----
 .../net/httpclient/http3/H3RedirectTest.java  |  2 +-
 .../net/httpclient/http3/H3ServerPush.java    |  2 +-
 .../httpclient/http3/H3ServerPushCancel.java  |  2 +-
 .../httpclient/http3/H3ServerPushTest.java    |  4 +--
 .../http3/H3ServerPushWithDiffTypes.java      |  2 +-
 .../net/httpclient/http3/H3SimpleGet.java     | 32 +++++++++----------
 .../net/httpclient/http3/H3SimplePost.java    |  2 +-
 .../net/httpclient/http3/H3SimpleTest.java    |  8 ++---
 .../httpclient/http3/H3StopSendingTest.java   |  2 +-
 .../http3/H3StreamLimitReachedTest.java       |  4 +--
 .../java/net/httpclient/http3/H3Timeout.java  |  4 +--
 .../http3/H3UnsupportedSSLParametersTest.java |  4 +--
 .../net/httpclient/http3/H3UserInfoTest.java  |  4 +--
 .../net/httpclient/http3/HTTP3NoBodyTest.java |  2 +-
 .../http3/Http3ExpectContinueTest.java        |  2 +-
 .../http3/PeerUniStreamDispatcherTest.java    |  2 +-
 .../net/httpclient/http3/PostHTTP3Test.java   |  2 +-
 .../net/httpclient/http3/StopSendingTest.java |  2 +-
 .../net/httpclient/http3/StreamLimitTest.java |  2 +-
 .../httpclient/offline/OfflineTesting.java    |  2 +-
 .../qpack/BlockingDecodingTest.java           |  4 +--
 .../qpack/DecoderInstructionsReaderTest.java  |  4 +--
 .../qpack/DecoderInstructionsWriterTest.java  |  4 +--
 .../qpack/DecoderSectionSizeLimitTest.java    |  4 +--
 .../net/httpclient/qpack/DecoderTest.java     |  4 +--
 ...namicTableFieldLineRepresentationTest.java |  4 +--
 .../httpclient/qpack/DynamicTableTest.java    |  4 +--
 .../qpack/EncoderDecoderConnectionTest.java   |  4 +--
 .../httpclient/qpack/EncoderDecoderTest.java  |  4 +--
 .../qpack/EncoderInstructionsReaderTest.java  |  4 +--
 .../qpack/EncoderInstructionsWriterTest.java  |  4 +--
 .../net/httpclient/qpack/EncoderTest.java     |  4 +--
 .../httpclient/qpack/EntriesEvictionTest.java |  4 +--
 .../qpack/FieldSectionPrefixTest.java         |  4 +--
 .../qpack/IntegerReaderMaxValuesTest.java     |  4 +--
 .../qpack/StaticTableFieldsTest.java          |  4 +--
 .../qpack/StringLengthLimitsTest.java         |  4 +--
 .../httpclient/qpack/TablesIndexerTest.java   |  4 +--
 .../qpack/UnacknowledgedInsertionTest.java    |  4 +--
 .../net/httpclient/quic/AckElicitingTest.java |  4 +--
 .../net/httpclient/quic/AckFrameTest.java     |  2 +-
 .../httpclient/quic/BuffersReaderTest.java    |  4 +--
 .../httpclient/quic/BuffersReaderVLTest.java  |  2 +-
 .../httpclient/quic/ConnectionIDSTest.java    |  2 +-
 .../quic/CryptoWriterQueueTest.java           |  2 +-
 .../java/net/httpclient/quic/CubicTest.java   |  4 +--
 .../net/httpclient/quic/KeyUpdateTest.java    |  2 +-
 .../net/httpclient/quic/OrderedFlowTest.java  | 10 +++---
 .../java/net/httpclient/quic/PacerTest.java   |  2 +-
 .../httpclient/quic/PacketEncodingTest.java   | 22 ++++++-------
 .../net/httpclient/quic/PacketLossTest.java   |  2 +-
 .../httpclient/quic/PacketNumbersTest.java    |  2 +-
 .../quic/PacketSpaceManagerTest.java          | 16 +++++-----
 .../quic/QuicFramesDecoderTest.java           |  2 +-
 .../quic/QuicRequestResponseTest.java         |  2 +-
 .../quic/StatelessResetReceiptTest.java       |  2 +-
 .../httpclient/quic/VariableLengthTest.java   |  2 +-
 .../quic/VersionNegotiationTest.java          |  2 +-
 .../quic/tls/PacketEncryptionTest.java        |  2 +-
 .../tls/QuicTLSEngineBadParametersTest.java   |  4 +--
 .../quic/tls/QuicTLSEngineFailedALPNTest.java |  4 +--
 .../QuicTLSEngineMissingParametersTest.java   |  4 +--
 .../quic/tls/Quicv2PacketEncryptionTest.java  |  2 +-
 .../FileProcessorPermissionTest.java          |  2 +-
 .../filePerms/SecurityBeforeFile.java         |  2 +-
 .../httpclient/ssltest/CertificateTest.java   | 16 +++++-----
 .../httpclient/ssltest/TlsVersionTest.java    |  6 ++--
 .../java/net/httpclient/websocket/Abort.java  |  2 +-
 .../httpclient/websocket/AutomaticPong.java   |  2 +-
 .../websocket/BlowupOutputQueue.java          |  2 +-
 .../websocket/ConnectionHandoverTest.java     |  4 +--
 .../websocket/HandshakeUrlEncodingTest.java   |  2 +-
 .../websocket/PendingBinaryPingClose.java     |  2 +-
 .../websocket/PendingBinaryPongClose.java     |  2 +-
 .../websocket/PendingPingBinaryClose.java     |  2 +-
 .../websocket/PendingPingTextClose.java       |  2 +-
 .../websocket/PendingPongBinaryClose.java     |  2 +-
 .../websocket/PendingPongTextClose.java       |  2 +-
 .../websocket/PendingTextPingClose.java       |  2 +-
 .../websocket/PendingTextPongClose.java       |  2 +-
 .../net/httpclient/websocket/SendTest.java    |  2 +-
 .../websocket/WSHandshakeExceptionTest.java   |  2 +-
 .../websocket/WebSocketBuilderTest.java       |  2 +-
 .../websocket/WebSocketEndiannessTest.java    |  4 +--
 .../websocket/WebSocketExtendedTest.java      |  2 +-
 .../websocket/WebSocketProxyTest.java         |  2 +-
 .../httpclient/websocket/WebSocketTest.java   |  2 +-
 .../websocket/security/WSSanityTest.java      |  2 +-
 .../httpclient/whitebox/AltSvcFrameTest.java  |  2 +-
 .../whitebox/AltSvcRegistryTest.java          |  2 +-
 313 files changed, 572 insertions(+), 572 deletions(-)

diff --git a/test/jdk/java/net/httpclient/ALPNFailureTest.java b/test/jdk/java/net/httpclient/ALPNFailureTest.java
index 3d6013f557c..dbffec82e28 100644
--- a/test/jdk/java/net/httpclient/ALPNFailureTest.java
+++ b/test/jdk/java/net/httpclient/ALPNFailureTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2019, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2019, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -30,8 +30,8 @@
  * @modules java.net.http
  *          java.logging
  * @build ALPNFailureTest
- * @run main/othervm -Djdk.internal.httpclient.debug=true ALPNFailureTest HTTP_1_1
- * @run main/othervm ALPNFailureTest HTTP_2
+ * @run main/othervm -Djdk.internal.httpclient.debug=true ${test.main.class} HTTP_1_1
+ * @run main/othervm ${test.main.class} HTTP_2
  */
 import javax.net.ServerSocketFactory;
 import javax.net.ssl.SSLContext;
diff --git a/test/jdk/java/net/httpclient/ALPNProxyFailureTest.java b/test/jdk/java/net/httpclient/ALPNProxyFailureTest.java
index 4dedfed97b1..bae8d55c8cc 100644
--- a/test/jdk/java/net/httpclient/ALPNProxyFailureTest.java
+++ b/test/jdk/java/net/httpclient/ALPNProxyFailureTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2019, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2019, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -31,8 +31,8 @@
  * @build jdk.test.lib.net.SimpleSSLContext DigestEchoServer
  *        jdk.httpclient.test.lib.common.HttpServerAdapters
  *        ALPNFailureTest ALPNProxyFailureTest
- * @run main/othervm -Djdk.internal.httpclient.debug=true -Dtest.nolinger=true ALPNProxyFailureTest HTTP_1_1
- * @run main/othervm -Dtest.nolinger=true ALPNProxyFailureTest HTTP_2
+ * @run main/othervm -Djdk.internal.httpclient.debug=true -Dtest.nolinger=true ${test.main.class} HTTP_1_1
+ * @run main/othervm -Dtest.nolinger=true ${test.main.class} HTTP_2
  */
 import javax.net.ServerSocketFactory;
 import javax.net.ssl.SSLContext;
diff --git a/test/jdk/java/net/httpclient/AggregateRequestBodyTest.java b/test/jdk/java/net/httpclient/AggregateRequestBodyTest.java
index fb67cf02566..df6c9902cf9 100644
--- a/test/jdk/java/net/httpclient/AggregateRequestBodyTest.java
+++ b/test/jdk/java/net/httpclient/AggregateRequestBodyTest.java
@@ -29,7 +29,7 @@
  *       ReferenceTracker AggregateRequestBodyTest
  * @run junit/othervm -Djdk.internal.httpclient.debug=true
  *                     -Djdk.httpclient.HttpClient.log=requests,responses,errors,headers,frames
- *                     AggregateRequestBodyTest
+ *                     ${test.main.class}
  * @summary Tests HttpRequest.BodyPublishers::concat
  */
 
diff --git a/test/jdk/java/net/httpclient/AltServiceUsageTest.java b/test/jdk/java/net/httpclient/AltServiceUsageTest.java
index 59ad2179b90..dd6f9b065b7 100644
--- a/test/jdk/java/net/httpclient/AltServiceUsageTest.java
+++ b/test/jdk/java/net/httpclient/AltServiceUsageTest.java
@@ -56,7 +56,7 @@ import org.junit.jupiter.api.Test;
  *
  * @run junit/othervm -Djdk.internal.httpclient.debug=true
  *                     -Djdk.httpclient.HttpClient.log=requests,responses,errors
- *                     AltServiceUsageTest
+ *                     ${test.main.class}
  */
 public class AltServiceUsageTest implements HttpServerAdapters {
 
diff --git a/test/jdk/java/net/httpclient/AsFileDownloadTest.java b/test/jdk/java/net/httpclient/AsFileDownloadTest.java
index 6e9c4e676cf..fca920cb13c 100644
--- a/test/jdk/java/net/httpclient/AsFileDownloadTest.java
+++ b/test/jdk/java/net/httpclient/AsFileDownloadTest.java
@@ -87,7 +87,7 @@ import org.junit.jupiter.params.provider.MethodSource;
  *        jdk.test.lib.Platform jdk.test.lib.util.FileUtils
  *        jdk.httpclient.test.lib.common.HttpServerAdapters
  *        jdk.httpclient.test.lib.common.TestServerConfigurator
- * @run junit/othervm/timeout=480 AsFileDownloadTest
+ * @run junit/othervm/timeout=480 ${test.main.class}
  */
 public class AsFileDownloadTest {
 
diff --git a/test/jdk/java/net/httpclient/AsyncExecutorShutdown.java b/test/jdk/java/net/httpclient/AsyncExecutorShutdown.java
index 308288bb9bf..ed2482e80b5 100644
--- a/test/jdk/java/net/httpclient/AsyncExecutorShutdown.java
+++ b/test/jdk/java/net/httpclient/AsyncExecutorShutdown.java
@@ -32,7 +32,7 @@
  * @run junit/othervm
  *       -Djdk.internal.httpclient.debug=true
  *       -Djdk.httpclient.HttpClient.log=trace,headers,requests
- *       AsyncExecutorShutdown
+ *       ${test.main.class}
  */
 // -Djdk.internal.httpclient.debug=true
 
diff --git a/test/jdk/java/net/httpclient/AsyncShutdownNow.java b/test/jdk/java/net/httpclient/AsyncShutdownNow.java
index 7dc13cf08e2..39e13b782c9 100644
--- a/test/jdk/java/net/httpclient/AsyncShutdownNow.java
+++ b/test/jdk/java/net/httpclient/AsyncShutdownNow.java
@@ -34,7 +34,7 @@
  * @run junit/othervm
  *       -Djdk.internal.httpclient.debug=true
  *       -Djdk.httpclient.HttpClient.log=trace,headers,requests
- *       AsyncShutdownNow
+ *       ${test.main.class}
  */
 // -Djdk.internal.httpclient.debug=true
 
diff --git a/test/jdk/java/net/httpclient/AuthFilterCacheTest.java b/test/jdk/java/net/httpclient/AuthFilterCacheTest.java
index 0d87055ff51..9fb231de858 100644
--- a/test/jdk/java/net/httpclient/AuthFilterCacheTest.java
+++ b/test/jdk/java/net/httpclient/AuthFilterCacheTest.java
@@ -67,7 +67,7 @@ import org.junit.jupiter.params.provider.MethodSource;
  * @run junit/othervm -Dtest.requiresHost=true
  * -Djdk.httpclient.HttpClient.log=requests,headers,errors,quic
  * -Djdk.internal.httpclient.debug=false
- * AuthFilterCacheTest
+ * ${test.main.class}
  */
 
 public class AuthFilterCacheTest implements HttpServerAdapters {
diff --git a/test/jdk/java/net/httpclient/AuthSchemesTest.java b/test/jdk/java/net/httpclient/AuthSchemesTest.java
index 8e0231c8eaf..128cae0ed20 100644
--- a/test/jdk/java/net/httpclient/AuthSchemesTest.java
+++ b/test/jdk/java/net/httpclient/AuthSchemesTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2019, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2019, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -26,7 +26,7 @@
  * @bug 8217237
  * @library /test/lib
  * @modules java.net.http
- * @run main/othervm AuthSchemesTest
+ * @run main/othervm ${test.main.class}
  * @summary HttpClient does not deal well with multi-valued WWW-Authenticate challenge headers
  */
 
diff --git a/test/jdk/java/net/httpclient/BasicAuthTest.java b/test/jdk/java/net/httpclient/BasicAuthTest.java
index fc1f1d4e5aa..f9458fff6a6 100644
--- a/test/jdk/java/net/httpclient/BasicAuthTest.java
+++ b/test/jdk/java/net/httpclient/BasicAuthTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2015, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2015, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -26,7 +26,7 @@
  * @bug 8087112
  * @library /test/lib /test/jdk/java/net/httpclient/lib
  * @build jdk.httpclient.test.lib.common.HttpServerAdapters jdk.test.lib.net.SimpleSSLContext
- * @run main/othervm BasicAuthTest
+ * @run main/othervm ${test.main.class}
  * @summary Basic Authentication Test
  */
 
diff --git a/test/jdk/java/net/httpclient/BasicHTTP2Test.java b/test/jdk/java/net/httpclient/BasicHTTP2Test.java
index 4175aceea3d..6f53dd1081c 100644
--- a/test/jdk/java/net/httpclient/BasicHTTP2Test.java
+++ b/test/jdk/java/net/httpclient/BasicHTTP2Test.java
@@ -29,7 +29,7 @@
  *        ReferenceTracker
  * @run junit/othervm -Djdk.internal.httpclient.debug=true
  *                     -Djdk.httpclient.HttpClient.log=requests,responses,errors
- *                     BasicHTTP2Test
+ *                     ${test.main.class}
  * @summary Basic HTTP/2 test when HTTP/3 is requested
  */
 
diff --git a/test/jdk/java/net/httpclient/BasicHTTP3Test.java b/test/jdk/java/net/httpclient/BasicHTTP3Test.java
index aec21e421f9..b3764016818 100644
--- a/test/jdk/java/net/httpclient/BasicHTTP3Test.java
+++ b/test/jdk/java/net/httpclient/BasicHTTP3Test.java
@@ -76,7 +76,7 @@ import org.junit.jupiter.params.provider.MethodSource;
  * @run junit/othervm -Djdk.internal.httpclient.debug=true
  *                     -Djdk.httpclient.HttpClient.log=requests,responses,errors
  *                      -Djavax.net.debug=all
- *                     BasicHTTP3Test
+ *                     ${test.main.class}
  * @summary Basic HTTP/3 test
  */
 public class BasicHTTP3Test implements HttpServerAdapters {
diff --git a/test/jdk/java/net/httpclient/BasicRedirectTest.java b/test/jdk/java/net/httpclient/BasicRedirectTest.java
index d873a64bb1b..44e3cadd8cd 100644
--- a/test/jdk/java/net/httpclient/BasicRedirectTest.java
+++ b/test/jdk/java/net/httpclient/BasicRedirectTest.java
@@ -29,7 +29,7 @@
  * @run junit/othervm
  *       -Djdk.httpclient.HttpClient.log=trace,headers,requests
  *       -Djdk.internal.httpclient.debug=true
- *       BasicRedirectTest
+ *       ${test.main.class}
  */
 
 import java.io.IOException;
diff --git a/test/jdk/java/net/httpclient/BodyProcessorInputStreamTest.java b/test/jdk/java/net/httpclient/BodyProcessorInputStreamTest.java
index 1f316c2a64d..c82910cc76b 100644
--- a/test/jdk/java/net/httpclient/BodyProcessorInputStreamTest.java
+++ b/test/jdk/java/net/httpclient/BodyProcessorInputStreamTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2017, 2023, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2017, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -41,7 +41,7 @@ import static java.lang.System.err;
  * @test
  * @bug 8187503
  * @summary An example on how to read a response body with InputStream.
- * @run main/othervm/manual -Dtest.debug=true BodyProcessorInputStreamTest
+ * @run main/othervm/manual -Dtest.debug=true ${test.main.class}
  * @author daniel fuchs
  */
 public class BodyProcessorInputStreamTest {
diff --git a/test/jdk/java/net/httpclient/BodySubscribersTest.java b/test/jdk/java/net/httpclient/BodySubscribersTest.java
index abd86693b83..f27642a47a6 100644
--- a/test/jdk/java/net/httpclient/BodySubscribersTest.java
+++ b/test/jdk/java/net/httpclient/BodySubscribersTest.java
@@ -25,7 +25,7 @@
  * @test
  * @summary Basic test for the standard BodySubscribers default behavior
  * @bug 8225583 8334028
- * @run junit BodySubscribersTest
+ * @run junit ${test.main.class}
  */
 
 import java.net.http.HttpResponse.BodySubscriber;
diff --git a/test/jdk/java/net/httpclient/BufferSize1Test.java b/test/jdk/java/net/httpclient/BufferSize1Test.java
index e4f2b998cc7..2d7f34f315a 100644
--- a/test/jdk/java/net/httpclient/BufferSize1Test.java
+++ b/test/jdk/java/net/httpclient/BufferSize1Test.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2025, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -54,7 +54,7 @@ import static org.junit.jupiter.api.Assertions.assertTrue;
  *          to its lowest possible value, 1, does not wedge the client
  * @library /test/jdk/java/net/httpclient/lib
  *          /test/lib
- * @run junit/othervm -Djdk.httpclient.bufsize=1 BufferSize1Test
+ * @run junit/othervm -Djdk.httpclient.bufsize=1 ${test.main.class}
  */
 
 class BufferSize1Test implements HttpServerAdapters {
diff --git a/test/jdk/java/net/httpclient/BufferSizePropertyClampTest.java b/test/jdk/java/net/httpclient/BufferSizePropertyClampTest.java
index d9695dce3cb..f5f77bb4778 100644
--- a/test/jdk/java/net/httpclient/BufferSizePropertyClampTest.java
+++ b/test/jdk/java/net/httpclient/BufferSizePropertyClampTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2025, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -49,15 +49,15 @@ import static org.junit.jupiter.api.Assertions.assertEquals;
  * @run junit/othervm
  *      -Djdk.httpclient.HttpClient.log=errors
  *      -Djdk.httpclient.bufsize=-1
- *      BufferSizePropertyClampTest
+ *      ${test.main.class}
  * @run junit/othervm
  *      -Djdk.httpclient.HttpClient.log=errors
  *      -Djdk.httpclient.bufsize=0
- *      BufferSizePropertyClampTest
+ *      ${test.main.class}
  * @run junit/othervm
  *      -Djdk.httpclient.HttpClient.log=errors
  *      -Djdk.httpclient.bufsize=16385
- *      BufferSizePropertyClampTest
+ *      ${test.main.class}
  */
 
 class BufferSizePropertyClampTest {
diff --git a/test/jdk/java/net/httpclient/BufferingSubscriberCancelTest.java b/test/jdk/java/net/httpclient/BufferingSubscriberCancelTest.java
index 4d73ec31280..dbcfae4d476 100644
--- a/test/jdk/java/net/httpclient/BufferingSubscriberCancelTest.java
+++ b/test/jdk/java/net/httpclient/BufferingSubscriberCancelTest.java
@@ -46,7 +46,7 @@ import org.junit.jupiter.params.provider.MethodSource;
 /*
  * @test
  * @summary Direct test for HttpResponse.BodySubscriber.buffering() cancellation
- * @run junit/othervm BufferingSubscriberCancelTest
+ * @run junit/othervm ${test.main.class}
  */
 
 public class BufferingSubscriberCancelTest {
diff --git a/test/jdk/java/net/httpclient/BufferingSubscriberErrorCompleteTest.java b/test/jdk/java/net/httpclient/BufferingSubscriberErrorCompleteTest.java
index 255946232be..5895df7d3dc 100644
--- a/test/jdk/java/net/httpclient/BufferingSubscriberErrorCompleteTest.java
+++ b/test/jdk/java/net/httpclient/BufferingSubscriberErrorCompleteTest.java
@@ -44,7 +44,7 @@ import org.junit.jupiter.params.provider.MethodSource;
 /*
  * @test
  * @summary Test for HttpResponse.BodySubscriber.buffering() onError/onComplete
- * @run junit/othervm BufferingSubscriberErrorCompleteTest
+ * @run junit/othervm ${test.main.class}
  */
 
 public class BufferingSubscriberErrorCompleteTest {
diff --git a/test/jdk/java/net/httpclient/BufferingSubscriberTest.java b/test/jdk/java/net/httpclient/BufferingSubscriberTest.java
index bb33b18ed9c..7957c7ab6ae 100644
--- a/test/jdk/java/net/httpclient/BufferingSubscriberTest.java
+++ b/test/jdk/java/net/httpclient/BufferingSubscriberTest.java
@@ -55,7 +55,7 @@ import org.junit.jupiter.params.provider.MethodSource;
  * @key randomness
  * @library /test/lib
  * @build jdk.test.lib.RandomFactory
- * @run junit/othervm/timeout=480 -Djdk.internal.httpclient.debug=true BufferingSubscriberTest
+ * @run junit/othervm/timeout=480 -Djdk.internal.httpclient.debug=true ${test.main.class}
  */
 
 public class BufferingSubscriberTest {
diff --git a/test/jdk/java/net/httpclient/ByteArrayPublishers.java b/test/jdk/java/net/httpclient/ByteArrayPublishers.java
index 114ebcd18a5..b42c2c4613e 100644
--- a/test/jdk/java/net/httpclient/ByteArrayPublishers.java
+++ b/test/jdk/java/net/httpclient/ByteArrayPublishers.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2019, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2019, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,7 +25,7 @@
  * @test
  * @bug 8222968
  * @summary ByteArrayPublisher is not thread-safe resulting in broken re-use of HttpRequests
- * @run main/othervm -Dsun.net.httpserver.idleInterval=50000 ByteArrayPublishers
+ * @run main/othervm -Dsun.net.httpserver.idleInterval=50000 ${test.main.class}
  */
 
 import java.net.InetAddress;
diff --git a/test/jdk/java/net/httpclient/CancelRequestTest.java b/test/jdk/java/net/httpclient/CancelRequestTest.java
index dcb60a55061..f21d13d5e98 100644
--- a/test/jdk/java/net/httpclient/CancelRequestTest.java
+++ b/test/jdk/java/net/httpclient/CancelRequestTest.java
@@ -31,7 +31,7 @@
  *        ReferenceTracker CancelRequestTest
  * @run junit/othervm -Djdk.internal.httpclient.debug=true
  *                     -Djdk.httpclient.enableAllMethodRetry=true
- *                     CancelRequestTest
+ *                     ${test.main.class}
  */
 // *                     -Dseed=3582896013206826205L
 // *                     -Dseed=5784221742235559231L
diff --git a/test/jdk/java/net/httpclient/CancelStreamedBodyTest.java b/test/jdk/java/net/httpclient/CancelStreamedBodyTest.java
index 48f23ebf370..000602d3c0c 100644
--- a/test/jdk/java/net/httpclient/CancelStreamedBodyTest.java
+++ b/test/jdk/java/net/httpclient/CancelStreamedBodyTest.java
@@ -30,7 +30,7 @@
  * @build jdk.httpclient.test.lib.common.HttpServerAdapters jdk.test.lib.net.SimpleSSLContext
  *        ReferenceTracker CancelStreamedBodyTest
  * @run junit/othervm -Djdk.internal.httpclient.debug=true
- *                     CancelStreamedBodyTest
+ *                     ${test.main.class}
  */
 import jdk.test.lib.net.SimpleSSLContext;
 
diff --git a/test/jdk/java/net/httpclient/CancelledPartialResponseTest.java b/test/jdk/java/net/httpclient/CancelledPartialResponseTest.java
index 33df36100ad..5b4d2bff1c2 100644
--- a/test/jdk/java/net/httpclient/CancelledPartialResponseTest.java
+++ b/test/jdk/java/net/httpclient/CancelledPartialResponseTest.java
@@ -29,7 +29,7 @@
  * @library /test/lib /test/jdk/java/net/httpclient/lib
  * @build jdk.httpclient.test.lib.common.HttpServerAdapters
  * @run junit/othervm/timeout=40  -Djdk.internal.httpclient.debug=false -Djdk.httpclient.HttpClient.log=trace,errors,headers
- *                              CancelledPartialResponseTest
+ *                              ${test.main.class}
  */
 
 import jdk.httpclient.test.lib.common.HttpServerAdapters;
diff --git a/test/jdk/java/net/httpclient/CancelledResponse.java b/test/jdk/java/net/httpclient/CancelledResponse.java
index 5449a68418a..d1ead0abad6 100644
--- a/test/jdk/java/net/httpclient/CancelledResponse.java
+++ b/test/jdk/java/net/httpclient/CancelledResponse.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2015, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2015, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -61,8 +61,8 @@ import static java.net.http.HttpOption.Http3DiscoveryMode.ALT_SVC;
  * @modules java.net.http/jdk.internal.net.http.common
  * @build jdk.test.lib.net.SimpleSSLContext
  * @build MockServer ReferenceTracker
- * @run main/othervm/timeout=480 CancelledResponse
- * @run main/othervm/timeout=480 CancelledResponse SSL
+ * @run main/othervm/timeout=480 ${test.main.class}
+ * @run main/othervm/timeout=480 ${test.main.class} SSL
  */
 
 /**
diff --git a/test/jdk/java/net/httpclient/CancelledResponse2.java b/test/jdk/java/net/httpclient/CancelledResponse2.java
index 6604fadea20..d08fd027bb5 100644
--- a/test/jdk/java/net/httpclient/CancelledResponse2.java
+++ b/test/jdk/java/net/httpclient/CancelledResponse2.java
@@ -66,7 +66,7 @@ import org.junit.jupiter.params.provider.MethodSource;
  * @library /test/lib /test/jdk/java/net/httpclient/lib
  * @build jdk.test.lib.net.SimpleSSLContext
  * @compile ReferenceTracker.java
- * @run junit/othervm -Djdk.internal.httpclient.debug=true CancelledResponse2
+ * @run junit/othervm -Djdk.internal.httpclient.debug=true ${test.main.class}
  */
 // -Djdk.internal.httpclient.debug=true
 public class CancelledResponse2 implements HttpServerAdapters {
diff --git a/test/jdk/java/net/httpclient/ConcurrentResponses.java b/test/jdk/java/net/httpclient/ConcurrentResponses.java
index 53c85b8e383..e1f48e1251b 100644
--- a/test/jdk/java/net/httpclient/ConcurrentResponses.java
+++ b/test/jdk/java/net/httpclient/ConcurrentResponses.java
@@ -31,7 +31,7 @@
  *        jdk.httpclient.test.lib.common.TestServerConfigurator
  * @run junit/othervm
  *      -Djdk.internal.httpclient.debug=true
- *      ConcurrentResponses
+ *      ${test.main.class}
  */
 
 //*      -Djdk.internal.httpclient.HttpClient.log=all
diff --git a/test/jdk/java/net/httpclient/ConnectExceptionTest.java b/test/jdk/java/net/httpclient/ConnectExceptionTest.java
index 0745e2af934..22ba26c3ac8 100644
--- a/test/jdk/java/net/httpclient/ConnectExceptionTest.java
+++ b/test/jdk/java/net/httpclient/ConnectExceptionTest.java
@@ -25,7 +25,7 @@
  * @test
  * @summary Expect ConnectException for all non-security related connect errors
  * @bug 8204864
- * @run junit/othervm -Djdk.net.hosts.file=HostFileDoesNotExist ConnectExceptionTest
+ * @run junit/othervm -Djdk.net.hosts.file=HostFileDoesNotExist ${test.main.class}
  */
 
 import java.io.IOException;
diff --git a/test/jdk/java/net/httpclient/ConnectTimeoutHandshakeAsync.java b/test/jdk/java/net/httpclient/ConnectTimeoutHandshakeAsync.java
index e1f4aee1d51..d91c73f97a1 100644
--- a/test/jdk/java/net/httpclient/ConnectTimeoutHandshakeAsync.java
+++ b/test/jdk/java/net/httpclient/ConnectTimeoutHandshakeAsync.java
@@ -33,7 +33,7 @@ import org.junit.jupiter.params.provider.MethodSource;
  * @bug 8208391
  * @library /test/lib
  * @build AbstractConnectTimeoutHandshake
- * @run junit/othervm ConnectTimeoutHandshakeAsync
+ * @run junit/othervm ${test.main.class}
  */
 
 public class ConnectTimeoutHandshakeAsync
diff --git a/test/jdk/java/net/httpclient/ConnectTimeoutHandshakeSync.java b/test/jdk/java/net/httpclient/ConnectTimeoutHandshakeSync.java
index eb571b2d16c..fac007df8ad 100644
--- a/test/jdk/java/net/httpclient/ConnectTimeoutHandshakeSync.java
+++ b/test/jdk/java/net/httpclient/ConnectTimeoutHandshakeSync.java
@@ -33,7 +33,7 @@ import org.junit.jupiter.params.provider.MethodSource;
  * @bug 8208391
  * @library /test/lib
  * @build AbstractConnectTimeoutHandshake
- * @run junit/othervm ConnectTimeoutHandshakeSync
+ * @run junit/othervm ${test.main.class}
  */
 
 public class ConnectTimeoutHandshakeSync
diff --git a/test/jdk/java/net/httpclient/ContentLengthHeaderTest.java b/test/jdk/java/net/httpclient/ContentLengthHeaderTest.java
index 01c166dcb1b..c90ba1ffdf3 100644
--- a/test/jdk/java/net/httpclient/ContentLengthHeaderTest.java
+++ b/test/jdk/java/net/httpclient/ContentLengthHeaderTest.java
@@ -33,7 +33,7 @@
  * @run junit/othervm
  *          -Djdk.httpclient.allowRestrictedHeaders=content-length
  *          -Djdk.internal.httpclient.debug=true
- *          ContentLengthHeaderTest
+ *          ${test.main.class}
  */
 
 
diff --git a/test/jdk/java/net/httpclient/CookieHeaderTest.java b/test/jdk/java/net/httpclient/CookieHeaderTest.java
index 62e62680e03..74faf8ec801 100644
--- a/test/jdk/java/net/httpclient/CookieHeaderTest.java
+++ b/test/jdk/java/net/httpclient/CookieHeaderTest.java
@@ -30,7 +30,7 @@
  * @run junit/othervm
  *       -Djdk.tls.acknowledgeCloseNotify=true
  *       -Djdk.httpclient.HttpClient.log=trace,headers,requests
- *       CookieHeaderTest
+ *       ${test.main.class}
  */
 
 import jdk.test.lib.net.SimpleSSLContext;
diff --git a/test/jdk/java/net/httpclient/CustomRequestPublisher.java b/test/jdk/java/net/httpclient/CustomRequestPublisher.java
index c8d22419852..58acfc4feac 100644
--- a/test/jdk/java/net/httpclient/CustomRequestPublisher.java
+++ b/test/jdk/java/net/httpclient/CustomRequestPublisher.java
@@ -26,7 +26,7 @@
  * @summary Checks correct handling of Publishers that call onComplete without demand
  * @library /test/lib /test/jdk/java/net/httpclient/lib
  * @build jdk.httpclient.test.lib.http2.Http2TestServer jdk.test.lib.net.SimpleSSLContext
- * @run junit/othervm CustomRequestPublisher
+ * @run junit/othervm ${test.main.class}
  */
 
 import java.net.InetAddress;
diff --git a/test/jdk/java/net/httpclient/CustomResponseSubscriber.java b/test/jdk/java/net/httpclient/CustomResponseSubscriber.java
index b2695271035..ef5d0a30552 100644
--- a/test/jdk/java/net/httpclient/CustomResponseSubscriber.java
+++ b/test/jdk/java/net/httpclient/CustomResponseSubscriber.java
@@ -27,7 +27,7 @@
  * @library /test/lib /test/jdk/java/net/httpclient/lib
  * @build jdk.test.lib.net.SimpleSSLContext jdk.httpclient.test.lib.http2.Http2TestServer
  *        jdk.httpclient.test.lib.common.TestServerConfigurator
- * @run junit/othervm CustomResponseSubscriber
+ * @run junit/othervm ${test.main.class}
  */
 
 import java.io.IOException;
diff --git a/test/jdk/java/net/httpclient/DebugLoggerTest.java b/test/jdk/java/net/httpclient/DebugLoggerTest.java
index 8d81e5cbe69..a5d16e65993 100644
--- a/test/jdk/java/net/httpclient/DebugLoggerTest.java
+++ b/test/jdk/java/net/httpclient/DebugLoggerTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2023, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2023, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -52,17 +52,17 @@ import static java.nio.charset.StandardCharsets.UTF_8;
  * @library /test/lib /test/jdk/java/net/httpclient/lib
  * @build jdk.httpclient.test.lib.common.HttpServerAdapters jdk.test.lib.net.SimpleSSLContext
  *        DebugLoggerTest
- * @run main/othervm  DebugLoggerTest
- * @run main/othervm -Djdk.internal.httpclient.debug=errr  DebugLoggerTest
- * @run main/othervm -Djdk.internal.httpclient.debug=err  DebugLoggerTest ERR
- * @run main/othervm -Djdk.internal.httpclient.debug=out  DebugLoggerTest OUT
- * @run main/othervm -Djdk.internal.httpclient.debug=log  DebugLoggerTest LOG
- * @run main/othervm -Djdk.internal.httpclient.debug=true DebugLoggerTest ERR LOG
- * @run main/othervm -Djdk.internal.httpclient.debug=err,OUT  DebugLoggerTest ERR OUT
- * @run main/othervm -Djdk.internal.httpclient.debug=err,out,log DebugLoggerTest ERR OUT LOG
- * @run main/othervm -Djdk.internal.httpclient.debug=true,log DebugLoggerTest ERR LOG
- * @run main/othervm -Djdk.internal.httpclient.debug=true,out DebugLoggerTest ERR OUT LOG
- * @run main/othervm -Djdk.internal.httpclient.debug=err,OUT,foo  DebugLoggerTest ERR OUT
+ * @run main/othervm  ${test.main.class}
+ * @run main/othervm -Djdk.internal.httpclient.debug=errr  ${test.main.class}
+ * @run main/othervm -Djdk.internal.httpclient.debug=err  ${test.main.class} ERR
+ * @run main/othervm -Djdk.internal.httpclient.debug=out  ${test.main.class} OUT
+ * @run main/othervm -Djdk.internal.httpclient.debug=log  ${test.main.class} LOG
+ * @run main/othervm -Djdk.internal.httpclient.debug=true ${test.main.class} ERR LOG
+ * @run main/othervm -Djdk.internal.httpclient.debug=err,OUT  ${test.main.class} ERR OUT
+ * @run main/othervm -Djdk.internal.httpclient.debug=err,out,log ${test.main.class} ERR OUT LOG
+ * @run main/othervm -Djdk.internal.httpclient.debug=true,log ${test.main.class} ERR LOG
+ * @run main/othervm -Djdk.internal.httpclient.debug=true,out ${test.main.class} ERR OUT LOG
+ * @run main/othervm -Djdk.internal.httpclient.debug=err,OUT,foo  ${test.main.class} ERR OUT
  */
 public class DebugLoggerTest {
     static final PrintStream stdErr = System.err;
diff --git a/test/jdk/java/net/httpclient/DependentActionsTest.java b/test/jdk/java/net/httpclient/DependentActionsTest.java
index fcfbb393e5a..571e124ca5d 100644
--- a/test/jdk/java/net/httpclient/DependentActionsTest.java
+++ b/test/jdk/java/net/httpclient/DependentActionsTest.java
@@ -31,7 +31,7 @@
  *        DependentActionsTest
  * @run junit/othervm -Djdk.internal.httpclient.debug=true
  *                     -Djdk.httpclient.quic.maxPtoBackoff=9
- *                      DependentActionsTest
+ *                      ${test.main.class}
   */
 
 import java.io.BufferedReader;
diff --git a/test/jdk/java/net/httpclient/DependentPromiseActionsTest.java b/test/jdk/java/net/httpclient/DependentPromiseActionsTest.java
index e045f4e22f1..42d2b509c1b 100644
--- a/test/jdk/java/net/httpclient/DependentPromiseActionsTest.java
+++ b/test/jdk/java/net/httpclient/DependentPromiseActionsTest.java
@@ -29,7 +29,7 @@
  * @library /test/lib /test/jdk/java/net/httpclient/lib
  * @build jdk.httpclient.test.lib.common.HttpServerAdapters jdk.test.lib.net.SimpleSSLContext
  *        DependentPromiseActionsTest
- * @run junit/othervm -Djdk.internal.httpclient.debug=true DependentPromiseActionsTest
+ * @run junit/othervm -Djdk.internal.httpclient.debug=true ${test.main.class}
  */
 
 import java.io.BufferedReader;
diff --git a/test/jdk/java/net/httpclient/DigestEchoClient.java b/test/jdk/java/net/httpclient/DigestEchoClient.java
index 6df4ccac9fb..6fbffab95ea 100644
--- a/test/jdk/java/net/httpclient/DigestEchoClient.java
+++ b/test/jdk/java/net/httpclient/DigestEchoClient.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -72,10 +72,10 @@ import static java.net.http.HttpOption.H3_DISCOVERY;
  * @library /test/lib /test/jdk/java/net/httpclient/lib
  * @build jdk.httpclient.test.lib.common.HttpServerAdapters jdk.test.lib.net.SimpleSSLContext
  *        DigestEchoServer ReferenceTracker DigestEchoClient
- * @run main/othervm DigestEchoClient
+ * @run main/othervm ${test.main.class}
  * @run main/othervm -Djdk.http.auth.proxying.disabledSchemes=
  *                   -Djdk.http.auth.tunneling.disabledSchemes=
- *                   DigestEchoClient
+ *                   ${test.main.class}
  */
 
 public class DigestEchoClient {
diff --git a/test/jdk/java/net/httpclient/DigestEchoClientSSL.java b/test/jdk/java/net/httpclient/DigestEchoClientSSL.java
index ecf043f58c8..25dfaf71fc0 100644
--- a/test/jdk/java/net/httpclient/DigestEchoClientSSL.java
+++ b/test/jdk/java/net/httpclient/DigestEchoClientSSL.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2023, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -33,17 +33,17 @@
  * @run main/othervm/timeout=300
  *          -Djdk.internal.httpclient.debug=err
  *          -Djdk.httpclient.HttpClient.log=headers
- *          DigestEchoClientSSL SSL SERVER307
+ *          ${test.main.class} SSL SERVER307
  * @run main/othervm/timeout=300
  *          -Djdk.httpclient.http3.maxDirectConnectionTimeout=100
  *          -Djdk.httpclient.HttpClient.log=headers
- *          DigestEchoClientSSL SSL SERVER PROXY
+ *          ${test.main.class} SSL SERVER PROXY
  * @run main/othervm/timeout=300
  *          -Djdk.http.auth.proxying.disabledSchemes=
  *          -Djdk.http.auth.tunneling.disabledSchemes=
  *          -Djdk.httpclient.http3.maxDirectConnectionTimeout=100
  *          -Djdk.httpclient.HttpClient.log=headers
- *          DigestEchoClientSSL SSL PROXY
+ *          ${test.main.class} SSL PROXY
  *
  */
 
diff --git a/test/jdk/java/net/httpclient/DurationOverflowTest.java b/test/jdk/java/net/httpclient/DurationOverflowTest.java
index 1beb31f74e5..12a852262a6 100644
--- a/test/jdk/java/net/httpclient/DurationOverflowTest.java
+++ b/test/jdk/java/net/httpclient/DurationOverflowTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2025, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -64,7 +64,7 @@ import static jdk.httpclient.test.lib.common.HttpServerAdapters.createClientBuil
  * @library /test/jdk/java/net/httpclient/lib
  *          /test/lib
  *
- * @run junit DurationOverflowTest
+ * @run junit ${test.main.class}
  */
 
 /*
@@ -81,19 +81,19 @@ import static jdk.httpclient.test.lib.common.HttpServerAdapters.createClientBuil
  *
  * @run junit/othervm
  *      -Djdk.httpclient.keepalive.timeout=9223372036854775807
- *      DurationOverflowTest
+ *      ${test.main.class}
  *
  * @comment `h3` infra is also enabled for this test since `j.h.k.timeout.h3`
  *          defaults to `j.h.k.timeout.h2`
  * @run junit/othervm
  *      -Djdk.httpclient.keepalive.timeout.h2=9223372036854775807
  *      -DallowedInfras=h2,h2s,h3
- *      DurationOverflowTest
+ *      ${test.main.class}
  *
  * @run junit/othervm
  *      -Djdk.httpclient.keepalive.timeout.h3=9223372036854775807
  *      -DallowedInfras=h3
- *      DurationOverflowTest
+ *      ${test.main.class}
  */
 
 public class DurationOverflowTest {
diff --git a/test/jdk/java/net/httpclient/EmptyAuthenticate.java b/test/jdk/java/net/httpclient/EmptyAuthenticate.java
index 81bbbf3ca5b..4da5592fb85 100644
--- a/test/jdk/java/net/httpclient/EmptyAuthenticate.java
+++ b/test/jdk/java/net/httpclient/EmptyAuthenticate.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2021, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2021, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -29,7 +29,7 @@
  *          /test/lib
  * @build jdk.httpclient.test.lib.common.HttpServerAdapters
  *        jdk.test.lib.net.SimpleSSLContext
- * @run junit EmptyAuthenticate
+ * @run junit ${test.main.class}
  */
 
 import jdk.httpclient.test.lib.common.HttpServerAdapters;
diff --git a/test/jdk/java/net/httpclient/EncodedCharsInURI.java b/test/jdk/java/net/httpclient/EncodedCharsInURI.java
index 19b0a1d651b..3c8483a4c6d 100644
--- a/test/jdk/java/net/httpclient/EncodedCharsInURI.java
+++ b/test/jdk/java/net/httpclient/EncodedCharsInURI.java
@@ -32,7 +32,7 @@
  * @run junit/othervm
  *        -Djdk.tls.acknowledgeCloseNotify=true
  *        -Djdk.internal.httpclient.debug=true
- *        -Djdk.httpclient.HttpClient.log=headers,errors EncodedCharsInURI
+ *        -Djdk.httpclient.HttpClient.log=headers,errors ${test.main.class}
  */
 //*        -Djdk.internal.httpclient.debug=true
 
diff --git a/test/jdk/java/net/httpclient/EscapedOctetsInURI.java b/test/jdk/java/net/httpclient/EscapedOctetsInURI.java
index 6ef71b7d22d..406f82501b1 100644
--- a/test/jdk/java/net/httpclient/EscapedOctetsInURI.java
+++ b/test/jdk/java/net/httpclient/EscapedOctetsInURI.java
@@ -29,7 +29,7 @@
  * @build jdk.httpclient.test.lib.http2.Http2TestServer jdk.test.lib.net.SimpleSSLContext
  * @run junit/othervm
  *       -Djdk.httpclient.HttpClient.log=reqeusts,headers
- *       EscapedOctetsInURI
+ *       ${test.main.class}
  */
 
 import java.io.Closeable;
diff --git a/test/jdk/java/net/httpclient/ExecutorShutdown.java b/test/jdk/java/net/httpclient/ExecutorShutdown.java
index a46ea66f3ae..d12a9f3e5d7 100644
--- a/test/jdk/java/net/httpclient/ExecutorShutdown.java
+++ b/test/jdk/java/net/httpclient/ExecutorShutdown.java
@@ -32,7 +32,7 @@
  * @run junit/othervm
  *       -Djdk.internal.httpclient.debug=true
  *       -Djdk.httpclient.HttpClient.log=trace,headers,requests
- *       ExecutorShutdown
+ *       ${test.main.class}
  */
 // -Djdk.internal.httpclient.debug=true
 
diff --git a/test/jdk/java/net/httpclient/ExpectContinue.java b/test/jdk/java/net/httpclient/ExpectContinue.java
index e9ae894f3e1..656a887002f 100644
--- a/test/jdk/java/net/httpclient/ExpectContinue.java
+++ b/test/jdk/java/net/httpclient/ExpectContinue.java
@@ -28,7 +28,7 @@
  * @build jdk.test.lib.net.SimpleSSLContext jdk.httpclient.test.lib.common.TestServerConfigurator
  * @modules java.net.http/jdk.internal.net.http.common
  *          jdk.httpserver
- * @run junit/othervm ExpectContinue
+ * @run junit/othervm ${test.main.class}
  */
 
 import com.sun.net.httpserver.HttpExchange;
diff --git a/test/jdk/java/net/httpclient/ExpectContinueTest.java b/test/jdk/java/net/httpclient/ExpectContinueTest.java
index 56fa363870a..0233ffb069c 100644
--- a/test/jdk/java/net/httpclient/ExpectContinueTest.java
+++ b/test/jdk/java/net/httpclient/ExpectContinueTest.java
@@ -27,7 +27,7 @@
  * @bug 8286171 8307648
  * @library /test/lib /test/jdk/java/net/httpclient/lib
  * @build jdk.httpclient.test.lib.common.HttpServerAdapters
- * @run junit/othervm -Djdk.internal.httpclient.debug=true -Djdk.httpclient.HttpClient.log=errors ExpectContinueTest
+ * @run junit/othervm -Djdk.internal.httpclient.debug=true -Djdk.httpclient.HttpClient.log=errors ${test.main.class}
  */
 
 
diff --git a/test/jdk/java/net/httpclient/FilePublisherTest.java b/test/jdk/java/net/httpclient/FilePublisherTest.java
index 292f770fc30..dafb6e593b2 100644
--- a/test/jdk/java/net/httpclient/FilePublisherTest.java
+++ b/test/jdk/java/net/httpclient/FilePublisherTest.java
@@ -29,7 +29,7 @@
  * @library /test/lib /test/jdk/java/net/httpclient/lib
  * @build jdk.httpclient.test.lib.common.HttpServerAdapters
  *        jdk.test.lib.net.SimpleSSLContext
- * @run junit/othervm FilePublisherTest
+ * @run junit/othervm ${test.main.class}
  */
 
 import jdk.test.lib.net.SimpleSSLContext;
diff --git a/test/jdk/java/net/httpclient/FlowAdapterPublisherTest.java b/test/jdk/java/net/httpclient/FlowAdapterPublisherTest.java
index 7fd3061aa3c..31dd6d560de 100644
--- a/test/jdk/java/net/httpclient/FlowAdapterPublisherTest.java
+++ b/test/jdk/java/net/httpclient/FlowAdapterPublisherTest.java
@@ -64,7 +64,7 @@ import org.junit.jupiter.params.provider.MethodSource;
  * @library /test/lib /test/jdk/java/net/httpclient/lib
  * @build jdk.httpclient.test.lib.common.HttpServerAdapters
  *        jdk.test.lib.net.SimpleSSLContext
- * @run junit/othervm -Djdk.internal.httpclient.debug=err FlowAdapterPublisherTest
+ * @run junit/othervm -Djdk.internal.httpclient.debug=err ${test.main.class}
  */
 
 public class FlowAdapterPublisherTest implements HttpServerAdapters {
diff --git a/test/jdk/java/net/httpclient/FlowAdapterSubscriberTest.java b/test/jdk/java/net/httpclient/FlowAdapterSubscriberTest.java
index 32003023d7f..e85a752940c 100644
--- a/test/jdk/java/net/httpclient/FlowAdapterSubscriberTest.java
+++ b/test/jdk/java/net/httpclient/FlowAdapterSubscriberTest.java
@@ -74,7 +74,7 @@ import org.junit.jupiter.params.provider.MethodSource;
  * @library /test/lib /test/jdk/java/net/httpclient/lib
  * @build jdk.httpclient.test.lib.common.HttpServerAdapters
  *        jdk.test.lib.net.SimpleSSLContext
- * @run junit/othervm -Djdk.internal.httpclient.debug=true FlowAdapterSubscriberTest
+ * @run junit/othervm -Djdk.internal.httpclient.debug=true ${test.main.class}
  */
 
 public class FlowAdapterSubscriberTest implements HttpServerAdapters {
diff --git a/test/jdk/java/net/httpclient/ForbiddenHeadTest.java b/test/jdk/java/net/httpclient/ForbiddenHeadTest.java
index f2011766b2b..0a6824d289d 100644
--- a/test/jdk/java/net/httpclient/ForbiddenHeadTest.java
+++ b/test/jdk/java/net/httpclient/ForbiddenHeadTest.java
@@ -32,7 +32,7 @@
  *       -Djdk.http.auth.tunneling.disabledSchemes
  *       -Djdk.httpclient.HttpClient.log=headers,requests
  *       -Djdk.internal.httpclient.debug=true
- *       ForbiddenHeadTest
+ *       ${test.main.class}
  */
 
 import jdk.test.lib.net.SimpleSSLContext;
diff --git a/test/jdk/java/net/httpclient/GZIPInputStreamTest.java b/test/jdk/java/net/httpclient/GZIPInputStreamTest.java
index 1cbb24d81ce..8e34f100524 100644
--- a/test/jdk/java/net/httpclient/GZIPInputStreamTest.java
+++ b/test/jdk/java/net/httpclient/GZIPInputStreamTest.java
@@ -27,7 +27,7 @@
  * @summary Tests that you can map an InputStream to a GZIPInputStream
  * @library /test/lib /test/jdk/java/net/httpclient/lib
  * @build jdk.test.lib.net.SimpleSSLContext jdk.httpclient.test.lib.common.HttpServerAdapters ReferenceTracker
- * @run junit/othervm GZIPInputStreamTest
+ * @run junit/othervm ${test.main.class}
  */
 
 import com.sun.net.httpserver.HttpServer;
diff --git a/test/jdk/java/net/httpclient/HandshakeFailureTest.java b/test/jdk/java/net/httpclient/HandshakeFailureTest.java
index e07dfacbd85..e9e23753ed3 100644
--- a/test/jdk/java/net/httpclient/HandshakeFailureTest.java
+++ b/test/jdk/java/net/httpclient/HandshakeFailureTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2017, 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2017, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -50,15 +50,15 @@ import javax.net.ssl.SSLSocket;
 /**
  * @test
  * @bug 8238990 8258951
- * @run main/othervm -Djdk.internal.httpclient.debug=true HandshakeFailureTest TLSv1.2
- * @run main/othervm -Djdk.internal.httpclient.debug=true HandshakeFailureTest TLSv1.3
+ * @run main/othervm -Djdk.internal.httpclient.debug=true ${test.main.class} TLSv1.2
+ * @run main/othervm -Djdk.internal.httpclient.debug=true ${test.main.class} TLSv1.3
  * @summary Verify SSLHandshakeException is received when the handshake fails,
  * either because the server closes (EOF) the connection during handshaking,
  * or no cipher suite can be negotiated (TLSv1.2) or no available authentication
  * scheme (TLSv1.3).
  */
 // To switch on debugging use:
-// @run main/othervm -Djdk.internal.httpclient.debug=true HandshakeFailureTest
+// @run main/othervm -Djdk.internal.httpclient.debug=true ${test.main.class}
 public class HandshakeFailureTest {
 
     // The number of iterations each testXXXClient performs. Can be increased
diff --git a/test/jdk/java/net/httpclient/HeadTest.java b/test/jdk/java/net/httpclient/HeadTest.java
index 3a52cd101b8..c0bef240520 100644
--- a/test/jdk/java/net/httpclient/HeadTest.java
+++ b/test/jdk/java/net/httpclient/HeadTest.java
@@ -27,7 +27,7 @@
  * @summary Tests Client handles HEAD and 304 responses correctly.
  * @library /test/lib /test/jdk/java/net/httpclient/lib
  * @build jdk.test.lib.net.SimpleSSLContext
- * @run junit/othervm -Djdk.httpclient.HttpClient.log=trace,headers,requests HeadTest
+ * @run junit/othervm -Djdk.httpclient.HttpClient.log=trace,headers,requests ${test.main.class}
  */
 
 import jdk.test.lib.net.SimpleSSLContext;
diff --git a/test/jdk/java/net/httpclient/HeadersLowerCaseTest.java b/test/jdk/java/net/httpclient/HeadersLowerCaseTest.java
index 00a709a3387..b082f59dd23 100644
--- a/test/jdk/java/net/httpclient/HeadersLowerCaseTest.java
+++ b/test/jdk/java/net/httpclient/HeadersLowerCaseTest.java
@@ -60,7 +60,7 @@ import static org.junit.jupiter.api.Assertions.assertThrows;
  * @library /test/lib /test/jdk/java/net/httpclient/lib
  * @build jdk.test.lib.net.SimpleSSLContext
  *        jdk.httpclient.test.lib.common.HttpServerAdapters
- * @run junit/othervm -Djdk.internal.httpclient.debug=true HeadersLowerCaseTest
+ * @run junit/othervm -Djdk.internal.httpclient.debug=true ${test.main.class}
  */
 public class HeadersLowerCaseTest implements HttpServerAdapters {
 
diff --git a/test/jdk/java/net/httpclient/HeadersTest1.java b/test/jdk/java/net/httpclient/HeadersTest1.java
index 26733c1c928..220978b419c 100644
--- a/test/jdk/java/net/httpclient/HeadersTest1.java
+++ b/test/jdk/java/net/httpclient/HeadersTest1.java
@@ -26,7 +26,7 @@
  * @bug 8153142 8195138
  * @modules java.net.http
  *          jdk.httpserver
- * @run junit/othervm HeadersTest1
+ * @run junit/othervm ${test.main.class}
  */
 
 import java.io.IOException;
diff --git a/test/jdk/java/net/httpclient/Http1ChunkedTest.java b/test/jdk/java/net/httpclient/Http1ChunkedTest.java
index f51ccf9fd38..23bcc541a18 100644
--- a/test/jdk/java/net/httpclient/Http1ChunkedTest.java
+++ b/test/jdk/java/net/httpclient/Http1ChunkedTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2020, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -42,7 +42,7 @@ import java.util.concurrent.CompletableFuture;
  * @bug 8243246
  * @summary Verifies that the HttpClient can accept extensions after
  *          chunk length in a chunked response.
- * @run main/othervm Http1ChunkedTest
+ * @run main/othervm ${test.main.class}
  */
 public class Http1ChunkedTest {
 
diff --git a/test/jdk/java/net/httpclient/HttpClientAuthRetryLimitTest.java b/test/jdk/java/net/httpclient/HttpClientAuthRetryLimitTest.java
index 4cfee56e855..7a220c77fda 100644
--- a/test/jdk/java/net/httpclient/HttpClientAuthRetryLimitTest.java
+++ b/test/jdk/java/net/httpclient/HttpClientAuthRetryLimitTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2025, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -28,10 +28,10 @@
  * @summary Auth retry limit system property
  * @library /test/lib /test/jdk/java/net/httpclient/lib
  * @build jdk.httpclient.test.lib.http2.Http2TestServer
- * @run junit HttpClientAuthRetryLimitTest
- * @run junit/othervm -Djdk.httpclient.auth.retrylimit=1 HttpClientAuthRetryLimitTest
- * @run junit/othervm -Djdk.httpclient.auth.retrylimit=0 HttpClientAuthRetryLimitTest
- * @run junit/othervm -Djdk.httpclient.auth.retrylimit=-1 HttpClientAuthRetryLimitTest
+ * @run junit ${test.main.class}
+ * @run junit/othervm -Djdk.httpclient.auth.retrylimit=1 ${test.main.class}
+ * @run junit/othervm -Djdk.httpclient.auth.retrylimit=0 ${test.main.class}
+ * @run junit/othervm -Djdk.httpclient.auth.retrylimit=-1 ${test.main.class}
  */
 
 import jdk.httpclient.test.lib.common.HttpServerAdapters;
diff --git a/test/jdk/java/net/httpclient/HttpClientBuilderTest.java b/test/jdk/java/net/httpclient/HttpClientBuilderTest.java
index a5fb1a39e66..7e5db68b8d3 100644
--- a/test/jdk/java/net/httpclient/HttpClientBuilderTest.java
+++ b/test/jdk/java/net/httpclient/HttpClientBuilderTest.java
@@ -62,7 +62,7 @@ import org.junit.jupiter.api.Test;
  * @summary HttpClient[.Builder] API and behaviour checks
  * @library /test/lib
  * @build jdk.test.lib.net.SimpleSSLContext
- * @run junit HttpClientBuilderTest
+ * @run junit ${test.main.class}
  */
 
 public class HttpClientBuilderTest {
diff --git a/test/jdk/java/net/httpclient/HttpClientClose.java b/test/jdk/java/net/httpclient/HttpClientClose.java
index 0a3fc03424a..aa1f399ba30 100644
--- a/test/jdk/java/net/httpclient/HttpClientClose.java
+++ b/test/jdk/java/net/httpclient/HttpClientClose.java
@@ -34,7 +34,7 @@
  * @run junit/othervm
  *       -Djdk.internal.httpclient.debug=true
  *       -Djdk.httpclient.HttpClient.log=trace,headers,requests
- *       HttpClientClose
+ *       ${test.main.class}
  */
 // -Djdk.internal.httpclient.debug=true
 
diff --git a/test/jdk/java/net/httpclient/HttpClientExceptionTest.java b/test/jdk/java/net/httpclient/HttpClientExceptionTest.java
index dff7219c0c8..dc9f34868bd 100644
--- a/test/jdk/java/net/httpclient/HttpClientExceptionTest.java
+++ b/test/jdk/java/net/httpclient/HttpClientExceptionTest.java
@@ -41,7 +41,7 @@ import org.junit.jupiter.api.Test;
  * @summary The test checks if UncheckedIOException is thrown
  * @build  HttpClientExceptionTest
  * @run junit/othervm -Djava.nio.channels.spi.SelectorProvider=HttpClientExceptionTest$CustomSelectorProvider
- *                      HttpClientExceptionTest
+ *                      ${test.main.class}
  */
 
 public class HttpClientExceptionTest {
diff --git a/test/jdk/java/net/httpclient/HttpClientLocalAddrTest.java b/test/jdk/java/net/httpclient/HttpClientLocalAddrTest.java
index f1e8aecbaa4..a98f180d082 100644
--- a/test/jdk/java/net/httpclient/HttpClientLocalAddrTest.java
+++ b/test/jdk/java/net/httpclient/HttpClientLocalAddrTest.java
@@ -65,7 +65,7 @@ import org.junit.jupiter.params.provider.MethodSource;
  *      -Djdk.httpclient.HttpClient.log=frames,ssl,requests,responses,errors
  *      -Djdk.internal.httpclient.debug=true
  *      -Dsun.net.httpserver.idleInterval=50000
- *      HttpClientLocalAddrTest
+ *      ${test.main.class}
  *
  */
 public class HttpClientLocalAddrTest implements HttpServerAdapters {
diff --git a/test/jdk/java/net/httpclient/HttpClientSNITest.java b/test/jdk/java/net/httpclient/HttpClientSNITest.java
index 1f7377f745d..08f725b0c52 100644
--- a/test/jdk/java/net/httpclient/HttpClientSNITest.java
+++ b/test/jdk/java/net/httpclient/HttpClientSNITest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2025, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -64,7 +64,7 @@ import static org.junit.jupiter.api.Assertions.assertTrue;
  * @build jdk.httpclient.test.lib.common.HttpServerAdapters
  *        jdk.test.lib.net.SimpleSSLContext
  *        jdk.test.lib.net.URIBuilder
- * @run junit HttpClientSNITest
+ * @run junit ${test.main.class}
  */
 public class HttpClientSNITest {
     private static final String RESP_BODY_TEXT = "hello world";
diff --git a/test/jdk/java/net/httpclient/HttpClientSendAsyncExceptionTest.java b/test/jdk/java/net/httpclient/HttpClientSendAsyncExceptionTest.java
index f4a1f3cca82..27562ea2277 100644
--- a/test/jdk/java/net/httpclient/HttpClientSendAsyncExceptionTest.java
+++ b/test/jdk/java/net/httpclient/HttpClientSendAsyncExceptionTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2025, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -57,7 +57,7 @@ import static org.junit.jupiter.api.Assertions.assertTrue;
  * @bug 8368249
  * @summary Verifies exceptions thrown by `HttpClient::sendAsync`
  * @library /test/jdk/java/net/httpclient/lib /test/lib
- * @run junit HttpClientSendAsyncExceptionTest
+ * @run junit ${test.main.class}
  */
 
 class HttpClientSendAsyncExceptionTest {
diff --git a/test/jdk/java/net/httpclient/HttpClientShutdown.java b/test/jdk/java/net/httpclient/HttpClientShutdown.java
index 8532146c1e2..36057a025db 100644
--- a/test/jdk/java/net/httpclient/HttpClientShutdown.java
+++ b/test/jdk/java/net/httpclient/HttpClientShutdown.java
@@ -35,7 +35,7 @@
  * @run junit/othervm
  *       -Djdk.internal.httpclient.debug=true
  *       -Djdk.httpclient.HttpClient.log=trace,headers,requests
- *       HttpClientShutdown
+ *       ${test.main.class}
  */
 // -Djdk.internal.httpclient.debug=true
 
diff --git a/test/jdk/java/net/httpclient/HttpGetInCancelledFuture.java b/test/jdk/java/net/httpclient/HttpGetInCancelledFuture.java
index 80e49f20705..9ea47757402 100644
--- a/test/jdk/java/net/httpclient/HttpGetInCancelledFuture.java
+++ b/test/jdk/java/net/httpclient/HttpGetInCancelledFuture.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2023, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2023, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -74,9 +74,9 @@ import static org.junit.jupiter.api.Assertions.assertTrue;
  * @library /test/lib /test/jdk/java/net/httpclient/lib
  * @build HttpGetInCancelledFuture ReferenceTracker
  * @run junit/othervm -DuseReferenceTracker=false
- *                   HttpGetInCancelledFuture
+ *                   ${test.main.class}
  * @run junit/othervm -DuseReferenceTracker=true
- *                   HttpGetInCancelledFuture
+ *                   ${test.main.class}
  * @summary This test verifies that cancelling a future that
  * does an HTTP request using the HttpClient doesn't cause
  * HttpClient::close to block forever.
diff --git a/test/jdk/java/net/httpclient/HttpHeadersOf.java b/test/jdk/java/net/httpclient/HttpHeadersOf.java
index 77a800b7cf2..fbddcf3e4be 100644
--- a/test/jdk/java/net/httpclient/HttpHeadersOf.java
+++ b/test/jdk/java/net/httpclient/HttpHeadersOf.java
@@ -24,7 +24,7 @@
 /*
  * @test
  * @summary Tests for HttpHeaders.of factory method
- * @run junit HttpHeadersOf
+ * @run junit ${test.main.class}
  */
 
 import java.net.http.HttpHeaders;
diff --git a/test/jdk/java/net/httpclient/HttpInputStreamAvailableTest.java b/test/jdk/java/net/httpclient/HttpInputStreamAvailableTest.java
index 99897a69a8c..395cb50d058 100644
--- a/test/jdk/java/net/httpclient/HttpInputStreamAvailableTest.java
+++ b/test/jdk/java/net/httpclient/HttpInputStreamAvailableTest.java
@@ -26,7 +26,7 @@
  * @bug 8306040
  * @summary HttpResponseInputStream.available() returns 1 on empty stream
  * @library /test/lib /test/jdk/java/net/httpclient/lib
- * @run junit/othervm HttpInputStreamAvailableTest
+ * @run junit/othervm ${test.main.class}
  *
  */
 import com.sun.net.httpserver.HttpExchange;
diff --git a/test/jdk/java/net/httpclient/HttpInputStreamTest.java b/test/jdk/java/net/httpclient/HttpInputStreamTest.java
index 2eb7899e1f0..1e04f592f31 100644
--- a/test/jdk/java/net/httpclient/HttpInputStreamTest.java
+++ b/test/jdk/java/net/httpclient/HttpInputStreamTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2016, 2023, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2016, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -47,7 +47,7 @@ import static java.lang.System.err;
 /*
  * @test
  * @summary An example on how to read a response body with InputStream.
- * @run main/othervm/manual -Dtest.debug=true HttpInputStreamTest
+ * @run main/othervm/manual -Dtest.debug=true ${test.main.class}
  * @author daniel fuchs
  */
 public class HttpInputStreamTest {
diff --git a/test/jdk/java/net/httpclient/HttpRedirectTest.java b/test/jdk/java/net/httpclient/HttpRedirectTest.java
index 2bf90bbe02c..d611a82967b 100644
--- a/test/jdk/java/net/httpclient/HttpRedirectTest.java
+++ b/test/jdk/java/net/httpclient/HttpRedirectTest.java
@@ -76,7 +76,7 @@ import org.junit.jupiter.params.provider.MethodSource;
  * @run junit/othervm -Dtest.requiresHost=true
  *                   -Djdk.httpclient.HttpClient.log=headers
  *                   -Djdk.internal.httpclient.debug=false
- *                   HttpRedirectTest
+ *                   ${test.main.class}
  *
  */
 public class HttpRedirectTest implements HttpServerAdapters {
diff --git a/test/jdk/java/net/httpclient/HttpRequestBodyPublishers/OfByteArraysTest.java b/test/jdk/java/net/httpclient/HttpRequestBodyPublishers/OfByteArraysTest.java
index 10784f7dbee..c12dd91e104 100644
--- a/test/jdk/java/net/httpclient/HttpRequestBodyPublishers/OfByteArraysTest.java
+++ b/test/jdk/java/net/httpclient/HttpRequestBodyPublishers/OfByteArraysTest.java
@@ -52,10 +52,10 @@ import static org.junit.jupiter.api.Assertions.assertThrows;
  *        RecordingSubscriber
  *        ReplayTestSupport
  *
- * @run junit OfByteArraysTest
+ * @run junit ${test.main.class}
  *
  * @comment Using `main/othervm` to initiate tests that depend on a custom-configured JVM
- * @run main/othervm -Xmx64m OfByteArraysTest testOOM
+ * @run main/othervm -Xmx64m ${test.main.class} testOOM
  */
 
 public class OfByteArraysTest extends ReplayTestSupport {
diff --git a/test/jdk/java/net/httpclient/HttpRequestNewBuilderTest.java b/test/jdk/java/net/httpclient/HttpRequestNewBuilderTest.java
index 19afbfbd99b..1558711d741 100644
--- a/test/jdk/java/net/httpclient/HttpRequestNewBuilderTest.java
+++ b/test/jdk/java/net/httpclient/HttpRequestNewBuilderTest.java
@@ -58,7 +58,7 @@ import org.junit.jupiter.params.provider.MethodSource;
 * @test
 * @bug 8252304 8276559
 * @summary HttpRequest.newBuilder(HttpRequest) API and behaviour checks
-* @run junit/othervm HttpRequestNewBuilderTest
+* @run junit/othervm ${test.main.class}
 */
 public class HttpRequestNewBuilderTest {
     static final Class<NullPointerException> NPE = NullPointerException.class;
diff --git a/test/jdk/java/net/httpclient/HttpResponseConnectionLabelTest.java b/test/jdk/java/net/httpclient/HttpResponseConnectionLabelTest.java
index 29c4bcc8072..034144841a1 100644
--- a/test/jdk/java/net/httpclient/HttpResponseConnectionLabelTest.java
+++ b/test/jdk/java/net/httpclient/HttpResponseConnectionLabelTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2025, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -32,7 +32,7 @@
  * @comment Use a higher idle timeout to increase the chances of
  *    the same connection being used for sequential HTTP requests
  * @run junit/othervm -Djdk.httpclient.keepalive.timeout=120
- *                    HttpResponseConnectionLabelTest
+ *                    ${test.main.class}
  */
 
 import jdk.httpclient.test.lib.common.HttpServerAdapters;
diff --git a/test/jdk/java/net/httpclient/HttpResponseInputStreamInterruptTest.java b/test/jdk/java/net/httpclient/HttpResponseInputStreamInterruptTest.java
index 3b955b8feb7..95f554b64e6 100644
--- a/test/jdk/java/net/httpclient/HttpResponseInputStreamInterruptTest.java
+++ b/test/jdk/java/net/httpclient/HttpResponseInputStreamInterruptTest.java
@@ -25,7 +25,7 @@
  * @test
  * @bug 8294047
  * @library /test/lib
- * @run junit HttpResponseInputStreamInterruptTest
+ * @run junit ${test.main.class}
  */
 
 import com.sun.net.httpserver.HttpExchange;
diff --git a/test/jdk/java/net/httpclient/HttpResponseInputStreamTest.java b/test/jdk/java/net/httpclient/HttpResponseInputStreamTest.java
index 633c6877716..f7f9b38b7fc 100644
--- a/test/jdk/java/net/httpclient/HttpResponseInputStreamTest.java
+++ b/test/jdk/java/net/httpclient/HttpResponseInputStreamTest.java
@@ -45,7 +45,7 @@ import org.junit.jupiter.api.Test;
  * @test
  * @bug 8197564 8228970
  * @summary Simple smoke test for BodySubscriber.asInputStream();
- * @run junit/othervm HttpResponseInputStreamTest
+ * @run junit/othervm ${test.main.class}
  * @author daniel fuchs
  */
 public class HttpResponseInputStreamTest {
diff --git a/test/jdk/java/net/httpclient/HttpResponseLimitingTest.java b/test/jdk/java/net/httpclient/HttpResponseLimitingTest.java
index 450fce35f54..c3471c7ccc0 100644
--- a/test/jdk/java/net/httpclient/HttpResponseLimitingTest.java
+++ b/test/jdk/java/net/httpclient/HttpResponseLimitingTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2025, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -31,7 +31,7 @@
  * @build jdk.httpclient.test.lib.common.HttpServerAdapters
  *        jdk.test.lib.RandomFactory
  *        jdk.test.lib.net.SimpleSSLContext
- * @run junit HttpResponseLimitingTest
+ * @run junit ${test.main.class}
  */
 
 import jdk.httpclient.test.lib.common.HttpServerAdapters;
diff --git a/test/jdk/java/net/httpclient/HttpSlowServerTest.java b/test/jdk/java/net/httpclient/HttpSlowServerTest.java
index f62f6fa4978..2e56ef232c6 100644
--- a/test/jdk/java/net/httpclient/HttpSlowServerTest.java
+++ b/test/jdk/java/net/httpclient/HttpSlowServerTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2019, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2019, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -68,7 +68,7 @@ import static java.net.http.HttpOption.H3_DISCOVERY;
  *                   -Djdk.httpclient.HttpClient.log=errors,headers,quic:hs
  *                   -Djdk.internal.httpclient.debug=false
  *                   -Djdk.httpclient.quic.maxInitialTimeout=60
- *                   HttpSlowServerTest
+ *                   ${test.main.class}
  *
  */
 public class HttpSlowServerTest implements HttpServerAdapters {
diff --git a/test/jdk/java/net/httpclient/HttpVersionsTest.java b/test/jdk/java/net/httpclient/HttpVersionsTest.java
index f047e2902e8..17fed725590 100644
--- a/test/jdk/java/net/httpclient/HttpVersionsTest.java
+++ b/test/jdk/java/net/httpclient/HttpVersionsTest.java
@@ -28,7 +28,7 @@
  * @library /test/lib /test/jdk/java/net/httpclient/lib
  * @build jdk.httpclient.test.lib.http2.Http2TestServer jdk.test.lib.net.SimpleSSLContext
  *        jdk.test.lib.Platform
- * @run junit/othervm HttpVersionsTest
+ * @run junit/othervm ${test.main.class}
  */
 
 import java.io.IOException;
diff --git a/test/jdk/java/net/httpclient/HttpsTunnelAuthTest.java b/test/jdk/java/net/httpclient/HttpsTunnelAuthTest.java
index c83abd9cf62..f127b552d2a 100644
--- a/test/jdk/java/net/httpclient/HttpsTunnelAuthTest.java
+++ b/test/jdk/java/net/httpclient/HttpsTunnelAuthTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2021, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2021, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -55,7 +55,7 @@ import static java.lang.System.out;
  *                   -Djdk.http.auth.tunneling.disabledSchemes
  *                   -Djdk.httpclient.allowRestrictedHeaders=connection
  *                   -Djdk.internal.httpclient.debug=true
- *                   HttpsTunnelAuthTest
+ *                   ${test.main.class}
  *
  */
 //-Djdk.internal.httpclient.debug=true -Dtest.debug=true
diff --git a/test/jdk/java/net/httpclient/HttpsTunnelTest.java b/test/jdk/java/net/httpclient/HttpsTunnelTest.java
index bb0afacaacb..86e09bcd669 100644
--- a/test/jdk/java/net/httpclient/HttpsTunnelTest.java
+++ b/test/jdk/java/net/httpclient/HttpsTunnelTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -59,11 +59,11 @@ import static java.net.http.HttpClient.Version.HTTP_2;
  *        DigestEchoServer HttpsTunnelTest
  * @run main/othervm -Dtest.requiresHost=true
  *                   -Djdk.httpclient.HttpClient.log=headers
- *                   -Djdk.internal.httpclient.debug=true HttpsTunnelTest
+ *                   -Djdk.internal.httpclient.debug=true ${test.main.class}
  * @run main/othervm -Dtest.requiresHost=true
  *                   -Djdk.httpclient.allowRestrictedHeaders=host
  *                   -Djdk.httpclient.HttpClient.log=headers
- *                   -Djdk.internal.httpclient.debug=true HttpsTunnelTest
+ *                   -Djdk.internal.httpclient.debug=true ${test.main.class}
  *
  */
 
diff --git a/test/jdk/java/net/httpclient/ISO_8859_1_Test.java b/test/jdk/java/net/httpclient/ISO_8859_1_Test.java
index 103284c9d54..474b5866f76 100644
--- a/test/jdk/java/net/httpclient/ISO_8859_1_Test.java
+++ b/test/jdk/java/net/httpclient/ISO_8859_1_Test.java
@@ -29,7 +29,7 @@
  *       ReferenceTracker
  * @run junit/othervm -Djdk.internal.httpclient.debug=true
  *                     -Djdk.httpclient.HttpClient.log=requests,responses,errors
- *                     ISO_8859_1_Test
+ *                     ${test.main.class}
  * @summary Tests that a client is able to receive ISO-8859-1 encoded header values.
  */
 
diff --git a/test/jdk/java/net/httpclient/IdleConnectionTimeoutTest.java b/test/jdk/java/net/httpclient/IdleConnectionTimeoutTest.java
index be7e1db0033..8eaba1d4aa0 100644
--- a/test/jdk/java/net/httpclient/IdleConnectionTimeoutTest.java
+++ b/test/jdk/java/net/httpclient/IdleConnectionTimeoutTest.java
@@ -70,27 +70,27 @@ import org.junit.jupiter.api.Test;
  *        jdk.httpclient.test.lib.http3.Http3TestServer
  *
  * @run junit/othervm -Djdk.httpclient.HttpClient.log=all -Djdk.httpclient.keepalive.timeout=1
- *                                                             IdleConnectionTimeoutTest
+ *                                                             ${test.main.class}
  * @run junit/othervm -Djdk.httpclient.HttpClient.log=all -Djdk.httpclient.keepalive.timeout=20
- *                                                             IdleConnectionTimeoutTest
+ *                                                             ${test.main.class}
  *
  * @run junit/othervm -Djdk.httpclient.HttpClient.log=all -Djdk.httpclient.keepalive.timeout.h2=1
- *                                                             IdleConnectionTimeoutTest
+ *                                                             ${test.main.class}
  * @run junit/othervm -Djdk.httpclient.HttpClient.log=all -Djdk.httpclient.keepalive.timeout.h2=20
- *                                                             IdleConnectionTimeoutTest
+ *                                                             ${test.main.class}
  * @run junit/othervm -Djdk.httpclient.HttpClient.log=all -Djdk.httpclient.keepalive.timeout.h2=abc
- *                                                             IdleConnectionTimeoutTest
+ *                                                             ${test.main.class}
  * @run junit/othervm -Djdk.httpclient.HttpClient.log=all -Djdk.httpclient.keepalive.timeout.h2=-1
- *                                                             IdleConnectionTimeoutTest
+ *                                                             ${test.main.class}
  *
  * @run junit/othervm -Djdk.httpclient.HttpClient.log=all -Djdk.httpclient.keepalive.timeout.h3=1
- *                                                             IdleConnectionTimeoutTest
+ *                                                             ${test.main.class}
  * @run junit/othervm -Djdk.httpclient.HttpClient.log=all -Djdk.httpclient.keepalive.timeout.h3=20
- *                                                             IdleConnectionTimeoutTest
+ *                                                             ${test.main.class}
  * @run junit/othervm -Djdk.httpclient.HttpClient.log=all -Djdk.httpclient.keepalive.timeout.h3=abc
- *                                                             IdleConnectionTimeoutTest
+ *                                                             ${test.main.class}
  * @run junit/othervm -Djdk.httpclient.HttpClient.log=all -Djdk.httpclient.keepalive.timeout.h3=-1
- *                                                             IdleConnectionTimeoutTest
+ *                                                             ${test.main.class}
  */
 public class IdleConnectionTimeoutTest {
 
diff --git a/test/jdk/java/net/httpclient/ImmutableFlowItems.java b/test/jdk/java/net/httpclient/ImmutableFlowItems.java
index e42e2e21a6e..a47c57a9230 100644
--- a/test/jdk/java/net/httpclient/ImmutableFlowItems.java
+++ b/test/jdk/java/net/httpclient/ImmutableFlowItems.java
@@ -28,7 +28,7 @@
  * @library /test/lib /test/jdk/java/net/httpclient/lib
  * @build jdk.test.lib.net.SimpleSSLContext jdk.httpclient.test.lib.http2.Http2TestServer
  *        jdk.httpclient.test.lib.common.TestServerConfigurator
- * @run junit/othervm ImmutableFlowItems
+ * @run junit/othervm ${test.main.class}
  */
 
 import java.io.IOException;
diff --git a/test/jdk/java/net/httpclient/ImmutableHeaders.java b/test/jdk/java/net/httpclient/ImmutableHeaders.java
index e8d2e5166bb..2ce2234132b 100644
--- a/test/jdk/java/net/httpclient/ImmutableHeaders.java
+++ b/test/jdk/java/net/httpclient/ImmutableHeaders.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2015, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2015, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -26,7 +26,7 @@
  * @bug 8087112
  * @modules java.net.http
  *          jdk.httpserver
- * @run main/othervm ImmutableHeaders
+ * @run main/othervm ${test.main.class}
  * @summary ImmutableHeaders
  */
 
diff --git a/test/jdk/java/net/httpclient/ImmutableSSLSessionTest.java b/test/jdk/java/net/httpclient/ImmutableSSLSessionTest.java
index 9b5c7961c2f..a7c9deddac7 100644
--- a/test/jdk/java/net/httpclient/ImmutableSSLSessionTest.java
+++ b/test/jdk/java/net/httpclient/ImmutableSSLSessionTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2025, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -79,7 +79,7 @@ import static org.junit.jupiter.api.Assertions.assertThrows;
  *        jdk.httpclient.test.lib.common.HttpServerAdapters
  *        java.net.http/jdk.internal.net.http.common.ImmutableSSLSessionAccess
  * @run junit/othervm -Djdk.httpclient.HttpClient.log=request,response,headers,errors
- *                    ImmutableSSLSessionTest
+ *                    ${test.main.class}
  */
 @TestInstance(TestInstance.Lifecycle.PER_CLASS)
 public class ImmutableSSLSessionTest implements HttpServerAdapters {
diff --git a/test/jdk/java/net/httpclient/InterruptedBlockingSend.java b/test/jdk/java/net/httpclient/InterruptedBlockingSend.java
index 0dcd2ca02c2..7605b627038 100644
--- a/test/jdk/java/net/httpclient/InterruptedBlockingSend.java
+++ b/test/jdk/java/net/httpclient/InterruptedBlockingSend.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2017, 2020, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2017, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -34,7 +34,7 @@ import static java.lang.System.out;
  * @test
  * @bug 8245462
  * @summary Basic test for interrupted blocking send
- * @run main/othervm InterruptedBlockingSend
+ * @run main/othervm ${test.main.class}
  */
 
 public class InterruptedBlockingSend {
diff --git a/test/jdk/java/net/httpclient/InvalidInputStreamSubscriptionRequest.java b/test/jdk/java/net/httpclient/InvalidInputStreamSubscriptionRequest.java
index c83d9d67528..83c09b356ed 100644
--- a/test/jdk/java/net/httpclient/InvalidInputStreamSubscriptionRequest.java
+++ b/test/jdk/java/net/httpclient/InvalidInputStreamSubscriptionRequest.java
@@ -31,7 +31,7 @@
  *        jdk.httpclient.test.lib.common.HttpServerAdapters
  * @run junit/othervm -Dtest.http.version=http3
  *      -Djdk.internal.httpclient.debug=true
- *      InvalidInputStreamSubscriptionRequest
+ *      ${test.main.class}
  */
 /*
  * @test id=http2
@@ -41,7 +41,7 @@
  * @library /test/lib /test/jdk/java/net/httpclient/lib
  * @build jdk.test.lib.net.SimpleSSLContext ReferenceTracker
  *        jdk.httpclient.test.lib.common.HttpServerAdapters
- * @run junit/othervm -Dtest.http.version=http2 InvalidInputStreamSubscriptionRequest
+ * @run junit/othervm -Dtest.http.version=http2 ${test.main.class}
  */
 /*
  * @test id=http1
@@ -51,7 +51,7 @@
  * @library /test/lib /test/jdk/java/net/httpclient/lib
  * @build jdk.test.lib.net.SimpleSSLContext ReferenceTracker
  *        jdk.httpclient.test.lib.common.HttpServerAdapters
- * @run junit/othervm -Dtest.http.version=http1 InvalidInputStreamSubscriptionRequest
+ * @run junit/othervm -Dtest.http.version=http1 ${test.main.class}
  */
 
 import com.sun.net.httpserver.HttpServer;
diff --git a/test/jdk/java/net/httpclient/InvalidSSLContextTest.java b/test/jdk/java/net/httpclient/InvalidSSLContextTest.java
index bbbd1e486ca..418c55364b5 100644
--- a/test/jdk/java/net/httpclient/InvalidSSLContextTest.java
+++ b/test/jdk/java/net/httpclient/InvalidSSLContextTest.java
@@ -29,7 +29,7 @@
  * @library /test/lib /test/jdk/java/net/httpclient/lib
  * @build jdk.test.lib.net.SimpleSSLContext
  *        jdk.httpclient.test.lib.common.HttpServerAdapters
- * @run junit/othervm -Djdk.internal.httpclient.debug=true InvalidSSLContextTest
+ * @run junit/othervm -Djdk.internal.httpclient.debug=true ${test.main.class}
  */
 
 import java.io.IOException;
diff --git a/test/jdk/java/net/httpclient/InvalidSubscriptionRequest.java b/test/jdk/java/net/httpclient/InvalidSubscriptionRequest.java
index 692e4d0bea4..92914843044 100644
--- a/test/jdk/java/net/httpclient/InvalidSubscriptionRequest.java
+++ b/test/jdk/java/net/httpclient/InvalidSubscriptionRequest.java
@@ -30,7 +30,7 @@
  * @library /test/lib /test/jdk/java/net/httpclient/lib
  * @build jdk.test.lib.net.SimpleSSLContext ReferenceTracker
  *        jdk.httpclient.test.lib.common.HttpServerAdapters
- * @run junit/othervm InvalidSubscriptionRequest
+ * @run junit/othervm ${test.main.class}
  */
 
 import jdk.test.lib.net.SimpleSSLContext;
diff --git a/test/jdk/java/net/httpclient/LargeHandshakeTest.java b/test/jdk/java/net/httpclient/LargeHandshakeTest.java
index ff3981e8b3d..59cdad27cbc 100644
--- a/test/jdk/java/net/httpclient/LargeHandshakeTest.java
+++ b/test/jdk/java/net/httpclient/LargeHandshakeTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2019, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2019, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -88,7 +88,7 @@ import static java.net.http.HttpOption.H3_DISCOVERY;
  *                   -Djdk.httpclient.HttpClient.log=headers
  *                   -Djdk.internal.httpclient.debug=true
  *                   -Djdk.tls.maxHandshakeMessageSize=131072
- *                   LargeHandshakeTest
+ *                   ${test.main.class}
  *
  */
 public class LargeHandshakeTest implements HttpServerAdapters {
diff --git a/test/jdk/java/net/httpclient/LargeResponseContent.java b/test/jdk/java/net/httpclient/LargeResponseContent.java
index 7a1bca73d13..e510f44c9e4 100644
--- a/test/jdk/java/net/httpclient/LargeResponseContent.java
+++ b/test/jdk/java/net/httpclient/LargeResponseContent.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -46,7 +46,7 @@ import jdk.test.lib.net.URIBuilder;
  * @bug 8212926
  * @library /test/lib
  * @summary Basic tests for response timeouts
- * @run main/othervm LargeResponseContent
+ * @run main/othervm ${test.main.class}
  */
 
 public class LargeResponseContent {
diff --git a/test/jdk/java/net/httpclient/LargeResponseTest.java b/test/jdk/java/net/httpclient/LargeResponseTest.java
index 727cc1768df..f41a40f2960 100644
--- a/test/jdk/java/net/httpclient/LargeResponseTest.java
+++ b/test/jdk/java/net/httpclient/LargeResponseTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2019, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2019, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -69,7 +69,7 @@ import static java.net.http.HttpOption.H3_DISCOVERY;
  *                   -Djdk.httpclient.HttpClient.log=headers
  *                   -Djdk.internal.httpclient.debug=true
  *                   -Djdk.httpclient.quic.maxInitialTimeout=60
- *                   LargeResponseTest
+ *                   ${test.main.class}
  *
  */
 public class LargeResponseTest implements HttpServerAdapters {
diff --git a/test/jdk/java/net/httpclient/LineBodyHandlerTest.java b/test/jdk/java/net/httpclient/LineBodyHandlerTest.java
index ddca2e1f7d2..d18c3b170ee 100644
--- a/test/jdk/java/net/httpclient/LineBodyHandlerTest.java
+++ b/test/jdk/java/net/httpclient/LineBodyHandlerTest.java
@@ -82,7 +82,7 @@ import org.junit.jupiter.params.provider.MethodSource;
  * @library /test/lib /test/jdk/java/net/httpclient/lib
  * @build ReferenceTracker jdk.httpclient.test.lib.http2.Http2TestServer
  *        jdk.test.lib.net.SimpleSSLContext
- * @run junit/othervm -XX:+UnlockDiagnosticVMOptions -XX:DiagnoseSyncOnValueBasedClasses=1 LineBodyHandlerTest
+ * @run junit/othervm -XX:+UnlockDiagnosticVMOptions -XX:DiagnoseSyncOnValueBasedClasses=1 ${test.main.class}
  */
 
 public class LineBodyHandlerTest implements HttpServerAdapters {
diff --git a/test/jdk/java/net/httpclient/LineStreamsAndSurrogatesTest.java b/test/jdk/java/net/httpclient/LineStreamsAndSurrogatesTest.java
index 01a7ee9fdbf..4dead447295 100644
--- a/test/jdk/java/net/httpclient/LineStreamsAndSurrogatesTest.java
+++ b/test/jdk/java/net/httpclient/LineStreamsAndSurrogatesTest.java
@@ -49,7 +49,7 @@ import org.junit.jupiter.api.Test;
  *       In particular tests that surrogate characters are handled
  *       correctly.
  * @modules java.net.http java.logging
- * @run junit/othervm LineStreamsAndSurrogatesTest
+ * @run junit/othervm ${test.main.class}
  */
 
 public class LineStreamsAndSurrogatesTest {
diff --git a/test/jdk/java/net/httpclient/LineSubscribersAndSurrogatesTest.java b/test/jdk/java/net/httpclient/LineSubscribersAndSurrogatesTest.java
index 7932744a4db..fc51b1f7a4d 100644
--- a/test/jdk/java/net/httpclient/LineSubscribersAndSurrogatesTest.java
+++ b/test/jdk/java/net/httpclient/LineSubscribersAndSurrogatesTest.java
@@ -54,7 +54,7 @@ import org.junit.jupiter.api.Test;
  *       In particular tests that surrogate characters are handled
  *       correctly.
  * @modules java.net.http java.logging
- * @run junit/othervm LineSubscribersAndSurrogatesTest
+ * @run junit/othervm ${test.main.class}
  */
 
 public class LineSubscribersAndSurrogatesTest {
diff --git a/test/jdk/java/net/httpclient/ManyRequests.java b/test/jdk/java/net/httpclient/ManyRequests.java
index 3609aa8337a..e8bcfb76b1b 100644
--- a/test/jdk/java/net/httpclient/ManyRequests.java
+++ b/test/jdk/java/net/httpclient/ManyRequests.java
@@ -27,13 +27,13 @@
  * @key intermittent
  * @library /test/lib /test/jdk/java/net/httpclient/lib
  * @build jdk.test.lib.net.SimpleSSLContext jdk.httpclient.test.lib.common.HttpServerAdapters
- * @run main/othervm/timeout=160 -Djdk.httpclient.HttpClient.log=ssl,channel ManyRequests
- * @run main/othervm/timeout=160 -Djdk.httpclient.HttpClient.log=channel -Dtest.insertDelay=true ManyRequests
- * @run main/othervm/timeout=160 -Djdk.httpclient.HttpClient.log=channel -Dtest.chunkSize=64 ManyRequests
- * @run main/othervm/timeout=160 -Djdk.httpclient.HttpClient.log=channel -Dtest.insertDelay=true -Dtest.chunkSize=64 ManyRequests
+ * @run main/othervm/timeout=160 -Djdk.httpclient.HttpClient.log=ssl,channel ${test.main.class}
+ * @run main/othervm/timeout=160 -Djdk.httpclient.HttpClient.log=channel -Dtest.insertDelay=true ${test.main.class}
+ * @run main/othervm/timeout=160 -Djdk.httpclient.HttpClient.log=channel -Dtest.chunkSize=64 ${test.main.class}
+ * @run main/othervm/timeout=160 -Djdk.httpclient.HttpClient.log=channel -Dtest.insertDelay=true -Dtest.chunkSize=64 ${test.main.class}
  * @summary Send a large number of requests asynchronously
  */
- // * @run main/othervm/timeout=40 -Djdk.httpclient.HttpClient.log=ssl,channel ManyRequests
+ // * @run main/othervm/timeout=40 -Djdk.httpclient.HttpClient.log=ssl,channel ${test.main.class}
 
 import java.io.IOException;
 import java.io.InputStream;
diff --git a/test/jdk/java/net/httpclient/ManyRequests2.java b/test/jdk/java/net/httpclient/ManyRequests2.java
index 09fdc18f687..5718e6958f7 100644
--- a/test/jdk/java/net/httpclient/ManyRequests2.java
+++ b/test/jdk/java/net/httpclient/ManyRequests2.java
@@ -28,15 +28,15 @@
  * @build jdk.test.lib.net.SimpleSSLContext jdk.httpclient.test.lib.common.HttpServerAdapters
  * @build ManyRequests ManyRequests2
  * @run main/othervm/timeout=400 -Dsun.net.httpserver.idleInterval=400 -Dtest.XFixed=true
- *                              -Djdk.httpclient.HttpClient.log=channel ManyRequests2
+ *                              -Djdk.httpclient.HttpClient.log=channel ${test.main.class}
  * @run main/othervm/timeout=400 -Dsun.net.httpserver.idleInterval=400 -Dtest.XFixed=true -Dtest.insertDelay=true
- *                              -Djdk.httpclient.HttpClient.log=channel ManyRequests2
+ *                              -Djdk.httpclient.HttpClient.log=channel ${test.main.class}
  * @run main/othervm/timeout=400 -Dsun.net.httpserver.idleInterval=400 -Dtest.XFixed=true -Dtest.chunkSize=64
- *                              -Djdk.httpclient.HttpClient.log=channel ManyRequests2
+ *                              -Djdk.httpclient.HttpClient.log=channel ${test.main.class}
  * @run main/othervm/timeout=400 -Dsun.net.httpserver.idleInterval=400 -Djdk.internal.httpclient.debug=true
  *                              -Djdk.httpclient.HttpClient.log=channel
  *                              -Dtest.XFixed=true -Dtest.insertDelay=true
- *                              -Dtest.chunkSize=64 ManyRequests2
+ *                              -Dtest.chunkSize=64 ${test.main.class}
  * @summary Send a large number of requests asynchronously.
  *          The server echoes back using known content length.
  */
diff --git a/test/jdk/java/net/httpclient/ManyRequestsLegacy.java b/test/jdk/java/net/httpclient/ManyRequestsLegacy.java
index f1c4f881058..b0f7ffdd4cb 100644
--- a/test/jdk/java/net/httpclient/ManyRequestsLegacy.java
+++ b/test/jdk/java/net/httpclient/ManyRequestsLegacy.java
@@ -25,11 +25,11 @@
  * @test
  * @library /test/lib /test/jdk/java/net/httpclient/lib
  * @build jdk.test.lib.net.SimpleSSLContext jdk.httpclient.test.lib.common.HttpServerAdapters
- * @run main/othervm/timeout=80 -Dsun.net.httpserver.idleInterval=50000 ManyRequestsLegacy
- * @run main/othervm/timeout=80 -Dtest.insertDelay=true -Dsun.net.httpserver.idleInterval=50000 ManyRequestsLegacy
- * @run main/othervm/timeout=80 -Dtest.chunkSize=64 -Dsun.net.httpserver.idleInterval=50000 ManyRequestsLegacy
+ * @run main/othervm/timeout=80 -Dsun.net.httpserver.idleInterval=50000 ${test.main.class}
+ * @run main/othervm/timeout=80 -Dtest.insertDelay=true -Dsun.net.httpserver.idleInterval=50000 ${test.main.class}
+ * @run main/othervm/timeout=80 -Dtest.chunkSize=64 -Dsun.net.httpserver.idleInterval=50000 ${test.main.class}
  * @run main/othervm/timeout=80 -Dtest.insertDelay=true -Dsun.net.httpserver.idleInterval=50000
- *                              -Dtest.chunkSize=64 ManyRequestsLegacy
+ *                              -Dtest.chunkSize=64 ${test.main.class}
  * @summary Send a large number of requests asynchronously using the legacy
  *          URL.openConnection(), to help sanitize results of the test
  *          ManyRequest.java.
diff --git a/test/jdk/java/net/httpclient/MaxStreams.java b/test/jdk/java/net/httpclient/MaxStreams.java
index 00875aceb6f..b3fc38e11f3 100644
--- a/test/jdk/java/net/httpclient/MaxStreams.java
+++ b/test/jdk/java/net/httpclient/MaxStreams.java
@@ -27,7 +27,7 @@
  * @summary Should HttpClient support SETTINGS_MAX_CONCURRENT_STREAMS from the server
  * @library /test/lib /test/jdk/java/net/httpclient/lib
  * @build jdk.httpclient.test.lib.http2.Http2TestServer jdk.test.lib.net.SimpleSSLContext
- * @run junit/othervm MaxStreams
+ * @run junit/othervm ${test.main.class}
  */
 
 import java.io.IOException;
diff --git a/test/jdk/java/net/httpclient/MessageHeadersTest.java b/test/jdk/java/net/httpclient/MessageHeadersTest.java
index b0a5130e2b6..ab6ed2e5f94 100644
--- a/test/jdk/java/net/httpclient/MessageHeadersTest.java
+++ b/test/jdk/java/net/httpclient/MessageHeadersTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2016, 2022, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2016, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -27,7 +27,7 @@
  * @modules java.net.http
  *          jdk.httpserver
  *          java.base/sun.net.www
- * @run main MessageHeadersTest
+ * @run main ${test.main.class}
  * @summary Tests expected behavior of MessageHeader. This test
  *          cannot be used to verify 8164704 - it simply verifies
  *          the assumptions on which the fix is based.
diff --git a/test/jdk/java/net/httpclient/MultiAuthTest.java b/test/jdk/java/net/httpclient/MultiAuthTest.java
index c434591c894..bdf18ee7238 100644
--- a/test/jdk/java/net/httpclient/MultiAuthTest.java
+++ b/test/jdk/java/net/httpclient/MultiAuthTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2016, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2016, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,7 +25,7 @@
  * @test
  * @modules java.net.http
  *          jdk.httpserver
- * @run main/othervm MultiAuthTest
+ * @run main/othervm ${test.main.class}
  * @summary Basic Authentication test with multiple clients issuing
  *          multiple requests. Includes password changes
  *          on server and client side.
diff --git a/test/jdk/java/net/httpclient/NoBodyPartOne.java b/test/jdk/java/net/httpclient/NoBodyPartOne.java
index 980f4d8d100..6fc4cf02e07 100644
--- a/test/jdk/java/net/httpclient/NoBodyPartOne.java
+++ b/test/jdk/java/net/httpclient/NoBodyPartOne.java
@@ -30,7 +30,7 @@
  * @run junit/othervm
  *      -Djdk.internal.httpclient.debug=true
  *      -Djdk.httpclient.HttpClient.log=all
- *      NoBodyPartOne
+ *      ${test.main.class}
  */
 
 import java.nio.file.Files;
diff --git a/test/jdk/java/net/httpclient/NoBodyPartThree.java b/test/jdk/java/net/httpclient/NoBodyPartThree.java
index 7020f7e2c25..ab9b3822263 100644
--- a/test/jdk/java/net/httpclient/NoBodyPartThree.java
+++ b/test/jdk/java/net/httpclient/NoBodyPartThree.java
@@ -30,7 +30,7 @@
  * @run junit/othervm
  *      -Djdk.httpclient.HttpClient.log=quic,errors
  *      -Djdk.httpclient.HttpClient.log=all
- *      NoBodyPartThree
+ *      ${test.main.class}
  */
 
 import java.io.InputStream;
diff --git a/test/jdk/java/net/httpclient/NoBodyPartTwo.java b/test/jdk/java/net/httpclient/NoBodyPartTwo.java
index 9e7ceb11c55..c59bc5e9b08 100644
--- a/test/jdk/java/net/httpclient/NoBodyPartTwo.java
+++ b/test/jdk/java/net/httpclient/NoBodyPartTwo.java
@@ -30,7 +30,7 @@
  * @run junit/othervm
  *      -Djdk.internal.httpclient.debug=true
  *      -Djdk.httpclient.HttpClient.log=all
- *      NoBodyPartTwo
+ *      ${test.main.class}
  */
 
 import java.io.InputStream;
diff --git a/test/jdk/java/net/httpclient/NonAsciiCharsInURI.java b/test/jdk/java/net/httpclient/NonAsciiCharsInURI.java
index 2e53479a6ee..2bde0c8bd9a 100644
--- a/test/jdk/java/net/httpclient/NonAsciiCharsInURI.java
+++ b/test/jdk/java/net/httpclient/NonAsciiCharsInURI.java
@@ -31,7 +31,7 @@
  * @compile -encoding utf-8 NonAsciiCharsInURI.java
  * @run junit/othervm
  *       -Djdk.httpclient.HttpClient.log=requests,headers,errors,quic
- *       NonAsciiCharsInURI
+ *       ${test.main.class}
  */
 
 import java.io.Closeable;
diff --git a/test/jdk/java/net/httpclient/OriginTest.java b/test/jdk/java/net/httpclient/OriginTest.java
index 58310ecd9ad..838f8f36df2 100644
--- a/test/jdk/java/net/httpclient/OriginTest.java
+++ b/test/jdk/java/net/httpclient/OriginTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2025, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -38,7 +38,7 @@ import static org.junit.jupiter.api.Assertions.fail;
  * @test
  * @summary verify the behaviour of jdk.internal.net.http.Origin
  * @modules java.net.http/jdk.internal.net.http
- * @run junit OriginTest
+ * @run junit ${test.main.class}
  */
 class OriginTest {
 
diff --git a/test/jdk/java/net/httpclient/PathSubscriber/BodyHandlerOfFileDownloadTest.java b/test/jdk/java/net/httpclient/PathSubscriber/BodyHandlerOfFileDownloadTest.java
index 92d359e32c6..93f1b36dfd1 100644
--- a/test/jdk/java/net/httpclient/PathSubscriber/BodyHandlerOfFileDownloadTest.java
+++ b/test/jdk/java/net/httpclient/PathSubscriber/BodyHandlerOfFileDownloadTest.java
@@ -37,7 +37,7 @@
  *        jdk.test.lib.net.SimpleSSLContext
  *        jdk.test.lib.Platform
  *        jdk.test.lib.util.FileUtils
- * @run junit/othervm BodyHandlerOfFileDownloadTest
+ * @run junit/othervm ${test.main.class}
  */
 
 import jdk.test.lib.net.SimpleSSLContext;
diff --git a/test/jdk/java/net/httpclient/PathSubscriber/BodyHandlerOfFileTest.java b/test/jdk/java/net/httpclient/PathSubscriber/BodyHandlerOfFileTest.java
index 53b8607f294..b0977efe69e 100644
--- a/test/jdk/java/net/httpclient/PathSubscriber/BodyHandlerOfFileTest.java
+++ b/test/jdk/java/net/httpclient/PathSubscriber/BodyHandlerOfFileTest.java
@@ -36,7 +36,7 @@
  *        jdk.httpclient.test.lib.http2.Queue
  *        jdk.test.lib.net.SimpleSSLContext
  *        jdk.test.lib.Platform jdk.test.lib.util.FileUtils
- * @run junit/othervm BodyHandlerOfFileTest
+ * @run junit/othervm ${test.main.class}
  */
 
 import jdk.test.lib.net.SimpleSSLContext;
diff --git a/test/jdk/java/net/httpclient/PathSubscriber/BodySubscriberOfFileTest.java b/test/jdk/java/net/httpclient/PathSubscriber/BodySubscriberOfFileTest.java
index da0c7220b6b..665bf280aca 100644
--- a/test/jdk/java/net/httpclient/PathSubscriber/BodySubscriberOfFileTest.java
+++ b/test/jdk/java/net/httpclient/PathSubscriber/BodySubscriberOfFileTest.java
@@ -35,7 +35,7 @@
  *        jdk.httpclient.test.lib.http2.OutgoingPushPromise
  *        jdk.httpclient.test.lib.http2.Queue jdk.test.lib.net.SimpleSSLContext
  *        jdk.test.lib.Platform jdk.test.lib.util.FileUtils
- * @run junit/othervm BodySubscriberOfFileTest
+ * @run junit/othervm ${test.main.class}
  */
 
 import jdk.test.lib.net.SimpleSSLContext;
diff --git a/test/jdk/java/net/httpclient/PlainProxyConnectionTest.java b/test/jdk/java/net/httpclient/PlainProxyConnectionTest.java
index cd7049285f1..91a59019355 100644
--- a/test/jdk/java/net/httpclient/PlainProxyConnectionTest.java
+++ b/test/jdk/java/net/httpclient/PlainProxyConnectionTest.java
@@ -62,7 +62,7 @@ import static java.net.Proxy.NO_PROXY;
  *          /test/jdk/java/net/httpclient/lib
  * @run main/othervm -Djdk.httpclient.HttpClient.log=headers,requests,trace
  *      -Djdk.internal.httpclient.debug=true
- *      PlainProxyConnectionTest
+ *      ${test.main.class}
  */
 public class PlainProxyConnectionTest {
 
diff --git a/test/jdk/java/net/httpclient/ProxyAuthDisabledSchemes.java b/test/jdk/java/net/httpclient/ProxyAuthDisabledSchemes.java
index 84b29449d67..92f1360d1e2 100644
--- a/test/jdk/java/net/httpclient/ProxyAuthDisabledSchemes.java
+++ b/test/jdk/java/net/httpclient/ProxyAuthDisabledSchemes.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2023, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -34,13 +34,13 @@
  *        jdk.httpclient.test.lib.common.HttpServerAdapters
  * @run main/othervm -Djdk.http.auth.proxying.disabledSchemes=Basic,Digest
  *                   -Djdk.http.auth.tunneling.disabledSchemes=Digest,Basic
- *                   ProxyAuthDisabledSchemes
+ *                   ${test.main.class}
  * @run main/othervm -Djdk.http.auth.proxying.disabledSchemes=Basic
  *                   -Djdk.http.auth.tunneling.disabledSchemes=Basic
- *                   ProxyAuthDisabledSchemes CLEAR PROXY
+ *                   ${test.main.class} CLEAR PROXY
  * @run main/othervm -Djdk.http.auth.proxying.disabledSchemes=Digest
  *                   -Djdk.http.auth.tunneling.disabledSchemes=Digest
- *                   ProxyAuthDisabledSchemes CLEAR PROXY
+ *                   ${test.main.class} CLEAR PROXY
  */
 
 public class ProxyAuthDisabledSchemes {
diff --git a/test/jdk/java/net/httpclient/ProxyAuthDisabledSchemesSSL.java b/test/jdk/java/net/httpclient/ProxyAuthDisabledSchemesSSL.java
index 6d9d7e4f11b..e02cbef658b 100644
--- a/test/jdk/java/net/httpclient/ProxyAuthDisabledSchemesSSL.java
+++ b/test/jdk/java/net/httpclient/ProxyAuthDisabledSchemesSSL.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2023, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -38,27 +38,27 @@
  *          -Djdk.httpclient.http3.maxDirectConnectionTimeout=100
  *          -Djdk.internal.httpclient.debug=err
  *          -Djdk.httpclient.HttpClient.log=headers
- *          ProxyAuthDisabledSchemesSSL SSL SERVER307
+ *          ${test.main.class} SSL SERVER307
  * @run main/othervm/timeout=300
  *          -Djdk.http.auth.proxying.disabledSchemes=Basic,Digest
  *          -Djdk.http.auth.tunneling.disabledSchemes=Digest,Basic
  *          -Djdk.httpclient.http3.maxDirectConnectionTimeout=100
  *          -Djdk.httpclient.HttpClient.log=headers
- *          ProxyAuthDisabledSchemesSSL SSL SERVER PROXY
+ *          ${test.main.class} SSL SERVER PROXY
  * @run main/othervm/timeout=300
  *          -Djdk.http.auth.proxying.disabledSchemes=Basic
  *          -Djdk.http.auth.tunneling.disabledSchemes=Basic
  *          -Dtest.requiresHost=true
  *          -Djdk.httpclient.http3.maxDirectConnectionTimeout=100
  *          -Djdk.httpclient.HttpClient.log=headers
- *          ProxyAuthDisabledSchemesSSL SSL PROXY
+ *          ${test.main.class} SSL PROXY
  * @run main/othervm/timeout=300
  *          -Djdk.http.auth.proxying.disabledSchemes=Digest
  *          -Djdk.http.auth.tunneling.disabledSchemes=Digest
  *          -Dtest.requiresHost=true
  *          -Djdk.httpclient.http3.maxDirectConnectionTimeout=100
  *          -Djdk.httpclient.HttpClient.log=headers
- *          ProxyAuthDisabledSchemesSSL SSL PROXY
+ *          ${test.main.class} SSL PROXY
  */
 
 public class ProxyAuthDisabledSchemesSSL {
diff --git a/test/jdk/java/net/httpclient/ProxyAuthTest.java b/test/jdk/java/net/httpclient/ProxyAuthTest.java
index a147e8944d2..63004289934 100644
--- a/test/jdk/java/net/httpclient/ProxyAuthTest.java
+++ b/test/jdk/java/net/httpclient/ProxyAuthTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2016, 2022, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2016, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -26,7 +26,7 @@
  * @bug 8163561
  * @library /test/lib
  * @summary Verify that Proxy-Authenticate header is correctly handled
- * @run main/othervm ProxyAuthTest
+ * @run main/othervm ${test.main.class}
  */
 
 import java.io.BufferedWriter;
diff --git a/test/jdk/java/net/httpclient/ProxySelectorTest.java b/test/jdk/java/net/httpclient/ProxySelectorTest.java
index bb339e91bdc..3920906d03a 100644
--- a/test/jdk/java/net/httpclient/ProxySelectorTest.java
+++ b/test/jdk/java/net/httpclient/ProxySelectorTest.java
@@ -33,7 +33,7 @@
  *       -Djdk.http.auth.tunneling.disabledSchemes
  *       -Djdk.httpclient.HttpClient.log=headers,requests
  *       -Djdk.internal.httpclient.debug=true
- *       ProxySelectorTest
+ *       ${test.main.class}
  */
 
 import jdk.test.lib.net.SimpleSSLContext;
diff --git a/test/jdk/java/net/httpclient/ProxyTest.java b/test/jdk/java/net/httpclient/ProxyTest.java
index d8abea188bd..45000f54f45 100644
--- a/test/jdk/java/net/httpclient/ProxyTest.java
+++ b/test/jdk/java/net/httpclient/ProxyTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2017, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2017, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -74,7 +74,7 @@ import static java.net.Proxy.NO_PROXY;
  * @library /test/lib /test/jdk/java/net/httpclient/lib
  * @build jdk.test.lib.net.SimpleSSLContext ProxyTest
  *        jdk.httpclient.test.lib.common.TestServerConfigurator
- * @run main/othervm ProxyTest
+ * @run main/othervm ${test.main.class}
  * @author danielfuchs
  */
 public class ProxyTest {
diff --git a/test/jdk/java/net/httpclient/RedirectMethodChange.java b/test/jdk/java/net/httpclient/RedirectMethodChange.java
index 73e27f6efff..545d049d0d5 100644
--- a/test/jdk/java/net/httpclient/RedirectMethodChange.java
+++ b/test/jdk/java/net/httpclient/RedirectMethodChange.java
@@ -26,7 +26,7 @@
  * @summary Method change during redirection
  * @library /test/lib /test/jdk/java/net/httpclient/lib
  * @build jdk.httpclient.test.lib.http2.Http2TestServer jdk.test.lib.net.SimpleSSLContext
- * @run junit/othervm RedirectMethodChange
+ * @run junit/othervm ${test.main.class}
  */
 
 import javax.net.ssl.SSLContext;
diff --git a/test/jdk/java/net/httpclient/RedirectTimeoutTest.java b/test/jdk/java/net/httpclient/RedirectTimeoutTest.java
index 8c2fa8707ae..eac97e4f73e 100644
--- a/test/jdk/java/net/httpclient/RedirectTimeoutTest.java
+++ b/test/jdk/java/net/httpclient/RedirectTimeoutTest.java
@@ -29,7 +29,7 @@
  *          an HttpTimeoutException during the redirected request.
  * @library /test/lib /test/jdk/java/net/httpclient/lib
  * @build jdk.test.lib.net.SimpleSSLContext
- * @run junit/othervm -Djdk.httpclient.HttpClient.log=errors,trace -Djdk.internal.httpclient.debug=false RedirectTimeoutTest
+ * @run junit/othervm -Djdk.httpclient.HttpClient.log=errors,trace -Djdk.internal.httpclient.debug=false ${test.main.class}
  */
 
 import jdk.httpclient.test.lib.common.HttpServerAdapters;
@@ -203,4 +203,4 @@ public class RedirectTimeoutTest implements HttpServerAdapters {
             }
         }
     }
-}
\ No newline at end of file
+}
diff --git a/test/jdk/java/net/httpclient/RedirectWithCookie.java b/test/jdk/java/net/httpclient/RedirectWithCookie.java
index ad94b124132..d9ebf9e1faf 100644
--- a/test/jdk/java/net/httpclient/RedirectWithCookie.java
+++ b/test/jdk/java/net/httpclient/RedirectWithCookie.java
@@ -28,7 +28,7 @@
  * @build jdk.httpclient.test.lib.http2.Http2TestServer jdk.test.lib.net.SimpleSSLContext
  * @run junit/othervm
  *       -Djdk.httpclient.HttpClient.log=trace,headers,requests
- *       RedirectWithCookie
+ *       ${test.main.class}
  */
 
 import java.io.IOException;
diff --git a/test/jdk/java/net/httpclient/RequestBodyTest.java b/test/jdk/java/net/httpclient/RequestBodyTest.java
index e87cbc694c7..0c65a81c3ed 100644
--- a/test/jdk/java/net/httpclient/RequestBodyTest.java
+++ b/test/jdk/java/net/httpclient/RequestBodyTest.java
@@ -62,7 +62,7 @@ import org.junit.jupiter.params.provider.MethodSource;
  * @build LightWeightHttpServer
  * @build jdk.test.lib.Platform
  * @build jdk.test.lib.util.FileUtils
- * @run junit/othervm RequestBodyTest
+ * @run junit/othervm ${test.main.class}
  */
 public class RequestBodyTest {
 
diff --git a/test/jdk/java/net/httpclient/RequestBuilderTest.java b/test/jdk/java/net/httpclient/RequestBuilderTest.java
index 12af908457b..6ba00fcd10f 100644
--- a/test/jdk/java/net/httpclient/RequestBuilderTest.java
+++ b/test/jdk/java/net/httpclient/RequestBuilderTest.java
@@ -25,7 +25,7 @@
  * @test
  * @bug 8276559
  * @summary HttpRequest[.Builder] API and behaviour checks
- * @run junit RequestBuilderTest
+ * @run junit ${test.main.class}
  */
 
 import java.net.URI;
diff --git a/test/jdk/java/net/httpclient/Response1xxTest.java b/test/jdk/java/net/httpclient/Response1xxTest.java
index 9b54f852510..d7e975fa7dc 100644
--- a/test/jdk/java/net/httpclient/Response1xxTest.java
+++ b/test/jdk/java/net/httpclient/Response1xxTest.java
@@ -63,7 +63,7 @@ import org.junit.jupiter.api.Test;
  * @build jdk.test.lib.net.SimpleSSLContext jdk.httpclient.test.lib.common.HttpServerAdapters
  *        jdk.httpclient.test.lib.http2.Http2TestServer
  * @run junit/othervm -Djdk.internal.httpclient.debug=true
- *                    -Djdk.httpclient.HttpClient.log=headers,requests,responses,errors Response1xxTest
+ *                    -Djdk.httpclient.HttpClient.log=headers,requests,responses,errors ${test.main.class}
  */
 public class Response1xxTest implements HttpServerAdapters {
     private static final String EXPECTED_RSP_BODY = "Hello World";
diff --git a/test/jdk/java/net/httpclient/Response204.java b/test/jdk/java/net/httpclient/Response204.java
index e68be645ff9..5ee880655b1 100644
--- a/test/jdk/java/net/httpclient/Response204.java
+++ b/test/jdk/java/net/httpclient/Response204.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2019, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -24,7 +24,7 @@
 /**
  * @test
  * @bug 8211437 8216974 8218662
- * @run main/othervm -Djdk.httpclient.HttpClient.log=headers,requests Response204
+ * @run main/othervm -Djdk.httpclient.HttpClient.log=headers,requests ${test.main.class}
  * @summary
  */
 
diff --git a/test/jdk/java/net/httpclient/Response204V2Test.java b/test/jdk/java/net/httpclient/Response204V2Test.java
index 835f7aa65f7..517f6b0c5c6 100644
--- a/test/jdk/java/net/httpclient/Response204V2Test.java
+++ b/test/jdk/java/net/httpclient/Response204V2Test.java
@@ -29,7 +29,7 @@
  *       ReferenceTracker jdk.httpclient.test.lib.common.HttpServerAdapters
  * @run junit/othervm -Djdk.internal.httpclient.debug=true
  *                     -Djdk.httpclient.HttpClient.log=requests,responses,errors
- *                     Response204V2Test
+ *                     ${test.main.class}
  * @summary Tests that streams are closed after receiving a 204 response.
  *          This test uses the OperationsTracker and will fail in
  *          teardown if the tracker reports that some HTTP/2 streams
diff --git a/test/jdk/java/net/httpclient/ResponseBodyBeforeError.java b/test/jdk/java/net/httpclient/ResponseBodyBeforeError.java
index 19393d99ee9..562176b596a 100644
--- a/test/jdk/java/net/httpclient/ResponseBodyBeforeError.java
+++ b/test/jdk/java/net/httpclient/ResponseBodyBeforeError.java
@@ -28,7 +28,7 @@
  * @modules java.net.http/jdk.internal.net.http.common
  * @library /test/lib
  * @build jdk.test.lib.net.SimpleSSLContext
- * @run junit/othervm/timeout=480 ResponseBodyBeforeError
+ * @run junit/othervm/timeout=480 ${test.main.class}
  */
 
 import java.io.Closeable;
diff --git a/test/jdk/java/net/httpclient/ResponsePublisher.java b/test/jdk/java/net/httpclient/ResponsePublisher.java
index be135e84b31..b436e6e6b18 100644
--- a/test/jdk/java/net/httpclient/ResponsePublisher.java
+++ b/test/jdk/java/net/httpclient/ResponsePublisher.java
@@ -28,7 +28,7 @@
  *          immediately with a Publisher<List<ByteBuffer>>
  * @library /test/lib /test/jdk/java/net/httpclient/lib
  * @build jdk.test.lib.net.SimpleSSLContext jdk.httpclient.test.lib.common.HttpServerAdapters
- * @run junit/othervm/timeout=480 ResponsePublisher
+ * @run junit/othervm/timeout=480 ${test.main.class}
  */
 
 import jdk.internal.net.http.common.OperationTrackers;
diff --git a/test/jdk/java/net/httpclient/RestrictedHeadersTest.java b/test/jdk/java/net/httpclient/RestrictedHeadersTest.java
index f2ddf85b3f5..108ecb6259a 100644
--- a/test/jdk/java/net/httpclient/RestrictedHeadersTest.java
+++ b/test/jdk/java/net/httpclient/RestrictedHeadersTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2022, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,10 +25,10 @@
  * @test
  * @bug 8178699
  * @modules java.net.http
- * @run main/othervm RestrictedHeadersTest
- * @run main/othervm -Djdk.httpclient.allowRestrictedHeaders=content-length,connection RestrictedHeadersTest content-length connection
- * @run main/othervm -Djdk.httpclient.allowRestrictedHeaders=host,upgrade RestrictedHeadersTest host upgrade
- * @run main/othervm -Djdk.httpclient.allowRestrictedHeaders=via RestrictedHeadersTest via
+ * @run main/othervm ${test.main.class}
+ * @run main/othervm -Djdk.httpclient.allowRestrictedHeaders=content-length,connection ${test.main.class} content-length connection
+ * @run main/othervm -Djdk.httpclient.allowRestrictedHeaders=host,upgrade ${test.main.class} host upgrade
+ * @run main/othervm -Djdk.httpclient.allowRestrictedHeaders=via ${test.main.class} via
  */
 
 import java.net.URI;
diff --git a/test/jdk/java/net/httpclient/RetryPost.java b/test/jdk/java/net/httpclient/RetryPost.java
index 67969306acc..a943b92aeea 100644
--- a/test/jdk/java/net/httpclient/RetryPost.java
+++ b/test/jdk/java/net/httpclient/RetryPost.java
@@ -24,8 +24,8 @@
 /*
  * @test
  * @summary Ensure that the POST method is retied when the property is set.
- * @run junit/othervm -Djdk.httpclient.enableAllMethodRetry RetryPost
- * @run junit/othervm -Djdk.httpclient.enableAllMethodRetry=true RetryPost
+ * @run junit/othervm -Djdk.httpclient.enableAllMethodRetry ${test.main.class}
+ * @run junit/othervm -Djdk.httpclient.enableAllMethodRetry=true ${test.main.class}
  */
 
 import java.io.IOException;
diff --git a/test/jdk/java/net/httpclient/RetryWithCookie.java b/test/jdk/java/net/httpclient/RetryWithCookie.java
index 8638693b50d..b90f9bb6809 100644
--- a/test/jdk/java/net/httpclient/RetryWithCookie.java
+++ b/test/jdk/java/net/httpclient/RetryWithCookie.java
@@ -31,7 +31,7 @@
  *        ReferenceTracker
  * @run junit/othervm
  *       -Djdk.httpclient.HttpClient.log=trace,headers,requests
- *       RetryWithCookie
+ *       ${test.main.class}
  */
 
 import jdk.test.lib.net.SimpleSSLContext;
diff --git a/test/jdk/java/net/httpclient/SSLExceptionTest.java b/test/jdk/java/net/httpclient/SSLExceptionTest.java
index cf94d1b50f7..e6c234fb9e8 100644
--- a/test/jdk/java/net/httpclient/SSLExceptionTest.java
+++ b/test/jdk/java/net/httpclient/SSLExceptionTest.java
@@ -37,7 +37,7 @@ import org.junit.jupiter.api.Test;
  * SSLcontext used by HttpClient are not available
  * @build SSLExceptionTest
  * @run junit/othervm -Djdk.tls.client.protocols="InvalidTLSv1.4"
- *                      SSLExceptionTest
+ *                      ${test.main.class}
  */
 
 public class SSLExceptionTest  {
diff --git a/test/jdk/java/net/httpclient/SendResponseHeadersTest.java b/test/jdk/java/net/httpclient/SendResponseHeadersTest.java
index 2998522616f..600a4a1f295 100644
--- a/test/jdk/java/net/httpclient/SendResponseHeadersTest.java
+++ b/test/jdk/java/net/httpclient/SendResponseHeadersTest.java
@@ -27,7 +27,7 @@
  * @library /test/lib
  * @summary Check that sendResponseHeaders throws an IOException when headers
  *  have already been sent
- * @run junit/othervm SendResponseHeadersTest
+ * @run junit/othervm ${test.main.class}
  */
 
 import com.sun.net.httpserver.HttpExchange;
diff --git a/test/jdk/java/net/httpclient/ServerCloseTest.java b/test/jdk/java/net/httpclient/ServerCloseTest.java
index d5e762b15a4..715a7b9f4a3 100644
--- a/test/jdk/java/net/httpclient/ServerCloseTest.java
+++ b/test/jdk/java/net/httpclient/ServerCloseTest.java
@@ -28,7 +28,7 @@
  * @library /test/lib /test/jdk/java/net/httpclient/lib
  * @build jdk.test.lib.net.SimpleSSLContext
  *        jdk.httpclient.test.lib.common.HttpServerAdapters
- * @run junit/othervm -Djdk.tls.acknowledgeCloseNotify=true ServerCloseTest
+ * @run junit/othervm -Djdk.tls.acknowledgeCloseNotify=true ${test.main.class}
  */
 //*        -Djdk.internal.httpclient.debug=true
 
diff --git a/test/jdk/java/net/httpclient/ShortRequestBody.java b/test/jdk/java/net/httpclient/ShortRequestBody.java
index ffebdeec5ce..274a129c320 100644
--- a/test/jdk/java/net/httpclient/ShortRequestBody.java
+++ b/test/jdk/java/net/httpclient/ShortRequestBody.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2015, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2015, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -58,7 +58,7 @@ import static java.nio.charset.StandardCharsets.UTF_8;
  * @bug 8151441
  * @summary Request body of incorrect (larger or smaller) sizes than that
  *          reported by the body publisher
- * @run main/othervm ShortRequestBody
+ * @run main/othervm ${test.main.class}
  */
 
 public class ShortRequestBody {
diff --git a/test/jdk/java/net/httpclient/ShortResponseBodyGet.java b/test/jdk/java/net/httpclient/ShortResponseBodyGet.java
index 47be508c8c1..f5393fe940b 100644
--- a/test/jdk/java/net/httpclient/ShortResponseBodyGet.java
+++ b/test/jdk/java/net/httpclient/ShortResponseBodyGet.java
@@ -30,7 +30,7 @@
  * @build jdk.test.lib.net.SimpleSSLContext ShortResponseBody ShortResponseBodyGet
  * @run junit/othervm
  *       -Djdk.httpclient.HttpClient.log=headers,errors,channel
- *       ShortResponseBodyGet
+ *       ${test.main.class}
  */
 
 import java.io.IOException;
diff --git a/test/jdk/java/net/httpclient/ShortResponseBodyPost.java b/test/jdk/java/net/httpclient/ShortResponseBodyPost.java
index 60d2796b34f..5a88455fc54 100644
--- a/test/jdk/java/net/httpclient/ShortResponseBodyPost.java
+++ b/test/jdk/java/net/httpclient/ShortResponseBodyPost.java
@@ -31,7 +31,7 @@
  * @run junit/othervm
  *       -Djdk.httpclient.HttpClient.log=headers,errors,channel
  *       -Djdk.internal.httpclient.debug=true
- *       ShortResponseBodyPost
+ *       ${test.main.class}
  */
 
 import java.io.IOException;
diff --git a/test/jdk/java/net/httpclient/ShutdownNow.java b/test/jdk/java/net/httpclient/ShutdownNow.java
index e48667d2c69..0fdc7b2acc3 100644
--- a/test/jdk/java/net/httpclient/ShutdownNow.java
+++ b/test/jdk/java/net/httpclient/ShutdownNow.java
@@ -35,7 +35,7 @@
  * @run junit/othervm
  *       -Djdk.internal.httpclient.debug=true
  *       -Djdk.httpclient.HttpClient.log=trace,headers,requests
- *       ShutdownNow
+ *       ${test.main.class}
  */
 // -Djdk.internal.httpclient.debug=true
 
diff --git a/test/jdk/java/net/httpclient/SmallTimeout.java b/test/jdk/java/net/httpclient/SmallTimeout.java
index 76117ef3075..8ca08b9b65d 100644
--- a/test/jdk/java/net/httpclient/SmallTimeout.java
+++ b/test/jdk/java/net/httpclient/SmallTimeout.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2015, 2022, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2015, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -46,12 +46,12 @@ import static java.lang.System.out;
  * @bug 8178147
  * @modules java.net.http/jdk.internal.net.http.common
  * @summary Ensures that small timeouts do not cause hangs due to race conditions
- * @run main/othervm -Djdk.internal.httpclient.debug=true SmallTimeout
+ * @run main/othervm -Djdk.internal.httpclient.debug=true ${test.main.class}
  */
 
 // To enable logging use. Not enabled by default as it changes the dynamics
 // of the test.
-// @run main/othervm -Djdk.httpclient.HttpClient.log=all,frames:all SmallTimeout
+// @run main/othervm -Djdk.httpclient.HttpClient.log=all,frames:all ${test.main.class}
 
 public class SmallTimeout {
 
diff --git a/test/jdk/java/net/httpclient/SmokeTest.java b/test/jdk/java/net/httpclient/SmokeTest.java
index f87cc462fac..487e6cbe21a 100644
--- a/test/jdk/java/net/httpclient/SmokeTest.java
+++ b/test/jdk/java/net/httpclient/SmokeTest.java
@@ -30,7 +30,7 @@
  * @run main/othervm
  *      -Djdk.internal.httpclient.debug=true
  *      -Djdk.httpclient.HttpClient.log=errors,ssl,trace
- *      SmokeTest
+ *      ${test.main.class}
  */
 
 import java.net.InetAddress;
diff --git a/test/jdk/java/net/httpclient/SpecialHeadersTest.java b/test/jdk/java/net/httpclient/SpecialHeadersTest.java
index d4d5f2a85e2..4e022c5b273 100644
--- a/test/jdk/java/net/httpclient/SpecialHeadersTest.java
+++ b/test/jdk/java/net/httpclient/SpecialHeadersTest.java
@@ -33,10 +33,10 @@
  * @requires (vm.compMode != "Xcomp")
  * @run junit/othervm/timeout=480
  *       -Djdk.httpclient.HttpClient.log=requests,headers,errors
- *       SpecialHeadersTest
+ *       ${test.main.class}
  * @run junit/othervm/timeout=480 -Djdk.httpclient.allowRestrictedHeaders=Host
  *       -Djdk.httpclient.HttpClient.log=requests,headers,errors
- *       SpecialHeadersTest
+ *       ${test.main.class}
  */
 
 import jdk.internal.net.http.common.OperationTrackers.Tracker;
diff --git a/test/jdk/java/net/httpclient/SplitResponse.java b/test/jdk/java/net/httpclient/SplitResponse.java
index abc972fd591..4e0c6b2ba6c 100644
--- a/test/jdk/java/net/httpclient/SplitResponse.java
+++ b/test/jdk/java/net/httpclient/SplitResponse.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2015, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2015, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -54,7 +54,7 @@ import static java.net.http.HttpResponse.BodyHandlers.ofString;
  * @run main/othervm/timeout=480
  *     -Djdk.internal.httpclient.debug=true
  *     -Djdk.httpclient.HttpClient.log=all
- *     SplitResponse HTTP connection:CLOSE mode:SYNC
+ *     ${test.main.class} HTTP connection:CLOSE mode:SYNC
  */
 
 /**
diff --git a/test/jdk/java/net/httpclient/StreamCloseTest.java b/test/jdk/java/net/httpclient/StreamCloseTest.java
index 7b228e69de2..49e03a54c59 100644
--- a/test/jdk/java/net/httpclient/StreamCloseTest.java
+++ b/test/jdk/java/net/httpclient/StreamCloseTest.java
@@ -30,7 +30,7 @@
  * @library /test/lib
  * @build jdk.httpclient.test.lib.common.HttpServerAdapters
  *        jdk.httpclient.test.lib.http2.Http2TestServer
- * @run junit/othervm StreamCloseTest
+ * @run junit/othervm ${test.main.class}
  */
 
 import java.io.InputStream;
diff --git a/test/jdk/java/net/httpclient/SubscriberAPIExceptions.java b/test/jdk/java/net/httpclient/SubscriberAPIExceptions.java
index 93f55d066e9..1902abb4a26 100644
--- a/test/jdk/java/net/httpclient/SubscriberAPIExceptions.java
+++ b/test/jdk/java/net/httpclient/SubscriberAPIExceptions.java
@@ -49,7 +49,7 @@ import org.junit.jupiter.api.Test;
  * @test
  * @summary Basic tests for API specified exceptions from Handler,
  *          and Subscriber convenience static factory methods.
- * @run junit SubscriberAPIExceptions
+ * @run junit ${test.main.class}
  */
 
 public class SubscriberAPIExceptions {
diff --git a/test/jdk/java/net/httpclient/TestKitTest.java b/test/jdk/java/net/httpclient/TestKitTest.java
index 2aba794426f..28a1bab5a69 100644
--- a/test/jdk/java/net/httpclient/TestKitTest.java
+++ b/test/jdk/java/net/httpclient/TestKitTest.java
@@ -41,7 +41,7 @@ import org.junit.jupiter.api.Test;
 /*
  * @test
  * @compile TestKit.java
- * @run junit TestKitTest
+ * @run junit ${test.main.class}
  */
 public final class TestKitTest {
 
diff --git a/test/jdk/java/net/httpclient/ThrowingPublishersCustomAfterCancel.java b/test/jdk/java/net/httpclient/ThrowingPublishersCustomAfterCancel.java
index 2c1aa2fd9b4..43d3bebf2e4 100644
--- a/test/jdk/java/net/httpclient/ThrowingPublishersCustomAfterCancel.java
+++ b/test/jdk/java/net/httpclient/ThrowingPublishersCustomAfterCancel.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -31,7 +31,7 @@
  *        jdk.httpclient.test.lib.common.HttpServerAdapters
  * @run junit/othervm -Djdk.internal.httpclient.debug=true
  *                     -Djdk.httpclient.enableAllMethodRetry=true
- *                     ThrowingPublishersCustomAfterCancel
+ *                     ${test.main.class}
  */
 
 
diff --git a/test/jdk/java/net/httpclient/ThrowingPublishersCustomBeforeCancel.java b/test/jdk/java/net/httpclient/ThrowingPublishersCustomBeforeCancel.java
index ba734185464..e0ff3e2e42a 100644
--- a/test/jdk/java/net/httpclient/ThrowingPublishersCustomBeforeCancel.java
+++ b/test/jdk/java/net/httpclient/ThrowingPublishersCustomBeforeCancel.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -31,7 +31,7 @@
  *        jdk.httpclient.test.lib.common.HttpServerAdapters
  * @run junit/othervm -Djdk.internal.httpclient.debug=true
  *                     -Djdk.httpclient.enableAllMethodRetry=true
- *                     ThrowingPublishersCustomBeforeCancel
+ *                     ${test.main.class}
  */
 
 
diff --git a/test/jdk/java/net/httpclient/ThrowingPublishersIOAfterCancel.java b/test/jdk/java/net/httpclient/ThrowingPublishersIOAfterCancel.java
index a5e819942b4..023a2281bce 100644
--- a/test/jdk/java/net/httpclient/ThrowingPublishersIOAfterCancel.java
+++ b/test/jdk/java/net/httpclient/ThrowingPublishersIOAfterCancel.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -31,7 +31,7 @@
  *        jdk.httpclient.test.lib.common.HttpServerAdapters
  * @run junit/othervm -Djdk.internal.httpclient.debug=true
  *                     -Djdk.httpclient.enableAllMethodRetry=true
- *                     ThrowingPublishersIOAfterCancel
+ *                     ${test.main.class}
  */
 
 
diff --git a/test/jdk/java/net/httpclient/ThrowingPublishersIOBeforeCancel.java b/test/jdk/java/net/httpclient/ThrowingPublishersIOBeforeCancel.java
index e68f83052bd..54ddbebdd82 100644
--- a/test/jdk/java/net/httpclient/ThrowingPublishersIOBeforeCancel.java
+++ b/test/jdk/java/net/httpclient/ThrowingPublishersIOBeforeCancel.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -31,7 +31,7 @@
  *        jdk.httpclient.test.lib.common.HttpServerAdapters
  * @run junit/othervm -Djdk.internal.httpclient.debug=true
  *                     -Djdk.httpclient.enableAllMethodRetry=true
- *                     ThrowingPublishersIOBeforeCancel
+ *                     ${test.main.class}
  */
 
 
diff --git a/test/jdk/java/net/httpclient/ThrowingPublishersInNextRequest.java b/test/jdk/java/net/httpclient/ThrowingPublishersInNextRequest.java
index 62d06fd6019..d690a2bbb3b 100644
--- a/test/jdk/java/net/httpclient/ThrowingPublishersInNextRequest.java
+++ b/test/jdk/java/net/httpclient/ThrowingPublishersInNextRequest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -31,7 +31,7 @@
  *        jdk.httpclient.test.lib.common.HttpServerAdapters
  * @run junit/othervm -Djdk.internal.httpclient.debug=true
  *                     -Djdk.httpclient.enableAllMethodRetry=true
- *                     ThrowingPublishersInNextRequest
+ *                     ${test.main.class}
  */
 
 
diff --git a/test/jdk/java/net/httpclient/ThrowingPublishersInRequest.java b/test/jdk/java/net/httpclient/ThrowingPublishersInRequest.java
index f863f3598ed..c8255ba5fff 100644
--- a/test/jdk/java/net/httpclient/ThrowingPublishersInRequest.java
+++ b/test/jdk/java/net/httpclient/ThrowingPublishersInRequest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -31,7 +31,7 @@
  *        jdk.httpclient.test.lib.common.HttpServerAdapters
  * @run junit/othervm -Djdk.internal.httpclient.debug=true
  *                     -Djdk.httpclient.enableAllMethodRetry=true
- *                     ThrowingPublishersInRequest
+ *                     ${test.main.class}
  */
 
 
diff --git a/test/jdk/java/net/httpclient/ThrowingPublishersInSubscribe.java b/test/jdk/java/net/httpclient/ThrowingPublishersInSubscribe.java
index ce1ad89dc05..400e28e17fc 100644
--- a/test/jdk/java/net/httpclient/ThrowingPublishersInSubscribe.java
+++ b/test/jdk/java/net/httpclient/ThrowingPublishersInSubscribe.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -31,7 +31,7 @@
  *        jdk.httpclient.test.lib.common.HttpServerAdapters
  * @run junit/othervm -Djdk.internal.httpclient.debug=true
  *                     -Djdk.httpclient.enableAllMethodRetry=true
- *                     ThrowingPublishersInSubscribe
+ *                     ${test.main.class}
  */
 
 
diff --git a/test/jdk/java/net/httpclient/ThrowingPublishersSanity.java b/test/jdk/java/net/httpclient/ThrowingPublishersSanity.java
index eee2f9ab7fb..e14ced23514 100644
--- a/test/jdk/java/net/httpclient/ThrowingPublishersSanity.java
+++ b/test/jdk/java/net/httpclient/ThrowingPublishersSanity.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -31,7 +31,7 @@
  *        jdk.httpclient.test.lib.common.HttpServerAdapters
  * @run junit/othervm -Djdk.internal.httpclient.debug=true
  *                     -Djdk.httpclient.enableAllMethodRetry=true
- *                     ThrowingPublishersSanity
+ *                     ${test.main.class}
  */
 
 import org.junit.jupiter.params.ParameterizedTest;
diff --git a/test/jdk/java/net/httpclient/ThrowingPushPromisesAsInputStreamCustom.java b/test/jdk/java/net/httpclient/ThrowingPushPromisesAsInputStreamCustom.java
index 797507ac7ad..a70f8f1b3f3 100644
--- a/test/jdk/java/net/httpclient/ThrowingPushPromisesAsInputStreamCustom.java
+++ b/test/jdk/java/net/httpclient/ThrowingPushPromisesAsInputStreamCustom.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -30,7 +30,7 @@
  * @build jdk.test.lib.net.SimpleSSLContext
  *       ReferenceTracker AbstractThrowingPushPromises ThrowingPushPromisesAsInputStreamCustom
  *       jdk.httpclient.test.lib.common.HttpServerAdapters
- * @run junit/othervm -Djdk.internal.httpclient.debug=true ThrowingPushPromisesAsInputStreamCustom
+ * @run junit/othervm -Djdk.internal.httpclient.debug=true ${test.main.class}
  */
 
 import org.junit.jupiter.params.ParameterizedTest;
diff --git a/test/jdk/java/net/httpclient/ThrowingPushPromisesAsInputStreamIO.java b/test/jdk/java/net/httpclient/ThrowingPushPromisesAsInputStreamIO.java
index 309f60c0f22..04fd641f66a 100644
--- a/test/jdk/java/net/httpclient/ThrowingPushPromisesAsInputStreamIO.java
+++ b/test/jdk/java/net/httpclient/ThrowingPushPromisesAsInputStreamIO.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -30,7 +30,7 @@
  * @build jdk.test.lib.net.SimpleSSLContext
  *        ReferenceTracker AbstractThrowingPushPromises ThrowingPushPromisesAsInputStreamIO
  *        jdk.httpclient.test.lib.common.HttpServerAdapters
- * @run junit/othervm -Djdk.internal.httpclient.debug=true ThrowingPushPromisesAsInputStreamIO
+ * @run junit/othervm -Djdk.internal.httpclient.debug=true ${test.main.class}
  */
 
 import org.junit.jupiter.params.ParameterizedTest;
diff --git a/test/jdk/java/net/httpclient/ThrowingPushPromisesAsLinesCustom.java b/test/jdk/java/net/httpclient/ThrowingPushPromisesAsLinesCustom.java
index 77c87151e19..59cae941d6d 100644
--- a/test/jdk/java/net/httpclient/ThrowingPushPromisesAsLinesCustom.java
+++ b/test/jdk/java/net/httpclient/ThrowingPushPromisesAsLinesCustom.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -30,7 +30,7 @@
  * @build jdk.test.lib.net.SimpleSSLContext
  *        ReferenceTracker AbstractThrowingPushPromises ThrowingPushPromisesAsLinesCustom
  *        jdk.httpclient.test.lib.common.HttpServerAdapters
- * @run junit/othervm -Djdk.internal.httpclient.debug=true ThrowingPushPromisesAsLinesCustom
+ * @run junit/othervm -Djdk.internal.httpclient.debug=true ${test.main.class}
  */
 
 import org.junit.jupiter.params.ParameterizedTest;
diff --git a/test/jdk/java/net/httpclient/ThrowingPushPromisesAsLinesIO.java b/test/jdk/java/net/httpclient/ThrowingPushPromisesAsLinesIO.java
index 69deeec533a..f346829fe19 100644
--- a/test/jdk/java/net/httpclient/ThrowingPushPromisesAsLinesIO.java
+++ b/test/jdk/java/net/httpclient/ThrowingPushPromisesAsLinesIO.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -30,7 +30,7 @@
  * @build jdk.test.lib.net.SimpleSSLContext
  *        ReferenceTracker AbstractThrowingPushPromises ThrowingPushPromisesAsLinesIO
  *        jdk.httpclient.test.lib.common.HttpServerAdapters
- * @run junit/othervm -Djdk.internal.httpclient.debug=true ThrowingPushPromisesAsLinesIO
+ * @run junit/othervm -Djdk.internal.httpclient.debug=true ${test.main.class}
  */
 
 import org.junit.jupiter.params.ParameterizedTest;
diff --git a/test/jdk/java/net/httpclient/ThrowingPushPromisesAsStringCustom.java b/test/jdk/java/net/httpclient/ThrowingPushPromisesAsStringCustom.java
index de38cf4f782..7180784c553 100644
--- a/test/jdk/java/net/httpclient/ThrowingPushPromisesAsStringCustom.java
+++ b/test/jdk/java/net/httpclient/ThrowingPushPromisesAsStringCustom.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -30,7 +30,7 @@
  * @build jdk.test.lib.net.SimpleSSLContext
  *        ReferenceTracker AbstractThrowingPushPromises ThrowingPushPromisesAsStringCustom
  *        jdk.httpclient.test.lib.common.HttpServerAdapters
- * @run junit/othervm -Djdk.internal.httpclient.debug=true ThrowingPushPromisesAsStringCustom
+ * @run junit/othervm -Djdk.internal.httpclient.debug=true ${test.main.class}
  */
 
 import org.junit.jupiter.params.ParameterizedTest;
diff --git a/test/jdk/java/net/httpclient/ThrowingPushPromisesAsStringIO.java b/test/jdk/java/net/httpclient/ThrowingPushPromisesAsStringIO.java
index ec4d682d73f..ea56f30e11f 100644
--- a/test/jdk/java/net/httpclient/ThrowingPushPromisesAsStringIO.java
+++ b/test/jdk/java/net/httpclient/ThrowingPushPromisesAsStringIO.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -30,7 +30,7 @@
  * @build jdk.test.lib.net.SimpleSSLContext
  *        ReferenceTracker AbstractThrowingPushPromises ThrowingPushPromisesAsStringIO
  *        jdk.httpclient.test.lib.common.HttpServerAdapters
- * @run junit/othervm -Djdk.internal.httpclient.debug=true ThrowingPushPromisesAsStringIO
+ * @run junit/othervm -Djdk.internal.httpclient.debug=true ${test.main.class}
  */
 
 import org.junit.jupiter.params.ParameterizedTest;
diff --git a/test/jdk/java/net/httpclient/ThrowingPushPromisesSanity.java b/test/jdk/java/net/httpclient/ThrowingPushPromisesSanity.java
index 92f2ab3726d..aeaec438ec4 100644
--- a/test/jdk/java/net/httpclient/ThrowingPushPromisesSanity.java
+++ b/test/jdk/java/net/httpclient/ThrowingPushPromisesSanity.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -30,7 +30,7 @@
  * @build jdk.test.lib.net.SimpleSSLContext
  *        ReferenceTracker AbstractThrowingPushPromises ThrowingPushPromisesSanity
  *        jdk.httpclient.test.lib.common.HttpServerAdapters
- * @run junit/othervm -Djdk.internal.httpclient.debug=true ThrowingPushPromisesSanity
+ * @run junit/othervm -Djdk.internal.httpclient.debug=true ${test.main.class}
  */
 
 import org.junit.jupiter.params.ParameterizedTest;
diff --git a/test/jdk/java/net/httpclient/ThrowingSubscribersAsInputStream.java b/test/jdk/java/net/httpclient/ThrowingSubscribersAsInputStream.java
index a4c0fc72004..77d1992e948 100644
--- a/test/jdk/java/net/httpclient/ThrowingSubscribersAsInputStream.java
+++ b/test/jdk/java/net/httpclient/ThrowingSubscribersAsInputStream.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -29,7 +29,7 @@
  * @build jdk.test.lib.net.SimpleSSLContext
  *        ReferenceTracker ThrowingSubscribersAsInputStream AbstractThrowingSubscribers
  *        jdk.httpclient.test.lib.common.HttpServerAdapters
- * @run junit/othervm -Djdk.internal.httpclient.debug=true ThrowingSubscribersAsInputStream
+ * @run junit/othervm -Djdk.internal.httpclient.debug=true ${test.main.class}
  */
 
 import org.junit.jupiter.params.ParameterizedTest;
diff --git a/test/jdk/java/net/httpclient/ThrowingSubscribersAsInputStreamAsync.java b/test/jdk/java/net/httpclient/ThrowingSubscribersAsInputStreamAsync.java
index aec4641917c..68df5a2b8b3 100644
--- a/test/jdk/java/net/httpclient/ThrowingSubscribersAsInputStreamAsync.java
+++ b/test/jdk/java/net/httpclient/ThrowingSubscribersAsInputStreamAsync.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -29,7 +29,7 @@
  * @build jdk.test.lib.net.SimpleSSLContext
  *        ReferenceTracker ThrowingSubscribersAsInputStreamAsync AbstractThrowingSubscribers
  *        jdk.httpclient.test.lib.common.HttpServerAdapters
- * @run junit/othervm -Djdk.internal.httpclient.debug=true ThrowingSubscribersAsInputStreamAsync
+ * @run junit/othervm -Djdk.internal.httpclient.debug=true ${test.main.class}
  */
 
 import org.junit.jupiter.params.ParameterizedTest;
diff --git a/test/jdk/java/net/httpclient/ThrowingSubscribersAsLimiting.java b/test/jdk/java/net/httpclient/ThrowingSubscribersAsLimiting.java
index 603a8558856..1a9ffe9c182 100644
--- a/test/jdk/java/net/httpclient/ThrowingSubscribersAsLimiting.java
+++ b/test/jdk/java/net/httpclient/ThrowingSubscribersAsLimiting.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2025, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -35,7 +35,7 @@
  *        ReferenceTracker
  *        jdk.httpclient.test.lib.common.HttpServerAdapters
  *        jdk.test.lib.net.SimpleSSLContext
- * @run junit/othervm -Djdk.internal.httpclient.debug=true ThrowingSubscribersAsLimiting
+ * @run junit/othervm -Djdk.internal.httpclient.debug=true ${test.main.class}
  */
 
 
diff --git a/test/jdk/java/net/httpclient/ThrowingSubscribersAsLimitingAsync.java b/test/jdk/java/net/httpclient/ThrowingSubscribersAsLimitingAsync.java
index e45c6d6487e..31b807beea0 100644
--- a/test/jdk/java/net/httpclient/ThrowingSubscribersAsLimitingAsync.java
+++ b/test/jdk/java/net/httpclient/ThrowingSubscribersAsLimitingAsync.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2025, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -35,7 +35,7 @@
  *        ReferenceTracker
  *        jdk.httpclient.test.lib.common.HttpServerAdapters
  *        jdk.test.lib.net.SimpleSSLContext
- * @run junit/othervm -Djdk.internal.httpclient.debug=true ThrowingSubscribersAsLimitingAsync
+ * @run junit/othervm -Djdk.internal.httpclient.debug=true ${test.main.class}
  */
 
 import org.junit.jupiter.params.ParameterizedTest;
diff --git a/test/jdk/java/net/httpclient/ThrowingSubscribersAsLines.java b/test/jdk/java/net/httpclient/ThrowingSubscribersAsLines.java
index ba594166b72..9915b921b1f 100644
--- a/test/jdk/java/net/httpclient/ThrowingSubscribersAsLines.java
+++ b/test/jdk/java/net/httpclient/ThrowingSubscribersAsLines.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -29,7 +29,7 @@
  * @build jdk.test.lib.net.SimpleSSLContext
  *        ReferenceTracker ThrowingSubscribersAsLines AbstractThrowingSubscribers
  *        jdk.httpclient.test.lib.common.HttpServerAdapters
- * @run junit/othervm -Djdk.internal.httpclient.debug=true ThrowingSubscribersAsLines
+ * @run junit/othervm -Djdk.internal.httpclient.debug=true ${test.main.class}
  */
 
 import org.junit.jupiter.params.ParameterizedTest;
diff --git a/test/jdk/java/net/httpclient/ThrowingSubscribersAsLinesAsync.java b/test/jdk/java/net/httpclient/ThrowingSubscribersAsLinesAsync.java
index a76ff882463..4fd41b987d0 100644
--- a/test/jdk/java/net/httpclient/ThrowingSubscribersAsLinesAsync.java
+++ b/test/jdk/java/net/httpclient/ThrowingSubscribersAsLinesAsync.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -29,7 +29,7 @@
  * @build jdk.test.lib.net.SimpleSSLContext
  *        ReferenceTracker ThrowingSubscribersAsLinesAsync AbstractThrowingSubscribers
  *        jdk.httpclient.test.lib.common.HttpServerAdapters
- * @run junit/othervm -Djdk.internal.httpclient.debug=true ThrowingSubscribersAsLinesAsync
+ * @run junit/othervm -Djdk.internal.httpclient.debug=true ${test.main.class}
  */
 
 import org.junit.jupiter.params.ParameterizedTest;
diff --git a/test/jdk/java/net/httpclient/ThrowingSubscribersAsString.java b/test/jdk/java/net/httpclient/ThrowingSubscribersAsString.java
index ba550675096..4fe15f99448 100644
--- a/test/jdk/java/net/httpclient/ThrowingSubscribersAsString.java
+++ b/test/jdk/java/net/httpclient/ThrowingSubscribersAsString.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -29,7 +29,7 @@
  * @build jdk.test.lib.net.SimpleSSLContext
  *        ReferenceTracker ThrowingSubscribersAsString AbstractThrowingSubscribers
  *        jdk.httpclient.test.lib.common.HttpServerAdapters
- * @run junit/othervm -Djdk.internal.httpclient.debug=true ThrowingSubscribersAsString
+ * @run junit/othervm -Djdk.internal.httpclient.debug=true ${test.main.class}
  */
 
 import org.junit.jupiter.params.ParameterizedTest;
diff --git a/test/jdk/java/net/httpclient/ThrowingSubscribersAsStringAsync.java b/test/jdk/java/net/httpclient/ThrowingSubscribersAsStringAsync.java
index 304d98e6939..879f0fad5a3 100644
--- a/test/jdk/java/net/httpclient/ThrowingSubscribersAsStringAsync.java
+++ b/test/jdk/java/net/httpclient/ThrowingSubscribersAsStringAsync.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -29,7 +29,7 @@
  * @build jdk.test.lib.net.SimpleSSLContext
  *        ReferenceTracker ThrowingSubscribersAsStringAsync AbstractThrowingSubscribers
  *        jdk.httpclient.test.lib.common.HttpServerAdapters
- * @run junit/othervm -Djdk.internal.httpclient.debug=true ThrowingSubscribersAsStringAsync
+ * @run junit/othervm -Djdk.internal.httpclient.debug=true ${test.main.class}
  */
 
 import org.junit.jupiter.params.ParameterizedTest;
diff --git a/test/jdk/java/net/httpclient/ThrowingSubscribersSanity.java b/test/jdk/java/net/httpclient/ThrowingSubscribersSanity.java
index 296e9151c9e..9481d64e195 100644
--- a/test/jdk/java/net/httpclient/ThrowingSubscribersSanity.java
+++ b/test/jdk/java/net/httpclient/ThrowingSubscribersSanity.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -29,7 +29,7 @@
  * @build jdk.test.lib.net.SimpleSSLContext
  *        ReferenceTracker ThrowingSubscribersSanity AbstractThrowingSubscribers
  *        jdk.httpclient.test.lib.common.HttpServerAdapters
- * @run junit/othervm -Djdk.internal.httpclient.debug=true ThrowingSubscribersSanity
+ * @run junit/othervm -Djdk.internal.httpclient.debug=true ${test.main.class}
  */
 
 import org.junit.jupiter.params.ParameterizedTest;
diff --git a/test/jdk/java/net/httpclient/TimeoutBasic.java b/test/jdk/java/net/httpclient/TimeoutBasic.java
index cae1cda7ade..ba986bbc0d2 100644
--- a/test/jdk/java/net/httpclient/TimeoutBasic.java
+++ b/test/jdk/java/net/httpclient/TimeoutBasic.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2015, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2015, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -60,7 +60,7 @@ import static java.net.http.HttpOption.H3_DISCOVERY;
  * @library /test/lib
  * @build jdk.test.lib.net.SimpleSSLContext
  * @summary Basic tests for response timeouts
- * @run main/othervm TimeoutBasic
+ * @run main/othervm ${test.main.class}
  */
 
 public class TimeoutBasic {
diff --git a/test/jdk/java/net/httpclient/TimeoutOrdering.java b/test/jdk/java/net/httpclient/TimeoutOrdering.java
index a39242c871a..ebe8cb3324e 100644
--- a/test/jdk/java/net/httpclient/TimeoutOrdering.java
+++ b/test/jdk/java/net/httpclient/TimeoutOrdering.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2015, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2015, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -41,11 +41,11 @@ import static java.lang.System.out;
 /**
  * @test
  * @summary Ensures that timeouts of multiple requests are handled in correct order
- * @run main/othervm TimeoutOrdering
+ * @run main/othervm ${test.main.class}
  */
 
 // To enable logging use
-// @run main/othervm -Djdk.httpclient.HttpClient.log=all,frames:all TimeoutOrdering
+// @run main/othervm -Djdk.httpclient.HttpClient.log=all,frames:all ${test.main.class}
 
 public class TimeoutOrdering {
 
diff --git a/test/jdk/java/net/httpclient/TimeoutResponseBodyTest.java b/test/jdk/java/net/httpclient/TimeoutResponseBodyTest.java
index 093885a6ba0..9a09b5acf90 100644
--- a/test/jdk/java/net/httpclient/TimeoutResponseBodyTest.java
+++ b/test/jdk/java/net/httpclient/TimeoutResponseBodyTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2025, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -55,7 +55,7 @@ import static org.junit.jupiter.api.Assertions.fail;
  *      -Djdk.httpclient.disableRetryConnect
  *      -Djdk.httpclient.redirects.retrylimit=0
  *      -Dtest.requestTimeoutMillis=1000
- *      TimeoutResponseBodyTest
+ *      ${test.main.class}
  */
 
 /*
@@ -79,7 +79,7 @@ import static org.junit.jupiter.api.Assertions.fail;
  *      -Djdk.httpclient.redirects.retrylimit=3
  *      -Dtest.requestTimeoutMillis=1000
  *      -Dtest.responseFailureWaitDurationMillis=600
- *      TimeoutResponseBodyTest
+ *      ${test.main.class}
  */
 
 /**
diff --git a/test/jdk/java/net/httpclient/TimeoutResponseHeaderTest.java b/test/jdk/java/net/httpclient/TimeoutResponseHeaderTest.java
index ab562f8eab8..6ea2da4c21e 100644
--- a/test/jdk/java/net/httpclient/TimeoutResponseHeaderTest.java
+++ b/test/jdk/java/net/httpclient/TimeoutResponseHeaderTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2025, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -52,7 +52,7 @@ import static org.junit.jupiter.api.Assertions.assertTimeoutPreemptively;
  *      -Djdk.httpclient.disableRetryConnect
  *      -Djdk.httpclient.redirects.retrylimit=0
  *      -Dtest.requestTimeoutMillis=1000
- *      TimeoutResponseHeaderTest
+ *      ${test.main.class}
  */
 
 /*
@@ -76,7 +76,7 @@ import static org.junit.jupiter.api.Assertions.assertTimeoutPreemptively;
  *      -Djdk.httpclient.redirects.retrylimit=3
  *      -Dtest.requestTimeoutMillis=1000
  *      -Dtest.responseFailureWaitDurationMillis=600
- *      TimeoutResponseHeaderTest
+ *      ${test.main.class}
  */
 
 /**
diff --git a/test/jdk/java/net/httpclient/TlsContextTest.java b/test/jdk/java/net/httpclient/TlsContextTest.java
index 95cb501d24c..052b20f94eb 100644
--- a/test/jdk/java/net/httpclient/TlsContextTest.java
+++ b/test/jdk/java/net/httpclient/TlsContextTest.java
@@ -63,7 +63,7 @@ import org.junit.jupiter.params.provider.MethodSource;
  *                   -Djdk.httpclient.HttpClient.log=headers
  *                   -Djdk.internal.httpclient.disableHostnameVerification
  *                   -Djdk.internal.httpclient.debug=false
- *                    TlsContextTest
+ *                    ${test.main.class}
  */
 
 public class TlsContextTest implements HttpServerAdapters {
diff --git a/test/jdk/java/net/httpclient/UnauthorizedTest.java b/test/jdk/java/net/httpclient/UnauthorizedTest.java
index 1c72bac6cc9..931b9681559 100644
--- a/test/jdk/java/net/httpclient/UnauthorizedTest.java
+++ b/test/jdk/java/net/httpclient/UnauthorizedTest.java
@@ -34,7 +34,7 @@
  *        jdk.test.lib.net.SimpleSSLContext ReferenceTracker
  * @run junit/othervm
  *       -Djdk.httpclient.HttpClient.log=headers
- *       UnauthorizedTest
+ *       ${test.main.class}
  */
 
 import jdk.test.lib.net.SimpleSSLContext;
diff --git a/test/jdk/java/net/httpclient/UnknownBodyLengthTest.java b/test/jdk/java/net/httpclient/UnknownBodyLengthTest.java
index 6c7fabb7f00..4b92eb83fdd 100644
--- a/test/jdk/java/net/httpclient/UnknownBodyLengthTest.java
+++ b/test/jdk/java/net/httpclient/UnknownBodyLengthTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -47,13 +47,13 @@ import jdk.test.lib.net.SimpleSSLContext;
  * @library /test/lib
  * @build jdk.test.lib.net.SimpleSSLContext
  * @run main/othervm -Djdk.httpclient.enableAllMethodRetry
- *                   -Djdk.tls.acknowledgeCloseNotify=true UnknownBodyLengthTest plain false
+ *                   -Djdk.tls.acknowledgeCloseNotify=true ${test.main.class} plain false
  * @run main/othervm -Djdk.httpclient.enableAllMethodRetry
- *                   -Djdk.tls.acknowledgeCloseNotify=true UnknownBodyLengthTest SSL false
+ *                   -Djdk.tls.acknowledgeCloseNotify=true ${test.main.class} SSL false
  * @run main/othervm -Djdk.httpclient.enableAllMethodRetry
- *                   -Djdk.tls.acknowledgeCloseNotify=true UnknownBodyLengthTest plain true
+ *                   -Djdk.tls.acknowledgeCloseNotify=true ${test.main.class} plain true
  * @run main/othervm -Djdk.httpclient.enableAllMethodRetry
- *                   -Djdk.tls.acknowledgeCloseNotify=true UnknownBodyLengthTest SSL true
+ *                   -Djdk.tls.acknowledgeCloseNotify=true ${test.main.class} SSL true
  */
 
 public class UnknownBodyLengthTest {
diff --git a/test/jdk/java/net/httpclient/UserAuthWithAuthenticator.java b/test/jdk/java/net/httpclient/UserAuthWithAuthenticator.java
index 6062fcd9448..3f5f004738a 100644
--- a/test/jdk/java/net/httpclient/UserAuthWithAuthenticator.java
+++ b/test/jdk/java/net/httpclient/UserAuthWithAuthenticator.java
@@ -74,7 +74,7 @@ import static org.junit.jupiter.api.Assertions.assertTrue;
  * @build jdk.test.lib.net.SimpleSSLContext jdk.httpclient.test.lib.common.HttpServerAdapters
  *        jdk.httpclient.test.lib.http2.Http2TestServer
  *        jdk.test.lib.net.IPSupport
- * @run junit UserAuthWithAuthenticator
+ * @run junit ${test.main.class}
  */
 class UserAuthWithAuthenticator {
 
diff --git a/test/jdk/java/net/httpclient/UserCookieTest.java b/test/jdk/java/net/httpclient/UserCookieTest.java
index f49f44c157c..664565f6bd7 100644
--- a/test/jdk/java/net/httpclient/UserCookieTest.java
+++ b/test/jdk/java/net/httpclient/UserCookieTest.java
@@ -31,7 +31,7 @@
  * @run junit/othervm
  *       -Djdk.tls.acknowledgeCloseNotify=true
  *       -Djdk.httpclient.HttpClient.log=trace,headers,requests
- *       UserCookieTest
+ *       ${test.main.class}
  */
 
 import java.io.IOException;
diff --git a/test/jdk/java/net/httpclient/VersionTest.java b/test/jdk/java/net/httpclient/VersionTest.java
index ff864202a9a..546c0933ec5 100644
--- a/test/jdk/java/net/httpclient/VersionTest.java
+++ b/test/jdk/java/net/httpclient/VersionTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2017, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2017, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -27,7 +27,7 @@
  * @modules java.net.http java.logging jdk.httpserver
  * @library /lib/testlibrary/ /
  * @build ProxyServer
- * @run main/othervm -Djdk.httpclient.HttpClient.log=errors,requests,headers,trace VersionTest
+ * @run main/othervm -Djdk.httpclient.HttpClient.log=errors,requests,headers,trace ${test.main.class}
  */
 
 import com.sun.net.httpserver.Headers;
diff --git a/test/jdk/java/net/httpclient/ZeroRedirects.java b/test/jdk/java/net/httpclient/ZeroRedirects.java
index a842ea57930..fe62cc9e77f 100644
--- a/test/jdk/java/net/httpclient/ZeroRedirects.java
+++ b/test/jdk/java/net/httpclient/ZeroRedirects.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2017, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2017, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,7 +25,7 @@
  * @test
  * @bug 8164941
  * @modules java.net.http java.logging jdk.httpserver
- * @run main/othervm ZeroRedirects
+ * @run main/othervm ${test.main.class}
  */
 
 import com.sun.net.httpserver.HttpContext;
diff --git a/test/jdk/java/net/httpclient/altsvc/AltServiceReasonableAssurance.java b/test/jdk/java/net/httpclient/altsvc/AltServiceReasonableAssurance.java
index 0da1b238f60..fab27463d90 100644
--- a/test/jdk/java/net/httpclient/altsvc/AltServiceReasonableAssurance.java
+++ b/test/jdk/java/net/httpclient/altsvc/AltServiceReasonableAssurance.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2023, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2023, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -98,7 +98,7 @@ import static org.junit.jupiter.api.Assertions.assertTrue;
  * @run junit/othervm  -Djdk.net.hosts.file=${test.src}/altsvc-dns-hosts.txt
  *                     -Djdk.internal.httpclient.debug=true -Djavax.net.debug=all
  *                     -Djdk.httpclient.HttpClient.log=requests,responses,errors
- *                      AltServiceReasonableAssurance
+ *                      ${test.main.class}
  */
 public class AltServiceReasonableAssurance implements HttpServerAdapters {
 
diff --git a/test/jdk/java/net/httpclient/http2/BadHeadersTest.java b/test/jdk/java/net/httpclient/http2/BadHeadersTest.java
index 3bb80031178..01ff090cba7 100644
--- a/test/jdk/java/net/httpclient/http2/BadHeadersTest.java
+++ b/test/jdk/java/net/httpclient/http2/BadHeadersTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -29,7 +29,7 @@
  *          with bad header fields.
  * @library /test/lib /test/jdk/java/net/httpclient/lib
  * @build jdk.httpclient.test.lib.http2.Http2TestServer jdk.test.lib.net.SimpleSSLContext
- * @run junit/othervm -Djdk.internal.httpclient.debug=true BadHeadersTest
+ * @run junit/othervm -Djdk.internal.httpclient.debug=true ${test.main.class}
  */
 
 import jdk.internal.net.http.common.HttpHeadersBuilder;
diff --git a/test/jdk/java/net/httpclient/http2/BadPushPromiseTest.java b/test/jdk/java/net/httpclient/http2/BadPushPromiseTest.java
index 8eed173409b..8febbb8a12a 100644
--- a/test/jdk/java/net/httpclient/http2/BadPushPromiseTest.java
+++ b/test/jdk/java/net/httpclient/http2/BadPushPromiseTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2025, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -29,7 +29,7 @@
  * @run junit/othervm
  *      -Djdk.internal.httpclient.debug=true
  *      -Djdk.httpclient.HttpClient.log=errors,requests,responses,trace
- *      BadPushPromiseTest
+ *      ${test.main.class}
  */
 
 import jdk.httpclient.test.lib.common.HttpServerAdapters;
diff --git a/test/jdk/java/net/httpclient/http2/BasicTest.java b/test/jdk/java/net/httpclient/http2/BasicTest.java
index ddcf707e875..b76179f2e71 100644
--- a/test/jdk/java/net/httpclient/http2/BasicTest.java
+++ b/test/jdk/java/net/httpclient/http2/BasicTest.java
@@ -30,7 +30,7 @@
  *        jdk.test.lib.Asserts
  *        jdk.test.lib.Utils
  *        jdk.test.lib.net.SimpleSSLContext
- * @run junit/othervm -Djdk.httpclient.HttpClient.log=ssl,requests,responses,errors BasicTest
+ * @run junit/othervm -Djdk.httpclient.HttpClient.log=ssl,requests,responses,errors ${test.main.class}
  */
 
 import java.io.IOException;
diff --git a/test/jdk/java/net/httpclient/http2/ConnectionFlowControlTest.java b/test/jdk/java/net/httpclient/http2/ConnectionFlowControlTest.java
index 1b9396effbb..36c46ed3aba 100644
--- a/test/jdk/java/net/httpclient/http2/ConnectionFlowControlTest.java
+++ b/test/jdk/java/net/httpclient/http2/ConnectionFlowControlTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2024, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2024, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -30,7 +30,7 @@
  * @run junit/othervm   -Djdk.internal.httpclient.debug=err
  *                      -Djdk.httpclient.connectionWindowSize=65535
  *                      -Djdk.httpclient.windowsize=16384
- *                      ConnectionFlowControlTest
+ *                      ${test.main.class}
  */
 
 import java.io.IOException;
diff --git a/test/jdk/java/net/httpclient/http2/ConnectionReuseTest.java b/test/jdk/java/net/httpclient/http2/ConnectionReuseTest.java
index 360eabaee2b..9396ccd169f 100644
--- a/test/jdk/java/net/httpclient/http2/ConnectionReuseTest.java
+++ b/test/jdk/java/net/httpclient/http2/ConnectionReuseTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2023, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2023, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -62,9 +62,9 @@ import static org.junit.jupiter.api.Assertions.assertNotNull;
  *        jdk.test.lib.net.IPSupport
  *        jdk.httpclient.test.lib.common.HttpServerAdapters
  *
- * @run junit ConnectionReuseTest
+ * @run junit ${test.main.class}
  * @run junit/othervm -Djava.net.preferIPv6Addresses=true
- *                    -Djdk.internal.httpclient.debug=true ConnectionReuseTest
+ *                    -Djdk.internal.httpclient.debug=true ${test.main.class}
  */
 public class ConnectionReuseTest {
 
diff --git a/test/jdk/java/net/httpclient/http2/ContinuationFrameTest.java b/test/jdk/java/net/httpclient/http2/ContinuationFrameTest.java
index c72beb04d56..cd788db6c7d 100644
--- a/test/jdk/java/net/httpclient/http2/ContinuationFrameTest.java
+++ b/test/jdk/java/net/httpclient/http2/ContinuationFrameTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2017, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2017, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -27,7 +27,7 @@
  * @library /test/lib /test/jdk/java/net/httpclient/lib
  * @build jdk.httpclient.test.lib.http2.Http2TestServer jdk.test.lib.net.SimpleSSLContext
  * @compile ../ReferenceTracker.java
- * @run junit/othervm ContinuationFrameTest
+ * @run junit/othervm ${test.main.class}
  */
 
 import java.io.IOException;
diff --git a/test/jdk/java/net/httpclient/http2/ErrorTest.java b/test/jdk/java/net/httpclient/http2/ErrorTest.java
index 0f3bafa571d..3e3ce97b582 100644
--- a/test/jdk/java/net/httpclient/http2/ErrorTest.java
+++ b/test/jdk/java/net/httpclient/http2/ErrorTest.java
@@ -45,7 +45,7 @@
  *          java.net.http/jdk.internal.net.http.qpack.writers
  *          java.security.jgss
  * @modules java.base/jdk.internal.util
- * @run junit/othervm/timeout=60 -Djavax.net.debug=ssl -Djdk.httpclient.HttpClient.log=all ErrorTest
+ * @run junit/othervm/timeout=60 -Djavax.net.debug=ssl -Djdk.httpclient.HttpClient.log=all ${test.main.class}
  * @summary check exception thrown when bad TLS parameters selected
  */
 
diff --git a/test/jdk/java/net/httpclient/http2/FixedThreadPoolTest.java b/test/jdk/java/net/httpclient/http2/FixedThreadPoolTest.java
index d788d39b441..883e14e7d58 100644
--- a/test/jdk/java/net/httpclient/http2/FixedThreadPoolTest.java
+++ b/test/jdk/java/net/httpclient/http2/FixedThreadPoolTest.java
@@ -30,7 +30,7 @@
  *        jdk.test.lib.Asserts
  *        jdk.test.lib.Utils
  *        jdk.test.lib.net.SimpleSSLContext
- * @run junit/othervm -Djdk.httpclient.HttpClient.log=ssl,requests,responses,errors FixedThreadPoolTest
+ * @run junit/othervm -Djdk.httpclient.HttpClient.log=ssl,requests,responses,errors ${test.main.class}
  */
 
 import java.net.*;
diff --git a/test/jdk/java/net/httpclient/http2/H2GoAwayTest.java b/test/jdk/java/net/httpclient/http2/H2GoAwayTest.java
index 08c32171d16..f656d72f244 100644
--- a/test/jdk/java/net/httpclient/http2/H2GoAwayTest.java
+++ b/test/jdk/java/net/httpclient/http2/H2GoAwayTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2024, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2024, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -63,7 +63,7 @@ import static org.junit.jupiter.api.Assertions.fail;
  * @library /test/lib /test/jdk/java/net/httpclient/lib
  * @build jdk.httpclient.test.lib.common.HttpServerAdapters
  *        jdk.test.lib.net.SimpleSSLContext
- * @run junit H2GoAwayTest
+ * @run junit ${test.main.class}
  */
 public class H2GoAwayTest {
     private static final String REQ_PATH = "/test";
diff --git a/test/jdk/java/net/httpclient/http2/H2SelectorVTTest.java b/test/jdk/java/net/httpclient/http2/H2SelectorVTTest.java
index 7adfd57319c..552e91473d5 100644
--- a/test/jdk/java/net/httpclient/http2/H2SelectorVTTest.java
+++ b/test/jdk/java/net/httpclient/http2/H2SelectorVTTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2025, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -53,7 +53,7 @@ import static java.net.http.HttpClient.Version.HTTP_2;
  *        jdk.httpclient.test.lib.common.HttpServerAdapters
  * @run junit/othervm
  *              -Djdk.httpclient.HttpClient.log=requests,responses,headers,errors
- *              H2SelectorVTTest
+ *              ${test.main.class}
  */
 /*
  * @test id=never
@@ -66,7 +66,7 @@ import static java.net.http.HttpClient.Version.HTTP_2;
  * @run junit/othervm
  *              -Djdk.internal.httpclient.tcp.selector.useVirtualThreads=never
  *              -Djdk.httpclient.HttpClient.log=requests,responses,headers,errors
- *              H2SelectorVTTest
+ *              ${test.main.class}
  */
 /*
  * @test id=always
@@ -79,7 +79,7 @@ import static java.net.http.HttpClient.Version.HTTP_2;
  * @run junit/othervm
  *              -Djdk.internal.httpclient.tcp.selector.useVirtualThreads=always
  *              -Djdk.httpclient.HttpClient.log=requests,responses,headers,errors
- *              H2SelectorVTTest
+ *              ${test.main.class}
  */
 /*
  * @test id=explicit-default
@@ -92,7 +92,7 @@ import static java.net.http.HttpClient.Version.HTTP_2;
  * @run junit/othervm
  *              -Djdk.internal.httpclient.tcp.selector.useVirtualThreads=default
  *              -Djdk.httpclient.HttpClient.log=requests,responses,headers,errors
- *              H2SelectorVTTest
+ *              ${test.main.class}
  */
 /*
  * @test id=garbage
@@ -105,7 +105,7 @@ import static java.net.http.HttpClient.Version.HTTP_2;
  * @run junit/othervm
  *              -Djdk.internal.httpclient.tcp.selector.useVirtualThreads=garbage
  *              -Djdk.httpclient.HttpClient.log=requests,responses,headers,errors
- *              H2SelectorVTTest
+ *              ${test.main.class}
  */
 // -Djava.security.debug=all
 class H2SelectorVTTest implements HttpServerAdapters {
diff --git a/test/jdk/java/net/httpclient/http2/IdlePooledConnectionTest.java b/test/jdk/java/net/httpclient/http2/IdlePooledConnectionTest.java
index 907afc28fa6..71eb483793f 100644
--- a/test/jdk/java/net/httpclient/http2/IdlePooledConnectionTest.java
+++ b/test/jdk/java/net/httpclient/http2/IdlePooledConnectionTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2023, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2023, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -61,7 +61,7 @@ import static org.junit.jupiter.api.Assertions.assertNotNull;
  *        jdk.test.lib.Asserts
  * @run junit/othervm   -Djdk.internal.httpclient.debug=true
  *                      -Djdk.httpclient.keepalive.timeout.h2=3
- *                      IdlePooledConnectionTest
+ *                      ${test.main.class}
  */
 public class IdlePooledConnectionTest {
 
diff --git a/test/jdk/java/net/httpclient/http2/ImplicitPushCancel.java b/test/jdk/java/net/httpclient/http2/ImplicitPushCancel.java
index 5bcaf95c6fc..c273415ca63 100644
--- a/test/jdk/java/net/httpclient/http2/ImplicitPushCancel.java
+++ b/test/jdk/java/net/httpclient/http2/ImplicitPushCancel.java
@@ -28,7 +28,7 @@
  * @run junit/othervm
  *      -Djdk.internal.httpclient.debug=true
  *      -Djdk.httpclient.HttpClient.log=errors,requests,responses,trace
- *      ImplicitPushCancel
+ *      ${test.main.class}
  */
 
 import java.io.ByteArrayInputStream;
diff --git a/test/jdk/java/net/httpclient/http2/NoBodyTest.java b/test/jdk/java/net/httpclient/http2/NoBodyTest.java
index 2459c8eba4b..a67d2cd250c 100644
--- a/test/jdk/java/net/httpclient/http2/NoBodyTest.java
+++ b/test/jdk/java/net/httpclient/http2/NoBodyTest.java
@@ -28,7 +28,7 @@
  * @build jdk.test.lib.net.SimpleSSLContext jdk.httpclient.test.lib.http2.Http2TestServer
  * @run junit/othervm -Djdk.httpclient.HttpClient.log=ssl,requests,responses,errors
  *                     -Djdk.internal.httpclient.debug=true
- *                     NoBodyTest
+ *                     ${test.main.class}
  */
 
 import java.io.IOException;
diff --git a/test/jdk/java/net/httpclient/http2/PostPutTest.java b/test/jdk/java/net/httpclient/http2/PostPutTest.java
index 84e86b556ca..132d6936039 100644
--- a/test/jdk/java/net/httpclient/http2/PostPutTest.java
+++ b/test/jdk/java/net/httpclient/http2/PostPutTest.java
@@ -29,7 +29,7 @@
  * @library /test/jdk/java/net/httpclient/lib
  * @build jdk.httpclient.test.lib.http2.Http2TestServer
  * @run junit/othervm/timeout=50 -Djdk.httpclient.HttpClient.log=all
- *                      PostPutTest
+ *                      ${test.main.class}
  */
 
 import jdk.httpclient.test.lib.http2.Http2Handler;
@@ -168,4 +168,4 @@ public class PostPutTest {
             exchange.sendResponseHeaders(200, 0);
         }
     }
-}
\ No newline at end of file
+}
diff --git a/test/jdk/java/net/httpclient/http2/ProxyTest2.java b/test/jdk/java/net/httpclient/http2/ProxyTest2.java
index 762a70b95fd..75b48cb251b 100644
--- a/test/jdk/java/net/httpclient/http2/ProxyTest2.java
+++ b/test/jdk/java/net/httpclient/http2/ProxyTest2.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2017, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2017, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -58,7 +58,7 @@ import java.util.concurrent.*;
  *           tunnelling through an HTTP/1.1 proxy.
  * @library /test/lib /test/jdk/java/net/httpclient/lib
  * @build jdk.test.lib.net.SimpleSSLContext jdk.httpclient.test.lib.http2.Http2TestServer
- * @run main/othervm ProxyTest2
+ * @run main/othervm ${test.main.class}
  * @author danielfuchs
  */
 public class ProxyTest2 {
diff --git a/test/jdk/java/net/httpclient/http2/PushPromiseContinuation.java b/test/jdk/java/net/httpclient/http2/PushPromiseContinuation.java
index 2d5b5dd4f4e..5d0bfe844f4 100644
--- a/test/jdk/java/net/httpclient/http2/PushPromiseContinuation.java
+++ b/test/jdk/java/net/httpclient/http2/PushPromiseContinuation.java
@@ -31,7 +31,7 @@
  * @build jdk.test.lib.net.SimpleSSLContext jdk.httpclient.test.lib.http2.Http2TestServer
  *        jdk.httpclient.test.lib.http2.BodyOutputStream
  *        jdk.httpclient.test.lib.http2.OutgoingPushPromise
- * @run junit/othervm PushPromiseContinuation
+ * @run junit/othervm ${test.main.class}
  */
 
 import javax.net.ssl.SSLSession;
diff --git a/test/jdk/java/net/httpclient/http2/RedirectTest.java b/test/jdk/java/net/httpclient/http2/RedirectTest.java
index 201b56513f6..b5b1ca2f1d5 100644
--- a/test/jdk/java/net/httpclient/http2/RedirectTest.java
+++ b/test/jdk/java/net/httpclient/http2/RedirectTest.java
@@ -33,7 +33,7 @@
  * @run junit/othervm
  *      -Djdk.httpclient.HttpClient.log=frames,ssl,requests,responses,errors
  *      -Djdk.internal.httpclient.debug=true
- *      RedirectTest
+ *      ${test.main.class}
  */
 
 import java.net.InetSocketAddress;
diff --git a/test/jdk/java/net/httpclient/http2/ServerPush.java b/test/jdk/java/net/httpclient/http2/ServerPush.java
index d38b867132b..41200bf8949 100644
--- a/test/jdk/java/net/httpclient/http2/ServerPush.java
+++ b/test/jdk/java/net/httpclient/http2/ServerPush.java
@@ -31,7 +31,7 @@
  *        jdk.test.lib.Utils
  * @run junit/othervm
  *      -Djdk.httpclient.HttpClient.log=errors,requests,responses
- *      ServerPush
+ *      ${test.main.class}
  */
 
 import java.io.*;
diff --git a/test/jdk/java/net/httpclient/http2/ServerPushWithDiffTypes.java b/test/jdk/java/net/httpclient/http2/ServerPushWithDiffTypes.java
index 9cf2a3f7ae2..c77e258f3c5 100644
--- a/test/jdk/java/net/httpclient/http2/ServerPushWithDiffTypes.java
+++ b/test/jdk/java/net/httpclient/http2/ServerPushWithDiffTypes.java
@@ -28,7 +28,7 @@
  * @run junit/othervm
  *       -Djdk.internal.httpclient.debug=true
  *       -Djdk.httpclient.HttpClient.log=errors,requests,responses
- *       ServerPushWithDiffTypes
+ *       ${test.main.class}
  */
 
 import java.io.*;
diff --git a/test/jdk/java/net/httpclient/http2/SimpleGet.java b/test/jdk/java/net/httpclient/http2/SimpleGet.java
index 5df3174f820..1bc7e0974c7 100644
--- a/test/jdk/java/net/httpclient/http2/SimpleGet.java
+++ b/test/jdk/java/net/httpclient/http2/SimpleGet.java
@@ -27,17 +27,17 @@
  * @library /test/lib /test/jdk/java/net/httpclient/lib
  * @build jdk.test.lib.net.SimpleSSLContext jdk.httpclient.test.lib.common.TestUtil
  *        jdk.httpclient.test.lib.http2.Http2TestServer
- * @run junit/othervm -XX:+CrashOnOutOfMemoryError SimpleGet
+ * @run junit/othervm -XX:+CrashOnOutOfMemoryError ${test.main.class}
  * @run junit/othervm -XX:+CrashOnOutOfMemoryError
  *                     -Dsimpleget.repeat=1 -Dsimpleget.chunks=1 -Dsimpleget.requests=1000
- *                     SimpleGet
+ *                     ${test.main.class}
  * @run junit/othervm -Dsimpleget.requests=150
  *                     -Dsimpleget.chunks=16384
  *                     -Djdk.httpclient.redirects.retrylimit=5
  *                     -Djdk.httpclient.HttpClient.log=errors
  *                     -XX:+CrashOnOutOfMemoryError
  *                     -XX:+HeapDumpOnOutOfMemoryError
- *                      SimpleGet
+ *                      ${test.main.class}
  */
 
 import java.io.IOException;
diff --git a/test/jdk/java/net/httpclient/http2/TLSConnection.java b/test/jdk/java/net/httpclient/http2/TLSConnection.java
index e4009219bca..698a8c59ebe 100644
--- a/test/jdk/java/net/httpclient/http2/TLSConnection.java
+++ b/test/jdk/java/net/httpclient/http2/TLSConnection.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2016, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2016, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -48,7 +48,7 @@ import jdk.httpclient.test.lib.http2.Http2Handler;
  * @run main/othervm
  *       -Djdk.internal.httpclient.debug=true
  *       -Djdk.httpclient.HttpClient.log=all
- *       TLSConnection
+ *       ${test.main.class}
  */
 public class TLSConnection {
 
diff --git a/test/jdk/java/net/httpclient/http2/Timeout.java b/test/jdk/java/net/httpclient/http2/Timeout.java
index 42a51f56fab..c2f0dfdd5a1 100644
--- a/test/jdk/java/net/httpclient/http2/Timeout.java
+++ b/test/jdk/java/net/httpclient/http2/Timeout.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2016, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2016, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -43,7 +43,7 @@ import javax.net.ssl.SSLSocket;
  * @test
  * @bug 8156710
  * @summary Check if HttpTimeoutException is thrown if a server doesn't reply
- * @run main/othervm Timeout
+ * @run main/othervm ${test.main.class}
  */
 public class Timeout {
 
diff --git a/test/jdk/java/net/httpclient/http2/TrailingHeadersTest.java b/test/jdk/java/net/httpclient/http2/TrailingHeadersTest.java
index 9ea331d2d84..bff009131a8 100644
--- a/test/jdk/java/net/httpclient/http2/TrailingHeadersTest.java
+++ b/test/jdk/java/net/httpclient/http2/TrailingHeadersTest.java
@@ -28,7 +28,7 @@
  * @bug 8296410
  * @library /test/jdk/java/net/httpclient/lib
  * @build jdk.httpclient.test.lib.http2.Http2TestServer
- * @run junit/othervm -Djdk.httpclient.HttpClient.log=all TrailingHeadersTest
+ * @run junit/othervm -Djdk.httpclient.HttpClient.log=all ${test.main.class}
  */
 
 import jdk.httpclient.test.lib.http2.OutgoingPushPromise;
@@ -321,4 +321,4 @@ public class TrailingHeadersTest {
             testLog.println("PushPromiseTrailersHandler: Push Promise complete");
         }
     }
-}
\ No newline at end of file
+}
diff --git a/test/jdk/java/net/httpclient/http2/UserInfoTest.java b/test/jdk/java/net/httpclient/http2/UserInfoTest.java
index 3cea2d92570..53d9dbe3c2b 100644
--- a/test/jdk/java/net/httpclient/http2/UserInfoTest.java
+++ b/test/jdk/java/net/httpclient/http2/UserInfoTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2022, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2022, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -51,7 +51,7 @@ import static org.junit.jupiter.api.Assertions.assertEquals;
  *        jdk.test.lib.net.SimpleSSLContext
  *        jdk.httpclient.test.lib.http2.Http2TestExchange
  * @compile ../ReferenceTracker.java
- * @run junit UserInfoTest
+ * @run junit ${test.main.class}
  */
 
 @TestInstance(TestInstance.Lifecycle.PER_CLASS)
diff --git a/test/jdk/java/net/httpclient/http3/BadCipherSuiteErrorTest.java b/test/jdk/java/net/httpclient/http3/BadCipherSuiteErrorTest.java
index fdfc498b21e..2c38a4a47f4 100644
--- a/test/jdk/java/net/httpclient/http3/BadCipherSuiteErrorTest.java
+++ b/test/jdk/java/net/httpclient/http3/BadCipherSuiteErrorTest.java
@@ -26,7 +26,7 @@
  * @bug 8157105
  * @library /test/lib /test/jdk/java/net/httpclient/lib
  * @build jdk.test.lib.net.SimpleSSLContext jdk.httpclient.test.lib.common.HttpServerAdapters
- * @run junit/othervm/timeout=60 -Djavax.net.debug=ssl -Djdk.httpclient.HttpClient.log=all BadCipherSuiteErrorTest
+ * @run junit/othervm/timeout=60 -Djavax.net.debug=ssl -Djdk.httpclient.HttpClient.log=all ${test.main.class}
  * @summary check exception thrown when bad TLS parameters selected
  */
 
diff --git a/test/jdk/java/net/httpclient/http3/FramesDecoderTest.java b/test/jdk/java/net/httpclient/http3/FramesDecoderTest.java
index d406ee491cb..584acb9ef49 100644
--- a/test/jdk/java/net/httpclient/http3/FramesDecoderTest.java
+++ b/test/jdk/java/net/httpclient/http3/FramesDecoderTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2023, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2023, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -42,7 +42,7 @@ import static org.junit.jupiter.api.Assertions.*;
  * @modules java.net.http/jdk.internal.net.http.http3
  * @modules java.net.http/jdk.internal.net.http.http3.frames
  * @modules java.net.http/jdk.internal.net.http.quic.streams
- * @run junit/othervm FramesDecoderTest
+ * @run junit/othervm ${test.main.class}
  * @summary Tests to check HTTP3 methods decode frames correctly
  */
 @TestInstance(TestInstance.Lifecycle.PER_CLASS)
diff --git a/test/jdk/java/net/httpclient/http3/GetHTTP3Test.java b/test/jdk/java/net/httpclient/http3/GetHTTP3Test.java
index 800a02eb2c4..fd0bdb3c294 100644
--- a/test/jdk/java/net/httpclient/http3/GetHTTP3Test.java
+++ b/test/jdk/java/net/httpclient/http3/GetHTTP3Test.java
@@ -79,7 +79,7 @@ import org.junit.jupiter.params.provider.MethodSource;
  * @compile ../ReferenceTracker.java
  * @run junit/othervm -Djdk.internal.httpclient.debug=true
  *                     -Djdk.httpclient.HttpClient.log=requests,responses,errors
- *                     GetHTTP3Test
+ *                     ${test.main.class}
  * @summary Basic HTTP/3 GET test
  */
 //                     -Djdk.httpclient.http3.maxDirectConnectionTimeout=2500
diff --git a/test/jdk/java/net/httpclient/http3/H3BadHeadersTest.java b/test/jdk/java/net/httpclient/http3/H3BadHeadersTest.java
index fff11f4ceb4..adc4c4c7240 100644
--- a/test/jdk/java/net/httpclient/http3/H3BadHeadersTest.java
+++ b/test/jdk/java/net/httpclient/http3/H3BadHeadersTest.java
@@ -27,7 +27,7 @@
  * @build jdk.httpclient.test.lib.common.HttpServerAdapters
  *        jdk.test.lib.net.SimpleSSLContext
  * @compile ../ReferenceTracker.java
- * @run junit/othervm -Djdk.internal.httpclient.debug=true H3BadHeadersTest
+ * @run junit/othervm -Djdk.internal.httpclient.debug=true ${test.main.class}
  * @summary this test verifies the behaviour of the HttpClient when presented
  *          with bad headers
  */
diff --git a/test/jdk/java/net/httpclient/http3/H3BasicTest.java b/test/jdk/java/net/httpclient/http3/H3BasicTest.java
index bddb9879ae9..982aa88b3bc 100644
--- a/test/jdk/java/net/httpclient/http3/H3BasicTest.java
+++ b/test/jdk/java/net/httpclient/http3/H3BasicTest.java
@@ -33,7 +33,7 @@
  *        jdk.test.lib.net.SimpleSSLContext
  * @run junit/othervm -Djdk.httpclient.HttpClient.log=ssl,requests,responses,errors
  *                     -Djdk.internal.httpclient.debug=true
- *                     H3BasicTest
+ *                     ${test.main.class}
  */
 // -Dseed=-163464189156654174
 
diff --git a/test/jdk/java/net/httpclient/http3/H3ConcurrentPush.java b/test/jdk/java/net/httpclient/http3/H3ConcurrentPush.java
index 4392f829258..e15a6bbfc4d 100644
--- a/test/jdk/java/net/httpclient/http3/H3ConcurrentPush.java
+++ b/test/jdk/java/net/httpclient/http3/H3ConcurrentPush.java
@@ -29,7 +29,7 @@
  *      -Djdk.internal.httpclient.debug=true
  *      -Djdk.httpclient.HttpClient.log=errors,requests,responses,trace
  *      -Djdk.httpclient.http3.maxConcurrentPushStreams=45
- *      H3ConcurrentPush
+ *      ${test.main.class}
  * @summary This test exercises some of the HTTP/3 specifities for PushPromises.
  *      It sends several concurrent requests, and the server sends a bunch of
  *      identical push promise frames to all of them. That is, there will be
diff --git a/test/jdk/java/net/httpclient/http3/H3ConnectionPoolTest.java b/test/jdk/java/net/httpclient/http3/H3ConnectionPoolTest.java
index 12956604484..21ab06f8a5c 100644
--- a/test/jdk/java/net/httpclient/http3/H3ConnectionPoolTest.java
+++ b/test/jdk/java/net/httpclient/http3/H3ConnectionPoolTest.java
@@ -32,7 +32,7 @@
  *                     -Djdk.httpclient.keepalive.timeout.h3=480
  *                     -Djdk.httpclient.quic.idleTimeout=480
  *                     -Djdk.test.server.quic.idleTimeout=480
- *                     H3ConnectionPoolTest
+ *                     ${test.main.class}
  */
 
 import java.io.IOException;
diff --git a/test/jdk/java/net/httpclient/http3/H3DataLimitsTest.java b/test/jdk/java/net/httpclient/http3/H3DataLimitsTest.java
index 8a83b51a174..51c30ccfe95 100644
--- a/test/jdk/java/net/httpclient/http3/H3DataLimitsTest.java
+++ b/test/jdk/java/net/httpclient/http3/H3DataLimitsTest.java
@@ -70,7 +70,7 @@ import org.junit.jupiter.params.provider.MethodSource;
  * @run junit/othervm/timeout=480 -Djdk.internal.httpclient.debug=true
  *                     -Djdk.httpclient.HttpClient.log=requests,responses,errors
  *                     -Djavax.net.debug=all
- *                     H3DataLimitsTest
+ *                     ${test.main.class}
  * @summary Verify handling of MAX_DATA / MAX_STREAM_DATA frames
  */
 public class H3DataLimitsTest implements HttpServerAdapters {
diff --git a/test/jdk/java/net/httpclient/http3/H3ErrorHandlingTest.java b/test/jdk/java/net/httpclient/http3/H3ErrorHandlingTest.java
index 8e20eac95fa..07e086f0676 100644
--- a/test/jdk/java/net/httpclient/http3/H3ErrorHandlingTest.java
+++ b/test/jdk/java/net/httpclient/http3/H3ErrorHandlingTest.java
@@ -84,7 +84,7 @@ import static org.junit.jupiter.api.Assertions.*;
  * @build java.net.http/jdk.internal.net.http.Http3ConnectionAccess
  * @run junit/othervm
  *              -Djdk.internal.httpclient.debug=true
- *              -Djdk.httpclient.HttpClient.log=requests,responses,errors H3ErrorHandlingTest
+ *              -Djdk.httpclient.HttpClient.log=requests,responses,errors ${test.main.class}
  */
 public class H3ErrorHandlingTest implements HttpServerAdapters {
 
diff --git a/test/jdk/java/net/httpclient/http3/H3GoAwayTest.java b/test/jdk/java/net/httpclient/http3/H3GoAwayTest.java
index b9d50ce2939..03d1f8b4ea4 100644
--- a/test/jdk/java/net/httpclient/http3/H3GoAwayTest.java
+++ b/test/jdk/java/net/httpclient/http3/H3GoAwayTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2024, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2024, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -62,7 +62,7 @@ import static org.junit.jupiter.api.Assertions.assertNotNull;
  * @build jdk.test.lib.net.SimpleSSLContext
  * @run junit/othervm
  *            -Djdk.httpclient.HttpClient.log=errors,headers,quic:hs,http3
- *            H3GoAwayTest
+ *            ${test.main.class}
  */
 public class H3GoAwayTest {
 
diff --git a/test/jdk/java/net/httpclient/http3/H3HeaderSizeLimitTest.java b/test/jdk/java/net/httpclient/http3/H3HeaderSizeLimitTest.java
index d5864989436..d4cf941b007 100644
--- a/test/jdk/java/net/httpclient/http3/H3HeaderSizeLimitTest.java
+++ b/test/jdk/java/net/httpclient/http3/H3HeaderSizeLimitTest.java
@@ -58,7 +58,7 @@ import org.junit.jupiter.api.Test;
  * @build java.net.http/jdk.internal.net.http.Http3ConnectionAccess
  * @run junit/othervm
  *              -Djdk.internal.httpclient.debug=true
- *              -Djdk.httpclient.HttpClient.log=requests,responses,errors H3HeaderSizeLimitTest
+ *              -Djdk.httpclient.HttpClient.log=requests,responses,errors ${test.main.class}
  */
 public class H3HeaderSizeLimitTest implements HttpServerAdapters {
 
diff --git a/test/jdk/java/net/httpclient/http3/H3HeadersEncoding.java b/test/jdk/java/net/httpclient/http3/H3HeadersEncoding.java
index 6b7b24f049d..142856596e6 100644
--- a/test/jdk/java/net/httpclient/http3/H3HeadersEncoding.java
+++ b/test/jdk/java/net/httpclient/http3/H3HeadersEncoding.java
@@ -33,7 +33,7 @@
  *                     -Dhttp3.test.server.decoderMaxTableCapacity=4096
  *                     -Dhttp3.test.server.encoderTableCapacityLimit=4096
  *                     -Djdk.internal.httpclient.qpack.log.level=NORMAL
- *                     H3HeadersEncoding
+ *                     ${test.main.class}
  * @summary this test verifies that when QPACK dynamic table is enabled multiple
  *          random headers can be encoded/decoded correctly
  */
diff --git a/test/jdk/java/net/httpclient/http3/H3ImplicitPushCancel.java b/test/jdk/java/net/httpclient/http3/H3ImplicitPushCancel.java
index 570f84ad620..d9746d496f3 100644
--- a/test/jdk/java/net/httpclient/http3/H3ImplicitPushCancel.java
+++ b/test/jdk/java/net/httpclient/http3/H3ImplicitPushCancel.java
@@ -28,7 +28,7 @@
  * @run junit/othervm
  *      -Djdk.internal.httpclient.debug=true
  *      -Djdk.httpclient.HttpClient.log=errors,requests,responses,trace
- *      H3ImplicitPushCancel
+ *      ${test.main.class}
  * @summary This is a clone of http2/ImplicitPushCancel but for HTTP/3
  */
 
diff --git a/test/jdk/java/net/httpclient/http3/H3InsertionsLimitTest.java b/test/jdk/java/net/httpclient/http3/H3InsertionsLimitTest.java
index 6eabc23677a..35e5e56bc16 100644
--- a/test/jdk/java/net/httpclient/http3/H3InsertionsLimitTest.java
+++ b/test/jdk/java/net/httpclient/http3/H3InsertionsLimitTest.java
@@ -67,7 +67,7 @@ import org.junit.jupiter.api.Test;
  *                     -Dhttp3.test.server.encoderTableCapacityLimit=4096
  *                     -Djdk.httpclient.maxLiteralWithIndexing=32
  *                     -Djdk.internal.httpclient.qpack.log.level=EXTRA
- *                     H3InsertionsLimitTest
+ *                     ${test.main.class}
  */
 public class H3InsertionsLimitTest implements HttpServerAdapters {
 
diff --git a/test/jdk/java/net/httpclient/http3/H3LogHandshakeErrors.java b/test/jdk/java/net/httpclient/http3/H3LogHandshakeErrors.java
index 85a4b6113f0..a69028ca701 100644
--- a/test/jdk/java/net/httpclient/http3/H3LogHandshakeErrors.java
+++ b/test/jdk/java/net/httpclient/http3/H3LogHandshakeErrors.java
@@ -63,7 +63,7 @@ import org.junit.jupiter.api.Test;
  *        jdk.httpclient.test.lib.common.HttpServerAdapters
  * @run junit/othervm
  *              -Djdk.httpclient.HttpClient.log=errors
- *              H3LogHandshakeErrors
+ *              ${test.main.class}
  */
 // -Djava.security.debug=all
 public class H3LogHandshakeErrors implements HttpServerAdapters {
diff --git a/test/jdk/java/net/httpclient/http3/H3MaxInitialTimeoutTest.java b/test/jdk/java/net/httpclient/http3/H3MaxInitialTimeoutTest.java
index a93c6a37594..33d8c1db994 100644
--- a/test/jdk/java/net/httpclient/http3/H3MaxInitialTimeoutTest.java
+++ b/test/jdk/java/net/httpclient/http3/H3MaxInitialTimeoutTest.java
@@ -75,15 +75,15 @@ import org.junit.jupiter.params.provider.MethodSource;
  * @run junit/othervm -Djdk.internal.httpclient.debug=true
  *                     -Djdk.httpclient.HttpClient.log=requests,responses,errors,quic:controls
  *                     -Djdk.httpclient.quic.maxInitialTimeout=1
- *                     H3MaxInitialTimeoutTest
+ *                     ${test.main.class}
  * @run junit/othervm -Djdk.internal.httpclient.debug=true
  *                     -Djdk.httpclient.HttpClient.log=requests,responses,errors,quic:controls
  *                     -Djdk.httpclient.quic.maxInitialTimeout=2
- *                     H3MaxInitialTimeoutTest
+ *                     ${test.main.class}
  * @run junit/othervm -Djdk.internal.httpclient.debug=true
  *                     -Djdk.httpclient.HttpClient.log=requests,responses,errors,quic:controls
  *                     -Djdk.httpclient.quic.maxInitialTimeout=2147483647
- *                     H3MaxInitialTimeoutTest
+ *                     ${test.main.class}
  */
 public class H3MaxInitialTimeoutTest implements HttpServerAdapters {
 
diff --git a/test/jdk/java/net/httpclient/http3/H3MemoryHandlingTest.java b/test/jdk/java/net/httpclient/http3/H3MemoryHandlingTest.java
index 0d107486fcd..548bd546dab 100644
--- a/test/jdk/java/net/httpclient/http3/H3MemoryHandlingTest.java
+++ b/test/jdk/java/net/httpclient/http3/H3MemoryHandlingTest.java
@@ -67,7 +67,7 @@ import org.junit.jupiter.api.Test;
  *              -Djdk.internal.httpclient.debug=true
  *              -Djdk.httpclient.HttpClient.log=requests,responses,errors
  *              -Djdk.httpclient.quic.maxStreamInitialData=16384
- *              -Djdk.httpclient.quic.streamBufferSize=2048 H3MemoryHandlingTest
+ *              -Djdk.httpclient.quic.streamBufferSize=2048 ${test.main.class}
  */
 public class H3MemoryHandlingTest implements HttpServerAdapters {
 
diff --git a/test/jdk/java/net/httpclient/http3/H3MultipleConnectionsToSameHost.java b/test/jdk/java/net/httpclient/http3/H3MultipleConnectionsToSameHost.java
index f9ba35359bc..c38671e65b8 100644
--- a/test/jdk/java/net/httpclient/http3/H3MultipleConnectionsToSameHost.java
+++ b/test/jdk/java/net/httpclient/http3/H3MultipleConnectionsToSameHost.java
@@ -44,7 +44,7 @@
  *                     -Djdk.httpclient.retryOnStreamlimit=50
  *                     -Djdk.httpclient.HttpClient.log=errors,http3,quic:retransmit
  *                     -Dsimpleget.requests=100
- *                     H3MultipleConnectionsToSameHost
+ *                     ${test.main.class}
  * @summary test multiple connections and concurrent requests with blocking IO and virtual threads
  */
 /*
@@ -71,7 +71,7 @@
  *                     -Djdk.httpclient.retryOnStreamlimit=50
  *                     -Djdk.httpclient.HttpClient.log=errors,http3,quic:retransmit
  *                     -Dsimpleget.requests=100
- *                     H3MultipleConnectionsToSameHost
+ *                     ${test.main.class}
  * @summary test multiple connections and concurrent requests with blocking IO and virtual threads
  *          on windows 10 and windows 2016 - but with -XX:-VMContinuations
  */
@@ -95,7 +95,7 @@
  *                     -Djdk.httpclient.retryOnStreamlimit=50
  *                     -Djdk.httpclient.HttpClient.log=errors,http3,quic:hs:retransmit
  *                     -Dsimpleget.requests=100
- *                     H3MultipleConnectionsToSameHost
+ *                     ${test.main.class}
  * @summary Send 100 large concurrent requests, with connections whose max stream
  *          limit is artificially low, in order to cause concurrent connections
  *          to the same host to be created, with non-blocking IO and selector
@@ -120,7 +120,7 @@
  *                     -Djdk.httpclient.HttpClient.log=errors,http3,quic:hs:retransmit
  *                     -Dsimpleget.requests=100
  *                     -Djdk.internal.httpclient.quic.congestionController=reno
- *                     H3MultipleConnectionsToSameHost
+ *                     ${test.main.class}
  * @summary Send 100 large concurrent requests, with connections whose max stream
  *          limit is artificially low, in order to cause concurrent connections
  *          to the same host to be created, with Reno congestion controller
diff --git a/test/jdk/java/net/httpclient/http3/H3ProxyTest.java b/test/jdk/java/net/httpclient/http3/H3ProxyTest.java
index 58deeec1982..fbb4e07fd60 100644
--- a/test/jdk/java/net/httpclient/http3/H3ProxyTest.java
+++ b/test/jdk/java/net/httpclient/http3/H3ProxyTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2023, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2023, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -59,7 +59,7 @@ import static java.net.http.HttpOption.H3_DISCOVERY;
  *           if HTTP3_ONLY is specified
  * @library /test/lib /test/jdk/java/net/httpclient/lib
  * @build jdk.test.lib.net.SimpleSSLContext jdk.httpclient.test.lib.common.HttpServerAdapters
- * @run main/othervm H3ProxyTest
+ * @run main/othervm ${test.main.class}
  * @author danielfuchs
  */
 public class H3ProxyTest implements HttpServerAdapters {
diff --git a/test/jdk/java/net/httpclient/http3/H3PushCancel.java b/test/jdk/java/net/httpclient/http3/H3PushCancel.java
index b9e15b7d8e5..969297a50ba 100644
--- a/test/jdk/java/net/httpclient/http3/H3PushCancel.java
+++ b/test/jdk/java/net/httpclient/http3/H3PushCancel.java
@@ -29,7 +29,7 @@
  *      -Djdk.internal.httpclient.debug=true
  *      -Djdk.httpclient.HttpClient.log=errors,requests,responses,trace
  *      -Djdk.httpclient.http3.maxConcurrentPushStreams=5
- *      H3PushCancel
+ *      ${test.main.class}
  * @summary This test checks that not accepting one of the push promise
  *       will cancel it. It also verifies that receiving a pushId bigger
  *       than the max push ID allowed on the connection will cause
diff --git a/test/jdk/java/net/httpclient/http3/H3QuicTLSConnection.java b/test/jdk/java/net/httpclient/http3/H3QuicTLSConnection.java
index 6086c26729b..b66744d9f0d 100644
--- a/test/jdk/java/net/httpclient/http3/H3QuicTLSConnection.java
+++ b/test/jdk/java/net/httpclient/http3/H3QuicTLSConnection.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2023, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2023, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -61,7 +61,7 @@ import static java.net.http.HttpOption.Http3DiscoveryMode.HTTP_3_URI_ONLY;
  * @run main/othervm
  *       -Djdk.internal.httpclient.debug=true
  *       -Djdk.httpclient.HttpClient.log=all
- *       H3QuicTLSConnection
+ *       ${test.main.class}
  */
 public class H3QuicTLSConnection {
 
diff --git a/test/jdk/java/net/httpclient/http3/H3QuicVTTest.java b/test/jdk/java/net/httpclient/http3/H3QuicVTTest.java
index 7ea24d81ded..b982528b5e3 100644
--- a/test/jdk/java/net/httpclient/http3/H3QuicVTTest.java
+++ b/test/jdk/java/net/httpclient/http3/H3QuicVTTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2025, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -57,7 +57,7 @@ import static java.net.http.HttpOption.Http3DiscoveryMode.HTTP_3_URI_ONLY;
  *        jdk.httpclient.test.lib.common.HttpServerAdapters
  * @run junit/othervm
  *              -Djdk.httpclient.HttpClient.log=requests,responses,headers,errors,http3
- *              H3QuicVTTest
+ *              ${test.main.class}
  */
 /*
  * @test id=never
@@ -70,7 +70,7 @@ import static java.net.http.HttpOption.Http3DiscoveryMode.HTTP_3_URI_ONLY;
  * @run junit/othervm
  *              -Djdk.internal.httpclient.quic.selector.useVirtualThreads=never
  *              -Djdk.httpclient.HttpClient.log=requests,responses,headers,errors,http3
- *              H3QuicVTTest
+ *              ${test.main.class}
  */
 /*
  * @test id=always
@@ -83,7 +83,7 @@ import static java.net.http.HttpOption.Http3DiscoveryMode.HTTP_3_URI_ONLY;
  * @run junit/othervm
  *              -Djdk.internal.httpclient.quic.selector.useVirtualThreads=always
  *              -Djdk.httpclient.HttpClient.log=requests,responses,headers,errors,http3
- *              H3QuicVTTest
+ *              ${test.main.class}
  */
 /*
  * @test id=explicit-default
@@ -96,7 +96,7 @@ import static java.net.http.HttpOption.Http3DiscoveryMode.HTTP_3_URI_ONLY;
  * @run junit/othervm
  *              -Djdk.internal.httpclient.quic.selector.useVirtualThreads=default
  *              -Djdk.httpclient.HttpClient.log=requests,responses,headers,errors,http3
- *              H3QuicVTTest
+ *              ${test.main.class}
  */
 /*
  * @test id=garbage
@@ -109,7 +109,7 @@ import static java.net.http.HttpOption.Http3DiscoveryMode.HTTP_3_URI_ONLY;
  * @run junit/othervm
  *              -Djdk.internal.httpclient.quic.selector.useVirtualThreads=garbage
  *              -Djdk.httpclient.HttpClient.log=requests,responses,headers,errors,http3
- *              H3QuicVTTest
+ *              ${test.main.class}
  */
 // -Djava.security.debug=all
 class H3QuicVTTest implements HttpServerAdapters {
diff --git a/test/jdk/java/net/httpclient/http3/H3RedirectTest.java b/test/jdk/java/net/httpclient/http3/H3RedirectTest.java
index 67a7d99fa71..4f6c80dc3a2 100644
--- a/test/jdk/java/net/httpclient/http3/H3RedirectTest.java
+++ b/test/jdk/java/net/httpclient/http3/H3RedirectTest.java
@@ -31,7 +31,7 @@
  * @run junit/othervm
  *      -Djdk.httpclient.HttpClient.log=frames,ssl,requests,responses,errors
  *      -Djdk.internal.httpclient.debug=true
- *      H3RedirectTest
+ *      ${test.main.class}
  */
 
 import java.net.InetSocketAddress;
diff --git a/test/jdk/java/net/httpclient/http3/H3ServerPush.java b/test/jdk/java/net/httpclient/http3/H3ServerPush.java
index 50aa817b155..c53828b189d 100644
--- a/test/jdk/java/net/httpclient/http3/H3ServerPush.java
+++ b/test/jdk/java/net/httpclient/http3/H3ServerPush.java
@@ -32,7 +32,7 @@
  * @run junit/othervm/timeout=960
  *      -Djdk.httpclient.HttpClient.log=errors,requests,headers
  *      -Djdk.internal.httpclient.debug=false
- *      H3ServerPush
+ *      ${test.main.class}
  * @summary This is a clone of http2/ServerPush but for HTTP/3
  */
 
diff --git a/test/jdk/java/net/httpclient/http3/H3ServerPushCancel.java b/test/jdk/java/net/httpclient/http3/H3ServerPushCancel.java
index b34e2a1567e..955023599d3 100644
--- a/test/jdk/java/net/httpclient/http3/H3ServerPushCancel.java
+++ b/test/jdk/java/net/httpclient/http3/H3ServerPushCancel.java
@@ -29,7 +29,7 @@
  *      -Djdk.internal.httpclient.debug=true
  *      -Djdk.httpclient.HttpClient.log=errors,requests,responses,trace
  *      -Djdk.httpclient.http3.maxConcurrentPushStreams=45
- *      H3ServerPushCancel
+ *      ${test.main.class}
  * @summary This test checks that the client deals correctly with a
  *      CANCEL_PUSH frame sent by the server
  */
diff --git a/test/jdk/java/net/httpclient/http3/H3ServerPushTest.java b/test/jdk/java/net/httpclient/http3/H3ServerPushTest.java
index 00fe651c9cf..018e7c2f11d 100644
--- a/test/jdk/java/net/httpclient/http3/H3ServerPushTest.java
+++ b/test/jdk/java/net/httpclient/http3/H3ServerPushTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2025, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -78,7 +78,7 @@ import static org.junit.jupiter.api.Assertions.fail;
  *          /test/lib
  * @build jdk.httpclient.test.lib.http2.Http2TestServer
  *        jdk.test.lib.net.SimpleSSLContext
- * @run junit/othervm/timeout=240 H3ServerPushTest
+ * @run junit/othervm/timeout=240 ${test.main.class}
  */
 
 /**
diff --git a/test/jdk/java/net/httpclient/http3/H3ServerPushWithDiffTypes.java b/test/jdk/java/net/httpclient/http3/H3ServerPushWithDiffTypes.java
index a863db43c29..ecc3c828abf 100644
--- a/test/jdk/java/net/httpclient/http3/H3ServerPushWithDiffTypes.java
+++ b/test/jdk/java/net/httpclient/http3/H3ServerPushWithDiffTypes.java
@@ -28,7 +28,7 @@
  * @run junit/othervm
  *       -Djdk.internal.httpclient.debug=true
  *       -Djdk.httpclient.HttpClient.log=errors,requests,responses
- *       H3ServerPushWithDiffTypes
+ *       ${test.main.class}
  * @summary This is a clone of http2/ServerPushWithDiffTypes but for HTTP/3
  */
 
diff --git a/test/jdk/java/net/httpclient/http3/H3SimpleGet.java b/test/jdk/java/net/httpclient/http3/H3SimpleGet.java
index ae113322cd3..4d58f7094b1 100644
--- a/test/jdk/java/net/httpclient/http3/H3SimpleGet.java
+++ b/test/jdk/java/net/httpclient/http3/H3SimpleGet.java
@@ -31,19 +31,19 @@
  * @build jdk.test.lib.net.SimpleSSLContext jdk.httpclient.test.lib.common.TestUtil
  *        jdk.httpclient.test.lib.http2.Http2TestServer
  * @run junit/othervm/timeout=480 -XX:+HeapDumpOnOutOfMemoryError -XX:+CrashOnOutOfMemoryError
- *                     H3SimpleGet
+ *                     ${test.main.class}
  * @run junit/othervm/timeout=480 -XX:+HeapDumpOnOutOfMemoryError -XX:+CrashOnOutOfMemoryError
  *                     -Djdk.httpclient.retryOnStreamlimit=20
  *                     -Djdk.httpclient.redirects.retrylimit=21
  *                     -Dsimpleget.repeat=1 -Dsimpleget.chunks=1 -Dsimpleget.requests=1000
- *                     H3SimpleGet
+ *                     ${test.main.class}
  * @run junit/othervm/timeout=480 -XX:+HeapDumpOnOutOfMemoryError -XX:+CrashOnOutOfMemoryError
  *                     -Dsimpleget.requests=150
  *                     -Dsimpleget.chunks=16384
  *                     -Djdk.httpclient.retryOnStreamlimit=5
  *                     -Djdk.httpclient.redirects.retrylimit=6
  *                     -Djdk.httpclient.quic.defaultMTU=16336
- *                      H3SimpleGet
+ *                      ${test.main.class}
  */
 
 /*
@@ -54,19 +54,19 @@
  * @build jdk.test.lib.net.SimpleSSLContext jdk.httpclient.test.lib.common.TestUtil
  *        jdk.httpclient.test.lib.http2.Http2TestServer
  * @run junit/othervm/timeout=480 -XX:+HeapDumpOnOutOfMemoryError -XX:+CrashOnOutOfMemoryError
- *                     H3SimpleGet
+ *                     ${test.main.class}
  * @run junit/othervm/timeout=480 -XX:+HeapDumpOnOutOfMemoryError -XX:+CrashOnOutOfMemoryError
  *                     -Djdk.httpclient.retryOnStreamlimit=20
  *                     -Djdk.httpclient.redirects.retrylimit=21
  *                     -Dsimpleget.repeat=1 -Dsimpleget.chunks=1 -Dsimpleget.requests=1000
- *                     H3SimpleGet
+ *                     ${test.main.class}
  * @run junit/othervm/timeout=480 -XX:+HeapDumpOnOutOfMemoryError -XX:+CrashOnOutOfMemoryError
  *                     -Dsimpleget.requests=150
  *                     -Dsimpleget.chunks=16384
  *                     -Djdk.httpclient.retryOnStreamlimit=5
  *                     -Djdk.httpclient.redirects.retrylimit=6
  *                     -Djdk.httpclient.quic.defaultMTU=8192
- *                      H3SimpleGet
+ *                      ${test.main.class}
  */
 
 /*
@@ -79,13 +79,13 @@
  *        jdk.httpclient.test.lib.http2.Http2TestServer
  * @run junit/othervm/timeout=480 -XX:+HeapDumpOnOutOfMemoryError -XX:+CrashOnOutOfMemoryError
  *                     -XX:+UnlockExperimentalVMOptions -XX:-VMContinuations
- *                     H3SimpleGet
+ *                     ${test.main.class}
  * @run junit/othervm/timeout=480 -XX:+HeapDumpOnOutOfMemoryError -XX:+CrashOnOutOfMemoryError
  *                     -XX:+UnlockExperimentalVMOptions -XX:-VMContinuations
  *                     -Djdk.httpclient.retryOnStreamlimit=20
  *                     -Djdk.httpclient.redirects.retrylimit=21
  *                     -Dsimpleget.repeat=1 -Dsimpleget.chunks=1 -Dsimpleget.requests=1000
- *                     H3SimpleGet
+ *                     ${test.main.class}
  * @run junit/othervm/timeout=480 -XX:+HeapDumpOnOutOfMemoryError -XX:+CrashOnOutOfMemoryError
  *                     -XX:+UnlockExperimentalVMOptions -XX:-VMContinuations
  *                     -Dsimpleget.requests=150
@@ -93,7 +93,7 @@
  *                     -Djdk.httpclient.retryOnStreamlimit=5
  *                     -Djdk.httpclient.redirects.retrylimit=6
  *                     -Djdk.httpclient.quic.defaultMTU=16336
- *                      H3SimpleGet
+ *                      ${test.main.class}
  */
 
 /*
@@ -105,13 +105,13 @@
  *        jdk.httpclient.test.lib.http2.Http2TestServer
  * @run junit/othervm/timeout=480 -XX:+HeapDumpOnOutOfMemoryError -XX:+CrashOnOutOfMemoryError
  *                     -Djdk.internal.httpclient.quic.useNioSelector=true
- *                     H3SimpleGet
+ *                     ${test.main.class}
  * @run junit/othervm/timeout=480 -XX:+HeapDumpOnOutOfMemoryError -XX:+CrashOnOutOfMemoryError
  *                     -Djdk.internal.httpclient.quic.useNioSelector=true
  *                     -Djdk.httpclient.retryOnStreamlimit=20
  *                     -Djdk.httpclient.redirects.retrylimit=21
  *                     -Dsimpleget.repeat=1 -Dsimpleget.chunks=1 -Dsimpleget.requests=1000
- *                     H3SimpleGet
+ *                     ${test.main.class}
  * @run junit/othervm/timeout=480 -XX:+HeapDumpOnOutOfMemoryError -XX:+CrashOnOutOfMemoryError
  *                     -Djdk.internal.httpclient.quic.useNioSelector=true
  *                     -Dsimpleget.requests=150
@@ -119,7 +119,7 @@
  *                     -Djdk.httpclient.retryOnStreamlimit=5
  *                     -Djdk.httpclient.redirects.retrylimit=6
  *                     -Djdk.httpclient.quic.defaultMTU=16336
- *                      H3SimpleGet
+ *                      ${test.main.class}
  */
 
 /*
@@ -131,13 +131,13 @@
  *        jdk.httpclient.test.lib.http2.Http2TestServer
  * @run junit/othervm/timeout=480 -XX:+HeapDumpOnOutOfMemoryError -XX:+CrashOnOutOfMemoryError
  *                     -Djdk.internal.httpclient.quic.useNioSelector=true
- *                     H3SimpleGet
+ *                     ${test.main.class}
  * @run junit/othervm/timeout=480 -XX:+HeapDumpOnOutOfMemoryError -XX:+CrashOnOutOfMemoryError
  *                     -Djdk.internal.httpclient.quic.useNioSelector=true
  *                     -Djdk.httpclient.retryOnStreamlimit=20
  *                     -Djdk.httpclient.redirects.retrylimit=21
  *                     -Dsimpleget.repeat=1 -Dsimpleget.chunks=1 -Dsimpleget.requests=1000
- *                     H3SimpleGet
+ *                     ${test.main.class}
  * @run junit/othervm/timeout=480 -XX:+HeapDumpOnOutOfMemoryError -XX:+CrashOnOutOfMemoryError
  *                     -Djdk.internal.httpclient.quic.useNioSelector=true
  *                     -Dsimpleget.requests=150
@@ -145,7 +145,7 @@
  *                     -Djdk.httpclient.retryOnStreamlimit=5
  *                     -Djdk.httpclient.redirects.retrylimit=6
  *                     -Djdk.httpclient.quic.defaultMTU=8192
- *                      H3SimpleGet
+ *                      ${test.main.class}
  */
 
 /*
@@ -155,7 +155,7 @@
  * @build jdk.test.lib.net.SimpleSSLContext jdk.httpclient.test.lib.common.TestUtil
  *        jdk.httpclient.test.lib.http2.Http2TestServer
  * @run junit/othervm/timeout=480 -Djdk.internal.httpclient.quic.congestionController=reno
- *                     H3SimpleGet
+ *                     ${test.main.class}
  * @summary send multiple GET requests using Reno congestion controller
  */
 
diff --git a/test/jdk/java/net/httpclient/http3/H3SimplePost.java b/test/jdk/java/net/httpclient/http3/H3SimplePost.java
index 0294f2f69da..6444f2ca90c 100644
--- a/test/jdk/java/net/httpclient/http3/H3SimplePost.java
+++ b/test/jdk/java/net/httpclient/http3/H3SimplePost.java
@@ -27,7 +27,7 @@
  * @library /test/lib /test/jdk/java/net/httpclient/lib
  * @build jdk.test.lib.net.SimpleSSLContext jdk.httpclient.test.lib.common.TestUtil
  *        jdk.httpclient.test.lib.http2.Http2TestServer
- * @run junit/othervm/timeout=480 H3SimplePost
+ * @run junit/othervm/timeout=480 ${test.main.class}
  */
 // -Djdk.httpclient.HttpClient.log=requests,errors,quic
 // -Djdk.httpclient.quic.defaultMTU=64000
diff --git a/test/jdk/java/net/httpclient/http3/H3SimpleTest.java b/test/jdk/java/net/httpclient/http3/H3SimpleTest.java
index 4258f3bac73..78a1b55fda6 100644
--- a/test/jdk/java/net/httpclient/http3/H3SimpleTest.java
+++ b/test/jdk/java/net/httpclient/http3/H3SimpleTest.java
@@ -54,22 +54,22 @@ import org.junit.jupiter.api.Test;
  * @run junit/othervm
  *              -Djdk.internal.httpclient.debug=true
  *              -Djdk.httpclient.HttpClient.log=requests,responses,errors
- *              H3SimpleTest
+ *              ${test.main.class}
  * @run junit/othervm
  *              -Djdk.internal.httpclient.debug=true
  *              -Djdk.httpclient.HttpClient.log=requests,responses,errors
  *              -Djava.net.preferIPv6Addresses=true
- *              H3SimpleTest
+ *              ${test.main.class}
  * @run junit/othervm
  *              -Djdk.internal.httpclient.debug=true
  *              -Djdk.httpclient.HttpClient.log=requests,responses,errors
  *              -Djava.net.preferIPv4Stack=true
- *              H3SimpleTest
+ *              ${test.main.class}
  * @run junit/othervm
  *              -Djdk.internal.httpclient.debug=true
  *              -Djdk.httpclient.HttpClient.log=requests,responses,errors
  *              -Djdk.internal.httpclient.quic.congestionController=reno
- *              H3SimpleTest
+ *              ${test.main.class}
  */
 // -Djava.security.debug=all
 public class H3SimpleTest implements HttpServerAdapters {
diff --git a/test/jdk/java/net/httpclient/http3/H3StopSendingTest.java b/test/jdk/java/net/httpclient/http3/H3StopSendingTest.java
index 86b12a1dae6..3eb88c88f9e 100644
--- a/test/jdk/java/net/httpclient/http3/H3StopSendingTest.java
+++ b/test/jdk/java/net/httpclient/http3/H3StopSendingTest.java
@@ -27,7 +27,7 @@
  * @library /test/lib /test/jdk/java/net/httpclient/lib
  * @build jdk.httpclient.test.lib.common.HttpServerAdapters
  * @run junit/othervm/timeout=40  -Djdk.internal.httpclient.debug=true -Djdk.httpclient.HttpClient.log=trace,errors,headers
- *                              H3StopSendingTest
+ *                              ${test.main.class}
  */
 
 import jdk.httpclient.test.lib.common.HttpServerAdapters;
diff --git a/test/jdk/java/net/httpclient/http3/H3StreamLimitReachedTest.java b/test/jdk/java/net/httpclient/http3/H3StreamLimitReachedTest.java
index 1ac4a750d77..aa14087862b 100644
--- a/test/jdk/java/net/httpclient/http3/H3StreamLimitReachedTest.java
+++ b/test/jdk/java/net/httpclient/http3/H3StreamLimitReachedTest.java
@@ -49,7 +49,7 @@
  * @run junit/othervm -Djdk.httpclient.HttpClient.log=ssl,requests,responses,errors,http3,quic:control
  *                     -Djdk.internal.httpclient.debug=false
  *                     -Djdk.internal.httpclient.quic.maxBidiStreams=1
- *                     H3StreamLimitReachedTest
+ *                     ${test.main.class}
  */
 
 /*
@@ -82,7 +82,7 @@
  *                     -Djdk.internal.httpclient.quic.maxBidiStreams=1
  *                     -Djdk.httpclient.http3.maxStreamLimitTimeout=0
  *                     -Djdk.httpclient.retryOnStreamlimit=9
- *                     H3StreamLimitReachedTest
+ *                     ${test.main.class}
  */
 
 import java.io.IOException;
diff --git a/test/jdk/java/net/httpclient/http3/H3Timeout.java b/test/jdk/java/net/httpclient/http3/H3Timeout.java
index fedb4d46952..befc8e5d159 100644
--- a/test/jdk/java/net/httpclient/http3/H3Timeout.java
+++ b/test/jdk/java/net/httpclient/http3/H3Timeout.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2023, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2023, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -53,7 +53,7 @@ import static java.net.http.HttpOption.H3_DISCOVERY;
  * @build jdk.test.lib.net.SimpleSSLContext jdk.httpclient.test.lib.common.TestUtil
  *        jdk.httpclient.test.lib.common.HttpServerAdapters
  * @compile ../ReferenceTracker.java
- * @run main/othervm -Djdk.httpclient.HttpClient.log=ssl,requests,responses,errors H3Timeout
+ * @run main/othervm -Djdk.httpclient.HttpClient.log=ssl,requests,responses,errors ${test.main.class}
  */
 public class H3Timeout implements HttpServerAdapters {
 
diff --git a/test/jdk/java/net/httpclient/http3/H3UnsupportedSSLParametersTest.java b/test/jdk/java/net/httpclient/http3/H3UnsupportedSSLParametersTest.java
index 790af245db8..2a490884927 100644
--- a/test/jdk/java/net/httpclient/http3/H3UnsupportedSSLParametersTest.java
+++ b/test/jdk/java/net/httpclient/http3/H3UnsupportedSSLParametersTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2022, 2023, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2022, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -38,7 +38,7 @@ import static org.junit.jupiter.api.Assertions.assertTrue;
  * @summary Tests that a HttpClient configured with SSLParameters that doesn't include TLSv1.3
  *          cannot be used for HTTP3
  * @library /test/lib /test/jdk/java/net/httpclient/lib
- * @run junit H3UnsupportedSSLParametersTest
+ * @run junit ${test.main.class}
  */
 public class H3UnsupportedSSLParametersTest {
 
diff --git a/test/jdk/java/net/httpclient/http3/H3UserInfoTest.java b/test/jdk/java/net/httpclient/http3/H3UserInfoTest.java
index 8eaad2ce4de..ad5db51f48b 100644
--- a/test/jdk/java/net/httpclient/http3/H3UserInfoTest.java
+++ b/test/jdk/java/net/httpclient/http3/H3UserInfoTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2023, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2023, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -59,7 +59,7 @@ import static org.junit.jupiter.api.Assertions.fail;
  * @compile ../ReferenceTracker.java
  * @run junit/othervm -Djdk.httpclient.HttpClient.log=quic,errors
  *              -Djdk.httpclient.http3.maxDirectConnectionTimeout=4000
- *              -Djdk.internal.httpclient.debug=true H3UserInfoTest
+ *              -Djdk.internal.httpclient.debug=true ${test.main.class}
  */
 
 @TestInstance(TestInstance.Lifecycle.PER_CLASS)
diff --git a/test/jdk/java/net/httpclient/http3/HTTP3NoBodyTest.java b/test/jdk/java/net/httpclient/http3/HTTP3NoBodyTest.java
index b43ce8dcf79..fcd5b1eadb7 100644
--- a/test/jdk/java/net/httpclient/http3/HTTP3NoBodyTest.java
+++ b/test/jdk/java/net/httpclient/http3/HTTP3NoBodyTest.java
@@ -31,7 +31,7 @@
  * @compile ../ReferenceTracker.java
  * @run junit/othervm -Djdk.httpclient.HttpClient.log=ssl,requests,responses,errors
  *       -Djdk.internal.httpclient.debug=true
- *       HTTP3NoBodyTest
+ *       ${test.main.class}
  * @summary this is a copy of http2/NoBodyTest over HTTP/3
  */
 
diff --git a/test/jdk/java/net/httpclient/http3/Http3ExpectContinueTest.java b/test/jdk/java/net/httpclient/http3/Http3ExpectContinueTest.java
index 1cf6900ed5d..0d34c197d1a 100644
--- a/test/jdk/java/net/httpclient/http3/Http3ExpectContinueTest.java
+++ b/test/jdk/java/net/httpclient/http3/Http3ExpectContinueTest.java
@@ -29,7 +29,7 @@
  * @build jdk.httpclient.test.lib.common.HttpServerAdapters
  * @run junit/othervm -Djdk.internal.httpclient.debug=true
  *                     -Djdk.httpclient.HttpClient.log=errors,requests,headers
- *                     Http3ExpectContinueTest
+ *                     ${test.main.class}
  */
 
 import jdk.httpclient.test.lib.common.HttpServerAdapters;
diff --git a/test/jdk/java/net/httpclient/http3/PeerUniStreamDispatcherTest.java b/test/jdk/java/net/httpclient/http3/PeerUniStreamDispatcherTest.java
index fc6d43bb472..7404a3cb1e9 100644
--- a/test/jdk/java/net/httpclient/http3/PeerUniStreamDispatcherTest.java
+++ b/test/jdk/java/net/httpclient/http3/PeerUniStreamDispatcherTest.java
@@ -25,7 +25,7 @@
  * @test
  * @run junit/othervm
  *      -Djdk.internal.httpclient.debug=out
- *      PeerUniStreamDispatcherTest
+ *      ${test.main.class}
  * @summary Unit test for the PeerUniStreamDispatcher
  */
 
diff --git a/test/jdk/java/net/httpclient/http3/PostHTTP3Test.java b/test/jdk/java/net/httpclient/http3/PostHTTP3Test.java
index 1f109e27ebc..c783da4a10b 100644
--- a/test/jdk/java/net/httpclient/http3/PostHTTP3Test.java
+++ b/test/jdk/java/net/httpclient/http3/PostHTTP3Test.java
@@ -85,7 +85,7 @@ import org.junit.jupiter.params.provider.MethodSource;
  * @compile  ../ReferenceTracker.java
  * @run junit/othervm -Djdk.internal.httpclient.debug=true
  *                     -Djdk.httpclient.HttpClient.log=requests,responses,errors
- *                     PostHTTP3Test
+ *                     ${test.main.class}
  * @summary Basic HTTP/3 POST test
  */
 //                    -Djdk.httpclient.http3.maxDirectConnectionTimeout=2500
diff --git a/test/jdk/java/net/httpclient/http3/StopSendingTest.java b/test/jdk/java/net/httpclient/http3/StopSendingTest.java
index 8c9a6f84b65..e13568740bb 100644
--- a/test/jdk/java/net/httpclient/http3/StopSendingTest.java
+++ b/test/jdk/java/net/httpclient/http3/StopSendingTest.java
@@ -61,7 +61,7 @@ import org.junit.jupiter.api.Test;
  *        jdk.httpclient.test.lib.common.HttpServerAdapters
  * @compile ../ReferenceTracker.java
  * @run junit/othervm -Djdk.internal.httpclient.debug=true
- *             -Djdk.httpclient.HttpClient.log=requests,responses,errors StopSendingTest
+ *             -Djdk.httpclient.HttpClient.log=requests,responses,errors ${test.main.class}
  */
 public class StopSendingTest implements HttpServerAdapters {
 
diff --git a/test/jdk/java/net/httpclient/http3/StreamLimitTest.java b/test/jdk/java/net/httpclient/http3/StreamLimitTest.java
index 9e15db9ceb9..6505a542e8c 100644
--- a/test/jdk/java/net/httpclient/http3/StreamLimitTest.java
+++ b/test/jdk/java/net/httpclient/http3/StreamLimitTest.java
@@ -65,7 +65,7 @@ import org.junit.jupiter.api.Test;
  * @build jdk.test.lib.net.SimpleSSLContext
  *        jdk.httpclient.test.lib.common.HttpServerAdapters
  *        jdk.httpclient.test.lib.http3.Http3TestServer
- * @run junit/othervm -Djdk.internal.httpclient.debug=true StreamLimitTest
+ * @run junit/othervm -Djdk.internal.httpclient.debug=true ${test.main.class}
  */
 public class StreamLimitTest {
 
diff --git a/test/jdk/java/net/httpclient/offline/OfflineTesting.java b/test/jdk/java/net/httpclient/offline/OfflineTesting.java
index f36a457022e..754a4233f3f 100644
--- a/test/jdk/java/net/httpclient/offline/OfflineTesting.java
+++ b/test/jdk/java/net/httpclient/offline/OfflineTesting.java
@@ -25,7 +25,7 @@
  * @test
  * @summary Demonstrates how to achieve testing without network connections
  * @build DelegatingHttpClient FixedHttpResponse FixedResponseHttpClient
- * @run junit/othervm OfflineTesting
+ * @run junit/othervm ${test.main.class}
  */
 
 import java.io.IOException;
diff --git a/test/jdk/java/net/httpclient/qpack/BlockingDecodingTest.java b/test/jdk/java/net/httpclient/qpack/BlockingDecodingTest.java
index 778783ad64c..afa61c0e582 100644
--- a/test/jdk/java/net/httpclient/qpack/BlockingDecodingTest.java
+++ b/test/jdk/java/net/httpclient/qpack/BlockingDecodingTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2023, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2023, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -59,7 +59,7 @@ import org.junit.jupiter.api.Test;
  *          java.net.http/jdk.internal.net.http.http3.frames
  *          java.net.http/jdk.internal.net.http.http3
  * @build EncoderDecoderConnector
- * @run junit/othervm -Djdk.internal.httpclient.qpack.log.level=EXTRA BlockingDecodingTest
+ * @run junit/othervm -Djdk.internal.httpclient.qpack.log.level=EXTRA ${test.main.class}
  */
 
 
diff --git a/test/jdk/java/net/httpclient/qpack/DecoderInstructionsReaderTest.java b/test/jdk/java/net/httpclient/qpack/DecoderInstructionsReaderTest.java
index e231d0dded3..ea945b76f83 100644
--- a/test/jdk/java/net/httpclient/qpack/DecoderInstructionsReaderTest.java
+++ b/test/jdk/java/net/httpclient/qpack/DecoderInstructionsReaderTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2023, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2023, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,7 +25,7 @@
  * @test
  * @key randomness
  * @library /test/lib
- * @run junit/othervm -Djdk.internal.httpclient.qpack.log.level=NORMAL DecoderInstructionsReaderTest
+ * @run junit/othervm -Djdk.internal.httpclient.qpack.log.level=NORMAL ${test.main.class}
  */
 
 import jdk.internal.net.http.qpack.QPACK;
diff --git a/test/jdk/java/net/httpclient/qpack/DecoderInstructionsWriterTest.java b/test/jdk/java/net/httpclient/qpack/DecoderInstructionsWriterTest.java
index 275dec34927..539eb47dc53 100644
--- a/test/jdk/java/net/httpclient/qpack/DecoderInstructionsWriterTest.java
+++ b/test/jdk/java/net/httpclient/qpack/DecoderInstructionsWriterTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2023, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2023, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -36,7 +36,7 @@
  *          java.net.http/jdk.internal.net.http.http3.streams
  *          java.net.http/jdk.internal.net.http.http3.frames
  *          java.net.http/jdk.internal.net.http.http3
- * @run junit/othervm -Djdk.internal.httpclient.qpack.log.level=NORMAL DecoderInstructionsWriterTest
+ * @run junit/othervm -Djdk.internal.httpclient.qpack.log.level=NORMAL ${test.main.class}
  */
 
 import jdk.internal.net.http.qpack.DynamicTable;
diff --git a/test/jdk/java/net/httpclient/qpack/DecoderSectionSizeLimitTest.java b/test/jdk/java/net/httpclient/qpack/DecoderSectionSizeLimitTest.java
index 1ad094916d4..372554e824f 100644
--- a/test/jdk/java/net/httpclient/qpack/DecoderSectionSizeLimitTest.java
+++ b/test/jdk/java/net/httpclient/qpack/DecoderSectionSizeLimitTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2023, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2023, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -38,7 +38,7 @@
  *          java.net.http/jdk.internal.net.http.http3
  * @build EncoderDecoderConnector
  * @run junit/othervm -Djdk.internal.httpclient.qpack.log.level=NORMAL
- *                    DecoderSectionSizeLimitTest
+ *                    ${test.main.class}
  */
 
 import jdk.internal.net.http.http3.ConnectionSettings;
diff --git a/test/jdk/java/net/httpclient/qpack/DecoderTest.java b/test/jdk/java/net/httpclient/qpack/DecoderTest.java
index 15d4bef7cc9..799ea13d45f 100644
--- a/test/jdk/java/net/httpclient/qpack/DecoderTest.java
+++ b/test/jdk/java/net/httpclient/qpack/DecoderTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2021, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2021, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -53,7 +53,7 @@ import org.junit.jupiter.params.provider.MethodSource;
  *          java.net.http/jdk.internal.net.http.http3.streams
  *          java.net.http/jdk.internal.net.http.http3.frames
  *          java.net.http/jdk.internal.net.http.http3
- * @run junit/othervm DecoderTest
+ * @run junit/othervm ${test.main.class}
  */
 @TestInstance(TestInstance.Lifecycle.PER_CLASS)
 public class DecoderTest {
diff --git a/test/jdk/java/net/httpclient/qpack/DynamicTableFieldLineRepresentationTest.java b/test/jdk/java/net/httpclient/qpack/DynamicTableFieldLineRepresentationTest.java
index c314688ab52..0a93a2ed594 100644
--- a/test/jdk/java/net/httpclient/qpack/DynamicTableFieldLineRepresentationTest.java
+++ b/test/jdk/java/net/httpclient/qpack/DynamicTableFieldLineRepresentationTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2023, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2023, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -58,7 +58,7 @@ import org.junit.jupiter.api.Test;
  * @run junit/othervm -Djdk.internal.httpclient.qpack.log.level=EXTRA
  *                     -Djdk.http.qpack.allowBlockingEncoding=true
  *                     -Djdk.http.qpack.decoderBlockedStreams=4
- *                     DynamicTableFieldLineRepresentationTest
+ *                     ${test.main.class}
  */
 public class DynamicTableFieldLineRepresentationTest {
 
diff --git a/test/jdk/java/net/httpclient/qpack/DynamicTableTest.java b/test/jdk/java/net/httpclient/qpack/DynamicTableTest.java
index c340a25088a..d87532329e5 100644
--- a/test/jdk/java/net/httpclient/qpack/DynamicTableTest.java
+++ b/test/jdk/java/net/httpclient/qpack/DynamicTableTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2023, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2023, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -27,7 +27,7 @@
  * @library /test/lib
  * @modules java.net.http/jdk.internal.net.http.qpack:+open
  *          java.net.http/jdk.internal.net.http.qpack.readers
- * @run junit/othervm -Djdk.internal.httpclient.qpack.log.level=NORMAL DynamicTableTest
+ * @run junit/othervm -Djdk.internal.httpclient.qpack.log.level=NORMAL ${test.main.class}
  */
 
 import jdk.internal.net.http.qpack.DynamicTable;
diff --git a/test/jdk/java/net/httpclient/qpack/EncoderDecoderConnectionTest.java b/test/jdk/java/net/httpclient/qpack/EncoderDecoderConnectionTest.java
index c2bed98bc3c..99680608db8 100644
--- a/test/jdk/java/net/httpclient/qpack/EncoderDecoderConnectionTest.java
+++ b/test/jdk/java/net/httpclient/qpack/EncoderDecoderConnectionTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2023, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2023, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -49,7 +49,7 @@ import org.junit.jupiter.api.Test;
  *          java.net.http/jdk.internal.net.http.http3
  * @build EncoderDecoderConnector
  * @run junit/othervm -Djdk.internal.httpclient.qpack.log.level=EXTRA
- *                     EncoderDecoderConnectionTest
+ *                     ${test.main.class}
  */
 public class EncoderDecoderConnectionTest {
 
diff --git a/test/jdk/java/net/httpclient/qpack/EncoderDecoderTest.java b/test/jdk/java/net/httpclient/qpack/EncoderDecoderTest.java
index 7dc1bf73960..9b277c87c3c 100644
--- a/test/jdk/java/net/httpclient/qpack/EncoderDecoderTest.java
+++ b/test/jdk/java/net/httpclient/qpack/EncoderDecoderTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2021, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2021, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -61,7 +61,7 @@ import org.junit.jupiter.params.provider.MethodSource;
  *          java.net.http/jdk.internal.net.http.http3.frames
  *          java.net.http/jdk.internal.net.http.http3
  * @build EncoderDecoderConnector
- * @run junit/othervm EncoderDecoderTest
+ * @run junit/othervm ${test.main.class}
  */
 @TestInstance(TestInstance.Lifecycle.PER_CLASS)
 public class EncoderDecoderTest {
diff --git a/test/jdk/java/net/httpclient/qpack/EncoderInstructionsReaderTest.java b/test/jdk/java/net/httpclient/qpack/EncoderInstructionsReaderTest.java
index 5c31762cdb3..3a816f4203e 100644
--- a/test/jdk/java/net/httpclient/qpack/EncoderInstructionsReaderTest.java
+++ b/test/jdk/java/net/httpclient/qpack/EncoderInstructionsReaderTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2023, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2023, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,7 +25,7 @@
  * @test
  * @key randomness
  * @library /test/lib
- * @run junit/othervm -Djdk.internal.httpclient.qpack.log.level=NORMAL EncoderInstructionsReaderTest
+ * @run junit/othervm -Djdk.internal.httpclient.qpack.log.level=NORMAL ${test.main.class}
  */
 
 import jdk.internal.net.http.hpack.QuickHuffman;
diff --git a/test/jdk/java/net/httpclient/qpack/EncoderInstructionsWriterTest.java b/test/jdk/java/net/httpclient/qpack/EncoderInstructionsWriterTest.java
index fd1fc41d8f7..cbfe4c15cc8 100644
--- a/test/jdk/java/net/httpclient/qpack/EncoderInstructionsWriterTest.java
+++ b/test/jdk/java/net/httpclient/qpack/EncoderInstructionsWriterTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2023, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2023, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -66,7 +66,7 @@ import static org.junit.jupiter.api.Assertions.*;
  *          java.net.http/jdk.internal.net.http.http3.streams
  *          java.net.http/jdk.internal.net.http.http3.frames
  *          java.net.http/jdk.internal.net.http.http3
- * @run junit/othervm -Djdk.internal.httpclient.qpack.log.level=NORMAL EncoderInstructionsWriterTest
+ * @run junit/othervm -Djdk.internal.httpclient.qpack.log.level=NORMAL ${test.main.class}
  */
 
 @TestInstance(TestInstance.Lifecycle.PER_CLASS)
diff --git a/test/jdk/java/net/httpclient/qpack/EncoderTest.java b/test/jdk/java/net/httpclient/qpack/EncoderTest.java
index b721fa3d27a..3612e027b79 100644
--- a/test/jdk/java/net/httpclient/qpack/EncoderTest.java
+++ b/test/jdk/java/net/httpclient/qpack/EncoderTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2021, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2021, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -85,7 +85,7 @@ import org.junit.jupiter.params.provider.MethodSource;
  *          java.net.http/jdk.internal.net.http.http3.streams
  *          java.net.http/jdk.internal.net.http.http3.frames
  *          java.net.http/jdk.internal.net.http.http3
- * @run junit/othervm EncoderTest
+ * @run junit/othervm ${test.main.class}
  */
 @TestInstance(TestInstance.Lifecycle.PER_CLASS)
 public class EncoderTest {
diff --git a/test/jdk/java/net/httpclient/qpack/EntriesEvictionTest.java b/test/jdk/java/net/httpclient/qpack/EntriesEvictionTest.java
index 76d15d0ace9..b5b2348b7ab 100644
--- a/test/jdk/java/net/httpclient/qpack/EntriesEvictionTest.java
+++ b/test/jdk/java/net/httpclient/qpack/EntriesEvictionTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2023, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2023, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -35,7 +35,7 @@
  *          java.net.http/jdk.internal.net.http.http3.streams
  *          java.net.http/jdk.internal.net.http.http3.frames
  *          java.net.http/jdk.internal.net.http.http3
- * @run junit/othervm -Djdk.internal.httpclient.qpack.log.level=EXTRA EntriesEvictionTest
+ * @run junit/othervm -Djdk.internal.httpclient.qpack.log.level=EXTRA ${test.main.class}
  */
 
 import java.util.ArrayList;
diff --git a/test/jdk/java/net/httpclient/qpack/FieldSectionPrefixTest.java b/test/jdk/java/net/httpclient/qpack/FieldSectionPrefixTest.java
index b6fac8291f8..12b1ca60bb4 100644
--- a/test/jdk/java/net/httpclient/qpack/FieldSectionPrefixTest.java
+++ b/test/jdk/java/net/httpclient/qpack/FieldSectionPrefixTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2023, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2023, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -30,7 +30,7 @@
  *          java.net.http/jdk.internal.net.http.http3.streams
  *          java.net.http/jdk.internal.net.http.http3.frames
  *          java.net.http/jdk.internal.net.http.http3
- * @run junit FieldSectionPrefixTest
+ * @run junit ${test.main.class}
  */
 
 
diff --git a/test/jdk/java/net/httpclient/qpack/IntegerReaderMaxValuesTest.java b/test/jdk/java/net/httpclient/qpack/IntegerReaderMaxValuesTest.java
index ac156e2b547..0005c96df88 100644
--- a/test/jdk/java/net/httpclient/qpack/IntegerReaderMaxValuesTest.java
+++ b/test/jdk/java/net/httpclient/qpack/IntegerReaderMaxValuesTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2024, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2024, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -41,7 +41,7 @@ import org.junit.jupiter.params.provider.MethodSource;
  *          java.net.http/jdk.internal.net.http.qpack.readers
  *          java.net.http/jdk.internal.net.http.qpack.writers
  * @run junit/othervm -Djdk.internal.httpclient.qpack.log.level=INFO
- *                     IntegerReaderMaxValuesTest
+ *                     ${test.main.class}
  */
 @TestInstance(TestInstance.Lifecycle.PER_CLASS)
 public class IntegerReaderMaxValuesTest {
diff --git a/test/jdk/java/net/httpclient/qpack/StaticTableFieldsTest.java b/test/jdk/java/net/httpclient/qpack/StaticTableFieldsTest.java
index eea9b31e932..fcee35df53e 100644
--- a/test/jdk/java/net/httpclient/qpack/StaticTableFieldsTest.java
+++ b/test/jdk/java/net/httpclient/qpack/StaticTableFieldsTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2021, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2021, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -24,7 +24,7 @@
 /*
  * @test
  * @modules java.net.http/jdk.internal.net.http.qpack
- * @run junit/othervm -Djdk.internal.httpclient.qpack.log.level=NORMAL StaticTableFieldsTest
+ * @run junit/othervm -Djdk.internal.httpclient.qpack.log.level=NORMAL ${test.main.class}
  */
 
 import jdk.internal.net.http.qpack.StaticTable;
diff --git a/test/jdk/java/net/httpclient/qpack/StringLengthLimitsTest.java b/test/jdk/java/net/httpclient/qpack/StringLengthLimitsTest.java
index 7c94abf1504..56d26db31e4 100644
--- a/test/jdk/java/net/httpclient/qpack/StringLengthLimitsTest.java
+++ b/test/jdk/java/net/httpclient/qpack/StringLengthLimitsTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2024, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2024, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -61,7 +61,7 @@ import org.junit.jupiter.params.provider.MethodSource;
  *          java.net.http/jdk.internal.net.http.http3
  * @build EncoderDecoderConnector
  * @run junit/othervm -Djdk.http.qpack.allowBlockingEncoding=true
- *                      StringLengthLimitsTest
+ *                      ${test.main.class}
  */
 @TestInstance(TestInstance.Lifecycle.PER_CLASS)
 public class StringLengthLimitsTest {
diff --git a/test/jdk/java/net/httpclient/qpack/TablesIndexerTest.java b/test/jdk/java/net/httpclient/qpack/TablesIndexerTest.java
index 1a175342c6b..10b5b58b0e4 100644
--- a/test/jdk/java/net/httpclient/qpack/TablesIndexerTest.java
+++ b/test/jdk/java/net/httpclient/qpack/TablesIndexerTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2023, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2023, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -24,7 +24,7 @@
 /*
  * @test
  * @modules java.net.http/jdk.internal.net.http.qpack
- * @run junit/othervm -Djdk.internal.httpclient.qpack.log.level=INFO TablesIndexerTest
+ * @run junit/othervm -Djdk.internal.httpclient.qpack.log.level=INFO ${test.main.class}
  */
 
 import jdk.internal.net.http.qpack.DynamicTable;
diff --git a/test/jdk/java/net/httpclient/qpack/UnacknowledgedInsertionTest.java b/test/jdk/java/net/httpclient/qpack/UnacknowledgedInsertionTest.java
index 5d0129234f3..24a2195cdbd 100644
--- a/test/jdk/java/net/httpclient/qpack/UnacknowledgedInsertionTest.java
+++ b/test/jdk/java/net/httpclient/qpack/UnacknowledgedInsertionTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2023, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2023, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -57,7 +57,7 @@ import org.junit.jupiter.params.provider.MethodSource;
  *          java.net.http/jdk.internal.net.http.http3.frames
  *          java.net.http/jdk.internal.net.http.http3
  * @build EncoderDecoderConnector
- * @run junit/othervm -Djdk.internal.httpclient.qpack.log.level=EXTRA UnacknowledgedInsertionTest
+ * @run junit/othervm -Djdk.internal.httpclient.qpack.log.level=EXTRA ${test.main.class}
  */
 @TestInstance(TestInstance.Lifecycle.PER_CLASS)
 public class UnacknowledgedInsertionTest {
diff --git a/test/jdk/java/net/httpclient/quic/AckElicitingTest.java b/test/jdk/java/net/httpclient/quic/AckElicitingTest.java
index 7fbc00f9148..97da68c1031 100644
--- a/test/jdk/java/net/httpclient/quic/AckElicitingTest.java
+++ b/test/jdk/java/net/httpclient/quic/AckElicitingTest.java
@@ -89,8 +89,8 @@ import org.junit.jupiter.params.provider.MethodSource;
  * @summary tests the logic to decide whether a packet or
  *          a frame is ACK-eliciting.
  * @library /test/lib
- * @run junit AckElicitingTest
- * @run junit/othervm -Dseed=-7997973196290088038 AckElicitingTest
+ * @run junit ${test.main.class}
+ * @run junit/othervm -Dseed=-7997973196290088038 ${test.main.class}
  */
 public class AckElicitingTest {
 
diff --git a/test/jdk/java/net/httpclient/quic/AckFrameTest.java b/test/jdk/java/net/httpclient/quic/AckFrameTest.java
index 3c8c027e73b..51326628521 100644
--- a/test/jdk/java/net/httpclient/quic/AckFrameTest.java
+++ b/test/jdk/java/net/httpclient/quic/AckFrameTest.java
@@ -46,7 +46,7 @@ import org.junit.jupiter.params.provider.MethodSource;
  * @test
  * @summary tests the logic to build an AckFrame
  * @library /test/lib
- * @run junit AckFrameTest
+ * @run junit ${test.main.class}
  */
 public class AckFrameTest {
 
diff --git a/test/jdk/java/net/httpclient/quic/BuffersReaderTest.java b/test/jdk/java/net/httpclient/quic/BuffersReaderTest.java
index 8d03f4265b3..d73178a88ec 100644
--- a/test/jdk/java/net/httpclient/quic/BuffersReaderTest.java
+++ b/test/jdk/java/net/httpclient/quic/BuffersReaderTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2021, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -50,7 +50,7 @@ import static org.junit.jupiter.api.Assertions.*;
  * @test
  * @library /test/lib
  * @modules java.net.http/jdk.internal.net.http.quic
- * @run junit/othervm BuffersReaderTest
+ * @run junit/othervm ${test.main.class}
  * @summary Tests various BuffersReader methods
  *  work as expected.
  */
diff --git a/test/jdk/java/net/httpclient/quic/BuffersReaderVLTest.java b/test/jdk/java/net/httpclient/quic/BuffersReaderVLTest.java
index 100a6112de5..dc2c4a986c3 100644
--- a/test/jdk/java/net/httpclient/quic/BuffersReaderVLTest.java
+++ b/test/jdk/java/net/httpclient/quic/BuffersReaderVLTest.java
@@ -39,7 +39,7 @@ import org.junit.jupiter.params.provider.MethodSource;
  * @test
  * @library /test/lib
  * @modules java.net.http/jdk.internal.net.http.quic
- * @run junit/othervm BuffersReaderVLTest
+ * @run junit/othervm ${test.main.class}
  * @summary Tests to check quic/util methods encode/decodeVariableLength methods
  *  work as expected.
  */
diff --git a/test/jdk/java/net/httpclient/quic/ConnectionIDSTest.java b/test/jdk/java/net/httpclient/quic/ConnectionIDSTest.java
index 96aeace0898..a54662f4f87 100644
--- a/test/jdk/java/net/httpclient/quic/ConnectionIDSTest.java
+++ b/test/jdk/java/net/httpclient/quic/ConnectionIDSTest.java
@@ -35,7 +35,7 @@ import org.junit.jupiter.api.Test;
 
 /*
  * @test
- * @run junit/othervm ConnectionIDSTest
+ * @run junit/othervm ${test.main.class}
  */
 public class ConnectionIDSTest {
 
diff --git a/test/jdk/java/net/httpclient/quic/CryptoWriterQueueTest.java b/test/jdk/java/net/httpclient/quic/CryptoWriterQueueTest.java
index 422d71ca964..6a87d859170 100644
--- a/test/jdk/java/net/httpclient/quic/CryptoWriterQueueTest.java
+++ b/test/jdk/java/net/httpclient/quic/CryptoWriterQueueTest.java
@@ -34,7 +34,7 @@ import org.junit.jupiter.api.Test;
  * @summary Tests jdk.internal.net.http.quic.streams,CryptoWriterQueue
  * @modules java.net.http/jdk.internal.net.http.quic.streams
  * java.net.http/jdk.internal.net.http.quic.frames
- * @run junit CryptoWriterQueueTest
+ * @run junit ${test.main.class}
  */
 public class CryptoWriterQueueTest {
 
diff --git a/test/jdk/java/net/httpclient/quic/CubicTest.java b/test/jdk/java/net/httpclient/quic/CubicTest.java
index f4b08e6d9b7..711be0700fa 100644
--- a/test/jdk/java/net/httpclient/quic/CubicTest.java
+++ b/test/jdk/java/net/httpclient/quic/CubicTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2025, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -38,7 +38,7 @@ import static org.junit.jupiter.api.Assertions.assertEquals;
 
 /*
  * @test
- * @run junit/othervm -Djdk.httpclient.HttpClient.log=trace,quic:cc CubicTest
+ * @run junit/othervm -Djdk.httpclient.HttpClient.log=trace,quic:cc ${test.main.class}
  */
 public class CubicTest {
     static class TimeSource implements TimeLine {
diff --git a/test/jdk/java/net/httpclient/quic/KeyUpdateTest.java b/test/jdk/java/net/httpclient/quic/KeyUpdateTest.java
index eaec0bc8b95..23b667d3953 100644
--- a/test/jdk/java/net/httpclient/quic/KeyUpdateTest.java
+++ b/test/jdk/java/net/httpclient/quic/KeyUpdateTest.java
@@ -83,7 +83,7 @@ import org.junit.jupiter.api.Test;
  * @run junit/othervm -Djava.security.properties=${test.src}/quic-tls-keylimits-java.security
  *                     -Djdk.internal.httpclient.debug=true
  *                     -Djavax.net.debug=all
- *                     KeyUpdateTest
+ *                     ${test.main.class}
  */
 public class KeyUpdateTest {
 
diff --git a/test/jdk/java/net/httpclient/quic/OrderedFlowTest.java b/test/jdk/java/net/httpclient/quic/OrderedFlowTest.java
index a1fafba8760..f5f742d9226 100644
--- a/test/jdk/java/net/httpclient/quic/OrderedFlowTest.java
+++ b/test/jdk/java/net/httpclient/quic/OrderedFlowTest.java
@@ -50,11 +50,11 @@ import org.junit.jupiter.params.provider.MethodSource;
  * @summary tests the reordering logic implemented by OrderedFlow
  *          and its two concrete subclasses
  * @library /test/lib
- * @run junit OrderedFlowTest
- * @run junit/othervm -Dseed=-2680947227866359853 OrderedFlowTest
- * @run junit/othervm -Dseed=-273117134353023275 OrderedFlowTest
- * @run junit/othervm -Dseed=3649132517916066643 OrderedFlowTest
- * @run junit/othervm -Dseed=4568737726943220431 OrderedFlowTest
+ * @run junit ${test.main.class}
+ * @run junit/othervm -Dseed=-2680947227866359853 ${test.main.class}
+ * @run junit/othervm -Dseed=-273117134353023275 ${test.main.class}
+ * @run junit/othervm -Dseed=3649132517916066643 ${test.main.class}
+ * @run junit/othervm -Dseed=4568737726943220431 ${test.main.class}
  */
 public class OrderedFlowTest {
 
diff --git a/test/jdk/java/net/httpclient/quic/PacerTest.java b/test/jdk/java/net/httpclient/quic/PacerTest.java
index aebbbce34d3..a624817bd4e 100644
--- a/test/jdk/java/net/httpclient/quic/PacerTest.java
+++ b/test/jdk/java/net/httpclient/quic/PacerTest.java
@@ -40,7 +40,7 @@ import org.junit.jupiter.params.provider.MethodSource;
 
 /*
  * @test
- * @run junit/othervm -Djdk.httpclient.quic.timerFrequency=1000 PacerTest
+ * @run junit/othervm -Djdk.httpclient.quic.timerFrequency=1000 ${test.main.class}
  */
 public class PacerTest {
 
diff --git a/test/jdk/java/net/httpclient/quic/PacketEncodingTest.java b/test/jdk/java/net/httpclient/quic/PacketEncodingTest.java
index a96904c8410..fa43baa853f 100644
--- a/test/jdk/java/net/httpclient/quic/PacketEncodingTest.java
+++ b/test/jdk/java/net/httpclient/quic/PacketEncodingTest.java
@@ -80,17 +80,17 @@ import org.junit.jupiter.params.provider.MethodSource;
  * @library /test/lib
  * @summary test packet encoding and decoding in unencrypted form and without
  *          any network involvement.
- * @run junit/othervm -Dseed=2646683818688275736 PacketEncodingTest
- * @run junit/othervm -Dseed=-3723256402256409075 PacketEncodingTest
- * @run junit/othervm -Dseed=-3689060484817342283 PacketEncodingTest
- * @run junit/othervm -Dseed=2425718686525936108 PacketEncodingTest
- * @run junit/othervm -Dseed=-2996954753243104355 PacketEncodingTest
- * @run junit/othervm -Dseed=8750823652999067800 PacketEncodingTest
- * @run junit/othervm -Dseed=2906555779406889127 PacketEncodingTest
- * @run junit/othervm -Dseed=902801756808168822 PacketEncodingTest
- * @run junit/othervm -Dseed=5643545543196691308 PacketEncodingTest
- * @run junit/othervm -Dseed=2646683818688275736 PacketEncodingTest
- * @run junit/othervm -Djdk.internal.httpclient.debug=true PacketEncodingTest
+ * @run junit/othervm -Dseed=2646683818688275736 ${test.main.class}
+ * @run junit/othervm -Dseed=-3723256402256409075 ${test.main.class}
+ * @run junit/othervm -Dseed=-3689060484817342283 ${test.main.class}
+ * @run junit/othervm -Dseed=2425718686525936108 ${test.main.class}
+ * @run junit/othervm -Dseed=-2996954753243104355 ${test.main.class}
+ * @run junit/othervm -Dseed=8750823652999067800 ${test.main.class}
+ * @run junit/othervm -Dseed=2906555779406889127 ${test.main.class}
+ * @run junit/othervm -Dseed=902801756808168822 ${test.main.class}
+ * @run junit/othervm -Dseed=5643545543196691308 ${test.main.class}
+ * @run junit/othervm -Dseed=2646683818688275736 ${test.main.class}
+ * @run junit/othervm -Djdk.internal.httpclient.debug=true ${test.main.class}
  */
 public class PacketEncodingTest {
 
diff --git a/test/jdk/java/net/httpclient/quic/PacketLossTest.java b/test/jdk/java/net/httpclient/quic/PacketLossTest.java
index a597c826e73..9ecb3444060 100644
--- a/test/jdk/java/net/httpclient/quic/PacketLossTest.java
+++ b/test/jdk/java/net/httpclient/quic/PacketLossTest.java
@@ -63,7 +63,7 @@ import org.junit.jupiter.api.Test;
  *                     -Djdk.httpclient.quic.minPtoBackoffTime=60
  *                     -Djdk.httpclient.quic.maxPtoBackoffTime=10
  *                     -Djdk.httpclient.quic.maxPtoBackoff=9
- *                     -Djdk.httpclient.HttpClient.log=quic,errors PacketLossTest
+ *                     -Djdk.httpclient.HttpClient.log=quic,errors ${test.main.class}
  */
 public class PacketLossTest {
 
diff --git a/test/jdk/java/net/httpclient/quic/PacketNumbersTest.java b/test/jdk/java/net/httpclient/quic/PacketNumbersTest.java
index c018079ea4e..7c19e8b414e 100644
--- a/test/jdk/java/net/httpclient/quic/PacketNumbersTest.java
+++ b/test/jdk/java/net/httpclient/quic/PacketNumbersTest.java
@@ -37,7 +37,7 @@ import org.junit.jupiter.params.provider.MethodSource;
 
 /*
  * @test
- * @run junit PacketNumbersTest
+ * @run junit ${test.main.class}
  */
 public class PacketNumbersTest {
 
diff --git a/test/jdk/java/net/httpclient/quic/PacketSpaceManagerTest.java b/test/jdk/java/net/httpclient/quic/PacketSpaceManagerTest.java
index fe3b748a2fa..0a363e104ae 100644
--- a/test/jdk/java/net/httpclient/quic/PacketSpaceManagerTest.java
+++ b/test/jdk/java/net/httpclient/quic/PacketSpaceManagerTest.java
@@ -94,14 +94,14 @@ import org.junit.jupiter.params.provider.MethodSource;
  * @library /test/lib
  * @library ../debug
  * @build java.net.http/jdk.internal.net.http.common.TestLoggerUtil
- * @run junit/othervm PacketSpaceManagerTest
- * @run junit/othervm -Dseed=-7947549564260911920 PacketSpaceManagerTest
- * @run junit/othervm -Dseed=-5413111674202728207 PacketSpaceManagerTest
- * @run junit/othervm -Dseed=-176652423987357212 PacketSpaceManagerTest
- * @run junit/othervm -Dseed=6550551791799910315 PacketSpaceManagerTest
- * @run junit/othervm -Dseed=-4159871071396382784 PacketSpaceManagerTest
- * @run junit/othervm -Dseed=2252276218459363615 PacketSpaceManagerTest
- * @run junit/othervm -Dseed=-5130588140709404919 PacketSpaceManagerTest
+ * @run junit/othervm ${test.main.class}
+ * @run junit/othervm -Dseed=-7947549564260911920 ${test.main.class}
+ * @run junit/othervm -Dseed=-5413111674202728207 ${test.main.class}
+ * @run junit/othervm -Dseed=-176652423987357212 ${test.main.class}
+ * @run junit/othervm -Dseed=6550551791799910315 ${test.main.class}
+ * @run junit/othervm -Dseed=-4159871071396382784 ${test.main.class}
+ * @run junit/othervm -Dseed=2252276218459363615 ${test.main.class}
+ * @run junit/othervm -Dseed=-5130588140709404919 ${test.main.class}
  */
 // -Djdk.internal.httpclient.debug=true
 public class PacketSpaceManagerTest {
diff --git a/test/jdk/java/net/httpclient/quic/QuicFramesDecoderTest.java b/test/jdk/java/net/httpclient/quic/QuicFramesDecoderTest.java
index ef0801e6c18..d6eeda32cad 100644
--- a/test/jdk/java/net/httpclient/quic/QuicFramesDecoderTest.java
+++ b/test/jdk/java/net/httpclient/quic/QuicFramesDecoderTest.java
@@ -37,7 +37,7 @@ import org.junit.jupiter.params.provider.MethodSource;
  * @test
  * @library /test/lib
  * @summary Tests to check QUIC frame decoding errors are handled correctly
- * @run junit/othervm QuicFramesDecoderTest
+ * @run junit/othervm ${test.main.class}
  */
 public class QuicFramesDecoderTest {
 
diff --git a/test/jdk/java/net/httpclient/quic/QuicRequestResponseTest.java b/test/jdk/java/net/httpclient/quic/QuicRequestResponseTest.java
index 2393ac7df12..d70b5ac8443 100644
--- a/test/jdk/java/net/httpclient/quic/QuicRequestResponseTest.java
+++ b/test/jdk/java/net/httpclient/quic/QuicRequestResponseTest.java
@@ -55,7 +55,7 @@ import org.junit.jupiter.api.Test;
  *        jdk.httpclient.test.lib.quic.ClientConnection
  *        jdk.httpclient.test.lib.common.TestUtil
  *        jdk.test.lib.net.SimpleSSLContext
- * @run junit/othervm -Djdk.internal.httpclient.debug=true QuicRequestResponseTest
+ * @run junit/othervm -Djdk.internal.httpclient.debug=true ${test.main.class}
  */
 public class QuicRequestResponseTest {
 
diff --git a/test/jdk/java/net/httpclient/quic/StatelessResetReceiptTest.java b/test/jdk/java/net/httpclient/quic/StatelessResetReceiptTest.java
index 9f7852740b4..bed76c9b0a2 100644
--- a/test/jdk/java/net/httpclient/quic/StatelessResetReceiptTest.java
+++ b/test/jdk/java/net/httpclient/quic/StatelessResetReceiptTest.java
@@ -71,7 +71,7 @@ import static org.junit.jupiter.api.Assertions.assertTrue;
  * @library /test/lib /test/jdk/java/net/httpclient/lib
  * @build jdk.httpclient.test.lib.quic.QuicStandaloneServer
  *          jdk.test.lib.net.SimpleSSLContext jdk.httpclient.test.lib.common.TestUtil
- * @run junit/othervm -Djdk.internal.httpclient.debug=true StatelessResetReceiptTest
+ * @run junit/othervm -Djdk.internal.httpclient.debug=true ${test.main.class}
  */
 public class StatelessResetReceiptTest {
 
diff --git a/test/jdk/java/net/httpclient/quic/VariableLengthTest.java b/test/jdk/java/net/httpclient/quic/VariableLengthTest.java
index 6d805fbad5a..f5dbb8f159c 100644
--- a/test/jdk/java/net/httpclient/quic/VariableLengthTest.java
+++ b/test/jdk/java/net/httpclient/quic/VariableLengthTest.java
@@ -38,7 +38,7 @@ import org.opentest4j.TestAbortedException;
  * @test
  * @library /test/lib
  * @modules java.net.http/jdk.internal.net.http.quic
- * @run junit/othervm VariableLengthTest
+ * @run junit/othervm ${test.main.class}
  * @summary Tests to check quic/util methods encode/decodeVariableLength methods
  *  work as expected.
  */
diff --git a/test/jdk/java/net/httpclient/quic/VersionNegotiationTest.java b/test/jdk/java/net/httpclient/quic/VersionNegotiationTest.java
index 6b40bf84a8e..bee9bfc7d2c 100644
--- a/test/jdk/java/net/httpclient/quic/VersionNegotiationTest.java
+++ b/test/jdk/java/net/httpclient/quic/VersionNegotiationTest.java
@@ -59,7 +59,7 @@ import org.junit.jupiter.api.Test;
  *        jdk.httpclient.test.lib.common.TestUtil
  *        jdk.httpclient.test.lib.quic.ClientConnection
  *        jdk.test.lib.net.SimpleSSLContext
- * @run junit/othervm -Djdk.internal.httpclient.debug=true VersionNegotiationTest
+ * @run junit/othervm -Djdk.internal.httpclient.debug=true ${test.main.class}
  */
 public class VersionNegotiationTest {
 
diff --git a/test/jdk/java/net/httpclient/quic/tls/PacketEncryptionTest.java b/test/jdk/java/net/httpclient/quic/tls/PacketEncryptionTest.java
index d80e473696a..bb69e377860 100644
--- a/test/jdk/java/net/httpclient/quic/tls/PacketEncryptionTest.java
+++ b/test/jdk/java/net/httpclient/quic/tls/PacketEncryptionTest.java
@@ -52,7 +52,7 @@ import org.junit.jupiter.api.Test;
  *          java.base/jdk.internal.net.quic
  * @build java.base/sun.security.ssl.QuicTLSEngineImplAccessor
  * @summary known-answer test for packet encryption and decryption
- * @run junit/othervm PacketEncryptionTest
+ * @run junit/othervm ${test.main.class}
  */
 public class PacketEncryptionTest {
 
diff --git a/test/jdk/java/net/httpclient/quic/tls/QuicTLSEngineBadParametersTest.java b/test/jdk/java/net/httpclient/quic/tls/QuicTLSEngineBadParametersTest.java
index 0b7e6875b96..5a10136470b 100644
--- a/test/jdk/java/net/httpclient/quic/tls/QuicTLSEngineBadParametersTest.java
+++ b/test/jdk/java/net/httpclient/quic/tls/QuicTLSEngineBadParametersTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2023, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2023, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -44,7 +44,7 @@ import static org.junit.jupiter.api.Assertions.*;
  * @build jdk.test.lib.net.SimpleSSLContext
  * @summary Verify that QuicTransportExceptions thrown by transport parameter consumer
  *      are propagated to the QuicTLSEngine user
- * @run junit/othervm QuicTLSEngineBadParametersTest
+ * @run junit/othervm ${test.main.class}
  */
 public class QuicTLSEngineBadParametersTest {
 
diff --git a/test/jdk/java/net/httpclient/quic/tls/QuicTLSEngineFailedALPNTest.java b/test/jdk/java/net/httpclient/quic/tls/QuicTLSEngineFailedALPNTest.java
index 5767d81cc83..1fd37e32eaa 100644
--- a/test/jdk/java/net/httpclient/quic/tls/QuicTLSEngineFailedALPNTest.java
+++ b/test/jdk/java/net/httpclient/quic/tls/QuicTLSEngineFailedALPNTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2023, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2023, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -42,7 +42,7 @@ import static org.junit.jupiter.api.Assertions.*;
  *          java.base/jdk.internal.net.quic
  * @build jdk.test.lib.net.SimpleSSLContext
  * @summary Verify that a missing ALPN extension results in no_application_protocol alert
- * @run junit/othervm QuicTLSEngineFailedALPNTest
+ * @run junit/othervm ${test.main.class}
  */
 public class QuicTLSEngineFailedALPNTest {
 
diff --git a/test/jdk/java/net/httpclient/quic/tls/QuicTLSEngineMissingParametersTest.java b/test/jdk/java/net/httpclient/quic/tls/QuicTLSEngineMissingParametersTest.java
index 933d258f912..f5c882a074d 100644
--- a/test/jdk/java/net/httpclient/quic/tls/QuicTLSEngineMissingParametersTest.java
+++ b/test/jdk/java/net/httpclient/quic/tls/QuicTLSEngineMissingParametersTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2023, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2023, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -42,7 +42,7 @@ import static org.junit.jupiter.api.Assertions.*;
  *          java.base/jdk.internal.net.quic
  * @build jdk.test.lib.net.SimpleSSLContext
  * @summary Verify that a missing transport parameters extension results in missing_extension alert
- * @run junit/othervm QuicTLSEngineMissingParametersTest
+ * @run junit/othervm ${test.main.class}
  */
 public class QuicTLSEngineMissingParametersTest {
 
diff --git a/test/jdk/java/net/httpclient/quic/tls/Quicv2PacketEncryptionTest.java b/test/jdk/java/net/httpclient/quic/tls/Quicv2PacketEncryptionTest.java
index 285fa2e4cd4..6205c8f3c7b 100644
--- a/test/jdk/java/net/httpclient/quic/tls/Quicv2PacketEncryptionTest.java
+++ b/test/jdk/java/net/httpclient/quic/tls/Quicv2PacketEncryptionTest.java
@@ -52,7 +52,7 @@ import org.junit.jupiter.api.Test;
  *          java.base/jdk.internal.net.quic
  * @build java.base/sun.security.ssl.QuicTLSEngineImplAccessor
  * @summary known-answer test for packet encryption and decryption with Quic v2
- * @run junit/othervm Quicv2PacketEncryptionTest
+ * @run junit/othervm ${test.main.class}
  */
 public class Quicv2PacketEncryptionTest {
 
diff --git a/test/jdk/java/net/httpclient/security/filePerms/FileProcessorPermissionTest.java b/test/jdk/java/net/httpclient/security/filePerms/FileProcessorPermissionTest.java
index 361b053fe43..d703907c2eb 100644
--- a/test/jdk/java/net/httpclient/security/filePerms/FileProcessorPermissionTest.java
+++ b/test/jdk/java/net/httpclient/security/filePerms/FileProcessorPermissionTest.java
@@ -24,7 +24,7 @@
 /*
  * @test
  * @summary Basic checks for File Processors
- * @run junit/othervm FileProcessorPermissionTest
+ * @run junit/othervm ${test.main.class}
  */
 
 import java.nio.file.Path;
diff --git a/test/jdk/java/net/httpclient/security/filePerms/SecurityBeforeFile.java b/test/jdk/java/net/httpclient/security/filePerms/SecurityBeforeFile.java
index c8d7bb64b36..ab03ee08d64 100644
--- a/test/jdk/java/net/httpclient/security/filePerms/SecurityBeforeFile.java
+++ b/test/jdk/java/net/httpclient/security/filePerms/SecurityBeforeFile.java
@@ -25,7 +25,7 @@
  * @test
  * @summary Verifies security checks are performed before existence checks
  *          in pre-defined body processors APIs
- * @run junit/othervm SecurityBeforeFile
+ * @run junit/othervm ${test.main.class}
  */
 
 import java.io.FileNotFoundException;
diff --git a/test/jdk/java/net/httpclient/ssltest/CertificateTest.java b/test/jdk/java/net/httpclient/ssltest/CertificateTest.java
index 1d0502c9ce3..23f7aebf9fc 100644
--- a/test/jdk/java/net/httpclient/ssltest/CertificateTest.java
+++ b/test/jdk/java/net/httpclient/ssltest/CertificateTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2023, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -42,21 +42,21 @@ import jdk.test.lib.security.SSLContextBuilder;
  * @library /test/lib /test/jdk/java/net/httpclient/lib
  * @build Server CertificateTest jdk.httpclient.test.lib.common.TestServerConfigurator
  * @modules java.net.http/jdk.internal.net.http.common
- * @run main/othervm CertificateTest GOOD_CERT expectSuccess
- * @run main/othervm CertificateTest BAD_CERT expectFailure
+ * @run main/othervm ${test.main.class} GOOD_CERT expectSuccess
+ * @run main/othervm ${test.main.class} BAD_CERT expectFailure
  * @run main/othervm
  *      -Djdk.internal.httpclient.disableHostnameVerification
- *       CertificateTest BAD_CERT expectSuccess
+ *       ${test.main.class} BAD_CERT expectSuccess
  * @run main/othervm
  *      -Djdk.internal.httpclient.disableHostnameVerification=true
- *       CertificateTest BAD_CERT expectSuccess
+ *       ${test.main.class} BAD_CERT expectSuccess
  * @run main/othervm
  *      -Djdk.internal.httpclient.disableHostnameVerification=false
- *       CertificateTest BAD_CERT expectFailure
+ *       ${test.main.class} BAD_CERT expectFailure
  * @run main/othervm
  *      -Djdk.internal.httpclient.disableHostnameVerification=xxyyzz
- *       CertificateTest BAD_CERT expectFailure
- * @run main/othervm CertificateTest LOOPBACK_CERT expectSuccess
+ *       ${test.main.class} BAD_CERT expectFailure
+ * @run main/othervm ${test.main.class} LOOPBACK_CERT expectSuccess
  */
 
 /**
diff --git a/test/jdk/java/net/httpclient/ssltest/TlsVersionTest.java b/test/jdk/java/net/httpclient/ssltest/TlsVersionTest.java
index 2e364461793..0916022e89a 100644
--- a/test/jdk/java/net/httpclient/ssltest/TlsVersionTest.java
+++ b/test/jdk/java/net/httpclient/ssltest/TlsVersionTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2020, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -47,12 +47,12 @@ import static java.net.http.HttpClient.Builder.NO_PROXY;
  * @modules java.net.http/jdk.internal.net.http.common
  * @run main/othervm
  *      -Djdk.internal.httpclient.disableHostnameVerification
- *       TlsVersionTest false
+ *       ${test.main.class} false
  *
  * @run main/othervm
  *      -Djdk.internal.httpclient.disableHostnameVerification
  *      -Djdk.tls.client.protocols="TLSv1.2"
- *       TlsVersionTest true
+ *       ${test.main.class} true
  */
 
 /**
diff --git a/test/jdk/java/net/httpclient/websocket/Abort.java b/test/jdk/java/net/httpclient/websocket/Abort.java
index a6088f8cce2..6a388878db2 100644
--- a/test/jdk/java/net/httpclient/websocket/Abort.java
+++ b/test/jdk/java/net/httpclient/websocket/Abort.java
@@ -26,7 +26,7 @@
  * @build DummyWebSocketServer
  * @run junit/othervm
  *      -Djdk.internal.httpclient.websocket.debug=true
- *       Abort
+ *       ${test.main.class}
  */
 
 
diff --git a/test/jdk/java/net/httpclient/websocket/AutomaticPong.java b/test/jdk/java/net/httpclient/websocket/AutomaticPong.java
index b438cb8e728..a590790c29a 100644
--- a/test/jdk/java/net/httpclient/websocket/AutomaticPong.java
+++ b/test/jdk/java/net/httpclient/websocket/AutomaticPong.java
@@ -26,7 +26,7 @@
  * @build DummyWebSocketServer
  * @run junit/othervm
  *      -Djdk.internal.httpclient.websocket.debug=true
- *       AutomaticPong
+ *       ${test.main.class}
  */
 import jdk.internal.net.http.websocket.Frame;
 
diff --git a/test/jdk/java/net/httpclient/websocket/BlowupOutputQueue.java b/test/jdk/java/net/httpclient/websocket/BlowupOutputQueue.java
index 1865ca05e4f..191fd4bcb37 100644
--- a/test/jdk/java/net/httpclient/websocket/BlowupOutputQueue.java
+++ b/test/jdk/java/net/httpclient/websocket/BlowupOutputQueue.java
@@ -27,7 +27,7 @@
  * @run junit/othervm
  *      -Djdk.internal.httpclient.debug=true
  *      -Djdk.internal.httpclient.websocket.debug=true
- *       BlowupOutputQueue
+ *       ${test.main.class}
  */
 
 import java.io.IOException;
diff --git a/test/jdk/java/net/httpclient/websocket/ConnectionHandoverTest.java b/test/jdk/java/net/httpclient/websocket/ConnectionHandoverTest.java
index 30569fa80d7..0633fe9c20f 100644
--- a/test/jdk/java/net/httpclient/websocket/ConnectionHandoverTest.java
+++ b/test/jdk/java/net/httpclient/websocket/ConnectionHandoverTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2017, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2017, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -26,7 +26,7 @@
  * @bug 8164625
  * @summary Verifies HttpClient yields the connection to the WebSocket
  * @build DummyWebSocketServer
- * @run main/othervm -Djdk.httpclient.HttpClient.log=trace ConnectionHandoverTest
+ * @run main/othervm -Djdk.httpclient.HttpClient.log=trace ${test.main.class}
  */
 
 import java.io.IOException;
diff --git a/test/jdk/java/net/httpclient/websocket/HandshakeUrlEncodingTest.java b/test/jdk/java/net/httpclient/websocket/HandshakeUrlEncodingTest.java
index 6854cacbcc2..344e6fbc086 100644
--- a/test/jdk/java/net/httpclient/websocket/HandshakeUrlEncodingTest.java
+++ b/test/jdk/java/net/httpclient/websocket/HandshakeUrlEncodingTest.java
@@ -29,7 +29,7 @@
  * @build jdk.test.lib.net.SimpleSSLContext jdk.httpclient.test.lib.common.TestServerConfigurator
  * @modules java.net.http/jdk.internal.net.http.common
  *          jdk.httpserver
- * @run junit/othervm -Djdk.internal.httpclient.debug=true HandshakeUrlEncodingTest
+ * @run junit/othervm -Djdk.internal.httpclient.debug=true ${test.main.class}
  */
 
 import com.sun.net.httpserver.HttpHandler;
diff --git a/test/jdk/java/net/httpclient/websocket/PendingBinaryPingClose.java b/test/jdk/java/net/httpclient/websocket/PendingBinaryPingClose.java
index 4a5ae315e91..67d53eafd31 100644
--- a/test/jdk/java/net/httpclient/websocket/PendingBinaryPingClose.java
+++ b/test/jdk/java/net/httpclient/websocket/PendingBinaryPingClose.java
@@ -28,7 +28,7 @@
  *      -Djdk.httpclient.sendBufferSize=8192
  *      -Djdk.internal.httpclient.debug=true
  *      -Djdk.internal.httpclient.websocket.debug=true
- *       PendingBinaryPingClose
+ *       ${test.main.class}
  */
 
 import java.net.http.WebSocket;
diff --git a/test/jdk/java/net/httpclient/websocket/PendingBinaryPongClose.java b/test/jdk/java/net/httpclient/websocket/PendingBinaryPongClose.java
index a8330faeb3f..f634fe8bd45 100644
--- a/test/jdk/java/net/httpclient/websocket/PendingBinaryPongClose.java
+++ b/test/jdk/java/net/httpclient/websocket/PendingBinaryPongClose.java
@@ -28,7 +28,7 @@
  *      -Djdk.httpclient.sendBufferSize=8192
  *      -Djdk.internal.httpclient.debug=true
  *      -Djdk.internal.httpclient.websocket.debug=true
- *       PendingBinaryPongClose
+ *       ${test.main.class}
  */
 
 import java.net.http.WebSocket;
diff --git a/test/jdk/java/net/httpclient/websocket/PendingPingBinaryClose.java b/test/jdk/java/net/httpclient/websocket/PendingPingBinaryClose.java
index e07ebe0d03a..1f5263368f1 100644
--- a/test/jdk/java/net/httpclient/websocket/PendingPingBinaryClose.java
+++ b/test/jdk/java/net/httpclient/websocket/PendingPingBinaryClose.java
@@ -26,7 +26,7 @@
  * @build DummyWebSocketServer
  * @run junit/othervm
  *      -Djdk.httpclient.sendBufferSize=8192
- *       PendingPingBinaryClose
+ *       ${test.main.class}
  */
 
 // This test produce huge logs (14Mb+) so disable logging by default
diff --git a/test/jdk/java/net/httpclient/websocket/PendingPingTextClose.java b/test/jdk/java/net/httpclient/websocket/PendingPingTextClose.java
index eae01f804a4..ab7f3b0be87 100644
--- a/test/jdk/java/net/httpclient/websocket/PendingPingTextClose.java
+++ b/test/jdk/java/net/httpclient/websocket/PendingPingTextClose.java
@@ -26,7 +26,7 @@
  * @build DummyWebSocketServer
  * @run junit/othervm
  *      -Djdk.httpclient.sendBufferSize=8192
- *       PendingPingTextClose
+ *       ${test.main.class}
  */
 
 // This test produce huge logs (14Mb+) so disable logging by default
diff --git a/test/jdk/java/net/httpclient/websocket/PendingPongBinaryClose.java b/test/jdk/java/net/httpclient/websocket/PendingPongBinaryClose.java
index 32640853b00..2c631c798e0 100644
--- a/test/jdk/java/net/httpclient/websocket/PendingPongBinaryClose.java
+++ b/test/jdk/java/net/httpclient/websocket/PendingPongBinaryClose.java
@@ -26,7 +26,7 @@
  * @build DummyWebSocketServer
  * @run junit/othervm
  *      -Djdk.httpclient.sendBufferSize=8192
- *       PendingPongBinaryClose
+ *       ${test.main.class}
  */
 
 // This test produce huge logs (14Mb+) so disable logging by default
diff --git a/test/jdk/java/net/httpclient/websocket/PendingPongTextClose.java b/test/jdk/java/net/httpclient/websocket/PendingPongTextClose.java
index f4d6c84c2f5..33b0ade39e3 100644
--- a/test/jdk/java/net/httpclient/websocket/PendingPongTextClose.java
+++ b/test/jdk/java/net/httpclient/websocket/PendingPongTextClose.java
@@ -26,7 +26,7 @@
  * @build DummyWebSocketServer
  * @run junit/othervm
  *      -Djdk.httpclient.sendBufferSize=8192
- *       PendingPongTextClose
+ *       ${test.main.class}
  */
 
 // This test produce huge logs (14Mb+) so disable logging by default
diff --git a/test/jdk/java/net/httpclient/websocket/PendingTextPingClose.java b/test/jdk/java/net/httpclient/websocket/PendingTextPingClose.java
index 76f12430804..a35f27f4b16 100644
--- a/test/jdk/java/net/httpclient/websocket/PendingTextPingClose.java
+++ b/test/jdk/java/net/httpclient/websocket/PendingTextPingClose.java
@@ -28,7 +28,7 @@
  *      -Djdk.internal.httpclient.debug=true
  *      -Djdk.internal.httpclient.websocket.debug=true
  *      -Djdk.httpclient.sendBufferSize=8192
- *       PendingTextPingClose
+ *       ${test.main.class}
  */
 
 import java.net.http.WebSocket;
diff --git a/test/jdk/java/net/httpclient/websocket/PendingTextPongClose.java b/test/jdk/java/net/httpclient/websocket/PendingTextPongClose.java
index a2a41a73d7b..80c72297e43 100644
--- a/test/jdk/java/net/httpclient/websocket/PendingTextPongClose.java
+++ b/test/jdk/java/net/httpclient/websocket/PendingTextPongClose.java
@@ -28,7 +28,7 @@
  *      -Djdk.internal.httpclient.debug=true
  *      -Djdk.internal.httpclient.websocket.debug=true
  *      -Djdk.httpclient.sendBufferSize=8192
- *       PendingTextPongClose
+ *       ${test.main.class}
  */
 
 import java.net.http.WebSocket;
diff --git a/test/jdk/java/net/httpclient/websocket/SendTest.java b/test/jdk/java/net/httpclient/websocket/SendTest.java
index b3a433b5c29..124d15e1cc0 100644
--- a/test/jdk/java/net/httpclient/websocket/SendTest.java
+++ b/test/jdk/java/net/httpclient/websocket/SendTest.java
@@ -26,7 +26,7 @@
  * @build DummyWebSocketServer
  * @run junit/othervm
  *      -Djdk.internal.httpclient.websocket.debug=true
- *       SendTest
+ *       ${test.main.class}
  */
 
 import java.io.IOException;
diff --git a/test/jdk/java/net/httpclient/websocket/WSHandshakeExceptionTest.java b/test/jdk/java/net/httpclient/websocket/WSHandshakeExceptionTest.java
index f28d84b2f20..cf77c66e7c7 100644
--- a/test/jdk/java/net/httpclient/websocket/WSHandshakeExceptionTest.java
+++ b/test/jdk/java/net/httpclient/websocket/WSHandshakeExceptionTest.java
@@ -29,7 +29,7 @@
  * @build jdk.test.lib.net.SimpleSSLContext jdk.httpclient.test.lib.common.TestServerConfigurator
  * @modules java.net.http/jdk.internal.net.http.common
  *          jdk.httpserver
- * @run junit/othervm -Djdk.internal.httpclient.debug=true WSHandshakeExceptionTest
+ * @run junit/othervm -Djdk.internal.httpclient.debug=true ${test.main.class}
  */
 
 import com.sun.net.httpserver.HttpHandler;
diff --git a/test/jdk/java/net/httpclient/websocket/WebSocketBuilderTest.java b/test/jdk/java/net/httpclient/websocket/WebSocketBuilderTest.java
index beef8cb42a4..a5b5f73077c 100644
--- a/test/jdk/java/net/httpclient/websocket/WebSocketBuilderTest.java
+++ b/test/jdk/java/net/httpclient/websocket/WebSocketBuilderTest.java
@@ -26,7 +26,7 @@
  * @bug 8159053
  * @build DummyWebSocketServer
  *        Support
- * @run junit/othervm WebSocketBuilderTest
+ * @run junit/othervm ${test.main.class}
  */
 
 import java.net.URI;
diff --git a/test/jdk/java/net/httpclient/websocket/WebSocketEndiannessTest.java b/test/jdk/java/net/httpclient/websocket/WebSocketEndiannessTest.java
index 0d532669a10..dc28c5a33c2 100644
--- a/test/jdk/java/net/httpclient/websocket/WebSocketEndiannessTest.java
+++ b/test/jdk/java/net/httpclient/websocket/WebSocketEndiannessTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2025, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -29,7 +29,7 @@
  * @library /test/lib
  * @build DummyWebSocketServer
  *        jdk.test.lib.Asserts
- * @run main WebSocketEndiannessTest
+ * @run main ${test.main.class}
  */
 
 import jdk.internal.net.http.websocket.Frame;
diff --git a/test/jdk/java/net/httpclient/websocket/WebSocketExtendedTest.java b/test/jdk/java/net/httpclient/websocket/WebSocketExtendedTest.java
index 56474555235..e0096a55297 100644
--- a/test/jdk/java/net/httpclient/websocket/WebSocketExtendedTest.java
+++ b/test/jdk/java/net/httpclient/websocket/WebSocketExtendedTest.java
@@ -28,7 +28,7 @@
  *      -Djdk.internal.httpclient.websocket.debug=true
  *      -Djdk.internal.httpclient.debug=true
  *      -Djdk.httpclient.websocket.writeBufferSize=1024
- *      -Djdk.httpclient.websocket.intermediateBufferSize=2048 WebSocketExtendedTest
+ *      -Djdk.httpclient.websocket.intermediateBufferSize=2048 ${test.main.class}
  */
 
 import jdk.internal.net.http.websocket.Frame;
diff --git a/test/jdk/java/net/httpclient/websocket/WebSocketProxyTest.java b/test/jdk/java/net/httpclient/websocket/WebSocketProxyTest.java
index a410aa9fe75..d3aa4d96866 100644
--- a/test/jdk/java/net/httpclient/websocket/WebSocketProxyTest.java
+++ b/test/jdk/java/net/httpclient/websocket/WebSocketProxyTest.java
@@ -33,7 +33,7 @@
  *         -Djdk.internal.httpclient.websocket.debug=true
  *         -Djdk.httpclient.HttpClient.log=errors,requests,headers
  *         -Djdk.http.auth.tunneling.disabledSchemes=
- *         WebSocketProxyTest
+ *         ${test.main.class}
  */
 
 import java.io.IOException;
diff --git a/test/jdk/java/net/httpclient/websocket/WebSocketTest.java b/test/jdk/java/net/httpclient/websocket/WebSocketTest.java
index 2b1df3d7e87..4d395d9195e 100644
--- a/test/jdk/java/net/httpclient/websocket/WebSocketTest.java
+++ b/test/jdk/java/net/httpclient/websocket/WebSocketTest.java
@@ -28,7 +28,7 @@
  * @build DummyWebSocketServer
  *        java.net.http/jdk.internal.net.http.HttpClientTimerAccess
  * @run junit/othervm
- *       WebSocketTest
+ *       ${test.main.class}
  */
 
 
diff --git a/test/jdk/java/net/httpclient/websocket/security/WSSanityTest.java b/test/jdk/java/net/httpclient/websocket/security/WSSanityTest.java
index c8e4faa1ad3..7e9e296aa9d 100644
--- a/test/jdk/java/net/httpclient/websocket/security/WSSanityTest.java
+++ b/test/jdk/java/net/httpclient/websocket/security/WSSanityTest.java
@@ -25,7 +25,7 @@
  * @test
  * @summary Basic sanity checks for WebSocket URI from the Builder
  * @compile ../DummyWebSocketServer.java ../../ProxyServer.java
- * @run junit/othervm WSSanityTest
+ * @run junit/othervm ${test.main.class}
  */
 
 import java.io.IOException;
diff --git a/test/jdk/java/net/httpclient/whitebox/AltSvcFrameTest.java b/test/jdk/java/net/httpclient/whitebox/AltSvcFrameTest.java
index b9e5f2d58fe..e4c3aeffac3 100644
--- a/test/jdk/java/net/httpclient/whitebox/AltSvcFrameTest.java
+++ b/test/jdk/java/net/httpclient/whitebox/AltSvcFrameTest.java
@@ -89,7 +89,7 @@ import static org.junit.jupiter.api.Assertions.assertTrue;
  *                   -Djdk.httpclient.HttpClient.log=headers
  *                   -Djdk.internal.httpclient.disableHostnameVerification
  *                   -Djdk.internal.httpclient.debug=true
- *                    AltSvcFrameTest
+ *                    ${test.main.class}
  */
 
 public class AltSvcFrameTest {
diff --git a/test/jdk/java/net/httpclient/whitebox/AltSvcRegistryTest.java b/test/jdk/java/net/httpclient/whitebox/AltSvcRegistryTest.java
index 682082ba9f8..7e7b2ba6bf3 100644
--- a/test/jdk/java/net/httpclient/whitebox/AltSvcRegistryTest.java
+++ b/test/jdk/java/net/httpclient/whitebox/AltSvcRegistryTest.java
@@ -80,7 +80,7 @@ import org.junit.jupiter.api.Test;
  *                   -Djdk.httpclient.HttpClient.log=headers
  *                   -Djdk.internal.httpclient.disableHostnameVerification
  *                   -Djdk.internal.httpclient.debug=true
- *                    AltSvcRegistryTest
+ *                    ${test.main.class}
  */
 
 public class AltSvcRegistryTest implements HttpServerAdapters {

From 289f3e2f6236e7b80c16443d5c3547b3c28010fe Mon Sep 17 00:00:00 2001
From: Kieran Farrell <kfarrell@openjdk.org>
Date: Thu, 9 Apr 2026 11:06:58 +0000
Subject: [PATCH 535/655] 8381184: Code clean up: missing line break and print
 out duplication

Reviewed-by: dholmes, kevinw
---
 src/hotspot/os/linux/os_linux.cpp       | 2 --
 src/hotspot/share/utilities/vmError.cpp | 3 +--
 2 files changed, 1 insertion(+), 4 deletions(-)

diff --git a/src/hotspot/os/linux/os_linux.cpp b/src/hotspot/os/linux/os_linux.cpp
index bf096897aa7..a87c0ab33fa 100644
--- a/src/hotspot/os/linux/os_linux.cpp
+++ b/src/hotspot/os/linux/os_linux.cpp
@@ -2163,8 +2163,6 @@ void os::print_os_info(outputStream* st) {
 
   os::Posix::print_rlimit_info(st);
 
-  os::print_open_file_descriptors(st);
-
   os::Posix::print_load_average(st);
   st->cr();
 
diff --git a/src/hotspot/share/utilities/vmError.cpp b/src/hotspot/share/utilities/vmError.cpp
index d78fd331b56..1cecdc0cb33 100644
--- a/src/hotspot/share/utilities/vmError.cpp
+++ b/src/hotspot/share/utilities/vmError.cpp
@@ -1327,13 +1327,13 @@ void VMError::report(outputStream* st, bool _verbose) {
 
   STEP_IF("printing OS information", _verbose)
     os::print_os_info(st);
-    st->cr();
 #ifdef __APPLE__
     // Avoid large stack allocation on Mac for FD count during signal-handling.
     os::Bsd::print_open_file_descriptors(st, buf, sizeof(buf));
     st->cr();
 #else
     os::print_open_file_descriptors(st);
+    st->cr();
 #endif
 
   STEP_IF("printing CPU info", _verbose)
@@ -1553,7 +1553,6 @@ void VMError::print_vm_info(outputStream* st) {
   // STEP("printing OS information")
 
   os::print_os_info(st);
-  st->cr();
   os::print_open_file_descriptors(st);
   st->cr();
 

From 31b58871fc13739c91b1d648670e5303d67bd9b0 Mon Sep 17 00:00:00 2001
From: Daishi Tabata <dtabata@openjdk.org>
Date: Thu, 9 Apr 2026 13:43:48 +0000
Subject: [PATCH 536/655] 8381566: G1: Concurrent refinement pre-sweep time
 logged as incorrect negative value

Reviewed-by: tschatzl, ayang
---
 src/hotspot/share/gc/g1/g1ConcurrentRefine.cpp | 9 ++++++---
 1 file changed, 6 insertions(+), 3 deletions(-)

diff --git a/src/hotspot/share/gc/g1/g1ConcurrentRefine.cpp b/src/hotspot/share/gc/g1/g1ConcurrentRefine.cpp
index 8546e6e2d64..e12a8c284de 100644
--- a/src/hotspot/share/gc/g1/g1ConcurrentRefine.cpp
+++ b/src/hotspot/share/gc/g1/g1ConcurrentRefine.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2001, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2001, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -326,11 +326,14 @@ bool G1ConcurrentRefineSweepState::complete_work(bool concurrent, bool print_log
   if (print_log) {
     G1ConcurrentRefineStats* s = &_stats;
 
-    log_debug(gc, refine)("Refinement took %.2fms (pre-sweep %.2fms card refine %.2f) "
+    State state_bounded_by_sweeprt = (_state == State::SweepRT || _state == State::CompleteRefineWork)
+                                   ? State::SweepRT : _state;
+
+    log_debug(gc, refine)("Refinement took %.2fms (pre-sweep %.2fms card refine %.2fms) "
                           "(scanned %zu clean %zu (%.2f%%) not_clean %zu (%.2f%%) not_parsable %zu "
                           "refers_to_cset %zu (%.2f%%) still_refers_to_cset %zu (%.2f%%) no_cross_region %zu pending %zu)",
                           get_duration(State::Idle, _state).seconds() * 1000.0,
-                          get_duration(State::Idle, State::SweepRT).seconds() * 1000.0,
+                          get_duration(State::Idle, state_bounded_by_sweeprt).seconds() * 1000.0,
                           TimeHelper::counter_to_millis(s->refine_duration()),
                           s->cards_scanned(),
                           s->cards_clean(),

From 81cc497e6efb97c26dbccac63786864047e5c443 Mon Sep 17 00:00:00 2001
From: Ashutosh Mehra <asmehra@openjdk.org>
Date: Thu, 9 Apr 2026 13:51:18 +0000
Subject: [PATCH 537/655] 8381819: Test
 compiler/cpuflags/TestAESIntrinsicsOnUnsupportedConfig.java fails after
 JDK-8364584

Reviewed-by: kvn, mbaesken
---
 src/hotspot/cpu/x86/vm_version_x86.cpp        | 20 +++++++++----------
 .../share/runtime/abstract_vm_version.hpp     |  2 +-
 .../TestAESIntrinsicsOnSupportedConfig.java   |  1 -
 .../TestAESIntrinsicsOnUnsupportedConfig.java |  2 +-
 4 files changed, 12 insertions(+), 13 deletions(-)

diff --git a/src/hotspot/cpu/x86/vm_version_x86.cpp b/src/hotspot/cpu/x86/vm_version_x86.cpp
index d8f998520d1..39a9c618350 100644
--- a/src/hotspot/cpu/x86/vm_version_x86.cpp
+++ b/src/hotspot/cpu/x86/vm_version_x86.cpp
@@ -1207,16 +1207,7 @@ void VM_Version::get_processor_features() {
       }
     }
   } else {
-    if (!UseAES) {
-      if (UseAESIntrinsics && !FLAG_IS_DEFAULT(UseAESIntrinsics)) {
-        warning("AES intrinsics require UseAES flag to be enabled. Intrinsics will be disabled.");
-      }
-      FLAG_SET_DEFAULT(UseAESIntrinsics, false);
-      if (UseAESCTRIntrinsics && !FLAG_IS_DEFAULT(UseAESCTRIntrinsics)) {
-        warning("AES_CTR intrinsics require UseAES flag to be enabled. AES_CTR intrinsics will be disabled.");
-      }
-      FLAG_SET_DEFAULT(UseAESCTRIntrinsics, false);
-    } else if (!cpu_supports_aes()) {
+    if (!cpu_supports_aes()) {
       if (UseAESIntrinsics && !FLAG_IS_DEFAULT(UseAESIntrinsics)) {
         warning("AES intrinsics are not available on this CPU");
       }
@@ -1225,6 +1216,15 @@ void VM_Version::get_processor_features() {
         warning("AES-CTR intrinsics are not available on this CPU");
       }
       FLAG_SET_DEFAULT(UseAESCTRIntrinsics, false);
+    } else if (!UseAES) {
+      if (UseAESIntrinsics && !FLAG_IS_DEFAULT(UseAESIntrinsics)) {
+        warning("AES intrinsics require UseAES flag to be enabled. Intrinsics will be disabled.");
+      }
+      FLAG_SET_DEFAULT(UseAESIntrinsics, false);
+      if (UseAESCTRIntrinsics && !FLAG_IS_DEFAULT(UseAESCTRIntrinsics)) {
+        warning("AES_CTR intrinsics require UseAES flag to be enabled. AES_CTR intrinsics will be disabled.");
+      }
+      FLAG_SET_DEFAULT(UseAESCTRIntrinsics, false);
     }
   }
 
diff --git a/src/hotspot/share/runtime/abstract_vm_version.hpp b/src/hotspot/share/runtime/abstract_vm_version.hpp
index 61a8aa84080..794fa4dabcf 100644
--- a/src/hotspot/share/runtime/abstract_vm_version.hpp
+++ b/src/hotspot/share/runtime/abstract_vm_version.hpp
@@ -55,7 +55,7 @@ enum class vmIntrinsicID;
     } \
   } else if (Use##feature) { \
     if (!FLAG_IS_DEFAULT(Use##feature)) { \
-      warning(#feature " instructions not available on this CPU"); \
+      warning(#feature " instructions are not available on this CPU"); \
     } \
     FLAG_SET_DEFAULT(Use##feature, false); \
   }
diff --git a/test/hotspot/jtreg/compiler/cpuflags/TestAESIntrinsicsOnSupportedConfig.java b/test/hotspot/jtreg/compiler/cpuflags/TestAESIntrinsicsOnSupportedConfig.java
index 421307e85ca..b3aa0283fa5 100644
--- a/test/hotspot/jtreg/compiler/cpuflags/TestAESIntrinsicsOnSupportedConfig.java
+++ b/test/hotspot/jtreg/compiler/cpuflags/TestAESIntrinsicsOnSupportedConfig.java
@@ -26,7 +26,6 @@
  * @library /test/lib /
  * @modules java.base/jdk.internal.misc
  *          java.management
- * @requires (vm.cpu.features ~= ".*aes.*" | vm.cpu.features ~= ".*zvkn.*") & !vm.graal.enabled
  * @build jdk.test.whitebox.WhiteBox
  * @run driver jdk.test.lib.helpers.ClassFileInstaller jdk.test.whitebox.WhiteBox
  * @run main/othervm/timeout=600 -Xbootclasspath/a:.
diff --git a/test/hotspot/jtreg/compiler/cpuflags/TestAESIntrinsicsOnUnsupportedConfig.java b/test/hotspot/jtreg/compiler/cpuflags/TestAESIntrinsicsOnUnsupportedConfig.java
index 50677f5197e..7fc6d7f86c1 100644
--- a/test/hotspot/jtreg/compiler/cpuflags/TestAESIntrinsicsOnUnsupportedConfig.java
+++ b/test/hotspot/jtreg/compiler/cpuflags/TestAESIntrinsicsOnUnsupportedConfig.java
@@ -81,7 +81,7 @@ public class TestAESIntrinsicsOnUnsupportedConfig extends AESIntrinsicsBase {
 
     /**
      * Test checks following situation: <br/>
-     * UseAESIntrinsics flag is set to true, TestAESMain is executed <br/>
+     * UseAES flag is set to true, TestAESMain is executed <br/>
      * Expected result: UseAES flag is set to false <br/>
      * UseAES flag is set to false <br/>
      * Output shouldn't contain intrinsics usage <br/>

From 9df6054d432157284bc5f099a73be538aef61711 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Eirik=20Bj=C3=B8rsn=C3=B8s?= <eirbjo@openjdk.org>
Date: Thu, 9 Apr 2026 13:52:13 +0000
Subject: [PATCH 538/655] 8380450: (zipfs) ZipFileSystem::getPath and
 ZipPath::resolve throw unspecified IllegalArgumentException for unmappable
 names

Reviewed-by: lancea
---
 .../classes/jdk/nio/zipfs/ZipFileSystem.java  |   6 +-
 .../jdk/jdk/nio/zipfs/UnmappablePathName.java | 118 ++++++++++++++++++
 2 files changed, 123 insertions(+), 1 deletion(-)
 create mode 100644 test/jdk/jdk/nio/zipfs/UnmappablePathName.java

diff --git a/src/jdk.zipfs/share/classes/jdk/nio/zipfs/ZipFileSystem.java b/src/jdk.zipfs/share/classes/jdk/nio/zipfs/ZipFileSystem.java
index 3223ff9dccd..0280f7c33bb 100644
--- a/src/jdk.zipfs/share/classes/jdk/nio/zipfs/ZipFileSystem.java
+++ b/src/jdk.zipfs/share/classes/jdk/nio/zipfs/ZipFileSystem.java
@@ -1246,7 +1246,11 @@ class ZipFileSystem extends FileSystem {
     private LinkedHashMap<IndexNode, IndexNode> inodes;
 
     final byte[] getBytes(String name) {
-        return zc.getBytes(name);
+        try {
+            return zc.getBytes(name);
+        } catch (IllegalArgumentException e) {
+            throw new InvalidPathException(name, "unmappable character in path name");
+        }
     }
 
     final String getString(byte[] name) {
diff --git a/test/jdk/jdk/nio/zipfs/UnmappablePathName.java b/test/jdk/jdk/nio/zipfs/UnmappablePathName.java
new file mode 100644
index 00000000000..3fe915734eb
--- /dev/null
+++ b/test/jdk/jdk/nio/zipfs/UnmappablePathName.java
@@ -0,0 +1,118 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+import org.junit.jupiter.api.AfterEach;
+import org.junit.jupiter.api.Test;
+
+import java.io.IOException;
+import java.net.URI;
+import java.nio.charset.Charset;
+import java.nio.charset.StandardCharsets;
+import java.nio.file.*;
+import java.util.HashMap;
+import java.util.Map;
+
+import static org.junit.jupiter.api.Assertions.assertThrows;
+
+/* @test
+ * @bug 8380450
+ * @summary Unmappable characters in ZipFileSystem path names should be rejected with InvalidPathException
+ * @run junit ${test.main.class}
+ */
+public class UnmappablePathName {
+
+    // Charset used when creating the ZipFileSystem used in this test
+    static final Charset CHARSET = StandardCharsets.US_ASCII;
+    // 'ø' is an unmappable character in US_ASCII
+    static final String UNMAPPABLE = "\u00f8";
+    // ZIP file created in this test
+    static final Path ZIP = Paths.get("unmappable-path.zip");
+
+    /**
+     * Verify that calling ZipFileSystem.getPath with an unmappable path
+     * name is rejected with an InvalidPathException.
+     *
+     * @throws IOException if an unexpected IO error occurs
+     */
+    @Test
+    void unmappableGetPath() throws IOException {
+        try (FileSystem fs = createFileSystem(ZIP, CHARSET)) {
+            assertThrows(InvalidPathException.class, () -> fs.getPath(UNMAPPABLE));
+        }
+    }
+
+    /**
+     * Verify that calling ZipFileSystem.getPath with a partially unmappable path
+     * name is rejected with an InvalidPathException.
+     *
+     * @throws IOException if an unexpected IO error occurs
+     */
+    @Test
+    void unmappableGetPathPartial() throws IOException {
+        try (FileSystem fs = createFileSystem(ZIP, CHARSET)) {
+            assertThrows(InvalidPathException.class, () -> fs.getPath("mappable", UNMAPPABLE));
+        }
+    }
+
+    /**
+     * Verify that calling ZipPath::resolve with an unmappable path
+     * name is rejected with an InvalidPathException.
+     *
+     * @throws IOException if an unexpected IO error occurs
+     */
+    @Test
+    void unmappableResolve() throws IOException {
+        try (FileSystem fs = createFileSystem(ZIP, CHARSET)) {
+            Path path = fs.getPath("mappable");
+            assertThrows(InvalidPathException.class, () -> path.resolve(UNMAPPABLE));
+        }
+    }
+
+    /**
+     * Verify that calling ZipPath::resolve with a partially unmappable path
+     * name is rejected with an InvalidPathException.
+     *
+     * @throws IOException if an unexpected IO error occurs
+     */
+    @Test
+    void unmappableResolvePartial() throws IOException {
+        try (FileSystem fs = createFileSystem(ZIP, CHARSET)) {
+            Path path = fs.getPath("mappable");
+            assertThrows(InvalidPathException.class, () -> path.resolve("mappable", UNMAPPABLE));
+        }
+    }
+
+    @AfterEach
+    void cleanup() throws IOException {
+        Files.deleteIfExists(ZIP);
+    }
+
+    // Create a ZipFileSystem using the specified charset
+    private FileSystem createFileSystem(Path path, Charset charset) throws IOException {
+        URI uri = URI.create("jar:" + path.toUri());
+        Map<String, Object> env = new HashMap<String, Object>();
+        env.put("create", "true");
+        env.put("encoding", charset.name());
+        return FileSystems.newFileSystem(uri, env);
+    }
+}

From d471f474994b868bbfb2d18a10f6996c900a59bc Mon Sep 17 00:00:00 2001
From: Ashutosh Mehra <asmehra@openjdk.org>
Date: Thu, 9 Apr 2026 13:56:27 +0000
Subject: [PATCH 539/655] 8381807: AArch64:
 compiler/cpuflags/CPUFeaturesClearTest.java fails on SVE after JDK-8364584

Reviewed-by: kvn, haosun, adinn
---
 test/hotspot/jtreg/compiler/cpuflags/CPUFeaturesClearTest.java | 2 --
 1 file changed, 2 deletions(-)

diff --git a/test/hotspot/jtreg/compiler/cpuflags/CPUFeaturesClearTest.java b/test/hotspot/jtreg/compiler/cpuflags/CPUFeaturesClearTest.java
index a0fb3525381..19768a8dc17 100644
--- a/test/hotspot/jtreg/compiler/cpuflags/CPUFeaturesClearTest.java
+++ b/test/hotspot/jtreg/compiler/cpuflags/CPUFeaturesClearTest.java
@@ -123,12 +123,10 @@ public class CPUFeaturesClearTest {
         if (isCpuFeatureSupported("sve2")) {
             outputAnalyzer = ProcessTools.executeTestJava(generateArgs(prepareNumericFlag("UseSVE", 1)));
             outputAnalyzer.shouldNotMatch("[os,cpu] CPU: .* sve2.*");
-            verifyOutput(null, new String[]{"sve2"}, null, outputAnalyzer);
         }
         if (isCpuFeatureSupported("sve")) {
             outputAnalyzer = ProcessTools.executeTestJava(generateArgs(prepareNumericFlag("UseSVE", 0)));
             outputAnalyzer.shouldNotMatch("[os,cpu] CPU: .* sve.*");
-            verifyOutput(null, new String[]{"sve"}, null, outputAnalyzer);
         }
     }
 

From 9a1f7d4ae3eec63a0f156d9eaa922b590d6d6fb6 Mon Sep 17 00:00:00 2001
From: Chad Rakoczy <crakoczy@openjdk.org>
Date: Thu, 9 Apr 2026 16:06:38 +0000
Subject: [PATCH 540/655] 8326205: Grouping frequently called C2 nmethods in
 CodeCache

Co-authored-by: Evgeny Astigeevich <eastigeevich@openjdk.org>
Reviewed-by: kvn, cslucas, aph
---
 src/hotspot/share/code/codeBlob.hpp           |   7 +-
 src/hotspot/share/code/codeCache.cpp          |  95 +++++--
 src/hotspot/share/code/codeCache.hpp          |   8 +-
 src/hotspot/share/code/nmethod.cpp            |  13 +
 .../share/compiler/compilerDefinitions.cpp    |  32 ++-
 src/hotspot/share/logging/logTag.hpp          |   1 +
 src/hotspot/share/opto/c2_globals.hpp         |  38 +++
 src/hotspot/share/runtime/globals.hpp         |   4 +
 .../share/runtime/hotCodeCollector.cpp        | 258 ++++++++++++++++++
 .../share/runtime/hotCodeCollector.hpp        |  56 ++++
 src/hotspot/share/runtime/hotCodeSampler.cpp  | 121 ++++++++
 src/hotspot/share/runtime/hotCodeSampler.hpp  | 104 +++++++
 src/hotspot/share/runtime/threads.cpp         |   7 +
 .../MHIntrinsicAllocFailureTest.java          |  12 +-
 .../codecache/OverflowCodeCacheTest.java      |  52 +++-
 .../cli/TestSegmentedCodeCacheOption.java     |  56 +++-
 .../GenericCodeHeapSizeRunner.java            |  10 +-
 .../codeheapsize/TestCodeHeapSizeOptions.java |  16 +-
 .../cli/common/CodeCacheCLITestBase.java      |  10 +-
 .../cli/common/CodeCacheCLITestCase.java      |  58 +++-
 .../cli/common/CodeCacheOptions.java          |  34 ++-
 .../TestPrintCodeCacheOption.java             |  14 +-
 .../compiler/codecache/jmx/BeanTypeTest.java  |  22 +-
 .../jmx/CodeHeapBeanPresenceTest.java         |  22 +-
 .../compiler/codecache/jmx/GetUsageTest.java  |  24 +-
 .../codecache/jmx/InitialAndMaxUsageTest.java |  24 +-
 .../codecache/jmx/ManagerNamesTest.java       |  22 +-
 .../jmx/MemoryPoolsPresenceTest.java          |  22 +-
 .../compiler/codecache/jmx/PeakUsageTest.java |  23 +-
 .../codecache/jmx/PoolsIndependenceTest.java  |  22 +-
 .../jmx/ThresholdNotificationsTest.java       |  22 +-
 ...sageThresholdExceededSeveralTimesTest.java |  25 +-
 .../jmx/UsageThresholdExceededTest.java       |  29 +-
 .../jmx/UsageThresholdIncreasedTest.java      |  24 +-
 .../jmx/UsageThresholdNotExceededTest.java    |  25 +-
 .../stress/RandomAllocationTest.java          |  23 ++
 .../hotcode/HotCodeCollectorMoveFunction.java |  88 ++++++
 .../hotcode/StressHotCodeCollector.java       | 167 ++++++++++++
 .../jfr/event/compiler/TestCodeCacheFull.java |   6 +
 test/lib/jdk/test/whitebox/code/BlobType.java |  16 +-
 40 files changed, 1537 insertions(+), 75 deletions(-)
 create mode 100644 src/hotspot/share/runtime/hotCodeCollector.cpp
 create mode 100644 src/hotspot/share/runtime/hotCodeCollector.hpp
 create mode 100644 src/hotspot/share/runtime/hotCodeSampler.cpp
 create mode 100644 src/hotspot/share/runtime/hotCodeSampler.hpp
 create mode 100644 test/hotspot/jtreg/compiler/hotcode/HotCodeCollectorMoveFunction.java
 create mode 100644 test/hotspot/jtreg/compiler/hotcode/StressHotCodeCollector.java

diff --git a/src/hotspot/share/code/codeBlob.hpp b/src/hotspot/share/code/codeBlob.hpp
index 6a1686b80e2..1c6904e7446 100644
--- a/src/hotspot/share/code/codeBlob.hpp
+++ b/src/hotspot/share/code/codeBlob.hpp
@@ -45,9 +45,10 @@ class OopMapSet;
 enum class CodeBlobType {
   MethodNonProfiled   = 0,    // Execution level 1 and 4 (non-profiled) nmethods (including native nmethods)
   MethodProfiled      = 1,    // Execution level 2 and 3 (profiled) nmethods
-  NonNMethod          = 2,    // Non-nmethods like Buffers, Adapters and Runtime Stubs
-  All                 = 3,    // All types (No code cache segmentation)
-  NumTypes            = 4     // Number of CodeBlobTypes
+  MethodHot           = 2,    // Nmethods predicted to be always hot
+  NonNMethod          = 3,    // Non-nmethods like Buffers, Adapters and Runtime Stubs
+  All                 = 4,    // All types (No code cache segmentation)
+  NumTypes            = 5     // Number of CodeBlobTypes
 };
 
 // CodeBlob - superclass for all entries in the CodeCache.
diff --git a/src/hotspot/share/code/codeCache.cpp b/src/hotspot/share/code/codeCache.cpp
index 2a0256cc316..c0b4918102e 100644
--- a/src/hotspot/share/code/codeCache.cpp
+++ b/src/hotspot/share/code/codeCache.cpp
@@ -201,6 +201,7 @@ void CodeCache::initialize_heaps() {
   CodeHeapInfo non_nmethod = {NonNMethodCodeHeapSize, FLAG_IS_CMDLINE(NonNMethodCodeHeapSize), true};
   CodeHeapInfo profiled = {ProfiledCodeHeapSize, FLAG_IS_CMDLINE(ProfiledCodeHeapSize), true};
   CodeHeapInfo non_profiled = {NonProfiledCodeHeapSize, FLAG_IS_CMDLINE(NonProfiledCodeHeapSize), true};
+  CodeHeapInfo hot = {HotCodeHeapSize, FLAG_IS_CMDLINE(HotCodeHeapSize), true};
 
   const bool cache_size_set   = FLAG_IS_CMDLINE(ReservedCodeCacheSize);
   const size_t ps             = page_size(false, 8);
@@ -219,6 +220,12 @@ void CodeCache::initialize_heaps() {
     profiled.enabled = false;
   }
 
+  if (!heap_available(CodeBlobType::MethodHot)) {
+    hot.size = 0;
+    hot.set = true;
+    hot.enabled = false;
+  }
+
   assert(heap_available(CodeBlobType::MethodNonProfiled), "MethodNonProfiled heap is always available for segmented code heap");
 
   size_t compiler_buffer_size = 0;
@@ -238,14 +245,36 @@ void CodeCache::initialize_heaps() {
     set_size_of_unset_code_heap(&non_profiled, cache_size, non_nmethod.size + profiled.size, min_size);
   }
 
-  if (!profiled.set && non_profiled.set) {
-    set_size_of_unset_code_heap(&profiled, cache_size, non_nmethod.size + non_profiled.size, min_size);
+  if (!profiled.set && non_profiled.set && hot.set) {
+    set_size_of_unset_code_heap(&profiled, cache_size, non_nmethod.size + non_profiled.size + hot.size, min_size);
+  }
+
+  if (hot.enabled) {
+    if (!hot.set) {
+      assert(hot.size == 0, "must be calculated during heaps initialization");
+      // An application usually has ~20% hot code which is mostly non-profiled code.
+      // We set the hot code heap size to 20% of the non-profiled code heap.
+      hot.size = MAX2(non_profiled.size / 5, min_size);
+
+      if (non_profiled.set) {
+        err_msg msg("Must manually set HotCodeHeapSize when NonProfiledCodeHeapSize is set");
+        vm_exit_during_initialization("Invalid code heap sizes", msg);
+      }
+
+      non_profiled.size -= hot.size;
+    }
+
+    if (hot.size > non_profiled.size) {
+      err_msg msg("Hot (%zuK) exceeds NonProfiled (%zuK).",
+              hot.size / K, non_profiled.size / K);
+      vm_exit_during_initialization("Invalid code heap sizes", msg);
+    }
   }
 
   // Compatibility.
   size_t non_nmethod_min_size = min_cache_size + compiler_buffer_size;
-  if (!non_nmethod.set && profiled.set && non_profiled.set) {
-    set_size_of_unset_code_heap(&non_nmethod, cache_size, profiled.size + non_profiled.size, non_nmethod_min_size);
+  if (!non_nmethod.set && profiled.set && non_profiled.set && hot.set) {
+    set_size_of_unset_code_heap(&non_nmethod, cache_size, profiled.size + non_profiled.size + hot.size, non_nmethod_min_size);
   }
 
   // Note: if large page support is enabled, min_size is at least the large
@@ -253,8 +282,9 @@ void CodeCache::initialize_heaps() {
   non_nmethod.size = align_up(non_nmethod.size, min_size);
   profiled.size = align_up(profiled.size, min_size);
   non_profiled.size = align_up(non_profiled.size, min_size);
+  hot.size = align_up(hot.size, min_size);
 
-  size_t aligned_total = non_nmethod.size + profiled.size + non_profiled.size;
+  size_t aligned_total = non_nmethod.size + profiled.size + non_profiled.size + hot.size;
   if (!cache_size_set) {
     // If ReservedCodeCacheSize is explicitly set and exceeds CODE_CACHE_SIZE_LIMIT,
     // it is rejected by flag validation elsewhere. Here we only handle the case
@@ -262,15 +292,15 @@ void CodeCache::initialize_heaps() {
     // sizes (after alignment) exceed the platform limit.
     if (aligned_total > CODE_CACHE_SIZE_LIMIT) {
       err_msg message("ReservedCodeCacheSize (%zuK), Max (%zuK)."
-                      "Segments: NonNMethod (%zuK), NonProfiled (%zuK), Profiled (%zuK).",
+                      "Segments: NonNMethod (%zuK), NonProfiled (%zuK), Profiled (%zuK), Hot (%zuK).",
                       aligned_total/K, CODE_CACHE_SIZE_LIMIT/K,
-                      non_nmethod.size/K, non_profiled.size/K, profiled.size/K);
+                      non_nmethod.size/K, non_profiled.size/K, profiled.size/K, hot.size/K);
       vm_exit_during_initialization("Code cache size exceeds platform limit", message);
     }
     if (aligned_total != cache_size) {
       log_info(codecache)("ReservedCodeCache size %zuK changed to total segments size NonNMethod "
-                          "%zuK NonProfiled %zuK Profiled %zuK = %zuK",
-                          cache_size/K, non_nmethod.size/K, non_profiled.size/K, profiled.size/K, aligned_total/K);
+                          "%zuK NonProfiled %zuK Profiled %zuK Hot %zuK = %zuK",
+                          cache_size/K, non_nmethod.size/K, non_profiled.size/K, profiled.size/K, hot.size/K, aligned_total/K);
       // Adjust ReservedCodeCacheSize as necessary because it was not set explicitly
       cache_size = aligned_total;
     }
@@ -295,19 +325,23 @@ void CodeCache::initialize_heaps() {
         }
         if (profiled.enabled && !profiled.set && profiled.size > min_size) {
           profiled.size -= min_size;
+          if (--delta == 0) break;
+        }
+        if (hot.enabled && !hot.set && hot.size > min_size) {
+          hot.size -= min_size;
           delta--;
         }
         if (delta == start_delta) {
           break;
         }
       }
-      aligned_total = non_nmethod.size + profiled.size + non_profiled.size;
+      aligned_total = non_nmethod.size + profiled.size + non_profiled.size + hot.size;
     }
   }
 
   log_debug(codecache)("Initializing code heaps ReservedCodeCache %zuK NonNMethod %zuK"
-                       " NonProfiled %zuK Profiled %zuK",
-                       cache_size/K, non_nmethod.size/K, non_profiled.size/K, profiled.size/K);
+                       " NonProfiled %zuK Profiled %zuK Hot %zuK",
+                       cache_size/K, non_nmethod.size/K, non_profiled.size/K, profiled.size/K, hot.size/K);
 
   // Validation
   // Check minimal required sizes
@@ -318,6 +352,9 @@ void CodeCache::initialize_heaps() {
   if (non_profiled.enabled) { // non_profiled.enabled is always ON for segmented code heap, leave it checked for clarity
     check_min_size("non-profiled code heap", non_profiled.size, min_size);
   }
+  if (hot.enabled) {
+    check_min_size("hot code heap", hot.size, min_size);
+  }
 
   // ReservedCodeCacheSize was set explicitly, so report an error and abort if it doesn't match the segment sizes
   if (aligned_total != cache_size && cache_size_set) {
@@ -328,6 +365,9 @@ void CodeCache::initialize_heaps() {
     if (non_profiled.enabled) {
       message.append(" + NonProfiledCodeHeapSize (%zuK)", non_profiled.size/K);
     }
+    if (hot.enabled) {
+      message.append(" + HotCodeHeapSize (%zuK)", hot.size/K);
+    }
     message.append(" = %zuK", aligned_total/K);
     message.append((aligned_total > cache_size) ? " is greater than " : " is less than ");
     message.append("ReservedCodeCacheSize (%zuK).", cache_size/K);
@@ -348,6 +388,7 @@ void CodeCache::initialize_heaps() {
   FLAG_SET_ERGO(NonNMethodCodeHeapSize, non_nmethod.size);
   FLAG_SET_ERGO(ProfiledCodeHeapSize, profiled.size);
   FLAG_SET_ERGO(NonProfiledCodeHeapSize, non_profiled.size);
+  FLAG_SET_ERGO(HotCodeHeapSize, hot.size);
   FLAG_SET_ERGO(ReservedCodeCacheSize, cache_size);
 
   ReservedSpace rs = reserve_heap_memory(cache_size, ps);
@@ -368,6 +409,13 @@ void CodeCache::initialize_heaps() {
   // Non-nmethods (stubs, adapters, ...)
   add_heap(non_method_space, "CodeHeap 'non-nmethods'", CodeBlobType::NonNMethod);
 
+  if (hot.enabled) {
+    ReservedSpace hot_space = rs.partition(offset, hot.size);
+    offset += hot.size;
+    // Nmethods known to be always hot.
+    add_heap(hot_space, "CodeHeap 'hot nmethods'", CodeBlobType::MethodHot);
+  }
+
   if (non_profiled.enabled) {
     ReservedSpace non_profiled_space  = rs.partition(offset, non_profiled.size);
     // Tier 1 and tier 4 (non-profiled) methods and native methods
@@ -406,16 +454,25 @@ bool CodeCache::heap_available(CodeBlobType code_blob_type) {
     // Interpreter only: we don't need any method code heaps
     return (code_blob_type == CodeBlobType::NonNMethod);
   } else if (CompilerConfig::is_c1_profiling()) {
-    // Tiered compilation: use all code heaps
+    // Tiered compilation: use all code heaps including
+    // the hot code heap when it is present.
+
+    if (COMPILER2_PRESENT(!HotCodeHeap &&) (code_blob_type == CodeBlobType::MethodHot)) {
+      return false;
+    }
+
     return (code_blob_type < CodeBlobType::All);
   } else {
     // No TieredCompilation: we only need the non-nmethod and non-profiled code heap
+    // and the hot code heap if it is requested.
     return (code_blob_type == CodeBlobType::NonNMethod) ||
-           (code_blob_type == CodeBlobType::MethodNonProfiled);
+           (code_blob_type == CodeBlobType::MethodNonProfiled)
+           COMPILER2_PRESENT(|| ((code_blob_type == CodeBlobType::MethodHot) && HotCodeHeap));
   }
 }
 
-const char* CodeCache::get_code_heap_flag_name(CodeBlobType code_blob_type) {
+// Returns the name of the VM option to set the size of the corresponding CodeHeap
+static const char* get_code_heap_flag_name(CodeBlobType code_blob_type) {
   switch(code_blob_type) {
   case CodeBlobType::NonNMethod:
     return "NonNMethodCodeHeapSize";
@@ -426,6 +483,9 @@ const char* CodeCache::get_code_heap_flag_name(CodeBlobType code_blob_type) {
   case CodeBlobType::MethodProfiled:
     return "ProfiledCodeHeapSize";
     break;
+  case CodeBlobType::MethodHot:
+    return "HotCodeHeapSize";
+    break;
   default:
     ShouldNotReachHere();
     return nullptr;
@@ -542,7 +602,7 @@ CodeBlob* CodeCache::allocate(uint size, CodeBlobType code_blob_type, bool handl
 
   // Get CodeHeap for the given CodeBlobType
   CodeHeap* heap = get_code_heap(code_blob_type);
-  assert(heap != nullptr, "heap is null");
+  assert(heap != nullptr, "No heap for given code_blob_type (%d), heap is null", (int)code_blob_type);
 
   while (true) {
     cb = (CodeBlob*)heap->allocate(size);
@@ -570,6 +630,9 @@ CodeBlob* CodeCache::allocate(uint size, CodeBlobType code_blob_type, bool handl
             type = CodeBlobType::MethodNonProfiled;
           }
           break;
+        case CodeBlobType::MethodHot:
+          type = CodeBlobType::MethodNonProfiled;
+          break;
         default:
           break;
         }
diff --git a/src/hotspot/share/code/codeCache.hpp b/src/hotspot/share/code/codeCache.hpp
index 349cc652bf4..6384cb397b8 100644
--- a/src/hotspot/share/code/codeCache.hpp
+++ b/src/hotspot/share/code/codeCache.hpp
@@ -118,10 +118,6 @@ class CodeCache : AllStatic {
   // Creates a new heap with the given name and size, containing CodeBlobs of the given type
   static void add_heap(ReservedSpace rs, const char* name, CodeBlobType code_blob_type);
   static CodeHeap* get_code_heap_containing(void* p);         // Returns the CodeHeap containing the given pointer, or nullptr
-  static CodeHeap* get_code_heap(const void* cb);             // Returns the CodeHeap for the given CodeBlob
-  static CodeHeap* get_code_heap(CodeBlobType code_blob_type);         // Returns the CodeHeap for the given CodeBlobType
-  // Returns the name of the VM option to set the size of the corresponding CodeHeap
-  static const char* get_code_heap_flag_name(CodeBlobType code_blob_type);
   static ReservedSpace reserve_heap_memory(size_t size, size_t rs_ps); // Reserves one continuous chunk of memory for the CodeHeaps
 
   // Iteration
@@ -145,6 +141,8 @@ class CodeCache : AllStatic {
   static int code_heap_compare(CodeHeap* const &lhs, CodeHeap* const &rhs);
 
   static void add_heap(CodeHeap* heap);
+  static CodeHeap* get_code_heap(const void* cb);              // Returns the CodeHeap for the given CodeBlob
+  static CodeHeap* get_code_heap(CodeBlobType code_blob_type); // Returns the CodeHeap for the given CodeBlobType
   static const GrowableArray<CodeHeap*>* heaps() { return _heaps; }
   static const GrowableArray<CodeHeap*>* nmethod_heaps() { return _nmethod_heaps; }
 
@@ -264,7 +262,7 @@ class CodeCache : AllStatic {
   }
 
   static bool code_blob_type_accepts_nmethod(CodeBlobType type) {
-    return type == CodeBlobType::All || type <= CodeBlobType::MethodProfiled;
+    return type == CodeBlobType::All || type <= CodeBlobType::MethodHot;
   }
 
   static bool code_blob_type_accepts_allocable(CodeBlobType type) {
diff --git a/src/hotspot/share/code/nmethod.cpp b/src/hotspot/share/code/nmethod.cpp
index a302df418d7..815c0c7b4b0 100644
--- a/src/hotspot/share/code/nmethod.cpp
+++ b/src/hotspot/share/code/nmethod.cpp
@@ -66,6 +66,9 @@
 #include "runtime/flags/flagSetting.hpp"
 #include "runtime/frame.inline.hpp"
 #include "runtime/handles.inline.hpp"
+#ifdef COMPILER2
+#include "runtime/hotCodeCollector.hpp"
+#endif // COMPILER2
 #include "runtime/icache.hpp"
 #include "runtime/jniHandles.inline.hpp"
 #include "runtime/orderAccess.hpp"
@@ -1258,6 +1261,11 @@ void nmethod::post_init() {
   ICache::invalidate_range(code_begin(), code_size());
 
   Universe::heap()->register_nmethod(this);
+
+#ifdef COMPILER2
+  HotCodeCollector::register_nmethod(this);
+#endif // COMPILER2
+
   DEBUG_ONLY(Universe::heap()->verify_nmethod(this));
 
   CodeCache::commit(this);
@@ -2476,6 +2484,11 @@ void nmethod::purge(bool unregister_nmethod) {
   if (unregister_nmethod) {
     Universe::heap()->unregister_nmethod(this);
   }
+
+#ifdef COMPILER2
+  HotCodeCollector::unregister_nmethod(this);
+#endif // COMPILER2
+
   CodeCache::unregister_old_nmethod(this);
 
   JVMCI_ONLY( _metadata_size = 0; )
diff --git a/src/hotspot/share/compiler/compilerDefinitions.cpp b/src/hotspot/share/compiler/compilerDefinitions.cpp
index 0e4e211453b..cf7744cfe03 100644
--- a/src/hotspot/share/compiler/compilerDefinitions.cpp
+++ b/src/hotspot/share/compiler/compilerDefinitions.cpp
@@ -286,8 +286,38 @@ void CompilerConfig::set_compilation_policy_flags() {
     }
   }
 
+#ifdef COMPILER2
+  if (HotCodeHeap) {
+    if (FLAG_IS_DEFAULT(SegmentedCodeCache)) {
+      FLAG_SET_ERGO(SegmentedCodeCache, true);
+    } else if (!SegmentedCodeCache) {
+      vm_exit_during_initialization("HotCodeHeap requires SegmentedCodeCache enabled");
+    }
+
+    if (FLAG_IS_DEFAULT(NMethodRelocation)) {
+      FLAG_SET_ERGO(NMethodRelocation, true);
+    } else if (!NMethodRelocation) {
+      vm_exit_during_initialization("HotCodeHeap requires NMethodRelocation enabled");
+    }
+
+    if (!is_c2_enabled()) {
+      vm_exit_during_initialization("HotCodeHeap requires C2 enabled");
+    }
+
+    if (HotCodeMinSamplingMs > HotCodeMaxSamplingMs) {
+      vm_exit_during_initialization("HotCodeMinSamplingMs cannot be larger than HotCodeMaxSamplingMs");
+    }
+  } else if (HotCodeHeapSize > 0) {
+    vm_exit_during_initialization("HotCodeHeapSize requires HotCodeHeap enabled");
+  }
+#else
+  if (HotCodeHeapSize > 0) {
+    vm_exit_during_initialization("HotCodeHeapSize requires C2 present");
+  }
+#endif // COMPILER2
+
   if (CompileThresholdScaling < 0) {
-    vm_exit_during_initialization("Negative value specified for CompileThresholdScaling", nullptr);
+    vm_exit_during_initialization("Negative value specified for CompileThresholdScaling");
   }
 
   if (CompilationModeFlag::disable_intermediate()) {
diff --git a/src/hotspot/share/logging/logTag.hpp b/src/hotspot/share/logging/logTag.hpp
index 20d61b542b0..2b8d6a72be4 100644
--- a/src/hotspot/share/logging/logTag.hpp
+++ b/src/hotspot/share/logging/logTag.hpp
@@ -96,6 +96,7 @@ class outputStream;
   LOG_TAG(heap) \
   LOG_TAG(heapdump) \
   NOT_PRODUCT(LOG_TAG(heapsampling)) \
+  COMPILER2_PRESENT(LOG_TAG(hotcode)) \
   LOG_TAG(humongous) \
   LOG_TAG(ihop) \
   LOG_TAG(iklass) \
diff --git a/src/hotspot/share/opto/c2_globals.hpp b/src/hotspot/share/opto/c2_globals.hpp
index 983ac8a32c6..6974d50741e 100644
--- a/src/hotspot/share/opto/c2_globals.hpp
+++ b/src/hotspot/share/opto/c2_globals.hpp
@@ -914,6 +914,44 @@
                                                                             \
   develop(bool, StressCountedLoop, false,                                   \
           "Randomly delay conversion to counted loops")                     \
+                                                                            \
+  product(bool, HotCodeHeap, false, EXPERIMENTAL,                           \
+          "Enable the code heap for hot C2 nmethods")                       \
+                                                                            \
+  product(double, HotCodeSamplePercent, 80, EXPERIMENTAL,                   \
+          "Minimum percentage of profiling samples that must be in "        \
+          "the MethodHot heap before stopping hot code collection")         \
+          range(0, 100)                                                     \
+                                                                            \
+  product(double, HotCodeStablePercent, 5, EXPERIMENTAL,                    \
+          "Maximum percentage of newly compiled to total C2 nmethods "      \
+          "to treat nmethod count as stable. "                              \
+          "Values less than zero disable the stable check")                 \
+          range(-1, DBL_MAX)                                                \
+                                                                            \
+  product(uint, HotCodeIntervalSeconds, 300, EXPERIMENTAL,                  \
+          "Seconds between hot code grouping attempts")                     \
+          range(0, max_juint)                                               \
+                                                                            \
+  product(uint, HotCodeSampleSeconds, 120, EXPERIMENTAL,                    \
+          "Seconds to sample application threads per grouping attempt")     \
+          range(0, max_juint)                                               \
+                                                                            \
+  product(uint, HotCodeStartupDelaySeconds, 120, EXPERIMENTAL,              \
+          "Seconds to delay before starting hot code grouping thread")      \
+          range(0, max_juint)                                               \
+                                                                            \
+  product(uint, HotCodeMinSamplingMs, 5, EXPERIMENTAL,                      \
+          "Minimum sampling interval in milliseconds")                      \
+          range(0, max_juint)                                               \
+                                                                            \
+  product(uint, HotCodeMaxSamplingMs, 15, EXPERIMENTAL,                     \
+          "Maximum sampling interval in milliseconds")                      \
+          range(0, max_juint)                                               \
+                                                                            \
+  product(uint, HotCodeCallLevel, 1, EXPERIMENTAL,                          \
+          "Number of levels of callees to relocate per candidate")          \
+          range(0, max_juint)                                               \
 
 // end of C2_FLAGS
 
diff --git a/src/hotspot/share/runtime/globals.hpp b/src/hotspot/share/runtime/globals.hpp
index b5c19d8aa36..ac1ddec7cbc 100644
--- a/src/hotspot/share/runtime/globals.hpp
+++ b/src/hotspot/share/runtime/globals.hpp
@@ -1514,6 +1514,10 @@ const int ObjectAlignmentInBytes = 8;
           "Size of code heap with non-nmethods (in bytes)")                 \
           constraint(VMPageSizeConstraintFunc, AtParse)                     \
                                                                             \
+  product(size_t, HotCodeHeapSize, 0, EXPERIMENTAL,                         \
+          "Size of code heap with predicted hot methods (in bytes)")        \
+          range(0, SIZE_MAX)                                                \
+                                                                            \
   product_pd(size_t, CodeCacheExpansionSize,                                \
           "Code cache expansion size (in bytes)")                           \
           range(32*K, SIZE_MAX)                                             \
diff --git a/src/hotspot/share/runtime/hotCodeCollector.cpp b/src/hotspot/share/runtime/hotCodeCollector.cpp
new file mode 100644
index 00000000000..643cf3a8bbb
--- /dev/null
+++ b/src/hotspot/share/runtime/hotCodeCollector.cpp
@@ -0,0 +1,258 @@
+/*
+ * Copyright Amazon.com Inc. or its affiliates. All Rights Reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ *
+ */
+
+#ifdef COMPILER2
+
+#include "code/codeCache.hpp"
+#include "code/compiledIC.hpp"
+#include "compiler/compilerDefinitions.inline.hpp"
+#include "logging/log.hpp"
+#include "memory/resourceArea.hpp"
+#include "runtime/hotCodeCollector.hpp"
+#include "runtime/hotCodeSampler.hpp"
+#include "runtime/java.hpp"
+#include "runtime/javaThread.inline.hpp"
+
+// Initialize static variables
+bool      HotCodeCollector::_is_initialized = false;
+int       HotCodeCollector::_new_c2_nmethods_count = 0;
+int       HotCodeCollector::_total_c2_nmethods_count = 0;
+
+HotCodeCollector::HotCodeCollector() : JavaThread(thread_entry) {}
+
+void HotCodeCollector::initialize() {
+  EXCEPTION_MARK;
+
+  assert(HotCodeHeap, "HotCodeCollector requires HotCodeHeap enabled");
+  assert(CompilerConfig::is_c2_enabled(), "HotCodeCollector requires C2 enabled");
+  assert(NMethodRelocation, "HotCodeCollector requires NMethodRelocation enabled");
+  assert(HotCodeHeapSize > 0, "HotCodeHeapSize must be non-zero to use HotCodeCollector");
+  assert(CodeCache::get_code_heap(CodeBlobType::MethodHot) != nullptr, "MethodHot code heap not found");
+
+  Handle thread_oop = JavaThread::create_system_thread_object("HotCodeCollectorThread", CHECK);
+  HotCodeCollector* thread = new HotCodeCollector();
+  JavaThread::vm_exit_on_osthread_failure(thread);
+  JavaThread::start_internal_daemon(THREAD, thread, thread_oop, NormPriority);
+
+  _is_initialized = true;
+}
+
+bool HotCodeCollector::is_nmethod_count_stable() {
+  if (HotCodeStablePercent < 0) {
+    log_info(hotcode)("HotCodeStablePercent is less than zero, stable check disabled");
+    return true;
+  }
+
+  MutexLocker ml_CodeCache_lock(CodeCache_lock, Mutex::_no_safepoint_check_flag);
+
+  if (_total_c2_nmethods_count <= 0) {
+    log_info(hotcode)("No registered C2 nmethods");
+    return false;
+  }
+
+  const double percent_new = 100.0 * _new_c2_nmethods_count / _total_c2_nmethods_count;
+  bool is_stable_nmethod_count = percent_new <= HotCodeStablePercent;
+
+  log_info(hotcode)("C2 nmethod count %s", is_stable_nmethod_count ? "stable" : "not stable");
+  log_debug(hotcode)("C2 nmethod stats: New: %d, Total: %d, Percent new: %f", _new_c2_nmethods_count, _total_c2_nmethods_count, percent_new);
+
+  _new_c2_nmethods_count = 0;
+
+  return is_stable_nmethod_count;
+}
+
+void HotCodeCollector::thread_entry(JavaThread* thread, TRAPS) {
+  // Initial sleep to allow JVM to warm up
+  thread->sleep(HotCodeStartupDelaySeconds * 1000);
+
+  while (true) {
+    ResourceMark rm;
+
+    // Sample application and group hot nmethods if nmethod count is stable
+    if (is_nmethod_count_stable()) {
+      log_info(hotcode)("Sampling...");
+
+      ThreadSampler sampler;
+      uint64_t start_time = os::javaTimeMillis();
+      while (os::javaTimeMillis() - start_time <= HotCodeSampleSeconds * 1000) {
+        sampler.sample_all_java_threads();
+        thread->sleep(rand_sampling_period_ms());
+      }
+
+      Candidates candidates(sampler);
+      do_grouping(candidates);
+    }
+
+    thread->sleep(HotCodeIntervalSeconds * 1000);
+  }
+}
+
+void HotCodeCollector::do_grouping(Candidates& candidates) {
+  int num_relocated = 0;
+
+  // Sort nmethods by increasing sample count so pop() returns the hottest
+  candidates.sort();
+
+  while (candidates.has_candidates()) {
+
+    double percent_from_hot = candidates.get_hot_sample_percent();
+    log_debug(hotcode)("Percentage of samples from hot code heap: %f", percent_from_hot);
+    if (percent_from_hot >= HotCodeSamplePercent) {
+      log_info(hotcode)("Percentage of samples from hot nmethods over threshold. Done collecting hot code");
+      break;
+    }
+
+    nmethod* candidate = candidates.get_candidate();
+
+    MutexLocker ml_Compile_lock(Compile_lock);
+    MutexLocker ml_CompiledIC_lock(CompiledIC_lock, Mutex::_no_safepoint_check_flag);
+    MutexLocker ml_CodeCache_lock(CodeCache_lock, Mutex::_no_safepoint_check_flag);
+
+    num_relocated += do_relocation(candidate, 0);
+  }
+
+  log_info(hotcode)("Collection done. Relocated %d nmethods to the MethodHot heap", num_relocated);
+}
+
+int HotCodeCollector::do_relocation(void* candidate, uint call_level) {
+  if (candidate == nullptr) {
+    return 0;
+  }
+
+  // Verify that address still points to CodeBlob
+  CodeBlob* blob = CodeCache::find_blob(candidate);
+  if (blob == nullptr) {
+    return 0;
+  }
+
+  // Verify that blob is nmethod
+  nmethod* nm = blob->as_nmethod_or_null();
+  if (nm == nullptr || nm->method() == nullptr) {
+    return 0;
+  }
+
+  // The candidate may have been recompiled or already relocated.
+  // Retrieve the latest nmethod from the Method
+  nm = nm->method()->code();
+
+  // Verify the nmethod is still valid for relocation
+  if (nm == nullptr || !nm->is_in_use() || !nm->is_compiled_by_c2()) {
+    return 0;
+  }
+
+  // Verify code heap has space
+  if (CodeCache::get_code_heap(CodeBlobType::MethodHot)->unallocated_capacity() < (size_t)nm->size()) {
+    log_info(hotcode)("Not enough free space in MethodHot heap (%zd bytes) to relocate nm (%d bytes). Bailing out",
+      CodeCache::get_code_heap(CodeBlobType::MethodHot)->unallocated_capacity(), nm->size());
+    return 0;
+  }
+
+  // Number of nmethods relocated (candidate + callees)
+  int num_relocated = 0;
+
+  // Pointer to nmethod in hot heap
+  nmethod* hot_nm = nullptr;
+
+  if (CodeCache::get_code_blob_type(nm) != CodeBlobType::MethodHot) {
+    CompiledICLocker ic_locker(nm);
+    hot_nm = nm->relocate(CodeBlobType::MethodHot);
+
+    if (hot_nm != nullptr) {
+      // Successfully relocated nmethod. Update counts and proceed to callee relocation.
+      log_debug(hotcode)("Successful relocation: nmethod (%p), method (%s), call level (%d)", nm, hot_nm->method()->name_and_sig_as_C_string(), call_level);
+      num_relocated++;
+    } else {
+      // Relocation failed so return and do not attempt to relocate callees
+      log_debug(hotcode)("Failed relocation: nmethod (%p), call level (%d)", nm, call_level);
+      return 0;
+    }
+  } else {
+    // Skip relocation since already in hot heap, but still relocate callees
+    // since they may not have been compiled when this method was first relocated
+    log_debug(hotcode)("Already relocated: nmethod (%p), method (%s), call level (%d)", nm, nm->method()->name_and_sig_as_C_string(), call_level);
+    hot_nm = nm;
+  }
+
+  assert(hot_nm != nullptr, "unable to relocate callees");
+
+  if (call_level < HotCodeCallLevel) {
+    // Loop over relocations to relocate callees
+    RelocIterator relocIter(hot_nm);
+    while (relocIter.next()) {
+      // Check if this is a call
+      Relocation* reloc = relocIter.reloc();
+      if (!reloc->is_call()) {
+        continue;
+      }
+
+      // Find the call destination address
+      address dest = ((CallRelocation*) reloc)->destination();
+
+      // Recursively relocate callees
+      num_relocated += do_relocation(dest, call_level + 1);
+    }
+  }
+
+  return num_relocated;
+}
+
+void HotCodeCollector::unregister_nmethod(nmethod* nm) {
+  assert_lock_strong(CodeCache_lock);
+  if (!_is_initialized) {
+    return;
+  }
+
+  if (!nm->is_compiled_by_c2()) {
+    return;
+  }
+
+  if (CodeCache::get_code_blob_type(nm) == CodeBlobType::MethodHot) {
+    // Nmethods in the hot code heap do not count towards total C2 nmethods.
+    return;
+  }
+
+  // CodeCache_lock is held, so we can safely decrement the count.
+  _total_c2_nmethods_count--;
+}
+
+void HotCodeCollector::register_nmethod(nmethod* nm) {
+  assert_lock_strong(CodeCache_lock);
+  if (!_is_initialized) {
+    return;
+  }
+
+  if (!nm->is_compiled_by_c2()) {
+    return; // Only C2 nmethods are relocated to HotCodeHeap.
+  }
+
+  if (CodeCache::get_code_blob_type(nm) == CodeBlobType::MethodHot) {
+    // Nmethods in the hot code heap do not count towards total C2 nmethods.
+    return;
+  }
+
+  // CodeCache_lock is held, so we can safely increment the count.
+  _new_c2_nmethods_count++;
+  _total_c2_nmethods_count++;
+}
+#endif // COMPILER2
diff --git a/src/hotspot/share/runtime/hotCodeCollector.hpp b/src/hotspot/share/runtime/hotCodeCollector.hpp
new file mode 100644
index 00000000000..dbefa3dc788
--- /dev/null
+++ b/src/hotspot/share/runtime/hotCodeCollector.hpp
@@ -0,0 +1,56 @@
+/*
+ * Copyright Amazon.com Inc. or its affiliates. All Rights Reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ *
+ */
+
+#ifdef COMPILER2
+#ifndef SHARE_RUNTIME_HOTCODECOLLECTOR_HPP
+#define SHARE_RUNTIME_HOTCODECOLLECTOR_HPP
+
+#include "runtime/javaThread.hpp"
+
+class Candidates;
+
+class HotCodeCollector : public JavaThread {
+ private:
+  static bool _is_initialized;
+
+  static int _new_c2_nmethods_count;
+  static int _total_c2_nmethods_count;
+
+  HotCodeCollector();
+
+  static void do_grouping(Candidates& candidates);
+
+  static int do_relocation(void* candidate, uint call_level);
+
+ public:
+  static void initialize();
+  static void thread_entry(JavaThread* thread, TRAPS);
+  static void unregister_nmethod(nmethod* nm);
+  static void register_nmethod(nmethod* nm);
+
+  static bool is_nmethod_count_stable();
+};
+
+#endif // SHARE_RUNTIME_HOTCODECOLLECTOR_HPP
+#endif // COMPILER2
diff --git a/src/hotspot/share/runtime/hotCodeSampler.cpp b/src/hotspot/share/runtime/hotCodeSampler.cpp
new file mode 100644
index 00000000000..730a47d238a
--- /dev/null
+++ b/src/hotspot/share/runtime/hotCodeSampler.cpp
@@ -0,0 +1,121 @@
+/*
+ * Copyright Amazon.com Inc. or its affiliates. All Rights Reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ *
+ */
+
+#ifdef COMPILER2
+
+#include "code/codeCache.hpp"
+#include "logging/log.hpp"
+#include "runtime/hotCodeSampler.hpp"
+#include "runtime/javaThread.inline.hpp"
+
+void ThreadSampler::sample_all_java_threads() {
+  // Collect samples for each JavaThread
+  for (JavaThreadIteratorWithHandle jtiwh; JavaThread *jt = jtiwh.next(); ) {
+    if (jt->is_hidden_from_external_view() ||
+        jt->in_deopt_handler() ||
+        (jt->thread_state() != _thread_in_native && jt->thread_state() != _thread_in_Java)) {
+      continue;
+    }
+
+    GetPCTask task(jt);
+    task.run();
+    address pc = task.pc();
+    if (pc == nullptr) {
+      continue;
+    }
+
+    if (CodeCache::contains(pc)) {
+      nmethod* nm = CodeCache::find_blob(pc)->as_nmethod_or_null();
+      if (nm != nullptr) {
+        bool created = false;
+        int *count = _samples.put_if_absent(nm, 0, &created);
+        (*count)++;
+        if (created) {
+          _samples.maybe_grow();
+        }
+      }
+    }
+  }
+}
+
+Candidates::Candidates(ThreadSampler& sampler)
+  : _hot_sample_count(0), _non_profiled_sample_count(0) {
+  auto func = [&](nmethod* nm, int count) {
+    if (CodeCache::get_code_blob_type(nm) == CodeBlobType::MethodNonProfiled) {
+      _candidates.append(Pair<nmethod*, int>(nm, count));
+      add_non_profiled_sample_count(count);
+    } else if (CodeCache::get_code_blob_type(nm) == CodeBlobType::MethodHot) {
+      add_hot_sample_count(count);
+    }
+  };
+  sampler.iterate_samples(func);
+
+  log_info(hotcode)("Generated candidate list from %d samples corresponding to %d nmethods", _non_profiled_sample_count + _hot_sample_count, _candidates.length());
+}
+
+void Candidates::add_candidate(nmethod* nm, int count) {
+  _candidates.append(Pair<nmethod*, int>(nm, count));
+}
+
+void Candidates::add_hot_sample_count(int count) {
+  _hot_sample_count += count;
+}
+
+void Candidates::add_non_profiled_sample_count(int count) {
+  _non_profiled_sample_count += count;
+}
+
+void Candidates::sort() {
+  _candidates.sort(
+    [](Pair<nmethod*, int>* a, Pair<nmethod*, int>* b) {
+      if (a->second > b->second) return 1;
+      if (a->second < b->second) return -1;
+      return 0;
+    }
+  );
+}
+
+bool Candidates::has_candidates() {
+  return !_candidates.is_empty();
+}
+
+nmethod* Candidates::get_candidate() {
+  assert(has_candidates(), "must not be empty");
+  Pair<nmethod*, int> candidate = _candidates.pop();
+
+  _hot_sample_count += candidate.second;
+  _non_profiled_sample_count -= candidate.second;
+
+  return candidate.first;
+}
+
+double Candidates::get_hot_sample_percent() {
+  if (_hot_sample_count + _non_profiled_sample_count == 0) {
+    return 0;
+  }
+
+  return 100.0 * _hot_sample_count / (_hot_sample_count + _non_profiled_sample_count);
+}
+
+#endif // COMPILER2
diff --git a/src/hotspot/share/runtime/hotCodeSampler.hpp b/src/hotspot/share/runtime/hotCodeSampler.hpp
new file mode 100644
index 00000000000..d61cac791e1
--- /dev/null
+++ b/src/hotspot/share/runtime/hotCodeSampler.hpp
@@ -0,0 +1,104 @@
+/*
+ * Copyright Amazon.com Inc. or its affiliates. All Rights Reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ *
+ */
+
+#ifdef COMPILER2
+#ifndef SHARE_RUNTIME_HOTCODESAMPLER_HPP
+#define SHARE_RUNTIME_HOTCODESAMPLER_HPP
+
+#include "runtime/javaThread.hpp"
+#include "runtime/suspendedThreadTask.hpp"
+#include "runtime/threadSMR.hpp"
+#include "utilities/pair.hpp"
+#include "utilities/resizableHashTable.hpp"
+
+// Generate a random sampling period between min and max
+static inline uint rand_sampling_period_ms() {
+  assert(HotCodeMaxSamplingMs >= HotCodeMinSamplingMs, "max cannot be smaller than min");
+  julong range = (julong)HotCodeMaxSamplingMs - (julong)HotCodeMinSamplingMs + 1;
+  return (uint)(os::random() % range) + HotCodeMinSamplingMs;
+}
+
+class ThreadSampler;
+
+class Candidates : public StackObj {
+ private:
+  GrowableArray<Pair<nmethod*, int>> _candidates;
+  int _hot_sample_count;
+  int _non_profiled_sample_count;
+
+ public:
+  Candidates(ThreadSampler& sampler);
+
+  void add_candidate(nmethod* nm, int count);
+  void add_hot_sample_count(int count);
+  void add_non_profiled_sample_count(int count);
+  void sort();
+
+  bool has_candidates();
+  nmethod* get_candidate();
+  double get_hot_sample_percent();
+};
+
+class GetPCTask : public SuspendedThreadTask {
+ private:
+  address _pc;
+
+  void do_task(const SuspendedThreadTaskContext& context) override {
+    JavaThread* jt = JavaThread::cast(context.thread());
+    if (jt->thread_state() != _thread_in_native && jt->thread_state() != _thread_in_Java) {
+      return;
+    }
+    _pc = os::fetch_frame_from_context(context.ucontext(), nullptr, nullptr);
+  }
+
+ public:
+  GetPCTask(JavaThread* thread) : SuspendedThreadTask(thread), _pc(nullptr) {}
+
+  address pc() const {
+    return _pc;
+  }
+};
+
+class ThreadSampler : public StackObj {
+ private:
+  static const int INITIAL_TABLE_SIZE = 109;
+
+  // Table of nmethods found during profiling with sample count
+  ResizeableHashTable<nmethod*, int, AnyObj::C_HEAP, mtInternal> _samples;
+
+ public:
+  ThreadSampler() : _samples(INITIAL_TABLE_SIZE, HotCodeSampleSeconds * 1000 / HotCodeMaxSamplingMs) {}
+
+  // Iterate over and sample all Java threads
+  void sample_all_java_threads();
+
+  // Iterate over all samples with a callback function
+  template<typename Function>
+  void iterate_samples(Function func) {
+    _samples.iterate_all(func);
+  }
+};
+
+#endif // SHARE_RUNTIME_HOTCODESAMPLER_HPP
+#endif // COMPILER2
diff --git a/src/hotspot/share/runtime/threads.cpp b/src/hotspot/share/runtime/threads.cpp
index 442b68e596a..b83389a1929 100644
--- a/src/hotspot/share/runtime/threads.cpp
+++ b/src/hotspot/share/runtime/threads.cpp
@@ -113,6 +113,7 @@
 #endif
 #ifdef COMPILER2
 #include "opto/idealGraphPrinter.hpp"
+#include "runtime/hotCodeCollector.hpp"
 #endif
 #if INCLUDE_JFR
 #include "jfr/jfr.hpp"
@@ -798,6 +799,12 @@ jint Threads::create_vm(JavaVMInitArgs* args, bool* canTryAgain) {
     StringDedup::start();
   }
 
+#ifdef COMPILER2
+  if (HotCodeHeap) {
+    HotCodeCollector::initialize();
+  }
+#endif // COMPILER2
+
   // Pre-initialize some JSR292 core classes to avoid deadlock during class loading.
   // It is done after compilers are initialized, because otherwise compilations of
   // signature polymorphic MH intrinsics can be missed
diff --git a/test/hotspot/jtreg/compiler/codecache/MHIntrinsicAllocFailureTest.java b/test/hotspot/jtreg/compiler/codecache/MHIntrinsicAllocFailureTest.java
index 1cbaaf0f52d..c1638a27fd7 100644
--- a/test/hotspot/jtreg/compiler/codecache/MHIntrinsicAllocFailureTest.java
+++ b/test/hotspot/jtreg/compiler/codecache/MHIntrinsicAllocFailureTest.java
@@ -1,6 +1,6 @@
 /*
- * Copyright (c) 2022, Oracle and/or its affiliates. All rights reserved.
- * Copyright (c) 2022 SAP SE. All rights reserved.ights reserved.
+ * Copyright (c) 2022, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2022, 2025 SAP SE. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -28,6 +28,7 @@
  * @requires vm.compMode == "Xmixed"
  * @requires vm.opt.TieredCompilation == null | vm.opt.TieredCompilation == true
  * @requires vm.opt.TieredStopAtLevel == null | vm.opt.TieredStopAtLevel == 4
+ * @requires vm.compiler2.enabled
  * @summary test allocation failure of method handle intrinsic in profiled/non-profiled space
  * @library /test/lib
  * @modules java.base/jdk.internal.misc
@@ -39,6 +40,11 @@
  *                   -XX:+WhiteBoxAPI -XX:CompileCommand=compileonly,null::*
  *                   -XX:ReservedCodeCacheSize=16m -XX:+SegmentedCodeCache
  *                   compiler.codecache.MHIntrinsicAllocFailureTest
+ * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions
+ *                   -XX:+WhiteBoxAPI -XX:CompileCommand=compileonly,null::*
+ *                   -XX:ReservedCodeCacheSize=20m -XX:+SegmentedCodeCache
+ *                   -XX:+TieredCompilation -XX:+UnlockExperimentalVMOptions -XX:+HotCodeHeap -XX:HotCodeHeapSize=4M
+ *                   compiler.codecache.MHIntrinsicAllocFailureTest
  */
 
 package compiler.codecache;
@@ -73,7 +79,7 @@ public class MHIntrinsicAllocFailureTest {
         // JIT compilers should be off, now.
         Asserts.assertNotEquals(WHITE_BOX.getCompilationActivityMode(), 1);
         System.out.println("Code cache segments for non-profiled and profiled nmethods are full.");
-        // Generate and use a MH itrinsic. Should not trigger one of the following:
+        // Generate and use a MH intrinsic. Should not trigger one of the following:
         // - VirtualMachineError: Out of space in CodeCache for method handle intrinsic
         // - InternalError: java.lang.NoSuchMethodException: no such method:
         //   java.lang.invoke.MethodHandle.linkToStatic(int,int,Object,MemberName)int/invokeStatic
diff --git a/test/hotspot/jtreg/compiler/codecache/OverflowCodeCacheTest.java b/test/hotspot/jtreg/compiler/codecache/OverflowCodeCacheTest.java
index cf993237a32..e0a45e4cba6 100644
--- a/test/hotspot/jtreg/compiler/codecache/OverflowCodeCacheTest.java
+++ b/test/hotspot/jtreg/compiler/codecache/OverflowCodeCacheTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2014, 2022, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2014, 2025, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -44,6 +44,27 @@
  *                   compiler.codecache.OverflowCodeCacheTest
  */
 
+/*
+ * @test OverflowCodeCacheTest
+ * @bug 8059550 8279356 8326205
+ * @requires vm.compiler2.enabled
+ * @summary testing of code cache segments overflow
+ * @library /test/lib
+ * @modules java.base/jdk.internal.misc
+ *          java.management
+ *
+ * @build jdk.test.whitebox.WhiteBox
+ * @run driver jdk.test.lib.helpers.ClassFileInstaller jdk.test.whitebox.WhiteBox
+ * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions
+ *                   -XX:+WhiteBoxAPI -XX:+TieredCompilation -XX:+UnlockExperimentalVMOptions -XX:+HotCodeHeap -XX:HotCodeHeapSize=8M
+ *                   -Xmixed -XX:TieredStopAtLevel=4
+ *                   compiler.codecache.OverflowCodeCacheTest
+ * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions
+ *                   -XX:+WhiteBoxAPI -XX:-TieredCompilation -XX:+UnlockExperimentalVMOptions -XX:+HotCodeHeap -XX:HotCodeHeapSize=8M
+ *                   -Xmixed -XX:TieredStopAtLevel=4
+ *                   compiler.codecache.OverflowCodeCacheTest
+ */
+
 package compiler.codecache;
 
 import jdk.test.lib.Asserts;
@@ -85,6 +106,7 @@ public class OverflowCodeCacheTest {
         System.out.println("allocating till possible...");
         ArrayList<Long> blobs = new ArrayList<>();
         int compilationActivityMode = -1;
+        CodeCacheConstraints constraints = getCodeCacheConstraints(type);
         // Lock compilation to be able to better control code cache space
         WHITE_BOX.lockCompilation();
         try {
@@ -115,6 +137,7 @@ public class OverflowCodeCacheTest {
             } catch (VirtualMachineError e) {
                 // Expected
             }
+            constraints.check();
             // Free code cache space
             for (Long blob : blobs) {
                 WHITE_BOX.freeCodeBlob(blob);
@@ -143,4 +166,31 @@ public class OverflowCodeCacheTest {
         return bean.getUsage().getMax();
     }
 
+    class CodeCacheConstraints {
+        void check() {}
+    }
+
+    CodeCacheConstraints getCodeCacheConstraints(final BlobType type) {
+        if (Long.valueOf(0).equals(WHITE_BOX.getVMFlag("HotCodeHeapSize"))) {
+            return new CodeCacheConstraints();
+        } else if (BlobType.MethodHot == type) {
+            // NonProfiledHeap is used when HotCodeHeap runs out of space.
+            return new CodeCacheConstraints() {
+                final int nonProfiledCount = WHITE_BOX.getCodeHeapEntries(BlobType.MethodNonProfiled.id).length;
+                @Override
+                void check() {
+                    Asserts.assertLT(nonProfiledCount, WHITE_BOX.getCodeHeapEntries(BlobType.MethodNonProfiled.id).length);
+                }
+            };
+        } else {
+            // HotCodeHeap should not be used when other heap runs out of space.
+            return new CodeCacheConstraints() {
+                final int hotCount = WHITE_BOX.getCodeHeapEntries(BlobType.MethodHot.id).length;
+                @Override
+                void check() {
+                    Asserts.assertEQ(hotCount, WHITE_BOX.getCodeHeapEntries(BlobType.MethodHot.id).length);
+                }
+            };
+        }
+    }
 }
diff --git a/test/hotspot/jtreg/compiler/codecache/cli/TestSegmentedCodeCacheOption.java b/test/hotspot/jtreg/compiler/codecache/cli/TestSegmentedCodeCacheOption.java
index a5068b47454..e54fad3517e 100644
--- a/test/hotspot/jtreg/compiler/codecache/cli/TestSegmentedCodeCacheOption.java
+++ b/test/hotspot/jtreg/compiler/codecache/cli/TestSegmentedCodeCacheOption.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2014, 2022, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2014, 2025, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -50,10 +50,16 @@ public class TestSegmentedCodeCacheOption {
     private static final String USE_SEGMENTED_CODE_CACHE
             = CommandLineOptionTest.prepareBooleanFlag(SEGMENTED_CODE_CACHE,
                     true);
+    private static final String UNLOCK_EXPERIMENTAL_VM_OPTIONS
+            = CommandLineOptionTest.prepareBooleanFlag("UnlockExperimentalVMOptions", true);
+    private static final String HOT_CODE_HEAP
+            = CommandLineOptionTest.prepareBooleanFlag("HotCodeHeap", true);
     private static final long THRESHOLD_CC_SIZE_VALUE
             = CodeCacheOptions.mB(240);
     private static final long BELOW_THRESHOLD_CC_SIZE
             = THRESHOLD_CC_SIZE_VALUE - CodeCacheOptions.mB(1);
+    private static final long HOT_CODE_HEAP_SIZE
+            = CodeCacheOptions.mB(8);
     private static final String[] UNEXPECTED_MESSAGES = new String[] {
             ".*" + SEGMENTED_CODE_CACHE + ".*"
     };
@@ -104,7 +110,7 @@ public class TestSegmentedCodeCacheOption {
             public void run() throws Throwable {
                 // SCC is disabled w/o TieredCompilation by default
                 String errorMessage = SEGMENTED_CODE_CACHE
-                        + " should be disabled by default  when tiered "
+                        + " should be disabled by default when tiered "
                         + "compilation is disabled";
 
                 CommandLineOptionTest.verifyOptionValueForSameVM(
@@ -162,6 +168,52 @@ public class TestSegmentedCodeCacheOption {
                         CommandLineOptionTest.prepareBooleanFlag(
                                 TIERED_COMPILATION, true));
             }
+        },
+        OPTION_VALUES_HOT {
+            @Override
+            public boolean isApplicable() {
+                return Platform.isServer();
+            }
+
+            @Override
+            public void run() throws Throwable {
+                // SCC is enabled w hot code heap w/o TieredCompilation
+                String errorMessage = SEGMENTED_CODE_CACHE
+                        + " should be enabled when the hot code heap "
+                        + "is enabled";
+
+                CommandLineOptionTest.verifyOptionValueForSameVM(
+                        SEGMENTED_CODE_CACHE, "true", errorMessage,
+                        UNLOCK_EXPERIMENTAL_VM_OPTIONS,
+                        HOT_CODE_HEAP,
+                        CommandLineOptionTest.prepareNumericFlag(
+                                BlobType.MethodHot.sizeOptionName,
+                                HOT_CODE_HEAP_SIZE),
+                        CommandLineOptionTest.prepareBooleanFlag(
+                                TIERED_COMPILATION, false));
+
+                // Hot code heap could be explicitly enabled w/ SegmentedCodeCache
+                // and w/ ReservedCodeCacheSize value below the threshold
+                errorMessage = String.format("It should be possible to explicitly "
+                                + "enable %s and %s with %s below threshold %d.",
+                        BlobType.MethodHot.sizeOptionName,
+                        SEGMENTED_CODE_CACHE,
+                        BlobType.All.sizeOptionName,
+                        THRESHOLD_CC_SIZE_VALUE);
+
+                CommandLineOptionTest.verifyOptionValueForSameVM(
+                        BlobType.MethodHot.sizeOptionName, String.valueOf(HOT_CODE_HEAP_SIZE),
+                        errorMessage,
+                        UNLOCK_EXPERIMENTAL_VM_OPTIONS,
+                        HOT_CODE_HEAP,
+                        CommandLineOptionTest.prepareNumericFlag(
+                                BlobType.All.sizeOptionName,
+                                BELOW_THRESHOLD_CC_SIZE),
+                        CommandLineOptionTest.prepareNumericFlag(
+                                BlobType.MethodHot.sizeOptionName,
+                                HOT_CODE_HEAP_SIZE),
+                        USE_SEGMENTED_CODE_CACHE);
+            }
         };
 
         TestCase() {
diff --git a/test/hotspot/jtreg/compiler/codecache/cli/codeheapsize/GenericCodeHeapSizeRunner.java b/test/hotspot/jtreg/compiler/codecache/cli/codeheapsize/GenericCodeHeapSizeRunner.java
index e7c68e71ab3..aa7e9e67f37 100644
--- a/test/hotspot/jtreg/compiler/codecache/cli/codeheapsize/GenericCodeHeapSizeRunner.java
+++ b/test/hotspot/jtreg/compiler/codecache/cli/codeheapsize/GenericCodeHeapSizeRunner.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2014, 2022, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2014, 2025, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -69,5 +69,13 @@ public class GenericCodeHeapSizeRunner implements CodeCacheCLITestCase.Runner {
                         BlobType.MethodProfiled.sizeOptionName,
                         expectedValues.profiled),
                 testCaseDescription.getTestOptions(options));
+
+        CommandLineOptionTest.verifyOptionValueForSameVM(
+                BlobType.MethodHot.sizeOptionName,
+                Long.toString(expectedValues.hot),
+                String.format("%s should have value %d.",
+                        BlobType.MethodHot.sizeOptionName,
+                        expectedValues.hot),
+                testCaseDescription.getTestOptions(options));
     }
 }
diff --git a/test/hotspot/jtreg/compiler/codecache/cli/codeheapsize/TestCodeHeapSizeOptions.java b/test/hotspot/jtreg/compiler/codecache/cli/codeheapsize/TestCodeHeapSizeOptions.java
index 4d52f470645..b5ae98bc79f 100644
--- a/test/hotspot/jtreg/compiler/codecache/cli/codeheapsize/TestCodeHeapSizeOptions.java
+++ b/test/hotspot/jtreg/compiler/codecache/cli/codeheapsize/TestCodeHeapSizeOptions.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2014, 2022, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2014, 2025, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -48,13 +48,15 @@ import java.util.EnumSet;
 public class TestCodeHeapSizeOptions extends CodeCacheCLITestBase {
     private static final CodeCacheCLITestCase JVM_STARTUP
             = new CodeCacheCLITestCase(new CodeCacheCLITestCase.Description(
-                            options -> options.segmented,
+                            options -> options.segmented
+                                    && options.hot == 0,
                             EnumSet.noneOf(BlobType.class)),
                     new JVMStartupRunner());
 
     private static final CodeCacheCLITestCase CODE_CACHE_FREE_SPACE
             = new CodeCacheCLITestCase(new CodeCacheCLITestCase.Description(
                             options -> options.segmented
+                                    && options.hot == 0
                                     && Platform.isDebugBuild(),
                             EnumSet.noneOf(BlobType.class)),
                     new CodeCacheFreeSpaceRunner());
@@ -65,13 +67,19 @@ public class TestCodeHeapSizeOptions extends CodeCacheCLITestBase {
     private TestCodeHeapSizeOptions() {
         super(CodeCacheCLITestBase.OPTIONS_SET,
                 new CodeCacheCLITestCase(CodeCacheCLITestCase
-                        .CommonDescriptions.NON_TIERED.description,
+                        .CommonDescriptions.NON_TIERED_WO_HOT.description,
                         GENERIC_RUNNER),
                 new CodeCacheCLITestCase(CodeCacheCLITestCase
                         .CommonDescriptions.TIERED_LEVEL_1.description,
                         GENERIC_RUNNER),
                 new CodeCacheCLITestCase(CodeCacheCLITestCase
-                        .CommonDescriptions.TIERED_LEVEL_4.description,
+                        .CommonDescriptions.TIERED_LEVEL_4_WO_HOT.description,
+                        GENERIC_RUNNER),
+                new CodeCacheCLITestCase(CodeCacheCLITestCase
+                        .CommonDescriptions.NON_TIERED_W_HOT.description,
+                        GENERIC_RUNNER),
+                new CodeCacheCLITestCase(CodeCacheCLITestCase
+                        .CommonDescriptions.TIERED_LEVEL_4_W_HOT.description,
                         GENERIC_RUNNER),
                 JVM_STARTUP,
                 CODE_CACHE_FREE_SPACE);
diff --git a/test/hotspot/jtreg/compiler/codecache/cli/common/CodeCacheCLITestBase.java b/test/hotspot/jtreg/compiler/codecache/cli/common/CodeCacheCLITestBase.java
index f1f18956f05..12a1a0c42cd 100644
--- a/test/hotspot/jtreg/compiler/codecache/cli/common/CodeCacheCLITestBase.java
+++ b/test/hotspot/jtreg/compiler/codecache/cli/common/CodeCacheCLITestBase.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2014, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2014, 2025, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -40,7 +40,13 @@ public class CodeCacheCLITestBase {
                     CodeCacheOptions.mB(100)),
             new CodeCacheOptions(CodeCacheOptions.mB(60)),
             new CodeCacheOptions(CodeCacheOptions.mB(200)),
-            new CodeCacheOptions(CodeCacheOptions.mB(300))
+            new CodeCacheOptions(CodeCacheOptions.mB(300)),
+            new CodeCacheOptions(CodeCacheOptions.mB(250),
+                    CodeCacheOptions.mB(50), CodeCacheOptions.mB(75),
+                    CodeCacheOptions.mB(75), CodeCacheOptions.mB(50)),
+            new CodeCacheOptions(CodeCacheOptions.mB(200),
+                    CodeCacheOptions.mB(50), CodeCacheOptions.mB(100),
+                    CodeCacheOptions.mB(0),  CodeCacheOptions.mB(50))
     };
 
     private final CodeCacheCLITestCase[] testCases;
diff --git a/test/hotspot/jtreg/compiler/codecache/cli/common/CodeCacheCLITestCase.java b/test/hotspot/jtreg/compiler/codecache/cli/common/CodeCacheCLITestCase.java
index eca5c70e091..0f5af1c0a93 100644
--- a/test/hotspot/jtreg/compiler/codecache/cli/common/CodeCacheCLITestCase.java
+++ b/test/hotspot/jtreg/compiler/codecache/cli/common/CodeCacheCLITestCase.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2014, 2022, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2014, 2025, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -39,15 +39,24 @@ import java.util.function.Function;
  * description.
  */
 public class CodeCacheCLITestCase {
-    private static final Function<CodeCacheOptions, Boolean> ONLY_SEGMENTED
-            = options -> options.segmented;
-    private static final Function<CodeCacheOptions, Boolean> SEGMENTED_SERVER
-            = ONLY_SEGMENTED.andThen(isSegmented -> isSegmented
+    private static final Function<CodeCacheOptions, Boolean> SEGMENTED_WO_HOT
+            = options -> options.segmented && options.hot == 0;
+    private static final Function<CodeCacheOptions, Boolean> SEGMENTED_SERVER_WO_HOT
+            = SEGMENTED_WO_HOT.andThen(isSegmented -> isSegmented
                     && Platform.isServer() && Platform.isTieredSupported());
+    private static final Function<CodeCacheOptions, Boolean> SEGMENTED_W_HOT
+            = options -> options.segmented && options.hot > 0
+                    && options.profiled > 0 && Platform.isTieredSupported();
+    private static final Function<CodeCacheOptions, Boolean> SEGMENTED_W_HOT_WO_PROFILED
+            = options -> options.segmented && options.hot > 0
+                    && options.profiled == 0 && Platform.isTieredSupported();
+
     private static final String USE_INT_MODE = "-Xint";
     private static final String SEGMENTED_CODE_CACHE = "SegmentedCodeCache";
     private static final String TIERED_COMPILATION = "TieredCompilation";
     private static final String TIERED_STOP_AT = "TieredStopAtLevel";
+    private static final String UNLOCK_EXPERIMENTAL_VM_OPTIONS = "UnlockExperimentalVMOptions";
+    private static final String HOT_CODE_HEAP = "HotCodeHeap";
 
     private final Description description;
     private final Runner runner;
@@ -68,7 +77,7 @@ public class CodeCacheCLITestCase {
          * Verifies that in interpreted mode PrintCodeCache output contains
          * the whole code cache. Int mode disables SegmentedCodeCache with a warning.
          */
-        INT_MODE(ONLY_SEGMENTED, EnumSet.of(BlobType.All), USE_INT_MODE),
+        INT_MODE(options -> options.hot == 0, EnumSet.of(BlobType.All), USE_INT_MODE),
         /**
          * Verifies that with disabled SegmentedCodeCache PrintCodeCache output
          * contains only CodeCache's entry.
@@ -81,7 +90,7 @@ public class CodeCacheCLITestCase {
          * code cache PrintCodeCache output does not contain information about
          * profiled-nmethods heap and non-segmented CodeCache.
          */
-        NON_TIERED(ONLY_SEGMENTED,
+        NON_TIERED_WO_HOT(SEGMENTED_WO_HOT,
                 EnumSet.of(BlobType.NonNMethod, BlobType.MethodNonProfiled),
                 CommandLineOptionTest.prepareBooleanFlag(TIERED_COMPILATION,
                         false)),
@@ -90,7 +99,7 @@ public class CodeCacheCLITestCase {
          * warn about SegmentedCodeCache and contain information about all
          * heaps only.
          */
-        TIERED_LEVEL_0(SEGMENTED_SERVER,
+        TIERED_LEVEL_0(SEGMENTED_SERVER_WO_HOT,
                 EnumSet.of(BlobType.All),
                 CommandLineOptionTest.prepareBooleanFlag(TIERED_COMPILATION,
                         true),
@@ -100,19 +109,44 @@ public class CodeCacheCLITestCase {
          * contain information about non-nmethods and non-profiled nmethods
          * heaps only.
          */
-        TIERED_LEVEL_1(SEGMENTED_SERVER,
+        TIERED_LEVEL_1(SEGMENTED_SERVER_WO_HOT,
                 EnumSet.of(BlobType.NonNMethod, BlobType.MethodNonProfiled),
                 CommandLineOptionTest.prepareBooleanFlag(TIERED_COMPILATION,
                         true),
                 CommandLineOptionTest.prepareNumericFlag(TIERED_STOP_AT, 1)),
         /**
          * Verifies that with TieredStopAtLevel=4 PrintCodeCache output will
-         * contain information about all three code heaps.
+         * contain information about non-nmethods, non-profiled nmethods
+         * and profiled nmethods heaps only.
          */
-        TIERED_LEVEL_4(SEGMENTED_SERVER,
-                EnumSet.complementOf(EnumSet.of(BlobType.All)),
+        TIERED_LEVEL_4_WO_HOT(SEGMENTED_SERVER_WO_HOT,
+                EnumSet.complementOf(EnumSet.of(BlobType.MethodHot, BlobType.All)),
                 CommandLineOptionTest.prepareBooleanFlag(TIERED_COMPILATION,
                         true),
+                CommandLineOptionTest.prepareNumericFlag(TIERED_STOP_AT, 4)),
+
+        /**
+         * Verifies that with disabled tiered compilation and enabled hot code
+         * cache PrintCodeCache output does not contain information about
+         * profiled-nmethods heap and non-segmented CodeCache.
+         */
+        NON_TIERED_W_HOT(SEGMENTED_W_HOT_WO_PROFILED,
+                EnumSet.of(BlobType.NonNMethod, BlobType.MethodNonProfiled, BlobType.MethodHot),
+                CommandLineOptionTest.prepareBooleanFlag(UNLOCK_EXPERIMENTAL_VM_OPTIONS, true),
+                CommandLineOptionTest.prepareBooleanFlag(HOT_CODE_HEAP, true),
+                CommandLineOptionTest.prepareBooleanFlag(TIERED_COMPILATION,
+                        false)),
+
+        /**
+         * Verifies that with TieredStopAtLevel=4 and hot code heap
+         * PrintCodeCache output will contain information about non-nmethods,
+         * non-profiled nmethods, profiled nmethods, and hot code heaps only.
+         */
+        TIERED_LEVEL_4_W_HOT(SEGMENTED_W_HOT,
+                EnumSet.complementOf(EnumSet.of(BlobType.All)),
+                CommandLineOptionTest.prepareBooleanFlag(UNLOCK_EXPERIMENTAL_VM_OPTIONS, true),
+                CommandLineOptionTest.prepareBooleanFlag(HOT_CODE_HEAP, true),
+                CommandLineOptionTest.prepareBooleanFlag(TIERED_COMPILATION, true),
                 CommandLineOptionTest.prepareNumericFlag(TIERED_STOP_AT, 4));
 
         CommonDescriptions(Function<CodeCacheOptions, Boolean> predicate,
diff --git a/test/hotspot/jtreg/compiler/codecache/cli/common/CodeCacheOptions.java b/test/hotspot/jtreg/compiler/codecache/cli/common/CodeCacheOptions.java
index f5243aaa493..b8e386f4f7d 100644
--- a/test/hotspot/jtreg/compiler/codecache/cli/common/CodeCacheOptions.java
+++ b/test/hotspot/jtreg/compiler/codecache/cli/common/CodeCacheOptions.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2014, 2022, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2014, 2025, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -37,15 +37,20 @@ public class CodeCacheOptions {
             = EnumSet.of(BlobType.All);
     private static final EnumSet<BlobType> ALL_SEGMENTED_HEAPS
             = EnumSet.complementOf(NON_SEGMENTED_HEAPS);
-    private static final EnumSet<BlobType> SEGMENTED_HEAPS_WO_PROFILED
+    private static final EnumSet<BlobType> NON_NMETHOD_AND_NON_PROFILED_HEAPS
             = EnumSet.of(BlobType.NonNMethod, BlobType.MethodNonProfiled);
+    private static final EnumSet<BlobType> SEGMENTED_HEAPS_WO_HOT
+            = EnumSet.of(BlobType.NonNMethod, BlobType.MethodProfiled, BlobType.MethodNonProfiled);
     private static final EnumSet<BlobType> ONLY_NON_METHODS_HEAP
             = EnumSet.of(BlobType.NonNMethod);
+    private static final EnumSet<BlobType> NON_NMETHOD_AND_NON_PROFILED_AND_HOT_HEAPS
+            = EnumSet.of(BlobType.NonNMethod, BlobType.MethodNonProfiled, BlobType.MethodHot);
 
     public final long reserved;
     public final long nonNmethods;
     public final long nonProfiled;
     public final long profiled;
+    public final long hot;
     public final boolean segmented;
 
     public static long mB(long val) {
@@ -61,6 +66,7 @@ public class CodeCacheOptions {
         this.nonNmethods = 0;
         this.nonProfiled = 0;
         this.profiled = 0;
+        this.hot = 0;
         this.segmented = false;
     }
 
@@ -70,6 +76,17 @@ public class CodeCacheOptions {
         this.nonNmethods = nonNmethods;
         this.nonProfiled = nonProfiled;
         this.profiled = profiled;
+        this.hot = 0;
+        this.segmented = true;
+    }
+
+    public CodeCacheOptions(long reserved, long nonNmethods, long nonProfiled,
+            long profiled, long hot) {
+        this.reserved = reserved;
+        this.nonNmethods = nonNmethods;
+        this.nonProfiled = nonProfiled;
+        this.profiled = profiled;
+        this.hot = hot;
         this.segmented = true;
     }
 
@@ -83,6 +100,8 @@ public class CodeCacheOptions {
                 return this.nonProfiled;
             case MethodProfiled:
                 return this.profiled;
+            case MethodHot:
+                return this.hot;
             default:
                 throw new Error("Unknown heap: " + heap.name());
         }
@@ -106,6 +125,11 @@ public class CodeCacheOptions {
                             nonProfiled),
                     CommandLineOptionTest.prepareNumericFlag(
                             BlobType.MethodProfiled.sizeOptionName, profiled));
+            if (hot > 0) {
+                Collections.addAll(options,
+                        CommandLineOptionTest.prepareNumericFlag(
+                                BlobType.MethodHot.sizeOptionName, hot));
+            }
         }
         return options.toArray(new String[options.size()]);
     }
@@ -113,9 +137,11 @@ public class CodeCacheOptions {
     public CodeCacheOptions mapOptions(EnumSet<BlobType> involvedCodeHeaps) {
         if (involvedCodeHeaps.isEmpty()
                 || involvedCodeHeaps.equals(NON_SEGMENTED_HEAPS)
-                || involvedCodeHeaps.equals(ALL_SEGMENTED_HEAPS)) {
+                || involvedCodeHeaps.equals(SEGMENTED_HEAPS_WO_HOT)
+                || involvedCodeHeaps.equals(ALL_SEGMENTED_HEAPS)
+                || involvedCodeHeaps.equals(NON_NMETHOD_AND_NON_PROFILED_AND_HOT_HEAPS)) {
             return this;
-        } else if (involvedCodeHeaps.equals(SEGMENTED_HEAPS_WO_PROFILED)) {
+        } else if (involvedCodeHeaps.equals(NON_NMETHOD_AND_NON_PROFILED_HEAPS)) {
             return new CodeCacheOptions(reserved, nonNmethods,
                     profiled + nonProfiled, 0L);
         } else if (involvedCodeHeaps.equals(ONLY_NON_METHODS_HEAP)) {
diff --git a/test/hotspot/jtreg/compiler/codecache/cli/printcodecache/TestPrintCodeCacheOption.java b/test/hotspot/jtreg/compiler/codecache/cli/printcodecache/TestPrintCodeCacheOption.java
index c0d826e59ec..2e994336f54 100644
--- a/test/hotspot/jtreg/compiler/codecache/cli/printcodecache/TestPrintCodeCacheOption.java
+++ b/test/hotspot/jtreg/compiler/codecache/cli/printcodecache/TestPrintCodeCacheOption.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2014, 2022, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2014, 2025, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -46,7 +46,7 @@ import java.util.EnumSet;
 public class TestPrintCodeCacheOption extends CodeCacheCLITestBase {
     private static final CodeCacheCLITestCase DISABLED_PRINT_CODE_CACHE
             = new CodeCacheCLITestCase(new CodeCacheCLITestCase.Description(
-                            options -> true, EnumSet.noneOf(BlobType.class)),
+                            options -> options.hot == 0, EnumSet.noneOf(BlobType.class)),
                     new PrintCodeCacheRunner(false));
 
     private static final CodeCacheCLITestCase.Runner DEFAULT_RUNNER
@@ -61,7 +61,7 @@ public class TestPrintCodeCacheOption extends CodeCacheCLITestBase {
                         .CommonDescriptions.NON_SEGMENTED.description,
                         DEFAULT_RUNNER),
                 new CodeCacheCLITestCase(CodeCacheCLITestCase
-                        .CommonDescriptions.NON_TIERED.description,
+                        .CommonDescriptions.NON_TIERED_WO_HOT.description,
                         DEFAULT_RUNNER),
                 new CodeCacheCLITestCase(CodeCacheCLITestCase
                         .CommonDescriptions.TIERED_LEVEL_0.description,
@@ -70,7 +70,13 @@ public class TestPrintCodeCacheOption extends CodeCacheCLITestBase {
                         .CommonDescriptions.TIERED_LEVEL_1.description,
                         DEFAULT_RUNNER),
                 new CodeCacheCLITestCase(CodeCacheCLITestCase
-                        .CommonDescriptions.TIERED_LEVEL_4.description,
+                        .CommonDescriptions.TIERED_LEVEL_4_WO_HOT.description,
+                        DEFAULT_RUNNER),
+                new CodeCacheCLITestCase(CodeCacheCLITestCase
+                        .CommonDescriptions.NON_TIERED_W_HOT.description,
+                        DEFAULT_RUNNER),
+                new CodeCacheCLITestCase(CodeCacheCLITestCase
+                        .CommonDescriptions.TIERED_LEVEL_4_W_HOT.description,
                         DEFAULT_RUNNER),
                 DISABLED_PRINT_CODE_CACHE);
     }
diff --git a/test/hotspot/jtreg/compiler/codecache/jmx/BeanTypeTest.java b/test/hotspot/jtreg/compiler/codecache/jmx/BeanTypeTest.java
index 5bc10071b4d..c669a7ece7d 100644
--- a/test/hotspot/jtreg/compiler/codecache/jmx/BeanTypeTest.java
+++ b/test/hotspot/jtreg/compiler/codecache/jmx/BeanTypeTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2014, 2022, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2014, 2025, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -40,6 +40,26 @@
  *     compiler.codecache.jmx.BeanTypeTest
  */
 
+/**
+ * @test BeanTypeTest
+ * @requires vm.compiler2.enabled
+ * @summary verify types of code cache memory pool bean
+ * @modules java.base/jdk.internal.misc
+ *          java.management
+ * @library /test/lib
+ *
+ * @build jdk.test.whitebox.WhiteBox
+ * @run driver jdk.test.lib.helpers.ClassFileInstaller jdk.test.whitebox.WhiteBox
+ * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions
+ *     -XX:+WhiteBoxAPI
+ *     -XX:+UnlockExperimentalVMOptions -XX:+HotCodeHeap -XX:HotCodeHeapSize=8M -XX:+TieredCompilation -XX:TieredStopAtLevel=4
+ *     compiler.codecache.jmx.BeanTypeTest
+ * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions
+ *     -XX:+WhiteBoxAPI
+ *     -XX:+UnlockExperimentalVMOptions -XX:+HotCodeHeap -XX:HotCodeHeapSize=8M -XX:-TieredCompilation -XX:TieredStopAtLevel=4
+ *     compiler.codecache.jmx.BeanTypeTest
+ */
+
 package compiler.codecache.jmx;
 
 import jdk.test.lib.Asserts;
diff --git a/test/hotspot/jtreg/compiler/codecache/jmx/CodeHeapBeanPresenceTest.java b/test/hotspot/jtreg/compiler/codecache/jmx/CodeHeapBeanPresenceTest.java
index d379296d561..462d03ddcdf 100644
--- a/test/hotspot/jtreg/compiler/codecache/jmx/CodeHeapBeanPresenceTest.java
+++ b/test/hotspot/jtreg/compiler/codecache/jmx/CodeHeapBeanPresenceTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2014, 2022, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2014, 2025, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -40,6 +40,26 @@
  *     compiler.codecache.jmx.CodeHeapBeanPresenceTest
  */
 
+/**
+ * @test CodeHeapBeanPresenceTest
+ * @requires vm.compiler2.enabled
+ * @summary verify CodeHeap bean presence
+ * @modules java.base/jdk.internal.misc
+ *          java.management
+ * @library /test/lib
+ *
+ * @build jdk.test.whitebox.WhiteBox
+ * @run driver jdk.test.lib.helpers.ClassFileInstaller jdk.test.whitebox.WhiteBox
+ * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions
+ *     -XX:+WhiteBoxAPI
+ *     -XX:+UnlockExperimentalVMOptions -XX:+HotCodeHeap -XX:HotCodeHeapSize=8M -XX:+TieredCompilation -XX:TieredStopAtLevel=4
+ *     compiler.codecache.jmx.CodeHeapBeanPresenceTest
+ * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions
+ *     -XX:+WhiteBoxAPI
+ *     -XX:+UnlockExperimentalVMOptions -XX:+HotCodeHeap -XX:HotCodeHeapSize=8M -XX:-TieredCompilation -XX:TieredStopAtLevel=4
+ *     compiler.codecache.jmx.CodeHeapBeanPresenceTest
+ */
+
 package compiler.codecache.jmx;
 
 import jdk.test.lib.Asserts;
diff --git a/test/hotspot/jtreg/compiler/codecache/jmx/GetUsageTest.java b/test/hotspot/jtreg/compiler/codecache/jmx/GetUsageTest.java
index 873b0494424..704236a3a85 100644
--- a/test/hotspot/jtreg/compiler/codecache/jmx/GetUsageTest.java
+++ b/test/hotspot/jtreg/compiler/codecache/jmx/GetUsageTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2014, 2022, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2014, 2025, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -42,6 +42,28 @@
  *     compiler.codecache.jmx.GetUsageTest
  */
 
+/*
+ * @test GetUsageTest
+ * @requires vm.compiler2.enabled
+ * @summary testing of getUsage() for segmented code cache
+ * @modules java.base/jdk.internal.misc
+ *          java.management
+ * @library /test/lib /
+ *
+ * @build jdk.test.whitebox.WhiteBox
+ * @run driver jdk.test.lib.helpers.ClassFileInstaller jdk.test.whitebox.WhiteBox
+ * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions
+ *     -XX:+WhiteBoxAPI -XX:CompileCommand=compileonly,null::*
+ *     -XX:-UseCodeCacheFlushing -XX:-MethodFlushing
+ *     -XX:+UnlockExperimentalVMOptions -XX:+HotCodeHeap -XX:HotCodeHeapSize=8M -XX:+TieredCompilation -XX:TieredStopAtLevel=4
+ *     compiler.codecache.jmx.GetUsageTest
+ * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions
+ *     -XX:+WhiteBoxAPI -XX:CompileCommand=compileonly,null::*
+ *     -XX:-UseCodeCacheFlushing -XX:-MethodFlushing
+ *     -XX:+UnlockExperimentalVMOptions -XX:+HotCodeHeap -XX:HotCodeHeapSize=8M -XX:-TieredCompilation -XX:TieredStopAtLevel=4
+ *     compiler.codecache.jmx.GetUsageTest
+ */
+
 package compiler.codecache.jmx;
 
 import jdk.test.lib.Asserts;
diff --git a/test/hotspot/jtreg/compiler/codecache/jmx/InitialAndMaxUsageTest.java b/test/hotspot/jtreg/compiler/codecache/jmx/InitialAndMaxUsageTest.java
index a2343c23694..ad12a828fef 100644
--- a/test/hotspot/jtreg/compiler/codecache/jmx/InitialAndMaxUsageTest.java
+++ b/test/hotspot/jtreg/compiler/codecache/jmx/InitialAndMaxUsageTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2014, 2022, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2014, 2025, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -42,6 +42,28 @@
  *     compiler.codecache.jmx.InitialAndMaxUsageTest
  */
 
+/*
+ * @test InitialAndMaxUsageTest
+ * @requires vm.compiler2.enabled
+ * @summary testing of initial and max usage
+ * @modules java.base/jdk.internal.misc
+ *          java.management
+ * @library /test/lib /
+ *
+ * @build jdk.test.whitebox.WhiteBox
+ * @run driver jdk.test.lib.helpers.ClassFileInstaller jdk.test.whitebox.WhiteBox
+ * @run main/othervm -Xbootclasspath/a:. -XX:-UseCodeCacheFlushing
+ *     -XX:-MethodFlushing -XX:+UnlockDiagnosticVMOptions -XX:+WhiteBoxAPI
+ *     -XX:CompileCommand=compileonly,null::* -XX:-UseLargePages
+ *     -XX:+UnlockExperimentalVMOptions -XX:+HotCodeHeap -XX:HotCodeHeapSize=8M -XX:+TieredCompilation -XX:TieredStopAtLevel=4
+ *     compiler.codecache.jmx.InitialAndMaxUsageTest
+ * @run main/othervm -Xbootclasspath/a:. -XX:-UseCodeCacheFlushing
+ *     -XX:-MethodFlushing -XX:+UnlockDiagnosticVMOptions -XX:+WhiteBoxAPI
+ *     -XX:CompileCommand=compileonly,null::* -XX:-UseLargePages
+ *     -XX:+UnlockExperimentalVMOptions -XX:+HotCodeHeap -XX:HotCodeHeapSize=8M -XX:-TieredCompilation -XX:TieredStopAtLevel=4
+ *     compiler.codecache.jmx.InitialAndMaxUsageTest
+ */
+
 package compiler.codecache.jmx;
 
 import jdk.test.lib.Asserts;
diff --git a/test/hotspot/jtreg/compiler/codecache/jmx/ManagerNamesTest.java b/test/hotspot/jtreg/compiler/codecache/jmx/ManagerNamesTest.java
index b482cd4e559..f04cd695f4f 100644
--- a/test/hotspot/jtreg/compiler/codecache/jmx/ManagerNamesTest.java
+++ b/test/hotspot/jtreg/compiler/codecache/jmx/ManagerNamesTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2014, 2022, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2014, 2025, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -40,6 +40,26 @@
  *     compiler.codecache.jmx.ManagerNamesTest
  */
 
+/**
+ * @test ManagerNamesTest
+ * @requires vm.compiler2.enabled
+ * @summary verify getMemoryManageNames calls in case of segmented code cache
+ * @modules java.base/jdk.internal.misc
+ *          java.management
+ * @library /test/lib
+ *
+ * @build jdk.test.whitebox.WhiteBox
+ * @run driver jdk.test.lib.helpers.ClassFileInstaller jdk.test.whitebox.WhiteBox
+ * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions
+ *     -XX:+WhiteBoxAPI
+ *     -XX:+UnlockExperimentalVMOptions -XX:+HotCodeHeap -XX:HotCodeHeapSize=8M -XX:+TieredCompilation -XX:TieredStopAtLevel=4
+ *     compiler.codecache.jmx.ManagerNamesTest
+ * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions
+ *     -XX:+WhiteBoxAPI
+ *     -XX:+UnlockExperimentalVMOptions -XX:+HotCodeHeap -XX:HotCodeHeapSize=8M -XX:-TieredCompilation -XX:TieredStopAtLevel=4
+ *     compiler.codecache.jmx.ManagerNamesTest
+ */
+
 package compiler.codecache.jmx;
 
 import jdk.test.lib.Asserts;
diff --git a/test/hotspot/jtreg/compiler/codecache/jmx/MemoryPoolsPresenceTest.java b/test/hotspot/jtreg/compiler/codecache/jmx/MemoryPoolsPresenceTest.java
index b91b7fa228d..83215bce8ad 100644
--- a/test/hotspot/jtreg/compiler/codecache/jmx/MemoryPoolsPresenceTest.java
+++ b/test/hotspot/jtreg/compiler/codecache/jmx/MemoryPoolsPresenceTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2014, 2022, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2014, 2025, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -40,6 +40,26 @@
  *     compiler.codecache.jmx.MemoryPoolsPresenceTest
  */
 
+/**
+ * @test MemoryPoolsPresenceTest
+ * @requires vm.compiler2.enabled
+ * @summary verify that MemoryManagerMXBean exists for every code cache segment
+ * @modules java.base/jdk.internal.misc
+ *          java.management
+ * @library /test/lib
+ *
+ * @build jdk.test.whitebox.WhiteBox
+ * @run driver jdk.test.lib.helpers.ClassFileInstaller jdk.test.whitebox.WhiteBox
+ * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions
+ *     -XX:+WhiteBoxAPI
+ *     -XX:+UnlockExperimentalVMOptions -XX:+HotCodeHeap -XX:HotCodeHeapSize=8M -XX:+TieredCompilation -XX:TieredStopAtLevel=4
+ *     compiler.codecache.jmx.MemoryPoolsPresenceTest
+ * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions
+ *     -XX:+WhiteBoxAPI
+ *     -XX:+UnlockExperimentalVMOptions -XX:+HotCodeHeap -XX:HotCodeHeapSize=8M -XX:-TieredCompilation -XX:TieredStopAtLevel=4
+ *     compiler.codecache.jmx.MemoryPoolsPresenceTest
+ */
+
 package compiler.codecache.jmx;
 
 import jdk.test.lib.Asserts;
diff --git a/test/hotspot/jtreg/compiler/codecache/jmx/PeakUsageTest.java b/test/hotspot/jtreg/compiler/codecache/jmx/PeakUsageTest.java
index b808a661904..ecd9db3a6c4 100644
--- a/test/hotspot/jtreg/compiler/codecache/jmx/PeakUsageTest.java
+++ b/test/hotspot/jtreg/compiler/codecache/jmx/PeakUsageTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2014, 2022, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2014, 2025, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,6 +23,8 @@
 
 /*
  * @test PeakUsageTest
+ * @summary testing of getPeakUsage() and resetPeakUsage for
+ *     segmented code cache
  * @library /test/lib /
  * @modules java.base/jdk.internal.misc
  *          java.management
@@ -37,8 +39,27 @@
  *     -XX:+WhiteBoxAPI -XX:CompileCommand=compileonly,null::*
  *     -XX:-SegmentedCodeCache
  *     compiler.codecache.jmx.PeakUsageTest
+ */
+
+/*
+ * @test PeakUsageTest
+ * @requires vm.compiler2.enabled
  * @summary testing of getPeakUsage() and resetPeakUsage for
  *     segmented code cache
+ * @library /test/lib /
+ * @modules java.base/jdk.internal.misc
+ *          java.management
+ *
+ * @build jdk.test.whitebox.WhiteBox
+ * @run driver jdk.test.lib.helpers.ClassFileInstaller jdk.test.whitebox.WhiteBox
+ * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions
+ *     -XX:+WhiteBoxAPI -XX:CompileCommand=compileonly,null::*
+ *     -XX:+UnlockExperimentalVMOptions -XX:+HotCodeHeap -XX:HotCodeHeapSize=8M -XX:+TieredCompilation -XX:TieredStopAtLevel=4
+ *     compiler.codecache.jmx.PeakUsageTest
+ * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions
+ *     -XX:+WhiteBoxAPI -XX:CompileCommand=compileonly,null::*
+ *     -XX:+UnlockExperimentalVMOptions -XX:+HotCodeHeap -XX:HotCodeHeapSize=8M -XX:-TieredCompilation -XX:TieredStopAtLevel=4
+ *     compiler.codecache.jmx.PeakUsageTest
  */
 
 package compiler.codecache.jmx;
diff --git a/test/hotspot/jtreg/compiler/codecache/jmx/PoolsIndependenceTest.java b/test/hotspot/jtreg/compiler/codecache/jmx/PoolsIndependenceTest.java
index 07a5ec94c87..98959f284a0 100644
--- a/test/hotspot/jtreg/compiler/codecache/jmx/PoolsIndependenceTest.java
+++ b/test/hotspot/jtreg/compiler/codecache/jmx/PoolsIndependenceTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2014, 2022, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2014, 2025, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -40,6 +40,26 @@
  *     compiler.codecache.jmx.PoolsIndependenceTest
  */
 
+/*
+ * @test PoolsIndependenceTest
+ * @requires vm.compiler2.enabled
+ * @summary testing of getUsageThreshold()
+ * @modules java.base/jdk.internal.misc
+ *          java.management
+ * @library /test/lib /
+ *
+ * @build jdk.test.whitebox.WhiteBox
+ * @run driver jdk.test.lib.helpers.ClassFileInstaller jdk.test.whitebox.WhiteBox
+ * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions
+ *     -XX:+WhiteBoxAPI -XX:-UseCodeCacheFlushing -XX:-MethodFlushing
+ *     -XX:+UnlockExperimentalVMOptions -XX:+HotCodeHeap -XX:HotCodeHeapSize=8M -XX:+TieredCompilation -XX:TieredStopAtLevel=4
+ *     compiler.codecache.jmx.PoolsIndependenceTest
+ * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions
+ *     -XX:+WhiteBoxAPI -XX:-UseCodeCacheFlushing -XX:-MethodFlushing
+ *     -XX:+UnlockExperimentalVMOptions -XX:+HotCodeHeap -XX:HotCodeHeapSize=8M -XX:-TieredCompilation -XX:TieredStopAtLevel=4
+ *     compiler.codecache.jmx.PoolsIndependenceTest
+ */
+
 package compiler.codecache.jmx;
 
 import jdk.test.lib.Asserts;
diff --git a/test/hotspot/jtreg/compiler/codecache/jmx/ThresholdNotificationsTest.java b/test/hotspot/jtreg/compiler/codecache/jmx/ThresholdNotificationsTest.java
index a71a01a555c..5c1624eeb18 100644
--- a/test/hotspot/jtreg/compiler/codecache/jmx/ThresholdNotificationsTest.java
+++ b/test/hotspot/jtreg/compiler/codecache/jmx/ThresholdNotificationsTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2014, 2022, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2014, 2025, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -40,6 +40,26 @@
  *     compiler.codecache.jmx.ThresholdNotificationsTest
  */
 
+/*
+ * @test ThresholdNotificationsTest
+ * @requires vm.compiler2.enabled
+ * @summary testing of getUsageThreshold()
+ * @library /test/lib /
+ * @modules java.base/jdk.internal.misc
+ *          java.management
+ *
+ * @build jdk.test.whitebox.WhiteBox
+ * @run driver jdk.test.lib.helpers.ClassFileInstaller jdk.test.whitebox.WhiteBox
+ * @run main/othervm -XX:+UnlockDiagnosticVMOptions -Xbootclasspath/a:. -XX:-UseCodeCacheFlushing
+ *     -XX:+WhiteBoxAPI -XX:-MethodFlushing -XX:CompileCommand=compileonly,null::*
+ *     -XX:+UnlockExperimentalVMOptions -XX:+HotCodeHeap -XX:HotCodeHeapSize=8M -XX:+TieredCompilation -XX:TieredStopAtLevel=4
+ *     compiler.codecache.jmx.ThresholdNotificationsTest
+ * @run main/othervm -XX:+UnlockDiagnosticVMOptions -Xbootclasspath/a:. -XX:-UseCodeCacheFlushing
+ *     -XX:+WhiteBoxAPI -XX:-MethodFlushing -XX:CompileCommand=compileonly,null::*
+ *     -XX:+UnlockExperimentalVMOptions -XX:+HotCodeHeap -XX:HotCodeHeapSize=8M -XX:-TieredCompilation -XX:TieredStopAtLevel=4
+ *     compiler.codecache.jmx.ThresholdNotificationsTest
+ */
+
 package compiler.codecache.jmx;
 
 import jdk.test.lib.Asserts;
diff --git a/test/hotspot/jtreg/compiler/codecache/jmx/UsageThresholdExceededSeveralTimesTest.java b/test/hotspot/jtreg/compiler/codecache/jmx/UsageThresholdExceededSeveralTimesTest.java
index 6f3402848f8..cffe5cc8774 100644
--- a/test/hotspot/jtreg/compiler/codecache/jmx/UsageThresholdExceededSeveralTimesTest.java
+++ b/test/hotspot/jtreg/compiler/codecache/jmx/UsageThresholdExceededSeveralTimesTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2014, 2022, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2014, 2025, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -42,3 +42,26 @@
  *      -XX:-SegmentedCodeCache
  *      compiler.codecache.jmx.UsageThresholdExceededTest
  */
+
+/*
+ * @test UsageThresholdExceededSeveralTimesTest
+ * @requires vm.compiler2.enabled
+ * @summary verifying that getUsageThresholdCount() returns correct value
+ *     after threshold has been hit several times
+ * @library /test/lib /
+ * @modules java.base/jdk.internal.misc
+ *          java.management
+ *
+ * @build jdk.test.whitebox.WhiteBox
+ * @run driver jdk.test.lib.helpers.ClassFileInstaller jdk.test.whitebox.WhiteBox
+ * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions
+ *      -XX:+WhiteBoxAPI -XX:-UseCodeCacheFlushing -XX:-MethodFlushing
+ *      -XX:CompileCommand=compileonly,null::* -Djdk.test.lib.iterations=10
+ *      -XX:+UnlockExperimentalVMOptions -XX:+HotCodeHeap -XX:HotCodeHeapSize=8M -XX:+TieredCompilation -XX:TieredStopAtLevel=4
+ *      compiler.codecache.jmx.UsageThresholdExceededTest
+ * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions
+ *      -XX:+WhiteBoxAPI -XX:-UseCodeCacheFlushing -XX:-MethodFlushing
+ *      -XX:CompileCommand=compileonly,null::* -Djdk.test.lib.iterations=10
+ *      -XX:+UnlockExperimentalVMOptions -XX:+HotCodeHeap -XX:HotCodeHeapSize=8M -XX:-TieredCompilation -XX:TieredStopAtLevel=4
+ *      compiler.codecache.jmx.UsageThresholdExceededTest
+ */
diff --git a/test/hotspot/jtreg/compiler/codecache/jmx/UsageThresholdExceededTest.java b/test/hotspot/jtreg/compiler/codecache/jmx/UsageThresholdExceededTest.java
index 1dae00b0035..7dd70bd0d04 100644
--- a/test/hotspot/jtreg/compiler/codecache/jmx/UsageThresholdExceededTest.java
+++ b/test/hotspot/jtreg/compiler/codecache/jmx/UsageThresholdExceededTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2014, 2022, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2014, 2025, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -32,17 +32,40 @@
  * @build jdk.test.whitebox.WhiteBox
  * @run driver jdk.test.lib.helpers.ClassFileInstaller jdk.test.whitebox.WhiteBox
  * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions
- *     -XX:+WhiteBoxAPI -XX:-UseCodeCacheFlushing  -XX:-MethodFlushing
+ *     -XX:+WhiteBoxAPI -XX:-UseCodeCacheFlushing -XX:-MethodFlushing
  *     -XX:CompileCommand=compileonly,null::*
  *     -XX:+SegmentedCodeCache
  *     compiler.codecache.jmx.UsageThresholdExceededTest
  * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions
- *     -XX:+WhiteBoxAPI -XX:-UseCodeCacheFlushing  -XX:-MethodFlushing
+ *     -XX:+WhiteBoxAPI -XX:-UseCodeCacheFlushing -XX:-MethodFlushing
  *     -XX:CompileCommand=compileonly,null::*
  *     -XX:-SegmentedCodeCache
  *     compiler.codecache.jmx.UsageThresholdExceededTest
  */
 
+/*
+ * @test UsageThresholdExceededTest
+ * @requires vm.compiler2.enabled
+ * @summary verifying that getUsageThresholdCount() returns correct value
+ *     after threshold has been hit
+ * @library /test/lib /
+ * @modules java.base/jdk.internal.misc
+ *          java.management
+ *
+ * @build jdk.test.whitebox.WhiteBox
+ * @run driver jdk.test.lib.helpers.ClassFileInstaller jdk.test.whitebox.WhiteBox
+ * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions
+ *     -XX:+WhiteBoxAPI -XX:-UseCodeCacheFlushing -XX:-MethodFlushing
+ *     -XX:CompileCommand=compileonly,null::*
+ *     -XX:+UnlockExperimentalVMOptions -XX:+HotCodeHeap -XX:HotCodeHeapSize=8M -XX:+TieredCompilation -XX:TieredStopAtLevel=4
+ *     compiler.codecache.jmx.UsageThresholdExceededTest
+ * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions
+ *     -XX:+WhiteBoxAPI -XX:-UseCodeCacheFlushing -XX:-MethodFlushing
+ *     -XX:CompileCommand=compileonly,null::*
+ *     -XX:+UnlockExperimentalVMOptions -XX:+HotCodeHeap -XX:HotCodeHeapSize=8M -XX:-TieredCompilation -XX:TieredStopAtLevel=4
+ *     compiler.codecache.jmx.UsageThresholdExceededTest
+ */
+
 package compiler.codecache.jmx;
 
 import jdk.test.whitebox.code.BlobType;
diff --git a/test/hotspot/jtreg/compiler/codecache/jmx/UsageThresholdIncreasedTest.java b/test/hotspot/jtreg/compiler/codecache/jmx/UsageThresholdIncreasedTest.java
index cb3f2c90364..a49a27a4d20 100644
--- a/test/hotspot/jtreg/compiler/codecache/jmx/UsageThresholdIncreasedTest.java
+++ b/test/hotspot/jtreg/compiler/codecache/jmx/UsageThresholdIncreasedTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2014, 2022, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2014, 2025, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -42,6 +42,28 @@
  *     compiler.codecache.jmx.UsageThresholdIncreasedTest
  */
 
+/*
+ * @test UsageThresholdIncreasedTest
+ * @requires vm.compiler2.enabled
+ * @summary verifying that threshold hasn't been hit after allocation smaller
+ *     than threshold value and that threshold value can be changed
+ * @library /test/lib /
+ * @modules java.base/jdk.internal.misc
+ *          java.management
+ * @build jdk.test.whitebox.WhiteBox
+ * @run driver jdk.test.lib.helpers.ClassFileInstaller jdk.test.whitebox.WhiteBox
+ * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions
+ *     -XX:+WhiteBoxAPI -XX:-UseCodeCacheFlushing  -XX:-MethodFlushing
+ *     -XX:CompileCommand=compileonly,null::*
+ *     -XX:+UnlockExperimentalVMOptions -XX:+HotCodeHeap -XX:HotCodeHeapSize=8M -XX:+TieredCompilation -XX:TieredStopAtLevel=4
+ *     compiler.codecache.jmx.UsageThresholdIncreasedTest
+ * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions
+ *     -XX:+WhiteBoxAPI -XX:-UseCodeCacheFlushing  -XX:-MethodFlushing
+ *     -XX:CompileCommand=compileonly,null::*
+ *     -XX:+UnlockExperimentalVMOptions -XX:+HotCodeHeap -XX:HotCodeHeapSize=8M -XX:-TieredCompilation -XX:TieredStopAtLevel=4
+ *     compiler.codecache.jmx.UsageThresholdIncreasedTest
+ */
+
 package compiler.codecache.jmx;
 
 import jdk.test.whitebox.code.BlobType;
diff --git a/test/hotspot/jtreg/compiler/codecache/jmx/UsageThresholdNotExceededTest.java b/test/hotspot/jtreg/compiler/codecache/jmx/UsageThresholdNotExceededTest.java
index 1c13c89884b..0d75beb78da 100644
--- a/test/hotspot/jtreg/compiler/codecache/jmx/UsageThresholdNotExceededTest.java
+++ b/test/hotspot/jtreg/compiler/codecache/jmx/UsageThresholdNotExceededTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2014, 2022, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2014, 2025, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -43,6 +43,29 @@
  *     compiler.codecache.jmx.UsageThresholdNotExceededTest
  */
 
+/*
+ * @test UsageThresholdNotExceededTest
+ * @requires vm.compiler2.enabled
+ * @summary verifying that usage threshold not exceeded while allocating less
+ *     than usage threshold
+ * @library /test/lib /
+ * @modules java.base/jdk.internal.misc
+ *          java.management
+ *
+ * @build jdk.test.whitebox.WhiteBox
+ * @run driver jdk.test.lib.helpers.ClassFileInstaller jdk.test.whitebox.WhiteBox
+ * * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions
+ *     -XX:+WhiteBoxAPI -XX:-UseCodeCacheFlushing -XX:-MethodFlushing
+ *     -XX:CompileCommand=compileonly,null::*
+ *     -XX:+UnlockExperimentalVMOptions -XX:+HotCodeHeap -XX:HotCodeHeapSize=8M -XX:+TieredCompilation -XX:TieredStopAtLevel=4
+ *     compiler.codecache.jmx.UsageThresholdNotExceededTest
+ * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions
+ *     -XX:+WhiteBoxAPI -XX:-UseCodeCacheFlushing -XX:-MethodFlushing
+ *     -XX:CompileCommand=compileonly,null::*
+ *     -XX:+UnlockExperimentalVMOptions -XX:+HotCodeHeap -XX:HotCodeHeapSize=8M -XX:-TieredCompilation -XX:TieredStopAtLevel=4
+ *     compiler.codecache.jmx.UsageThresholdNotExceededTest
+ */
+
 package compiler.codecache.jmx;
 
 import jdk.test.whitebox.code.BlobType;
diff --git a/test/hotspot/jtreg/compiler/codecache/stress/RandomAllocationTest.java b/test/hotspot/jtreg/compiler/codecache/stress/RandomAllocationTest.java
index 26d3556d10e..d1d2da8523b 100644
--- a/test/hotspot/jtreg/compiler/codecache/stress/RandomAllocationTest.java
+++ b/test/hotspot/jtreg/compiler/codecache/stress/RandomAllocationTest.java
@@ -43,6 +43,29 @@
  *                   compiler.codecache.stress.RandomAllocationTest
  */
 
+/*
+ * @test RandomAllocationTest
+ * @key stress randomness
+ * @requires vm.compiler2.enabled
+ * @summary stressing code cache by allocating randomly sized "dummy" code blobs
+ * @library /test/lib /
+ * @modules java.base/jdk.internal.misc
+ *          java.management
+ *
+ * @build jdk.test.whitebox.WhiteBox compiler.codecache.stress.Helper compiler.codecache.stress.TestCaseImpl
+ * @run driver jdk.test.lib.helpers.ClassFileInstaller jdk.test.whitebox.WhiteBox
+ * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions
+ *                   -XX:+WhiteBoxAPI
+ *                   -XX:CompileCommand=dontinline,compiler.codecache.stress.Helper$TestCase::method
+ *                   -XX:+UnlockExperimentalVMOptions -XX:+HotCodeHeap -XX:HotCodeHeapSize=8M -XX:+TieredCompilation -XX:TieredStopAtLevel=4
+ *                   compiler.codecache.stress.RandomAllocationTest
+ * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions
+ *                   -XX:+WhiteBoxAPI
+ *                   -XX:CompileCommand=dontinline,compiler.codecache.stress.Helper$TestCase::method
+ *                   -XX:+UnlockExperimentalVMOptions -XX:+HotCodeHeap -XX:HotCodeHeapSize=8M -XX:-TieredCompilation -XX:TieredStopAtLevel=4
+ *                   compiler.codecache.stress.RandomAllocationTest
+ */
+
 package compiler.codecache.stress;
 
 import jdk.test.whitebox.code.BlobType;
diff --git a/test/hotspot/jtreg/compiler/hotcode/HotCodeCollectorMoveFunction.java b/test/hotspot/jtreg/compiler/hotcode/HotCodeCollectorMoveFunction.java
new file mode 100644
index 00000000000..dd02de66881
--- /dev/null
+++ b/test/hotspot/jtreg/compiler/hotcode/HotCodeCollectorMoveFunction.java
@@ -0,0 +1,88 @@
+/*
+ * Copyright Amazon.com Inc. or its affiliates. All Rights Reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ *
+ */
+
+/*
+ * @test
+ * @library /test/lib /
+ * @build jdk.test.whitebox.WhiteBox
+ * @run driver jdk.test.lib.helpers.ClassFileInstaller jdk.test.whitebox.WhiteBox
+ * @run main/othervm -Xbootclasspath/a:. -Xbatch -XX:-TieredCompilation -XX:+SegmentedCodeCache -XX:+UnlockExperimentalVMOptions -XX:+HotCodeHeap
+ *                   -XX:+NMethodRelocation -XX:+UnlockDiagnosticVMOptions -XX:+WhiteBoxAPI -XX:HotCodeIntervalSeconds=0 -XX:HotCodeCallLevel=0
+ *                   -XX:HotCodeSampleSeconds=5 -XX:HotCodeStablePercent=-1 -XX:HotCodeSamplePercent=100 -XX:HotCodeStartupDelaySeconds=0
+ *                   -XX:CompileCommand=compileonly,compiler.hotcode.HotCodeCollectorMoveFunction::func
+ *                   compiler.hotcode.HotCodeCollectorMoveFunction
+ */
+
+package compiler.hotcode;
+
+import java.lang.reflect.Method;
+
+import jdk.test.lib.Asserts;
+import jdk.test.whitebox.WhiteBox;
+import jdk.test.whitebox.code.BlobType;
+import jdk.test.whitebox.code.NMethod;
+
+public class HotCodeCollectorMoveFunction {
+
+    private static final WhiteBox WHITE_BOX = WhiteBox.getWhiteBox();
+    private static final Method method;
+    private static final int C2_LEVEL = 4;
+    private static final int FUNC_RUN_MILLIS = 60_000;
+
+    static {
+        try {
+            method = HotCodeCollectorMoveFunction.class.getMethod("func");
+        } catch (NoSuchMethodException e) {
+            throw new RuntimeException(e);
+        }
+    }
+
+    public static void main(String[] args) throws Exception {
+        WHITE_BOX.testSetDontInlineMethod(method, true);
+
+        compileFunc();
+
+        // Call function so collector samples and relocates
+        func();
+
+        // Function should now be in the Hot code heap after collector has had time to relocate
+        NMethod reloc_nm = NMethod.get(method, false);
+        Asserts.assertNotEquals(reloc_nm, null);
+        Asserts.assertEQ(reloc_nm.code_blob_type, BlobType.MethodHot);
+    }
+
+    public static void compileFunc() {
+        WHITE_BOX.enqueueMethodForCompilation(method, C2_LEVEL);
+
+        if (WHITE_BOX.getMethodCompilationLevel(method) != C2_LEVEL) {
+            throw new IllegalStateException("Method " + method + " is not compiled by C2.");
+        }
+    }
+
+    public static void func() {
+        long start = System.currentTimeMillis();
+        while (System.currentTimeMillis() - start < FUNC_RUN_MILLIS) {}
+    }
+
+}
diff --git a/test/hotspot/jtreg/compiler/hotcode/StressHotCodeCollector.java b/test/hotspot/jtreg/compiler/hotcode/StressHotCodeCollector.java
new file mode 100644
index 00000000000..4a7f9d2cc21
--- /dev/null
+++ b/test/hotspot/jtreg/compiler/hotcode/StressHotCodeCollector.java
@@ -0,0 +1,167 @@
+/*
+ * Copyright Amazon.com Inc. or its affiliates. All Rights Reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ *
+ */
+
+/*
+ * @test
+ * @library /test/lib /
+ * @build jdk.test.whitebox.WhiteBox
+ * @run driver jdk.test.lib.helpers.ClassFileInstaller jdk.test.whitebox.WhiteBox
+ * @run main/othervm -Xbootclasspath/a:. -Xcomp -XX:-TieredCompilation -XX:+UnlockExperimentalVMOptions -XX:+HotCodeHeap -XX:+NMethodRelocation
+ *                   -XX:+UnlockDiagnosticVMOptions -XX:+WhiteBoxAPI -XX:HotCodeIntervalSeconds=0 -XX:HotCodeSampleSeconds=10
+ *                   -XX:HotCodeStablePercent=-1 -XX:HotCodeSamplePercent=100 -XX:HotCodeStartupDelaySeconds=0
+ *                   compiler.hotcode.StressHotCodeCollector
+ */
+
+package compiler.hotcode;
+
+import java.lang.reflect.Method;
+import java.util.ArrayList;
+import java.util.Random;
+
+import jdk.test.lib.compiler.InMemoryJavaCompiler;
+import jdk.test.whitebox.WhiteBox;
+
+public class StressHotCodeCollector {
+
+    private static final WhiteBox WHITE_BOX = WhiteBox.getWhiteBox();
+    private static final double RUN_MILLIS = 60_000;
+
+    private static TestMethod[] methods = new TestMethod[100];
+
+    private static byte[] num1;
+    private static byte[] num2;
+
+    private static byte[] genNum(Random random, int digitCount) {
+        byte[] num = new byte[digitCount];
+        int d;
+        do {
+            d = random.nextInt(10);
+        } while (d == 0);
+
+        num[0] = (byte)d;
+        for (int i = 1; i < digitCount; ++i) {
+            num[i] = (byte)random.nextInt(10);
+        }
+        return num;
+    }
+
+    private static void initNums() {
+        final long seed = 8374592837465123L;
+        Random random = new Random(seed);
+
+        final int digitCount = 40;
+        num1 = genNum(random, digitCount);
+        num2 = genNum(random, digitCount);
+    }
+
+    private static void generateCode() throws Exception {
+        byte[] result = new byte[num1.length + 1];
+
+        for (int i = 0; i < methods.length; i++) {
+            methods[i] = new TestMethod();
+        }
+    }
+
+    public static void main(String[] args) throws Exception {
+
+        initNums();
+        generateCode();
+
+        long start = System.currentTimeMillis();
+        Random random = new Random();
+
+        while (System.currentTimeMillis() - start < RUN_MILLIS) {
+            for (TestMethod m : methods) {
+                if (random.nextInt(100) < 10) {
+                    m.deoptimize();
+                }
+
+                byte[] result = new byte[num1.length + 1];
+                m.invoke(num1, num2, result);
+            }
+        }
+    }
+
+    private static final class TestMethod {
+        private static final String CLASS_NAME = "A";
+        private static final String METHOD_TO_COMPILE = "sum";
+        private static final String JAVA_CODE = """
+        public class A {
+
+            public static void sum(byte[] n1, byte[] n2, byte[] out) {
+                long start = System.currentTimeMillis();
+                while (System.currentTimeMillis() - start < 100) {}
+
+                final int digitCount = n1.length;
+                int carry = 0;
+                for (int i = digitCount - 1; i >= 0; --i) {
+                    int sum = n1[i] + n2[i] + carry;
+                    out[i] = (byte)(sum % 10);
+                    carry = sum / 10;
+                }
+                if (carry != 0) {
+                    for (int i = digitCount; i > 0; --i) {
+                        out[i] = out[i - 1];
+                    }
+                    out[0] = (byte)carry;
+                }
+            }
+        }""";
+
+        private static final byte[] BYTE_CODE;
+
+        static {
+            BYTE_CODE = InMemoryJavaCompiler.compile(CLASS_NAME, JAVA_CODE);
+        }
+
+        private final Method method;
+
+        private static ClassLoader createClassLoaderFor() {
+            return new ClassLoader() {
+                @Override
+                public Class<?> loadClass(String name) throws ClassNotFoundException {
+                    if (!name.equals(CLASS_NAME)) {
+                        return super.loadClass(name);
+                    }
+
+                    return defineClass(name, BYTE_CODE, 0, BYTE_CODE.length);
+                }
+            };
+        }
+
+        public TestMethod() throws Exception {
+            var cl = createClassLoaderFor().loadClass(CLASS_NAME);
+            method = cl.getMethod(METHOD_TO_COMPILE, byte[].class, byte[].class, byte[].class);
+            WHITE_BOX.testSetDontInlineMethod(method, true);
+        }
+
+        public void invoke(byte[] num1, byte[] num2, byte[] result) throws Exception {
+            method.invoke(null, num1, num2, result);
+        }
+
+        public void deoptimize() {
+            WHITE_BOX.deoptimizeMethod(method);
+        }
+    }
+}
diff --git a/test/jdk/jdk/jfr/event/compiler/TestCodeCacheFull.java b/test/jdk/jdk/jfr/event/compiler/TestCodeCacheFull.java
index 3d9cd083204..12c9d6c40fa 100644
--- a/test/jdk/jdk/jfr/event/compiler/TestCodeCacheFull.java
+++ b/test/jdk/jdk/jfr/event/compiler/TestCodeCacheFull.java
@@ -50,6 +50,12 @@ import jdk.test.whitebox.code.BlobType;
  * @run main/othervm -Xbootclasspath/a:.
  *     -XX:+UnlockDiagnosticVMOptions -XX:+WhiteBoxAPI
  *     -XX:-SegmentedCodeCache jdk.jfr.event.compiler.TestCodeCacheFull
+ * @run main/othervm -Xbootclasspath/a:.
+ *     -XX:+UnlockDiagnosticVMOptions -XX:+WhiteBoxAPI
+ *     -XX:+TieredCompilation -XX:+UnlockExperimentalVMOptions -XX:+HotCodeHeap -XX:HotCodeHeapSize=8M jdk.jfr.event.compiler.TestCodeCacheFull
+ * @run main/othervm -Xbootclasspath/a:.
+ *     -XX:+UnlockDiagnosticVMOptions -XX:+WhiteBoxAPI
+ *     -XX:-TieredCompilation -XX:+UnlockExperimentalVMOptions -XX:+HotCodeHeap -XX:HotCodeHeapSize=8M jdk.jfr.event.compiler.TestCodeCacheFull
  */
 public class TestCodeCacheFull {
 
diff --git a/test/lib/jdk/test/whitebox/code/BlobType.java b/test/lib/jdk/test/whitebox/code/BlobType.java
index a2290acc7b6..e2d57f79484 100644
--- a/test/lib/jdk/test/whitebox/code/BlobType.java
+++ b/test/lib/jdk/test/whitebox/code/BlobType.java
@@ -46,8 +46,16 @@ public enum BlobType {
                     || type == BlobType.MethodNonProfiled;
         }
     },
+    MethodHot(2, "CodeHeap 'hot nmethods'", "HotCodeHeapSize") {
+        @Override
+        public boolean allowTypeWhenOverflow(BlobType type) {
+            return super.allowTypeWhenOverflow(type)
+                    || type == BlobType.MethodNonProfiled
+                    || type == BlobType.MethodProfiled;
+        }
+    },
     // Non-nmethods like Buffers, Adapters and Runtime Stubs
-    NonNMethod(2, "CodeHeap 'non-nmethods'", "NonNMethodCodeHeapSize") {
+    NonNMethod(3, "CodeHeap 'non-nmethods'", "NonNMethodCodeHeapSize") {
         @Override
         public boolean allowTypeWhenOverflow(BlobType type) {
             return super.allowTypeWhenOverflow(type)
@@ -56,7 +64,7 @@ public enum BlobType {
         }
     },
     // All types (No code cache segmentation)
-    All(3, "CodeCache", "ReservedCodeCacheSize");
+    All(4, "CodeCache", "ReservedCodeCacheSize");
 
     public final int id;
     public final String sizeOptionName;
@@ -99,6 +107,10 @@ public enum BlobType {
             // there is no MethodProfiled in non tiered world or pure C1
             result.remove(MethodProfiled);
         }
+
+        if (Long.valueOf(0).equals(whiteBox.getVMFlag("HotCodeHeapSize"))) {
+            result.remove(MethodHot);
+        }
         return result;
     }
 

From d68065e7474c07233cf1752c2a6efcaf9d35066d Mon Sep 17 00:00:00 2001
From: Erik Gahlin <egahlin@openjdk.org>
Date: Thu, 9 Apr 2026 16:20:56 +0000
Subject: [PATCH 541/655] 8365498: jdk/jfr/event/os/TestCPULoad.java fails with
 Expected at least one event

Reviewed-by: mgronlun
---
 test/jdk/jdk/jfr/event/os/TestCPULoad.java | 72 ++++++----------------
 1 file changed, 18 insertions(+), 54 deletions(-)

diff --git a/test/jdk/jdk/jfr/event/os/TestCPULoad.java b/test/jdk/jdk/jfr/event/os/TestCPULoad.java
index 09ceb0a79b7..f3f30f15b2b 100644
--- a/test/jdk/jdk/jfr/event/os/TestCPULoad.java
+++ b/test/jdk/jdk/jfr/event/os/TestCPULoad.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2013, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2013, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,10 +23,12 @@
 
 package jdk.jfr.event.os;
 
-import java.util.List;
+import java.time.Duration;
+import java.util.concurrent.ArrayBlockingQueue;
+import java.util.concurrent.BlockingQueue;
 
-import jdk.jfr.Recording;
 import jdk.jfr.consumer.RecordedEvent;
+import jdk.jfr.consumer.RecordingStream;
 import jdk.test.lib.jfr.EventNames;
 import jdk.test.lib.jfr.Events;
 
@@ -40,56 +42,18 @@ import jdk.test.lib.jfr.Events;
 public class TestCPULoad {
     private final static String EVENT_NAME = EventNames.CPULoad;
 
-    public static boolean isPrime(int num) {
-        if (num <= 1) return false;
-        for (int i = 2; i <= Math.sqrt(num); i++) {
-            if (num % i == 0) return false;
-        }
-        return true;
-    }
-
-    public static int burnCpuCycles(int limit) {
-        int primeCount = 0;
-        for (int i = 2; i < limit; i++) {
-            if (isPrime(i)) {
-                primeCount++;
-            }
-        }
-        return primeCount;
-    }
-
-    public static void main(String[] args) throws Throwable {
-        Recording recording = new Recording();
-        recording.enable(EVENT_NAME);
-        recording.start();
-        // burn some cycles to check increase of CPU related counters
-        int pn = burnCpuCycles(2500000);
-        recording.stop();
-        System.out.println("Found " + pn + " primes while burning cycles");
-
-        List<RecordedEvent> events = Events.fromRecording(recording);
-        if (events.isEmpty()) {
-            // CPU Load events are unreliable on Windows because
-            // the way processes are identified with perf. counters.
-            // See BUG 8010378.
-            // Workaround is to detect Windows and allow
-            // test to pass if events are missing.
-            if (isWindows()) {
-                return;
-            }
-            throw new AssertionError("Expected at least one event");
-        }
-        for (RecordedEvent event : events) {
-            System.out.println("Event: " + event);
-            for (String loadName : loadNames) {
-                Events.assertField(event, loadName).atLeast(0.0f).atMost(1.0f);
-            }
+    public static void main(String... args) throws Exception {
+        try (RecordingStream rs = new RecordingStream()) {
+            BlockingQueue<RecordedEvent> cpuEvent = new ArrayBlockingQueue<>(1);
+            rs.setReuse(false);
+            rs.enable(EVENT_NAME).withPeriod(Duration.ofMillis(100));
+            rs.onEvent(cpuEvent::offer);
+            rs.startAsync();
+            RecordedEvent event = cpuEvent.take();
+            System.out.println(event);
+            Events.assertField(event, "jvmUser").atLeast(0.0f).atMost(1.0f);
+            Events.assertField(event, "jvmSystem").atLeast(0.0f).atMost(1.0f);
+            Events.assertField(event, "machineTotal").atLeast(0.0f).atMost(1.0f);
         }
     }
-
-    private static final String[] loadNames = {"jvmUser", "jvmSystem", "machineTotal"};
-
-    private static boolean isWindows() {
-        return System.getProperty("os.name").startsWith("Windows");
-    }
-}
+}
\ No newline at end of file

From e6bce14874a9243be461b058a696583dd6106ef3 Mon Sep 17 00:00:00 2001
From: Andrew Haley <aph@openjdk.org>
Date: Thu, 9 Apr 2026 17:01:16 +0000
Subject: [PATCH 542/655] 8381765: AArch32: Capstone hsdis does not build

Reviewed-by: shade, erikj, jwaters
---
 make/Hsdis.gmk                            | 3 +++
 src/utils/hsdis/capstone/hsdis-capstone.c | 5 +++--
 2 files changed, 6 insertions(+), 2 deletions(-)

diff --git a/make/Hsdis.gmk b/make/Hsdis.gmk
index 469cc488f16..76695fc8dde 100644
--- a/make/Hsdis.gmk
+++ b/make/Hsdis.gmk
@@ -44,6 +44,9 @@ ifeq ($(HSDIS_BACKEND), capstone)
   else ifeq ($(call isTargetCpuArch, aarch64), true)
     CAPSTONE_ARCH := CS_ARCH_$(CAPSTONE_ARCH_AARCH64_NAME)
     CAPSTONE_MODE := CS_MODE_ARM
+  else ifeq ($(call isTargetCpuArch, arm), true)
+    CAPSTONE_ARCH := CS_ARCH_ARM
+    CAPSTONE_MODE := CS_MODE_ARM
   else
     $(error No support for Capstone on this platform)
   endif
diff --git a/src/utils/hsdis/capstone/hsdis-capstone.c b/src/utils/hsdis/capstone/hsdis-capstone.c
index d8a8719778d..7a17d150f40 100644
--- a/src/utils/hsdis/capstone/hsdis-capstone.c
+++ b/src/utils/hsdis/capstone/hsdis-capstone.c
@@ -58,6 +58,7 @@
    and that causes invalid macro expansion.
 */
 #undef aarch64
+#undef arm
 #include <capstone.h>
 
 #include "hsdis.h"
@@ -163,9 +164,9 @@ void* decode_instructions_virtual(uintptr_t start_va, uintptr_t end_va,
   size_t count = cs_disasm(cs_handle, buffer, length, (uintptr_t) buffer, 0 , &insn);
   if (count) {
     for (unsigned int j = 0; j < count; j++) {
-      (*event_callback)(event_stream, "insn", (void*) insn[j].address);
+      (*event_callback)(event_stream, "insn", (void*)(uintptr_t) insn[j].address);
       print("%s\t\t%s", insn[j].mnemonic, insn[j].op_str);
-      (*event_callback)(event_stream, "/insn", (void*) (insn[j].address + insn[j].size));
+      (*event_callback)(event_stream, "/insn", (void*)(uintptr_t) (insn[j].address + insn[j].size));
       if (newline) {
         /* follow each complete insn by a nice newline */
         print("\n");

From 20387ffafcd6d45de8b8ee254da3a04702ad0752 Mon Sep 17 00:00:00 2001
From: Andrew Dinn <adinn@openjdk.org>
Date: Thu, 9 Apr 2026 18:28:09 +0000
Subject: [PATCH 543/655] 8381879: JDK-8372617 has broken the Zero build

Reviewed-by: kvn
---
 src/hotspot/share/code/aotCodeCache.cpp | 3 ---
 1 file changed, 3 deletions(-)

diff --git a/src/hotspot/share/code/aotCodeCache.cpp b/src/hotspot/share/code/aotCodeCache.cpp
index d3888d1b7eb..6594d94fa91 100644
--- a/src/hotspot/share/code/aotCodeCache.cpp
+++ b/src/hotspot/share/code/aotCodeCache.cpp
@@ -1905,9 +1905,6 @@ void AOTCodeAddressTable::init_extrs() {
   ADD_EXTERNAL_ADDRESS(SharedRuntime::handle_wrong_method_ic_miss);
 #if defined(AARCH64) && !defined(ZERO)
   ADD_EXTERNAL_ADDRESS(JavaThread::aarch64_get_thread_helper);
-#endif
-
-#if defined(AARCH64)
   ADD_EXTERNAL_ADDRESS(BarrierSetAssembler::patching_epoch_addr());
 #endif
 

From df09910ec879dc628484588a3137298504fceaf1 Mon Sep 17 00:00:00 2001
From: Erik Joelsson <erikj@openjdk.org>
Date: Thu, 9 Apr 2026 18:33:47 +0000
Subject: [PATCH 544/655] 8380947: Add pull request template

Reviewed-by: mr
---
 .github/pull_request_template.md | 5 +++++
 1 file changed, 5 insertions(+)
 create mode 100644 .github/pull_request_template.md

diff --git a/.github/pull_request_template.md b/.github/pull_request_template.md
new file mode 100644
index 00000000000..d3f63784ece
--- /dev/null
+++ b/.github/pull_request_template.md
@@ -0,0 +1,5 @@
+
+
+
+---------
+- [ ] I confirm that I make this contribution in accordance with the [OpenJDK Interim AI Policy](https://openjdk.org/legal/ai).

From 24f7945779c810671d545ed0a618485a313134b0 Mon Sep 17 00:00:00 2001
From: Yasumasa Suenaga <ysuenaga@openjdk.org>
Date: Thu, 9 Apr 2026 23:49:11 +0000
Subject: [PATCH 545/655] 8377946: Use DWARF in mixed jstack on Linux AArch64

Reviewed-by: cjplummer, kevinw, erikj
---
 make/modules/jdk.hotspot.agent/Lib.gmk        |   9 +-
 .../linux/native/libsaproc/DwarfParser.cpp    | 180 ++++++++-------
 .../native/libsaproc/LinuxDebuggerLocal.cpp   |  18 +-
 .../linux/native/libsaproc/dwarf.cpp          |  14 ++
 .../linux/native/libsaproc/dwarf.hpp          |  38 ++--
 .../native/libsaproc/dwarf_regs_aarch64.h     |  78 +++++++
 .../linux/native/libsaproc/dwarf_regs_amd64.h |  61 ++++++
 .../linux/native/libsaproc/libproc.h          |   6 +-
 .../linux/native/libsaproc/libproc_impl.c     |   6 +
 .../linux/native/libsaproc/libproc_impl.h     |   4 +
 .../linux/native/libsaproc/ps_core.c          |  44 +++-
 .../linux/native/libsaproc/ps_proc.c          |  17 +-
 .../linux/native/libsaproc/symtab.c           |   8 +-
 .../sun/jvm/hotspot/debugger/cdbg/CFrame.java |   4 +-
 .../hotspot/debugger/linux/DwarfCFrame.java   | 187 ++++++++++++++++
 .../linux/{amd64 => }/DwarfParser.java        |   4 +-
 .../debugger/linux/LinuxCDebugger.java        |   8 +-
 .../hotspot/debugger/linux/LinuxDebugger.java |  11 +-
 .../debugger/linux/LinuxDebuggerLocal.java    |   2 +-
 .../linux/aarch64/LinuxAARCH64CFrame.java     | 179 ++++++++++-----
 .../aarch64/LinuxAARCH64ThreadContext.java    |  23 +-
 .../linux/amd64/LinuxAMD64CFrame.java         | 206 ++++--------------
 .../sa/TestJhsdbJstackMixedWithXComp.java     |   6 +-
 23 files changed, 754 insertions(+), 359 deletions(-)
 create mode 100644 src/jdk.hotspot.agent/linux/native/libsaproc/dwarf_regs_aarch64.h
 create mode 100644 src/jdk.hotspot.agent/linux/native/libsaproc/dwarf_regs_amd64.h
 create mode 100644 src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/debugger/linux/DwarfCFrame.java
 rename src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/debugger/linux/{amd64 => }/DwarfParser.java (95%)

diff --git a/make/modules/jdk.hotspot.agent/Lib.gmk b/make/modules/jdk.hotspot.agent/Lib.gmk
index ed8de631dc3..da02e0dab39 100644
--- a/make/modules/jdk.hotspot.agent/Lib.gmk
+++ b/make/modules/jdk.hotspot.agent/Lib.gmk
@@ -1,5 +1,5 @@
 #
-# Copyright (c) 2015, 2025, Oracle and/or its affiliates. All rights reserved.
+# Copyright (c) 2015, 2026, Oracle and/or its affiliates. All rights reserved.
 # DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
 #
 # This code is free software; you can redistribute it and/or modify it
@@ -55,6 +55,12 @@ else
   LIBSAPROC_LINK_TYPE := C
 endif
 
+# DWARF related sources would be included on supported platforms only.
+LIBSAPROC_EXCLUDE_FILES :=
+ifneq ($(call And, $(call isTargetOs, linux) $(call isTargetCpu, x86_64 aarch64)), true)
+  LIBSAPROC_EXCLUDE_FILES := DwarfParser.cpp dwarf.cpp
+endif
+
 $(eval $(call SetupJdkLibrary, BUILD_LIBSAPROC, \
     NAME := saproc, \
     LINK_TYPE := $(LIBSAPROC_LINK_TYPE), \
@@ -70,6 +76,7 @@ $(eval $(call SetupJdkLibrary, BUILD_LIBSAPROC, \
     CFLAGS := $(LIBSAPROC_CFLAGS), \
     CXXFLAGS := $(LIBSAPROC_CFLAGS) $(LIBSAPROC_CXXFLAGS), \
     EXTRA_SRC := $(LIBSAPROC_EXTRA_SRC), \
+    EXCLUDE_FILES := $(LIBSAPROC_EXCLUDE_FILES), \
     JDK_LIBS := java.base:libjava, \
     LIBS_linux := $(LIBDL), \
     LIBS_macosx := \
diff --git a/src/jdk.hotspot.agent/linux/native/libsaproc/DwarfParser.cpp b/src/jdk.hotspot.agent/linux/native/libsaproc/DwarfParser.cpp
index 62dbc84f88c..cc03f3fc832 100644
--- a/src/jdk.hotspot.agent/linux/native/libsaproc/DwarfParser.cpp
+++ b/src/jdk.hotspot.agent/linux/native/libsaproc/DwarfParser.cpp
@@ -31,73 +31,54 @@
 #define CHECK_EXCEPTION if (env->ExceptionCheck()) { return; }
 
 static jfieldID p_dwarf_context_ID = 0;
-static jint sa_RAX = -1;
-static jint sa_RDX = -1;
-static jint sa_RCX = -1;
-static jint sa_RBX = -1;
-static jint sa_RSI = -1;
-static jint sa_RDI = -1;
-static jint sa_RBP = -1;
-static jint sa_RSP = -1;
-static jint sa_R8  = -1;
-static jint sa_R9  = -1;
-static jint sa_R10 = -1;
-static jint sa_R11 = -1;
-static jint sa_R12 = -1;
-static jint sa_R13 = -1;
-static jint sa_R14 = -1;
-static jint sa_R15 = -1;
+
+// DWARF_REG macro is used by DWARF_REGLIST.
+#define DWARF_REG(reg, _) \
+  static jint sa_##reg = -1;
+
+DWARF_REGLIST
+
+#undef DWARF_REG
 
 static jlong get_dwarf_context(JNIEnv *env, jobject obj) {
   return env->GetLongField(obj, p_dwarf_context_ID);
 }
 
-#define SET_REG(env, reg, reg_cls) \
+/*
+ * Class:     sun_jvm_hotspot_debugger_linux_DwarfParser
+ * Method:    init0
+ * Signature: ()V
+ */
+extern "C"
+JNIEXPORT void JNICALL Java_sun_jvm_hotspot_debugger_linux_DwarfParser_init0
+  (JNIEnv *env, jclass this_cls) {
+  jclass cls = env->FindClass("sun/jvm/hotspot/debugger/linux/DwarfParser");
+  CHECK_EXCEPTION
+  p_dwarf_context_ID = env->GetFieldID(cls, "p_dwarf_context", "J");
+  CHECK_EXCEPTION
+
+  jclass reg_cls = env->FindClass(THREAD_CONTEXT_CLASS);
+  CHECK_EXCEPTION
+
+// DWARF_REG macro is used by DWARF_REGLIST.
+#define DWARF_REG(reg, _) \
   jfieldID reg##_ID = env->GetStaticFieldID(reg_cls, #reg, "I"); \
   CHECK_EXCEPTION \
   sa_##reg = env->GetStaticIntField(reg_cls, reg##_ID); \
   CHECK_EXCEPTION
 
-/*
- * Class:     sun_jvm_hotspot_debugger_linux_amd64_DwarfParser
- * Method:    init0
- * Signature: ()V
- */
-extern "C"
-JNIEXPORT void JNICALL Java_sun_jvm_hotspot_debugger_linux_amd64_DwarfParser_init0
-  (JNIEnv *env, jclass this_cls) {
-  jclass cls = env->FindClass("sun/jvm/hotspot/debugger/linux/amd64/DwarfParser");
-  CHECK_EXCEPTION
-  p_dwarf_context_ID = env->GetFieldID(cls, "p_dwarf_context", "J");
-  CHECK_EXCEPTION
+  DWARF_REGLIST
 
-  jclass reg_cls = env->FindClass("sun/jvm/hotspot/debugger/amd64/AMD64ThreadContext");
-  CHECK_EXCEPTION
-  SET_REG(env, RAX, reg_cls);
-  SET_REG(env, RDX, reg_cls);
-  SET_REG(env, RCX, reg_cls);
-  SET_REG(env, RBX, reg_cls);
-  SET_REG(env, RSI, reg_cls);
-  SET_REG(env, RDI, reg_cls);
-  SET_REG(env, RBP, reg_cls);
-  SET_REG(env, RSP, reg_cls);
-  SET_REG(env, R8,  reg_cls);
-  SET_REG(env, R9,  reg_cls);
-  SET_REG(env, R10, reg_cls);
-  SET_REG(env, R11, reg_cls);
-  SET_REG(env, R12, reg_cls);
-  SET_REG(env, R13, reg_cls);
-  SET_REG(env, R14, reg_cls);
-  SET_REG(env, R15, reg_cls);
+#undef DWARF_REG
 }
 
 /*
- * Class:     sun_jvm_hotspot_debugger_linux_amd64_DwarfParser
+ * Class:     sun_jvm_hotspot_debugger_linux_DwarfParser
  * Method:    createDwarfContext
  * Signature: (J)J
  */
 extern "C"
-JNIEXPORT jlong JNICALL Java_sun_jvm_hotspot_debugger_linux_amd64_DwarfParser_createDwarfContext
+JNIEXPORT jlong JNICALL Java_sun_jvm_hotspot_debugger_linux_DwarfParser_createDwarfContext
   (JNIEnv *env, jclass this_cls, jlong lib) {
   DwarfParser *parser = new DwarfParser(reinterpret_cast<lib_info *>(lib));
   if (!parser->is_parseable()) {
@@ -113,36 +94,36 @@ JNIEXPORT jlong JNICALL Java_sun_jvm_hotspot_debugger_linux_amd64_DwarfParser_cr
 }
 
 /*
- * Class:     sun_jvm_hotspot_debugger_linux_amd64_DwarfParser
+ * Class:     sun_jvm_hotspot_debugger_linux_DwarfParser
  * Method:    destroyDwarfContext
  * Signature: (J)V
  */
 extern "C"
-JNIEXPORT void JNICALL Java_sun_jvm_hotspot_debugger_linux_amd64_DwarfParser_destroyDwarfContext
+JNIEXPORT void JNICALL Java_sun_jvm_hotspot_debugger_linux_DwarfParser_destroyDwarfContext
   (JNIEnv *env, jclass this_cls, jlong context) {
   DwarfParser *parser = reinterpret_cast<DwarfParser *>(context);
   delete parser;
 }
 
 /*
- * Class:     sun_jvm_hotspot_debugger_linux_amd64_DwarfParser
+ * Class:     sun_jvm_hotspot_debugger_linux_DwarfParser
  * Method:    isIn0
  * Signature: (J)Z
  */
 extern "C"
-JNIEXPORT jboolean JNICALL Java_sun_jvm_hotspot_debugger_linux_amd64_DwarfParser_isIn0
+JNIEXPORT jboolean JNICALL Java_sun_jvm_hotspot_debugger_linux_DwarfParser_isIn0
   (JNIEnv *env, jobject this_obj, jlong pc) {
   DwarfParser *parser = reinterpret_cast<DwarfParser *>(get_dwarf_context(env, this_obj));
   return static_cast<jboolean>(parser->is_in(pc));
 }
 
 /*
- * Class:     sun_jvm_hotspot_debugger_linux_amd64_DwarfParser
+ * Class:     sun_jvm_hotspot_debugger_linux_DwarfParser
  * Method:    processDwarf0
  * Signature: (J)V
  */
 extern "C"
-JNIEXPORT void JNICALL Java_sun_jvm_hotspot_debugger_linux_amd64_DwarfParser_processDwarf0
+JNIEXPORT void JNICALL Java_sun_jvm_hotspot_debugger_linux_DwarfParser_processDwarf0
   (JNIEnv *env, jobject this_obj, jlong pc) {
   DwarfParser *parser = reinterpret_cast<DwarfParser *>(get_dwarf_context(env, this_obj));
   if (!parser->process_dwarf(pc)) {
@@ -155,67 +136,106 @@ JNIEXPORT void JNICALL Java_sun_jvm_hotspot_debugger_linux_amd64_DwarfParser_pro
 }
 
 /*
- * Class:     sun_jvm_hotspot_debugger_linux_amd64_DwarfParser
+ * Class:     sun_jvm_hotspot_debugger_linux_DwarfParser
  * Method:    getCFARegister
  * Signature: ()I
  */
 extern "C"
-JNIEXPORT jint JNICALL Java_sun_jvm_hotspot_debugger_linux_amd64_DwarfParser_getCFARegister
+JNIEXPORT jint JNICALL Java_sun_jvm_hotspot_debugger_linux_DwarfParser_getCFARegister
   (JNIEnv *env, jobject this_obj) {
   DwarfParser *parser = reinterpret_cast<DwarfParser *>(get_dwarf_context(env, this_obj));
+
   switch (parser->get_cfa_register()) {
-    case RAX: return sa_RAX;
-    case RDX: return sa_RDX;
-    case RCX: return sa_RCX;
-    case RBX: return sa_RBX;
-    case RSI: return sa_RSI;
-    case RDI: return sa_RDI;
-    case RBP: return sa_RBP;
-    case RSP: return sa_RSP;
-    case R8:  return sa_R8;
-    case R9:  return sa_R9;
-    case R10: return sa_R10;
-    case R11: return sa_R11;
-    case R12: return sa_R12;
-    case R13: return sa_R13;
-    case R14: return sa_R14;
-    case R15: return sa_R15;
+// DWARF_REG macro is used by DWARF_REGLIST.
+#define DWARF_REG(reg, _) \
+    case reg: return sa_##reg;
+
+  DWARF_REGLIST
+
+#undef DWARF_REG
+
     default:  return -1;
   }
 }
 
 /*
- * Class:     sun_jvm_hotspot_debugger_linux_amd64_DwarfParser
+ * Class:     sun_jvm_hotspot_debugger_linux_DwarfParser
  * Method:    getCFAOffset
  * Signature: ()I
  */
 extern "C"
-JNIEXPORT jint JNICALL Java_sun_jvm_hotspot_debugger_linux_amd64_DwarfParser_getCFAOffset
+JNIEXPORT jint JNICALL Java_sun_jvm_hotspot_debugger_linux_DwarfParser_getCFAOffset
   (JNIEnv *env, jobject this_obj) {
   DwarfParser *parser = reinterpret_cast<DwarfParser *>(get_dwarf_context(env, this_obj));
   return parser->get_cfa_offset();
 }
 
 /*
- * Class:     sun_jvm_hotspot_debugger_linux_amd64_DwarfParser
+ * Class:     sun_jvm_hotspot_debugger_linux_DwarfParser
+ * Method:    getOffsetFromCFA
+ * Signature: (I)I
+ */
+extern "C"
+JNIEXPORT jint JNICALL Java_sun_jvm_hotspot_debugger_linux_DwarfParser_getOffsetFromCFA
+  (JNIEnv *env, jobject this_obj, jint sareg) {
+  DwarfParser *parser = reinterpret_cast<DwarfParser *>(get_dwarf_context(env, this_obj));
+
+// DWARF_REG macro is used by DWARF_REGLIST.
+#define DWARF_REG(reg, dwreg) \
+    if (sareg == sa_##reg) { \
+      return parser->get_offset_from_cfa(static_cast<enum DWARF_Register>(dwreg)); \
+    } else
+
+  DWARF_REGLIST
+
+#undef DWARF_REG
+
+  return INT_MAX;
+}
+
+/*
+ * Class:     sun_jvm_hotspot_debugger_linux_DwarfParser
+ * Method:    getRARegister
+ * Signature: ()I
+ */
+extern "C"
+JNIEXPORT jint JNICALL Java_sun_jvm_hotspot_debugger_linux_DwarfParser_getRARegister
+  (JNIEnv *env, jobject this_obj) {
+  DwarfParser *parser = reinterpret_cast<DwarfParser *>(get_dwarf_context(env, this_obj));
+
+  switch (parser->get_ra_register()) {
+// DWARF_REG macro is used by DWARF_REGLIST.
+#define DWARF_REG(reg, _) \
+    case reg: return sa_##reg;
+
+  DWARF_REGLIST
+
+#undef DWARF_REG
+
+    default:  return -1;
+  }
+}
+
+/*
+ * Class:     sun_jvm_hotspot_debugger_linux_DwarfParser
  * Method:    getReturnAddressOffsetFromCFA
  * Signature: ()I
  */
 extern "C"
-JNIEXPORT jint JNICALL Java_sun_jvm_hotspot_debugger_linux_amd64_DwarfParser_getReturnAddressOffsetFromCFA
+JNIEXPORT jint JNICALL Java_sun_jvm_hotspot_debugger_linux_DwarfParser_getReturnAddressOffsetFromCFA
   (JNIEnv *env, jobject this_obj) {
   DwarfParser *parser = reinterpret_cast<DwarfParser *>(get_dwarf_context(env, this_obj));
   return parser->get_offset_from_cfa(RA);
 }
 
 /*
- * Class:     sun_jvm_hotspot_debugger_linux_amd64_DwarfParser
+ * Class:     sun_jvm_hotspot_debugger_linux_DwarfParser
  * Method:    getBasePointerOffsetFromCFA
  * Signature: ()I
  */
 extern "C"
-JNIEXPORT jint JNICALL Java_sun_jvm_hotspot_debugger_linux_amd64_DwarfParser_getBasePointerOffsetFromCFA
+JNIEXPORT jint JNICALL Java_sun_jvm_hotspot_debugger_linux_DwarfParser_getBasePointerOffsetFromCFA
   (JNIEnv *env, jobject this_obj) {
   DwarfParser *parser = reinterpret_cast<DwarfParser *>(get_dwarf_context(env, this_obj));
-  return parser->get_offset_from_cfa(RBP);
+  return parser->get_offset_from_cfa(BP);
 }
diff --git a/src/jdk.hotspot.agent/linux/native/libsaproc/LinuxDebuggerLocal.cpp b/src/jdk.hotspot.agent/linux/native/libsaproc/LinuxDebuggerLocal.cpp
index caf948019af..214e2f21ac6 100644
--- a/src/jdk.hotspot.agent/linux/native/libsaproc/LinuxDebuggerLocal.cpp
+++ b/src/jdk.hotspot.agent/linux/native/libsaproc/LinuxDebuggerLocal.cpp
@@ -1,6 +1,6 @@
 /*
- * Copyright (c) 2002, 2025, Oracle and/or its affiliates. All rights reserved.
- * Copyright (c) 2019, 2021, NTT DATA.
+ * Copyright (c) 2002, 2026, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2019, 2026, NTT DATA.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -289,6 +289,13 @@ JNIEXPORT void JNICALL Java_sun_jvm_hotspot_debugger_linux_LinuxDebuggerLocal_at
     snprintf(msg, sizeof(msg), "Can't attach to the process: %s", err_buf);
     THROW_NEW_DEBUGGER_EXCEPTION(msg);
   }
+
+#ifdef __aarch64__
+  if (pac_enabled(ph)) {
+    printf("WARNING: PAC is enabled. Stack traces might be incomplete.\n");
+  }
+#endif
+
   env->SetLongField(this_obj, p_ps_prochandle_ID, (jlong)(intptr_t)ph);
   fillThreadsAndLoadObjects(env, this_obj, ph);
 }
@@ -313,6 +320,13 @@ JNIEXPORT void JNICALL Java_sun_jvm_hotspot_debugger_linux_LinuxDebuggerLocal_at
   if ( (ph = Pgrab_core(execName_cstr, coreName_cstr)) == NULL) {
     THROW_NEW_DEBUGGER_EXCEPTION("Can't attach to the core file. For more information, export LIBSAPROC_DEBUG=1 and try again.");
   }
+
+#ifdef __aarch64__
+  if (pac_enabled(ph)) {
+    printf("WARNING: PAC is enabled. Stack traces might be incomplete.\n");
+  }
+#endif
+
   env->SetLongField(this_obj, p_ps_prochandle_ID, (jlong)(intptr_t)ph);
   fillThreadsAndLoadObjects(env, this_obj, ph);
 }
diff --git a/src/jdk.hotspot.agent/linux/native/libsaproc/dwarf.cpp b/src/jdk.hotspot.agent/linux/native/libsaproc/dwarf.cpp
index 459e3cc57e9..28eb92a285f 100644
--- a/src/jdk.hotspot.agent/linux/native/libsaproc/dwarf.cpp
+++ b/src/jdk.hotspot.agent/linux/native/libsaproc/dwarf.cpp
@@ -217,6 +217,20 @@ void DwarfParser::parse_dwarf_instructions(uintptr_t begin, uintptr_t pc, const
         _state.offset_from_cfa[reg] = _initial_state.offset_from_cfa[reg];
         break;
       }
+#ifdef __aarch64__
+      // SA hasn't yet supported Pointer Authetication Code (PAC), so following
+      // instructions would be ignored with warning message.
+      //   https://github.com/ARM-software/abi-aa/blob/2025Q4/aadwarf64/aadwarf64.rst
+      case 0x2d: // DW_CFA_AARCH64_negate_ra_state
+        print_debug("DWARF: DW_CFA_AARCH64_negate_ra_state is unimplemented.\n", op);
+        break;
+      case 0x2c: // DW_CFA_AARCH64_negate_ra_state_with_pc
+        print_debug("DWARF: DW_CFA_AARCH64_negate_ra_state_with_pc is unimplemented.\n", op);
+        break;
+      case 0x2b: // DW_CFA_AARCH64_set_ra_state
+        print_debug("DWARF: DW_CFA_AARCH64_set_ra_state is unimplemented.\n", op);
+        break;
+#endif
       default:
         print_debug("DWARF: Unknown opcode: 0x%x\n", op);
         return;
diff --git a/src/jdk.hotspot.agent/linux/native/libsaproc/dwarf.hpp b/src/jdk.hotspot.agent/linux/native/libsaproc/dwarf.hpp
index 0a38c9a0f2e..2bfdba65a78 100644
--- a/src/jdk.hotspot.agent/linux/native/libsaproc/dwarf.hpp
+++ b/src/jdk.hotspot.agent/linux/native/libsaproc/dwarf.hpp
@@ -30,30 +30,21 @@
 
 #include "libproc_impl.h"
 
-/*
- * from System V Application Binary Interface
- *        AMD64 Architecture Processor Supplement
- *          Figure 3.38: DWARF Register Number Mapping
- * https://software.intel.com/sites/default/files/article/402129/mpx-linux64-abi.pdf
- */
+#ifdef __x86_64__
+#include "dwarf_regs_amd64.h"
+#elif defined(__aarch64__)
+#include "dwarf_regs_aarch64.h"
+#endif
+
 enum DWARF_Register {
-  RAX,
-  RDX,
-  RCX,
-  RBX,
-  RSI,
-  RDI,
-  RBP,
-  RSP,
-  R8,
-  R9,
-  R10,
-  R11,
-  R12,
-  R13,
-  R14,
-  R15,
-  RA,
+// DWARF_REG macro is used by DWARF_REGLIST and DWARF_PSEUDO_REGLIST.
+#define DWARF_REG(reg, no) \
+  reg = no,
+
+  DWARF_REGLIST
+  DWARF_PSEUDO_REGLIST
+
+#undef DWARF_REG
   MAX_VALUE
 };
 
@@ -94,6 +85,7 @@ class DwarfParser {
     bool process_dwarf(const uintptr_t pc);
     enum DWARF_Register get_cfa_register() { return _state.cfa_reg; }
     int get_cfa_offset() { return _state.cfa_offset; }
+    enum DWARF_Register get_ra_register() { return _state.return_address_reg; }
     int get_offset_from_cfa(enum DWARF_Register reg) { return _state.offset_from_cfa[reg]; }
 
     bool is_in(long pc) {
diff --git a/src/jdk.hotspot.agent/linux/native/libsaproc/dwarf_regs_aarch64.h b/src/jdk.hotspot.agent/linux/native/libsaproc/dwarf_regs_aarch64.h
new file mode 100644
index 00000000000..5a95e9405e1
--- /dev/null
+++ b/src/jdk.hotspot.agent/linux/native/libsaproc/dwarf_regs_aarch64.h
@@ -0,0 +1,78 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2026, NTT DATA.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ *
+ */
+
+#ifndef DWARF_REGS_AARCH64_H
+#define DWARF_REGS_AARCH64_H
+
+#define THREAD_CONTEXT_CLASS "sun/jvm/hotspot/debugger/aarch64/AARCH64ThreadContext"
+
+/*
+ * from DWARF for the Arm (R) 64-bit Architecture (AArch64)
+ *   https://github.com/ARM-software/abi-aa/blob/2025Q4/aadwarf64/aadwarf64.rst
+ *       4.1 DWARF register names
+ */
+#define DWARF_REGLIST \
+  DWARF_REG(R0,   0) \
+  DWARF_REG(R1,   1) \
+  DWARF_REG(R2,   2) \
+  DWARF_REG(R3,   3) \
+  DWARF_REG(R4,   4) \
+  DWARF_REG(R5,   5) \
+  DWARF_REG(R6,   6) \
+  DWARF_REG(R7,   7) \
+  DWARF_REG(R8,   8) \
+  DWARF_REG(R9,   9) \
+  DWARF_REG(R10, 10) \
+  DWARF_REG(R11, 11) \
+  DWARF_REG(R12, 12) \
+  DWARF_REG(R13, 13) \
+  DWARF_REG(R14, 14) \
+  DWARF_REG(R15, 15) \
+  DWARF_REG(R16, 16) \
+  DWARF_REG(R17, 17) \
+  DWARF_REG(R18, 18) \
+  DWARF_REG(R19, 19) \
+  DWARF_REG(R20, 20) \
+  DWARF_REG(R21, 21) \
+  DWARF_REG(R22, 22) \
+  DWARF_REG(R23, 23) \
+  DWARF_REG(R24, 24) \
+  DWARF_REG(R25, 25) \
+  DWARF_REG(R26, 26) \
+  DWARF_REG(R27, 27) \
+  DWARF_REG(R28, 28) \
+  DWARF_REG(FP,  29) \
+  DWARF_REG(LR,  30) \
+  DWARF_REG(SP,  31) \
+  DWARF_REG(PC,  32)
+
+// RA_SIGN_STATE might be needed in future to handle PAC.
+#define DWARF_PSEUDO_REGLIST
+
+/* Aliases */
+#define BP FP
+#define RA LR
+
+#endif
diff --git a/src/jdk.hotspot.agent/linux/native/libsaproc/dwarf_regs_amd64.h b/src/jdk.hotspot.agent/linux/native/libsaproc/dwarf_regs_amd64.h
new file mode 100644
index 00000000000..8226bc0864c
--- /dev/null
+++ b/src/jdk.hotspot.agent/linux/native/libsaproc/dwarf_regs_amd64.h
@@ -0,0 +1,61 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2026, NTT DATA.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ *
+ */
+
+#ifndef DWARF_REGS_AMD64_H
+#define DWARF_REGS_AMD64_H
+
+#define THREAD_CONTEXT_CLASS "sun/jvm/hotspot/debugger/amd64/AMD64ThreadContext"
+
+/*
+ * from System V Application Binary Interface
+ *      AMD64 Architecture Processor Supplement
+ *   https://refspecs.linuxbase.org/elf/x86_64-abi-0.99.pdf
+ *       Figure 3.36: DWARF Register Number Mapping
+ */
+#define DWARF_REGLIST \
+  DWARF_REG(RAX,  0) \
+  DWARF_REG(RDX,  1) \
+  DWARF_REG(RCX,  2) \
+  DWARF_REG(RBX,  3) \
+  DWARF_REG(RSI,  4) \
+  DWARF_REG(RDI,  5) \
+  DWARF_REG(RBP,  6) \
+  DWARF_REG(RSP,  7) \
+  DWARF_REG(R8,   8) \
+  DWARF_REG(R9,   9) \
+  DWARF_REG(R10, 10) \
+  DWARF_REG(R11, 11) \
+  DWARF_REG(R12, 12) \
+  DWARF_REG(R13, 13) \
+  DWARF_REG(R14, 14) \
+  DWARF_REG(R15, 15)
+
+#define DWARF_PSEUDO_REGLIST \
+  DWARF_REG(RA,  16)
+
+/* Aliases */
+#define BP RBP
+
+#endif
diff --git a/src/jdk.hotspot.agent/linux/native/libsaproc/libproc.h b/src/jdk.hotspot.agent/linux/native/libsaproc/libproc.h
index a69496e77a4..c584131e285 100644
--- a/src/jdk.hotspot.agent/linux/native/libsaproc/libproc.h
+++ b/src/jdk.hotspot.agent/linux/native/libsaproc/libproc.h
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2022, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -119,6 +119,10 @@ struct ps_prochandle* get_proc_handle(JNIEnv* env, jobject this_obj);
 
 void throw_new_debugger_exception(JNIEnv* env, const char* errMsg);
 
+#ifdef __aarch64__
+bool pac_enabled(struct ps_prochandle* ph);
+#endif
+
 #ifdef __cplusplus
 }
 #endif
diff --git a/src/jdk.hotspot.agent/linux/native/libsaproc/libproc_impl.c b/src/jdk.hotspot.agent/linux/native/libsaproc/libproc_impl.c
index 029aac1f107..815902045cf 100644
--- a/src/jdk.hotspot.agent/linux/native/libsaproc/libproc_impl.c
+++ b/src/jdk.hotspot.agent/linux/native/libsaproc/libproc_impl.c
@@ -478,6 +478,12 @@ struct lib_info *find_lib_by_address(struct ps_prochandle* ph, uintptr_t pc) {
   return NULL;
 }
 
+#ifdef __aarch64__
+bool pac_enabled(struct ps_prochandle* ph) {
+  return ph->pac_enabled;
+}
+#endif
+
 //--------------------------------------------------------------------------
 // proc service functions
 
diff --git a/src/jdk.hotspot.agent/linux/native/libsaproc/libproc_impl.h b/src/jdk.hotspot.agent/linux/native/libsaproc/libproc_impl.h
index 62b1b4d0d6b..d5aa74e73ad 100644
--- a/src/jdk.hotspot.agent/linux/native/libsaproc/libproc_impl.h
+++ b/src/jdk.hotspot.agent/linux/native/libsaproc/libproc_impl.h
@@ -115,6 +115,10 @@ struct ps_prochandle {
    int                num_threads;
    thread_info*       threads;   // head of thread list
    struct core_data*  core;      // data only used for core dumps, NULL for process
+#ifdef __aarch64__
+   // true if the HWCAP_PACA variant of Pointer Authentication Code (PAC) is enabled.
+   bool               pac_enabled;
+#endif
 };
 
 #ifdef __cplusplus
diff --git a/src/jdk.hotspot.agent/linux/native/libsaproc/ps_core.c b/src/jdk.hotspot.agent/linux/native/libsaproc/ps_core.c
index 6298f569aaf..c500360f39d 100644
--- a/src/jdk.hotspot.agent/linux/native/libsaproc/ps_core.c
+++ b/src/jdk.hotspot.agent/linux/native/libsaproc/ps_core.c
@@ -39,6 +39,12 @@
 #include "proc_service.h"
 #include "salibelf.h"
 
+// HWCAP_PACA was introduced in glibc 2.30
+// https://sourceware.org/git/?p=glibc.git;a=commit;h=a2e57f89a35e6056c9488428e68c4889e114ef71
+#if defined(__aarch64__) && !defined(HWCAP_PACA)
+#define HWCAP_PACA (1 << 30)
+#endif
+
 // This file has the libproc implementation to read core files.
 // For live processes, refer to ps_proc.c. Portions of this is adapted
 // /modelled after Solaris libproc.so (in particular Pcore.c)
@@ -290,6 +296,10 @@ static bool core_handle_note(struct ps_prochandle* ph, ELF_PHDR* note_phdr) {
             break;
           } else if (auxv->a_type == AT_SYSINFO_EHDR) {
             ph->core->vdso_addr = auxv->a_un.a_val;
+#ifdef __aarch64__
+          } else if (auxv->a_type == AT_HWCAP) {
+            ph->pac_enabled = auxv->a_un.a_val & HWCAP_PACA;
+#endif
           }
           auxv++;
         }
@@ -610,23 +620,38 @@ static uintptr_t calc_prelinked_load_address(struct ps_prochandle* ph, int lib_f
   return load_addr;
 }
 
+static int handle_vdso_internal(struct ps_prochandle* ph, char* vdso_name, char* lib_name, size_t lib_name_len) {
+  int lib_fd;
+  struct utsname uts;
+  uname(&uts);
+
+  char *vdso_path = (char*)malloc(lib_name_len);
+  snprintf(vdso_path, lib_name_len, "/lib/modules/%s/vdso/%s", uts.release, vdso_name);
+  print_debug("Try to open vDSO: %s\n", vdso_path);
+  lib_fd = pathmap_open(vdso_path);
+  if (lib_fd != -1) {
+    print_debug("replace vDSO: %s -> %s\n", lib_name, vdso_path);
+    strncpy(lib_name, vdso_path, lib_name_len);
+  }
+
+  free(vdso_path);
+  return lib_fd;
+}
+
 // Check for vDSO binary in kernel directory (/lib/modules/<version>/vdso),
 // rewrite the given lib_name string if found.
 // Otherwise copy vDSO memory in coredump to temporal file generated by tmpfile().
 // Returns FD for vDSO (should be closed by caller), or -1 on error.
 static int handle_vdso(struct ps_prochandle* ph, char* lib_name, size_t lib_name_len) {
   int lib_fd;
-  struct utsname uts;
-  uname(&uts);
 
   // Check vDSO binary first (for referring debuginfo if possible).
-  char *vdso_path = (char*)malloc(lib_name_len);
-  snprintf(vdso_path, lib_name_len, "/lib/modules/%s/vdso/vdso64.so", uts.release);
-  lib_fd = pathmap_open(vdso_path);
-  if (lib_fd != -1) {
-    print_debug("replace vDSO: %s -> %s\n", lib_name, vdso_path);
-    strncpy(lib_name, vdso_path, lib_name_len);
-  } else {
+  lib_fd = handle_vdso_internal(ph, "vdso64.so", lib_name, lib_name_len);
+  if (lib_fd == -1) {
+    // Try again with vdso.so
+    lib_fd = handle_vdso_internal(ph, "vdso.so", lib_name, lib_name_len);
+  }
+  if (lib_fd == -1) {
     // Copy vDSO memory segment from core to temporal memory
     // if vDSO binary is not available.
     FILE* tmpf = tmpfile();
@@ -644,7 +669,6 @@ static int handle_vdso(struct ps_prochandle* ph, char* lib_name, size_t lib_name
     }
   }
 
-  free(vdso_path);
   return lib_fd;
 }
 
diff --git a/src/jdk.hotspot.agent/linux/native/libsaproc/ps_proc.c b/src/jdk.hotspot.agent/linux/native/libsaproc/ps_proc.c
index fdaa30c3f5d..9cbde7319f0 100644
--- a/src/jdk.hotspot.agent/linux/native/libsaproc/ps_proc.c
+++ b/src/jdk.hotspot.agent/linux/native/libsaproc/ps_proc.c
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -36,6 +36,17 @@
 #include <sys/uio.h>
 #include "libproc_impl.h"
 
+#ifdef __aarch64__
+#include <sys/auxv.h>
+
+// HWCAP_PACA was introduced in glibc 2.30
+// https://sourceware.org/git/?p=glibc.git;a=commit;h=a2e57f89a35e6056c9488428e68c4889e114ef71
+#ifndef HWCAP_PACA
+#define HWCAP_PACA (1 << 30)
+#endif
+
+#endif
+
 #if defined(x86_64) && !defined(amd64)
 #define amd64 1
 #endif
@@ -460,6 +471,10 @@ Pgrab(pid_t pid, char* err_buf, size_t err_buf_len) {
     return NULL;
   }
 
+#ifdef __aarch64__
+  ph->pac_enabled = HWCAP_PACA & getauxval(AT_HWCAP);
+#endif
+
   // initialize ps_prochandle
   ph->pid = pid;
   if (add_thread_info(ph, ph->pid) == NULL) {
diff --git a/src/jdk.hotspot.agent/linux/native/libsaproc/symtab.c b/src/jdk.hotspot.agent/linux/native/libsaproc/symtab.c
index c8f3fb2ed4c..8f8ce28be1e 100644
--- a/src/jdk.hotspot.agent/linux/native/libsaproc/symtab.c
+++ b/src/jdk.hotspot.agent/linux/native/libsaproc/symtab.c
@@ -417,10 +417,14 @@ static struct symtab* build_symtab_internal(int fd, const char *filename, bool t
         uintptr_t sym_value;
         char *sym_name = symtab->strs + syms->st_name;
 
-        // skip non-object and non-function symbols
+        // skip non-object and non-function symbols, but STT_NOTYPE is allowed for
+        // signal trampoline.
         int st_type = ELF_ST_TYPE(syms->st_info);
-        if ( st_type != STT_FUNC && st_type != STT_OBJECT)
+        if (st_type != STT_FUNC &&
+            st_type != STT_OBJECT &&
+            st_type != STT_NOTYPE) {
            continue;
+        }
         // skip empty strings and undefined symbols
         if (*sym_name == '\0' || syms->st_shndx == SHN_UNDEF) continue;
 
diff --git a/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/debugger/cdbg/CFrame.java b/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/debugger/cdbg/CFrame.java
index bc366ef02b5..86f9e990af8 100644
--- a/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/debugger/cdbg/CFrame.java
+++ b/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/debugger/cdbg/CFrame.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2001, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2001, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -39,7 +39,7 @@ public interface CFrame {
   public CFrame sender(ThreadProxy th);
 
   /** Find sender frame with given FP and PC */
-  public default CFrame sender(ThreadProxy th, Address sp, Address fp, Address pc) {
+  public default CFrame sender(ThreadProxy th, Address senderSP, Address senderFP, Address senderPC) {
     return sender(th);
   }
 
diff --git a/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/debugger/linux/DwarfCFrame.java b/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/debugger/linux/DwarfCFrame.java
new file mode 100644
index 00000000000..7baa399ea75
--- /dev/null
+++ b/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/debugger/linux/DwarfCFrame.java
@@ -0,0 +1,187 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2026, NTT DATA.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ *
+ */
+
+package sun.jvm.hotspot.debugger.linux;
+
+import sun.jvm.hotspot.debugger.Address;
+import sun.jvm.hotspot.debugger.ThreadProxy;
+import sun.jvm.hotspot.debugger.UnalignedAddressException;
+import sun.jvm.hotspot.debugger.UnmappedAddressException;
+import sun.jvm.hotspot.debugger.cdbg.CFrame;
+import sun.jvm.hotspot.debugger.cdbg.ClosestSymbol;
+import sun.jvm.hotspot.debugger.cdbg.basic.BasicCFrame;
+import sun.jvm.hotspot.runtime.VM;
+
+public class DwarfCFrame extends BasicCFrame {
+
+    private Address sp;
+    private Address fp;
+    private Address pc;
+    private Address cfa;
+    private LinuxDebugger linuxDbg;
+    private DwarfParser dwarf;
+    private boolean use1ByteBeforeToLookup;
+
+    /**
+     * @return DwarfParser instance for the PC, null if native library relates to the pc not found.
+     * @throws DebuggerException if DWARF processing is failed.
+     *         For example: pc is not covered in this DWARF, Common Information Entry (CIE) has
+     *         language personality routine and/or Language Data Area (LSDA).
+     */
+    protected static DwarfParser createDwarfParser(LinuxDebugger linuxDbg, Address pc) {
+        Address libptr = linuxDbg.findLibPtrByAddress(pc);
+        if (libptr != null) {
+            DwarfParser dwarf = new DwarfParser(libptr);
+            dwarf.processDwarf(pc);
+            return dwarf;
+        }
+        return null;
+    }
+
+    protected DwarfCFrame(LinuxDebugger linuxDbg, Address sp, Address fp, Address cfa, Address pc, DwarfParser dwarf) {
+        this(linuxDbg, sp, fp, cfa, pc, dwarf, false);
+    }
+
+    protected DwarfCFrame(LinuxDebugger linuxDbg, Address sp, Address fp, Address cfa, Address pc, DwarfParser dwarf, boolean use1ByteBeforeToLookup) {
+        super(linuxDbg.getCDebugger());
+        this.sp = sp;
+        this.fp = fp;
+        this.cfa = cfa;
+        this.pc = pc;
+        this.linuxDbg = linuxDbg;
+        this.dwarf = dwarf;
+        this.use1ByteBeforeToLookup = use1ByteBeforeToLookup;
+    }
+
+    public Address sp() {
+        return sp;
+    }
+
+    public Address fp() {
+        return fp;
+    }
+
+    public Address pc() {
+        return pc;
+    }
+
+    public LinuxDebugger linuxDbg() {
+        return linuxDbg;
+    }
+
+    public DwarfParser dwarf() {
+        return dwarf;
+    }
+
+    // override base class impl to avoid ELF parsing
+    @Override
+    public ClosestSymbol closestSymbolToPC() {
+        Address symAddr = use1ByteBeforeToLookup ? pc.addOffsetTo(-1) : pc;
+        var sym = linuxDbg.lookup(linuxDbg.getAddressValue(symAddr));
+
+        // Returns a special symbol if the address is signal trampoline,
+        // otherwise returns closest symbol generated by LinuxDebugger.
+        return linuxDbg.isSignalTrampoline(symAddr)
+            ? new ClosestSymbol(sym.getName() + " <signal trampoline>", 0)
+            : sym;
+    }
+
+    @Override
+    public Address localVariableBase() {
+        return (dwarf != null && dwarf.isBPOffsetAvailable())
+            ? cfa.addOffsetTo(dwarf.getBasePointerOffsetFromCFA())
+            : fp;
+    }
+
+    protected boolean isValidFrame(Address senderCFA, Address senderFP) {
+        // Both CFA and FP must not be null.
+        if (senderCFA == null && senderFP == null) {
+            return false;
+        }
+
+        // FP must not be null if CFA is null - it happens between Java frame and Native frame.
+        // We cannot validate FP value because it might be used as GPR. Thus returns true
+        // if FP is not null.
+        if (senderCFA == null && senderFP != null) {
+            return true;
+        }
+
+        // senderCFA must be greater than current CFA.
+        if (senderCFA != null && senderCFA.greaterThanOrEqual(cfa)) {
+            return true;
+        }
+
+        // Otherwise, the frame is not valid.
+        return false;
+    }
+
+    protected Address getSenderPC(Address senderPC) {
+        if (senderPC != null) {
+            return senderPC;
+        }
+
+        try {
+            return dwarf == null
+                ? fp.getAddressAt(VM.getVM().getAddressSize()) // Current frame is Java
+                : cfa.getAddressAt(dwarf.getReturnAddressOffsetFromCFA()); // current frame is Native
+        } catch (UnmappedAddressException | UnalignedAddressException _) {
+            // Sender PC is invalid - maybe bottom of stack
+            return null;
+        }
+    }
+
+    protected Address getSenderSP(Address senderSP) {
+        if (senderSP != null) {
+            return senderSP;
+        } else if (dwarf == null) {
+            // Current frame is Java - skip saved BP and RA
+            return fp.addOffsetTo(2 * VM.getVM().getAddressSize());
+        } else {
+            // Current frame is Native
+            // CFA points SP at the call site in the previous frame.
+            // See 6.4 Call Frame Information in DWARF Debugging Information Format
+            //   https://dwarfstd.org/dwarf4std.html
+            return cfa;
+        }
+    }
+
+    protected Address getSenderFP(Address senderFP) {
+        if (senderFP != null) {
+            return senderFP;
+        } else if (dwarf == null) { // Current frame is Java
+            return fp.getAddressAt(0);
+        } else { // Current frame is Native
+            return dwarf.isBPOffsetAvailable()
+                ? cfa.getAddressAt(dwarf.getBasePointerOffsetFromCFA())
+                : fp;
+        }
+    }
+
+    @Override
+    public CFrame sender(ThreadProxy th) {
+        return sender(th, null, null, null);
+    }
+
+}
diff --git a/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/debugger/linux/amd64/DwarfParser.java b/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/debugger/linux/DwarfParser.java
similarity index 95%
rename from src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/debugger/linux/amd64/DwarfParser.java
rename to src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/debugger/linux/DwarfParser.java
index 53351c918d3..3e8099cf75b 100644
--- a/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/debugger/linux/amd64/DwarfParser.java
+++ b/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/debugger/linux/DwarfParser.java
@@ -23,7 +23,7 @@
  *
  */
 
-package sun.jvm.hotspot.debugger.linux.amd64;
+package sun.jvm.hotspot.debugger.linux;
 
 import java.lang.ref.Cleaner;
 import sun.jvm.hotspot.debugger.Address;
@@ -75,6 +75,8 @@ public class DwarfParser {
 
   public native int getCFARegister();
   public native int getCFAOffset();
+  public native int getOffsetFromCFA(int sareg);
+  public native int getRARegister();
   public native int getReturnAddressOffsetFromCFA();
   public native int getBasePointerOffsetFromCFA();
 }
diff --git a/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/debugger/linux/LinuxCDebugger.java b/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/debugger/linux/LinuxCDebugger.java
index 15f6615421c..57ba419aa9d 100644
--- a/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/debugger/linux/LinuxCDebugger.java
+++ b/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/debugger/linux/LinuxCDebugger.java
@@ -91,13 +91,7 @@ class LinuxCDebugger implements CDebugger {
         return new LinuxPPC64CFrame(dbg, sp, pc, LinuxDebuggerLocal.getAddressSize());
     } else if (cpu.equals("aarch64")) {
        AARCH64ThreadContext context = (AARCH64ThreadContext) thread.getContext();
-       Address sp = context.getRegisterAsAddress(AARCH64ThreadContext.SP);
-       if (sp == null) return null;
-       Address fp = context.getRegisterAsAddress(AARCH64ThreadContext.FP);
-       if (fp == null) return null;
-       Address pc  = context.getRegisterAsAddress(AARCH64ThreadContext.PC);
-       if (pc == null) return null;
-       return new LinuxAARCH64CFrame(dbg, sp, fp, pc);
+       return LinuxAARCH64CFrame.getTopFrame(dbg, context);
     } else if (cpu.equals("riscv64")) {
        RISCV64ThreadContext context = (RISCV64ThreadContext) thread.getContext();
        Address sp = context.getRegisterAsAddress(RISCV64ThreadContext.SP);
diff --git a/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/debugger/linux/LinuxDebugger.java b/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/debugger/linux/LinuxDebugger.java
index a53b8a0a282..c09af9881dd 100644
--- a/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/debugger/linux/LinuxDebugger.java
+++ b/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/debugger/linux/LinuxDebugger.java
@@ -33,12 +33,17 @@ import sun.jvm.hotspot.debugger.cdbg.*;
     by the architecture-specific subpackages. */
 
 public interface LinuxDebugger extends JVMDebugger {
-  // SIGHANDLER_NAMES holds the name of signal handler.
-  public static final List<String> SIGHANDLER_NAMES = List.of(
+  // SIGTRAMP_NAMES holds the name of signal trampoline.
+  public static final List<String> SIGTRAMP_NAMES = List.of(
     // For AMD64
     //   - sysdeps/unix/sysv/linux/x86_64/libc_sigaction.c in glibc
     //   - gdb/amd64-linux-tdep.c in GDB
-    "__restore_rt"
+    "__restore_rt",
+
+    // For AArch64
+    //   - arch/arm64/kernel/vdso/vdso.lds.S in Linux kernel
+    "__kernel_rt_sigreturn",
+    "VDSO_sigtramp"
   );
 
   public String       addressValueToString(long address) throws DebuggerException;
diff --git a/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/debugger/linux/LinuxDebuggerLocal.java b/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/debugger/linux/LinuxDebuggerLocal.java
index 9a75511e44d..856981bb73c 100644
--- a/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/debugger/linux/LinuxDebuggerLocal.java
+++ b/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/debugger/linux/LinuxDebuggerLocal.java
@@ -133,7 +133,7 @@ public class LinuxDebuggerLocal extends DebuggerBase implements LinuxDebugger {
     @Override
     public boolean isSignalTrampoline(Address pc) {
       var sym = lookup(getAddressValue(pc));
-      return sym == null ? false : SIGHANDLER_NAMES.contains(sym.getName());
+      return sym == null ? false : SIGTRAMP_NAMES.contains(sym.getName());
     }
 
     // Note on Linux threads are really processes. When target process is
diff --git a/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/debugger/linux/aarch64/LinuxAARCH64CFrame.java b/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/debugger/linux/aarch64/LinuxAARCH64CFrame.java
index 5f76e6308e9..c55aca2155c 100644
--- a/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/debugger/linux/aarch64/LinuxAARCH64CFrame.java
+++ b/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/debugger/linux/aarch64/LinuxAARCH64CFrame.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * Copyright (c) 2015, Red Hat Inc.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
@@ -25,73 +25,109 @@
 
 package sun.jvm.hotspot.debugger.linux.aarch64;
 
+import java.util.function.Function;
+
 import sun.jvm.hotspot.debugger.*;
 import sun.jvm.hotspot.debugger.aarch64.*;
 import sun.jvm.hotspot.debugger.linux.*;
 import sun.jvm.hotspot.debugger.cdbg.*;
-import sun.jvm.hotspot.debugger.cdbg.basic.*;
 import sun.jvm.hotspot.code.*;
 import sun.jvm.hotspot.runtime.*;
 import sun.jvm.hotspot.runtime.aarch64.*;
 
-public final class LinuxAARCH64CFrame extends BasicCFrame {
-   public LinuxAARCH64CFrame(LinuxDebugger dbg, Address sp, Address fp, Address pc) {
-      super(dbg.getCDebugger());
-      this.sp = sp;
-      this.fp = fp;
-      this.pc = pc;
-      this.dbg = dbg;
+public final class LinuxAARCH64CFrame extends DwarfCFrame {
+
+   private Address lr;
+
+   private static LinuxAARCH64CFrame getFrameFromReg(LinuxDebugger linuxDbg, Function<Integer, Address> getreg) {
+      Address pc = getreg.apply(AARCH64ThreadContext.PC);
+      Address sp = getreg.apply(AARCH64ThreadContext.SP);
+      Address fp = getreg.apply(AARCH64ThreadContext.FP);
+      Address lr = getreg.apply(AARCH64ThreadContext.LR);
+      Address cfa = null;
+      DwarfParser dwarf = createDwarfParser(linuxDbg, pc);
+
+      if (dwarf != null) { // Native frame
+        cfa = getreg.apply(dwarf.getCFARegister())
+                    .addOffsetTo(dwarf.getCFAOffset());
+      }
+
+      return (fp == null && cfa == null)
+        ? null
+        : new LinuxAARCH64CFrame(linuxDbg, sp, fp, cfa, pc, lr, dwarf);
    }
 
-   // override base class impl to avoid ELF parsing
-   public ClosestSymbol closestSymbolToPC() {
-      // try native lookup in debugger.
-      return dbg.lookup(dbg.getAddressValue(pc()));
+   public static LinuxAARCH64CFrame getTopFrame(LinuxDebugger linuxDbg, ThreadContext context) {
+      return getFrameFromReg(linuxDbg, context::getRegisterAsAddress);
    }
 
-   public Address pc() {
-      return pc;
+   private LinuxAARCH64CFrame(LinuxDebugger linuxDbg, Address sp, Address fp, Address cfa, Address pc, Address lr, DwarfParser dwarf) {
+      this(linuxDbg, sp, fp, cfa, pc, lr, dwarf, false);
    }
 
-   public Address localVariableBase() {
-      return fp;
+   private LinuxAARCH64CFrame(LinuxDebugger linuxDbg, Address sp, Address fp, Address cfa, Address pc, DwarfParser dwarf) {
+      this(linuxDbg, sp, fp, cfa, pc, null, dwarf, false);
    }
 
-   @Override
-   public CFrame sender(ThreadProxy thread) {
-      return sender(thread, null, null, null);
+   private LinuxAARCH64CFrame(LinuxDebugger linuxDbg, Address sp, Address fp, Address cfa, Address pc, DwarfParser dwarf, boolean use1ByteBeforeToLookup) {
+      this(linuxDbg, sp, fp, cfa, pc, null, dwarf, use1ByteBeforeToLookup);
    }
 
-   @Override
-   public CFrame sender(ThreadProxy thread, Address nextSP, Address nextFP, Address nextPC) {
-      // Check fp
-      // Skip if both nextFP and nextPC are given - do not need to load from fp.
-      if (nextFP == null && nextPC == null) {
-        if (fp == null) {
-          return null;
+   private LinuxAARCH64CFrame(LinuxDebugger linuxDbg, Address sp, Address fp, Address cfa, Address pc, Address lr, DwarfParser dwarf, boolean use1ByteBeforeToLookup) {
+      super(linuxDbg, sp, fp, cfa, pc, dwarf, use1ByteBeforeToLookup);
+
+      if (dwarf != null) {
+        // Prioritize to use RA from DWARF instead of LR
+        var senderPCFromDwarf = getSenderPC(null);
+        if (senderPCFromDwarf != null) {
+          lr = senderPCFromDwarf;
+        } else if (lr != null) {
+          // We should set passed lr to LR of this frame,
+          // but throws DebuggerException if lr is not used for RA.
+          var raReg = dwarf.getRARegister();
+          if (raReg != AARCH64ThreadContext.LR) {
+            throw new DebuggerException("Unexpected RA register: " + raReg);
+          }
         }
+      }
 
-        // Check alignment of fp
-        if (dbg.getAddressValue(fp) % (2 * ADDRESS_SIZE) != 0) {
+      this.lr = lr;
+   }
+
+   private Address getSenderCFA(DwarfParser senderDwarf, Address senderSP, Address senderFP) {
+     if (senderDwarf == null) { // Sender frame is Java
+       // CFA is not available on Java frame
+       return null;
+     }
+
+     // Sender frame is Native
+     int senderCFAReg = senderDwarf.getCFARegister();
+     return switch(senderCFAReg){
+       case AARCH64ThreadContext.FP -> senderFP.addOffsetTo(senderDwarf.getCFAOffset());
+       case AARCH64ThreadContext.SP -> senderSP.addOffsetTo(senderDwarf.getCFAOffset());
+       default -> throw new DebuggerException("Unsupported CFA register: " + senderCFAReg);
+     };
+   }
+
+   @Override
+   public CFrame sender(ThreadProxy thread, Address senderSP, Address senderFP, Address senderPC) {
+      if (linuxDbg().isSignalTrampoline(pc())) {
+        // SP points signal context
+        //   https://github.com/torvalds/linux/blob/v6.17/arch/arm64/kernel/signal.c#L1357
+        return getFrameFromReg(linuxDbg(), r -> LinuxAARCH64ThreadContext.getRegFromSignalTrampoline(sp(), r.intValue()));
+      }
+
+      if (senderPC == null) {
+        // Use getSenderPC() if current frame is Java because we cannot rely on lr in this case.
+        senderPC = dwarf() == null ? getSenderPC(null) : lr;
+        if (senderPC == null) {
           return null;
         }
       }
 
-      if (nextFP == null) {
-        nextFP = fp.getAddressAt(0 * ADDRESS_SIZE);
-      }
-      if (nextFP == null) {
-        return null;
-      }
+      senderFP = getSenderFP(senderFP);
 
-      if (nextPC == null) {
-        nextPC  = fp.getAddressAt(1 * ADDRESS_SIZE);
-      }
-      if (nextPC == null) {
-        return null;
-      }
-
-      if (nextSP == null) {
+      if (senderSP == null) {
         CodeCache cc = VM.getVM().getCodeCache();
         CodeBlob currentBlob = cc.findBlobUnsafe(pc());
 
@@ -99,29 +135,62 @@ public final class LinuxAARCH64CFrame extends BasicCFrame {
         if (currentBlob != null && (currentBlob.isContinuationStub() || currentBlob.isNativeMethod())) {
           // Use FP since it should always be valid for these cases.
           // TODO: These should be walked as Frames not CFrames.
-          nextSP = fp.addOffsetTo(2 * ADDRESS_SIZE);
+          senderSP = fp().addOffsetTo(2 * VM.getVM().getAddressSize());
         } else {
-          CodeBlob codeBlob = cc.findBlobUnsafe(nextPC);
+          CodeBlob codeBlob = cc.findBlobUnsafe(senderPC);
           boolean useCodeBlob = codeBlob != null && codeBlob.getFrameSize() > 0;
-          nextSP = useCodeBlob ? nextFP.addOffsetTo((2 * ADDRESS_SIZE) - codeBlob.getFrameSize()) : nextFP;
+          senderSP = useCodeBlob ? senderFP.addOffsetTo((2 * VM.getVM().getAddressSize()) - codeBlob.getFrameSize()) : getSenderSP(null);
         }
       }
-      if (nextSP == null) {
+      if (senderSP == null) {
         return null;
       }
 
-      return new LinuxAARCH64CFrame(dbg, nextSP, nextFP, nextPC);
+      DwarfParser senderDwarf = null;
+      boolean fallback = false;
+      try {
+        senderDwarf = createDwarfParser(linuxDbg(), senderPC);
+      } catch (DebuggerException _) {
+        // Try again with PC-1 in case PC is just outside function bounds,
+        // due to function ending with a `call` instruction.
+        try {
+          senderDwarf = createDwarfParser(linuxDbg(), senderPC.addOffsetTo(-1));
+          fallback = true;
+        } catch (DebuggerException _) {
+          if (linuxDbg().isSignalTrampoline(senderPC)) {
+            // We can use the caller frame if it is a signal trampoline.
+            // DWARF processing might fail because vdso.so .eh_frame is not required on aarch64.
+            return new LinuxAARCH64CFrame(linuxDbg(), senderSP, senderFP, null, senderPC, senderDwarf);
+          }
+
+          // DWARF processing should succeed when the frame is native
+          // but it might fail if Common Information Entry (CIE) has language
+          // personality routine and/or Language Specific Data Area (LSDA).
+          return null;
+        }
+      }
+
+      try {
+        Address senderCFA = getSenderCFA(senderDwarf, senderSP, senderFP);
+        return isValidFrame(senderCFA, senderFP)
+          ? new LinuxAARCH64CFrame(linuxDbg(), senderSP, senderFP, senderCFA, senderPC, senderDwarf, fallback)
+          : null;
+      } catch (DebuggerException e) {
+        if (linuxDbg().isSignalTrampoline(senderPC)) {
+          // We can use the caller frame if it is a signal trampoline.
+          // getSenderCFA() might fail because DwarfParser cannot find out CFA register.
+          return new LinuxAARCH64CFrame(linuxDbg(), senderSP, senderFP, null, senderPC, senderDwarf, fallback);
+        }
+
+        // Rethrow the original exception if getSenderCFA() failed
+        // and the caller is not signal trampoline.
+        throw e;
+      }
    }
 
    @Override
    public Frame toFrame() {
-     return new AARCH64Frame(sp, fp, pc);
+     return new AARCH64Frame(sp(), fp(), pc());
    }
 
-   // package/class internals only
-   private static final int ADDRESS_SIZE = 8;
-   private Address pc;
-   private Address sp;
-   private Address fp;
-   private LinuxDebugger dbg;
 }
diff --git a/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/debugger/linux/aarch64/LinuxAARCH64ThreadContext.java b/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/debugger/linux/aarch64/LinuxAARCH64ThreadContext.java
index 77003168671..422ca001624 100644
--- a/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/debugger/linux/aarch64/LinuxAARCH64ThreadContext.java
+++ b/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/debugger/linux/aarch64/LinuxAARCH64ThreadContext.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * Copyright (c) 2015, Red Hat Inc.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
@@ -28,6 +28,7 @@ package sun.jvm.hotspot.debugger.linux.aarch64;
 import sun.jvm.hotspot.debugger.*;
 import sun.jvm.hotspot.debugger.aarch64.*;
 import sun.jvm.hotspot.debugger.linux.*;
+import sun.jvm.hotspot.runtime.*;
 
 public class LinuxAARCH64ThreadContext extends AARCH64ThreadContext {
   private LinuxDebugger debugger;
@@ -44,4 +45,24 @@ public class LinuxAARCH64ThreadContext extends AARCH64ThreadContext {
   public Address getRegisterAsAddress(int index) {
     return debugger.newAddress(getRegister(index));
   }
+
+  public static Address getRegFromSignalTrampoline(Address sp, int index) {
+    // ucontext_t locates at 2nd element of rt_sigframe.
+    // See definition of rt_sigframe in arch/arm/kernel/signal.h
+    // in Linux Kernel.
+    Address addrUContext = sp.addOffsetTo(128); // sizeof(siginfo_t) = 128
+    Address addrUCMContext = addrUContext.addOffsetTo(176); // offsetof(ucontext_t, uc_mcontext) = 176
+
+    Address ptrCallerSP = addrUCMContext.addOffsetTo(256); // offsetof(uc_mcontext, sp) = 256
+    Address ptrCallerPC = addrUCMContext.addOffsetTo(264); // offsetof(uc_mcontext, pc) = 264
+    Address ptrCallerRegs = addrUCMContext.addOffsetTo(8); // offsetof(uc_mcontext, regs) = 8
+
+    return switch(index) {
+      case AARCH64ThreadContext.FP -> ptrCallerRegs.getAddressAt(AARCH64ThreadContext.FP * VM.getVM().getAddressSize());
+      case AARCH64ThreadContext.LR -> ptrCallerRegs.getAddressAt(AARCH64ThreadContext.LR * VM.getVM().getAddressSize());
+      case AARCH64ThreadContext.SP -> ptrCallerSP.getAddressAt(0);
+      case AARCH64ThreadContext.PC -> ptrCallerPC.getAddressAt(0);
+      default -> throw new IllegalArgumentException("Unsupported register index: " + index);
+    };
+  }
 }
diff --git a/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/debugger/linux/amd64/LinuxAMD64CFrame.java b/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/debugger/linux/amd64/LinuxAMD64CFrame.java
index 4d3d9d5998d..e58e2facdd7 100644
--- a/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/debugger/linux/amd64/LinuxAMD64CFrame.java
+++ b/src/jdk.hotspot.agent/share/classes/sun/jvm/hotspot/debugger/linux/amd64/LinuxAMD64CFrame.java
@@ -29,181 +29,82 @@ import java.util.function.Function;
 import sun.jvm.hotspot.debugger.*;
 import sun.jvm.hotspot.debugger.amd64.*;
 import sun.jvm.hotspot.debugger.linux.*;
-import sun.jvm.hotspot.debugger.linux.amd64.*;
 import sun.jvm.hotspot.debugger.cdbg.*;
-import sun.jvm.hotspot.debugger.cdbg.basic.*;
 import sun.jvm.hotspot.runtime.*;
 import sun.jvm.hotspot.runtime.amd64.*;
 
-public final class LinuxAMD64CFrame extends BasicCFrame {
+public final class LinuxAMD64CFrame extends DwarfCFrame {
 
-   private static LinuxAMD64CFrame getFrameFromReg(LinuxDebugger dbg, Function<Integer, Address> getreg) {
+   private static LinuxAMD64CFrame getFrameFromReg(LinuxDebugger linuxDbg, Function<Integer, Address> getreg) {
       Address rip = getreg.apply(AMD64ThreadContext.RIP);
       Address rsp = getreg.apply(AMD64ThreadContext.RSP);
       Address rbp = getreg.apply(AMD64ThreadContext.RBP);
-      Address libptr = dbg.findLibPtrByAddress(rip);
       Address cfa = null;
-      DwarfParser dwarf = null;
-
-      if (libptr != null) { // Native frame
-        dwarf = new DwarfParser(libptr);
-        try {
-          dwarf.processDwarf(rip);
-        } catch (DebuggerException e) {
-          // DWARF processing should succeed when the frame is native
-          // but it might fail if Common Information Entry (CIE) has language
-          // personality routine and/or Language Specific Data Area (LSDA).
-          return new LinuxAMD64CFrame(dbg, rsp, rbp, cfa, rip, dwarf, true);
-        }
+      DwarfParser dwarf = createDwarfParser(linuxDbg, rip);
 
+      if (dwarf != null) { // Native frame
         cfa = getreg.apply(dwarf.getCFARegister())
                     .addOffsetTo(dwarf.getCFAOffset());
       }
 
       return (rbp == null && cfa == null)
         ? null
-        : new LinuxAMD64CFrame(dbg, rsp, rbp, cfa, rip, dwarf);
+        : new LinuxAMD64CFrame(linuxDbg, rsp, rbp, cfa, rip, dwarf);
    }
 
-   public static LinuxAMD64CFrame getTopFrame(LinuxDebugger dbg, ThreadContext context) {
-      return getFrameFromReg(dbg, context::getRegisterAsAddress);
+   public static LinuxAMD64CFrame getTopFrame(LinuxDebugger linuxDbg, ThreadContext context) {
+      return getFrameFromReg(linuxDbg, context::getRegisterAsAddress);
    }
 
-   private LinuxAMD64CFrame(LinuxDebugger dbg, Address rsp, Address rbp, Address cfa, Address rip, DwarfParser dwarf) {
-      this(dbg, rsp, rbp, cfa, rip, dwarf, false);
+   private LinuxAMD64CFrame(LinuxDebugger linuxDbg, Address rsp, Address rbp, Address cfa, Address rip, DwarfParser dwarf) {
+      this(linuxDbg, rsp, rbp, cfa, rip, dwarf, false);
    }
 
-   private LinuxAMD64CFrame(LinuxDebugger dbg, Address rsp, Address rbp, Address cfa, Address rip, DwarfParser dwarf, boolean use1ByteBeforeToLookup) {
-      super(dbg.getCDebugger());
-      this.rsp = rsp;
-      this.rbp = rbp;
-      this.cfa = cfa;
-      this.rip = rip;
-      this.dbg = dbg;
-      this.dwarf = dwarf;
-      this.use1ByteBeforeToLookup = use1ByteBeforeToLookup;
+   private LinuxAMD64CFrame(LinuxDebugger linuxDbg, Address rsp, Address rbp, Address cfa, Address rip, DwarfParser dwarf, boolean use1ByteBeforeToLookup) {
+      super(linuxDbg, rsp, rbp, cfa, rip, dwarf, use1ByteBeforeToLookup);
    }
 
-   // override base class impl to avoid ELF parsing
-   public ClosestSymbol closestSymbolToPC() {
-      Address symAddr = use1ByteBeforeToLookup ? pc().addOffsetTo(-1) : pc();
-      var sym = dbg.lookup(dbg.getAddressValue(symAddr));
-
-      // Returns a special symbol if the address is signal handler,
-      // otherwise returns closest symbol generated by LinuxDebugger.
-      return dbg.isSignalTrampoline(symAddr)
-        ? new ClosestSymbol(sym.getName() + " <signal trampoline>", 0)
-        : sym;
-   }
-
-   public Address pc() {
-      return rip;
-   }
-
-   public Address localVariableBase() {
-      return (dwarf != null && dwarf.isBPOffsetAvailable())
-        ? cfa.addOffsetTo(dwarf.getBasePointerOffsetFromCFA())
-        : rbp;
-   }
-
-   private Address getNextPC() {
-     try {
-       return dwarf == null
-         ? rbp.getAddressAt(ADDRESS_SIZE) // Java frame
-         : cfa.getAddressAt(dwarf.getReturnAddressOffsetFromCFA()); // Native frame
-     } catch (UnmappedAddressException | UnalignedAddressException e) {
-       return null;
-     }
-   }
-
-   private boolean isValidFrame(Address nextCFA, Address nextRBP) {
-     // Both CFA and RBP must not be null.
-     if (nextCFA == null && nextRBP == null) {
-       return false;
-     }
-
-     // RBP must not be null if CFA is null - it happens between Java frame and Native frame.
-     // We cannot validate RBP value because it might be used as GPR. Thus returns true
-     // if RBP is not null.
-     if (nextCFA == null && nextRBP != null) {
-       return true;
-     }
-
-     // nextCFA must be greater than current CFA.
-     if (nextCFA != null && nextCFA.greaterThanOrEqual(cfa)) {
-       return true;
-     }
-
-     // Otherwise, the frame is not valid.
-     return false;
-   }
-
-   private Address getNextRSP() {
-     return dwarf == null ? rbp.addOffsetTo(2 * ADDRESS_SIZE) // Java frame - skip saved BP and RA
-                          : cfa.addOffsetTo(dwarf.getReturnAddressOffsetFromCFA())
-                               .addOffsetTo(ADDRESS_SIZE); // Native frame
-   }
-
-   private Address getNextRBP(Address senderFP) {
-     if (senderFP != null) {
-       return senderFP;
-     } else if (dwarf == null) { // Current frame is Java
-       return rbp.getAddressAt(0);
-     } else { // Current frame is Native
-       return dwarf.isBPOffsetAvailable()
-         ? cfa.getAddressAt(dwarf.getBasePointerOffsetFromCFA())
-         : rbp;
-     }
-   }
-
-   private Address getNextCFA(DwarfParser nextDwarf, Address senderFP, Address senderPC) {
-     if (nextDwarf == null) { // Next frame is Java
+   private Address getSenderCFA(DwarfParser senderDwarf, Address senderSP, Address senderFP) {
+     if (senderDwarf == null) { // Sender frame is Java
        // CFA is not available on Java frame
        return null;
      }
 
-     // Next frame is Native
-     int nextCFAReg = nextDwarf.getCFARegister();
-     return switch(nextCFAReg){
-       case AMD64ThreadContext.RBP -> getNextRBP(senderFP).addOffsetTo(nextDwarf.getCFAOffset());
-       case AMD64ThreadContext.RSP -> getNextRSP().addOffsetTo(nextDwarf.getCFAOffset());
-       default -> throw new DebuggerException("Unsupported CFA register: " + nextCFAReg);
+     // Sender frame is Native
+     int senderCFAReg = senderDwarf.getCFARegister();
+     return switch(senderCFAReg){
+       case AMD64ThreadContext.RBP -> senderFP.addOffsetTo(senderDwarf.getCFAOffset());
+       case AMD64ThreadContext.RSP -> senderSP.addOffsetTo(senderDwarf.getCFAOffset());
+       default -> throw new DebuggerException("Unsupported CFA register: " + senderCFAReg);
      };
    }
 
    @Override
-   public CFrame sender(ThreadProxy th) {
-     return sender(th, null, null, null);
-   }
-
-   @Override
-   public CFrame sender(ThreadProxy th, Address sp, Address fp, Address pc) {
-     if (dbg.isSignalTrampoline(pc())) {
+   public CFrame sender(ThreadProxy th, Address senderSP, Address senderFP, Address senderPC) {
+     if (linuxDbg().isSignalTrampoline(pc())) {
        // RSP points signal context
        //   https://github.com/torvalds/linux/blob/v6.17/arch/x86/kernel/signal.c#L94
-       return getFrameFromReg(dbg, r -> LinuxAMD64ThreadContext.getRegFromSignalTrampoline(this.rsp, r.intValue()));
+       return getFrameFromReg(linuxDbg(), r -> LinuxAMD64ThreadContext.getRegFromSignalTrampoline(sp(), r.intValue()));
      }
 
-     ThreadContext context = th.getContext();
-
-     Address nextRSP = sp != null ? sp : getNextRSP();
-     if (nextRSP == null) {
+     senderSP = getSenderSP(senderSP);
+     if (senderSP == null) {
        return null;
      }
-     Address nextPC = pc != null ? pc : getNextPC();
-     if (nextPC == null) {
+     senderPC = getSenderPC(senderPC);
+     if (senderPC == null) {
        return null;
      }
 
-     DwarfParser nextDwarf = null;
+     DwarfParser senderDwarf = null;
      boolean fallback = false;
      try {
-       nextDwarf = createDwarfParser(nextPC);
+       senderDwarf = createDwarfParser(linuxDbg(), senderPC);
      } catch (DebuggerException _) {
-       // Try again with RIP-1 in case RIP is just outside function bounds,
+       // Try again with PC-1 in case PC is just outside function bounds,
        // due to function ending with a `call` instruction.
        try {
-         nextDwarf = createDwarfParser(nextPC.addOffsetTo(-1));
+         senderDwarf = createDwarfParser(linuxDbg(), senderPC.addOffsetTo(-1));
          fallback = true;
        } catch (DebuggerException _) {
          // DWARF processing should succeed when the frame is native
@@ -213,56 +114,29 @@ public final class LinuxAMD64CFrame extends BasicCFrame {
        }
      }
 
-     Address nextRBP = getNextRBP(fp);
+     senderFP = getSenderFP(senderFP);
 
      try {
-       Address nextCFA = getNextCFA(nextDwarf, fp, nextPC);
-       return isValidFrame(nextCFA, nextRBP)
-         ? new LinuxAMD64CFrame(dbg, nextRSP, nextRBP, nextCFA, nextPC, nextDwarf, fallback)
+       Address senderCFA = getSenderCFA(senderDwarf, senderSP, senderFP);
+       return isValidFrame(senderCFA, senderFP)
+         ? new LinuxAMD64CFrame(linuxDbg(), senderSP, senderFP, senderCFA, senderPC, senderDwarf, fallback)
          : null;
      } catch (DebuggerException e) {
-       if (dbg.isSignalTrampoline(nextPC)) {
-         // We can through the caller frame if it is signal trampoline.
-         // getNextCFA() might fail because DwarfParser cannot find out CFA register.
-         return new LinuxAMD64CFrame(dbg, nextRSP, nextRBP, null, nextPC, nextDwarf, fallback);
+       if (linuxDbg().isSignalTrampoline(senderPC)) {
+         // We can use the caller frame if it is a signal trampoline.
+         // getSenderCFA() might fail because DwarfParser cannot find out CFA register.
+         return new LinuxAMD64CFrame(linuxDbg(), senderSP, senderFP, null, senderPC, senderDwarf, fallback);
        }
 
-       // Rethrow the original exception if getNextCFA() failed
+       // Rethrow the original exception if getSenderCFA() failed
        // and the caller is not signal trampoline.
        throw e;
      }
    }
 
-   private DwarfParser createDwarfParser(Address pc) throws DebuggerException {
-     DwarfParser nextDwarf = null;
-     Address libptr = dbg.findLibPtrByAddress(pc);
-     if (libptr != null) {
-       try {
-         nextDwarf = new DwarfParser(libptr);
-       } catch (DebuggerException _) {
-         // Bail out to Java frame
-       }
-     }
-
-     if (nextDwarf != null) {
-       nextDwarf.processDwarf(pc);
-     }
-
-     return nextDwarf;
-   }
-
    @Override
    public Frame toFrame() {
-     return new AMD64Frame(rsp, localVariableBase(), rip);
+     return new AMD64Frame(sp(), localVariableBase(), pc());
    }
 
-   // package/class internals only
-   private static final int ADDRESS_SIZE = 8;
-   private Address rsp;
-   private Address rbp;
-   private Address rip;
-   private Address cfa;
-   private LinuxDebugger dbg;
-   private DwarfParser dwarf;
-   private boolean use1ByteBeforeToLookup;
 }
diff --git a/test/hotspot/jtreg/serviceability/sa/TestJhsdbJstackMixedWithXComp.java b/test/hotspot/jtreg/serviceability/sa/TestJhsdbJstackMixedWithXComp.java
index 1ebf6c21a70..a3880bc9f0e 100644
--- a/test/hotspot/jtreg/serviceability/sa/TestJhsdbJstackMixedWithXComp.java
+++ b/test/hotspot/jtreg/serviceability/sa/TestJhsdbJstackMixedWithXComp.java
@@ -38,7 +38,7 @@ import jdk.test.lib.process.OutputAnalyzer;
  * @requires vm.hasSA
  * @requires vm.gc != "Z"
  * @requires os.family == "linux"
- * @requires os.arch == "amd64"
+ * @requires (os.arch == "amd64") | (os.arch == "aarch64")
  * @library /test/lib
  * @run driver TestJhsdbJstackMixedWithXComp
  */
@@ -49,7 +49,7 @@ import jdk.test.lib.process.OutputAnalyzer;
  * @requires vm.hasSA
  * @requires vm.gc != "Z"
  * @requires os.family == "linux"
- * @requires os.arch == "amd64"
+ * @requires (os.arch == "amd64") | (os.arch == "aarch64")
  * @library /test/lib
  * @run driver TestJhsdbJstackMixedWithXComp -XX:+PreserveFramePointer
  */
@@ -60,7 +60,7 @@ import jdk.test.lib.process.OutputAnalyzer;
  * @requires vm.hasSA
  * @requires vm.gc != "Z"
  * @requires os.family == "linux"
- * @requires os.arch == "amd64"
+ * @requires (os.arch == "amd64") | (os.arch == "aarch64")
  * @library /test/lib
  * @run driver TestJhsdbJstackMixedWithXComp -XX:-TieredCompilation
  */

From d89bd4c9806a5893937950a27c8cf3aae352dce0 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Eirik=20Bj=C3=B8rsn=C3=B8s?= <eirbjo@openjdk.org>
Date: Fri, 10 Apr 2026 05:29:18 +0000
Subject: [PATCH 546/655] 8380542: ZipOutputStream.setComment and
 ZipEntry.setComment spec updates for rejecting unmappable characters and
 allowing null or empty comments

Reviewed-by: alanb, lancea, jpai
---
 .../share/classes/java/util/zip/ZipEntry.java |  7 ++-
 .../java/util/zip/ZipOutputStream.java        | 28 ++++++----
 .../UnmappableZipFileComment.java             | 56 +++++++++++++++++++
 3 files changed, 78 insertions(+), 13 deletions(-)
 create mode 100644 test/jdk/java/util/zip/ZipOutputStream/UnmappableZipFileComment.java

diff --git a/src/java.base/share/classes/java/util/zip/ZipEntry.java b/src/java.base/share/classes/java/util/zip/ZipEntry.java
index bf0bf55ff98..0206d2a5154 100644
--- a/src/java.base/share/classes/java/util/zip/ZipEntry.java
+++ b/src/java.base/share/classes/java/util/zip/ZipEntry.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1995, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1995, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -651,8 +651,9 @@ public class ZipEntry implements ZipConstants, Cloneable {
     }
 
     /**
-     * Sets the optional comment string for the entry.
-     * @param comment the comment string
+     * Sets the optional comment string for the entry. If {@code comment} is an
+     * empty string or {@code null} then the entry will have no comment.
+     * @param comment the comment string, or an empty string or null for no comment
      * @throws IllegalArgumentException if the combined length
      * of the specified entry comment, the {@linkplain #getName() entry name},
      * the {@linkplain #getExtra() extra field data}, and the
diff --git a/src/java.base/share/classes/java/util/zip/ZipOutputStream.java b/src/java.base/share/classes/java/util/zip/ZipOutputStream.java
index 4ea4a103fef..d79b0a1bd9c 100644
--- a/src/java.base/share/classes/java/util/zip/ZipOutputStream.java
+++ b/src/java.base/share/classes/java/util/zip/ZipOutputStream.java
@@ -43,6 +43,10 @@ import sun.nio.cs.UTF_8;
  * <p> Unless otherwise noted, passing a {@code null} argument to a constructor
  * or method in this class will cause a {@link NullPointerException} to be
  * thrown.
+ * <p> By default, the UTF-8 charset is used to encode entry names and comments.
+ * {@link #ZipOutputStream(OutputStream, Charset)} may be be used to specify
+ * an alternative charset.
+ *
  * @author      David Connelly
  * @since 1.1
  */
@@ -110,10 +114,8 @@ public class ZipOutputStream extends DeflaterOutputStream implements ZipConstant
     public static final int DEFLATED = ZipEntry.DEFLATED;
 
     /**
-     * Creates a new ZIP output stream.
-     *
-     * <p>The UTF-8 {@link java.nio.charset.Charset charset} is used
-     * to encode the entry names and comments.
+     * Creates a new ZIP output stream using the UTF-8
+     * {@link Charset charset} to encode entry names and comments.
      *
      * @param out the actual output stream
      */
@@ -122,12 +124,13 @@ public class ZipOutputStream extends DeflaterOutputStream implements ZipConstant
     }
 
     /**
-     * Creates a new ZIP output stream.
+     * Creates a new ZIP output stream using the specified
+     * {@link Charset charset} to encode entry names and comments.
      *
      * @param out the actual output stream
      *
      * @param charset the {@linkplain java.nio.charset.Charset charset}
-     *                to be used to encode the entry names and comments
+     *                to be used to encode entry names and comments
      *
      * @since 1.7
      */
@@ -140,10 +143,15 @@ public class ZipOutputStream extends DeflaterOutputStream implements ZipConstant
     }
 
     /**
-     * Sets the ZIP file comment.
-     * @param     comment the comment string
-     * @throws    IllegalArgumentException if the length of the specified
-     *            ZIP file comment is greater than 0xFFFF bytes
+     * Sets the ZIP file comment. If {@code comment} is an empty string or
+     * {@code null} then the output will have no ZIP file comment.
+     *
+     * @param     comment the comment string, or an empty string or null for no comment
+     *
+     * @throws    IllegalArgumentException if the length of the specified ZIP file
+     *            comment is greater than 0xFFFF bytes or if the {@code comment}
+     *            contains characters that cannot be mapped by the {@code Charset}
+     *            used to encode entry names and comments
      */
     public void setComment(String comment) {
         byte[] bytes = null;
diff --git a/test/jdk/java/util/zip/ZipOutputStream/UnmappableZipFileComment.java b/test/jdk/java/util/zip/ZipOutputStream/UnmappableZipFileComment.java
new file mode 100644
index 00000000000..5879ae1497a
--- /dev/null
+++ b/test/jdk/java/util/zip/ZipOutputStream/UnmappableZipFileComment.java
@@ -0,0 +1,56 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+import org.junit.jupiter.api.Test;
+
+import java.io.IOException;
+import java.nio.charset.Charset;
+import java.nio.charset.StandardCharsets;
+import java.util.zip.ZipOutputStream;
+
+import static java.io.OutputStream.nullOutputStream;
+import static org.junit.jupiter.api.Assertions.assertThrows;
+
+/* @test
+ * @bug 8380542
+ * @summary ZipOutputStream.setComment should throw IllegalArgumentException for unmappable characters in comment
+ * @run junit ${test.main.class}
+ */
+public class UnmappableZipFileComment {
+    /**
+     * Verify that calling ZipOutputStream.setComment with an unmappable
+     * comment is rejected with a IllegalArgumentException.
+     *
+     * @throws IOException if an unexpected IO error occurs
+     */
+    @Test
+    void rejectUnmappableZipFileComment() throws IOException {
+        // Charset used when creating the ZIP file
+         Charset charset = StandardCharsets.US_ASCII;
+        // 'ø' is an unmappable character in US_ASCII
+        String comment = "\u00f8";
+        try (var out = new ZipOutputStream(nullOutputStream(), charset)) {
+            assertThrows(IllegalArgumentException.class, () -> out.setComment(comment));
+        }
+    }
+}

From a0af250b429736f1016bff47fc3e9e3a3cf520b4 Mon Sep 17 00:00:00 2001
From: Ivan Walulya <iwalulya@openjdk.org>
Date: Fri, 10 Apr 2026 07:53:29 +0000
Subject: [PATCH 547/655] 8381006: G1: Wrong IHOP old gen allocation rate
 calculation in presence of periodic gcs

Reviewed-by: tschatzl, ayang
---
 src/hotspot/share/gc/g1/g1Policy.cpp | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/src/hotspot/share/gc/g1/g1Policy.cpp b/src/hotspot/share/gc/g1/g1Policy.cpp
index 5744bbc2f03..78a533d62c0 100644
--- a/src/hotspot/share/gc/g1/g1Policy.cpp
+++ b/src/hotspot/share/gc/g1/g1Policy.cpp
@@ -962,12 +962,12 @@ void G1Policy::record_young_collection_end(bool concurrent_operation_is_full_mar
 
   _free_regions_at_end_of_collection = _g1h->num_free_regions();
 
+  _old_gen_alloc_tracker.reset_after_gc(_g1h->humongous_regions_count() * G1HeapRegion::GrainBytes);
   // Do not update dynamic IHOP due to G1 periodic collection as it is highly likely
   // that in this case we are not running in a "normal" operating mode.
   if (_g1h->gc_cause() != GCCause::_g1_periodic_collection) {
     update_young_length_bounds();
 
-    _old_gen_alloc_tracker.reset_after_gc(_g1h->humongous_regions_count() * G1HeapRegion::GrainBytes);
     if (update_ihop_prediction(app_time_ms / 1000.0, is_young_only_pause)) {
       _ihop_control->report_statistics(_g1h->gc_tracer_stw(), _g1h->non_young_occupancy_after_allocation(allocation_word_size));
     }

From 8357de88aa35ee998fefe321ee6dae9eb4993fa6 Mon Sep 17 00:00:00 2001
From: Alexey Ivanov <aivanov@openjdk.org>
Date: Fri, 10 Apr 2026 13:07:00 +0000
Subject: [PATCH 548/655] 8334868: Ensure CheckUninstallModalHook is called in
 WPageDialogPeer._show

Ensure AwtDialog::CheckInstallModalHook and
AwtDialog::ModalActivateNextWindow are always called
after ::PageSetupDlg returns.

Reverse the condition of the if statement and
bail out if ::PageSetupDlg returns an error.

Remove the doIt flag and use explicit returns:
* JNI_FALSE if an error detected;
* JNI_TRUE  if the function reached its end
without errors.

Reviewed-by: dmarkov, prr
---
 .../native/libawt/windows/awt_PrintJob.cpp    | 169 +++++++++---------
 .../PrinterJob/PageDialogCancelTest.java      |   9 +-
 .../PrinterJob/PageDialogFormatTest.java      |  63 +++++++
 3 files changed, 152 insertions(+), 89 deletions(-)
 create mode 100644 test/jdk/java/awt/print/PrinterJob/PageDialogFormatTest.java

diff --git a/src/java.desktop/windows/native/libawt/windows/awt_PrintJob.cpp b/src/java.desktop/windows/native/libawt/windows/awt_PrintJob.cpp
index 8d016d8b39f..b18fa5a7e2c 100644
--- a/src/java.desktop/windows/native/libawt/windows/awt_PrintJob.cpp
+++ b/src/java.desktop/windows/native/libawt/windows/awt_PrintJob.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1996, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1996, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -522,7 +522,6 @@ Java_sun_awt_windows_WPageDialogPeer__1show(JNIEnv *env, jobject peer)
     AwtComponent *awtParent = (parent != NULL) ? (AwtComponent *)JNI_GET_PDATA(parent) : NULL;
     HWND hwndOwner = awtParent ? awtParent->GetHWnd() : NULL;
 
-    jboolean doIt = JNI_FALSE;
     PAGESETUPDLG setup;
     memset(&setup, 0, sizeof(setup));
 
@@ -578,7 +577,7 @@ Java_sun_awt_windows_WPageDialogPeer__1show(JNIEnv *env, jobject peer)
          */
         if ((setup.hDevMode == NULL) && (setup.hDevNames == NULL)) {
             CLEANUP_SHOW;
-            return doIt;
+            return JNI_FALSE;
         }
     } else {
         int measure = PSD_INTHOUSANDTHSOFINCHES;
@@ -606,7 +605,7 @@ Java_sun_awt_windows_WPageDialogPeer__1show(JNIEnv *env, jobject peer)
     pageFormatToSetup(env, self, page, &setup, AwtPrintControl::getPrintDC(env, self));
     if (env->ExceptionCheck()) {
         CLEANUP_SHOW;
-        return doIt;
+        return JNI_FALSE;
     }
 
     setup.lpfnPageSetupHook = reinterpret_cast<LPPAGESETUPHOOK>(pageDlgHook);
@@ -615,89 +614,91 @@ Java_sun_awt_windows_WPageDialogPeer__1show(JNIEnv *env, jobject peer)
     AwtDialog::CheckInstallModalHook();
 
     BOOL ret = ::PageSetupDlg(&setup);
-    if (ret) {
-
-        jobject paper = getPaper(env, page);
-        if (paper == NULL) {
-            CLEANUP_SHOW;
-            return doIt;
-        }
-        int units = setup.Flags & PSD_INTHOUSANDTHSOFINCHES ?
-                                                MM_HIENGLISH :
-                                                MM_HIMETRIC;
-        POINT paperSize;
-        RECT margins;
-        jint orientation;
-
-        /* The printer may have been changed, and we track that change,
-         * but then need to get a new DC for the current printer so that
-         * we validate the paper size correctly
-         */
-        if (setup.hDevNames != NULL) {
-            DEVNAMES* names = (DEVNAMES*)::GlobalLock(setup.hDevNames);
-            if (names != NULL) {
-                LPTSTR printer = (LPTSTR)names+names->wDeviceOffset;
-                SAVE_CONTROLWORD
-                HDC newDC = ::CreateDC(TEXT("WINSPOOL"), printer, NULL, NULL);
-                RESTORE_CONTROLWORD
-                if (newDC != NULL) {
-                    HDC oldDC = AwtPrintControl::getPrintDC(env, self);
-                    if (oldDC != NULL) {
-                         ::DeleteDC(oldDC);
-                    }
-                }
-                AwtPrintControl::setPrintDC(env, self, newDC);
-            }
-            ::GlobalUnlock(setup.hDevNames);
-        }
-
-        /* Get the Windows paper and margins description.
-        */
-        retrievePaperInfo(&setup, &paperSize, &margins, &orientation,
-                          AwtPrintControl::getPrintDC(env, self));
-
-        /* Convert the Windows' paper and margins description
-         * and place them into a Paper instance.
-         */
-        setPaperValues(env, paper, &paperSize, &margins, units);
-        if (env->ExceptionCheck()) {
-            CLEANUP_SHOW;
-            return doIt;
-         }
-        /*
-         * Put the updated Paper instance and the orientation into
-         * the PageFormat.
-         */
-        setPaper(env, page, paper);
-        if (env->ExceptionCheck()) {
-            CLEANUP_SHOW;
-            return doIt;
-        }
-        setPageFormatOrientation(env, page, orientation);
-        if (env->ExceptionCheck()) {
-            CLEANUP_SHOW;
-            return JNI_FALSE;
-        }
-        if (setup.hDevMode != NULL) {
-            DEVMODE *devmode = (DEVMODE *)::GlobalLock(setup.hDevMode);
-            if (devmode != NULL) {
-                if (devmode->dmFields & DM_PAPERSIZE) {
-                    jboolean err = setPrintPaperSize(env, self, devmode->dmPaperSize);
-                    if (err) {
-                        CLEANUP_SHOW;
-                        return doIt;
-                    }
-                }
-            }
-            ::GlobalUnlock(setup.hDevMode);
-        }
-        doIt = JNI_TRUE;
-    }
 
     AwtDialog::CheckUninstallModalHook();
-
     AwtDialog::ModalActivateNextWindow(NULL, target, peer);
 
+    if (!ret) {
+        CLEANUP_SHOW;
+        return JNI_FALSE;
+    }
+
+    jobject paper = getPaper(env, page);
+    if (paper == NULL) {
+        CLEANUP_SHOW;
+        return JNI_FALSE;
+    }
+    int units = setup.Flags & PSD_INTHOUSANDTHSOFINCHES ?
+                                            MM_HIENGLISH :
+                                            MM_HIMETRIC;
+    POINT paperSize;
+    RECT margins;
+    jint orientation;
+
+    /* The printer may have been changed, and we track that change,
+     * but then need to get a new DC for the current printer so that
+     * we validate the paper size correctly
+     */
+    if (setup.hDevNames != NULL) {
+        DEVNAMES* names = (DEVNAMES*)::GlobalLock(setup.hDevNames);
+        if (names != NULL) {
+            LPTSTR printer = (LPTSTR)names+names->wDeviceOffset;
+            SAVE_CONTROLWORD
+            HDC newDC = ::CreateDC(TEXT("WINSPOOL"), printer, NULL, NULL);
+            RESTORE_CONTROLWORD
+            if (newDC != NULL) {
+                HDC oldDC = AwtPrintControl::getPrintDC(env, self);
+                if (oldDC != NULL) {
+                     ::DeleteDC(oldDC);
+                }
+            }
+            AwtPrintControl::setPrintDC(env, self, newDC);
+        }
+        ::GlobalUnlock(setup.hDevNames);
+    }
+
+    /* Get the Windows paper and margins description.
+    */
+    retrievePaperInfo(&setup, &paperSize, &margins, &orientation,
+                      AwtPrintControl::getPrintDC(env, self));
+
+    /* Convert the Windows' paper and margins description
+     * and place them into a Paper instance.
+     */
+    setPaperValues(env, paper, &paperSize, &margins, units);
+    if (env->ExceptionCheck()) {
+        CLEANUP_SHOW;
+        return JNI_FALSE;
+     }
+    /*
+     * Put the updated Paper instance and the orientation into
+     * the PageFormat.
+     */
+    setPaper(env, page, paper);
+    if (env->ExceptionCheck()) {
+        CLEANUP_SHOW;
+        return JNI_FALSE;
+    }
+    setPageFormatOrientation(env, page, orientation);
+    if (env->ExceptionCheck()) {
+        CLEANUP_SHOW;
+        return JNI_FALSE;
+    }
+    if (setup.hDevMode != NULL) {
+        DEVMODE *devmode = (DEVMODE *)::GlobalLock(setup.hDevMode);
+        if (devmode != NULL) {
+            if (devmode->dmFields & DM_PAPERSIZE) {
+                jboolean err = setPrintPaperSize(env, self, devmode->dmPaperSize);
+                if (err) {
+                    ::GlobalUnlock(setup.hDevMode);
+                    CLEANUP_SHOW;
+                    return JNI_FALSE;
+                }
+            }
+        }
+        ::GlobalUnlock(setup.hDevMode);
+    }
+
     HGLOBAL oldG = AwtPrintControl::getPrintHDMode(env, self);
     if (setup.hDevMode != oldG) {
         AwtPrintControl::setPrintHDMode(env, self, setup.hDevMode);
@@ -710,7 +711,7 @@ Java_sun_awt_windows_WPageDialogPeer__1show(JNIEnv *env, jobject peer)
 
     CLEANUP_SHOW;
 
-    return doIt;
+    return JNI_TRUE;
 
     CATCH_BAD_ALLOC_RET(0);
 }
diff --git a/test/jdk/java/awt/print/PrinterJob/PageDialogCancelTest.java b/test/jdk/java/awt/print/PrinterJob/PageDialogCancelTest.java
index f9ce1b7c196..fc3d251cb6c 100644
--- a/test/jdk/java/awt/print/PrinterJob/PageDialogCancelTest.java
+++ b/test/jdk/java/awt/print/PrinterJob/PageDialogCancelTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2024, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,10 +23,10 @@
 
 /*
  * @test
- * @bug 8334366
+ * @bug 8334366 8334868
  * @key headful printer
- * @summary Verifies original pageobject is returned unmodified
- *          on cancelling pagedialog
+ * @summary Verifies original PageFormat object is returned unmodified
+ *          if PrinterJob.pageDialog is cancelled
  * @requires (os.family == "windows")
  * @run main PageDialogCancelTest
  */
@@ -55,4 +55,3 @@ public class PageDialogCancelTest {
         }
     }
 }
-
diff --git a/test/jdk/java/awt/print/PrinterJob/PageDialogFormatTest.java b/test/jdk/java/awt/print/PrinterJob/PageDialogFormatTest.java
new file mode 100644
index 00000000000..b727ba12928
--- /dev/null
+++ b/test/jdk/java/awt/print/PrinterJob/PageDialogFormatTest.java
@@ -0,0 +1,63 @@
+/*
+ * Copyright (c) 2024, 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+/*
+ * @test
+ * @bug 8334366 8334868
+ * @key headful printer
+ * @summary Verifies PageFormat object returned from PrinterJob.pageDialog
+ *          changes to landscape orientation when "Landscape" is selected
+ * @requires (os.family == "windows")
+ * @run main PageDialogFormatTest
+ */
+
+import java.awt.Robot;
+import java.awt.event.KeyEvent;
+import java.awt.print.PageFormat;
+import java.awt.print.PrinterJob;
+
+public class PageDialogFormatTest {
+
+    public static void main(String[] args) throws Exception {
+        PrinterJob pj = PrinterJob.getPrinterJob();
+        PageFormat oldFormat = new PageFormat();
+        Robot robot = new Robot();
+        Thread t1 = new Thread(() -> {
+            robot.delay(2000);
+            // Select Landscape orientation
+            robot.keyPress(KeyEvent.VK_ALT);
+            robot.keyPress(KeyEvent.VK_A);
+            robot.keyRelease(KeyEvent.VK_A);
+            robot.keyRelease(KeyEvent.VK_ALT);
+            // Press OK
+            robot.keyPress(KeyEvent.VK_ENTER);
+            robot.keyRelease(KeyEvent.VK_ENTER);
+            robot.waitForIdle();
+        });
+        t1.start();
+        PageFormat newFormat = pj.pageDialog(oldFormat);
+        if (newFormat.getOrientation() != PageFormat.LANDSCAPE) {
+            throw new RuntimeException("PageFormat didn't change to landscape");
+        }
+    }
+}

From d9c5c866340b209189b1e542e9a2b1c477f30157 Mon Sep 17 00:00:00 2001
From: SendaoYan <syan@openjdk.org>
Date: Fri, 10 Apr 2026 15:06:00 +0000
Subject: [PATCH 549/655] 8374943: TestDirectBufferStatisticsEvent failed with
 too few statistics events

Reviewed-by: egahlin
---
 .../jfr/event/runtime/TestDirectBufferStatisticsEvent.java  | 6 ++++--
 1 file changed, 4 insertions(+), 2 deletions(-)

diff --git a/test/jdk/jdk/jfr/event/runtime/TestDirectBufferStatisticsEvent.java b/test/jdk/jdk/jfr/event/runtime/TestDirectBufferStatisticsEvent.java
index 581884664a5..13b5d008113 100644
--- a/test/jdk/jdk/jfr/event/runtime/TestDirectBufferStatisticsEvent.java
+++ b/test/jdk/jdk/jfr/event/runtime/TestDirectBufferStatisticsEvent.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2020, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -24,6 +24,7 @@
 package jdk.jfr.event.runtime;
 
 import java.nio.ByteBuffer;
+import java.util.ArrayList;
 import java.util.List;
 
 import jdk.internal.misc.VM;
@@ -48,13 +49,14 @@ public class TestDirectBufferStatisticsEvent {
     private static final String EVENT_PATH = EventNames.DirectBufferStatistics;
 
     public static void main(String[] args) throws Throwable {
+        ArrayList<ByteBuffer> buffers = new ArrayList<>();
         try (Recording recording = new Recording()) {
             recording.enable(EVENT_PATH);
             recording.start();
             int rounds = 16;
             int size = 1 * 1024 * 1024; // 1M
             for (int i = 0; i < rounds; i++) {
-                ByteBuffer.allocateDirect(size);
+                buffers.add(ByteBuffer.allocateDirect(size));
             }
             recording.stop();
 

From ccbbef5561134a346adb083a863fe5149fe29b75 Mon Sep 17 00:00:00 2001
From: Dusan Balek <dusan.balek@oracle.com>
Date: Fri, 10 Apr 2026 15:15:15 +0000
Subject: [PATCH 550/655] 8381654: Tokenizer warnings dropped when annotation
 processing is present

Reviewed-by: jlahoda, liach
---
 .../com/sun/tools/javac/code/Preview.java     |  15 +-
 .../sun/tools/javac/parser/JavaTokenizer.java |   6 +-
 .../sun/tools/javac/parser/JavacParser.java   |  20 +-
 .../JavacProcessingEnvironment.java           |   1 +
 .../com/sun/tools/javac/util/AbstractLog.java |  12 +-
 .../warnings/TestParserWarnings.java          | 219 ++++++++++++++++++
 6 files changed, 253 insertions(+), 20 deletions(-)
 create mode 100644 test/langtools/tools/javac/processing/warnings/TestParserWarnings.java

diff --git a/src/jdk.compiler/share/classes/com/sun/tools/javac/code/Preview.java b/src/jdk.compiler/share/classes/com/sun/tools/javac/code/Preview.java
index 1c93c37698a..7a8e6c6f4f1 100644
--- a/src/jdk.compiler/share/classes/com/sun/tools/javac/code/Preview.java
+++ b/src/jdk.compiler/share/classes/com/sun/tools/javac/code/Preview.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -34,6 +34,7 @@ import com.sun.tools.javac.resources.CompilerProperties.LintWarnings;
 import com.sun.tools.javac.resources.CompilerProperties.Warnings;
 import com.sun.tools.javac.util.Assert;
 import com.sun.tools.javac.util.Context;
+import com.sun.tools.javac.util.JCDiagnostic.DiagnosticFlag;
 import com.sun.tools.javac.util.JCDiagnostic.DiagnosticPosition;
 import com.sun.tools.javac.util.JCDiagnostic.Error;
 import com.sun.tools.javac.util.JCDiagnostic.LintWarning;
@@ -150,24 +151,26 @@ public class Preview {
     /**
      * Report usage of a preview feature. Usages reported through this method will affect the
      * set of sourcefiles with dependencies on preview features.
+     * @param flag a flag to set on the diagnostic
      * @param pos the position at which the preview feature was used.
      * @param feature the preview feature used.
      */
-    public void warnPreview(int pos, Feature feature) {
-        warnPreview(new SimpleDiagnosticPosition(pos), feature);
+    public void warnPreview(DiagnosticFlag flag, int pos, Feature feature) {
+        warnPreview(flag, new SimpleDiagnosticPosition(pos), feature);
     }
 
     /**
      * Report usage of a preview feature. Usages reported through this method will affect the
      * set of sourcefiles with dependencies on preview features.
+     * @param flag a flag to set on the diagnostic
      * @param pos the position at which the preview feature was used.
      * @param feature the preview feature used.
      */
-    public void warnPreview(DiagnosticPosition pos, Feature feature) {
+    public void warnPreview(DiagnosticFlag flag, DiagnosticPosition pos, Feature feature) {
         Assert.check(isEnabled());
         Assert.check(isPreview(feature));
         markUsesPreview(pos);
-        log.warning(pos,
+        log.warning(flag, pos,
             feature.isPlural() ?
                 LintWarnings.PreviewFeatureUsePlural(feature.nameFragment()) :
                 LintWarnings.PreviewFeatureUse(feature.nameFragment()));
@@ -263,7 +266,7 @@ public class Preview {
                 log.error(pos, feature.error(source.name));
             }
             if (isEnabled() && isPreview(feature)) {
-                warnPreview(pos, feature);
+                warnPreview(null, pos, feature);
             }
         }
     }
diff --git a/src/jdk.compiler/share/classes/com/sun/tools/javac/parser/JavaTokenizer.java b/src/jdk.compiler/share/classes/com/sun/tools/javac/parser/JavaTokenizer.java
index 55f2f76e358..d8b5b1ddd6b 100644
--- a/src/jdk.compiler/share/classes/com/sun/tools/javac/parser/JavaTokenizer.java
+++ b/src/jdk.compiler/share/classes/com/sun/tools/javac/parser/JavaTokenizer.java
@@ -176,7 +176,7 @@ public class JavaTokenizer extends UnicodeReader {
             lexError(pos, feature.error(source.name));
         } else if (preview.isPreview(feature)) {
             //use of preview feature, warn
-            preview.warnPreview(pos, feature);
+            preview.warnPreview(DiagnosticFlag.SYNTAX, pos, feature);
         }
     }
 
@@ -1040,10 +1040,10 @@ public class JavaTokenizer extends UnicodeReader {
                     // Verify that the incidental indentation is consistent.
                     Set<TextBlockSupport.WhitespaceChecks> checks = TextBlockSupport.checkWhitespace(string);
                     if (checks.contains(TextBlockSupport.WhitespaceChecks.INCONSISTENT)) {
-                        log.warning(pos, LintWarnings.InconsistentWhiteSpaceIndentation);
+                        log.warning(DiagnosticFlag.SYNTAX, pos, LintWarnings.InconsistentWhiteSpaceIndentation);
                     }
                     if (checks.contains(TextBlockSupport.WhitespaceChecks.TRAILING)) {
-                        log.warning(pos, LintWarnings.TrailingWhiteSpaceWillBeRemoved);
+                        log.warning(DiagnosticFlag.SYNTAX, pos, LintWarnings.TrailingWhiteSpaceWillBeRemoved);
                     }
                     // Remove incidental indentation.
                     try {
diff --git a/src/jdk.compiler/share/classes/com/sun/tools/javac/parser/JavacParser.java b/src/jdk.compiler/share/classes/com/sun/tools/javac/parser/JavacParser.java
index df5da5cb954..b4dfb04766c 100644
--- a/src/jdk.compiler/share/classes/com/sun/tools/javac/parser/JavacParser.java
+++ b/src/jdk.compiler/share/classes/com/sun/tools/javac/parser/JavacParser.java
@@ -772,7 +772,7 @@ public class JavacParser implements Parser {
             }
         } else if (token.kind == UNDERSCORE) {
             if (Feature.UNDERSCORE_IDENTIFIER.allowedInSource(source)) {
-                log.warning(token.pos, Warnings.UnderscoreAsIdentifier);
+                log.warning(DiagnosticFlag.SYNTAX, token.pos, Warnings.UnderscoreAsIdentifier);
             } else if (asVariable) {
                 checkSourceLevel(Feature.UNNAMED_VARIABLES);
                 if (peekToken(LBRACKET)) {
@@ -2339,7 +2339,7 @@ public class JavacParser implements Parser {
             if (allowYieldStatement) {
                 return true;
             } else {
-                log.warning(pos, Warnings.InvalidYield);
+                log.warning(DiagnosticFlag.SYNTAX, pos, Warnings.InvalidYield);
             }
         }
         return false;
@@ -3858,35 +3858,35 @@ public class JavacParser implements Parser {
             if (Feature.LOCAL_VARIABLE_TYPE_INFERENCE.allowedInSource(source)) {
                 return Source.JDK10;
             } else if (shouldWarn) {
-                log.warning(pos, Warnings.RestrictedTypeNotAllowed(name, Source.JDK10));
+                log.warning(DiagnosticFlag.SYNTAX, pos, Warnings.RestrictedTypeNotAllowed(name, Source.JDK10));
             }
         }
         if (name == names.yield) {
             if (allowYieldStatement) {
                 return Source.JDK14;
             } else if (shouldWarn) {
-                log.warning(pos, Warnings.RestrictedTypeNotAllowed(name, Source.JDK14));
+                log.warning(DiagnosticFlag.SYNTAX, pos, Warnings.RestrictedTypeNotAllowed(name, Source.JDK14));
             }
         }
         if (name == names.record) {
             if (allowRecords) {
                 return Source.JDK14;
             } else if (shouldWarn) {
-                log.warning(pos, Warnings.RestrictedTypeNotAllowedPreview(name, Source.JDK14));
+                log.warning(DiagnosticFlag.SYNTAX, pos, Warnings.RestrictedTypeNotAllowedPreview(name, Source.JDK14));
             }
         }
         if (name == names.sealed) {
             if (allowSealedTypes) {
                 return Source.JDK15;
             } else if (shouldWarn) {
-                log.warning(pos, Warnings.RestrictedTypeNotAllowedPreview(name, Source.JDK15));
+                log.warning(DiagnosticFlag.SYNTAX, pos, Warnings.RestrictedTypeNotAllowedPreview(name, Source.JDK15));
             }
         }
         if (name == names.permits) {
             if (allowSealedTypes) {
                 return Source.JDK15;
             } else if (shouldWarn) {
-                log.warning(pos, Warnings.RestrictedTypeNotAllowedPreview(name, Source.JDK15));
+                log.warning(DiagnosticFlag.SYNTAX, pos, Warnings.RestrictedTypeNotAllowedPreview(name, Source.JDK15));
             }
         }
         return null;
@@ -4057,7 +4057,7 @@ public class JavacParser implements Parser {
                     if (source.compareTo(Source.JDK21) >= 0)
                         reportSyntaxError(semiList.first().pos, Errors.ExtraneousSemicolon);
                     else
-                        log.warning(semiList.first().pos, Warnings.ExtraneousSemicolon);
+                        log.warning(DiagnosticFlag.SYNTAX, semiList.first().pos, Warnings.ExtraneousSemicolon);
                 }
                 seenImport = true;
                 defs.append(importDeclaration());
@@ -4074,7 +4074,7 @@ public class JavacParser implements Parser {
                         if (source.compareTo(Source.JDK21) >= 0)
                             reportSyntaxError(semiList.first().pos, Errors.ExtraneousSemicolon);
                         else
-                            log.warning(semiList.first().pos, Warnings.ExtraneousSemicolon);
+                            log.warning(DiagnosticFlag.SYNTAX, semiList.first().pos, Warnings.ExtraneousSemicolon);
                     }
                     ModuleKind kind = ModuleKind.STRONG;
                     if (token.name() == names.open) {
@@ -5616,7 +5616,7 @@ public class JavacParser implements Parser {
             log.error(pos, feature.error(source.name));
         } else if (preview.isPreview(feature)) {
             //use of preview feature, warn
-            preview.warnPreview(pos, feature);
+            preview.warnPreview(DiagnosticFlag.SYNTAX, pos, feature);
         }
     }
 
diff --git a/src/jdk.compiler/share/classes/com/sun/tools/javac/processing/JavacProcessingEnvironment.java b/src/jdk.compiler/share/classes/com/sun/tools/javac/processing/JavacProcessingEnvironment.java
index 809c19d5012..11fa3a5aebf 100644
--- a/src/jdk.compiler/share/classes/com/sun/tools/javac/processing/JavacProcessingEnvironment.java
+++ b/src/jdk.compiler/share/classes/com/sun/tools/javac/processing/JavacProcessingEnvironment.java
@@ -1204,6 +1204,7 @@ public class JavacProcessingEnvironment implements ProcessingEnvironment, Closea
         //where:
             private final Predicate<JCDiagnostic> ACCEPT_NON_RECOVERABLE_LINTS =
                     d -> !Optional.of(d)
+                            .filter(diag -> !diag.isFlagSet(SYNTAX))
                             .map(JCDiagnostic::getLintCategory)
                             .map(lc -> lc.annotationSuppression ||
                                        lc == Lint.LintCategory.INCUBATING)
diff --git a/src/jdk.compiler/share/classes/com/sun/tools/javac/util/AbstractLog.java b/src/jdk.compiler/share/classes/com/sun/tools/javac/util/AbstractLog.java
index ce3e56f2f3f..b8b2a3af254 100644
--- a/src/jdk.compiler/share/classes/com/sun/tools/javac/util/AbstractLog.java
+++ b/src/jdk.compiler/share/classes/com/sun/tools/javac/util/AbstractLog.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1999, 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1999, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -192,6 +192,16 @@ public abstract class AbstractLog {
         report(diags.warning(null, source, wrap(pos), warningKey));
     }
 
+    /** Report a warning, unless suppressed by the  -nowarn option or the
+     *  maximum number of warnings has been reached.
+     *  @param flag   A flag to set on the diagnostic
+     *  @param pos    The source position at which to report the warning.
+     *  @param warningKey    The key for the localized warning message.
+     */
+    public void warning(DiagnosticFlag flag, int pos, Warning warningKey) {
+        report(diags.warning(flag, source, wrap(pos), warningKey));
+    }
+
     /** Provide a non-fatal notification, unless suppressed by the -nowarn option.
      *  @param noteKey    The key for the localized notification message.
      */
diff --git a/test/langtools/tools/javac/processing/warnings/TestParserWarnings.java b/test/langtools/tools/javac/processing/warnings/TestParserWarnings.java
new file mode 100644
index 00000000000..b611e7a8655
--- /dev/null
+++ b/test/langtools/tools/javac/processing/warnings/TestParserWarnings.java
@@ -0,0 +1,219 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+/*
+ * @test
+ * @bug 8381654
+ * @summary AP interference with tokenizer warnings
+ * @library /tools/lib
+ * @modules
+ *      jdk.compiler/com.sun.tools.javac.api
+ *      jdk.compiler/com.sun.tools.javac.main
+ * @build toolbox.ToolBox toolbox.JavacTask
+ * @run junit ${test.main.class}
+ */
+
+import java.io.IOException;
+import java.io.Writer;
+import java.nio.file.Files;
+import java.nio.file.Path;
+import java.util.List;
+import java.util.Set;
+
+import javax.annotation.processing.AbstractProcessor;
+import javax.annotation.processing.Filer;
+import javax.annotation.processing.Messager;
+import javax.annotation.processing.ProcessingEnvironment;
+import javax.annotation.processing.RoundEnvironment;
+import javax.annotation.processing.SupportedAnnotationTypes;
+import javax.lang.model.SourceVersion;
+import javax.lang.model.element.TypeElement;
+import org.junit.jupiter.api.BeforeEach;
+import org.junit.jupiter.api.Test;
+import org.junit.jupiter.api.TestInfo;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
+import toolbox.JavacTask;
+import toolbox.Task;
+import toolbox.ToolBox;
+
+public class TestParserWarnings {
+
+    static boolean[] apOptions() {
+        return new boolean[] {false, true};
+    }
+
+    final ToolBox tb = new ToolBox();
+    Path base, src, classes;
+
+    @ParameterizedTest @MethodSource("apOptions")
+    public void testPreviewWarning(boolean useProcessor) throws Exception {
+        tb.writeJavaFiles(src, """
+                        public record MyRec() {}
+                        """);
+
+        JavacTask task = new JavacTask(tb)
+                .options("--enable-preview",
+                         "-source", Integer.toString(Runtime.version().feature()),
+                         "-XDforcePreview",
+                         "-XDrawDiagnostics")
+                .files(tb.findJavaFiles(src))
+                .outdir(classes);
+        if (useProcessor) {
+            task.processors(new ProcessorImpl());
+        }
+        List<String> log = task
+                .run()
+                .writeAll()
+                .getOutputLines(Task.OutputKind.DIRECT);
+
+        List<String> expected = List.of(
+                "- compiler.note.preview.filename: MyRec.java, DEFAULT",
+                "- compiler.note.preview.recompile"
+        );
+
+        tb.checkEqual(expected, log);
+    }
+
+    @ParameterizedTest @MethodSource("apOptions")
+    public void testTextBlockWarning(boolean useProcessor) throws Exception {
+        tb.writeJavaFiles(src, """
+                class TextBlockWhitespace {
+                    String m() {
+                        return ""\"
+                \\u0009\\u0009\\u0009\\u0009tab indentation
+                \\u0020\\u0020\\u0020\\u0020space indentation and trailing space\\u0020
+                \\u0020\\u0020\\u0020\\u0020""\";
+                    }
+                }
+                """);
+
+        JavacTask task = new JavacTask(tb)
+                .options("-Xlint:text-blocks",
+                         "-XDrawDiagnostics")
+                .files(tb.findJavaFiles(src))
+                .outdir(classes);
+        if (useProcessor) {
+            task.processors(new ProcessorImpl());
+        }
+        List<String> log = task
+                .run()
+                .writeAll()
+                .getOutputLines(Task.OutputKind.DIRECT);
+
+        List<String> expected = List.of(
+                "TextBlockWhitespace.java:3:16: compiler.warn.inconsistent.white.space.indentation",
+                "TextBlockWhitespace.java:3:16: compiler.warn.trailing.white.space.will.be.removed",
+                "2 warnings"
+        );
+
+        tb.checkEqual(expected, log);
+    }
+
+    @Test
+    public void testAPGeneratedSource() throws Exception {
+        tb.writeJavaFiles(src, """
+                import java.lang.annotation.ElementType;
+                import java.lang.annotation.Target;
+
+                @A
+                class Test {}
+
+                @Target(ElementType.TYPE)
+                @interface A {}
+                """);
+
+        List<String> log = new JavacTask(tb)
+                .options("-Xlint:text-blocks",
+                         "-XDrawDiagnostics")
+                .files(tb.findJavaFiles(src))
+                .outdir(classes)
+                .processors(new ProcessorImpl())
+                .run()
+                .writeAll()
+                .getOutputLines(Task.OutputKind.DIRECT);
+
+        List<String> expected = List.of(
+                "Generated.java:3:16: compiler.warn.inconsistent.white.space.indentation",
+                "Generated.java:3:16: compiler.warn.trailing.white.space.will.be.removed",
+                "2 warnings"
+        );
+
+        tb.checkEqual(expected, log);
+    }
+
+    @SupportedAnnotationTypes("*")
+    private static class ProcessorImpl extends AbstractProcessor {
+        private boolean done = false;
+        private Filer filer;
+        private Messager msgr;
+
+        @Override
+        public void init(ProcessingEnvironment env) {
+            filer = env.getFiler();
+            msgr = env.getMessager();
+        }
+
+        @Override
+        public boolean process(Set<? extends TypeElement> annotations, RoundEnvironment roundEnv) {
+            if (!done && !annotations.isEmpty()) {
+                try (Writer pw = filer.createSourceFile("Generated").openWriter()) {
+                    pw.write("""
+                             public class Generated {
+                                 String m() {
+                                     return ""\"
+                             \\u0009\\u0009\\u0009\\u0009tab indentation
+                             \\u0020\\u0020\\u0020\\u0020space indentation and trailing space\\u0020
+                             \\u0020\\u0020\\u0020\\u0020""\";
+                                 }
+                             }
+                             """);
+                    pw.flush();
+                    pw.close();
+                    done = true;
+                } catch (IOException ioe) {
+                    msgr.printError(ioe.getMessage());
+                    return false;
+                }
+                return true;
+            }
+            return false;
+        }
+
+        @Override
+        public SourceVersion getSupportedSourceVersion() {
+            return SourceVersion.latest();
+        }
+    }
+
+    @BeforeEach
+    public void setUp(TestInfo info) throws Exception {
+        base = Path.of(".").resolve(info.getTestMethod().get().getName());
+        if (Files.exists(base)) {
+            tb.cleanDirectory(base);
+        }
+        src = base.resolve("src");
+        classes = base.resolve("classes");
+        Files.createDirectories(classes);
+    }
+}

From 701d0cb3a2a983ca94dedb7ca4f3554e040dec43 Mon Sep 17 00:00:00 2001
From: Andrew Haley <aph@openjdk.org>
Date: Fri, 10 Apr 2026 17:03:15 +0000
Subject: [PATCH 551/655] 8381969: os::physical_memory is still broken in
 32-bit systems when running on 64-bit OSes

Reviewed-by: jsikstro, stefank, aartemov
---
 src/hotspot/share/runtime/arguments.cpp | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/src/hotspot/share/runtime/arguments.cpp b/src/hotspot/share/runtime/arguments.cpp
index 1d79c4d0488..225e7074076 100644
--- a/src/hotspot/share/runtime/arguments.cpp
+++ b/src/hotspot/share/runtime/arguments.cpp
@@ -1515,7 +1515,7 @@ void Arguments::set_heap_size() {
                        !FLAG_IS_DEFAULT(MinRAMPercentage) ||
                        !FLAG_IS_DEFAULT(InitialRAMPercentage);
 
-  const size_t avail_mem = os::physical_memory();
+  const physical_memory_size_type avail_mem = os::physical_memory();
 
   // If the maximum heap size has not been set with -Xmx, then set it as
   // fraction of the size of physical memory, respecting the maximum and

From a3309eb6655ff0deb05d824ff80c4c1028683056 Mon Sep 17 00:00:00 2001
From: Vladimir Kozlov <kvn@openjdk.org>
Date: Fri, 10 Apr 2026 17:11:33 +0000
Subject: [PATCH 552/655] 8381899: Assertions and crashes in aot/cds tests on
 Linux Alpine

Reviewed-by: adinn
---
 src/hotspot/share/code/aotCodeCache.cpp | 26 ++++++++++++++-----------
 1 file changed, 15 insertions(+), 11 deletions(-)

diff --git a/src/hotspot/share/code/aotCodeCache.cpp b/src/hotspot/share/code/aotCodeCache.cpp
index 6594d94fa91..79211e75db4 100644
--- a/src/hotspot/share/code/aotCodeCache.cpp
+++ b/src/hotspot/share/code/aotCodeCache.cpp
@@ -1093,11 +1093,13 @@ bool AOTCodeCache::store_code_blob(CodeBlob& blob, AOTCodeEntry::Kind entry_kind
   // now we have added all the other data we can write details of any
   // extra the AOT relocations
 
-  bool write_ok;
+  bool write_ok = true;
   if (AOTCodeEntry::is_multi_stub_blob(entry_kind)) {
-    CodeSection* cs = code_buffer->code_section(CodeBuffer::SECT_INSTS);
-    RelocIterator iter(cs);
-    write_ok = cache->write_relocations(blob, iter);
+    if (reloc_count > 0) {
+      CodeSection* cs = code_buffer->code_section(CodeBuffer::SECT_INSTS);
+      RelocIterator iter(cs);
+      write_ok = cache->write_relocations(blob, iter);
+    }
   } else {
     RelocIterator iter(&blob);
     write_ok = cache->write_relocations(blob, iter);
@@ -1403,13 +1405,15 @@ void AOTCodeReader::restore(CodeBlob* code_blob) {
     // reinstate the AOT-load time relocs we saved from the code
     // buffer that generated this blob in a new code buffer and use
     // the latter to iterate over them
-    CodeBuffer code_buffer(code_blob);
-    relocInfo* locs = (relocInfo*)_reloc_data;
-    code_buffer.insts()->initialize_shared_locs(locs, _reloc_count);
-    code_buffer.insts()->set_locs_end(locs + _reloc_count);
-    CodeSection *cs = code_buffer.code_section(CodeBuffer::SECT_INSTS);
-    RelocIterator reloc_iter(cs);
-    fix_relocations(code_blob, reloc_iter);
+    if (_reloc_count > 0) {
+      CodeBuffer code_buffer(code_blob);
+      relocInfo* locs = (relocInfo*)_reloc_data;
+      code_buffer.insts()->initialize_shared_locs(locs, _reloc_count);
+      code_buffer.insts()->set_locs_end(locs + _reloc_count);
+      CodeSection *cs = code_buffer.code_section(CodeBuffer::SECT_INSTS);
+      RelocIterator reloc_iter(cs);
+      fix_relocations(code_blob, reloc_iter);
+    }
   } else {
     // the AOT-load time relocs will be in the blob's restored relocs
     RelocIterator reloc_iter(code_blob);

From d3d8a0d90410f7dd0ced55fe719af04c93d46431 Mon Sep 17 00:00:00 2001
From: Ioi Lam <iklam@openjdk.org>
Date: Fri, 10 Apr 2026 17:55:02 +0000
Subject: [PATCH 553/655] 8381636: Add built-in AOT support to GrowableArray

Co-authored-by: Stefan Karlsson <stefank@openjdk.org>
Reviewed-by: matsaave, kvn, coleenp
---
 src/hotspot/share/cds/aotGrowableArray.cpp    | 34 ---------
 src/hotspot/share/cds/aotGrowableArray.hpp    | 76 -------------------
 .../share/cds/aotGrowableArray.inline.hpp     | 37 ---------
 src/hotspot/share/cds/cppVtables.cpp          |  6 +-
 src/hotspot/share/classfile/moduleEntry.cpp   |  3 +-
 src/hotspot/share/classfile/moduleEntry.hpp   |  7 +-
 src/hotspot/share/classfile/packageEntry.cpp  |  3 +-
 src/hotspot/share/classfile/packageEntry.hpp  |  3 +-
 src/hotspot/share/memory/metaspaceClosure.cpp |  4 +-
 src/hotspot/share/memory/metaspaceClosure.hpp | 55 +++++++++++---
 src/hotspot/share/utilities/growableArray.cpp |  7 +-
 src/hotspot/share/utilities/growableArray.hpp | 13 ++--
 .../gtest/utilities/test_metaspaceClosure.cpp | 13 ++--
 13 files changed, 72 insertions(+), 189 deletions(-)
 delete mode 100644 src/hotspot/share/cds/aotGrowableArray.cpp
 delete mode 100644 src/hotspot/share/cds/aotGrowableArray.hpp
 delete mode 100644 src/hotspot/share/cds/aotGrowableArray.inline.hpp

diff --git a/src/hotspot/share/cds/aotGrowableArray.cpp b/src/hotspot/share/cds/aotGrowableArray.cpp
deleted file mode 100644
index ec63e7aa57f..00000000000
--- a/src/hotspot/share/cds/aotGrowableArray.cpp
+++ /dev/null
@@ -1,34 +0,0 @@
-/*
- * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
- * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
- *
- * This code is free software; you can redistribute it and/or modify it
- * under the terms of the GNU General Public License version 2 only, as
- * published by the Free Software Foundation.
- *
- * This code is distributed in the hope that it will be useful, but WITHOUT
- * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
- * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
- * version 2 for more details (a copy is included in the LICENSE file that
- * accompanied this code).
- *
- * You should have received a copy of the GNU General Public License version
- * 2 along with this work; if not, write to the Free Software Foundation,
- * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
- *
- * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
- * or visit www.oracle.com if you need additional information or have any
- * questions.
- *
- */
-
-#include "cds/aotGrowableArray.hpp"
-#include "cds/aotMetaspace.hpp"
-#include "memory/allocation.inline.hpp"
-#include "utilities/growableArray.hpp"
-
-void AOTGrowableArrayHelper::deallocate(void* mem) {
-  if (!AOTMetaspace::in_aot_cache(mem)) {
-    GrowableArrayCHeapAllocator::deallocate(mem);
-  }
-}
diff --git a/src/hotspot/share/cds/aotGrowableArray.hpp b/src/hotspot/share/cds/aotGrowableArray.hpp
deleted file mode 100644
index 0a0c137ed07..00000000000
--- a/src/hotspot/share/cds/aotGrowableArray.hpp
+++ /dev/null
@@ -1,76 +0,0 @@
-/*
- * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
- * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
- *
- * This code is free software; you can redistribute it and/or modify it
- * under the terms of the GNU General Public License version 2 only, as
- * published by the Free Software Foundation.
- *
- * This code is distributed in the hope that it will be useful, but WITHOUT
- * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
- * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
- * version 2 for more details (a copy is included in the LICENSE file that
- * accompanied this code).
- *
- * You should have received a copy of the GNU General Public License version
- * 2 along with this work; if not, write to the Free Software Foundation,
- * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
- *
- * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
- * or visit www.oracle.com if you need additional information or have any
- * questions.
- *
- */
-
-#ifndef SHARE_AOT_AOTGROWABLEARRAY_HPP
-#define SHARE_AOT_AOTGROWABLEARRAY_HPP
-
-#include <memory/metaspaceClosureType.hpp>
-#include <utilities/growableArray.hpp>
-
-class AOTGrowableArrayHelper {
-public:
-  static void deallocate(void* mem);
-};
-
-// An AOTGrowableArray<T> provides the same functionality as a GrowableArray<T> that
-// uses the C heap allocator. In addition, AOTGrowableArray<T> can be iterated with
-// MetaspaceClosure. This type should be used for growable arrays that need to be
-// stored in the AOT cache. See ModuleEntry::_reads for an example.
-template <typename E>
-class AOTGrowableArray : public GrowableArrayWithAllocator<E, AOTGrowableArray<E>> {
-  friend class VMStructs;
-  friend class GrowableArrayWithAllocator<E, AOTGrowableArray>;
-
-  static E* allocate(int max, MemTag mem_tag) {
-    return (E*)GrowableArrayCHeapAllocator::allocate(max, sizeof(E), mem_tag);
-  }
-
-  E* allocate() {
-    return allocate(this->_capacity, mtClass);
-  }
-
-  void deallocate(E* mem) {
-#if INCLUDE_CDS
-    AOTGrowableArrayHelper::deallocate(mem);
-#else
-    GrowableArrayCHeapAllocator::deallocate(mem);
-#endif
-  }
-
-public:
-  AOTGrowableArray(int initial_capacity, MemTag mem_tag) :
-      GrowableArrayWithAllocator<E, AOTGrowableArray>(
-          allocate(initial_capacity, mem_tag),
-          initial_capacity) {}
-
-  AOTGrowableArray() : AOTGrowableArray(0, mtClassShared) {}
-
-  // methods required by MetaspaceClosure
-  void metaspace_pointers_do(MetaspaceClosure* it);
-  int size_in_heapwords() const { return (int)heap_word_size(sizeof(*this)); }
-  MetaspaceClosureType type() const { return MetaspaceClosureType::GrowableArrayType; }
-  static bool is_read_only_by_default() { return false; }
-};
-
-#endif // SHARE_AOT_AOTGROWABLEARRAY_HPP
diff --git a/src/hotspot/share/cds/aotGrowableArray.inline.hpp b/src/hotspot/share/cds/aotGrowableArray.inline.hpp
deleted file mode 100644
index 8c6e8cb6503..00000000000
--- a/src/hotspot/share/cds/aotGrowableArray.inline.hpp
+++ /dev/null
@@ -1,37 +0,0 @@
-/*
- * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
- * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
- *
- * This code is free software; you can redistribute it and/or modify it
- * under the terms of the GNU General Public License version 2 only, as
- * published by the Free Software Foundation.
- *
- * This code is distributed in the hope that it will be useful, but WITHOUT
- * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
- * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
- * version 2 for more details (a copy is included in the LICENSE file that
- * accompanied this code).
- *
- * You should have received a copy of the GNU General Public License version
- * 2 along with this work; if not, write to the Free Software Foundation,
- * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
- *
- * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
- * or visit www.oracle.com if you need additional information or have any
- * questions.
- *
- */
-
-#ifndef SHARE_CDS_AOTGROWABLEARRAY_INLINE_HPP
-#define SHARE_CDS_AOTGROWABLEARRAY_INLINE_HPP
-
-#include "cds/aotGrowableArray.hpp"
-
-#include "memory/metaspaceClosure.hpp"
-
-template <typename E>
-void AOTGrowableArray<E>::metaspace_pointers_do(MetaspaceClosure* it) {
-  it->push_c_array(AOTGrowableArray<E>::data_addr(), AOTGrowableArray<E>::capacity());
-}
-
-#endif // SHARE_CDS_AOTGROWABLEARRAY_INLINE_HPP
diff --git a/src/hotspot/share/cds/cppVtables.cpp b/src/hotspot/share/cds/cppVtables.cpp
index dc5a777d7b1..57da12dee48 100644
--- a/src/hotspot/share/cds/cppVtables.cpp
+++ b/src/hotspot/share/cds/cppVtables.cpp
@@ -22,7 +22,6 @@
  *
  */
 
-#include "cds/aotGrowableArray.hpp"
 #include "cds/aotMetaspace.hpp"
 #include "cds/archiveBuilder.hpp"
 #include "cds/archiveUtils.hpp"
@@ -41,6 +40,7 @@
 #include "oops/typeArrayKlass.hpp"
 #include "runtime/arguments.hpp"
 #include "utilities/globalDefinitions.hpp"
+#include "utilities/growableArray.hpp"
 
 // Objects of the Metadata types (such as Klass and ConstantPool) have C++ vtables.
 // (In GCC this is the field <Type>::_vptr, i.e., first word in the object.)
@@ -58,10 +58,10 @@
 
 #ifndef PRODUCT
 
-// AOTGrowableArray has a vtable only when in non-product builds (due to
+// GrowableArray has a vtable only when in non-product builds (due to
 // the virtual printing functions in AnyObj).
 
-using GrowableArray_ModuleEntry_ptr = AOTGrowableArray<ModuleEntry*>;
+using GrowableArray_ModuleEntry_ptr = GrowableArray<ModuleEntry*>;
 
 #define DEBUG_CPP_VTABLE_TYPES_DO(f) \
   f(GrowableArray_ModuleEntry_ptr) \
diff --git a/src/hotspot/share/classfile/moduleEntry.cpp b/src/hotspot/share/classfile/moduleEntry.cpp
index b5b8aa4ef55..c7fadeaea9b 100644
--- a/src/hotspot/share/classfile/moduleEntry.cpp
+++ b/src/hotspot/share/classfile/moduleEntry.cpp
@@ -23,7 +23,6 @@
  */
 
 #include "cds/aotClassLocation.hpp"
-#include "cds/aotGrowableArray.inline.hpp"
 #include "cds/archiveBuilder.hpp"
 #include "cds/archiveUtils.hpp"
 #include "cds/cdsConfig.hpp"
@@ -168,7 +167,7 @@ void ModuleEntry::add_read(ModuleEntry* m) {
   } else {
     if (reads() == nullptr) {
       // Lazily create a module's reads list
-      AOTGrowableArray<ModuleEntry*>* new_reads = new (mtModule) AOTGrowableArray<ModuleEntry*>(MODULE_READS_SIZE, mtModule);
+      GrowableArray<ModuleEntry*>* new_reads = new (mtModule) GrowableArray<ModuleEntry*>(MODULE_READS_SIZE, mtModule);
       set_reads(new_reads);
     }
 
diff --git a/src/hotspot/share/classfile/moduleEntry.hpp b/src/hotspot/share/classfile/moduleEntry.hpp
index 1a0251a2c2a..10dec73e9fa 100644
--- a/src/hotspot/share/classfile/moduleEntry.hpp
+++ b/src/hotspot/share/classfile/moduleEntry.hpp
@@ -25,7 +25,6 @@
 #ifndef SHARE_CLASSFILE_MODULEENTRY_HPP
 #define SHARE_CLASSFILE_MODULEENTRY_HPP
 
-#include "cds/aotGrowableArray.hpp"
 #include "jni.h"
 #include "memory/metaspaceClosureType.hpp"
 #include "oops/oopHandle.hpp"
@@ -70,7 +69,7 @@ private:
                                        // for shared classes from this module
   Symbol*          _name;              // name of this module
   ClassLoaderData* _loader_data;
-  AOTGrowableArray<ModuleEntry*>* _reads;  // list of modules that are readable by this module
+  GrowableArray<ModuleEntry*>* _reads; // list of modules that are readable by this module
 
   Symbol* _version;                    // module version number
   Symbol* _location;                   // module location
@@ -118,10 +117,10 @@ public:
 
   bool             can_read(ModuleEntry* m) const;
   bool             has_reads_list() const;
-  AOTGrowableArray<ModuleEntry*>* reads() const {
+  GrowableArray<ModuleEntry*>* reads() const {
     return _reads;
   }
-  void set_reads(AOTGrowableArray<ModuleEntry*>* r) {
+  void set_reads(GrowableArray<ModuleEntry*>* r) {
     _reads = r;
   }
   void pack_reads() {
diff --git a/src/hotspot/share/classfile/packageEntry.cpp b/src/hotspot/share/classfile/packageEntry.cpp
index 3e61f2e3a3e..3eb50fcb5a7 100644
--- a/src/hotspot/share/classfile/packageEntry.cpp
+++ b/src/hotspot/share/classfile/packageEntry.cpp
@@ -22,7 +22,6 @@
  *
  */
 
-#include "cds/aotGrowableArray.inline.hpp"
 #include "cds/aotMetaspace.hpp"
 #include "cds/archiveBuilder.hpp"
 #include "cds/archiveUtils.hpp"
@@ -83,7 +82,7 @@ void PackageEntry::add_qexport(ModuleEntry* m) {
   if (!has_qual_exports_list()) {
     // Lazily create a package's qualified exports list.
     // Initial size is small, do not anticipate export lists to be large.
-    _qualified_exports = new (mtModule) AOTGrowableArray<ModuleEntry*>(QUAL_EXP_SIZE, mtModule);
+    _qualified_exports = new (mtModule) GrowableArray<ModuleEntry*>(QUAL_EXP_SIZE, mtModule);
   }
 
   // Determine, based on this newly established export to module m,
diff --git a/src/hotspot/share/classfile/packageEntry.hpp b/src/hotspot/share/classfile/packageEntry.hpp
index 7b174a92287..e064e53b263 100644
--- a/src/hotspot/share/classfile/packageEntry.hpp
+++ b/src/hotspot/share/classfile/packageEntry.hpp
@@ -25,7 +25,6 @@
 #ifndef SHARE_CLASSFILE_PACKAGEENTRY_HPP
 #define SHARE_CLASSFILE_PACKAGEENTRY_HPP
 
-#include "cds/aotGrowableArray.hpp"
 #include "classfile/moduleEntry.hpp"
 #include "memory/metaspaceClosureType.hpp"
 #include "oops/symbol.hpp"
@@ -116,7 +115,7 @@ private:
   bool _must_walk_exports;
   // Contains list of modules this package is qualifiedly exported to.  Access
   // to this list is protected by the Module_lock.
-  AOTGrowableArray<ModuleEntry*>* _qualified_exports;
+  GrowableArray<ModuleEntry*>* _qualified_exports;
   JFR_ONLY(DEFINE_TRACE_ID_FIELD;)
 
   // Initial size of a package entry's list of qualified exports.
diff --git a/src/hotspot/share/memory/metaspaceClosure.cpp b/src/hotspot/share/memory/metaspaceClosure.cpp
index 0239eadf692..0926b55b9a3 100644
--- a/src/hotspot/share/memory/metaspaceClosure.cpp
+++ b/src/hotspot/share/memory/metaspaceClosure.cpp
@@ -22,11 +22,11 @@
  *
  */
 
-#include "cds/aotGrowableArray.hpp"
 #include "classfile/packageEntry.hpp"
 #include "memory/metaspaceClosure.hpp"
 #include "oops/array.hpp"
 #include "oops/instanceKlass.hpp"
+#include "utilities/growableArray.hpp"
 
 // Sanity checks
 static_assert(!HAS_METASPACE_POINTERS_DO(int));
@@ -35,8 +35,6 @@ static_assert(HAS_METASPACE_POINTERS_DO(Array<int>));
 static_assert(HAS_METASPACE_POINTERS_DO(Array<InstanceKlass*>));
 static_assert(HAS_METASPACE_POINTERS_DO(InstanceKlass));
 static_assert(HAS_METASPACE_POINTERS_DO(PackageEntry));
-static_assert(HAS_METASPACE_POINTERS_DO(AOTGrowableArray<int>));
-static_assert(HAS_METASPACE_POINTERS_DO(AOTGrowableArray<PackageEntry*>));
 
 void MetaspaceClosure::push_impl(MetaspaceClosure::Ref* ref) {
   if (_enclosing_ref != nullptr) {
diff --git a/src/hotspot/share/memory/metaspaceClosure.hpp b/src/hotspot/share/memory/metaspaceClosure.hpp
index b6ba69d6f63..ac42dd13c6c 100644
--- a/src/hotspot/share/memory/metaspaceClosure.hpp
+++ b/src/hotspot/share/memory/metaspaceClosure.hpp
@@ -25,7 +25,6 @@
 #ifndef SHARE_MEMORY_METASPACECLOSURE_HPP
 #define SHARE_MEMORY_METASPACECLOSURE_HPP
 
-#include "cds/aotGrowableArray.hpp"
 #include "cppstdlib/type_traits.hpp"
 #include "logging/log.hpp"
 #include "memory/allocation.hpp"
@@ -90,7 +89,9 @@ public:
   //         int size_in_heapwords() const;
   //
   // Currently, the iterable types include all subtypes of MetsapceObj, as well
-  // as GrowableArray, ModuleEntry and PackageEntry.
+  // as GrowableArray (C-heap allocated only), ModuleEntry, and PackageEntry.
+  //
+  // (Note that GrowableArray is supported specially and does not require the above functions.)
   //
   // Calling these functions would be trivial if these were virtual functions.
   // However, to save space, MetaspaceObj has NO vtable. The vtable is introduced
@@ -303,11 +304,38 @@ private:
   };
 
   //--------------------------------
-  // Support for AOTGrowableArray<T>
+  // Support for GrowableArray<T>
   //--------------------------------
 
+  // GrowableArrayRef -- iterate an instance of GrowableArray<T>.
+  template <class T> class GrowableArrayRef : public Ref {
+    GrowableArray<T>** _mpp;
+    GrowableArray<T>* dereference() const {
+      return *_mpp;
+    }
+
+  public:
+    GrowableArrayRef(GrowableArray<T>** mpp, Writability w) : Ref(w), _mpp(mpp) {}
+
+    virtual void** mpp() const {
+      return (void**)_mpp;
+    }
+
+    virtual void metaspace_pointers_do(MetaspaceClosure *it) const {
+      GrowableArray<T>* array = dereference();
+      log_trace(aot)("Iter(GrowableArray): %p [%d]", array, array->length());
+      array->assert_on_C_heap();
+      it->push_c_array(array->data_addr(), array->capacity());
+    }
+
+    virtual bool is_read_only_by_default() const { return false; }
+    virtual bool not_null()                const { return dereference() != nullptr;  }
+    virtual int size()                     const { return (int)heap_word_size(sizeof(*dereference())); }
+    virtual MetaspaceClosureType type()    const { return MetaspaceClosureType::GrowableArrayType; }
+  };
+
   // Abstract base class for MSOCArrayRef, MSOPointerCArrayRef and OtherCArrayRef.
-  // These are used for iterating the buffer held by AOTGrowableArray<T>.
+  // These are used for iterating the buffer held by GrowableArray<T>.
   template <class T> class CArrayRef : public Ref {
     T** _mpp;
     int _num_elems; // Number of elements
@@ -354,7 +382,7 @@ private:
 
   // MSOCArrayRef<T> -- iterate a C array of type T, where T has metaspace_pointer_do().
   // We recursively call T::metaspace_pointers_do() for each element in this array.
-  // This is for supporting AOTGrowableArray<T>.
+  // This is for supporting GrowableArray<T>.
   //
   // E.g., PackageEntry* _pkg_entry_pointers[2]; // a buffer that has 2 PackageEntry objects
   //       ...
@@ -377,7 +405,7 @@ private:
 
   // MSOPointerCArrayRef<T> -- iterate a C array of type T*, where T has metaspace_pointer_do().
   // We recursively call MetaspaceClosure::push() for each pointer in this array.
-  // This is for supporting AOTGrowableArray<T*>.
+  // This is for supporting GrowableArray<T*>.
   //
   // E.g., PackageEntry** _pkg_entry_pointers[2]; // a buffer that has 2 PackageEntry pointers
   //       ...
@@ -440,11 +468,11 @@ public:
   // Array<Array<Klass*>*>* a4 = ...;  it->push(&a4);    => MSOPointerArrayRef
   // Array<Annotation*>*    a5 = ...;  it->push(&a5);    => MSOPointerArrayRef
   //
-  // AOTGrowableArrays have a separate "C array" buffer, so they are scanned in two steps:
+  // GrowableArrays have a separate "C array" buffer, so they are scanned in two steps:
   //
-  // AOTGrowableArray<jlong>*      ga1 = ...;  it->push(&ga1);  => MSORef => OtherCArrayRef
-  // AOTGrowableArray<Annotation>* ga2 = ...;  it->push(&ga2);  => MSORef => MSOCArrayRef
-  // AOTGrowableArray<Klass*>*     ga3 = ...;  it->push(&ga3);  => MSORef => MSOPointerCArrayRef
+  // GrowableArray<jlong>*      ga1 = ...;  it->push(&ga1);  => GrowableArrayRef => OtherCArrayRef
+  // GrowableArray<Annotation>* ga2 = ...;  it->push(&ga2);  => GrowableArrayRef => MSOCArrayRef
+  // GrowableArray<Klass*>*     ga3 = ...;  it->push(&ga3);  => GrowableArrayRef => MSOPointerCArrayRef
   //
   // Note that the following will fail to compile:
   //
@@ -476,7 +504,12 @@ public:
     push_with_ref<MSOPointerArrayRef<T>>(mpp, w);
   }
 
-  // --- The buffer of AOTGrowableArray<T>
+  template <typename T>
+  void push(GrowableArray<T>** mpp, Writability w = _default) {
+    push_with_ref<GrowableArrayRef<T>>(mpp, w);
+  }
+
+  // --- The buffer of GrowableArray<T>
   template <typename T, ENABLE_IF(!HAS_METASPACE_POINTERS_DO(T))>
   void push_c_array(T** mpp, int num_elems, Writability w = _default) {
     push_impl(new OtherCArrayRef<T>(mpp, num_elems, w));
diff --git a/src/hotspot/share/utilities/growableArray.cpp b/src/hotspot/share/utilities/growableArray.cpp
index 6a1cb0b0414..9cc0813a1f6 100644
--- a/src/hotspot/share/utilities/growableArray.cpp
+++ b/src/hotspot/share/utilities/growableArray.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1997, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -22,6 +22,7 @@
  *
  */
 
+#include "cds/aotMetaspace.hpp"
 #include "memory/allocation.inline.hpp"
 #include "memory/resourceArea.hpp"
 #include "runtime/javaThread.hpp"
@@ -56,7 +57,9 @@ void* GrowableArrayCHeapAllocator::allocate(int max, int element_size, MemTag me
 }
 
 void GrowableArrayCHeapAllocator::deallocate(void* elements) {
-  FreeHeap(elements);
+  if (!AOTMetaspace::in_aot_cache(elements)) {
+    FreeHeap(elements);
+  }
 }
 
 #ifdef ASSERT
diff --git a/src/hotspot/share/utilities/growableArray.hpp b/src/hotspot/share/utilities/growableArray.hpp
index e300bea6993..14b54cfc4ea 100644
--- a/src/hotspot/share/utilities/growableArray.hpp
+++ b/src/hotspot/share/utilities/growableArray.hpp
@@ -116,12 +116,6 @@ protected:
 
   ~GrowableArrayView() {}
 
-protected:
-  // Used by AOTGrowableArray for MetaspaceClosure support.
-  E** data_addr() {
-    return &_data;
-  }
-
 public:
   bool operator==(const GrowableArrayView& rhs) const {
     if (_len != rhs._len)
@@ -303,6 +297,11 @@ public:
     }
     tty->print("}\n");
   }
+
+  // MetaspaceClosure support
+  E** data_addr() {
+    return &_data;
+  }
 };
 
 template <typename E>
@@ -821,6 +820,8 @@ public:
       this->clear_and_deallocate();
     }
   }
+
+  void assert_on_C_heap() { assert(on_C_heap(), "must be on C heap"); }
 };
 
 // Leaner GrowableArray for CHeap backed data arrays, with compile-time decided MemTag.
diff --git a/test/hotspot/gtest/utilities/test_metaspaceClosure.cpp b/test/hotspot/gtest/utilities/test_metaspaceClosure.cpp
index c98b38b8c3c..091767cc273 100644
--- a/test/hotspot/gtest/utilities/test_metaspaceClosure.cpp
+++ b/test/hotspot/gtest/utilities/test_metaspaceClosure.cpp
@@ -21,7 +21,6 @@
  * questions.
  */
 
-#include "cds/aotGrowableArray.inline.hpp"
 #include "memory/allocation.hpp"
 #include "memory/metadataFactory.hpp"
 #include "memory/metaspaceClosure.hpp"
@@ -168,9 +167,9 @@ TEST_VM(MetaspaceClosure, OtherArrayRef) {
   EXPECT_TRUE(closure.has_visited(array)) << "must be";
 }
 
-// iterate an AOTGrowableArray<MyMetaData*>
+// iterate an GrowableArray<MyMetaData*>
 TEST_VM(MetaspaceClosure, GrowableArray_MSOPointer) {
-  AOTGrowableArray<MyMetaData*>* array = new(mtClass) AOTGrowableArray<MyMetaData*>(2, mtClass);
+  GrowableArray<MyMetaData*>* array = new(mtClass) GrowableArray<MyMetaData*>(2, mtClass);
 
   MyMetaData x;
   MyMetaData y;
@@ -190,9 +189,9 @@ TEST_VM(MetaspaceClosure, GrowableArray_MSOPointer) {
   EXPECT_TRUE(closure.has_visited(&z)) << "must be";
 }
 
-// iterate an AOTGrowableArray<MyMetaData>
+// iterate an GrowableArray<MyMetaData>
 TEST_VM(MetaspaceClosure, GrowableArray_MSO) {
-  AOTGrowableArray<MyMetaData>* array = new(mtClass) AOTGrowableArray<MyMetaData>(4, mtClass);
+  GrowableArray<MyMetaData>* array = new(mtClass) GrowableArray<MyMetaData>(4, mtClass);
 
   for (int i = 0; i < array->length(); i++) {
     EXPECT_TRUE(array->at(i)._a == nullptr) << "should be initialized to null";
@@ -218,9 +217,9 @@ TEST_VM(MetaspaceClosure, GrowableArray_MSO) {
   EXPECT_TRUE(closure.has_visited(&z)) << "must be";
 }
 
-// iterate an AOTGrowableArray<jlong>
+// iterate an GrowableArray<jlong>
 TEST_VM(MetaspaceClosure, GrowableArray_jlong) {
-  AOTGrowableArray<jlong>* array = new(mtClass) AOTGrowableArray<jlong>(4, mtClass);
+  GrowableArray<jlong>* array = new(mtClass) GrowableArray<jlong>(4, mtClass);
 
   MyUniqueMetaspaceClosure closure;
   closure.push(&array);

From f7c06959a1af73e4bb481b9c24bb252ad8ca7b4c Mon Sep 17 00:00:00 2001
From: Albert Mingkun Yang <ayang@openjdk.org>
Date: Fri, 10 Apr 2026 18:01:16 +0000
Subject: [PATCH 554/655] 8381998: Move UseCompressedClassPointers to obsolete
 flags section

Reviewed-by: stefank, phubner, dholmes
---
 src/hotspot/share/runtime/arguments.cpp | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/src/hotspot/share/runtime/arguments.cpp b/src/hotspot/share/runtime/arguments.cpp
index 225e7074076..2d40ee1822a 100644
--- a/src/hotspot/share/runtime/arguments.cpp
+++ b/src/hotspot/share/runtime/arguments.cpp
@@ -533,9 +533,6 @@ static SpecialFlag const special_jvm_flags[] = {
   { "DynamicDumpSharedSpaces",      JDK_Version::jdk(18), JDK_Version::jdk(19), JDK_Version::undefined() },
   { "RequireSharedSpaces",          JDK_Version::jdk(18), JDK_Version::jdk(19), JDK_Version::undefined() },
   { "UseSharedSpaces",              JDK_Version::jdk(18), JDK_Version::jdk(19), JDK_Version::undefined() },
-#ifdef _LP64
-  { "UseCompressedClassPointers",   JDK_Version::jdk(25),  JDK_Version::jdk(27), JDK_Version::undefined() },
-#endif
   { "AggressiveHeap",               JDK_Version::jdk(26),  JDK_Version::jdk(27), JDK_Version::jdk(28) },
   // --- Deprecated alias flags (see also aliased_jvm_flags) - sorted by obsolete_in then expired_in:
   { "CreateMinidumpOnCrash",        JDK_Version::jdk(9),  JDK_Version::undefined(), JDK_Version::undefined() },
@@ -546,6 +543,9 @@ static SpecialFlag const special_jvm_flags[] = {
 #if defined(AARCH64)
   { "NearCpool",                    JDK_Version::undefined(), JDK_Version::jdk(25), JDK_Version::undefined() },
 #endif
+#ifdef _LP64
+  { "UseCompressedClassPointers",   JDK_Version::jdk(25),  JDK_Version::jdk(27), JDK_Version::undefined() },
+#endif
 
   { "PSChunkLargeArrays",           JDK_Version::jdk(26),  JDK_Version::jdk(27), JDK_Version::jdk(28) },
   { "ParallelRefProcEnabled",       JDK_Version::jdk(26),  JDK_Version::jdk(27), JDK_Version::jdk(28) },

From 2b716d7b32d745fa135f479c5a236517e87014e2 Mon Sep 17 00:00:00 2001
From: Leonid Mesnik <lmesnik@openjdk.org>
Date: Fri, 10 Apr 2026 18:21:44 +0000
Subject: [PATCH 555/655] 8381658: Update nsk/jvmti/scenarios/sampling to
 better test virtual threads

Reviewed-by: cjplummer, sspitsyn
---
 .../scenarios/allocation/AP04/ap04t001.java   |   7 +-
 .../scenarios/allocation/AP04/ap04t002.java   |   7 +-
 .../scenarios/allocation/AP04/ap04t003.java   |   7 +-
 .../scenarios/bcinstr/BI04/bi04t002.java      |   5 +-
 .../scenarios/contention/TC04/tc04t001.java   |   5 +-
 .../jvmti/scenarios/events/EM02/em02t001.java |   7 +-
 .../jvmti/scenarios/events/EM02/em02t003.java |   8 +-
 .../EM02/em02t003/loadclass/em02t003a.java    |   5 +-
 .../EM02/em02t005/loadclass/em02t005a.java    |   5 +-
 .../jvmti/scenarios/events/EM02/em02t008.java |   9 +-
 .../jvmti/scenarios/events/EM05/em05t001.java |   5 +-
 .../jvmti/scenarios/events/EM05/em05t002.java |   5 +-
 .../jvmti/scenarios/events/EM07/em07t002.java |  10 +-
 .../EM07/em07t002/loadclass/em07t002a.java    |   5 +-
 .../scenarios/hotswap/HS101/hs101t001.java    |   5 +-
 .../scenarios/hotswap/HS101/hs101t002.java    |   5 +-
 .../scenarios/hotswap/HS101/hs101t003.java    |   5 +-
 .../scenarios/hotswap/HS101/hs101t004.java    |   5 +-
 .../scenarios/hotswap/HS101/hs101t005.java    |   5 +-
 .../scenarios/hotswap/HS101/hs101t006.java    |   5 +-
 .../scenarios/hotswap/HS101/hs101t007.java    |   5 +-
 .../scenarios/hotswap/HS101/hs101t008.java    |   5 +-
 .../scenarios/hotswap/HS102/hs102t001.java    |   5 +-
 .../scenarios/hotswap/HS102/hs102t002.java    |   5 +-
 .../hotswap/HS103/hs103t002/MyThread.java     |   6 +-
 .../HS103/hs103t002/newclass00/MyThread.java  |   6 +-
 .../hotswap/HS104/hs104t002/MyThread.java     |   5 +-
 .../HS104/hs104t002/newclass00/MyThread.java  |   5 +-
 .../scenarios/hotswap/HS201/hs201t001.java    |   7 +-
 .../scenarios/hotswap/HS201/hs201t002.java    |  12 +-
 .../scenarios/hotswap/HS201/hs201t003.java    |   6 +-
 .../hotswap/HS202/hs202t001/MyThread.java     |   7 +-
 .../hotswap/HS202/hs202t001/hs202t001.java    |   6 +-
 .../HS202/hs202t001/newclass00/MyThread.java  |   7 +-
 .../hotswap/HS202/hs202t002/MyThread.java     |   7 +-
 .../hotswap/HS202/hs202t002/hs202t002.java    |   8 +-
 .../HS202/hs202t002/newclass00/MyThread.java  |   7 +-
 .../hotswap/HS203/hs203t001/MyThread.java     |   6 +-
 .../hotswap/HS203/hs203t001/hs203t001.java    |   6 +-
 .../HS203/hs203t001/newclass00/MyThread.java  |   6 +-
 .../hotswap/HS203/hs203t002/MyThread.java     |   6 +-
 .../hotswap/HS203/hs203t002/hs203t002.java    |  12 +-
 .../HS203/hs203t002/newclass00/MyThread.java  |   6 +-
 .../hotswap/HS203/hs203t003/MyThread.java     |   6 +-
 .../hotswap/HS203/hs203t003/hs203t003.java    |   8 +-
 .../HS203/hs203t003/newclass00/MyThread.java  |   6 +-
 .../hotswap/HS203/hs203t004/MyThread.java     |   6 +-
 .../hotswap/HS203/hs203t004/hs203t004.java    |   8 +-
 .../HS203/hs203t004/newclass00/MyThread.java  |   6 +-
 .../hotswap/HS204/hs204t002/MyThread.java     |   7 +-
 .../HS204/hs204t002/newclass00/MyThread.java  |   7 +-
 .../hotswap/HS204/hs204t003/MyThread.java     |   6 +-
 .../hotswap/HS204/hs204t003/hs204t003.java    |   7 +-
 .../HS204/hs204t003/newclass00/MyThread.java  |   7 +-
 .../hotswap/HS204/hs204t004/hs204t004.java    |   8 +-
 .../scenarios/multienv/MA03/ma03t001.java     |   5 +-
 .../scenarios/sampling/SP01/sp01t001.java     |  19 +-
 .../sampling/SP01/sp01t001/sp01t001.cpp       |   4 +-
 .../nsk/share/ExtraClassesBuilder.java        |   4 +-
 test/lib/jdk/test/lib/Utils.java              |   7 +-
 .../jdk/test/lib/thread/ThreadWrapper.java    | 246 ++++++++++++++++++
 61 files changed, 489 insertions(+), 149 deletions(-)
 create mode 100644 test/lib/jdk/test/lib/thread/ThreadWrapper.java

diff --git a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/allocation/AP04/ap04t001.java b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/allocation/AP04/ap04t001.java
index df80009d315..1a539f4d37b 100644
--- a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/allocation/AP04/ap04t001.java
+++ b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/allocation/AP04/ap04t001.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2004, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2004, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -26,6 +26,7 @@ package nsk.jvmti.scenarios.allocation.AP04;
 import java.io.*;
 import java.lang.reflect.*;
 
+import jdk.test.lib.thread.ThreadWrapper;
 import nsk.share.*;
 import nsk.share.jvmti.*;
 
@@ -114,7 +115,7 @@ public class ap04t001 extends DebugeeClass {
         log.display("All objects collected");
 
         log.display("Wait for thread to finish");
-        joinThread(thread);
+        joinThread(thread.getThread());
 
         log.display("CASE #" + caseName + " finished.\n");
     }
@@ -172,7 +173,7 @@ class ap04t001SomeReachachableObjectsIterator implements ap04t001Iterator {
 }
 
 /**************************************************************************/
-class ap04t001Thread extends Thread {
+class ap04t001Thread extends ThreadWrapper {
     String name;
     ap04t001Iterator iterator;
     Wicket startLock;
diff --git a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/allocation/AP04/ap04t002.java b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/allocation/AP04/ap04t002.java
index 9ecadf22f08..962474e0d01 100644
--- a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/allocation/AP04/ap04t002.java
+++ b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/allocation/AP04/ap04t002.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2004, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2004, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -26,6 +26,7 @@ package nsk.jvmti.scenarios.allocation.AP04;
 import java.io.*;
 import java.lang.reflect.*;
 
+import jdk.test.lib.thread.ThreadWrapper;
 import nsk.share.*;
 import nsk.share.jvmti.*;
 
@@ -100,7 +101,7 @@ public class ap04t002 extends DebugeeClass {
             modified++;
 
         log.display("Wait for completion thread to finish");
-        joinThread(thread);
+        joinThread(thread.getThread());
         log.display("Cleaning tags and references to objects...");
         for (int i = 0; i < OBJ_MAX_COUNT; i++) {
             if (root[i] != null) {
@@ -166,7 +167,7 @@ class ap04t002SomeReachachableObjectsIterator implements ap04t002Iterator {
 }
 
 /**************************************************************************/
-class ap04t002Thread extends Thread {
+class ap04t002Thread extends ThreadWrapper {
     String name;
     ap04t002Iterator iterator;
     Wicket startLock;
diff --git a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/allocation/AP04/ap04t003.java b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/allocation/AP04/ap04t003.java
index 15e7aa1c63a..60ca7cea837 100644
--- a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/allocation/AP04/ap04t003.java
+++ b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/allocation/AP04/ap04t003.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2004, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2004, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -26,6 +26,7 @@ package nsk.jvmti.scenarios.allocation.AP04;
 import java.io.*;
 import java.lang.reflect.*;
 
+import jdk.test.lib.thread.ThreadWrapper;
 import nsk.share.*;
 import nsk.share.jvmti.*;
 
@@ -98,7 +99,7 @@ public class ap04t003 extends DebugeeClass {
         ap04t003Thread thread = startThread( threadName, iterator);
 
         log.display("Wait for thread to finish");
-        joinThread(thread);
+        joinThread(thread.getThread());
         log.display("Cleaning tags and references to objects...");
         for (int i = 0; i < OBJ_MAX_COUNT; i++) {
             if (root[i] != null) {
@@ -164,7 +165,7 @@ class ap04t003SomeReachachableObjectsIterator implements ap04t003Iterator {
 }
 
 /**************************************************************************/
-class ap04t003Thread extends Thread {
+class ap04t003Thread extends ThreadWrapper {
     String name;
     ap04t003Iterator iterator;
     Wicket startLock;
diff --git a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/bcinstr/BI04/bi04t002.java b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/bcinstr/BI04/bi04t002.java
index 87a0de5d31d..db5ddf45a7c 100644
--- a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/bcinstr/BI04/bi04t002.java
+++ b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/bcinstr/BI04/bi04t002.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2004, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2004, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -30,6 +30,7 @@ import nsk.share.Consts;
 
 import nsk.share.jvmti.ArgumentHandler;
 import nsk.share.jvmti.DebugeeClass;
+import jdk.test.lib.thread.ThreadWrapper;
 
 public class bi04t002 extends DebugeeClass {
 
@@ -118,7 +119,7 @@ public class bi04t002 extends DebugeeClass {
     }
 }
 
-class bi04t002b extends Thread {
+class bi04t002b extends ThreadWrapper {
 
     Object obj = new Object();
     static Object started = new Object();
diff --git a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/contention/TC04/tc04t001.java b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/contention/TC04/tc04t001.java
index 0707f38b4dd..2aa37d5d4ce 100644
--- a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/contention/TC04/tc04t001.java
+++ b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/contention/TC04/tc04t001.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2004, 2019, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2004, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -28,6 +28,7 @@ import java.util.concurrent.*;
 
 import nsk.share.*;
 import nsk.share.jvmti.*;
+import jdk.test.lib.thread.ThreadWrapper;
 
 public class tc04t001 extends DebugeeClass {
 
@@ -92,7 +93,7 @@ public class tc04t001 extends DebugeeClass {
 
 /* =================================================================== */
 
-class tc04t001Thread extends Thread {
+class tc04t001Thread extends ThreadWrapper {
 
     final static int INCREMENT_LIMIT = 100;
     final static int DELAY = 1000;
diff --git a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/events/EM02/em02t001.java b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/events/EM02/em02t001.java
index 9f92bf5423e..c37f0649067 100644
--- a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/events/EM02/em02t001.java
+++ b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/events/EM02/em02t001.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2004, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2004, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -27,6 +27,7 @@ import java.io.PrintStream;
 
 import nsk.share.*;
 import nsk.share.jvmti.*;
+import jdk.test.lib.thread.ThreadWrapper;
 
 public class em02t001 extends DebugeeClass {
 
@@ -65,7 +66,7 @@ public class em02t001 extends DebugeeClass {
         logger.display("Timeout = " + timeout + " msc.");
 
         for (int i = 0; i < 3; i++) {
-            debuggeeThread = new em02t001Thread("Debuggee Thread");
+            debuggeeThread = new em02t001Thread("Debuggee Thread").getThread();
 
             generateEvents();
 
@@ -113,7 +114,7 @@ public class em02t001 extends DebugeeClass {
     }
 
     // tested threads
-    class em02t001Thread extends Thread {
+    class em02t001Thread extends ThreadWrapper {
 
         public em02t001Thread(String name) {
             super(name);
diff --git a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/events/EM02/em02t003.java b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/events/EM02/em02t003.java
index a23732dc554..0914b0129f2 100644
--- a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/events/EM02/em02t003.java
+++ b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/events/EM02/em02t003.java
@@ -33,6 +33,8 @@ import nsk.share.jvmti.*;
 import java.util.*;
 import java.math.*;
 
+import jdk.test.lib.thread.ThreadWrapper;
+
 public class em02t003 extends DebugeeClass {
 
     // run test from command line
@@ -74,7 +76,7 @@ public class em02t003 extends DebugeeClass {
         }
 
         Class<?> loadedClass;
-        Thread thrd;
+        ThreadWrapper thrd;
 
         ClassUnloader unloader = new ClassUnloader();
         for (int i = 0; i < 3; i++) {
@@ -90,7 +92,7 @@ public class em02t003 extends DebugeeClass {
             loadedClass = unloader.getLoadedClass();
 
             try {
-                thrd = (Thread )loadedClass.newInstance();
+                thrd = ((ThreadWrapper)loadedClass.newInstance());
             } catch (Exception e) {
                 logger.complain("Unexpected exception " + e);
                 e.printStackTrace();
@@ -139,7 +141,7 @@ public class em02t003 extends DebugeeClass {
         return status;
     }
 
-    boolean invokeMethod(Class<?> cls, Thread thrd, String methodName) {
+    boolean invokeMethod(Class<?> cls, ThreadWrapper thrd, String methodName) {
 
         Method method;
 
diff --git a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/events/EM02/em02t003/loadclass/em02t003a.java b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/events/EM02/em02t003/loadclass/em02t003a.java
index 32150e99ed6..8b11a8cd961 100644
--- a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/events/EM02/em02t003/loadclass/em02t003a.java
+++ b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/events/EM02/em02t003/loadclass/em02t003a.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2004, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2004, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -22,8 +22,9 @@
  */
 
 package nsk.jvmti.scenarios.events.EM02;
+import jdk.test.lib.thread.ThreadWrapper;
 
-public class em02t003a extends Thread {
+public class em02t003a extends ThreadWrapper {
 
     public void run() {
         // invoke methods in a loop to provoke compilation
diff --git a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/events/EM02/em02t005/loadclass/em02t005a.java b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/events/EM02/em02t005/loadclass/em02t005a.java
index ee340084946..89bd00f5f83 100644
--- a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/events/EM02/em02t005/loadclass/em02t005a.java
+++ b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/events/EM02/em02t005/loadclass/em02t005a.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2004, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2004, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -22,8 +22,9 @@
  */
 
 package nsk.jvmti.scenarios.events.EM02;
+import jdk.test.lib.thread.ThreadWrapper;
 
-public class em02t005a extends Thread {
+public class em02t005a extends ThreadWrapper {
 
     public void em02t005a() {
     }
diff --git a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/events/EM02/em02t008.java b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/events/EM02/em02t008.java
index 7e30300c41b..a5a7e4298fe 100644
--- a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/events/EM02/em02t008.java
+++ b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/events/EM02/em02t008.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2004, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2004, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -27,6 +27,7 @@ import java.io.PrintStream;
 
 import nsk.share.*;
 import nsk.share.jvmti.*;
+import jdk.test.lib.thread.ThreadWrapper;
 
 public class em02t008 extends DebugeeClass {
 
@@ -55,7 +56,7 @@ public class em02t008 extends DebugeeClass {
         int status = Consts.TEST_PASSED;
         long  timeout = argHandler.getWaitTime() * 60000; // milliseconds
 
-        Thread thrd1, thrd2;
+        ThreadWrapper thrd1, thrd2;
 
         for (int i = 0; i < STEP_NUMBER; i++) {
             thrd1 = new em02t008a();
@@ -79,7 +80,7 @@ public class em02t008 extends DebugeeClass {
         return status;
     }
 
-    class em02t008a extends Thread{
+    class em02t008a extends ThreadWrapper {
 
         em02t008a() {
             setName("em02t008a");
@@ -90,7 +91,7 @@ public class em02t008 extends DebugeeClass {
         }
     }
 
-    class em02t008b extends Thread{
+    class em02t008b extends ThreadWrapper {
 
         em02t008b() {
             setName("em02t008b");
diff --git a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/events/EM05/em05t001.java b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/events/EM05/em05t001.java
index 3fa8e076729..11a7efd6bd8 100644
--- a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/events/EM05/em05t001.java
+++ b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/events/EM05/em05t001.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -27,6 +27,7 @@ import java.io.PrintStream;
 
 import nsk.share.*;
 import nsk.share.jvmti.*;
+import jdk.test.lib.thread.ThreadWrapper;
 
 public class em05t001 extends DebugeeClass {
 
@@ -95,7 +96,7 @@ public class em05t001 extends DebugeeClass {
 /* =================================================================== */
 
 // tested threads
-class em05t001Thread extends Thread {
+class em05t001Thread extends ThreadWrapper {
     public void run() {
         // invoke methods in a loop to provoke compilation
         for (int i = 0; i < 100; i++) {
diff --git a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/events/EM05/em05t002.java b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/events/EM05/em05t002.java
index 011f03e8cc0..378d770dd06 100644
--- a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/events/EM05/em05t002.java
+++ b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/events/EM05/em05t002.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -27,6 +27,7 @@ import java.io.PrintStream;
 
 import nsk.share.*;
 import nsk.share.jvmti.*;
+import jdk.test.lib.thread.ThreadWrapper;
 
 public class em05t002 extends DebugeeClass {
 
@@ -98,7 +99,7 @@ public class em05t002 extends DebugeeClass {
 /* =================================================================== */
 
 // tested threads
-class em05t002Thread extends Thread {
+class em05t002Thread extends ThreadWrapper {
     public void run() {
         // invoke methods in a loop to provoke compilation
         for (int i = 0; i < 100; i++) {
diff --git a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/events/EM07/em07t002.java b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/events/EM07/em07t002.java
index dcaca552073..852549276ec 100644
--- a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/events/EM07/em07t002.java
+++ b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/events/EM07/em07t002.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2004, 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2004, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -31,6 +31,8 @@ import java.io.File;
 import nsk.share.*;
 import nsk.share.jvmti.*;
 
+import jdk.test.lib.thread.ThreadWrapper;
+
 /**
  * Test executes the following scenario to check events <code>COMPILED_METHOD_LOAD</code>,
  * <code>COMPILED_METHOD_UNLOAD</code>:
@@ -118,7 +120,7 @@ public class em07t002 extends DebugeeClass {
         String path = args[0];
 
         Class<?> loadedClass;
-        Thread thrd;
+        ThreadWrapper thrd;
         ClassUnloader unloader = new ClassUnloader();
         for (int i = 0; i < attempts; i++) {
             logger.display("======================================");
@@ -136,7 +138,7 @@ public class em07t002 extends DebugeeClass {
             loadedClass = unloader.getLoadedClass();
 
             try {
-                thrd = (Thread )loadedClass.newInstance();
+                thrd = (ThreadWrapper)loadedClass.newInstance();
             } catch (Exception e) {
                 logger.complain("Unexpected exception " + e);
                 e.printStackTrace();
@@ -170,7 +172,7 @@ public class em07t002 extends DebugeeClass {
         return status;
     }
 
-    boolean invokeMethod(Class<?> cls, Thread thrd, String methodName) {
+    boolean invokeMethod(Class<?> cls, ThreadWrapper thrd, String methodName) {
 
         Method method;
 
diff --git a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/events/EM07/em07t002/loadclass/em07t002a.java b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/events/EM07/em07t002/loadclass/em07t002a.java
index 3f03fd95568..dc3abe49296 100644
--- a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/events/EM07/em07t002/loadclass/em07t002a.java
+++ b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/events/EM07/em07t002/loadclass/em07t002a.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2004, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2004, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -22,8 +22,9 @@
  */
 
 package nsk.jvmti.scenarios.events.EM07;
+import jdk.test.lib.thread.ThreadWrapper;
 
-public class em07t002a extends Thread {
+public class em07t002a extends ThreadWrapper {
 
     public void run() {
         // invoke methods in a loop to provoke compilation
diff --git a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS101/hs101t001.java b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS101/hs101t001.java
index 21fc0a0e158..b3c1c25833c 100644
--- a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS101/hs101t001.java
+++ b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS101/hs101t001.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2004, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2004, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,6 +25,7 @@ package nsk.jvmti.scenarios.hotswap.HS101;
 
 import java.io.PrintStream;
 
+import jdk.test.lib.thread.ThreadWrapper;
 import nsk.share.*;
 import nsk.share.jvmti.*;
 
@@ -115,7 +116,7 @@ public class hs101t001 extends DebugeeClass {
 
 /* =================================================================== */
 
-class hs101t001Thread extends Thread {
+class hs101t001Thread extends ThreadWrapper {
     public Wicket startingBarrier = new Wicket();
     private volatile boolean flag = true;
     public int i;
diff --git a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS101/hs101t002.java b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS101/hs101t002.java
index 368ed04a01e..e654dde6db0 100644
--- a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS101/hs101t002.java
+++ b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS101/hs101t002.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2004, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2004, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,6 +25,7 @@ package nsk.jvmti.scenarios.hotswap.HS101;
 
 import java.io.PrintStream;
 
+import jdk.test.lib.thread.ThreadWrapper;
 import nsk.share.*;
 import nsk.share.jvmti.*;
 
@@ -115,7 +116,7 @@ public class hs101t002 extends DebugeeClass {
 
 /* =================================================================== */
 
-class hs101t002Thread extends Thread {
+class hs101t002Thread extends ThreadWrapper {
     public Wicket startingBarrier = new Wicket();
     private volatile boolean flag = true;
     public int i;
diff --git a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS101/hs101t003.java b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS101/hs101t003.java
index 2d554fd73ec..f08d07f2c17 100644
--- a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS101/hs101t003.java
+++ b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS101/hs101t003.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2004, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2004, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,6 +25,7 @@ package nsk.jvmti.scenarios.hotswap.HS101;
 
 import java.io.PrintStream;
 
+import jdk.test.lib.thread.ThreadWrapper;
 import nsk.share.*;
 import nsk.share.jvmti.*;
 
@@ -115,7 +116,7 @@ public class hs101t003 extends DebugeeClass {
 
 /* =================================================================== */
 
-class hs101t003Thread extends Thread {
+class hs101t003Thread extends ThreadWrapper {
     public Wicket startingBarrier = new Wicket();
     private volatile boolean flag = true;
     public int i;
diff --git a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS101/hs101t004.java b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS101/hs101t004.java
index f43609ab042..121cb4a0aac 100644
--- a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS101/hs101t004.java
+++ b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS101/hs101t004.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2004, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2004, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,6 +25,7 @@ package nsk.jvmti.scenarios.hotswap.HS101;
 
 import java.io.PrintStream;
 
+import jdk.test.lib.thread.ThreadWrapper;
 import nsk.share.*;
 import nsk.share.jvmti.*;
 
@@ -98,7 +99,7 @@ public class hs101t004 extends DebugeeClass {
 
 /* =================================================================== */
 
-class hs101t004Thread extends Thread {
+class hs101t004Thread extends ThreadWrapper {
     public Wicket startingBarrier = new Wicket();
     private volatile boolean flag = true;
     public int i;
diff --git a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS101/hs101t005.java b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS101/hs101t005.java
index afee53a2331..31bba4a409a 100644
--- a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS101/hs101t005.java
+++ b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS101/hs101t005.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2004, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2004, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,6 +25,7 @@ package nsk.jvmti.scenarios.hotswap.HS101;
 
 import java.io.PrintStream;
 
+import jdk.test.lib.thread.ThreadWrapper;
 import nsk.share.*;
 import nsk.share.jvmti.*;
 
@@ -98,7 +99,7 @@ public class hs101t005 extends DebugeeClass {
 
 /* =================================================================== */
 
-class hs101t005Thread extends Thread {
+class hs101t005Thread extends ThreadWrapper {
     public Wicket startingBarrier = new Wicket();
     private volatile boolean flag = true;
     public int i;
diff --git a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS101/hs101t006.java b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS101/hs101t006.java
index 98568577032..a27521dcbd9 100644
--- a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS101/hs101t006.java
+++ b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS101/hs101t006.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2004, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2004, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,6 +25,7 @@ package nsk.jvmti.scenarios.hotswap.HS101;
 
 import java.io.PrintStream;
 
+import jdk.test.lib.thread.ThreadWrapper;
 import nsk.share.*;
 import nsk.share.jvmti.*;
 
@@ -98,7 +99,7 @@ public class hs101t006 extends DebugeeClass {
 
 /* =================================================================== */
 
-class hs101t006Thread extends Thread {
+class hs101t006Thread extends ThreadWrapper {
     public Wicket startingBarrier = new Wicket();
     private volatile boolean flag = true;
     public int i;
diff --git a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS101/hs101t007.java b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS101/hs101t007.java
index f19805e9d1a..270fd7751a4 100644
--- a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS101/hs101t007.java
+++ b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS101/hs101t007.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2004, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2004, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,6 +25,7 @@ package nsk.jvmti.scenarios.hotswap.HS101;
 
 import java.io.PrintStream;
 
+import jdk.test.lib.thread.ThreadWrapper;
 import nsk.share.*;
 import nsk.share.jvmti.*;
 
@@ -95,7 +96,7 @@ public class hs101t007 extends DebugeeClass {
 
 /* =================================================================== */
 
-class hs101t007Thread extends Thread {
+class hs101t007Thread extends ThreadWrapper {
     public Wicket startingBarrier = new Wicket();
     private volatile boolean flag = true;
     public int i;
diff --git a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS101/hs101t008.java b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS101/hs101t008.java
index b421cf3c185..9fca9678d0a 100644
--- a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS101/hs101t008.java
+++ b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS101/hs101t008.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2004, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2004, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,6 +25,7 @@ package nsk.jvmti.scenarios.hotswap.HS101;
 
 import java.io.PrintStream;
 
+import jdk.test.lib.thread.ThreadWrapper;
 import nsk.share.*;
 import nsk.share.jvmti.*;
 
@@ -95,7 +96,7 @@ public class hs101t008 extends DebugeeClass {
 
 /* =================================================================== */
 
-class hs101t008Thread extends Thread {
+class hs101t008Thread extends ThreadWrapper {
     public Wicket startingBarrier = new Wicket();
     private volatile boolean flag = true;
     public int i;
diff --git a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS102/hs102t001.java b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS102/hs102t001.java
index 29d7aca6935..09ba44a5c32 100644
--- a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS102/hs102t001.java
+++ b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS102/hs102t001.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2004, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2004, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,6 +25,7 @@ package nsk.jvmti.scenarios.hotswap.HS102;
 
 import java.io.PrintStream;
 
+import jdk.test.lib.thread.ThreadWrapper;
 import nsk.share.*;
 import nsk.share.jvmti.*;
 
@@ -150,7 +151,7 @@ public class hs102t001 extends DebugeeClass {
 
 /* =================================================================== */
 
-class hs102t001Thread extends Thread {
+class hs102t001Thread extends ThreadWrapper {
     public Wicket startingBarrier = new Wicket();
     private volatile boolean flag = true;
     public int i;
diff --git a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS102/hs102t002.java b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS102/hs102t002.java
index a34f3f6c109..c38fb07fb69 100644
--- a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS102/hs102t002.java
+++ b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS102/hs102t002.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2004, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2004, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,6 +25,7 @@ package nsk.jvmti.scenarios.hotswap.HS102;
 
 import java.io.PrintStream;
 
+import jdk.test.lib.thread.ThreadWrapper;
 import nsk.share.*;
 import nsk.share.jvmti.*;
 
@@ -150,7 +151,7 @@ public class hs102t002 extends DebugeeClass {
 
 /* =================================================================== */
 
-class hs102t002Thread extends Thread {
+class hs102t002Thread extends ThreadWrapper {
     public Wicket startingBarrier = new Wicket();
     private volatile boolean flag = true;
     public int i;
diff --git a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS103/hs103t002/MyThread.java b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS103/hs103t002/MyThread.java
index 9f7d6e2f5c8..09fef278ca5 100644
--- a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS103/hs103t002/MyThread.java
+++ b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS103/hs103t002/MyThread.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2007, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2007, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -22,9 +22,11 @@
  */
 package nsk.jvmti.scenarios.hotswap.HS103.hs103t002;
 
+import jdk.test.lib.thread.ThreadWrapper;
+
 import java.util.concurrent.atomic.AtomicInteger;
 
-public class MyThread extends Thread {
+public class MyThread extends ThreadWrapper {
     public static AtomicInteger ai = new AtomicInteger(0);
     public static final int size = 10;
 
diff --git a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS103/hs103t002/newclass00/MyThread.java b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS103/hs103t002/newclass00/MyThread.java
index 404ab78ff55..5874a1e11fc 100644
--- a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS103/hs103t002/newclass00/MyThread.java
+++ b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS103/hs103t002/newclass00/MyThread.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2007, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2007, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -22,9 +22,11 @@
  */
 package nsk.jvmti.scenarios.hotswap.HS103.hs103t002;
 
+import jdk.test.lib.thread.ThreadWrapper;
+
 import java.util.concurrent.atomic.AtomicInteger;
 
-public class MyThread extends Thread {
+public class MyThread extends ThreadWrapper {
     public static AtomicInteger ai = new AtomicInteger(0);
     public static final int size = 10;
 
diff --git a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS104/hs104t002/MyThread.java b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS104/hs104t002/MyThread.java
index 771dfeeb054..2c5dfcf070c 100644
--- a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS104/hs104t002/MyThread.java
+++ b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS104/hs104t002/MyThread.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2007, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2007, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -22,9 +22,10 @@
  */
 package nsk.jvmti.scenarios.hotswap.HS104.hs104t002;
 
+import jdk.test.lib.thread.ThreadWrapper;
 import nsk.share.Wicket;
 
-public class MyThread extends Thread {
+public class MyThread extends ThreadWrapper {
 
     int threadState;
     private  Wicket wicket;
diff --git a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS104/hs104t002/newclass00/MyThread.java b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS104/hs104t002/newclass00/MyThread.java
index 6ebbc04b5c1..409a3f6ffcc 100644
--- a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS104/hs104t002/newclass00/MyThread.java
+++ b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS104/hs104t002/newclass00/MyThread.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2007, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2007, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -22,9 +22,10 @@
  */
 package nsk.jvmti.scenarios.hotswap.HS104.hs104t002;
 
+import jdk.test.lib.thread.ThreadWrapper;
 import nsk.share.Wicket;
 
-public class MyThread extends Thread {
+public class MyThread extends ThreadWrapper {
 
     int threadState;
     private  Wicket wicket;
diff --git a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS201/hs201t001.java b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS201/hs201t001.java
index 2f6e2b15db7..2cb0f1bc683 100644
--- a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS201/hs201t001.java
+++ b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS201/hs201t001.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2004, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2004, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -27,6 +27,7 @@ import java.io.PrintStream;
 
 import nsk.share.*;
 import nsk.share.jvmti.*;
+import jdk.test.lib.thread.ThreadWrapper;
 
 public class hs201t001 extends DebugeeClass {
 
@@ -74,7 +75,7 @@ public class hs201t001 extends DebugeeClass {
         timeout = argHandler.getWaitTime() * 60 * 1000; // milliseconds
 
         log.display(">>> starting tested thread");
-        Thread thread = new hs201t001Thread();
+        Thread thread = new hs201t001Thread().getThread();
 
         // testing sync
         status = checkStatus(status);
@@ -130,7 +131,7 @@ public class hs201t001 extends DebugeeClass {
         return status;
     }
 
-class hs201t001Thread extends Thread {
+class hs201t001Thread extends ThreadWrapper {
 
     hs201t001Thread() {
         setName("hs201t001Thread");
diff --git a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS201/hs201t002.java b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS201/hs201t002.java
index c76a9b005d1..69d243d49b1 100644
--- a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS201/hs201t002.java
+++ b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS201/hs201t002.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2004, 2022, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2004, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -28,6 +28,7 @@ import java.util.concurrent.CountDownLatch;
 
 import nsk.share.*;
 import nsk.share.jvmti.*;
+import jdk.test.lib.thread.ThreadWrapper;
 
 public class hs201t002 extends DebugeeClass {
 
@@ -74,7 +75,8 @@ public class hs201t002 extends DebugeeClass {
         timeout = argHandler.getWaitTime() * 60 * 1000; // milliseconds
 
         log.display(">>> starting tested thread");
-        hs201t002Thread thread = new hs201t002Thread();
+        hs201t002Thread wrappedThread = new hs201t002Thread();
+        Thread thread = wrappedThread.getThread();
 
         // testing sync
         status = checkStatus(status);
@@ -84,12 +86,12 @@ public class hs201t002 extends DebugeeClass {
         // setThread(thread) enables JVMTI events, and that can only be done on a live thread,
         // so wait until the thread has started.
         try {
-            thread.ready.await();
+            wrappedThread.ready.await();
         } catch (InterruptedException e) {
         }
         setThread(thread);
 
-        thread.go.countDown();
+        wrappedThread.go.countDown();
 
         while (currentStep != 4) {
             try {
@@ -148,7 +150,7 @@ public class hs201t002 extends DebugeeClass {
         return status;
     }
 
-class hs201t002Thread extends Thread {
+class hs201t002Thread extends ThreadWrapper {
 
     CountDownLatch ready = new CountDownLatch(1);
     CountDownLatch go = new CountDownLatch(1);
diff --git a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS201/hs201t003.java b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS201/hs201t003.java
index f33afd148e8..fc0680f88eb 100644
--- a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS201/hs201t003.java
+++ b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS201/hs201t003.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2004, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2004, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,6 +25,8 @@ package nsk.jvmti.scenarios.hotswap.HS201;
 
 import java.io.*;
 import java.util.*;
+
+import jdk.test.lib.thread.ThreadWrapper;
 import nsk.share.*;
 import nsk.share.jvmti.*;
 
@@ -187,7 +189,7 @@ public class hs201t003 extends DebugeeClass {
     /**
      * Class executing a class to be redefined.
      */
-    class RedefClassWrapper extends Thread {
+    class RedefClassWrapper extends ThreadWrapper {
         boolean stopMe = false;
 
         RedefClassWrapper() {
diff --git a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS202/hs202t001/MyThread.java b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS202/hs202t001/MyThread.java
index ecb702f1873..b94ed1f8faa 100644
--- a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS202/hs202t001/MyThread.java
+++ b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS202/hs202t001/MyThread.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2007, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2007, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -21,7 +21,10 @@
  * questions.
  */
 package nsk.jvmti.scenarios.hotswap.HS202.hs202t001;
-public class MyThread extends Thread {
+
+import jdk.test.lib.thread.ThreadWrapper;
+
+public class MyThread extends ThreadWrapper {
         MyObject myObject;
         public MyThread(MyObject obj) {
                 this.myObject = obj;
diff --git a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS202/hs202t001/hs202t001.java b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS202/hs202t001/hs202t001.java
index c386a88dc12..788d4114498 100644
--- a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS202/hs202t001/hs202t001.java
+++ b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS202/hs202t001/hs202t001.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2007, 2020, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2007, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -80,8 +80,8 @@ public class hs202t001 extends RedefineAgent {
                 add(myObject, 1);
             }
             myObject.stop(true);
-            if( popThreadFrame(mt)) {;
-                resumeThread(mt);
+            if( popThreadFrame(mt.getThread())) {;
+                resumeThread(mt.getThread());
             } // Popoing will not be possible on ..
             mt.join();
             state = myObject.getAge();
diff --git a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS202/hs202t001/newclass00/MyThread.java b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS202/hs202t001/newclass00/MyThread.java
index 9fbccbbcfab..7fc9dcf161a 100644
--- a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS202/hs202t001/newclass00/MyThread.java
+++ b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS202/hs202t001/newclass00/MyThread.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2007, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2007, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -21,7 +21,10 @@
  * questions.
  */
 package nsk.jvmti.scenarios.hotswap.HS202.hs202t001;
-public class MyThread extends Thread {
+
+import jdk.test.lib.thread.ThreadWrapper;
+
+public class MyThread extends ThreadWrapper {
         MyObject myObject;
         public MyThread(MyObject obj) {
                 this.myObject = obj;
diff --git a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS202/hs202t002/MyThread.java b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS202/hs202t002/MyThread.java
index 45ec4af6249..c5e8fd6eb46 100644
--- a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS202/hs202t002/MyThread.java
+++ b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS202/hs202t002/MyThread.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2007, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2007, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -21,7 +21,10 @@
  * questions.
  */
 package nsk.jvmti.scenarios.hotswap.HS202.hs202t002;
-public class MyThread extends Thread {
+
+import jdk.test.lib.thread.ThreadWrapper;
+
+public class MyThread extends ThreadWrapper {
     private int val = 100;
 
     public void run() {
diff --git a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS202/hs202t002/hs202t002.java b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS202/hs202t002/hs202t002.java
index e78702cc587..dd295195543 100644
--- a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS202/hs202t002/hs202t002.java
+++ b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS202/hs202t002/hs202t002.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2007, 2020, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2007, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -70,15 +70,15 @@ public class hs202t002 extends RedefineAgent {
         try {
             mt.start();
 
-            while (!isThreadSuspended(mt)) {
+            while (!isThreadSuspended(mt.getThread())) {
                 Thread.yield();
             }
 
-            if (!popThreadFrame(mt)) {
+            if (!popThreadFrame(mt.getThread())) {
                 throw new RuntimeException("error in popframe operation!");
             }
 
-            if (!resumeThread(mt)) {
+            if (!resumeThread(mt.getThread())) {
                 throw new RuntimeException("error in resuming thread!");
             }
 
diff --git a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS202/hs202t002/newclass00/MyThread.java b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS202/hs202t002/newclass00/MyThread.java
index 32a7a085a13..1af54872316 100644
--- a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS202/hs202t002/newclass00/MyThread.java
+++ b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS202/hs202t002/newclass00/MyThread.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2007, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2007, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -21,7 +21,10 @@
  * questions.
  */
 package nsk.jvmti.scenarios.hotswap.HS202.hs202t002;
-public class MyThread extends Thread {
+
+import jdk.test.lib.thread.ThreadWrapper;
+
+public class MyThread extends ThreadWrapper {
     private int val = 100;
 
     public void run() {
diff --git a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS203/hs203t001/MyThread.java b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS203/hs203t001/MyThread.java
index c5646af4024..109ea8ec918 100644
--- a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS203/hs203t001/MyThread.java
+++ b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS203/hs203t001/MyThread.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2007, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2007, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -21,8 +21,10 @@
  * questions.
  */
 package nsk.jvmti.scenarios.hotswap.HS203.hs203t001;
+import jdk.test.lib.thread.ThreadWrapper;
+
 import java.util.concurrent.atomic.AtomicBoolean;
-public class MyThread extends Thread {
+public class MyThread extends ThreadWrapper {
         public static AtomicBoolean resume = new AtomicBoolean(false);
         public int threadState=100;
         public MyThread() {
diff --git a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS203/hs203t001/hs203t001.java b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS203/hs203t001/hs203t001.java
index abbe8221444..e42bede4e01 100644
--- a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS203/hs203t001/hs203t001.java
+++ b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS203/hs203t001/hs203t001.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2007, 2020, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2007, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -76,8 +76,8 @@ public class hs203t001 extends RedefineAgent {
             mt.start();
             while(!MyThread.resume.get());
             Thread.sleep(10000);
-            popThreadFrame(mt);
-            resumeThread(mt);
+            popThreadFrame(mt.getThread());
+            resumeThread(mt.getThread());
             mt.join();
             log.println(" ..."+mt.threadState);
         } catch(Exception ie) {
diff --git a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS203/hs203t001/newclass00/MyThread.java b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS203/hs203t001/newclass00/MyThread.java
index 4ddbfc43c79..c5792c9789d 100644
--- a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS203/hs203t001/newclass00/MyThread.java
+++ b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS203/hs203t001/newclass00/MyThread.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2007, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2007, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -21,8 +21,10 @@
  * questions.
  */
 package nsk.jvmti.scenarios.hotswap.HS203.hs203t001;
+import jdk.test.lib.thread.ThreadWrapper;
+
 import java.util.concurrent.atomic.AtomicBoolean;
-public class MyThread extends Thread {
+public class MyThread extends ThreadWrapper {
         public static AtomicBoolean resume = new AtomicBoolean(false);
         public int threadState=10;
         public MyThread() {
diff --git a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS203/hs203t002/MyThread.java b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS203/hs203t002/MyThread.java
index 94eee8ebe07..787da2529d6 100644
--- a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS203/hs203t002/MyThread.java
+++ b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS203/hs203t002/MyThread.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2007, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2007, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -21,8 +21,10 @@
  * questions.
  */
 package nsk.jvmti.scenarios.hotswap.HS203.hs203t002;
+import jdk.test.lib.thread.ThreadWrapper;
+
 import java.util.concurrent.atomic.AtomicBoolean;
-public class MyThread extends Thread {
+public class MyThread extends ThreadWrapper {
         public static AtomicBoolean resume = new AtomicBoolean(false);
         public static AtomicBoolean resume2 = new AtomicBoolean(false);
         public int threadState=100;
diff --git a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS203/hs203t002/hs203t002.java b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS203/hs203t002/hs203t002.java
index d9dd4a88c80..f62bd49f674 100644
--- a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS203/hs203t002/hs203t002.java
+++ b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS203/hs203t002/hs203t002.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2007, 2020, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2007, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -77,14 +77,14 @@ public class hs203t002 extends RedefineAgent {
             while(!MyThread.resume.get());
             MyThread.resume.set(false);
             Thread.sleep(10000);
-            popThreadFrame(mt);
-            resumeThread(mt);
+            popThreadFrame(mt.getThread());
+            resumeThread(mt.getThread());
             while(!MyThread.resume2.get());
             Thread.sleep(10000);
-                        suspendThread(mt);
+                        suspendThread(mt.getThread());
             //mt.suspend();
-            popThreadFrame(mt);
-            resumeThread(mt);
+            popThreadFrame(mt.getThread());
+            resumeThread(mt.getThread());
             MyThread.resume.set(true);
             mt.join();
                         log.println(" ..."+mt.threadState);
diff --git a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS203/hs203t002/newclass00/MyThread.java b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS203/hs203t002/newclass00/MyThread.java
index cce4bd7326e..185bb0bd5e1 100644
--- a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS203/hs203t002/newclass00/MyThread.java
+++ b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS203/hs203t002/newclass00/MyThread.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2007, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2007, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -21,8 +21,10 @@
  * questions.
  */
 package nsk.jvmti.scenarios.hotswap.HS203.hs203t002;
+import jdk.test.lib.thread.ThreadWrapper;
+
 import java.util.concurrent.atomic.AtomicBoolean;
-public class MyThread extends Thread {
+public class MyThread extends ThreadWrapper {
         public static AtomicBoolean resume = new AtomicBoolean(false);
         public static AtomicBoolean resume2 = new AtomicBoolean(false);
         public int threadState=100;
diff --git a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS203/hs203t003/MyThread.java b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS203/hs203t003/MyThread.java
index dd07c191f38..7942e765299 100644
--- a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS203/hs203t003/MyThread.java
+++ b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS203/hs203t003/MyThread.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2007, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2007, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -22,9 +22,11 @@
  */
 package nsk.jvmti.scenarios.hotswap.HS203.hs203t003;
 
+import jdk.test.lib.thread.ThreadWrapper;
+
 import java.util.concurrent.atomic.AtomicBoolean;
 
-public class MyThread extends Thread {
+public class MyThread extends ThreadWrapper {
         public static AtomicBoolean resume = new AtomicBoolean(false);
         public int threadState=0;
     // field watch is added on.
diff --git a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS203/hs203t003/hs203t003.java b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS203/hs203t003/hs203t003.java
index 348dc8b5ee4..6c4a018e0b7 100644
--- a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS203/hs203t003/hs203t003.java
+++ b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS203/hs203t003/hs203t003.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2007, 2020, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2007, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -93,7 +93,7 @@ public class hs203t003 extends RedefineAgent {
                 Thread.sleep(100);
             }
             // Wait for the thread to be suspended.
-            while (!isSuspended(mt)) {
+            while (!isSuspended(mt.getThread())) {
                 if (!agentStatus()) {
                     System.out.println("Failed to suspend thread");
                     return passed;
@@ -101,12 +101,12 @@ public class hs203t003 extends RedefineAgent {
                 Thread.sleep(100);
             }
             // Pop the frame.
-            if (!popThreadFrame(mt)) {
+            if (!popThreadFrame(mt.getThread())) {
                 System.out.println("Failed to pop a frame = "
                                    + mt.threadState);
             }
             // Resume the thread.
-            if(!resumeThread(mt)) {
+            if(!resumeThread(mt.getThread())) {
                 System.out.println("Failed to resume the thread = "
                                    + mt.threadState);
             }
diff --git a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS203/hs203t003/newclass00/MyThread.java b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS203/hs203t003/newclass00/MyThread.java
index e60b3da5c4b..105f90e360c 100644
--- a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS203/hs203t003/newclass00/MyThread.java
+++ b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS203/hs203t003/newclass00/MyThread.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2007, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2007, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -22,8 +22,10 @@
  */
 package nsk.jvmti.scenarios.hotswap.HS203.hs203t003;
 
+import jdk.test.lib.thread.ThreadWrapper;
+
 import java.util.concurrent.atomic.AtomicBoolean;
-public class MyThread extends Thread {
+public class MyThread extends ThreadWrapper {
 
         public static AtomicBoolean resume = new AtomicBoolean(false);
         public int threadState=100;
diff --git a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS203/hs203t004/MyThread.java b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS203/hs203t004/MyThread.java
index 8cf6750917a..84eea67fe4a 100644
--- a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS203/hs203t004/MyThread.java
+++ b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS203/hs203t004/MyThread.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2007, 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2007, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -22,7 +22,9 @@
  */
 package nsk.jvmti.scenarios.hotswap.HS203.hs203t004;
 
-public class MyThread extends Thread {
+import jdk.test.lib.thread.ThreadWrapper;
+
+public class MyThread extends ThreadWrapper {
 
     public static volatile boolean stop = true;
 
diff --git a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS203/hs203t004/hs203t004.java b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS203/hs203t004/hs203t004.java
index f9f1aa8a270..c8b1f09bf1e 100644
--- a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS203/hs203t004/hs203t004.java
+++ b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS203/hs203t004/hs203t004.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2007, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2007, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -82,11 +82,11 @@ public class hs203t004 extends RedefineAgent {
                 Thread.yield();
             }
 
-            suspendThread(myThread);
+            suspendThread(myThread.getThread());
 
-            popThreadFrame(myThread);
+            popThreadFrame(myThread.getThread());
 
-            resumeThread(myThread);
+            resumeThread(myThread.getThread());
 
             MyThread.stop = false;
             myThread.join();
diff --git a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS203/hs203t004/newclass00/MyThread.java b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS203/hs203t004/newclass00/MyThread.java
index 7276b8cc5fd..f63dcc4577e 100644
--- a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS203/hs203t004/newclass00/MyThread.java
+++ b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS203/hs203t004/newclass00/MyThread.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2007, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2007, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,7 +23,9 @@
 
 package nsk.jvmti.scenarios.hotswap.HS203.hs203t004;
 
-public class MyThread extends Thread {
+import jdk.test.lib.thread.ThreadWrapper;
+
+public class MyThread extends ThreadWrapper {
 
     public static volatile boolean stop = true;
 
diff --git a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS204/hs204t002/MyThread.java b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS204/hs204t002/MyThread.java
index c502e124814..5a220345c2d 100644
--- a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS204/hs204t002/MyThread.java
+++ b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS204/hs204t002/MyThread.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2007, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2007, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -21,7 +21,10 @@
  * questions.
  */
 package nsk.jvmti.scenarios.hotswap.HS204.hs204t002;
-public class MyThread extends Thread{
+
+import jdk.test.lib.thread.ThreadWrapper;
+
+public class MyThread extends ThreadWrapper {
         public static int value=100;
         static {
                 System.out.println("  ... Break Point here..");
diff --git a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS204/hs204t002/newclass00/MyThread.java b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS204/hs204t002/newclass00/MyThread.java
index 0556e5dd45e..2fb796f1f56 100644
--- a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS204/hs204t002/newclass00/MyThread.java
+++ b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS204/hs204t002/newclass00/MyThread.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2007, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2007, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -21,7 +21,10 @@
  * questions.
  */
 package nsk.jvmti.scenarios.hotswap.HS204.hs204t002;
-public class MyThread extends Thread{
+
+import jdk.test.lib.thread.ThreadWrapper;
+
+public class MyThread extends ThreadWrapper {
         public static int value=200;
         static {
                 System.out.println("  ... Break Point here..");
diff --git a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS204/hs204t003/MyThread.java b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS204/hs204t003/MyThread.java
index 7e9ba68c85d..51f8af20995 100644
--- a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS204/hs204t003/MyThread.java
+++ b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS204/hs204t003/MyThread.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2007, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2007, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -22,7 +22,9 @@
  */
 package nsk.jvmti.scenarios.hotswap.HS204.hs204t003;
 
-public class MyThread extends Thread {
+import jdk.test.lib.thread.ThreadWrapper;
+
+public class MyThread extends ThreadWrapper {
 
 
         private static volatile int intState=100;
diff --git a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS204/hs204t003/hs204t003.java b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS204/hs204t003/hs204t003.java
index b0f716794dc..6607f76899c 100644
--- a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS204/hs204t003/hs204t003.java
+++ b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS204/hs204t003/hs204t003.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2007, 2020, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2007, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -61,6 +61,7 @@
 package nsk.jvmti.scenarios.hotswap.HS204.hs204t003;
 
 import nsk.share.jvmti.RedefineAgent;
+import jdk.test.lib.thread.ThreadWrapper;
 public class hs204t003 extends RedefineAgent {
     public native boolean popFrame(Thread thread) ;
 
@@ -82,7 +83,7 @@ public class hs204t003 extends RedefineAgent {
             TempThread temp = new TempThread();
             temp.start();
             Thread.sleep(10000);
-            popFrame(temp);
+            popFrame(temp.getThread());
             temp.join();
             mthread = temp.mthread;
             mthread.start();
@@ -104,7 +105,7 @@ public class hs204t003 extends RedefineAgent {
         return passed;
         }
 }
-class TempThread extends Thread {
+class TempThread extends ThreadWrapper {
     public MyThread mthread;
     public TempThread() {
         super("TempThread.");
diff --git a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS204/hs204t003/newclass00/MyThread.java b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS204/hs204t003/newclass00/MyThread.java
index be2bc229538..b685015a2e3 100644
--- a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS204/hs204t003/newclass00/MyThread.java
+++ b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS204/hs204t003/newclass00/MyThread.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2007, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2007, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -21,7 +21,10 @@
  * questions.
  */
 package nsk.jvmti.scenarios.hotswap.HS204.hs204t003;
-public class MyThread extends Thread {
+
+import jdk.test.lib.thread.ThreadWrapper;
+
+public class MyThread extends ThreadWrapper {
         private static volatile int intState=0;
     public static int count=100;
     static {
diff --git a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS204/hs204t004/hs204t004.java b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS204/hs204t004/hs204t004.java
index e06eceeb425..08cd7d22d56 100644
--- a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS204/hs204t004/hs204t004.java
+++ b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/hotswap/HS204/hs204t004/hs204t004.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2007, 2020, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2007, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -51,6 +51,8 @@
 
 package nsk.jvmti.scenarios.hotswap.HS204.hs204t004;
 import java.util.concurrent.atomic.AtomicBoolean;
+
+import jdk.test.lib.thread.ThreadWrapper;
 import nsk.share.jvmti.RedefineAgent;
 
 public class hs204t004 extends RedefineAgent {
@@ -71,7 +73,7 @@ public class hs204t004 extends RedefineAgent {
                         mt.start();
                         while(!MyThread.resume.get()) ;
                         Thread.sleep(10000);
-                        popFrame(mt);
+                        popFrame(mt.getThread());
                         mt.join();
                 } catch(Exception exp) {
                         exp.printStackTrace();
@@ -88,7 +90,7 @@ public class hs204t004 extends RedefineAgent {
         public static native boolean popFrame(Thread thread);
 }
 
-class MyThread extends Thread {
+class MyThread extends ThreadWrapper {
         public static AtomicBoolean resume = new AtomicBoolean(false);
         public String name="MyThread";
 
diff --git a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/multienv/MA03/ma03t001.java b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/multienv/MA03/ma03t001.java
index 87751c5960f..7aab6551203 100644
--- a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/multienv/MA03/ma03t001.java
+++ b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/multienv/MA03/ma03t001.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2004, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2004, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -27,6 +27,7 @@ import java.io.PrintStream;
 
 import nsk.share.*;
 import nsk.share.jvmti.*;
+import jdk.test.lib.thread.ThreadWrapper;
 
 public class ma03t001 extends DebugeeClass {
 
@@ -79,7 +80,7 @@ public class ma03t001 extends DebugeeClass {
 
 /* =================================================================== */
 
-class ma03t001Thread extends Thread {
+class ma03t001Thread extends ThreadWrapper {
     public Wicket startingBarrier = new Wicket();
     public Wicket endingBarrier = new Wicket();
 
diff --git a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/sampling/SP01/sp01t001.java b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/sampling/SP01/sp01t001.java
index 7686e68952e..4c9d9bc65a4 100644
--- a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/sampling/SP01/sp01t001.java
+++ b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/sampling/SP01/sp01t001.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -28,6 +28,8 @@ import java.io.PrintStream;
 import nsk.share.*;
 import nsk.share.jvmti.*;
 
+import jdk.test.lib.thread.ThreadWrapper;
+
 public class sp01t001 extends DebugeeClass {
 
     // run test from command line
@@ -51,7 +53,8 @@ public class sp01t001 extends DebugeeClass {
     int status = Consts.TEST_PASSED;
 
     // tested threads list
-    static sp01t001Thread threads[] = null;
+    static sp01t001Thread threadWrappers[] = null;
+    static Thread threads[] = null;
     static int indexStartedThread = 0;
 
     // run debuggee class
@@ -60,21 +63,25 @@ public class sp01t001 extends DebugeeClass {
         log = new Log(out, argHandler);
 
         // create threads list
-        threads = new sp01t001Thread[] {
+        threadWrappers = new sp01t001Thread[] {
             // not started thread
             new sp01t001ThreadNotStarted(),
             // started threads
             new sp01t001ThreadFinished()
         };
+        threads = new Thread[] {
+            threadWrappers[0].getThread(),
+            threadWrappers[1].getThread()
+        };
         indexStartedThread = 1;
 
         // run threads
         try {
             // start threads
             for (int i = indexStartedThread; i < threads.length; i++) {
-                synchronized (threads[i].startingMonitor) {
+                synchronized (threadWrappers[i].startingMonitor) {
                     threads[i].start();
-                    threads[i].startingMonitor.wait();
+                    threadWrappers[i].startingMonitor.wait();
                 }
             }
 
@@ -98,7 +105,7 @@ public class sp01t001 extends DebugeeClass {
 /* =================================================================== */
 
 // basic class for tested threads
-abstract class sp01t001Thread extends Thread {
+abstract class sp01t001Thread extends ThreadWrapper {
     public Object startingMonitor = new Object();
 }
 
diff --git a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/sampling/SP01/sp01t001/sp01t001.cpp b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/sampling/SP01/sp01t001/sp01t001.cpp
index 40db16504b6..93a4e05b135 100644
--- a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/sampling/SP01/sp01t001/sp01t001.cpp
+++ b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/sampling/SP01/sp01t001/sp01t001.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -34,7 +34,7 @@ extern "C" {
 
 /* constant names */
 #define DEBUGEE_CLASS_NAME      "nsk/jvmti/scenarios/sampling/SP01/sp01t001"
-#define THREAD_CLASS_NAME       "nsk/jvmti/scenarios/sampling/SP01/sp01t001Thread"
+#define THREAD_CLASS_NAME       "java/lang/Thread"
 #define THREADS_FIELD_NAME      "threads"
 #define THREADS_FIELD_SIG       "[L" THREAD_CLASS_NAME ";"
 
diff --git a/test/hotspot/jtreg/vmTestbase/nsk/share/ExtraClassesBuilder.java b/test/hotspot/jtreg/vmTestbase/nsk/share/ExtraClassesBuilder.java
index 162f8fa84c6..d92b1ef6b15 100644
--- a/test/hotspot/jtreg/vmTestbase/nsk/share/ExtraClassesBuilder.java
+++ b/test/hotspot/jtreg/vmTestbase/nsk/share/ExtraClassesBuilder.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -63,6 +63,8 @@ public class ExtraClassesBuilder {
         JDKToolLauncher javac = JDKToolLauncher.create("javac")
                                                .addToolArg("-d")
                                                .addToolArg(dst.toString())
+                                               .addToolArg("-sourcepath")
+                                               .addToolArg(Utils.TEST_SRC_PATH)
                                                .addToolArg("-cp")
                                                .addToolArg(Utils.TEST_CLASS_PATH);
 
diff --git a/test/lib/jdk/test/lib/Utils.java b/test/lib/jdk/test/lib/Utils.java
index 2f46ed87340..95b7a117b2c 100644
--- a/test/lib/jdk/test/lib/Utils.java
+++ b/test/lib/jdk/test/lib/Utils.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2013, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2013, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -105,6 +105,11 @@ public final class Utils {
      */
     public static final String TEST_SRC = System.getProperty("test.src", "").trim();
 
+    /**
+     * Returns the value of 'test.src.path' system property.
+     */
+    public static final String TEST_SRC_PATH = System.getProperty("test.src.path", "").trim();
+
     /**
      * Returns the value of 'test.root' system property.
      */
diff --git a/test/lib/jdk/test/lib/thread/ThreadWrapper.java b/test/lib/jdk/test/lib/thread/ThreadWrapper.java
new file mode 100644
index 00000000000..ab850bf5a4a
--- /dev/null
+++ b/test/lib/jdk/test/lib/thread/ThreadWrapper.java
@@ -0,0 +1,246 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+
+package jdk.test.lib.thread;
+
+import java.time.Duration;
+import java.util.Map;
+
+/*
+    The ThreadWrapper is a helper class that allows to extend
+    coverage of virtual threads testing for existing tests with threads.
+
+    Specifically, it is useful for the pattern where Thread is extended
+    by some class. Example:
+
+    class resumethrd02Thread extends Thread {...}
+    ...
+    resumethrd02Thread thr = new resumethrd02Thread();
+
+    The test can be updated to use this wrapper:
+    class resumethrd02Thread extends ThreadWrapper {...}
+    ...
+    resumethrd02Thread thr = new resumethrd02Thread();
+
+    So resumethrd02Thread can be run with platform or virtual threads.
+
+    Method getThread() is used to get instance of Thread.
+
+    It is not expected to use this wrapper for new tests or classes that
+    are not extending Thread. The TestThreadFactory should be used to
+    create threads in such cases.
+ */
+
+public class ThreadWrapper implements Runnable {
+    private final Thread thread;
+
+    @SuppressWarnings("this-escape")
+    public ThreadWrapper() {
+        // thread is a platform or virtual thread
+        thread = TestThreadFactory.newThread(this);
+    }
+
+    @SuppressWarnings("this-escape")
+    public ThreadWrapper(String name) {
+        // thread is a platform or virtual thread
+        thread = TestThreadFactory.newThread(this, name);
+    }
+
+    public Thread getThread() {
+        return thread;
+    }
+
+    public static Thread currentThread() {
+        return Thread.currentThread();
+    }
+
+    public static void yield() {
+        Thread.yield();
+    }
+
+    public static void sleep(long millis) throws InterruptedException {
+        Thread.sleep(millis);
+    }
+
+    public static void sleep(long millis, int nanos) throws InterruptedException {
+        Thread.sleep(millis, nanos);
+    }
+
+    public static void sleep(Duration duration) throws InterruptedException {
+        Thread.sleep(duration);
+    }
+
+    public static void onSpinWait() {
+        Thread.onSpinWait();
+    }
+
+    public static Thread.Builder.OfPlatform ofPlatform() {
+        return Thread.ofPlatform();
+    }
+
+    public static Thread.Builder.OfVirtual ofVirtual() {
+        return Thread.ofVirtual();
+    }
+
+    public static Thread startVirtualThread(Runnable task) {
+        return Thread.startVirtualThread(task);
+    }
+
+    public boolean isVirtual() {
+        return thread.isVirtual();
+    }
+
+    public void start() {
+        thread.start();
+    }
+
+    public void run() {
+    }
+
+    public void interrupt() {
+        thread.interrupt();
+    }
+
+    public static boolean interrupted() {
+        return Thread.interrupted();
+    }
+
+    public boolean isInterrupted() {
+        return thread.isInterrupted();
+    }
+
+    public boolean isAlive() {
+        return thread.isAlive();
+    }
+
+    public void setPriority(int newPriority) {
+        thread.setPriority(newPriority);
+    }
+
+    public int getPriority() {
+        return thread.getPriority();
+    }
+
+    public void setName(String name) {
+        thread.setName(name);
+    }
+
+    public String getName() {
+        return thread.getName();
+    }
+
+    public ThreadGroup getThreadGroup() {
+        return thread.getThreadGroup();
+    }
+
+    public static int activeCount() {
+        return Thread.activeCount();
+    }
+
+    public static int enumerate(Thread[] tarray) {
+        return Thread.enumerate(tarray);
+    }
+
+    public void join(long millis) throws InterruptedException {
+        thread.join(millis);
+    }
+
+    public void join(long millis, int nanos) throws InterruptedException {
+        thread.join(millis, nanos);
+    }
+
+    public void join() throws InterruptedException {
+        thread.join();
+    }
+
+    public boolean join(Duration duration) throws InterruptedException {
+        return thread.join(duration);
+    }
+
+    public static void dumpStack() {
+        Thread.dumpStack();
+    }
+
+    public void setDaemon(boolean on) {
+        thread.setDaemon(on);
+    }
+
+    public boolean isDaemon() {
+        return thread.isDaemon();
+    }
+
+    @Override
+    public String toString() {
+        return thread.toString();
+    }
+
+    public ClassLoader getContextClassLoader() {
+        return thread.getContextClassLoader();
+    }
+
+    public void setContextClassLoader(ClassLoader cl) {
+        thread.setContextClassLoader(cl);
+    }
+
+    public static boolean holdsLock(Object obj) {
+        return Thread.holdsLock(obj);
+    }
+
+    public StackTraceElement[] getStackTrace() {
+        return thread.getStackTrace();
+    }
+
+    public static Map<Thread, StackTraceElement[]> getAllStackTraces() {
+        return Thread.getAllStackTraces();
+    }
+
+    @Deprecated(since = "19")
+    public long getId() {
+        return thread.getId();
+    }
+
+    public long threadId() {
+        return thread.threadId();
+    }
+
+    public Thread.State getState() {
+        return thread.getState();
+    }
+
+    public static void setDefaultUncaughtExceptionHandler(Thread.UncaughtExceptionHandler ueh) {
+        Thread.setDefaultUncaughtExceptionHandler(ueh);
+    }
+
+    public static Thread.UncaughtExceptionHandler getDefaultUncaughtExceptionHandler() {
+        return Thread.getDefaultUncaughtExceptionHandler();
+    }
+
+    public Thread.UncaughtExceptionHandler getUncaughtExceptionHandler() {
+        return thread.getUncaughtExceptionHandler();
+    }
+
+    public void setUncaughtExceptionHandler(Thread.UncaughtExceptionHandler ueh) {
+        thread.setUncaughtExceptionHandler(ueh);
+    }
+}

From aa5677afcbb4c42248168c364889cbd910327c0c Mon Sep 17 00:00:00 2001
From: Vladimir Ivanov <vlivanov@openjdk.org>
Date: Fri, 10 Apr 2026 18:36:58 +0000
Subject: [PATCH 556/655] 8374496: C2: assert(val->find_edge(con) > 0) failed

Reviewed-by: chagedorn, dfenacci
---
 src/hotspot/share/opto/parse2.cpp             |  2 +-
 .../types/TestSubTypeCheckMismatch.java       | 50 +++++++++++++++++++
 2 files changed, 51 insertions(+), 1 deletion(-)
 create mode 100644 test/hotspot/jtreg/compiler/types/TestSubTypeCheckMismatch.java

diff --git a/src/hotspot/share/opto/parse2.cpp b/src/hotspot/share/opto/parse2.cpp
index a7c5398171b..ae20418942d 100644
--- a/src/hotspot/share/opto/parse2.cpp
+++ b/src/hotspot/share/opto/parse2.cpp
@@ -1803,8 +1803,8 @@ static bool match_type_check(PhaseGVN& gvn,
       assert(idx == 1 || idx == 2, "");
       Node* vcon = val->in(idx);
 
-      assert(val->find_edge(con) > 0, "");
       if ((btest == BoolTest::eq && vcon == con) || (btest == BoolTest::ne && vcon != con)) {
+        assert(val->find_edge(con) > 0, "mismatch");
         SubTypeCheckNode* sub = b1->in(1)->as_SubTypeCheck();
         Node* obj_or_subklass = sub->in(SubTypeCheckNode::ObjOrSubKlass);
         Node* superklass = sub->in(SubTypeCheckNode::SuperKlass);
diff --git a/test/hotspot/jtreg/compiler/types/TestSubTypeCheckMismatch.java b/test/hotspot/jtreg/compiler/types/TestSubTypeCheckMismatch.java
new file mode 100644
index 00000000000..5fcf93625a1
--- /dev/null
+++ b/test/hotspot/jtreg/compiler/types/TestSubTypeCheckMismatch.java
@@ -0,0 +1,50 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+/**
+ * @test
+ * @bug 8374496
+ * @summary "C2: assert(val->find_edge(con) > 0) failed"
+ *
+ * @run main/othervm -Xbatch ${test.main.class}
+ */
+package compiler.types;
+
+public class TestSubTypeCheckMismatch {
+    static class A {}
+
+    static Integer test(Object o, int a, int b) {
+        int i = -1;
+        if (o instanceof A) { // results in SubTypeCheck node and diamond-shape if
+            i = Math.min(a, b);
+        }
+        return Integer.valueOf(i); // late inlined
+    }
+
+    public static void main(String[] args) {
+        for (int i = 0; i < 20_000; i++) {
+            test(new A(),      0, 0);
+            test(new Object(), 0, 0);
+        }
+    }
+}

From 322f3a3447419ae661eb83be6b1ae07dc41562ce Mon Sep 17 00:00:00 2001
From: Andrew Dinn <adinn@openjdk.org>
Date: Fri, 10 Apr 2026 19:16:46 +0000
Subject: [PATCH 557/655] 8381932: Publish stubgen entries when
 -XX:-AOTStubCaching configured

Reviewed-by: asmehra, kvn
---
 src/hotspot/share/code/aotCodeCache.cpp    | 10 +++---
 src/hotspot/share/code/aotCodeCache.hpp    |  8 +++--
 src/hotspot/share/runtime/stubRoutines.cpp | 41 +++++++++++++---------
 3 files changed, 33 insertions(+), 26 deletions(-)

diff --git a/src/hotspot/share/code/aotCodeCache.cpp b/src/hotspot/share/code/aotCodeCache.cpp
index 79211e75db4..a3dd3d2bfd0 100644
--- a/src/hotspot/share/code/aotCodeCache.cpp
+++ b/src/hotspot/share/code/aotCodeCache.cpp
@@ -1862,11 +1862,8 @@ void AOTCodeReader::read_dbg_strings(DbgStrings& dbg_strings) {
 // addresses, respectively, keyed by the relevant address
 
 void AOTCodeAddressTable::hash_address(address addr, int idx) {
-  // only do this if we are caching stubs and we have a non-null
-  // address to record
-  if (!AOTStubCaching) {
-    return;
-  }
+  // only do this if we have a non-null address to record and the
+  // cache is open for dumping
   if (addr == nullptr) {
     return;
   }
@@ -2515,10 +2512,11 @@ AOTStubData::AOTStubData(BlobId blob_id) :
   // cannot be accessed before initialising the universe
   if (blob_id == BlobId::stubgen_preuniverse_id) {
     // invalidate any attempt to use this
-    _flags |= INVALID;
+    _flags = INVALID;
     return;
   }
   if (AOTCodeCache::is_on()) {
+    _flags = OPEN;
     // allow update of stub entry addresses
     if (AOTCodeCache::is_using_stub()) {
       // allow stub loading
diff --git a/src/hotspot/share/code/aotCodeCache.hpp b/src/hotspot/share/code/aotCodeCache.hpp
index c4ebe271767..5b773a986f1 100644
--- a/src/hotspot/share/code/aotCodeCache.hpp
+++ b/src/hotspot/share/code/aotCodeCache.hpp
@@ -236,9 +236,10 @@ private:
   // whether we are loading or storing stubs or have encountered any
   // invalid stubs.
   enum Flags {
-    USING   = 1 << 0,            // open and loading stubs
-    DUMPING = 1 << 1,            // open and storing stubs
-    INVALID = 1 << 2,            // found invalid stub when loading
+    OPEN    = 1 << 0,            // cache is open
+    USING   = 1 << 1,            // open and loading stubs
+    DUMPING = 1 << 2,            // open and storing stubs
+    INVALID = 1 << 3,            // found invalid stub when loading
   };
 
   uint32_t _flags;
@@ -253,6 +254,7 @@ public:
 
   ~AOTStubData()    CDS_ONLY({FREE_C_HEAP_ARRAY(StubAddrRange, _ranges);}) NOT_CDS({})
 
+  bool is_open()    CDS_ONLY({ return (_flags & OPEN) != 0; }) NOT_CDS_RETURN_(false);
   bool is_using()   CDS_ONLY({ return (_flags & USING) != 0; }) NOT_CDS_RETURN_(false);
   bool is_dumping() CDS_ONLY({ return (_flags & DUMPING) != 0; }) NOT_CDS_RETURN_(false);
   bool is_invalid() CDS_ONLY({ return (_flags & INVALID) != 0; }) NOT_CDS_RETURN_(false);
diff --git a/src/hotspot/share/runtime/stubRoutines.cpp b/src/hotspot/share/runtime/stubRoutines.cpp
index 0bc71c65471..f5509b9d996 100644
--- a/src/hotspot/share/runtime/stubRoutines.cpp
+++ b/src/hotspot/share/runtime/stubRoutines.cpp
@@ -178,18 +178,23 @@ static BufferBlob* initialize_stubs(BlobId blob_id,
   AOTStubData* stub_data_p = nullptr;
   LogTarget(Info, stubs) lt;
 
+  // we need to track and publish details of stubs in a stubgen blob
+  // when we are 1) using stubs from the cache 2) dumping stubs to the
+  // cache 3) generating stubs that may be needed by other cache
+  // elements.
+
+  if (stub_data.is_open()) {
+    stub_data_p = &stub_data;
+  }
   if (code_size > 0 && stub_data.is_using()) {
-    // AOTCodeEntry tracks and logs status of any cached blob
-    bool loaded = stub_data.load_code_blob();
-    if (loaded) {
+    // try to load the blob and details of its stubs from cache. if
+    // that fails we will still generate all necessary stubs
+    if (stub_data.load_code_blob()) {
       if (lt.is_enabled()) {
         LogStream ls(lt);
         ls.print_cr("Found blob %s in AOT cache", StubInfo::name(blob_id));
       }
-      stub_data_p = &stub_data;
     }
-  } else if (stub_data.is_dumping()) {
-    stub_data_p = &stub_data;
   }
 
   // Even if we managed to load a blob from the AOT cache we still
@@ -236,17 +241,8 @@ static BufferBlob* initialize_stubs(BlobId blob_id,
          "increase %s, code_size: %d, used: %d, free: %d",
          assert_msg, code_size, buffer.total_content_size(), buffer.insts_remaining());
 
-  if (stub_data.is_using()) {
-    // we generated some new entries so republish all entries TODO -
-    // ensure we publish collect and publish the preuniverse stubs but
-    // don't try to save them
-    AOTCodeCache::publish_stub_addresses(*stubs_code, blob_id, &stub_data);
-    if (lt.is_enabled()) {
-      LogStream ls(lt);
-      ls.print_cr("Republished entries for blob '%s'", buffer_name);
-    }
-  } else if (stub_data.is_dumping()) {
-    // save the blob and publihs the entry addresses
+  if (stub_data.is_dumping()) {
+    // save the blob and publish the entry addresses
     if (stub_data.store_code_blob(*stubs_code, &buffer)) {
       if (lt.is_enabled()) {
         LogStream ls(lt);
@@ -258,6 +254,17 @@ static BufferBlob* initialize_stubs(BlobId blob_id,
         ls.print_cr("Failed to store blob '%s' to Startup Code Cache", buffer_name);
       }
     }
+  } else if (stub_data.is_open()) {
+    // we either loaded some entries or generated new entries so
+    // publish all entries
+    //
+    // TODO - ensure we publish collect and publish the preuniverse
+    // stubs but don't try to save them
+    AOTCodeCache::publish_stub_addresses(*stubs_code, blob_id, &stub_data);
+    if (lt.is_enabled()) {
+      LogStream ls(lt);
+      ls.print_cr("Republished entries for blob '%s'", buffer_name);
+    }
   }
 
   // close off recording of any further stubgen generation

From 88bd42d0350c126581b740bc9044aebcdb0138da Mon Sep 17 00:00:00 2001
From: William Kemper <wkemper@openjdk.org>
Date: Fri, 10 Apr 2026 19:39:39 +0000
Subject: [PATCH 558/655] 8314599: [GenShen] Couple adaptive tenuring and
 generation size budgeting

Reviewed-by: kdnilsen, xpeng, ruili
---
 .../shenandoahGenerationalHeuristics.cpp      | 124 ++++++++----------
 .../shenandoahGenerationalHeuristics.hpp      |  13 +-
 .../gc/shenandoah/shenandoahAgeCensus.cpp     |   9 ++
 .../gc/shenandoah/shenandoahAgeCensus.hpp     |   6 +
 .../shenandoah/test_shenandoahAgeCensus.cpp   |   9 +-
 5 files changed, 93 insertions(+), 68 deletions(-)

diff --git a/src/hotspot/share/gc/shenandoah/heuristics/shenandoahGenerationalHeuristics.cpp b/src/hotspot/share/gc/shenandoah/heuristics/shenandoahGenerationalHeuristics.cpp
index 45ba2740ea5..a12f48c0877 100644
--- a/src/hotspot/share/gc/shenandoah/heuristics/shenandoahGenerationalHeuristics.cpp
+++ b/src/hotspot/share/gc/shenandoah/heuristics/shenandoahGenerationalHeuristics.cpp
@@ -38,11 +38,6 @@
 
 using idx_t = ShenandoahSimpleBitMap::idx_t;
 
-typedef struct {
-  ShenandoahHeapRegion* _region;
-  size_t _live_data;
-} AgedRegionData;
-
 static int compare_by_aged_live(AgedRegionData a, AgedRegionData b) {
   if (a._live_data < b._live_data)
     return -1;
@@ -321,12 +316,48 @@ void ShenandoahGenerationalHeuristics::filter_regions(ShenandoahCollectionSet* c
                                            immediate_garbage);
 }
 
-// Select for inclusion into the collection set all regions whose age is at or above tenure age and for which the
-// garbage percentage exceeds a dynamically adjusted threshold (known as the old-garbage threshold percentage).  We
-// identify these regions by setting the appropriate entry of the collection set's preselected regions array to true.
-// All entries are initialized to false before calling this function.
+void ShenandoahGenerationalHeuristics::add_tenured_regions_to_collection_set(const size_t old_promotion_reserve,
+                                                                               ShenandoahGenerationalHeap *const heap,
+                                                                               size_t candidates, AgedRegionData* sorted_regions) {
+  size_t old_consumed = 0;
+  if (candidates > 0) {
+    // Sort in increasing order according to live data bytes.  Note that
+    // candidates represents the number of regions that qualify to be promoted
+    // by evacuation.
+    QuickSort::sort<AgedRegionData>(sorted_regions, candidates,
+                                    compare_by_aged_live);
+
+    size_t selected_regions = 0;
+    size_t selected_live = 0;
+    for (size_t i = 0; i < candidates; i++) {
+      ShenandoahHeapRegion *const region = sorted_regions[i]._region;
+      const size_t region_live_data = sorted_regions[i]._live_data;
+      const size_t promotion_need = (size_t)(region_live_data * ShenandoahPromoEvacWaste);
+      if (old_consumed + promotion_need > old_promotion_reserve) {
+        // We rejected the remaining promotable regions from the collection set
+        // because we have no room to hold their evacuees. We do not need to
+        // iterate the remaining regions to estimate the amount we expect to
+        // promote because we know it directly form the census we computed
+        // during the preceding mark phase.
+        break;
+      }
+
+      old_consumed += promotion_need;
+      heap->collection_set()->add_region(region);
+      selected_regions++;
+      selected_live += region_live_data;
+    }
+    log_debug(gc, ergo)( "Preselected %zu regions containing " PROPERFMT " live data,"
+                        " consuming: " PROPERFMT " of budgeted: " PROPERFMT,
+                        selected_regions, PROPERFMTARGS(selected_live),
+                        PROPERFMTARGS(old_consumed), PROPERFMTARGS(old_promotion_reserve));
+  }
+}
+
+// Select for inclusion into the collection set all regions whose age is at or
+// above tenure age and for which the
+// garbage percentage exceeds a dynamically adjusted threshold (known as the old-garbage threshold percentage).
 //
-// During the subsequent selection of the collection set, we give priority to these promotion set candidates.
 // Without this prioritization, we found that the aged regions tend to be ignored because they typically have
 // much less garbage and much more live data than the recently allocated "eden" regions.  When aged regions are
 // repeatedly excluded from the collection set, the amount of live memory within the young generation tends to
@@ -334,8 +365,8 @@ void ShenandoahGenerationalHeuristics::filter_regions(ShenandoahCollectionSet* c
 // CPU and wall-clock time.
 //
 // A second benefit of treating aged regions differently than other regions during collection set selection is
-// that this allows us to more accurately budget memory to hold the results of evacuation.  Memory for evacuation
-// of aged regions must be reserved in the old generation.  Memory for evacuation of all other regions must be
+// that this allows us to more accurately budget memory to hold the results of evacuation. Memory for evacuation
+// of aged regions must be reserved in the old generation. Memory for evacuation of all other regions must be
 // reserved in the young generation.
 size_t ShenandoahGenerationalHeuristics::select_aged_regions(ShenandoahInPlacePromotionPlanner& in_place_promotions,
                                                              const size_t old_promotion_reserve) {
@@ -345,7 +376,6 @@ size_t ShenandoahGenerationalHeuristics::select_aged_regions(ShenandoahInPlacePr
 
   auto const heap = ShenandoahGenerationalHeap::heap();
 
-  size_t promo_potential = 0;
   size_t candidates = 0;
 
   // Sort the promotion-eligible regions in order of increasing live-data-bytes so that we can first reclaim regions that require
@@ -386,66 +416,28 @@ size_t ShenandoahGenerationalHeuristics::select_aged_regions(ShenandoahInPlacePr
         sorted_regions[candidates]._live_data = r->get_live_data_bytes();
         candidates++;
       }
-    } else {
-      // We only evacuate & promote objects from regular regions whose garbage() is above old-garbage-threshold.
-      // Objects in tenure-worthy regions with less garbage are promoted in place. These take a different path to
-      // old-gen.  Regions excluded from promotion because their garbage content is too low (causing us to anticipate that
-      // the region would be promoted in place) may be eligible for evacuation promotion by the time promotion takes
-      // place during a subsequent GC pass because more garbage is found within the region between now and then.  This
-      // should not happen if we are properly adapting the tenure age.  The theory behind adaptive tenuring threshold
-      // is to choose the youngest age that demonstrates no "significant" further loss of population since the previous
-      // age.  If not this, we expect the tenure age to demonstrate linear population decay for at least two population
-      // samples, whereas we expect to observe exponential population decay for ages younger than the tenure age.
-      //
-      // In the case that certain regions which were anticipated to be promoted in place need to be promoted by
-      // evacuation, it may be the case that there is not sufficient reserve within old-gen to hold evacuation of
-      // these regions.  The likely outcome is that these regions will not be selected for evacuation or promotion
-      // in the current cycle and we will anticipate that they will be promoted in the next cycle.  This will cause
-      // us to reserve more old-gen memory so that these objects can be promoted in the subsequent cycle.
-      if (heap->is_aging_cycle() && heap->age_census()->is_tenurable(r->age() + 1)) {
-        if (r->garbage() >= in_place_promotions.old_garbage_threshold()) {
-          promo_potential += r->get_live_data_bytes();
-        }
-      }
     }
-    // Note that we keep going even if one region is excluded from selection.
-    // Subsequent regions may be selected if they have smaller live data.
   }
 
   in_place_promotions.complete_planning();
 
-  // Sort in increasing order according to live data bytes.  Note that candidates represents the number of regions
-  // that qualify to be promoted by evacuation.
-  size_t old_consumed = 0;
-  if (candidates > 0) {
-    size_t selected_regions = 0;
-    size_t selected_live = 0;
-    QuickSort::sort<AgedRegionData>(sorted_regions, candidates, compare_by_aged_live);
-    for (size_t i = 0; i < candidates; i++) {
-      ShenandoahHeapRegion* const region = sorted_regions[i]._region;
-      const size_t region_live_data = sorted_regions[i]._live_data;
-      const size_t promotion_need = (size_t) (region_live_data * ShenandoahPromoEvacWaste);
-      if (old_consumed + promotion_need <= old_promotion_reserve) {
-        old_consumed += promotion_need;
-        heap->collection_set()->add_region(region);
-        selected_regions++;
-        selected_live += region_live_data;
-      } else {
-        // We rejected this promotable region from the collection set because we had no room to hold its copy.
-        // Add this region to promo potential for next GC.
-        promo_potential += region_live_data;
-        assert(!heap->collection_set()->is_in(region), "Region %zu shouldn't be in the collection set", region->index());
-      }
-      // We keep going even if one region is excluded from selection because we need to accumulate all eligible
-      // regions that are not preselected into promo_potential
-    }
-    log_debug(gc, ergo)("Preselected %zu regions containing " PROPERFMT " live data,"
-                        " consuming: " PROPERFMT " of budgeted: " PROPERFMT,
-                        selected_regions, PROPERFMTARGS(selected_live), PROPERFMTARGS(old_consumed), PROPERFMTARGS(old_promotion_reserve));
-  }
+  add_tenured_regions_to_collection_set(old_promotion_reserve, heap, candidates, sorted_regions);
 
-  log_info(gc, ergo)("Promotion potential of aged regions with sufficient garbage: " PROPERFMT, PROPERFMTARGS(promo_potential));
+  const uint tenuring_threshold = heap->age_census()->tenuring_threshold();
+  const size_t tenurable_this_cycle = heap->age_census()->get_tenurable_bytes(tenuring_threshold);
+  const size_t tenurable_next_cycle = heap->age_census()->get_tenurable_bytes(tenuring_threshold - 1);
+  assert(tenurable_next_cycle >= tenurable_this_cycle,
+          "Tenurable next cycle (" PROPERFMT ") should include tenurable this cycle (" PROPERFMT ")",
+          PROPERFMTARGS(tenurable_next_cycle), PROPERFMTARGS(tenurable_this_cycle));
+
+  const size_t max_promotions = tenurable_this_cycle * ShenandoahPromoEvacWaste;
+  const size_t old_consumed = MIN2(max_promotions, old_promotion_reserve);
+
+  // Don't include the bytes we expect to promote in this cycle in the next cycle
+  const size_t promo_potential = (tenurable_next_cycle - tenurable_this_cycle) * ShenandoahPromoEvacWaste;
   heap->old_generation()->set_promotion_potential(promo_potential);
+  log_info(gc, ergo)("Promotion potential of aged regions with sufficient garbage: " PROPERFMT, PROPERFMTARGS(promo_potential));
+
   return old_consumed;
 }
 
diff --git a/src/hotspot/share/gc/shenandoah/heuristics/shenandoahGenerationalHeuristics.hpp b/src/hotspot/share/gc/shenandoah/heuristics/shenandoahGenerationalHeuristics.hpp
index d6551cffb73..1a47cb756f4 100644
--- a/src/hotspot/share/gc/shenandoah/heuristics/shenandoahGenerationalHeuristics.hpp
+++ b/src/hotspot/share/gc/shenandoah/heuristics/shenandoahGenerationalHeuristics.hpp
@@ -34,6 +34,11 @@ class ShenandoahHeap;
 class ShenandoahCollectionSet;
 class RegionData;
 
+typedef struct {
+  ShenandoahHeapRegion* _region;
+  size_t _live_data;
+} AgedRegionData;
+
 /*
  * This class serves as the base class for heuristics used to trigger and
  * choose the collection sets for young and global collections. It leans
@@ -50,7 +55,7 @@ public:
 
   void choose_collection_set(ShenandoahCollectionSet* collection_set) override;
 
-  virtual void post_initialize() override;
+  void post_initialize() override;
 
 private:
   // Compute evacuation budgets prior to choosing collection set.
@@ -73,6 +78,12 @@ private:
   // to false.
   size_t select_aged_regions(ShenandoahInPlacePromotionPlanner& in_place_promotions, const size_t old_promotion_reserve);
 
+  // Select regions for inclusion in the collection set that are tenured, but do
+  // not hold enough live data to warrant promotion in place.
+  void add_tenured_regions_to_collection_set(size_t old_promotion_reserve,
+                                             ShenandoahGenerationalHeap *const heap,
+                                             size_t candidates, AgedRegionData* sorted_regions);
+
   // Filter and sort remaining regions before adding to collection set.
   void filter_regions(ShenandoahCollectionSet* collection_set);
 
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahAgeCensus.cpp b/src/hotspot/share/gc/shenandoah/shenandoahAgeCensus.cpp
index 71fd6e37614..a81efa99d70 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahAgeCensus.cpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahAgeCensus.cpp
@@ -171,6 +171,15 @@ void ShenandoahAgeCensus::update_census(size_t age0_pop) {
   NOT_PRODUCT(update_total();)
 }
 
+size_t ShenandoahAgeCensus::get_tenurable_bytes(const uint tenuring_threshold) const {
+  assert(_epoch < MAX_SNAPSHOTS, "Out of bounds");
+  size_t total = 0;
+  const AgeTable* pv = _global_age_tables[_epoch];
+  for (uint i = tenuring_threshold; i < MAX_COHORTS; i++) {
+    total += pv->sizes[i];
+  }
+  return total * HeapWordSize;
+}
 
 // Reset the epoch for the global age tables,
 // clearing all history.
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahAgeCensus.hpp b/src/hotspot/share/gc/shenandoah/shenandoahAgeCensus.hpp
index 9c5baaedcd6..c140f445e21 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahAgeCensus.hpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahAgeCensus.hpp
@@ -216,6 +216,12 @@ class ShenandoahAgeCensus: public CHeapObj<mtGC> {
   // allocated when the concurrent marking was in progress.
   void update_census(size_t age0_pop);
 
+  // Return the total size of the population at or above the given threshold for the current epoch
+  size_t get_tenurable_bytes(uint tenuring_threshold) const;
+
+  // As above, but use the current tenuring threshold
+  size_t get_tenurable_bytes() const { return get_tenurable_bytes(tenuring_threshold()); }
+
   // Reset the epoch, clearing accumulated census history
   // Note: this isn't currently used, but reserved for planned
   // future usage.
diff --git a/test/hotspot/gtest/gc/shenandoah/test_shenandoahAgeCensus.cpp b/test/hotspot/gtest/gc/shenandoah/test_shenandoahAgeCensus.cpp
index c53d0a15554..0b89c59634a 100644
--- a/test/hotspot/gtest/gc/shenandoah/test_shenandoahAgeCensus.cpp
+++ b/test/hotspot/gtest/gc/shenandoah/test_shenandoahAgeCensus.cpp
@@ -63,7 +63,7 @@ protected:
         total += _cohort_populations[i];
       }
     }
-    return total;
+    return total * HeapWordSize;
   }
 
   void promote_all_tenurable(const size_t tenuring_threshold) {
@@ -87,6 +87,13 @@ TEST_F(ShenandoahAgeCensusTest, initialize) {
   EXPECT_EQ(census.tenuring_threshold(), ShenandoahAgeCensus::MAX_COHORTS);
 }
 
+TEST_F(ShenandoahAgeCensusTest, get_tenurable_bytes) {
+  ShenandoahAgeCensus census(1);
+  update(census);
+  EXPECT_EQ(get_total_population_older_than(1), census.get_tenurable_bytes(1));
+  EXPECT_LT(census.get_tenurable_bytes(2), census.get_tenurable_bytes(1));
+}
+
 TEST_F(ShenandoahAgeCensusTest, ignore_small_populations) {
   // Small populations are ignored so we do not return early before reaching the youngest cohort.
   ShenandoahAgeCensus census(1);

From aa6db8d06e59bb91630be6d7f75da195d39d3190 Mon Sep 17 00:00:00 2001
From: Alexey Semenyuk <asemenyuk@openjdk.org>
Date: Fri, 10 Apr 2026 23:44:17 +0000
Subject: [PATCH 559/655] 8382022: jpackage: enhance CompositeProxy

Reviewed-by: almatvee
---
 .../internal/util/CompositeProxy.java         |  737 +++++++-----
 .../internal/util/CompositeProxyTest.java     | 1062 +++++++++++++++--
 .../tools/jdk/jpackage/test/JUnitUtils.java   |   14 +
 3 files changed, 1464 insertions(+), 349 deletions(-)

diff --git a/src/jdk.jpackage/share/classes/jdk/jpackage/internal/util/CompositeProxy.java b/src/jdk.jpackage/share/classes/jdk/jpackage/internal/util/CompositeProxy.java
index 39a9d319468..e4257c87306 100644
--- a/src/jdk.jpackage/share/classes/jdk/jpackage/internal/util/CompositeProxy.java
+++ b/src/jdk.jpackage/share/classes/jdk/jpackage/internal/util/CompositeProxy.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2025, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -31,17 +31,17 @@ import java.lang.reflect.InvocationHandler;
 import java.lang.reflect.Method;
 import java.lang.reflect.Modifier;
 import java.lang.reflect.Proxy;
+import java.util.ArrayList;
 import java.util.Arrays;
+import java.util.BitSet;
 import java.util.Collection;
 import java.util.Collections;
-import java.util.HashMap;
-import java.util.HashSet;
 import java.util.List;
 import java.util.Map;
 import java.util.Objects;
-import java.util.Set;
-import java.util.function.BinaryOperator;
+import java.util.Optional;
 import java.util.function.Predicate;
+import java.util.stream.Collectors;
 import java.util.stream.Stream;
 
 /**
@@ -95,11 +95,9 @@ import java.util.stream.Stream;
  *     }
  * };
  *
- * Sloop sloop = CompositeProxy.create(Sloop.class, new Sailboat() {
- * }, withMain, withJib);
+ * Sloop sloop = CompositeProxy.create(Sloop.class, withMain, withJib);
  *
- * Catboat catboat = CompositeProxy.create(Catboat.class, new Sailboat() {
- * }, withMain);
+ * Catboat catboat = CompositeProxy.create(Catboat.class, withMain);
  *
  * sloop.trimSails();
  * catboat.trimSails();
@@ -137,20 +135,60 @@ public final class CompositeProxy {
          *         dispatching the interface method invocations to the given handlers
          */
         public <T> T create(Class<T> interfaceType, Object... slices) {
-            return CompositeProxy.createCompositeProxy(interfaceType, conflictResolver, invokeTunnel, slices);
+            return CompositeProxy.createCompositeProxy(
+                    interfaceType,
+                    Optional.ofNullable(methodConflictResolver).orElse(JPACKAGE_METHOD_CONFLICT_RESOLVER),
+                    Optional.ofNullable(objectConflictResolver).orElse(JPACKAGE_OBJECT_CONFLICT_RESOLVER),
+                    invokeTunnel,
+                    allowUnreferencedSlices,
+                    slices);
         }
 
         /**
          * Sets the method dispatch conflict resolver for this builder. The conflict
          * resolver is used by composite proxy to select a method call handler from
-         * multiple candidates.
+         * several candidates.
          *
-         * @param v the conflict resolver for this builder or <code>null</code> if the
-         *          default conflict resolver should be used
+         * @param v the method conflict resolver for this builder or <code>null</code>
+         *          if the default conflict resolver should be used
          * @return this
          */
-        public Builder conflictResolver(BinaryOperator<Method> v) {
-            conflictResolver = v;
+        public Builder methodConflictResolver(MethodConflictResolver v) {
+            methodConflictResolver = v;
+            return this;
+        }
+
+        /**
+         * Sets the object dispatch conflict resolver for this builder. The conflict
+         * resolver is used by the composite proxy to select an object from several
+         * candidates.
+         *
+         * @param v the object conflict resolver for this builder or <code>null</code>
+         *          if the default conflict resolver should be used
+         * @return this
+         */
+        public Builder objectConflictResolver(ObjectConflictResolver v) {
+            objectConflictResolver = v;
+            return this;
+        }
+
+        /**
+         * Configures if this builder allows unreferenced slices in the
+         * {@link #create(Class, Object...)}.
+         * <p>
+         * By default, if the builder happens to create such a composite proxy that one
+         * or more slices passed in the {@link #create(Class, Object...)} method happen
+         * to be unreferenced, it will throw {@code IllegalArgumentException}. Passing
+         * <code>true</code> disables this throw cause.
+         *
+         * @param v <code>true</code> to disable throwing of
+         *          {@code IllegalArgumentException} from
+         *          {@link #create(Class, Object...)} if some of the passed in slices
+         *          happen to be unreferenced and <code>false</code> otherwise
+         * @return this
+         */
+        public Builder allowUnreferencedSlices(boolean v) {
+            allowUnreferencedSlices = v;
             return this;
         }
 
@@ -168,8 +206,65 @@ public final class CompositeProxy {
 
         private Builder() {}
 
-        private BinaryOperator<Method> conflictResolver = STANDARD_CONFLICT_RESOLVER;
+        private MethodConflictResolver methodConflictResolver;
+        private ObjectConflictResolver objectConflictResolver;
         private InvokeTunnel invokeTunnel;
+        private boolean allowUnreferencedSlices;
+    }
+
+    /**
+     * Method conflict resolver. Used when the composite proxy needs to decide if
+     * the default method of the interface it implements should be overridden by an
+     * implementing object.
+     */
+    @FunctionalInterface
+    public interface MethodConflictResolver {
+
+        /**
+         * Returns {@code true} if the composite proxy should override the default
+         * method {@code method} in {@code interfaceType} type with the corresponding
+         * method form the {@code obj}.
+         *
+         * @param interfaceType the interface type composite proxy instance should
+         *                      implement
+         * @param slices        all objects passed to the calling composite proxy. The
+         *                      value is a copy of the last parameter passed in the
+         *                      {@link Builder#create(Class, Object...)}
+         * @param method        default method in {@code interfaceType} type
+         * @param obj           object providing a usable method with the same signature
+         *                      (the name and parameter types) as the signature of the
+         *                      {@code method} method
+         */
+        boolean isOverrideDefault(Class<?> interfaceType, Object[] slices, Method method, Object obj);
+    }
+
+    /**
+     * Object conflict resolver. Used when several objects have methods that are
+     * candidates to implement some method in an interface and the composite proxy
+     * needs to choose one of these objects.
+     */
+    @FunctionalInterface
+    public interface ObjectConflictResolver {
+
+        /**
+         * Returns the object that should be used in a composite proxy to implement
+         * abstract method {@code method}.
+         *
+         * @param interfaceType the interface type composite proxy instance should
+         *                      implement
+         * @param slices        all objects passed to the calling composite proxy. The
+         *                      value is a copy of the last parameter passed in the
+         *                      {@link Builder#create(Class, Object...)}
+         * @param method        abstract method
+         * @param candidates    objects with a method with the same signature (the name
+         *                      and parameter types) as the signature of the
+         *                      {@code method} method. The array is unordered, doesn't
+         *                      contain duplicates, and is a subset of the
+         *                      {@code slices} array
+         * @return either one of items from the {@code candidates} or {@code null} if
+         *         can't choose one
+         */
+        Object choose(Class<?> interfaceType, Object[] slices, Method method, Object[] candidates);
     }
 
     /**
@@ -263,233 +358,231 @@ public final class CompositeProxy {
     private CompositeProxy() {
     }
 
-    private static <T> T createCompositeProxy(Class<T> interfaceType, BinaryOperator<Method> conflictResolver,
-            InvokeTunnel invokeTunnel, Object... slices) {
+    private static <T> T createCompositeProxy(
+            Class<T> interfaceType,
+            MethodConflictResolver methodConflictResolver,
+            ObjectConflictResolver objectConflictResolver,
+            InvokeTunnel invokeTunnel,
+            boolean allowUnreferencedSlices,
+            Object... slices) {
 
-        validateTypeIsInterface(interfaceType);
+        Objects.requireNonNull(interfaceType);
+        Objects.requireNonNull(methodConflictResolver);
+        Objects.requireNonNull(objectConflictResolver);
+        Stream.of(slices).forEach(Objects::requireNonNull);
 
-        final var interfaces = interfaceType.getInterfaces();
-        List.of(interfaces).forEach(CompositeProxy::validateTypeIsInterface);
-
-        if (interfaces.length != slices.length) {
-            throw new IllegalArgumentException(
-                    String.format("type %s must extend %d interfaces", interfaceType.getName(), slices.length));
+        if (!interfaceType.isInterface()) {
+            throw new IllegalArgumentException(String.format("Type %s must be an interface", interfaceType.getName()));
         }
 
-        final Map<Class<?>, Object> interfaceDispatch = createInterfaceDispatch(interfaces, slices);
+        final var uniqueSlices = Stream.of(slices).map(IdentityWrapper::new).collect(toSet());
+
+        final var unreferencedSlicesBuilder = SetBuilder.<IdentityWrapper<Object>>build().emptyAllowed(true);
+
+        if (!allowUnreferencedSlices) {
+            unreferencedSlicesBuilder.add(uniqueSlices);
+        }
 
         final Map<Method, Handler> methodDispatch = getProxyableMethods(interfaceType).map(method -> {
-            var handler = createHandler(interfaceType, method, interfaceDispatch, conflictResolver, invokeTunnel);
-            if (handler != null) {
-                return Map.entry(method, handler);
-            } else {
-                return null;
+            return Map.entry(method, uniqueSlices.stream().flatMap(slice -> {
+                var sliceMethods = getImplementerMethods(slice.value()).filter(sliceMethod -> {
+                    return signatureEquals(sliceMethod, method);
+                }).toList();
+
+                if (sliceMethods.size() > 1) {
+                    throw new AssertionError();
+                }
+
+                return sliceMethods.stream().findFirst().map(sliceMethod -> {
+                    return Map.entry(slice, sliceMethod);
+                }).stream();
+            }).toList());
+        }).flatMap(e -> {
+            final Method method = e.getKey();
+            final List<Map.Entry<IdentityWrapper<Object>, Method>> slicesWithMethods = e.getValue();
+
+            final Map.Entry<IdentityWrapper<Object>, Method> sliceWithMethods;
+            switch (slicesWithMethods.size()) {
+                case 0 -> {
+                    if (!method.isDefault()) {
+                        throw new IllegalArgumentException(String.format("None of the slices can handle %s", method));
+                    } else {
+                        return Optional.ofNullable(createHandlerForDefaultMethod(method, invokeTunnel)).map(handler -> {
+                            return Map.entry(method, handler);
+                        }).stream();
+                    }
+                }
+                case 1 -> {
+                    sliceWithMethods = slicesWithMethods.getFirst();
+                }
+                default -> {
+                    var candidates = slicesWithMethods.stream().map(sliceEntry -> {
+                        return sliceEntry.getKey().value();
+                    }).toList();
+
+                    var candidate = objectConflictResolver.choose(
+                            interfaceType, Arrays.copyOf(slices, slices.length), method, candidates.toArray());
+                    if (candidate == null) {
+                        throw new IllegalArgumentException(String.format(
+                                "Ambiguous choice between %s for %s", candidates, method));
+                    }
+
+                    var candidateIdentity = IdentityWrapper.wrapIdentity(candidate);
+
+                    if (candidates.stream().map(IdentityWrapper::new).noneMatch(Predicate.isEqual(candidateIdentity))) {
+                        throw new UnsupportedOperationException();
+                    }
+
+                    sliceWithMethods = slicesWithMethods.stream().filter(v -> {
+                        return candidateIdentity.equals(v.getKey());
+                    }).findFirst().orElseThrow();
+                }
             }
-        }).filter(Objects::nonNull).collect(toMap(Map.Entry::getKey, Map.Entry::getValue));
+
+            final var slice = sliceWithMethods.getKey().value();
+            final var sliceMethod = sliceWithMethods.getValue();
+            final Handler handler;
+            if (!method.isDefault()
+                    || (method.equals(sliceMethod)
+                            && getUnfilteredImplementerMethods(slice)
+                                    .map(FullMethodSignature::new)
+                                    .anyMatch(Predicate.isEqual(new FullMethodSignature(sliceMethod))))
+                    || (       method.getReturnType().equals(sliceMethod.getReturnType())
+                            && !sliceMethod.isDefault()
+                            && methodConflictResolver.isOverrideDefault(interfaceType, Arrays.copyOf(slices, slices.length), method, slice))) {
+                // Use implementation from the slice if one of the statements is "true":
+                // - The target method is abstract (not default)
+                // - The target method is default and it is the same method in the slice which overrides it.
+                //   This is a special case when default method must not be invoked via InvocationHandler.invokeDefault().
+                // - The target method is default and the matching slice method has the same return type,
+                //   is not default, and the method conflict resolver approves the use of the slice method
+                if (!allowUnreferencedSlices) {
+                    unreferencedSlicesBuilder.remove(sliceWithMethods.getKey());
+                }
+                handler = createHandlerForMethod(slice, sliceMethod, invokeTunnel);
+            } else {
+                handler = createHandlerForDefaultMethod(method, invokeTunnel);
+            }
+
+            return Optional.ofNullable(handler).map(h -> {
+                return Map.entry(method, h);
+            }).stream();
+
+        }).collect(toMap(Map.Entry::getKey, Map.Entry::getValue));
+
+        if (!allowUnreferencedSlices) {
+            var unreferencedSlices = unreferencedSlicesBuilder.create().stream().map(IdentityWrapper::value).toList();
+            if (!unreferencedSlices.isEmpty()) {
+                throw new IllegalArgumentException(String.format("Unreferenced slices: %s", unreferencedSlices));
+            }
+        }
 
         @SuppressWarnings("unchecked")
         T proxy = (T) Proxy.newProxyInstance(interfaceType.getClassLoader(), new Class<?>[] { interfaceType },
-                new CompositeProxyInvocationHandler(methodDispatch));
+                new CompositeProxyInvocationHandler(Collections.unmodifiableMap(methodDispatch)));
 
         return proxy;
     }
 
-    private record InterfaceDispatchBuilder(Set<? extends Class<?>> interfaces, Collection<Object> slices) {
-
-        InterfaceDispatchBuilder {
-            Objects.requireNonNull(interfaces);
-            Objects.requireNonNull(slices);
-
-            if (interfaces.isEmpty()) {
-                throw new IllegalArgumentException("No interfaces to dispatch");
-            }
-
-            if (slices.isEmpty()) {
-                throw createInterfaceNotImplementedException(interfaces);
-            }
-        }
-
-        InterfaceDispatchBuilder(Result result) {
-            this(result.unservedInterfaces(), result.unusedSlices());
-        }
-
-        Map<? extends Class<?>, List<Object>> createDispatchGroups() {
-            return interfaces.stream().collect(toMap(x -> x, iface -> {
-                return slices.stream().filter(obj -> {
-                    return Stream.of(obj.getClass().getInterfaces()).flatMap(sliceIface -> {
-                        return unfoldInterface(sliceIface);
-                    }).anyMatch(Predicate.isEqual(iface));
-                }).toList();
-            }));
-        }
-
-        Result createDispatch() {
-            var groups = createDispatchGroups();
-
-            var dispatch = groups.entrySet().stream().filter(e -> {
-                return e.getValue().size() == 1;
-            }).collect(toMap(Map.Entry::getKey, e -> {
-                return e.getValue().getFirst();
-            }));
-
-            var unservedInterfaces = groups.entrySet().stream().filter(e -> {
-                return e.getValue().size() != 1;
-            }).map(Map.Entry::getKey).collect(toSet());
-
-            var usedSliceIdentities = dispatch.values().stream()
-                    .map(IdentityWrapper::new)
-                    .collect(toSet());
-
-            var unusedSliceIdentities = new HashSet<>(toIdentitySet(slices));
-            unusedSliceIdentities.removeAll(usedSliceIdentities);
-
-            return new Result(dispatch, unservedInterfaces, unusedSliceIdentities.stream().map(IdentityWrapper::value).toList());
-        }
-
-        private record Result(Map<? extends Class<?>, Object> dispatch, Set<? extends Class<?>> unservedInterfaces, Collection<Object> unusedSlices) {
-
-            Result {
-                Objects.requireNonNull(dispatch);
-                Objects.requireNonNull(unservedInterfaces);
-                Objects.requireNonNull(unusedSlices);
-
-                if (!Collections.disjoint(dispatch.keySet(), unservedInterfaces)) {
-                    throw new IllegalArgumentException();
-                }
-
-                if (!Collections.disjoint(toIdentitySet(dispatch.values()), toIdentitySet(unusedSlices))) {
-                    throw new IllegalArgumentException();
-                }
-            }
-        }
-
-        private static Collection<IdentityWrapper<Object>> toIdentitySet(Collection<Object> v) {
-            return v.stream().map(IdentityWrapper::new).collect(toSet());
-        }
-    }
-
-    private static Map<Class<?>, Object> createInterfaceDispatch(Class<?>[] interfaces, Object[] slices) {
-
-        if (interfaces.length == 0) {
-            return Collections.emptyMap();
-        }
-
-        Map<Class<?>, Object> dispatch = new HashMap<>();
-
-        var builder = new InterfaceDispatchBuilder(Set.of(interfaces), List.of(slices));
-        for (;;) {
-            var result = builder.createDispatch();
-            if (result.dispatch().isEmpty()) {
-                var unserved = builder.createDispatchGroups();
-                for (var e : unserved.entrySet()) {
-                    var iface = e.getKey();
-                    var ifaceSlices = e.getValue();
-                    if (ifaceSlices.size() > 1) {
-                        throw new IllegalArgumentException(
-                                String.format("multiple slices %s implement %s", ifaceSlices, iface));
-                    }
-                }
-
-                var unservedInterfaces = unserved.entrySet().stream().filter(e -> {
-                    return e.getValue().isEmpty();
-                }).map(Map.Entry::getKey).toList();
-                throw createInterfaceNotImplementedException(unservedInterfaces);
-            } else {
-                dispatch.putAll(result.dispatch());
-                if (result.unservedInterfaces().isEmpty()) {
-                    break;
-                }
-            }
-
-            builder = new InterfaceDispatchBuilder(result);
-        }
-
-        return dispatch.keySet().stream().flatMap(iface -> {
-            return unfoldInterface(iface).map(unfoldedIface -> {
-                return Map.entry(unfoldedIface, dispatch.get(iface));
-            });
-        }).collect(toMap(Map.Entry::getKey, Map.Entry::getValue));
-    }
-
     private static Stream<Class<?>> unfoldInterface(Class<?> interfaceType) {
-        return Stream.concat(Stream.of(interfaceType),
-                Stream.of(interfaceType.getInterfaces()).flatMap(CompositeProxy::unfoldInterface));
+        return Stream.concat(
+                Stream.of(interfaceType),
+                Stream.of(interfaceType.getInterfaces()
+        ).flatMap(CompositeProxy::unfoldInterface));
     }
 
-    private static IllegalArgumentException createInterfaceNotImplementedException(
-            Collection<? extends Class<?>> missingInterfaces) {
-        return new IllegalArgumentException(String.format("none of the slices implement %s", missingInterfaces));
-    }
+    private static List<Class<?>> getSuperclasses(Class<?> type) {
+        List<Class<?>> superclasses = new ArrayList<>();
 
-    private static void validateTypeIsInterface(Class<?> type) {
-        if (!type.isInterface()) {
-            throw new IllegalArgumentException(String.format("type %s must be an interface", type.getName()));
+        var current = type.getSuperclass();
+
+        while (current != null) {
+            superclasses.add(current);
+            current = current.getSuperclass();
         }
+
+        return superclasses;
     }
 
-    private static Handler createHandler(Class<?> interfaceType, Method method, Map<Class<?>, Object> interfaceDispatch,
-            BinaryOperator<Method> conflictResolver, InvokeTunnel invokeTunnel) {
-
-        final var methodDeclaringClass = method.getDeclaringClass();
-
-        if (!methodDeclaringClass.equals(interfaceType)) {
-            // The method is declared in one of the superinterfaces.
-            final var slice = interfaceDispatch.get(methodDeclaringClass);
-
-            if (isInvokeDefault(method, slice)) {
-                return createHandlerForDefaultMethod(method, invokeTunnel);
-            } else {
-                return createHandlerForMethod(slice, method, invokeTunnel);
-            }
-        } else if (method.isDefault()) {
-            return createHandlerForDefaultMethod(method, invokeTunnel);
-        } else {
-            // Find a slice handling the method.
-            var handler = interfaceDispatch.entrySet().stream().map(e -> {
-                try {
-                    Class<?> iface = e.getKey();
-                    Object slice = e.getValue();
-                    return createHandlerForMethod(slice, iface.getMethod(method.getName(), method.getParameterTypes()),
-                            invokeTunnel);
-                } catch (NoSuchMethodException ex) {
-                    return null;
-                }
-            }).filter(Objects::nonNull).reduce(new ConflictResolverAdapter(conflictResolver)).orElseThrow(() -> {
-                return new IllegalArgumentException(String.format("none of the slices can handle %s", method));
-            });
-
-            return handler;
-        }
+    private static Stream<Method> getUnfilteredProxyableMethods(Class<?> interfaceType) {
+        return unfoldInterface(interfaceType).flatMap(type -> {
+            return Stream.of(type.getMethods());
+        }).filter(method -> {
+            return     !Modifier.isStatic(method.getModifiers())
+                    && !method.isBridge();
+        });
     }
 
     private static Stream<Method> getProxyableMethods(Class<?> interfaceType) {
-        return Stream.of(interfaceType.getMethods()).filter(method -> !Modifier.isStatic(method.getModifiers()));
+        return removeRedundancy(getUnfilteredProxyableMethods(interfaceType));
     }
 
-    private static boolean isInvokeDefault(Method method, Object slice) {
-        if (!method.isDefault()) {
-            return false;
-        }
+    private static Stream<Method> getUnfilteredImplementerMethods(Object slice) {
+        var sliceType = slice.getClass();
 
-        // The "method" is default.
-        // See if is overridden by any non-abstract method in the "slice".
-        // If it is, InvocationHandler.invokeDefault() should not be used to call it.
+        return Stream.of(
+                Stream.of(sliceType),
+                getSuperclasses(sliceType).stream()
+        ).flatMap(x -> x).flatMap(type -> {
+            return Stream.of(type.getMethods());
+        }).filter(method -> {
+            return     !Modifier.isStatic(method.getModifiers())
+                    && !method.isBridge()
+                    && !method.isDefault()
+                    && !Modifier.isPrivate(method.getModifiers());
+        });
+    }
 
-        final var sliceClass = slice.getClass();
+    private static Stream<Method> getImplementerMethods(Object slice) {
+        var sliceType = slice.getClass();
 
-        final var methodOverriden = Stream.of(sliceClass.getMethods()).filter(Predicate.not(Predicate.isEqual(method)))
-                .filter(sliceMethod -> !Modifier.isAbstract(sliceMethod.getModifiers()))
-                .anyMatch(sliceMethod -> signatureEquals(sliceMethod, method));
+        var proxyableMethods = Stream.of(
+                Stream.of(sliceType),
+                getSuperclasses(sliceType).stream()
+        ).flatMap(x -> x)
+                .map(Class::getInterfaces)
+                .flatMap(Stream::of)
+                .flatMap(CompositeProxy::unfoldInterface)
+                .flatMap(CompositeProxy::getUnfilteredProxyableMethods)
+                .toList();
 
-        return !methodOverriden;
+        var proxyableMethodSignatures = proxyableMethods.stream()
+                .map(FullMethodSignature::new)
+                .collect(toSet());
+
+        var methods = getUnfilteredImplementerMethods(slice).filter(method -> {
+            return !proxyableMethodSignatures.contains(new FullMethodSignature(method));
+        });
+
+        return removeRedundancy(Stream.concat(methods, proxyableMethods.stream()));
+    }
+
+    private static Stream<Method> removeRedundancy(Stream<Method> methods) {
+        var groups = methods.distinct().collect(Collectors.groupingBy(MethodSignature::new)).values();
+        return groups.stream().map(group -> {
+            // All but a single method should be filtered out from the group.
+            return group.stream().reduce((a, b) -> {
+                var ac = a.getDeclaringClass();
+                var bc = b.getDeclaringClass();
+                if (ac.equals(bc)) {
+                    // Both methods don't fit: they are declared in the same class and have the same signatures.
+                    // That is possible only with code generation bypassing compiler checks.
+                    throw new AssertionError();
+                } else if (ac.isAssignableFrom(bc)) {
+                    return b;
+                } else if (bc.isAssignableFrom(ac)) {
+                    return a;
+                } else if (a.isDefault()) {
+                    return b;
+                } else {
+                    return a;
+                }
+            }).orElseThrow();
+        });
     }
 
     private static boolean signatureEquals(Method a, Method b) {
-        if (!Objects.equals(a.getName(), b.getName()) || !Arrays.equals(a.getParameterTypes(), b.getParameterTypes())) {
-            return false;
-        }
-
-        return Objects.equals(a.getReturnType(), b.getReturnType());
+        return Objects.equals(new MethodSignature(a), new MethodSignature(b));
     }
 
     private record CompositeProxyInvocationHandler(Map<Method, Handler> dispatch) implements InvocationHandler {
@@ -515,22 +608,14 @@ public final class CompositeProxy {
             return obj.getClass().getName() + '@' + Integer.toHexString(System.identityHashCode(obj));
         }
 
-        private static boolean objectEquals(Object obj, Object other) {
+        private static boolean objectIsSame(Object obj, Object other) {
             return obj == other;
         }
 
-        private static Method getMethod(Class<?> type, String methodName, Class<?>...paramaterTypes) {
-            try {
-                return type.getDeclaredMethod(methodName, paramaterTypes);
-            } catch (NoSuchMethodException|SecurityException ex) {
-                throw new InternalError(ex);
-            }
-        }
+        private record ObjectMethodHandler(Method method) implements Handler {
 
-        static class ObjectMethodHandler extends HandlerOfMethod {
-
-            ObjectMethodHandler(Method method) {
-                super(method);
+            ObjectMethodHandler {
+                Objects.requireNonNull(method);
             }
 
             @Override
@@ -546,43 +631,47 @@ public final class CompositeProxy {
             }
         }
 
-        private static final Map<Method, Handler> OBJECT_METHOD_DISPATCH = Map.of(
-                getMethod(Object.class, "toString"),
-                new ObjectMethodHandler(getMethod(CompositeProxyInvocationHandler.class, "objectToString", Object.class)),
-                getMethod(Object.class, "equals", Object.class),
-                new ObjectMethodHandler(getMethod(CompositeProxyInvocationHandler.class, "objectEquals", Object.class, Object.class)),
-                getMethod(Object.class, "hashCode"),
-                new ObjectMethodHandler(getMethod(System.class, "identityHashCode", Object.class))
-        );
+        private static final Map<Method, Handler> OBJECT_METHOD_DISPATCH;
+
+        static {
+            try {
+                OBJECT_METHOD_DISPATCH = Map.of(
+                        Object.class.getMethod("toString"),
+                        new ObjectMethodHandler(CompositeProxyInvocationHandler.class.getDeclaredMethod("objectToString", Object.class)),
+
+                        Object.class.getMethod("equals", Object.class),
+                        new ObjectMethodHandler(CompositeProxyInvocationHandler.class.getDeclaredMethod("objectIsSame", Object.class, Object.class)),
+
+                        Object.class.getMethod("hashCode"),
+                        new ObjectMethodHandler(System.class.getMethod("identityHashCode", Object.class))
+                );
+            } catch (NoSuchMethodException | SecurityException ex) {
+                throw new InternalError(ex);
+            }
+        }
     }
 
-    private static HandlerOfMethod createHandlerForDefaultMethod(Method method, InvokeTunnel invokeTunnel) {
+    private static Handler createHandlerForDefaultMethod(Method method, InvokeTunnel invokeTunnel) {
+        Objects.requireNonNull(method);
         if (invokeTunnel != null) {
-            return new HandlerOfMethod(method) {
-                @Override
-                public Object invoke(Object proxy, Object[] args) throws Throwable {
-                    return invokeTunnel.invokeDefault(proxy, this.method, args);
-                }
+            return (proxy, args) -> {
+                return invokeTunnel.invokeDefault(proxy, method, args);
             };
         } else {
             return null;
         }
     }
 
-    private static HandlerOfMethod createHandlerForMethod(Object obj, Method method, InvokeTunnel invokeTunnel) {
+    private static Handler createHandlerForMethod(Object obj, Method method, InvokeTunnel invokeTunnel) {
+        Objects.requireNonNull(obj);
+        Objects.requireNonNull(method);
         if (invokeTunnel != null) {
-            return new HandlerOfMethod(method) {
-                @Override
-                public Object invoke(Object proxy, Object[] args) throws Throwable {
-                    return invokeTunnel.invoke(obj, this.method, args);
-                }
+            return (proxy, args) -> {
+                return invokeTunnel.invoke(obj, method, args);
             };
         } else {
-            return new HandlerOfMethod(method) {
-                @Override
-                public Object invoke(Object proxy, Object[] args) throws Throwable {
-                    return this.method.invoke(obj, args);
-                }
+            return (proxy, args) -> {
+                return method.invoke(obj, args);
             };
         }
     }
@@ -593,37 +682,141 @@ public final class CompositeProxy {
         Object invoke(Object proxy, Object[] args) throws Throwable;
     }
 
-    private abstract static class HandlerOfMethod implements Handler {
-        HandlerOfMethod(Method method) {
-            this.method = method;
+    private record MethodSignature(String name, List<Class<?>> parameterTypes) {
+        MethodSignature {
+            Objects.requireNonNull(name);
+            parameterTypes.forEach(Objects::requireNonNull);
         }
 
-        protected final Method method;
+        MethodSignature(Method m) {
+            this(m.getName(), List.of(m.getParameterTypes()));
+        }
     }
 
-    private record ConflictResolverAdapter(BinaryOperator<Method> conflictResolver)
-            implements BinaryOperator<HandlerOfMethod> {
+    private record FullMethodSignature(MethodSignature signature, Class<?> returnType) {
+        FullMethodSignature {
+            Objects.requireNonNull(signature);
+            Objects.requireNonNull(returnType);
+        }
 
-        @Override
-        public HandlerOfMethod apply(HandlerOfMethod a, HandlerOfMethod b) {
-            var m = conflictResolver.apply(a.method, b.method);
-            if (m == a.method) {
-                return a;
-            } else if (m == b.method) {
-                return b;
-            } else {
-                throw new UnsupportedOperationException();
+        FullMethodSignature(Method m) {
+            this(new MethodSignature(m), m.getReturnType());
+        }
+    }
+
+    /**
+     * Returns the standard jpackage configuration if the values of
+     * {@code interfaceType} and {@code slices} parameters comprise such or an empty
+     * {@code Optional} otherwise.
+     * <p>
+     * Standard jpackage configuration is:
+     * <ul>
+     * <li>The proxy implements an interface comprised of two direct
+     * superinterfaces.
+     * <li>The superinterfaces are distinct, i.e. they are not superinterfaces of
+     * each other.
+     * <li>Each supplied slice implements one of the superinterfaces.
+     * </ul>
+     *
+     * @param interfaceType the interface type composite proxy instance should
+     *                      implement
+     * @param slices        all objects passed to the calling composite proxy. The
+     *                      value is a copy of the last parameter passed in the
+     *                      {@link Builder#create(Class, Object...)}
+     */
+    static Optional<Map<IdentityWrapper<Object>, Class<?>>> detectJPackageConfiguration(Class<?> interfaceType, Object... slices) {
+        var interfaces = interfaceType.getInterfaces();
+
+        if (interfaces.length != 2) {
+            return Optional.empty();
+        }
+
+        if (interfaces[0].isAssignableFrom(interfaces[1]) || interfaces[1].isAssignableFrom(interfaces[0])) {
+            return Optional.empty();
+        }
+
+        var uniqueSlices = Stream.of(slices).map(IdentityWrapper::new).distinct().toList();
+        if (uniqueSlices.size() != interfaces.length) {
+            return Optional.empty();
+        }
+
+        Map<Class<?>, List<IdentityWrapper<Object>>> dispatch = Stream.of(interfaces).collect(toMap(x -> x, iface -> {
+            return uniqueSlices.stream().filter(slice -> {
+                return iface.isInstance(slice.value());
+            }).toList();
+        }));
+
+        return dispatch.values().stream().filter(v -> {
+            return v.size() == 1;
+        }).findFirst().map(anambiguous -> {
+            return dispatch.entrySet().stream().collect(toMap(e -> {
+                var ifaceSlices = e.getValue();
+                if (ifaceSlices.size() == 1) {
+                    return ifaceSlices.getFirst();
+                } else {
+                    if (anambiguous.size() != 1) {
+                        throw new AssertionError();
+                    }
+                    return ifaceSlices.stream().filter(Predicate.isEqual(anambiguous.getFirst()).negate()).findFirst().orElseThrow();
+                }
+            }, Map.Entry::getKey));
+        });
+    }
+
+    // jpackage-specific object conflict resolver
+    private static final ObjectConflictResolver JPACKAGE_OBJECT_CONFLICT_RESOLVER = (interfaceType, slices, method, candidates) -> {
+        return detectJPackageConfiguration(interfaceType, slices).map(dispatch -> {
+            // In this configuration, if one slice contains matching default method and
+            // another contains matching implemented method,
+            // the latter slice is selected as a supplier of this method for the composite proxy.
+
+            var nonDefaultImplementations = new BitSet(candidates.length);
+            var defaultImplementations = new BitSet(candidates.length);
+            for (int i = 0; i != candidates.length; i++) {
+                var slice = candidates[i];
+
+                var limitSignatures = new Predicate<Method>() {
+
+                    @Override
+                    public boolean test(Method m) {
+                        return limitSignatures.contains(new MethodSignature(m));
+                    }
+
+                    private final Collection<MethodSignature> limitSignatures =
+                            getProxyableMethods(dispatch.get(IdentityWrapper.wrapIdentity(slice)))
+                                    .map(MethodSignature::new)
+                                    .toList();
+                };
+
+                int cur = i;
+
+                getImplementerMethods(slice).filter(limitSignatures).filter(sliceMethod -> {
+                    return signatureEquals(sliceMethod, method);
+                }).findFirst().ifPresent(sliceMethod -> {
+                    if (!sliceMethod.isDefault() ||
+                            getUnfilteredImplementerMethods(slice)
+                                    .filter(limitSignatures)
+                                    .map(FullMethodSignature::new)
+                                    .anyMatch(Predicate.isEqual(new FullMethodSignature(sliceMethod)))) {
+                        nonDefaultImplementations.set(cur);
+                    } else {
+                        defaultImplementations.set(cur);
+                    }
+                });
             }
-        }
-    }
 
-    private static final BinaryOperator<Method> STANDARD_CONFLICT_RESOLVER = (a, b) -> {
-        if (a.isDefault() == b.isDefault()) {
-            throw new IllegalArgumentException(String.format("ambiguous choice between %s and %s", a, b));
-        } else if (!a.isDefault()) {
-            return a;
-        } else {
-            return b;
-        }
+            if (nonDefaultImplementations.cardinality() == 1) {
+                return candidates[nonDefaultImplementations.nextSetBit(0)];
+            } else if (nonDefaultImplementations.cardinality() == 0 && defaultImplementations.cardinality() == 1) {
+                return candidates[defaultImplementations.nextSetBit(0)];
+            } else {
+                throw new AssertionError();
+            }
+        }).orElse(null);
+    };
+
+    // jpackage-specific method conflict resolver
+    private static final MethodConflictResolver JPACKAGE_METHOD_CONFLICT_RESOLVER = (interfaceType, slices, method, obj) -> {
+        return false;
     };
 }
diff --git a/test/jdk/tools/jpackage/junit/share/jdk.jpackage/jdk/jpackage/internal/util/CompositeProxyTest.java b/test/jdk/tools/jpackage/junit/share/jdk.jpackage/jdk/jpackage/internal/util/CompositeProxyTest.java
index 1ece83be0a6..b8b1325529d 100644
--- a/test/jdk/tools/jpackage/junit/share/jdk.jpackage/jdk/jpackage/internal/util/CompositeProxyTest.java
+++ b/test/jdk/tools/jpackage/junit/share/jdk.jpackage/jdk/jpackage/internal/util/CompositeProxyTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2025, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -22,17 +22,35 @@
  */
 package jdk.jpackage.internal.util;
 
+import static jdk.jpackage.internal.util.PathUtils.mapNullablePath;
 import static org.junit.jupiter.api.Assertions.assertEquals;
 import static org.junit.jupiter.api.Assertions.assertFalse;
-import static org.junit.jupiter.api.Assertions.assertTrue;
 import static org.junit.jupiter.api.Assertions.assertNotEquals;
+import static org.junit.jupiter.api.Assertions.assertSame;
+import static org.junit.jupiter.api.Assertions.assertThrows;
+import static org.junit.jupiter.api.Assertions.assertThrowsExactly;
+import static org.junit.jupiter.api.Assertions.assertTrue;
 
+import java.lang.reflect.InvocationHandler;
+import java.lang.reflect.Method;
+import java.nio.file.Path;
+import java.util.List;
+import java.util.Map;
+import java.util.Objects;
+import java.util.Set;
+import java.util.function.Function;
+import java.util.function.UnaryOperator;
+import java.util.stream.Stream;
+import jdk.jpackage.internal.util.CompositeProxy.InvokeTunnel;
+import jdk.jpackage.test.JUnitUtils.StringArrayConverter;
 import org.junit.jupiter.api.Test;
 import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.converter.ConvertWith;
+import org.junit.jupiter.params.provider.CsvSource;
 import org.junit.jupiter.params.provider.ValueSource;
 
 
-public class CompositeProxyTest {
+class CompositeProxyTest {
 
     static interface Smalltalk {
 
@@ -86,24 +104,24 @@ public class CompositeProxyTest {
     }
 
     @Test
-    public void testSmalltalk() {
+    void testSmalltalk() {
         var convo = CompositeProxy.create(Smalltalk.class);
         assertEquals("Hello", convo.sayHello());
         assertEquals("Bye", convo.sayBye());
     }
 
     @Test
-    public void testConvo() {
+    void testConvo() {
         final var otherThings = "How is your day?";
         var convo = CompositeProxy.create(Convo.class,
-                new Smalltalk() {}, new ConvoMixin.Stub(otherThings));
+                new ConvoMixin.Stub(otherThings));
         assertEquals("Hello", convo.sayHello());
         assertEquals("Bye", convo.sayBye());
         assertEquals(otherThings, convo.sayThings());
     }
 
     @Test
-    public void testConvoWithDuke() {
+    void testConvoWithDuke() {
         final var otherThings = "How is your day?";
         var convo = CompositeProxy.create(Convo.class, new Smalltalk() {
             @Override
@@ -116,34 +134,47 @@ public class CompositeProxyTest {
         assertEquals(otherThings, convo.sayThings());
     }
 
-    @Test
-    public void testConvoWithCustomSayBye() {
+    @ParameterizedTest
+    @ValueSource(booleans = {true, false})
+    void testConvoWithCustomSayBye(boolean allowUnreferencedSlices) {
         var mixin = new ConvoMixinWithOverrideSayBye.Stub("How is your day?", "See you");
 
-        var convo = CompositeProxy.create(ConvoWithOverrideSayBye.class, new Smalltalk() {}, mixin);
+        var smalltalk = new Smalltalk() {};
 
-        var expectedConvo = new ConvoWithOverrideSayBye() {
-            @Override
-            public String sayBye() {
-                return mixin.sayBye;
-            }
+        var proxyBuilder = CompositeProxy.build().allowUnreferencedSlices(allowUnreferencedSlices);
 
-            @Override
-            public String sayThings() {
-                return mixin.sayThings;
-            }
-        };
+        if (!allowUnreferencedSlices) {
+            var ex = assertThrowsExactly(IllegalArgumentException.class, () -> {
+                proxyBuilder.create(ConvoWithOverrideSayBye.class, smalltalk, mixin);
+            });
 
-        assertEquals(expectedConvo.sayHello(), convo.sayHello());
-        assertEquals(expectedConvo.sayBye(), convo.sayBye());
-        assertEquals(expectedConvo.sayThings(), convo.sayThings());
+            assertEquals(String.format("Unreferenced slices: %s", List.of(smalltalk)), ex.getMessage());
+        } else {
+            var convo = proxyBuilder.create(ConvoWithOverrideSayBye.class, smalltalk, mixin);
+
+            var expectedConvo = new ConvoWithOverrideSayBye() {
+                @Override
+                public String sayBye() {
+                    return mixin.sayBye;
+                }
+
+                @Override
+                public String sayThings() {
+                    return mixin.sayThings;
+                }
+            };
+
+            assertEquals(expectedConvo.sayHello(), convo.sayHello());
+            assertEquals(expectedConvo.sayBye(), convo.sayBye());
+            assertEquals(expectedConvo.sayThings(), convo.sayThings());
+        }
     }
 
     @Test
-    public void testConvoWithCustomSayHelloAndSayBye() {
+    void testConvoWithCustomSayHelloAndSayBye() {
         var mixin = new ConvoMixinWithOverrideSayBye.Stub("How is your day?", "See you");
 
-        var convo = CompositeProxy.create(ConvoWithDefaultSayHelloWithOverrideSayBye.class, new Smalltalk() {}, mixin);
+        var convo = CompositeProxy.create(ConvoWithDefaultSayHelloWithOverrideSayBye.class, mixin);
 
         var expectedConvo = new ConvoWithDefaultSayHelloWithOverrideSayBye() {
             @Override
@@ -164,7 +195,7 @@ public class CompositeProxyTest {
     }
 
     @Test
-    public void testInherited() {
+    void testInherited() {
         interface Base {
             String doSome();
         }
@@ -193,7 +224,7 @@ public class CompositeProxyTest {
     }
 
     @Test
-    public void testNestedProxy() {
+    void testNestedProxy() {
         interface AddM {
             String m();
         }
@@ -231,7 +262,7 @@ public class CompositeProxyTest {
     }
 
     @Test
-    public void testComposite() {
+    void testComposite() {
         interface A {
             String sayHello();
             String sayBye();
@@ -262,54 +293,13 @@ public class CompositeProxyTest {
         assertEquals("ciao,bye", proxy.talk());
     }
 
-    @ParameterizedTest
-    @ValueSource(booleans = {true, false})
-    public void testBasicObjectMethods(boolean withOverrides) {
-        interface A {
-            default void foo() {}
+    @Test
+    void testBasicObjectMethods() {
+        interface Foo {
         }
 
-        interface B {
-            default void bar() {}
-        }
-
-        interface C extends A, B {
-        }
-
-        final A aImpl;
-        final B bImpl;
-
-        if (withOverrides) {
-            aImpl = new A() {
-                @Override
-                public String toString() {
-                    return "theA";
-                }
-
-                @Override
-                public boolean equals(Object other) {
-                    return true;
-                }
-
-                @Override
-                public int hashCode() {
-                    return 7;
-                }
-            };
-
-            bImpl = new B() {
-                @Override
-                public String toString() {
-                    return "theB";
-                }
-            };
-        } else {
-            aImpl = new A() {};
-            bImpl = new B() {};
-        }
-
-        var proxy = CompositeProxy.create(C.class, aImpl, bImpl);
-        var proxy2 = CompositeProxy.create(C.class, aImpl, bImpl);
+        var proxy = CompositeProxy.create(Foo.class);
+        var proxy2 = CompositeProxy.create(Foo.class);
 
         assertNotEquals(proxy.toString(), proxy2.toString());
         assertNotEquals(proxy.hashCode(), proxy2.hashCode());
@@ -320,7 +310,925 @@ public class CompositeProxyTest {
     }
 
     @Test
-    public void testJavadocExample() {
+    void testAutoMethodConflictResolver() {
+
+        interface A {
+            String getString();
+        }
+
+        interface B {
+            String getString();
+        }
+
+        interface AB extends A, B {
+        }
+
+        var foo = new Object() {
+            public String getString() {
+                return "foo";
+            }
+        };
+
+        var proxy = CompositeProxy.create(AB.class, foo);
+        assertEquals("foo", proxy.getString());
+    }
+
+    @Test
+    void testAutoMethodConflictResolver2() {
+
+        interface A {
+            String getString();
+        }
+
+        interface B {
+            String getString();
+        }
+
+        interface AB extends A, B {
+            String getString();
+        }
+
+        var foo = new Object() {
+            public String getString() {
+                return "foo";
+            }
+        };
+
+        var proxy = CompositeProxy.create(AB.class, foo);
+        assertEquals("foo", proxy.getString());
+    }
+
+    @Test
+    void testUnreferencedSlices() {
+
+        interface A {
+            String getString();
+        }
+
+        interface B {
+            String getString();
+        }
+
+        interface AB extends A, B {
+            default String getString() {
+                throw new AssertionError();
+            }
+        }
+
+        var foo = new Object() {
+            public String getString() {
+                throw new AssertionError();
+            }
+        };
+
+        var ex = assertThrowsExactly(IllegalArgumentException.class, () -> {
+            CompositeProxy.create(AB.class, foo);
+        });
+
+        assertEquals(String.format("Unreferenced slices: %s", List.of(foo)), ex.getMessage());
+    }
+
+    @Test
+    void testAutoMethodConflictResolver4() {
+
+        interface A {
+            String getString();
+        }
+
+        interface B {
+            String getString();
+        }
+
+        interface AB extends A, B {
+            default String getString() {
+                return "AB";
+            }
+        }
+
+        var proxy = CompositeProxy.create(AB.class);
+        assertEquals("AB", proxy.getString());
+    }
+
+    @Test
+    void testAutoMethodConflictResolver4_1() {
+
+        interface A {
+            String foo();
+            String bar();
+        }
+
+        interface B {
+            String foo();
+            String bar();
+        }
+
+        interface AB extends A, B {
+            default String foo() {
+                return "AB.foo";
+            }
+        }
+
+        var proxy = CompositeProxy.create(AB.class, new AB() {
+            @Override
+            public String bar() {
+                return "Obj.bar";
+            }
+        });
+        assertEquals("AB.foo", proxy.foo());
+        assertEquals("Obj.bar", proxy.bar());
+    }
+
+    @Test
+    void testAutoMethodConflictResolver5() {
+
+        interface A {
+            default String getString() {
+                throw new AssertionError();
+            }
+        }
+
+        interface B {
+            String getString();
+        }
+
+        interface AB extends A, B {
+            String getString();
+        }
+
+        var foo = new Object() {
+            public String getString() {
+                return "foo";
+            }
+        };
+
+        var proxy = CompositeProxy.create(AB.class, foo);
+        assertEquals("foo", proxy.getString());
+    }
+
+    @Test
+    void testAutoMethodConflictResolver6() {
+
+        interface A {
+            default String getString() {
+                return "A";
+            }
+        }
+
+        interface B {
+            String getString();
+        }
+
+        interface AB extends A, B {
+            default String getString() {
+                return A.super.getString() + "!";
+            }
+        }
+
+        var proxy = CompositeProxy.create(AB.class);
+        assertEquals("A!", proxy.getString());
+    }
+
+    @Test
+    void testAutoMethodConflictResolver7() {
+
+        interface A {
+            String getString();
+        }
+
+        interface B extends A {
+            default String getString() {
+                return "B";
+            }
+        }
+
+        interface AB extends A, B {
+            default String getString() {
+                return B.super.getString() + "!";
+            }
+        }
+
+        var proxy = CompositeProxy.create(AB.class);
+        assertEquals("B!", proxy.getString());
+    }
+
+    @ParameterizedTest
+    @ValueSource(booleans = {true, false})
+    void testAutoMethodConflictResolver8(boolean override) {
+
+        interface A {
+            String getString();
+        }
+
+        interface B extends A {
+            default String getString() {
+                return "B";
+            }
+        }
+
+        interface AB extends A, B {
+        }
+
+        if (override) {
+            var foo = new Object() {
+                public String getString() {
+                    return "foo";
+                }
+            };
+
+            var proxy = CompositeProxy.build().methodConflictResolver((_, _, _, _) -> {
+                return true;
+            }).create(AB.class, foo);
+            assertEquals("foo", proxy.getString());
+        } else {
+            var proxy = CompositeProxy.create(AB.class);
+            assertEquals("B", proxy.getString());
+        }
+    }
+
+    @Test
+    void testAutoMethodConflictResolver9() {
+
+        interface A {
+            String getString();
+        }
+
+        interface B extends A {
+            default String getString() {
+                throw new AssertionError();
+            }
+        }
+
+        var foo = new Object() {
+            public String getString() {
+                return "foo";
+            }
+        };
+
+        interface AB extends A, B {
+            String getString();
+        }
+
+        var ab = CompositeProxy.create(AB.class, foo);
+        assertEquals("foo", ab.getString());
+    }
+
+    @ParameterizedTest
+    @ValueSource(booleans = {true, false})
+    void testAutoMethodConflictResolver10(boolean override) {
+
+        interface A {
+            String getString();
+        }
+
+        interface B extends A {
+            default String getString() {
+                return "B";
+            }
+        }
+
+        interface AB extends A, B {
+            String getString();
+        }
+
+        if (override) {
+            var foo = new B() {
+                @Override
+                public String getString() {
+                    return B.super.getString() + "!";
+                }
+            };
+
+            var proxy = CompositeProxy.create(AB.class, foo);
+            assertEquals("B!", proxy.getString());
+        } else {
+            var proxy = CompositeProxy.create(AB.class, new B() {});
+            assertEquals("B", proxy.getString());
+        }
+    }
+
+    @Test
+    void testAutoMethodConflictResolver11() {
+
+        interface A {
+            String getString();
+        }
+
+        class Foo implements A {
+            @Override
+            public String getString() {
+                throw new AssertionError();
+            }
+        }
+
+        class Bar extends Foo {
+            @Override
+            public String getString() {
+                throw new AssertionError();
+            }
+        }
+
+        class Buz extends Bar {
+            @Override
+            public String getString() {
+                return "buz";
+            }
+        }
+
+        var proxy = CompositeProxy.create(A.class, new Buz());
+        assertEquals("buz", proxy.getString());
+    }
+
+    @ParameterizedTest
+    @ValueSource(booleans = {true, false})
+    void testAutoMethodConflictResolver12(boolean override) {
+
+        interface A {
+            String getString();
+        }
+
+        interface B {
+            default String getString() {
+                return "foo";
+            }
+        }
+
+        if (override) {
+            class BImpl implements B {
+                @Override
+                public String getString() {
+                    return "bar";
+                }
+            }
+
+            var proxy = CompositeProxy.create(A.class, new BImpl() {});
+            assertEquals("bar", proxy.getString());
+        } else {
+            class BImpl implements B {
+            }
+
+            var proxy = CompositeProxy.create(A.class, new BImpl() {});
+            assertEquals("foo", proxy.getString());
+        }
+    }
+
+    @ParameterizedTest
+    @ValueSource(booleans = {true, false})
+    void testAutoMethodConflictResolver13(boolean override) {
+
+        interface A {
+            String getString();
+        }
+
+        interface Foo {
+            default String getString() {
+                return "foo";
+            }
+        }
+
+        if (override) {
+            class B {
+                public String getString() {
+                    return "B";
+                }
+            }
+
+            class C extends B implements Foo {
+            }
+
+            for (var slice : List.of(new C(), new C() {})) {
+                var proxy = CompositeProxy.create(A.class, slice);
+                assertEquals("B", proxy.getString());
+            }
+
+            var proxy = CompositeProxy.create(A.class, new C() {
+                @Override
+                public String getString() {
+                    return "C";
+                }
+            });
+            assertEquals("C", proxy.getString());
+        } else {
+            class B {
+            }
+
+            class C extends B implements Foo {
+            }
+
+            for (var slice : List.of(new C(), new C() {})) {
+                var proxy = CompositeProxy.create(A.class, slice);
+                assertEquals("foo", proxy.getString());
+            }
+        }
+    }
+
+    @Test
+    void testAutoMethodConflictResolver14() {
+
+        interface Launcher {
+
+            String name();
+
+            Map<String, String> extraAppImageFileData();
+
+            record Stub(String name, Map<String, String> extraAppImageFileData) implements Launcher {}
+        }
+
+        interface WinLauncherMixin {
+
+            boolean shortcut();
+
+            record Stub(boolean shortcut) implements WinLauncherMixin {}
+        }
+
+        interface WinLauncher extends Launcher, WinLauncherMixin {
+
+            default Map<String, String> extraAppImageFileData() {
+                return Map.of("shortcut", Boolean.toString(shortcut()));
+            }
+        }
+
+        var proxy = CompositeProxy.create(WinLauncher.class, new Launcher.Stub("foo", Map.of()), new WinLauncherMixin.Stub(true));
+
+        assertEquals("foo", proxy.name());
+        assertEquals(Map.of("shortcut", "true"), proxy.extraAppImageFileData());
+    }
+
+    @ParameterizedTest
+    @CsvSource({
+        "a,b",
+        "b,a",
+    })
+    void testObjectConflictResolver(String fooResolve, String barResolve) {
+
+        interface I {
+            String foo();
+            String bar();
+        }
+
+        var a = new I() {
+            @Override
+            public String foo() {
+                return "a-foo";
+            }
+
+            @Override
+            public String bar() {
+                return "a-bar";
+            }
+        };
+
+        var b = new Object() {
+            public String foo() {
+                return "b-foo";
+            }
+
+            public String bar() {
+                return "b-bar";
+            }
+        };
+
+        Function<String, Object> resolver = tag -> {
+            return switch (tag) {
+                case "a" -> a;
+                case "b" -> b;
+                default -> {
+                    throw new AssertionError();
+                }
+            };
+        };
+
+        var proxy = CompositeProxy.build().objectConflictResolver((_, _, method, _) -> {
+            return switch (method.getName()) {
+                case "foo" -> resolver.apply(fooResolve);
+                case "bar" -> resolver.apply(barResolve);
+                default -> {
+                    throw new AssertionError();
+                }
+            };
+        }).create(I.class, a, b);
+
+        assertEquals(fooResolve + "-foo", proxy.foo());
+        assertEquals(barResolve + "-bar", proxy.bar());
+    }
+
+    @Test
+    void testObjectConflictResolverInvalid() {
+
+        interface I {
+            String foo();
+        }
+
+        var a = new I() {
+            @Override
+            public String foo() {
+                throw new AssertionError();
+            }
+        };
+
+        var b = new Object() {
+            public String foo() {
+                throw new AssertionError();
+            }
+        };
+
+        assertThrowsExactly(UnsupportedOperationException.class, () -> {
+            CompositeProxy.build().objectConflictResolver((_, _, _, _) -> {
+                return new Object();
+            }).create(I.class, a, b);
+        });
+    }
+
+    @ParameterizedTest
+    @ValueSource( strings = {
+        "no-foo",
+        "private-foo",
+        "protected-foo",
+        "package-foo",
+        "static-foo",
+        "static-foo,private-foo,no-foo",
+    })
+    void testMissingImplementer(@ConvertWith(StringArrayConverter.class) String[] slicesSpec) throws NoSuchMethodException, SecurityException {
+
+        interface A {
+            void foo();
+        }
+
+        var slices = Stream.of(slicesSpec).map(slice -> {
+            return switch (slice) {
+                case "no-foo" -> new Object();
+                case "private-foo" -> new Object() {
+                    private void foo() {
+                        throw new AssertionError();
+                    }
+                };
+                case "protected-foo" -> new Object() {
+                    protected void foo() {
+                        throw new AssertionError();
+                    }
+                };
+                case "package-foo" -> new Object() {
+                    void foo() {
+                        throw new AssertionError();
+                    }
+                };
+                case "static-foo" -> new Object() {
+                    public static void foo() {
+                        throw new AssertionError();
+                    }
+                };
+                default -> { throw new AssertionError(); }
+            };
+        }).toList();
+
+        var ex = assertThrowsExactly(IllegalArgumentException.class, () -> {
+            CompositeProxy.create(A.class, slices.toArray());
+        });
+
+        assertEquals(String.format("None of the slices can handle %s", A.class.getMethod("foo")), ex.getMessage());
+    }
+
+    @ParameterizedTest
+    @ValueSource(booleans = {true, false})
+    void testUnusedSlice(boolean all) {
+
+        interface A {
+            default void foo() {
+                throw new AssertionError();
+            }
+        }
+
+        A a = new A() {};
+        var obj = new Object();
+
+        if (all) {
+            var messages = Set.of(
+                    String.format("Unreferenced slices: %s", List.of(a, obj)),
+                    String.format("Unreferenced slices: %s", List.of(obj, a))
+            );
+
+            var ex = assertThrowsExactly(IllegalArgumentException.class, () -> {
+                CompositeProxy.create(A.class, a, obj);
+            });
+
+            assertTrue(messages.contains(ex.getMessage()));
+        } else {
+            interface B extends A {
+                void foo();
+            }
+
+            var ex = assertThrowsExactly(IllegalArgumentException.class, () -> {
+                CompositeProxy.create(B.class, a, obj);
+            });
+
+            assertEquals(String.format("Unreferenced slices: %s", List.of(obj)), ex.getMessage());
+        }
+    }
+
+    @ParameterizedTest
+    @CsvSource({
+        "'a,b,a',false",
+        "'a,b,a',true",
+        "'a,b',true",
+        "'b,a',true",
+        "'a,b',false",
+        "'b,a',false",
+    })
+    void testAmbiguousImplementers(
+            @ConvertWith(StringArrayConverter.class) String[] slicesSpec,
+            boolean withObjectConflictResolver) throws NoSuchMethodException, SecurityException {
+
+        interface A {
+            String foo();
+            String bar();
+        }
+
+        var a = new Object() {
+            public String foo() {
+                return "a-foo";
+            }
+            public String bar() {
+                throw new AssertionError();
+            }
+        };
+
+        var b = new Object() {
+            public String bar() {
+                return "b-bar";
+            }
+        };
+
+        var ambiguousMethod = A.class.getMethod("bar");
+
+        var slices = Stream.of(slicesSpec).map(slice -> {
+            return switch (slice) {
+                case "a" -> a;
+                case "b" -> b;
+                default -> { throw new AssertionError(); }
+            };
+        }).toArray();
+
+        if (withObjectConflictResolver) {
+            var proxy = CompositeProxy.build().objectConflictResolver((_, _, _, _) -> {
+                return b;
+            }).create(A.class, slices);
+
+            assertEquals("a-foo", proxy.foo());
+            assertEquals("b-bar", proxy.bar());
+        } else {
+            var ex = assertThrowsExactly(IllegalArgumentException.class, () -> {
+                CompositeProxy.create(A.class, slices);
+            });
+
+            var messages = Set.of(
+                    String.format("Ambiguous choice between %s for %s", List.of(a, b), ambiguousMethod),
+                    String.format("Ambiguous choice between %s for %s", List.of(b, a), ambiguousMethod)
+            );
+
+            assertTrue(messages.contains(ex.getMessage()));
+        }
+    }
+
+    @ParameterizedTest
+    @ValueSource(booleans = {true, false})
+    void testDifferentReturnTypes(boolean compatible) {
+
+        interface A {
+            Number foo();
+        }
+
+        Object obj;
+        if (compatible) {
+            obj = new Object() {
+                public Integer foo() {
+                    return 123;
+                }
+            };
+        } else {
+            obj = new Object() {
+                public String foo() {
+                    return "123";
+                }
+            };
+        }
+
+        var proxy = CompositeProxy.create(A.class, obj);
+
+        if (compatible) {
+            assertEquals(123, proxy.foo());
+        } else {
+            assertThrows(ClassCastException.class, proxy::foo);
+        }
+    }
+
+    @Test
+    void testCovariantReturnType() {
+
+        interface A {
+            Number foo();
+        }
+
+        interface Mixin {
+            String bar();
+        }
+
+        interface AWithMixin extends A, Mixin {
+            Integer foo();
+        }
+
+        var proxy = CompositeProxy.create(AWithMixin.class, new A() {
+            @Override
+            public Number foo() {
+                return 123;
+            }
+        }, new Mixin() {
+            @Override
+            public String bar() {
+                return "bar";
+            }
+        });
+
+        assertEquals(123, proxy.foo());
+        assertEquals("bar", proxy.bar());
+    }
+
+    @Test
+    void testNotInterface() {
+        var ex = assertThrowsExactly(IllegalArgumentException.class, () -> {
+            CompositeProxy.create(Integer.class);
+        });
+
+        assertEquals(String.format("Type %s must be an interface", Integer.class.getName()), ex.getMessage());
+    }
+
+    @Test
+    void testExcessiveInterfaces() {
+
+        interface Launcher {
+            String name();
+
+            default String executableResource() {
+                return "jpackageapplauncher";
+            }
+
+            record Stub(String name) implements Launcher {
+            }
+        }
+
+        interface WinLauncherMixin {
+            String version();
+
+            record Stub(String version) implements WinLauncherMixin {
+            }
+        }
+
+        interface WinLauncher extends Launcher, WinLauncherMixin {
+
+            default String executableResource() {
+                return "jpackageapplauncher.exe";
+            }
+        }
+
+        var winLauncher = CompositeProxy.create(WinLauncher.class, new Launcher.Stub("foo"), new WinLauncherMixin.Stub("1.0"));
+
+        var winLauncher2 = CompositeProxy.create(WinLauncher.class, new Launcher.Stub("bar"), winLauncher);
+
+        assertEquals("foo", winLauncher.name());
+        assertEquals("1.0", winLauncher.version());
+        assertEquals("jpackageapplauncher.exe", winLauncher.executableResource());
+
+        assertEquals("bar", winLauncher2.name());
+        assertEquals("1.0", winLauncher2.version());
+        assertEquals("jpackageapplauncher.exe", winLauncher2.executableResource());
+    }
+
+    @Test
+    void testInvokeTunnel() {
+
+        interface A {
+            default String foo() {
+                return "foo";
+            }
+            String bar();
+        }
+
+        var obj = new Object() {
+            public String bar() {
+                return "bar";
+            }
+        };
+
+        Slot<Boolean> invokeCalled = Slot.createEmpty();
+        invokeCalled.set(false);
+
+        Slot<Boolean> invokeDefaultCalled = Slot.createEmpty();
+        invokeDefaultCalled.set(false);
+
+        var proxy = CompositeProxy.build().invokeTunnel(new InvokeTunnel() {
+
+            @Override
+            public Object invoke(Object obj, Method method, Object[] args) throws Throwable {
+                invokeCalled.set(true);
+                return method.invoke(obj, args);
+            }
+
+            @Override
+            public Object invokeDefault(Object proxy, Method method, Object[] args) throws Throwable {
+                invokeDefaultCalled.set(true);
+                return InvocationHandler.invokeDefault(proxy, method, args);
+            }
+
+        }).create(A.class, obj);
+
+        assertFalse(invokeCalled.get());
+        assertFalse(invokeDefaultCalled.get());
+        assertEquals("foo", proxy.foo());
+        assertFalse(invokeCalled.get());
+        assertTrue(invokeDefaultCalled.get());
+
+        invokeDefaultCalled.set(false);
+        assertEquals("bar", proxy.bar());
+        assertTrue(invokeCalled.get());
+        assertFalse(invokeDefaultCalled.get());
+    }
+
+    @Test
+    void testDefaultOverride() {
+
+        interface AppImageLayout {
+
+            Path runtimeDirectory();
+
+            Path rootDirectory();
+
+            default boolean isResolved() {
+                return !rootDirectory().equals(Path.of(""));
+            }
+
+            default AppImageLayout unresolve() {
+                if (isResolved()) {
+                    final var root = rootDirectory();
+                    return map(root::relativize);
+                } else {
+                    return this;
+                }
+            }
+
+            AppImageLayout map(UnaryOperator<Path> mapper);
+
+            record Stub(Path rootDirectory, Path runtimeDirectory) implements AppImageLayout {
+
+                public Stub {
+                    Objects.requireNonNull(rootDirectory);
+                }
+
+                public Stub(Path runtimeDirectory) {
+                    this(Path.of(""), runtimeDirectory);
+                }
+
+                @Override
+                public AppImageLayout map(UnaryOperator<Path> mapper) {
+                    return new Stub(mapNullablePath(mapper, rootDirectory), mapNullablePath(mapper, runtimeDirectory));
+                }
+            }
+        }
+
+        interface ApplicationLayoutMixin {
+
+            Path appDirectory();
+
+            record Stub(Path appDirectory) implements ApplicationLayoutMixin {
+            }
+        }
+
+        interface ApplicationLayout extends AppImageLayout, ApplicationLayoutMixin {
+
+            @Override
+            default ApplicationLayout unresolve() {
+                return (ApplicationLayout)AppImageLayout.super.unresolve();
+            }
+
+            @Override
+            default ApplicationLayout map(UnaryOperator<Path> mapper) {
+                return CompositeProxy.create(ApplicationLayout.class,
+                        new AppImageLayout.Stub(rootDirectory(), runtimeDirectory()).map(mapper),
+                        new ApplicationLayoutMixin.Stub(mapper.apply(appDirectory())));
+            }
+        }
+
+        var proxy = CompositeProxy.create(ApplicationLayout.class,
+                new AppImageLayout.Stub(Path.of(""), Path.of("runtime")),
+                new ApplicationLayoutMixin.Stub(Path.of("app")));
+
+        assertSame(proxy, proxy.unresolve());
+
+        var mapped = proxy.map(Path.of("a")::resolve);
+        assertEquals(Path.of("a"), mapped.rootDirectory());
+        assertEquals(Path.of("a/runtime"), mapped.runtimeDirectory());
+        assertEquals(Path.of("a/app"), mapped.appDirectory());
+    }
+
+    @Test
+    void testJavadocExample() {
         interface Sailboat {
             default void trimSails() {}
         }
@@ -364,9 +1272,9 @@ public class CompositeProxyTest {
             }
         };
 
-        Sloop sloop = CompositeProxy.create(Sloop.class, new Sailboat() {}, withMain, withJib);
+        Sloop sloop = CompositeProxy.create(Sloop.class, withMain, withJib);
 
-        Catboat catboat = CompositeProxy.create(Catboat.class, new Sailboat() {}, withMain);
+        Catboat catboat = CompositeProxy.create(Catboat.class, withMain);
 
         sloop.trimSails();
         catboat.trimSails();
diff --git a/test/jdk/tools/jpackage/junit/tools/jdk/jpackage/test/JUnitUtils.java b/test/jdk/tools/jpackage/junit/tools/jdk/jpackage/test/JUnitUtils.java
index 530a0d5cb1f..97041ea1a0e 100644
--- a/test/jdk/tools/jpackage/junit/tools/jdk/jpackage/test/JUnitUtils.java
+++ b/test/jdk/tools/jpackage/junit/tools/jdk/jpackage/test/JUnitUtils.java
@@ -27,6 +27,7 @@ import static org.junit.jupiter.api.Assertions.assertEquals;
 import java.util.Map;
 import java.util.Objects;
 import org.junit.jupiter.api.Assertions;
+import org.junit.jupiter.params.converter.SimpleArgumentConverter;
 
 
 public final class JUnitUtils {
@@ -121,6 +122,19 @@ public final class JUnitUtils {
     }
 
 
+    public static class StringArrayConverter extends SimpleArgumentConverter {
+
+        @Override
+        protected Object convert(Object source, Class<?> targetType) {
+            if (source instanceof String && String[].class.isAssignableFrom(targetType)) {
+                return ((String) source).split("\\s*,\\s*");
+            } else {
+                throw new IllegalArgumentException();
+            }
+        }
+    }
+
+
     private static final class ExceptionCauseRemover extends Exception {
 
         ExceptionCauseRemover(Exception ex) {

From e893f4cf8465bf428b49191158c80060932215fc Mon Sep 17 00:00:00 2001
From: Alan Bateman <alanb@openjdk.org>
Date: Sat, 11 Apr 2026 04:49:31 +0000
Subject: [PATCH 560/655] 8196182: ServiceLoader.iterator().hasNext()/.next()
 may throw a LinkageError 8350481: ServiceLoader throws NCDEF instead of
 ServiceConfigurationError

Reviewed-by: liach, jpai
---
 .../classes/java/util/ServiceLoader.java      |  10 +-
 .../util/ServiceLoader/LinkageErrorsTest.java | 214 ++++++++++++++++++
 .../MalformedAnnotationProcessorTests.java    |  10 +-
 3 files changed, 224 insertions(+), 10 deletions(-)
 create mode 100644 test/jdk/java/util/ServiceLoader/LinkageErrorsTest.java

diff --git a/src/java.base/share/classes/java/util/ServiceLoader.java b/src/java.base/share/classes/java/util/ServiceLoader.java
index 5137adc1c08..5e4fa4ed2ef 100644
--- a/src/java.base/share/classes/java/util/ServiceLoader.java
+++ b/src/java.base/share/classes/java/util/ServiceLoader.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2005, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2005, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -621,9 +621,9 @@ public final class ServiceLoader<S>
         Constructor<?> ctor = null;
         try {
             ctor = clazz.getConstructor();
-        } catch (NoSuchMethodException ex) {
+        } catch (NoSuchMethodException | LinkageError e) {
             String cn = clazz.getName();
-            fail(service, cn + " Unable to get public no-arg constructor", ex);
+            fail(service, cn + " Unable to get public no-arg constructor", e);
         }
         if (inExplicitModule(clazz))
             ctor.setAccessible(true);
@@ -1086,8 +1086,8 @@ public final class ServiceLoader<S>
             String cn = pending.next();
             try {
                 return Class.forName(cn, false, loader);
-            } catch (ClassNotFoundException x) {
-                fail(service, "Provider " + cn + " not found");
+            } catch (ClassNotFoundException | LinkageError e) {
+                fail(service, "Provider " + cn + " not found", e);
                 return null;
             }
         }
diff --git a/test/jdk/java/util/ServiceLoader/LinkageErrorsTest.java b/test/jdk/java/util/ServiceLoader/LinkageErrorsTest.java
new file mode 100644
index 00000000000..209dce75267
--- /dev/null
+++ b/test/jdk/java/util/ServiceLoader/LinkageErrorsTest.java
@@ -0,0 +1,214 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+/*
+ * @test
+ * @bug 8196182 8350481
+ * @summary Test ServiceLoader iterating over service providers when linkage error is thrown
+ * @library /test/lib
+ * @run junit/othervm ${test.main.class}
+ */
+
+import java.io.File;
+import java.io.IOException;
+import java.net.URL;
+import java.net.URLClassLoader;
+import java.nio.file.Files;
+import java.nio.file.Path;
+import java.util.ArrayList;
+import java.util.Arrays;
+import java.util.List;
+import java.util.Iterator;
+import java.util.Map;
+import java.util.ServiceConfigurationError;
+import java.util.ServiceLoader;
+import java.util.function.Consumer;
+import java.util.function.Predicate;
+import jdk.test.lib.compiler.InMemoryJavaCompiler;
+
+import org.junit.jupiter.api.Test;
+import static org.junit.jupiter.api.Assertions.*;
+
+class LinkageErrorsTest {
+
+    /**
+     * Test iteration over service providers when loading a service provider class
+     * fails with a linkage error.
+     */
+    @Test
+    void testLoadClassThrows() throws Exception {
+        Map<String, String> sources = Map.of(
+                "Service",
+                        """
+                        public interface Service {}
+                        """,
+                "Super",
+                        """
+                        class Super {}
+                        """,
+                "Provider1",
+                        """
+                        public class Provider1 implements Service {
+                            public Provider1() {}
+                        }
+                        """,
+                "Provider2",
+                        """
+                        public class Provider2 extends Super implements Service {
+                            public Provider2() {}
+                        }
+                        """
+        );
+        Path classesDir = compile(sources);
+
+        // delete Provider2's super class to prevent Provider2 from loading
+        Files.delete(classesDir.resolve("Super.class"));
+
+        // create services configuration file that lists two providers
+        createServicesConfigFile(classesDir, "Service", "Provider1", "Provider2");
+
+        // load the service interface
+        var loader = new URLClassLoader(new URL[] { classesDir.toUri().toURL() });
+        Class<?> service = loader.loadClass("Service");
+        assertSame(loader, service.getClassLoader());
+
+        // find and collect all service providers and ServiceConfigurationErrors
+        var providers = new ArrayList<Object>();
+        var errors = new ArrayList<ServiceConfigurationError>();
+        forEachProvider(loader, service, providers::add, errors::add);
+
+        // Provider1 should be found
+        assertEquals(1, providers.size());
+        assertEquals("Provider1", providers.get(0).getClass().getName());
+
+        // loading Provider2 expected to fail with LinkageError
+        assertEquals(1, errors.size());
+        assertInstanceOf(LinkageError.class, errors.get(0).getCause());
+    }
+
+    /**
+     * Test iteration over service providers when finding the public no-arg constructor
+     * of a provider fails with a linkage error.
+     */
+    @Test
+    void testFindConstructorThrows() throws Exception {
+        Map<String, String> sources = Map.of(
+                "Service",
+                    """
+                    public interface Service {}
+                    """,
+                "Param",
+                    """
+                    class Param {}
+                    """,
+                "Provider1",
+                    """
+                    public class Provider1 implements Service {
+                        public Provider1() {}
+                    }
+                    """,
+                "Provider2",
+                    """
+                    public class Provider2 implements Service {
+                        public Provider2() {}
+                        public Provider2(Param p) { }
+                    }
+                    """
+        );
+        Path classesDir = compile(sources);
+
+        // delete the class file for the parameter of Provider's 1-param ctor
+        Files.delete(classesDir.resolve("Param.class"));
+
+        // create services configuration file that lists two providers
+        createServicesConfigFile(classesDir, "Service", "Provider1", "Provider2");
+
+        // load the service interface
+        var loader = new URLClassLoader(new URL[] { classesDir.toUri().toURL() });
+        Class<?> service = loader.loadClass("Service");
+        assertSame(loader, service.getClassLoader());
+
+        // find and collect all service providers and ServiceConfigurationErrors
+        var providers = new ArrayList<Object>();
+        var errors = new ArrayList<ServiceConfigurationError>();
+        forEachProvider(loader, service, providers::add, errors::add);
+
+        // Provider1 should be found
+        assertEquals(1, providers.size());
+        assertEquals("Provider1", providers.get(0).getClass().getName());
+
+        // loading Provider2 expected to fail with LinkageError
+        assertEquals(1, errors.size());
+        assertInstanceOf(LinkageError.class, errors.get(0).getCause());
+    }
+
+    /**
+     * Compile the given java source files to a temporary directory.
+     */
+    private Path compile(Map<String, ? extends CharSequence> sources) throws IOException {
+        Map<String, byte[]> classes = InMemoryJavaCompiler.compile(sources);
+        Path dir = Files.createTempDirectory(Path.of("."), "classes");
+        for (String cn : classes.keySet()) {
+            Path file = dir.resolve(cn.replace('.', File.separatorChar) + ".class");
+            Files.createDirectories(file.getParent());
+            Files.write(file, classes.get(cn));
+        }
+        return dir;
+    }
+
+    /**
+     * Create services configuration file for the given service and providers.
+     */
+    private void createServicesConfigFile(Path dir,
+                                          String serviceName,
+                                          String... providerNames) throws IOException {
+        Path configFile = dir.resolve("META-INF", "services", serviceName);
+        Files.createDirectories(configFile.getParent());
+        Files.write(configFile, Arrays.asList(providerNames));
+    }
+
+    /**
+     * Uses ServiceLoader to iterate over all service providers of the given service,
+     * invoking {@code providerConsumer} for each provider instantiated, and
+     * {@code errorConsumer} for each ServiceConfigurationError encountered.
+     */
+    private <T> void forEachProvider(ClassLoader loader,
+                                     Class<T> service,
+                                     Consumer<T> providerConsumer,
+                                     Consumer<ServiceConfigurationError> errorConsumer) {
+        Iterator<T> iterator = ServiceLoader.load(service, loader).iterator();
+        boolean done = false;
+        while (!done) {
+            try {
+                if (iterator.hasNext()) {
+                    T provider = iterator.next();
+                    providerConsumer.accept(provider);
+                } else {
+                    done = true;
+                }
+            } catch (ServiceConfigurationError e) {
+                errorConsumer.accept(e);
+            }
+        }
+    }
+}
diff --git a/test/langtools/tools/javac/annotations/8218152/MalformedAnnotationProcessorTests.java b/test/langtools/tools/javac/annotations/8218152/MalformedAnnotationProcessorTests.java
index 68e4aea0ab2..85095cc5537 100644
--- a/test/langtools/tools/javac/annotations/8218152/MalformedAnnotationProcessorTests.java
+++ b/test/langtools/tools/javac/annotations/8218152/MalformedAnnotationProcessorTests.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2019, 2023, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2019, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -91,8 +91,8 @@ public class MalformedAnnotationProcessorTests extends TestRunner{
                     .getOutputLines(Task.OutputKind.DIRECT);
 
         System.out.println(actualErrors.get(0));
-        if (!actualErrors.get(0).contains("- compiler.err.proc.cant.load.class: " +
-                                          "Incompatible magic value")) {
+        if (!actualErrors.get(0).contains("- compiler.err.proc.bad.config.file: " +
+            "javax.annotation.processing.Processor: Provider BadAnnoProcessor not found")) {
             throw new AssertionError("Unexpected errors reported: " + actualErrors);
         }
     }
@@ -162,8 +162,8 @@ public class MalformedAnnotationProcessorTests extends TestRunner{
                     .writeAll()
                     .getOutputLines(Task.OutputKind.DIRECT);
 
-        if (!actualErrors.get(0).contains("- compiler.err.proc.cant.load.class: " +
-            "WrongClassFileVersion has been compiled by a more recent version")) {
+        if (!actualErrors.get(0).contains("- compiler.err.proc.bad.config.file: " +
+            "javax.annotation.processing.Processor: Provider WrongClassFileVersion not found")) {
             throw new AssertionError("Unexpected errors reported: " + actualErrors);
         }
     }

From e7da7376cd5299df3c70bdd3e47d62e75b9a3ae7 Mon Sep 17 00:00:00 2001
From: SendaoYan <syan@openjdk.org>
Date: Sat, 11 Apr 2026 05:30:38 +0000
Subject: [PATCH 561/655] 8370648: TestOldGrowthTriggers.java fails 'Trigger
 (Old): Old has overgrown' missing from stdout/stderr

Reviewed-by: xpeng, wkemper, kdnilsen, ysr
---
 .../generational/TestOldGrowthTriggers.java   | 58 +++++++++++--------
 1 file changed, 33 insertions(+), 25 deletions(-)

diff --git a/test/hotspot/jtreg/gc/shenandoah/generational/TestOldGrowthTriggers.java b/test/hotspot/jtreg/gc/shenandoah/generational/TestOldGrowthTriggers.java
index 7af81fabe13..2af784fd034 100644
--- a/test/hotspot/jtreg/gc/shenandoah/generational/TestOldGrowthTriggers.java
+++ b/test/hotspot/jtreg/gc/shenandoah/generational/TestOldGrowthTriggers.java
@@ -1,5 +1,6 @@
 /*
  * Copyright Amazon.com Inc. or its affiliates. All Rights Reserved.
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,15 +26,14 @@
 /*
  * @test id=generational
  * @summary Test that growth of old-gen triggers old-gen marking
- * @key intermittent
  * @requires vm.gc.Shenandoah
  * @requires vm.flagless
  * @library /test/lib
  * @run driver TestOldGrowthTriggers
  */
 
-import java.util.*;
-import java.math.BigInteger;
+import java.util.Arrays;
+import java.util.BitSet;
 
 import jdk.test.lib.process.ProcessTools;
 import jdk.test.lib.process.OutputAnalyzer;
@@ -41,36 +41,40 @@ import jdk.test.lib.process.OutputAnalyzer;
 public class TestOldGrowthTriggers {
 
     public static void makeOldAllocations() {
-        // Expect most of the BigInteger entries placed into array to be promoted, and most will eventually become garbage within old
+        // Expect most of the BitSet entries placed into array to be promoted, and most will eventually become garbage within old
 
-        final int ArraySize = 512 * 1024;   // 512K entries
-        final int BitsInBigInteger = 128;
-        final int RefillIterations = 64;
-        BigInteger array[] = new BigInteger[ArraySize];
-        Random r = new Random(46);
+        final int ArraySize = 1024;  // 1K entries
+        final int RefillIterations = 128;
+        BitSet[] array = new BitSet[ArraySize];
 
         for (int i = 0; i < ArraySize; i++) {
-            array[i] = new BigInteger(BitsInBigInteger, r);
+            array[i] = new BitSet(256 * 1024);
         }
 
         for (int refillCount = 0; refillCount < RefillIterations; refillCount++) {
-            // Each refill repopulates ArraySize randomly selected elements within array
-            for (int i = 0; i < ArraySize; i++) {
-                int replaceIndex = r.nextInt(ArraySize);
-                int deriveIndex = r.nextInt(ArraySize);
+            // Each refill repopulates ArraySize
+            for (int i = 1; i < ArraySize; i++) {
+                int replaceIndex = i;
+                int deriveIndex = i-1;
+
                 switch (i & 0x7) {
-                    case 0,1,2:
-                        // creates new old BigInteger, releases old BigInteger,
-                        // may create ephemeral data while computing gcd
-                        array[replaceIndex] = array[replaceIndex].gcd(array[deriveIndex]);
-                        break;
-                    case 3,4:
-                        // creates new old BigInteger, releases old BigInteger
-                        array[replaceIndex] = array[replaceIndex].multiply(array[deriveIndex]);
-                        break;
-                    case 5,6,7:
+                    case 0,1,2 -> {
+                        // creates new BitSet, releases old BitSet,
+                        // create ephemeral data while computing
+                        BitSet result = (BitSet) array[deriveIndex].clone();
+                        for (int j=0; j<10; j++) {
+                            result = (BitSet) array[deriveIndex].clone();
+                        }
+                        array[replaceIndex] = result;
+                    }
+                    case 3,4 -> {
+                        // creates new BitSet, releases old BitSet
+                        BitSet result = (BitSet) array[deriveIndex].clone();
+                        array[replaceIndex] = result;
+                    }
+                    case 5,6,7 -> {
                         // do nothing, let all objects in the array age to increase pressure on old generation
-                        break;
+                    }
                 }
             }
         }
@@ -93,6 +97,8 @@ public class TestOldGrowthTriggers {
         }
 
         testOld("-Xlog:gc",
+                "-XX:ConcGCThreads=1",
+                "-XX:ParallelGCThreads=1",
                 "-Xms96m",
                 "-Xmx96m",
                 "-XX:+UnlockDiagnosticVMOptions",
@@ -108,6 +114,8 @@ public class TestOldGrowthTriggers {
         );
 
         testOld("-Xlog:gc",
+                "-XX:ConcGCThreads=1",
+                "-XX:ParallelGCThreads=1",
                 "-Xms96m",
                 "-Xmx96m",
                 "-XX:+UnlockDiagnosticVMOptions",

From 1e2b0d2b67c7ae0843c9adbc641471040fbe7d71 Mon Sep 17 00:00:00 2001
From: Arno Zeller <azeller@openjdk.org>
Date: Sat, 11 Apr 2026 19:42:35 +0000
Subject: [PATCH 562/655] 8382018:
 test/jdk/java/nio/file/spi/SetDefaultProvider.java leaves a directory in /tmp

Reviewed-by: alanb, mbaesken
---
 test/jdk/java/nio/file/spi/testapp/testapp/Main.java | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/test/jdk/java/nio/file/spi/testapp/testapp/Main.java b/test/jdk/java/nio/file/spi/testapp/testapp/Main.java
index 6f61d431707..5a48ff47384 100644
--- a/test/jdk/java/nio/file/spi/testapp/testapp/Main.java
+++ b/test/jdk/java/nio/file/spi/testapp/testapp/Main.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2017, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2017, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -41,7 +41,7 @@ public class Main {
             throw new RuntimeException("FileSystemProvider not overridden");
 
         // exercise the file system
-        Path dir = Files.createTempDirectory("tmp");
+        Path dir = Files.createTempDirectory(Path.of(""), "tmp");
         if (dir.getFileSystem() != fs)
             throw new RuntimeException("'dir' not in default file system");
         System.out.println("created: " + dir);

From fb2460663c68dc909107b3bb39d322db2038ae79 Mon Sep 17 00:00:00 2001
From: Daniel Gredler <dgredler@openjdk.org>
Date: Sun, 12 Apr 2026 23:16:05 +0000
Subject: [PATCH 563/655] 8381623: Additional immutability in sun.font:
 ExtendedTextSourceLabel, GlyphLayout

Reviewed-by: serb, prr
---
 .../sun/font/ExtendedTextSourceLabel.java     | 39 +++++++------------
 .../share/classes/sun/font/GlyphLayout.java   |  8 ++--
 2 files changed, 17 insertions(+), 30 deletions(-)

diff --git a/src/java.desktop/share/classes/sun/font/ExtendedTextSourceLabel.java b/src/java.desktop/share/classes/sun/font/ExtendedTextSourceLabel.java
index f3569941321..78ae70629b6 100644
--- a/src/java.desktop/share/classes/sun/font/ExtendedTextSourceLabel.java
+++ b/src/java.desktop/share/classes/sun/font/ExtendedTextSourceLabel.java
@@ -57,15 +57,16 @@ import java.util.Map;
  * Align bounds is a rect that defines how to align this to margins.
  * it generally allows some overhang that logical bounds would prevent.
  */
-class ExtendedTextSourceLabel implements TextLineComponent, Decoration.Label {
+final class ExtendedTextSourceLabel implements TextLineComponent, Decoration.Label {
 
   private final TextSource source;
   private final Decoration decorator;
 
   // caches
-  private Font font;
-  private AffineTransform baseTX;
-  private CoreMetrics cm;
+  private final Font font;
+  private final AffineTransform baseTX;
+  private final CoreMetrics cm;
+  private final float advTracking;
 
   private Rectangle2D lb;
   private Rectangle2D ab;
@@ -74,34 +75,18 @@ class ExtendedTextSourceLabel implements TextLineComponent, Decoration.Label {
   private StandardGlyphVector gv;
   private float[] charinfo;
 
-  private float advTracking;
-
   /**
    * Create from a TextSource.
    */
   public ExtendedTextSourceLabel(TextSource source, Decoration decorator) {
     this.source = source;
     this.decorator = decorator;
-    finishInit();
-  }
-
-  /**
-   * Create from a TextSource, optionally using cached data from oldLabel starting at the offset.
-   * If present oldLabel must have been created from a run of text that includes the text used in
-   * the new label.  Start in source corresponds to logical character offset in oldLabel.
-   */
-  public ExtendedTextSourceLabel(TextSource source, ExtendedTextSourceLabel oldLabel, int offset) {
-    // currently no optimization.
-    this.source = source;
-    this.decorator = oldLabel.decorator;
-    finishInit();
-  }
-
-  private void finishInit() {
-    font = source.getFont();
 
+    Font font = source.getFont();
     Map<TextAttribute, ?> atts = font.getAttributes();
-    baseTX = AttributeValues.getBaselineTransform(atts);
+    AffineTransform baseTX = AttributeValues.getBaselineTransform(atts);
+
+    CoreMetrics cm;
     if (baseTX == null){
         cm = source.getCoreMetrics();
     } else {
@@ -110,13 +95,15 @@ class ExtendedTextSourceLabel implements TextLineComponent, Decoration.Label {
           charTX = new AffineTransform();
       }
       font = font.deriveFont(charTX);
-
       LineMetrics lm = font.getLineMetrics(source.getChars(), source.getStart(),
           source.getStart() + source.getLength(), source.getFRC());
       cm = CoreMetrics.get(lm);
     }
 
-    advTracking = font.getSize() * AttributeValues.getTracking(atts);
+    this.font = font;
+    this.baseTX = baseTX;
+    this.cm = cm;
+    this.advTracking = font.getSize() * AttributeValues.getTracking(atts);
   }
 
   /**
diff --git a/src/java.desktop/share/classes/sun/font/GlyphLayout.java b/src/java.desktop/share/classes/sun/font/GlyphLayout.java
index 5bff127f143..851201fe347 100644
--- a/src/java.desktop/share/classes/sun/font/GlyphLayout.java
+++ b/src/java.desktop/share/classes/sun/font/GlyphLayout.java
@@ -125,10 +125,10 @@ public final class GlyphLayout {
     }
 
     private static final class SDCache {
-        public AffineTransform dtx;
-        public AffineTransform gtx;
-        public Point2D.Float delta;
-        public FontStrikeDesc sd;
+        private final AffineTransform dtx;
+        private final AffineTransform gtx;
+        private final Point2D.Float delta;
+        private final FontStrikeDesc sd;
 
         private SDCache(Font font, FontRenderContext frc) {
             // !!! add getVectorTransform and hasVectorTransform to frc?  then

From d75bb86ca69d5b547c4f46217387849333afa1f3 Mon Sep 17 00:00:00 2001
From: Arno Zeller <azeller@openjdk.org>
Date: Mon, 13 Apr 2026 05:36:15 +0000
Subject: [PATCH 564/655] 8380896: Reduce runtime for
 MonitorVmStartTerminate.java on hosts with a lot of VMs

Reviewed-by: lmesnik, sspitsyn
---
 .../MonitoredVm/MonitorVmStartTerminate.java  | 36 +++++++++++--------
 1 file changed, 22 insertions(+), 14 deletions(-)

diff --git a/test/jdk/sun/jvmstat/monitor/MonitoredVm/MonitorVmStartTerminate.java b/test/jdk/sun/jvmstat/monitor/MonitoredVm/MonitorVmStartTerminate.java
index 88f1ed22e35..f436bd32e1b 100644
--- a/test/jdk/sun/jvmstat/monitor/MonitoredVm/MonitorVmStartTerminate.java
+++ b/test/jdk/sun/jvmstat/monitor/MonitoredVm/MonitorVmStartTerminate.java
@@ -148,8 +148,17 @@ public final class MonitorVmStartTerminate {
         }
 
         private void releaseStarted(Integer id) {
+            String monitoredArgs = readMainArgs(id);
+            if (monitoredArgs == null || monitoredArgs.equals("Unknown")) {
+                System.out.println("releaseStarted: not a test pid: " + id);
+                return;
+            }
+
             for (JavaProcess jp : processes) {
-                if (hasMainArgs(id, jp.getMainArgsIdentifier())) {
+                if (jp.getId() != null) {
+                    continue;
+                }
+                if (monitoredArgs.contains(jp.getMainArgsIdentifier())) {
                     // store id for terminated identification
                     jp.setId(id);
                     System.out.println("RELEASED started (id=" + jp.getId() + ", args=" + jp.getMainArgsIdentifier() + ")");
@@ -177,40 +186,39 @@ public final class MonitorVmStartTerminate {
             }
         }
 
-        private boolean hasMainArgs(Integer id, String args) {
-            VmIdentifier vmid = null;
+        private String readMainArgs(Integer id) {
+            VmIdentifier vmid;
             try {
                 vmid = new VmIdentifier("//" + id.intValue());
             } catch (URISyntaxException e) {
-                System.out.println("hasMainArgs(" + id + "): " + e);
-                return false;
+                System.out.println("readMainArgs(" + id + "): " + e);
+                return null;
             }
-            // Retry a failing attempt to check arguments for a match,
+            // Retry a failing attempt to read arguments,
             // as not recognizing a test process will cause timeout and failure.
             for (int i = 0; i < ARGS_ATTEMPTS; i++) {
                 try {
                     MonitoredVm target = host.getMonitoredVm(vmid);
                     String monitoredArgs = MonitoredVmUtil.mainArgs(target);
-                    System.out.println("hasMainArgs(" + id + "): has main args: '" + monitoredArgs + "'");
+                    System.out.println("readMainArgs(" + id + "): has main args: '" + monitoredArgs + "'");
                     if (monitoredArgs == null || monitoredArgs.equals("Unknown")) {
-                        System.out.println("hasMainArgs(" + id + "): retry" );
+                        System.out.println("readMainArgs(" + id + "): retry");
                         takeNap();
                         continue;
-                    } else if (monitoredArgs.contains(args)) {
-                        return true;
                     } else {
-                        return false;
+                        return monitoredArgs;
                     }
                 } catch (MonitorException e) {
                     // Process probably not running or not ours, e.g.
                     // sun.jvmstat.monitor.MonitorException: Could not attach to PID
                     // Only log if something else, to avoid filling log:
-                    if (!e.getMessage().contains("Could not attach")) {
-                        System.out.println("hasMainArgs(" + id + "): " + e);
+                    String message = e.getMessage();
+                    if (message == null || !message.contains("Could not attach")) {
+                        System.out.println("readMainArgs(" + id + "): " + e);
                     }
                 }
             }
-            return false;
+            return null;
         }
     }
 

From 6371da9a44bf1feb487ed6bea67bddd3344d9aee Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Hannes=20Walln=C3=B6fer?= <hannesw@openjdk.org>
Date: Mon, 13 Apr 2026 06:14:13 +0000
Subject: [PATCH 565/655] 8378228: Replace jQuery UI autocomplete component in
 JavaDoc search

Reviewed-by: nbenalla
---
 .../doclets/formats/html/HtmlDoclet.java      |    13 +-
 .../doclets/formats/html/HtmlIds.java         |     7 +-
 .../doclets/formats/html/Navigation.java      |    40 +-
 .../doclets/formats/html/SearchWriter.java    |    14 +-
 .../doclets/formats/html/markup/Head.java     |     9 +-
 .../formats/html/markup/HtmlStyles.java       |    12 +-
 .../html/resources/jquery/jquery-3.7.1.js     | 10716 ----------------
 .../html/resources/jquery/jquery-3.7.1.min.js |     2 -
 .../html/resources/jquery/jquery-ui.css       |   148 -
 .../html/resources/jquery/jquery-ui.js        |  2653 ----
 .../html/resources/jquery/jquery-ui.min.css   |     6 -
 .../html/resources/jquery/jquery-ui.min.js    |     6 -
 .../formats/html/resources/script.js.template |    16 +-
 .../formats/html/resources/search-page.js     |   348 -
 .../formats/html/resources/search.js.template |   603 +-
 .../formats/html/resources/stylesheet.css     |   280 +-
 .../toolkit/resources/doclets.properties      |    11 +-
 .../doclets/toolkit/util/DocPaths.java        |    21 +-
 src/jdk.javadoc/share/legal/jquery.md         |    26 -
 src/jdk.javadoc/share/legal/jqueryUI.md       |    49 -
 .../CheckLibraryVersions.java                 |     6 +-
 .../CheckStylesheetClasses.java               |    15 +-
 .../javadoc/doclet/testFonts/TestFonts.java   |     3 +-
 .../testPassthruFiles/TestPassThruFiles.java  |    10 +-
 .../javadoc/doclet/testSearch/TestSearch.java |    53 +-
 .../doclet/testStylesheet/TestStylesheet.java |     3 +-
 .../jdk/javadoc/tool/api/basic/APITest.java   |     9 +-
 27 files changed, 747 insertions(+), 14332 deletions(-)
 delete mode 100644 src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclets/formats/html/resources/jquery/jquery-3.7.1.js
 delete mode 100644 src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclets/formats/html/resources/jquery/jquery-3.7.1.min.js
 delete mode 100644 src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclets/formats/html/resources/jquery/jquery-ui.css
 delete mode 100644 src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclets/formats/html/resources/jquery/jquery-ui.js
 delete mode 100644 src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclets/formats/html/resources/jquery/jquery-ui.min.css
 delete mode 100644 src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclets/formats/html/resources/jquery/jquery-ui.min.js
 delete mode 100644 src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclets/formats/html/resources/search-page.js
 delete mode 100644 src/jdk.javadoc/share/legal/jquery.md
 delete mode 100644 src/jdk.javadoc/share/legal/jqueryUI.md

diff --git a/src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclets/formats/html/HtmlDoclet.java b/src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclets/formats/html/HtmlDoclet.java
index 66fcd90e2e8..17d56ff11ba 100644
--- a/src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclets/formats/html/HtmlDoclet.java
+++ b/src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclets/formats/html/HtmlDoclet.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1997, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -335,16 +335,9 @@ public class HtmlDoclet extends AbstractDoclet {
 
         if (options.createIndex()) {
             copyResource(DocPaths.SEARCH_JS_TEMPLATE, DocPaths.SCRIPT_FILES.resolve(DocPaths.SEARCH_JS), true);
-            copyResource(DocPaths.SEARCH_PAGE_JS, DocPaths.SCRIPT_FILES.resolve(DocPaths.SEARCH_PAGE_JS), true);
             copyResource(DocPaths.GLASS_SVG, DocPaths.RESOURCE_FILES.resolve(DocPaths.GLASS_SVG), false);
             copyResource(DocPaths.X_SVG, DocPaths.RESOURCE_FILES.resolve(DocPaths.X_SVG), false);
-            // No newline replacement for JQuery files
-            copyResource(DocPaths.JQUERY_DIR.resolve(DocPaths.JQUERY_JS),
-                    DocPaths.SCRIPT_FILES.resolve(DocPaths.JQUERY_JS), false);
-            copyResource(DocPaths.JQUERY_DIR.resolve(DocPaths.JQUERY_UI_JS),
-                    DocPaths.SCRIPT_FILES.resolve(DocPaths.JQUERY_UI_JS), false);
-            copyResource(DocPaths.JQUERY_DIR.resolve(DocPaths.JQUERY_UI_CSS),
-                    DocPaths.RESOURCE_FILES.resolve(DocPaths.JQUERY_UI_CSS), false);        }
+        }
 
         copyLegalFiles(options.createIndex(), options.syntaxHighlight());
         // Print a notice if the documentation contains diagnostic markers
@@ -369,7 +362,7 @@ public class HtmlDoclet extends AbstractDoclet {
             case "", "default" -> {
                 // use a known resource as a stand-in, because we cannot get the URL for a resources directory
                 var url = HtmlDoclet.class.getResource(
-                        DocPaths.RESOURCES.resolve(DocPaths.LEGAL).resolve(DocPaths.JQUERY_MD).getPath());
+                        DocPaths.RESOURCES.resolve(DocPaths.LEGAL).resolve(DocPaths.DEJAVU_MD).getPath());
                 if (url != null) {
                     try {
                         legalNoticesDir = Path.of(url.toURI()).getParent();
diff --git a/src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclets/formats/html/HtmlIds.java b/src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclets/formats/html/HtmlIds.java
index a3fba7eca14..50e6207b833 100644
--- a/src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclets/formats/html/HtmlIds.java
+++ b/src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclets/formats/html/HtmlIds.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2021, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2021, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -112,6 +112,11 @@ public class HtmlIds {
     static final HtmlId RELATED_PACKAGE_SUMMARY = HtmlId.of("related-package-summary");
     static final HtmlId RESET_SEARCH = HtmlId.of("reset-search");
     static final HtmlId SEARCH_INPUT = HtmlId.of("search-input");
+    static final HtmlId SEARCH_INPUT_CONTAINER = HtmlId.of("search-input-container");
+    static final HtmlId SEARCH_MODULES = HtmlId.of("search-modules");
+    static final HtmlId SEARCH_PAGE_LINK = HtmlId.of("search-page-link");
+    static final HtmlId SEARCH_RESULT_CONTAINER = HtmlId.of("search-result-container");
+    static final HtmlId SEARCH_RESULT_SECTION = HtmlId.of("search-result-section");
     static final HtmlId SERVICES = HtmlId.of("services-summary");
     static final HtmlId SKIP_NAVBAR_TOP = HtmlId.of("skip-navbar-top");
     static final HtmlId THEME_BUTTON = HtmlId.of("theme-button");
diff --git a/src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclets/formats/html/Navigation.java b/src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclets/formats/html/Navigation.java
index 30318bbaeea..cde5b287e25 100644
--- a/src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclets/formats/html/Navigation.java
+++ b/src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclets/formats/html/Navigation.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -45,6 +45,8 @@ import jdk.javadoc.internal.html.Content;
 import jdk.javadoc.internal.html.ContentBuilder;
 import jdk.javadoc.internal.html.Entity;
 import jdk.javadoc.internal.html.HtmlAttr;
+import jdk.javadoc.internal.html.HtmlId;
+import jdk.javadoc.internal.html.HtmlTag;
 import jdk.javadoc.internal.html.HtmlTree;
 import jdk.javadoc.internal.html.Text;
 
@@ -535,6 +537,42 @@ public class Navigation {
                 .add(inputText)
                 .add(inputReset);
         target.add(searchDiv);
+        target.add(HtmlTree.DIV(HtmlIds.SEARCH_RESULT_SECTION)
+                .add(HtmlTree.DIV(HtmlStyles.searchForm)
+                        .add(HtmlTree.DIV(HtmlTree.LABEL(HtmlIds.SEARCH_INPUT.name(),
+                                contents.getContent("doclet.search.for"))))
+                        .add(HtmlTree.DIV(HtmlIds.SEARCH_INPUT_CONTAINER).addUnchecked(Text.EMPTY))
+                        .add(createModuleSelector()))
+                .add(HtmlTree.DIV(HtmlIds.SEARCH_RESULT_CONTAINER).addUnchecked(Text.EMPTY))
+                .add(HtmlTree.DIV(HtmlStyles.searchLinks)
+                        .add(HtmlTree.DIV(links.createLink(pathToRoot.resolve(DocPaths.SEARCH_PAGE),
+                                        contents.getContent("doclet.search.linkSearchPageLabel"))
+                                .setId(HtmlIds.SEARCH_PAGE_LINK)))
+                        .add(options.noHelp() || !options.helpFile().isEmpty()
+                                ? HtmlTree.DIV(Text.EMPTY).addUnchecked(Text.EMPTY)
+                                : HtmlTree.DIV(links.createLink(pathToRoot.resolve(DocPaths.HELP_DOC).fragment("search"),
+                                    contents.getContent("doclet.search.linkSearchHelpLabel"))))));
+    }
+
+    private Content createModuleSelector() {
+        if (!configuration.showModules || configuration.modules.size() < 2) {
+            return Text.EMPTY;
+        }
+        var content = new ContentBuilder(HtmlTree.DIV(HtmlTree.LABEL(HtmlIds.SEARCH_MODULES.name(),
+                contents.getContent("doclet.search.in_modules"))));
+        var select = HtmlTree.of(HtmlTag.SELECT)
+                .setId(HtmlIds.SEARCH_MODULES)
+                .put(HtmlAttr.ARIA_LABEL, configuration.getDocResources().getText("doclet.selectModule"))
+                .add(HtmlTree.of(HtmlTag.OPTION)
+                        .put(HtmlAttr.VALUE, "")
+                        .add(contents.getContent("doclet.search.all_modules")));
+
+        for (ModuleElement module : configuration.modules) {
+            select.add(HtmlTree.of(HtmlTag.OPTION)
+                    .put(HtmlAttr.VALUE, module.getQualifiedName().toString())
+                    .add(Text.of(module.getQualifiedName().toString())));
+        }
+        return content.add(HtmlTree.DIV(select));
     }
 
     /**
diff --git a/src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclets/formats/html/SearchWriter.java b/src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclets/formats/html/SearchWriter.java
index 433a641530d..5fa0daacf98 100644
--- a/src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclets/formats/html/SearchWriter.java
+++ b/src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclets/formats/html/SearchWriter.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2022, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2022, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -92,17 +92,15 @@ public class SearchWriter extends HtmlDocletWriter {
                 .add(resourceSection)
                 .add(HtmlTree.P(contents.getContent("doclet.search.loading"))
                         .setId(HtmlId.of("page-search-notify")))
-                .add(HtmlTree.DIV(HtmlTree.DIV(HtmlId.of("result-container"))
+                .add(HtmlTree.DIV(HtmlTree.DIV(HtmlIds.SEARCH_RESULT_CONTAINER)
                                 .addUnchecked(Text.EMPTY))
-                        .setId(HtmlId.of("result-section"))
-                        .put(HtmlAttr.STYLE, "display: none;")
-                        .add(HtmlTree.SCRIPT(pathToRoot.resolve(DocPaths.SCRIPT_FILES)
-                                                       .resolve(DocPaths.SEARCH_PAGE_JS).getPath())));
+                        .setId(HtmlIds.SEARCH_RESULT_SECTION)
+                        .put(HtmlAttr.STYLE, "display: none;"));
     }
 
     private Content createModuleSelector() {
 
-        if (!configuration.showModules) {
+        if (!configuration.showModules || configuration.modules.size() < 2) {
             return Text.EMPTY;
         }
 
@@ -118,7 +116,7 @@ public class SearchWriter extends HtmlDocletWriter {
                     .put(HtmlAttr.VALUE, module.getQualifiedName().toString())
                     .add(Text.of(module.getQualifiedName().toString())));
         }
-        return new ContentBuilder(contents.getContent("doclet.search.in", select));
+        return new ContentBuilder(contents.getContent("doclet.search.in_modules"), select);
     }
 
     private Content createResourceSection() {
diff --git a/src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclets/formats/html/markup/Head.java b/src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclets/formats/html/markup/Head.java
index cda4bc9a5be..bff32cbd7bf 100644
--- a/src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclets/formats/html/markup/Head.java
+++ b/src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclets/formats/html/markup/Head.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -336,11 +336,6 @@ public class Head extends Content {
     }
 
     private void addStylesheets(HtmlTree head) {
-        if (index) {
-            // Add JQuery-UI stylesheet first so its rules can be overridden.
-            addStylesheet(head, DocPaths.RESOURCE_FILES.resolve(DocPaths.JQUERY_UI_CSS));
-        }
-
         if (mainStylesheet == null) {
             mainStylesheet = DocPaths.STYLESHEET;
         }
@@ -381,8 +376,6 @@ public class Head extends Content {
                         .append("loadScripts();\n")
                         .append("initTheme();\n");
             }
-            addScriptElement(head, DocPaths.JQUERY_JS);
-            addScriptElement(head, DocPaths.JQUERY_UI_JS);
         }
         for (HtmlConfiguration.JavaScriptFile javaScriptFile : additionalScripts) {
             addScriptElement(head, javaScriptFile);
diff --git a/src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclets/formats/html/markup/HtmlStyles.java b/src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclets/formats/html/markup/HtmlStyles.java
index 9b59cb0cb47..2b154db7de7 100644
--- a/src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclets/formats/html/markup/HtmlStyles.java
+++ b/src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclets/formats/html/markup/HtmlStyles.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2010, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2010, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -734,6 +734,16 @@ public enum HtmlStyles implements HtmlStyle {
      */
     pageSearchInfo,
 
+    /**
+     * The class for a {@code div} element in the search widget containing the search form inputs.
+     */
+    searchForm,
+
+    /**
+     * The class for a {@code div} element in the search widget containing search-related links.
+     */
+    searchLinks,
+
     /**
      * The class for a link in the static "Index" pages to a custom searchable item,
      * such as defined with an {@code @index} tag.
diff --git a/src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclets/formats/html/resources/jquery/jquery-3.7.1.js b/src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclets/formats/html/resources/jquery/jquery-3.7.1.js
deleted file mode 100644
index 1a86433c223..00000000000
--- a/src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclets/formats/html/resources/jquery/jquery-3.7.1.js
+++ /dev/null
@@ -1,10716 +0,0 @@
-/*!
- * jQuery JavaScript Library v3.7.1
- * https://jquery.com/
- *
- * Copyright OpenJS Foundation and other contributors
- * Released under the MIT license
- * https://jquery.org/license
- *
- * Date: 2023-08-28T13:37Z
- */
-( function( global, factory ) {
-
-	"use strict";
-
-	if ( typeof module === "object" && typeof module.exports === "object" ) {
-
-		// For CommonJS and CommonJS-like environments where a proper `window`
-		// is present, execute the factory and get jQuery.
-		// For environments that do not have a `window` with a `document`
-		// (such as Node.js), expose a factory as module.exports.
-		// This accentuates the need for the creation of a real `window`.
-		// e.g. var jQuery = require("jquery")(window);
-		// See ticket trac-14549 for more info.
-		module.exports = global.document ?
-			factory( global, true ) :
-			function( w ) {
-				if ( !w.document ) {
-					throw new Error( "jQuery requires a window with a document" );
-				}
-				return factory( w );
-			};
-	} else {
-		factory( global );
-	}
-
-// Pass this if window is not defined yet
-} )( typeof window !== "undefined" ? window : this, function( window, noGlobal ) {
-
-// Edge <= 12 - 13+, Firefox <=18 - 45+, IE 10 - 11, Safari 5.1 - 9+, iOS 6 - 9.1
-// throw exceptions when non-strict code (e.g., ASP.NET 4.5) accesses strict mode
-// arguments.callee.caller (trac-13335). But as of jQuery 3.0 (2016), strict mode should be common
-// enough that all such attempts are guarded in a try block.
-"use strict";
-
-var arr = [];
-
-var getProto = Object.getPrototypeOf;
-
-var slice = arr.slice;
-
-var flat = arr.flat ? function( array ) {
-	return arr.flat.call( array );
-} : function( array ) {
-	return arr.concat.apply( [], array );
-};
-
-
-var push = arr.push;
-
-var indexOf = arr.indexOf;
-
-var class2type = {};
-
-var toString = class2type.toString;
-
-var hasOwn = class2type.hasOwnProperty;
-
-var fnToString = hasOwn.toString;
-
-var ObjectFunctionString = fnToString.call( Object );
-
-var support = {};
-
-var isFunction = function isFunction( obj ) {
-
-		// Support: Chrome <=57, Firefox <=52
-		// In some browsers, typeof returns "function" for HTML <object> elements
-		// (i.e., `typeof document.createElement( "object" ) === "function"`).
-		// We don't want to classify *any* DOM node as a function.
-		// Support: QtWeb <=3.8.5, WebKit <=534.34, wkhtmltopdf tool <=0.12.5
-		// Plus for old WebKit, typeof returns "function" for HTML collections
-		// (e.g., `typeof document.getElementsByTagName("div") === "function"`). (gh-4756)
-		return typeof obj === "function" && typeof obj.nodeType !== "number" &&
-			typeof obj.item !== "function";
-	};
-
-
-var isWindow = function isWindow( obj ) {
-		return obj != null && obj === obj.window;
-	};
-
-
-var document = window.document;
-
-
-
-	var preservedScriptAttributes = {
-		type: true,
-		src: true,
-		nonce: true,
-		noModule: true
-	};
-
-	function DOMEval( code, node, doc ) {
-		doc = doc || document;
-
-		var i, val,
-			script = doc.createElement( "script" );
-
-		script.text = code;
-		if ( node ) {
-			for ( i in preservedScriptAttributes ) {
-
-				// Support: Firefox 64+, Edge 18+
-				// Some browsers don't support the "nonce" property on scripts.
-				// On the other hand, just using `getAttribute` is not enough as
-				// the `nonce` attribute is reset to an empty string whenever it
-				// becomes browsing-context connected.
-				// See https://github.com/whatwg/html/issues/2369
-				// See https://html.spec.whatwg.org/#nonce-attributes
-				// The `node.getAttribute` check was added for the sake of
-				// `jQuery.globalEval` so that it can fake a nonce-containing node
-				// via an object.
-				val = node[ i ] || node.getAttribute && node.getAttribute( i );
-				if ( val ) {
-					script.setAttribute( i, val );
-				}
-			}
-		}
-		doc.head.appendChild( script ).parentNode.removeChild( script );
-	}
-
-
-function toType( obj ) {
-	if ( obj == null ) {
-		return obj + "";
-	}
-
-	// Support: Android <=2.3 only (functionish RegExp)
-	return typeof obj === "object" || typeof obj === "function" ?
-		class2type[ toString.call( obj ) ] || "object" :
-		typeof obj;
-}
-/* global Symbol */
-// Defining this global in .eslintrc.json would create a danger of using the global
-// unguarded in another place, it seems safer to define global only for this module
-
-
-
-var version = "3.7.1",
-
-	rhtmlSuffix = /HTML$/i,
-
-	// Define a local copy of jQuery
-	jQuery = function( selector, context ) {
-
-		// The jQuery object is actually just the init constructor 'enhanced'
-		// Need init if jQuery is called (just allow error to be thrown if not included)
-		return new jQuery.fn.init( selector, context );
-	};
-
-jQuery.fn = jQuery.prototype = {
-
-	// The current version of jQuery being used
-	jquery: version,
-
-	constructor: jQuery,
-
-	// The default length of a jQuery object is 0
-	length: 0,
-
-	toArray: function() {
-		return slice.call( this );
-	},
-
-	// Get the Nth element in the matched element set OR
-	// Get the whole matched element set as a clean array
-	get: function( num ) {
-
-		// Return all the elements in a clean array
-		if ( num == null ) {
-			return slice.call( this );
-		}
-
-		// Return just the one element from the set
-		return num < 0 ? this[ num + this.length ] : this[ num ];
-	},
-
-	// Take an array of elements and push it onto the stack
-	// (returning the new matched element set)
-	pushStack: function( elems ) {
-
-		// Build a new jQuery matched element set
-		var ret = jQuery.merge( this.constructor(), elems );
-
-		// Add the old object onto the stack (as a reference)
-		ret.prevObject = this;
-
-		// Return the newly-formed element set
-		return ret;
-	},
-
-	// Execute a callback for every element in the matched set.
-	each: function( callback ) {
-		return jQuery.each( this, callback );
-	},
-
-	map: function( callback ) {
-		return this.pushStack( jQuery.map( this, function( elem, i ) {
-			return callback.call( elem, i, elem );
-		} ) );
-	},
-
-	slice: function() {
-		return this.pushStack( slice.apply( this, arguments ) );
-	},
-
-	first: function() {
-		return this.eq( 0 );
-	},
-
-	last: function() {
-		return this.eq( -1 );
-	},
-
-	even: function() {
-		return this.pushStack( jQuery.grep( this, function( _elem, i ) {
-			return ( i + 1 ) % 2;
-		} ) );
-	},
-
-	odd: function() {
-		return this.pushStack( jQuery.grep( this, function( _elem, i ) {
-			return i % 2;
-		} ) );
-	},
-
-	eq: function( i ) {
-		var len = this.length,
-			j = +i + ( i < 0 ? len : 0 );
-		return this.pushStack( j >= 0 && j < len ? [ this[ j ] ] : [] );
-	},
-
-	end: function() {
-		return this.prevObject || this.constructor();
-	},
-
-	// For internal use only.
-	// Behaves like an Array's method, not like a jQuery method.
-	push: push,
-	sort: arr.sort,
-	splice: arr.splice
-};
-
-jQuery.extend = jQuery.fn.extend = function() {
-	var options, name, src, copy, copyIsArray, clone,
-		target = arguments[ 0 ] || {},
-		i = 1,
-		length = arguments.length,
-		deep = false;
-
-	// Handle a deep copy situation
-	if ( typeof target === "boolean" ) {
-		deep = target;
-
-		// Skip the boolean and the target
-		target = arguments[ i ] || {};
-		i++;
-	}
-
-	// Handle case when target is a string or something (possible in deep copy)
-	if ( typeof target !== "object" && !isFunction( target ) ) {
-		target = {};
-	}
-
-	// Extend jQuery itself if only one argument is passed
-	if ( i === length ) {
-		target = this;
-		i--;
-	}
-
-	for ( ; i < length; i++ ) {
-
-		// Only deal with non-null/undefined values
-		if ( ( options = arguments[ i ] ) != null ) {
-
-			// Extend the base object
-			for ( name in options ) {
-				copy = options[ name ];
-
-				// Prevent Object.prototype pollution
-				// Prevent never-ending loop
-				if ( name === "__proto__" || target === copy ) {
-					continue;
-				}
-
-				// Recurse if we're merging plain objects or arrays
-				if ( deep && copy && ( jQuery.isPlainObject( copy ) ||
-					( copyIsArray = Array.isArray( copy ) ) ) ) {
-					src = target[ name ];
-
-					// Ensure proper type for the source value
-					if ( copyIsArray && !Array.isArray( src ) ) {
-						clone = [];
-					} else if ( !copyIsArray && !jQuery.isPlainObject( src ) ) {
-						clone = {};
-					} else {
-						clone = src;
-					}
-					copyIsArray = false;
-
-					// Never move original objects, clone them
-					target[ name ] = jQuery.extend( deep, clone, copy );
-
-				// Don't bring in undefined values
-				} else if ( copy !== undefined ) {
-					target[ name ] = copy;
-				}
-			}
-		}
-	}
-
-	// Return the modified object
-	return target;
-};
-
-jQuery.extend( {
-
-	// Unique for each copy of jQuery on the page
-	expando: "jQuery" + ( version + Math.random() ).replace( /\D/g, "" ),
-
-	// Assume jQuery is ready without the ready module
-	isReady: true,
-
-	error: function( msg ) {
-		throw new Error( msg );
-	},
-
-	noop: function() {},
-
-	isPlainObject: function( obj ) {
-		var proto, Ctor;
-
-		// Detect obvious negatives
-		// Use toString instead of jQuery.type to catch host objects
-		if ( !obj || toString.call( obj ) !== "[object Object]" ) {
-			return false;
-		}
-
-		proto = getProto( obj );
-
-		// Objects with no prototype (e.g., `Object.create( null )`) are plain
-		if ( !proto ) {
-			return true;
-		}
-
-		// Objects with prototype are plain iff they were constructed by a global Object function
-		Ctor = hasOwn.call( proto, "constructor" ) && proto.constructor;
-		return typeof Ctor === "function" && fnToString.call( Ctor ) === ObjectFunctionString;
-	},
-
-	isEmptyObject: function( obj ) {
-		var name;
-
-		for ( name in obj ) {
-			return false;
-		}
-		return true;
-	},
-
-	// Evaluates a script in a provided context; falls back to the global one
-	// if not specified.
-	globalEval: function( code, options, doc ) {
-		DOMEval( code, { nonce: options && options.nonce }, doc );
-	},
-
-	each: function( obj, callback ) {
-		var length, i = 0;
-
-		if ( isArrayLike( obj ) ) {
-			length = obj.length;
-			for ( ; i < length; i++ ) {
-				if ( callback.call( obj[ i ], i, obj[ i ] ) === false ) {
-					break;
-				}
-			}
-		} else {
-			for ( i in obj ) {
-				if ( callback.call( obj[ i ], i, obj[ i ] ) === false ) {
-					break;
-				}
-			}
-		}
-
-		return obj;
-	},
-
-
-	// Retrieve the text value of an array of DOM nodes
-	text: function( elem ) {
-		var node,
-			ret = "",
-			i = 0,
-			nodeType = elem.nodeType;
-
-		if ( !nodeType ) {
-
-			// If no nodeType, this is expected to be an array
-			while ( ( node = elem[ i++ ] ) ) {
-
-				// Do not traverse comment nodes
-				ret += jQuery.text( node );
-			}
-		}
-		if ( nodeType === 1 || nodeType === 11 ) {
-			return elem.textContent;
-		}
-		if ( nodeType === 9 ) {
-			return elem.documentElement.textContent;
-		}
-		if ( nodeType === 3 || nodeType === 4 ) {
-			return elem.nodeValue;
-		}
-
-		// Do not include comment or processing instruction nodes
-
-		return ret;
-	},
-
-	// results is for internal usage only
-	makeArray: function( arr, results ) {
-		var ret = results || [];
-
-		if ( arr != null ) {
-			if ( isArrayLike( Object( arr ) ) ) {
-				jQuery.merge( ret,
-					typeof arr === "string" ?
-						[ arr ] : arr
-				);
-			} else {
-				push.call( ret, arr );
-			}
-		}
-
-		return ret;
-	},
-
-	inArray: function( elem, arr, i ) {
-		return arr == null ? -1 : indexOf.call( arr, elem, i );
-	},
-
-	isXMLDoc: function( elem ) {
-		var namespace = elem && elem.namespaceURI,
-			docElem = elem && ( elem.ownerDocument || elem ).documentElement;
-
-		// Assume HTML when documentElement doesn't yet exist, such as inside
-		// document fragments.
-		return !rhtmlSuffix.test( namespace || docElem && docElem.nodeName || "HTML" );
-	},
-
-	// Support: Android <=4.0 only, PhantomJS 1 only
-	// push.apply(_, arraylike) throws on ancient WebKit
-	merge: function( first, second ) {
-		var len = +second.length,
-			j = 0,
-			i = first.length;
-
-		for ( ; j < len; j++ ) {
-			first[ i++ ] = second[ j ];
-		}
-
-		first.length = i;
-
-		return first;
-	},
-
-	grep: function( elems, callback, invert ) {
-		var callbackInverse,
-			matches = [],
-			i = 0,
-			length = elems.length,
-			callbackExpect = !invert;
-
-		// Go through the array, only saving the items
-		// that pass the validator function
-		for ( ; i < length; i++ ) {
-			callbackInverse = !callback( elems[ i ], i );
-			if ( callbackInverse !== callbackExpect ) {
-				matches.push( elems[ i ] );
-			}
-		}
-
-		return matches;
-	},
-
-	// arg is for internal usage only
-	map: function( elems, callback, arg ) {
-		var length, value,
-			i = 0,
-			ret = [];
-
-		// Go through the array, translating each of the items to their new values
-		if ( isArrayLike( elems ) ) {
-			length = elems.length;
-			for ( ; i < length; i++ ) {
-				value = callback( elems[ i ], i, arg );
-
-				if ( value != null ) {
-					ret.push( value );
-				}
-			}
-
-		// Go through every key on the object,
-		} else {
-			for ( i in elems ) {
-				value = callback( elems[ i ], i, arg );
-
-				if ( value != null ) {
-					ret.push( value );
-				}
-			}
-		}
-
-		// Flatten any nested arrays
-		return flat( ret );
-	},
-
-	// A global GUID counter for objects
-	guid: 1,
-
-	// jQuery.support is not used in Core but other projects attach their
-	// properties to it so it needs to exist.
-	support: support
-} );
-
-if ( typeof Symbol === "function" ) {
-	jQuery.fn[ Symbol.iterator ] = arr[ Symbol.iterator ];
-}
-
-// Populate the class2type map
-jQuery.each( "Boolean Number String Function Array Date RegExp Object Error Symbol".split( " " ),
-	function( _i, name ) {
-		class2type[ "[object " + name + "]" ] = name.toLowerCase();
-	} );
-
-function isArrayLike( obj ) {
-
-	// Support: real iOS 8.2 only (not reproducible in simulator)
-	// `in` check used to prevent JIT error (gh-2145)
-	// hasOwn isn't used here due to false negatives
-	// regarding Nodelist length in IE
-	var length = !!obj && "length" in obj && obj.length,
-		type = toType( obj );
-
-	if ( isFunction( obj ) || isWindow( obj ) ) {
-		return false;
-	}
-
-	return type === "array" || length === 0 ||
-		typeof length === "number" && length > 0 && ( length - 1 ) in obj;
-}
-
-
-function nodeName( elem, name ) {
-
-	return elem.nodeName && elem.nodeName.toLowerCase() === name.toLowerCase();
-
-}
-var pop = arr.pop;
-
-
-var sort = arr.sort;
-
-
-var splice = arr.splice;
-
-
-var whitespace = "[\\x20\\t\\r\\n\\f]";
-
-
-var rtrimCSS = new RegExp(
-	"^" + whitespace + "+|((?:^|[^\\\\])(?:\\\\.)*)" + whitespace + "+$",
-	"g"
-);
-
-
-
-
-// Note: an element does not contain itself
-jQuery.contains = function( a, b ) {
-	var bup = b && b.parentNode;
-
-	return a === bup || !!( bup && bup.nodeType === 1 && (
-
-		// Support: IE 9 - 11+
-		// IE doesn't have `contains` on SVG.
-		a.contains ?
-			a.contains( bup ) :
-			a.compareDocumentPosition && a.compareDocumentPosition( bup ) & 16
-	) );
-};
-
-
-
-
-// CSS string/identifier serialization
-// https://drafts.csswg.org/cssom/#common-serializing-idioms
-var rcssescape = /([\0-\x1f\x7f]|^-?\d)|^-$|[^\x80-\uFFFF\w-]/g;
-
-function fcssescape( ch, asCodePoint ) {
-	if ( asCodePoint ) {
-
-		// U+0000 NULL becomes U+FFFD REPLACEMENT CHARACTER
-		if ( ch === "\0" ) {
-			return "\uFFFD";
-		}
-
-		// Control characters and (dependent upon position) numbers get escaped as code points
-		return ch.slice( 0, -1 ) + "\\" + ch.charCodeAt( ch.length - 1 ).toString( 16 ) + " ";
-	}
-
-	// Other potentially-special ASCII characters get backslash-escaped
-	return "\\" + ch;
-}
-
-jQuery.escapeSelector = function( sel ) {
-	return ( sel + "" ).replace( rcssescape, fcssescape );
-};
-
-
-
-
-var preferredDoc = document,
-	pushNative = push;
-
-( function() {
-
-var i,
-	Expr,
-	outermostContext,
-	sortInput,
-	hasDuplicate,
-	push = pushNative,
-
-	// Local document vars
-	document,
-	documentElement,
-	documentIsHTML,
-	rbuggyQSA,
-	matches,
-
-	// Instance-specific data
-	expando = jQuery.expando,
-	dirruns = 0,
-	done = 0,
-	classCache = createCache(),
-	tokenCache = createCache(),
-	compilerCache = createCache(),
-	nonnativeSelectorCache = createCache(),
-	sortOrder = function( a, b ) {
-		if ( a === b ) {
-			hasDuplicate = true;
-		}
-		return 0;
-	},
-
-	booleans = "checked|selected|async|autofocus|autoplay|controls|defer|disabled|hidden|ismap|" +
-		"loop|multiple|open|readonly|required|scoped",
-
-	// Regular expressions
-
-	// https://www.w3.org/TR/css-syntax-3/#ident-token-diagram
-	identifier = "(?:\\\\[\\da-fA-F]{1,6}" + whitespace +
-		"?|\\\\[^\\r\\n\\f]|[\\w-]|[^\0-\\x7f])+",
-
-	// Attribute selectors: https://www.w3.org/TR/selectors/#attribute-selectors
-	attributes = "\\[" + whitespace + "*(" + identifier + ")(?:" + whitespace +
-
-		// Operator (capture 2)
-		"*([*^$|!~]?=)" + whitespace +
-
-		// "Attribute values must be CSS identifiers [capture 5] or strings [capture 3 or capture 4]"
-		"*(?:'((?:\\\\.|[^\\\\'])*)'|\"((?:\\\\.|[^\\\\\"])*)\"|(" + identifier + "))|)" +
-		whitespace + "*\\]",
-
-	pseudos = ":(" + identifier + ")(?:\\((" +
-
-		// To reduce the number of selectors needing tokenize in the preFilter, prefer arguments:
-		// 1. quoted (capture 3; capture 4 or capture 5)
-		"('((?:\\\\.|[^\\\\'])*)'|\"((?:\\\\.|[^\\\\\"])*)\")|" +
-
-		// 2. simple (capture 6)
-		"((?:\\\\.|[^\\\\()[\\]]|" + attributes + ")*)|" +
-
-		// 3. anything else (capture 2)
-		".*" +
-		")\\)|)",
-
-	// Leading and non-escaped trailing whitespace, capturing some non-whitespace characters preceding the latter
-	rwhitespace = new RegExp( whitespace + "+", "g" ),
-
-	rcomma = new RegExp( "^" + whitespace + "*," + whitespace + "*" ),
-	rleadingCombinator = new RegExp( "^" + whitespace + "*([>+~]|" + whitespace + ")" +
-		whitespace + "*" ),
-	rdescend = new RegExp( whitespace + "|>" ),
-
-	rpseudo = new RegExp( pseudos ),
-	ridentifier = new RegExp( "^" + identifier + "$" ),
-
-	matchExpr = {
-		ID: new RegExp( "^#(" + identifier + ")" ),
-		CLASS: new RegExp( "^\\.(" + identifier + ")" ),
-		TAG: new RegExp( "^(" + identifier + "|[*])" ),
-		ATTR: new RegExp( "^" + attributes ),
-		PSEUDO: new RegExp( "^" + pseudos ),
-		CHILD: new RegExp(
-			"^:(only|first|last|nth|nth-last)-(child|of-type)(?:\\(" +
-				whitespace + "*(even|odd|(([+-]|)(\\d*)n|)" + whitespace + "*(?:([+-]|)" +
-				whitespace + "*(\\d+)|))" + whitespace + "*\\)|)", "i" ),
-		bool: new RegExp( "^(?:" + booleans + ")$", "i" ),
-
-		// For use in libraries implementing .is()
-		// We use this for POS matching in `select`
-		needsContext: new RegExp( "^" + whitespace +
-			"*[>+~]|:(even|odd|eq|gt|lt|nth|first|last)(?:\\(" + whitespace +
-			"*((?:-\\d)?\\d*)" + whitespace + "*\\)|)(?=[^-]|$)", "i" )
-	},
-
-	rinputs = /^(?:input|select|textarea|button)$/i,
-	rheader = /^h\d$/i,
-
-	// Easily-parseable/retrievable ID or TAG or CLASS selectors
-	rquickExpr = /^(?:#([\w-]+)|(\w+)|\.([\w-]+))$/,
-
-	rsibling = /[+~]/,
-
-	// CSS escapes
-	// https://www.w3.org/TR/CSS21/syndata.html#escaped-characters
-	runescape = new RegExp( "\\\\[\\da-fA-F]{1,6}" + whitespace +
-		"?|\\\\([^\\r\\n\\f])", "g" ),
-	funescape = function( escape, nonHex ) {
-		var high = "0x" + escape.slice( 1 ) - 0x10000;
-
-		if ( nonHex ) {
-
-			// Strip the backslash prefix from a non-hex escape sequence
-			return nonHex;
-		}
-
-		// Replace a hexadecimal escape sequence with the encoded Unicode code point
-		// Support: IE <=11+
-		// For values outside the Basic Multilingual Plane (BMP), manually construct a
-		// surrogate pair
-		return high < 0 ?
-			String.fromCharCode( high + 0x10000 ) :
-			String.fromCharCode( high >> 10 | 0xD800, high & 0x3FF | 0xDC00 );
-	},
-
-	// Used for iframes; see `setDocument`.
-	// Support: IE 9 - 11+, Edge 12 - 18+
-	// Removing the function wrapper causes a "Permission Denied"
-	// error in IE/Edge.
-	unloadHandler = function() {
-		setDocument();
-	},
-
-	inDisabledFieldset = addCombinator(
-		function( elem ) {
-			return elem.disabled === true && nodeName( elem, "fieldset" );
-		},
-		{ dir: "parentNode", next: "legend" }
-	);
-
-// Support: IE <=9 only
-// Accessing document.activeElement can throw unexpectedly
-// https://bugs.jquery.com/ticket/13393
-function safeActiveElement() {
-	try {
-		return document.activeElement;
-	} catch ( err ) { }
-}
-
-// Optimize for push.apply( _, NodeList )
-try {
-	push.apply(
-		( arr = slice.call( preferredDoc.childNodes ) ),
-		preferredDoc.childNodes
-	);
-
-	// Support: Android <=4.0
-	// Detect silently failing push.apply
-	// eslint-disable-next-line no-unused-expressions
-	arr[ preferredDoc.childNodes.length ].nodeType;
-} catch ( e ) {
-	push = {
-		apply: function( target, els ) {
-			pushNative.apply( target, slice.call( els ) );
-		},
-		call: function( target ) {
-			pushNative.apply( target, slice.call( arguments, 1 ) );
-		}
-	};
-}
-
-function find( selector, context, results, seed ) {
-	var m, i, elem, nid, match, groups, newSelector,
-		newContext = context && context.ownerDocument,
-
-		// nodeType defaults to 9, since context defaults to document
-		nodeType = context ? context.nodeType : 9;
-
-	results = results || [];
-
-	// Return early from calls with invalid selector or context
-	if ( typeof selector !== "string" || !selector ||
-		nodeType !== 1 && nodeType !== 9 && nodeType !== 11 ) {
-
-		return results;
-	}
-
-	// Try to shortcut find operations (as opposed to filters) in HTML documents
-	if ( !seed ) {
-		setDocument( context );
-		context = context || document;
-
-		if ( documentIsHTML ) {
-
-			// If the selector is sufficiently simple, try using a "get*By*" DOM method
-			// (excepting DocumentFragment context, where the methods don't exist)
-			if ( nodeType !== 11 && ( match = rquickExpr.exec( selector ) ) ) {
-
-				// ID selector
-				if ( ( m = match[ 1 ] ) ) {
-
-					// Document context
-					if ( nodeType === 9 ) {
-						if ( ( elem = context.getElementById( m ) ) ) {
-
-							// Support: IE 9 only
-							// getElementById can match elements by name instead of ID
-							if ( elem.id === m ) {
-								push.call( results, elem );
-								return results;
-							}
-						} else {
-							return results;
-						}
-
-					// Element context
-					} else {
-
-						// Support: IE 9 only
-						// getElementById can match elements by name instead of ID
-						if ( newContext && ( elem = newContext.getElementById( m ) ) &&
-							find.contains( context, elem ) &&
-							elem.id === m ) {
-
-							push.call( results, elem );
-							return results;
-						}
-					}
-
-				// Type selector
-				} else if ( match[ 2 ] ) {
-					push.apply( results, context.getElementsByTagName( selector ) );
-					return results;
-
-				// Class selector
-				} else if ( ( m = match[ 3 ] ) && context.getElementsByClassName ) {
-					push.apply( results, context.getElementsByClassName( m ) );
-					return results;
-				}
-			}
-
-			// Take advantage of querySelectorAll
-			if ( !nonnativeSelectorCache[ selector + " " ] &&
-				( !rbuggyQSA || !rbuggyQSA.test( selector ) ) ) {
-
-				newSelector = selector;
-				newContext = context;
-
-				// qSA considers elements outside a scoping root when evaluating child or
-				// descendant combinators, which is not what we want.
-				// In such cases, we work around the behavior by prefixing every selector in the
-				// list with an ID selector referencing the scope context.
-				// The technique has to be used as well when a leading combinator is used
-				// as such selectors are not recognized by querySelectorAll.
-				// Thanks to Andrew Dupont for this technique.
-				if ( nodeType === 1 &&
-					( rdescend.test( selector ) || rleadingCombinator.test( selector ) ) ) {
-
-					// Expand context for sibling selectors
-					newContext = rsibling.test( selector ) && testContext( context.parentNode ) ||
-						context;
-
-					// We can use :scope instead of the ID hack if the browser
-					// supports it & if we're not changing the context.
-					// Support: IE 11+, Edge 17 - 18+
-					// IE/Edge sometimes throw a "Permission denied" error when
-					// strict-comparing two documents; shallow comparisons work.
-					// eslint-disable-next-line eqeqeq
-					if ( newContext != context || !support.scope ) {
-
-						// Capture the context ID, setting it first if necessary
-						if ( ( nid = context.getAttribute( "id" ) ) ) {
-							nid = jQuery.escapeSelector( nid );
-						} else {
-							context.setAttribute( "id", ( nid = expando ) );
-						}
-					}
-
-					// Prefix every selector in the list
-					groups = tokenize( selector );
-					i = groups.length;
-					while ( i-- ) {
-						groups[ i ] = ( nid ? "#" + nid : ":scope" ) + " " +
-							toSelector( groups[ i ] );
-					}
-					newSelector = groups.join( "," );
-				}
-
-				try {
-					push.apply( results,
-						newContext.querySelectorAll( newSelector )
-					);
-					return results;
-				} catch ( qsaError ) {
-					nonnativeSelectorCache( selector, true );
-				} finally {
-					if ( nid === expando ) {
-						context.removeAttribute( "id" );
-					}
-				}
-			}
-		}
-	}
-
-	// All others
-	return select( selector.replace( rtrimCSS, "$1" ), context, results, seed );
-}
-
-/**
- * Create key-value caches of limited size
- * @returns {function(string, object)} Returns the Object data after storing it on itself with
- *	property name the (space-suffixed) string and (if the cache is larger than Expr.cacheLength)
- *	deleting the oldest entry
- */
-function createCache() {
-	var keys = [];
-
-	function cache( key, value ) {
-
-		// Use (key + " ") to avoid collision with native prototype properties
-		// (see https://github.com/jquery/sizzle/issues/157)
-		if ( keys.push( key + " " ) > Expr.cacheLength ) {
-
-			// Only keep the most recent entries
-			delete cache[ keys.shift() ];
-		}
-		return ( cache[ key + " " ] = value );
-	}
-	return cache;
-}
-
-/**
- * Mark a function for special use by jQuery selector module
- * @param {Function} fn The function to mark
- */
-function markFunction( fn ) {
-	fn[ expando ] = true;
-	return fn;
-}
-
-/**
- * Support testing using an element
- * @param {Function} fn Passed the created element and returns a boolean result
- */
-function assert( fn ) {
-	var el = document.createElement( "fieldset" );
-
-	try {
-		return !!fn( el );
-	} catch ( e ) {
-		return false;
-	} finally {
-
-		// Remove from its parent by default
-		if ( el.parentNode ) {
-			el.parentNode.removeChild( el );
-		}
-
-		// release memory in IE
-		el = null;
-	}
-}
-
-/**
- * Returns a function to use in pseudos for input types
- * @param {String} type
- */
-function createInputPseudo( type ) {
-	return function( elem ) {
-		return nodeName( elem, "input" ) && elem.type === type;
-	};
-}
-
-/**
- * Returns a function to use in pseudos for buttons
- * @param {String} type
- */
-function createButtonPseudo( type ) {
-	return function( elem ) {
-		return ( nodeName( elem, "input" ) || nodeName( elem, "button" ) ) &&
-			elem.type === type;
-	};
-}
-
-/**
- * Returns a function to use in pseudos for :enabled/:disabled
- * @param {Boolean} disabled true for :disabled; false for :enabled
- */
-function createDisabledPseudo( disabled ) {
-
-	// Known :disabled false positives: fieldset[disabled] > legend:nth-of-type(n+2) :can-disable
-	return function( elem ) {
-
-		// Only certain elements can match :enabled or :disabled
-		// https://html.spec.whatwg.org/multipage/scripting.html#selector-enabled
-		// https://html.spec.whatwg.org/multipage/scripting.html#selector-disabled
-		if ( "form" in elem ) {
-
-			// Check for inherited disabledness on relevant non-disabled elements:
-			// * listed form-associated elements in a disabled fieldset
-			//   https://html.spec.whatwg.org/multipage/forms.html#category-listed
-			//   https://html.spec.whatwg.org/multipage/forms.html#concept-fe-disabled
-			// * option elements in a disabled optgroup
-			//   https://html.spec.whatwg.org/multipage/forms.html#concept-option-disabled
-			// All such elements have a "form" property.
-			if ( elem.parentNode && elem.disabled === false ) {
-
-				// Option elements defer to a parent optgroup if present
-				if ( "label" in elem ) {
-					if ( "label" in elem.parentNode ) {
-						return elem.parentNode.disabled === disabled;
-					} else {
-						return elem.disabled === disabled;
-					}
-				}
-
-				// Support: IE 6 - 11+
-				// Use the isDisabled shortcut property to check for disabled fieldset ancestors
-				return elem.isDisabled === disabled ||
-
-					// Where there is no isDisabled, check manually
-					elem.isDisabled !== !disabled &&
-						inDisabledFieldset( elem ) === disabled;
-			}
-
-			return elem.disabled === disabled;
-
-		// Try to winnow out elements that can't be disabled before trusting the disabled property.
-		// Some victims get caught in our net (label, legend, menu, track), but it shouldn't
-		// even exist on them, let alone have a boolean value.
-		} else if ( "label" in elem ) {
-			return elem.disabled === disabled;
-		}
-
-		// Remaining elements are neither :enabled nor :disabled
-		return false;
-	};
-}
-
-/**
- * Returns a function to use in pseudos for positionals
- * @param {Function} fn
- */
-function createPositionalPseudo( fn ) {
-	return markFunction( function( argument ) {
-		argument = +argument;
-		return markFunction( function( seed, matches ) {
-			var j,
-				matchIndexes = fn( [], seed.length, argument ),
-				i = matchIndexes.length;
-
-			// Match elements found at the specified indexes
-			while ( i-- ) {
-				if ( seed[ ( j = matchIndexes[ i ] ) ] ) {
-					seed[ j ] = !( matches[ j ] = seed[ j ] );
-				}
-			}
-		} );
-	} );
-}
-
-/**
- * Checks a node for validity as a jQuery selector context
- * @param {Element|Object=} context
- * @returns {Element|Object|Boolean} The input node if acceptable, otherwise a falsy value
- */
-function testContext( context ) {
-	return context && typeof context.getElementsByTagName !== "undefined" && context;
-}
-
-/**
- * Sets document-related variables once based on the current document
- * @param {Element|Object} [node] An element or document object to use to set the document
- * @returns {Object} Returns the current document
- */
-function setDocument( node ) {
-	var subWindow,
-		doc = node ? node.ownerDocument || node : preferredDoc;
-
-	// Return early if doc is invalid or already selected
-	// Support: IE 11+, Edge 17 - 18+
-	// IE/Edge sometimes throw a "Permission denied" error when strict-comparing
-	// two documents; shallow comparisons work.
-	// eslint-disable-next-line eqeqeq
-	if ( doc == document || doc.nodeType !== 9 || !doc.documentElement ) {
-		return document;
-	}
-
-	// Update global variables
-	document = doc;
-	documentElement = document.documentElement;
-	documentIsHTML = !jQuery.isXMLDoc( document );
-
-	// Support: iOS 7 only, IE 9 - 11+
-	// Older browsers didn't support unprefixed `matches`.
-	matches = documentElement.matches ||
-		documentElement.webkitMatchesSelector ||
-		documentElement.msMatchesSelector;
-
-	// Support: IE 9 - 11+, Edge 12 - 18+
-	// Accessing iframe documents after unload throws "permission denied" errors
-	// (see trac-13936).
-	// Limit the fix to IE & Edge Legacy; despite Edge 15+ implementing `matches`,
-	// all IE 9+ and Edge Legacy versions implement `msMatchesSelector` as well.
-	if ( documentElement.msMatchesSelector &&
-
-		// Support: IE 11+, Edge 17 - 18+
-		// IE/Edge sometimes throw a "Permission denied" error when strict-comparing
-		// two documents; shallow comparisons work.
-		// eslint-disable-next-line eqeqeq
-		preferredDoc != document &&
-		( subWindow = document.defaultView ) && subWindow.top !== subWindow ) {
-
-		// Support: IE 9 - 11+, Edge 12 - 18+
-		subWindow.addEventListener( "unload", unloadHandler );
-	}
-
-	// Support: IE <10
-	// Check if getElementById returns elements by name
-	// The broken getElementById methods don't pick up programmatically-set names,
-	// so use a roundabout getElementsByName test
-	support.getById = assert( function( el ) {
-		documentElement.appendChild( el ).id = jQuery.expando;
-		return !document.getElementsByName ||
-			!document.getElementsByName( jQuery.expando ).length;
-	} );
-
-	// Support: IE 9 only
-	// Check to see if it's possible to do matchesSelector
-	// on a disconnected node.
-	support.disconnectedMatch = assert( function( el ) {
-		return matches.call( el, "*" );
-	} );
-
-	// Support: IE 9 - 11+, Edge 12 - 18+
-	// IE/Edge don't support the :scope pseudo-class.
-	support.scope = assert( function() {
-		return document.querySelectorAll( ":scope" );
-	} );
-
-	// Support: Chrome 105 - 111 only, Safari 15.4 - 16.3 only
-	// Make sure the `:has()` argument is parsed unforgivingly.
-	// We include `*` in the test to detect buggy implementations that are
-	// _selectively_ forgiving (specifically when the list includes at least
-	// one valid selector).
-	// Note that we treat complete lack of support for `:has()` as if it were
-	// spec-compliant support, which is fine because use of `:has()` in such
-	// environments will fail in the qSA path and fall back to jQuery traversal
-	// anyway.
-	support.cssHas = assert( function() {
-		try {
-			document.querySelector( ":has(*,:jqfake)" );
-			return false;
-		} catch ( e ) {
-			return true;
-		}
-	} );
-
-	// ID filter and find
-	if ( support.getById ) {
-		Expr.filter.ID = function( id ) {
-			var attrId = id.replace( runescape, funescape );
-			return function( elem ) {
-				return elem.getAttribute( "id" ) === attrId;
-			};
-		};
-		Expr.find.ID = function( id, context ) {
-			if ( typeof context.getElementById !== "undefined" && documentIsHTML ) {
-				var elem = context.getElementById( id );
-				return elem ? [ elem ] : [];
-			}
-		};
-	} else {
-		Expr.filter.ID =  function( id ) {
-			var attrId = id.replace( runescape, funescape );
-			return function( elem ) {
-				var node = typeof elem.getAttributeNode !== "undefined" &&
-					elem.getAttributeNode( "id" );
-				return node && node.value === attrId;
-			};
-		};
-
-		// Support: IE 6 - 7 only
-		// getElementById is not reliable as a find shortcut
-		Expr.find.ID = function( id, context ) {
-			if ( typeof context.getElementById !== "undefined" && documentIsHTML ) {
-				var node, i, elems,
-					elem = context.getElementById( id );
-
-				if ( elem ) {
-
-					// Verify the id attribute
-					node = elem.getAttributeNode( "id" );
-					if ( node && node.value === id ) {
-						return [ elem ];
-					}
-
-					// Fall back on getElementsByName
-					elems = context.getElementsByName( id );
-					i = 0;
-					while ( ( elem = elems[ i++ ] ) ) {
-						node = elem.getAttributeNode( "id" );
-						if ( node && node.value === id ) {
-							return [ elem ];
-						}
-					}
-				}
-
-				return [];
-			}
-		};
-	}
-
-	// Tag
-	Expr.find.TAG = function( tag, context ) {
-		if ( typeof context.getElementsByTagName !== "undefined" ) {
-			return context.getElementsByTagName( tag );
-
-		// DocumentFragment nodes don't have gEBTN
-		} else {
-			return context.querySelectorAll( tag );
-		}
-	};
-
-	// Class
-	Expr.find.CLASS = function( className, context ) {
-		if ( typeof context.getElementsByClassName !== "undefined" && documentIsHTML ) {
-			return context.getElementsByClassName( className );
-		}
-	};
-
-	/* QSA/matchesSelector
-	---------------------------------------------------------------------- */
-
-	// QSA and matchesSelector support
-
-	rbuggyQSA = [];
-
-	// Build QSA regex
-	// Regex strategy adopted from Diego Perini
-	assert( function( el ) {
-
-		var input;
-
-		documentElement.appendChild( el ).innerHTML =
-			"<a id='" + expando + "' href='' disabled='disabled'></a>" +
-			"<select id='" + expando + "-\r\\' disabled='disabled'>" +
-			"<option selected=''></option></select>";
-
-		// Support: iOS <=7 - 8 only
-		// Boolean attributes and "value" are not treated correctly in some XML documents
-		if ( !el.querySelectorAll( "[selected]" ).length ) {
-			rbuggyQSA.push( "\\[" + whitespace + "*(?:value|" + booleans + ")" );
-		}
-
-		// Support: iOS <=7 - 8 only
-		if ( !el.querySelectorAll( "[id~=" + expando + "-]" ).length ) {
-			rbuggyQSA.push( "~=" );
-		}
-
-		// Support: iOS 8 only
-		// https://bugs.webkit.org/show_bug.cgi?id=136851
-		// In-page `selector#id sibling-combinator selector` fails
-		if ( !el.querySelectorAll( "a#" + expando + "+*" ).length ) {
-			rbuggyQSA.push( ".#.+[+~]" );
-		}
-
-		// Support: Chrome <=105+, Firefox <=104+, Safari <=15.4+
-		// In some of the document kinds, these selectors wouldn't work natively.
-		// This is probably OK but for backwards compatibility we want to maintain
-		// handling them through jQuery traversal in jQuery 3.x.
-		if ( !el.querySelectorAll( ":checked" ).length ) {
-			rbuggyQSA.push( ":checked" );
-		}
-
-		// Support: Windows 8 Native Apps
-		// The type and name attributes are restricted during .innerHTML assignment
-		input = document.createElement( "input" );
-		input.setAttribute( "type", "hidden" );
-		el.appendChild( input ).setAttribute( "name", "D" );
-
-		// Support: IE 9 - 11+
-		// IE's :disabled selector does not pick up the children of disabled fieldsets
-		// Support: Chrome <=105+, Firefox <=104+, Safari <=15.4+
-		// In some of the document kinds, these selectors wouldn't work natively.
-		// This is probably OK but for backwards compatibility we want to maintain
-		// handling them through jQuery traversal in jQuery 3.x.
-		documentElement.appendChild( el ).disabled = true;
-		if ( el.querySelectorAll( ":disabled" ).length !== 2 ) {
-			rbuggyQSA.push( ":enabled", ":disabled" );
-		}
-
-		// Support: IE 11+, Edge 15 - 18+
-		// IE 11/Edge don't find elements on a `[name='']` query in some cases.
-		// Adding a temporary attribute to the document before the selection works
-		// around the issue.
-		// Interestingly, IE 10 & older don't seem to have the issue.
-		input = document.createElement( "input" );
-		input.setAttribute( "name", "" );
-		el.appendChild( input );
-		if ( !el.querySelectorAll( "[name='']" ).length ) {
-			rbuggyQSA.push( "\\[" + whitespace + "*name" + whitespace + "*=" +
-				whitespace + "*(?:''|\"\")" );
-		}
-	} );
-
-	if ( !support.cssHas ) {
-
-		// Support: Chrome 105 - 110+, Safari 15.4 - 16.3+
-		// Our regular `try-catch` mechanism fails to detect natively-unsupported
-		// pseudo-classes inside `:has()` (such as `:has(:contains("Foo"))`)
-		// in browsers that parse the `:has()` argument as a forgiving selector list.
-		// https://drafts.csswg.org/selectors/#relational now requires the argument
-		// to be parsed unforgivingly, but browsers have not yet fully adjusted.
-		rbuggyQSA.push( ":has" );
-	}
-
-	rbuggyQSA = rbuggyQSA.length && new RegExp( rbuggyQSA.join( "|" ) );
-
-	/* Sorting
-	---------------------------------------------------------------------- */
-
-	// Document order sorting
-	sortOrder = function( a, b ) {
-
-		// Flag for duplicate removal
-		if ( a === b ) {
-			hasDuplicate = true;
-			return 0;
-		}
-
-		// Sort on method existence if only one input has compareDocumentPosition
-		var compare = !a.compareDocumentPosition - !b.compareDocumentPosition;
-		if ( compare ) {
-			return compare;
-		}
-
-		// Calculate position if both inputs belong to the same document
-		// Support: IE 11+, Edge 17 - 18+
-		// IE/Edge sometimes throw a "Permission denied" error when strict-comparing
-		// two documents; shallow comparisons work.
-		// eslint-disable-next-line eqeqeq
-		compare = ( a.ownerDocument || a ) == ( b.ownerDocument || b ) ?
-			a.compareDocumentPosition( b ) :
-
-			// Otherwise we know they are disconnected
-			1;
-
-		// Disconnected nodes
-		if ( compare & 1 ||
-			( !support.sortDetached && b.compareDocumentPosition( a ) === compare ) ) {
-
-			// Choose the first element that is related to our preferred document
-			// Support: IE 11+, Edge 17 - 18+
-			// IE/Edge sometimes throw a "Permission denied" error when strict-comparing
-			// two documents; shallow comparisons work.
-			// eslint-disable-next-line eqeqeq
-			if ( a === document || a.ownerDocument == preferredDoc &&
-				find.contains( preferredDoc, a ) ) {
-				return -1;
-			}
-
-			// Support: IE 11+, Edge 17 - 18+
-			// IE/Edge sometimes throw a "Permission denied" error when strict-comparing
-			// two documents; shallow comparisons work.
-			// eslint-disable-next-line eqeqeq
-			if ( b === document || b.ownerDocument == preferredDoc &&
-				find.contains( preferredDoc, b ) ) {
-				return 1;
-			}
-
-			// Maintain original order
-			return sortInput ?
-				( indexOf.call( sortInput, a ) - indexOf.call( sortInput, b ) ) :
-				0;
-		}
-
-		return compare & 4 ? -1 : 1;
-	};
-
-	return document;
-}
-
-find.matches = function( expr, elements ) {
-	return find( expr, null, null, elements );
-};
-
-find.matchesSelector = function( elem, expr ) {
-	setDocument( elem );
-
-	if ( documentIsHTML &&
-		!nonnativeSelectorCache[ expr + " " ] &&
-		( !rbuggyQSA || !rbuggyQSA.test( expr ) ) ) {
-
-		try {
-			var ret = matches.call( elem, expr );
-
-			// IE 9's matchesSelector returns false on disconnected nodes
-			if ( ret || support.disconnectedMatch ||
-
-					// As well, disconnected nodes are said to be in a document
-					// fragment in IE 9
-					elem.document && elem.document.nodeType !== 11 ) {
-				return ret;
-			}
-		} catch ( e ) {
-			nonnativeSelectorCache( expr, true );
-		}
-	}
-
-	return find( expr, document, null, [ elem ] ).length > 0;
-};
-
-find.contains = function( context, elem ) {
-
-	// Set document vars if needed
-	// Support: IE 11+, Edge 17 - 18+
-	// IE/Edge sometimes throw a "Permission denied" error when strict-comparing
-	// two documents; shallow comparisons work.
-	// eslint-disable-next-line eqeqeq
-	if ( ( context.ownerDocument || context ) != document ) {
-		setDocument( context );
-	}
-	return jQuery.contains( context, elem );
-};
-
-
-find.attr = function( elem, name ) {
-
-	// Set document vars if needed
-	// Support: IE 11+, Edge 17 - 18+
-	// IE/Edge sometimes throw a "Permission denied" error when strict-comparing
-	// two documents; shallow comparisons work.
-	// eslint-disable-next-line eqeqeq
-	if ( ( elem.ownerDocument || elem ) != document ) {
-		setDocument( elem );
-	}
-
-	var fn = Expr.attrHandle[ name.toLowerCase() ],
-
-		// Don't get fooled by Object.prototype properties (see trac-13807)
-		val = fn && hasOwn.call( Expr.attrHandle, name.toLowerCase() ) ?
-			fn( elem, name, !documentIsHTML ) :
-			undefined;
-
-	if ( val !== undefined ) {
-		return val;
-	}
-
-	return elem.getAttribute( name );
-};
-
-find.error = function( msg ) {
-	throw new Error( "Syntax error, unrecognized expression: " + msg );
-};
-
-/**
- * Document sorting and removing duplicates
- * @param {ArrayLike} results
- */
-jQuery.uniqueSort = function( results ) {
-	var elem,
-		duplicates = [],
-		j = 0,
-		i = 0;
-
-	// Unless we *know* we can detect duplicates, assume their presence
-	//
-	// Support: Android <=4.0+
-	// Testing for detecting duplicates is unpredictable so instead assume we can't
-	// depend on duplicate detection in all browsers without a stable sort.
-	hasDuplicate = !support.sortStable;
-	sortInput = !support.sortStable && slice.call( results, 0 );
-	sort.call( results, sortOrder );
-
-	if ( hasDuplicate ) {
-		while ( ( elem = results[ i++ ] ) ) {
-			if ( elem === results[ i ] ) {
-				j = duplicates.push( i );
-			}
-		}
-		while ( j-- ) {
-			splice.call( results, duplicates[ j ], 1 );
-		}
-	}
-
-	// Clear input after sorting to release objects
-	// See https://github.com/jquery/sizzle/pull/225
-	sortInput = null;
-
-	return results;
-};
-
-jQuery.fn.uniqueSort = function() {
-	return this.pushStack( jQuery.uniqueSort( slice.apply( this ) ) );
-};
-
-Expr = jQuery.expr = {
-
-	// Can be adjusted by the user
-	cacheLength: 50,
-
-	createPseudo: markFunction,
-
-	match: matchExpr,
-
-	attrHandle: {},
-
-	find: {},
-
-	relative: {
-		">": { dir: "parentNode", first: true },
-		" ": { dir: "parentNode" },
-		"+": { dir: "previousSibling", first: true },
-		"~": { dir: "previousSibling" }
-	},
-
-	preFilter: {
-		ATTR: function( match ) {
-			match[ 1 ] = match[ 1 ].replace( runescape, funescape );
-
-			// Move the given value to match[3] whether quoted or unquoted
-			match[ 3 ] = ( match[ 3 ] || match[ 4 ] || match[ 5 ] || "" )
-				.replace( runescape, funescape );
-
-			if ( match[ 2 ] === "~=" ) {
-				match[ 3 ] = " " + match[ 3 ] + " ";
-			}
-
-			return match.slice( 0, 4 );
-		},
-
-		CHILD: function( match ) {
-
-			/* matches from matchExpr["CHILD"]
-				1 type (only|nth|...)
-				2 what (child|of-type)
-				3 argument (even|odd|\d*|\d*n([+-]\d+)?|...)
-				4 xn-component of xn+y argument ([+-]?\d*n|)
-				5 sign of xn-component
-				6 x of xn-component
-				7 sign of y-component
-				8 y of y-component
-			*/
-			match[ 1 ] = match[ 1 ].toLowerCase();
-
-			if ( match[ 1 ].slice( 0, 3 ) === "nth" ) {
-
-				// nth-* requires argument
-				if ( !match[ 3 ] ) {
-					find.error( match[ 0 ] );
-				}
-
-				// numeric x and y parameters for Expr.filter.CHILD
-				// remember that false/true cast respectively to 0/1
-				match[ 4 ] = +( match[ 4 ] ?
-					match[ 5 ] + ( match[ 6 ] || 1 ) :
-					2 * ( match[ 3 ] === "even" || match[ 3 ] === "odd" )
-				);
-				match[ 5 ] = +( ( match[ 7 ] + match[ 8 ] ) || match[ 3 ] === "odd" );
-
-			// other types prohibit arguments
-			} else if ( match[ 3 ] ) {
-				find.error( match[ 0 ] );
-			}
-
-			return match;
-		},
-
-		PSEUDO: function( match ) {
-			var excess,
-				unquoted = !match[ 6 ] && match[ 2 ];
-
-			if ( matchExpr.CHILD.test( match[ 0 ] ) ) {
-				return null;
-			}
-
-			// Accept quoted arguments as-is
-			if ( match[ 3 ] ) {
-				match[ 2 ] = match[ 4 ] || match[ 5 ] || "";
-
-			// Strip excess characters from unquoted arguments
-			} else if ( unquoted && rpseudo.test( unquoted ) &&
-
-				// Get excess from tokenize (recursively)
-				( excess = tokenize( unquoted, true ) ) &&
-
-				// advance to the next closing parenthesis
-				( excess = unquoted.indexOf( ")", unquoted.length - excess ) - unquoted.length ) ) {
-
-				// excess is a negative index
-				match[ 0 ] = match[ 0 ].slice( 0, excess );
-				match[ 2 ] = unquoted.slice( 0, excess );
-			}
-
-			// Return only captures needed by the pseudo filter method (type and argument)
-			return match.slice( 0, 3 );
-		}
-	},
-
-	filter: {
-
-		TAG: function( nodeNameSelector ) {
-			var expectedNodeName = nodeNameSelector.replace( runescape, funescape ).toLowerCase();
-			return nodeNameSelector === "*" ?
-				function() {
-					return true;
-				} :
-				function( elem ) {
-					return nodeName( elem, expectedNodeName );
-				};
-		},
-
-		CLASS: function( className ) {
-			var pattern = classCache[ className + " " ];
-
-			return pattern ||
-				( pattern = new RegExp( "(^|" + whitespace + ")" + className +
-					"(" + whitespace + "|$)" ) ) &&
-				classCache( className, function( elem ) {
-					return pattern.test(
-						typeof elem.className === "string" && elem.className ||
-							typeof elem.getAttribute !== "undefined" &&
-								elem.getAttribute( "class" ) ||
-							""
-					);
-				} );
-		},
-
-		ATTR: function( name, operator, check ) {
-			return function( elem ) {
-				var result = find.attr( elem, name );
-
-				if ( result == null ) {
-					return operator === "!=";
-				}
-				if ( !operator ) {
-					return true;
-				}
-
-				result += "";
-
-				if ( operator === "=" ) {
-					return result === check;
-				}
-				if ( operator === "!=" ) {
-					return result !== check;
-				}
-				if ( operator === "^=" ) {
-					return check && result.indexOf( check ) === 0;
-				}
-				if ( operator === "*=" ) {
-					return check && result.indexOf( check ) > -1;
-				}
-				if ( operator === "$=" ) {
-					return check && result.slice( -check.length ) === check;
-				}
-				if ( operator === "~=" ) {
-					return ( " " + result.replace( rwhitespace, " " ) + " " )
-						.indexOf( check ) > -1;
-				}
-				if ( operator === "|=" ) {
-					return result === check || result.slice( 0, check.length + 1 ) === check + "-";
-				}
-
-				return false;
-			};
-		},
-
-		CHILD: function( type, what, _argument, first, last ) {
-			var simple = type.slice( 0, 3 ) !== "nth",
-				forward = type.slice( -4 ) !== "last",
-				ofType = what === "of-type";
-
-			return first === 1 && last === 0 ?
-
-				// Shortcut for :nth-*(n)
-				function( elem ) {
-					return !!elem.parentNode;
-				} :
-
-				function( elem, _context, xml ) {
-					var cache, outerCache, node, nodeIndex, start,
-						dir = simple !== forward ? "nextSibling" : "previousSibling",
-						parent = elem.parentNode,
-						name = ofType && elem.nodeName.toLowerCase(),
-						useCache = !xml && !ofType,
-						diff = false;
-
-					if ( parent ) {
-
-						// :(first|last|only)-(child|of-type)
-						if ( simple ) {
-							while ( dir ) {
-								node = elem;
-								while ( ( node = node[ dir ] ) ) {
-									if ( ofType ?
-										nodeName( node, name ) :
-										node.nodeType === 1 ) {
-
-										return false;
-									}
-								}
-
-								// Reverse direction for :only-* (if we haven't yet done so)
-								start = dir = type === "only" && !start && "nextSibling";
-							}
-							return true;
-						}
-
-						start = [ forward ? parent.firstChild : parent.lastChild ];
-
-						// non-xml :nth-child(...) stores cache data on `parent`
-						if ( forward && useCache ) {
-
-							// Seek `elem` from a previously-cached index
-							outerCache = parent[ expando ] || ( parent[ expando ] = {} );
-							cache = outerCache[ type ] || [];
-							nodeIndex = cache[ 0 ] === dirruns && cache[ 1 ];
-							diff = nodeIndex && cache[ 2 ];
-							node = nodeIndex && parent.childNodes[ nodeIndex ];
-
-							while ( ( node = ++nodeIndex && node && node[ dir ] ||
-
-								// Fallback to seeking `elem` from the start
-								( diff = nodeIndex = 0 ) || start.pop() ) ) {
-
-								// When found, cache indexes on `parent` and break
-								if ( node.nodeType === 1 && ++diff && node === elem ) {
-									outerCache[ type ] = [ dirruns, nodeIndex, diff ];
-									break;
-								}
-							}
-
-						} else {
-
-							// Use previously-cached element index if available
-							if ( useCache ) {
-								outerCache = elem[ expando ] || ( elem[ expando ] = {} );
-								cache = outerCache[ type ] || [];
-								nodeIndex = cache[ 0 ] === dirruns && cache[ 1 ];
-								diff = nodeIndex;
-							}
-
-							// xml :nth-child(...)
-							// or :nth-last-child(...) or :nth(-last)?-of-type(...)
-							if ( diff === false ) {
-
-								// Use the same loop as above to seek `elem` from the start
-								while ( ( node = ++nodeIndex && node && node[ dir ] ||
-									( diff = nodeIndex = 0 ) || start.pop() ) ) {
-
-									if ( ( ofType ?
-										nodeName( node, name ) :
-										node.nodeType === 1 ) &&
-										++diff ) {
-
-										// Cache the index of each encountered element
-										if ( useCache ) {
-											outerCache = node[ expando ] ||
-												( node[ expando ] = {} );
-											outerCache[ type ] = [ dirruns, diff ];
-										}
-
-										if ( node === elem ) {
-											break;
-										}
-									}
-								}
-							}
-						}
-
-						// Incorporate the offset, then check against cycle size
-						diff -= last;
-						return diff === first || ( diff % first === 0 && diff / first >= 0 );
-					}
-				};
-		},
-
-		PSEUDO: function( pseudo, argument ) {
-
-			// pseudo-class names are case-insensitive
-			// https://www.w3.org/TR/selectors/#pseudo-classes
-			// Prioritize by case sensitivity in case custom pseudos are added with uppercase letters
-			// Remember that setFilters inherits from pseudos
-			var args,
-				fn = Expr.pseudos[ pseudo ] || Expr.setFilters[ pseudo.toLowerCase() ] ||
-					find.error( "unsupported pseudo: " + pseudo );
-
-			// The user may use createPseudo to indicate that
-			// arguments are needed to create the filter function
-			// just as jQuery does
-			if ( fn[ expando ] ) {
-				return fn( argument );
-			}
-
-			// But maintain support for old signatures
-			if ( fn.length > 1 ) {
-				args = [ pseudo, pseudo, "", argument ];
-				return Expr.setFilters.hasOwnProperty( pseudo.toLowerCase() ) ?
-					markFunction( function( seed, matches ) {
-						var idx,
-							matched = fn( seed, argument ),
-							i = matched.length;
-						while ( i-- ) {
-							idx = indexOf.call( seed, matched[ i ] );
-							seed[ idx ] = !( matches[ idx ] = matched[ i ] );
-						}
-					} ) :
-					function( elem ) {
-						return fn( elem, 0, args );
-					};
-			}
-
-			return fn;
-		}
-	},
-
-	pseudos: {
-
-		// Potentially complex pseudos
-		not: markFunction( function( selector ) {
-
-			// Trim the selector passed to compile
-			// to avoid treating leading and trailing
-			// spaces as combinators
-			var input = [],
-				results = [],
-				matcher = compile( selector.replace( rtrimCSS, "$1" ) );
-
-			return matcher[ expando ] ?
-				markFunction( function( seed, matches, _context, xml ) {
-					var elem,
-						unmatched = matcher( seed, null, xml, [] ),
-						i = seed.length;
-
-					// Match elements unmatched by `matcher`
-					while ( i-- ) {
-						if ( ( elem = unmatched[ i ] ) ) {
-							seed[ i ] = !( matches[ i ] = elem );
-						}
-					}
-				} ) :
-				function( elem, _context, xml ) {
-					input[ 0 ] = elem;
-					matcher( input, null, xml, results );
-
-					// Don't keep the element
-					// (see https://github.com/jquery/sizzle/issues/299)
-					input[ 0 ] = null;
-					return !results.pop();
-				};
-		} ),
-
-		has: markFunction( function( selector ) {
-			return function( elem ) {
-				return find( selector, elem ).length > 0;
-			};
-		} ),
-
-		contains: markFunction( function( text ) {
-			text = text.replace( runescape, funescape );
-			return function( elem ) {
-				return ( elem.textContent || jQuery.text( elem ) ).indexOf( text ) > -1;
-			};
-		} ),
-
-		// "Whether an element is represented by a :lang() selector
-		// is based solely on the element's language value
-		// being equal to the identifier C,
-		// or beginning with the identifier C immediately followed by "-".
-		// The matching of C against the element's language value is performed case-insensitively.
-		// The identifier C does not have to be a valid language name."
-		// https://www.w3.org/TR/selectors/#lang-pseudo
-		lang: markFunction( function( lang ) {
-
-			// lang value must be a valid identifier
-			if ( !ridentifier.test( lang || "" ) ) {
-				find.error( "unsupported lang: " + lang );
-			}
-			lang = lang.replace( runescape, funescape ).toLowerCase();
-			return function( elem ) {
-				var elemLang;
-				do {
-					if ( ( elemLang = documentIsHTML ?
-						elem.lang :
-						elem.getAttribute( "xml:lang" ) || elem.getAttribute( "lang" ) ) ) {
-
-						elemLang = elemLang.toLowerCase();
-						return elemLang === lang || elemLang.indexOf( lang + "-" ) === 0;
-					}
-				} while ( ( elem = elem.parentNode ) && elem.nodeType === 1 );
-				return false;
-			};
-		} ),
-
-		// Miscellaneous
-		target: function( elem ) {
-			var hash = window.location && window.location.hash;
-			return hash && hash.slice( 1 ) === elem.id;
-		},
-
-		root: function( elem ) {
-			return elem === documentElement;
-		},
-
-		focus: function( elem ) {
-			return elem === safeActiveElement() &&
-				document.hasFocus() &&
-				!!( elem.type || elem.href || ~elem.tabIndex );
-		},
-
-		// Boolean properties
-		enabled: createDisabledPseudo( false ),
-		disabled: createDisabledPseudo( true ),
-
-		checked: function( elem ) {
-
-			// In CSS3, :checked should return both checked and selected elements
-			// https://www.w3.org/TR/2011/REC-css3-selectors-20110929/#checked
-			return ( nodeName( elem, "input" ) && !!elem.checked ) ||
-				( nodeName( elem, "option" ) && !!elem.selected );
-		},
-
-		selected: function( elem ) {
-
-			// Support: IE <=11+
-			// Accessing the selectedIndex property
-			// forces the browser to treat the default option as
-			// selected when in an optgroup.
-			if ( elem.parentNode ) {
-				// eslint-disable-next-line no-unused-expressions
-				elem.parentNode.selectedIndex;
-			}
-
-			return elem.selected === true;
-		},
-
-		// Contents
-		empty: function( elem ) {
-
-			// https://www.w3.org/TR/selectors/#empty-pseudo
-			// :empty is negated by element (1) or content nodes (text: 3; cdata: 4; entity ref: 5),
-			//   but not by others (comment: 8; processing instruction: 7; etc.)
-			// nodeType < 6 works because attributes (2) do not appear as children
-			for ( elem = elem.firstChild; elem; elem = elem.nextSibling ) {
-				if ( elem.nodeType < 6 ) {
-					return false;
-				}
-			}
-			return true;
-		},
-
-		parent: function( elem ) {
-			return !Expr.pseudos.empty( elem );
-		},
-
-		// Element/input types
-		header: function( elem ) {
-			return rheader.test( elem.nodeName );
-		},
-
-		input: function( elem ) {
-			return rinputs.test( elem.nodeName );
-		},
-
-		button: function( elem ) {
-			return nodeName( elem, "input" ) && elem.type === "button" ||
-				nodeName( elem, "button" );
-		},
-
-		text: function( elem ) {
-			var attr;
-			return nodeName( elem, "input" ) && elem.type === "text" &&
-
-				// Support: IE <10 only
-				// New HTML5 attribute values (e.g., "search") appear
-				// with elem.type === "text"
-				( ( attr = elem.getAttribute( "type" ) ) == null ||
-					attr.toLowerCase() === "text" );
-		},
-
-		// Position-in-collection
-		first: createPositionalPseudo( function() {
-			return [ 0 ];
-		} ),
-
-		last: createPositionalPseudo( function( _matchIndexes, length ) {
-			return [ length - 1 ];
-		} ),
-
-		eq: createPositionalPseudo( function( _matchIndexes, length, argument ) {
-			return [ argument < 0 ? argument + length : argument ];
-		} ),
-
-		even: createPositionalPseudo( function( matchIndexes, length ) {
-			var i = 0;
-			for ( ; i < length; i += 2 ) {
-				matchIndexes.push( i );
-			}
-			return matchIndexes;
-		} ),
-
-		odd: createPositionalPseudo( function( matchIndexes, length ) {
-			var i = 1;
-			for ( ; i < length; i += 2 ) {
-				matchIndexes.push( i );
-			}
-			return matchIndexes;
-		} ),
-
-		lt: createPositionalPseudo( function( matchIndexes, length, argument ) {
-			var i;
-
-			if ( argument < 0 ) {
-				i = argument + length;
-			} else if ( argument > length ) {
-				i = length;
-			} else {
-				i = argument;
-			}
-
-			for ( ; --i >= 0; ) {
-				matchIndexes.push( i );
-			}
-			return matchIndexes;
-		} ),
-
-		gt: createPositionalPseudo( function( matchIndexes, length, argument ) {
-			var i = argument < 0 ? argument + length : argument;
-			for ( ; ++i < length; ) {
-				matchIndexes.push( i );
-			}
-			return matchIndexes;
-		} )
-	}
-};
-
-Expr.pseudos.nth = Expr.pseudos.eq;
-
-// Add button/input type pseudos
-for ( i in { radio: true, checkbox: true, file: true, password: true, image: true } ) {
-	Expr.pseudos[ i ] = createInputPseudo( i );
-}
-for ( i in { submit: true, reset: true } ) {
-	Expr.pseudos[ i ] = createButtonPseudo( i );
-}
-
-// Easy API for creating new setFilters
-function setFilters() {}
-setFilters.prototype = Expr.filters = Expr.pseudos;
-Expr.setFilters = new setFilters();
-
-function tokenize( selector, parseOnly ) {
-	var matched, match, tokens, type,
-		soFar, groups, preFilters,
-		cached = tokenCache[ selector + " " ];
-
-	if ( cached ) {
-		return parseOnly ? 0 : cached.slice( 0 );
-	}
-
-	soFar = selector;
-	groups = [];
-	preFilters = Expr.preFilter;
-
-	while ( soFar ) {
-
-		// Comma and first run
-		if ( !matched || ( match = rcomma.exec( soFar ) ) ) {
-			if ( match ) {
-
-				// Don't consume trailing commas as valid
-				soFar = soFar.slice( match[ 0 ].length ) || soFar;
-			}
-			groups.push( ( tokens = [] ) );
-		}
-
-		matched = false;
-
-		// Combinators
-		if ( ( match = rleadingCombinator.exec( soFar ) ) ) {
-			matched = match.shift();
-			tokens.push( {
-				value: matched,
-
-				// Cast descendant combinators to space
-				type: match[ 0 ].replace( rtrimCSS, " " )
-			} );
-			soFar = soFar.slice( matched.length );
-		}
-
-		// Filters
-		for ( type in Expr.filter ) {
-			if ( ( match = matchExpr[ type ].exec( soFar ) ) && ( !preFilters[ type ] ||
-				( match = preFilters[ type ]( match ) ) ) ) {
-				matched = match.shift();
-				tokens.push( {
-					value: matched,
-					type: type,
-					matches: match
-				} );
-				soFar = soFar.slice( matched.length );
-			}
-		}
-
-		if ( !matched ) {
-			break;
-		}
-	}
-
-	// Return the length of the invalid excess
-	// if we're just parsing
-	// Otherwise, throw an error or return tokens
-	if ( parseOnly ) {
-		return soFar.length;
-	}
-
-	return soFar ?
-		find.error( selector ) :
-
-		// Cache the tokens
-		tokenCache( selector, groups ).slice( 0 );
-}
-
-function toSelector( tokens ) {
-	var i = 0,
-		len = tokens.length,
-		selector = "";
-	for ( ; i < len; i++ ) {
-		selector += tokens[ i ].value;
-	}
-	return selector;
-}
-
-function addCombinator( matcher, combinator, base ) {
-	var dir = combinator.dir,
-		skip = combinator.next,
-		key = skip || dir,
-		checkNonElements = base && key === "parentNode",
-		doneName = done++;
-
-	return combinator.first ?
-
-		// Check against closest ancestor/preceding element
-		function( elem, context, xml ) {
-			while ( ( elem = elem[ dir ] ) ) {
-				if ( elem.nodeType === 1 || checkNonElements ) {
-					return matcher( elem, context, xml );
-				}
-			}
-			return false;
-		} :
-
-		// Check against all ancestor/preceding elements
-		function( elem, context, xml ) {
-			var oldCache, outerCache,
-				newCache = [ dirruns, doneName ];
-
-			// We can't set arbitrary data on XML nodes, so they don't benefit from combinator caching
-			if ( xml ) {
-				while ( ( elem = elem[ dir ] ) ) {
-					if ( elem.nodeType === 1 || checkNonElements ) {
-						if ( matcher( elem, context, xml ) ) {
-							return true;
-						}
-					}
-				}
-			} else {
-				while ( ( elem = elem[ dir ] ) ) {
-					if ( elem.nodeType === 1 || checkNonElements ) {
-						outerCache = elem[ expando ] || ( elem[ expando ] = {} );
-
-						if ( skip && nodeName( elem, skip ) ) {
-							elem = elem[ dir ] || elem;
-						} else if ( ( oldCache = outerCache[ key ] ) &&
-							oldCache[ 0 ] === dirruns && oldCache[ 1 ] === doneName ) {
-
-							// Assign to newCache so results back-propagate to previous elements
-							return ( newCache[ 2 ] = oldCache[ 2 ] );
-						} else {
-
-							// Reuse newcache so results back-propagate to previous elements
-							outerCache[ key ] = newCache;
-
-							// A match means we're done; a fail means we have to keep checking
-							if ( ( newCache[ 2 ] = matcher( elem, context, xml ) ) ) {
-								return true;
-							}
-						}
-					}
-				}
-			}
-			return false;
-		};
-}
-
-function elementMatcher( matchers ) {
-	return matchers.length > 1 ?
-		function( elem, context, xml ) {
-			var i = matchers.length;
-			while ( i-- ) {
-				if ( !matchers[ i ]( elem, context, xml ) ) {
-					return false;
-				}
-			}
-			return true;
-		} :
-		matchers[ 0 ];
-}
-
-function multipleContexts( selector, contexts, results ) {
-	var i = 0,
-		len = contexts.length;
-	for ( ; i < len; i++ ) {
-		find( selector, contexts[ i ], results );
-	}
-	return results;
-}
-
-function condense( unmatched, map, filter, context, xml ) {
-	var elem,
-		newUnmatched = [],
-		i = 0,
-		len = unmatched.length,
-		mapped = map != null;
-
-	for ( ; i < len; i++ ) {
-		if ( ( elem = unmatched[ i ] ) ) {
-			if ( !filter || filter( elem, context, xml ) ) {
-				newUnmatched.push( elem );
-				if ( mapped ) {
-					map.push( i );
-				}
-			}
-		}
-	}
-
-	return newUnmatched;
-}
-
-function setMatcher( preFilter, selector, matcher, postFilter, postFinder, postSelector ) {
-	if ( postFilter && !postFilter[ expando ] ) {
-		postFilter = setMatcher( postFilter );
-	}
-	if ( postFinder && !postFinder[ expando ] ) {
-		postFinder = setMatcher( postFinder, postSelector );
-	}
-	return markFunction( function( seed, results, context, xml ) {
-		var temp, i, elem, matcherOut,
-			preMap = [],
-			postMap = [],
-			preexisting = results.length,
-
-			// Get initial elements from seed or context
-			elems = seed ||
-				multipleContexts( selector || "*",
-					context.nodeType ? [ context ] : context, [] ),
-
-			// Prefilter to get matcher input, preserving a map for seed-results synchronization
-			matcherIn = preFilter && ( seed || !selector ) ?
-				condense( elems, preMap, preFilter, context, xml ) :
-				elems;
-
-		if ( matcher ) {
-
-			// If we have a postFinder, or filtered seed, or non-seed postFilter
-			// or preexisting results,
-			matcherOut = postFinder || ( seed ? preFilter : preexisting || postFilter ) ?
-
-				// ...intermediate processing is necessary
-				[] :
-
-				// ...otherwise use results directly
-				results;
-
-			// Find primary matches
-			matcher( matcherIn, matcherOut, context, xml );
-		} else {
-			matcherOut = matcherIn;
-		}
-
-		// Apply postFilter
-		if ( postFilter ) {
-			temp = condense( matcherOut, postMap );
-			postFilter( temp, [], context, xml );
-
-			// Un-match failing elements by moving them back to matcherIn
-			i = temp.length;
-			while ( i-- ) {
-				if ( ( elem = temp[ i ] ) ) {
-					matcherOut[ postMap[ i ] ] = !( matcherIn[ postMap[ i ] ] = elem );
-				}
-			}
-		}
-
-		if ( seed ) {
-			if ( postFinder || preFilter ) {
-				if ( postFinder ) {
-
-					// Get the final matcherOut by condensing this intermediate into postFinder contexts
-					temp = [];
-					i = matcherOut.length;
-					while ( i-- ) {
-						if ( ( elem = matcherOut[ i ] ) ) {
-
-							// Restore matcherIn since elem is not yet a final match
-							temp.push( ( matcherIn[ i ] = elem ) );
-						}
-					}
-					postFinder( null, ( matcherOut = [] ), temp, xml );
-				}
-
-				// Move matched elements from seed to results to keep them synchronized
-				i = matcherOut.length;
-				while ( i-- ) {
-					if ( ( elem = matcherOut[ i ] ) &&
-						( temp = postFinder ? indexOf.call( seed, elem ) : preMap[ i ] ) > -1 ) {
-
-						seed[ temp ] = !( results[ temp ] = elem );
-					}
-				}
-			}
-
-		// Add elements to results, through postFinder if defined
-		} else {
-			matcherOut = condense(
-				matcherOut === results ?
-					matcherOut.splice( preexisting, matcherOut.length ) :
-					matcherOut
-			);
-			if ( postFinder ) {
-				postFinder( null, results, matcherOut, xml );
-			} else {
-				push.apply( results, matcherOut );
-			}
-		}
-	} );
-}
-
-function matcherFromTokens( tokens ) {
-	var checkContext, matcher, j,
-		len = tokens.length,
-		leadingRelative = Expr.relative[ tokens[ 0 ].type ],
-		implicitRelative = leadingRelative || Expr.relative[ " " ],
-		i = leadingRelative ? 1 : 0,
-
-		// The foundational matcher ensures that elements are reachable from top-level context(s)
-		matchContext = addCombinator( function( elem ) {
-			return elem === checkContext;
-		}, implicitRelative, true ),
-		matchAnyContext = addCombinator( function( elem ) {
-			return indexOf.call( checkContext, elem ) > -1;
-		}, implicitRelative, true ),
-		matchers = [ function( elem, context, xml ) {
-
-			// Support: IE 11+, Edge 17 - 18+
-			// IE/Edge sometimes throw a "Permission denied" error when strict-comparing
-			// two documents; shallow comparisons work.
-			// eslint-disable-next-line eqeqeq
-			var ret = ( !leadingRelative && ( xml || context != outermostContext ) ) || (
-				( checkContext = context ).nodeType ?
-					matchContext( elem, context, xml ) :
-					matchAnyContext( elem, context, xml ) );
-
-			// Avoid hanging onto element
-			// (see https://github.com/jquery/sizzle/issues/299)
-			checkContext = null;
-			return ret;
-		} ];
-
-	for ( ; i < len; i++ ) {
-		if ( ( matcher = Expr.relative[ tokens[ i ].type ] ) ) {
-			matchers = [ addCombinator( elementMatcher( matchers ), matcher ) ];
-		} else {
-			matcher = Expr.filter[ tokens[ i ].type ].apply( null, tokens[ i ].matches );
-
-			// Return special upon seeing a positional matcher
-			if ( matcher[ expando ] ) {
-
-				// Find the next relative operator (if any) for proper handling
-				j = ++i;
-				for ( ; j < len; j++ ) {
-					if ( Expr.relative[ tokens[ j ].type ] ) {
-						break;
-					}
-				}
-				return setMatcher(
-					i > 1 && elementMatcher( matchers ),
-					i > 1 && toSelector(
-
-						// If the preceding token was a descendant combinator, insert an implicit any-element `*`
-						tokens.slice( 0, i - 1 )
-							.concat( { value: tokens[ i - 2 ].type === " " ? "*" : "" } )
-					).replace( rtrimCSS, "$1" ),
-					matcher,
-					i < j && matcherFromTokens( tokens.slice( i, j ) ),
-					j < len && matcherFromTokens( ( tokens = tokens.slice( j ) ) ),
-					j < len && toSelector( tokens )
-				);
-			}
-			matchers.push( matcher );
-		}
-	}
-
-	return elementMatcher( matchers );
-}
-
-function matcherFromGroupMatchers( elementMatchers, setMatchers ) {
-	var bySet = setMatchers.length > 0,
-		byElement = elementMatchers.length > 0,
-		superMatcher = function( seed, context, xml, results, outermost ) {
-			var elem, j, matcher,
-				matchedCount = 0,
-				i = "0",
-				unmatched = seed && [],
-				setMatched = [],
-				contextBackup = outermostContext,
-
-				// We must always have either seed elements or outermost context
-				elems = seed || byElement && Expr.find.TAG( "*", outermost ),
-
-				// Use integer dirruns iff this is the outermost matcher
-				dirrunsUnique = ( dirruns += contextBackup == null ? 1 : Math.random() || 0.1 ),
-				len = elems.length;
-
-			if ( outermost ) {
-
-				// Support: IE 11+, Edge 17 - 18+
-				// IE/Edge sometimes throw a "Permission denied" error when strict-comparing
-				// two documents; shallow comparisons work.
-				// eslint-disable-next-line eqeqeq
-				outermostContext = context == document || context || outermost;
-			}
-
-			// Add elements passing elementMatchers directly to results
-			// Support: iOS <=7 - 9 only
-			// Tolerate NodeList properties (IE: "length"; Safari: <number>) matching
-			// elements by id. (see trac-14142)
-			for ( ; i !== len && ( elem = elems[ i ] ) != null; i++ ) {
-				if ( byElement && elem ) {
-					j = 0;
-
-					// Support: IE 11+, Edge 17 - 18+
-					// IE/Edge sometimes throw a "Permission denied" error when strict-comparing
-					// two documents; shallow comparisons work.
-					// eslint-disable-next-line eqeqeq
-					if ( !context && elem.ownerDocument != document ) {
-						setDocument( elem );
-						xml = !documentIsHTML;
-					}
-					while ( ( matcher = elementMatchers[ j++ ] ) ) {
-						if ( matcher( elem, context || document, xml ) ) {
-							push.call( results, elem );
-							break;
-						}
-					}
-					if ( outermost ) {
-						dirruns = dirrunsUnique;
-					}
-				}
-
-				// Track unmatched elements for set filters
-				if ( bySet ) {
-
-					// They will have gone through all possible matchers
-					if ( ( elem = !matcher && elem ) ) {
-						matchedCount--;
-					}
-
-					// Lengthen the array for every element, matched or not
-					if ( seed ) {
-						unmatched.push( elem );
-					}
-				}
-			}
-
-			// `i` is now the count of elements visited above, and adding it to `matchedCount`
-			// makes the latter nonnegative.
-			matchedCount += i;
-
-			// Apply set filters to unmatched elements
-			// NOTE: This can be skipped if there are no unmatched elements (i.e., `matchedCount`
-			// equals `i`), unless we didn't visit _any_ elements in the above loop because we have
-			// no element matchers and no seed.
-			// Incrementing an initially-string "0" `i` allows `i` to remain a string only in that
-			// case, which will result in a "00" `matchedCount` that differs from `i` but is also
-			// numerically zero.
-			if ( bySet && i !== matchedCount ) {
-				j = 0;
-				while ( ( matcher = setMatchers[ j++ ] ) ) {
-					matcher( unmatched, setMatched, context, xml );
-				}
-
-				if ( seed ) {
-
-					// Reintegrate element matches to eliminate the need for sorting
-					if ( matchedCount > 0 ) {
-						while ( i-- ) {
-							if ( !( unmatched[ i ] || setMatched[ i ] ) ) {
-								setMatched[ i ] = pop.call( results );
-							}
-						}
-					}
-
-					// Discard index placeholder values to get only actual matches
-					setMatched = condense( setMatched );
-				}
-
-				// Add matches to results
-				push.apply( results, setMatched );
-
-				// Seedless set matches succeeding multiple successful matchers stipulate sorting
-				if ( outermost && !seed && setMatched.length > 0 &&
-					( matchedCount + setMatchers.length ) > 1 ) {
-
-					jQuery.uniqueSort( results );
-				}
-			}
-
-			// Override manipulation of globals by nested matchers
-			if ( outermost ) {
-				dirruns = dirrunsUnique;
-				outermostContext = contextBackup;
-			}
-
-			return unmatched;
-		};
-
-	return bySet ?
-		markFunction( superMatcher ) :
-		superMatcher;
-}
-
-function compile( selector, match /* Internal Use Only */ ) {
-	var i,
-		setMatchers = [],
-		elementMatchers = [],
-		cached = compilerCache[ selector + " " ];
-
-	if ( !cached ) {
-
-		// Generate a function of recursive functions that can be used to check each element
-		if ( !match ) {
-			match = tokenize( selector );
-		}
-		i = match.length;
-		while ( i-- ) {
-			cached = matcherFromTokens( match[ i ] );
-			if ( cached[ expando ] ) {
-				setMatchers.push( cached );
-			} else {
-				elementMatchers.push( cached );
-			}
-		}
-
-		// Cache the compiled function
-		cached = compilerCache( selector,
-			matcherFromGroupMatchers( elementMatchers, setMatchers ) );
-
-		// Save selector and tokenization
-		cached.selector = selector;
-	}
-	return cached;
-}
-
-/**
- * A low-level selection function that works with jQuery's compiled
- *  selector functions
- * @param {String|Function} selector A selector or a pre-compiled
- *  selector function built with jQuery selector compile
- * @param {Element} context
- * @param {Array} [results]
- * @param {Array} [seed] A set of elements to match against
- */
-function select( selector, context, results, seed ) {
-	var i, tokens, token, type, find,
-		compiled = typeof selector === "function" && selector,
-		match = !seed && tokenize( ( selector = compiled.selector || selector ) );
-
-	results = results || [];
-
-	// Try to minimize operations if there is only one selector in the list and no seed
-	// (the latter of which guarantees us context)
-	if ( match.length === 1 ) {
-
-		// Reduce context if the leading compound selector is an ID
-		tokens = match[ 0 ] = match[ 0 ].slice( 0 );
-		if ( tokens.length > 2 && ( token = tokens[ 0 ] ).type === "ID" &&
-				context.nodeType === 9 && documentIsHTML && Expr.relative[ tokens[ 1 ].type ] ) {
-
-			context = ( Expr.find.ID(
-				token.matches[ 0 ].replace( runescape, funescape ),
-				context
-			) || [] )[ 0 ];
-			if ( !context ) {
-				return results;
-
-			// Precompiled matchers will still verify ancestry, so step up a level
-			} else if ( compiled ) {
-				context = context.parentNode;
-			}
-
-			selector = selector.slice( tokens.shift().value.length );
-		}
-
-		// Fetch a seed set for right-to-left matching
-		i = matchExpr.needsContext.test( selector ) ? 0 : tokens.length;
-		while ( i-- ) {
-			token = tokens[ i ];
-
-			// Abort if we hit a combinator
-			if ( Expr.relative[ ( type = token.type ) ] ) {
-				break;
-			}
-			if ( ( find = Expr.find[ type ] ) ) {
-
-				// Search, expanding context for leading sibling combinators
-				if ( ( seed = find(
-					token.matches[ 0 ].replace( runescape, funescape ),
-					rsibling.test( tokens[ 0 ].type ) &&
-						testContext( context.parentNode ) || context
-				) ) ) {
-
-					// If seed is empty or no tokens remain, we can return early
-					tokens.splice( i, 1 );
-					selector = seed.length && toSelector( tokens );
-					if ( !selector ) {
-						push.apply( results, seed );
-						return results;
-					}
-
-					break;
-				}
-			}
-		}
-	}
-
-	// Compile and execute a filtering function if one is not provided
-	// Provide `match` to avoid retokenization if we modified the selector above
-	( compiled || compile( selector, match ) )(
-		seed,
-		context,
-		!documentIsHTML,
-		results,
-		!context || rsibling.test( selector ) && testContext( context.parentNode ) || context
-	);
-	return results;
-}
-
-// One-time assignments
-
-// Support: Android <=4.0 - 4.1+
-// Sort stability
-support.sortStable = expando.split( "" ).sort( sortOrder ).join( "" ) === expando;
-
-// Initialize against the default document
-setDocument();
-
-// Support: Android <=4.0 - 4.1+
-// Detached nodes confoundingly follow *each other*
-support.sortDetached = assert( function( el ) {
-
-	// Should return 1, but returns 4 (following)
-	return el.compareDocumentPosition( document.createElement( "fieldset" ) ) & 1;
-} );
-
-jQuery.find = find;
-
-// Deprecated
-jQuery.expr[ ":" ] = jQuery.expr.pseudos;
-jQuery.unique = jQuery.uniqueSort;
-
-// These have always been private, but they used to be documented as part of
-// Sizzle so let's maintain them for now for backwards compatibility purposes.
-find.compile = compile;
-find.select = select;
-find.setDocument = setDocument;
-find.tokenize = tokenize;
-
-find.escape = jQuery.escapeSelector;
-find.getText = jQuery.text;
-find.isXML = jQuery.isXMLDoc;
-find.selectors = jQuery.expr;
-find.support = jQuery.support;
-find.uniqueSort = jQuery.uniqueSort;
-
-	/* eslint-enable */
-
-} )();
-
-
-var dir = function( elem, dir, until ) {
-	var matched = [],
-		truncate = until !== undefined;
-
-	while ( ( elem = elem[ dir ] ) && elem.nodeType !== 9 ) {
-		if ( elem.nodeType === 1 ) {
-			if ( truncate && jQuery( elem ).is( until ) ) {
-				break;
-			}
-			matched.push( elem );
-		}
-	}
-	return matched;
-};
-
-
-var siblings = function( n, elem ) {
-	var matched = [];
-
-	for ( ; n; n = n.nextSibling ) {
-		if ( n.nodeType === 1 && n !== elem ) {
-			matched.push( n );
-		}
-	}
-
-	return matched;
-};
-
-
-var rneedsContext = jQuery.expr.match.needsContext;
-
-var rsingleTag = ( /^<([a-z][^\/\0>:\x20\t\r\n\f]*)[\x20\t\r\n\f]*\/?>(?:<\/\1>|)$/i );
-
-
-
-// Implement the identical functionality for filter and not
-function winnow( elements, qualifier, not ) {
-	if ( isFunction( qualifier ) ) {
-		return jQuery.grep( elements, function( elem, i ) {
-			return !!qualifier.call( elem, i, elem ) !== not;
-		} );
-	}
-
-	// Single element
-	if ( qualifier.nodeType ) {
-		return jQuery.grep( elements, function( elem ) {
-			return ( elem === qualifier ) !== not;
-		} );
-	}
-
-	// Arraylike of elements (jQuery, arguments, Array)
-	if ( typeof qualifier !== "string" ) {
-		return jQuery.grep( elements, function( elem ) {
-			return ( indexOf.call( qualifier, elem ) > -1 ) !== not;
-		} );
-	}
-
-	// Filtered directly for both simple and complex selectors
-	return jQuery.filter( qualifier, elements, not );
-}
-
-jQuery.filter = function( expr, elems, not ) {
-	var elem = elems[ 0 ];
-
-	if ( not ) {
-		expr = ":not(" + expr + ")";
-	}
-
-	if ( elems.length === 1 && elem.nodeType === 1 ) {
-		return jQuery.find.matchesSelector( elem, expr ) ? [ elem ] : [];
-	}
-
-	return jQuery.find.matches( expr, jQuery.grep( elems, function( elem ) {
-		return elem.nodeType === 1;
-	} ) );
-};
-
-jQuery.fn.extend( {
-	find: function( selector ) {
-		var i, ret,
-			len = this.length,
-			self = this;
-
-		if ( typeof selector !== "string" ) {
-			return this.pushStack( jQuery( selector ).filter( function() {
-				for ( i = 0; i < len; i++ ) {
-					if ( jQuery.contains( self[ i ], this ) ) {
-						return true;
-					}
-				}
-			} ) );
-		}
-
-		ret = this.pushStack( [] );
-
-		for ( i = 0; i < len; i++ ) {
-			jQuery.find( selector, self[ i ], ret );
-		}
-
-		return len > 1 ? jQuery.uniqueSort( ret ) : ret;
-	},
-	filter: function( selector ) {
-		return this.pushStack( winnow( this, selector || [], false ) );
-	},
-	not: function( selector ) {
-		return this.pushStack( winnow( this, selector || [], true ) );
-	},
-	is: function( selector ) {
-		return !!winnow(
-			this,
-
-			// If this is a positional/relative selector, check membership in the returned set
-			// so $("p:first").is("p:last") won't return true for a doc with two "p".
-			typeof selector === "string" && rneedsContext.test( selector ) ?
-				jQuery( selector ) :
-				selector || [],
-			false
-		).length;
-	}
-} );
-
-
-// Initialize a jQuery object
-
-
-// A central reference to the root jQuery(document)
-var rootjQuery,
-
-	// A simple way to check for HTML strings
-	// Prioritize #id over <tag> to avoid XSS via location.hash (trac-9521)
-	// Strict HTML recognition (trac-11290: must start with <)
-	// Shortcut simple #id case for speed
-	rquickExpr = /^(?:\s*(<[\w\W]+>)[^>]*|#([\w-]+))$/,
-
-	init = jQuery.fn.init = function( selector, context, root ) {
-		var match, elem;
-
-		// HANDLE: $(""), $(null), $(undefined), $(false)
-		if ( !selector ) {
-			return this;
-		}
-
-		// Method init() accepts an alternate rootjQuery
-		// so migrate can support jQuery.sub (gh-2101)
-		root = root || rootjQuery;
-
-		// Handle HTML strings
-		if ( typeof selector === "string" ) {
-			if ( selector[ 0 ] === "<" &&
-				selector[ selector.length - 1 ] === ">" &&
-				selector.length >= 3 ) {
-
-				// Assume that strings that start and end with <> are HTML and skip the regex check
-				match = [ null, selector, null ];
-
-			} else {
-				match = rquickExpr.exec( selector );
-			}
-
-			// Match html or make sure no context is specified for #id
-			if ( match && ( match[ 1 ] || !context ) ) {
-
-				// HANDLE: $(html) -> $(array)
-				if ( match[ 1 ] ) {
-					context = context instanceof jQuery ? context[ 0 ] : context;
-
-					// Option to run scripts is true for back-compat
-					// Intentionally let the error be thrown if parseHTML is not present
-					jQuery.merge( this, jQuery.parseHTML(
-						match[ 1 ],
-						context && context.nodeType ? context.ownerDocument || context : document,
-						true
-					) );
-
-					// HANDLE: $(html, props)
-					if ( rsingleTag.test( match[ 1 ] ) && jQuery.isPlainObject( context ) ) {
-						for ( match in context ) {
-
-							// Properties of context are called as methods if possible
-							if ( isFunction( this[ match ] ) ) {
-								this[ match ]( context[ match ] );
-
-							// ...and otherwise set as attributes
-							} else {
-								this.attr( match, context[ match ] );
-							}
-						}
-					}
-
-					return this;
-
-				// HANDLE: $(#id)
-				} else {
-					elem = document.getElementById( match[ 2 ] );
-
-					if ( elem ) {
-
-						// Inject the element directly into the jQuery object
-						this[ 0 ] = elem;
-						this.length = 1;
-					}
-					return this;
-				}
-
-			// HANDLE: $(expr, $(...))
-			} else if ( !context || context.jquery ) {
-				return ( context || root ).find( selector );
-
-			// HANDLE: $(expr, context)
-			// (which is just equivalent to: $(context).find(expr)
-			} else {
-				return this.constructor( context ).find( selector );
-			}
-
-		// HANDLE: $(DOMElement)
-		} else if ( selector.nodeType ) {
-			this[ 0 ] = selector;
-			this.length = 1;
-			return this;
-
-		// HANDLE: $(function)
-		// Shortcut for document ready
-		} else if ( isFunction( selector ) ) {
-			return root.ready !== undefined ?
-				root.ready( selector ) :
-
-				// Execute immediately if ready is not present
-				selector( jQuery );
-		}
-
-		return jQuery.makeArray( selector, this );
-	};
-
-// Give the init function the jQuery prototype for later instantiation
-init.prototype = jQuery.fn;
-
-// Initialize central reference
-rootjQuery = jQuery( document );
-
-
-var rparentsprev = /^(?:parents|prev(?:Until|All))/,
-
-	// Methods guaranteed to produce a unique set when starting from a unique set
-	guaranteedUnique = {
-		children: true,
-		contents: true,
-		next: true,
-		prev: true
-	};
-
-jQuery.fn.extend( {
-	has: function( target ) {
-		var targets = jQuery( target, this ),
-			l = targets.length;
-
-		return this.filter( function() {
-			var i = 0;
-			for ( ; i < l; i++ ) {
-				if ( jQuery.contains( this, targets[ i ] ) ) {
-					return true;
-				}
-			}
-		} );
-	},
-
-	closest: function( selectors, context ) {
-		var cur,
-			i = 0,
-			l = this.length,
-			matched = [],
-			targets = typeof selectors !== "string" && jQuery( selectors );
-
-		// Positional selectors never match, since there's no _selection_ context
-		if ( !rneedsContext.test( selectors ) ) {
-			for ( ; i < l; i++ ) {
-				for ( cur = this[ i ]; cur && cur !== context; cur = cur.parentNode ) {
-
-					// Always skip document fragments
-					if ( cur.nodeType < 11 && ( targets ?
-						targets.index( cur ) > -1 :
-
-						// Don't pass non-elements to jQuery#find
-						cur.nodeType === 1 &&
-							jQuery.find.matchesSelector( cur, selectors ) ) ) {
-
-						matched.push( cur );
-						break;
-					}
-				}
-			}
-		}
-
-		return this.pushStack( matched.length > 1 ? jQuery.uniqueSort( matched ) : matched );
-	},
-
-	// Determine the position of an element within the set
-	index: function( elem ) {
-
-		// No argument, return index in parent
-		if ( !elem ) {
-			return ( this[ 0 ] && this[ 0 ].parentNode ) ? this.first().prevAll().length : -1;
-		}
-
-		// Index in selector
-		if ( typeof elem === "string" ) {
-			return indexOf.call( jQuery( elem ), this[ 0 ] );
-		}
-
-		// Locate the position of the desired element
-		return indexOf.call( this,
-
-			// If it receives a jQuery object, the first element is used
-			elem.jquery ? elem[ 0 ] : elem
-		);
-	},
-
-	add: function( selector, context ) {
-		return this.pushStack(
-			jQuery.uniqueSort(
-				jQuery.merge( this.get(), jQuery( selector, context ) )
-			)
-		);
-	},
-
-	addBack: function( selector ) {
-		return this.add( selector == null ?
-			this.prevObject : this.prevObject.filter( selector )
-		);
-	}
-} );
-
-function sibling( cur, dir ) {
-	while ( ( cur = cur[ dir ] ) && cur.nodeType !== 1 ) {}
-	return cur;
-}
-
-jQuery.each( {
-	parent: function( elem ) {
-		var parent = elem.parentNode;
-		return parent && parent.nodeType !== 11 ? parent : null;
-	},
-	parents: function( elem ) {
-		return dir( elem, "parentNode" );
-	},
-	parentsUntil: function( elem, _i, until ) {
-		return dir( elem, "parentNode", until );
-	},
-	next: function( elem ) {
-		return sibling( elem, "nextSibling" );
-	},
-	prev: function( elem ) {
-		return sibling( elem, "previousSibling" );
-	},
-	nextAll: function( elem ) {
-		return dir( elem, "nextSibling" );
-	},
-	prevAll: function( elem ) {
-		return dir( elem, "previousSibling" );
-	},
-	nextUntil: function( elem, _i, until ) {
-		return dir( elem, "nextSibling", until );
-	},
-	prevUntil: function( elem, _i, until ) {
-		return dir( elem, "previousSibling", until );
-	},
-	siblings: function( elem ) {
-		return siblings( ( elem.parentNode || {} ).firstChild, elem );
-	},
-	children: function( elem ) {
-		return siblings( elem.firstChild );
-	},
-	contents: function( elem ) {
-		if ( elem.contentDocument != null &&
-
-			// Support: IE 11+
-			// <object> elements with no `data` attribute has an object
-			// `contentDocument` with a `null` prototype.
-			getProto( elem.contentDocument ) ) {
-
-			return elem.contentDocument;
-		}
-
-		// Support: IE 9 - 11 only, iOS 7 only, Android Browser <=4.3 only
-		// Treat the template element as a regular one in browsers that
-		// don't support it.
-		if ( nodeName( elem, "template" ) ) {
-			elem = elem.content || elem;
-		}
-
-		return jQuery.merge( [], elem.childNodes );
-	}
-}, function( name, fn ) {
-	jQuery.fn[ name ] = function( until, selector ) {
-		var matched = jQuery.map( this, fn, until );
-
-		if ( name.slice( -5 ) !== "Until" ) {
-			selector = until;
-		}
-
-		if ( selector && typeof selector === "string" ) {
-			matched = jQuery.filter( selector, matched );
-		}
-
-		if ( this.length > 1 ) {
-
-			// Remove duplicates
-			if ( !guaranteedUnique[ name ] ) {
-				jQuery.uniqueSort( matched );
-			}
-
-			// Reverse order for parents* and prev-derivatives
-			if ( rparentsprev.test( name ) ) {
-				matched.reverse();
-			}
-		}
-
-		return this.pushStack( matched );
-	};
-} );
-var rnothtmlwhite = ( /[^\x20\t\r\n\f]+/g );
-
-
-
-// Convert String-formatted options into Object-formatted ones
-function createOptions( options ) {
-	var object = {};
-	jQuery.each( options.match( rnothtmlwhite ) || [], function( _, flag ) {
-		object[ flag ] = true;
-	} );
-	return object;
-}
-
-/*
- * Create a callback list using the following parameters:
- *
- *	options: an optional list of space-separated options that will change how
- *			the callback list behaves or a more traditional option object
- *
- * By default a callback list will act like an event callback list and can be
- * "fired" multiple times.
- *
- * Possible options:
- *
- *	once:			will ensure the callback list can only be fired once (like a Deferred)
- *
- *	memory:			will keep track of previous values and will call any callback added
- *					after the list has been fired right away with the latest "memorized"
- *					values (like a Deferred)
- *
- *	unique:			will ensure a callback can only be added once (no duplicate in the list)
- *
- *	stopOnFalse:	interrupt callings when a callback returns false
- *
- */
-jQuery.Callbacks = function( options ) {
-
-	// Convert options from String-formatted to Object-formatted if needed
-	// (we check in cache first)
-	options = typeof options === "string" ?
-		createOptions( options ) :
-		jQuery.extend( {}, options );
-
-	var // Flag to know if list is currently firing
-		firing,
-
-		// Last fire value for non-forgettable lists
-		memory,
-
-		// Flag to know if list was already fired
-		fired,
-
-		// Flag to prevent firing
-		locked,
-
-		// Actual callback list
-		list = [],
-
-		// Queue of execution data for repeatable lists
-		queue = [],
-
-		// Index of currently firing callback (modified by add/remove as needed)
-		firingIndex = -1,
-
-		// Fire callbacks
-		fire = function() {
-
-			// Enforce single-firing
-			locked = locked || options.once;
-
-			// Execute callbacks for all pending executions,
-			// respecting firingIndex overrides and runtime changes
-			fired = firing = true;
-			for ( ; queue.length; firingIndex = -1 ) {
-				memory = queue.shift();
-				while ( ++firingIndex < list.length ) {
-
-					// Run callback and check for early termination
-					if ( list[ firingIndex ].apply( memory[ 0 ], memory[ 1 ] ) === false &&
-						options.stopOnFalse ) {
-
-						// Jump to end and forget the data so .add doesn't re-fire
-						firingIndex = list.length;
-						memory = false;
-					}
-				}
-			}
-
-			// Forget the data if we're done with it
-			if ( !options.memory ) {
-				memory = false;
-			}
-
-			firing = false;
-
-			// Clean up if we're done firing for good
-			if ( locked ) {
-
-				// Keep an empty list if we have data for future add calls
-				if ( memory ) {
-					list = [];
-
-				// Otherwise, this object is spent
-				} else {
-					list = "";
-				}
-			}
-		},
-
-		// Actual Callbacks object
-		self = {
-
-			// Add a callback or a collection of callbacks to the list
-			add: function() {
-				if ( list ) {
-
-					// If we have memory from a past run, we should fire after adding
-					if ( memory && !firing ) {
-						firingIndex = list.length - 1;
-						queue.push( memory );
-					}
-
-					( function add( args ) {
-						jQuery.each( args, function( _, arg ) {
-							if ( isFunction( arg ) ) {
-								if ( !options.unique || !self.has( arg ) ) {
-									list.push( arg );
-								}
-							} else if ( arg && arg.length && toType( arg ) !== "string" ) {
-
-								// Inspect recursively
-								add( arg );
-							}
-						} );
-					} )( arguments );
-
-					if ( memory && !firing ) {
-						fire();
-					}
-				}
-				return this;
-			},
-
-			// Remove a callback from the list
-			remove: function() {
-				jQuery.each( arguments, function( _, arg ) {
-					var index;
-					while ( ( index = jQuery.inArray( arg, list, index ) ) > -1 ) {
-						list.splice( index, 1 );
-
-						// Handle firing indexes
-						if ( index <= firingIndex ) {
-							firingIndex--;
-						}
-					}
-				} );
-				return this;
-			},
-
-			// Check if a given callback is in the list.
-			// If no argument is given, return whether or not list has callbacks attached.
-			has: function( fn ) {
-				return fn ?
-					jQuery.inArray( fn, list ) > -1 :
-					list.length > 0;
-			},
-
-			// Remove all callbacks from the list
-			empty: function() {
-				if ( list ) {
-					list = [];
-				}
-				return this;
-			},
-
-			// Disable .fire and .add
-			// Abort any current/pending executions
-			// Clear all callbacks and values
-			disable: function() {
-				locked = queue = [];
-				list = memory = "";
-				return this;
-			},
-			disabled: function() {
-				return !list;
-			},
-
-			// Disable .fire
-			// Also disable .add unless we have memory (since it would have no effect)
-			// Abort any pending executions
-			lock: function() {
-				locked = queue = [];
-				if ( !memory && !firing ) {
-					list = memory = "";
-				}
-				return this;
-			},
-			locked: function() {
-				return !!locked;
-			},
-
-			// Call all callbacks with the given context and arguments
-			fireWith: function( context, args ) {
-				if ( !locked ) {
-					args = args || [];
-					args = [ context, args.slice ? args.slice() : args ];
-					queue.push( args );
-					if ( !firing ) {
-						fire();
-					}
-				}
-				return this;
-			},
-
-			// Call all the callbacks with the given arguments
-			fire: function() {
-				self.fireWith( this, arguments );
-				return this;
-			},
-
-			// To know if the callbacks have already been called at least once
-			fired: function() {
-				return !!fired;
-			}
-		};
-
-	return self;
-};
-
-
-function Identity( v ) {
-	return v;
-}
-function Thrower( ex ) {
-	throw ex;
-}
-
-function adoptValue( value, resolve, reject, noValue ) {
-	var method;
-
-	try {
-
-		// Check for promise aspect first to privilege synchronous behavior
-		if ( value && isFunction( ( method = value.promise ) ) ) {
-			method.call( value ).done( resolve ).fail( reject );
-
-		// Other thenables
-		} else if ( value && isFunction( ( method = value.then ) ) ) {
-			method.call( value, resolve, reject );
-
-		// Other non-thenables
-		} else {
-
-			// Control `resolve` arguments by letting Array#slice cast boolean `noValue` to integer:
-			// * false: [ value ].slice( 0 ) => resolve( value )
-			// * true: [ value ].slice( 1 ) => resolve()
-			resolve.apply( undefined, [ value ].slice( noValue ) );
-		}
-
-	// For Promises/A+, convert exceptions into rejections
-	// Since jQuery.when doesn't unwrap thenables, we can skip the extra checks appearing in
-	// Deferred#then to conditionally suppress rejection.
-	} catch ( value ) {
-
-		// Support: Android 4.0 only
-		// Strict mode functions invoked without .call/.apply get global-object context
-		reject.apply( undefined, [ value ] );
-	}
-}
-
-jQuery.extend( {
-
-	Deferred: function( func ) {
-		var tuples = [
-
-				// action, add listener, callbacks,
-				// ... .then handlers, argument index, [final state]
-				[ "notify", "progress", jQuery.Callbacks( "memory" ),
-					jQuery.Callbacks( "memory" ), 2 ],
-				[ "resolve", "done", jQuery.Callbacks( "once memory" ),
-					jQuery.Callbacks( "once memory" ), 0, "resolved" ],
-				[ "reject", "fail", jQuery.Callbacks( "once memory" ),
-					jQuery.Callbacks( "once memory" ), 1, "rejected" ]
-			],
-			state = "pending",
-			promise = {
-				state: function() {
-					return state;
-				},
-				always: function() {
-					deferred.done( arguments ).fail( arguments );
-					return this;
-				},
-				"catch": function( fn ) {
-					return promise.then( null, fn );
-				},
-
-				// Keep pipe for back-compat
-				pipe: function( /* fnDone, fnFail, fnProgress */ ) {
-					var fns = arguments;
-
-					return jQuery.Deferred( function( newDefer ) {
-						jQuery.each( tuples, function( _i, tuple ) {
-
-							// Map tuples (progress, done, fail) to arguments (done, fail, progress)
-							var fn = isFunction( fns[ tuple[ 4 ] ] ) && fns[ tuple[ 4 ] ];
-
-							// deferred.progress(function() { bind to newDefer or newDefer.notify })
-							// deferred.done(function() { bind to newDefer or newDefer.resolve })
-							// deferred.fail(function() { bind to newDefer or newDefer.reject })
-							deferred[ tuple[ 1 ] ]( function() {
-								var returned = fn && fn.apply( this, arguments );
-								if ( returned && isFunction( returned.promise ) ) {
-									returned.promise()
-										.progress( newDefer.notify )
-										.done( newDefer.resolve )
-										.fail( newDefer.reject );
-								} else {
-									newDefer[ tuple[ 0 ] + "With" ](
-										this,
-										fn ? [ returned ] : arguments
-									);
-								}
-							} );
-						} );
-						fns = null;
-					} ).promise();
-				},
-				then: function( onFulfilled, onRejected, onProgress ) {
-					var maxDepth = 0;
-					function resolve( depth, deferred, handler, special ) {
-						return function() {
-							var that = this,
-								args = arguments,
-								mightThrow = function() {
-									var returned, then;
-
-									// Support: Promises/A+ section 2.3.3.3.3
-									// https://promisesaplus.com/#point-59
-									// Ignore double-resolution attempts
-									if ( depth < maxDepth ) {
-										return;
-									}
-
-									returned = handler.apply( that, args );
-
-									// Support: Promises/A+ section 2.3.1
-									// https://promisesaplus.com/#point-48
-									if ( returned === deferred.promise() ) {
-										throw new TypeError( "Thenable self-resolution" );
-									}
-
-									// Support: Promises/A+ sections 2.3.3.1, 3.5
-									// https://promisesaplus.com/#point-54
-									// https://promisesaplus.com/#point-75
-									// Retrieve `then` only once
-									then = returned &&
-
-										// Support: Promises/A+ section 2.3.4
-										// https://promisesaplus.com/#point-64
-										// Only check objects and functions for thenability
-										( typeof returned === "object" ||
-											typeof returned === "function" ) &&
-										returned.then;
-
-									// Handle a returned thenable
-									if ( isFunction( then ) ) {
-
-										// Special processors (notify) just wait for resolution
-										if ( special ) {
-											then.call(
-												returned,
-												resolve( maxDepth, deferred, Identity, special ),
-												resolve( maxDepth, deferred, Thrower, special )
-											);
-
-										// Normal processors (resolve) also hook into progress
-										} else {
-
-											// ...and disregard older resolution values
-											maxDepth++;
-
-											then.call(
-												returned,
-												resolve( maxDepth, deferred, Identity, special ),
-												resolve( maxDepth, deferred, Thrower, special ),
-												resolve( maxDepth, deferred, Identity,
-													deferred.notifyWith )
-											);
-										}
-
-									// Handle all other returned values
-									} else {
-
-										// Only substitute handlers pass on context
-										// and multiple values (non-spec behavior)
-										if ( handler !== Identity ) {
-											that = undefined;
-											args = [ returned ];
-										}
-
-										// Process the value(s)
-										// Default process is resolve
-										( special || deferred.resolveWith )( that, args );
-									}
-								},
-
-								// Only normal processors (resolve) catch and reject exceptions
-								process = special ?
-									mightThrow :
-									function() {
-										try {
-											mightThrow();
-										} catch ( e ) {
-
-											if ( jQuery.Deferred.exceptionHook ) {
-												jQuery.Deferred.exceptionHook( e,
-													process.error );
-											}
-
-											// Support: Promises/A+ section 2.3.3.3.4.1
-											// https://promisesaplus.com/#point-61
-											// Ignore post-resolution exceptions
-											if ( depth + 1 >= maxDepth ) {
-
-												// Only substitute handlers pass on context
-												// and multiple values (non-spec behavior)
-												if ( handler !== Thrower ) {
-													that = undefined;
-													args = [ e ];
-												}
-
-												deferred.rejectWith( that, args );
-											}
-										}
-									};
-
-							// Support: Promises/A+ section 2.3.3.3.1
-							// https://promisesaplus.com/#point-57
-							// Re-resolve promises immediately to dodge false rejection from
-							// subsequent errors
-							if ( depth ) {
-								process();
-							} else {
-
-								// Call an optional hook to record the error, in case of exception
-								// since it's otherwise lost when execution goes async
-								if ( jQuery.Deferred.getErrorHook ) {
-									process.error = jQuery.Deferred.getErrorHook();
-
-								// The deprecated alias of the above. While the name suggests
-								// returning the stack, not an error instance, jQuery just passes
-								// it directly to `console.warn` so both will work; an instance
-								// just better cooperates with source maps.
-								} else if ( jQuery.Deferred.getStackHook ) {
-									process.error = jQuery.Deferred.getStackHook();
-								}
-								window.setTimeout( process );
-							}
-						};
-					}
-
-					return jQuery.Deferred( function( newDefer ) {
-
-						// progress_handlers.add( ... )
-						tuples[ 0 ][ 3 ].add(
-							resolve(
-								0,
-								newDefer,
-								isFunction( onProgress ) ?
-									onProgress :
-									Identity,
-								newDefer.notifyWith
-							)
-						);
-
-						// fulfilled_handlers.add( ... )
-						tuples[ 1 ][ 3 ].add(
-							resolve(
-								0,
-								newDefer,
-								isFunction( onFulfilled ) ?
-									onFulfilled :
-									Identity
-							)
-						);
-
-						// rejected_handlers.add( ... )
-						tuples[ 2 ][ 3 ].add(
-							resolve(
-								0,
-								newDefer,
-								isFunction( onRejected ) ?
-									onRejected :
-									Thrower
-							)
-						);
-					} ).promise();
-				},
-
-				// Get a promise for this deferred
-				// If obj is provided, the promise aspect is added to the object
-				promise: function( obj ) {
-					return obj != null ? jQuery.extend( obj, promise ) : promise;
-				}
-			},
-			deferred = {};
-
-		// Add list-specific methods
-		jQuery.each( tuples, function( i, tuple ) {
-			var list = tuple[ 2 ],
-				stateString = tuple[ 5 ];
-
-			// promise.progress = list.add
-			// promise.done = list.add
-			// promise.fail = list.add
-			promise[ tuple[ 1 ] ] = list.add;
-
-			// Handle state
-			if ( stateString ) {
-				list.add(
-					function() {
-
-						// state = "resolved" (i.e., fulfilled)
-						// state = "rejected"
-						state = stateString;
-					},
-
-					// rejected_callbacks.disable
-					// fulfilled_callbacks.disable
-					tuples[ 3 - i ][ 2 ].disable,
-
-					// rejected_handlers.disable
-					// fulfilled_handlers.disable
-					tuples[ 3 - i ][ 3 ].disable,
-
-					// progress_callbacks.lock
-					tuples[ 0 ][ 2 ].lock,
-
-					// progress_handlers.lock
-					tuples[ 0 ][ 3 ].lock
-				);
-			}
-
-			// progress_handlers.fire
-			// fulfilled_handlers.fire
-			// rejected_handlers.fire
-			list.add( tuple[ 3 ].fire );
-
-			// deferred.notify = function() { deferred.notifyWith(...) }
-			// deferred.resolve = function() { deferred.resolveWith(...) }
-			// deferred.reject = function() { deferred.rejectWith(...) }
-			deferred[ tuple[ 0 ] ] = function() {
-				deferred[ tuple[ 0 ] + "With" ]( this === deferred ? undefined : this, arguments );
-				return this;
-			};
-
-			// deferred.notifyWith = list.fireWith
-			// deferred.resolveWith = list.fireWith
-			// deferred.rejectWith = list.fireWith
-			deferred[ tuple[ 0 ] + "With" ] = list.fireWith;
-		} );
-
-		// Make the deferred a promise
-		promise.promise( deferred );
-
-		// Call given func if any
-		if ( func ) {
-			func.call( deferred, deferred );
-		}
-
-		// All done!
-		return deferred;
-	},
-
-	// Deferred helper
-	when: function( singleValue ) {
-		var
-
-			// count of uncompleted subordinates
-			remaining = arguments.length,
-
-			// count of unprocessed arguments
-			i = remaining,
-
-			// subordinate fulfillment data
-			resolveContexts = Array( i ),
-			resolveValues = slice.call( arguments ),
-
-			// the primary Deferred
-			primary = jQuery.Deferred(),
-
-			// subordinate callback factory
-			updateFunc = function( i ) {
-				return function( value ) {
-					resolveContexts[ i ] = this;
-					resolveValues[ i ] = arguments.length > 1 ? slice.call( arguments ) : value;
-					if ( !( --remaining ) ) {
-						primary.resolveWith( resolveContexts, resolveValues );
-					}
-				};
-			};
-
-		// Single- and empty arguments are adopted like Promise.resolve
-		if ( remaining <= 1 ) {
-			adoptValue( singleValue, primary.done( updateFunc( i ) ).resolve, primary.reject,
-				!remaining );
-
-			// Use .then() to unwrap secondary thenables (cf. gh-3000)
-			if ( primary.state() === "pending" ||
-				isFunction( resolveValues[ i ] && resolveValues[ i ].then ) ) {
-
-				return primary.then();
-			}
-		}
-
-		// Multiple arguments are aggregated like Promise.all array elements
-		while ( i-- ) {
-			adoptValue( resolveValues[ i ], updateFunc( i ), primary.reject );
-		}
-
-		return primary.promise();
-	}
-} );
-
-
-// These usually indicate a programmer mistake during development,
-// warn about them ASAP rather than swallowing them by default.
-var rerrorNames = /^(Eval|Internal|Range|Reference|Syntax|Type|URI)Error$/;
-
-// If `jQuery.Deferred.getErrorHook` is defined, `asyncError` is an error
-// captured before the async barrier to get the original error cause
-// which may otherwise be hidden.
-jQuery.Deferred.exceptionHook = function( error, asyncError ) {
-
-	// Support: IE 8 - 9 only
-	// Console exists when dev tools are open, which can happen at any time
-	if ( window.console && window.console.warn && error && rerrorNames.test( error.name ) ) {
-		window.console.warn( "jQuery.Deferred exception: " + error.message,
-			error.stack, asyncError );
-	}
-};
-
-
-
-
-jQuery.readyException = function( error ) {
-	window.setTimeout( function() {
-		throw error;
-	} );
-};
-
-
-
-
-// The deferred used on DOM ready
-var readyList = jQuery.Deferred();
-
-jQuery.fn.ready = function( fn ) {
-
-	readyList
-		.then( fn )
-
-		// Wrap jQuery.readyException in a function so that the lookup
-		// happens at the time of error handling instead of callback
-		// registration.
-		.catch( function( error ) {
-			jQuery.readyException( error );
-		} );
-
-	return this;
-};
-
-jQuery.extend( {
-
-	// Is the DOM ready to be used? Set to true once it occurs.
-	isReady: false,
-
-	// A counter to track how many items to wait for before
-	// the ready event fires. See trac-6781
-	readyWait: 1,
-
-	// Handle when the DOM is ready
-	ready: function( wait ) {
-
-		// Abort if there are pending holds or we're already ready
-		if ( wait === true ? --jQuery.readyWait : jQuery.isReady ) {
-			return;
-		}
-
-		// Remember that the DOM is ready
-		jQuery.isReady = true;
-
-		// If a normal DOM Ready event fired, decrement, and wait if need be
-		if ( wait !== true && --jQuery.readyWait > 0 ) {
-			return;
-		}
-
-		// If there are functions bound, to execute
-		readyList.resolveWith( document, [ jQuery ] );
-	}
-} );
-
-jQuery.ready.then = readyList.then;
-
-// The ready event handler and self cleanup method
-function completed() {
-	document.removeEventListener( "DOMContentLoaded", completed );
-	window.removeEventListener( "load", completed );
-	jQuery.ready();
-}
-
-// Catch cases where $(document).ready() is called
-// after the browser event has already occurred.
-// Support: IE <=9 - 10 only
-// Older IE sometimes signals "interactive" too soon
-if ( document.readyState === "complete" ||
-	( document.readyState !== "loading" && !document.documentElement.doScroll ) ) {
-
-	// Handle it asynchronously to allow scripts the opportunity to delay ready
-	window.setTimeout( jQuery.ready );
-
-} else {
-
-	// Use the handy event callback
-	document.addEventListener( "DOMContentLoaded", completed );
-
-	// A fallback to window.onload, that will always work
-	window.addEventListener( "load", completed );
-}
-
-
-
-
-// Multifunctional method to get and set values of a collection
-// The value/s can optionally be executed if it's a function
-var access = function( elems, fn, key, value, chainable, emptyGet, raw ) {
-	var i = 0,
-		len = elems.length,
-		bulk = key == null;
-
-	// Sets many values
-	if ( toType( key ) === "object" ) {
-		chainable = true;
-		for ( i in key ) {
-			access( elems, fn, i, key[ i ], true, emptyGet, raw );
-		}
-
-	// Sets one value
-	} else if ( value !== undefined ) {
-		chainable = true;
-
-		if ( !isFunction( value ) ) {
-			raw = true;
-		}
-
-		if ( bulk ) {
-
-			// Bulk operations run against the entire set
-			if ( raw ) {
-				fn.call( elems, value );
-				fn = null;
-
-			// ...except when executing function values
-			} else {
-				bulk = fn;
-				fn = function( elem, _key, value ) {
-					return bulk.call( jQuery( elem ), value );
-				};
-			}
-		}
-
-		if ( fn ) {
-			for ( ; i < len; i++ ) {
-				fn(
-					elems[ i ], key, raw ?
-						value :
-						value.call( elems[ i ], i, fn( elems[ i ], key ) )
-				);
-			}
-		}
-	}
-
-	if ( chainable ) {
-		return elems;
-	}
-
-	// Gets
-	if ( bulk ) {
-		return fn.call( elems );
-	}
-
-	return len ? fn( elems[ 0 ], key ) : emptyGet;
-};
-
-
-// Matches dashed string for camelizing
-var rmsPrefix = /^-ms-/,
-	rdashAlpha = /-([a-z])/g;
-
-// Used by camelCase as callback to replace()
-function fcamelCase( _all, letter ) {
-	return letter.toUpperCase();
-}
-
-// Convert dashed to camelCase; used by the css and data modules
-// Support: IE <=9 - 11, Edge 12 - 15
-// Microsoft forgot to hump their vendor prefix (trac-9572)
-function camelCase( string ) {
-	return string.replace( rmsPrefix, "ms-" ).replace( rdashAlpha, fcamelCase );
-}
-var acceptData = function( owner ) {
-
-	// Accepts only:
-	//  - Node
-	//    - Node.ELEMENT_NODE
-	//    - Node.DOCUMENT_NODE
-	//  - Object
-	//    - Any
-	return owner.nodeType === 1 || owner.nodeType === 9 || !( +owner.nodeType );
-};
-
-
-
-
-function Data() {
-	this.expando = jQuery.expando + Data.uid++;
-}
-
-Data.uid = 1;
-
-Data.prototype = {
-
-	cache: function( owner ) {
-
-		// Check if the owner object already has a cache
-		var value = owner[ this.expando ];
-
-		// If not, create one
-		if ( !value ) {
-			value = {};
-
-			// We can accept data for non-element nodes in modern browsers,
-			// but we should not, see trac-8335.
-			// Always return an empty object.
-			if ( acceptData( owner ) ) {
-
-				// If it is a node unlikely to be stringify-ed or looped over
-				// use plain assignment
-				if ( owner.nodeType ) {
-					owner[ this.expando ] = value;
-
-				// Otherwise secure it in a non-enumerable property
-				// configurable must be true to allow the property to be
-				// deleted when data is removed
-				} else {
-					Object.defineProperty( owner, this.expando, {
-						value: value,
-						configurable: true
-					} );
-				}
-			}
-		}
-
-		return value;
-	},
-	set: function( owner, data, value ) {
-		var prop,
-			cache = this.cache( owner );
-
-		// Handle: [ owner, key, value ] args
-		// Always use camelCase key (gh-2257)
-		if ( typeof data === "string" ) {
-			cache[ camelCase( data ) ] = value;
-
-		// Handle: [ owner, { properties } ] args
-		} else {
-
-			// Copy the properties one-by-one to the cache object
-			for ( prop in data ) {
-				cache[ camelCase( prop ) ] = data[ prop ];
-			}
-		}
-		return cache;
-	},
-	get: function( owner, key ) {
-		return key === undefined ?
-			this.cache( owner ) :
-
-			// Always use camelCase key (gh-2257)
-			owner[ this.expando ] && owner[ this.expando ][ camelCase( key ) ];
-	},
-	access: function( owner, key, value ) {
-
-		// In cases where either:
-		//
-		//   1. No key was specified
-		//   2. A string key was specified, but no value provided
-		//
-		// Take the "read" path and allow the get method to determine
-		// which value to return, respectively either:
-		//
-		//   1. The entire cache object
-		//   2. The data stored at the key
-		//
-		if ( key === undefined ||
-				( ( key && typeof key === "string" ) && value === undefined ) ) {
-
-			return this.get( owner, key );
-		}
-
-		// When the key is not a string, or both a key and value
-		// are specified, set or extend (existing objects) with either:
-		//
-		//   1. An object of properties
-		//   2. A key and value
-		//
-		this.set( owner, key, value );
-
-		// Since the "set" path can have two possible entry points
-		// return the expected data based on which path was taken[*]
-		return value !== undefined ? value : key;
-	},
-	remove: function( owner, key ) {
-		var i,
-			cache = owner[ this.expando ];
-
-		if ( cache === undefined ) {
-			return;
-		}
-
-		if ( key !== undefined ) {
-
-			// Support array or space separated string of keys
-			if ( Array.isArray( key ) ) {
-
-				// If key is an array of keys...
-				// We always set camelCase keys, so remove that.
-				key = key.map( camelCase );
-			} else {
-				key = camelCase( key );
-
-				// If a key with the spaces exists, use it.
-				// Otherwise, create an array by matching non-whitespace
-				key = key in cache ?
-					[ key ] :
-					( key.match( rnothtmlwhite ) || [] );
-			}
-
-			i = key.length;
-
-			while ( i-- ) {
-				delete cache[ key[ i ] ];
-			}
-		}
-
-		// Remove the expando if there's no more data
-		if ( key === undefined || jQuery.isEmptyObject( cache ) ) {
-
-			// Support: Chrome <=35 - 45
-			// Webkit & Blink performance suffers when deleting properties
-			// from DOM nodes, so set to undefined instead
-			// https://bugs.chromium.org/p/chromium/issues/detail?id=378607 (bug restricted)
-			if ( owner.nodeType ) {
-				owner[ this.expando ] = undefined;
-			} else {
-				delete owner[ this.expando ];
-			}
-		}
-	},
-	hasData: function( owner ) {
-		var cache = owner[ this.expando ];
-		return cache !== undefined && !jQuery.isEmptyObject( cache );
-	}
-};
-var dataPriv = new Data();
-
-var dataUser = new Data();
-
-
-
-//	Implementation Summary
-//
-//	1. Enforce API surface and semantic compatibility with 1.9.x branch
-//	2. Improve the module's maintainability by reducing the storage
-//		paths to a single mechanism.
-//	3. Use the same single mechanism to support "private" and "user" data.
-//	4. _Never_ expose "private" data to user code (TODO: Drop _data, _removeData)
-//	5. Avoid exposing implementation details on user objects (eg. expando properties)
-//	6. Provide a clear path for implementation upgrade to WeakMap in 2014
-
-var rbrace = /^(?:\{[\w\W]*\}|\[[\w\W]*\])$/,
-	rmultiDash = /[A-Z]/g;
-
-function getData( data ) {
-	if ( data === "true" ) {
-		return true;
-	}
-
-	if ( data === "false" ) {
-		return false;
-	}
-
-	if ( data === "null" ) {
-		return null;
-	}
-
-	// Only convert to a number if it doesn't change the string
-	if ( data === +data + "" ) {
-		return +data;
-	}
-
-	if ( rbrace.test( data ) ) {
-		return JSON.parse( data );
-	}
-
-	return data;
-}
-
-function dataAttr( elem, key, data ) {
-	var name;
-
-	// If nothing was found internally, try to fetch any
-	// data from the HTML5 data-* attribute
-	if ( data === undefined && elem.nodeType === 1 ) {
-		name = "data-" + key.replace( rmultiDash, "-$&" ).toLowerCase();
-		data = elem.getAttribute( name );
-
-		if ( typeof data === "string" ) {
-			try {
-				data = getData( data );
-			} catch ( e ) {}
-
-			// Make sure we set the data so it isn't changed later
-			dataUser.set( elem, key, data );
-		} else {
-			data = undefined;
-		}
-	}
-	return data;
-}
-
-jQuery.extend( {
-	hasData: function( elem ) {
-		return dataUser.hasData( elem ) || dataPriv.hasData( elem );
-	},
-
-	data: function( elem, name, data ) {
-		return dataUser.access( elem, name, data );
-	},
-
-	removeData: function( elem, name ) {
-		dataUser.remove( elem, name );
-	},
-
-	// TODO: Now that all calls to _data and _removeData have been replaced
-	// with direct calls to dataPriv methods, these can be deprecated.
-	_data: function( elem, name, data ) {
-		return dataPriv.access( elem, name, data );
-	},
-
-	_removeData: function( elem, name ) {
-		dataPriv.remove( elem, name );
-	}
-} );
-
-jQuery.fn.extend( {
-	data: function( key, value ) {
-		var i, name, data,
-			elem = this[ 0 ],
-			attrs = elem && elem.attributes;
-
-		// Gets all values
-		if ( key === undefined ) {
-			if ( this.length ) {
-				data = dataUser.get( elem );
-
-				if ( elem.nodeType === 1 && !dataPriv.get( elem, "hasDataAttrs" ) ) {
-					i = attrs.length;
-					while ( i-- ) {
-
-						// Support: IE 11 only
-						// The attrs elements can be null (trac-14894)
-						if ( attrs[ i ] ) {
-							name = attrs[ i ].name;
-							if ( name.indexOf( "data-" ) === 0 ) {
-								name = camelCase( name.slice( 5 ) );
-								dataAttr( elem, name, data[ name ] );
-							}
-						}
-					}
-					dataPriv.set( elem, "hasDataAttrs", true );
-				}
-			}
-
-			return data;
-		}
-
-		// Sets multiple values
-		if ( typeof key === "object" ) {
-			return this.each( function() {
-				dataUser.set( this, key );
-			} );
-		}
-
-		return access( this, function( value ) {
-			var data;
-
-			// The calling jQuery object (element matches) is not empty
-			// (and therefore has an element appears at this[ 0 ]) and the
-			// `value` parameter was not undefined. An empty jQuery object
-			// will result in `undefined` for elem = this[ 0 ] which will
-			// throw an exception if an attempt to read a data cache is made.
-			if ( elem && value === undefined ) {
-
-				// Attempt to get data from the cache
-				// The key will always be camelCased in Data
-				data = dataUser.get( elem, key );
-				if ( data !== undefined ) {
-					return data;
-				}
-
-				// Attempt to "discover" the data in
-				// HTML5 custom data-* attrs
-				data = dataAttr( elem, key );
-				if ( data !== undefined ) {
-					return data;
-				}
-
-				// We tried really hard, but the data doesn't exist.
-				return;
-			}
-
-			// Set the data...
-			this.each( function() {
-
-				// We always store the camelCased key
-				dataUser.set( this, key, value );
-			} );
-		}, null, value, arguments.length > 1, null, true );
-	},
-
-	removeData: function( key ) {
-		return this.each( function() {
-			dataUser.remove( this, key );
-		} );
-	}
-} );
-
-
-jQuery.extend( {
-	queue: function( elem, type, data ) {
-		var queue;
-
-		if ( elem ) {
-			type = ( type || "fx" ) + "queue";
-			queue = dataPriv.get( elem, type );
-
-			// Speed up dequeue by getting out quickly if this is just a lookup
-			if ( data ) {
-				if ( !queue || Array.isArray( data ) ) {
-					queue = dataPriv.access( elem, type, jQuery.makeArray( data ) );
-				} else {
-					queue.push( data );
-				}
-			}
-			return queue || [];
-		}
-	},
-
-	dequeue: function( elem, type ) {
-		type = type || "fx";
-
-		var queue = jQuery.queue( elem, type ),
-			startLength = queue.length,
-			fn = queue.shift(),
-			hooks = jQuery._queueHooks( elem, type ),
-			next = function() {
-				jQuery.dequeue( elem, type );
-			};
-
-		// If the fx queue is dequeued, always remove the progress sentinel
-		if ( fn === "inprogress" ) {
-			fn = queue.shift();
-			startLength--;
-		}
-
-		if ( fn ) {
-
-			// Add a progress sentinel to prevent the fx queue from being
-			// automatically dequeued
-			if ( type === "fx" ) {
-				queue.unshift( "inprogress" );
-			}
-
-			// Clear up the last queue stop function
-			delete hooks.stop;
-			fn.call( elem, next, hooks );
-		}
-
-		if ( !startLength && hooks ) {
-			hooks.empty.fire();
-		}
-	},
-
-	// Not public - generate a queueHooks object, or return the current one
-	_queueHooks: function( elem, type ) {
-		var key = type + "queueHooks";
-		return dataPriv.get( elem, key ) || dataPriv.access( elem, key, {
-			empty: jQuery.Callbacks( "once memory" ).add( function() {
-				dataPriv.remove( elem, [ type + "queue", key ] );
-			} )
-		} );
-	}
-} );
-
-jQuery.fn.extend( {
-	queue: function( type, data ) {
-		var setter = 2;
-
-		if ( typeof type !== "string" ) {
-			data = type;
-			type = "fx";
-			setter--;
-		}
-
-		if ( arguments.length < setter ) {
-			return jQuery.queue( this[ 0 ], type );
-		}
-
-		return data === undefined ?
-			this :
-			this.each( function() {
-				var queue = jQuery.queue( this, type, data );
-
-				// Ensure a hooks for this queue
-				jQuery._queueHooks( this, type );
-
-				if ( type === "fx" && queue[ 0 ] !== "inprogress" ) {
-					jQuery.dequeue( this, type );
-				}
-			} );
-	},
-	dequeue: function( type ) {
-		return this.each( function() {
-			jQuery.dequeue( this, type );
-		} );
-	},
-	clearQueue: function( type ) {
-		return this.queue( type || "fx", [] );
-	},
-
-	// Get a promise resolved when queues of a certain type
-	// are emptied (fx is the type by default)
-	promise: function( type, obj ) {
-		var tmp,
-			count = 1,
-			defer = jQuery.Deferred(),
-			elements = this,
-			i = this.length,
-			resolve = function() {
-				if ( !( --count ) ) {
-					defer.resolveWith( elements, [ elements ] );
-				}
-			};
-
-		if ( typeof type !== "string" ) {
-			obj = type;
-			type = undefined;
-		}
-		type = type || "fx";
-
-		while ( i-- ) {
-			tmp = dataPriv.get( elements[ i ], type + "queueHooks" );
-			if ( tmp && tmp.empty ) {
-				count++;
-				tmp.empty.add( resolve );
-			}
-		}
-		resolve();
-		return defer.promise( obj );
-	}
-} );
-var pnum = ( /[+-]?(?:\d*\.|)\d+(?:[eE][+-]?\d+|)/ ).source;
-
-var rcssNum = new RegExp( "^(?:([+-])=|)(" + pnum + ")([a-z%]*)$", "i" );
-
-
-var cssExpand = [ "Top", "Right", "Bottom", "Left" ];
-
-var documentElement = document.documentElement;
-
-
-
-	var isAttached = function( elem ) {
-			return jQuery.contains( elem.ownerDocument, elem );
-		},
-		composed = { composed: true };
-
-	// Support: IE 9 - 11+, Edge 12 - 18+, iOS 10.0 - 10.2 only
-	// Check attachment across shadow DOM boundaries when possible (gh-3504)
-	// Support: iOS 10.0-10.2 only
-	// Early iOS 10 versions support `attachShadow` but not `getRootNode`,
-	// leading to errors. We need to check for `getRootNode`.
-	if ( documentElement.getRootNode ) {
-		isAttached = function( elem ) {
-			return jQuery.contains( elem.ownerDocument, elem ) ||
-				elem.getRootNode( composed ) === elem.ownerDocument;
-		};
-	}
-var isHiddenWithinTree = function( elem, el ) {
-
-		// isHiddenWithinTree might be called from jQuery#filter function;
-		// in that case, element will be second argument
-		elem = el || elem;
-
-		// Inline style trumps all
-		return elem.style.display === "none" ||
-			elem.style.display === "" &&
-
-			// Otherwise, check computed style
-			// Support: Firefox <=43 - 45
-			// Disconnected elements can have computed display: none, so first confirm that elem is
-			// in the document.
-			isAttached( elem ) &&
-
-			jQuery.css( elem, "display" ) === "none";
-	};
-
-
-
-function adjustCSS( elem, prop, valueParts, tween ) {
-	var adjusted, scale,
-		maxIterations = 20,
-		currentValue = tween ?
-			function() {
-				return tween.cur();
-			} :
-			function() {
-				return jQuery.css( elem, prop, "" );
-			},
-		initial = currentValue(),
-		unit = valueParts && valueParts[ 3 ] || ( jQuery.cssNumber[ prop ] ? "" : "px" ),
-
-		// Starting value computation is required for potential unit mismatches
-		initialInUnit = elem.nodeType &&
-			( jQuery.cssNumber[ prop ] || unit !== "px" && +initial ) &&
-			rcssNum.exec( jQuery.css( elem, prop ) );
-
-	if ( initialInUnit && initialInUnit[ 3 ] !== unit ) {
-
-		// Support: Firefox <=54
-		// Halve the iteration target value to prevent interference from CSS upper bounds (gh-2144)
-		initial = initial / 2;
-
-		// Trust units reported by jQuery.css
-		unit = unit || initialInUnit[ 3 ];
-
-		// Iteratively approximate from a nonzero starting point
-		initialInUnit = +initial || 1;
-
-		while ( maxIterations-- ) {
-
-			// Evaluate and update our best guess (doubling guesses that zero out).
-			// Finish if the scale equals or crosses 1 (making the old*new product non-positive).
-			jQuery.style( elem, prop, initialInUnit + unit );
-			if ( ( 1 - scale ) * ( 1 - ( scale = currentValue() / initial || 0.5 ) ) <= 0 ) {
-				maxIterations = 0;
-			}
-			initialInUnit = initialInUnit / scale;
-
-		}
-
-		initialInUnit = initialInUnit * 2;
-		jQuery.style( elem, prop, initialInUnit + unit );
-
-		// Make sure we update the tween properties later on
-		valueParts = valueParts || [];
-	}
-
-	if ( valueParts ) {
-		initialInUnit = +initialInUnit || +initial || 0;
-
-		// Apply relative offset (+=/-=) if specified
-		adjusted = valueParts[ 1 ] ?
-			initialInUnit + ( valueParts[ 1 ] + 1 ) * valueParts[ 2 ] :
-			+valueParts[ 2 ];
-		if ( tween ) {
-			tween.unit = unit;
-			tween.start = initialInUnit;
-			tween.end = adjusted;
-		}
-	}
-	return adjusted;
-}
-
-
-var defaultDisplayMap = {};
-
-function getDefaultDisplay( elem ) {
-	var temp,
-		doc = elem.ownerDocument,
-		nodeName = elem.nodeName,
-		display = defaultDisplayMap[ nodeName ];
-
-	if ( display ) {
-		return display;
-	}
-
-	temp = doc.body.appendChild( doc.createElement( nodeName ) );
-	display = jQuery.css( temp, "display" );
-
-	temp.parentNode.removeChild( temp );
-
-	if ( display === "none" ) {
-		display = "block";
-	}
-	defaultDisplayMap[ nodeName ] = display;
-
-	return display;
-}
-
-function showHide( elements, show ) {
-	var display, elem,
-		values = [],
-		index = 0,
-		length = elements.length;
-
-	// Determine new display value for elements that need to change
-	for ( ; index < length; index++ ) {
-		elem = elements[ index ];
-		if ( !elem.style ) {
-			continue;
-		}
-
-		display = elem.style.display;
-		if ( show ) {
-
-			// Since we force visibility upon cascade-hidden elements, an immediate (and slow)
-			// check is required in this first loop unless we have a nonempty display value (either
-			// inline or about-to-be-restored)
-			if ( display === "none" ) {
-				values[ index ] = dataPriv.get( elem, "display" ) || null;
-				if ( !values[ index ] ) {
-					elem.style.display = "";
-				}
-			}
-			if ( elem.style.display === "" && isHiddenWithinTree( elem ) ) {
-				values[ index ] = getDefaultDisplay( elem );
-			}
-		} else {
-			if ( display !== "none" ) {
-				values[ index ] = "none";
-
-				// Remember what we're overwriting
-				dataPriv.set( elem, "display", display );
-			}
-		}
-	}
-
-	// Set the display of the elements in a second loop to avoid constant reflow
-	for ( index = 0; index < length; index++ ) {
-		if ( values[ index ] != null ) {
-			elements[ index ].style.display = values[ index ];
-		}
-	}
-
-	return elements;
-}
-
-jQuery.fn.extend( {
-	show: function() {
-		return showHide( this, true );
-	},
-	hide: function() {
-		return showHide( this );
-	},
-	toggle: function( state ) {
-		if ( typeof state === "boolean" ) {
-			return state ? this.show() : this.hide();
-		}
-
-		return this.each( function() {
-			if ( isHiddenWithinTree( this ) ) {
-				jQuery( this ).show();
-			} else {
-				jQuery( this ).hide();
-			}
-		} );
-	}
-} );
-var rcheckableType = ( /^(?:checkbox|radio)$/i );
-
-var rtagName = ( /<([a-z][^\/\0>\x20\t\r\n\f]*)/i );
-
-var rscriptType = ( /^$|^module$|\/(?:java|ecma)script/i );
-
-
-
-( function() {
-	var fragment = document.createDocumentFragment(),
-		div = fragment.appendChild( document.createElement( "div" ) ),
-		input = document.createElement( "input" );
-
-	// Support: Android 4.0 - 4.3 only
-	// Check state lost if the name is set (trac-11217)
-	// Support: Windows Web Apps (WWA)
-	// `name` and `type` must use .setAttribute for WWA (trac-14901)
-	input.setAttribute( "type", "radio" );
-	input.setAttribute( "checked", "checked" );
-	input.setAttribute( "name", "t" );
-
-	div.appendChild( input );
-
-	// Support: Android <=4.1 only
-	// Older WebKit doesn't clone checked state correctly in fragments
-	support.checkClone = div.cloneNode( true ).cloneNode( true ).lastChild.checked;
-
-	// Support: IE <=11 only
-	// Make sure textarea (and checkbox) defaultValue is properly cloned
-	div.innerHTML = "<textarea>x</textarea>";
-	support.noCloneChecked = !!div.cloneNode( true ).lastChild.defaultValue;
-
-	// Support: IE <=9 only
-	// IE <=9 replaces <option> tags with their contents when inserted outside of
-	// the select element.
-	div.innerHTML = "<option></option>";
-	support.option = !!div.lastChild;
-} )();
-
-
-// We have to close these tags to support XHTML (trac-13200)
-var wrapMap = {
-
-	// XHTML parsers do not magically insert elements in the
-	// same way that tag soup parsers do. So we cannot shorten
-	// this by omitting <tbody> or other required elements.
-	thead: [ 1, "<table>", "</table>" ],
-	col: [ 2, "<table><colgroup>", "</colgroup></table>" ],
-	tr: [ 2, "<table><tbody>", "</tbody></table>" ],
-	td: [ 3, "<table><tbody><tr>", "</tr></tbody></table>" ],
-
-	_default: [ 0, "", "" ]
-};
-
-wrapMap.tbody = wrapMap.tfoot = wrapMap.colgroup = wrapMap.caption = wrapMap.thead;
-wrapMap.th = wrapMap.td;
-
-// Support: IE <=9 only
-if ( !support.option ) {
-	wrapMap.optgroup = wrapMap.option = [ 1, "<select multiple='multiple'>", "</select>" ];
-}
-
-
-function getAll( context, tag ) {
-
-	// Support: IE <=9 - 11 only
-	// Use typeof to avoid zero-argument method invocation on host objects (trac-15151)
-	var ret;
-
-	if ( typeof context.getElementsByTagName !== "undefined" ) {
-		ret = context.getElementsByTagName( tag || "*" );
-
-	} else if ( typeof context.querySelectorAll !== "undefined" ) {
-		ret = context.querySelectorAll( tag || "*" );
-
-	} else {
-		ret = [];
-	}
-
-	if ( tag === undefined || tag && nodeName( context, tag ) ) {
-		return jQuery.merge( [ context ], ret );
-	}
-
-	return ret;
-}
-
-
-// Mark scripts as having already been evaluated
-function setGlobalEval( elems, refElements ) {
-	var i = 0,
-		l = elems.length;
-
-	for ( ; i < l; i++ ) {
-		dataPriv.set(
-			elems[ i ],
-			"globalEval",
-			!refElements || dataPriv.get( refElements[ i ], "globalEval" )
-		);
-	}
-}
-
-
-var rhtml = /<|&#?\w+;/;
-
-function buildFragment( elems, context, scripts, selection, ignored ) {
-	var elem, tmp, tag, wrap, attached, j,
-		fragment = context.createDocumentFragment(),
-		nodes = [],
-		i = 0,
-		l = elems.length;
-
-	for ( ; i < l; i++ ) {
-		elem = elems[ i ];
-
-		if ( elem || elem === 0 ) {
-
-			// Add nodes directly
-			if ( toType( elem ) === "object" ) {
-
-				// Support: Android <=4.0 only, PhantomJS 1 only
-				// push.apply(_, arraylike) throws on ancient WebKit
-				jQuery.merge( nodes, elem.nodeType ? [ elem ] : elem );
-
-			// Convert non-html into a text node
-			} else if ( !rhtml.test( elem ) ) {
-				nodes.push( context.createTextNode( elem ) );
-
-			// Convert html into DOM nodes
-			} else {
-				tmp = tmp || fragment.appendChild( context.createElement( "div" ) );
-
-				// Deserialize a standard representation
-				tag = ( rtagName.exec( elem ) || [ "", "" ] )[ 1 ].toLowerCase();
-				wrap = wrapMap[ tag ] || wrapMap._default;
-				tmp.innerHTML = wrap[ 1 ] + jQuery.htmlPrefilter( elem ) + wrap[ 2 ];
-
-				// Descend through wrappers to the right content
-				j = wrap[ 0 ];
-				while ( j-- ) {
-					tmp = tmp.lastChild;
-				}
-
-				// Support: Android <=4.0 only, PhantomJS 1 only
-				// push.apply(_, arraylike) throws on ancient WebKit
-				jQuery.merge( nodes, tmp.childNodes );
-
-				// Remember the top-level container
-				tmp = fragment.firstChild;
-
-				// Ensure the created nodes are orphaned (trac-12392)
-				tmp.textContent = "";
-			}
-		}
-	}
-
-	// Remove wrapper from fragment
-	fragment.textContent = "";
-
-	i = 0;
-	while ( ( elem = nodes[ i++ ] ) ) {
-
-		// Skip elements already in the context collection (trac-4087)
-		if ( selection && jQuery.inArray( elem, selection ) > -1 ) {
-			if ( ignored ) {
-				ignored.push( elem );
-			}
-			continue;
-		}
-
-		attached = isAttached( elem );
-
-		// Append to fragment
-		tmp = getAll( fragment.appendChild( elem ), "script" );
-
-		// Preserve script evaluation history
-		if ( attached ) {
-			setGlobalEval( tmp );
-		}
-
-		// Capture executables
-		if ( scripts ) {
-			j = 0;
-			while ( ( elem = tmp[ j++ ] ) ) {
-				if ( rscriptType.test( elem.type || "" ) ) {
-					scripts.push( elem );
-				}
-			}
-		}
-	}
-
-	return fragment;
-}
-
-
-var rtypenamespace = /^([^.]*)(?:\.(.+)|)/;
-
-function returnTrue() {
-	return true;
-}
-
-function returnFalse() {
-	return false;
-}
-
-function on( elem, types, selector, data, fn, one ) {
-	var origFn, type;
-
-	// Types can be a map of types/handlers
-	if ( typeof types === "object" ) {
-
-		// ( types-Object, selector, data )
-		if ( typeof selector !== "string" ) {
-
-			// ( types-Object, data )
-			data = data || selector;
-			selector = undefined;
-		}
-		for ( type in types ) {
-			on( elem, type, selector, data, types[ type ], one );
-		}
-		return elem;
-	}
-
-	if ( data == null && fn == null ) {
-
-		// ( types, fn )
-		fn = selector;
-		data = selector = undefined;
-	} else if ( fn == null ) {
-		if ( typeof selector === "string" ) {
-
-			// ( types, selector, fn )
-			fn = data;
-			data = undefined;
-		} else {
-
-			// ( types, data, fn )
-			fn = data;
-			data = selector;
-			selector = undefined;
-		}
-	}
-	if ( fn === false ) {
-		fn = returnFalse;
-	} else if ( !fn ) {
-		return elem;
-	}
-
-	if ( one === 1 ) {
-		origFn = fn;
-		fn = function( event ) {
-
-			// Can use an empty set, since event contains the info
-			jQuery().off( event );
-			return origFn.apply( this, arguments );
-		};
-
-		// Use same guid so caller can remove using origFn
-		fn.guid = origFn.guid || ( origFn.guid = jQuery.guid++ );
-	}
-	return elem.each( function() {
-		jQuery.event.add( this, types, fn, data, selector );
-	} );
-}
-
-/*
- * Helper functions for managing events -- not part of the public interface.
- * Props to Dean Edwards' addEvent library for many of the ideas.
- */
-jQuery.event = {
-
-	global: {},
-
-	add: function( elem, types, handler, data, selector ) {
-
-		var handleObjIn, eventHandle, tmp,
-			events, t, handleObj,
-			special, handlers, type, namespaces, origType,
-			elemData = dataPriv.get( elem );
-
-		// Only attach events to objects that accept data
-		if ( !acceptData( elem ) ) {
-			return;
-		}
-
-		// Caller can pass in an object of custom data in lieu of the handler
-		if ( handler.handler ) {
-			handleObjIn = handler;
-			handler = handleObjIn.handler;
-			selector = handleObjIn.selector;
-		}
-
-		// Ensure that invalid selectors throw exceptions at attach time
-		// Evaluate against documentElement in case elem is a non-element node (e.g., document)
-		if ( selector ) {
-			jQuery.find.matchesSelector( documentElement, selector );
-		}
-
-		// Make sure that the handler has a unique ID, used to find/remove it later
-		if ( !handler.guid ) {
-			handler.guid = jQuery.guid++;
-		}
-
-		// Init the element's event structure and main handler, if this is the first
-		if ( !( events = elemData.events ) ) {
-			events = elemData.events = Object.create( null );
-		}
-		if ( !( eventHandle = elemData.handle ) ) {
-			eventHandle = elemData.handle = function( e ) {
-
-				// Discard the second event of a jQuery.event.trigger() and
-				// when an event is called after a page has unloaded
-				return typeof jQuery !== "undefined" && jQuery.event.triggered !== e.type ?
-					jQuery.event.dispatch.apply( elem, arguments ) : undefined;
-			};
-		}
-
-		// Handle multiple events separated by a space
-		types = ( types || "" ).match( rnothtmlwhite ) || [ "" ];
-		t = types.length;
-		while ( t-- ) {
-			tmp = rtypenamespace.exec( types[ t ] ) || [];
-			type = origType = tmp[ 1 ];
-			namespaces = ( tmp[ 2 ] || "" ).split( "." ).sort();
-
-			// There *must* be a type, no attaching namespace-only handlers
-			if ( !type ) {
-				continue;
-			}
-
-			// If event changes its type, use the special event handlers for the changed type
-			special = jQuery.event.special[ type ] || {};
-
-			// If selector defined, determine special event api type, otherwise given type
-			type = ( selector ? special.delegateType : special.bindType ) || type;
-
-			// Update special based on newly reset type
-			special = jQuery.event.special[ type ] || {};
-
-			// handleObj is passed to all event handlers
-			handleObj = jQuery.extend( {
-				type: type,
-				origType: origType,
-				data: data,
-				handler: handler,
-				guid: handler.guid,
-				selector: selector,
-				needsContext: selector && jQuery.expr.match.needsContext.test( selector ),
-				namespace: namespaces.join( "." )
-			}, handleObjIn );
-
-			// Init the event handler queue if we're the first
-			if ( !( handlers = events[ type ] ) ) {
-				handlers = events[ type ] = [];
-				handlers.delegateCount = 0;
-
-				// Only use addEventListener if the special events handler returns false
-				if ( !special.setup ||
-					special.setup.call( elem, data, namespaces, eventHandle ) === false ) {
-
-					if ( elem.addEventListener ) {
-						elem.addEventListener( type, eventHandle );
-					}
-				}
-			}
-
-			if ( special.add ) {
-				special.add.call( elem, handleObj );
-
-				if ( !handleObj.handler.guid ) {
-					handleObj.handler.guid = handler.guid;
-				}
-			}
-
-			// Add to the element's handler list, delegates in front
-			if ( selector ) {
-				handlers.splice( handlers.delegateCount++, 0, handleObj );
-			} else {
-				handlers.push( handleObj );
-			}
-
-			// Keep track of which events have ever been used, for event optimization
-			jQuery.event.global[ type ] = true;
-		}
-
-	},
-
-	// Detach an event or set of events from an element
-	remove: function( elem, types, handler, selector, mappedTypes ) {
-
-		var j, origCount, tmp,
-			events, t, handleObj,
-			special, handlers, type, namespaces, origType,
-			elemData = dataPriv.hasData( elem ) && dataPriv.get( elem );
-
-		if ( !elemData || !( events = elemData.events ) ) {
-			return;
-		}
-
-		// Once for each type.namespace in types; type may be omitted
-		types = ( types || "" ).match( rnothtmlwhite ) || [ "" ];
-		t = types.length;
-		while ( t-- ) {
-			tmp = rtypenamespace.exec( types[ t ] ) || [];
-			type = origType = tmp[ 1 ];
-			namespaces = ( tmp[ 2 ] || "" ).split( "." ).sort();
-
-			// Unbind all events (on this namespace, if provided) for the element
-			if ( !type ) {
-				for ( type in events ) {
-					jQuery.event.remove( elem, type + types[ t ], handler, selector, true );
-				}
-				continue;
-			}
-
-			special = jQuery.event.special[ type ] || {};
-			type = ( selector ? special.delegateType : special.bindType ) || type;
-			handlers = events[ type ] || [];
-			tmp = tmp[ 2 ] &&
-				new RegExp( "(^|\\.)" + namespaces.join( "\\.(?:.*\\.|)" ) + "(\\.|$)" );
-
-			// Remove matching events
-			origCount = j = handlers.length;
-			while ( j-- ) {
-				handleObj = handlers[ j ];
-
-				if ( ( mappedTypes || origType === handleObj.origType ) &&
-					( !handler || handler.guid === handleObj.guid ) &&
-					( !tmp || tmp.test( handleObj.namespace ) ) &&
-					( !selector || selector === handleObj.selector ||
-						selector === "**" && handleObj.selector ) ) {
-					handlers.splice( j, 1 );
-
-					if ( handleObj.selector ) {
-						handlers.delegateCount--;
-					}
-					if ( special.remove ) {
-						special.remove.call( elem, handleObj );
-					}
-				}
-			}
-
-			// Remove generic event handler if we removed something and no more handlers exist
-			// (avoids potential for endless recursion during removal of special event handlers)
-			if ( origCount && !handlers.length ) {
-				if ( !special.teardown ||
-					special.teardown.call( elem, namespaces, elemData.handle ) === false ) {
-
-					jQuery.removeEvent( elem, type, elemData.handle );
-				}
-
-				delete events[ type ];
-			}
-		}
-
-		// Remove data and the expando if it's no longer used
-		if ( jQuery.isEmptyObject( events ) ) {
-			dataPriv.remove( elem, "handle events" );
-		}
-	},
-
-	dispatch: function( nativeEvent ) {
-
-		var i, j, ret, matched, handleObj, handlerQueue,
-			args = new Array( arguments.length ),
-
-			// Make a writable jQuery.Event from the native event object
-			event = jQuery.event.fix( nativeEvent ),
-
-			handlers = (
-				dataPriv.get( this, "events" ) || Object.create( null )
-			)[ event.type ] || [],
-			special = jQuery.event.special[ event.type ] || {};
-
-		// Use the fix-ed jQuery.Event rather than the (read-only) native event
-		args[ 0 ] = event;
-
-		for ( i = 1; i < arguments.length; i++ ) {
-			args[ i ] = arguments[ i ];
-		}
-
-		event.delegateTarget = this;
-
-		// Call the preDispatch hook for the mapped type, and let it bail if desired
-		if ( special.preDispatch && special.preDispatch.call( this, event ) === false ) {
-			return;
-		}
-
-		// Determine handlers
-		handlerQueue = jQuery.event.handlers.call( this, event, handlers );
-
-		// Run delegates first; they may want to stop propagation beneath us
-		i = 0;
-		while ( ( matched = handlerQueue[ i++ ] ) && !event.isPropagationStopped() ) {
-			event.currentTarget = matched.elem;
-
-			j = 0;
-			while ( ( handleObj = matched.handlers[ j++ ] ) &&
-				!event.isImmediatePropagationStopped() ) {
-
-				// If the event is namespaced, then each handler is only invoked if it is
-				// specially universal or its namespaces are a superset of the event's.
-				if ( !event.rnamespace || handleObj.namespace === false ||
-					event.rnamespace.test( handleObj.namespace ) ) {
-
-					event.handleObj = handleObj;
-					event.data = handleObj.data;
-
-					ret = ( ( jQuery.event.special[ handleObj.origType ] || {} ).handle ||
-						handleObj.handler ).apply( matched.elem, args );
-
-					if ( ret !== undefined ) {
-						if ( ( event.result = ret ) === false ) {
-							event.preventDefault();
-							event.stopPropagation();
-						}
-					}
-				}
-			}
-		}
-
-		// Call the postDispatch hook for the mapped type
-		if ( special.postDispatch ) {
-			special.postDispatch.call( this, event );
-		}
-
-		return event.result;
-	},
-
-	handlers: function( event, handlers ) {
-		var i, handleObj, sel, matchedHandlers, matchedSelectors,
-			handlerQueue = [],
-			delegateCount = handlers.delegateCount,
-			cur = event.target;
-
-		// Find delegate handlers
-		if ( delegateCount &&
-
-			// Support: IE <=9
-			// Black-hole SVG <use> instance trees (trac-13180)
-			cur.nodeType &&
-
-			// Support: Firefox <=42
-			// Suppress spec-violating clicks indicating a non-primary pointer button (trac-3861)
-			// https://www.w3.org/TR/DOM-Level-3-Events/#event-type-click
-			// Support: IE 11 only
-			// ...but not arrow key "clicks" of radio inputs, which can have `button` -1 (gh-2343)
-			!( event.type === "click" && event.button >= 1 ) ) {
-
-			for ( ; cur !== this; cur = cur.parentNode || this ) {
-
-				// Don't check non-elements (trac-13208)
-				// Don't process clicks on disabled elements (trac-6911, trac-8165, trac-11382, trac-11764)
-				if ( cur.nodeType === 1 && !( event.type === "click" && cur.disabled === true ) ) {
-					matchedHandlers = [];
-					matchedSelectors = {};
-					for ( i = 0; i < delegateCount; i++ ) {
-						handleObj = handlers[ i ];
-
-						// Don't conflict with Object.prototype properties (trac-13203)
-						sel = handleObj.selector + " ";
-
-						if ( matchedSelectors[ sel ] === undefined ) {
-							matchedSelectors[ sel ] = handleObj.needsContext ?
-								jQuery( sel, this ).index( cur ) > -1 :
-								jQuery.find( sel, this, null, [ cur ] ).length;
-						}
-						if ( matchedSelectors[ sel ] ) {
-							matchedHandlers.push( handleObj );
-						}
-					}
-					if ( matchedHandlers.length ) {
-						handlerQueue.push( { elem: cur, handlers: matchedHandlers } );
-					}
-				}
-			}
-		}
-
-		// Add the remaining (directly-bound) handlers
-		cur = this;
-		if ( delegateCount < handlers.length ) {
-			handlerQueue.push( { elem: cur, handlers: handlers.slice( delegateCount ) } );
-		}
-
-		return handlerQueue;
-	},
-
-	addProp: function( name, hook ) {
-		Object.defineProperty( jQuery.Event.prototype, name, {
-			enumerable: true,
-			configurable: true,
-
-			get: isFunction( hook ) ?
-				function() {
-					if ( this.originalEvent ) {
-						return hook( this.originalEvent );
-					}
-				} :
-				function() {
-					if ( this.originalEvent ) {
-						return this.originalEvent[ name ];
-					}
-				},
-
-			set: function( value ) {
-				Object.defineProperty( this, name, {
-					enumerable: true,
-					configurable: true,
-					writable: true,
-					value: value
-				} );
-			}
-		} );
-	},
-
-	fix: function( originalEvent ) {
-		return originalEvent[ jQuery.expando ] ?
-			originalEvent :
-			new jQuery.Event( originalEvent );
-	},
-
-	special: {
-		load: {
-
-			// Prevent triggered image.load events from bubbling to window.load
-			noBubble: true
-		},
-		click: {
-
-			// Utilize native event to ensure correct state for checkable inputs
-			setup: function( data ) {
-
-				// For mutual compressibility with _default, replace `this` access with a local var.
-				// `|| data` is dead code meant only to preserve the variable through minification.
-				var el = this || data;
-
-				// Claim the first handler
-				if ( rcheckableType.test( el.type ) &&
-					el.click && nodeName( el, "input" ) ) {
-
-					// dataPriv.set( el, "click", ... )
-					leverageNative( el, "click", true );
-				}
-
-				// Return false to allow normal processing in the caller
-				return false;
-			},
-			trigger: function( data ) {
-
-				// For mutual compressibility with _default, replace `this` access with a local var.
-				// `|| data` is dead code meant only to preserve the variable through minification.
-				var el = this || data;
-
-				// Force setup before triggering a click
-				if ( rcheckableType.test( el.type ) &&
-					el.click && nodeName( el, "input" ) ) {
-
-					leverageNative( el, "click" );
-				}
-
-				// Return non-false to allow normal event-path propagation
-				return true;
-			},
-
-			// For cross-browser consistency, suppress native .click() on links
-			// Also prevent it if we're currently inside a leveraged native-event stack
-			_default: function( event ) {
-				var target = event.target;
-				return rcheckableType.test( target.type ) &&
-					target.click && nodeName( target, "input" ) &&
-					dataPriv.get( target, "click" ) ||
-					nodeName( target, "a" );
-			}
-		},
-
-		beforeunload: {
-			postDispatch: function( event ) {
-
-				// Support: Firefox 20+
-				// Firefox doesn't alert if the returnValue field is not set.
-				if ( event.result !== undefined && event.originalEvent ) {
-					event.originalEvent.returnValue = event.result;
-				}
-			}
-		}
-	}
-};
-
-// Ensure the presence of an event listener that handles manually-triggered
-// synthetic events by interrupting progress until reinvoked in response to
-// *native* events that it fires directly, ensuring that state changes have
-// already occurred before other listeners are invoked.
-function leverageNative( el, type, isSetup ) {
-
-	// Missing `isSetup` indicates a trigger call, which must force setup through jQuery.event.add
-	if ( !isSetup ) {
-		if ( dataPriv.get( el, type ) === undefined ) {
-			jQuery.event.add( el, type, returnTrue );
-		}
-		return;
-	}
-
-	// Register the controller as a special universal handler for all event namespaces
-	dataPriv.set( el, type, false );
-	jQuery.event.add( el, type, {
-		namespace: false,
-		handler: function( event ) {
-			var result,
-				saved = dataPriv.get( this, type );
-
-			if ( ( event.isTrigger & 1 ) && this[ type ] ) {
-
-				// Interrupt processing of the outer synthetic .trigger()ed event
-				if ( !saved ) {
-
-					// Store arguments for use when handling the inner native event
-					// There will always be at least one argument (an event object), so this array
-					// will not be confused with a leftover capture object.
-					saved = slice.call( arguments );
-					dataPriv.set( this, type, saved );
-
-					// Trigger the native event and capture its result
-					this[ type ]();
-					result = dataPriv.get( this, type );
-					dataPriv.set( this, type, false );
-
-					if ( saved !== result ) {
-
-						// Cancel the outer synthetic event
-						event.stopImmediatePropagation();
-						event.preventDefault();
-
-						return result;
-					}
-
-				// If this is an inner synthetic event for an event with a bubbling surrogate
-				// (focus or blur), assume that the surrogate already propagated from triggering
-				// the native event and prevent that from happening again here.
-				// This technically gets the ordering wrong w.r.t. to `.trigger()` (in which the
-				// bubbling surrogate propagates *after* the non-bubbling base), but that seems
-				// less bad than duplication.
-				} else if ( ( jQuery.event.special[ type ] || {} ).delegateType ) {
-					event.stopPropagation();
-				}
-
-			// If this is a native event triggered above, everything is now in order
-			// Fire an inner synthetic event with the original arguments
-			} else if ( saved ) {
-
-				// ...and capture the result
-				dataPriv.set( this, type, jQuery.event.trigger(
-					saved[ 0 ],
-					saved.slice( 1 ),
-					this
-				) );
-
-				// Abort handling of the native event by all jQuery handlers while allowing
-				// native handlers on the same element to run. On target, this is achieved
-				// by stopping immediate propagation just on the jQuery event. However,
-				// the native event is re-wrapped by a jQuery one on each level of the
-				// propagation so the only way to stop it for jQuery is to stop it for
-				// everyone via native `stopPropagation()`. This is not a problem for
-				// focus/blur which don't bubble, but it does also stop click on checkboxes
-				// and radios. We accept this limitation.
-				event.stopPropagation();
-				event.isImmediatePropagationStopped = returnTrue;
-			}
-		}
-	} );
-}
-
-jQuery.removeEvent = function( elem, type, handle ) {
-
-	// This "if" is needed for plain objects
-	if ( elem.removeEventListener ) {
-		elem.removeEventListener( type, handle );
-	}
-};
-
-jQuery.Event = function( src, props ) {
-
-	// Allow instantiation without the 'new' keyword
-	if ( !( this instanceof jQuery.Event ) ) {
-		return new jQuery.Event( src, props );
-	}
-
-	// Event object
-	if ( src && src.type ) {
-		this.originalEvent = src;
-		this.type = src.type;
-
-		// Events bubbling up the document may have been marked as prevented
-		// by a handler lower down the tree; reflect the correct value.
-		this.isDefaultPrevented = src.defaultPrevented ||
-				src.defaultPrevented === undefined &&
-
-				// Support: Android <=2.3 only
-				src.returnValue === false ?
-			returnTrue :
-			returnFalse;
-
-		// Create target properties
-		// Support: Safari <=6 - 7 only
-		// Target should not be a text node (trac-504, trac-13143)
-		this.target = ( src.target && src.target.nodeType === 3 ) ?
-			src.target.parentNode :
-			src.target;
-
-		this.currentTarget = src.currentTarget;
-		this.relatedTarget = src.relatedTarget;
-
-	// Event type
-	} else {
-		this.type = src;
-	}
-
-	// Put explicitly provided properties onto the event object
-	if ( props ) {
-		jQuery.extend( this, props );
-	}
-
-	// Create a timestamp if incoming event doesn't have one
-	this.timeStamp = src && src.timeStamp || Date.now();
-
-	// Mark it as fixed
-	this[ jQuery.expando ] = true;
-};
-
-// jQuery.Event is based on DOM3 Events as specified by the ECMAScript Language Binding
-// https://www.w3.org/TR/2003/WD-DOM-Level-3-Events-20030331/ecma-script-binding.html
-jQuery.Event.prototype = {
-	constructor: jQuery.Event,
-	isDefaultPrevented: returnFalse,
-	isPropagationStopped: returnFalse,
-	isImmediatePropagationStopped: returnFalse,
-	isSimulated: false,
-
-	preventDefault: function() {
-		var e = this.originalEvent;
-
-		this.isDefaultPrevented = returnTrue;
-
-		if ( e && !this.isSimulated ) {
-			e.preventDefault();
-		}
-	},
-	stopPropagation: function() {
-		var e = this.originalEvent;
-
-		this.isPropagationStopped = returnTrue;
-
-		if ( e && !this.isSimulated ) {
-			e.stopPropagation();
-		}
-	},
-	stopImmediatePropagation: function() {
-		var e = this.originalEvent;
-
-		this.isImmediatePropagationStopped = returnTrue;
-
-		if ( e && !this.isSimulated ) {
-			e.stopImmediatePropagation();
-		}
-
-		this.stopPropagation();
-	}
-};
-
-// Includes all common event props including KeyEvent and MouseEvent specific props
-jQuery.each( {
-	altKey: true,
-	bubbles: true,
-	cancelable: true,
-	changedTouches: true,
-	ctrlKey: true,
-	detail: true,
-	eventPhase: true,
-	metaKey: true,
-	pageX: true,
-	pageY: true,
-	shiftKey: true,
-	view: true,
-	"char": true,
-	code: true,
-	charCode: true,
-	key: true,
-	keyCode: true,
-	button: true,
-	buttons: true,
-	clientX: true,
-	clientY: true,
-	offsetX: true,
-	offsetY: true,
-	pointerId: true,
-	pointerType: true,
-	screenX: true,
-	screenY: true,
-	targetTouches: true,
-	toElement: true,
-	touches: true,
-	which: true
-}, jQuery.event.addProp );
-
-jQuery.each( { focus: "focusin", blur: "focusout" }, function( type, delegateType ) {
-
-	function focusMappedHandler( nativeEvent ) {
-		if ( document.documentMode ) {
-
-			// Support: IE 11+
-			// Attach a single focusin/focusout handler on the document while someone wants
-			// focus/blur. This is because the former are synchronous in IE while the latter
-			// are async. In other browsers, all those handlers are invoked synchronously.
-
-			// `handle` from private data would already wrap the event, but we need
-			// to change the `type` here.
-			var handle = dataPriv.get( this, "handle" ),
-				event = jQuery.event.fix( nativeEvent );
-			event.type = nativeEvent.type === "focusin" ? "focus" : "blur";
-			event.isSimulated = true;
-
-			// First, handle focusin/focusout
-			handle( nativeEvent );
-
-			// ...then, handle focus/blur
-			//
-			// focus/blur don't bubble while focusin/focusout do; simulate the former by only
-			// invoking the handler at the lower level.
-			if ( event.target === event.currentTarget ) {
-
-				// The setup part calls `leverageNative`, which, in turn, calls
-				// `jQuery.event.add`, so event handle will already have been set
-				// by this point.
-				handle( event );
-			}
-		} else {
-
-			// For non-IE browsers, attach a single capturing handler on the document
-			// while someone wants focusin/focusout.
-			jQuery.event.simulate( delegateType, nativeEvent.target,
-				jQuery.event.fix( nativeEvent ) );
-		}
-	}
-
-	jQuery.event.special[ type ] = {
-
-		// Utilize native event if possible so blur/focus sequence is correct
-		setup: function() {
-
-			var attaches;
-
-			// Claim the first handler
-			// dataPriv.set( this, "focus", ... )
-			// dataPriv.set( this, "blur", ... )
-			leverageNative( this, type, true );
-
-			if ( document.documentMode ) {
-
-				// Support: IE 9 - 11+
-				// We use the same native handler for focusin & focus (and focusout & blur)
-				// so we need to coordinate setup & teardown parts between those events.
-				// Use `delegateType` as the key as `type` is already used by `leverageNative`.
-				attaches = dataPriv.get( this, delegateType );
-				if ( !attaches ) {
-					this.addEventListener( delegateType, focusMappedHandler );
-				}
-				dataPriv.set( this, delegateType, ( attaches || 0 ) + 1 );
-			} else {
-
-				// Return false to allow normal processing in the caller
-				return false;
-			}
-		},
-		trigger: function() {
-
-			// Force setup before trigger
-			leverageNative( this, type );
-
-			// Return non-false to allow normal event-path propagation
-			return true;
-		},
-
-		teardown: function() {
-			var attaches;
-
-			if ( document.documentMode ) {
-				attaches = dataPriv.get( this, delegateType ) - 1;
-				if ( !attaches ) {
-					this.removeEventListener( delegateType, focusMappedHandler );
-					dataPriv.remove( this, delegateType );
-				} else {
-					dataPriv.set( this, delegateType, attaches );
-				}
-			} else {
-
-				// Return false to indicate standard teardown should be applied
-				return false;
-			}
-		},
-
-		// Suppress native focus or blur if we're currently inside
-		// a leveraged native-event stack
-		_default: function( event ) {
-			return dataPriv.get( event.target, type );
-		},
-
-		delegateType: delegateType
-	};
-
-	// Support: Firefox <=44
-	// Firefox doesn't have focus(in | out) events
-	// Related ticket - https://bugzilla.mozilla.org/show_bug.cgi?id=687787
-	//
-	// Support: Chrome <=48 - 49, Safari <=9.0 - 9.1
-	// focus(in | out) events fire after focus & blur events,
-	// which is spec violation - http://www.w3.org/TR/DOM-Level-3-Events/#events-focusevent-event-order
-	// Related ticket - https://bugs.chromium.org/p/chromium/issues/detail?id=449857
-	//
-	// Support: IE 9 - 11+
-	// To preserve relative focusin/focus & focusout/blur event order guaranteed on the 3.x branch,
-	// attach a single handler for both events in IE.
-	jQuery.event.special[ delegateType ] = {
-		setup: function() {
-
-			// Handle: regular nodes (via `this.ownerDocument`), window
-			// (via `this.document`) & document (via `this`).
-			var doc = this.ownerDocument || this.document || this,
-				dataHolder = document.documentMode ? this : doc,
-				attaches = dataPriv.get( dataHolder, delegateType );
-
-			// Support: IE 9 - 11+
-			// We use the same native handler for focusin & focus (and focusout & blur)
-			// so we need to coordinate setup & teardown parts between those events.
-			// Use `delegateType` as the key as `type` is already used by `leverageNative`.
-			if ( !attaches ) {
-				if ( document.documentMode ) {
-					this.addEventListener( delegateType, focusMappedHandler );
-				} else {
-					doc.addEventListener( type, focusMappedHandler, true );
-				}
-			}
-			dataPriv.set( dataHolder, delegateType, ( attaches || 0 ) + 1 );
-		},
-		teardown: function() {
-			var doc = this.ownerDocument || this.document || this,
-				dataHolder = document.documentMode ? this : doc,
-				attaches = dataPriv.get( dataHolder, delegateType ) - 1;
-
-			if ( !attaches ) {
-				if ( document.documentMode ) {
-					this.removeEventListener( delegateType, focusMappedHandler );
-				} else {
-					doc.removeEventListener( type, focusMappedHandler, true );
-				}
-				dataPriv.remove( dataHolder, delegateType );
-			} else {
-				dataPriv.set( dataHolder, delegateType, attaches );
-			}
-		}
-	};
-} );
-
-// Create mouseenter/leave events using mouseover/out and event-time checks
-// so that event delegation works in jQuery.
-// Do the same for pointerenter/pointerleave and pointerover/pointerout
-//
-// Support: Safari 7 only
-// Safari sends mouseenter too often; see:
-// https://bugs.chromium.org/p/chromium/issues/detail?id=470258
-// for the description of the bug (it existed in older Chrome versions as well).
-jQuery.each( {
-	mouseenter: "mouseover",
-	mouseleave: "mouseout",
-	pointerenter: "pointerover",
-	pointerleave: "pointerout"
-}, function( orig, fix ) {
-	jQuery.event.special[ orig ] = {
-		delegateType: fix,
-		bindType: fix,
-
-		handle: function( event ) {
-			var ret,
-				target = this,
-				related = event.relatedTarget,
-				handleObj = event.handleObj;
-
-			// For mouseenter/leave call the handler if related is outside the target.
-			// NB: No relatedTarget if the mouse left/entered the browser window
-			if ( !related || ( related !== target && !jQuery.contains( target, related ) ) ) {
-				event.type = handleObj.origType;
-				ret = handleObj.handler.apply( this, arguments );
-				event.type = fix;
-			}
-			return ret;
-		}
-	};
-} );
-
-jQuery.fn.extend( {
-
-	on: function( types, selector, data, fn ) {
-		return on( this, types, selector, data, fn );
-	},
-	one: function( types, selector, data, fn ) {
-		return on( this, types, selector, data, fn, 1 );
-	},
-	off: function( types, selector, fn ) {
-		var handleObj, type;
-		if ( types && types.preventDefault && types.handleObj ) {
-
-			// ( event )  dispatched jQuery.Event
-			handleObj = types.handleObj;
-			jQuery( types.delegateTarget ).off(
-				handleObj.namespace ?
-					handleObj.origType + "." + handleObj.namespace :
-					handleObj.origType,
-				handleObj.selector,
-				handleObj.handler
-			);
-			return this;
-		}
-		if ( typeof types === "object" ) {
-
-			// ( types-object [, selector] )
-			for ( type in types ) {
-				this.off( type, selector, types[ type ] );
-			}
-			return this;
-		}
-		if ( selector === false || typeof selector === "function" ) {
-
-			// ( types [, fn] )
-			fn = selector;
-			selector = undefined;
-		}
-		if ( fn === false ) {
-			fn = returnFalse;
-		}
-		return this.each( function() {
-			jQuery.event.remove( this, types, fn, selector );
-		} );
-	}
-} );
-
-
-var
-
-	// Support: IE <=10 - 11, Edge 12 - 13 only
-	// In IE/Edge using regex groups here causes severe slowdowns.
-	// See https://connect.microsoft.com/IE/feedback/details/1736512/
-	rnoInnerhtml = /<script|<style|<link/i,
-
-	// checked="checked" or checked
-	rchecked = /checked\s*(?:[^=]|=\s*.checked.)/i,
-
-	rcleanScript = /^\s*<!\[CDATA\[|\]\]>\s*$/g;
-
-// Prefer a tbody over its parent table for containing new rows
-function manipulationTarget( elem, content ) {
-	if ( nodeName( elem, "table" ) &&
-		nodeName( content.nodeType !== 11 ? content : content.firstChild, "tr" ) ) {
-
-		return jQuery( elem ).children( "tbody" )[ 0 ] || elem;
-	}
-
-	return elem;
-}
-
-// Replace/restore the type attribute of script elements for safe DOM manipulation
-function disableScript( elem ) {
-	elem.type = ( elem.getAttribute( "type" ) !== null ) + "/" + elem.type;
-	return elem;
-}
-function restoreScript( elem ) {
-	if ( ( elem.type || "" ).slice( 0, 5 ) === "true/" ) {
-		elem.type = elem.type.slice( 5 );
-	} else {
-		elem.removeAttribute( "type" );
-	}
-
-	return elem;
-}
-
-function cloneCopyEvent( src, dest ) {
-	var i, l, type, pdataOld, udataOld, udataCur, events;
-
-	if ( dest.nodeType !== 1 ) {
-		return;
-	}
-
-	// 1. Copy private data: events, handlers, etc.
-	if ( dataPriv.hasData( src ) ) {
-		pdataOld = dataPriv.get( src );
-		events = pdataOld.events;
-
-		if ( events ) {
-			dataPriv.remove( dest, "handle events" );
-
-			for ( type in events ) {
-				for ( i = 0, l = events[ type ].length; i < l; i++ ) {
-					jQuery.event.add( dest, type, events[ type ][ i ] );
-				}
-			}
-		}
-	}
-
-	// 2. Copy user data
-	if ( dataUser.hasData( src ) ) {
-		udataOld = dataUser.access( src );
-		udataCur = jQuery.extend( {}, udataOld );
-
-		dataUser.set( dest, udataCur );
-	}
-}
-
-// Fix IE bugs, see support tests
-function fixInput( src, dest ) {
-	var nodeName = dest.nodeName.toLowerCase();
-
-	// Fails to persist the checked state of a cloned checkbox or radio button.
-	if ( nodeName === "input" && rcheckableType.test( src.type ) ) {
-		dest.checked = src.checked;
-
-	// Fails to return the selected option to the default selected state when cloning options
-	} else if ( nodeName === "input" || nodeName === "textarea" ) {
-		dest.defaultValue = src.defaultValue;
-	}
-}
-
-function domManip( collection, args, callback, ignored ) {
-
-	// Flatten any nested arrays
-	args = flat( args );
-
-	var fragment, first, scripts, hasScripts, node, doc,
-		i = 0,
-		l = collection.length,
-		iNoClone = l - 1,
-		value = args[ 0 ],
-		valueIsFunction = isFunction( value );
-
-	// We can't cloneNode fragments that contain checked, in WebKit
-	if ( valueIsFunction ||
-			( l > 1 && typeof value === "string" &&
-				!support.checkClone && rchecked.test( value ) ) ) {
-		return collection.each( function( index ) {
-			var self = collection.eq( index );
-			if ( valueIsFunction ) {
-				args[ 0 ] = value.call( this, index, self.html() );
-			}
-			domManip( self, args, callback, ignored );
-		} );
-	}
-
-	if ( l ) {
-		fragment = buildFragment( args, collection[ 0 ].ownerDocument, false, collection, ignored );
-		first = fragment.firstChild;
-
-		if ( fragment.childNodes.length === 1 ) {
-			fragment = first;
-		}
-
-		// Require either new content or an interest in ignored elements to invoke the callback
-		if ( first || ignored ) {
-			scripts = jQuery.map( getAll( fragment, "script" ), disableScript );
-			hasScripts = scripts.length;
-
-			// Use the original fragment for the last item
-			// instead of the first because it can end up
-			// being emptied incorrectly in certain situations (trac-8070).
-			for ( ; i < l; i++ ) {
-				node = fragment;
-
-				if ( i !== iNoClone ) {
-					node = jQuery.clone( node, true, true );
-
-					// Keep references to cloned scripts for later restoration
-					if ( hasScripts ) {
-
-						// Support: Android <=4.0 only, PhantomJS 1 only
-						// push.apply(_, arraylike) throws on ancient WebKit
-						jQuery.merge( scripts, getAll( node, "script" ) );
-					}
-				}
-
-				callback.call( collection[ i ], node, i );
-			}
-
-			if ( hasScripts ) {
-				doc = scripts[ scripts.length - 1 ].ownerDocument;
-
-				// Re-enable scripts
-				jQuery.map( scripts, restoreScript );
-
-				// Evaluate executable scripts on first document insertion
-				for ( i = 0; i < hasScripts; i++ ) {
-					node = scripts[ i ];
-					if ( rscriptType.test( node.type || "" ) &&
-						!dataPriv.access( node, "globalEval" ) &&
-						jQuery.contains( doc, node ) ) {
-
-						if ( node.src && ( node.type || "" ).toLowerCase()  !== "module" ) {
-
-							// Optional AJAX dependency, but won't run scripts if not present
-							if ( jQuery._evalUrl && !node.noModule ) {
-								jQuery._evalUrl( node.src, {
-									nonce: node.nonce || node.getAttribute( "nonce" )
-								}, doc );
-							}
-						} else {
-
-							// Unwrap a CDATA section containing script contents. This shouldn't be
-							// needed as in XML documents they're already not visible when
-							// inspecting element contents and in HTML documents they have no
-							// meaning but we're preserving that logic for backwards compatibility.
-							// This will be removed completely in 4.0. See gh-4904.
-							DOMEval( node.textContent.replace( rcleanScript, "" ), node, doc );
-						}
-					}
-				}
-			}
-		}
-	}
-
-	return collection;
-}
-
-function remove( elem, selector, keepData ) {
-	var node,
-		nodes = selector ? jQuery.filter( selector, elem ) : elem,
-		i = 0;
-
-	for ( ; ( node = nodes[ i ] ) != null; i++ ) {
-		if ( !keepData && node.nodeType === 1 ) {
-			jQuery.cleanData( getAll( node ) );
-		}
-
-		if ( node.parentNode ) {
-			if ( keepData && isAttached( node ) ) {
-				setGlobalEval( getAll( node, "script" ) );
-			}
-			node.parentNode.removeChild( node );
-		}
-	}
-
-	return elem;
-}
-
-jQuery.extend( {
-	htmlPrefilter: function( html ) {
-		return html;
-	},
-
-	clone: function( elem, dataAndEvents, deepDataAndEvents ) {
-		var i, l, srcElements, destElements,
-			clone = elem.cloneNode( true ),
-			inPage = isAttached( elem );
-
-		// Fix IE cloning issues
-		if ( !support.noCloneChecked && ( elem.nodeType === 1 || elem.nodeType === 11 ) &&
-				!jQuery.isXMLDoc( elem ) ) {
-
-			// We eschew jQuery#find here for performance reasons:
-			// https://jsperf.com/getall-vs-sizzle/2
-			destElements = getAll( clone );
-			srcElements = getAll( elem );
-
-			for ( i = 0, l = srcElements.length; i < l; i++ ) {
-				fixInput( srcElements[ i ], destElements[ i ] );
-			}
-		}
-
-		// Copy the events from the original to the clone
-		if ( dataAndEvents ) {
-			if ( deepDataAndEvents ) {
-				srcElements = srcElements || getAll( elem );
-				destElements = destElements || getAll( clone );
-
-				for ( i = 0, l = srcElements.length; i < l; i++ ) {
-					cloneCopyEvent( srcElements[ i ], destElements[ i ] );
-				}
-			} else {
-				cloneCopyEvent( elem, clone );
-			}
-		}
-
-		// Preserve script evaluation history
-		destElements = getAll( clone, "script" );
-		if ( destElements.length > 0 ) {
-			setGlobalEval( destElements, !inPage && getAll( elem, "script" ) );
-		}
-
-		// Return the cloned set
-		return clone;
-	},
-
-	cleanData: function( elems ) {
-		var data, elem, type,
-			special = jQuery.event.special,
-			i = 0;
-
-		for ( ; ( elem = elems[ i ] ) !== undefined; i++ ) {
-			if ( acceptData( elem ) ) {
-				if ( ( data = elem[ dataPriv.expando ] ) ) {
-					if ( data.events ) {
-						for ( type in data.events ) {
-							if ( special[ type ] ) {
-								jQuery.event.remove( elem, type );
-
-							// This is a shortcut to avoid jQuery.event.remove's overhead
-							} else {
-								jQuery.removeEvent( elem, type, data.handle );
-							}
-						}
-					}
-
-					// Support: Chrome <=35 - 45+
-					// Assign undefined instead of using delete, see Data#remove
-					elem[ dataPriv.expando ] = undefined;
-				}
-				if ( elem[ dataUser.expando ] ) {
-
-					// Support: Chrome <=35 - 45+
-					// Assign undefined instead of using delete, see Data#remove
-					elem[ dataUser.expando ] = undefined;
-				}
-			}
-		}
-	}
-} );
-
-jQuery.fn.extend( {
-	detach: function( selector ) {
-		return remove( this, selector, true );
-	},
-
-	remove: function( selector ) {
-		return remove( this, selector );
-	},
-
-	text: function( value ) {
-		return access( this, function( value ) {
-			return value === undefined ?
-				jQuery.text( this ) :
-				this.empty().each( function() {
-					if ( this.nodeType === 1 || this.nodeType === 11 || this.nodeType === 9 ) {
-						this.textContent = value;
-					}
-				} );
-		}, null, value, arguments.length );
-	},
-
-	append: function() {
-		return domManip( this, arguments, function( elem ) {
-			if ( this.nodeType === 1 || this.nodeType === 11 || this.nodeType === 9 ) {
-				var target = manipulationTarget( this, elem );
-				target.appendChild( elem );
-			}
-		} );
-	},
-
-	prepend: function() {
-		return domManip( this, arguments, function( elem ) {
-			if ( this.nodeType === 1 || this.nodeType === 11 || this.nodeType === 9 ) {
-				var target = manipulationTarget( this, elem );
-				target.insertBefore( elem, target.firstChild );
-			}
-		} );
-	},
-
-	before: function() {
-		return domManip( this, arguments, function( elem ) {
-			if ( this.parentNode ) {
-				this.parentNode.insertBefore( elem, this );
-			}
-		} );
-	},
-
-	after: function() {
-		return domManip( this, arguments, function( elem ) {
-			if ( this.parentNode ) {
-				this.parentNode.insertBefore( elem, this.nextSibling );
-			}
-		} );
-	},
-
-	empty: function() {
-		var elem,
-			i = 0;
-
-		for ( ; ( elem = this[ i ] ) != null; i++ ) {
-			if ( elem.nodeType === 1 ) {
-
-				// Prevent memory leaks
-				jQuery.cleanData( getAll( elem, false ) );
-
-				// Remove any remaining nodes
-				elem.textContent = "";
-			}
-		}
-
-		return this;
-	},
-
-	clone: function( dataAndEvents, deepDataAndEvents ) {
-		dataAndEvents = dataAndEvents == null ? false : dataAndEvents;
-		deepDataAndEvents = deepDataAndEvents == null ? dataAndEvents : deepDataAndEvents;
-
-		return this.map( function() {
-			return jQuery.clone( this, dataAndEvents, deepDataAndEvents );
-		} );
-	},
-
-	html: function( value ) {
-		return access( this, function( value ) {
-			var elem = this[ 0 ] || {},
-				i = 0,
-				l = this.length;
-
-			if ( value === undefined && elem.nodeType === 1 ) {
-				return elem.innerHTML;
-			}
-
-			// See if we can take a shortcut and just use innerHTML
-			if ( typeof value === "string" && !rnoInnerhtml.test( value ) &&
-				!wrapMap[ ( rtagName.exec( value ) || [ "", "" ] )[ 1 ].toLowerCase() ] ) {
-
-				value = jQuery.htmlPrefilter( value );
-
-				try {
-					for ( ; i < l; i++ ) {
-						elem = this[ i ] || {};
-
-						// Remove element nodes and prevent memory leaks
-						if ( elem.nodeType === 1 ) {
-							jQuery.cleanData( getAll( elem, false ) );
-							elem.innerHTML = value;
-						}
-					}
-
-					elem = 0;
-
-				// If using innerHTML throws an exception, use the fallback method
-				} catch ( e ) {}
-			}
-
-			if ( elem ) {
-				this.empty().append( value );
-			}
-		}, null, value, arguments.length );
-	},
-
-	replaceWith: function() {
-		var ignored = [];
-
-		// Make the changes, replacing each non-ignored context element with the new content
-		return domManip( this, arguments, function( elem ) {
-			var parent = this.parentNode;
-
-			if ( jQuery.inArray( this, ignored ) < 0 ) {
-				jQuery.cleanData( getAll( this ) );
-				if ( parent ) {
-					parent.replaceChild( elem, this );
-				}
-			}
-
-		// Force callback invocation
-		}, ignored );
-	}
-} );
-
-jQuery.each( {
-	appendTo: "append",
-	prependTo: "prepend",
-	insertBefore: "before",
-	insertAfter: "after",
-	replaceAll: "replaceWith"
-}, function( name, original ) {
-	jQuery.fn[ name ] = function( selector ) {
-		var elems,
-			ret = [],
-			insert = jQuery( selector ),
-			last = insert.length - 1,
-			i = 0;
-
-		for ( ; i <= last; i++ ) {
-			elems = i === last ? this : this.clone( true );
-			jQuery( insert[ i ] )[ original ]( elems );
-
-			// Support: Android <=4.0 only, PhantomJS 1 only
-			// .get() because push.apply(_, arraylike) throws on ancient WebKit
-			push.apply( ret, elems.get() );
-		}
-
-		return this.pushStack( ret );
-	};
-} );
-var rnumnonpx = new RegExp( "^(" + pnum + ")(?!px)[a-z%]+$", "i" );
-
-var rcustomProp = /^--/;
-
-
-var getStyles = function( elem ) {
-
-		// Support: IE <=11 only, Firefox <=30 (trac-15098, trac-14150)
-		// IE throws on elements created in popups
-		// FF meanwhile throws on frame elements through "defaultView.getComputedStyle"
-		var view = elem.ownerDocument.defaultView;
-
-		if ( !view || !view.opener ) {
-			view = window;
-		}
-
-		return view.getComputedStyle( elem );
-	};
-
-var swap = function( elem, options, callback ) {
-	var ret, name,
-		old = {};
-
-	// Remember the old values, and insert the new ones
-	for ( name in options ) {
-		old[ name ] = elem.style[ name ];
-		elem.style[ name ] = options[ name ];
-	}
-
-	ret = callback.call( elem );
-
-	// Revert the old values
-	for ( name in options ) {
-		elem.style[ name ] = old[ name ];
-	}
-
-	return ret;
-};
-
-
-var rboxStyle = new RegExp( cssExpand.join( "|" ), "i" );
-
-
-
-( function() {
-
-	// Executing both pixelPosition & boxSizingReliable tests require only one layout
-	// so they're executed at the same time to save the second computation.
-	function computeStyleTests() {
-
-		// This is a singleton, we need to execute it only once
-		if ( !div ) {
-			return;
-		}
-
-		container.style.cssText = "position:absolute;left:-11111px;width:60px;" +
-			"margin-top:1px;padding:0;border:0";
-		div.style.cssText =
-			"position:relative;display:block;box-sizing:border-box;overflow:scroll;" +
-			"margin:auto;border:1px;padding:1px;" +
-			"width:60%;top:1%";
-		documentElement.appendChild( container ).appendChild( div );
-
-		var divStyle = window.getComputedStyle( div );
-		pixelPositionVal = divStyle.top !== "1%";
-
-		// Support: Android 4.0 - 4.3 only, Firefox <=3 - 44
-		reliableMarginLeftVal = roundPixelMeasures( divStyle.marginLeft ) === 12;
-
-		// Support: Android 4.0 - 4.3 only, Safari <=9.1 - 10.1, iOS <=7.0 - 9.3
-		// Some styles come back with percentage values, even though they shouldn't
-		div.style.right = "60%";
-		pixelBoxStylesVal = roundPixelMeasures( divStyle.right ) === 36;
-
-		// Support: IE 9 - 11 only
-		// Detect misreporting of content dimensions for box-sizing:border-box elements
-		boxSizingReliableVal = roundPixelMeasures( divStyle.width ) === 36;
-
-		// Support: IE 9 only
-		// Detect overflow:scroll screwiness (gh-3699)
-		// Support: Chrome <=64
-		// Don't get tricked when zoom affects offsetWidth (gh-4029)
-		div.style.position = "absolute";
-		scrollboxSizeVal = roundPixelMeasures( div.offsetWidth / 3 ) === 12;
-
-		documentElement.removeChild( container );
-
-		// Nullify the div so it wouldn't be stored in the memory and
-		// it will also be a sign that checks already performed
-		div = null;
-	}
-
-	function roundPixelMeasures( measure ) {
-		return Math.round( parseFloat( measure ) );
-	}
-
-	var pixelPositionVal, boxSizingReliableVal, scrollboxSizeVal, pixelBoxStylesVal,
-		reliableTrDimensionsVal, reliableMarginLeftVal,
-		container = document.createElement( "div" ),
-		div = document.createElement( "div" );
-
-	// Finish early in limited (non-browser) environments
-	if ( !div.style ) {
-		return;
-	}
-
-	// Support: IE <=9 - 11 only
-	// Style of cloned element affects source element cloned (trac-8908)
-	div.style.backgroundClip = "content-box";
-	div.cloneNode( true ).style.backgroundClip = "";
-	support.clearCloneStyle = div.style.backgroundClip === "content-box";
-
-	jQuery.extend( support, {
-		boxSizingReliable: function() {
-			computeStyleTests();
-			return boxSizingReliableVal;
-		},
-		pixelBoxStyles: function() {
-			computeStyleTests();
-			return pixelBoxStylesVal;
-		},
-		pixelPosition: function() {
-			computeStyleTests();
-			return pixelPositionVal;
-		},
-		reliableMarginLeft: function() {
-			computeStyleTests();
-			return reliableMarginLeftVal;
-		},
-		scrollboxSize: function() {
-			computeStyleTests();
-			return scrollboxSizeVal;
-		},
-
-		// Support: IE 9 - 11+, Edge 15 - 18+
-		// IE/Edge misreport `getComputedStyle` of table rows with width/height
-		// set in CSS while `offset*` properties report correct values.
-		// Behavior in IE 9 is more subtle than in newer versions & it passes
-		// some versions of this test; make sure not to make it pass there!
-		//
-		// Support: Firefox 70+
-		// Only Firefox includes border widths
-		// in computed dimensions. (gh-4529)
-		reliableTrDimensions: function() {
-			var table, tr, trChild, trStyle;
-			if ( reliableTrDimensionsVal == null ) {
-				table = document.createElement( "table" );
-				tr = document.createElement( "tr" );
-				trChild = document.createElement( "div" );
-
-				table.style.cssText = "position:absolute;left:-11111px;border-collapse:separate";
-				tr.style.cssText = "box-sizing:content-box;border:1px solid";
-
-				// Support: Chrome 86+
-				// Height set through cssText does not get applied.
-				// Computed height then comes back as 0.
-				tr.style.height = "1px";
-				trChild.style.height = "9px";
-
-				// Support: Android 8 Chrome 86+
-				// In our bodyBackground.html iframe,
-				// display for all div elements is set to "inline",
-				// which causes a problem only in Android 8 Chrome 86.
-				// Ensuring the div is `display: block`
-				// gets around this issue.
-				trChild.style.display = "block";
-
-				documentElement
-					.appendChild( table )
-					.appendChild( tr )
-					.appendChild( trChild );
-
-				trStyle = window.getComputedStyle( tr );
-				reliableTrDimensionsVal = ( parseInt( trStyle.height, 10 ) +
-					parseInt( trStyle.borderTopWidth, 10 ) +
-					parseInt( trStyle.borderBottomWidth, 10 ) ) === tr.offsetHeight;
-
-				documentElement.removeChild( table );
-			}
-			return reliableTrDimensionsVal;
-		}
-	} );
-} )();
-
-
-function curCSS( elem, name, computed ) {
-	var width, minWidth, maxWidth, ret,
-		isCustomProp = rcustomProp.test( name ),
-
-		// Support: Firefox 51+
-		// Retrieving style before computed somehow
-		// fixes an issue with getting wrong values
-		// on detached elements
-		style = elem.style;
-
-	computed = computed || getStyles( elem );
-
-	// getPropertyValue is needed for:
-	//   .css('filter') (IE 9 only, trac-12537)
-	//   .css('--customProperty) (gh-3144)
-	if ( computed ) {
-
-		// Support: IE <=9 - 11+
-		// IE only supports `"float"` in `getPropertyValue`; in computed styles
-		// it's only available as `"cssFloat"`. We no longer modify properties
-		// sent to `.css()` apart from camelCasing, so we need to check both.
-		// Normally, this would create difference in behavior: if
-		// `getPropertyValue` returns an empty string, the value returned
-		// by `.css()` would be `undefined`. This is usually the case for
-		// disconnected elements. However, in IE even disconnected elements
-		// with no styles return `"none"` for `getPropertyValue( "float" )`
-		ret = computed.getPropertyValue( name ) || computed[ name ];
-
-		if ( isCustomProp && ret ) {
-
-			// Support: Firefox 105+, Chrome <=105+
-			// Spec requires trimming whitespace for custom properties (gh-4926).
-			// Firefox only trims leading whitespace. Chrome just collapses
-			// both leading & trailing whitespace to a single space.
-			//
-			// Fall back to `undefined` if empty string returned.
-			// This collapses a missing definition with property defined
-			// and set to an empty string but there's no standard API
-			// allowing us to differentiate them without a performance penalty
-			// and returning `undefined` aligns with older jQuery.
-			//
-			// rtrimCSS treats U+000D CARRIAGE RETURN and U+000C FORM FEED
-			// as whitespace while CSS does not, but this is not a problem
-			// because CSS preprocessing replaces them with U+000A LINE FEED
-			// (which *is* CSS whitespace)
-			// https://www.w3.org/TR/css-syntax-3/#input-preprocessing
-			ret = ret.replace( rtrimCSS, "$1" ) || undefined;
-		}
-
-		if ( ret === "" && !isAttached( elem ) ) {
-			ret = jQuery.style( elem, name );
-		}
-
-		// A tribute to the "awesome hack by Dean Edwards"
-		// Android Browser returns percentage for some values,
-		// but width seems to be reliably pixels.
-		// This is against the CSSOM draft spec:
-		// https://drafts.csswg.org/cssom/#resolved-values
-		if ( !support.pixelBoxStyles() && rnumnonpx.test( ret ) && rboxStyle.test( name ) ) {
-
-			// Remember the original values
-			width = style.width;
-			minWidth = style.minWidth;
-			maxWidth = style.maxWidth;
-
-			// Put in the new values to get a computed value out
-			style.minWidth = style.maxWidth = style.width = ret;
-			ret = computed.width;
-
-			// Revert the changed values
-			style.width = width;
-			style.minWidth = minWidth;
-			style.maxWidth = maxWidth;
-		}
-	}
-
-	return ret !== undefined ?
-
-		// Support: IE <=9 - 11 only
-		// IE returns zIndex value as an integer.
-		ret + "" :
-		ret;
-}
-
-
-function addGetHookIf( conditionFn, hookFn ) {
-
-	// Define the hook, we'll check on the first run if it's really needed.
-	return {
-		get: function() {
-			if ( conditionFn() ) {
-
-				// Hook not needed (or it's not possible to use it due
-				// to missing dependency), remove it.
-				delete this.get;
-				return;
-			}
-
-			// Hook needed; redefine it so that the support test is not executed again.
-			return ( this.get = hookFn ).apply( this, arguments );
-		}
-	};
-}
-
-
-var cssPrefixes = [ "Webkit", "Moz", "ms" ],
-	emptyStyle = document.createElement( "div" ).style,
-	vendorProps = {};
-
-// Return a vendor-prefixed property or undefined
-function vendorPropName( name ) {
-
-	// Check for vendor prefixed names
-	var capName = name[ 0 ].toUpperCase() + name.slice( 1 ),
-		i = cssPrefixes.length;
-
-	while ( i-- ) {
-		name = cssPrefixes[ i ] + capName;
-		if ( name in emptyStyle ) {
-			return name;
-		}
-	}
-}
-
-// Return a potentially-mapped jQuery.cssProps or vendor prefixed property
-function finalPropName( name ) {
-	var final = jQuery.cssProps[ name ] || vendorProps[ name ];
-
-	if ( final ) {
-		return final;
-	}
-	if ( name in emptyStyle ) {
-		return name;
-	}
-	return vendorProps[ name ] = vendorPropName( name ) || name;
-}
-
-
-var
-
-	// Swappable if display is none or starts with table
-	// except "table", "table-cell", or "table-caption"
-	// See here for display values: https://developer.mozilla.org/en-US/docs/CSS/display
-	rdisplayswap = /^(none|table(?!-c[ea]).+)/,
-	cssShow = { position: "absolute", visibility: "hidden", display: "block" },
-	cssNormalTransform = {
-		letterSpacing: "0",
-		fontWeight: "400"
-	};
-
-function setPositiveNumber( _elem, value, subtract ) {
-
-	// Any relative (+/-) values have already been
-	// normalized at this point
-	var matches = rcssNum.exec( value );
-	return matches ?
-
-		// Guard against undefined "subtract", e.g., when used as in cssHooks
-		Math.max( 0, matches[ 2 ] - ( subtract || 0 ) ) + ( matches[ 3 ] || "px" ) :
-		value;
-}
-
-function boxModelAdjustment( elem, dimension, box, isBorderBox, styles, computedVal ) {
-	var i = dimension === "width" ? 1 : 0,
-		extra = 0,
-		delta = 0,
-		marginDelta = 0;
-
-	// Adjustment may not be necessary
-	if ( box === ( isBorderBox ? "border" : "content" ) ) {
-		return 0;
-	}
-
-	for ( ; i < 4; i += 2 ) {
-
-		// Both box models exclude margin
-		// Count margin delta separately to only add it after scroll gutter adjustment.
-		// This is needed to make negative margins work with `outerHeight( true )` (gh-3982).
-		if ( box === "margin" ) {
-			marginDelta += jQuery.css( elem, box + cssExpand[ i ], true, styles );
-		}
-
-		// If we get here with a content-box, we're seeking "padding" or "border" or "margin"
-		if ( !isBorderBox ) {
-
-			// Add padding
-			delta += jQuery.css( elem, "padding" + cssExpand[ i ], true, styles );
-
-			// For "border" or "margin", add border
-			if ( box !== "padding" ) {
-				delta += jQuery.css( elem, "border" + cssExpand[ i ] + "Width", true, styles );
-
-			// But still keep track of it otherwise
-			} else {
-				extra += jQuery.css( elem, "border" + cssExpand[ i ] + "Width", true, styles );
-			}
-
-		// If we get here with a border-box (content + padding + border), we're seeking "content" or
-		// "padding" or "margin"
-		} else {
-
-			// For "content", subtract padding
-			if ( box === "content" ) {
-				delta -= jQuery.css( elem, "padding" + cssExpand[ i ], true, styles );
-			}
-
-			// For "content" or "padding", subtract border
-			if ( box !== "margin" ) {
-				delta -= jQuery.css( elem, "border" + cssExpand[ i ] + "Width", true, styles );
-			}
-		}
-	}
-
-	// Account for positive content-box scroll gutter when requested by providing computedVal
-	if ( !isBorderBox && computedVal >= 0 ) {
-
-		// offsetWidth/offsetHeight is a rounded sum of content, padding, scroll gutter, and border
-		// Assuming integer scroll gutter, subtract the rest and round down
-		delta += Math.max( 0, Math.ceil(
-			elem[ "offset" + dimension[ 0 ].toUpperCase() + dimension.slice( 1 ) ] -
-			computedVal -
-			delta -
-			extra -
-			0.5
-
-		// If offsetWidth/offsetHeight is unknown, then we can't determine content-box scroll gutter
-		// Use an explicit zero to avoid NaN (gh-3964)
-		) ) || 0;
-	}
-
-	return delta + marginDelta;
-}
-
-function getWidthOrHeight( elem, dimension, extra ) {
-
-	// Start with computed style
-	var styles = getStyles( elem ),
-
-		// To avoid forcing a reflow, only fetch boxSizing if we need it (gh-4322).
-		// Fake content-box until we know it's needed to know the true value.
-		boxSizingNeeded = !support.boxSizingReliable() || extra,
-		isBorderBox = boxSizingNeeded &&
-			jQuery.css( elem, "boxSizing", false, styles ) === "border-box",
-		valueIsBorderBox = isBorderBox,
-
-		val = curCSS( elem, dimension, styles ),
-		offsetProp = "offset" + dimension[ 0 ].toUpperCase() + dimension.slice( 1 );
-
-	// Support: Firefox <=54
-	// Return a confounding non-pixel value or feign ignorance, as appropriate.
-	if ( rnumnonpx.test( val ) ) {
-		if ( !extra ) {
-			return val;
-		}
-		val = "auto";
-	}
-
-
-	// Support: IE 9 - 11 only
-	// Use offsetWidth/offsetHeight for when box sizing is unreliable.
-	// In those cases, the computed value can be trusted to be border-box.
-	if ( ( !support.boxSizingReliable() && isBorderBox ||
-
-		// Support: IE 10 - 11+, Edge 15 - 18+
-		// IE/Edge misreport `getComputedStyle` of table rows with width/height
-		// set in CSS while `offset*` properties report correct values.
-		// Interestingly, in some cases IE 9 doesn't suffer from this issue.
-		!support.reliableTrDimensions() && nodeName( elem, "tr" ) ||
-
-		// Fall back to offsetWidth/offsetHeight when value is "auto"
-		// This happens for inline elements with no explicit setting (gh-3571)
-		val === "auto" ||
-
-		// Support: Android <=4.1 - 4.3 only
-		// Also use offsetWidth/offsetHeight for misreported inline dimensions (gh-3602)
-		!parseFloat( val ) && jQuery.css( elem, "display", false, styles ) === "inline" ) &&
-
-		// Make sure the element is visible & connected
-		elem.getClientRects().length ) {
-
-		isBorderBox = jQuery.css( elem, "boxSizing", false, styles ) === "border-box";
-
-		// Where available, offsetWidth/offsetHeight approximate border box dimensions.
-		// Where not available (e.g., SVG), assume unreliable box-sizing and interpret the
-		// retrieved value as a content box dimension.
-		valueIsBorderBox = offsetProp in elem;
-		if ( valueIsBorderBox ) {
-			val = elem[ offsetProp ];
-		}
-	}
-
-	// Normalize "" and auto
-	val = parseFloat( val ) || 0;
-
-	// Adjust for the element's box model
-	return ( val +
-		boxModelAdjustment(
-			elem,
-			dimension,
-			extra || ( isBorderBox ? "border" : "content" ),
-			valueIsBorderBox,
-			styles,
-
-			// Provide the current computed size to request scroll gutter calculation (gh-3589)
-			val
-		)
-	) + "px";
-}
-
-jQuery.extend( {
-
-	// Add in style property hooks for overriding the default
-	// behavior of getting and setting a style property
-	cssHooks: {
-		opacity: {
-			get: function( elem, computed ) {
-				if ( computed ) {
-
-					// We should always get a number back from opacity
-					var ret = curCSS( elem, "opacity" );
-					return ret === "" ? "1" : ret;
-				}
-			}
-		}
-	},
-
-	// Don't automatically add "px" to these possibly-unitless properties
-	cssNumber: {
-		animationIterationCount: true,
-		aspectRatio: true,
-		borderImageSlice: true,
-		columnCount: true,
-		flexGrow: true,
-		flexShrink: true,
-		fontWeight: true,
-		gridArea: true,
-		gridColumn: true,
-		gridColumnEnd: true,
-		gridColumnStart: true,
-		gridRow: true,
-		gridRowEnd: true,
-		gridRowStart: true,
-		lineHeight: true,
-		opacity: true,
-		order: true,
-		orphans: true,
-		scale: true,
-		widows: true,
-		zIndex: true,
-		zoom: true,
-
-		// SVG-related
-		fillOpacity: true,
-		floodOpacity: true,
-		stopOpacity: true,
-		strokeMiterlimit: true,
-		strokeOpacity: true
-	},
-
-	// Add in properties whose names you wish to fix before
-	// setting or getting the value
-	cssProps: {},
-
-	// Get and set the style property on a DOM Node
-	style: function( elem, name, value, extra ) {
-
-		// Don't set styles on text and comment nodes
-		if ( !elem || elem.nodeType === 3 || elem.nodeType === 8 || !elem.style ) {
-			return;
-		}
-
-		// Make sure that we're working with the right name
-		var ret, type, hooks,
-			origName = camelCase( name ),
-			isCustomProp = rcustomProp.test( name ),
-			style = elem.style;
-
-		// Make sure that we're working with the right name. We don't
-		// want to query the value if it is a CSS custom property
-		// since they are user-defined.
-		if ( !isCustomProp ) {
-			name = finalPropName( origName );
-		}
-
-		// Gets hook for the prefixed version, then unprefixed version
-		hooks = jQuery.cssHooks[ name ] || jQuery.cssHooks[ origName ];
-
-		// Check if we're setting a value
-		if ( value !== undefined ) {
-			type = typeof value;
-
-			// Convert "+=" or "-=" to relative numbers (trac-7345)
-			if ( type === "string" && ( ret = rcssNum.exec( value ) ) && ret[ 1 ] ) {
-				value = adjustCSS( elem, name, ret );
-
-				// Fixes bug trac-9237
-				type = "number";
-			}
-
-			// Make sure that null and NaN values aren't set (trac-7116)
-			if ( value == null || value !== value ) {
-				return;
-			}
-
-			// If a number was passed in, add the unit (except for certain CSS properties)
-			// The isCustomProp check can be removed in jQuery 4.0 when we only auto-append
-			// "px" to a few hardcoded values.
-			if ( type === "number" && !isCustomProp ) {
-				value += ret && ret[ 3 ] || ( jQuery.cssNumber[ origName ] ? "" : "px" );
-			}
-
-			// background-* props affect original clone's values
-			if ( !support.clearCloneStyle && value === "" && name.indexOf( "background" ) === 0 ) {
-				style[ name ] = "inherit";
-			}
-
-			// If a hook was provided, use that value, otherwise just set the specified value
-			if ( !hooks || !( "set" in hooks ) ||
-				( value = hooks.set( elem, value, extra ) ) !== undefined ) {
-
-				if ( isCustomProp ) {
-					style.setProperty( name, value );
-				} else {
-					style[ name ] = value;
-				}
-			}
-
-		} else {
-
-			// If a hook was provided get the non-computed value from there
-			if ( hooks && "get" in hooks &&
-				( ret = hooks.get( elem, false, extra ) ) !== undefined ) {
-
-				return ret;
-			}
-
-			// Otherwise just get the value from the style object
-			return style[ name ];
-		}
-	},
-
-	css: function( elem, name, extra, styles ) {
-		var val, num, hooks,
-			origName = camelCase( name ),
-			isCustomProp = rcustomProp.test( name );
-
-		// Make sure that we're working with the right name. We don't
-		// want to modify the value if it is a CSS custom property
-		// since they are user-defined.
-		if ( !isCustomProp ) {
-			name = finalPropName( origName );
-		}
-
-		// Try prefixed name followed by the unprefixed name
-		hooks = jQuery.cssHooks[ name ] || jQuery.cssHooks[ origName ];
-
-		// If a hook was provided get the computed value from there
-		if ( hooks && "get" in hooks ) {
-			val = hooks.get( elem, true, extra );
-		}
-
-		// Otherwise, if a way to get the computed value exists, use that
-		if ( val === undefined ) {
-			val = curCSS( elem, name, styles );
-		}
-
-		// Convert "normal" to computed value
-		if ( val === "normal" && name in cssNormalTransform ) {
-			val = cssNormalTransform[ name ];
-		}
-
-		// Make numeric if forced or a qualifier was provided and val looks numeric
-		if ( extra === "" || extra ) {
-			num = parseFloat( val );
-			return extra === true || isFinite( num ) ? num || 0 : val;
-		}
-
-		return val;
-	}
-} );
-
-jQuery.each( [ "height", "width" ], function( _i, dimension ) {
-	jQuery.cssHooks[ dimension ] = {
-		get: function( elem, computed, extra ) {
-			if ( computed ) {
-
-				// Certain elements can have dimension info if we invisibly show them
-				// but it must have a current display style that would benefit
-				return rdisplayswap.test( jQuery.css( elem, "display" ) ) &&
-
-					// Support: Safari 8+
-					// Table columns in Safari have non-zero offsetWidth & zero
-					// getBoundingClientRect().width unless display is changed.
-					// Support: IE <=11 only
-					// Running getBoundingClientRect on a disconnected node
-					// in IE throws an error.
-					( !elem.getClientRects().length || !elem.getBoundingClientRect().width ) ?
-					swap( elem, cssShow, function() {
-						return getWidthOrHeight( elem, dimension, extra );
-					} ) :
-					getWidthOrHeight( elem, dimension, extra );
-			}
-		},
-
-		set: function( elem, value, extra ) {
-			var matches,
-				styles = getStyles( elem ),
-
-				// Only read styles.position if the test has a chance to fail
-				// to avoid forcing a reflow.
-				scrollboxSizeBuggy = !support.scrollboxSize() &&
-					styles.position === "absolute",
-
-				// To avoid forcing a reflow, only fetch boxSizing if we need it (gh-3991)
-				boxSizingNeeded = scrollboxSizeBuggy || extra,
-				isBorderBox = boxSizingNeeded &&
-					jQuery.css( elem, "boxSizing", false, styles ) === "border-box",
-				subtract = extra ?
-					boxModelAdjustment(
-						elem,
-						dimension,
-						extra,
-						isBorderBox,
-						styles
-					) :
-					0;
-
-			// Account for unreliable border-box dimensions by comparing offset* to computed and
-			// faking a content-box to get border and padding (gh-3699)
-			if ( isBorderBox && scrollboxSizeBuggy ) {
-				subtract -= Math.ceil(
-					elem[ "offset" + dimension[ 0 ].toUpperCase() + dimension.slice( 1 ) ] -
-					parseFloat( styles[ dimension ] ) -
-					boxModelAdjustment( elem, dimension, "border", false, styles ) -
-					0.5
-				);
-			}
-
-			// Convert to pixels if value adjustment is needed
-			if ( subtract && ( matches = rcssNum.exec( value ) ) &&
-				( matches[ 3 ] || "px" ) !== "px" ) {
-
-				elem.style[ dimension ] = value;
-				value = jQuery.css( elem, dimension );
-			}
-
-			return setPositiveNumber( elem, value, subtract );
-		}
-	};
-} );
-
-jQuery.cssHooks.marginLeft = addGetHookIf( support.reliableMarginLeft,
-	function( elem, computed ) {
-		if ( computed ) {
-			return ( parseFloat( curCSS( elem, "marginLeft" ) ) ||
-				elem.getBoundingClientRect().left -
-					swap( elem, { marginLeft: 0 }, function() {
-						return elem.getBoundingClientRect().left;
-					} )
-			) + "px";
-		}
-	}
-);
-
-// These hooks are used by animate to expand properties
-jQuery.each( {
-	margin: "",
-	padding: "",
-	border: "Width"
-}, function( prefix, suffix ) {
-	jQuery.cssHooks[ prefix + suffix ] = {
-		expand: function( value ) {
-			var i = 0,
-				expanded = {},
-
-				// Assumes a single number if not a string
-				parts = typeof value === "string" ? value.split( " " ) : [ value ];
-
-			for ( ; i < 4; i++ ) {
-				expanded[ prefix + cssExpand[ i ] + suffix ] =
-					parts[ i ] || parts[ i - 2 ] || parts[ 0 ];
-			}
-
-			return expanded;
-		}
-	};
-
-	if ( prefix !== "margin" ) {
-		jQuery.cssHooks[ prefix + suffix ].set = setPositiveNumber;
-	}
-} );
-
-jQuery.fn.extend( {
-	css: function( name, value ) {
-		return access( this, function( elem, name, value ) {
-			var styles, len,
-				map = {},
-				i = 0;
-
-			if ( Array.isArray( name ) ) {
-				styles = getStyles( elem );
-				len = name.length;
-
-				for ( ; i < len; i++ ) {
-					map[ name[ i ] ] = jQuery.css( elem, name[ i ], false, styles );
-				}
-
-				return map;
-			}
-
-			return value !== undefined ?
-				jQuery.style( elem, name, value ) :
-				jQuery.css( elem, name );
-		}, name, value, arguments.length > 1 );
-	}
-} );
-
-
-function Tween( elem, options, prop, end, easing ) {
-	return new Tween.prototype.init( elem, options, prop, end, easing );
-}
-jQuery.Tween = Tween;
-
-Tween.prototype = {
-	constructor: Tween,
-	init: function( elem, options, prop, end, easing, unit ) {
-		this.elem = elem;
-		this.prop = prop;
-		this.easing = easing || jQuery.easing._default;
-		this.options = options;
-		this.start = this.now = this.cur();
-		this.end = end;
-		this.unit = unit || ( jQuery.cssNumber[ prop ] ? "" : "px" );
-	},
-	cur: function() {
-		var hooks = Tween.propHooks[ this.prop ];
-
-		return hooks && hooks.get ?
-			hooks.get( this ) :
-			Tween.propHooks._default.get( this );
-	},
-	run: function( percent ) {
-		var eased,
-			hooks = Tween.propHooks[ this.prop ];
-
-		if ( this.options.duration ) {
-			this.pos = eased = jQuery.easing[ this.easing ](
-				percent, this.options.duration * percent, 0, 1, this.options.duration
-			);
-		} else {
-			this.pos = eased = percent;
-		}
-		this.now = ( this.end - this.start ) * eased + this.start;
-
-		if ( this.options.step ) {
-			this.options.step.call( this.elem, this.now, this );
-		}
-
-		if ( hooks && hooks.set ) {
-			hooks.set( this );
-		} else {
-			Tween.propHooks._default.set( this );
-		}
-		return this;
-	}
-};
-
-Tween.prototype.init.prototype = Tween.prototype;
-
-Tween.propHooks = {
-	_default: {
-		get: function( tween ) {
-			var result;
-
-			// Use a property on the element directly when it is not a DOM element,
-			// or when there is no matching style property that exists.
-			if ( tween.elem.nodeType !== 1 ||
-				tween.elem[ tween.prop ] != null && tween.elem.style[ tween.prop ] == null ) {
-				return tween.elem[ tween.prop ];
-			}
-
-			// Passing an empty string as a 3rd parameter to .css will automatically
-			// attempt a parseFloat and fallback to a string if the parse fails.
-			// Simple values such as "10px" are parsed to Float;
-			// complex values such as "rotate(1rad)" are returned as-is.
-			result = jQuery.css( tween.elem, tween.prop, "" );
-
-			// Empty strings, null, undefined and "auto" are converted to 0.
-			return !result || result === "auto" ? 0 : result;
-		},
-		set: function( tween ) {
-
-			// Use step hook for back compat.
-			// Use cssHook if its there.
-			// Use .style if available and use plain properties where available.
-			if ( jQuery.fx.step[ tween.prop ] ) {
-				jQuery.fx.step[ tween.prop ]( tween );
-			} else if ( tween.elem.nodeType === 1 && (
-				jQuery.cssHooks[ tween.prop ] ||
-					tween.elem.style[ finalPropName( tween.prop ) ] != null ) ) {
-				jQuery.style( tween.elem, tween.prop, tween.now + tween.unit );
-			} else {
-				tween.elem[ tween.prop ] = tween.now;
-			}
-		}
-	}
-};
-
-// Support: IE <=9 only
-// Panic based approach to setting things on disconnected nodes
-Tween.propHooks.scrollTop = Tween.propHooks.scrollLeft = {
-	set: function( tween ) {
-		if ( tween.elem.nodeType && tween.elem.parentNode ) {
-			tween.elem[ tween.prop ] = tween.now;
-		}
-	}
-};
-
-jQuery.easing = {
-	linear: function( p ) {
-		return p;
-	},
-	swing: function( p ) {
-		return 0.5 - Math.cos( p * Math.PI ) / 2;
-	},
-	_default: "swing"
-};
-
-jQuery.fx = Tween.prototype.init;
-
-// Back compat <1.8 extension point
-jQuery.fx.step = {};
-
-
-
-
-var
-	fxNow, inProgress,
-	rfxtypes = /^(?:toggle|show|hide)$/,
-	rrun = /queueHooks$/;
-
-function schedule() {
-	if ( inProgress ) {
-		if ( document.hidden === false && window.requestAnimationFrame ) {
-			window.requestAnimationFrame( schedule );
-		} else {
-			window.setTimeout( schedule, jQuery.fx.interval );
-		}
-
-		jQuery.fx.tick();
-	}
-}
-
-// Animations created synchronously will run synchronously
-function createFxNow() {
-	window.setTimeout( function() {
-		fxNow = undefined;
-	} );
-	return ( fxNow = Date.now() );
-}
-
-// Generate parameters to create a standard animation
-function genFx( type, includeWidth ) {
-	var which,
-		i = 0,
-		attrs = { height: type };
-
-	// If we include width, step value is 1 to do all cssExpand values,
-	// otherwise step value is 2 to skip over Left and Right
-	includeWidth = includeWidth ? 1 : 0;
-	for ( ; i < 4; i += 2 - includeWidth ) {
-		which = cssExpand[ i ];
-		attrs[ "margin" + which ] = attrs[ "padding" + which ] = type;
-	}
-
-	if ( includeWidth ) {
-		attrs.opacity = attrs.width = type;
-	}
-
-	return attrs;
-}
-
-function createTween( value, prop, animation ) {
-	var tween,
-		collection = ( Animation.tweeners[ prop ] || [] ).concat( Animation.tweeners[ "*" ] ),
-		index = 0,
-		length = collection.length;
-	for ( ; index < length; index++ ) {
-		if ( ( tween = collection[ index ].call( animation, prop, value ) ) ) {
-
-			// We're done with this property
-			return tween;
-		}
-	}
-}
-
-function defaultPrefilter( elem, props, opts ) {
-	var prop, value, toggle, hooks, oldfire, propTween, restoreDisplay, display,
-		isBox = "width" in props || "height" in props,
-		anim = this,
-		orig = {},
-		style = elem.style,
-		hidden = elem.nodeType && isHiddenWithinTree( elem ),
-		dataShow = dataPriv.get( elem, "fxshow" );
-
-	// Queue-skipping animations hijack the fx hooks
-	if ( !opts.queue ) {
-		hooks = jQuery._queueHooks( elem, "fx" );
-		if ( hooks.unqueued == null ) {
-			hooks.unqueued = 0;
-			oldfire = hooks.empty.fire;
-			hooks.empty.fire = function() {
-				if ( !hooks.unqueued ) {
-					oldfire();
-				}
-			};
-		}
-		hooks.unqueued++;
-
-		anim.always( function() {
-
-			// Ensure the complete handler is called before this completes
-			anim.always( function() {
-				hooks.unqueued--;
-				if ( !jQuery.queue( elem, "fx" ).length ) {
-					hooks.empty.fire();
-				}
-			} );
-		} );
-	}
-
-	// Detect show/hide animations
-	for ( prop in props ) {
-		value = props[ prop ];
-		if ( rfxtypes.test( value ) ) {
-			delete props[ prop ];
-			toggle = toggle || value === "toggle";
-			if ( value === ( hidden ? "hide" : "show" ) ) {
-
-				// Pretend to be hidden if this is a "show" and
-				// there is still data from a stopped show/hide
-				if ( value === "show" && dataShow && dataShow[ prop ] !== undefined ) {
-					hidden = true;
-
-				// Ignore all other no-op show/hide data
-				} else {
-					continue;
-				}
-			}
-			orig[ prop ] = dataShow && dataShow[ prop ] || jQuery.style( elem, prop );
-		}
-	}
-
-	// Bail out if this is a no-op like .hide().hide()
-	propTween = !jQuery.isEmptyObject( props );
-	if ( !propTween && jQuery.isEmptyObject( orig ) ) {
-		return;
-	}
-
-	// Restrict "overflow" and "display" styles during box animations
-	if ( isBox && elem.nodeType === 1 ) {
-
-		// Support: IE <=9 - 11, Edge 12 - 15
-		// Record all 3 overflow attributes because IE does not infer the shorthand
-		// from identically-valued overflowX and overflowY and Edge just mirrors
-		// the overflowX value there.
-		opts.overflow = [ style.overflow, style.overflowX, style.overflowY ];
-
-		// Identify a display type, preferring old show/hide data over the CSS cascade
-		restoreDisplay = dataShow && dataShow.display;
-		if ( restoreDisplay == null ) {
-			restoreDisplay = dataPriv.get( elem, "display" );
-		}
-		display = jQuery.css( elem, "display" );
-		if ( display === "none" ) {
-			if ( restoreDisplay ) {
-				display = restoreDisplay;
-			} else {
-
-				// Get nonempty value(s) by temporarily forcing visibility
-				showHide( [ elem ], true );
-				restoreDisplay = elem.style.display || restoreDisplay;
-				display = jQuery.css( elem, "display" );
-				showHide( [ elem ] );
-			}
-		}
-
-		// Animate inline elements as inline-block
-		if ( display === "inline" || display === "inline-block" && restoreDisplay != null ) {
-			if ( jQuery.css( elem, "float" ) === "none" ) {
-
-				// Restore the original display value at the end of pure show/hide animations
-				if ( !propTween ) {
-					anim.done( function() {
-						style.display = restoreDisplay;
-					} );
-					if ( restoreDisplay == null ) {
-						display = style.display;
-						restoreDisplay = display === "none" ? "" : display;
-					}
-				}
-				style.display = "inline-block";
-			}
-		}
-	}
-
-	if ( opts.overflow ) {
-		style.overflow = "hidden";
-		anim.always( function() {
-			style.overflow = opts.overflow[ 0 ];
-			style.overflowX = opts.overflow[ 1 ];
-			style.overflowY = opts.overflow[ 2 ];
-		} );
-	}
-
-	// Implement show/hide animations
-	propTween = false;
-	for ( prop in orig ) {
-
-		// General show/hide setup for this element animation
-		if ( !propTween ) {
-			if ( dataShow ) {
-				if ( "hidden" in dataShow ) {
-					hidden = dataShow.hidden;
-				}
-			} else {
-				dataShow = dataPriv.access( elem, "fxshow", { display: restoreDisplay } );
-			}
-
-			// Store hidden/visible for toggle so `.stop().toggle()` "reverses"
-			if ( toggle ) {
-				dataShow.hidden = !hidden;
-			}
-
-			// Show elements before animating them
-			if ( hidden ) {
-				showHide( [ elem ], true );
-			}
-
-			/* eslint-disable no-loop-func */
-
-			anim.done( function() {
-
-				/* eslint-enable no-loop-func */
-
-				// The final step of a "hide" animation is actually hiding the element
-				if ( !hidden ) {
-					showHide( [ elem ] );
-				}
-				dataPriv.remove( elem, "fxshow" );
-				for ( prop in orig ) {
-					jQuery.style( elem, prop, orig[ prop ] );
-				}
-			} );
-		}
-
-		// Per-property setup
-		propTween = createTween( hidden ? dataShow[ prop ] : 0, prop, anim );
-		if ( !( prop in dataShow ) ) {
-			dataShow[ prop ] = propTween.start;
-			if ( hidden ) {
-				propTween.end = propTween.start;
-				propTween.start = 0;
-			}
-		}
-	}
-}
-
-function propFilter( props, specialEasing ) {
-	var index, name, easing, value, hooks;
-
-	// camelCase, specialEasing and expand cssHook pass
-	for ( index in props ) {
-		name = camelCase( index );
-		easing = specialEasing[ name ];
-		value = props[ index ];
-		if ( Array.isArray( value ) ) {
-			easing = value[ 1 ];
-			value = props[ index ] = value[ 0 ];
-		}
-
-		if ( index !== name ) {
-			props[ name ] = value;
-			delete props[ index ];
-		}
-
-		hooks = jQuery.cssHooks[ name ];
-		if ( hooks && "expand" in hooks ) {
-			value = hooks.expand( value );
-			delete props[ name ];
-
-			// Not quite $.extend, this won't overwrite existing keys.
-			// Reusing 'index' because we have the correct "name"
-			for ( index in value ) {
-				if ( !( index in props ) ) {
-					props[ index ] = value[ index ];
-					specialEasing[ index ] = easing;
-				}
-			}
-		} else {
-			specialEasing[ name ] = easing;
-		}
-	}
-}
-
-function Animation( elem, properties, options ) {
-	var result,
-		stopped,
-		index = 0,
-		length = Animation.prefilters.length,
-		deferred = jQuery.Deferred().always( function() {
-
-			// Don't match elem in the :animated selector
-			delete tick.elem;
-		} ),
-		tick = function() {
-			if ( stopped ) {
-				return false;
-			}
-			var currentTime = fxNow || createFxNow(),
-				remaining = Math.max( 0, animation.startTime + animation.duration - currentTime ),
-
-				// Support: Android 2.3 only
-				// Archaic crash bug won't allow us to use `1 - ( 0.5 || 0 )` (trac-12497)
-				temp = remaining / animation.duration || 0,
-				percent = 1 - temp,
-				index = 0,
-				length = animation.tweens.length;
-
-			for ( ; index < length; index++ ) {
-				animation.tweens[ index ].run( percent );
-			}
-
-			deferred.notifyWith( elem, [ animation, percent, remaining ] );
-
-			// If there's more to do, yield
-			if ( percent < 1 && length ) {
-				return remaining;
-			}
-
-			// If this was an empty animation, synthesize a final progress notification
-			if ( !length ) {
-				deferred.notifyWith( elem, [ animation, 1, 0 ] );
-			}
-
-			// Resolve the animation and report its conclusion
-			deferred.resolveWith( elem, [ animation ] );
-			return false;
-		},
-		animation = deferred.promise( {
-			elem: elem,
-			props: jQuery.extend( {}, properties ),
-			opts: jQuery.extend( true, {
-				specialEasing: {},
-				easing: jQuery.easing._default
-			}, options ),
-			originalProperties: properties,
-			originalOptions: options,
-			startTime: fxNow || createFxNow(),
-			duration: options.duration,
-			tweens: [],
-			createTween: function( prop, end ) {
-				var tween = jQuery.Tween( elem, animation.opts, prop, end,
-					animation.opts.specialEasing[ prop ] || animation.opts.easing );
-				animation.tweens.push( tween );
-				return tween;
-			},
-			stop: function( gotoEnd ) {
-				var index = 0,
-
-					// If we are going to the end, we want to run all the tweens
-					// otherwise we skip this part
-					length = gotoEnd ? animation.tweens.length : 0;
-				if ( stopped ) {
-					return this;
-				}
-				stopped = true;
-				for ( ; index < length; index++ ) {
-					animation.tweens[ index ].run( 1 );
-				}
-
-				// Resolve when we played the last frame; otherwise, reject
-				if ( gotoEnd ) {
-					deferred.notifyWith( elem, [ animation, 1, 0 ] );
-					deferred.resolveWith( elem, [ animation, gotoEnd ] );
-				} else {
-					deferred.rejectWith( elem, [ animation, gotoEnd ] );
-				}
-				return this;
-			}
-		} ),
-		props = animation.props;
-
-	propFilter( props, animation.opts.specialEasing );
-
-	for ( ; index < length; index++ ) {
-		result = Animation.prefilters[ index ].call( animation, elem, props, animation.opts );
-		if ( result ) {
-			if ( isFunction( result.stop ) ) {
-				jQuery._queueHooks( animation.elem, animation.opts.queue ).stop =
-					result.stop.bind( result );
-			}
-			return result;
-		}
-	}
-
-	jQuery.map( props, createTween, animation );
-
-	if ( isFunction( animation.opts.start ) ) {
-		animation.opts.start.call( elem, animation );
-	}
-
-	// Attach callbacks from options
-	animation
-		.progress( animation.opts.progress )
-		.done( animation.opts.done, animation.opts.complete )
-		.fail( animation.opts.fail )
-		.always( animation.opts.always );
-
-	jQuery.fx.timer(
-		jQuery.extend( tick, {
-			elem: elem,
-			anim: animation,
-			queue: animation.opts.queue
-		} )
-	);
-
-	return animation;
-}
-
-jQuery.Animation = jQuery.extend( Animation, {
-
-	tweeners: {
-		"*": [ function( prop, value ) {
-			var tween = this.createTween( prop, value );
-			adjustCSS( tween.elem, prop, rcssNum.exec( value ), tween );
-			return tween;
-		} ]
-	},
-
-	tweener: function( props, callback ) {
-		if ( isFunction( props ) ) {
-			callback = props;
-			props = [ "*" ];
-		} else {
-			props = props.match( rnothtmlwhite );
-		}
-
-		var prop,
-			index = 0,
-			length = props.length;
-
-		for ( ; index < length; index++ ) {
-			prop = props[ index ];
-			Animation.tweeners[ prop ] = Animation.tweeners[ prop ] || [];
-			Animation.tweeners[ prop ].unshift( callback );
-		}
-	},
-
-	prefilters: [ defaultPrefilter ],
-
-	prefilter: function( callback, prepend ) {
-		if ( prepend ) {
-			Animation.prefilters.unshift( callback );
-		} else {
-			Animation.prefilters.push( callback );
-		}
-	}
-} );
-
-jQuery.speed = function( speed, easing, fn ) {
-	var opt = speed && typeof speed === "object" ? jQuery.extend( {}, speed ) : {
-		complete: fn || !fn && easing ||
-			isFunction( speed ) && speed,
-		duration: speed,
-		easing: fn && easing || easing && !isFunction( easing ) && easing
-	};
-
-	// Go to the end state if fx are off
-	if ( jQuery.fx.off ) {
-		opt.duration = 0;
-
-	} else {
-		if ( typeof opt.duration !== "number" ) {
-			if ( opt.duration in jQuery.fx.speeds ) {
-				opt.duration = jQuery.fx.speeds[ opt.duration ];
-
-			} else {
-				opt.duration = jQuery.fx.speeds._default;
-			}
-		}
-	}
-
-	// Normalize opt.queue - true/undefined/null -> "fx"
-	if ( opt.queue == null || opt.queue === true ) {
-		opt.queue = "fx";
-	}
-
-	// Queueing
-	opt.old = opt.complete;
-
-	opt.complete = function() {
-		if ( isFunction( opt.old ) ) {
-			opt.old.call( this );
-		}
-
-		if ( opt.queue ) {
-			jQuery.dequeue( this, opt.queue );
-		}
-	};
-
-	return opt;
-};
-
-jQuery.fn.extend( {
-	fadeTo: function( speed, to, easing, callback ) {
-
-		// Show any hidden elements after setting opacity to 0
-		return this.filter( isHiddenWithinTree ).css( "opacity", 0 ).show()
-
-			// Animate to the value specified
-			.end().animate( { opacity: to }, speed, easing, callback );
-	},
-	animate: function( prop, speed, easing, callback ) {
-		var empty = jQuery.isEmptyObject( prop ),
-			optall = jQuery.speed( speed, easing, callback ),
-			doAnimation = function() {
-
-				// Operate on a copy of prop so per-property easing won't be lost
-				var anim = Animation( this, jQuery.extend( {}, prop ), optall );
-
-				// Empty animations, or finishing resolves immediately
-				if ( empty || dataPriv.get( this, "finish" ) ) {
-					anim.stop( true );
-				}
-			};
-
-		doAnimation.finish = doAnimation;
-
-		return empty || optall.queue === false ?
-			this.each( doAnimation ) :
-			this.queue( optall.queue, doAnimation );
-	},
-	stop: function( type, clearQueue, gotoEnd ) {
-		var stopQueue = function( hooks ) {
-			var stop = hooks.stop;
-			delete hooks.stop;
-			stop( gotoEnd );
-		};
-
-		if ( typeof type !== "string" ) {
-			gotoEnd = clearQueue;
-			clearQueue = type;
-			type = undefined;
-		}
-		if ( clearQueue ) {
-			this.queue( type || "fx", [] );
-		}
-
-		return this.each( function() {
-			var dequeue = true,
-				index = type != null && type + "queueHooks",
-				timers = jQuery.timers,
-				data = dataPriv.get( this );
-
-			if ( index ) {
-				if ( data[ index ] && data[ index ].stop ) {
-					stopQueue( data[ index ] );
-				}
-			} else {
-				for ( index in data ) {
-					if ( data[ index ] && data[ index ].stop && rrun.test( index ) ) {
-						stopQueue( data[ index ] );
-					}
-				}
-			}
-
-			for ( index = timers.length; index--; ) {
-				if ( timers[ index ].elem === this &&
-					( type == null || timers[ index ].queue === type ) ) {
-
-					timers[ index ].anim.stop( gotoEnd );
-					dequeue = false;
-					timers.splice( index, 1 );
-				}
-			}
-
-			// Start the next in the queue if the last step wasn't forced.
-			// Timers currently will call their complete callbacks, which
-			// will dequeue but only if they were gotoEnd.
-			if ( dequeue || !gotoEnd ) {
-				jQuery.dequeue( this, type );
-			}
-		} );
-	},
-	finish: function( type ) {
-		if ( type !== false ) {
-			type = type || "fx";
-		}
-		return this.each( function() {
-			var index,
-				data = dataPriv.get( this ),
-				queue = data[ type + "queue" ],
-				hooks = data[ type + "queueHooks" ],
-				timers = jQuery.timers,
-				length = queue ? queue.length : 0;
-
-			// Enable finishing flag on private data
-			data.finish = true;
-
-			// Empty the queue first
-			jQuery.queue( this, type, [] );
-
-			if ( hooks && hooks.stop ) {
-				hooks.stop.call( this, true );
-			}
-
-			// Look for any active animations, and finish them
-			for ( index = timers.length; index--; ) {
-				if ( timers[ index ].elem === this && timers[ index ].queue === type ) {
-					timers[ index ].anim.stop( true );
-					timers.splice( index, 1 );
-				}
-			}
-
-			// Look for any animations in the old queue and finish them
-			for ( index = 0; index < length; index++ ) {
-				if ( queue[ index ] && queue[ index ].finish ) {
-					queue[ index ].finish.call( this );
-				}
-			}
-
-			// Turn off finishing flag
-			delete data.finish;
-		} );
-	}
-} );
-
-jQuery.each( [ "toggle", "show", "hide" ], function( _i, name ) {
-	var cssFn = jQuery.fn[ name ];
-	jQuery.fn[ name ] = function( speed, easing, callback ) {
-		return speed == null || typeof speed === "boolean" ?
-			cssFn.apply( this, arguments ) :
-			this.animate( genFx( name, true ), speed, easing, callback );
-	};
-} );
-
-// Generate shortcuts for custom animations
-jQuery.each( {
-	slideDown: genFx( "show" ),
-	slideUp: genFx( "hide" ),
-	slideToggle: genFx( "toggle" ),
-	fadeIn: { opacity: "show" },
-	fadeOut: { opacity: "hide" },
-	fadeToggle: { opacity: "toggle" }
-}, function( name, props ) {
-	jQuery.fn[ name ] = function( speed, easing, callback ) {
-		return this.animate( props, speed, easing, callback );
-	};
-} );
-
-jQuery.timers = [];
-jQuery.fx.tick = function() {
-	var timer,
-		i = 0,
-		timers = jQuery.timers;
-
-	fxNow = Date.now();
-
-	for ( ; i < timers.length; i++ ) {
-		timer = timers[ i ];
-
-		// Run the timer and safely remove it when done (allowing for external removal)
-		if ( !timer() && timers[ i ] === timer ) {
-			timers.splice( i--, 1 );
-		}
-	}
-
-	if ( !timers.length ) {
-		jQuery.fx.stop();
-	}
-	fxNow = undefined;
-};
-
-jQuery.fx.timer = function( timer ) {
-	jQuery.timers.push( timer );
-	jQuery.fx.start();
-};
-
-jQuery.fx.interval = 13;
-jQuery.fx.start = function() {
-	if ( inProgress ) {
-		return;
-	}
-
-	inProgress = true;
-	schedule();
-};
-
-jQuery.fx.stop = function() {
-	inProgress = null;
-};
-
-jQuery.fx.speeds = {
-	slow: 600,
-	fast: 200,
-
-	// Default speed
-	_default: 400
-};
-
-
-// Based off of the plugin by Clint Helfers, with permission.
-jQuery.fn.delay = function( time, type ) {
-	time = jQuery.fx ? jQuery.fx.speeds[ time ] || time : time;
-	type = type || "fx";
-
-	return this.queue( type, function( next, hooks ) {
-		var timeout = window.setTimeout( next, time );
-		hooks.stop = function() {
-			window.clearTimeout( timeout );
-		};
-	} );
-};
-
-
-( function() {
-	var input = document.createElement( "input" ),
-		select = document.createElement( "select" ),
-		opt = select.appendChild( document.createElement( "option" ) );
-
-	input.type = "checkbox";
-
-	// Support: Android <=4.3 only
-	// Default value for a checkbox should be "on"
-	support.checkOn = input.value !== "";
-
-	// Support: IE <=11 only
-	// Must access selectedIndex to make default options select
-	support.optSelected = opt.selected;
-
-	// Support: IE <=11 only
-	// An input loses its value after becoming a radio
-	input = document.createElement( "input" );
-	input.value = "t";
-	input.type = "radio";
-	support.radioValue = input.value === "t";
-} )();
-
-
-var boolHook,
-	attrHandle = jQuery.expr.attrHandle;
-
-jQuery.fn.extend( {
-	attr: function( name, value ) {
-		return access( this, jQuery.attr, name, value, arguments.length > 1 );
-	},
-
-	removeAttr: function( name ) {
-		return this.each( function() {
-			jQuery.removeAttr( this, name );
-		} );
-	}
-} );
-
-jQuery.extend( {
-	attr: function( elem, name, value ) {
-		var ret, hooks,
-			nType = elem.nodeType;
-
-		// Don't get/set attributes on text, comment and attribute nodes
-		if ( nType === 3 || nType === 8 || nType === 2 ) {
-			return;
-		}
-
-		// Fallback to prop when attributes are not supported
-		if ( typeof elem.getAttribute === "undefined" ) {
-			return jQuery.prop( elem, name, value );
-		}
-
-		// Attribute hooks are determined by the lowercase version
-		// Grab necessary hook if one is defined
-		if ( nType !== 1 || !jQuery.isXMLDoc( elem ) ) {
-			hooks = jQuery.attrHooks[ name.toLowerCase() ] ||
-				( jQuery.expr.match.bool.test( name ) ? boolHook : undefined );
-		}
-
-		if ( value !== undefined ) {
-			if ( value === null ) {
-				jQuery.removeAttr( elem, name );
-				return;
-			}
-
-			if ( hooks && "set" in hooks &&
-				( ret = hooks.set( elem, value, name ) ) !== undefined ) {
-				return ret;
-			}
-
-			elem.setAttribute( name, value + "" );
-			return value;
-		}
-
-		if ( hooks && "get" in hooks && ( ret = hooks.get( elem, name ) ) !== null ) {
-			return ret;
-		}
-
-		ret = jQuery.find.attr( elem, name );
-
-		// Non-existent attributes return null, we normalize to undefined
-		return ret == null ? undefined : ret;
-	},
-
-	attrHooks: {
-		type: {
-			set: function( elem, value ) {
-				if ( !support.radioValue && value === "radio" &&
-					nodeName( elem, "input" ) ) {
-					var val = elem.value;
-					elem.setAttribute( "type", value );
-					if ( val ) {
-						elem.value = val;
-					}
-					return value;
-				}
-			}
-		}
-	},
-
-	removeAttr: function( elem, value ) {
-		var name,
-			i = 0,
-
-			// Attribute names can contain non-HTML whitespace characters
-			// https://html.spec.whatwg.org/multipage/syntax.html#attributes-2
-			attrNames = value && value.match( rnothtmlwhite );
-
-		if ( attrNames && elem.nodeType === 1 ) {
-			while ( ( name = attrNames[ i++ ] ) ) {
-				elem.removeAttribute( name );
-			}
-		}
-	}
-} );
-
-// Hooks for boolean attributes
-boolHook = {
-	set: function( elem, value, name ) {
-		if ( value === false ) {
-
-			// Remove boolean attributes when set to false
-			jQuery.removeAttr( elem, name );
-		} else {
-			elem.setAttribute( name, name );
-		}
-		return name;
-	}
-};
-
-jQuery.each( jQuery.expr.match.bool.source.match( /\w+/g ), function( _i, name ) {
-	var getter = attrHandle[ name ] || jQuery.find.attr;
-
-	attrHandle[ name ] = function( elem, name, isXML ) {
-		var ret, handle,
-			lowercaseName = name.toLowerCase();
-
-		if ( !isXML ) {
-
-			// Avoid an infinite loop by temporarily removing this function from the getter
-			handle = attrHandle[ lowercaseName ];
-			attrHandle[ lowercaseName ] = ret;
-			ret = getter( elem, name, isXML ) != null ?
-				lowercaseName :
-				null;
-			attrHandle[ lowercaseName ] = handle;
-		}
-		return ret;
-	};
-} );
-
-
-
-
-var rfocusable = /^(?:input|select|textarea|button)$/i,
-	rclickable = /^(?:a|area)$/i;
-
-jQuery.fn.extend( {
-	prop: function( name, value ) {
-		return access( this, jQuery.prop, name, value, arguments.length > 1 );
-	},
-
-	removeProp: function( name ) {
-		return this.each( function() {
-			delete this[ jQuery.propFix[ name ] || name ];
-		} );
-	}
-} );
-
-jQuery.extend( {
-	prop: function( elem, name, value ) {
-		var ret, hooks,
-			nType = elem.nodeType;
-
-		// Don't get/set properties on text, comment and attribute nodes
-		if ( nType === 3 || nType === 8 || nType === 2 ) {
-			return;
-		}
-
-		if ( nType !== 1 || !jQuery.isXMLDoc( elem ) ) {
-
-			// Fix name and attach hooks
-			name = jQuery.propFix[ name ] || name;
-			hooks = jQuery.propHooks[ name ];
-		}
-
-		if ( value !== undefined ) {
-			if ( hooks && "set" in hooks &&
-				( ret = hooks.set( elem, value, name ) ) !== undefined ) {
-				return ret;
-			}
-
-			return ( elem[ name ] = value );
-		}
-
-		if ( hooks && "get" in hooks && ( ret = hooks.get( elem, name ) ) !== null ) {
-			return ret;
-		}
-
-		return elem[ name ];
-	},
-
-	propHooks: {
-		tabIndex: {
-			get: function( elem ) {
-
-				// Support: IE <=9 - 11 only
-				// elem.tabIndex doesn't always return the
-				// correct value when it hasn't been explicitly set
-				// Use proper attribute retrieval (trac-12072)
-				var tabindex = jQuery.find.attr( elem, "tabindex" );
-
-				if ( tabindex ) {
-					return parseInt( tabindex, 10 );
-				}
-
-				if (
-					rfocusable.test( elem.nodeName ) ||
-					rclickable.test( elem.nodeName ) &&
-					elem.href
-				) {
-					return 0;
-				}
-
-				return -1;
-			}
-		}
-	},
-
-	propFix: {
-		"for": "htmlFor",
-		"class": "className"
-	}
-} );
-
-// Support: IE <=11 only
-// Accessing the selectedIndex property
-// forces the browser to respect setting selected
-// on the option
-// The getter ensures a default option is selected
-// when in an optgroup
-// eslint rule "no-unused-expressions" is disabled for this code
-// since it considers such accessions noop
-if ( !support.optSelected ) {
-	jQuery.propHooks.selected = {
-		get: function( elem ) {
-
-			/* eslint no-unused-expressions: "off" */
-
-			var parent = elem.parentNode;
-			if ( parent && parent.parentNode ) {
-				parent.parentNode.selectedIndex;
-			}
-			return null;
-		},
-		set: function( elem ) {
-
-			/* eslint no-unused-expressions: "off" */
-
-			var parent = elem.parentNode;
-			if ( parent ) {
-				parent.selectedIndex;
-
-				if ( parent.parentNode ) {
-					parent.parentNode.selectedIndex;
-				}
-			}
-		}
-	};
-}
-
-jQuery.each( [
-	"tabIndex",
-	"readOnly",
-	"maxLength",
-	"cellSpacing",
-	"cellPadding",
-	"rowSpan",
-	"colSpan",
-	"useMap",
-	"frameBorder",
-	"contentEditable"
-], function() {
-	jQuery.propFix[ this.toLowerCase() ] = this;
-} );
-
-
-
-
-	// Strip and collapse whitespace according to HTML spec
-	// https://infra.spec.whatwg.org/#strip-and-collapse-ascii-whitespace
-	function stripAndCollapse( value ) {
-		var tokens = value.match( rnothtmlwhite ) || [];
-		return tokens.join( " " );
-	}
-
-
-function getClass( elem ) {
-	return elem.getAttribute && elem.getAttribute( "class" ) || "";
-}
-
-function classesToArray( value ) {
-	if ( Array.isArray( value ) ) {
-		return value;
-	}
-	if ( typeof value === "string" ) {
-		return value.match( rnothtmlwhite ) || [];
-	}
-	return [];
-}
-
-jQuery.fn.extend( {
-	addClass: function( value ) {
-		var classNames, cur, curValue, className, i, finalValue;
-
-		if ( isFunction( value ) ) {
-			return this.each( function( j ) {
-				jQuery( this ).addClass( value.call( this, j, getClass( this ) ) );
-			} );
-		}
-
-		classNames = classesToArray( value );
-
-		if ( classNames.length ) {
-			return this.each( function() {
-				curValue = getClass( this );
-				cur = this.nodeType === 1 && ( " " + stripAndCollapse( curValue ) + " " );
-
-				if ( cur ) {
-					for ( i = 0; i < classNames.length; i++ ) {
-						className = classNames[ i ];
-						if ( cur.indexOf( " " + className + " " ) < 0 ) {
-							cur += className + " ";
-						}
-					}
-
-					// Only assign if different to avoid unneeded rendering.
-					finalValue = stripAndCollapse( cur );
-					if ( curValue !== finalValue ) {
-						this.setAttribute( "class", finalValue );
-					}
-				}
-			} );
-		}
-
-		return this;
-	},
-
-	removeClass: function( value ) {
-		var classNames, cur, curValue, className, i, finalValue;
-
-		if ( isFunction( value ) ) {
-			return this.each( function( j ) {
-				jQuery( this ).removeClass( value.call( this, j, getClass( this ) ) );
-			} );
-		}
-
-		if ( !arguments.length ) {
-			return this.attr( "class", "" );
-		}
-
-		classNames = classesToArray( value );
-
-		if ( classNames.length ) {
-			return this.each( function() {
-				curValue = getClass( this );
-
-				// This expression is here for better compressibility (see addClass)
-				cur = this.nodeType === 1 && ( " " + stripAndCollapse( curValue ) + " " );
-
-				if ( cur ) {
-					for ( i = 0; i < classNames.length; i++ ) {
-						className = classNames[ i ];
-
-						// Remove *all* instances
-						while ( cur.indexOf( " " + className + " " ) > -1 ) {
-							cur = cur.replace( " " + className + " ", " " );
-						}
-					}
-
-					// Only assign if different to avoid unneeded rendering.
-					finalValue = stripAndCollapse( cur );
-					if ( curValue !== finalValue ) {
-						this.setAttribute( "class", finalValue );
-					}
-				}
-			} );
-		}
-
-		return this;
-	},
-
-	toggleClass: function( value, stateVal ) {
-		var classNames, className, i, self,
-			type = typeof value,
-			isValidValue = type === "string" || Array.isArray( value );
-
-		if ( isFunction( value ) ) {
-			return this.each( function( i ) {
-				jQuery( this ).toggleClass(
-					value.call( this, i, getClass( this ), stateVal ),
-					stateVal
-				);
-			} );
-		}
-
-		if ( typeof stateVal === "boolean" && isValidValue ) {
-			return stateVal ? this.addClass( value ) : this.removeClass( value );
-		}
-
-		classNames = classesToArray( value );
-
-		return this.each( function() {
-			if ( isValidValue ) {
-
-				// Toggle individual class names
-				self = jQuery( this );
-
-				for ( i = 0; i < classNames.length; i++ ) {
-					className = classNames[ i ];
-
-					// Check each className given, space separated list
-					if ( self.hasClass( className ) ) {
-						self.removeClass( className );
-					} else {
-						self.addClass( className );
-					}
-				}
-
-			// Toggle whole class name
-			} else if ( value === undefined || type === "boolean" ) {
-				className = getClass( this );
-				if ( className ) {
-
-					// Store className if set
-					dataPriv.set( this, "__className__", className );
-				}
-
-				// If the element has a class name or if we're passed `false`,
-				// then remove the whole classname (if there was one, the above saved it).
-				// Otherwise bring back whatever was previously saved (if anything),
-				// falling back to the empty string if nothing was stored.
-				if ( this.setAttribute ) {
-					this.setAttribute( "class",
-						className || value === false ?
-							"" :
-							dataPriv.get( this, "__className__" ) || ""
-					);
-				}
-			}
-		} );
-	},
-
-	hasClass: function( selector ) {
-		var className, elem,
-			i = 0;
-
-		className = " " + selector + " ";
-		while ( ( elem = this[ i++ ] ) ) {
-			if ( elem.nodeType === 1 &&
-				( " " + stripAndCollapse( getClass( elem ) ) + " " ).indexOf( className ) > -1 ) {
-				return true;
-			}
-		}
-
-		return false;
-	}
-} );
-
-
-
-
-var rreturn = /\r/g;
-
-jQuery.fn.extend( {
-	val: function( value ) {
-		var hooks, ret, valueIsFunction,
-			elem = this[ 0 ];
-
-		if ( !arguments.length ) {
-			if ( elem ) {
-				hooks = jQuery.valHooks[ elem.type ] ||
-					jQuery.valHooks[ elem.nodeName.toLowerCase() ];
-
-				if ( hooks &&
-					"get" in hooks &&
-					( ret = hooks.get( elem, "value" ) ) !== undefined
-				) {
-					return ret;
-				}
-
-				ret = elem.value;
-
-				// Handle most common string cases
-				if ( typeof ret === "string" ) {
-					return ret.replace( rreturn, "" );
-				}
-
-				// Handle cases where value is null/undef or number
-				return ret == null ? "" : ret;
-			}
-
-			return;
-		}
-
-		valueIsFunction = isFunction( value );
-
-		return this.each( function( i ) {
-			var val;
-
-			if ( this.nodeType !== 1 ) {
-				return;
-			}
-
-			if ( valueIsFunction ) {
-				val = value.call( this, i, jQuery( this ).val() );
-			} else {
-				val = value;
-			}
-
-			// Treat null/undefined as ""; convert numbers to string
-			if ( val == null ) {
-				val = "";
-
-			} else if ( typeof val === "number" ) {
-				val += "";
-
-			} else if ( Array.isArray( val ) ) {
-				val = jQuery.map( val, function( value ) {
-					return value == null ? "" : value + "";
-				} );
-			}
-
-			hooks = jQuery.valHooks[ this.type ] || jQuery.valHooks[ this.nodeName.toLowerCase() ];
-
-			// If set returns undefined, fall back to normal setting
-			if ( !hooks || !( "set" in hooks ) || hooks.set( this, val, "value" ) === undefined ) {
-				this.value = val;
-			}
-		} );
-	}
-} );
-
-jQuery.extend( {
-	valHooks: {
-		option: {
-			get: function( elem ) {
-
-				var val = jQuery.find.attr( elem, "value" );
-				return val != null ?
-					val :
-
-					// Support: IE <=10 - 11 only
-					// option.text throws exceptions (trac-14686, trac-14858)
-					// Strip and collapse whitespace
-					// https://html.spec.whatwg.org/#strip-and-collapse-whitespace
-					stripAndCollapse( jQuery.text( elem ) );
-			}
-		},
-		select: {
-			get: function( elem ) {
-				var value, option, i,
-					options = elem.options,
-					index = elem.selectedIndex,
-					one = elem.type === "select-one",
-					values = one ? null : [],
-					max = one ? index + 1 : options.length;
-
-				if ( index < 0 ) {
-					i = max;
-
-				} else {
-					i = one ? index : 0;
-				}
-
-				// Loop through all the selected options
-				for ( ; i < max; i++ ) {
-					option = options[ i ];
-
-					// Support: IE <=9 only
-					// IE8-9 doesn't update selected after form reset (trac-2551)
-					if ( ( option.selected || i === index ) &&
-
-							// Don't return options that are disabled or in a disabled optgroup
-							!option.disabled &&
-							( !option.parentNode.disabled ||
-								!nodeName( option.parentNode, "optgroup" ) ) ) {
-
-						// Get the specific value for the option
-						value = jQuery( option ).val();
-
-						// We don't need an array for one selects
-						if ( one ) {
-							return value;
-						}
-
-						// Multi-Selects return an array
-						values.push( value );
-					}
-				}
-
-				return values;
-			},
-
-			set: function( elem, value ) {
-				var optionSet, option,
-					options = elem.options,
-					values = jQuery.makeArray( value ),
-					i = options.length;
-
-				while ( i-- ) {
-					option = options[ i ];
-
-					/* eslint-disable no-cond-assign */
-
-					if ( option.selected =
-						jQuery.inArray( jQuery.valHooks.option.get( option ), values ) > -1
-					) {
-						optionSet = true;
-					}
-
-					/* eslint-enable no-cond-assign */
-				}
-
-				// Force browsers to behave consistently when non-matching value is set
-				if ( !optionSet ) {
-					elem.selectedIndex = -1;
-				}
-				return values;
-			}
-		}
-	}
-} );
-
-// Radios and checkboxes getter/setter
-jQuery.each( [ "radio", "checkbox" ], function() {
-	jQuery.valHooks[ this ] = {
-		set: function( elem, value ) {
-			if ( Array.isArray( value ) ) {
-				return ( elem.checked = jQuery.inArray( jQuery( elem ).val(), value ) > -1 );
-			}
-		}
-	};
-	if ( !support.checkOn ) {
-		jQuery.valHooks[ this ].get = function( elem ) {
-			return elem.getAttribute( "value" ) === null ? "on" : elem.value;
-		};
-	}
-} );
-
-
-
-
-// Return jQuery for attributes-only inclusion
-var location = window.location;
-
-var nonce = { guid: Date.now() };
-
-var rquery = ( /\?/ );
-
-
-
-// Cross-browser xml parsing
-jQuery.parseXML = function( data ) {
-	var xml, parserErrorElem;
-	if ( !data || typeof data !== "string" ) {
-		return null;
-	}
-
-	// Support: IE 9 - 11 only
-	// IE throws on parseFromString with invalid input.
-	try {
-		xml = ( new window.DOMParser() ).parseFromString( data, "text/xml" );
-	} catch ( e ) {}
-
-	parserErrorElem = xml && xml.getElementsByTagName( "parsererror" )[ 0 ];
-	if ( !xml || parserErrorElem ) {
-		jQuery.error( "Invalid XML: " + (
-			parserErrorElem ?
-				jQuery.map( parserErrorElem.childNodes, function( el ) {
-					return el.textContent;
-				} ).join( "\n" ) :
-				data
-		) );
-	}
-	return xml;
-};
-
-
-var rfocusMorph = /^(?:focusinfocus|focusoutblur)$/,
-	stopPropagationCallback = function( e ) {
-		e.stopPropagation();
-	};
-
-jQuery.extend( jQuery.event, {
-
-	trigger: function( event, data, elem, onlyHandlers ) {
-
-		var i, cur, tmp, bubbleType, ontype, handle, special, lastElement,
-			eventPath = [ elem || document ],
-			type = hasOwn.call( event, "type" ) ? event.type : event,
-			namespaces = hasOwn.call( event, "namespace" ) ? event.namespace.split( "." ) : [];
-
-		cur = lastElement = tmp = elem = elem || document;
-
-		// Don't do events on text and comment nodes
-		if ( elem.nodeType === 3 || elem.nodeType === 8 ) {
-			return;
-		}
-
-		// focus/blur morphs to focusin/out; ensure we're not firing them right now
-		if ( rfocusMorph.test( type + jQuery.event.triggered ) ) {
-			return;
-		}
-
-		if ( type.indexOf( "." ) > -1 ) {
-
-			// Namespaced trigger; create a regexp to match event type in handle()
-			namespaces = type.split( "." );
-			type = namespaces.shift();
-			namespaces.sort();
-		}
-		ontype = type.indexOf( ":" ) < 0 && "on" + type;
-
-		// Caller can pass in a jQuery.Event object, Object, or just an event type string
-		event = event[ jQuery.expando ] ?
-			event :
-			new jQuery.Event( type, typeof event === "object" && event );
-
-		// Trigger bitmask: & 1 for native handlers; & 2 for jQuery (always true)
-		event.isTrigger = onlyHandlers ? 2 : 3;
-		event.namespace = namespaces.join( "." );
-		event.rnamespace = event.namespace ?
-			new RegExp( "(^|\\.)" + namespaces.join( "\\.(?:.*\\.|)" ) + "(\\.|$)" ) :
-			null;
-
-		// Clean up the event in case it is being reused
-		event.result = undefined;
-		if ( !event.target ) {
-			event.target = elem;
-		}
-
-		// Clone any incoming data and prepend the event, creating the handler arg list
-		data = data == null ?
-			[ event ] :
-			jQuery.makeArray( data, [ event ] );
-
-		// Allow special events to draw outside the lines
-		special = jQuery.event.special[ type ] || {};
-		if ( !onlyHandlers && special.trigger && special.trigger.apply( elem, data ) === false ) {
-			return;
-		}
-
-		// Determine event propagation path in advance, per W3C events spec (trac-9951)
-		// Bubble up to document, then to window; watch for a global ownerDocument var (trac-9724)
-		if ( !onlyHandlers && !special.noBubble && !isWindow( elem ) ) {
-
-			bubbleType = special.delegateType || type;
-			if ( !rfocusMorph.test( bubbleType + type ) ) {
-				cur = cur.parentNode;
-			}
-			for ( ; cur; cur = cur.parentNode ) {
-				eventPath.push( cur );
-				tmp = cur;
-			}
-
-			// Only add window if we got to document (e.g., not plain obj or detached DOM)
-			if ( tmp === ( elem.ownerDocument || document ) ) {
-				eventPath.push( tmp.defaultView || tmp.parentWindow || window );
-			}
-		}
-
-		// Fire handlers on the event path
-		i = 0;
-		while ( ( cur = eventPath[ i++ ] ) && !event.isPropagationStopped() ) {
-			lastElement = cur;
-			event.type = i > 1 ?
-				bubbleType :
-				special.bindType || type;
-
-			// jQuery handler
-			handle = ( dataPriv.get( cur, "events" ) || Object.create( null ) )[ event.type ] &&
-				dataPriv.get( cur, "handle" );
-			if ( handle ) {
-				handle.apply( cur, data );
-			}
-
-			// Native handler
-			handle = ontype && cur[ ontype ];
-			if ( handle && handle.apply && acceptData( cur ) ) {
-				event.result = handle.apply( cur, data );
-				if ( event.result === false ) {
-					event.preventDefault();
-				}
-			}
-		}
-		event.type = type;
-
-		// If nobody prevented the default action, do it now
-		if ( !onlyHandlers && !event.isDefaultPrevented() ) {
-
-			if ( ( !special._default ||
-				special._default.apply( eventPath.pop(), data ) === false ) &&
-				acceptData( elem ) ) {
-
-				// Call a native DOM method on the target with the same name as the event.
-				// Don't do default actions on window, that's where global variables be (trac-6170)
-				if ( ontype && isFunction( elem[ type ] ) && !isWindow( elem ) ) {
-
-					// Don't re-trigger an onFOO event when we call its FOO() method
-					tmp = elem[ ontype ];
-
-					if ( tmp ) {
-						elem[ ontype ] = null;
-					}
-
-					// Prevent re-triggering of the same event, since we already bubbled it above
-					jQuery.event.triggered = type;
-
-					if ( event.isPropagationStopped() ) {
-						lastElement.addEventListener( type, stopPropagationCallback );
-					}
-
-					elem[ type ]();
-
-					if ( event.isPropagationStopped() ) {
-						lastElement.removeEventListener( type, stopPropagationCallback );
-					}
-
-					jQuery.event.triggered = undefined;
-
-					if ( tmp ) {
-						elem[ ontype ] = tmp;
-					}
-				}
-			}
-		}
-
-		return event.result;
-	},
-
-	// Piggyback on a donor event to simulate a different one
-	// Used only for `focus(in | out)` events
-	simulate: function( type, elem, event ) {
-		var e = jQuery.extend(
-			new jQuery.Event(),
-			event,
-			{
-				type: type,
-				isSimulated: true
-			}
-		);
-
-		jQuery.event.trigger( e, null, elem );
-	}
-
-} );
-
-jQuery.fn.extend( {
-
-	trigger: function( type, data ) {
-		return this.each( function() {
-			jQuery.event.trigger( type, data, this );
-		} );
-	},
-	triggerHandler: function( type, data ) {
-		var elem = this[ 0 ];
-		if ( elem ) {
-			return jQuery.event.trigger( type, data, elem, true );
-		}
-	}
-} );
-
-
-var
-	rbracket = /\[\]$/,
-	rCRLF = /\r?\n/g,
-	rsubmitterTypes = /^(?:submit|button|image|reset|file)$/i,
-	rsubmittable = /^(?:input|select|textarea|keygen)/i;
-
-function buildParams( prefix, obj, traditional, add ) {
-	var name;
-
-	if ( Array.isArray( obj ) ) {
-
-		// Serialize array item.
-		jQuery.each( obj, function( i, v ) {
-			if ( traditional || rbracket.test( prefix ) ) {
-
-				// Treat each array item as a scalar.
-				add( prefix, v );
-
-			} else {
-
-				// Item is non-scalar (array or object), encode its numeric index.
-				buildParams(
-					prefix + "[" + ( typeof v === "object" && v != null ? i : "" ) + "]",
-					v,
-					traditional,
-					add
-				);
-			}
-		} );
-
-	} else if ( !traditional && toType( obj ) === "object" ) {
-
-		// Serialize object item.
-		for ( name in obj ) {
-			buildParams( prefix + "[" + name + "]", obj[ name ], traditional, add );
-		}
-
-	} else {
-
-		// Serialize scalar item.
-		add( prefix, obj );
-	}
-}
-
-// Serialize an array of form elements or a set of
-// key/values into a query string
-jQuery.param = function( a, traditional ) {
-	var prefix,
-		s = [],
-		add = function( key, valueOrFunction ) {
-
-			// If value is a function, invoke it and use its return value
-			var value = isFunction( valueOrFunction ) ?
-				valueOrFunction() :
-				valueOrFunction;
-
-			s[ s.length ] = encodeURIComponent( key ) + "=" +
-				encodeURIComponent( value == null ? "" : value );
-		};
-
-	if ( a == null ) {
-		return "";
-	}
-
-	// If an array was passed in, assume that it is an array of form elements.
-	if ( Array.isArray( a ) || ( a.jquery && !jQuery.isPlainObject( a ) ) ) {
-
-		// Serialize the form elements
-		jQuery.each( a, function() {
-			add( this.name, this.value );
-		} );
-
-	} else {
-
-		// If traditional, encode the "old" way (the way 1.3.2 or older
-		// did it), otherwise encode params recursively.
-		for ( prefix in a ) {
-			buildParams( prefix, a[ prefix ], traditional, add );
-		}
-	}
-
-	// Return the resulting serialization
-	return s.join( "&" );
-};
-
-jQuery.fn.extend( {
-	serialize: function() {
-		return jQuery.param( this.serializeArray() );
-	},
-	serializeArray: function() {
-		return this.map( function() {
-
-			// Can add propHook for "elements" to filter or add form elements
-			var elements = jQuery.prop( this, "elements" );
-			return elements ? jQuery.makeArray( elements ) : this;
-		} ).filter( function() {
-			var type = this.type;
-
-			// Use .is( ":disabled" ) so that fieldset[disabled] works
-			return this.name && !jQuery( this ).is( ":disabled" ) &&
-				rsubmittable.test( this.nodeName ) && !rsubmitterTypes.test( type ) &&
-				( this.checked || !rcheckableType.test( type ) );
-		} ).map( function( _i, elem ) {
-			var val = jQuery( this ).val();
-
-			if ( val == null ) {
-				return null;
-			}
-
-			if ( Array.isArray( val ) ) {
-				return jQuery.map( val, function( val ) {
-					return { name: elem.name, value: val.replace( rCRLF, "\r\n" ) };
-				} );
-			}
-
-			return { name: elem.name, value: val.replace( rCRLF, "\r\n" ) };
-		} ).get();
-	}
-} );
-
-
-var
-	r20 = /%20/g,
-	rhash = /#.*$/,
-	rantiCache = /([?&])_=[^&]*/,
-	rheaders = /^(.*?):[ \t]*([^\r\n]*)$/mg,
-
-	// trac-7653, trac-8125, trac-8152: local protocol detection
-	rlocalProtocol = /^(?:about|app|app-storage|.+-extension|file|res|widget):$/,
-	rnoContent = /^(?:GET|HEAD)$/,
-	rprotocol = /^\/\//,
-
-	/* Prefilters
-	 * 1) They are useful to introduce custom dataTypes (see ajax/jsonp.js for an example)
-	 * 2) These are called:
-	 *    - BEFORE asking for a transport
-	 *    - AFTER param serialization (s.data is a string if s.processData is true)
-	 * 3) key is the dataType
-	 * 4) the catchall symbol "*" can be used
-	 * 5) execution will start with transport dataType and THEN continue down to "*" if needed
-	 */
-	prefilters = {},
-
-	/* Transports bindings
-	 * 1) key is the dataType
-	 * 2) the catchall symbol "*" can be used
-	 * 3) selection will start with transport dataType and THEN go to "*" if needed
-	 */
-	transports = {},
-
-	// Avoid comment-prolog char sequence (trac-10098); must appease lint and evade compression
-	allTypes = "*/".concat( "*" ),
-
-	// Anchor tag for parsing the document origin
-	originAnchor = document.createElement( "a" );
-
-originAnchor.href = location.href;
-
-// Base "constructor" for jQuery.ajaxPrefilter and jQuery.ajaxTransport
-function addToPrefiltersOrTransports( structure ) {
-
-	// dataTypeExpression is optional and defaults to "*"
-	return function( dataTypeExpression, func ) {
-
-		if ( typeof dataTypeExpression !== "string" ) {
-			func = dataTypeExpression;
-			dataTypeExpression = "*";
-		}
-
-		var dataType,
-			i = 0,
-			dataTypes = dataTypeExpression.toLowerCase().match( rnothtmlwhite ) || [];
-
-		if ( isFunction( func ) ) {
-
-			// For each dataType in the dataTypeExpression
-			while ( ( dataType = dataTypes[ i++ ] ) ) {
-
-				// Prepend if requested
-				if ( dataType[ 0 ] === "+" ) {
-					dataType = dataType.slice( 1 ) || "*";
-					( structure[ dataType ] = structure[ dataType ] || [] ).unshift( func );
-
-				// Otherwise append
-				} else {
-					( structure[ dataType ] = structure[ dataType ] || [] ).push( func );
-				}
-			}
-		}
-	};
-}
-
-// Base inspection function for prefilters and transports
-function inspectPrefiltersOrTransports( structure, options, originalOptions, jqXHR ) {
-
-	var inspected = {},
-		seekingTransport = ( structure === transports );
-
-	function inspect( dataType ) {
-		var selected;
-		inspected[ dataType ] = true;
-		jQuery.each( structure[ dataType ] || [], function( _, prefilterOrFactory ) {
-			var dataTypeOrTransport = prefilterOrFactory( options, originalOptions, jqXHR );
-			if ( typeof dataTypeOrTransport === "string" &&
-				!seekingTransport && !inspected[ dataTypeOrTransport ] ) {
-
-				options.dataTypes.unshift( dataTypeOrTransport );
-				inspect( dataTypeOrTransport );
-				return false;
-			} else if ( seekingTransport ) {
-				return !( selected = dataTypeOrTransport );
-			}
-		} );
-		return selected;
-	}
-
-	return inspect( options.dataTypes[ 0 ] ) || !inspected[ "*" ] && inspect( "*" );
-}
-
-// A special extend for ajax options
-// that takes "flat" options (not to be deep extended)
-// Fixes trac-9887
-function ajaxExtend( target, src ) {
-	var key, deep,
-		flatOptions = jQuery.ajaxSettings.flatOptions || {};
-
-	for ( key in src ) {
-		if ( src[ key ] !== undefined ) {
-			( flatOptions[ key ] ? target : ( deep || ( deep = {} ) ) )[ key ] = src[ key ];
-		}
-	}
-	if ( deep ) {
-		jQuery.extend( true, target, deep );
-	}
-
-	return target;
-}
-
-/* Handles responses to an ajax request:
- * - finds the right dataType (mediates between content-type and expected dataType)
- * - returns the corresponding response
- */
-function ajaxHandleResponses( s, jqXHR, responses ) {
-
-	var ct, type, finalDataType, firstDataType,
-		contents = s.contents,
-		dataTypes = s.dataTypes;
-
-	// Remove auto dataType and get content-type in the process
-	while ( dataTypes[ 0 ] === "*" ) {
-		dataTypes.shift();
-		if ( ct === undefined ) {
-			ct = s.mimeType || jqXHR.getResponseHeader( "Content-Type" );
-		}
-	}
-
-	// Check if we're dealing with a known content-type
-	if ( ct ) {
-		for ( type in contents ) {
-			if ( contents[ type ] && contents[ type ].test( ct ) ) {
-				dataTypes.unshift( type );
-				break;
-			}
-		}
-	}
-
-	// Check to see if we have a response for the expected dataType
-	if ( dataTypes[ 0 ] in responses ) {
-		finalDataType = dataTypes[ 0 ];
-	} else {
-
-		// Try convertible dataTypes
-		for ( type in responses ) {
-			if ( !dataTypes[ 0 ] || s.converters[ type + " " + dataTypes[ 0 ] ] ) {
-				finalDataType = type;
-				break;
-			}
-			if ( !firstDataType ) {
-				firstDataType = type;
-			}
-		}
-
-		// Or just use first one
-		finalDataType = finalDataType || firstDataType;
-	}
-
-	// If we found a dataType
-	// We add the dataType to the list if needed
-	// and return the corresponding response
-	if ( finalDataType ) {
-		if ( finalDataType !== dataTypes[ 0 ] ) {
-			dataTypes.unshift( finalDataType );
-		}
-		return responses[ finalDataType ];
-	}
-}
-
-/* Chain conversions given the request and the original response
- * Also sets the responseXXX fields on the jqXHR instance
- */
-function ajaxConvert( s, response, jqXHR, isSuccess ) {
-	var conv2, current, conv, tmp, prev,
-		converters = {},
-
-		// Work with a copy of dataTypes in case we need to modify it for conversion
-		dataTypes = s.dataTypes.slice();
-
-	// Create converters map with lowercased keys
-	if ( dataTypes[ 1 ] ) {
-		for ( conv in s.converters ) {
-			converters[ conv.toLowerCase() ] = s.converters[ conv ];
-		}
-	}
-
-	current = dataTypes.shift();
-
-	// Convert to each sequential dataType
-	while ( current ) {
-
-		if ( s.responseFields[ current ] ) {
-			jqXHR[ s.responseFields[ current ] ] = response;
-		}
-
-		// Apply the dataFilter if provided
-		if ( !prev && isSuccess && s.dataFilter ) {
-			response = s.dataFilter( response, s.dataType );
-		}
-
-		prev = current;
-		current = dataTypes.shift();
-
-		if ( current ) {
-
-			// There's only work to do if current dataType is non-auto
-			if ( current === "*" ) {
-
-				current = prev;
-
-			// Convert response if prev dataType is non-auto and differs from current
-			} else if ( prev !== "*" && prev !== current ) {
-
-				// Seek a direct converter
-				conv = converters[ prev + " " + current ] || converters[ "* " + current ];
-
-				// If none found, seek a pair
-				if ( !conv ) {
-					for ( conv2 in converters ) {
-
-						// If conv2 outputs current
-						tmp = conv2.split( " " );
-						if ( tmp[ 1 ] === current ) {
-
-							// If prev can be converted to accepted input
-							conv = converters[ prev + " " + tmp[ 0 ] ] ||
-								converters[ "* " + tmp[ 0 ] ];
-							if ( conv ) {
-
-								// Condense equivalence converters
-								if ( conv === true ) {
-									conv = converters[ conv2 ];
-
-								// Otherwise, insert the intermediate dataType
-								} else if ( converters[ conv2 ] !== true ) {
-									current = tmp[ 0 ];
-									dataTypes.unshift( tmp[ 1 ] );
-								}
-								break;
-							}
-						}
-					}
-				}
-
-				// Apply converter (if not an equivalence)
-				if ( conv !== true ) {
-
-					// Unless errors are allowed to bubble, catch and return them
-					if ( conv && s.throws ) {
-						response = conv( response );
-					} else {
-						try {
-							response = conv( response );
-						} catch ( e ) {
-							return {
-								state: "parsererror",
-								error: conv ? e : "No conversion from " + prev + " to " + current
-							};
-						}
-					}
-				}
-			}
-		}
-	}
-
-	return { state: "success", data: response };
-}
-
-jQuery.extend( {
-
-	// Counter for holding the number of active queries
-	active: 0,
-
-	// Last-Modified header cache for next request
-	lastModified: {},
-	etag: {},
-
-	ajaxSettings: {
-		url: location.href,
-		type: "GET",
-		isLocal: rlocalProtocol.test( location.protocol ),
-		global: true,
-		processData: true,
-		async: true,
-		contentType: "application/x-www-form-urlencoded; charset=UTF-8",
-
-		/*
-		timeout: 0,
-		data: null,
-		dataType: null,
-		username: null,
-		password: null,
-		cache: null,
-		throws: false,
-		traditional: false,
-		headers: {},
-		*/
-
-		accepts: {
-			"*": allTypes,
-			text: "text/plain",
-			html: "text/html",
-			xml: "application/xml, text/xml",
-			json: "application/json, text/javascript"
-		},
-
-		contents: {
-			xml: /\bxml\b/,
-			html: /\bhtml/,
-			json: /\bjson\b/
-		},
-
-		responseFields: {
-			xml: "responseXML",
-			text: "responseText",
-			json: "responseJSON"
-		},
-
-		// Data converters
-		// Keys separate source (or catchall "*") and destination types with a single space
-		converters: {
-
-			// Convert anything to text
-			"* text": String,
-
-			// Text to html (true = no transformation)
-			"text html": true,
-
-			// Evaluate text as a json expression
-			"text json": JSON.parse,
-
-			// Parse text as xml
-			"text xml": jQuery.parseXML
-		},
-
-		// For options that shouldn't be deep extended:
-		// you can add your own custom options here if
-		// and when you create one that shouldn't be
-		// deep extended (see ajaxExtend)
-		flatOptions: {
-			url: true,
-			context: true
-		}
-	},
-
-	// Creates a full fledged settings object into target
-	// with both ajaxSettings and settings fields.
-	// If target is omitted, writes into ajaxSettings.
-	ajaxSetup: function( target, settings ) {
-		return settings ?
-
-			// Building a settings object
-			ajaxExtend( ajaxExtend( target, jQuery.ajaxSettings ), settings ) :
-
-			// Extending ajaxSettings
-			ajaxExtend( jQuery.ajaxSettings, target );
-	},
-
-	ajaxPrefilter: addToPrefiltersOrTransports( prefilters ),
-	ajaxTransport: addToPrefiltersOrTransports( transports ),
-
-	// Main method
-	ajax: function( url, options ) {
-
-		// If url is an object, simulate pre-1.5 signature
-		if ( typeof url === "object" ) {
-			options = url;
-			url = undefined;
-		}
-
-		// Force options to be an object
-		options = options || {};
-
-		var transport,
-
-			// URL without anti-cache param
-			cacheURL,
-
-			// Response headers
-			responseHeadersString,
-			responseHeaders,
-
-			// timeout handle
-			timeoutTimer,
-
-			// Url cleanup var
-			urlAnchor,
-
-			// Request state (becomes false upon send and true upon completion)
-			completed,
-
-			// To know if global events are to be dispatched
-			fireGlobals,
-
-			// Loop variable
-			i,
-
-			// uncached part of the url
-			uncached,
-
-			// Create the final options object
-			s = jQuery.ajaxSetup( {}, options ),
-
-			// Callbacks context
-			callbackContext = s.context || s,
-
-			// Context for global events is callbackContext if it is a DOM node or jQuery collection
-			globalEventContext = s.context &&
-				( callbackContext.nodeType || callbackContext.jquery ) ?
-				jQuery( callbackContext ) :
-				jQuery.event,
-
-			// Deferreds
-			deferred = jQuery.Deferred(),
-			completeDeferred = jQuery.Callbacks( "once memory" ),
-
-			// Status-dependent callbacks
-			statusCode = s.statusCode || {},
-
-			// Headers (they are sent all at once)
-			requestHeaders = {},
-			requestHeadersNames = {},
-
-			// Default abort message
-			strAbort = "canceled",
-
-			// Fake xhr
-			jqXHR = {
-				readyState: 0,
-
-				// Builds headers hashtable if needed
-				getResponseHeader: function( key ) {
-					var match;
-					if ( completed ) {
-						if ( !responseHeaders ) {
-							responseHeaders = {};
-							while ( ( match = rheaders.exec( responseHeadersString ) ) ) {
-								responseHeaders[ match[ 1 ].toLowerCase() + " " ] =
-									( responseHeaders[ match[ 1 ].toLowerCase() + " " ] || [] )
-										.concat( match[ 2 ] );
-							}
-						}
-						match = responseHeaders[ key.toLowerCase() + " " ];
-					}
-					return match == null ? null : match.join( ", " );
-				},
-
-				// Raw string
-				getAllResponseHeaders: function() {
-					return completed ? responseHeadersString : null;
-				},
-
-				// Caches the header
-				setRequestHeader: function( name, value ) {
-					if ( completed == null ) {
-						name = requestHeadersNames[ name.toLowerCase() ] =
-							requestHeadersNames[ name.toLowerCase() ] || name;
-						requestHeaders[ name ] = value;
-					}
-					return this;
-				},
-
-				// Overrides response content-type header
-				overrideMimeType: function( type ) {
-					if ( completed == null ) {
-						s.mimeType = type;
-					}
-					return this;
-				},
-
-				// Status-dependent callbacks
-				statusCode: function( map ) {
-					var code;
-					if ( map ) {
-						if ( completed ) {
-
-							// Execute the appropriate callbacks
-							jqXHR.always( map[ jqXHR.status ] );
-						} else {
-
-							// Lazy-add the new callbacks in a way that preserves old ones
-							for ( code in map ) {
-								statusCode[ code ] = [ statusCode[ code ], map[ code ] ];
-							}
-						}
-					}
-					return this;
-				},
-
-				// Cancel the request
-				abort: function( statusText ) {
-					var finalText = statusText || strAbort;
-					if ( transport ) {
-						transport.abort( finalText );
-					}
-					done( 0, finalText );
-					return this;
-				}
-			};
-
-		// Attach deferreds
-		deferred.promise( jqXHR );
-
-		// Add protocol if not provided (prefilters might expect it)
-		// Handle falsy url in the settings object (trac-10093: consistency with old signature)
-		// We also use the url parameter if available
-		s.url = ( ( url || s.url || location.href ) + "" )
-			.replace( rprotocol, location.protocol + "//" );
-
-		// Alias method option to type as per ticket trac-12004
-		s.type = options.method || options.type || s.method || s.type;
-
-		// Extract dataTypes list
-		s.dataTypes = ( s.dataType || "*" ).toLowerCase().match( rnothtmlwhite ) || [ "" ];
-
-		// A cross-domain request is in order when the origin doesn't match the current origin.
-		if ( s.crossDomain == null ) {
-			urlAnchor = document.createElement( "a" );
-
-			// Support: IE <=8 - 11, Edge 12 - 15
-			// IE throws exception on accessing the href property if url is malformed,
-			// e.g. http://example.com:80x/
-			try {
-				urlAnchor.href = s.url;
-
-				// Support: IE <=8 - 11 only
-				// Anchor's host property isn't correctly set when s.url is relative
-				urlAnchor.href = urlAnchor.href;
-				s.crossDomain = originAnchor.protocol + "//" + originAnchor.host !==
-					urlAnchor.protocol + "//" + urlAnchor.host;
-			} catch ( e ) {
-
-				// If there is an error parsing the URL, assume it is crossDomain,
-				// it can be rejected by the transport if it is invalid
-				s.crossDomain = true;
-			}
-		}
-
-		// Convert data if not already a string
-		if ( s.data && s.processData && typeof s.data !== "string" ) {
-			s.data = jQuery.param( s.data, s.traditional );
-		}
-
-		// Apply prefilters
-		inspectPrefiltersOrTransports( prefilters, s, options, jqXHR );
-
-		// If request was aborted inside a prefilter, stop there
-		if ( completed ) {
-			return jqXHR;
-		}
-
-		// We can fire global events as of now if asked to
-		// Don't fire events if jQuery.event is undefined in an AMD-usage scenario (trac-15118)
-		fireGlobals = jQuery.event && s.global;
-
-		// Watch for a new set of requests
-		if ( fireGlobals && jQuery.active++ === 0 ) {
-			jQuery.event.trigger( "ajaxStart" );
-		}
-
-		// Uppercase the type
-		s.type = s.type.toUpperCase();
-
-		// Determine if request has content
-		s.hasContent = !rnoContent.test( s.type );
-
-		// Save the URL in case we're toying with the If-Modified-Since
-		// and/or If-None-Match header later on
-		// Remove hash to simplify url manipulation
-		cacheURL = s.url.replace( rhash, "" );
-
-		// More options handling for requests with no content
-		if ( !s.hasContent ) {
-
-			// Remember the hash so we can put it back
-			uncached = s.url.slice( cacheURL.length );
-
-			// If data is available and should be processed, append data to url
-			if ( s.data && ( s.processData || typeof s.data === "string" ) ) {
-				cacheURL += ( rquery.test( cacheURL ) ? "&" : "?" ) + s.data;
-
-				// trac-9682: remove data so that it's not used in an eventual retry
-				delete s.data;
-			}
-
-			// Add or update anti-cache param if needed
-			if ( s.cache === false ) {
-				cacheURL = cacheURL.replace( rantiCache, "$1" );
-				uncached = ( rquery.test( cacheURL ) ? "&" : "?" ) + "_=" + ( nonce.guid++ ) +
-					uncached;
-			}
-
-			// Put hash and anti-cache on the URL that will be requested (gh-1732)
-			s.url = cacheURL + uncached;
-
-		// Change '%20' to '+' if this is encoded form body content (gh-2658)
-		} else if ( s.data && s.processData &&
-			( s.contentType || "" ).indexOf( "application/x-www-form-urlencoded" ) === 0 ) {
-			s.data = s.data.replace( r20, "+" );
-		}
-
-		// Set the If-Modified-Since and/or If-None-Match header, if in ifModified mode.
-		if ( s.ifModified ) {
-			if ( jQuery.lastModified[ cacheURL ] ) {
-				jqXHR.setRequestHeader( "If-Modified-Since", jQuery.lastModified[ cacheURL ] );
-			}
-			if ( jQuery.etag[ cacheURL ] ) {
-				jqXHR.setRequestHeader( "If-None-Match", jQuery.etag[ cacheURL ] );
-			}
-		}
-
-		// Set the correct header, if data is being sent
-		if ( s.data && s.hasContent && s.contentType !== false || options.contentType ) {
-			jqXHR.setRequestHeader( "Content-Type", s.contentType );
-		}
-
-		// Set the Accepts header for the server, depending on the dataType
-		jqXHR.setRequestHeader(
-			"Accept",
-			s.dataTypes[ 0 ] && s.accepts[ s.dataTypes[ 0 ] ] ?
-				s.accepts[ s.dataTypes[ 0 ] ] +
-					( s.dataTypes[ 0 ] !== "*" ? ", " + allTypes + "; q=0.01" : "" ) :
-				s.accepts[ "*" ]
-		);
-
-		// Check for headers option
-		for ( i in s.headers ) {
-			jqXHR.setRequestHeader( i, s.headers[ i ] );
-		}
-
-		// Allow custom headers/mimetypes and early abort
-		if ( s.beforeSend &&
-			( s.beforeSend.call( callbackContext, jqXHR, s ) === false || completed ) ) {
-
-			// Abort if not done already and return
-			return jqXHR.abort();
-		}
-
-		// Aborting is no longer a cancellation
-		strAbort = "abort";
-
-		// Install callbacks on deferreds
-		completeDeferred.add( s.complete );
-		jqXHR.done( s.success );
-		jqXHR.fail( s.error );
-
-		// Get transport
-		transport = inspectPrefiltersOrTransports( transports, s, options, jqXHR );
-
-		// If no transport, we auto-abort
-		if ( !transport ) {
-			done( -1, "No Transport" );
-		} else {
-			jqXHR.readyState = 1;
-
-			// Send global event
-			if ( fireGlobals ) {
-				globalEventContext.trigger( "ajaxSend", [ jqXHR, s ] );
-			}
-
-			// If request was aborted inside ajaxSend, stop there
-			if ( completed ) {
-				return jqXHR;
-			}
-
-			// Timeout
-			if ( s.async && s.timeout > 0 ) {
-				timeoutTimer = window.setTimeout( function() {
-					jqXHR.abort( "timeout" );
-				}, s.timeout );
-			}
-
-			try {
-				completed = false;
-				transport.send( requestHeaders, done );
-			} catch ( e ) {
-
-				// Rethrow post-completion exceptions
-				if ( completed ) {
-					throw e;
-				}
-
-				// Propagate others as results
-				done( -1, e );
-			}
-		}
-
-		// Callback for when everything is done
-		function done( status, nativeStatusText, responses, headers ) {
-			var isSuccess, success, error, response, modified,
-				statusText = nativeStatusText;
-
-			// Ignore repeat invocations
-			if ( completed ) {
-				return;
-			}
-
-			completed = true;
-
-			// Clear timeout if it exists
-			if ( timeoutTimer ) {
-				window.clearTimeout( timeoutTimer );
-			}
-
-			// Dereference transport for early garbage collection
-			// (no matter how long the jqXHR object will be used)
-			transport = undefined;
-
-			// Cache response headers
-			responseHeadersString = headers || "";
-
-			// Set readyState
-			jqXHR.readyState = status > 0 ? 4 : 0;
-
-			// Determine if successful
-			isSuccess = status >= 200 && status < 300 || status === 304;
-
-			// Get response data
-			if ( responses ) {
-				response = ajaxHandleResponses( s, jqXHR, responses );
-			}
-
-			// Use a noop converter for missing script but not if jsonp
-			if ( !isSuccess &&
-				jQuery.inArray( "script", s.dataTypes ) > -1 &&
-				jQuery.inArray( "json", s.dataTypes ) < 0 ) {
-				s.converters[ "text script" ] = function() {};
-			}
-
-			// Convert no matter what (that way responseXXX fields are always set)
-			response = ajaxConvert( s, response, jqXHR, isSuccess );
-
-			// If successful, handle type chaining
-			if ( isSuccess ) {
-
-				// Set the If-Modified-Since and/or If-None-Match header, if in ifModified mode.
-				if ( s.ifModified ) {
-					modified = jqXHR.getResponseHeader( "Last-Modified" );
-					if ( modified ) {
-						jQuery.lastModified[ cacheURL ] = modified;
-					}
-					modified = jqXHR.getResponseHeader( "etag" );
-					if ( modified ) {
-						jQuery.etag[ cacheURL ] = modified;
-					}
-				}
-
-				// if no content
-				if ( status === 204 || s.type === "HEAD" ) {
-					statusText = "nocontent";
-
-				// if not modified
-				} else if ( status === 304 ) {
-					statusText = "notmodified";
-
-				// If we have data, let's convert it
-				} else {
-					statusText = response.state;
-					success = response.data;
-					error = response.error;
-					isSuccess = !error;
-				}
-			} else {
-
-				// Extract error from statusText and normalize for non-aborts
-				error = statusText;
-				if ( status || !statusText ) {
-					statusText = "error";
-					if ( status < 0 ) {
-						status = 0;
-					}
-				}
-			}
-
-			// Set data for the fake xhr object
-			jqXHR.status = status;
-			jqXHR.statusText = ( nativeStatusText || statusText ) + "";
-
-			// Success/Error
-			if ( isSuccess ) {
-				deferred.resolveWith( callbackContext, [ success, statusText, jqXHR ] );
-			} else {
-				deferred.rejectWith( callbackContext, [ jqXHR, statusText, error ] );
-			}
-
-			// Status-dependent callbacks
-			jqXHR.statusCode( statusCode );
-			statusCode = undefined;
-
-			if ( fireGlobals ) {
-				globalEventContext.trigger( isSuccess ? "ajaxSuccess" : "ajaxError",
-					[ jqXHR, s, isSuccess ? success : error ] );
-			}
-
-			// Complete
-			completeDeferred.fireWith( callbackContext, [ jqXHR, statusText ] );
-
-			if ( fireGlobals ) {
-				globalEventContext.trigger( "ajaxComplete", [ jqXHR, s ] );
-
-				// Handle the global AJAX counter
-				if ( !( --jQuery.active ) ) {
-					jQuery.event.trigger( "ajaxStop" );
-				}
-			}
-		}
-
-		return jqXHR;
-	},
-
-	getJSON: function( url, data, callback ) {
-		return jQuery.get( url, data, callback, "json" );
-	},
-
-	getScript: function( url, callback ) {
-		return jQuery.get( url, undefined, callback, "script" );
-	}
-} );
-
-jQuery.each( [ "get", "post" ], function( _i, method ) {
-	jQuery[ method ] = function( url, data, callback, type ) {
-
-		// Shift arguments if data argument was omitted
-		if ( isFunction( data ) ) {
-			type = type || callback;
-			callback = data;
-			data = undefined;
-		}
-
-		// The url can be an options object (which then must have .url)
-		return jQuery.ajax( jQuery.extend( {
-			url: url,
-			type: method,
-			dataType: type,
-			data: data,
-			success: callback
-		}, jQuery.isPlainObject( url ) && url ) );
-	};
-} );
-
-jQuery.ajaxPrefilter( function( s ) {
-	var i;
-	for ( i in s.headers ) {
-		if ( i.toLowerCase() === "content-type" ) {
-			s.contentType = s.headers[ i ] || "";
-		}
-	}
-} );
-
-
-jQuery._evalUrl = function( url, options, doc ) {
-	return jQuery.ajax( {
-		url: url,
-
-		// Make this explicit, since user can override this through ajaxSetup (trac-11264)
-		type: "GET",
-		dataType: "script",
-		cache: true,
-		async: false,
-		global: false,
-
-		// Only evaluate the response if it is successful (gh-4126)
-		// dataFilter is not invoked for failure responses, so using it instead
-		// of the default converter is kludgy but it works.
-		converters: {
-			"text script": function() {}
-		},
-		dataFilter: function( response ) {
-			jQuery.globalEval( response, options, doc );
-		}
-	} );
-};
-
-
-jQuery.fn.extend( {
-	wrapAll: function( html ) {
-		var wrap;
-
-		if ( this[ 0 ] ) {
-			if ( isFunction( html ) ) {
-				html = html.call( this[ 0 ] );
-			}
-
-			// The elements to wrap the target around
-			wrap = jQuery( html, this[ 0 ].ownerDocument ).eq( 0 ).clone( true );
-
-			if ( this[ 0 ].parentNode ) {
-				wrap.insertBefore( this[ 0 ] );
-			}
-
-			wrap.map( function() {
-				var elem = this;
-
-				while ( elem.firstElementChild ) {
-					elem = elem.firstElementChild;
-				}
-
-				return elem;
-			} ).append( this );
-		}
-
-		return this;
-	},
-
-	wrapInner: function( html ) {
-		if ( isFunction( html ) ) {
-			return this.each( function( i ) {
-				jQuery( this ).wrapInner( html.call( this, i ) );
-			} );
-		}
-
-		return this.each( function() {
-			var self = jQuery( this ),
-				contents = self.contents();
-
-			if ( contents.length ) {
-				contents.wrapAll( html );
-
-			} else {
-				self.append( html );
-			}
-		} );
-	},
-
-	wrap: function( html ) {
-		var htmlIsFunction = isFunction( html );
-
-		return this.each( function( i ) {
-			jQuery( this ).wrapAll( htmlIsFunction ? html.call( this, i ) : html );
-		} );
-	},
-
-	unwrap: function( selector ) {
-		this.parent( selector ).not( "body" ).each( function() {
-			jQuery( this ).replaceWith( this.childNodes );
-		} );
-		return this;
-	}
-} );
-
-
-jQuery.expr.pseudos.hidden = function( elem ) {
-	return !jQuery.expr.pseudos.visible( elem );
-};
-jQuery.expr.pseudos.visible = function( elem ) {
-	return !!( elem.offsetWidth || elem.offsetHeight || elem.getClientRects().length );
-};
-
-
-
-
-jQuery.ajaxSettings.xhr = function() {
-	try {
-		return new window.XMLHttpRequest();
-	} catch ( e ) {}
-};
-
-var xhrSuccessStatus = {
-
-		// File protocol always yields status code 0, assume 200
-		0: 200,
-
-		// Support: IE <=9 only
-		// trac-1450: sometimes IE returns 1223 when it should be 204
-		1223: 204
-	},
-	xhrSupported = jQuery.ajaxSettings.xhr();
-
-support.cors = !!xhrSupported && ( "withCredentials" in xhrSupported );
-support.ajax = xhrSupported = !!xhrSupported;
-
-jQuery.ajaxTransport( function( options ) {
-	var callback, errorCallback;
-
-	// Cross domain only allowed if supported through XMLHttpRequest
-	if ( support.cors || xhrSupported && !options.crossDomain ) {
-		return {
-			send: function( headers, complete ) {
-				var i,
-					xhr = options.xhr();
-
-				xhr.open(
-					options.type,
-					options.url,
-					options.async,
-					options.username,
-					options.password
-				);
-
-				// Apply custom fields if provided
-				if ( options.xhrFields ) {
-					for ( i in options.xhrFields ) {
-						xhr[ i ] = options.xhrFields[ i ];
-					}
-				}
-
-				// Override mime type if needed
-				if ( options.mimeType && xhr.overrideMimeType ) {
-					xhr.overrideMimeType( options.mimeType );
-				}
-
-				// X-Requested-With header
-				// For cross-domain requests, seeing as conditions for a preflight are
-				// akin to a jigsaw puzzle, we simply never set it to be sure.
-				// (it can always be set on a per-request basis or even using ajaxSetup)
-				// For same-domain requests, won't change header if already provided.
-				if ( !options.crossDomain && !headers[ "X-Requested-With" ] ) {
-					headers[ "X-Requested-With" ] = "XMLHttpRequest";
-				}
-
-				// Set headers
-				for ( i in headers ) {
-					xhr.setRequestHeader( i, headers[ i ] );
-				}
-
-				// Callback
-				callback = function( type ) {
-					return function() {
-						if ( callback ) {
-							callback = errorCallback = xhr.onload =
-								xhr.onerror = xhr.onabort = xhr.ontimeout =
-									xhr.onreadystatechange = null;
-
-							if ( type === "abort" ) {
-								xhr.abort();
-							} else if ( type === "error" ) {
-
-								// Support: IE <=9 only
-								// On a manual native abort, IE9 throws
-								// errors on any property access that is not readyState
-								if ( typeof xhr.status !== "number" ) {
-									complete( 0, "error" );
-								} else {
-									complete(
-
-										// File: protocol always yields status 0; see trac-8605, trac-14207
-										xhr.status,
-										xhr.statusText
-									);
-								}
-							} else {
-								complete(
-									xhrSuccessStatus[ xhr.status ] || xhr.status,
-									xhr.statusText,
-
-									// Support: IE <=9 only
-									// IE9 has no XHR2 but throws on binary (trac-11426)
-									// For XHR2 non-text, let the caller handle it (gh-2498)
-									( xhr.responseType || "text" ) !== "text"  ||
-									typeof xhr.responseText !== "string" ?
-										{ binary: xhr.response } :
-										{ text: xhr.responseText },
-									xhr.getAllResponseHeaders()
-								);
-							}
-						}
-					};
-				};
-
-				// Listen to events
-				xhr.onload = callback();
-				errorCallback = xhr.onerror = xhr.ontimeout = callback( "error" );
-
-				// Support: IE 9 only
-				// Use onreadystatechange to replace onabort
-				// to handle uncaught aborts
-				if ( xhr.onabort !== undefined ) {
-					xhr.onabort = errorCallback;
-				} else {
-					xhr.onreadystatechange = function() {
-
-						// Check readyState before timeout as it changes
-						if ( xhr.readyState === 4 ) {
-
-							// Allow onerror to be called first,
-							// but that will not handle a native abort
-							// Also, save errorCallback to a variable
-							// as xhr.onerror cannot be accessed
-							window.setTimeout( function() {
-								if ( callback ) {
-									errorCallback();
-								}
-							} );
-						}
-					};
-				}
-
-				// Create the abort callback
-				callback = callback( "abort" );
-
-				try {
-
-					// Do send the request (this may raise an exception)
-					xhr.send( options.hasContent && options.data || null );
-				} catch ( e ) {
-
-					// trac-14683: Only rethrow if this hasn't been notified as an error yet
-					if ( callback ) {
-						throw e;
-					}
-				}
-			},
-
-			abort: function() {
-				if ( callback ) {
-					callback();
-				}
-			}
-		};
-	}
-} );
-
-
-
-
-// Prevent auto-execution of scripts when no explicit dataType was provided (See gh-2432)
-jQuery.ajaxPrefilter( function( s ) {
-	if ( s.crossDomain ) {
-		s.contents.script = false;
-	}
-} );
-
-// Install script dataType
-jQuery.ajaxSetup( {
-	accepts: {
-		script: "text/javascript, application/javascript, " +
-			"application/ecmascript, application/x-ecmascript"
-	},
-	contents: {
-		script: /\b(?:java|ecma)script\b/
-	},
-	converters: {
-		"text script": function( text ) {
-			jQuery.globalEval( text );
-			return text;
-		}
-	}
-} );
-
-// Handle cache's special case and crossDomain
-jQuery.ajaxPrefilter( "script", function( s ) {
-	if ( s.cache === undefined ) {
-		s.cache = false;
-	}
-	if ( s.crossDomain ) {
-		s.type = "GET";
-	}
-} );
-
-// Bind script tag hack transport
-jQuery.ajaxTransport( "script", function( s ) {
-
-	// This transport only deals with cross domain or forced-by-attrs requests
-	if ( s.crossDomain || s.scriptAttrs ) {
-		var script, callback;
-		return {
-			send: function( _, complete ) {
-				script = jQuery( "<script>" )
-					.attr( s.scriptAttrs || {} )
-					.prop( { charset: s.scriptCharset, src: s.url } )
-					.on( "load error", callback = function( evt ) {
-						script.remove();
-						callback = null;
-						if ( evt ) {
-							complete( evt.type === "error" ? 404 : 200, evt.type );
-						}
-					} );
-
-				// Use native DOM manipulation to avoid our domManip AJAX trickery
-				document.head.appendChild( script[ 0 ] );
-			},
-			abort: function() {
-				if ( callback ) {
-					callback();
-				}
-			}
-		};
-	}
-} );
-
-
-
-
-var oldCallbacks = [],
-	rjsonp = /(=)\?(?=&|$)|\?\?/;
-
-// Default jsonp settings
-jQuery.ajaxSetup( {
-	jsonp: "callback",
-	jsonpCallback: function() {
-		var callback = oldCallbacks.pop() || ( jQuery.expando + "_" + ( nonce.guid++ ) );
-		this[ callback ] = true;
-		return callback;
-	}
-} );
-
-// Detect, normalize options and install callbacks for jsonp requests
-jQuery.ajaxPrefilter( "json jsonp", function( s, originalSettings, jqXHR ) {
-
-	var callbackName, overwritten, responseContainer,
-		jsonProp = s.jsonp !== false && ( rjsonp.test( s.url ) ?
-			"url" :
-			typeof s.data === "string" &&
-				( s.contentType || "" )
-					.indexOf( "application/x-www-form-urlencoded" ) === 0 &&
-				rjsonp.test( s.data ) && "data"
-		);
-
-	// Handle iff the expected data type is "jsonp" or we have a parameter to set
-	if ( jsonProp || s.dataTypes[ 0 ] === "jsonp" ) {
-
-		// Get callback name, remembering preexisting value associated with it
-		callbackName = s.jsonpCallback = isFunction( s.jsonpCallback ) ?
-			s.jsonpCallback() :
-			s.jsonpCallback;
-
-		// Insert callback into url or form data
-		if ( jsonProp ) {
-			s[ jsonProp ] = s[ jsonProp ].replace( rjsonp, "$1" + callbackName );
-		} else if ( s.jsonp !== false ) {
-			s.url += ( rquery.test( s.url ) ? "&" : "?" ) + s.jsonp + "=" + callbackName;
-		}
-
-		// Use data converter to retrieve json after script execution
-		s.converters[ "script json" ] = function() {
-			if ( !responseContainer ) {
-				jQuery.error( callbackName + " was not called" );
-			}
-			return responseContainer[ 0 ];
-		};
-
-		// Force json dataType
-		s.dataTypes[ 0 ] = "json";
-
-		// Install callback
-		overwritten = window[ callbackName ];
-		window[ callbackName ] = function() {
-			responseContainer = arguments;
-		};
-
-		// Clean-up function (fires after converters)
-		jqXHR.always( function() {
-
-			// If previous value didn't exist - remove it
-			if ( overwritten === undefined ) {
-				jQuery( window ).removeProp( callbackName );
-
-			// Otherwise restore preexisting value
-			} else {
-				window[ callbackName ] = overwritten;
-			}
-
-			// Save back as free
-			if ( s[ callbackName ] ) {
-
-				// Make sure that re-using the options doesn't screw things around
-				s.jsonpCallback = originalSettings.jsonpCallback;
-
-				// Save the callback name for future use
-				oldCallbacks.push( callbackName );
-			}
-
-			// Call if it was a function and we have a response
-			if ( responseContainer && isFunction( overwritten ) ) {
-				overwritten( responseContainer[ 0 ] );
-			}
-
-			responseContainer = overwritten = undefined;
-		} );
-
-		// Delegate to script
-		return "script";
-	}
-} );
-
-
-
-
-// Support: Safari 8 only
-// In Safari 8 documents created via document.implementation.createHTMLDocument
-// collapse sibling forms: the second one becomes a child of the first one.
-// Because of that, this security measure has to be disabled in Safari 8.
-// https://bugs.webkit.org/show_bug.cgi?id=137337
-support.createHTMLDocument = ( function() {
-	var body = document.implementation.createHTMLDocument( "" ).body;
-	body.innerHTML = "<form></form><form></form>";
-	return body.childNodes.length === 2;
-} )();
-
-
-// Argument "data" should be string of html
-// context (optional): If specified, the fragment will be created in this context,
-// defaults to document
-// keepScripts (optional): If true, will include scripts passed in the html string
-jQuery.parseHTML = function( data, context, keepScripts ) {
-	if ( typeof data !== "string" ) {
-		return [];
-	}
-	if ( typeof context === "boolean" ) {
-		keepScripts = context;
-		context = false;
-	}
-
-	var base, parsed, scripts;
-
-	if ( !context ) {
-
-		// Stop scripts or inline event handlers from being executed immediately
-		// by using document.implementation
-		if ( support.createHTMLDocument ) {
-			context = document.implementation.createHTMLDocument( "" );
-
-			// Set the base href for the created document
-			// so any parsed elements with URLs
-			// are based on the document's URL (gh-2965)
-			base = context.createElement( "base" );
-			base.href = document.location.href;
-			context.head.appendChild( base );
-		} else {
-			context = document;
-		}
-	}
-
-	parsed = rsingleTag.exec( data );
-	scripts = !keepScripts && [];
-
-	// Single tag
-	if ( parsed ) {
-		return [ context.createElement( parsed[ 1 ] ) ];
-	}
-
-	parsed = buildFragment( [ data ], context, scripts );
-
-	if ( scripts && scripts.length ) {
-		jQuery( scripts ).remove();
-	}
-
-	return jQuery.merge( [], parsed.childNodes );
-};
-
-
-/**
- * Load a url into a page
- */
-jQuery.fn.load = function( url, params, callback ) {
-	var selector, type, response,
-		self = this,
-		off = url.indexOf( " " );
-
-	if ( off > -1 ) {
-		selector = stripAndCollapse( url.slice( off ) );
-		url = url.slice( 0, off );
-	}
-
-	// If it's a function
-	if ( isFunction( params ) ) {
-
-		// We assume that it's the callback
-		callback = params;
-		params = undefined;
-
-	// Otherwise, build a param string
-	} else if ( params && typeof params === "object" ) {
-		type = "POST";
-	}
-
-	// If we have elements to modify, make the request
-	if ( self.length > 0 ) {
-		jQuery.ajax( {
-			url: url,
-
-			// If "type" variable is undefined, then "GET" method will be used.
-			// Make value of this field explicit since
-			// user can override it through ajaxSetup method
-			type: type || "GET",
-			dataType: "html",
-			data: params
-		} ).done( function( responseText ) {
-
-			// Save response for use in complete callback
-			response = arguments;
-
-			self.html( selector ?
-
-				// If a selector was specified, locate the right elements in a dummy div
-				// Exclude scripts to avoid IE 'Permission Denied' errors
-				jQuery( "<div>" ).append( jQuery.parseHTML( responseText ) ).find( selector ) :
-
-				// Otherwise use the full result
-				responseText );
-
-		// If the request succeeds, this function gets "data", "status", "jqXHR"
-		// but they are ignored because response was set above.
-		// If it fails, this function gets "jqXHR", "status", "error"
-		} ).always( callback && function( jqXHR, status ) {
-			self.each( function() {
-				callback.apply( this, response || [ jqXHR.responseText, status, jqXHR ] );
-			} );
-		} );
-	}
-
-	return this;
-};
-
-
-
-
-jQuery.expr.pseudos.animated = function( elem ) {
-	return jQuery.grep( jQuery.timers, function( fn ) {
-		return elem === fn.elem;
-	} ).length;
-};
-
-
-
-
-jQuery.offset = {
-	setOffset: function( elem, options, i ) {
-		var curPosition, curLeft, curCSSTop, curTop, curOffset, curCSSLeft, calculatePosition,
-			position = jQuery.css( elem, "position" ),
-			curElem = jQuery( elem ),
-			props = {};
-
-		// Set position first, in-case top/left are set even on static elem
-		if ( position === "static" ) {
-			elem.style.position = "relative";
-		}
-
-		curOffset = curElem.offset();
-		curCSSTop = jQuery.css( elem, "top" );
-		curCSSLeft = jQuery.css( elem, "left" );
-		calculatePosition = ( position === "absolute" || position === "fixed" ) &&
-			( curCSSTop + curCSSLeft ).indexOf( "auto" ) > -1;
-
-		// Need to be able to calculate position if either
-		// top or left is auto and position is either absolute or fixed
-		if ( calculatePosition ) {
-			curPosition = curElem.position();
-			curTop = curPosition.top;
-			curLeft = curPosition.left;
-
-		} else {
-			curTop = parseFloat( curCSSTop ) || 0;
-			curLeft = parseFloat( curCSSLeft ) || 0;
-		}
-
-		if ( isFunction( options ) ) {
-
-			// Use jQuery.extend here to allow modification of coordinates argument (gh-1848)
-			options = options.call( elem, i, jQuery.extend( {}, curOffset ) );
-		}
-
-		if ( options.top != null ) {
-			props.top = ( options.top - curOffset.top ) + curTop;
-		}
-		if ( options.left != null ) {
-			props.left = ( options.left - curOffset.left ) + curLeft;
-		}
-
-		if ( "using" in options ) {
-			options.using.call( elem, props );
-
-		} else {
-			curElem.css( props );
-		}
-	}
-};
-
-jQuery.fn.extend( {
-
-	// offset() relates an element's border box to the document origin
-	offset: function( options ) {
-
-		// Preserve chaining for setter
-		if ( arguments.length ) {
-			return options === undefined ?
-				this :
-				this.each( function( i ) {
-					jQuery.offset.setOffset( this, options, i );
-				} );
-		}
-
-		var rect, win,
-			elem = this[ 0 ];
-
-		if ( !elem ) {
-			return;
-		}
-
-		// Return zeros for disconnected and hidden (display: none) elements (gh-2310)
-		// Support: IE <=11 only
-		// Running getBoundingClientRect on a
-		// disconnected node in IE throws an error
-		if ( !elem.getClientRects().length ) {
-			return { top: 0, left: 0 };
-		}
-
-		// Get document-relative position by adding viewport scroll to viewport-relative gBCR
-		rect = elem.getBoundingClientRect();
-		win = elem.ownerDocument.defaultView;
-		return {
-			top: rect.top + win.pageYOffset,
-			left: rect.left + win.pageXOffset
-		};
-	},
-
-	// position() relates an element's margin box to its offset parent's padding box
-	// This corresponds to the behavior of CSS absolute positioning
-	position: function() {
-		if ( !this[ 0 ] ) {
-			return;
-		}
-
-		var offsetParent, offset, doc,
-			elem = this[ 0 ],
-			parentOffset = { top: 0, left: 0 };
-
-		// position:fixed elements are offset from the viewport, which itself always has zero offset
-		if ( jQuery.css( elem, "position" ) === "fixed" ) {
-
-			// Assume position:fixed implies availability of getBoundingClientRect
-			offset = elem.getBoundingClientRect();
-
-		} else {
-			offset = this.offset();
-
-			// Account for the *real* offset parent, which can be the document or its root element
-			// when a statically positioned element is identified
-			doc = elem.ownerDocument;
-			offsetParent = elem.offsetParent || doc.documentElement;
-			while ( offsetParent &&
-				( offsetParent === doc.body || offsetParent === doc.documentElement ) &&
-				jQuery.css( offsetParent, "position" ) === "static" ) {
-
-				offsetParent = offsetParent.parentNode;
-			}
-			if ( offsetParent && offsetParent !== elem && offsetParent.nodeType === 1 ) {
-
-				// Incorporate borders into its offset, since they are outside its content origin
-				parentOffset = jQuery( offsetParent ).offset();
-				parentOffset.top += jQuery.css( offsetParent, "borderTopWidth", true );
-				parentOffset.left += jQuery.css( offsetParent, "borderLeftWidth", true );
-			}
-		}
-
-		// Subtract parent offsets and element margins
-		return {
-			top: offset.top - parentOffset.top - jQuery.css( elem, "marginTop", true ),
-			left: offset.left - parentOffset.left - jQuery.css( elem, "marginLeft", true )
-		};
-	},
-
-	// This method will return documentElement in the following cases:
-	// 1) For the element inside the iframe without offsetParent, this method will return
-	//    documentElement of the parent window
-	// 2) For the hidden or detached element
-	// 3) For body or html element, i.e. in case of the html node - it will return itself
-	//
-	// but those exceptions were never presented as a real life use-cases
-	// and might be considered as more preferable results.
-	//
-	// This logic, however, is not guaranteed and can change at any point in the future
-	offsetParent: function() {
-		return this.map( function() {
-			var offsetParent = this.offsetParent;
-
-			while ( offsetParent && jQuery.css( offsetParent, "position" ) === "static" ) {
-				offsetParent = offsetParent.offsetParent;
-			}
-
-			return offsetParent || documentElement;
-		} );
-	}
-} );
-
-// Create scrollLeft and scrollTop methods
-jQuery.each( { scrollLeft: "pageXOffset", scrollTop: "pageYOffset" }, function( method, prop ) {
-	var top = "pageYOffset" === prop;
-
-	jQuery.fn[ method ] = function( val ) {
-		return access( this, function( elem, method, val ) {
-
-			// Coalesce documents and windows
-			var win;
-			if ( isWindow( elem ) ) {
-				win = elem;
-			} else if ( elem.nodeType === 9 ) {
-				win = elem.defaultView;
-			}
-
-			if ( val === undefined ) {
-				return win ? win[ prop ] : elem[ method ];
-			}
-
-			if ( win ) {
-				win.scrollTo(
-					!top ? val : win.pageXOffset,
-					top ? val : win.pageYOffset
-				);
-
-			} else {
-				elem[ method ] = val;
-			}
-		}, method, val, arguments.length );
-	};
-} );
-
-// Support: Safari <=7 - 9.1, Chrome <=37 - 49
-// Add the top/left cssHooks using jQuery.fn.position
-// Webkit bug: https://bugs.webkit.org/show_bug.cgi?id=29084
-// Blink bug: https://bugs.chromium.org/p/chromium/issues/detail?id=589347
-// getComputedStyle returns percent when specified for top/left/bottom/right;
-// rather than make the css module depend on the offset module, just check for it here
-jQuery.each( [ "top", "left" ], function( _i, prop ) {
-	jQuery.cssHooks[ prop ] = addGetHookIf( support.pixelPosition,
-		function( elem, computed ) {
-			if ( computed ) {
-				computed = curCSS( elem, prop );
-
-				// If curCSS returns percentage, fallback to offset
-				return rnumnonpx.test( computed ) ?
-					jQuery( elem ).position()[ prop ] + "px" :
-					computed;
-			}
-		}
-	);
-} );
-
-
-// Create innerHeight, innerWidth, height, width, outerHeight and outerWidth methods
-jQuery.each( { Height: "height", Width: "width" }, function( name, type ) {
-	jQuery.each( {
-		padding: "inner" + name,
-		content: type,
-		"": "outer" + name
-	}, function( defaultExtra, funcName ) {
-
-		// Margin is only for outerHeight, outerWidth
-		jQuery.fn[ funcName ] = function( margin, value ) {
-			var chainable = arguments.length && ( defaultExtra || typeof margin !== "boolean" ),
-				extra = defaultExtra || ( margin === true || value === true ? "margin" : "border" );
-
-			return access( this, function( elem, type, value ) {
-				var doc;
-
-				if ( isWindow( elem ) ) {
-
-					// $( window ).outerWidth/Height return w/h including scrollbars (gh-1729)
-					return funcName.indexOf( "outer" ) === 0 ?
-						elem[ "inner" + name ] :
-						elem.document.documentElement[ "client" + name ];
-				}
-
-				// Get document width or height
-				if ( elem.nodeType === 9 ) {
-					doc = elem.documentElement;
-
-					// Either scroll[Width/Height] or offset[Width/Height] or client[Width/Height],
-					// whichever is greatest
-					return Math.max(
-						elem.body[ "scroll" + name ], doc[ "scroll" + name ],
-						elem.body[ "offset" + name ], doc[ "offset" + name ],
-						doc[ "client" + name ]
-					);
-				}
-
-				return value === undefined ?
-
-					// Get width or height on the element, requesting but not forcing parseFloat
-					jQuery.css( elem, type, extra ) :
-
-					// Set width or height on the element
-					jQuery.style( elem, type, value, extra );
-			}, type, chainable ? margin : undefined, chainable );
-		};
-	} );
-} );
-
-
-jQuery.each( [
-	"ajaxStart",
-	"ajaxStop",
-	"ajaxComplete",
-	"ajaxError",
-	"ajaxSuccess",
-	"ajaxSend"
-], function( _i, type ) {
-	jQuery.fn[ type ] = function( fn ) {
-		return this.on( type, fn );
-	};
-} );
-
-
-
-
-jQuery.fn.extend( {
-
-	bind: function( types, data, fn ) {
-		return this.on( types, null, data, fn );
-	},
-	unbind: function( types, fn ) {
-		return this.off( types, null, fn );
-	},
-
-	delegate: function( selector, types, data, fn ) {
-		return this.on( types, selector, data, fn );
-	},
-	undelegate: function( selector, types, fn ) {
-
-		// ( namespace ) or ( selector, types [, fn] )
-		return arguments.length === 1 ?
-			this.off( selector, "**" ) :
-			this.off( types, selector || "**", fn );
-	},
-
-	hover: function( fnOver, fnOut ) {
-		return this
-			.on( "mouseenter", fnOver )
-			.on( "mouseleave", fnOut || fnOver );
-	}
-} );
-
-jQuery.each(
-	( "blur focus focusin focusout resize scroll click dblclick " +
-	"mousedown mouseup mousemove mouseover mouseout mouseenter mouseleave " +
-	"change select submit keydown keypress keyup contextmenu" ).split( " " ),
-	function( _i, name ) {
-
-		// Handle event binding
-		jQuery.fn[ name ] = function( data, fn ) {
-			return arguments.length > 0 ?
-				this.on( name, null, data, fn ) :
-				this.trigger( name );
-		};
-	}
-);
-
-
-
-
-// Support: Android <=4.0 only
-// Make sure we trim BOM and NBSP
-// Require that the "whitespace run" starts from a non-whitespace
-// to avoid O(N^2) behavior when the engine would try matching "\s+$" at each space position.
-var rtrim = /^[\s\uFEFF\xA0]+|([^\s\uFEFF\xA0])[\s\uFEFF\xA0]+$/g;
-
-// Bind a function to a context, optionally partially applying any
-// arguments.
-// jQuery.proxy is deprecated to promote standards (specifically Function#bind)
-// However, it is not slated for removal any time soon
-jQuery.proxy = function( fn, context ) {
-	var tmp, args, proxy;
-
-	if ( typeof context === "string" ) {
-		tmp = fn[ context ];
-		context = fn;
-		fn = tmp;
-	}
-
-	// Quick check to determine if target is callable, in the spec
-	// this throws a TypeError, but we will just return undefined.
-	if ( !isFunction( fn ) ) {
-		return undefined;
-	}
-
-	// Simulated bind
-	args = slice.call( arguments, 2 );
-	proxy = function() {
-		return fn.apply( context || this, args.concat( slice.call( arguments ) ) );
-	};
-
-	// Set the guid of unique handler to the same of original handler, so it can be removed
-	proxy.guid = fn.guid = fn.guid || jQuery.guid++;
-
-	return proxy;
-};
-
-jQuery.holdReady = function( hold ) {
-	if ( hold ) {
-		jQuery.readyWait++;
-	} else {
-		jQuery.ready( true );
-	}
-};
-jQuery.isArray = Array.isArray;
-jQuery.parseJSON = JSON.parse;
-jQuery.nodeName = nodeName;
-jQuery.isFunction = isFunction;
-jQuery.isWindow = isWindow;
-jQuery.camelCase = camelCase;
-jQuery.type = toType;
-
-jQuery.now = Date.now;
-
-jQuery.isNumeric = function( obj ) {
-
-	// As of jQuery 3.0, isNumeric is limited to
-	// strings and numbers (primitives or objects)
-	// that can be coerced to finite numbers (gh-2662)
-	var type = jQuery.type( obj );
-	return ( type === "number" || type === "string" ) &&
-
-		// parseFloat NaNs numeric-cast false positives ("")
-		// ...but misinterprets leading-number strings, particularly hex literals ("0x...")
-		// subtraction forces infinities to NaN
-		!isNaN( obj - parseFloat( obj ) );
-};
-
-jQuery.trim = function( text ) {
-	return text == null ?
-		"" :
-		( text + "" ).replace( rtrim, "$1" );
-};
-
-
-
-// Register as a named AMD module, since jQuery can be concatenated with other
-// files that may use define, but not via a proper concatenation script that
-// understands anonymous AMD modules. A named AMD is safest and most robust
-// way to register. Lowercase jquery is used because AMD module names are
-// derived from file names, and jQuery is normally delivered in a lowercase
-// file name. Do this after creating the global so that if an AMD module wants
-// to call noConflict to hide this version of jQuery, it will work.
-
-// Note that for maximum portability, libraries that are not jQuery should
-// declare themselves as anonymous modules, and avoid setting a global if an
-// AMD loader is present. jQuery is a special case. For more information, see
-// https://github.com/jrburke/requirejs/wiki/Updating-existing-libraries#wiki-anon
-
-if ( typeof define === "function" && define.amd ) {
-	define( "jquery", [], function() {
-		return jQuery;
-	} );
-}
-
-
-
-
-var
-
-	// Map over jQuery in case of overwrite
-	_jQuery = window.jQuery,
-
-	// Map over the $ in case of overwrite
-	_$ = window.$;
-
-jQuery.noConflict = function( deep ) {
-	if ( window.$ === jQuery ) {
-		window.$ = _$;
-	}
-
-	if ( deep && window.jQuery === jQuery ) {
-		window.jQuery = _jQuery;
-	}
-
-	return jQuery;
-};
-
-// Expose jQuery and $ identifiers, even in AMD
-// (trac-7102#comment:10, https://github.com/jquery/jquery/pull/557)
-// and CommonJS for browser emulators (trac-13566)
-if ( typeof noGlobal === "undefined" ) {
-	window.jQuery = window.$ = jQuery;
-}
-
-
-
-
-return jQuery;
-} );
diff --git a/src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclets/formats/html/resources/jquery/jquery-3.7.1.min.js b/src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclets/formats/html/resources/jquery/jquery-3.7.1.min.js
deleted file mode 100644
index 7f37b5d9912..00000000000
--- a/src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclets/formats/html/resources/jquery/jquery-3.7.1.min.js
+++ /dev/null
@@ -1,2 +0,0 @@
-/*! jQuery v3.7.1 | (c) OpenJS Foundation and other contributors | jquery.org/license */
-!function(e,t){"use strict";"object"==typeof module&&"object"==typeof module.exports?module.exports=e.document?t(e,!0):function(e){if(!e.document)throw new Error("jQuery requires a window with a document");return t(e)}:t(e)}("undefined"!=typeof window?window:this,function(ie,e){"use strict";var oe=[],r=Object.getPrototypeOf,ae=oe.slice,g=oe.flat?function(e){return oe.flat.call(e)}:function(e){return oe.concat.apply([],e)},s=oe.push,se=oe.indexOf,n={},i=n.toString,ue=n.hasOwnProperty,o=ue.toString,a=o.call(Object),le={},v=function(e){return"function"==typeof e&&"number"!=typeof e.nodeType&&"function"!=typeof e.item},y=function(e){return null!=e&&e===e.window},C=ie.document,u={type:!0,src:!0,nonce:!0,noModule:!0};function m(e,t,n){var r,i,o=(n=n||C).createElement("script");if(o.text=e,t)for(r in u)(i=t[r]||t.getAttribute&&t.getAttribute(r))&&o.setAttribute(r,i);n.head.appendChild(o).parentNode.removeChild(o)}function x(e){return null==e?e+"":"object"==typeof e||"function"==typeof e?n[i.call(e)]||"object":typeof e}var t="3.7.1",l=/HTML$/i,ce=function(e,t){return new ce.fn.init(e,t)};function c(e){var t=!!e&&"length"in e&&e.length,n=x(e);return!v(e)&&!y(e)&&("array"===n||0===t||"number"==typeof t&&0<t&&t-1 in e)}function fe(e,t){return e.nodeName&&e.nodeName.toLowerCase()===t.toLowerCase()}ce.fn=ce.prototype={jquery:t,constructor:ce,length:0,toArray:function(){return ae.call(this)},get:function(e){return null==e?ae.call(this):e<0?this[e+this.length]:this[e]},pushStack:function(e){var t=ce.merge(this.constructor(),e);return t.prevObject=this,t},each:function(e){return ce.each(this,e)},map:function(n){return this.pushStack(ce.map(this,function(e,t){return n.call(e,t,e)}))},slice:function(){return this.pushStack(ae.apply(this,arguments))},first:function(){return this.eq(0)},last:function(){return this.eq(-1)},even:function(){return this.pushStack(ce.grep(this,function(e,t){return(t+1)%2}))},odd:function(){return this.pushStack(ce.grep(this,function(e,t){return t%2}))},eq:function(e){var t=this.length,n=+e+(e<0?t:0);return this.pushStack(0<=n&&n<t?[this[n]]:[])},end:function(){return this.prevObject||this.constructor()},push:s,sort:oe.sort,splice:oe.splice},ce.extend=ce.fn.extend=function(){var e,t,n,r,i,o,a=arguments[0]||{},s=1,u=arguments.length,l=!1;for("boolean"==typeof a&&(l=a,a=arguments[s]||{},s++),"object"==typeof a||v(a)||(a={}),s===u&&(a=this,s--);s<u;s++)if(null!=(e=arguments[s]))for(t in e)r=e[t],"__proto__"!==t&&a!==r&&(l&&r&&(ce.isPlainObject(r)||(i=Array.isArray(r)))?(n=a[t],o=i&&!Array.isArray(n)?[]:i||ce.isPlainObject(n)?n:{},i=!1,a[t]=ce.extend(l,o,r)):void 0!==r&&(a[t]=r));return a},ce.extend({expando:"jQuery"+(t+Math.random()).replace(/\D/g,""),isReady:!0,error:function(e){throw new Error(e)},noop:function(){},isPlainObject:function(e){var t,n;return!(!e||"[object Object]"!==i.call(e))&&(!(t=r(e))||"function"==typeof(n=ue.call(t,"constructor")&&t.constructor)&&o.call(n)===a)},isEmptyObject:function(e){var t;for(t in e)return!1;return!0},globalEval:function(e,t,n){m(e,{nonce:t&&t.nonce},n)},each:function(e,t){var n,r=0;if(c(e)){for(n=e.length;r<n;r++)if(!1===t.call(e[r],r,e[r]))break}else for(r in e)if(!1===t.call(e[r],r,e[r]))break;return e},text:function(e){var t,n="",r=0,i=e.nodeType;if(!i)while(t=e[r++])n+=ce.text(t);return 1===i||11===i?e.textContent:9===i?e.documentElement.textContent:3===i||4===i?e.nodeValue:n},makeArray:function(e,t){var n=t||[];return null!=e&&(c(Object(e))?ce.merge(n,"string"==typeof e?[e]:e):s.call(n,e)),n},inArray:function(e,t,n){return null==t?-1:se.call(t,e,n)},isXMLDoc:function(e){var t=e&&e.namespaceURI,n=e&&(e.ownerDocument||e).documentElement;return!l.test(t||n&&n.nodeName||"HTML")},merge:function(e,t){for(var n=+t.length,r=0,i=e.length;r<n;r++)e[i++]=t[r];return e.length=i,e},grep:function(e,t,n){for(var r=[],i=0,o=e.length,a=!n;i<o;i++)!t(e[i],i)!==a&&r.push(e[i]);return r},map:function(e,t,n){var r,i,o=0,a=[];if(c(e))for(r=e.length;o<r;o++)null!=(i=t(e[o],o,n))&&a.push(i);else for(o in e)null!=(i=t(e[o],o,n))&&a.push(i);return g(a)},guid:1,support:le}),"function"==typeof Symbol&&(ce.fn[Symbol.iterator]=oe[Symbol.iterator]),ce.each("Boolean Number String Function Array Date RegExp Object Error Symbol".split(" "),function(e,t){n["[object "+t+"]"]=t.toLowerCase()});var pe=oe.pop,de=oe.sort,he=oe.splice,ge="[\\x20\\t\\r\\n\\f]",ve=new RegExp("^"+ge+"+|((?:^|[^\\\\])(?:\\\\.)*)"+ge+"+$","g");ce.contains=function(e,t){var n=t&&t.parentNode;return e===n||!(!n||1!==n.nodeType||!(e.contains?e.contains(n):e.compareDocumentPosition&&16&e.compareDocumentPosition(n)))};var f=/([\0-\x1f\x7f]|^-?\d)|^-$|[^\x80-\uFFFF\w-]/g;function p(e,t){return t?"\0"===e?"\ufffd":e.slice(0,-1)+"\\"+e.charCodeAt(e.length-1).toString(16)+" ":"\\"+e}ce.escapeSelector=function(e){return(e+"").replace(f,p)};var ye=C,me=s;!function(){var e,b,w,o,a,T,r,C,d,i,k=me,S=ce.expando,E=0,n=0,s=W(),c=W(),u=W(),h=W(),l=function(e,t){return e===t&&(a=!0),0},f="checked|selected|async|autofocus|autoplay|controls|defer|disabled|hidden|ismap|loop|multiple|open|readonly|required|scoped",t="(?:\\\\[\\da-fA-F]{1,6}"+ge+"?|\\\\[^\\r\\n\\f]|[\\w-]|[^\0-\\x7f])+",p="\\["+ge+"*("+t+")(?:"+ge+"*([*^$|!~]?=)"+ge+"*(?:'((?:\\\\.|[^\\\\'])*)'|\"((?:\\\\.|[^\\\\\"])*)\"|("+t+"))|)"+ge+"*\\]",g=":("+t+")(?:\\((('((?:\\\\.|[^\\\\'])*)'|\"((?:\\\\.|[^\\\\\"])*)\")|((?:\\\\.|[^\\\\()[\\]]|"+p+")*)|.*)\\)|)",v=new RegExp(ge+"+","g"),y=new RegExp("^"+ge+"*,"+ge+"*"),m=new RegExp("^"+ge+"*([>+~]|"+ge+")"+ge+"*"),x=new RegExp(ge+"|>"),j=new RegExp(g),A=new RegExp("^"+t+"$"),D={ID:new RegExp("^#("+t+")"),CLASS:new RegExp("^\\.("+t+")"),TAG:new RegExp("^("+t+"|[*])"),ATTR:new RegExp("^"+p),PSEUDO:new RegExp("^"+g),CHILD:new RegExp("^:(only|first|last|nth|nth-last)-(child|of-type)(?:\\("+ge+"*(even|odd|(([+-]|)(\\d*)n|)"+ge+"*(?:([+-]|)"+ge+"*(\\d+)|))"+ge+"*\\)|)","i"),bool:new RegExp("^(?:"+f+")$","i"),needsContext:new RegExp("^"+ge+"*[>+~]|:(even|odd|eq|gt|lt|nth|first|last)(?:\\("+ge+"*((?:-\\d)?\\d*)"+ge+"*\\)|)(?=[^-]|$)","i")},N=/^(?:input|select|textarea|button)$/i,q=/^h\d$/i,L=/^(?:#([\w-]+)|(\w+)|\.([\w-]+))$/,H=/[+~]/,O=new RegExp("\\\\[\\da-fA-F]{1,6}"+ge+"?|\\\\([^\\r\\n\\f])","g"),P=function(e,t){var n="0x"+e.slice(1)-65536;return t||(n<0?String.fromCharCode(n+65536):String.fromCharCode(n>>10|55296,1023&n|56320))},M=function(){V()},R=J(function(e){return!0===e.disabled&&fe(e,"fieldset")},{dir:"parentNode",next:"legend"});try{k.apply(oe=ae.call(ye.childNodes),ye.childNodes),oe[ye.childNodes.length].nodeType}catch(e){k={apply:function(e,t){me.apply(e,ae.call(t))},call:function(e){me.apply(e,ae.call(arguments,1))}}}function I(t,e,n,r){var i,o,a,s,u,l,c,f=e&&e.ownerDocument,p=e?e.nodeType:9;if(n=n||[],"string"!=typeof t||!t||1!==p&&9!==p&&11!==p)return n;if(!r&&(V(e),e=e||T,C)){if(11!==p&&(u=L.exec(t)))if(i=u[1]){if(9===p){if(!(a=e.getElementById(i)))return n;if(a.id===i)return k.call(n,a),n}else if(f&&(a=f.getElementById(i))&&I.contains(e,a)&&a.id===i)return k.call(n,a),n}else{if(u[2])return k.apply(n,e.getElementsByTagName(t)),n;if((i=u[3])&&e.getElementsByClassName)return k.apply(n,e.getElementsByClassName(i)),n}if(!(h[t+" "]||d&&d.test(t))){if(c=t,f=e,1===p&&(x.test(t)||m.test(t))){(f=H.test(t)&&U(e.parentNode)||e)==e&&le.scope||((s=e.getAttribute("id"))?s=ce.escapeSelector(s):e.setAttribute("id",s=S)),o=(l=Y(t)).length;while(o--)l[o]=(s?"#"+s:":scope")+" "+Q(l[o]);c=l.join(",")}try{return k.apply(n,f.querySelectorAll(c)),n}catch(e){h(t,!0)}finally{s===S&&e.removeAttribute("id")}}}return re(t.replace(ve,"$1"),e,n,r)}function W(){var r=[];return function e(t,n){return r.push(t+" ")>b.cacheLength&&delete e[r.shift()],e[t+" "]=n}}function F(e){return e[S]=!0,e}function $(e){var t=T.createElement("fieldset");try{return!!e(t)}catch(e){return!1}finally{t.parentNode&&t.parentNode.removeChild(t),t=null}}function B(t){return function(e){return fe(e,"input")&&e.type===t}}function _(t){return function(e){return(fe(e,"input")||fe(e,"button"))&&e.type===t}}function z(t){return function(e){return"form"in e?e.parentNode&&!1===e.disabled?"label"in e?"label"in e.parentNode?e.parentNode.disabled===t:e.disabled===t:e.isDisabled===t||e.isDisabled!==!t&&R(e)===t:e.disabled===t:"label"in e&&e.disabled===t}}function X(a){return F(function(o){return o=+o,F(function(e,t){var n,r=a([],e.length,o),i=r.length;while(i--)e[n=r[i]]&&(e[n]=!(t[n]=e[n]))})})}function U(e){return e&&"undefined"!=typeof e.getElementsByTagName&&e}function V(e){var t,n=e?e.ownerDocument||e:ye;return n!=T&&9===n.nodeType&&n.documentElement&&(r=(T=n).documentElement,C=!ce.isXMLDoc(T),i=r.matches||r.webkitMatchesSelector||r.msMatchesSelector,r.msMatchesSelector&&ye!=T&&(t=T.defaultView)&&t.top!==t&&t.addEventListener("unload",M),le.getById=$(function(e){return r.appendChild(e).id=ce.expando,!T.getElementsByName||!T.getElementsByName(ce.expando).length}),le.disconnectedMatch=$(function(e){return i.call(e,"*")}),le.scope=$(function(){return T.querySelectorAll(":scope")}),le.cssHas=$(function(){try{return T.querySelector(":has(*,:jqfake)"),!1}catch(e){return!0}}),le.getById?(b.filter.ID=function(e){var t=e.replace(O,P);return function(e){return e.getAttribute("id")===t}},b.find.ID=function(e,t){if("undefined"!=typeof t.getElementById&&C){var n=t.getElementById(e);return n?[n]:[]}}):(b.filter.ID=function(e){var n=e.replace(O,P);return function(e){var t="undefined"!=typeof e.getAttributeNode&&e.getAttributeNode("id");return t&&t.value===n}},b.find.ID=function(e,t){if("undefined"!=typeof t.getElementById&&C){var n,r,i,o=t.getElementById(e);if(o){if((n=o.getAttributeNode("id"))&&n.value===e)return[o];i=t.getElementsByName(e),r=0;while(o=i[r++])if((n=o.getAttributeNode("id"))&&n.value===e)return[o]}return[]}}),b.find.TAG=function(e,t){return"undefined"!=typeof t.getElementsByTagName?t.getElementsByTagName(e):t.querySelectorAll(e)},b.find.CLASS=function(e,t){if("undefined"!=typeof t.getElementsByClassName&&C)return t.getElementsByClassName(e)},d=[],$(function(e){var t;r.appendChild(e).innerHTML="<a id='"+S+"' href='' disabled='disabled'></a><select id='"+S+"-\r\\' disabled='disabled'><option selected=''></option></select>",e.querySelectorAll("[selected]").length||d.push("\\["+ge+"*(?:value|"+f+")"),e.querySelectorAll("[id~="+S+"-]").length||d.push("~="),e.querySelectorAll("a#"+S+"+*").length||d.push(".#.+[+~]"),e.querySelectorAll(":checked").length||d.push(":checked"),(t=T.createElement("input")).setAttribute("type","hidden"),e.appendChild(t).setAttribute("name","D"),r.appendChild(e).disabled=!0,2!==e.querySelectorAll(":disabled").length&&d.push(":enabled",":disabled"),(t=T.createElement("input")).setAttribute("name",""),e.appendChild(t),e.querySelectorAll("[name='']").length||d.push("\\["+ge+"*name"+ge+"*="+ge+"*(?:''|\"\")")}),le.cssHas||d.push(":has"),d=d.length&&new RegExp(d.join("|")),l=function(e,t){if(e===t)return a=!0,0;var n=!e.compareDocumentPosition-!t.compareDocumentPosition;return n||(1&(n=(e.ownerDocument||e)==(t.ownerDocument||t)?e.compareDocumentPosition(t):1)||!le.sortDetached&&t.compareDocumentPosition(e)===n?e===T||e.ownerDocument==ye&&I.contains(ye,e)?-1:t===T||t.ownerDocument==ye&&I.contains(ye,t)?1:o?se.call(o,e)-se.call(o,t):0:4&n?-1:1)}),T}for(e in I.matches=function(e,t){return I(e,null,null,t)},I.matchesSelector=function(e,t){if(V(e),C&&!h[t+" "]&&(!d||!d.test(t)))try{var n=i.call(e,t);if(n||le.disconnectedMatch||e.document&&11!==e.document.nodeType)return n}catch(e){h(t,!0)}return 0<I(t,T,null,[e]).length},I.contains=function(e,t){return(e.ownerDocument||e)!=T&&V(e),ce.contains(e,t)},I.attr=function(e,t){(e.ownerDocument||e)!=T&&V(e);var n=b.attrHandle[t.toLowerCase()],r=n&&ue.call(b.attrHandle,t.toLowerCase())?n(e,t,!C):void 0;return void 0!==r?r:e.getAttribute(t)},I.error=function(e){throw new Error("Syntax error, unrecognized expression: "+e)},ce.uniqueSort=function(e){var t,n=[],r=0,i=0;if(a=!le.sortStable,o=!le.sortStable&&ae.call(e,0),de.call(e,l),a){while(t=e[i++])t===e[i]&&(r=n.push(i));while(r--)he.call(e,n[r],1)}return o=null,e},ce.fn.uniqueSort=function(){return this.pushStack(ce.uniqueSort(ae.apply(this)))},(b=ce.expr={cacheLength:50,createPseudo:F,match:D,attrHandle:{},find:{},relative:{">":{dir:"parentNode",first:!0}," ":{dir:"parentNode"},"+":{dir:"previousSibling",first:!0},"~":{dir:"previousSibling"}},preFilter:{ATTR:function(e){return e[1]=e[1].replace(O,P),e[3]=(e[3]||e[4]||e[5]||"").replace(O,P),"~="===e[2]&&(e[3]=" "+e[3]+" "),e.slice(0,4)},CHILD:function(e){return e[1]=e[1].toLowerCase(),"nth"===e[1].slice(0,3)?(e[3]||I.error(e[0]),e[4]=+(e[4]?e[5]+(e[6]||1):2*("even"===e[3]||"odd"===e[3])),e[5]=+(e[7]+e[8]||"odd"===e[3])):e[3]&&I.error(e[0]),e},PSEUDO:function(e){var t,n=!e[6]&&e[2];return D.CHILD.test(e[0])?null:(e[3]?e[2]=e[4]||e[5]||"":n&&j.test(n)&&(t=Y(n,!0))&&(t=n.indexOf(")",n.length-t)-n.length)&&(e[0]=e[0].slice(0,t),e[2]=n.slice(0,t)),e.slice(0,3))}},filter:{TAG:function(e){var t=e.replace(O,P).toLowerCase();return"*"===e?function(){return!0}:function(e){return fe(e,t)}},CLASS:function(e){var t=s[e+" "];return t||(t=new RegExp("(^|"+ge+")"+e+"("+ge+"|$)"))&&s(e,function(e){return t.test("string"==typeof e.className&&e.className||"undefined"!=typeof e.getAttribute&&e.getAttribute("class")||"")})},ATTR:function(n,r,i){return function(e){var t=I.attr(e,n);return null==t?"!="===r:!r||(t+="","="===r?t===i:"!="===r?t!==i:"^="===r?i&&0===t.indexOf(i):"*="===r?i&&-1<t.indexOf(i):"$="===r?i&&t.slice(-i.length)===i:"~="===r?-1<(" "+t.replace(v," ")+" ").indexOf(i):"|="===r&&(t===i||t.slice(0,i.length+1)===i+"-"))}},CHILD:function(d,e,t,h,g){var v="nth"!==d.slice(0,3),y="last"!==d.slice(-4),m="of-type"===e;return 1===h&&0===g?function(e){return!!e.parentNode}:function(e,t,n){var r,i,o,a,s,u=v!==y?"nextSibling":"previousSibling",l=e.parentNode,c=m&&e.nodeName.toLowerCase(),f=!n&&!m,p=!1;if(l){if(v){while(u){o=e;while(o=o[u])if(m?fe(o,c):1===o.nodeType)return!1;s=u="only"===d&&!s&&"nextSibling"}return!0}if(s=[y?l.firstChild:l.lastChild],y&&f){p=(a=(r=(i=l[S]||(l[S]={}))[d]||[])[0]===E&&r[1])&&r[2],o=a&&l.childNodes[a];while(o=++a&&o&&o[u]||(p=a=0)||s.pop())if(1===o.nodeType&&++p&&o===e){i[d]=[E,a,p];break}}else if(f&&(p=a=(r=(i=e[S]||(e[S]={}))[d]||[])[0]===E&&r[1]),!1===p)while(o=++a&&o&&o[u]||(p=a=0)||s.pop())if((m?fe(o,c):1===o.nodeType)&&++p&&(f&&((i=o[S]||(o[S]={}))[d]=[E,p]),o===e))break;return(p-=g)===h||p%h==0&&0<=p/h}}},PSEUDO:function(e,o){var t,a=b.pseudos[e]||b.setFilters[e.toLowerCase()]||I.error("unsupported pseudo: "+e);return a[S]?a(o):1<a.length?(t=[e,e,"",o],b.setFilters.hasOwnProperty(e.toLowerCase())?F(function(e,t){var n,r=a(e,o),i=r.length;while(i--)e[n=se.call(e,r[i])]=!(t[n]=r[i])}):function(e){return a(e,0,t)}):a}},pseudos:{not:F(function(e){var r=[],i=[],s=ne(e.replace(ve,"$1"));return s[S]?F(function(e,t,n,r){var i,o=s(e,null,r,[]),a=e.length;while(a--)(i=o[a])&&(e[a]=!(t[a]=i))}):function(e,t,n){return r[0]=e,s(r,null,n,i),r[0]=null,!i.pop()}}),has:F(function(t){return function(e){return 0<I(t,e).length}}),contains:F(function(t){return t=t.replace(O,P),function(e){return-1<(e.textContent||ce.text(e)).indexOf(t)}}),lang:F(function(n){return A.test(n||"")||I.error("unsupported lang: "+n),n=n.replace(O,P).toLowerCase(),function(e){var t;do{if(t=C?e.lang:e.getAttribute("xml:lang")||e.getAttribute("lang"))return(t=t.toLowerCase())===n||0===t.indexOf(n+"-")}while((e=e.parentNode)&&1===e.nodeType);return!1}}),target:function(e){var t=ie.location&&ie.location.hash;return t&&t.slice(1)===e.id},root:function(e){return e===r},focus:function(e){return e===function(){try{return T.activeElement}catch(e){}}()&&T.hasFocus()&&!!(e.type||e.href||~e.tabIndex)},enabled:z(!1),disabled:z(!0),checked:function(e){return fe(e,"input")&&!!e.checked||fe(e,"option")&&!!e.selected},selected:function(e){return e.parentNode&&e.parentNode.selectedIndex,!0===e.selected},empty:function(e){for(e=e.firstChild;e;e=e.nextSibling)if(e.nodeType<6)return!1;return!0},parent:function(e){return!b.pseudos.empty(e)},header:function(e){return q.test(e.nodeName)},input:function(e){return N.test(e.nodeName)},button:function(e){return fe(e,"input")&&"button"===e.type||fe(e,"button")},text:function(e){var t;return fe(e,"input")&&"text"===e.type&&(null==(t=e.getAttribute("type"))||"text"===t.toLowerCase())},first:X(function(){return[0]}),last:X(function(e,t){return[t-1]}),eq:X(function(e,t,n){return[n<0?n+t:n]}),even:X(function(e,t){for(var n=0;n<t;n+=2)e.push(n);return e}),odd:X(function(e,t){for(var n=1;n<t;n+=2)e.push(n);return e}),lt:X(function(e,t,n){var r;for(r=n<0?n+t:t<n?t:n;0<=--r;)e.push(r);return e}),gt:X(function(e,t,n){for(var r=n<0?n+t:n;++r<t;)e.push(r);return e})}}).pseudos.nth=b.pseudos.eq,{radio:!0,checkbox:!0,file:!0,password:!0,image:!0})b.pseudos[e]=B(e);for(e in{submit:!0,reset:!0})b.pseudos[e]=_(e);function G(){}function Y(e,t){var n,r,i,o,a,s,u,l=c[e+" "];if(l)return t?0:l.slice(0);a=e,s=[],u=b.preFilter;while(a){for(o in n&&!(r=y.exec(a))||(r&&(a=a.slice(r[0].length)||a),s.push(i=[])),n=!1,(r=m.exec(a))&&(n=r.shift(),i.push({value:n,type:r[0].replace(ve," ")}),a=a.slice(n.length)),b.filter)!(r=D[o].exec(a))||u[o]&&!(r=u[o](r))||(n=r.shift(),i.push({value:n,type:o,matches:r}),a=a.slice(n.length));if(!n)break}return t?a.length:a?I.error(e):c(e,s).slice(0)}function Q(e){for(var t=0,n=e.length,r="";t<n;t++)r+=e[t].value;return r}function J(a,e,t){var s=e.dir,u=e.next,l=u||s,c=t&&"parentNode"===l,f=n++;return e.first?function(e,t,n){while(e=e[s])if(1===e.nodeType||c)return a(e,t,n);return!1}:function(e,t,n){var r,i,o=[E,f];if(n){while(e=e[s])if((1===e.nodeType||c)&&a(e,t,n))return!0}else while(e=e[s])if(1===e.nodeType||c)if(i=e[S]||(e[S]={}),u&&fe(e,u))e=e[s]||e;else{if((r=i[l])&&r[0]===E&&r[1]===f)return o[2]=r[2];if((i[l]=o)[2]=a(e,t,n))return!0}return!1}}function K(i){return 1<i.length?function(e,t,n){var r=i.length;while(r--)if(!i[r](e,t,n))return!1;return!0}:i[0]}function Z(e,t,n,r,i){for(var o,a=[],s=0,u=e.length,l=null!=t;s<u;s++)(o=e[s])&&(n&&!n(o,r,i)||(a.push(o),l&&t.push(s)));return a}function ee(d,h,g,v,y,e){return v&&!v[S]&&(v=ee(v)),y&&!y[S]&&(y=ee(y,e)),F(function(e,t,n,r){var i,o,a,s,u=[],l=[],c=t.length,f=e||function(e,t,n){for(var r=0,i=t.length;r<i;r++)I(e,t[r],n);return n}(h||"*",n.nodeType?[n]:n,[]),p=!d||!e&&h?f:Z(f,u,d,n,r);if(g?g(p,s=y||(e?d:c||v)?[]:t,n,r):s=p,v){i=Z(s,l),v(i,[],n,r),o=i.length;while(o--)(a=i[o])&&(s[l[o]]=!(p[l[o]]=a))}if(e){if(y||d){if(y){i=[],o=s.length;while(o--)(a=s[o])&&i.push(p[o]=a);y(null,s=[],i,r)}o=s.length;while(o--)(a=s[o])&&-1<(i=y?se.call(e,a):u[o])&&(e[i]=!(t[i]=a))}}else s=Z(s===t?s.splice(c,s.length):s),y?y(null,t,s,r):k.apply(t,s)})}function te(e){for(var i,t,n,r=e.length,o=b.relative[e[0].type],a=o||b.relative[" "],s=o?1:0,u=J(function(e){return e===i},a,!0),l=J(function(e){return-1<se.call(i,e)},a,!0),c=[function(e,t,n){var r=!o&&(n||t!=w)||((i=t).nodeType?u(e,t,n):l(e,t,n));return i=null,r}];s<r;s++)if(t=b.relative[e[s].type])c=[J(K(c),t)];else{if((t=b.filter[e[s].type].apply(null,e[s].matches))[S]){for(n=++s;n<r;n++)if(b.relative[e[n].type])break;return ee(1<s&&K(c),1<s&&Q(e.slice(0,s-1).concat({value:" "===e[s-2].type?"*":""})).replace(ve,"$1"),t,s<n&&te(e.slice(s,n)),n<r&&te(e=e.slice(n)),n<r&&Q(e))}c.push(t)}return K(c)}function ne(e,t){var n,v,y,m,x,r,i=[],o=[],a=u[e+" "];if(!a){t||(t=Y(e)),n=t.length;while(n--)(a=te(t[n]))[S]?i.push(a):o.push(a);(a=u(e,(v=o,m=0<(y=i).length,x=0<v.length,r=function(e,t,n,r,i){var o,a,s,u=0,l="0",c=e&&[],f=[],p=w,d=e||x&&b.find.TAG("*",i),h=E+=null==p?1:Math.random()||.1,g=d.length;for(i&&(w=t==T||t||i);l!==g&&null!=(o=d[l]);l++){if(x&&o){a=0,t||o.ownerDocument==T||(V(o),n=!C);while(s=v[a++])if(s(o,t||T,n)){k.call(r,o);break}i&&(E=h)}m&&((o=!s&&o)&&u--,e&&c.push(o))}if(u+=l,m&&l!==u){a=0;while(s=y[a++])s(c,f,t,n);if(e){if(0<u)while(l--)c[l]||f[l]||(f[l]=pe.call(r));f=Z(f)}k.apply(r,f),i&&!e&&0<f.length&&1<u+y.length&&ce.uniqueSort(r)}return i&&(E=h,w=p),c},m?F(r):r))).selector=e}return a}function re(e,t,n,r){var i,o,a,s,u,l="function"==typeof e&&e,c=!r&&Y(e=l.selector||e);if(n=n||[],1===c.length){if(2<(o=c[0]=c[0].slice(0)).length&&"ID"===(a=o[0]).type&&9===t.nodeType&&C&&b.relative[o[1].type]){if(!(t=(b.find.ID(a.matches[0].replace(O,P),t)||[])[0]))return n;l&&(t=t.parentNode),e=e.slice(o.shift().value.length)}i=D.needsContext.test(e)?0:o.length;while(i--){if(a=o[i],b.relative[s=a.type])break;if((u=b.find[s])&&(r=u(a.matches[0].replace(O,P),H.test(o[0].type)&&U(t.parentNode)||t))){if(o.splice(i,1),!(e=r.length&&Q(o)))return k.apply(n,r),n;break}}}return(l||ne(e,c))(r,t,!C,n,!t||H.test(e)&&U(t.parentNode)||t),n}G.prototype=b.filters=b.pseudos,b.setFilters=new G,le.sortStable=S.split("").sort(l).join("")===S,V(),le.sortDetached=$(function(e){return 1&e.compareDocumentPosition(T.createElement("fieldset"))}),ce.find=I,ce.expr[":"]=ce.expr.pseudos,ce.unique=ce.uniqueSort,I.compile=ne,I.select=re,I.setDocument=V,I.tokenize=Y,I.escape=ce.escapeSelector,I.getText=ce.text,I.isXML=ce.isXMLDoc,I.selectors=ce.expr,I.support=ce.support,I.uniqueSort=ce.uniqueSort}();var d=function(e,t,n){var r=[],i=void 0!==n;while((e=e[t])&&9!==e.nodeType)if(1===e.nodeType){if(i&&ce(e).is(n))break;r.push(e)}return r},h=function(e,t){for(var n=[];e;e=e.nextSibling)1===e.nodeType&&e!==t&&n.push(e);return n},b=ce.expr.match.needsContext,w=/^<([a-z][^\/\0>:\x20\t\r\n\f]*)[\x20\t\r\n\f]*\/?>(?:<\/\1>|)$/i;function T(e,n,r){return v(n)?ce.grep(e,function(e,t){return!!n.call(e,t,e)!==r}):n.nodeType?ce.grep(e,function(e){return e===n!==r}):"string"!=typeof n?ce.grep(e,function(e){return-1<se.call(n,e)!==r}):ce.filter(n,e,r)}ce.filter=function(e,t,n){var r=t[0];return n&&(e=":not("+e+")"),1===t.length&&1===r.nodeType?ce.find.matchesSelector(r,e)?[r]:[]:ce.find.matches(e,ce.grep(t,function(e){return 1===e.nodeType}))},ce.fn.extend({find:function(e){var t,n,r=this.length,i=this;if("string"!=typeof e)return this.pushStack(ce(e).filter(function(){for(t=0;t<r;t++)if(ce.contains(i[t],this))return!0}));for(n=this.pushStack([]),t=0;t<r;t++)ce.find(e,i[t],n);return 1<r?ce.uniqueSort(n):n},filter:function(e){return this.pushStack(T(this,e||[],!1))},not:function(e){return this.pushStack(T(this,e||[],!0))},is:function(e){return!!T(this,"string"==typeof e&&b.test(e)?ce(e):e||[],!1).length}});var k,S=/^(?:\s*(<[\w\W]+>)[^>]*|#([\w-]+))$/;(ce.fn.init=function(e,t,n){var r,i;if(!e)return this;if(n=n||k,"string"==typeof e){if(!(r="<"===e[0]&&">"===e[e.length-1]&&3<=e.length?[null,e,null]:S.exec(e))||!r[1]&&t)return!t||t.jquery?(t||n).find(e):this.constructor(t).find(e);if(r[1]){if(t=t instanceof ce?t[0]:t,ce.merge(this,ce.parseHTML(r[1],t&&t.nodeType?t.ownerDocument||t:C,!0)),w.test(r[1])&&ce.isPlainObject(t))for(r in t)v(this[r])?this[r](t[r]):this.attr(r,t[r]);return this}return(i=C.getElementById(r[2]))&&(this[0]=i,this.length=1),this}return e.nodeType?(this[0]=e,this.length=1,this):v(e)?void 0!==n.ready?n.ready(e):e(ce):ce.makeArray(e,this)}).prototype=ce.fn,k=ce(C);var E=/^(?:parents|prev(?:Until|All))/,j={children:!0,contents:!0,next:!0,prev:!0};function A(e,t){while((e=e[t])&&1!==e.nodeType);return e}ce.fn.extend({has:function(e){var t=ce(e,this),n=t.length;return this.filter(function(){for(var e=0;e<n;e++)if(ce.contains(this,t[e]))return!0})},closest:function(e,t){var n,r=0,i=this.length,o=[],a="string"!=typeof e&&ce(e);if(!b.test(e))for(;r<i;r++)for(n=this[r];n&&n!==t;n=n.parentNode)if(n.nodeType<11&&(a?-1<a.index(n):1===n.nodeType&&ce.find.matchesSelector(n,e))){o.push(n);break}return this.pushStack(1<o.length?ce.uniqueSort(o):o)},index:function(e){return e?"string"==typeof e?se.call(ce(e),this[0]):se.call(this,e.jquery?e[0]:e):this[0]&&this[0].parentNode?this.first().prevAll().length:-1},add:function(e,t){return this.pushStack(ce.uniqueSort(ce.merge(this.get(),ce(e,t))))},addBack:function(e){return this.add(null==e?this.prevObject:this.prevObject.filter(e))}}),ce.each({parent:function(e){var t=e.parentNode;return t&&11!==t.nodeType?t:null},parents:function(e){return d(e,"parentNode")},parentsUntil:function(e,t,n){return d(e,"parentNode",n)},next:function(e){return A(e,"nextSibling")},prev:function(e){return A(e,"previousSibling")},nextAll:function(e){return d(e,"nextSibling")},prevAll:function(e){return d(e,"previousSibling")},nextUntil:function(e,t,n){return d(e,"nextSibling",n)},prevUntil:function(e,t,n){return d(e,"previousSibling",n)},siblings:function(e){return h((e.parentNode||{}).firstChild,e)},children:function(e){return h(e.firstChild)},contents:function(e){return null!=e.contentDocument&&r(e.contentDocument)?e.contentDocument:(fe(e,"template")&&(e=e.content||e),ce.merge([],e.childNodes))}},function(r,i){ce.fn[r]=function(e,t){var n=ce.map(this,i,e);return"Until"!==r.slice(-5)&&(t=e),t&&"string"==typeof t&&(n=ce.filter(t,n)),1<this.length&&(j[r]||ce.uniqueSort(n),E.test(r)&&n.reverse()),this.pushStack(n)}});var D=/[^\x20\t\r\n\f]+/g;function N(e){return e}function q(e){throw e}function L(e,t,n,r){var i;try{e&&v(i=e.promise)?i.call(e).done(t).fail(n):e&&v(i=e.then)?i.call(e,t,n):t.apply(void 0,[e].slice(r))}catch(e){n.apply(void 0,[e])}}ce.Callbacks=function(r){var e,n;r="string"==typeof r?(e=r,n={},ce.each(e.match(D)||[],function(e,t){n[t]=!0}),n):ce.extend({},r);var i,t,o,a,s=[],u=[],l=-1,c=function(){for(a=a||r.once,o=i=!0;u.length;l=-1){t=u.shift();while(++l<s.length)!1===s[l].apply(t[0],t[1])&&r.stopOnFalse&&(l=s.length,t=!1)}r.memory||(t=!1),i=!1,a&&(s=t?[]:"")},f={add:function(){return s&&(t&&!i&&(l=s.length-1,u.push(t)),function n(e){ce.each(e,function(e,t){v(t)?r.unique&&f.has(t)||s.push(t):t&&t.length&&"string"!==x(t)&&n(t)})}(arguments),t&&!i&&c()),this},remove:function(){return ce.each(arguments,function(e,t){var n;while(-1<(n=ce.inArray(t,s,n)))s.splice(n,1),n<=l&&l--}),this},has:function(e){return e?-1<ce.inArray(e,s):0<s.length},empty:function(){return s&&(s=[]),this},disable:function(){return a=u=[],s=t="",this},disabled:function(){return!s},lock:function(){return a=u=[],t||i||(s=t=""),this},locked:function(){return!!a},fireWith:function(e,t){return a||(t=[e,(t=t||[]).slice?t.slice():t],u.push(t),i||c()),this},fire:function(){return f.fireWith(this,arguments),this},fired:function(){return!!o}};return f},ce.extend({Deferred:function(e){var o=[["notify","progress",ce.Callbacks("memory"),ce.Callbacks("memory"),2],["resolve","done",ce.Callbacks("once memory"),ce.Callbacks("once memory"),0,"resolved"],["reject","fail",ce.Callbacks("once memory"),ce.Callbacks("once memory"),1,"rejected"]],i="pending",a={state:function(){return i},always:function(){return s.done(arguments).fail(arguments),this},"catch":function(e){return a.then(null,e)},pipe:function(){var i=arguments;return ce.Deferred(function(r){ce.each(o,function(e,t){var n=v(i[t[4]])&&i[t[4]];s[t[1]](function(){var e=n&&n.apply(this,arguments);e&&v(e.promise)?e.promise().progress(r.notify).done(r.resolve).fail(r.reject):r[t[0]+"With"](this,n?[e]:arguments)})}),i=null}).promise()},then:function(t,n,r){var u=0;function l(i,o,a,s){return function(){var n=this,r=arguments,e=function(){var e,t;if(!(i<u)){if((e=a.apply(n,r))===o.promise())throw new TypeError("Thenable self-resolution");t=e&&("object"==typeof e||"function"==typeof e)&&e.then,v(t)?s?t.call(e,l(u,o,N,s),l(u,o,q,s)):(u++,t.call(e,l(u,o,N,s),l(u,o,q,s),l(u,o,N,o.notifyWith))):(a!==N&&(n=void 0,r=[e]),(s||o.resolveWith)(n,r))}},t=s?e:function(){try{e()}catch(e){ce.Deferred.exceptionHook&&ce.Deferred.exceptionHook(e,t.error),u<=i+1&&(a!==q&&(n=void 0,r=[e]),o.rejectWith(n,r))}};i?t():(ce.Deferred.getErrorHook?t.error=ce.Deferred.getErrorHook():ce.Deferred.getStackHook&&(t.error=ce.Deferred.getStackHook()),ie.setTimeout(t))}}return ce.Deferred(function(e){o[0][3].add(l(0,e,v(r)?r:N,e.notifyWith)),o[1][3].add(l(0,e,v(t)?t:N)),o[2][3].add(l(0,e,v(n)?n:q))}).promise()},promise:function(e){return null!=e?ce.extend(e,a):a}},s={};return ce.each(o,function(e,t){var n=t[2],r=t[5];a[t[1]]=n.add,r&&n.add(function(){i=r},o[3-e][2].disable,o[3-e][3].disable,o[0][2].lock,o[0][3].lock),n.add(t[3].fire),s[t[0]]=function(){return s[t[0]+"With"](this===s?void 0:this,arguments),this},s[t[0]+"With"]=n.fireWith}),a.promise(s),e&&e.call(s,s),s},when:function(e){var n=arguments.length,t=n,r=Array(t),i=ae.call(arguments),o=ce.Deferred(),a=function(t){return function(e){r[t]=this,i[t]=1<arguments.length?ae.call(arguments):e,--n||o.resolveWith(r,i)}};if(n<=1&&(L(e,o.done(a(t)).resolve,o.reject,!n),"pending"===o.state()||v(i[t]&&i[t].then)))return o.then();while(t--)L(i[t],a(t),o.reject);return o.promise()}});var H=/^(Eval|Internal|Range|Reference|Syntax|Type|URI)Error$/;ce.Deferred.exceptionHook=function(e,t){ie.console&&ie.console.warn&&e&&H.test(e.name)&&ie.console.warn("jQuery.Deferred exception: "+e.message,e.stack,t)},ce.readyException=function(e){ie.setTimeout(function(){throw e})};var O=ce.Deferred();function P(){C.removeEventListener("DOMContentLoaded",P),ie.removeEventListener("load",P),ce.ready()}ce.fn.ready=function(e){return O.then(e)["catch"](function(e){ce.readyException(e)}),this},ce.extend({isReady:!1,readyWait:1,ready:function(e){(!0===e?--ce.readyWait:ce.isReady)||(ce.isReady=!0)!==e&&0<--ce.readyWait||O.resolveWith(C,[ce])}}),ce.ready.then=O.then,"complete"===C.readyState||"loading"!==C.readyState&&!C.documentElement.doScroll?ie.setTimeout(ce.ready):(C.addEventListener("DOMContentLoaded",P),ie.addEventListener("load",P));var M=function(e,t,n,r,i,o,a){var s=0,u=e.length,l=null==n;if("object"===x(n))for(s in i=!0,n)M(e,t,s,n[s],!0,o,a);else if(void 0!==r&&(i=!0,v(r)||(a=!0),l&&(a?(t.call(e,r),t=null):(l=t,t=function(e,t,n){return l.call(ce(e),n)})),t))for(;s<u;s++)t(e[s],n,a?r:r.call(e[s],s,t(e[s],n)));return i?e:l?t.call(e):u?t(e[0],n):o},R=/^-ms-/,I=/-([a-z])/g;function W(e,t){return t.toUpperCase()}function F(e){return e.replace(R,"ms-").replace(I,W)}var $=function(e){return 1===e.nodeType||9===e.nodeType||!+e.nodeType};function B(){this.expando=ce.expando+B.uid++}B.uid=1,B.prototype={cache:function(e){var t=e[this.expando];return t||(t={},$(e)&&(e.nodeType?e[this.expando]=t:Object.defineProperty(e,this.expando,{value:t,configurable:!0}))),t},set:function(e,t,n){var r,i=this.cache(e);if("string"==typeof t)i[F(t)]=n;else for(r in t)i[F(r)]=t[r];return i},get:function(e,t){return void 0===t?this.cache(e):e[this.expando]&&e[this.expando][F(t)]},access:function(e,t,n){return void 0===t||t&&"string"==typeof t&&void 0===n?this.get(e,t):(this.set(e,t,n),void 0!==n?n:t)},remove:function(e,t){var n,r=e[this.expando];if(void 0!==r){if(void 0!==t){n=(t=Array.isArray(t)?t.map(F):(t=F(t))in r?[t]:t.match(D)||[]).length;while(n--)delete r[t[n]]}(void 0===t||ce.isEmptyObject(r))&&(e.nodeType?e[this.expando]=void 0:delete e[this.expando])}},hasData:function(e){var t=e[this.expando];return void 0!==t&&!ce.isEmptyObject(t)}};var _=new B,z=new B,X=/^(?:\{[\w\W]*\}|\[[\w\W]*\])$/,U=/[A-Z]/g;function V(e,t,n){var r,i;if(void 0===n&&1===e.nodeType)if(r="data-"+t.replace(U,"-$&").toLowerCase(),"string"==typeof(n=e.getAttribute(r))){try{n="true"===(i=n)||"false"!==i&&("null"===i?null:i===+i+""?+i:X.test(i)?JSON.parse(i):i)}catch(e){}z.set(e,t,n)}else n=void 0;return n}ce.extend({hasData:function(e){return z.hasData(e)||_.hasData(e)},data:function(e,t,n){return z.access(e,t,n)},removeData:function(e,t){z.remove(e,t)},_data:function(e,t,n){return _.access(e,t,n)},_removeData:function(e,t){_.remove(e,t)}}),ce.fn.extend({data:function(n,e){var t,r,i,o=this[0],a=o&&o.attributes;if(void 0===n){if(this.length&&(i=z.get(o),1===o.nodeType&&!_.get(o,"hasDataAttrs"))){t=a.length;while(t--)a[t]&&0===(r=a[t].name).indexOf("data-")&&(r=F(r.slice(5)),V(o,r,i[r]));_.set(o,"hasDataAttrs",!0)}return i}return"object"==typeof n?this.each(function(){z.set(this,n)}):M(this,function(e){var t;if(o&&void 0===e)return void 0!==(t=z.get(o,n))?t:void 0!==(t=V(o,n))?t:void 0;this.each(function(){z.set(this,n,e)})},null,e,1<arguments.length,null,!0)},removeData:function(e){return this.each(function(){z.remove(this,e)})}}),ce.extend({queue:function(e,t,n){var r;if(e)return t=(t||"fx")+"queue",r=_.get(e,t),n&&(!r||Array.isArray(n)?r=_.access(e,t,ce.makeArray(n)):r.push(n)),r||[]},dequeue:function(e,t){t=t||"fx";var n=ce.queue(e,t),r=n.length,i=n.shift(),o=ce._queueHooks(e,t);"inprogress"===i&&(i=n.shift(),r--),i&&("fx"===t&&n.unshift("inprogress"),delete o.stop,i.call(e,function(){ce.dequeue(e,t)},o)),!r&&o&&o.empty.fire()},_queueHooks:function(e,t){var n=t+"queueHooks";return _.get(e,n)||_.access(e,n,{empty:ce.Callbacks("once memory").add(function(){_.remove(e,[t+"queue",n])})})}}),ce.fn.extend({queue:function(t,n){var e=2;return"string"!=typeof t&&(n=t,t="fx",e--),arguments.length<e?ce.queue(this[0],t):void 0===n?this:this.each(function(){var e=ce.queue(this,t,n);ce._queueHooks(this,t),"fx"===t&&"inprogress"!==e[0]&&ce.dequeue(this,t)})},dequeue:function(e){return this.each(function(){ce.dequeue(this,e)})},clearQueue:function(e){return this.queue(e||"fx",[])},promise:function(e,t){var n,r=1,i=ce.Deferred(),o=this,a=this.length,s=function(){--r||i.resolveWith(o,[o])};"string"!=typeof e&&(t=e,e=void 0),e=e||"fx";while(a--)(n=_.get(o[a],e+"queueHooks"))&&n.empty&&(r++,n.empty.add(s));return s(),i.promise(t)}});var G=/[+-]?(?:\d*\.|)\d+(?:[eE][+-]?\d+|)/.source,Y=new RegExp("^(?:([+-])=|)("+G+")([a-z%]*)$","i"),Q=["Top","Right","Bottom","Left"],J=C.documentElement,K=function(e){return ce.contains(e.ownerDocument,e)},Z={composed:!0};J.getRootNode&&(K=function(e){return ce.contains(e.ownerDocument,e)||e.getRootNode(Z)===e.ownerDocument});var ee=function(e,t){return"none"===(e=t||e).style.display||""===e.style.display&&K(e)&&"none"===ce.css(e,"display")};function te(e,t,n,r){var i,o,a=20,s=r?function(){return r.cur()}:function(){return ce.css(e,t,"")},u=s(),l=n&&n[3]||(ce.cssNumber[t]?"":"px"),c=e.nodeType&&(ce.cssNumber[t]||"px"!==l&&+u)&&Y.exec(ce.css(e,t));if(c&&c[3]!==l){u/=2,l=l||c[3],c=+u||1;while(a--)ce.style(e,t,c+l),(1-o)*(1-(o=s()/u||.5))<=0&&(a=0),c/=o;c*=2,ce.style(e,t,c+l),n=n||[]}return n&&(c=+c||+u||0,i=n[1]?c+(n[1]+1)*n[2]:+n[2],r&&(r.unit=l,r.start=c,r.end=i)),i}var ne={};function re(e,t){for(var n,r,i,o,a,s,u,l=[],c=0,f=e.length;c<f;c++)(r=e[c]).style&&(n=r.style.display,t?("none"===n&&(l[c]=_.get(r,"display")||null,l[c]||(r.style.display="")),""===r.style.display&&ee(r)&&(l[c]=(u=a=o=void 0,a=(i=r).ownerDocument,s=i.nodeName,(u=ne[s])||(o=a.body.appendChild(a.createElement(s)),u=ce.css(o,"display"),o.parentNode.removeChild(o),"none"===u&&(u="block"),ne[s]=u)))):"none"!==n&&(l[c]="none",_.set(r,"display",n)));for(c=0;c<f;c++)null!=l[c]&&(e[c].style.display=l[c]);return e}ce.fn.extend({show:function(){return re(this,!0)},hide:function(){return re(this)},toggle:function(e){return"boolean"==typeof e?e?this.show():this.hide():this.each(function(){ee(this)?ce(this).show():ce(this).hide()})}});var xe,be,we=/^(?:checkbox|radio)$/i,Te=/<([a-z][^\/\0>\x20\t\r\n\f]*)/i,Ce=/^$|^module$|\/(?:java|ecma)script/i;xe=C.createDocumentFragment().appendChild(C.createElement("div")),(be=C.createElement("input")).setAttribute("type","radio"),be.setAttribute("checked","checked"),be.setAttribute("name","t"),xe.appendChild(be),le.checkClone=xe.cloneNode(!0).cloneNode(!0).lastChild.checked,xe.innerHTML="<textarea>x</textarea>",le.noCloneChecked=!!xe.cloneNode(!0).lastChild.defaultValue,xe.innerHTML="<option></option>",le.option=!!xe.lastChild;var ke={thead:[1,"<table>","</table>"],col:[2,"<table><colgroup>","</colgroup></table>"],tr:[2,"<table><tbody>","</tbody></table>"],td:[3,"<table><tbody><tr>","</tr></tbody></table>"],_default:[0,"",""]};function Se(e,t){var n;return n="undefined"!=typeof e.getElementsByTagName?e.getElementsByTagName(t||"*"):"undefined"!=typeof e.querySelectorAll?e.querySelectorAll(t||"*"):[],void 0===t||t&&fe(e,t)?ce.merge([e],n):n}function Ee(e,t){for(var n=0,r=e.length;n<r;n++)_.set(e[n],"globalEval",!t||_.get(t[n],"globalEval"))}ke.tbody=ke.tfoot=ke.colgroup=ke.caption=ke.thead,ke.th=ke.td,le.option||(ke.optgroup=ke.option=[1,"<select multiple='multiple'>","</select>"]);var je=/<|&#?\w+;/;function Ae(e,t,n,r,i){for(var o,a,s,u,l,c,f=t.createDocumentFragment(),p=[],d=0,h=e.length;d<h;d++)if((o=e[d])||0===o)if("object"===x(o))ce.merge(p,o.nodeType?[o]:o);else if(je.test(o)){a=a||f.appendChild(t.createElement("div")),s=(Te.exec(o)||["",""])[1].toLowerCase(),u=ke[s]||ke._default,a.innerHTML=u[1]+ce.htmlPrefilter(o)+u[2],c=u[0];while(c--)a=a.lastChild;ce.merge(p,a.childNodes),(a=f.firstChild).textContent=""}else p.push(t.createTextNode(o));f.textContent="",d=0;while(o=p[d++])if(r&&-1<ce.inArray(o,r))i&&i.push(o);else if(l=K(o),a=Se(f.appendChild(o),"script"),l&&Ee(a),n){c=0;while(o=a[c++])Ce.test(o.type||"")&&n.push(o)}return f}var De=/^([^.]*)(?:\.(.+)|)/;function Ne(){return!0}function qe(){return!1}function Le(e,t,n,r,i,o){var a,s;if("object"==typeof t){for(s in"string"!=typeof n&&(r=r||n,n=void 0),t)Le(e,s,n,r,t[s],o);return e}if(null==r&&null==i?(i=n,r=n=void 0):null==i&&("string"==typeof n?(i=r,r=void 0):(i=r,r=n,n=void 0)),!1===i)i=qe;else if(!i)return e;return 1===o&&(a=i,(i=function(e){return ce().off(e),a.apply(this,arguments)}).guid=a.guid||(a.guid=ce.guid++)),e.each(function(){ce.event.add(this,t,i,r,n)})}function He(e,r,t){t?(_.set(e,r,!1),ce.event.add(e,r,{namespace:!1,handler:function(e){var t,n=_.get(this,r);if(1&e.isTrigger&&this[r]){if(n)(ce.event.special[r]||{}).delegateType&&e.stopPropagation();else if(n=ae.call(arguments),_.set(this,r,n),this[r](),t=_.get(this,r),_.set(this,r,!1),n!==t)return e.stopImmediatePropagation(),e.preventDefault(),t}else n&&(_.set(this,r,ce.event.trigger(n[0],n.slice(1),this)),e.stopPropagation(),e.isImmediatePropagationStopped=Ne)}})):void 0===_.get(e,r)&&ce.event.add(e,r,Ne)}ce.event={global:{},add:function(t,e,n,r,i){var o,a,s,u,l,c,f,p,d,h,g,v=_.get(t);if($(t)){n.handler&&(n=(o=n).handler,i=o.selector),i&&ce.find.matchesSelector(J,i),n.guid||(n.guid=ce.guid++),(u=v.events)||(u=v.events=Object.create(null)),(a=v.handle)||(a=v.handle=function(e){return"undefined"!=typeof ce&&ce.event.triggered!==e.type?ce.event.dispatch.apply(t,arguments):void 0}),l=(e=(e||"").match(D)||[""]).length;while(l--)d=g=(s=De.exec(e[l])||[])[1],h=(s[2]||"").split(".").sort(),d&&(f=ce.event.special[d]||{},d=(i?f.delegateType:f.bindType)||d,f=ce.event.special[d]||{},c=ce.extend({type:d,origType:g,data:r,handler:n,guid:n.guid,selector:i,needsContext:i&&ce.expr.match.needsContext.test(i),namespace:h.join(".")},o),(p=u[d])||((p=u[d]=[]).delegateCount=0,f.setup&&!1!==f.setup.call(t,r,h,a)||t.addEventListener&&t.addEventListener(d,a)),f.add&&(f.add.call(t,c),c.handler.guid||(c.handler.guid=n.guid)),i?p.splice(p.delegateCount++,0,c):p.push(c),ce.event.global[d]=!0)}},remove:function(e,t,n,r,i){var o,a,s,u,l,c,f,p,d,h,g,v=_.hasData(e)&&_.get(e);if(v&&(u=v.events)){l=(t=(t||"").match(D)||[""]).length;while(l--)if(d=g=(s=De.exec(t[l])||[])[1],h=(s[2]||"").split(".").sort(),d){f=ce.event.special[d]||{},p=u[d=(r?f.delegateType:f.bindType)||d]||[],s=s[2]&&new RegExp("(^|\\.)"+h.join("\\.(?:.*\\.|)")+"(\\.|$)"),a=o=p.length;while(o--)c=p[o],!i&&g!==c.origType||n&&n.guid!==c.guid||s&&!s.test(c.namespace)||r&&r!==c.selector&&("**"!==r||!c.selector)||(p.splice(o,1),c.selector&&p.delegateCount--,f.remove&&f.remove.call(e,c));a&&!p.length&&(f.teardown&&!1!==f.teardown.call(e,h,v.handle)||ce.removeEvent(e,d,v.handle),delete u[d])}else for(d in u)ce.event.remove(e,d+t[l],n,r,!0);ce.isEmptyObject(u)&&_.remove(e,"handle events")}},dispatch:function(e){var t,n,r,i,o,a,s=new Array(arguments.length),u=ce.event.fix(e),l=(_.get(this,"events")||Object.create(null))[u.type]||[],c=ce.event.special[u.type]||{};for(s[0]=u,t=1;t<arguments.length;t++)s[t]=arguments[t];if(u.delegateTarget=this,!c.preDispatch||!1!==c.preDispatch.call(this,u)){a=ce.event.handlers.call(this,u,l),t=0;while((i=a[t++])&&!u.isPropagationStopped()){u.currentTarget=i.elem,n=0;while((o=i.handlers[n++])&&!u.isImmediatePropagationStopped())u.rnamespace&&!1!==o.namespace&&!u.rnamespace.test(o.namespace)||(u.handleObj=o,u.data=o.data,void 0!==(r=((ce.event.special[o.origType]||{}).handle||o.handler).apply(i.elem,s))&&!1===(u.result=r)&&(u.preventDefault(),u.stopPropagation()))}return c.postDispatch&&c.postDispatch.call(this,u),u.result}},handlers:function(e,t){var n,r,i,o,a,s=[],u=t.delegateCount,l=e.target;if(u&&l.nodeType&&!("click"===e.type&&1<=e.button))for(;l!==this;l=l.parentNode||this)if(1===l.nodeType&&("click"!==e.type||!0!==l.disabled)){for(o=[],a={},n=0;n<u;n++)void 0===a[i=(r=t[n]).selector+" "]&&(a[i]=r.needsContext?-1<ce(i,this).index(l):ce.find(i,this,null,[l]).length),a[i]&&o.push(r);o.length&&s.push({elem:l,handlers:o})}return l=this,u<t.length&&s.push({elem:l,handlers:t.slice(u)}),s},addProp:function(t,e){Object.defineProperty(ce.Event.prototype,t,{enumerable:!0,configurable:!0,get:v(e)?function(){if(this.originalEvent)return e(this.originalEvent)}:function(){if(this.originalEvent)return this.originalEvent[t]},set:function(e){Object.defineProperty(this,t,{enumerable:!0,configurable:!0,writable:!0,value:e})}})},fix:function(e){return e[ce.expando]?e:new ce.Event(e)},special:{load:{noBubble:!0},click:{setup:function(e){var t=this||e;return we.test(t.type)&&t.click&&fe(t,"input")&&He(t,"click",!0),!1},trigger:function(e){var t=this||e;return we.test(t.type)&&t.click&&fe(t,"input")&&He(t,"click"),!0},_default:function(e){var t=e.target;return we.test(t.type)&&t.click&&fe(t,"input")&&_.get(t,"click")||fe(t,"a")}},beforeunload:{postDispatch:function(e){void 0!==e.result&&e.originalEvent&&(e.originalEvent.returnValue=e.result)}}}},ce.removeEvent=function(e,t,n){e.removeEventListener&&e.removeEventListener(t,n)},ce.Event=function(e,t){if(!(this instanceof ce.Event))return new ce.Event(e,t);e&&e.type?(this.originalEvent=e,this.type=e.type,this.isDefaultPrevented=e.defaultPrevented||void 0===e.defaultPrevented&&!1===e.returnValue?Ne:qe,this.target=e.target&&3===e.target.nodeType?e.target.parentNode:e.target,this.currentTarget=e.currentTarget,this.relatedTarget=e.relatedTarget):this.type=e,t&&ce.extend(this,t),this.timeStamp=e&&e.timeStamp||Date.now(),this[ce.expando]=!0},ce.Event.prototype={constructor:ce.Event,isDefaultPrevented:qe,isPropagationStopped:qe,isImmediatePropagationStopped:qe,isSimulated:!1,preventDefault:function(){var e=this.originalEvent;this.isDefaultPrevented=Ne,e&&!this.isSimulated&&e.preventDefault()},stopPropagation:function(){var e=this.originalEvent;this.isPropagationStopped=Ne,e&&!this.isSimulated&&e.stopPropagation()},stopImmediatePropagation:function(){var e=this.originalEvent;this.isImmediatePropagationStopped=Ne,e&&!this.isSimulated&&e.stopImmediatePropagation(),this.stopPropagation()}},ce.each({altKey:!0,bubbles:!0,cancelable:!0,changedTouches:!0,ctrlKey:!0,detail:!0,eventPhase:!0,metaKey:!0,pageX:!0,pageY:!0,shiftKey:!0,view:!0,"char":!0,code:!0,charCode:!0,key:!0,keyCode:!0,button:!0,buttons:!0,clientX:!0,clientY:!0,offsetX:!0,offsetY:!0,pointerId:!0,pointerType:!0,screenX:!0,screenY:!0,targetTouches:!0,toElement:!0,touches:!0,which:!0},ce.event.addProp),ce.each({focus:"focusin",blur:"focusout"},function(r,i){function o(e){if(C.documentMode){var t=_.get(this,"handle"),n=ce.event.fix(e);n.type="focusin"===e.type?"focus":"blur",n.isSimulated=!0,t(e),n.target===n.currentTarget&&t(n)}else ce.event.simulate(i,e.target,ce.event.fix(e))}ce.event.special[r]={setup:function(){var e;if(He(this,r,!0),!C.documentMode)return!1;(e=_.get(this,i))||this.addEventListener(i,o),_.set(this,i,(e||0)+1)},trigger:function(){return He(this,r),!0},teardown:function(){var e;if(!C.documentMode)return!1;(e=_.get(this,i)-1)?_.set(this,i,e):(this.removeEventListener(i,o),_.remove(this,i))},_default:function(e){return _.get(e.target,r)},delegateType:i},ce.event.special[i]={setup:function(){var e=this.ownerDocument||this.document||this,t=C.documentMode?this:e,n=_.get(t,i);n||(C.documentMode?this.addEventListener(i,o):e.addEventListener(r,o,!0)),_.set(t,i,(n||0)+1)},teardown:function(){var e=this.ownerDocument||this.document||this,t=C.documentMode?this:e,n=_.get(t,i)-1;n?_.set(t,i,n):(C.documentMode?this.removeEventListener(i,o):e.removeEventListener(r,o,!0),_.remove(t,i))}}}),ce.each({mouseenter:"mouseover",mouseleave:"mouseout",pointerenter:"pointerover",pointerleave:"pointerout"},function(e,i){ce.event.special[e]={delegateType:i,bindType:i,handle:function(e){var t,n=e.relatedTarget,r=e.handleObj;return n&&(n===this||ce.contains(this,n))||(e.type=r.origType,t=r.handler.apply(this,arguments),e.type=i),t}}}),ce.fn.extend({on:function(e,t,n,r){return Le(this,e,t,n,r)},one:function(e,t,n,r){return Le(this,e,t,n,r,1)},off:function(e,t,n){var r,i;if(e&&e.preventDefault&&e.handleObj)return r=e.handleObj,ce(e.delegateTarget).off(r.namespace?r.origType+"."+r.namespace:r.origType,r.selector,r.handler),this;if("object"==typeof e){for(i in e)this.off(i,t,e[i]);return this}return!1!==t&&"function"!=typeof t||(n=t,t=void 0),!1===n&&(n=qe),this.each(function(){ce.event.remove(this,e,n,t)})}});var Oe=/<script|<style|<link/i,Pe=/checked\s*(?:[^=]|=\s*.checked.)/i,Me=/^\s*<!\[CDATA\[|\]\]>\s*$/g;function Re(e,t){return fe(e,"table")&&fe(11!==t.nodeType?t:t.firstChild,"tr")&&ce(e).children("tbody")[0]||e}function Ie(e){return e.type=(null!==e.getAttribute("type"))+"/"+e.type,e}function We(e){return"true/"===(e.type||"").slice(0,5)?e.type=e.type.slice(5):e.removeAttribute("type"),e}function Fe(e,t){var n,r,i,o,a,s;if(1===t.nodeType){if(_.hasData(e)&&(s=_.get(e).events))for(i in _.remove(t,"handle events"),s)for(n=0,r=s[i].length;n<r;n++)ce.event.add(t,i,s[i][n]);z.hasData(e)&&(o=z.access(e),a=ce.extend({},o),z.set(t,a))}}function $e(n,r,i,o){r=g(r);var e,t,a,s,u,l,c=0,f=n.length,p=f-1,d=r[0],h=v(d);if(h||1<f&&"string"==typeof d&&!le.checkClone&&Pe.test(d))return n.each(function(e){var t=n.eq(e);h&&(r[0]=d.call(this,e,t.html())),$e(t,r,i,o)});if(f&&(t=(e=Ae(r,n[0].ownerDocument,!1,n,o)).firstChild,1===e.childNodes.length&&(e=t),t||o)){for(s=(a=ce.map(Se(e,"script"),Ie)).length;c<f;c++)u=e,c!==p&&(u=ce.clone(u,!0,!0),s&&ce.merge(a,Se(u,"script"))),i.call(n[c],u,c);if(s)for(l=a[a.length-1].ownerDocument,ce.map(a,We),c=0;c<s;c++)u=a[c],Ce.test(u.type||"")&&!_.access(u,"globalEval")&&ce.contains(l,u)&&(u.src&&"module"!==(u.type||"").toLowerCase()?ce._evalUrl&&!u.noModule&&ce._evalUrl(u.src,{nonce:u.nonce||u.getAttribute("nonce")},l):m(u.textContent.replace(Me,""),u,l))}return n}function Be(e,t,n){for(var r,i=t?ce.filter(t,e):e,o=0;null!=(r=i[o]);o++)n||1!==r.nodeType||ce.cleanData(Se(r)),r.parentNode&&(n&&K(r)&&Ee(Se(r,"script")),r.parentNode.removeChild(r));return e}ce.extend({htmlPrefilter:function(e){return e},clone:function(e,t,n){var r,i,o,a,s,u,l,c=e.cloneNode(!0),f=K(e);if(!(le.noCloneChecked||1!==e.nodeType&&11!==e.nodeType||ce.isXMLDoc(e)))for(a=Se(c),r=0,i=(o=Se(e)).length;r<i;r++)s=o[r],u=a[r],void 0,"input"===(l=u.nodeName.toLowerCase())&&we.test(s.type)?u.checked=s.checked:"input"!==l&&"textarea"!==l||(u.defaultValue=s.defaultValue);if(t)if(n)for(o=o||Se(e),a=a||Se(c),r=0,i=o.length;r<i;r++)Fe(o[r],a[r]);else Fe(e,c);return 0<(a=Se(c,"script")).length&&Ee(a,!f&&Se(e,"script")),c},cleanData:function(e){for(var t,n,r,i=ce.event.special,o=0;void 0!==(n=e[o]);o++)if($(n)){if(t=n[_.expando]){if(t.events)for(r in t.events)i[r]?ce.event.remove(n,r):ce.removeEvent(n,r,t.handle);n[_.expando]=void 0}n[z.expando]&&(n[z.expando]=void 0)}}}),ce.fn.extend({detach:function(e){return Be(this,e,!0)},remove:function(e){return Be(this,e)},text:function(e){return M(this,function(e){return void 0===e?ce.text(this):this.empty().each(function(){1!==this.nodeType&&11!==this.nodeType&&9!==this.nodeType||(this.textContent=e)})},null,e,arguments.length)},append:function(){return $e(this,arguments,function(e){1!==this.nodeType&&11!==this.nodeType&&9!==this.nodeType||Re(this,e).appendChild(e)})},prepend:function(){return $e(this,arguments,function(e){if(1===this.nodeType||11===this.nodeType||9===this.nodeType){var t=Re(this,e);t.insertBefore(e,t.firstChild)}})},before:function(){return $e(this,arguments,function(e){this.parentNode&&this.parentNode.insertBefore(e,this)})},after:function(){return $e(this,arguments,function(e){this.parentNode&&this.parentNode.insertBefore(e,this.nextSibling)})},empty:function(){for(var e,t=0;null!=(e=this[t]);t++)1===e.nodeType&&(ce.cleanData(Se(e,!1)),e.textContent="");return this},clone:function(e,t){return e=null!=e&&e,t=null==t?e:t,this.map(function(){return ce.clone(this,e,t)})},html:function(e){return M(this,function(e){var t=this[0]||{},n=0,r=this.length;if(void 0===e&&1===t.nodeType)return t.innerHTML;if("string"==typeof e&&!Oe.test(e)&&!ke[(Te.exec(e)||["",""])[1].toLowerCase()]){e=ce.htmlPrefilter(e);try{for(;n<r;n++)1===(t=this[n]||{}).nodeType&&(ce.cleanData(Se(t,!1)),t.innerHTML=e);t=0}catch(e){}}t&&this.empty().append(e)},null,e,arguments.length)},replaceWith:function(){var n=[];return $e(this,arguments,function(e){var t=this.parentNode;ce.inArray(this,n)<0&&(ce.cleanData(Se(this)),t&&t.replaceChild(e,this))},n)}}),ce.each({appendTo:"append",prependTo:"prepend",insertBefore:"before",insertAfter:"after",replaceAll:"replaceWith"},function(e,a){ce.fn[e]=function(e){for(var t,n=[],r=ce(e),i=r.length-1,o=0;o<=i;o++)t=o===i?this:this.clone(!0),ce(r[o])[a](t),s.apply(n,t.get());return this.pushStack(n)}});var _e=new RegExp("^("+G+")(?!px)[a-z%]+$","i"),ze=/^--/,Xe=function(e){var t=e.ownerDocument.defaultView;return t&&t.opener||(t=ie),t.getComputedStyle(e)},Ue=function(e,t,n){var r,i,o={};for(i in t)o[i]=e.style[i],e.style[i]=t[i];for(i in r=n.call(e),t)e.style[i]=o[i];return r},Ve=new RegExp(Q.join("|"),"i");function Ge(e,t,n){var r,i,o,a,s=ze.test(t),u=e.style;return(n=n||Xe(e))&&(a=n.getPropertyValue(t)||n[t],s&&a&&(a=a.replace(ve,"$1")||void 0),""!==a||K(e)||(a=ce.style(e,t)),!le.pixelBoxStyles()&&_e.test(a)&&Ve.test(t)&&(r=u.width,i=u.minWidth,o=u.maxWidth,u.minWidth=u.maxWidth=u.width=a,a=n.width,u.width=r,u.minWidth=i,u.maxWidth=o)),void 0!==a?a+"":a}function Ye(e,t){return{get:function(){if(!e())return(this.get=t).apply(this,arguments);delete this.get}}}!function(){function e(){if(l){u.style.cssText="position:absolute;left:-11111px;width:60px;margin-top:1px;padding:0;border:0",l.style.cssText="position:relative;display:block;box-sizing:border-box;overflow:scroll;margin:auto;border:1px;padding:1px;width:60%;top:1%",J.appendChild(u).appendChild(l);var e=ie.getComputedStyle(l);n="1%"!==e.top,s=12===t(e.marginLeft),l.style.right="60%",o=36===t(e.right),r=36===t(e.width),l.style.position="absolute",i=12===t(l.offsetWidth/3),J.removeChild(u),l=null}}function t(e){return Math.round(parseFloat(e))}var n,r,i,o,a,s,u=C.createElement("div"),l=C.createElement("div");l.style&&(l.style.backgroundClip="content-box",l.cloneNode(!0).style.backgroundClip="",le.clearCloneStyle="content-box"===l.style.backgroundClip,ce.extend(le,{boxSizingReliable:function(){return e(),r},pixelBoxStyles:function(){return e(),o},pixelPosition:function(){return e(),n},reliableMarginLeft:function(){return e(),s},scrollboxSize:function(){return e(),i},reliableTrDimensions:function(){var e,t,n,r;return null==a&&(e=C.createElement("table"),t=C.createElement("tr"),n=C.createElement("div"),e.style.cssText="position:absolute;left:-11111px;border-collapse:separate",t.style.cssText="box-sizing:content-box;border:1px solid",t.style.height="1px",n.style.height="9px",n.style.display="block",J.appendChild(e).appendChild(t).appendChild(n),r=ie.getComputedStyle(t),a=parseInt(r.height,10)+parseInt(r.borderTopWidth,10)+parseInt(r.borderBottomWidth,10)===t.offsetHeight,J.removeChild(e)),a}}))}();var Qe=["Webkit","Moz","ms"],Je=C.createElement("div").style,Ke={};function Ze(e){var t=ce.cssProps[e]||Ke[e];return t||(e in Je?e:Ke[e]=function(e){var t=e[0].toUpperCase()+e.slice(1),n=Qe.length;while(n--)if((e=Qe[n]+t)in Je)return e}(e)||e)}var et=/^(none|table(?!-c[ea]).+)/,tt={position:"absolute",visibility:"hidden",display:"block"},nt={letterSpacing:"0",fontWeight:"400"};function rt(e,t,n){var r=Y.exec(t);return r?Math.max(0,r[2]-(n||0))+(r[3]||"px"):t}function it(e,t,n,r,i,o){var a="width"===t?1:0,s=0,u=0,l=0;if(n===(r?"border":"content"))return 0;for(;a<4;a+=2)"margin"===n&&(l+=ce.css(e,n+Q[a],!0,i)),r?("content"===n&&(u-=ce.css(e,"padding"+Q[a],!0,i)),"margin"!==n&&(u-=ce.css(e,"border"+Q[a]+"Width",!0,i))):(u+=ce.css(e,"padding"+Q[a],!0,i),"padding"!==n?u+=ce.css(e,"border"+Q[a]+"Width",!0,i):s+=ce.css(e,"border"+Q[a]+"Width",!0,i));return!r&&0<=o&&(u+=Math.max(0,Math.ceil(e["offset"+t[0].toUpperCase()+t.slice(1)]-o-u-s-.5))||0),u+l}function ot(e,t,n){var r=Xe(e),i=(!le.boxSizingReliable()||n)&&"border-box"===ce.css(e,"boxSizing",!1,r),o=i,a=Ge(e,t,r),s="offset"+t[0].toUpperCase()+t.slice(1);if(_e.test(a)){if(!n)return a;a="auto"}return(!le.boxSizingReliable()&&i||!le.reliableTrDimensions()&&fe(e,"tr")||"auto"===a||!parseFloat(a)&&"inline"===ce.css(e,"display",!1,r))&&e.getClientRects().length&&(i="border-box"===ce.css(e,"boxSizing",!1,r),(o=s in e)&&(a=e[s])),(a=parseFloat(a)||0)+it(e,t,n||(i?"border":"content"),o,r,a)+"px"}function at(e,t,n,r,i){return new at.prototype.init(e,t,n,r,i)}ce.extend({cssHooks:{opacity:{get:function(e,t){if(t){var n=Ge(e,"opacity");return""===n?"1":n}}}},cssNumber:{animationIterationCount:!0,aspectRatio:!0,borderImageSlice:!0,columnCount:!0,flexGrow:!0,flexShrink:!0,fontWeight:!0,gridArea:!0,gridColumn:!0,gridColumnEnd:!0,gridColumnStart:!0,gridRow:!0,gridRowEnd:!0,gridRowStart:!0,lineHeight:!0,opacity:!0,order:!0,orphans:!0,scale:!0,widows:!0,zIndex:!0,zoom:!0,fillOpacity:!0,floodOpacity:!0,stopOpacity:!0,strokeMiterlimit:!0,strokeOpacity:!0},cssProps:{},style:function(e,t,n,r){if(e&&3!==e.nodeType&&8!==e.nodeType&&e.style){var i,o,a,s=F(t),u=ze.test(t),l=e.style;if(u||(t=Ze(s)),a=ce.cssHooks[t]||ce.cssHooks[s],void 0===n)return a&&"get"in a&&void 0!==(i=a.get(e,!1,r))?i:l[t];"string"===(o=typeof n)&&(i=Y.exec(n))&&i[1]&&(n=te(e,t,i),o="number"),null!=n&&n==n&&("number"!==o||u||(n+=i&&i[3]||(ce.cssNumber[s]?"":"px")),le.clearCloneStyle||""!==n||0!==t.indexOf("background")||(l[t]="inherit"),a&&"set"in a&&void 0===(n=a.set(e,n,r))||(u?l.setProperty(t,n):l[t]=n))}},css:function(e,t,n,r){var i,o,a,s=F(t);return ze.test(t)||(t=Ze(s)),(a=ce.cssHooks[t]||ce.cssHooks[s])&&"get"in a&&(i=a.get(e,!0,n)),void 0===i&&(i=Ge(e,t,r)),"normal"===i&&t in nt&&(i=nt[t]),""===n||n?(o=parseFloat(i),!0===n||isFinite(o)?o||0:i):i}}),ce.each(["height","width"],function(e,u){ce.cssHooks[u]={get:function(e,t,n){if(t)return!et.test(ce.css(e,"display"))||e.getClientRects().length&&e.getBoundingClientRect().width?ot(e,u,n):Ue(e,tt,function(){return ot(e,u,n)})},set:function(e,t,n){var r,i=Xe(e),o=!le.scrollboxSize()&&"absolute"===i.position,a=(o||n)&&"border-box"===ce.css(e,"boxSizing",!1,i),s=n?it(e,u,n,a,i):0;return a&&o&&(s-=Math.ceil(e["offset"+u[0].toUpperCase()+u.slice(1)]-parseFloat(i[u])-it(e,u,"border",!1,i)-.5)),s&&(r=Y.exec(t))&&"px"!==(r[3]||"px")&&(e.style[u]=t,t=ce.css(e,u)),rt(0,t,s)}}}),ce.cssHooks.marginLeft=Ye(le.reliableMarginLeft,function(e,t){if(t)return(parseFloat(Ge(e,"marginLeft"))||e.getBoundingClientRect().left-Ue(e,{marginLeft:0},function(){return e.getBoundingClientRect().left}))+"px"}),ce.each({margin:"",padding:"",border:"Width"},function(i,o){ce.cssHooks[i+o]={expand:function(e){for(var t=0,n={},r="string"==typeof e?e.split(" "):[e];t<4;t++)n[i+Q[t]+o]=r[t]||r[t-2]||r[0];return n}},"margin"!==i&&(ce.cssHooks[i+o].set=rt)}),ce.fn.extend({css:function(e,t){return M(this,function(e,t,n){var r,i,o={},a=0;if(Array.isArray(t)){for(r=Xe(e),i=t.length;a<i;a++)o[t[a]]=ce.css(e,t[a],!1,r);return o}return void 0!==n?ce.style(e,t,n):ce.css(e,t)},e,t,1<arguments.length)}}),((ce.Tween=at).prototype={constructor:at,init:function(e,t,n,r,i,o){this.elem=e,this.prop=n,this.easing=i||ce.easing._default,this.options=t,this.start=this.now=this.cur(),this.end=r,this.unit=o||(ce.cssNumber[n]?"":"px")},cur:function(){var e=at.propHooks[this.prop];return e&&e.get?e.get(this):at.propHooks._default.get(this)},run:function(e){var t,n=at.propHooks[this.prop];return this.options.duration?this.pos=t=ce.easing[this.easing](e,this.options.duration*e,0,1,this.options.duration):this.pos=t=e,this.now=(this.end-this.start)*t+this.start,this.options.step&&this.options.step.call(this.elem,this.now,this),n&&n.set?n.set(this):at.propHooks._default.set(this),this}}).init.prototype=at.prototype,(at.propHooks={_default:{get:function(e){var t;return 1!==e.elem.nodeType||null!=e.elem[e.prop]&&null==e.elem.style[e.prop]?e.elem[e.prop]:(t=ce.css(e.elem,e.prop,""))&&"auto"!==t?t:0},set:function(e){ce.fx.step[e.prop]?ce.fx.step[e.prop](e):1!==e.elem.nodeType||!ce.cssHooks[e.prop]&&null==e.elem.style[Ze(e.prop)]?e.elem[e.prop]=e.now:ce.style(e.elem,e.prop,e.now+e.unit)}}}).scrollTop=at.propHooks.scrollLeft={set:function(e){e.elem.nodeType&&e.elem.parentNode&&(e.elem[e.prop]=e.now)}},ce.easing={linear:function(e){return e},swing:function(e){return.5-Math.cos(e*Math.PI)/2},_default:"swing"},ce.fx=at.prototype.init,ce.fx.step={};var st,ut,lt,ct,ft=/^(?:toggle|show|hide)$/,pt=/queueHooks$/;function dt(){ut&&(!1===C.hidden&&ie.requestAnimationFrame?ie.requestAnimationFrame(dt):ie.setTimeout(dt,ce.fx.interval),ce.fx.tick())}function ht(){return ie.setTimeout(function(){st=void 0}),st=Date.now()}function gt(e,t){var n,r=0,i={height:e};for(t=t?1:0;r<4;r+=2-t)i["margin"+(n=Q[r])]=i["padding"+n]=e;return t&&(i.opacity=i.width=e),i}function vt(e,t,n){for(var r,i=(yt.tweeners[t]||[]).concat(yt.tweeners["*"]),o=0,a=i.length;o<a;o++)if(r=i[o].call(n,t,e))return r}function yt(o,e,t){var n,a,r=0,i=yt.prefilters.length,s=ce.Deferred().always(function(){delete u.elem}),u=function(){if(a)return!1;for(var e=st||ht(),t=Math.max(0,l.startTime+l.duration-e),n=1-(t/l.duration||0),r=0,i=l.tweens.length;r<i;r++)l.tweens[r].run(n);return s.notifyWith(o,[l,n,t]),n<1&&i?t:(i||s.notifyWith(o,[l,1,0]),s.resolveWith(o,[l]),!1)},l=s.promise({elem:o,props:ce.extend({},e),opts:ce.extend(!0,{specialEasing:{},easing:ce.easing._default},t),originalProperties:e,originalOptions:t,startTime:st||ht(),duration:t.duration,tweens:[],createTween:function(e,t){var n=ce.Tween(o,l.opts,e,t,l.opts.specialEasing[e]||l.opts.easing);return l.tweens.push(n),n},stop:function(e){var t=0,n=e?l.tweens.length:0;if(a)return this;for(a=!0;t<n;t++)l.tweens[t].run(1);return e?(s.notifyWith(o,[l,1,0]),s.resolveWith(o,[l,e])):s.rejectWith(o,[l,e]),this}}),c=l.props;for(!function(e,t){var n,r,i,o,a;for(n in e)if(i=t[r=F(n)],o=e[n],Array.isArray(o)&&(i=o[1],o=e[n]=o[0]),n!==r&&(e[r]=o,delete e[n]),(a=ce.cssHooks[r])&&"expand"in a)for(n in o=a.expand(o),delete e[r],o)n in e||(e[n]=o[n],t[n]=i);else t[r]=i}(c,l.opts.specialEasing);r<i;r++)if(n=yt.prefilters[r].call(l,o,c,l.opts))return v(n.stop)&&(ce._queueHooks(l.elem,l.opts.queue).stop=n.stop.bind(n)),n;return ce.map(c,vt,l),v(l.opts.start)&&l.opts.start.call(o,l),l.progress(l.opts.progress).done(l.opts.done,l.opts.complete).fail(l.opts.fail).always(l.opts.always),ce.fx.timer(ce.extend(u,{elem:o,anim:l,queue:l.opts.queue})),l}ce.Animation=ce.extend(yt,{tweeners:{"*":[function(e,t){var n=this.createTween(e,t);return te(n.elem,e,Y.exec(t),n),n}]},tweener:function(e,t){v(e)?(t=e,e=["*"]):e=e.match(D);for(var n,r=0,i=e.length;r<i;r++)n=e[r],yt.tweeners[n]=yt.tweeners[n]||[],yt.tweeners[n].unshift(t)},prefilters:[function(e,t,n){var r,i,o,a,s,u,l,c,f="width"in t||"height"in t,p=this,d={},h=e.style,g=e.nodeType&&ee(e),v=_.get(e,"fxshow");for(r in n.queue||(null==(a=ce._queueHooks(e,"fx")).unqueued&&(a.unqueued=0,s=a.empty.fire,a.empty.fire=function(){a.unqueued||s()}),a.unqueued++,p.always(function(){p.always(function(){a.unqueued--,ce.queue(e,"fx").length||a.empty.fire()})})),t)if(i=t[r],ft.test(i)){if(delete t[r],o=o||"toggle"===i,i===(g?"hide":"show")){if("show"!==i||!v||void 0===v[r])continue;g=!0}d[r]=v&&v[r]||ce.style(e,r)}if((u=!ce.isEmptyObject(t))||!ce.isEmptyObject(d))for(r in f&&1===e.nodeType&&(n.overflow=[h.overflow,h.overflowX,h.overflowY],null==(l=v&&v.display)&&(l=_.get(e,"display")),"none"===(c=ce.css(e,"display"))&&(l?c=l:(re([e],!0),l=e.style.display||l,c=ce.css(e,"display"),re([e]))),("inline"===c||"inline-block"===c&&null!=l)&&"none"===ce.css(e,"float")&&(u||(p.done(function(){h.display=l}),null==l&&(c=h.display,l="none"===c?"":c)),h.display="inline-block")),n.overflow&&(h.overflow="hidden",p.always(function(){h.overflow=n.overflow[0],h.overflowX=n.overflow[1],h.overflowY=n.overflow[2]})),u=!1,d)u||(v?"hidden"in v&&(g=v.hidden):v=_.access(e,"fxshow",{display:l}),o&&(v.hidden=!g),g&&re([e],!0),p.done(function(){for(r in g||re([e]),_.remove(e,"fxshow"),d)ce.style(e,r,d[r])})),u=vt(g?v[r]:0,r,p),r in v||(v[r]=u.start,g&&(u.end=u.start,u.start=0))}],prefilter:function(e,t){t?yt.prefilters.unshift(e):yt.prefilters.push(e)}}),ce.speed=function(e,t,n){var r=e&&"object"==typeof e?ce.extend({},e):{complete:n||!n&&t||v(e)&&e,duration:e,easing:n&&t||t&&!v(t)&&t};return ce.fx.off?r.duration=0:"number"!=typeof r.duration&&(r.duration in ce.fx.speeds?r.duration=ce.fx.speeds[r.duration]:r.duration=ce.fx.speeds._default),null!=r.queue&&!0!==r.queue||(r.queue="fx"),r.old=r.complete,r.complete=function(){v(r.old)&&r.old.call(this),r.queue&&ce.dequeue(this,r.queue)},r},ce.fn.extend({fadeTo:function(e,t,n,r){return this.filter(ee).css("opacity",0).show().end().animate({opacity:t},e,n,r)},animate:function(t,e,n,r){var i=ce.isEmptyObject(t),o=ce.speed(e,n,r),a=function(){var e=yt(this,ce.extend({},t),o);(i||_.get(this,"finish"))&&e.stop(!0)};return a.finish=a,i||!1===o.queue?this.each(a):this.queue(o.queue,a)},stop:function(i,e,o){var a=function(e){var t=e.stop;delete e.stop,t(o)};return"string"!=typeof i&&(o=e,e=i,i=void 0),e&&this.queue(i||"fx",[]),this.each(function(){var e=!0,t=null!=i&&i+"queueHooks",n=ce.timers,r=_.get(this);if(t)r[t]&&r[t].stop&&a(r[t]);else for(t in r)r[t]&&r[t].stop&&pt.test(t)&&a(r[t]);for(t=n.length;t--;)n[t].elem!==this||null!=i&&n[t].queue!==i||(n[t].anim.stop(o),e=!1,n.splice(t,1));!e&&o||ce.dequeue(this,i)})},finish:function(a){return!1!==a&&(a=a||"fx"),this.each(function(){var e,t=_.get(this),n=t[a+"queue"],r=t[a+"queueHooks"],i=ce.timers,o=n?n.length:0;for(t.finish=!0,ce.queue(this,a,[]),r&&r.stop&&r.stop.call(this,!0),e=i.length;e--;)i[e].elem===this&&i[e].queue===a&&(i[e].anim.stop(!0),i.splice(e,1));for(e=0;e<o;e++)n[e]&&n[e].finish&&n[e].finish.call(this);delete t.finish})}}),ce.each(["toggle","show","hide"],function(e,r){var i=ce.fn[r];ce.fn[r]=function(e,t,n){return null==e||"boolean"==typeof e?i.apply(this,arguments):this.animate(gt(r,!0),e,t,n)}}),ce.each({slideDown:gt("show"),slideUp:gt("hide"),slideToggle:gt("toggle"),fadeIn:{opacity:"show"},fadeOut:{opacity:"hide"},fadeToggle:{opacity:"toggle"}},function(e,r){ce.fn[e]=function(e,t,n){return this.animate(r,e,t,n)}}),ce.timers=[],ce.fx.tick=function(){var e,t=0,n=ce.timers;for(st=Date.now();t<n.length;t++)(e=n[t])()||n[t]!==e||n.splice(t--,1);n.length||ce.fx.stop(),st=void 0},ce.fx.timer=function(e){ce.timers.push(e),ce.fx.start()},ce.fx.interval=13,ce.fx.start=function(){ut||(ut=!0,dt())},ce.fx.stop=function(){ut=null},ce.fx.speeds={slow:600,fast:200,_default:400},ce.fn.delay=function(r,e){return r=ce.fx&&ce.fx.speeds[r]||r,e=e||"fx",this.queue(e,function(e,t){var n=ie.setTimeout(e,r);t.stop=function(){ie.clearTimeout(n)}})},lt=C.createElement("input"),ct=C.createElement("select").appendChild(C.createElement("option")),lt.type="checkbox",le.checkOn=""!==lt.value,le.optSelected=ct.selected,(lt=C.createElement("input")).value="t",lt.type="radio",le.radioValue="t"===lt.value;var mt,xt=ce.expr.attrHandle;ce.fn.extend({attr:function(e,t){return M(this,ce.attr,e,t,1<arguments.length)},removeAttr:function(e){return this.each(function(){ce.removeAttr(this,e)})}}),ce.extend({attr:function(e,t,n){var r,i,o=e.nodeType;if(3!==o&&8!==o&&2!==o)return"undefined"==typeof e.getAttribute?ce.prop(e,t,n):(1===o&&ce.isXMLDoc(e)||(i=ce.attrHooks[t.toLowerCase()]||(ce.expr.match.bool.test(t)?mt:void 0)),void 0!==n?null===n?void ce.removeAttr(e,t):i&&"set"in i&&void 0!==(r=i.set(e,n,t))?r:(e.setAttribute(t,n+""),n):i&&"get"in i&&null!==(r=i.get(e,t))?r:null==(r=ce.find.attr(e,t))?void 0:r)},attrHooks:{type:{set:function(e,t){if(!le.radioValue&&"radio"===t&&fe(e,"input")){var n=e.value;return e.setAttribute("type",t),n&&(e.value=n),t}}}},removeAttr:function(e,t){var n,r=0,i=t&&t.match(D);if(i&&1===e.nodeType)while(n=i[r++])e.removeAttribute(n)}}),mt={set:function(e,t,n){return!1===t?ce.removeAttr(e,n):e.setAttribute(n,n),n}},ce.each(ce.expr.match.bool.source.match(/\w+/g),function(e,t){var a=xt[t]||ce.find.attr;xt[t]=function(e,t,n){var r,i,o=t.toLowerCase();return n||(i=xt[o],xt[o]=r,r=null!=a(e,t,n)?o:null,xt[o]=i),r}});var bt=/^(?:input|select|textarea|button)$/i,wt=/^(?:a|area)$/i;function Tt(e){return(e.match(D)||[]).join(" ")}function Ct(e){return e.getAttribute&&e.getAttribute("class")||""}function kt(e){return Array.isArray(e)?e:"string"==typeof e&&e.match(D)||[]}ce.fn.extend({prop:function(e,t){return M(this,ce.prop,e,t,1<arguments.length)},removeProp:function(e){return this.each(function(){delete this[ce.propFix[e]||e]})}}),ce.extend({prop:function(e,t,n){var r,i,o=e.nodeType;if(3!==o&&8!==o&&2!==o)return 1===o&&ce.isXMLDoc(e)||(t=ce.propFix[t]||t,i=ce.propHooks[t]),void 0!==n?i&&"set"in i&&void 0!==(r=i.set(e,n,t))?r:e[t]=n:i&&"get"in i&&null!==(r=i.get(e,t))?r:e[t]},propHooks:{tabIndex:{get:function(e){var t=ce.find.attr(e,"tabindex");return t?parseInt(t,10):bt.test(e.nodeName)||wt.test(e.nodeName)&&e.href?0:-1}}},propFix:{"for":"htmlFor","class":"className"}}),le.optSelected||(ce.propHooks.selected={get:function(e){var t=e.parentNode;return t&&t.parentNode&&t.parentNode.selectedIndex,null},set:function(e){var t=e.parentNode;t&&(t.selectedIndex,t.parentNode&&t.parentNode.selectedIndex)}}),ce.each(["tabIndex","readOnly","maxLength","cellSpacing","cellPadding","rowSpan","colSpan","useMap","frameBorder","contentEditable"],function(){ce.propFix[this.toLowerCase()]=this}),ce.fn.extend({addClass:function(t){var e,n,r,i,o,a;return v(t)?this.each(function(e){ce(this).addClass(t.call(this,e,Ct(this)))}):(e=kt(t)).length?this.each(function(){if(r=Ct(this),n=1===this.nodeType&&" "+Tt(r)+" "){for(o=0;o<e.length;o++)i=e[o],n.indexOf(" "+i+" ")<0&&(n+=i+" ");a=Tt(n),r!==a&&this.setAttribute("class",a)}}):this},removeClass:function(t){var e,n,r,i,o,a;return v(t)?this.each(function(e){ce(this).removeClass(t.call(this,e,Ct(this)))}):arguments.length?(e=kt(t)).length?this.each(function(){if(r=Ct(this),n=1===this.nodeType&&" "+Tt(r)+" "){for(o=0;o<e.length;o++){i=e[o];while(-1<n.indexOf(" "+i+" "))n=n.replace(" "+i+" "," ")}a=Tt(n),r!==a&&this.setAttribute("class",a)}}):this:this.attr("class","")},toggleClass:function(t,n){var e,r,i,o,a=typeof t,s="string"===a||Array.isArray(t);return v(t)?this.each(function(e){ce(this).toggleClass(t.call(this,e,Ct(this),n),n)}):"boolean"==typeof n&&s?n?this.addClass(t):this.removeClass(t):(e=kt(t),this.each(function(){if(s)for(o=ce(this),i=0;i<e.length;i++)r=e[i],o.hasClass(r)?o.removeClass(r):o.addClass(r);else void 0!==t&&"boolean"!==a||((r=Ct(this))&&_.set(this,"__className__",r),this.setAttribute&&this.setAttribute("class",r||!1===t?"":_.get(this,"__className__")||""))}))},hasClass:function(e){var t,n,r=0;t=" "+e+" ";while(n=this[r++])if(1===n.nodeType&&-1<(" "+Tt(Ct(n))+" ").indexOf(t))return!0;return!1}});var St=/\r/g;ce.fn.extend({val:function(n){var r,e,i,t=this[0];return arguments.length?(i=v(n),this.each(function(e){var t;1===this.nodeType&&(null==(t=i?n.call(this,e,ce(this).val()):n)?t="":"number"==typeof t?t+="":Array.isArray(t)&&(t=ce.map(t,function(e){return null==e?"":e+""})),(r=ce.valHooks[this.type]||ce.valHooks[this.nodeName.toLowerCase()])&&"set"in r&&void 0!==r.set(this,t,"value")||(this.value=t))})):t?(r=ce.valHooks[t.type]||ce.valHooks[t.nodeName.toLowerCase()])&&"get"in r&&void 0!==(e=r.get(t,"value"))?e:"string"==typeof(e=t.value)?e.replace(St,""):null==e?"":e:void 0}}),ce.extend({valHooks:{option:{get:function(e){var t=ce.find.attr(e,"value");return null!=t?t:Tt(ce.text(e))}},select:{get:function(e){var t,n,r,i=e.options,o=e.selectedIndex,a="select-one"===e.type,s=a?null:[],u=a?o+1:i.length;for(r=o<0?u:a?o:0;r<u;r++)if(((n=i[r]).selected||r===o)&&!n.disabled&&(!n.parentNode.disabled||!fe(n.parentNode,"optgroup"))){if(t=ce(n).val(),a)return t;s.push(t)}return s},set:function(e,t){var n,r,i=e.options,o=ce.makeArray(t),a=i.length;while(a--)((r=i[a]).selected=-1<ce.inArray(ce.valHooks.option.get(r),o))&&(n=!0);return n||(e.selectedIndex=-1),o}}}}),ce.each(["radio","checkbox"],function(){ce.valHooks[this]={set:function(e,t){if(Array.isArray(t))return e.checked=-1<ce.inArray(ce(e).val(),t)}},le.checkOn||(ce.valHooks[this].get=function(e){return null===e.getAttribute("value")?"on":e.value})});var Et=ie.location,jt={guid:Date.now()},At=/\?/;ce.parseXML=function(e){var t,n;if(!e||"string"!=typeof e)return null;try{t=(new ie.DOMParser).parseFromString(e,"text/xml")}catch(e){}return n=t&&t.getElementsByTagName("parsererror")[0],t&&!n||ce.error("Invalid XML: "+(n?ce.map(n.childNodes,function(e){return e.textContent}).join("\n"):e)),t};var Dt=/^(?:focusinfocus|focusoutblur)$/,Nt=function(e){e.stopPropagation()};ce.extend(ce.event,{trigger:function(e,t,n,r){var i,o,a,s,u,l,c,f,p=[n||C],d=ue.call(e,"type")?e.type:e,h=ue.call(e,"namespace")?e.namespace.split("."):[];if(o=f=a=n=n||C,3!==n.nodeType&&8!==n.nodeType&&!Dt.test(d+ce.event.triggered)&&(-1<d.indexOf(".")&&(d=(h=d.split(".")).shift(),h.sort()),u=d.indexOf(":")<0&&"on"+d,(e=e[ce.expando]?e:new ce.Event(d,"object"==typeof e&&e)).isTrigger=r?2:3,e.namespace=h.join("."),e.rnamespace=e.namespace?new RegExp("(^|\\.)"+h.join("\\.(?:.*\\.|)")+"(\\.|$)"):null,e.result=void 0,e.target||(e.target=n),t=null==t?[e]:ce.makeArray(t,[e]),c=ce.event.special[d]||{},r||!c.trigger||!1!==c.trigger.apply(n,t))){if(!r&&!c.noBubble&&!y(n)){for(s=c.delegateType||d,Dt.test(s+d)||(o=o.parentNode);o;o=o.parentNode)p.push(o),a=o;a===(n.ownerDocument||C)&&p.push(a.defaultView||a.parentWindow||ie)}i=0;while((o=p[i++])&&!e.isPropagationStopped())f=o,e.type=1<i?s:c.bindType||d,(l=(_.get(o,"events")||Object.create(null))[e.type]&&_.get(o,"handle"))&&l.apply(o,t),(l=u&&o[u])&&l.apply&&$(o)&&(e.result=l.apply(o,t),!1===e.result&&e.preventDefault());return e.type=d,r||e.isDefaultPrevented()||c._default&&!1!==c._default.apply(p.pop(),t)||!$(n)||u&&v(n[d])&&!y(n)&&((a=n[u])&&(n[u]=null),ce.event.triggered=d,e.isPropagationStopped()&&f.addEventListener(d,Nt),n[d](),e.isPropagationStopped()&&f.removeEventListener(d,Nt),ce.event.triggered=void 0,a&&(n[u]=a)),e.result}},simulate:function(e,t,n){var r=ce.extend(new ce.Event,n,{type:e,isSimulated:!0});ce.event.trigger(r,null,t)}}),ce.fn.extend({trigger:function(e,t){return this.each(function(){ce.event.trigger(e,t,this)})},triggerHandler:function(e,t){var n=this[0];if(n)return ce.event.trigger(e,t,n,!0)}});var qt=/\[\]$/,Lt=/\r?\n/g,Ht=/^(?:submit|button|image|reset|file)$/i,Ot=/^(?:input|select|textarea|keygen)/i;function Pt(n,e,r,i){var t;if(Array.isArray(e))ce.each(e,function(e,t){r||qt.test(n)?i(n,t):Pt(n+"["+("object"==typeof t&&null!=t?e:"")+"]",t,r,i)});else if(r||"object"!==x(e))i(n,e);else for(t in e)Pt(n+"["+t+"]",e[t],r,i)}ce.param=function(e,t){var n,r=[],i=function(e,t){var n=v(t)?t():t;r[r.length]=encodeURIComponent(e)+"="+encodeURIComponent(null==n?"":n)};if(null==e)return"";if(Array.isArray(e)||e.jquery&&!ce.isPlainObject(e))ce.each(e,function(){i(this.name,this.value)});else for(n in e)Pt(n,e[n],t,i);return r.join("&")},ce.fn.extend({serialize:function(){return ce.param(this.serializeArray())},serializeArray:function(){return this.map(function(){var e=ce.prop(this,"elements");return e?ce.makeArray(e):this}).filter(function(){var e=this.type;return this.name&&!ce(this).is(":disabled")&&Ot.test(this.nodeName)&&!Ht.test(e)&&(this.checked||!we.test(e))}).map(function(e,t){var n=ce(this).val();return null==n?null:Array.isArray(n)?ce.map(n,function(e){return{name:t.name,value:e.replace(Lt,"\r\n")}}):{name:t.name,value:n.replace(Lt,"\r\n")}}).get()}});var Mt=/%20/g,Rt=/#.*$/,It=/([?&])_=[^&]*/,Wt=/^(.*?):[ \t]*([^\r\n]*)$/gm,Ft=/^(?:GET|HEAD)$/,$t=/^\/\//,Bt={},_t={},zt="*/".concat("*"),Xt=C.createElement("a");function Ut(o){return function(e,t){"string"!=typeof e&&(t=e,e="*");var n,r=0,i=e.toLowerCase().match(D)||[];if(v(t))while(n=i[r++])"+"===n[0]?(n=n.slice(1)||"*",(o[n]=o[n]||[]).unshift(t)):(o[n]=o[n]||[]).push(t)}}function Vt(t,i,o,a){var s={},u=t===_t;function l(e){var r;return s[e]=!0,ce.each(t[e]||[],function(e,t){var n=t(i,o,a);return"string"!=typeof n||u||s[n]?u?!(r=n):void 0:(i.dataTypes.unshift(n),l(n),!1)}),r}return l(i.dataTypes[0])||!s["*"]&&l("*")}function Gt(e,t){var n,r,i=ce.ajaxSettings.flatOptions||{};for(n in t)void 0!==t[n]&&((i[n]?e:r||(r={}))[n]=t[n]);return r&&ce.extend(!0,e,r),e}Xt.href=Et.href,ce.extend({active:0,lastModified:{},etag:{},ajaxSettings:{url:Et.href,type:"GET",isLocal:/^(?:about|app|app-storage|.+-extension|file|res|widget):$/.test(Et.protocol),global:!0,processData:!0,async:!0,contentType:"application/x-www-form-urlencoded; charset=UTF-8",accepts:{"*":zt,text:"text/plain",html:"text/html",xml:"application/xml, text/xml",json:"application/json, text/javascript"},contents:{xml:/\bxml\b/,html:/\bhtml/,json:/\bjson\b/},responseFields:{xml:"responseXML",text:"responseText",json:"responseJSON"},converters:{"* text":String,"text html":!0,"text json":JSON.parse,"text xml":ce.parseXML},flatOptions:{url:!0,context:!0}},ajaxSetup:function(e,t){return t?Gt(Gt(e,ce.ajaxSettings),t):Gt(ce.ajaxSettings,e)},ajaxPrefilter:Ut(Bt),ajaxTransport:Ut(_t),ajax:function(e,t){"object"==typeof e&&(t=e,e=void 0),t=t||{};var c,f,p,n,d,r,h,g,i,o,v=ce.ajaxSetup({},t),y=v.context||v,m=v.context&&(y.nodeType||y.jquery)?ce(y):ce.event,x=ce.Deferred(),b=ce.Callbacks("once memory"),w=v.statusCode||{},a={},s={},u="canceled",T={readyState:0,getResponseHeader:function(e){var t;if(h){if(!n){n={};while(t=Wt.exec(p))n[t[1].toLowerCase()+" "]=(n[t[1].toLowerCase()+" "]||[]).concat(t[2])}t=n[e.toLowerCase()+" "]}return null==t?null:t.join(", ")},getAllResponseHeaders:function(){return h?p:null},setRequestHeader:function(e,t){return null==h&&(e=s[e.toLowerCase()]=s[e.toLowerCase()]||e,a[e]=t),this},overrideMimeType:function(e){return null==h&&(v.mimeType=e),this},statusCode:function(e){var t;if(e)if(h)T.always(e[T.status]);else for(t in e)w[t]=[w[t],e[t]];return this},abort:function(e){var t=e||u;return c&&c.abort(t),l(0,t),this}};if(x.promise(T),v.url=((e||v.url||Et.href)+"").replace($t,Et.protocol+"//"),v.type=t.method||t.type||v.method||v.type,v.dataTypes=(v.dataType||"*").toLowerCase().match(D)||[""],null==v.crossDomain){r=C.createElement("a");try{r.href=v.url,r.href=r.href,v.crossDomain=Xt.protocol+"//"+Xt.host!=r.protocol+"//"+r.host}catch(e){v.crossDomain=!0}}if(v.data&&v.processData&&"string"!=typeof v.data&&(v.data=ce.param(v.data,v.traditional)),Vt(Bt,v,t,T),h)return T;for(i in(g=ce.event&&v.global)&&0==ce.active++&&ce.event.trigger("ajaxStart"),v.type=v.type.toUpperCase(),v.hasContent=!Ft.test(v.type),f=v.url.replace(Rt,""),v.hasContent?v.data&&v.processData&&0===(v.contentType||"").indexOf("application/x-www-form-urlencoded")&&(v.data=v.data.replace(Mt,"+")):(o=v.url.slice(f.length),v.data&&(v.processData||"string"==typeof v.data)&&(f+=(At.test(f)?"&":"?")+v.data,delete v.data),!1===v.cache&&(f=f.replace(It,"$1"),o=(At.test(f)?"&":"?")+"_="+jt.guid+++o),v.url=f+o),v.ifModified&&(ce.lastModified[f]&&T.setRequestHeader("If-Modified-Since",ce.lastModified[f]),ce.etag[f]&&T.setRequestHeader("If-None-Match",ce.etag[f])),(v.data&&v.hasContent&&!1!==v.contentType||t.contentType)&&T.setRequestHeader("Content-Type",v.contentType),T.setRequestHeader("Accept",v.dataTypes[0]&&v.accepts[v.dataTypes[0]]?v.accepts[v.dataTypes[0]]+("*"!==v.dataTypes[0]?", "+zt+"; q=0.01":""):v.accepts["*"]),v.headers)T.setRequestHeader(i,v.headers[i]);if(v.beforeSend&&(!1===v.beforeSend.call(y,T,v)||h))return T.abort();if(u="abort",b.add(v.complete),T.done(v.success),T.fail(v.error),c=Vt(_t,v,t,T)){if(T.readyState=1,g&&m.trigger("ajaxSend",[T,v]),h)return T;v.async&&0<v.timeout&&(d=ie.setTimeout(function(){T.abort("timeout")},v.timeout));try{h=!1,c.send(a,l)}catch(e){if(h)throw e;l(-1,e)}}else l(-1,"No Transport");function l(e,t,n,r){var i,o,a,s,u,l=t;h||(h=!0,d&&ie.clearTimeout(d),c=void 0,p=r||"",T.readyState=0<e?4:0,i=200<=e&&e<300||304===e,n&&(s=function(e,t,n){var r,i,o,a,s=e.contents,u=e.dataTypes;while("*"===u[0])u.shift(),void 0===r&&(r=e.mimeType||t.getResponseHeader("Content-Type"));if(r)for(i in s)if(s[i]&&s[i].test(r)){u.unshift(i);break}if(u[0]in n)o=u[0];else{for(i in n){if(!u[0]||e.converters[i+" "+u[0]]){o=i;break}a||(a=i)}o=o||a}if(o)return o!==u[0]&&u.unshift(o),n[o]}(v,T,n)),!i&&-1<ce.inArray("script",v.dataTypes)&&ce.inArray("json",v.dataTypes)<0&&(v.converters["text script"]=function(){}),s=function(e,t,n,r){var i,o,a,s,u,l={},c=e.dataTypes.slice();if(c[1])for(a in e.converters)l[a.toLowerCase()]=e.converters[a];o=c.shift();while(o)if(e.responseFields[o]&&(n[e.responseFields[o]]=t),!u&&r&&e.dataFilter&&(t=e.dataFilter(t,e.dataType)),u=o,o=c.shift())if("*"===o)o=u;else if("*"!==u&&u!==o){if(!(a=l[u+" "+o]||l["* "+o]))for(i in l)if((s=i.split(" "))[1]===o&&(a=l[u+" "+s[0]]||l["* "+s[0]])){!0===a?a=l[i]:!0!==l[i]&&(o=s[0],c.unshift(s[1]));break}if(!0!==a)if(a&&e["throws"])t=a(t);else try{t=a(t)}catch(e){return{state:"parsererror",error:a?e:"No conversion from "+u+" to "+o}}}return{state:"success",data:t}}(v,s,T,i),i?(v.ifModified&&((u=T.getResponseHeader("Last-Modified"))&&(ce.lastModified[f]=u),(u=T.getResponseHeader("etag"))&&(ce.etag[f]=u)),204===e||"HEAD"===v.type?l="nocontent":304===e?l="notmodified":(l=s.state,o=s.data,i=!(a=s.error))):(a=l,!e&&l||(l="error",e<0&&(e=0))),T.status=e,T.statusText=(t||l)+"",i?x.resolveWith(y,[o,l,T]):x.rejectWith(y,[T,l,a]),T.statusCode(w),w=void 0,g&&m.trigger(i?"ajaxSuccess":"ajaxError",[T,v,i?o:a]),b.fireWith(y,[T,l]),g&&(m.trigger("ajaxComplete",[T,v]),--ce.active||ce.event.trigger("ajaxStop")))}return T},getJSON:function(e,t,n){return ce.get(e,t,n,"json")},getScript:function(e,t){return ce.get(e,void 0,t,"script")}}),ce.each(["get","post"],function(e,i){ce[i]=function(e,t,n,r){return v(t)&&(r=r||n,n=t,t=void 0),ce.ajax(ce.extend({url:e,type:i,dataType:r,data:t,success:n},ce.isPlainObject(e)&&e))}}),ce.ajaxPrefilter(function(e){var t;for(t in e.headers)"content-type"===t.toLowerCase()&&(e.contentType=e.headers[t]||"")}),ce._evalUrl=function(e,t,n){return ce.ajax({url:e,type:"GET",dataType:"script",cache:!0,async:!1,global:!1,converters:{"text script":function(){}},dataFilter:function(e){ce.globalEval(e,t,n)}})},ce.fn.extend({wrapAll:function(e){var t;return this[0]&&(v(e)&&(e=e.call(this[0])),t=ce(e,this[0].ownerDocument).eq(0).clone(!0),this[0].parentNode&&t.insertBefore(this[0]),t.map(function(){var e=this;while(e.firstElementChild)e=e.firstElementChild;return e}).append(this)),this},wrapInner:function(n){return v(n)?this.each(function(e){ce(this).wrapInner(n.call(this,e))}):this.each(function(){var e=ce(this),t=e.contents();t.length?t.wrapAll(n):e.append(n)})},wrap:function(t){var n=v(t);return this.each(function(e){ce(this).wrapAll(n?t.call(this,e):t)})},unwrap:function(e){return this.parent(e).not("body").each(function(){ce(this).replaceWith(this.childNodes)}),this}}),ce.expr.pseudos.hidden=function(e){return!ce.expr.pseudos.visible(e)},ce.expr.pseudos.visible=function(e){return!!(e.offsetWidth||e.offsetHeight||e.getClientRects().length)},ce.ajaxSettings.xhr=function(){try{return new ie.XMLHttpRequest}catch(e){}};var Yt={0:200,1223:204},Qt=ce.ajaxSettings.xhr();le.cors=!!Qt&&"withCredentials"in Qt,le.ajax=Qt=!!Qt,ce.ajaxTransport(function(i){var o,a;if(le.cors||Qt&&!i.crossDomain)return{send:function(e,t){var n,r=i.xhr();if(r.open(i.type,i.url,i.async,i.username,i.password),i.xhrFields)for(n in i.xhrFields)r[n]=i.xhrFields[n];for(n in i.mimeType&&r.overrideMimeType&&r.overrideMimeType(i.mimeType),i.crossDomain||e["X-Requested-With"]||(e["X-Requested-With"]="XMLHttpRequest"),e)r.setRequestHeader(n,e[n]);o=function(e){return function(){o&&(o=a=r.onload=r.onerror=r.onabort=r.ontimeout=r.onreadystatechange=null,"abort"===e?r.abort():"error"===e?"number"!=typeof r.status?t(0,"error"):t(r.status,r.statusText):t(Yt[r.status]||r.status,r.statusText,"text"!==(r.responseType||"text")||"string"!=typeof r.responseText?{binary:r.response}:{text:r.responseText},r.getAllResponseHeaders()))}},r.onload=o(),a=r.onerror=r.ontimeout=o("error"),void 0!==r.onabort?r.onabort=a:r.onreadystatechange=function(){4===r.readyState&&ie.setTimeout(function(){o&&a()})},o=o("abort");try{r.send(i.hasContent&&i.data||null)}catch(e){if(o)throw e}},abort:function(){o&&o()}}}),ce.ajaxPrefilter(function(e){e.crossDomain&&(e.contents.script=!1)}),ce.ajaxSetup({accepts:{script:"text/javascript, application/javascript, application/ecmascript, application/x-ecmascript"},contents:{script:/\b(?:java|ecma)script\b/},converters:{"text script":function(e){return ce.globalEval(e),e}}}),ce.ajaxPrefilter("script",function(e){void 0===e.cache&&(e.cache=!1),e.crossDomain&&(e.type="GET")}),ce.ajaxTransport("script",function(n){var r,i;if(n.crossDomain||n.scriptAttrs)return{send:function(e,t){r=ce("<script>").attr(n.scriptAttrs||{}).prop({charset:n.scriptCharset,src:n.url}).on("load error",i=function(e){r.remove(),i=null,e&&t("error"===e.type?404:200,e.type)}),C.head.appendChild(r[0])},abort:function(){i&&i()}}});var Jt,Kt=[],Zt=/(=)\?(?=&|$)|\?\?/;ce.ajaxSetup({jsonp:"callback",jsonpCallback:function(){var e=Kt.pop()||ce.expando+"_"+jt.guid++;return this[e]=!0,e}}),ce.ajaxPrefilter("json jsonp",function(e,t,n){var r,i,o,a=!1!==e.jsonp&&(Zt.test(e.url)?"url":"string"==typeof e.data&&0===(e.contentType||"").indexOf("application/x-www-form-urlencoded")&&Zt.test(e.data)&&"data");if(a||"jsonp"===e.dataTypes[0])return r=e.jsonpCallback=v(e.jsonpCallback)?e.jsonpCallback():e.jsonpCallback,a?e[a]=e[a].replace(Zt,"$1"+r):!1!==e.jsonp&&(e.url+=(At.test(e.url)?"&":"?")+e.jsonp+"="+r),e.converters["script json"]=function(){return o||ce.error(r+" was not called"),o[0]},e.dataTypes[0]="json",i=ie[r],ie[r]=function(){o=arguments},n.always(function(){void 0===i?ce(ie).removeProp(r):ie[r]=i,e[r]&&(e.jsonpCallback=t.jsonpCallback,Kt.push(r)),o&&v(i)&&i(o[0]),o=i=void 0}),"script"}),le.createHTMLDocument=((Jt=C.implementation.createHTMLDocument("").body).innerHTML="<form></form><form></form>",2===Jt.childNodes.length),ce.parseHTML=function(e,t,n){return"string"!=typeof e?[]:("boolean"==typeof t&&(n=t,t=!1),t||(le.createHTMLDocument?((r=(t=C.implementation.createHTMLDocument("")).createElement("base")).href=C.location.href,t.head.appendChild(r)):t=C),o=!n&&[],(i=w.exec(e))?[t.createElement(i[1])]:(i=Ae([e],t,o),o&&o.length&&ce(o).remove(),ce.merge([],i.childNodes)));var r,i,o},ce.fn.load=function(e,t,n){var r,i,o,a=this,s=e.indexOf(" ");return-1<s&&(r=Tt(e.slice(s)),e=e.slice(0,s)),v(t)?(n=t,t=void 0):t&&"object"==typeof t&&(i="POST"),0<a.length&&ce.ajax({url:e,type:i||"GET",dataType:"html",data:t}).done(function(e){o=arguments,a.html(r?ce("<div>").append(ce.parseHTML(e)).find(r):e)}).always(n&&function(e,t){a.each(function(){n.apply(this,o||[e.responseText,t,e])})}),this},ce.expr.pseudos.animated=function(t){return ce.grep(ce.timers,function(e){return t===e.elem}).length},ce.offset={setOffset:function(e,t,n){var r,i,o,a,s,u,l=ce.css(e,"position"),c=ce(e),f={};"static"===l&&(e.style.position="relative"),s=c.offset(),o=ce.css(e,"top"),u=ce.css(e,"left"),("absolute"===l||"fixed"===l)&&-1<(o+u).indexOf("auto")?(a=(r=c.position()).top,i=r.left):(a=parseFloat(o)||0,i=parseFloat(u)||0),v(t)&&(t=t.call(e,n,ce.extend({},s))),null!=t.top&&(f.top=t.top-s.top+a),null!=t.left&&(f.left=t.left-s.left+i),"using"in t?t.using.call(e,f):c.css(f)}},ce.fn.extend({offset:function(t){if(arguments.length)return void 0===t?this:this.each(function(e){ce.offset.setOffset(this,t,e)});var e,n,r=this[0];return r?r.getClientRects().length?(e=r.getBoundingClientRect(),n=r.ownerDocument.defaultView,{top:e.top+n.pageYOffset,left:e.left+n.pageXOffset}):{top:0,left:0}:void 0},position:function(){if(this[0]){var e,t,n,r=this[0],i={top:0,left:0};if("fixed"===ce.css(r,"position"))t=r.getBoundingClientRect();else{t=this.offset(),n=r.ownerDocument,e=r.offsetParent||n.documentElement;while(e&&(e===n.body||e===n.documentElement)&&"static"===ce.css(e,"position"))e=e.parentNode;e&&e!==r&&1===e.nodeType&&((i=ce(e).offset()).top+=ce.css(e,"borderTopWidth",!0),i.left+=ce.css(e,"borderLeftWidth",!0))}return{top:t.top-i.top-ce.css(r,"marginTop",!0),left:t.left-i.left-ce.css(r,"marginLeft",!0)}}},offsetParent:function(){return this.map(function(){var e=this.offsetParent;while(e&&"static"===ce.css(e,"position"))e=e.offsetParent;return e||J})}}),ce.each({scrollLeft:"pageXOffset",scrollTop:"pageYOffset"},function(t,i){var o="pageYOffset"===i;ce.fn[t]=function(e){return M(this,function(e,t,n){var r;if(y(e)?r=e:9===e.nodeType&&(r=e.defaultView),void 0===n)return r?r[i]:e[t];r?r.scrollTo(o?r.pageXOffset:n,o?n:r.pageYOffset):e[t]=n},t,e,arguments.length)}}),ce.each(["top","left"],function(e,n){ce.cssHooks[n]=Ye(le.pixelPosition,function(e,t){if(t)return t=Ge(e,n),_e.test(t)?ce(e).position()[n]+"px":t})}),ce.each({Height:"height",Width:"width"},function(a,s){ce.each({padding:"inner"+a,content:s,"":"outer"+a},function(r,o){ce.fn[o]=function(e,t){var n=arguments.length&&(r||"boolean"!=typeof e),i=r||(!0===e||!0===t?"margin":"border");return M(this,function(e,t,n){var r;return y(e)?0===o.indexOf("outer")?e["inner"+a]:e.document.documentElement["client"+a]:9===e.nodeType?(r=e.documentElement,Math.max(e.body["scroll"+a],r["scroll"+a],e.body["offset"+a],r["offset"+a],r["client"+a])):void 0===n?ce.css(e,t,i):ce.style(e,t,n,i)},s,n?e:void 0,n)}})}),ce.each(["ajaxStart","ajaxStop","ajaxComplete","ajaxError","ajaxSuccess","ajaxSend"],function(e,t){ce.fn[t]=function(e){return this.on(t,e)}}),ce.fn.extend({bind:function(e,t,n){return this.on(e,null,t,n)},unbind:function(e,t){return this.off(e,null,t)},delegate:function(e,t,n,r){return this.on(t,e,n,r)},undelegate:function(e,t,n){return 1===arguments.length?this.off(e,"**"):this.off(t,e||"**",n)},hover:function(e,t){return this.on("mouseenter",e).on("mouseleave",t||e)}}),ce.each("blur focus focusin focusout resize scroll click dblclick mousedown mouseup mousemove mouseover mouseout mouseenter mouseleave change select submit keydown keypress keyup contextmenu".split(" "),function(e,n){ce.fn[n]=function(e,t){return 0<arguments.length?this.on(n,null,e,t):this.trigger(n)}});var en=/^[\s\uFEFF\xA0]+|([^\s\uFEFF\xA0])[\s\uFEFF\xA0]+$/g;ce.proxy=function(e,t){var n,r,i;if("string"==typeof t&&(n=e[t],t=e,e=n),v(e))return r=ae.call(arguments,2),(i=function(){return e.apply(t||this,r.concat(ae.call(arguments)))}).guid=e.guid=e.guid||ce.guid++,i},ce.holdReady=function(e){e?ce.readyWait++:ce.ready(!0)},ce.isArray=Array.isArray,ce.parseJSON=JSON.parse,ce.nodeName=fe,ce.isFunction=v,ce.isWindow=y,ce.camelCase=F,ce.type=x,ce.now=Date.now,ce.isNumeric=function(e){var t=ce.type(e);return("number"===t||"string"===t)&&!isNaN(e-parseFloat(e))},ce.trim=function(e){return null==e?"":(e+"").replace(en,"$1")},"function"==typeof define&&define.amd&&define("jquery",[],function(){return ce});var tn=ie.jQuery,nn=ie.$;return ce.noConflict=function(e){return ie.$===ce&&(ie.$=nn),e&&ie.jQuery===ce&&(ie.jQuery=tn),ce},"undefined"==typeof e&&(ie.jQuery=ie.$=ce),ce});
diff --git a/src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclets/formats/html/resources/jquery/jquery-ui.css b/src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclets/formats/html/resources/jquery/jquery-ui.css
deleted file mode 100644
index 10e05917406..00000000000
--- a/src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclets/formats/html/resources/jquery/jquery-ui.css
+++ /dev/null
@@ -1,148 +0,0 @@
-/*! jQuery UI - v1.14.1 - 2025-01-13
-* https://jqueryui.com
-* Includes: core.css, autocomplete.css, menu.css
-* Copyright OpenJS Foundation and other contributors; Licensed MIT */
-
-/* Layout helpers
-----------------------------------*/
-.ui-helper-hidden {
-	display: none;
-}
-.ui-helper-hidden-accessible {
-	border: 0;
-	clip: rect(0 0 0 0);
-	height: 1px;
-	margin: -1px;
-	overflow: hidden;
-	padding: 0;
-	position: absolute;
-	width: 1px;
-}
-.ui-helper-reset {
-	margin: 0;
-	padding: 0;
-	border: 0;
-	outline: 0;
-	line-height: 1.3;
-	text-decoration: none;
-	font-size: 100%;
-	list-style: none;
-}
-.ui-helper-clearfix:before,
-.ui-helper-clearfix:after {
-	content: "";
-	display: table;
-	border-collapse: collapse;
-}
-.ui-helper-clearfix:after {
-	clear: both;
-}
-.ui-helper-zfix {
-	width: 100%;
-	height: 100%;
-	top: 0;
-	left: 0;
-	position: absolute;
-	opacity: 0;
-}
-
-.ui-front {
-	z-index: 100;
-}
-
-
-/* Interaction Cues
-----------------------------------*/
-.ui-state-disabled {
-	cursor: default !important;
-	pointer-events: none;
-}
-
-
-/* Icons
-----------------------------------*/
-.ui-icon {
-	display: inline-block;
-	vertical-align: middle;
-	margin-top: -.25em;
-	position: relative;
-	text-indent: -99999px;
-	overflow: hidden;
-	background-repeat: no-repeat;
-}
-
-.ui-widget-icon-block {
-	left: 50%;
-	margin-left: -8px;
-	display: block;
-}
-
-/* Misc visuals
-----------------------------------*/
-
-/* Overlays */
-.ui-widget-overlay {
-	position: fixed;
-	top: 0;
-	left: 0;
-	width: 100%;
-	height: 100%;
-}
-.ui-autocomplete {
-	position: absolute;
-	top: 0;
-	left: 0;
-	cursor: default;
-}
-.ui-menu {
-	list-style: none;
-	padding: 0;
-	margin: 0;
-	display: block;
-	outline: 0;
-}
-.ui-menu .ui-menu {
-	position: absolute;
-}
-.ui-menu .ui-menu-item {
-	margin: 0;
-	cursor: pointer;
-}
-.ui-menu .ui-menu-item-wrapper {
-	position: relative;
-	padding: 3px 1em 3px .4em;
-}
-.ui-menu .ui-menu-divider {
-	margin: 5px 0;
-	height: 0;
-	font-size: 0;
-	line-height: 0;
-	border-width: 1px 0 0 0;
-}
-.ui-menu .ui-state-focus,
-.ui-menu .ui-state-active {
-	margin: -1px;
-}
-
-/* icon support */
-.ui-menu-icons {
-	position: relative;
-}
-.ui-menu-icons .ui-menu-item-wrapper {
-	padding-left: 2em;
-}
-
-/* left-aligned */
-.ui-menu .ui-icon {
-	position: absolute;
-	top: 0;
-	bottom: 0;
-	left: .2em;
-	margin: auto 0;
-}
-
-/* right-aligned */
-.ui-menu .ui-menu-icon {
-	left: auto;
-	right: 0;
-}
diff --git a/src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclets/formats/html/resources/jquery/jquery-ui.js b/src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclets/formats/html/resources/jquery/jquery-ui.js
deleted file mode 100644
index b57de8a284c..00000000000
--- a/src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclets/formats/html/resources/jquery/jquery-ui.js
+++ /dev/null
@@ -1,2653 +0,0 @@
-/*! jQuery UI - v1.14.1 - 2025-01-13
-* https://jqueryui.com
-* Includes: widget.js, position.js, keycode.js, unique-id.js, widgets/autocomplete.js, widgets/menu.js
-* Copyright OpenJS Foundation and other contributors; Licensed MIT */
-
-( function( factory ) {
-	"use strict";
-
-	if ( typeof define === "function" && define.amd ) {
-
-		// AMD. Register as an anonymous module.
-		define( [ "jquery" ], factory );
-	} else {
-
-		// Browser globals
-		factory( jQuery );
-	}
-} )( function( $ ) {
-"use strict";
-
-$.ui = $.ui || {};
-
-var version = $.ui.version = "1.14.1";
-
-
-/*!
- * jQuery UI Widget 1.14.1
- * https://jqueryui.com
- *
- * Copyright OpenJS Foundation and other contributors
- * Released under the MIT license.
- * https://jquery.org/license
- */
-
-//>>label: Widget
-//>>group: Core
-//>>description: Provides a factory for creating stateful widgets with a common API.
-//>>docs: https://api.jqueryui.com/jQuery.widget/
-//>>demos: https://jqueryui.com/widget/
-
-
-var widgetUuid = 0;
-var widgetHasOwnProperty = Array.prototype.hasOwnProperty;
-var widgetSlice = Array.prototype.slice;
-
-$.cleanData = ( function( orig ) {
-	return function( elems ) {
-		var events, elem, i;
-		for ( i = 0; ( elem = elems[ i ] ) != null; i++ ) {
-
-			// Only trigger remove when necessary to save time
-			events = $._data( elem, "events" );
-			if ( events && events.remove ) {
-				$( elem ).triggerHandler( "remove" );
-			}
-		}
-		orig( elems );
-	};
-} )( $.cleanData );
-
-$.widget = function( name, base, prototype ) {
-	var existingConstructor, constructor, basePrototype;
-
-	// ProxiedPrototype allows the provided prototype to remain unmodified
-	// so that it can be used as a mixin for multiple widgets (#8876)
-	var proxiedPrototype = {};
-
-	var namespace = name.split( "." )[ 0 ];
-	name = name.split( "." )[ 1 ];
-	if ( name === "__proto__" || name === "constructor" ) {
-		return $.error( "Invalid widget name: " + name );
-	}
-	var fullName = namespace + "-" + name;
-
-	if ( !prototype ) {
-		prototype = base;
-		base = $.Widget;
-	}
-
-	if ( Array.isArray( prototype ) ) {
-		prototype = $.extend.apply( null, [ {} ].concat( prototype ) );
-	}
-
-	// Create selector for plugin
-	$.expr.pseudos[ fullName.toLowerCase() ] = function( elem ) {
-		return !!$.data( elem, fullName );
-	};
-
-	$[ namespace ] = $[ namespace ] || {};
-	existingConstructor = $[ namespace ][ name ];
-	constructor = $[ namespace ][ name ] = function( options, element ) {
-
-		// Allow instantiation without "new" keyword
-		if ( !this || !this._createWidget ) {
-			return new constructor( options, element );
-		}
-
-		// Allow instantiation without initializing for simple inheritance
-		// must use "new" keyword (the code above always passes args)
-		if ( arguments.length ) {
-			this._createWidget( options, element );
-		}
-	};
-
-	// Extend with the existing constructor to carry over any static properties
-	$.extend( constructor, existingConstructor, {
-		version: prototype.version,
-
-		// Copy the object used to create the prototype in case we need to
-		// redefine the widget later
-		_proto: $.extend( {}, prototype ),
-
-		// Track widgets that inherit from this widget in case this widget is
-		// redefined after a widget inherits from it
-		_childConstructors: []
-	} );
-
-	basePrototype = new base();
-
-	// We need to make the options hash a property directly on the new instance
-	// otherwise we'll modify the options hash on the prototype that we're
-	// inheriting from
-	basePrototype.options = $.widget.extend( {}, basePrototype.options );
-	$.each( prototype, function( prop, value ) {
-		if ( typeof value !== "function" ) {
-			proxiedPrototype[ prop ] = value;
-			return;
-		}
-		proxiedPrototype[ prop ] = ( function() {
-			function _super() {
-				return base.prototype[ prop ].apply( this, arguments );
-			}
-
-			function _superApply( args ) {
-				return base.prototype[ prop ].apply( this, args );
-			}
-
-			return function() {
-				var __super = this._super;
-				var __superApply = this._superApply;
-				var returnValue;
-
-				this._super = _super;
-				this._superApply = _superApply;
-
-				returnValue = value.apply( this, arguments );
-
-				this._super = __super;
-				this._superApply = __superApply;
-
-				return returnValue;
-			};
-		} )();
-	} );
-	constructor.prototype = $.widget.extend( basePrototype, {
-
-		// TODO: remove support for widgetEventPrefix
-		// always use the name + a colon as the prefix, e.g., draggable:start
-		// don't prefix for widgets that aren't DOM-based
-		widgetEventPrefix: existingConstructor ? ( basePrototype.widgetEventPrefix || name ) : name
-	}, proxiedPrototype, {
-		constructor: constructor,
-		namespace: namespace,
-		widgetName: name,
-		widgetFullName: fullName
-	} );
-
-	// If this widget is being redefined then we need to find all widgets that
-	// are inheriting from it and redefine all of them so that they inherit from
-	// the new version of this widget. We're essentially trying to replace one
-	// level in the prototype chain.
-	if ( existingConstructor ) {
-		$.each( existingConstructor._childConstructors, function( i, child ) {
-			var childPrototype = child.prototype;
-
-			// Redefine the child widget using the same prototype that was
-			// originally used, but inherit from the new version of the base
-			$.widget( childPrototype.namespace + "." + childPrototype.widgetName, constructor,
-				child._proto );
-		} );
-
-		// Remove the list of existing child constructors from the old constructor
-		// so the old child constructors can be garbage collected
-		delete existingConstructor._childConstructors;
-	} else {
-		base._childConstructors.push( constructor );
-	}
-
-	$.widget.bridge( name, constructor );
-
-	return constructor;
-};
-
-$.widget.extend = function( target ) {
-	var input = widgetSlice.call( arguments, 1 );
-	var inputIndex = 0;
-	var inputLength = input.length;
-	var key;
-	var value;
-
-	for ( ; inputIndex < inputLength; inputIndex++ ) {
-		for ( key in input[ inputIndex ] ) {
-			value = input[ inputIndex ][ key ];
-			if ( widgetHasOwnProperty.call( input[ inputIndex ], key ) && value !== undefined ) {
-
-				// Clone objects
-				if ( $.isPlainObject( value ) ) {
-					target[ key ] = $.isPlainObject( target[ key ] ) ?
-						$.widget.extend( {}, target[ key ], value ) :
-
-						// Don't extend strings, arrays, etc. with objects
-						$.widget.extend( {}, value );
-
-				// Copy everything else by reference
-				} else {
-					target[ key ] = value;
-				}
-			}
-		}
-	}
-	return target;
-};
-
-$.widget.bridge = function( name, object ) {
-	var fullName = object.prototype.widgetFullName || name;
-	$.fn[ name ] = function( options ) {
-		var isMethodCall = typeof options === "string";
-		var args = widgetSlice.call( arguments, 1 );
-		var returnValue = this;
-
-		if ( isMethodCall ) {
-
-			// If this is an empty collection, we need to have the instance method
-			// return undefined instead of the jQuery instance
-			if ( !this.length && options === "instance" ) {
-				returnValue = undefined;
-			} else {
-				this.each( function() {
-					var methodValue;
-					var instance = $.data( this, fullName );
-
-					if ( options === "instance" ) {
-						returnValue = instance;
-						return false;
-					}
-
-					if ( !instance ) {
-						return $.error( "cannot call methods on " + name +
-							" prior to initialization; " +
-							"attempted to call method '" + options + "'" );
-					}
-
-					if ( typeof instance[ options ] !== "function" ||
-						options.charAt( 0 ) === "_" ) {
-						return $.error( "no such method '" + options + "' for " + name +
-							" widget instance" );
-					}
-
-					methodValue = instance[ options ].apply( instance, args );
-
-					if ( methodValue !== instance && methodValue !== undefined ) {
-						returnValue = methodValue && methodValue.jquery ?
-							returnValue.pushStack( methodValue.get() ) :
-							methodValue;
-						return false;
-					}
-				} );
-			}
-		} else {
-
-			// Allow multiple hashes to be passed on init
-			if ( args.length ) {
-				options = $.widget.extend.apply( null, [ options ].concat( args ) );
-			}
-
-			this.each( function() {
-				var instance = $.data( this, fullName );
-				if ( instance ) {
-					instance.option( options || {} );
-					if ( instance._init ) {
-						instance._init();
-					}
-				} else {
-					$.data( this, fullName, new object( options, this ) );
-				}
-			} );
-		}
-
-		return returnValue;
-	};
-};
-
-$.Widget = function( /* options, element */ ) {};
-$.Widget._childConstructors = [];
-
-$.Widget.prototype = {
-	widgetName: "widget",
-	widgetEventPrefix: "",
-	defaultElement: "<div>",
-
-	options: {
-		classes: {},
-		disabled: false,
-
-		// Callbacks
-		create: null
-	},
-
-	_createWidget: function( options, element ) {
-		element = $( element || this.defaultElement || this )[ 0 ];
-		this.element = $( element );
-		this.uuid = widgetUuid++;
-		this.eventNamespace = "." + this.widgetName + this.uuid;
-
-		this.bindings = $();
-		this.hoverable = $();
-		this.focusable = $();
-		this.classesElementLookup = {};
-
-		if ( element !== this ) {
-			$.data( element, this.widgetFullName, this );
-			this._on( true, this.element, {
-				remove: function( event ) {
-					if ( event.target === element ) {
-						this.destroy();
-					}
-				}
-			} );
-			this.document = $( element.style ?
-
-				// Element within the document
-				element.ownerDocument :
-
-				// Element is window or document
-				element.document || element );
-			this.window = $( this.document[ 0 ].defaultView || this.document[ 0 ].parentWindow );
-		}
-
-		this.options = $.widget.extend( {},
-			this.options,
-			this._getCreateOptions(),
-			options );
-
-		this._create();
-
-		if ( this.options.disabled ) {
-			this._setOptionDisabled( this.options.disabled );
-		}
-
-		this._trigger( "create", null, this._getCreateEventData() );
-		this._init();
-	},
-
-	_getCreateOptions: function() {
-		return {};
-	},
-
-	_getCreateEventData: $.noop,
-
-	_create: $.noop,
-
-	_init: $.noop,
-
-	destroy: function() {
-		var that = this;
-
-		this._destroy();
-		$.each( this.classesElementLookup, function( key, value ) {
-			that._removeClass( value, key );
-		} );
-
-		// We can probably remove the unbind calls in 2.0
-		// all event bindings should go through this._on()
-		this.element
-			.off( this.eventNamespace )
-			.removeData( this.widgetFullName );
-		this.widget()
-			.off( this.eventNamespace )
-			.removeAttr( "aria-disabled" );
-
-		// Clean up events and states
-		this.bindings.off( this.eventNamespace );
-	},
-
-	_destroy: $.noop,
-
-	widget: function() {
-		return this.element;
-	},
-
-	option: function( key, value ) {
-		var options = key;
-		var parts;
-		var curOption;
-		var i;
-
-		if ( arguments.length === 0 ) {
-
-			// Don't return a reference to the internal hash
-			return $.widget.extend( {}, this.options );
-		}
-
-		if ( typeof key === "string" ) {
-
-			// Handle nested keys, e.g., "foo.bar" => { foo: { bar: ___ } }
-			options = {};
-			parts = key.split( "." );
-			key = parts.shift();
-			if ( parts.length ) {
-				curOption = options[ key ] = $.widget.extend( {}, this.options[ key ] );
-				for ( i = 0; i < parts.length - 1; i++ ) {
-					curOption[ parts[ i ] ] = curOption[ parts[ i ] ] || {};
-					curOption = curOption[ parts[ i ] ];
-				}
-				key = parts.pop();
-				if ( arguments.length === 1 ) {
-					return curOption[ key ] === undefined ? null : curOption[ key ];
-				}
-				curOption[ key ] = value;
-			} else {
-				if ( arguments.length === 1 ) {
-					return this.options[ key ] === undefined ? null : this.options[ key ];
-				}
-				options[ key ] = value;
-			}
-		}
-
-		this._setOptions( options );
-
-		return this;
-	},
-
-	_setOptions: function( options ) {
-		var key;
-
-		for ( key in options ) {
-			this._setOption( key, options[ key ] );
-		}
-
-		return this;
-	},
-
-	_setOption: function( key, value ) {
-		if ( key === "classes" ) {
-			this._setOptionClasses( value );
-		}
-
-		this.options[ key ] = value;
-
-		if ( key === "disabled" ) {
-			this._setOptionDisabled( value );
-		}
-
-		return this;
-	},
-
-	_setOptionClasses: function( value ) {
-		var classKey, elements, currentElements;
-
-		for ( classKey in value ) {
-			currentElements = this.classesElementLookup[ classKey ];
-			if ( value[ classKey ] === this.options.classes[ classKey ] ||
-					!currentElements ||
-					!currentElements.length ) {
-				continue;
-			}
-
-			// We are doing this to create a new jQuery object because the _removeClass() call
-			// on the next line is going to destroy the reference to the current elements being
-			// tracked. We need to save a copy of this collection so that we can add the new classes
-			// below.
-			elements = $( currentElements.get() );
-			this._removeClass( currentElements, classKey );
-
-			// We don't use _addClass() here, because that uses this.options.classes
-			// for generating the string of classes. We want to use the value passed in from
-			// _setOption(), this is the new value of the classes option which was passed to
-			// _setOption(). We pass this value directly to _classes().
-			elements.addClass( this._classes( {
-				element: elements,
-				keys: classKey,
-				classes: value,
-				add: true
-			} ) );
-		}
-	},
-
-	_setOptionDisabled: function( value ) {
-		this._toggleClass( this.widget(), this.widgetFullName + "-disabled", null, !!value );
-
-		// If the widget is becoming disabled, then nothing is interactive
-		if ( value ) {
-			this._removeClass( this.hoverable, null, "ui-state-hover" );
-			this._removeClass( this.focusable, null, "ui-state-focus" );
-		}
-	},
-
-	enable: function() {
-		return this._setOptions( { disabled: false } );
-	},
-
-	disable: function() {
-		return this._setOptions( { disabled: true } );
-	},
-
-	_classes: function( options ) {
-		var full = [];
-		var that = this;
-
-		options = $.extend( {
-			element: this.element,
-			classes: this.options.classes || {}
-		}, options );
-
-		function bindRemoveEvent() {
-			var nodesToBind = [];
-
-			options.element.each( function( _, element ) {
-				var isTracked = $.map( that.classesElementLookup, function( elements ) {
-					return elements;
-				} )
-					.some( function( elements ) {
-						return elements.is( element );
-					} );
-
-				if ( !isTracked ) {
-					nodesToBind.push( element );
-				}
-			} );
-
-			that._on( $( nodesToBind ), {
-				remove: "_untrackClassesElement"
-			} );
-		}
-
-		function processClassString( classes, checkOption ) {
-			var current, i;
-			for ( i = 0; i < classes.length; i++ ) {
-				current = that.classesElementLookup[ classes[ i ] ] || $();
-				if ( options.add ) {
-					bindRemoveEvent();
-					current = $( $.uniqueSort( current.get().concat( options.element.get() ) ) );
-				} else {
-					current = $( current.not( options.element ).get() );
-				}
-				that.classesElementLookup[ classes[ i ] ] = current;
-				full.push( classes[ i ] );
-				if ( checkOption && options.classes[ classes[ i ] ] ) {
-					full.push( options.classes[ classes[ i ] ] );
-				}
-			}
-		}
-
-		if ( options.keys ) {
-			processClassString( options.keys.match( /\S+/g ) || [], true );
-		}
-		if ( options.extra ) {
-			processClassString( options.extra.match( /\S+/g ) || [] );
-		}
-
-		return full.join( " " );
-	},
-
-	_untrackClassesElement: function( event ) {
-		var that = this;
-		$.each( that.classesElementLookup, function( key, value ) {
-			if ( $.inArray( event.target, value ) !== -1 ) {
-				that.classesElementLookup[ key ] = $( value.not( event.target ).get() );
-			}
-		} );
-
-		this._off( $( event.target ) );
-	},
-
-	_removeClass: function( element, keys, extra ) {
-		return this._toggleClass( element, keys, extra, false );
-	},
-
-	_addClass: function( element, keys, extra ) {
-		return this._toggleClass( element, keys, extra, true );
-	},
-
-	_toggleClass: function( element, keys, extra, add ) {
-		add = ( typeof add === "boolean" ) ? add : extra;
-		var shift = ( typeof element === "string" || element === null ),
-			options = {
-				extra: shift ? keys : extra,
-				keys: shift ? element : keys,
-				element: shift ? this.element : element,
-				add: add
-			};
-		options.element.toggleClass( this._classes( options ), add );
-		return this;
-	},
-
-	_on: function( suppressDisabledCheck, element, handlers ) {
-		var delegateElement;
-		var instance = this;
-
-		// No suppressDisabledCheck flag, shuffle arguments
-		if ( typeof suppressDisabledCheck !== "boolean" ) {
-			handlers = element;
-			element = suppressDisabledCheck;
-			suppressDisabledCheck = false;
-		}
-
-		// No element argument, shuffle and use this.element
-		if ( !handlers ) {
-			handlers = element;
-			element = this.element;
-			delegateElement = this.widget();
-		} else {
-			element = delegateElement = $( element );
-			this.bindings = this.bindings.add( element );
-		}
-
-		$.each( handlers, function( event, handler ) {
-			function handlerProxy() {
-
-				// Allow widgets to customize the disabled handling
-				// - disabled as an array instead of boolean
-				// - disabled class as method for disabling individual parts
-				if ( !suppressDisabledCheck &&
-						( instance.options.disabled === true ||
-						$( this ).hasClass( "ui-state-disabled" ) ) ) {
-					return;
-				}
-				return ( typeof handler === "string" ? instance[ handler ] : handler )
-					.apply( instance, arguments );
-			}
-
-			// Copy the guid so direct unbinding works
-			if ( typeof handler !== "string" ) {
-				handlerProxy.guid = handler.guid =
-					handler.guid || handlerProxy.guid || $.guid++;
-			}
-
-			var match = event.match( /^([\w:-]*)\s*(.*)$/ );
-			var eventName = match[ 1 ] + instance.eventNamespace;
-			var selector = match[ 2 ];
-
-			if ( selector ) {
-				delegateElement.on( eventName, selector, handlerProxy );
-			} else {
-				element.on( eventName, handlerProxy );
-			}
-		} );
-	},
-
-	_off: function( element, eventName ) {
-		eventName = ( eventName || "" ).split( " " ).join( this.eventNamespace + " " ) +
-			this.eventNamespace;
-		element.off( eventName );
-
-		// Clear the stack to avoid memory leaks (#10056)
-		this.bindings = $( this.bindings.not( element ).get() );
-		this.focusable = $( this.focusable.not( element ).get() );
-		this.hoverable = $( this.hoverable.not( element ).get() );
-	},
-
-	_delay: function( handler, delay ) {
-		function handlerProxy() {
-			return ( typeof handler === "string" ? instance[ handler ] : handler )
-				.apply( instance, arguments );
-		}
-		var instance = this;
-		return setTimeout( handlerProxy, delay || 0 );
-	},
-
-	_hoverable: function( element ) {
-		this.hoverable = this.hoverable.add( element );
-		this._on( element, {
-			mouseenter: function( event ) {
-				this._addClass( $( event.currentTarget ), null, "ui-state-hover" );
-			},
-			mouseleave: function( event ) {
-				this._removeClass( $( event.currentTarget ), null, "ui-state-hover" );
-			}
-		} );
-	},
-
-	_focusable: function( element ) {
-		this.focusable = this.focusable.add( element );
-		this._on( element, {
-			focusin: function( event ) {
-				this._addClass( $( event.currentTarget ), null, "ui-state-focus" );
-			},
-			focusout: function( event ) {
-				this._removeClass( $( event.currentTarget ), null, "ui-state-focus" );
-			}
-		} );
-	},
-
-	_trigger: function( type, event, data ) {
-		var prop, orig;
-		var callback = this.options[ type ];
-
-		data = data || {};
-		event = $.Event( event );
-		event.type = ( type === this.widgetEventPrefix ?
-			type :
-			this.widgetEventPrefix + type ).toLowerCase();
-
-		// The original event may come from any element
-		// so we need to reset the target on the new event
-		event.target = this.element[ 0 ];
-
-		// Copy original event properties over to the new event
-		orig = event.originalEvent;
-		if ( orig ) {
-			for ( prop in orig ) {
-				if ( !( prop in event ) ) {
-					event[ prop ] = orig[ prop ];
-				}
-			}
-		}
-
-		this.element.trigger( event, data );
-		return !( typeof callback === "function" &&
-			callback.apply( this.element[ 0 ], [ event ].concat( data ) ) === false ||
-			event.isDefaultPrevented() );
-	}
-};
-
-$.each( { show: "fadeIn", hide: "fadeOut" }, function( method, defaultEffect ) {
-	$.Widget.prototype[ "_" + method ] = function( element, options, callback ) {
-		if ( typeof options === "string" ) {
-			options = { effect: options };
-		}
-
-		var hasOptions;
-		var effectName = !options ?
-			method :
-			options === true || typeof options === "number" ?
-				defaultEffect :
-				options.effect || defaultEffect;
-
-		options = options || {};
-		if ( typeof options === "number" ) {
-			options = { duration: options };
-		} else if ( options === true ) {
-			options = {};
-		}
-
-		hasOptions = !$.isEmptyObject( options );
-		options.complete = callback;
-
-		if ( options.delay ) {
-			element.delay( options.delay );
-		}
-
-		if ( hasOptions && $.effects && $.effects.effect[ effectName ] ) {
-			element[ method ]( options );
-		} else if ( effectName !== method && element[ effectName ] ) {
-			element[ effectName ]( options.duration, options.easing, callback );
-		} else {
-			element.queue( function( next ) {
-				$( this )[ method ]();
-				if ( callback ) {
-					callback.call( element[ 0 ] );
-				}
-				next();
-			} );
-		}
-	};
-} );
-
-var widget = $.widget;
-
-
-/*!
- * jQuery UI Position 1.14.1
- * https://jqueryui.com
- *
- * Copyright OpenJS Foundation and other contributors
- * Released under the MIT license.
- * https://jquery.org/license
- *
- * https://api.jqueryui.com/position/
- */
-
-//>>label: Position
-//>>group: Core
-//>>description: Positions elements relative to other elements.
-//>>docs: https://api.jqueryui.com/position/
-//>>demos: https://jqueryui.com/position/
-
-
-( function() {
-var cachedScrollbarWidth,
-	max = Math.max,
-	abs = Math.abs,
-	rhorizontal = /left|center|right/,
-	rvertical = /top|center|bottom/,
-	roffset = /[\+\-]\d+(\.[\d]+)?%?/,
-	rposition = /^\w+/,
-	rpercent = /%$/,
-	_position = $.fn.position;
-
-function getOffsets( offsets, width, height ) {
-	return [
-		parseFloat( offsets[ 0 ] ) * ( rpercent.test( offsets[ 0 ] ) ? width / 100 : 1 ),
-		parseFloat( offsets[ 1 ] ) * ( rpercent.test( offsets[ 1 ] ) ? height / 100 : 1 )
-	];
-}
-
-function parseCss( element, property ) {
-	return parseInt( $.css( element, property ), 10 ) || 0;
-}
-
-function isWindow( obj ) {
-	return obj != null && obj === obj.window;
-}
-
-function getDimensions( elem ) {
-	var raw = elem[ 0 ];
-	if ( raw.nodeType === 9 ) {
-		return {
-			width: elem.width(),
-			height: elem.height(),
-			offset: { top: 0, left: 0 }
-		};
-	}
-	if ( isWindow( raw ) ) {
-		return {
-			width: elem.width(),
-			height: elem.height(),
-			offset: { top: elem.scrollTop(), left: elem.scrollLeft() }
-		};
-	}
-	if ( raw.preventDefault ) {
-		return {
-			width: 0,
-			height: 0,
-			offset: { top: raw.pageY, left: raw.pageX }
-		};
-	}
-	return {
-		width: elem.outerWidth(),
-		height: elem.outerHeight(),
-		offset: elem.offset()
-	};
-}
-
-$.position = {
-	scrollbarWidth: function() {
-		if ( cachedScrollbarWidth !== undefined ) {
-			return cachedScrollbarWidth;
-		}
-		var w1, w2,
-			div = $( "<div style=" +
-				"'display:block;position:absolute;width:200px;height:200px;overflow:hidden;'>" +
-				"<div style='height:300px;width:auto;'></div></div>" ),
-			innerDiv = div.children()[ 0 ];
-
-		$( "body" ).append( div );
-		w1 = innerDiv.offsetWidth;
-		div.css( "overflow", "scroll" );
-
-		w2 = innerDiv.offsetWidth;
-
-		if ( w1 === w2 ) {
-			w2 = div[ 0 ].clientWidth;
-		}
-
-		div.remove();
-
-		return ( cachedScrollbarWidth = w1 - w2 );
-	},
-	getScrollInfo: function( within ) {
-		var overflowX = within.isWindow || within.isDocument ? "" :
-				within.element.css( "overflow-x" ),
-			overflowY = within.isWindow || within.isDocument ? "" :
-				within.element.css( "overflow-y" ),
-			hasOverflowX = overflowX === "scroll" ||
-				( overflowX === "auto" && within.width < within.element[ 0 ].scrollWidth ),
-			hasOverflowY = overflowY === "scroll" ||
-				( overflowY === "auto" && within.height < within.element[ 0 ].scrollHeight );
-		return {
-			width: hasOverflowY ? $.position.scrollbarWidth() : 0,
-			height: hasOverflowX ? $.position.scrollbarWidth() : 0
-		};
-	},
-	getWithinInfo: function( element ) {
-		var withinElement = $( element || window ),
-			isElemWindow = isWindow( withinElement[ 0 ] ),
-			isDocument = !!withinElement[ 0 ] && withinElement[ 0 ].nodeType === 9,
-			hasOffset = !isElemWindow && !isDocument;
-		return {
-			element: withinElement,
-			isWindow: isElemWindow,
-			isDocument: isDocument,
-			offset: hasOffset ? $( element ).offset() : { left: 0, top: 0 },
-			scrollLeft: withinElement.scrollLeft(),
-			scrollTop: withinElement.scrollTop(),
-			width: withinElement.outerWidth(),
-			height: withinElement.outerHeight()
-		};
-	}
-};
-
-$.fn.position = function( options ) {
-	if ( !options || !options.of ) {
-		return _position.apply( this, arguments );
-	}
-
-	// Make a copy, we don't want to modify arguments
-	options = $.extend( {}, options );
-
-	var atOffset, targetWidth, targetHeight, targetOffset, basePosition, dimensions,
-
-		// Make sure string options are treated as CSS selectors
-		target = typeof options.of === "string" ?
-			$( document ).find( options.of ) :
-			$( options.of ),
-
-		within = $.position.getWithinInfo( options.within ),
-		scrollInfo = $.position.getScrollInfo( within ),
-		collision = ( options.collision || "flip" ).split( " " ),
-		offsets = {};
-
-	dimensions = getDimensions( target );
-	if ( target[ 0 ].preventDefault ) {
-
-		// Force left top to allow flipping
-		options.at = "left top";
-	}
-	targetWidth = dimensions.width;
-	targetHeight = dimensions.height;
-	targetOffset = dimensions.offset;
-
-	// Clone to reuse original targetOffset later
-	basePosition = $.extend( {}, targetOffset );
-
-	// Force my and at to have valid horizontal and vertical positions
-	// if a value is missing or invalid, it will be converted to center
-	$.each( [ "my", "at" ], function() {
-		var pos = ( options[ this ] || "" ).split( " " ),
-			horizontalOffset,
-			verticalOffset;
-
-		if ( pos.length === 1 ) {
-			pos = rhorizontal.test( pos[ 0 ] ) ?
-				pos.concat( [ "center" ] ) :
-				rvertical.test( pos[ 0 ] ) ?
-					[ "center" ].concat( pos ) :
-					[ "center", "center" ];
-		}
-		pos[ 0 ] = rhorizontal.test( pos[ 0 ] ) ? pos[ 0 ] : "center";
-		pos[ 1 ] = rvertical.test( pos[ 1 ] ) ? pos[ 1 ] : "center";
-
-		// Calculate offsets
-		horizontalOffset = roffset.exec( pos[ 0 ] );
-		verticalOffset = roffset.exec( pos[ 1 ] );
-		offsets[ this ] = [
-			horizontalOffset ? horizontalOffset[ 0 ] : 0,
-			verticalOffset ? verticalOffset[ 0 ] : 0
-		];
-
-		// Reduce to just the positions without the offsets
-		options[ this ] = [
-			rposition.exec( pos[ 0 ] )[ 0 ],
-			rposition.exec( pos[ 1 ] )[ 0 ]
-		];
-	} );
-
-	// Normalize collision option
-	if ( collision.length === 1 ) {
-		collision[ 1 ] = collision[ 0 ];
-	}
-
-	if ( options.at[ 0 ] === "right" ) {
-		basePosition.left += targetWidth;
-	} else if ( options.at[ 0 ] === "center" ) {
-		basePosition.left += targetWidth / 2;
-	}
-
-	if ( options.at[ 1 ] === "bottom" ) {
-		basePosition.top += targetHeight;
-	} else if ( options.at[ 1 ] === "center" ) {
-		basePosition.top += targetHeight / 2;
-	}
-
-	atOffset = getOffsets( offsets.at, targetWidth, targetHeight );
-	basePosition.left += atOffset[ 0 ];
-	basePosition.top += atOffset[ 1 ];
-
-	return this.each( function() {
-		var collisionPosition, using,
-			elem = $( this ),
-			elemWidth = elem.outerWidth(),
-			elemHeight = elem.outerHeight(),
-			marginLeft = parseCss( this, "marginLeft" ),
-			marginTop = parseCss( this, "marginTop" ),
-			collisionWidth = elemWidth + marginLeft + parseCss( this, "marginRight" ) +
-				scrollInfo.width,
-			collisionHeight = elemHeight + marginTop + parseCss( this, "marginBottom" ) +
-				scrollInfo.height,
-			position = $.extend( {}, basePosition ),
-			myOffset = getOffsets( offsets.my, elem.outerWidth(), elem.outerHeight() );
-
-		if ( options.my[ 0 ] === "right" ) {
-			position.left -= elemWidth;
-		} else if ( options.my[ 0 ] === "center" ) {
-			position.left -= elemWidth / 2;
-		}
-
-		if ( options.my[ 1 ] === "bottom" ) {
-			position.top -= elemHeight;
-		} else if ( options.my[ 1 ] === "center" ) {
-			position.top -= elemHeight / 2;
-		}
-
-		position.left += myOffset[ 0 ];
-		position.top += myOffset[ 1 ];
-
-		collisionPosition = {
-			marginLeft: marginLeft,
-			marginTop: marginTop
-		};
-
-		$.each( [ "left", "top" ], function( i, dir ) {
-			if ( $.ui.position[ collision[ i ] ] ) {
-				$.ui.position[ collision[ i ] ][ dir ]( position, {
-					targetWidth: targetWidth,
-					targetHeight: targetHeight,
-					elemWidth: elemWidth,
-					elemHeight: elemHeight,
-					collisionPosition: collisionPosition,
-					collisionWidth: collisionWidth,
-					collisionHeight: collisionHeight,
-					offset: [ atOffset[ 0 ] + myOffset[ 0 ], atOffset [ 1 ] + myOffset[ 1 ] ],
-					my: options.my,
-					at: options.at,
-					within: within,
-					elem: elem
-				} );
-			}
-		} );
-
-		if ( options.using ) {
-
-			// Adds feedback as second argument to using callback, if present
-			using = function( props ) {
-				var left = targetOffset.left - position.left,
-					right = left + targetWidth - elemWidth,
-					top = targetOffset.top - position.top,
-					bottom = top + targetHeight - elemHeight,
-					feedback = {
-						target: {
-							element: target,
-							left: targetOffset.left,
-							top: targetOffset.top,
-							width: targetWidth,
-							height: targetHeight
-						},
-						element: {
-							element: elem,
-							left: position.left,
-							top: position.top,
-							width: elemWidth,
-							height: elemHeight
-						},
-						horizontal: right < 0 ? "left" : left > 0 ? "right" : "center",
-						vertical: bottom < 0 ? "top" : top > 0 ? "bottom" : "middle"
-					};
-				if ( targetWidth < elemWidth && abs( left + right ) < targetWidth ) {
-					feedback.horizontal = "center";
-				}
-				if ( targetHeight < elemHeight && abs( top + bottom ) < targetHeight ) {
-					feedback.vertical = "middle";
-				}
-				if ( max( abs( left ), abs( right ) ) > max( abs( top ), abs( bottom ) ) ) {
-					feedback.important = "horizontal";
-				} else {
-					feedback.important = "vertical";
-				}
-				options.using.call( this, props, feedback );
-			};
-		}
-
-		elem.offset( $.extend( position, { using: using } ) );
-	} );
-};
-
-$.ui.position = {
-	fit: {
-		left: function( position, data ) {
-			var within = data.within,
-				withinOffset = within.isWindow ? within.scrollLeft : within.offset.left,
-				outerWidth = within.width,
-				collisionPosLeft = position.left - data.collisionPosition.marginLeft,
-				overLeft = withinOffset - collisionPosLeft,
-				overRight = collisionPosLeft + data.collisionWidth - outerWidth - withinOffset,
-				newOverRight;
-
-			// Element is wider than within
-			if ( data.collisionWidth > outerWidth ) {
-
-				// Element is initially over the left side of within
-				if ( overLeft > 0 && overRight <= 0 ) {
-					newOverRight = position.left + overLeft + data.collisionWidth - outerWidth -
-						withinOffset;
-					position.left += overLeft - newOverRight;
-
-				// Element is initially over right side of within
-				} else if ( overRight > 0 && overLeft <= 0 ) {
-					position.left = withinOffset;
-
-				// Element is initially over both left and right sides of within
-				} else {
-					if ( overLeft > overRight ) {
-						position.left = withinOffset + outerWidth - data.collisionWidth;
-					} else {
-						position.left = withinOffset;
-					}
-				}
-
-			// Too far left -> align with left edge
-			} else if ( overLeft > 0 ) {
-				position.left += overLeft;
-
-			// Too far right -> align with right edge
-			} else if ( overRight > 0 ) {
-				position.left -= overRight;
-
-			// Adjust based on position and margin
-			} else {
-				position.left = max( position.left - collisionPosLeft, position.left );
-			}
-		},
-		top: function( position, data ) {
-			var within = data.within,
-				withinOffset = within.isWindow ? within.scrollTop : within.offset.top,
-				outerHeight = data.within.height,
-				collisionPosTop = position.top - data.collisionPosition.marginTop,
-				overTop = withinOffset - collisionPosTop,
-				overBottom = collisionPosTop + data.collisionHeight - outerHeight - withinOffset,
-				newOverBottom;
-
-			// Element is taller than within
-			if ( data.collisionHeight > outerHeight ) {
-
-				// Element is initially over the top of within
-				if ( overTop > 0 && overBottom <= 0 ) {
-					newOverBottom = position.top + overTop + data.collisionHeight - outerHeight -
-						withinOffset;
-					position.top += overTop - newOverBottom;
-
-				// Element is initially over bottom of within
-				} else if ( overBottom > 0 && overTop <= 0 ) {
-					position.top = withinOffset;
-
-				// Element is initially over both top and bottom of within
-				} else {
-					if ( overTop > overBottom ) {
-						position.top = withinOffset + outerHeight - data.collisionHeight;
-					} else {
-						position.top = withinOffset;
-					}
-				}
-
-			// Too far up -> align with top
-			} else if ( overTop > 0 ) {
-				position.top += overTop;
-
-			// Too far down -> align with bottom edge
-			} else if ( overBottom > 0 ) {
-				position.top -= overBottom;
-
-			// Adjust based on position and margin
-			} else {
-				position.top = max( position.top - collisionPosTop, position.top );
-			}
-		}
-	},
-	flip: {
-		left: function( position, data ) {
-			var within = data.within,
-				withinOffset = within.offset.left + within.scrollLeft,
-				outerWidth = within.width,
-				offsetLeft = within.isWindow ? within.scrollLeft : within.offset.left,
-				collisionPosLeft = position.left - data.collisionPosition.marginLeft,
-				overLeft = collisionPosLeft - offsetLeft,
-				overRight = collisionPosLeft + data.collisionWidth - outerWidth - offsetLeft,
-				myOffset = data.my[ 0 ] === "left" ?
-					-data.elemWidth :
-					data.my[ 0 ] === "right" ?
-						data.elemWidth :
-						0,
-				atOffset = data.at[ 0 ] === "left" ?
-					data.targetWidth :
-					data.at[ 0 ] === "right" ?
-						-data.targetWidth :
-						0,
-				offset = -2 * data.offset[ 0 ],
-				newOverRight,
-				newOverLeft;
-
-			if ( overLeft < 0 ) {
-				newOverRight = position.left + myOffset + atOffset + offset + data.collisionWidth -
-					outerWidth - withinOffset;
-				if ( newOverRight < 0 || newOverRight < abs( overLeft ) ) {
-					position.left += myOffset + atOffset + offset;
-				}
-			} else if ( overRight > 0 ) {
-				newOverLeft = position.left - data.collisionPosition.marginLeft + myOffset +
-					atOffset + offset - offsetLeft;
-				if ( newOverLeft > 0 || abs( newOverLeft ) < overRight ) {
-					position.left += myOffset + atOffset + offset;
-				}
-			}
-		},
-		top: function( position, data ) {
-			var within = data.within,
-				withinOffset = within.offset.top + within.scrollTop,
-				outerHeight = within.height,
-				offsetTop = within.isWindow ? within.scrollTop : within.offset.top,
-				collisionPosTop = position.top - data.collisionPosition.marginTop,
-				overTop = collisionPosTop - offsetTop,
-				overBottom = collisionPosTop + data.collisionHeight - outerHeight - offsetTop,
-				top = data.my[ 1 ] === "top",
-				myOffset = top ?
-					-data.elemHeight :
-					data.my[ 1 ] === "bottom" ?
-						data.elemHeight :
-						0,
-				atOffset = data.at[ 1 ] === "top" ?
-					data.targetHeight :
-					data.at[ 1 ] === "bottom" ?
-						-data.targetHeight :
-						0,
-				offset = -2 * data.offset[ 1 ],
-				newOverTop,
-				newOverBottom;
-			if ( overTop < 0 ) {
-				newOverBottom = position.top + myOffset + atOffset + offset + data.collisionHeight -
-					outerHeight - withinOffset;
-				if ( newOverBottom < 0 || newOverBottom < abs( overTop ) ) {
-					position.top += myOffset + atOffset + offset;
-				}
-			} else if ( overBottom > 0 ) {
-				newOverTop = position.top - data.collisionPosition.marginTop + myOffset + atOffset +
-					offset - offsetTop;
-				if ( newOverTop > 0 || abs( newOverTop ) < overBottom ) {
-					position.top += myOffset + atOffset + offset;
-				}
-			}
-		}
-	},
-	flipfit: {
-		left: function() {
-			$.ui.position.flip.left.apply( this, arguments );
-			$.ui.position.fit.left.apply( this, arguments );
-		},
-		top: function() {
-			$.ui.position.flip.top.apply( this, arguments );
-			$.ui.position.fit.top.apply( this, arguments );
-		}
-	}
-};
-
-} )();
-
-var position = $.ui.position;
-
-
-/*!
- * jQuery UI Keycode 1.14.1
- * https://jqueryui.com
- *
- * Copyright OpenJS Foundation and other contributors
- * Released under the MIT license.
- * https://jquery.org/license
- */
-
-//>>label: Keycode
-//>>group: Core
-//>>description: Provide keycodes as keynames
-//>>docs: https://api.jqueryui.com/jQuery.ui.keyCode/
-
-
-var keycode = $.ui.keyCode = {
-	BACKSPACE: 8,
-	COMMA: 188,
-	DELETE: 46,
-	DOWN: 40,
-	END: 35,
-	ENTER: 13,
-	ESCAPE: 27,
-	HOME: 36,
-	LEFT: 37,
-	PAGE_DOWN: 34,
-	PAGE_UP: 33,
-	PERIOD: 190,
-	RIGHT: 39,
-	SPACE: 32,
-	TAB: 9,
-	UP: 38
-};
-
-
-/*!
- * jQuery UI Unique ID 1.14.1
- * https://jqueryui.com
- *
- * Copyright OpenJS Foundation and other contributors
- * Released under the MIT license.
- * https://jquery.org/license
- */
-
-//>>label: uniqueId
-//>>group: Core
-//>>description: Functions to generate and remove uniqueId's
-//>>docs: https://api.jqueryui.com/uniqueId/
-
-
-var uniqueId = $.fn.extend( {
-	uniqueId: ( function() {
-		var uuid = 0;
-
-		return function() {
-			return this.each( function() {
-				if ( !this.id ) {
-					this.id = "ui-id-" + ( ++uuid );
-				}
-			} );
-		};
-	} )(),
-
-	removeUniqueId: function() {
-		return this.each( function() {
-			if ( /^ui-id-\d+$/.test( this.id ) ) {
-				$( this ).removeAttr( "id" );
-			}
-		} );
-	}
-} );
-
-
-/*!
- * jQuery UI Menu 1.14.1
- * https://jqueryui.com
- *
- * Copyright OpenJS Foundation and other contributors
- * Released under the MIT license.
- * https://jquery.org/license
- */
-
-//>>label: Menu
-//>>group: Widgets
-//>>description: Creates nestable menus.
-//>>docs: https://api.jqueryui.com/menu/
-//>>demos: https://jqueryui.com/menu/
-//>>css.structure: ../../themes/base/core.css
-//>>css.structure: ../../themes/base/menu.css
-//>>css.theme: ../../themes/base/theme.css
-
-
-var widgetsMenu = $.widget( "ui.menu", {
-	version: "1.14.1",
-	defaultElement: "<ul>",
-	delay: 300,
-	options: {
-		icons: {
-			submenu: "ui-icon-caret-1-e"
-		},
-		items: "> *",
-		menus: "ul",
-		position: {
-			my: "left top",
-			at: "right top"
-		},
-		role: "menu",
-
-		// Callbacks
-		blur: null,
-		focus: null,
-		select: null
-	},
-
-	_create: function() {
-		this.activeMenu = this.element;
-
-		// Flag used to prevent firing of the click handler
-		// as the event bubbles up through nested menus
-		this.mouseHandled = false;
-		this.lastMousePosition = { x: null, y: null };
-		this.element
-			.uniqueId()
-			.attr( {
-				role: this.options.role,
-				tabIndex: 0
-			} );
-
-		this._addClass( "ui-menu", "ui-widget ui-widget-content" );
-		this._on( {
-
-			// Prevent focus from sticking to links inside menu after clicking
-			// them (focus should always stay on UL during navigation).
-			"mousedown .ui-menu-item": function( event ) {
-				event.preventDefault();
-
-				this._activateItem( event );
-			},
-			"click .ui-menu-item": function( event ) {
-				var target = $( event.target );
-				var active = $( this.document[ 0 ].activeElement );
-				if ( !this.mouseHandled && target.not( ".ui-state-disabled" ).length ) {
-					this.select( event );
-
-					// Only set the mouseHandled flag if the event will bubble, see #9469.
-					if ( !event.isPropagationStopped() ) {
-						this.mouseHandled = true;
-					}
-
-					// Open submenu on click
-					if ( target.has( ".ui-menu" ).length ) {
-						this.expand( event );
-					} else if ( !this.element.is( ":focus" ) &&
-							active.closest( ".ui-menu" ).length ) {
-
-						// Redirect focus to the menu
-						this.element.trigger( "focus", [ true ] );
-
-						// If the active item is on the top level, let it stay active.
-						// Otherwise, blur the active item since it is no longer visible.
-						if ( this.active && this.active.parents( ".ui-menu" ).length === 1 ) {
-							clearTimeout( this.timer );
-						}
-					}
-				}
-			},
-			"mouseenter .ui-menu-item": "_activateItem",
-			"mousemove .ui-menu-item": "_activateItem",
-			mouseleave: "collapseAll",
-			"mouseleave .ui-menu": "collapseAll",
-			focus: function( event, keepActiveItem ) {
-
-				// If there's already an active item, keep it active
-				// If not, activate the first item
-				var item = this.active || this._menuItems().first();
-
-				if ( !keepActiveItem ) {
-					this.focus( event, item );
-				}
-			},
-			blur: function( event ) {
-				this._delay( function() {
-					var notContained = !$.contains(
-						this.element[ 0 ],
-						this.document[ 0 ].activeElement
-					);
-					if ( notContained ) {
-						this.collapseAll( event );
-					}
-				} );
-			},
-			keydown: "_keydown"
-		} );
-
-		this.refresh();
-
-		// Clicks outside of a menu collapse any open menus
-		this._on( this.document, {
-			click: function( event ) {
-				if ( this._closeOnDocumentClick( event ) ) {
-					this.collapseAll( event, true );
-				}
-
-				// Reset the mouseHandled flag
-				this.mouseHandled = false;
-			}
-		} );
-	},
-
-	_activateItem: function( event ) {
-
-		// Ignore mouse events while typeahead is active, see #10458.
-		// Prevents focusing the wrong item when typeahead causes a scroll while the mouse
-		// is over an item in the menu
-		if ( this.previousFilter ) {
-			return;
-		}
-
-		// If the mouse didn't actually move, but the page was scrolled, ignore the event (#9356)
-		if ( event.clientX === this.lastMousePosition.x &&
-				event.clientY === this.lastMousePosition.y ) {
-			return;
-		}
-
-		this.lastMousePosition = {
-			x: event.clientX,
-			y: event.clientY
-		};
-
-		var actualTarget = $( event.target ).closest( ".ui-menu-item" ),
-			target = $( event.currentTarget );
-
-		// Ignore bubbled events on parent items, see #11641
-		if ( actualTarget[ 0 ] !== target[ 0 ] ) {
-			return;
-		}
-
-		// If the item is already active, there's nothing to do
-		if ( target.is( ".ui-state-active" ) ) {
-			return;
-		}
-
-		// Remove ui-state-active class from siblings of the newly focused menu item
-		// to avoid a jump caused by adjacent elements both having a class with a border
-		this._removeClass( target.siblings().children( ".ui-state-active" ),
-			null, "ui-state-active" );
-		this.focus( event, target );
-	},
-
-	_destroy: function() {
-		var items = this.element.find( ".ui-menu-item" )
-				.removeAttr( "role aria-disabled" ),
-			submenus = items.children( ".ui-menu-item-wrapper" )
-				.removeUniqueId()
-				.removeAttr( "tabIndex role aria-haspopup" );
-
-		// Destroy (sub)menus
-		this.element
-			.removeAttr( "aria-activedescendant" )
-			.find( ".ui-menu" ).addBack()
-				.removeAttr( "role aria-labelledby aria-expanded aria-hidden aria-disabled " +
-					"tabIndex" )
-				.removeUniqueId()
-				.show();
-
-		submenus.children().each( function() {
-			var elem = $( this );
-			if ( elem.data( "ui-menu-submenu-caret" ) ) {
-				elem.remove();
-			}
-		} );
-	},
-
-	_keydown: function( event ) {
-		var match, prev, character, skip,
-			preventDefault = true;
-
-		switch ( event.keyCode ) {
-		case $.ui.keyCode.PAGE_UP:
-			this.previousPage( event );
-			break;
-		case $.ui.keyCode.PAGE_DOWN:
-			this.nextPage( event );
-			break;
-		case $.ui.keyCode.HOME:
-			this._move( "first", "first", event );
-			break;
-		case $.ui.keyCode.END:
-			this._move( "last", "last", event );
-			break;
-		case $.ui.keyCode.UP:
-			this.previous( event );
-			break;
-		case $.ui.keyCode.DOWN:
-			this.next( event );
-			break;
-		case $.ui.keyCode.LEFT:
-			this.collapse( event );
-			break;
-		case $.ui.keyCode.RIGHT:
-			if ( this.active && !this.active.is( ".ui-state-disabled" ) ) {
-				this.expand( event );
-			}
-			break;
-		case $.ui.keyCode.ENTER:
-		case $.ui.keyCode.SPACE:
-			this._activate( event );
-			break;
-		case $.ui.keyCode.ESCAPE:
-			this.collapse( event );
-			break;
-		default:
-			preventDefault = false;
-			prev = this.previousFilter || "";
-			skip = false;
-
-			// Support number pad values
-			character = event.keyCode >= 96 && event.keyCode <= 105 ?
-				( event.keyCode - 96 ).toString() : String.fromCharCode( event.keyCode );
-
-			clearTimeout( this.filterTimer );
-
-			if ( character === prev ) {
-				skip = true;
-			} else {
-				character = prev + character;
-			}
-
-			match = this._filterMenuItems( character );
-			match = skip && match.index( this.active.next() ) !== -1 ?
-				this.active.nextAll( ".ui-menu-item" ) :
-				match;
-
-			// If no matches on the current filter, reset to the last character pressed
-			// to move down the menu to the first item that starts with that character
-			if ( !match.length ) {
-				character = String.fromCharCode( event.keyCode );
-				match = this._filterMenuItems( character );
-			}
-
-			if ( match.length ) {
-				this.focus( event, match );
-				this.previousFilter = character;
-				this.filterTimer = this._delay( function() {
-					delete this.previousFilter;
-				}, 1000 );
-			} else {
-				delete this.previousFilter;
-			}
-		}
-
-		if ( preventDefault ) {
-			event.preventDefault();
-		}
-	},
-
-	_activate: function( event ) {
-		if ( this.active && !this.active.is( ".ui-state-disabled" ) ) {
-			if ( this.active.children( "[aria-haspopup='true']" ).length ) {
-				this.expand( event );
-			} else {
-				this.select( event );
-			}
-		}
-	},
-
-	refresh: function() {
-		var menus, items, newSubmenus, newItems, newWrappers,
-			that = this,
-			icon = this.options.icons.submenu,
-			submenus = this.element.find( this.options.menus );
-
-		this._toggleClass( "ui-menu-icons", null, !!this.element.find( ".ui-icon" ).length );
-
-		// Initialize nested menus
-		newSubmenus = submenus.filter( ":not(.ui-menu)" )
-			.hide()
-			.attr( {
-				role: this.options.role,
-				"aria-hidden": "true",
-				"aria-expanded": "false"
-			} )
-			.each( function() {
-				var menu = $( this ),
-					item = menu.prev(),
-					submenuCaret = $( "<span>" ).data( "ui-menu-submenu-caret", true );
-
-				that._addClass( submenuCaret, "ui-menu-icon", "ui-icon " + icon );
-				item
-					.attr( "aria-haspopup", "true" )
-					.prepend( submenuCaret );
-				menu.attr( "aria-labelledby", item.attr( "id" ) );
-			} );
-
-		this._addClass( newSubmenus, "ui-menu", "ui-widget ui-widget-content ui-front" );
-
-		menus = submenus.add( this.element );
-		items = menus.find( this.options.items );
-
-		// Initialize menu-items containing spaces and/or dashes only as dividers
-		items.not( ".ui-menu-item" ).each( function() {
-			var item = $( this );
-			if ( that._isDivider( item ) ) {
-				that._addClass( item, "ui-menu-divider", "ui-widget-content" );
-			}
-		} );
-
-		// Don't refresh list items that are already adapted
-		newItems = items.not( ".ui-menu-item, .ui-menu-divider" );
-		newWrappers = newItems.children()
-			.not( ".ui-menu" )
-				.uniqueId()
-				.attr( {
-					tabIndex: -1,
-					role: this._itemRole()
-				} );
-		this._addClass( newItems, "ui-menu-item" )
-			._addClass( newWrappers, "ui-menu-item-wrapper" );
-
-		// Add aria-disabled attribute to any disabled menu item
-		items.filter( ".ui-state-disabled" ).attr( "aria-disabled", "true" );
-
-		// If the active item has been removed, blur the menu
-		if ( this.active && !$.contains( this.element[ 0 ], this.active[ 0 ] ) ) {
-			this.blur();
-		}
-	},
-
-	_itemRole: function() {
-		return {
-			menu: "menuitem",
-			listbox: "option"
-		}[ this.options.role ];
-	},
-
-	_setOption: function( key, value ) {
-		if ( key === "icons" ) {
-			var icons = this.element.find( ".ui-menu-icon" );
-			this._removeClass( icons, null, this.options.icons.submenu )
-				._addClass( icons, null, value.submenu );
-		}
-		this._super( key, value );
-	},
-
-	_setOptionDisabled: function( value ) {
-		this._super( value );
-
-		this.element.attr( "aria-disabled", String( value ) );
-		this._toggleClass( null, "ui-state-disabled", !!value );
-	},
-
-	focus: function( event, item ) {
-		var nested, focused, activeParent;
-		this.blur( event, event && event.type === "focus" );
-
-		this._scrollIntoView( item );
-
-		this.active = item.first();
-
-		focused = this.active.children( ".ui-menu-item-wrapper" );
-		this._addClass( focused, null, "ui-state-active" );
-
-		// Only update aria-activedescendant if there's a role
-		// otherwise we assume focus is managed elsewhere
-		if ( this.options.role ) {
-			this.element.attr( "aria-activedescendant", focused.attr( "id" ) );
-		}
-
-		// Highlight active parent menu item, if any
-		activeParent = this.active
-			.parent()
-				.closest( ".ui-menu-item" )
-					.children( ".ui-menu-item-wrapper" );
-		this._addClass( activeParent, null, "ui-state-active" );
-
-		if ( event && event.type === "keydown" ) {
-			this._close();
-		} else {
-			this.timer = this._delay( function() {
-				this._close();
-			}, this.delay );
-		}
-
-		nested = item.children( ".ui-menu" );
-		if ( nested.length && event && ( /^mouse/.test( event.type ) ) ) {
-			this._startOpening( nested );
-		}
-		this.activeMenu = item.parent();
-
-		this._trigger( "focus", event, { item: item } );
-	},
-
-	_scrollIntoView: function( item ) {
-		var borderTop, paddingTop, offset, scroll, elementHeight, itemHeight;
-		if ( this._hasScroll() ) {
-			borderTop = parseFloat( $.css( this.activeMenu[ 0 ], "borderTopWidth" ) ) || 0;
-			paddingTop = parseFloat( $.css( this.activeMenu[ 0 ], "paddingTop" ) ) || 0;
-			offset = item.offset().top - this.activeMenu.offset().top - borderTop - paddingTop;
-			scroll = this.activeMenu.scrollTop();
-			elementHeight = this.activeMenu.height();
-			itemHeight = item.outerHeight();
-
-			if ( offset < 0 ) {
-				this.activeMenu.scrollTop( scroll + offset );
-			} else if ( offset + itemHeight > elementHeight ) {
-				this.activeMenu.scrollTop( scroll + offset - elementHeight + itemHeight );
-			}
-		}
-	},
-
-	blur: function( event, fromFocus ) {
-		if ( !fromFocus ) {
-			clearTimeout( this.timer );
-		}
-
-		if ( !this.active ) {
-			return;
-		}
-
-		this._removeClass( this.active.children( ".ui-menu-item-wrapper" ),
-			null, "ui-state-active" );
-
-		this._trigger( "blur", event, { item: this.active } );
-		this.active = null;
-	},
-
-	_startOpening: function( submenu ) {
-		clearTimeout( this.timer );
-
-		// Don't open if already open fixes a Firefox bug that caused a .5 pixel
-		// shift in the submenu position when mousing over the caret icon
-		if ( submenu.attr( "aria-hidden" ) !== "true" ) {
-			return;
-		}
-
-		this.timer = this._delay( function() {
-			this._close();
-			this._open( submenu );
-		}, this.delay );
-	},
-
-	_open: function( submenu ) {
-		var position = $.extend( {
-			of: this.active
-		}, this.options.position );
-
-		clearTimeout( this.timer );
-		this.element.find( ".ui-menu" ).not( submenu.parents( ".ui-menu" ) )
-			.hide()
-			.attr( "aria-hidden", "true" );
-
-		submenu
-			.show()
-			.removeAttr( "aria-hidden" )
-			.attr( "aria-expanded", "true" )
-			.position( position );
-	},
-
-	collapseAll: function( event, all ) {
-		clearTimeout( this.timer );
-		this.timer = this._delay( function() {
-
-			// If we were passed an event, look for the submenu that contains the event
-			var currentMenu = all ? this.element :
-				$( event && event.target ).closest( this.element.find( ".ui-menu" ) );
-
-			// If we found no valid submenu ancestor, use the main menu to close all
-			// sub menus anyway
-			if ( !currentMenu.length ) {
-				currentMenu = this.element;
-			}
-
-			this._close( currentMenu );
-
-			this.blur( event );
-
-			// Work around active item staying active after menu is blurred
-			this._removeClass( currentMenu.find( ".ui-state-active" ), null, "ui-state-active" );
-
-			this.activeMenu = currentMenu;
-		}, all ? 0 : this.delay );
-	},
-
-	// With no arguments, closes the currently active menu - if nothing is active
-	// it closes all menus.  If passed an argument, it will search for menus BELOW
-	_close: function( startMenu ) {
-		if ( !startMenu ) {
-			startMenu = this.active ? this.active.parent() : this.element;
-		}
-
-		startMenu.find( ".ui-menu" )
-			.hide()
-			.attr( "aria-hidden", "true" )
-			.attr( "aria-expanded", "false" );
-	},
-
-	_closeOnDocumentClick: function( event ) {
-		return !$( event.target ).closest( ".ui-menu" ).length;
-	},
-
-	_isDivider: function( item ) {
-
-		// Match hyphen, em dash, en dash
-		return !/[^\-\u2014\u2013\s]/.test( item.text() );
-	},
-
-	collapse: function( event ) {
-		var newItem = this.active &&
-			this.active.parent().closest( ".ui-menu-item", this.element );
-		if ( newItem && newItem.length ) {
-			this._close();
-			this.focus( event, newItem );
-		}
-	},
-
-	expand: function( event ) {
-		var newItem = this.active && this._menuItems( this.active.children( ".ui-menu" ) ).first();
-
-		if ( newItem && newItem.length ) {
-			this._open( newItem.parent() );
-
-			// Delay so Firefox will not hide activedescendant change in expanding submenu from AT
-			this._delay( function() {
-				this.focus( event, newItem );
-			} );
-		}
-	},
-
-	next: function( event ) {
-		this._move( "next", "first", event );
-	},
-
-	previous: function( event ) {
-		this._move( "prev", "last", event );
-	},
-
-	isFirstItem: function() {
-		return this.active && !this.active.prevAll( ".ui-menu-item" ).length;
-	},
-
-	isLastItem: function() {
-		return this.active && !this.active.nextAll( ".ui-menu-item" ).length;
-	},
-
-	_menuItems: function( menu ) {
-		return ( menu || this.element )
-			.find( this.options.items )
-			.filter( ".ui-menu-item" );
-	},
-
-	_move: function( direction, filter, event ) {
-		var next;
-		if ( this.active ) {
-			if ( direction === "first" || direction === "last" ) {
-				next = this.active
-					[ direction === "first" ? "prevAll" : "nextAll" ]( ".ui-menu-item" )
-					.last();
-			} else {
-				next = this.active
-					[ direction + "All" ]( ".ui-menu-item" )
-					.first();
-			}
-		}
-		if ( !next || !next.length || !this.active ) {
-			next = this._menuItems( this.activeMenu )[ filter ]();
-		}
-
-		this.focus( event, next );
-	},
-
-	nextPage: function( event ) {
-		var item, base, height;
-
-		if ( !this.active ) {
-			this.next( event );
-			return;
-		}
-		if ( this.isLastItem() ) {
-			return;
-		}
-		if ( this._hasScroll() ) {
-			base = this.active.offset().top;
-			height = this.element.innerHeight();
-
-			// jQuery 3.2 doesn't include scrollbars in innerHeight, add it back.
-			if ( $.fn.jquery.indexOf( "3.2." ) === 0 ) {
-				height += this.element[ 0 ].offsetHeight - this.element.outerHeight();
-			}
-
-			this.active.nextAll( ".ui-menu-item" ).each( function() {
-				item = $( this );
-				return item.offset().top - base - height < 0;
-			} );
-
-			this.focus( event, item );
-		} else {
-			this.focus( event, this._menuItems( this.activeMenu )
-				[ !this.active ? "first" : "last" ]() );
-		}
-	},
-
-	previousPage: function( event ) {
-		var item, base, height;
-		if ( !this.active ) {
-			this.next( event );
-			return;
-		}
-		if ( this.isFirstItem() ) {
-			return;
-		}
-		if ( this._hasScroll() ) {
-			base = this.active.offset().top;
-			height = this.element.innerHeight();
-
-			// jQuery 3.2 doesn't include scrollbars in innerHeight, add it back.
-			if ( $.fn.jquery.indexOf( "3.2." ) === 0 ) {
-				height += this.element[ 0 ].offsetHeight - this.element.outerHeight();
-			}
-
-			this.active.prevAll( ".ui-menu-item" ).each( function() {
-				item = $( this );
-				return item.offset().top - base + height > 0;
-			} );
-
-			this.focus( event, item );
-		} else {
-			this.focus( event, this._menuItems( this.activeMenu ).first() );
-		}
-	},
-
-	_hasScroll: function() {
-		return this.element.outerHeight() < this.element.prop( "scrollHeight" );
-	},
-
-	select: function( event ) {
-
-		// TODO: It should never be possible to not have an active item at this
-		// point, but the tests don't trigger mouseenter before click.
-		this.active = this.active || $( event.target ).closest( ".ui-menu-item" );
-		var ui = { item: this.active };
-		if ( !this.active.has( ".ui-menu" ).length ) {
-			this.collapseAll( event, true );
-		}
-		this._trigger( "select", event, ui );
-	},
-
-	_filterMenuItems: function( character ) {
-		var escapedCharacter = character.replace( /[\-\[\]{}()*+?.,\\\^$|#\s]/g, "\\$&" ),
-			regex = new RegExp( "^" + escapedCharacter, "i" );
-
-		return this.activeMenu
-			.find( this.options.items )
-
-				// Only match on items, not dividers or other content (#10571)
-				.filter( ".ui-menu-item" )
-					.filter( function() {
-						return regex.test(
-							String.prototype.trim.call(
-								$( this ).children( ".ui-menu-item-wrapper" ).text() ) );
-					} );
-	}
-} );
-
-
-/*!
- * jQuery UI Autocomplete 1.14.1
- * https://jqueryui.com
- *
- * Copyright OpenJS Foundation and other contributors
- * Released under the MIT license.
- * https://jquery.org/license
- */
-
-//>>label: Autocomplete
-//>>group: Widgets
-//>>description: Lists suggested words as the user is typing.
-//>>docs: https://api.jqueryui.com/autocomplete/
-//>>demos: https://jqueryui.com/autocomplete/
-//>>css.structure: ../../themes/base/core.css
-//>>css.structure: ../../themes/base/autocomplete.css
-//>>css.theme: ../../themes/base/theme.css
-
-
-$.widget( "ui.autocomplete", {
-	version: "1.14.1",
-	defaultElement: "<input>",
-	options: {
-		appendTo: null,
-		autoFocus: false,
-		delay: 300,
-		minLength: 1,
-		position: {
-			my: "left top",
-			at: "left bottom",
-			collision: "none"
-		},
-		source: null,
-
-		// Callbacks
-		change: null,
-		close: null,
-		focus: null,
-		open: null,
-		response: null,
-		search: null,
-		select: null
-	},
-
-	requestIndex: 0,
-	pending: 0,
-	liveRegionTimer: null,
-
-	_create: function() {
-
-		// Some browsers only repeat keydown events, not keypress events,
-		// so we use the suppressKeyPress flag to determine if we've already
-		// handled the keydown event. #7269
-		// Unfortunately the code for & in keypress is the same as the up arrow,
-		// so we use the suppressKeyPressRepeat flag to avoid handling keypress
-		// events when we know the keydown event was used to modify the
-		// search term. #7799
-		var suppressKeyPress, suppressKeyPressRepeat, suppressInput,
-			nodeName = this.element[ 0 ].nodeName.toLowerCase(),
-			isTextarea = nodeName === "textarea",
-			isInput = nodeName === "input";
-
-		// Textareas are always multi-line
-		// Inputs are always single-line, even if inside a contentEditable element
-		// All other element types are determined by whether they're contentEditable
-		this.isMultiLine = isTextarea ||
-			!isInput && this.element.prop( "contentEditable" ) === "true";
-
-		this.valueMethod = this.element[ isTextarea || isInput ? "val" : "text" ];
-		this.isNewMenu = true;
-
-		this._addClass( "ui-autocomplete-input" );
-		this.element.attr( "autocomplete", "off" );
-
-		this._on( this.element, {
-			keydown: function( event ) {
-				if ( this.element.prop( "readOnly" ) ) {
-					suppressKeyPress = true;
-					suppressInput = true;
-					suppressKeyPressRepeat = true;
-					return;
-				}
-
-				suppressKeyPress = false;
-				suppressInput = false;
-				suppressKeyPressRepeat = false;
-				var keyCode = $.ui.keyCode;
-				switch ( event.keyCode ) {
-				case keyCode.PAGE_UP:
-					suppressKeyPress = true;
-					this._move( "previousPage", event );
-					break;
-				case keyCode.PAGE_DOWN:
-					suppressKeyPress = true;
-					this._move( "nextPage", event );
-					break;
-				case keyCode.UP:
-					suppressKeyPress = true;
-					this._keyEvent( "previous", event );
-					break;
-				case keyCode.DOWN:
-					suppressKeyPress = true;
-					this._keyEvent( "next", event );
-					break;
-				case keyCode.ENTER:
-
-					// when menu is open and has focus
-					if ( this.menu.active ) {
-
-						// #6055 - Opera still allows the keypress to occur
-						// which causes forms to submit
-						suppressKeyPress = true;
-						event.preventDefault();
-						this.menu.select( event );
-					}
-					break;
-				case keyCode.TAB:
-					if ( this.menu.active ) {
-						this.menu.select( event );
-					}
-					break;
-				case keyCode.ESCAPE:
-					if ( this.menu.element.is( ":visible" ) ) {
-						if ( !this.isMultiLine ) {
-							this._value( this.term );
-						}
-						this.close( event );
-
-						// Different browsers have different default behavior for escape
-						// Single press can mean undo or clear
-						event.preventDefault();
-					}
-					break;
-				default:
-					suppressKeyPressRepeat = true;
-
-					// search timeout should be triggered before the input value is changed
-					this._searchTimeout( event );
-					break;
-				}
-			},
-			keypress: function( event ) {
-				if ( suppressKeyPress ) {
-					suppressKeyPress = false;
-					if ( !this.isMultiLine || this.menu.element.is( ":visible" ) ) {
-						event.preventDefault();
-					}
-					return;
-				}
-				if ( suppressKeyPressRepeat ) {
-					return;
-				}
-
-				// Replicate some key handlers to allow them to repeat in Firefox and Opera
-				var keyCode = $.ui.keyCode;
-				switch ( event.keyCode ) {
-				case keyCode.PAGE_UP:
-					this._move( "previousPage", event );
-					break;
-				case keyCode.PAGE_DOWN:
-					this._move( "nextPage", event );
-					break;
-				case keyCode.UP:
-					this._keyEvent( "previous", event );
-					break;
-				case keyCode.DOWN:
-					this._keyEvent( "next", event );
-					break;
-				}
-			},
-			input: function( event ) {
-				if ( suppressInput ) {
-					suppressInput = false;
-					event.preventDefault();
-					return;
-				}
-				this._searchTimeout( event );
-			},
-			focus: function() {
-				this.selectedItem = null;
-				this.previous = this._value();
-			},
-			blur: function( event ) {
-				clearTimeout( this.searching );
-				this.close( event );
-				this._change( event );
-			}
-		} );
-
-		this._initSource();
-		this.menu = $( "<ul>" )
-			.appendTo( this._appendTo() )
-			.menu( {
-
-				// disable ARIA support, the live region takes care of that
-				role: null
-			} )
-			.hide()
-			.menu( "instance" );
-
-		this._addClass( this.menu.element, "ui-autocomplete", "ui-front" );
-		this._on( this.menu.element, {
-			mousedown: function( event ) {
-
-				// Prevent moving focus out of the text field
-				event.preventDefault();
-			},
-			menufocus: function( event, ui ) {
-				var label, item;
-
-				// Support: Firefox
-				// Prevent accidental activation of menu items in Firefox (#7024 #9118)
-				if ( this.isNewMenu ) {
-					this.isNewMenu = false;
-					if ( event.originalEvent && /^mouse/.test( event.originalEvent.type ) ) {
-						this.menu.blur();
-
-						this.document.one( "mousemove", function() {
-							$( event.target ).trigger( event.originalEvent );
-						} );
-
-						return;
-					}
-				}
-
-				item = ui.item.data( "ui-autocomplete-item" );
-				if ( false !== this._trigger( "focus", event, { item: item } ) ) {
-
-					// use value to match what will end up in the input, if it was a key event
-					if ( event.originalEvent && /^key/.test( event.originalEvent.type ) ) {
-						this._value( item.value );
-					}
-				}
-
-				// Announce the value in the liveRegion
-				label = ui.item.attr( "aria-label" ) || item.value;
-				if ( label && String.prototype.trim.call( label ).length ) {
-					clearTimeout( this.liveRegionTimer );
-					this.liveRegionTimer = this._delay( function() {
-						this.liveRegion.html( $( "<div>" ).text( label ) );
-					}, 100 );
-				}
-			},
-			menuselect: function( event, ui ) {
-				var item = ui.item.data( "ui-autocomplete-item" ),
-					previous = this.previous;
-
-				// Only trigger when focus was lost (click on menu)
-				if ( this.element[ 0 ] !== this.document[ 0 ].activeElement ) {
-					this.element.trigger( "focus" );
-					this.previous = previous;
-				}
-
-				if ( false !== this._trigger( "select", event, { item: item } ) ) {
-					this._value( item.value );
-				}
-
-				// reset the term after the select event
-				// this allows custom select handling to work properly
-				this.term = this._value();
-
-				this.close( event );
-				this.selectedItem = item;
-			}
-		} );
-
-		this.liveRegion = $( "<div>", {
-			role: "status",
-			"aria-live": "assertive",
-			"aria-relevant": "additions"
-		} )
-			.appendTo( this.document[ 0 ].body );
-
-		this._addClass( this.liveRegion, null, "ui-helper-hidden-accessible" );
-
-		// Turning off autocomplete prevents the browser from remembering the
-		// value when navigating through history, so we re-enable autocomplete
-		// if the page is unloaded before the widget is destroyed. #7790
-		this._on( this.window, {
-			beforeunload: function() {
-				this.element.removeAttr( "autocomplete" );
-			}
-		} );
-	},
-
-	_destroy: function() {
-		clearTimeout( this.searching );
-		this.element.removeAttr( "autocomplete" );
-		this.menu.element.remove();
-		this.liveRegion.remove();
-	},
-
-	_setOption: function( key, value ) {
-		this._super( key, value );
-		if ( key === "source" ) {
-			this._initSource();
-		}
-		if ( key === "appendTo" ) {
-			this.menu.element.appendTo( this._appendTo() );
-		}
-		if ( key === "disabled" && value && this.xhr ) {
-			this.xhr.abort();
-		}
-	},
-
-	_isEventTargetInWidget: function( event ) {
-		var menuElement = this.menu.element[ 0 ];
-
-		return event.target === this.element[ 0 ] ||
-			event.target === menuElement ||
-			$.contains( menuElement, event.target );
-	},
-
-	_closeOnClickOutside: function( event ) {
-		if ( !this._isEventTargetInWidget( event ) ) {
-			this.close();
-		}
-	},
-
-	_appendTo: function() {
-		var element = this.options.appendTo;
-
-		if ( element ) {
-			element = element.jquery || element.nodeType ?
-				$( element ) :
-				this.document.find( element ).eq( 0 );
-		}
-
-		if ( !element || !element[ 0 ] ) {
-			element = this.element.closest( ".ui-front, dialog" );
-		}
-
-		if ( !element.length ) {
-			element = this.document[ 0 ].body;
-		}
-
-		return element;
-	},
-
-	_initSource: function() {
-		var array, url,
-			that = this;
-		if ( Array.isArray( this.options.source ) ) {
-			array = this.options.source;
-			this.source = function( request, response ) {
-				response( $.ui.autocomplete.filter( array, request.term ) );
-			};
-		} else if ( typeof this.options.source === "string" ) {
-			url = this.options.source;
-			this.source = function( request, response ) {
-				if ( that.xhr ) {
-					that.xhr.abort();
-				}
-				that.xhr = $.ajax( {
-					url: url,
-					data: request,
-					dataType: "json",
-					success: function( data ) {
-						response( data );
-					},
-					error: function() {
-						response( [] );
-					}
-				} );
-			};
-		} else {
-			this.source = this.options.source;
-		}
-	},
-
-	_searchTimeout: function( event ) {
-		clearTimeout( this.searching );
-		this.searching = this._delay( function() {
-
-			// Search if the value has changed, or if the user retypes the same value (see #7434)
-			var equalValues = this.term === this._value(),
-				menuVisible = this.menu.element.is( ":visible" ),
-				modifierKey = event.altKey || event.ctrlKey || event.metaKey || event.shiftKey;
-
-			if ( !equalValues || ( equalValues && !menuVisible && !modifierKey ) ) {
-				this.selectedItem = null;
-				this.search( null, event );
-			}
-		}, this.options.delay );
-	},
-
-	search: function( value, event ) {
-		value = value != null ? value : this._value();
-
-		// Always save the actual value, not the one passed as an argument
-		this.term = this._value();
-
-		if ( value.length < this.options.minLength ) {
-			return this.close( event );
-		}
-
-		if ( this._trigger( "search", event ) === false ) {
-			return;
-		}
-
-		return this._search( value );
-	},
-
-	_search: function( value ) {
-		this.pending++;
-		this._addClass( "ui-autocomplete-loading" );
-		this.cancelSearch = false;
-
-		this.source( { term: value }, this._response() );
-	},
-
-	_response: function() {
-		var index = ++this.requestIndex;
-
-		return function( content ) {
-			if ( index === this.requestIndex ) {
-				this.__response( content );
-			}
-
-			this.pending--;
-			if ( !this.pending ) {
-				this._removeClass( "ui-autocomplete-loading" );
-			}
-		}.bind( this );
-	},
-
-	__response: function( content ) {
-		if ( content ) {
-			content = this._normalize( content );
-		}
-		this._trigger( "response", null, { content: content } );
-		if ( !this.options.disabled && content && content.length && !this.cancelSearch ) {
-			this._suggest( content );
-			this._trigger( "open" );
-		} else {
-
-			// use ._close() instead of .close() so we don't cancel future searches
-			this._close();
-		}
-	},
-
-	close: function( event ) {
-		this.cancelSearch = true;
-		this._close( event );
-	},
-
-	_close: function( event ) {
-
-		// Remove the handler that closes the menu on outside clicks
-		this._off( this.document, "mousedown" );
-
-		if ( this.menu.element.is( ":visible" ) ) {
-			this.menu.element.hide();
-			this.menu.blur();
-			this.isNewMenu = true;
-			this._trigger( "close", event );
-		}
-	},
-
-	_change: function( event ) {
-		if ( this.previous !== this._value() ) {
-			this._trigger( "change", event, { item: this.selectedItem } );
-		}
-	},
-
-	_normalize: function( items ) {
-
-		// assume all items have the right format when the first item is complete
-		if ( items.length && items[ 0 ].label && items[ 0 ].value ) {
-			return items;
-		}
-		return $.map( items, function( item ) {
-			if ( typeof item === "string" ) {
-				return {
-					label: item,
-					value: item
-				};
-			}
-			return $.extend( {}, item, {
-				label: item.label || item.value,
-				value: item.value || item.label
-			} );
-		} );
-	},
-
-	_suggest: function( items ) {
-		var ul = this.menu.element.empty();
-		this._renderMenu( ul, items );
-		this.isNewMenu = true;
-		this.menu.refresh();
-
-		// Size and position menu
-		ul.show();
-		this._resizeMenu();
-		ul.position( $.extend( {
-			of: this.element
-		}, this.options.position ) );
-
-		if ( this.options.autoFocus ) {
-			this.menu.next();
-		}
-
-		// Listen for interactions outside of the widget (#6642)
-		this._on( this.document, {
-			mousedown: "_closeOnClickOutside"
-		} );
-	},
-
-	_resizeMenu: function() {
-		var ul = this.menu.element;
-		ul.outerWidth( Math.max(
-
-			// Firefox wraps long text (possibly a rounding bug)
-			// so we add 1px to avoid the wrapping (#7513)
-			ul.width( "" ).outerWidth() + 1,
-			this.element.outerWidth()
-		) );
-	},
-
-	_renderMenu: function( ul, items ) {
-		var that = this;
-		$.each( items, function( index, item ) {
-			that._renderItemData( ul, item );
-		} );
-	},
-
-	_renderItemData: function( ul, item ) {
-		return this._renderItem( ul, item ).data( "ui-autocomplete-item", item );
-	},
-
-	_renderItem: function( ul, item ) {
-		return $( "<li>" )
-			.append( $( "<div>" ).text( item.label ) )
-			.appendTo( ul );
-	},
-
-	_move: function( direction, event ) {
-		if ( !this.menu.element.is( ":visible" ) ) {
-			this.search( null, event );
-			return;
-		}
-		if ( this.menu.isFirstItem() && /^previous/.test( direction ) ||
-				this.menu.isLastItem() && /^next/.test( direction ) ) {
-
-			if ( !this.isMultiLine ) {
-				this._value( this.term );
-			}
-
-			this.menu.blur();
-			return;
-		}
-		this.menu[ direction ]( event );
-	},
-
-	widget: function() {
-		return this.menu.element;
-	},
-
-	_value: function() {
-		return this.valueMethod.apply( this.element, arguments );
-	},
-
-	_keyEvent: function( keyEvent, event ) {
-		if ( !this.isMultiLine || this.menu.element.is( ":visible" ) ) {
-			this._move( keyEvent, event );
-
-			// Prevents moving cursor to beginning/end of the text field in some browsers
-			event.preventDefault();
-		}
-	}
-} );
-
-$.extend( $.ui.autocomplete, {
-	escapeRegex: function( value ) {
-		return value.replace( /[\-\[\]{}()*+?.,\\\^$|#\s]/g, "\\$&" );
-	},
-	filter: function( array, term ) {
-		var matcher = new RegExp( $.ui.autocomplete.escapeRegex( term ), "i" );
-		return $.grep( array, function( value ) {
-			return matcher.test( value.label || value.value || value );
-		} );
-	}
-} );
-
-// Live region extension, adding a `messages` option
-// NOTE: This is an experimental API. We are still investigating
-// a full solution for string manipulation and internationalization.
-$.widget( "ui.autocomplete", $.ui.autocomplete, {
-	options: {
-		messages: {
-			noResults: "No search results.",
-			results: function( amount ) {
-				return amount + ( amount > 1 ? " results are" : " result is" ) +
-					" available, use up and down arrow keys to navigate.";
-			}
-		}
-	},
-
-	__response: function( content ) {
-		var message;
-		this._superApply( arguments );
-		if ( this.options.disabled || this.cancelSearch ) {
-			return;
-		}
-		if ( content && content.length ) {
-			message = this.options.messages.results( content.length );
-		} else {
-			message = this.options.messages.noResults;
-		}
-		clearTimeout( this.liveRegionTimer );
-		this.liveRegionTimer = this._delay( function() {
-			this.liveRegion.html( $( "<div>" ).text( message ) );
-		}, 100 );
-	}
-} );
-
-var widgetsAutocomplete = $.ui.autocomplete;
-
-
-
-
-} );
\ No newline at end of file
diff --git a/src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclets/formats/html/resources/jquery/jquery-ui.min.css b/src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclets/formats/html/resources/jquery/jquery-ui.min.css
deleted file mode 100644
index 7e0692dc969..00000000000
--- a/src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclets/formats/html/resources/jquery/jquery-ui.min.css
+++ /dev/null
@@ -1,6 +0,0 @@
-/*! jQuery UI - v1.14.1 - 2025-01-13
-* https://jqueryui.com
-* Includes: core.css, autocomplete.css, menu.css
-* Copyright OpenJS Foundation and other contributors; Licensed MIT */
-
-.ui-helper-hidden{display:none}.ui-helper-hidden-accessible{border:0;clip:rect(0 0 0 0);height:1px;margin:-1px;overflow:hidden;padding:0;position:absolute;width:1px}.ui-helper-reset{margin:0;padding:0;border:0;outline:0;line-height:1.3;text-decoration:none;font-size:100%;list-style:none}.ui-helper-clearfix:before,.ui-helper-clearfix:after{content:"";display:table;border-collapse:collapse}.ui-helper-clearfix:after{clear:both}.ui-helper-zfix{width:100%;height:100%;top:0;left:0;position:absolute;opacity:0}.ui-front{z-index:100}.ui-state-disabled{cursor:default!important;pointer-events:none}.ui-icon{display:inline-block;vertical-align:middle;margin-top:-.25em;position:relative;text-indent:-99999px;overflow:hidden;background-repeat:no-repeat}.ui-widget-icon-block{left:50%;margin-left:-8px;display:block}.ui-widget-overlay{position:fixed;top:0;left:0;width:100%;height:100%}.ui-autocomplete{position:absolute;top:0;left:0;cursor:default}.ui-menu{list-style:none;padding:0;margin:0;display:block;outline:0}.ui-menu .ui-menu{position:absolute}.ui-menu .ui-menu-item{margin:0;cursor:pointer}.ui-menu .ui-menu-item-wrapper{position:relative;padding:3px 1em 3px .4em}.ui-menu .ui-menu-divider{margin:5px 0;height:0;font-size:0;line-height:0;border-width:1px 0 0 0}.ui-menu .ui-state-focus,.ui-menu .ui-state-active{margin:-1px}.ui-menu-icons{position:relative}.ui-menu-icons .ui-menu-item-wrapper{padding-left:2em}.ui-menu .ui-icon{position:absolute;top:0;bottom:0;left:.2em;margin:auto 0}.ui-menu .ui-menu-icon{left:auto;right:0}
\ No newline at end of file
diff --git a/src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclets/formats/html/resources/jquery/jquery-ui.min.js b/src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclets/formats/html/resources/jquery/jquery-ui.min.js
deleted file mode 100644
index e362bc03cf0..00000000000
--- a/src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclets/formats/html/resources/jquery/jquery-ui.min.js
+++ /dev/null
@@ -1,6 +0,0 @@
-/*! jQuery UI - v1.14.1 - 2025-01-13
-* https://jqueryui.com
-* Includes: widget.js, position.js, keycode.js, unique-id.js, widgets/autocomplete.js, widgets/menu.js
-* Copyright OpenJS Foundation and other contributors; Licensed MIT */
-
-(t=>{"function"==typeof define&&define.amd?define(["jquery"],t):t(jQuery)})(function(x){x.ui=x.ui||{};x.ui.version="1.14.1";var n,s,C,k,o,l,a,r,u,i,h=0,c=Array.prototype.hasOwnProperty,d=Array.prototype.slice;x.cleanData=(n=x.cleanData,function(t){for(var e,i,s=0;null!=(i=t[s]);s++)(e=x._data(i,"events"))&&e.remove&&x(i).triggerHandler("remove");n(t)}),x.widget=function(t,i,e){var s,n,o,l,a={},r=t.split(".")[0];return"__proto__"===(t=t.split(".")[1])||"constructor"===t?x.error("Invalid widget name: "+t):(l=r+"-"+t,e||(e=i,i=x.Widget),Array.isArray(e)&&(e=x.extend.apply(null,[{}].concat(e))),x.expr.pseudos[l.toLowerCase()]=function(t){return!!x.data(t,l)},x[r]=x[r]||{},s=x[r][t],n=x[r][t]=function(t,e){if(!this||!this._createWidget)return new n(t,e);arguments.length&&this._createWidget(t,e)},x.extend(n,s,{version:e.version,_proto:x.extend({},e),_childConstructors:[]}),(o=new i).options=x.widget.extend({},o.options),x.each(e,function(e,s){function n(){return i.prototype[e].apply(this,arguments)}function o(t){return i.prototype[e].apply(this,t)}a[e]="function"!=typeof s?s:function(){var t,e=this._super,i=this._superApply;return this._super=n,this._superApply=o,t=s.apply(this,arguments),this._super=e,this._superApply=i,t}}),n.prototype=x.widget.extend(o,{widgetEventPrefix:s&&o.widgetEventPrefix||t},a,{constructor:n,namespace:r,widgetName:t,widgetFullName:l}),s?(x.each(s._childConstructors,function(t,e){var i=e.prototype;x.widget(i.namespace+"."+i.widgetName,n,e._proto)}),delete s._childConstructors):i._childConstructors.push(n),x.widget.bridge(t,n),n)},x.widget.extend=function(t){for(var e,i,s=d.call(arguments,1),n=0,o=s.length;n<o;n++)for(e in s[n])i=s[n][e],c.call(s[n],e)&&void 0!==i&&(x.isPlainObject(i)?t[e]=x.isPlainObject(t[e])?x.widget.extend({},t[e],i):x.widget.extend({},i):t[e]=i);return t},x.widget.bridge=function(o,e){var l=e.prototype.widgetFullName||o;x.fn[o]=function(i){var t="string"==typeof i,s=d.call(arguments,1),n=this;return t?this.length||"instance"!==i?this.each(function(){var t,e=x.data(this,l);return"instance"===i?(n=e,!1):e?"function"!=typeof e[i]||"_"===i.charAt(0)?x.error("no such method '"+i+"' for "+o+" widget instance"):(t=e[i].apply(e,s))!==e&&void 0!==t?(n=t&&t.jquery?n.pushStack(t.get()):t,!1):void 0:x.error("cannot call methods on "+o+" prior to initialization; attempted to call method '"+i+"'")}):n=void 0:(s.length&&(i=x.widget.extend.apply(null,[i].concat(s))),this.each(function(){var t=x.data(this,l);t?(t.option(i||{}),t._init&&t._init()):x.data(this,l,new e(i,this))})),n}},x.Widget=function(){},x.Widget._childConstructors=[],x.Widget.prototype={widgetName:"widget",widgetEventPrefix:"",defaultElement:"<div>",options:{classes:{},disabled:!1,create:null},_createWidget:function(t,e){e=x(e||this.defaultElement||this)[0],this.element=x(e),this.uuid=h++,this.eventNamespace="."+this.widgetName+this.uuid,this.bindings=x(),this.hoverable=x(),this.focusable=x(),this.classesElementLookup={},e!==this&&(x.data(e,this.widgetFullName,this),this._on(!0,this.element,{remove:function(t){t.target===e&&this.destroy()}}),this.document=x(e.style?e.ownerDocument:e.document||e),this.window=x(this.document[0].defaultView||this.document[0].parentWindow)),this.options=x.widget.extend({},this.options,this._getCreateOptions(),t),this._create(),this.options.disabled&&this._setOptionDisabled(this.options.disabled),this._trigger("create",null,this._getCreateEventData()),this._init()},_getCreateOptions:function(){return{}},_getCreateEventData:x.noop,_create:x.noop,_init:x.noop,destroy:function(){var i=this;this._destroy(),x.each(this.classesElementLookup,function(t,e){i._removeClass(e,t)}),this.element.off(this.eventNamespace).removeData(this.widgetFullName),this.widget().off(this.eventNamespace).removeAttr("aria-disabled"),this.bindings.off(this.eventNamespace)},_destroy:x.noop,widget:function(){return this.element},option:function(t,e){var i,s,n,o=t;if(0===arguments.length)return x.widget.extend({},this.options);if("string"==typeof t)if(o={},t=(i=t.split(".")).shift(),i.length){for(s=o[t]=x.widget.extend({},this.options[t]),n=0;n<i.length-1;n++)s[i[n]]=s[i[n]]||{},s=s[i[n]];if(t=i.pop(),1===arguments.length)return void 0===s[t]?null:s[t];s[t]=e}else{if(1===arguments.length)return void 0===this.options[t]?null:this.options[t];o[t]=e}return this._setOptions(o),this},_setOptions:function(t){for(var e in t)this._setOption(e,t[e]);return this},_setOption:function(t,e){return"classes"===t&&this._setOptionClasses(e),this.options[t]=e,"disabled"===t&&this._setOptionDisabled(e),this},_setOptionClasses:function(t){var e,i,s;for(e in t)s=this.classesElementLookup[e],t[e]!==this.options.classes[e]&&s&&s.length&&(i=x(s.get()),this._removeClass(s,e),i.addClass(this._classes({element:i,keys:e,classes:t,add:!0})))},_setOptionDisabled:function(t){this._toggleClass(this.widget(),this.widgetFullName+"-disabled",null,!!t),t&&(this._removeClass(this.hoverable,null,"ui-state-hover"),this._removeClass(this.focusable,null,"ui-state-focus"))},enable:function(){return this._setOptions({disabled:!1})},disable:function(){return this._setOptions({disabled:!0})},_classes:function(n){var o=[],l=this;function t(t,e){for(var i,s=0;s<t.length;s++)i=l.classesElementLookup[t[s]]||x(),i=n.add?((()=>{var i=[];n.element.each(function(t,e){x.map(l.classesElementLookup,function(t){return t}).some(function(t){return t.is(e)})||i.push(e)}),l._on(x(i),{remove:"_untrackClassesElement"})})(),x(x.uniqueSort(i.get().concat(n.element.get())))):x(i.not(n.element).get()),l.classesElementLookup[t[s]]=i,o.push(t[s]),e&&n.classes[t[s]]&&o.push(n.classes[t[s]])}return(n=x.extend({element:this.element,classes:this.options.classes||{}},n)).keys&&t(n.keys.match(/\S+/g)||[],!0),n.extra&&t(n.extra.match(/\S+/g)||[]),o.join(" ")},_untrackClassesElement:function(i){var s=this;x.each(s.classesElementLookup,function(t,e){-1!==x.inArray(i.target,e)&&(s.classesElementLookup[t]=x(e.not(i.target).get()))}),this._off(x(i.target))},_removeClass:function(t,e,i){return this._toggleClass(t,e,i,!1)},_addClass:function(t,e,i){return this._toggleClass(t,e,i,!0)},_toggleClass:function(t,e,i,s){var n="string"==typeof t||null===t,e={extra:n?e:i,keys:n?t:e,element:n?this.element:t,add:s="boolean"==typeof s?s:i};return e.element.toggleClass(this._classes(e),s),this},_on:function(n,o,t){var l,a=this;"boolean"!=typeof n&&(t=o,o=n,n=!1),t?(o=l=x(o),this.bindings=this.bindings.add(o)):(t=o,o=this.element,l=this.widget()),x.each(t,function(t,e){function i(){if(n||!0!==a.options.disabled&&!x(this).hasClass("ui-state-disabled"))return("string"==typeof e?a[e]:e).apply(a,arguments)}"string"!=typeof e&&(i.guid=e.guid=e.guid||i.guid||x.guid++);var t=t.match(/^([\w:-]*)\s*(.*)$/),s=t[1]+a.eventNamespace,t=t[2];t?l.on(s,t,i):o.on(s,i)})},_off:function(t,e){e=(e||"").split(" ").join(this.eventNamespace+" ")+this.eventNamespace,t.off(e),this.bindings=x(this.bindings.not(t).get()),this.focusable=x(this.focusable.not(t).get()),this.hoverable=x(this.hoverable.not(t).get())},_delay:function(t,e){var i=this;return setTimeout(function(){return("string"==typeof t?i[t]:t).apply(i,arguments)},e||0)},_hoverable:function(t){this.hoverable=this.hoverable.add(t),this._on(t,{mouseenter:function(t){this._addClass(x(t.currentTarget),null,"ui-state-hover")},mouseleave:function(t){this._removeClass(x(t.currentTarget),null,"ui-state-hover")}})},_focusable:function(t){this.focusable=this.focusable.add(t),this._on(t,{focusin:function(t){this._addClass(x(t.currentTarget),null,"ui-state-focus")},focusout:function(t){this._removeClass(x(t.currentTarget),null,"ui-state-focus")}})},_trigger:function(t,e,i){var s,n,o=this.options[t];if(i=i||{},(e=x.Event(e)).type=(t===this.widgetEventPrefix?t:this.widgetEventPrefix+t).toLowerCase(),e.target=this.element[0],n=e.originalEvent)for(s in n)s in e||(e[s]=n[s]);return this.element.trigger(e,i),!("function"==typeof o&&!1===o.apply(this.element[0],[e].concat(i))||e.isDefaultPrevented())}},x.each({show:"fadeIn",hide:"fadeOut"},function(o,l){x.Widget.prototype["_"+o]=function(e,t,i){var s,n=(t="string"==typeof t?{effect:t}:t)?!0!==t&&"number"!=typeof t&&t.effect||l:o;"number"==typeof(t=t||{})?t={duration:t}:!0===t&&(t={}),s=!x.isEmptyObject(t),t.complete=i,t.delay&&e.delay(t.delay),s&&x.effects&&x.effects.effect[n]?e[o](t):n!==o&&e[n]?e[n](t.duration,t.easing,i):e.queue(function(t){x(this)[o](),i&&i.call(e[0]),t()})}}),x.widget;function E(t,e,i){return[parseFloat(t[0])*(u.test(t[0])?e/100:1),parseFloat(t[1])*(u.test(t[1])?i/100:1)]}function T(t,e){return parseInt(x.css(t,e),10)||0}function W(t){return null!=t&&t===t.window}C=Math.max,k=Math.abs,o=/left|center|right/,l=/top|center|bottom/,a=/[\+\-]\d+(\.[\d]+)?%?/,r=/^\w+/,u=/%$/,i=x.fn.position,x.position={scrollbarWidth:function(){var t,e,i;return void 0!==s?s:(i=(e=x("<div style='display:block;position:absolute;width:200px;height:200px;overflow:hidden;'><div style='height:300px;width:auto;'></div></div>")).children()[0],x("body").append(e),t=i.offsetWidth,e.css("overflow","scroll"),t===(i=i.offsetWidth)&&(i=e[0].clientWidth),e.remove(),s=t-i)},getScrollInfo:function(t){var e=t.isWindow||t.isDocument?"":t.element.css("overflow-x"),i=t.isWindow||t.isDocument?"":t.element.css("overflow-y"),e="scroll"===e||"auto"===e&&t.width<t.element[0].scrollWidth;return{width:"scroll"===i||"auto"===i&&t.height<t.element[0].scrollHeight?x.position.scrollbarWidth():0,height:e?x.position.scrollbarWidth():0}},getWithinInfo:function(t){var e=x(t||window),i=W(e[0]),s=!!e[0]&&9===e[0].nodeType;return{element:e,isWindow:i,isDocument:s,offset:!i&&!s?x(t).offset():{left:0,top:0},scrollLeft:e.scrollLeft(),scrollTop:e.scrollTop(),width:e.outerWidth(),height:e.outerHeight()}}},x.fn.position=function(c){var d,m,f,p,v,g,_,y,b,w,t,e;return c&&c.of?(g="string"==typeof(c=x.extend({},c)).of?x(document).find(c.of):x(c.of),_=x.position.getWithinInfo(c.within),y=x.position.getScrollInfo(_),b=(c.collision||"flip").split(" "),w={},e=9===(e=(t=g)[0]).nodeType?{width:t.width(),height:t.height(),offset:{top:0,left:0}}:W(e)?{width:t.width(),height:t.height(),offset:{top:t.scrollTop(),left:t.scrollLeft()}}:e.preventDefault?{width:0,height:0,offset:{top:e.pageY,left:e.pageX}}:{width:t.outerWidth(),height:t.outerHeight(),offset:t.offset()},g[0].preventDefault&&(c.at="left top"),m=e.width,f=e.height,v=x.extend({},p=e.offset),x.each(["my","at"],function(){var t,e,i=(c[this]||"").split(" ");(i=1===i.length?o.test(i[0])?i.concat(["center"]):l.test(i[0])?["center"].concat(i):["center","center"]:i)[0]=o.test(i[0])?i[0]:"center",i[1]=l.test(i[1])?i[1]:"center",t=a.exec(i[0]),e=a.exec(i[1]),w[this]=[t?t[0]:0,e?e[0]:0],c[this]=[r.exec(i[0])[0],r.exec(i[1])[0]]}),1===b.length&&(b[1]=b[0]),"right"===c.at[0]?v.left+=m:"center"===c.at[0]&&(v.left+=m/2),"bottom"===c.at[1]?v.top+=f:"center"===c.at[1]&&(v.top+=f/2),d=E(w.at,m,f),v.left+=d[0],v.top+=d[1],this.each(function(){var i,t,l=x(this),a=l.outerWidth(),r=l.outerHeight(),e=T(this,"marginLeft"),s=T(this,"marginTop"),n=a+e+T(this,"marginRight")+y.width,o=r+s+T(this,"marginBottom")+y.height,u=x.extend({},v),h=E(w.my,l.outerWidth(),l.outerHeight());"right"===c.my[0]?u.left-=a:"center"===c.my[0]&&(u.left-=a/2),"bottom"===c.my[1]?u.top-=r:"center"===c.my[1]&&(u.top-=r/2),u.left+=h[0],u.top+=h[1],i={marginLeft:e,marginTop:s},x.each(["left","top"],function(t,e){x.ui.position[b[t]]&&x.ui.position[b[t]][e](u,{targetWidth:m,targetHeight:f,elemWidth:a,elemHeight:r,collisionPosition:i,collisionWidth:n,collisionHeight:o,offset:[d[0]+h[0],d[1]+h[1]],my:c.my,at:c.at,within:_,elem:l})}),c.using&&(t=function(t){var e=p.left-u.left,i=e+m-a,s=p.top-u.top,n=s+f-r,o={target:{element:g,left:p.left,top:p.top,width:m,height:f},element:{element:l,left:u.left,top:u.top,width:a,height:r},horizontal:i<0?"left":0<e?"right":"center",vertical:n<0?"top":0<s?"bottom":"middle"};m<a&&k(e+i)<m&&(o.horizontal="center"),f<r&&k(s+n)<f&&(o.vertical="middle"),C(k(e),k(i))>C(k(s),k(n))?o.important="horizontal":o.important="vertical",c.using.call(this,t,o)}),l.offset(x.extend(u,{using:t}))})):i.apply(this,arguments)},x.ui.position={fit:{left:function(t,e){var i,s=e.within,n=s.isWindow?s.scrollLeft:s.offset.left,s=s.width,o=t.left-e.collisionPosition.marginLeft,l=n-o,a=o+e.collisionWidth-s-n;s<e.collisionWidth?0<l&&a<=0?(i=t.left+l+e.collisionWidth-s-n,t.left+=l-i):t.left=!(0<a&&l<=0)&&a<l?n+s-e.collisionWidth:n:0<l?t.left+=l:0<a?t.left-=a:t.left=C(t.left-o,t.left)},top:function(t,e){var i,s=e.within,s=s.isWindow?s.scrollTop:s.offset.top,n=e.within.height,o=t.top-e.collisionPosition.marginTop,l=s-o,a=o+e.collisionHeight-n-s;n<e.collisionHeight?0<l&&a<=0?(i=t.top+l+e.collisionHeight-n-s,t.top+=l-i):t.top=!(0<a&&l<=0)&&a<l?s+n-e.collisionHeight:s:0<l?t.top+=l:0<a?t.top-=a:t.top=C(t.top-o,t.top)}},flip:{left:function(t,e){var i=e.within,s=i.offset.left+i.scrollLeft,n=i.width,i=i.isWindow?i.scrollLeft:i.offset.left,o=t.left-e.collisionPosition.marginLeft,l=o-i,o=o+e.collisionWidth-n-i,a="left"===e.my[0]?-e.elemWidth:"right"===e.my[0]?e.elemWidth:0,r="left"===e.at[0]?e.targetWidth:"right"===e.at[0]?-e.targetWidth:0,u=-2*e.offset[0];l<0?((n=t.left+a+r+u+e.collisionWidth-n-s)<0||n<k(l))&&(t.left+=a+r+u):0<o&&(0<(s=t.left-e.collisionPosition.marginLeft+a+r+u-i)||k(s)<o)&&(t.left+=a+r+u)},top:function(t,e){var i=e.within,s=i.offset.top+i.scrollTop,n=i.height,i=i.isWindow?i.scrollTop:i.offset.top,o=t.top-e.collisionPosition.marginTop,l=o-i,o=o+e.collisionHeight-n-i,a="top"===e.my[1]?-e.elemHeight:"bottom"===e.my[1]?e.elemHeight:0,r="top"===e.at[1]?e.targetHeight:"bottom"===e.at[1]?-e.targetHeight:0,u=-2*e.offset[1];l<0?((n=t.top+a+r+u+e.collisionHeight-n-s)<0||n<k(l))&&(t.top+=a+r+u):0<o&&(0<(s=t.top-e.collisionPosition.marginTop+a+r+u-i)||k(s)<o)&&(t.top+=a+r+u)}},flipfit:{left:function(){x.ui.position.flip.left.apply(this,arguments),x.ui.position.fit.left.apply(this,arguments)},top:function(){x.ui.position.flip.top.apply(this,arguments),x.ui.position.fit.top.apply(this,arguments)}}};var t;x.ui.position,x.ui.keyCode={BACKSPACE:8,COMMA:188,DELETE:46,DOWN:40,END:35,ENTER:13,ESCAPE:27,HOME:36,LEFT:37,PAGE_DOWN:34,PAGE_UP:33,PERIOD:190,RIGHT:39,SPACE:32,TAB:9,UP:38},x.fn.extend({uniqueId:(t=0,function(){return this.each(function(){this.id||(this.id="ui-id-"+ ++t)})}),removeUniqueId:function(){return this.each(function(){/^ui-id-\d+$/.test(this.id)&&x(this).removeAttr("id")})}}),x.widget("ui.menu",{version:"1.14.1",defaultElement:"<ul>",delay:300,options:{icons:{submenu:"ui-icon-caret-1-e"},items:"> *",menus:"ul",position:{my:"left top",at:"right top"},role:"menu",blur:null,focus:null,select:null},_create:function(){this.activeMenu=this.element,this.mouseHandled=!1,this.lastMousePosition={x:null,y:null},this.element.uniqueId().attr({role:this.options.role,tabIndex:0}),this._addClass("ui-menu","ui-widget ui-widget-content"),this._on({"mousedown .ui-menu-item":function(t){t.preventDefault(),this._activateItem(t)},"click .ui-menu-item":function(t){var e=x(t.target),i=x(this.document[0].activeElement);!this.mouseHandled&&e.not(".ui-state-disabled").length&&(this.select(t),t.isPropagationStopped()||(this.mouseHandled=!0),e.has(".ui-menu").length?this.expand(t):!this.element.is(":focus")&&i.closest(".ui-menu").length&&(this.element.trigger("focus",[!0]),this.active)&&1===this.active.parents(".ui-menu").length&&clearTimeout(this.timer))},"mouseenter .ui-menu-item":"_activateItem","mousemove .ui-menu-item":"_activateItem",mouseleave:"collapseAll","mouseleave .ui-menu":"collapseAll",focus:function(t,e){var i=this.active||this._menuItems().first();e||this.focus(t,i)},blur:function(t){this._delay(function(){x.contains(this.element[0],this.document[0].activeElement)||this.collapseAll(t)})},keydown:"_keydown"}),this.refresh(),this._on(this.document,{click:function(t){this._closeOnDocumentClick(t)&&this.collapseAll(t,!0),this.mouseHandled=!1}})},_activateItem:function(t){var e,i;this.previousFilter||t.clientX===this.lastMousePosition.x&&t.clientY===this.lastMousePosition.y||(this.lastMousePosition={x:t.clientX,y:t.clientY},e=x(t.target).closest(".ui-menu-item"),i=x(t.currentTarget),e[0]!==i[0])||i.is(".ui-state-active")||(this._removeClass(i.siblings().children(".ui-state-active"),null,"ui-state-active"),this.focus(t,i))},_destroy:function(){var t=this.element.find(".ui-menu-item").removeAttr("role aria-disabled").children(".ui-menu-item-wrapper").removeUniqueId().removeAttr("tabIndex role aria-haspopup");this.element.removeAttr("aria-activedescendant").find(".ui-menu").addBack().removeAttr("role aria-labelledby aria-expanded aria-hidden aria-disabled tabIndex").removeUniqueId().show(),t.children().each(function(){var t=x(this);t.data("ui-menu-submenu-caret")&&t.remove()})},_keydown:function(t){var e,i,s,n=!0;switch(t.keyCode){case x.ui.keyCode.PAGE_UP:this.previousPage(t);break;case x.ui.keyCode.PAGE_DOWN:this.nextPage(t);break;case x.ui.keyCode.HOME:this._move("first","first",t);break;case x.ui.keyCode.END:this._move("last","last",t);break;case x.ui.keyCode.UP:this.previous(t);break;case x.ui.keyCode.DOWN:this.next(t);break;case x.ui.keyCode.LEFT:this.collapse(t);break;case x.ui.keyCode.RIGHT:this.active&&!this.active.is(".ui-state-disabled")&&this.expand(t);break;case x.ui.keyCode.ENTER:case x.ui.keyCode.SPACE:this._activate(t);break;case x.ui.keyCode.ESCAPE:this.collapse(t);break;default:e=this.previousFilter||"",s=n=!1,i=96<=t.keyCode&&t.keyCode<=105?(t.keyCode-96).toString():String.fromCharCode(t.keyCode),clearTimeout(this.filterTimer),i===e?s=!0:i=e+i,e=this._filterMenuItems(i),(e=s&&-1!==e.index(this.active.next())?this.active.nextAll(".ui-menu-item"):e).length||(i=String.fromCharCode(t.keyCode),e=this._filterMenuItems(i)),e.length?(this.focus(t,e),this.previousFilter=i,this.filterTimer=this._delay(function(){delete this.previousFilter},1e3)):delete this.previousFilter}n&&t.preventDefault()},_activate:function(t){this.active&&!this.active.is(".ui-state-disabled")&&(this.active.children("[aria-haspopup='true']").length?this.expand(t):this.select(t))},refresh:function(){var t,e,s=this,n=this.options.icons.submenu,i=this.element.find(this.options.menus);this._toggleClass("ui-menu-icons",null,!!this.element.find(".ui-icon").length),t=i.filter(":not(.ui-menu)").hide().attr({role:this.options.role,"aria-hidden":"true","aria-expanded":"false"}).each(function(){var t=x(this),e=t.prev(),i=x("<span>").data("ui-menu-submenu-caret",!0);s._addClass(i,"ui-menu-icon","ui-icon "+n),e.attr("aria-haspopup","true").prepend(i),t.attr("aria-labelledby",e.attr("id"))}),this._addClass(t,"ui-menu","ui-widget ui-widget-content ui-front"),(t=i.add(this.element).find(this.options.items)).not(".ui-menu-item").each(function(){var t=x(this);s._isDivider(t)&&s._addClass(t,"ui-menu-divider","ui-widget-content")}),e=(i=t.not(".ui-menu-item, .ui-menu-divider")).children().not(".ui-menu").uniqueId().attr({tabIndex:-1,role:this._itemRole()}),this._addClass(i,"ui-menu-item")._addClass(e,"ui-menu-item-wrapper"),t.filter(".ui-state-disabled").attr("aria-disabled","true"),this.active&&!x.contains(this.element[0],this.active[0])&&this.blur()},_itemRole:function(){return{menu:"menuitem",listbox:"option"}[this.options.role]},_setOption:function(t,e){var i;"icons"===t&&(i=this.element.find(".ui-menu-icon"),this._removeClass(i,null,this.options.icons.submenu)._addClass(i,null,e.submenu)),this._super(t,e)},_setOptionDisabled:function(t){this._super(t),this.element.attr("aria-disabled",String(t)),this._toggleClass(null,"ui-state-disabled",!!t)},focus:function(t,e){var i;this.blur(t,t&&"focus"===t.type),this._scrollIntoView(e),this.active=e.first(),i=this.active.children(".ui-menu-item-wrapper"),this._addClass(i,null,"ui-state-active"),this.options.role&&this.element.attr("aria-activedescendant",i.attr("id")),i=this.active.parent().closest(".ui-menu-item").children(".ui-menu-item-wrapper"),this._addClass(i,null,"ui-state-active"),t&&"keydown"===t.type?this._close():this.timer=this._delay(function(){this._close()},this.delay),(i=e.children(".ui-menu")).length&&t&&/^mouse/.test(t.type)&&this._startOpening(i),this.activeMenu=e.parent(),this._trigger("focus",t,{item:e})},_scrollIntoView:function(t){var e,i,s;this._hasScroll()&&(e=parseFloat(x.css(this.activeMenu[0],"borderTopWidth"))||0,i=parseFloat(x.css(this.activeMenu[0],"paddingTop"))||0,e=t.offset().top-this.activeMenu.offset().top-e-i,i=this.activeMenu.scrollTop(),s=this.activeMenu.height(),t=t.outerHeight(),e<0?this.activeMenu.scrollTop(i+e):s<e+t&&this.activeMenu.scrollTop(i+e-s+t))},blur:function(t,e){e||clearTimeout(this.timer),this.active&&(this._removeClass(this.active.children(".ui-menu-item-wrapper"),null,"ui-state-active"),this._trigger("blur",t,{item:this.active}),this.active=null)},_startOpening:function(t){clearTimeout(this.timer),"true"===t.attr("aria-hidden")&&(this.timer=this._delay(function(){this._close(),this._open(t)},this.delay))},_open:function(t){var e=x.extend({of:this.active},this.options.position);clearTimeout(this.timer),this.element.find(".ui-menu").not(t.parents(".ui-menu")).hide().attr("aria-hidden","true"),t.show().removeAttr("aria-hidden").attr("aria-expanded","true").position(e)},collapseAll:function(e,i){clearTimeout(this.timer),this.timer=this._delay(function(){var t=i?this.element:x(e&&e.target).closest(this.element.find(".ui-menu"));t.length||(t=this.element),this._close(t),this.blur(e),this._removeClass(t.find(".ui-state-active"),null,"ui-state-active"),this.activeMenu=t},i?0:this.delay)},_close:function(t){(t=t||(this.active?this.active.parent():this.element)).find(".ui-menu").hide().attr("aria-hidden","true").attr("aria-expanded","false")},_closeOnDocumentClick:function(t){return!x(t.target).closest(".ui-menu").length},_isDivider:function(t){return!/[^\-\u2014\u2013\s]/.test(t.text())},collapse:function(t){var e=this.active&&this.active.parent().closest(".ui-menu-item",this.element);e&&e.length&&(this._close(),this.focus(t,e))},expand:function(t){var e=this.active&&this._menuItems(this.active.children(".ui-menu")).first();e&&e.length&&(this._open(e.parent()),this._delay(function(){this.focus(t,e)}))},next:function(t){this._move("next","first",t)},previous:function(t){this._move("prev","last",t)},isFirstItem:function(){return this.active&&!this.active.prevAll(".ui-menu-item").length},isLastItem:function(){return this.active&&!this.active.nextAll(".ui-menu-item").length},_menuItems:function(t){return(t||this.element).find(this.options.items).filter(".ui-menu-item")},_move:function(t,e,i){var s;(s=this.active?"first"===t||"last"===t?this.active["first"===t?"prevAll":"nextAll"](".ui-menu-item").last():this.active[t+"All"](".ui-menu-item").first():s)&&s.length&&this.active||(s=this._menuItems(this.activeMenu)[e]()),this.focus(i,s)},nextPage:function(t){var e,i,s;this.active?this.isLastItem()||(this._hasScroll()?(i=this.active.offset().top,s=this.element.innerHeight(),0===x.fn.jquery.indexOf("3.2.")&&(s+=this.element[0].offsetHeight-this.element.outerHeight()),this.active.nextAll(".ui-menu-item").each(function(){return(e=x(this)).offset().top-i-s<0}),this.focus(t,e)):this.focus(t,this._menuItems(this.activeMenu)[this.active?"last":"first"]())):this.next(t)},previousPage:function(t){var e,i,s;this.active?this.isFirstItem()||(this._hasScroll()?(i=this.active.offset().top,s=this.element.innerHeight(),0===x.fn.jquery.indexOf("3.2.")&&(s+=this.element[0].offsetHeight-this.element.outerHeight()),this.active.prevAll(".ui-menu-item").each(function(){return 0<(e=x(this)).offset().top-i+s}),this.focus(t,e)):this.focus(t,this._menuItems(this.activeMenu).first())):this.next(t)},_hasScroll:function(){return this.element.outerHeight()<this.element.prop("scrollHeight")},select:function(t){this.active=this.active||x(t.target).closest(".ui-menu-item");var e={item:this.active};this.active.has(".ui-menu").length||this.collapseAll(t,!0),this._trigger("select",t,e)},_filterMenuItems:function(t){var t=t.replace(/[\-\[\]{}()*+?.,\\\^$|#\s]/g,"\\$&"),e=new RegExp("^"+t,"i");return this.activeMenu.find(this.options.items).filter(".ui-menu-item").filter(function(){return e.test(String.prototype.trim.call(x(this).children(".ui-menu-item-wrapper").text()))})}}),x.widget("ui.autocomplete",{version:"1.14.1",defaultElement:"<input>",options:{appendTo:null,autoFocus:!1,delay:300,minLength:1,position:{my:"left top",at:"left bottom",collision:"none"},source:null,change:null,close:null,focus:null,open:null,response:null,search:null,select:null},requestIndex:0,pending:0,liveRegionTimer:null,_create:function(){var i,s,n,t=this.element[0].nodeName.toLowerCase(),e="textarea"===t,t="input"===t;this.isMultiLine=e||!t&&"true"===this.element.prop("contentEditable"),this.valueMethod=this.element[e||t?"val":"text"],this.isNewMenu=!0,this._addClass("ui-autocomplete-input"),this.element.attr("autocomplete","off"),this._on(this.element,{keydown:function(t){if(this.element.prop("readOnly"))s=n=i=!0;else{s=n=i=!1;var e=x.ui.keyCode;switch(t.keyCode){case e.PAGE_UP:i=!0,this._move("previousPage",t);break;case e.PAGE_DOWN:i=!0,this._move("nextPage",t);break;case e.UP:i=!0,this._keyEvent("previous",t);break;case e.DOWN:i=!0,this._keyEvent("next",t);break;case e.ENTER:this.menu.active&&(i=!0,t.preventDefault(),this.menu.select(t));break;case e.TAB:this.menu.active&&this.menu.select(t);break;case e.ESCAPE:this.menu.element.is(":visible")&&(this.isMultiLine||this._value(this.term),this.close(t),t.preventDefault());break;default:s=!0,this._searchTimeout(t)}}},keypress:function(t){if(i)i=!1,this.isMultiLine&&!this.menu.element.is(":visible")||t.preventDefault();else if(!s){var e=x.ui.keyCode;switch(t.keyCode){case e.PAGE_UP:this._move("previousPage",t);break;case e.PAGE_DOWN:this._move("nextPage",t);break;case e.UP:this._keyEvent("previous",t);break;case e.DOWN:this._keyEvent("next",t)}}},input:function(t){n?(n=!1,t.preventDefault()):this._searchTimeout(t)},focus:function(){this.selectedItem=null,this.previous=this._value()},blur:function(t){clearTimeout(this.searching),this.close(t),this._change(t)}}),this._initSource(),this.menu=x("<ul>").appendTo(this._appendTo()).menu({role:null}).hide().menu("instance"),this._addClass(this.menu.element,"ui-autocomplete","ui-front"),this._on(this.menu.element,{mousedown:function(t){t.preventDefault()},menufocus:function(t,e){var i,s;this.isNewMenu&&(this.isNewMenu=!1,t.originalEvent)&&/^mouse/.test(t.originalEvent.type)?(this.menu.blur(),this.document.one("mousemove",function(){x(t.target).trigger(t.originalEvent)})):(s=e.item.data("ui-autocomplete-item"),!1!==this._trigger("focus",t,{item:s})&&t.originalEvent&&/^key/.test(t.originalEvent.type)&&this._value(s.value),(i=e.item.attr("aria-label")||s.value)&&String.prototype.trim.call(i).length&&(clearTimeout(this.liveRegionTimer),this.liveRegionTimer=this._delay(function(){this.liveRegion.html(x("<div>").text(i))},100)))},menuselect:function(t,e){var e=e.item.data("ui-autocomplete-item"),i=this.previous;this.element[0]!==this.document[0].activeElement&&(this.element.trigger("focus"),this.previous=i),!1!==this._trigger("select",t,{item:e})&&this._value(e.value),this.term=this._value(),this.close(t),this.selectedItem=e}}),this.liveRegion=x("<div>",{role:"status","aria-live":"assertive","aria-relevant":"additions"}).appendTo(this.document[0].body),this._addClass(this.liveRegion,null,"ui-helper-hidden-accessible"),this._on(this.window,{beforeunload:function(){this.element.removeAttr("autocomplete")}})},_destroy:function(){clearTimeout(this.searching),this.element.removeAttr("autocomplete"),this.menu.element.remove(),this.liveRegion.remove()},_setOption:function(t,e){this._super(t,e),"source"===t&&this._initSource(),"appendTo"===t&&this.menu.element.appendTo(this._appendTo()),"disabled"===t&&e&&this.xhr&&this.xhr.abort()},_isEventTargetInWidget:function(t){var e=this.menu.element[0];return t.target===this.element[0]||t.target===e||x.contains(e,t.target)},_closeOnClickOutside:function(t){this._isEventTargetInWidget(t)||this.close()},_appendTo:function(){var t=this.options.appendTo;return t=(t=(t=t&&(t.jquery||t.nodeType?x(t):this.document.find(t).eq(0)))&&t[0]?t:this.element.closest(".ui-front, dialog")).length?t:this.document[0].body},_initSource:function(){var i,s,n=this;Array.isArray(this.options.source)?(i=this.options.source,this.source=function(t,e){e(x.ui.autocomplete.filter(i,t.term))}):"string"==typeof this.options.source?(s=this.options.source,this.source=function(t,e){n.xhr&&n.xhr.abort(),n.xhr=x.ajax({url:s,data:t,dataType:"json",success:function(t){e(t)},error:function(){e([])}})}):this.source=this.options.source},_searchTimeout:function(s){clearTimeout(this.searching),this.searching=this._delay(function(){var t=this.term===this._value(),e=this.menu.element.is(":visible"),i=s.altKey||s.ctrlKey||s.metaKey||s.shiftKey;t&&(e||i)||(this.selectedItem=null,this.search(null,s))},this.options.delay)},search:function(t,e){return t=null!=t?t:this._value(),this.term=this._value(),t.length<this.options.minLength?this.close(e):!1!==this._trigger("search",e)?this._search(t):void 0},_search:function(t){this.pending++,this._addClass("ui-autocomplete-loading"),this.cancelSearch=!1,this.source({term:t},this._response())},_response:function(){var e=++this.requestIndex;return function(t){e===this.requestIndex&&this.__response(t),this.pending--,this.pending||this._removeClass("ui-autocomplete-loading")}.bind(this)},__response:function(t){t=t&&this._normalize(t),this._trigger("response",null,{content:t}),!this.options.disabled&&t&&t.length&&!this.cancelSearch?(this._suggest(t),this._trigger("open")):this._close()},close:function(t){this.cancelSearch=!0,this._close(t)},_close:function(t){this._off(this.document,"mousedown"),this.menu.element.is(":visible")&&(this.menu.element.hide(),this.menu.blur(),this.isNewMenu=!0,this._trigger("close",t))},_change:function(t){this.previous!==this._value()&&this._trigger("change",t,{item:this.selectedItem})},_normalize:function(t){return t.length&&t[0].label&&t[0].value?t:x.map(t,function(t){return"string"==typeof t?{label:t,value:t}:x.extend({},t,{label:t.label||t.value,value:t.value||t.label})})},_suggest:function(t){var e=this.menu.element.empty();this._renderMenu(e,t),this.isNewMenu=!0,this.menu.refresh(),e.show(),this._resizeMenu(),e.position(x.extend({of:this.element},this.options.position)),this.options.autoFocus&&this.menu.next(),this._on(this.document,{mousedown:"_closeOnClickOutside"})},_resizeMenu:function(){var t=this.menu.element;t.outerWidth(Math.max(t.width("").outerWidth()+1,this.element.outerWidth()))},_renderMenu:function(i,t){var s=this;x.each(t,function(t,e){s._renderItemData(i,e)})},_renderItemData:function(t,e){return this._renderItem(t,e).data("ui-autocomplete-item",e)},_renderItem:function(t,e){return x("<li>").append(x("<div>").text(e.label)).appendTo(t)},_move:function(t,e){this.menu.element.is(":visible")?this.menu.isFirstItem()&&/^previous/.test(t)||this.menu.isLastItem()&&/^next/.test(t)?(this.isMultiLine||this._value(this.term),this.menu.blur()):this.menu[t](e):this.search(null,e)},widget:function(){return this.menu.element},_value:function(){return this.valueMethod.apply(this.element,arguments)},_keyEvent:function(t,e){this.isMultiLine&&!this.menu.element.is(":visible")||(this._move(t,e),e.preventDefault())}}),x.extend(x.ui.autocomplete,{escapeRegex:function(t){return t.replace(/[\-\[\]{}()*+?.,\\\^$|#\s]/g,"\\$&")},filter:function(t,e){var i=new RegExp(x.ui.autocomplete.escapeRegex(e),"i");return x.grep(t,function(t){return i.test(t.label||t.value||t)})}}),x.widget("ui.autocomplete",x.ui.autocomplete,{options:{messages:{noResults:"No search results.",results:function(t){return t+(1<t?" results are":" result is")+" available, use up and down arrow keys to navigate."}}},__response:function(t){var e;this._superApply(arguments),this.options.disabled||this.cancelSearch||(e=t&&t.length?this.options.messages.results(t.length):this.options.messages.noResults,clearTimeout(this.liveRegionTimer),this.liveRegionTimer=this._delay(function(){this.liveRegion.html(x("<div>").text(e))},100))}}),x.ui.autocomplete});
\ No newline at end of file
diff --git a/src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclets/formats/html/resources/script.js.template b/src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclets/formats/html/resources/script.js.template
index f4c54714986..0a7a8649dec 100644
--- a/src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclets/formats/html/resources/script.js.template
+++ b/src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclets/formats/html/resources/script.js.template
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2013, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2013, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * Licensed under the Universal Permissive License v 1.0 as shown at https://oss.oracle.com/licenses/upl/
@@ -447,18 +447,12 @@ document.addEventListener("DOMContentLoaded", function(e) {
             e.preventDefault();
         } else if (e.key === "Escape") {
             closeThemePanel();
-            if (expanded) {
+            var filter = getVisibleFilterInput(false);
+            if (e.target === filter) {
+                resetInput(filter, e, true);
+            } else if (expanded) {
                 collapse();
                 e.preventDefault();
-            } else if (e.target.id === "page-search-input") {
-                resetInput(e.target, e, false);
-            } else if (isInput(e.target)) {
-                resetInput(e.target, e, true);
-            } else {
-                var filter = getVisibleFilterInput(false);
-                if (filter && filter.value) {
-                    resetInput(filterInput, e, true);
-                }
             }
         }
     });
diff --git a/src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclets/formats/html/resources/search-page.js b/src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclets/formats/html/resources/search-page.js
deleted file mode 100644
index ec0d815eea4..00000000000
--- a/src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclets/formats/html/resources/search-page.js
+++ /dev/null
@@ -1,348 +0,0 @@
-/*
- * Copyright (c) 2022, 2025, Oracle and/or its affiliates. All rights reserved.
- * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
- *
- * Licensed under the Universal Permissive License v 1.0 as shown at https://oss.oracle.com/licenses/upl/
- */
-
-"use strict";
-$(function() {
-    var copy = $("#page-search-copy");
-    var expand = $("#page-search-expand");
-    var searchLink = $("span#page-search-link");
-    var redirect = $("input#search-redirect");
-    function setSearchUrlTemplate() {
-        var href = document.location.href.split(/[#?]/)[0];
-        href += "?q=" + "%s";
-        if (redirect.is(":checked")) {
-            href += "&r=1";
-        }
-        searchLink.html(href);
-        copy[0].onmouseenter();
-    }
-    function copyLink(e) {
-        copyToClipboard(this.previousSibling.innerText);
-        switchCopyLabel(this, this.lastElementChild);
-    }
-    copy.on("click", copyLink);
-    copy[0].onmouseenter = function() {};
-    redirect.on("click", setSearchUrlTemplate);
-    setSearchUrlTemplate();
-    copy.prop("disabled", false);
-    redirect.prop("disabled", false);
-    expand.on("click", function (e) {
-        var searchInfo = $("div.page-search-info");
-        if(this.parentElement.hasAttribute("open")) {
-            searchInfo.attr("style", " display:none;");
-        } else {
-            searchInfo.attr("style", "display:block;");
-        }
-    });
-});
-$(window).on("load", function() {
-    var input = $("#page-search-input");
-    var reset = $("#page-search-reset");
-    var modules = $("#search-modules");
-    var notify = $("#page-search-notify");
-    var resultSection = $("div#result-section");
-    var resultContainer = $("div#result-container");
-    var selectedLink;
-    var searchTerm = "";
-    var activeTab = "";
-    var fixedTab = false;
-    var visibleTabs = [];
-    var feelingLucky = false;
-    const MIN_TABBED_RESULTS = 10;
-    function renderResults(result) {
-        if (!result.length) {
-            notify.html(messages.noResult);
-        } else if (result.length === 1) {
-            notify.html(messages.oneResult);
-        } else {
-            notify.html(messages.manyResults.replace("{0}", result.length));
-        }
-        resultContainer.empty();
-        var r = {
-            "types": [],
-            "members": [],
-            "packages": [],
-            "modules": [],
-            "searchTags": []
-        };
-        for (var i in result) {
-            var item = result[i];
-            var arr = r[item.category];
-            arr.push(item);
-        }
-        if (!activeTab || r[activeTab].length === 0) {
-            activeTab = Object.keys(r).find(category => r[category].length > 0);
-        }
-        if (feelingLucky && activeTab) {
-            notify.html(messages.redirecting)
-            var firstItem = r[activeTab][0];
-            window.location = getURL(firstItem.indexItem, firstItem.category);
-            return;
-        }
-        if (searchTerm.endsWith(".") && result.length > MIN_TABBED_RESULTS) {
-            if (activeTab === "types" && r["members"].length > r["types"].length) {
-                activeTab = "members";
-            } else if (activeTab === "packages" && r["types"].length > r["packages"].length) {
-                activeTab = "types";
-            }
-        }
-        var categoryCount = Object.keys(r).reduce(function(prev, curr) {
-            return prev + (r[curr].length > 0 ? 1 : 0);
-        }, 0);
-        visibleTabs = [];
-        var tabContainer = $("<div class='table-tabs'></div>").appendTo(resultContainer);
-        for (var key in r) {
-            var id = "#result-tab-" + key.replace("searchTags", "search_tags");
-            if (r[key].length) {
-                var count = r[key].length >= 1000 ? "999+" : r[key].length;
-                if (result.length > MIN_TABBED_RESULTS && categoryCount > 1) {
-                    let button = $("<button/>")
-                        .attr("id", "result-tab-" + key)
-                        .attr("tabIndex", "-1")
-                        .addClass("page-search-header")
-                        .append($("<span/>")
-                            .html(categories[key])
-                            .append($("<span/>")
-                                .attr("style", "font-weight:normal;")
-                                .html(" (" + count + ")")))
-                        .on("click", null, key, function(e) {
-                            fixedTab = true;
-                            renderResult(e.data, $(this));
-                        }).appendTo(tabContainer);
-                    visibleTabs.push(key);
-                } else {
-                    $("<span class='page-search-header'>" + categories[key]
-                        + "<span style='font-weight: normal'> (" + count + ")</span></span>").appendTo(tabContainer);
-                    renderTable(key, r[key]).appendTo(resultContainer);
-                    tabContainer = $("<div class='table-tabs'></div>").appendTo(resultContainer);
-                }
-            }
-        }
-        if (activeTab && result.length > MIN_TABBED_RESULTS && categoryCount > 1) {
-            $("button#result-tab-" + activeTab).addClass("active-table-tab").attr("tabIndex", "0");
-            renderTable(activeTab, r[activeTab]).appendTo(resultContainer);
-        }
-        resultSection.show();
-        function renderResult(category, button) {
-            activeTab = category;
-            setSearchUrl();
-            resultContainer.find("div.result-table").remove();
-            renderTable(activeTab, r[activeTab]).appendTo(resultContainer);
-            button.siblings().removeClass("active-table-tab").attr("tabIndex", "-1");
-            button.addClass("active-table-tab").attr("tabIndex", "0");
-        }
-    }
-    function selectTab(category) {
-        $("button#result-tab-" + category).focus().trigger("click");
-    }
-    function renderTable(category, items) {
-        var table = $("<div class='result-table'>");
-        var col1, col2;
-        if (category === "modules") {
-            col1 = mdlDesc;
-        } else if (category === "packages") {
-            col1 = pkgDesc;
-        } else if (category === "types") {
-            col1 = clsDesc;
-        } else if (category === "members") {
-            col1 = mbrDesc;
-        } else if (category === "searchTags") {
-            col1 = tagDesc;
-        }
-        col2 = descDesc;
-        $("<div class='table-header'/>")
-            .append($("<span class='table-header'/>").html(col1))
-            .append($("<span class='table-header'/>").html(col2))
-            .appendTo(table);
-        $.each(items, function(index, item) {
-            renderItem(item, table);
-        });
-        return table;
-    }
-    function select() {
-        if (!this.classList.contains("selected")) {
-            setSelected(this);
-        }
-    }
-    function unselect() {
-        if (this.classList.contains("selected")) {
-            setSelected(null);
-        }
-    }
-    function renderItem(item, table) {
-        var label = getResultLabel(item);
-        var desc = getResultDescription(item);
-        var link = $("<a/>")
-            .attr("href",  getURL(item.indexItem, item.category))
-            .attr("tabindex", "0")
-            .addClass("search-result-link");
-        link.on("mousemove", select.bind(link[0]))
-            .on("focus", select.bind(link[0]))
-            .on("mouseleave", unselect.bind(link[0]))
-            .on("blur", unselect.bind(link[0]))
-            .append($("<span/>").addClass("search-result-label").html(label))
-            .append($("<span/>").addClass("search-result-desc").html(desc))
-            .appendTo(table);
-    }
-    var timeout;
-    function schedulePageSearch() {
-        if (timeout) {
-            clearTimeout(timeout);
-        }
-        timeout = setTimeout(function () {
-            doPageSearch()
-        }, 100);
-    }
-    function doPageSearch() {
-        setSearchUrl();
-        var term = searchTerm = input.val().trim();
-        if (term === "") {
-            notify.html(messages.enterTerm);
-            activeTab = "";
-            fixedTab = false;
-            resultContainer.empty();
-            resultSection.hide();
-        } else {
-            notify.html(messages.searching);
-            var module = modules.val();
-            doSearch({ term: term, maxResults: 1200, module: module}, renderResults);
-        }
-    }
-    function setSearchUrl() {
-        var query = input.val().trim();
-        var url = document.location.pathname;
-        if (query) {
-            url += "?q=" + encodeURI(query);
-            if (activeTab && fixedTab) {
-                url += "&c=" + activeTab;
-            }
-            if (modules.val()) {
-                url += "&m=" + modules.val();
-            }
-        }
-        history.replaceState({query: query}, "", url);
-    }
-    input.on("input", function(e) {
-        feelingLucky = false;
-        reset.css("visibility", input.val() ? "visible" : "hidden");
-        schedulePageSearch();
-    });
-    function setSelected(link) {
-        if (selectedLink) {
-            selectedLink.classList.remove("selected");
-            selectedLink.blur();
-        }
-        if (link) {
-            link.classList.add("selected");
-            link.focus({focusVisible: true});
-        }
-        selectedLink = link;
-    }
-    document.addEventListener("keydown", e => {
-        if (e.ctrlKey || e.altKey || e.metaKey) {
-            return;
-        }
-        if (e.key === "Escape" && input.val()) {
-            input.val("").focus();
-            doPageSearch();
-            e.preventDefault();
-        }
-        if (e.target === modules[0]) {
-            return;
-        }
-        if (e.key === "ArrowLeft" || e.key === "ArrowRight") {
-            if (activeTab && visibleTabs.length > 1 && e.target !== input[0]) {
-                var tab = visibleTabs.indexOf(activeTab);
-                var newTab = e.key === "ArrowLeft"
-                    ? Math.max(0, tab - 1)
-                    : Math.min(visibleTabs.length - 1, tab + 1);
-                if (newTab !== tab) {
-                    selectTab(visibleTabs[newTab]);
-                }
-                e.preventDefault();
-            }
-        } else if (e.key === "ArrowUp" || e.key === "ArrowDown") {
-            let links = Array.from(
-                document.querySelectorAll("div.result-table > a.search-result-link"));
-            let current = links.indexOf(selectedLink);
-            let activeButton = document.querySelector("button.active-table-tab");
-            if (e.key === "ArrowUp" || (e.key === "Tab" && e.shiftKey)) {
-                if (current > 0) {
-                    setSelected(links[current - 1]);
-                } else {
-                    setSelected(null);
-                    if (activeButton && current === 0) {
-                        activeButton.focus();
-                    } else {
-                        input.focus();
-                    }
-                }
-            } else if (e.key === "ArrowDown") {
-                if (document.activeElement === input[0] && activeButton) {
-                    activeButton.focus();
-                } else if (current < links.length - 1) {
-                    setSelected(links[current + 1]);
-                }
-            }
-            e.preventDefault();
-        } else if (e.key.length === 1 || e.key === "Backspace") {
-            setSelected(null);
-            input.focus();
-        }
-    });
-    reset.on("click", function() {
-        notify.html(messages.enterTerm);
-        resultSection.hide();
-        activeTab = "";
-        fixedTab = false;
-        resultContainer.empty();
-        input.val('').focus();
-        setSearchUrl();
-    });
-    modules.on("change", function() {
-        if (input.val()) {
-            doPageSearch();
-        }
-        input.focus();
-        try {
-            localStorage.setItem("search-modules", modules.val());
-        } catch (unsupported) {}
-    });
-
-    input.prop("disabled", false);
-    input.attr("autocapitalize", "off");
-    reset.prop("disabled", false);
-
-    var urlParams = new URLSearchParams(window.location.search);
-    if (urlParams.has("m")) {
-        modules.val(urlParams.get("m"));
-    } else {
-        try {
-            var searchModules = localStorage.getItem("search-modules");
-            if (searchModules) {
-                modules.val(searchModules);
-            }
-        } catch (unsupported) {}
-    }
-    if (urlParams.has("q")) {
-        input.val(urlParams.get("q"));
-        reset.css("visibility", input.val() ? "visible" : "hidden");
-    }
-    if (urlParams.has("c")) {
-        activeTab = urlParams.get("c");
-        fixedTab = true;
-    }
-    if (urlParams.get("r")) {
-        feelingLucky = true;
-    }
-    if (input.val()) {
-        doPageSearch();
-    } else {
-        notify.html(messages.enterTerm);
-    }
-    input.select().focus();
-});
diff --git a/src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclets/formats/html/resources/search.js.template b/src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclets/formats/html/resources/search.js.template
index 16ae5a4d221..04b7ac7e371 100644
--- a/src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclets/formats/html/resources/search.js.template
+++ b/src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclets/formats/html/resources/search.js.template
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2015, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2015, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * Licensed under the Universal Permissive License v 1.0 as shown at https://oss.oracle.com/licenses/upl/
@@ -97,13 +97,14 @@ function getURLPrefix(item, category) {
         if (item.m) {
             urlPrefix = item.m + slash;
         } else {
-            $.each(packageSearchIndex, function(index, it) {
+            for (var i = 0; i < packageSearchIndex.length; i++) {
+                const it = packageSearchIndex[i];
                 if (it.m && item.p === it.l) {
                     urlPrefix = it.m + slash;
                     item.m = it.m;
-                    return false;
+                    break;
                 }
-            });
+            }
         }
     }
     return urlPrefix;
@@ -316,7 +317,7 @@ function doSearch(request, response) {
             }
             return matches;
         }
-        $.each(indexArray, function (i, item) {
+        indexArray.forEach(function (item) {
             if (module) {
                 var modulePrefix = getURLPrefix(item, category) || item.u;
                 if (modulePrefix.indexOf("/") > -1 && !modulePrefix.startsWith(module)) {
@@ -351,7 +352,6 @@ function doSearch(request, response) {
                 // m.name = m.name + " " + m.score.toFixed(3);
                 matches.push(m);
             }
-            return true;
         });
         return matches.sort(function(e1, e2) {
             return e2.score - e1.score
@@ -375,75 +375,6 @@ function doSearch(request, response) {
     }
     response(result);
 }
-// JQuery search menu implementation
-$.widget("custom.catcomplete", $.ui.autocomplete, {
-    _create: function() {
-        this._super();
-        this.widget().menu("option", "items", "> .result-item");
-        // workaround for search result scrolling
-        this.menu._scrollIntoView = function _scrollIntoView( item ) {
-            var borderTop, paddingTop, offset, scroll, elementHeight, itemHeight;
-            if ( this._hasScroll() ) {
-                borderTop = parseFloat( $.css( this.activeMenu[ 0 ], "borderTopWidth" ) ) || 0;
-                paddingTop = parseFloat( $.css( this.activeMenu[ 0 ], "paddingTop" ) ) || 0;
-                offset = item.offset().top - this.activeMenu.offset().top - borderTop - paddingTop;
-                scroll = this.activeMenu.scrollTop();
-                elementHeight = this.activeMenu.height() - 26;
-                itemHeight = item.outerHeight();
-
-                if ( offset < 0 ) {
-                    this.activeMenu.scrollTop( scroll + offset );
-                } else if ( offset + itemHeight > elementHeight ) {
-                    this.activeMenu.scrollTop( scroll + offset - elementHeight + itemHeight );
-                }
-            }
-        };
-    },
-    _renderMenu: function(ul, items) {
-        var currentCategory = "";
-        var widget = this;
-        widget.menu.bindings = $();
-        $.each(items, function(index, item) {
-            if (item.category && item.category !== currentCategory) {
-                ul.append("<li class='ui-autocomplete-category'>" + categories[item.category] + "</li>");
-                currentCategory = item.category;
-            }
-            var li = widget._renderItemData(ul, item);
-            if (item.category) {
-                li.attr("aria-label", categories[item.category] + " : " + item.l);
-            } else {
-                li.attr("aria-label", item.l);
-            }
-            li.attr("class", "result-item");
-        });
-        ul.append("<li class='ui-static-link'><div><a href='" + pathtoroot + "search.html?q="
-            + encodeURI(widget.term) + "'>" + linkLabel + "</a></div></li>");
-    },
-    _renderItem: function(ul, item) {
-        var label = getResultLabel(item);
-        var resultDesc = getResultDescription(item);
-        return $("<li/>")
-            .append($("<a/>")
-                .attr("href", item.indexItem ? pathtoroot + getURL(item.indexItem, item.category) : null)
-                .append($("<span/>").addClass("search-result-label").html(label))
-                .append($("<span/>").addClass("search-result-desc").html(resultDesc)))
-            .appendTo(ul);
-    },
-    _resizeMenu: function () {
-        var ul = this.menu.element;
-        var missing = 0;
-        ul.children().each((i, e) => {
-            if (e.hasChildNodes() && e.firstChild.hasChildNodes()) {
-                var label = e.firstChild.firstChild;
-                missing = Math.max(missing, label.scrollWidth - label.clientWidth);
-            }
-        });
-        ul.outerWidth( Math.max(
-            ul.width("").outerWidth() + missing + 40,
-            this.element.outerWidth()
-        ));
-    }
-});
 function getResultLabel(item) {
     if (item.l) {
         return item.l;
@@ -493,63 +424,483 @@ function getEnclosingDescription(elem, desc, label) {
 }
 function getEnclosingTypeDesc(item) {
     if (!item.typeDesc) {
-        $.each(typeSearchIndex, function(index, it) {
+        for (let i = 0; i < typeSearchIndex.length; i++){
+            const it = typeSearchIndex[i];
             if (it.l === item.c && it.p === item.p && it.m === item.m) {
                 item.typeDesc = itemDesc[it.k || 12][1];
-                return false;
+                break;
             }
-        });
+        }
     }
     return item.typeDesc || "";
 }
-$(function() {
-    var search = $("#search-input");
-    var reset = $("#reset-search");
-    search.catcomplete({
-        minLength: 1,
-        delay: 200,
-        source: function(request, response) {
-            if (request.term.trim() === "") {
-                return this.close();
-            }
-            // Prevent selection of item at current mouse position
-            this.menu.previousFilter = "_";
-            this.menu.filterTimer = this.menu._delay(function() {
-                delete this.previousFilter;
-            }, 500);
-            return doSearch(request, response);
-        },
-        response: function(event, ui) {
-            if (!ui.content.length) {
-                ui.content.push({ l: messages.noResult });
-            }
-        },
-        autoFocus: true,
-        focus: function(event, ui) {
-            return false;
-        },
-        position: {
-            collision: "flip"
-        },
-        select: function(event, ui) {
-            for (var e = event.originalEvent; e != null; e = e.originalEvent) {
-                if (e.type === "click") {
-                    return;
-                }
-            }
-            if (ui.item.indexItem) {
-                var url = getURL(ui.item.indexItem, ui.item.category);
-                window.location.href = pathtoroot + url;
-                search.blur();
-            }
+
+window.addEventListener("load", () => {
+    var copy = document.querySelector("#page-search-copy");
+    if (!copy) {
+        return;
+    }
+    var expand = document.querySelector("#page-search-expand");
+    var searchLink = document.querySelector("span#page-search-link");
+    var redirect = document.querySelector("input#search-redirect");
+    function setSearchUrlTemplate() {
+        var href = document.location.href.split(/[#?]/)[0];
+        href += "?q=" + "%s";
+        if (redirect.checked) {
+            href += "&r=1";
+        }
+        searchLink.innerHTML = href;
+        copy.onmouseenter();
+    }
+    function copyLink(e) {
+        copyToClipboard(this.previousSibling.innerText);
+        switchCopyLabel(this, this.lastElementChild);
+    }
+    copy.addEventListener("click", copyLink.bind(copy));
+    copy.onmouseenter = function() {};
+    redirect.addEventListener("click", setSearchUrlTemplate);
+    setSearchUrlTemplate();
+    copy.disabled = false;
+    redirect.disabled = false;
+    expand.addEventListener("click", function (e) {
+        var searchInfo = document.querySelector("div.page-search-info");
+        if(this.parentElement.hasAttribute("open")) {
+            searchInfo.setAttribute("style", " display:none;");
+        } else {
+            searchInfo.setAttribute("style", "display:block;");
         }
     });
-    search.val('');
-    search.on("input", () => reset.css("visibility", search.val() ? "visible" : "hidden"))
-    search.prop("disabled", false);
-    search.attr("autocapitalize", "off");
-    reset.prop("disabled", false);
-    reset.click(function() {
-        search.val('').focus();
-    });
+});
+window.addEventListener("load", () => {
+    const empty = (el) => { if (el) el.replaceChildren(); };
+    const setContent = (el, text) => { if (el) el.textContent = text; };
+
+    const input = document.querySelector("#search-input, #page-search-input");
+    const reset = document.querySelector("#reset-search, #page-search-reset");
+    const modules = document.querySelector("#search-modules");
+    const notify = document.querySelector("#page-search-notify");
+    const resultSection = document.querySelector("#search-result-section");
+    const resultContainer = document.querySelector("#search-result-container");
+
+    let overlay = null;
+    let selectedLink = null;
+
+    let searchTerm = "";
+    let activeTab = "";
+    let fixedTab = false;
+    let visibleTabs = [];
+    let redirect = false;
+
+    const MIN_TABBED_RESULTS = 10;
+
+    function renderResults(result) {
+        empty(resultContainer);
+
+        if (!result.length) {
+            empty(notify);
+            const p = document.createElement("p");
+            p.textContent = messages.noResult;
+            resultContainer.appendChild(p);
+            return;
+        } else if (result.length === 1) {
+            setContent(notify, messages.oneResult);
+        } else {
+            setContent(notify, messages.manyResults.replace("{0}", String(result.length)));
+        }
+
+        const r = { types: [], members: [], packages: [], modules: [], searchTags: [] };
+        for (const item of result) (r[item.category] ??= []).push(item);
+
+        if (!activeTab || r[activeTab].length === 0) {
+            activeTab = Object.keys(r).find(category => r[category].length > 0) || "";
+        }
+
+        if (redirect && activeTab) {
+            setContent(notify, messages.redirecting);
+            const firstItem = r[activeTab][0];
+            window.location = pathtoroot + getURL(firstItem.indexItem, firstItem.category);
+            input.value = "";
+            return;
+        }
+
+        if (searchTerm.endsWith(".") && result.length > MIN_TABBED_RESULTS) {
+            if (activeTab === "types" && r.members.length > r.types.length) {
+                activeTab = "members";
+            } else if (activeTab === "packages" && r.types.length > r.packages.length) {
+                activeTab = "types";
+            }
+        }
+
+        const categoryCount = Object.keys(r).reduce(
+            (prev, curr) => prev + (r[curr].length > 0 ? 1 : 0),
+            0
+        );
+
+        visibleTabs = [];
+
+        let tableTabs = document.createElement("div");
+        tableTabs.className = "table-tabs";
+
+        const resultTable = document.createElement("div");
+        resultTable.className = "result-table";
+
+        for (const key in r) {
+            if (!r[key].length) continue;
+
+            const count = r[key].length >= 1000 ? "1000+" : String(r[key].length);
+
+            if (result.length > MIN_TABBED_RESULTS && categoryCount > 1) {
+                const btn = document.createElement("button");
+                btn.id = `result-tab-${key}`;
+                btn.tabIndex = -1;
+                btn.classList.add("page-search-header");
+
+                const labelSpan = document.createElement("span");
+                setContent(labelSpan, categories[key]);
+
+                const countSpan = document.createElement("span");
+                countSpan.style.fontWeight = "normal";
+                countSpan.textContent = ` (${count})`;
+
+                labelSpan.appendChild(countSpan);
+                btn.appendChild(labelSpan);
+
+                btn.addEventListener("click", () => {
+                    fixedTab = true;
+                    renderResult(key, btn);
+                });
+
+                tableTabs.appendChild(btn);
+                visibleTabs.push(key);
+            } else {
+                const header = document.createElement("span");
+                header.className = "page-search-header";
+                header.appendChild(document.createTextNode(categories[key]));
+
+                const countSpan = document.createElement("span");
+                countSpan.style.fontWeight = "normal";
+                countSpan.textContent = ` (${count})`;
+                header.appendChild(countSpan);
+
+                tableTabs.appendChild(header);
+
+                (categoryCount > 1 ? resultTable : resultContainer).appendChild(tableTabs);
+
+                renderItems(r[key], resultTable);
+
+                tableTabs = document.createElement("div");
+                tableTabs.className = "table-tabs";
+            }
+        }
+
+        if (activeTab && result.length > MIN_TABBED_RESULTS && categoryCount > 1) {
+            resultContainer.appendChild(tableTabs);
+
+            const activeBtn = document.querySelector(`button#result-tab-${activeTab}`);
+            if (activeBtn) {
+                activeBtn.classList.add("active-table-tab");
+                activeBtn.tabIndex = 0;
+            }
+
+            renderItems(r[activeTab], resultTable);
+        }
+
+        resultContainer.appendChild(resultTable);
+
+        function renderResult(category, button) {
+            activeTab = category;
+
+            Array.from(resultContainer.querySelectorAll("div.result-table")).forEach(el => el.remove());
+
+            const newTable = renderItems(r[activeTab]);
+            resultContainer.appendChild(newTable);
+
+            const siblings = Array.from(button.parentElement?.children ?? []).filter(n => n !== button);
+            siblings.forEach(sib => {
+                sib.classList?.remove("active-table-tab");
+                if (sib instanceof HTMLElement) sib.tabIndex = -1;
+            });
+
+            button.classList.add("active-table-tab");
+            button.tabIndex = 0;
+            setSearchUrl();
+        }
+    }
+
+    function selectTab(category) {
+        const btn = document.querySelector(`button#result-tab-${category}`);
+        if (!btn) return;
+        btn.focus();
+        btn.dispatchEvent(new MouseEvent("click"));
+    }
+
+    function select() {
+        if (!this.classList.contains("selected")) setSelected(this);
+    }
+
+    function unselect() {
+        if (this.classList.contains("selected")) setSelected(null);
+    }
+
+    function renderItems(items, table) {
+        if (!table) {
+            table = document.createElement("div");
+            table.className = "result-table";
+        }
+        items.forEach(item => renderItem(item, table));
+        return table;
+    }
+
+    function renderItem(item, table) {
+        const label = getResultLabel(item);
+        const desc = getResultDescription(item);
+
+        const link = document.createElement("a");
+        link.href = pathtoroot + getURL(item.indexItem, item.category);
+        link.tabIndex = 0;
+        link.className = "search-result-link";
+
+        link.addEventListener("focus", select.bind(link));
+        link.addEventListener("blur", unselect.bind(link));
+        link.addEventListener("click", closeSearch);
+
+        const labelSpan = document.createElement("span");
+        labelSpan.className = "search-result-label";
+        labelSpan.innerHTML = label;
+
+        const descSpan = document.createElement("span");
+        descSpan.className = "search-result-desc";
+        descSpan.innerHTML = desc;
+
+        link.appendChild(labelSpan);
+        link.appendChild(descSpan);
+        table.appendChild(link);
+    }
+
+    let timeout;
+    function scheduleSearch() {
+        if (timeout) clearTimeout(timeout);
+        timeout = setTimeout(search, 200);
+    }
+
+    function search() {
+        setSearchUrl();
+        const term = (searchTerm = input.value.trim());
+        if (term === "") {
+            clearResult();
+        } else {
+            setContent(notify, messages.searching);
+            const module = modules ? modules.value : "";
+            doSearch({ term, maxResults: 1200, module }, renderResults);
+        }
+    }
+
+    function setSearchUrl() {
+        var query = input.value.trim();
+        if (input.id === "search-input") {
+            var link = document.getElementById("search-page-link");
+            var href = pathtoroot + "search.html?q=" + encodeURI(query);
+            if (activeTab && fixedTab) {
+                href += "&c=" + activeTab;
+            }
+            if (modules && modules.value) {
+                href += "&m=" + modules.value;
+            }
+            link.href = href;
+        } else {
+            var url = document.location.pathname;
+            if (query) {
+                url += "?q=" + encodeURI(query);
+                if (activeTab && fixedTab) {
+                    url += "&c=" + activeTab;
+                }
+                if (modules && modules.value) {
+                    url += "&m=" + modules.value;
+                }
+            }
+            history.replaceState({ query: query }, "", url);
+        }
+    }
+
+    input.addEventListener("input", () => {
+        redirect = false;
+        reset.style.visibility = input.value ? "visible" : "hidden";
+        scheduleSearch();
+    });
+
+    input.addEventListener("focus", openSearch);
+
+    input.addEventListener("mouseup", function(e) {
+        e.preventDefault();
+    });
+
+    function setSelected(link) {
+        if (selectedLink) {
+            selectedLink.classList.remove("selected");
+            selectedLink.blur();
+        }
+        if (link) {
+            link.classList.add("selected");
+            link.focus({ focusVisible: true });
+            link.scrollIntoView({ block: "nearest" });
+        }
+        selectedLink = link;
+    }
+
+    function clearResult() {
+        setContent(notify, messages.enterTerm);
+        activeTab = "";
+        fixedTab = false;
+        empty(resultContainer);
+        reset.style.visibility = input.value ? "visible" : "hidden";
+        setSearchUrl();
+    }
+
+    function openSearch() {
+        resultSection.style.display = "block";
+
+        if (input.id !== "search-input" || overlay) return;
+
+        overlay = document.createElement("div");
+        overlay.className = "overlay";
+        document.querySelector("header")?.appendChild(overlay);
+        overlay.addEventListener("click", closeSearch);
+        overlay.style.display = "block";
+
+        document.body.style.setProperty("overflow-y", "hidden");
+
+        var inputDiv = document.getElementById("search-input-container");
+        inputDiv.appendChild(input);
+        inputDiv.appendChild(reset);
+        input.focus();
+
+        if (input.value) {
+            input.select();
+            search();
+        }
+    }
+
+    function closeSearch() {
+        clearResult();
+        resultSection.style.display = "none";
+
+        if (overlay) {
+            var inputDiv = document.querySelector("div.sub-nav div.nav-list-search");
+            inputDiv.appendChild(input);
+            inputDiv.appendChild(reset);
+
+            overlay.remove();
+            overlay = null;
+            document.body.style.removeProperty("overflow-y");
+        }
+    }
+
+    window.addEventListener("hashchange", closeSearch);
+
+    document.addEventListener("keydown", (e) => {
+        if (e.ctrlKey || e.altKey || e.metaKey || resultSection.style.display !== "block") return;
+
+        if (e.key === "Escape") {
+            if (input.value) {
+                input.value = "";
+                input.focus();
+                clearResult();
+            } else {
+                closeSearch();
+                input.blur();
+            }
+            e.preventDefault();
+            return;
+        }
+
+        if (e.target === modules) return;
+
+        if (e.key === "ArrowLeft" || e.key === "ArrowRight") {
+            if (activeTab && visibleTabs.length > 1 && e.target !== input) {
+                const tab = visibleTabs.indexOf(activeTab);
+                const newTab = e.key === "ArrowLeft"
+                    ? Math.max(0, tab - 1)
+                    : Math.min(visibleTabs.length - 1, tab + 1);
+
+                if (newTab !== tab) selectTab(visibleTabs[newTab]);
+                e.preventDefault();
+            }
+        } else if (e.key === "ArrowUp" || e.key === "ArrowDown") {
+            const links = Array.from(document.querySelectorAll("div.result-table > a.search-result-link"));
+            const current = links.indexOf(selectedLink);
+
+            if (e.key === "ArrowUp" || (e.key === "Tab" && e.shiftKey)) {
+                if (current > 0) {
+                    setSelected(links[current - 1]);
+                } else {
+                    setSelected(null);
+                    input.focus();
+                }
+            } else if (e.key === "ArrowDown") {
+                if (current < links.length - 1) setSelected(links[current + 1]);
+            }
+            e.preventDefault();
+        } else if (e.target !== input && (e.key.length === 1 || e.key === "Backspace")) {
+            setSelected(null);
+            input.focus();
+            e.preventDefault();
+        }
+    });
+
+    reset.addEventListener("click", () => {
+        input.value = "";
+        input.focus();
+        clearResult();
+    });
+
+    if (modules) {
+        modules.addEventListener("change", () => {
+            if (input.value) search();
+            input.focus();
+            try {
+                localStorage.setItem("search-modules", modules.value);
+            } catch (unsupported) {
+                console.log("Error setting module: " + unsupported);
+            }
+        });
+    }
+
+    // Enable/initialize
+    input.disabled = false;
+    input.setAttribute("autocapitalize", "off");
+    reset.disabled = false;
+
+    var urlParams = new URLSearchParams(window.location.search);
+    if (modules) {
+        if (urlParams.has("m")) {
+            modules.value = urlParams.get("m");
+        } else {
+            try {
+                const searchModules = localStorage.getItem("search-modules");
+                if (searchModules) modules.value = searchModules;
+            } catch (unsupported) {
+                console.log("Error getting module: " + unsupported);
+            }
+        }
+    }
+    if (urlParams.has("q")) {
+        input.value = urlParams.get("q");
+        reset.style.visibility = input.value ? "visible" : "hidden";
+    }
+    if (urlParams.has("c")) {
+        activeTab = urlParams.get("c");
+        fixedTab = true;
+    }
+    if (urlParams.get("r")) {
+        redirect = true;
+    }
+    if (input.value) {
+        search();
+    } else {
+        setContent(notify, messages.enterTerm);
+    }
+    if (input.id === "page-search-input") {
+        input.select();
+        input.focus();
+    }
 });
diff --git a/src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclets/formats/html/resources/stylesheet.css b/src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclets/formats/html/resources/stylesheet.css
index 5bd14f7cf33..fc0fa68f029 100644
--- a/src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclets/formats/html/resources/stylesheet.css
+++ b/src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclets/formats/html/resources/stylesheet.css
@@ -83,9 +83,11 @@
     --search-input-background-color: #ffffff;
     --search-input-text-color: #000000;
     --search-input-placeholder-color: #757575;
+    --overlay-background: rgba(153, 169, 183, 0.3);
     /* Highlight color for active search tag target */
     --search-tag-background-color: #ffff66;
     --search-tag-text-color: var(--block-text-color);
+    --search-hover-background: #d8d8e0;
     /* Copy button colors and filters */
     --button-border-color: #b0b8c8;
     --button-active-filter: brightness(96%);
@@ -139,8 +141,10 @@
     --search-input-background-color: #303030;
     --search-input-text-color: #d0d0d0;
     --search-input-placeholder-color: #979797;
+    --overlay-background: rgba(0, 0, 0, 0.45);
     --search-tag-background-color: #c6c61e;
     --search-tag-text-color: #282828;
+    --search-hover-background: #484850;
     --button-border-color: #909090;
     --button-active-filter: brightness(96%);
     --button-focus-filter: brightness(104%);
@@ -296,6 +300,7 @@ hr {
     height: 100%;
     max-width: var(--max-content-width);
     margin: var(--content-margin);
+    position: relative;
 }
 .top-nav {
     background-color:var(--navbar-background-color);
@@ -381,7 +386,7 @@ div.sub-nav {
     min-height: var(--sub-nav-height);
 }
 ol.sub-nav-list {
-    flex: 1 1 90%;
+    flex: 1 1 auto;
     line-height: 1.7;
     overflow: auto;
     padding-left:6px;
@@ -411,11 +416,12 @@ ol.sub-nav-list a.current-selection {
     border-radius: 3px;
 }
 .sub-nav .nav-list-search {
-    flex: 1 1 10%;
+    flex: 0 0 auto;
     margin: 4.5px 15px auto 5px;
     padding: 1px 0;
     position:relative;
     white-space: nowrap;
+    width: 342px;
 }
 .top-nav .nav-list a:link, .top-nav .nav-list a:active, .top-nav .nav-list a:visited {
     color:var(--navbar-text-color);
@@ -1065,106 +1071,6 @@ main, nav, header, footer, section {
 /*
  * Styles for javadoc search.
  */
-.ui-menu .ui-state-active {
-    /* Overrides the color of selection used in jQuery UI */
-    background: var(--selected-background-color);
-    color: var(--selected-text-color);
-    /* Workaround for browser bug, see JDK-8275889 */
-    margin: -1px 0;
-    border-top: 1px solid var(--selected-background-color);
-    border-bottom: 1px solid var(--selected-background-color);
-}
-.ui-autocomplete-category {
-    font-weight:bold;
-    font-size:15px;
-    padding:7px 8px;
-    background-color:var(--navbar-background-color);
-    color:var(--navbar-text-color);
-    box-sizing: border-box;
-}
-.ui-autocomplete {
-    max-height:calc(98vh - var(--nav-height));
-    max-width:min(75vw, calc(var(--max-content-width) * 0.748));
-    overflow-y:auto;
-    white-space:nowrap;
-    box-shadow: 0 3px 6px rgba(0,0,0,0.16), 0 3px 6px rgba(0,0,0,0.23);
-    overscroll-behavior: contain;
-}
-ul.ui-autocomplete {
-    position:fixed;
-    z-index:10;
-    background-color: var(--body-background-color);
-}
-ul.ui-autocomplete li {
-    float:left;
-    clear:both;
-    min-width:100%;
-    box-sizing: border-box;
-}
-ul.ui-autocomplete li.ui-static-link {
-    position:sticky;
-    bottom:0;
-    left:0;
-    background: var(--subnav-background-color);
-    padding: 5px 0;
-    font-family: var(--body-font-family);
-    font-size: 0.93em;
-    font-weight: bold;
-    z-index: 10;
-}
-li.ui-static-link a, li.ui-static-link a:visited {
-    text-decoration:none;
-    color:var(--link-color);
-    float:right;
-    margin-right:20px;
-}
-.ui-autocomplete > li.result-item:nth-child(even) {
-    background-color: var(--even-row-color)
-}
-.ui-autocomplete > li.result-item:nth-child(odd) {
-    background-color: var(--odd-row-color)
-}
-.ui-autocomplete {
-    display: grid;
-    grid-template-columns: auto auto;
-}
-.ui-autocomplete > li,
-.ui-autocomplete > li > a {
-    grid-column: 1 / 3;
-}
-.ui-autocomplete > li.result-item,
-.ui-autocomplete > li.result-item > a {
-    display: grid;
-    grid-template-columns: subgrid;
-}
-.ui-autocomplete > li.result-item {
-    font-family: var(--body-font-family);
-    font-size: var(--body-font-size);
-    line-height: 1.7;
-}
-.ui-autocomplete .search-result-label {
-    padding: 1px 4px;
-    color: var(--block-text-color);
-    overflow: hidden;
-    text-overflow: ellipsis;
-}
-.ui-autocomplete .search-result-desc {
-    font-size: var(--nav-font-size);
-    padding: 2px 4px;
-    color: var(--block-text-color);
-    overflow: hidden;
-    text-overflow: ellipsis;
-}
-.ui-autocomplete .result-highlight {
-    font-weight:bold;
-}
-.ui-menu .ui-state-active .search-result-label,
-.ui-menu .ui-state-active .search-result-desc {
-    color: var(--selected-text-color);
-}
-.ui-menu .ui-menu-item-wrapper {
-    padding: 3px 4px;
-}
 input[type="text"] {
     background-image:var(--glass-svg);
     background-size:13px;
@@ -1184,8 +1090,9 @@ input#page-search-input {
     margin: 10px 0;
 }
 input#search-input {
-    width: 270px;
+    width: 300px;
     margin: 0;
+    position: relative;
 }
 input.filter-input {
     min-width: 40px;
@@ -1205,6 +1112,7 @@ input#reset-search, input.reset-filter, input#page-search-reset {
     min-height:12px;
     font-size:0;
     visibility:hidden;
+    cursor: pointer;
 }
 input#reset-search {
     position:absolute;
@@ -1236,6 +1144,9 @@ select {
     background: #f0f0f0;
     border: 1px solid #909090;
 }
+select#search-modules {
+    margin: 0 10px 10px 8px;
+}
 kbd {
     background-color: #eeeeee;
     color: #282828;
@@ -1262,56 +1173,149 @@ section.class-description h1 > span:target {
 details.page-search-details {
     display: inline-block;
 }
-div#result-container {
+div#search-result-container {
     font-size: 1em;
 }
-#result-container .result-highlight {
-    font-weight:bold;
+#search-result-container .result-highlight {
+    font-weight: bold;
 }
-#result-container div.result-table {
+#search-result-container div.result-table {
     display: grid;
     grid-template-columns: minmax(40%, max-content) minmax(40%, auto);
 }
-#result-container div.result-table > div.table-header,
-#result-container div.result-table > a.search-result-link {
+#search-result-container div.result-table > div.table-header,
+#search-result-container div.result-table > a.search-result-link {
     display: grid;
     grid-template-columns: subgrid;
     grid-column: 1 / 3;
     margin: 0;
 }
-#result-container div.result-table > div.table-header > span {
+#search-result-container div.result-table > div.table-header > span {
     padding: 5px 12px;
     font-size: 0.93em;
     background-color: var(--subnav-background-color);
 }
-#result-container div.result-table > a.search-result-link > span {
+#search-result-container a.search-result-link > span {
     padding: 8px 12px;
 }
-#result-container div.result-table > a.search-result-link:nth-child(odd) {
+#search-result-container a.search-result-link:nth-child(odd) {
     background-color: var(--odd-row-color)
 }
-#result-container div.result-table > a.search-result-link:nth-child(even) {
+#search-result-container a.search-result-link:nth-child(even) {
     background-color: var(--even-row-color)
 }
-#result-container div.result-table > a.search-result-link {
+#search-result-container a.search-result-link {
     color: var(--block-text-color);
     white-space: nowrap;
 }
-#result-container div.result-table > a.search-result-link:focus-visible,
-#result-container div.result-table > a.search-result-link.selected {
+#search-result-container a.search-result-link:hover {
+    background-color: var(--search-hover-background);
+}
+#search-result-container a.search-result-link:focus-visible,
+#search-result-container a.search-result-link.selected {
     background-color: var(--selected-background-color);
     color: var(--selected-text-color);
     outline: none;
 }
-#result-container div.result-table > a.search-result-link .search-result-label {
+#search-result-container a.search-result-link .search-result-label {
     overflow: hidden;
     text-overflow: ellipsis;
 }
-#result-container div.result-table > a.search-result-link .search-result-desc {
+#search-result-container a.search-result-link .search-result-desc {
     font-size: var(--nav-font-size);
     overflow: hidden;
     text-overflow: ellipsis;
 }
+div.overlay {
+    position: fixed;
+    left:0;
+    top: 0;
+    width: 100%;
+    height: 100%;
+    background: var(--overlay-background);
+    z-index: 3;
+    backdrop-filter: blur(0.3px);
+}
+div.sub-nav div.search-form {
+    display: grid;
+    grid-template-columns: auto min-content;
+    place-items: start end;
+    padding-top: 5px;
+}
+div.sub-nav div.search-form > div:has(label) {
+    padding: 10px 8px 7px 10px;
+}
+div.sub-nav div.search-form div#search-input-container {
+    position: relative;
+    padding: 1px 0;
+    margin-right: 9px;
+    margin-top: 3.5px;
+}
+div.sub-nav div.search-form > div:has(select) {
+    place-self: start;
+    padding: 0;
+    margin-top: 4px;
+}
+div.sub-nav div.search-form select#search-modules {
+    margin: 2px 0;
+}
+div.sub-nav div#search-result-section {
+    display: none;
+    position: absolute;
+    right: 5px;
+    top: -5px;
+    max-width: min(75vw, calc(var(--max-content-width) * 0.75));
+    z-index: 7;
+    background-color: var(--toc-background-color);
+    color: var(--body-text-color);
+    border: 1px solid var(--border-color);
+    border-radius: 4px;
+    box-shadow: 0 3px 12px rgba(0,0,0,0.16), 0 3px 9px rgba(0,0,0,0.23);
+}
+div.sub-nav #search-result-container a.search-result-link {
+    display: grid;
+    grid-template-columns: subgrid;
+    grid-column: 1 / 3;
+    padding: 5px;
+}
+div.sub-nav #search-result-container a.search-result-link > span {
+    padding: 4px 8px;
+}
+div.sub-nav div#search-result-section:has(button.active-table-tab) {
+    width: calc(var(--max-content-width) * 0.75);
+}
+div.sub-nav div#search-result-section div.table-tabs {
+    padding-left: 3px;
+}
+div.sub-nav div.search-links {
+    display: grid;
+    grid-template-columns: auto auto;
+    background-color: var(--subnav-background-color);
+    color: var(--subnav-link-color);
+    margin-top: 6px;
+}
+div.sub-nav div.search-links > div {
+    padding: 10px;
+    font-size: var(--nav-font-size);
+}
+div.sub-nav div.search-links > div:first-child {
+    justify-self: start;
+}
+div.sub-nav div.search-links > div:last-child {
+    justify-self: end;
+}
+div.sub-nav div#search-result-container .result-table {
+    max-height: calc(96vh - var(--nav-height) - 110px);
+    overflow-y: scroll;
+    overscroll-behavior: contain;
+    margin-top: 3px;
+}
+div.sub-nav div#search-result-container .result-table:has(div.table-tabs) {
+    max-height: calc(96vh - var(--nav-height) - 74px);
+}
+div.sub-nav div#search-result-container > p {
+    text-align: center;
+}
 .page-search-info {
     background-color: var(--subnav-background-color);
     border-radius: 3px;
@@ -1647,7 +1651,13 @@ table.striped > tbody > tr > th {
 }
 @media screen and (max-width: 1200px) {
     input#search-input {
-        width: 22.5vw;
+        width: 25vw;
+    }
+    .sub-nav .nav-list-search {
+        width: calc(25vw + 42px);
+    }
+    div.sub-nav select#search-modules {
+        max-width: calc(25vw + 50px);
     }
 }
 @media screen and (max-width: 1000px) {
@@ -1739,26 +1749,20 @@ table.striped > tbody > tr > th {
         transform-origin: 10% 90%;
         width: 26px;
     }
-    .ui-autocomplete {
+    #search-result-container div.result-table {
         display: block;
         grid-template-columns: none;
     }
-    .ui-autocomplete > li,
-    .ui-autocomplete > li > a,
-    .ui-autocomplete > li.result-item,
-    .ui-autocomplete > li.result-item > a {
+    #search-result-container div.result-table > a.search-result-link > span {
         grid-column: unset;
         display: block;
         grid-template-columns: none;
     }
-    .ui-autocomplete > li.result-item {
-        line-height: 1.45;
+    #search-result-container div.result-table > a.search-result-link > span {
+        padding: 3px 8px;
     }
-    .ui-autocomplete .search-result-label {
-        display: block;
-    }
-    .ui-autocomplete .search-result-desc {
-        display: block;
+    #search-result-container div.result-table > a.search-result-link {
+        padding: 3px 5px;
     }
     .top-nav nav.toc .toc-sort-toggle {
         background: transparent;
@@ -1779,6 +1783,12 @@ table.striped > tbody > tr > th {
     body {
         -webkit-text-size-adjust: none;
     }
+    div.sub-nav div#search-result-section {
+        max-width: 97vw;
+    }
+    div.sub-nav div#search-result-section:has(button.active-table-tab) {
+        width: calc(var(--max-content-width) * 0.9);
+    }
 }
 @media screen and (max-width: 600px) {
     .nav-list-search > a {
@@ -1791,7 +1801,13 @@ table.striped > tbody > tr > th {
         white-space: pre-wrap;
     }
     input#search-input {
-        width: 18vw;
+        width: calc(18vw + 30px);
+    }
+    .sub-nav .nav-list-search {
+        width: calc(18vw + 72px);
+    }
+    div.sub-nav select#search-modules {
+        max-width: calc(18vw + 68px);
     }
     .inherited-list h3 {
         overflow: auto clip;
diff --git a/src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclets/toolkit/resources/doclets.properties b/src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclets/toolkit/resources/doclets.properties
index 6a15025044a..9d670fe6f95 100644
--- a/src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclets/toolkit/resources/doclets.properties
+++ b/src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclets/toolkit/resources/doclets.properties
@@ -1,5 +1,5 @@
 #
-# Copyright (c) 2010, 2025, Oracle and/or its affiliates. All rights reserved.
+# Copyright (c) 2010, 2026, Oracle and/or its affiliates. All rights reserved.
 # DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
 #
 # This code is free software; you can redistribute it and/or modify it
@@ -376,8 +376,10 @@ doclet.search.many_results=Found {0} results
 doclet.search.loading=Loading search index...
 doclet.search.searching=Searching...
 doclet.search.redirecting=Redirecting to first result...
-# {0} is a select input containing all_modules message below and module names
-doclet.search.in=in {0}
+# Used as label for the search input field
+doclet.search.for=Search for
+# Used as label for the module select control which defaults to doclet.search.all_modules
+doclet.search.in_modules=in
 doclet.search.all_modules=all modules
 doclet.search.modules=Modules
 doclet.search.packages=Packages
@@ -385,7 +387,8 @@ doclet.search.classes_and_interfaces=Classes and Interfaces
 doclet.search.types=Types
 doclet.search.members=Members
 doclet.search.search_tags=Search Tags
-doclet.search.linkSearchPageLabel=Go to search page
+doclet.search.linkSearchPageLabel=Search page
+doclet.search.linkSearchHelpLabel=Search help
 
 doclet.snippet.contents.none=\
  @snippet does not specify contents
diff --git a/src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclets/toolkit/util/DocPaths.java b/src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclets/toolkit/util/DocPaths.java
index f5672dcbf96..94ad8624367 100644
--- a/src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclets/toolkit/util/DocPaths.java
+++ b/src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclets/toolkit/util/DocPaths.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1998, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1998, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -133,20 +133,8 @@ public class DocPaths {
     /** The name of the syntax highlighting script file. */
     public static final DocPath HIGHLIGHT_JS = DocPath.create("highlight.js");
 
-    /** The name of the default jQuery directory. */
-    public static final DocPath JQUERY_DIR = DocPath.create("jquery");
-
-    /** The name of the default jQuery javascript file. */
-    public static final DocPath JQUERY_JS = DocPath.create("jquery-3.7.1.min.js");
-
-    /** The name of the default jQuery UI stylesheet file. */
-    public static final DocPath JQUERY_UI_CSS = DocPath.create("jquery-ui.min.css");
-
-    /** The name of the default jQuery UI javascript file. */
-    public static final DocPath JQUERY_UI_JS = DocPath.create("jquery-ui.min.js");
-
-    /** The name of the default jQuery file for legal notices. */
-    public static final DocPath JQUERY_MD = DocPath.create("jquery.md");
+    /** The name of the dejavu file for legal notices. */
+    public static final DocPath DEJAVU_MD = DocPath.create("dejavufonts.md");
 
     /** The name of the directory for legal files. */
     public static final DocPath LEGAL = DocPath.create("legal");
@@ -342,9 +330,6 @@ public class DocPaths {
     /** The name of the template for the search javascript file. */
     public static final DocPath SEARCH_JS_TEMPLATE = DocPath.create("search.js.template");
 
-    /** The name of the search javascript file. */
-    public static final DocPath SEARCH_PAGE_JS = DocPath.create("search-page.js");
-
     /** The name of the file for the serialized form info. */
     public static final DocPath SERIALIZED_FORM = DocPath.create("serialized-form.html");
 
diff --git a/src/jdk.javadoc/share/legal/jquery.md b/src/jdk.javadoc/share/legal/jquery.md
deleted file mode 100644
index a763ec6f187..00000000000
--- a/src/jdk.javadoc/share/legal/jquery.md
+++ /dev/null
@@ -1,26 +0,0 @@
-## jQuery v3.7.1
-
-### jQuery License
-```
-jQuery v 3.7.1
-Copyright OpenJS Foundation and other contributors, https://openjsf.org/
-
-Permission is hereby granted, free of charge, to any person obtaining
-a copy of this software and associated documentation files (the
-"Software"), to deal in the Software without restriction, including
-without limitation the rights to use, copy, modify, merge, publish,
-distribute, sublicense, and/or sell copies of the Software, and to
-permit persons to whom the Software is furnished to do so, subject to
-the following conditions:
-
-The above copyright notice and this permission notice shall be
-included in all copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
-EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
-MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
-NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
-LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
-OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
-WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
-```
diff --git a/src/jdk.javadoc/share/legal/jqueryUI.md b/src/jdk.javadoc/share/legal/jqueryUI.md
deleted file mode 100644
index 46bfbaa5c54..00000000000
--- a/src/jdk.javadoc/share/legal/jqueryUI.md
+++ /dev/null
@@ -1,49 +0,0 @@
-## jQuery UI v1.14.1
-
-### jQuery UI License
-```
-Copyright OpenJS Foundation and other contributors, https://openjsf.org/
-
-This software consists of voluntary contributions made by many
-individuals. For exact contribution history, see the revision history
-available at https://github.com/jquery/jquery-ui
-
-The following license applies to all parts of this software except as
-documented below:
-
-====
-
-Permission is hereby granted, free of charge, to any person obtaining
-a copy of this software and associated documentation files (the
-"Software"), to deal in the Software without restriction, including
-without limitation the rights to use, copy, modify, merge, publish,
-distribute, sublicense, and/or sell copies of the Software, and to
-permit persons to whom the Software is furnished to do so, subject to
-the following conditions:
-
-The above copyright notice and this permission notice shall be
-included in all copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
-EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
-MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
-NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
-LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
-OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
-WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
-
-====
-
-Copyright and related rights for sample code are waived via CC0. Sample
-code is defined as all source code contained within the demos directory.
-
-CC0: http://creativecommons.org/publicdomain/zero/1.0/
-
-====
-
-All files located in the node_modules and external directories are
-externally maintained libraries used by this software which have their
-own licenses; we recommend you read them, as their terms may differ from
-the terms above.
-
-```
diff --git a/test/langtools/jdk/javadoc/doclet/checkLibraryVersions/CheckLibraryVersions.java b/test/langtools/jdk/javadoc/doclet/checkLibraryVersions/CheckLibraryVersions.java
index f36ef92109a..0ca77c4d732 100644
--- a/test/langtools/jdk/javadoc/doclet/checkLibraryVersions/CheckLibraryVersions.java
+++ b/test/langtools/jdk/javadoc/doclet/checkLibraryVersions/CheckLibraryVersions.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2022, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2022, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,7 +23,7 @@
 
 /*
  * @test
- * @bug 8293177 8324774 8357458
+ * @bug 8293177 8324774 8357458 8378228
  * @summary Verify version numbers in legal files
  * @library /test/lib
  * @build jtreg.SkippedException
@@ -54,8 +54,6 @@ public class CheckLibraryVersions {
     //  %V is replaced with the version string
     //  %M is replaced twice, once with an empty string and once with ".min"
     static final Map<String, List<String>> libraries = Map.of(
-            "jquery.md", List.of("jquery/jquery-%V%M.js"),
-            "jqueryUI.md", List.of("jquery/jquery-ui%M.js", "jquery/jquery-ui%M.css"),
             "dejavufonts.md", List.of("fonts/dejavu.css"),
             "highlightjs.md", List.of("highlight.js")
     );
diff --git a/test/langtools/jdk/javadoc/doclet/checkStylesheetClasses/CheckStylesheetClasses.java b/test/langtools/jdk/javadoc/doclet/checkStylesheetClasses/CheckStylesheetClasses.java
index 6740bace528..56109d70009 100644
--- a/test/langtools/jdk/javadoc/doclet/checkStylesheetClasses/CheckStylesheetClasses.java
+++ b/test/langtools/jdk/javadoc/doclet/checkStylesheetClasses/CheckStylesheetClasses.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2021, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2021, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -24,7 +24,7 @@
 
 /*
  * @test
- * @bug 8267574
+ * @bug 8267574 8378228
  * @summary check stylesheet names against HtmlStyle
  * @modules jdk.javadoc/jdk.javadoc.internal.html
  *          jdk.javadoc/jdk.javadoc.internal.doclets.formats.html.markup
@@ -136,12 +136,11 @@ public class CheckStylesheetClasses {
         // for doc-comment authors; maybe worthy of inclusion in HtmlStyle, just to be documented
         removeAll(styleSheetNames, "borderless", "plain", "striped");
 
-        // used in search.js and search-page.js; may be worth documenting in HtmlStyle
-        removeAll(styleSheetNames, "result-highlight", "result-item", "anchor-link", "expanded",
-                "page-search-header", "result-table", "ui-autocomplete", "ui-autocomplete-category",
-                "ui-state-active", "ui-menu", "ui-menu-item-wrapper", "ui-static-link",
-                "search-result-desc", "search-result-label", "search-result-link", "selected",
-                "sort-asc", "sort-desc", "two-column-search-results", "visible");
+        // used in search.js; may be worth documenting in HtmlStyle
+        removeAll(styleSheetNames, "result-highlight", "anchor-link", "expanded", "overlay",
+                "page-search-header", "result-table", "search-result-desc", "search-result-label",
+                "search-result-link", "selected", "sort-asc", "sort-desc", "two-column-search-results",
+                "visible");
 
         // very JDK specific
         styleSheetNames.remove("module-graph");
diff --git a/test/langtools/jdk/javadoc/doclet/testFonts/TestFonts.java b/test/langtools/jdk/javadoc/doclet/testFonts/TestFonts.java
index 647ae9d8cdd..538eea6b1ff 100644
--- a/test/langtools/jdk/javadoc/doclet/testFonts/TestFonts.java
+++ b/test/langtools/jdk/javadoc/doclet/testFonts/TestFonts.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2024, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2024, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -113,7 +113,6 @@ public class TestFonts extends JavadocTester {
         checkExit(Exit.OK);
         checkFiles(true, "resource-files/copy.svg",
                 "resource-files/glass.svg",
-                "resource-files/jquery-ui.min.css",
                 "resource-files/link.svg",
                 "resource-files/stylesheet.css",
                 "resource-files/x.svg");
diff --git a/test/langtools/jdk/javadoc/doclet/testPassthruFiles/TestPassThruFiles.java b/test/langtools/jdk/javadoc/doclet/testPassthruFiles/TestPassThruFiles.java
index 71d683b2d54..eab9cf19ea8 100644
--- a/test/langtools/jdk/javadoc/doclet/testPassthruFiles/TestPassThruFiles.java
+++ b/test/langtools/jdk/javadoc/doclet/testPassthruFiles/TestPassThruFiles.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2024, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2024, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,7 +23,7 @@
 
 /*
  * @test
- * @bug      8323628 8351626
+ * @bug      8323628 8351626 8378228
  * @summary  Update license on "pass-through" files
  * @library  /tools/lib ../../lib
  * @modules jdk.javadoc/jdk.javadoc.internal.tool
@@ -62,8 +62,7 @@ public class TestPassThruFiles extends JavadocTester {
         var files = List.of(
                 "resource-files/stylesheet.css",
                 "script-files/script.js",
-                "script-files/search.js",
-                "script-files/search-page.js"
+                "script-files/search.js"
         );
 
         for (var f : files) {
@@ -113,7 +112,6 @@ public class TestPassThruFiles extends JavadocTester {
      */
     private boolean requiresCheck(Path p) {
         var fn = p.getFileName().toString();
-        return !fn.startsWith("jquery")
-                && !fn.endsWith(".svg");
+        return !fn.endsWith(".svg");
     }
 }
diff --git a/test/langtools/jdk/javadoc/doclet/testSearch/TestSearch.java b/test/langtools/jdk/javadoc/doclet/testSearch/TestSearch.java
index 00c2f017909..18041f61a5c 100644
--- a/test/langtools/jdk/javadoc/doclet/testSearch/TestSearch.java
+++ b/test/langtools/jdk/javadoc/doclet/testSearch/TestSearch.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2015, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2015, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -26,7 +26,7 @@
  * @bug 8141492 8071982 8141636 8147890 8166175 8168965 8176794 8175218 8147881
  *      8181622 8182263 8074407 8187521 8198522 8182765 8199278 8196201 8196202
  *      8184205 8214468 8222548 8223378 8234746 8241219 8254627 8247994 8263528
- *      8266808 8248863 8305710 8318082 8347058 8350638 8345555
+ *      8266808 8248863 8305710 8318082 8347058 8350638 8345555 8378228
  * @summary Test the search feature of javadoc.
  * @library ../../lib
  * @modules jdk.javadoc/jdk.javadoc.internal.tool
@@ -57,7 +57,7 @@ public class TestSearch extends JavadocTester {
                 testSrc("UnnamedPkgClass.java"));
         checkExit(Exit.OK);
         checkSearchOutput("UnnamedPkgClass.html", true);
-        checkJqueryAndImageFiles(true);
+        checkImageFiles(true);
         checkSearchJS();
         checkFiles(true,
                 "member-search-index.js",
@@ -81,7 +81,7 @@ public class TestSearch extends JavadocTester {
         checkSingleIndex();
         checkSingleIndexSearchTagDuplication();
         checkSearchTagIndex();
-        checkJqueryAndImageFiles(true);
+        checkImageFiles(true);
         checkSearchJS();
         checkAllPkgsAllClasses();
         checkFiles(true,
@@ -106,7 +106,7 @@ public class TestSearch extends JavadocTester {
         checkSingleIndex();
         checkSingleIndexSearchTagDuplication();
         checkSearchTagIndex();
-        checkJqueryAndImageFiles(true);
+        checkImageFiles(true);
         checkSearchJS();
         checkFiles(true,
                 "member-search-index.js",
@@ -126,7 +126,7 @@ public class TestSearch extends JavadocTester {
                 "pkg", "pkg1", "pkg2", "pkg3");
         checkExit(Exit.OK);
         checkSearchOutput(false);
-        checkJqueryAndImageFiles(false);
+        checkImageFiles(false);
         checkFiles(false,
                 "member-search-index.js",
                 "package-search-index.js",
@@ -151,7 +151,7 @@ public class TestSearch extends JavadocTester {
         checkSearchOutput(true);
         checkSingleIndex();
         checkSingleIndexSearchTagDuplication();
-        checkJqueryAndImageFiles(true);
+        checkImageFiles(true);
         checkSearchJS();
         checkFiles(true,
                 "member-search-index.js",
@@ -172,7 +172,7 @@ public class TestSearch extends JavadocTester {
                 "pkg", "pkg1", "pkg2", "pkg3");
         checkExit(Exit.OK);
         checkSearchOutput(false);
-        checkJqueryAndImageFiles(false);
+        checkImageFiles(false);
         checkFiles(false,
                 "member-search-index.js",
                 "package-search-index.js",
@@ -194,7 +194,7 @@ public class TestSearch extends JavadocTester {
         checkExit(Exit.OK);
         checkSearchOutput(true);
         checkIndexNoComment();
-        checkJqueryAndImageFiles(true);
+        checkImageFiles(true);
         checkSearchJS();
         checkFiles(true,
                 "member-search-index.js",
@@ -216,7 +216,7 @@ public class TestSearch extends JavadocTester {
         checkExit(Exit.OK);
         checkSearchOutput(true);
         checkIndexNoDeprecated();
-        checkJqueryAndImageFiles(true);
+        checkImageFiles(true);
         checkSearchJS();
         checkFiles(true,
                 "member-search-index.js",
@@ -239,7 +239,7 @@ public class TestSearch extends JavadocTester {
         checkSearchOutput(true);
         checkSplitIndex();
         checkSplitIndexSearchTagDuplication();
-        checkJqueryAndImageFiles(true);
+        checkImageFiles(true);
         checkSearchJS();
         checkFiles(true,
                 "member-search-index.js",
@@ -261,7 +261,7 @@ public class TestSearch extends JavadocTester {
         checkExit(Exit.OK);
         checkSearchOutput(true);
         checkJavaFXOutput();
-        checkJqueryAndImageFiles(true);
+        checkImageFiles(true);
         checkSearchJS();
         checkFiles(true,
                 "member-search-index.js",
@@ -417,14 +417,6 @@ public class TestSearch extends JavadocTester {
     void checkSearchOutput(String fileName, boolean expectedOutput) {
         // Test for search related markup
         checkOutput(fileName, expectedOutput,
-                """
-                    <link rel="stylesheet" type="text/css" href="resource-files/jquery-ui.min.css">
-                    """,
-                """
-                    <script type="text/javascript" src="script-files/jquery-3.7.1.min.js"></script>
-                    """,
-                """
-                    <script type="text/javascript" src="script-files/jquery-ui.min.js"></script>""",
                 """
                     const pathtoroot = "./";
                     loadScripts();
@@ -437,6 +429,10 @@ public class TestSearch extends JavadocTester {
                     holder="Search documentation (type /)" aria-label="Search in documentation" auto\
                     complete="off" spellcheck="false"><input type="reset" id="reset-search" disabled\
                      value="Reset"></div>""");
+        checkOutput(fileName, false,
+                "jquery-ui.min.css",
+                "jquery-3.7.1.min.js",
+                "jquery-ui.min.js");
     }
 
     void checkSingleIndex() {
@@ -669,14 +665,15 @@ public class TestSearch extends JavadocTester {
                 "AnotherClass.java:68: warning: invalid usage of tag {@index");
     }
 
-    void checkJqueryAndImageFiles(boolean expectedOutput) {
+    void checkImageFiles(boolean expectedOutput) {
         checkFiles(expectedOutput,
                 "script-files/search.js",
-                "script-files/jquery-3.7.1.min.js",
-                "script-files/jquery-ui.min.js",
-                "resource-files/jquery-ui.min.css",
                 "resource-files/x.svg",
                 "resource-files/glass.svg");
+        checkFiles(false,
+                "script-files/jquery-3.7.1.min.js",
+                "script-files/jquery-ui.min.js",
+                "resource-files/jquery-ui.min.css");
     }
 
     void checkSearchJS() {
@@ -689,9 +686,7 @@ public class TestSearch extends JavadocTester {
                 "function getURLPrefix(item, category) {",
                 "url += item.l;");
 
-        checkOutput("script-files/search-page.js", true,
-                "function renderResults(result) {",
-                "function selectTab(category) {");
+        checkFiles(false, "script-files/search-page.js");
 
         checkCssClasses("script-files/search.js", "resource-files/stylesheet.css");
     }
@@ -701,8 +696,8 @@ public class TestSearch extends JavadocTester {
         // are also defined as class selectors somewhere in the stylesheet file.
         String js = readOutputFile(jsFile);
         Set<String> cssClasses = new TreeSet<>();
-        addMatches(js, Pattern.compile("class=\\\\*\"([^\\\\\"]+)\\\\*\""), cssClasses);
-        addMatches(js, Pattern.compile("attr\\(\"class\", \"([^\"]+)\"\\)"), cssClasses);
+        addMatches(js, Pattern.compile("class=[\"']([-\\w]+)[\"']"), cssClasses);
+        addMatches(js, Pattern.compile("classList.add\\([\"']([-\\w]+)[\"']\\)"), cssClasses);
         // verify that the regex did find use of CSS class names
         checking("Checking CSS classes found");
         if (cssClasses.isEmpty()) {
diff --git a/test/langtools/jdk/javadoc/doclet/testStylesheet/TestStylesheet.java b/test/langtools/jdk/javadoc/doclet/testStylesheet/TestStylesheet.java
index 012e9ce00de..a2c2a603212 100644
--- a/test/langtools/jdk/javadoc/doclet/testStylesheet/TestStylesheet.java
+++ b/test/langtools/jdk/javadoc/doclet/testStylesheet/TestStylesheet.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2005, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2005, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -132,6 +132,7 @@ public class TestStylesheet extends JavadocTester {
                         min-height:12px;
                         font-size:0;
                         visibility:hidden;
+                        cursor: pointer;
                     }""",
                 """
                     ::placeholder {
diff --git a/test/langtools/jdk/javadoc/tool/api/basic/APITest.java b/test/langtools/jdk/javadoc/tool/api/basic/APITest.java
index 71908f34e99..bd8d0cf7953 100644
--- a/test/langtools/jdk/javadoc/tool/api/basic/APITest.java
+++ b/test/langtools/jdk/javadoc/tool/api/basic/APITest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2012, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2012, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -207,7 +207,6 @@ class APITest {
             "resource-files/copy.svg",
             "resource-files/down.svg",
             "resource-files/glass.svg",
-            "resource-files/jquery-ui.min.css",
             "resource-files/left.svg",
             "resource-files/link.svg",
             "resource-files/moon.svg",
@@ -241,11 +240,8 @@ class APITest {
             "resource-files/fonts/DejaVuLGCSerif-Italic.woff2",
             "resource-files/fonts/DejaVuLGCSerif.woff",
             "resource-files/fonts/DejaVuLGCSerif.woff2",
-            "script-files/jquery-3.7.1.min.js",
-            "script-files/jquery-ui.min.js",
             "script-files/script.js",
             "script-files/search.js",
-            "script-files/search-page.js",
             "tag-search-index.js",
             "type-search-index.js"
     ));
@@ -255,11 +251,8 @@ class APITest {
                             !s.endsWith("-search-index.js")
                          && !s.equals("index-all.html")
                          && !s.equals("resource-files/glass.svg")
-                         && !s.equals("resource-files/jquery-ui.min.css")
                          && !s.equals("resource-files/x.svg")
-                         && !s.startsWith("script-files/jquery-")
                          && !s.equals("script-files/search.js")
-                         && !s.equals("script-files/search-page.js")
                          && !s.equals("search.html")
                          && !s.equals("allclasses-index.html")
                          && !s.equals("allpackages-index.html")

From 0acc1d1e4fac4de6b48ed05ba0d83c1170bc4389 Mon Sep 17 00:00:00 2001
From: Quan Anh Mai <qamai@openjdk.org>
Date: Mon, 13 Apr 2026 06:55:13 +0000
Subject: [PATCH 566/655] 8377163: C2: Iteration split must take into
 consideration sunk stores

Reviewed-by: chagedorn, dfenacci
---
 src/hotspot/share/opto/loopTransform.cpp      |  36 +++++-
 .../TestIterationSplitWithSunkStores.java     | 112 ++++++++++++++++++
 2 files changed, 144 insertions(+), 4 deletions(-)
 create mode 100644 test/hotspot/jtreg/compiler/loopopts/TestIterationSplitWithSunkStores.java

diff --git a/src/hotspot/share/opto/loopTransform.cpp b/src/hotspot/share/opto/loopTransform.cpp
index 80b17efb998..60a61b6bb4e 100644
--- a/src/hotspot/share/opto/loopTransform.cpp
+++ b/src/hotspot/share/opto/loopTransform.cpp
@@ -35,7 +35,9 @@
 #include "opto/loopnode.hpp"
 #include "opto/movenode.hpp"
 #include "opto/mulnode.hpp"
+#include "opto/node.hpp"
 #include "opto/opaquenode.hpp"
+#include "opto/opcodes.hpp"
 #include "opto/phase.hpp"
 #include "opto/predicates.hpp"
 #include "opto/rootnode.hpp"
@@ -1774,13 +1776,39 @@ Node *PhaseIdealLoop::insert_post_loop(IdealLoopTree* loop, Node_List& old_new,
   for (DUIterator i = main_head->outs(); main_head->has_out(i); i++) {
     Node* main_phi = main_head->out(i);
     if (main_phi->is_Phi() && main_phi->in(0) == main_head && main_phi->outcnt() > 0) {
-      Node* cur_phi = old_new[main_phi->_idx];
+      Node* post_phi = old_new[main_phi->_idx];
+      Node* loopback_input = main_phi->in(LoopNode::LoopBackControl);
       Node* fallnew = clone_up_backedge_goo(main_head->back_control(),
                                             post_head->init_control(),
-                                            main_phi->in(LoopNode::LoopBackControl),
+                                            loopback_input,
                                             visited, clones);
-      _igvn.hash_delete(cur_phi);
-      cur_phi->set_req(LoopNode::EntryControl, fallnew);
+      // Technically, the entry value of post_phi must be the loop back input of the corresponding
+      // Phi of the outer loop, not the Phi of the inner loop (i.e. main_phi). However, we have not
+      // constructed the Phis for the OuterStripMinedLoop yet, so the input must be inferred from
+      // the loop back input of main_phi.
+      // - If post_phi is a data Phi, then we can use the loop back input of main_phi.
+      // - If post_phi is a memory Phi, since Stores can be sunk below the inner loop, but still
+      //   inside the outer loop, we have 2 cases:
+      //   + If the loop back input of main_phi is on the backedge, then the entry input of
+      //     post_phi is the clone of the node on the entry of post_head, similar to when post_phi
+      //     is a data Phi.
+      //   + If the loop back input of main_phi is not on the backedge, we need to find whether
+      //     there is a sunk Store corresponding to post_phi, if there is any, the latest such
+      //     store will be the entry input of post_phi. Fortunately, the safepoint at the exit of
+      //     the outer loop captures all memory states, so we can use it as the entry input of
+      //     post_phi.
+      //   Another way to see it is that, the memory phi should capture the latest state at the
+      //   post-loop entry. If loopback_input is cloned by clone_up_backedge_goo, it is pinned at
+      //   the post-loop entry, and is surely the latest state. Otherwise, the latest memory state
+      //   corresponding to post_phi is the memory state at the exit of the outer main-loop, which
+      //   is captured by the safepoint there.
+      if (main_head->is_strip_mined() && fallnew == loopback_input && post_phi->is_memory_phi()) {
+        SafePointNode* main_safepoint = main_head->outer_safepoint();
+        assert(main_safepoint != nullptr, "outer loop must have a safepoint");
+        fallnew = main_safepoint->memory();
+      }
+      _igvn.hash_delete(post_phi);
+      post_phi->set_req(LoopNode::EntryControl, fallnew);
     }
   }
   // Store nodes that were moved to the outer loop by PhaseIdealLoop::try_move_store_after_loop
diff --git a/test/hotspot/jtreg/compiler/loopopts/TestIterationSplitWithSunkStores.java b/test/hotspot/jtreg/compiler/loopopts/TestIterationSplitWithSunkStores.java
new file mode 100644
index 00000000000..7138f22beec
--- /dev/null
+++ b/test/hotspot/jtreg/compiler/loopopts/TestIterationSplitWithSunkStores.java
@@ -0,0 +1,112 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+package compiler.loopopts;
+
+import java.util.Objects;
+import jdk.internal.misc.Unsafe;
+
+/*
+ * @test
+ * @bug 8377163
+ * @summary Iteration splitting a counted loop with sunk stores should connect the memory phi of
+ *          the post loop to the sunk store in the main loop, not the store at the loop back input
+ *          of the corresponding phi of the main loop.
+ * @modules java.base/jdk.internal.misc
+ * @run main ${test.main.class}
+ * @run main/othervm -Xbatch -XX:-TieredCompilation ${test.main.class}
+ */
+public class TestIterationSplitWithSunkStores {
+    private static final Unsafe U = Unsafe.getUnsafe();
+
+    public static void main(String[] args) {
+        test1();
+
+        int[] array = new int[1000];
+        MyInteger v = new MyInteger(0);
+        for (int i = 0; i < 100; i++) {
+            test2(array, v, v, v, v);
+        }
+    }
+
+    private static void test1() {
+        int[] dst = new int[5];
+        for (long i = 0L; i < 20_000; i++) {
+            test1(dst, 1);
+            for (int j = 1; j < 5; j++) {
+                if (dst[j] != j) {
+                    throw new RuntimeException("Bad copy");
+                }
+            }
+        }
+    }
+
+    private static void test1(int[] dst, int dstPos) {
+        int[] src = new int[4];
+        src[0] = new MyInteger(1).v();
+        src[1] = 2;
+        src[2] = 3;
+        src[3] = 4;
+        System.arraycopy(src, 0, dst, dstPos, 4);
+    }
+
+    private static void test2(int[] array, MyInteger v1, MyInteger v2, MyInteger v3, MyInteger v4) {
+        Objects.requireNonNull(array);
+        Objects.requireNonNull(v1);
+        Objects.requireNonNull(v2);
+        Objects.requireNonNull(v3);
+        Objects.requireNonNull(v4);
+
+        // Using Unsafe to access the array so that the stores can be sunk without loop
+        // predication. This is because store sinking is only attempted during the first and the
+        // last loop opt passes, and we need it to occur before iteration splitting.
+        for (int i = 0; i < array.length; i++) {
+            long elemOffset = Unsafe.ARRAY_INT_BASE_OFFSET + (long) i * Unsafe.ARRAY_INT_INDEX_SCALE;
+            int e = U.getInt(array, elemOffset);
+            U.putInt(array, elemOffset, e + 1);
+
+            // These 4 stores can all be sunk, but depending on the order in which they are
+            // visited, it is most likely that only some of them are actually sunk
+            v1.v = e + 1;
+            v2.v = e + 2;
+            v3.v = e + 3;
+            v4.v = e + 4;
+        }
+    }
+
+    static class MyInteger {
+        public int v;
+
+        public MyInteger(int v) {
+            for (int i = 0; i < 32; i++) {
+                if (i < 10) {
+                    this.v = v;
+                }
+            }
+            this.v = v;
+        }
+
+        public int v() {
+            return v;
+        }
+    }
+}

From 78a6aa9c7a907fe3375cd20e45bb293b5d15732e Mon Sep 17 00:00:00 2001
From: Matthias Baesken <mbaesken@openjdk.org>
Date: Mon, 13 Apr 2026 07:13:23 +0000
Subject: [PATCH 567/655] 8381937: Make exceptions in
 Java_sun_security_mscapi_CKeyPairGenerator generateCKeyPair more specific

Reviewed-by: mdoerr, lucy
---
 .../windows/native/libsunmscapi/security.cpp                | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/src/jdk.crypto.mscapi/windows/native/libsunmscapi/security.cpp b/src/jdk.crypto.mscapi/windows/native/libsunmscapi/security.cpp
index ff011dca889..5c84b929ef1 100644
--- a/src/jdk.crypto.mscapi/windows/native/libsunmscapi/security.cpp
+++ b/src/jdk.crypto.mscapi/windows/native/libsunmscapi/security.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2005, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2005, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -1375,7 +1375,7 @@ JNIEXPORT jobject JNICALL Java_sun_security_mscapi_CKeyPairGenerator_00024RSA_ge
                 PROV_RSA_FULL,
                 CRYPT_NEWKEYSET) == FALSE)
             {
-                ThrowException(env, KEY_EXCEPTION, GetLastError());
+                ThrowExceptionWithMessageAndErrcode(env, KEY_EXCEPTION, "CryptAcquireContext failure", GetLastError());
                 __leave;
             }
         }
@@ -1387,7 +1387,7 @@ JNIEXPORT jobject JNICALL Java_sun_security_mscapi_CKeyPairGenerator_00024RSA_ge
            dwFlags,
            &hKeyPair) == FALSE)
         {
-            ThrowException(env, KEY_EXCEPTION, GetLastError());
+            ThrowExceptionWithMessageAndErrcode(env, KEY_EXCEPTION, "CryptGenKey failure", GetLastError());
             __leave;
         }
 

From 909d4e758c045a0d8cea52f6a1333839f7d6c43e Mon Sep 17 00:00:00 2001
From: Matthias Baesken <mbaesken@openjdk.org>
Date: Mon, 13 Apr 2026 07:20:16 +0000
Subject: [PATCH 568/655] 8378838: Fix issues with "dead" code elimination and
 serviceability agent in libjvm.so on Linux

Reviewed-by: lucy, erikj
---
 make/autoconf/flags-cflags.m4  |  5 +----
 make/autoconf/flags-ldflags.m4 | 13 ++++++-------
 2 files changed, 7 insertions(+), 11 deletions(-)

diff --git a/make/autoconf/flags-cflags.m4 b/make/autoconf/flags-cflags.m4
index ab9cd8be19b..423654cd50a 100644
--- a/make/autoconf/flags-cflags.m4
+++ b/make/autoconf/flags-cflags.m4
@@ -544,12 +544,9 @@ AC_DEFUN([FLAGS_SETUP_CFLAGS_HELPER],
     TOOLCHAIN_CFLAGS_JVM="$TOOLCHAIN_CFLAGS_JVM -fstack-protector"
     TOOLCHAIN_CFLAGS_JDK="-fvisibility=hidden -pipe -fstack-protector"
     # reduce lib size on linux in link step, this needs also special compile flags
-    # do this on s390x also for libjvm (where serviceability agent is not supported)
     if test "x$ENABLE_LINKTIME_GC" = xtrue; then
       TOOLCHAIN_CFLAGS_JDK="$TOOLCHAIN_CFLAGS_JDK -ffunction-sections -fdata-sections"
-      if test "x$OPENJDK_TARGET_CPU" = xs390x && test "x$DEBUG_LEVEL" == xrelease; then
-        TOOLCHAIN_CFLAGS_JVM="$TOOLCHAIN_CFLAGS_JVM -ffunction-sections -fdata-sections"
-      fi
+      TOOLCHAIN_CFLAGS_JVM="$TOOLCHAIN_CFLAGS_JVM -ffunction-sections -fdata-sections"
     fi
     # technically NOT for CXX (but since this gives *worse* performance, use
     # no-strict-aliasing everywhere!)
diff --git a/make/autoconf/flags-ldflags.m4 b/make/autoconf/flags-ldflags.m4
index 7782735be25..ff10828731e 100644
--- a/make/autoconf/flags-ldflags.m4
+++ b/make/autoconf/flags-ldflags.m4
@@ -1,5 +1,5 @@
 #
-# Copyright (c) 2011, 2025, Oracle and/or its affiliates. All rights reserved.
+# Copyright (c) 2011, 2026, Oracle and/or its affiliates. All rights reserved.
 # DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
 #
 # This code is free software; you can redistribute it and/or modify it
@@ -53,16 +53,15 @@ AC_DEFUN([FLAGS_SETUP_LDFLAGS_HELPER],
     # add --icf=all (Identical Code Folding — merges identical functions)
     BASIC_LDFLAGS="-Wl,-z,defs -Wl,-z,relro -Wl,-z,now -Wl,--no-as-needed -Wl,--exclude-libs,ALL"
 
+    BASIC_LDFLAGS_JVM_ONLY=""
     # Linux : remove unused code+data in link step
     if test "x$ENABLE_LINKTIME_GC" = xtrue; then
-      if test "x$OPENJDK_TARGET_CPU" = xs390x; then
-        BASIC_LDFLAGS="$BASIC_LDFLAGS -Wl,--gc-sections"
-      else
-        BASIC_LDFLAGS_JDK_ONLY="$BASIC_LDFLAGS_JDK_ONLY -Wl,--gc-sections"
-      fi
+      # keep vtables : -Wl,--undefined-glob=_ZTV* (but this seems not to work with gold ld)
+      # so keep at least the Metadata vtable that is used in the serviceability agent
+      BASIC_LDFLAGS_JVM_ONLY="$BASIC_LDFLAGS_JVM_ONLY -Wl,--gc-sections -Wl,--undefined=_ZTV8Metadata"
+      BASIC_LDFLAGS_JDK_ONLY="$BASIC_LDFLAGS_JDK_ONLY -Wl,--gc-sections"
     fi
 
-    BASIC_LDFLAGS_JVM_ONLY=""
     LDFLAGS_LTO="-flto=auto -fuse-linker-plugin -fno-strict-aliasing $DEBUG_PREFIX_CFLAGS"
 
     LDFLAGS_CXX_PARTIAL_LINKING="$MACHINE_FLAG -r"

From efe7fd8683d1185a48b7000b132fd97241040ba8 Mon Sep 17 00:00:00 2001
From: Leo Korinth <lkorinth@openjdk.org>
Date: Mon, 13 Apr 2026 08:14:47 +0000
Subject: [PATCH 569/655] 8380163: Fix implicit conversion in
 macroAssembler_aarch64.hpp

Reviewed-by: aph, fyang
---
 .../cpu/aarch64/macroAssembler_aarch64.cpp    | 37 ++++++++++++++++---
 .../cpu/aarch64/macroAssembler_aarch64.hpp    | 21 +++--------
 2 files changed, 37 insertions(+), 21 deletions(-)

diff --git a/src/hotspot/cpu/aarch64/macroAssembler_aarch64.cpp b/src/hotspot/cpu/aarch64/macroAssembler_aarch64.cpp
index 7fa2e8086ad..7bec0a3c0ca 100644
--- a/src/hotspot/cpu/aarch64/macroAssembler_aarch64.cpp
+++ b/src/hotspot/cpu/aarch64/macroAssembler_aarch64.cpp
@@ -55,6 +55,7 @@
 #include "runtime/sharedRuntime.hpp"
 #include "runtime/stubRoutines.hpp"
 #include "utilities/globalDefinitions.hpp"
+#include "utilities/integerCast.hpp"
 #include "utilities/powerOfTwo.hpp"
 #ifdef COMPILER1
 #include "c1/c1_LIRAssembler.hpp"
@@ -2916,7 +2917,11 @@ void MacroAssembler::increment(Address dst, int value)
 
 // Push lots of registers in the bit set supplied.  Don't push sp.
 // Return the number of words pushed
-int MacroAssembler::push(unsigned int bitset, Register stack) {
+int MacroAssembler::push(RegSet regset, Register stack) {
+  if (regset.bits() == 0) {
+    return 0;
+  }
+  auto bitset = integer_cast<unsigned int>(regset.bits());
   int words_pushed = 0;
 
   // Scan bitset to accumulate register pairs
@@ -2946,7 +2951,11 @@ int MacroAssembler::push(unsigned int bitset, Register stack) {
   return count;
 }
 
-int MacroAssembler::pop(unsigned int bitset, Register stack) {
+int MacroAssembler::pop(RegSet regset, Register stack) {
+  if (regset.bits() == 0) {
+    return 0;
+  }
+  auto bitset = integer_cast<unsigned int>(regset.bits());
   int words_pushed = 0;
 
   // Scan bitset to accumulate register pairs
@@ -2978,7 +2987,11 @@ int MacroAssembler::pop(unsigned int bitset, Register stack) {
 
 // Push lots of registers in the bit set supplied.  Don't push sp.
 // Return the number of dwords pushed
-int MacroAssembler::push_fp(unsigned int bitset, Register stack, FpPushPopMode mode) {
+int MacroAssembler::push_fp(FloatRegSet regset, Register stack, FpPushPopMode mode) {
+  if (regset.bits() == 0) {
+    return 0;
+  }
+  auto bitset = integer_cast<unsigned int>(regset.bits());
   int words_pushed = 0;
   bool use_sve = false;
   int sve_vector_size_in_bytes = 0;
@@ -3091,7 +3104,11 @@ int MacroAssembler::push_fp(unsigned int bitset, Register stack, FpPushPopMode m
 }
 
 // Return the number of dwords popped
-int MacroAssembler::pop_fp(unsigned int bitset, Register stack, FpPushPopMode mode) {
+int MacroAssembler::pop_fp(FloatRegSet regset, Register stack, FpPushPopMode mode) {
+  if (regset.bits() == 0) {
+    return 0;
+  }
+  auto bitset = integer_cast<unsigned int>(regset.bits());
   int words_pushed = 0;
   bool use_sve = false;
   int sve_vector_size_in_bytes = 0;
@@ -3201,7 +3218,11 @@ int MacroAssembler::pop_fp(unsigned int bitset, Register stack, FpPushPopMode mo
 }
 
 // Return the number of dwords pushed
-int MacroAssembler::push_p(unsigned int bitset, Register stack) {
+int MacroAssembler::push_p(PRegSet regset, Register stack) {
+  if (regset.bits() == 0) {
+    return 0;
+  }
+  auto bitset = integer_cast<unsigned int>(regset.bits());
   bool use_sve = false;
   int sve_predicate_size_in_slots = 0;
 
@@ -3238,7 +3259,11 @@ int MacroAssembler::push_p(unsigned int bitset, Register stack) {
 }
 
 // Return the number of dwords popped
-int MacroAssembler::pop_p(unsigned int bitset, Register stack) {
+int MacroAssembler::pop_p(PRegSet regset, Register stack) {
+  if (regset.bits() == 0) {
+    return 0;
+  }
+  auto bitset = integer_cast<unsigned int>(regset.bits());
   bool use_sve = false;
   int sve_predicate_size_in_slots = 0;
 
diff --git a/src/hotspot/cpu/aarch64/macroAssembler_aarch64.hpp b/src/hotspot/cpu/aarch64/macroAssembler_aarch64.hpp
index 994fbe3c80f..dfba2dcff46 100644
--- a/src/hotspot/cpu/aarch64/macroAssembler_aarch64.hpp
+++ b/src/hotspot/cpu/aarch64/macroAssembler_aarch64.hpp
@@ -499,29 +499,20 @@ private:
   void mov_immediate64(Register dst, uint64_t imm64);
   void mov_immediate32(Register dst, uint32_t imm32);
 
-  int push(unsigned int bitset, Register stack);
-  int pop(unsigned int bitset, Register stack);
-
-  int push_fp(unsigned int bitset, Register stack, FpPushPopMode mode);
-  int pop_fp(unsigned int bitset, Register stack, FpPushPopMode mode);
-
-  int push_p(unsigned int bitset, Register stack);
-  int pop_p(unsigned int bitset, Register stack);
-
   void mov(Register dst, Address a);
 
 public:
 
-  void push(RegSet regs, Register stack) { if (regs.bits()) push(regs.bits(), stack); }
-  void pop(RegSet regs, Register stack) { if (regs.bits()) pop(regs.bits(), stack); }
+  int push(RegSet regset, Register stack);
+  int pop(RegSet regset, Register stack);
 
-  void push_fp(FloatRegSet regs, Register stack, FpPushPopMode mode = PushPopFull) { if (regs.bits()) push_fp(regs.bits(), stack, mode); }
-  void pop_fp(FloatRegSet regs, Register stack, FpPushPopMode mode = PushPopFull) { if (regs.bits()) pop_fp(regs.bits(), stack, mode); }
+  int push_fp(FloatRegSet regset, Register stack, FpPushPopMode mode = PushPopFull);
+  int pop_fp(FloatRegSet regset, Register stack, FpPushPopMode mode = PushPopFull);
 
   static RegSet call_clobbered_gp_registers();
 
-  void push_p(PRegSet regs, Register stack) { if (regs.bits()) push_p(regs.bits(), stack); }
-  void pop_p(PRegSet regs, Register stack) { if (regs.bits()) pop_p(regs.bits(), stack); }
+  int push_p(PRegSet regset, Register stack);
+  int pop_p(PRegSet regset, Register stack);
 
   // Push and pop everything that might be clobbered by a native
   // runtime call except rscratch1 and rscratch2.  (They are always

From e8c77d16c41b9e4569c888f87e97fa48a24f1498 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Joel=20Sikstr=C3=B6m?= <jsikstro@openjdk.org>
Date: Mon, 13 Apr 2026 08:44:51 +0000
Subject: [PATCH 570/655] 8381900: Test
 vmTestbase/nsk/jvmti/scenarios/allocation/AP03/ap03t001 does not handle
 frequent GC gracefully

Reviewed-by: aboldtch, sspitsyn
---
 .../scenarios/allocation/AP03/ap03t001/ap03t001.cpp      | 9 +++++++++
 1 file changed, 9 insertions(+)

diff --git a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/allocation/AP03/ap03t001/ap03t001.cpp b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/allocation/AP03/ap03t001/ap03t001.cpp
index e50e1ff537b..0e5ff69fe6c 100644
--- a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/allocation/AP03/ap03t001/ap03t001.cpp
+++ b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/scenarios/allocation/AP03/ap03t001/ap03t001.cpp
@@ -42,6 +42,7 @@ static jvmtiCapabilities caps;
 
 static volatile int obj_free = 0;
 static volatile long obj_count = 0;
+static volatile bool check_object_free = true;
 
 static jlong timeout = 0;
 static int user_data = 0;
@@ -50,6 +51,9 @@ static const jlong DEBUGEE_CLASS_TAG = (jlong)1024;
 
 void JNICALL
 ObjectFree(jvmtiEnv *jvmti_env, jlong tag) {
+    if (!check_object_free) {
+        return;
+    }
     NSK_COMPLAIN1("Received unexpected ObjectFree event for an object with tag %ld\n\n", (long)tag);
     nsk_jvmti_setFailStatus();
     obj_free++;
@@ -190,6 +194,11 @@ agentProc(jvmtiEnv* jvmti, JNIEnv* jni, void* arg) {
         } else {
             NSK_DISPLAY1("Number of objects IterateOverObjectsReachableFromObject has found: %d\n\n", obj_count);
         }
+
+        // Ignore late ObjectFree notifications after the resurrected object has
+        // been validated. At this point the test has already proven that the
+        // tagged object survived finalization and is reachable through the catcher.
+        check_object_free = false;
     } while (0);
 
     NSK_DISPLAY0("Let debugee to finish\n");

From fa612824239ac1f997dd0d526995bd13e5c1bdd1 Mon Sep 17 00:00:00 2001
From: Dingli Zhang <dzhang@openjdk.org>
Date: Mon, 13 Apr 2026 09:06:37 +0000
Subject: [PATCH 571/655] 8381926: Fix implicit conversion in
 macroAssembler_riscv.hpp

Reviewed-by: fyang, wenanjian
---
 .../cpu/riscv/macroAssembler_riscv.cpp        | 43 ++++++++++++++-----
 .../cpu/riscv/macroAssembler_riscv.hpp        | 25 +++++------
 2 files changed, 43 insertions(+), 25 deletions(-)

diff --git a/src/hotspot/cpu/riscv/macroAssembler_riscv.cpp b/src/hotspot/cpu/riscv/macroAssembler_riscv.cpp
index a2b7970f9f6..0e32c602d95 100644
--- a/src/hotspot/cpu/riscv/macroAssembler_riscv.cpp
+++ b/src/hotspot/cpu/riscv/macroAssembler_riscv.cpp
@@ -49,6 +49,7 @@
 #include "runtime/sharedRuntime.hpp"
 #include "runtime/stubRoutines.hpp"
 #include "utilities/globalDefinitions.hpp"
+#include "utilities/integerCast.hpp"
 #include "utilities/powerOfTwo.hpp"
 #ifdef COMPILER2
 #include "opto/compile.hpp"
@@ -1947,14 +1948,12 @@ void MacroAssembler::restore_cpu_control_state_after_jni(Register tmp) {
   }
 }
 
-void MacroAssembler::push_reg(Register Rs)
-{
+void MacroAssembler::push_reg(Register Rs) {
   subi(esp, esp, wordSize);
   sd(Rs, Address(esp, 0));
 }
 
-void MacroAssembler::pop_reg(Register Rd)
-{
+void MacroAssembler::pop_reg(Register Rd) {
   ld(Rd, Address(esp, 0));
   addi(esp, esp, wordSize);
 }
@@ -1973,7 +1972,11 @@ int MacroAssembler::bitset_to_regs(unsigned int bitset, unsigned char* regs) {
 
 // Push integer registers in the bitset supplied. Don't push sp.
 // Return the number of words pushed
-int MacroAssembler::push_reg(unsigned int bitset, Register stack) {
+int MacroAssembler::push_reg(RegSet regset, Register stack) {
+  if (regset.bits() == 0) {
+    return 0;
+  }
+  auto bitset = integer_cast<unsigned int>(regset.bits());
   DEBUG_ONLY(int words_pushed = 0;)
   unsigned char regs[32];
   int count = bitset_to_regs(bitset, regs);
@@ -1993,7 +1996,11 @@ int MacroAssembler::push_reg(unsigned int bitset, Register stack) {
   return count;
 }
 
-int MacroAssembler::pop_reg(unsigned int bitset, Register stack) {
+int MacroAssembler::pop_reg(RegSet regset, Register stack) {
+  if (regset.bits() == 0) {
+    return 0;
+  }
+  auto bitset = integer_cast<unsigned int>(regset.bits());
   DEBUG_ONLY(int words_popped = 0;)
   unsigned char regs[32];
   int count = bitset_to_regs(bitset, regs);
@@ -2015,7 +2022,11 @@ int MacroAssembler::pop_reg(unsigned int bitset, Register stack) {
 
 // Push floating-point registers in the bitset supplied.
 // Return the number of words pushed
-int MacroAssembler::push_fp(unsigned int bitset, Register stack) {
+int MacroAssembler::push_fp(FloatRegSet regset, Register stack) {
+  if (regset.bits() == 0) {
+    return 0;
+  }
+  auto bitset = integer_cast<unsigned int>(regset.bits());
   DEBUG_ONLY(int words_pushed = 0;)
   unsigned char regs[32];
   int count = bitset_to_regs(bitset, regs);
@@ -2035,7 +2046,11 @@ int MacroAssembler::push_fp(unsigned int bitset, Register stack) {
   return count;
 }
 
-int MacroAssembler::pop_fp(unsigned int bitset, Register stack) {
+int MacroAssembler::pop_fp(FloatRegSet regset, Register stack) {
+  if (regset.bits() == 0) {
+    return 0;
+  }
+  auto bitset = integer_cast<unsigned int>(regset.bits());
   DEBUG_ONLY(int words_popped = 0;)
   unsigned char regs[32];
   int count = bitset_to_regs(bitset, regs);
@@ -2721,7 +2736,11 @@ void MacroAssembler::kernel_crc32(Register crc, Register buf, Register len,
 #ifdef COMPILER2
 // Push vector registers in the bitset supplied.
 // Return the number of words pushed
-int MacroAssembler::push_v(unsigned int bitset, Register stack) {
+int MacroAssembler::push_v(VectorRegSet regset, Register stack) {
+  if (regset.bits() == 0) {
+    return 0;
+  }
+  auto bitset = integer_cast<unsigned int>(regset.bits());
   int vector_size_in_bytes = Matcher::scalable_vector_reg_size(T_BYTE);
 
   // Scan bitset to accumulate register pairs
@@ -2736,7 +2755,11 @@ int MacroAssembler::push_v(unsigned int bitset, Register stack) {
   return count * vector_size_in_bytes / wordSize;
 }
 
-int MacroAssembler::pop_v(unsigned int bitset, Register stack) {
+int MacroAssembler::pop_v(VectorRegSet regset, Register stack) {
+  if (regset.bits() == 0) {
+    return 0;
+  }
+  auto bitset = integer_cast<unsigned int>(regset.bits());
   int vector_size_in_bytes = Matcher::scalable_vector_reg_size(T_BYTE);
 
   // Scan bitset to accumulate register pairs
diff --git a/src/hotspot/cpu/riscv/macroAssembler_riscv.hpp b/src/hotspot/cpu/riscv/macroAssembler_riscv.hpp
index a51a6aea468..4cc55e7ae23 100644
--- a/src/hotspot/cpu/riscv/macroAssembler_riscv.hpp
+++ b/src/hotspot/cpu/riscv/macroAssembler_riscv.hpp
@@ -818,15 +818,6 @@ class MacroAssembler: public Assembler {
   void double_bgt(FloatRegister Rs1, FloatRegister Rs2, Label &l, bool is_far = false, bool is_unordered = false);
 
 private:
-  int push_reg(unsigned int bitset, Register stack);
-  int pop_reg(unsigned int bitset, Register stack);
-  int push_fp(unsigned int bitset, Register stack);
-  int pop_fp(unsigned int bitset, Register stack);
-#ifdef COMPILER2
-  int push_v(unsigned int bitset, Register stack);
-  int pop_v(unsigned int bitset, Register stack);
-#endif // COMPILER2
-
   // The signed 20-bit upper imm can materialize at most negative 0xF...F80000000, two G.
   // The following signed 12-bit imm can at max subtract 0x800, two K, from that previously loaded two G.
   bool is_valid_32bit_offset(int64_t x) {
@@ -844,15 +835,19 @@ private:
   }
 
 public:
+  // Stack push and pop individual 64 bit registers
   void push_reg(Register Rs);
   void pop_reg(Register Rd);
-  void push_reg(RegSet regs, Register stack) { if (regs.bits()) push_reg(regs.bits(), stack); }
-  void pop_reg(RegSet regs, Register stack)  { if (regs.bits()) pop_reg(regs.bits(), stack); }
-  void push_fp(FloatRegSet regs, Register stack) { if (regs.bits()) push_fp(regs.bits(), stack); }
-  void pop_fp(FloatRegSet regs, Register stack)  { if (regs.bits()) pop_fp(regs.bits(), stack); }
+
+  int push_reg(RegSet regset, Register stack);
+  int pop_reg(RegSet regset, Register stack);
+
+  int push_fp(FloatRegSet regset, Register stack);
+  int pop_fp(FloatRegSet regset, Register stack);
+
 #ifdef COMPILER2
-  void push_v(VectorRegSet regs, Register stack) { if (regs.bits()) push_v(regs.bits(), stack); }
-  void pop_v(VectorRegSet regs, Register stack)  { if (regs.bits()) pop_v(regs.bits(), stack); }
+  int push_v(VectorRegSet regset, Register stack);
+  int pop_v(VectorRegSet regset, Register stack);
 #endif // COMPILER2
 
   // Push and pop everything that might be clobbered by a native

From d605b5709a43f87a01a650fcd8aed2fb6d2d3f8a Mon Sep 17 00:00:00 2001
From: Dusan Balek <dusan.balek@oracle.com>
Date: Mon, 13 Apr 2026 09:08:45 +0000
Subject: [PATCH 572/655] 8179187: Misleading compilation error on annotated
 fully-qualified classname

Reviewed-by: jlahoda, vromero
---
 .../share/classes/com/sun/tools/javac/comp/Attr.java | 12 ++++++++----
 .../failures/CantAnnotatePackages.java               |  2 +-
 .../failures/CantAnnotatePackages.out                |  6 +++---
 .../failures/CantAnnotateScoping.java                |  2 +-
 .../typeAnnotations/failures/CantAnnotateScoping.out |  9 +++++----
 5 files changed, 18 insertions(+), 13 deletions(-)

diff --git a/src/jdk.compiler/share/classes/com/sun/tools/javac/comp/Attr.java b/src/jdk.compiler/share/classes/com/sun/tools/javac/comp/Attr.java
index 444530c7266..89ae68e85ba 100644
--- a/src/jdk.compiler/share/classes/com/sun/tools/javac/comp/Attr.java
+++ b/src/jdk.compiler/share/classes/com/sun/tools/javac/comp/Attr.java
@@ -5270,11 +5270,15 @@ public class Attr extends JCTree.Visitor {
 
     public void visitAnnotatedType(JCAnnotatedType tree) {
         attribAnnotationTypes(tree.annotations, env);
-        Type underlyingType = attribType(tree.underlyingType, env);
-        Type annotatedType = underlyingType.preannotatedType();
+        Type underlyingType = attribTree(tree.underlyingType, env, resultInfo);
+        if (underlyingType.getTag() == PACKAGE) {
+            result = tree.type = underlyingType;
+        } else {
+            Type annotatedType = underlyingType.preannotatedType();
 
-        annotate.annotateTypeSecondStage(tree, tree.annotations, annotatedType);
-        result = tree.type = annotatedType;
+            annotate.annotateTypeSecondStage(tree, tree.annotations, annotatedType);
+            result = tree.type = annotatedType;
+        }
     }
 
     public void visitErroneous(JCErroneous tree) {
diff --git a/test/langtools/tools/javac/annotations/typeAnnotations/failures/CantAnnotatePackages.java b/test/langtools/tools/javac/annotations/typeAnnotations/failures/CantAnnotatePackages.java
index d35351b6f40..5031a74bc5a 100644
--- a/test/langtools/tools/javac/annotations/typeAnnotations/failures/CantAnnotatePackages.java
+++ b/test/langtools/tools/javac/annotations/typeAnnotations/failures/CantAnnotatePackages.java
@@ -1,6 +1,6 @@
 /*
  * @test /nodynamiccopyright/
- * @bug 8026564 8043226 8334055
+ * @bug 8026564 8043226 8334055 8179187
  * @summary The parts of a fully-qualified type can't be annotated.
  * @author Werner Dietl
  * @compile/fail/ref=CantAnnotatePackages.out -XDrawDiagnostics CantAnnotatePackages.java
diff --git a/test/langtools/tools/javac/annotations/typeAnnotations/failures/CantAnnotatePackages.out b/test/langtools/tools/javac/annotations/typeAnnotations/failures/CantAnnotatePackages.out
index b91d65828b9..6e2b9cb93b0 100644
--- a/test/langtools/tools/javac/annotations/typeAnnotations/failures/CantAnnotatePackages.out
+++ b/test/langtools/tools/javac/annotations/typeAnnotations/failures/CantAnnotatePackages.out
@@ -1,5 +1,5 @@
-CantAnnotatePackages.java:16:14: compiler.err.cant.resolve.location: kindname.class, java, , , (compiler.misc.location: kindname.class, CantAnnotatePackages, null)
-CantAnnotatePackages.java:17:9: compiler.err.cant.resolve.location: kindname.class, lang, , , (compiler.misc.location: kindname.package, java, null)
-CantAnnotatePackages.java:18:14: compiler.err.cant.resolve.location: kindname.class, lang, , , (compiler.misc.location: kindname.package, java, null)
 CantAnnotatePackages.java:14:18: compiler.err.type.annotation.inadmissible: (compiler.misc.type.annotation.1: @TA), java.lang, @TA java.lang.Object
+CantAnnotatePackages.java:16:14: compiler.err.type.annotation.inadmissible: (compiler.misc.type.annotation.1: @TA), java.lang, @TA java.lang.Object
+CantAnnotatePackages.java:17:9: compiler.err.type.annotation.inadmissible: (compiler.misc.type.annotation.1: @TA), java.lang, @TA java.lang.Object
+CantAnnotatePackages.java:18:14: compiler.err.type.annotation.inadmissible: (compiler.misc.type.annotation.1: @TA), java.lang, @TA java.lang.Object
 4 errors
diff --git a/test/langtools/tools/javac/annotations/typeAnnotations/failures/CantAnnotateScoping.java b/test/langtools/tools/javac/annotations/typeAnnotations/failures/CantAnnotateScoping.java
index 4bdd791909c..427c1fef3a8 100644
--- a/test/langtools/tools/javac/annotations/typeAnnotations/failures/CantAnnotateScoping.java
+++ b/test/langtools/tools/javac/annotations/typeAnnotations/failures/CantAnnotateScoping.java
@@ -1,6 +1,6 @@
 /*
  * @test /nodynamiccopyright/
- * @bug 8006733 8006775 8043226 8334055
+ * @bug 8006733 8006775 8043226 8334055 8179187
  * @summary Ensure behavior for nested types is correct.
  * @author Werner Dietl
  * @compile/fail/ref=CantAnnotateScoping.out -XDrawDiagnostics CantAnnotateScoping.java
diff --git a/test/langtools/tools/javac/annotations/typeAnnotations/failures/CantAnnotateScoping.out b/test/langtools/tools/javac/annotations/typeAnnotations/failures/CantAnnotateScoping.out
index ade5333a446..2ae736ad315 100644
--- a/test/langtools/tools/javac/annotations/typeAnnotations/failures/CantAnnotateScoping.out
+++ b/test/langtools/tools/javac/annotations/typeAnnotations/failures/CantAnnotateScoping.out
@@ -1,12 +1,13 @@
-CantAnnotateScoping.java:63:9: compiler.err.cant.resolve.location: kindname.class, lang, , , (compiler.misc.location: kindname.package, java, null)
-CantAnnotateScoping.java:68:9: compiler.err.cant.resolve.location: kindname.class, XXX, , , (compiler.misc.location: kindname.package, java, null)
-CantAnnotateScoping.java:71:9: compiler.err.cant.resolve.location: kindname.class, lang, , , (compiler.misc.location: kindname.package, java, null)
+CantAnnotateScoping.java:68:18: compiler.err.doesnt.exist: java.XXX
 CantAnnotateScoping.java:38:14: compiler.err.type.annotation.inadmissible: (compiler.misc.type.annotation.1: @TA), Test.Outer, @TA Test.Outer.SInner
 CantAnnotateScoping.java:51:18: compiler.err.type.annotation.inadmissible: (compiler.misc.type.annotation.1: @TA), java.lang, @TA java.lang.Object
 CantAnnotateScoping.java:60:37: compiler.err.type.annotation.inadmissible: (compiler.misc.type.annotation: @TA,@TA2), java.lang, @DTA @TA @TA2 java.lang.Object
 CantAnnotateScoping.java:40:14: compiler.err.type.annotation.inadmissible: (compiler.misc.type.annotation.1: @TA), Test.Outer, @TA Test.Outer.SInner
+CantAnnotateScoping.java:63:11: compiler.err.annotation.type.not.applicable.to.type: DA
+CantAnnotateScoping.java:68:11: compiler.err.annotation.type.not.applicable.to.type: DA
+CantAnnotateScoping.java:71:9: compiler.err.type.annotation.inadmissible: (compiler.misc.type.annotation.1: @TA), java.lang, @TA java.lang.Object
 CantAnnotateScoping.java:44:34: compiler.err.type.annotation.inadmissible: (compiler.misc.type.annotation: @TA,@TA2), Test.Outer, @TA @TA2 Test.Outer.SInner
 CantAnnotateScoping.java:44:25: compiler.err.annotation.type.not.applicable.to.type: DA
 CantAnnotateScoping.java:48:38: compiler.err.type.annotation.inadmissible: (compiler.misc.type.annotation.1: @TA), Test.Outer, @TA Test.Outer.SInner
 CantAnnotateScoping.java:48:34: compiler.err.annotation.type.not.applicable.to.type: DA
-11 errors
+12 errors

From a76e38c7eb135dcd613a29fa63ab4761d5d81d19 Mon Sep 17 00:00:00 2001
From: Daniel Fuchs <dfuchs@openjdk.org>
Date: Mon, 13 Apr 2026 09:24:41 +0000
Subject: [PATCH 573/655] 8381359: Refactor java/net/DatagramSocket TestNG
 tests to use JUnit

Reviewed-by: vyazici
---
 .../net/DatagramSocket/ConnectPortZero.java   | 85 ++++++++---------
 .../java/net/DatagramSocket/Constructor.java  | 10 +-
 .../net/DatagramSocket/DatagramTimeout.java   | 90 +++++++++---------
 .../OldDatagramSocketImplTest.java            | 64 ++++++-------
 .../java/net/DatagramSocket/SendCheck.java    | 93 +++++++++----------
 .../java/net/DatagramSocket/SendPortZero.java | 46 ++++-----
 .../DatagramSocket/SendReceiveMaxSize.java    | 57 ++++++------
 .../SetGetReceiveBufferSize.java              | 35 +++----
 .../DatagramSocket/SetGetSendBufferSize.java  | 41 ++++----
 .../DatagramSocket/SupportedOptionsCheck.java |  8 +-
 10 files changed, 262 insertions(+), 267 deletions(-)

diff --git a/test/jdk/java/net/DatagramSocket/ConnectPortZero.java b/test/jdk/java/net/DatagramSocket/ConnectPortZero.java
index 7f61d146bc0..342dae4c02b 100644
--- a/test/jdk/java/net/DatagramSocket/ConnectPortZero.java
+++ b/test/jdk/java/net/DatagramSocket/ConnectPortZero.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2020, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -21,11 +21,6 @@
  * questions.
  */
 
-import org.testng.annotations.AfterTest;
-import org.testng.annotations.BeforeTest;
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
-
 import java.io.IOException;
 import java.io.UncheckedIOException;
 import java.net.DatagramSocket;
@@ -34,62 +29,64 @@ import java.net.InetSocketAddress;
 import java.net.MulticastSocket;
 import java.net.SocketException;
 import java.nio.channels.DatagramChannel;
+import java.util.List;
 
-import static org.testng.Assert.assertEquals;
-import static org.testng.Assert.assertThrows;
-import static org.testng.Assert.expectThrows;
+import org.junit.jupiter.api.BeforeAll;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.Arguments;
+import org.junit.jupiter.params.provider.MethodSource;
+import static org.junit.jupiter.api.Assertions.assertFalse;
+import static org.junit.jupiter.api.Assertions.assertSame;
+import static org.junit.jupiter.api.Assertions.assertThrows;
 
 /*
  * @test
  * @bug 8240533
  * @summary Check that DatagramSocket, MulticastSocket and DatagramSocketAdaptor
  *          throw expected Exception when connecting to port 0
- * @run testng/othervm ConnectPortZero
+ * @run junit/othervm ${test.main.class}
  */
 
 public class ConnectPortZero {
-    private InetAddress loopbackAddr, wildcardAddr;
-    private DatagramSocket datagramSocket, datagramSocketAdaptor;
-    private MulticastSocket multicastSocket;
-
+    private static InetAddress loopbackAddr, wildcardAddr;
     private static final Class<SocketException> SE = SocketException.class;
     private static final Class<UncheckedIOException> UCIOE = UncheckedIOException.class;
 
-    @BeforeTest
-    public void setUp() throws IOException {
+    @BeforeAll
+    public static void setUp() throws IOException {
         loopbackAddr = InetAddress.getLoopbackAddress();
         wildcardAddr = new InetSocketAddress(0).getAddress();
-
-        datagramSocket = new DatagramSocket();
-        multicastSocket = new MulticastSocket();
-        datagramSocketAdaptor = DatagramChannel.open().socket();
     }
 
-    @DataProvider(name = "data")
-    public Object[][] variants() {
-        return new Object[][]{
-                { datagramSocket,        loopbackAddr },
-                { datagramSocketAdaptor, loopbackAddr },
-                { multicastSocket,       loopbackAddr },
-                { datagramSocket,        wildcardAddr },
-                { datagramSocketAdaptor, wildcardAddr },
-                { multicastSocket,       wildcardAddr }
-        };
+    public static List<Arguments> testCases() throws IOException {
+        // Note that Closeable arguments passed to a ParameterizedTest are automatically
+        // closed by JUnit. We do not want to rely on this, but we do need to
+        // create a new set of sockets for each invocation of this method, so that
+        // the next test method invoked doesn't get a closed socket.
+        return List.of(
+                Arguments.of(new DatagramSocket(),            loopbackAddr),
+                Arguments.of(DatagramChannel.open().socket(), loopbackAddr),
+                Arguments.of(new MulticastSocket(),           loopbackAddr),
+                Arguments.of(new DatagramSocket(),            wildcardAddr),
+                Arguments.of(DatagramChannel.open().socket(), wildcardAddr),
+                Arguments.of(new MulticastSocket(),           wildcardAddr)
+        );
     }
 
-    @Test(dataProvider = "data")
-    public void testConnect(DatagramSocket ds, InetAddress addr) {
-        Throwable t = expectThrows(UCIOE, () -> ds.connect(addr, 0));
-        assertEquals(t.getCause().getClass(), SE);
-
-        assertThrows(SE, () -> ds
-                .connect(new InetSocketAddress(addr, 0)));
-    }
-
-    @AfterTest
-    public void tearDown() {
-        datagramSocket.close();
-        multicastSocket.close();
-        datagramSocketAdaptor.close();
+    @ParameterizedTest
+    @MethodSource("testCases")
+    public void testConnect(DatagramSocket socket, InetAddress addr) {
+        try (var ds = socket) {
+            assertFalse(ds.isConnected());
+            assertFalse(ds.isClosed());
+            Throwable t = assertThrows(UCIOE, () -> ds.connect(addr, 0));
+            assertSame(SE, t.getCause().getClass());
+            assertFalse(ds.isConnected());
+            assertFalse(ds.isClosed());
+            assertThrows(SE, () -> ds
+                    .connect(new InetSocketAddress(addr, 0)));
+            assertFalse(ds.isConnected());
+            assertFalse(ds.isClosed());
+        }
     }
 }
diff --git a/test/jdk/java/net/DatagramSocket/Constructor.java b/test/jdk/java/net/DatagramSocket/Constructor.java
index 6fecf8dc732..6e5cd944297 100644
--- a/test/jdk/java/net/DatagramSocket/Constructor.java
+++ b/test/jdk/java/net/DatagramSocket/Constructor.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2020, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -24,18 +24,18 @@
 /* @test
  * @bug 8243507 8243999
  * @summary Checks to ensure that DatagramSocket constructors behave as expected
- * @run testng Constructor
+ * @run junit ${test.main.class}
  */
 
-import org.testng.annotations.Test;
 
 import java.io.IOException;
 import java.net.DatagramSocket;
 import java.net.InetAddress;
 import java.net.SocketAddress;
 
-import static org.testng.Assert.assertThrows;
-import static org.testng.Assert.assertTrue;
+import org.junit.jupiter.api.Test;
+import static org.junit.jupiter.api.Assertions.assertThrows;
+import static org.junit.jupiter.api.Assertions.assertTrue;
 
 public class Constructor {
     private static final InetAddress LOOPBACK = InetAddress.getLoopbackAddress();
diff --git a/test/jdk/java/net/DatagramSocket/DatagramTimeout.java b/test/jdk/java/net/DatagramSocket/DatagramTimeout.java
index 4d979f9dc8d..a8d35a64dc8 100644
--- a/test/jdk/java/net/DatagramSocket/DatagramTimeout.java
+++ b/test/jdk/java/net/DatagramSocket/DatagramTimeout.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1998, 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1998, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -26,23 +26,24 @@
  * @bug 4163126 8222829
  * @summary Test to see if timeout hangs. Also checks that
  * negative timeout value fails as expected.
- * @run testng DatagramTimeout
+ * @run junit ${test.main.class}
  */
 
+import java.io.IOException;
 import java.net.DatagramPacket;
 import java.net.DatagramSocket;
 import java.net.MulticastSocket;
 import java.net.SocketException;
 import java.net.SocketTimeoutException;
 import java.nio.channels.DatagramChannel;
+import java.util.List;
 
-import org.testng.annotations.AfterTest;
-import org.testng.annotations.BeforeTest;
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
-
-import static org.testng.Assert.assertEquals;
-import static org.testng.Assert.assertThrows;
+import org.junit.jupiter.api.Test;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertFalse;
+import static org.junit.jupiter.api.Assertions.assertThrows;
 
 public class DatagramTimeout {
     private static final Class<IllegalArgumentException> IAE =
@@ -51,49 +52,46 @@ public class DatagramTimeout {
             SocketTimeoutException.class;
     private static final Class<SocketException> SE = SocketException.class;
 
-    private DatagramSocket datagramSocket, multicastSocket,
-            datagramSocketAdaptor;
-
-    @BeforeTest
-    public void setUp() throws Exception {
-        datagramSocket = new DatagramSocket();
-        multicastSocket = new MulticastSocket();
-        datagramSocketAdaptor = DatagramChannel.open().socket();
+    public static List<DatagramSocket> sockets() throws IOException {
+        // Note that Closeable arguments passed to a ParameterizedTest are automatically
+        // closed by JUnit. We do not want to rely on this, but we do need to
+        // create a new set of sockets for each invocation of this method, so that
+        // the next test method invoked doesn't get a closed socket.
+        return List.of(
+                new DatagramSocket(),
+                new MulticastSocket(),
+                DatagramChannel.open().socket());
     }
 
-    @DataProvider(name = "data")
-    public Object[][] variants() {
-        return new Object[][]{
-                { datagramSocket        },
-                { datagramSocketAdaptor },
-                { multicastSocket       },
-        };
+    @ParameterizedTest
+    @MethodSource("sockets")
+    public void testSetNegTimeout(DatagramSocket socket)  {
+        try (var ds = socket) {
+            assertFalse(ds.isClosed());
+            assertThrows(IAE, () -> ds.setSoTimeout(-1));
+        }
     }
 
-    @Test(dataProvider = "data")
-    public void testSetNegTimeout(DatagramSocket ds)  {
-        assertThrows(IAE, () -> ds.setSoTimeout(-1));
+    @ParameterizedTest
+    @MethodSource("sockets")
+    public void testSetTimeout(DatagramSocket socket) throws Exception {
+        try (var ds = socket) {
+            assertFalse(ds.isClosed());
+            byte[] buffer = new byte[50];
+            DatagramPacket pkt = new DatagramPacket(buffer, buffer.length);
+            ds.setSoTimeout(2);
+            assertThrows(STE, () -> ds.receive(pkt));
+        }
     }
 
-    @Test(dataProvider = "data")
-    public void testSetTimeout(DatagramSocket ds) throws Exception {
-        byte[] buffer = new byte[50];
-        DatagramPacket pkt = new DatagramPacket(buffer, buffer.length);
-        ds.setSoTimeout(2);
-        assertThrows(STE, () -> ds.receive(pkt));
-    }
-
-    @Test(dataProvider = "data")
-    public void testGetTimeout(DatagramSocket ds) throws Exception {
-        ds.setSoTimeout(10);
-        assertEquals(10, ds.getSoTimeout());
-    }
-
-    @AfterTest
-    public void tearDown() {
-        datagramSocket.close();
-        multicastSocket.close();
-        datagramSocketAdaptor.close();
+    @ParameterizedTest
+    @MethodSource("sockets")
+    public void testGetTimeout(DatagramSocket socket) throws Exception {
+        try (var ds = socket) {
+            assertFalse(ds.isClosed());
+            ds.setSoTimeout(10);
+            assertEquals(10, ds.getSoTimeout());
+        }
     }
 
     @Test
diff --git a/test/jdk/java/net/DatagramSocket/OldDatagramSocketImplTest.java b/test/jdk/java/net/DatagramSocket/OldDatagramSocketImplTest.java
index 7f8eea874ec..1d3c39ffd71 100644
--- a/test/jdk/java/net/DatagramSocket/OldDatagramSocketImplTest.java
+++ b/test/jdk/java/net/DatagramSocket/OldDatagramSocketImplTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2021, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2021, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,15 +25,24 @@
  * @test
  * @bug 8260428
  * @summary Drop support for pre JDK 1.4 DatagramSocketImpl implementations
- * @run testng/othervm OldDatagramSocketImplTest
+ * @run junit/othervm ${test.main.class}
  */
 
-import org.testng.annotations.Test;
+import java.io.IOException;
+import java.io.UncheckedIOException;
+import java.net.DatagramPacket;
+import java.net.DatagramSocket;
+import java.net.DatagramSocketImpl;
+import java.net.InetAddress;
+import java.net.InetSocketAddress;
+import java.net.NetworkInterface;
+import java.net.SocketAddress;
+import java.net.SocketException;
 
-import java.net.*;
-import java.io.*;
-
-import static org.testng.Assert.assertEquals;
+import org.junit.jupiter.api.Test;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertSame;
+import static org.junit.jupiter.api.Assertions.assertThrows;
 
 public class OldDatagramSocketImplTest {
     InetAddress LOOPBACK = InetAddress.getLoopbackAddress();
@@ -41,22 +50,18 @@ public class OldDatagramSocketImplTest {
     @Test
     public void testOldImplConnect() {
         try (var ds = new DatagramSocket(new OldDatagramSocketImpl()) {}) {
-            ds.connect(new InetSocketAddress(LOOPBACK, 6667));
-            throw new RuntimeException("ERROR: test failed");
-        } catch (SocketException ex) {
-            assertEquals(ex.getMessage(), "connect not implemented");
-            System.out.println("PASSED: default implementation of connect has thrown as expected");
+            SocketException ex = assertThrows(SocketException.class,
+                    () -> ds.connect(new InetSocketAddress(LOOPBACK, 6667)));
+            assertEquals("connect not implemented", ex.getMessage());
         }
     }
 
     @Test
     public void testOldImplConnectTwoArgs() {
         try (var ds = new DatagramSocket(new OldDatagramSocketImpl()) {}) {
-            ds.connect(LOOPBACK, 6667);
-            throw new RuntimeException("ERROR: test failed");
-        } catch (UncheckedIOException ex) {
-            assertEquals(ex.getMessage(), "connect failed");
-            System.out.println("PASSED: default implementation of connect has thrown as expected");
+            UncheckedIOException ex = assertThrows(UncheckedIOException.class,
+                    () -> ds.connect(LOOPBACK, 6667));
+            assertEquals("connect failed", ex.getMessage());
         }
     }
 
@@ -64,36 +69,27 @@ public class OldDatagramSocketImplTest {
     public void testOldImplDisconnect() {
         try (var ds = new DatagramSocket(new OldDatagramSocketImplWithValidConnect()) { }){
             ds.connect(LOOPBACK, 6667);
-            ds.disconnect();
-            throw new RuntimeException("ERROR: test failed");
-        } catch (UncheckedIOException ex) {
+            UncheckedIOException ex = assertThrows(UncheckedIOException.class, () -> ds.disconnect());
             var innerException = ex.getCause();
-            assertEquals(innerException.getClass(), SocketException.class);
-            assertEquals(innerException.getMessage(), "disconnect not implemented");
-            System.out.println("PASSED: default implementation of disconnect has thrown as expected");
+            assertSame(SocketException.class, innerException.getClass());
+            assertEquals("disconnect not implemented", innerException.getMessage());
         }
     }
 
     @Test
     public void testOldImplPublic() {
         try (var ds = new PublicOldDatagramSocketImpl()) {
-            ds.connect(LOOPBACK, 0);
-            throw new RuntimeException("ERROR: test failed");
-        } catch (SocketException ex) {
-            assertEquals(ex.getMessage(), "connect not implemented");
-            System.out.println("PASSED: default implementation of disconnect has thrown as expected");
+            SocketException ex = assertThrows(SocketException.class, () -> ds.connect(LOOPBACK, 0));
+            assertEquals("connect not implemented", ex.getMessage());
         }
     }
     @Test
     public void testOldImplPublicDisconnect() {
         try (var ds = new PublicOldDatagramSocketImplWithValidConnect()) {
-            ds.disconnect();
-            throw new RuntimeException("ERROR: test failed");
-        } catch (UncheckedIOException ex) {
+            UncheckedIOException ex = assertThrows(UncheckedIOException.class, () -> ds.disconnect());
             var innerException = ex.getCause();
-            assertEquals(innerException.getClass(), SocketException.class);
-            assertEquals(innerException.getMessage(), "disconnect not implemented");
-            System.out.println("PASSED: default implementation of disconnect has thrown as expected");
+            assertSame(SocketException.class, innerException.getClass());
+            assertEquals("disconnect not implemented", innerException.getMessage());
         }
     }
 
diff --git a/test/jdk/java/net/DatagramSocket/SendCheck.java b/test/jdk/java/net/DatagramSocket/SendCheck.java
index 482eadb3cf9..5cefb0fd0e6 100644
--- a/test/jdk/java/net/DatagramSocket/SendCheck.java
+++ b/test/jdk/java/net/DatagramSocket/SendCheck.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2020, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -33,12 +33,14 @@ import java.nio.channels.DatagramChannel;
 import java.util.ArrayList;
 import java.util.List;
 
-import org.testng.annotations.AfterTest;
-import org.testng.annotations.BeforeTest;
-import org.testng.annotations.Test;
-import org.testng.annotations.DataProvider;
+import org.junit.jupiter.api.AfterAll;
+import org.junit.jupiter.api.BeforeAll;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.Arguments;
+import org.junit.jupiter.params.provider.MethodSource;
 
-import static org.testng.Assert.expectThrows;
+import static org.junit.jupiter.api.Assertions.assertDoesNotThrow;
+import static org.junit.jupiter.api.Assertions.assertThrows;
 
 /*
  * @test
@@ -47,28 +49,24 @@ import static org.testng.Assert.expectThrows;
  *          DatagramSocketAdaptor and DatagramChannel all
  *          throw expected Exception when passed a DatagramPacket
  *          with invalid details
- * @run testng SendCheck
+ * @run junit ${test.main.class}
  */
 
 public class SendCheck {
-    private InetAddress loopbackAddr, wildcardAddr;
+    private static InetAddress loopbackAddr, wildcardAddr;
     static final Class<IOException> IOE = IOException.class;
     static final Class<SocketException> SE = SocketException.class;
 
     static final byte[] buf = {0, 1, 2};
     static DatagramSocket socket;
 
-    @BeforeTest
-    public void setUp() {
-        try {
-            socket = new DatagramSocket();
-        } catch (Exception e) {
-            throw new ExceptionInInitializerError(e);
-        }
+    @BeforeAll
+    public static void setUp() throws Exception {
+        socket = new DatagramSocket();
     }
 
-    @AfterTest
-    public void closeDown() {
+    @AfterAll
+    public static void closeDown() {
         socket.close();
     }
 
@@ -92,7 +90,7 @@ public class SendCheck {
             if (address == null) {
                 description = "<null>:" + port;
             } else if (port < 0) {
-                description = packet.getAddress().toString() + ":" + port;
+                description = packet.getAddress() + ":" + port;
             } else {
                 description = packet.getSocketAddress().toString();
             }
@@ -100,8 +98,7 @@ public class SendCheck {
         }
     }
 
-    @DataProvider(name = "packets")
-    Object[][] providerIO() throws IOException {
+    static List<Arguments> providerIO() throws IOException {
         loopbackAddr = InetAddress.getLoopbackAddress();
         wildcardAddr = new InetSocketAddress(0).getAddress();
 
@@ -124,44 +121,46 @@ public class SendCheck {
 
         List<Packet> Packets = List.of(Packet.of(pkt1), Packet.of(pkt2));
 
-        List<Sender> senders = List.of(
-                Sender.of(new DatagramSocket(null)),
-                Sender.of(new MulticastSocket(null)),
-                Sender.of(DatagramChannel.open()),
-                Sender.of(DatagramChannel.open().socket())
-        );
-
-        List<Object[]> testcases = new ArrayList<>();
+        List<Arguments> testcases = new ArrayList<>();
         for (var packet : Packets) {
+            // Note that Closeable arguments passed to a ParameterizedTest are automatically
+            // closed by JUnit. We do not want to rely on this, but we do need to
+            // create a new set of sockets for each invocation of this method, so that
+            // the next test method invoked doesn't get a closed socket.
+            List<Sender> senders = List.of(
+                    Sender.of(new DatagramSocket(null)),
+                    Sender.of(new MulticastSocket(null)),
+                    Sender.of(DatagramChannel.open()),
+                    Sender.of(DatagramChannel.open().socket())
+            );
             addTestCaseFor(testcases, senders, packet);
         }
 
-        return testcases.toArray(new Object[0][0]);
+        return testcases;
     }
 
-    static void addTestCaseFor(List<Object[]> testcases,
+    static void addTestCaseFor(List<Arguments> testcases,
                                List<Sender> senders, Packet p) {
         for (var s : senders) {
-            Object[] testcase = new Object[]{s, p, s.expectedException()};
-            testcases.add(testcase);
+            testcases.add(Arguments.of(s, p, s.expectedException()));
         }
     }
 
-    @Test(dataProvider = "packets")
-    public static void sendCheck(Sender<IOException> sender,
-                                        Packet packet,
-                                        Class<? extends Throwable> exception) {
-        DatagramPacket pkt = packet.packet;
-        if (exception != null) {
-            Throwable t = expectThrows(exception, () -> sender.send(pkt));
-            System.out.printf("%s got expected exception %s%n",
-                    packet.toString(), t);
-        } else {
-            try {
-                sender.send(pkt);
-            } catch (IOException e) {
-                throw new AssertionError("Unexpected exception for "
-                        + sender + " / " + packet, e);
+    @ParameterizedTest
+    @MethodSource("providerIO")
+    public void sendCheck(Sender<IOException> socket,
+                          Packet packet,
+                          Class<? extends Throwable> exception)
+            throws IOException
+    {
+        try (var sender = socket) {
+            DatagramPacket pkt = packet.packet;
+            if (exception != null) {
+                Throwable t = assertThrows(exception, () -> sender.send(pkt));
+                System.out.printf("%s got expected exception %s%n", packet, t);
+            } else {
+                assertDoesNotThrow(() -> sender.send(pkt),
+                        "Unexpected exception for " + sender + " / " + packet);
             }
         }
     }
diff --git a/test/jdk/java/net/DatagramSocket/SendPortZero.java b/test/jdk/java/net/DatagramSocket/SendPortZero.java
index 03c78c3e54d..149424232ee 100644
--- a/test/jdk/java/net/DatagramSocket/SendPortZero.java
+++ b/test/jdk/java/net/DatagramSocket/SendPortZero.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2020, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -21,39 +21,40 @@
  * questions.
  */
 
-import org.testng.annotations.AfterTest;
-import org.testng.annotations.BeforeTest;
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
 
 import java.io.IOException;
 import java.net.DatagramPacket;
 import java.net.DatagramSocket;
 import java.net.InetSocketAddress;
 import java.net.InetAddress;
-import java.net.MulticastSocket;
 import java.net.SocketException;
 import java.nio.channels.DatagramChannel;
 
-import static org.testng.Assert.assertThrows;
+import org.junit.jupiter.api.AfterAll;
+import org.junit.jupiter.api.BeforeAll;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
+
+import static org.junit.jupiter.api.Assertions.assertFalse;
+import static org.junit.jupiter.api.Assertions.assertThrows;
 
 /*
  * @test
  * @bug 8236105 8240533
  * @summary Check that DatagramSocket throws expected
  *          Exception when sending a DatagramPacket with port 0
- * @run testng/othervm SendPortZero
+ * @run junit/othervm ${test.main.class}
  */
 
 public class SendPortZero {
-    private InetAddress loopbackAddr, wildcardAddr;
-    private DatagramSocket datagramSocket, datagramSocketAdaptor;
-    private DatagramPacket loopbackZeroPkt, wildcardZeroPkt, wildcardValidPkt;
+    private static InetAddress loopbackAddr, wildcardAddr;
+    private static DatagramSocket datagramSocket, datagramSocketAdaptor;
+    private static DatagramPacket loopbackZeroPkt, wildcardZeroPkt, wildcardValidPkt;
 
     private static final Class<SocketException> SE = SocketException.class;
 
-    @BeforeTest
-    public void setUp() throws IOException {
+    @BeforeAll
+    public static void setUp() throws IOException {
         datagramSocket = new DatagramSocket();
         datagramSocketAdaptor = DatagramChannel.open().socket();
 
@@ -81,8 +82,13 @@ public class SendPortZero {
         wildcardValidPkt.setPort(datagramSocket.getLocalPort());
     }
 
-    @DataProvider(name = "data")
-    public Object[][] variants() {
+    @AfterAll
+    public static void tearDown() {
+        datagramSocket.close();
+        datagramSocketAdaptor.close();
+    }
+
+    public static Object[][] testCases() {
         return new Object[][]{
                 { datagramSocket,        loopbackZeroPkt },
                 { datagramSocket,        wildcardZeroPkt },
@@ -96,14 +102,10 @@ public class SendPortZero {
         };
     }
 
-    @Test(dataProvider = "data")
+    @ParameterizedTest(autoCloseArguments = false) // closed in tearDown
+    @MethodSource("testCases")
     public void testSend(DatagramSocket ds, DatagramPacket pkt) {
+        assertFalse(ds.isClosed());
         assertThrows(SE, () -> ds.send(pkt));
     }
-
-    @AfterTest
-    public void tearDown() {
-        datagramSocket.close();
-        datagramSocketAdaptor.close();
-    }
 }
diff --git a/test/jdk/java/net/DatagramSocket/SendReceiveMaxSize.java b/test/jdk/java/net/DatagramSocket/SendReceiveMaxSize.java
index 36eae0b5c32..d85817337f4 100644
--- a/test/jdk/java/net/DatagramSocket/SendReceiveMaxSize.java
+++ b/test/jdk/java/net/DatagramSocket/SendReceiveMaxSize.java
@@ -33,7 +33,7 @@
  *          limit.
  * @library /test/lib
  * @build jdk.test.lib.net.IPSupport
- * @run testng/othervm SendReceiveMaxSize
+ * @run junit/othervm ${test.main.class}
  */
 /*
  * @test id=preferIPv4Stack
@@ -42,7 +42,7 @@
  *          maximum size on macOS, using an IPv4 only socket.
  * @library /test/lib
  * @build jdk.test.lib.net.IPSupport
- * @run testng/othervm -Djava.net.preferIPv4Stack=true SendReceiveMaxSize
+ * @run junit/othervm -Djava.net.preferIPv4Stack=true ${test.main.class}
  */
 /*
  * @test id=preferIPv6Addresses
@@ -52,7 +52,7 @@
  *          IPv6 addresses.
  * @library /test/lib
  * @build jdk.test.lib.net.IPSupport
- * @run testng/othervm -Djava.net.preferIPv6Addresses=true SendReceiveMaxSize
+ * @run junit/othervm -Djava.net.preferIPv6Addresses=true ${test.main.class}
  */
 /*
  * @test id=preferLoopback
@@ -62,7 +62,7 @@
  *          interface.
  * @library /test/lib
  * @build jdk.test.lib.net.IPSupport
- * @run testng/othervm -Dtest.preferLoopback=true SendReceiveMaxSize
+ * @run junit/othervm -Dtest.preferLoopback=true ${test.main.class}
  */
 /*
  * @test id=preferIPv6Loopback
@@ -72,7 +72,7 @@
  *          interface.
  * @library /test/lib
  * @build jdk.test.lib.net.IPSupport
- * @run testng/othervm -Dtest.preferLoopback=true -Djava.net.preferIPv6Addresses=true SendReceiveMaxSize
+ * @run junit/othervm -Dtest.preferLoopback=true -Djava.net.preferIPv6Addresses=true ${test.main.class}
  */
 /*
  * @test id=preferIPv4Loopback
@@ -82,16 +82,12 @@
  *          loopback interface
  * @library /test/lib
  * @build jdk.test.lib.net.IPSupport
- * @run testng/othervm -Dtest.preferLoopback=true -Djava.net.preferIPv4Stack=true SendReceiveMaxSize
+ * @run junit/othervm -Dtest.preferLoopback=true -Djava.net.preferIPv4Stack=true ${test.main.class}
  */
 
 import jdk.test.lib.RandomFactory;
 import jdk.test.lib.Platform;
 import jdk.test.lib.net.IPSupport;
-import org.testng.SkipException;
-import org.testng.annotations.BeforeTest;
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
 
 import java.io.IOException;
 import java.net.DatagramPacket;
@@ -101,21 +97,27 @@ import java.net.InetAddress;
 import java.net.InetSocketAddress;
 import java.net.MulticastSocket;
 import java.nio.channels.DatagramChannel;
-import java.util.Optional;
 import java.util.Random;
 
 import static java.net.StandardSocketOptions.SO_RCVBUF;
 import static jdk.test.lib.net.IPSupport.diagnoseConfigurationIssue;
-import static org.testng.Assert.assertTrue;
-import static org.testng.Assert.assertEquals;
-import static org.testng.Assert.expectThrows;
+
+import org.junit.jupiter.api.Assumptions;
+import org.junit.jupiter.api.BeforeAll;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
+
+import static org.junit.jupiter.api.Assertions.assertArrayEquals;
+import static org.junit.jupiter.api.Assertions.assertThrows;
+import static org.junit.jupiter.api.Assertions.assertTrue;
+import static org.junit.jupiter.api.Assertions.assertEquals;
 
 public class SendReceiveMaxSize {
 
     private final static boolean PREFER_LOOPBACK = Boolean.getBoolean("test.preferLoopback");
 
-    private int BUF_LIMIT;
-    private InetAddress HOST_ADDR;
+    private static int BUF_LIMIT;
+    private static InetAddress HOST_ADDR;
     private final static int IPV4_SNDBUF = IPSupport.getMaxUDPSendBufSizeIPv4();
     private final static int IPV6_SNDBUF = IPSupport.getMaxUDPSendBufSizeIPv6();
     private final static Class<IOException> IOE = IOException.class;
@@ -126,20 +128,16 @@ public class SendReceiveMaxSize {
     }
     static DatagramSocketSupplier supplier(DatagramSocketSupplier supplier) { return supplier; }
 
-    @BeforeTest
-    public void setUp() throws IOException {
-        Optional<String> configurationIssue = diagnoseConfigurationIssue();
-        configurationIssue.map(SkipException::new).ifPresent(x -> {
-            throw x;
-        });
-
+    @BeforeAll
+    public static void setUp() throws IOException {
+        // skip test if the configuration is not operational
+        diagnoseConfigurationIssue().ifPresent(Assumptions::abort);
         HOST_ADDR = PREFER_LOOPBACK ? InetAddress.getLoopbackAddress() : InetAddress.getLocalHost();
         BUF_LIMIT = (HOST_ADDR instanceof Inet6Address) ? IPV6_SNDBUF : IPV4_SNDBUF;
         System.out.printf("Host address: %s, Buffer limit: %d%n", HOST_ADDR, BUF_LIMIT);
     }
 
-    @DataProvider
-    public Object[][] invariants() {
+    public static Object[][] testCases() {
         var ds = supplier(() -> new DatagramSocket());
         var ms = supplier(() -> new MulticastSocket());
         var dsa = supplier(() -> DatagramChannel.open().socket());
@@ -156,7 +154,8 @@ public class SendReceiveMaxSize {
         };
     }
 
-    @Test(dataProvider = "invariants")
+    @ParameterizedTest
+    @MethodSource("testCases")
     public void testSendReceiveMaxSize(String name, int capacity,
                                        DatagramSocketSupplier supplier,
                                        Class<? extends Exception> exception) throws IOException {
@@ -177,7 +176,7 @@ public class SendReceiveMaxSize {
                 var sendPkt = new DatagramPacket(testData, capacity, addr);
 
                 if (exception != null) {
-                    Exception ex = expectThrows(IOE, () -> sender.send(sendPkt));
+                    Exception ex = assertThrows(exception, () -> sender.send(sendPkt));
                     System.out.println(name + " got expected exception: " + ex);
                 } else {
                     sender.send(sendPkt);
@@ -185,8 +184,8 @@ public class SendReceiveMaxSize {
                     receiver.receive(receivePkt);
 
                     // check packet data has been fragmented and re-assembled correctly at receiver
-                    assertEquals(receivePkt.getLength(), capacity);
-                    assertEquals(receivePkt.getData(), testData);
+                    assertEquals(capacity, receivePkt.getLength());
+                    assertArrayEquals(testData, receivePkt.getData());
                 }
             }
         }
diff --git a/test/jdk/java/net/DatagramSocket/SetGetReceiveBufferSize.java b/test/jdk/java/net/DatagramSocket/SetGetReceiveBufferSize.java
index 67c890cd2e2..96fa4d68d2e 100644
--- a/test/jdk/java/net/DatagramSocket/SetGetReceiveBufferSize.java
+++ b/test/jdk/java/net/DatagramSocket/SetGetReceiveBufferSize.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1999, 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1999, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,21 +25,20 @@
  * @test
  * @bug 4173717 8243488
  * @summary Check that setReceiveBufferSize and getReceiveBufferSize work as expected
- * @run testng SetGetReceiveBufferSize
- * @run testng/othervm -Djava.net.preferIPv4Stack=true SetGetReceiveBufferSize
+ * @run junit ${test.main.class}
+ * @run junit/othervm -Djava.net.preferIPv4Stack=true ${test.main.class}
  */
 
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
-
 import java.io.IOException;
 import java.net.DatagramSocket;
 import java.net.MulticastSocket;
 import java.net.SocketException;
 import java.nio.channels.DatagramChannel;
 
-import static org.testng.Assert.assertEquals;
-import static org.testng.Assert.expectThrows;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertThrows;
 
 public class SetGetReceiveBufferSize {
     static final Class<SocketException> SE = SocketException.class;
@@ -51,8 +50,7 @@ public class SetGetReceiveBufferSize {
     }
     static DatagramSocketSupplier supplier(DatagramSocketSupplier supplier) { return supplier; }
 
-    @DataProvider
-    public Object[][] invariants() {
+    public static Object[][] suppliers() {
         return new Object[][]{
                 {"DatagramSocket", supplier(() -> new DatagramSocket())},
                 {"MulticastSocket", supplier(() -> new MulticastSocket())},
@@ -60,39 +58,42 @@ public class SetGetReceiveBufferSize {
         };
     }
 
-    @Test(dataProvider = "invariants")
+    @ParameterizedTest
+    @MethodSource("suppliers")
     public void testSetInvalidBufferSize(String name, DatagramSocketSupplier supplier) throws IOException {
         var invalidArgs = new int[]{ -1, 0 };
 
         try (var socket = supplier.open()) {
             for (int i : invalidArgs) {
-                Exception ex = expectThrows(IAE, () -> socket.setReceiveBufferSize(i));
+                Exception ex = assertThrows(IAE, () -> socket.setReceiveBufferSize(i));
                 System.out.println(name + " got expected exception: " + ex);
             }
         }
     }
 
-    @Test(dataProvider = "invariants")
+    @ParameterizedTest
+    @MethodSource("suppliers")
     public void testSetAndGetBufferSize(String name, DatagramSocketSupplier supplier) throws IOException {
         var validArgs = new int[]{ 1234, 2345, 3456 };
 
         try (var socket = supplier.open()) {
             for (int i : validArgs) {
                 socket.setReceiveBufferSize(i);
-                assertEquals(socket.getReceiveBufferSize(), i, name);
+                assertEquals(i, socket.getReceiveBufferSize(), name);
             }
         }
     }
 
-    @Test(dataProvider = "invariants")
+    @ParameterizedTest
+    @MethodSource("suppliers")
     public void testSetGetAfterClose(String name, DatagramSocketSupplier supplier) throws IOException {
         var socket = supplier.open();
         socket.close();
 
-        Exception setException = expectThrows(SE, () -> socket.setReceiveBufferSize(2345));
+        Exception setException = assertThrows(SE, () -> socket.setReceiveBufferSize(2345));
         System.out.println(name + " got expected exception: " + setException);
 
-        Exception getException = expectThrows(SE, () -> socket.getReceiveBufferSize());
+        Exception getException = assertThrows(SE, () -> socket.getReceiveBufferSize());
         System.out.println(name + " got expected exception: " + getException);
     }
 }
diff --git a/test/jdk/java/net/DatagramSocket/SetGetSendBufferSize.java b/test/jdk/java/net/DatagramSocket/SetGetSendBufferSize.java
index 0f6f9af4c60..07ae4bfad59 100644
--- a/test/jdk/java/net/DatagramSocket/SetGetSendBufferSize.java
+++ b/test/jdk/java/net/DatagramSocket/SetGetSendBufferSize.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2020, 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -27,14 +27,12 @@
  * @library /test/lib
  * @build jdk.test.lib.Platform
  * @summary Check that setSendBufferSize and getSendBufferSize work as expected
- * @run testng SetGetSendBufferSize
- * @run testng/othervm -Djava.net.preferIPv4Stack=true SetGetSendBufferSize
+ * @run junit ${test.main.class}
+ * @run junit/othervm -Djava.net.preferIPv4Stack=true ${test.main.class}
  */
 
 import jdk.test.lib.Platform;
 import jdk.test.lib.net.IPSupport;
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
 
 import java.io.IOException;
 import java.net.DatagramSocket;
@@ -42,9 +40,11 @@ import java.net.MulticastSocket;
 import java.net.SocketException;
 import java.nio.channels.DatagramChannel;
 
-import static org.testng.Assert.assertEquals;
-import static org.testng.Assert.assertTrue;
-import static org.testng.Assert.expectThrows;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertThrows;
+import static org.junit.jupiter.api.Assertions.assertTrue;
 
 public class SetGetSendBufferSize {
     static final Class<SocketException> SE = SocketException.class;
@@ -55,8 +55,7 @@ public class SetGetSendBufferSize {
     }
     static DatagramSocketSupplier supplier(DatagramSocketSupplier supplier) { return supplier; }
 
-    @DataProvider
-    public Object[][] invariants() {
+    public static Object[][] suppliers() {
         return new Object[][]{
                 {"DatagramSocket", supplier(() -> new DatagramSocket())},
                 {"MulticastSocket", supplier(() -> new MulticastSocket())},
@@ -64,51 +63,55 @@ public class SetGetSendBufferSize {
         };
     }
 
-    @Test(dataProvider = "invariants")
+    @ParameterizedTest
+    @MethodSource("suppliers")
     public void testSetInvalidBufferSize(String name, DatagramSocketSupplier supplier) throws IOException {
         var invalidArgs = new int[]{ -1, 0 };
 
         try (var socket = supplier.open()) {
             for (int i : invalidArgs) {
-                Exception ex = expectThrows(IAE, () -> socket.setSendBufferSize(i));
+                Exception ex = assertThrows(IAE, () -> socket.setSendBufferSize(i));
                 System.out.println(name + " got expected exception: " + ex);
             }
         }
     }
 
-    @Test(dataProvider = "invariants")
+    @ParameterizedTest
+    @MethodSource("suppliers")
     public void testSetAndGetBufferSize(String name, DatagramSocketSupplier supplier) throws IOException {
         var validArgs = new int[]{ 2345, 3456 };
 
         try (var socket = supplier.open()) {
             for (int i : validArgs) {
                 socket.setSendBufferSize(i);
-                assertEquals(socket.getSendBufferSize(), i, name);
+                assertEquals(i, socket.getSendBufferSize(), name);
             }
         }
     }
 
-    @Test(dataProvider = "invariants")
+    @ParameterizedTest
+    @MethodSource("suppliers")
     public void testInitialSendBufferSize(String name, DatagramSocketSupplier supplier) throws IOException {
         if (Platform.isOSX()) {
             try (var socket = supplier.open()){
                 assertTrue(socket.getSendBufferSize() >= 65507, name);
                 if (IPSupport.hasIPv6() && !IPSupport.preferIPv4Stack()) {
-                    assertEquals(socket.getSendBufferSize(), 65527, name);
+                    assertEquals(65527, socket.getSendBufferSize(), name);
                 }
             }
         }
     }
 
-    @Test(dataProvider = "invariants")
+    @ParameterizedTest
+    @MethodSource("suppliers")
     public void testSetGetAfterClose(String name, DatagramSocketSupplier supplier) throws IOException {
         var socket = supplier.open();
         socket.close();
 
-        Exception setException = expectThrows(SE, () -> socket.setSendBufferSize(2345));
+        Exception setException = assertThrows(SE, () -> socket.setSendBufferSize(2345));
         System.out.println(name + " got expected exception: " + setException);
 
-        Exception getException = expectThrows(SE, () -> socket.getSendBufferSize());
+        Exception getException = assertThrows(SE, () -> socket.getSendBufferSize());
         System.out.println(name + " got expected exception: " + getException);
     }
 }
diff --git a/test/jdk/java/net/DatagramSocket/SupportedOptionsCheck.java b/test/jdk/java/net/DatagramSocket/SupportedOptionsCheck.java
index 9ad381be73c..0186e3e4d46 100644
--- a/test/jdk/java/net/DatagramSocket/SupportedOptionsCheck.java
+++ b/test/jdk/java/net/DatagramSocket/SupportedOptionsCheck.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2019, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2019, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -27,17 +27,17 @@
  * @library /test/lib
  * @summary checks that the DatagramSocket supportedOptions set contains all
  *  MulticastSocket socket options
- * @run testng SupportedOptionsCheck
+ * @run junit ${test.main.class}
  */
 
 import jdk.test.lib.Platform;
-import org.testng.annotations.Test;
 
 import java.net.DatagramSocket;
 import java.net.StandardSocketOptions;
 import java.util.Set;
 
-import static org.testng.Assert.assertTrue;
+import org.junit.jupiter.api.Test;
+import static org.junit.jupiter.api.Assertions.assertTrue;
 
 public class SupportedOptionsCheck {
 

From ac74e6f9433f1e0ad177e579bde7f2338189d6c6 Mon Sep 17 00:00:00 2001
From: Albert Mingkun Yang <ayang@openjdk.org>
Date: Mon, 13 Apr 2026 10:56:38 +0000
Subject: [PATCH 574/655] 8382055: G1: Remove unused unused args in
 mark_evac_failure_object

Reviewed-by: tschatzl
---
 src/hotspot/share/gc/g1/g1CollectedHeap.cpp      | 2 +-
 src/hotspot/share/gc/g1/g1CollectedHeap.hpp      | 2 +-
 src/hotspot/share/gc/g1/g1ParScanThreadState.cpp | 2 +-
 3 files changed, 3 insertions(+), 3 deletions(-)

diff --git a/src/hotspot/share/gc/g1/g1CollectedHeap.cpp b/src/hotspot/share/gc/g1/g1CollectedHeap.cpp
index fe286793ae7..2709e6b3008 100644
--- a/src/hotspot/share/gc/g1/g1CollectedHeap.cpp
+++ b/src/hotspot/share/gc/g1/g1CollectedHeap.cpp
@@ -3219,7 +3219,7 @@ void G1CollectedHeap::retire_gc_alloc_region(G1HeapRegion* alloc_region,
   G1HeapRegionPrinter::retire(alloc_region);
 }
 
-void G1CollectedHeap::mark_evac_failure_object(uint worker_id, const oop obj, size_t obj_size) const {
+void G1CollectedHeap::mark_evac_failure_object(const oop obj) const {
   assert(!_cm->is_marked_in_bitmap(obj), "must be");
 
   _cm->raw_mark_in_bitmap(obj);
diff --git a/src/hotspot/share/gc/g1/g1CollectedHeap.hpp b/src/hotspot/share/gc/g1/g1CollectedHeap.hpp
index b5cb9167d92..3a47453819e 100644
--- a/src/hotspot/share/gc/g1/g1CollectedHeap.hpp
+++ b/src/hotspot/share/gc/g1/g1CollectedHeap.hpp
@@ -1275,7 +1275,7 @@ public:
   inline bool is_obj_dead_full(const oop obj) const;
 
   // Mark the live object that failed evacuation in the bitmap.
-  void mark_evac_failure_object(uint worker_id, oop obj, size_t obj_size) const;
+  void mark_evac_failure_object(oop obj) const;
 
   G1ConcurrentMark* concurrent_mark() const { return _cm; }
 
diff --git a/src/hotspot/share/gc/g1/g1ParScanThreadState.cpp b/src/hotspot/share/gc/g1/g1ParScanThreadState.cpp
index cb857dc6eab..2b0e6ce9cf4 100644
--- a/src/hotspot/share/gc/g1/g1ParScanThreadState.cpp
+++ b/src/hotspot/share/gc/g1/g1ParScanThreadState.cpp
@@ -650,7 +650,7 @@ oop G1ParScanThreadState::handle_evacuation_failure_par(oop old, markWord m, Kla
 
     // Mark the failing object in the marking bitmap and later use the bitmap to handle
     // evacuation failure recovery.
-    _g1h->mark_evac_failure_object(_worker_id, old, word_sz);
+    _g1h->mark_evac_failure_object(old);
 
     _evacuation_failed_info.register_copy_failure(word_sz);
 

From 03b46a308ce944b515939db613f5250a5b84b844 Mon Sep 17 00:00:00 2001
From: Daniel Fuchs <dfuchs@openjdk.org>
Date: Mon, 13 Apr 2026 12:44:27 +0000
Subject: [PATCH 575/655] 8381767: Refactor various java/net/*[URL/Http]*/
 TestNG tests to use JUnit

Reviewed-by: vyazici, myankelevich
---
 .../whitebox/MaxAgeExpiresDriver.java         |  6 +-
 .../java.base/java/net/MaxAgeExpires.java     | 42 ++++----
 .../HttpURLConnectionHeadersOrder.java        | 54 ++++++-----
 .../HttpURLProxySelectionTest.java            | 55 +++++------
 .../HttpURLConnection/Response1xxTest.java    | 39 ++++----
 .../JarURLConnection/TestDefaultBehavior.java | 95 ++++++++++---------
 .../definePackage/SplitPackage.java           | 29 +++---
 .../net/URLConnection/RequestProperties.java  | 48 +++++-----
 .../URLConnection/SetDefaultUseCaches.java    | 31 +++---
 .../URLConnectionHeadersOrder.java            | 19 ++--
 .../jdk/java/net/URLDecoder/EncodingTest.java | 44 +++++----
 .../jdk/java/net/URLEncoder/EncodingTest.java | 25 ++---
 .../net/URLPermission/EmptyAuthorityTest.java | 26 ++---
 .../URLPermission/InvalidCharacterTest.java   | 19 ++--
 .../URLStreamHandler/TestDefaultBehavior.java | 25 ++---
 15 files changed, 297 insertions(+), 260 deletions(-)

diff --git a/test/jdk/java/net/HttpCookie/whitebox/MaxAgeExpiresDriver.java b/test/jdk/java/net/HttpCookie/whitebox/MaxAgeExpiresDriver.java
index 7f535fa0c23..c3cc3eddc68 100644
--- a/test/jdk/java/net/HttpCookie/whitebox/MaxAgeExpiresDriver.java
+++ b/test/jdk/java/net/HttpCookie/whitebox/MaxAgeExpiresDriver.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2025, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,7 +25,5 @@
  * @test
  * @bug 8351983
  * @summary HttpCookie Parser Incorrectly Handles Cookies with Expires Attribute
- * @run testng java.base/java.net.MaxAgeExpires
+ * @run junit java.base/java.net.MaxAgeExpires
  */
-public class MaxAgeExpiresDriver {
-}
\ No newline at end of file
diff --git a/test/jdk/java/net/HttpCookie/whitebox/java.base/java/net/MaxAgeExpires.java b/test/jdk/java/net/HttpCookie/whitebox/java.base/java/net/MaxAgeExpires.java
index 5c4f8f66b3d..6704a290836 100644
--- a/test/jdk/java/net/HttpCookie/whitebox/java.base/java/net/MaxAgeExpires.java
+++ b/test/jdk/java/net/HttpCookie/whitebox/java.base/java/net/MaxAgeExpires.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2025, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,12 +23,16 @@
 
 package java.net;
 
-import java.time.*;
+import java.time.Instant;
+import java.time.ZoneId;
+import java.time.ZonedDateTime;
 import java.time.format.DateTimeFormatter;
-import java.util.*;
-import org.testng.Assert;
-import org.testng.annotations.Test;
-import org.testng.annotations.DataProvider;
+
+import org.junit.jupiter.api.Test;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
 
 public class MaxAgeExpires {
 
@@ -54,8 +58,7 @@ public class MaxAgeExpires {
         return zdt.toInstant().getEpochSecond() * 1000; // always exact seconds
     }
 
-    @DataProvider(name = "testData")
-    public Object[][] testData() {
+    public static Object[][] testData() {
         return new Object[][] {
             // Date string in past. But checking based on current time.
             {-1L, -1L, -1L, DT1, 0, true},
@@ -79,10 +82,11 @@ public class MaxAgeExpires {
             {zdtToMillis(zdt1), zdtToMillis(zdt2), -1L, DT3,120, false}
 
         };
-    };
+    }
 
 
-    @Test(dataProvider = "testData")
+    @ParameterizedTest
+    @MethodSource("testData")
     public void test1(long creationInstant, // if -1, then current time is used
                     long expiryCheckInstant,  // if -1 then current time is used
                     long maxAge, // if -1, then not included in String
@@ -99,7 +103,7 @@ public class MaxAgeExpires {
             sb.append("; max-age=" + Long.toString(maxAge));
 
         String s = sb.toString();
-        System.out.println(s);
+        System.err.println(s);
         HttpCookie cookie;
         if (creationInstant == -1)
             cookie = HttpCookie.parse(s).get(0);
@@ -107,8 +111,8 @@ public class MaxAgeExpires {
             cookie = HttpCookie.parse(s, false, creationInstant).get(0);
 
         if (expectedAge != -1 && cookie.getMaxAge() != expectedAge) {
-            System.out.println("getMaxAge returned " + cookie.getMaxAge());
-            System.out.println("expectedAge was " + expectedAge);
+            System.err.println("getMaxAge returned " + cookie.getMaxAge());
+            System.err.println("expectedAge was " + expectedAge);
             throw new RuntimeException("Test failed: wrong age");
         }
 
@@ -117,9 +121,9 @@ public class MaxAgeExpires {
             : cookie.hasExpired(expiryCheckInstant);
 
         if (expired != hasExpired) {
-            System.out.println("cookie.hasExpired() returned " + expired);
-            System.out.println("hasExpired was " + hasExpired);
-            System.out.println("getMaxAge() returned " + cookie.getMaxAge());
+            System.err.println("cookie.hasExpired() returned " + expired);
+            System.err.println("hasExpired was " + hasExpired);
+            System.err.println("getMaxAge() returned " + cookie.getMaxAge());
             throw new RuntimeException("Test failed: wrong hasExpired");
         }
     }
@@ -128,10 +132,10 @@ public class MaxAgeExpires {
     public void test2() {
         // Miscellaneous tests that setMaxAge() overrides whatever was set already
         HttpCookie cookie = HttpCookie.parse("Set-Cookie: name=value; max-age=100").get(0);
-        Assert.assertEquals(cookie.getMaxAge(), 100);
+        assertEquals(100, cookie.getMaxAge());
         cookie.setMaxAge(200);
-        Assert.assertEquals(cookie.getMaxAge(), 200);
+        assertEquals(200, cookie.getMaxAge());
         cookie.setMaxAge(-2);
-        Assert.assertEquals(cookie.getMaxAge(), -2);
+        assertEquals(-2, cookie.getMaxAge());
     }
 }
diff --git a/test/jdk/java/net/HttpURLConnection/HttpURLConnectionHeadersOrder.java b/test/jdk/java/net/HttpURLConnection/HttpURLConnectionHeadersOrder.java
index a44eef9c3f5..9a490ce18e7 100644
--- a/test/jdk/java/net/HttpURLConnection/HttpURLConnectionHeadersOrder.java
+++ b/test/jdk/java/net/HttpURLConnection/HttpURLConnectionHeadersOrder.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2021, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -21,30 +21,36 @@
  * questions.
  */
 
-/**
+/*
  * @test
  * @bug 8133686
  * @summary Ensuring that multiple header values for a given field-name are returned in
  *          the order they were added for HttpURLConnection.getRequestProperties
  *          and HttpURLConnection.getHeaderFields
  * @library /test/lib
- * @run testng HttpURLConnectionHeadersOrder
+ * @run junit ${test.main.class}
  */
 
 import com.sun.net.httpserver.HttpExchange;
 import com.sun.net.httpserver.HttpHandler;
 import com.sun.net.httpserver.HttpServer;
 import jdk.test.lib.net.URIBuilder;
-import org.testng.Assert;
-import org.testng.annotations.AfterTest;
-import org.testng.annotations.BeforeTest;
-import org.testng.annotations.Test;
 
 import java.io.IOException;
-import java.net.*;
+import java.net.HttpURLConnection;
+import java.net.InetAddress;
+import java.net.InetSocketAddress;
+import java.net.URL;
 import java.util.Arrays;
 import java.util.List;
 
+import org.junit.jupiter.api.AfterAll;
+import org.junit.jupiter.api.BeforeAll;
+import org.junit.jupiter.api.Test;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertNotNull;
+
 public class HttpURLConnectionHeadersOrder {
     private static final String LOCAL_TEST_ENDPOINT = "/headertest";
     private static final String ERROR_MESSAGE_TEMPLATE = "Expected Request Properties = %s, Actual Request Properties = %s";
@@ -53,8 +59,8 @@ public class HttpURLConnectionHeadersOrder {
     private static URL serverUrl;
 
 
-    @BeforeTest
-    public void beforeTest() throws Exception {
+    @BeforeAll
+    public static void beforeTest() throws Exception {
         SimpleHandler handler = new SimpleHandler();
         server = createSimpleHttpServer(handler);
         serverUrl = URIBuilder.newBuilder()
@@ -65,8 +71,8 @@ public class HttpURLConnectionHeadersOrder {
                 .toURL();
     }
 
-    @AfterTest
-    public void afterTest() {
+    @AfterAll
+    public static void afterTest() {
         if (server != null)
             server.stop(0);
     }
@@ -77,9 +83,9 @@ public class HttpURLConnectionHeadersOrder {
      * - request to a "dummy" server with additional
      * - custom request properties
      *
-     * @throws Exception
+     * @throws Exception if failed
      */
-    @Test (priority = 1)
+    @Test
     public void testRequestPropertiesOrder() throws Exception {
         final var conn = (HttpURLConnection) serverUrl.openConnection();
 
@@ -93,8 +99,9 @@ public class HttpURLConnectionHeadersOrder {
         var customRequestProps = requestProperties.get("test_req_prop");
 
         conn.disconnect();
-        Assert.assertNotNull(customRequestProps);
-        Assert.assertEquals(customRequestProps, EXPECTED_HEADER_VALUES, String.format(ERROR_MESSAGE_TEMPLATE, EXPECTED_HEADER_VALUES.toString(), customRequestProps.toString()));
+        assertNotNull(customRequestProps);
+        assertEquals(EXPECTED_HEADER_VALUES, customRequestProps,
+                "Unexpected value for request header \"test_req_prop\"");
     }
 
     /**
@@ -105,7 +112,7 @@ public class HttpURLConnectionHeadersOrder {
      *
      * @throws Exception
      */
-    @Test (priority = 2)
+    @Test
     public void testServerSideRequestHeadersOrder() throws Exception {
         final var conn = (HttpURLConnection) serverUrl.openConnection();
         conn.addRequestProperty("test_server_handling", "a");
@@ -114,17 +121,19 @@ public class HttpURLConnectionHeadersOrder {
 
         int statusCode = conn.getResponseCode();
         conn.disconnect();
-        Assert.assertEquals(statusCode, 999, "The insertion-order was not preserved on the server-side response headers handling");
+        assertEquals(999, statusCode,
+                "The insertion-order was not preserved on the server-side response headers handling");
     }
 
-    @Test (priority = 3)
+    @Test
     public void testClientSideResponseHeadersOrder() throws Exception {
         final var conn = (HttpURLConnection) serverUrl.openConnection();
         conn.setRequestMethod("GET");
 
         var actualCustomResponseHeaders = conn.getHeaderFields().get("Test_response");
-        Assert.assertNotNull(actualCustomResponseHeaders, "Error in reading custom response headers");
-        Assert.assertEquals(EXPECTED_HEADER_VALUES, actualCustomResponseHeaders, String.format(ERROR_MESSAGE_TEMPLATE, EXPECTED_HEADER_VALUES.toString(), actualCustomResponseHeaders.toString()));
+        assertNotNull(actualCustomResponseHeaders, "Error in reading custom response headers");
+        assertEquals(EXPECTED_HEADER_VALUES, actualCustomResponseHeaders,
+                "Unexpected value for response header field \"Test_response\"");
     }
 
     private static HttpServer createSimpleHttpServer(SimpleHandler handler) throws IOException {
@@ -153,7 +162,8 @@ public class HttpURLConnectionHeadersOrder {
             }
 
             if (!actualTestRequestHeaders.equals(EXPECTED_HEADER_VALUES)) {
-                System.out.println("Error: " + String.format(ERROR_MESSAGE_TEMPLATE, EXPECTED_HEADER_VALUES.toString(), actualTestRequestHeaders.toString()));
+                System.out.printf("Error for \"test_server_handling\" " +
+                        String.format(ERROR_MESSAGE_TEMPLATE, EXPECTED_HEADER_VALUES, actualTestRequestHeaders));
                 return -1;
             }
             return 999;
diff --git a/test/jdk/java/net/HttpURLConnection/HttpURLProxySelectionTest.java b/test/jdk/java/net/HttpURLConnection/HttpURLProxySelectionTest.java
index a6f2fbc1ae6..be922608c80 100644
--- a/test/jdk/java/net/HttpURLConnection/HttpURLProxySelectionTest.java
+++ b/test/jdk/java/net/HttpURLConnection/HttpURLProxySelectionTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2019, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2019, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,10 +25,6 @@ import com.sun.net.httpserver.HttpExchange;
 import com.sun.net.httpserver.HttpHandler;
 import com.sun.net.httpserver.HttpServer;
 import jdk.test.lib.net.URIBuilder;
-import org.testng.Assert;
-import org.testng.annotations.AfterTest;
-import org.testng.annotations.BeforeTest;
-import org.testng.annotations.Test;
 import sun.net.spi.DefaultProxySelector;
 
 import java.io.IOException;
@@ -42,35 +38,43 @@ import java.net.URISyntaxException;
 import java.net.URL;
 import java.util.List;
 
-/**
+import org.junit.jupiter.api.AfterAll;
+import org.junit.jupiter.api.BeforeAll;
+import org.junit.jupiter.api.Test;
+
+import static org.junit.jupiter.api.Assertions.assertInstanceOf;
+import static org.junit.jupiter.api.Assertions.assertThrows;
+import static org.junit.jupiter.api.Assertions.assertTrue;
+
+/*
  * @test
  * @bug 6563286 6797318 8177648 8230220
  * @summary Tests that sun.net.www.protocol.http.HttpURLConnection when dealing with
  * sun.net.spi.DefaultProxySelector#select() handles any IllegalArgumentException
  * correctly
  * @library /test/lib
- * @run testng HttpURLProxySelectionTest
+ * @run junit ${test.main.class}
  * @modules java.base/sun.net.spi:+open
  */
 public class HttpURLProxySelectionTest {
 
     private static final String WEB_APP_CONTEXT = "/httpurlproxytest";
 
-    private HttpServer server;
-    private SimpleHandler handler;
-    private ProxySelector previousDefault;
-    private CustomProxySelector ourProxySelector = new CustomProxySelector();
+    private static HttpServer server;
+    private static SimpleHandler handler;
+    private static ProxySelector previousDefault;
+    private static final CustomProxySelector ourProxySelector = new CustomProxySelector();
 
-    @BeforeTest
-    public void beforeTest() throws Exception {
+    @BeforeAll
+    public static void beforeTest() throws Exception {
         previousDefault = ProxySelector.getDefault();
         ProxySelector.setDefault(ourProxySelector);
         handler = new SimpleHandler();
         server = createServer(handler);
     }
 
-    @AfterTest
-    public void afterTest() {
+    @AfterAll
+    public static void afterTest() {
         try {
             if (server != null) {
                 final int delaySeconds = 0;
@@ -86,7 +90,7 @@ public class HttpURLProxySelectionTest {
      * - Server receives request and sends a 301 redirect to an URI which doesn't have a "host"
      * - Redirect is expected to fail with IOException (caused by IllegalArgumentException from DefaultProxySelector)
      *
-     * @throws Exception
+     * @throws Exception if failed
      */
     @Test
     public void test() throws Exception {
@@ -98,19 +102,16 @@ public class HttpURLProxySelectionTest {
                 .toURL();
         System.out.println("Sending request to " + targetURL);
         final HttpURLConnection conn = (HttpURLConnection) targetURL.openConnection();
-        try {
-            conn.getResponseCode();
-            Assert.fail("Request to " + targetURL + " was expected to fail during redirect");
-        } catch (IOException ioe) {
-            // expected because of the redirect to an invalid URL, for which a proxy can't be selected
+        // expected because of the redirect to an invalid URL, for which a proxy can't be selected
+        IOException ioe = assertThrows(IOException.class, conn::getResponseCode,
+            "Request to " + targetURL + " was expected to fail during redirect");
 
-            // make sure the it was indeed a redirect
-            Assert.assertTrue(handler.redirectSent, "Server was expected to send a redirect, but didn't");
-            Assert.assertTrue(ourProxySelector.selectorUsedForRedirect, "Proxy selector wasn't used for redirect");
+        // make sure the IOException was indeed a redirect
+        assertTrue(handler.redirectSent, "Server was expected to send a redirect, but didn't");
+        assertTrue(ourProxySelector.selectorUsedForRedirect, "Proxy selector wasn't used for redirect");
 
-            // make sure the IOException was caused by an IllegalArgumentException
-            Assert.assertTrue(ioe.getCause() instanceof IllegalArgumentException, "Unexpected cause in the IOException");
-        }
+        // make sure the IOException was caused by an IllegalArgumentException
+        assertInstanceOf(IllegalArgumentException.class, ioe.getCause(), "Unexpected cause in the IOException");
     }
 
 
diff --git a/test/jdk/java/net/HttpURLConnection/Response1xxTest.java b/test/jdk/java/net/HttpURLConnection/Response1xxTest.java
index 2be9772ed29..bdda7821bf8 100644
--- a/test/jdk/java/net/HttpURLConnection/Response1xxTest.java
+++ b/test/jdk/java/net/HttpURLConnection/Response1xxTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2022, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2022, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -33,28 +33,31 @@ import java.net.URI;
 import java.nio.charset.StandardCharsets;
 
 import jdk.test.lib.net.URIBuilder;
-import org.testng.Assert;
-import org.testng.annotations.AfterClass;
-import org.testng.annotations.BeforeClass;
-import org.testng.annotations.Test;
 
-/**
+import org.junit.jupiter.api.AfterAll;
+import org.junit.jupiter.api.BeforeAll;
+import org.junit.jupiter.api.Test;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertThrows;
+
+/*
  * @test
  * @bug 8170305
  * @summary Tests behaviour of HttpURLConnection when server responds with 1xx interim response status codes
  * @library /test/lib
- * @run testng Response1xxTest
+ * @run junit ${test.main.class}
  */
 public class Response1xxTest {
     private static final String EXPECTED_RSP_BODY = "Hello World";
 
-    private ServerSocket serverSocket;
-    private Http11Server server;
-    private String requestURIBase;
+    private static ServerSocket serverSocket;
+    private static Http11Server server;
+    private static String requestURIBase;
 
 
-    @BeforeClass
-    public void setup() throws Exception {
+    @BeforeAll
+    public static void setup() throws Exception {
         serverSocket = new ServerSocket(0, 0, InetAddress.getLoopbackAddress());
         server = new Http11Server(serverSocket);
         new Thread(server).start();
@@ -62,8 +65,8 @@ public class Response1xxTest {
                 .port(serverSocket.getLocalPort()).build().toString();
     }
 
-    @AfterClass
-    public void teardown() throws Exception {
+    @AfterAll
+    public static void teardown() throws Exception {
         if (server != null) {
             server.stop = true;
             System.out.println("(HTTP 1.1) Server stop requested");
@@ -166,7 +169,7 @@ public class Response1xxTest {
 
         static String readRequestLine(final Socket sock) throws IOException {
             final InputStream is = sock.getInputStream();
-            final StringBuilder sb = new StringBuilder("");
+            final StringBuilder sb = new StringBuilder();
             byte[] buf = new byte[1024];
             while (!sb.toString().endsWith("\r\n\r\n")) {
                 final int numRead = is.read(buf);
@@ -203,13 +206,13 @@ public class Response1xxTest {
             System.out.println("Issuing request to " + requestURI);
             final HttpURLConnection urlConnection = (HttpURLConnection) requestURI.toURL().openConnection();
             final int responseCode = urlConnection.getResponseCode();
-            Assert.assertEquals(responseCode, 200, "Unexpected response code");
+            assertEquals(200, responseCode, "Unexpected response code");
             final String body;
             try (final InputStream is = urlConnection.getInputStream()) {
                 final byte[] bytes = is.readAllBytes();
                 body = new String(bytes, StandardCharsets.UTF_8);
             }
-            Assert.assertEquals(body, EXPECTED_RSP_BODY, "Unexpected response body");
+            assertEquals(EXPECTED_RSP_BODY, body, "Unexpected response body");
         }
     }
 
@@ -223,6 +226,6 @@ public class Response1xxTest {
         System.out.println("Issuing request to " + requestURI);
         final HttpURLConnection urlConnection = (HttpURLConnection) requestURI.toURL().openConnection();
         // we expect the request to fail because the server unexpectedly sends a 101 response
-        Assert.assertThrows(ProtocolException.class, () -> urlConnection.getResponseCode());
+        assertThrows(ProtocolException.class, urlConnection::getResponseCode);
     }
 }
diff --git a/test/jdk/java/net/JarURLConnection/TestDefaultBehavior.java b/test/jdk/java/net/JarURLConnection/TestDefaultBehavior.java
index 69b6c588af8..6a0173ac692 100644
--- a/test/jdk/java/net/JarURLConnection/TestDefaultBehavior.java
+++ b/test/jdk/java/net/JarURLConnection/TestDefaultBehavior.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2019, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2019, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -26,7 +26,7 @@
  * @bug 8225037
  * @library /test/lib
  * @summary Basic test for java.net.JarURLConnection default behavior
- * @run testng/othervm TestDefaultBehavior
+ * @run junit/othervm ${test.main.class}
  */
 
 import java.io.IOException;
@@ -39,10 +39,13 @@ import java.nio.file.Files;
 import java.nio.file.Path;
 import java.util.jar.JarFile;
 import jdk.test.lib.util.JarUtils;
-import org.testng.annotations.BeforeTest;
-import org.testng.annotations.Test;
-import static org.testng.Assert.assertEquals;
-import static org.testng.Assert.assertNotNull;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertNotNull;
+import static org.junit.jupiter.api.Assertions.assertNull;
+
+import org.junit.jupiter.api.BeforeAll;
+import org.junit.jupiter.api.Test;
 
 public class TestDefaultBehavior {
 
@@ -50,8 +53,8 @@ public class TestDefaultBehavior {
     //   1. jar without a manifest
     //   2. jar with a manifest
     //   3. jar with manifest that includes an entry attribute
-    @BeforeTest
-    public void setup() throws Exception {
+    @BeforeAll
+    public static void setup() throws Exception {
         URLConnection.setDefaultUseCaches("jar", false);
         URLConnection.setDefaultUseCaches("file", false);
 
@@ -76,14 +79,14 @@ public class TestDefaultBehavior {
         URL jarFileURL = URI.create("jar:" + fileURI + "!/").toURL();
         JarURLConnection jarURLConnection = new CustomJarURLConnection(jarFileURL);
 
-        assertEquals(jarURLConnection.getAttributes(), null);
-        assertEquals(jarURLConnection.getCertificates(), null);
-        assertEquals(jarURLConnection.getEntryName(), null);
-        assertEquals(jarURLConnection.getJarEntry(), null);
+        assertNull(jarURLConnection.getAttributes());
+        assertNull(jarURLConnection.getCertificates());
+        assertNull(jarURLConnection.getEntryName());
+        assertNull(jarURLConnection.getJarEntry());
         assertNotNull(jarURLConnection.getJarFile());
-        assertEquals(jarURLConnection.getJarFileURL(), fileURI.toURL());
-        assertEquals(jarURLConnection.getMainAttributes(), null);
-        assertEquals(jarURLConnection.getManifest(), null);
+        assertEquals(fileURI.toURL(), jarURLConnection.getJarFileURL());
+        assertNull(jarURLConnection.getMainAttributes());
+        assertNull(jarURLConnection.getManifest());
     }
 
     @Test
@@ -92,14 +95,14 @@ public class TestDefaultBehavior {
         URL jarFileURL = URI.create("jar:" + fileURI + "!/foo.txt").toURL();
         JarURLConnection jarURLConnection = new CustomJarURLConnection(jarFileURL);
 
-        assertEquals(jarURLConnection.getAttributes(), null);
-        assertEquals(jarURLConnection.getCertificates(), null);
-        assertEquals(jarURLConnection.getEntryName(), "foo.txt");
-        assertEquals(jarURLConnection.getJarEntry().getName(), "foo.txt");
+        assertNull(jarURLConnection.getAttributes());
+        assertNull(jarURLConnection.getCertificates());
+        assertEquals("foo.txt", jarURLConnection.getEntryName());
+        assertEquals("foo.txt", jarURLConnection.getJarEntry().getName());
         assertNotNull(jarURLConnection.getJarFile());
-        assertEquals(jarURLConnection.getJarFileURL(), fileURI.toURL());
-        assertEquals(jarURLConnection.getMainAttributes(), null);
-        assertEquals(jarURLConnection.getManifest(), null);
+        assertEquals(fileURI.toURL(), jarURLConnection.getJarFileURL());
+        assertNull(jarURLConnection.getMainAttributes());
+        assertNull(jarURLConnection.getManifest());
     }
 
     @Test
@@ -108,13 +111,13 @@ public class TestDefaultBehavior {
         URL jarFileURL = URI.create("jar:" + fileURI + "!/").toURL();
         JarURLConnection jarURLConnection = new CustomJarURLConnection(jarFileURL);
 
-        assertEquals(jarURLConnection.getAttributes(), null);
-        assertEquals(jarURLConnection.getCertificates(), null);
-        assertEquals(jarURLConnection.getEntryName(), null);
-        assertEquals(jarURLConnection.getJarEntry(), null);
+        assertNull(jarURLConnection.getAttributes());
+        assertNull(jarURLConnection.getCertificates());
+        assertNull(jarURLConnection.getEntryName());
+        assertNull(jarURLConnection.getJarEntry());
         assertNotNull(jarURLConnection.getJarFile());
-        assertEquals(jarURLConnection.getJarFileURL(), fileURI.toURL());
-        assertEquals(jarURLConnection.getMainAttributes().getValue("Manifest-Version"), "5.5");
+        assertEquals(fileURI.toURL(), jarURLConnection.getJarFileURL());
+        assertEquals("5.5", jarURLConnection.getMainAttributes().getValue("Manifest-Version"));
         assertNotNull(jarURLConnection.getManifest());
     }
 
@@ -124,13 +127,13 @@ public class TestDefaultBehavior {
         URL jarFileURL = URI.create("jar:" + fileURI + "!/foo.txt").toURL();
         JarURLConnection jarURLConnection = new CustomJarURLConnection(jarFileURL);
 
-        assertEquals(jarURLConnection.getAttributes(), null);
-        assertEquals(jarURLConnection.getCertificates(), null);
-        assertEquals(jarURLConnection.getEntryName(), "foo.txt");
-        assertEquals(jarURLConnection.getJarEntry().getName(), "foo.txt");
+        assertNull(jarURLConnection.getAttributes());
+        assertNull(jarURLConnection.getCertificates());
+        assertEquals("foo.txt", jarURLConnection.getEntryName());
+        assertEquals("foo.txt", jarURLConnection.getJarEntry().getName());
         assertNotNull(jarURLConnection.getJarFile());
-        assertEquals(jarURLConnection.getJarFileURL(), fileURI.toURL());
-        assertEquals(jarURLConnection.getMainAttributes().getValue("Manifest-Version"), "5.5");
+        assertEquals(fileURI.toURL(), jarURLConnection.getJarFileURL());
+        assertEquals("5.5", jarURLConnection.getMainAttributes().getValue("Manifest-Version"));
         assertNotNull(jarURLConnection.getManifest());
     }
 
@@ -140,13 +143,13 @@ public class TestDefaultBehavior {
         URL jarFileURL = URI.create("jar:" + fileURI + "!/").toURL();
         JarURLConnection jarURLConnection = new CustomJarURLConnection(jarFileURL);
 
-        assertEquals(jarURLConnection.getAttributes(), null);
-        assertEquals(jarURLConnection.getCertificates(), null);
-        assertEquals(jarURLConnection.getEntryName(), null);
-        assertEquals(jarURLConnection.getJarEntry(), null);
+        assertNull(jarURLConnection.getAttributes());
+        assertNull(jarURLConnection.getCertificates());
+        assertNull(jarURLConnection.getEntryName());
+        assertNull(jarURLConnection.getJarEntry());
         assertNotNull(jarURLConnection.getJarFile());
-        assertEquals(jarURLConnection.getJarFileURL(), fileURI.toURL());
-        assertEquals(jarURLConnection.getMainAttributes().getValue("Manifest-Version"), "7.7");
+        assertEquals(fileURI.toURL(), jarURLConnection.getJarFileURL());
+        assertEquals("7.7", jarURLConnection.getMainAttributes().getValue("Manifest-Version"));
         assertNotNull(jarURLConnection.getManifest());
     }
 
@@ -156,13 +159,13 @@ public class TestDefaultBehavior {
         URL jarFileURL = URI.create("jar:" + fileURI + "!/foo.txt").toURL();
         JarURLConnection jarURLConnection = new CustomJarURLConnection(jarFileURL);
 
-        assertEquals(jarURLConnection.getAttributes().getValue("Greeting"), "true");
-        assertEquals(jarURLConnection.getCertificates(), null);
-        assertEquals(jarURLConnection.getEntryName(), "foo.txt");
-        assertEquals(jarURLConnection.getJarEntry().getName(), "foo.txt");
+        assertEquals("true", jarURLConnection.getAttributes().getValue("Greeting"));
+        assertNull(jarURLConnection.getCertificates());
+        assertEquals("foo.txt", jarURLConnection.getEntryName());
+        assertEquals("foo.txt", jarURLConnection.getJarEntry().getName());
         assertNotNull(jarURLConnection.getJarFile());
-        assertEquals(jarURLConnection.getJarFileURL(), fileURI.toURL());
-        assertEquals(jarURLConnection.getMainAttributes().getValue("Manifest-Version"), "7.7");
+        assertEquals(fileURI.toURL(), jarURLConnection.getJarFileURL());
+        assertEquals("7.7", jarURLConnection.getMainAttributes().getValue("Manifest-Version"));
         assertNotNull(jarURLConnection.getManifest());
     }
 
diff --git a/test/jdk/java/net/URLClassLoader/definePackage/SplitPackage.java b/test/jdk/java/net/URLClassLoader/definePackage/SplitPackage.java
index e8698dddf6b..47e32b39a4b 100644
--- a/test/jdk/java/net/URLClassLoader/definePackage/SplitPackage.java
+++ b/test/jdk/java/net/URLClassLoader/definePackage/SplitPackage.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2016, 2017, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2016, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -28,7 +28,7 @@
  * @library /test/lib
  * @build jdk.test.lib.compiler.CompilerUtils
  * @modules jdk.compiler
- * @run testng SplitPackage
+ * @run junit ${test.main.class}
  */
 
 import java.net.URL;
@@ -40,17 +40,21 @@ import java.nio.file.StandardCopyOption;
 import java.util.jar.Manifest;
 import jdk.test.lib.compiler.CompilerUtils;
 
-import org.testng.annotations.BeforeTest;
-import org.testng.annotations.Test;
-import static org.testng.Assert.*;
+import org.junit.jupiter.api.BeforeAll;
+import org.junit.jupiter.api.Test;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertNotSame;
+import static org.junit.jupiter.api.Assertions.assertThrows;
+import static org.junit.jupiter.api.Assertions.assertTrue;
 
 public class SplitPackage {
     private static final Path SRC_DIR = Paths.get(System.getProperty("test.src", "."));
     private static final Path FOO_DIR = Paths.get("foo");
     private static final Path BAR_DIR = Paths.get("bar");
 
-    @BeforeTest
-    private void setup() throws Exception {
+    @BeforeAll
+    public static void setup() throws Exception {
         Files.createDirectory(BAR_DIR);
 
         Path pkgDir = Paths.get("p");
@@ -80,14 +84,11 @@ public class SplitPackage {
         Package pForFoo = loader1.getDefinedPackage("p");
         Package pForBar = loader2.getDefinedPackage("p");
 
-        assertEquals(pForFoo.getName(), pForBar.getName());
-        assertTrue(pForFoo != pForBar);
+        assertEquals(pForBar.getName(), pForFoo.getName());
+        assertNotSame(pForBar, pForFoo);
 
-        try {
-            loader2.defineSplitPackage("p");
-        } catch (IllegalArgumentException e) {
-
-        }
+        assertThrows(IllegalArgumentException.class,
+                () -> loader2.defineSplitPackage("p"));
     }
 
     static class Loader extends URLClassLoader {
diff --git a/test/jdk/java/net/URLConnection/RequestProperties.java b/test/jdk/java/net/URLConnection/RequestProperties.java
index d052f1aeaf2..84206d89868 100644
--- a/test/jdk/java/net/URLConnection/RequestProperties.java
+++ b/test/jdk/java/net/URLConnection/RequestProperties.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2001, 2020, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2001, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -21,17 +21,14 @@
  * questions.
  */
 
-/**
+/*
  * @test
  * @bug 4485208 8252767
  * @summary Validate various request property methods on java.net.URLConnection
  * throw NullPointerException and IllegalStateException when expected
- * @run testng RequestProperties
+ * @run junit ${test.main.class}
  */
 
-import org.testng.Assert;
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
 
 import java.io.IOException;
 import java.net.URL;
@@ -40,13 +37,19 @@ import java.nio.file.Path;
 import java.util.ArrayList;
 import java.util.List;
 
+import org.junit.jupiter.api.Test;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
+
+import static org.junit.jupiter.api.Assertions.assertNull;
+import static org.junit.jupiter.api.Assertions.assertThrows;
+
 public class RequestProperties {
 
     private static final Class NPE = NullPointerException.class;
     private static final Class ISE = IllegalStateException.class;
 
-    @DataProvider(name = "urls")
-    private Object[][] urls() {
+    private static List<String> urls() {
         final List<String> urls = new ArrayList<>();
         urls.add("http://foo.com/bar/");
         urls.add("jar:http://foo.com/bar.html!/foo/bar");
@@ -54,11 +57,7 @@ public class RequestProperties {
         if (hasFtp()) {
             urls.add("ftp://foo:bar@foobar.com/etc/passwd");
         }
-        final Object[][] data = new Object[urls.size()][1];
-        for (int i = 0; i < urls.size(); i++) {
-            data[i][0] = urls.get(i);
-        }
-        return data;
+        return List.copyOf(urls);
     }
 
 
@@ -66,10 +65,11 @@ public class RequestProperties {
      * Test that {@link java.net.URLConnection#setRequestProperty(String, String)} throws
      * a {@link NullPointerException} when passed null key
      */
-    @Test(dataProvider = "urls")
+    @ParameterizedTest
+    @MethodSource("urls")
     public void testSetRequestPropertyNullPointerException(final String url) throws Exception {
         final URLConnection conn = new URL(url).openConnection();
-        Assert.assertThrows(NPE, () -> conn.setRequestProperty(null, "bar"));
+        assertThrows(NPE, () -> conn.setRequestProperty(null, "bar"));
         // expected to pass
         conn.setRequestProperty("key", null);
     }
@@ -78,10 +78,11 @@ public class RequestProperties {
      * Test that {@link java.net.URLConnection#addRequestProperty(String, String)} throws
      * a {@link NullPointerException} when passed null key
      */
-    @Test(dataProvider = "urls")
+    @ParameterizedTest
+    @MethodSource("urls")
     public void testAddRequestPropertyNullPointerException(final String url) throws Exception {
         final URLConnection conn = new URL(url).openConnection();
-        Assert.assertThrows(NPE, () -> conn.addRequestProperty(null, "hello"));
+        assertThrows(NPE, () -> conn.addRequestProperty(null, "hello"));
         // expected to pass
         conn.addRequestProperty("key", null);
     }
@@ -90,10 +91,11 @@ public class RequestProperties {
      * Test that {@link java.net.URLConnection#getRequestProperty(String)} returns
      * null when the passed key is null
      */
-    @Test(dataProvider = "urls")
+    @ParameterizedTest
+    @MethodSource("urls")
     public void testGetRequestPropertyReturnsNull(final String url) throws Exception {
         final URLConnection conn = new URL(url).openConnection();
-        Assert.assertNull(conn.getRequestProperty(null),
+        assertNull(conn.getRequestProperty(null),
                 "getRequestProperty was expected to return null for null key");
     }
 
@@ -105,7 +107,7 @@ public class RequestProperties {
     public void testSetRequestPropertyIllegalStateException() throws Exception {
         final URLConnection conn = createAndConnectURLConnection();
         try {
-            Assert.assertThrows(ISE, () -> conn.setRequestProperty("foo", "bar"));
+            assertThrows(ISE, () -> conn.setRequestProperty("foo", "bar"));
         } finally {
             safeClose(conn);
         }
@@ -119,7 +121,7 @@ public class RequestProperties {
     public void testAddRequestPropertyIllegalStateException() throws Exception {
         final URLConnection conn = createAndConnectURLConnection();
         try {
-            Assert.assertThrows(ISE, () -> conn.addRequestProperty("foo", "bar"));
+            assertThrows(ISE, () -> conn.addRequestProperty("foo", "bar"));
         } finally {
             safeClose(conn);
         }
@@ -133,7 +135,7 @@ public class RequestProperties {
     public void testGetRequestPropertyIllegalStateException() throws Exception {
         final URLConnection conn = createAndConnectURLConnection();
         try {
-            Assert.assertThrows(ISE, () -> conn.getRequestProperty("hello"));
+            assertThrows(ISE, () -> conn.getRequestProperty("hello"));
         } finally {
             safeClose(conn);
         }
@@ -147,7 +149,7 @@ public class RequestProperties {
     public void testGetRequestPropertiesIllegalStateException() throws Exception {
         final URLConnection conn = createAndConnectURLConnection();
         try {
-            Assert.assertThrows(ISE, () -> conn.getRequestProperties());
+            assertThrows(ISE, () -> conn.getRequestProperties());
         } finally {
             safeClose(conn);
         }
diff --git a/test/jdk/java/net/URLConnection/SetDefaultUseCaches.java b/test/jdk/java/net/URLConnection/SetDefaultUseCaches.java
index 73c822ac2c9..224e5217d33 100644
--- a/test/jdk/java/net/URLConnection/SetDefaultUseCaches.java
+++ b/test/jdk/java/net/URLConnection/SetDefaultUseCaches.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2016, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2016, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -24,15 +24,18 @@
 /* @test
  * @bug 8163449 8175261
  * @summary Allow per protocol setting for URLConnection defaultUseCaches
- * @run testng/othervm SetDefaultUseCaches
+ * @run junit/othervm ${test.main.class}
  */
 
 import java.io.IOException;
 import java.io.UncheckedIOException;
 import java.net.URL;
 import java.net.URLConnection;
-import org.testng.annotations.Test;
-import static org.testng.Assert.*;
+
+import org.junit.jupiter.api.Test;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertFalse;
+import static org.junit.jupiter.api.Assertions.assertTrue;
 
 public class SetDefaultUseCaches {
 
@@ -85,28 +88,28 @@ public class SetDefaultUseCaches {
 
     void checkJAR(boolean defaultValue) throws IOException {
         URLConnection.setDefaultUseCaches("JAR", defaultValue);
-        assertEquals(URLConnection.getDefaultUseCaches("JAr"), defaultValue);
+        assertEquals(defaultValue, URLConnection.getDefaultUseCaches("JAr"));
 
         URLConnection jarFileURLConn = jarFileURL.openConnection();
         URLConnection jarHttpURLConn = jarHttpURL.openConnection();
-        assertEquals(jarFileURLConn.getUseCaches(), defaultValue);
-        assertEquals(jarHttpURLConn.getUseCaches(), defaultValue);
+        assertEquals(defaultValue, jarFileURLConn.getUseCaches());
+        assertEquals(defaultValue, jarHttpURLConn.getUseCaches());
         jarFileURLConn.setUseCaches(!defaultValue);
         jarHttpURLConn.setUseCaches(!defaultValue);
-        assertEquals(jarFileURLConn.getUseCaches(), !defaultValue);
-        assertEquals(jarHttpURLConn.getUseCaches(), !defaultValue);
+        assertEquals(!defaultValue, jarFileURLConn.getUseCaches());
+        assertEquals(!defaultValue, jarHttpURLConn.getUseCaches());
 
         URLConnection.setDefaultUseCaches("JaR", !defaultValue); // case-insensitive
-        assertEquals(URLConnection.getDefaultUseCaches("jAR"), !defaultValue);
+        assertEquals(!defaultValue, URLConnection.getDefaultUseCaches("jAR"));
 
         jarFileURLConn = jarFileURL.openConnection();
         jarHttpURLConn = jarHttpURL.openConnection();
-        assertEquals(jarFileURLConn.getUseCaches(), !defaultValue);
-        assertEquals(jarHttpURLConn.getUseCaches(), !defaultValue);
+        assertEquals(!defaultValue, jarFileURLConn.getUseCaches());
+        assertEquals(!defaultValue, jarHttpURLConn.getUseCaches());
         jarFileURLConn.setUseCaches(defaultValue);
         jarHttpURLConn.setUseCaches(defaultValue);
-        assertEquals(jarFileURLConn.getUseCaches(), defaultValue);
-        assertEquals(jarHttpURLConn.getUseCaches(), defaultValue);
+        assertEquals(defaultValue, jarFileURLConn.getUseCaches());
+        assertEquals(defaultValue, jarHttpURLConn.getUseCaches());
     }
 
     static URL uncheckURL(String url) {
diff --git a/test/jdk/java/net/URLConnection/URLConnectionHeadersOrder.java b/test/jdk/java/net/URLConnection/URLConnectionHeadersOrder.java
index 6f16c79f520..5f680a04283 100644
--- a/test/jdk/java/net/URLConnection/URLConnectionHeadersOrder.java
+++ b/test/jdk/java/net/URLConnection/URLConnectionHeadersOrder.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2021, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -21,19 +21,17 @@
  * questions.
  */
 
-/**
+/*
  * @test
  * @bug 8133686
  * @summary Ensuring that multiple header values for a given field-name are returned in
  *          the order they were added for HttpURLConnection.getRequestProperties
  *          and HttpURLConnection.getHeaderFields
  * @library /test/lib
- * @run testng URLConnectionHeadersOrder
+ * @run junit ${test.main.class}
  */
 
 import jdk.test.lib.net.URIBuilder;
-import org.testng.Assert;
-import org.testng.annotations.Test;
 
 import java.io.IOException;
 import java.net.InetAddress;
@@ -41,6 +39,11 @@ import java.net.URL;
 import java.net.URLConnection;
 import java.util.Arrays;
 
+import org.junit.jupiter.api.Test;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertNotNull;
+
 public class URLConnectionHeadersOrder {
     @Test
     public void testRequestPropertiesOrder() throws Exception {
@@ -58,10 +61,10 @@ public class URLConnectionHeadersOrder {
         var expectedRequestProps = Arrays.asList("a", "b", "c");
         var actualRequestProps = conn.getRequestProperties().get("test");
 
-        Assert.assertNotNull(actualRequestProps);
+        assertNotNull(actualRequestProps);
 
-        String errorMessageTemplate = "Expected Request Properties = %s, Actual Request Properties = %s";
-        Assert.assertEquals(actualRequestProps, expectedRequestProps, String.format(errorMessageTemplate, expectedRequestProps.toString(), actualRequestProps.toString()));
+        assertEquals(expectedRequestProps, actualRequestProps,
+                "Unexpected value for request header \"test\"");
     }
 }
 
diff --git a/test/jdk/java/net/URLDecoder/EncodingTest.java b/test/jdk/java/net/URLDecoder/EncodingTest.java
index b01be15a446..c49720545ed 100644
--- a/test/jdk/java/net/URLDecoder/EncodingTest.java
+++ b/test/jdk/java/net/URLDecoder/EncodingTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2017, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2017, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -24,16 +24,20 @@
 import java.net.URLDecoder;
 import java.net.URLEncoder;
 import java.nio.charset.StandardCharsets;
-import org.testng.Assert;
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
 
-/**
+import org.junit.jupiter.api.function.Executable;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertThrows;
+
+/*
  * @test
  * @bug 8183743
  * @summary Test to verify the new overload method with Charset functions the
  * same as the existing method that takes a charset name.
- * @run testng EncodingTest
+ * @run junit ${test.main.class}
  */
 public class EncodingTest {
     public static enum ParameterType {
@@ -41,16 +45,14 @@ public class EncodingTest {
         CHARSET
     }
 
-    @DataProvider(name = "illegalArgument")
-    public Object[][] getParameters() {
+    public static Object[][] getParameters() {
         return new Object[][]{
             {ParameterType.STRING},
             {ParameterType.CHARSET}
         };
     }
 
-    @DataProvider(name = "decode")
-    public Object[][] getDecodeParameters() {
+    public static Object[][] getDecodeParameters() {
         return new Object[][]{
             {"The string \u00FC@foo-bar"},
             // the string from javadoc example
@@ -82,17 +84,16 @@ public class EncodingTest {
      * @param type the type of the argument, e.g a String charset name or
      * charset
      */
-    @Test(dataProvider = "illegalArgument", expectedExceptions = IllegalArgumentException.class)
+    @ParameterizedTest
+    @MethodSource("getParameters")
     public void testIllegalArgument(ParameterType type) throws Exception {
         String encoded = URLEncoder.encode("http://www.xyz.com/find?key=\u0100\u0101",
                 StandardCharsets.UTF_8.name());
         String illegal = "%" + encoded;
-        String returned;
-        if (type == ParameterType.STRING) {
-            returned = URLDecoder.decode(illegal, StandardCharsets.UTF_8.name());
-        } else {
-            returned = URLDecoder.decode(illegal, StandardCharsets.UTF_8);
-        }
+        Executable decoded = type == ParameterType.STRING
+                ? () -> URLDecoder.decode(illegal, StandardCharsets.UTF_8.name())
+                : () -> URLDecoder.decode(illegal, StandardCharsets.UTF_8);
+        assertThrows(IllegalArgumentException.class, decoded);
     }
 
     /**
@@ -101,17 +102,18 @@ public class EncodingTest {
      *
      * @param s the string to be encoded and then decoded with both existing
      * and the overload methods.
-     * @throws Exception
+     * @throws Exception if failed
      */
-    @Test(dataProvider = "decode")
+    @ParameterizedTest
+    @MethodSource("getDecodeParameters")
     public void decode(String s) throws Exception {
         String encoded = URLEncoder.encode(s, StandardCharsets.UTF_8.name());
         String returned1 = URLDecoder.decode(encoded, StandardCharsets.UTF_8.name());
         String returned2 = URLDecoder.decode(encoded, StandardCharsets.UTF_8);
-        Assert.assertEquals(returned1, returned2);
+        assertEquals(returned2, returned1);
     }
 
-    String charactersRange(char c1, char c2) {
+    private static String charactersRange(char c1, char c2) {
         StringBuilder sb = new StringBuilder(c2 - c1);
         for (char c = c1; c < c2; c++) {
             sb.append(c);
diff --git a/test/jdk/java/net/URLEncoder/EncodingTest.java b/test/jdk/java/net/URLEncoder/EncodingTest.java
index f1b4f3ce3e9..f992fb4e8ee 100644
--- a/test/jdk/java/net/URLEncoder/EncodingTest.java
+++ b/test/jdk/java/net/URLEncoder/EncodingTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2017, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2017, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -24,16 +24,17 @@
 import java.net.URLDecoder;
 import java.net.URLEncoder;
 import java.nio.charset.StandardCharsets;
-import org.testng.Assert;
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
 
-/**
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+
+/*
  * @test
  * @bug 8183743
  * @summary Test to verify the new overload method with Charset functions the same
  * as the existing method that takes a charset name.
- * @run testng EncodingTest
+ * @run junit ${test.main.class}
  */
 public class EncodingTest {
     public static enum ParameterType {
@@ -41,8 +42,7 @@ public class EncodingTest {
         CHARSET
     }
 
-    @DataProvider(name = "encode")
-    public Object[][] getDecodeParameters() {
+    public static Object[][] getDecodeParameters() {
         return new Object[][]{
             {"The string \u00FC@foo-bar"},
             // the string from javadoc example
@@ -74,19 +74,20 @@ public class EncodingTest {
      * @param s the string to be encoded
      * @throws Exception if the test fails
      */
-    @Test(dataProvider = "encode")
+    @ParameterizedTest
+    @MethodSource("getDecodeParameters")
     public void encode(String s) throws Exception {
         String encoded1 = URLEncoder.encode(s, StandardCharsets.UTF_8.name());
         String encoded2 = URLEncoder.encode(s, StandardCharsets.UTF_8);
-        Assert.assertEquals(encoded1, encoded2);
+        assertEquals(encoded2, encoded1);
 
         // cross check
         String returned1 = URLDecoder.decode(encoded1, StandardCharsets.UTF_8.name());
         String returned2 = URLDecoder.decode(encoded2, StandardCharsets.UTF_8);
-        Assert.assertEquals(returned1, returned2);
+        assertEquals(returned2, returned1);
     }
 
-    String charactersRange(char c1, char c2) {
+    private static String charactersRange(char c1, char c2) {
         StringBuilder sb = new StringBuilder(c2 - c1);
         for (char c = c1; c < c2; c++) {
             sb.append(c);
diff --git a/test/jdk/java/net/URLPermission/EmptyAuthorityTest.java b/test/jdk/java/net/URLPermission/EmptyAuthorityTest.java
index 06dd21b71ea..9dce36dbb27 100644
--- a/test/jdk/java/net/URLPermission/EmptyAuthorityTest.java
+++ b/test/jdk/java/net/URLPermission/EmptyAuthorityTest.java
@@ -1,5 +1,5 @@
 /*
-* Copyright (c) 2025, Oracle and/or its affiliates. All rights reserved.
+* Copyright (c) 2025, 2026, Oracle and/or its affiliates. All rights reserved.
 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
 *
 * This code is free software; you can redistribute it and/or modify it
@@ -25,18 +25,19 @@
 * @test
 * @bug 8367049
 * @summary URLPermission must reject empty/missing host authority with IAE (no SIOOBE)
-* @run testng EmptyAuthorityTest
+* @run junit ${test.main.class}
 */
 
 import java.net.URLPermission;
-import org.testng.Assert;
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
+
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
+
+import static org.junit.jupiter.api.Assertions.assertThrows;
 
 public class EmptyAuthorityTest {
 
-    @DataProvider(name = "badUrls")
-    public Object[][] badUrls() {
+    public static Object[][] badUrls() {
         return new Object[][]{
                 { "http:///path" }, // empty authority
                 { "https:///x" }, // empty authority
@@ -46,8 +47,7 @@ public class EmptyAuthorityTest {
         };
     }
 
-    @DataProvider(name = "goodUrls")
-    public Object[][] goodUrls() {
+    public static Object[][] goodUrls() {
         return new Object[][]{
                 { "http://example.com/x" },
                 { "http://example.com:80/x" },
@@ -56,12 +56,14 @@ public class EmptyAuthorityTest {
         };
     }
 
-    @Test(dataProvider = "badUrls")
+    @ParameterizedTest
+    @MethodSource("badUrls")
     public void rejectsEmptyOrMalformedAuthority(String url) {
-        Assert.expectThrows(IllegalArgumentException.class, () -> new URLPermission(url));
+        assertThrows(IllegalArgumentException.class, () -> new URLPermission(url));
     }
 
-    @Test(dataProvider = "goodUrls")
+    @ParameterizedTest
+    @MethodSource("goodUrls")
     public void acceptsValidAuthorities(String url) {
         new URLPermission(url); // should not throw
     }
diff --git a/test/jdk/java/net/URLPermission/InvalidCharacterTest.java b/test/jdk/java/net/URLPermission/InvalidCharacterTest.java
index 37179f5dfe2..ae49353df0f 100644
--- a/test/jdk/java/net/URLPermission/InvalidCharacterTest.java
+++ b/test/jdk/java/net/URLPermission/InvalidCharacterTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2022, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2022, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,15 +23,18 @@
 
 import java.net.URLPermission;
 
-import org.testng.Assert;
-import org.testng.annotations.Test;
+import org.junit.jupiter.api.Test;
 
-/**
+import static org.junit.jupiter.api.Assertions.assertNotNull;
+import static org.junit.jupiter.api.Assertions.assertThrows;
+import static org.junit.jupiter.api.Assertions.assertTrue;
+
+/*
  * @test
  * @bug 8297311
  * @summary Verify that the exception thrown by URLPermission class, for invalid host name,
  * contains expected exception message
- * @run testng InvalidCharacterTest
+ * @run junit InvalidCharacterTest
  */
 public class InvalidCharacterTest {
 
@@ -45,13 +48,13 @@ public class InvalidCharacterTest {
         // we expect this string in the exception message
         final String expectedStringInMessage = String.format("\\u%04x", (int) invalidChar);
         final String url = "http://foo" + invalidChar + "bar.com:12345";
-        final IllegalArgumentException iae = Assert.expectThrows(IllegalArgumentException.class,
+        final IllegalArgumentException iae = assertThrows(IllegalArgumentException.class,
                 () -> new URLPermission(url));
         // additionally check the error message contains the invalid char
         final String exMessage = iae.getMessage();
         System.out.println("Got exception message: " + exMessage);
-        Assert.assertNotNull(exMessage, "Exception message is null");
-        Assert.assertTrue(exMessage.contains(expectedStringInMessage),
+        assertNotNull(exMessage, "Exception message is null");
+        assertTrue(exMessage.contains(expectedStringInMessage),
                 expectedStringInMessage + " missing from exception message: " + exMessage);
     }
 }
diff --git a/test/jdk/java/net/URLStreamHandler/TestDefaultBehavior.java b/test/jdk/java/net/URLStreamHandler/TestDefaultBehavior.java
index 9fe4eff4150..ed01791acdd 100644
--- a/test/jdk/java/net/URLStreamHandler/TestDefaultBehavior.java
+++ b/test/jdk/java/net/URLStreamHandler/TestDefaultBehavior.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2019, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2019, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,7 +25,7 @@
  * @test
  * @bug 8224973
  * @summary Basic test for the default behavior of openConnection(URL,Proxy)
- * @run testng TestDefaultBehavior
+ * @run junit ${test.main.class}
  */
 
 import java.io.IOException;
@@ -35,9 +35,10 @@ import java.net.URI;
 import java.net.URL;
 import java.net.URLConnection;
 import java.net.URLStreamHandler;
-import org.testng.annotations.Test;
 import static java.net.Proxy.*;
-import static org.testng.Assert.expectThrows;
+
+import org.junit.jupiter.api.Test;
+import static org.junit.jupiter.api.Assertions.assertThrows;
 
 public class TestDefaultBehavior {
 
@@ -51,15 +52,15 @@ public class TestDefaultBehavior {
     public void testDefaultBehavior() {
         CustomURLStreamHandler handler = new CustomURLStreamHandler();
 
-        expectThrows(IAE, () -> handler.openConnection(null, null));
-        expectThrows(IAE, () -> handler.openConnection(null, NO_PROXY));
-        expectThrows(IAE, () -> handler.openConnection(null, new Proxy(Type.SOCKS, ADDR)));
-        expectThrows(IAE, () -> handler.openConnection(null, new Proxy(Type.HTTP, ADDR)));
-        expectThrows(IAE, () -> handler.openConnection(uri.toURL(), null));
+        assertThrows(IAE, () -> handler.openConnection(null, null));
+        assertThrows(IAE, () -> handler.openConnection(null, NO_PROXY));
+        assertThrows(IAE, () -> handler.openConnection(null, new Proxy(Type.SOCKS, ADDR)));
+        assertThrows(IAE, () -> handler.openConnection(null, new Proxy(Type.HTTP, ADDR)));
+        assertThrows(IAE, () -> handler.openConnection(uri.toURL(), null));
 
-        expectThrows(UOE, () -> handler.openConnection(uri.toURL(), NO_PROXY));
-        expectThrows(UOE, () -> handler.openConnection(uri.toURL(), new Proxy(Type.SOCKS, ADDR)));
-        expectThrows(UOE, () -> handler.openConnection(uri.toURL(), new Proxy(Type.HTTP, ADDR)));
+        assertThrows(UOE, () -> handler.openConnection(uri.toURL(), NO_PROXY));
+        assertThrows(UOE, () -> handler.openConnection(uri.toURL(), new Proxy(Type.SOCKS, ADDR)));
+        assertThrows(UOE, () -> handler.openConnection(uri.toURL(), new Proxy(Type.HTTP, ADDR)));
     }
 
     // A URLStreamHandler that delegates the overloaded openConnection that

From dd76306903a869752d955a45f0b5a7ea7e680c68 Mon Sep 17 00:00:00 2001
From: Erik Gahlin <egahlin@openjdk.org>
Date: Mon, 13 Apr 2026 13:55:27 +0000
Subject: [PATCH 576/655] 8382048: JFR: RecordingFile::write doesn't truncate
 when overwriting

Reviewed-by: mgronlun
---
 .../jdk/jfr/internal/consumer/filter/RecordingOutput.java   | 6 +++++-
 1 file changed, 5 insertions(+), 1 deletion(-)

diff --git a/src/jdk.jfr/share/classes/jdk/jfr/internal/consumer/filter/RecordingOutput.java b/src/jdk.jfr/share/classes/jdk/jfr/internal/consumer/filter/RecordingOutput.java
index 9aebb27238c..9c8187c7a46 100644
--- a/src/jdk.jfr/share/classes/jdk/jfr/internal/consumer/filter/RecordingOutput.java
+++ b/src/jdk.jfr/share/classes/jdk/jfr/internal/consumer/filter/RecordingOutput.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2022, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2022, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -26,6 +26,7 @@ package jdk.jfr.internal.consumer.filter;
 
 import java.io.Closeable;
 import java.io.File;
+import java.io.FileOutputStream;
 import java.io.IOException;
 import java.io.RandomAccessFile;
 
@@ -39,6 +40,9 @@ final class RecordingOutput implements Closeable {
     private long position;
 
     public RecordingOutput(File file) throws IOException {
+        // Truncates existing file if it exists
+        var fos = new FileOutputStream(file);
+        fos.close();
         this.file = new RandomAccessFile(file, "rw");
     }
 

From 8882e7b64a6e47db906920d9509b24a67277a028 Mon Sep 17 00:00:00 2001
From: Erik Gahlin <egahlin@openjdk.org>
Date: Mon, 13 Apr 2026 16:42:22 +0000
Subject: [PATCH 577/655] 8382034: JFR: jdk-agents view is missing information

Reviewed-by: mgronlun
---
 .../share/jfr/periodic/jfrPeriodic.cpp        | 18 +++++++-----
 .../classes/jdk/jfr/internal/query/view.ini   |  4 +--
 .../jdk/jfr/event/runtime/TestAgentEvent.java | 29 ++++++++++++++++++-
 3 files changed, 41 insertions(+), 10 deletions(-)

diff --git a/src/hotspot/share/jfr/periodic/jfrPeriodic.cpp b/src/hotspot/share/jfr/periodic/jfrPeriodic.cpp
index 426ba4e7650..969c9ca60c1 100644
--- a/src/hotspot/share/jfr/periodic/jfrPeriodic.cpp
+++ b/src/hotspot/share/jfr/periodic/jfrPeriodic.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2012, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2012, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -281,7 +281,9 @@ TRACE_REQUEST_FUNC(SystemProcess) {
 
 #if INCLUDE_JVMTI
 template <typename AgentEvent>
-static void send_agent_event(AgentEvent& event, const JvmtiAgent* agent) {
+static void send_agent_event(AgentEvent& event, const JvmtiAgent* agent, Ticks& timestamp) {
+  event.set_starttime(timestamp);
+  event.set_endtime(timestamp);
   event.set_name(agent->name());
   event.set_options(agent->options());
   event.set_dynamic(agent->is_dynamic());
@@ -292,29 +294,31 @@ static void send_agent_event(AgentEvent& event, const JvmtiAgent* agent) {
 
 TRACE_REQUEST_FUNC(JavaAgent) {
   JvmtiAgentList::Iterator it = JvmtiAgentList::java_agents();
+  Ticks ticks = timestamp();
   while (it.has_next()) {
     const JvmtiAgent* agent = it.next();
     assert(agent->is_jplis(), "invariant");
     EventJavaAgent event;
-    send_agent_event(event, agent);
+    send_agent_event(event, agent, ticks);
   }
 }
 
-static void send_native_agent_events(JvmtiAgentList::Iterator& it) {
+static void send_native_agent_events(JvmtiAgentList::Iterator& it, Ticks& timestamp) {
   while (it.has_next()) {
     const JvmtiAgent* agent = it.next();
     assert(!agent->is_jplis(), "invariant");
     EventNativeAgent event;
     event.set_path(agent->os_lib_path());
-    send_agent_event(event, agent);
+    send_agent_event(event, agent, timestamp);
   }
 }
 
 TRACE_REQUEST_FUNC(NativeAgent) {
+  Ticks ticks = timestamp();
   JvmtiAgentList::Iterator native_agents_it = JvmtiAgentList::native_agents();
-  send_native_agent_events(native_agents_it);
+  send_native_agent_events(native_agents_it, ticks);
   JvmtiAgentList::Iterator xrun_agents_it = JvmtiAgentList::xrun_agents();
-  send_native_agent_events(xrun_agents_it);
+  send_native_agent_events(xrun_agents_it, ticks);
 }
 #else  // INCLUDE_JVMTI
 TRACE_REQUEST_FUNC(JavaAgent)   {}
diff --git a/src/jdk.jfr/share/classes/jdk/jfr/internal/query/view.ini b/src/jdk.jfr/share/classes/jdk/jfr/internal/query/view.ini
index 5d72a9f85dc..d8b740e1a66 100644
--- a/src/jdk.jfr/share/classes/jdk/jfr/internal/query/view.ini
+++ b/src/jdk.jfr/share/classes/jdk/jfr/internal/query/view.ini
@@ -433,8 +433,8 @@ form = "COLUMN 'Successful Samples', 'Failed Samples', 'Biased Samples', 'Total
 label = "JDK Agents"
 table = "COLUMN 'Time', 'Initialization', 'Name', 'Options'
          FORMAT none, none, truncate-beginning;cell-height:10, cell-height:10
-         SELECT LAST(initializationTime) AS t, LAST(initializationDuration), LAST(name), LAST(JavaAgent.options)
-         FROM JavaAgent, NativeAgent
+         SELECT LAST_BATCH(initializationTime) AS t, LAST_BATCH(initializationDuration), LAST_BATCH(name), LAST_BATCH(options)
+         FROM JavaAgent, NativeAgent GROUP BY initializationTime
          ORDER BY t"
 
 [environment.jvm-flags]
diff --git a/test/jdk/jdk/jfr/event/runtime/TestAgentEvent.java b/test/jdk/jdk/jfr/event/runtime/TestAgentEvent.java
index ca7b6dfc0f1..6e168153947 100644
--- a/test/jdk/jdk/jfr/event/runtime/TestAgentEvent.java
+++ b/test/jdk/jdk/jfr/event/runtime/TestAgentEvent.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2023, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2023, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -68,6 +68,12 @@ import jdk.test.lib.jfr.TestClassLoader;
  * @run main/othervm -XX:+UnlockExperimentalVMOptions -XX:-UseFastUnorderedTimeStamps -agentlib:jdwp=transport=dt_socket,server=y,suspend=n,address=0
  *      jdk.jfr.event.runtime.TestAgentEvent
  *      testNativeStatic
+ *
+ * @run main/othervm -XX:+UnlockExperimentalVMOptions -XX:-UseFastUnorderedTimeStamps
+ *                   -agentlib:jdwp=transport=dt_socket,server=y,suspend=n,address=0
+ *                   -javaagent:JavaAgent.jar=foo=bar
+ *      jdk.jfr.event.runtime.TestAgentEvent
+ *      testMultipleAgents
  */
 public final class TestAgentEvent {
     @StackTrace(false)
@@ -179,4 +185,25 @@ public final class TestAgentEvent {
             Events.assertField(events.get(4), "options").equal("=");
         }
     }
+
+    private static void testMultipleAgents() throws Exception {
+        try (Recording r = new Recording()) {
+            r.enable(EventNames.NativeAgent).with("period", "endChunk");
+            r.enable(EventNames.JavaAgent).with("period", "endChunk");
+            r.start();
+            r.stop();
+            List<RecordedEvent> events = Events.fromRecording(r);
+            if (events.size() != 2) {
+                throw new Exception("Expected two agents");
+            }
+            Instant timestamp = events.getFirst().getStartTime();
+            for (RecordedEvent event : events) {
+                if (!event.getStartTime().equals(timestamp) ||
+                    !event.getEndTime().equals(timestamp))  {
+                    System.out.println(events);
+                    throw new Exception("Expected agent to have the same start and end time");
+                }
+            }
+        }
+    }
 }

From 5cbc5653f4a331a0c976c7db44c3160f7ee6e84e Mon Sep 17 00:00:00 2001
From: Andrew Dinn <adinn@openjdk.org>
Date: Mon, 13 Apr 2026 16:45:08 +0000
Subject: [PATCH 578/655] 8382081: AOT tests fail in add_stub_entries without
 JVMCI

Reviewed-by: chagedorn, mhaessig, kvn
---
 src/hotspot/share/code/codeBlob.hpp | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/src/hotspot/share/code/codeBlob.hpp b/src/hotspot/share/code/codeBlob.hpp
index 1c6904e7446..d372e72fc23 100644
--- a/src/hotspot/share/code/codeBlob.hpp
+++ b/src/hotspot/share/code/codeBlob.hpp
@@ -604,7 +604,7 @@ class DeoptimizationBlob: public SingletonBlob {
   );
 
  public:
-  static const int ENTRY_COUNT = 4 JVMTI_ONLY(+ 2);
+  static const int ENTRY_COUNT = 4 JVMCI_ONLY(+ 2);
   // Creation
   static DeoptimizationBlob* create(
     CodeBuffer* cb,

From 121165ec91134dbeab0a243246624e935a916955 Mon Sep 17 00:00:00 2001
From: Vladimir Ivanov <vlivanov@openjdk.org>
Date: Mon, 13 Apr 2026 16:49:57 +0000
Subject: [PATCH 579/655] 8290892: C2: Intrinsify Reference.reachabilityFence

Co-authored-by: Tobias Holenstein <tholenstein@openjdk.org>
Co-authored-by: Vladimir Ivanov <vlivanov@openjdk.org>
Reviewed-by: dlong, epeter
---
 src/hotspot/share/classfile/vmIntrinsics.hpp  |   3 +
 src/hotspot/share/opto/block.cpp              |   4 +-
 src/hotspot/share/opto/c2_globals.hpp         |  11 +
 src/hotspot/share/opto/c2compiler.cpp         |   1 +
 src/hotspot/share/opto/callGenerator.cpp      |  14 +
 src/hotspot/share/opto/callnode.cpp           |  57 +-
 src/hotspot/share/opto/callnode.hpp           |  67 ++-
 src/hotspot/share/opto/classes.cpp            |   1 +
 src/hotspot/share/opto/classes.hpp            |   1 +
 src/hotspot/share/opto/compile.cpp            |  57 +-
 src/hotspot/share/opto/compile.hpp            |  20 +-
 src/hotspot/share/opto/escape.cpp             |  29 +-
 src/hotspot/share/opto/gcm.cpp                |   9 +-
 src/hotspot/share/opto/graphKit.cpp           |  10 +
 src/hotspot/share/opto/graphKit.hpp           |   1 +
 src/hotspot/share/opto/library_call.cpp       |   9 +
 src/hotspot/share/opto/library_call.hpp       |   1 +
 src/hotspot/share/opto/loopTransform.cpp      |  69 ++-
 src/hotspot/share/opto/loopnode.cpp           |  61 ++-
 src/hotspot/share/opto/loopnode.hpp           |  27 +
 src/hotspot/share/opto/macro.cpp              |  30 +-
 src/hotspot/share/opto/memnode.cpp            |   2 +-
 src/hotspot/share/opto/node.cpp               |  26 +
 src/hotspot/share/opto/node.hpp               |   6 +
 src/hotspot/share/opto/parse.hpp              |   1 +
 src/hotspot/share/opto/parse1.cpp             |  54 ++
 src/hotspot/share/opto/phase.cpp              |   3 +
 src/hotspot/share/opto/phase.hpp              |   3 +
 src/hotspot/share/opto/phasetype.hpp          |   1 +
 src/hotspot/share/opto/reachability.cpp       | 512 ++++++++++++++++++
 src/hotspot/share/opto/reachability.hpp       |  83 +++
 .../classes/java/lang/ref/Reference.java      |   9 +-
 .../c2/ReachabilityFenceFlagsTest.java        |  52 ++
 .../c2/ReachabilityFenceOnConstantTest.java   | 117 ++++
 .../compiler/c2/ReachabilityFenceTest.java    | 353 ++++++++++++
 .../c2/irTests/ReachabilityFenceTest.java     | 125 +++++
 .../lib/ir_framework/CompilePhase.java        |   1 +
 .../compiler/lib/ir_framework/IRNode.java     |   5 +
 38 files changed, 1769 insertions(+), 66 deletions(-)
 create mode 100644 src/hotspot/share/opto/reachability.cpp
 create mode 100644 src/hotspot/share/opto/reachability.hpp
 create mode 100644 test/hotspot/jtreg/compiler/c2/ReachabilityFenceFlagsTest.java
 create mode 100644 test/hotspot/jtreg/compiler/c2/ReachabilityFenceOnConstantTest.java
 create mode 100644 test/hotspot/jtreg/compiler/c2/ReachabilityFenceTest.java
 create mode 100644 test/hotspot/jtreg/compiler/c2/irTests/ReachabilityFenceTest.java

diff --git a/src/hotspot/share/classfile/vmIntrinsics.hpp b/src/hotspot/share/classfile/vmIntrinsics.hpp
index e84acd62284..3f85fd16b61 100644
--- a/src/hotspot/share/classfile/vmIntrinsics.hpp
+++ b/src/hotspot/share/classfile/vmIntrinsics.hpp
@@ -469,6 +469,9 @@ class methodHandle;
   do_intrinsic(_Reference_clear0,           java_lang_ref_Reference, clear0_name,    void_method_signature, F_RN)       \
   do_intrinsic(_PhantomReference_clear0,    java_lang_ref_PhantomReference, clear0_name, void_method_signature, F_RN)   \
                                                                                                                         \
+  do_intrinsic(_Reference_reachabilityFence, java_lang_ref_Reference, reachabilityFence_name, object_void_signature, F_S)  \
+   do_name(reachabilityFence_name, "reachabilityFence")                                                                 \
+                                                                                                                        \
   /* support for com.sun.crypto.provider.AES_Crypt and some of its callers */                                            \
   do_class(com_sun_crypto_provider_aescrypt,      "com/sun/crypto/provider/AES_Crypt")                                   \
   do_intrinsic(_aescrypt_encryptBlock, com_sun_crypto_provider_aescrypt, encryptBlock_name, byteArray_int_byteArray_int_signature, F_R)   \
diff --git a/src/hotspot/share/opto/block.cpp b/src/hotspot/share/opto/block.cpp
index 7d3d4ec16f4..a93e2e43a29 100644
--- a/src/hotspot/share/opto/block.cpp
+++ b/src/hotspot/share/opto/block.cpp
@@ -179,9 +179,11 @@ int Block::is_Empty() const {
 
   // Ideal nodes (except BoxLock) are allowable in empty blocks: skip them. Only
   // Mach and BoxLock nodes turn directly into code via emit().
+  // Keep ReachabilityFence for diagnostic purposes.
   while ((end_idx > 0) &&
          !get_node(end_idx)->is_Mach() &&
-         !get_node(end_idx)->is_BoxLock()) {
+         !get_node(end_idx)->is_BoxLock() &&
+         !get_node(end_idx)->is_ReachabilityFence()) {
     end_idx--;
   }
 
diff --git a/src/hotspot/share/opto/c2_globals.hpp b/src/hotspot/share/opto/c2_globals.hpp
index 6974d50741e..dacc8ce9c26 100644
--- a/src/hotspot/share/opto/c2_globals.hpp
+++ b/src/hotspot/share/opto/c2_globals.hpp
@@ -76,6 +76,17 @@
   develop(bool, StressBailout, false,                                       \
           "Perform bailouts randomly at C2 failing() checks")               \
                                                                             \
+  product(bool, OptimizeReachabilityFences, true, DIAGNOSTIC,               \
+          "Optimize reachability fences "                                   \
+          "(leave reachability fence nodes intact when turned off)")        \
+                                                                            \
+  product(bool, PreserveReachabilityFencesOnConstants, false, DIAGNOSTIC,   \
+          "Keep reachability fences on compile-time constants")             \
+                                                                            \
+  product(bool, StressReachabilityFences, false, DIAGNOSTIC,                \
+          "Aggressively insert reachability fences "                        \
+          "for all oop method arguments")                                   \
+                                                                            \
   develop(uint, StressBailoutMean, 100000,                                  \
           "The expected number of failing() checks made until "             \
           "a random bailout.")                                              \
diff --git a/src/hotspot/share/opto/c2compiler.cpp b/src/hotspot/share/opto/c2compiler.cpp
index ead1b78cdea..5d170f919c8 100644
--- a/src/hotspot/share/opto/c2compiler.cpp
+++ b/src/hotspot/share/opto/c2compiler.cpp
@@ -775,6 +775,7 @@ bool C2Compiler::is_intrinsic_supported(vmIntrinsics::ID id) {
   case vmIntrinsics::_longBitsToDouble:
   case vmIntrinsics::_Reference_get0:
   case vmIntrinsics::_Reference_refersTo0:
+  case vmIntrinsics::_Reference_reachabilityFence:
   case vmIntrinsics::_PhantomReference_refersTo0:
   case vmIntrinsics::_Reference_clear0:
   case vmIntrinsics::_PhantomReference_clear0:
diff --git a/src/hotspot/share/opto/callGenerator.cpp b/src/hotspot/share/opto/callGenerator.cpp
index 1465da02ac8..49897ca3c17 100644
--- a/src/hotspot/share/opto/callGenerator.cpp
+++ b/src/hotspot/share/opto/callGenerator.cpp
@@ -611,6 +611,20 @@ void CallGenerator::do_late_inline_helper() {
   }
 
   Compile* C = Compile::current();
+
+  uint endoff = call->jvms()->endoff();
+  if (C->inlining_incrementally()) {
+    // No reachability edges should be present when incremental inlining takes place.
+    // Inlining logic doesn't expect any extra edges past debug info and fails with
+    // an assert in SafePointNode::grow_stack.
+    assert(endoff == call->req(), "reachability edges not supported");
+  } else {
+    if (call->req() > endoff) { // reachability edges present
+      assert(OptimizeReachabilityFences, "required");
+      return; // keep the original call node as the holder of reachability info
+    }
+  }
+
   // Remove inlined methods from Compiler's lists.
   if (call->is_macro()) {
     C->remove_macro_node(call);
diff --git a/src/hotspot/share/opto/callnode.cpp b/src/hotspot/share/opto/callnode.cpp
index b2b01079379..eb4f506d14f 100644
--- a/src/hotspot/share/opto/callnode.cpp
+++ b/src/hotspot/share/opto/callnode.cpp
@@ -898,7 +898,7 @@ bool CallNode::may_modify(const TypeOopPtr* t_oop, PhaseValues* phase) const {
 }
 
 // Does this call have a direct reference to n other than debug information?
-bool CallNode::has_non_debug_use(Node *n) {
+bool CallNode::has_non_debug_use(const Node *n) {
   const TypeTuple * d = tf()->domain();
   for (uint i = TypeFunc::Parms; i < d->cnt(); i++) {
     Node *arg = in(i);
@@ -940,7 +940,7 @@ Node *CallNode::result_cast() {
 }
 
 
-void CallNode::extract_projections(CallProjections* projs, bool separate_io_proj, bool do_asserts) const {
+void CallNode::extract_projections(CallProjections* projs, bool separate_io_proj, bool do_asserts, bool allow_handlers) const {
   projs->fallthrough_proj      = nullptr;
   projs->fallthrough_catchproj = nullptr;
   projs->fallthrough_ioproj    = nullptr;
@@ -961,14 +961,13 @@ void CallNode::extract_projections(CallProjections* projs, bool separate_io_proj
         projs->fallthrough_proj = pn;
         const Node* cn = pn->unique_ctrl_out_or_null();
         if (cn != nullptr && cn->is_Catch()) {
-          ProjNode *cpn = nullptr;
           for (DUIterator_Fast kmax, k = cn->fast_outs(kmax); k < kmax; k++) {
-            cpn = cn->fast_out(k)->as_Proj();
-            assert(cpn->is_CatchProj(), "must be a CatchProjNode");
-            if (cpn->_con == CatchProjNode::fall_through_index)
+            CatchProjNode* cpn = cn->fast_out(k)->as_CatchProj();
+            assert(allow_handlers || !cpn->is_handler_proj(), "not allowed");
+            if (cpn->_con == CatchProjNode::fall_through_index) {
+              assert(cpn->handler_bci() == CatchProjNode::no_handler_bci, "");
               projs->fallthrough_catchproj = cpn;
-            else {
-              assert(cpn->_con == CatchProjNode::catch_all_index, "must be correct index.");
+            } else if (!cpn->is_handler_proj()) {
               projs->catchall_catchproj = cpn;
             }
           }
@@ -976,15 +975,20 @@ void CallNode::extract_projections(CallProjections* projs, bool separate_io_proj
         break;
       }
     case TypeFunc::I_O:
-      if (pn->_is_io_use)
+      if (pn->_is_io_use) {
         projs->catchall_ioproj = pn;
-      else
+      } else {
         projs->fallthrough_ioproj = pn;
+      }
       for (DUIterator j = pn->outs(); pn->has_out(j); j++) {
         Node* e = pn->out(j);
-        if (e->Opcode() == Op_CreateEx && e->in(0)->is_CatchProj() && e->outcnt() > 0) {
-          assert(projs->exobj == nullptr, "only one");
-          projs->exobj = e;
+        if (e->Opcode() == Op_CreateEx && e->outcnt() > 0) {
+          CatchProjNode* ecpn = e->in(0)->isa_CatchProj();
+          assert(allow_handlers || ecpn == nullptr || !ecpn->is_handler_proj(), "not allowed");
+          if (ecpn != nullptr && ecpn->_con != CatchProjNode::fall_through_index && !ecpn->is_handler_proj()) {
+            assert(projs->exobj == nullptr, "only one");
+            projs->exobj = e;
+          }
         }
       }
       break;
@@ -1609,6 +1613,33 @@ void SafePointNode::disconnect_from_root(PhaseIterGVN *igvn) {
   }
 }
 
+void SafePointNode::remove_non_debug_edges(NodeEdgeTempStorage& non_debug_edges) {
+  assert(non_debug_edges._state == NodeEdgeTempStorage::state_initial, "not processed");
+  assert(non_debug_edges.is_empty(), "edges not processed");
+
+  while (req() > jvms()->endoff()) {
+    uint last = req() - 1;
+    non_debug_edges.push(in(last));
+    del_req(last);
+  }
+
+  assert(jvms()->endoff() == req(), "no extra edges past debug info allowed");
+  DEBUG_ONLY(non_debug_edges._state = NodeEdgeTempStorage::state_populated);
+}
+
+void SafePointNode::restore_non_debug_edges(NodeEdgeTempStorage& non_debug_edges) {
+  assert(non_debug_edges._state == NodeEdgeTempStorage::state_populated, "not populated");
+  assert(jvms()->endoff() == req(), "no extra edges past debug info allowed");
+
+  while (!non_debug_edges.is_empty()) {
+    Node* non_debug_edge = non_debug_edges.pop();
+    add_req(non_debug_edge);
+  }
+
+  assert(non_debug_edges.is_empty(), "edges not processed");
+  DEBUG_ONLY(non_debug_edges._state = NodeEdgeTempStorage::state_processed);
+}
+
 //==============  SafePointScalarObjectNode  ==============
 
 SafePointScalarObjectNode::SafePointScalarObjectNode(const TypeOopPtr* tp, Node* alloc, uint first_index, uint depth, uint n_fields) :
diff --git a/src/hotspot/share/opto/callnode.hpp b/src/hotspot/share/opto/callnode.hpp
index 5241ae6cd2b..e4c548fc744 100644
--- a/src/hotspot/share/opto/callnode.hpp
+++ b/src/hotspot/share/opto/callnode.hpp
@@ -503,6 +503,66 @@ public:
     return _has_ea_local_in_scope;
   }
 
+  // A temporary storge for node edges.
+  // Intended for a single use.
+  class NodeEdgeTempStorage : public StackObj {
+    friend class SafePointNode;
+
+    PhaseIterGVN& _igvn;
+    Node*         _node_hook;
+
+#ifdef ASSERT
+    enum State { state_initial, state_populated, state_processed };
+
+    State _state; // monotonically transitions from initial to processed state.
+#endif // ASSERT
+
+    bool is_empty() const {
+      return _node_hook == nullptr || _node_hook->req() == 1;
+    }
+    void push(Node* n) {
+      assert(n != nullptr, "");
+      if (_node_hook == nullptr) {
+        _node_hook = new Node(nullptr);
+      }
+      _node_hook->add_req(n);
+    }
+    Node* pop() {
+      assert(!is_empty(), "");
+      int idx = _node_hook->req()-1;
+      Node* r = _node_hook->in(idx);
+      _node_hook->del_req(idx);
+      assert(r != nullptr, "");
+      return r;
+    }
+
+  public:
+    NodeEdgeTempStorage(PhaseIterGVN &igvn) : _igvn(igvn), _node_hook(nullptr)
+                                              DEBUG_ONLY(COMMA _state(state_initial)) {
+      assert(is_empty(), "");
+    }
+
+    ~NodeEdgeTempStorage() {
+      assert(_state == state_processed, "not processed");
+      assert(is_empty(), "");
+      if (_node_hook != nullptr) {
+        _node_hook->destruct(&_igvn);
+      }
+    }
+
+    void remove_edge_if_present(Node* n) {
+      if (!is_empty()) {
+        int idx = _node_hook->find_edge(n);
+        if (idx > 0) {
+          _node_hook->del_req(idx);
+        }
+      }
+    }
+  };
+
+  void remove_non_debug_edges(NodeEdgeTempStorage& non_debug_edges);
+  void restore_non_debug_edges(NodeEdgeTempStorage& non_debug_edges);
+
   void disconnect_from_root(PhaseIterGVN *igvn);
 
   // Standard Node stuff
@@ -736,7 +796,7 @@ public:
   // Returns true if the call may modify n
   virtual bool        may_modify(const TypeOopPtr* t_oop, PhaseValues* phase) const;
   // Does this node have a use of n other than in debug information?
-  bool                has_non_debug_use(Node* n);
+  bool                has_non_debug_use(const Node* n);
   // Returns the unique CheckCastPP of a call
   // or result projection is there are several CheckCastPP
   // or returns null if there is no one.
@@ -751,7 +811,10 @@ public:
   // Collect all the interesting edges from a call for use in
   // replacing the call by something else.  Used by macro expansion
   // and the late inlining support.
-  void extract_projections(CallProjections* projs, bool separate_io_proj, bool do_asserts = true) const;
+  void extract_projections(CallProjections* projs,
+                           bool separate_io_proj,
+                           bool do_asserts = true,
+                           bool allow_handlers = false) const;
 
   virtual uint match_edge(uint idx) const;
 
diff --git a/src/hotspot/share/opto/classes.cpp b/src/hotspot/share/opto/classes.cpp
index b760a179b57..1cd6c52393b 100644
--- a/src/hotspot/share/opto/classes.cpp
+++ b/src/hotspot/share/opto/classes.cpp
@@ -43,6 +43,7 @@
 #include "opto/narrowptrnode.hpp"
 #include "opto/node.hpp"
 #include "opto/opaquenode.hpp"
+#include "opto/reachability.hpp"
 #include "opto/rootnode.hpp"
 #include "opto/subnode.hpp"
 #include "opto/subtypenode.hpp"
diff --git a/src/hotspot/share/opto/classes.hpp b/src/hotspot/share/opto/classes.hpp
index d9290492337..3c1a68d6224 100644
--- a/src/hotspot/share/opto/classes.hpp
+++ b/src/hotspot/share/opto/classes.hpp
@@ -547,3 +547,4 @@ macro(MaskAll)
 macro(AndVMask)
 macro(OrVMask)
 macro(XorVMask)
+macro(ReachabilityFence)
diff --git a/src/hotspot/share/opto/compile.cpp b/src/hotspot/share/opto/compile.cpp
index 7b5f78a8ad3..db3cbd4109c 100644
--- a/src/hotspot/share/opto/compile.cpp
+++ b/src/hotspot/share/opto/compile.cpp
@@ -74,6 +74,7 @@
 #include "opto/output.hpp"
 #include "opto/parse.hpp"
 #include "opto/phaseX.hpp"
+#include "opto/reachability.hpp"
 #include "opto/rootnode.hpp"
 #include "opto/runtime.hpp"
 #include "opto/stringopts.hpp"
@@ -396,6 +397,9 @@ void Compile::remove_useless_node(Node* dead) {
   if (dead->is_expensive()) {
     remove_expensive_node(dead);
   }
+  if (dead->is_ReachabilityFence()) {
+    remove_reachability_fence(dead->as_ReachabilityFence());
+  }
   if (dead->is_OpaqueTemplateAssertionPredicate()) {
     remove_template_assertion_predicate_opaque(dead->as_OpaqueTemplateAssertionPredicate());
   }
@@ -459,6 +463,7 @@ void Compile::disconnect_useless_nodes(Unique_Node_List& useful, Unique_Node_Lis
   // Remove useless Template Assertion Predicate opaque nodes
   remove_useless_nodes(_template_assertion_predicate_opaques, useful);
   remove_useless_nodes(_expensive_nodes,    useful); // remove useless expensive nodes
+  remove_useless_nodes(_reachability_fences, useful); // remove useless node recorded for post loop opts IGVN pass
   remove_useless_nodes(_for_post_loop_igvn, useful); // remove useless node recorded for post loop opts IGVN pass
   remove_useless_nodes(_for_merge_stores_igvn, useful); // remove useless node recorded for merge stores IGVN pass
   remove_useless_unstable_if_traps(useful);          // remove useless unstable_if traps
@@ -665,6 +670,7 @@ Compile::Compile(ciEnv* ci_env, ciMethod* target, int osr_bci,
       _parse_predicates(comp_arena(), 8, 0, nullptr),
       _template_assertion_predicate_opaques(comp_arena(), 8, 0, nullptr),
       _expensive_nodes(comp_arena(), 8, 0, nullptr),
+      _reachability_fences(comp_arena(), 8, 0, nullptr),
       _for_post_loop_igvn(comp_arena(), 8, 0, nullptr),
       _for_merge_stores_igvn(comp_arena(), 8, 0, nullptr),
       _unstable_if_traps(comp_arena(), 8, 0, nullptr),
@@ -934,6 +940,7 @@ Compile::Compile(ciEnv* ci_env,
       _directive(directive),
       _log(ci_env->log()),
       _first_failure_details(nullptr),
+      _reachability_fences(comp_arena(), 8, 0, nullptr),
       _for_post_loop_igvn(comp_arena(), 8, 0, nullptr),
       _for_merge_stores_igvn(comp_arena(), 8, 0, nullptr),
       _congraph(nullptr),
@@ -2510,12 +2517,23 @@ void Compile::Optimize() {
     return;
   }
 
-  if (failing())  return;
-
   C->clear_major_progress(); // ensure that major progress is now clear
 
   process_for_post_loop_opts_igvn(igvn);
 
+  if (failing())  return;
+
+  // Once loop optimizations are over, it is safe to get rid of all reachability fence nodes and
+  // migrate reachability edges to safepoints.
+  if (OptimizeReachabilityFences && _reachability_fences.length() > 0) {
+    TracePhase tp1(_t_idealLoop);
+    TracePhase tp2(_t_reachability);
+    PhaseIdealLoop::optimize(igvn, PostLoopOptsExpandReachabilityFences);
+    print_method(PHASE_EXPAND_REACHABILITY_FENCES, 2);
+    if (failing())  return;
+    assert(_reachability_fences.length() == 0 || PreserveReachabilityFencesOnConstants, "no RF nodes allowed");
+  }
+
   process_for_merge_stores_igvn(igvn);
 
   if (failing())  return;
@@ -3973,10 +3991,28 @@ void Compile::final_graph_reshaping_walk(Node_Stack& nstack, Node* root, Final_R
     }
   }
 
+  expand_reachability_edges(sfpt);
+
   // Skip next transformation if compressed oops are not used.
   if (UseCompressedOops && !Matcher::gen_narrow_oop_implicit_null_checks())
     return;
 
+  // Go over ReachabilityFence nodes to skip DecodeN nodes for referents.
+  // The sole purpose of RF node is to keep the referent oop alive and
+  // decoding the oop for that is not needed.
+  for (int i = 0; i < C->reachability_fences_count(); i++) {
+    ReachabilityFenceNode* rf = C->reachability_fence(i);
+    DecodeNNode* dn = rf->in(1)->isa_DecodeN();
+    if (dn != nullptr) {
+      if (!dn->has_non_debug_uses() || Matcher::narrow_oop_use_complex_address()) {
+        rf->set_req(1, dn->in(1));
+        if (dn->outcnt() == 0) {
+          dn->disconnect_inputs(this);
+        }
+      }
+    }
+  }
+
   // Go over safepoints nodes to skip DecodeN/DecodeNKlass nodes for debug edges.
   // It could be done for an uncommon traps or any safepoints/calls
   // if the DecodeN/DecodeNKlass node is referenced only in a debug info.
@@ -3990,21 +4026,8 @@ void Compile::final_graph_reshaping_walk(Node_Stack& nstack, Node* root, Final_R
                         n->as_CallStaticJava()->uncommon_trap_request() != 0);
     for (int j = start; j < end; j++) {
       Node* in = n->in(j);
-      if (in->is_DecodeNarrowPtr()) {
-        bool safe_to_skip = true;
-        if (!is_uncommon ) {
-          // Is it safe to skip?
-          for (uint i = 0; i < in->outcnt(); i++) {
-            Node* u = in->raw_out(i);
-            if (!u->is_SafePoint() ||
-                (u->is_Call() && u->as_Call()->has_non_debug_use(n))) {
-              safe_to_skip = false;
-            }
-          }
-        }
-        if (safe_to_skip) {
-          n->set_req(j, in->in(1));
-        }
+      if (in->is_DecodeNarrowPtr() && (is_uncommon || !in->has_non_debug_uses())) {
+        n->set_req(j, in->in(1));
         if (in->outcnt() == 0) {
           in->disconnect_inputs(this);
         }
diff --git a/src/hotspot/share/opto/compile.hpp b/src/hotspot/share/opto/compile.hpp
index eb6be669f24..ff0085d79de 100644
--- a/src/hotspot/share/opto/compile.hpp
+++ b/src/hotspot/share/opto/compile.hpp
@@ -80,6 +80,7 @@ class PhaseIterGVN;
 class PhaseRegAlloc;
 class PhaseCCP;
 class PhaseOutput;
+class ReachabilityFenceNode;
 class RootNode;
 class relocInfo;
 class StartNode;
@@ -107,7 +108,8 @@ enum LoopOptsMode {
   LoopOptsMaxUnroll,
   LoopOptsShenandoahExpand,
   LoopOptsSkipSplitIf,
-  LoopOptsVerify
+  LoopOptsVerify,
+  PostLoopOptsExpandReachabilityFences
 };
 
 // The type of all node counts and indexes.
@@ -385,6 +387,7 @@ class Compile : public Phase {
   // of Template Assertion Predicates themselves.
   GrowableArray<OpaqueTemplateAssertionPredicateNode*>  _template_assertion_predicate_opaques;
   GrowableArray<Node*>  _expensive_nodes;       // List of nodes that are expensive to compute and that we'd better not let the GVN freely common
+  GrowableArray<ReachabilityFenceNode*> _reachability_fences; // List of reachability fences
   GrowableArray<Node*>  _for_post_loop_igvn;    // List of nodes for IGVN after loop opts are over
   GrowableArray<Node*>  _for_merge_stores_igvn; // List of nodes for IGVN merge stores
   GrowableArray<UnstableIfTrap*> _unstable_if_traps;        // List of ifnodes after IGVN
@@ -714,11 +717,13 @@ public:
   int           template_assertion_predicate_count() const { return _template_assertion_predicate_opaques.length(); }
   int           expensive_count()         const { return _expensive_nodes.length(); }
   int           coarsened_count()         const { return _coarsened_locks.length(); }
-
   Node*         macro_node(int idx)       const { return _macro_nodes.at(idx); }
 
   Node*         expensive_node(int idx)   const { return _expensive_nodes.at(idx); }
 
+  ReachabilityFenceNode* reachability_fence(int idx) const { return _reachability_fences.at(idx); }
+  int                    reachability_fences_count() const { return _reachability_fences.length(); }
+
   ConnectionGraph* congraph()                   { return _congraph;}
   void set_congraph(ConnectionGraph* congraph)  { _congraph = congraph;}
   void add_macro_node(Node * n) {
@@ -740,6 +745,14 @@ public:
     _expensive_nodes.remove_if_existing(n);
   }
 
+  void add_reachability_fence(ReachabilityFenceNode* rf) {
+    _reachability_fences.append(rf);
+  }
+
+  void remove_reachability_fence(ReachabilityFenceNode* n) {
+    _reachability_fences.remove_if_existing(n);
+  }
+
   void add_parse_predicate(ParsePredicateNode* n) {
     assert(!_parse_predicates.contains(n), "duplicate entry in Parse Predicate list");
     _parse_predicates.append(n);
@@ -1300,6 +1313,9 @@ public:
   // Definitions of pd methods
   static void pd_compiler2_init();
 
+  // Materialize reachability fences from reachability edges on safepoints.
+  void expand_reachability_edges(Unique_Node_List& safepoints);
+
   // Static parse-time type checking logic for gen_subtype_check:
   enum SubTypeCheckResult { SSC_always_false, SSC_always_true, SSC_easy_test, SSC_full_test };
   SubTypeCheckResult static_subtype_check(const TypeKlassPtr* superk, const TypeKlassPtr* subk, bool skip = StressReflectiveCode);
diff --git a/src/hotspot/share/opto/escape.cpp b/src/hotspot/share/opto/escape.cpp
index 64ee60037d6..a05ad0ef99a 100644
--- a/src/hotspot/share/opto/escape.cpp
+++ b/src/hotspot/share/opto/escape.cpp
@@ -1273,21 +1273,33 @@ bool ConnectionGraph::reduce_phi_on_safepoints_helper(Node* ophi, Node* cast, No
 
   for (uint spi = 0; spi < safepoints.size(); spi++) {
     SafePointNode* sfpt = safepoints.at(spi)->as_SafePoint();
-    JVMState *jvms      = sfpt->jvms();
-    uint merge_idx      = (sfpt->req() - jvms->scloff());
-    int debug_start     = jvms->debug_start();
+
+    SafePointNode::NodeEdgeTempStorage non_debug_edges_worklist(*_igvn);
+
+    // All sfpt inputs are implicitly included into debug info during the scalarization process below.
+    // Keep non-debug inputs separately, so they stay non-debug.
+    sfpt->remove_non_debug_edges(non_debug_edges_worklist);
+
+    JVMState* jvms  = sfpt->jvms();
+    uint merge_idx  = (sfpt->req() - jvms->scloff());
+    int debug_start = jvms->debug_start();
 
     SafePointScalarMergeNode* smerge = new SafePointScalarMergeNode(merge_t, merge_idx);
     smerge->init_req(0, _compile->root());
     _igvn->register_new_node_with_optimizer(smerge);
 
+    assert(sfpt->jvms()->endoff() == sfpt->req(), "no extra edges past debug info allowed");
+
     // The next two inputs are:
     //  (1) A copy of the original pointer to NSR objects.
     //  (2) A selector, used to decide if we need to rematerialize an object
     //      or use the pointer to a NSR object.
-    // See more details of these fields in the declaration of SafePointScalarMergeNode
+    // See more details of these fields in the declaration of SafePointScalarMergeNode.
+    // It is safe to include them into debug info straight away since create_scalarized_object_description()
+    // will include all newly added inputs into debug info anyway.
     sfpt->add_req(nsr_merge_pointer);
     sfpt->add_req(selector);
+    sfpt->jvms()->set_endoff(sfpt->req());
 
     for (uint i = 1; i < ophi->req(); i++) {
       Node* base = ophi->in(i);
@@ -1302,13 +1314,15 @@ bool ConnectionGraph::reduce_phi_on_safepoints_helper(Node* ophi, Node* cast, No
       AllocateNode* alloc = ptn->ideal_node()->as_Allocate();
       SafePointScalarObjectNode* sobj = mexp.create_scalarized_object_description(alloc, sfpt);
       if (sobj == nullptr) {
-        return false;
+        sfpt->restore_non_debug_edges(non_debug_edges_worklist);
+        return false; // non-recoverable failure; recompile
       }
 
       // Now make a pass over the debug information replacing any references
       // to the allocated object with "sobj"
       Node* ccpp = alloc->result_cast();
       sfpt->replace_edges_in_range(ccpp, sobj, debug_start, jvms->debug_end(), _igvn);
+      non_debug_edges_worklist.remove_edge_if_present(ccpp); // drop scalarized input from non-debug info
 
       // Register the scalarized object as a candidate for reallocation
       smerge->add_req(sobj);
@@ -1316,11 +1330,15 @@ bool ConnectionGraph::reduce_phi_on_safepoints_helper(Node* ophi, Node* cast, No
 
     // Replaces debug information references to "original_sfpt_parent" in "sfpt" with references to "smerge"
     sfpt->replace_edges_in_range(original_sfpt_parent, smerge, debug_start, jvms->debug_end(), _igvn);
+    non_debug_edges_worklist.remove_edge_if_present(original_sfpt_parent); // drop scalarized input from non-debug info
 
     // The call to 'replace_edges_in_range' above might have removed the
     // reference to ophi that we need at _merge_pointer_idx. The line below make
     // sure the reference is maintained.
     sfpt->set_req(smerge->merge_pointer_idx(jvms), nsr_merge_pointer);
+
+    sfpt->restore_non_debug_edges(non_debug_edges_worklist);
+
     _igvn->_worklist.push(sfpt);
   }
 
@@ -4712,6 +4730,7 @@ void ConnectionGraph::split_unique_types(GrowableArray<Node *>  &alloc_worklist,
               op == Op_StrIndexOf || op == Op_StrIndexOfChar ||
               op == Op_SubTypeCheck ||
               op == Op_ReinterpretS2HF ||
+              op == Op_ReachabilityFence ||
               BarrierSet::barrier_set()->barrier_set_c2()->is_gc_barrier_node(use))) {
           n->dump();
           use->dump();
diff --git a/src/hotspot/share/opto/gcm.cpp b/src/hotspot/share/opto/gcm.cpp
index 4a1553b1e00..e3d3108a22e 100644
--- a/src/hotspot/share/opto/gcm.cpp
+++ b/src/hotspot/share/opto/gcm.cpp
@@ -152,9 +152,12 @@ bool PhaseCFG::is_CFG(Node* n) {
 }
 
 bool PhaseCFG::is_control_proj_or_safepoint(Node* n) const {
-  bool result = (n->is_Mach() && n->as_Mach()->ideal_Opcode() == Op_SafePoint) || (n->is_Proj() && n->as_Proj()->bottom_type() == Type::CONTROL);
-  assert(!result || (n->is_Mach() && n->as_Mach()->ideal_Opcode() == Op_SafePoint)
-          || (n->is_Proj() && n->as_Proj()->_con == 0), "If control projection, it must be projection 0");
+  bool result = n->is_ReachabilityFence() ||
+                (n->is_Mach() && n->as_Mach()->ideal_Opcode() == Op_SafePoint) ||
+                (n->is_Proj() && n->as_Proj()->bottom_type() == Type::CONTROL);
+  assert(!n->is_Proj() ||
+         n->as_Proj()->bottom_type() != Type::CONTROL ||
+         n->as_Proj()->_con == 0, "If control projection, it must be projection 0");
   return result;
 }
 
diff --git a/src/hotspot/share/opto/graphKit.cpp b/src/hotspot/share/opto/graphKit.cpp
index 8d32694e9a5..bbd00d111f7 100644
--- a/src/hotspot/share/opto/graphKit.cpp
+++ b/src/hotspot/share/opto/graphKit.cpp
@@ -41,6 +41,7 @@
 #include "opto/machnode.hpp"
 #include "opto/opaquenode.hpp"
 #include "opto/parse.hpp"
+#include "opto/reachability.hpp"
 #include "opto/rootnode.hpp"
 #include "opto/runtime.hpp"
 #include "opto/subtypenode.hpp"
@@ -3541,6 +3542,15 @@ Node* GraphKit::insert_mem_bar_volatile(int opcode, int alias_idx, Node* precede
   return membar;
 }
 
+//------------------------------insert_reachability_fence----------------------
+Node* GraphKit::insert_reachability_fence(Node* referent) {
+  assert(!referent->is_top(), "");
+  Node* rf = _gvn.transform(new ReachabilityFenceNode(C, control(), referent));
+  set_control(rf);
+  C->record_for_igvn(rf);
+  return rf;
+}
+
 //------------------------------shared_lock------------------------------------
 // Emit locking code.
 FastLockNode* GraphKit::shared_lock(Node* obj) {
diff --git a/src/hotspot/share/opto/graphKit.hpp b/src/hotspot/share/opto/graphKit.hpp
index 273009ca7ce..f53f73d0978 100644
--- a/src/hotspot/share/opto/graphKit.hpp
+++ b/src/hotspot/share/opto/graphKit.hpp
@@ -805,6 +805,7 @@ class GraphKit : public Phase {
   int next_monitor();
   Node* insert_mem_bar(int opcode, Node* precedent = nullptr);
   Node* insert_mem_bar_volatile(int opcode, int alias_idx, Node* precedent = nullptr);
+  Node* insert_reachability_fence(Node* referent);
   // Optional 'precedent' is appended as an extra edge, to force ordering.
   FastLockNode* shared_lock(Node* obj);
   void shared_unlock(Node* box, Node* obj);
diff --git a/src/hotspot/share/opto/library_call.cpp b/src/hotspot/share/opto/library_call.cpp
index e0f95377cde..26417436ed9 100644
--- a/src/hotspot/share/opto/library_call.cpp
+++ b/src/hotspot/share/opto/library_call.cpp
@@ -568,6 +568,7 @@ bool LibraryCallKit::try_to_inline(int predicate) {
 
   case vmIntrinsics::_Reference_get0:           return inline_reference_get0();
   case vmIntrinsics::_Reference_refersTo0:      return inline_reference_refersTo0(false);
+  case vmIntrinsics::_Reference_reachabilityFence: return inline_reference_reachabilityFence();
   case vmIntrinsics::_PhantomReference_refersTo0: return inline_reference_refersTo0(true);
   case vmIntrinsics::_Reference_clear0:         return inline_reference_clear0(false);
   case vmIntrinsics::_PhantomReference_clear0:  return inline_reference_clear0(true);
@@ -7025,6 +7026,14 @@ bool LibraryCallKit::inline_reference_clear0(bool is_phantom) {
   return true;
 }
 
+//-----------------------inline_reference_reachabilityFence-----------------
+// bool java.lang.ref.Reference.reachabilityFence();
+bool LibraryCallKit::inline_reference_reachabilityFence() {
+  Node* referent = argument(0);
+  insert_reachability_fence(referent);
+  return true;
+}
+
 Node* LibraryCallKit::load_field_from_object(Node* fromObj, const char* fieldName, const char* fieldTypeString,
                                              DecoratorSet decorators, bool is_static,
                                              ciInstanceKlass* fromKls) {
diff --git a/src/hotspot/share/opto/library_call.hpp b/src/hotspot/share/opto/library_call.hpp
index 9b87df645e1..9aae48302cf 100644
--- a/src/hotspot/share/opto/library_call.hpp
+++ b/src/hotspot/share/opto/library_call.hpp
@@ -312,6 +312,7 @@ class LibraryCallKit : public GraphKit {
   bool inline_divmod_methods(vmIntrinsics::ID id);
   bool inline_reference_get0();
   bool inline_reference_refersTo0(bool is_phantom);
+  bool inline_reference_reachabilityFence();
   bool inline_reference_clear0(bool is_phantom);
   bool inline_Class_cast();
   bool inline_aescrypt_Block(vmIntrinsics::ID id);
diff --git a/src/hotspot/share/opto/loopTransform.cpp b/src/hotspot/share/opto/loopTransform.cpp
index 60a61b6bb4e..b65f90093ab 100644
--- a/src/hotspot/share/opto/loopTransform.cpp
+++ b/src/hotspot/share/opto/loopTransform.cpp
@@ -52,17 +52,70 @@
 // Given an IfNode, return the loop-exiting projection or null if both
 // arms remain in the loop.
 Node *IdealLoopTree::is_loop_exit(Node *iff) const {
-  if (iff->outcnt() != 2) return nullptr;  // Ignore partially dead tests
-  PhaseIdealLoop *phase = _phase;
+  assert(iff->is_If(), "not an If: %s", iff->Name());
+  assert(is_member(_phase->get_loop(iff)), "not related");
+
+  if (iff->outcnt() != 2) {
+    return nullptr;  // Ignore partially dead tests
+  }
   // Test is an IfNode, has 2 projections.  If BOTH are in the loop
   // we need loop unswitching instead of peeling.
-  if (!is_member(phase->get_loop(iff->raw_out(0))))
+  if (!is_member(_phase->get_loop(iff->raw_out(0)))) {
     return iff->raw_out(0);
-  if (!is_member(phase->get_loop(iff->raw_out(1))))
+  }
+  if (!is_member(_phase->get_loop(iff->raw_out(1)))) {
     return iff->raw_out(1);
+  }
   return nullptr;
 }
 
+//------------------------------unique_loop_exit_or_null----------------------
+// Return the loop-exit projection if loop exit is unique.
+IfFalseNode* IdealLoopTree::unique_loop_exit_proj_or_null() {
+  if (is_loop() && head()->is_BaseCountedLoop()) {
+    IfNode* loop_end = head()->as_BaseCountedLoop()->loopexit_or_null();
+    if (loop_end == nullptr) {
+      return nullptr; // malformed loop shape
+    }
+    // Look for other loop exits.
+    assert(_phase->is_dominator(head(), tail()), "sanity");
+    for (Node* ctrl = tail(); ctrl != head(); ctrl = ctrl->in(0)) {
+      assert(is_member(_phase->get_loop(ctrl)), "sanity");
+      if (ctrl->is_If()) {
+        if (!is_loop_exit(ctrl->as_If())) {
+          continue; // local branch
+        } else if (ctrl != loop_end) {
+          return nullptr; // multiple loop exits
+        }
+      } else if (ctrl->is_Region()) {
+        return nullptr; // give up on control flow merges
+      } else if (ctrl->is_ReachabilityFence() ||
+                 ctrl->is_SafePoint() ||
+                 ctrl->is_MemBar() ||
+                 ctrl->Opcode() == Op_Blackhole) {
+        continue; // skip
+      } else if (ctrl->is_Proj()) {
+        if (ctrl->is_IfProj() ||
+            ctrl->Opcode() == Op_SCMemProj ||
+            ctrl->Opcode() == Op_Proj) {
+          continue; // skip simple control projections
+        } else if (ctrl->is_CatchProj() ||
+                   ctrl->is_JumpProj()) {
+          return nullptr; // give up on control flow splits
+        } else {
+          assert(false, "unknown control projection: %s", ctrl->Name());
+          return nullptr; // stop on unknown control node
+        }
+      } else {
+        assert(false, "unknown CFG node: %s", ctrl->Name());
+        return nullptr; // stop on unknown control node
+      }
+    }
+    assert(is_loop_exit(loop_end), "not a loop exit?");
+    return loop_end->false_proj_or_null();
+  }
+  return nullptr; // not found or multiple loop exits
+}
 
 //=============================================================================
 
@@ -3135,9 +3188,13 @@ static CountedLoopNode* locate_pre_from_main(CountedLoopNode* main_loop) {
   Node* ctrl = main_loop->skip_assertion_predicates_with_halt();
   assert(ctrl->Opcode() == Op_IfTrue || ctrl->Opcode() == Op_IfFalse, "");
   Node* iffm = ctrl->in(0);
-  assert(iffm->Opcode() == Op_If, "");
+  assert(iffm->Opcode() == Op_If, "%s", iffm->Name());
   Node* p_f = iffm->in(0);
-  assert(p_f->Opcode() == Op_IfFalse, "");
+  // Skip ReachabilityFences hoisted out of pre-loop.
+  while (p_f->is_ReachabilityFence()) {
+    p_f = p_f->in(0);
+  }
+  assert(p_f->Opcode() == Op_IfFalse, "%s", p_f->Name());
   CountedLoopNode* pre_loop = p_f->in(0)->as_CountedLoopEnd()->loopnode();
   assert(pre_loop->is_pre_loop(), "No pre loop found");
   return pre_loop;
diff --git a/src/hotspot/share/opto/loopnode.cpp b/src/hotspot/share/opto/loopnode.cpp
index 6963a67118f..35a9108892c 100644
--- a/src/hotspot/share/opto/loopnode.cpp
+++ b/src/hotspot/share/opto/loopnode.cpp
@@ -44,6 +44,7 @@
 #include "opto/opaquenode.hpp"
 #include "opto/opcodes.hpp"
 #include "opto/predicates.hpp"
+#include "opto/reachability.hpp"
 #include "opto/rootnode.hpp"
 #include "opto/runtime.hpp"
 #include "opto/vectorization.hpp"
@@ -3934,6 +3935,7 @@ IdealLoopTree::IdealLoopTree(PhaseIdealLoop* phase, Node* head, Node* tail): _pa
                                                                              _has_range_checks(0), _has_range_checks_computed(0),
                                                                              _safepts(nullptr),
                                                                              _required_safept(nullptr),
+                                                                             _reachability_fences(nullptr),
                                                                              _allow_optimizations(true) {
   precond(_head != nullptr);
   precond(_tail != nullptr);
@@ -4855,6 +4857,15 @@ uint IdealLoopTree::est_loop_flow_merge_sz() const {
   return 0;
 }
 
+void IdealLoopTree::register_reachability_fence(ReachabilityFenceNode* rf) {
+  if (_reachability_fences == nullptr) {
+    _reachability_fences = new Node_List();
+  }
+  if (!_reachability_fences->contains(rf)) {
+    _reachability_fences->push(rf);
+  }
+}
+
 #ifndef PRODUCT
 //------------------------------dump_head--------------------------------------
 // Dump 1 liner for loop header info
@@ -4914,6 +4925,9 @@ void IdealLoopTree::dump_head() {
   if (_has_call) tty->print(" has_call");
   if (_has_sfpt) tty->print(" has_sfpt");
   if (_rce_candidate) tty->print(" rce");
+  if (_reachability_fences != nullptr && _reachability_fences->size() > 0) {
+    tty->print(" has_rf");
+  }
   if (_safepts != nullptr && _safepts->size() > 0) {
     tty->print(" sfpts={"); _safepts->dump_simple(); tty->print(" }");
   }
@@ -4921,6 +4935,9 @@ void IdealLoopTree::dump_head() {
     tty->print(" req={"); _required_safept->dump_simple(); tty->print(" }");
   }
   if (Verbose) {
+    if (_reachability_fences != nullptr && _reachability_fences->size() > 0) {
+      tty->print(" rfs={"); _reachability_fences->dump_simple(); tty->print(" }");
+    }
     tty->print(" body={"); _body.dump_simple(); tty->print(" }");
   }
   if (_head->is_Loop() && _head->as_Loop()->is_strip_mined()) {
@@ -5179,12 +5196,14 @@ bool PhaseIdealLoop::process_expensive_nodes() {
 // Create a PhaseLoop.  Build the ideal Loop tree.  Map each Ideal Node to
 // its corresponding LoopNode.  If 'optimize' is true, do some loop cleanups.
 void PhaseIdealLoop::build_and_optimize() {
-  assert(!C->post_loop_opts_phase(), "no loop opts allowed");
-
   bool do_split_ifs = (_mode == LoopOptsDefault);
   bool skip_loop_opts = (_mode == LoopOptsNone);
   bool do_max_unroll = (_mode == LoopOptsMaxUnroll);
+  bool do_verify = (_mode == LoopOptsVerify);
+  bool do_expand_reachability_fences = (_mode == PostLoopOptsExpandReachabilityFences);
 
+  assert(!C->post_loop_opts_phase() || do_expand_reachability_fences || do_verify,
+         "no loop opts allowed");
 
   bool old_progress = C->major_progress();
   uint orig_worklist_size = _igvn._worklist.size();
@@ -5251,11 +5270,13 @@ void PhaseIdealLoop::build_and_optimize() {
 
   BarrierSetC2* bs = BarrierSet::barrier_set()->barrier_set_c2();
   // Nothing to do, so get out
-  bool stop_early = !C->has_loops() && !skip_loop_opts && !do_split_ifs && !do_max_unroll && !_verify_me &&
-          !_verify_only && !bs->is_gc_specific_loop_opts_pass(_mode);
+  bool stop_early = !C->has_loops() && !skip_loop_opts && !do_split_ifs && !do_max_unroll &&
+                    !do_expand_reachability_fences && !_verify_me && !_verify_only &&
+                    !bs->is_gc_specific_loop_opts_pass(_mode) ;
   bool do_expensive_nodes = C->should_optimize_expensive_nodes(_igvn);
+  bool do_optimize_reachability_fences = OptimizeReachabilityFences && (C->reachability_fences_count() > 0);
   bool strip_mined_loops_expanded = bs->strip_mined_loops_expanded(_mode);
-  if (stop_early && !do_expensive_nodes) {
+  if (stop_early && !do_expensive_nodes && !do_optimize_reachability_fences) {
     return;
   }
 
@@ -5331,7 +5352,7 @@ void PhaseIdealLoop::build_and_optimize() {
 
   // Given early legal placement, try finding counted loops.  This placement
   // is good enough to discover most loop invariants.
-  if (!_verify_me && !_verify_only && !strip_mined_loops_expanded) {
+  if (!_verify_me && !_verify_only && !strip_mined_loops_expanded && !do_expand_reachability_fences) {
     _ltree_root->counted_loop( this );
   }
 
@@ -5361,8 +5382,14 @@ void PhaseIdealLoop::build_and_optimize() {
   eliminate_useless_multiversion_if();
 
   if (stop_early) {
-    assert(do_expensive_nodes, "why are we here?");
-    if (process_expensive_nodes()) {
+    assert(do_expensive_nodes || do_optimize_reachability_fences, "why are we here?");
+    // Use the opportunity to optimize reachability fence nodes irrespective of
+    // whether loop optimizations are performed or not.
+    if (do_optimize_reachability_fences && optimize_reachability_fences()) {
+      recompute_dom_depth();
+      DEBUG_ONLY( if (VerifyLoopOptimizations) { verify(); } );
+    }
+    if (do_expensive_nodes && process_expensive_nodes()) {
       // If we made some progress when processing expensive nodes then
       // the IGVN may modify the graph in a way that will allow us to
       // make some more progress: we need to try processing expensive
@@ -5390,6 +5417,22 @@ void PhaseIdealLoop::build_and_optimize() {
   }
 #endif
 
+  if (do_optimize_reachability_fences && optimize_reachability_fences()) {
+    recompute_dom_depth();
+    DEBUG_ONLY( if (VerifyLoopOptimizations) { verify(); } );
+  }
+
+  if (do_expand_reachability_fences) {
+    assert(C->post_loop_opts_phase(), "required");
+    if (expand_reachability_fences()) {
+      recompute_dom_depth();
+      DEBUG_ONLY( if (VerifyLoopOptimizations) { verify(); } );
+    }
+    return;
+  }
+
+  assert(!C->post_loop_opts_phase(), "required");
+
   if (skip_loop_opts) {
     C->restore_major_progress(old_progress);
     return;
@@ -6286,6 +6329,8 @@ int PhaseIdealLoop::build_loop_tree_impl(Node* n, int pre_order) {
         // Record all safepoints in this loop.
         if (innermost->_safepts == nullptr) innermost->_safepts = new Node_List();
         innermost->_safepts->push(n);
+      } else if (n->is_ReachabilityFence()) {
+        innermost->register_reachability_fence(n->as_ReachabilityFence());
       }
     }
   }
diff --git a/src/hotspot/share/opto/loopnode.hpp b/src/hotspot/share/opto/loopnode.hpp
index 6667c71511c..26b82259327 100644
--- a/src/hotspot/share/opto/loopnode.hpp
+++ b/src/hotspot/share/opto/loopnode.hpp
@@ -44,6 +44,7 @@ class PredicateBlock;
 class PathFrequency;
 class PhaseIdealLoop;
 class LoopSelector;
+class ReachabilityFenceNode;
 class UnswitchedLoopSelector;
 class VectorSet;
 class VSharedData;
@@ -662,6 +663,7 @@ public:
 
   Node_List* _safepts;          // List of safepoints in this loop
   Node_List* _required_safept;  // A inner loop cannot delete these safepts;
+  Node_List* _reachability_fences; // List of reachability fences in this loop
   bool  _allow_optimizations;   // Allow loop optimizations
 
   IdealLoopTree(PhaseIdealLoop* phase, Node* head, Node* tail);
@@ -720,6 +722,9 @@ public:
   // Check for Node being a loop-breaking test
   Node *is_loop_exit(Node *iff) const;
 
+  // Return unique loop-exit projection or null if the loop has multiple exits.
+  IfFalseNode* unique_loop_exit_proj_or_null();
+
   // Remove simplistic dead code from loop body
   void DCE_loop_body();
 
@@ -825,6 +830,9 @@ public:
     return _head->as_Loop()->is_strip_mined() ? _parent : this;
   }
 
+  // Registers a reachability fence node in the loop.
+  void register_reachability_fence(ReachabilityFenceNode* rf);
+
 #ifndef PRODUCT
   void dump_head();       // Dump loop head only
   void dump();            // Dump this loop recursively
@@ -1167,6 +1175,16 @@ public:
     forward_ctrl(old_node, new_node);
   }
 
+  void remove_dead_data_node(Node* dead) {
+    assert(dead->outcnt() == 0 && !dead->is_top(), "must be dead");
+    assert(!dead->is_CFG(), "not a data node");
+    Node* c = get_ctrl(dead);
+    IdealLoopTree* lpt = get_loop(c);
+    _loop_or_ctrl.map(dead->_idx, nullptr); // This node is useless
+    lpt->_body.yank(dead);
+    igvn().remove_dead_node(dead, PhaseIterGVN::NodeOrigin::Graph);
+  }
+
 private:
 
   // Place 'n' in some loop nest, where 'n' is a CFG node
@@ -1599,6 +1617,15 @@ public:
   // Implementation of the loop predication to promote checks outside the loop
   bool loop_predication_impl(IdealLoopTree *loop);
 
+  // Reachability Fence (RF) support.
+ private:
+  void insert_rf(Node* ctrl, Node* referent);
+  void replace_rf(Node* old_node, Node* new_node);
+  void remove_rf(ReachabilityFenceNode* rf);
+ public:
+  bool optimize_reachability_fences();
+  bool expand_reachability_fences();
+
  private:
   bool loop_predication_impl_helper(IdealLoopTree* loop, IfProjNode* if_success_proj,
                                     ParsePredicateSuccessProj* parse_predicate_proj, CountedLoopNode* cl, ConNode* zero,
diff --git a/src/hotspot/share/opto/macro.cpp b/src/hotspot/share/opto/macro.cpp
index 01c67187883..8c5dbe7fb48 100644
--- a/src/hotspot/share/opto/macro.cpp
+++ b/src/hotspot/share/opto/macro.cpp
@@ -44,6 +44,7 @@
 #include "opto/node.hpp"
 #include "opto/opaquenode.hpp"
 #include "opto/phaseX.hpp"
+#include "opto/reachability.hpp"
 #include "opto/rootnode.hpp"
 #include "opto/runtime.hpp"
 #include "opto/subnode.hpp"
@@ -683,6 +684,8 @@ bool PhaseMacroExpand::can_eliminate_allocation(PhaseIterGVN* igvn, AllocateNode
                   use->as_ArrayCopy()->is_copyofrange_validated()) &&
                  use->in(ArrayCopyNode::Dest) == res) {
         // ok to eliminate
+      } else if (use->is_ReachabilityFence() && OptimizeReachabilityFences) {
+        // ok to eliminate
       } else if (use->is_SafePoint()) {
         SafePointNode* sfpt = use->as_SafePoint();
         if (sfpt->is_Call() && sfpt->as_Call()->has_non_debug_use(res)) {
@@ -778,7 +781,13 @@ void PhaseMacroExpand::undo_previous_scalarizations(GrowableArray <SafePointNode
   // rollback processed safepoints
   while (safepoints_done.length() > 0) {
     SafePointNode* sfpt_done = safepoints_done.pop();
+
+    SafePointNode::NodeEdgeTempStorage non_debug_edges_worklist(igvn());
+
+    sfpt_done->remove_non_debug_edges(non_debug_edges_worklist);
+
     // remove any extra entries we added to the safepoint
+    assert(sfpt_done->jvms()->endoff() == sfpt_done->req(), "no extra edges past debug info allowed");
     uint last = sfpt_done->req() - 1;
     for (int k = 0;  k < nfields; k++) {
       sfpt_done->del_req(last--);
@@ -799,6 +808,9 @@ void PhaseMacroExpand::undo_previous_scalarizations(GrowableArray <SafePointNode
         }
       }
     }
+
+    sfpt_done->restore_non_debug_edges(non_debug_edges_worklist);
+
     _igvn._worklist.push(sfpt_done);
   }
 }
@@ -839,6 +851,8 @@ void PhaseMacroExpand::undo_previous_scalarizations(GrowableArray <SafePointNode
 #endif
 
 SafePointScalarObjectNode* PhaseMacroExpand::create_scalarized_object_description(AllocateNode *alloc, SafePointNode* sfpt) {
+  assert(sfpt->jvms()->endoff() == sfpt->req(), "no extra edges past debug info allowed");
+
   // Fields of scalar objs are referenced only at the end
   // of regular debuginfo at the last (youngest) JVMS.
   // Record relative start index.
@@ -964,17 +978,25 @@ SafePointScalarObjectNode* PhaseMacroExpand::create_scalarized_object_descriptio
 }
 
 // Do scalar replacement.
-bool PhaseMacroExpand::scalar_replacement(AllocateNode *alloc, GrowableArray <SafePointNode *>& safepoints) {
-  GrowableArray <SafePointNode *> safepoints_done;
+bool PhaseMacroExpand::scalar_replacement(AllocateNode* alloc, GrowableArray<SafePointNode*>& safepoints) {
+  GrowableArray<SafePointNode*> safepoints_done;
   Node* res = alloc->result_cast();
   assert(res == nullptr || res->is_CheckCastPP(), "unexpected AllocateNode result");
 
   // Process the safepoint uses
   while (safepoints.length() > 0) {
     SafePointNode* sfpt = safepoints.pop();
+
+  SafePointNode::NodeEdgeTempStorage non_debug_edges_worklist(igvn());
+
+    // All sfpt inputs are implicitly included into debug info during the scalarization process below.
+    // Keep non-debug inputs separately, so they stay non-debug.
+    sfpt->remove_non_debug_edges(non_debug_edges_worklist);
+
     SafePointScalarObjectNode* sobj = create_scalarized_object_description(alloc, sfpt);
 
     if (sobj == nullptr) {
+      sfpt->restore_non_debug_edges(non_debug_edges_worklist);
       undo_previous_scalarizations(safepoints_done, alloc);
       return false;
     }
@@ -983,6 +1005,8 @@ bool PhaseMacroExpand::scalar_replacement(AllocateNode *alloc, GrowableArray <Sa
     // to the allocated object with "sobj"
     JVMState *jvms = sfpt->jvms();
     sfpt->replace_edges_in_range(res, sobj, jvms->debug_start(), jvms->debug_end(), &_igvn);
+    non_debug_edges_worklist.remove_edge_if_present(res); // drop scalarized input from non-debug info
+    sfpt->restore_non_debug_edges(non_debug_edges_worklist);
     _igvn._worklist.push(sfpt);
 
     // keep it for rollback
@@ -1073,6 +1097,8 @@ void PhaseMacroExpand::process_users_of_allocation(CallNode *alloc) {
           }
         }
         _igvn._worklist.push(ac);
+      } else if (use->is_ReachabilityFence() && OptimizeReachabilityFences) {
+        use->as_ReachabilityFence()->clear_referent(_igvn); // redundant fence; will be removed during IGVN
       } else {
         eliminate_gc_barrier(use);
       }
diff --git a/src/hotspot/share/opto/memnode.cpp b/src/hotspot/share/opto/memnode.cpp
index 9ec3402c701..c7fe4508473 100644
--- a/src/hotspot/share/opto/memnode.cpp
+++ b/src/hotspot/share/opto/memnode.cpp
@@ -4081,7 +4081,7 @@ uint LoadStoreNode::ideal_reg() const {
 bool LoadStoreNode::result_not_used() const {
   for (DUIterator_Fast imax, i = fast_outs(imax); i < imax; i++) {
     Node *x = fast_out(i);
-    if (x->Opcode() == Op_SCMemProj) {
+    if (x->Opcode() == Op_SCMemProj || x->is_ReachabilityFence()) {
       continue;
     }
     if (x->bottom_type() == TypeTuple::MEMBAR &&
diff --git a/src/hotspot/share/opto/node.cpp b/src/hotspot/share/opto/node.cpp
index cb5795a1250..3eafd97d7c1 100644
--- a/src/hotspot/share/opto/node.cpp
+++ b/src/hotspot/share/opto/node.cpp
@@ -38,6 +38,7 @@
 #include "opto/matcher.hpp"
 #include "opto/node.hpp"
 #include "opto/opcodes.hpp"
+#include "opto/reachability.hpp"
 #include "opto/regmask.hpp"
 #include "opto/rootnode.hpp"
 #include "opto/type.hpp"
@@ -503,6 +504,9 @@ Node *Node::clone() const {
   if (is_expensive()) {
     C->add_expensive_node(n);
   }
+  if (is_ReachabilityFence()) {
+    C->add_reachability_fence(n->as_ReachabilityFence());
+  }
   if (for_post_loop_opts_igvn()) {
     // Don't add cloned node to Compile::_for_post_loop_opts_igvn list automatically.
     // If it is applicable, it will happen anyway when the cloned node is registered with IGVN.
@@ -622,6 +626,9 @@ void Node::destruct(PhaseValues* phase) {
   if (is_expensive()) {
     compile->remove_expensive_node(this);
   }
+  if (is_ReachabilityFence()) {
+    compile->remove_reachability_fence(as_ReachabilityFence());
+  }
   if (is_OpaqueTemplateAssertionPredicate()) {
     compile->remove_template_assertion_predicate_opaque(as_OpaqueTemplateAssertionPredicate());
   }
@@ -2994,6 +3001,25 @@ bool Node::is_data_proj_of_pure_function(const Node* maybe_pure_function) const
   return Opcode() == Op_Proj && as_Proj()->_con == TypeFunc::Parms && maybe_pure_function->is_CallLeafPure();
 }
 
+//--------------------------has_non_debug_uses------------------------------
+// Checks whether the node has any non-debug uses or not.
+bool Node::has_non_debug_uses() const {
+  for (DUIterator_Fast imax, i = fast_outs(imax); i < imax; i++) {
+    Node* u = fast_out(i);
+    if (u->is_SafePoint()) {
+      if (u->is_Call() && u->as_Call()->has_non_debug_use(this)) {
+        return true;
+      }
+      // Non-call safepoints have only debug uses.
+    } else if (u->is_ReachabilityFence()) {
+      // Reachability fence is treated as debug use.
+    } else {
+      return true; // everything else is conservatively treated as non-debug use
+    }
+  }
+  return false; // no non-debug uses found
+}
+
 //=============================================================================
 //------------------------------yank-------------------------------------------
 // Find and remove
diff --git a/src/hotspot/share/opto/node.hpp b/src/hotspot/share/opto/node.hpp
index 46b89aa2c5f..36855d659ba 100644
--- a/src/hotspot/share/opto/node.hpp
+++ b/src/hotspot/share/opto/node.hpp
@@ -168,6 +168,7 @@ class Pipeline;
 class PopulateIndexNode;
 class ProjNode;
 class RangeCheckNode;
+class ReachabilityFenceNode;
 class ReductionNode;
 class RegMask;
 class RegionNode;
@@ -452,6 +453,9 @@ public:
   // Check whether node has become unreachable
   bool is_unreachable(PhaseIterGVN &igvn) const;
 
+  // Does the node have any immediate non-debug uses?
+  bool has_non_debug_uses() const;
+
   // Set a required input edge, also updates corresponding output edge
   void add_req( Node *n ); // Append a NEW required input
   void add_req( Node *n0, Node *n1 ) {
@@ -824,6 +828,7 @@ public:
     DEFINE_CLASS_ID(Move,     Node, 20)
     DEFINE_CLASS_ID(LShift,   Node, 21)
     DEFINE_CLASS_ID(Neg,      Node, 22)
+    DEFINE_CLASS_ID(ReachabilityFence, Node, 23)
 
     _max_classes  = ClassMask_Neg
   };
@@ -1013,6 +1018,7 @@ public:
   DEFINE_CLASS_QUERY(PCTable)
   DEFINE_CLASS_QUERY(Phi)
   DEFINE_CLASS_QUERY(Proj)
+  DEFINE_CLASS_QUERY(ReachabilityFence)
   DEFINE_CLASS_QUERY(Reduction)
   DEFINE_CLASS_QUERY(Region)
   DEFINE_CLASS_QUERY(Root)
diff --git a/src/hotspot/share/opto/parse.hpp b/src/hotspot/share/opto/parse.hpp
index 42f44f0f7ea..5118019fc31 100644
--- a/src/hotspot/share/opto/parse.hpp
+++ b/src/hotspot/share/opto/parse.hpp
@@ -356,6 +356,7 @@ class Parse : public GraphKit {
   bool          _wrote_stable;       // Did we write a @Stable field?
   bool          _wrote_fields;       // Did we write any field?
   Node*         _alloc_with_final_or_stable; // An allocation node with final or @Stable field
+  Node*         _stress_rf_hook; // StressReachabilityFences support
 
   // Variables which track Java semantics during bytecode parsing:
 
diff --git a/src/hotspot/share/opto/parse1.cpp b/src/hotspot/share/opto/parse1.cpp
index 683633f6355..6a400631bff 100644
--- a/src/hotspot/share/opto/parse1.cpp
+++ b/src/hotspot/share/opto/parse1.cpp
@@ -369,6 +369,15 @@ void Parse::load_interpreter_state(Node* osr_buf) {
       continue;
     }
     set_local(index, check_interpreter_type(l, type, bad_type_exit));
+    if (StressReachabilityFences && type->isa_oopptr() != nullptr) {
+      // Keep all oop locals alive until the method returns as if there are
+      // reachability fences for them at the end of the method.
+      Node* loc = local(index);
+      if (loc->bottom_type() != TypePtr::NULL_PTR) {
+        assert(loc->bottom_type()->isa_oopptr() != nullptr, "%s", Type::str(loc->bottom_type()));
+        _stress_rf_hook->add_req(loc);
+      }
+    }
   }
 
   for (index = 0; index < sp(); index++) {
@@ -377,6 +386,15 @@ void Parse::load_interpreter_state(Node* osr_buf) {
     if (l->is_top())  continue;  // nothing here
     const Type *type = osr_block->stack_type_at(index);
     set_stack(index, check_interpreter_type(l, type, bad_type_exit));
+    if (StressReachabilityFences && type->isa_oopptr() != nullptr) {
+      // Keep all oops on stack alive until the method returns as if there are
+      // reachability fences for them at the end of the method.
+      Node* stk = stack(index);
+      if (stk->bottom_type() != TypePtr::NULL_PTR) {
+        assert(stk->bottom_type()->isa_oopptr() != nullptr, "%s", Type::str(stk->bottom_type()));
+        _stress_rf_hook->add_req(stk);
+      }
+    }
   }
 
   if (bad_type_exit->control()->req() > 1) {
@@ -411,6 +429,7 @@ Parse::Parse(JVMState* caller, ciMethod* parse_method, float expected_uses)
   _wrote_stable = false;
   _wrote_fields = false;
   _alloc_with_final_or_stable = nullptr;
+  _stress_rf_hook = (StressReachabilityFences ? new Node(1) : nullptr);
   _block = nullptr;
   _first_return = true;
   _replaced_nodes_for_exceptions = false;
@@ -642,6 +661,11 @@ Parse::Parse(JVMState* caller, ciMethod* parse_method, float expected_uses)
 
   if (log)  log->done("parse nodes='%d' live='%d' memory='%zu'",
                       C->unique(), C->live_nodes(), C->node_arena()->used());
+
+  if (StressReachabilityFences) {
+    _stress_rf_hook->destruct(&_gvn);
+    _stress_rf_hook = nullptr;
+  }
 }
 
 //---------------------------do_all_blocks-------------------------------------
@@ -1194,6 +1218,14 @@ SafePointNode* Parse::create_entry_map() {
   return entry_map;
 }
 
+//-----------------------is_auto_boxed_primitive------------------------------
+// Helper method to detect auto-boxed primitives (result of valueOf() call).
+static bool is_auto_boxed_primitive(Node* n) {
+  return (n->is_Proj() && n->as_Proj()->_con == TypeFunc::Parms &&
+          n->in(0)->is_CallJava() &&
+          n->in(0)->as_CallJava()->method()->is_boxing_method());
+}
+
 //-----------------------------do_method_entry--------------------------------
 // Emit any code needed in the pseudo-block before BCI zero.
 // The main thing to do is lock the receiver of a synchronized method.
@@ -1207,6 +1239,19 @@ void Parse::do_method_entry() {
     make_dtrace_method_entry(method());
   }
 
+  if (StressReachabilityFences) {
+    // Keep all oop arguments alive until the method returns as if there are
+    // reachability fences for them at the end of the method.
+    int max_locals = jvms()->loc_size();
+    for (int idx = 0; idx < max_locals; idx++) {
+      Node* loc = local(idx);
+      if (loc->bottom_type()->isa_oopptr() != nullptr &&
+          !is_auto_boxed_primitive(loc)) { // ignore auto-boxed primitives
+        _stress_rf_hook->add_req(loc);
+      }
+    }
+  }
+
 #ifdef ASSERT
   // Narrow receiver type when it is too broad for the method being parsed.
   if (!method()->is_static()) {
@@ -2197,6 +2242,15 @@ void Parse::return_current(Node* value) {
     call_register_finalizer();
   }
 
+  if (StressReachabilityFences) {
+    // Insert reachability fences for all oop arguments at the end of the method.
+    for (uint i = 1; i < _stress_rf_hook->req(); i++) {
+      Node* referent = _stress_rf_hook->in(i);
+      assert(referent->bottom_type()->isa_oopptr(), "%s", Type::str(referent->bottom_type()));
+      insert_reachability_fence(referent);
+    }
+  }
+
   // Do not set_parse_bci, so that return goo is credited to the return insn.
   set_bci(InvocationEntryBci);
   if (method()->is_synchronized()) {
diff --git a/src/hotspot/share/opto/phase.cpp b/src/hotspot/share/opto/phase.cpp
index 5603033ce69..3f1866990e2 100644
--- a/src/hotspot/share/opto/phase.cpp
+++ b/src/hotspot/share/opto/phase.cpp
@@ -90,6 +90,9 @@ void Phase::print_timers() {
     tty->print_cr ("             Prune Useless:   %7.3f s", timers[_t_vector_pru].seconds());
     tty->print_cr ("         Renumber Live:       %7.3f s", timers[_t_renumberLive].seconds());
     tty->print_cr ("         IdealLoop:           %7.3f s", timers[_t_idealLoop].seconds());
+    tty->print_cr ("           ReachabilityFence: %7.3f s", timers[_t_reachability].seconds());
+    tty->print_cr ("             Optimize:        %7.3f s", timers[_t_reachability_optimize].seconds());
+    tty->print_cr ("             Expand:          %7.3f s", timers[_t_reachability_expand].seconds());
     tty->print_cr ("           AutoVectorize:     %7.3f s", timers[_t_autoVectorize].seconds());
     tty->print_cr ("         IdealLoop Verify:    %7.3f s", timers[_t_idealLoopVerify].seconds());
     tty->print_cr ("         Cond Const Prop:     %7.3f s", timers[_t_ccp].seconds());
diff --git a/src/hotspot/share/opto/phase.hpp b/src/hotspot/share/opto/phase.hpp
index 6700df6ec17..5bd3c34f15f 100644
--- a/src/hotspot/share/opto/phase.hpp
+++ b/src/hotspot/share/opto/phase.hpp
@@ -85,6 +85,9 @@ public:
     f(         _t_vector_pru,        "vector_pru")               \
     f(     _t_renumberLive,          "")                         \
     f(     _t_idealLoop,             "idealLoop")                \
+    f(       _t_reachability,        "reachabilityFence")        \
+    f(         _t_reachability_optimize,  "reachabilityFence_optimize") \
+    f(         _t_reachability_expand, "reachabilityFence_expand") \
     f(       _t_autoVectorize,       "autoVectorize")            \
     f(     _t_idealLoopVerify,       "idealLoopVerify")          \
     f(     _t_ccp,                   "ccp")                      \
diff --git a/src/hotspot/share/opto/phasetype.hpp b/src/hotspot/share/opto/phasetype.hpp
index ce432fbfc01..2b599ace03a 100644
--- a/src/hotspot/share/opto/phasetype.hpp
+++ b/src/hotspot/share/opto/phasetype.hpp
@@ -106,6 +106,7 @@
   flags(PHASEIDEALLOOP1,                "PhaseIdealLoop 1") \
   flags(PHASEIDEALLOOP2,                "PhaseIdealLoop 2") \
   flags(PHASEIDEALLOOP3,                "PhaseIdealLoop 3") \
+  flags(EXPAND_REACHABILITY_FENCES,     "Expand Reachability Fences") \
   flags(AUTO_VECTORIZATION1_BEFORE_APPLY,                     "AutoVectorization 1, before Apply") \
   flags(AUTO_VECTORIZATION3_AFTER_ADJUST_LIMIT,               "AutoVectorization 2, after Adjusting Pre-loop Limit") \
   flags(AUTO_VECTORIZATION4_AFTER_SPECULATIVE_RUNTIME_CHECKS, "AutoVectorization 3, after Adding Speculative Runtime Checks") \
diff --git a/src/hotspot/share/opto/reachability.cpp b/src/hotspot/share/opto/reachability.cpp
new file mode 100644
index 00000000000..b45b340ab85
--- /dev/null
+++ b/src/hotspot/share/opto/reachability.cpp
@@ -0,0 +1,512 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ *
+ */
+
+#include "opto/c2_MacroAssembler.hpp"
+#include "opto/callnode.hpp"
+#include "opto/compile.hpp"
+#include "opto/loopnode.hpp"
+#include "opto/phaseX.hpp"
+#include "opto/reachability.hpp"
+#include "opto/regalloc.hpp"
+#include "opto/runtime.hpp"
+#include "utilities/pair.hpp"
+
+/*
+ * java.lang.ref.Reference::reachabilityFence support.
+ *
+ * Reachability Fence (RF) ensures that the given object (referent) remains strongly reachable
+ * regardless of any optimizing transformations the virtual machine may perform that might otherwise
+ * allow the object to become unreachable.
+ *
+ * RFs are intended to be used in performance-critical code, so the primary goal for C2 support is
+ * to reduce their runtime overhead as much as possible.
+ *
+ * Reference::reachabilityFence() calls are intrinsified into ReachabilityFence CFG nodes. RF node keeps
+ * its referent alive, so the referent's location is recorded at every safepoint (in its oop map) which
+ * interferes with referent's live range.
+ *
+ * It is tempting to directly attach referents to interfering safepoints right from the beginning, but it
+ * doesn't play well with some optimizations C2 does (e.g., during loop-invariant code motion a safepoint
+ * can become interfering once a load is hoisted).
+ *
+ * Instead, reachability representation transitions through multiple phases:
+ *   (0) initial set of RFs is materialized during parsing (as a result of
+ *       Reference.reachabilityFence intrinsification);
+ *   (1) optimization pass during loop opts eliminates redundant RF nodes and
+ *       moves the ones with loop-invariant referents outside (after) loops;
+ *   (2) after loop opts are over, RF nodes are eliminated and their referents are transferred to
+ *       safepoint nodes (appended as edges after debug info);
+ *   (3) during final graph reshaping, referent edges are removed from safepoints and materialized as RF nodes
+ *       attached to their safepoint node (closely following it in CFG graph).
+ *
+ * Some implementation considerations.
+ *
+ * (a) It looks attractive to get rid of RF nodes early and transfer to safepoint-attached representation,
+ * but it is not correct until loop opts are done.
+ *
+ * Live ranges of values are routinely extended during loop opts. And it can break the invariant that
+ * all interfering safepoints contain the referent in their oop map. (If an interfering safepoint doesn't
+ * keep the referent alive, then it becomes possible for the referent to be prematurely GCed.)
+ *
+ * compiler/c2/TestReachabilityFence.java demonstrates a situation where a load is hoisted out of a loop thus
+ * extending the live range of the value it produces beyond the safepoint on loop-back edge.
+ *
+ * After loop opts are over, it becomes possible to reliably enumerate all interfering safepoints and
+ * to ensure that the referent is present in their oop maps. Current assumption is that after loop opts the IR graph
+ * is stable enough, so relative order of memory operations and safepoints is preserved and only safepoints between
+ * a referent and it's uses are taken into account. A more conservative analysis can be employed -- any safepoint dominated
+ * by a referent is treated as interfering with it -- if it turns out that the assumption doesn't hold.
+ *
+ * (b) RF nodes may interfere with Register Allocator (RA). If a safepoint is pruned during macro expansion,
+ * it can make some RF nodes redundant, but we don't have information about their relations anymore to detect that.
+ * Redundant RF node unnecessarily extends referent's live range and increases register pressure.
+ *
+ * Hence, we eliminate RF nodes and transfer their referents to corresponding safepoints (phase #2).
+ * When safepoints are pruned, corresponding reachability edges also go away.
+ *
+ * (c) Unfortunately, it's not straightforward to stay with safepoint-attached representation till the very end,
+ * because information about derived oops is attached to safepoints in a similar way. So, for now RFs are
+ * rematerialized at safepoints before RA (phase #3).
+ */
+
+bool ReachabilityFenceNode::is_redundant(PhaseGVN& gvn) {
+  const Type* referent_t = gvn.type(referent());
+  if (referent_t == TypePtr::NULL_PTR) {
+    return true; // no-op fence: null referent
+  }
+  if (!OptimizeReachabilityFences) {
+    return false; // keep reachability fence nodes intact
+  }
+  if (!PreserveReachabilityFencesOnConstants && referent_t->singleton()) {
+    return true; // no-op fence: constants are strongly reachable
+  }
+  return false;
+}
+
+Node* ReachabilityFenceNode::Ideal(PhaseGVN* phase, bool can_reshape) {
+  return (remove_dead_region(phase, can_reshape) ? this : nullptr);
+}
+
+Node* ReachabilityFenceNode::Identity(PhaseGVN* phase) {
+  if (is_redundant(*phase)) {
+    return in(0);
+  }
+  return this;
+}
+
+// Turn the RF node into a no-op by setting its referent to null.
+// Subsequent IGVN pass removes cleared nodes.
+bool ReachabilityFenceNode::clear_referent(PhaseIterGVN& phase) {
+  if (phase.type(referent()) == TypePtr::NULL_PTR) {
+    return false;
+  } else {
+    phase.replace_input_of(this, 1, phase.makecon(TypePtr::NULL_PTR));
+    return true;
+  }
+}
+
+#ifndef PRODUCT
+static void rf_desc(outputStream* st, const ReachabilityFenceNode* rf, PhaseRegAlloc* ra) {
+  char buf[50];
+  ra->dump_register(rf->referent(), buf, sizeof(buf));
+  st->print("reachability fence [%s]", buf);
+}
+
+void ReachabilityFenceNode::format(PhaseRegAlloc* ra, outputStream* st) const {
+  rf_desc(st, this, ra);
+}
+
+void ReachabilityFenceNode::emit(C2_MacroAssembler* masm, PhaseRegAlloc* ra) const {
+  ResourceMark rm;
+  stringStream ss;
+  rf_desc(&ss, this, ra);
+  const char* desc = masm->code_string(ss.freeze());
+  masm->block_comment(desc);
+}
+#endif
+
+// Detect safepoint nodes which are important for reachability tracking purposes.
+// Some SafePoint nodes can't affect referent's reachability in any noticeable way and
+// can be safely ignored during the analysis.
+static bool is_interfering_sfpt_candidate(SafePointNode* sfpt) {
+  if (sfpt->jvms() == nullptr) {
+    return false; // not a real safepoint
+  } else if (sfpt->is_CallStaticJava() && sfpt->as_CallStaticJava()->is_uncommon_trap()) {
+    return false; // uncommon traps are exit points
+  }
+  return true; // a full-blown safepoint can interfere with a reachability fence and its referent
+}
+
+void PhaseIdealLoop::insert_rf(Node* ctrl, Node* referent) {
+  IdealLoopTree* lpt = get_loop(ctrl);
+  Node* ctrl_end = ctrl->unique_ctrl_out();
+
+  auto new_rf = new ReachabilityFenceNode(C, ctrl, referent);
+
+  register_control(new_rf, lpt, ctrl);
+  set_idom(new_rf, ctrl, dom_depth(ctrl) + 1);
+  lpt->register_reachability_fence(new_rf);
+
+  igvn().rehash_node_delayed(ctrl_end);
+  ctrl_end->replace_edge(ctrl, new_rf);
+
+  if (idom(ctrl_end) == ctrl) {
+    set_idom(ctrl_end, new_rf, dom_depth(new_rf) + 1);
+  } else {
+    assert(ctrl_end->is_Region(), "");
+  }
+}
+
+void PhaseIdealLoop::replace_rf(Node* old_node, Node* new_node) {
+  assert(old_node->is_ReachabilityFence() ||
+         (old_node->is_Proj() && old_node->in(0)->is_ReachabilityFence()),
+         "%s", NodeClassNames[old_node->Opcode()]);
+
+  IdealLoopTree* lpt = get_loop(old_node);
+  lpt->_body.yank(old_node);
+  assert(lpt->_reachability_fences != nullptr, "missing");
+  assert(lpt->_reachability_fences->contains(old_node), "missing");
+  lpt->_reachability_fences->yank(old_node);
+  replace_node_and_forward_ctrl(old_node, new_node);
+}
+
+void PhaseIdealLoop::remove_rf(ReachabilityFenceNode* rf) {
+  Node* rf_ctrl_in = rf->in(0);
+  Node* referent = rf->referent();
+  if (rf->clear_referent(igvn()) && referent->outcnt() == 0) {
+    remove_dead_data_node(referent);
+  }
+  replace_rf(rf, rf_ctrl_in);
+}
+
+//======================================================================
+//---------------------------- Phase 1 ---------------------------------
+// Optimization pass over reachability fences during loop opts.
+// Moves RFs with loop-invariant referents out of the loop.
+bool PhaseIdealLoop::optimize_reachability_fences() {
+  Compile::TracePhase tp(_t_reachability_optimize);
+
+  assert(OptimizeReachabilityFences, "required");
+
+  // ResourceMark rm; // NB! not safe because insert_rf may trigger _idom reallocation
+  Unique_Node_List redundant_rfs;
+  typedef Pair<Node*,Node*> LoopExit;
+  GrowableArray<LoopExit> worklist;
+
+  for (int i = 0; i < C->reachability_fences_count(); i++) {
+    ReachabilityFenceNode* rf = C->reachability_fence(i);
+    assert(!rf->is_redundant(igvn()), "required");
+    // Move RFs out of counted loops when possible.
+    IdealLoopTree* lpt = get_loop(rf);
+    Node* referent = rf->referent();
+    if (lpt->is_invariant(referent)) {
+      IfFalseNode* unique_loop_exit = lpt->unique_loop_exit_proj_or_null();
+      if (unique_loop_exit != nullptr) {
+        // Skip over an outer strip-mined loop.
+        if (!lpt->is_root()) {
+          IdealLoopTree* outer_lpt = lpt->_parent;
+          if (outer_lpt->head()->is_OuterStripMinedLoop()) {
+            if (outer_lpt->is_invariant(referent)) {
+              IfNode* outer_loop_end = outer_lpt->head()->as_OuterStripMinedLoop()->outer_loop_end();
+              if (outer_loop_end != nullptr && outer_loop_end->false_proj_or_null() != nullptr) {
+                unique_loop_exit = outer_loop_end->false_proj_or_null();
+              }
+            } else {
+              // An attempt to insert an RF node inside outer strip-mined loop breaks
+              // its IR invariants and manifests as assertion failures.
+              assert(false, "not loop invariant in outer strip-mined loop");
+              continue; // skip
+            }
+          }
+        }
+
+        LoopExit p(referent, unique_loop_exit);
+        worklist.push(p);
+        redundant_rfs.push(rf);
+
+#ifndef PRODUCT
+        if (TraceLoopOpts) {
+          IdealLoopTree* loop = get_loop(unique_loop_exit->in(0));
+          tty->print_cr("ReachabilityFence: N%d: %s N%d/N%d -> loop exit N%d (%s N%d/N%d)",
+                        rf->_idx, lpt->head()->Name(), lpt->head()->_idx, lpt->tail()->_idx,
+                        unique_loop_exit->_idx,
+                        loop->head()->Name(), loop->head()->_idx, loop->tail()->_idx);
+        }
+#endif // !PRODUCT
+      }
+    }
+  }
+
+  // Populate RFs outside loops.
+  while (worklist.is_nonempty()) {
+    LoopExit p = worklist.pop();
+    Node* referent = p.first;
+    Node* ctrl_out = p.second;
+    insert_rf(ctrl_out, referent);
+  }
+
+  // Eliminate redundant RFs.
+  bool progress = (redundant_rfs.size() > 0);
+  while (redundant_rfs.size() > 0) {
+    remove_rf(redundant_rfs.pop()->as_ReachabilityFence());
+  }
+
+  return progress;
+}
+
+//======================================================================
+//---------------------------- Phase 2 ---------------------------------
+
+// Linearly traverse CFG upwards starting at ctrl_start until first merge point.
+// All encountered safepoints are recorded in safepoints list, except
+// the ones filtered out by is_interfering_sfpt_candidate().
+static void enumerate_interfering_sfpts_linear_traversal(Node* ctrl_start, Node_Stack& stack, VectorSet& visited,
+                                                         Node_List& interfering_sfpts) {
+  for (Node* ctrl = ctrl_start; ctrl != nullptr; ctrl = ctrl->in(0)) {
+    assert(ctrl->is_CFG(), "");
+    if (visited.test_set(ctrl->_idx)) {
+      return;
+    } else {
+      if (ctrl->is_Region()) {
+        stack.push(ctrl, 1);
+        return; // stop at merge points
+      } else if (ctrl->is_SafePoint() && is_interfering_sfpt_candidate(ctrl->as_SafePoint())) {
+        assert(!ctrl->is_CallStaticJava() || !ctrl->as_CallStaticJava()->is_uncommon_trap(),
+               "uncommon traps should not be enumerated");
+        interfering_sfpts.push(ctrl);
+      }
+    }
+  }
+}
+
+// Enumerate all safepoints which are reachable from the RF to its referent through CFG.
+// Start at RF node and traverse CFG upwards until referent's control node is reached.
+static void enumerate_interfering_sfpts(ReachabilityFenceNode* rf, PhaseIdealLoop* phase,
+                                        Node_Stack& stack, VectorSet& visited,
+                                        Node_List& interfering_sfpts) {
+  assert(stack.is_empty(), "required");
+  assert(visited.is_empty(), "required");
+
+  Node* referent = rf->referent();
+  Node* referent_ctrl = phase->get_ctrl(referent);
+  assert(phase->is_dominator(referent_ctrl, rf), "sanity");
+
+  visited.set(referent_ctrl->_idx); // end point
+  enumerate_interfering_sfpts_linear_traversal(rf, stack, visited, interfering_sfpts); // starting point in CFG
+  while (stack.is_nonempty()) {
+    Node* cur = stack.node();
+    uint  idx = stack.index();
+
+    assert(cur != nullptr, "");
+    assert(cur->is_Region(), "%s", NodeClassNames[cur->Opcode()]);
+    assert(phase->is_dominator(referent_ctrl, cur), "");
+    assert(idx > 0 && idx <= cur->req(), "%d %d", idx, cur->req());
+
+    if (idx < cur->req()) {
+      stack.set_index(idx + 1);
+      enumerate_interfering_sfpts_linear_traversal(cur->in(idx), stack, visited, interfering_sfpts);
+    } else {
+      stack.pop();
+    }
+  }
+  // Reset temporary structures to their initial state.
+  assert(stack.is_empty(), "required");
+  visited.clear();
+}
+
+// Start offset for reachability info on a safepoint node.
+static uint rf_base_offset(SafePointNode* sfpt) {
+  return sfpt->jvms()->debug_end();
+}
+
+static bool dominates_another_rf(ReachabilityFenceNode* rf, PhaseIdealLoop* phase) {
+  assert(!rf->is_redundant(phase->igvn()), "");
+
+  for (int i = 0; i < phase->C->reachability_fences_count(); i++) {
+    ReachabilityFenceNode* other_rf = phase->C->reachability_fence(i);
+    assert(other_rf->outcnt() > 0, "dead node");
+    if (rf != other_rf && rf->referent()->eqv_uncast(other_rf->referent()) &&
+        phase->is_dominator(rf, other_rf)) {
+      return true; // dominates another reachability fence with the same referent
+    }
+  }
+  return false;
+}
+
+// Phase 2: migrate reachability info to safepoints.
+// All RFs are replaced with edges from corresponding referents to interfering safepoints.
+// Interfering safepoints are safepoint nodes which are reachable from the RF to its referent through CFG.
+bool PhaseIdealLoop::expand_reachability_fences() {
+  Compile::TracePhase tp(_t_reachability_expand);
+
+  assert(OptimizeReachabilityFences, "required");
+  assert(C->post_loop_opts_phase(), "required");
+  DEBUG_ONLY( int no_of_constant_rfs = 0; )
+
+  ResourceMark rm;
+  Unique_Node_List for_removal;
+  typedef Pair<SafePointNode*,Node*> ReachabilityEdge;
+  GrowableArray<ReachabilityEdge> reachability_edges;
+  {
+    // Reuse temporary structures to avoid allocating them for every single RF node.
+    Node_List sfpt_worklist;
+    Node_Stack stack(0);
+    VectorSet visited;
+
+    for (int i = 0; i < C->reachability_fences_count(); i++) {
+      ReachabilityFenceNode* rf = C->reachability_fence(i);
+      assert(!rf->is_redundant(igvn()), "missed");
+      if (PreserveReachabilityFencesOnConstants) {
+        const Type* referent_t = igvn().type(rf->referent());
+        assert(referent_t != TypePtr::NULL_PTR, "redundant rf");
+        bool is_constant_rf = referent_t->singleton();
+        if (is_constant_rf) {
+          DEBUG_ONLY( no_of_constant_rfs += 1; )
+          continue; // leave RFs on constants intact
+        }
+      }
+      if (dominates_another_rf(rf, this)) {
+        // Redundant fence: dominates another RF with the same referent.
+        // RF is redundant for some referent oop when the referent has another RF which
+        // keeps it alive across the RF. In terms of dominance relation it can be formulated
+        // as "a referent has another RF which is dominated by the redundant RF".
+        //
+        // NB! It is safe to assume that dominating RF is redundant only during expansion.
+        // Otherwise, there's a chance for the superseding RF node to go away before expansion.
+        // Non-RF users are ignored for a similar reason: they can go away before or after expansion
+        // takes place, so no guarantees reachability information is preserved.
+      } else {
+        assert(sfpt_worklist.size() == 0, "not empty");
+        enumerate_interfering_sfpts(rf, this, stack, visited, sfpt_worklist);
+
+        Node* referent = rf->referent();
+        while (sfpt_worklist.size() > 0) {
+          SafePointNode* sfpt = sfpt_worklist.pop()->as_SafePoint();
+          assert(is_dominator(get_ctrl(referent), sfpt), "");
+          assert(sfpt->req() == rf_base_offset(sfpt), "no extra edges allowed");
+          if (sfpt->find_edge(referent) == -1) {
+            ReachabilityEdge p(sfpt, referent);
+            reachability_edges.push(p);
+          }
+        }
+      }
+      for_removal.push(rf);
+    }
+  }
+  // Materialize reachability edges.
+  while (reachability_edges.length() > 0) {
+    ReachabilityEdge p = reachability_edges.pop();
+    SafePointNode* sfpt = p.first;
+    Node* referent = p.second;
+    if (sfpt->find_edge(referent) == -1) {
+      sfpt->add_req(referent);
+      igvn()._worklist.push(sfpt);
+    }
+  }
+  // Eliminate processed RFs. They become redundant once reachability edges are added.
+  bool progress = (for_removal.size() > 0);
+  while (for_removal.size() > 0) {
+    remove_rf(for_removal.pop()->as_ReachabilityFence());
+  }
+
+  assert(C->reachability_fences_count() == no_of_constant_rfs, "");
+  return progress;
+}
+
+//======================================================================
+//---------------------------- Phase 3 ---------------------------------
+
+// Find a point in CFG right after safepoint node to insert reachability fence.
+static Node* sfpt_ctrl_out(SafePointNode* sfpt) {
+  if (sfpt->is_Call()) {
+    CallProjections callprojs;
+    sfpt->as_Call()->extract_projections(&callprojs,
+                                         false /*separate_io_proj*/,
+                                         false /*do_asserts*/,
+                                         true /*allow_handlers*/);
+    // Calls can have multiple control projections. However, reachability edge expansion
+    // happens during final graph reshaping which is performed very late in compilation pipeline.
+    // The assumption here is that the control path chosen for insertion can't go away.
+    // So, materializing a reachability fence on a single control path produced by a call
+    // is enough to keep the referent oop alive across the call.
+    if (callprojs.fallthrough_catchproj != nullptr) {
+      return callprojs.fallthrough_catchproj;
+    } else if (callprojs.catchall_catchproj != nullptr) {
+      return callprojs.catchall_catchproj; // rethrow stub
+    } else if (callprojs.fallthrough_proj != nullptr) {
+      return callprojs.fallthrough_proj; // no exceptions thrown
+    } else {
+      ShouldNotReachHere();
+    }
+  } else {
+    return sfpt;
+  }
+}
+
+// Phase 3: materialize reachability fences from reachability edges on safepoints.
+// Turn extra safepoint edges into reachability fences immediately following the safepoint.
+//
+// NB! As of now, a special care is needed to properly enumerate reachability edges because
+// there are other use cases for non-debug safepoint edges. expand_reachability_edges() runs
+// after macro expansion where runtime calls during array allocation are annotated with
+// valid_length_test_input as an extra edges. Until there's a mechanism to distinguish between
+// different types of non-debug edges, unrelated cases are filtered out explicitly and in ad-hoc manner.
+void Compile::expand_reachability_edges(Unique_Node_List& safepoints) {
+  for (uint i = 0; i < safepoints.size(); i++) {
+    SafePointNode* sfpt = safepoints.at(i)->as_SafePoint();
+
+    uint rf_offset = rf_base_offset(sfpt);
+    if (sfpt->jvms() != nullptr && sfpt->req() > rf_offset) {
+      assert(is_interfering_sfpt_candidate(sfpt), "");
+      Node* ctrl_out = sfpt_ctrl_out(sfpt);
+      Node* ctrl_end = ctrl_out->unique_ctrl_out();
+
+      Node* extra_edge = nullptr;
+      if (sfpt->is_Call()) {
+        address entry = sfpt->as_Call()->entry_point();
+        if (entry == OptoRuntime::new_array_Java() ||
+            entry == OptoRuntime::new_array_nozero_Java()) {
+          // valid_length_test_input is appended during macro expansion at the very end
+          int last_idx = sfpt->req() - 1;
+          extra_edge = sfpt->in(last_idx);
+          sfpt->del_req(last_idx);
+        }
+      }
+
+      while (sfpt->req() > rf_offset) {
+        int idx = sfpt->req() - 1;
+        Node* referent = sfpt->in(idx);
+        sfpt->del_req(idx);
+
+        Node* new_rf = new ReachabilityFenceNode(C, ctrl_out, referent);
+        ctrl_end->replace_edge(ctrl_out, new_rf);
+        ctrl_end = new_rf;
+      }
+
+      if (extra_edge != nullptr) {
+        sfpt->add_req(extra_edge); // Add valid_length_test_input edge back
+      }
+    }
+  }
+}
diff --git a/src/hotspot/share/opto/reachability.hpp b/src/hotspot/share/opto/reachability.hpp
new file mode 100644
index 00000000000..ba435c8484f
--- /dev/null
+++ b/src/hotspot/share/opto/reachability.hpp
@@ -0,0 +1,83 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ *
+ */
+#ifndef SHARE_OPTO_REACHABILITY_HPP
+#define SHARE_OPTO_REACHABILITY_HPP
+
+#include "opto/multnode.hpp"
+#include "opto/node.hpp"
+#include "opto/opcodes.hpp"
+#include "opto/type.hpp"
+
+//------------------------ReachabilityFenceNode--------------------------
+// Represents a Reachability Fence (RF) in the code.
+//
+// RF ensures that the given object (referent) remains strongly reachable regardless of
+// any optimizing transformations the virtual machine may perform that might otherwise
+// allow the object to become unreachable.
+
+// java.lang.ref.Reference::reachabilityFence calls are intrinsified into ReachabilityFence nodes.
+//
+// More details in reachability.cpp.
+class ReachabilityFenceNode : public Node {
+public:
+  ReachabilityFenceNode(Compile* C, Node* ctrl, Node* referent)
+      : Node(1) {
+    assert(referent->bottom_type()->isa_oopptr() ||
+           referent->bottom_type()->isa_narrowoop() != nullptr ||
+           referent->bottom_type() == TypePtr::NULL_PTR,
+           "%s", Type::str(referent->bottom_type()));
+    init_class_id(Class_ReachabilityFence);
+    init_req(TypeFunc::Control, ctrl);
+    add_req(referent);
+    C->add_reachability_fence(this);
+  }
+  virtual int  Opcode() const;
+  virtual bool is_CFG() const { return true; }
+  virtual uint hash() const { return NO_HASH; }  // CFG nodes do not hash
+  virtual bool depends_only_on_test() const { return false; };
+  virtual uint ideal_reg() const { return 0; } // not matched in the AD file
+  virtual const Type* bottom_type() const { return Type::CONTROL; }
+  virtual const RegMask& in_RegMask(uint idx) const {
+    // Fake input register mask for the referent: accepts all registers and all stack slots.
+    // This avoids redundant register moves around reachability fences.
+    return RegMask::ALL;
+  }
+  virtual const RegMask& out_RegMask() const {
+    return RegMask::EMPTY;
+  }
+
+  virtual Node* Ideal(PhaseGVN* phase, bool can_reshape);
+  virtual Node* Identity(PhaseGVN* phase);
+
+  Node* referent() const { return in(1); }
+  bool is_redundant(PhaseGVN& gvn);
+  bool clear_referent(PhaseIterGVN& phase);
+
+#ifndef PRODUCT
+  virtual void format(PhaseRegAlloc* ra, outputStream* st) const;
+  virtual void emit(C2_MacroAssembler* masm, PhaseRegAlloc* ra) const;
+#endif
+};
+
+#endif // SHARE_OPTO_REACHABILITY_HPP
diff --git a/src/java.base/share/classes/java/lang/ref/Reference.java b/src/java.base/share/classes/java/lang/ref/Reference.java
index 88bdb99dfd6..df46ffe6ca6 100644
--- a/src/java.base/share/classes/java/lang/ref/Reference.java
+++ b/src/java.base/share/classes/java/lang/ref/Reference.java
@@ -644,12 +644,9 @@ public abstract sealed class Reference<@jdk.internal.RequiresIdentity T>
      * {@code null}, this method has no effect.
      * @since 9
      */
-    @ForceInline
+    @IntrinsicCandidate
     public static void reachabilityFence(Object ref) {
-        // Does nothing. This method is annotated with @ForceInline to eliminate
-        // most of the overhead that using @DontInline would cause with the
-        // HotSpot JVM, when this fence is used in a wide variety of situations.
-        // HotSpot JVM retains the ref and does not GC it before a call to
-        // this method, because the JIT-compilers do not have GC-only safepoints.
+        // Does nothing. HotSpot JVM retains the ref and does not GC it before a call to this method.
+        // Using an intrinsic allows JIT-compilers to further optimize it while retaining the correct semantics.
     }
 }
diff --git a/test/hotspot/jtreg/compiler/c2/ReachabilityFenceFlagsTest.java b/test/hotspot/jtreg/compiler/c2/ReachabilityFenceFlagsTest.java
new file mode 100644
index 00000000000..4289794b278
--- /dev/null
+++ b/test/hotspot/jtreg/compiler/c2/ReachabilityFenceFlagsTest.java
@@ -0,0 +1,52 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+package compiler.c2;
+
+/*
+ * @test
+ * @bug 8290892
+ * @summary Test diagnostic modes for Reference.reachabilityFence support
+ *
+ * @requires vm.compiler2.enabled
+ *
+ * @run main/othervm -Xcomp -XX:-TieredCompilation -XX:+UnlockDiagnosticVMOptions
+ *                   -XX:+StressReachabilityFences -XX:-OptimizeReachabilityFences -XX:-PreserveReachabilityFencesOnConstants
+ *                     compiler.c2.ReachabilityFenceFlagsTest
+ *
+ * @run main/othervm -Xcomp -XX:-TieredCompilation -XX:+UnlockDiagnosticVMOptions
+ *                   -XX:+StressReachabilityFences -XX:-OptimizeReachabilityFences -XX:+PreserveReachabilityFencesOnConstants
+ *                     compiler.c2.ReachabilityFenceFlagsTest
+ *
+ * @run main/othervm -Xcomp -XX:-TieredCompilation -XX:+UnlockDiagnosticVMOptions
+ *                   -XX:+StressReachabilityFences -XX:+OptimizeReachabilityFences -XX:-PreserveReachabilityFencesOnConstants
+ *                     compiler.c2.ReachabilityFenceFlagsTest
+ *
+ * @run main/othervm -Xcomp -XX:-TieredCompilation -XX:+UnlockDiagnosticVMOptions
+ *                   -XX:+StressReachabilityFences -XX:+OptimizeReachabilityFences -XX:+PreserveReachabilityFencesOnConstants
+ *                     compiler.c2.ReachabilityFenceFlagsTest
+ */
+public class ReachabilityFenceFlagsTest {
+    public static void main(String[] args) throws Throwable {
+    }
+}
diff --git a/test/hotspot/jtreg/compiler/c2/ReachabilityFenceOnConstantTest.java b/test/hotspot/jtreg/compiler/c2/ReachabilityFenceOnConstantTest.java
new file mode 100644
index 00000000000..db8590865fb
--- /dev/null
+++ b/test/hotspot/jtreg/compiler/c2/ReachabilityFenceOnConstantTest.java
@@ -0,0 +1,117 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+package compiler.c2;
+
+import jdk.internal.misc.Unsafe;
+import jdk.internal.vm.annotation.Stable;
+
+import java.lang.ref.Cleaner;
+import java.lang.ref.Reference;
+
+/*
+ * @test
+ * @bug 8290892
+ * @summary Tests to ensure that reachabilityFence() correctly keeps objects from being collected prematurely.
+ * @modules java.base/jdk.internal.misc
+ *          java.base/jdk.internal.vm.annotation
+ * @run main/bootclasspath/othervm -Xbatch -XX:-TieredCompilation -XX:CompileCommand=quiet
+ *                                 -XX:CompileCommand=compileonly,*::test
+ *                                 -XX:+UnlockDiagnosticVMOptions -XX:+PreserveReachabilityFencesOnConstants
+ *                                 compiler.c2.ReachabilityFenceOnConstantTest
+ */
+public class ReachabilityFenceOnConstantTest {
+    static final Unsafe U = Unsafe.getUnsafe();
+
+    static final long BUFFER_SIZE = 1024;
+    static @Stable MyBuffer BUFFER = new MyBuffer();
+
+    static volatile boolean isCleaned = false;
+
+    static class MyBuffer {
+        final @Stable long address;
+        final @Stable long limit;
+
+        MyBuffer() {
+            final long adr = U.allocateMemory(BUFFER_SIZE);
+            U.setMemory(adr, BUFFER_SIZE, (byte)0);
+            address = adr;
+            limit = BUFFER_SIZE;
+            System.out.printf("Allocated memory (%d bytes): 0x%016x\n", BUFFER_SIZE, adr);
+            Cleaner.create().register(this, () -> {
+                System.out.printf("Freed memory (%d bytes): 0x%016x\n", BUFFER_SIZE, adr);
+                U.setMemory(adr, BUFFER_SIZE, (byte)-1); // clear
+                U.freeMemory(adr);
+                isCleaned = true;
+            });
+        }
+
+        byte getByte(long offset) {
+            return U.getByte(null, address + offset);
+        }
+    }
+
+    static int test() {
+        int acc = 0;
+        MyBuffer buf = BUFFER;
+        try {
+            for (long i = 0; i < buf.limit; i++) {
+                acc += buf.getByte(i);
+            }
+        } finally {
+            Reference.reachabilityFence(buf);
+        }
+        return acc;
+    }
+
+    static void runTest() {
+        for (int i = 0; i < 20_000; i++) {
+            if (test() != 0) {
+                throw new AssertionError("observed stale buffer: TestConstantOop::isCleaned=" + isCleaned);
+            }
+        }
+    }
+
+    public static void main(String[] args) throws NoSuchFieldException, IllegalAccessException {
+        runTest(); // run test() and constant fold accesses to BUFFER (and it's state) during JIT-compilation
+
+        BUFFER = null; // remove last strong root
+
+        // Ensure the instance is GCed.
+        while (!isCleaned) {
+            try {
+                System.gc();
+                Thread.sleep(100);
+            } catch (InterruptedException e) {
+                throw new RuntimeException(e);
+            }
+        }
+
+        try {
+            runTest(); // repeat to ensure stale BUFFER contents is not accessed
+        } catch (NullPointerException e) {
+            // expected; ignore
+        }
+        System.out.println("TEST PASSED");
+    }
+}
diff --git a/test/hotspot/jtreg/compiler/c2/ReachabilityFenceTest.java b/test/hotspot/jtreg/compiler/c2/ReachabilityFenceTest.java
new file mode 100644
index 00000000000..d0bce024696
--- /dev/null
+++ b/test/hotspot/jtreg/compiler/c2/ReachabilityFenceTest.java
@@ -0,0 +1,353 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+package compiler.c2;
+
+import java.lang.ref.Cleaner;
+import java.lang.ref.Reference;
+import java.util.Arrays;
+import java.util.concurrent.Callable;
+import java.util.concurrent.CountDownLatch;
+import jdk.internal.misc.Unsafe;
+
+import compiler.lib.ir_framework.*;
+
+/*
+ * @test
+ * @bug 8290892
+ * @summary Tests to ensure that reachabilityFence() correctly keeps objects from being collected prematurely.
+ * @modules java.base/jdk.internal.misc
+ * @library /test/lib /
+ * @run main/othervm -Xbatch compiler.c2.ReachabilityFenceTest
+ */
+public class ReachabilityFenceTest {
+    private static final int SIZE = 100;
+
+    static final boolean[] STATUS = new boolean[2];
+
+    interface MyBuffer {
+        byte get(int offset);
+    }
+    static class MyBufferOnHeap implements MyBuffer {
+
+        private static int current = 0;
+        private final static byte[][] payload = new byte[10][];
+
+        private final int id;
+
+        public MyBufferOnHeap() {
+            // Get a unique id, allocate memory, and save the address in the payload array.
+            id = current++;
+            payload[id] = new byte[SIZE];
+
+            // Initialize buffer
+            for (int i = 0; i < SIZE; ++i) {
+                put(i, (byte) 42);
+            }
+
+            // Register a cleaner to free the memory when the buffer is garbage collected.
+            int lid = id; // Capture current value
+            Cleaner.create().register(this, () -> { free(lid); });
+
+            System.out.println("Created new buffer of size = " + SIZE + " with id = " + id);
+        }
+
+        private static void free(int id) {
+            System.out.println("Freeing buffer with id = " + id);
+            for (int i = 0; i < SIZE; ++i) {
+                payload[id][i] = (byte)0;
+            }
+            payload[id] = null;
+
+            synchronized (STATUS) {
+                STATUS[0] = true;
+                STATUS.notifyAll();
+            }
+        }
+
+        public void put(int offset, byte b) {
+            payload[id][offset] = b;
+        }
+
+        public byte get(int offset) {
+            try {
+                return payload[id][offset];
+            } finally {
+                Reference.reachabilityFence(this);
+            }
+        }
+    }
+
+    static class MyBufferOffHeap implements MyBuffer {
+        private static Unsafe UNSAFE = Unsafe.getUnsafe();
+
+        private static int current = 0;
+        private static long payload[] = new long[10];
+
+        private final int id;
+
+        public MyBufferOffHeap() {
+            // Get a unique id, allocate memory, and save the address in the payload array.
+            id = current++;
+            payload[id] = UNSAFE.allocateMemory(SIZE);
+
+            // Initialize buffer
+            for (int i = 0; i < SIZE; ++i) {
+                put(i, (byte) 42);
+            }
+
+            // Register a cleaner to free the memory when the buffer is garbage collected
+            int lid = id; // Capture current value
+            Cleaner.create().register(this, () -> { free(lid); });
+
+            System.out.println("Created new buffer of size = " + SIZE + " with id = " + id);
+        }
+
+        private static void free(int id) {
+            System.out.println("Freeing buffer with id = " + id);
+            for (int i = 0; i < SIZE; ++i) {
+                UNSAFE.putByte(payload[id] + i, (byte)0);
+            }
+            // UNSAFE.freeMemory(payload[id]); // don't deallocate backing memory to avoid crashes
+            payload[id] = 0;
+
+            synchronized (STATUS) {
+                STATUS[1] = true;
+                STATUS.notifyAll();
+            }
+        }
+
+        public void put(int offset, byte b) {
+            UNSAFE.putByte(payload[id] + offset, b);
+        }
+
+        public byte get(int offset) {
+            try {
+                return UNSAFE.getByte(payload[id] + offset);
+            } finally {
+                Reference.reachabilityFence(this);
+            }
+        }
+    }
+
+    static MyBufferOffHeap bufferOff = new MyBufferOffHeap();
+    static MyBufferOnHeap bufferOn = new MyBufferOnHeap();
+
+    static long[] counters = new long[4];
+
+    @ForceInline
+    static boolean test(MyBuffer buf) {
+        if (buf == null) {
+            return false;
+        }
+        for (int i = 0; i < SIZE; i++) {
+            // The access is split into base address load (payload[id]), offset computation, and data load.
+            // While offset is loop-variant, payload[id] is not and can be hoisted.
+            // If bufferOff and payload[id] loads are hoisted outside outermost loop, it eliminates all usages of
+            // myBuffer oop inside the loop and bufferOff can be GCed at the safepoint on outermost loop back branch.
+            byte b = buf.get(i); // inlined
+            if (b != 42) {
+                String msg = "Unexpected value = " + b + ". Buffer was garbage collected before reachabilityFence was reached!";
+                throw new AssertionError(msg);
+            }
+        }
+        return true;
+    }
+
+    /* ===================================== Off-heap versions ===================================== */
+
+    @Test
+    @Arguments(values = {Argument.NUMBER_42})
+    @IR(counts = {IRNode.REACHABILITY_FENCE,   "1"}, phase = CompilePhase.AFTER_PARSING)
+    @IR(counts = {IRNode.REACHABILITY_FENCE, ">=1"}, phase = CompilePhase.AFTER_LOOP_OPTS)
+    @IR(counts = {IRNode.REACHABILITY_FENCE,   "0"}, phase = CompilePhase.EXPAND_REACHABILITY_FENCES)
+    @IR(counts = {IRNode.REACHABILITY_FENCE,   "1"}, phase = CompilePhase.FINAL_CODE)
+    static long testOffHeap1(int limit) {
+        for (long j = 0; j < limit; j++) {
+            MyBufferOffHeap myBuffer = bufferOff; // local
+            if (!test(myBuffer)) {
+                return j;
+            }
+            counters[0] = j;
+        } // safepoint on loop backedge does NOT contain myBuffer local as part of its JVM state
+        return limit;
+    }
+
+    @Test
+    @Arguments(values = {Argument.NUMBER_42})
+    @IR(counts = {IRNode.REACHABILITY_FENCE,   "2"}, phase = CompilePhase.AFTER_PARSING)
+    @IR(counts = {IRNode.REACHABILITY_FENCE, ">=2"}, phase = CompilePhase.AFTER_LOOP_OPTS)
+    @IR(counts = {IRNode.REACHABILITY_FENCE,   "0"}, phase = CompilePhase.EXPAND_REACHABILITY_FENCES)
+    @IR(counts = {IRNode.REACHABILITY_FENCE,   "1"}, phase = CompilePhase.FINAL_CODE)
+    // Both RF nodes share the same referent and there's a single safepoint on loop-back edge.
+    // That's the reason why there are 2 RF nodes after parsing, but 1 RF node at the end.
+    static long testOffHeap2(int limit) {
+        for (long j = 0; j < limit; j++) {
+            MyBufferOffHeap myBuffer = bufferOff; // local
+            try {
+                if (!test(myBuffer)) {
+                    return j;
+                }
+                counters[1] = j;
+            } finally {
+                Reference.reachabilityFence(myBuffer);
+            }
+        } // safepoint on loop-back edge does NOT contain myBuffer local as part of its JVM state
+        return limit;
+    }
+
+    /* ===================================== On-heap versions ===================================== */
+
+    @Test
+    @Arguments(values = {Argument.NUMBER_42})
+    @IR(counts = {IRNode.REACHABILITY_FENCE,   "1"}, phase = CompilePhase.AFTER_PARSING)
+    @IR(counts = {IRNode.REACHABILITY_FENCE, ">=1"}, phase = CompilePhase.AFTER_LOOP_OPTS)
+    @IR(counts = {IRNode.REACHABILITY_FENCE,   "0"}, phase = CompilePhase.EXPAND_REACHABILITY_FENCES)
+    @IR(counts = {IRNode.REACHABILITY_FENCE,   "1"}, phase = CompilePhase.FINAL_CODE)
+    static long testOnHeap1(int limit) {
+        for (long j = 0; j < limit; j++) {
+            MyBufferOnHeap myBuffer = bufferOn; // local
+            if (!test(myBuffer)) {
+                return j;
+            }
+            counters[2] = j;
+        } // safepoint on loop backedge does NOT contain myBuffer local as part of its JVM state
+        return limit;
+    }
+
+    @Test
+    @Arguments(values = {Argument.NUMBER_42})
+    @IR(counts = {IRNode.REACHABILITY_FENCE,   "2"}, phase = CompilePhase.AFTER_PARSING)
+    @IR(counts = {IRNode.REACHABILITY_FENCE, ">=2"}, phase = CompilePhase.AFTER_LOOP_OPTS)
+    @IR(counts = {IRNode.REACHABILITY_FENCE,   "0"}, phase = CompilePhase.EXPAND_REACHABILITY_FENCES)
+    @IR(counts = {IRNode.REACHABILITY_FENCE,   "1"}, phase = CompilePhase.FINAL_CODE)
+    static long testOnHeap2(int limit) {
+        for (long j = 0; j < limit; j++) {
+            MyBufferOnHeap myBuffer = bufferOn; // local
+            try {
+                if (!test(myBuffer)) {
+                    return j;
+                }
+                counters[3] = j;
+            } finally {
+                Reference.reachabilityFence(myBuffer);
+            }
+        } // safepoint on loop backedge does NOT contain myBuffer local as part of its JVM state
+        return limit;
+    }
+
+    /* ===================================== Helper methods ===================================== */
+
+    static void runJavaTestCases() throws Throwable {
+        // Warmup to trigger compilations.
+        for (int i = 0; i < 10_000; i++) {
+            testOffHeap1(10);
+            testOffHeap2(10);
+            testOnHeap1(10);
+            testOnHeap2(10);
+        }
+
+        @SuppressWarnings("unchecked")
+        Callable<Long>[] tasks = new Callable[] {
+                () -> testOffHeap1(100_000_000),
+                () -> testOffHeap2(100_000_000),
+                () -> testOnHeap1(100_000_000),
+                () -> testOnHeap2(100_000_000),
+        };
+        int taskCount = tasks.length;
+        CountDownLatch latch = new CountDownLatch(taskCount + 1);
+        final Thread[] workers = new Thread[taskCount];
+        final Throwable[] result = new Throwable[taskCount];
+
+        for (int i = 0; i < taskCount; i++) {
+            final int id = i;
+            workers[id] = new Thread(() -> {
+                latch.countDown(); // synchronize with main thread
+                try {
+                    System.out.printf("Computation thread #%d has started\n", id);
+                    long cnt = tasks[id].call();
+                    System.out.printf("#%d Finished after %d iterations\n", id, cnt);
+                } catch (Throwable e) {
+                    System.out.printf("#%d Finished with an exception %s\n", id, e);
+                    result[id] = e;
+                }
+            });
+        }
+
+        for (Thread worker : workers) {
+            worker.start();
+        }
+
+        latch.countDown(); // synchronize with worker threads
+
+        Thread.sleep(100); // let workers proceed
+
+        // Clear references to buffers and make sure it's garbage collected.
+        System.out.printf("Buffers set to null. Waiting for garbage collection. (counters = %s)\n", Arrays.toString(counters));
+        bufferOn = null;
+        bufferOff = null;
+
+        System.gc();
+
+        synchronized (STATUS) {
+            do {
+                if (STATUS[0] && STATUS[1]) {
+                    break;
+                } else {
+                    System.out.printf("Waiting for cleanup... (counters = %s)\n", Arrays.toString(counters));
+                    System.gc();
+                    STATUS.wait(100);
+                }
+            } while (true);
+        }
+
+        for (Thread worker : workers) {
+            worker.join();
+        }
+
+        System.out.printf("Results: %s\n", Arrays.deepToString(result));
+
+        for (Throwable e : result) {
+            if (e != null) {
+                throw e;
+            }
+        }
+    }
+
+    static void runIRTestCases() {
+        TestFramework framework = new TestFramework();
+        framework.addFlags("--add-exports", "java.base/jdk.internal.misc=ALL-UNNAMED");
+        framework.start();
+    }
+
+    public static void main(String[] args) throws Throwable {
+        try {
+            runIRTestCases();
+            runJavaTestCases();
+            System.out.println("TEST PASSED");
+        } catch (Throwable e) {
+            System.out.println("TEST FAILED");
+            throw e;
+        }
+    }
+}
diff --git a/test/hotspot/jtreg/compiler/c2/irTests/ReachabilityFenceTest.java b/test/hotspot/jtreg/compiler/c2/irTests/ReachabilityFenceTest.java
new file mode 100644
index 00000000000..7f4142c18d3
--- /dev/null
+++ b/test/hotspot/jtreg/compiler/c2/irTests/ReachabilityFenceTest.java
@@ -0,0 +1,125 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+package compiler.c2.irTests;
+
+import java.lang.ref.Cleaner;
+import java.lang.ref.Reference;
+
+import compiler.lib.ir_framework.*;
+import jdk.internal.misc.Unsafe;
+
+/*
+ * @test
+ * @bug 8290892
+ * @summary IR tests on reachability fence-related loop transformations.
+ * @modules java.base/jdk.internal.misc
+ * @library /test/lib /
+ * @run driver compiler.c2.irTests.ReachabilityFenceTest
+ */
+public class ReachabilityFenceTest {
+    private static int SIZE = 100;
+
+    /* ===================================== On-heap version ===================================== */
+
+    private static int[] a = new int[SIZE];
+    private static int[] b = new int[SIZE];
+    private static int[] c = new int[SIZE];
+
+    @Test
+    @IR(counts = {IRNode.REACHABILITY_FENCE, "3"}, phase = CompilePhase.AFTER_PARSING)
+    @IR(counts = {IRNode.REACHABILITY_FENCE, "3"}, phase = CompilePhase.AFTER_LOOP_OPTS)
+    @IR(counts = {IRNode.REACHABILITY_FENCE, "0"}, phase = CompilePhase.EXPAND_REACHABILITY_FENCES)
+    @IR(counts = {IRNode.REACHABILITY_FENCE, "3"}, phase = CompilePhase.FINAL_CODE)
+    static void testCountedLoopInt() {
+        for (int i = 0; i < a.length; i++) {
+            try {
+                c[i] = a[i] + b[i];
+            } finally {
+                Reference.reachabilityFence(a);
+                Reference.reachabilityFence(b);
+                Reference.reachabilityFence(c);
+            }
+        }
+    }
+
+    /* ===================================== Off-heap version ===================================== */
+
+    static class OffHeapBuffer  {
+        private static Unsafe UNSAFE = Unsafe.getUnsafe();
+
+        private final long payload;
+
+        public final long size;
+
+        OffHeapBuffer() {
+            size = SIZE;
+            payload = UNSAFE.allocateMemory(SIZE);
+
+            Cleaner.create().register(this, () -> {
+                UNSAFE.freeMemory(payload);
+            });
+        }
+
+        public void put(long offset, byte b) {
+            try {
+                UNSAFE.putByte(payload + offset, b);
+            } finally {
+                Reference.reachabilityFence(this);
+            }
+        }
+
+        public byte get(long offset) {
+            try {
+                return UNSAFE.getByte(payload + offset);
+            } finally {
+                Reference.reachabilityFence(this);
+            }
+        }
+    }
+
+    private static OffHeapBuffer bufA = new OffHeapBuffer();
+    private static OffHeapBuffer bufB = new OffHeapBuffer();
+    private static OffHeapBuffer bufC = new OffHeapBuffer();
+
+    @Test
+    @IR(counts = {IRNode.REACHABILITY_FENCE, "3"}, phase = CompilePhase.AFTER_PARSING)
+    @IR(counts = {IRNode.REACHABILITY_FENCE, "3"}, phase = CompilePhase.AFTER_LOOP_OPTS)
+    @IR(counts = {IRNode.REACHABILITY_FENCE, "0"}, phase = CompilePhase.EXPAND_REACHABILITY_FENCES)
+    @IR(counts = {IRNode.REACHABILITY_FENCE, "3"}, phase = CompilePhase.FINAL_CODE)
+    static void testCountedLoopLong() {
+        for (long i = 0; i < bufA.size; i++) {
+            byte a = bufA.get(i);     // +1 RF
+            byte b = bufB.get(i);     // +1 RF
+            bufC.put(i, (byte)(a+b)); // +1 RF
+        }
+    }
+
+    /* ============================================================================================ */
+
+    public static void main(String[] args) throws Throwable {
+        TestFramework framework = new TestFramework();
+        framework.addFlags("--add-exports", "java.base/jdk.internal.misc=ALL-UNNAMED");
+        framework.start();
+    }
+}
diff --git a/test/hotspot/jtreg/compiler/lib/ir_framework/CompilePhase.java b/test/hotspot/jtreg/compiler/lib/ir_framework/CompilePhase.java
index 1e3ba7c314e..43178f41185 100644
--- a/test/hotspot/jtreg/compiler/lib/ir_framework/CompilePhase.java
+++ b/test/hotspot/jtreg/compiler/lib/ir_framework/CompilePhase.java
@@ -114,6 +114,7 @@ public enum CompilePhase {
     PHASEIDEALLOOP1(                "PhaseIdealLoop 1"),
     PHASEIDEALLOOP2(                "PhaseIdealLoop 2"),
     PHASEIDEALLOOP3(                "PhaseIdealLoop 3"),
+    EXPAND_REACHABILITY_FENCES(     "Expand Reachability Fences"),
     AUTO_VECTORIZATION1_BEFORE_APPLY(                    "AutoVectorization 1, before Apply"),
     AUTO_VECTORIZATION3_AFTER_ADJUST_LIMIT(              "AutoVectorization 2, after Adjusting Pre-loop Limit"),
     AUTO_VECTORIZATION4_AFTER_SPECULATIVE_RUNTIME_CHECKS("AutoVectorization 3, after Adding Speculative Runtime Checks"),
diff --git a/test/hotspot/jtreg/compiler/lib/ir_framework/IRNode.java b/test/hotspot/jtreg/compiler/lib/ir_framework/IRNode.java
index 0e1accf8a50..3f742a0ce62 100644
--- a/test/hotspot/jtreg/compiler/lib/ir_framework/IRNode.java
+++ b/test/hotspot/jtreg/compiler/lib/ir_framework/IRNode.java
@@ -3130,6 +3130,11 @@ public class IRNode {
         fromBeforeRemoveUselessToFinalCode(BLACKHOLE, "Blackhole");
     }
 
+    public static final String REACHABILITY_FENCE = PREFIX + "REACHABILITY_FENCE" + POSTFIX;
+    static {
+        fromBeforeRemoveUselessToFinalCode(REACHABILITY_FENCE, "ReachabilityFence");
+    }
+
     public static final String SELECT_FROM_TWO_VECTOR_VB = VECTOR_PREFIX + "SELECT_FROM_TWO_VECTOR_VB" + POSTFIX;
     static {
         vectorNode(SELECT_FROM_TWO_VECTOR_VB, "SelectFromTwoVector", TYPE_BYTE);

From 531dad0cd7df3fa4e6a06d5727677f881a8d3721 Mon Sep 17 00:00:00 2001
From: Mark Powers <mpowers@openjdk.org>
Date: Mon, 13 Apr 2026 20:37:18 +0000
Subject: [PATCH 580/655] 8369917: LMS/HSS RFC 9858 Support

Reviewed-by: weijun
---
 .../sun/security/provider/DigestBase.java     |  19 +-
 .../classes/sun/security/provider/HSS.java    | 362 +++++++++++++-----
 .../classes/sun/security/provider/SHA2.java   |   3 +-
 .../classes/sun/security/provider/SHA3.java   |  24 +-
 .../classes/sun/security/util/KeyUtil.java    |   7 +-
 .../sun/security/provider/hss/TestHSS.java    | 135 +++++--
 6 files changed, 408 insertions(+), 142 deletions(-)

diff --git a/src/java.base/share/classes/sun/security/provider/DigestBase.java b/src/java.base/share/classes/sun/security/provider/DigestBase.java
index 2aaf0a2fac6..0bb15ef3efe 100644
--- a/src/java.base/share/classes/sun/security/provider/DigestBase.java
+++ b/src/java.base/share/classes/sun/security/provider/DigestBase.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -242,4 +242,21 @@ abstract class DigestBase extends MessageDigestSpi implements Cloneable {
         padding = new byte[136];
         padding[0] = (byte)0x80;
     }
+
+    /**
+     * Digest block-length bytes in a single operation.
+     * Subclasses are expected to override this method. It is intended
+     * for fixed-length short input where input includes padding bytes.
+     * @param input byte array to be digested
+     * @param inLen the length of the input
+     * @param output the output buffer
+     * @param outOffset the offset into output buffer where digest should be written
+     * @param outLen the length of the output buffer
+     * @throws UnsupportedOperationException if a subclass does not override this method
+     */
+    void implDigestFixedLengthPreprocessed (
+            byte[] input, int inLen, byte[] output, int outOffset, int outLen)
+            throws UnsupportedOperationException {
+        throw new UnsupportedOperationException("should not be here");
+    }
 }
diff --git a/src/java.base/share/classes/sun/security/provider/HSS.java b/src/java.base/share/classes/sun/security/provider/HSS.java
index c1cb5ed6a30..50afba7cab8 100644
--- a/src/java.base/share/classes/sun/security/provider/HSS.java
+++ b/src/java.base/share/classes/sun/security/provider/HSS.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2023, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2023, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -24,16 +24,22 @@
  */
 package sun.security.provider;
 
+import java.io.ByteArrayOutputStream;
+import java.io.InvalidObjectException;
+import java.io.Serial;
+import java.io.Serializable;
+import java.security.SecureRandom;
+import java.security.*;
+import java.security.spec.AlgorithmParameterSpec;
+import java.security.spec.InvalidKeySpecException;
+import java.security.spec.KeySpec;
+import java.security.spec.X509EncodedKeySpec;
+import java.util.Arrays;
+
 import sun.security.util.*;
 import sun.security.x509.AlgorithmId;
 import sun.security.x509.X509Key;
 
-import java.io.*;
-import java.security.*;
-import java.security.SecureRandom;
-import java.security.spec.*;
-import java.util.Arrays;
-
 /**
  * Implementation of the Hierarchical Signature System using the
  * Leighton-Micali Signatures (HSS/LMS) as described in RFC 8554 and
@@ -196,42 +202,94 @@ public final class HSS extends SignatureSpi {
 
     static class LMSUtils {
         static final int LMS_RESERVED = 0;
-        static final int LMS_SHA256_M32_H5 = 5;
-        static final int LMS_SHA256_M32_H10 = 6;
-        static final int LMS_SHA256_M32_H15 = 7;
-        static final int LMS_SHA256_M32_H20 = 8;
-        static final int LMS_SHA256_M32_H25 = 9;
+        static final int LMS_SHA256_M32_H5  = 0x05;
+        static final int LMS_SHA256_M32_H10 = 0x06;
+        static final int LMS_SHA256_M32_H15 = 0x07;
+        static final int LMS_SHA256_M32_H20 = 0x08;
+        static final int LMS_SHA256_M32_H25 = 0x09;
+        static final int LMS_SHA256_M24_H5  = 0x0a;
+        static final int LMS_SHA256_M24_H10 = 0x0b;
+        static final int LMS_SHA256_M24_H15 = 0x0c;
+        static final int LMS_SHA256_M24_H20 = 0x0d;
+        static final int LMS_SHA256_M24_H25 = 0x0e;
+        static final int LMS_SHAKE_M32_H5   = 0x0f;
+        static final int LMS_SHAKE_M32_H10  = 0x10;
+        static final int LMS_SHAKE_M32_H15  = 0x11;
+        static final int LMS_SHAKE_M32_H20  = 0x12;
+        static final int LMS_SHAKE_M32_H25  = 0x13;
+        static final int LMS_SHAKE_M24_H5   = 0x14;
+        static final int LMS_SHAKE_M24_H10  = 0x15;
+        static final int LMS_SHAKE_M24_H15  = 0x16;
+        static final int LMS_SHAKE_M24_H20  = 0x17;
+        static final int LMS_SHAKE_M24_H25  = 0x18;
 
         static String lmsType(int type) {
-            String typeStr;
-            switch (type) {
-                case LMS_RESERVED: typeStr = "LMS_RESERVED"; break;
-                case LMS_SHA256_M32_H5: typeStr = "LMS_SHA256_M32_H5"; break;
-                case LMS_SHA256_M32_H10: typeStr = "LMS_SHA256_M32_H10"; break;
-                case LMS_SHA256_M32_H15: typeStr = "LMS_SHA256_M32_H15"; break;
-                case LMS_SHA256_M32_H20: typeStr = "LMS_SHA256_M32_H20"; break;
-                case LMS_SHA256_M32_H25: typeStr = "LMS_SHA256_M32_H25"; break;
-                default: typeStr = "unrecognized";
-            }
+            String typeStr = switch (type) {
+                case LMS_RESERVED -> "LMS_RESERVED";
+                case LMS_SHA256_M32_H5  -> "LMS_SHA256_M32_H5";
+                case LMS_SHA256_M32_H10 -> "LMS_SHA256_M32_H10";
+                case LMS_SHA256_M32_H15 -> "LMS_SHA256_M32_H15";
+                case LMS_SHA256_M32_H20 -> "LMS_SHA256_M32_H20";
+                case LMS_SHA256_M32_H25 -> "LMS_SHA256_M32_H25";
+                case LMS_SHA256_M24_H5  -> "LMS_SHA256_M24_H5";
+                case LMS_SHA256_M24_H10 -> "LMS_SHA256_M24_H10";
+                case LMS_SHA256_M24_H15 -> "LMS_SHA256_M24_H15";
+                case LMS_SHA256_M24_H20 -> "LMS_SHA256_M24_H20";
+                case LMS_SHA256_M24_H25 -> "LMS_SHA256_M24_H25";
+                case LMS_SHAKE_M32_H5   -> "LMS_SHAKE_M32_H5";
+                case LMS_SHAKE_M32_H10  -> "LMS_SHAKE_M32_H10";
+                case LMS_SHAKE_M32_H15  -> "LMS_SHAKE_M32_H15";
+                case LMS_SHAKE_M32_H20  -> "LMS_SHAKE_M32_H20";
+                case LMS_SHAKE_M32_H25  -> "LMS_SHAKE_M32_H25";
+                case LMS_SHAKE_M24_H5   -> "LMS_SHAKE_M24_H5";
+                case LMS_SHAKE_M24_H10  -> "LMS_SHAKE_M24_H10";
+                case LMS_SHAKE_M24_H15  -> "LMS_SHAKE_M24_H15";
+                case LMS_SHAKE_M24_H20  -> "LMS_SHAKE_M24_H20";
+                case LMS_SHAKE_M24_H25  -> "LMS_SHAKE_M24_H25";
+                default -> "unrecognized";
+            };
             return typeStr;
         }
 
         static final int LMOTS_RESERVED = 0;
-        static final int LMOTS_SHA256_N32_W1 = 1;
-        static final int LMOTS_SHA256_N32_W2 = 2;
-        static final int LMOTS_SHA256_N32_W4 = 3;
-        static final int LMOTS_SHA256_N32_W8 = 4;
+        static final int LMOTS_SHA256_N32_W1 = 0x01;
+        static final int LMOTS_SHA256_N32_W2 = 0x02;
+        static final int LMOTS_SHA256_N32_W4 = 0x03;
+        static final int LMOTS_SHA256_N32_W8 = 0x04;
+        static final int LMOTS_SHA256_N24_W1 = 0x05;
+        static final int LMOTS_SHA256_N24_W2 = 0x06;
+        static final int LMOTS_SHA256_N24_W4 = 0x07;
+        static final int LMOTS_SHA256_N24_W8 = 0x08;
+        static final int LMOTS_SHAKE_N32_W1  = 0x09;
+        static final int LMOTS_SHAKE_N32_W2  = 0x0a;
+        static final int LMOTS_SHAKE_N32_W4  = 0x0b;
+        static final int LMOTS_SHAKE_N32_W8  = 0x0c;
+        static final int LMOTS_SHAKE_N24_W1  = 0x0d;
+        static final int LMOTS_SHAKE_N24_W2  = 0x0e;
+        static final int LMOTS_SHAKE_N24_W4  = 0x0f;
+        static final int LMOTS_SHAKE_N24_W8  = 0x10;
 
         static String lmotsType(int type) {
-            String typeStr;
-            switch (type) {
-                case LMOTS_RESERVED: typeStr = "LMOTS_RESERVED"; break;
-                case LMOTS_SHA256_N32_W1: typeStr = "LMOTS_SHA256_N32_W1"; break;
-                case LMOTS_SHA256_N32_W2: typeStr = "LMOTS_SHA256_N32_W2"; break;
-                case LMOTS_SHA256_N32_W4: typeStr = "LMOTS_SHA256_N32_W4"; break;
-                case LMOTS_SHA256_N32_W8: typeStr = "LMOTS_SHA256_N32_W8"; break;
-                default: typeStr = "unrecognized";
-            }
+            String typeStr = switch (type) {
+                case LMOTS_RESERVED -> "LMOTS_RESERVED";
+                case LMOTS_SHA256_N32_W1 -> "LMOTS_SHA256_N32_W1";
+                case LMOTS_SHA256_N32_W2 -> "LMOTS_SHA256_N32_W2";
+                case LMOTS_SHA256_N32_W4 -> "LMOTS_SHA256_N32_W4";
+                case LMOTS_SHA256_N32_W8 -> "LMOTS_SHA256_N32_W8";
+                case LMOTS_SHA256_N24_W1 -> "LMOTS_SHA256_N24_W1";
+                case LMOTS_SHA256_N24_W2 -> "LMOTS_SHA256_N24_W2";
+                case LMOTS_SHA256_N24_W4 -> "LMOTS_SHA256_N24_W4";
+                case LMOTS_SHA256_N24_W8 -> "LMOTS_SHA256_N24_W8";
+                case LMOTS_SHAKE_N32_W1  -> "LMOTS_SHAKE_N32_W1";
+                case LMOTS_SHAKE_N32_W2  -> "LMOTS_SHAKE_N32_W2";
+                case LMOTS_SHAKE_N32_W4  -> "LMOTS_SHAKE_N32_W4";
+                case LMOTS_SHAKE_N32_W8  -> "LMOTS_SHAKE_N32_W8";
+                case LMOTS_SHAKE_N24_W1  -> "LMOTS_SHAKE_N24_W1";
+                case LMOTS_SHAKE_N24_W2  -> "LMOTS_SHAKE_N24_W2";
+                case LMOTS_SHAKE_N24_W4  -> "LMOTS_SHAKE_N24_W4";
+                case LMOTS_SHAKE_N24_W8  -> "LMOTS_SHAKE_N24_W8";
+                default -> "unrecognized";
+            };
             return typeStr;
         }
 
@@ -352,53 +410,65 @@ public final class HSS extends SignatureSpi {
 
     static class LMSParams {
         final int m; // the number of bytes used from the hash output
-        final int hashAlg_m = 32; // output length of the LMS tree hash function
+        final int hashAlg_m; // output length of the LMS tree hash function
         final int h; // height of the LMS tree
         final int twoPowh;
         final String hashAlgStr;
 
-        LMSParams(int m, int h, String hashAlgStr) {
+        private LMSParams(int m, int h, String hashAlgStr, int hashAlg_m) {
             this.m = m;
             this.h = h;
             this.hashAlgStr = hashAlgStr;
+            this.hashAlg_m = hashAlg_m;
             twoPowh = 1 << h;
         }
 
         static LMSParams of(int type) {
-            int m;
-            int h;
-            String hashAlgStr;
-            switch (type) {
-                case LMSUtils.LMS_SHA256_M32_H5:
-                    m = 32;
-                    h = 5;
-                    hashAlgStr = "SHA-256";
-                    break;
-                case LMSUtils.LMS_SHA256_M32_H10:
-                    m = 32;
-                    h = 10;
-                    hashAlgStr = "SHA-256";
-                    break;
-                case LMSUtils.LMS_SHA256_M32_H15:
-                    m = 32;
-                    h = 15;
-                    hashAlgStr = "SHA-256";
-                    break;
-                case LMSUtils.LMS_SHA256_M32_H20:
-                    m = 32;
-                    h = 20;
-                    hashAlgStr = "SHA-256";
-                    break;
-                case LMSUtils.LMS_SHA256_M32_H25:
-                    m = 32;
-                    h = 25;
-                    hashAlgStr = "SHA-256";
-                    break;
-                default:
+            LMSParams params = switch (type) {
+                case LMSUtils.LMS_SHA256_M32_H5 ->
+                    new LMSParams(32, 5, "SHA-256", 32);
+                case LMSUtils.LMS_SHA256_M32_H10 ->
+                    new LMSParams(32, 10, "SHA-256", 32);
+                case LMSUtils.LMS_SHA256_M32_H15 ->
+                    new LMSParams(32, 15, "SHA-256", 32);
+                case LMSUtils.LMS_SHA256_M32_H20 ->
+                    new LMSParams(32, 20, "SHA-256", 32);
+                case LMSUtils.LMS_SHA256_M32_H25 ->
+                    new LMSParams(32, 25, "SHA-256", 32);
+                case LMSUtils.LMS_SHA256_M24_H5 ->
+                    new LMSParams(24, 5, "SHA-256", 32);
+                case LMSUtils.LMS_SHA256_M24_H10 ->
+                    new LMSParams(24, 10, "SHA-256", 32);
+                case LMSUtils.LMS_SHA256_M24_H15 ->
+                    new LMSParams(24, 15, "SHA-256", 32);
+                case LMSUtils.LMS_SHA256_M24_H20 ->
+                    new LMSParams(24, 20, "SHA-256", 32);
+                case LMSUtils.LMS_SHA256_M24_H25 ->
+                    new LMSParams(24, 25, "SHA-256", 32);
+                case LMSUtils.LMS_SHAKE_M32_H5 ->
+                    new LMSParams(32, 5, "SHAKE256-512", 64);
+                case LMSUtils.LMS_SHAKE_M32_H10 ->
+                    new LMSParams(32, 10, "SHAKE256-512", 64);
+                case LMSUtils.LMS_SHAKE_M32_H15 ->
+                    new LMSParams(32, 15, "SHAKE256-512", 64);
+                case LMSUtils.LMS_SHAKE_M32_H20 ->
+                    new LMSParams(32, 20, "SHAKE256-512", 64);
+                case LMSUtils.LMS_SHAKE_M32_H25 ->
+                    new LMSParams(32, 25, "SHAKE256-512", 64);
+                case LMSUtils.LMS_SHAKE_M24_H5 ->
+                    new LMSParams(24, 5, "SHAKE256-512", 64);
+                case LMSUtils.LMS_SHAKE_M24_H10 ->
+                    new LMSParams(24, 10, "SHAKE256-512", 64);
+                case LMSUtils.LMS_SHAKE_M24_H15 ->
+                    new LMSParams(24, 15, "SHAKE256-512", 64);
+                case LMSUtils.LMS_SHAKE_M24_H20 ->
+                    new LMSParams(24, 20, "SHAKE256-512", 64);
+                case LMSUtils.LMS_SHAKE_M24_H25 ->
+                    new LMSParams(24, 25, "SHAKE256-512", 64);
+                default ->
                     throw new IllegalArgumentException("Unsupported or bad LMS type");
-            }
-
-            return new LMSParams(m, h, hashAlgStr);
+            };
+            return params;
         }
 
         boolean hasSameHash(LMSParams other) {
@@ -495,7 +565,7 @@ public final class HSS extends SignatureSpi {
     static class LMOTSParams {
         final int lmotSigType;
         final int n; // the number of bytes used from the hash output
-        final int hashAlg_n = 32; // the output length of the hash function
+        int hashAlg_n; // the output length of the hash function
         final int w;
         final int twoPowWMinus1;
         final int ls;
@@ -511,6 +581,7 @@ public final class HSS extends SignatureSpi {
         // back into the buffer. This way, we avoid memory allocations and some
         // computations that would have to be done otherwise.
         final byte[] hashBuf;
+
         // Precomputed block for SHA256 when the message size is 55 bytes
         // (i.e. when SHA256 is used)
         private static final byte[] hashbufSha256_32 = {
@@ -523,10 +594,64 @@ public final class HSS extends SignatureSpi {
                 0, 0, 0, 0, 0, 0, 0, (byte) 0x80,
                 0, 0, 0, 0, 0, 0, 1, (byte) 0xb8
         };
+        // Precomputed block for SHA256 when the message size is 47 bytes
+        // (i.e. when SHA256-192 is used)
+        private static final byte[] hashbufSha256_24 = {
+                0, 0, 0, 0, 0, 0, 0, 0,
+                0, 0, 0, 0, 0, 0, 0, 0,
+                0, 0, 0, 0, 0, 0, 0, 0,
+                0, 0, 0, 0, 0, 0, 0, 0,
+                0, 0, 0, 0, 0, 0, 0, 0,
+                0, 0, 0, 0, 0, 0, 0, (byte) 0x80,
+                0, 0, 0, 0, 0, 0, 0, 0,
+                0, 0, 0, 0, 0, 0, 1, 0x78
+        };
+        // Precomputed block for SHAKE256 when the message size is 55 bytes
+        // (i.e. when SHAKE256 is used)
+        private static final byte[] hashbufShake256_32 = {
+                0, 0, 0, 0, 0, 0, 0, 0,
+                0, 0, 0, 0, 0, 0, 0, 0,
+                0, 0, 0, 0, 0, 0, 0, 0,
+                0, 0, 0, 0, 0, 0, 0, 0,
+                0, 0, 0, 0, 0, 0, 0, 0,
+                0, 0, 0, 0, 0, 0, 0, 0,
+                0, 0, 0, 0, 0, 0, 0, (byte) 0x1F,
+                0, 0, 0, 0, 0, 0, 0, 0,
+                0, 0, 0, 0, 0, 0, 0, 0,
+                0, 0, 0, 0, 0, 0, 0, 0,
+                0, 0, 0, 0, 0, 0, 0, 0,
+                0, 0, 0, 0, 0, 0, 0, 0,
+                0, 0, 0, 0, 0, 0, 0, 0,
+                0, 0, 0, 0, 0, 0, 0, 0,
+                0, 0, 0, 0, 0, 0, 0, 0,
+                0, 0, 0, 0, 0, 0, 0, 0,
+                0, 0, 0, 0, 0, 0, 0, (byte) 0x80
+        };
+        // Precomputed block for SHAKE256 when the message size is 47 bytes
+        // (i.e. when SHAKE256-192 is used)
+        private static final byte[] hashbufShake256_24 = {
+                0, 0, 0, 0, 0, 0, 0, 0,
+                0, 0, 0, 0, 0, 0, 0, 0,
+                0, 0, 0, 0, 0, 0, 0, 0,
+                0, 0, 0, 0, 0, 0, 0, 0,
+                0, 0, 0, 0, 0, 0, 0, 0,
+                0, 0, 0, 0, 0, 0, 0, (byte) 0x1F,
+                0, 0, 0, 0, 0, 0, 0, 0,
+                0, 0, 0, 0, 0, 0, 0, 0,
+                0, 0, 0, 0, 0, 0, 0, 0,
+                0, 0, 0, 0, 0, 0, 0, 0,
+                0, 0, 0, 0, 0, 0, 0, 0,
+                0, 0, 0, 0, 0, 0, 0, 0,
+                0, 0, 0, 0, 0, 0, 0, 0,
+                0, 0, 0, 0, 0, 0, 0, 0,
+                0, 0, 0, 0, 0, 0, 0, 0,
+                0, 0, 0, 0, 0, 0, 0, 0,
+                0, 0, 0, 0, 0, 0, 0, (byte) 0x80
+        };
 
         private LMOTSParams(
                 int lmotSigType, int hLen, int w,
-                int ls, int p, String hashAlgName) {
+                int ls, int p, String hashAlgName, int hashAlg_n) {
             this.lmotSigType = lmotSigType;
             this.n = hLen;
             this.w = w;
@@ -534,32 +659,60 @@ public final class HSS extends SignatureSpi {
             this.p = p;
             twoPowWMinus1 = (1 << w) - 1;
             this.hashAlgName = hashAlgName;
-            hashBuf = hashbufSha256_32;
+            this.hashAlg_n = hashAlg_n;
+            hashBuf = switch (hashAlgName) {
+                case "SHAKE256-512" -> {
+                    yield this.n == 24 ?
+                            hashbufShake256_24 : hashbufShake256_32;
+                }
+                case "SHA-256" -> {
+                    yield this.n == 24 ?
+                            hashbufSha256_24 : hashbufSha256_32;
+                }
+                default ->
+                    throw new IllegalArgumentException(
+                            "Unknown hash algorithm "+hashAlgName);
+            };
         }
 
         static LMOTSParams of(int lmotsType) {
-            LMOTSParams params;
-            switch (lmotsType) {
-                case LMSUtils.LMOTS_SHA256_N32_W1:
-                    params = new LMOTSParams(
-                            lmotsType, 32, 1, 7, 265, "SHA-256");
-                    break;
-                case LMSUtils.LMOTS_SHA256_N32_W2:
-                    params = new LMOTSParams(
-                            lmotsType, 32, 2, 6, 133, "SHA-256");
-                    break;
-                case LMSUtils.LMOTS_SHA256_N32_W4:
-                    params = new LMOTSParams(
-                            lmotsType, 32, 4, 4, 67, "SHA-256");
-                    break;
-                case LMSUtils.LMOTS_SHA256_N32_W8:
-                    params = new LMOTSParams(
-                            lmotsType, 32, 8, 0, 34, "SHA-256");
-                    break;
-                default:
+            LMOTSParams params = switch (lmotsType) {
+                case LMSUtils.LMOTS_SHA256_N32_W1 ->
+                    new LMOTSParams(lmotsType, 32, 1, 7, 265, "SHA-256", 32);
+                case LMSUtils.LMOTS_SHA256_N32_W2 ->
+                    new LMOTSParams(lmotsType, 32, 2, 6, 133, "SHA-256", 32);
+                case LMSUtils.LMOTS_SHA256_N32_W4 ->
+                    new LMOTSParams(lmotsType, 32, 4, 4, 67, "SHA-256", 32);
+                case LMSUtils.LMOTS_SHA256_N32_W8 ->
+                    new LMOTSParams(lmotsType, 32, 8, 0, 34, "SHA-256", 32);
+                case LMSUtils.LMOTS_SHA256_N24_W1 ->
+                    new LMOTSParams(lmotsType, 24, 1, 8, 200, "SHA-256", 32);
+                case LMSUtils.LMOTS_SHA256_N24_W2 ->
+                    new LMOTSParams(lmotsType, 24, 2, 6, 101, "SHA-256", 32);
+                case LMSUtils.LMOTS_SHA256_N24_W4 ->
+                    new LMOTSParams(lmotsType, 24, 4, 4, 51, "SHA-256", 32);
+                case LMSUtils.LMOTS_SHA256_N24_W8 ->
+                    new LMOTSParams(lmotsType, 24, 8, 0, 26, "SHA-256", 32);
+                case LMSUtils.LMOTS_SHAKE_N32_W1 ->
+                    new LMOTSParams(lmotsType, 32, 1, 7, 265, "SHAKE256-512", 64);
+                case LMSUtils.LMOTS_SHAKE_N32_W2 ->
+                    new LMOTSParams(lmotsType, 32, 2, 6, 133, "SHAKE256-512", 64);
+                case LMSUtils.LMOTS_SHAKE_N32_W4 ->
+                    new LMOTSParams(lmotsType, 32, 4, 4, 67, "SHAKE256-512", 64);
+                case LMSUtils.LMOTS_SHAKE_N32_W8 ->
+                    new LMOTSParams(lmotsType, 32, 8, 0, 34, "SHAKE256-512", 64);
+                case LMSUtils.LMOTS_SHAKE_N24_W1 ->
+                    new LMOTSParams(lmotsType, 24, 1, 8, 200, "SHAKE256-512", 64);
+                case LMSUtils.LMOTS_SHAKE_N24_W2 ->
+                    new LMOTSParams(lmotsType, 24, 2, 6, 101, "SHAKE256-512", 64);
+                case LMSUtils.LMOTS_SHAKE_N24_W4 ->
+                    new LMOTSParams(lmotsType, 24, 4, 4, 51, "SHAKE256-512", 64);
+                case LMSUtils.LMOTS_SHAKE_N24_W8 ->
+                    new LMOTSParams(lmotsType, 24, 8, 0, 26, "SHAKE256-512", 64);
+                default ->
                     throw new IllegalArgumentException(
                             "Unsupported or bad OTS Algorithm Identifier.");
-            }
+            };
             return params;
         }
 
@@ -580,13 +733,6 @@ public final class HSS extends SignatureSpi {
             S[len + 1] = (byte) (sum & 0xff);
         }
 
-        void digestFixedLengthPreprocessed(
-                SHA2.SHA256 sha256, byte[] input, int inLen,
-                byte[] output, int outOffset, int outLen) {
-            sha256.implDigestFixedLengthPreprocessed(
-                    input, inLen, output, outOffset, outLen);
-        }
-
         byte[] lmotsPubKeyCandidate(
                 LMSignature lmSig, byte[] message, LMSPublicKey pKey)
                 throws SignatureException {
@@ -625,7 +771,13 @@ public final class HSS extends SignatureSpi {
 
                 byte[] preZi = hashBuf.clone();
                 int hashLen = hashBuf.length;
-                SHA2.SHA256 sha256 = new SHA2.SHA256();
+
+                DigestBase db;
+                if (hashAlgName.startsWith("SHAKE")) {
+                    db = new SHA3.SHAKE256Hash();
+                } else {
+                    db = new SHA2.SHA256();
+                }
                 pKey.getI(preZi, 0);
                 lmSig.getQArr(preZi, 16);
 
@@ -643,11 +795,11 @@ public final class HSS extends SignatureSpi {
                     for (int j = a; j < twoPowWMinus1; j++) {
                         preZi[22] = (byte) j;
                         if (j < twoPowWMinus2) {
-                            digestFixedLengthPreprocessed(
-                                    sha256, preZi, hashLen, preZi, 23, n);
+                            db.implDigestFixedLengthPreprocessed(preZi,
+                                    hashLen, preZi, 23, n);
                         } else {
-                            digestFixedLengthPreprocessed(
-                                    sha256, preZi, hashLen, preCandidate, 22 + i * n, n);
+                            db.implDigestFixedLengthPreprocessed(preZi,
+                                    hashLen, preCandidate, 22 + i * n, n);
                         }
                     }
                 }
diff --git a/src/java.base/share/classes/sun/security/provider/SHA2.java b/src/java.base/share/classes/sun/security/provider/SHA2.java
index e966e6b77f8..7d8c2840de9 100644
--- a/src/java.base/share/classes/sun/security/provider/SHA2.java
+++ b/src/java.base/share/classes/sun/security/provider/SHA2.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2002, 2023, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2002, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -117,6 +117,7 @@ abstract class SHA2 extends DigestBase {
     }
 
 
+    @Override
     protected void implDigestFixedLengthPreprocessed(
             byte[] input, int inLen, byte[] output, int outOffset, int outLen) {
         implReset();
diff --git a/src/java.base/share/classes/sun/security/provider/SHA3.java b/src/java.base/share/classes/sun/security/provider/SHA3.java
index a096cac5f50..0578645c1cd 100644
--- a/src/java.base/share/classes/sun/security/provider/SHA3.java
+++ b/src/java.base/share/classes/sun/security/provider/SHA3.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2016, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2016, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -98,6 +98,15 @@ public abstract class SHA3 extends DigestBase {
         this.suffix = suffix;
     }
 
+    @Override
+    protected void implDigestFixedLengthPreprocessed(
+            byte[] input, int inLen, byte[] output, int outOffset, int outLen) {
+        implReset();
+
+        implCompress(input, 0);
+        implDigest0(output, outOffset, outLen);
+    }
+
     private void implCompressCheck(byte[] b, int ofs) {
         Objects.requireNonNull(b);
         Preconditions.checkIndex(ofs + blockSize - 1, b.length, Preconditions.AIOOBE_FORMATTER);
@@ -136,9 +145,6 @@ public abstract class SHA3 extends DigestBase {
      * DigestBase calls implReset() when necessary.
      */
     void implDigest(byte[] out, int ofs) {
-        // Moving this allocation to the block where it is used causes a little
-        // performance drop, that is why it is here.
-        byte[] byteState = new byte[8];
         if (engineGetDigestLength() == 0) {
             // This is an XOF, so the digest() call is illegal.
             throw new ProviderException("Calling digest() is not allowed in an XOF");
@@ -146,8 +152,12 @@ public abstract class SHA3 extends DigestBase {
 
         finishAbsorb();
 
+        implDigest0(out, ofs, engineGetDigestLength());
+    }
+
+    void implDigest0(byte[] out, int ofs, int outLen) {
         int availableBytes = blockSize;
-        int numBytes = engineGetDigestLength();
+        int numBytes = outLen;
 
         while (numBytes > availableBytes) {
             for (int i = 0; i < availableBytes / 8; i++) {
@@ -163,6 +173,10 @@ public abstract class SHA3 extends DigestBase {
             asLittleEndian.set(out, ofs, state[i]);
             ofs += 8;
         }
+
+        // Moving this allocation to the block where it is used causes a little
+        // performance drop, that is why it is here.
+        byte[] byteState = new byte[8];
         if (numBytes % 8 != 0) {
             asLittleEndian.set(byteState, 0, state[numLongs]);
             System.arraycopy(byteState, 0, out, ofs, numBytes % 8);
diff --git a/src/java.base/share/classes/sun/security/util/KeyUtil.java b/src/java.base/share/classes/sun/security/util/KeyUtil.java
index 942a91d61b8..e9dabdc5b06 100644
--- a/src/java.base/share/classes/sun/security/util/KeyUtil.java
+++ b/src/java.base/share/classes/sun/security/util/KeyUtil.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2012, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2012, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -444,15 +444,16 @@ public final class KeyUtil {
             // is the LMS public key for the top-level tree.
             // Section 5.3: LMS public key is u32str(type) || u32str(otstype) || I || T[1]
             // Section 8: type is the numeric identifier for an LMS specification.
-            // This RFC defines 5 SHA-256 based types, value from 5 to 9.
             if (rawKey.length < 8) {
                 throw new NoSuchAlgorithmException("Cannot decode public key");
             }
             int num = ((rawKey[4] & 0xff) << 24) + ((rawKey[5] & 0xff) << 16)
                     + ((rawKey[6] & 0xff) << 8) + (rawKey[7] & 0xff);
             return switch (num) {
-                // RFC 8554 only supports SHA_256 hash algorithm
+                // RFC 8554 only supports SHA_256 hash algorithms
                 case 5, 6, 7, 8, 9 -> AlgorithmId.SHA256_oid;
+                // RFC 9858 supports SHAKE_256 hash algorithms
+                case 15, 16, 17, 18, 19 -> AlgorithmId.SHAKE256_512_oid;
                 default -> throw new NoSuchAlgorithmException("Unknown LMS type: " + num);
             };
         } catch (IOException e) {
diff --git a/test/jdk/sun/security/provider/hss/TestHSS.java b/test/jdk/sun/security/provider/hss/TestHSS.java
index 8056855cc1a..48019d4e465 100644
--- a/test/jdk/sun/security/provider/hss/TestHSS.java
+++ b/test/jdk/sun/security/provider/hss/TestHSS.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2023, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2023, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,7 +23,7 @@
 
 /*
  * @test
- * @bug 8298127 8347596
+ * @bug 8298127 8347596 8369917
  * @library /test/lib
  * @summary tests for HSS/LMS provider
  * @modules java.base/sun.security.util
@@ -194,6 +194,8 @@ public class TestHSS {
     static TestCase[] TestCases = new TestCase[] {
         // Test Case #1
         // RFC 8554 Test Case 1
+        // LM_SHA256_M32_H5, LMOTS_SHA256_N32_W8
+        // LM_SHA256_M32_H5, LMOTS_SHA256_N32_W8
         new TestCase(
             null, // exception
             true, // expected result
@@ -307,6 +309,8 @@ public class TestHSS {
 
         // Test Case #2
         // RFC 8554 Test Case 2
+        // LM_SHA256_M32_H10, LMOTS_SHA256_N32_W4
+        // LM_SHA256_M32_H5, LMOTS_SHA256_N32_W8
         new TestCase(
             null, // exception
             true, // expected result
@@ -456,11 +460,11 @@ public class TestHSS {
         ),
 
         // Test Case #3
-        // Additional Parameter sets for LMS Hash-Based Signatures (fluhrer)
-        // This test should fail because SHA256_M24 is supported.
+        // RFC 9858 A.1
+        // LMS_SHA256_M24_H5, LMOTS_SHA256_N24_W8
         new TestCase(
-            new InvalidKeySpecException(),
-            false, // expected result
+            null, // exception
+            true, // expected result
             decode("""
                 00000001
                 0000000a
@@ -502,11 +506,11 @@ public class TestHSS {
         ),
 
         // Test Case #4
-        // Additional Parameter sets for LMS Hash-Based Signatures (fluhrer)
-        // This test should fail because SHAKE is not supported.
+        // RFC 9858 A.2
+        // LMS_SHAKE_M24_H5, LMOTS_SHAKE_N24_W8
         new TestCase(
-            new InvalidKeySpecException(),
-            false, // expected result
+            null, // exception
+            true, // expected result
             decode("""
                 00000001
                 00000014
@@ -549,11 +553,11 @@ public class TestHSS {
         ),
 
         // Test Case #5
-        // Additional Parameter sets for LMS Hash-Based Signatures (fluhrer)
-        // This test should fail because SHAKE is not supported.
+        // RFC 9858 A.3
+        // LMS_SHAKE_M32_H5, LMOTS_SHAKE_N32_W8
         new TestCase(
-            new InvalidKeySpecException(),
-            false, // expected result
+            null, // exception
+            true, // expected result
             decode("""
                 00000001
                 0000000f
@@ -611,6 +615,83 @@ public class TestHSS {
         ),
 
         // Test Case #6
+        // RFC 9858 A.4
+        // LMS_SHA256_M24_H20, LMOTS_SHA256_N24_W4
+        new TestCase(
+            null, // exception
+            true, // expected result
+            decode("""
+                00000001
+                0000000d
+                00000007
+                404142434445464748494a4b4c4d4e4f9c08a50d170406869892802ee4142fcd
+                eac990f110c2460c"""),
+            decode("""
+                54657374206d65737361676520666f72205348413235362f31393220773d34
+                """),
+            decode("""
+                00000000
+                00000064
+                00000007
+                853fa6e1a65fef076acd2485505b93be9aeb2641e3d3805c1887f26f4bcdb6ac
+                0337b76fa5d6603834287e010b20516f7c336df2134c0a981f1ec2bb7baee516
+                e91e67d3bd16c8d945a7f2be4fd84a604ae3743efc609ee0e69572e9c6d4a682
+                50e877b75d3cae63e9d5c15a32bb3cd17045f6b3e195284fdd1ee3cfbe18f1cb
+                d06ef3e7af34b1844d42dac453115a4507ed525cec120d054b403c61a7e5034f
+                ac4be6ef5412d194d4b6bbc0ae6cd3fe9993d583ee06f4030bc832efec24d1f7
+                13f5088731b91a98491fa3adf1b322bce26df24c8415e3a46bdfe07a6fd48e6d
+                951515758cd6434991098bf6949249fca338ec235871dd564998d07d9b1b1b8d
+                644e657fee8039da8fe195d129faddb12d543b86b0ab8cf6f26c121783f3b828
+                d03f793b42909272f688e4ef6d46e82bdd1a02b1ff86c3b79920b2e6f19faf75
+                c623242f1f2c549f84fb2f4c3ffead3120d97baea507467bb2da79f132bbe15b
+                596fdfcb70983107ebca2597de9d55bd83bcae5c28a85259dadb354859986e60
+                c8afa0b10bd08a8f9ed9b1ede3377075fe0ae36349f7d2ed7bfc9ece0d4cd697
+                2059329419feaf3b9a1045b6cfa4ae89b1cea8950aea4af870d1a3a3909ebc5a
+                3013d6deb927abc0f95093e83cb36a9c1d6f13add19268ac7a0371f8335b0952
+                a57fdb0141d55d937dd6ebb08fee8a5cf426ac97d54ee7aa17e6c57be5e62a52
+                a6b1b986730d3a3aad8a7d327ddf883e6bc7b636eb2a5c4f2a635ae5bada5418
+                d43dfedb69c0a0209334fac89d420d6ad5a2e1df95d26a1bfeb99a5e8455061b
+                fdf2d6e8394caf8a4be699b8afa38e524d4053330af478f85bf33d3ca3a35bc9
+                6987282bd513a8f6a52db9ba36aa90882b3bf573fa275449d8d49eb30bed2bb1
+                7a0ecc7d8a20807f2ea3dd37acd46c713cc2ac9d01a20a30d6832eef86a1e26d
+                1cad7761bf4130a6565572766026509deeddaf46b605452b218a4e137a7ce063
+                b546a35c52510f0ea2cac879192ec443e43b37c5ffa23da7a7fc254324a3de70
+                5c771794f10ea356e5a747e5146fd804a47719803c185b380e34b8dcc8269c2b
+                073d86b2307cf90c6c3ef9271f2d53df2579f0c4cfb632db37a9025965f70b46
+                16673228e98644be6576417b7a97f104350259e7f697408cdf8cf81a3e774162
+                6ccdb87ad8531264cb5ceb7c8c097cec505091a3ee3a826c54f78169abc2e7d0
+                a318dac10250ba940e51e79a3f572fb32bf442be6fd81267946e6387f9a8c705
+                d945c653f2684655e3fa6b9ee311d8a091bef9898292fa272fb8761f066c23d8
+                7aa10d67871cc5419c843b796855c51ad1272e9264acd2035a82b12c2ddbc85a
+                dfcd7c22366a36495349391dbf0001064b8f6b28365445d733e48f1b058a6cb3
+                e71bbb8df3e90406299894f4ca682943ceeba410b33b07716ffc18d6eab75f2d
+                6372f1133605fa3c3ed66f2d8f7c5abe59e87d4500965e347523d73cb356c144
+                827aaa22b1c72a15293c7400e02aaefcf36f68a8246900e6e6228e7ad19d1450
+                c23434f1e45043dc2b6db57f20d8f5b344d4162aa651333287cd8bf8fac41c78
+                d61fe2929209bfe2dc5a2f80205c043b22e540a29f0ea0a5ff529e55bf1dfe42
+                96fc4bb4ac2e875322ab115db479fe979d64f78409af4ec3ad3b758fff83af1b
+                9c48e90ca39366f426c2fb921df55c72786a9217723945a1ac1a66af7def4f8b
+                367001732cce0e5bac91ac9d603807f8bab105b46d315d4cb88feb1c8686884b
+                0000000d
+                13d1a8ef00c5811c15c4d774fdcf75155315aff53ebdff8fb6a54f12c165963d
+                d5690cc9842b0e2190afc5443497584c832155599d00aced84bb3b59170396f7
+                db4fa84aa8577f76cf9367d6e99d3d5be3555d7156b004f2002f505681b1ad22
+                9b9b46a666672aa8ee662c3a0456a9adda7a44fbaca46789577dcd36dc5cdff3
+                4b864d0a32492a0acbcaa6c011748f205b91ab2ab84f2333fb3e3b9acaecdac3
+                8b58aa5f32e718e225631ed6674cccb8c119acbd4992ab3130a6e912deec5983
+                5ab52fbc549430f8b403e4a2a51cc7f46fc143d365763aa1708fd25bcd657a79
+                0e54718d970906242a3b8a97dff18e91a44c4ba818a8dd2d242251265b023b82
+                6077eb740f6682e6c4ada2b85a67988d406132c2ad899099e44cfe610c3a5af7
+                0b406224411a59597e5dda0f31cd16c914b67e96141661f0074f43eb02273481
+                bc324ded26c64f2388559d8c8bd0ef8b34ca4afebfac2a689b4246c264241488
+                dcf922350dc44f7bc09d57dc1126291b2318810e0f44801c071e572fd032c780
+                f44c9503a4c03c37417dc96422ba0849c37956f9fd5d33ea4fcab84276effec6
+                52ca77d7d47ac93c633d99e0a236f03d5587d1990ffaef737fced1f5cdd8f373
+                844e9f316aad41a0b12302639f83a2d74c9fe30d305a942bc0c30352a5e44dfb
+                """)
+        ),
+
+        // Test Case #7
         // LMSigParameters.lms_sha256_m32_h15, LMOtsParameters.sha256_n32_w8
         new TestCase(
             null, // exception
@@ -713,7 +794,7 @@ public class TestHSS {
                 """)
         ),
 
-        // Test Case #7
+        // Test Case #8
         // LMSigParameters.lms_sha256_m32_h20, LMOtsParameters.sha256_n32_w8
         new TestCase(
             null, // exception
@@ -821,7 +902,7 @@ public class TestHSS {
                 """)
         ),
 
-        // Test Case #8
+        // Test Case #9
         // LMSigParameters.lms_sha256_m32_h15, LMOtsParameters.sha256_n32_w4
         new TestCase(
             null, // exception
@@ -957,7 +1038,7 @@ public class TestHSS {
                 """)
         ),
 
-        // Test Case #9
+        // Test Case #10
         // LMSigParameters.lms_sha256_m32_h20, LMOtsParameters.sha256_n32_w4
         new TestCase(
             null, // exception
@@ -1098,7 +1179,7 @@ public class TestHSS {
                 """)
         ),
 
-        // Test Case #10
+        // Test Case #11
         // LMSigParameters.lms_sha256_m32_h15, LMOtsParameters.sha256_n32_w4
         // LMSigParameters.lms_sha256_m32_h10, LMOtsParameters.sha256_n32_w4
         new TestCase(
@@ -1320,7 +1401,7 @@ public class TestHSS {
                 """)
         ),
 
-        // Test Case #11
+        // Test Case #12
         // LMSigParameters.lms_sha256_m32_h15, LMOtsParameters.sha256_n32_w4
         // LMSigParameters.lms_sha256_m32_h15, LMOtsParameters.sha256_n32_w4
         new TestCase(
@@ -1547,7 +1628,7 @@ public class TestHSS {
                 """)
         ),
 
-        // Test Case #12
+        // Test Case #13
         // LMSigParameters.lms_sha256_m32_h20, LMOtsParameters.sha256_n32_w4
         // LMSigParameters.lms_sha256_m32_h10, LMOtsParameters.sha256_n32_w4
         new TestCase(
@@ -1774,7 +1855,7 @@ public class TestHSS {
                 """)
         ),
 
-        // Test Case #13
+        // Test Case #14
         // LMSigParameters.lms_sha256_m32_h20, LMOtsParameters.sha256_n32_w4
         // LMSigParameters.lms_sha256_m32_h15, LMOtsParameters.sha256_n32_w4
         new TestCase(
@@ -2006,7 +2087,7 @@ public class TestHSS {
                 """)
         ),
 
-        // Test Case #14
+        // Test Case #15
         // LMS signature length is incorrect
         new TestCase(
             new SignatureException(),
@@ -2119,7 +2200,7 @@ public class TestHSS {
                 """)
         ),
 
-        // Test Case #15
+        // Test Case #16
         // HSS signature and public key have different tree heights
         new TestCase(
             new SignatureException(),
@@ -2232,7 +2313,7 @@ public class TestHSS {
                 """)
         ),
 
-        // Test Case #16
+        // Test Case #17
         // bad signature
         new TestCase(
             null,  // exception
@@ -2345,7 +2426,7 @@ public class TestHSS {
                 """)
         ),
 
-        // Test Case #17
+        // Test Case #18
         // Invalid key in HSS signature
         new TestCase(
             new SignatureException(),
@@ -2458,7 +2539,7 @@ public class TestHSS {
                 """)
         ),
 
-        // Test Case #18
+        // Test Case #19
         // LMS signature is too short
         new TestCase(
             new SignatureException(),
@@ -2485,7 +2566,7 @@ public class TestHSS {
                 965a25bfd37f196b9073f3d4a232feb6""")
         ),
 
-        // Test Case #19
+        // Test Case #20
         // bad signature
         new TestCase(
             null,  // exception

From 9d6a94ef6789f62ae47f0112e75dc446000e63f4 Mon Sep 17 00:00:00 2001
From: Mahendra Chhipa <mchhipa@openjdk.org>
Date: Mon, 13 Apr 2026 22:43:57 +0000
Subject: [PATCH 581/655] 8368091: Use JUnit Jupiter API in sun/net/ext,
 sun/net/www and sun/net/spi tests

Reviewed-by: dfuchs
---
 .../net/ext/ExtendedSocketOptionsTest.java    |  25 +--
 .../sun/net/spi/DefaultProxySelectorTest.java |  34 ++--
 test/jdk/sun/net/www/MessageHeaderTest.java   |  17 +-
 .../KeepAliveStreamCleanerTestDriver.java     |   4 +-
 .../www/http/KeepAliveStreamCleanerTest.java  |   6 +-
 .../RequestMethodEquality.java                |  29 +--
 .../protocol/file/DirPermissionDenied.java    |  19 +-
 .../protocol/http/HttpHeaderParserTest.java   | 166 +++++++++---------
 .../protocol/http/TestTransparentNTLM.java    |  40 ++---
 .../jar/MultiReleaseJarURLConnection.java     |  96 +++++-----
 test/jdk/sun/net/www/protocol/jrt/Basic.java  |  34 ++--
 11 files changed, 234 insertions(+), 236 deletions(-)

diff --git a/test/jdk/sun/net/ext/ExtendedSocketOptionsTest.java b/test/jdk/sun/net/ext/ExtendedSocketOptionsTest.java
index d42d780db9d..af9345953b8 100644
--- a/test/jdk/sun/net/ext/ExtendedSocketOptionsTest.java
+++ b/test/jdk/sun/net/ext/ExtendedSocketOptionsTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2021, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -21,8 +21,7 @@
  * questions.
  */
 
-import org.testng.Assert;
-import org.testng.annotations.Test;
+import org.junit.jupiter.api.Test;
 
 import java.util.ArrayList;
 import java.util.Collections;
@@ -33,6 +32,10 @@ import java.util.concurrent.ExecutorService;
 import java.util.concurrent.Executors;
 import java.util.concurrent.Future;
 
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertNotNull;
+import static org.junit.jupiter.api.Assertions.assertSame;
+
 /**
  * @test
  * @bug 8260366
@@ -40,11 +43,11 @@ import java.util.concurrent.Future;
  * jdk.net.ExtendedSocketOptions doesn't lead to a deadlock
  * @modules java.base/sun.net.ext:open
  *          jdk.net
- * @run testng/othervm ExtendedSocketOptionsTest
- * @run testng/othervm ExtendedSocketOptionsTest
- * @run testng/othervm ExtendedSocketOptionsTest
- * @run testng/othervm ExtendedSocketOptionsTest
- * @run testng/othervm ExtendedSocketOptionsTest
+ * @run junit/othervm ${test.main.class}
+ * @run junit/othervm ${test.main.class}
+ * @run junit/othervm ${test.main.class}
+ * @run junit/othervm ${test.main.class}
+ * @run junit/othervm ${test.main.class}
  */
 public class ExtendedSocketOptionsTest {
 
@@ -83,13 +86,13 @@ public class ExtendedSocketOptionsTest {
         // check that the sun.net.ext.ExtendedSocketOptions#getInstance() does indeed return
         // the registered instance
         final Object extSocketOptions = callSunNetExtSocketOptionsGetInstance();
-        Assert.assertNotNull(extSocketOptions, "sun.net.ext.ExtendedSocketOptions#getInstance()" +
+        assertNotNull(extSocketOptions, "sun.net.ext.ExtendedSocketOptions#getInstance()" +
                 " unexpectedly returned null");
         // now verify that each call to getInstance(), either in the tasks or here, returned the exact
         // same instance of ExtendedSocketOptions
-        Assert.assertEquals(2, GetInstanceTask.extendedSocketOptionsInstances.size());
+        assertEquals(2, GetInstanceTask.extendedSocketOptionsInstances.size());
         for (final Object inst : GetInstanceTask.extendedSocketOptionsInstances) {
-            Assert.assertSame(inst, extSocketOptions, "sun.net.ext.ExtendedSocketOptions#getInstance()" +
+            assertSame(extSocketOptions, inst, "sun.net.ext.ExtendedSocketOptions#getInstance()" +
                     " returned different instances");
         }
     }
diff --git a/test/jdk/sun/net/spi/DefaultProxySelectorTest.java b/test/jdk/sun/net/spi/DefaultProxySelectorTest.java
index 5fdff96f5f2..d070d843fee 100644
--- a/test/jdk/sun/net/spi/DefaultProxySelectorTest.java
+++ b/test/jdk/sun/net/spi/DefaultProxySelectorTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2019, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2019, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -21,18 +21,19 @@
  * questions.
  */
 
-import org.testng.Assert;
-import org.testng.annotations.Test;
+import org.junit.jupiter.api.Test;
 import sun.net.spi.DefaultProxySelector;
 
 import java.net.ProxySelector;
 import java.net.URI;
 
+import static org.junit.jupiter.api.Assertions.assertThrows;
+
 /**
  * @test
  * @bug 6563286 6797318 8177648
  * @summary Tests sun.net.spi.DefaultProxySelector#select(URI)
- * @run testng DefaultProxySelectorTest
+ * @run junit ${test.main.class}
  * @modules java.base/sun.net.spi:+open
  */
 public class DefaultProxySelectorTest {
@@ -44,12 +45,7 @@ public class DefaultProxySelectorTest {
     @Test
     public void testIllegalArgForNull() {
         final ProxySelector selector = new DefaultProxySelector();
-        try {
-            selector.select(null);
-            Assert.fail("select() was expected to fail for null URI");
-        } catch (IllegalArgumentException iae) {
-            // expected
-        }
+        assertThrows(IllegalArgumentException.class, () -> selector.select(null));
     }
 
     /**
@@ -61,12 +57,11 @@ public class DefaultProxySelectorTest {
     @Test
     public void testIllegalArgForNoHost() throws Exception {
         final ProxySelector selector = new DefaultProxySelector();
-        assertFailsWithIAE(selector, new URI("http", "/test", null));
-        assertFailsWithIAE(selector, new URI("https", "/test2", null));
-        assertFailsWithIAE(selector, new URI("ftp", "/test3", null));
+        assertThrows(IllegalArgumentException.class, () -> selector.select(new URI("http", "/test", null)));
+        assertThrows(IllegalArgumentException.class, () -> selector.select(new URI("https", "/test2", null)));
+        assertThrows(IllegalArgumentException.class, () -> selector.select(new URI("ftp", "/test3", null)));
     }
 
-
     /**
      * Tests that {@link DefaultProxySelector} throws a {@link IllegalArgumentException}
      * for URIs that don't have protocol/scheme information
@@ -76,15 +71,6 @@ public class DefaultProxySelectorTest {
     @Test
     public void testIllegalArgForNoScheme() throws Exception {
         final ProxySelector selector = new DefaultProxySelector();
-        assertFailsWithIAE(selector, new URI(null, "/test", null));
-    }
-
-    private static void assertFailsWithIAE(final ProxySelector selector, final URI uri) {
-        try {
-            selector.select(uri);
-            Assert.fail("select() was expected to fail for URI " + uri);
-        } catch (IllegalArgumentException iae) {
-            // expected
-        }
+        assertThrows(IllegalArgumentException.class, () -> selector.select(new URI(null, "/test", null)));
     }
 }
diff --git a/test/jdk/sun/net/www/MessageHeaderTest.java b/test/jdk/sun/net/www/MessageHeaderTest.java
index 903e805f5f4..6928173df67 100644
--- a/test/jdk/sun/net/www/MessageHeaderTest.java
+++ b/test/jdk/sun/net/www/MessageHeaderTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2012, 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2012, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,16 +25,17 @@
  * @test
  * @bug 8003948 8133686
  * @modules java.base/sun.net.www
- * @run testng MessageHeaderTest
+ * @run junit ${test.main.class}
  */
 
 import java.io.*;
 import java.util.*;
 
-import org.testng.Assert;
-import org.testng.annotations.Test;
+import org.junit.jupiter.api.Test;
 import sun.net.www.MessageHeader;
 
+import static org.junit.jupiter.api.Assertions.assertEquals;
+
 public class MessageHeaderTest {
     /* This test checks to see if the MessageHeader.getHeaders method
        returns headers with the same value field in the order they were added
@@ -53,12 +54,12 @@ public class MessageHeaderTest {
 
         var actualHeaders = testHeader.getHeaders().get("test");
 
-        Assert.assertEquals(expectedHeaders, actualHeaders, String.format(errorMessageTemplate, expectedHeaders.toString(), actualHeaders.toString()));
+        assertEquals(expectedHeaders, actualHeaders, String.format(errorMessageTemplate, expectedHeaders.toString(), actualHeaders.toString()));
     }
 
     @Test
     public void ntlmNegotiateTest () throws Exception {
-        String expected[] = {
+        String[] expected = {
             "{null: HTTP/1.1 200 Ok}{Foo: bar}{Bar: foo}{WWW-Authenticate: NTLM sdsds}",
             "{null: HTTP/1.1 200 Ok}{Foo: bar}{Bar: foo}{WWW-Authenticate: }",
             "{null: HTTP/1.1 200 Ok}{Foo: bar}{Bar: foo}{WWW-Authenticate: NTLM sdsds}",
@@ -90,8 +91,8 @@ public class MessageHeaderTest {
             boolean result = h.filterNTLMResponses("WWW-Authenticate");
             String after = h.toString();
             after = after.substring(after.indexOf('{'));
-            Assert.assertEquals(expected[i], after, i + " expected != after");
-            Assert.assertEquals(result, expectedResult[i], i + " result != expectedResult");
+            assertEquals(expected[i], after, i + " expected != after");
+            assertEquals(expectedResult[i], result, i + " result != expectedResult");
         }
     }
 }
diff --git a/test/jdk/sun/net/www/http/KeepAliveStreamCleaner/KeepAliveStreamCleanerTestDriver.java b/test/jdk/sun/net/www/http/KeepAliveStreamCleaner/KeepAliveStreamCleanerTestDriver.java
index 5f66aff365e..bf7553acf62 100644
--- a/test/jdk/sun/net/www/http/KeepAliveStreamCleaner/KeepAliveStreamCleanerTestDriver.java
+++ b/test/jdk/sun/net/www/http/KeepAliveStreamCleaner/KeepAliveStreamCleanerTestDriver.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2020, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -26,5 +26,5 @@
  * @bug 8255124
  * @summary Tests that KeepAliveStreamCleaner run does not throw an IllegalMonitorState Exception.
  * @modules java.base/sun.net.www.http
- * @run testng java.base/sun.net.www.http.KeepAliveStreamCleanerTest
+ * @run junit java.base/sun.net.www.http.KeepAliveStreamCleanerTest
  */
diff --git a/test/jdk/sun/net/www/http/KeepAliveStreamCleaner/java.base/sun/net/www/http/KeepAliveStreamCleanerTest.java b/test/jdk/sun/net/www/http/KeepAliveStreamCleaner/java.base/sun/net/www/http/KeepAliveStreamCleanerTest.java
index b4bc638099d..d927e0a8029 100644
--- a/test/jdk/sun/net/www/http/KeepAliveStreamCleaner/java.base/sun/net/www/http/KeepAliveStreamCleanerTest.java
+++ b/test/jdk/sun/net/www/http/KeepAliveStreamCleaner/java.base/sun/net/www/http/KeepAliveStreamCleanerTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2020, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,9 +23,9 @@
 
 package sun.net.www.http;
 
-import org.testng.annotations.Test;
 
-@Test
+import org.junit.jupiter.api.Test;
+
 public class KeepAliveStreamCleanerTest {
 
     /*
diff --git a/test/jdk/sun/net/www/http/RequestMethodCheck/RequestMethodEquality.java b/test/jdk/sun/net/www/http/RequestMethodCheck/RequestMethodEquality.java
index 290248989d8..364bafd0749 100644
--- a/test/jdk/sun/net/www/http/RequestMethodCheck/RequestMethodEquality.java
+++ b/test/jdk/sun/net/www/http/RequestMethodCheck/RequestMethodEquality.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2021, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -30,17 +30,16 @@
  * @modules java.base/sun.net.www.http
  *          java.base/sun.net.www.protocol.http
  * @build java.base/sun.net.www.http.HttpClientAccess
- * @run testng/othervm RequestMethodEquality
+ * @run junit/othervm ${test.main.class}
  */
 
 import com.sun.net.httpserver.HttpExchange;
 import com.sun.net.httpserver.HttpHandler;
 import com.sun.net.httpserver.HttpServer;
 import jdk.test.lib.net.URIBuilder;
-import org.testng.Assert;
-import org.testng.annotations.AfterTest;
-import org.testng.annotations.BeforeTest;
-import org.testng.annotations.Test;
+import org.junit.jupiter.api.AfterAll;
+import org.junit.jupiter.api.BeforeAll;
+import org.junit.jupiter.api.Test;
 import sun.net.www.http.HttpClient;
 import sun.net.www.http.HttpClientAccess;
 import sun.net.www.http.KeepAliveCache;
@@ -52,21 +51,23 @@ import java.net.InetSocketAddress;
 import java.net.Proxy;
 import java.net.URL;
 
+import static org.junit.jupiter.api.Assertions.assertNotEquals;
+
 public class RequestMethodEquality {
     private static final String TEST_CONTEXT = "/reqmethodtest";
-    private HttpServer server;
-    private CustomHandler handler;
-    private HttpClientAccess httpClientAccess;
+    private static HttpServer server;
+    private static CustomHandler handler;
+    private static HttpClientAccess httpClientAccess;
 
-    @BeforeTest
-    public void setup() throws Exception {
+    @BeforeAll
+    public static void setup() throws Exception {
         handler = new CustomHandler();
         server = createServer(handler);
         httpClientAccess = new HttpClientAccess();
     }
 
-    @AfterTest
-    public void tearDown() throws Exception {
+    @AfterAll
+    public static void tearDown() throws Exception {
         if (server != null) {
             server.stop(0);
         }
@@ -111,7 +112,7 @@ public class RequestMethodEquality {
 
             // If both connectTimeout values are equal, it means the test retrieved the same broken
             // HttpClient from the cache and is trying to re-use it.
-            Assert.assertNotEquals(originalConnectTimeout, cachedConnectTimeout, "Both connectTimeout values are equal.\nThis means the test is reusing a broken HttpClient rather than creating a new one.");
+            assertNotEquals(originalConnectTimeout, cachedConnectTimeout, "Both connectTimeout values are equal.\nThis means the test is reusing a broken HttpClient rather than creating a new one.");
         } finally {
             if (conn != null) {
                 conn.disconnect();
diff --git a/test/jdk/sun/net/www/protocol/file/DirPermissionDenied.java b/test/jdk/sun/net/www/protocol/file/DirPermissionDenied.java
index 0e3f9e86c4e..b6d8790bb5b 100644
--- a/test/jdk/sun/net/www/protocol/file/DirPermissionDenied.java
+++ b/test/jdk/sun/net/www/protocol/file/DirPermissionDenied.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2010, 2019, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2010, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -28,7 +28,7 @@
  * @library /test/lib
  * @build DirPermissionDenied jdk.test.lib.process.*
  *        jdk.test.lib.util.FileUtils
- * @run testng DirPermissionDenied
+ * @run junit ${test.main.class}
  */
 
 import java.io.IOException;
@@ -41,9 +41,10 @@ import java.nio.file.Paths;
 
 import jdk.test.lib.process.ProcessTools;
 import jdk.test.lib.util.FileUtils;
-import org.testng.annotations.AfterTest;
-import org.testng.annotations.Test;
-import org.testng.annotations.BeforeTest;
+import org.junit.jupiter.api.AfterAll;
+import org.junit.jupiter.api.BeforeAll;
+import org.junit.jupiter.api.Test;
+
 public class DirPermissionDenied {
     private static final Path TEST_DIR = Paths.get(
             "DirPermissionDeniedDirectory");
@@ -79,8 +80,8 @@ public class DirPermissionDenied {
         }
     }
 
-    @BeforeTest
-    public void setup() throws Throwable {
+    @BeforeAll
+    public static void setup() throws Throwable {
         // mkdir and chmod "333"
         Files.createDirectories(TEST_DIR);
         ProcessTools.executeCommand("chmod", "333", TEST_DIR.toString())
@@ -89,8 +90,8 @@ public class DirPermissionDenied {
                     .shouldHaveExitValue(0);
     }
 
-    @AfterTest
-    public void tearDown() throws Throwable {
+    @AfterAll
+    public static void tearDown() throws Throwable {
         // add read permission to ensure the dir removable
         ProcessTools.executeCommand("chmod", "733", TEST_DIR.toString())
                     .outputTo(System.out)
diff --git a/test/jdk/sun/net/www/protocol/http/HttpHeaderParserTest.java b/test/jdk/sun/net/www/protocol/http/HttpHeaderParserTest.java
index 245cd49d518..ad3b3fa3722 100644
--- a/test/jdk/sun/net/www/protocol/http/HttpHeaderParserTest.java
+++ b/test/jdk/sun/net/www/protocol/http/HttpHeaderParserTest.java
@@ -1,7 +1,7 @@
 
 
 /*
- * Copyright (c) 2022, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2022, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -28,13 +28,12 @@
  * @library /test/lib
  * @summary Sanity check that HttpHeaderParser works same as MessageHeader
  * @modules java.base/sun.net.www java.base/sun.net.www.protocol.http:open
- * @run testng/othervm HttpHeaderParserTest
+ * @run junit/othervm ${test.main.class}
  */
 
 import java.io.ByteArrayInputStream;
 import java.io.IOException;
 import java.util.ArrayList;
-import java.util.Arrays;
 import java.util.Collections;
 import java.util.HashMap;
 import java.util.List;
@@ -45,20 +44,21 @@ import java.util.concurrent.atomic.AtomicInteger;
 import static java.lang.String.format;
 import static java.nio.charset.StandardCharsets.ISO_8859_1;
 import static java.nio.charset.StandardCharsets.US_ASCII;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertThrows;
+import static org.junit.jupiter.api.Assertions.assertTrue;
+import static org.junit.jupiter.api.Assertions.fail;
+
 import jdk.test.lib.net.HttpHeaderParser;
-import static org.testng.Assert.assertEquals;
-import static org.testng.Assert.assertTrue;
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
 import sun.net.www.MessageHeader;
 
 public class HttpHeaderParserTest {
-    @DataProvider(name = "responses")
-    public Object[][] responses() {
+    public static List<String> responses() {
         List<String> responses = new ArrayList<>();
-
-        String[] basic =
-                { "HTTP/1.1 200 OK\r\n\r\n",
+        List<String> basic = List.of(
+                 "HTTP/1.1 200 OK\r\n\r\n",
 
                         "HTTP/1.1 200 OK\r\n" +
                                 "Date: Mon, 15 Jan 2001 12:18:21 GMT\r\n" +
@@ -142,11 +142,11 @@ public class HttpHeaderParserTest {
                                 "Vary: Host,Accept-Encoding,User-Agent\r\n" +
                                 "X-Mod-Pagespeed: 1.12.34.2-0\r\n" +
                                 "Connection: keep-alive\r\n\r\n"
-                };
-        Arrays.stream(basic).forEach(responses::add);
+        );
+        responses.addAll(basic);
         // add some tests where some of the CRLF are replaced
         // by a single LF
-        Arrays.stream(basic)
+        basic.stream()
                 .map(HttpHeaderParserTest::mixedCRLF)
                 .forEach(responses::add);
 
@@ -211,8 +211,8 @@ public class HttpHeaderParserTest {
                 responses.add(mixedCRLF(template).replace("$NEWLINE", newLineChar));
         }
 
-        String[] bad = // much of this is to retain parity with legacy MessageHeaders
-                { "HTTP/1.1 200 OK\r\n" +
+        List<String> bad = List.of( // much of this is to retain parity with legacy MessageHeaders
+                "HTTP/1.1 200 OK\r\n" +
                         "Connection:\r\n\r\n",   // empty value, no body
 
                         "HTTP/1.1 200 OK\r\n" +
@@ -258,12 +258,11 @@ public class HttpHeaderParserTest {
 
                         "HTTP/1.0 404 Not Found\r\n" +
                                 "header-without-colon\r\n\r\n" +
-                                "SOMEBODY",
+                                "SOMEBODY"
 
-                };
-        Arrays.stream(bad).forEach(responses::add);
-
-        return responses.stream().map(p -> new Object[] { p }).toArray(Object[][]::new);
+                );
+        responses.addAll(bad);
+        return responses;
     }
 
     static final AtomicInteger index = new AtomicInteger();
@@ -318,8 +317,8 @@ public class HttpHeaderParserTest {
         return res.toString();
     }
 
-
-    @Test(dataProvider = "responses")
+    @ParameterizedTest
+    @MethodSource("responses")
     public void verifyHeaders(String respString) throws Exception {
         System.out.println("\ntesting:\n\t" + respString
                 .replace("\r\n", "<CRLF>")
@@ -344,7 +343,7 @@ public class HttpHeaderParserTest {
         String statusLine1 = messageHeaderMap.get(null).get(0);
         String statusLine2 = decoder.getRequestDetails();
         if (statusLine1.startsWith("HTTP")) {// skip the case where MH's messes up the status-line
-            assertEquals(statusLine2, statusLine1, "Status-line not equal");
+            assertEquals(statusLine1, statusLine2, "Status-line not equal");
         } else {
             assertTrue(statusLine2.startsWith("HTTP/1."), "Status-line not HTTP/1.");
         }
@@ -366,91 +365,86 @@ public class HttpHeaderParserTest {
                         availableBytes, headerStream.available()));
     }
 
-    @DataProvider(name = "errors")
-    public Object[][] errors() {
-        List<String> responses = new ArrayList<>();
-
+    public static List<String> errors() {
         // These responses are parsed, somewhat, by MessageHeaders but give
         // nonsensible results. They, correctly, fail with the Http1HeaderParser.
-        String[] bad =
-                {// "HTTP/1.1 402 Payment Required\r\n" +
-                        // "Content-Length: 65\r\n\r",   // missing trailing LF   //TODO: incomplete
+        List<String> responses  = List.of(
+                // "HTTP/1.1 402 Payment Required\r\n" +
+                // "Content-Length: 65\r\n\r",   // missing trailing LF   //TODO: incomplete
 
-                        "HTTP/1.1 402 Payment Required\r\n" +
-                                "Content-Length: 65\r\n\rT\r\n\r\nGGGGGG",
+                "HTTP/1.1 402 Payment Required\r\n" +
+                        "Content-Length: 65\r\n\rT\r\n\r\nGGGGGG",
 
-                        "HTTP/1.1 200OK\r\n\rT",
+                "HTTP/1.1 200OK\r\n\rT",
 
-                        "HTTP/1.1 200OK\rT",
+                "HTTP/1.1 200OK\rT",
 
-                        "HTTP/1.0 FOO\r\n",
+                "HTTP/1.0 FOO\r\n",
 
-                        "HTTP/1.1 BAR\r\n",
+                "HTTP/1.1 BAR\r\n",
 
-                        "HTTP/1.1 +99\r\n",
+                "HTTP/1.1 +99\r\n",
 
-                        "HTTP/1.1 -22\r\n",
+                "HTTP/1.1 -22\r\n",
 
-                        "HTTP/1.1 -20 \r\n",
+                "HTTP/1.1 -20 \r\n",
 
+                "HTTP/1.1 200 OK\r\n" +
+                        "X-fo\u00ffo: foo\r\n" +     // invalid char in name
+                        "Content-Length: 5\r\n" +
+                        "Content-Type: text/html; charset=UTF-8\r\n\r\n" +
+                        "XXXXX",
+
+                "HTTP/1.1 200 OK\r\n" +
                         "HTTP/1.1 200 OK\r\n" +
-                                "X-fo\u00ffo: foo\r\n" +     // invalid char in name
-                                "Content-Length: 5\r\n" +
-                                "Content-Type: text/html; charset=UTF-8\r\n\r\n" +
-                                "XXXXX",
+                        "X-foo : bar\r\n" +          //  trim space after name
+                        "Content-Length: 5\r\n" +
+                        "Content-Type: text/html; charset=UTF-8\r\n\r\n" +
+                        "XXXXX",
 
-                        "HTTP/1.1 200 OK\r\n" +
-                                "HTTP/1.1 200 OK\r\n" +
-                                "X-foo : bar\r\n" +          //  trim space after name
-                                "Content-Length: 5\r\n" +
-                                "Content-Type: text/html; charset=UTF-8\r\n\r\n" +
-                                "XXXXX",
+                "HTTP/1.1 200 OK\r\n" +
+                        " X-foo: bar\r\n" +          // trim space before name
+                        "Content-Length: 5\r\n" +
+                        "Content-Type: text/html; charset=UTF-8\r\n\r\n" +
+                        "XXXXX",
 
-                        "HTTP/1.1 200 OK\r\n" +
-                                " X-foo: bar\r\n" +          // trim space before name
-                                "Content-Length: 5\r\n" +
-                                "Content-Type: text/html; charset=UTF-8\r\n\r\n" +
-                                "XXXXX",
+                "HTTP/1.1 200 OK\r\n" +
+                        "X foo: bar\r\n" +           // invalid space in name
+                        "Content-Length: 5\r\n" +
+                        "Content-Type: text/html; charset=UTF-8\r\n\r\n" +
+                        "XXXXX",
 
-                        "HTTP/1.1 200 OK\r\n" +
-                                "X foo: bar\r\n" +           // invalid space in name
-                                "Content-Length: 5\r\n" +
-                                "Content-Type: text/html; charset=UTF-8\r\n\r\n" +
-                                "XXXXX",
+                "HTTP/1.1 200 OK\r\n" +
+                        "Content-Length: 5\r\n" +
+                        "Content Type: text/html; charset=UTF-8\r\n\r\n" + // invalid space in name
+                        "XXXXX",
 
-                        "HTTP/1.1 200 OK\r\n" +
-                                "Content-Length: 5\r\n" +
-                                "Content Type: text/html; charset=UTF-8\r\n\r\n" + // invalid space in name
-                                "XXXXX",
+                "HTTP/1.1 200 OK\r\n" +
+                        "Conte\r" +
+                        " nt-Length: 9\r\n" +    // fold results in space in header name
+                        "Content-Type: text/html; charset=UTF-8\r\n\r\n" +
+                        "XXXXX",
 
-                        "HTTP/1.1 200 OK\r\n" +
-                                "Conte\r" +
-                                " nt-Length: 9\r\n" +    // fold results in space in header name
-                                "Content-Type: text/html; charset=UTF-8\r\n\r\n" +
-                                "XXXXX",
+                "HTTP/1.1 200 OK\r\n" +
+                        " : no header\r\n" +  // all blank header-name (not fold)
+                        "Content-Length: 65\r\n\r\n" +
+                        "XXXXX",
 
-                        "HTTP/1.1 200 OK\r\n" +
-                                " : no header\r\n" +  // all blank header-name (not fold)
-                                "Content-Length: 65\r\n\r\n" +
-                                "XXXXX",
+                "HTTP/1.1 200 OK\r\n" +
+                        " \t : no header\r\n" +  // all blank header-name (not fold)
+                        "Content-Length: 65\r\n\r\n" +
+                        "XXXXX");
 
-                        "HTTP/1.1 200 OK\r\n" +
-                                " \t : no header\r\n" +  // all blank header-name (not fold)
-                                "Content-Length: 65\r\n\r\n" +
-                                "XXXXX",
-
-                };
-        Arrays.stream(bad).forEach(responses::add);
-
-        return responses.stream().map(p -> new Object[] { p }).toArray(Object[][]::new);
+        return responses;
     }
 
-    @Test(dataProvider = "errors", expectedExceptions = IOException.class)
+    @ParameterizedTest
+    @MethodSource("errors")
     public void errors(String respString) throws IOException {
         byte[] bytes = respString.getBytes(US_ASCII);
         HttpHeaderParser decoder = new HttpHeaderParser();
         ByteArrayInputStream bais = new ByteArrayInputStream(bytes);
-        decoder.parse(bais);
+        assertThrows(IOException.class, () -> decoder.parse(bais));
     }
 
     void assertHeadersEqual(Map<String,List<String>> expected,
@@ -477,7 +471,7 @@ public class HttpHeaderParserTest {
                             format("%s. Expected list size %d, actual size %s",
                                     msg, values.size(), otherValues.size()));
                     if (!(values.containsAll(otherValues) && otherValues.containsAll(values)))
-                        assertTrue(false, format("Lists are unequal [%s] [%s]", values, otherValues));
+                        fail(format("Lists are unequal [%s] [%s]", values, otherValues));
                     break;
                 }
             }
diff --git a/test/jdk/sun/net/www/protocol/http/TestTransparentNTLM.java b/test/jdk/sun/net/www/protocol/http/TestTransparentNTLM.java
index 0df834765c8..1c2262ba8e2 100644
--- a/test/jdk/sun/net/www/protocol/http/TestTransparentNTLM.java
+++ b/test/jdk/sun/net/www/protocol/http/TestTransparentNTLM.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2019, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -28,18 +28,18 @@
  *          and is used only when the relevant property is set.
  * @requires os.family == "windows"
  * @library /test/lib
- * @run testng/othervm
+ * @run junit/othervm
  *      -Dtest.auth.succeed=false
  *      TestTransparentNTLM
- * @run testng/othervm
+ * @run junit/othervm
  *      -Djdk.http.ntlm.transparentAuth=allHosts
  *      -Dtest.auth.succeed=true
  *      TestTransparentNTLM
- * @run testng/othervm
+ * @run junit/othervm
  *      -Djdk.http.ntlm.transparentAuth=blahblah
  *      -Dtest.auth.succeed=false
  *      TestTransparentNTLM
- * @run testng/othervm
+ * @run junit/othervm
  *      -Djdk.http.ntlm.transparentAuth=trustedHosts
  *      -Dtest.auth.succeed=false
  *      TestTransparentNTLM
@@ -57,21 +57,21 @@ import java.net.ServerSocket;
 import java.net.Socket;
 import java.net.URL;
 import jdk.test.lib.net.URIBuilder;
-import org.testng.annotations.AfterTest;
-import org.testng.annotations.BeforeTest;
-import org.testng.annotations.Test;
-import org.testng.SkipException;
+import org.junit.jupiter.api.AfterAll;
+import org.junit.jupiter.api.BeforeAll;
+import org.junit.jupiter.api.Test;
+
 import static java.lang.System.out;
 import static java.net.Proxy.NO_PROXY;
 import static java.nio.charset.StandardCharsets.UTF_8;
-import static org.testng.Assert.assertEquals;
-import static org.testng.Assert.fail;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.fail;
 
 public class TestTransparentNTLM {
 
-    boolean succeed;  // true if authentication is expected to succeed
-    Server server;
-    URL url;
+    static boolean succeed;  // true if authentication is expected to succeed
+    static Server server;
+    static URL url;
 
     @Test
     public void testNTLM() throws IOException {
@@ -81,11 +81,11 @@ public class TestTransparentNTLM {
         out.println("received: " + respCode);
 
         if (succeed) {
-            assertEquals(respCode, HttpURLConnection.HTTP_OK);
+            assertEquals(HttpURLConnection.HTTP_OK, respCode);
             String body = new String(uc.getInputStream().readAllBytes(), UTF_8);
             out.println("received body: " + body);
         } else {
-            assertEquals(respCode, HttpURLConnection.HTTP_UNAUTHORIZED);
+            assertEquals(HttpURLConnection.HTTP_UNAUTHORIZED, respCode);
         }
     }
 
@@ -169,8 +169,8 @@ public class TestTransparentNTLM {
         }
     }
 
-    @BeforeTest
-    public void setup() throws Exception {
+    @BeforeAll
+    public static void setup() throws Exception {
         succeed = System.getProperty("test.auth.succeed").equals("true");
         if (succeed)
             out.println("Expect client to succeed, with 200 Ok");
@@ -187,8 +187,8 @@ public class TestTransparentNTLM {
                 .toURL();
     }
 
-    @AfterTest
-    public void teardown() throws Exception {
+    @AfterAll
+    public static void teardown() throws Exception {
         server.close();
         server.join();
     }
diff --git a/test/jdk/sun/net/www/protocol/jar/MultiReleaseJarURLConnection.java b/test/jdk/sun/net/www/protocol/jar/MultiReleaseJarURLConnection.java
index f113e7d3fcd..3be7dd5bd98 100644
--- a/test/jdk/sun/net/www/protocol/jar/MultiReleaseJarURLConnection.java
+++ b/test/jdk/sun/net/www/protocol/jar/MultiReleaseJarURLConnection.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2015, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2015, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -31,7 +31,7 @@
  * @build CreateMultiReleaseTestJars
  *        jdk.test.lib.util.JarBuilder
  *        jdk.test.lib.compiler.Compiler
- * @run testng MultiReleaseJarURLConnection
+ * @run junit ${test.main.class}
  */
 
 import java.io.IOException;
@@ -59,22 +59,27 @@ import java.util.jar.JarFile;
 import com.sun.net.httpserver.HttpServer;
 import com.sun.net.httpserver.SimpleFileServer;
 import jdk.test.lib.net.URIBuilder;
-import org.testng.Assert;
-import org.testng.annotations.AfterClass;
-import org.testng.annotations.BeforeClass;
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
+import org.junit.jupiter.api.AfterAll;
+import org.junit.jupiter.api.BeforeAll;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertFalse;
+import static org.junit.jupiter.api.Assertions.assertNotEquals;
+import static org.junit.jupiter.api.Assertions.assertNull;
+import static org.junit.jupiter.api.Assertions.assertTrue;
 
 public class MultiReleaseJarURLConnection {
-    String userdir = System.getProperty("user.dir", ".");
-    String unversioned = userdir + "/unversioned.jar";
-    String unsigned = userdir + "/multi-release.jar";
-    String signed = userdir + "/signed-multi-release.jar";
-    HttpServer server;
-    ExecutorService executor;
+    static String userdir = System.getProperty("user.dir", ".");
+    static String unversioned = userdir + "/unversioned.jar";
+    static String unsigned = userdir + "/multi-release.jar";
+    static String signed = userdir + "/signed-multi-release.jar";
+    static HttpServer server;
+    static ExecutorService executor;
 
-    @BeforeClass
-    public void initialize() throws Exception {
+    @BeforeAll
+    public static void initialize() throws Exception {
         CreateMultiReleaseTestJars creator = new CreateMultiReleaseTestJars();
         creator.compileEntries();
         creator.buildUnversionedJar();
@@ -87,8 +92,8 @@ public class MultiReleaseJarURLConnection {
         server.start();
     }
 
-    @AfterClass
-    public void close() throws IOException {
+    @AfterAll
+    public static void close() throws IOException {
         // Windows requires server to stop before file is deleted
         if (server != null)
             server.stop(0);
@@ -99,8 +104,7 @@ public class MultiReleaseJarURLConnection {
         Files.delete(Paths.get(signed));
     }
 
-    @DataProvider(name = "data")
-    public Object[][] createData() {
+    public static Object[][] createData() {
         return new Object[][]{
                 {"unversioned", unversioned},
                 {"unsigned", unsigned},
@@ -108,20 +112,21 @@ public class MultiReleaseJarURLConnection {
         };
     }
 
-    @Test(dataProvider = "data")
+    @ParameterizedTest
+    @MethodSource("createData")
     public void testRuntimeVersioning(String style, String file) throws Exception {
         String urlFile = "jar:file:" + file + "!/";
         String baseUrlEntry = urlFile + "version/Version.java";
         String rtreturn = "return " + Runtime.version().major();
 
-        Assert.assertTrue(readAndCompare(new URL(baseUrlEntry), "return 8"));
+        assertTrue(readAndCompare(new URL(baseUrlEntry), "return 8"));
         // #runtime is "magic" for a multi-release jar, but not for unversioned jar
-        Assert.assertTrue(readAndCompare(new URL(baseUrlEntry + "#runtime"),
+        assertTrue(readAndCompare(new URL(baseUrlEntry + "#runtime"),
                 style.equals("unversioned") ? "return 8" : rtreturn));
         // #fragment or any other fragment is not magic
-        Assert.assertTrue(readAndCompare(new URL(baseUrlEntry + "#fragment"), "return 8"));
+        assertTrue(readAndCompare(new URL(baseUrlEntry + "#fragment"), "return 8"));
         // cached entities not affected
-        Assert.assertTrue(readAndCompare(new URL(baseUrlEntry), "return 8"));
+        assertTrue(readAndCompare(new URL(baseUrlEntry), "return 8"));
 
         // the following tests will not work with unversioned jars
         if (style.equals("unversioned"))
@@ -130,13 +135,14 @@ public class MultiReleaseJarURLConnection {
         // direct access to versioned entry
         String versUrlEntry = urlFile + "META-INF/versions/" + Runtime.version().major()
                 + "/version/Version.java";
-        Assert.assertTrue(readAndCompare(new URL(versUrlEntry), rtreturn));
+        assertTrue(readAndCompare(new URL(versUrlEntry), rtreturn));
         // adding any fragment does not change things
-        Assert.assertTrue(readAndCompare(new URL(versUrlEntry + "#runtime"), rtreturn));
-        Assert.assertTrue(readAndCompare(new URL(versUrlEntry + "#fragment"), rtreturn));
+        assertTrue(readAndCompare(new URL(versUrlEntry + "#runtime"), rtreturn));
+        assertTrue(readAndCompare(new URL(versUrlEntry + "#fragment"), rtreturn));
     }
 
-    @Test(dataProvider = "data")
+    @ParameterizedTest
+    @MethodSource("createData")
     public void testCachedJars(String style, String file) throws Exception {
         String urlFile = "jar:file:" + file + "!/";
 
@@ -150,28 +156,27 @@ public class MultiReleaseJarURLConnection {
         JarFile runtimeJar = juc.getJarFile();
         Runtime.Version runtime = runtimeJar.getVersion();
         if (style.equals("unversioned")) {
-            Assert.assertEquals(root, runtime);
+            assertEquals(root, runtime);
         } else {
-            Assert.assertNotEquals(root, runtime);
+            assertNotEquals(root, runtime);
         }
 
         juc = (JarURLConnection) rootUrl.openConnection();
         JarFile jar = juc.getJarFile();
-        Assert.assertEquals(jar.getVersion(), root);
-        Assert.assertEquals(jar, rootJar);
+        assertEquals(root, jar.getVersion());
+        assertEquals(rootJar, jar);
 
         juc = (JarURLConnection) runtimeUrl.openConnection();
         jar = juc.getJarFile();
-        Assert.assertEquals(jar.getVersion(), runtime);
-        Assert.assertEquals(jar, runtimeJar);
+        assertEquals(runtime, jar.getVersion());
+        assertEquals(runtimeJar, jar);
 
         rootJar.close();
         runtimeJar.close();
         jar.close(); // probably not needed
     }
 
-    @DataProvider(name = "resourcedata")
-    public Object[][] createResourceData() throws Exception {
+    public static Object[][] createResourceData() throws Exception {
         return new Object[][]{
                 {"unversioned", Paths.get(unversioned).toUri().toURL()},
                 {"unsigned", Paths.get(unsigned).toUri().toURL()},
@@ -189,7 +194,8 @@ public class MultiReleaseJarURLConnection {
         };
     }
 
-    @Test(dataProvider = "resourcedata")
+    @ParameterizedTest
+    @MethodSource("createResourceData")
     public void testResources(String style, URL url) throws Throwable {
         // System.out.println("  testing " + style + " url: " + url);
         URL[] urls = {url};
@@ -199,30 +205,28 @@ public class MultiReleaseJarURLConnection {
         // verify we are loading a runtime versioned class
         MethodType mt = MethodType.methodType(int.class);
         MethodHandle mh = MethodHandles.lookup().findVirtual(vcls, "getVersion", mt);
-        Assert.assertEquals((int)mh.invoke(vcls.newInstance()),
-                style.equals("unversioned") ? 8 : Runtime.version().major());
-
+        assertEquals(style.equals("unversioned") ? 8 : Runtime.version().major(), (int)mh.invoke(vcls.newInstance()));
         // now get a resource and verify that we don't have a fragment attached
         Enumeration<URL> vclsUrlEnum = cldr.getResources("version/Version.class");
-        Assert.assertTrue(vclsUrlEnum.hasMoreElements());
+        assertTrue(vclsUrlEnum.hasMoreElements());
         URL vclsUrls[] = new URL[] {
             vcls.getResource("/version/Version.class"),
             vcls.getResource("Version.class"),
             cldr.getResource("version/Version.class"),
             vclsUrlEnum.nextElement()
         };
-        Assert.assertFalse(vclsUrlEnum.hasMoreElements());
+        assertFalse(vclsUrlEnum.hasMoreElements());
         for (URL vclsUrl : vclsUrls) {
             String fragment = vclsUrl.getRef();
-            Assert.assertNull(fragment);
+            assertNull(fragment);
 
             // and verify that the url is a reified pointer to the runtime entry
             String rep = vclsUrl.toString();
             //System.out.println("    getResource(\"/version/Version.class\") returned: " + rep);
             if (style.equals("http")) {
-                Assert.assertTrue(rep.startsWith("jar:http:"));
+                assertTrue(rep.startsWith("jar:http:"));
             } else {
-                Assert.assertTrue(rep.startsWith("jar:file:"));
+                assertTrue(rep.startsWith("jar:file:"));
             }
             String suffix;
             if (style.equals("unversioned")) {
@@ -231,7 +235,7 @@ public class MultiReleaseJarURLConnection {
                 suffix = ".jar!/META-INF/versions/" + Runtime.version().major()
                         + "/version/Version.class";
             }
-            Assert.assertTrue(rep.endsWith(suffix));
+            assertTrue(rep.endsWith(suffix));
         }
         cldr.close();
     }
diff --git a/test/jdk/sun/net/www/protocol/jrt/Basic.java b/test/jdk/sun/net/www/protocol/jrt/Basic.java
index 785920b4a4d..272d82bd4d6 100644
--- a/test/jdk/sun/net/www/protocol/jrt/Basic.java
+++ b/test/jdk/sun/net/www/protocol/jrt/Basic.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2014, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2014, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -24,21 +24,25 @@
 /**
  * @test
  * @summary Basic test of jimage protocol handler
- * @run testng Basic
+ * @run junit ${test.main.class}
  */
 
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
+
 import java.io.IOException;
 import java.net.URL;
 import java.net.URLConnection;
 
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
-import static org.testng.Assert.*;
+import static org.junit.jupiter.api.Assertions.assertNotEquals;
+import static org.junit.jupiter.api.Assertions.assertNotNull;
+import static org.junit.jupiter.api.Assertions.assertTrue;
+import static org.junit.jupiter.api.Assertions.fail;
+
 
 public class Basic {
 
-    @DataProvider(name = "urls")
-    public Object[][] urls() {
+    public static Object[][] urls() {
         Object[][] data = {
                 {"jrt:/java.base/java/lang/Object.class", true},
                 // Valid resource with and without percent-encoding.
@@ -67,7 +71,8 @@ public class Basic {
         return data;
     }
 
-    @Test(dataProvider = "urls")
+    @ParameterizedTest
+    @MethodSource("urls")
     public void testConnect(String urlString, boolean exists) throws Exception {
         URL url = new URL(urlString);
         URLConnection uc = url.openConnection();
@@ -79,32 +84,35 @@ public class Basic {
         }
     }
 
-    @Test(dataProvider = "urls")
+    @ParameterizedTest
+    @MethodSource("urls")
     public void testInputStream(String urlString, boolean exists) throws Exception {
         URL url = new URL(urlString);
         URLConnection uc = url.openConnection();
         try {
             int b = uc.getInputStream().read();
-            assertTrue(b != -1);
+            assertNotEquals(-1, b);
             if (!exists) fail("IOException expected");
         } catch (IOException ioe) {
             if (exists) fail("IOException not expected");
         }
     }
 
-    @Test(dataProvider = "urls")
+    @ParameterizedTest
+    @MethodSource("urls")
     public void testContentLength(String urlString, boolean exists) throws Exception {
         URL url = new URL(urlString);
         int len = url.openConnection().getContentLength();
         assertTrue((exists && len > 0) || (!exists && len == -1));
     }
 
-    @Test(dataProvider = "urls")
+    @ParameterizedTest
+    @MethodSource("urls")
     public void testGetContent(String urlString, boolean exists) throws Exception {
         URL url = new URL(urlString);
         try {
             Object obj = url.getContent();
-            assertTrue(obj != null);
+            assertNotNull(obj);
             if (!exists) fail("IOException expected");
         } catch (IOException ioe) {
             if (exists) fail("IOException not expected");

From 51cd741573330352fc7b7395b1c8aeca8a4bdcf5 Mon Sep 17 00:00:00 2001
From: Jaikiran Pai <jpai@openjdk.org>
Date: Tue, 14 Apr 2026 04:45:15 +0000
Subject: [PATCH 582/655] 8381670: Revert the changes to GZIPInputStream
 related to InputStream.available() usage

Reviewed-by: lancea, iris
---
 .../java/util/zip/GZIPInputStream.java        | 76 +++++----------
 .../zip/GZIP/GZIPInputStreamAvailable.java    | 93 -------------------
 2 files changed, 21 insertions(+), 148 deletions(-)
 delete mode 100644 test/jdk/java/util/zip/GZIP/GZIPInputStreamAvailable.java

diff --git a/src/java.base/share/classes/java/util/zip/GZIPInputStream.java b/src/java.base/share/classes/java/util/zip/GZIPInputStream.java
index ebcb9e3204c..72fb8036f08 100644
--- a/src/java.base/share/classes/java/util/zip/GZIPInputStream.java
+++ b/src/java.base/share/classes/java/util/zip/GZIPInputStream.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1996, 2026, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1996, 2024, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -79,11 +79,7 @@ public class GZIPInputStream extends InflaterInputStream {
         super(in, createInflater(in, size), size);
         usesDefaultInflater = true;
         try {
-            // we don't expect the stream to be at EOF
-            // and if it is, then we want readHeader to
-            // raise an exception, so we pass "true" for
-            // the "failOnEOF" param.
-            readHeader(in, true);
+            readHeader(in);
         } catch (IOException ioe) {
             this.inf.end();
             throw ioe;
@@ -194,40 +190,12 @@ public class GZIPInputStream extends InflaterInputStream {
     /*
      * Reads GZIP member header and returns the total byte number
      * of this member header.
-     * If failOnEOF is false and if the given InputStream has already
-     * reached EOF when this method was invoked, then this method returns
-     * -1 (indicating that there's no GZIP member header).
-     * In all other cases of malformed header or EOF being detected
-     * when reading the header, this method will throw an IOException.
      */
-    private int readHeader(InputStream this_in, boolean failOnEOF) throws IOException {
+    private int readHeader(InputStream this_in) throws IOException {
         CheckedInputStream in = new CheckedInputStream(this_in, crc);
         crc.reset();
-
-        int magic;
-        if (!failOnEOF) {
-            // read an unsigned short value representing the GZIP magic header.
-            // this is the same as calling readUShort(in), except that here,
-            // when reading the first byte, we don't raise an EOFException
-            // if the stream has already reached EOF.
-
-            // read unsigned byte
-            int b = in.read();
-            if (b == -1) { // EOF
-                crc.reset();
-                return -1; // represents no header bytes available
-            }
-            checkUnexpectedByte(b);
-            // read the next unsigned byte to form the unsigned
-            // short. we throw the usual EOFException/ZipException
-            // from this point on if there is no more data or
-            // the data doesn't represent a header.
-            magic = (readUByte(in) << 8) | b;
-        } else {
-            magic = readUShort(in);
-        }
         // Check header magic
-        if (magic != GZIP_MAGIC) {
+        if (readUShort(in) != GZIP_MAGIC) {
             throw new ZipException("Not in GZIP format");
         }
         // Check compression method
@@ -290,21 +258,23 @@ public class GZIPInputStream extends InflaterInputStream {
             (readUInt(in) != (inf.getBytesWritten() & 0xffffffffL)))
             throw new ZipException("Corrupt GZIP trailer");
 
+        // If there are more bytes available in "in" or
+        // the leftover in the "inf" is > 26 bytes:
+        // this.trailer(8) + next.header.min(10) + next.trailer(8)
         // try concatenated case
-        int m = 8;                  // this.trailer
-        try {
-            int numNextHeaderBytes = readHeader(in, false); // next.header (if available)
-            if (numNextHeaderBytes == -1) {
-                return true; // end of stream reached
+        if (this.in.available() > 0 || n > 26) {
+            int m = 8;                  // this.trailer
+            try {
+                m += readHeader(in);    // next.header
+            } catch (IOException ze) {
+                return true;  // ignore any malformed, do nothing
             }
-            m += numNextHeaderBytes;
-        } catch (IOException ze) {
-            return true;  // ignore any malformed, do nothing
+            inf.reset();
+            if (n > m)
+                inf.setInput(buf, len - n + m, n - m);
+            return false;
         }
-        inf.reset();
-        if (n > m)
-            inf.setInput(buf, len - n + m, n - m);
-        return false;
+        return true;
     }
 
     /*
@@ -331,16 +301,12 @@ public class GZIPInputStream extends InflaterInputStream {
         if (b == -1) {
             throw new EOFException();
         }
-        checkUnexpectedByte(b);
-        return b;
-    }
-
-    private void checkUnexpectedByte(final int b) throws IOException {
         if (b < -1 || b > 255) {
-            // report the InputStream type which returned this unexpected byte
+            // Report on this.in, not argument in; see read{Header, Trailer}.
             throw new IOException(this.in.getClass().getName()
-                    + ".read() returned value out of range -1..255: " + b);
+                + ".read() returned value out of range -1..255: " + b);
         }
+        return b;
     }
 
     private byte[] tmpbuf = new byte[128];
diff --git a/test/jdk/java/util/zip/GZIP/GZIPInputStreamAvailable.java b/test/jdk/java/util/zip/GZIP/GZIPInputStreamAvailable.java
deleted file mode 100644
index f63015e0930..00000000000
--- a/test/jdk/java/util/zip/GZIP/GZIPInputStreamAvailable.java
+++ /dev/null
@@ -1,93 +0,0 @@
-/*
- * Copyright (c) 2023, 2024, Oracle and/or its affiliates. All rights reserved.
- * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
- *
- * This code is free software; you can redistribute it and/or modify it
- * under the terms of the GNU General Public License version 2 only, as
- * published by the Free Software Foundation.
- *
- * This code is distributed in the hope that it will be useful, but WITHOUT
- * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
- * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
- * version 2 for more details (a copy is included in the LICENSE file that
- * accompanied this code).
- *
- * You should have received a copy of the GNU General Public License version
- * 2 along with this work; if not, write to the Free Software Foundation,
- * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
- *
- * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
- * or visit www.oracle.com if you need additional information or have any
- * questions.
- */
-
-/* @test
- * @bug 7036144
- * @summary Test concatenated gz streams when available() returns zero
- * @run junit GZIPInputStreamAvailable
- */
-
-import org.junit.jupiter.api.Test;
-
-import java.io.*;
-import java.util.*;
-import java.util.zip.*;
-
-import static org.junit.jupiter.api.Assertions.assertArrayEquals;
-
-public class GZIPInputStreamAvailable {
-
-    public static final int NUM_COPIES = 100;
-
-    @Test
-    public void testZeroAvailable() throws IOException {
-
-        // Create some uncompressed data and then repeat it NUM_COPIES times
-        byte[] uncompressed1 = "this is a test".getBytes("ASCII");
-        byte[] uncompressedN = repeat(uncompressed1, NUM_COPIES);
-
-        // Compress the original data and then repeat that NUM_COPIES times
-        byte[] compressed1 = deflate(uncompressed1);
-        byte[] compressedN = repeat(compressed1, NUM_COPIES);
-
-        // (a) Read back inflated data from a stream where available() is accurate and verify
-        byte[] readback1 = inflate(new ByteArrayInputStream(compressedN));
-        assertArrayEquals(uncompressedN, readback1);
-
-        // (b) Read back inflated data from a stream where available() always returns zero and verify
-        byte[] readback2 = inflate(new ZeroAvailableStream(new ByteArrayInputStream(compressedN)));
-        assertArrayEquals(uncompressedN, readback2);
-    }
-
-    public static byte[] repeat(byte[] data, int count) {
-        byte[] repeat = new byte[data.length * count];
-        int off = 0;
-        for (int i = 0; i < count; i++) {
-            System.arraycopy(data, 0, repeat, off, data.length);
-            off += data.length;
-        }
-        return repeat;
-    }
-
-    public static byte[] deflate(byte[] data) throws IOException {
-        ByteArrayOutputStream buf = new ByteArrayOutputStream();
-        try (GZIPOutputStream out = new GZIPOutputStream(buf)) {
-            out.write(data);
-        }
-        return buf.toByteArray();
-    }
-
-    public static byte[] inflate(InputStream in) throws IOException {
-        return new GZIPInputStream(in).readAllBytes();
-    }
-
-    public static class ZeroAvailableStream extends FilterInputStream {
-        public ZeroAvailableStream(InputStream in) {
-            super(in);
-        }
-        @Override
-        public int available() {
-            return 0;
-        }
-    }
-}

From da0ba897775531aed9a228b15e47628f9bd622fa Mon Sep 17 00:00:00 2001
From: Aleksey Shipilev <shade@openjdk.org>
Date: Tue, 14 Apr 2026 07:04:35 +0000
Subject: [PATCH 583/655] 8381768: C2: GC barrier stubs miscalculate skipped
 instructions size

Reviewed-by: kvn, phh
---
 src/hotspot/share/asm/codeBuffer.cpp | 11 +++++++++++
 1 file changed, 11 insertions(+)

diff --git a/src/hotspot/share/asm/codeBuffer.cpp b/src/hotspot/share/asm/codeBuffer.cpp
index 6a288e0dad0..854cf73049b 100644
--- a/src/hotspot/share/asm/codeBuffer.cpp
+++ b/src/hotspot/share/asm/codeBuffer.cpp
@@ -858,6 +858,13 @@ csize_t CodeBuffer::figure_expanded_capacities(CodeSection* which_cs,
 }
 
 void CodeBuffer::expand(CodeSection* which_cs, csize_t amount) {
+#ifdef ASSERT
+  // The code below copies contents across temp buffers. The following
+  // sizes relate to buffer contents, and should not be changed by buffer
+  // expansion.
+  int old_total_skipped = total_skipped_instructions_size();
+#endif
+
 #ifndef PRODUCT
   if (PrintNMethods && (WizardMode || Verbose)) {
     tty->print("expanding CodeBuffer:");
@@ -916,6 +923,7 @@ void CodeBuffer::expand(CodeSection* which_cs, csize_t amount) {
     assert(cb_sect->capacity() >= new_capacity[n], "big enough");
     address cb_start = cb_sect->start();
     cb_sect->set_end(cb_start + this_sect->size());
+    cb_sect->register_skipped(this_sect->_skipped_instructions_size);
     if (this_sect->mark() == nullptr) {
       cb_sect->clear_mark();
     } else {
@@ -952,6 +960,9 @@ void CodeBuffer::expand(CodeSection* which_cs, csize_t amount) {
     this->print_on(tty);
   }
 #endif //PRODUCT
+
+  assert(old_total_skipped == total_skipped_instructions_size(),
+         "Should match: %d == %d", old_total_skipped, total_skipped_instructions_size());
 }
 
 void CodeBuffer::adjust_internal_address(address from, address to) {

From f2f8828188f45d16344c82adfbf951f7409b8825 Mon Sep 17 00:00:00 2001
From: Kieran Farrell <kfarrell@openjdk.org>
Date: Tue, 14 Apr 2026 07:36:55 +0000
Subject: [PATCH 584/655] 8364182: Add jcmd VM.security_properties command

Reviewed-by: coffeys, kevinw, alanb
---
 src/hotspot/share/classfile/vmSymbols.hpp     |  1 +
 .../share/services/diagnosticCommand.cpp      | 44 +++++++-------
 .../share/services/diagnosticCommand.hpp      |  9 +++
 .../share/classes/java/security/Security.java |  4 ++
 .../access/JavaSecurityPropertiesAccess.java  |  1 +
 .../classes/jdk/internal/vm/VMSupport.java    |  5 ++
 .../dcmd/vm/SecurityPropertiesTest.java       | 58 +++++++++++++++++++
 7 files changed, 99 insertions(+), 23 deletions(-)
 create mode 100644 test/hotspot/jtreg/serviceability/dcmd/vm/SecurityPropertiesTest.java

diff --git a/src/hotspot/share/classfile/vmSymbols.hpp b/src/hotspot/share/classfile/vmSymbols.hpp
index 2ae42bebcfd..33d00b93365 100644
--- a/src/hotspot/share/classfile/vmSymbols.hpp
+++ b/src/hotspot/share/classfile/vmSymbols.hpp
@@ -702,6 +702,7 @@ class SerializeClosure;
   template(appendToClassPathForInstrumentation_name,   "appendToClassPathForInstrumentation")                     \
   do_alias(appendToClassPathForInstrumentation_signature, string_void_signature)                                  \
   template(serializePropertiesToByteArray_name,        "serializePropertiesToByteArray")                          \
+  template(serializeSecurityPropertiesToByteArray_name, "serializeSecurityPropertiesToByteArray")                 \
   template(serializeAgentPropertiesToByteArray_name,   "serializeAgentPropertiesToByteArray")                     \
   template(encodeThrowable_name,                       "encodeThrowable")                                         \
   template(encodeThrowable_signature,                  "(Ljava/lang/Throwable;JI)I")                              \
diff --git a/src/hotspot/share/services/diagnosticCommand.cpp b/src/hotspot/share/services/diagnosticCommand.cpp
index 0846f339227..f2fa114133e 100644
--- a/src/hotspot/share/services/diagnosticCommand.cpp
+++ b/src/hotspot/share/services/diagnosticCommand.cpp
@@ -99,6 +99,7 @@ void DCmd::register_dcmds() {
   DCmdFactory::register_DCmdFactory(new DCmdFactoryImpl<VersionDCmd>(full_export));
   DCmdFactory::register_DCmdFactory(new DCmdFactoryImpl<CommandLineDCmd>(full_export));
   DCmdFactory::register_DCmdFactory(new DCmdFactoryImpl<PrintSystemPropertiesDCmd>(full_export));
+  DCmdFactory::register_DCmdFactory(new DCmdFactoryImpl<PrintSecurityPropertiesDCmd>(full_export));
   DCmdFactory::register_DCmdFactory(new DCmdFactoryImpl<PrintVMFlagsDCmd>(full_export));
   DCmdFactory::register_DCmdFactory(new DCmdFactoryImpl<SetVMFlagDCmd>(full_export));
   DCmdFactory::register_DCmdFactory(new DCmdFactoryImpl<VMDynamicLibrariesDCmd>(full_export));
@@ -334,8 +335,8 @@ void JVMTIAgentLoadDCmd::execute(DCmdSource source, TRAPS) {
 #endif // INCLUDE_JVMTI
 #endif // INCLUDE_SERVICES
 
-void PrintSystemPropertiesDCmd::execute(DCmdSource source, TRAPS) {
-  // load VMSupport
+// helper method for printing system and security properties
+static void print_properties(Symbol* method_name, outputStream* out, TRAPS) {
   Symbol* klass = vmSymbols::jdk_internal_vm_VMSupport();
   Klass* k = SystemDictionary::resolve_or_fail(klass, true, CHECK);
   InstanceKlass* ik = InstanceKlass::cast(k);
@@ -343,39 +344,36 @@ void PrintSystemPropertiesDCmd::execute(DCmdSource source, TRAPS) {
     ik->initialize(THREAD);
   }
   if (HAS_PENDING_EXCEPTION) {
-    java_lang_Throwable::print(PENDING_EXCEPTION, output());
-    output()->cr();
+    java_lang_Throwable::print(PENDING_EXCEPTION, out);
+    out->cr();
     CLEAR_PENDING_EXCEPTION;
     return;
   }
-
-  // invoke the serializePropertiesToByteArray method
   JavaValue result(T_OBJECT);
   JavaCallArguments args;
-
   Symbol* signature = vmSymbols::void_byte_array_signature();
-  JavaCalls::call_static(&result,
-                         ik,
-                         vmSymbols::serializePropertiesToByteArray_name(),
-                         signature,
-                         &args,
-                         THREAD);
+  JavaCalls::call_static(&result, ik, method_name, signature, &args, THREAD);
+
   if (HAS_PENDING_EXCEPTION) {
-    java_lang_Throwable::print(PENDING_EXCEPTION, output());
-    output()->cr();
+    java_lang_Throwable::print(PENDING_EXCEPTION, out);
+    out->cr();
     CLEAR_PENDING_EXCEPTION;
     return;
   }
-
-  // The result should be a [B
   oop res = result.get_oop();
-  assert(res->is_typeArray(), "just checking");
-  assert(TypeArrayKlass::cast(res->klass())->element_type() == T_BYTE, "just checking");
-
-  // copy the bytes to the output stream
+  assert(res->is_typeArray(), "should be a byte array");
+  assert(TypeArrayKlass::cast(res->klass())->element_type() == T_BYTE, "should be a byte array");
   typeArrayOop ba = typeArrayOop(res);
-  jbyte* addr = typeArrayOop(res)->byte_at_addr(0);
-  output()->print_raw((const char*)addr, ba->length());
+  jbyte* addr = ba->byte_at_addr(0);
+  out->print_raw((const char*)addr, ba->length());
+}
+
+void PrintSystemPropertiesDCmd::execute(DCmdSource source, TRAPS) {
+  print_properties(vmSymbols::serializePropertiesToByteArray_name(), output(), THREAD);
+}
+
+void PrintSecurityPropertiesDCmd::execute(DCmdSource source, TRAPS) {
+  print_properties(vmSymbols::serializeSecurityPropertiesToByteArray_name(), output(), THREAD);
 }
 
 VMUptimeDCmd::VMUptimeDCmd(outputStream* output, bool heap) :
diff --git a/src/hotspot/share/services/diagnosticCommand.hpp b/src/hotspot/share/services/diagnosticCommand.hpp
index c41e7bf2e2e..97ceb19d0ad 100644
--- a/src/hotspot/share/services/diagnosticCommand.hpp
+++ b/src/hotspot/share/services/diagnosticCommand.hpp
@@ -94,6 +94,15 @@ public:
     virtual void execute(DCmdSource source, TRAPS);
 };
 
+class PrintSecurityPropertiesDCmd : public DCmd {
+public:
+  PrintSecurityPropertiesDCmd(outputStream* output, bool heap) : DCmd(output, heap) { }
+  static const char* name() { return "VM.security_properties"; }
+  static const char* description() { return "Print java.security.Security properties."; }
+  static const char* impact() { return "Low"; }
+  virtual void execute(DCmdSource source, TRAPS);
+};
+
 // See also: print_flag in attachListener.cpp
 class PrintVMFlagsDCmd : public DCmdWithParser {
 protected:
diff --git a/src/java.base/share/classes/java/security/Security.java b/src/java.base/share/classes/java/security/Security.java
index 30a22b05742..9faa172c8e7 100644
--- a/src/java.base/share/classes/java/security/Security.java
+++ b/src/java.base/share/classes/java/security/Security.java
@@ -330,6 +330,10 @@ public final class Security {
             public Properties getInitialProperties() {
                 return initialSecurityProperties;
             }
+            @Override
+            public Properties getCurrentProperties() {
+                return props;
+            }
         });
     }
 
diff --git a/src/java.base/share/classes/jdk/internal/access/JavaSecurityPropertiesAccess.java b/src/java.base/share/classes/jdk/internal/access/JavaSecurityPropertiesAccess.java
index a4875f357e3..2d9dbea052a 100644
--- a/src/java.base/share/classes/jdk/internal/access/JavaSecurityPropertiesAccess.java
+++ b/src/java.base/share/classes/jdk/internal/access/JavaSecurityPropertiesAccess.java
@@ -29,4 +29,5 @@ import java.util.Properties;
 
 public interface JavaSecurityPropertiesAccess {
     Properties getInitialProperties();
+    Properties getCurrentProperties();
 }
diff --git a/src/java.base/share/classes/jdk/internal/vm/VMSupport.java b/src/java.base/share/classes/jdk/internal/vm/VMSupport.java
index 197da0d456c..32c358340af 100644
--- a/src/java.base/share/classes/jdk/internal/vm/VMSupport.java
+++ b/src/java.base/share/classes/jdk/internal/vm/VMSupport.java
@@ -98,6 +98,11 @@ public class VMSupport {
         return serializePropertiesToByteArray(onlyStrings(System.getProperties()));
     }
 
+    public static byte[] serializeSecurityPropertiesToByteArray() throws IOException {
+        Properties p = SharedSecrets.getJavaSecurityPropertiesAccess().getCurrentProperties();
+        return serializePropertiesToByteArray(onlyStrings(p));
+    }
+
     public static byte[] serializeAgentPropertiesToByteArray() throws IOException {
         return serializePropertiesToByteArray(onlyStrings(getAgentProperties()));
     }
diff --git a/test/hotspot/jtreg/serviceability/dcmd/vm/SecurityPropertiesTest.java b/test/hotspot/jtreg/serviceability/dcmd/vm/SecurityPropertiesTest.java
new file mode 100644
index 00000000000..b5a6ead34c1
--- /dev/null
+++ b/test/hotspot/jtreg/serviceability/dcmd/vm/SecurityPropertiesTest.java
@@ -0,0 +1,58 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+import java.security.Security;
+import jdk.test.lib.process.OutputAnalyzer;
+import jdk.test.lib.dcmd.CommandExecutor;
+import jdk.test.lib.dcmd.JMXExecutor;
+
+import org.junit.jupiter.api.Test;
+import static org.junit.jupiter.api.Assertions.*;
+
+/*
+ * @test
+ * @bug 8364182
+ * @summary Test of diagnostic command VM.security_properties
+ * @library /test/lib
+ * @modules java.base/jdk.internal.misc
+ *          java.compiler
+ *          java.management
+ *          jdk.internal.jvmstat/sun.jvmstat.monitor
+ * @run junit/othervm SecurityPropertiesTest
+ */
+public class SecurityPropertiesTest {
+    private static final String PROPERTY_NAME  = "SecurityPropertiesTestPropertyName";
+    private static final String PROPERTY_VALUE = "SecurityPropertiesTestPropertyValue";
+
+    private void run(CommandExecutor executor) {
+        Security.setProperty(PROPERTY_NAME, PROPERTY_VALUE);
+        OutputAnalyzer output = executor.execute("VM.security_properties");
+        assertTrue(output.getOutput().contains(PROPERTY_NAME + "=" + PROPERTY_VALUE),
+                "Should contain the test security property");
+    }
+
+    @Test
+    public void jmx() {
+        run(new JMXExecutor());
+    }
+}
\ No newline at end of file

From e71fa9e806525a09e5bbacf37445b8e746333451 Mon Sep 17 00:00:00 2001
From: Christian Hagedorn <chagedorn@openjdk.org>
Date: Tue, 14 Apr 2026 07:50:32 +0000
Subject: [PATCH 585/655] 8382057: C2: "assert((ptr->bottom_type() ==
 Type::TOP) || ((base == Compile::current()->top()) ==
 (ptr->bottom_type()->make_ptr()->isa_oopptr() == nullptr))) failed: base
 input only needed for heap addresses" with -XX:+CountCompiledCalls

Reviewed-by: rcastanedalo, bmaillard, kvn
---
 src/hotspot/share/opto/doCall.cpp             |  6 +--
 .../debug/TestCountCompiledCalls.java         | 38 +++++++++++++++++++
 2 files changed, 41 insertions(+), 3 deletions(-)
 create mode 100644 test/hotspot/jtreg/compiler/debug/TestCountCompiledCalls.java

diff --git a/src/hotspot/share/opto/doCall.cpp b/src/hotspot/share/opto/doCall.cpp
index 9a1da726f00..d6e75f17f50 100644
--- a/src/hotspot/share/opto/doCall.cpp
+++ b/src/hotspot/share/opto/doCall.cpp
@@ -1081,13 +1081,13 @@ void Parse::catch_inline_exceptions(SafePointNode* ex_map) {
 
 #ifndef PRODUCT
 void Parse::count_compiled_calls(bool at_method_entry, bool is_inline) {
-  if( CountCompiledCalls ) {
-    if( at_method_entry ) {
+  if (CountCompiledCalls) {
+    if (at_method_entry) {
       // bump invocation counter if top method (for statistics)
       if (CountCompiledCalls && depth() == 1) {
         const TypePtr* addr_type = TypeMetadataPtr::make(method());
         Node* adr1 = makecon(addr_type);
-        Node* adr2 = basic_plus_adr(adr1, adr1, in_bytes(Method::compiled_invocation_counter_offset()));
+        Node* adr2 = off_heap_plus_addr(adr1, in_bytes(Method::compiled_invocation_counter_offset()));
         increment_counter(adr2);
       }
     } else if (is_inline) {
diff --git a/test/hotspot/jtreg/compiler/debug/TestCountCompiledCalls.java b/test/hotspot/jtreg/compiler/debug/TestCountCompiledCalls.java
new file mode 100644
index 00000000000..1a3fdf6e9d6
--- /dev/null
+++ b/test/hotspot/jtreg/compiler/debug/TestCountCompiledCalls.java
@@ -0,0 +1,38 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+/*
+ * @test
+ * @bug 8382057
+ * @requires vm.debug == true
+ *
+ * @run main/othervm -Xbatch -XX:+CountCompiledCalls ${test.main.class}
+ */
+
+package compiler.debug;
+
+public class TestCountCompiledCalls {
+    public static void main(String[] args) {
+        System.out.println("Hello World!");
+    }
+}

From 6548fb80ac57098b2fe6fca6b403d3303ece91a0 Mon Sep 17 00:00:00 2001
From: Christian Hagedorn <chagedorn@openjdk.org>
Date: Tue, 14 Apr 2026 07:50:54 +0000
Subject: [PATCH 586/655] 8382050:
 compiler/intrinsics/klass/CastNullCheckDroppingsTest.java fails with
 -XX:+StressUnstableIfTraps

Reviewed-by: rcastanedalo, qamai
---
 .../intrinsics/klass/CastNullCheckDroppingsTest.java     | 9 +++------
 1 file changed, 3 insertions(+), 6 deletions(-)

diff --git a/test/hotspot/jtreg/compiler/intrinsics/klass/CastNullCheckDroppingsTest.java b/test/hotspot/jtreg/compiler/intrinsics/klass/CastNullCheckDroppingsTest.java
index 31449eefb33..ff8358c3cd8 100644
--- a/test/hotspot/jtreg/compiler/intrinsics/klass/CastNullCheckDroppingsTest.java
+++ b/test/hotspot/jtreg/compiler/intrinsics/klass/CastNullCheckDroppingsTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2014, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2014, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,8 +25,8 @@
  * @test NullCheckDroppingsTest
  * @bug 8054492
  * @summary Casting can result in redundant null checks in generated code
- * @requires vm.hasJFR
- * @requires vm.flavor == "server" & !vm.graal.enabled
+ * @requires vm.hasJFR & vm.flavor == "server" & !vm.graal.enabled & vm.flagless
+ *
  * @library /test/lib
  * @modules java.base/jdk.internal.misc
  *          java.management
@@ -35,9 +35,6 @@
  * @run driver jdk.test.lib.helpers.ClassFileInstaller jdk.test.whitebox.WhiteBox
  * @run main/othervm -Xbootclasspath/a:. -XX:+IgnoreUnrecognizedVMOptions -XX:+UnlockDiagnosticVMOptions -XX:+WhiteBoxAPI
  *                   -Xmixed -XX:-BackgroundCompilation -XX:-TieredCompilation -XX:CompileThreshold=1000
- *                   -XX:+UnlockExperimentalVMOptions -XX:PerMethodTrapLimit=100 -XX:-StressReflectiveCode
- *                   -XX:+UncommonNullCast -XX:-StressMethodHandleLinkerInlining -XX:TypeProfileLevel=0
- *                   -XX:-AlwaysIncrementalInline -XX:-StressIncrementalInlining
  *                   -XX:CompileCommand=exclude,compiler.intrinsics.klass.CastNullCheckDroppingsTest::runTest
  *                   compiler.intrinsics.klass.CastNullCheckDroppingsTest
  */

From c4199831b9df7341b020dba04f482a0910b76818 Mon Sep 17 00:00:00 2001
From: Thomas Schatzl <tschatzl@openjdk.org>
Date: Tue, 14 Apr 2026 08:08:18 +0000
Subject: [PATCH 587/655] 8381934: Wrong type passed to FREE_C_HEAP_ARRAY
 deallocating G1CardSetMemoryManager

Reviewed-by: iwalulya
---
 src/hotspot/share/gc/g1/g1CardSetMemory.cpp | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/src/hotspot/share/gc/g1/g1CardSetMemory.cpp b/src/hotspot/share/gc/g1/g1CardSetMemory.cpp
index 60602ef942b..0da2f90da3f 100644
--- a/src/hotspot/share/gc/g1/g1CardSetMemory.cpp
+++ b/src/hotspot/share/gc/g1/g1CardSetMemory.cpp
@@ -90,7 +90,7 @@ G1CardSetMemoryManager::~G1CardSetMemoryManager() {
   for (uint i = 0; i < num_mem_object_types(); i++) {
     _allocators[i].~G1CardSetAllocator();
   }
-  FREE_C_HEAP_ARRAY(G1CardSetAllocator<G1CardSetContainer>, _allocators);
+  FREE_C_HEAP_ARRAY(G1CardSetAllocator, _allocators);
 }
 
 void G1CardSetMemoryManager::free(uint type, void* value) {

From 64bbbe751b4d05ee79cb3c384cc3d399a093983f Mon Sep 17 00:00:00 2001
From: Severin Gehwolf <sgehwolf@openjdk.org>
Date: Tue, 14 Apr 2026 08:33:28 +0000
Subject: [PATCH 588/655] 8380636: Add static asserts for mirrored library
 constants

Reviewed-by: cnorrbin, dholmes
---
 src/hotspot/os/linux/cgroupSubsystem_linux.cpp | 2 ++
 1 file changed, 2 insertions(+)

diff --git a/src/hotspot/os/linux/cgroupSubsystem_linux.cpp b/src/hotspot/os/linux/cgroupSubsystem_linux.cpp
index 13a005591fb..4a2d75ecdf3 100644
--- a/src/hotspot/os/linux/cgroupSubsystem_linux.cpp
+++ b/src/hotspot/os/linux/cgroupSubsystem_linux.cpp
@@ -40,6 +40,8 @@
 // Inlined from <linux/magic.h> for portability.
 #ifndef CGROUP2_SUPER_MAGIC
 #  define CGROUP2_SUPER_MAGIC 0x63677270
+#else
+  STATIC_ASSERT(CGROUP2_SUPER_MAGIC == 0x63677270);
 #endif
 
 // controller names have to match the *_IDX indices

From d5d8532ca2ca5cbdcb80af43fb1a192c20af9914 Mon Sep 17 00:00:00 2001
From: Jatin Bhateja <jbhateja@openjdk.org>
Date: Tue, 14 Apr 2026 09:07:14 +0000
Subject: [PATCH 589/655] 8381579: C2: "fatal error: LROTATE: double" when
 using VectorAPI

Reviewed-by: mhaessig, qamai
---
 src/hotspot/share/prims/vectorSupport.cpp     |  74 +++++------
 .../jdk/incubator/vector/VectorOperators.java |  10 +-
 .../TestShiftOpOnFloatingVector.java          | 121 ++++++++++++++++++
 3 files changed, 163 insertions(+), 42 deletions(-)
 create mode 100644 test/hotspot/jtreg/compiler/vectorapi/TestShiftOpOnFloatingVector.java

diff --git a/src/hotspot/share/prims/vectorSupport.cpp b/src/hotspot/share/prims/vectorSupport.cpp
index 7d80ed327fd..5c6010acdf1 100644
--- a/src/hotspot/share/prims/vectorSupport.cpp
+++ b/src/hotspot/share/prims/vectorSupport.cpp
@@ -226,7 +226,7 @@ int VectorSupport::vop2ideal(jint id, LaneType lt) {
         case LT_LONG:   return Op_AddL;
         case LT_FLOAT:  return Op_AddF;
         case LT_DOUBLE: return Op_AddD;
-        default: fatal("ADD: %s", lanetype2name(lt));
+        default: return 0;
       }
       break;
     }
@@ -238,7 +238,7 @@ int VectorSupport::vop2ideal(jint id, LaneType lt) {
         case LT_LONG:   return Op_SubL;
         case LT_FLOAT:  return Op_SubF;
         case LT_DOUBLE: return Op_SubD;
-        default: fatal("SUB: %s", lanetype2name(lt));
+        default: return 0;
       }
       break;
     }
@@ -250,7 +250,7 @@ int VectorSupport::vop2ideal(jint id, LaneType lt) {
         case LT_LONG:   return Op_MulL;
         case LT_FLOAT:  return Op_MulF;
         case LT_DOUBLE: return Op_MulD;
-        default: fatal("MUL: %s", lanetype2name(lt));
+        default: return 0;
       }
       break;
     }
@@ -262,7 +262,7 @@ int VectorSupport::vop2ideal(jint id, LaneType lt) {
         case LT_LONG:   return Op_DivL;
         case LT_FLOAT:  return Op_DivF;
         case LT_DOUBLE: return Op_DivD;
-        default: fatal("DIV: %s", lanetype2name(lt));
+        default: return 0;
       }
       break;
     }
@@ -274,7 +274,7 @@ int VectorSupport::vop2ideal(jint id, LaneType lt) {
         case LT_LONG:   return Op_MinL;
         case LT_FLOAT:  return Op_MinF;
         case LT_DOUBLE: return Op_MinD;
-        default: fatal("MIN: %s", lanetype2name(lt));
+        default: return 0;
       }
       break;
     }
@@ -286,7 +286,7 @@ int VectorSupport::vop2ideal(jint id, LaneType lt) {
         case LT_LONG:   return Op_MaxL;
         case LT_FLOAT:  return Op_MaxF;
         case LT_DOUBLE: return Op_MaxD;
-        default: fatal("MAX: %s", lanetype2name(lt));
+        default: return 0;
       }
       break;
     }
@@ -296,7 +296,7 @@ int VectorSupport::vop2ideal(jint id, LaneType lt) {
         case LT_SHORT:
         case LT_INT:
         case LT_LONG:   return Op_UMinV;
-        default: fatal("MIN: %s", lanetype2name(lt));
+        default: return 0;
       }
       break;
     }
@@ -306,7 +306,7 @@ int VectorSupport::vop2ideal(jint id, LaneType lt) {
         case LT_SHORT:
         case LT_INT:
         case LT_LONG:   return Op_UMaxV;
-        default: fatal("MAX: %s", lanetype2name(lt));
+        default: return 0;
       }
       break;
     }
@@ -318,7 +318,7 @@ int VectorSupport::vop2ideal(jint id, LaneType lt) {
         case LT_LONG:   return Op_AbsL;
         case LT_FLOAT:  return Op_AbsF;
         case LT_DOUBLE: return Op_AbsD;
-        default: fatal("ABS: %s", lanetype2name(lt));
+        default: return 0;
       }
       break;
     }
@@ -330,7 +330,7 @@ int VectorSupport::vop2ideal(jint id, LaneType lt) {
         case LT_LONG:   return Op_NegL;
         case LT_FLOAT:  return Op_NegF;
         case LT_DOUBLE: return Op_NegD;
-        default: fatal("NEG: %s", lanetype2name(lt));
+        default: return 0;
       }
       break;
     }
@@ -340,7 +340,7 @@ int VectorSupport::vop2ideal(jint id, LaneType lt) {
         case LT_SHORT:  // fall-through
         case LT_INT:    return Op_AndI;
         case LT_LONG:   return Op_AndL;
-        default: fatal("AND: %s", lanetype2name(lt));
+        default: return 0;
       }
       break;
     }
@@ -350,7 +350,7 @@ int VectorSupport::vop2ideal(jint id, LaneType lt) {
         case LT_SHORT:  // fall-through
         case LT_INT:    return Op_OrI;
         case LT_LONG:   return Op_OrL;
-        default: fatal("OR: %s", lanetype2name(lt));
+        default: return 0;
       }
       break;
     }
@@ -360,7 +360,7 @@ int VectorSupport::vop2ideal(jint id, LaneType lt) {
         case LT_SHORT:  // fall-through
         case LT_INT:    return Op_XorI;
         case LT_LONG:   return Op_XorL;
-        default: fatal("XOR: %s", lanetype2name(lt));
+        default: return 0;
       }
       break;
     }
@@ -368,7 +368,7 @@ int VectorSupport::vop2ideal(jint id, LaneType lt) {
       switch (lt) {
         case LT_FLOAT:  return Op_SqrtF;
         case LT_DOUBLE: return Op_SqrtD;
-        default: fatal("SQRT: %s", lanetype2name(lt));
+        default: return 0;
       }
       break;
     }
@@ -376,7 +376,7 @@ int VectorSupport::vop2ideal(jint id, LaneType lt) {
       switch (lt) {
         case LT_FLOAT:  return Op_FmaF;
         case LT_DOUBLE: return Op_FmaD;
-        default: fatal("FMA: %s", lanetype2name(lt));
+        default: return 0;
       }
       break;
     }
@@ -386,7 +386,7 @@ int VectorSupport::vop2ideal(jint id, LaneType lt) {
         case LT_SHORT:  // fall-through
         case LT_INT:    return Op_LShiftI;
         case LT_LONG:   return Op_LShiftL;
-        default: fatal("LSHIFT: %s", lanetype2name(lt));
+        default: return 0;
       }
       break;
     }
@@ -396,7 +396,7 @@ int VectorSupport::vop2ideal(jint id, LaneType lt) {
         case LT_SHORT:  // fall-through
         case LT_INT:    return Op_RShiftI;
         case LT_LONG:   return Op_RShiftL;
-        default: fatal("RSHIFT: %s", lanetype2name(lt));
+        default: return 0;
       }
       break;
     }
@@ -406,7 +406,7 @@ int VectorSupport::vop2ideal(jint id, LaneType lt) {
         case LT_SHORT: return Op_URShiftS;
         case LT_INT:   return Op_URShiftI;
         case LT_LONG:  return Op_URShiftL;
-        default: fatal("URSHIFT: %s", lanetype2name(lt));
+        default: return 0;
       }
       break;
     }
@@ -416,7 +416,7 @@ int VectorSupport::vop2ideal(jint id, LaneType lt) {
         case LT_SHORT:  // fall-through
         case LT_INT:    // fall-through
         case LT_LONG:   return Op_RotateLeft;
-        default: fatal("LROTATE: %s", lanetype2name(lt));
+        default: return 0;
       }
       break;
     }
@@ -426,7 +426,7 @@ int VectorSupport::vop2ideal(jint id, LaneType lt) {
         case LT_SHORT:  // fall-through
         case LT_INT:    // fall-through
         case LT_LONG:   return Op_RotateRight;
-        default: fatal("RROTATE: %s", lanetype2name(lt));
+        default: return 0;
       }
       break;
     }
@@ -438,7 +438,7 @@ int VectorSupport::vop2ideal(jint id, LaneType lt) {
         case LT_LONG:   // fall-through
         case LT_FLOAT:  // fall-through
         case LT_DOUBLE: return Op_VectorMaskLastTrue;
-        default: fatal("MASK_LASTTRUE: %s", lanetype2name(lt));
+        default: return 0;
       }
       break;
     }
@@ -450,7 +450,7 @@ int VectorSupport::vop2ideal(jint id, LaneType lt) {
         case LT_LONG:   // fall-through
         case LT_FLOAT:  // fall-through
         case LT_DOUBLE: return Op_VectorMaskFirstTrue;
-        default: fatal("MASK_FIRSTTRUE: %s", lanetype2name(lt));
+        default: return 0;
       }
       break;
     }
@@ -462,7 +462,7 @@ int VectorSupport::vop2ideal(jint id, LaneType lt) {
         case LT_LONG:   // fall-through
         case LT_FLOAT:  // fall-through
         case LT_DOUBLE: return Op_VectorMaskTrueCount;
-        default: fatal("MASK_TRUECOUNT: %s", lanetype2name(lt));
+        default: return 0;
       }
       break;
     }
@@ -474,7 +474,7 @@ int VectorSupport::vop2ideal(jint id, LaneType lt) {
         case LT_LONG:   // fall-through
         case LT_FLOAT:  // fall-through
         case LT_DOUBLE: return Op_VectorMaskToLong;
-        default: fatal("MASK_TOLONG: %s", lanetype2name(lt));
+        default: return 0;
       }
       break;
     }
@@ -486,7 +486,7 @@ int VectorSupport::vop2ideal(jint id, LaneType lt) {
         case LT_LONG:   // fall-through
         case LT_FLOAT:  // fall-through
         case LT_DOUBLE: return Op_ExpandV;
-        default: fatal("EXPAND: %s", lanetype2name(lt));
+        default: return 0;
       }
       break;
     }
@@ -498,7 +498,7 @@ int VectorSupport::vop2ideal(jint id, LaneType lt) {
         case LT_LONG:   // fall-through
         case LT_FLOAT:  // fall-through
         case LT_DOUBLE: return Op_CompressV;
-        default: fatal("COMPRESS: %s", lanetype2name(lt));
+        default: return 0;
       }
       break;
     }
@@ -510,7 +510,7 @@ int VectorSupport::vop2ideal(jint id, LaneType lt) {
         case LT_LONG:   // fall-through
         case LT_FLOAT:  // fall-through
         case LT_DOUBLE: return Op_CompressM;
-        default: fatal("MASK_COMPRESS: %s", lanetype2name(lt));
+        default: return 0;
       }
       break;
     }
@@ -520,7 +520,7 @@ int VectorSupport::vop2ideal(jint id, LaneType lt) {
         case LT_SHORT: // for byte and short types temporarily
         case LT_INT:   return Op_PopCountI;
         case LT_LONG:  return Op_PopCountL;
-        default: fatal("BILT_COUNT: %s", lanetype2name(lt));
+        default: return 0;
       }
       break;
     }
@@ -530,7 +530,7 @@ int VectorSupport::vop2ideal(jint id, LaneType lt) {
         case LT_SHORT:
         case LT_INT:   return Op_CountTrailingZerosI;
         case LT_LONG:  return Op_CountTrailingZerosL;
-        default: fatal("TZ_COUNT: %s", lanetype2name(lt));
+        default: return 0;
       }
       break;
     }
@@ -540,7 +540,7 @@ int VectorSupport::vop2ideal(jint id, LaneType lt) {
         case LT_SHORT:
         case LT_INT:   return Op_CountLeadingZerosI;
         case LT_LONG:  return Op_CountLeadingZerosL;
-        default: fatal("LZ_COUNT: %s", lanetype2name(lt));
+        default: return 0;
       }
       break;
     }
@@ -550,7 +550,7 @@ int VectorSupport::vop2ideal(jint id, LaneType lt) {
         case LT_SHORT: // Op_ReverseI for byte and short
         case LT_INT:   return Op_ReverseI;
         case LT_LONG:  return Op_ReverseL;
-        default: fatal("REVERSE: %s", lanetype2name(lt));
+        default: return 0;
       }
       break;
     }
@@ -565,7 +565,7 @@ int VectorSupport::vop2ideal(jint id, LaneType lt) {
         case LT_BYTE:  // Intentionally fall-through
         case LT_INT:   return Op_ReverseBytesI;
         case LT_LONG:  return Op_ReverseBytesL;
-        default: fatal("REVERSE_BYTES: %s", lanetype2name(lt));
+        default: return 0;
       }
       break;
     }
@@ -576,7 +576,7 @@ int VectorSupport::vop2ideal(jint id, LaneType lt) {
         case LT_SHORT:  // fall-through
         case LT_INT:    // fall-through
         case LT_LONG:   return Op_SaturatingAddV;
-        default: fatal("S[U]ADD: %s", lanetype2name(lt));
+        default: return 0;
       }
       break;
     }
@@ -587,7 +587,7 @@ int VectorSupport::vop2ideal(jint id, LaneType lt) {
         case LT_SHORT:  // fall-through
         case LT_INT:    // fall-through
         case LT_LONG:   return Op_SaturatingSubV;
-        default: fatal("S[U}SUB: %s", lanetype2name(lt));
+        default: return 0;
       }
       break;
     }
@@ -595,7 +595,7 @@ int VectorSupport::vop2ideal(jint id, LaneType lt) {
       switch (lt) {
         case LT_INT:
         case LT_LONG: return Op_CompressBits;
-        default: fatal("COMPRESS_BITS: %s", lanetype2name(lt));
+        default: return 0;
       }
       break;
     }
@@ -603,7 +603,7 @@ int VectorSupport::vop2ideal(jint id, LaneType lt) {
       switch (lt) {
         case LT_INT:
         case LT_LONG: return Op_ExpandBits;
-        default: fatal("EXPAND_BITS: %s", lanetype2name(lt));
+        default: return 0;
       }
       break;
     }
@@ -627,7 +627,7 @@ int VectorSupport::vop2ideal(jint id, LaneType lt) {
     case VECTOR_OP_EXPM1: // fall-through
     case VECTOR_OP_HYPOT: return 0; // not supported; should be handled in Java code
 
-    default: fatal("unknown op: %d", vop);
+    default: return 0;
   }
   return 0; // Unimplemented
 }
diff --git a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/VectorOperators.java b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/VectorOperators.java
index 2f2d33ab130..cc5a7ccbdef 100644
--- a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/VectorOperators.java
+++ b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/VectorOperators.java
@@ -560,15 +560,15 @@ public final class VectorOperators {
 
 
     /** Produce {@code a<<(n&(ESIZE*8-1))}.  Integral only. */
-    public static final /*bitwise*/ Binary LSHL = binary("LSHL", "<<", VectorSupport.VECTOR_OP_LSHIFT, VO_SHIFT);
+    public static final /*bitwise*/ Binary LSHL = binary("LSHL", "<<", VectorSupport.VECTOR_OP_LSHIFT, VO_SHIFT+VO_NOFP);
     /** Produce {@code a>>(n&(ESIZE*8-1))}.  Integral only. */
-    public static final /*bitwise*/ Binary ASHR = binary("ASHR", ">>", VectorSupport.VECTOR_OP_RSHIFT, VO_SHIFT);
+    public static final /*bitwise*/ Binary ASHR = binary("ASHR", ">>", VectorSupport.VECTOR_OP_RSHIFT, VO_SHIFT+VO_NOFP);
     /** Produce {@code (a&EMASK)>>>(n&(ESIZE*8-1))}.  Integral only. */
-    public static final /*bitwise*/ Binary LSHR = binary("LSHR", ">>>", VectorSupport.VECTOR_OP_URSHIFT, VO_SHIFT);
+    public static final /*bitwise*/ Binary LSHR = binary("LSHR", ">>>", VectorSupport.VECTOR_OP_URSHIFT, VO_SHIFT+VO_NOFP);
     /** Produce {@code rotateLeft(a,n)}.  Integral only. */
-    public static final /*bitwise*/ Binary ROL = binary("ROL", "rotateLeft", VectorSupport.VECTOR_OP_LROTATE, VO_SHIFT);
+    public static final /*bitwise*/ Binary ROL = binary("ROL", "rotateLeft", VectorSupport.VECTOR_OP_LROTATE, VO_SHIFT+VO_NOFP);
     /** Produce {@code rotateRight(a,n)}.  Integral only. */
-    public static final /*bitwise*/ Binary ROR = binary("ROR", "rotateRight", VectorSupport.VECTOR_OP_RROTATE, VO_SHIFT);
+    public static final /*bitwise*/ Binary ROR = binary("ROR", "rotateRight", VectorSupport.VECTOR_OP_RROTATE, VO_SHIFT+VO_NOFP);
     /** Produce {@code compress(a,n)}. Integral, {@code int} and {@code long}, only.
      * @since 19
      */
diff --git a/test/hotspot/jtreg/compiler/vectorapi/TestShiftOpOnFloatingVector.java b/test/hotspot/jtreg/compiler/vectorapi/TestShiftOpOnFloatingVector.java
new file mode 100644
index 00000000000..ea1878bcb53
--- /dev/null
+++ b/test/hotspot/jtreg/compiler/vectorapi/TestShiftOpOnFloatingVector.java
@@ -0,0 +1,121 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+package compiler.vectorapi;
+
+import jdk.incubator.vector.*;
+
+/*
+ * @test
+ * @bug 8381579
+ * @summary Verify shift operations on floating-point vectors throw UnsupportedOperationException.
+ * @modules jdk.incubator.vector
+ * @library /test/lib /
+ * @run main/othervm -Xbatch -XX:-TieredCompilation
+ *      compiler.vectorapi.TestShiftOpOnFloatingVector
+ */
+
+public class TestShiftOpOnFloatingVector {
+
+    static final int ITERATIONS = 4_000;
+    static final int ARRAY_LEN = 100;
+
+    static void testROL() {
+        double[] arr = new double[ARRAY_LEN];
+        for (int i = 0; i < arr.length; i++) {
+            arr[i] = i * 1.5 + 7.89;
+        }
+        for (int i = 0; i < arr.length; i += DoubleVector.SPECIES_PREFERRED.length()) {
+            DoubleVector v = DoubleVector.fromArray(DoubleVector.SPECIES_PREFERRED, arr, i);
+            DoubleVector r = v.lanewise(VectorOperators.ROL, 7);
+            r.intoArray(arr, i);
+        }
+    }
+
+    static void testROR() {
+        double[] arr = new double[ARRAY_LEN];
+        for (int i = 0; i < arr.length; i++) {
+            arr[i] = i * 1.5 + 7.89;
+        }
+        for (int i = 0; i < arr.length; i += DoubleVector.SPECIES_PREFERRED.length()) {
+            DoubleVector v = DoubleVector.fromArray(DoubleVector.SPECIES_PREFERRED, arr, i);
+            DoubleVector r = v.lanewise(VectorOperators.ROR, 3);
+            r.intoArray(arr, i);
+        }
+    }
+
+    static void testLSHL() {
+        float[] arr = new float[ARRAY_LEN];
+        for (int i = 0; i < arr.length; i++) {
+            arr[i] = i * 0.5f + 1.0f;
+        }
+        for (int i = 0; i < arr.length; i += FloatVector.SPECIES_PREFERRED.length()) {
+            FloatVector v = FloatVector.fromArray(FloatVector.SPECIES_PREFERRED, arr, i);
+            FloatVector r = v.lanewise(VectorOperators.LSHL, 2);
+            r.intoArray(arr, i);
+        }
+    }
+
+    static void testLSHR() {
+        float[] arr = new float[ARRAY_LEN];
+        for (int i = 0; i < arr.length; i++) {
+            arr[i] = i * 0.3f + 2.0f;
+        }
+        for (int i = 0; i < arr.length; i += FloatVector.SPECIES_PREFERRED.length()) {
+            FloatVector v = FloatVector.fromArray(FloatVector.SPECIES_PREFERRED, arr, i);
+            FloatVector r = v.lanewise(VectorOperators.LSHR, 5);
+            r.intoArray(arr, i);
+        }
+    }
+
+    static void testASHR() {
+        double[] arr = new double[ARRAY_LEN];
+        for (int i = 0; i < arr.length; i++) {
+            arr[i] = i * 2.0 + 3.0;
+        }
+        for (int i = 0; i < arr.length; i += DoubleVector.SPECIES_PREFERRED.length()) {
+            DoubleVector v = DoubleVector.fromArray(DoubleVector.SPECIES_PREFERRED, arr, i);
+            DoubleVector r = v.lanewise(VectorOperators.ASHR, 4);
+            r.intoArray(arr, i);
+        }
+    }
+
+    static void runTest(Runnable test, String name) {
+        for (int i = 0; i < ITERATIONS; i++) {
+            try {
+                test.run();
+                throw new AssertionError(name + ": Expected UnsupportedOperationException was not thrown");
+            } catch (UnsupportedOperationException e) {
+                // expected
+            }
+        }
+    }
+
+    public static void main(String[] args) {
+        runTest(TestShiftOpOnFloatingVector::testROL,  "ROL");
+        runTest(TestShiftOpOnFloatingVector::testROR,  "ROR");
+        runTest(TestShiftOpOnFloatingVector::testLSHL, "LSHL");
+        runTest(TestShiftOpOnFloatingVector::testLSHR, "LSHR");
+        runTest(TestShiftOpOnFloatingVector::testASHR, "ASHR");
+    }
+}

From 540c714eea7bd5f1f15b59eaa05819b12c948aac Mon Sep 17 00:00:00 2001
From: Ivan Walulya <iwalulya@openjdk.org>
Date: Tue, 14 Apr 2026 10:51:58 +0000
Subject: [PATCH 590/655] 8382084: Use dynamic chunk sizes in
 PartialArraySplitter

Co-authored-by: Thomas Schatzl <tschatzl@openjdk.org>
Reviewed-by: ayang, tschatzl
---
 src/hotspot/share/gc/g1/g1ConcurrentMark.cpp  |  7 +++---
 src/hotspot/share/gc/g1/g1FullGCMarker.cpp    |  4 ++--
 .../share/gc/g1/g1ParScanThreadState.cpp      |  4 ++--
 .../share/gc/parallel/psCompactionManager.cpp |  6 ++---
 .../share/gc/parallel/psPromotionManager.cpp  |  6 ++---
 .../share/gc/shared/partialArraySplitter.cpp  |  7 +++---
 .../share/gc/shared/partialArraySplitter.hpp  | 10 ++++----
 .../gc/shared/partialArraySplitter.inline.hpp | 13 ++++++----
 .../share/gc/shared/partialArrayState.cpp     |  7 ++++--
 .../share/gc/shared/partialArrayState.hpp     |  8 +++++--
 .../gc/shared/partialArrayTaskStepper.cpp     |  5 ++--
 .../gc/shared/partialArrayTaskStepper.hpp     | 19 ++++++---------
 .../shared/partialArrayTaskStepper.inline.hpp | 24 ++++++++-----------
 .../shared/test_partialArrayTaskStepper.cpp   | 14 ++++++-----
 14 files changed, 68 insertions(+), 66 deletions(-)

diff --git a/src/hotspot/share/gc/g1/g1ConcurrentMark.cpp b/src/hotspot/share/gc/g1/g1ConcurrentMark.cpp
index a72d5fc5cf9..dbb5ba509a2 100644
--- a/src/hotspot/share/gc/g1/g1ConcurrentMark.cpp
+++ b/src/hotspot/share/gc/g1/g1ConcurrentMark.cpp
@@ -2173,8 +2173,7 @@ void G1CMTask::reset_for_restart() {
 void G1CMTask::register_partial_array_splitter() {
 
   ::new (&_partial_array_splitter) PartialArraySplitter(_cm->partial_array_state_manager(),
-                                                        _cm->max_num_tasks(),
-                                                        ObjArrayMarkingStride);
+                                                        _cm->max_num_tasks());
 }
 
 void G1CMTask::unregister_partial_array_splitter() {
@@ -2359,7 +2358,7 @@ size_t G1CMTask::start_partial_array_processing(objArrayOop obj) {
   process_klass(obj->klass());
 
   size_t array_length = obj->length();
-  size_t initial_chunk_size = _partial_array_splitter.start(_task_queue, obj, nullptr, array_length);
+  size_t initial_chunk_size = _partial_array_splitter.start(_task_queue, obj, nullptr, array_length, ObjArrayMarkingStride);
 
   process_array_chunk(obj, 0, initial_chunk_size);
 
@@ -2917,7 +2916,7 @@ G1CMTask::G1CMTask(uint worker_id,
   _cm(cm),
   _mark_bitmap(nullptr),
   _task_queue(task_queue),
-  _partial_array_splitter(_cm->partial_array_state_manager(), _cm->max_num_tasks(), ObjArrayMarkingStride),
+  _partial_array_splitter(_cm->partial_array_state_manager(), _cm->max_num_tasks()),
   _mark_stats_cache(mark_stats, G1RegionMarkStatsCache::RegionMarkStatsCacheSize),
   _calls(0),
   _time_target_ms(0.0),
diff --git a/src/hotspot/share/gc/g1/g1FullGCMarker.cpp b/src/hotspot/share/gc/g1/g1FullGCMarker.cpp
index 2b0b78ac1ce..5af1eae92c5 100644
--- a/src/hotspot/share/gc/g1/g1FullGCMarker.cpp
+++ b/src/hotspot/share/gc/g1/g1FullGCMarker.cpp
@@ -39,7 +39,7 @@ G1FullGCMarker::G1FullGCMarker(G1FullCollector* collector,
     _worker_id(worker_id),
     _bitmap(collector->mark_bitmap()),
     _task_queue(),
-    _partial_array_splitter(collector->partial_array_state_manager(), collector->workers(), ObjArrayMarkingStride),
+    _partial_array_splitter(collector->partial_array_state_manager(), collector->workers()),
     _mark_closure(worker_id, this, ClassLoaderData::_claim_stw_fullgc_mark, G1CollectedHeap::heap()->ref_processor_stw()),
     _stack_closure(this),
     _cld_closure(mark_closure(), ClassLoaderData::_claim_stw_fullgc_mark),
@@ -65,7 +65,7 @@ void G1FullGCMarker::start_partial_array_processing(objArrayOop obj) {
   // Don't push empty arrays to avoid unnecessary work.
   size_t array_length = obj->length();
   if (array_length > 0) {
-    size_t initial_chunk_size = _partial_array_splitter.start(task_queue(), obj, nullptr, array_length);
+    size_t initial_chunk_size = _partial_array_splitter.start(task_queue(), obj, nullptr, array_length, ObjArrayMarkingStride);
     process_array_chunk(obj, 0, initial_chunk_size);
   }
 }
diff --git a/src/hotspot/share/gc/g1/g1ParScanThreadState.cpp b/src/hotspot/share/gc/g1/g1ParScanThreadState.cpp
index 2b0e6ce9cf4..52c8d4d4389 100644
--- a/src/hotspot/share/gc/g1/g1ParScanThreadState.cpp
+++ b/src/hotspot/share/gc/g1/g1ParScanThreadState.cpp
@@ -78,7 +78,7 @@ G1ParScanThreadState::G1ParScanThreadState(G1CollectedHeap* g1h,
     _surviving_young_words(nullptr),
     _surviving_words_length(collection_set->young_region_length() + 1),
     _old_gen_is_full(false),
-    _partial_array_splitter(g1h->partial_array_state_manager(), num_workers, ParGCArrayScanChunk),
+    _partial_array_splitter(g1h->partial_array_state_manager(), num_workers),
     _string_dedup_requests(),
     _max_num_optional_regions(collection_set->num_optional_regions()),
     _numa(g1h->numa()),
@@ -253,7 +253,7 @@ void G1ParScanThreadState::start_partial_objarray(oop from_obj,
   size_t array_length = to_array->length();
   size_t initial_chunk_size =
     // The source array is unused when processing states.
-    _partial_array_splitter.start(_task_queue, nullptr, to_array, array_length);
+    _partial_array_splitter.start(_task_queue, nullptr, to_array, array_length, ParGCArrayScanChunk);
 
   assert(_scanner.skip_card_mark_set(), "must be");
   // Process the initial chunk.  No need to process the type in the
diff --git a/src/hotspot/share/gc/parallel/psCompactionManager.cpp b/src/hotspot/share/gc/parallel/psCompactionManager.cpp
index 0108f1a9762..048355bfad3 100644
--- a/src/hotspot/share/gc/parallel/psCompactionManager.cpp
+++ b/src/hotspot/share/gc/parallel/psCompactionManager.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2005, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2005, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -58,7 +58,7 @@ PreservedMarksSet* ParCompactionManager::_preserved_marks_set = nullptr;
 ParCompactionManager::ParCompactionManager(PreservedMarks* preserved_marks,
                                            ReferenceProcessor* ref_processor,
                                            uint parallel_gc_threads)
-  :_partial_array_splitter(_partial_array_state_manager, parallel_gc_threads, ObjArrayMarkingStride),
+  :_partial_array_splitter(_partial_array_state_manager, parallel_gc_threads),
    _mark_and_push_closure(this, ref_processor) {
 
   ParallelScavengeHeap* heap = ParallelScavengeHeap::heap();
@@ -126,7 +126,7 @@ void ParCompactionManager::push_objArray(oop obj) {
   objArrayOop obj_array = objArrayOop(obj);
   size_t array_length = obj_array->length();
   size_t initial_chunk_size =
-    _partial_array_splitter.start(&_marking_stack, obj_array, nullptr, array_length);
+    _partial_array_splitter.start(&_marking_stack, obj_array, nullptr, array_length, ObjArrayMarkingStride);
   follow_array(obj_array, 0, initial_chunk_size);
 }
 
diff --git a/src/hotspot/share/gc/parallel/psPromotionManager.cpp b/src/hotspot/share/gc/parallel/psPromotionManager.cpp
index 39fcc5556c6..ac22430aa4c 100644
--- a/src/hotspot/share/gc/parallel/psPromotionManager.cpp
+++ b/src/hotspot/share/gc/parallel/psPromotionManager.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2002, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2002, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -158,7 +158,7 @@ PartialArrayTaskStats* PSPromotionManager::partial_array_task_stats() {
 
 // Most members are initialized either by initialize() or reset().
 PSPromotionManager::PSPromotionManager()
-  : _partial_array_splitter(_partial_array_state_manager, ParallelGCThreads, ParGCArrayScanChunk)
+  : _partial_array_splitter(_partial_array_state_manager, ParallelGCThreads)
 {
   // We set the old lab's start array.
   _old_lab.set_start_array(old_gen()->start_array());
@@ -273,7 +273,7 @@ void PSPromotionManager::push_objArray(oop old_obj, oop new_obj) {
   size_t array_length = to_array->length();
   size_t initial_chunk_size =
     // The source array is unused when processing states.
-    _partial_array_splitter.start(&_claimed_stack_depth, nullptr, to_array, array_length);
+    _partial_array_splitter.start(&_claimed_stack_depth, nullptr, to_array, array_length, ParGCArrayScanChunk);
 
   process_array_chunk(to_array, 0, initial_chunk_size);
 }
diff --git a/src/hotspot/share/gc/shared/partialArraySplitter.cpp b/src/hotspot/share/gc/shared/partialArraySplitter.cpp
index d1833872683..04884d5e666 100644
--- a/src/hotspot/share/gc/shared/partialArraySplitter.cpp
+++ b/src/hotspot/share/gc/shared/partialArraySplitter.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2024, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2024, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -28,10 +28,9 @@
 #include "utilities/macros.hpp"
 
 PartialArraySplitter::PartialArraySplitter(PartialArrayStateManager* manager,
-                                           uint num_workers,
-                                           size_t chunk_size)
+                                           uint num_workers)
   : _allocator(manager),
-    _stepper(num_workers, chunk_size)
+    _stepper(num_workers)
     TASKQUEUE_STATS_ONLY(COMMA _stats())
 {}
 
diff --git a/src/hotspot/share/gc/shared/partialArraySplitter.hpp b/src/hotspot/share/gc/shared/partialArraySplitter.hpp
index 87cc137e797..340f370d1d5 100644
--- a/src/hotspot/share/gc/shared/partialArraySplitter.hpp
+++ b/src/hotspot/share/gc/shared/partialArraySplitter.hpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2024, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2024, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -44,8 +44,7 @@ class PartialArraySplitter {
 
 public:
   PartialArraySplitter(PartialArrayStateManager* manager,
-                       uint num_workers,
-                       size_t chunk_size);
+                       uint num_workers);
   ~PartialArraySplitter() = default;
 
   NONCOPYABLE(PartialArraySplitter);
@@ -60,6 +59,8 @@ public:
   //
   // length is their length in elements.
   //
+  // chunk_size the size of a single chunk.
+  //
   // If t is a ScannerTask, queue->push(t) must be a valid expression.  The
   // result of that expression is ignored.
   //
@@ -76,7 +77,8 @@ public:
   size_t start(Queue* queue,
                objArrayOop from_array,
                objArrayOop to_array,
-               size_t length);
+               size_t length,
+               size_t chunk_size);
 
   // Result type for claim(), carrying multiple values.  Provides the claimed
   // chunk's start and end array indices.
diff --git a/src/hotspot/share/gc/shared/partialArraySplitter.inline.hpp b/src/hotspot/share/gc/shared/partialArraySplitter.inline.hpp
index abb0cf13101..7679358e218 100644
--- a/src/hotspot/share/gc/shared/partialArraySplitter.inline.hpp
+++ b/src/hotspot/share/gc/shared/partialArraySplitter.inline.hpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2024, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -39,14 +39,16 @@ template<typename Queue>
 size_t PartialArraySplitter::start(Queue* queue,
                                    objArrayOop source,
                                    objArrayOop destination,
-                                   size_t length) {
-  PartialArrayTaskStepper::Step step = _stepper.start(length);
+                                   size_t length,
+                                   size_t chunk_size) {
+  precond(chunk_size > 0);
+  PartialArrayTaskStepper::Step step = _stepper.start(length, chunk_size);
   // Push initial partial scan tasks.
   if (step._ncreate > 0) {
     TASKQUEUE_STATS_ONLY(_stats.inc_split(););
     TASKQUEUE_STATS_ONLY(_stats.inc_pushed(step._ncreate);)
     PartialArrayState* state =
-      _allocator.allocate(source, destination, step._index, length, step._ncreate);
+      _allocator.allocate(source, destination, step._index, length, chunk_size, step._ncreate);
     for (uint i = 0; i < step._ncreate; ++i) {
       queue->push(ScannerTask(state));
     }
@@ -75,9 +77,10 @@ PartialArraySplitter::claim(PartialArrayState* state, Queue* queue, bool stolen)
       queue->push(ScannerTask(state));
     }
   }
+  size_t chunk_size = state->chunk_size();
   // Release state, decrementing refcount, now that we're done with it.
   _allocator.release(state);
-  return Claim{step._index, step._index + _stepper.chunk_size()};
+  return Claim{step._index, step._index + chunk_size};
 }
 
 #endif // SHARE_GC_SHARED_PARTIALARRAYSPLITTER_INLINE_HPP
diff --git a/src/hotspot/share/gc/shared/partialArrayState.cpp b/src/hotspot/share/gc/shared/partialArrayState.cpp
index aadbc46b7c1..d3b21c2fdaa 100644
--- a/src/hotspot/share/gc/shared/partialArrayState.cpp
+++ b/src/hotspot/share/gc/shared/partialArrayState.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2024, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2024, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -35,10 +35,12 @@
 
 PartialArrayState::PartialArrayState(oop src, oop dst,
                                      size_t index, size_t length,
+                                     size_t chunk_size,
                                      size_t initial_refcount)
   : _source(src),
     _destination(dst),
     _length(length),
+    _chunk_size(chunk_size),
     _index(index),
     _refcount(initial_refcount)
 {
@@ -77,6 +79,7 @@ PartialArrayStateAllocator::~PartialArrayStateAllocator() {
 PartialArrayState* PartialArrayStateAllocator::allocate(oop src, oop dst,
                                                         size_t index,
                                                         size_t length,
+                                                        size_t chunk_size,
                                                         size_t initial_refcount) {
   void* p;
   FreeListEntry* head = _free_list;
@@ -87,7 +90,7 @@ PartialArrayState* PartialArrayStateAllocator::allocate(oop src, oop dst,
     head->~FreeListEntry();
     p = head;
   }
-  return ::new (p) PartialArrayState(src, dst, index, length, initial_refcount);
+  return ::new (p) PartialArrayState(src, dst, index, length, chunk_size, initial_refcount);
 }
 
 void PartialArrayStateAllocator::release(PartialArrayState* state) {
diff --git a/src/hotspot/share/gc/shared/partialArrayState.hpp b/src/hotspot/share/gc/shared/partialArrayState.hpp
index 3dafeb0f14c..75e297526ae 100644
--- a/src/hotspot/share/gc/shared/partialArrayState.hpp
+++ b/src/hotspot/share/gc/shared/partialArrayState.hpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2024, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2024, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -61,6 +61,7 @@ class PartialArrayState {
   oop _source;
   oop _destination;
   size_t _length;
+  size_t _chunk_size;
   Atomic<size_t> _index;
   Atomic<size_t> _refcount;
 
@@ -68,7 +69,7 @@ class PartialArrayState {
 
   PartialArrayState(oop src, oop dst,
                     size_t index, size_t length,
-                    size_t initial_refcount);
+                    size_t chunk_size, size_t initial_refcount);
 
 public:
   // Deleted to require management by allocator object.
@@ -89,6 +90,8 @@ public:
   // The length of the array oop.
   size_t length() const { return _length; }
 
+  size_t chunk_size() const { return _chunk_size; }
+
   // A pointer to the start index for the next segment to process, for atomic
   // update.
   Atomic<size_t>* index_addr() { return &_index; }
@@ -130,6 +133,7 @@ public:
   // from the associated manager.
   PartialArrayState* allocate(oop src, oop dst,
                               size_t index, size_t length,
+                              size_t chunk_size,
                               size_t initial_refcount);
 
   // Decrement the state's refcount.  If the new refcount is zero, add the
diff --git a/src/hotspot/share/gc/shared/partialArrayTaskStepper.cpp b/src/hotspot/share/gc/shared/partialArrayTaskStepper.cpp
index d91ba347d6c..f7d53c9348a 100644
--- a/src/hotspot/share/gc/shared/partialArrayTaskStepper.cpp
+++ b/src/hotspot/share/gc/shared/partialArrayTaskStepper.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2020, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -48,8 +48,7 @@ static uint compute_task_fanout(uint task_limit) {
   return result;
 }
 
-PartialArrayTaskStepper::PartialArrayTaskStepper(uint n_workers, size_t chunk_size) :
-  _chunk_size(chunk_size),
+PartialArrayTaskStepper::PartialArrayTaskStepper(uint n_workers) :
   _task_limit(compute_task_limit(n_workers)),
   _task_fanout(compute_task_fanout(_task_limit))
 {}
diff --git a/src/hotspot/share/gc/shared/partialArrayTaskStepper.hpp b/src/hotspot/share/gc/shared/partialArrayTaskStepper.hpp
index 11499ca2ffe..594cc7b245a 100644
--- a/src/hotspot/share/gc/shared/partialArrayTaskStepper.hpp
+++ b/src/hotspot/share/gc/shared/partialArrayTaskStepper.hpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2020, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -40,19 +40,19 @@ class PartialArrayState;
 // substantially expand the task queues.
 class PartialArrayTaskStepper {
 public:
-  PartialArrayTaskStepper(uint n_workers, size_t chunk_size);
+  PartialArrayTaskStepper(uint n_workers);
 
   struct Step {
     size_t _index;              // Array index for the step.
     uint _ncreate;              // Number of new tasks to create.
   };
 
-  // Called with the length of the array to be processed.  Returns a Step with
-  // _index being the end of the initial chunk, which the caller should
-  // process.  This is also the starting index for the next chunk to process.
+  // Called with the length of the array to be processed and chunk size.
+  // Returns a Step with _index being the end of the initial chunk, which the
+  // caller should process.  This is also the starting index for the next chunk to process.
   // The _ncreate is the number of tasks to enqueue to continue processing the
   // array.  If _ncreate is zero then _index will be length.
-  inline Step start(size_t length) const;
+  inline Step start(size_t length, size_t chunk_size) const;
 
   // Atomically increment state's index by chunk_size() to claim the next
   // chunk.  Returns a Step with _index being the starting index of the
@@ -60,21 +60,16 @@ public:
   // to enqueue.
   inline Step next(PartialArrayState* state) const;
 
-  // The size of chunks to claim for each task.
-  inline size_t chunk_size() const;
-
   class TestSupport;            // For unit tests
 
 private:
-  // Size (number of elements) of a chunk to process.
-  size_t _chunk_size;
   // Limit on the number of partial array tasks to create for a given array.
   uint _task_limit;
   // Maximum number of new tasks to create when processing an existing task.
   uint _task_fanout;
 
   // For unit tests.
-  inline Step next_impl(size_t length, Atomic<size_t>* index_addr) const;
+  inline Step next_impl(size_t length, size_t chunk_size, Atomic<size_t>* index_addr) const;
 };
 
 #endif // SHARE_GC_SHARED_PARTIALARRAYTASKSTEPPER_HPP
diff --git a/src/hotspot/share/gc/shared/partialArrayTaskStepper.inline.hpp b/src/hotspot/share/gc/shared/partialArrayTaskStepper.inline.hpp
index 6946f7c69ff..538815698f2 100644
--- a/src/hotspot/share/gc/shared/partialArrayTaskStepper.inline.hpp
+++ b/src/hotspot/share/gc/shared/partialArrayTaskStepper.inline.hpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2020, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -31,13 +31,9 @@
 #include "utilities/checkedCast.hpp"
 #include "utilities/debug.hpp"
 
-size_t PartialArrayTaskStepper::chunk_size() const {
-  return _chunk_size;
-}
-
 PartialArrayTaskStepper::Step
-PartialArrayTaskStepper::start(size_t length) const {
-  size_t end = length % _chunk_size; // End of initial chunk.
+PartialArrayTaskStepper::start(size_t length, size_t chunk_size) const {
+  size_t end = length % chunk_size; // End of initial chunk.
   // If the initial chunk is the complete array, then don't need any partial
   // tasks.  Otherwise, start with just one partial task; see new task
   // calculation in next().
@@ -45,24 +41,24 @@ PartialArrayTaskStepper::start(size_t length) const {
 }
 
 PartialArrayTaskStepper::Step
-PartialArrayTaskStepper::next_impl(size_t length, Atomic<size_t>* index_addr) const {
+PartialArrayTaskStepper::next_impl(size_t length, size_t chunk_size, Atomic<size_t>* index_addr) const {
   // The start of the next task is in the state's index.
   // Atomically increment by the chunk size to claim the associated chunk.
   // Because we limit the number of enqueued tasks to being no more than the
   // number of remaining chunks to process, we can use an atomic add for the
   // claim, rather than a CAS loop.
-  size_t start = index_addr->fetch_then_add(_chunk_size, memory_order_relaxed);
+  size_t start = index_addr->fetch_then_add(chunk_size, memory_order_relaxed);
 
   assert(start < length, "invariant: start %zu, length %zu", start, length);
-  assert(((length - start) % _chunk_size) == 0,
+  assert(((length - start) % chunk_size) == 0,
          "invariant: start %zu, length %zu, chunk size %zu",
-         start, length, _chunk_size);
+         start, length, chunk_size);
 
   // Determine the number of new tasks to create.
   // Zero-based index for this partial task.  The initial task isn't counted.
-  uint task_num = checked_cast<uint>(start / _chunk_size);
+  uint task_num = checked_cast<uint>(start / chunk_size);
   // Number of tasks left to process, including this one.
-  uint remaining_tasks = checked_cast<uint>((length - start) / _chunk_size);
+  uint remaining_tasks = checked_cast<uint>((length - start) / chunk_size);
   assert(remaining_tasks > 0, "invariant");
   // Compute number of pending tasks, including this one.  The maximum number
   // of tasks is a function of task_num (N) and _task_fanout (F).
@@ -89,7 +85,7 @@ PartialArrayTaskStepper::next_impl(size_t length, Atomic<size_t>* index_addr) co
 
 PartialArrayTaskStepper::Step
 PartialArrayTaskStepper::next(PartialArrayState* state) const {
-  return next_impl(state->length(), state->index_addr());
+  return next_impl(state->length(), state->chunk_size(), state->index_addr());
 }
 
 #endif // SHARE_GC_SHARED_PARTIALARRAYTASKSTEPPER_INLINE_HPP
diff --git a/test/hotspot/gtest/gc/shared/test_partialArrayTaskStepper.cpp b/test/hotspot/gtest/gc/shared/test_partialArrayTaskStepper.cpp
index 977e7a9d949..3f5b6c0706c 100644
--- a/test/hotspot/gtest/gc/shared/test_partialArrayTaskStepper.cpp
+++ b/test/hotspot/gtest/gc/shared/test_partialArrayTaskStepper.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2020, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -34,8 +34,9 @@ class PartialArrayTaskStepper::TestSupport : AllStatic {
 public:
   static Step next(const Stepper* stepper,
                    size_t length,
+                   size_t chunk_size,
                    Atomic<size_t>* to_length_addr) {
-    return stepper->next_impl(length, to_length_addr);
+    return stepper->next_impl(length, chunk_size, to_length_addr);
   }
 };
 
@@ -43,23 +44,24 @@ using StepperSupport = PartialArrayTaskStepper::TestSupport;
 
 static uint simulate(const Stepper* stepper,
                      size_t length,
+                     size_t chunk_size,
                      Atomic<size_t>* to_length_addr) {
-  Step init = stepper->start(length);
+  Step init = stepper->start(length, chunk_size);
   to_length_addr->store_relaxed(init._index);
   uint queue_count = init._ncreate;
   uint task = 0;
   for ( ; queue_count > 0; ++task) {
     --queue_count;
-    Step step = StepperSupport::next(stepper, length, to_length_addr);
+    Step step = StepperSupport::next(stepper, length, chunk_size, to_length_addr);
     queue_count += step._ncreate;
   }
   return task;
 }
 
 static void run_test(size_t length, size_t chunk_size, uint n_workers) {
-  const PartialArrayTaskStepper stepper(n_workers, chunk_size);
+  const PartialArrayTaskStepper stepper(n_workers);
   Atomic<size_t> to_length;
-  uint tasks = simulate(&stepper, length, &to_length);
+  uint tasks = simulate(&stepper, length, chunk_size, &to_length);
   ASSERT_EQ(length, to_length.load_relaxed());
   ASSERT_EQ(tasks, length / chunk_size);
 }

From d4bb97c7d63bb9256027446ac5712c175052ab96 Mon Sep 17 00:00:00 2001
From: Ivan Walulya <iwalulya@openjdk.org>
Date: Tue, 14 Apr 2026 14:17:21 +0000
Subject: [PATCH 591/655] 8379677: G1: Micros-System.gc benchmarks regress
 after moving to PartialArrayStates

Co-authored-by: Thomas Schatzl <tschatzl@openjdk.org>
Reviewed-by: tschatzl, ayang
---
 src/hotspot/share/gc/g1/g1FullGCMarker.cpp    | 20 +++++++++++++++----
 src/hotspot/share/gc/shared/gc_globals.hpp    |  8 +++++++-
 .../share/gc/shared/jvmFlagConstraintsGC.cpp  | 14 ++++++++++++-
 .../share/gc/shared/jvmFlagConstraintsGC.hpp  |  5 +++--
 4 files changed, 39 insertions(+), 8 deletions(-)

diff --git a/src/hotspot/share/gc/g1/g1FullGCMarker.cpp b/src/hotspot/share/gc/g1/g1FullGCMarker.cpp
index 5af1eae92c5..3be4ab8d839 100644
--- a/src/hotspot/share/gc/g1/g1FullGCMarker.cpp
+++ b/src/hotspot/share/gc/g1/g1FullGCMarker.cpp
@@ -60,14 +60,26 @@ void G1FullGCMarker::process_partial_array(PartialArrayState* state, bool stolen
   process_array_chunk(obj_array, claim._start, claim._end);
 }
 
+static uintx calc_array_stride(uint array_len, uint num_threads) {
+  precond(num_threads > 0);
+
+  const size_t stride = (array_len + num_threads - 1) / num_threads;
+  return clamp(stride, ArrayMarkingMinStride, ObjArrayMarkingStride);
+}
+
 void G1FullGCMarker::start_partial_array_processing(objArrayOop obj) {
   mark_closure()->do_klass(obj->klass());
   // Don't push empty arrays to avoid unnecessary work.
-  size_t array_length = obj->length();
-  if (array_length > 0) {
-    size_t initial_chunk_size = _partial_array_splitter.start(task_queue(), obj, nullptr, array_length, ObjArrayMarkingStride);
-    process_array_chunk(obj, 0, initial_chunk_size);
+  const int array_length = obj->length();
+
+  if (array_length == 0) {
+    return;
   }
+
+  const uintx stride = calc_array_stride(array_length, _collector->workers());
+  const size_t initial_chunk_size = _partial_array_splitter.start(task_queue(), obj, nullptr, array_length, stride);
+
+  process_array_chunk(obj, 0, initial_chunk_size);
 }
 
 void G1FullGCMarker::complete_marking(G1ScannerTasksQueueSet* task_queues,
diff --git a/src/hotspot/share/gc/shared/gc_globals.hpp b/src/hotspot/share/gc/shared/gc_globals.hpp
index 66ca10f1fb6..c9102944197 100644
--- a/src/hotspot/share/gc/shared/gc_globals.hpp
+++ b/src/hotspot/share/gc/shared/gc_globals.hpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1997, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -256,6 +256,12 @@
           "before pushing a continuation entry")                            \
           range(1, INT_MAX/2)                                               \
                                                                             \
+  product(uintx, ArrayMarkingMinStride, 64, DIAGNOSTIC,                     \
+          "Minimum chunk size for split array processing during marking; "  \
+          "the effective stride is clamped between this value "             \
+          "and ObjArrayMarkingStride.")                                     \
+          constraint(ArrayMarkingMinStrideConstraintFunc,AfterErgo)         \
+                                                                            \
   product(bool, AggressiveHeap, false,                                      \
           "(Deprecated) Optimize heap options for long-running memory "     \
           "intensive apps")                                                 \
diff --git a/src/hotspot/share/gc/shared/jvmFlagConstraintsGC.cpp b/src/hotspot/share/gc/shared/jvmFlagConstraintsGC.cpp
index ea3d644d105..4d7ffce3a5d 100644
--- a/src/hotspot/share/gc/shared/jvmFlagConstraintsGC.cpp
+++ b/src/hotspot/share/gc/shared/jvmFlagConstraintsGC.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2015, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2015, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -414,3 +414,15 @@ JVMFlag::Error GCCardSizeInBytesConstraintFunc(uint value, bool verbose) {
     return JVMFlag::SUCCESS;
   }
 }
+
+JVMFlag::Error ArrayMarkingMinStrideConstraintFunc(uintx value, bool verbose) {
+  if (value > ObjArrayMarkingStride) {
+    JVMFlag::printError(verbose,
+                        "ArrayMarkingMinStride (%zu) must be "
+                        "less than or equal to ObjArrayMarkingStride (%zu)\n",
+                        value, ObjArrayMarkingStride);
+    return JVMFlag::VIOLATES_CONSTRAINT;
+  } else {
+    return JVMFlag::SUCCESS;
+  }
+}
diff --git a/src/hotspot/share/gc/shared/jvmFlagConstraintsGC.hpp b/src/hotspot/share/gc/shared/jvmFlagConstraintsGC.hpp
index a89f42959e1..1d2f45397aa 100644
--- a/src/hotspot/share/gc/shared/jvmFlagConstraintsGC.hpp
+++ b/src/hotspot/share/gc/shared/jvmFlagConstraintsGC.hpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2015, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2015, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -66,7 +66,8 @@
  f(uintx,  SurvivorRatioConstraintFunc)                        \
  f(size_t, MetaspaceSizeConstraintFunc)                        \
  f(size_t, MaxMetaspaceSizeConstraintFunc)                     \
- f(uint, GCCardSizeInBytesConstraintFunc)
+ f(uint, GCCardSizeInBytesConstraintFunc)                      \
+ f(uintx, ArrayMarkingMinStrideConstraintFunc)
 
 SHARED_GC_CONSTRAINTS(DECLARE_CONSTRAINT)
 

From 49a15be918673ee49c3a02287aa268a87419147a Mon Sep 17 00:00:00 2001
From: Naoto Sato <naoto@openjdk.org>
Date: Tue, 14 Apr 2026 16:35:31 +0000
Subject: [PATCH 592/655] 8382020: Time Zone Abbreviation Not Localized for
 Non-English Locales

Reviewed-by: iris
---
 .../tools/cldrconverter/CLDRConverter.java    |  38 +-
 .../resources/cldr/TimeZoneNamesTest.java     | 368 ++++++++++--------
 2 files changed, 237 insertions(+), 169 deletions(-)

diff --git a/make/jdk/src/classes/build/tools/cldrconverter/CLDRConverter.java b/make/jdk/src/classes/build/tools/cldrconverter/CLDRConverter.java
index de496b3f606..9f42326ef09 100644
--- a/make/jdk/src/classes/build/tools/cldrconverter/CLDRConverter.java
+++ b/make/jdk/src/classes/build/tools/cldrconverter/CLDRConverter.java
@@ -801,10 +801,7 @@ public class CLDRConverter {
             String tzKey = Optional.ofNullable((String)handlerSupplMeta.get(tzid))
                                    .orElse(tzid);
             // Follow link, if needed
-            String tzLink = null;
-            for (var k = tzKey; tzdbLinks.containsKey(k);) {
-                k = tzLink = tzdbLinks.get(k);
-            }
+            String tzLink = getTZDBLink(tzKey);
             if (tzLink == null && tzdbLinks.containsValue(tzKey)) {
                 // reverse link search
                 // this is needed as in tzdb, "America/Buenos_Aires" links to
@@ -833,7 +830,7 @@ public class CLDRConverter {
                 } else {
                     // TZDB short names
                     tznames = Arrays.copyOf(tznames, tznames.length);
-                    fillTZDBShortNames(tzid, tznames);
+                    fillTZDBShortNames(tzKey, tznames);
                     names.put(tzid, tznames);
                 }
             } else {
@@ -846,11 +843,13 @@ public class CLDRConverter {
                     String metaKey = METAZONE_ID_PREFIX + meta;
                     data = map.get(metaKey);
                     if (data instanceof String[] tznames) {
-                        // TZDB short names
-                        tznames = Arrays.copyOf((String[])names.getOrDefault(metaKey, tznames), 6);
-                        fillTZDBShortNames(tzid, tznames);
-                        // Keep the metazone prefix here.
-                        names.putIfAbsent(metaKey, tznames);
+                        if (isDefaultZone(meta, tzKey)) {
+                            // Record the metazone names only from the default
+                            // (001) zone, with short names filled from TZDB
+                            tznames = Arrays.copyOf(tznames, tznames.length);
+                            fillTZDBShortNames(tzKey, tznames);
+                            names.put(metaKey, tznames);
+                        }
                         names.put(tzid, meta);
                         if (tzLink != null && availableIds.contains(tzLink)) {
                             names.put(tzLink, meta);
@@ -1504,12 +1503,12 @@ public class CLDRConverter {
      * Fill the TZDB short names if there is no name provided by the CLDR
      */
     private static void fillTZDBShortNames(String tzid, String[] names) {
-        var val = tzdbShortNamesMap.get(tzdbLinks.getOrDefault(tzid, tzid));
+        var val = tzdbShortNamesMap.getOrDefault(tzid, tzdbShortNamesMap.get(getTZDBLink(tzid)));
         if (val != null) {
             var format = val.split(NBSP)[0];
             var rule = val.split(NBSP)[1];
             IntStream.of(1, 3, 5).forEach(i -> {
-                if (names[i] == null) {
+                if (names[i] == null || names[i].isEmpty()) {
                     if (format.contains("%s")) {
                         names[i] = switch (i) {
                             case 1 -> format.formatted(tzdbSubstLetters.get(rule + NBSP + STD));
@@ -1531,6 +1530,21 @@ public class CLDRConverter {
         }
     }
 
+    private static boolean isDefaultZone(String meta, String tzid) {
+        String zone001 = handlerMetaZones.zidMap().get(meta);
+        var tzLink = getTZDBLink(tzid);
+        return canonicalTZMap.getOrDefault(tzid, tzid).equals(zone001) ||
+            tzLink != null && canonicalTZMap.getOrDefault(tzLink, tzLink).equals(zone001);
+    }
+
+    private static String getTZDBLink(String tzid) {
+        String tzLink = null;
+        for (var k = tzid; tzdbLinks.containsKey(k);) {
+            k = tzLink = tzdbLinks.get(k);
+        }
+        return tzLink;
+    }
+
     /*
      * Convert TZDB offsets to JDK's offsets, eg, "-08" to "GMT-08:00".
      * If it cannot recognize the pattern, return the argument as is.
diff --git a/test/jdk/sun/util/resources/cldr/TimeZoneNamesTest.java b/test/jdk/sun/util/resources/cldr/TimeZoneNamesTest.java
index 4d9b7500d87..b02f988e7c0 100644
--- a/test/jdk/sun/util/resources/cldr/TimeZoneNamesTest.java
+++ b/test/jdk/sun/util/resources/cldr/TimeZoneNamesTest.java
@@ -24,7 +24,7 @@
  /*
  * @test
  * @bug 8181157 8202537 8234347 8236548 8261279 8322647 8174269 8346948
- *      8354548 8381379
+ *      8354548 8381379 8382020
  * @modules jdk.localedata
  * @summary Checks CLDR time zone names are generated correctly at
  * either build or runtime
@@ -62,164 +62,218 @@ public class TimeZoneNamesTest {
 
             // no "metazone" zones (some of them were assigned metazones
             // over time, thus they are not "generated" per se
-            {"Asia/Srednekolymsk",      Locale.US, "Magadan Standard Time",
-                                                    "GMT+11:00",
-                                                    "Magadan Summer Time",
-                                                    "GMT+12:00",
-                                                    "Magadan Time",
-                                                    "GMT+11:00"},
-            {"Asia/Srednekolymsk",      Locale.FRANCE, "heure normale de Magadan",
-                                                    "UTC+11:00",
-                                                    "heure d’été de Magadan",
-                                                    "UTC+12:00",
-                                                    "heure de Magadan",
-                                                    "UTC+11:00"},
-            {"America/Punta_Arenas",    Locale.US, "Punta Arenas Standard Time",
-                                                    "GMT-03:00",
-                                                    "Punta Arenas Daylight Time",
-                                                    "GMT-02:00",
-                                                    "Punta Arenas Time",
-                                                    "GMT-03:00"},
-            {"America/Punta_Arenas",    Locale.FRANCE, "Punta Arenas (heure standard)",
-                                                    "UTC−03:00",
-                                                    "Punta Arenas (heure d’été)",
-                                                    "UTC−02:00",
-                                                    "heure : Punta Arenas",
-                                                    "UTC−03:00"},
-            {"Asia/Famagusta",          Locale.US, "Eastern European Standard Time",
-                                                    "EET",
-                                                    "Eastern European Summer Time",
-                                                    "EEST",
-                                                    "Eastern European Time",
-                                                    "EET"},
-            {"Asia/Famagusta",          Locale.FRANCE, "heure normale d’Europe de l’Est",
-                                                    "EET",
-                                                    "heure d’été d’Europe de l’Est",
-                                                    "EEST",
-                                                    "heure d’Europe de l’Est",
-                                                    "EET"},
-            {"Europe/Astrakhan",        Locale.US, "Samara Standard Time",
-                                                    "GMT+04:00",
-                                                    "Samara Summer Time",
-                                                    "GMT+05:00",
-                                                    "Samara Time",
-                                                    "GMT+04:00"},
-            {"Europe/Astrakhan",        Locale.FRANCE, "heure normale de Samara",
-                                                    "UTC+04:00",
-                                                    "heure d’été de Samara",
-                                                    "UTC+05:00",
-                                                    "heure de Samara",
-                                                    "UTC+04:00"},
-            {"Europe/Saratov",          Locale.US, "Samara Standard Time",
-                                                    "GMT+04:00",
-                                                    "Samara Summer Time",
-                                                    "GMT+05:00",
-                                                    "Samara Time",
-                                                    "GMT+04:00"},
-            {"Europe/Saratov",          Locale.FRANCE, "heure normale de Samara",
-                                                    "UTC+04:00",
-                                                    "heure d’été de Samara",
-                                                    "UTC+05:00",
-                                                    "heure de Samara",
-                                                    "UTC+04:00"},
-            {"Europe/Ulyanovsk",        Locale.US, "Samara Standard Time",
-                                                    "GMT+04:00",
-                                                    "Samara Summer Time",
-                                                    "GMT+05:00",
-                                                    "Samara Time",
-                                                    "GMT+04:00"},
-            {"Europe/Ulyanovsk",        Locale.FRANCE, "heure normale de Samara",
-                                                    "UTC+04:00",
-                                                    "heure d’été de Samara",
-                                                    "UTC+05:00",
-                                                    "heure de Samara",
-                                                    "UTC+04:00"},
-            {"Pacific/Bougainville",    Locale.US, "Bougainville Standard Time",
-                                                    "GMT+11:00",
-                                                    "Bougainville Daylight Time",
-                                                    "GMT+11:00",
-                                                    "Bougainville Time",
-                                                    "GMT+11:00"},
-            {"Pacific/Bougainville",    Locale.FRANCE, "Bougainville (heure standard)",
-                                                    "UTC+11:00",
-                                                    "Bougainville (heure d’été)",
-                                                    "UTC+11:00",
-                                                    "heure : Bougainville",
-                                                    "UTC+11:00"},
-            {"Europe/Istanbul",    Locale.US, "Türkiye Standard Time",
-                                                    "GMT+03:00",
-                                                    "Türkiye Summer Time",
-                                                    "GMT+04:00",
-                                                    "Türkiye Time",
-                                                    "GMT+03:00"},
-            {"Europe/Istanbul",    Locale.FRANCE, "heure normale de Turquie",
-                                                    "UTC+03:00",
-                                                    "heure avancée de Turquie",
-                                                    "UTC+04:00",
-                                                    "heure de Turquie",
-                                                    "UTC+03:00"},
-            {"Asia/Istanbul",    Locale.US, "Türkiye Standard Time",
-                                                    "GMT+03:00",
-                                                    "Türkiye Summer Time",
-                                                    "GMT+04:00",
-                                                    "Türkiye Time",
-                                                    "GMT+03:00"},
-            {"Asia/Istanbul",    Locale.FRANCE, "heure normale de Turquie",
-                                                    "UTC+03:00",
-                                                    "heure avancée de Turquie",
-                                                    "UTC+04:00",
-                                                    "heure de Turquie",
-                                                    "UTC+03:00"},
-            {"Turkey",    Locale.US, "Türkiye Standard Time",
-                                                    "GMT+03:00",
-                                                    "Türkiye Summer Time",
-                                                    "GMT+04:00",
-                                                    "Türkiye Time",
-                                                    "GMT+03:00"},
-            {"Turkey",    Locale.FRANCE, "heure normale de Turquie",
-                                                    "UTC+03:00",
-                                                    "heure avancée de Turquie",
-                                                    "UTC+04:00",
-                                                    "heure de Turquie",
-                                                    "UTC+03:00"},
+            {"Asia/Srednekolymsk", Locale.US,
+                "Magadan Standard Time",
+                "GMT+11:00",
+                "Magadan Summer Time",
+                "GMT+12:00",
+                "Magadan Time",
+                "GMT+11:00"},
+            {"Asia/Srednekolymsk", Locale.FRANCE,
+                "heure normale de Magadan",
+                "UTC+11:00",
+                "heure d’été de Magadan",
+                "UTC+12:00",
+                "heure de Magadan",
+                "UTC+11:00"},
+            {"America/Punta_Arenas", Locale.US,
+                "Punta Arenas Standard Time",
+                "GMT-03:00",
+                "Punta Arenas Daylight Time",
+                "GMT-02:00",
+                "Punta Arenas Time",
+                "GMT-03:00"},
+            {"America/Punta_Arenas", Locale.FRANCE,
+                "Punta Arenas (heure standard)",
+                "UTC−03:00",
+                "Punta Arenas (heure d’été)",
+                "UTC−02:00",
+                "heure : Punta Arenas",
+                "UTC−03:00"},
+            {"Asia/Famagusta", Locale.US,
+                "Eastern European Standard Time",
+                "EET",
+                "Eastern European Summer Time",
+                "EEST",
+                "Eastern European Time",
+                "EET"},
+            {"Asia/Famagusta", Locale.FRANCE,
+                "heure normale d’Europe de l’Est",
+                "EET",
+                "heure d’été d’Europe de l’Est",
+                "EEST",
+                "heure d’Europe de l’Est",
+                "EET"},
+            {"Europe/Astrakhan", Locale.US,
+                "Samara Standard Time",
+                "GMT+04:00",
+                "Samara Summer Time",
+                "GMT+05:00",
+                "Samara Time",
+                "GMT+04:00"},
+            {"Europe/Astrakhan", Locale.FRANCE,
+                "heure normale de Samara",
+                "UTC+04:00",
+                "heure d’été de Samara",
+                "UTC+05:00",
+                "heure de Samara",
+                "UTC+04:00"},
+            {"Europe/Saratov", Locale.US,
+                "Samara Standard Time",
+                "GMT+04:00",
+                "Samara Summer Time",
+                "GMT+05:00",
+                "Samara Time",
+                "GMT+04:00"},
+            {"Europe/Saratov", Locale.FRANCE,
+                "heure normale de Samara",
+                "UTC+04:00",
+                "heure d’été de Samara",
+                "UTC+05:00",
+                "heure de Samara",
+                "UTC+04:00"},
+            {"Europe/Ulyanovsk", Locale.US,
+                "Samara Standard Time",
+                "GMT+04:00",
+                "Samara Summer Time",
+                "GMT+05:00",
+                "Samara Time",
+                "GMT+04:00"},
+            {"Europe/Ulyanovsk", Locale.FRANCE,
+                "heure normale de Samara",
+                "UTC+04:00",
+                "heure d’été de Samara",
+                "UTC+05:00",
+                "heure de Samara",
+                "UTC+04:00"},
+            {"Pacific/Bougainville", Locale.US,
+                "Bougainville Standard Time",
+                "GMT+11:00",
+                "Bougainville Daylight Time",
+                "GMT+11:00",
+                "Bougainville Time",
+                "GMT+11:00"},
+            {"Pacific/Bougainville", Locale.FRANCE,
+                "Bougainville (heure standard)",
+                "UTC+11:00",
+                "Bougainville (heure d’été)",
+                "UTC+11:00",
+                "heure : Bougainville",
+                "UTC+11:00"},
+            {"Europe/Istanbul", Locale.US,
+                "Türkiye Standard Time",
+                "GMT+03:00",
+                "Türkiye Summer Time",
+                "GMT+04:00",
+                "Türkiye Time",
+                "GMT+03:00"},
+            {"Europe/Istanbul", Locale.FRANCE,
+                "heure normale de Turquie",
+                "UTC+03:00",
+                "heure avancée de Turquie",
+                "UTC+04:00",
+                "heure de Turquie",
+                "UTC+03:00"},
+            {"Asia/Istanbul", Locale.US,
+                "Türkiye Standard Time",
+                "GMT+03:00",
+                "Türkiye Summer Time",
+                "GMT+04:00",
+                "Türkiye Time",
+                "GMT+03:00"},
+            {"Asia/Istanbul", Locale.FRANCE,
+                "heure normale de Turquie",
+                "UTC+03:00",
+                "heure avancée de Turquie",
+                "UTC+04:00",
+                "heure de Turquie",
+                "UTC+03:00"},
+            {"Turkey", Locale.US,
+                "Türkiye Standard Time",
+                "GMT+03:00",
+                "Türkiye Summer Time",
+                "GMT+04:00",
+                "Türkiye Time",
+                "GMT+03:00"},
+            {"Turkey", Locale.FRANCE,
+                "heure normale de Turquie",
+                "UTC+03:00",
+                "heure avancée de Turquie",
+                "UTC+04:00",
+                "heure de Turquie",
+                "UTC+03:00"},
 
             // Short names derived from TZDB at build time
-            {"Europe/Lisbon",    Locale.US, "Western European Standard Time",
-                        "WET",
-                        "Western European Summer Time",
-                        "WEST",
-                        "Western European Time",
-                        "WET"},
-            {"Atlantic/Azores",    Locale.US, "Azores Standard Time",
-                        "GMT-01:00",
-                        "Azores Summer Time",
-                        "GMT",
-                        "Azores Time",
-                        "GMT-01:00"},
-            {"Australia/Perth",    Locale.US, "Australian Western Standard Time",
-                        "AWST",
-                        "Australian Western Daylight Time",
-                        "AWDT",
-                        "Australian Western Time",
-                        "AWT"},
-            {"Africa/Harare",    Locale.US, "Central Africa Time",
-                        "CAT",
-                        "Harare Daylight Time",
-                        "CAT",
-                        "Harare Time",
-                        "CAT"},
-            {"Europe/Dublin",    Locale.US, "Greenwich Mean Time",
-                        "GMT",
-                        "Irish Standard Time",
-                        "IST",
-                        "Dublin Time",
-                        "GMT"},
-            {"Pacific/Gambier",    Locale.US, "Gambier Time",
-                        "GMT-09:00",
-                        "Gambier Daylight Time",
-                        "GMT-09:00",
-                        "Gambier Time",
-                        "GMT-09:00"},
+            {"Europe/Lisbon", Locale.US,
+                "Western European Standard Time",
+                "WET",
+                "Western European Summer Time",
+                "WEST",
+                "Western European Time",
+                "WET"},
+            {"Atlantic/Azores", Locale.US,
+                "Azores Standard Time",
+                "GMT-01:00",
+                "Azores Summer Time",
+                "GMT",
+                "Azores Time",
+                "GMT-01:00"},
+            {"Australia/Perth", Locale.US,
+                "Australian Western Standard Time",
+                "AWST",
+                "Australian Western Daylight Time",
+                "AWDT",
+                "Australian Western Time",
+                "AWT"},
+            {"Africa/Harare", Locale.US,
+                "Central Africa Time",
+                "CAT",
+                "Harare Daylight Time",
+                "CAT",
+                "Harare Time",
+                "CAT"},
+            {"Europe/Dublin", Locale.US,
+                "Greenwich Mean Time",
+                "GMT",
+                "Irish Standard Time",
+                "IST",
+                "Dublin Time",
+                "GMT"},
+            {"Pacific/Gambier", Locale.US,
+                "Gambier Time",
+                "GMT-09:00",
+                "Gambier Daylight Time",
+                "GMT-09:00",
+                "Gambier Time",
+                "GMT-09:00"},
+            {"America/New_York", Locale.US,
+                "Eastern Standard Time",
+                "EST",
+                "Eastern Daylight Time",
+                "EDT",
+                "Eastern Time",
+                "ET"},
+            {"America/New_York", Locale.GERMAN,
+                "Nordamerikanische Ostküsten-Normalzeit",
+                "EST",
+                "Nordamerikanische Ostküsten-Sommerzeit",
+                "EDT",
+                "Nordamerikanische Ostküstenzeit",
+                "ET"},
+            {"America/New_York", Locale.JAPANESE,
+                "米国東部標準時",
+                "EST",
+                "米国東部夏時間",
+                "EDT",
+                "米国東部時間",
+                "ET"},
+            {"America/New_York", Locale.of("ru"),
+                "Восточная Америка, стандартное время",
+                "EST",
+                "Восточная Америка, летнее время",
+                "EDT",
+                "Восточная Америка",
+                "ET"},
         };
     }
 

From 44c484c150e66d3be3e865d52601388133380063 Mon Sep 17 00:00:00 2001
From: Ashutosh Mehra <asmehra@openjdk.org>
Date: Tue, 14 Apr 2026 18:08:23 +0000
Subject: [PATCH 593/655] 8381677: Remove dependence of UseSHA on
 UseSHAIntrinsics

Reviewed-by: kvn, adinn, mdoerr, fyang, amitkumar
---
 .../cpu/aarch64/vm_version_aarch64.cpp        |  4 ---
 src/hotspot/cpu/ppc/vm_version_ppc.cpp        |  5 ----
 src/hotspot/cpu/riscv/vm_version_riscv.cpp    |  5 ----
 src/hotspot/cpu/s390/vm_version_s390.cpp      |  4 ---
 src/hotspot/cpu/x86/vm_version_x86.cpp        |  4 ---
 ...UseSHASpecificTestCaseForSupportedCPU.java | 27 +++----------------
 6 files changed, 3 insertions(+), 46 deletions(-)

diff --git a/src/hotspot/cpu/aarch64/vm_version_aarch64.cpp b/src/hotspot/cpu/aarch64/vm_version_aarch64.cpp
index 15af2d5c4e2..441bd4859fe 100644
--- a/src/hotspot/cpu/aarch64/vm_version_aarch64.cpp
+++ b/src/hotspot/cpu/aarch64/vm_version_aarch64.cpp
@@ -437,10 +437,6 @@ void VM_Version::initialize() {
     FLAG_SET_DEFAULT(UseSHA512Intrinsics, false);
   }
 
-  if (!(UseSHA1Intrinsics || UseSHA256Intrinsics || UseSHA3Intrinsics || UseSHA512Intrinsics)) {
-    FLAG_SET_DEFAULT(UseSHA, false);
-  }
-
   if (supports_pmull()) {
     if (FLAG_IS_DEFAULT(UseGHASHIntrinsics)) {
       FLAG_SET_DEFAULT(UseGHASHIntrinsics, true);
diff --git a/src/hotspot/cpu/ppc/vm_version_ppc.cpp b/src/hotspot/cpu/ppc/vm_version_ppc.cpp
index 0b69ef7d25a..3e3b1103c86 100644
--- a/src/hotspot/cpu/ppc/vm_version_ppc.cpp
+++ b/src/hotspot/cpu/ppc/vm_version_ppc.cpp
@@ -311,11 +311,6 @@ void VM_Version::initialize() {
     FLAG_SET_DEFAULT(UseSHA3Intrinsics, false);
   }
 
-  if (!(UseSHA1Intrinsics || UseSHA256Intrinsics || UseSHA512Intrinsics)) {
-    FLAG_SET_DEFAULT(UseSHA, false);
-  }
-
-
 #ifdef COMPILER2
   if (FLAG_IS_DEFAULT(UseSquareToLenIntrinsic)) {
     UseSquareToLenIntrinsic = true;
diff --git a/src/hotspot/cpu/riscv/vm_version_riscv.cpp b/src/hotspot/cpu/riscv/vm_version_riscv.cpp
index 36f0864da0b..3a6415d52bd 100644
--- a/src/hotspot/cpu/riscv/vm_version_riscv.cpp
+++ b/src/hotspot/cpu/riscv/vm_version_riscv.cpp
@@ -420,11 +420,6 @@ void VM_Version::c2_initialize() {
     FLAG_SET_DEFAULT(UseSHA3Intrinsics, false);
   }
 
-  // UseSHA
-  if (!(UseSHA1Intrinsics || UseSHA256Intrinsics || UseSHA3Intrinsics || UseSHA512Intrinsics)) {
-    FLAG_SET_DEFAULT(UseSHA, false);
-  }
-
   // AES
   if (UseZvkn) {
     UseAES = UseAES || FLAG_IS_DEFAULT(UseAES);
diff --git a/src/hotspot/cpu/s390/vm_version_s390.cpp b/src/hotspot/cpu/s390/vm_version_s390.cpp
index 7f5b4870aab..7e9000991ca 100644
--- a/src/hotspot/cpu/s390/vm_version_s390.cpp
+++ b/src/hotspot/cpu/s390/vm_version_s390.cpp
@@ -289,10 +289,6 @@ void VM_Version::initialize() {
     FLAG_SET_DEFAULT(UseSHA3Intrinsics, false);
   }
 
-  if (!(UseSHA1Intrinsics || UseSHA256Intrinsics || UseSHA512Intrinsics)) {
-    FLAG_SET_DEFAULT(UseSHA, false);
-  }
-
   if (UseSecondarySupersTable && VM_Version::get_model_index() < 5 /* z196/z11 */) {
     if (!FLAG_IS_DEFAULT(UseSecondarySupersTable)) {
       warning("UseSecondarySupersTable requires z196 or later.");
diff --git a/src/hotspot/cpu/x86/vm_version_x86.cpp b/src/hotspot/cpu/x86/vm_version_x86.cpp
index 39a9c618350..a688d834e9b 100644
--- a/src/hotspot/cpu/x86/vm_version_x86.cpp
+++ b/src/hotspot/cpu/x86/vm_version_x86.cpp
@@ -1373,10 +1373,6 @@ void VM_Version::get_processor_features() {
     FLAG_SET_DEFAULT(UseSHA3Intrinsics, false);
   }
 
-  if (!(UseSHA1Intrinsics || UseSHA256Intrinsics || UseSHA512Intrinsics || UseSHA3Intrinsics)) {
-    FLAG_SET_DEFAULT(UseSHA, false);
-  }
-
 #if COMPILER2_OR_JVMCI
   int max_vector_size = 0;
   if (UseAVX == 0 || !os_supports_avx_vectors()) {
diff --git a/test/hotspot/jtreg/compiler/intrinsics/sha/cli/testcases/UseSHASpecificTestCaseForSupportedCPU.java b/test/hotspot/jtreg/compiler/intrinsics/sha/cli/testcases/UseSHASpecificTestCaseForSupportedCPU.java
index ddcfc7c5f7b..65f3e9b9141 100644
--- a/test/hotspot/jtreg/compiler/intrinsics/sha/cli/testcases/UseSHASpecificTestCaseForSupportedCPU.java
+++ b/test/hotspot/jtreg/compiler/intrinsics/sha/cli/testcases/UseSHASpecificTestCaseForSupportedCPU.java
@@ -73,10 +73,10 @@ public class UseSHASpecificTestCaseForSupportedCPU
 
     @Override
     protected void verifyOptionValues() throws Throwable {
-        // Verify that UseSHA is disabled when all UseSHA*Intrinsics are
-        // disabled.
+        // Verify that UseSHA is not affected and remains enabled when all UseSHA*Intrinsics
+        // are disabled.
         CommandLineOptionTest.verifyOptionValueForSameVM(
-                DigestOptionsBase.USE_SHA_OPTION, "false", String.format(
+                DigestOptionsBase.USE_SHA_OPTION, "true", String.format(
                 "'%s' option should be disabled when all UseSHA*Intrinsics are"
                         + " disabled", DigestOptionsBase.USE_SHA_OPTION),
                 DigestOptionsBase.UNLOCK_DIAGNOSTIC_VM_OPTIONS,
@@ -89,27 +89,6 @@ public class UseSHASpecificTestCaseForSupportedCPU
                 CommandLineOptionTest.prepareBooleanFlag(
                         DigestOptionsBase.USE_SHA3_INTRINSICS_OPTION, false));
 
-        CommandLineOptionTest.verifyOptionValueForSameVM(
-                // Verify that UseSHA is disabled when all UseSHA*Intrinsics are
-                // disabled even if it was explicitly enabled.
-                DigestOptionsBase.USE_SHA_OPTION, "false",
-                String.format("'%s' option should be disabled when all "
-                        + "UseSHA*Intrinsics are disabled even if %s flag set "
-                        + "to JVM", DigestOptionsBase.USE_SHA_OPTION,
-                        CommandLineOptionTest.prepareBooleanFlag(
-                             DigestOptionsBase.USE_SHA_OPTION, true)),
-                DigestOptionsBase.UNLOCK_DIAGNOSTIC_VM_OPTIONS,
-                CommandLineOptionTest.prepareBooleanFlag(
-                        DigestOptionsBase.USE_SHA_OPTION, true),
-                CommandLineOptionTest.prepareBooleanFlag(
-                        DigestOptionsBase.USE_SHA1_INTRINSICS_OPTION, false),
-                CommandLineOptionTest.prepareBooleanFlag(
-                        DigestOptionsBase.USE_SHA256_INTRINSICS_OPTION, false),
-                CommandLineOptionTest.prepareBooleanFlag(
-                        DigestOptionsBase.USE_SHA512_INTRINSICS_OPTION, false),
-                CommandLineOptionTest.prepareBooleanFlag(
-                        DigestOptionsBase.USE_SHA3_INTRINSICS_OPTION, false));
-
         // Verify that explicitly disabled UseSHA option remains disabled even
         // if all UseSHA*Intrinsics options were enabled.
         CommandLineOptionTest.verifyOptionValueForSameVM(

From bf68776ebcdcbb97faf21517efb3a5e025b29269 Mon Sep 17 00:00:00 2001
From: Ashutosh Mehra <asmehra@openjdk.org>
Date: Tue, 14 Apr 2026 19:39:32 +0000
Subject: [PATCH 594/655] 8382167: Warning message should be displayed only
 when UseAESCTRIntrinsics is explicitly enabled by the user

Reviewed-by: sviswanathan, kvn
---
 src/hotspot/cpu/x86/vm_version_x86.cpp | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/src/hotspot/cpu/x86/vm_version_x86.cpp b/src/hotspot/cpu/x86/vm_version_x86.cpp
index a688d834e9b..cf9de40a237 100644
--- a/src/hotspot/cpu/x86/vm_version_x86.cpp
+++ b/src/hotspot/cpu/x86/vm_version_x86.cpp
@@ -1187,7 +1187,7 @@ void VM_Version::get_processor_features() {
     }
     if (!UseAESIntrinsics) {
       if (UseAESCTRIntrinsics) {
-        if (FLAG_IS_DEFAULT(UseAESCTRIntrinsics)) {
+        if (!FLAG_IS_DEFAULT(UseAESCTRIntrinsics)) {
           warning("AES-CTR intrinsics require UseAESIntrinsics flag to be enabled. Intrinsics will be disabled.");
         }
         FLAG_SET_DEFAULT(UseAESCTRIntrinsics, false);

From 764fc09bed335173c2cb4180c946e8593f023ae8 Mon Sep 17 00:00:00 2001
From: William Kemper <wkemper@openjdk.org>
Date: Tue, 14 Apr 2026 20:23:46 +0000
Subject: [PATCH 595/655] 8381643: Shenandoah: Remove duplicate region
 filtering logic

Reviewed-by: kdnilsen, ruili, xpeng
---
 .../shenandoahGenerationalHeuristics.cpp      | 130 ++++--------------
 .../shenandoahGenerationalHeuristics.hpp      |  15 +-
 .../heuristics/shenandoahGlobalHeuristics.cpp |   6 +-
 .../heuristics/shenandoahGlobalHeuristics.hpp |   6 +-
 .../heuristics/shenandoahHeuristics.cpp       |  12 +-
 .../heuristics/shenandoahSpaceInfo.hpp        |   5 +
 .../heuristics/shenandoahYoungHeuristics.cpp  |   6 +-
 .../heuristics/shenandoahYoungHeuristics.hpp  |   6 +-
 .../gc/shenandoah/mode/shenandoahMode.cpp     |   1 -
 .../gc/shenandoah/shenandoahGeneration.cpp    |   1 +
 .../gc/shenandoah/shenandoahGeneration.hpp    |   2 +-
 .../gc/shenandoah/shenandoahOldGeneration.hpp |   5 +
 .../share/gc/shenandoah/shenandoahTrace.cpp   |  32 +++--
 .../share/gc/shenandoah/shenandoahTrace.hpp   |  11 +-
 src/hotspot/share/jfr/metadata/metadata.xml   |  12 +-
 src/jdk.jfr/share/conf/jfr/default.jfc        |   4 +
 src/jdk.jfr/share/conf/jfr/profile.jfc        |   4 +
 ...tShenandoahEvacuationInformationEvent.java |   4 +-
 ...stShenandoahPromotionInformationEvent.java | 100 ++++++++++++++
 test/lib/jdk/test/lib/jfr/EventNames.java     |   1 +
 20 files changed, 216 insertions(+), 147 deletions(-)
 create mode 100644 test/jdk/jdk/jfr/event/gc/detailed/TestShenandoahPromotionInformationEvent.java

diff --git a/src/hotspot/share/gc/shenandoah/heuristics/shenandoahGenerationalHeuristics.cpp b/src/hotspot/share/gc/shenandoah/heuristics/shenandoahGenerationalHeuristics.cpp
index a12f48c0877..594367e2972 100644
--- a/src/hotspot/share/gc/shenandoah/heuristics/shenandoahGenerationalHeuristics.cpp
+++ b/src/hotspot/share/gc/shenandoah/heuristics/shenandoahGenerationalHeuristics.cpp
@@ -69,15 +69,27 @@ ShenandoahGenerationalHeuristics::ShenandoahGenerationalHeuristics(ShenandoahGen
         : ShenandoahAdaptiveHeuristics(generation), _generation(generation), _add_regions_to_old(0) {
 }
 
-void ShenandoahGenerationalHeuristics::choose_collection_set(ShenandoahCollectionSet* collection_set) {
+void ShenandoahGenerationalHeuristics::choose_collection_set_from_regiondata(ShenandoahCollectionSet* collection_set,
+                                                                             RegionData* data, size_t data_size,
+                                                                             size_t free) {
   ShenandoahGenerationalHeap* heap = ShenandoahGenerationalHeap::heap();
 
-  assert(collection_set->is_empty(), "Collection set must be empty here");
-
   _add_regions_to_old = 0;
 
-  // Choose the collection set
-  filter_regions(collection_set);
+  // Find the amount that will be promoted, regions that will be promoted in
+  // place, and preselected older regions that will be promoted by evacuation.
+  ShenandoahInPlacePromotionPlanner in_place_promotions(heap);
+  compute_evacuation_budgets(in_place_promotions, heap);
+
+  // Call the subclasses to add regions into the collection set.
+  select_collection_set_regions(collection_set, data, data_size, free);
+
+  // Even if collection_set->is_empty(), we want to adjust budgets, making reserves available to mutator.
+  adjust_evacuation_budgets(heap, collection_set);
+
+  if (collection_set->has_old_regions()) {
+    heap->shenandoah_policy()->record_mixed_cycle();
+  }
 
   if (_generation->is_global()) {
     // We have just chosen a collection set for a global cycle. The mark bitmap covering old regions is complete, so
@@ -91,6 +103,14 @@ void ShenandoahGenerationalHeuristics::choose_collection_set(ShenandoahCollectio
     // after a global cycle for old regions that were not included in this collection set.
     heap->old_generation()->transition_old_generation_after_global_gc();
   }
+
+  ShenandoahTracer::report_promotion_info(collection_set,
+                                          in_place_promotions.humongous_region_stats().count,
+                                          in_place_promotions.humongous_region_stats().garbage,
+                                          in_place_promotions.humongous_region_stats().free,
+                                          in_place_promotions.regular_region_stats().count,
+                                          in_place_promotions.regular_region_stats().garbage,
+                                          in_place_promotions.regular_region_stats().free);
 }
 
 void ShenandoahGenerationalHeuristics::compute_evacuation_budgets(ShenandoahInPlacePromotionPlanner& in_place_promotions,
@@ -216,106 +236,6 @@ void ShenandoahGenerationalHeuristics::compute_evacuation_budgets(ShenandoahInPl
   // case of a GLOBAL gc.  During choose_collection_set() of GLOBAL, old will be expanded on demand.
 }
 
-void ShenandoahGenerationalHeuristics::filter_regions(ShenandoahCollectionSet* collection_set) {
-  auto heap = ShenandoahGenerationalHeap::heap();
-  const size_t region_size_bytes = ShenandoahHeapRegion::region_size_bytes();
-
-  // Check all pinned regions have updated status before choosing the collection set.
-  heap->assert_pinned_region_status(_generation);
-
-  // Step 1. Build up the region candidates we care about, rejecting losers and accepting winners right away.
-
-  const size_t num_regions = heap->num_regions();
-
-  RegionData* candidates = _region_data;
-
-  size_t cand_idx = 0;
-
-  size_t total_garbage = 0;
-
-  size_t immediate_garbage = 0;
-  size_t immediate_regions = 0;
-
-  size_t free = 0;
-  size_t free_regions = 0;
-
-  for (size_t i = 0; i < num_regions; i++) {
-    ShenandoahHeapRegion* region = heap->get_region(i);
-    if (!_generation->contains(region)) {
-      continue;
-    }
-    const size_t garbage = region->garbage();
-    total_garbage += garbage;
-    if (region->is_empty()) {
-      free_regions++;
-      free += region_size_bytes;
-    } else if (region->is_regular()) {
-      if (!region->has_live()) {
-        // We can recycle it right away and put it in the free set.
-        immediate_regions++;
-        immediate_garbage += garbage;
-        region->make_trash_immediate();
-      } else {
-        // This is our candidate for later consideration. Note that this region
-        // could still be promoted in place and may not necessarily end up in the
-        // collection set.
-        assert(region->get_top_before_promote() == nullptr, "Cannot add region %zu scheduled for in-place-promotion to the collection set", i);
-        candidates[cand_idx].set_region_and_garbage(region, garbage);
-        cand_idx++;
-      }
-    } else if (region->is_humongous_start()) {
-      // Reclaim humongous regions here, and count them as the immediate garbage
-      DEBUG_ONLY(assert_humongous_mark_consistency(region));
-      if (!region->has_live()) {
-        heap->trash_humongous_region_at(region);
-
-        // Count only the start. Continuations would be counted on "trash" path
-        immediate_regions++;
-        immediate_garbage += garbage;
-      }
-    } else if (region->is_trash()) {
-      // Count in just trashed humongous continuation regions
-      immediate_regions++;
-      immediate_garbage += garbage;
-    }
-  }
-
-  // Step 2. Look back at garbage statistics, and decide if we want to collect anything,
-  // given the amount of immediately reclaimable garbage. If we do, figure out the collection set.
-  assert(immediate_garbage <= total_garbage,
-         "Cannot have more immediate garbage than total garbage: " PROPERFMT " vs " PROPERFMT,
-         PROPERFMTARGS(immediate_garbage), PROPERFMTARGS(total_garbage));
-
-  const size_t immediate_percent = (total_garbage == 0) ? 0 : (immediate_garbage * 100 / total_garbage);
-  ShenandoahInPlacePromotionPlanner in_place_promotions(heap);
-  if (immediate_percent <= ShenandoahImmediateThreshold) {
-
-    // Find the amount that will be promoted, regions that will be promoted in
-    // place, and preselected older regions that will be promoted by evacuation.
-    compute_evacuation_budgets(in_place_promotions, heap);
-
-    // Call the subclasses to add young-gen regions into the collection set.
-    choose_collection_set_from_regiondata(collection_set, candidates, cand_idx, immediate_garbage + free);
-
-    // Even if collection_set->is_empty(), we want to adjust budgets, making reserves available to mutator.
-    adjust_evacuation_budgets(heap, collection_set);
-
-    if (collection_set->has_old_regions()) {
-      heap->shenandoah_policy()->record_mixed_cycle();
-    }
-  }
-
-  collection_set->summarize(total_garbage, immediate_garbage, immediate_regions);
-  ShenandoahTracer::report_evacuation_info(collection_set,
-                                           free_regions,
-                                           in_place_promotions.humongous_region_stats().count,
-                                           in_place_promotions.regular_region_stats().count,
-                                           in_place_promotions.regular_region_stats().garbage,
-                                           in_place_promotions.regular_region_stats().free,
-                                           immediate_regions,
-                                           immediate_garbage);
-}
-
 void ShenandoahGenerationalHeuristics::add_tenured_regions_to_collection_set(const size_t old_promotion_reserve,
                                                                                ShenandoahGenerationalHeap *const heap,
                                                                                size_t candidates, AgedRegionData* sorted_regions) {
diff --git a/src/hotspot/share/gc/shenandoah/heuristics/shenandoahGenerationalHeuristics.hpp b/src/hotspot/share/gc/shenandoah/heuristics/shenandoahGenerationalHeuristics.hpp
index 1a47cb756f4..8ea5cdb36c8 100644
--- a/src/hotspot/share/gc/shenandoah/heuristics/shenandoahGenerationalHeuristics.hpp
+++ b/src/hotspot/share/gc/shenandoah/heuristics/shenandoahGenerationalHeuristics.hpp
@@ -53,10 +53,13 @@ class ShenandoahGenerationalHeuristics : public ShenandoahAdaptiveHeuristics {
 public:
   explicit ShenandoahGenerationalHeuristics(ShenandoahGeneration* generation);
 
-  void choose_collection_set(ShenandoahCollectionSet* collection_set) override;
-
   void post_initialize() override;
 
+  // Wraps budget computation, subclass region selection, budget adjustment, and tracing.
+  void choose_collection_set_from_regiondata(ShenandoahCollectionSet* set,
+                                             RegionData* data, size_t data_size,
+                                             size_t free) override;
+
 private:
   // Compute evacuation budgets prior to choosing collection set.
   void compute_evacuation_budgets(ShenandoahInPlacePromotionPlanner& in_place_promotions, ShenandoahHeap* const heap);
@@ -84,15 +87,17 @@ private:
                                              ShenandoahGenerationalHeap *const heap,
                                              size_t candidates, AgedRegionData* sorted_regions);
 
-  // Filter and sort remaining regions before adding to collection set.
-  void filter_regions(ShenandoahCollectionSet* collection_set);
-
   // Adjust evacuation budgets after choosing collection set.  On entry, the instance variable _regions_to_xfer
   // represents regions to be transferred to old based on decisions made in top_off_collection_set()
   void adjust_evacuation_budgets(ShenandoahHeap* const heap,
                                  ShenandoahCollectionSet* const collection_set);
 
 protected:
+  // Subclasses override this to perform generation-specific region selection.
+  virtual void select_collection_set_regions(ShenandoahCollectionSet* set,
+                                             RegionData* data, size_t data_size,
+                                             size_t free) = 0;
+
   ShenandoahGeneration* _generation;
 
   size_t _add_regions_to_old;
diff --git a/src/hotspot/share/gc/shenandoah/heuristics/shenandoahGlobalHeuristics.cpp b/src/hotspot/share/gc/shenandoah/heuristics/shenandoahGlobalHeuristics.cpp
index ed25cd2e1a9..9452e8b28cb 100644
--- a/src/hotspot/share/gc/shenandoah/heuristics/shenandoahGlobalHeuristics.cpp
+++ b/src/hotspot/share/gc/shenandoah/heuristics/shenandoahGlobalHeuristics.cpp
@@ -112,9 +112,9 @@ ShenandoahGlobalHeuristics::ShenandoahGlobalHeuristics(ShenandoahGlobalGeneratio
         : ShenandoahGenerationalHeuristics(generation) {
 }
 
-void ShenandoahGlobalHeuristics::choose_collection_set_from_regiondata(ShenandoahCollectionSet* cset,
-                                                                       RegionData* data, size_t size,
-                                                                       size_t actual_free) {
+void ShenandoahGlobalHeuristics::select_collection_set_regions(ShenandoahCollectionSet* cset,
+                                                               RegionData* data, size_t size,
+                                                               size_t actual_free) {
   QuickSort::sort<RegionData>(data, size, compare_by_garbage);
   choose_global_collection_set(cset, data, size, actual_free, 0);
 }
diff --git a/src/hotspot/share/gc/shenandoah/heuristics/shenandoahGlobalHeuristics.hpp b/src/hotspot/share/gc/shenandoah/heuristics/shenandoahGlobalHeuristics.hpp
index 8102fa24d14..1e96a665704 100644
--- a/src/hotspot/share/gc/shenandoah/heuristics/shenandoahGlobalHeuristics.hpp
+++ b/src/hotspot/share/gc/shenandoah/heuristics/shenandoahGlobalHeuristics.hpp
@@ -161,9 +161,9 @@ class ShenandoahGlobalHeuristics : public ShenandoahGenerationalHeuristics {
 public:
   ShenandoahGlobalHeuristics(ShenandoahGlobalGeneration* generation);
 
-  void choose_collection_set_from_regiondata(ShenandoahCollectionSet* cset,
-                                             RegionData* data, size_t size,
-                                             size_t actual_free) override;
+  void select_collection_set_regions(ShenandoahCollectionSet* cset,
+                                     RegionData* data, size_t size,
+                                     size_t actual_free) override;
 
 private:
   void choose_global_collection_set(ShenandoahCollectionSet* cset,
diff --git a/src/hotspot/share/gc/shenandoah/heuristics/shenandoahHeuristics.cpp b/src/hotspot/share/gc/shenandoah/heuristics/shenandoahHeuristics.cpp
index 895088381ee..3091b19b600 100644
--- a/src/hotspot/share/gc/shenandoah/heuristics/shenandoahHeuristics.cpp
+++ b/src/hotspot/share/gc/shenandoah/heuristics/shenandoahHeuristics.cpp
@@ -29,6 +29,7 @@
 #include "gc/shenandoah/shenandoahCollectorPolicy.hpp"
 #include "gc/shenandoah/shenandoahHeapRegion.inline.hpp"
 #include "gc/shenandoah/shenandoahMarkingContext.inline.hpp"
+#include "gc/shenandoah/shenandoahTrace.hpp"
 #include "logging/log.hpp"
 #include "logging/logTag.hpp"
 #include "runtime/globals_extension.hpp"
@@ -79,10 +80,6 @@ void ShenandoahHeuristics::choose_collection_set(ShenandoahCollectionSet* collec
   ShenandoahHeap* heap = ShenandoahHeap::heap();
 
   assert(collection_set->is_empty(), "Must be empty");
-  assert(!heap->mode()->is_generational(), "Wrong heuristic for heap mode");
-
-  // Check all pinned regions have updated status before choosing the collection set.
-  heap->assert_pinned_region_status();
 
   // Step 1. Build up the region candidates we care about, rejecting losers and accepting winners right away.
 
@@ -103,6 +100,10 @@ void ShenandoahHeuristics::choose_collection_set(ShenandoahCollectionSet* collec
   for (size_t i = 0; i < num_regions; i++) {
     ShenandoahHeapRegion* region = heap->get_region(i);
 
+    if (!_space_info->contains(region)) {
+      continue;
+    }
+
     size_t garbage = region->garbage();
     total_garbage += garbage;
 
@@ -117,6 +118,8 @@ void ShenandoahHeuristics::choose_collection_set(ShenandoahCollectionSet* collec
         region->make_trash_immediate();
       } else {
         // This is our candidate for later consideration.
+        assert(region->get_top_before_promote() == nullptr,
+               "Cannot add region %zu scheduled for in-place-promotion to the collection set", i);
         candidates[cand_idx].set_region_and_garbage(region, garbage);
         cand_idx++;
       }
@@ -149,6 +152,7 @@ void ShenandoahHeuristics::choose_collection_set(ShenandoahCollectionSet* collec
     choose_collection_set_from_regiondata(collection_set, candidates, cand_idx, immediate_garbage + free);
   }
   collection_set->summarize(total_garbage, immediate_garbage, immediate_regions);
+  ShenandoahTracer::report_evacuation_info(collection_set, free_regions, immediate_regions, immediate_garbage);
 }
 
 void ShenandoahHeuristics::start_idle_span() {
diff --git a/src/hotspot/share/gc/shenandoah/heuristics/shenandoahSpaceInfo.hpp b/src/hotspot/share/gc/shenandoah/heuristics/shenandoahSpaceInfo.hpp
index 6ed05abf0b1..765061a43ed 100644
--- a/src/hotspot/share/gc/shenandoah/heuristics/shenandoahSpaceInfo.hpp
+++ b/src/hotspot/share/gc/shenandoah/heuristics/shenandoahSpaceInfo.hpp
@@ -27,6 +27,8 @@
 
 #include "utilities/globalDefinitions.hpp"
 
+class ShenandoahHeapRegion;
+
 /*
  * The purpose of this interface is to decouple the heuristics from a
  * direct dependency on the ShenandoahHeap singleton instance. This is
@@ -46,6 +48,9 @@ public:
   // in time within each GC cycle.  For certain GC cycles, the value returned may include some bytes allocated before
   // the start of the current GC cycle.
   virtual size_t bytes_allocated_since_gc_start() const = 0;
+
+  // Return true if this region belongs to this space.
+  virtual bool contains(ShenandoahHeapRegion* region) const = 0;
 };
 
 #endif //SHARE_GC_SHENANDOAH_HEURISTICS_SHENANDOAHSPACEINFO_HPP
diff --git a/src/hotspot/share/gc/shenandoah/heuristics/shenandoahYoungHeuristics.cpp b/src/hotspot/share/gc/shenandoah/heuristics/shenandoahYoungHeuristics.cpp
index 68ffb6592db..27aa9a47510 100644
--- a/src/hotspot/share/gc/shenandoah/heuristics/shenandoahYoungHeuristics.cpp
+++ b/src/hotspot/share/gc/shenandoah/heuristics/shenandoahYoungHeuristics.cpp
@@ -37,9 +37,9 @@ ShenandoahYoungHeuristics::ShenandoahYoungHeuristics(ShenandoahYoungGeneration*
 }
 
 
-void ShenandoahYoungHeuristics::choose_collection_set_from_regiondata(ShenandoahCollectionSet* cset,
-                                                                      RegionData* data, size_t size,
-                                                                      size_t actual_free) {
+void ShenandoahYoungHeuristics::select_collection_set_regions(ShenandoahCollectionSet* cset,
+                                                              RegionData* data, size_t size,
+                                                              size_t actual_free) {
   // See comments in ShenandoahAdaptiveHeuristics::choose_collection_set_from_regiondata():
   // we do the same here, but with the following adjustments for generational mode:
   //
diff --git a/src/hotspot/share/gc/shenandoah/heuristics/shenandoahYoungHeuristics.hpp b/src/hotspot/share/gc/shenandoah/heuristics/shenandoahYoungHeuristics.hpp
index 806cef673d5..8fabc40693c 100644
--- a/src/hotspot/share/gc/shenandoah/heuristics/shenandoahYoungHeuristics.hpp
+++ b/src/hotspot/share/gc/shenandoah/heuristics/shenandoahYoungHeuristics.hpp
@@ -38,9 +38,9 @@ public:
   explicit ShenandoahYoungHeuristics(ShenandoahYoungGeneration* generation);
 
 
-  void choose_collection_set_from_regiondata(ShenandoahCollectionSet* cset,
-                                             RegionData* data, size_t size,
-                                             size_t actual_free) override;
+  void select_collection_set_regions(ShenandoahCollectionSet* cset,
+                                     RegionData* data, size_t size,
+                                     size_t actual_free) override;
 
   bool should_start_gc() override;
 
diff --git a/src/hotspot/share/gc/shenandoah/mode/shenandoahMode.cpp b/src/hotspot/share/gc/shenandoah/mode/shenandoahMode.cpp
index 5ef21719ed4..1c2c15c40dc 100644
--- a/src/hotspot/share/gc/shenandoah/mode/shenandoahMode.cpp
+++ b/src/hotspot/share/gc/shenandoah/mode/shenandoahMode.cpp
@@ -26,7 +26,6 @@
 #include "gc/shenandoah/heuristics/shenandoahAdaptiveHeuristics.hpp"
 #include "gc/shenandoah/heuristics/shenandoahAggressiveHeuristics.hpp"
 #include "gc/shenandoah/heuristics/shenandoahCompactHeuristics.hpp"
-#include "gc/shenandoah/heuristics/shenandoahSpaceInfo.hpp"
 #include "gc/shenandoah/heuristics/shenandoahStaticHeuristics.hpp"
 #include "gc/shenandoah/mode/shenandoahMode.hpp"
 
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahGeneration.cpp b/src/hotspot/share/gc/shenandoah/shenandoahGeneration.cpp
index 3d592e9f9be..7d082e4a8b0 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahGeneration.cpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahGeneration.cpp
@@ -301,6 +301,7 @@ void ShenandoahGeneration::prepare_regions_and_collection_set(bool concurrent) {
 
     collection_set->clear();
     ShenandoahHeapLocker locker(heap->lock());
+    heap->assert_pinned_region_status(this);
     _heuristics->choose_collection_set(collection_set);
   }
 
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahGeneration.hpp b/src/hotspot/share/gc/shenandoah/shenandoahGeneration.hpp
index 6f32d101152..9f8944127c0 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahGeneration.hpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahGeneration.hpp
@@ -143,7 +143,7 @@ public:
   virtual bool contains(ShenandoahAffiliation affiliation) const = 0;
 
   // Return true if this region is affiliated with this generation.
-  virtual bool contains(ShenandoahHeapRegion* region) const = 0;
+  virtual bool contains(ShenandoahHeapRegion* region) const override = 0;
 
   // Return true if this object is affiliated with this generation.
   virtual bool contains(oop obj) const = 0;
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahOldGeneration.hpp b/src/hotspot/share/gc/shenandoah/shenandoahOldGeneration.hpp
index 630736190f0..0069d38a84e 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahOldGeneration.hpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahOldGeneration.hpp
@@ -213,7 +213,12 @@ public:
   bool is_concurrent_mark_in_progress() override;
 
   bool entry_coalesce_and_fill();
+
+  // Global collections touch old regions, so the old generation needs to be informed of this.
+  // The old generation may decide to schedule additional mixed collections, or may decide to
+  // immediately coalesce-and-fill old objects in regions that were not collected.
   void transition_old_generation_after_global_gc();
+
   void prepare_gc() override;
   void prepare_regions_and_collection_set(bool concurrent) override;
   void record_success_concurrent(bool abbreviated) override;
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahTrace.cpp b/src/hotspot/share/gc/shenandoah/shenandoahTrace.cpp
index bbb44348355..c28e572dd6b 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahTrace.cpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahTrace.cpp
@@ -27,9 +27,7 @@
 #include "jfr/jfrEvents.hpp"
 
 void ShenandoahTracer::report_evacuation_info(const ShenandoahCollectionSet* cset,
-    size_t free_regions, size_t regions_promoted_humongous, size_t regions_promoted_regular,
-    size_t regular_promoted_garbage, size_t regular_promoted_free, size_t regions_immediate,
-    size_t immediate_size) {
+    size_t free_regions, size_t regions_immediate, size_t immediate_size) {
 
   EventShenandoahEvacuationInformation e;
   if (e.should_commit()) {
@@ -37,13 +35,6 @@ void ShenandoahTracer::report_evacuation_info(const ShenandoahCollectionSet* cse
     e.set_cSetRegions(cset->count());
     e.set_cSetUsedBefore(cset->used());
     e.set_cSetUsedAfter(cset->live());
-    e.set_collectedOld(cset->get_live_bytes_in_old_regions());
-    e.set_collectedPromoted(cset->get_live_bytes_in_tenurable_regions());
-    e.set_collectedYoung(cset->get_live_bytes_in_untenurable_regions());
-    e.set_regionsPromotedHumongous(regions_promoted_humongous);
-    e.set_regionsPromotedRegular(regions_promoted_regular);
-    e.set_regularPromotedGarbage(regular_promoted_garbage);
-    e.set_regularPromotedFree(regular_promoted_free);
     e.set_freeRegions(free_regions);
     e.set_regionsImmediate(regions_immediate);
     e.set_immediateBytes(immediate_size);
@@ -51,3 +42,24 @@ void ShenandoahTracer::report_evacuation_info(const ShenandoahCollectionSet* cse
     e.commit();
   }
 }
+
+void ShenandoahTracer::report_promotion_info(const ShenandoahCollectionSet* cset,
+    size_t regions_promoted_humongous, size_t humongous_promoted_garbage, size_t humongous_promoted_free,
+    size_t regions_promoted_regular, size_t regular_promoted_garbage, size_t regular_promoted_free) {
+
+  EventShenandoahPromotionInformation e;
+  if (e.should_commit()) {
+    e.set_gcId(GCId::current());
+    e.set_collectedOld(cset->get_live_bytes_in_old_regions());
+    e.set_collectedPromoted(cset->get_live_bytes_in_tenurable_regions());
+    e.set_collectedYoung(cset->get_live_bytes_in_untenurable_regions());
+    e.set_regionsPromotedHumongous(regions_promoted_humongous);
+    e.set_humongousPromotedGarbage(humongous_promoted_garbage);
+    e.set_humongousPromotedFree(humongous_promoted_free);
+    e.set_regionsPromotedRegular(regions_promoted_regular);
+    e.set_regularPromotedGarbage(regular_promoted_garbage);
+    e.set_regularPromotedFree(regular_promoted_free);
+
+    e.commit();
+  }
+}
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahTrace.hpp b/src/hotspot/share/gc/shenandoah/shenandoahTrace.hpp
index 116968103de..e5c80e0705f 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahTrace.hpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahTrace.hpp
@@ -34,11 +34,14 @@ class ShenandoahTracer : public GCTracer, public CHeapObj<mtGC> {
 public:
   ShenandoahTracer() : GCTracer(Shenandoah) {}
 
-  // Sends a JFR event (if enabled) summarizing the composition of the collection set
+  // Sends a JFR event summarizing the composition of the collection set
   static void report_evacuation_info(const ShenandoahCollectionSet* cset,
-    size_t free_regions, size_t regions_promoted_humongous, size_t regions_promoted_regular,
-    size_t regular_promoted_garbage, size_t regular_promoted_free, size_t regions_immediate,
-    size_t immediate_size);
+    size_t free_regions, size_t regions_immediate, size_t immediate_size);
+
+  // Sends a JFR event summarizing in-place promotion activity (generational mode only)
+  static void report_promotion_info(const ShenandoahCollectionSet* cset,
+    size_t regions_promoted_humongous, size_t humongous_promoted_garbage, size_t humongous_promoted_free,
+    size_t regions_promoted_regular, size_t regular_promoted_garbage, size_t regular_promoted_free);
 };
 
 #endif
diff --git a/src/hotspot/share/jfr/metadata/metadata.xml b/src/hotspot/share/jfr/metadata/metadata.xml
index 2b082165005..09d9e0ccabf 100644
--- a/src/hotspot/share/jfr/metadata/metadata.xml
+++ b/src/hotspot/share/jfr/metadata/metadata.xml
@@ -1273,16 +1273,22 @@
     <Field type="ulong" name="cSetRegions" label="Collection Set Regions" />
     <Field type="ulong" contentType="bytes" name="cSetUsedBefore" label="Collection Set Before" description="Memory usage before GC in the collection set regions" />
     <Field type="ulong" contentType="bytes" name="cSetUsedAfter" label="Collection Set After" description="Memory usage after GC in the collection set regions" />
+    <Field type="ulong" name="freeRegions" label="Free Regions" description="Free regions prior to collection" />
+    <Field type="ulong" name="regionsImmediate" label="Regions Immediate" />
+    <Field type="ulong" contentType="bytes" name="immediateBytes" label="Immediate Bytes" />
+  </Event>
+
+  <Event name="ShenandoahPromotionInformation" category="Java Virtual Machine, GC, Detailed" label="Shenandoah Promotion Information" startTime="false">
+    <Field type="uint" name="gcId" label="GC Identifier" relation="GcId" />
     <Field type="ulong" contentType="bytes" name="collectedOld" label="Collected Old" description="Memory collected from old generation" />
     <Field type="ulong" contentType="bytes" name="collectedPromoted" label="Collected Promoted" description="Memory collected from generation promotion" />
     <Field type="ulong" contentType="bytes" name="collectedYoung" label="Collection Young" description="Memory collected from young generation" />
     <Field type="ulong" name="regionsPromotedHumongous" label="Regions Promoted Humongous" />
+    <Field type="ulong" contentType="bytes" name="humongousPromotedGarbage" label="Humongous Promoted Garbage" description="Garbage memory of in place promoted humongous regions" />
+    <Field type="ulong" contentType="bytes" name="humongousPromotedFree" label="Humongous Promoted Free" description="Free memory of in place promoted humongous regions" />
     <Field type="ulong" name="regionsPromotedRegular" label="Regions Promoted Regular" />
     <Field type="ulong" contentType="bytes" name="regularPromotedGarbage" label="Regular Promoted Garbage" description="Garbage memory of in place promoted regular regions" />
     <Field type="ulong" contentType="bytes" name="regularPromotedFree" label="Regular Promoted Free" description="Free memory of in place promoted regular regions" />
-    <Field type="ulong" name="freeRegions" label="Free Regions" description="Free regions prior to collection" />
-    <Field type="ulong" name="regionsImmediate" label="Regions Immediate" />
-    <Field type="ulong" contentType="bytes" name="immediateBytes" label="Immediate Bytes" />
   </Event>
 
   <Event name="StringDeduplication" category="Java Virtual Machine, GC, Detailed" label="String Deduplication Statistics" stackTrace="false">
diff --git a/src/jdk.jfr/share/conf/jfr/default.jfc b/src/jdk.jfr/share/conf/jfr/default.jfc
index 554e09261d6..d077157d2a1 100644
--- a/src/jdk.jfr/share/conf/jfr/default.jfc
+++ b/src/jdk.jfr/share/conf/jfr/default.jfc
@@ -576,6 +576,10 @@
       <setting name="enabled" control="gc-enabled-high">false</setting>
     </event>
 
+    <event name="jdk.ShenandoahPromotionInformation">
+      <setting name="enabled" control="gc-enabled-high">false</setting>
+    </event>
+
     <event name="jdk.OldObjectSample">
       <setting name="enabled" control="old-objects-enabled">true</setting>
       <setting name="stackTrace" control="old-objects-stack-trace">false</setting>
diff --git a/src/jdk.jfr/share/conf/jfr/profile.jfc b/src/jdk.jfr/share/conf/jfr/profile.jfc
index 108886fb18d..126615af14b 100644
--- a/src/jdk.jfr/share/conf/jfr/profile.jfc
+++ b/src/jdk.jfr/share/conf/jfr/profile.jfc
@@ -576,6 +576,10 @@
       <setting name="enabled" control="gc-enabled-high">false</setting>
     </event>
 
+    <event name="jdk.ShenandoahPromotionInformation">
+      <setting name="enabled" control="gc-enabled-high">false</setting>
+    </event>
+
     <event name="jdk.OldObjectSample">
       <setting name="enabled" control="old-objects-enabled">true</setting>
       <setting name="stackTrace" control="old-objects-stack-trace">true</setting>
diff --git a/test/jdk/jdk/jfr/event/gc/detailed/TestShenandoahEvacuationInformationEvent.java b/test/jdk/jdk/jfr/event/gc/detailed/TestShenandoahEvacuationInformationEvent.java
index 5730f4d9ff4..888ff9eb17a 100644
--- a/test/jdk/jdk/jfr/event/gc/detailed/TestShenandoahEvacuationInformationEvent.java
+++ b/test/jdk/jdk/jfr/event/gc/detailed/TestShenandoahEvacuationInformationEvent.java
@@ -68,8 +68,8 @@ public class TestShenandoahEvacuationInformationEvent {
             long setUsedAfter = Events.assertField(event, "cSetUsedAfter").atLeast(0L).getValue();
             long setUsedBefore = Events.assertField(event, "cSetUsedBefore").atLeast(setUsedAfter).getValue();
             long freeRegions = Events.assertField(event, "freeRegions").atLeast(0L).getValue();
-            Events.assertField(event, "collectedOld").atLeast(0L).getValue();
-            Events.assertField(event, "collectedYoung").atLeast(0L).getValue();
+            Events.assertField(event, "regionsImmediate").atLeast(0L).getValue();
+            Events.assertField(event, "immediateBytes").atLeast(0L).getValue();
 
             Asserts.assertGreaterThanOrEqual(shenandoahMaxHeapRegionCount, freeRegions + cSetRegions, "numRegions >= freeRegions + cSetRegions");
             Asserts.assertGreaterThanOrEqual(shenandoahHeapRegionSize * cSetRegions, setUsedAfter, "ShenandoahHeapRegionSize * cSetRegions >= setUsedAfter");
diff --git a/test/jdk/jdk/jfr/event/gc/detailed/TestShenandoahPromotionInformationEvent.java b/test/jdk/jdk/jfr/event/gc/detailed/TestShenandoahPromotionInformationEvent.java
new file mode 100644
index 00000000000..08a360e14fd
--- /dev/null
+++ b/test/jdk/jdk/jfr/event/gc/detailed/TestShenandoahPromotionInformationEvent.java
@@ -0,0 +1,100 @@
+/*
+ * Copyright Amazon.com Inc. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ *
+ */
+
+package jdk.jfr.event.gc.detailed;
+
+import java.time.Duration;
+import java.util.List;
+import java.util.Random;
+
+import jdk.jfr.Recording;
+import jdk.jfr.consumer.RecordedEvent;
+import jdk.test.lib.Asserts;
+import jdk.test.lib.jfr.EventNames;
+import jdk.test.lib.jfr.Events;
+
+/**
+ * @test
+ * @requires vm.hasJFR & vm.gc.Shenandoah
+ * @requires vm.flagless
+ * @library /test/lib /test/jdk
+ * @run main/othervm -Xmx64m -XX:+UnlockExperimentalVMOptions -XX:ShenandoahRegionSize=1m -XX:+UseShenandoahGC -XX:ShenandoahGCMode=generational jdk.jfr.event.gc.detailed.TestShenandoahPromotionInformationEvent
+ */
+
+public class TestShenandoahPromotionInformationEvent {
+    private final static String EVENT_NAME = EventNames.ShenandoahPromotionInformation;
+
+    public static void main(String[] args) throws Exception {
+        Recording recording = new Recording();
+        recording.enable(EVENT_NAME).withThreshold(Duration.ofMillis(0));
+        recording.start();
+        allocate();
+        recording.stop();
+
+        List<RecordedEvent> events = Events.fromRecording(recording);
+        Asserts.assertFalse(events.isEmpty(), "No events found");
+        for (RecordedEvent event : events) {
+            if (!Events.isEventType(event, EVENT_NAME)) {
+                continue;
+            }
+            System.out.println("Event: " + event);
+
+            Events.assertField(event, "gcId").getValue();
+            Events.assertField(event, "collectedOld").atLeast(0L).getValue();
+            Events.assertField(event, "collectedPromoted").atLeast(0L).getValue();
+            Events.assertField(event, "collectedYoung").atLeast(0L).getValue();
+            Events.assertField(event, "regionsPromotedHumongous").atLeast(0L).getValue();
+            Events.assertField(event, "humongousPromotedGarbage").atLeast(0L).getValue();
+            Events.assertField(event, "humongousPromotedFree").atLeast(0L).getValue();
+            Events.assertField(event, "regionsPromotedRegular").atLeast(0L).getValue();
+            Events.assertField(event, "regularPromotedGarbage").atLeast(0L).getValue();
+            Events.assertField(event, "regularPromotedFree").atLeast(0L).getValue();
+        }
+    }
+
+    private static void allocate() {
+        DummyObject[] dummys = new DummyObject[6000];
+
+        Random r = new Random(0);
+        long bytesToAllocate = 256 * 1024 * 1024;
+        int currPos = 0;
+        while (bytesToAllocate > 0) {
+            int allocSize = 1000 + (r.nextInt(4000));
+            bytesToAllocate -= allocSize;
+            dummys[currPos] = new DummyObject(allocSize);
+            currPos = (currPos + r.nextInt(20)) % dummys.length;
+        }
+        for (int c = 0; c < dummys.length; c++) {
+            dummys[c] = null;
+        }
+        System.gc();
+    }
+
+    public static class DummyObject {
+        public byte[] payload;
+        DummyObject(int size) {
+            payload = new byte[size];
+        }
+    }
+}
diff --git a/test/lib/jdk/test/lib/jfr/EventNames.java b/test/lib/jdk/test/lib/jfr/EventNames.java
index 8b0113f75f4..06ee62a2f7c 100644
--- a/test/lib/jdk/test/lib/jfr/EventNames.java
+++ b/test/lib/jdk/test/lib/jfr/EventNames.java
@@ -115,6 +115,7 @@ public class EventNames {
     public static final String ShenandoahHeapRegionInformation = PREFIX + "ShenandoahHeapRegionInformation";
     public static final String ShenandoahHeapRegionStateChange = PREFIX + "ShenandoahHeapRegionStateChange";
     public static final String ShenandoahEvacuationInformation = PREFIX + "ShenandoahEvacuationInformation";
+    public static final String ShenandoahPromotionInformation = PREFIX + "ShenandoahPromotionInformation";
     public static final String TenuringDistribution = PREFIX + "TenuringDistribution";
     public static final String GarbageCollection = PREFIX + "GarbageCollection";
     public static final String ParallelOldGarbageCollection = PREFIX + "ParallelOldGarbageCollection";

From d57bbc026fe140578ee7c317af9738678f4534c6 Mon Sep 17 00:00:00 2001
From: Fei Yang <fyang@openjdk.org>
Date: Wed, 15 Apr 2026 00:57:20 +0000
Subject: [PATCH 596/655] 8382087: aarch64: remove unused function declarations
 in macroAssembler_aarch64.hpp

Reviewed-by: mhaessig, ayang, aph
---
 src/hotspot/cpu/aarch64/assembler_aarch64.hpp | 24 -------------------
 .../cpu/aarch64/macroAssembler_aarch64.hpp    |  4 ----
 2 files changed, 28 deletions(-)

diff --git a/src/hotspot/cpu/aarch64/assembler_aarch64.hpp b/src/hotspot/cpu/aarch64/assembler_aarch64.hpp
index ebd8f3a9e03..4c1c8d9bbc8 100644
--- a/src/hotspot/cpu/aarch64/assembler_aarch64.hpp
+++ b/src/hotspot/cpu/aarch64/assembler_aarch64.hpp
@@ -1000,30 +1000,6 @@ public:
     f(0b0101010, 31, 25), f(0, 24), sf(offset, 23, 5), f(0, 4), f(cond, 3, 0);
   }
 
-#define INSN(NAME, cond)                        \
-  void NAME(address dest) {                     \
-    br(cond, dest);                             \
-  }
-
-  INSN(beq, EQ);
-  INSN(bne, NE);
-  INSN(bhs, HS);
-  INSN(bcs, CS);
-  INSN(blo, LO);
-  INSN(bcc, CC);
-  INSN(bmi, MI);
-  INSN(bpl, PL);
-  INSN(bvs, VS);
-  INSN(bvc, VC);
-  INSN(bhi, HI);
-  INSN(bls, LS);
-  INSN(bge, GE);
-  INSN(blt, LT);
-  INSN(bgt, GT);
-  INSN(ble, LE);
-  INSN(bal, AL);
-  INSN(bnv, NV);
-
   void br(Condition cc, Label &L);
 
 #undef INSN
diff --git a/src/hotspot/cpu/aarch64/macroAssembler_aarch64.hpp b/src/hotspot/cpu/aarch64/macroAssembler_aarch64.hpp
index dfba2dcff46..a6cc862d05c 100644
--- a/src/hotspot/cpu/aarch64/macroAssembler_aarch64.hpp
+++ b/src/hotspot/cpu/aarch64/macroAssembler_aarch64.hpp
@@ -890,10 +890,6 @@ public:
   // thread in the default location (rthread)
   void reset_last_Java_frame(bool clear_fp);
 
-  // Stores
-  void store_check(Register obj);                // store check for obj - register is destroyed afterwards
-  void store_check(Register obj, Address dst);   // same as above, dst is exact store location (reg. is destroyed)
-
   void resolve_jobject(Register value, Register tmp1, Register tmp2);
   void resolve_global_jobject(Register value, Register tmp1, Register tmp2);
 

From 9ebee751e8ffa319c9ac6b8aababd3daa994b805 Mon Sep 17 00:00:00 2001
From: "lingjun.cg" <lingjun.cg@alibaba-inc.com>
Date: Wed, 15 Apr 2026 02:13:26 +0000
Subject: [PATCH 597/655] 8379981: Virtual thread: crash in
 stackChunkOopDesc::print_on when thawing frame

Reviewed-by: pchilanomate
---
 src/hotspot/share/runtime/frame.cpp | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/src/hotspot/share/runtime/frame.cpp b/src/hotspot/share/runtime/frame.cpp
index 8f969600ba8..d691a3c8028 100644
--- a/src/hotspot/share/runtime/frame.cpp
+++ b/src/hotspot/share/runtime/frame.cpp
@@ -1286,7 +1286,7 @@ public:
   }
 
   bool is_good(oop* p) {
-    return *p == nullptr || (dbg_is_safe(*p, -1) && dbg_is_safe((*p)->klass(), -1) && oopDesc::is_oop_or_null(*p));
+    return *p == nullptr || (dbg_is_safe(*p, -1) && dbg_is_safe((*p)->klass_without_asserts(), -1) && oopDesc::is_oop_or_null(*p));
   }
   void describe(FrameValues& values, int frame_no) {
     for (int i = 0; i < _oops->length(); i++) {

From 20e8ea0e0640bf8b0727cf30ced041a1def9c350 Mon Sep 17 00:00:00 2001
From: Jayathirth D V <jdv@openjdk.org>
Date: Wed, 15 Apr 2026 04:22:28 +0000
Subject: [PATCH 598/655] 8382047: Update Libpng to 1.6.57

Reviewed-by: avu, azvegint, prr
---
 src/java.desktop/share/legal/libpng.md        |  3 +-
 .../native/libsplashscreen/libpng/CHANGES     | 11 ++++
 .../native/libsplashscreen/libpng/README      |  2 +-
 .../share/native/libsplashscreen/libpng/png.c |  4 +-
 .../share/native/libsplashscreen/libpng/png.h | 14 ++---
 .../native/libsplashscreen/libpng/pngconf.h   |  2 +-
 .../libsplashscreen/libpng/pnglibconf.h       |  2 +-
 .../native/libsplashscreen/libpng/pngrtran.c  | 28 +++++-----
 .../native/libsplashscreen/libpng/pngset.c    | 54 +++++++++++++++++--
 9 files changed, 89 insertions(+), 31 deletions(-)

diff --git a/src/java.desktop/share/legal/libpng.md b/src/java.desktop/share/legal/libpng.md
index 034de22bf25..7783fc7ff03 100644
--- a/src/java.desktop/share/legal/libpng.md
+++ b/src/java.desktop/share/legal/libpng.md
@@ -1,4 +1,4 @@
-## libpng v1.6.56
+## libpng v1.6.57
 
 ### libpng License
 <pre>
@@ -180,6 +180,7 @@ Authors, for copyright and licensing purposes.
  * Mans Rullgard
  * Matt Sarett
  * Mike Klein
+ * Mohammad Seet
  * Pascal Massimino
  * Paul Schmidt
  * Petr Simecek
diff --git a/src/java.desktop/share/native/libsplashscreen/libpng/CHANGES b/src/java.desktop/share/native/libsplashscreen/libpng/CHANGES
index 673d4d50420..ba81df0c0e6 100644
--- a/src/java.desktop/share/native/libsplashscreen/libpng/CHANGES
+++ b/src/java.desktop/share/native/libsplashscreen/libpng/CHANGES
@@ -6368,6 +6368,17 @@ Version 1.6.56 [March 25, 2026]
     (Contributed by Bob Friesenhahn and Philippe Antoine.)
   Performed various refactorings and cleanups.
 
+Version 1.6.57 [April 8, 2026]
+  Fixed CVE-2026-34757 (medium severity):
+    Use-after-free in `png_set_PLTE`, `png_set_tRNS` and `png_set_hIST`
+    leading to corrupted chunk data and potential heap information disclosure.
+    Also hardened the append-style setters (`png_set_text`, `png_set_sPLT`,
+    `png_set_unknown_chunks`) against a theoretical variant of the same
+    aliasing pattern.
+    (Reported by Iv4n <Iv4n550@users.noreply.github.com>.)
+  Fixed integer overflow in rowbytes computation in read transforms.
+    (Contributed by Mohammad Seet.)
+
 Send comments/corrections/commendations to png-mng-implement at lists.sf.net.
 Subscription is required; visit
 <https://lists.sourceforge.net/lists/listinfo/png-mng-implement>
diff --git a/src/java.desktop/share/native/libsplashscreen/libpng/README b/src/java.desktop/share/native/libsplashscreen/libpng/README
index d0b085f7933..179b8dc8cb4 100644
--- a/src/java.desktop/share/native/libsplashscreen/libpng/README
+++ b/src/java.desktop/share/native/libsplashscreen/libpng/README
@@ -1,4 +1,4 @@
-README for libpng version 1.6.56
+README for libpng version 1.6.57
 ================================
 
 See the note about version numbers near the top of `png.h`.
diff --git a/src/java.desktop/share/native/libsplashscreen/libpng/png.c b/src/java.desktop/share/native/libsplashscreen/libpng/png.c
index fd095b515b9..e4e13b0a684 100644
--- a/src/java.desktop/share/native/libsplashscreen/libpng/png.c
+++ b/src/java.desktop/share/native/libsplashscreen/libpng/png.c
@@ -42,7 +42,7 @@
 #include "pngpriv.h"
 
 /* Generate a compiler error if there is an old png.h in the search path. */
-typedef png_libpng_version_1_6_56 Your_png_h_is_not_version_1_6_56;
+typedef png_libpng_version_1_6_57 Your_png_h_is_not_version_1_6_57;
 
 /* Sanity check the chunks definitions - PNG_KNOWN_CHUNKS from pngpriv.h and the
  * corresponding macro definitions.  This causes a compile time failure if
@@ -849,7 +849,7 @@ png_get_copyright(png_const_structrp png_ptr)
    return PNG_STRING_COPYRIGHT
 #else
    return PNG_STRING_NEWLINE \
-      "libpng version 1.6.56" PNG_STRING_NEWLINE \
+      "libpng version 1.6.57" PNG_STRING_NEWLINE \
       "Copyright (c) 2018-2026 Cosmin Truta" PNG_STRING_NEWLINE \
       "Copyright (c) 1998-2002,2004,2006-2018 Glenn Randers-Pehrson" \
       PNG_STRING_NEWLINE \
diff --git a/src/java.desktop/share/native/libsplashscreen/libpng/png.h b/src/java.desktop/share/native/libsplashscreen/libpng/png.h
index 56ec204cd1a..349e7d07383 100644
--- a/src/java.desktop/share/native/libsplashscreen/libpng/png.h
+++ b/src/java.desktop/share/native/libsplashscreen/libpng/png.h
@@ -29,7 +29,7 @@
  * However, the following notice accompanied the original version of this
  * file and, per its terms, should not be removed:
  *
- * libpng version 1.6.56
+ * libpng version 1.6.57
  *
  * Copyright (c) 2018-2026 Cosmin Truta
  * Copyright (c) 1998-2002,2004,2006-2018 Glenn Randers-Pehrson
@@ -43,7 +43,7 @@
  *   libpng versions 0.89, June 1996, through 0.96, May 1997: Andreas Dilger
  *   libpng versions 0.97, January 1998, through 1.6.35, July 2018:
  *     Glenn Randers-Pehrson
- *   libpng versions 1.6.36, December 2018, through 1.6.56, March 2026:
+ *   libpng versions 1.6.36, December 2018, through 1.6.57, April 2026:
  *     Cosmin Truta
  *   See also "Contributing Authors", below.
  */
@@ -267,7 +267,7 @@
  *    ...
  *    1.5.30                  15    10530  15.so.15.30[.0]
  *    ...
- *    1.6.56                  16    10656  16.so.16.56[.0]
+ *    1.6.57                  16    10657  16.so.16.57[.0]
  *
  *    Henceforth the source version will match the shared-library major and
  *    minor numbers; the shared-library major version number will be used for
@@ -303,7 +303,7 @@
  */
 
 /* Version information for png.h - this should match the version in png.c */
-#define PNG_LIBPNG_VER_STRING "1.6.56"
+#define PNG_LIBPNG_VER_STRING "1.6.57"
 #define PNG_HEADER_VERSION_STRING " libpng version " PNG_LIBPNG_VER_STRING "\n"
 
 /* The versions of shared library builds should stay in sync, going forward */
@@ -314,7 +314,7 @@
 /* These should match the first 3 components of PNG_LIBPNG_VER_STRING: */
 #define PNG_LIBPNG_VER_MAJOR   1
 #define PNG_LIBPNG_VER_MINOR   6
-#define PNG_LIBPNG_VER_RELEASE 56
+#define PNG_LIBPNG_VER_RELEASE 57
 
 /* This should be zero for a public release, or non-zero for a
  * development version.
@@ -345,7 +345,7 @@
  * From version 1.0.1 it is:
  * XXYYZZ, where XX=major, YY=minor, ZZ=release
  */
-#define PNG_LIBPNG_VER 10656 /* 1.6.56 */
+#define PNG_LIBPNG_VER 10657 /* 1.6.57 */
 
 /* Library configuration: these options cannot be changed after
  * the library has been built.
@@ -455,7 +455,7 @@ extern "C" {
 /* This triggers a compiler error in png.c, if png.c and png.h
  * do not agree upon the version number.
  */
-typedef char *png_libpng_version_1_6_56;
+typedef char *png_libpng_version_1_6_57;
 
 /* Basic control structions.  Read libpng-manual.txt or libpng.3 for more info.
  *
diff --git a/src/java.desktop/share/native/libsplashscreen/libpng/pngconf.h b/src/java.desktop/share/native/libsplashscreen/libpng/pngconf.h
index 5772e6ebb1c..1a5bb7b60f8 100644
--- a/src/java.desktop/share/native/libsplashscreen/libpng/pngconf.h
+++ b/src/java.desktop/share/native/libsplashscreen/libpng/pngconf.h
@@ -29,7 +29,7 @@
  * However, the following notice accompanied the original version of this
  * file and, per its terms, should not be removed:
  *
- * libpng version 1.6.56
+ * libpng version 1.6.57
  *
  * Copyright (c) 2018-2026 Cosmin Truta
  * Copyright (c) 1998-2002,2004,2006-2016,2018 Glenn Randers-Pehrson
diff --git a/src/java.desktop/share/native/libsplashscreen/libpng/pnglibconf.h b/src/java.desktop/share/native/libsplashscreen/libpng/pnglibconf.h
index 4a7e51d112d..de63c998927 100644
--- a/src/java.desktop/share/native/libsplashscreen/libpng/pnglibconf.h
+++ b/src/java.desktop/share/native/libsplashscreen/libpng/pnglibconf.h
@@ -31,7 +31,7 @@
  * However, the following notice accompanied the original version of this
  * file and, per its terms, should not be removed:
  */
-/* libpng version 1.6.56 */
+/* libpng version 1.6.57 */
 
 /* Copyright (c) 2018-2026 Cosmin Truta */
 /* Copyright (c) 1998-2002,2004,2006-2018 Glenn Randers-Pehrson */
diff --git a/src/java.desktop/share/native/libsplashscreen/libpng/pngrtran.c b/src/java.desktop/share/native/libsplashscreen/libpng/pngrtran.c
index f0972ba9bef..838c8460f91 100644
--- a/src/java.desktop/share/native/libsplashscreen/libpng/pngrtran.c
+++ b/src/java.desktop/share/native/libsplashscreen/libpng/pngrtran.c
@@ -2408,7 +2408,7 @@ png_do_unpack(png_row_infop row_info, png_bytep row)
       }
       row_info->bit_depth = 8;
       row_info->pixel_depth = (png_byte)(8 * row_info->channels);
-      row_info->rowbytes = row_width * row_info->channels;
+      row_info->rowbytes = (size_t)row_width * row_info->channels;
    }
 }
 #endif
@@ -2610,7 +2610,7 @@ png_do_scale_16_to_8(png_row_infop row_info, png_bytep row)
 
       row_info->bit_depth = 8;
       row_info->pixel_depth = (png_byte)(8 * row_info->channels);
-      row_info->rowbytes = row_info->width * row_info->channels;
+      row_info->rowbytes = (size_t)row_info->width * row_info->channels;
    }
 }
 #endif
@@ -2638,7 +2638,7 @@ png_do_chop(png_row_infop row_info, png_bytep row)
 
       row_info->bit_depth = 8;
       row_info->pixel_depth = (png_byte)(8 * row_info->channels);
-      row_info->rowbytes = row_info->width * row_info->channels;
+      row_info->rowbytes = (size_t)row_info->width * row_info->channels;
    }
 }
 #endif
@@ -2874,7 +2874,7 @@ png_do_read_filler(png_row_infop row_info, png_bytep row,
             *(--dp) = lo_filler;
             row_info->channels = 2;
             row_info->pixel_depth = 16;
-            row_info->rowbytes = row_width * 2;
+            row_info->rowbytes = (size_t)row_width * 2;
          }
 
          else
@@ -2889,7 +2889,7 @@ png_do_read_filler(png_row_infop row_info, png_bytep row,
             }
             row_info->channels = 2;
             row_info->pixel_depth = 16;
-            row_info->rowbytes = row_width * 2;
+            row_info->rowbytes = (size_t)row_width * 2;
          }
       }
 
@@ -2912,7 +2912,7 @@ png_do_read_filler(png_row_infop row_info, png_bytep row,
             *(--dp) = hi_filler;
             row_info->channels = 2;
             row_info->pixel_depth = 32;
-            row_info->rowbytes = row_width * 4;
+            row_info->rowbytes = (size_t)row_width * 4;
          }
 
          else
@@ -2929,7 +2929,7 @@ png_do_read_filler(png_row_infop row_info, png_bytep row,
             }
             row_info->channels = 2;
             row_info->pixel_depth = 32;
-            row_info->rowbytes = row_width * 4;
+            row_info->rowbytes = (size_t)row_width * 4;
          }
       }
 #endif
@@ -2953,7 +2953,7 @@ png_do_read_filler(png_row_infop row_info, png_bytep row,
             *(--dp) = lo_filler;
             row_info->channels = 4;
             row_info->pixel_depth = 32;
-            row_info->rowbytes = row_width * 4;
+            row_info->rowbytes = (size_t)row_width * 4;
          }
 
          else
@@ -2970,7 +2970,7 @@ png_do_read_filler(png_row_infop row_info, png_bytep row,
             }
             row_info->channels = 4;
             row_info->pixel_depth = 32;
-            row_info->rowbytes = row_width * 4;
+            row_info->rowbytes = (size_t)row_width * 4;
          }
       }
 
@@ -2997,7 +2997,7 @@ png_do_read_filler(png_row_infop row_info, png_bytep row,
             *(--dp) = hi_filler;
             row_info->channels = 4;
             row_info->pixel_depth = 64;
-            row_info->rowbytes = row_width * 8;
+            row_info->rowbytes = (size_t)row_width * 8;
          }
 
          else
@@ -3019,7 +3019,7 @@ png_do_read_filler(png_row_infop row_info, png_bytep row,
 
             row_info->channels = 4;
             row_info->pixel_depth = 64;
-            row_info->rowbytes = row_width * 8;
+            row_info->rowbytes = (size_t)row_width * 8;
          }
       }
 #endif
@@ -4513,7 +4513,7 @@ png_do_expand_palette(png_structrp png_ptr, png_row_infop row_info,
                }
                row_info->bit_depth = 8;
                row_info->pixel_depth = 32;
-               row_info->rowbytes = row_width * 4;
+               row_info->rowbytes = (size_t)row_width * 4;
                row_info->color_type = 6;
                row_info->channels = 4;
             }
@@ -4521,7 +4521,7 @@ png_do_expand_palette(png_structrp png_ptr, png_row_infop row_info,
             else
             {
                sp = row + (size_t)row_width - 1;
-               dp = row + (size_t)(row_width * 3) - 1;
+               dp = row + (size_t)row_width * 3 - 1;
                i = 0;
 #ifdef PNG_ARM_NEON_INTRINSICS_AVAILABLE
                i = png_do_expand_palette_rgb8_neon(png_ptr, row_info, row,
@@ -4540,7 +4540,7 @@ png_do_expand_palette(png_structrp png_ptr, png_row_infop row_info,
 
                row_info->bit_depth = 8;
                row_info->pixel_depth = 24;
-               row_info->rowbytes = row_width * 3;
+               row_info->rowbytes = (size_t)row_width * 3;
                row_info->color_type = 2;
                row_info->channels = 3;
             }
diff --git a/src/java.desktop/share/native/libsplashscreen/libpng/pngset.c b/src/java.desktop/share/native/libsplashscreen/libpng/pngset.c
index 05d18cd06b7..29082a6be08 100644
--- a/src/java.desktop/share/native/libsplashscreen/libpng/pngset.c
+++ b/src/java.desktop/share/native/libsplashscreen/libpng/pngset.c
@@ -414,6 +414,7 @@ void PNGAPI
 png_set_hIST(png_const_structrp png_ptr, png_inforp info_ptr,
     png_const_uint_16p hist)
 {
+   png_uint_16 safe_hist[PNG_MAX_PALETTE_LENGTH];
    int i;
 
    png_debug1(1, "in %s storage function", "hIST");
@@ -430,6 +431,13 @@ png_set_hIST(png_const_structrp png_ptr, png_inforp info_ptr,
       return;
    }
 
+   /* Snapshot the caller's hist before freeing, in case it points to
+    * info_ptr->hist (getter-to-setter aliasing).
+    */
+   memcpy(safe_hist, hist, (unsigned int)info_ptr->num_palette *
+       (sizeof (png_uint_16)));
+   hist = safe_hist;
+
    png_free_data(png_ptr, info_ptr, PNG_FREE_HIST, 0);
 
    /* Changed from info->num_palette to PNG_MAX_PALETTE_LENGTH in
@@ -771,7 +779,7 @@ void PNGAPI
 png_set_PLTE(png_structrp png_ptr, png_inforp info_ptr,
     png_const_colorp palette, int num_palette)
 {
-
+   png_color safe_palette[PNG_MAX_PALETTE_LENGTH];
    png_uint_32 max_palette_length;
 
    png_debug1(1, "in %s storage function", "PLTE");
@@ -805,6 +813,15 @@ png_set_PLTE(png_structrp png_ptr, png_inforp info_ptr,
       png_error(png_ptr, "Invalid palette");
    }
 
+   /* Snapshot the caller's palette before freeing, in case it points to
+    * info_ptr->palette (getter-to-setter aliasing).
+    */
+   if (num_palette > 0)
+      memcpy(safe_palette, palette, (unsigned int)num_palette *
+          (sizeof (png_color)));
+
+   palette = safe_palette;
+
    png_free_data(png_ptr, info_ptr, PNG_FREE_PLTE, 0);
 
    /* Changed in libpng-1.2.1 to allocate PNG_MAX_PALETTE_LENGTH instead
@@ -966,6 +983,7 @@ png_set_text_2(png_const_structrp png_ptr, png_inforp info_ptr,
     png_const_textp text_ptr, int num_text)
 {
    int i;
+   png_textp old_text = NULL;
 
    png_debug1(1, "in text storage function, chunk typeid = 0x%lx",
       png_ptr == NULL ? 0xabadca11UL : (unsigned long)png_ptr->chunk_name);
@@ -1013,7 +1031,10 @@ png_set_text_2(png_const_structrp png_ptr, png_inforp info_ptr,
          return 1;
       }
 
-      png_free(png_ptr, info_ptr->text);
+      /* Defer freeing the old array until after the copy loop below,
+       * in case text_ptr aliases info_ptr->text (getter-to-setter).
+       */
+      old_text = info_ptr->text;
 
       info_ptr->text = new_text;
       info_ptr->free_me |= PNG_FREE_TEXT;
@@ -1098,6 +1119,7 @@ png_set_text_2(png_const_structrp png_ptr, png_inforp info_ptr,
       {
          png_chunk_report(png_ptr, "text chunk: out of memory",
              PNG_CHUNK_WRITE_ERROR);
+         png_free(png_ptr, old_text);
 
          return 1;
       }
@@ -1151,6 +1173,8 @@ png_set_text_2(png_const_structrp png_ptr, png_inforp info_ptr,
       png_debug1(3, "transferred text chunk %d", info_ptr->num_text);
    }
 
+   png_free(png_ptr, old_text);
+
    return 0;
 }
 #endif
@@ -1194,6 +1218,16 @@ png_set_tRNS(png_structrp png_ptr, png_inforp info_ptr,
 
    if (trans_alpha != NULL)
    {
+       /* Snapshot the caller's trans_alpha before freeing, in case it
+        * points to info_ptr->trans_alpha (getter-to-setter aliasing).
+        */
+       png_byte safe_trans[PNG_MAX_PALETTE_LENGTH];
+
+       if (num_trans > 0 && num_trans <= PNG_MAX_PALETTE_LENGTH)
+          memcpy(safe_trans, trans_alpha, (size_t)num_trans);
+
+       trans_alpha = safe_trans;
+
        png_free_data(png_ptr, info_ptr, PNG_FREE_TRNS, 0);
 
        if (num_trans > 0 && num_trans <= PNG_MAX_PALETTE_LENGTH)
@@ -1278,6 +1312,7 @@ png_set_sPLT(png_const_structrp png_ptr,
  */
 {
    png_sPLT_tp np;
+   png_sPLT_tp old_spalettes;
 
    png_debug1(1, "in %s storage function", "sPLT");
 
@@ -1298,7 +1333,10 @@ png_set_sPLT(png_const_structrp png_ptr,
       return;
    }
 
-   png_free(png_ptr, info_ptr->splt_palettes);
+   /* Defer freeing the old array until after the copy loop below,
+    * in case entries aliases info_ptr->splt_palettes (getter-to-setter).
+    */
+   old_spalettes = info_ptr->splt_palettes;
 
    info_ptr->splt_palettes = np;
    info_ptr->free_me |= PNG_FREE_SPLT;
@@ -1362,6 +1400,8 @@ png_set_sPLT(png_const_structrp png_ptr,
    }
    while (--nentries);
 
+   png_free(png_ptr, old_spalettes);
+
    if (nentries > 0)
       png_chunk_report(png_ptr, "sPLT out of memory", PNG_CHUNK_WRITE_ERROR);
 }
@@ -1410,6 +1450,7 @@ png_set_unknown_chunks(png_const_structrp png_ptr,
     png_inforp info_ptr, png_const_unknown_chunkp unknowns, int num_unknowns)
 {
    png_unknown_chunkp np;
+   png_unknown_chunkp old_unknowns;
 
    if (png_ptr == NULL || info_ptr == NULL || num_unknowns <= 0 ||
        unknowns == NULL)
@@ -1456,7 +1497,10 @@ png_set_unknown_chunks(png_const_structrp png_ptr,
       return;
    }
 
-   png_free(png_ptr, info_ptr->unknown_chunks);
+   /* Defer freeing the old array until after the copy loop below,
+    * in case unknowns aliases info_ptr->unknown_chunks (getter-to-setter).
+    */
+   old_unknowns = info_ptr->unknown_chunks;
 
    info_ptr->unknown_chunks = np; /* safe because it is initialized */
    info_ptr->free_me |= PNG_FREE_UNKN;
@@ -1502,6 +1546,8 @@ png_set_unknown_chunks(png_const_structrp png_ptr,
       ++np;
       ++(info_ptr->unknown_chunks_num);
    }
+
+   png_free(png_ptr, old_unknowns);
 }
 
 void PNGAPI

From 2930e2b5308a5d6dd68253727db51d0ce167ed83 Mon Sep 17 00:00:00 2001
From: Jatin Bhateja <jbhateja@openjdk.org>
Date: Wed, 15 Apr 2026 04:31:53 +0000
Subject: [PATCH 599/655] 8372797: [VectorAPI] Missing Min/Max identity
 transforms

Reviewed-by: xgong, vlivanov
---
 src/hotspot/share/opto/vectornode.cpp         |   82 +-
 src/hotspot/share/opto/vectornode.hpp         |   40 +-
 .../compiler/lib/ir_framework/IRNode.java     |   20 +
 .../VectorCommutativeOperSharingTest.java     |    4 +-
 .../vectorapi/VectorMinMaxTransforms.java     | 2036 +++++++++++++++++
 .../VectorUnsignedMinMaxOperationsTest.java   | 1353 ++++++++++-
 6 files changed, 3477 insertions(+), 58 deletions(-)
 create mode 100644 test/hotspot/jtreg/compiler/vectorapi/VectorMinMaxTransforms.java

diff --git a/src/hotspot/share/opto/vectornode.cpp b/src/hotspot/share/opto/vectornode.cpp
index 6012bdef86e..b07f0234492 100644
--- a/src/hotspot/share/opto/vectornode.cpp
+++ b/src/hotspot/share/opto/vectornode.cpp
@@ -2432,67 +2432,68 @@ bool MulVLNode::has_uint_inputs() const {
          has_vector_elements_fit_uint(in(2));
 }
 
-static Node* UMinMaxV_Ideal(Node* n, PhaseGVN* phase, bool can_reshape) {
+static Node* MinMaxV_Common_Ideal(MinMaxVNode* n, PhaseGVN* phase, bool can_reshape) {
   int vopc = n->Opcode();
-  assert(vopc == Op_UMinV || vopc == Op_UMaxV, "Unexpected opcode");
+  int min_opcode = n->min_opcode();
+  int max_opcode = n->max_opcode();
 
-  Node* umin = nullptr;
-  Node* umax = nullptr;
+  Node* min_op = nullptr;
+  Node* max_op = nullptr;
   int lopc = n->in(1)->Opcode();
   int ropc = n->in(2)->Opcode();
 
-  if (lopc == Op_UMinV && ropc == Op_UMaxV) {
-    umin = n->in(1);
-    umax = n->in(2);
-  } else if (lopc == Op_UMaxV && ropc == Op_UMinV) {
-    umin = n->in(2);
-    umax = n->in(1);
+  if (lopc == min_opcode && ropc == max_opcode) {
+    min_op = n->in(1);
+    max_op = n->in(2);
+  } else if (lopc == max_opcode && ropc == min_opcode) {
+    min_op = n->in(2);
+    max_op = n->in(1);
   } else {
     return nullptr;
   }
 
-  // UMin (UMin(a, b), UMax(a, b))  => UMin(a, b)
-  // UMin (UMax(a, b), UMin(b, a))  => UMin(a, b)
-  // UMax (UMin(a, b), UMax(a, b))  => UMax(a, b)
-  // UMax (UMax(a, b), UMin(b, a))  => UMax(a, b)
-  if (umin != nullptr && umax != nullptr) {
-    if ((umin->in(1) == umax->in(1) && umin->in(2) == umax->in(2)) ||
-        (umin->in(2) == umax->in(1) && umin->in(1) == umax->in(2))) {
-      if (vopc == Op_UMinV) {
-        return new UMinVNode(umax->in(1), umax->in(2), n->bottom_type()->is_vect());
-      } else {
-        return new UMaxVNode(umax->in(1), umax->in(2), n->bottom_type()->is_vect());
+  // Min (Min(a, b), Max(a, b))  => Min(a, b)
+  // Min (Max(a, b), Min(b, a))  => Min(a, b)
+  // Max (Min(a, b), Max(a, b))  => Max(a, b)
+  // Max (Max(a, b), Min(b, a))  => Max(a, b)
+
+  if (min_op != nullptr && max_op != nullptr) {
+    // Skip if predication status is inconsistent across n, min_op, and max_op,
+    // or if predicated operands carry different masks.
+    if (n->is_predicated_vector() != min_op->is_predicated_vector() ||
+        min_op->is_predicated_vector() != max_op->is_predicated_vector()) {
+      return nullptr;
+    }
+    if (min_op->is_predicated_vector() &&
+        !(n->in(3) == min_op->in(3) && min_op->in(3) == max_op->in(3))) {
+      return nullptr;
+    }
+
+    if ((min_op->in(1) == max_op->in(1) && min_op->in(2) == max_op->in(2)) ||
+        (min_op->in(2) == max_op->in(1) && min_op->in(1) == max_op->in(2))) {
+      // Use n->in(1) inputs for the result to preserve correct merge-masking
+      // passthrough: inactive lanes use in(1), so result->in(1) must equal
+      // n->in(1)->in(1) to maintain the original passthrough semantics.
+      VectorNode* result = VectorNode::make(vopc, n->in(1)->in(1), n->in(1)->in(2), n->bottom_type()->is_vect());
+      if (n->is_predicated_vector()) {
+        result->add_req(n->in(3));
+        result->add_flag(Node::Flag_is_predicated_vector);
       }
+      return result;
     }
   }
 
   return nullptr;
 }
 
-Node* UMinVNode::Ideal(PhaseGVN* phase, bool can_reshape) {
-  Node* progress = UMinMaxV_Ideal(this, phase, can_reshape);
+Node* MinMaxVNode::Ideal(PhaseGVN* phase, bool can_reshape) {
+  Node* progress = MinMaxV_Common_Ideal(this, phase, can_reshape);
   if (progress != nullptr) return progress;
 
   return VectorNode::Ideal(phase, can_reshape);
 }
 
-Node* UMinVNode::Identity(PhaseGVN* phase) {
-  // UMin (a, a) => a
-  if (in(1) == in(2)) {
-    return in(1);
-  }
-  return this;
-}
-
-Node* UMaxVNode::Ideal(PhaseGVN* phase, bool can_reshape) {
-  Node* progress = UMinMaxV_Ideal(this, phase, can_reshape);
-  if (progress != nullptr) return progress;
-
-  return VectorNode::Ideal(phase, can_reshape);
-}
-
-Node* UMaxVNode::Identity(PhaseGVN* phase) {
-  // UMax (a, a) => a
+Node* MinMaxVNode::Identity(PhaseGVN* phase) {
   if (in(1) == in(2)) {
     return in(1);
   }
@@ -2502,4 +2503,5 @@ Node* UMaxVNode::Identity(PhaseGVN* phase) {
 void VectorBoxAllocateNode::dump_spec(outputStream *st) const {
   CallStaticJavaNode::dump_spec(st);
 }
+
 #endif // !PRODUCT
diff --git a/src/hotspot/share/opto/vectornode.hpp b/src/hotspot/share/opto/vectornode.hpp
index dce43f92905..c4fff06e771 100644
--- a/src/hotspot/share/opto/vectornode.hpp
+++ b/src/hotspot/share/opto/vectornode.hpp
@@ -662,10 +662,22 @@ public:
   virtual int Opcode() const;
 };
 
-// Vector Min
-class MinVNode : public VectorNode {
+// Common superclass for Min/Max vector nodes
+class MinMaxVNode : public VectorNode {
 public:
-  MinVNode(Node* in1, Node* in2, const TypeVect* vt) : VectorNode(in1, in2, vt) {}
+  MinMaxVNode(Node* in1, Node* in2, const TypeVect* vt) : VectorNode(in1, in2, vt) {}
+  virtual int min_opcode() const = 0;
+  virtual int max_opcode() const = 0;
+  virtual Node* Ideal(PhaseGVN* phase, bool can_reshape);
+  virtual Node* Identity(PhaseGVN* phase);
+};
+
+// Vector Min
+class MinVNode : public MinMaxVNode {
+public:
+  MinVNode(Node* in1, Node* in2, const TypeVect* vt) : MinMaxVNode(in1, in2, vt) {}
+  virtual int min_opcode() const { return Op_MinV; }
+  virtual int max_opcode() const { return Op_MaxV; }
   virtual int Opcode() const;
 };
 
@@ -684,31 +696,33 @@ public:
 };
 
 // Vector Unsigned Min
-class UMinVNode : public VectorNode {
+class UMinVNode : public MinMaxVNode {
  public:
-  UMinVNode(Node* in1, Node* in2, const TypeVect* vt) : VectorNode(in1, in2 ,vt) {
+  UMinVNode(Node* in1, Node* in2, const TypeVect* vt) : MinMaxVNode(in1, in2, vt) {
     assert(is_integral_type(vt->element_basic_type()), "");
   }
-  virtual Node* Ideal(PhaseGVN* phase, bool can_reshape);
-  virtual Node* Identity(PhaseGVN* phase);
+  virtual int min_opcode() const { return Op_UMinV; }
+  virtual int max_opcode() const { return Op_UMaxV; }
   virtual int Opcode() const;
 };
 
 // Vector Max
-class MaxVNode : public VectorNode {
+class MaxVNode : public MinMaxVNode {
  public:
-  MaxVNode(Node* in1, Node* in2, const TypeVect* vt) : VectorNode(in1, in2, vt) {}
+  MaxVNode(Node* in1, Node* in2, const TypeVect* vt) : MinMaxVNode(in1, in2, vt) {}
+  virtual int min_opcode() const { return Op_MinV; }
+  virtual int max_opcode() const { return Op_MaxV; }
   virtual int Opcode() const;
 };
 
 // Vector Unsigned Max
-class UMaxVNode : public VectorNode {
+class UMaxVNode : public MinMaxVNode {
  public:
-  UMaxVNode(Node* in1, Node* in2, const TypeVect* vt) : VectorNode(in1, in2, vt) {
+  UMaxVNode(Node* in1, Node* in2, const TypeVect* vt) : MinMaxVNode(in1, in2, vt) {
     assert(is_integral_type(vt->element_basic_type()), "");
   }
-  virtual Node* Ideal(PhaseGVN* phase, bool can_reshape);
-  virtual Node* Identity(PhaseGVN* phase);
+  virtual int min_opcode() const { return Op_UMinV; }
+  virtual int max_opcode() const { return Op_UMaxV; }
   virtual int Opcode() const;
 };
 
diff --git a/test/hotspot/jtreg/compiler/lib/ir_framework/IRNode.java b/test/hotspot/jtreg/compiler/lib/ir_framework/IRNode.java
index 3f742a0ce62..f3fc4afb170 100644
--- a/test/hotspot/jtreg/compiler/lib/ir_framework/IRNode.java
+++ b/test/hotspot/jtreg/compiler/lib/ir_framework/IRNode.java
@@ -1223,6 +1223,16 @@ public class IRNode {
         vectorNode(MAX_VI, "MaxV", TYPE_INT);
     }
 
+    public static final String MAX_VB = VECTOR_PREFIX + "MAX_VB" + POSTFIX;
+    static {
+        vectorNode(MAX_VB, "MaxV", TYPE_BYTE);
+    }
+
+    public static final String MAX_VS = VECTOR_PREFIX + "MAX_VS" + POSTFIX;
+    static {
+        vectorNode(MAX_VS, "MaxV", TYPE_SHORT);
+    }
+
     public static final String MAX_VHF = VECTOR_PREFIX + "MAX_VHF" + POSTFIX;
     static {
         vectorNode(MAX_VHF, "MaxVHF", TYPE_SHORT);
@@ -1339,6 +1349,16 @@ public class IRNode {
         vectorNode(MIN_VI, "MinV", TYPE_INT);
     }
 
+    public static final String MIN_VB = VECTOR_PREFIX + "MIN_VB" + POSTFIX;
+    static {
+        vectorNode(MIN_VB, "MinV", TYPE_BYTE);
+    }
+
+    public static final String MIN_VS = VECTOR_PREFIX + "MIN_VS" + POSTFIX;
+    static {
+        vectorNode(MIN_VS, "MinV", TYPE_SHORT);
+    }
+
     public static final String MIN_VHF = VECTOR_PREFIX + "MIN_VHF" + POSTFIX;
     static {
         vectorNode(MIN_VHF, "MinVHF", TYPE_SHORT);
diff --git a/test/hotspot/jtreg/compiler/vectorapi/VectorCommutativeOperSharingTest.java b/test/hotspot/jtreg/compiler/vectorapi/VectorCommutativeOperSharingTest.java
index a51946dd698..2b43cf26421 100644
--- a/test/hotspot/jtreg/compiler/vectorapi/VectorCommutativeOperSharingTest.java
+++ b/test/hotspot/jtreg/compiler/vectorapi/VectorCommutativeOperSharingTest.java
@@ -74,8 +74,8 @@ public class VectorCommutativeOperSharingTest {
     @Test
     @IR(counts = {IRNode.ADD_VI, IRNode.VECTOR_SIZE_ANY, " 2 ",
                   IRNode.MUL_VI, IRNode.VECTOR_SIZE_ANY, " 2 ",
-                  IRNode.MAX_VI, IRNode.VECTOR_SIZE_ANY, " 2 ",
-                  IRNode.MIN_VI, IRNode.VECTOR_SIZE_ANY, " 2 "},
+                  IRNode.MAX_VI, IRNode.VECTOR_SIZE_ANY, " 1 ",
+                  IRNode.MIN_VI, IRNode.VECTOR_SIZE_ANY, " 1 "},
         applyIfCPUFeatureOr = {"avx", "true", "rvv", "true"})
     public void testVectorIRSharing1(int index) {
         IntVector vec1 = IntVector.fromArray(I_SPECIES, ia, index);
diff --git a/test/hotspot/jtreg/compiler/vectorapi/VectorMinMaxTransforms.java b/test/hotspot/jtreg/compiler/vectorapi/VectorMinMaxTransforms.java
new file mode 100644
index 00000000000..acffe4d3257
--- /dev/null
+++ b/test/hotspot/jtreg/compiler/vectorapi/VectorMinMaxTransforms.java
@@ -0,0 +1,2036 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License
+ * version 2 along with this work; if not, write to the Free Software
+ * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+package compiler.vectorapi;
+
+import compiler.lib.generators.Generator;
+import compiler.lib.generators.Generators;
+import compiler.lib.ir_framework.*;
+import compiler.lib.verify.*;
+import jdk.incubator.vector.*;
+
+/**
+ * @test
+ * @bug 8372797
+ * @key randomness
+ * @library /test/lib /
+ * @summary IR verification for MinV/MaxV Identity and Ideal transforms
+ * @modules jdk.incubator.vector
+ *
+ * @run driver ${test.main.class}
+ */
+public class VectorMinMaxTransforms {
+    private static final int LENGTH = 256;
+    private static final Generators RD = Generators.G;
+
+    private static final VectorSpecies<Integer> I_SPECIES = IntVector.SPECIES_PREFERRED;
+    private static int[] ia, ib, ir;
+
+    private static final VectorSpecies<Long> L_SPECIES = LongVector.SPECIES_PREFERRED;
+    private static long[] la, lb, lr;
+
+    private static final VectorSpecies<Float> F_SPECIES = FloatVector.SPECIES_PREFERRED;
+    private static float[] fa, fb, fr;
+
+    private static final VectorSpecies<Double> D_SPECIES = DoubleVector.SPECIES_PREFERRED;
+    private static double[] da, db, dr;
+
+    private static final VectorSpecies<Byte> B_SPECIES = ByteVector.SPECIES_PREFERRED;
+    private static byte[] ba, bb, br;
+
+    private static final VectorSpecies<Short> S_SPECIES = ShortVector.SPECIES_PREFERRED;
+    private static short[] sa, sb, sr;
+
+    private static boolean[] m1arr, m2arr, m3arr;
+
+    static {
+        ia = new int[LENGTH];
+        ib = new int[LENGTH];
+        ir = new int[LENGTH];
+        la = new long[LENGTH];
+        lb = new long[LENGTH];
+        lr = new long[LENGTH];
+        fa = new float[LENGTH];
+        fb = new float[LENGTH];
+        fr = new float[LENGTH];
+        da = new double[LENGTH];
+        db = new double[LENGTH];
+        dr = new double[LENGTH];
+        ba = new byte[LENGTH];
+        bb = new byte[LENGTH];
+        br = new byte[LENGTH];
+        sa = new short[LENGTH];
+        sb = new short[LENGTH];
+        sr = new short[LENGTH];
+        m1arr = new boolean[LENGTH];
+        m2arr = new boolean[LENGTH];
+        m3arr = new boolean[LENGTH];
+
+        Generator<Integer> iGen = RD.ints();
+        Generator<Long> lGen = RD.longs();
+        Generator<Float> fGen = RD.floats();
+        Generator<Double> dGen = RD.doubles();
+
+        RD.fill(iGen, ia);
+        RD.fill(iGen, ib);
+        RD.fill(lGen, la);
+        RD.fill(lGen, lb);
+        RD.fill(fGen, fa);
+        RD.fill(fGen, fb);
+        RD.fill(dGen, da);
+        RD.fill(dGen, db);
+
+        for (int i = 0; i < LENGTH; i++) {
+            ba[i] = iGen.next().byteValue();
+            bb[i] = iGen.next().byteValue();
+            sa[i] = iGen.next().shortValue();
+            sb[i] = iGen.next().shortValue();
+            m1arr[i] = (i % 2) == 0;
+            m2arr[i] = (i % 2) != 0;
+            m3arr[i] = (i % 3) == 0;
+        }
+    }
+
+    public static void main(String[] args) {
+        TestFramework testFramework = new TestFramework();
+        testFramework.setDefaultWarmup(10000)
+                     .addFlags("--add-modules=jdk.incubator.vector")
+                     .start();
+    }
+
+    // ---------- Int: Identity min(a,a)=>a ----------
+    @Test
+    @IR(counts = { IRNode.MIN_VI, IRNode.VECTOR_SIZE_ANY, " 0 " },
+        applyIfCPUFeatureOr = {"avx", "true", "asimd", "true", "rvv", "true"})
+    public void testIntMinIdentity(int index) {
+        IntVector v = IntVector.fromArray(I_SPECIES, ia, index);
+        v.lanewise(VectorOperators.MIN, v).intoArray(ir, index);
+    }
+
+    @Run(test = "testIntMinIdentity")
+    public void runIntMinIdentity() {
+        for (int i = 0; i < I_SPECIES.loopBound(LENGTH); i += I_SPECIES.length()) {
+            testIntMinIdentity(i);
+        }
+        for (int i = 0; i < I_SPECIES.loopBound(LENGTH); i++) {
+            int expected = Math.min(ia[i], ia[i]);
+            Verify.checkEQ(ir[i], expected);
+        }
+    }
+
+    // ---------- Int: Identity max(a,a)=>a ----------
+    @Test
+    @IR(counts = { IRNode.MAX_VI, IRNode.VECTOR_SIZE_ANY, " 0 " },
+        applyIfCPUFeatureOr = {"avx", "true", "asimd", "true", "rvv", "true"})
+    public void testIntMaxIdentity(int index) {
+        IntVector v = IntVector.fromArray(I_SPECIES, ia, index);
+        v.lanewise(VectorOperators.MAX, v).intoArray(ir, index);
+    }
+
+    @Run(test = "testIntMaxIdentity")
+    public void runIntMaxIdentity() {
+        for (int i = 0; i < I_SPECIES.loopBound(LENGTH); i += I_SPECIES.length()) {
+            testIntMaxIdentity(i);
+        }
+        for (int i = 0; i < I_SPECIES.loopBound(LENGTH); i++) {
+            int expected = Math.max(ia[i], ia[i]);
+            Verify.checkEQ(ir[i], expected);
+        }
+    }
+
+    // ---------- Int: Ideal min(min(a,b), max(a,b)) => min(a,b) ----------
+    @Test
+    @IR(counts = { IRNode.MIN_VI, IRNode.VECTOR_SIZE_ANY, " 1 ",
+                   IRNode.MAX_VI, IRNode.VECTOR_SIZE_ANY, " 0 " },
+        applyIfCPUFeatureOr = {"avx", "true", "asimd", "true", "rvv", "true"})
+    public void testIntMinIdeal(int index) {
+        IntVector v1 = IntVector.fromArray(I_SPECIES, ia, index);
+        IntVector v2 = IntVector.fromArray(I_SPECIES, ib, index);
+        v1.lanewise(VectorOperators.MIN, v2)
+          .lanewise(VectorOperators.MIN, v1.lanewise(VectorOperators.MAX, v2))
+          .intoArray(ir, index);
+    }
+
+    @Run(test = "testIntMinIdeal")
+    public void runIntMinIdeal() {
+        for (int i = 0; i < I_SPECIES.loopBound(LENGTH); i += I_SPECIES.length()) {
+            testIntMinIdeal(i);
+        }
+        for (int i = 0; i < I_SPECIES.loopBound(LENGTH); i++) {
+            int expected = Math.min(Math.min(ia[i], ib[i]), Math.max(ia[i], ib[i]));
+            Verify.checkEQ(ir[i], expected);
+        }
+    }
+
+    // ---------- Int: Ideal max(min(a,b), max(a,b)) => max(a,b) ----------
+    @Test
+    @IR(counts = { IRNode.MIN_VI, IRNode.VECTOR_SIZE_ANY, " 0 ",
+                   IRNode.MAX_VI, IRNode.VECTOR_SIZE_ANY, " 1 " },
+        applyIfCPUFeatureOr = {"avx", "true", "asimd", "true", "rvv", "true"})
+    public void testIntMaxIdeal(int index) {
+        IntVector v1 = IntVector.fromArray(I_SPECIES, ia, index);
+        IntVector v2 = IntVector.fromArray(I_SPECIES, ib, index);
+        v1.lanewise(VectorOperators.MIN, v2)
+          .lanewise(VectorOperators.MAX, v1.lanewise(VectorOperators.MAX, v2))
+          .intoArray(ir, index);
+    }
+
+    @Run(test = "testIntMaxIdeal")
+    public void runIntMaxIdeal() {
+        for (int i = 0; i < I_SPECIES.loopBound(LENGTH); i += I_SPECIES.length()) {
+            testIntMaxIdeal(i);
+        }
+        for (int i = 0; i < I_SPECIES.loopBound(LENGTH); i++) {
+            int expected = Math.max(Math.min(ia[i], ib[i]), Math.max(ia[i], ib[i]));
+            Verify.checkEQ(ir[i], expected);
+        }
+    }
+
+    // ---------- Long: Identity and Ideal ----------
+    @Test
+    @IR(counts = { IRNode.MIN_VL, IRNode.VECTOR_SIZE_ANY, " 0 " },
+        applyIfCPUFeatureOr = {"avx2", "true", "asimd", "true", "rvv", "true"})
+    public void testLongMinIdentity(int index) {
+        LongVector v = LongVector.fromArray(L_SPECIES, la, index);
+        v.lanewise(VectorOperators.MIN, v).intoArray(lr, index);
+    }
+
+    @Run(test = "testLongMinIdentity")
+    public void runLongMinIdentity() {
+        for (int i = 0; i < L_SPECIES.loopBound(LENGTH); i += L_SPECIES.length()) {
+            testLongMinIdentity(i);
+        }
+        for (int i = 0; i < L_SPECIES.loopBound(LENGTH); i++) {
+            Verify.checkEQ(lr[i], la[i]);
+        }
+    }
+
+    // ---------- Long: Identity max(a,a)=>a ----------
+    @Test
+    @IR(counts = { IRNode.MAX_VL, IRNode.VECTOR_SIZE_ANY, " 0 " },
+        applyIfCPUFeatureOr = {"avx2", "true", "asimd", "true", "rvv", "true"})
+    public void testLongMaxIdentity(int index) {
+        LongVector v = LongVector.fromArray(L_SPECIES, la, index);
+        v.lanewise(VectorOperators.MAX, v).intoArray(lr, index);
+    }
+
+    @Run(test = "testLongMaxIdentity")
+    public void runLongMaxIdentity() {
+        for (int i = 0; i < L_SPECIES.loopBound(LENGTH); i += L_SPECIES.length()) {
+            testLongMaxIdentity(i);
+        }
+        for (int i = 0; i < L_SPECIES.loopBound(LENGTH); i++) {
+            Verify.checkEQ(lr[i], la[i]);
+        }
+    }
+
+    // ---------- Long: Ideal min(min(a,b), max(a,b)) => min(a,b) ----------
+    @Test
+    @IR(counts = { IRNode.MIN_VL, IRNode.VECTOR_SIZE_ANY, " 1 ",
+                   IRNode.MAX_VL, IRNode.VECTOR_SIZE_ANY, " 0 " },
+        applyIfCPUFeatureOr = {"avx2", "true", "asimd", "true", "rvv", "true"})
+    public void testLongMinIdeal(int index) {
+        LongVector v1 = LongVector.fromArray(L_SPECIES, la, index);
+        LongVector v2 = LongVector.fromArray(L_SPECIES, lb, index);
+        v1.lanewise(VectorOperators.MIN, v2)
+          .lanewise(VectorOperators.MIN, v1.lanewise(VectorOperators.MAX, v2))
+          .intoArray(lr, index);
+    }
+
+    @Run(test = "testLongMinIdeal")
+    public void runLongMinIdeal() {
+        for (int i = 0; i < L_SPECIES.loopBound(LENGTH); i += L_SPECIES.length()) {
+            testLongMinIdeal(i);
+        }
+        for (int i = 0; i < L_SPECIES.loopBound(LENGTH); i++) {
+            long expected = Math.min(Math.min(la[i], lb[i]), Math.max(la[i], lb[i]));
+            Verify.checkEQ(lr[i], expected);
+        }
+    }
+
+    // ---------- Long: Ideal max(min(a,b), max(a,b)) => max(a,b) ----------
+    @Test
+    @IR(counts = { IRNode.MIN_VL, IRNode.VECTOR_SIZE_ANY, " 0 ",
+                   IRNode.MAX_VL, IRNode.VECTOR_SIZE_ANY, " 1 " },
+        applyIfCPUFeatureOr = {"avx2", "true", "asimd", "true", "rvv", "true"})
+    public void testLongMaxIdeal(int index) {
+        LongVector v1 = LongVector.fromArray(L_SPECIES, la, index);
+        LongVector v2 = LongVector.fromArray(L_SPECIES, lb, index);
+        v1.lanewise(VectorOperators.MIN, v2)
+          .lanewise(VectorOperators.MAX, v1.lanewise(VectorOperators.MAX, v2))
+          .intoArray(lr, index);
+    }
+
+    @Run(test = "testLongMaxIdeal")
+    public void runLongMaxIdeal() {
+        for (int i = 0; i < L_SPECIES.loopBound(LENGTH); i += L_SPECIES.length()) {
+            testLongMaxIdeal(i);
+        }
+        for (int i = 0; i < L_SPECIES.loopBound(LENGTH); i++) {
+            long expected = Math.max(Math.min(la[i], lb[i]), Math.max(la[i], lb[i]));
+            Verify.checkEQ(lr[i], expected);
+        }
+    }
+
+    // ---------- Float: Identity min(a,a)=>a ----------
+    @Test
+    @IR(counts = { IRNode.MIN_VF, IRNode.VECTOR_SIZE_ANY, " 0 " },
+        applyIfCPUFeatureOr = {"avx", "true", "asimd", "true", "rvv", "true"})
+    public void testFloatMinIdentity(int index) {
+        FloatVector v = FloatVector.fromArray(F_SPECIES, fa, index);
+        v.lanewise(VectorOperators.MIN, v).intoArray(fr, index);
+    }
+
+    @Run(test = "testFloatMinIdentity")
+    public void runFloatMinIdentity() {
+        for (int i = 0; i < F_SPECIES.loopBound(LENGTH); i += F_SPECIES.length()) {
+            testFloatMinIdentity(i);
+        }
+        for (int i = 0; i < F_SPECIES.loopBound(LENGTH); i++) {
+            Verify.checkEQ(fr[i], fa[i]);
+        }
+    }
+
+    // ---------- Float: Identity max(a,a)=>a ----------
+    @Test
+    @IR(counts = { IRNode.MAX_VF, IRNode.VECTOR_SIZE_ANY, " 0 " },
+        applyIfCPUFeatureOr = {"avx", "true", "asimd", "true", "rvv", "true"})
+    public void testFloatMaxIdentity(int index) {
+        FloatVector v = FloatVector.fromArray(F_SPECIES, fa, index);
+        v.lanewise(VectorOperators.MAX, v).intoArray(fr, index);
+    }
+
+    @Run(test = "testFloatMaxIdentity")
+    public void runFloatMaxIdentity() {
+        for (int i = 0; i < F_SPECIES.loopBound(LENGTH); i += F_SPECIES.length()) {
+            testFloatMaxIdentity(i);
+        }
+        for (int i = 0; i < F_SPECIES.loopBound(LENGTH); i++) {
+            Verify.checkEQ(fr[i], fa[i]);
+        }
+    }
+
+    // ---------- Float: Ideal min(min(a,b), max(a,b)) => min(a,b) ----------
+    @Test
+    @IR(counts = { IRNode.MIN_VF, IRNode.VECTOR_SIZE_ANY, " 1 ",
+                   IRNode.MAX_VF, IRNode.VECTOR_SIZE_ANY, " 0 " },
+        applyIfCPUFeatureOr = {"avx", "true", "asimd", "true", "rvv", "true"})
+    public void testFloatMinIdeal(int index) {
+        FloatVector v1 = FloatVector.fromArray(F_SPECIES, fa, index);
+        FloatVector v2 = FloatVector.fromArray(F_SPECIES, fb, index);
+        v1.lanewise(VectorOperators.MIN, v2)
+          .lanewise(VectorOperators.MIN, v1.lanewise(VectorOperators.MAX, v2))
+          .intoArray(fr, index);
+    }
+
+    @Run(test = "testFloatMinIdeal")
+    public void runFloatMinIdeal() {
+        for (int i = 0; i < F_SPECIES.loopBound(LENGTH); i += F_SPECIES.length()) {
+            testFloatMinIdeal(i);
+        }
+        for (int i = 0; i < F_SPECIES.loopBound(LENGTH); i++) {
+            float expected = Math.min(Math.min(fa[i], fb[i]), Math.max(fa[i], fb[i]));
+            Verify.checkEQ(fr[i], expected);
+        }
+    }
+
+    // ---------- Float: Ideal max(min(a,b), max(a,b)) => max(a,b) ----------
+    @Test
+    @IR(counts = { IRNode.MIN_VF, IRNode.VECTOR_SIZE_ANY, " 0 ",
+                   IRNode.MAX_VF, IRNode.VECTOR_SIZE_ANY, " 1 " },
+        applyIfCPUFeatureOr = {"avx", "true", "asimd", "true", "rvv", "true"})
+    public void testFloatMaxIdeal(int index) {
+        FloatVector v1 = FloatVector.fromArray(F_SPECIES, fa, index);
+        FloatVector v2 = FloatVector.fromArray(F_SPECIES, fb, index);
+        v1.lanewise(VectorOperators.MIN, v2)
+          .lanewise(VectorOperators.MAX, v1.lanewise(VectorOperators.MAX, v2))
+          .intoArray(fr, index);
+    }
+
+    @Run(test = "testFloatMaxIdeal")
+    public void runFloatMaxIdeal() {
+        for (int i = 0; i < F_SPECIES.loopBound(LENGTH); i += F_SPECIES.length()) {
+            testFloatMaxIdeal(i);
+        }
+        for (int i = 0; i < F_SPECIES.loopBound(LENGTH); i++) {
+            float expected = Math.max(Math.min(fa[i], fb[i]), Math.max(fa[i], fb[i]));
+            Verify.checkEQ(fr[i], expected);
+        }
+    }
+
+    // ---------- Double: Identity min(a,a)=>a ----------
+    @Test
+    @IR(counts = { IRNode.MIN_VD, IRNode.VECTOR_SIZE_ANY, " 0 " },
+        applyIfCPUFeatureOr = {"avx", "true", "asimd", "true", "rvv", "true"})
+    public void testDoubleMinIdentity(int index) {
+        DoubleVector v = DoubleVector.fromArray(D_SPECIES, da, index);
+        v.lanewise(VectorOperators.MIN, v).intoArray(dr, index);
+    }
+
+    @Run(test = "testDoubleMinIdentity")
+    public void runDoubleMinIdentity() {
+        for (int i = 0; i < D_SPECIES.loopBound(LENGTH); i += D_SPECIES.length()) {
+            testDoubleMinIdentity(i);
+        }
+        for (int i = 0; i < D_SPECIES.loopBound(LENGTH); i++) {
+            Verify.checkEQ(dr[i], da[i]);
+        }
+    }
+
+    // ---------- Double: Identity max(a,a)=>a ----------
+    @Test
+    @IR(counts = { IRNode.MAX_VD, IRNode.VECTOR_SIZE_ANY, " 0 " },
+        applyIfCPUFeatureOr = {"avx", "true", "asimd", "true", "rvv", "true"})
+    public void testDoubleMaxIdentity(int index) {
+        DoubleVector v = DoubleVector.fromArray(D_SPECIES, da, index);
+        v.lanewise(VectorOperators.MAX, v).intoArray(dr, index);
+    }
+
+    @Run(test = "testDoubleMaxIdentity")
+    public void runDoubleMaxIdentity() {
+        for (int i = 0; i < D_SPECIES.loopBound(LENGTH); i += D_SPECIES.length()) {
+            testDoubleMaxIdentity(i);
+        }
+        for (int i = 0; i < D_SPECIES.loopBound(LENGTH); i++) {
+            Verify.checkEQ(dr[i], da[i]);
+        }
+    }
+
+    // ---------- Double: Ideal min(min(a,b), max(a,b)) => min(a,b) ----------
+    @Test
+    @IR(counts = { IRNode.MIN_VD, IRNode.VECTOR_SIZE_ANY, " 1 ",
+                   IRNode.MAX_VD, IRNode.VECTOR_SIZE_ANY, " 0 " },
+        applyIfCPUFeatureOr = {"avx", "true", "asimd", "true", "rvv", "true"})
+    public void testDoubleMinIdeal(int index) {
+        DoubleVector v1 = DoubleVector.fromArray(D_SPECIES, da, index);
+        DoubleVector v2 = DoubleVector.fromArray(D_SPECIES, db, index);
+        v1.lanewise(VectorOperators.MIN, v2)
+          .lanewise(VectorOperators.MIN, v1.lanewise(VectorOperators.MAX, v2))
+          .intoArray(dr, index);
+    }
+
+    @Run(test = "testDoubleMinIdeal")
+    public void runDoubleMinIdeal() {
+        for (int i = 0; i < D_SPECIES.loopBound(LENGTH); i += D_SPECIES.length()) {
+            testDoubleMinIdeal(i);
+        }
+        for (int i = 0; i < D_SPECIES.loopBound(LENGTH); i++) {
+            double expected = Math.min(Math.min(da[i], db[i]), Math.max(da[i], db[i]));
+            Verify.checkEQ(dr[i], expected);
+        }
+    }
+
+    // ---------- Double: Ideal max(min(a,b), max(a,b)) => max(a,b) ----------
+    @Test
+    @IR(counts = { IRNode.MIN_VD, IRNode.VECTOR_SIZE_ANY, " 0 ",
+                   IRNode.MAX_VD, IRNode.VECTOR_SIZE_ANY, " 1 " },
+        applyIfCPUFeatureOr = {"avx", "true", "asimd", "true", "rvv", "true"})
+    public void testDoubleMaxIdeal(int index) {
+        DoubleVector v1 = DoubleVector.fromArray(D_SPECIES, da, index);
+        DoubleVector v2 = DoubleVector.fromArray(D_SPECIES, db, index);
+        v1.lanewise(VectorOperators.MIN, v2)
+          .lanewise(VectorOperators.MAX, v1.lanewise(VectorOperators.MAX, v2))
+          .intoArray(dr, index);
+    }
+
+    @Run(test = "testDoubleMaxIdeal")
+    public void runDoubleMaxIdeal() {
+        for (int i = 0; i < D_SPECIES.loopBound(LENGTH); i += D_SPECIES.length()) {
+            testDoubleMaxIdeal(i);
+        }
+        for (int i = 0; i < D_SPECIES.loopBound(LENGTH); i++) {
+            double expected = Math.max(Math.min(da[i], db[i]), Math.max(da[i], db[i]));
+            Verify.checkEQ(dr[i], expected);
+        }
+    }
+
+    // ---------- Byte: Identity min(a,a)=>a ----------
+    @Test
+    @IR(counts = { IRNode.MIN_VB, IRNode.VECTOR_SIZE_ANY, " 0 " },
+        applyIfCPUFeatureOr = {"avx", "true", "asimd", "true", "rvv", "true"})
+    public void testByteMinIdentity(int index) {
+        ByteVector v = ByteVector.fromArray(B_SPECIES, ba, index);
+        v.lanewise(VectorOperators.MIN, v).intoArray(br, index);
+    }
+
+    @Run(test = "testByteMinIdentity")
+    public void runByteMinIdentity() {
+        for (int i = 0; i < B_SPECIES.loopBound(LENGTH); i += B_SPECIES.length()) {
+            testByteMinIdentity(i);
+        }
+        for (int i = 0; i < B_SPECIES.loopBound(LENGTH); i++) {
+            Verify.checkEQ(br[i], ba[i]);
+        }
+    }
+
+    // ---------- Byte: Identity max(a,a)=>a ----------
+    @Test
+    @IR(counts = { IRNode.MAX_VB, IRNode.VECTOR_SIZE_ANY, " 0 " },
+        applyIfCPUFeatureOr = {"avx", "true", "asimd", "true", "rvv", "true"})
+    public void testByteMaxIdentity(int index) {
+        ByteVector v = ByteVector.fromArray(B_SPECIES, ba, index);
+        v.lanewise(VectorOperators.MAX, v).intoArray(br, index);
+    }
+
+    @Run(test = "testByteMaxIdentity")
+    public void runByteMaxIdentity() {
+        for (int i = 0; i < B_SPECIES.loopBound(LENGTH); i += B_SPECIES.length()) {
+            testByteMaxIdentity(i);
+        }
+        for (int i = 0; i < B_SPECIES.loopBound(LENGTH); i++) {
+            Verify.checkEQ(br[i], ba[i]);
+        }
+    }
+
+    // ---------- Byte: Ideal min(min(a,b), max(a,b)) => min(a,b) ----------
+    @Test
+    @IR(counts = { IRNode.MIN_VB, IRNode.VECTOR_SIZE_ANY, " 1 ",
+                   IRNode.MAX_VB, IRNode.VECTOR_SIZE_ANY, " 0 " },
+        applyIfCPUFeatureOr = {"avx", "true", "asimd", "true", "rvv", "true"})
+    public void testByteMinIdeal(int index) {
+        ByteVector v1 = ByteVector.fromArray(B_SPECIES, ba, index);
+        ByteVector v2 = ByteVector.fromArray(B_SPECIES, bb, index);
+        v1.lanewise(VectorOperators.MIN, v2)
+          .lanewise(VectorOperators.MIN, v1.lanewise(VectorOperators.MAX, v2))
+          .intoArray(br, index);
+    }
+
+    @Run(test = "testByteMinIdeal")
+    public void runByteMinIdeal() {
+        for (int i = 0; i < B_SPECIES.loopBound(LENGTH); i += B_SPECIES.length()) {
+            testByteMinIdeal(i);
+        }
+        for (int i = 0; i < B_SPECIES.loopBound(LENGTH); i++) {
+            byte expected = (byte) Math.min(Math.min(ba[i], bb[i]), Math.max(ba[i], bb[i]));
+            Verify.checkEQ(br[i], expected);
+        }
+    }
+
+    // ---------- Byte: Ideal max(min(a,b), max(a,b)) => max(a,b) ----------
+    @Test
+    @IR(counts = { IRNode.MIN_VB, IRNode.VECTOR_SIZE_ANY, " 0 ",
+                   IRNode.MAX_VB, IRNode.VECTOR_SIZE_ANY, " 1 " },
+        applyIfCPUFeatureOr = {"avx", "true", "asimd", "true", "rvv", "true"})
+    public void testByteMaxIdeal(int index) {
+        ByteVector v1 = ByteVector.fromArray(B_SPECIES, ba, index);
+        ByteVector v2 = ByteVector.fromArray(B_SPECIES, bb, index);
+        v1.lanewise(VectorOperators.MIN, v2)
+          .lanewise(VectorOperators.MAX, v1.lanewise(VectorOperators.MAX, v2))
+          .intoArray(br, index);
+    }
+
+    @Run(test = "testByteMaxIdeal")
+    public void runByteMaxIdeal() {
+        for (int i = 0; i < B_SPECIES.loopBound(LENGTH); i += B_SPECIES.length()) {
+            testByteMaxIdeal(i);
+        }
+        for (int i = 0; i < B_SPECIES.loopBound(LENGTH); i++) {
+            byte expected = (byte) Math.max(Math.min(ba[i], bb[i]), Math.max(ba[i], bb[i]));
+            Verify.checkEQ(br[i], expected);
+        }
+    }
+
+    // ---------- Short: Identity min(a,a)=>a ----------
+    @Test
+    @IR(counts = { IRNode.MIN_VS, IRNode.VECTOR_SIZE_ANY, " 0 " },
+        applyIfCPUFeatureOr = {"avx", "true", "asimd", "true", "rvv", "true"})
+    public void testShortMinIdentity(int index) {
+        ShortVector v = ShortVector.fromArray(S_SPECIES, sa, index);
+        v.lanewise(VectorOperators.MIN, v).intoArray(sr, index);
+    }
+
+    @Run(test = "testShortMinIdentity")
+    public void runShortMinIdentity() {
+        for (int i = 0; i < S_SPECIES.loopBound(LENGTH); i += S_SPECIES.length()) {
+            testShortMinIdentity(i);
+        }
+        for (int i = 0; i < S_SPECIES.loopBound(LENGTH); i++) {
+            Verify.checkEQ(sr[i], sa[i]);
+        }
+    }
+
+    // ---------- Short: Identity max(a,a)=>a ----------
+    @Test
+    @IR(counts = { IRNode.MAX_VS, IRNode.VECTOR_SIZE_ANY, " 0 " },
+        applyIfCPUFeatureOr = {"avx", "true", "asimd", "true", "rvv", "true"})
+    public void testShortMaxIdentity(int index) {
+        ShortVector v = ShortVector.fromArray(S_SPECIES, sa, index);
+        v.lanewise(VectorOperators.MAX, v).intoArray(sr, index);
+    }
+
+    @Run(test = "testShortMaxIdentity")
+    public void runShortMaxIdentity() {
+        for (int i = 0; i < S_SPECIES.loopBound(LENGTH); i += S_SPECIES.length()) {
+            testShortMaxIdentity(i);
+        }
+        for (int i = 0; i < S_SPECIES.loopBound(LENGTH); i++) {
+            Verify.checkEQ(sr[i], sa[i]);
+        }
+    }
+
+    // ---------- Short: Ideal min(min(a,b), max(a,b)) => min(a,b) ----------
+    @Test
+    @IR(counts = { IRNode.MIN_VS, IRNode.VECTOR_SIZE_ANY, " 1 ",
+                   IRNode.MAX_VS, IRNode.VECTOR_SIZE_ANY, " 0 " },
+        applyIfCPUFeatureOr = {"avx", "true", "asimd", "true", "rvv", "true"})
+    public void testShortMinIdeal(int index) {
+        ShortVector v1 = ShortVector.fromArray(S_SPECIES, sa, index);
+        ShortVector v2 = ShortVector.fromArray(S_SPECIES, sb, index);
+        v1.lanewise(VectorOperators.MIN, v2)
+          .lanewise(VectorOperators.MIN, v1.lanewise(VectorOperators.MAX, v2))
+          .intoArray(sr, index);
+    }
+
+    @Run(test = "testShortMinIdeal")
+    public void runShortMinIdeal() {
+        for (int i = 0; i < S_SPECIES.loopBound(LENGTH); i += S_SPECIES.length()) {
+            testShortMinIdeal(i);
+        }
+        for (int i = 0; i < S_SPECIES.loopBound(LENGTH); i++) {
+            short expected = (short) Math.min(Math.min(sa[i], sb[i]), Math.max(sa[i], sb[i]));
+            Verify.checkEQ(sr[i], expected);
+        }
+    }
+
+    // ---------- Short: Ideal max(min(a,b), max(a,b)) => max(a,b) ----------
+    @Test
+    @IR(counts = { IRNode.MIN_VS, IRNode.VECTOR_SIZE_ANY, " 0 ",
+                   IRNode.MAX_VS, IRNode.VECTOR_SIZE_ANY, " 1 " },
+        applyIfCPUFeatureOr = {"avx", "true", "asimd", "true", "rvv", "true"})
+    public void testShortMaxIdeal(int index) {
+        ShortVector v1 = ShortVector.fromArray(S_SPECIES, sa, index);
+        ShortVector v2 = ShortVector.fromArray(S_SPECIES, sb, index);
+        v1.lanewise(VectorOperators.MIN, v2)
+          .lanewise(VectorOperators.MAX, v1.lanewise(VectorOperators.MAX, v2))
+          .intoArray(sr, index);
+    }
+
+    @Run(test = "testShortMaxIdeal")
+    public void runShortMaxIdeal() {
+        for (int i = 0; i < S_SPECIES.loopBound(LENGTH); i += S_SPECIES.length()) {
+            testShortMaxIdeal(i);
+        }
+        for (int i = 0; i < S_SPECIES.loopBound(LENGTH); i++) {
+            short expected = (short) Math.max(Math.min(sa[i], sb[i]), Math.max(sa[i], sb[i]));
+            Verify.checkEQ(sr[i], expected);
+        }
+    }
+
+    // Predicated Int: min(min(a,b,m), max(a,b,m), m) => min(a,b,m)
+    @Test
+    @IR(counts = { IRNode.MIN_VI, IRNode.VECTOR_SIZE_ANY, " 1 ",
+                   IRNode.MAX_VI, IRNode.VECTOR_SIZE_ANY, " 0 " },
+        applyIfCPUFeatureOr = {"avx512f", "true", "sve", "true"})
+    public void testIntMaskedMinIdealSameMask(int index) {
+        IntVector v1 = IntVector.fromArray(I_SPECIES, ia, index);
+        IntVector v2 = IntVector.fromArray(I_SPECIES, ib, index);
+        VectorMask<Integer> m = VectorMask.fromArray(I_SPECIES, m1arr, index);
+        v1.lanewise(VectorOperators.MIN, v2, m)
+          .lanewise(VectorOperators.MIN, v1.lanewise(VectorOperators.MAX, v2, m), m)
+          .intoArray(ir, index);
+    }
+
+    @Run(test = "testIntMaskedMinIdealSameMask")
+    public void runIntMaskedMinIdealSameMask() {
+        for (int i = 0; i < I_SPECIES.loopBound(LENGTH); i += I_SPECIES.length()) {
+            testIntMaskedMinIdealSameMask(i);
+        }
+        for (int i = 0; i < I_SPECIES.loopBound(LENGTH); i++) {
+            int a = ia[i], b = ib[i];
+            boolean mask = m1arr[i];
+            int minAB = mask ? Math.min(a, b) : a;
+            int maxAB = mask ? Math.max(a, b) : a;
+            int expected = mask ? Math.min(minAB, maxAB) : minAB;
+            Verify.checkEQ(ir[i], expected);
+        }
+    }
+
+    // Predicated Int: max(min(a,b,m), max(a,b,m), m) => max(a,b,m)
+    @Test
+    @IR(counts = { IRNode.MIN_VI, IRNode.VECTOR_SIZE_ANY, " 0 ",
+                   IRNode.MAX_VI, IRNode.VECTOR_SIZE_ANY, " 1 " },
+        applyIfCPUFeatureOr = {"avx512f", "true", "sve", "true"})
+    public void testIntMaskedMaxIdealSameMask(int index) {
+        IntVector v1 = IntVector.fromArray(I_SPECIES, ia, index);
+        IntVector v2 = IntVector.fromArray(I_SPECIES, ib, index);
+        VectorMask<Integer> m = VectorMask.fromArray(I_SPECIES, m1arr, index);
+        v1.lanewise(VectorOperators.MIN, v2, m)
+          .lanewise(VectorOperators.MAX, v1.lanewise(VectorOperators.MAX, v2, m), m)
+          .intoArray(ir, index);
+    }
+
+    @Run(test = "testIntMaskedMaxIdealSameMask")
+    public void runIntMaskedMaxIdealSameMask() {
+        for (int i = 0; i < I_SPECIES.loopBound(LENGTH); i += I_SPECIES.length()) {
+            testIntMaskedMaxIdealSameMask(i);
+        }
+        for (int i = 0; i < I_SPECIES.loopBound(LENGTH); i++) {
+            int a = ia[i], b = ib[i];
+            boolean mask = m1arr[i];
+            int minAB = mask ? Math.min(a, b) : a;
+            int maxAB = mask ? Math.max(a, b) : a;
+            int expected = mask ? Math.max(minAB, maxAB) : minAB;
+            Verify.checkEQ(ir[i], expected);
+        }
+    }
+
+    // Predicated Int: max(min(a,b,m), max(b,a,m), m) => max(a,b,m)
+    @Test
+    @IR(counts = { IRNode.MIN_VI, IRNode.VECTOR_SIZE_ANY, " 0 ",
+                   IRNode.MAX_VI, IRNode.VECTOR_SIZE_ANY, " 1 " },
+        applyIfCPUFeatureOr = {"avx512f", "true", "sve", "true"})
+    public void testIntMaskedMaxIdealFlippedInputs(int index) {
+        IntVector v1 = IntVector.fromArray(I_SPECIES, ia, index);
+        IntVector v2 = IntVector.fromArray(I_SPECIES, ib, index);
+        VectorMask<Integer> m = VectorMask.fromArray(I_SPECIES, m1arr, index);
+        v1.lanewise(VectorOperators.MIN, v2, m)
+          .lanewise(VectorOperators.MAX, v2.lanewise(VectorOperators.MAX, v1, m), m)
+          .intoArray(ir, index);
+    }
+
+    @Run(test = "testIntMaskedMaxIdealFlippedInputs")
+    public void runIntMaskedMaxIdealFlippedInputs() {
+        for (int i = 0; i < I_SPECIES.loopBound(LENGTH); i += I_SPECIES.length()) {
+            testIntMaskedMaxIdealFlippedInputs(i);
+        }
+        for (int i = 0; i < I_SPECIES.loopBound(LENGTH); i++) {
+            int a = ia[i], b = ib[i];
+            boolean mask = m1arr[i];
+            int minAB = mask ? Math.min(a, b) : a;
+            int maxBA = mask ? Math.max(b, a) : b;
+            int expected = mask ? Math.max(minAB, maxBA) : minAB;
+            Verify.checkEQ(ir[i], expected);
+        }
+    }
+
+    // Predicated Int: min(min(a,b,m), max(b,a,m), m) => min(a,b,m)
+    @Test
+    @IR(counts = { IRNode.MIN_VI, IRNode.VECTOR_SIZE_ANY, " 1 ",
+                   IRNode.MAX_VI, IRNode.VECTOR_SIZE_ANY, " 0 " },
+        applyIfCPUFeatureOr = {"avx512f", "true", "sve", "true"})
+    public void testIntMaskedMinIdealFlippedInputs(int index) {
+        IntVector v1 = IntVector.fromArray(I_SPECIES, ia, index);
+        IntVector v2 = IntVector.fromArray(I_SPECIES, ib, index);
+        VectorMask<Integer> m = VectorMask.fromArray(I_SPECIES, m1arr, index);
+        v1.lanewise(VectorOperators.MIN, v2, m)
+          .lanewise(VectorOperators.MIN, v2.lanewise(VectorOperators.MAX, v1, m), m)
+          .intoArray(ir, index);
+    }
+
+    @Run(test = "testIntMaskedMinIdealFlippedInputs")
+    public void runIntMaskedMinIdealFlippedInputs() {
+        for (int i = 0; i < I_SPECIES.loopBound(LENGTH); i += I_SPECIES.length()) {
+            testIntMaskedMinIdealFlippedInputs(i);
+        }
+        for (int i = 0; i < I_SPECIES.loopBound(LENGTH); i++) {
+            int a = ia[i], b = ib[i];
+            boolean mask = m1arr[i];
+            int minAB = mask ? Math.min(a, b) : a;
+            int maxBA = mask ? Math.max(b, a) : b;
+            int expected = mask ? Math.min(minAB, maxBA) : minAB;
+            Verify.checkEQ(ir[i], expected);
+        }
+    }
+
+    // Predicated Int: min(min(a,b,m1), max(a,b,m2), m1) => NO transform
+    @Test
+    @IR(counts = { IRNode.MIN_VI, IRNode.VECTOR_SIZE_ANY, " 2 ",
+                   IRNode.MAX_VI, IRNode.VECTOR_SIZE_ANY, " 1 " },
+        applyIfCPUFeatureOr = {"avx512f", "true", "sve", "true"})
+    public void testIntMaskedMinIdealDiffMaskMinMax(int index) {
+        IntVector v1 = IntVector.fromArray(I_SPECIES, ia, index);
+        IntVector v2 = IntVector.fromArray(I_SPECIES, ib, index);
+        VectorMask<Integer> mask1 = VectorMask.fromArray(I_SPECIES, m1arr, index);
+        VectorMask<Integer> mask2 = VectorMask.fromArray(I_SPECIES, m2arr, index);
+        v1.lanewise(VectorOperators.MIN, v2, mask1)
+          .lanewise(VectorOperators.MIN, v1.lanewise(VectorOperators.MAX, v2, mask2), mask1)
+          .intoArray(ir, index);
+    }
+
+    @Run(test = "testIntMaskedMinIdealDiffMaskMinMax")
+    public void runIntMaskedMinIdealDiffMaskMinMax() {
+        for (int i = 0; i < I_SPECIES.loopBound(LENGTH); i += I_SPECIES.length()) {
+            testIntMaskedMinIdealDiffMaskMinMax(i);
+        }
+        for (int i = 0; i < I_SPECIES.loopBound(LENGTH); i++) {
+            int a = ia[i], b = ib[i];
+            int minAB = m1arr[i] ? Math.min(a, b) : a;
+            int maxAB = m2arr[i] ? Math.max(a, b) : a;
+            int expected = m1arr[i] ? Math.min(minAB, maxAB) : minAB;
+            Verify.checkEQ(ir[i], expected);
+        }
+    }
+
+
+    // Predicated Int: min(min(a,b,m2), max(a,b,m1), m1) => NO transform
+    @Test
+    @IR(counts = { IRNode.MIN_VI, IRNode.VECTOR_SIZE_ANY, " 2 ",
+                   IRNode.MAX_VI, IRNode.VECTOR_SIZE_ANY, " 1 " },
+        applyIfCPUFeatureOr = {"avx512f", "true", "sve", "true"})
+    public void testIntMaskedMinIdealDiffMaskMinMaxSwapped(int index) {
+        IntVector v1 = IntVector.fromArray(I_SPECIES, ia, index);
+        IntVector v2 = IntVector.fromArray(I_SPECIES, ib, index);
+        VectorMask<Integer> mask1 = VectorMask.fromArray(I_SPECIES, m1arr, index);
+        VectorMask<Integer> mask2 = VectorMask.fromArray(I_SPECIES, m2arr, index);
+        v1.lanewise(VectorOperators.MIN, v2, mask2)
+          .lanewise(VectorOperators.MIN, v1.lanewise(VectorOperators.MAX, v2, mask1), mask1)
+          .intoArray(ir, index);
+    }
+
+    @Run(test = "testIntMaskedMinIdealDiffMaskMinMaxSwapped")
+    public void runIntMaskedMinIdealDiffMaskMinMaxSwapped() {
+        for (int i = 0; i < I_SPECIES.loopBound(LENGTH); i += I_SPECIES.length()) {
+            testIntMaskedMinIdealDiffMaskMinMaxSwapped(i);
+        }
+        for (int i = 0; i < I_SPECIES.loopBound(LENGTH); i++) {
+            int a = ia[i], b = ib[i];
+            int minAB = m2arr[i] ? Math.min(a, b) : a;
+            int maxAB = m1arr[i] ? Math.max(a, b) : a;
+            int expected = m1arr[i] ? Math.min(minAB, maxAB) : minAB;
+            Verify.checkEQ(ir[i], expected);
+        }
+    }
+    // Predicated Int: min(min(a,b,m1), max(a,b,m1), m2) => NO transform
+    @Test
+    @IR(counts = { IRNode.MIN_VI, IRNode.VECTOR_SIZE_ANY, " 2 ",
+                   IRNode.MAX_VI, IRNode.VECTOR_SIZE_ANY, " 1 " },
+        applyIfCPUFeatureOr = {"avx512f", "true", "sve", "true"})
+    public void testIntMaskedMinIdealDiffMaskOuter(int index) {
+        IntVector v1 = IntVector.fromArray(I_SPECIES, ia, index);
+        IntVector v2 = IntVector.fromArray(I_SPECIES, ib, index);
+        VectorMask<Integer> mask1 = VectorMask.fromArray(I_SPECIES, m1arr, index);
+        VectorMask<Integer> mask2 = VectorMask.fromArray(I_SPECIES, m2arr, index);
+        v1.lanewise(VectorOperators.MIN, v2, mask1)
+          .lanewise(VectorOperators.MIN, v1.lanewise(VectorOperators.MAX, v2, mask1), mask2)
+          .intoArray(ir, index);
+    }
+
+    @Run(test = "testIntMaskedMinIdealDiffMaskOuter")
+    public void runIntMaskedMinIdealDiffMaskOuter() {
+        for (int i = 0; i < I_SPECIES.loopBound(LENGTH); i += I_SPECIES.length()) {
+            testIntMaskedMinIdealDiffMaskOuter(i);
+        }
+        for (int i = 0; i < I_SPECIES.loopBound(LENGTH); i++) {
+            int a = ia[i], b = ib[i];
+            int minAB = m1arr[i] ? Math.min(a, b) : a;
+            int maxAB = m1arr[i] ? Math.max(a, b) : a;
+            int expected = m2arr[i] ? Math.min(minAB, maxAB) : minAB;
+            Verify.checkEQ(ir[i], expected);
+        }
+    }
+
+    // Predicated Int: min(min(a,b,m1), max(a,b,m2), m3) => NO transform
+    @Test
+    @IR(counts = { IRNode.MIN_VI, IRNode.VECTOR_SIZE_ANY, " 2 ",
+                   IRNode.MAX_VI, IRNode.VECTOR_SIZE_ANY, " 1 " },
+        applyIfCPUFeatureOr = {"avx512f", "true", "sve", "true"})
+    public void testIntMaskedMinIdealAllDiffMask(int index) {
+        IntVector v1 = IntVector.fromArray(I_SPECIES, ia, index);
+        IntVector v2 = IntVector.fromArray(I_SPECIES, ib, index);
+        VectorMask<Integer> mask1 = VectorMask.fromArray(I_SPECIES, m1arr, index);
+        VectorMask<Integer> mask2 = VectorMask.fromArray(I_SPECIES, m2arr, index);
+        VectorMask<Integer> mask3 = VectorMask.fromArray(I_SPECIES, m3arr, index);
+        v1.lanewise(VectorOperators.MIN, v2, mask1)
+          .lanewise(VectorOperators.MIN, v1.lanewise(VectorOperators.MAX, v2, mask2), mask3)
+          .intoArray(ir, index);
+    }
+
+    @Run(test = "testIntMaskedMinIdealAllDiffMask")
+    public void runIntMaskedMinIdealAllDiffMask() {
+        for (int i = 0; i < I_SPECIES.loopBound(LENGTH); i += I_SPECIES.length()) {
+            testIntMaskedMinIdealAllDiffMask(i);
+        }
+        for (int i = 0; i < I_SPECIES.loopBound(LENGTH); i++) {
+            int a = ia[i], b = ib[i];
+            int minAB = m1arr[i] ? Math.min(a, b) : a;
+            int maxAB = m2arr[i] ? Math.max(a, b) : a;
+            int expected = m3arr[i] ? Math.min(minAB, maxAB) : minAB;
+            Verify.checkEQ(ir[i], expected);
+        }
+    }
+
+    // Predicated Byte: min(min(a,b,m), max(a,b,m), m) => min(a,b,m)
+    @Test
+    @IR(counts = { IRNode.MIN_VB, IRNode.VECTOR_SIZE_ANY, " 1 ",
+                   IRNode.MAX_VB, IRNode.VECTOR_SIZE_ANY, " 0 " },
+        applyIfCPUFeatureOr = {"avx512bw", "true", "sve", "true"})
+    public void testByteMaskedMinIdealSameMask(int index) {
+        ByteVector v1 = ByteVector.fromArray(B_SPECIES, ba, index);
+        ByteVector v2 = ByteVector.fromArray(B_SPECIES, bb, index);
+        VectorMask<Byte> m = VectorMask.fromArray(B_SPECIES, m1arr, index);
+        v1.lanewise(VectorOperators.MIN, v2, m)
+          .lanewise(VectorOperators.MIN, v1.lanewise(VectorOperators.MAX, v2, m), m)
+          .intoArray(br, index);
+    }
+
+    @Run(test = "testByteMaskedMinIdealSameMask")
+    public void runByteMaskedMinIdealSameMask() {
+        for (int i = 0; i < B_SPECIES.loopBound(LENGTH); i += B_SPECIES.length()) {
+            testByteMaskedMinIdealSameMask(i);
+        }
+        for (int i = 0; i < B_SPECIES.loopBound(LENGTH); i++) {
+            byte a = ba[i], b = bb[i];
+            boolean mask = m1arr[i];
+            byte minAB = (byte)(mask ? Math.min(a, b) : a);
+            byte maxAB = (byte)(mask ? Math.max(a, b) : a);
+            byte expected = (byte)(mask ? Math.min(minAB, maxAB) : minAB);
+            Verify.checkEQ(br[i], expected);
+        }
+    }
+
+    // Predicated Byte: max(min(a,b,m), max(a,b,m), m) => max(a,b,m)
+    @Test
+    @IR(counts = { IRNode.MIN_VB, IRNode.VECTOR_SIZE_ANY, " 0 ",
+                   IRNode.MAX_VB, IRNode.VECTOR_SIZE_ANY, " 1 " },
+        applyIfCPUFeatureOr = {"avx512bw", "true", "sve", "true"})
+    public void testByteMaskedMaxIdealSameMask(int index) {
+        ByteVector v1 = ByteVector.fromArray(B_SPECIES, ba, index);
+        ByteVector v2 = ByteVector.fromArray(B_SPECIES, bb, index);
+        VectorMask<Byte> m = VectorMask.fromArray(B_SPECIES, m1arr, index);
+        v1.lanewise(VectorOperators.MIN, v2, m)
+          .lanewise(VectorOperators.MAX, v1.lanewise(VectorOperators.MAX, v2, m), m)
+          .intoArray(br, index);
+    }
+
+    @Run(test = "testByteMaskedMaxIdealSameMask")
+    public void runByteMaskedMaxIdealSameMask() {
+        for (int i = 0; i < B_SPECIES.loopBound(LENGTH); i += B_SPECIES.length()) {
+            testByteMaskedMaxIdealSameMask(i);
+        }
+        for (int i = 0; i < B_SPECIES.loopBound(LENGTH); i++) {
+            byte a = ba[i], b = bb[i];
+            boolean mask = m1arr[i];
+            byte minAB = (byte)(mask ? Math.min(a, b) : a);
+            byte maxAB = (byte)(mask ? Math.max(a, b) : a);
+            byte expected = (byte)(mask ? Math.max(minAB, maxAB) : minAB);
+            Verify.checkEQ(br[i], expected);
+        }
+    }
+
+    // Predicated Byte: max(min(a,b,m), max(b,a,m), m) => max(a,b,m)
+    @Test
+    @IR(counts = { IRNode.MIN_VB, IRNode.VECTOR_SIZE_ANY, " 0 ",
+                   IRNode.MAX_VB, IRNode.VECTOR_SIZE_ANY, " 1 " },
+        applyIfCPUFeatureOr = {"avx512bw", "true", "sve", "true"})
+    public void testByteMaskedMaxIdealFlippedInputs(int index) {
+        ByteVector v1 = ByteVector.fromArray(B_SPECIES, ba, index);
+        ByteVector v2 = ByteVector.fromArray(B_SPECIES, bb, index);
+        VectorMask<Byte> m = VectorMask.fromArray(B_SPECIES, m1arr, index);
+        v1.lanewise(VectorOperators.MIN, v2, m)
+          .lanewise(VectorOperators.MAX, v2.lanewise(VectorOperators.MAX, v1, m), m)
+          .intoArray(br, index);
+    }
+
+    @Run(test = "testByteMaskedMaxIdealFlippedInputs")
+    public void runByteMaskedMaxIdealFlippedInputs() {
+        for (int i = 0; i < B_SPECIES.loopBound(LENGTH); i += B_SPECIES.length()) {
+            testByteMaskedMaxIdealFlippedInputs(i);
+        }
+        for (int i = 0; i < B_SPECIES.loopBound(LENGTH); i++) {
+            byte a = ba[i], b = bb[i];
+            boolean mask = m1arr[i];
+            byte minAB = (byte)(mask ? Math.min(a, b) : a);
+            byte maxBA = (byte)(mask ? Math.max(b, a) : b);
+            byte expected = (byte)(mask ? Math.max(minAB, maxBA) : minAB);
+            Verify.checkEQ(br[i], expected);
+        }
+    }
+
+    // Predicated Byte: min(min(a,b,m), max(b,a,m), m) => min(a,b,m)
+    @Test
+    @IR(counts = { IRNode.MIN_VB, IRNode.VECTOR_SIZE_ANY, " 1 ",
+                   IRNode.MAX_VB, IRNode.VECTOR_SIZE_ANY, " 0 " },
+        applyIfCPUFeatureOr = {"avx512bw", "true", "sve", "true"})
+    public void testByteMaskedMinIdealFlippedInputs(int index) {
+        ByteVector v1 = ByteVector.fromArray(B_SPECIES, ba, index);
+        ByteVector v2 = ByteVector.fromArray(B_SPECIES, bb, index);
+        VectorMask<Byte> m = VectorMask.fromArray(B_SPECIES, m1arr, index);
+        v1.lanewise(VectorOperators.MIN, v2, m)
+          .lanewise(VectorOperators.MIN, v2.lanewise(VectorOperators.MAX, v1, m), m)
+          .intoArray(br, index);
+    }
+
+    @Run(test = "testByteMaskedMinIdealFlippedInputs")
+    public void runByteMaskedMinIdealFlippedInputs() {
+        for (int i = 0; i < B_SPECIES.loopBound(LENGTH); i += B_SPECIES.length()) {
+            testByteMaskedMinIdealFlippedInputs(i);
+        }
+        for (int i = 0; i < B_SPECIES.loopBound(LENGTH); i++) {
+            byte a = ba[i], b = bb[i];
+            boolean mask = m1arr[i];
+            byte minAB = (byte)(mask ? Math.min(a, b) : a);
+            byte maxBA = (byte)(mask ? Math.max(b, a) : b);
+            byte expected = (byte)(mask ? Math.min(minAB, maxBA) : minAB);
+            Verify.checkEQ(br[i], expected);
+        }
+    }
+
+    // Predicated Byte: min(min(a,b,m1), max(a,b,m2), m1) => NO transform
+    @Test
+    @IR(counts = { IRNode.MIN_VB, IRNode.VECTOR_SIZE_ANY, " 2 ",
+                   IRNode.MAX_VB, IRNode.VECTOR_SIZE_ANY, " 1 " },
+        applyIfCPUFeatureOr = {"avx512bw", "true", "sve", "true"})
+    public void testByteMaskedMinIdealDiffMaskMinMax(int index) {
+        ByteVector v1 = ByteVector.fromArray(B_SPECIES, ba, index);
+        ByteVector v2 = ByteVector.fromArray(B_SPECIES, bb, index);
+        VectorMask<Byte> mask1 = VectorMask.fromArray(B_SPECIES, m1arr, index);
+        VectorMask<Byte> mask2 = VectorMask.fromArray(B_SPECIES, m2arr, index);
+        v1.lanewise(VectorOperators.MIN, v2, mask1)
+          .lanewise(VectorOperators.MIN, v1.lanewise(VectorOperators.MAX, v2, mask2), mask1)
+          .intoArray(br, index);
+    }
+
+    @Run(test = "testByteMaskedMinIdealDiffMaskMinMax")
+    public void runByteMaskedMinIdealDiffMaskMinMax() {
+        for (int i = 0; i < B_SPECIES.loopBound(LENGTH); i += B_SPECIES.length()) {
+            testByteMaskedMinIdealDiffMaskMinMax(i);
+        }
+        for (int i = 0; i < B_SPECIES.loopBound(LENGTH); i++) {
+            byte a = ba[i], b = bb[i];
+            byte minAB = (byte)(m1arr[i] ? Math.min(a, b) : a);
+            byte maxAB = (byte)(m2arr[i] ? Math.max(a, b) : a);
+            byte expected = (byte)(m1arr[i] ? Math.min(minAB, maxAB) : minAB);
+            Verify.checkEQ(br[i], expected);
+        }
+    }
+
+    // Predicated Byte: min(min(a,b,m2), max(a,b,m1), m1) => NO transform
+    @Test
+    @IR(counts = { IRNode.MIN_VB, IRNode.VECTOR_SIZE_ANY, " 2 ",
+                   IRNode.MAX_VB, IRNode.VECTOR_SIZE_ANY, " 1 " },
+        applyIfCPUFeatureOr = {"avx512bw", "true", "sve", "true"})
+    public void testByteMaskedMinIdealDiffMaskMinMaxSwapped(int index) {
+        ByteVector v1 = ByteVector.fromArray(B_SPECIES, ba, index);
+        ByteVector v2 = ByteVector.fromArray(B_SPECIES, bb, index);
+        VectorMask<Byte> mask1 = VectorMask.fromArray(B_SPECIES, m1arr, index);
+        VectorMask<Byte> mask2 = VectorMask.fromArray(B_SPECIES, m2arr, index);
+        v1.lanewise(VectorOperators.MIN, v2, mask2)
+          .lanewise(VectorOperators.MIN, v1.lanewise(VectorOperators.MAX, v2, mask1), mask1)
+          .intoArray(br, index);
+    }
+
+    @Run(test = "testByteMaskedMinIdealDiffMaskMinMaxSwapped")
+    public void runByteMaskedMinIdealDiffMaskMinMaxSwapped() {
+        for (int i = 0; i < B_SPECIES.loopBound(LENGTH); i += B_SPECIES.length()) {
+            testByteMaskedMinIdealDiffMaskMinMaxSwapped(i);
+        }
+        for (int i = 0; i < B_SPECIES.loopBound(LENGTH); i++) {
+            byte a = ba[i], b = bb[i];
+            byte minAB = (byte)(m2arr[i] ? Math.min(a, b) : a);
+            byte maxAB = (byte)(m1arr[i] ? Math.max(a, b) : a);
+            byte expected = (byte)(m1arr[i] ? Math.min(minAB, maxAB) : minAB);
+            Verify.checkEQ(br[i], expected);
+        }
+    }
+
+    // Predicated Byte: min(min(a,b,m1), max(a,b,m1), m2) => NO transform
+    @Test
+    @IR(counts = { IRNode.MIN_VB, IRNode.VECTOR_SIZE_ANY, " 2 ",
+                   IRNode.MAX_VB, IRNode.VECTOR_SIZE_ANY, " 1 " },
+        applyIfCPUFeatureOr = {"avx512bw", "true", "sve", "true"})
+    public void testByteMaskedMinIdealDiffMaskOuter(int index) {
+        ByteVector v1 = ByteVector.fromArray(B_SPECIES, ba, index);
+        ByteVector v2 = ByteVector.fromArray(B_SPECIES, bb, index);
+        VectorMask<Byte> mask1 = VectorMask.fromArray(B_SPECIES, m1arr, index);
+        VectorMask<Byte> mask2 = VectorMask.fromArray(B_SPECIES, m2arr, index);
+        v1.lanewise(VectorOperators.MIN, v2, mask1)
+          .lanewise(VectorOperators.MIN, v1.lanewise(VectorOperators.MAX, v2, mask1), mask2)
+          .intoArray(br, index);
+    }
+
+    @Run(test = "testByteMaskedMinIdealDiffMaskOuter")
+    public void runByteMaskedMinIdealDiffMaskOuter() {
+        for (int i = 0; i < B_SPECIES.loopBound(LENGTH); i += B_SPECIES.length()) {
+            testByteMaskedMinIdealDiffMaskOuter(i);
+        }
+        for (int i = 0; i < B_SPECIES.loopBound(LENGTH); i++) {
+            byte a = ba[i], b = bb[i];
+            byte minAB = (byte)(m1arr[i] ? Math.min(a, b) : a);
+            byte maxAB = (byte)(m1arr[i] ? Math.max(a, b) : a);
+            byte expected = (byte)(m2arr[i] ? Math.min(minAB, maxAB) : minAB);
+            Verify.checkEQ(br[i], expected);
+        }
+    }
+
+    // Predicated Byte: min(min(a,b,m1), max(a,b,m2), m3) => NO transform
+    @Test
+    @IR(counts = { IRNode.MIN_VB, IRNode.VECTOR_SIZE_ANY, " 2 ",
+                   IRNode.MAX_VB, IRNode.VECTOR_SIZE_ANY, " 1 " },
+        applyIfCPUFeatureOr = {"avx512bw", "true", "sve", "true"})
+    public void testByteMaskedMinIdealAllDiffMask(int index) {
+        ByteVector v1 = ByteVector.fromArray(B_SPECIES, ba, index);
+        ByteVector v2 = ByteVector.fromArray(B_SPECIES, bb, index);
+        VectorMask<Byte> mask1 = VectorMask.fromArray(B_SPECIES, m1arr, index);
+        VectorMask<Byte> mask2 = VectorMask.fromArray(B_SPECIES, m2arr, index);
+        VectorMask<Byte> mask3 = VectorMask.fromArray(B_SPECIES, m3arr, index);
+        v1.lanewise(VectorOperators.MIN, v2, mask1)
+          .lanewise(VectorOperators.MIN, v1.lanewise(VectorOperators.MAX, v2, mask2), mask3)
+          .intoArray(br, index);
+    }
+
+    @Run(test = "testByteMaskedMinIdealAllDiffMask")
+    public void runByteMaskedMinIdealAllDiffMask() {
+        for (int i = 0; i < B_SPECIES.loopBound(LENGTH); i += B_SPECIES.length()) {
+            testByteMaskedMinIdealAllDiffMask(i);
+        }
+        for (int i = 0; i < B_SPECIES.loopBound(LENGTH); i++) {
+            byte a = ba[i], b = bb[i];
+            byte minAB = (byte)(m1arr[i] ? Math.min(a, b) : a);
+            byte maxAB = (byte)(m2arr[i] ? Math.max(a, b) : a);
+            byte expected = (byte)(m3arr[i] ? Math.min(minAB, maxAB) : minAB);
+            Verify.checkEQ(br[i], expected);
+        }
+    }
+
+    // Predicated Short: min(min(a,b,m), max(a,b,m), m) => min(a,b,m)
+    @Test
+    @IR(counts = { IRNode.MIN_VS, IRNode.VECTOR_SIZE_ANY, " 1 ",
+                   IRNode.MAX_VS, IRNode.VECTOR_SIZE_ANY, " 0 " },
+        applyIfCPUFeatureOr = {"avx512bw", "true", "sve", "true"})
+    public void testShortMaskedMinIdealSameMask(int index) {
+        ShortVector v1 = ShortVector.fromArray(S_SPECIES, sa, index);
+        ShortVector v2 = ShortVector.fromArray(S_SPECIES, sb, index);
+        VectorMask<Short> m = VectorMask.fromArray(S_SPECIES, m1arr, index);
+        v1.lanewise(VectorOperators.MIN, v2, m)
+          .lanewise(VectorOperators.MIN, v1.lanewise(VectorOperators.MAX, v2, m), m)
+          .intoArray(sr, index);
+    }
+
+    @Run(test = "testShortMaskedMinIdealSameMask")
+    public void runShortMaskedMinIdealSameMask() {
+        for (int i = 0; i < S_SPECIES.loopBound(LENGTH); i += S_SPECIES.length()) {
+            testShortMaskedMinIdealSameMask(i);
+        }
+        for (int i = 0; i < S_SPECIES.loopBound(LENGTH); i++) {
+            short a = sa[i], b = sb[i];
+            boolean mask = m1arr[i];
+            short minAB = (short)(mask ? Math.min(a, b) : a);
+            short maxAB = (short)(mask ? Math.max(a, b) : a);
+            short expected = (short)(mask ? Math.min(minAB, maxAB) : minAB);
+            Verify.checkEQ(sr[i], expected);
+        }
+    }
+
+    // Predicated Short: max(min(a,b,m), max(a,b,m), m) => max(a,b,m)
+    @Test
+    @IR(counts = { IRNode.MIN_VS, IRNode.VECTOR_SIZE_ANY, " 0 ",
+                   IRNode.MAX_VS, IRNode.VECTOR_SIZE_ANY, " 1 " },
+        applyIfCPUFeatureOr = {"avx512bw", "true", "sve", "true"})
+    public void testShortMaskedMaxIdealSameMask(int index) {
+        ShortVector v1 = ShortVector.fromArray(S_SPECIES, sa, index);
+        ShortVector v2 = ShortVector.fromArray(S_SPECIES, sb, index);
+        VectorMask<Short> m = VectorMask.fromArray(S_SPECIES, m1arr, index);
+        v1.lanewise(VectorOperators.MIN, v2, m)
+          .lanewise(VectorOperators.MAX, v1.lanewise(VectorOperators.MAX, v2, m), m)
+          .intoArray(sr, index);
+    }
+
+    @Run(test = "testShortMaskedMaxIdealSameMask")
+    public void runShortMaskedMaxIdealSameMask() {
+        for (int i = 0; i < S_SPECIES.loopBound(LENGTH); i += S_SPECIES.length()) {
+            testShortMaskedMaxIdealSameMask(i);
+        }
+        for (int i = 0; i < S_SPECIES.loopBound(LENGTH); i++) {
+            short a = sa[i], b = sb[i];
+            boolean mask = m1arr[i];
+            short minAB = (short)(mask ? Math.min(a, b) : a);
+            short maxAB = (short)(mask ? Math.max(a, b) : a);
+            short expected = (short)(mask ? Math.max(minAB, maxAB) : minAB);
+            Verify.checkEQ(sr[i], expected);
+        }
+    }
+
+    // Predicated Short: max(min(a,b,m), max(b,a,m), m) => max(a,b,m)
+    @Test
+    @IR(counts = { IRNode.MIN_VS, IRNode.VECTOR_SIZE_ANY, " 0 ",
+                   IRNode.MAX_VS, IRNode.VECTOR_SIZE_ANY, " 1 " },
+        applyIfCPUFeatureOr = {"avx512bw", "true", "sve", "true"})
+    public void testShortMaskedMaxIdealFlippedInputs(int index) {
+        ShortVector v1 = ShortVector.fromArray(S_SPECIES, sa, index);
+        ShortVector v2 = ShortVector.fromArray(S_SPECIES, sb, index);
+        VectorMask<Short> m = VectorMask.fromArray(S_SPECIES, m1arr, index);
+        v1.lanewise(VectorOperators.MIN, v2, m)
+          .lanewise(VectorOperators.MAX, v2.lanewise(VectorOperators.MAX, v1, m), m)
+          .intoArray(sr, index);
+    }
+
+    @Run(test = "testShortMaskedMaxIdealFlippedInputs")
+    public void runShortMaskedMaxIdealFlippedInputs() {
+        for (int i = 0; i < S_SPECIES.loopBound(LENGTH); i += S_SPECIES.length()) {
+            testShortMaskedMaxIdealFlippedInputs(i);
+        }
+        for (int i = 0; i < S_SPECIES.loopBound(LENGTH); i++) {
+            short a = sa[i], b = sb[i];
+            boolean mask = m1arr[i];
+            short minAB = (short)(mask ? Math.min(a, b) : a);
+            short maxBA = (short)(mask ? Math.max(b, a) : b);
+            short expected = (short)(mask ? Math.max(minAB, maxBA) : minAB);
+            Verify.checkEQ(sr[i], expected);
+        }
+    }
+
+    // Predicated Short: min(min(a,b,m), max(b,a,m), m) => min(a,b,m)
+    @Test
+    @IR(counts = { IRNode.MIN_VS, IRNode.VECTOR_SIZE_ANY, " 1 ",
+                   IRNode.MAX_VS, IRNode.VECTOR_SIZE_ANY, " 0 " },
+        applyIfCPUFeatureOr = {"avx512bw", "true", "sve", "true"})
+    public void testShortMaskedMinIdealFlippedInputs(int index) {
+        ShortVector v1 = ShortVector.fromArray(S_SPECIES, sa, index);
+        ShortVector v2 = ShortVector.fromArray(S_SPECIES, sb, index);
+        VectorMask<Short> m = VectorMask.fromArray(S_SPECIES, m1arr, index);
+        v1.lanewise(VectorOperators.MIN, v2, m)
+          .lanewise(VectorOperators.MIN, v2.lanewise(VectorOperators.MAX, v1, m), m)
+          .intoArray(sr, index);
+    }
+
+    @Run(test = "testShortMaskedMinIdealFlippedInputs")
+    public void runShortMaskedMinIdealFlippedInputs() {
+        for (int i = 0; i < S_SPECIES.loopBound(LENGTH); i += S_SPECIES.length()) {
+            testShortMaskedMinIdealFlippedInputs(i);
+        }
+        for (int i = 0; i < S_SPECIES.loopBound(LENGTH); i++) {
+            short a = sa[i], b = sb[i];
+            boolean mask = m1arr[i];
+            short minAB = (short)(mask ? Math.min(a, b) : a);
+            short maxBA = (short)(mask ? Math.max(b, a) : b);
+            short expected = (short)(mask ? Math.min(minAB, maxBA) : minAB);
+            Verify.checkEQ(sr[i], expected);
+        }
+    }
+
+    // Predicated Short: min(min(a,b,m1), max(a,b,m2), m1) => NO transform
+    @Test
+    @IR(counts = { IRNode.MIN_VS, IRNode.VECTOR_SIZE_ANY, " 2 ",
+                   IRNode.MAX_VS, IRNode.VECTOR_SIZE_ANY, " 1 " },
+        applyIfCPUFeatureOr = {"avx512bw", "true", "sve", "true"})
+    public void testShortMaskedMinIdealDiffMaskMinMax(int index) {
+        ShortVector v1 = ShortVector.fromArray(S_SPECIES, sa, index);
+        ShortVector v2 = ShortVector.fromArray(S_SPECIES, sb, index);
+        VectorMask<Short> mask1 = VectorMask.fromArray(S_SPECIES, m1arr, index);
+        VectorMask<Short> mask2 = VectorMask.fromArray(S_SPECIES, m2arr, index);
+        v1.lanewise(VectorOperators.MIN, v2, mask1)
+          .lanewise(VectorOperators.MIN, v1.lanewise(VectorOperators.MAX, v2, mask2), mask1)
+          .intoArray(sr, index);
+    }
+
+    @Run(test = "testShortMaskedMinIdealDiffMaskMinMax")
+    public void runShortMaskedMinIdealDiffMaskMinMax() {
+        for (int i = 0; i < S_SPECIES.loopBound(LENGTH); i += S_SPECIES.length()) {
+            testShortMaskedMinIdealDiffMaskMinMax(i);
+        }
+        for (int i = 0; i < S_SPECIES.loopBound(LENGTH); i++) {
+            short a = sa[i], b = sb[i];
+            short minAB = (short)(m1arr[i] ? Math.min(a, b) : a);
+            short maxAB = (short)(m2arr[i] ? Math.max(a, b) : a);
+            short expected = (short)(m1arr[i] ? Math.min(minAB, maxAB) : minAB);
+            Verify.checkEQ(sr[i], expected);
+        }
+    }
+
+    // Predicated Short: min(min(a,b,m2), max(a,b,m1), m1) => NO transform
+    @Test
+    @IR(counts = { IRNode.MIN_VS, IRNode.VECTOR_SIZE_ANY, " 2 ",
+                   IRNode.MAX_VS, IRNode.VECTOR_SIZE_ANY, " 1 " },
+        applyIfCPUFeatureOr = {"avx512bw", "true", "sve", "true"})
+    public void testShortMaskedMinIdealDiffMaskMinMaxSwapped(int index) {
+        ShortVector v1 = ShortVector.fromArray(S_SPECIES, sa, index);
+        ShortVector v2 = ShortVector.fromArray(S_SPECIES, sb, index);
+        VectorMask<Short> mask1 = VectorMask.fromArray(S_SPECIES, m1arr, index);
+        VectorMask<Short> mask2 = VectorMask.fromArray(S_SPECIES, m2arr, index);
+        v1.lanewise(VectorOperators.MIN, v2, mask2)
+          .lanewise(VectorOperators.MIN, v1.lanewise(VectorOperators.MAX, v2, mask1), mask1)
+          .intoArray(sr, index);
+    }
+
+    @Run(test = "testShortMaskedMinIdealDiffMaskMinMaxSwapped")
+    public void runShortMaskedMinIdealDiffMaskMinMaxSwapped() {
+        for (int i = 0; i < S_SPECIES.loopBound(LENGTH); i += S_SPECIES.length()) {
+            testShortMaskedMinIdealDiffMaskMinMaxSwapped(i);
+        }
+        for (int i = 0; i < S_SPECIES.loopBound(LENGTH); i++) {
+            short a = sa[i], b = sb[i];
+            short minAB = (short)(m2arr[i] ? Math.min(a, b) : a);
+            short maxAB = (short)(m1arr[i] ? Math.max(a, b) : a);
+            short expected = (short)(m1arr[i] ? Math.min(minAB, maxAB) : minAB);
+            Verify.checkEQ(sr[i], expected);
+        }
+    }
+
+    // Predicated Short: min(min(a,b,m1), max(a,b,m1), m2) => NO transform
+    @Test
+    @IR(counts = { IRNode.MIN_VS, IRNode.VECTOR_SIZE_ANY, " 2 ",
+                   IRNode.MAX_VS, IRNode.VECTOR_SIZE_ANY, " 1 " },
+        applyIfCPUFeatureOr = {"avx512bw", "true", "sve", "true"})
+    public void testShortMaskedMinIdealDiffMaskOuter(int index) {
+        ShortVector v1 = ShortVector.fromArray(S_SPECIES, sa, index);
+        ShortVector v2 = ShortVector.fromArray(S_SPECIES, sb, index);
+        VectorMask<Short> mask1 = VectorMask.fromArray(S_SPECIES, m1arr, index);
+        VectorMask<Short> mask2 = VectorMask.fromArray(S_SPECIES, m2arr, index);
+        v1.lanewise(VectorOperators.MIN, v2, mask1)
+          .lanewise(VectorOperators.MIN, v1.lanewise(VectorOperators.MAX, v2, mask1), mask2)
+          .intoArray(sr, index);
+    }
+
+    @Run(test = "testShortMaskedMinIdealDiffMaskOuter")
+    public void runShortMaskedMinIdealDiffMaskOuter() {
+        for (int i = 0; i < S_SPECIES.loopBound(LENGTH); i += S_SPECIES.length()) {
+            testShortMaskedMinIdealDiffMaskOuter(i);
+        }
+        for (int i = 0; i < S_SPECIES.loopBound(LENGTH); i++) {
+            short a = sa[i], b = sb[i];
+            short minAB = (short)(m1arr[i] ? Math.min(a, b) : a);
+            short maxAB = (short)(m1arr[i] ? Math.max(a, b) : a);
+            short expected = (short)(m2arr[i] ? Math.min(minAB, maxAB) : minAB);
+            Verify.checkEQ(sr[i], expected);
+        }
+    }
+
+    // Predicated Short: min(min(a,b,m1), max(a,b,m2), m3) => NO transform
+    @Test
+    @IR(counts = { IRNode.MIN_VS, IRNode.VECTOR_SIZE_ANY, " 2 ",
+                   IRNode.MAX_VS, IRNode.VECTOR_SIZE_ANY, " 1 " },
+        applyIfCPUFeatureOr = {"avx512bw", "true", "sve", "true"})
+    public void testShortMaskedMinIdealAllDiffMask(int index) {
+        ShortVector v1 = ShortVector.fromArray(S_SPECIES, sa, index);
+        ShortVector v2 = ShortVector.fromArray(S_SPECIES, sb, index);
+        VectorMask<Short> mask1 = VectorMask.fromArray(S_SPECIES, m1arr, index);
+        VectorMask<Short> mask2 = VectorMask.fromArray(S_SPECIES, m2arr, index);
+        VectorMask<Short> mask3 = VectorMask.fromArray(S_SPECIES, m3arr, index);
+        v1.lanewise(VectorOperators.MIN, v2, mask1)
+          .lanewise(VectorOperators.MIN, v1.lanewise(VectorOperators.MAX, v2, mask2), mask3)
+          .intoArray(sr, index);
+    }
+
+    @Run(test = "testShortMaskedMinIdealAllDiffMask")
+    public void runShortMaskedMinIdealAllDiffMask() {
+        for (int i = 0; i < S_SPECIES.loopBound(LENGTH); i += S_SPECIES.length()) {
+            testShortMaskedMinIdealAllDiffMask(i);
+        }
+        for (int i = 0; i < S_SPECIES.loopBound(LENGTH); i++) {
+            short a = sa[i], b = sb[i];
+            short minAB = (short)(m1arr[i] ? Math.min(a, b) : a);
+            short maxAB = (short)(m2arr[i] ? Math.max(a, b) : a);
+            short expected = (short)(m3arr[i] ? Math.min(minAB, maxAB) : minAB);
+            Verify.checkEQ(sr[i], expected);
+        }
+    }
+
+    // Predicated Long: min(min(a,b,m), max(a,b,m), m) => min(a,b,m)
+    @Test
+    @IR(counts = { IRNode.MIN_VL, IRNode.VECTOR_SIZE_ANY, " 1 ",
+                   IRNode.MAX_VL, IRNode.VECTOR_SIZE_ANY, " 0 " },
+        applyIfCPUFeatureOr = {"avx512f", "true", "sve", "true"})
+    public void testLongMaskedMinIdealSameMask(int index) {
+        LongVector v1 = LongVector.fromArray(L_SPECIES, la, index);
+        LongVector v2 = LongVector.fromArray(L_SPECIES, lb, index);
+        VectorMask<Long> m = VectorMask.fromArray(L_SPECIES, m1arr, index);
+        v1.lanewise(VectorOperators.MIN, v2, m)
+          .lanewise(VectorOperators.MIN, v1.lanewise(VectorOperators.MAX, v2, m), m)
+          .intoArray(lr, index);
+    }
+
+    @Run(test = "testLongMaskedMinIdealSameMask")
+    public void runLongMaskedMinIdealSameMask() {
+        for (int i = 0; i < L_SPECIES.loopBound(LENGTH); i += L_SPECIES.length()) {
+            testLongMaskedMinIdealSameMask(i);
+        }
+        for (int i = 0; i < L_SPECIES.loopBound(LENGTH); i++) {
+            long a = la[i], b = lb[i];
+            boolean mask = m1arr[i];
+            long minAB = mask ? Math.min(a, b) : a;
+            long maxAB = mask ? Math.max(a, b) : a;
+            long expected = mask ? Math.min(minAB, maxAB) : minAB;
+            Verify.checkEQ(lr[i], expected);
+        }
+    }
+
+    // Predicated Long: max(min(a,b,m), max(a,b,m), m) => max(a,b,m)
+    @Test
+    @IR(counts = { IRNode.MIN_VL, IRNode.VECTOR_SIZE_ANY, " 0 ",
+                   IRNode.MAX_VL, IRNode.VECTOR_SIZE_ANY, " 1 " },
+        applyIfCPUFeatureOr = {"avx512f", "true", "sve", "true"})
+    public void testLongMaskedMaxIdealSameMask(int index) {
+        LongVector v1 = LongVector.fromArray(L_SPECIES, la, index);
+        LongVector v2 = LongVector.fromArray(L_SPECIES, lb, index);
+        VectorMask<Long> m = VectorMask.fromArray(L_SPECIES, m1arr, index);
+        v1.lanewise(VectorOperators.MIN, v2, m)
+          .lanewise(VectorOperators.MAX, v1.lanewise(VectorOperators.MAX, v2, m), m)
+          .intoArray(lr, index);
+    }
+
+    @Run(test = "testLongMaskedMaxIdealSameMask")
+    public void runLongMaskedMaxIdealSameMask() {
+        for (int i = 0; i < L_SPECIES.loopBound(LENGTH); i += L_SPECIES.length()) {
+            testLongMaskedMaxIdealSameMask(i);
+        }
+        for (int i = 0; i < L_SPECIES.loopBound(LENGTH); i++) {
+            long a = la[i], b = lb[i];
+            boolean mask = m1arr[i];
+            long minAB = mask ? Math.min(a, b) : a;
+            long maxAB = mask ? Math.max(a, b) : a;
+            long expected = mask ? Math.max(minAB, maxAB) : minAB;
+            Verify.checkEQ(lr[i], expected);
+        }
+    }
+
+    // Predicated Long: max(min(a,b,m), max(b,a,m), m) => max(a,b,m)
+    @Test
+    @IR(counts = { IRNode.MIN_VL, IRNode.VECTOR_SIZE_ANY, " 0 ",
+                   IRNode.MAX_VL, IRNode.VECTOR_SIZE_ANY, " 1 " },
+        applyIfCPUFeatureOr = {"avx512f", "true", "sve", "true"})
+    public void testLongMaskedMaxIdealFlippedInputs(int index) {
+        LongVector v1 = LongVector.fromArray(L_SPECIES, la, index);
+        LongVector v2 = LongVector.fromArray(L_SPECIES, lb, index);
+        VectorMask<Long> m = VectorMask.fromArray(L_SPECIES, m1arr, index);
+        v1.lanewise(VectorOperators.MIN, v2, m)
+          .lanewise(VectorOperators.MAX, v2.lanewise(VectorOperators.MAX, v1, m), m)
+          .intoArray(lr, index);
+    }
+
+    @Run(test = "testLongMaskedMaxIdealFlippedInputs")
+    public void runLongMaskedMaxIdealFlippedInputs() {
+        for (int i = 0; i < L_SPECIES.loopBound(LENGTH); i += L_SPECIES.length()) {
+            testLongMaskedMaxIdealFlippedInputs(i);
+        }
+        for (int i = 0; i < L_SPECIES.loopBound(LENGTH); i++) {
+            long a = la[i], b = lb[i];
+            boolean mask = m1arr[i];
+            long minAB = mask ? Math.min(a, b) : a;
+            long maxBA = mask ? Math.max(b, a) : b;
+            long expected = mask ? Math.max(minAB, maxBA) : minAB;
+            Verify.checkEQ(lr[i], expected);
+        }
+    }
+
+    // Predicated Long: min(min(a,b,m), max(b,a,m), m) => min(a,b,m)
+    @Test
+    @IR(counts = { IRNode.MIN_VL, IRNode.VECTOR_SIZE_ANY, " 1 ",
+                   IRNode.MAX_VL, IRNode.VECTOR_SIZE_ANY, " 0 " },
+        applyIfCPUFeatureOr = {"avx512f", "true", "sve", "true"})
+    public void testLongMaskedMinIdealFlippedInputs(int index) {
+        LongVector v1 = LongVector.fromArray(L_SPECIES, la, index);
+        LongVector v2 = LongVector.fromArray(L_SPECIES, lb, index);
+        VectorMask<Long> m = VectorMask.fromArray(L_SPECIES, m1arr, index);
+        v1.lanewise(VectorOperators.MIN, v2, m)
+          .lanewise(VectorOperators.MIN, v2.lanewise(VectorOperators.MAX, v1, m), m)
+          .intoArray(lr, index);
+    }
+
+    @Run(test = "testLongMaskedMinIdealFlippedInputs")
+    public void runLongMaskedMinIdealFlippedInputs() {
+        for (int i = 0; i < L_SPECIES.loopBound(LENGTH); i += L_SPECIES.length()) {
+            testLongMaskedMinIdealFlippedInputs(i);
+        }
+        for (int i = 0; i < L_SPECIES.loopBound(LENGTH); i++) {
+            long a = la[i], b = lb[i];
+            boolean mask = m1arr[i];
+            long minAB = mask ? Math.min(a, b) : a;
+            long maxBA = mask ? Math.max(b, a) : b;
+            long expected = mask ? Math.min(minAB, maxBA) : minAB;
+            Verify.checkEQ(lr[i], expected);
+        }
+    }
+
+    // Predicated Long: min(min(a,b,m1), max(a,b,m2), m1) => NO transform
+    @Test
+    @IR(counts = { IRNode.MIN_VL, IRNode.VECTOR_SIZE_ANY, " 2 ",
+                   IRNode.MAX_VL, IRNode.VECTOR_SIZE_ANY, " 1 " },
+        applyIfCPUFeatureOr = {"avx512f", "true", "sve", "true"})
+    public void testLongMaskedMinIdealDiffMaskMinMax(int index) {
+        LongVector v1 = LongVector.fromArray(L_SPECIES, la, index);
+        LongVector v2 = LongVector.fromArray(L_SPECIES, lb, index);
+        VectorMask<Long> mask1 = VectorMask.fromArray(L_SPECIES, m1arr, index);
+        VectorMask<Long> mask2 = VectorMask.fromArray(L_SPECIES, m2arr, index);
+        v1.lanewise(VectorOperators.MIN, v2, mask1)
+          .lanewise(VectorOperators.MIN, v1.lanewise(VectorOperators.MAX, v2, mask2), mask1)
+          .intoArray(lr, index);
+    }
+
+    @Run(test = "testLongMaskedMinIdealDiffMaskMinMax")
+    public void runLongMaskedMinIdealDiffMaskMinMax() {
+        for (int i = 0; i < L_SPECIES.loopBound(LENGTH); i += L_SPECIES.length()) {
+            testLongMaskedMinIdealDiffMaskMinMax(i);
+        }
+        for (int i = 0; i < L_SPECIES.loopBound(LENGTH); i++) {
+            long a = la[i], b = lb[i];
+            long minAB = m1arr[i] ? Math.min(a, b) : a;
+            long maxAB = m2arr[i] ? Math.max(a, b) : a;
+            long expected = m1arr[i] ? Math.min(minAB, maxAB) : minAB;
+            Verify.checkEQ(lr[i], expected);
+        }
+    }
+
+    // Predicated Long: min(min(a,b,m2), max(a,b,m1), m1) => NO transform
+    @Test
+    @IR(counts = { IRNode.MIN_VL, IRNode.VECTOR_SIZE_ANY, " 2 ",
+                   IRNode.MAX_VL, IRNode.VECTOR_SIZE_ANY, " 1 " },
+        applyIfCPUFeatureOr = {"avx512f", "true", "sve", "true"})
+    public void testLongMaskedMinIdealDiffMaskMinMaxSwapped(int index) {
+        LongVector v1 = LongVector.fromArray(L_SPECIES, la, index);
+        LongVector v2 = LongVector.fromArray(L_SPECIES, lb, index);
+        VectorMask<Long> mask1 = VectorMask.fromArray(L_SPECIES, m1arr, index);
+        VectorMask<Long> mask2 = VectorMask.fromArray(L_SPECIES, m2arr, index);
+        v1.lanewise(VectorOperators.MIN, v2, mask2)
+          .lanewise(VectorOperators.MIN, v1.lanewise(VectorOperators.MAX, v2, mask1), mask1)
+          .intoArray(lr, index);
+    }
+
+    @Run(test = "testLongMaskedMinIdealDiffMaskMinMaxSwapped")
+    public void runLongMaskedMinIdealDiffMaskMinMaxSwapped() {
+        for (int i = 0; i < L_SPECIES.loopBound(LENGTH); i += L_SPECIES.length()) {
+            testLongMaskedMinIdealDiffMaskMinMaxSwapped(i);
+        }
+        for (int i = 0; i < L_SPECIES.loopBound(LENGTH); i++) {
+            long a = la[i], b = lb[i];
+            long minAB = m2arr[i] ? Math.min(a, b) : a;
+            long maxAB = m1arr[i] ? Math.max(a, b) : a;
+            long expected = m1arr[i] ? Math.min(minAB, maxAB) : minAB;
+            Verify.checkEQ(lr[i], expected);
+        }
+    }
+
+    // Predicated Long: min(min(a,b,m1), max(a,b,m1), m2) => NO transform
+    @Test
+    @IR(counts = { IRNode.MIN_VL, IRNode.VECTOR_SIZE_ANY, " 2 ",
+                   IRNode.MAX_VL, IRNode.VECTOR_SIZE_ANY, " 1 " },
+        applyIfCPUFeatureOr = {"avx512f", "true", "sve", "true"})
+    public void testLongMaskedMinIdealDiffMaskOuter(int index) {
+        LongVector v1 = LongVector.fromArray(L_SPECIES, la, index);
+        LongVector v2 = LongVector.fromArray(L_SPECIES, lb, index);
+        VectorMask<Long> mask1 = VectorMask.fromArray(L_SPECIES, m1arr, index);
+        VectorMask<Long> mask2 = VectorMask.fromArray(L_SPECIES, m2arr, index);
+        v1.lanewise(VectorOperators.MIN, v2, mask1)
+          .lanewise(VectorOperators.MIN, v1.lanewise(VectorOperators.MAX, v2, mask1), mask2)
+          .intoArray(lr, index);
+    }
+
+    @Run(test = "testLongMaskedMinIdealDiffMaskOuter")
+    public void runLongMaskedMinIdealDiffMaskOuter() {
+        for (int i = 0; i < L_SPECIES.loopBound(LENGTH); i += L_SPECIES.length()) {
+            testLongMaskedMinIdealDiffMaskOuter(i);
+        }
+        for (int i = 0; i < L_SPECIES.loopBound(LENGTH); i++) {
+            long a = la[i], b = lb[i];
+            long minAB = m1arr[i] ? Math.min(a, b) : a;
+            long maxAB = m1arr[i] ? Math.max(a, b) : a;
+            long expected = m2arr[i] ? Math.min(minAB, maxAB) : minAB;
+            Verify.checkEQ(lr[i], expected);
+        }
+    }
+
+    // Predicated Long: min(min(a,b,m1), max(a,b,m2), m3) => NO transform
+    @Test
+    @IR(counts = { IRNode.MIN_VL, IRNode.VECTOR_SIZE_ANY, " 2 ",
+                   IRNode.MAX_VL, IRNode.VECTOR_SIZE_ANY, " 1 " },
+        applyIfCPUFeatureOr = {"avx512f", "true", "sve", "true"})
+    public void testLongMaskedMinIdealAllDiffMask(int index) {
+        LongVector v1 = LongVector.fromArray(L_SPECIES, la, index);
+        LongVector v2 = LongVector.fromArray(L_SPECIES, lb, index);
+        VectorMask<Long> mask1 = VectorMask.fromArray(L_SPECIES, m1arr, index);
+        VectorMask<Long> mask2 = VectorMask.fromArray(L_SPECIES, m2arr, index);
+        VectorMask<Long> mask3 = VectorMask.fromArray(L_SPECIES, m3arr, index);
+        v1.lanewise(VectorOperators.MIN, v2, mask1)
+          .lanewise(VectorOperators.MIN, v1.lanewise(VectorOperators.MAX, v2, mask2), mask3)
+          .intoArray(lr, index);
+    }
+
+    @Run(test = "testLongMaskedMinIdealAllDiffMask")
+    public void runLongMaskedMinIdealAllDiffMask() {
+        for (int i = 0; i < L_SPECIES.loopBound(LENGTH); i += L_SPECIES.length()) {
+            testLongMaskedMinIdealAllDiffMask(i);
+        }
+        for (int i = 0; i < L_SPECIES.loopBound(LENGTH); i++) {
+            long a = la[i], b = lb[i];
+            long minAB = m1arr[i] ? Math.min(a, b) : a;
+            long maxAB = m2arr[i] ? Math.max(a, b) : a;
+            long expected = m3arr[i] ? Math.min(minAB, maxAB) : minAB;
+            Verify.checkEQ(lr[i], expected);
+        }
+    }
+
+    // Predicated Float: min(min(a,b,m), max(a,b,m), m) => min(a,b,m)
+    @Test
+    @IR(counts = { IRNode.MIN_VF, IRNode.VECTOR_SIZE_ANY, " 1 ",
+                   IRNode.MAX_VF, IRNode.VECTOR_SIZE_ANY, " 0 " },
+        applyIfCPUFeatureOr = {"avx10_2", "true", "sve", "true"})
+    public void testFloatMaskedMinIdealSameMask(int index) {
+        FloatVector v1 = FloatVector.fromArray(F_SPECIES, fa, index);
+        FloatVector v2 = FloatVector.fromArray(F_SPECIES, fb, index);
+        VectorMask<Float> m = VectorMask.fromArray(F_SPECIES, m1arr, index);
+        v1.lanewise(VectorOperators.MIN, v2, m)
+          .lanewise(VectorOperators.MIN, v1.lanewise(VectorOperators.MAX, v2, m), m)
+          .intoArray(fr, index);
+    }
+
+    @Run(test = "testFloatMaskedMinIdealSameMask")
+    public void runFloatMaskedMinIdealSameMask() {
+        for (int i = 0; i < F_SPECIES.loopBound(LENGTH); i += F_SPECIES.length()) {
+            testFloatMaskedMinIdealSameMask(i);
+        }
+        for (int i = 0; i < F_SPECIES.loopBound(LENGTH); i++) {
+            float a = fa[i], b = fb[i];
+            boolean mask = m1arr[i];
+            float minAB = mask ? Math.min(a, b) : a;
+            float maxAB = mask ? Math.max(a, b) : a;
+            float expected = mask ? Math.min(minAB, maxAB) : minAB;
+            Verify.checkEQ(fr[i], expected);
+        }
+    }
+
+    // Predicated Float: max(min(a,b,m), max(a,b,m), m) => max(a,b,m)
+    @Test
+    @IR(counts = { IRNode.MIN_VF, IRNode.VECTOR_SIZE_ANY, " 0 ",
+                   IRNode.MAX_VF, IRNode.VECTOR_SIZE_ANY, " 1 " },
+        applyIfCPUFeatureOr = {"avx10_2", "true", "sve", "true"})
+    public void testFloatMaskedMaxIdealSameMask(int index) {
+        FloatVector v1 = FloatVector.fromArray(F_SPECIES, fa, index);
+        FloatVector v2 = FloatVector.fromArray(F_SPECIES, fb, index);
+        VectorMask<Float> m = VectorMask.fromArray(F_SPECIES, m1arr, index);
+        v1.lanewise(VectorOperators.MIN, v2, m)
+          .lanewise(VectorOperators.MAX, v1.lanewise(VectorOperators.MAX, v2, m), m)
+          .intoArray(fr, index);
+    }
+
+    @Run(test = "testFloatMaskedMaxIdealSameMask")
+    public void runFloatMaskedMaxIdealSameMask() {
+        for (int i = 0; i < F_SPECIES.loopBound(LENGTH); i += F_SPECIES.length()) {
+            testFloatMaskedMaxIdealSameMask(i);
+        }
+        for (int i = 0; i < F_SPECIES.loopBound(LENGTH); i++) {
+            float a = fa[i], b = fb[i];
+            boolean mask = m1arr[i];
+            float minAB = mask ? Math.min(a, b) : a;
+            float maxAB = mask ? Math.max(a, b) : a;
+            float expected = mask ? Math.max(minAB, maxAB) : minAB;
+            Verify.checkEQ(fr[i], expected);
+        }
+    }
+
+    // Predicated Float: max(min(a,b,m), max(b,a,m), m) => max(a,b,m)
+    @Test
+    @IR(counts = { IRNode.MIN_VF, IRNode.VECTOR_SIZE_ANY, " 0 ",
+                   IRNode.MAX_VF, IRNode.VECTOR_SIZE_ANY, " 1 " },
+        applyIfCPUFeatureOr = {"avx10_2", "true", "sve", "true"})
+    public void testFloatMaskedMaxIdealFlippedInputs(int index) {
+        FloatVector v1 = FloatVector.fromArray(F_SPECIES, fa, index);
+        FloatVector v2 = FloatVector.fromArray(F_SPECIES, fb, index);
+        VectorMask<Float> m = VectorMask.fromArray(F_SPECIES, m1arr, index);
+        v1.lanewise(VectorOperators.MIN, v2, m)
+          .lanewise(VectorOperators.MAX, v2.lanewise(VectorOperators.MAX, v1, m), m)
+          .intoArray(fr, index);
+    }
+
+    @Run(test = "testFloatMaskedMaxIdealFlippedInputs")
+    public void runFloatMaskedMaxIdealFlippedInputs() {
+        for (int i = 0; i < F_SPECIES.loopBound(LENGTH); i += F_SPECIES.length()) {
+            testFloatMaskedMaxIdealFlippedInputs(i);
+        }
+        for (int i = 0; i < F_SPECIES.loopBound(LENGTH); i++) {
+            float a = fa[i], b = fb[i];
+            boolean mask = m1arr[i];
+            float minAB = mask ? Math.min(a, b) : a;
+            float maxBA = mask ? Math.max(b, a) : b;
+            float expected = mask ? Math.max(minAB, maxBA) : minAB;
+            Verify.checkEQ(fr[i], expected);
+        }
+    }
+
+    // Predicated Float: min(min(a,b,m), max(b,a,m), m) => min(a,b,m)
+    @Test
+    @IR(counts = { IRNode.MIN_VF, IRNode.VECTOR_SIZE_ANY, " 1 ",
+                   IRNode.MAX_VF, IRNode.VECTOR_SIZE_ANY, " 0 " },
+        applyIfCPUFeatureOr = {"avx10_2", "true", "sve", "true"})
+    public void testFloatMaskedMinIdealFlippedInputs(int index) {
+        FloatVector v1 = FloatVector.fromArray(F_SPECIES, fa, index);
+        FloatVector v2 = FloatVector.fromArray(F_SPECIES, fb, index);
+        VectorMask<Float> m = VectorMask.fromArray(F_SPECIES, m1arr, index);
+        v1.lanewise(VectorOperators.MIN, v2, m)
+          .lanewise(VectorOperators.MIN, v2.lanewise(VectorOperators.MAX, v1, m), m)
+          .intoArray(fr, index);
+    }
+
+    @Run(test = "testFloatMaskedMinIdealFlippedInputs")
+    public void runFloatMaskedMinIdealFlippedInputs() {
+        for (int i = 0; i < F_SPECIES.loopBound(LENGTH); i += F_SPECIES.length()) {
+            testFloatMaskedMinIdealFlippedInputs(i);
+        }
+        for (int i = 0; i < F_SPECIES.loopBound(LENGTH); i++) {
+            float a = fa[i], b = fb[i];
+            boolean mask = m1arr[i];
+            float minAB = mask ? Math.min(a, b) : a;
+            float maxBA = mask ? Math.max(b, a) : b;
+            float expected = mask ? Math.min(minAB, maxBA) : minAB;
+            Verify.checkEQ(fr[i], expected);
+        }
+    }
+
+    // Predicated Float: min(min(a,b,m1), max(a,b,m2), m1) => NO transform
+    @Test
+    @IR(counts = { IRNode.MIN_VF, IRNode.VECTOR_SIZE_ANY, " 2 ",
+                   IRNode.MAX_VF, IRNode.VECTOR_SIZE_ANY, " 1 " },
+        applyIfCPUFeatureOr = {"avx10_2", "true", "sve", "true"})
+    public void testFloatMaskedMinIdealDiffMaskMinMax(int index) {
+        FloatVector v1 = FloatVector.fromArray(F_SPECIES, fa, index);
+        FloatVector v2 = FloatVector.fromArray(F_SPECIES, fb, index);
+        VectorMask<Float> mask1 = VectorMask.fromArray(F_SPECIES, m1arr, index);
+        VectorMask<Float> mask2 = VectorMask.fromArray(F_SPECIES, m2arr, index);
+        v1.lanewise(VectorOperators.MIN, v2, mask1)
+          .lanewise(VectorOperators.MIN, v1.lanewise(VectorOperators.MAX, v2, mask2), mask1)
+          .intoArray(fr, index);
+    }
+
+    @Run(test = "testFloatMaskedMinIdealDiffMaskMinMax")
+    public void runFloatMaskedMinIdealDiffMaskMinMax() {
+        for (int i = 0; i < F_SPECIES.loopBound(LENGTH); i += F_SPECIES.length()) {
+            testFloatMaskedMinIdealDiffMaskMinMax(i);
+        }
+        for (int i = 0; i < F_SPECIES.loopBound(LENGTH); i++) {
+            float a = fa[i], b = fb[i];
+            float minAB = m1arr[i] ? Math.min(a, b) : a;
+            float maxAB = m2arr[i] ? Math.max(a, b) : a;
+            float expected = m1arr[i] ? Math.min(minAB, maxAB) : minAB;
+            Verify.checkEQ(fr[i], expected);
+        }
+    }
+
+    // Predicated Float: min(min(a,b,m2), max(a,b,m1), m1) => NO transform
+    @Test
+    @IR(counts = { IRNode.MIN_VF, IRNode.VECTOR_SIZE_ANY, " 2 ",
+                   IRNode.MAX_VF, IRNode.VECTOR_SIZE_ANY, " 1 " },
+        applyIfCPUFeatureOr = {"avx10_2", "true", "sve", "true"})
+    public void testFloatMaskedMinIdealDiffMaskMinMaxSwapped(int index) {
+        FloatVector v1 = FloatVector.fromArray(F_SPECIES, fa, index);
+        FloatVector v2 = FloatVector.fromArray(F_SPECIES, fb, index);
+        VectorMask<Float> mask1 = VectorMask.fromArray(F_SPECIES, m1arr, index);
+        VectorMask<Float> mask2 = VectorMask.fromArray(F_SPECIES, m2arr, index);
+        v1.lanewise(VectorOperators.MIN, v2, mask2)
+          .lanewise(VectorOperators.MIN, v1.lanewise(VectorOperators.MAX, v2, mask1), mask1)
+          .intoArray(fr, index);
+    }
+
+    @Run(test = "testFloatMaskedMinIdealDiffMaskMinMaxSwapped")
+    public void runFloatMaskedMinIdealDiffMaskMinMaxSwapped() {
+        for (int i = 0; i < F_SPECIES.loopBound(LENGTH); i += F_SPECIES.length()) {
+            testFloatMaskedMinIdealDiffMaskMinMaxSwapped(i);
+        }
+        for (int i = 0; i < F_SPECIES.loopBound(LENGTH); i++) {
+            float a = fa[i], b = fb[i];
+            float minAB = m2arr[i] ? Math.min(a, b) : a;
+            float maxAB = m1arr[i] ? Math.max(a, b) : a;
+            float expected = m1arr[i] ? Math.min(minAB, maxAB) : minAB;
+            Verify.checkEQ(fr[i], expected);
+        }
+    }
+
+    // Predicated Float: min(min(a,b,m1), max(a,b,m1), m2) => NO transform
+    @Test
+    @IR(counts = { IRNode.MIN_VF, IRNode.VECTOR_SIZE_ANY, " 2 ",
+                   IRNode.MAX_VF, IRNode.VECTOR_SIZE_ANY, " 1 " },
+        applyIfCPUFeatureOr = {"avx10_2", "true", "sve", "true"})
+    public void testFloatMaskedMinIdealDiffMaskOuter(int index) {
+        FloatVector v1 = FloatVector.fromArray(F_SPECIES, fa, index);
+        FloatVector v2 = FloatVector.fromArray(F_SPECIES, fb, index);
+        VectorMask<Float> mask1 = VectorMask.fromArray(F_SPECIES, m1arr, index);
+        VectorMask<Float> mask2 = VectorMask.fromArray(F_SPECIES, m2arr, index);
+        v1.lanewise(VectorOperators.MIN, v2, mask1)
+          .lanewise(VectorOperators.MIN, v1.lanewise(VectorOperators.MAX, v2, mask1), mask2)
+          .intoArray(fr, index);
+    }
+
+    @Run(test = "testFloatMaskedMinIdealDiffMaskOuter")
+    public void runFloatMaskedMinIdealDiffMaskOuter() {
+        for (int i = 0; i < F_SPECIES.loopBound(LENGTH); i += F_SPECIES.length()) {
+            testFloatMaskedMinIdealDiffMaskOuter(i);
+        }
+        for (int i = 0; i < F_SPECIES.loopBound(LENGTH); i++) {
+            float a = fa[i], b = fb[i];
+            float minAB = m1arr[i] ? Math.min(a, b) : a;
+            float maxAB = m1arr[i] ? Math.max(a, b) : a;
+            float expected = m2arr[i] ? Math.min(minAB, maxAB) : minAB;
+            Verify.checkEQ(fr[i], expected);
+        }
+    }
+
+    // Predicated Float: min(min(a,b,m1), max(a,b,m2), m3) => NO transform
+    @Test
+    @IR(counts = { IRNode.MIN_VF, IRNode.VECTOR_SIZE_ANY, " 2 ",
+                   IRNode.MAX_VF, IRNode.VECTOR_SIZE_ANY, " 1 " },
+        applyIfCPUFeatureOr = {"avx10_2", "true", "sve", "true"})
+    public void testFloatMaskedMinIdealAllDiffMask(int index) {
+        FloatVector v1 = FloatVector.fromArray(F_SPECIES, fa, index);
+        FloatVector v2 = FloatVector.fromArray(F_SPECIES, fb, index);
+        VectorMask<Float> mask1 = VectorMask.fromArray(F_SPECIES, m1arr, index);
+        VectorMask<Float> mask2 = VectorMask.fromArray(F_SPECIES, m2arr, index);
+        VectorMask<Float> mask3 = VectorMask.fromArray(F_SPECIES, m3arr, index);
+        v1.lanewise(VectorOperators.MIN, v2, mask1)
+          .lanewise(VectorOperators.MIN, v1.lanewise(VectorOperators.MAX, v2, mask2), mask3)
+          .intoArray(fr, index);
+    }
+
+    @Run(test = "testFloatMaskedMinIdealAllDiffMask")
+    public void runFloatMaskedMinIdealAllDiffMask() {
+        for (int i = 0; i < F_SPECIES.loopBound(LENGTH); i += F_SPECIES.length()) {
+            testFloatMaskedMinIdealAllDiffMask(i);
+        }
+        for (int i = 0; i < F_SPECIES.loopBound(LENGTH); i++) {
+            float a = fa[i], b = fb[i];
+            float minAB = m1arr[i] ? Math.min(a, b) : a;
+            float maxAB = m2arr[i] ? Math.max(a, b) : a;
+            float expected = m3arr[i] ? Math.min(minAB, maxAB) : minAB;
+            Verify.checkEQ(fr[i], expected);
+        }
+    }
+
+    // Predicated Double: min(min(a,b,m), max(a,b,m), m) => min(a,b,m)
+    @Test
+    @IR(counts = { IRNode.MIN_VD, IRNode.VECTOR_SIZE_ANY, " 1 ",
+                   IRNode.MAX_VD, IRNode.VECTOR_SIZE_ANY, " 0 " },
+        applyIfCPUFeatureOr = {"avx10_2", "true", "sve", "true"})
+    public void testDoubleMaskedMinIdealSameMask(int index) {
+        DoubleVector v1 = DoubleVector.fromArray(D_SPECIES, da, index);
+        DoubleVector v2 = DoubleVector.fromArray(D_SPECIES, db, index);
+        VectorMask<Double> m = VectorMask.fromArray(D_SPECIES, m1arr, index);
+        v1.lanewise(VectorOperators.MIN, v2, m)
+          .lanewise(VectorOperators.MIN, v1.lanewise(VectorOperators.MAX, v2, m), m)
+          .intoArray(dr, index);
+    }
+
+    @Run(test = "testDoubleMaskedMinIdealSameMask")
+    public void runDoubleMaskedMinIdealSameMask() {
+        for (int i = 0; i < D_SPECIES.loopBound(LENGTH); i += D_SPECIES.length()) {
+            testDoubleMaskedMinIdealSameMask(i);
+        }
+        for (int i = 0; i < D_SPECIES.loopBound(LENGTH); i++) {
+            double a = da[i], b = db[i];
+            boolean mask = m1arr[i];
+            double minAB = mask ? Math.min(a, b) : a;
+            double maxAB = mask ? Math.max(a, b) : a;
+            double expected = mask ? Math.min(minAB, maxAB) : minAB;
+            Verify.checkEQ(dr[i], expected);
+        }
+    }
+
+    // Predicated Double: max(min(a,b,m), max(a,b,m), m) => max(a,b,m)
+    @Test
+    @IR(counts = { IRNode.MIN_VD, IRNode.VECTOR_SIZE_ANY, " 0 ",
+                   IRNode.MAX_VD, IRNode.VECTOR_SIZE_ANY, " 1 " },
+        applyIfCPUFeatureOr = {"avx10_2", "true", "sve", "true"})
+    public void testDoubleMaskedMaxIdealSameMask(int index) {
+        DoubleVector v1 = DoubleVector.fromArray(D_SPECIES, da, index);
+        DoubleVector v2 = DoubleVector.fromArray(D_SPECIES, db, index);
+        VectorMask<Double> m = VectorMask.fromArray(D_SPECIES, m1arr, index);
+        v1.lanewise(VectorOperators.MIN, v2, m)
+          .lanewise(VectorOperators.MAX, v1.lanewise(VectorOperators.MAX, v2, m), m)
+          .intoArray(dr, index);
+    }
+
+    @Run(test = "testDoubleMaskedMaxIdealSameMask")
+    public void runDoubleMaskedMaxIdealSameMask() {
+        for (int i = 0; i < D_SPECIES.loopBound(LENGTH); i += D_SPECIES.length()) {
+            testDoubleMaskedMaxIdealSameMask(i);
+        }
+        for (int i = 0; i < D_SPECIES.loopBound(LENGTH); i++) {
+            double a = da[i], b = db[i];
+            boolean mask = m1arr[i];
+            double minAB = mask ? Math.min(a, b) : a;
+            double maxAB = mask ? Math.max(a, b) : a;
+            double expected = mask ? Math.max(minAB, maxAB) : minAB;
+            Verify.checkEQ(dr[i], expected);
+        }
+    }
+
+    // Predicated Double: max(min(a,b,m), max(b,a,m), m) => max(a,b,m)
+    @Test
+    @IR(counts = { IRNode.MIN_VD, IRNode.VECTOR_SIZE_ANY, " 0 ",
+                   IRNode.MAX_VD, IRNode.VECTOR_SIZE_ANY, " 1 " },
+        applyIfCPUFeatureOr = {"avx10_2", "true", "sve", "true"})
+    public void testDoubleMaskedMaxIdealFlippedInputs(int index) {
+        DoubleVector v1 = DoubleVector.fromArray(D_SPECIES, da, index);
+        DoubleVector v2 = DoubleVector.fromArray(D_SPECIES, db, index);
+        VectorMask<Double> m = VectorMask.fromArray(D_SPECIES, m1arr, index);
+        v1.lanewise(VectorOperators.MIN, v2, m)
+          .lanewise(VectorOperators.MAX, v2.lanewise(VectorOperators.MAX, v1, m), m)
+          .intoArray(dr, index);
+    }
+
+    @Run(test = "testDoubleMaskedMaxIdealFlippedInputs")
+    public void runDoubleMaskedMaxIdealFlippedInputs() {
+        for (int i = 0; i < D_SPECIES.loopBound(LENGTH); i += D_SPECIES.length()) {
+            testDoubleMaskedMaxIdealFlippedInputs(i);
+        }
+        for (int i = 0; i < D_SPECIES.loopBound(LENGTH); i++) {
+            double a = da[i], b = db[i];
+            boolean mask = m1arr[i];
+            double minAB = mask ? Math.min(a, b) : a;
+            double maxBA = mask ? Math.max(b, a) : b;
+            double expected = mask ? Math.max(minAB, maxBA) : minAB;
+            Verify.checkEQ(dr[i], expected);
+        }
+    }
+
+    // Predicated Double: min(min(a,b,m), max(b,a,m), m) => min(a,b,m)
+    @Test
+    @IR(counts = { IRNode.MIN_VD, IRNode.VECTOR_SIZE_ANY, " 1 ",
+                   IRNode.MAX_VD, IRNode.VECTOR_SIZE_ANY, " 0 " },
+        applyIfCPUFeatureOr = {"avx10_2", "true", "sve", "true"})
+    public void testDoubleMaskedMinIdealFlippedInputs(int index) {
+        DoubleVector v1 = DoubleVector.fromArray(D_SPECIES, da, index);
+        DoubleVector v2 = DoubleVector.fromArray(D_SPECIES, db, index);
+        VectorMask<Double> m = VectorMask.fromArray(D_SPECIES, m1arr, index);
+        v1.lanewise(VectorOperators.MIN, v2, m)
+          .lanewise(VectorOperators.MIN, v2.lanewise(VectorOperators.MAX, v1, m), m)
+          .intoArray(dr, index);
+    }
+
+    @Run(test = "testDoubleMaskedMinIdealFlippedInputs")
+    public void runDoubleMaskedMinIdealFlippedInputs() {
+        for (int i = 0; i < D_SPECIES.loopBound(LENGTH); i += D_SPECIES.length()) {
+            testDoubleMaskedMinIdealFlippedInputs(i);
+        }
+        for (int i = 0; i < D_SPECIES.loopBound(LENGTH); i++) {
+            double a = da[i], b = db[i];
+            boolean mask = m1arr[i];
+            double minAB = mask ? Math.min(a, b) : a;
+            double maxBA = mask ? Math.max(b, a) : b;
+            double expected = mask ? Math.min(minAB, maxBA) : minAB;
+            Verify.checkEQ(dr[i], expected);
+        }
+    }
+
+    // Predicated Double: min(min(a,b,m1), max(a,b,m2), m1) => NO transform
+    @Test
+    @IR(counts = { IRNode.MIN_VD, IRNode.VECTOR_SIZE_ANY, " 2 ",
+                   IRNode.MAX_VD, IRNode.VECTOR_SIZE_ANY, " 1 " },
+        applyIfCPUFeatureOr = {"avx10_2", "true", "sve", "true"})
+    public void testDoubleMaskedMinIdealDiffMaskMinMax(int index) {
+        DoubleVector v1 = DoubleVector.fromArray(D_SPECIES, da, index);
+        DoubleVector v2 = DoubleVector.fromArray(D_SPECIES, db, index);
+        VectorMask<Double> mask1 = VectorMask.fromArray(D_SPECIES, m1arr, index);
+        VectorMask<Double> mask2 = VectorMask.fromArray(D_SPECIES, m2arr, index);
+        v1.lanewise(VectorOperators.MIN, v2, mask1)
+          .lanewise(VectorOperators.MIN, v1.lanewise(VectorOperators.MAX, v2, mask2), mask1)
+          .intoArray(dr, index);
+    }
+
+    @Run(test = "testDoubleMaskedMinIdealDiffMaskMinMax")
+    public void runDoubleMaskedMinIdealDiffMaskMinMax() {
+        for (int i = 0; i < D_SPECIES.loopBound(LENGTH); i += D_SPECIES.length()) {
+            testDoubleMaskedMinIdealDiffMaskMinMax(i);
+        }
+        for (int i = 0; i < D_SPECIES.loopBound(LENGTH); i++) {
+            double a = da[i], b = db[i];
+            double minAB = m1arr[i] ? Math.min(a, b) : a;
+            double maxAB = m2arr[i] ? Math.max(a, b) : a;
+            double expected = m1arr[i] ? Math.min(minAB, maxAB) : minAB;
+            Verify.checkEQ(dr[i], expected);
+        }
+    }
+
+    // Predicated Double: min(min(a,b,m2), max(a,b,m1), m1) => NO transform
+    @Test
+    @IR(counts = { IRNode.MIN_VD, IRNode.VECTOR_SIZE_ANY, " 2 ",
+                   IRNode.MAX_VD, IRNode.VECTOR_SIZE_ANY, " 1 " },
+        applyIfCPUFeatureOr = {"avx10_2", "true", "sve", "true"})
+    public void testDoubleMaskedMinIdealDiffMaskMinMaxSwapped(int index) {
+        DoubleVector v1 = DoubleVector.fromArray(D_SPECIES, da, index);
+        DoubleVector v2 = DoubleVector.fromArray(D_SPECIES, db, index);
+        VectorMask<Double> mask1 = VectorMask.fromArray(D_SPECIES, m1arr, index);
+        VectorMask<Double> mask2 = VectorMask.fromArray(D_SPECIES, m2arr, index);
+        v1.lanewise(VectorOperators.MIN, v2, mask2)
+          .lanewise(VectorOperators.MIN, v1.lanewise(VectorOperators.MAX, v2, mask1), mask1)
+          .intoArray(dr, index);
+    }
+
+    @Run(test = "testDoubleMaskedMinIdealDiffMaskMinMaxSwapped")
+    public void runDoubleMaskedMinIdealDiffMaskMinMaxSwapped() {
+        for (int i = 0; i < D_SPECIES.loopBound(LENGTH); i += D_SPECIES.length()) {
+            testDoubleMaskedMinIdealDiffMaskMinMaxSwapped(i);
+        }
+        for (int i = 0; i < D_SPECIES.loopBound(LENGTH); i++) {
+            double a = da[i], b = db[i];
+            double minAB = m2arr[i] ? Math.min(a, b) : a;
+            double maxAB = m1arr[i] ? Math.max(a, b) : a;
+            double expected = m1arr[i] ? Math.min(minAB, maxAB) : minAB;
+            Verify.checkEQ(dr[i], expected);
+        }
+    }
+
+    // Predicated Double: min(min(a,b,m1), max(a,b,m1), m2) => NO transform
+    @Test
+    @IR(counts = { IRNode.MIN_VD, IRNode.VECTOR_SIZE_ANY, " 2 ",
+                   IRNode.MAX_VD, IRNode.VECTOR_SIZE_ANY, " 1 " },
+        applyIfCPUFeatureOr = {"avx10_2", "true", "sve", "true"})
+    public void testDoubleMaskedMinIdealDiffMaskOuter(int index) {
+        DoubleVector v1 = DoubleVector.fromArray(D_SPECIES, da, index);
+        DoubleVector v2 = DoubleVector.fromArray(D_SPECIES, db, index);
+        VectorMask<Double> mask1 = VectorMask.fromArray(D_SPECIES, m1arr, index);
+        VectorMask<Double> mask2 = VectorMask.fromArray(D_SPECIES, m2arr, index);
+        v1.lanewise(VectorOperators.MIN, v2, mask1)
+          .lanewise(VectorOperators.MIN, v1.lanewise(VectorOperators.MAX, v2, mask1), mask2)
+          .intoArray(dr, index);
+    }
+
+    @Run(test = "testDoubleMaskedMinIdealDiffMaskOuter")
+    public void runDoubleMaskedMinIdealDiffMaskOuter() {
+        for (int i = 0; i < D_SPECIES.loopBound(LENGTH); i += D_SPECIES.length()) {
+            testDoubleMaskedMinIdealDiffMaskOuter(i);
+        }
+        for (int i = 0; i < D_SPECIES.loopBound(LENGTH); i++) {
+            double a = da[i], b = db[i];
+            double minAB = m1arr[i] ? Math.min(a, b) : a;
+            double maxAB = m1arr[i] ? Math.max(a, b) : a;
+            double expected = m2arr[i] ? Math.min(minAB, maxAB) : minAB;
+            Verify.checkEQ(dr[i], expected);
+        }
+    }
+
+    // Predicated Double: min(min(a,b,m1), max(a,b,m2), m3) => NO transform
+    @Test
+    @IR(counts = { IRNode.MIN_VD, IRNode.VECTOR_SIZE_ANY, " 2 ",
+                   IRNode.MAX_VD, IRNode.VECTOR_SIZE_ANY, " 1 " },
+        applyIfCPUFeatureOr = {"avx10_2", "true", "sve", "true"})
+    public void testDoubleMaskedMinIdealAllDiffMask(int index) {
+        DoubleVector v1 = DoubleVector.fromArray(D_SPECIES, da, index);
+        DoubleVector v2 = DoubleVector.fromArray(D_SPECIES, db, index);
+        VectorMask<Double> mask1 = VectorMask.fromArray(D_SPECIES, m1arr, index);
+        VectorMask<Double> mask2 = VectorMask.fromArray(D_SPECIES, m2arr, index);
+        VectorMask<Double> mask3 = VectorMask.fromArray(D_SPECIES, m3arr, index);
+        v1.lanewise(VectorOperators.MIN, v2, mask1)
+          .lanewise(VectorOperators.MIN, v1.lanewise(VectorOperators.MAX, v2, mask2), mask3)
+          .intoArray(dr, index);
+    }
+
+    @Run(test = "testDoubleMaskedMinIdealAllDiffMask")
+    public void runDoubleMaskedMinIdealAllDiffMask() {
+        for (int i = 0; i < D_SPECIES.loopBound(LENGTH); i += D_SPECIES.length()) {
+            testDoubleMaskedMinIdealAllDiffMask(i);
+        }
+        for (int i = 0; i < D_SPECIES.loopBound(LENGTH); i++) {
+            double a = da[i], b = db[i];
+            double minAB = m1arr[i] ? Math.min(a, b) : a;
+            double maxAB = m2arr[i] ? Math.max(a, b) : a;
+            double expected = m3arr[i] ? Math.min(minAB, maxAB) : minAB;
+            Verify.checkEQ(dr[i], expected);
+        }
+    }
+}
diff --git a/test/hotspot/jtreg/compiler/vectorapi/VectorUnsignedMinMaxOperationsTest.java b/test/hotspot/jtreg/compiler/vectorapi/VectorUnsignedMinMaxOperationsTest.java
index 464e887cbac..b1b98306312 100644
--- a/test/hotspot/jtreg/compiler/vectorapi/VectorUnsignedMinMaxOperationsTest.java
+++ b/test/hotspot/jtreg/compiler/vectorapi/VectorUnsignedMinMaxOperationsTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2025, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -34,10 +34,11 @@ package compiler.vectorapi;
 
 import jdk.incubator.vector.*;
 import compiler.lib.ir_framework.*;
+import compiler.lib.verify.*;
 import java.util.stream.IntStream;
 
 public class VectorUnsignedMinMaxOperationsTest {
-    private static final int COUNT = 2048;
+    private static final int COUNT = 1024;
     private static final VectorSpecies<Long> lspec    = LongVector.SPECIES_PREFERRED;
     private static final VectorSpecies<Integer> ispec = IntVector.SPECIES_PREFERRED;
     private static final VectorSpecies<Short> sspec   = ShortVector.SPECIES_PREFERRED;
@@ -58,6 +59,8 @@ public class VectorUnsignedMinMaxOperationsTest {
     private short[] short_out;
     private byte[]  byte_out;
 
+    private boolean[] m1arr, m2arr, m3arr;
+
     public static void main(String[] args) {
         TestFramework testFramework = new TestFramework();
         testFramework.setDefaultWarmup(5000)
@@ -102,6 +105,14 @@ public class VectorUnsignedMinMaxOperationsTest {
         int_out   = new int[COUNT];
         short_out = new short[COUNT];
         byte_out  = new byte[COUNT];
+        m1arr = new boolean[COUNT];
+        m2arr = new boolean[COUNT];
+        m3arr = new boolean[COUNT];
+        for (int j = 0; j < COUNT; j++) {
+            m1arr[j] = (j % 2) == 0;
+            m2arr[j] = (j % 2) != 0;
+            m3arr[j] = (j % 3) == 0;
+        }
     }
 
     @Test
@@ -468,5 +479,1341 @@ public class VectorUnsignedMinMaxOperationsTest {
             }
         }
     }
-}
 
+
+    // Predicated: umin(umin(a,b,m), umax(a,b,m), m) => umin(a,b,m)
+    @Test
+    @IR(counts = {IRNode.UMIN_VI, " 1 ", IRNode.UMAX_VI, " 0 "}, applyIfCPUFeatureOr = {"avx512f", "true", "sve", "true"})
+    public void umin_masked_same_mask(int index) {
+        IntVector vec1 = IntVector.fromArray(ispec, int_in1, index);
+        IntVector vec2 = IntVector.fromArray(ispec, int_in2, index);
+        VectorMask<Integer> m = VectorMask.fromArray(ispec, m1arr, index);
+        vec1.lanewise(VectorOperators.UMIN, vec2, m)
+            .lanewise(VectorOperators.UMIN,
+                      vec1.lanewise(VectorOperators.UMAX, vec2, m), m)
+            .intoArray(int_out, index);
+    }
+
+    @Run(test = "umin_masked_same_mask")
+    public void umin_masked_same_mask_runner() {
+        for (int i = 0; i < ispec.loopBound(COUNT); i += ispec.length()) {
+            umin_masked_same_mask(i);
+        }
+        for (int i = 0; i < ispec.loopBound(COUNT); i++) {
+            int a = int_in1[i], b = int_in2[i];
+            int minAB = m1arr[i] ? VectorMath.minUnsigned(a, b) : a;
+            int maxAB = m1arr[i] ? VectorMath.maxUnsigned(a, b) : a;
+            int expected = m1arr[i] ? VectorMath.minUnsigned(minAB, maxAB) : minAB;
+            Verify.checkEQ(int_out[i], expected);
+        }
+    }
+
+    // Predicated: umin(umin(a,b,m), umax(b,a,m), m) => umin(a,b,m)
+    @Test
+    @IR(counts = {IRNode.UMIN_VI, " 1 ", IRNode.UMAX_VI, " 0 "}, applyIfCPUFeatureOr = {"avx512f", "true", "sve", "true"})
+    public void umin_masked_flipped_inputs(int index) {
+        IntVector vec1 = IntVector.fromArray(ispec, int_in1, index);
+        IntVector vec2 = IntVector.fromArray(ispec, int_in2, index);
+        VectorMask<Integer> m = VectorMask.fromArray(ispec, m1arr, index);
+        vec1.lanewise(VectorOperators.UMIN, vec2, m)
+            .lanewise(VectorOperators.UMIN,
+                      vec2.lanewise(VectorOperators.UMAX, vec1, m), m)
+            .intoArray(int_out, index);
+    }
+
+    @Run(test = "umin_masked_flipped_inputs")
+    public void umin_masked_flipped_inputs_runner() {
+        for (int i = 0; i < ispec.loopBound(COUNT); i += ispec.length()) {
+            umin_masked_flipped_inputs(i);
+        }
+        for (int i = 0; i < ispec.loopBound(COUNT); i++) {
+            int a = int_in1[i], b = int_in2[i];
+            int minAB = m1arr[i] ? VectorMath.minUnsigned(a, b) : a;
+            int maxBA = m1arr[i] ? VectorMath.maxUnsigned(b, a) : b;
+            int expected = m1arr[i] ? VectorMath.minUnsigned(minAB, maxBA) : minAB;
+            Verify.checkEQ(int_out[i], expected);
+        }
+    }
+
+    // Predicated: umin(umin(a,b,m1), umax(a,b,m2), m1) => NO transform
+    @Test
+    @IR(counts = {IRNode.UMIN_VI, " 2 ", IRNode.UMAX_VI, " 1 "}, applyIfCPUFeatureOr = {"avx512f", "true", "sve", "true"})
+    public void umin_masked_diff_mask_minmax(int index) {
+        IntVector vec1 = IntVector.fromArray(ispec, int_in1, index);
+        IntVector vec2 = IntVector.fromArray(ispec, int_in2, index);
+        VectorMask<Integer> mask1 = VectorMask.fromArray(ispec, m1arr, index);
+        VectorMask<Integer> mask2 = VectorMask.fromArray(ispec, m2arr, index);
+        vec1.lanewise(VectorOperators.UMIN, vec2, mask1)
+            .lanewise(VectorOperators.UMIN,
+                      vec1.lanewise(VectorOperators.UMAX, vec2, mask2), mask1)
+            .intoArray(int_out, index);
+    }
+
+    @Run(test = "umin_masked_diff_mask_minmax")
+    public void umin_masked_diff_mask_minmax_runner() {
+        for (int i = 0; i < ispec.loopBound(COUNT); i += ispec.length()) {
+            umin_masked_diff_mask_minmax(i);
+        }
+        for (int i = 0; i < ispec.loopBound(COUNT); i++) {
+            int a = int_in1[i], b = int_in2[i];
+            int minAB = m1arr[i] ? VectorMath.minUnsigned(a, b) : a;
+            int maxAB = m2arr[i] ? VectorMath.maxUnsigned(a, b) : a;
+            int expected = m1arr[i] ? VectorMath.minUnsigned(minAB, maxAB) : minAB;
+            Verify.checkEQ(int_out[i], expected);
+        }
+    }
+
+    // Predicated: umin(umin(a,b,m2), umax(a,b,m1), m1) => NO transform
+    @Test
+    @IR(counts = {IRNode.UMIN_VI, " 2 ", IRNode.UMAX_VI, " 1 "}, applyIfCPUFeatureOr = {"avx512f", "true", "sve", "true"})
+    public void umin_masked_diff_mask_minmax_swap(int index) {
+        IntVector vec1 = IntVector.fromArray(ispec, int_in1, index);
+        IntVector vec2 = IntVector.fromArray(ispec, int_in2, index);
+        VectorMask<Integer> mask1 = VectorMask.fromArray(ispec, m1arr, index);
+        VectorMask<Integer> mask2 = VectorMask.fromArray(ispec, m2arr, index);
+        vec1.lanewise(VectorOperators.UMIN, vec2, mask2)
+            .lanewise(VectorOperators.UMIN,
+                      vec1.lanewise(VectorOperators.UMAX, vec2, mask1), mask1)
+            .intoArray(int_out, index);
+    }
+
+    @Run(test = "umin_masked_diff_mask_minmax_swap")
+    public void umin_masked_diff_mask_minmax_swap_runner() {
+        for (int i = 0; i < ispec.loopBound(COUNT); i += ispec.length()) {
+            umin_masked_diff_mask_minmax_swap(i);
+        }
+        for (int i = 0; i < ispec.loopBound(COUNT); i++) {
+            int a = int_in1[i], b = int_in2[i];
+            int minAB = m2arr[i] ? VectorMath.minUnsigned(a, b) : a;
+            int maxAB = m1arr[i] ? VectorMath.maxUnsigned(a, b) : a;
+            int expected = m1arr[i] ? VectorMath.minUnsigned(minAB, maxAB) : minAB;
+            Verify.checkEQ(int_out[i], expected);
+        }
+    }
+
+    // Predicated: umin(umin(a,b,m1), umax(a,b,m1), m2) => NO transform
+    @Test
+    @IR(counts = {IRNode.UMIN_VI, " 2 ", IRNode.UMAX_VI, " 1 "}, applyIfCPUFeatureOr = {"avx512f", "true", "sve", "true"})
+    public void umin_masked_diff_mask_outer(int index) {
+        IntVector vec1 = IntVector.fromArray(ispec, int_in1, index);
+        IntVector vec2 = IntVector.fromArray(ispec, int_in2, index);
+        VectorMask<Integer> mask1 = VectorMask.fromArray(ispec, m1arr, index);
+        VectorMask<Integer> mask2 = VectorMask.fromArray(ispec, m2arr, index);
+        vec1.lanewise(VectorOperators.UMIN, vec2, mask1)
+            .lanewise(VectorOperators.UMIN,
+                      vec1.lanewise(VectorOperators.UMAX, vec2, mask1), mask2)
+            .intoArray(int_out, index);
+    }
+
+    @Run(test = "umin_masked_diff_mask_outer")
+    public void umin_masked_diff_mask_outer_runner() {
+        for (int i = 0; i < ispec.loopBound(COUNT); i += ispec.length()) {
+            umin_masked_diff_mask_outer(i);
+        }
+        for (int i = 0; i < ispec.loopBound(COUNT); i++) {
+            int a = int_in1[i], b = int_in2[i];
+            int minAB = m1arr[i] ? VectorMath.minUnsigned(a, b) : a;
+            int maxAB = m1arr[i] ? VectorMath.maxUnsigned(a, b) : a;
+            int expected = m2arr[i] ? VectorMath.minUnsigned(minAB, maxAB) : minAB;
+            Verify.checkEQ(int_out[i], expected);
+        }
+    }
+
+    // Predicated: umin(umin(a,b,m1), umax(a,b,m2), m3) => NO transform
+    @Test
+    @IR(counts = {IRNode.UMIN_VI, " 2 ", IRNode.UMAX_VI, " 1 "}, applyIfCPUFeatureOr = {"avx512f", "true", "sve", "true"})
+    public void umin_masked_all_diff_mask(int index) {
+        IntVector vec1 = IntVector.fromArray(ispec, int_in1, index);
+        IntVector vec2 = IntVector.fromArray(ispec, int_in2, index);
+        VectorMask<Integer> mask1 = VectorMask.fromArray(ispec, m1arr, index);
+        VectorMask<Integer> mask2 = VectorMask.fromArray(ispec, m2arr, index);
+        VectorMask<Integer> mask3 = VectorMask.fromArray(ispec, m3arr, index);
+        vec1.lanewise(VectorOperators.UMIN, vec2, mask1)
+            .lanewise(VectorOperators.UMIN,
+                      vec1.lanewise(VectorOperators.UMAX, vec2, mask2), mask3)
+            .intoArray(int_out, index);
+    }
+
+    @Run(test = "umin_masked_all_diff_mask")
+    public void umin_masked_all_diff_mask_runner() {
+        for (int i = 0; i < ispec.loopBound(COUNT); i += ispec.length()) {
+            umin_masked_all_diff_mask(i);
+        }
+        for (int i = 0; i < ispec.loopBound(COUNT); i++) {
+            int a = int_in1[i], b = int_in2[i];
+            int minAB = m1arr[i] ? VectorMath.minUnsigned(a, b) : a;
+            int maxAB = m2arr[i] ? VectorMath.maxUnsigned(a, b) : a;
+            int expected = m3arr[i] ? VectorMath.minUnsigned(minAB, maxAB) : minAB;
+            Verify.checkEQ(int_out[i], expected);
+        }
+    }
+
+    // Predicated: umax(umin(a,b,m), umax(a,b,m), m) => umax(a,b,m)
+    @Test
+    @IR(counts = {IRNode.UMIN_VI, " 0 ", IRNode.UMAX_VI, " 1 "}, applyIfCPUFeatureOr = {"avx512f", "true", "sve", "true"})
+    public void umax_masked_same_mask(int index) {
+        IntVector vec1 = IntVector.fromArray(ispec, int_in1, index);
+        IntVector vec2 = IntVector.fromArray(ispec, int_in2, index);
+        VectorMask<Integer> m = VectorMask.fromArray(ispec, m1arr, index);
+        vec1.lanewise(VectorOperators.UMIN, vec2, m)
+            .lanewise(VectorOperators.UMAX,
+                      vec1.lanewise(VectorOperators.UMAX, vec2, m), m)
+            .intoArray(int_out, index);
+    }
+
+    @Run(test = "umax_masked_same_mask")
+    public void umax_masked_same_mask_runner() {
+        for (int i = 0; i < ispec.loopBound(COUNT); i += ispec.length()) {
+            umax_masked_same_mask(i);
+        }
+        for (int i = 0; i < ispec.loopBound(COUNT); i++) {
+            int a = int_in1[i], b = int_in2[i];
+            int minAB = m1arr[i] ? VectorMath.minUnsigned(a, b) : a;
+            int maxAB = m1arr[i] ? VectorMath.maxUnsigned(a, b) : a;
+            int expected = m1arr[i] ? VectorMath.maxUnsigned(minAB, maxAB) : minAB;
+            Verify.checkEQ(int_out[i], expected);
+        }
+    }
+
+    // Predicated: umax(umin(a,b,m), umax(b,a,m), m) => umax(a,b,m)
+    @Test
+    @IR(counts = {IRNode.UMIN_VI, " 0 ", IRNode.UMAX_VI, " 1 "}, applyIfCPUFeatureOr = {"avx512f", "true", "sve", "true"})
+    public void umax_masked_flipped_inputs(int index) {
+        IntVector vec1 = IntVector.fromArray(ispec, int_in1, index);
+        IntVector vec2 = IntVector.fromArray(ispec, int_in2, index);
+        VectorMask<Integer> m = VectorMask.fromArray(ispec, m1arr, index);
+        vec1.lanewise(VectorOperators.UMIN, vec2, m)
+            .lanewise(VectorOperators.UMAX,
+                      vec2.lanewise(VectorOperators.UMAX, vec1, m), m)
+            .intoArray(int_out, index);
+    }
+
+    @Run(test = "umax_masked_flipped_inputs")
+    public void umax_masked_flipped_inputs_runner() {
+        for (int i = 0; i < ispec.loopBound(COUNT); i += ispec.length()) {
+            umax_masked_flipped_inputs(i);
+        }
+        for (int i = 0; i < ispec.loopBound(COUNT); i++) {
+            int a = int_in1[i], b = int_in2[i];
+            int minAB = m1arr[i] ? VectorMath.minUnsigned(a, b) : a;
+            int maxBA = m1arr[i] ? VectorMath.maxUnsigned(b, a) : b;
+            int expected = m1arr[i] ? VectorMath.maxUnsigned(minAB, maxBA) : minAB;
+            Verify.checkEQ(int_out[i], expected);
+        }
+    }
+
+    // Predicated: umax(umin(a,b,m1), umax(a,b,m2), m1) => NO transform
+    @Test
+    @IR(counts = {IRNode.UMIN_VI, " 1 ", IRNode.UMAX_VI, " 2 "}, applyIfCPUFeatureOr = {"avx512f", "true", "sve", "true"})
+    public void umax_masked_diff_mask_minmax(int index) {
+        IntVector vec1 = IntVector.fromArray(ispec, int_in1, index);
+        IntVector vec2 = IntVector.fromArray(ispec, int_in2, index);
+        VectorMask<Integer> mask1 = VectorMask.fromArray(ispec, m1arr, index);
+        VectorMask<Integer> mask2 = VectorMask.fromArray(ispec, m2arr, index);
+        vec1.lanewise(VectorOperators.UMIN, vec2, mask1)
+            .lanewise(VectorOperators.UMAX,
+                      vec1.lanewise(VectorOperators.UMAX, vec2, mask2), mask1)
+            .intoArray(int_out, index);
+    }
+
+    @Run(test = "umax_masked_diff_mask_minmax")
+    public void umax_masked_diff_mask_minmax_runner() {
+        for (int i = 0; i < ispec.loopBound(COUNT); i += ispec.length()) {
+            umax_masked_diff_mask_minmax(i);
+        }
+        for (int i = 0; i < ispec.loopBound(COUNT); i++) {
+            int a = int_in1[i], b = int_in2[i];
+            int minAB = m1arr[i] ? VectorMath.minUnsigned(a, b) : a;
+            int maxAB = m2arr[i] ? VectorMath.maxUnsigned(a, b) : a;
+            int expected = m1arr[i] ? VectorMath.maxUnsigned(minAB, maxAB) : minAB;
+            Verify.checkEQ(int_out[i], expected);
+        }
+    }
+
+    // Predicated: umax(umin(a,b,m2), umax(a,b,m1), m1) => NO transform
+    @Test
+    @IR(counts = {IRNode.UMIN_VI, " 1 ", IRNode.UMAX_VI, " 2 "}, applyIfCPUFeatureOr = {"avx512f", "true", "sve", "true"})
+    public void umax_masked_diff_mask_minmax_swap(int index) {
+        IntVector vec1 = IntVector.fromArray(ispec, int_in1, index);
+        IntVector vec2 = IntVector.fromArray(ispec, int_in2, index);
+        VectorMask<Integer> mask1 = VectorMask.fromArray(ispec, m1arr, index);
+        VectorMask<Integer> mask2 = VectorMask.fromArray(ispec, m2arr, index);
+        vec1.lanewise(VectorOperators.UMIN, vec2, mask2)
+            .lanewise(VectorOperators.UMAX,
+                      vec1.lanewise(VectorOperators.UMAX, vec2, mask1), mask1)
+            .intoArray(int_out, index);
+    }
+
+    @Run(test = "umax_masked_diff_mask_minmax_swap")
+    public void umax_masked_diff_mask_minmax_swap_runner() {
+        for (int i = 0; i < ispec.loopBound(COUNT); i += ispec.length()) {
+            umax_masked_diff_mask_minmax_swap(i);
+        }
+        for (int i = 0; i < ispec.loopBound(COUNT); i++) {
+            int a = int_in1[i], b = int_in2[i];
+            int minAB = m2arr[i] ? VectorMath.minUnsigned(a, b) : a;
+            int maxAB = m1arr[i] ? VectorMath.maxUnsigned(a, b) : a;
+            int expected = m1arr[i] ? VectorMath.maxUnsigned(minAB, maxAB) : minAB;
+            Verify.checkEQ(int_out[i], expected);
+        }
+    }
+
+    // Predicated: umax(umin(a,b,m1), umax(a,b,m1), m2) => NO transform
+    @Test
+    @IR(counts = {IRNode.UMIN_VI, " 1 ", IRNode.UMAX_VI, " 2 "}, applyIfCPUFeatureOr = {"avx512f", "true", "sve", "true"})
+    public void umax_masked_diff_mask_outer(int index) {
+        IntVector vec1 = IntVector.fromArray(ispec, int_in1, index);
+        IntVector vec2 = IntVector.fromArray(ispec, int_in2, index);
+        VectorMask<Integer> mask1 = VectorMask.fromArray(ispec, m1arr, index);
+        VectorMask<Integer> mask2 = VectorMask.fromArray(ispec, m2arr, index);
+        vec1.lanewise(VectorOperators.UMIN, vec2, mask1)
+            .lanewise(VectorOperators.UMAX,
+                      vec1.lanewise(VectorOperators.UMAX, vec2, mask1), mask2)
+            .intoArray(int_out, index);
+    }
+
+    @Run(test = "umax_masked_diff_mask_outer")
+    public void umax_masked_diff_mask_outer_runner() {
+        for (int i = 0; i < ispec.loopBound(COUNT); i += ispec.length()) {
+            umax_masked_diff_mask_outer(i);
+        }
+        for (int i = 0; i < ispec.loopBound(COUNT); i++) {
+            int a = int_in1[i], b = int_in2[i];
+            int minAB = m1arr[i] ? VectorMath.minUnsigned(a, b) : a;
+            int maxAB = m1arr[i] ? VectorMath.maxUnsigned(a, b) : a;
+            int expected = m2arr[i] ? VectorMath.maxUnsigned(minAB, maxAB) : minAB;
+            Verify.checkEQ(int_out[i], expected);
+        }
+    }
+
+    // Predicated: umax(umin(a,b,m1), umax(a,b,m2), m3) => NO transform
+    @Test
+    @IR(counts = {IRNode.UMIN_VI, " 1 ", IRNode.UMAX_VI, " 2 "}, applyIfCPUFeatureOr = {"avx512f", "true", "sve", "true"})
+    public void umax_masked_all_diff_mask(int index) {
+        IntVector vec1 = IntVector.fromArray(ispec, int_in1, index);
+        IntVector vec2 = IntVector.fromArray(ispec, int_in2, index);
+        VectorMask<Integer> mask1 = VectorMask.fromArray(ispec, m1arr, index);
+        VectorMask<Integer> mask2 = VectorMask.fromArray(ispec, m2arr, index);
+        VectorMask<Integer> mask3 = VectorMask.fromArray(ispec, m3arr, index);
+        vec1.lanewise(VectorOperators.UMIN, vec2, mask1)
+            .lanewise(VectorOperators.UMAX,
+                      vec1.lanewise(VectorOperators.UMAX, vec2, mask2), mask3)
+            .intoArray(int_out, index);
+    }
+
+    @Run(test = "umax_masked_all_diff_mask")
+    public void umax_masked_all_diff_mask_runner() {
+        for (int i = 0; i < ispec.loopBound(COUNT); i += ispec.length()) {
+            umax_masked_all_diff_mask(i);
+        }
+        for (int i = 0; i < ispec.loopBound(COUNT); i++) {
+            int a = int_in1[i], b = int_in2[i];
+            int minAB = m1arr[i] ? VectorMath.minUnsigned(a, b) : a;
+            int maxAB = m2arr[i] ? VectorMath.maxUnsigned(a, b) : a;
+            int expected = m3arr[i] ? VectorMath.maxUnsigned(minAB, maxAB) : minAB;
+            Verify.checkEQ(int_out[i], expected);
+        }
+    }
+
+    // Predicated Byte: umin(umin(a,b,m), umax(a,b,m), m) => umin(a,b,m)
+    @Test
+    @IR(counts = {IRNode.UMIN_VB, " 1 ", IRNode.UMAX_VB, " 0 "}, applyIfCPUFeatureOr = {"avx512bw", "true", "sve", "true"})
+    public void umin_byte_masked_same_mask(int index) {
+        ByteVector vec1 = ByteVector.fromArray(bspec, byte_in1, index);
+        ByteVector vec2 = ByteVector.fromArray(bspec, byte_in2, index);
+        VectorMask<Byte> m = VectorMask.fromArray(bspec, m1arr, index);
+        vec1.lanewise(VectorOperators.UMIN, vec2, m)
+            .lanewise(VectorOperators.UMIN,
+                      vec1.lanewise(VectorOperators.UMAX, vec2, m), m)
+            .intoArray(byte_out, index);
+    }
+
+    @Run(test = "umin_byte_masked_same_mask")
+    public void umin_byte_masked_same_mask_runner() {
+        for (int i = 0; i < bspec.loopBound(COUNT); i += bspec.length()) {
+            umin_byte_masked_same_mask(i);
+        }
+        for (int i = 0; i < bspec.loopBound(COUNT); i++) {
+            byte a = byte_in1[i], b = byte_in2[i];
+            byte minAB = (byte)(m1arr[i] ? VectorMath.minUnsigned(a, b) : a);
+            byte maxAB = (byte)(m1arr[i] ? VectorMath.maxUnsigned(a, b) : a);
+            byte expected = (byte)(m1arr[i] ? VectorMath.minUnsigned(minAB, maxAB) : minAB);
+            Verify.checkEQ(byte_out[i], expected);
+        }
+    }
+
+    // Predicated Byte: umin(umin(a,b,m), umax(b,a,m), m) => umin(a,b,m)
+    @Test
+    @IR(counts = {IRNode.UMIN_VB, " 1 ", IRNode.UMAX_VB, " 0 "}, applyIfCPUFeatureOr = {"avx512bw", "true", "sve", "true"})
+    public void umin_byte_masked_flipped_inputs(int index) {
+        ByteVector vec1 = ByteVector.fromArray(bspec, byte_in1, index);
+        ByteVector vec2 = ByteVector.fromArray(bspec, byte_in2, index);
+        VectorMask<Byte> m = VectorMask.fromArray(bspec, m1arr, index);
+        vec1.lanewise(VectorOperators.UMIN, vec2, m)
+            .lanewise(VectorOperators.UMIN,
+                      vec2.lanewise(VectorOperators.UMAX, vec1, m), m)
+            .intoArray(byte_out, index);
+    }
+
+    @Run(test = "umin_byte_masked_flipped_inputs")
+    public void umin_byte_masked_flipped_inputs_runner() {
+        for (int i = 0; i < bspec.loopBound(COUNT); i += bspec.length()) {
+            umin_byte_masked_flipped_inputs(i);
+        }
+        for (int i = 0; i < bspec.loopBound(COUNT); i++) {
+            byte a = byte_in1[i], b = byte_in2[i];
+            byte minAB = (byte)(m1arr[i] ? VectorMath.minUnsigned(a, b) : a);
+            byte maxBA = (byte)(m1arr[i] ? VectorMath.maxUnsigned(b, a) : b);
+            byte expected = (byte)(m1arr[i] ? VectorMath.minUnsigned(minAB, maxBA) : minAB);
+            Verify.checkEQ(byte_out[i], expected);
+        }
+    }
+
+    // Predicated Byte: umin(umin(a,b,m1), umax(a,b,m2), m1) => NO transform
+    @Test
+    @IR(counts = {IRNode.UMIN_VB, " 2 ", IRNode.UMAX_VB, " 1 "}, applyIfCPUFeatureOr = {"avx512bw", "true", "sve", "true"})
+    public void umin_byte_masked_diff_mask_minmax(int index) {
+        ByteVector vec1 = ByteVector.fromArray(bspec, byte_in1, index);
+        ByteVector vec2 = ByteVector.fromArray(bspec, byte_in2, index);
+        VectorMask<Byte> mask1 = VectorMask.fromArray(bspec, m1arr, index);
+        VectorMask<Byte> mask2 = VectorMask.fromArray(bspec, m2arr, index);
+        vec1.lanewise(VectorOperators.UMIN, vec2, mask1)
+            .lanewise(VectorOperators.UMIN,
+                      vec1.lanewise(VectorOperators.UMAX, vec2, mask2), mask1)
+            .intoArray(byte_out, index);
+    }
+
+    @Run(test = "umin_byte_masked_diff_mask_minmax")
+    public void umin_byte_masked_diff_mask_minmax_runner() {
+        for (int i = 0; i < bspec.loopBound(COUNT); i += bspec.length()) {
+            umin_byte_masked_diff_mask_minmax(i);
+        }
+        for (int i = 0; i < bspec.loopBound(COUNT); i++) {
+            byte a = byte_in1[i], b = byte_in2[i];
+            byte minAB = (byte)(m1arr[i] ? VectorMath.minUnsigned(a, b) : a);
+            byte maxAB = (byte)(m2arr[i] ? VectorMath.maxUnsigned(a, b) : a);
+            byte expected = (byte)(m1arr[i] ? VectorMath.minUnsigned(minAB, maxAB) : minAB);
+            Verify.checkEQ(byte_out[i], expected);
+        }
+    }
+
+    // Predicated Byte: umin(umin(a,b,m2), umax(a,b,m1), m1) => NO transform
+    @Test
+    @IR(counts = {IRNode.UMIN_VB, " 2 ", IRNode.UMAX_VB, " 1 "}, applyIfCPUFeatureOr = {"avx512bw", "true", "sve", "true"})
+    public void umin_byte_masked_diff_mask_minmax_swap(int index) {
+        ByteVector vec1 = ByteVector.fromArray(bspec, byte_in1, index);
+        ByteVector vec2 = ByteVector.fromArray(bspec, byte_in2, index);
+        VectorMask<Byte> mask1 = VectorMask.fromArray(bspec, m1arr, index);
+        VectorMask<Byte> mask2 = VectorMask.fromArray(bspec, m2arr, index);
+        vec1.lanewise(VectorOperators.UMIN, vec2, mask2)
+            .lanewise(VectorOperators.UMIN,
+                      vec1.lanewise(VectorOperators.UMAX, vec2, mask1), mask1)
+            .intoArray(byte_out, index);
+    }
+
+    @Run(test = "umin_byte_masked_diff_mask_minmax_swap")
+    public void umin_byte_masked_diff_mask_minmax_swap_runner() {
+        for (int i = 0; i < bspec.loopBound(COUNT); i += bspec.length()) {
+            umin_byte_masked_diff_mask_minmax_swap(i);
+        }
+        for (int i = 0; i < bspec.loopBound(COUNT); i++) {
+            byte a = byte_in1[i], b = byte_in2[i];
+            byte minAB = (byte)(m2arr[i] ? VectorMath.minUnsigned(a, b) : a);
+            byte maxAB = (byte)(m1arr[i] ? VectorMath.maxUnsigned(a, b) : a);
+            byte expected = (byte)(m1arr[i] ? VectorMath.minUnsigned(minAB, maxAB) : minAB);
+            Verify.checkEQ(byte_out[i], expected);
+        }
+    }
+
+    // Predicated Byte: umin(umin(a,b,m1), umax(a,b,m1), m2) => NO transform
+    @Test
+    @IR(counts = {IRNode.UMIN_VB, " 2 ", IRNode.UMAX_VB, " 1 "}, applyIfCPUFeatureOr = {"avx512bw", "true", "sve", "true"})
+    public void umin_byte_masked_diff_mask_outer(int index) {
+        ByteVector vec1 = ByteVector.fromArray(bspec, byte_in1, index);
+        ByteVector vec2 = ByteVector.fromArray(bspec, byte_in2, index);
+        VectorMask<Byte> mask1 = VectorMask.fromArray(bspec, m1arr, index);
+        VectorMask<Byte> mask2 = VectorMask.fromArray(bspec, m2arr, index);
+        vec1.lanewise(VectorOperators.UMIN, vec2, mask1)
+            .lanewise(VectorOperators.UMIN,
+                      vec1.lanewise(VectorOperators.UMAX, vec2, mask1), mask2)
+            .intoArray(byte_out, index);
+    }
+
+    @Run(test = "umin_byte_masked_diff_mask_outer")
+    public void umin_byte_masked_diff_mask_outer_runner() {
+        for (int i = 0; i < bspec.loopBound(COUNT); i += bspec.length()) {
+            umin_byte_masked_diff_mask_outer(i);
+        }
+        for (int i = 0; i < bspec.loopBound(COUNT); i++) {
+            byte a = byte_in1[i], b = byte_in2[i];
+            byte minAB = (byte)(m1arr[i] ? VectorMath.minUnsigned(a, b) : a);
+            byte maxAB = (byte)(m1arr[i] ? VectorMath.maxUnsigned(a, b) : a);
+            byte expected = (byte)(m2arr[i] ? VectorMath.minUnsigned(minAB, maxAB) : minAB);
+            Verify.checkEQ(byte_out[i], expected);
+        }
+    }
+
+    // Predicated Byte: umin(umin(a,b,m1), umax(a,b,m2), m3) => NO transform
+    @Test
+    @IR(counts = {IRNode.UMIN_VB, " 2 ", IRNode.UMAX_VB, " 1 "}, applyIfCPUFeatureOr = {"avx512bw", "true", "sve", "true"})
+    public void umin_byte_masked_all_diff_mask(int index) {
+        ByteVector vec1 = ByteVector.fromArray(bspec, byte_in1, index);
+        ByteVector vec2 = ByteVector.fromArray(bspec, byte_in2, index);
+        VectorMask<Byte> mask1 = VectorMask.fromArray(bspec, m1arr, index);
+        VectorMask<Byte> mask2 = VectorMask.fromArray(bspec, m2arr, index);
+        VectorMask<Byte> mask3 = VectorMask.fromArray(bspec, m3arr, index);
+        vec1.lanewise(VectorOperators.UMIN, vec2, mask1)
+            .lanewise(VectorOperators.UMIN,
+                      vec1.lanewise(VectorOperators.UMAX, vec2, mask2), mask3)
+            .intoArray(byte_out, index);
+    }
+
+    @Run(test = "umin_byte_masked_all_diff_mask")
+    public void umin_byte_masked_all_diff_mask_runner() {
+        for (int i = 0; i < bspec.loopBound(COUNT); i += bspec.length()) {
+            umin_byte_masked_all_diff_mask(i);
+        }
+        for (int i = 0; i < bspec.loopBound(COUNT); i++) {
+            byte a = byte_in1[i], b = byte_in2[i];
+            byte minAB = (byte)(m1arr[i] ? VectorMath.minUnsigned(a, b) : a);
+            byte maxAB = (byte)(m2arr[i] ? VectorMath.maxUnsigned(a, b) : a);
+            byte expected = (byte)(m3arr[i] ? VectorMath.minUnsigned(minAB, maxAB) : minAB);
+            Verify.checkEQ(byte_out[i], expected);
+        }
+    }
+
+    // Predicated Byte: umax(umin(a,b,m), umax(a,b,m), m) => umax(a,b,m)
+    @Test
+    @IR(counts = {IRNode.UMIN_VB, " 0 ", IRNode.UMAX_VB, " 1 "}, applyIfCPUFeatureOr = {"avx512bw", "true", "sve", "true"})
+    public void umax_byte_masked_same_mask(int index) {
+        ByteVector vec1 = ByteVector.fromArray(bspec, byte_in1, index);
+        ByteVector vec2 = ByteVector.fromArray(bspec, byte_in2, index);
+        VectorMask<Byte> m = VectorMask.fromArray(bspec, m1arr, index);
+        vec1.lanewise(VectorOperators.UMIN, vec2, m)
+            .lanewise(VectorOperators.UMAX,
+                      vec1.lanewise(VectorOperators.UMAX, vec2, m), m)
+            .intoArray(byte_out, index);
+    }
+
+    @Run(test = "umax_byte_masked_same_mask")
+    public void umax_byte_masked_same_mask_runner() {
+        for (int i = 0; i < bspec.loopBound(COUNT); i += bspec.length()) {
+            umax_byte_masked_same_mask(i);
+        }
+        for (int i = 0; i < bspec.loopBound(COUNT); i++) {
+            byte a = byte_in1[i], b = byte_in2[i];
+            byte minAB = (byte)(m1arr[i] ? VectorMath.minUnsigned(a, b) : a);
+            byte maxAB = (byte)(m1arr[i] ? VectorMath.maxUnsigned(a, b) : a);
+            byte expected = (byte)(m1arr[i] ? VectorMath.maxUnsigned(minAB, maxAB) : minAB);
+            Verify.checkEQ(byte_out[i], expected);
+        }
+    }
+
+    // Predicated Byte: umax(umin(a,b,m), umax(b,a,m), m) => umax(a,b,m)
+    @Test
+    @IR(counts = {IRNode.UMIN_VB, " 0 ", IRNode.UMAX_VB, " 1 "}, applyIfCPUFeatureOr = {"avx512bw", "true", "sve", "true"})
+    public void umax_byte_masked_flipped_inputs(int index) {
+        ByteVector vec1 = ByteVector.fromArray(bspec, byte_in1, index);
+        ByteVector vec2 = ByteVector.fromArray(bspec, byte_in2, index);
+        VectorMask<Byte> m = VectorMask.fromArray(bspec, m1arr, index);
+        vec1.lanewise(VectorOperators.UMIN, vec2, m)
+            .lanewise(VectorOperators.UMAX,
+                      vec2.lanewise(VectorOperators.UMAX, vec1, m), m)
+            .intoArray(byte_out, index);
+    }
+
+    @Run(test = "umax_byte_masked_flipped_inputs")
+    public void umax_byte_masked_flipped_inputs_runner() {
+        for (int i = 0; i < bspec.loopBound(COUNT); i += bspec.length()) {
+            umax_byte_masked_flipped_inputs(i);
+        }
+        for (int i = 0; i < bspec.loopBound(COUNT); i++) {
+            byte a = byte_in1[i], b = byte_in2[i];
+            byte minAB = (byte)(m1arr[i] ? VectorMath.minUnsigned(a, b) : a);
+            byte maxBA = (byte)(m1arr[i] ? VectorMath.maxUnsigned(b, a) : b);
+            byte expected = (byte)(m1arr[i] ? VectorMath.maxUnsigned(minAB, maxBA) : minAB);
+            Verify.checkEQ(byte_out[i], expected);
+        }
+    }
+
+    // Predicated Byte: umax(umin(a,b,m1), umax(a,b,m2), m1) => NO transform
+    @Test
+    @IR(counts = {IRNode.UMIN_VB, " 1 ", IRNode.UMAX_VB, " 2 "}, applyIfCPUFeatureOr = {"avx512bw", "true", "sve", "true"})
+    public void umax_byte_masked_diff_mask_minmax(int index) {
+        ByteVector vec1 = ByteVector.fromArray(bspec, byte_in1, index);
+        ByteVector vec2 = ByteVector.fromArray(bspec, byte_in2, index);
+        VectorMask<Byte> mask1 = VectorMask.fromArray(bspec, m1arr, index);
+        VectorMask<Byte> mask2 = VectorMask.fromArray(bspec, m2arr, index);
+        vec1.lanewise(VectorOperators.UMIN, vec2, mask1)
+            .lanewise(VectorOperators.UMAX,
+                      vec1.lanewise(VectorOperators.UMAX, vec2, mask2), mask1)
+            .intoArray(byte_out, index);
+    }
+
+    @Run(test = "umax_byte_masked_diff_mask_minmax")
+    public void umax_byte_masked_diff_mask_minmax_runner() {
+        for (int i = 0; i < bspec.loopBound(COUNT); i += bspec.length()) {
+            umax_byte_masked_diff_mask_minmax(i);
+        }
+        for (int i = 0; i < bspec.loopBound(COUNT); i++) {
+            byte a = byte_in1[i], b = byte_in2[i];
+            byte minAB = (byte)(m1arr[i] ? VectorMath.minUnsigned(a, b) : a);
+            byte maxAB = (byte)(m2arr[i] ? VectorMath.maxUnsigned(a, b) : a);
+            byte expected = (byte)(m1arr[i] ? VectorMath.maxUnsigned(minAB, maxAB) : minAB);
+            Verify.checkEQ(byte_out[i], expected);
+        }
+    }
+
+    // Predicated Byte: umax(umin(a,b,m2), umax(a,b,m1), m1) => NO transform
+    @Test
+    @IR(counts = {IRNode.UMIN_VB, " 1 ", IRNode.UMAX_VB, " 2 "}, applyIfCPUFeatureOr = {"avx512bw", "true", "sve", "true"})
+    public void umax_byte_masked_diff_mask_minmax_swap(int index) {
+        ByteVector vec1 = ByteVector.fromArray(bspec, byte_in1, index);
+        ByteVector vec2 = ByteVector.fromArray(bspec, byte_in2, index);
+        VectorMask<Byte> mask1 = VectorMask.fromArray(bspec, m1arr, index);
+        VectorMask<Byte> mask2 = VectorMask.fromArray(bspec, m2arr, index);
+        vec1.lanewise(VectorOperators.UMIN, vec2, mask2)
+            .lanewise(VectorOperators.UMAX,
+                      vec1.lanewise(VectorOperators.UMAX, vec2, mask1), mask1)
+            .intoArray(byte_out, index);
+    }
+
+    @Run(test = "umax_byte_masked_diff_mask_minmax_swap")
+    public void umax_byte_masked_diff_mask_minmax_swap_runner() {
+        for (int i = 0; i < bspec.loopBound(COUNT); i += bspec.length()) {
+            umax_byte_masked_diff_mask_minmax_swap(i);
+        }
+        for (int i = 0; i < bspec.loopBound(COUNT); i++) {
+            byte a = byte_in1[i], b = byte_in2[i];
+            byte minAB = (byte)(m2arr[i] ? VectorMath.minUnsigned(a, b) : a);
+            byte maxAB = (byte)(m1arr[i] ? VectorMath.maxUnsigned(a, b) : a);
+            byte expected = (byte)(m1arr[i] ? VectorMath.maxUnsigned(minAB, maxAB) : minAB);
+            Verify.checkEQ(byte_out[i], expected);
+        }
+    }
+
+    // Predicated Byte: umax(umin(a,b,m1), umax(a,b,m1), m2) => NO transform
+    @Test
+    @IR(counts = {IRNode.UMIN_VB, " 1 ", IRNode.UMAX_VB, " 2 "}, applyIfCPUFeatureOr = {"avx512bw", "true", "sve", "true"})
+    public void umax_byte_masked_diff_mask_outer(int index) {
+        ByteVector vec1 = ByteVector.fromArray(bspec, byte_in1, index);
+        ByteVector vec2 = ByteVector.fromArray(bspec, byte_in2, index);
+        VectorMask<Byte> mask1 = VectorMask.fromArray(bspec, m1arr, index);
+        VectorMask<Byte> mask2 = VectorMask.fromArray(bspec, m2arr, index);
+        vec1.lanewise(VectorOperators.UMIN, vec2, mask1)
+            .lanewise(VectorOperators.UMAX,
+                      vec1.lanewise(VectorOperators.UMAX, vec2, mask1), mask2)
+            .intoArray(byte_out, index);
+    }
+
+    @Run(test = "umax_byte_masked_diff_mask_outer")
+    public void umax_byte_masked_diff_mask_outer_runner() {
+        for (int i = 0; i < bspec.loopBound(COUNT); i += bspec.length()) {
+            umax_byte_masked_diff_mask_outer(i);
+        }
+        for (int i = 0; i < bspec.loopBound(COUNT); i++) {
+            byte a = byte_in1[i], b = byte_in2[i];
+            byte minAB = (byte)(m1arr[i] ? VectorMath.minUnsigned(a, b) : a);
+            byte maxAB = (byte)(m1arr[i] ? VectorMath.maxUnsigned(a, b) : a);
+            byte expected = (byte)(m2arr[i] ? VectorMath.maxUnsigned(minAB, maxAB) : minAB);
+            Verify.checkEQ(byte_out[i], expected);
+        }
+    }
+
+    // Predicated Byte: umax(umin(a,b,m1), umax(a,b,m2), m3) => NO transform
+    @Test
+    @IR(counts = {IRNode.UMIN_VB, " 1 ", IRNode.UMAX_VB, " 2 "}, applyIfCPUFeatureOr = {"avx512bw", "true", "sve", "true"})
+    public void umax_byte_masked_all_diff_mask(int index) {
+        ByteVector vec1 = ByteVector.fromArray(bspec, byte_in1, index);
+        ByteVector vec2 = ByteVector.fromArray(bspec, byte_in2, index);
+        VectorMask<Byte> mask1 = VectorMask.fromArray(bspec, m1arr, index);
+        VectorMask<Byte> mask2 = VectorMask.fromArray(bspec, m2arr, index);
+        VectorMask<Byte> mask3 = VectorMask.fromArray(bspec, m3arr, index);
+        vec1.lanewise(VectorOperators.UMIN, vec2, mask1)
+            .lanewise(VectorOperators.UMAX,
+                      vec1.lanewise(VectorOperators.UMAX, vec2, mask2), mask3)
+            .intoArray(byte_out, index);
+    }
+
+    @Run(test = "umax_byte_masked_all_diff_mask")
+    public void umax_byte_masked_all_diff_mask_runner() {
+        for (int i = 0; i < bspec.loopBound(COUNT); i += bspec.length()) {
+            umax_byte_masked_all_diff_mask(i);
+        }
+        for (int i = 0; i < bspec.loopBound(COUNT); i++) {
+            byte a = byte_in1[i], b = byte_in2[i];
+            byte minAB = (byte)(m1arr[i] ? VectorMath.minUnsigned(a, b) : a);
+            byte maxAB = (byte)(m2arr[i] ? VectorMath.maxUnsigned(a, b) : a);
+            byte expected = (byte)(m3arr[i] ? VectorMath.maxUnsigned(minAB, maxAB) : minAB);
+            Verify.checkEQ(byte_out[i], expected);
+        }
+    }
+
+    // Predicated Short: umin(umin(a,b,m), umax(a,b,m), m) => umin(a,b,m)
+    @Test
+    @IR(counts = {IRNode.UMIN_VS, " 1 ", IRNode.UMAX_VS, " 0 "}, applyIfCPUFeatureOr = {"avx512bw", "true", "sve", "true"})
+    public void umin_short_masked_same_mask(int index) {
+        ShortVector vec1 = ShortVector.fromArray(sspec, short_in1, index);
+        ShortVector vec2 = ShortVector.fromArray(sspec, short_in2, index);
+        VectorMask<Short> m = VectorMask.fromArray(sspec, m1arr, index);
+        vec1.lanewise(VectorOperators.UMIN, vec2, m)
+            .lanewise(VectorOperators.UMIN,
+                      vec1.lanewise(VectorOperators.UMAX, vec2, m), m)
+            .intoArray(short_out, index);
+    }
+
+    @Run(test = "umin_short_masked_same_mask")
+    public void umin_short_masked_same_mask_runner() {
+        for (int i = 0; i < sspec.loopBound(COUNT); i += sspec.length()) {
+            umin_short_masked_same_mask(i);
+        }
+        for (int i = 0; i < sspec.loopBound(COUNT); i++) {
+            short a = short_in1[i], b = short_in2[i];
+            short minAB = (short)(m1arr[i] ? VectorMath.minUnsigned(a, b) : a);
+            short maxAB = (short)(m1arr[i] ? VectorMath.maxUnsigned(a, b) : a);
+            short expected = (short)(m1arr[i] ? VectorMath.minUnsigned(minAB, maxAB) : minAB);
+            Verify.checkEQ(short_out[i], expected);
+        }
+    }
+
+    // Predicated Short: umin(umin(a,b,m), umax(b,a,m), m) => umin(a,b,m)
+    @Test
+    @IR(counts = {IRNode.UMIN_VS, " 1 ", IRNode.UMAX_VS, " 0 "}, applyIfCPUFeatureOr = {"avx512bw", "true", "sve", "true"})
+    public void umin_short_masked_flipped_inputs(int index) {
+        ShortVector vec1 = ShortVector.fromArray(sspec, short_in1, index);
+        ShortVector vec2 = ShortVector.fromArray(sspec, short_in2, index);
+        VectorMask<Short> m = VectorMask.fromArray(sspec, m1arr, index);
+        vec1.lanewise(VectorOperators.UMIN, vec2, m)
+            .lanewise(VectorOperators.UMIN,
+                      vec2.lanewise(VectorOperators.UMAX, vec1, m), m)
+            .intoArray(short_out, index);
+    }
+
+    @Run(test = "umin_short_masked_flipped_inputs")
+    public void umin_short_masked_flipped_inputs_runner() {
+        for (int i = 0; i < sspec.loopBound(COUNT); i += sspec.length()) {
+            umin_short_masked_flipped_inputs(i);
+        }
+        for (int i = 0; i < sspec.loopBound(COUNT); i++) {
+            short a = short_in1[i], b = short_in2[i];
+            short minAB = (short)(m1arr[i] ? VectorMath.minUnsigned(a, b) : a);
+            short maxBA = (short)(m1arr[i] ? VectorMath.maxUnsigned(b, a) : b);
+            short expected = (short)(m1arr[i] ? VectorMath.minUnsigned(minAB, maxBA) : minAB);
+            Verify.checkEQ(short_out[i], expected);
+        }
+    }
+
+    // Predicated Short: umin(umin(a,b,m1), umax(a,b,m2), m1) => NO transform
+    @Test
+    @IR(counts = {IRNode.UMIN_VS, " 2 ", IRNode.UMAX_VS, " 1 "}, applyIfCPUFeatureOr = {"avx512bw", "true", "sve", "true"})
+    public void umin_short_masked_diff_mask_minmax(int index) {
+        ShortVector vec1 = ShortVector.fromArray(sspec, short_in1, index);
+        ShortVector vec2 = ShortVector.fromArray(sspec, short_in2, index);
+        VectorMask<Short> mask1 = VectorMask.fromArray(sspec, m1arr, index);
+        VectorMask<Short> mask2 = VectorMask.fromArray(sspec, m2arr, index);
+        vec1.lanewise(VectorOperators.UMIN, vec2, mask1)
+            .lanewise(VectorOperators.UMIN,
+                      vec1.lanewise(VectorOperators.UMAX, vec2, mask2), mask1)
+            .intoArray(short_out, index);
+    }
+
+    @Run(test = "umin_short_masked_diff_mask_minmax")
+    public void umin_short_masked_diff_mask_minmax_runner() {
+        for (int i = 0; i < sspec.loopBound(COUNT); i += sspec.length()) {
+            umin_short_masked_diff_mask_minmax(i);
+        }
+        for (int i = 0; i < sspec.loopBound(COUNT); i++) {
+            short a = short_in1[i], b = short_in2[i];
+            short minAB = (short)(m1arr[i] ? VectorMath.minUnsigned(a, b) : a);
+            short maxAB = (short)(m2arr[i] ? VectorMath.maxUnsigned(a, b) : a);
+            short expected = (short)(m1arr[i] ? VectorMath.minUnsigned(minAB, maxAB) : minAB);
+            Verify.checkEQ(short_out[i], expected);
+        }
+    }
+
+    // Predicated Short: umin(umin(a,b,m2), umax(a,b,m1), m1) => NO transform
+    @Test
+    @IR(counts = {IRNode.UMIN_VS, " 2 ", IRNode.UMAX_VS, " 1 "}, applyIfCPUFeatureOr = {"avx512bw", "true", "sve", "true"})
+    public void umin_short_masked_diff_mask_minmax_swap(int index) {
+        ShortVector vec1 = ShortVector.fromArray(sspec, short_in1, index);
+        ShortVector vec2 = ShortVector.fromArray(sspec, short_in2, index);
+        VectorMask<Short> mask1 = VectorMask.fromArray(sspec, m1arr, index);
+        VectorMask<Short> mask2 = VectorMask.fromArray(sspec, m2arr, index);
+        vec1.lanewise(VectorOperators.UMIN, vec2, mask2)
+            .lanewise(VectorOperators.UMIN,
+                      vec1.lanewise(VectorOperators.UMAX, vec2, mask1), mask1)
+            .intoArray(short_out, index);
+    }
+
+    @Run(test = "umin_short_masked_diff_mask_minmax_swap")
+    public void umin_short_masked_diff_mask_minmax_swap_runner() {
+        for (int i = 0; i < sspec.loopBound(COUNT); i += sspec.length()) {
+            umin_short_masked_diff_mask_minmax_swap(i);
+        }
+        for (int i = 0; i < sspec.loopBound(COUNT); i++) {
+            short a = short_in1[i], b = short_in2[i];
+            short minAB = (short)(m2arr[i] ? VectorMath.minUnsigned(a, b) : a);
+            short maxAB = (short)(m1arr[i] ? VectorMath.maxUnsigned(a, b) : a);
+            short expected = (short)(m1arr[i] ? VectorMath.minUnsigned(minAB, maxAB) : minAB);
+            Verify.checkEQ(short_out[i], expected);
+        }
+    }
+
+    // Predicated Short: umin(umin(a,b,m1), umax(a,b,m1), m2) => NO transform
+    @Test
+    @IR(counts = {IRNode.UMIN_VS, " 2 ", IRNode.UMAX_VS, " 1 "}, applyIfCPUFeatureOr = {"avx512bw", "true", "sve", "true"})
+    public void umin_short_masked_diff_mask_outer(int index) {
+        ShortVector vec1 = ShortVector.fromArray(sspec, short_in1, index);
+        ShortVector vec2 = ShortVector.fromArray(sspec, short_in2, index);
+        VectorMask<Short> mask1 = VectorMask.fromArray(sspec, m1arr, index);
+        VectorMask<Short> mask2 = VectorMask.fromArray(sspec, m2arr, index);
+        vec1.lanewise(VectorOperators.UMIN, vec2, mask1)
+            .lanewise(VectorOperators.UMIN,
+                      vec1.lanewise(VectorOperators.UMAX, vec2, mask1), mask2)
+            .intoArray(short_out, index);
+    }
+
+    @Run(test = "umin_short_masked_diff_mask_outer")
+    public void umin_short_masked_diff_mask_outer_runner() {
+        for (int i = 0; i < sspec.loopBound(COUNT); i += sspec.length()) {
+            umin_short_masked_diff_mask_outer(i);
+        }
+        for (int i = 0; i < sspec.loopBound(COUNT); i++) {
+            short a = short_in1[i], b = short_in2[i];
+            short minAB = (short)(m1arr[i] ? VectorMath.minUnsigned(a, b) : a);
+            short maxAB = (short)(m1arr[i] ? VectorMath.maxUnsigned(a, b) : a);
+            short expected = (short)(m2arr[i] ? VectorMath.minUnsigned(minAB, maxAB) : minAB);
+            Verify.checkEQ(short_out[i], expected);
+        }
+    }
+
+    // Predicated Short: umin(umin(a,b,m1), umax(a,b,m2), m3) => NO transform
+    @Test
+    @IR(counts = {IRNode.UMIN_VS, " 2 ", IRNode.UMAX_VS, " 1 "}, applyIfCPUFeatureOr = {"avx512bw", "true", "sve", "true"})
+    public void umin_short_masked_all_diff_mask(int index) {
+        ShortVector vec1 = ShortVector.fromArray(sspec, short_in1, index);
+        ShortVector vec2 = ShortVector.fromArray(sspec, short_in2, index);
+        VectorMask<Short> mask1 = VectorMask.fromArray(sspec, m1arr, index);
+        VectorMask<Short> mask2 = VectorMask.fromArray(sspec, m2arr, index);
+        VectorMask<Short> mask3 = VectorMask.fromArray(sspec, m3arr, index);
+        vec1.lanewise(VectorOperators.UMIN, vec2, mask1)
+            .lanewise(VectorOperators.UMIN,
+                      vec1.lanewise(VectorOperators.UMAX, vec2, mask2), mask3)
+            .intoArray(short_out, index);
+    }
+
+    @Run(test = "umin_short_masked_all_diff_mask")
+    public void umin_short_masked_all_diff_mask_runner() {
+        for (int i = 0; i < sspec.loopBound(COUNT); i += sspec.length()) {
+            umin_short_masked_all_diff_mask(i);
+        }
+        for (int i = 0; i < sspec.loopBound(COUNT); i++) {
+            short a = short_in1[i], b = short_in2[i];
+            short minAB = (short)(m1arr[i] ? VectorMath.minUnsigned(a, b) : a);
+            short maxAB = (short)(m2arr[i] ? VectorMath.maxUnsigned(a, b) : a);
+            short expected = (short)(m3arr[i] ? VectorMath.minUnsigned(minAB, maxAB) : minAB);
+            Verify.checkEQ(short_out[i], expected);
+        }
+    }
+
+    // Predicated Short: umax(umin(a,b,m), umax(a,b,m), m) => umax(a,b,m)
+    @Test
+    @IR(counts = {IRNode.UMIN_VS, " 0 ", IRNode.UMAX_VS, " 1 "}, applyIfCPUFeatureOr = {"avx512bw", "true", "sve", "true"})
+    public void umax_short_masked_same_mask(int index) {
+        ShortVector vec1 = ShortVector.fromArray(sspec, short_in1, index);
+        ShortVector vec2 = ShortVector.fromArray(sspec, short_in2, index);
+        VectorMask<Short> m = VectorMask.fromArray(sspec, m1arr, index);
+        vec1.lanewise(VectorOperators.UMIN, vec2, m)
+            .lanewise(VectorOperators.UMAX,
+                      vec1.lanewise(VectorOperators.UMAX, vec2, m), m)
+            .intoArray(short_out, index);
+    }
+
+    @Run(test = "umax_short_masked_same_mask")
+    public void umax_short_masked_same_mask_runner() {
+        for (int i = 0; i < sspec.loopBound(COUNT); i += sspec.length()) {
+            umax_short_masked_same_mask(i);
+        }
+        for (int i = 0; i < sspec.loopBound(COUNT); i++) {
+            short a = short_in1[i], b = short_in2[i];
+            short minAB = (short)(m1arr[i] ? VectorMath.minUnsigned(a, b) : a);
+            short maxAB = (short)(m1arr[i] ? VectorMath.maxUnsigned(a, b) : a);
+            short expected = (short)(m1arr[i] ? VectorMath.maxUnsigned(minAB, maxAB) : minAB);
+            Verify.checkEQ(short_out[i], expected);
+        }
+    }
+
+    // Predicated Short: umax(umin(a,b,m), umax(b,a,m), m) => umax(a,b,m)
+    @Test
+    @IR(counts = {IRNode.UMIN_VS, " 0 ", IRNode.UMAX_VS, " 1 "}, applyIfCPUFeatureOr = {"avx512bw", "true", "sve", "true"})
+    public void umax_short_masked_flipped_inputs(int index) {
+        ShortVector vec1 = ShortVector.fromArray(sspec, short_in1, index);
+        ShortVector vec2 = ShortVector.fromArray(sspec, short_in2, index);
+        VectorMask<Short> m = VectorMask.fromArray(sspec, m1arr, index);
+        vec1.lanewise(VectorOperators.UMIN, vec2, m)
+            .lanewise(VectorOperators.UMAX,
+                      vec2.lanewise(VectorOperators.UMAX, vec1, m), m)
+            .intoArray(short_out, index);
+    }
+
+    @Run(test = "umax_short_masked_flipped_inputs")
+    public void umax_short_masked_flipped_inputs_runner() {
+        for (int i = 0; i < sspec.loopBound(COUNT); i += sspec.length()) {
+            umax_short_masked_flipped_inputs(i);
+        }
+        for (int i = 0; i < sspec.loopBound(COUNT); i++) {
+            short a = short_in1[i], b = short_in2[i];
+            short minAB = (short)(m1arr[i] ? VectorMath.minUnsigned(a, b) : a);
+            short maxBA = (short)(m1arr[i] ? VectorMath.maxUnsigned(b, a) : b);
+            short expected = (short)(m1arr[i] ? VectorMath.maxUnsigned(minAB, maxBA) : minAB);
+            Verify.checkEQ(short_out[i], expected);
+        }
+    }
+
+    // Predicated Short: umax(umin(a,b,m1), umax(a,b,m2), m1) => NO transform
+    @Test
+    @IR(counts = {IRNode.UMIN_VS, " 1 ", IRNode.UMAX_VS, " 2 "}, applyIfCPUFeatureOr = {"avx512bw", "true", "sve", "true"})
+    public void umax_short_masked_diff_mask_minmax(int index) {
+        ShortVector vec1 = ShortVector.fromArray(sspec, short_in1, index);
+        ShortVector vec2 = ShortVector.fromArray(sspec, short_in2, index);
+        VectorMask<Short> mask1 = VectorMask.fromArray(sspec, m1arr, index);
+        VectorMask<Short> mask2 = VectorMask.fromArray(sspec, m2arr, index);
+        vec1.lanewise(VectorOperators.UMIN, vec2, mask1)
+            .lanewise(VectorOperators.UMAX,
+                      vec1.lanewise(VectorOperators.UMAX, vec2, mask2), mask1)
+            .intoArray(short_out, index);
+    }
+
+    @Run(test = "umax_short_masked_diff_mask_minmax")
+    public void umax_short_masked_diff_mask_minmax_runner() {
+        for (int i = 0; i < sspec.loopBound(COUNT); i += sspec.length()) {
+            umax_short_masked_diff_mask_minmax(i);
+        }
+        for (int i = 0; i < sspec.loopBound(COUNT); i++) {
+            short a = short_in1[i], b = short_in2[i];
+            short minAB = (short)(m1arr[i] ? VectorMath.minUnsigned(a, b) : a);
+            short maxAB = (short)(m2arr[i] ? VectorMath.maxUnsigned(a, b) : a);
+            short expected = (short)(m1arr[i] ? VectorMath.maxUnsigned(minAB, maxAB) : minAB);
+            Verify.checkEQ(short_out[i], expected);
+        }
+    }
+
+    // Predicated Short: umax(umin(a,b,m2), umax(a,b,m1), m1) => NO transform
+    @Test
+    @IR(counts = {IRNode.UMIN_VS, " 1 ", IRNode.UMAX_VS, " 2 "}, applyIfCPUFeatureOr = {"avx512bw", "true", "sve", "true"})
+    public void umax_short_masked_diff_mask_minmax_swap(int index) {
+        ShortVector vec1 = ShortVector.fromArray(sspec, short_in1, index);
+        ShortVector vec2 = ShortVector.fromArray(sspec, short_in2, index);
+        VectorMask<Short> mask1 = VectorMask.fromArray(sspec, m1arr, index);
+        VectorMask<Short> mask2 = VectorMask.fromArray(sspec, m2arr, index);
+        vec1.lanewise(VectorOperators.UMIN, vec2, mask2)
+            .lanewise(VectorOperators.UMAX,
+                      vec1.lanewise(VectorOperators.UMAX, vec2, mask1), mask1)
+            .intoArray(short_out, index);
+    }
+
+    @Run(test = "umax_short_masked_diff_mask_minmax_swap")
+    public void umax_short_masked_diff_mask_minmax_swap_runner() {
+        for (int i = 0; i < sspec.loopBound(COUNT); i += sspec.length()) {
+            umax_short_masked_diff_mask_minmax_swap(i);
+        }
+        for (int i = 0; i < sspec.loopBound(COUNT); i++) {
+            short a = short_in1[i], b = short_in2[i];
+            short minAB = (short)(m2arr[i] ? VectorMath.minUnsigned(a, b) : a);
+            short maxAB = (short)(m1arr[i] ? VectorMath.maxUnsigned(a, b) : a);
+            short expected = (short)(m1arr[i] ? VectorMath.maxUnsigned(minAB, maxAB) : minAB);
+            Verify.checkEQ(short_out[i], expected);
+        }
+    }
+
+    // Predicated Short: umax(umin(a,b,m1), umax(a,b,m1), m2) => NO transform
+    @Test
+    @IR(counts = {IRNode.UMIN_VS, " 1 ", IRNode.UMAX_VS, " 2 "}, applyIfCPUFeatureOr = {"avx512bw", "true", "sve", "true"})
+    public void umax_short_masked_diff_mask_outer(int index) {
+        ShortVector vec1 = ShortVector.fromArray(sspec, short_in1, index);
+        ShortVector vec2 = ShortVector.fromArray(sspec, short_in2, index);
+        VectorMask<Short> mask1 = VectorMask.fromArray(sspec, m1arr, index);
+        VectorMask<Short> mask2 = VectorMask.fromArray(sspec, m2arr, index);
+        vec1.lanewise(VectorOperators.UMIN, vec2, mask1)
+            .lanewise(VectorOperators.UMAX,
+                      vec1.lanewise(VectorOperators.UMAX, vec2, mask1), mask2)
+            .intoArray(short_out, index);
+    }
+
+    @Run(test = "umax_short_masked_diff_mask_outer")
+    public void umax_short_masked_diff_mask_outer_runner() {
+        for (int i = 0; i < sspec.loopBound(COUNT); i += sspec.length()) {
+            umax_short_masked_diff_mask_outer(i);
+        }
+        for (int i = 0; i < sspec.loopBound(COUNT); i++) {
+            short a = short_in1[i], b = short_in2[i];
+            short minAB = (short)(m1arr[i] ? VectorMath.minUnsigned(a, b) : a);
+            short maxAB = (short)(m1arr[i] ? VectorMath.maxUnsigned(a, b) : a);
+            short expected = (short)(m2arr[i] ? VectorMath.maxUnsigned(minAB, maxAB) : minAB);
+            Verify.checkEQ(short_out[i], expected);
+        }
+    }
+
+    // Predicated Short: umax(umin(a,b,m1), umax(a,b,m2), m3) => NO transform
+    @Test
+    @IR(counts = {IRNode.UMIN_VS, " 1 ", IRNode.UMAX_VS, " 2 "}, applyIfCPUFeatureOr = {"avx512bw", "true", "sve", "true"})
+    public void umax_short_masked_all_diff_mask(int index) {
+        ShortVector vec1 = ShortVector.fromArray(sspec, short_in1, index);
+        ShortVector vec2 = ShortVector.fromArray(sspec, short_in2, index);
+        VectorMask<Short> mask1 = VectorMask.fromArray(sspec, m1arr, index);
+        VectorMask<Short> mask2 = VectorMask.fromArray(sspec, m2arr, index);
+        VectorMask<Short> mask3 = VectorMask.fromArray(sspec, m3arr, index);
+        vec1.lanewise(VectorOperators.UMIN, vec2, mask1)
+            .lanewise(VectorOperators.UMAX,
+                      vec1.lanewise(VectorOperators.UMAX, vec2, mask2), mask3)
+            .intoArray(short_out, index);
+    }
+
+    @Run(test = "umax_short_masked_all_diff_mask")
+    public void umax_short_masked_all_diff_mask_runner() {
+        for (int i = 0; i < sspec.loopBound(COUNT); i += sspec.length()) {
+            umax_short_masked_all_diff_mask(i);
+        }
+        for (int i = 0; i < sspec.loopBound(COUNT); i++) {
+            short a = short_in1[i], b = short_in2[i];
+            short minAB = (short)(m1arr[i] ? VectorMath.minUnsigned(a, b) : a);
+            short maxAB = (short)(m2arr[i] ? VectorMath.maxUnsigned(a, b) : a);
+            short expected = (short)(m3arr[i] ? VectorMath.maxUnsigned(minAB, maxAB) : minAB);
+            Verify.checkEQ(short_out[i], expected);
+        }
+    }
+
+    // Predicated Long: umin(umin(a,b,m), umax(a,b,m), m) => umin(a,b,m)
+    @Test
+    @IR(counts = {IRNode.UMIN_VL, " 1 ", IRNode.UMAX_VL, " 0 "}, applyIfCPUFeatureOr = {"avx512f", "true", "sve", "true"})
+    public void umin_long_masked_same_mask(int index) {
+        LongVector vec1 = LongVector.fromArray(lspec, long_in1, index);
+        LongVector vec2 = LongVector.fromArray(lspec, long_in2, index);
+        VectorMask<Long> m = VectorMask.fromArray(lspec, m1arr, index);
+        vec1.lanewise(VectorOperators.UMIN, vec2, m)
+            .lanewise(VectorOperators.UMIN,
+                      vec1.lanewise(VectorOperators.UMAX, vec2, m), m)
+            .intoArray(long_out, index);
+    }
+
+    @Run(test = "umin_long_masked_same_mask")
+    public void umin_long_masked_same_mask_runner() {
+        for (int i = 0; i < lspec.loopBound(COUNT); i += lspec.length()) {
+            umin_long_masked_same_mask(i);
+        }
+        for (int i = 0; i < lspec.loopBound(COUNT); i++) {
+            long a = long_in1[i], b = long_in2[i];
+            long minAB = m1arr[i] ? VectorMath.minUnsigned(a, b) : a;
+            long maxAB = m1arr[i] ? VectorMath.maxUnsigned(a, b) : a;
+            long expected = m1arr[i] ? VectorMath.minUnsigned(minAB, maxAB) : minAB;
+            Verify.checkEQ(long_out[i], expected);
+        }
+    }
+
+    // Predicated Long: umin(umin(a,b,m), umax(b,a,m), m) => umin(a,b,m)
+    @Test
+    @IR(counts = {IRNode.UMIN_VL, " 1 ", IRNode.UMAX_VL, " 0 "}, applyIfCPUFeatureOr = {"avx512f", "true", "sve", "true"})
+    public void umin_long_masked_flipped_inputs(int index) {
+        LongVector vec1 = LongVector.fromArray(lspec, long_in1, index);
+        LongVector vec2 = LongVector.fromArray(lspec, long_in2, index);
+        VectorMask<Long> m = VectorMask.fromArray(lspec, m1arr, index);
+        vec1.lanewise(VectorOperators.UMIN, vec2, m)
+            .lanewise(VectorOperators.UMIN,
+                      vec2.lanewise(VectorOperators.UMAX, vec1, m), m)
+            .intoArray(long_out, index);
+    }
+
+    @Run(test = "umin_long_masked_flipped_inputs")
+    public void umin_long_masked_flipped_inputs_runner() {
+        for (int i = 0; i < lspec.loopBound(COUNT); i += lspec.length()) {
+            umin_long_masked_flipped_inputs(i);
+        }
+        for (int i = 0; i < lspec.loopBound(COUNT); i++) {
+            long a = long_in1[i], b = long_in2[i];
+            long minAB = m1arr[i] ? VectorMath.minUnsigned(a, b) : a;
+            long maxBA = m1arr[i] ? VectorMath.maxUnsigned(b, a) : b;
+            long expected = m1arr[i] ? VectorMath.minUnsigned(minAB, maxBA) : minAB;
+            Verify.checkEQ(long_out[i], expected);
+        }
+    }
+
+    // Predicated Long: umin(umin(a,b,m1), umax(a,b,m2), m1) => NO transform
+    @Test
+    @IR(counts = {IRNode.UMIN_VL, " 2 ", IRNode.UMAX_VL, " 1 "}, applyIfCPUFeatureOr = {"avx512f", "true", "sve", "true"})
+    public void umin_long_masked_diff_mask_minmax(int index) {
+        LongVector vec1 = LongVector.fromArray(lspec, long_in1, index);
+        LongVector vec2 = LongVector.fromArray(lspec, long_in2, index);
+        VectorMask<Long> mask1 = VectorMask.fromArray(lspec, m1arr, index);
+        VectorMask<Long> mask2 = VectorMask.fromArray(lspec, m2arr, index);
+        vec1.lanewise(VectorOperators.UMIN, vec2, mask1)
+            .lanewise(VectorOperators.UMIN,
+                      vec1.lanewise(VectorOperators.UMAX, vec2, mask2), mask1)
+            .intoArray(long_out, index);
+    }
+
+    @Run(test = "umin_long_masked_diff_mask_minmax")
+    public void umin_long_masked_diff_mask_minmax_runner() {
+        for (int i = 0; i < lspec.loopBound(COUNT); i += lspec.length()) {
+            umin_long_masked_diff_mask_minmax(i);
+        }
+        for (int i = 0; i < lspec.loopBound(COUNT); i++) {
+            long a = long_in1[i], b = long_in2[i];
+            long minAB = m1arr[i] ? VectorMath.minUnsigned(a, b) : a;
+            long maxAB = m2arr[i] ? VectorMath.maxUnsigned(a, b) : a;
+            long expected = m1arr[i] ? VectorMath.minUnsigned(minAB, maxAB) : minAB;
+            Verify.checkEQ(long_out[i], expected);
+        }
+    }
+
+    // Predicated Long: umin(umin(a,b,m2), umax(a,b,m1), m1) => NO transform
+    @Test
+    @IR(counts = {IRNode.UMIN_VL, " 2 ", IRNode.UMAX_VL, " 1 "}, applyIfCPUFeatureOr = {"avx512f", "true", "sve", "true"})
+    public void umin_long_masked_diff_mask_minmax_swap(int index) {
+        LongVector vec1 = LongVector.fromArray(lspec, long_in1, index);
+        LongVector vec2 = LongVector.fromArray(lspec, long_in2, index);
+        VectorMask<Long> mask1 = VectorMask.fromArray(lspec, m1arr, index);
+        VectorMask<Long> mask2 = VectorMask.fromArray(lspec, m2arr, index);
+        vec1.lanewise(VectorOperators.UMIN, vec2, mask2)
+            .lanewise(VectorOperators.UMIN,
+                      vec1.lanewise(VectorOperators.UMAX, vec2, mask1), mask1)
+            .intoArray(long_out, index);
+    }
+
+    @Run(test = "umin_long_masked_diff_mask_minmax_swap")
+    public void umin_long_masked_diff_mask_minmax_swap_runner() {
+        for (int i = 0; i < lspec.loopBound(COUNT); i += lspec.length()) {
+            umin_long_masked_diff_mask_minmax_swap(i);
+        }
+        for (int i = 0; i < lspec.loopBound(COUNT); i++) {
+            long a = long_in1[i], b = long_in2[i];
+            long minAB = m2arr[i] ? VectorMath.minUnsigned(a, b) : a;
+            long maxAB = m1arr[i] ? VectorMath.maxUnsigned(a, b) : a;
+            long expected = m1arr[i] ? VectorMath.minUnsigned(minAB, maxAB) : minAB;
+            Verify.checkEQ(long_out[i], expected);
+        }
+    }
+
+    // Predicated Long: umin(umin(a,b,m1), umax(a,b,m1), m2) => NO transform
+    @Test
+    @IR(counts = {IRNode.UMIN_VL, " 2 ", IRNode.UMAX_VL, " 1 "}, applyIfCPUFeatureOr = {"avx512f", "true", "sve", "true"})
+    public void umin_long_masked_diff_mask_outer(int index) {
+        LongVector vec1 = LongVector.fromArray(lspec, long_in1, index);
+        LongVector vec2 = LongVector.fromArray(lspec, long_in2, index);
+        VectorMask<Long> mask1 = VectorMask.fromArray(lspec, m1arr, index);
+        VectorMask<Long> mask2 = VectorMask.fromArray(lspec, m2arr, index);
+        vec1.lanewise(VectorOperators.UMIN, vec2, mask1)
+            .lanewise(VectorOperators.UMIN,
+                      vec1.lanewise(VectorOperators.UMAX, vec2, mask1), mask2)
+            .intoArray(long_out, index);
+    }
+
+    @Run(test = "umin_long_masked_diff_mask_outer")
+    public void umin_long_masked_diff_mask_outer_runner() {
+        for (int i = 0; i < lspec.loopBound(COUNT); i += lspec.length()) {
+            umin_long_masked_diff_mask_outer(i);
+        }
+        for (int i = 0; i < lspec.loopBound(COUNT); i++) {
+            long a = long_in1[i], b = long_in2[i];
+            long minAB = m1arr[i] ? VectorMath.minUnsigned(a, b) : a;
+            long maxAB = m1arr[i] ? VectorMath.maxUnsigned(a, b) : a;
+            long expected = m2arr[i] ? VectorMath.minUnsigned(minAB, maxAB) : minAB;
+            Verify.checkEQ(long_out[i], expected);
+        }
+    }
+
+    // Predicated Long: umin(umin(a,b,m1), umax(a,b,m2), m3) => NO transform
+    @Test
+    @IR(counts = {IRNode.UMIN_VL, " 2 ", IRNode.UMAX_VL, " 1 "}, applyIfCPUFeatureOr = {"avx512f", "true", "sve", "true"})
+    public void umin_long_masked_all_diff_mask(int index) {
+        LongVector vec1 = LongVector.fromArray(lspec, long_in1, index);
+        LongVector vec2 = LongVector.fromArray(lspec, long_in2, index);
+        VectorMask<Long> mask1 = VectorMask.fromArray(lspec, m1arr, index);
+        VectorMask<Long> mask2 = VectorMask.fromArray(lspec, m2arr, index);
+        VectorMask<Long> mask3 = VectorMask.fromArray(lspec, m3arr, index);
+        vec1.lanewise(VectorOperators.UMIN, vec2, mask1)
+            .lanewise(VectorOperators.UMIN,
+                      vec1.lanewise(VectorOperators.UMAX, vec2, mask2), mask3)
+            .intoArray(long_out, index);
+    }
+
+    @Run(test = "umin_long_masked_all_diff_mask")
+    public void umin_long_masked_all_diff_mask_runner() {
+        for (int i = 0; i < lspec.loopBound(COUNT); i += lspec.length()) {
+            umin_long_masked_all_diff_mask(i);
+        }
+        for (int i = 0; i < lspec.loopBound(COUNT); i++) {
+            long a = long_in1[i], b = long_in2[i];
+            long minAB = m1arr[i] ? VectorMath.minUnsigned(a, b) : a;
+            long maxAB = m2arr[i] ? VectorMath.maxUnsigned(a, b) : a;
+            long expected = m3arr[i] ? VectorMath.minUnsigned(minAB, maxAB) : minAB;
+            Verify.checkEQ(long_out[i], expected);
+        }
+    }
+
+    // Predicated Long: umax(umin(a,b,m), umax(a,b,m), m) => umax(a,b,m)
+    @Test
+    @IR(counts = {IRNode.UMIN_VL, " 0 ", IRNode.UMAX_VL, " 1 "}, applyIfCPUFeatureOr = {"avx512f", "true", "sve", "true"})
+    public void umax_long_masked_same_mask(int index) {
+        LongVector vec1 = LongVector.fromArray(lspec, long_in1, index);
+        LongVector vec2 = LongVector.fromArray(lspec, long_in2, index);
+        VectorMask<Long> m = VectorMask.fromArray(lspec, m1arr, index);
+        vec1.lanewise(VectorOperators.UMIN, vec2, m)
+            .lanewise(VectorOperators.UMAX,
+                      vec1.lanewise(VectorOperators.UMAX, vec2, m), m)
+            .intoArray(long_out, index);
+    }
+
+    @Run(test = "umax_long_masked_same_mask")
+    public void umax_long_masked_same_mask_runner() {
+        for (int i = 0; i < lspec.loopBound(COUNT); i += lspec.length()) {
+            umax_long_masked_same_mask(i);
+        }
+        for (int i = 0; i < lspec.loopBound(COUNT); i++) {
+            long a = long_in1[i], b = long_in2[i];
+            long minAB = m1arr[i] ? VectorMath.minUnsigned(a, b) : a;
+            long maxAB = m1arr[i] ? VectorMath.maxUnsigned(a, b) : a;
+            long expected = m1arr[i] ? VectorMath.maxUnsigned(minAB, maxAB) : minAB;
+            Verify.checkEQ(long_out[i], expected);
+        }
+    }
+
+    // Predicated Long: umax(umin(a,b,m), umax(b,a,m), m) => umax(a,b,m)
+    @Test
+    @IR(counts = {IRNode.UMIN_VL, " 0 ", IRNode.UMAX_VL, " 1 "}, applyIfCPUFeatureOr = {"avx512f", "true", "sve", "true"})
+    public void umax_long_masked_flipped_inputs(int index) {
+        LongVector vec1 = LongVector.fromArray(lspec, long_in1, index);
+        LongVector vec2 = LongVector.fromArray(lspec, long_in2, index);
+        VectorMask<Long> m = VectorMask.fromArray(lspec, m1arr, index);
+        vec1.lanewise(VectorOperators.UMIN, vec2, m)
+            .lanewise(VectorOperators.UMAX,
+                      vec2.lanewise(VectorOperators.UMAX, vec1, m), m)
+            .intoArray(long_out, index);
+    }
+
+    @Run(test = "umax_long_masked_flipped_inputs")
+    public void umax_long_masked_flipped_inputs_runner() {
+        for (int i = 0; i < lspec.loopBound(COUNT); i += lspec.length()) {
+            umax_long_masked_flipped_inputs(i);
+        }
+        for (int i = 0; i < lspec.loopBound(COUNT); i++) {
+            long a = long_in1[i], b = long_in2[i];
+            long minAB = m1arr[i] ? VectorMath.minUnsigned(a, b) : a;
+            long maxBA = m1arr[i] ? VectorMath.maxUnsigned(b, a) : b;
+            long expected = m1arr[i] ? VectorMath.maxUnsigned(minAB, maxBA) : minAB;
+            Verify.checkEQ(long_out[i], expected);
+        }
+    }
+
+    // Predicated Long: umax(umin(a,b,m1), umax(a,b,m2), m1) => NO transform
+    @Test
+    @IR(counts = {IRNode.UMIN_VL, " 1 ", IRNode.UMAX_VL, " 2 "}, applyIfCPUFeatureOr = {"avx512f", "true", "sve", "true"})
+    public void umax_long_masked_diff_mask_minmax(int index) {
+        LongVector vec1 = LongVector.fromArray(lspec, long_in1, index);
+        LongVector vec2 = LongVector.fromArray(lspec, long_in2, index);
+        VectorMask<Long> mask1 = VectorMask.fromArray(lspec, m1arr, index);
+        VectorMask<Long> mask2 = VectorMask.fromArray(lspec, m2arr, index);
+        vec1.lanewise(VectorOperators.UMIN, vec2, mask1)
+            .lanewise(VectorOperators.UMAX,
+                      vec1.lanewise(VectorOperators.UMAX, vec2, mask2), mask1)
+            .intoArray(long_out, index);
+    }
+
+    @Run(test = "umax_long_masked_diff_mask_minmax")
+    public void umax_long_masked_diff_mask_minmax_runner() {
+        for (int i = 0; i < lspec.loopBound(COUNT); i += lspec.length()) {
+            umax_long_masked_diff_mask_minmax(i);
+        }
+        for (int i = 0; i < lspec.loopBound(COUNT); i++) {
+            long a = long_in1[i], b = long_in2[i];
+            long minAB = m1arr[i] ? VectorMath.minUnsigned(a, b) : a;
+            long maxAB = m2arr[i] ? VectorMath.maxUnsigned(a, b) : a;
+            long expected = m1arr[i] ? VectorMath.maxUnsigned(minAB, maxAB) : minAB;
+            Verify.checkEQ(long_out[i], expected);
+        }
+    }
+
+    // Predicated Long: umax(umin(a,b,m2), umax(a,b,m1), m1) => NO transform
+    @Test
+    @IR(counts = {IRNode.UMIN_VL, " 1 ", IRNode.UMAX_VL, " 2 "}, applyIfCPUFeatureOr = {"avx512f", "true", "sve", "true"})
+    public void umax_long_masked_diff_mask_minmax_swap(int index) {
+        LongVector vec1 = LongVector.fromArray(lspec, long_in1, index);
+        LongVector vec2 = LongVector.fromArray(lspec, long_in2, index);
+        VectorMask<Long> mask1 = VectorMask.fromArray(lspec, m1arr, index);
+        VectorMask<Long> mask2 = VectorMask.fromArray(lspec, m2arr, index);
+        vec1.lanewise(VectorOperators.UMIN, vec2, mask2)
+            .lanewise(VectorOperators.UMAX,
+                      vec1.lanewise(VectorOperators.UMAX, vec2, mask1), mask1)
+            .intoArray(long_out, index);
+    }
+
+    @Run(test = "umax_long_masked_diff_mask_minmax_swap")
+    public void umax_long_masked_diff_mask_minmax_swap_runner() {
+        for (int i = 0; i < lspec.loopBound(COUNT); i += lspec.length()) {
+            umax_long_masked_diff_mask_minmax_swap(i);
+        }
+        for (int i = 0; i < lspec.loopBound(COUNT); i++) {
+            long a = long_in1[i], b = long_in2[i];
+            long minAB = m2arr[i] ? VectorMath.minUnsigned(a, b) : a;
+            long maxAB = m1arr[i] ? VectorMath.maxUnsigned(a, b) : a;
+            long expected = m1arr[i] ? VectorMath.maxUnsigned(minAB, maxAB) : minAB;
+            Verify.checkEQ(long_out[i], expected);
+        }
+    }
+
+    // Predicated Long: umax(umin(a,b,m1), umax(a,b,m1), m2) => NO transform
+    @Test
+    @IR(counts = {IRNode.UMIN_VL, " 1 ", IRNode.UMAX_VL, " 2 "}, applyIfCPUFeatureOr = {"avx512f", "true", "sve", "true"})
+    public void umax_long_masked_diff_mask_outer(int index) {
+        LongVector vec1 = LongVector.fromArray(lspec, long_in1, index);
+        LongVector vec2 = LongVector.fromArray(lspec, long_in2, index);
+        VectorMask<Long> mask1 = VectorMask.fromArray(lspec, m1arr, index);
+        VectorMask<Long> mask2 = VectorMask.fromArray(lspec, m2arr, index);
+        vec1.lanewise(VectorOperators.UMIN, vec2, mask1)
+            .lanewise(VectorOperators.UMAX,
+                      vec1.lanewise(VectorOperators.UMAX, vec2, mask1), mask2)
+            .intoArray(long_out, index);
+    }
+
+    @Run(test = "umax_long_masked_diff_mask_outer")
+    public void umax_long_masked_diff_mask_outer_runner() {
+        for (int i = 0; i < lspec.loopBound(COUNT); i += lspec.length()) {
+            umax_long_masked_diff_mask_outer(i);
+        }
+        for (int i = 0; i < lspec.loopBound(COUNT); i++) {
+            long a = long_in1[i], b = long_in2[i];
+            long minAB = m1arr[i] ? VectorMath.minUnsigned(a, b) : a;
+            long maxAB = m1arr[i] ? VectorMath.maxUnsigned(a, b) : a;
+            long expected = m2arr[i] ? VectorMath.maxUnsigned(minAB, maxAB) : minAB;
+            Verify.checkEQ(long_out[i], expected);
+        }
+    }
+
+    // Predicated Long: umax(umin(a,b,m1), umax(a,b,m2), m3) => NO transform
+    @Test
+    @IR(counts = {IRNode.UMIN_VL, " 1 ", IRNode.UMAX_VL, " 2 "}, applyIfCPUFeatureOr = {"avx512f", "true", "sve", "true"})
+    public void umax_long_masked_all_diff_mask(int index) {
+        LongVector vec1 = LongVector.fromArray(lspec, long_in1, index);
+        LongVector vec2 = LongVector.fromArray(lspec, long_in2, index);
+        VectorMask<Long> mask1 = VectorMask.fromArray(lspec, m1arr, index);
+        VectorMask<Long> mask2 = VectorMask.fromArray(lspec, m2arr, index);
+        VectorMask<Long> mask3 = VectorMask.fromArray(lspec, m3arr, index);
+        vec1.lanewise(VectorOperators.UMIN, vec2, mask1)
+            .lanewise(VectorOperators.UMAX,
+                      vec1.lanewise(VectorOperators.UMAX, vec2, mask2), mask3)
+            .intoArray(long_out, index);
+    }
+
+    @Run(test = "umax_long_masked_all_diff_mask")
+    public void umax_long_masked_all_diff_mask_runner() {
+        for (int i = 0; i < lspec.loopBound(COUNT); i += lspec.length()) {
+            umax_long_masked_all_diff_mask(i);
+        }
+        for (int i = 0; i < lspec.loopBound(COUNT); i++) {
+            long a = long_in1[i], b = long_in2[i];
+            long minAB = m1arr[i] ? VectorMath.minUnsigned(a, b) : a;
+            long maxAB = m2arr[i] ? VectorMath.maxUnsigned(a, b) : a;
+            long expected = m3arr[i] ? VectorMath.maxUnsigned(minAB, maxAB) : minAB;
+            Verify.checkEQ(long_out[i], expected);
+        }
+    }
+}

From 0a6775a4dcae5f92e116e22399d0ec31dd2b8e41 Mon Sep 17 00:00:00 2001
From: Amit Kumar <amitkumar@openjdk.org>
Date: Wed, 15 Apr 2026 04:38:38 +0000
Subject: [PATCH 600/655] 8381787: Add testcase for Vector Lane Reversal issue

Reviewed-by: mdoerr, varadam
---
 .../vector/TestLongVectorReinterpret.java     | 84 +++++++++++++++++++
 1 file changed, 84 insertions(+)
 create mode 100644 test/jdk/jdk/incubator/vector/TestLongVectorReinterpret.java

diff --git a/test/jdk/jdk/incubator/vector/TestLongVectorReinterpret.java b/test/jdk/jdk/incubator/vector/TestLongVectorReinterpret.java
new file mode 100644
index 00000000000..3d51031840c
--- /dev/null
+++ b/test/jdk/jdk/incubator/vector/TestLongVectorReinterpret.java
@@ -0,0 +1,84 @@
+/*
+ * Copyright (c) 2026 IBM Corp. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+/*
+ * @test
+ * @bug 8371187
+ * @summary Randomized test for lane swapping issue in LongVector reinterpretation on BE platforms
+ * @modules jdk.incubator.vector
+ * @run main/othervm --add-modules=jdk.incubator.vector TestLongVectorReinterpret
+ */
+
+import jdk.incubator.vector.*;
+import java.util.SplittableRandom;
+
+public class TestLongVectorReinterpret {
+
+    static final VectorSpecies<Long> SPECIES = LongVector.SPECIES_128;
+    static final SplittableRandom RAND = new SplittableRandom(42);
+
+    public static void main(String[] args) {
+        for (int iter = 0; iter < 1000; iter++) {
+            verifyLaneOrdering();
+        }
+    }
+
+    static void verifyLaneOrdering() {
+        long[] a = new long[SPECIES.length()];
+        long[] b = new long[SPECIES.length()];
+
+        for (int i = 0; i < a.length; i++) {
+            a[i] = RAND.nextLong();
+            b[i] = RAND.nextLong();
+        }
+
+        LongVector v1 = LongVector.fromArray(SPECIES, a, 0);
+        LongVector v2 = LongVector.fromArray(SPECIES, b, 0);
+
+        IntVector result = v2.reinterpretAsInts().add(v1.reinterpretAsInts());
+
+        int[] expected = new int[SPECIES.length() * 2];
+
+        for (int i = 0; i < a.length; i++) {
+            int loA = (int) a[i];
+            int hiA = (int) (a[i] >>> 32);
+
+            int loB = (int) b[i];
+            int hiB = (int) (b[i] >>> 32);
+
+            expected[2 * i]     = loA + loB;
+            expected[2 * i + 1] = hiA + hiB;
+        }
+
+        for (int i = 0; i < expected.length; i++) {
+            int actual = result.lane(i);
+            if (actual != expected[i]) {
+                throw new AssertionError(
+                    "Mismatch at lane " + i +
+                    " expected=" + expected[i] +
+                    " actual=" + actual +
+                    " vector=" + result);
+            }
+        }
+    }
+}

From 29024c253e3970a2f32a2573936bb85b0eabdbcc Mon Sep 17 00:00:00 2001
From: David Holmes <dholmes@openjdk.org>
Date: Wed, 15 Apr 2026 05:27:03 +0000
Subject: [PATCH 601/655] 8382202: New file VectorMinMaxTransforms.java has a
 copyright format error

Reviewed-by: mikael
---
 .../jtreg/compiler/vectorapi/VectorMinMaxTransforms.java    | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/test/hotspot/jtreg/compiler/vectorapi/VectorMinMaxTransforms.java b/test/hotspot/jtreg/compiler/vectorapi/VectorMinMaxTransforms.java
index acffe4d3257..be3ec322892 100644
--- a/test/hotspot/jtreg/compiler/vectorapi/VectorMinMaxTransforms.java
+++ b/test/hotspot/jtreg/compiler/vectorapi/VectorMinMaxTransforms.java
@@ -12,9 +12,9 @@
  * version 2 for more details (a copy is included in the LICENSE file that
  * accompanied this code).
  *
- * You should have received a copy of the GNU General Public License
- * version 2 along with this work; if not, write to the Free Software
- * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
  *
  * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
  * or visit www.oracle.com if you need additional information or have any

From 436d291a1c679f892e5164ddf7d04ca59d6ca254 Mon Sep 17 00:00:00 2001
From: Eric Fang <erfang@openjdk.org>
Date: Wed, 15 Apr 2026 08:24:51 +0000
Subject: [PATCH 602/655] 8370863: VectorAPI: Optimize the VectorMaskCast chain
 in specific patterns

Reviewed-by: xgong, vlivanov, galder
---
 src/hotspot/share/opto/phaseX.cpp             |   7 +-
 src/hotspot/share/opto/vectornode.cpp         |  33 +-
 src/hotspot/share/opto/vectornode.hpp         |   1 +
 .../TestVectorLongToMaskNodeIdealization.java |   8 +-
 .../vectorapi/VectorMaskCastIdentityTest.java | 104 +++---
 .../vectorapi/VectorMaskCastTest.java         | 188 +++++++----
 .../vectorapi/VectorMaskToLongTest.java       |  33 +-
 .../VectorStoreMaskIdentityTest.java          | 317 ++++++++++++++++++
 .../vector/VectorStoreMaskBenchmark.java      |  84 +++++
 9 files changed, 654 insertions(+), 121 deletions(-)
 create mode 100644 test/hotspot/jtreg/compiler/vectorapi/VectorStoreMaskIdentityTest.java
 create mode 100644 test/micro/org/openjdk/bench/jdk/incubator/vector/VectorStoreMaskBenchmark.java

diff --git a/src/hotspot/share/opto/phaseX.cpp b/src/hotspot/share/opto/phaseX.cpp
index 0fecc14f31a..a4d6a6c33d0 100644
--- a/src/hotspot/share/opto/phaseX.cpp
+++ b/src/hotspot/share/opto/phaseX.cpp
@@ -2123,7 +2123,12 @@ void PhaseIterGVN::verify_Identity_for(Node* n) {
 
   if (n->is_Vector()) {
     // Found with tier1-3. Not investigated yet.
-    // The observed issue was with AndVNode::Identity
+    // The observed issue was with AndVNode::Identity and
+    // VectorStoreMaskNode::Identity (see JDK-8370863).
+    //
+    // Found with:
+    //   compiler/vectorapi/VectorStoreMaskIdentityTest.java
+    //   -XX:CompileThreshold=100 -XX:-TieredCompilation -XX:VerifyIterativeGVN=1110
     return;
   }
 
diff --git a/src/hotspot/share/opto/vectornode.cpp b/src/hotspot/share/opto/vectornode.cpp
index b07f0234492..dbadc18da01 100644
--- a/src/hotspot/share/opto/vectornode.cpp
+++ b/src/hotspot/share/opto/vectornode.cpp
@@ -1047,6 +1047,20 @@ Node* VectorNode::Ideal(PhaseGVN* phase, bool can_reshape) {
   return nullptr;
 }
 
+// Traverses a chain of VectorMaskCast and returns the first non VectorMaskCast node.
+//
+// Due to the unique nature of vector masks, for specific IR patterns,
+// VectorMaskCast does not affect the output results. For example:
+//   (VectorStoreMask (VectorMaskCast* (VectorLoadMask x))) => (x)
+//   x remains to be a bool vector with no changes.
+// This function can be used to eliminate the VectorMaskCast in such patterns.
+Node* VectorNode::uncast_mask(Node* n) {
+  while (n->Opcode() == Op_VectorMaskCast) {
+    n = n->in(1);
+  }
+  return n;
+}
+
 // Return initial Pack node. Additional operands added with add_opd() calls.
 PackNode* PackNode::make(Node* s, uint vlen, BasicType bt) {
   const TypeVect* vt = TypeVect::make(bt, vlen);
@@ -1495,10 +1509,12 @@ Node* VectorLoadMaskNode::Identity(PhaseGVN* phase) {
 
 Node* VectorStoreMaskNode::Identity(PhaseGVN* phase) {
   // Identity transformation on boolean vectors.
-  //   VectorStoreMask (VectorLoadMask bv) elem_size ==> bv
+  //   VectorStoreMask (VectorMaskCast* VectorLoadMask bv) elem_size ==> bv
   //   vector[n]{bool} => vector[n]{t} => vector[n]{bool}
-  if (in(1)->Opcode() == Op_VectorLoadMask) {
-    return in(1)->in(1);
+  Node* in1 = VectorNode::uncast_mask(in(1));
+  if (in1->Opcode() == Op_VectorLoadMask) {
+    assert(length() == in1->as_Vector()->length(), "vector length must match");
+    return in1->in(1);
   }
   return this;
 }
@@ -1959,11 +1975,12 @@ Node* VectorMaskOpNode::Ideal(PhaseGVN* phase, bool can_reshape) {
 }
 
 Node* VectorMaskCastNode::Identity(PhaseGVN* phase) {
-  Node* in1 = in(1);
-  // VectorMaskCast (VectorMaskCast x) => x
-  if (in1->Opcode() == Op_VectorMaskCast &&
-      vect_type()->eq(in1->in(1)->bottom_type())) {
-      return in1->in(1);
+  // (VectorMaskCast+ x) => (x)
+  // If the types of the input and output nodes in a VectorMaskCast chain are
+  // exactly the same, the intermediate VectorMaskCast nodes can be eliminated.
+  Node* n = VectorNode::uncast_mask(this);
+  if (vect_type()->eq(n->bottom_type())) {
+      return n;
   }
   return this;
 }
diff --git a/src/hotspot/share/opto/vectornode.hpp b/src/hotspot/share/opto/vectornode.hpp
index c4fff06e771..de866898302 100644
--- a/src/hotspot/share/opto/vectornode.hpp
+++ b/src/hotspot/share/opto/vectornode.hpp
@@ -195,6 +195,7 @@ class VectorNode : public TypeNode {
   static bool is_scalar_op_that_returns_int_but_vector_op_returns_long(int opc);
   static bool is_reinterpret_opcode(int opc);
 
+  static Node* uncast_mask(Node* n);
 
   static void trace_new_vector(Node* n, const char* context) {
 #ifdef ASSERT
diff --git a/test/hotspot/jtreg/compiler/vectorapi/TestVectorLongToMaskNodeIdealization.java b/test/hotspot/jtreg/compiler/vectorapi/TestVectorLongToMaskNodeIdealization.java
index 706e21554bb..f9e50fbd23b 100644
--- a/test/hotspot/jtreg/compiler/vectorapi/TestVectorLongToMaskNodeIdealization.java
+++ b/test/hotspot/jtreg/compiler/vectorapi/TestVectorLongToMaskNodeIdealization.java
@@ -46,7 +46,7 @@ import static compiler.lib.template_framework.Template.let;
 
 /*
  * @test
- * @bug 8277997 8378968
+ * @bug 8277997 8378968 8380290
  * @key randomness
  * @summary Testing some optimizations in VectorLongToMaskNode::Ideal
  *          For now: VectorMask.fromLong(.., mask.toLong())
@@ -93,7 +93,7 @@ public class TestVectorLongToMaskNodeIdealization {
                   IRNode.VECTOR_STORE_MASK,                     "> 0", // Not yet optimized away
                   IRNode.VECTOR_LONG_TO_MASK,                   "= 0", // Optimized away
                   IRNode.VECTOR_MASK_TO_LONG,                   "= 0", // Optimized away
-                  IRNode.VECTOR_MASK_CAST,                      "> 0", // Not yet optimized away
+                  IRNode.VECTOR_MASK_CAST,                      "= 0", // Optimized away
                   IRNode.VECTOR_BLEND_I,  IRNode.VECTOR_SIZE_4, "> 0",
                   IRNode.XOR_VI,          IRNode.VECTOR_SIZE_4, "> 0",
                   IRNode.STORE_VECTOR,                          "> 0"},
@@ -168,7 +168,7 @@ public class TestVectorLongToMaskNodeIdealization {
                   IRNode.VECTOR_STORE_MASK,                     "> 0", // Not yet optimized away
                   IRNode.VECTOR_LONG_TO_MASK,                   "= 0", // Optimized away
                   IRNode.VECTOR_MASK_TO_LONG,                   "= 0", // Optimized away
-                  IRNode.VECTOR_MASK_CAST,                      "> 0", // Not yet optimized away: Cast Z->Z, see JDK-8379866
+                  IRNode.VECTOR_MASK_CAST,                      "= 0", // Optimized away
                   IRNode.VECTOR_BLEND_I,  IRNode.VECTOR_SIZE_4, "> 0",
                   IRNode.XOR_VI,          IRNode.VECTOR_SIZE_4, "> 0",
                   IRNode.STORE_VECTOR,                          "> 0"},
@@ -219,7 +219,7 @@ public class TestVectorLongToMaskNodeIdealization {
                   IRNode.VECTOR_STORE_MASK,                     "= 0",
                   IRNode.VECTOR_LONG_TO_MASK,                   "= 0", // Optimized away
                   IRNode.VECTOR_MASK_TO_LONG,                   "= 0", // Optimized away
-                  IRNode.VECTOR_MASK_CAST,                      "> 0", // Not yet optimized Z->Z, see JDK-8379866
+                  IRNode.VECTOR_MASK_CAST,                      "= 0", // Optimized away
                   IRNode.VECTOR_BLEND_I,  IRNode.VECTOR_SIZE_4, "> 0",
                   IRNode.XOR_VI,          IRNode.VECTOR_SIZE_4, "> 0",
                   IRNode.STORE_VECTOR,                          "> 0"},
diff --git a/test/hotspot/jtreg/compiler/vectorapi/VectorMaskCastIdentityTest.java b/test/hotspot/jtreg/compiler/vectorapi/VectorMaskCastIdentityTest.java
index e4f166f510a..e1c20da76ec 100644
--- a/test/hotspot/jtreg/compiler/vectorapi/VectorMaskCastIdentityTest.java
+++ b/test/hotspot/jtreg/compiler/vectorapi/VectorMaskCastIdentityTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2025, NVIDIA CORPORATION & AFFILIATES. All rights reserved.
+ * Copyright (c) 2025, 2026, NVIDIA CORPORATION & AFFILIATES. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,10 +23,10 @@
 
 /*
 * @test
-* @bug 8356760
+* @bug 8356760 8370863
 * @key randomness
 * @library /test/lib /
-* @summary Optimize VectorMask.fromLong for all-true/all-false cases
+* @summary test VectorMaskCast Identity() optimizations
 * @modules jdk.incubator.vector
 *
 * @run driver compiler.vectorapi.VectorMaskCastIdentityTest
@@ -50,70 +50,88 @@ public class VectorMaskCastIdentityTest {
     }
 
     @Test
-    @IR(counts = { IRNode.VECTOR_MASK_CAST, "= 2" }, applyIfCPUFeatureOr = {"asimd", "true", "rvv", "true"})
-    public static int testTwoCastToDifferentType() {
-        // The types before and after the two casts are not the same, so the cast cannot be eliminated.
-        VectorMask<Float> mFloat64 = VectorMask.fromArray(FloatVector.SPECIES_64, mr, 0);
-        VectorMask<Double> mDouble128 = mFloat64.cast(DoubleVector.SPECIES_128);
-        VectorMask<Integer> mInt64 = mDouble128.cast(IntVector.SPECIES_64);
-        return mInt64.trueCount();
+    @IR(counts = { IRNode.LOAD_VECTOR_Z, IRNode.VECTOR_SIZE_4, "> 0",
+                   IRNode.VECTOR_MASK_CAST, "= 0" },
+        applyIfCPUFeatureOr = { "asimd", "true", "avx2", "true", "rvv", "true" },
+        applyIf = { "MaxVectorSize", ">= 16" })
+    public static int testOneCastToSameType() {
+        // The types before and after the cast sequence are the same,
+        // so the casts will be eliminated.
+        VectorMask<Integer> mInt128 = VectorMask.fromArray(IntVector.SPECIES_128, mr, 0);
+        mInt128 = mInt128.cast(IntVector.SPECIES_128);
+        // Insert a not() to prevent the casts being optimized by the optimization:
+        // (VectorStoreMask (VectorMaskCast* (VectorLoadMask x))) => x
+        return mInt128.not().trueCount();
     }
 
-    @Run(test = "testTwoCastToDifferentType")
-    public static void testTwoCastToDifferentType_runner() {
-        int count = testTwoCastToDifferentType();
-        VectorMask<Float> mFloat64 = VectorMask.fromArray(FloatVector.SPECIES_64, mr, 0);
-        Asserts.assertEquals(count, mFloat64.trueCount());
+    @Run(test = "testOneCastToSameType")
+    public static void testOneCastToSameType_runner() {
+        int count = testOneCastToSameType();
+        VectorMask<Integer> mInt128 = VectorMask.fromArray(IntVector.SPECIES_128, mr, 0);
+        Asserts.assertEquals(count, mInt128.not().trueCount());
     }
 
     @Test
-    @IR(counts = { IRNode.VECTOR_MASK_CAST, "= 2" }, applyIfCPUFeatureOr = {"avx2", "true"})
-    public static int testTwoCastToDifferentType2() {
-        // The types before and after the two casts are not the same, so the cast cannot be eliminated.
-        VectorMask<Integer> mInt128 = VectorMask.fromArray(IntVector.SPECIES_128, mr, 0);
-        VectorMask<Double> mDouble256 = mInt128.cast(DoubleVector.SPECIES_256);
-        VectorMask<Short>  mShort64 = mDouble256.cast(ShortVector.SPECIES_64);
-        return mShort64.trueCount();
-    }
-
-    @Run(test = "testTwoCastToDifferentType2")
-    public static void testTwoCastToDifferentType2_runner() {
-        int count = testTwoCastToDifferentType2();
-        VectorMask<Integer> mInt128 = VectorMask.fromArray(IntVector.SPECIES_128, mr, 0);
-        Asserts.assertEquals(count, mInt128.trueCount());
-    }
-
-    @Test
-    @IR(counts = { IRNode.VECTOR_MASK_CAST, "= 0" }, applyIfCPUFeatureOr = {"avx2", "true", "asimd", "true", "rvv", "true"})
+    @IR(counts = { IRNode.LOAD_VECTOR_Z, IRNode.VECTOR_SIZE_4, "> 0",
+                   IRNode.VECTOR_MASK_CAST, "= 0" },
+        applyIfCPUFeatureOr = { "asimd", "true", "avx2", "true", "rvv", "true" },
+        applyIf = { "MaxVectorSize", ">= 16" })
     public static int testTwoCastToSameType() {
-        // The types before and after the two casts are the same, so the cast will be eliminated.
+        // The types before and after the cast sequence are the same,
+        // so the casts will be eliminated.
         VectorMask<Integer> mInt128 = VectorMask.fromArray(IntVector.SPECIES_128, mr, 0);
         VectorMask<Float> mFloat128 = mInt128.cast(FloatVector.SPECIES_128);
         VectorMask<Integer> mInt128_2 = mFloat128.cast(IntVector.SPECIES_128);
-        return mInt128_2.trueCount();
+        return mInt128_2.not().trueCount();
     }
 
     @Run(test = "testTwoCastToSameType")
     public static void testTwoCastToSameType_runner() {
         int count = testTwoCastToSameType();
         VectorMask<Integer> mInt128 = VectorMask.fromArray(IntVector.SPECIES_128, mr, 0);
-        Asserts.assertEquals(count, mInt128.trueCount());
+        Asserts.assertEquals(count, mInt128.not().trueCount());
     }
 
     @Test
-    @IR(counts = { IRNode.VECTOR_MASK_CAST, "= 1" }, applyIfCPUFeatureOr = {"avx2", "true", "asimd", "true", "rvv", "true"})
+    @IR(counts = { IRNode.LOAD_VECTOR_Z, IRNode.VECTOR_SIZE_4, "> 0",
+                   IRNode.VECTOR_MASK_CAST, "= 1" },
+        applyIfCPUFeatureOr = { "asimd", "true", "avx2", "true", "rvv", "true" },
+        applyIf = { "MaxVectorSize", ">= 16" })
     public static int testOneCastToDifferentType() {
-        // The types before and after the only cast are different, the cast will not be eliminated.
-        VectorMask<Float> mFloat128 = VectorMask.fromArray(FloatVector.SPECIES_128, mr, 0).not();
-        VectorMask<Integer> mInt128 = mFloat128.cast(IntVector.SPECIES_128);
-        return mInt128.trueCount();
+        // The types before and after the cast sequence are different,
+        // so the casts will not be eliminated.
+        VectorMask<Integer> mInt128 = VectorMask.fromArray(IntVector.SPECIES_128, mr, 0);
+        VectorMask<Short> mShort64 = mInt128.cast(ShortVector.SPECIES_64);
+        return mShort64.not().trueCount();
     }
 
     @Run(test = "testOneCastToDifferentType")
     public static void testOneCastToDifferentType_runner() {
         int count = testOneCastToDifferentType();
-        VectorMask<Float> mInt128 = VectorMask.fromArray(FloatVector.SPECIES_128, mr, 0).not();
-        Asserts.assertEquals(count, mInt128.trueCount());
+        VectorMask<Integer> mInt128 = VectorMask.fromArray(IntVector.SPECIES_128, mr, 0);
+        Asserts.assertEquals(count, mInt128.not().trueCount());
+    }
+
+    @Test
+    @IR(counts = { IRNode.LOAD_VECTOR_Z, IRNode.VECTOR_SIZE_4, "> 0",
+                   IRNode.VECTOR_MASK_CAST, "= 2" },
+        applyIfCPUFeatureOr = { "asimd", "true", "avx2", "true", "rvv", "true" },
+        applyIf = { "MaxVectorSize", ">= 16" })
+    public static int testTwoCastToDifferentType() {
+        // The types before and after the cast sequence are different, so the
+        // casts are not eliminated. We should probably be able to eliminate
+        // the intermediate cast, so that we only need a cast from short to int.
+        VectorMask<Short> mShort64 = VectorMask.fromArray(ShortVector.SPECIES_64, mr, 0);
+        VectorMask<Float> mFloat128 = mShort64.cast(FloatVector.SPECIES_128);
+        VectorMask<Integer> mInt128 = mFloat128.cast(IntVector.SPECIES_128);
+        return mInt128.not().trueCount();
+    }
+
+    @Run(test = "testTwoCastToDifferentType")
+    public static void testTwoCastToDifferentType_runner() {
+        int count = testTwoCastToDifferentType();
+        VectorMask<Short> mShort64 = VectorMask.fromArray(ShortVector.SPECIES_64, mr, 0);
+        Asserts.assertEquals(count, mShort64.not().trueCount());
     }
 
     public static void main(String[] args) {
diff --git a/test/hotspot/jtreg/compiler/vectorapi/VectorMaskCastTest.java b/test/hotspot/jtreg/compiler/vectorapi/VectorMaskCastTest.java
index 1f346cffd2f..c75ea6c7a66 100644
--- a/test/hotspot/jtreg/compiler/vectorapi/VectorMaskCastTest.java
+++ b/test/hotspot/jtreg/compiler/vectorapi/VectorMaskCastTest.java
@@ -1,5 +1,6 @@
 /*
  * Copyright (c) 2021, 2023, Arm Limited. All rights reserved.
+ * Copyright (c) 2025, 2026, NVIDIA CORPORATION & AFFILIATES. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -76,13 +77,15 @@ public class VectorMaskCastTest {
     @Test
     @IR(counts = { IRNode.VECTOR_MASK_CAST, "> 0" }, applyIfCPUFeatureOr = {"avx2", "true", "asimd", "true", "rvv", "true"})
     public static VectorMask<Short> testByte64ToShort128(VectorMask<Byte> v) {
-        return v.cast(ShortVector.SPECIES_128);
+        // A not operation is introduced to prevent the cast from being optimized away.
+        return v.not().cast(ShortVector.SPECIES_128);
     }
 
     @Run(test = "testByte64ToShort128")
     public static void testByte64ToShort128_runner() {
         VectorMask<Byte> mByte64 = VectorMask.fromArray(ByteVector.SPECIES_64, mask_arr, 0);
         VectorMask<Short> res = testByte64ToShort128(mByte64);
+        mByte64 = mByte64.not();
         Asserts.assertEquals(res.toString(), mByte64.toString());
         Asserts.assertEquals(res.trueCount(), mByte64.trueCount());
     }
@@ -90,13 +93,14 @@ public class VectorMaskCastTest {
     @Test
     @IR(counts = { IRNode.VECTOR_MASK_CAST, "> 0" }, applyIfCPUFeature = {"avx2", "true"})
     public static VectorMask<Integer> testByte64ToInt256(VectorMask<Byte> v) {
-        return v.cast(IntVector.SPECIES_256);
+        return v.not().cast(IntVector.SPECIES_256);
     }
 
     @Run(test = "testByte64ToInt256")
     public static void testByte64ToInt256_runner() {
         VectorMask<Byte> mByte64 = VectorMask.fromArray(ByteVector.SPECIES_64, mask_arr, 0);
         VectorMask<Integer> res = testByte64ToInt256(mByte64);
+        mByte64 = mByte64.not();
         Asserts.assertEquals(res.toString(), mByte64.toString());
         Asserts.assertEquals(res.trueCount(), mByte64.trueCount());
     }
@@ -104,13 +108,14 @@ public class VectorMaskCastTest {
     @Test
     @IR(counts = { IRNode.VECTOR_MASK_CAST, "> 0" }, applyIfCPUFeature = {"avx2", "true"})
     public static VectorMask<Float> testByte64ToFloat256(VectorMask<Byte> v) {
-        return v.cast(FloatVector.SPECIES_256);
+        return v.not().cast(FloatVector.SPECIES_256);
     }
 
     @Run(test = "testByte64ToFloat256")
     public static void testByte64ToFloat256_runner() {
         VectorMask<Byte> mByte64 = VectorMask.fromArray(ByteVector.SPECIES_64, mask_arr, 0);
         VectorMask<Float> res = testByte64ToFloat256(mByte64);
+        mByte64 = mByte64.not();
         Asserts.assertEquals(res.toString(), mByte64.toString());
         Asserts.assertEquals(res.trueCount(), mByte64.trueCount());
     }
@@ -118,13 +123,14 @@ public class VectorMaskCastTest {
     @Test
     @IR(counts = { IRNode.VECTOR_MASK_CAST, "> 0" }, applyIfCPUFeature = {"avx512vl", "true"})
     public static VectorMask<Long> testByte64ToLong512(VectorMask<Byte> v) {
-        return v.cast(LongVector.SPECIES_512);
+        return v.not().cast(LongVector.SPECIES_512);
     }
 
     @Run(test = "testByte64ToLong512")
     public static void testByte64ToLong512_runner() {
         VectorMask<Byte> mByte64 = VectorMask.fromArray(ByteVector.SPECIES_64, mask_arr, 0);
         VectorMask<Long> res = testByte64ToLong512(mByte64);
+        mByte64 = mByte64.not();
         Asserts.assertEquals(res.toString(), mByte64.toString());
         Asserts.assertEquals(res.trueCount(), mByte64.trueCount());
     }
@@ -132,13 +138,14 @@ public class VectorMaskCastTest {
     @Test
     @IR(counts = { IRNode.VECTOR_MASK_CAST, "> 0" }, applyIfCPUFeature = {"avx512vl", "true"})
     public static VectorMask<Double> testByte64ToDouble512(VectorMask<Byte> v) {
-       return v.cast(DoubleVector.SPECIES_512);
+       return v.not().cast(DoubleVector.SPECIES_512);
     }
 
     @Run(test = "testByte64ToDouble512")
     public static void testByte64ToDouble512_runner() {
         VectorMask<Byte> mByte64 = VectorMask.fromArray(ByteVector.SPECIES_64, mask_arr, 0);
         VectorMask<Double> res = testByte64ToDouble512(mByte64);
+        mByte64 = mByte64.not();
         Asserts.assertEquals(res.toString(), mByte64.toString());
         Asserts.assertEquals(res.trueCount(), mByte64.trueCount());
     }
@@ -146,13 +153,14 @@ public class VectorMaskCastTest {
     @Test
     @IR(counts = { IRNode.VECTOR_MASK_CAST, "> 0" }, applyIfCPUFeature = {"avx2", "true"})
     public static VectorMask<Short> testByte128ToShort256(VectorMask<Byte> v) {
-        return v.cast(ShortVector.SPECIES_256);
+        return v.not().cast(ShortVector.SPECIES_256);
     }
 
     @Run(test = "testByte128ToShort256")
     public static void testByte128ToShort256_runner() {
         VectorMask<Byte> mByte128 = VectorMask.fromArray(ByteVector.SPECIES_128, mask_arr, 0);
         VectorMask<Short> res = testByte128ToShort256(mByte128);
+        mByte128 = mByte128.not();
         Asserts.assertEquals(res.toString(), mByte128.toString());
         Asserts.assertEquals(res.trueCount(), mByte128.trueCount());
     }
@@ -160,13 +168,14 @@ public class VectorMaskCastTest {
     @Test
     @IR(counts = { IRNode.VECTOR_MASK_CAST, "> 0" }, applyIfCPUFeature = {"avx512vl", "true"})
     public static VectorMask<Integer> testByte128ToInt512(VectorMask<Byte> v) {
-        return v.cast(IntVector.SPECIES_512);
+        return v.not().cast(IntVector.SPECIES_512);
     }
 
     @Run(test = "testByte128ToInt512")
     public static void testByte128ToInt512_runner() {
         VectorMask<Byte> mByte128 = VectorMask.fromArray(ByteVector.SPECIES_128, mask_arr, 0);
         VectorMask<Integer> res = testByte128ToInt512(mByte128);
+        mByte128 = mByte128.not();
         Asserts.assertEquals(res.toString(), mByte128.toString());
         Asserts.assertEquals(res.trueCount(), mByte128.trueCount());
     }
@@ -174,13 +183,14 @@ public class VectorMaskCastTest {
     @Test
     @IR(counts = { IRNode.VECTOR_MASK_CAST, "> 0" }, applyIfCPUFeature = {"avx512vl", "true"})
     public static VectorMask<Float> testByte128ToFloat512(VectorMask<Byte> v) {
-        return v.cast(FloatVector.SPECIES_512);
+        return v.not().cast(FloatVector.SPECIES_512);
     }
 
     @Run(test = "testByte128ToFloat512")
     public static void testByte128ToFloat512_runner() {
         VectorMask<Byte> mByte128 = VectorMask.fromArray(ByteVector.SPECIES_128, mask_arr, 0);
         VectorMask<Float> res = testByte128ToFloat512(mByte128);
+        mByte128 = mByte128.not();
         Asserts.assertEquals(res.toString(), mByte128.toString());
         Asserts.assertEquals(res.trueCount(), mByte128.trueCount());
     }
@@ -188,13 +198,14 @@ public class VectorMaskCastTest {
     @Test
     @IR(counts = { IRNode.VECTOR_MASK_CAST, "> 0" }, applyIfCPUFeature = {"avx512vl", "true"})
     public static VectorMask<Short> testByte256ToShort512(VectorMask<Byte> v) {
-        return v.cast(ShortVector.SPECIES_512);
+        return v.not().cast(ShortVector.SPECIES_512);
     }
 
     @Run(test = "testByte256ToShort512")
     public static void testByte256ToShort512_runner() {
         VectorMask<Byte> mByte256 = VectorMask.fromArray(ByteVector.SPECIES_256, mask_arr, 0);
         VectorMask<Short> res = testByte256ToShort512(mByte256);
+        mByte256 = mByte256.not();
         Asserts.assertEquals(res.toString(), mByte256.toString());
         Asserts.assertEquals(res.trueCount(), mByte256.trueCount());
     }
@@ -203,13 +214,14 @@ public class VectorMaskCastTest {
     @Test
     @IR(counts = { IRNode.VECTOR_MASK_CAST, "> 0" }, applyIfCPUFeatureOr = {"avx2", "true", "asimd", "true", "rvv", "true"})
     public static VectorMask<Integer> testShort64ToInt128(VectorMask<Short> v) {
-        return v.cast(IntVector.SPECIES_128);
+        return v.not().cast(IntVector.SPECIES_128);
     }
 
     @Run(test = "testShort64ToInt128")
     public static void testShort64ToInt128_runner() {
         VectorMask<Short> mShort64 = VectorMask.fromArray(ShortVector.SPECIES_64, mask_arr, 0);
         VectorMask<Integer> res = testShort64ToInt128(mShort64);
+        mShort64 = mShort64.not();
         Asserts.assertEquals(res.toString(), mShort64.toString());
         Asserts.assertEquals(res.trueCount(), mShort64.trueCount());
     }
@@ -217,13 +229,14 @@ public class VectorMaskCastTest {
     @Test
     @IR(counts = { IRNode.VECTOR_MASK_CAST, "> 0" }, applyIfCPUFeatureOr = {"avx2", "true", "asimd", "true", "rvv", "true"})
     public static VectorMask<Float> testShort64ToFloat128(VectorMask<Short> v) {
-        return v.cast(FloatVector.SPECIES_128);
+        return v.not().cast(FloatVector.SPECIES_128);
     }
 
     @Run(test = "testShort64ToFloat128")
     public static void testShort64ToFloat128_runner() {
         VectorMask<Short> mShort64 = VectorMask.fromArray(ShortVector.SPECIES_64, mask_arr, 0);
         VectorMask<Float> res = testShort64ToFloat128(mShort64);
+        mShort64 = mShort64.not();
         Asserts.assertEquals(res.toString(), mShort64.toString());
         Asserts.assertEquals(res.trueCount(), mShort64.trueCount());
     }
@@ -231,13 +244,14 @@ public class VectorMaskCastTest {
     @Test
     @IR(counts = { IRNode.VECTOR_MASK_CAST, "> 0" }, applyIfCPUFeature = {"avx2", "true"})
     public static VectorMask<Long> testShort64ToLong256(VectorMask<Short> v) {
-        return v.cast(LongVector.SPECIES_256);
+        return v.not().cast(LongVector.SPECIES_256);
     }
 
     @Run(test = "testShort64ToLong256")
     public static void testShort64ToLong256_runner() {
         VectorMask<Short> mShort64 = VectorMask.fromArray(ShortVector.SPECIES_64, mask_arr, 0);
         VectorMask<Long> res = testShort64ToLong256(mShort64);
+        mShort64 = mShort64.not();
         Asserts.assertEquals(res.toString(), mShort64.toString());
         Asserts.assertEquals(res.trueCount(), mShort64.trueCount());
     }
@@ -245,13 +259,14 @@ public class VectorMaskCastTest {
     @Test
     @IR(counts = { IRNode.VECTOR_MASK_CAST, "> 0" }, applyIfCPUFeature = {"avx2", "true"})
     public static VectorMask<Double> testShort64ToDouble256(VectorMask<Short> v) {
-        return v.cast(DoubleVector.SPECIES_256);
+        return v.not().cast(DoubleVector.SPECIES_256);
     }
 
     @Run(test = "testShort64ToDouble256")
     public static void testShort64ToDouble256_runner() {
         VectorMask<Short> mShort64 = VectorMask.fromArray(ShortVector.SPECIES_64, mask_arr, 0);
         VectorMask<Double> res = testShort64ToDouble256(mShort64);
+        mShort64 = mShort64.not();
         Asserts.assertEquals(res.toString(), mShort64.toString());
         Asserts.assertEquals(res.trueCount(), mShort64.trueCount());
     }
@@ -259,13 +274,14 @@ public class VectorMaskCastTest {
     @Test
     @IR(counts = { IRNode.VECTOR_MASK_CAST, "> 0" }, applyIfCPUFeatureOr = {"avx2", "true", "asimd", "true", "rvv", "true"})
     public static VectorMask<Byte> testShort128ToByte64(VectorMask<Short> v) {
-        return v.cast(ByteVector.SPECIES_64);
+        return v.not().cast(ByteVector.SPECIES_64);
     }
 
     @Run(test = "testShort128ToByte64")
     public static void testShort128ToByte64_runner() {
         VectorMask<Short> mShort128 = VectorMask.fromArray(ShortVector.SPECIES_128, mask_arr, 0);
         VectorMask<Byte> res = testShort128ToByte64(mShort128);
+        mShort128 = mShort128.not();
         Asserts.assertEquals(res.toString(), mShort128.toString());
         Asserts.assertEquals(res.trueCount(), mShort128.trueCount());
     }
@@ -273,13 +289,14 @@ public class VectorMaskCastTest {
     @Test
     @IR(counts = { IRNode.VECTOR_MASK_CAST, "> 0" }, applyIfCPUFeature = {"avx2", "true"})
     public static VectorMask<Integer> testShort128ToInt256(VectorMask<Short> v) {
-        return v.cast(IntVector.SPECIES_256);
+        return v.not().cast(IntVector.SPECIES_256);
     }
 
     @Run(test = "testShort128ToInt256")
     public static void testShort128ToInt256_runner() {
         VectorMask<Short> mShort128 = VectorMask.fromArray(ShortVector.SPECIES_128, mask_arr, 0);
         VectorMask<Integer> res = testShort128ToInt256(mShort128);
+        mShort128 = mShort128.not();
         Asserts.assertEquals(res.toString(), mShort128.toString());
         Asserts.assertEquals(res.trueCount(), mShort128.trueCount());
     }
@@ -287,13 +304,14 @@ public class VectorMaskCastTest {
     @Test
     @IR(counts = { IRNode.VECTOR_MASK_CAST, "> 0" }, applyIfCPUFeature = {"avx2", "true"})
     public static VectorMask<Float> testShort128ToFloat256(VectorMask<Short> v) {
-        return v.cast(FloatVector.SPECIES_256);
+        return v.not().cast(FloatVector.SPECIES_256);
     }
 
     @Run(test = "testShort128ToFloat256")
     public static void testShort128ToFloat256_runner() {
         VectorMask<Short> mShort128 = VectorMask.fromArray(ShortVector.SPECIES_128, mask_arr, 0);
         VectorMask<Float> res = testShort128ToFloat256(mShort128);
+        mShort128 = mShort128.not();
         Asserts.assertEquals(res.toString(), mShort128.toString());
         Asserts.assertEquals(res.trueCount(), mShort128.trueCount());
     }
@@ -301,13 +319,14 @@ public class VectorMaskCastTest {
     @Test
     @IR(counts = { IRNode.VECTOR_MASK_CAST, "> 0" }, applyIfCPUFeature = {"avx512vl", "true"})
     public static VectorMask<Long> testShort128ToLong512(VectorMask<Short> v) {
-        return v.cast(LongVector.SPECIES_512);
+        return v.not().cast(LongVector.SPECIES_512);
     }
 
     @Run(test = "testShort128ToLong512")
     public static void testShort128ToLong512_runner() {
         VectorMask<Short> mShort128 = VectorMask.fromArray(ShortVector.SPECIES_128, mask_arr, 0);
         VectorMask<Long> res = testShort128ToLong512(mShort128);
+        mShort128 = mShort128.not();
         Asserts.assertEquals(res.toString(), mShort128.toString());
         Asserts.assertEquals(res.trueCount(), mShort128.trueCount());
     }
@@ -315,13 +334,14 @@ public class VectorMaskCastTest {
     @Test
     @IR(counts = { IRNode.VECTOR_MASK_CAST, "> 0" }, applyIfCPUFeature = {"avx512vl", "true"})
     public static VectorMask<Double> testShort128ToDouble512(VectorMask<Short> v) {
-        return v.cast(DoubleVector.SPECIES_512);
+        return v.not().cast(DoubleVector.SPECIES_512);
     }
 
     @Run(test = "testShort128ToDouble512")
     public static void testShort128ToDouble512_runner() {
         VectorMask<Short> mShort128 = VectorMask.fromArray(ShortVector.SPECIES_128, mask_arr, 0);
         VectorMask<Double> res = testShort128ToDouble512(mShort128);
+        mShort128 = mShort128.not();
         Asserts.assertEquals(res.toString(), mShort128.toString());
         Asserts.assertEquals(res.trueCount(), mShort128.trueCount());
     }
@@ -329,13 +349,14 @@ public class VectorMaskCastTest {
     @Test
     @IR(counts = { IRNode.VECTOR_MASK_CAST, "> 0" }, applyIfCPUFeature = {"avx2", "true"})
     public static VectorMask<Byte> testShort256ToByte128(VectorMask<Short> v) {
-       return v.cast(ByteVector.SPECIES_128);
+       return v.not().cast(ByteVector.SPECIES_128);
     }
 
     @Run(test = "testShort256ToByte128")
     public static void testShort256ToByte128_runner() {
         VectorMask<Short> mShort256 = VectorMask.fromArray(ShortVector.SPECIES_256, mask_arr, 0);
         VectorMask<Byte> res = testShort256ToByte128(mShort256);
+        mShort256 = mShort256.not();
         Asserts.assertEquals(res.toString(), mShort256.toString());
         Asserts.assertEquals(res.trueCount(), mShort256.trueCount());
     }
@@ -343,13 +364,14 @@ public class VectorMaskCastTest {
     @Test
     @IR(counts = { IRNode.VECTOR_MASK_CAST, "> 0" }, applyIfCPUFeature = {"avx512vl", "true"})
     public static VectorMask<Integer> testShort256ToInt512(VectorMask<Short> v) {
-        return v.cast(IntVector.SPECIES_512);
+        return v.not().cast(IntVector.SPECIES_512);
     }
 
     @Run(test = "testShort256ToInt512")
     public static void testShort256ToInt512_runner() {
         VectorMask<Short> mShort256 = VectorMask.fromArray(ShortVector.SPECIES_256, mask_arr, 0);
         VectorMask<Integer> res = testShort256ToInt512(mShort256);
+        mShort256 = mShort256.not();
         Asserts.assertEquals(res.toString(), mShort256.toString());
         Asserts.assertEquals(res.trueCount(), mShort256.trueCount());
     }
@@ -357,13 +379,14 @@ public class VectorMaskCastTest {
     @Test
     @IR(counts = { IRNode.VECTOR_MASK_CAST, "> 0" }, applyIfCPUFeature = {"avx512vl", "true"})
     public static VectorMask<Float> testShort256ToFloat512(VectorMask<Short> v) {
-        return v.cast(FloatVector.SPECIES_512);
+        return v.not().cast(FloatVector.SPECIES_512);
     }
 
     @Run(test = "testShort256ToFloat512")
     public static void testShort256ToFloat512_runner() {
         VectorMask<Short> mShort256 = VectorMask.fromArray(ShortVector.SPECIES_256, mask_arr, 0);
         VectorMask<Float> res = testShort256ToFloat512(mShort256);
+        mShort256 = mShort256.not();
         Asserts.assertEquals(res.toString(), mShort256.toString());
         Asserts.assertEquals(res.trueCount(), mShort256.trueCount());
     }
@@ -371,13 +394,14 @@ public class VectorMaskCastTest {
     @Test
     @IR(counts = { IRNode.VECTOR_MASK_CAST, "> 0" }, applyIfCPUFeature = {"avx512vl", "true"})
     public static VectorMask<Byte> testShort512ToByte256(VectorMask<Short> v) {
-        return v.cast(ByteVector.SPECIES_256);
+        return v.not().cast(ByteVector.SPECIES_256);
     }
 
     @Run(test = "testShort512ToByte256")
     public static void testShort512ToByte256_runner() {
         VectorMask<Short> mShort512 = VectorMask.fromArray(ShortVector.SPECIES_512, mask_arr, 0);
         VectorMask<Byte> res = testShort512ToByte256(mShort512);
+        mShort512 = mShort512.not();
         Asserts.assertEquals(res.toString(), mShort512.toString());
         Asserts.assertEquals(res.trueCount(), mShort512.trueCount());
     }
@@ -386,13 +410,14 @@ public class VectorMaskCastTest {
     @Test
     @IR(counts = { IRNode.VECTOR_MASK_CAST, "> 0" }, applyIfCPUFeatureOr = {"asimd", "true", "rvv", "true"})
     public static VectorMask<Long> testInt64ToLong128(VectorMask<Integer> v) {
-        return v.cast(LongVector.SPECIES_128);
+        return v.not().cast(LongVector.SPECIES_128);
     }
 
     @Run(test = "testInt64ToLong128")
     public static void testInt64ToLong128_runner() {
         VectorMask<Integer> mInt64 = VectorMask.fromArray(IntVector.SPECIES_64, mask_arr, 0);
         VectorMask<Long> res = testInt64ToLong128(mInt64);
+        mInt64 = mInt64.not();
         Asserts.assertEquals(res.toString(), mInt64.toString());
         Asserts.assertEquals(res.trueCount(), mInt64.trueCount());
     }
@@ -400,13 +425,14 @@ public class VectorMaskCastTest {
     @Test
     @IR(counts = { IRNode.VECTOR_MASK_CAST, "> 0" }, applyIfCPUFeatureOr = {"asimd", "true", "rvv", "true"})
     public static VectorMask<Double> testInt64ToDouble128(VectorMask<Integer> v) {
-        return v.cast(DoubleVector.SPECIES_128);
+        return v.not().cast(DoubleVector.SPECIES_128);
     }
 
     @Run(test = "testInt64ToDouble128")
     public static void testInt64ToDouble128_runner() {
         VectorMask<Integer> mInt64 = VectorMask.fromArray(IntVector.SPECIES_64, mask_arr, 0);
         VectorMask<Double> res = testInt64ToDouble128(mInt64);
+        mInt64 = mInt64.not();
         Asserts.assertEquals(res.toString(), mInt64.toString());
         Asserts.assertEquals(res.trueCount(), mInt64.trueCount());
     }
@@ -414,13 +440,14 @@ public class VectorMaskCastTest {
     @Test
     @IR(counts = { IRNode.VECTOR_MASK_CAST, "> 0" }, applyIfCPUFeatureOr = {"avx2", "true", "asimd", "true", "rvv", "true"})
     public static VectorMask<Short> testInt128ToShort64(VectorMask<Integer> v) {
-        return v.cast(ShortVector.SPECIES_64);
+        return v.not().cast(ShortVector.SPECIES_64);
     }
 
     @Run(test = "testInt128ToShort64")
     public static void testInt128ToShort64_runner() {
         VectorMask<Integer> mInt128 = VectorMask.fromArray(IntVector.SPECIES_128, mask_arr, 0);
         VectorMask<Short> res = testInt128ToShort64(mInt128);
+        mInt128 = mInt128.not();
         Asserts.assertEquals(res.toString(), mInt128.toString());
         Asserts.assertEquals(res.trueCount(), mInt128.trueCount());
     }
@@ -428,13 +455,14 @@ public class VectorMaskCastTest {
     @Test
     @IR(counts = { IRNode.VECTOR_MASK_CAST, "> 0" }, applyIfCPUFeature = {"avx2", "true"})
     public static VectorMask<Long> testInt128ToLong256(VectorMask<Integer> v) {
-        return v.cast(LongVector.SPECIES_256);
+        return v.not().cast(LongVector.SPECIES_256);
     }
 
     @Run(test = "testInt128ToLong256")
     public static void testInt128ToLong256_runner() {
         VectorMask<Integer> mInt128 = VectorMask.fromArray(IntVector.SPECIES_128, mask_arr, 0);
         VectorMask<Long> res = testInt128ToLong256(mInt128);
+        mInt128 = mInt128.not();
         Asserts.assertEquals(res.toString(), mInt128.toString());
         Asserts.assertEquals(res.trueCount(), mInt128.trueCount());
     }
@@ -442,13 +470,14 @@ public class VectorMaskCastTest {
     @Test
     @IR(counts = { IRNode.VECTOR_MASK_CAST, "> 0" }, applyIfCPUFeature = {"avx2", "true"})
     public static VectorMask<Double> testInt128ToDouble256(VectorMask<Integer> v) {
-        return v.cast(DoubleVector.SPECIES_256);
+        return v.not().cast(DoubleVector.SPECIES_256);
     }
 
     @Run(test = "testInt128ToDouble256")
     public static void testInt128ToDouble256_runner() {
         VectorMask<Integer> mInt128 = VectorMask.fromArray(IntVector.SPECIES_128, mask_arr, 0);
         VectorMask<Double> res = testInt128ToDouble256(mInt128);
+        mInt128 = mInt128.not();
         Asserts.assertEquals(res.toString(), mInt128.toString());
         Asserts.assertEquals(res.trueCount(), mInt128.trueCount());
     }
@@ -456,13 +485,14 @@ public class VectorMaskCastTest {
     @Test
     @IR(counts = { IRNode.VECTOR_MASK_CAST, "> 0" }, applyIfCPUFeature = {"avx2", "true"})
     public static VectorMask<Short> testInt256ToShort128(VectorMask<Integer> v) {
-        return v.cast(ShortVector.SPECIES_128);
+        return v.not().cast(ShortVector.SPECIES_128);
     }
 
     @Run(test = "testInt256ToShort128")
     public static void testInt256ToShort128_runner() {
         VectorMask<Integer> mInt256 = VectorMask.fromArray(IntVector.SPECIES_256, mask_arr, 0);
         VectorMask<Short> res = testInt256ToShort128(mInt256);
+        mInt256 = mInt256.not();
         Asserts.assertEquals(res.toString(), mInt256.toString());
         Asserts.assertEquals(res.trueCount(), mInt256.trueCount());
     }
@@ -470,13 +500,14 @@ public class VectorMaskCastTest {
     @Test
     @IR(counts = { IRNode.VECTOR_MASK_CAST, "> 0" }, applyIfCPUFeature = {"avx2", "true"})
     public static VectorMask<Byte> testInt256ToByte64(VectorMask<Integer> v) {
-    return v.cast(ByteVector.SPECIES_64);
+    return v.not().cast(ByteVector.SPECIES_64);
     }
 
     @Run(test = "testInt256ToByte64")
     public static void testInt256ToByte64_runner() {
         VectorMask<Integer> mInt256 = VectorMask.fromArray(IntVector.SPECIES_256, mask_arr, 0);
         VectorMask<Byte> res = testInt256ToByte64(mInt256);
+        mInt256 = mInt256.not();
         Asserts.assertEquals(res.toString(), mInt256.toString());
         Asserts.assertEquals(res.trueCount(), mInt256.trueCount());
     }
@@ -484,13 +515,14 @@ public class VectorMaskCastTest {
     @Test
     @IR(counts = { IRNode.VECTOR_MASK_CAST, "> 0" }, applyIfCPUFeature = {"avx512vl", "true"})
     public static VectorMask<Long> testInt256ToLong512(VectorMask<Integer> v) {
-        return v.cast(LongVector.SPECIES_512);
+        return v.not().cast(LongVector.SPECIES_512);
     }
 
     @Run(test = "testInt256ToLong512")
     public static void testInt256ToLong512_runner() {
         VectorMask<Integer> mInt256 = VectorMask.fromArray(IntVector.SPECIES_256, mask_arr, 0);
         VectorMask<Long> res = testInt256ToLong512(mInt256);
+        mInt256 = mInt256.not();
         Asserts.assertEquals(res.toString(), mInt256.toString());
         Asserts.assertEquals(res.trueCount(), mInt256.trueCount());
     }
@@ -498,13 +530,14 @@ public class VectorMaskCastTest {
     @Test
     @IR(counts = { IRNode.VECTOR_MASK_CAST, "> 0" }, applyIfCPUFeature = {"avx512vl", "true"})
     public static VectorMask<Double> testInt256ToDouble512(VectorMask<Integer> v) {
-        return v.cast(DoubleVector.SPECIES_512);
+        return v.not().cast(DoubleVector.SPECIES_512);
     }
 
     @Run(test = "testInt256ToDouble512")
     public static void testInt256ToDouble512_runner() {
         VectorMask<Integer> mInt256 = VectorMask.fromArray(IntVector.SPECIES_256, mask_arr, 0);
         VectorMask<Double> res = testInt256ToDouble512(mInt256);
+        mInt256 = mInt256.not();
         Asserts.assertEquals(res.toString(), mInt256.toString());
         Asserts.assertEquals(res.trueCount(), mInt256.trueCount());
     }
@@ -512,13 +545,14 @@ public class VectorMaskCastTest {
     @Test
     @IR(counts = { IRNode.VECTOR_MASK_CAST, "> 0" }, applyIfCPUFeature = {"avx512vl", "true"})
     public static VectorMask<Short> testInt512ToShort256(VectorMask<Integer> v) {
-        return v.cast(ShortVector.SPECIES_256);
+        return v.not().cast(ShortVector.SPECIES_256);
     }
 
     @Run(test = "testInt512ToShort256")
     public static void testInt512ToShort256_runner() {
         VectorMask<Integer> mInt512 = VectorMask.fromArray(IntVector.SPECIES_512, mask_arr, 0);
         VectorMask<Short> res = testInt512ToShort256(mInt512);
+        mInt512 = mInt512.not();
         Asserts.assertEquals(res.toString(), mInt512.toString());
         Asserts.assertEquals(res.trueCount(), mInt512.trueCount());
     }
@@ -526,13 +560,14 @@ public class VectorMaskCastTest {
     @Test
     @IR(counts = { IRNode.VECTOR_MASK_CAST, "> 0" }, applyIfCPUFeature = {"avx512vl", "true"})
     public static VectorMask<Byte> testInt512ToByte128(VectorMask<Integer> v) {
-        return v.cast(ByteVector.SPECIES_128);
+        return v.not().cast(ByteVector.SPECIES_128);
     }
 
     @Run(test = "testInt512ToByte128")
     public static void testInt512ToByte128_runner() {
         VectorMask<Integer> mInt512 = VectorMask.fromArray(IntVector.SPECIES_512, mask_arr, 0);
         VectorMask<Byte> res = testInt512ToByte128(mInt512);
+        mInt512 = mInt512.not();
         Asserts.assertEquals(res.toString(), mInt512.toString());
         Asserts.assertEquals(res.trueCount(), mInt512.trueCount());
     }
@@ -541,13 +576,14 @@ public class VectorMaskCastTest {
     @Test
     @IR(counts = { IRNode.VECTOR_MASK_CAST, "> 0" }, applyIfCPUFeatureOr = {"asimd", "true", "rvv", "true"})
     public static VectorMask<Long> testFloat64ToLong128(VectorMask<Float> v) {
-        return v.cast(LongVector.SPECIES_128);
+        return v.not().cast(LongVector.SPECIES_128);
     }
 
     @Run(test = "testFloat64ToLong128")
     public static void testFloat64ToLong128_runner() {
         VectorMask<Float> mFloat64 = VectorMask.fromArray(FloatVector.SPECIES_64, mask_arr, 0);
         VectorMask<Long> res = testFloat64ToLong128(mFloat64);
+        mFloat64 = mFloat64.not();
         Asserts.assertEquals(res.toString(), mFloat64.toString());
         Asserts.assertEquals(res.trueCount(), mFloat64.trueCount());
     }
@@ -555,13 +591,14 @@ public class VectorMaskCastTest {
     @Test
     @IR(counts = { IRNode.VECTOR_MASK_CAST, "> 0" }, applyIfCPUFeatureOr = {"asimd", "true", "rvv", "true"})
     public static VectorMask<Double> testFloat64ToDouble128(VectorMask<Float> v) {
-        return v.cast(DoubleVector.SPECIES_128);
+        return v.not().cast(DoubleVector.SPECIES_128);
     }
 
     @Run(test = "testFloat64ToDouble128")
     public static void testFloat64ToDouble128_runner() {
         VectorMask<Float> mFloat64 = VectorMask.fromArray(FloatVector.SPECIES_64, mask_arr, 0);
         VectorMask<Double> res = testFloat64ToDouble128(mFloat64);
+        mFloat64 = mFloat64.not();
         Asserts.assertEquals(res.toString(), mFloat64.toString());
         Asserts.assertEquals(res.trueCount(), mFloat64.trueCount());
     }
@@ -569,13 +606,14 @@ public class VectorMaskCastTest {
     @Test
     @IR(counts = { IRNode.VECTOR_MASK_CAST, "> 0" }, applyIfCPUFeatureOr = {"avx2", "true", "asimd", "true", "rvv", "true"})
     public static VectorMask<Short> testFloat128ToShort64(VectorMask<Float> v) {
-        return v.cast(ShortVector.SPECIES_64);
+        return v.not().cast(ShortVector.SPECIES_64);
     }
 
     @Run(test = "testFloat128ToShort64")
     public static void testFloat128ToShort64_runner() {
         VectorMask<Float> mFloat128 = VectorMask.fromArray(FloatVector.SPECIES_128, mask_arr, 0);
         VectorMask<Short> res = testFloat128ToShort64(mFloat128);
+        mFloat128 = mFloat128.not();
         Asserts.assertEquals(res.toString(), mFloat128.toString());
         Asserts.assertEquals(res.trueCount(), mFloat128.trueCount());
     }
@@ -583,13 +621,14 @@ public class VectorMaskCastTest {
     @Test
     @IR(counts = { IRNode.VECTOR_MASK_CAST, "> 0" }, applyIfCPUFeature = {"avx2", "true"})
     public static VectorMask<Long> testFloat128ToLong256(VectorMask<Float> v) {
-        return v.cast(LongVector.SPECIES_256);
+        return v.not().cast(LongVector.SPECIES_256);
     }
 
     @Run(test = "testFloat128ToLong256")
     public static void testFloat128ToLong256_runner() {
         VectorMask<Float> mFloat128 = VectorMask.fromArray(FloatVector.SPECIES_128, mask_arr, 0);
         VectorMask<Long> res = testFloat128ToLong256(mFloat128);
+        mFloat128 = mFloat128.not();
         Asserts.assertEquals(res.toString(), mFloat128.toString());
         Asserts.assertEquals(res.trueCount(), mFloat128.trueCount());
     }
@@ -597,13 +636,14 @@ public class VectorMaskCastTest {
     @Test
     @IR(counts = { IRNode.VECTOR_MASK_CAST, "> 0" }, applyIfCPUFeature = {"avx2", "true"})
     public static VectorMask<Double> testFloat128ToDouble256(VectorMask<Float> v) {
-        return v.cast(DoubleVector.SPECIES_256);
+        return v.not().cast(DoubleVector.SPECIES_256);
     }
 
     @Run(test = "testFloat128ToDouble256")
     public static void testFloat128ToDouble256_runner() {
         VectorMask<Float> mFloat128 = VectorMask.fromArray(FloatVector.SPECIES_128, mask_arr, 0);
         VectorMask<Double> res = testFloat128ToDouble256(mFloat128);
+        mFloat128 = mFloat128.not();
         Asserts.assertEquals(res.toString(), mFloat128.toString());
         Asserts.assertEquals(res.trueCount(), mFloat128.trueCount());
     }
@@ -611,13 +651,14 @@ public class VectorMaskCastTest {
     @Test
     @IR(counts = { IRNode.VECTOR_MASK_CAST, "> 0" }, applyIfCPUFeature = {"avx2", "true"})
     public static VectorMask<Short> testFloat256ToShort128(VectorMask<Float> v) {
-        return v.cast(ShortVector.SPECIES_128);
+        return v.not().cast(ShortVector.SPECIES_128);
     }
 
     @Run(test = "testFloat256ToShort128")
     public static void testFloat256ToShort128_runner() {
         VectorMask<Float> mFloat256 = VectorMask.fromArray(FloatVector.SPECIES_256, mask_arr, 0);
         VectorMask<Short> res = testFloat256ToShort128(mFloat256);
+        mFloat256 = mFloat256.not();
         Asserts.assertEquals(res.toString(), mFloat256.toString());
         Asserts.assertEquals(res.trueCount(), mFloat256.trueCount());
     }
@@ -625,13 +666,14 @@ public class VectorMaskCastTest {
     @Test
     @IR(counts = { IRNode.VECTOR_MASK_CAST, "> 0" }, applyIfCPUFeature = {"avx2", "true"})
     public static VectorMask<Byte> testFloat256ToByte64(VectorMask<Float> v) {
-        return v.cast(ByteVector.SPECIES_64);
+        return v.not().cast(ByteVector.SPECIES_64);
     }
 
     @Run(test = "testFloat256ToByte64")
     public static void testFloat256ToByte64_runner() {
         VectorMask<Float> mFloat256 = VectorMask.fromArray(FloatVector.SPECIES_256, mask_arr, 0);
         VectorMask<Byte> res = testFloat256ToByte64(mFloat256);
+        mFloat256 = mFloat256.not();
         Asserts.assertEquals(res.toString(), mFloat256.toString());
         Asserts.assertEquals(res.trueCount(), mFloat256.trueCount());
     }
@@ -639,13 +681,14 @@ public class VectorMaskCastTest {
     @Test
     @IR(counts = { IRNode.VECTOR_MASK_CAST, "> 0" }, applyIfCPUFeature = {"avx512vl", "true"})
     public static VectorMask<Long> testFloat256ToLong512(VectorMask<Float> v) {
-        return v.cast(LongVector.SPECIES_512);
+        return v.not().cast(LongVector.SPECIES_512);
     }
 
     @Run(test = "testFloat256ToLong512")
     public static void testFloat256ToLong512_runner() {
         VectorMask<Float> mFloat256 = VectorMask.fromArray(FloatVector.SPECIES_256, mask_arr, 0);
         VectorMask<Long> res = testFloat256ToLong512(mFloat256);
+        mFloat256 = mFloat256.not();
         Asserts.assertEquals(res.toString(), mFloat256.toString());
         Asserts.assertEquals(res.trueCount(), mFloat256.trueCount());
     }
@@ -653,13 +696,14 @@ public class VectorMaskCastTest {
     @Test
     @IR(counts = { IRNode.VECTOR_MASK_CAST, "> 0" }, applyIfCPUFeature = {"avx512vl", "true"})
     public static VectorMask<Double> testFloat256ToDouble512(VectorMask<Float> v) {
-        return v.cast(DoubleVector.SPECIES_512);
+        return v.not().cast(DoubleVector.SPECIES_512);
     }
 
     @Run(test = "testFloat256ToDouble512")
     public static void testFloat256ToDouble512_runner() {
         VectorMask<Float> mFloat256 = VectorMask.fromArray(FloatVector.SPECIES_256, mask_arr, 0);
         VectorMask<Double> res = testFloat256ToDouble512(mFloat256);
+        mFloat256 = mFloat256.not();
         Asserts.assertEquals(res.toString(), mFloat256.toString());
         Asserts.assertEquals(res.trueCount(), mFloat256.trueCount());
     }
@@ -667,13 +711,14 @@ public class VectorMaskCastTest {
     @Test
     @IR(counts = { IRNode.VECTOR_MASK_CAST, "> 0" }, applyIfCPUFeature = {"avx512vl", "true"})
     public static VectorMask<Short> testFloat512ToShort256(VectorMask<Float> v) {
-        return v.cast(ShortVector.SPECIES_256);
+        return v.not().cast(ShortVector.SPECIES_256);
     }
 
     @Run(test = "testFloat512ToShort256")
     public static void testFloat512ToShort256_runner() {
         VectorMask<Float> mFloat512 = VectorMask.fromArray(FloatVector.SPECIES_512, mask_arr, 0);
         VectorMask<Short> res = testFloat512ToShort256(mFloat512);
+        mFloat512 = mFloat512.not();
         Asserts.assertEquals(res.toString(), mFloat512.toString());
         Asserts.assertEquals(res.trueCount(), mFloat512.trueCount());
     }
@@ -681,13 +726,14 @@ public class VectorMaskCastTest {
     @Test
     @IR(counts = { IRNode.VECTOR_MASK_CAST, "> 0" }, applyIfCPUFeature = {"avx512vl", "true"})
     public static VectorMask<Byte> testFloat512ToByte128(VectorMask<Float> v) {
-        return v.cast(ByteVector.SPECIES_128);
+        return v.not().cast(ByteVector.SPECIES_128);
     }
 
     @Run(test = "testFloat512ToByte128")
     public static void testFloat512ToByte128_runner() {
         VectorMask<Float> mFloat512 = VectorMask.fromArray(FloatVector.SPECIES_512, mask_arr, 0);
         VectorMask<Byte> res = testFloat512ToByte128(mFloat512);
+        mFloat512 = mFloat512.not();
         Asserts.assertEquals(res.toString(), mFloat512.toString());
         Asserts.assertEquals(res.trueCount(), mFloat512.trueCount());
     }
@@ -696,13 +742,14 @@ public class VectorMaskCastTest {
     @Test
     @IR(counts = { IRNode.VECTOR_MASK_CAST, "> 0" }, applyIfCPUFeatureOr = {"asimd", "true", "rvv", "true"})
     public static VectorMask<Integer> testLong128ToInt64(VectorMask<Long> v) {
-        return v.cast(IntVector.SPECIES_64);
+        return v.not().cast(IntVector.SPECIES_64);
     }
 
     @Run(test = "testLong128ToInt64")
     public static void testLong128ToInt64_runner() {
         VectorMask<Long> mLong128 = VectorMask.fromArray(LongVector.SPECIES_128, mask_arr, 0);
         VectorMask<Integer> res = testLong128ToInt64(mLong128);
+        mLong128 = mLong128.not();
         Asserts.assertEquals(res.toString(), mLong128.toString());
         Asserts.assertEquals(res.trueCount(), mLong128.trueCount());
     }
@@ -710,13 +757,14 @@ public class VectorMaskCastTest {
     @Test
     @IR(counts = { IRNode.VECTOR_MASK_CAST, "> 0" }, applyIfCPUFeatureOr = {"asimd", "true", "rvv", "true"})
     public static VectorMask<Float> testLong128ToFloat64(VectorMask<Long> v) {
-        return v.cast(FloatVector.SPECIES_64);
+        return v.not().cast(FloatVector.SPECIES_64);
     }
 
     @Run(test = "testLong128ToFloat64")
     public static void testLong128ToFloat64_runner() {
         VectorMask<Long> mLong128 = VectorMask.fromArray(LongVector.SPECIES_128, mask_arr, 0);
         VectorMask<Float> res = testLong128ToFloat64(mLong128);
+        mLong128 = mLong128.not();
         Asserts.assertEquals(res.toString(), mLong128.toString());
         Asserts.assertEquals(res.trueCount(), mLong128.trueCount());
     }
@@ -724,13 +772,14 @@ public class VectorMaskCastTest {
     @Test
     @IR(counts = { IRNode.VECTOR_MASK_CAST, "> 0" }, applyIfCPUFeature = {"avx2", "true"})
     public static VectorMask<Integer> testLong256ToInt128(VectorMask<Long> v) {
-        return v.cast(IntVector.SPECIES_128);
+        return v.not().cast(IntVector.SPECIES_128);
     }
 
     @Run(test = "testLong256ToInt128")
     public static void testLong256ToInt128_runner() {
         VectorMask<Long> mLong256 = VectorMask.fromArray(LongVector.SPECIES_256, mask_arr, 0);
         VectorMask<Integer> res = testLong256ToInt128(mLong256);
+        mLong256 = mLong256.not();
         Asserts.assertEquals(res.toString(), mLong256.toString());
         Asserts.assertEquals(res.trueCount(), mLong256.trueCount());
     }
@@ -738,13 +787,14 @@ public class VectorMaskCastTest {
     @Test
     @IR(counts = { IRNode.VECTOR_MASK_CAST, "> 0" }, applyIfCPUFeature = {"avx2", "true"})
     public static VectorMask<Float> testLong256ToFloat128(VectorMask<Long> v) {
-        return v.cast(FloatVector.SPECIES_128);
+        return v.not().cast(FloatVector.SPECIES_128);
     }
 
     @Run(test = "testLong256ToFloat128")
     public static void testLong256ToFloat128_runner() {
         VectorMask<Long> mLong256 = VectorMask.fromArray(LongVector.SPECIES_256, mask_arr, 0);
         VectorMask<Float> res = testLong256ToFloat128(mLong256);
+        mLong256 = mLong256.not();
         Asserts.assertEquals(res.toString(), mLong256.toString());
         Asserts.assertEquals(res.trueCount(), mLong256.trueCount());
     }
@@ -752,13 +802,14 @@ public class VectorMaskCastTest {
     @Test
     @IR(counts = { IRNode.VECTOR_MASK_CAST, "> 0" }, applyIfCPUFeature = {"avx2", "true"})
     public static VectorMask<Short> testLong256ToShort64(VectorMask<Long> v) {
-       return v.cast(ShortVector.SPECIES_64);
+       return v.not().cast(ShortVector.SPECIES_64);
     }
 
     @Run(test = "testLong256ToShort64")
     public static void testLong256ToShort64_runner() {
         VectorMask<Long> mLong256 = VectorMask.fromArray(LongVector.SPECIES_256, mask_arr, 0);
         VectorMask<Short> res = testLong256ToShort64(mLong256);
+        mLong256 = mLong256.not();
         Asserts.assertEquals(res.toString(), mLong256.toString());
         Asserts.assertEquals(res.trueCount(), mLong256.trueCount());
     }
@@ -766,13 +817,14 @@ public class VectorMaskCastTest {
     @Test
     @IR(counts = { IRNode.VECTOR_MASK_CAST, "> 0" }, applyIfCPUFeature = {"avx512vl", "true"})
     public static VectorMask<Integer> testLong512ToInt256(VectorMask<Long> v) {
-        return v.cast(IntVector.SPECIES_256);
+        return v.not().cast(IntVector.SPECIES_256);
     }
 
     @Run(test = "testLong512ToInt256")
     public static void testLong512ToInt256_runner() {
         VectorMask<Long> mLong512 = VectorMask.fromArray(LongVector.SPECIES_512, mask_arr, 0);
         VectorMask<Integer> res = testLong512ToInt256(mLong512);
+        mLong512 = mLong512.not();
         Asserts.assertEquals(res.toString(), mLong512.toString());
         Asserts.assertEquals(res.trueCount(), mLong512.trueCount());
     }
@@ -780,13 +832,14 @@ public class VectorMaskCastTest {
     @Test
     @IR(counts = { IRNode.VECTOR_MASK_CAST, "> 0" }, applyIfCPUFeature = {"avx512vl", "true"})
     public static VectorMask<Float> testLong512ToFloat256(VectorMask<Long> v) {
-        return v.cast(FloatVector.SPECIES_256);
+        return v.not().cast(FloatVector.SPECIES_256);
     }
 
     @Run(test = "testLong512ToFloat256")
     public static void testLong512ToFloat256_runner() {
         VectorMask<Long> mLong512 = VectorMask.fromArray(LongVector.SPECIES_512, mask_arr, 0);
         VectorMask<Float> res = testLong512ToFloat256(mLong512);
+        mLong512 = mLong512.not();
         Asserts.assertEquals(res.toString(), mLong512.toString());
         Asserts.assertEquals(res.trueCount(), mLong512.trueCount());
     }
@@ -794,13 +847,14 @@ public class VectorMaskCastTest {
     @Test
     @IR(counts = { IRNode.VECTOR_MASK_CAST, "> 0" }, applyIfCPUFeature = {"avx512vl", "true"})
     public static VectorMask<Short> testLong512ToShort128(VectorMask<Long> v) {
-        return v.cast(ShortVector.SPECIES_128);
+        return v.not().cast(ShortVector.SPECIES_128);
     }
 
     @Run(test = "testLong512ToShort128")
     public static void testLong512ToShort128_runner() {
         VectorMask<Long> mLong512 = VectorMask.fromArray(LongVector.SPECIES_512, mask_arr, 0);
         VectorMask<Short> res = testLong512ToShort128(mLong512);
+        mLong512 = mLong512.not();
         Asserts.assertEquals(res.toString(), mLong512.toString());
         Asserts.assertEquals(res.trueCount(), mLong512.trueCount());
     }
@@ -808,13 +862,14 @@ public class VectorMaskCastTest {
     @Test
     @IR(counts = { IRNode.VECTOR_MASK_CAST, "> 0" }, applyIfCPUFeature = {"avx512vl", "true"})
     public static VectorMask<Byte> testLong512ToByte64(VectorMask<Long> v) {
-        return v.cast(ByteVector.SPECIES_64);
+        return v.not().cast(ByteVector.SPECIES_64);
     }
 
     @Run(test = "testLong512ToByte64")
     public static void testLong512ToByte64_runner() {
         VectorMask<Long> mLong512 = VectorMask.fromArray(LongVector.SPECIES_512, mask_arr, 0);
         VectorMask<Byte> res = testLong512ToByte64(mLong512);
+        mLong512 = mLong512.not();
         Asserts.assertEquals(res.toString(), mLong512.toString());
         Asserts.assertEquals(res.trueCount(), mLong512.trueCount());
     }
@@ -823,13 +878,14 @@ public class VectorMaskCastTest {
     @Test
     @IR(counts = { IRNode.VECTOR_MASK_CAST, "> 0" }, applyIfCPUFeatureOr = {"asimd", "true", "rvv", "true"})
     public static VectorMask<Integer> testDouble128ToInt64(VectorMask<Double> v) {
-        return v.cast(IntVector.SPECIES_64);
+        return v.not().cast(IntVector.SPECIES_64);
     }
 
     @Run(test = "testDouble128ToInt64")
     public static void testDouble128ToInt64_runner() {
         VectorMask<Double> mDouble128 = VectorMask.fromArray(DoubleVector.SPECIES_128, mask_arr, 0);
         VectorMask<Integer> res = testDouble128ToInt64(mDouble128);
+        mDouble128 = mDouble128.not();
         Asserts.assertEquals(res.toString(), mDouble128.toString());
         Asserts.assertEquals(res.trueCount(), mDouble128.trueCount());
     }
@@ -837,13 +893,14 @@ public class VectorMaskCastTest {
     @Test
     @IR(counts = { IRNode.VECTOR_MASK_CAST, "> 0" }, applyIfCPUFeatureOr = {"asimd", "true", "rvv", "true"})
     public static VectorMask<Float> testDouble128ToFloat64(VectorMask<Double> v) {
-        return v.cast(FloatVector.SPECIES_64);
+        return v.not().cast(FloatVector.SPECIES_64);
     }
 
     @Run(test = "testDouble128ToFloat64")
     public static void testDouble128ToFloat64_runner() {
         VectorMask<Double> mDouble128 = VectorMask.fromArray(DoubleVector.SPECIES_128, mask_arr, 0);
         VectorMask<Float> res = testDouble128ToFloat64(mDouble128);
+        mDouble128 = mDouble128.not();
         Asserts.assertEquals(res.toString(), mDouble128.toString());
         Asserts.assertEquals(res.trueCount(), mDouble128.trueCount());
     }
@@ -851,13 +908,14 @@ public class VectorMaskCastTest {
     @Test
     @IR(counts = { IRNode.VECTOR_MASK_CAST, "> 0" }, applyIfCPUFeature = {"avx2", "true"})
     public static VectorMask<Integer> testDouble256ToInt128(VectorMask<Double> v) {
-        return v.cast(IntVector.SPECIES_128);
+        return v.not().cast(IntVector.SPECIES_128);
     }
 
     @Run(test = "testDouble256ToInt128")
     public static void testDouble256ToInt128_runner() {
         VectorMask<Double> mDouble256 = VectorMask.fromArray(DoubleVector.SPECIES_256, mask_arr, 0);
         VectorMask<Integer> res = testDouble256ToInt128(mDouble256);
+        mDouble256 = mDouble256.not();
         Asserts.assertEquals(res.toString(), mDouble256.toString());
         Asserts.assertEquals(res.trueCount(), mDouble256.trueCount());
     }
@@ -865,13 +923,14 @@ public class VectorMaskCastTest {
     @Test
     @IR(counts = { IRNode.VECTOR_MASK_CAST, "> 0" }, applyIfCPUFeature = {"avx2", "true"})
     public static VectorMask<Float> testDouble256ToFloat128(VectorMask<Double> v) {
-        return v.cast(FloatVector.SPECIES_128);
+        return v.not().cast(FloatVector.SPECIES_128);
     }
 
     @Run(test = "testDouble256ToFloat128")
     public static void testDouble256ToFloat128_runner() {
         VectorMask<Double> mDouble256 = VectorMask.fromArray(DoubleVector.SPECIES_256, mask_arr, 0);
         VectorMask<Float> res = testDouble256ToFloat128(mDouble256);
+        mDouble256 = mDouble256.not();
         Asserts.assertEquals(res.toString(), mDouble256.toString());
         Asserts.assertEquals(res.trueCount(), mDouble256.trueCount());
     }
@@ -879,13 +938,14 @@ public class VectorMaskCastTest {
     @Test
     @IR(counts = { IRNode.VECTOR_MASK_CAST, "> 0" }, applyIfCPUFeature = {"avx2", "true"})
     public static VectorMask<Short> testDouble256ToShort64(VectorMask<Double> v) {
-        return v.cast(ShortVector.SPECIES_64);
+        return v.not().cast(ShortVector.SPECIES_64);
     }
 
     @Run(test = "testDouble256ToShort64")
     public static void testDouble256ToShort64_runner() {
         VectorMask<Double> mDouble256 = VectorMask.fromArray(DoubleVector.SPECIES_256, mask_arr, 0);
         VectorMask<Short> res = testDouble256ToShort64(mDouble256);
+        mDouble256 = mDouble256.not();
         Asserts.assertEquals(res.toString(), mDouble256.toString());
         Asserts.assertEquals(res.trueCount(), mDouble256.trueCount());
     }
@@ -893,13 +953,14 @@ public class VectorMaskCastTest {
     @Test
     @IR(counts = { IRNode.VECTOR_MASK_CAST, "> 0" }, applyIfCPUFeature = {"avx512vl", "true"})
     public static VectorMask<Integer> testDouble512ToInt256(VectorMask<Double> v) {
-        return v.cast(IntVector.SPECIES_256);
+        return v.not().cast(IntVector.SPECIES_256);
     }
 
     @Run(test = "testDouble512ToInt256")
     public static void testDouble512ToInt256_runner() {
         VectorMask<Double> mDouble512 = VectorMask.fromArray(DoubleVector.SPECIES_512, mask_arr, 0);
         VectorMask<Integer> res = testDouble512ToInt256(mDouble512);
+        mDouble512 = mDouble512.not();
         Asserts.assertEquals(res.toString(), mDouble512.toString());
         Asserts.assertEquals(res.trueCount(), mDouble512.trueCount());
     }
@@ -907,13 +968,14 @@ public class VectorMaskCastTest {
     @Test
     @IR(counts = { IRNode.VECTOR_MASK_CAST, "> 0" }, applyIfCPUFeature = {"avx512vl", "true"})
     public static VectorMask<Float> testDouble512ToFloat256(VectorMask<Double> v) {
-        return v.cast(FloatVector.SPECIES_256);
+        return v.not().cast(FloatVector.SPECIES_256);
     }
 
     @Run(test = "testDouble512ToFloat256")
     public static void testDouble512ToFloat256_runner() {
         VectorMask<Double> mDouble512 = VectorMask.fromArray(DoubleVector.SPECIES_512, mask_arr, 0);
         VectorMask<Float> res = testDouble512ToFloat256(mDouble512);
+        mDouble512 = mDouble512.not();
         Asserts.assertEquals(res.toString(), mDouble512.toString());
         Asserts.assertEquals(res.trueCount(), mDouble512.trueCount());
     }
@@ -921,13 +983,14 @@ public class VectorMaskCastTest {
     @Test
     @IR(counts = { IRNode.VECTOR_MASK_CAST, "> 0" }, applyIfCPUFeature = {"avx512vl", "true"})
     public static VectorMask<Short> testDouble512ToShort128(VectorMask<Double> v) {
-        return v.cast(ShortVector.SPECIES_128);
+        return v.not().cast(ShortVector.SPECIES_128);
     }
 
     @Run(test = "testDouble512ToShort128")
     public static void testDouble512ToShort128_runner() {
         VectorMask<Double> mDouble512 = VectorMask.fromArray(DoubleVector.SPECIES_512, mask_arr, 0);
         VectorMask<Short> res = testDouble512ToShort128(mDouble512);
+        mDouble512 = mDouble512.not();
         Asserts.assertEquals(res.toString(), mDouble512.toString());
         Asserts.assertEquals(res.trueCount(), mDouble512.trueCount());
     }
@@ -935,13 +998,14 @@ public class VectorMaskCastTest {
     @Test
     @IR(counts = { IRNode.VECTOR_MASK_CAST, "> 0" }, applyIfCPUFeature = {"avx512vl", "true"})
     public static VectorMask<Byte> testDouble512ToByte64(VectorMask<Double> v) {
-        return v.cast(ByteVector.SPECIES_64);
+        return v.not().cast(ByteVector.SPECIES_64);
     }
 
     @Run(test = "testDouble512ToByte64")
     public static void testDouble512ToByte64_runner() {
         VectorMask<Double> mDouble512 = VectorMask.fromArray(DoubleVector.SPECIES_512, mask_arr, 0);
         VectorMask<Byte> res = testDouble512ToByte64(mDouble512);
+        mDouble512 = mDouble512.not();
         Asserts.assertEquals(res.toString(), mDouble512.toString());
         Asserts.assertEquals(res.trueCount(), mDouble512.trueCount());
     }
diff --git a/test/hotspot/jtreg/compiler/vectorapi/VectorMaskToLongTest.java b/test/hotspot/jtreg/compiler/vectorapi/VectorMaskToLongTest.java
index 35a5aca966a..43415496072 100644
--- a/test/hotspot/jtreg/compiler/vectorapi/VectorMaskToLongTest.java
+++ b/test/hotspot/jtreg/compiler/vectorapi/VectorMaskToLongTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2025, NVIDIA CORPORATION & AFFILIATES. All rights reserved.
+ * Copyright (c) 2025, 2026, NVIDIA CORPORATION & AFFILIATES. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -236,10 +236,29 @@ public class VectorMaskToLongTest {
         verifyMaskToLong(L_SPECIES, inputLong, got);
     }
 
+    // Test VectorMask.fromLong().toLong() with Float species.
+    // For floating-point types, VectorMaskCast is inserted between fromLong and toLong to convert
+    // between float and integer types. There are two relevant optimizations:
+    //   1. (VectorStoreMask (VectorMaskCast* (VectorLoadMask x))) => (x)
+    //   2. (VectorMaskToLong (VectorLongToMask x)) => (x)
+    // The optimization behavior varies by architecture:
+    // - SVE with bitperm: IR chain is (VectorMaskToLong (VectorStoreMask (VectorMaskCast
+    //   (VectorLoadMask (VectorLongToMask x))))), so both optimizations are triggered.
+    // - AVX-512/RVV: IR pattern is (VectorMaskToLong (VectorMaskCast (VectorLongToMask x))),
+    //   so neither optimization is triggered.
+    // - AVX2: Same as SVE with bitperm, both optimizations are triggered.
+    // - ASIMD (without SVE bitperm): VectorLongToMaskNode is not supported,
+    //   so neither optimization is triggered.
     @Test
+    @IR(counts = { IRNode.VECTOR_LONG_TO_MASK, "= 0",
+                   IRNode.VECTOR_MASK_TO_LONG, "= 0" },
+        applyIfCPUFeature = { "svebitperm", "true" })
     @IR(counts = { IRNode.VECTOR_LONG_TO_MASK, "= 1",
                    IRNode.VECTOR_MASK_TO_LONG, "= 1" },
-        applyIfCPUFeatureOr = { "svebitperm", "true", "avx2", "true", "rvv", "true" })
+        applyIfCPUFeatureOr = { "avx512", "true", "rvv", "true" })
+    @IR(counts = { IRNode.VECTOR_LONG_TO_MASK, "= 0",
+                   IRNode.VECTOR_MASK_TO_LONG, "= 0" },
+        applyIfCPUFeatureAnd = { "avx2", "true", "avx512", "false" })
     @IR(counts = { IRNode.VECTOR_LONG_TO_MASK, "= 0",
                    IRNode.VECTOR_MASK_TO_LONG, "= 1" },
         applyIfCPUFeatureAnd = { "asimd", "true", "svebitperm", "false" })
@@ -250,10 +269,18 @@ public class VectorMaskToLongTest {
         verifyMaskToLong(F_SPECIES, inputLong, got);
     }
 
+    // Test VectorMask.fromLong().toLong() with Double species.
+    // Same as testFromLongToLongFloat() - see comments there for detailed explanation.
     @Test
+    @IR(counts = { IRNode.VECTOR_LONG_TO_MASK, "= 0",
+                   IRNode.VECTOR_MASK_TO_LONG, "= 0" },
+        applyIfCPUFeature = { "svebitperm", "true" })
     @IR(counts = { IRNode.VECTOR_LONG_TO_MASK, "= 1",
                    IRNode.VECTOR_MASK_TO_LONG, "= 1" },
-        applyIfCPUFeatureOr = { "svebitperm", "true", "avx2", "true", "rvv", "true" })
+        applyIfCPUFeatureOr = { "avx512", "true", "rvv", "true" })
+    @IR(counts = { IRNode.VECTOR_LONG_TO_MASK, "= 0",
+                   IRNode.VECTOR_MASK_TO_LONG, "= 0" },
+        applyIfCPUFeatureAnd = { "avx2", "true", "avx512", "false" })
     @IR(counts = { IRNode.VECTOR_LONG_TO_MASK, "= 0",
                    IRNode.VECTOR_MASK_TO_LONG, "= 1" },
         applyIfCPUFeatureAnd = { "asimd", "true", "svebitperm", "false" })
diff --git a/test/hotspot/jtreg/compiler/vectorapi/VectorStoreMaskIdentityTest.java b/test/hotspot/jtreg/compiler/vectorapi/VectorStoreMaskIdentityTest.java
new file mode 100644
index 00000000000..c019f116373
--- /dev/null
+++ b/test/hotspot/jtreg/compiler/vectorapi/VectorStoreMaskIdentityTest.java
@@ -0,0 +1,317 @@
+/*
+ * Copyright (c) 2026, NVIDIA CORPORATION & AFFILIATES. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+/*
+* @test
+* @bug 8370863
+* @library /test/lib /
+* @summary VectorStoreMaskNode Identity optimization tests
+* @modules jdk.incubator.vector
+*
+* @run driver ${test.main.class}
+*/
+
+package compiler.vectorapi;
+
+import compiler.lib.ir_framework.*;
+import jdk.incubator.vector.*;
+import jdk.test.lib.Asserts;
+
+public class VectorStoreMaskIdentityTest {
+    private static final VectorSpecies<Byte> B64 = ByteVector.SPECIES_64;
+    private static final VectorSpecies<Short> S64 = ShortVector.SPECIES_64;
+    private static final VectorSpecies<Short> S128 = ShortVector.SPECIES_128;
+    private static final VectorSpecies<Integer> I64 = IntVector.SPECIES_64;
+    private static final VectorSpecies<Integer> I128 = IntVector.SPECIES_128;
+    private static final VectorSpecies<Integer> I256 = IntVector.SPECIES_256;
+    private static final VectorSpecies<Long> L128 = LongVector.SPECIES_128;
+    private static final VectorSpecies<Long> L256 = LongVector.SPECIES_256;
+    private static final VectorSpecies<Float> F128 = FloatVector.SPECIES_128;
+    private static final VectorSpecies<Float> F256 = FloatVector.SPECIES_256;
+    private static final VectorSpecies<Double> D128 = DoubleVector.SPECIES_128;
+    private static final VectorSpecies<Double> D256 = DoubleVector.SPECIES_256;
+    private static final int LENGTH = 256; // large enough
+    private static boolean[] mask_in;
+    private static boolean[] mask_out;
+    static {
+        mask_in = new boolean[LENGTH];
+        mask_out = new boolean[LENGTH];
+        for (int i = 0; i < LENGTH; i++) {
+            mask_in[i] = (i & 3) == 0;
+        }
+    }
+
+    @DontInline
+    private static void verifyResult(int vlen) {
+        for (int i = 0; i < vlen; i++) {
+            Asserts.assertEquals(mask_in[i], mask_out[i], "index " + i);
+        }
+    }
+
+    @Test
+    @IR(counts = { IRNode.LOAD_VECTOR_Z, IRNode.VECTOR_SIZE_8, ">= 1",
+                   IRNode.VECTOR_LOAD_MASK, "= 0",
+                   IRNode.VECTOR_STORE_MASK, "= 0",
+                   IRNode.VECTOR_MASK_CAST, "= 0" },
+        applyIfCPUFeatureOr = { "asimd", "true", "avx", "true" },
+        applyIf = { "MaxVectorSize", ">= 16" })
+    public static void testVectorMaskStoreIdentityByte() {
+        VectorMask<Byte> mask_byte_64 = VectorMask.fromArray(B64, mask_in, 0);
+
+        mask_byte_64.cast(S128).intoArray(mask_out, 0);
+        verifyResult(B64.length());
+
+        mask_byte_64.cast(S128).cast(B64).intoArray(mask_out, 0);
+        verifyResult(B64.length());
+
+        mask_byte_64.cast(S128).cast(B64).cast(S128).intoArray(mask_out, 0);
+        verifyResult(B64.length());
+    }
+
+    @Test
+    @IR(counts = { IRNode.LOAD_VECTOR_Z, IRNode.VECTOR_SIZE_8, ">= 1",
+                   IRNode.VECTOR_LOAD_MASK, "= 0",
+                   IRNode.VECTOR_STORE_MASK, "= 0",
+                   IRNode.VECTOR_MASK_CAST, "= 0" },
+        applyIfCPUFeatureOr = { "sve", "true", "avx2", "true" },
+        applyIf = { "MaxVectorSize", "> 16" })
+    public static void testVectorMaskStoreIdentityByte256() {
+        VectorMask<Byte> mask_byte_64 = VectorMask.fromArray(B64, mask_in, 0);
+
+        mask_byte_64.cast(I256).intoArray(mask_out, 0);
+        verifyResult(B64.length());
+
+        mask_byte_64.cast(S128).cast(F256).intoArray(mask_out, 0);
+        verifyResult(B64.length());
+
+        mask_byte_64.cast(F256).cast(S128).cast(I256).intoArray(mask_out, 0);
+        verifyResult(B64.length());
+    }
+
+    @Test
+    @IR(counts = { IRNode.LOAD_VECTOR_Z, IRNode.VECTOR_SIZE_8, ">= 1",
+                   IRNode.VECTOR_LOAD_MASK, "= 0",
+                   IRNode.VECTOR_STORE_MASK, "= 0",
+                   IRNode.VECTOR_MASK_CAST, "= 0" },
+        applyIfCPUFeatureOr = { "asimd", "true", "avx", "true" },
+        applyIf = { "MaxVectorSize", ">= 16" })
+    public static void testVectorMaskStoreIdentityShort() {
+        VectorMask<Short> mask_short_128 = VectorMask.fromArray(S128, mask_in, 0);
+
+        mask_short_128.cast(B64).intoArray(mask_out, 0);
+        verifyResult(S128.length());
+
+        mask_short_128.cast(B64).cast(S128).intoArray(mask_out, 0);
+        verifyResult(S128.length());
+
+        mask_short_128.cast(B64).cast(S128).cast(B64).intoArray(mask_out, 0);
+        verifyResult(S128.length());
+    }
+
+    @Test
+    @IR(counts = { IRNode.LOAD_VECTOR_Z, IRNode.VECTOR_SIZE_8, ">= 1",
+                   IRNode.VECTOR_LOAD_MASK, "= 0",
+                   IRNode.VECTOR_STORE_MASK, "= 0",
+                   IRNode.VECTOR_MASK_CAST, "= 0" },
+        applyIfCPUFeatureOr = { "sve", "true", "avx2", "true" },
+        applyIf = { "MaxVectorSize", "> 16" })
+    public static void testVectorMaskStoreIdentityShort256() {
+        VectorMask<Short> mask_short_128 = VectorMask.fromArray(S128, mask_in, 0);
+
+        mask_short_128.cast(I256).intoArray(mask_out, 0);
+        verifyResult(S128.length());
+
+        mask_short_128.cast(B64).cast(I256).intoArray(mask_out, 0);
+        verifyResult(S128.length());
+
+        mask_short_128.cast(F256).cast(B64).cast(I256).intoArray(mask_out, 0);
+        verifyResult(S128.length());
+    }
+
+    @Test
+    @IR(counts = { IRNode.LOAD_VECTOR_Z, IRNode.VECTOR_SIZE_4, ">= 1",
+                   IRNode.VECTOR_LOAD_MASK, "= 0",
+                   IRNode.VECTOR_STORE_MASK, "= 0",
+                   IRNode.VECTOR_MASK_CAST, "= 0" },
+        applyIfCPUFeatureOr = { "asimd", "true", "avx", "true" },
+        applyIf = { "MaxVectorSize", ">= 16" })
+    public static void testVectorMaskStoreIdentityInt() {
+        VectorMask<Integer> mask_int_128 = VectorMask.fromArray(I128, mask_in, 0);
+
+        mask_int_128.cast(F128).intoArray(mask_out, 0);
+        verifyResult(I128.length());
+
+        mask_int_128.cast(S64).cast(F128).intoArray(mask_out, 0);
+        verifyResult(I128.length());
+
+        mask_int_128.cast(F128).cast(I128).cast(S64).intoArray(mask_out, 0);
+        verifyResult(I128.length());
+    }
+
+    @Test
+    @IR(counts = { IRNode.LOAD_VECTOR_Z, IRNode.VECTOR_SIZE_4, ">= 1",
+                   IRNode.VECTOR_LOAD_MASK, "= 0",
+                   IRNode.VECTOR_STORE_MASK, "= 0",
+                   IRNode.VECTOR_MASK_CAST, "= 0" },
+        applyIfCPUFeatureOr = { "sve", "true", "avx2", "true" },
+        applyIf = { "MaxVectorSize", "> 16" })
+    public static void testVectorMaskStoreIdentityInt256() {
+        VectorMask<Integer> mask_int_128 = VectorMask.fromArray(I128, mask_in, 0);
+
+        mask_int_128.cast(F128).intoArray(mask_out, 0);
+        verifyResult(I128.length());
+
+        mask_int_128.cast(S64).cast(L256).intoArray(mask_out, 0);
+        verifyResult(I128.length());
+
+        mask_int_128.cast(L256).cast(S64).cast(F128).intoArray(mask_out, 0);
+        verifyResult(I128.length());
+    }
+
+    @Test
+    @IR(counts = { IRNode.LOAD_VECTOR_Z, IRNode.VECTOR_SIZE_2, ">= 1",
+                   IRNode.VECTOR_LOAD_MASK, "= 0",
+                   IRNode.VECTOR_STORE_MASK, "= 0",
+                   IRNode.VECTOR_MASK_CAST, "= 0" },
+        applyIfCPUFeatureOr = { "asimd", "true" },
+        applyIf = { "MaxVectorSize", ">= 16" })
+    public static void testVectorMaskStoreIdentityLong() {
+        VectorMask<Long> mask_long_128 = VectorMask.fromArray(L128, mask_in, 0);
+
+        mask_long_128.cast(D128).intoArray(mask_out, 0);
+        verifyResult(L128.length());
+
+        mask_long_128.cast(I64).cast(D128).intoArray(mask_out, 0);
+        verifyResult(L128.length());
+
+        mask_long_128.cast(I64).cast(D128).cast(I64).intoArray(mask_out, 0);
+        verifyResult(L128.length());
+    }
+
+    @Test
+    @IR(counts = { IRNode.LOAD_VECTOR_Z, IRNode.VECTOR_SIZE_4, ">= 1",
+                   IRNode.VECTOR_LOAD_MASK, "= 0",
+                   IRNode.VECTOR_STORE_MASK, "= 0",
+                   IRNode.VECTOR_MASK_CAST, "= 0" },
+        applyIfCPUFeatureOr = { "sve", "true", "avx2", "true" },
+        applyIf = { "MaxVectorSize", "> 16" })
+    public static void testVectorMaskStoreIdentityLong256() {
+        VectorMask<Long> mask_long_256 = VectorMask.fromArray(L256, mask_in, 0);
+
+        mask_long_256.cast(I128).intoArray(mask_out, 0);
+        verifyResult(L256.length());
+
+        mask_long_256.cast(S64).cast(I128).intoArray(mask_out, 0);
+        verifyResult(L256.length());
+
+        mask_long_256.cast(F128).cast(I128).cast(S64).intoArray(mask_out, 0);
+        verifyResult(L256.length());
+    }
+
+    @Test
+    @IR(counts = { IRNode.LOAD_VECTOR_Z, IRNode.VECTOR_SIZE_4, ">= 1",
+                   IRNode.VECTOR_LOAD_MASK, "= 0",
+                   IRNode.VECTOR_STORE_MASK, "= 0",
+                   IRNode.VECTOR_MASK_CAST, "= 0" },
+        applyIfCPUFeatureOr = { "asimd", "true", "avx", "true" },
+        applyIf = { "MaxVectorSize", ">= 16" })
+    public static void testVectorMaskStoreIdentityFloat() {
+        VectorMask<Float> mask_float_128 = VectorMask.fromArray(F128, mask_in, 0);
+
+        mask_float_128.cast(I128).intoArray(mask_out, 0);
+        verifyResult(F128.length());
+
+        mask_float_128.cast(S64).cast(I128).intoArray(mask_out, 0);
+        verifyResult(F128.length());
+
+        mask_float_128.cast(S64).cast(I128).cast(S64).intoArray(mask_out, 0);
+        verifyResult(F128.length());
+    }
+
+    @Test
+    @IR(counts = { IRNode.LOAD_VECTOR_Z, IRNode.VECTOR_SIZE_4, ">= 1",
+                   IRNode.VECTOR_LOAD_MASK, "= 0",
+                   IRNode.VECTOR_STORE_MASK, "= 0",
+                   IRNode.VECTOR_MASK_CAST, "= 0" },
+        applyIfCPUFeatureOr = { "sve", "true", "avx2", "true" },
+        applyIf = { "MaxVectorSize", "> 16" })
+    public static void testVectorMaskStoreIdentityFloat256() {
+        VectorMask<Float> mask_float_128 = VectorMask.fromArray(F128, mask_in, 0);
+
+        mask_float_128.cast(I128).intoArray(mask_out, 0);
+        verifyResult(F128.length());
+
+        mask_float_128.cast(S64).cast(L256).intoArray(mask_out, 0);
+        verifyResult(F128.length());
+
+        mask_float_128.cast(L256).cast(S64).cast(I128).intoArray(mask_out, 0);
+        verifyResult(F128.length());
+    }
+
+    @Test
+    @IR(counts = { IRNode.LOAD_VECTOR_Z, IRNode.VECTOR_SIZE_2, ">= 1",
+                   IRNode.VECTOR_LOAD_MASK, "= 0",
+                   IRNode.VECTOR_STORE_MASK, "= 0",
+                   IRNode.VECTOR_MASK_CAST, "= 0" },
+        applyIfCPUFeatureOr = { "asimd", "true" },
+        applyIf = { "MaxVectorSize", ">= 16" })
+    public static void testVectorMaskStoreIdentityDouble() {
+        VectorMask<Double> mask_double_128 = VectorMask.fromArray(D128, mask_in, 0);
+
+        mask_double_128.cast(L128).intoArray(mask_out, 0);
+        verifyResult(D128.length());
+
+        mask_double_128.cast(I64).cast(L128).intoArray(mask_out, 0);
+        verifyResult(D128.length());
+
+        mask_double_128.cast(I64).cast(L128).cast(I64).intoArray(mask_out, 0);
+        verifyResult(D128.length());
+    }
+
+    @Test
+    @IR(counts = { IRNode.LOAD_VECTOR_Z, IRNode.VECTOR_SIZE_4, ">= 1",
+                   IRNode.VECTOR_LOAD_MASK, "= 0",
+                   IRNode.VECTOR_STORE_MASK, "= 0",
+                   IRNode.VECTOR_MASK_CAST, "= 0" },
+        applyIfCPUFeatureOr = { "sve", "true", "avx2", "true" },
+        applyIf = { "MaxVectorSize", "> 16" })
+    public static void testVectorMaskStoreIdentityDouble256() {
+        VectorMask<Double> mask_double_256 = VectorMask.fromArray(D256, mask_in, 0);
+
+        mask_double_256.cast(F128).intoArray(mask_out, 0);
+        verifyResult(D256.length());
+
+        mask_double_256.cast(S64).cast(I128).intoArray(mask_out, 0);
+        verifyResult(D256.length());
+
+        mask_double_256.cast(I128).cast(S64).cast(L256).intoArray(mask_out, 0);
+        verifyResult(D256.length());
+    }
+
+    public static void main(String[] args) {
+        TestFramework testFramework = new TestFramework();
+        testFramework.setDefaultWarmup(10000)
+                     .addFlags("--add-modules=jdk.incubator.vector")
+                     .start();
+    }
+}
\ No newline at end of file
diff --git a/test/micro/org/openjdk/bench/jdk/incubator/vector/VectorStoreMaskBenchmark.java b/test/micro/org/openjdk/bench/jdk/incubator/vector/VectorStoreMaskBenchmark.java
new file mode 100644
index 00000000000..d4dc321ccba
--- /dev/null
+++ b/test/micro/org/openjdk/bench/jdk/incubator/vector/VectorStoreMaskBenchmark.java
@@ -0,0 +1,84 @@
+/*
+ *  Copyright (c) 2026, NVIDIA CORPORATION & AFFILIATES. All rights reserved.
+ *  DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ *  This code is free software; you can redistribute it and/or modify it
+ *  under the terms of the GNU General Public License version 2 only, as
+ *  published by the Free Software Foundation.
+ *
+ *  This code is distributed in the hope that it will be useful, but WITHOUT
+ *  ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ *  FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ *  version 2 for more details (a copy is included in the LICENSE file that
+ *  accompanied this code).
+ *
+ *  You should have received a copy of the GNU General Public License version
+ *  2 along with this work; if not, write to the Free Software Foundation,
+ *  Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ *  Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ *  or visit www.oracle.com if you need additional information or have any
+ *  questions.
+ *
+ */
+
+package org.openjdk.bench.jdk.incubator.vector;
+
+import jdk.incubator.vector.*;
+import java.util.concurrent.TimeUnit;
+import org.openjdk.jmh.annotations.*;
+
+@OutputTimeUnit(TimeUnit.MICROSECONDS)
+@State(Scope.Thread)
+@Warmup(iterations = 10, time = 1)
+@Measurement(iterations = 10, time = 1)
+@Fork(value = 1, jvmArgs = {"--add-modules=jdk.incubator.vector"})
+public class VectorStoreMaskBenchmark {
+    static final int LENGTH = 256;
+    static final boolean[] mask_arr_input = new boolean[LENGTH];
+    static final boolean[] mask_arr_output = new boolean[LENGTH];
+    static {
+        for (int i = 0; i < LENGTH; i++) {
+            mask_arr_input[i] = (i & 1) == 0;
+        }
+    }
+
+    @CompilerControl(CompilerControl.Mode.INLINE)
+    public <E, F> void maskLoadCastStoreKernel(VectorSpecies<E> species_from, VectorSpecies<F> species_to) {
+        for (int i = 0; i < LENGTH; i += species_from.length()) {
+            VectorMask<E> mask_from = VectorMask.fromArray(species_from, mask_arr_input, i);
+            VectorMask<F> mask_to = mask_from.cast(species_to);
+            mask_to.intoArray(mask_arr_output, i);
+        }
+    }
+
+    @Benchmark
+    public void microMaskLoadCastStoreByte64() {
+        maskLoadCastStoreKernel(ByteVector.SPECIES_64, ShortVector.SPECIES_128);
+    }
+
+    @Benchmark
+    public void microMaskLoadCastStoreShort64() {
+        maskLoadCastStoreKernel(ShortVector.SPECIES_64, IntVector.SPECIES_128);
+    }
+
+    @Benchmark
+    public void microMaskLoadCastStoreInt128() {
+        maskLoadCastStoreKernel(IntVector.SPECIES_128, ShortVector.SPECIES_64);
+    }
+
+    @Benchmark
+    public void microMaskLoadCastStoreLong128() {
+        maskLoadCastStoreKernel(LongVector.SPECIES_128, IntVector.SPECIES_64);
+    }
+
+    @Benchmark
+    public void microMaskLoadCastStoreFloat128() {
+        maskLoadCastStoreKernel(FloatVector.SPECIES_128, ShortVector.SPECIES_64);
+    }
+
+    @Benchmark
+    public void microMaskLoadCastStoreDouble128() {
+        maskLoadCastStoreKernel(DoubleVector.SPECIES_128, IntVector.SPECIES_64);
+    }
+}
\ No newline at end of file

From 23a08ee81e2cf9427cc569089f6d20ac210397a1 Mon Sep 17 00:00:00 2001
From: Andrew Dinn <adinn@openjdk.org>
Date: Wed, 15 Apr 2026 09:19:40 +0000
Subject: [PATCH 603/655] 8382039: Add support do_arch_array_entry() template

Reviewed-by: kvn, asmehra
---
 src/hotspot/cpu/aarch64/aarch64_vector.ad     |  8 +-
 .../cpu/aarch64/c2_MacroAssembler_aarch64.cpp | 43 +++++++---
 .../cpu/aarch64/c2_MacroAssembler_aarch64.hpp |  1 +
 .../cpu/aarch64/stubDeclarations_aarch64.hpp  | 22 +++--
 .../cpu/aarch64/stubGenerator_aarch64.cpp     | 32 +++++--
 .../cpu/aarch64/stubRoutines_aarch64.cpp      |  6 +-
 .../cpu/aarch64/stubRoutines_aarch64.hpp      | 17 +++-
 src/hotspot/cpu/arm/stubDeclarations_arm.hpp  | 15 ++--
 src/hotspot/cpu/arm/stubRoutines_arm.cpp      |  2 +-
 src/hotspot/cpu/arm/stubRoutines_arm.hpp      | 14 ++-
 src/hotspot/cpu/ppc/stubDeclarations_ppc.hpp  | 15 ++--
 .../cpu/riscv/stubDeclarations_riscv.hpp      | 15 ++--
 src/hotspot/cpu/riscv/stubRoutines_riscv.cpp  |  6 +-
 src/hotspot/cpu/riscv/stubRoutines_riscv.hpp  | 14 ++-
 .../cpu/s390/stubDeclarations_s390.hpp        | 15 ++--
 src/hotspot/cpu/s390/stubRoutines_s390.cpp    |  6 +-
 src/hotspot/cpu/s390/stubRoutines_s390.hpp    | 14 ++-
 src/hotspot/cpu/x86/c2_MacroAssembler_x86.cpp | 29 +++++--
 src/hotspot/cpu/x86/c2_MacroAssembler_x86.hpp |  1 +
 src/hotspot/cpu/x86/stubDeclarations_x86.hpp  | 22 +++--
 src/hotspot/cpu/x86/stubGenerator_x86_64.cpp  | 32 +++++--
 src/hotspot/cpu/x86/stubGenerator_x86_64.hpp  |  2 +-
 src/hotspot/cpu/x86/stubRoutines_x86.cpp      |  6 +-
 src/hotspot/cpu/x86/stubRoutines_x86.hpp      | 16 +++-
 .../cpu/zero/stubDeclarations_zero.hpp        | 15 ++--
 .../share/runtime/stubDeclarations.hpp        | 85 +++++++++++++------
 src/hotspot/share/runtime/stubInfo.cpp        | 16 +++-
 src/hotspot/share/runtime/stubInfo.hpp        | 15 +++-
 28 files changed, 355 insertions(+), 129 deletions(-)

diff --git a/src/hotspot/cpu/aarch64/aarch64_vector.ad b/src/hotspot/cpu/aarch64/aarch64_vector.ad
index 19f03d97a72..30b0c9c799b 100644
--- a/src/hotspot/cpu/aarch64/aarch64_vector.ad
+++ b/src/hotspot/cpu/aarch64/aarch64_vector.ad
@@ -597,13 +597,9 @@ instruct vloadcon(vReg dst, immI0 src) %{
     BasicType bt = Matcher::vector_element_basic_type(this);
     if (UseSVE == 0) {
       uint length_in_bytes = Matcher::vector_length_in_bytes(this);
+      int entry_idx = __ vector_iota_entry_index(bt);
       assert(length_in_bytes <= 16, "must be");
-      // The iota indices are ordered by type B/S/I/L/F/D, and the offset between two types is 16.
-      int offset = exact_log2(type2aelembytes(bt)) << 4;
-      if (is_floating_point_type(bt)) {
-        offset += 32;
-      }
-      __ lea(rscratch1, ExternalAddress(StubRoutines::aarch64::vector_iota_indices() + offset));
+      __ lea(rscratch1, ExternalAddress(StubRoutines::aarch64::vector_iota_indices(entry_idx)));
       if (length_in_bytes == 16) {
         __ ldrq($dst$$FloatRegister, rscratch1);
       } else {
diff --git a/src/hotspot/cpu/aarch64/c2_MacroAssembler_aarch64.cpp b/src/hotspot/cpu/aarch64/c2_MacroAssembler_aarch64.cpp
index 7aab7d389e1..bba37a7a390 100644
--- a/src/hotspot/cpu/aarch64/c2_MacroAssembler_aarch64.cpp
+++ b/src/hotspot/cpu/aarch64/c2_MacroAssembler_aarch64.cpp
@@ -2414,17 +2414,17 @@ void C2_MacroAssembler::neon_rearrange_hsd(FloatRegister dst, FloatRegister src,
       break;
     case T_LONG:
     case T_DOUBLE:
-      // Load the iota indices for Long type. The indices are ordered by
-      // type B/S/I/L/F/D, and the offset between two types is 16; Hence
-      // the offset for L is 48.
-      lea(rscratch1,
-          ExternalAddress(StubRoutines::aarch64::vector_iota_indices() + 48));
-      ldrq(tmp, rscratch1);
-      // Check whether the input "shuffle" is the same with iota indices.
-      // Return "src" if true, otherwise swap the two elements of "src".
-      cm(EQ, dst, size2, shuffle, tmp);
-      ext(tmp, size1, src, src, 8);
-      bsl(dst, size1, src, tmp);
+      {
+        int idx = vector_iota_entry_index(T_LONG);
+        lea(rscratch1,
+            ExternalAddress(StubRoutines::aarch64::vector_iota_indices(idx)));
+        ldrq(tmp, rscratch1);
+        // Check whether the input "shuffle" is the same with iota indices.
+        // Return "src" if true, otherwise swap the two elements of "src".
+        cm(EQ, dst, size2, shuffle, tmp);
+        ext(tmp, size1, src, src, 8);
+        bsl(dst, size1, src, tmp);
+      }
       break;
     default:
       assert(false, "unsupported element type");
@@ -2896,3 +2896,24 @@ void C2_MacroAssembler::sve_cpy(FloatRegister dst, SIMD_RegVariant T,
   }
   Assembler::sve_cpy(dst, T, pg, imm8, isMerge);
 }
+
+int C2_MacroAssembler::vector_iota_entry_index(BasicType bt) {
+  // The vector iota entries array is ordered by type B/S/I/L/F/D, and
+  // the offset between two types is 16.
+  switch(bt) {
+  case T_BYTE:
+    return 0;
+  case T_SHORT:
+    return 1;
+  case T_INT:
+    return 2;
+  case T_LONG:
+    return 3;
+  case T_FLOAT:
+    return 4;
+  case T_DOUBLE:
+    return 5;
+  default:
+    ShouldNotReachHere();
+  }
+}
diff --git a/src/hotspot/cpu/aarch64/c2_MacroAssembler_aarch64.hpp b/src/hotspot/cpu/aarch64/c2_MacroAssembler_aarch64.hpp
index 5c05832afbe..5964bb60d4f 100644
--- a/src/hotspot/cpu/aarch64/c2_MacroAssembler_aarch64.hpp
+++ b/src/hotspot/cpu/aarch64/c2_MacroAssembler_aarch64.hpp
@@ -249,4 +249,5 @@
 
   void sve_cpy(FloatRegister dst, SIMD_RegVariant T, PRegister pg, int imm8,
                bool isMerge);
+  int vector_iota_entry_index(BasicType bt);
 #endif // CPU_AARCH64_C2_MACROASSEMBLER_AARCH64_HPP
diff --git a/src/hotspot/cpu/aarch64/stubDeclarations_aarch64.hpp b/src/hotspot/cpu/aarch64/stubDeclarations_aarch64.hpp
index 9dac6a39b82..d1f59e479db 100644
--- a/src/hotspot/cpu/aarch64/stubDeclarations_aarch64.hpp
+++ b/src/hotspot/cpu/aarch64/stubDeclarations_aarch64.hpp
@@ -29,32 +29,39 @@
 #define STUBGEN_PREUNIVERSE_BLOBS_ARCH_DO(do_stub,                      \
                                           do_arch_blob,                 \
                                           do_arch_entry,                \
-                                          do_arch_entry_init)           \
+                                          do_arch_entry_init,           \
+                                          do_arch_entry_array)          \
   do_arch_blob(preuniverse, 0)                                          \
 
 
 #define STUBGEN_INITIAL_BLOBS_ARCH_DO(do_stub,                          \
                                       do_arch_blob,                     \
                                       do_arch_entry,                    \
-                                      do_arch_entry_init)               \
+                                      do_arch_entry_init,               \
+                                      do_arch_entry_array)              \
   do_arch_blob(initial, 10000)                                          \
 
 
 #define STUBGEN_CONTINUATION_BLOBS_ARCH_DO(do_stub,                     \
                                            do_arch_blob,                \
                                            do_arch_entry,               \
-                                           do_arch_entry_init)          \
+                                           do_arch_entry_init,          \
+                                           do_arch_entry_array)         \
   do_arch_blob(continuation, 2000)                                      \
 
+// count needed for declaration of vector_iota_indices stub
+#define VECTOR_IOTA_COUNT 6
 
 #define STUBGEN_COMPILER_BLOBS_ARCH_DO(do_stub,                         \
                                        do_arch_blob,                    \
                                        do_arch_entry,                   \
-                                       do_arch_entry_init)              \
+                                       do_arch_entry_init,              \
+                                       do_arch_entry_array)             \
   do_arch_blob(compiler, 70000)                                         \
   do_stub(compiler, vector_iota_indices)                                \
-  do_arch_entry(aarch64, compiler, vector_iota_indices,                 \
-                vector_iota_indices, vector_iota_indices)               \
+  do_arch_entry_array(aarch64, compiler, vector_iota_indices,           \
+                      vector_iota_indices, vector_iota_indices,         \
+                      VECTOR_IOTA_COUNT)                                \
   do_stub(compiler, large_array_equals)                                 \
   do_arch_entry(aarch64, compiler, large_array_equals,                  \
                 large_array_equals, large_array_equals)                 \
@@ -115,7 +122,8 @@
 #define STUBGEN_FINAL_BLOBS_ARCH_DO(do_stub,                            \
                                     do_arch_blob,                       \
                                     do_arch_entry,                      \
-                                    do_arch_entry_init)                 \
+                                    do_arch_entry_init,                 \
+                                    do_arch_entry_array)                \
   do_arch_blob(final, 20000 ZGC_ONLY(+85000))                           \
   do_stub(final, copy_byte_f)                                           \
   do_arch_entry(aarch64, final, copy_byte_f, copy_byte_f,               \
diff --git a/src/hotspot/cpu/aarch64/stubGenerator_aarch64.cpp b/src/hotspot/cpu/aarch64/stubGenerator_aarch64.cpp
index 32fd8afb268..5d9b2f1d826 100644
--- a/src/hotspot/cpu/aarch64/stubGenerator_aarch64.cpp
+++ b/src/hotspot/cpu/aarch64/stubGenerator_aarch64.cpp
@@ -819,12 +819,19 @@ class StubGenerator: public StubCodeGenerator {
   }
 
   // Generate indices for iota vector.
-  address generate_iota_indices(StubId stub_id) {
+  void generate_iota_indices(StubId stub_id) {
+    GrowableArray<address> entries;
     int entry_count = StubInfo::entry_count(stub_id);
-    assert(entry_count == 1, "sanity check");
-    address start = load_archive_data(stub_id);
+    assert(entry_count == VECTOR_IOTA_COUNT, "sanity check");
+    address start = load_archive_data(stub_id, &entries);
     if (start != nullptr) {
-      return start;
+      assert(entries.length() == entry_count - 1,
+             "unexpected entries count %d", entries.length());
+      StubRoutines::aarch64::_vector_iota_indices[0] = start;
+      for (int i = 1; i < VECTOR_IOTA_COUNT; i++) {
+        StubRoutines::aarch64::_vector_iota_indices[i] = entries.at(i - 1);
+      }
+      return;
     }
     __ align(CodeEntryAlignment);
     StubCodeMark mark(this, stub_id);
@@ -832,26 +839,37 @@ class StubGenerator: public StubCodeGenerator {
     // B
     __ emit_data64(0x0706050403020100, relocInfo::none);
     __ emit_data64(0x0F0E0D0C0B0A0908, relocInfo::none);
+    entries.append(__ pc());
     // H
     __ emit_data64(0x0003000200010000, relocInfo::none);
     __ emit_data64(0x0007000600050004, relocInfo::none);
+    entries.append(__ pc());
     // S
     __ emit_data64(0x0000000100000000, relocInfo::none);
     __ emit_data64(0x0000000300000002, relocInfo::none);
+    entries.append(__ pc());
     // D
     __ emit_data64(0x0000000000000000, relocInfo::none);
     __ emit_data64(0x0000000000000001, relocInfo::none);
+    entries.append(__ pc());
     // S - FP
     __ emit_data64(0x3F80000000000000, relocInfo::none); // 0.0f, 1.0f
     __ emit_data64(0x4040000040000000, relocInfo::none); // 2.0f, 3.0f
+    entries.append(__ pc());
     // D - FP
     __ emit_data64(0x0000000000000000, relocInfo::none); // 0.0d
     __ emit_data64(0x3FF0000000000000, relocInfo::none); // 1.0d
 
     // record the stub entry and end
-    store_archive_data(stub_id, start, __ pc());
+    store_archive_data(stub_id, start, __ pc(), &entries);
 
-    return start;
+    // install the entry addresses in the entry array
+    assert(entries.length() == entry_count - 1,
+           "unexpected entries count %d", entries.length());
+    StubRoutines::aarch64::_vector_iota_indices[0] = start;
+    for (int i = 1; i < VECTOR_IOTA_COUNT; i++) {
+      StubRoutines::aarch64::_vector_iota_indices[i] = entries.at(i - 1);
+    }
   }
 
   // The inner part of zero_words().  This is the bulk operation,
@@ -12621,7 +12639,7 @@ class StubGenerator: public StubCodeGenerator {
 #if COMPILER2_OR_JVMCI
 
     if (UseSVE == 0) {
-      StubRoutines::aarch64::_vector_iota_indices = generate_iota_indices(StubId::stubgen_vector_iota_indices_id);
+      generate_iota_indices(StubId::stubgen_vector_iota_indices_id);
     }
 
     // array equals stub for large arrays.
diff --git a/src/hotspot/cpu/aarch64/stubRoutines_aarch64.cpp b/src/hotspot/cpu/aarch64/stubRoutines_aarch64.cpp
index 35ec22b0897..aaf31d4f911 100644
--- a/src/hotspot/cpu/aarch64/stubRoutines_aarch64.cpp
+++ b/src/hotspot/cpu/aarch64/stubRoutines_aarch64.cpp
@@ -41,8 +41,12 @@ static void empty_spin_wait() { }
 #define DEFINE_ARCH_ENTRY_INIT(arch, blob_name, stub_name, field_name, getter_name, init_function) \
   address StubRoutines:: arch :: STUB_FIELD_NAME(field_name)  = CAST_FROM_FN_PTR(address, init_function);
 
-STUBGEN_ARCH_ENTRIES_DO(DEFINE_ARCH_ENTRY, DEFINE_ARCH_ENTRY_INIT)
+#define DEFINE_ARCH_ENTRY_ARRAY(arch, blob_name, stub_name, field_name, getter_name, count) \
+  address StubRoutines:: arch :: STUB_FIELD_NAME(field_name)  [count];
 
+STUBGEN_ARCH_ENTRIES_DO(DEFINE_ARCH_ENTRY, DEFINE_ARCH_ENTRY_INIT, DEFINE_ARCH_ENTRY_ARRAY)
+
+#undef DEFINE_ARCH_ENTRY_ARARAY
 #undef DEFINE_ARCH_ENTRY_INIT
 #undef DEFINE_ARCH_ENTRY
 
diff --git a/src/hotspot/cpu/aarch64/stubRoutines_aarch64.hpp b/src/hotspot/cpu/aarch64/stubRoutines_aarch64.hpp
index f77192a3741..6067408ef13 100644
--- a/src/hotspot/cpu/aarch64/stubRoutines_aarch64.hpp
+++ b/src/hotspot/cpu/aarch64/stubRoutines_aarch64.hpp
@@ -60,9 +60,13 @@ class aarch64 {
 #define DECLARE_ARCH_ENTRY_INIT(arch, blob_name, stub_name, field_name, getter_name, init_function) \
   DECLARE_ARCH_ENTRY(arch, blob_name, stub_name, field_name, getter_name)
 
-private:
-  STUBGEN_ARCH_ENTRIES_DO(DECLARE_ARCH_ENTRY, DECLARE_ARCH_ENTRY_INIT)
+#define DECLARE_ARCH_ENTRY_ARRAY(arch, blob_name, stub_name, field_name, getter_name, count) \
+  static address STUB_FIELD_NAME(field_name) [count];
 
+private:
+  STUBGEN_ARCH_ENTRIES_DO(DECLARE_ARCH_ENTRY, DECLARE_ARCH_ENTRY_INIT, DECLARE_ARCH_ENTRY_ARRAY)
+
+#undef DECLARE_ARCH_ENTRY_ARRAY
 #undef DECLARE_ARCH_ENTRY_INIT
 #undef DECLARE_ARCH_ENTRY
 
@@ -78,8 +82,15 @@ private:
 #define DEFINE_ARCH_ENTRY_GETTER_INIT(arch, blob_name, stub_name, field_name, getter_name, init_function) \
   DEFINE_ARCH_ENTRY_GETTER(arch, blob_name, stub_name, field_name, getter_name)
 
-  STUBGEN_ARCH_ENTRIES_DO(DEFINE_ARCH_ENTRY_GETTER, DEFINE_ARCH_ENTRY_GETTER_INIT)
+#define DEFINE_ARCH_ENTRY_GETTER_ARRAY(arch, blob_name, stub_name, field_name, getter_name, count) \
+  static address getter_name(int idx) {                                 \
+    assert(0 <= idx && idx < count, "entry array index out of range");  \
+    return STUB_FIELD_NAME(field_name) [idx];                           \
+  }
 
+  STUBGEN_ARCH_ENTRIES_DO(DEFINE_ARCH_ENTRY_GETTER, DEFINE_ARCH_ENTRY_GETTER_INIT, DEFINE_ARCH_ENTRY_GETTER_ARRAY)
+
+#undef DEFINE_ARCH_ENTRY_GETTER_ARRAY
 #undef DEFINE_ARCH_ENTRY_GETTER_INIT
 #undef DEFINE_ARCH_ENTRY_GETTER
 
diff --git a/src/hotspot/cpu/arm/stubDeclarations_arm.hpp b/src/hotspot/cpu/arm/stubDeclarations_arm.hpp
index 5f768a205a5..5fb0d4e901f 100644
--- a/src/hotspot/cpu/arm/stubDeclarations_arm.hpp
+++ b/src/hotspot/cpu/arm/stubDeclarations_arm.hpp
@@ -29,7 +29,8 @@
 #define STUBGEN_PREUNIVERSE_BLOBS_ARCH_DO(do_stub,                      \
                                           do_arch_blob,                 \
                                           do_arch_entry,                \
-                                          do_arch_entry_init)           \
+                                          do_arch_entry_init,           \
+                                          do_arch_entry_array)          \
   do_arch_blob(preuniverse, 500)                                        \
   do_stub(preuniverse, atomic_load_long)                                \
   do_arch_entry(Arm, preuniverse, atomic_load_long,                     \
@@ -42,7 +43,8 @@
 #define STUBGEN_INITIAL_BLOBS_ARCH_DO(do_stub,                          \
                                       do_arch_blob,                     \
                                       do_arch_entry,                    \
-                                      do_arch_entry_init)               \
+                                      do_arch_entry_init,               \
+                                      do_arch_entry_array)              \
   do_arch_blob(initial, 9000)                                           \
   do_stub(initial, idiv_irem)                                           \
   do_arch_entry(Arm, initial, idiv_irem,                                \
@@ -51,14 +53,16 @@
 #define STUBGEN_CONTINUATION_BLOBS_ARCH_DO(do_stub,                     \
                                            do_arch_blob,                \
                                            do_arch_entry,               \
-                                           do_arch_entry_init)          \
+                                           do_arch_entry_init,          \
+                                           do_arch_entry_array)         \
   do_arch_blob(continuation, 2000)                                      \
 
 
 #define STUBGEN_COMPILER_BLOBS_ARCH_DO(do_stub,                         \
                                        do_arch_blob,                    \
                                        do_arch_entry,                   \
-                                       do_arch_entry_init)              \
+                                       do_arch_entry_init,              \
+                                       do_arch_entry_array)             \
   do_arch_blob(compiler, 22000)                                         \
   do_stub(compiler, partial_subtype_check)                              \
   do_arch_entry(Arm, compiler, partial_subtype_check,                   \
@@ -68,7 +72,8 @@
 #define STUBGEN_FINAL_BLOBS_ARCH_DO(do_stub,                            \
                                     do_arch_blob,                       \
                                     do_arch_entry,                      \
-                                    do_arch_entry_init)                 \
+                                    do_arch_entry_init,                 \
+                                    do_arch_entry_array)                \
   do_arch_blob(final, 22000)                                            \
 
 
diff --git a/src/hotspot/cpu/arm/stubRoutines_arm.cpp b/src/hotspot/cpu/arm/stubRoutines_arm.cpp
index 3ed747ea11a..38a9b298562 100644
--- a/src/hotspot/cpu/arm/stubRoutines_arm.cpp
+++ b/src/hotspot/cpu/arm/stubRoutines_arm.cpp
@@ -32,7 +32,7 @@
 #define DEFINE_ARCH_ENTRY_INIT(arch, blob_name, stub_name, field_name, getter_name, init_function) \
   address StubRoutines:: arch :: STUB_FIELD_NAME(field_name)  = CAST_FROM_FN_PTR(address, init_function);
 
-STUBGEN_ARCH_ENTRIES_DO(DEFINE_ARCH_ENTRY, DEFINE_ARCH_ENTRY_INIT)
+STUBGEN_ARCH_ENTRIES_DO(DEFINE_ARCH_ENTRY, DEFINE_ARCH_ENTRY_INIT, DEFINE_ARCH_ENTRY_ARRAY)
 
 #undef DEFINE_ARCH_ENTRY_INIT
 #undef DEFINE_ARCH_ENTRY
diff --git a/src/hotspot/cpu/arm/stubRoutines_arm.hpp b/src/hotspot/cpu/arm/stubRoutines_arm.hpp
index 45ab10d14f9..29d96d0e653 100644
--- a/src/hotspot/cpu/arm/stubRoutines_arm.hpp
+++ b/src/hotspot/cpu/arm/stubRoutines_arm.hpp
@@ -55,9 +55,13 @@ class Arm {
 #define DECLARE_ARCH_ENTRY_INIT(arch, blob_name, stub_name, field_name, getter_name, init_function) \
   DECLARE_ARCH_ENTRY(arch, blob_name, stub_name, field_name, getter_name)
 
-private:
-  STUBGEN_ARCH_ENTRIES_DO(DECLARE_ARCH_ENTRY, DECLARE_ARCH_ENTRY_INIT)
+#define DECLARE_ARCH_ENTRY_ARRAY(arch, blob_name, stub_name, field_name, getter_name, count) \
+  static address STUB_FIELD_NAME(field_name) [count] ;
 
+private:
+  STUBGEN_ARCH_ENTRIES_DO(DECLARE_ARCH_ENTRY, DECLARE_ARCH_ENTRY_INIT, DECLARE_ARCH_ENTRY_ARRAY)
+
+#undef DECLARE_ARCH_ENTRY_ARRAY
 #undef DECLARE_ARCH_ENTRY_INIT
 #undef DECLARE_ARCH_ENTRY
 
@@ -71,8 +75,12 @@ public:
 #define DEFINE_ARCH_ENTRY_GETTER_INIT(arch, blob_name, stub_name, field_name, getter_name, init_function) \
   DEFINE_ARCH_ENTRY_GETTER(arch, blob_name, stub_name, field_name, getter_name)
 
-  STUBGEN_ARCH_ENTRIES_DO(DEFINE_ARCH_ENTRY_GETTER, DEFINE_ARCH_ENTRY_GETTER_INIT)
+#define DEFINE_ARCH_ENTRY_GETTER_ARRAY(arch, blob_name, stub_name, field_name, getter_name, count) \
+  static address getter_name(int idx) { return STUB_FIELD_NAME(field_name) [idx] ; }
 
+  STUBGEN_ARCH_ENTRIES_DO(DEFINE_ARCH_ENTRY_GETTER, DEFINE_ARCH_ENTRY_GETTER_INIT, DEFINE_ARCH_ENTRY_GETTER_ARRAY)
+
+#undef DEFINE_ARCH_ENTRY_GETTER_ARRAY
 #undef DEFINE_ARCH_ENTRY_GETTER_INIT
 #undef DEFINE_ARCH_ENTRY_GETTER
 
diff --git a/src/hotspot/cpu/ppc/stubDeclarations_ppc.hpp b/src/hotspot/cpu/ppc/stubDeclarations_ppc.hpp
index be51afe42a4..41b8b71486d 100644
--- a/src/hotspot/cpu/ppc/stubDeclarations_ppc.hpp
+++ b/src/hotspot/cpu/ppc/stubDeclarations_ppc.hpp
@@ -29,35 +29,40 @@
 #define STUBGEN_PREUNIVERSE_BLOBS_ARCH_DO(do_stub,                      \
                                           do_arch_blob,                 \
                                           do_arch_entry,                \
-                                          do_arch_entry_init)           \
+                                          do_arch_entry_init,           \
+                                          do_arch_entry_array)          \
   do_arch_blob(preuniverse, 0)                                          \
 
 
 #define STUBGEN_INITIAL_BLOBS_ARCH_DO(do_stub,                          \
                                       do_arch_blob,                     \
                                       do_arch_entry,                    \
-                                      do_arch_entry_init)               \
+                                      do_arch_entry_init,               \
+                                      do_arch_entry_array)              \
   do_arch_blob(initial, 20000)                                          \
 
 
 #define STUBGEN_CONTINUATION_BLOBS_ARCH_DO(do_stub,                     \
                                            do_arch_blob,                \
                                            do_arch_entry,               \
-                                           do_arch_entry_init)          \
+                                           do_arch_entry_init,          \
+                                           do_arch_entry_array)         \
   do_arch_blob(continuation, 2000)                                      \
 
 
 #define STUBGEN_COMPILER_BLOBS_ARCH_DO(do_stub,                         \
                                        do_arch_blob,                    \
                                        do_arch_entry,                   \
-                                       do_arch_entry_init)              \
+                                       do_arch_entry_init,              \
+                                       do_arch_entry_array)             \
   do_arch_blob(compiler, 24000)                                         \
 
 
 #define STUBGEN_FINAL_BLOBS_ARCH_DO(do_stub,                            \
                                     do_arch_blob,                       \
                                     do_arch_entry,                      \
-                                    do_arch_entry_init)                 \
+                                    do_arch_entry_init,                 \
+                                    do_arch_entry_array)                \
   do_arch_blob(final, 24000)                                            \
 
 
diff --git a/src/hotspot/cpu/riscv/stubDeclarations_riscv.hpp b/src/hotspot/cpu/riscv/stubDeclarations_riscv.hpp
index f977d759d20..890e354fd27 100644
--- a/src/hotspot/cpu/riscv/stubDeclarations_riscv.hpp
+++ b/src/hotspot/cpu/riscv/stubDeclarations_riscv.hpp
@@ -29,28 +29,32 @@
 #define STUBGEN_PREUNIVERSE_BLOBS_ARCH_DO(do_stub,                      \
                                           do_arch_blob,                 \
                                           do_arch_entry,                \
-                                          do_arch_entry_init)           \
+                                          do_arch_entry_init,           \
+                                          do_arch_entry_array)          \
   do_arch_blob(preuniverse, 0)                                          \
 
 
 #define STUBGEN_INITIAL_BLOBS_ARCH_DO(do_stub,                          \
                                       do_arch_blob,                     \
                                       do_arch_entry,                    \
-                                      do_arch_entry_init)               \
+                                      do_arch_entry_init,               \
+                                      do_arch_entry_array)              \
   do_arch_blob(initial, 10000)                                          \
 
 
 #define STUBGEN_CONTINUATION_BLOBS_ARCH_DO(do_stub,                     \
                                            do_arch_blob,                \
                                            do_arch_entry,               \
-                                           do_arch_entry_init)          \
+                                           do_arch_entry_init,          \
+                                           do_arch_entry_array)         \
   do_arch_blob(continuation, 2000)                                      \
 
 
 #define STUBGEN_COMPILER_BLOBS_ARCH_DO(do_stub,                         \
                                        do_arch_blob,                    \
                                        do_arch_entry,                   \
-                                       do_arch_entry_init)              \
+                                       do_arch_entry_init,              \
+                                       do_arch_entry_array)             \
   do_arch_blob(compiler, 45000)                                         \
   do_stub(compiler, compare_long_string_LL)                             \
   do_arch_entry(riscv, compiler, compare_long_string_LL,                \
@@ -81,7 +85,8 @@
 #define STUBGEN_FINAL_BLOBS_ARCH_DO(do_stub,                            \
                                     do_arch_blob,                       \
                                     do_arch_entry,                      \
-                                    do_arch_entry_init)                 \
+                                    do_arch_entry_init,                 \
+                                    do_arch_entry_array)                \
   do_arch_blob(final, 20000 ZGC_ONLY(+10000))                           \
   do_stub(final, copy_byte_f)                                           \
   do_arch_entry(riscv, final, copy_byte_f, copy_byte_f,                 \
diff --git a/src/hotspot/cpu/riscv/stubRoutines_riscv.cpp b/src/hotspot/cpu/riscv/stubRoutines_riscv.cpp
index 51e31aa3672..b7f69eff9fa 100644
--- a/src/hotspot/cpu/riscv/stubRoutines_riscv.cpp
+++ b/src/hotspot/cpu/riscv/stubRoutines_riscv.cpp
@@ -42,8 +42,12 @@
 #define DEFINE_ARCH_ENTRY_INIT(arch, blob_name, stub_name, field_name, getter_name, init_function) \
   address StubRoutines:: arch :: STUB_FIELD_NAME(field_name)  = CAST_FROM_FN_PTR(address, init_function);
 
-STUBGEN_ARCH_ENTRIES_DO(DEFINE_ARCH_ENTRY, DEFINE_ARCH_ENTRY_INIT)
+#define DEFINE_ARCH_ENTRY_ARRAY(arch, blob_name, stub_name, field_name, getter_name, count) \
+  address StubRoutines:: arch :: STUB_FIELD_NAME(field_name)  [count] ;
 
+STUBGEN_ARCH_ENTRIES_DO(DEFINE_ARCH_ENTRY, DEFINE_ARCH_ENTRY_INIT, DEFINE_ARCH_ENTRY_ARRAY)
+
+#undef DEFINE_ARCH_ENTRY_ARRAY
 #undef DEFINE_ARCH_ENTRY_INIT
 #undef DEFINE_ARCH_ENTRY
 
diff --git a/src/hotspot/cpu/riscv/stubRoutines_riscv.hpp b/src/hotspot/cpu/riscv/stubRoutines_riscv.hpp
index 2c4e7210413..ec67a338052 100644
--- a/src/hotspot/cpu/riscv/stubRoutines_riscv.hpp
+++ b/src/hotspot/cpu/riscv/stubRoutines_riscv.hpp
@@ -61,9 +61,13 @@ class riscv {
 #define DECLARE_ARCH_ENTRY_INIT(arch, blob_name, stub_name, field_name, getter_name, init_function) \
   DECLARE_ARCH_ENTRY(arch, blob_name, stub_name, field_name, getter_name)
 
-private:
-  STUBGEN_ARCH_ENTRIES_DO(DECLARE_ARCH_ENTRY, DECLARE_ARCH_ENTRY_INIT)
+#define DECLARE_ARCH_ENTRY_ARRAY(arch, blob_name, stub_name, field_name, getter_name, count) \
+  static address STUB_FIELD_NAME(field_name) [count] ;
 
+private:
+  STUBGEN_ARCH_ENTRIES_DO(DECLARE_ARCH_ENTRY, DECLARE_ARCH_ENTRY_INIT, DECLARE_ARCH_ENTRY_ARRAY)
+
+#undef DECLARE_ARCH_ENTRY_ARRAY
 #undef DECLARE_ARCH_ENTRY_INIT
 #undef DECLARE_ARCH_ENTRY
 
@@ -79,8 +83,12 @@ private:
 #define DEFINE_ARCH_ENTRY_GETTER_INIT(arch, blob_name, stub_name, field_name, getter_name, init_function) \
   DEFINE_ARCH_ENTRY_GETTER(arch, blob_name, stub_name, field_name, getter_name)
 
-  STUBGEN_ARCH_ENTRIES_DO(DEFINE_ARCH_ENTRY_GETTER, DEFINE_ARCH_ENTRY_GETTER_INIT)
+#define DEFINE_ARCH_ENTRY_GETTER_ARRAY(arch, blob_name, stub_name, field_name, getter_name, count) \
+  static address getter_name(int idx) { return STUB_FIELD_NAME(field_name) [idx] ; }
 
+  STUBGEN_ARCH_ENTRIES_DO(DEFINE_ARCH_ENTRY_GETTER, DEFINE_ARCH_ENTRY_GETTER_INIT, DEFINE_ARCH_ENTRY_GETTER_ARRAY)
+
+#undef DEFINE_ARCH_ENTRY_GETTER_ARRAY
 #undef DEFINE_ARCH_ENTRY_GETTER_INIT
 #undef DEFINE_ARCH_ENTRY_GETTER
 
diff --git a/src/hotspot/cpu/s390/stubDeclarations_s390.hpp b/src/hotspot/cpu/s390/stubDeclarations_s390.hpp
index c3ad3cefeb9..d0e26beedab 100644
--- a/src/hotspot/cpu/s390/stubDeclarations_s390.hpp
+++ b/src/hotspot/cpu/s390/stubDeclarations_s390.hpp
@@ -29,28 +29,32 @@
 #define STUBGEN_PREUNIVERSE_BLOBS_ARCH_DO(do_stub,                      \
                                           do_arch_blob,                 \
                                           do_arch_entry,                \
-                                          do_arch_entry_init)           \
+                                          do_arch_entry_init,           \
+                                          do_arch_entry_array)          \
   do_arch_blob(preuniverse, 0)                                          \
 
 
 #define STUBGEN_INITIAL_BLOBS_ARCH_DO(do_stub,                          \
                                       do_arch_blob,                     \
                                       do_arch_entry,                    \
-                                      do_arch_entry_init)               \
+                                      do_arch_entry_init,               \
+                                      do_arch_entry_array)              \
   do_arch_blob(initial, 20000)                                          \
 
 
 #define STUBGEN_CONTINUATION_BLOBS_ARCH_DO(do_stub,                     \
                                            do_arch_blob,                \
                                            do_arch_entry,               \
-                                           do_arch_entry_init)          \
+                                           do_arch_entry_init,          \
+                                           do_arch_entry_array)         \
   do_arch_blob(continuation, 2000)                                      \
 
 
 #define STUBGEN_COMPILER_BLOBS_ARCH_DO(do_stub,                         \
                                        do_arch_blob,                    \
                                        do_arch_entry,                   \
-                                       do_arch_entry_init)              \
+                                       do_arch_entry_init,              \
+                                       do_arch_entry_array)             \
   do_arch_blob(compiler, 20000 )                                        \
   do_stub(compiler, partial_subtype_check)                              \
   do_arch_entry(zarch, compiler, partial_subtype_check,                 \
@@ -60,7 +64,8 @@
 #define STUBGEN_FINAL_BLOBS_ARCH_DO(do_stub,                            \
                                     do_arch_blob,                       \
                                     do_arch_entry,                      \
-                                    do_arch_entry_init)                 \
+                                    do_arch_entry_init,                 \
+                                    do_arch_entry_array)                \
   do_arch_blob(final, 20000)                                            \
 
 
diff --git a/src/hotspot/cpu/s390/stubRoutines_s390.cpp b/src/hotspot/cpu/s390/stubRoutines_s390.cpp
index 3db4995338d..eda0ebfdecc 100644
--- a/src/hotspot/cpu/s390/stubRoutines_s390.cpp
+++ b/src/hotspot/cpu/s390/stubRoutines_s390.cpp
@@ -40,8 +40,12 @@
 #define DEFINE_ARCH_ENTRY_INIT(arch, blob_name, stub_name, field_name, getter_name, init_function) \
   address StubRoutines:: arch :: STUB_FIELD_NAME(field_name)  = CAST_FROM_FN_PTR(address, init_function);
 
-STUBGEN_ARCH_ENTRIES_DO(DEFINE_ARCH_ENTRY, DEFINE_ARCH_ENTRY_INIT)
+#define DEFINE_ARCH_ENTRY_ARRAY(arch, blob_name, stub_name, field_name, getter_name, count) \
+  address StubRoutines:: arch :: STUB_FIELD_NAME(field_name) [idx] ;
 
+STUBGEN_ARCH_ENTRIES_DO(DEFINE_ARCH_ENTRY, DEFINE_ARCH_ENTRY_INIT, DEFINE_ARCH_ENTRY_ARRAY)
+
+#undef DEFINE_ARCH_ENTRY_ARRAY
 #undef DEFINE_ARCH_ENTRY_INIT
 #undef DEFINE_ARCH_ENTRY
 
diff --git a/src/hotspot/cpu/s390/stubRoutines_s390.hpp b/src/hotspot/cpu/s390/stubRoutines_s390.hpp
index 0a07efae46c..e575115b731 100644
--- a/src/hotspot/cpu/s390/stubRoutines_s390.hpp
+++ b/src/hotspot/cpu/s390/stubRoutines_s390.hpp
@@ -81,9 +81,13 @@ class zarch {
 #define DECLARE_ARCH_ENTRY_INIT(arch, blob_name, stub_name, field_name, getter_name, init_function) \
   DECLARE_ARCH_ENTRY(arch, blob_name, stub_name, field_name, getter_name)
 
-private:
-  STUBGEN_ARCH_ENTRIES_DO(DECLARE_ARCH_ENTRY, DECLARE_ARCH_ENTRY_INIT)
+#define DECLARE_ARCH_ENTRY_ARRAY(arch, blob_name, stub_name, field_name, getter_name, count) \
+  static address STUB_FIELD_NAME(field_name) [count] ;
 
+private:
+  STUBGEN_ARCH_ENTRIES_DO(DECLARE_ARCH_ENTRY, DECLARE_ARCH_ENTRY_INIT, DECLARE_ARCH_ENTRY_ARRAY)
+
+#undef DECLARE_ARCH_ENTRY_ARRAY
 #undef DECLARE_ARCH_ENTRY_INIT
 #undef DECLARE_ARCH_ENTRY
 
@@ -108,8 +112,12 @@ private:
 #define DEFINE_ARCH_ENTRY_GETTER_INIT(arch, blob_name, stub_name, field_name, getter_name, init_function) \
   DEFINE_ARCH_ENTRY_GETTER(arch, blob_name, stub_name, field_name, getter_name)
 
-  STUBGEN_ARCH_ENTRIES_DO(DEFINE_ARCH_ENTRY_GETTER, DEFINE_ARCH_ENTRY_GETTER_INIT)
+#define DEFINE_ARCH_ENTRY_GETTER_ARRAY(arch, blob_name, stub_name, field_name, getter_name, count) \
+  static address getter_name(int idx) { return STUB_FIELD_NAME(field_name) [idx] ; }
 
+  STUBGEN_ARCH_ENTRIES_DO(DEFINE_ARCH_ENTRY_GETTER, DEFINE_ARCH_ENTRY_GETTER_INIT, DEFINE_ARCH_ENTRY_GETTER_ARRAY)
+
+#undef DEFINE_ARCH_ENTRY_GETTER_ARRAY
 #undef DEFINE_ARCH_ENTRY_GETTER_INIT
 #undef DEFINE_ARCH_ENTRY_GETTER
 
diff --git a/src/hotspot/cpu/x86/c2_MacroAssembler_x86.cpp b/src/hotspot/cpu/x86/c2_MacroAssembler_x86.cpp
index f36c816dd5e..b4d8aa10de2 100644
--- a/src/hotspot/cpu/x86/c2_MacroAssembler_x86.cpp
+++ b/src/hotspot/cpu/x86/c2_MacroAssembler_x86.cpp
@@ -1706,12 +1706,8 @@ void C2_MacroAssembler::load_constant_vector(BasicType bt, XMMRegister dst, Inte
 }
 
 void C2_MacroAssembler::load_iota_indices(XMMRegister dst, int vlen_in_bytes, BasicType bt) {
-  // The iota indices are ordered by type B/S/I/L/F/D, and the offset between two types is 64.
-  int offset = exact_log2(type2aelembytes(bt)) << 6;
-  if (is_floating_point_type(bt)) {
-    offset += 128;
-  }
-  ExternalAddress addr(StubRoutines::x86::vector_iota_indices() + offset);
+  int entry_idx = vector_iota_entry_index(bt);
+  ExternalAddress addr(StubRoutines::x86::vector_iota_indices(entry_idx));
   load_vector(T_BYTE, dst, addr, vlen_in_bytes);
 }
 
@@ -7164,3 +7160,24 @@ void C2_MacroAssembler::vminmax_fp16_avx10_2(int opcode, XMMRegister dst, XMMReg
     evminmaxph(dst, ktmp, src1, src2, true, AVX10_2_MINMAX_MIN_COMPARE_SIGN, vlen_enc);
   }
 }
+
+int C2_MacroAssembler::vector_iota_entry_index(BasicType bt) {
+  // The vector iota entries array is ordered by type B/S/I/L/F/D, and
+  // the offset between two types is 16.
+  switch(bt) {
+  case T_BYTE:
+    return 0;
+  case T_SHORT:
+    return 1;
+  case T_INT:
+    return 2;
+  case T_LONG:
+    return 3;
+  case T_FLOAT:
+    return 4;
+  case T_DOUBLE:
+    return 5;
+  default:
+    ShouldNotReachHere();
+  }
+}
diff --git a/src/hotspot/cpu/x86/c2_MacroAssembler_x86.hpp b/src/hotspot/cpu/x86/c2_MacroAssembler_x86.hpp
index 4e77f8a5f6f..9b229ad7221 100644
--- a/src/hotspot/cpu/x86/c2_MacroAssembler_x86.hpp
+++ b/src/hotspot/cpu/x86/c2_MacroAssembler_x86.hpp
@@ -596,4 +596,5 @@ public:
 
   void reconstruct_frame_pointer(Register rtmp);
 
+  int vector_iota_entry_index(BasicType bt);
 #endif // CPU_X86_C2_MACROASSEMBLER_X86_HPP
diff --git a/src/hotspot/cpu/x86/stubDeclarations_x86.hpp b/src/hotspot/cpu/x86/stubDeclarations_x86.hpp
index 07a1ab622ed..24886deb3c5 100644
--- a/src/hotspot/cpu/x86/stubDeclarations_x86.hpp
+++ b/src/hotspot/cpu/x86/stubDeclarations_x86.hpp
@@ -29,14 +29,16 @@
 #define STUBGEN_PREUNIVERSE_BLOBS_ARCH_DO(do_stub,                      \
                                           do_arch_blob,                 \
                                           do_arch_entry,                \
-                                          do_arch_entry_init)           \
+                                          do_arch_entry_init,           \
+                                          do_arch_entry_array)          \
   do_arch_blob(preuniverse, 500)                                        \
 
 
 #define STUBGEN_INITIAL_BLOBS_ARCH_DO(do_stub,                          \
                                       do_arch_blob,                     \
                                       do_arch_entry,                    \
-                                      do_arch_entry_init)               \
+                                      do_arch_entry_init,               \
+                                      do_arch_entry_array)              \
   do_arch_blob(initial, PRODUCT_ONLY(20000) NOT_PRODUCT(21000) WINDOWS_ONLY(+1000))                      \
   do_stub(initial, verify_mxcsr)                                        \
   do_arch_entry(x86, initial, verify_mxcsr, verify_mxcsr_entry,         \
@@ -65,14 +67,18 @@
 #define STUBGEN_CONTINUATION_BLOBS_ARCH_DO(do_stub,                     \
                                            do_arch_blob,                \
                                            do_arch_entry,               \
-                                           do_arch_entry_init)          \
+                                           do_arch_entry_init,          \
+                                           do_arch_entry_array)         \
   do_arch_blob(continuation, 3000)                                      \
 
+// count needed for declaration of vector_iota_indices stub
+#define VECTOR_IOTA_COUNT 6
 
 #define STUBGEN_COMPILER_BLOBS_ARCH_DO(do_stub,                         \
                                        do_arch_blob,                    \
                                        do_arch_entry,                   \
-                                       do_arch_entry_init)              \
+                                       do_arch_entry_init,              \
+                                       do_arch_entry_array)             \
   do_arch_blob(compiler, 120000 WINDOWS_ONLY(+2000))                    \
   do_stub(compiler, vector_float_sign_mask)                             \
   do_arch_entry(x86, compiler, vector_float_sign_mask,                  \
@@ -126,8 +132,9 @@
   do_arch_entry(x86, compiler, vector_long_sign_mask,                   \
                 vector_long_sign_mask, vector_long_sign_mask)           \
   do_stub(compiler, vector_iota_indices)                                \
-  do_arch_entry(x86, compiler, vector_iota_indices,                     \
-                vector_iota_indices, vector_iota_indices)               \
+  do_arch_entry_array(x86, compiler, vector_iota_indices,               \
+                      vector_iota_indices, vector_iota_indices,         \
+                      VECTOR_IOTA_COUNT)                                \
   do_stub(compiler, vector_count_leading_zeros_lut)                     \
   do_arch_entry(x86, compiler, vector_count_leading_zeros_lut,          \
                 vector_count_leading_zeros_lut,                         \
@@ -250,7 +257,8 @@
 #define STUBGEN_FINAL_BLOBS_ARCH_DO(do_stub,                            \
                                     do_arch_blob,                       \
                                     do_arch_entry,                      \
-                                    do_arch_entry_init)                 \
+                                    do_arch_entry_init,                 \
+                                    do_arch_entry_array)                \
   do_arch_blob(final, 33000                                             \
                WINDOWS_ONLY(+22000) ZGC_ONLY(+20000))                   \
 
diff --git a/src/hotspot/cpu/x86/stubGenerator_x86_64.cpp b/src/hotspot/cpu/x86/stubGenerator_x86_64.cpp
index 40be816fbf0..993d1964034 100644
--- a/src/hotspot/cpu/x86/stubGenerator_x86_64.cpp
+++ b/src/hotspot/cpu/x86/stubGenerator_x86_64.cpp
@@ -893,13 +893,20 @@ address StubGenerator::generate_popcount_avx_lut() {
   return start;
 }
 
-address StubGenerator::generate_iota_indices() {
+void StubGenerator::generate_iota_indices() {
   StubId stub_id = StubId::stubgen_vector_iota_indices_id;
+  GrowableArray<address> entries;
   int entry_count = StubInfo::entry_count(stub_id);
-  assert(entry_count == 1, "sanity check");
-  address start = load_archive_data(stub_id);
+  assert(entry_count == VECTOR_IOTA_COUNT, "sanity check");
+  address start = load_archive_data(stub_id, &entries);
   if (start != nullptr) {
-    return start;
+    assert(entries.length() == VECTOR_IOTA_COUNT - 1,
+           "unexpected extra entry count %d", entries.length());
+    StubRoutines::x86::_vector_iota_indices[0] = start;
+    for (int i = 1; i < VECTOR_IOTA_COUNT; i++) {
+      StubRoutines::x86::_vector_iota_indices[i] = entries.at(i - 1);
+    }
+    return;
   }
   __ align(CodeEntryAlignment);
   StubCodeMark mark(this, stub_id);
@@ -913,6 +920,7 @@ address StubGenerator::generate_iota_indices() {
   __ emit_data64(0x2F2E2D2C2B2A2928, relocInfo::none);
   __ emit_data64(0x3736353433323130, relocInfo::none);
   __ emit_data64(0x3F3E3D3C3B3A3938, relocInfo::none);
+  entries.append(__ pc());
   // W
   __ emit_data64(0x0003000200010000, relocInfo::none);
   __ emit_data64(0x0007000600050004, relocInfo::none);
@@ -922,6 +930,7 @@ address StubGenerator::generate_iota_indices() {
   __ emit_data64(0x0017001600150014, relocInfo::none);
   __ emit_data64(0x001B001A00190018, relocInfo::none);
   __ emit_data64(0x001F001E001D001C, relocInfo::none);
+  entries.append(__ pc());
   // D
   __ emit_data64(0x0000000100000000, relocInfo::none);
   __ emit_data64(0x0000000300000002, relocInfo::none);
@@ -931,6 +940,7 @@ address StubGenerator::generate_iota_indices() {
   __ emit_data64(0x0000000B0000000A, relocInfo::none);
   __ emit_data64(0x0000000D0000000C, relocInfo::none);
   __ emit_data64(0x0000000F0000000E, relocInfo::none);
+  entries.append(__ pc());
   // Q
   __ emit_data64(0x0000000000000000, relocInfo::none);
   __ emit_data64(0x0000000000000001, relocInfo::none);
@@ -940,6 +950,7 @@ address StubGenerator::generate_iota_indices() {
   __ emit_data64(0x0000000000000005, relocInfo::none);
   __ emit_data64(0x0000000000000006, relocInfo::none);
   __ emit_data64(0x0000000000000007, relocInfo::none);
+  entries.append(__ pc());
   // D - FP
   __ emit_data64(0x3F80000000000000, relocInfo::none); // 0.0f, 1.0f
   __ emit_data64(0x4040000040000000, relocInfo::none); // 2.0f, 3.0f
@@ -949,6 +960,7 @@ address StubGenerator::generate_iota_indices() {
   __ emit_data64(0x4130000041200000, relocInfo::none); // 10.0f, 11.0f
   __ emit_data64(0x4150000041400000, relocInfo::none); // 12.0f, 13.0f
   __ emit_data64(0x4170000041600000, relocInfo::none); // 14.0f, 15.0f
+  entries.append(__ pc());
   // Q - FP
   __ emit_data64(0x0000000000000000, relocInfo::none); // 0.0d
   __ emit_data64(0x3FF0000000000000, relocInfo::none); // 1.0d
@@ -960,9 +972,15 @@ address StubGenerator::generate_iota_indices() {
   __ emit_data64(0x401c000000000000, relocInfo::none); // 7.0d
 
   // record the stub entry and end
-  store_archive_data(stub_id, start, __ pc());
+  store_archive_data(stub_id, start, __ pc(), &entries);
 
-  return start;
+  // install the entry addresses in the entry array
+  assert(entries.length() == entry_count - 1,
+         "unexpected entries count %d", entries.length());
+  StubRoutines::x86::_vector_iota_indices[0] = start;
+  for (int i = 1; i < VECTOR_IOTA_COUNT; i++) {
+    StubRoutines::x86::_vector_iota_indices[i] = entries.at(i - 1);
+  }
 }
 
 address StubGenerator::generate_vector_reverse_bit_lut() {
@@ -4837,7 +4855,7 @@ void StubGenerator::generate_compiler_stubs() {
   StubRoutines::x86::_vector_short_shuffle_mask = generate_vector_mask(StubId::stubgen_vector_short_shuffle_mask_id, 0x0100010001000100);
   StubRoutines::x86::_vector_long_shuffle_mask = generate_vector_mask(StubId::stubgen_vector_long_shuffle_mask_id, 0x0000000100000000);
   StubRoutines::x86::_vector_long_sign_mask = generate_vector_mask(StubId::stubgen_vector_long_sign_mask_id, 0x8000000000000000);
-  StubRoutines::x86::_vector_iota_indices = generate_iota_indices();
+  generate_iota_indices();
   StubRoutines::x86::_vector_count_leading_zeros_lut = generate_count_leading_zeros_lut();
   StubRoutines::x86::_vector_reverse_bit_lut = generate_vector_reverse_bit_lut();
   StubRoutines::x86::_vector_reverse_byte_perm_mask_long = generate_vector_reverse_byte_perm_mask_long();
diff --git a/src/hotspot/cpu/x86/stubGenerator_x86_64.hpp b/src/hotspot/cpu/x86/stubGenerator_x86_64.hpp
index 05e8384d636..d3823cb559f 100644
--- a/src/hotspot/cpu/x86/stubGenerator_x86_64.hpp
+++ b/src/hotspot/cpu/x86/stubGenerator_x86_64.hpp
@@ -84,7 +84,7 @@ class StubGenerator: public StubCodeGenerator {
 
   address generate_count_leading_zeros_lut();
   address generate_popcount_avx_lut();
-  address generate_iota_indices();
+  void    generate_iota_indices();
   address generate_vector_reverse_bit_lut();
 
   address generate_vector_reverse_byte_perm_mask_long();
diff --git a/src/hotspot/cpu/x86/stubRoutines_x86.cpp b/src/hotspot/cpu/x86/stubRoutines_x86.cpp
index 8696180c512..aaee01437af 100644
--- a/src/hotspot/cpu/x86/stubRoutines_x86.cpp
+++ b/src/hotspot/cpu/x86/stubRoutines_x86.cpp
@@ -44,8 +44,12 @@
 #define DEFINE_ARCH_ENTRY_INIT(arch, blob_name, stub_name, field_name, getter_name, init_function) \
   address StubRoutines:: arch :: STUB_FIELD_NAME(field_name)  = CAST_FROM_FN_PTR(address, init_function);
 
-STUBGEN_ARCH_ENTRIES_DO(DEFINE_ARCH_ENTRY, DEFINE_ARCH_ENTRY_INIT)
+#define DEFINE_ARCH_ENTRY_ARRAY(arch, blob_name, stub_name, field_name, getter_name, count) \
+  address StubRoutines:: arch :: STUB_FIELD_NAME(field_name) [count];
 
+STUBGEN_ARCH_ENTRIES_DO(DEFINE_ARCH_ENTRY, DEFINE_ARCH_ENTRY_INIT, DEFINE_ARCH_ENTRY_ARRAY)
+
+#undef DEFINE_ARCH_ENTRY_ARRAY
 #undef DEFINE_ARCH_ENTRY_INIT
 #undef DEFINE_ARCH_ENTRY
 
diff --git a/src/hotspot/cpu/x86/stubRoutines_x86.hpp b/src/hotspot/cpu/x86/stubRoutines_x86.hpp
index 3c6d75c1d4e..7283798888b 100644
--- a/src/hotspot/cpu/x86/stubRoutines_x86.hpp
+++ b/src/hotspot/cpu/x86/stubRoutines_x86.hpp
@@ -55,9 +55,13 @@ class x86 {
 #define DECLARE_ARCH_ENTRY_INIT(arch, blob_name, stub_name, field_name, getter_name, init_function) \
   DECLARE_ARCH_ENTRY(arch, blob_name, stub_name, field_name, getter_name)
 
-private:
-  STUBGEN_ARCH_ENTRIES_DO(DECLARE_ARCH_ENTRY, DECLARE_ARCH_ENTRY_INIT)
+#define DECLARE_ARCH_ENTRY_ARRAY(arch, blob_name, stub_name, field_name, getter_name, count) \
+  static address STUB_FIELD_NAME(field_name) [count] ;
 
+private:
+  STUBGEN_ARCH_ENTRIES_DO(DECLARE_ARCH_ENTRY, DECLARE_ARCH_ENTRY_INIT, DECLARE_ARCH_ENTRY_ARRAY)
+
+#undef DECLARE_ARCH_ENTRY_ARRAY
 #undef DECLARE_ARCH_ENTRY_INIT
 #undef DECLARE_ARCH_ENTRY
 
@@ -70,9 +74,13 @@ private:
 #define DEFINE_ARCH_ENTRY_GETTER_INIT(arch, blob_name, stub_name, field_name, getter_name, init_function) \
   DEFINE_ARCH_ENTRY_GETTER(arch, blob_name, stub_name, field_name, getter_name)
 
-public:
-  STUBGEN_ARCH_ENTRIES_DO(DEFINE_ARCH_ENTRY_GETTER, DEFINE_ARCH_ENTRY_GETTER_INIT)
+#define DEFINE_ARCH_ENTRY_GETTER_ARRAY(arch, blob_name, stub_name, field_name, getter_name, count) \
+  static address getter_name(int idx) { return STUB_FIELD_NAME(field_name) [idx]; }
 
+public:
+  STUBGEN_ARCH_ENTRIES_DO(DEFINE_ARCH_ENTRY_GETTER, DEFINE_ARCH_ENTRY_GETTER_INIT, DEFINE_ARCH_ENTRY_GETTER_ARRAY)
+
+#undef DEFINE_ARCH_ENTRY_GETTER_ARRAY
 #undef DEFINE_ARCH_ENTRY_GETTER_INIT
 #undef DEFINE_ARCH_GETTER_ENTRY
 
diff --git a/src/hotspot/cpu/zero/stubDeclarations_zero.hpp b/src/hotspot/cpu/zero/stubDeclarations_zero.hpp
index 2357bbb5169..9abe313b3a7 100644
--- a/src/hotspot/cpu/zero/stubDeclarations_zero.hpp
+++ b/src/hotspot/cpu/zero/stubDeclarations_zero.hpp
@@ -29,35 +29,40 @@
 #define STUBGEN_PREUNIVERSE_BLOBS_ARCH_DO(do_stub,                      \
                                           do_arch_blob,                 \
                                           do_arch_entry,                \
-                                          do_arch_entry_init)           \
+                                          do_arch_entry_init,           \
+                                          do_arch_entry_array)          \
   do_arch_blob(preuniverse, 0)                                          \
 
 
 #define STUBGEN_INITIAL_BLOBS_ARCH_DO(do_stub,                          \
                                       do_arch_blob,                     \
                                       do_arch_entry,                    \
-                                      do_arch_entry_init)               \
+                                      do_arch_entry_init,               \
+                                      do_arch_entry_array)              \
   do_arch_blob(initial, 0)                                              \
 
 
 #define STUBGEN_CONTINUATION_BLOBS_ARCH_DO(do_stub,                     \
                                            do_arch_blob,                \
                                            do_arch_entry,               \
-                                           do_arch_entry_init)          \
+                                           do_arch_entry_init,          \
+                                           do_arch_entry_array)         \
   do_arch_blob(continuation, 0)                                         \
 
 
 #define STUBGEN_COMPILER_BLOBS_ARCH_DO(do_stub,                         \
                                        do_arch_blob,                    \
                                        do_arch_entry,                   \
-                                       do_arch_entry_init)              \
+                                       do_arch_entry_init,              \
+                                       do_arch_entry_array)             \
   do_arch_blob(compiler, 0)                                             \
 
 
 #define STUBGEN_FINAL_BLOBS_ARCH_DO(do_stub,                            \
                                     do_arch_blob,                       \
                                     do_arch_entry,                      \
-                                    do_arch_entry_init)                 \
+                                    do_arch_entry_init,                 \
+                                    do_arch_entry_array)                \
   do_arch_blob(final, 0)                                                \
 
 
diff --git a/src/hotspot/share/runtime/stubDeclarations.hpp b/src/hotspot/share/runtime/stubDeclarations.hpp
index d1ce378ee20..ed1b3ea2e78 100644
--- a/src/hotspot/share/runtime/stubDeclarations.hpp
+++ b/src/hotspot/share/runtime/stubDeclarations.hpp
@@ -539,18 +539,19 @@
 // generated.
 //
 // Architecture-specific entries need to be declared using the
-// do_arch_entry template
+// do_arch_entry templates
 //
 // do_arch_entry(arch, blob_name, stub_name, field_name, getter_name)
 //
 // do_arch_entry_init(arch, blob_name, stub_name, field_name,
 //                    getter_name, init_function)
 //
+// do_arch_entry_array(arch, blob_name, stub_name, field_name,
+//                     getter_name, count)
+//
 // The only difference between these templates and the generic ones is
 // that they receive an extra argument which identifies the current
 // architecture e.g. x86, aarch64 etc.
-//
-// Currently there is no support for a do_arch_array_entry template.
 
 // Include arch-specific stub and entry declarations and make sure the
 // relevant template macros have been defined
@@ -598,7 +599,8 @@
                                      do_entry, do_entry_init,           \
                                      do_entry_array,                    \
                                      do_arch_blob,                      \
-                                     do_arch_entry, do_arch_entry_init) \
+                                     do_arch_entry, do_arch_entry_init, \
+                                     do_arch_entry_array)               \
   do_blob(preuniverse)                                                  \
   do_stub(preuniverse, fence)                                           \
   do_entry(preuniverse, fence, fence_entry, fence_entry)                \
@@ -615,7 +617,8 @@
            atomic_cmpxchg_long_entry)                                   \
   /* merge in stubs and entries declared in arch header */              \
   STUBGEN_PREUNIVERSE_BLOBS_ARCH_DO(do_stub, do_arch_blob,              \
-                                    do_arch_entry, do_arch_entry_init)  \
+                                    do_arch_entry, do_arch_entry_init,  \
+                                    do_arch_entry_array)                \
   end_blob(preuniverse)                                                 \
 
 #define STUBGEN_INITIAL_BLOBS_DO(do_blob, end_blob,                     \
@@ -623,7 +626,8 @@
                                  do_entry, do_entry_init,               \
                                  do_entry_array,                        \
                                  do_arch_blob,                          \
-                                 do_arch_entry, do_arch_entry_init)     \
+                                 do_arch_entry, do_arch_entry_init,     \
+                                 do_arch_entry_array)                   \
   do_blob(initial)                                                      \
   do_stub(initial, call_stub)                                           \
   do_entry(initial, call_stub, call_stub_entry, call_stub_entry)        \
@@ -669,7 +673,8 @@
   do_entry(initial, fmod, fmod, fmod)                                   \
   /* merge in stubs and entries declared in arch header */              \
   STUBGEN_INITIAL_BLOBS_ARCH_DO(do_stub, do_arch_blob,                  \
-                                do_arch_entry, do_arch_entry_init)      \
+                                do_arch_entry, do_arch_entry_init,      \
+                                do_arch_entry_array)                    \
   end_blob(initial)                                                     \
 
 
@@ -679,7 +684,8 @@
                                       do_entry_array,                   \
                                       do_arch_blob,                     \
                                       do_arch_entry,                    \
-                                      do_arch_entry_init)               \
+                                      do_arch_entry_init,               \
+                                      do_arch_entry_array)              \
   do_blob(continuation)                                                 \
   do_stub(continuation, cont_thaw)                                      \
   do_entry(continuation, cont_thaw, cont_thaw, cont_thaw)               \
@@ -694,7 +700,8 @@
            cont_returnBarrierExc)                                       \
   /* merge in stubs and entries declared in arch header */              \
   STUBGEN_CONTINUATION_BLOBS_ARCH_DO(do_stub, do_arch_blob,             \
-                                     do_arch_entry, do_arch_entry_init) \
+                                     do_arch_entry, do_arch_entry_init, \
+                                     do_arch_entry_array)               \
   end_blob(continuation)                                                \
 
 
@@ -703,7 +710,8 @@
                                   do_entry, do_entry_init,              \
                                   do_entry_array,                       \
                                   do_arch_blob,                         \
-                                  do_arch_entry, do_arch_entry_init)    \
+                                  do_arch_entry, do_arch_entry_init,    \
+                                  do_arch_entry_array)                  \
   do_blob(compiler)                                                     \
   do_stub(compiler, array_sort)                                         \
   do_entry(compiler, array_sort, array_sort, select_arraysort_function) \
@@ -848,7 +856,8 @@
            bigIntegerLeftShiftWorker, bigIntegerLeftShift)              \
   /* merge in stubs and entries declared in arch header */              \
   STUBGEN_COMPILER_BLOBS_ARCH_DO(do_stub, do_arch_blob,                 \
-                                     do_arch_entry, do_arch_entry_init) \
+                                 do_arch_entry, do_arch_entry_init,     \
+                                 do_arch_entry_array)                   \
   end_blob(compiler)                                                    \
 
 
@@ -857,7 +866,8 @@
                                do_entry, do_entry_init,                 \
                                do_entry_array,                          \
                                do_arch_blob,                            \
-                               do_arch_entry, do_arch_entry_init)       \
+                               do_arch_entry, do_arch_entry_init,       \
+                               do_arch_entry_array)                     \
   do_blob(final)                                                        \
   do_stub(final, verify_oop)                                            \
   do_entry(final, verify_oop, verify_oop_subroutine_entry,              \
@@ -1069,7 +1079,8 @@
            lookup_secondary_supers_table_slow_path_stub)                \
   /* merge in stubs and entries declared in arch header */              \
   STUBGEN_FINAL_BLOBS_ARCH_DO(do_stub,  do_arch_blob,                   \
-                              do_arch_entry, do_arch_entry_init)        \
+                              do_arch_entry, do_arch_entry_init,        \
+                              do_arch_entry_array)                      \
   end_blob(final)                                                       \
 
 
@@ -1082,37 +1093,43 @@
                        do_entry, do_entry_init,                         \
                        do_entry_array,                                  \
                        do_arch_blob,                                    \
-                       do_arch_entry, do_arch_entry_init)               \
+                       do_arch_entry, do_arch_entry_init,               \
+                       do_arch_entry_array)                             \
   STUBGEN_PREUNIVERSE_BLOBS_DO(do_blob, end_blob,                       \
                                do_stub,                                 \
                                do_entry, do_entry_init,                 \
                                do_entry_array,                          \
                                do_arch_blob,                            \
-                               do_arch_entry, do_arch_entry_init)       \
+                               do_arch_entry, do_arch_entry_init,       \
+                               do_arch_entry_array)                     \
   STUBGEN_INITIAL_BLOBS_DO(do_blob, end_blob,                           \
                            do_stub,                                     \
                            do_entry, do_entry_init,                     \
                            do_entry_array,                              \
                            do_arch_blob,                                \
-                           do_arch_entry, do_arch_entry_init)           \
+                           do_arch_entry, do_arch_entry_init,           \
+                           do_arch_entry_array)                         \
   STUBGEN_CONTINUATION_BLOBS_DO(do_blob, end_blob,                      \
                                 do_stub,                                \
                                 do_entry, do_entry_init,                \
                                 do_entry_array,                         \
                                 do_arch_blob,                           \
-                                do_arch_entry, do_arch_entry_init)      \
+                                do_arch_entry, do_arch_entry_init,      \
+                                do_arch_entry_array)                    \
   STUBGEN_COMPILER_BLOBS_DO(do_blob, end_blob,                          \
                             do_stub,                                    \
                             do_entry, do_entry_init,                    \
                             do_entry_array,                             \
                             do_arch_blob,                               \
-                            do_arch_entry, do_arch_entry_init)          \
+                            do_arch_entry, do_arch_entry_init,          \
+                            do_arch_entry_array)                        \
   STUBGEN_FINAL_BLOBS_DO(do_blob, end_blob,                             \
                          do_stub,                                       \
                          do_entry, do_entry_init,                       \
                          do_entry_array,                                \
                          do_arch_blob,                                  \
-                         do_arch_entry, do_arch_entry_init)             \
+                         do_arch_entry, do_arch_entry_init,             \
+                         do_arch_entry_array)                           \
 
 // Convenience macros for use by template implementations
 
@@ -1162,6 +1179,9 @@
 #define STUBGEN_COUNT5(_1, _2, _3, _4, count)   \
   + count
 
+#define STUBGEN_COUNT6(_1, _2, _3, _4, _5, count)        \
+  + count
+
 // Convenience templates that emit nothing
 
 // ignore do_blob(blob_name, type) declarations
@@ -1200,7 +1220,8 @@
                  DO_ENTRY_EMPTY4, DO_ENTRY_EMPTY5,                      \
                  DO_ENTRY_EMPTY5,                                       \
                  DO_ARCH_BLOB_EMPTY2,                                   \
-                 DO_ARCH_ENTRY_EMPTY5, DO_ARCH_ENTRY_EMPTY6)            \
+                 DO_ARCH_ENTRY_EMPTY5, DO_ARCH_ENTRY_EMPTY6,            \
+                 DO_ARCH_ENTRY_EMPTY6)                                  \
 
 // client macro to operate only on StubGenerator stubs
 
@@ -1210,7 +1231,8 @@
                  DO_ENTRY_EMPTY4, DO_ENTRY_EMPTY5,                      \
                  DO_ENTRY_EMPTY5,                                       \
                  DO_ARCH_BLOB_EMPTY2,                                   \
-                 DO_ARCH_ENTRY_EMPTY5, DO_ARCH_ENTRY_EMPTY6)            \
+                 DO_ARCH_ENTRY_EMPTY5, DO_ARCH_ENTRY_EMPTY6,            \
+                 DO_ARCH_ENTRY_EMPTY6)                                  \
 
 // client macros to operate only on StubGenerator blobs and stubs
 
@@ -1220,18 +1242,21 @@
                  DO_ENTRY_EMPTY4, DO_ENTRY_EMPTY5,                      \
                  DO_ENTRY_EMPTY5,                                       \
                  DO_ARCH_BLOB_EMPTY2,                                   \
-                 DO_ARCH_ENTRY_EMPTY5,DO_ARCH_ENTRY_EMPTY6)             \
+                 DO_ARCH_ENTRY_EMPTY5,DO_ARCH_ENTRY_EMPTY6,             \
+                 DO_ARCH_ENTRY_EMPTY6)                                  \
 
 // client macro to operate only on StubGenerator generci and arch entries
 
 #define STUBGEN_ALL_ENTRIES_DO(do_entry, do_entry_init, do_entry_array, \
-                               do_arch_entry, do_arch_entry_init)       \
+                               do_arch_entry, do_arch_entry_init,       \
+                               do_arch_entry_array)                     \
   STUBGEN_ALL_DO(DO_BLOB_EMPTY1, DO_BLOB_EMPTY1,                        \
                  DO_STUB_EMPTY2,                                        \
                  do_entry, do_entry_init,                               \
                  do_entry_array,                                        \
                  DO_ARCH_BLOB_EMPTY2,                                   \
-                 do_arch_entry, do_arch_entry_init)                     \
+                 do_arch_entry, do_arch_entry_init,                     \
+                 do_arch_entry_array)                                   \
 
 // client macro to operate only on StubGenerator entries
 
@@ -1241,7 +1266,8 @@
                  do_entry, do_entry_init,                               \
                  do_entry_array,                                        \
                  DO_ARCH_BLOB_EMPTY2,                                   \
-                 DO_ARCH_ENTRY_EMPTY5, DO_ARCH_ENTRY_EMPTY6)            \
+                 DO_ARCH_ENTRY_EMPTY5, DO_ARCH_ENTRY_EMPTY6,            \
+                 DO_ARCH_ENTRY_EMPTY6)                                  \
 
 // client macro to operate only on StubGenerator arch blobs
 
@@ -1251,16 +1277,19 @@
                  DO_ENTRY_EMPTY4, DO_ENTRY_EMPTY5,                      \
                  DO_ENTRY_EMPTY5,                                       \
                  do_arch_blob,                                          \
-                 DO_ARCH_ENTRY_EMPTY5, DO_ARCH_ENTRY_EMPTY6)            \
+                 DO_ARCH_ENTRY_EMPTY5, DO_ARCH_ENTRY_EMPTY6,            \
+                 DO_ARCH_ENTRY_EMPTY6)                                  \
 
 // client macro to operate only on StubGenerator arch entries
 
-#define STUBGEN_ARCH_ENTRIES_DO(do_arch_entry, do_arch_entry_init)      \
+#define STUBGEN_ARCH_ENTRIES_DO(do_arch_entry, do_arch_entry_init,      \
+                                do_arch_entry_array)                    \
   STUBGEN_ALL_DO(DO_BLOB_EMPTY1, DO_BLOB_EMPTY1,                        \
                  DO_STUB_EMPTY2,                                        \
                  DO_ENTRY_EMPTY4, DO_ENTRY_EMPTY5,                      \
                  DO_ENTRY_EMPTY5,                                       \
                  DO_ARCH_BLOB_EMPTY2,                                   \
-                 do_arch_entry, do_arch_entry_init)                     \
+                 do_arch_entry, do_arch_entry_init,                     \
+                 do_arch_entry_array)                                   \
 
 #endif // SHARE_RUNTIME_STUBDECLARATIONS_HPP
diff --git a/src/hotspot/share/runtime/stubInfo.cpp b/src/hotspot/share/runtime/stubInfo.cpp
index c07c0298f2b..4d4d865cf95 100644
--- a/src/hotspot/share/runtime/stubInfo.cpp
+++ b/src/hotspot/share/runtime/stubInfo.cpp
@@ -574,6 +574,18 @@ void StubInfo::process_stubgen_entry(StubGroup& group_cursor,
                                         field_name, id),                \
                         0);                                             \
 
+#define PROCESS_STUBGEN_ENTRY_ARCH_ARRAY(arch_name, blob, stub,         \
+                                         field_name, getter_name,       \
+                                         count)                         \
+  process_stubgen_entry(_group_cursor, _blob_cursor,                    \
+                        _stub_cursor, _entry_cursor,                    \
+                        #arch_name "_" # field_name "_entry (stub gen)", \
+                        BlobId:: JOIN3(stubgen, blob, id),              \
+                        StubId:: JOIN3(stubgen, stub, id),              \
+                        EntryId:: JOIN4(stubgen, arch_name,             \
+                                        field_name, id),                \
+                        count);                                         \
+
 void StubInfo::populate_stub_tables() {
   StubGroup _group_cursor;
   BlobId _blob_cursor = BlobId::NO_BLOBID;
@@ -615,7 +627,8 @@ void StubInfo::populate_stub_tables() {
                  PROCESS_STUBGEN_ENTRY, PROCESS_STUBGEN_ENTRY_INIT,
                  PROCESS_STUBGEN_ENTRY_ARRAY,
                  DO_ARCH_BLOB_EMPTY2,
-                 PROCESS_STUBGEN_ENTRY_ARCH, PROCESS_STUBGEN_ENTRY_ARCH_INIT);
+                 PROCESS_STUBGEN_ENTRY_ARCH, PROCESS_STUBGEN_ENTRY_ARCH_INIT,
+                 PROCESS_STUBGEN_ENTRY_ARCH_ARRAY);
   assert(next(_blob_cursor) == BlobId::NUM_BLOBIDS, "should have exhausted all blob ids!");
   assert(next(_stub_cursor) == StubId::NUM_STUBIDS, "should have exhausted all stub ids!");
   assert(next(_entry_cursor) == EntryId::NUM_ENTRYIDS, "should have exhausted all entry ids!");
@@ -636,6 +649,7 @@ void StubInfo::populate_stub_tables() {
 #undef PROCESS_STUBGEN_ENTRY_ARRAY
 #undef PROCESS_STUBGEN_ENTRY_ARCH
 #undef PROCESS_STUBGEN_ENTRY_ARCH_INIT
+#undef PROCESS_STUBGEN_ENTRY_ARCH_ARRAY
 
 #ifdef ASSERT
 
diff --git a/src/hotspot/share/runtime/stubInfo.hpp b/src/hotspot/share/runtime/stubInfo.hpp
index 447f7d3a582..2fe503a8d0e 100644
--- a/src/hotspot/share/runtime/stubInfo.hpp
+++ b/src/hotspot/share/runtime/stubInfo.hpp
@@ -349,6 +349,14 @@ enum class StubId : int {
                                       init_function)                    \
   JOIN4(stubgen, arch_name, field_name, id),                            \
 
+#define STUBGEN_DECLARE_ARCH_ARRAY_TAG(arch_name, blob_name, stub_name, \
+                                       field_name, getter_name,         \
+                                       count)                           \
+  JOIN4(stubgen, arch_name, field_name, id),                            \
+  JOIN4(stubgen, arch_name, field_name, max) =                          \
+  JOIN4(stubgen, arch_name, field_name, id) +                           \
+    count - 1,                                                          \
+
 // the above macros are enough to declare the enum
 
 enum class EntryId : int {
@@ -366,7 +374,8 @@ enum class EntryId : int {
                          STUBGEN_DECLARE_INIT_TAG,
                          STUBGEN_DECLARE_ARRAY_TAG,
                          STUBGEN_DECLARE_ARCH_TAG,
-                         STUBGEN_DECLARE_ARCH_INIT_TAG)
+                         STUBGEN_DECLARE_ARCH_INIT_TAG,
+                         STUBGEN_DECLARE_ARCH_ARRAY_TAG)
   NUM_ENTRYIDS
 };
 
@@ -379,6 +388,7 @@ enum class EntryId : int {
 #undef STUBGEN_DECLARE_ARRAY_TAG
 #undef STUBGEN_DECLARE_ARCH_TAG
 #undef STUBGEN_DECLARE_ARCH_INIT_TAG
+#undef STUBGEN_DECLARE_ARCH_ARRAY_TAG
 
 // we need static init expressions for blob, stub and entry counts in
 // each stubgroup
@@ -404,7 +414,8 @@ enum class EntryId : int {
 #define STUBGEN_ENTRY_COUNT_INITIALIZER          \
   0 STUBGEN_ALL_ENTRIES_DO(COUNT4, COUNT5,       \
                            STUBGEN_COUNT5,       \
-                           COUNT5, COUNT6)
+                           COUNT5, COUNT6,       \
+                           STUBGEN_COUNT6)
 
 // Declare management class StubInfo
 

From d114e8d05827d3e4756aeb8bbe115ec02b066da7 Mon Sep 17 00:00:00 2001
From: David Beaumont <dbeaumont@openjdk.org>
Date: Wed, 15 Apr 2026 09:22:34 +0000
Subject: [PATCH 604/655] 8375649: idea.sh script adds source paths in a
 single, enormous, line to jdk.iml

Reviewed-by: erikj, liach
---
 bin/idea.sh | 8 ++++++--
 1 file changed, 6 insertions(+), 2 deletions(-)

diff --git a/bin/idea.sh b/bin/idea.sh
index a184884b61a..d9a18956e3b 100644
--- a/bin/idea.sh
+++ b/bin/idea.sh
@@ -187,14 +187,18 @@ fi
 SOURCE_PREFIX="<sourceFolder url=\"file://"
 SOURCE_POSTFIX="\" isTestSource=\"false\" />"
 
+# SOURCES is a single string containing embeded newlines.
 for root in $MODULE_ROOTS; do
     if [ "x$CYGPATH" != "x" ]; then
       root=`$CYGPATH -am $root`
     elif [ "x$WSL_DISTRO_NAME" != "x" ]; then
       root=`wslpath -am $root`
     fi
-
-    SOURCES=$SOURCES" $SOURCE_PREFIX""$root""$SOURCE_POSTFIX"
+    # Add line termination/indentation for everything after the first entry.
+    if [ "x$SOURCES" != "x" ]; then
+      SOURCES="${SOURCES}\n      "
+    fi
+    SOURCES="${SOURCES}${SOURCE_PREFIX}${root}${SOURCE_POSTFIX}"
 done
 
 add_replacement "###SOURCE_ROOTS###" "$SOURCES"

From aece6f483250d14af3c8a728de6817bb98f10436 Mon Sep 17 00:00:00 2001
From: Daniel Fuchs <dfuchs@openjdk.org>
Date: Wed, 15 Apr 2026 11:21:07 +0000
Subject: [PATCH 605/655] 8381842: Refactor remaining TestNG tests under
 java/net/ to use JUnit

Reviewed-by: vyazici
---
 .../java/net/DatagramPacket/Constructor.java  |  65 +++---
 test/jdk/java/net/DatagramPacket/Getters.java |  12 +-
 test/jdk/java/net/DatagramPacket/Setters.java |  52 +++--
 .../InetAddress/HostsFileOrderingTest.java    |  48 ++--
 .../java/net/InetSocketAddress/ToString.java  | 103 ++++-----
 .../net/NetworkInterface/NullMacAddress.java  |  30 ++-
 .../jdk/java/net/SocketOption/AfterClose.java | 101 ++++----
 .../net/SocketOption/CachedImplOptions.java   |  53 +++--
 .../net/SocketOption/ImmutableOptions.java    |  67 +++---
 .../net/SocketOption/NullsAndBadValues.java   | 215 +++++++++---------
 .../net/SocketOption/RequiredOptions.java     |  13 +-
 test/jdk/java/net/SocketPermission/Ctor.java  |  63 ++---
 test/jdk/java/net/Socks/SocksIPv6Test.java    |  55 ++---
 .../java/net/Socks/SocksSocketImplTest.java   |  39 ++--
 .../UnixDomainSocketAddress/AddressTest.java  |  12 +-
 .../UnixDomainSocketAddress/LengthTest.java   |  69 +++---
 ...xDomainSocketAddressSerializationTest.java |  38 ++--
 17 files changed, 527 insertions(+), 508 deletions(-)

diff --git a/test/jdk/java/net/DatagramPacket/Constructor.java b/test/jdk/java/net/DatagramPacket/Constructor.java
index ff77d51b798..9f108a263e9 100644
--- a/test/jdk/java/net/DatagramPacket/Constructor.java
+++ b/test/jdk/java/net/DatagramPacket/Constructor.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1997, 2020, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,18 +25,19 @@
  * @bug 4091803 7021373
  * @summary this tests that the constructor of DatagramPacket rejects
  *          bogus arguments properly.
- * @run testng Constructor
+ * @run junit ${test.main.class}
  */
 
 import java.net.DatagramPacket;
 import java.net.InetAddress;
 import java.net.InetSocketAddress;
 
-import org.testng.annotations.Test;
-
-import static org.testng.Assert.assertFalse;
-import static org.testng.Assert.assertTrue;
-import static org.testng.Assert.expectThrows;
+import org.junit.jupiter.api.Test;
+import static org.junit.jupiter.api.Assertions.assertDoesNotThrow;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertNull;
+import static org.junit.jupiter.api.Assertions.assertSame;
+import static org.junit.jupiter.api.Assertions.assertThrows;
 
 public class Constructor {
 
@@ -48,35 +49,33 @@ public class Constructor {
 
     @Test
     public void testNullPacket() {
-        expectThrows(NPE,
+        assertThrows(NPE,
                 () -> new DatagramPacket(null, 100));
     }
     @Test
     public void testNull() throws Exception {
-        expectThrows(NPE, () -> new DatagramPacket(null, 100));
-        expectThrows(NPE, () -> new DatagramPacket(null, 0, 10));
-        expectThrows(NPE, () -> new DatagramPacket(null, 0, 10, LOOPBACK, 80));
-        expectThrows(NPE, () -> new DatagramPacket(null, 10, LOOPBACK, 80));
-        expectThrows(NPE, () -> new DatagramPacket(null, 0, 10, new InetSocketAddress(80)));
-        expectThrows(NPE, () -> new DatagramPacket(null, 10, new InetSocketAddress(80)));
+        assertThrows(NPE, () -> new DatagramPacket(null, 100));
+        assertThrows(NPE, () -> new DatagramPacket(null, 0, 10));
+        assertThrows(NPE, () -> new DatagramPacket(null, 0, 10, LOOPBACK, 80));
+        assertThrows(NPE, () -> new DatagramPacket(null, 10, LOOPBACK, 80));
+        assertThrows(NPE, () -> new DatagramPacket(null, 0, 10, new InetSocketAddress(80)));
+        assertThrows(NPE, () -> new DatagramPacket(null, 10, new InetSocketAddress(80)));
 
         // no Exception expected for null addresses
-        new DatagramPacket(buf, 10, null, 0);
-        new DatagramPacket(buf, 10, 10, null, 0);
+        assertDoesNotThrow(() -> new DatagramPacket(buf, 10, null, 0));
+        assertDoesNotThrow(() -> new DatagramPacket(buf, 10, 10, null, 0));
     }
 
     @Test
     public void testNegativeBufferLength() {
         /* length lesser than buffer length */
-        expectThrows(IAE,
-                () -> new DatagramPacket(buf, -128));
+        assertThrows(IAE, () -> new DatagramPacket(buf, -128));
     }
 
     @Test
     public void testPacketLengthTooLarge() {
         /* length greater than buffer length */
-        expectThrows(IAE,
-                () -> new DatagramPacket(buf, 256));
+        assertThrows(IAE, () -> new DatagramPacket(buf, 256));
     }
 
     @Test
@@ -84,14 +83,14 @@ public class Constructor {
         /* negative port */
         InetAddress addr = InetAddress.getLocalHost();
 
-        expectThrows(IAE,
+        assertThrows(IAE,
                 () -> new DatagramPacket(buf, 100, addr, -1));
     }
 
     @Test
     public void testPortValueTooLarge() {
         /* invalid port value */
-        expectThrows(IAE,
+        assertThrows(IAE,
                 () -> new DatagramPacket(buf, 128, LOOPBACK, Integer.MAX_VALUE));
     }
 
@@ -101,8 +100,9 @@ public class Constructor {
         int length = 50;
         DatagramPacket pkt = new DatagramPacket(buf, offset, length);
 
-        assertFalse((pkt.getData() != buf || pkt.getOffset() != offset ||
-                pkt.getLength() != length), "simple constructor failed");
+        assertSame(buf, pkt.getData());
+        assertEquals(offset, pkt.getOffset());
+        assertEquals(length, pkt.getLength());
     }
 
     @Test
@@ -112,20 +112,21 @@ public class Constructor {
         int port = 8080;
         DatagramPacket packet = new DatagramPacket(buf, offset, length, LOOPBACK, port);
 
-        assertFalse((packet.getData() != buf || packet.getOffset() != offset ||
-                packet.getLength() != length ||
-                packet.getAddress() != LOOPBACK ||
-                packet.getPort() != port), "full constructor failed");
+        assertSame(buf, packet.getData());
+        assertEquals(offset, packet.getOffset());
+        assertEquals(length, packet.getLength());
+        assertSame(LOOPBACK, packet.getAddress());
+        assertEquals(port, packet.getPort());
     }
 
     @Test
     public void testDefaultValues() {
         DatagramPacket packet = new DatagramPacket(buf, 0);
-        assertTrue(packet.getAddress() == null);
-        assertTrue(packet.getPort() == 0);
+        assertNull(packet.getAddress());
+        assertEquals(0, packet.getPort());
 
         DatagramPacket packet1 = new DatagramPacket(buf, 0, 0);
-        assertTrue(packet1.getAddress() == null);
-        assertTrue(packet1.getPort() == 0);
+        assertNull(packet1.getAddress());
+        assertEquals(0, packet1.getPort());
     }
 }
diff --git a/test/jdk/java/net/DatagramPacket/Getters.java b/test/jdk/java/net/DatagramPacket/Getters.java
index f2e1c40603c..c66f7966267 100644
--- a/test/jdk/java/net/DatagramPacket/Getters.java
+++ b/test/jdk/java/net/DatagramPacket/Getters.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2020, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -24,15 +24,15 @@
 /* @test
  * @bug 8237890
  * @summary Check that DatagramPacket's get methods perform as expected
- * @run testng Getters
+ * @run junit ${test.main.class}
  */
 
-import org.testng.annotations.Test;
-
 import java.net.DatagramPacket;
 import java.net.InetSocketAddress;
 
-import static org.testng.Assert.assertTrue;
+import org.junit.jupiter.api.Test;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertTrue;
 
 public class Getters {
 
@@ -42,6 +42,6 @@ public class Getters {
         InetSocketAddress addr = (InetSocketAddress)packet.getSocketAddress();
 
         assertTrue(addr.getAddress().isAnyLocalAddress());
-        assertTrue(addr.getPort() == 0);
+        assertEquals(0, addr.getPort());
     }
 }
diff --git a/test/jdk/java/net/DatagramPacket/Setters.java b/test/jdk/java/net/DatagramPacket/Setters.java
index 0e950c4f7f2..74424339a18 100644
--- a/test/jdk/java/net/DatagramPacket/Setters.java
+++ b/test/jdk/java/net/DatagramPacket/Setters.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2020, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,17 +25,19 @@
  * @bug 7021373
  * @summary check that the DatagramPacket setter methods
  *          throw the correct exceptions
- * @run testng Setters
+ * @run junit ${test.main.class}
  */
 
 
 import java.net.DatagramPacket;
 
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
-
-import static org.testng.Assert.assertTrue;
-import static org.testng.Assert.expectThrows;
+import org.junit.jupiter.api.Test;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
+import static org.junit.jupiter.api.Assertions.assertDoesNotThrow;
+import static org.junit.jupiter.api.Assertions.assertNull;
+import static org.junit.jupiter.api.Assertions.assertThrows;
+import static org.junit.jupiter.api.Assertions.assertTrue;
 
 public class Setters {
 
@@ -50,11 +52,10 @@ public class Setters {
 
         // No Exception expected for null addresses
         pkt.setAddress(null);
-        assertTrue(pkt.getAddress() == null);
+        assertNull(pkt.getAddress());
     }
 
-    @DataProvider
-    Object[][] data() { // add checks for setAddress with null - add getAddress to verify
+    static Object[][] data() { // add checks for setAddress with null - add getAddress to verify
         return new Object[][]{
                 { buf,          0,      -1,     IAE  },
                 { buf,          -1,     1,      IAE  },
@@ -66,24 +67,24 @@ public class Setters {
         };
     }
 
-    @Test(dataProvider = "data")
+    @ParameterizedTest
+    @MethodSource("data")
     public void testSetData(byte[] buf,
                             int offset,
                             int length,
                             Class<? extends Exception> exception) {
         DatagramPacket pkt = new DatagramPacket(new byte[8], 8);
 
+
         if (exception != null) {
-            expectThrows(exception, () -> pkt.setData(buf, offset, length));
-        } else if (buf == null) {
-            expectThrows(exception, () -> pkt.setData(buf));
+            assertThrows(exception, () -> pkt.setData(buf, offset, length));
+            if (buf == null) assertThrows(exception, () -> pkt.setData(buf));
         } else {
-            pkt.setData(buf, offset, length);
+            assertDoesNotThrow(() -> pkt.setData(buf, offset, length));
         }
     }
 
-    @DataProvider
-    Object[][] lengths() {
+    static Object[][] lengths() {
         return new Object[][]{
                 { 0,     -1,     IAE  },
                 { 8,     1,      IAE  },
@@ -94,20 +95,20 @@ public class Setters {
         };
     }
 
-    @Test(dataProvider = "lengths")
+    @ParameterizedTest
+    @MethodSource("lengths")
     public void testSetLength(int offset, int length,
                               Class<? extends Exception> exception) {
         DatagramPacket pkt = new DatagramPacket(new byte[8], offset, 0);
 
         if (exception != null) {
-            expectThrows(exception, () -> pkt.setLength(length));
+            assertThrows(exception, () -> pkt.setLength(length));
         } else {
-            pkt.setLength(length);
+            assertDoesNotThrow(() -> pkt.setLength(length));
         }
     }
 
-    @DataProvider
-    Object[][] ports() {
+    static Object[][] ports() {
         return new Object[][]{
                 { -1,                IAE  },
                 { -666,              IAE  },
@@ -122,14 +123,15 @@ public class Setters {
         };
     }
 
-    @Test(dataProvider = "ports")
+    @ParameterizedTest
+    @MethodSource("ports")
     public void testSetPort(int port, Class<? extends Exception> exception) {
         DatagramPacket pkt = new DatagramPacket(new byte[8], 0);
 
         if (exception != null) {
-            expectThrows(exception, () -> pkt.setPort(port));
+            assertThrows(exception, () -> pkt.setPort(port));
         } else {
-            pkt.setPort(port);
+            assertDoesNotThrow(() -> pkt.setPort(port));
         }
     }
 }
diff --git a/test/jdk/java/net/InetAddress/HostsFileOrderingTest.java b/test/jdk/java/net/InetAddress/HostsFileOrderingTest.java
index 304180b6c48..56b52b2a264 100644
--- a/test/jdk/java/net/InetAddress/HostsFileOrderingTest.java
+++ b/test/jdk/java/net/InetAddress/HostsFileOrderingTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2020, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -34,9 +34,9 @@ import java.util.stream.Stream;
 
 import jdk.test.lib.net.IPSupport;
 
-import org.testng.annotations.BeforeClass;
-import org.testng.annotations.Test;
-import org.testng.Assert;
+import org.junit.jupiter.api.BeforeAll;
+import org.junit.jupiter.api.Test;
+import static org.junit.jupiter.api.Assertions.fail;
 
 
 /* @test
@@ -46,23 +46,23 @@ import org.testng.Assert;
  * @summary Test that "jdk.net.hosts.file" NameService implementation returns addresses
  *          with respect to "java.net.preferIPv4Stack" and "java.net.preferIPv6Addresses" system
  *          property values
- * @run testng/othervm -Djdk.net.hosts.file=TestHostsFile.txt
- *    -Djava.net.preferIPv4Stack=true -Djava.net.preferIPv6Addresses=true HostsFileOrderingTest
- * @run testng/othervm -Djdk.net.hosts.file=TestHostsFile.txt
- *    -Djava.net.preferIPv4Stack=true -Djava.net.preferIPv6Addresses=false HostsFileOrderingTest
- * @run testng/othervm -Djdk.net.hosts.file=TestHostsFile.txt
- *    -Djava.net.preferIPv4Stack=true -Djava.net.preferIPv6Addresses=system HostsFileOrderingTest
- * @run testng/othervm -Djdk.net.hosts.file=TestHostsFile.txt
- *    -Djava.net.preferIPv4Stack=true -Djava.net.preferIPv6Addresses=notVALID HostsFileOrderingTest
- * @run testng/othervm -Djdk.net.hosts.file=TestHostsFile.txt
- *    -Djava.net.preferIPv4Stack=false -Djava.net.preferIPv6Addresses=true HostsFileOrderingTest
- * @run testng/othervm -Djdk.net.hosts.file=TestHostsFile.txt
- *    -Djava.net.preferIPv4Stack=false -Djava.net.preferIPv6Addresses=false HostsFileOrderingTest
- * @run testng/othervm -Djdk.net.hosts.file=TestHostsFile.txt
- *    -Djava.net.preferIPv4Stack=false -Djava.net.preferIPv6Addresses=system HostsFileOrderingTest
- * @run testng/othervm -Djdk.net.hosts.file=TestHostsFile.txt
- *    -Djava.net.preferIPv4Stack=false -Djava.net.preferIPv6Addresses=notVALID HostsFileOrderingTest
- * @run testng/othervm -Djdk.net.hosts.file=TestHostsFile.txt HostsFileOrderingTest
+ * @run junit/othervm -Djdk.net.hosts.file=TestHostsFile.txt
+ *    -Djava.net.preferIPv4Stack=true -Djava.net.preferIPv6Addresses=true ${test.main.class}
+ * @run junit/othervm -Djdk.net.hosts.file=TestHostsFile.txt
+ *    -Djava.net.preferIPv4Stack=true -Djava.net.preferIPv6Addresses=false ${test.main.class}
+ * @run junit/othervm -Djdk.net.hosts.file=TestHostsFile.txt
+ *    -Djava.net.preferIPv4Stack=true -Djava.net.preferIPv6Addresses=system ${test.main.class}
+ * @run junit/othervm -Djdk.net.hosts.file=TestHostsFile.txt
+ *    -Djava.net.preferIPv4Stack=true -Djava.net.preferIPv6Addresses=notVALID ${test.main.class}
+ * @run junit/othervm -Djdk.net.hosts.file=TestHostsFile.txt
+ *    -Djava.net.preferIPv4Stack=false -Djava.net.preferIPv6Addresses=true ${test.main.class}
+ * @run junit/othervm -Djdk.net.hosts.file=TestHostsFile.txt
+ *    -Djava.net.preferIPv4Stack=false -Djava.net.preferIPv6Addresses=false ${test.main.class}
+ * @run junit/othervm -Djdk.net.hosts.file=TestHostsFile.txt
+ *    -Djava.net.preferIPv4Stack=false -Djava.net.preferIPv6Addresses=system ${test.main.class}
+ * @run junit/othervm -Djdk.net.hosts.file=TestHostsFile.txt
+ *    -Djava.net.preferIPv4Stack=false -Djava.net.preferIPv6Addresses=notVALID ${test.main.class}
+ * @run junit/othervm -Djdk.net.hosts.file=TestHostsFile.txt ${test.main.class}
  */
 
 public class HostsFileOrderingTest {
@@ -70,8 +70,8 @@ public class HostsFileOrderingTest {
     /*
      * Generate hosts file with the predefined list of IP addresses
      */
-    @BeforeClass
-    public void generateHostsFile() throws Exception {
+    @BeforeAll
+    public static void generateHostsFile() throws Exception {
         String content = ADDRESSES_LIST.stream()
                 .map(addr -> addr + " " + TEST_HOST_NAME)
                 .collect(
@@ -97,7 +97,7 @@ public class HostsFileOrderingTest {
         } else {
             System.err.printf("Expected addresses:%n%s%n", Arrays.deepToString(expectedAddresses));
             System.err.printf("Resolved addresses:%n%s%n", Arrays.deepToString(resolvedAddresses));
-            Assert.fail("Wrong host resolution result is returned");
+            fail("Wrong host resolution result is returned");
         }
     }
 
diff --git a/test/jdk/java/net/InetSocketAddress/ToString.java b/test/jdk/java/net/InetSocketAddress/ToString.java
index 12eb599b872..a86e6c714f0 100644
--- a/test/jdk/java/net/InetSocketAddress/ToString.java
+++ b/test/jdk/java/net/InetSocketAddress/ToString.java
@@ -26,21 +26,27 @@
  * @bug 8225499 4464064
  * @library /test/lib
  * @summary InetSocketAddress::toString not friendly to IPv6 literal addresses
- * @run testng/othervm ToString
- * @run testng/othervm -Djava.net.preferIPv4Stack=true ToString
- * @run testng/othervm -Djava.net.preferIPv6Addresses=true ToString
+ * @run junit/othervm ${test.main.class}
+ * @run junit/othervm -Djava.net.preferIPv4Stack=true ${test.main.class}
+ * @run junit/othervm -Djava.net.preferIPv6Addresses=true ${test.main.class}
  */
 
-import java.net.*;
-import java.util.Optional;
-
-import org.testng.SkipException;
-import org.testng.annotations.BeforeTest;
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
+import java.net.Inet6Address;
+import java.net.InetAddress;
+import java.net.InetSocketAddress;
+import java.net.UnknownHostException;
 
 import static jdk.test.lib.net.IPSupport.diagnoseConfigurationIssue;
 
+import org.junit.jupiter.api.Assumptions;
+import org.junit.jupiter.api.BeforeAll;
+import org.junit.jupiter.api.Test;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
+
+import static org.junit.jupiter.api.Assertions.assertDoesNotThrow;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+
 public class ToString {
 
     private static final String loopbackAddr;
@@ -75,22 +81,19 @@ public class ToString {
         }
     }
 
-    @BeforeTest
-    public void setup() {
-        Optional<String> configurationIssue = diagnoseConfigurationIssue();
-        configurationIssue.map(SkipException::new).ifPresent(x -> {
-            throw x;
-        });
+    @BeforeAll
+    public static void setup() {
+        diagnoseConfigurationIssue().ifPresent(Assumptions::abort);
     }
 
     @Test
-    // InetSocketAddress.toString() throws NPE with unresolved address
-    public static void NPETest() {
-        System.out.println(new InetSocketAddress("unresolved", 12345));
+    public void NPETest() {
+        // Test that InetSocketAddress.toString() does not throw NPE with unresolved address
+        assertDoesNotThrow(() -> System.out.println(
+                new InetSocketAddress("unresolved", 12345)));
     }
 
-    @DataProvider(name = "hostPortArgs")
-    public Object[][] createArgs1() {
+    public static Object[][] fromHostStringAndPort() {
         return new Object[][]{
                 // hostname, port number, expected string in format
                 // <hostname>/<IP literal>:<port> or
@@ -106,44 +109,34 @@ public class ToString {
         };
     }
 
-    @Test(dataProvider = "hostPortArgs")
-    public static void testConstructor(String host, int port, String string) {
+    @ParameterizedTest
+    @MethodSource("fromHostStringAndPort")
+    public void testConstructor(String host, int port, String string) {
         String received = new InetSocketAddress(host, port).toString();
-
-        if (!string.equals(received)) {
-            throw new RuntimeException("Expected: " + string + " Received: " + received);
-        }
+        assertEquals(string, received);
     }
 
-    @DataProvider(name = "addrPortArgs")
-    public Object[][] createArgs2() {
+    public static Object[][] fromInetAddressAndPort() throws UnknownHostException {
         InetAddress nullAddr = null;
-        try {
-            return new Object[][]{
-                    // InetAddress, port number, expected string
-                    {InetAddress.getLoopbackAddress(), 80, "localhost/" + loopbackAddr + ":80"},
-                    {InetAddress.getLocalHost(), 80, localAddr + ":80"},
-                    {InetAddress.getByAddress(new byte[]{1, 1, 1, 1}), 80, "/1.1.1.1:80"},
-                    {InetAddress.getByAddress(new byte[]{1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1}), 80, "/[101:101:101:101:101:101:101:101]:80"},
-                    {InetAddress.getByName("225.225.225.0"), 80, "/225.225.225.0:80"},
-                    {nullAddr, 80, wildcardAddr + ":80"}
-            };
-        } catch (UnknownHostException uhe) {
-            throw new RuntimeException("Data provider creation failed: " + uhe, uhe);
-        }
+        return new Object[][]{
+                // InetAddress, port number, expected string
+                {InetAddress.getLoopbackAddress(), 80, "localhost/" + loopbackAddr + ":80"},
+                {InetAddress.getLocalHost(), 80, localAddr + ":80"},
+                {InetAddress.getByAddress(new byte[]{1, 1, 1, 1}), 80, "/1.1.1.1:80"},
+                {InetAddress.getByAddress(new byte[]{1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1}), 80, "/[101:101:101:101:101:101:101:101]:80"},
+                {InetAddress.getByName("225.225.225.0"), 80, "/225.225.225.0:80"},
+                {nullAddr, 80, wildcardAddr + ":80"}
+        };
     }
 
-    @Test(dataProvider = "addrPortArgs")
-    public static void testConstructor(InetAddress addr, int port, String string) {
+    @ParameterizedTest
+    @MethodSource("fromInetAddressAndPort")
+    public void testConstructor(InetAddress addr, int port, String string) {
         String received = new InetSocketAddress(addr, port).toString();
-
-        if (!string.equals(received)) {
-            throw new RuntimeException("Expected: " + string + " Received: " + received);
-        }
+        assertEquals(string, received);
     }
 
-    @DataProvider(name = "unresolved")
-    public Object[][] createArgs3() {
+    public static Object[][] unresolvedFromHostStringAndPort() {
         return new Object[][]{
                 // hostname, port number, expected string
                 {"::1", 80, "::1/<unresolved>:80"},
@@ -158,12 +151,10 @@ public class ToString {
         };
     }
 
-    @Test(dataProvider = "unresolved")
-    public static void testCreateUnresolved(String host, int port, String string) {
+    @ParameterizedTest
+    @MethodSource("unresolvedFromHostStringAndPort")
+    public void testCreateUnresolved(String host, int port, String string) {
         String received = InetSocketAddress.createUnresolved(host, port).toString();
-
-        if (!string.equals(received)) {
-            throw new RuntimeException("Expected: " + string + " Received: " + received);
-        }
+        assertEquals(string, received);
     }
 }
diff --git a/test/jdk/java/net/NetworkInterface/NullMacAddress.java b/test/jdk/java/net/NetworkInterface/NullMacAddress.java
index 8161670860e..8edb447e44e 100644
--- a/test/jdk/java/net/NetworkInterface/NullMacAddress.java
+++ b/test/jdk/java/net/NetworkInterface/NullMacAddress.java
@@ -26,34 +26,30 @@
  * @summary Test that querrying the mac address of the loopback interface
  *          returns null and doesn't throw a SocketException.
  * @library /test/lib
- * @run testng/othervm NullMacAddress
- * @run testng/othervm -Djava.net.preferIPv6Addresses=true NullMacAddress
- * @run testng/othervm -Djava.net.preferIPv4Stack=true NullMacAddress
+ * @run junit/othervm ${test.main.class}
+ * @run junit/othervm -Djava.net.preferIPv6Addresses=true ${test.main.class}
+ * @run junit/othervm -Djava.net.preferIPv4Stack=true ${test.main.class}
  */
 
-import org.testng.SkipException;
-import org.testng.annotations.BeforeTest;
-import org.testng.annotations.Test;
-
 import static jdk.test.lib.net.IPSupport.diagnoseConfigurationIssue;
-import static org.testng.Assert.*;
 
 import java.io.UncheckedIOException;
 import java.math.BigInteger;
 import java.net.NetworkInterface;
 import java.net.SocketException;
 import java.util.Locale;
-import java.util.Optional;
+
+import org.junit.jupiter.api.Assumptions;
+import org.junit.jupiter.api.BeforeAll;
+import org.junit.jupiter.api.Test;
+import static org.junit.jupiter.api.Assertions.assertNull;
 
 
 public class NullMacAddress {
 
-    @BeforeTest
-    void setup() {
-        Optional<String> configurationIssue = diagnoseConfigurationIssue();
-        configurationIssue.map(SkipException::new).ifPresent(x -> {
-            throw x;
-        });
+    @BeforeAll
+    public static void setup() {
+        diagnoseConfigurationIssue().ifPresent(Assumptions::abort);
     }
 
     @Test
@@ -64,13 +60,13 @@ public class NullMacAddress {
     private void testMacAddress(NetworkInterface ni) {
         try {
             var name = ni.getDisplayName();
-            System.out.println("Testing: " + name);
+            System.err.println("Testing: " + name);
             var loopback = ni.isLoopback();
             var macAddress = ni.getHardwareAddress();
             var hdr = macAddress == null ? "null"
                     : "0x" + new BigInteger(1, macAddress)
                     .toString(16).toUpperCase(Locale.ROOT);
-            System.out.println("   MAC address: " + hdr + (loopback ? " (loopback)" : ""));
+            System.err.println("   MAC address: " + hdr + (loopback ? " (loopback)" : ""));
             if (loopback) {
                 assertNull(macAddress, "Loopback interface \""
                         + name + "\" doesn't have a null MAC Address");
diff --git a/test/jdk/java/net/SocketOption/AfterClose.java b/test/jdk/java/net/SocketOption/AfterClose.java
index 825f344c662..e8cedab7dad 100644
--- a/test/jdk/java/net/SocketOption/AfterClose.java
+++ b/test/jdk/java/net/SocketOption/AfterClose.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2019, 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2019, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,12 +25,11 @@
  * @test
  * @bug 8224477
  * @summary Ensures that IOException is thrown after the socket is closed
- * @run testng AfterClose
+ * @run junit ${test.main.class}
  */
 
 import java.io.IOException;
 import java.lang.reflect.Field;
-import java.lang.reflect.Method;
 import java.net.DatagramSocket;
 import java.net.MulticastSocket;
 import java.net.NetworkInterface;
@@ -48,11 +47,12 @@ import java.util.List;
 import java.util.Map;
 import java.util.stream.Collectors;
 
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
 import static java.lang.Boolean.*;
 import static java.net.StandardSocketOptions.*;
-import static org.testng.Assert.expectThrows;
+
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
+import static org.junit.jupiter.api.Assertions.assertThrows;
 
 public class AfterClose {
 
@@ -117,8 +117,7 @@ public class AfterClose {
 
     // -- Socket
 
-    @DataProvider(name = "socketOptionValues")
-    public Object[][] socketOptionValues() throws Exception {
+    public static Object[][] socketOptionValues() throws Exception {
         try (Socket s = new Socket()) {
             return s.supportedOptions().stream()
                     .map(so -> new Object[] {so, OPTION_VALUES_MAP.get(so)})
@@ -126,49 +125,51 @@ public class AfterClose {
         }
     }
 
-    @Test(dataProvider = "socketOptionValues")
+    @ParameterizedTest
+    @MethodSource("socketOptionValues")
     public <T> void closedSocketImplUncreated(SocketOption<T> option, List<T> values)
         throws IOException
     {
         Socket socket = createClosedSocketImplUncreated();
         for (int i=0; i<3; i++); {
             for (T value : values) {
-                expectThrows(IOE, () -> socket.setOption(option, value));
-                expectThrows(IOE, () -> socket.getOption(option));
+                assertThrows(IOE, () -> socket.setOption(option, value));
+                assertThrows(IOE, () -> socket.getOption(option));
             }
         }
     }
 
-    @Test(dataProvider = "socketOptionValues")
+    @ParameterizedTest
+    @MethodSource("socketOptionValues")
     public <T> void closedSocketImplCreated(SocketOption<T> option, List<T> values)
         throws IOException
     {
         Socket socket = createClosedSocketImplCreated();
         for (int i=0; i<3; i++); {
             for (T value : values) {
-                expectThrows(IOE, () -> socket.setOption(option, value));
-                expectThrows(IOE, () -> socket.getOption(option));
+                assertThrows(IOE, () -> socket.setOption(option, value));
+                assertThrows(IOE, () -> socket.getOption(option));
             }
         }
     }
 
-    @Test(dataProvider = "socketOptionValues")
+    @ParameterizedTest
+    @MethodSource("socketOptionValues")
     public <T> void closedSocketAdapter(SocketOption<T> option, List<T> values)
         throws IOException
     {
         Socket socket = createClosedSocketFromAdapter();
         for (int i=0; i<3; i++); {
             for (T value : values) {
-                if (!RO.equals(value)) expectThrows(IOE, () -> socket.setOption(option, value));
-                expectThrows(IOE, () -> socket.getOption(option));
+                if (!RO.equals(value)) assertThrows(IOE, () -> socket.setOption(option, value));
+                assertThrows(IOE, () -> socket.getOption(option));
             }
         }
     }
 
     // -- ServerSocket
 
-    @DataProvider(name = "serverSocketOptionValues")
-    public Object[][] serverSocketOptionValues() throws Exception {
+    public static Object[][] serverSocketOptionValues() throws Exception {
         try (ServerSocket ss = new ServerSocket()) {
             return ss.supportedOptions().stream()
                      .map(so -> new Object[] {so, OPTION_VALUES_MAP.get(so)})
@@ -176,33 +177,36 @@ public class AfterClose {
         }
     }
 
-    @Test(dataProvider = "serverSocketOptionValues")
+    @ParameterizedTest
+    @MethodSource("serverSocketOptionValues")
     public <T> void closedServerSocketImplUncreated(SocketOption<T> option, List<T> values)
         throws IOException
     {
         ServerSocket serverSocket = createClosedServerSocketImplUncreated();
         for (int i=0; i<3; i++); {
             for (T value : values) {
-                expectThrows(IOE, () -> serverSocket.setOption(option, value));
-                expectThrows(IOE, () -> serverSocket.getOption(option));
+                assertThrows(IOE, () -> serverSocket.setOption(option, value));
+                assertThrows(IOE, () -> serverSocket.getOption(option));
             }
         }
     }
 
-    @Test(dataProvider = "serverSocketOptionValues")
+    @ParameterizedTest
+    @MethodSource("serverSocketOptionValues")
     public <T> void closedServerSocketImplCreated(SocketOption<T> option, List<T> values)
         throws IOException
     {
         ServerSocket serverSocket = createClosedServerSocketImplCreated();
         for (int i=0; i<3; i++); {
             for (T value : values) {
-                expectThrows(IOE, () -> serverSocket.setOption(option, value));
-                expectThrows(IOE, () -> serverSocket.getOption(option));
+                assertThrows(IOE, () -> serverSocket.setOption(option, value));
+                assertThrows(IOE, () -> serverSocket.getOption(option));
             }
         }
     }
 
-    @Test(dataProvider = "serverSocketOptionValues")
+    @ParameterizedTest
+    @MethodSource("serverSocketOptionValues")
     public <T> void closedServerSocketAdapter(SocketOption<T> option, List<T> values)
         throws IOException
     {
@@ -212,16 +216,15 @@ public class AfterClose {
         ServerSocket serverSocket = createClosedServerSocketFromAdapter();
         for (int i=0; i<3; i++); {
             for (T value : values) {
-                if (!RO.equals(value)) expectThrows(IOE, () -> serverSocket.setOption(option, value));
-                expectThrows(IOE, () -> serverSocket.getOption(option));
+                if (!RO.equals(value)) assertThrows(IOE, () -> serverSocket.setOption(option, value));
+                assertThrows(IOE, () -> serverSocket.getOption(option));
             }
         }
     }
 
     // -- DatagramSocket
 
-    @DataProvider(name = "datagramSocketOptionValues")
-    public Object[][] datagramSocketOptionValues() throws Exception {
+    public static Object[][] datagramSocketOptionValues() throws Exception {
         try (DatagramSocket ds = new DatagramSocket()) {
             return ds.supportedOptions().stream()
                      .map(so -> new Object[] {so, OPTION_VALUES_MAP.get(so)})
@@ -229,49 +232,51 @@ public class AfterClose {
         }
     }
 
-    @Test(dataProvider = "datagramSocketOptionValues")
+    @ParameterizedTest
+    @MethodSource("datagramSocketOptionValues")
     public <T> void closedUnboundDatagramSocket(SocketOption<T> option, List<T> values)
         throws IOException
     {
         DatagramSocket datagramSocket = createClosedUnboundDatagramSocket();
         for (int i=0; i<3; i++); {
             for (T value : values) {
-                if (!RO.equals(value)) expectThrows(IOE, () -> datagramSocket.setOption(option, value));
-                expectThrows(IOE, () -> datagramSocket.getOption(option));
+                if (!RO.equals(value)) assertThrows(IOE, () -> datagramSocket.setOption(option, value));
+                assertThrows(IOE, () -> datagramSocket.getOption(option));
             }
         }
     }
 
-    @Test(dataProvider = "datagramSocketOptionValues")
+    @ParameterizedTest
+    @MethodSource("datagramSocketOptionValues")
     public <T> void closedBoundDatagramSocket(SocketOption<T> option, List<T> values)
         throws IOException
     {
         DatagramSocket datagramSocket = createClosedBoundDatagramSocket();
         for (int i=0; i<3; i++); {
             for (T value : values) {
-                if (!RO.equals(value)) expectThrows(IOE, () -> datagramSocket.setOption(option, value));
-                expectThrows(IOE, () -> datagramSocket.getOption(option));
+                if (!RO.equals(value)) assertThrows(IOE, () -> datagramSocket.setOption(option, value));
+                assertThrows(IOE, () -> datagramSocket.getOption(option));
             }
         }
     }
 
-    @Test(dataProvider = "datagramSocketOptionValues")
+    @ParameterizedTest
+    @MethodSource("datagramSocketOptionValues")
     public <T> void closedDatagramAdapter(SocketOption<T> option, List<T> values)
         throws IOException
     {
         DatagramSocket datagramSocket = createClosedBoundDatagramSocket();
         for (int i=0; i<3; i++); {
             for (T value : values) {
-                if (!RO.equals(value)) expectThrows(IOE, () -> datagramSocket.setOption(option, value));
-                expectThrows(IOE, () -> datagramSocket.getOption(option));
+                if (!RO.equals(value)) assertThrows(IOE, () -> datagramSocket.setOption(option, value));
+                assertThrows(IOE, () -> datagramSocket.getOption(option));
             }
         }
     }
 
     // -- MulticastSocket
 
-    @DataProvider(name = "multicastSocketOptionValues")
-    public Object[][] multicastSocketOptionValues() throws Exception {
+    public static Object[][] multicastSocketOptionValues() throws Exception {
         try (MulticastSocket ms = new MulticastSocket()) {
             return ms.supportedOptions().stream()
                      .map(so -> new Object[] {so, OPTION_VALUES_MAP.get(so)})
@@ -279,28 +284,30 @@ public class AfterClose {
         }
     }
 
-    @Test(dataProvider = "multicastSocketOptionValues")
+    @ParameterizedTest
+    @MethodSource("multicastSocketOptionValues")
     public <T> void closedUnboundMulticastSocket(SocketOption<T> option, List<T> values)
         throws IOException
     {
         MulticastSocket multicastSocket = createClosedUnboundMulticastSocket();
         for (int i=0; i<3; i++); {
             for (T value : values) {
-                if (!RO.equals(value)) expectThrows(IOE, () -> multicastSocket.setOption(option, value));
-                expectThrows(IOE, () -> multicastSocket.getOption(option));
+                if (!RO.equals(value)) assertThrows(IOE, () -> multicastSocket.setOption(option, value));
+                assertThrows(IOE, () -> multicastSocket.getOption(option));
             }
         }
     }
 
-    @Test(dataProvider = "multicastSocketOptionValues")
+    @ParameterizedTest
+    @MethodSource("multicastSocketOptionValues")
     public <T> void closedBoundMulticastSocket(SocketOption<T> option, List<T> values)
         throws IOException
     {
         MulticastSocket multicastSocket = createClosedBoundMulticastSocket();
         for (int i=0; i<3; i++); {
             for (T value : values) {
-                if (!RO.equals(value)) expectThrows(IOE, () -> multicastSocket.setOption(option, value));
-                expectThrows(IOE, () -> multicastSocket.getOption(option));
+                if (!RO.equals(value)) assertThrows(IOE, () -> multicastSocket.setOption(option, value));
+                assertThrows(IOE, () -> multicastSocket.getOption(option));
             }
         }
     }
diff --git a/test/jdk/java/net/SocketOption/CachedImplOptions.java b/test/jdk/java/net/SocketOption/CachedImplOptions.java
index 955414559c2..a5e3ec8f67c 100644
--- a/test/jdk/java/net/SocketOption/CachedImplOptions.java
+++ b/test/jdk/java/net/SocketOption/CachedImplOptions.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2020, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,8 +25,8 @@
  * @test
  * @bug 8241988
  * @summary Checks that the caching of options does not affect other impls
- * @run testng/othervm CachedImplOptions
- * @run testng/othervm -Djava.net.preferIPv4Stack=true CachedImplOptions
+ * @run junit/othervm ${test.main.class}
+ * @run junit/othervm -Djava.net.preferIPv4Stack=true ${test.main.class}
  */
 
 import java.io.IOException;
@@ -46,8 +46,11 @@ import java.net.SocketImpl;
 import java.net.SocketOption;
 import java.net.StandardSocketOptions;
 import java.util.Set;
-import org.testng.annotations.Test;
-import static org.testng.Assert.*;
+
+import org.junit.jupiter.api.Test;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertTrue;
 
 public class CachedImplOptions {
 
@@ -58,16 +61,16 @@ public class CachedImplOptions {
             assertTrue(impl.supportedOptions().contains(StandardSocketOptions.SO_SNDBUF));
         }
         try (var impl = new DatagramSocket(new FooDatagramSocketImpl()) {}) {
-            assertEquals(impl.supportedOptions(), Set.of(FooDatagramSocketImpl.FOO_OPTION));
-            assertEquals(impl.supportedOptions(), Set.of(FooDatagramSocketImpl.FOO_OPTION));
+            assertEquals(Set.of(FooDatagramSocketImpl.FOO_OPTION), impl.supportedOptions());
+            assertEquals(Set.of(FooDatagramSocketImpl.FOO_OPTION), impl.supportedOptions());
         }
         try (var impl = new DatagramSocket(new BarDatagramSocketImpl()) {}) {
-            assertEquals(impl.supportedOptions(), Set.of(BarDatagramSocketImpl.BAR_OPTION));
-            assertEquals(impl.supportedOptions(), Set.of(BarDatagramSocketImpl.BAR_OPTION));
+            assertEquals(Set.of(BarDatagramSocketImpl.BAR_OPTION), impl.supportedOptions());
+            assertEquals(Set.of(BarDatagramSocketImpl.BAR_OPTION), impl.supportedOptions());
         }
         try (var impl = new DatagramSocket(new BazDatagramSocketImpl()) {}) {
-            assertEquals(impl.supportedOptions(), Set.of(BazDatagramSocketImpl.BAZ_OPTION));
-            assertEquals(impl.supportedOptions(), Set.of(BazDatagramSocketImpl.BAZ_OPTION));
+            assertEquals(Set.of(BazDatagramSocketImpl.BAZ_OPTION), impl.supportedOptions());
+            assertEquals(Set.of(BazDatagramSocketImpl.BAZ_OPTION), impl.supportedOptions());
         }
         try (var impl = new DatagramSocket()) {
             assertTrue(impl.supportedOptions().contains(StandardSocketOptions.SO_SNDBUF));
@@ -86,8 +89,8 @@ public class CachedImplOptions {
         DatagramSocket.setDatagramSocketImplFactory(() -> new FooDatagramSocketImpl());
 
         try (var impl = new MulticastSocket()) {
-            assertEquals(impl.supportedOptions(), Set.of(FooDatagramSocketImpl.FOO_OPTION));
-            assertEquals(impl.supportedOptions(), Set.of(FooDatagramSocketImpl.FOO_OPTION));
+            assertEquals(Set.of(FooDatagramSocketImpl.FOO_OPTION), impl.supportedOptions());
+            assertEquals(Set.of(FooDatagramSocketImpl.FOO_OPTION), impl.supportedOptions());
         }
     }
 
@@ -144,16 +147,16 @@ public class CachedImplOptions {
             assertTrue(impl.supportedOptions().contains(StandardSocketOptions.SO_SNDBUF));
         }
         try (var impl = new Socket(new LarrySocketImpl()) {}) {
-            assertEquals(impl.supportedOptions(), Set.of(LarrySocketImpl.LARRY_OPTION));
-            assertEquals(impl.supportedOptions(), Set.of(LarrySocketImpl.LARRY_OPTION));
+            assertEquals(Set.of(LarrySocketImpl.LARRY_OPTION), impl.supportedOptions());
+            assertEquals(Set.of(LarrySocketImpl.LARRY_OPTION), impl.supportedOptions());
         }
         try (var impl = new Socket(new CurlySocketImpl()) {}) {
-            assertEquals(impl.supportedOptions(), Set.of(CurlySocketImpl.CURLY_OPTION));
-            assertEquals(impl.supportedOptions(), Set.of(CurlySocketImpl.CURLY_OPTION));
+            assertEquals(Set.of(CurlySocketImpl.CURLY_OPTION), impl.supportedOptions());
+            assertEquals(Set.of(CurlySocketImpl.CURLY_OPTION), impl.supportedOptions());
         }
         try (var impl = new Socket(new MoeSocketImpl()) {}) {
-            assertEquals(impl.supportedOptions(), Set.of(MoeSocketImpl.MOE_OPTION));
-            assertEquals(impl.supportedOptions(), Set.of(MoeSocketImpl.MOE_OPTION));
+            assertEquals(Set.of(MoeSocketImpl.MOE_OPTION), impl.supportedOptions());
+            assertEquals(Set.of(MoeSocketImpl.MOE_OPTION), impl.supportedOptions());
         }
         try (var impl = new Socket()) {
             assertTrue(impl.supportedOptions().contains(StandardSocketOptions.SO_SNDBUF));
@@ -168,16 +171,16 @@ public class CachedImplOptions {
             assertTrue(impl.supportedOptions().contains(StandardSocketOptions.SO_RCVBUF));
         }
         try (var impl = new ServerSocket(new LarrySocketImpl()) {}) {
-            assertEquals(impl.supportedOptions(), Set.of(LarrySocketImpl.LARRY_OPTION));
-            assertEquals(impl.supportedOptions(), Set.of(LarrySocketImpl.LARRY_OPTION));
+            assertEquals(Set.of(LarrySocketImpl.LARRY_OPTION), impl.supportedOptions());
+            assertEquals(Set.of(LarrySocketImpl.LARRY_OPTION), impl.supportedOptions());
         }
         try (var impl = new ServerSocket(new CurlySocketImpl()) {}) {
-            assertEquals(impl.supportedOptions(), Set.of(CurlySocketImpl.CURLY_OPTION));
-            assertEquals(impl.supportedOptions(), Set.of(CurlySocketImpl.CURLY_OPTION));
+            assertEquals(Set.of(CurlySocketImpl.CURLY_OPTION), impl.supportedOptions());
+            assertEquals(Set.of(CurlySocketImpl.CURLY_OPTION), impl.supportedOptions());
         }
         try (var impl = new ServerSocket(new MoeSocketImpl()) {}) {
-            assertEquals(impl.supportedOptions(), Set.of(MoeSocketImpl.MOE_OPTION));
-            assertEquals(impl.supportedOptions(), Set.of(MoeSocketImpl.MOE_OPTION));
+            assertEquals(Set.of(MoeSocketImpl.MOE_OPTION), impl.supportedOptions());
+            assertEquals(Set.of(MoeSocketImpl.MOE_OPTION), impl.supportedOptions());
         }
         try (var impl = new ServerSocket()) {
             assertTrue(impl.supportedOptions().contains(StandardSocketOptions.SO_RCVBUF));
diff --git a/test/jdk/java/net/SocketOption/ImmutableOptions.java b/test/jdk/java/net/SocketOption/ImmutableOptions.java
index 372a0322a35..14b50afa8d3 100644
--- a/test/jdk/java/net/SocketOption/ImmutableOptions.java
+++ b/test/jdk/java/net/SocketOption/ImmutableOptions.java
@@ -26,69 +26,84 @@
  * @bug 8148609
  * @library /test/lib
  * @summary Assert that the set of socket options are immutable
- * @run testng/othervm ImmutableOptions
- * @run testng/othervm -Djava.net.preferIPv4Stack=true ImmutableOptions
+ * @run junit/othervm ${test.main.class}
+ * @run junit/othervm -Djava.net.preferIPv4Stack=true ${test.main.class}
  */
 import java.io.IOException;
 import java.io.InputStream;
 import java.io.OutputStream;
-import java.net.*;
-import java.util.Optional;
+import java.net.DatagramPacket;
+import java.net.DatagramSocket;
+import java.net.DatagramSocketImpl;
+import java.net.InetAddress;
+import java.net.NetworkInterface;
+import java.net.ServerSocket;
+import java.net.Socket;
+import java.net.SocketAddress;
+import java.net.SocketException;
+import java.net.SocketImpl;
+import java.net.SocketImplFactory;
+import java.net.SocketOption;
 import java.util.Set;
 
-import org.testng.SkipException;
-import org.testng.annotations.BeforeTest;
-import org.testng.annotations.Test;
-
 import static jdk.test.lib.net.IPSupport.diagnoseConfigurationIssue;
 
+import org.junit.jupiter.api.Assumptions;
+import org.junit.jupiter.api.BeforeAll;
+import org.junit.jupiter.api.Test;
+import static org.junit.jupiter.api.Assertions.assertThrows;
+
 public class ImmutableOptions {
 
-    @BeforeTest
-    void setupServerSocketFactory() throws IOException {
-        Optional<String> configurationIssue = diagnoseConfigurationIssue();
-        configurationIssue.map(SkipException::new).ifPresent(x -> {
-            throw x;
-        });
+    @BeforeAll
+    public static void setupServerSocketFactory() throws IOException {
+        diagnoseConfigurationIssue().ifPresent(Assumptions::abort);
         ServerSocket.setSocketFactory(new ServerSocketImplFactory());
     }
 
-    @Test(expectedExceptions = UnsupportedOperationException.class)
+    @Test
     public void socketThrows() throws IOException {
         CustomSocketImpl impl = new CustomSocketImpl();
         Socket socket = new CustomSocket(impl);
-        socket.supportedOptions().clear();
+        Set<SocketOption<?>> options = socket.supportedOptions();
+        assertThrows(UnsupportedOperationException.class, options::clear);
     }
 
-    @Test(expectedExceptions = UnsupportedOperationException.class)
+    @Test
     public void socketImplThrows() throws IOException {
         CustomSocketImpl impl = new CustomSocketImpl();
-        impl.supportedOptions().clear();
+        var options = impl.supportedOptions();
+        assertThrows(UnsupportedOperationException.class, options::clear);
     }
 
-    @Test(expectedExceptions = UnsupportedOperationException.class)
+    @Test
     public void serverSocketThrows() throws IOException {
         ServerSocket ss = new ServerSocket();
-        ss.supportedOptions().clear();
+        Set<SocketOption<?>> options = ss.supportedOptions();
+        assertThrows(UnsupportedOperationException.class, options::clear);
     }
 
-    @Test(expectedExceptions = UnsupportedOperationException.class)
+    @Test
     public void serverSocketImplThrows() throws IOException {
         ServerSocket ss = new ServerSocket();
-        ServerSocketImplFactory.mostRecentlyCreated.supportedOptions().clear();
+        Set<SocketOption<?>> options =
+                ServerSocketImplFactory.mostRecentlyCreated.supportedOptions();
+        assertThrows(UnsupportedOperationException.class, options::clear);
     }
 
-    @Test(expectedExceptions = UnsupportedOperationException.class)
+    @Test
     public void datagramSocketThrows() throws IOException {
         CustomDatagramSocketImpl impl = new CustomDatagramSocketImpl();
         DatagramSocket socket = new CustomDatagramSocket(impl);
-        socket.supportedOptions().clear();
+        Set<SocketOption<?>> options = socket.supportedOptions();
+        assertThrows(UnsupportedOperationException.class, options::clear);
     }
 
-    @Test(expectedExceptions = UnsupportedOperationException.class)
+    @Test
     public void datagramSocketImplThrows() throws IOException {
         CustomDatagramSocketImpl impl = new CustomDatagramSocketImpl();
-        impl.supportedOptions().clear();
+        Set<SocketOption<?>> options = impl.supportedOptions();
+        assertThrows(UnsupportedOperationException.class, options::clear);
     }
 
 
diff --git a/test/jdk/java/net/SocketOption/NullsAndBadValues.java b/test/jdk/java/net/SocketOption/NullsAndBadValues.java
index 842fd4bc229..d6dab5fa327 100644
--- a/test/jdk/java/net/SocketOption/NullsAndBadValues.java
+++ b/test/jdk/java/net/SocketOption/NullsAndBadValues.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2019, 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2019, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,8 +25,8 @@
  * @test
  * @bug 8224477
  * @summary Basic test for NPE, UOE, and IAE for get/setOption
- * @run testng NullsAndBadValues
- * @run testng/othervm -Dsun.net.useExclusiveBind=false NullsAndBadValues
+ * @run junit ${test.main.class}
+ * @run junit/othervm -Dsun.net.useExclusiveBind=false ${test.main.class}
  */
 
 import java.net.DatagramSocket;
@@ -43,11 +43,13 @@ import java.util.HashMap;
 import java.util.List;
 import java.util.Map;
 import java.util.stream.Stream;
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
 import static java.lang.Boolean.*;
 import static java.net.StandardSocketOptions.*;
-import static org.testng.Assert.expectThrows;
+
+import org.junit.jupiter.api.Test;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
+import static org.junit.jupiter.api.Assertions.assertThrows;
 
 public class NullsAndBadValues {
 
@@ -58,46 +60,46 @@ public class NullsAndBadValues {
     @Test
     public void nulls() throws Exception {
         try (Socket s = new Socket()) {
-            expectThrows(NPE, () -> s.setOption(null, null));
-            expectThrows(NPE, () -> s.setOption(null, ""));
-            expectThrows(NPE, () -> s.setOption(null, 1));
-            expectThrows(NPE, () -> s.getOption(null));
+            assertThrows(NPE, () -> s.setOption(null, null));
+            assertThrows(NPE, () -> s.setOption(null, ""));
+            assertThrows(NPE, () -> s.setOption(null, 1));
+            assertThrows(NPE, () -> s.getOption(null));
         }
         try (ServerSocket ss = new ServerSocket()) {
-            expectThrows(NPE, () -> ss.setOption(null, null));
-            expectThrows(NPE, () -> ss.setOption(null, ""));
-            expectThrows(NPE, () -> ss.setOption(null, 1));
-            expectThrows(NPE, () -> ss.getOption(null));
+            assertThrows(NPE, () -> ss.setOption(null, null));
+            assertThrows(NPE, () -> ss.setOption(null, ""));
+            assertThrows(NPE, () -> ss.setOption(null, 1));
+            assertThrows(NPE, () -> ss.getOption(null));
         }
         try (DatagramSocket ds = new DatagramSocket()) {
-            expectThrows(NPE, () -> ds.setOption(null, null));
-            expectThrows(NPE, () -> ds.setOption(null, ""));
-            expectThrows(NPE, () -> ds.setOption(null, 1));
-            expectThrows(NPE, () -> ds.getOption(null));
+            assertThrows(NPE, () -> ds.setOption(null, null));
+            assertThrows(NPE, () -> ds.setOption(null, ""));
+            assertThrows(NPE, () -> ds.setOption(null, 1));
+            assertThrows(NPE, () -> ds.getOption(null));
         }
         try (MulticastSocket ms = new MulticastSocket()) {
-            expectThrows(NPE, () -> ms.setOption(null, null));
-            expectThrows(NPE, () -> ms.setOption(null, ""));
-            expectThrows(NPE, () -> ms.setOption(null, 1));
-            expectThrows(NPE, () -> ms.getOption(null));
+            assertThrows(NPE, () -> ms.setOption(null, null));
+            assertThrows(NPE, () -> ms.setOption(null, ""));
+            assertThrows(NPE, () -> ms.setOption(null, 1));
+            assertThrows(NPE, () -> ms.getOption(null));
         }
         try (Socket sa = SocketChannel.open().socket()) {
-            expectThrows(NPE, () -> sa.setOption(null, null));
-            expectThrows(NPE, () -> sa.setOption(null, ""));
-            expectThrows(NPE, () -> sa.setOption(null, 1));
-            expectThrows(NPE, () -> sa.getOption(null));
+            assertThrows(NPE, () -> sa.setOption(null, null));
+            assertThrows(NPE, () -> sa.setOption(null, ""));
+            assertThrows(NPE, () -> sa.setOption(null, 1));
+            assertThrows(NPE, () -> sa.getOption(null));
         }
         try (ServerSocket ssa = ServerSocketChannel.open().socket()) {
-            expectThrows(NPE, () -> ssa.setOption(null, null));
-            expectThrows(NPE, () -> ssa.setOption(null, ""));
-            expectThrows(NPE, () -> ssa.setOption(null, 1));
-            expectThrows(NPE, () -> ssa.getOption(null));
+            assertThrows(NPE, () -> ssa.setOption(null, null));
+            assertThrows(NPE, () -> ssa.setOption(null, ""));
+            assertThrows(NPE, () -> ssa.setOption(null, 1));
+            assertThrows(NPE, () -> ssa.getOption(null));
         }
         try (DatagramSocket dsa = DatagramChannel.open().socket()) {
-            expectThrows(NPE, () -> dsa.setOption(null, null));
-            expectThrows(NPE, () -> dsa.setOption(null, ""));
-            expectThrows(NPE, () -> dsa.setOption(null, 1));
-            expectThrows(NPE, () -> dsa.getOption(null));
+            assertThrows(NPE, () -> dsa.setOption(null, null));
+            assertThrows(NPE, () -> dsa.setOption(null, ""));
+            assertThrows(NPE, () -> dsa.setOption(null, 1));
+            assertThrows(NPE, () -> dsa.getOption(null));
         }
     }
 
@@ -114,67 +116,67 @@ public class NullsAndBadValues {
     @Test
     public void uoe() throws Exception {
         try (Socket s = new Socket()) {
-            expectThrows(UOE, () -> s.setOption(FAKE_SOCK_OPT, null));
-            expectThrows(UOE, () -> s.setOption(FAKE_SOCK_OPT, TRUE));
-            expectThrows(UOE, () -> s.setOption(FAKE_SOCK_OPT, FALSE));
-            expectThrows(UOE, () -> s.setOption(RAW_SOCK_OPT, ""));
-            expectThrows(UOE, () -> s.setOption(RAW_SOCK_OPT, 1));
-            expectThrows(UOE, () -> s.getOption(FAKE_SOCK_OPT));
-            expectThrows(UOE, () -> s.getOption(RAW_SOCK_OPT));
+            assertThrows(UOE, () -> s.setOption(FAKE_SOCK_OPT, null));
+            assertThrows(UOE, () -> s.setOption(FAKE_SOCK_OPT, TRUE));
+            assertThrows(UOE, () -> s.setOption(FAKE_SOCK_OPT, FALSE));
+            assertThrows(UOE, () -> s.setOption(RAW_SOCK_OPT, ""));
+            assertThrows(UOE, () -> s.setOption(RAW_SOCK_OPT, 1));
+            assertThrows(UOE, () -> s.getOption(FAKE_SOCK_OPT));
+            assertThrows(UOE, () -> s.getOption(RAW_SOCK_OPT));
         }
         try (ServerSocket ss = new ServerSocket()) {
-            expectThrows(UOE, () -> ss.setOption(FAKE_SOCK_OPT, null));
-            expectThrows(UOE, () -> ss.setOption(FAKE_SOCK_OPT, TRUE));
-            expectThrows(UOE, () -> ss.setOption(FAKE_SOCK_OPT, FALSE));
-            expectThrows(UOE, () -> ss.setOption(RAW_SOCK_OPT, ""));
-            expectThrows(UOE, () -> ss.setOption(RAW_SOCK_OPT, 1));
-            expectThrows(UOE, () -> ss.getOption(FAKE_SOCK_OPT));
-            expectThrows(UOE, () -> ss.getOption(RAW_SOCK_OPT));
+            assertThrows(UOE, () -> ss.setOption(FAKE_SOCK_OPT, null));
+            assertThrows(UOE, () -> ss.setOption(FAKE_SOCK_OPT, TRUE));
+            assertThrows(UOE, () -> ss.setOption(FAKE_SOCK_OPT, FALSE));
+            assertThrows(UOE, () -> ss.setOption(RAW_SOCK_OPT, ""));
+            assertThrows(UOE, () -> ss.setOption(RAW_SOCK_OPT, 1));
+            assertThrows(UOE, () -> ss.getOption(FAKE_SOCK_OPT));
+            assertThrows(UOE, () -> ss.getOption(RAW_SOCK_OPT));
         }
         try (DatagramSocket ds = new DatagramSocket()) {
-            expectThrows(UOE, () -> ds.setOption(FAKE_SOCK_OPT, null));
-            expectThrows(UOE, () -> ds.setOption(FAKE_SOCK_OPT, TRUE));
-            expectThrows(UOE, () -> ds.setOption(FAKE_SOCK_OPT, FALSE));
-            expectThrows(UOE, () -> ds.setOption(RAW_SOCK_OPT, ""));
-            expectThrows(UOE, () -> ds.setOption(RAW_SOCK_OPT, 1));
-            expectThrows(UOE, () -> ds.getOption(FAKE_SOCK_OPT));
-            expectThrows(UOE, () -> ds.getOption(RAW_SOCK_OPT));
+            assertThrows(UOE, () -> ds.setOption(FAKE_SOCK_OPT, null));
+            assertThrows(UOE, () -> ds.setOption(FAKE_SOCK_OPT, TRUE));
+            assertThrows(UOE, () -> ds.setOption(FAKE_SOCK_OPT, FALSE));
+            assertThrows(UOE, () -> ds.setOption(RAW_SOCK_OPT, ""));
+            assertThrows(UOE, () -> ds.setOption(RAW_SOCK_OPT, 1));
+            assertThrows(UOE, () -> ds.getOption(FAKE_SOCK_OPT));
+            assertThrows(UOE, () -> ds.getOption(RAW_SOCK_OPT));
         }
         try (MulticastSocket ms = new MulticastSocket()) {
-            expectThrows(UOE, () -> ms.setOption(FAKE_SOCK_OPT, null));
-            expectThrows(UOE, () -> ms.setOption(FAKE_SOCK_OPT, TRUE));
-            expectThrows(UOE, () -> ms.setOption(FAKE_SOCK_OPT, FALSE));
-            expectThrows(UOE, () -> ms.setOption(RAW_SOCK_OPT, ""));
-            expectThrows(UOE, () -> ms.setOption(RAW_SOCK_OPT, 1));
-            expectThrows(UOE, () -> ms.getOption(FAKE_SOCK_OPT));
-            expectThrows(UOE, () -> ms.getOption(RAW_SOCK_OPT));
+            assertThrows(UOE, () -> ms.setOption(FAKE_SOCK_OPT, null));
+            assertThrows(UOE, () -> ms.setOption(FAKE_SOCK_OPT, TRUE));
+            assertThrows(UOE, () -> ms.setOption(FAKE_SOCK_OPT, FALSE));
+            assertThrows(UOE, () -> ms.setOption(RAW_SOCK_OPT, ""));
+            assertThrows(UOE, () -> ms.setOption(RAW_SOCK_OPT, 1));
+            assertThrows(UOE, () -> ms.getOption(FAKE_SOCK_OPT));
+            assertThrows(UOE, () -> ms.getOption(RAW_SOCK_OPT));
         }
         try (Socket sa = SocketChannel.open().socket()) {
-            expectThrows(UOE, () -> sa.setOption(FAKE_SOCK_OPT, null));
-            expectThrows(UOE, () -> sa.setOption(FAKE_SOCK_OPT, TRUE));
-            expectThrows(UOE, () -> sa.setOption(FAKE_SOCK_OPT, FALSE));
-            expectThrows(UOE, () -> sa.setOption(RAW_SOCK_OPT, ""));
-            expectThrows(UOE, () -> sa.setOption(RAW_SOCK_OPT, 1));
-            expectThrows(UOE, () -> sa.getOption(FAKE_SOCK_OPT));
-            expectThrows(UOE, () -> sa.getOption(RAW_SOCK_OPT));
+            assertThrows(UOE, () -> sa.setOption(FAKE_SOCK_OPT, null));
+            assertThrows(UOE, () -> sa.setOption(FAKE_SOCK_OPT, TRUE));
+            assertThrows(UOE, () -> sa.setOption(FAKE_SOCK_OPT, FALSE));
+            assertThrows(UOE, () -> sa.setOption(RAW_SOCK_OPT, ""));
+            assertThrows(UOE, () -> sa.setOption(RAW_SOCK_OPT, 1));
+            assertThrows(UOE, () -> sa.getOption(FAKE_SOCK_OPT));
+            assertThrows(UOE, () -> sa.getOption(RAW_SOCK_OPT));
         }
         try (ServerSocket ssa = ServerSocketChannel.open().socket()) {
-            expectThrows(UOE, () -> ssa.setOption(FAKE_SOCK_OPT, null));
-            expectThrows(UOE, () -> ssa.setOption(FAKE_SOCK_OPT, TRUE));
-            expectThrows(UOE, () -> ssa.setOption(FAKE_SOCK_OPT, FALSE));
-            expectThrows(UOE, () -> ssa.setOption(RAW_SOCK_OPT, ""));
-            expectThrows(UOE, () -> ssa.setOption(RAW_SOCK_OPT, 1));
-            expectThrows(UOE, () -> ssa.getOption(FAKE_SOCK_OPT));
-            expectThrows(UOE, () -> ssa.getOption(RAW_SOCK_OPT));
+            assertThrows(UOE, () -> ssa.setOption(FAKE_SOCK_OPT, null));
+            assertThrows(UOE, () -> ssa.setOption(FAKE_SOCK_OPT, TRUE));
+            assertThrows(UOE, () -> ssa.setOption(FAKE_SOCK_OPT, FALSE));
+            assertThrows(UOE, () -> ssa.setOption(RAW_SOCK_OPT, ""));
+            assertThrows(UOE, () -> ssa.setOption(RAW_SOCK_OPT, 1));
+            assertThrows(UOE, () -> ssa.getOption(FAKE_SOCK_OPT));
+            assertThrows(UOE, () -> ssa.getOption(RAW_SOCK_OPT));
         }
         try (DatagramSocket dsa = DatagramChannel.open().socket()) {
-            expectThrows(UOE, () -> dsa.setOption(FAKE_SOCK_OPT, null));
-            expectThrows(UOE, () -> dsa.setOption(FAKE_SOCK_OPT, TRUE));
-            expectThrows(UOE, () -> dsa.setOption(FAKE_SOCK_OPT, FALSE));
-            expectThrows(UOE, () -> dsa.setOption(RAW_SOCK_OPT, ""));
-            expectThrows(UOE, () -> dsa.setOption(RAW_SOCK_OPT, 1));
-            expectThrows(UOE, () -> dsa.getOption(FAKE_SOCK_OPT));
-            expectThrows(UOE, () -> dsa.getOption(RAW_SOCK_OPT));
+            assertThrows(UOE, () -> dsa.setOption(FAKE_SOCK_OPT, null));
+            assertThrows(UOE, () -> dsa.setOption(FAKE_SOCK_OPT, TRUE));
+            assertThrows(UOE, () -> dsa.setOption(FAKE_SOCK_OPT, FALSE));
+            assertThrows(UOE, () -> dsa.setOption(RAW_SOCK_OPT, ""));
+            assertThrows(UOE, () -> dsa.setOption(RAW_SOCK_OPT, 1));
+            assertThrows(UOE, () -> dsa.getOption(FAKE_SOCK_OPT));
+            assertThrows(UOE, () -> dsa.getOption(RAW_SOCK_OPT));
         }
     }
 
@@ -200,8 +202,7 @@ public class NullsAndBadValues {
 
     // -- Socket
 
-    @DataProvider(name = "socketBadOptionValues")
-    public Object[][] socketBadOptionValues() throws Exception {
+    public static Object[][] socketBadOptionValues() throws Exception {
         try (Socket s = new Socket()) {
             return s.supportedOptions().stream()
                     .flatMap(NullsAndBadValues::socketOptionToBadValues)
@@ -209,28 +210,29 @@ public class NullsAndBadValues {
         }
     }
 
-    @Test(dataProvider = "socketBadOptionValues")
+    @ParameterizedTest
+    @MethodSource("socketBadOptionValues")
     public <T> void socket(SocketOption<T> option, T value)
         throws Exception
     {
         try (Socket s = new Socket()) {
-            expectThrows(IAE, () -> s.setOption(option, value));
+            assertThrows(IAE, () -> s.setOption(option, value));
         }
     }
 
-    @Test(dataProvider = "socketBadOptionValues")
+    @ParameterizedTest
+    @MethodSource("socketBadOptionValues")
     public <T> void socketAdapter(SocketOption<T> option, T value)
         throws Exception
     {
         try (Socket s = SocketChannel.open().socket()) {
-            expectThrows(IAE, () -> s.setOption(option, value));
+            assertThrows(IAE, () -> s.setOption(option, value));
         }
     }
 
     // -- ServerSocket
 
-    @DataProvider(name = "serverSocketBadOptionValues")
-    public Object[][] serverSocketBadOptionValues() throws Exception {
+    public static Object[][] serverSocketBadOptionValues() throws Exception {
         try (ServerSocket ss = new ServerSocket()) {
             return ss.supportedOptions().stream()
                      .flatMap(NullsAndBadValues::socketOptionToBadValues)
@@ -238,16 +240,18 @@ public class NullsAndBadValues {
         }
     }
 
-    @Test(dataProvider = "serverSocketBadOptionValues")
+    @ParameterizedTest
+    @MethodSource("serverSocketBadOptionValues")
     public <T> void serverSocket(SocketOption<T> option, T value)
         throws Exception
     {
         try (ServerSocket ss = new ServerSocket()) {
-            expectThrows(IAE, () -> ss.setOption(option, value));
+            assertThrows(IAE, () -> ss.setOption(option, value));
         }
     }
 
-    @Test(dataProvider = "serverSocketBadOptionValues")
+    @ParameterizedTest
+    @MethodSource("serverSocketBadOptionValues")
     public <T> void serverSocketAdapter(SocketOption<T> option, T value)
         throws Exception
     {
@@ -255,14 +259,13 @@ public class NullsAndBadValues {
             return;  // SSC does not support IP_TOS
 
         try (ServerSocket ss = ServerSocketChannel.open().socket()) {
-            expectThrows(IAE, () -> ss.setOption(option, value));
+            assertThrows(IAE, () -> ss.setOption(option, value));
         }
     }
 
     // -- DatagramSocket
 
-    @DataProvider(name = "datagramSocketBadOptionValues")
-    public Object[][] datagramSocketBadOptionValues() throws Exception {
+    public static Object[][] datagramSocketBadOptionValues() throws Exception {
         try (DatagramSocket ds = new DatagramSocket()) {
             return ds.supportedOptions().stream()
                      .flatMap(NullsAndBadValues::socketOptionToBadValues)
@@ -270,28 +273,29 @@ public class NullsAndBadValues {
         }
     }
 
-    @Test(dataProvider = "datagramSocketBadOptionValues")
+    @ParameterizedTest
+    @MethodSource("datagramSocketBadOptionValues")
     public <T> void datagramSocket(SocketOption<T> option, T value)
         throws Exception
     {
         try (DatagramSocket ds = new DatagramSocket()) {
-            expectThrows(IAE, () -> ds.setOption(option, value));
+            assertThrows(IAE, () -> ds.setOption(option, value));
         }
     }
 
-    @Test(dataProvider = "datagramSocketBadOptionValues")
+    @ParameterizedTest
+    @MethodSource("datagramSocketBadOptionValues")
     public <T> void datagramSocketAdapter(SocketOption<T> option, T value)
         throws Exception
     {
         try (DatagramSocket ds = DatagramChannel.open().socket()) {
-            expectThrows(IAE, () -> ds.setOption(option, value));
+            assertThrows(IAE, () -> ds.setOption(option, value));
         }
     }
 
     // -- MulticastSocket
 
-    @DataProvider(name = "multicastSocketBadOptionValues")
-    public Object[][] multicastSocketBadOptionValues() throws Exception {
+    public static Object[][] multicastSocketBadOptionValues() throws Exception {
         try (MulticastSocket ms = new MulticastSocket()) {
             return ms.supportedOptions().stream()
                      .flatMap(NullsAndBadValues::socketOptionToBadValues)
@@ -299,12 +303,13 @@ public class NullsAndBadValues {
         }
     }
 
-    @Test(dataProvider = "multicastSocketBadOptionValues")
+    @ParameterizedTest
+    @MethodSource("multicastSocketBadOptionValues")
     public <T> void multicastSocket(SocketOption<T> option, T value)
         throws Exception
     {
         try (MulticastSocket ms = new MulticastSocket()) {
-            expectThrows(IAE, () -> ms.setOption(option, value));
+            assertThrows(IAE, () -> ms.setOption(option, value));
         }
     }
 
diff --git a/test/jdk/java/net/SocketOption/RequiredOptions.java b/test/jdk/java/net/SocketOption/RequiredOptions.java
index 3074d8fd274..2a1c689cae7 100644
--- a/test/jdk/java/net/SocketOption/RequiredOptions.java
+++ b/test/jdk/java/net/SocketOption/RequiredOptions.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2019, 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2019, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -33,17 +33,18 @@ import java.nio.channels.ServerSocketChannel;
 import java.nio.channels.SocketChannel;
 import java.util.Set;
 import java.util.stream.Stream;
-import org.testng.annotations.Test;
-import org.testng.annotations.DataProvider;
 
 import static java.net.StandardSocketOptions.*;
 
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
+
 /*
  * @test
  * @bug 8235141
  * @summary verifies that our implementation supports the set
  *          of SocketOptions that are required by the API documentation.
- * @run testng/othervm RequiredOptions
+ * @run junit/othervm ${test.main.class}
  */
 public class RequiredOptions {
 
@@ -60,7 +61,6 @@ public class RequiredOptions {
         return Set.of(Stream.of(options).flatMap(Set::stream).distinct().toArray(SocketOption[]::new));
     }
 
-    @DataProvider(name = "sockets")
     static Object[][] provider() throws IOException {
         return new Object[][] {
                 // UDP
@@ -76,7 +76,8 @@ public class RequiredOptions {
         };
     }
 
-    @Test(dataProvider = "sockets")
+    @ParameterizedTest
+    @MethodSource("provider")
     public <R, E extends Exception>
     void test(Configurable<R,E> socket, Set<SocketOption<?>> options) throws E {
         try (var s = socket) {
diff --git a/test/jdk/java/net/SocketPermission/Ctor.java b/test/jdk/java/net/SocketPermission/Ctor.java
index dde7596c052..20c194be847 100644
--- a/test/jdk/java/net/SocketPermission/Ctor.java
+++ b/test/jdk/java/net/SocketPermission/Ctor.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2001, 2019, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2001, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -26,13 +26,14 @@
  * @bug 4391898 8230407
  * @summary SocketPermission(":",...) throws ArrayIndexOutOfBoundsException
  *          SocketPermission constructor argument checks
- * @run testng Ctor
+ * @run junit ${test.main.class}
  */
 
 import java.net.SocketPermission;
-import org.testng.annotations.Test;
-import static java.lang.System.out;
-import static org.testng.Assert.*;
+import static java.lang.System.err;
+
+import org.junit.jupiter.api.Test;
+import static org.junit.jupiter.api.Assertions.assertThrows;
 
 public class Ctor {
 
@@ -48,39 +49,39 @@ public class Ctor {
     @Test
     public void npe() {
         NullPointerException e;
-        e = expectThrows(NPE, () -> new SocketPermission(null, null));
-        out.println("caught expected NPE: " + e);
-        e = expectThrows(NPE, () -> new SocketPermission("foo", null));
-        out.println("caught expected NPE: " + e);
-        e = expectThrows(NPE, () -> new SocketPermission(null, "connect"));
-        out.println("caught expected NPE: " + e);
+        e = assertThrows(NPE, () -> new SocketPermission(null, null));
+        err.println("caught expected NPE: " + e);
+        e = assertThrows(NPE, () -> new SocketPermission("foo", null));
+        err.println("caught expected NPE: " + e);
+        e = assertThrows(NPE, () -> new SocketPermission(null, "connect"));
+        err.println("caught expected NPE: " + e);
     }
 
     @Test
     public void iae() {
         IllegalArgumentException e;
         // host
-        e = expectThrows(IAE, () -> new SocketPermission("1:2:3:4", "connect"));
-        out.println("caught expected IAE: " + e);
-        e = expectThrows(IAE, () -> new SocketPermission("foo:5-4", "connect"));
-        out.println("caught expected IAE: " + e);
+        e = assertThrows(IAE, () -> new SocketPermission("1:2:3:4", "connect"));
+        err.println("caught expected IAE: " + e);
+        e = assertThrows(IAE, () -> new SocketPermission("foo:5-4", "connect"));
+        err.println("caught expected IAE: " + e);
 
         // actions
-        e = expectThrows(IAE, () -> new SocketPermission("foo", ""));
-        out.println("caught expected IAE: " + e);
-        e = expectThrows(IAE, () -> new SocketPermission("foo", "badAction"));
-        out.println("caught expected IAE: " + e);
-        e = expectThrows(IAE, () -> new SocketPermission("foo", "badAction,connect"));
-        out.println("caught expected IAE: " + e);
-        e = expectThrows(IAE, () -> new SocketPermission("foo", "badAction,,connect"));
-        out.println("caught expected IAE: " + e);
-        e = expectThrows(IAE, () -> new SocketPermission("foo", ",connect"));
-        out.println("caught expected IAE: " + e);
-        e = expectThrows(IAE, () -> new SocketPermission("foo", ",,connect"));
-        out.println("caught expected IAE: " + e);
-        e = expectThrows(IAE, () -> new SocketPermission("foo", "connect,"));
-        out.println("caught expected IAE: " + e);
-        e = expectThrows(IAE, () -> new SocketPermission("foo", "connect,,"));
-        out.println("caught expected IAE: " + e);
+        e = assertThrows(IAE, () -> new SocketPermission("foo", ""));
+        err.println("caught expected IAE: " + e);
+        e = assertThrows(IAE, () -> new SocketPermission("foo", "badAction"));
+        err.println("caught expected IAE: " + e);
+        e = assertThrows(IAE, () -> new SocketPermission("foo", "badAction,connect"));
+        err.println("caught expected IAE: " + e);
+        e = assertThrows(IAE, () -> new SocketPermission("foo", "badAction,,connect"));
+        err.println("caught expected IAE: " + e);
+        e = assertThrows(IAE, () -> new SocketPermission("foo", ",connect"));
+        err.println("caught expected IAE: " + e);
+        e = assertThrows(IAE, () -> new SocketPermission("foo", ",,connect"));
+        err.println("caught expected IAE: " + e);
+        e = assertThrows(IAE, () -> new SocketPermission("foo", "connect,"));
+        err.println("caught expected IAE: " + e);
+        e = assertThrows(IAE, () -> new SocketPermission("foo", "connect,,"));
+        err.println("caught expected IAE: " + e);
     }
 }
diff --git a/test/jdk/java/net/Socks/SocksIPv6Test.java b/test/jdk/java/net/Socks/SocksIPv6Test.java
index 1b277bb24fc..a8794724c54 100644
--- a/test/jdk/java/net/Socks/SocksIPv6Test.java
+++ b/test/jdk/java/net/Socks/SocksIPv6Test.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2013, 2019, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2013, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,8 +25,9 @@
  * @bug 7100957
  * @modules jdk.httpserver
  * @library /test/lib
+ * @build SocksServer
  * @summary Java doesn't correctly handle the SOCKS protocol when used over IPv6.
- * @run testng SocksIPv6Test
+ * @run junit ${test.main.class}
  */
 
 import java.io.BufferedReader;
@@ -45,28 +46,28 @@ import java.net.SocketException;
 import java.net.NetworkInterface;
 import java.util.Collections;
 import java.util.List;
-import com.sun.net.httpserver.*;
 import java.io.BufferedWriter;
-import org.testng.SkipException;
-import org.testng.annotations.AfterClass;
-import org.testng.annotations.BeforeClass;
-import org.testng.annotations.Test;
 
+import com.sun.net.httpserver.HttpServer;
 import jdk.test.lib.NetworkConfiguration;
 
-import static org.testng.Assert.*;
+import org.junit.jupiter.api.AfterAll;
+import org.junit.jupiter.api.Assumptions;
+import org.junit.jupiter.api.BeforeAll;
+import org.junit.jupiter.api.Test;
+import static org.junit.jupiter.api.Assertions.assertEquals;
 
 public class SocksIPv6Test {
 
-    private HttpServer server;
-    private SocksServer socks;
-    private String response = "Hello.";
+    private static HttpServer server;
+    private static SocksServer socks;
+    private static final String response = "Hello.";
 
-    @BeforeClass
-    public void setUp() throws Exception {
+    @BeforeAll
+    public static void setUp() throws Exception {
         if (!ensureInet6AddressFamily() || !ensureIPv6OnLoopback()) {
             NetworkConfiguration.printSystemConfiguration(System.out);
-            throw new SkipException("Host does not support IPv6");
+            Assumptions.abort("Host does not support IPv6");
         }
 
         server = HttpServer.create(new InetSocketAddress("::1", 0), 0);
@@ -93,7 +94,7 @@ public class SocksIPv6Test {
         });
     }
 
-    private boolean ensureIPv6OnLoopback() throws Exception {
+    private static boolean ensureIPv6OnLoopback() throws Exception {
         boolean ipv6 = false;
 
         List<NetworkInterface> nics = Collections.list(NetworkInterface.getNetworkInterfaces());
@@ -114,7 +115,7 @@ public class SocksIPv6Test {
         return ipv6;
     }
 
-    private boolean ensureInet6AddressFamily() throws IOException {
+    private static boolean ensureInet6AddressFamily() throws IOException {
         try (ServerSocket s = new ServerSocket()) {
             s.bind(new InetSocketAddress("::1", 0));
             return true;
@@ -124,7 +125,7 @@ public class SocksIPv6Test {
         return false;
     }
 
-    @Test(groups = "unit")
+    @Test
     public void testSocksOverIPv6() throws Exception {
         Proxy proxy = new Proxy(Proxy.Type.SOCKS, new InetSocketAddress("::1",
                 socks.getPort()));
@@ -135,10 +136,10 @@ public class SocksIPv6Test {
                 new InputStreamReader(conn.getInputStream()))) {
             actual = reader.readLine();
         }
-        assertEquals(actual, response);
+        assertEquals(response, actual);
     }
 
-    @Test(groups = "unit")
+    @Test
     public void testSocksOverIPv6Hostname() throws Exception {
         InetAddress ipv6Loopback = InetAddress.getByName("::1");
         String ipv6Hostname = ipv6Loopback.getHostName();
@@ -155,24 +156,24 @@ public class SocksIPv6Test {
             ipv4HostAddress = null;
         }
 
-        System.out.println("ipv6Hostname: " + ipv6Hostname + " / " + ipv6HostAddress);
-        System.out.println("ipv4Hostname: " + ipv4Hostname + " / " + ipv4HostAddress);
+        System.err.println("ipv6Hostname: " + ipv6Hostname + " / " + ipv6HostAddress);
+        System.err.println("ipv4Hostname: " + ipv4Hostname + " / " + ipv4HostAddress);
 
         if (ipv6Hostname.equals(ipv6HostAddress)) {
-            System.out.println("Unable to get the hostname of the IPv6 loopback "
+            Assumptions.abort("Unable to get the hostname of the IPv6 loopback "
                     + "address. Skipping test case.");
             return;
         }
 
         if (ipv4Hostname != null && ipv6Hostname.equals(ipv4Hostname)) {
-            System.out.println("IPv6 and IPv4 loopback addresses map to the"
+            Assumptions.abort("IPv6 and IPv4 loopback addresses map to the"
                     + " same hostname. Skipping test case.");
             return;
         }
 
         if (!InetAddress.getByName(ipv6Hostname).getHostAddress()
                 .equals(ipv6HostAddress)) {
-            System.out.println(ipv6Hostname + " resolves to \""
+            Assumptions.abort(ipv6Hostname + " resolves to \""
                     + InetAddress.getByName(ipv6Hostname).getHostAddress()
                     + "\", not \"" + ipv6HostAddress +
                     "\". Skipping test case.");
@@ -188,11 +189,11 @@ public class SocksIPv6Test {
                 new InputStreamReader(conn.getInputStream()))) {
             actual = reader.readLine();
         }
-        assertEquals(actual, response);
+        assertEquals(response, actual);
     }
 
-    @AfterClass
-    public void tearDown() {
+    @AfterAll
+    public static void tearDown() {
         if (server != null) {
             server.stop(1);
         }
diff --git a/test/jdk/java/net/Socks/SocksSocketImplTest.java b/test/jdk/java/net/Socks/SocksSocketImplTest.java
index 57d54defda3..05792aad784 100644
--- a/test/jdk/java/net/Socks/SocksSocketImplTest.java
+++ b/test/jdk/java/net/Socks/SocksSocketImplTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2019, 2022, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2019, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -21,10 +21,6 @@
  * questions.
  */
 
-import org.testng.Assert;
-import org.testng.annotations.AfterTest;
-import org.testng.annotations.BeforeTest;
-import org.testng.annotations.Test;
 import sun.net.spi.DefaultProxySelector;
 
 import java.io.IOException;
@@ -37,25 +33,33 @@ import java.net.URI;
 import java.net.URISyntaxException;
 import java.util.List;
 
+import org.junit.jupiter.api.AfterAll;
+import org.junit.jupiter.api.BeforeAll;
+import org.junit.jupiter.api.Test;
+
+import static org.junit.jupiter.api.Assertions.assertInstanceOf;
+import static org.junit.jupiter.api.Assertions.assertThrows;
+import static org.junit.jupiter.api.Assertions.fail;
+
 /**
  * @test
  * @bug 8230310
  * @summary Tests java.net.SocksSocketImpl
- * @run testng SocksSocketImplTest
+ * @run junit ${test.main.class}
  * @modules java.base/sun.net.spi:+open
  */
 public class SocksSocketImplTest {
 
-    private ProxySelector previousDefault;
+    private static ProxySelector previousDefault;
 
-    @BeforeTest
-    public void beforeTest() {
+    @BeforeAll
+    public static void beforeTest() {
         previousDefault = ProxySelector.getDefault();
         ProxySelector.setDefault(new SchemeStrippedProxySelector());
     }
 
-    @AfterTest
-    public void afterTest() {
+    @AfterAll
+    public static void afterTest() {
         ProxySelector.setDefault(previousDefault);
     }
 
@@ -65,17 +69,14 @@ public class SocksSocketImplTest {
      * which throws a {@link IllegalArgumentException}. This test then verifies that this IAE gets wrapped
      * by {@code java.net.SocksSocketImpl} into an {@link IOException} before being thrown
      *
-     * @throws Exception
+     * @throws Exception if the test fails
      */
     @Test
     public void testIOEOnProxySelection() throws Exception {
         final int backlog = -1;
         final int port = 0;
-        try (ServerSocket ss = new ServerSocket(port, backlog, InetAddress.getLoopbackAddress());
-             Socket s1 = new Socket(ss.getInetAddress(), ss.getLocalPort());
-             Socket s2 = ss.accept()) {
-            Assert.fail("IOException was expected to be thrown, but wasn't");
-        } catch (IOException ioe) {
+        try (ServerSocket ss = new ServerSocket(port, backlog, InetAddress.getLoopbackAddress())) {
+             IOException ioe = assertThrows(IOException.class, () -> new Socket(ss.getInetAddress(), ss.getLocalPort()));
             // expected
             // now verify the IOE was thrown for the correct expected reason
             if (!(ioe.getCause() instanceof IllegalArgumentException)) {
@@ -96,7 +97,7 @@ public class SocksSocketImplTest {
 
         @Override
         public List<Proxy> select(final URI uri) {
-            System.out.println("Proxy selection for " + uri);
+            System.err.println("Proxy selection for " + uri);
             final URI schemeStrippedURI;
             try {
                 // strip the scheme and pass the rest
@@ -104,7 +105,7 @@ public class SocksSocketImplTest {
             } catch (URISyntaxException e) {
                 throw new RuntimeException(e);
             }
-            System.out.println("Scheme stripped URI " + schemeStrippedURI + " is being used to select a proxy");
+            System.err.println("Scheme stripped URI " + schemeStrippedURI + " is being used to select a proxy");
             return super.select(schemeStrippedURI);
         }
     }
diff --git a/test/jdk/java/net/UnixDomainSocketAddress/AddressTest.java b/test/jdk/java/net/UnixDomainSocketAddress/AddressTest.java
index ba55eac46df..d5d1f295fd1 100644
--- a/test/jdk/java/net/UnixDomainSocketAddress/AddressTest.java
+++ b/test/jdk/java/net/UnixDomainSocketAddress/AddressTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2020, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,18 +25,16 @@
  * @test
  * @bug 8231358
  * @compile ../../nio/file/spi/testfsp/testfsp/TestProvider.java AddressTest.java
- * @run testng/othervm AddressTest
+ * @run junit/othervm ${test.main.class}
  */
 
 import java.net.UnixDomainSocketAddress;
 import java.net.URI;
 import java.nio.file.FileSystems;
-import java.nio.file.spi.FileSystemProvider;
 import java.nio.file.Path;
 
-import org.testng.annotations.Test;
-
-import static org.testng.Assert.assertThrows;
+import org.junit.jupiter.api.Test;
+import static org.junit.jupiter.api.Assertions.assertThrows;
 
 /**
  * Verify that UnixDomainSocketAddress.of(path) throws IAE
@@ -50,7 +48,7 @@ public class AddressTest {
         IllegalArgumentException.class;
 
     @Test
-    public static void runTest() throws Exception {
+    public void runTest() throws Exception {
         var fsp = new testfsp.TestProvider(FileSystems.getDefault().provider());
         Path path = fsp.getPath(URI.create("file:/"));
         assertThrows(IAE, () -> UnixDomainSocketAddress.of(path));
diff --git a/test/jdk/java/net/UnixDomainSocketAddress/LengthTest.java b/test/jdk/java/net/UnixDomainSocketAddress/LengthTest.java
index c34c8e001b7..d75658011c9 100644
--- a/test/jdk/java/net/UnixDomainSocketAddress/LengthTest.java
+++ b/test/jdk/java/net/UnixDomainSocketAddress/LengthTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2020, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,61 +25,54 @@
  * @test
  * @summary Test UnixDomainSocketAddress constructor
  * @library /test/lib
- * @run testng/othervm LengthTest
+ * @run junit/othervm ${test.main.class}
  */
 
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
 
-import static java.lang.System.out;
-import static java.net.StandardProtocolFamily.UNIX;
-import static jdk.test.lib.Asserts.assertTrue;
+import static java.lang.System.err;
 
 import java.net.UnixDomainSocketAddress;
-import java.io.IOException;
-import java.nio.channels.SocketChannel;
 import java.nio.file.Path;
+import java.util.List;
+
+import org.junit.jupiter.api.Test;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.MethodSource;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertThrows;
 
 public class LengthTest {
-    final int namelen = 100;    // length close to max
+    private static final int namelen = 100;    // length close to max
 
-    @DataProvider(name = "strings")
-    public Object[][] strings() {
-        if (namelen == -1)
-            return new Object[][] {new String[]{""}};
-
-        return new Object[][]{
-                {""},
-                {new String(new char[100]).replaceAll("\0", "x")},
-                {new String(new char[namelen]).replaceAll("\0", "x")},
-                {new String(new char[namelen-1]).replaceAll("\0", "x")},
-        };
+    public static List<String> strings() {
+        assert namelen > 0;
+        return List.of(
+                "",
+                "x".repeat(100),
+                "x".repeat(namelen),
+                "x".repeat(namelen - 1)
+        );
     }
 
-    @Test(dataProvider = "strings")
+    @ParameterizedTest
+    @MethodSource("strings")
     public void expectPass(String s) {
         var addr = UnixDomainSocketAddress.of(s);
-        assertTrue(addr.getPath().toString().equals(s), "getPathName.equals(s)");
+        assertEquals(s, addr.getPath().toString(), "getPathName.equals(s)");
         var p = Path.of(s);
         addr = UnixDomainSocketAddress.of(p);
-        assertTrue(addr.getPath().equals(p), "getPath.equals(p)");
+        assertEquals(p, addr.getPath(), "getPath.equals(p)");
     }
 
     @Test
     public void expectNPE() {
-        try {
-            String s = null;
-            UnixDomainSocketAddress.of(s);
-            throw new RuntimeException("Expected NPE");
-        } catch (NullPointerException npe) {
-            out.println("\tCaught expected exception: " + npe);
-        }
-        try {
-            Path p = null;
-            UnixDomainSocketAddress.of(p);
-            throw new RuntimeException("Expected NPE");
-        } catch (NullPointerException npe) {
-            out.println("\tCaught expected exception: " + npe);
-        }
+        String s = null;
+        NullPointerException npe =
+                assertThrows(NullPointerException.class, () -> UnixDomainSocketAddress.of(s));
+        err.println("\tCaugth expected NPE for UnixDomainSocketAddress.of(s): " + npe);
+        Path p = null;
+        npe = assertThrows(NullPointerException.class, () -> UnixDomainSocketAddress.of(p));
+        err.println("\tCaugth expected NPE for UnixDomainSocketAddress.of(p): " + npe);
     }
 }
diff --git a/test/jdk/java/net/UnixDomainSocketAddress/UnixDomainSocketAddressSerializationTest.java b/test/jdk/java/net/UnixDomainSocketAddress/UnixDomainSocketAddressSerializationTest.java
index 305b4bee95e..b48805f61b3 100644
--- a/test/jdk/java/net/UnixDomainSocketAddress/UnixDomainSocketAddressSerializationTest.java
+++ b/test/jdk/java/net/UnixDomainSocketAddress/UnixDomainSocketAddressSerializationTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2020, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -21,7 +21,6 @@
  * questions.
  */
 
-import org.testng.annotations.Test;
 
 import java.io.ByteArrayInputStream;
 import java.io.ByteArrayOutputStream;
@@ -35,51 +34,56 @@ import java.io.Serializable;
 import java.net.UnixDomainSocketAddress;
 import java.nio.file.Path;
 import static java.io.ObjectStreamConstants.*;
-import static org.testng.Assert.assertEquals;
-import static org.testng.Assert.assertTrue;
-import static org.testng.Assert.expectThrows;
+
+import org.junit.jupiter.api.Test;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertInstanceOf;
+import static org.junit.jupiter.api.Assertions.assertThrows;
+import static org.junit.jupiter.api.Assertions.assertTrue;
 
 /*
  * @test
  * @summary UnixDomainSocketAddress serialization test
- * @run testng/othervm UnixDomainSocketAddressSerializationTest
+ * @run junit/othervm ${test.main.class}
  */
 
-@Test
 public class UnixDomainSocketAddressSerializationTest {
     private static final UnixDomainSocketAddress addr =
             UnixDomainSocketAddress.of(Path.of("test.sock"));
 
-    public static void test() throws Exception {
-        assertTrue(addr instanceof Serializable);
+    @Test
+    public void test() throws Exception {
+        assertInstanceOf(Serializable.class, addr);
 
         byte[] serialized = serialize(addr);
         assertTrue(serialized.length > 0);
 
         UnixDomainSocketAddress deserialized =
                 deserialize(serialized, UnixDomainSocketAddress.class);
-        assertEquals(deserialized.getPath(), addr.getPath());
-        assertEquals(deserialized.toString(), addr.toString());
-        assertEquals(deserialized.hashCode(), addr.hashCode());
-        assertEquals(deserialized, addr);
+        assertEquals(addr.getPath(), deserialized.getPath());
+        assertEquals(addr.toString(), deserialized.toString());
+        assertEquals(addr.hashCode(), deserialized.hashCode());
+        assertEquals(addr, deserialized);
     }
 
     static final Class<InvalidObjectException> IOE = InvalidObjectException.class;
     static final Class<NullPointerException> NPE = NullPointerException.class;
 
     /** Tests that UnixDomainSocketAddress in the byte-stream is disallowed. */
-    public static void testUnixDomainSocketAddressInStream() throws Exception {
+    @Test
+    public void testUnixDomainSocketAddressInStream() throws Exception {
         long suid = ObjectStreamClass.lookup(UnixDomainSocketAddress.class).getSerialVersionUID();
         byte[] bytes = byteStreamFor(UnixDomainSocketAddress.class.getName(), suid);
-        expectThrows(IOE, () -> deserialize(bytes, UnixDomainSocketAddress.class));
+        assertThrows(IOE, () -> deserialize(bytes, UnixDomainSocketAddress.class));
     }
 
     /** Tests that SerialProxy with a null/absent path value in the byte-stream is disallowed. */
-    public static void testSerialProxyNoStreamValues() throws Exception {
+    @Test
+    public void testSerialProxyNoStreamValues() throws Exception {
         Class<?> c = Class.forName("java.net.UnixDomainSocketAddress$Ser");
         long suid = ObjectStreamClass.lookup(c).getSerialVersionUID();
         byte[] bytes = byteStreamFor(c.getName(), suid);
-        expectThrows(NPE, () -> deserialize(bytes, UnixDomainSocketAddress.class));
+        assertThrows(NPE, () -> deserialize(bytes, UnixDomainSocketAddress.class));
     }
 
     private static <T extends Serializable> byte[] serialize(T t)

From 3384c6736daf81aba08e15d6340065517747736e Mon Sep 17 00:00:00 2001
From: Bhavana Kilambi <bkilambi@openjdk.org>
Date: Wed, 15 Apr 2026 12:27:56 +0000
Subject: [PATCH 606/655] 8366444: Add support for add/mul reduction operations
 for Float16

Reviewed-by: jbhateja, mchevalier, xgong, epeter
---
 src/hotspot/cpu/aarch64/aarch64_vector.ad     |  90 ++++++-
 src/hotspot/cpu/aarch64/aarch64_vector_ad.m4  | 139 +++++++---
 .../cpu/aarch64/c2_MacroAssembler_aarch64.cpp |  49 ++++
 .../cpu/aarch64/c2_MacroAssembler_aarch64.hpp |   3 +
 src/hotspot/share/adlc/formssel.cpp           |   8 +-
 src/hotspot/share/opto/classes.hpp            |   2 +
 src/hotspot/share/opto/compile.cpp            |   8 +-
 src/hotspot/share/opto/vectornode.cpp         |  18 +-
 src/hotspot/share/opto/vectornode.hpp         |  69 ++++-
 .../compiler/lib/ir_framework/IRNode.java     |  10 +
 .../loopopts/superword/TestReductions.java    | 141 +++++++++-
 .../TestFloat16VectorOperations.java          | 240 +++++++++++++++++-
 .../vector/Float16OperationsBenchmark.java    |  19 ++
 .../bench/vm/compiler/VectorReduction2.java   |  93 ++++++-
 14 files changed, 820 insertions(+), 69 deletions(-)

diff --git a/src/hotspot/cpu/aarch64/aarch64_vector.ad b/src/hotspot/cpu/aarch64/aarch64_vector.ad
index 30b0c9c799b..4c854913e63 100644
--- a/src/hotspot/cpu/aarch64/aarch64_vector.ad
+++ b/src/hotspot/cpu/aarch64/aarch64_vector.ad
@@ -1,6 +1,6 @@
 //
 // Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
-// Copyright (c) 2020, 2025, Arm Limited. All rights reserved.
+// Copyright (c) 2020, 2026, Arm Limited. All rights reserved.
 // DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
 //
 // This code is free software; you can redistribute it and/or modify it
@@ -247,10 +247,39 @@ source %{
       case Op_MinVHF:
       case Op_MaxVHF:
       case Op_SqrtVHF:
+        if (UseSVE == 0 && !is_feat_fp16_supported()) {
+          return false;
+        }
+        break;
+      // At the time of writing this, the Vector API has no half-float (FP16) species.
+      // Consequently, AddReductionVHF and MulReductionVHF are only produced by the
+      // auto-vectorizer, which requires strictly ordered semantics for FP reductions.
+      //
+      // There is no direct Neon instruction that performs strictly ordered floating
+      // point add reduction. Hence, on Neon only machines, the add reduction operation
+      // is implemented as a scalarized sequence using half-precision scalar instruction
+      // FADD which requires FEAT_FP16 and ASIMDHP to be available on the target.
+      // On SVE machines (UseSVE > 0) however, there is a direct instruction (FADDA) which
+      // implements strictly ordered floating point add reduction which does not require
+      // the FEAT_FP16 and ASIMDHP checks as SVE supports half-precision floats by default.
+      case Op_AddReductionVHF:
         // FEAT_FP16 is enabled if both "fphp" and "asimdhp" features are supported.
         // Only the Neon instructions need this check. SVE supports half-precision floats
         // by default.
-        if (UseSVE == 0 && !is_feat_fp16_supported()) {
+        if (length_in_bytes < 8 || (UseSVE == 0 && !is_feat_fp16_supported())) {
+          return false;
+        }
+        break;
+      case Op_MulReductionVHF:
+        // There are no direct Neon/SVE instructions that perform strictly ordered
+        // floating point multiply reduction.
+        // For vector length ≤ 16 bytes, the reduction is implemented as a scalarized
+        // sequence using half-precision scalar instruction FMUL. This path requires
+        // FEAT_FP16 and ASIMDHP to be available on the target.
+        // For vector length > 16 bytes, this operation is disabled because there is no
+        // direct SVE instruction that performs a strictly ordered FP16 multiply
+        // reduction.
+        if (length_in_bytes < 8 || length_in_bytes > 16 || !is_feat_fp16_supported()) {
           return false;
         }
         break;
@@ -300,6 +329,7 @@ source %{
       case Op_VectorRearrange:
       case Op_MulReductionVD:
       case Op_MulReductionVF:
+      case Op_MulReductionVHF:
       case Op_MulReductionVI:
       case Op_MulReductionVL:
       case Op_CompressBitsV:
@@ -364,6 +394,7 @@ source %{
       case Op_VectorMaskCmp:
       case Op_LoadVectorGather:
       case Op_StoreVectorScatter:
+      case Op_AddReductionVHF:
       case Op_AddReductionVF:
       case Op_AddReductionVD:
       case Op_AndReductionV:
@@ -3402,6 +3433,44 @@ instruct reduce_non_strict_order_add4F_neon(vRegF dst, vRegF fsrc, vReg vsrc, vR
   ins_pipe(pipe_slow);
 %}
 
+// Add Reduction for Half floats (FP16).
+// Neon does not provide direct instructions for strictly ordered floating-point add reductions.
+// On Neon-only targets (UseSVE = 0), this operation is implemented as a sequence of scalar additions:
+// values equal to the vector width are loaded into a vector register, each lane is extracted,
+// and its value is accumulated into the running sum, producing a final scalar result.
+instruct reduce_addHF_neon(vRegF dst, vRegF fsrc, vReg vsrc, vReg tmp) %{
+  predicate(UseSVE == 0);
+  match(Set dst (AddReductionVHF fsrc vsrc));
+  effect(TEMP_DEF dst, TEMP tmp);
+  format %{ "reduce_addHF $dst, $fsrc, $vsrc\t# 4HF/8HF. KILL $tmp" %}
+  ins_encode %{
+    uint length_in_bytes = Matcher::vector_length_in_bytes(this, $vsrc);
+    __ neon_reduce_add_fp16($dst$$FloatRegister, $fsrc$$FloatRegister,
+                            $vsrc$$FloatRegister, length_in_bytes, $tmp$$FloatRegister);
+  %}
+  ins_pipe(pipe_slow);
+%}
+
+// This rule calculates the reduction result in strict order. Two cases will
+// reach here:
+// 1. Non strictly-ordered AddReductionVHF when vector size > 128-bits. For example -
+//    AddReductionVHF generated by Vector API. For vector size > 128-bits, it is more
+//    beneficial performance-wise to generate direct SVE instruction even if it is
+//    strictly ordered.
+// 2. Strictly-ordered AddReductionVHF. For example - AddReductionVHF generated by
+//    auto-vectorization on SVE machine.
+instruct reduce_addHF_sve(vRegF dst_src1, vReg src2) %{
+  predicate(UseSVE > 0);
+  match(Set dst_src1 (AddReductionVHF dst_src1 src2));
+  format %{ "reduce_addHF_sve $dst_src1, $dst_src1, $src2" %}
+  ins_encode %{
+    uint length_in_bytes = Matcher::vector_length_in_bytes(this, $src2);
+    assert(length_in_bytes == MaxVectorSize, "invalid vector length");
+    __ sve_fadda($dst_src1$$FloatRegister, __ H, ptrue, $src2$$FloatRegister);
+  %}
+  ins_pipe(pipe_slow);
+%}
+
 // This rule calculates the reduction result in strict order. Two cases will
 // reach here:
 // 1. Non strictly-ordered AddReductionVF when vector size > 128-bits. For example -
@@ -3492,12 +3561,14 @@ instruct reduce_addL_masked(iRegLNoSp dst, iRegL isrc, vReg vsrc, pRegGov pg, vR
   ins_pipe(pipe_slow);
 %}
 
-instruct reduce_addF_masked(vRegF dst_src1, vReg src2, pRegGov pg) %{
+instruct reduce_addFHF_masked(vRegF dst_src1, vReg src2, pRegGov pg) %{
   predicate(UseSVE > 0);
+  match(Set dst_src1 (AddReductionVHF (Binary dst_src1 src2) pg));
   match(Set dst_src1 (AddReductionVF (Binary dst_src1 src2) pg));
-  format %{ "reduce_addF_masked $dst_src1, $pg, $dst_src1, $src2" %}
+  format %{ "reduce_addFHF_masked $dst_src1, $pg, $dst_src1, $src2" %}
   ins_encode %{
-    __ sve_fadda($dst_src1$$FloatRegister, __ S,
+    BasicType bt = Matcher::vector_element_basic_type(this, $src2);
+    __ sve_fadda($dst_src1$$FloatRegister, __ elemType_to_regVariant(bt),
                  $pg$$PRegister, $src2$$FloatRegister);
   %}
   ins_pipe(pipe_slow);
@@ -3545,14 +3616,17 @@ instruct reduce_mulL(iRegLNoSp dst, iRegL isrc, vReg vsrc) %{
   ins_pipe(pipe_slow);
 %}
 
-instruct reduce_mulF(vRegF dst, vRegF fsrc, vReg vsrc, vReg tmp) %{
+
+instruct reduce_mulFHF(vRegF dst, vRegF fsrc, vReg vsrc, vReg tmp) %{
   predicate(Matcher::vector_length_in_bytes(n->in(2)) <= 16);
+  match(Set dst (MulReductionVHF fsrc vsrc));
   match(Set dst (MulReductionVF fsrc vsrc));
   effect(TEMP_DEF dst, TEMP tmp);
-  format %{ "reduce_mulF $dst, $fsrc, $vsrc\t# 2F/4F. KILL $tmp" %}
+  format %{ "reduce_mulFHF $dst, $fsrc, $vsrc\t# 2F/4F/4HF/8HF. KILL $tmp" %}
   ins_encode %{
     uint length_in_bytes = Matcher::vector_length_in_bytes(this, $vsrc);
-    __ neon_reduce_mul_fp($dst$$FloatRegister, T_FLOAT, $fsrc$$FloatRegister,
+    BasicType bt = Matcher::vector_element_basic_type(this, $vsrc);
+    __ neon_reduce_mul_fp($dst$$FloatRegister, bt, $fsrc$$FloatRegister,
                           $vsrc$$FloatRegister, length_in_bytes, $tmp$$FloatRegister);
   %}
   ins_pipe(pipe_slow);
diff --git a/src/hotspot/cpu/aarch64/aarch64_vector_ad.m4 b/src/hotspot/cpu/aarch64/aarch64_vector_ad.m4
index 48bffb3cf35..58ed234194a 100644
--- a/src/hotspot/cpu/aarch64/aarch64_vector_ad.m4
+++ b/src/hotspot/cpu/aarch64/aarch64_vector_ad.m4
@@ -1,6 +1,6 @@
 //
 // Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
-// Copyright (c) 2020, 2025, Arm Limited. All rights reserved.
+// Copyright (c) 2020, 2026, Arm Limited. All rights reserved.
 // DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
 //
 // This code is free software; you can redistribute it and/or modify it
@@ -237,10 +237,39 @@ source %{
       case Op_MinVHF:
       case Op_MaxVHF:
       case Op_SqrtVHF:
+        if (UseSVE == 0 && !is_feat_fp16_supported()) {
+          return false;
+        }
+        break;
+      // At the time of writing this, the Vector API has no half-float (FP16) species.
+      // Consequently, AddReductionVHF and MulReductionVHF are only produced by the
+      // auto-vectorizer, which requires strictly ordered semantics for FP reductions.
+      //
+      // There is no direct Neon instruction that performs strictly ordered floating
+      // point add reduction. Hence, on Neon only machines, the add reduction operation
+      // is implemented as a scalarized sequence using half-precision scalar instruction
+      // FADD which requires FEAT_FP16 and ASIMDHP to be available on the target.
+      // On SVE machines (UseSVE > 0) however, there is a direct instruction (FADDA) which
+      // implements strictly ordered floating point add reduction which does not require
+      // the FEAT_FP16 and ASIMDHP checks as SVE supports half-precision floats by default.
+      case Op_AddReductionVHF:
         // FEAT_FP16 is enabled if both "fphp" and "asimdhp" features are supported.
         // Only the Neon instructions need this check. SVE supports half-precision floats
         // by default.
-        if (UseSVE == 0 && !is_feat_fp16_supported()) {
+        if (length_in_bytes < 8 || (UseSVE == 0 && !is_feat_fp16_supported())) {
+          return false;
+        }
+        break;
+      case Op_MulReductionVHF:
+        // There are no direct Neon/SVE instructions that perform strictly ordered
+        // floating point multiply reduction.
+        // For vector length ≤ 16 bytes, the reduction is implemented as a scalarized
+        // sequence using half-precision scalar instruction FMUL. This path requires
+        // FEAT_FP16 and ASIMDHP to be available on the target.
+        // For vector length > 16 bytes, this operation is disabled because there is no
+        // direct SVE instruction that performs a strictly ordered FP16 multiply
+        // reduction.
+        if (length_in_bytes < 8 || length_in_bytes > 16 || !is_feat_fp16_supported()) {
           return false;
         }
         break;
@@ -290,6 +319,7 @@ source %{
       case Op_VectorRearrange:
       case Op_MulReductionVD:
       case Op_MulReductionVF:
+      case Op_MulReductionVHF:
       case Op_MulReductionVI:
       case Op_MulReductionVL:
       case Op_CompressBitsV:
@@ -354,6 +384,7 @@ source %{
       case Op_VectorMaskCmp:
       case Op_LoadVectorGather:
       case Op_StoreVectorScatter:
+      case Op_AddReductionVHF:
       case Op_AddReductionVF:
       case Op_AddReductionVD:
       case Op_AndReductionV:
@@ -2063,6 +2094,25 @@ instruct reduce_non_strict_order_add4F_neon(vRegF dst, vRegF fsrc, vReg vsrc, vR
   ins_pipe(pipe_slow);
 %}
 dnl
+
+// Add Reduction for Half floats (FP16).
+// Neon does not provide direct instructions for strictly ordered floating-point add reductions.
+// On Neon-only targets (UseSVE = 0), this operation is implemented as a sequence of scalar additions:
+// values equal to the vector width are loaded into a vector register, each lane is extracted,
+// and its value is accumulated into the running sum, producing a final scalar result.
+instruct reduce_addHF_neon(vRegF dst, vRegF fsrc, vReg vsrc, vReg tmp) %{
+  predicate(UseSVE == 0);
+  match(Set dst (AddReductionVHF fsrc vsrc));
+  effect(TEMP_DEF dst, TEMP tmp);
+  format %{ "reduce_addHF $dst, $fsrc, $vsrc\t# 4HF/8HF. KILL $tmp" %}
+  ins_encode %{
+    uint length_in_bytes = Matcher::vector_length_in_bytes(this, $vsrc);
+    __ neon_reduce_add_fp16($dst$$FloatRegister, $fsrc$$FloatRegister,
+                            $vsrc$$FloatRegister, length_in_bytes, $tmp$$FloatRegister);
+  %}
+  ins_pipe(pipe_slow);
+%}
+dnl
 dnl REDUCE_ADD_FP_SVE($1,   $2  )
 dnl REDUCE_ADD_FP_SVE(type, size)
 define(`REDUCE_ADD_FP_SVE', `
@@ -2074,21 +2124,26 @@ define(`REDUCE_ADD_FP_SVE', `
 //    strictly ordered.
 // 2. Strictly-ordered AddReductionV$1. For example - AddReductionV$1 generated by
 //    auto-vectorization on SVE machine.
-instruct reduce_add$1_sve(vReg$1 dst_src1, vReg src2) %{
-  predicate(!VM_Version::use_neon_for_vector(Matcher::vector_length_in_bytes(n->in(2))) ||
-            n->as_Reduction()->requires_strict_order());
+instruct reduce_add$1_sve(vReg`'ifelse($1, HF, F, $1) dst_src1, vReg src2) %{
+  ifelse($1, HF,
+       `predicate(UseSVE > 0);',
+       `predicate(!VM_Version::use_neon_for_vector(Matcher::vector_length_in_bytes(n->in(2))) ||
+            n->as_Reduction()->requires_strict_order());')
   match(Set dst_src1 (AddReductionV$1 dst_src1 src2));
   format %{ "reduce_add$1_sve $dst_src1, $dst_src1, $src2" %}
   ins_encode %{
-    assert(UseSVE > 0, "must be sve");
-    uint length_in_bytes = Matcher::vector_length_in_bytes(this, $src2);
+    ifelse($1, HF, `',
+       `assert(UseSVE > 0, "must be sve");
+    ')dnl
+uint length_in_bytes = Matcher::vector_length_in_bytes(this, $src2);
     assert(length_in_bytes == MaxVectorSize, "invalid vector length");
     __ sve_fadda($dst_src1$$FloatRegister, __ $2, ptrue, $src2$$FloatRegister);
   %}
   ins_pipe(pipe_slow);
 %}')dnl
 dnl
-REDUCE_ADD_FP_SVE(F, S)
+REDUCE_ADD_FP_SVE(HF, H)
+REDUCE_ADD_FP_SVE(F,  S)
 
 // reduction addD
 
@@ -2129,21 +2184,30 @@ dnl
 dnl REDUCE_ADD_FP_PREDICATE($1,        $2     )
 dnl REDUCE_ADD_FP_PREDICATE(insn_name, op_name)
 define(`REDUCE_ADD_FP_PREDICATE', `
-instruct reduce_add$1_masked(vReg$1 dst_src1, vReg src2, pRegGov pg) %{
+instruct reduce_add$1_masked(vReg$2 dst_src1, vReg src2, pRegGov pg) %{
   predicate(UseSVE > 0);
-  match(Set dst_src1 (AddReductionV$1 (Binary dst_src1 src2) pg));
+  ifelse($2, F,
+       `match(Set dst_src1 (AddReductionVHF (Binary dst_src1 src2) pg));
+  match(Set dst_src1 (AddReductionV$2 (Binary dst_src1 src2) pg));',
+       `match(Set dst_src1 (AddReductionV$2 (Binary dst_src1 src2) pg));')
   format %{ "reduce_add$1_masked $dst_src1, $pg, $dst_src1, $src2" %}
   ins_encode %{
-    __ sve_fadda($dst_src1$$FloatRegister, __ $2,
-                 $pg$$PRegister, $src2$$FloatRegister);
+    ifelse($2, F,
+       `BasicType bt = Matcher::vector_element_basic_type(this, $src2);
+    ',)dnl
+ifelse($2, F,
+       `__ sve_fadda($dst_src1$$FloatRegister, __ elemType_to_regVariant(bt),
+                 $pg$$PRegister, $src2$$FloatRegister);',
+       `__ sve_fadda($dst_src1$$FloatRegister, __ $2,
+                 $pg$$PRegister, $src2$$FloatRegister);')
   %}
   ins_pipe(pipe_slow);
 %}')dnl
 dnl
 REDUCE_ADD_INT_PREDICATE(I, iRegIorL2I)
 REDUCE_ADD_INT_PREDICATE(L, iRegL)
-REDUCE_ADD_FP_PREDICATE(F, S)
-REDUCE_ADD_FP_PREDICATE(D, D)
+REDUCE_ADD_FP_PREDICATE(FHF, F)
+REDUCE_ADD_FP_PREDICATE(D,   D)
 
 // ------------------------------ Vector reduction mul -------------------------
 
@@ -2176,30 +2240,37 @@ instruct reduce_mulL(iRegLNoSp dst, iRegL isrc, vReg vsrc) %{
   ins_pipe(pipe_slow);
 %}
 
-instruct reduce_mulF(vRegF dst, vRegF fsrc, vReg vsrc, vReg tmp) %{
-  predicate(Matcher::vector_length_in_bytes(n->in(2)) <= 16);
-  match(Set dst (MulReductionVF fsrc vsrc));
+dnl REDUCE_MUL_FP($1,        $2     )
+dnl REDUCE_MUL_FP(insn_name, op_name)
+define(`REDUCE_MUL_FP', `
+instruct reduce_mul$1(vReg$2 dst, vReg$2 ifelse($2, F, fsrc, dsrc), vReg vsrc, vReg tmp) %{
+  predicate(Matcher::vector_length_in_bytes(n->in(2)) ifelse($2, F, <=, ==) 16);
+  ifelse($2, F,
+       `match(Set dst (MulReductionVHF fsrc vsrc));
+  match(Set dst (MulReductionV$2 fsrc vsrc));',
+       `match(Set dst (MulReductionV$2 dsrc vsrc));')
   effect(TEMP_DEF dst, TEMP tmp);
-  format %{ "reduce_mulF $dst, $fsrc, $vsrc\t# 2F/4F. KILL $tmp" %}
+  ifelse($2, F,
+         `format %{ "reduce_mul$1 $dst, $fsrc, $vsrc\t# 2F/4F/4HF/8HF. KILL $tmp" %}',
+         `format %{ "reduce_mul$1 $dst, $dsrc, $vsrc\t# 2D. KILL $tmp" %}')
   ins_encode %{
-    uint length_in_bytes = Matcher::vector_length_in_bytes(this, $vsrc);
-    __ neon_reduce_mul_fp($dst$$FloatRegister, T_FLOAT, $fsrc$$FloatRegister,
-                          $vsrc$$FloatRegister, length_in_bytes, $tmp$$FloatRegister);
+    ifelse($2, F,
+       `uint length_in_bytes = Matcher::vector_length_in_bytes(this, $vsrc);
+    ',)dnl
+ifelse($2, F,
+       `BasicType bt = Matcher::vector_element_basic_type(this, $vsrc);
+    ',)dnl
+ifelse($2, F,
+       `__ neon_reduce_mul_fp($dst$$FloatRegister, bt, $fsrc$$FloatRegister,
+                          $vsrc$$FloatRegister, length_in_bytes, $tmp$$FloatRegister);',
+       `__ neon_reduce_mul_fp($dst$$FloatRegister, T_DOUBLE, $dsrc$$FloatRegister,
+                          $vsrc$$FloatRegister, 16, $tmp$$FloatRegister);')
   %}
   ins_pipe(pipe_slow);
-%}
-
-instruct reduce_mulD(vRegD dst, vRegD dsrc, vReg vsrc, vReg tmp) %{
-  predicate(Matcher::vector_length_in_bytes(n->in(2)) == 16);
-  match(Set dst (MulReductionVD dsrc vsrc));
-  effect(TEMP_DEF dst, TEMP tmp);
-  format %{ "reduce_mulD $dst, $dsrc, $vsrc\t# 2D. KILL $tmp" %}
-  ins_encode %{
-    __ neon_reduce_mul_fp($dst$$FloatRegister, T_DOUBLE, $dsrc$$FloatRegister,
-                          $vsrc$$FloatRegister, 16, $tmp$$FloatRegister);
-  %}
-  ins_pipe(pipe_slow);
-%}
+%}')dnl
+dnl
+REDUCE_MUL_FP(FHF, F)
+REDUCE_MUL_FP(D,   D)
 
 dnl
 dnl REDUCE_BITWISE_OP_NEON($1,        $2       $3    $4     )
diff --git a/src/hotspot/cpu/aarch64/c2_MacroAssembler_aarch64.cpp b/src/hotspot/cpu/aarch64/c2_MacroAssembler_aarch64.cpp
index bba37a7a390..3c179f21c14 100644
--- a/src/hotspot/cpu/aarch64/c2_MacroAssembler_aarch64.cpp
+++ b/src/hotspot/cpu/aarch64/c2_MacroAssembler_aarch64.cpp
@@ -1,5 +1,6 @@
 /*
  * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
+ * Copyright 2026 Arm Limited and/or its affiliates.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -1883,6 +1884,27 @@ void C2_MacroAssembler::neon_reduce_mul_fp(FloatRegister dst, BasicType bt,
 
   BLOCK_COMMENT("neon_reduce_mul_fp {");
     switch(bt) {
+      // The T_SHORT type below is for Float16 type which also uses floating-point
+      // instructions.
+      case T_SHORT:
+        fmulh(dst, fsrc, vsrc);
+        ext(vtmp, T8B, vsrc, vsrc, 2);
+        fmulh(dst, dst, vtmp);
+        ext(vtmp, T8B, vsrc, vsrc, 4);
+        fmulh(dst, dst, vtmp);
+        ext(vtmp, T8B, vsrc, vsrc, 6);
+        fmulh(dst, dst, vtmp);
+        if (isQ) {
+          ext(vtmp, T16B, vsrc, vsrc, 8);
+          fmulh(dst, dst, vtmp);
+          ext(vtmp, T16B, vsrc, vsrc, 10);
+          fmulh(dst, dst, vtmp);
+          ext(vtmp, T16B, vsrc, vsrc, 12);
+          fmulh(dst, dst, vtmp);
+          ext(vtmp, T16B, vsrc, vsrc, 14);
+          fmulh(dst, dst, vtmp);
+        }
+        break;
       case T_FLOAT:
         fmuls(dst, fsrc, vsrc);
         ins(vtmp, S, vsrc, 0, 1);
@@ -1907,6 +1929,33 @@ void C2_MacroAssembler::neon_reduce_mul_fp(FloatRegister dst, BasicType bt,
   BLOCK_COMMENT("} neon_reduce_mul_fp");
 }
 
+// Vector reduction add for half float type with ASIMD instructions.
+void C2_MacroAssembler::neon_reduce_add_fp16(FloatRegister dst, FloatRegister fsrc, FloatRegister vsrc,
+                                             unsigned vector_length_in_bytes, FloatRegister vtmp) {
+  assert(vector_length_in_bytes == 8 || vector_length_in_bytes == 16, "unsupported");
+  bool isQ = vector_length_in_bytes == 16;
+
+  BLOCK_COMMENT("neon_reduce_add_fp16 {");
+    faddh(dst, fsrc, vsrc);
+    ext(vtmp, T8B, vsrc, vsrc, 2);
+    faddh(dst, dst, vtmp);
+    ext(vtmp, T8B, vsrc, vsrc, 4);
+    faddh(dst, dst, vtmp);
+    ext(vtmp, T8B, vsrc, vsrc, 6);
+    faddh(dst, dst, vtmp);
+    if (isQ) {
+      ext(vtmp, T16B, vsrc, vsrc, 8);
+      faddh(dst, dst, vtmp);
+      ext(vtmp, T16B, vsrc, vsrc, 10);
+      faddh(dst, dst, vtmp);
+      ext(vtmp, T16B, vsrc, vsrc, 12);
+      faddh(dst, dst, vtmp);
+      ext(vtmp, T16B, vsrc, vsrc, 14);
+      faddh(dst, dst, vtmp);
+    }
+  BLOCK_COMMENT("} neon_reduce_add_fp16");
+}
+
 // Helper to select logical instruction
 void C2_MacroAssembler::neon_reduce_logical_helper(int opc, bool is64, Register Rd,
                                                    Register Rn, Register Rm,
diff --git a/src/hotspot/cpu/aarch64/c2_MacroAssembler_aarch64.hpp b/src/hotspot/cpu/aarch64/c2_MacroAssembler_aarch64.hpp
index 5964bb60d4f..f96d3ffb863 100644
--- a/src/hotspot/cpu/aarch64/c2_MacroAssembler_aarch64.hpp
+++ b/src/hotspot/cpu/aarch64/c2_MacroAssembler_aarch64.hpp
@@ -177,6 +177,9 @@
                           FloatRegister fsrc, FloatRegister vsrc,
                           unsigned vector_length_in_bytes, FloatRegister vtmp);
 
+  void neon_reduce_add_fp16(FloatRegister dst, FloatRegister fsrc, FloatRegister vsrc,
+                            unsigned vector_length_in_bytes, FloatRegister vtmp);
+
   void neon_reduce_logical(int opc, Register dst, BasicType bt, Register isrc,
                            FloatRegister vsrc, unsigned vector_length_in_bytes);
 
diff --git a/src/hotspot/share/adlc/formssel.cpp b/src/hotspot/share/adlc/formssel.cpp
index 4dd2bff7c89..5802217c1c1 100644
--- a/src/hotspot/share/adlc/formssel.cpp
+++ b/src/hotspot/share/adlc/formssel.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1998, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1998, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -4233,11 +4233,13 @@ int MatchRule::is_expensive() const {
         strcmp(opType,"PopulateIndex")==0 ||
         strcmp(opType,"AddReductionVI")==0 ||
         strcmp(opType,"AddReductionVL")==0 ||
+        strcmp(opType,"AddReductionVHF")==0 ||
         strcmp(opType,"AddReductionVF")==0 ||
         strcmp(opType,"AddReductionVD")==0 ||
         strcmp(opType,"MulReductionVI")==0 ||
         strcmp(opType,"MulReductionVL")==0 ||
         strcmp(opType,"MulReductionVF")==0 ||
+        strcmp(opType,"MulReductionVHF")==0 ||
         strcmp(opType,"MulReductionVD")==0 ||
         strcmp(opType,"MinReductionV")==0 ||
         strcmp(opType,"MaxReductionV")==0 ||
@@ -4348,9 +4350,9 @@ bool MatchRule::is_vector() const {
     "MaxV", "MinV", "MinVHF", "MaxVHF", "UMinV", "UMaxV",
     "CompressV", "ExpandV", "CompressM", "CompressBitsV", "ExpandBitsV",
     "AddReductionVI", "AddReductionVL",
-    "AddReductionVF", "AddReductionVD",
+    "AddReductionVHF", "AddReductionVF", "AddReductionVD",
     "MulReductionVI", "MulReductionVL",
-    "MulReductionVF", "MulReductionVD",
+    "MulReductionVHF", "MulReductionVF", "MulReductionVD",
     "MaxReductionV", "MinReductionV",
     "AndReductionV", "OrReductionV", "XorReductionV",
     "MulAddVS2VI", "MacroLogicV",
diff --git a/src/hotspot/share/opto/classes.hpp b/src/hotspot/share/opto/classes.hpp
index 3c1a68d6224..0f67cf90183 100644
--- a/src/hotspot/share/opto/classes.hpp
+++ b/src/hotspot/share/opto/classes.hpp
@@ -396,6 +396,7 @@ macro(AddVL)
 macro(AddReductionVL)
 macro(AddVF)
 macro(AddVHF)
+macro(AddReductionVHF)
 macro(AddReductionVF)
 macro(AddVD)
 macro(AddReductionVD)
@@ -413,6 +414,7 @@ macro(MulReductionVI)
 macro(MulVL)
 macro(MulReductionVL)
 macro(MulVF)
+macro(MulReductionVHF)
 macro(MulReductionVF)
 macro(MulVD)
 macro(MulReductionVD)
diff --git a/src/hotspot/share/opto/compile.cpp b/src/hotspot/share/opto/compile.cpp
index db3cbd4109c..e05df8ea716 100644
--- a/src/hotspot/share/opto/compile.cpp
+++ b/src/hotspot/share/opto/compile.cpp
@@ -3200,10 +3200,10 @@ void Compile::final_graph_reshaping_impl(Node *n, Final_Reshape_Counts& frc, Uni
       !n->in(2)->is_Con() ) {   // right use is not a constant
     // Check for commutative opcode
     switch( nop ) {
-    case Op_AddI:  case Op_AddF:  case Op_AddD:  case Op_AddL:
+    case Op_AddI:  case Op_AddF:  case Op_AddD:  case Op_AddHF:  case Op_AddL:
     case Op_MaxI:  case Op_MaxL:  case Op_MaxF:  case Op_MaxD:
     case Op_MinI:  case Op_MinL:  case Op_MinF:  case Op_MinD:
-    case Op_MulI:  case Op_MulF:  case Op_MulD:  case Op_MulL:
+    case Op_MulI:  case Op_MulF:  case Op_MulD:  case Op_MulHF:  case Op_MulL:
     case Op_AndL:  case Op_XorL:  case Op_OrL:
     case Op_AndI:  case Op_XorI:  case Op_OrI: {
       // Move "last use" input to left by swapping inputs
@@ -3282,6 +3282,8 @@ void Compile::handle_div_mod_op(Node* n, BasicType bt, bool is_unsigned) {
 void Compile::final_graph_reshaping_main_switch(Node* n, Final_Reshape_Counts& frc, uint nop, Unique_Node_List& dead_nodes) {
   switch( nop ) {
   // Count all float operations that may use FPU
+  case Op_AddHF:
+  case Op_MulHF:
   case Op_AddF:
   case Op_SubF:
   case Op_MulF:
@@ -3788,10 +3790,12 @@ void Compile::final_graph_reshaping_main_switch(Node* n, Final_Reshape_Counts& f
 
   case Op_AddReductionVI:
   case Op_AddReductionVL:
+  case Op_AddReductionVHF:
   case Op_AddReductionVF:
   case Op_AddReductionVD:
   case Op_MulReductionVI:
   case Op_MulReductionVL:
+  case Op_MulReductionVHF:
   case Op_MulReductionVF:
   case Op_MulReductionVD:
   case Op_MinReductionV:
diff --git a/src/hotspot/share/opto/vectornode.cpp b/src/hotspot/share/opto/vectornode.cpp
index dbadc18da01..d19aa476196 100644
--- a/src/hotspot/share/opto/vectornode.cpp
+++ b/src/hotspot/share/opto/vectornode.cpp
@@ -1260,6 +1260,10 @@ int ReductionNode::opcode(int opc, BasicType bt) {
       assert(bt == T_LONG, "must be");
       vopc = Op_AddReductionVL;
       break;
+    case Op_AddHF:
+      assert(bt == T_SHORT, "must be");
+      vopc = Op_AddReductionVHF;
+      break;
     case Op_AddF:
       assert(bt == T_FLOAT, "must be");
       vopc = Op_AddReductionVF;
@@ -1284,6 +1288,10 @@ int ReductionNode::opcode(int opc, BasicType bt) {
       assert(bt == T_LONG, "must be");
       vopc = Op_MulReductionVL;
       break;
+    case Op_MulHF:
+      assert(bt == T_SHORT, "must be");
+      vopc = Op_MulReductionVHF;
+      break;
     case Op_MulF:
       assert(bt == T_FLOAT, "must be");
       vopc = Op_MulReductionVF;
@@ -1432,10 +1440,12 @@ ReductionNode* ReductionNode::make(int opc, Node* ctrl, Node* n1, Node* n2, Basi
   switch (vopc) {
   case Op_AddReductionVI: return new AddReductionVINode(ctrl, n1, n2);
   case Op_AddReductionVL: return new AddReductionVLNode(ctrl, n1, n2);
+  case Op_AddReductionVHF: return new AddReductionVHFNode(ctrl, n1, n2, requires_strict_order);
   case Op_AddReductionVF: return new AddReductionVFNode(ctrl, n1, n2, requires_strict_order);
   case Op_AddReductionVD: return new AddReductionVDNode(ctrl, n1, n2, requires_strict_order);
   case Op_MulReductionVI: return new MulReductionVINode(ctrl, n1, n2);
   case Op_MulReductionVL: return new MulReductionVLNode(ctrl, n1, n2);
+  case Op_MulReductionVHF: return new MulReductionVHFNode(ctrl, n1, n2, requires_strict_order);
   case Op_MulReductionVF: return new MulReductionVFNode(ctrl, n1, n2, requires_strict_order);
   case Op_MulReductionVD: return new MulReductionVDNode(ctrl, n1, n2, requires_strict_order);
   case Op_MinReductionV:  return new MinReductionVNode (ctrl, n1, n2);
@@ -1613,6 +1623,8 @@ Node* ReductionNode::make_identity_con_scalar(PhaseGVN& gvn, int sopc, BasicType
           return nullptr;
       }
       break;
+    case Op_AddReductionVHF:
+      return gvn.makecon(TypeH::ZERO);
     case Op_AddReductionVI: // fallthrough
     case Op_AddReductionVL: // fallthrough
     case Op_AddReductionVF: // fallthrough
@@ -1624,6 +1636,8 @@ Node* ReductionNode::make_identity_con_scalar(PhaseGVN& gvn, int sopc, BasicType
       return gvn.makecon(TypeInt::ONE);
     case Op_MulReductionVL:
       return gvn.makecon(TypeLong::ONE);
+    case Op_MulReductionVHF:
+      return gvn.makecon(TypeH::ONE);
     case Op_MulReductionVF:
       return gvn.makecon(TypeF::ONE);
     case Op_MulReductionVD:
@@ -1716,12 +1730,14 @@ bool ReductionNode::auto_vectorization_requires_strict_order(int vopc) {
       // These are cases that all have associative operations, which can
       // thus be reordered, allowing non-strict order reductions.
       return false;
+    case Op_AddReductionVHF:
+    case Op_MulReductionVHF:
     case Op_AddReductionVF:
     case Op_MulReductionVF:
     case Op_AddReductionVD:
     case Op_MulReductionVD:
       // Floating-point addition and multiplication are non-associative,
-      // so AddReductionVF/D and MulReductionVF/D require strict ordering
+      // so AddReductionVHF/VF/VD and MulReductionVHF/VF/VD require strict ordering
       // in auto-vectorization.
       return true;
     default:
diff --git a/src/hotspot/share/opto/vectornode.hpp b/src/hotspot/share/opto/vectornode.hpp
index de866898302..91cff9fcae8 100644
--- a/src/hotspot/share/opto/vectornode.hpp
+++ b/src/hotspot/share/opto/vectornode.hpp
@@ -1,5 +1,6 @@
 /*
  * Copyright (c) 2007, 2026, Oracle and/or its affiliates. All rights reserved.
+ * Copyright 2026 Arm Limited and/or its affiliates.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -322,7 +323,7 @@ class ReductionNode : public Node {
   virtual uint size_of() const { return sizeof(*this); }
 
   // Floating-point addition and multiplication are non-associative, so
-  // AddReductionVF/D and MulReductionVF/D require strict ordering
+  // AddReductionVHF/F/D and MulReductionVHF/F/D require strict ordering
   // in auto-vectorization. Vector API can generate AddReductionVF/D
   // and MulReductionVF/VD without strict ordering, which can benefit
   // some platforms.
@@ -359,6 +360,35 @@ public:
   virtual int Opcode() const;
 };
 
+// Vector add half float as a reduction
+class AddReductionVHFNode : public ReductionNode {
+private:
+  // True if add reduction operation for half floats requires strict ordering.
+  // As an example - The value is true when add reduction for half floats is auto-vectorized
+  // as auto-vectorization mandates strict ordering but the value is false when this node
+  // is generated through VectorAPI as VectorAPI does not impose any such rules on ordering.
+  const bool _requires_strict_order;
+
+public:
+  // _requires_strict_order is set to true by default as mandated by auto-vectorization
+  AddReductionVHFNode(Node* ctrl, Node* in1, Node* in2, bool requires_strict_order = true) :
+    ReductionNode(ctrl, in1, in2), _requires_strict_order(requires_strict_order) {}
+
+  int Opcode() const override;
+  bool requires_strict_order() const override { return _requires_strict_order; }
+
+  uint hash() const override { return Node::hash() + _requires_strict_order; }
+
+  bool cmp(const Node& n) const override {
+    return Node::cmp(n) && _requires_strict_order == ((ReductionNode&)n).requires_strict_order();
+  }
+
+  uint size_of() const override { return sizeof(*this); }
+
+  const Type* bottom_type() const override { return Type::HALF_FLOAT; }
+  uint ideal_reg() const override { return Op_RegF; }
+};
+
 // Vector add float as a reduction
 class AddReductionVFNode : public ReductionNode {
 private:
@@ -368,7 +398,7 @@ private:
   // is generated through VectorAPI as VectorAPI does not impose any such rules on ordering.
   const bool _requires_strict_order;
 public:
-  //_requires_strict_order is set to true by default as mandated by auto-vectorization
+  // _requires_strict_order is set to true by default as mandated by auto-vectorization
   AddReductionVFNode(Node* ctrl, Node* in1, Node* in2, bool requires_strict_order = true) :
     ReductionNode(ctrl, in1, in2), _requires_strict_order(requires_strict_order) {}
 
@@ -394,7 +424,7 @@ private:
   // is generated through VectorAPI as VectorAPI does not impose any such rules on ordering.
   const bool _requires_strict_order;
 public:
-  //_requires_strict_order is set to true by default as mandated by auto-vectorization
+  // _requires_strict_order is set to true by default as mandated by auto-vectorization
   AddReductionVDNode(Node* ctrl, Node* in1, Node* in2, bool requires_strict_order = true) :
     ReductionNode(ctrl, in1, in2), _requires_strict_order(requires_strict_order) {}
 
@@ -578,6 +608,35 @@ public:
   virtual int Opcode() const;
 };
 
+// Vector multiply half float as a reduction
+class MulReductionVHFNode : public ReductionNode {
+private:
+  // True if mul reduction operation for half floats requires strict ordering.
+  // As an example - The value is true when mul reduction for half floats is auto-vectorized
+  // as auto-vectorization mandates strict ordering but the value is false when this node
+  // is generated through VectorAPI as VectorAPI does not impose any such rules on ordering.
+  const bool _requires_strict_order;
+
+public:
+  // _requires_strict_order is set to true by default as mandated by auto-vectorization
+  MulReductionVHFNode(Node* ctrl, Node* in1, Node* in2, bool requires_strict_order = true) :
+    ReductionNode(ctrl, in1, in2), _requires_strict_order(requires_strict_order) {}
+
+  int Opcode() const override;
+  bool requires_strict_order() const override { return _requires_strict_order; }
+
+  uint hash() const override { return Node::hash() + _requires_strict_order; }
+
+  bool cmp(const Node& n) const override {
+    return Node::cmp(n) && _requires_strict_order == ((ReductionNode&)n).requires_strict_order();
+  }
+
+  uint size_of() const override { return sizeof(*this); }
+
+  const Type* bottom_type() const override { return Type::HALF_FLOAT; }
+  uint ideal_reg() const override { return Op_RegF; }
+};
+
 // Vector multiply float as a reduction
 class MulReductionVFNode : public ReductionNode {
   // True if mul reduction operation for floats requires strict ordering.
@@ -586,7 +645,7 @@ class MulReductionVFNode : public ReductionNode {
   // is generated through VectorAPI as VectorAPI does not impose any such rules on ordering.
   const bool _requires_strict_order;
 public:
-  //_requires_strict_order is set to true by default as mandated by auto-vectorization
+  // _requires_strict_order is set to true by default as mandated by auto-vectorization
   MulReductionVFNode(Node* ctrl, Node* in1, Node* in2, bool requires_strict_order = true) :
     ReductionNode(ctrl, in1, in2), _requires_strict_order(requires_strict_order) {}
 
@@ -611,7 +670,7 @@ class MulReductionVDNode : public ReductionNode {
   // is generated through VectorAPI as VectorAPI does not impose any such rules on ordering.
   const bool _requires_strict_order;
 public:
-  //_requires_strict_order is set to true by default as mandated by auto-vectorization
+  // _requires_strict_order is set to true by default as mandated by auto-vectorization
   MulReductionVDNode(Node* ctrl, Node* in1, Node* in2, bool requires_strict_order = true) :
     ReductionNode(ctrl, in1, in2), _requires_strict_order(requires_strict_order) {}
 
diff --git a/test/hotspot/jtreg/compiler/lib/ir_framework/IRNode.java b/test/hotspot/jtreg/compiler/lib/ir_framework/IRNode.java
index f3fc4afb170..55d591acdb3 100644
--- a/test/hotspot/jtreg/compiler/lib/ir_framework/IRNode.java
+++ b/test/hotspot/jtreg/compiler/lib/ir_framework/IRNode.java
@@ -323,6 +323,11 @@ public class IRNode {
         superWordNodes(ADD_REDUCTION_VF, "AddReductionVF");
     }
 
+    public static final String ADD_REDUCTION_VHF = PREFIX + "ADD_REDUCTION_VHF" + POSTFIX;
+    static {
+        superWordNodes(ADD_REDUCTION_VHF, "AddReductionVHF");
+    }
+
     public static final String ADD_REDUCTION_VI = PREFIX + "ADD_REDUCTION_VI" + POSTFIX;
     static {
         superWordNodes(ADD_REDUCTION_VI, "AddReductionVI");
@@ -1576,6 +1581,11 @@ public class IRNode {
         superWordNodes(MUL_REDUCTION_VF, "MulReductionVF");
     }
 
+    public static final String MUL_REDUCTION_VHF = PREFIX + "MUL_REDUCTION_VHF" + POSTFIX;
+    static {
+        superWordNodes(MUL_REDUCTION_VHF, "MulReductionVHF");
+    }
+
     public static final String MUL_REDUCTION_VI = PREFIX + "MUL_REDUCTION_VI" + POSTFIX;
     static {
         superWordNodes(MUL_REDUCTION_VI, "MulReductionVI");
diff --git a/test/hotspot/jtreg/compiler/loopopts/superword/TestReductions.java b/test/hotspot/jtreg/compiler/loopopts/superword/TestReductions.java
index 5c085e6a3a3..97a55ae2074 100644
--- a/test/hotspot/jtreg/compiler/loopopts/superword/TestReductions.java
+++ b/test/hotspot/jtreg/compiler/loopopts/superword/TestReductions.java
@@ -1,5 +1,6 @@
 /*
  * Copyright (c) 2024, 2026, Oracle and/or its affiliates. All rights reserved.
+ * Copyright 2026 Arm Limited and/or its affiliates.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,6 +26,7 @@
  * @test id=no-vectorization
  * @bug 8340093 8342095
  * @summary Test vectorization of reduction loops.
+ * @modules jdk.incubator.vector
  * @library /test/lib /
  * @run driver compiler.loopopts.superword.TestReductions P0
  */
@@ -33,6 +35,7 @@
  * @test id=vanilla
  * @bug 8340093 8342095
  * @summary Test vectorization of reduction loops.
+ * @modules jdk.incubator.vector
  * @library /test/lib /
  * @run driver compiler.loopopts.superword.TestReductions P1
  */
@@ -41,6 +44,7 @@
  * @test id=force-vectorization
  * @bug 8340093 8342095
  * @summary Test vectorization of reduction loops.
+ * @modules jdk.incubator.vector
  * @library /test/lib /
  * @run driver compiler.loopopts.superword.TestReductions P2
  */
@@ -50,10 +54,14 @@ package compiler.loopopts.superword;
 import java.util.Map;
 import java.util.HashMap;
 
+import jdk.incubator.vector.Float16;
+
 import compiler.lib.ir_framework.*;
 import compiler.lib.verify.*;
 import static compiler.lib.generators.Generators.G;
 import compiler.lib.generators.Generator;
+import static java.lang.Float.floatToFloat16;
+import static jdk.incubator.vector.Float16.*;
 
 /**
  * Note: there is a corresponding JMH benchmark:
@@ -65,6 +73,7 @@ public class TestReductions {
     private static final Generator<Long>    GEN_L = G.longs();
     private static final Generator<Float>   GEN_F = G.floats();
     private static final Generator<Double>  GEN_D = G.doubles();
+    private static final Generator<Short>   GEN_F16 = G.float16s();
 
     private static byte[] in1B   = fillRandom(new byte[SIZE]);
     private static byte[] in2B   = fillRandom(new byte[SIZE]);
@@ -89,6 +98,9 @@ public class TestReductions {
     private static double[] in1D = fillRandom(new double[SIZE]);
     private static double[] in2D = fillRandom(new double[SIZE]);
     private static double[] in3D = fillRandom(new double[SIZE]);
+    private static short[] in1F16 = fillRandomFloat16(new short[SIZE]);
+    private static short[] in2F16 = fillRandomFloat16(new short[SIZE]);
+    private static short[] in3F16 = fillRandomFloat16(new short[SIZE]);
 
     interface TestFunction {
         Object run();
@@ -102,6 +114,7 @@ public class TestReductions {
 
     public static void main(String[] args) {
         TestFramework framework = new TestFramework(TestReductions.class);
+        framework.addFlags("--add-modules=jdk.incubator.vector");
         switch (args[0]) {
             case "P0" -> { framework.addFlags("-XX:+UnlockDiagnosticVMOptions", "-XX:AutoVectorizationOverrideProfitability=0"); }
             case "P1" -> { framework.addFlags("-XX:+UnlockDiagnosticVMOptions", "-XX:AutoVectorizationOverrideProfitability=1"); }
@@ -250,6 +263,13 @@ public class TestReductions {
         tests.put("doubleMinBig",        TestReductions::doubleMinBig);
         tests.put("doubleMaxBig",        TestReductions::doubleMaxBig);
 
+        tests.put("float16AddSimple",    TestReductions::float16AddSimple);
+        tests.put("float16MulSimple",    TestReductions::float16MulSimple);
+        tests.put("float16AddDotProduct", TestReductions::float16AddDotProduct);
+        tests.put("float16MulDotProduct", TestReductions::float16MulDotProduct);
+        tests.put("float16AddBig",       TestReductions::float16AddBig);
+        tests.put("float16MulBig",       TestReductions::float16MulBig);
+
         // Compute gold value for all test methods before compilation
         for (Map.Entry<String,TestFunction> entry : tests.entrySet()) {
             String name = entry.getKey();
@@ -394,7 +414,14 @@ public class TestReductions {
                  "doubleAddBig",
                  "doubleMulBig",
                  "doubleMinBig",
-                 "doubleMaxBig"})
+                 "doubleMaxBig",
+
+                 "float16AddSimple",
+                 "float16MulSimple",
+                 "float16AddDotProduct",
+                 "float16MulDotProduct",
+                 "float16AddBig",
+                 "float16MulBig"})
     public void runTests() {
         for (Map.Entry<String,TestFunction> entry : tests.entrySet()) {
             String name = entry.getKey();
@@ -453,6 +480,13 @@ public class TestReductions {
         return a;
     }
 
+    static short[] fillRandomFloat16(short[] a) {
+        for (int i = 0; i < a.length; i++) {
+            a[i] = GEN_F16.next();
+        }
+        return a;
+    }
+
     // ---------byte***Simple ------------------------------------------------------------
     @Test
     @IR(counts = {IRNode.LOAD_VECTOR_B, IRNode.VECTOR_SIZE + "min(max_int, max_byte)", "> 0",
@@ -2628,5 +2662,110 @@ public class TestReductions {
         return acc;
     }
 
+    // ---------float16***Simple ------------------------------------------------------------
+    @Test
+    @IR(counts = {IRNode.ADD_REDUCTION_VHF, "> 0"},
+        applyIfCPUFeature = {"sve", "true"},
+        applyIf = {"AutoVectorizationOverrideProfitability", "> 0"})
+    @IR(counts = {IRNode.ADD_REDUCTION_VHF, "> 0"},
+        applyIfCPUFeatureAnd = {"fphp", "true", "asimdhp", "true"},
+        applyIf = {"AutoVectorizationOverrideProfitability", "> 0"})
+    @IR(failOn = IRNode.ADD_REDUCTION_VHF,
+        applyIf = {"AutoVectorizationOverrideProfitability", "= 0"})
+    private static Float16 float16AddSimple() {
+        short acc = (short)0; // neutral element
+        for (int i = 0; i < SIZE; i++) {
+            acc = float16ToRawShortBits(add(shortBitsToFloat16(acc), shortBitsToFloat16(in1F16[i])));
+        }
+        return shortBitsToFloat16(acc);
+    }
+
+    @Test
+    @IR(counts = {IRNode.MUL_REDUCTION_VHF, "> 0"},
+        applyIfCPUFeatureAnd = {"fphp", "true", "asimdhp", "true"},
+        applyIfAnd = {"AutoVectorizationOverrideProfitability", "> 0", "MaxVectorSize", "<=16"})
+    @IR(failOn = IRNode.MUL_REDUCTION_VHF,
+        applyIf = {"AutoVectorizationOverrideProfitability", "= 0"})
+    private static Float16 float16MulSimple() {
+        short acc = floatToFloat16(1.0f); // neutral element
+        for (int i = 0; i < SIZE; i++) {
+            acc = float16ToRawShortBits(multiply(shortBitsToFloat16(acc), shortBitsToFloat16(in1F16[i])));
+        }
+        return shortBitsToFloat16(acc);
+    }
+
+    // ---------float16***DotProduct ------------------------------------------------------------
+    @Test
+    @IR(counts = {IRNode.ADD_REDUCTION_VHF, "> 0"},
+        applyIfCPUFeature = {"sve", "true"},
+        applyIf = {"AutoVectorizationOverrideProfitability", "> 0"})
+    @IR(counts = {IRNode.ADD_REDUCTION_VHF, "> 0"},
+        applyIfCPUFeatureAnd = {"fphp", "true", "asimdhp", "true"},
+        applyIf = {"AutoVectorizationOverrideProfitability", "> 0"})
+    @IR(failOn = IRNode.ADD_REDUCTION_VHF,
+        applyIf = {"AutoVectorizationOverrideProfitability", "= 0"})
+    private static Float16 float16AddDotProduct() {
+        short acc = (short)0; // neutral element
+        for (int i = 0; i < SIZE; i++) {
+            Float16 val = multiply(shortBitsToFloat16(in1F16[i]), shortBitsToFloat16(in2F16[i]));
+            acc = float16ToRawShortBits(add(shortBitsToFloat16(acc), val));
+        }
+        return shortBitsToFloat16(acc);
+    }
+
+    @Test
+    @IR(counts = {IRNode.MUL_REDUCTION_VHF, "> 0"},
+        applyIfCPUFeatureAnd = {"fphp", "true", "asimdhp", "true"},
+        applyIfAnd = {"AutoVectorizationOverrideProfitability", "> 0", "MaxVectorSize", "<=16"})
+    @IR(failOn = IRNode.MUL_REDUCTION_VHF,
+        applyIf = {"AutoVectorizationOverrideProfitability", "= 0"})
+    private static Float16 float16MulDotProduct() {
+        short acc = floatToFloat16(1.0f); // neutral element
+        for (int i = 0; i < SIZE; i++) {
+            Float16 val = multiply(shortBitsToFloat16(in1F16[i]), shortBitsToFloat16(in2F16[i]));
+            acc = float16ToRawShortBits(multiply(shortBitsToFloat16(acc), val));
+        }
+        return shortBitsToFloat16(acc);
+    }
+
+    // ---------float16***Big ------------------------------------------------------------
+    @Test
+    @IR(counts = {IRNode.ADD_REDUCTION_VHF, "> 0"},
+        applyIfCPUFeature = {"sve", "true"},
+        applyIf = {"AutoVectorizationOverrideProfitability", "> 0"})
+    @IR(counts = {IRNode.ADD_REDUCTION_VHF, "> 0"},
+        applyIfCPUFeatureAnd = {"fphp", "true", "asimdhp", "true"},
+        applyIf = {"AutoVectorizationOverrideProfitability", "> 0"})
+    @IR(failOn = IRNode.ADD_REDUCTION_VHF,
+        applyIf = {"AutoVectorizationOverrideProfitability", "= 0"})
+    private static Float16 float16AddBig() {
+        short acc = (short)0; // neutral element
+        for (int i = 0; i < SIZE; i++) {
+            Float16 a = shortBitsToFloat16(in1F16[i]);
+            Float16 b = shortBitsToFloat16(in2F16[i]);
+            Float16 c = shortBitsToFloat16(in3F16[i]);
+            Float16 val = add(multiply(a, b), add(multiply(a, c), multiply(b, c)));
+            acc = float16ToRawShortBits(add(shortBitsToFloat16(acc), val));
+        }
+        return shortBitsToFloat16(acc);
+    }
+
+    @Test
+    @IR(counts = {IRNode.MUL_REDUCTION_VHF, "> 0"},
+        applyIfCPUFeatureAnd = {"fphp", "true", "asimdhp", "true"},
+        applyIfAnd = {"AutoVectorizationOverrideProfitability", "> 0", "MaxVectorSize", "<=16"})
+    @IR(failOn = IRNode.MUL_REDUCTION_VHF,
+        applyIf = {"AutoVectorizationOverrideProfitability", "= 0"})
+    private static Float16 float16MulBig() {
+        short acc = floatToFloat16(1.0f); // neutral element
+        for (int i = 0; i < SIZE; i++) {
+            Float16 a = shortBitsToFloat16(in1F16[i]);
+            Float16 b = shortBitsToFloat16(in2F16[i]);
+            Float16 c = shortBitsToFloat16(in3F16[i]);
+            Float16 val = add(multiply(a, b), add(multiply(a, c), multiply(b, c)));
+            acc = float16ToRawShortBits(multiply(shortBitsToFloat16(acc), val));
+        }
+        return shortBitsToFloat16(acc);
+    }
 
 }
diff --git a/test/hotspot/jtreg/compiler/vectorization/TestFloat16VectorOperations.java b/test/hotspot/jtreg/compiler/vectorization/TestFloat16VectorOperations.java
index f3c27c4d278..929a70f304a 100644
--- a/test/hotspot/jtreg/compiler/vectorization/TestFloat16VectorOperations.java
+++ b/test/hotspot/jtreg/compiler/vectorization/TestFloat16VectorOperations.java
@@ -1,6 +1,6 @@
 /*
  * Copyright (c) 2025, Oracle and/or its affiliates. All rights reserved.
- * Copyright (c) 2025, Arm Limited. All rights reserved.
+ * Copyright 2025, 2026 Arm Limited and/or its affiliates.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -33,19 +33,21 @@
 */
 
 package compiler.vectorization;
-import compiler.lib.ir_framework.*;
-import jdk.incubator.vector.Float16;
-import static jdk.incubator.vector.Float16.*;
-import static java.lang.Float.*;
-import java.util.Arrays;
-import jdk.test.lib.*;
 import compiler.lib.generators.Generator;
+import compiler.lib.ir_framework.*;
+import compiler.lib.verify.Verify;
+import java.util.Arrays;
+import jdk.incubator.vector.Float16;
+import jdk.test.lib.*;
 import static compiler.lib.generators.Generators.G;
+import static java.lang.Float.*;
+import static jdk.incubator.vector.Float16.*;
 
 public class TestFloat16VectorOperations {
     private short[] input1;
     private short[] input2;
     private short[] input3;
+    private Float16[] input4;
     private short[] output;
     private static short FP16_SCALAR = (short)0x7777;
     private static final int LEN = 2048;
@@ -77,6 +79,7 @@ public class TestFloat16VectorOperations {
         input1 = new short[LEN];
         input2 = new short[LEN];
         input3 = new short[LEN];
+        input4 = new Float16[LEN];
         output = new short[LEN];
 
         short min_value = float16ToRawShortBits(Float16.MIN_VALUE);
@@ -86,6 +89,7 @@ public class TestFloat16VectorOperations {
             input1[i] = gen.next();
             input2[i] = gen.next();
             input3[i] = gen.next();
+            input4[i] = shortBitsToFloat16(gen.next());
         }
     }
 
@@ -349,7 +353,9 @@ public class TestFloat16VectorOperations {
     @Test
     @Warmup(50)
     @IR(counts = {IRNode.SUB_VHF, " >0 "},
-        applyIfCPUFeature = {"avx512_fp16", "true"})
+        applyIfCPUFeatureOr = {"avx512_fp16", "true", "sve", "true"})
+    @IR(counts = {IRNode.SUB_VHF, " >0 "},
+        applyIfCPUFeatureAnd = {"fphp", "true", "asimdhp", "true"})
     public void vectorSubConstInputFloat16() {
         for (int i = 0; i < LEN; ++i) {
             output[i] = float16ToRawShortBits(subtract(shortBitsToFloat16(input1[i]), FP16_CONST));
@@ -367,7 +373,9 @@ public class TestFloat16VectorOperations {
     @Test
     @Warmup(50)
     @IR(counts = {IRNode.MUL_VHF, " >0 "},
-        applyIfCPUFeature = {"avx512_fp16", "true"})
+        applyIfCPUFeatureOr = {"avx512_fp16", "true", "sve", "true"})
+    @IR(counts = {IRNode.MUL_VHF, " >0 "},
+        applyIfCPUFeatureAnd = {"fphp", "true", "asimdhp", "true"})
     public void vectorMulConstantInputFloat16() {
         for (int i = 0; i < LEN; ++i) {
             output[i] = float16ToRawShortBits(multiply(FP16_CONST, shortBitsToFloat16(input2[i])));
@@ -385,7 +393,9 @@ public class TestFloat16VectorOperations {
     @Test
     @Warmup(50)
     @IR(counts = {IRNode.DIV_VHF, " >0 "},
-        applyIfCPUFeature = {"avx512_fp16", "true"})
+        applyIfCPUFeatureOr = {"avx512_fp16", "true", "sve", "true"})
+    @IR(counts = {IRNode.DIV_VHF, " >0 "},
+        applyIfCPUFeatureAnd = {"fphp", "true", "asimdhp", "true"})
     public void vectorDivConstantInputFloat16() {
         for (int i = 0; i < LEN; ++i) {
             output[i] = float16ToRawShortBits(divide(FP16_CONST, shortBitsToFloat16(input2[i])));
@@ -403,7 +413,9 @@ public class TestFloat16VectorOperations {
     @Test
     @Warmup(50)
     @IR(counts = {IRNode.MAX_VHF, " >0 "},
-        applyIfCPUFeature = {"avx512_fp16", "true"})
+        applyIfCPUFeatureOr = {"avx512_fp16", "true", "sve", "true"})
+    @IR(counts = {IRNode.MAX_VHF, " >0 "},
+        applyIfCPUFeatureAnd = {"fphp", "true", "asimdhp", "true"})
     public void vectorMaxConstantInputFloat16() {
         for (int i = 0; i < LEN; ++i) {
             output[i] = float16ToRawShortBits(max(FP16_CONST, shortBitsToFloat16(input2[i])));
@@ -421,7 +433,9 @@ public class TestFloat16VectorOperations {
     @Test
     @Warmup(50)
     @IR(counts = {IRNode.MIN_VHF, " >0 "},
-        applyIfCPUFeature = {"avx512_fp16", "true"})
+        applyIfCPUFeatureOr = {"avx512_fp16", "true", "sve", "true"})
+    @IR(counts = {IRNode.MIN_VHF, " >0 "},
+        applyIfCPUFeatureAnd = {"fphp", "true", "asimdhp", "true"})
     public void vectorMinConstantInputFloat16() {
         for (int i = 0; i < LEN; ++i) {
             output[i] = float16ToRawShortBits(min(FP16_CONST, shortBitsToFloat16(input2[i])));
@@ -435,4 +449,206 @@ public class TestFloat16VectorOperations {
             assertResults(2, float16ToRawShortBits(FP16_CONST), input2[i], expected, output[i]);
         }
     }
+
+    @Test
+    @Warmup(50)
+    @IR(counts = {IRNode.ADD_REDUCTION_VHF, " >0 "},
+        applyIfCPUFeature = {"sve", "true"})
+    @IR(counts = {IRNode.ADD_REDUCTION_VHF, " >0 "},
+        applyIfCPUFeatureAnd = {"fphp", "true", "asimdhp", "true"})
+    public short vectorAddReductionFloat16() {
+        short result = (short) 0;
+        for (int i = 0; i < LEN; i++) {
+            result = float16ToRawShortBits(add(shortBitsToFloat16(result), shortBitsToFloat16(input1[i])));
+        }
+        return result;
+    }
+
+    @Check(test="vectorAddReductionFloat16")
+    public void checkResultAddReductionFloat16() {
+        short expected = (short) 0;
+        for (int i = 0; i < LEN; ++i) {
+            expected = floatToFloat16(float16ToFloat(expected) + float16ToFloat(input1[i]));
+        }
+        Verify.checkEQ(shortBitsToFloat16(expected), shortBitsToFloat16(vectorAddReductionFloat16()));
+    }
+
+    @Test
+    @Warmup(50)
+    @IR(counts = {IRNode.MUL_REDUCTION_VHF, " >0 "},
+        applyIfCPUFeatureAnd = {"fphp", "true", "asimdhp", "true"},
+        applyIf = {"MaxVectorSize", "<=16"})
+    public short vectorMulReductionFloat16() {
+        short result = floatToFloat16(1.0f);
+        for (int i = 0; i < LEN; i++) {
+            result = float16ToRawShortBits(multiply(shortBitsToFloat16(result), shortBitsToFloat16(input1[i])));
+        }
+        return result;
+    }
+
+    @Check(test="vectorMulReductionFloat16")
+    public void checkResultMulReductionFloat16() {
+        short expected = floatToFloat16(1.0f);
+        for (int i = 0; i < LEN; ++i) {
+            expected = floatToFloat16(float16ToFloat(expected) * float16ToFloat(input1[i]));
+        }
+        Verify.checkEQ(shortBitsToFloat16(expected), shortBitsToFloat16(vectorMulReductionFloat16()));
+    }
+
+    // This test case verifies that autovectorization takes place in scenarios where masked
+    // add reduction instructions are required to be generated on platforms that support
+    // such masked/partial instructions.
+    @Test
+    @Warmup(500)
+    @IR(counts = {"reduce_addFHF_masked", " >0 "}, phase = {CompilePhase.FINAL_CODE},
+        applyIfCPUFeature = {"sve", "true"})
+    public short vectorAddReductionFloat16Partial() {
+        short result = (short) 0;
+        for (int i = 0; i < LEN; i+=8) {
+            result = float16ToRawShortBits(add(shortBitsToFloat16(result), shortBitsToFloat16(input1[i])));
+            result = float16ToRawShortBits(add(shortBitsToFloat16(result), shortBitsToFloat16(input1[i+1])));
+            result = float16ToRawShortBits(add(shortBitsToFloat16(result), shortBitsToFloat16(input1[i+2])));
+            result = float16ToRawShortBits(add(shortBitsToFloat16(result), shortBitsToFloat16(input1[i+3])));
+        }
+        return result;
+    }
+
+    @Check(test="vectorAddReductionFloat16Partial")
+    public void checkResultAddReductionFloat16Partial() {
+        short expected = (short) 0;
+        for (int i = 0; i < LEN; i+=8) {
+            expected = floatToFloat16(float16ToFloat(expected) + float16ToFloat(input1[i]));
+            expected = floatToFloat16(float16ToFloat(expected) + float16ToFloat(input1[i+1]));
+            expected = floatToFloat16(float16ToFloat(expected) + float16ToFloat(input1[i+2]));
+            expected = floatToFloat16(float16ToFloat(expected) + float16ToFloat(input1[i+3]));
+        }
+        Verify.checkEQ(shortBitsToFloat16(expected), shortBitsToFloat16(vectorAddReductionFloat16Partial()));
+    }
+
+    // Partial multiply reduction for floating point is disabled on AArch64. This test makes sure that code that performs such partial
+    // multiply reduction operation for FP16 runs without any failures/result mismatch.
+    @Test
+    @Warmup(500)
+    public short vectorMulReductionFloat16Partial() {
+        short result = floatToFloat16(1.0f);
+        for (int i = 0; i < LEN; i+=8) {
+            result = float16ToRawShortBits(multiply(shortBitsToFloat16(result), shortBitsToFloat16(input1[i])));
+            result = float16ToRawShortBits(multiply(shortBitsToFloat16(result), shortBitsToFloat16(input1[i+1])));
+            result = float16ToRawShortBits(multiply(shortBitsToFloat16(result), shortBitsToFloat16(input1[i+2])));
+            result = float16ToRawShortBits(multiply(shortBitsToFloat16(result), shortBitsToFloat16(input1[i+3])));
+        }
+        return result;
+    }
+
+    @Check(test="vectorMulReductionFloat16Partial")
+    public void checkResultMulReductionFloat16Partial() {
+        short expected = floatToFloat16(1.0f);
+        for (int i = 0; i < LEN; i+=8) {
+            expected = floatToFloat16(float16ToFloat(expected) * float16ToFloat(input1[i]));
+            expected = floatToFloat16(float16ToFloat(expected) * float16ToFloat(input1[i+1]));
+            expected = floatToFloat16(float16ToFloat(expected) * float16ToFloat(input1[i+2]));
+            expected = floatToFloat16(float16ToFloat(expected) * float16ToFloat(input1[i+3]));
+        }
+        Verify.checkEQ(shortBitsToFloat16(expected), shortBitsToFloat16(vectorMulReductionFloat16Partial()));
+    }
+
+    // This test case verifies that autovectorization does NOT take place when using Float16.
+    // Filed RFE: JDK-8375321
+    @Test
+    @Warmup(50)
+    @IR(counts = {IRNode.ADD_REDUCTION_VHF, " =0 "},
+        applyIfCPUFeature = {"sve", "true"})
+    @IR(counts = {IRNode.ADD_REDUCTION_VHF, " =0 "},
+        applyIfCPUFeatureAnd = {"fphp", "true", "asimdhp", "true"})
+    public Float16 vectorAddReductionFloat16NotVectorized() {
+        Float16 result = Float16.valueOf(0.0f);
+        for (int i = 0; i < LEN; i++) {
+            result = add(result, input4[i]);
+        }
+        return result;
+    }
+
+    @Check(test="vectorAddReductionFloat16NotVectorized")
+    public void checkResultAddReductionFloat16NotVectorized() {
+        Float16 expected = Float16.valueOf(0.0f);
+        for (int i = 0; i < LEN; ++i) {
+            expected = Float16.valueOf(expected.floatValue() + input4[i].floatValue());
+        }
+        Verify.checkEQ(expected, vectorAddReductionFloat16NotVectorized());
+    }
+
+    @Test
+    @Warmup(50)
+    @IR(counts = {IRNode.MUL_REDUCTION_VHF, " =0 "},
+        applyIfCPUFeatureAnd = {"fphp", "true", "asimdhp", "true"},
+        applyIf = {"MaxVectorSize", "<=16"})
+    public Float16 vectorMulReductionFloat16NotVectorized() {
+        Float16 result = Float16.valueOf(1.0f);
+        for (int i = 0; i < LEN; i++) {
+            result = multiply(result, input4[i]);
+        }
+        return result;
+    }
+
+    @Check(test="vectorMulReductionFloat16NotVectorized")
+    public void checkResultMulReductionFloat16NotVectorized() {
+        Float16 expected = Float16.valueOf(1.0f);
+        for (int i = 0; i < LEN; ++i) {
+            expected = Float16.valueOf(expected.floatValue() * input4[i].floatValue());
+        }
+        Verify.checkEQ(expected, vectorMulReductionFloat16NotVectorized());
+    }
+
+    @Test
+    @Warmup(500)
+    @IR(counts = {"reduce_addFHF_masked", " =0 "}, phase = {CompilePhase.FINAL_CODE},
+        applyIfCPUFeature = {"sve", "true"})
+    public Float16 vectorAddReductionFloat16PartialNotVectorized() {
+        Float16 result = Float16.valueOf(0.0f);
+        for (int i = 0; i < LEN; i += 8) {
+            result = add(result, input4[i]);
+            result = add(result, input4[i + 1]);
+            result = add(result, input4[i + 2]);
+            result = add(result, input4[i + 3]);
+        }
+        return result;
+    }
+
+    @Check(test="vectorAddReductionFloat16PartialNotVectorized")
+    public void checkResultAddReductionFloat16PartialNotVectorized() {
+        Float16 expected = Float16.valueOf(0.0f);
+        for (int i = 0; i < LEN; i += 8) {
+            expected = Float16.valueOf(expected.floatValue() + input4[i].floatValue());
+            expected = Float16.valueOf(expected.floatValue() + input4[i + 1].floatValue());
+            expected = Float16.valueOf(expected.floatValue() + input4[i + 2].floatValue());
+            expected = Float16.valueOf(expected.floatValue() + input4[i + 3].floatValue());
+        }
+        Verify.checkEQ(expected, vectorAddReductionFloat16PartialNotVectorized());
+    }
+
+    @Test
+    @Warmup(500)
+    public Float16 vectorMulReductionFloat16PartialNotVectorized() {
+        Float16 result = Float16.valueOf(1.0f);
+        for (int i = 0; i < LEN; i += 8) {
+            result = multiply(result, input4[i]);
+            result = multiply(result, input4[i + 1]);
+            result = multiply(result, input4[i + 2]);
+            result = multiply(result, input4[i + 3]);
+        }
+        return result;
+    }
+
+    @Check(test="vectorMulReductionFloat16PartialNotVectorized")
+    public void checkResultMulReductionFloat16PartialNotVectorized() {
+        Float16 expected = Float16.valueOf(1.0f);
+        for (int i = 0; i < LEN; i += 8) {
+            expected = Float16.valueOf(expected.floatValue() * input4[i].floatValue());
+            expected = Float16.valueOf(expected.floatValue() * input4[i + 1].floatValue());
+            expected = Float16.valueOf(expected.floatValue() * input4[i + 2].floatValue());
+            expected = Float16.valueOf(expected.floatValue() * input4[i + 3].floatValue());
+        }
+        Verify.checkEQ(expected, vectorMulReductionFloat16PartialNotVectorized());
+    }
+
 }
diff --git a/test/micro/org/openjdk/bench/jdk/incubator/vector/Float16OperationsBenchmark.java b/test/micro/org/openjdk/bench/jdk/incubator/vector/Float16OperationsBenchmark.java
index 92c0b58005f..daf18af528e 100644
--- a/test/micro/org/openjdk/bench/jdk/incubator/vector/Float16OperationsBenchmark.java
+++ b/test/micro/org/openjdk/bench/jdk/incubator/vector/Float16OperationsBenchmark.java
@@ -1,5 +1,6 @@
 /*
  * Copyright (c) 2025, 2026, Oracle and/or its affiliates. All rights reserved.
+ * Copyright 2026 Arm Limited and/or its affiliates.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -350,4 +351,22 @@ public class Float16OperationsBenchmark {
         }
         return distRes;
     }
+
+    @Benchmark
+    public short reductionAddFP16() {
+        short result = (short) 0;
+        for (int i = 0; i < vectorDim; i++) {
+            result = float16ToRawShortBits(add(shortBitsToFloat16(result), shortBitsToFloat16(vector1[i])));
+        }
+        return result;
+    }
+
+    @Benchmark
+    public short reductionMulFP16() {
+        short result = floatToFloat16(1.0f);
+        for (int i = 0; i < vectorDim; i++) {
+            result = float16ToRawShortBits(multiply(shortBitsToFloat16(result), shortBitsToFloat16(vector1[i])));
+        }
+        return result;
+    }
 }
diff --git a/test/micro/org/openjdk/bench/vm/compiler/VectorReduction2.java b/test/micro/org/openjdk/bench/vm/compiler/VectorReduction2.java
index 9241aca1dad..0d11705c8ec 100644
--- a/test/micro/org/openjdk/bench/vm/compiler/VectorReduction2.java
+++ b/test/micro/org/openjdk/bench/vm/compiler/VectorReduction2.java
@@ -1,5 +1,6 @@
 /*
  * Copyright (c) 2024, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright 2026 Arm Limited and/or its affiliates.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -27,6 +28,7 @@ import org.openjdk.jmh.infra.*;
 
 import java.util.concurrent.TimeUnit;
 import java.util.Random;
+import jdk.incubator.vector.Float16;
 
 /**
  * Note: there is a corresponding IR test:
@@ -64,6 +66,9 @@ public abstract class VectorReduction2 {
     private double[] in1D;
     private double[] in2D;
     private double[] in3D;
+    private short[] in1F16;
+    private short[] in2F16;
+    private short[] in3F16;
 
     @Param("0")
     private int seed;
@@ -96,6 +101,9 @@ public abstract class VectorReduction2 {
         in1D = new double[SIZE];
         in2D = new double[SIZE];
         in3D = new double[SIZE];
+        in1F16 = new short[SIZE];
+        in2F16 = new short[SIZE];
+        in3F16 = new short[SIZE];
 
         for (int i = 0; i < SIZE; i++) {
             in1B[i] = (byte)r.nextInt();
@@ -121,6 +129,9 @@ public abstract class VectorReduction2 {
             in1D[i] = r.nextDouble();
             in2D[i] = r.nextDouble();
             in3D[i] = r.nextDouble();
+            in1F16[i] = Float.floatToFloat16(r.nextFloat());
+            in2F16[i] = Float.floatToFloat16(r.nextFloat());
+            in3F16[i] = Float.floatToFloat16(r.nextFloat());
         }
     }
 
@@ -1449,10 +1460,86 @@ public abstract class VectorReduction2 {
         bh.consume(acc);
     }
 
-    @Fork(value = 1, jvmArgs = {"-XX:+UseSuperWord"})
+    // ---------float16***Simple ------------------------------------------------------------
+    @Benchmark
+    public void float16AddSimple(Blackhole bh) {
+        short acc = (short)0; // neutral element
+        for (int i = 0; i < SIZE; i++) {
+            acc = Float16.float16ToRawShortBits(
+                    Float16.add(Float16.shortBitsToFloat16(acc), Float16.shortBitsToFloat16(in1F16[i])));
+        }
+        bh.consume(acc);
+    }
+
+    @Benchmark
+    public void float16MulSimple(Blackhole bh) {
+        short acc = Float.floatToFloat16(1.0f); // neutral element
+        for (int i = 0; i < SIZE; i++) {
+            acc = Float16.float16ToRawShortBits(
+                    Float16.multiply(Float16.shortBitsToFloat16(acc), Float16.shortBitsToFloat16(in1F16[i])));
+        }
+        bh.consume(acc);
+    }
+
+    // ---------float16***DotProduct ------------------------------------------------------------
+    @Benchmark
+    public void float16AddDotProduct(Blackhole bh) {
+        short acc = (short)0; // neutral element
+        for (int i = 0; i < SIZE; i++) {
+            Float16 val = Float16.multiply(Float16.shortBitsToFloat16(in1F16[i]),
+                                           Float16.shortBitsToFloat16(in2F16[i]));
+            acc = Float16.float16ToRawShortBits(
+                    Float16.add(Float16.shortBitsToFloat16(acc), val));
+        }
+        bh.consume(acc);
+    }
+
+    @Benchmark
+    public void float16MulDotProduct(Blackhole bh) {
+        short acc = Float.floatToFloat16(1.0f); // neutral element
+        for (int i = 0; i < SIZE; i++) {
+            Float16 val = Float16.multiply(Float16.shortBitsToFloat16(in1F16[i]),
+                                           Float16.shortBitsToFloat16(in2F16[i]));
+            acc = Float16.float16ToRawShortBits(
+                    Float16.multiply(Float16.shortBitsToFloat16(acc), val));
+        }
+        bh.consume(acc);
+    }
+
+    // ---------float16***Big ------------------------------------------------------------
+    @Benchmark
+    public void float16AddBig(Blackhole bh) {
+        short acc = (short)0; // neutral element
+        for (int i = 0; i < SIZE; i++) {
+            Float16 a = Float16.shortBitsToFloat16(in1F16[i]);
+            Float16 b = Float16.shortBitsToFloat16(in2F16[i]);
+            Float16 c = Float16.shortBitsToFloat16(in3F16[i]);
+            Float16 val = Float16.add(Float16.multiply(a, b),
+                                      Float16.add(Float16.multiply(a, c), Float16.multiply(b, c)));
+            acc = Float16.float16ToRawShortBits(
+                    Float16.add(Float16.shortBitsToFloat16(acc), val));
+        }
+        bh.consume(acc);
+    }
+
+    @Benchmark
+    public void float16MulBig(Blackhole bh) {
+        short acc = Float.floatToFloat16(1.0f); // neutral element
+        for (int i = 0; i < SIZE; i++) {
+            Float16 a = Float16.shortBitsToFloat16(in1F16[i]);
+            Float16 b = Float16.shortBitsToFloat16(in2F16[i]);
+            Float16 c = Float16.shortBitsToFloat16(in3F16[i]);
+            Float16 val = Float16.add(Float16.multiply(a, b),
+                                      Float16.add(Float16.multiply(a, c), Float16.multiply(b, c)));
+            acc = Float16.float16ToRawShortBits(
+                    Float16.multiply(Float16.shortBitsToFloat16(acc), val));
+        }
+        bh.consume(acc);
+    }
+
+    @Fork(value = 1, jvmArgs = {"--add-modules=jdk.incubator.vector", "-XX:+UseSuperWord"})
     public static class WithSuperword extends VectorReduction2 {}
 
-    @Fork(value = 1, jvmArgs = {"-XX:-UseSuperWord"})
+    @Fork(value = 1, jvmArgs = {"--add-modules=jdk.incubator.vector", "-XX:-UseSuperWord"})
     public static class NoSuperword extends VectorReduction2 {}
 }
-

From 0df4bd489de00056736321f1e77389add7a41f83 Mon Sep 17 00:00:00 2001
From: Alexey Ivanov <aivanov@openjdk.org>
Date: Wed, 15 Apr 2026 13:07:24 +0000
Subject: [PATCH 607/655] 8381208: Init cause with the caught runtime exception

Reviewed-by: dmarkov, serb, azvegint
---
 .../classes/sun/print/RasterPrinterJob.java   | 14 +++---
 .../ExceptionFromPrintableIsIgnoredTest.java  | 45 +++++++++++++++----
 2 files changed, 43 insertions(+), 16 deletions(-)

diff --git a/src/java.desktop/share/classes/sun/print/RasterPrinterJob.java b/src/java.desktop/share/classes/sun/print/RasterPrinterJob.java
index 32728efde6c..b28723f94a6 100644
--- a/src/java.desktop/share/classes/sun/print/RasterPrinterJob.java
+++ b/src/java.desktop/share/classes/sun/print/RasterPrinterJob.java
@@ -33,24 +33,23 @@ import java.awt.HeadlessException;
 import java.awt.KeyboardFocusManager;
 import java.awt.Rectangle;
 import java.awt.Shape;
+import java.awt.Window;
 import java.awt.geom.AffineTransform;
 import java.awt.geom.Point2D;
 import java.awt.geom.Rectangle2D;
 import java.awt.image.BufferedImage;
 import java.awt.print.Book;
-import java.awt.print.Pageable;
 import java.awt.print.PageFormat;
+import java.awt.print.Pageable;
 import java.awt.print.Paper;
 import java.awt.print.Printable;
 import java.awt.print.PrinterAbortException;
 import java.awt.print.PrinterException;
 import java.awt.print.PrinterJob;
-import java.awt.Window;
 import java.io.File;
 import java.io.IOException;
 import java.util.ArrayList;
 import java.util.Locale;
-import sun.awt.image.ByteInterleavedRaster;
 
 import javax.print.Doc;
 import javax.print.DocFlavor;
@@ -69,8 +68,8 @@ import javax.print.attribute.ResolutionSyntax;
 import javax.print.attribute.Size2DSyntax;
 import javax.print.attribute.standard.Copies;
 import javax.print.attribute.standard.Destination;
-import javax.print.attribute.standard.DialogTypeSelection;
 import javax.print.attribute.standard.DialogOwner;
+import javax.print.attribute.standard.DialogTypeSelection;
 import javax.print.attribute.standard.Fidelity;
 import javax.print.attribute.standard.JobName;
 import javax.print.attribute.standard.JobSheets;
@@ -81,15 +80,17 @@ import javax.print.attribute.standard.MediaSizeName;
 import javax.print.attribute.standard.OrientationRequested;
 import javax.print.attribute.standard.OutputBin;
 import javax.print.attribute.standard.PageRanges;
+import javax.print.attribute.standard.PrinterIsAcceptingJobs;
 import javax.print.attribute.standard.PrinterResolution;
 import javax.print.attribute.standard.PrinterState;
 import javax.print.attribute.standard.PrinterStateReason;
 import javax.print.attribute.standard.PrinterStateReasons;
-import javax.print.attribute.standard.PrinterIsAcceptingJobs;
 import javax.print.attribute.standard.RequestingUserName;
 import javax.print.attribute.standard.SheetCollate;
 import javax.print.attribute.standard.Sides;
 
+import sun.awt.image.ByteInterleavedRaster;
+
 import static sun.font.FontUtilities.isIgnorableWhitespace;
 
 /**
@@ -1613,8 +1614,7 @@ public abstract class RasterPrinterJob extends PrinterJob {
         } catch (PrinterException pe) {
             throw pe;
         } catch (Throwable printError) {
-            throw (PrinterException)
-                    new PrinterException().initCause(printError.getCause());
+            throw (PrinterException) new PrinterException().initCause(printError);
         } finally {
             // reset previousPaper in case this job is invoked again.
             previousPaper = null;
diff --git a/test/jdk/java/awt/print/PrinterJob/ExceptionFromPrintableIsIgnoredTest.java b/test/jdk/java/awt/print/PrinterJob/ExceptionFromPrintableIsIgnoredTest.java
index 4c2ff370cb8..322c19ed7c2 100644
--- a/test/jdk/java/awt/print/PrinterJob/ExceptionFromPrintableIsIgnoredTest.java
+++ b/test/jdk/java/awt/print/PrinterJob/ExceptionFromPrintableIsIgnoredTest.java
@@ -23,7 +23,7 @@
 
 /*
  * @test
- * @bug 8262731 8268675
+ * @bug 8262731 8268675 8381208
  * @key printer
  * @summary Verify that "PrinterJob.print" throws the expected exception,
  *          if "Printable.print" throws an exception.
@@ -38,7 +38,12 @@ import java.awt.print.PageFormat;
 import java.awt.print.Printable;
 import java.awt.print.PrinterException;
 import java.awt.print.PrinterJob;
+import java.io.File;
 import java.lang.reflect.InvocationTargetException;
+
+import javax.print.attribute.HashPrintRequestAttributeSet;
+import javax.print.attribute.PrintRequestAttributeSet;
+import javax.print.attribute.standard.Destination;
 import javax.swing.SwingUtilities;
 
 public class ExceptionFromPrintableIsIgnoredTest {
@@ -47,7 +52,14 @@ public class ExceptionFromPrintableIsIgnoredTest {
 
     private volatile Throwable printError;
 
+    private volatile PrinterException thrownPE;
+    private volatile RuntimeException thrownRE;
+
     public static void main(String[] args) {
+        if (PrinterJob.lookupPrintServices().length == 0) {
+            throw new RuntimeException("Printer not configured or available.");
+        }
+
         if (args.length < 2) {
             throw new RuntimeException("Two arguments are expected:"
                     + " test thread type and test exception type.");
@@ -58,7 +70,7 @@ public class ExceptionFromPrintableIsIgnoredTest {
             TestExceptionType.valueOf(args[1]));
     }
 
-    public ExceptionFromPrintableIsIgnoredTest(
+    private ExceptionFromPrintableIsIgnoredTest(
             final TestThreadType threadType,
             final TestExceptionType exceptionType) {
         System.out.println(String.format(
@@ -87,15 +99,28 @@ public class ExceptionFromPrintableIsIgnoredTest {
         } else if (!(printError instanceof PrinterException)) {
             throw new RuntimeException("Unexpected exception was thrown.");
         }
+
+        if (exceptionType == TestExceptionType.PE
+                && thrownPE != printError) {
+            throw new RuntimeException(
+                    "Expected the same instance of PrinterException");
+        }
+
+        if (exceptionType == TestExceptionType.RE
+                && thrownRE != printError.getCause()) {
+            throw new RuntimeException(
+                    "Expected the cause of PrinterException to be the thrown exception");
+        }
+
         System.out.println("Test passed.");
     }
 
     private void runTest(final TestExceptionType exceptionType) {
+        PrintRequestAttributeSet attrs = new HashPrintRequestAttributeSet();
+        final File file = new File("out.prn");
+        attrs.add(new Destination(file.toURI()));
+
         PrinterJob job = PrinterJob.getPrinterJob();
-        if (job.getPrintService() == null) {
-            System.out.println("No printers are available.");
-            return;
-        }
 
         job.setPrintable(new Printable() {
             @Override
@@ -105,10 +130,10 @@ public class ExceptionFromPrintableIsIgnoredTest {
                     return NO_SUCH_PAGE;
                 }
                 if (exceptionType == TestExceptionType.PE) {
-                    throw new PrinterException(
+                    throw thrownPE = new PrinterException(
                         "Exception from 'Printable.print'.");
                 } else if (exceptionType == TestExceptionType.RE) {
-                    throw new RuntimeException(
+                    throw thrownRE = new RuntimeException(
                         "Exception from 'Printable.print'.");
                 }
                 return PAGE_EXISTS;
@@ -116,12 +141,14 @@ public class ExceptionFromPrintableIsIgnoredTest {
         });
 
         try {
-            job.print();
+            job.print(attrs);
         } catch (Throwable t) {
             printError = t;
 
             System.out.println("'PrinterJob.print' threw the exception:");
             t.printStackTrace(System.out);
+        } finally {
+            file.delete();
         }
     }
 }

From 152fa85fba4615f036f395b5ae03213b02be56e2 Mon Sep 17 00:00:00 2001
From: Vladimir Kozlov <kvn@openjdk.org>
Date: Wed, 15 Apr 2026 14:12:57 +0000
Subject: [PATCH 608/655] 8382134: Replace assert with fatal check in
 AOTCodeCache::load_strings() to make sure we have valid value in product VM

Reviewed-by: iklam, mhaessig, adinn
---
 src/hotspot/share/code/aotCodeCache.cpp | 5 ++++-
 1 file changed, 4 insertions(+), 1 deletion(-)

diff --git a/src/hotspot/share/code/aotCodeCache.cpp b/src/hotspot/share/code/aotCodeCache.cpp
index a3dd3d2bfd0..c2838917516 100644
--- a/src/hotspot/share/code/aotCodeCache.cpp
+++ b/src/hotspot/share/code/aotCodeCache.cpp
@@ -2201,6 +2201,10 @@ void AOTCodeCache::load_strings() {
   if (strings_count == 0) {
     return;
   }
+  if (strings_count > MAX_STR_COUNT) {
+    fatal("Invalid strings_count loaded from AOT Code Cache: %d > MAX_STR_COUNT [%d]", strings_count, MAX_STR_COUNT);
+    return;
+  }
   uint strings_offset = _load_header->strings_offset();
   uint* string_lengths = (uint*)addr(strings_offset);
   strings_offset += (strings_count * sizeof(uint));
@@ -2211,7 +2215,6 @@ void AOTCodeCache::load_strings() {
   char* p = NEW_C_HEAP_ARRAY(char, strings_size+1, mtCode);
   memcpy(p, addr(strings_offset), strings_size);
   _C_strings_buf = p;
-  assert(strings_count <= MAX_STR_COUNT, "sanity");
   for (uint i = 0; i < strings_count; i++) {
     _C_strings[i] = p;
     uint len = string_lengths[i];

From e82f871871885688d42985c1cfe00ba0dc4c35b3 Mon Sep 17 00:00:00 2001
From: Leonid Mesnik <lmesnik@openjdk.org>
Date: Wed, 15 Apr 2026 14:19:14 +0000
Subject: [PATCH 609/655] 8362350: recompute_enable hit assertion  "should
 never come here before live phase" if happens in post_vm_start

Reviewed-by: cjplummer, sspitsyn
---
 .../share/prims/jvmtiEventController.cpp      |  5 ++
 .../jtreg/ProblemList-jvmti-stress-agent.txt  |  2 -
 .../singlestep02/libsinglestep02.cpp          | 48 ++++++++-----------
 .../SingleStep/singlestep02/singlestep02.java | 18 +------
 4 files changed, 26 insertions(+), 47 deletions(-)

diff --git a/src/hotspot/share/prims/jvmtiEventController.cpp b/src/hotspot/share/prims/jvmtiEventController.cpp
index cb44b833c48..832c8a33c88 100644
--- a/src/hotspot/share/prims/jvmtiEventController.cpp
+++ b/src/hotspot/share/prims/jvmtiEventController.cpp
@@ -544,6 +544,11 @@ JvmtiEventControllerPrivate::recompute_env_thread_enabled(JvmtiEnvThreadState* e
   }
 
   switch (JvmtiEnv::get_phase()) {
+  case JVMTI_PHASE_ONLOAD:
+  case JVMTI_PHASE_PRIMORDIAL:
+  case JVMTI_PHASE_START:
+    now_enabled &= EARLY_EVENT_BITS;
+    break;
   case JVMTI_PHASE_DEAD:
     // no events allowed when dead
     now_enabled = 0;
diff --git a/test/hotspot/jtreg/ProblemList-jvmti-stress-agent.txt b/test/hotspot/jtreg/ProblemList-jvmti-stress-agent.txt
index 1e84a39c30b..d8779a873cd 100644
--- a/test/hotspot/jtreg/ProblemList-jvmti-stress-agent.txt
+++ b/test/hotspot/jtreg/ProblemList-jvmti-stress-agent.txt
@@ -32,8 +32,6 @@ gc/stringdedup/TestStringDeduplicationInterned.java     8362562 generic-all
 gc/stringdedup/TestStringDeduplicationPrintOptions.java 8362562 generic-all
 
 
-serviceability/jvmti/events/SingleStep/singlestep02/singlestep02.java       8362350 generic-all
-vmTestbase/nsk/jvmti/scenarios/events/EM02/em02t007/TestDescription.java    8362350 generic-all
 
 # Incompatbile tests
 
diff --git a/test/hotspot/jtreg/serviceability/jvmti/events/SingleStep/singlestep02/libsinglestep02.cpp b/test/hotspot/jtreg/serviceability/jvmti/events/SingleStep/singlestep02/libsinglestep02.cpp
index 984454dfbaf..b52e3412f4e 100644
--- a/test/hotspot/jtreg/serviceability/jvmti/events/SingleStep/singlestep02/libsinglestep02.cpp
+++ b/test/hotspot/jtreg/serviceability/jvmti/events/SingleStep/singlestep02/libsinglestep02.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -29,11 +29,6 @@
 
 extern "C" {
 
-#define STATUS_FAILED 2
-#define PASSED 0
-
-static volatile jint result = PASSED;
-static volatile long wrongStepEv = 0;
 
 static jvmtiEnv *jvmti = nullptr;
 
@@ -44,31 +39,25 @@ SingleStep(jvmtiEnv *jvmti, JNIEnv *jni, jthread thread, jmethodID method, jloca
   jvmtiError err;
 
   err = jvmti->GetPhase(&phase);
-  if (err != JVMTI_ERROR_NONE) {
-    result = STATUS_FAILED;
-    COMPLAIN("TEST FAILED: unable to obtain phase of the VM execution during SingleStep callback\n\n");
-  } else {
-    if (phase != JVMTI_PHASE_LIVE) {
-      wrongStepEv++;
-      result = STATUS_FAILED;
-      COMPLAIN("TEST FAILED: SingleStep event received during non-live phase %s\n", TranslatePhase(phase));
-    }
+  check_jvmti_status(jni, err, "Error in GetPhase");
+  if (phase != JVMTI_PHASE_LIVE) {
+    COMPLAIN("TEST FAILED: SingleStep event received during non-live phase %s\n", TranslatePhase(phase));
+    jni->FatalError("Event SingleStep event received during non-live phase.");
   }
 }
 
+/*
+ * The ClassLoad event is not used. This is thread filtered event that should
+ * be sent during start phase. It is enabled to trigger creation of jvmti thread state
+ * in the START phase. So test ensures that even jvmti state for thread is created
+ * before live phase the SingleStep event is sent only during live phase.
+ */
 void JNICALL
-VMDeath(jvmtiEnv *jvmti, JNIEnv *jni) {
-  LOG("VMDeath event received\n");
+ClassLoad(jvmtiEnv *jvmti_env,
+            JNIEnv* jni_env,
+            jthread thread,
+            jclass klass) {
 
-  if (wrongStepEv != 0) {
-    LOG("TEST FAILED: there are %ld SingleStep events\n"
-        "sent during non-live phase of the VM execution\n", wrongStepEv);
-    jni->FatalError("Test Failed.");
-  }
-
-  if (result == STATUS_FAILED) {
-    jni->FatalError("Test Failed.");
-  }
 }
 
 jint Agent_Initialize(JavaVM *jvm, char *options, void *reserved) {
@@ -105,19 +94,20 @@ jint Agent_Initialize(JavaVM *jvm, char *options, void *reserved) {
   /* set event callback */
   LOG("setting event callbacks ...\n");
   (void) memset(&callbacks, 0, sizeof(callbacks));
+  callbacks.ClassLoad = &ClassLoad;
   callbacks.SingleStep = &SingleStep;
-  callbacks.VMDeath = &VMDeath;
   err = jvmti->SetEventCallbacks(&callbacks, sizeof(callbacks));
   if (err != JVMTI_ERROR_NONE) {
     return JNI_ERR;
   }
 
   LOG("setting event callbacks done\nenabling JVMTI events ...\n");
-  err = jvmti->SetEventNotificationMode(JVMTI_ENABLE, JVMTI_EVENT_SINGLE_STEP, nullptr);
+
+  err = jvmti->SetEventNotificationMode(JVMTI_ENABLE, JVMTI_EVENT_CLASS_LOAD, nullptr);
   if (err != JVMTI_ERROR_NONE) {
     return JNI_ERR;
   }
-  err = jvmti->SetEventNotificationMode(JVMTI_ENABLE, JVMTI_EVENT_VM_DEATH, nullptr);
+  err = jvmti->SetEventNotificationMode(JVMTI_ENABLE, JVMTI_EVENT_SINGLE_STEP, nullptr);
   if (err != JVMTI_ERROR_NONE) {
     return JNI_ERR;
   }
diff --git a/test/hotspot/jtreg/serviceability/jvmti/events/SingleStep/singlestep02/singlestep02.java b/test/hotspot/jtreg/serviceability/jvmti/events/SingleStep/singlestep02/singlestep02.java
index 8a7b7cf106a..9d25a7bc090 100644
--- a/test/hotspot/jtreg/serviceability/jvmti/events/SingleStep/singlestep02/singlestep02.java
+++ b/test/hotspot/jtreg/serviceability/jvmti/events/SingleStep/singlestep02/singlestep02.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2022, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -21,39 +21,25 @@
  * questions.
  */
 
-import jdk.test.lib.jvmti.DebugeeClass;
 import java.io.*;
 
 /*
  * @test
  *
  * @summary converted from VM Testbase nsk/jvmti/SingleStep/singlestep002.
- * VM Testbase keywords: [jpda, jvmti, onload_only_caps, noras]
- * VM Testbase readme:
- * DESCRIPTION
  *     This test exercises the JVMTI event SingleStep.
- *     It verifies that this event s sent only during the live phase
+ *     It verifies that this event is sent only during the live phase
  *     of VM execution.
  *     The test works as follows. The tested event is enabled in the
  *     'OnLoad' phase. Then all received SingleStep events is checked
  *     to be sent only during the live phase via the GetPhase() call.
- * COMMENTS
  *
- * @library /test/lib
  * @run main/othervm/native -agentlib:singlestep02 singlestep02
  */
 
 public class singlestep02 {
 
-    static {
-        System.loadLibrary("singlestep02");
-    }
-
     public static void main(String[] args) {
-        new singlestep02().runThis(args);
     }
 
-    private int runThis(String argv[]) {
-        return DebugeeClass.TEST_PASSED;
-    }
 }

From a06f3cd469f1343c53ecc9b1dda2c6cbdf5f98f3 Mon Sep 17 00:00:00 2001
From: Quan Anh Mai <qamai@openjdk.org>
Date: Wed, 15 Apr 2026 14:27:25 +0000
Subject: [PATCH 610/655] 8373248: C2: CastPP should not change the type of the
 oop

Reviewed-by: bmaillard, dfenacci, rcastanedalo, mchevalier
---
 src/hotspot/share/opto/castnode.cpp     | 42 +++++++++++++++++++++++++
 src/hotspot/share/opto/castnode.hpp     | 11 +++++--
 src/hotspot/share/opto/library_call.cpp |  2 +-
 src/hotspot/share/opto/node.hpp         |  1 +
 src/hotspot/share/opto/vector.cpp       | 14 ++++-----
 5 files changed, 58 insertions(+), 12 deletions(-)

diff --git a/src/hotspot/share/opto/castnode.cpp b/src/hotspot/share/opto/castnode.cpp
index 54269a56c19..7bb6b1dcb77 100644
--- a/src/hotspot/share/opto/castnode.cpp
+++ b/src/hotspot/share/opto/castnode.cpp
@@ -413,6 +413,43 @@ Node* CastLLNode::Ideal(PhaseGVN* phase, bool can_reshape) {
   return nullptr;
 }
 
+// CastPPNodes are removed before matching, while alias classes are needed in global code motion.
+// As a result, it is not valid for a CastPPNode to change the oop such that the derived pointers
+// lie in different alias classes with and without the node. For example, a CastPPNode c may not
+// cast an Object to a Bottom[], because later removal of c would affect the alias class of c's
+// array length field (c + arrayOopDesc::length_offset_in_bytes()).
+//
+// This function verifies that a CastPPNode on an oop does not violate the aforementioned property.
+//
+// TODO 8382147: Currently, this verification only applies during the construction of a CastPPNode,
+// we may want to apply the same verification during IGVN transformations, as well as final graph
+// reshaping.
+void CastPPNode::verify_type(const Type* in_type, const Type* out_type) {
+#ifdef ASSERT
+  out_type = out_type->join(in_type);
+  if (in_type->empty() || out_type->empty()) {
+    return;
+  }
+  if (in_type == TypePtr::NULL_PTR || out_type == TypePtr::NULL_PTR) {
+    return;
+  }
+  if (!in_type->isa_oopptr() && !out_type->isa_oopptr()) {
+    return;
+  }
+
+  assert(in_type->isa_oopptr() && out_type->isa_oopptr(), "must be both oops or both non-oops");
+  if (in_type->isa_aryptr() && out_type->isa_aryptr()) {
+    const Type* e1 = in_type->is_aryptr()->elem();
+    const Type* e2 = out_type->is_aryptr()->elem();
+    assert(e1->basic_type() == e2->basic_type(), "must both be arrays of the same primitive type or both be oops arrays");
+    return;
+  }
+
+  assert(in_type->isa_instptr() && out_type->isa_instptr(), "must be both array oops or both non-array oops");
+  assert(in_type->is_instptr()->instance_klass() == out_type->is_instptr()->instance_klass(), "must not cast to a different type");
+#endif // ASSERT
+}
+
 //------------------------------Value------------------------------------------
 // Take 'join' of input and cast-up type, unless working with an Interface
 const Type* CheckCastPPNode::Value(PhaseGVN* phase) const {
@@ -440,6 +477,11 @@ const Type* CheckCastPPNode::Value(PhaseGVN* phase) const {
   return result;
 }
 
+Node* CheckCastPPNode::pin_node_under_control_impl() const {
+  assert(_dependency.is_floating(), "already pinned");
+  return new CheckCastPPNode(in(0), in(1), bottom_type(), _dependency.with_pinned_dependency(), _extra_types);
+}
+
 //=============================================================================
 //------------------------------Value------------------------------------------
 const Type* CastX2PNode::Value(PhaseGVN* phase) const {
diff --git a/src/hotspot/share/opto/castnode.hpp b/src/hotspot/share/opto/castnode.hpp
index 38545fd6f41..dce54eb73c0 100644
--- a/src/hotspot/share/opto/castnode.hpp
+++ b/src/hotspot/share/opto/castnode.hpp
@@ -303,14 +303,18 @@ public:
 
 //------------------------------CastPPNode-------------------------------------
 // cast pointer to pointer (different type)
-class CastPPNode: public ConstraintCastNode {
-  public:
-  CastPPNode (Node* ctrl, Node* n, const Type* t, const DependencyType& dependency = DependencyType::FloatingNarrowing, const TypeTuple* types = nullptr)
+class CastPPNode : public ConstraintCastNode {
+public:
+  CastPPNode(Node* ctrl, Node* n, const Type* t, const DependencyType& dependency = DependencyType::FloatingNarrowing, const TypeTuple* types = nullptr)
     : ConstraintCastNode(ctrl, n, t, dependency, types) {
     init_class_id(Class_CastPP);
+    verify_type(n->bottom_type(), t);
   }
   virtual int Opcode() const;
   virtual uint ideal_reg() const { return Op_RegP; }
+
+private:
+  static void verify_type(const Type* in_type, const Type* out_type);
 };
 
 //------------------------------CheckCastPPNode--------------------------------
@@ -329,6 +333,7 @@ class CheckCastPPNode: public ConstraintCastNode {
 
 private:
   virtual bool depends_only_on_test_impl() const { return !type()->isa_rawptr() && ConstraintCastNode::depends_only_on_test_impl(); }
+  virtual Node* pin_node_under_control_impl() const;
 };
 
 
diff --git a/src/hotspot/share/opto/library_call.cpp b/src/hotspot/share/opto/library_call.cpp
index 26417436ed9..ff7bc2c10d3 100644
--- a/src/hotspot/share/opto/library_call.cpp
+++ b/src/hotspot/share/opto/library_call.cpp
@@ -4311,7 +4311,7 @@ Node* LibraryCallKit::generate_array_guard_common(Node* kls, RegionNode* region,
   if (obj != nullptr && is_array_ctrl != nullptr && is_array_ctrl != top()) {
     // Keep track of the fact that 'obj' is an array to prevent
     // array specific accesses from floating above the guard.
-    *obj = _gvn.transform(new CastPPNode(is_array_ctrl, *obj, TypeAryPtr::BOTTOM));
+    *obj = _gvn.transform(new CheckCastPPNode(is_array_ctrl, *obj, TypeAryPtr::BOTTOM));
   }
   return ctrl;
 }
diff --git a/src/hotspot/share/opto/node.hpp b/src/hotspot/share/opto/node.hpp
index 36855d659ba..8c6622e643e 100644
--- a/src/hotspot/share/opto/node.hpp
+++ b/src/hotspot/share/opto/node.hpp
@@ -1186,6 +1186,7 @@ public:
       return nullptr;
     }
     assert(!res->depends_only_on_test(), "the result must not depends_only_on_test");
+    assert(Opcode() == res->Opcode(), "pinning must result in the same kind of node %s - %s", Name(), res->Name());
     return res;
   }
 
diff --git a/src/hotspot/share/opto/vector.cpp b/src/hotspot/share/opto/vector.cpp
index f44df7e6da2..d35717c5922 100644
--- a/src/hotspot/share/opto/vector.cpp
+++ b/src/hotspot/share/opto/vector.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2020, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -455,14 +455,12 @@ void PhaseVector::expand_vunbox_node(VectorUnboxNode* vec_unbox) {
       gvn.record_for_igvn(local_mem);
       BarrierSetC2* bs = BarrierSet::barrier_set()->barrier_set_c2();
       C2OptAccess access(gvn, ctrl, local_mem, decorators, T_OBJECT, obj, addr);
-      const Type* type = TypeOopPtr::make_from_klass(field->type()->as_klass());
-      vec_field_ld = bs->load_at(access, type);
-    }
 
-    // For proper aliasing, attach concrete payload type.
-    ciKlass* payload_klass = ciTypeArrayKlass::make(bt);
-    const Type* payload_type = TypeAryPtr::make_from_klass(payload_klass)->cast_to_ptr_type(TypePtr::NotNull);
-    vec_field_ld = gvn.transform(new CastPPNode(nullptr, vec_field_ld, payload_type));
+      // For proper aliasing, attach concrete payload type.
+      ciKlass* payload_klass = ciTypeArrayKlass::make(bt);
+      const Type* payload_type = TypeAryPtr::make_from_klass(payload_klass)->cast_to_ptr_type(TypePtr::NotNull);
+      vec_field_ld = bs->load_at(access, payload_type);
+    }
 
     Node* adr = kit.array_element_address(vec_field_ld, gvn.intcon(0), bt);
     const TypePtr* adr_type = adr->bottom_type()->is_ptr();

From 974596775b2b1fe048ec7de0e35dc6f8283d844a Mon Sep 17 00:00:00 2001
From: Ashutosh Mehra <asmehra@openjdk.org>
Date: Wed, 15 Apr 2026 14:30:30 +0000
Subject: [PATCH 611/655] 8381968: Extend cds/appcds/aotCode/AOTCodeFlags.java
 to run test with different flags in assembly and prod run

Reviewed-by: kvn, adinn
---
 test/hotspot/jtreg/TEST.groups                |   3 +-
 .../AOTCodeCPUFeatureIncompatibilityTest.java |  12 +-
 .../aotCode/AOTCodeCompressedOopsTest.java    |  12 +-
 .../cds/appcds/aotCode/AOTCodeFlags.java      | 137 ++++++------
 .../cds/appcds/aotCode/AOTCodeTest.java       | 196 ++++++++++++++++++
 test/setup_aot/HelloWorld.java                |  29 +++
 6 files changed, 310 insertions(+), 79 deletions(-)
 create mode 100644 test/hotspot/jtreg/runtime/cds/appcds/aotCode/AOTCodeTest.java
 create mode 100644 test/setup_aot/HelloWorld.java

diff --git a/test/hotspot/jtreg/TEST.groups b/test/hotspot/jtreg/TEST.groups
index 6e9421e5c09..6623676d2ba 100644
--- a/test/hotspot/jtreg/TEST.groups
+++ b/test/hotspot/jtreg/TEST.groups
@@ -587,7 +587,8 @@ hotspot_metaspace = \
 tier1_runtime_appcds = \
   runtime/cds/appcds/aotCache/HelloAOTCache.java \
   runtime/cds/appcds/aotCode \
-  runtime/cds/appcds/HelloTest.java
+  runtime/cds/appcds/HelloTest.java \
+  -runtime/cds/appcds/aotCode/AOTCodeFlags.java
 
 tier1_runtime_appcds_exclude = \
   runtime/cds/appcds/ \
diff --git a/test/hotspot/jtreg/runtime/cds/appcds/aotCode/AOTCodeCPUFeatureIncompatibilityTest.java b/test/hotspot/jtreg/runtime/cds/appcds/aotCode/AOTCodeCPUFeatureIncompatibilityTest.java
index e9e610330ad..aa7becdb6f8 100644
--- a/test/hotspot/jtreg/runtime/cds/appcds/aotCode/AOTCodeCPUFeatureIncompatibilityTest.java
+++ b/test/hotspot/jtreg/runtime/cds/appcds/aotCode/AOTCodeCPUFeatureIncompatibilityTest.java
@@ -31,13 +31,9 @@
  * @comment The test verifies AOT checks during VM startup and not code generation.
  *          No need to run it with -Xcomp.
  * @library /test/lib /test/setup_aot
- * @build AOTCodeCPUFeatureIncompatibilityTest JavacBenchApp
+ * @build AOTCodeCPUFeatureIncompatibilityTest HelloWorld
  * @run driver jdk.test.lib.helpers.ClassFileInstaller jdk.test.whitebox.WhiteBox
- * @run driver jdk.test.lib.helpers.ClassFileInstaller -jar app.jar
- *             JavacBenchApp
- *             JavacBenchApp$ClassFile
- *             JavacBenchApp$FileManager
- *             JavacBenchApp$SourceFile
+ * @run driver jdk.test.lib.helpers.ClassFileInstaller -jar app.jar HelloWorld
  * @run main/othervm -Xbootclasspath/a:. -XX:+UnlockDiagnosticVMOptions -XX:+WhiteBoxAPI AOTCodeCPUFeatureIncompatibilityTest
  */
 
@@ -98,9 +94,7 @@ public class AOTCodeCPUFeatureIncompatibilityTest {
             }
             @Override
             public String[] appCommandLine(RunMode runMode) {
-                return new String[] {
-                    "JavacBenchApp", "10"
-                };
+                return new String[] { "HelloWorld" };
             }
         }.runAOTWorkflow("--two-step-training");
     }
diff --git a/test/hotspot/jtreg/runtime/cds/appcds/aotCode/AOTCodeCompressedOopsTest.java b/test/hotspot/jtreg/runtime/cds/appcds/aotCode/AOTCodeCompressedOopsTest.java
index 3b9458c14da..0fe11235749 100644
--- a/test/hotspot/jtreg/runtime/cds/appcds/aotCode/AOTCodeCompressedOopsTest.java
+++ b/test/hotspot/jtreg/runtime/cds/appcds/aotCode/AOTCodeCompressedOopsTest.java
@@ -33,12 +33,8 @@
  *          No need to run it with -Xcomp. It takes a lot of time to complete all
  *          subtests with this flag.
  * @library /test/lib /test/setup_aot
- * @build AOTCodeCompressedOopsTest JavacBenchApp
- * @run driver/timeout=480 jdk.test.lib.helpers.ClassFileInstaller -jar app.jar
- *             JavacBenchApp
- *             JavacBenchApp$ClassFile
- *             JavacBenchApp$FileManager
- *             JavacBenchApp$SourceFile
+ * @build AOTCodeCompressedOopsTest HelloWorld
+ * @run driver/timeout=480 jdk.test.lib.helpers.ClassFileInstaller -jar app.jar HelloWorld
  * @run driver/timeout=480 AOTCodeCompressedOopsTest
  */
 
@@ -149,9 +145,7 @@ public class AOTCodeCompressedOopsTest {
 
         @Override
         public String[] appCommandLine(RunMode runMode) {
-            return new String[] {
-                "JavacBenchApp", "10"
-            };
+            return new String[] { "HelloWorld" };
         }
 
         @Override
diff --git a/test/hotspot/jtreg/runtime/cds/appcds/aotCode/AOTCodeFlags.java b/test/hotspot/jtreg/runtime/cds/appcds/aotCode/AOTCodeFlags.java
index d3c6a23efa0..01b64a7fff0 100644
--- a/test/hotspot/jtreg/runtime/cds/appcds/aotCode/AOTCodeFlags.java
+++ b/test/hotspot/jtreg/runtime/cds/appcds/aotCode/AOTCodeFlags.java
@@ -109,39 +109,44 @@ public class AOTCodeFlags {
     private static String gcName = null;
     public static void main(String... args) throws Exception {
         Tester t = new Tester(args.length == 0 ? null : args[0]);
-        // Run only 2 modes (0 - no AOT code, 1 - AOT adapters) until JDK-8357398 is fixed
-        for (int mode = 0; mode < 4; mode++) {
-            t.setTestMode(mode);
-            t.run(new String[] {"AOT", "--two-step-training"});
+        // mode bits 0 and 1 encode AOTAdapterCaching and AOTStubCaching settings
+        // aMode is used for assembly run, pMode for production run
+        for (int aMode = 0; aMode < 4; aMode++) {
+            for (int pMode = 0; pMode < 4; pMode++) {
+                t.setTestMode(aMode, pMode);
+                t.run(new String[] {"AOT", "--two-step-training"});
+            }
         }
     }
     static class Tester extends CDSAppTester {
-        private int testMode;
+        private int aMode, pMode;
         private String gcName;
 
         public Tester(String name) {
             super("AOTCodeFlags");
-            testMode = 0;
+            aMode = 0;
+            pMode = 0;
             gcName = name;
         }
 
-        boolean isAdapterCachingOn() {
-            return (testMode & 0x1) != 0;
+        boolean isAdapterCachingOn(int mode) {
+            return (mode & 0x1) != 0;
         }
 
-        boolean isStubCachingOn() {
-            return (testMode & 0x2) != 0;
+        boolean isStubCachingOn(int mode) {
+            return (mode & 0x2) != 0;
         }
 
-        public void setTestMode(int mode) {
-            testMode = mode;
+        public void setTestMode(int aMode, int pMode) {
+            this.aMode = aMode;
+            this.pMode = pMode;
         }
 
-        public List<String> getVMArgsForTestMode() {
+        public List<String> getVMArgsForTestMode(int mode) {
             List<String> list = new ArrayList<String>();
             list.add("-XX:+UnlockDiagnosticVMOptions");
-            list.add(isAdapterCachingOn() ? "-XX:+AOTAdapterCaching" : "-XX:-AOTAdapterCaching");
-            list.add(isStubCachingOn() ? "-XX:+AOTStubCaching" : "-XX:-AOTStubCaching");
+            list.add(isAdapterCachingOn(mode) ? "-XX:+AOTAdapterCaching" : "-XX:-AOTAdapterCaching");
+            list.add(isStubCachingOn(mode) ? "-XX:+AOTStubCaching" : "-XX:-AOTStubCaching");
             return list;
         }
 
@@ -170,79 +175,91 @@ public class AOTCodeFlags {
 
         @Override
         public String[] vmArgs(RunMode runMode) {
+            List<String> args = getGCArgs();
+            args.addAll(List.of("-Xlog:aot+codecache+init=debug",
+                                "-Xlog:aot+codecache+exit=debug",
+                                "-Xlog:aot+codecache+stubs=debug"));
             switch (runMode) {
             case RunMode.ASSEMBLY:
-            case RunMode.PRODUCTION: {
-                    List<String> args = getVMArgsForTestMode();
-                    args.addAll(List.of("-Xlog:aot+codecache+init=debug",
-                                        "-Xlog:aot+codecache+exit=debug"));
-                    args.addAll(getGCArgs());
-                    return args.toArray(new String[0]);
-                }
+                args.addAll(getVMArgsForTestMode(aMode));
+                break;
+            case RunMode.PRODUCTION:
+                args.addAll(getVMArgsForTestMode(pMode));
+                break;
+            default:
+                break;
             }
-            List<String> args = getGCArgs();
             return args.toArray(new String[args.size()]);
         }
 
         @Override
         public String[] appCommandLine(RunMode runMode) {
-            return new String[] {
-                "JavacBenchApp", "10"
-            };
+            return new String[] { "JavacBenchApp", "10" };
         }
 
         @Override
         public void checkExecution(OutputAnalyzer out, RunMode runMode) throws Exception {
-            if (!isAdapterCachingOn() && !isStubCachingOn()) { // this is equivalent to completely disable AOT code cache
-                switch (runMode) {
-                case RunMode.ASSEMBLY:
-                case RunMode.PRODUCTION:
+            if (runMode == RunMode.ASSEMBLY) {
+                if (!isAdapterCachingOn(aMode) && !isStubCachingOn(aMode)) { // this is equivalent to completely disable AOT code cache
                     out.shouldNotMatch("Adapters:\\s+total");
                     out.shouldNotMatch("Shared Blobs:\\s+total");
                     out.shouldNotMatch("C1 Blobs:\\s+total");
                     out.shouldNotMatch("C2 Blobs:\\s+total");
-                    break;
-                }
-            } else {
-                if (isAdapterCachingOn()) {
-                    switch (runMode) {
-                    case RunMode.ASSEMBLY:
-                    case RunMode.PRODUCTION:
-                        // AOTAdapterCaching is on, non-zero adapters should be stored/loaded
-                        out.shouldMatch("Adapters:\\s+total=[1-9][0-9]+");
-                        break;
-                    }
                 } else {
-                    switch (runMode) {
-                    case RunMode.ASSEMBLY:
-                    case RunMode.PRODUCTION:
-                        // AOTAdapterCaching is off, no adapters should be stored/loaded
+                    if (isAdapterCachingOn(aMode)) {
+                        // AOTAdapterCaching is on, non-zero adapters should be stored
+                        out.shouldMatch("Adapters:\\s+total=[1-9][0-9]+");
+                    } else {
+                        // AOTAdapterCaching is off, no adapters should be stored
                         out.shouldMatch("Adapters:\\s+total=0");
-                        break;
                     }
-                }
-                if (isStubCachingOn()) {
-                    switch (runMode) {
-                    case RunMode.ASSEMBLY:
-                    case RunMode.PRODUCTION:
-                        // AOTStubCaching is on, non-zero stubs should be stored/loaded
+                    if (isStubCachingOn(aMode)) {
+                        // AOTStubCaching is on, non-zero stubs should be stored
                         out.shouldMatch("Shared Blobs:\\s+total=[1-9][0-9]+");
                         out.shouldMatch("C1 Blobs:\\s+total=[1-9][0-9]+");
                         // we do not currently load or store C2 stubs
                         // because we are seeing weird memory errors
                         // when loading them -- see JDK-8357593
                         out.shouldMatch("C2 Blobs:\\s+total=0");
-                        break;
-                    }
-                } else {
-                    switch (runMode) {
-                    case RunMode.ASSEMBLY:
-                    case RunMode.PRODUCTION:
-                        // AOTStubCaching is off, no stubs should be stored/loaded
+                    } else {
+                        // AOTStubCaching is off, no stubs should be stored
                         out.shouldMatch("Shared Blobs:\\s+total=0");
                         out.shouldMatch("C1 Blobs:\\s+total=0");
                         out.shouldMatch("C2 Blobs:\\s+total=0");
-                        break;
+                    }
+                }
+            } else if (runMode == RunMode.PRODUCTION) {
+                // Irrespective of assembly run mode, if both adapter and stub caching is disabled
+                // in production run, then it is equivalent to completely disabling AOT code cache
+                if (!isAdapterCachingOn(pMode) && !isStubCachingOn(pMode)) {
+                    out.shouldNotMatch("Adapters:\\s+total");
+                    out.shouldNotMatch("Shared Blobs:\\s+total");
+                    out.shouldNotMatch("C1 Blobs:\\s+total");
+                    out.shouldNotMatch("C2 Blobs:\\s+total");
+                } else {
+                    // If AOT code cache is effectively disabled in the assembly run, then production run
+                    // would emit empty code cache message.
+                    if (!isAdapterCachingOn(aMode) && !isStubCachingOn(aMode)) {
+                        if (isAdapterCachingOn(pMode) || isStubCachingOn(pMode)) {
+                            out.shouldMatch("AOT Code Cache is empty");
+                        }
+                    } else {
+                        if (isAdapterCachingOn(aMode)) {
+                            if (isAdapterCachingOn(pMode)) {
+                                out.shouldMatch("Read blob.*kind=Adapter.*");
+                            } else {
+                                out.shouldNotMatch("Read blob.*kind=Adapter.*");
+                            }
+                        }
+                        if (isStubCachingOn(aMode)) {
+                            if (isStubCachingOn(pMode)) {
+                                out.shouldMatch("Read blob.*kind=SharedBlob.*");
+                                out.shouldMatch("Read blob.*kind=C1Blob.*");
+                            } else {
+                                out.shouldNotMatch("Read blob.*kind=SharedBlob.*");
+                                out.shouldNotMatch("Read blob.*kind=C1Blob.*");
+                            }
+                        }
                     }
                 }
             }
diff --git a/test/hotspot/jtreg/runtime/cds/appcds/aotCode/AOTCodeTest.java b/test/hotspot/jtreg/runtime/cds/appcds/aotCode/AOTCodeTest.java
new file mode 100644
index 00000000000..2afcd802fc5
--- /dev/null
+++ b/test/hotspot/jtreg/runtime/cds/appcds/aotCode/AOTCodeTest.java
@@ -0,0 +1,196 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ *
+ */
+
+/**
+ * @test id=g1
+ * @requires vm.gc.G1
+ * @summary Sanity test of AOTCodeCache
+ * @requires vm.cds.supports.aot.code.caching
+ * @requires vm.compiler1.enabled & vm.compiler2.enabled
+ * @comment Both C1 and C2 JIT compilers are required because the test verifies
+ *          compiler's runtime blobs generation.
+ * @requires vm.opt.VerifyOops == null | vm.opt.VerifyOops == false
+ * @comment VerifyOops flag switch off AOT code generation. Skip it.
+ * @library /test/lib /test/setup_aot
+ * @build AOTCodeTest JavacBenchApp
+ * @run driver jdk.test.lib.helpers.ClassFileInstaller -jar app.jar
+ *                 JavacBenchApp
+ *                 JavacBenchApp$ClassFile
+ *                 JavacBenchApp$FileManager
+ *                 JavacBenchApp$SourceFile
+ * @run driver/timeout=1500 AOTCodeTest G1
+ */
+/**
+ * @test id=parallel
+ * @requires vm.gc.Parallel
+ * @summary Sanity test of AOTCodeCache
+ * @requires vm.cds.supports.aot.code.caching
+ * @requires vm.compiler1.enabled & vm.compiler2.enabled
+ * @comment Both C1 and C2 JIT compilers are required because the test verifies
+ *          compiler's runtime blobs generation.
+ * @requires vm.opt.VerifyOops == null | vm.opt.VerifyOops == false
+ * @comment VerifyOops flag switch off AOT code generation. Skip it.
+ * @library /test/lib /test/setup_aot
+ * @build AOTCodeTest JavacBenchApp
+ * @run driver jdk.test.lib.helpers.ClassFileInstaller -jar app.jar
+ *                 JavacBenchApp
+ *                 JavacBenchApp$ClassFile
+ *                 JavacBenchApp$FileManager
+ *                 JavacBenchApp$SourceFile
+ * @run driver/timeout=1500 AOTCodeTest Parallel
+ */
+/**
+ * @test id=serial
+ * @requires vm.gc.Serial
+ * @summary Sanity test of AOTCodeCache
+ * @requires vm.cds.supports.aot.code.caching
+ * @requires vm.compiler1.enabled & vm.compiler2.enabled
+ * @comment Both C1 and C2 JIT compilers are required because the test verifies
+ *          compiler's runtime blobs generation.
+ * @requires vm.opt.VerifyOops == null | vm.opt.VerifyOops == false
+ * @comment VerifyOops flag switch off AOT code generation. Skip it.
+ * @library /test/lib /test/setup_aot
+ * @build AOTCodeTest JavacBenchApp
+ * @run driver jdk.test.lib.helpers.ClassFileInstaller -jar app.jar
+ *                 JavacBenchApp
+ *                 JavacBenchApp$ClassFile
+ *                 JavacBenchApp$FileManager
+ *                 JavacBenchApp$SourceFile
+ * @run driver/timeout=1500 AOTCodeTest Serial
+ */
+/**
+ * @test id=shenandoah
+ * @requires vm.gc.Shenandoah
+ * @summary Sanity test of AOTCodeCache
+ * @requires vm.cds.supports.aot.code.caching
+ * @requires vm.compiler1.enabled & vm.compiler2.enabled
+ * @comment Both C1 and C2 JIT compilers are required because the test verifies
+ *          compiler's runtime blobs generation.
+ * @requires vm.opt.VerifyOops == null | vm.opt.VerifyOops == false
+ * @comment VerifyOops flag switch off AOT code generation. Skip it.
+ * @library /test/lib /test/setup_aot
+ * @build AOTCodeTest JavacBenchApp
+ * @run driver jdk.test.lib.helpers.ClassFileInstaller -jar app.jar
+ *                 JavacBenchApp
+ *                 JavacBenchApp$ClassFile
+ *                 JavacBenchApp$FileManager
+ *                 JavacBenchApp$SourceFile
+ * @run driver/timeout=1500 AOTCodeTest Shenandoah
+ */
+/**
+ * @test id=Z
+ * @requires vm.gc.Z
+ * @summary Sanity test of AOTCodeCache
+ * @requires vm.cds.supports.aot.code.caching
+ * @requires vm.compiler1.enabled & vm.compiler2.enabled
+ * @comment Both C1 and C2 JIT compilers are required because the test verifies
+ *          compiler's runtime blobs generation.
+ * @requires vm.opt.VerifyOops == null | vm.opt.VerifyOops == false
+ * @comment VerifyOops flag switch off AOT code generation. Skip it.
+ * @library /test/lib /test/setup_aot
+ * @build AOTCodeTest JavacBenchApp
+ * @run driver jdk.test.lib.helpers.ClassFileInstaller -jar app.jar
+ *                 JavacBenchApp
+ *                 JavacBenchApp$ClassFile
+ *                 JavacBenchApp$FileManager
+ *                 JavacBenchApp$SourceFile
+ * @run driver/timeout=1500 AOTCodeTest Z
+ */
+
+import java.util.ArrayList;
+import java.util.List;
+
+import jdk.test.lib.cds.CDSAppTester;
+import jdk.test.lib.process.OutputAnalyzer;
+
+public class AOTCodeTest {
+    private static String gcName = null;
+    public static void main(String... args) throws Exception {
+        if (args.length == 0) {
+            throw new RuntimeException("Expected GC name");
+        }
+        Tester t = new Tester(args[0]);
+        t.run(new String[] {"AOT", "--two-step-training"});
+    }
+
+    static class Tester extends CDSAppTester {
+        private String gcName;
+
+        public Tester(String name) {
+            super("AOTCodeTest");
+            gcName = name;
+        }
+
+        public List<String> getGCArgs() {
+            List<String> args = new ArrayList<String>();
+            args.add("-Xmx100M");
+            switch (gcName) {
+            case "G1":
+            case "Parallel":
+            case "Serial":
+            case "Shenandoah":
+            case "Z":
+                args.add("-XX:+Use" + gcName + "GC");
+            return args;
+            default:
+                throw new RuntimeException("Unexpected GC name " + gcName);
+            }
+        }
+
+        @Override
+        public String classpath(RunMode runMode) {
+            return "app.jar";
+        }
+
+        @Override
+        public String[] vmArgs(RunMode runMode) {
+            List<String> args = getGCArgs();
+            // Add flags for logs
+            args.addAll(List.of("-Xlog:aot+codecache+init=debug",
+                                "-Xlog:aot+codecache+exit=debug",
+                                "-Xlog:aot+codecache+stubs=debug"));
+            // Add diagnostic flags
+            args.addAll(List.of("-XX:+UnlockDiagnosticVMOptions",
+                                "-XX:+AbortVMOnAOTCodeFailure"));
+            return args.toArray(new String[args.size()]);
+        }
+
+        @Override
+        public String[] appCommandLine(RunMode runMode) {
+            return new String[] { "JavacBenchApp", "10" };
+        }
+
+        @Override
+        public void checkExecution(OutputAnalyzer out, RunMode runMode) throws Exception {
+            if (runMode == RunMode.ASSEMBLY) {
+                out.shouldMatch("aot,codecache,exit.*\\s+AOT code cache size: [1-9]\\d+ bytes");
+            } else if (runMode == RunMode.PRODUCTION) {
+                out.shouldMatch("aot,codecache,init.*\\s+Loaded [1-9]\\d+ AOT code entries from AOT Code Cache");
+                out.shouldMatch("aot,codecache,stubs.*\\s+Read blob.*kind=Adapter.*");
+                out.shouldMatch("aot,codecache,stubs.*\\s+Read blob.*kind=SharedBlob.*");
+                out.shouldMatch("aot,codecache,stubs.*\\s+Read blob.*kind=C1Blob.*");
+            }
+        }
+    }
+}
diff --git a/test/setup_aot/HelloWorld.java b/test/setup_aot/HelloWorld.java
new file mode 100644
index 00000000000..e243dfb4e8e
--- /dev/null
+++ b/test/setup_aot/HelloWorld.java
@@ -0,0 +1,29 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ *
+ */
+
+public class HelloWorld {
+    public static void main(String args[]) {
+        System.out.println("HelloWorld");
+    }
+}

From 21213024501cb3f19b2c42bd56f5553807dace9b Mon Sep 17 00:00:00 2001
From: Leo Korinth <lkorinth@openjdk.org>
Date: Wed, 15 Apr 2026 14:50:24 +0000
Subject: [PATCH 612/655] 8380164: Fix implicit conversion in
 nativeInst_aarch64.hpp

Co-authored-by: Andrew Haley <aph@openjdk.org>
Reviewed-by: aph, aseoane
---
 src/hotspot/cpu/aarch64/nativeInst_aarch64.hpp | 12 +++++-------
 1 file changed, 5 insertions(+), 7 deletions(-)

diff --git a/src/hotspot/cpu/aarch64/nativeInst_aarch64.hpp b/src/hotspot/cpu/aarch64/nativeInst_aarch64.hpp
index fc7274714ad..ab9896fa426 100644
--- a/src/hotspot/cpu/aarch64/nativeInst_aarch64.hpp
+++ b/src/hotspot/cpu/aarch64/nativeInst_aarch64.hpp
@@ -97,7 +97,7 @@ protected:
 #define MACOS_WX_WRITE MACOS_AARCH64_ONLY(os::thread_wx_enable_write())
   void set_char_at(int offset, char c)     { MACOS_WX_WRITE;  *addr_at(offset) = (u_char)c; }
   void set_int_at(int offset, jint i)      { MACOS_WX_WRITE;  *(jint*)addr_at(offset) = i; }
-  void set_uint_at(int offset, jint i)     { MACOS_WX_WRITE;  *(juint*)addr_at(offset) = i; }
+  void set_uint_at(int offset, juint i)    { MACOS_WX_WRITE;  *(juint*)addr_at(offset) = i; }
   void set_ptr_at(int offset, address ptr) { MACOS_WX_WRITE;  *(address*)addr_at(offset) = ptr; }
   void set_oop_at(int offset, oop o)       { MACOS_WX_WRITE;  *(oop*)addr_at(offset) = o; }
 #undef MACOS_WX_WRITE
@@ -178,13 +178,11 @@ public:
   address destination() const;
 
   void set_destination(address dest) {
-    int offset = dest - instruction_address();
-    unsigned int insn = 0b100101 << 26;
+    int64_t offset = dest - instruction_address();
+    juint insn = 0b100101u << 26u;
     assert((offset & 3) == 0, "should be");
-    offset >>= 2;
-    offset &= (1 << 26) - 1; // mask off insn part
-    insn |= offset;
-    set_int_at(displacement_offset, insn);
+    Instruction_aarch64::spatch(reinterpret_cast<address>(&insn), 25, 0, offset >> 2);
+    set_uint_at(displacement_offset, insn);
   }
 
   void verify_alignment() { ; }

From 29434cc6512819a0b0e7f831fee8623995cbc5bc Mon Sep 17 00:00:00 2001
From: Vladimir Ivanov <vlivanov@openjdk.org>
Date: Wed, 15 Apr 2026 16:37:37 +0000
Subject: [PATCH 613/655] 8376421: C2: Missing branch on SubTypeCheck node

Reviewed-by: kvn, dfenacci
---
 src/hotspot/share/opto/parse2.cpp             | 20 +++--
 ...stSubTypeCheckInterfaceNotImplemented.java | 76 +++++++++++++++++++
 2 files changed, 88 insertions(+), 8 deletions(-)
 create mode 100644 test/hotspot/jtreg/compiler/types/TestSubTypeCheckInterfaceNotImplemented.java

diff --git a/src/hotspot/share/opto/parse2.cpp b/src/hotspot/share/opto/parse2.cpp
index ae20418942d..d732e6f04e1 100644
--- a/src/hotspot/share/opto/parse2.cpp
+++ b/src/hotspot/share/opto/parse2.cpp
@@ -1833,17 +1833,21 @@ void Parse::sharpen_type_after_if(BoolTest::mask btest,
                        &obj, &cast_type)) {
     assert(obj != nullptr && cast_type != nullptr, "missing type check info");
     const Type* obj_type = _gvn.type(obj);
-    const TypeOopPtr* tboth = obj_type->join_speculative(cast_type)->isa_oopptr();
-    if (tboth != nullptr && tboth != obj_type && tboth->higher_equal(obj_type)) {
+    const Type* tboth = obj_type->filter_speculative(cast_type);
+    assert(tboth->higher_equal(obj_type) && tboth->higher_equal(cast_type), "sanity");
+    if (tboth == Type::TOP && KillPathsReachableByDeadTypeNode) {
+      // Let dead type node cleaning logic prune effectively dead path for us.
+      // CheckCastPP::Value() == TOP and it will trigger the cleanup during GVN.
+      // Don't materialize the cast when cleanup is disabled, because
+      // it kills data and control leaving IR in broken state.
+      tboth = cast_type;
+    }
+    if (tboth != Type::TOP && tboth != obj_type) {
       int obj_in_map = map()->find_edge(obj);
-      JVMState* jvms = this->jvms();
       if (obj_in_map >= 0 &&
-          (jvms->is_loc(obj_in_map) || jvms->is_stk(obj_in_map))) {
+          (jvms()->is_loc(obj_in_map) || jvms()->is_stk(obj_in_map))) {
         TypeNode* ccast = new CheckCastPPNode(control(), obj, tboth);
-        const Type* tcc = ccast->as_Type()->type();
-        assert(tcc != obj_type && tcc->higher_equal(obj_type), "must improve");
-        // Delay transform() call to allow recovery of pre-cast value
-        // at the control merge.
+        // Delay transform() call to allow recovery of pre-cast value at the control merge.
         _gvn.set_type_bottom(ccast);
         record_for_igvn(ccast);
         // Here's the payoff.
diff --git a/test/hotspot/jtreg/compiler/types/TestSubTypeCheckInterfaceNotImplemented.java b/test/hotspot/jtreg/compiler/types/TestSubTypeCheckInterfaceNotImplemented.java
new file mode 100644
index 00000000000..f2828257a2e
--- /dev/null
+++ b/test/hotspot/jtreg/compiler/types/TestSubTypeCheckInterfaceNotImplemented.java
@@ -0,0 +1,76 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ *
+ */
+
+/*
+ * @test
+ * @bug 8376421
+ * @summary "C2: Missing branch on SubTypeCheck node"
+ *
+ * @run main/othervm -Xbatch -XX:+IgnoreUnrecognizedVMOptions
+ *                   -XX:+KillPathsReachableByDeadTypeNode
+ *                   compiler.types.TestSubTypeCheckInterfaceNotImplemented
+ *
+ * @run main/othervm -Xbatch -XX:+IgnoreUnrecognizedVMOptions
+ *                   -XX:-KillPathsReachableByDeadTypeNode
+ *                   compiler.types.TestSubTypeCheckInterfaceNotImplemented
+ */
+
+package compiler.types;
+
+public class TestSubTypeCheckInterfaceNotImplemented {
+    static abstract class A           {}
+    static abstract class B extends A {}
+    static final    class C extends B {}
+
+    interface I {}
+    static final class BJ1 extends A implements I {}
+    static final class BJ2 extends A implements I {}
+
+    static boolean testHelper2(B o) {
+        return true;
+    }
+    static boolean testHelper1(Object o) {
+        if (o instanceof B) {
+            return testHelper2((B)o); // a call to place "o" on JVMS, so the map is updated after the check
+        } else {
+            return false;
+        }
+    }
+
+    static boolean test(A a) {
+        if (a instanceof I) {
+            return testHelper1((I)a); // "a" always fails instanceof check against B
+        } else {
+            return false;
+        }
+    }
+
+    public static void main(String[] args) {
+        for (int i = 0; i < 20_000; i++) {
+            testHelper1(new C()); // pollute profile
+
+            test(new BJ1()); test(new BJ2()); test(new C());
+        }
+    }
+}

From 5acbf8baea3f1a982bdba29b51c8531caa919748 Mon Sep 17 00:00:00 2001
From: Patrick Fontanilla <pfon@amazon.com>
Date: Wed, 15 Apr 2026 19:02:28 +0000
Subject: [PATCH 614/655] 8381871: GenShen: ShenandoahGCHeuristics flag not
 reset after ignoring non-adaptive value

Reviewed-by: xpeng, kdnilsen, ysr, serb, wkemper
---
 .../gc/shenandoah/shenandoahArguments.cpp     |  1 +
 .../options/TestGenerationalHeuristics.java   | 84 +++++++++++++++++++
 2 files changed, 85 insertions(+)
 create mode 100644 test/hotspot/jtreg/gc/shenandoah/options/TestGenerationalHeuristics.java

diff --git a/src/hotspot/share/gc/shenandoah/shenandoahArguments.cpp b/src/hotspot/share/gc/shenandoah/shenandoahArguments.cpp
index c1fa4b964b7..e9d6a686694 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahArguments.cpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahArguments.cpp
@@ -200,6 +200,7 @@ void ShenandoahArguments::initialize() {
       && strcmp(ShenandoahGCHeuristics, "adaptive") != 0) {
     log_warning(gc)("Ignoring -XX:ShenandoahGCHeuristics input: %s, because generational shenandoah only"
       " supports adaptive heuristics", ShenandoahGCHeuristics);
+    FLAG_SET_ERGO(ShenandoahGCHeuristics, "adaptive");
   }
 
   FullGCForwarding::initialize_flags(MaxHeapSize);
diff --git a/test/hotspot/jtreg/gc/shenandoah/options/TestGenerationalHeuristics.java b/test/hotspot/jtreg/gc/shenandoah/options/TestGenerationalHeuristics.java
new file mode 100644
index 00000000000..822c3806347
--- /dev/null
+++ b/test/hotspot/jtreg/gc/shenandoah/options/TestGenerationalHeuristics.java
@@ -0,0 +1,84 @@
+/*
+ * Copyright Amazon.com Inc. or its affiliates. All Rights Reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ *
+ */
+
+/*
+ * @test id=generational
+ * @bug 8381871
+ * @summary Test that ShenandoahGCHeuristics is always adaptive in generational mode
+ * @requires vm.gc.Shenandoah
+ * @library /test/lib
+ * @run driver TestGenerationalHeuristics
+ */
+
+import jdk.test.lib.process.ProcessTools;
+import jdk.test.lib.process.OutputAnalyzer;
+
+public class TestGenerationalHeuristics {
+    public static void main(String[] args) throws Exception {
+        {
+            OutputAnalyzer output = ProcessTools.executeLimitedTestJava(
+                "-XX:+UseShenandoahGC",
+                "-XX:ShenandoahGCMode=generational",
+                "-XX:ShenandoahGCHeuristics=adaptive",
+                "-XX:+PrintFlagsFinal",
+                "-version");
+            output.shouldMatch("ShenandoahGCHeuristics(.*)= adaptive ");
+            output.shouldHaveExitValue(0);
+        }
+
+        {
+            OutputAnalyzer output = ProcessTools.executeLimitedTestJava(
+                "-XX:+UseShenandoahGC",
+                "-XX:ShenandoahGCMode=generational",
+                "-XX:ShenandoahGCHeuristics=static",
+                "-XX:+PrintFlagsFinal",
+                "-version");
+            output.shouldMatch("ShenandoahGCHeuristics(.*)= adaptive ");
+            output.shouldHaveExitValue(0);
+        }
+
+        {
+            OutputAnalyzer output = ProcessTools.executeLimitedTestJava(
+                "-XX:+UseShenandoahGC",
+                "-XX:ShenandoahGCMode=generational",
+                "-XX:ShenandoahGCHeuristics=aggressive",
+                "-XX:+PrintFlagsFinal",
+                "-version");
+            output.shouldMatch("ShenandoahGCHeuristics(.*)= adaptive ");
+            output.shouldHaveExitValue(0);
+        }
+
+        {
+            OutputAnalyzer output = ProcessTools.executeLimitedTestJava(
+                "-XX:+UseShenandoahGC",
+                "-XX:ShenandoahGCMode=generational",
+                "-XX:ShenandoahGCHeuristics=compact",
+                "-XX:+PrintFlagsFinal",
+                "-version");
+            output.shouldMatch("ShenandoahGCHeuristics(.*)= adaptive ");
+            output.shouldHaveExitValue(0);
+        }
+    }
+
+}

From 2a8e3b8e66651cc6ba2f9c53aae32dde41e72a21 Mon Sep 17 00:00:00 2001
From: Vladimir Kozlov <kvn@openjdk.org>
Date: Wed, 15 Apr 2026 19:02:58 +0000
Subject: [PATCH 615/655] 8382174: Clarify the meaning of address cast in ADD()
 macro

Reviewed-by: aseoane, adinn, asmehra, dfenacci
---
 .../cpu/aarch64/stubGenerator_aarch64.cpp     |  2 +-
 .../cpu/aarch64/stubRoutines_aarch64.cpp      |  7 ++--
 src/hotspot/cpu/x86/c1_LIRAssembler_x86.cpp   |  2 +-
 .../x86/stubGenerator_x86_64_constants.cpp    |  5 +--
 .../cpu/x86/stubGenerator_x86_64_exp.cpp      | 15 +++++----
 .../cpu/x86/stubGenerator_x86_64_fmod.cpp     |  2 +-
 .../cpu/x86/stubGenerator_x86_64_ghash.cpp    |  2 +-
 .../cpu/x86/stubGenerator_x86_64_log.cpp      | 32 ++++++++++--------
 .../cpu/x86/stubGenerator_x86_64_poly1305.cpp |  2 +-
 .../x86/stubGenerator_x86_64_poly_mont.cpp    |  2 +-
 .../cpu/x86/stubGenerator_x86_64_pow.cpp      | 33 +++++++++++--------
 .../cpu/x86/stubGenerator_x86_64_sha3.cpp     |  2 +-
 .../cpu/x86/stubGenerator_x86_64_sin.cpp      |  2 +-
 .../cpu/x86/stubGenerator_x86_64_sinh.cpp     | 26 ++++++++-------
 .../cpu/x86/stubGenerator_x86_64_tan.cpp      |  8 +++--
 .../cpu/x86/stubGenerator_x86_64_tanh.cpp     | 22 ++++++++-----
 src/hotspot/cpu/x86/stubRoutines_x86.cpp      |  2 +-
 17 files changed, 93 insertions(+), 73 deletions(-)

diff --git a/src/hotspot/cpu/aarch64/stubGenerator_aarch64.cpp b/src/hotspot/cpu/aarch64/stubGenerator_aarch64.cpp
index 5d9b2f1d826..fddb37b7b8d 100644
--- a/src/hotspot/cpu/aarch64/stubGenerator_aarch64.cpp
+++ b/src/hotspot/cpu/aarch64/stubGenerator_aarch64.cpp
@@ -12825,7 +12825,7 @@ class StubGenerator: public StubCodeGenerator {
 #if INCLUDE_CDS
   static void init_AOTAddressTable(GrowableArray<address>& external_addresses) {
     // external data defined in this file
-#define ADD(addr) external_addresses.append((address)addr);
+#define ADD(addr) external_addresses.append((address)(addr));
     ADD(_sha256_round_consts);
     ADD(_sha512_round_consts);
     ADD(_sha3_round_consts);
diff --git a/src/hotspot/cpu/aarch64/stubRoutines_aarch64.cpp b/src/hotspot/cpu/aarch64/stubRoutines_aarch64.cpp
index aaf31d4f911..f02b681ca10 100644
--- a/src/hotspot/cpu/aarch64/stubRoutines_aarch64.cpp
+++ b/src/hotspot/cpu/aarch64/stubRoutines_aarch64.cpp
@@ -435,10 +435,8 @@ void StubRoutines::init_AOTAddressTable() {
   AOTCodeCache::publish_external_addresses(external_addresses);
 }
 
-
-#define ADD(addr) external_addresses.append((address)addr);
-
 void StubRoutines::aarch64::init_AOTAddressTable(GrowableArray<address>& external_addresses) {
+#define ADD(addr) external_addresses.append((address)(addr));
   ADD(_kyberConsts);
   ADD(_dilithiumConsts);
   // this is added in generic code
@@ -449,7 +447,6 @@ void StubRoutines::aarch64::init_AOTAddressTable(GrowableArray<address>& externa
   ADD(_dcos_coef);
   ADD(_two_over_pi);
   ADD(_pio2);
-}
-
 #undef ADD
+}
 #endif // INCLUDE_CDS
diff --git a/src/hotspot/cpu/x86/c1_LIRAssembler_x86.cpp b/src/hotspot/cpu/x86/c1_LIRAssembler_x86.cpp
index 29925e71aaf..5c05b3702bb 100644
--- a/src/hotspot/cpu/x86/c1_LIRAssembler_x86.cpp
+++ b/src/hotspot/cpu/x86/c1_LIRAssembler_x86.cpp
@@ -74,7 +74,7 @@ static jlong *double_signflip_pool = double_quadword(&fp_signmask_pool[4*2], (jl
 #if INCLUDE_CDS
 // publish external addresses defined in this file
 void LIR_Assembler::init_AOTAddressTable(GrowableArray<address>& external_addresses) {
-#define ADD(addr) external_addresses.append((address)addr);
+#define ADD(addr) external_addresses.append((address)(addr));
   ADD(float_signmask_pool);
   ADD(double_signmask_pool);
   ADD(float_signflip_pool);
diff --git a/src/hotspot/cpu/x86/stubGenerator_x86_64_constants.cpp b/src/hotspot/cpu/x86/stubGenerator_x86_64_constants.cpp
index 45c13b7b397..19e1ca680b3 100644
--- a/src/hotspot/cpu/x86/stubGenerator_x86_64_constants.cpp
+++ b/src/hotspot/cpu/x86/stubGenerator_x86_64_constants.cpp
@@ -247,8 +247,9 @@ void StubGenerator::init_AOTAddressTable_constants(GrowableArray<address>& exter
   ADD(_SC_2);
   ADD(_SC_3);
   ADD(_SC_4);
-  ADD(_PI_4);
-  ADD(((address)_PI_4+8));
+  // Use value which was already cast to (address): StubGenerator::PI_4;
+  ADD(PI_4);
+  ADD(PI_4 + 8);
   ADD(_PI32INV);
   ADD(_NEG_ZERO);
   ADD(_P_1);
diff --git a/src/hotspot/cpu/x86/stubGenerator_x86_64_exp.cpp b/src/hotspot/cpu/x86/stubGenerator_x86_64_exp.cpp
index 2ed9858bf0c..3c8babcbecf 100644
--- a/src/hotspot/cpu/x86/stubGenerator_x86_64_exp.cpp
+++ b/src/hotspot/cpu/x86/stubGenerator_x86_64_exp.cpp
@@ -397,13 +397,14 @@ address StubGenerator::generate_libmExp() {
 
 #if INCLUDE_CDS
 void StubGenerator::init_AOTAddressTable_exp(GrowableArray<address>& external_addresses) {
-#define ADD(addr) external_addresses.append((address)addr);
-  ADD(_cv);
-  ADD(((address)_cv+16));
-  ADD(((address)_cv+32));
-  ADD(((address)_cv+48));
-  ADD(((address)_cv+64));
-  ADD(((address)_cv+80));
+#define ADD(addr) external_addresses.append((address)(addr));
+  address cv = (address)_cv;
+  ADD(cv);
+  ADD(cv + 16);
+  ADD(cv + 32);
+  ADD(cv + 48);
+  ADD(cv + 64);
+  ADD(cv + 80);
   ADD(_mmask);
   ADD(_bias);
   ADD(_Tbl_addr);
diff --git a/src/hotspot/cpu/x86/stubGenerator_x86_64_fmod.cpp b/src/hotspot/cpu/x86/stubGenerator_x86_64_fmod.cpp
index f73c8ed459e..f53985a13b7 100644
--- a/src/hotspot/cpu/x86/stubGenerator_x86_64_fmod.cpp
+++ b/src/hotspot/cpu/x86/stubGenerator_x86_64_fmod.cpp
@@ -537,7 +537,7 @@ address StubGenerator::generate_libmFmod() {
 
 #if INCLUDE_CDS
 void StubGenerator::init_AOTAddressTable_fmod(GrowableArray<address>& external_addresses) {
-#define ADD(addr) external_addresses.append((address)addr);
+#define ADD(addr) external_addresses.append((address)(addr));
   ADD(CONST_NaN);
   ADD(CONST_1p260);
   ADD(CONST_MAX);
diff --git a/src/hotspot/cpu/x86/stubGenerator_x86_64_ghash.cpp b/src/hotspot/cpu/x86/stubGenerator_x86_64_ghash.cpp
index 557fe623351..9ebab07589e 100644
--- a/src/hotspot/cpu/x86/stubGenerator_x86_64_ghash.cpp
+++ b/src/hotspot/cpu/x86/stubGenerator_x86_64_ghash.cpp
@@ -558,7 +558,7 @@ void StubGenerator::generateHtbl_eight_blocks(Register htbl) {
 
 #if INCLUDE_CDS
 void StubGenerator::init_AOTAddressTable_ghash(GrowableArray<address>& external_addresses) {
-#define ADD(addr) external_addresses.append((address)addr);
+#define ADD(addr) external_addresses.append((address)(addr));
   ADD(GHASH_SHUFFLE_MASK);
   ADD(GHASH_LONG_SWAP_MASK);
   ADD(GHASH_BYTE_SWAP_MASK);
diff --git a/src/hotspot/cpu/x86/stubGenerator_x86_64_log.cpp b/src/hotspot/cpu/x86/stubGenerator_x86_64_log.cpp
index 8849597c94b..07683a51e3d 100644
--- a/src/hotspot/cpu/x86/stubGenerator_x86_64_log.cpp
+++ b/src/hotspot/cpu/x86/stubGenerator_x86_64_log.cpp
@@ -729,22 +729,28 @@ address StubGenerator::generate_libmLog10() {
 
 #if INCLUDE_CDS
 void StubGenerator::init_AOTAddressTable_log(GrowableArray<address>& external_addresses) {
-#define ADD(addr) external_addresses.append((address)addr);
+#define ADD(addr) external_addresses.append((address)(addr));
+  address log2  = (address)_log2;
+  address coeff = (address)_coeff;
+  address LOG10_E     = (address)_LOG10_E;
+  address log2_log10  = (address)_log2_log10;
+  address coeff_log10 = (address)_coeff_log10;
+
   ADD(_L_tbl);
-  ADD(_log2);
-  ADD(((address)_log2+8));
-  ADD(_coeff);
-  ADD(((address)_coeff+16));
-  ADD(((address)_coeff+32));
+  ADD(log2);
+  ADD(log2 + 8);
+  ADD(coeff);
+  ADD(coeff + 16);
+  ADD(coeff + 32);
   ADD(_HIGHSIGMASK_log10);
-  ADD(_LOG10_E);
-  ADD(((address)_LOG10_E+8));
+  ADD(LOG10_E);
+  ADD(LOG10_E + 8);
   ADD(_L_tbl_log10);
-  ADD(_log2_log10);
-  ADD(((address)_log2_log10+8));
-  ADD(_coeff_log10);
-  ADD(((address)_coeff_log10+16));
-  ADD(((address)_coeff_log10+32));
+  ADD(log2_log10);
+  ADD(log2_log10 + 8);
+  ADD(coeff_log10);
+  ADD(coeff_log10 + 16);
+  ADD(coeff_log10 + 32);
 #undef ADD
 }
 #endif // INCLUDE_CDS
diff --git a/src/hotspot/cpu/x86/stubGenerator_x86_64_poly1305.cpp b/src/hotspot/cpu/x86/stubGenerator_x86_64_poly1305.cpp
index 1d0e961c82d..ea7e6d64254 100644
--- a/src/hotspot/cpu/x86/stubGenerator_x86_64_poly1305.cpp
+++ b/src/hotspot/cpu/x86/stubGenerator_x86_64_poly1305.cpp
@@ -1709,7 +1709,7 @@ void StubGenerator::poly1305_msg_mul_reduce_vec4_avx2(
 
 #if INCLUDE_CDS
 void StubGenerator::init_AOTAddressTable_poly1305(GrowableArray<address>& external_addresses) {
-#define ADD(addr) external_addresses.append((address)addr);
+#define ADD(addr) external_addresses.append((address)(addr));
   ADD(POLY1305_PAD_MSG);
   ADD(POLY1305_MASK42);
   ADD(POLY1305_MASK44);
diff --git a/src/hotspot/cpu/x86/stubGenerator_x86_64_poly_mont.cpp b/src/hotspot/cpu/x86/stubGenerator_x86_64_poly_mont.cpp
index 4648fe03aa0..308a8042993 100644
--- a/src/hotspot/cpu/x86/stubGenerator_x86_64_poly_mont.cpp
+++ b/src/hotspot/cpu/x86/stubGenerator_x86_64_poly_mont.cpp
@@ -788,7 +788,7 @@ address StubGenerator::generate_intpoly_assign() {
 
 #if INCLUDE_CDS
 void StubGenerator::init_AOTAddressTable_poly_mont(GrowableArray<address>& external_addresses) {
-#define ADD(addr) external_addresses.append((address)addr);
+#define ADD(addr) external_addresses.append((address)(addr));
   // use accessors to retrieve all correct addresses
   ADD(shift_1L());
   ADD(shift_1R());
diff --git a/src/hotspot/cpu/x86/stubGenerator_x86_64_pow.cpp b/src/hotspot/cpu/x86/stubGenerator_x86_64_pow.cpp
index 5ff09e2b377..a9a6dc10da4 100644
--- a/src/hotspot/cpu/x86/stubGenerator_x86_64_pow.cpp
+++ b/src/hotspot/cpu/x86/stubGenerator_x86_64_pow.cpp
@@ -1875,25 +1875,30 @@ address StubGenerator::generate_libmPow() {
 
 #if INCLUDE_CDS
 void StubGenerator::init_AOTAddressTable_pow(GrowableArray<address>& external_addresses) {
-#define ADD(addr) external_addresses.append((address)addr);
+#define ADD(addr) external_addresses.append((address)(addr));
+  address HIGHMASK_Y = (address)_HIGHMASK_Y;
+  address e_coeff    = (address)_e_coeff;
+  address coeff_h    = (address)_coeff_h;
+  address coeff_pow  = (address)_coeff_pow;
+
   ADD(_HIGHSIGMASK);
   ADD(_LOG2_E);
-  ADD(_HIGHMASK_Y);
-  ADD((address)_HIGHMASK_Y+8);
+  ADD(HIGHMASK_Y);
+  ADD(HIGHMASK_Y + 8);
   ADD(_T_exp);
-  ADD(_e_coeff);
-  ADD((address)_e_coeff+16);
-  ADD((address)_e_coeff+32);
-  ADD(_coeff_h);
-  ADD((address)_coeff_h+8);
+  ADD(e_coeff);
+  ADD(e_coeff + 16);
+  ADD(e_coeff + 32);
+  ADD(coeff_h);
+  ADD(coeff_h + 8);
   ADD(_HIGHMASK_LOG_X);
   ADD(_HALFMASK);
-  ADD(_coeff_pow);
-  ADD((address)_coeff_pow+16);
-  ADD((address)_coeff_pow+32);
-  ADD((address)_coeff_pow+48);
-  ADD((address)_coeff_pow+64);
-  ADD((address)_coeff_pow+80);
+  ADD(coeff_pow);
+  ADD(coeff_pow + 16);
+  ADD(coeff_pow + 32);
+  ADD(coeff_pow + 48);
+  ADD(coeff_pow + 64);
+  ADD(coeff_pow + 80);
   ADD(_L_tbl_pow);
   ADD(_log2_pow);
   ADD(_DOUBLE2);
diff --git a/src/hotspot/cpu/x86/stubGenerator_x86_64_sha3.cpp b/src/hotspot/cpu/x86/stubGenerator_x86_64_sha3.cpp
index 075d25dcac8..58f81652a0c 100644
--- a/src/hotspot/cpu/x86/stubGenerator_x86_64_sha3.cpp
+++ b/src/hotspot/cpu/x86/stubGenerator_x86_64_sha3.cpp
@@ -530,7 +530,7 @@ void StubGenerator::generate_sha3_stubs() {
 
 #if INCLUDE_CDS
 void StubGenerator::init_AOTAddressTable_sha3(GrowableArray<address>& external_addresses) {
-#define ADD(addr) external_addresses.append((address)addr);
+#define ADD(addr) external_addresses.append((address)(addr));
   ADD(round_constsAddr());
   ADD(permsAndRotsAddr());
 #undef ADD
diff --git a/src/hotspot/cpu/x86/stubGenerator_x86_64_sin.cpp b/src/hotspot/cpu/x86/stubGenerator_x86_64_sin.cpp
index eaeaea2c566..00c759a369b 100644
--- a/src/hotspot/cpu/x86/stubGenerator_x86_64_sin.cpp
+++ b/src/hotspot/cpu/x86/stubGenerator_x86_64_sin.cpp
@@ -661,7 +661,7 @@ address StubGenerator::generate_libmSin() {
 
 #if INCLUDE_CDS
 void StubGenerator::init_AOTAddressTable_sin(GrowableArray<address>& external_addresses) {
-#define ADD(addr) external_addresses.append((address)addr);
+#define ADD(addr) external_addresses.append((address)(addr));
   ADD(_ALL_ONES);
 #undef ADD
 }
diff --git a/src/hotspot/cpu/x86/stubGenerator_x86_64_sinh.cpp b/src/hotspot/cpu/x86/stubGenerator_x86_64_sinh.cpp
index f6e1d241948..9969866cfc7 100644
--- a/src/hotspot/cpu/x86/stubGenerator_x86_64_sinh.cpp
+++ b/src/hotspot/cpu/x86/stubGenerator_x86_64_sinh.cpp
@@ -535,21 +535,25 @@ address StubGenerator::generate_libmSinh() {
 
 #if INCLUDE_CDS
 void StubGenerator::init_AOTAddressTable_sinh(GrowableArray<address>& external_addresses) {
-#define ADD(addr) external_addresses.append((address)addr);
-  ADD(_L2E);
-  ADD(_L2E + 8);
+#define ADD(addr) external_addresses.append((address)(addr));
+  address L2E = (address)_L2E;
+  address cv  = (address)_cv;
+  address pv  = (address)_pv;
+
+  ADD(L2E);
+  ADD(L2E + 8);
   ADD(_HALFMASK);
   ADD(_Shifter);
-  ADD(_cv);
-  ADD(_cv + 16);
-  ADD(_cv + 32);
-  ADD(_cv + 48);
-  ADD(_cv + 64);
+  ADD(cv);
+  ADD(cv + 16);
+  ADD(cv + 32);
+  ADD(cv + 48);
+  ADD(cv + 64);
   ADD(_T2f);
   ADD(_T2_neg_f);
-  ADD(_pv);
-  ADD(_pv + 16);
-  ADD(_pv + 32);
+  ADD(pv);
+  ADD(pv + 16);
+  ADD(pv + 32);
   ADD(_MASK3);
 #undef ADD
 }
diff --git a/src/hotspot/cpu/x86/stubGenerator_x86_64_tan.cpp b/src/hotspot/cpu/x86/stubGenerator_x86_64_tan.cpp
index 3bfa5a7277f..9f91b9e8f84 100644
--- a/src/hotspot/cpu/x86/stubGenerator_x86_64_tan.cpp
+++ b/src/hotspot/cpu/x86/stubGenerator_x86_64_tan.cpp
@@ -1041,7 +1041,9 @@ address StubGenerator::generate_libmTan() {
 
 #if INCLUDE_CDS
 void StubGenerator::init_AOTAddressTable_tan(GrowableArray<address>& external_addresses) {
-#define ADD(addr) external_addresses.append((address)addr);
+#define ADD(addr) external_addresses.append((address)(addr));
+  address PI_4_tan = (address)_PI_4_tan;
+
   ADD(_MUL16);
   ADD(_sign_mask_tan);
   ADD(_PI32INV_tan);
@@ -1055,8 +1057,8 @@ void StubGenerator::init_AOTAddressTable_tan(GrowableArray<address>& external_ad
   ADD(_Q_7_tan);
   ADD(_Q_5_tan);
   ADD(_Q_3_tan);
-  ADD(_PI_4_tan);
-  ADD(((address)_PI_4_tan+8));
+  ADD(PI_4_tan);
+  ADD(PI_4_tan + 8);
   ADD(_QQ_2_tan);
 #undef ADD
 }
diff --git a/src/hotspot/cpu/x86/stubGenerator_x86_64_tanh.cpp b/src/hotspot/cpu/x86/stubGenerator_x86_64_tanh.cpp
index dcf5f3eb824..4f2fe8a460b 100644
--- a/src/hotspot/cpu/x86/stubGenerator_x86_64_tanh.cpp
+++ b/src/hotspot/cpu/x86/stubGenerator_x86_64_tanh.cpp
@@ -511,20 +511,24 @@ address StubGenerator::generate_libmTanh() {
 
 #if INCLUDE_CDS
 void StubGenerator::init_AOTAddressTable_tanh(GrowableArray<address>& external_addresses) {
-#define ADD(addr) external_addresses.append((address)addr);
-  ADD(_L2E);
-  ADD(_L2E + 8);
+#define ADD(addr) external_addresses.append((address)(addr));
+  address L2E = (address)_L2E;
+  address cv  = (address)_cv;
+  address pv  = (address)_pv;
+
+  ADD(L2E);
+  ADD(L2E + 8);
   ADD(_HALFMASK);
   ADD(_ONEMASK);
   ADD(_TWOMASK);
   ADD(_Shifter);
-  ADD(_cv);
-  ADD(_cv + 16);
-  ADD(_cv + 32);
+  ADD(cv);
+  ADD(cv + 16);
+  ADD(cv + 32);
   ADD(_T2_neg_f);
-  ADD(_pv);
-  ADD(_pv + 16);
-  ADD(_pv + 32);
+  ADD(pv);
+  ADD(pv + 16);
+  ADD(pv + 32);
   ADD(_MASK3);
   ADD(_RMASK);
 #undef ADD
diff --git a/src/hotspot/cpu/x86/stubRoutines_x86.cpp b/src/hotspot/cpu/x86/stubRoutines_x86.cpp
index aaee01437af..ce11925dde2 100644
--- a/src/hotspot/cpu/x86/stubRoutines_x86.cpp
+++ b/src/hotspot/cpu/x86/stubRoutines_x86.cpp
@@ -439,7 +439,7 @@ void StubRoutines::init_AOTAddressTable() {
 // publish addresses of external data defined in this file which may
 // be referenced from stub or code
 void StubRoutines::x86::init_AOTAddressTable(GrowableArray<address>& external_addresses) {
-#define ADD(addr) external_addresses.append((address)addr);
+#define ADD(addr) external_addresses.append((address)(addr));
   ADD(&_mxcsr_std);
   ADD(&_mxcsr_rz);
   ADD(crc_by128_masks_addr());

From a2e840fd7413cbcbd663a30cb5681557e6142319 Mon Sep 17 00:00:00 2001
From: Rui Li <ruili@openjdk.org>
Date: Wed, 15 Apr 2026 19:03:28 +0000
Subject: [PATCH 616/655] 8342786: Shenandoah: Emit AllocationRequiringGC jfr
 events

Reviewed-by: kdnilsen, serb, wkemper
---
 .../gc/shenandoah/shenandoahController.cpp    |  6 ++-
 ...tressAllocationGCEventsWithShenandoah.java | 49 +++++++++++++++++++
 ...ssBigAllocationGCEventsWithShenandoah.java | 49 +++++++++++++++++++
 3 files changed, 102 insertions(+), 2 deletions(-)
 create mode 100644 test/hotspot/jtreg/gc/stress/jfr/TestStressAllocationGCEventsWithShenandoah.java
 create mode 100644 test/hotspot/jtreg/gc/stress/jfr/TestStressBigAllocationGCEventsWithShenandoah.java

diff --git a/src/hotspot/share/gc/shenandoah/shenandoahController.cpp b/src/hotspot/share/gc/shenandoah/shenandoahController.cpp
index 50aabad7d42..0096aad2570 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahController.cpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahController.cpp
@@ -23,13 +23,13 @@
  *
  */
 
+#include "gc/shared/allocTracer.hpp"
 #include "gc/shared/gc_globals.hpp"
 #include "gc/shenandoah/shenandoahCollectorPolicy.hpp"
 #include "gc/shenandoah/shenandoahController.hpp"
 #include "gc/shenandoah/shenandoahHeap.hpp"
 #include "gc/shenandoah/shenandoahHeapRegion.inline.hpp"
 
-
 void ShenandoahController::update_gc_id() {
   _gc_id.add_then_fetch((size_t)1);
 }
@@ -45,10 +45,12 @@ void ShenandoahController::handle_alloc_failure(const ShenandoahAllocRequest& re
   const GCCause::Cause cause = is_humongous ? GCCause::_shenandoah_humongous_allocation_failure : GCCause::_allocation_failure;
 
   ShenandoahHeap* const heap = ShenandoahHeap::heap();
+  size_t req_byte = req.size() * HeapWordSize;
   if (heap->cancel_gc(cause)) {
-    log_info(gc)("Failed to allocate %s, " PROPERFMT, req.type_string(), PROPERFMTARGS(req.size() * HeapWordSize));
+    log_info(gc)("Failed to allocate %s, " PROPERFMT, req.type_string(), PROPERFMTARGS(req_byte));
     request_gc(cause);
   }
+  AllocTracer::send_allocation_requiring_gc_event(req_byte, checked_cast<uint>(get_gc_id()));
 
   if (block) {
     MonitorLocker ml(&_alloc_failure_waiters_lock);
diff --git a/test/hotspot/jtreg/gc/stress/jfr/TestStressAllocationGCEventsWithShenandoah.java b/test/hotspot/jtreg/gc/stress/jfr/TestStressAllocationGCEventsWithShenandoah.java
new file mode 100644
index 00000000000..743e59bca61
--- /dev/null
+++ b/test/hotspot/jtreg/gc/stress/jfr/TestStressAllocationGCEventsWithShenandoah.java
@@ -0,0 +1,49 @@
+/*
+ * Copyright Amazon.com Inc. or its affiliates. All Rights Reserved.
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ *
+ */
+package jdk.jfr.event.gc.detailed;
+
+/**
+ * @test id=default
+ * @key randomness
+ * @requires vm.hasJFR
+ * @requires vm.gc.Shenandoah
+ * @library /test/lib /test/jdk
+ * @run main/othervm -XX:+UseShenandoahGC -Xmx64m -XX:ActiveProcessorCount=1 jdk.jfr.event.gc.detailed.TestStressAllocationGCEventsWithShenandoah
+ */
+
+ /**
+  * @test id=generational
+  * @key randomness
+  * @requires vm.hasJFR
+  * @requires vm.gc.Shenandoah
+  * @library /test/lib /test/jdk
+  * @run main/othervm -XX:+UseShenandoahGC -XX:ShenandoahGCMode=generational -Xmx64m -XX:ActiveProcessorCount=1 jdk.jfr.event.gc.detailed.TestStressAllocationGCEventsWithShenandoah
+  */
+public class TestStressAllocationGCEventsWithShenandoah {
+
+    public static void main(String[] args) throws Exception {
+        new StressAllocationGCEvents().run(args);
+    }
+}
diff --git a/test/hotspot/jtreg/gc/stress/jfr/TestStressBigAllocationGCEventsWithShenandoah.java b/test/hotspot/jtreg/gc/stress/jfr/TestStressBigAllocationGCEventsWithShenandoah.java
new file mode 100644
index 00000000000..cb7e4b5d1ee
--- /dev/null
+++ b/test/hotspot/jtreg/gc/stress/jfr/TestStressBigAllocationGCEventsWithShenandoah.java
@@ -0,0 +1,49 @@
+/*
+ * Copyright Amazon.com Inc. or its affiliates. All Rights Reserved.
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ *
+ */
+package jdk.jfr.event.gc.detailed;
+
+/**
+ * @test id=default
+ * @key randomness
+ * @requires vm.hasJFR
+ * @requires vm.gc.Shenandoah
+ * @library /test/lib /test/jdk
+ * @run main/othervm -XX:+UseShenandoahGC -Xmx256m -XX:ActiveProcessorCount=1 jdk.jfr.event.gc.detailed.TestStressBigAllocationGCEventsWithShenandoah 1048576
+ */
+
+ /**
+  * @test id=generational
+  * @key randomness
+  * @requires vm.hasJFR
+  * @requires vm.gc.Shenandoah
+  * @library /test/lib /test/jdk
+  * @run main/othervm -XX:+UseShenandoahGC -XX:ShenandoahGCMode=generational -Xmx256m -XX:ActiveProcessorCount=1 jdk.jfr.event.gc.detailed.TestStressBigAllocationGCEventsWithShenandoah 1048576
+  */
+public class TestStressBigAllocationGCEventsWithShenandoah {
+
+    public static void main(String[] args) throws Exception {
+        new StressAllocationGCEvents().run(args);
+    }
+}

From f87bb766a79a4f33a5ac9dd3337d31368c1d5b8f Mon Sep 17 00:00:00 2001
From: Chris Plummer <cjplummer@openjdk.org>
Date: Wed, 15 Apr 2026 19:35:52 +0000
Subject: [PATCH 617/655] 8381385:
 nsk/jdi/ClassLoaderReference/visibleClasses/visibleclasses002/ fails with
 --enable-preview and Java Usage Tracker enabled

Reviewed-by: dholmes, lmesnik
---
 .../visibleClasses/visibleclasses002.java                   | 6 ++++--
 1 file changed, 4 insertions(+), 2 deletions(-)

diff --git a/test/hotspot/jtreg/vmTestbase/nsk/jdi/ClassLoaderReference/visibleClasses/visibleclasses002.java b/test/hotspot/jtreg/vmTestbase/nsk/jdi/ClassLoaderReference/visibleClasses/visibleclasses002.java
index 8fe41faa886..78cbe664da3 100644
--- a/test/hotspot/jtreg/vmTestbase/nsk/jdi/ClassLoaderReference/visibleClasses/visibleclasses002.java
+++ b/test/hotspot/jtreg/vmTestbase/nsk/jdi/ClassLoaderReference/visibleClasses/visibleclasses002.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2002, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2002, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -138,7 +138,9 @@ public class visibleclasses002 {
                             }
                         }
                     } catch (ClassNotLoadedException e) {
-                        throw new Failure("Unexpected ClassNotLoadedException while getting componentType() of : " + refType);
+                        // ArrayType.componentType() can throw ClassNotLoadedException if the
+                        // type is loaded but not yet prepared. Just swallow the exception.
+                        display("ClassNotLoadedException while getting componentType() of " + refType);
                     }
 
                 }

From f2289d84d3b99686e90756921738d406f543337f Mon Sep 17 00:00:00 2001
From: Chris Plummer <cjplummer@openjdk.org>
Date: Wed, 15 Apr 2026 21:35:02 +0000
Subject: [PATCH 618/655] 8381609: com/sun/jdi/EATests.java should not
 synchronize on an Integer instance

Reviewed-by: rrich, phubner, lmesnik, sspitsyn
---
 test/jdk/com/sun/jdi/EATests.java | 42 +------------------------------
 1 file changed, 1 insertion(+), 41 deletions(-)

diff --git a/test/jdk/com/sun/jdi/EATests.java b/test/jdk/com/sun/jdi/EATests.java
index 3a936f288cc..f5289e6b011 100644
--- a/test/jdk/com/sun/jdi/EATests.java
+++ b/test/jdk/com/sun/jdi/EATests.java
@@ -1,4 +1,5 @@
 /*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
  * Copyright (c) 2020, 2025 SAP SE. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
@@ -80,20 +81,6 @@
  *                 -XX:-DoEscapeAnalysis -XX:-EliminateAllocations -XX:+EliminateLocks -XX:+EliminateNestedLocks
  *                 -XX:+IgnoreUnrecognizedVMOptions -XX:+DeoptimizeObjectsALot
  *
- * @bug 8324881
- * @comment Regression test for using the wrong thread when logging during re-locking from deoptimization.
- *
- * @comment DiagnoseSyncOnValueBasedClasses=2 will cause logging when locking on \@ValueBased objects.
- * @run driver EATests
- *                 -XX:+UnlockDiagnosticVMOptions
- *                 -Xms256m -Xmx256m
- *                 -Xbootclasspath/a:.
- *                 -XX:CompileCommand=dontinline,*::dontinline_*
- *                 -XX:+WhiteBoxAPI
- *                 -Xbatch
- *                 -XX:+DoEscapeAnalysis -XX:+EliminateAllocations -XX:+EliminateLocks -XX:+EliminateNestedLocks
- *                 -XX:DiagnoseSyncOnValueBasedClasses=2
- *
  * @comment Re-lock may inflate monitors when re-locking, which cause monitorinflation trace logging.
  * @run driver EATests
  *                 -XX:+UnlockDiagnosticVMOptions
@@ -259,7 +246,6 @@ class EATestsTarget {
         new EAGetOwnedMonitorsTarget()                                                      .run();
         new EAEntryCountTarget()                                                            .run();
         new EARelockingObjectCurrentlyWaitingOnTarget()                                     .run();
-        new EARelockingValueBasedTarget()                                                   .run();
 
         // Test cases that require deoptimization even though neither
         // locks nor allocations are eliminated at the point where
@@ -385,7 +371,6 @@ public class EATests extends TestScaffold {
         new EAGetOwnedMonitors()                                                      .run(this);
         new EAEntryCount()                                                            .run(this);
         new EARelockingObjectCurrentlyWaitingOn()                                     .run(this);
-        new EARelockingValueBased()                                                   .run(this);
 
         // Test cases that require deoptimization even though neither
         // locks nor allocations are eliminated at the point where
@@ -2402,31 +2387,6 @@ class EARelockingObjectCurrentlyWaitingOnTarget extends EATestCaseBaseTarget {
 }
 
 
-/////////////////////////////////////////////////////////////////////////////
-
-/**
- * Test relocking eliminated @ValueBased object.
- */
-class EARelockingValueBased extends EATestCaseBaseDebugger {
-
-    public void runTestCase() throws Exception {
-        BreakpointEvent bpe = resumeTo(TARGET_TESTCASE_BASE_NAME, "dontinline_brkpt", "()V");
-        printStack(bpe.thread());
-        @SuppressWarnings("unused")
-        ObjectReference o = getLocalRef(bpe.thread().frame(1), Integer.class.getName(), "l1");
-    }
-}
-
-class EARelockingValueBasedTarget extends EATestCaseBaseTarget {
-
-    public void dontinline_testMethod() {
-        Integer l1 = new Integer(255);
-        synchronized (l1) {
-            dontinline_brkpt();
-        }
-    }
-}
-
 /////////////////////////////////////////////////////////////////////////////
 //
 // Test cases that require deoptimization even though neither locks

From 533a8a8d2605f19f5f6f867c3ff5d649305d0ee5 Mon Sep 17 00:00:00 2001
From: William Kemper <wkemper@openjdk.org>
Date: Wed, 15 Apr 2026 21:54:39 +0000
Subject: [PATCH 619/655] 8376839: GenShen: Improve performance of evacuations
 into the old generation

Reviewed-by: kdnilsen
---
 .../gc/shenandoah/shenandoahConcurrentGC.cpp  |  23 +++
 .../gc/shenandoah/shenandoahConcurrentGC.hpp  |   4 +-
 .../gc/shenandoah/shenandoahDegeneratedGC.cpp |   5 +
 .../share/gc/shenandoah/shenandoahFreeSet.cpp |   3 +-
 .../shenandoahGenerationalEvacuationTask.cpp  |   1 +
 .../shenandoah/shenandoahGenerationalHeap.cpp |   4 -
 .../share/gc/shenandoah/shenandoahHeap.cpp    |  25 +++
 .../share/gc/shenandoah/shenandoahHeap.hpp    |   1 +
 .../gc/shenandoah/shenandoahHeapRegion.cpp    |   6 +
 .../gc/shenandoah/shenandoahHeapRegion.hpp    |   6 +-
 .../shenandoahHeapRegionClosures.cpp          |   5 +
 .../shenandoah/shenandoahInPlacePromoter.cpp  |   3 +
 .../gc/shenandoah/shenandoahOldGeneration.cpp |  33 +++-
 .../gc/shenandoah/shenandoahOldGeneration.hpp |  37 +++-
 .../share/gc/shenandoah/shenandoahPLAB.cpp    |   8 -
 .../gc/shenandoah/shenandoahPhaseTimings.hpp  |   3 +-
 .../shenandoah/shenandoahScanRemembered.cpp   | 165 +++++++++++-------
 .../shenandoah/shenandoahScanRemembered.hpp   |   7 +
 18 files changed, 248 insertions(+), 91 deletions(-)

diff --git a/src/hotspot/share/gc/shenandoah/shenandoahConcurrentGC.cpp b/src/hotspot/share/gc/shenandoah/shenandoahConcurrentGC.cpp
index f0125c38cae..ba0aa1a1304 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahConcurrentGC.cpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahConcurrentGC.cpp
@@ -112,6 +112,24 @@ void ShenandoahConcurrentGC::entry_concurrent_update_refs_prepare(ShenandoahHeap
   heap->concurrent_prepare_for_update_refs();
 }
 
+void ShenandoahConcurrentGC::entry_update_card_table() {
+  ShenandoahHeap* const heap = ShenandoahHeap::heap();
+  TraceCollectorStats tcs(heap->monitoring_support()->concurrent_collection_counters());
+
+  static const char* msg = "Concurrent update cards";
+  ShenandoahConcurrentPhase gc_phase(msg, ShenandoahPhaseTimings::conc_update_card_table);
+  EventMark em("%s", msg);
+
+  ShenandoahWorkerScope scope(heap->workers(),
+                              ShenandoahWorkerPolicy::calc_workers_for_conc_evac(),
+                              "concurrent update cards");
+
+  // Heap needs to be parsable here.
+  // Also, parallel heap region iterate must have a phase set.
+  assert(ShenandoahTimingsTracker::is_current_phase_valid(), "Current phase must be set");
+  ShenandoahGenerationalHeap::heap()->old_generation()->update_card_table();
+}
+
 bool ShenandoahConcurrentGC::collect(GCCause::Cause cause) {
   ShenandoahHeap* const heap = ShenandoahHeap::heap();
   _generation->ref_processor()->set_soft_reference_policy(
@@ -206,6 +224,11 @@ bool ShenandoahConcurrentGC::collect(GCCause::Cause cause) {
 
     // Perform update-refs phase.
     entry_concurrent_update_refs_prepare(heap);
+
+    if (ShenandoahHeap::heap()->mode()->is_generational()) {
+      entry_update_card_table();
+    }
+
     if (ShenandoahVerify) {
       vmop_entry_init_update_refs();
     }
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahConcurrentGC.hpp b/src/hotspot/share/gc/shenandoah/shenandoahConcurrentGC.hpp
index 54d43416fdb..ba228901d72 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahConcurrentGC.hpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahConcurrentGC.hpp
@@ -59,8 +59,6 @@ public:
   bool collect(GCCause::Cause cause) override;
   ShenandoahDegenPoint degen_point() const;
 
-  void entry_concurrent_update_refs_prepare(ShenandoahHeap* heap);
-
   // Return true if this cycle found enough immediate garbage to skip evacuation
   bool abbreviated() const { return _abbreviated; }
 
@@ -95,6 +93,8 @@ protected:
   void entry_cleanup_early();
   void entry_evacuate();
   void entry_update_thread_roots();
+  void entry_update_card_table();
+  void entry_concurrent_update_refs_prepare(ShenandoahHeap* heap);
   void entry_update_refs();
   void entry_cleanup_complete();
 
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahDegeneratedGC.cpp b/src/hotspot/share/gc/shenandoah/shenandoahDegeneratedGC.cpp
index 1873d818093..84b22f13d47 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahDegeneratedGC.cpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahDegeneratedGC.cpp
@@ -277,6 +277,11 @@ void ShenandoahDegenGC::op_degenerated() {
         _abbreviated = true;
       }
 
+      // labs are retired, walk the old regions and update remembered set
+      if (ShenandoahHeap::heap()->mode()->is_generational()) {
+        ShenandoahGenerationalHeap::heap()->old_generation()->update_card_table();
+      }
+
     case _degenerated_update_refs:
       if (heap->has_forwarded_objects()) {
         op_update_refs();
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahFreeSet.cpp b/src/hotspot/share/gc/shenandoah/shenandoahFreeSet.cpp
index a579d6d3694..592c5bffa5a 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahFreeSet.cpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahFreeSet.cpp
@@ -1569,7 +1569,7 @@ HeapWord* ShenandoahFreeSet::try_allocate_in(ShenandoahHeapRegion* r, Shenandoah
   // We must call try_recycle_under_lock() even if !r->is_trash().  The reason is that if r is being recycled at this
   // moment by a GC worker thread, it may appear to be not trash even though it has not yet been fully recycled.  If
   // we proceed without waiting for the worker to finish recycling the region, the worker thread may overwrite the
-  // region's affiliation with FREE after we set the region's affiliation to req.afiliation() below
+  // region's affiliation with FREE after we set the region's affiliation to req.affiliation() below
   r->try_recycle_under_lock();
   in_new_region = r->is_empty();
   if (in_new_region) {
@@ -1585,7 +1585,6 @@ HeapWord* ShenandoahFreeSet::try_allocate_in(ShenandoahHeapRegion* r, Shenandoah
       // concurrent preparations for mixed evacuations are completed), we mark this region as not requiring any
       // coalesce-and-fill processing.
       r->end_preemptible_coalesce_and_fill();
-      _heap->old_generation()->clear_cards_for(r);
     }
 #ifdef ASSERT
     ShenandoahMarkingContext* const ctx = _heap->marking_context();
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahGenerationalEvacuationTask.cpp b/src/hotspot/share/gc/shenandoah/shenandoahGenerationalEvacuationTask.cpp
index 6912750378e..ca15c6db443 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahGenerationalEvacuationTask.cpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahGenerationalEvacuationTask.cpp
@@ -133,3 +133,4 @@ void ShenandoahGenerationalEvacuationTask::evacuate_and_promote_regions() {
     }
   }
 }
+
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahGenerationalHeap.cpp b/src/hotspot/share/gc/shenandoah/shenandoahGenerationalHeap.cpp
index d5cfa4b7fb9..a51449e91f4 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahGenerationalHeap.cpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahGenerationalHeap.cpp
@@ -363,10 +363,6 @@ oop ShenandoahGenerationalHeap::try_evacuate_object(oop p, Thread* thread, uint
       // Record that the evacuation succeeded
       evac_tracker()->end_evacuation(thread, size * HeapWordSize, FROM_GENERATION, TO_GENERATION);
     }
-
-    if (TO_GENERATION == OLD_GENERATION) {
-      old_generation()->handle_evacuation(copy, size);
-    }
   }  else {
     // Failed to evacuate. We need to deal with the object that is left behind. Since this
     // new allocation is certainly after TAMS, it will be considered live in the next cycle.
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahHeap.cpp b/src/hotspot/share/gc/shenandoah/shenandoahHeap.cpp
index 5bf76505506..75d3ade4e49 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahHeap.cpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahHeap.cpp
@@ -1955,6 +1955,26 @@ void ShenandoahHeap::heap_region_iterate(ShenandoahHeapRegionClosure* blk) const
   }
 }
 
+class ShenandoahHeapRegionIteratorTask : public WorkerTask {
+private:
+  ShenandoahRegionIterator _regions;
+  ShenandoahHeapRegionClosure* _closure;
+
+public:
+  ShenandoahHeapRegionIteratorTask(ShenandoahHeapRegionClosure* closure)
+    : WorkerTask("Shenandoah Heap Region Iterator")
+    , _closure(closure) {}
+
+  void work(uint worker_id) override {
+    ShenandoahParallelWorkerSession worker_session(worker_id);
+    ShenandoahHeapRegion* region = _regions.next();
+    while (region != nullptr) {
+      _closure->heap_region_do(region);
+      region = _regions.next();
+    }
+  }
+};
+
 class ShenandoahParallelHeapRegionTask : public WorkerTask {
 private:
   ShenandoahHeap* const _heap;
@@ -2011,6 +2031,11 @@ void ShenandoahHeap::parallel_heap_region_iterate(ShenandoahHeapRegionClosure* b
   }
 }
 
+void ShenandoahHeap::heap_region_iterator(ShenandoahHeapRegionClosure* closure) const {
+  ShenandoahHeapRegionIteratorTask task(closure);
+  workers()->run_task(&task);
+}
+
 class ShenandoahRendezvousHandshakeClosure : public HandshakeClosure {
 public:
   inline ShenandoahRendezvousHandshakeClosure(const char* name) : HandshakeClosure(name) {}
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahHeap.hpp b/src/hotspot/share/gc/shenandoah/shenandoahHeap.hpp
index d4604be0aec..ab7dd00b774 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahHeap.hpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahHeap.hpp
@@ -298,6 +298,7 @@ public:
 
   void heap_region_iterate(ShenandoahHeapRegionClosure* blk) const;
   void parallel_heap_region_iterate(ShenandoahHeapRegionClosure* blk) const;
+  void heap_region_iterator(ShenandoahHeapRegionClosure* blk) const;
 
   inline ShenandoahMmuTracker* mmu_tracker() { return &_mmu_tracker; };
 
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahHeapRegion.cpp b/src/hotspot/share/gc/shenandoah/shenandoahHeapRegion.cpp
index afc6b24e168..3db11000af5 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahHeapRegion.cpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahHeapRegion.cpp
@@ -67,6 +67,7 @@ ShenandoahHeapRegion::ShenandoahHeapRegion(HeapWord* start, size_t index, bool c
   _new_top(nullptr),
   _empty_time(os::elapsedTime()),
   _top_before_promoted(nullptr),
+  _top_at_evac_start(start),
   _state(committed ? _empty_committed : _empty_uncommitted),
   _top(start),
   _tlab_allocs(0),
@@ -565,12 +566,17 @@ void ShenandoahHeapRegion::recycle_internal() {
   assert(_recycling.is_set() && is_trash(), "Wrong state");
   ShenandoahHeap* heap = ShenandoahHeap::heap();
 
+  _top_at_evac_start = _bottom;
   _mixed_candidate_garbage_words = 0;
   set_top(bottom());
   clear_live_data();
   reset_alloc_metadata();
   heap->marking_context()->reset_top_at_mark_start(this);
   set_update_watermark(bottom());
+  if (is_old()) {
+    heap->old_generation()->clear_cards_for(this);
+  }
+
   if (ZapUnusedHeapArea) {
     SpaceMangler::mangle_region(MemRegion(bottom(), end()));
   }
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahHeapRegion.hpp b/src/hotspot/share/gc/shenandoah/shenandoahHeapRegion.hpp
index 3a0ac042f57..569b64f756b 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahHeapRegion.hpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahHeapRegion.hpp
@@ -246,6 +246,7 @@ private:
   double _empty_time;
 
   HeapWord* _top_before_promoted;
+  HeapWord* _top_at_evac_start;
 
   // Seldom updated fields
   Atomic<RegionState> _state;
@@ -365,12 +366,15 @@ public:
   }
 
   // Returns true iff this region was promoted in place subsequent to the most recent start of concurrent old marking.
-  inline bool was_promoted_in_place() {
+  bool was_promoted_in_place() const {
     return _promoted_in_place;
   }
   inline void restore_top_before_promote();
   inline size_t garbage_before_padded_for_promote() const;
 
+  HeapWord* get_top_at_evac_start() const { return _top_at_evac_start; }
+  void record_top_at_evac_start()         { _top_at_evac_start = _top; }
+
   // If next available memory is not aligned on address that is multiple of alignment, fill the empty space
   // so that returned object is aligned on an address that is a multiple of alignment_in_bytes.  Requested
   // size is in words.  It is assumed that this->is_old().  A pad object is allocated, filled, and registered
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahHeapRegionClosures.cpp b/src/hotspot/share/gc/shenandoah/shenandoahHeapRegionClosures.cpp
index 3c6fe1a3df1..7554a9c9a2c 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahHeapRegionClosures.cpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahHeapRegionClosures.cpp
@@ -80,6 +80,11 @@ void ShenandoahFinalMarkUpdateRegionStateClosure::heap_region_do(ShenandoahHeapR
     // Remember limit for updating refs. It's guaranteed that we get no
     // from-space-refs written from here on.
     r->set_update_watermark_at_safepoint(r->top());
+
+    if (r->is_old()) {
+      // Record where we need to start updating the remembered set
+      r->record_top_at_evac_start();
+    }
   } else {
     assert(!r->has_live(), "Region %zu should have no live data", r->index());
     assert(_ctx == nullptr || _ctx->top_at_mark_start(r) == r->top(),
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahInPlacePromoter.cpp b/src/hotspot/share/gc/shenandoah/shenandoahInPlacePromoter.cpp
index 10d61221e87..153193fa3a3 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahInPlacePromoter.cpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahInPlacePromoter.cpp
@@ -238,6 +238,9 @@ void ShenandoahInPlacePromoter::promote(ShenandoahHeapRegion* region) const {
     // is_collector_free range.  We'll add it to that range below.
     region->restore_top_before_promote();
 
+    // We also need to record where those allocations begin so that we can later update the remembered set.
+    region->record_top_at_evac_start();
+
     assert(region->used() + pip_pad_bytes + pip_unpadded == region_size_bytes, "invariant");
 
     // The update_watermark was likely established while we had the artificially high value of top.  Make it sane now.
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahOldGeneration.cpp b/src/hotspot/share/gc/shenandoah/shenandoahOldGeneration.cpp
index 4ad7d2a1ae5..37de5966554 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahOldGeneration.cpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahOldGeneration.cpp
@@ -318,6 +318,11 @@ void ShenandoahOldGeneration::heap_region_iterate(ShenandoahHeapRegionClosure* c
   ShenandoahHeap::heap()->heap_region_iterate(&old_regions_cl);
 }
 
+void ShenandoahOldGeneration::heap_region_iterator(ShenandoahHeapRegionClosure* cl) {
+  ShenandoahIncludeRegionClosure<OLD_GENERATION> old_regions_cl(cl);
+  ShenandoahHeap::heap()->heap_region_iterator(&old_regions_cl);
+}
+
 void ShenandoahOldGeneration::set_concurrent_mark_in_progress(bool in_progress) {
   ShenandoahHeap::heap()->set_concurrent_old_mark_in_progress(in_progress);
 }
@@ -326,6 +331,12 @@ bool ShenandoahOldGeneration::is_concurrent_mark_in_progress() {
   return ShenandoahHeap::heap()->is_concurrent_old_mark_in_progress();
 }
 
+void ShenandoahOldGeneration::record_tops_at_evac_start() {
+  for_each_region([](ShenandoahHeapRegion* region) {
+    region->record_top_at_evac_start();
+  });
+}
+
 void ShenandoahOldGeneration::cancel_marking() {
   if (is_concurrent_mark_in_progress()) {
     log_debug(gc)("Abandon SATB buffers");
@@ -662,15 +673,19 @@ void ShenandoahOldGeneration::log_failed_promotion(LogStream& ls, Thread* thread
   }
 }
 
-void ShenandoahOldGeneration::handle_evacuation(HeapWord* obj, size_t words) const {
-  // Only register the copy of the object that won the evacuation race.
-  _card_scan->register_object_without_lock(obj);
-
-  // Mark the entire range of the evacuated object as dirty.  At next remembered set scan,
-  // we will clear dirty bits that do not hold interesting pointers.  It's more efficient to
-  // do this in batch, in a background GC thread than to try to carefully dirty only cards
-  // that hold interesting pointers right now.
-  _card_scan->mark_range_as_dirty(obj, words);
+void ShenandoahOldGeneration::update_card_table() {
+  for_each_region([this](ShenandoahHeapRegion* region) {
+    if (region->is_regular()) {
+      // Humongous regions are promoted in place, remembered set maintenance is handled there
+      // Regular regions that are promoted in place have their rset maintenance handled for
+      // the objects in the region when it was promoted. We record TEAS for such a region
+      // when the in-place-promotion is completed. Such a region may be used for additional
+      // promotions in the same cycle it was itself promoted.
+      if (region->top() > region->get_top_at_evac_start()) {
+        _card_scan->update_card_table(region->get_top_at_evac_start(), region->top());
+      }
+    }
+  });
 }
 
 bool ShenandoahOldGeneration::has_unprocessed_collection_candidates() {
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahOldGeneration.hpp b/src/hotspot/share/gc/shenandoah/shenandoahOldGeneration.hpp
index 0069d38a84e..942f93c5c68 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahOldGeneration.hpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahOldGeneration.hpp
@@ -172,8 +172,8 @@ public:
   void handle_failed_promotion(Thread* thread, size_t size) const;
   void log_failed_promotion(LogStream& ls, Thread* thread, size_t size) const;
 
-  // A successful evacuation re-dirties the cards and registers the object with the remembered set
-  void handle_evacuation(HeapWord* obj, size_t words) const;
+  // Iterate over recently promoted objects to update card table and object registrations
+  void update_card_table();
 
   // Clear the flag after it is consumed by the control thread
   bool clear_failed_evacuation() {
@@ -199,11 +199,36 @@ public:
   // Mark card for this location as dirty
   void mark_card_as_dirty(void* location);
 
+  template<typename T>
+  class ShenandoahHeapRegionLambda : public ShenandoahHeapRegionClosure {
+    T _region_lambda;
+  public:
+    explicit ShenandoahHeapRegionLambda(T region_lambda) : _region_lambda(region_lambda) {}
+
+    void heap_region_do(ShenandoahHeapRegion* r) override {
+      _region_lambda(r);
+    }
+
+    bool is_thread_safe() override {
+      return true;
+    }
+
+    size_t parallel_region_stride() override {
+      // Temporarily override to force parallelism when updating card table
+      return 8;
+    }
+  };
+
+  template<typename LambdaT>
+  void for_each_region(LambdaT lambda) {
+    ShenandoahHeapRegionLambda l(lambda);
+    heap_region_iterator(&l);
+  }
+
   void parallel_heap_region_iterate(ShenandoahHeapRegionClosure* cl) override;
-
   void parallel_heap_region_iterate_free(ShenandoahHeapRegionClosure* cl) override;
-
   void heap_region_iterate(ShenandoahHeapRegionClosure* cl) override;
+  void heap_region_iterator(ShenandoahHeapRegionClosure* cl);
 
   bool contains(ShenandoahAffiliation affiliation) const override;
   bool contains(ShenandoahHeapRegion* region) const override;
@@ -212,6 +237,10 @@ public:
   void set_concurrent_mark_in_progress(bool in_progress) override;
   bool is_concurrent_mark_in_progress() override;
 
+  // For old regions, objects between top at evac start and top represent promoted objects.
+  // These objects will need to have their cards dirtied and their offsets within the cards registered.
+  void record_tops_at_evac_start();
+
   bool entry_coalesce_and_fill();
 
   // Global collections touch old regions, so the old generation needs to be informed of this.
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahPLAB.cpp b/src/hotspot/share/gc/shenandoah/shenandoahPLAB.cpp
index 412cfa9447e..5049113b665 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahPLAB.cpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahPLAB.cpp
@@ -210,12 +210,4 @@ void ShenandoahPLAB::retire() {
   // plab->retire() overwrites unused memory between plab->top() and plab->hard_end() with a dummy object to make memory parsable.
   // It adds the size of this unused memory, in words, to plab->waste().
   _plab->retire();
-  if (top != nullptr && _plab->waste() > original_waste && _heap->is_in_old(top)) {
-    // If retiring the plab created a filler object, then we need to register it with our card scanner so it can
-    // safely walk the region backing the plab.
-    log_debug(gc, plab)("retire_plab() is registering remnant of size %zu at " PTR_FORMAT,
-                        (_plab->waste() - original_waste) * HeapWordSize, p2i(top));
-    // No lock is necessary because the PLAB memory is aligned on card boundaries.
-    _heap->old_generation()->card_scan()->register_object_without_lock(top);
-  }
 }
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahPhaseTimings.hpp b/src/hotspot/share/gc/shenandoah/shenandoahPhaseTimings.hpp
index e890008b916..a454de68f00 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahPhaseTimings.hpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahPhaseTimings.hpp
@@ -109,6 +109,7 @@ class outputStream;
   f(conc_strong_roots,                              "Concurrent Strong Roots")         \
   SHENANDOAH_PAR_PHASE_DO(conc_strong_roots_,       "  CSR: ", f)                      \
   f(conc_evac,                                      "Concurrent Evacuation")           \
+  f(conc_update_card_table,                         "Concurrent Update Cards")         \
   f(conc_final_roots,                               "Concurrent Final Roots")          \
   f(promote_in_place,                               "  Promote Regions")               \
   f(final_roots_gross,                              "Pause Verify Final Roots (G)")    \
@@ -254,7 +255,7 @@ public:
   void flush_cycle_to_global();
 
   static const char* phase_name(Phase phase) {
-    assert(phase >= 0 && phase < _num_phases, "Out of bound");
+    assert(phase >= 0 && phase < _num_phases, "Out of bounds: %d", phase);
     return _phase_names[phase];
   }
 
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahScanRemembered.cpp b/src/hotspot/share/gc/shenandoah/shenandoahScanRemembered.cpp
index 9e160d5b294..8d7ba2dc46f 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahScanRemembered.cpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahScanRemembered.cpp
@@ -31,6 +31,33 @@
 #include "logging/log.hpp"
 #include "runtime/threads.hpp"
 
+// A closure that takes an oop in the old generation and, if it's pointing
+// into the young generation, dirties the corresponding remembered set entry.
+class ShenandoahDirtyRememberedSetClosure : public BasicOopIterateClosure {
+protected:
+  ShenandoahGenerationalHeap* const _heap;
+  ShenandoahScanRemembered*   const _scanner;
+
+public:
+  ShenandoahDirtyRememberedSetClosure() :
+          _heap(ShenandoahGenerationalHeap::heap()),
+          _scanner(_heap->old_generation()->card_scan()) {}
+
+  template<class T>
+  void work(T* p) {
+    assert(_heap->is_in_old(p), "Expecting to get an old gen address");
+    if (T o = RawAccess<>::oop_load(p); !CompressedOops::is_null(o)) {
+      if (const oop obj = CompressedOops::decode_not_null(o); _heap->is_in_young(obj)) {
+        // Dirty the card containing the cross-generational pointer.
+        _scanner->mark_card_as_dirty((HeapWord*) p);
+      }
+    }
+  }
+
+  void do_oop(narrowOop* p) override { work(p); }
+  void do_oop(oop* p) override       { work(p); }
+};
+
 size_t ShenandoahDirectCardMarkRememberedSet::last_valid_index() const {
   return _card_table->last_valid_index();
 }
@@ -161,7 +188,6 @@ void ShenandoahCardCluster::register_object_without_lock(HeapWord* address) {
   uint8_t offset_in_card = checked_cast<uint8_t>(pointer_delta(address, card_start_address));
 
   if (!starts_object(card_at_start)) {
-    set_starts_object_bit(card_at_start);
     set_first_start(card_at_start, offset_in_card);
     set_last_start(card_at_start, offset_in_card);
   } else {
@@ -172,6 +198,49 @@ void ShenandoahCardCluster::register_object_without_lock(HeapWord* address) {
   }
 }
 
+void ShenandoahCardCluster::update_card_table(HeapWord* start, HeapWord* end) {
+  HeapWord* address = start;
+  HeapWord* previous_address = nullptr;
+  uint8_t previous_offset = 0;
+  size_t previous_card_index = -1;
+  ShenandoahDirtyRememberedSetClosure make_cards_dirty;
+
+  log_debug(gc, remset)("Update remembered set from " PTR_FORMAT ", to " PTR_FORMAT, p2i(start), p2i(end));
+  _rs->mark_range_as_dirty(start, pointer_delta(end, start));
+
+  while (address < end) {
+
+    // Compute card and offset in card for this object
+    const size_t object_card_index = _rs->card_index_for_addr(address);
+    const HeapWord* card_start_address = _rs->addr_for_card_index(object_card_index);
+    const uint8_t offset_in_card = checked_cast<uint8_t>(pointer_delta(address, card_start_address));
+
+    if (object_card_index != previous_card_index) {
+      if (previous_address != nullptr) {
+        // Register the previous object on the previous card, we are starting a new card here
+        set_last_start(previous_card_index, previous_offset);
+      }
+
+      previous_card_index = object_card_index;
+      if (!starts_object(object_card_index)) {
+        // The previous cycle may have recorded an earlier start in this card. Do not overwrite it.
+        set_first_start(object_card_index, offset_in_card);
+      }
+    }
+
+    previous_offset = offset_in_card;
+    previous_address = address;
+
+    const oop obj = cast_to_oop(address);
+    address += obj->size();
+  }
+
+  // Register the last object seen in this range.
+  if (previous_address != nullptr) {
+    set_last_start(previous_card_index, previous_offset);
+  }
+}
+
 void ShenandoahCardCluster::coalesce_objects(HeapWord* address, size_t length_in_words) {
 
   size_t card_at_start = _rs->card_index_for_addr(address);
@@ -641,36 +710,6 @@ void ShenandoahScanRemembered::merge_worker_card_stats_cumulative(
 }
 #endif
 
-// A closure that takes an oop in the old generation and, if it's pointing
-// into the young generation, dirties the corresponding remembered set entry.
-// This is only used to rebuild the remembered set after a full GC.
-class ShenandoahDirtyRememberedSetClosure : public BasicOopIterateClosure {
-protected:
-  ShenandoahGenerationalHeap* const _heap;
-  ShenandoahScanRemembered*   const _scanner;
-
-public:
-  ShenandoahDirtyRememberedSetClosure() :
-          _heap(ShenandoahGenerationalHeap::heap()),
-          _scanner(_heap->old_generation()->card_scan()) {}
-
-  template<class T>
-  inline void work(T* p) {
-    assert(_heap->is_in_old(p), "Expecting to get an old gen address");
-    T o = RawAccess<>::oop_load(p);
-    if (!CompressedOops::is_null(o)) {
-      oop obj = CompressedOops::decode_not_null(o);
-      if (_heap->is_in_young(obj)) {
-        // Dirty the card containing the cross-generational pointer.
-        _scanner->mark_card_as_dirty((HeapWord*) p);
-      }
-    }
-  }
-
-  virtual void do_oop(narrowOop* p) { work(p); }
-  virtual void do_oop(oop* p)       { work(p); }
-};
-
 ShenandoahDirectCardMarkRememberedSet::ShenandoahDirectCardMarkRememberedSet(ShenandoahCardTable* card_table, size_t total_card_count) :
   LogCardValsPerIntPtr(log2i_exact(sizeof(intptr_t)) - log2i_exact(sizeof(CardValue))),
   LogCardSizeInWords(log2i_exact(CardTable::card_size_in_words())) {
@@ -1039,38 +1078,44 @@ void ShenandoahReconstructRememberedSetTask::work(uint worker_id) {
   ShenandoahDirtyRememberedSetClosure dirty_cards_for_cross_generational_pointers;
 
   while (r != nullptr) {
-    if (r->is_old() && r->is_active()) {
-      HeapWord* obj_addr = r->bottom();
-      if (r->is_humongous_start()) {
-        // First, clear the remembered set
-        oop obj = cast_to_oop(obj_addr);
-        size_t size = obj->size();
-
-        size_t num_regions = ShenandoahHeapRegion::required_regions(size * HeapWordSize);
-        size_t region_index = r->index();
-        ShenandoahHeapRegion* humongous_region = heap->get_region(region_index);
-        while (num_regions-- != 0) {
-          scanner->reset_object_range(humongous_region->bottom(), humongous_region->end());
-          region_index++;
-          humongous_region = heap->get_region(region_index);
-        }
-
-        // Then register the humongous object and DIRTY relevant remembered set cards
-        scanner->register_object_without_lock(obj_addr);
-        obj->oop_iterate(&dirty_cards_for_cross_generational_pointers);
-      } else if (!r->is_humongous()) {
-        scanner->reset_object_range(r->bottom(), r->end());
-
-        // Then iterate over all objects, registering object and DIRTYing relevant remembered set cards
-        HeapWord* t = r->top();
-        while (obj_addr < t) {
+    if (r->is_active()) {
+      if (r->is_old()) {
+        HeapWord* obj_addr = r->bottom();
+        if (r->is_humongous_start()) {
+          // First, clear the remembered set
           oop obj = cast_to_oop(obj_addr);
+          size_t size = obj->size();
+
+          size_t num_regions = ShenandoahHeapRegion::required_regions(size * HeapWordSize);
+          size_t region_index = r->index();
+          ShenandoahHeapRegion* humongous_region = heap->get_region(region_index);
+          while (num_regions-- != 0) {
+            scanner->reset_object_range(humongous_region->bottom(), humongous_region->end());
+            region_index++;
+            humongous_region = heap->get_region(region_index);
+          }
+
+          // Then register the humongous object and DIRTY relevant remembered set cards
           scanner->register_object_without_lock(obj_addr);
-          obj_addr += obj->oop_iterate_size(&dirty_cards_for_cross_generational_pointers);
-        }
-      } // else, ignore humongous continuation region
+          obj->oop_iterate(&dirty_cards_for_cross_generational_pointers);
+        } else if (!r->is_humongous()) {
+          scanner->reset_object_range(r->bottom(), r->end());
+
+          // Then iterate over all objects, registering object and DIRTYing relevant remembered set cards
+          HeapWord* t = r->top();
+          while (obj_addr < t) {
+            oop obj = cast_to_oop(obj_addr);
+            scanner->register_object_without_lock(obj_addr);
+            obj_addr += obj->oop_iterate_size(&dirty_cards_for_cross_generational_pointers);
+          }
+        } // else, ignore humongous continuation region
+      } else {
+        // The region is young, but it may become old again and we don't want stale remembered set data.
+        assert(r->is_young(), "Region: %zu, is active but free", r->index());
+        heap->old_generation()->clear_cards_for(r);
+      }
     }
-    // else, this region is FREE or YOUNG or inactive and we can ignore it.
+    // else, this region is FREE or inactive and we can ignore it.
     r = _regions->next();
   }
 }
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahScanRemembered.hpp b/src/hotspot/share/gc/shenandoah/shenandoahScanRemembered.hpp
index c2c117e86e6..53f00e64a03 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahScanRemembered.hpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahScanRemembered.hpp
@@ -603,6 +603,9 @@ public:
   // as address.
   void register_object_without_lock(HeapWord* address);
 
+  // Dirty cards and register objects for the given range in memory.
+  void update_card_table(HeapWord* start, HeapWord* end);
+
   // During the reference updates phase of GC, we walk through each old-gen memory region that was
   // not part of the collection set and we invalidate all unmarked objects.  As part of this effort,
   // we coalesce neighboring dead objects in order to make future remembered set scanning more
@@ -814,6 +817,10 @@ public:
     }
   }
 
+  void update_card_table(HeapWord* start, HeapWord* end) const {
+    _scc->update_card_table(start, end);
+  }
+
   // Return true iff this object is "properly" registered.
   bool verify_registration(HeapWord* address, ShenandoahMarkingContext* ctx);
 

From a2261a4b7c84909f8c116552f32a6fb5553b0ce6 Mon Sep 17 00:00:00 2001
From: Ioi Lam <iklam@openjdk.org>
Date: Thu, 16 Apr 2026 05:17:06 +0000
Subject: [PATCH 620/655] 8382196: Clean up C++ iterator style in
 compactHashtable.hpp and trainingData.hpp

Reviewed-by: kvn, qamai
---
 src/hotspot/share/classfile/compactHashtable.hpp |  7 +------
 src/hotspot/share/oops/trainingData.hpp          | 13 +++----------
 2 files changed, 4 insertions(+), 16 deletions(-)

diff --git a/src/hotspot/share/classfile/compactHashtable.hpp b/src/hotspot/share/classfile/compactHashtable.hpp
index 81f2951289d..1711c5f8cd3 100644
--- a/src/hotspot/share/classfile/compactHashtable.hpp
+++ b/src/hotspot/share/classfile/compactHashtable.hpp
@@ -307,14 +307,9 @@ public:
   template <class ITER>
   inline void iterate(ITER* iter) const { iterate([&](V v) { iter->do_value(v); }); }
 
-  template<typename Function>
-  inline void iterate(const Function& function) const { // lambda enabled API
-    iterate(const_cast<Function&>(function));
-  }
-
   // Iterate through the values in the table, stopping when the lambda returns false.
   template<typename Function>
-  inline void iterate(Function& function) const { // lambda enabled API
+  inline void iterate(Function function) const { // lambda enabled API
     for (u4 i = 0; i < _bucket_count; i++) {
       u4 bucket_info = _buckets[i];
       u4 bucket_offset = BUCKET_OFFSET(bucket_info);
diff --git a/src/hotspot/share/oops/trainingData.hpp b/src/hotspot/share/oops/trainingData.hpp
index bd696f52a8b..a6decdce7f0 100644
--- a/src/hotspot/share/oops/trainingData.hpp
+++ b/src/hotspot/share/oops/trainingData.hpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2025, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -217,11 +217,7 @@ public:
       return *prior;
     }
     template<typename Function>
-    void iterate(const Function& fn) const { // lambda enabled API
-      iterate(const_cast<Function&>(fn));
-    }
-    template<typename Function>
-    void iterate(Function& fn) const { // lambda enabled API
+    void iterate(Function fn) const { // lambda enabled API
       return _table.iterate_all([&](const TrainingData::Key* k, TrainingData* td) { fn(td); });
     }
     int size() const { return _table.number_of_entries(); }
@@ -304,10 +300,7 @@ private:
   }
 
   template<typename Function>
-  static void iterate(const Function& fn) { iterate(const_cast<Function&>(fn)); }
-
-  template<typename Function>
-  static void iterate(Function& fn) { // lambda enabled API
+  static void iterate(Function fn) { // lambda enabled API
     TrainingDataLocker l;
     if (have_data()) {
       archived_training_data_dictionary()->iterate_all(fn);

From 01bfd427a322c6f92643c7920bbd1b1b35141a69 Mon Sep 17 00:00:00 2001
From: Xiaolong Peng <xpeng@openjdk.org>
Date: Thu, 16 Apr 2026 06:08:06 +0000
Subject: [PATCH 621/655] 8381382: Shenandoah: assert(capacity > 0) failed:
 free regions must have allocation capacity

Reviewed-by: kdnilsen, wkemper
---
 .../gc/shenandoah/shenandoahHeapRegion.cpp    | 20 +++++++++++++------
 .../gc/shenandoah/shenandoahHeapRegion.hpp    |  2 +-
 2 files changed, 15 insertions(+), 7 deletions(-)

diff --git a/src/hotspot/share/gc/shenandoah/shenandoahHeapRegion.cpp b/src/hotspot/share/gc/shenandoah/shenandoahHeapRegion.cpp
index 3db11000af5..c031569b7c6 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahHeapRegion.cpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahHeapRegion.cpp
@@ -568,7 +568,6 @@ void ShenandoahHeapRegion::recycle_internal() {
 
   _top_at_evac_start = _bottom;
   _mixed_candidate_garbage_words = 0;
-  set_top(bottom());
   clear_live_data();
   reset_alloc_metadata();
   heap->marking_context()->reset_top_at_mark_start(this);
@@ -580,16 +579,21 @@ void ShenandoahHeapRegion::recycle_internal() {
   if (ZapUnusedHeapArea) {
     SpaceMangler::mangle_region(MemRegion(bottom(), end()));
   }
-
-  make_empty();
+  set_top(bottom());
   set_affiliation(FREE);
+
+  // Lastly, set region state to empty
+  make_empty();
 }
 
 // Upon return, this region has been recycled.  We try to recycle it.
 // We may fail if some other thread recycled it before we do.
 void ShenandoahHeapRegion::try_recycle_under_lock() {
   shenandoah_assert_heaplocked();
-  if (is_trash() && _recycling.try_set()) {
+  if (!is_trash()) {
+    return;
+  }
+  if (_recycling.try_set()) {
     if (is_trash()) {
       // At freeset rebuild time, which precedes recycling of collection set, we treat all cset regions as
       // part of capacity, as empty, as fully available, and as unaffiliated.  This provides short-lived optimism
@@ -609,6 +613,7 @@ void ShenandoahHeapRegion::try_recycle_under_lock() {
         os::naked_yield();
       }
     }
+    assert(!is_trash(), "Must not");
   }
 }
 
@@ -616,7 +621,10 @@ void ShenandoahHeapRegion::try_recycle_under_lock() {
 // some GC worker thread has taken responsibility to recycle the region, eventually.
 void ShenandoahHeapRegion::try_recycle() {
   shenandoah_assert_not_heaplocked();
-  if (is_trash() && _recycling.try_set()) {
+  if (!is_trash()) {
+    return;
+  }
+  if (_recycling.try_set()) {
     // Double check region state after win the race to set recycling flag
     if (is_trash()) {
       // At freeset rebuild time, which precedes recycling of collection set, we treat all cset regions as
@@ -840,7 +848,7 @@ void ShenandoahHeapRegion::set_state(RegionState to) {
     evt.set_to(to);
     evt.commit();
   }
-  _state.store_relaxed(to);
+  _state.release_store(to);
 }
 
 void ShenandoahHeapRegion::record_pin() {
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahHeapRegion.hpp b/src/hotspot/share/gc/shenandoah/shenandoahHeapRegion.hpp
index 569b64f756b..e27bbbb737d 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahHeapRegion.hpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahHeapRegion.hpp
@@ -218,7 +218,7 @@ public:
   bool is_alloc_allowed()          const { auto cur_state = state(); return is_empty_state(cur_state) || cur_state == _regular || cur_state == _pinned; }
   bool is_stw_move_allowed()       const { auto cur_state = state(); return cur_state == _regular || cur_state == _cset || (ShenandoahHumongousMoves && cur_state == _humongous_start); }
 
-  RegionState state()              const { return _state.load_relaxed(); }
+  RegionState state()              const { return _state.load_acquire(); }
   int  state_ordinal()             const { return region_state_to_ordinal(state()); }
 
   void record_pin();

From 8688c0b65516f0a035ae8d25790489981475d07f Mon Sep 17 00:00:00 2001
From: Anton Seoane Ampudia <aseoane@openjdk.org>
Date: Thu, 16 Apr 2026 11:18:22 +0000
Subject: [PATCH 622/655] 8379129: C2 crash in
 LoadNode::can_split_through_phi_base during Escape Analysis (JDK 25.0.1+8)

Reviewed-by: kvn, rcastanedalo, dlong
---
 src/hotspot/share/opto/memnode.cpp | 6 +++++-
 1 file changed, 5 insertions(+), 1 deletion(-)

diff --git a/src/hotspot/share/opto/memnode.cpp b/src/hotspot/share/opto/memnode.cpp
index c7fe4508473..a49d4708d32 100644
--- a/src/hotspot/share/opto/memnode.cpp
+++ b/src/hotspot/share/opto/memnode.cpp
@@ -1671,11 +1671,15 @@ bool LoadNode::can_split_through_phi_base(PhaseGVN* phase) {
   intptr_t ignore  = 0;
   Node*    base    = AddPNode::Ideal_base_and_offset(address, phase, ignore);
 
+  if (base == nullptr) {
+    return false;
+  }
+
   if (base->is_CastPP()) {
     base = base->in(1);
   }
 
-  if (req() > 3 || base == nullptr || !base->is_Phi()) {
+  if (req() > 3 || !base->is_Phi()) {
     return false;
   }
 

From 04bb3a91dbfb8fb9db93ea9609210e036a4c5d10 Mon Sep 17 00:00:00 2001
From: Matthew Donovan <mdonovan@openjdk.org>
Date: Thu, 16 Apr 2026 14:11:07 +0000
Subject: [PATCH 623/655] 8381176: Utilities.expectedNegoAppProtocol chooses
 client ALPN protocol over server's

Reviewed-by: djelinski, myankelevich
---
 .../net/ssl/TLSCommon/interop/Utilities.java  | 10 ++++-----
 .../javax/net/ssl/compatibility/AlpnTest.java | 21 ++++++++++++++++++-
 2 files changed, 25 insertions(+), 6 deletions(-)

diff --git a/test/jdk/javax/net/ssl/TLSCommon/interop/Utilities.java b/test/jdk/javax/net/ssl/TLSCommon/interop/Utilities.java
index 34cccb5356c..0a825d6cc7d 100644
--- a/test/jdk/javax/net/ssl/TLSCommon/interop/Utilities.java
+++ b/test/jdk/javax/net/ssl/TLSCommon/interop/Utilities.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2020, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -430,10 +430,10 @@ public class Utilities {
     public static String expectedNegoAppProtocol(String[] serverAppProtocols,
             String[] clientAppProtocols) {
         if (serverAppProtocols != null && clientAppProtocols != null) {
-            for(String clientAppProtocol : clientAppProtocols) {
-                for(String serverAppProtocol : serverAppProtocols) {
-                    if (clientAppProtocol.equals(serverAppProtocol)) {
-                        return clientAppProtocol;
+            for(String serverAppProtocol : serverAppProtocols) {
+                for(String clientAppProtocol : clientAppProtocols) {
+                    if (serverAppProtocol.equals(clientAppProtocol)) {
+                        return serverAppProtocol;
                     }
                 }
             }
diff --git a/test/jdk/javax/net/ssl/compatibility/AlpnTest.java b/test/jdk/javax/net/ssl/compatibility/AlpnTest.java
index 71a60fe5435..86b75f4d2c3 100644
--- a/test/jdk/javax/net/ssl/compatibility/AlpnTest.java
+++ b/test/jdk/javax/net/ssl/compatibility/AlpnTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2020, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2020, 2025, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -36,6 +36,8 @@
  * @run main/manual AlpnTest false
  */
 
+import jtreg.SkippedException;
+
 import java.util.ArrayList;
 import java.util.List;
 import java.util.Set;
@@ -98,6 +100,19 @@ public class AlpnTest extends ExtInteropTest {
                 clientCase.setCipherSuites(cipherSuite);
                 clientCase.setAppProtocols("h2");
 
+                testCases.add(
+                        new TestCase<ExtUseCase>(serverCase, clientCase));
+
+                serverCase = ExtUseCase.newInstance();
+                serverCase.setCertTuple(certTuple);
+                serverCase.setAppProtocols("http/1.1", "h2");
+
+                clientCase = ExtUseCase.newInstance();
+                clientCase.setCertTuple(certTuple);
+                clientCase.setProtocols(protocol);
+                clientCase.setCipherSuites(cipherSuite);
+                clientCase.setAppProtocols("h2", "http/1.1");
+
                 testCases.add(
                         new TestCase<ExtUseCase>(serverCase, clientCase));
             }
@@ -171,6 +186,10 @@ public class AlpnTest extends ExtInteropTest {
         Boolean defaultJdkAsServer = Boolean.valueOf(args[0]);
 
         Set<JdkInfo> jdkInfos = Utils.jdkInfoList();
+        if (jdkInfos.isEmpty()) {
+            throw new SkippedException("No JDKs to test");
+        }
+
         for (JdkInfo jdkInfo : jdkInfos) {
             AlpnTest test = new AlpnTest(
                     defaultJdkAsServer ? JdkInfo.DEFAULT : jdkInfo,

From 26df25ef2db23ce815ca8d3a1fc2f4018ece6a81 Mon Sep 17 00:00:00 2001
From: Vladimir Kozlov <kvn@openjdk.org>
Date: Thu, 16 Apr 2026 14:19:26 +0000
Subject: [PATCH 624/655] 8382045: Increase AOT C strings table size in not
 product VM

Reviewed-by: adinn, asmehra
---
 src/hotspot/share/code/aotCodeCache.cpp | 12 ++++++------
 src/hotspot/share/code/codeBlob.hpp     |  2 +-
 2 files changed, 7 insertions(+), 7 deletions(-)

diff --git a/src/hotspot/share/code/aotCodeCache.cpp b/src/hotspot/share/code/aotCodeCache.cpp
index c2838917516..d4f12936e96 100644
--- a/src/hotspot/share/code/aotCodeCache.cpp
+++ b/src/hotspot/share/code/aotCodeCache.cpp
@@ -2184,7 +2184,7 @@ void AOTCodeAddressTable::set_stubgen_stubs_complete() {
 #ifdef PRODUCT
 #define MAX_STR_COUNT 200
 #else
-#define MAX_STR_COUNT 500
+#define MAX_STR_COUNT 2000
 #endif
 #define _c_str_max  MAX_STR_COUNT
 static const int _c_str_base = _all_max;
@@ -2296,7 +2296,7 @@ const char* AOTCodeAddressTable::add_C_string(const char* str) {
 
 int AOTCodeAddressTable::id_for_C_string(address str) {
   if (str == nullptr) {
-    return -1;
+    return BAD_ADDRESS_ID;
   }
   MutexLocker ml(AOTCodeCStrings_lock, Mutex::_no_safepoint_check_flag);
   for (int i = 0; i < _C_strings_count; i++) {
@@ -2314,7 +2314,7 @@ int AOTCodeAddressTable::id_for_C_string(address str) {
       return id;
     }
   }
-  return -1;
+  return BAD_ADDRESS_ID;
 }
 
 address AOTCodeAddressTable::address_for_C_string(int idx) {
@@ -2381,13 +2381,13 @@ int AOTCodeAddressTable::id_for_address(address addr, RelocIterator reloc, CodeB
   }
   // Seach for C string
   id = id_for_C_string(addr);
-  if (id >= 0) {
+  if (id != BAD_ADDRESS_ID) {
     return id + _c_str_base;
   }
   if (StubRoutines::contains(addr) || CodeCache::find_blob(addr) != nullptr) {
     // Search for a matching stub entry
     id = search_address(addr, _stubs_addr, _stubs_max);
-    if (id < 0) {
+    if (id == BAD_ADDRESS_ID) {
       StubCodeDesc* desc = StubCodeDesc::desc_for(addr);
       if (desc == nullptr) {
         desc = StubCodeDesc::desc_for(addr + frame::pc_return_offset);
@@ -2400,7 +2400,7 @@ int AOTCodeAddressTable::id_for_address(address addr, RelocIterator reloc, CodeB
   } else {
     // Search in runtime functions
     id = search_address(addr, _extrs_addr, _extrs_length);
-    if (id < 0) {
+    if (id == BAD_ADDRESS_ID) {
       ResourceMark rm;
       const int buflen = 1024;
       char* func_name = NEW_RESOURCE_ARRAY(char, buflen);
diff --git a/src/hotspot/share/code/codeBlob.hpp b/src/hotspot/share/code/codeBlob.hpp
index d372e72fc23..709623de308 100644
--- a/src/hotspot/share/code/codeBlob.hpp
+++ b/src/hotspot/share/code/codeBlob.hpp
@@ -226,7 +226,7 @@ public:
   nmethod* as_nmethod() const                 { assert(is_nmethod(), "must be nmethod"); return (nmethod*) this; }
   CodeBlob* as_codeblob() const               { return (CodeBlob*) this; }
   // we may want to force an actual buffer blob or subtype instance
-  BufferBlob* as_buffer_blob(bool strict = true) const { assert(is_buffer_blob(), "must be %sbuffer blob", (strict ? "strict " : "")); return (BufferBlob*) this; }
+  BufferBlob* as_buffer_blob(bool strict = true) const { assert(is_buffer_blob(strict), "must be %sbuffer blob", (strict ? "strict " : "")); return (BufferBlob*) this; }
   AdapterBlob* as_adapter_blob() const        { assert(is_adapter_blob(), "must be adapter blob"); return (AdapterBlob*) this; }
   ExceptionBlob* as_exception_blob() const    { assert(is_exception_stub(), "must be exception stub"); return (ExceptionBlob*) this; }
   // this will always return a subtype instance

From 91cde7f160f46d04caa08781eed331875532bce1 Mon Sep 17 00:00:00 2001
From: Yasumasa Suenaga <ysuenaga@openjdk.org>
Date: Thu, 16 Apr 2026 14:42:01 +0000
Subject: [PATCH 625/655] 8382327: Disable some SA tests for mixed jstack on
 musl C

Reviewed-by: mbaesken, kevinw
---
 test/hotspot/jtreg/serviceability/sa/ClhsdbPstack.java   | 4 ++++
 .../jtreg/serviceability/sa/TestJhsdbJstackMixed.java    | 6 ++++++
 .../serviceability/sa/TestJhsdbJstackMixedWithXComp.java | 9 ++++++++-
 .../serviceability/sa/TestJhsdbJstackPrintVMLocks.java   | 5 +++++
 4 files changed, 23 insertions(+), 1 deletion(-)

diff --git a/test/hotspot/jtreg/serviceability/sa/ClhsdbPstack.java b/test/hotspot/jtreg/serviceability/sa/ClhsdbPstack.java
index 51738be3554..6921a7ec0ca 100644
--- a/test/hotspot/jtreg/serviceability/sa/ClhsdbPstack.java
+++ b/test/hotspot/jtreg/serviceability/sa/ClhsdbPstack.java
@@ -54,6 +54,10 @@ import jtreg.SkippedException;
 public class ClhsdbPstack {
 
     public static void main(String[] args) throws Exception {
+        if (Platform.isMusl()) {
+            throw new SkippedException("This test does not work on musl libc.");
+        }
+
         boolean withCore = Boolean.parseBoolean(args[0]);
         System.out.println("Starting ClhsdbPstack test: withCore==" + withCore);
 
diff --git a/test/hotspot/jtreg/serviceability/sa/TestJhsdbJstackMixed.java b/test/hotspot/jtreg/serviceability/sa/TestJhsdbJstackMixed.java
index e3808aa6706..a5750edf360 100644
--- a/test/hotspot/jtreg/serviceability/sa/TestJhsdbJstackMixed.java
+++ b/test/hotspot/jtreg/serviceability/sa/TestJhsdbJstackMixed.java
@@ -33,6 +33,8 @@ import jdk.test.lib.Utils;
 import jdk.test.lib.apps.LingeredApp;
 import jdk.test.lib.process.OutputAnalyzer;
 
+import jtreg.SkippedException;
+
 /**
  * @test
  * @key randomness
@@ -174,6 +176,10 @@ public class TestJhsdbJstackMixed {
     }
 
     public static void main(String... args) throws Exception {
+        if (Platform.isMusl()) {
+            throw new SkippedException("This test does not work on musl libc.");
+        }
+
         SATestUtils.skipIfCannotAttach(); // throws SkippedException if attach not expected to work.
         LingeredApp app = null;
 
diff --git a/test/hotspot/jtreg/serviceability/sa/TestJhsdbJstackMixedWithXComp.java b/test/hotspot/jtreg/serviceability/sa/TestJhsdbJstackMixedWithXComp.java
index a3880bc9f0e..70a9e67e406 100644
--- a/test/hotspot/jtreg/serviceability/sa/TestJhsdbJstackMixedWithXComp.java
+++ b/test/hotspot/jtreg/serviceability/sa/TestJhsdbJstackMixedWithXComp.java
@@ -1,6 +1,6 @@
 /*
  * Copyright (c) 2025, 2026, Oracle and/or its affiliates. All rights reserved.
- * Copyright (c) 2025, NTT DATA
+ * Copyright (c) 2025, 2026, NTT DATA
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -27,11 +27,14 @@ import java.util.Arrays;
 import java.util.List;
 
 import jdk.test.lib.JDKToolLauncher;
+import jdk.test.lib.Platform;
 import jdk.test.lib.SA.SATestUtils;
 import jdk.test.lib.Utils;
 import jdk.test.lib.apps.LingeredApp;
 import jdk.test.lib.process.OutputAnalyzer;
 
+import jtreg.SkippedException;
+
 /**
  * @test id=xcomp
  * @bug 8370176
@@ -111,6 +114,10 @@ public class TestJhsdbJstackMixedWithXComp {
     }
 
     public static void main(String... args) throws Exception {
+        if (Platform.isMusl()) {
+            throw new SkippedException("This test does not work on musl libc.");
+        }
+
         SATestUtils.skipIfCannotAttach(); // throws SkippedException if attach not expected to work.
         LingeredApp app = null;
 
diff --git a/test/hotspot/jtreg/serviceability/sa/TestJhsdbJstackPrintVMLocks.java b/test/hotspot/jtreg/serviceability/sa/TestJhsdbJstackPrintVMLocks.java
index f6580d71e05..e0774917f80 100644
--- a/test/hotspot/jtreg/serviceability/sa/TestJhsdbJstackPrintVMLocks.java
+++ b/test/hotspot/jtreg/serviceability/sa/TestJhsdbJstackPrintVMLocks.java
@@ -22,6 +22,7 @@
  */
 
 import jdk.test.lib.JDKToolLauncher;
+import jdk.test.lib.Platform;
 import jdk.test.lib.SA.SATestUtils;
 import jdk.test.lib.apps.LingeredApp;
 import jdk.test.lib.process.OutputAnalyzer;
@@ -43,6 +44,10 @@ public class TestJhsdbJstackPrintVMLocks {
 
     final static int MAX_ATTEMPTS = 5;
     public static void main(String[] args) throws Exception {
+        if (Platform.isMusl()) {
+            throw new SkippedException("This test does not work on musl libc.");
+        }
+
         SATestUtils.skipIfCannotAttach(); // throws SkippedException if attach not expected to work.
 
         LingeredApp theApp = null;

From 35ad47b4c09d0812f3f7c57ac7932c1533790fc1 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Hannes=20Walln=C3=B6fer?= <hannesw@openjdk.org>
Date: Thu, 16 Apr 2026 14:42:20 +0000
Subject: [PATCH 626/655] 8373922: Enhance Taglet API to support relative URLs
 8379520: Make use of new Taglet.toString method in JDK build taglets

Reviewed-by: liach
---
 make/Docs.gmk                                 |   9 +-
 .../src/classes/build/tools/taglet/JSpec.java |  26 +-
 .../build/tools/taglet/SealedGraph.java       |  58 +++--
 .../classes/build/tools/taglet/ToolGuide.java |  29 +--
 .../jdk/javadoc/doclet/StandardDoclet.java    |   4 +-
 .../classes/jdk/javadoc/doclet/Taglet.java    |  66 ++++-
 .../formats/html/HtmlDocletWriter.java        |   6 +-
 .../formats/html/taglets/UserTaglet.java      |  14 +-
 .../TestRelativeURLTaglet.java                | 229 ++++++++++++++++++
 9 files changed, 344 insertions(+), 97 deletions(-)
 create mode 100644 test/langtools/jdk/javadoc/doclet/testRelativeURLTaglet/TestRelativeURLTaglet.java

diff --git a/make/Docs.gmk b/make/Docs.gmk
index a8d40e078e2..9cee8cd40c1 100644
--- a/make/Docs.gmk
+++ b/make/Docs.gmk
@@ -1,4 +1,4 @@
-# Copyright (c) 1997, 2025, Oracle and/or its affiliates. All rights reserved.
+# Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
 # DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
 #
 # This code is free software; you can redistribute it and/or modify it
@@ -93,19 +93,16 @@ JAVADOC_DISABLED_DOCLINT_WARNINGS := missing
 JAVADOC_DISABLED_DOCLINT_PACKAGES := org.w3c.* javax.smartcardio
 
 # The initial set of options for javadoc
-# -XDaccessInternalAPI is a temporary workaround, see 8373909
 JAVADOC_OPTIONS := -use -keywords -notimestamp \
     -serialwarn -encoding utf-8 -docencoding utf-8 -breakiterator \
     -splitIndex --system none -javafx --expand-requires transitive \
-    --override-methods=summary \
-    -XDaccessInternalAPI
+    --override-methods=summary
 
 # The reference options must stay stable to allow for comparisons across the
 # development cycle.
 REFERENCE_OPTIONS := -XDignore.symbol.file=true -use -keywords -notimestamp \
     -serialwarn -encoding utf-8 -breakiterator -splitIndex --system none \
-    -html5 -javafx --expand-requires transitive \
-    -XDaccessInternalAPI
+    -html5 -javafx --expand-requires transitive
 
 # Should we add DRAFT stamps to the generated javadoc?
 ifeq ($(VERSION_IS_GA), true)
diff --git a/make/jdk/src/classes/build/tools/taglet/JSpec.java b/make/jdk/src/classes/build/tools/taglet/JSpec.java
index 7e1e0ca215e..196aaccb32b 100644
--- a/make/jdk/src/classes/build/tools/taglet/JSpec.java
+++ b/make/jdk/src/classes/build/tools/taglet/JSpec.java
@@ -25,13 +25,13 @@
 
 package build.tools.taglet;
 
+import java.net.URI;
 import java.util.EnumSet;
 import java.util.List;
 import java.util.Set;
 import java.util.regex.Matcher;
 import java.util.regex.Pattern;
 import java.util.stream.Collectors;
-import java.lang.reflect.Field;
 
 import javax.lang.model.element.Element;
 
@@ -141,6 +141,11 @@ public class JSpec implements Taglet  {
 
     @Override
     public String toString(List<? extends DocTree> tags, Element elem) {
+        throw new UnsupportedOperationException();
+    }
+
+    // @Override - requires JDK-8373922 in build JDK
+    public String toString(List<? extends DocTree> tags, Element elem, URI docRoot) {
 
         if (tags.isEmpty())
             return "";
@@ -177,7 +182,7 @@ public class JSpec implements Taglet  {
                 String preview = m.group("preview"); // null if no preview feature
                 String chapter = m.group("chapter");
                 String section = m.group("section");
-                String rootParent = currentPath().replaceAll("[^/]+", "..");
+                String rootParent = docRoot.resolve("..").toString();
 
                 String url = preview == null ?
                         String.format("%1$s/specs/%2$s/%2$s-%3$s.html#%2$s-%3$s%4$s",
@@ -230,23 +235,6 @@ public class JSpec implements Taglet  {
         return sb.toString();
     }
 
-    private static ThreadLocal<String> CURRENT_PATH = null;
-
-    private String currentPath() {
-        if (CURRENT_PATH == null) {
-            try {
-                Field f = Class.forName("jdk.javadoc.internal.doclets.formats.html.HtmlDocletWriter")
-                               .getField("CURRENT_PATH");
-                @SuppressWarnings("unchecked")
-                ThreadLocal<String> tl = (ThreadLocal<String>) f.get(null);
-                CURRENT_PATH = tl;
-            } catch (ReflectiveOperationException e) {
-                throw new RuntimeException("Cannot determine current path", e);
-            }
-        }
-        return CURRENT_PATH.get();
-    }
-
     private String expand(List<? extends DocTree> trees) {
         return (new SimpleDocTreeVisitor<StringBuilder, StringBuilder>() {
             public StringBuilder defaultAction(DocTree tree, StringBuilder sb) {
diff --git a/make/jdk/src/classes/build/tools/taglet/SealedGraph.java b/make/jdk/src/classes/build/tools/taglet/SealedGraph.java
index 2ffd92e3409..300999b77c0 100644
--- a/make/jdk/src/classes/build/tools/taglet/SealedGraph.java
+++ b/make/jdk/src/classes/build/tools/taglet/SealedGraph.java
@@ -32,7 +32,9 @@ import jdk.javadoc.doclet.Taglet;
 
 import javax.lang.model.element.*;
 import javax.lang.model.type.DeclaredType;
+import javax.lang.model.util.Elements;
 import java.io.IOException;
+import java.net.URI;
 import java.nio.file.Files;
 import java.nio.file.Path;
 import java.util.*;
@@ -78,6 +80,11 @@ public final class SealedGraph implements Taglet {
 
     @Override
     public String toString(List<? extends DocTree> tags, Element element) {
+        throw new UnsupportedOperationException();
+    }
+
+    // @Override - requires JDK-8373922 in build JDK
+    public String toString(List<? extends DocTree> tags, Element element, URI docRoot) {
         if (sealedDotOutputDir == null || sealedDotOutputDir.isEmpty()) {
             return "";
         }
@@ -85,9 +92,15 @@ public final class SealedGraph implements Taglet {
             return "";
         }
 
-        ModuleElement module = docletEnvironment.getElementUtils().getModuleOf(element);
+        Elements util = docletEnvironment.getElementUtils();
+        ModuleElement module = util.getModuleOf(element);
+
+        // '.' in .DOT file name is converted to '/' in .SVG path, so we use '-' as separator for nested classes.
+        // module_package.subpackage.Outer-Inner.dot => module/package/subpackage/Outer-Inner-sealed-graph.svg
         Path dotFile = Path.of(sealedDotOutputDir,
-                module.getQualifiedName() + "_" + typeElement.getQualifiedName() + ".dot");
+                module.getQualifiedName() + "_"
+                        + util.getPackageOf(element).getQualifiedName() + "."
+                        + packagelessCanonicalName(typeElement).replace(".", "-") + ".dot");
 
         Set<String> exports = module.getDirectives().stream()
                 .filter(ModuleElement.ExportsDirective.class::isInstance)
@@ -99,7 +112,7 @@ public final class SealedGraph implements Taglet {
                 .map(Objects::toString)
                 .collect(Collectors.toUnmodifiableSet());
 
-        String dotContent = new Renderer().graph(typeElement, exports);
+        String dotContent = new Renderer().graph(typeElement, exports, docRoot);
 
         try  {
             Files.writeString(dotFile, dotContent, WRITE, CREATE, TRUNCATE_EXISTING);
@@ -107,8 +120,8 @@ public final class SealedGraph implements Taglet {
             throw new RuntimeException(e);
         }
 
-        String simpleTypeName = packagelessCanonicalName(typeElement).replace('.', '/');
-        String imageFile = simpleTypeName + "-sealed-graph.svg";
+        String simpleTypeName = packagelessCanonicalName(typeElement);
+        String imageFile = simpleTypeName.replace(".", "-") + "-sealed-graph.svg";
         int thumbnailHeight = 100; // also appears in the stylesheet
         String hoverImage = "<span>"
             + getImage(simpleTypeName, imageFile, -1, true)
@@ -137,12 +150,12 @@ public final class SealedGraph implements Taglet {
     private final class Renderer {
 
         // Generates a graph in DOT format
-        String graph(TypeElement rootClass, Set<String> exports) {
+        String graph(TypeElement rootClass, Set<String> exports, URI pathToRoot) {
             if (!isInPublicApi(rootClass, exports)) {
                 // Alternatively we can return "" for the graph since there is no single root to render
                 throw new IllegalArgumentException("Root not in public API: " + rootClass.getQualifiedName());
             }
-            final State state = new State(rootClass);
+            final State state = new State(pathToRoot);
             traverse(state, rootClass, exports);
             return state.render();
         }
@@ -168,7 +181,7 @@ public final class SealedGraph implements Taglet {
             private static final String TOOLTIP = "tooltip";
             private static final String LINK = "href";
 
-            private final TypeElement rootNode;
+            private final URI pathToRoot;
 
             private final StringBuilder builder;
 
@@ -193,8 +206,8 @@ public final class SealedGraph implements Taglet {
                 }
             }
 
-            public State(TypeElement rootNode) {
-                this.rootNode = rootNode;
+            public State(URI pathToRoot) {
+                this.pathToRoot = pathToRoot;
                 nodeStyleMap = new LinkedHashMap<>();
                 builder = new StringBuilder()
                         .append("digraph G {")
@@ -217,24 +230,15 @@ public final class SealedGraph implements Taglet {
                 var styles = nodeStyleMap.computeIfAbsent(id(node), n -> new LinkedHashMap<>());
                 styles.put(LABEL, new StyleItem.PlainString(node.getSimpleName().toString()));
                 styles.put(TOOLTIP, new StyleItem.PlainString(node.getQualifiedName().toString()));
-                styles.put(LINK, new StyleItem.PlainString(relativeLink(node)));
+                styles.put(LINK, new StyleItem.PlainString(pathToRoot.resolve(relativeLink(node)).toString()));
             }
 
-            // A permitted class must be in the same package or in the same module.
-            // This implies the module is always the same.
             private String relativeLink(TypeElement node) {
                 var util = SealedGraph.this.docletEnvironment.getElementUtils();
-                var nodePackage = util.getPackageOf(node);
-                // Note: SVG files for nested types use the simple names of containing types as parent directories.
-                // We therefore need to convert all dots in the qualified name to "../" below.
-                var backNavigator = rootNode.getQualifiedName().toString().chars()
-                        .filter(c -> c == '.')
-                        .mapToObj(c -> "../")
-                        .collect(joining());
-                var forwardNavigator = nodePackage.getQualifiedName().toString()
-                        .replace(".", "/");
+                var path = util.getModuleOf(node).getQualifiedName().toString() + "/"
+                        + util.getPackageOf(node).getQualifiedName().toString().replace(".", "/");
 
-                return backNavigator + forwardNavigator + "/" + packagelessCanonicalName(node) + ".html";
+                return path + "/" + packagelessCanonicalName(node) + ".html";
             }
 
             public void addEdge(TypeElement node, TypeElement subNode) {
@@ -286,14 +290,6 @@ public final class SealedGraph implements Taglet {
             private String quotedId(TypeElement node) {
                 return "\"" + id(node) + "\"";
             }
-
-            private String simpleName(String name) {
-                int lastDot = name.lastIndexOf('.');
-                return lastDot < 0
-                        ? name
-                        : name.substring(lastDot);
-            }
-
         }
 
         private static List<TypeElement> permittedSubclasses(TypeElement node, Set<String> exports) {
diff --git a/make/jdk/src/classes/build/tools/taglet/ToolGuide.java b/make/jdk/src/classes/build/tools/taglet/ToolGuide.java
index 8db2aee3092..7ad4f6b9b9f 100644
--- a/make/jdk/src/classes/build/tools/taglet/ToolGuide.java
+++ b/make/jdk/src/classes/build/tools/taglet/ToolGuide.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2017, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2017, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,13 +25,13 @@
 
 package build.tools.taglet;
 
+import java.net.URI;
 import java.util.EnumSet;
 import java.util.List;
 import java.util.Set;
 import java.util.regex.Matcher;
 import java.util.regex.Pattern;
 import java.util.stream.Collectors;
-import java.lang.reflect.Field;
 
 import javax.lang.model.element.Element;
 
@@ -91,6 +91,11 @@ public class ToolGuide implements Taglet {
 
     @Override
     public String toString(List<? extends DocTree> tags, Element elem) {
+        throw new UnsupportedOperationException();
+    }
+
+    // @Override - requires JDK-8373922 in build JDK
+    public String toString(List<? extends DocTree> tags, Element elem, URI docRoot) {
 
         if (tags.isEmpty())
             return "";
@@ -118,7 +123,7 @@ public class ToolGuide implements Taglet {
                 if (label.isEmpty()) {
                     label = name;
                 }
-                String rootParent = currentPath().replaceAll("[^/]+", "..");
+                String rootParent = docRoot.resolve("..").toString();
 
                 String url = String.format("%s/%s/%s.html",
                         rootParent, BASE_URL, name);
@@ -141,22 +146,4 @@ public class ToolGuide implements Taglet {
 
         return sb.toString();
     }
-
-    private static ThreadLocal<String> CURRENT_PATH = null;
-
-    private String currentPath() {
-        if (CURRENT_PATH == null) {
-            try {
-                Field f = Class.forName("jdk.javadoc.internal.doclets.formats.html.HtmlDocletWriter")
-                               .getField("CURRENT_PATH");
-                @SuppressWarnings("unchecked")
-                ThreadLocal<String> tl = (ThreadLocal<String>) f.get(null);
-                CURRENT_PATH = tl;
-            } catch (ReflectiveOperationException e) {
-                throw new RuntimeException("Cannot determine current path", e);
-            }
-        }
-        return CURRENT_PATH.get();
-    }
-
 }
diff --git a/src/jdk.javadoc/share/classes/jdk/javadoc/doclet/StandardDoclet.java b/src/jdk.javadoc/share/classes/jdk/javadoc/doclet/StandardDoclet.java
index 8f5fec1e4b9..90511db8053 100644
--- a/src/jdk.javadoc/share/classes/jdk/javadoc/doclet/StandardDoclet.java
+++ b/src/jdk.javadoc/share/classes/jdk/javadoc/doclet/StandardDoclet.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -48,7 +48,7 @@ import jdk.javadoc.internal.doclets.formats.html.HtmlDoclet;
  * in documentation comments.
  *
  * Taglets invoked by the standard doclet must return strings from
- * {@link Taglet#toString(List,Element) Taglet.toString} as follows:
+ * {@link Taglet#toString(List,Element,java.net.URI) Taglet.toString} as follows:
  *
  * <dl>
  * <dt> <i>Inline Tags</i>
diff --git a/src/jdk.javadoc/share/classes/jdk/javadoc/doclet/Taglet.java b/src/jdk.javadoc/share/classes/jdk/javadoc/doclet/Taglet.java
index 1ad67a89fef..ec079047dfa 100644
--- a/src/jdk.javadoc/share/classes/jdk/javadoc/doclet/Taglet.java
+++ b/src/jdk.javadoc/share/classes/jdk/javadoc/doclet/Taglet.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2001, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2001, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,6 +25,7 @@
 
 package jdk.javadoc.doclet;
 
+import java.net.URI;
 import java.util.List;
 import java.util.Set;
 
@@ -34,7 +35,7 @@ import com.sun.source.doctree.DocTree;
 
 /**
  * The interface for a custom taglet supported by doclets such as
- * the {@link jdk.javadoc.doclet.StandardDoclet standard doclet}.
+ * the {@linkplain StandardDoclet standard doclet}.
  * Custom taglets are used to handle custom tags in documentation
  * comments; custom tags can be instantiated individually as either
  * <i>block tags</i>, which appear at the end of a comment,
@@ -55,10 +56,10 @@ import com.sun.source.doctree.DocTree;
  *      {@link #isInlineTag() isInlineTag}, to determine the characteristics
  *      of the tags supported by the taglet.
  * <li> As appropriate, the doclet calls the
- *      {@link #toString(List,Element) toString} method on the taglet object,
- *      giving it a list of tags and the element for which the tags are part
- *      of the element's documentation comment, from which the taglet can
- *      determine the string to be included in the documentation.
+ *      {@link #toString(List,Element,URI) toString} method on the taglet object,
+ *      giving it a list of tags, the element whose documentation comment contains
+ *      the tags, and the root URI of the generated output, from which the taglet
+ *      can determine the string to be included in the documentation.
  *      The doclet will typically specify any requirements on the contents of
  *      the string that is returned.
  * </ol>
@@ -126,25 +127,70 @@ public interface Taglet {
     default void init(DocletEnvironment env, Doclet doclet) { }
 
     /**
-     * Returns the string representation of a series of instances of
-     * this tag to be included in the generated output.
+     * Returns the string representation of the specified instances of this tag
+     * to be included in the generated output.
      *
-     * <p>If this taglet supports {@link #isInlineTag inline} tags, it will
+     * <p>If this taglet supports {@link #isInlineTag inline} tags, this method will
      * be called once per instance of the inline tag, each time with a singleton list.
      * If this taglet supports {@link #isBlockTag block} tags, it will be called once
      * for each comment containing instances of block tags, with a list of all the instances
      * of the block tag in that comment.
      *
+     * @apiNote Taglets that do not need the root URI of the generated output may
+     * implement this method only. Taglets that require the root URI to link to other
+     * doclet-generated resources should override {@link #toString(List, Element, URI)},
+     * and optionally throw an exception in the implementation of this method.
+     *
      * @param tags the list of instances of this tag
      * @param element the element to which the enclosing comment belongs
      * @return the string representation of the tags to be included in
      *  the generated output
-     *
+     * @throws UnsupportedOperationException if {@link #toString(List, Element, URI)}
+     *      should be invoked instead
      * @see <a href="StandardDoclet.html#user-defined-taglets">User-Defined Taglets
      *      for the Standard Doclet</a>
+     * @see #toString(List, Element, URI)
      */
     String toString(List<? extends DocTree> tags, Element element);
 
+    /**
+     * Returns the string representation of the specified instances of this tag
+     * to be included in the generated output.
+     *
+     * <p>If this taglet supports {@link #isInlineTag inline} tags, this method will
+     * be called once per instance of the inline tag, each time with a singleton list.
+     * If this taglet supports {@link #isBlockTag block} tags, it will be called once
+     * for each comment containing instances of block tags, with a list of all the instances
+     * of the block tag in that comment.
+     *
+     * <p>The {@code docRoot} argument identifies the root of the generated output
+     * as seen by the current resource, and may be used to {@linkplain URI#resolve(String)
+     * resolve} links to other resources generated by the doclet.
+     *
+     * @apiNote The exact form of {@code docRoot} is doclet-specific. For the
+     * {@linkplain StandardDoclet standard doclet}, it is a relative URI from
+     * the current resource to the root directory of the generated output.
+     * Taglets intended for use with other doclets should check the validity
+     * of the {@code docRoot} argument as appropriate.
+     *
+     * @implSpec The default implementation invokes {@link #toString(List, Element)
+     * toString(tags, element)}.
+     *
+     * @param tags the list of instances of this tag
+     * @param element the element to which the enclosing comment belongs
+     * @param docRoot the root URI of the generated output
+     * @return the string representation of the tags to be included in
+     *  the generated output
+     * @throws IllegalArgumentException if {@code docRoot} is not a valid URI
+     * @see <a href="StandardDoclet.html#user-defined-taglets">User-Defined Taglets
+     *      for the Standard Doclet</a>
+     * @see #toString(List, Element)
+     * @since 27
+     */
+    default String toString(List<? extends DocTree> tags, Element element, URI docRoot) {
+        return toString(tags, element);
+    }
+
     /**
      * The kind of location in which a tag may be used.
      */
diff --git a/src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclets/formats/html/HtmlDocletWriter.java b/src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclets/formats/html/HtmlDocletWriter.java
index 86ac3a892fd..594c36c4af2 100644
--- a/src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclets/formats/html/HtmlDocletWriter.java
+++ b/src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclets/formats/html/HtmlDocletWriter.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1998, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1998, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -243,12 +243,8 @@ public abstract class HtmlDocletWriter {
         if (generating) {
             writeGenerating();
         }
-        CURRENT_PATH.set(path.getPath());
     }
 
-    /** Temporary workaround to share current path with taglets, see 8373909 */
-    public static final ThreadLocal<String> CURRENT_PATH = new ThreadLocal<>();
-
     /**
      * The top-level method to generate and write the page represented by this writer.
      *
diff --git a/src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclets/formats/html/taglets/UserTaglet.java b/src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclets/formats/html/taglets/UserTaglet.java
index d1884c53ccf..8d54aa0585b 100644
--- a/src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclets/formats/html/taglets/UserTaglet.java
+++ b/src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclets/formats/html/taglets/UserTaglet.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -25,6 +25,7 @@
 
 package jdk.javadoc.internal.doclets.formats.html.taglets;
 
+import java.net.URI;
 import java.util.List;
 import java.util.Set;
 
@@ -70,7 +71,8 @@ public final class UserTaglet implements Taglet {
     @Override
     public Content getInlineTagOutput(Element element, DocTree tag, TagletWriter tagletWriter) {
         Content output = tagletWriter.getOutputInstance();
-        output.add(RawHtml.of(userTaglet.toString(List.of(tag), element)));
+        URI pathToRoot = getPathToRoot(tagletWriter);
+        output.add(RawHtml.of(userTaglet.toString(List.of(tag), element, pathToRoot)));
         return output;
     }
 
@@ -80,11 +82,17 @@ public final class UserTaglet implements Taglet {
         var utils = tagletWriter.utils;
         List<? extends DocTree> tags = utils.getBlockTags(holder, getName());
         if (!tags.isEmpty()) {
-            String tagString = userTaglet.toString(tags, holder);
+            URI pathToRoot = getPathToRoot(tagletWriter);
+            String tagString = userTaglet.toString(tags, holder, pathToRoot);
             if (tagString != null) {
                 output.add(RawHtml.of(tagString));
             }
         }
         return output;
     }
+
+    private URI getPathToRoot(TagletWriter tagletWriter) {
+        var path = tagletWriter.htmlWriter.pathToRoot.getPath();
+        return URI.create(path.isEmpty() || path.endsWith("/") ? path : path + "/");
+    }
 }
diff --git a/test/langtools/jdk/javadoc/doclet/testRelativeURLTaglet/TestRelativeURLTaglet.java b/test/langtools/jdk/javadoc/doclet/testRelativeURLTaglet/TestRelativeURLTaglet.java
new file mode 100644
index 00000000000..72b1de22cd2
--- /dev/null
+++ b/test/langtools/jdk/javadoc/doclet/testRelativeURLTaglet/TestRelativeURLTaglet.java
@@ -0,0 +1,229 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+/*
+ * @test
+ * @bug      8373922
+ * @summary  Enhance Taglet API to support relative URLs
+ * @library /tools/lib ../../lib
+ * @modules jdk.javadoc/jdk.javadoc.internal.tool
+ *          jdk.compiler/com.sun.tools.javac.api
+ *          jdk.compiler/com.sun.tools.javac.main
+ * @build toolbox.ToolBox javadoc.tester.*
+ * @run main TestRelativeURLTaglet
+ */
+
+import java.net.URI;
+import java.nio.file.Path;
+import java.util.EnumSet;
+import java.util.List;
+import java.util.Set;
+import java.util.stream.Collectors;
+
+import javax.lang.model.element.Element;
+
+import com.sun.source.doctree.DocTree;
+import com.sun.source.doctree.UnknownBlockTagTree;
+import com.sun.source.doctree.UnknownInlineTagTree;
+import javadoc.tester.JavadocTester;
+import jdk.javadoc.doclet.Taglet;
+import toolbox.ModuleBuilder;
+import toolbox.ToolBox;
+
+public class TestRelativeURLTaglet extends JavadocTester implements Taglet {
+
+    public static void main(String... args) throws Exception {
+        new TestRelativeURLTaglet().runTests();
+    }
+
+    ToolBox tb = new ToolBox();
+
+    @Test
+    public void testRelativePackageURL(Path base) throws Exception {
+        Path src = base.resolve("src");
+        tb.writeJavaFiles(src, """
+                package p.q;
+                /**
+                 * First {@test sentence}.
+                 */
+                 public interface A {}
+                """,
+                """
+                package p.q.r;
+                /**
+                 * Comment {@test with} inline {@test tags}.
+                 *
+                 * @test 123
+                 * @test 456
+                 */
+                 public class C {}
+                """);
+        tb.writeFile(src.resolve("p/q/doc-files/test.html"), """
+                <html>
+                <body>
+                HTML {@test file} with {@test inline} tags.
+                </body>
+                </html>
+                """);
+
+        javadoc("-d", base.resolve("out").toString(),
+                "--source-path", src.toString(),
+                "-tagletpath", System.getProperty("test.class.path"),
+                "-taglet", "TestRelativeURLTaglet",
+                "-subpackages", "p");
+        checkExit(Exit.OK);
+
+        checkOutput("p/q/A.html", true,
+                "First ../../sentence.");
+        checkOutput("p/q/package-summary.html", true,
+                "First ../../sentence.");
+        checkOutput("p/q/doc-files/test.html", true,
+                "HTML ../../../file with ../../../inline tags.");
+        checkOutput("p/q/r/C.html", true,
+                "Comment ../../../with inline ../../../tags.",
+                "../../../123 ../../../456");
+        checkOutput("p/q/r/package-summary.html", true,
+                "Comment ../../../with inline ../../../tags.");
+        checkOutput("index-all.html", true,
+                "First sentence.",
+                "Comment with inline tags.");
+        checkOutput("allclasses-index.html", true,
+                "First sentence.",
+                "Comment with inline tags.");
+    }
+
+    @Test
+    public void testRelativeModuleURL(Path base) throws Exception {
+        Path src = base.resolve("src");
+        new ModuleBuilder(tb, "ma")
+                .comment("Module {@test ma}.")
+                .classes(
+                    """
+                    /**
+                     * Package {@test ma/p/a}.
+                     */
+                     package p.a;
+                    """,
+                    """
+                    package p.a;
+                    /**
+                     * Class in {@test ma/p/a}.
+                     *
+                     * @test block1
+                     * @test block2
+                     */
+                    public class A {}
+                    """)
+                .exports("p.a")
+                .write(src);
+
+        javadoc("-d", base.resolve("out").toString(),
+                "--module-source-path", src.toString(),
+                "-tagletpath", System.getProperty("test.class.path"),
+                "-taglet", "TestRelativeURLTaglet",
+                "--module", "ma");
+        checkExit(Exit.OK);
+
+        checkOutput("ma/p/a/package-summary.html", true,
+                "Package ../../../ma/p/a.",
+                "Class in ../../../ma/p/a.");
+        checkOutput("ma/p/a/A.html", true,
+                "Class in ../../../ma/p/a.",
+                "<dl class=\"notes\">../../../block1 ../../../block2</dl>");
+        checkOutput("ma/module-summary.html", true,
+                "Module ../ma.",
+                "Package ../ma/p/a.");
+        checkOutput("index-all.html", true,
+                "Class in ma/p/a.",
+                "Module ma.",
+                "Package ma/p/a.");
+    }
+
+    @Test
+    public void testUnnamedPackageURL(Path base) throws Exception {
+        Path src = base.resolve("src");
+        tb.writeJavaFiles(src, """
+                /**
+                 * Class in unnamed package: {@test tag}.
+                 *
+                 * @test first
+                 * @test second
+                 */
+                 public class C {}
+                """);
+
+        javadoc("-d", base.resolve("out").toString(),
+                "--source-path", src.toString(),
+                "-tagletpath", System.getProperty("test.class.path"),
+                "-taglet", "TestRelativeURLTaglet",
+                src.resolve("C.java").toString());
+        checkExit(Exit.OK);
+
+        checkOutput("C.html", true,
+                "Class in unnamed package: tag.",
+                "<dl class=\"notes\">first second</dl>");
+        checkOutput("index-all.html", true,
+                "Class in unnamed package: tag.");
+        checkOutput("allclasses-index.html", true,
+                "Class in unnamed package: tag.");
+    }
+
+    // Taglet implementation
+
+    @Override
+    public Set<Location> getAllowedLocations() {
+        return EnumSet.allOf(Location.class);
+    }
+
+    @Override
+    public boolean isInlineTag() {
+        return true;
+    }
+
+    @Override
+    public boolean isBlockTag() {
+        return true;
+    }
+
+    @Override
+    public String getName() {
+        return "test";
+    }
+
+    @Override
+    public String toString(List<? extends DocTree> tags, Element element, URI docRoot) {
+        if (tags.size() == 1 && tags.getFirst() instanceof UnknownInlineTagTree uit) {
+            return docRoot.resolve(uit.getContent().toString()).toString();
+        } else {
+            return tags.stream()
+                    .map(t -> docRoot.resolve(((UnknownBlockTagTree) t).getContent().toString()).toString())
+                    .collect(Collectors.joining(" "));
+        }
+    }
+
+    @Override
+    public String toString(List<? extends DocTree> tags, Element element) {
+        throw new UnsupportedOperationException();
+    }
+}
+

From 8aafaf07e90264f8fef8b0a09cce50e5371c6103 Mon Sep 17 00:00:00 2001
From: Leonid Mesnik <lmesnik@openjdk.org>
Date: Thu, 16 Apr 2026 15:08:49 +0000
Subject: [PATCH 627/655] 8356223: ProblemList-AotJdk.txt should be added
 automatically if AOT mode is tested

Reviewed-by: erikj, epavlova
---
 make/RunTests.gmk | 3 +++
 1 file changed, 3 insertions(+)

diff --git a/make/RunTests.gmk b/make/RunTests.gmk
index 02ea632e3ec..d4be5936c41 100644
--- a/make/RunTests.gmk
+++ b/make/RunTests.gmk
@@ -1020,6 +1020,9 @@ define SetupRunJtregTestBody
         VM_OPTIONS := $$(JTREG_ALL_OPTIONS) ))
     $$(call LogWarn, AOT_JDK_CACHE=$$($1_AOT_JDK_CACHE))
     $1_JTREG_BASIC_OPTIONS += -vmoption:-XX:AOTCache="$$($1_AOT_JDK_CACHE)"
+    $1_JTREG_BASIC_OPTIONS += $$(addprefix $$(JTREG_PROBLEM_LIST_PREFIX), $$(wildcard \
+        $$(addprefix $$($1_TEST_ROOT)/, ProblemList-AotJdk.txt) \
+    ))
   endif
 
 

From 0ca24c0e57b0dc40c98533ecbb37a9378bb7aa13 Mon Sep 17 00:00:00 2001
From: Chris Hegarty <chegar@openjdk.org>
Date: Thu, 16 Apr 2026 16:19:02 +0000
Subject: [PATCH 628/655] 8382267: VectorMathLibrary uses locale-sensitive
 String.format to construct native symbol names

Reviewed-by: naoto, liach, vlivanov
---
 .../incubator/vector/VectorMathLibrary.java   |  5 +-
 .../vector/VectorMathLibraryLocaleTest.java   | 53 +++++++++++++++++++
 2 files changed, 56 insertions(+), 2 deletions(-)
 create mode 100644 test/jdk/jdk/incubator/vector/VectorMathLibraryLocaleTest.java

diff --git a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/VectorMathLibrary.java b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/VectorMathLibrary.java
index 823cebd85a9..59697733d86 100644
--- a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/VectorMathLibrary.java
+++ b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/VectorMathLibrary.java
@@ -31,6 +31,7 @@ import jdk.internal.vm.vector.VectorSupport;
 
 import java.lang.foreign.MemorySegment;
 import java.lang.foreign.SymbolLookup;
+import java.util.Locale;
 import java.util.function.IntFunction;
 
 import static jdk.incubator.vector.Util.requires;
@@ -141,7 +142,7 @@ import static jdk.internal.vm.vector.Utils.debug;
             String elemType = (vspecies.elementType() == float.class ? "f" : "");
             boolean isFloatVector64 = (vspecies.elementType() == float.class) && (vspecies.length() == 2); // FloatVector64 or FloatVectorMax
             int vlen = (isFloatVector64 ? 4 : vspecies.length()); // reuse 128-bit variant for 64-bit float vectors
-            return String.format("__jsvml_%s%s%d_ha_%s", op.operatorName(), elemType, vlen, suffix);
+            return String.format(Locale.ROOT, "__jsvml_%s%s%d_ha_%s", op.operatorName(), elemType, vlen, suffix);
         }
 
         @Override
@@ -214,7 +215,7 @@ import static jdk.internal.vm.vector.Utils.debug;
             boolean isFloatVector64 = (vspecies.elementType() == float.class) && (vspecies.length() == 2); // FloatVector64 or FloatVectorMax
             int vlen = (isFloatVector64 ? 4 : vspecies.length()); // reuse 128-bit variant for 64-bit float vectors
             boolean isShapeAgnostic = isRISCV64() || (isAARCH64() && vspecies.vectorBitSize() > 128);
-            return String.format("%s%s%s_%s%s", op.operatorName(),
+            return String.format(Locale.ROOT, "%s%s%s_%s%s", op.operatorName(),
                                  (vspecies.elementType() == float.class ? "f" : "d"),
                                  (isShapeAgnostic ? "x" : Integer.toString(vlen)),
                                  precisionLevel(op),
diff --git a/test/jdk/jdk/incubator/vector/VectorMathLibraryLocaleTest.java b/test/jdk/jdk/incubator/vector/VectorMathLibraryLocaleTest.java
new file mode 100644
index 00000000000..c093df397e5
--- /dev/null
+++ b/test/jdk/jdk/incubator/vector/VectorMathLibraryLocaleTest.java
@@ -0,0 +1,53 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+/*
+ * @test
+ * @bug 8382267
+ * @summary VectorMathLibrary symbol names must not use locale-sensitive formatting
+ * @modules jdk.incubator.vector
+ * @run main/othervm -ea -Duser.language=ar -Duser.country=SA VectorMathLibraryLocaleTest
+ */
+
+import java.util.Locale;
+
+import jdk.incubator.vector.FloatVector;
+import jdk.incubator.vector.VectorOperators;
+import jdk.incubator.vector.VectorSpecies;
+
+public class VectorMathLibraryLocaleTest {
+    public static void main(String[] args) {
+        assert !String.format("%d", 16).equals("16") : "expected non-ASCII digits for locale " + Locale.getDefault();
+
+        VectorSpecies<Float> species = FloatVector.SPECIES_PREFERRED;
+        FloatVector v = FloatVector.broadcast(species, 1.0f);
+
+        // Without the fix, this throws InternalError due to locale-mangled symbol name.
+        // The assertion below is just a sanity check on the result.
+        FloatVector result = v.lanewise(VectorOperators.EXP);
+        float expected = (float) Math.E;
+        for (int i = 0; i < species.length(); i++) {
+            assert result.lane(i) == expected : "lane " + i + ": expected " + expected + ", got " + result.lane(i);
+        }
+    }
+}

From 74c3d426b05ab0a0b2b7d3d6ee3ce9d5f4c977e1 Mon Sep 17 00:00:00 2001
From: Patrick Fontanilla <pfon@amazon.com>
Date: Thu, 16 Apr 2026 17:48:31 +0000
Subject: [PATCH 629/655] 8382103: Shenandoah: Optimize ShenandoahLock size for
 release build

Reviewed-by: xpeng, kdnilsen, wkemper
---
 src/hotspot/share/gc/shenandoah/shenandoahLock.hpp | 6 +++++-
 1 file changed, 5 insertions(+), 1 deletion(-)

diff --git a/src/hotspot/share/gc/shenandoah/shenandoahLock.hpp b/src/hotspot/share/gc/shenandoah/shenandoahLock.hpp
index 7c91df191e5..5041419b2c7 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahLock.hpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahLock.hpp
@@ -38,15 +38,19 @@ private:
   shenandoah_padding(0);
   Atomic<LockState> _state;
   shenandoah_padding(1);
+#ifdef ASSERT
   Atomic<Thread*> _owner;
   shenandoah_padding(2);
+#endif
 
   template<bool ALLOW_BLOCK>
   void contended_lock_internal(JavaThread* java_thread);
   static void yield_or_sleep(int &yields);
 
 public:
-  ShenandoahLock() : _state(unlocked), _owner(nullptr) {};
+  ShenandoahLock() : _state(unlocked) {
+    DEBUG_ONLY(_owner.store_relaxed(nullptr);)
+  };
 
   void lock(bool allow_block_for_safepoint = false) {
     assert(_owner.load_relaxed() != Thread::current(), "reentrant locking attempt, would deadlock");

From d6a255d74ce2b3cb197343208946fdaed11ca08e Mon Sep 17 00:00:00 2001
From: Patrick Fontanilla <pfon@amazon.com>
Date: Thu, 16 Apr 2026 17:49:05 +0000
Subject: [PATCH 630/655] 8381933: Possible memory leak in
 src/hotspot/share/gc/shenandoah/shenandoahHeapRegionCounters.cpp

Reviewed-by: kdnilsen, wkemper
---
 src/hotspot/share/gc/shenandoah/shenandoahHeapRegionCounters.cpp | 1 +
 1 file changed, 1 insertion(+)

diff --git a/src/hotspot/share/gc/shenandoah/shenandoahHeapRegionCounters.cpp b/src/hotspot/share/gc/shenandoah/shenandoahHeapRegionCounters.cpp
index ff1e3368e87..aaf152e2890 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahHeapRegionCounters.cpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahHeapRegionCounters.cpp
@@ -78,6 +78,7 @@ ShenandoahHeapRegionCounters::ShenandoahHeapRegionCounters() :
 
 ShenandoahHeapRegionCounters::~ShenandoahHeapRegionCounters() {
   if (_name_space != nullptr) FREE_C_HEAP_ARRAY(char, _name_space);
+  if (_regions_data != nullptr) FREE_C_HEAP_ARRAY(PerfVariable*, _regions_data);
 }
 
 void ShenandoahHeapRegionCounters::write_snapshot(PerfLongVariable** regions,

From 70d0651090c52d32349bf8efe0f577870503785f Mon Sep 17 00:00:00 2001
From: Shiv Shah <shiv.shah@oracle.com>
Date: Thu, 16 Apr 2026 17:57:01 +0000
Subject: [PATCH 631/655] 8316439: Several jvmti tests fail with -Xcheck:jni

Reviewed-by: lmesnik, dholmes, cjplummer, epavlova, sspitsyn
---
 .../PopFrame/popframe007/popframe007.cpp      |  7 ++++--
 .../retransform003/retransform003.cpp         | 10 ++++++--
 .../jtreg/vmTestbase/nsk/share/aod/aod.cpp    | 24 ++++++++++++++++++-
 3 files changed, 36 insertions(+), 5 deletions(-)

diff --git a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/PopFrame/popframe007/popframe007.cpp b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/PopFrame/popframe007/popframe007.cpp
index a2e9716a513..4b929fd4d03 100644
--- a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/PopFrame/popframe007/popframe007.cpp
+++ b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/PopFrame/popframe007/popframe007.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -39,6 +39,7 @@ static jvmtiEventCallbacks callbacks;
 static jint result = PASSED;
 static jboolean printdump = JNI_FALSE;
 static jmethodID mid;
+static jclass testThreadClass = nullptr;
 
 void JNICALL Breakpoint(jvmtiEnv *jvmti_env, JNIEnv *env,
         jthread thread, jmethodID method, jlocation location) {
@@ -166,6 +167,8 @@ Java_nsk_jvmti_PopFrame_popframe007_getReady(JNIEnv *env,
         return;
     }
 
+    testThreadClass = (jclass)env->NewGlobalRef(clazz);
+
     err = jvmti->SetBreakpoint(mid, 0);
     if (err != JVMTI_ERROR_NONE) {
         printf("(SetBreakpoint) unexpected error: %s (%d)\n",
@@ -191,7 +194,7 @@ Java_nsk_jvmti_PopFrame_popframe007_getRes(JNIEnv *env, jclass cls) {
 JNIEXPORT void JNICALL
 Java_nsk_jvmti_PopFrame_popframe007_B(JNIEnv *env, jclass cls) {
     if (mid != nullptr) {
-        env->CallStaticVoidMethod(cls, mid);
+        env->CallStaticVoidMethod(testThreadClass, mid);
     }
 }
 
diff --git a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/RetransformClasses/retransform003/retransform003.cpp b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/RetransformClasses/retransform003/retransform003.cpp
index cda8481533d..f7ad0b65ff3 100644
--- a/test/hotspot/jtreg/vmTestbase/nsk/jvmti/RetransformClasses/retransform003/retransform003.cpp
+++ b/test/hotspot/jtreg/vmTestbase/nsk/jvmti/RetransformClasses/retransform003/retransform003.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2007, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2007, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -113,6 +113,12 @@ ClassFileLoadHook (
             loader, method_id, class_name_string)) != nullptr))
         return;
 
+    if (jni->ExceptionCheck()) {
+        jni->ExceptionDescribe();
+        jni->ExceptionClear();
+        return;
+    }
+
     if (!NSK_VERIFY((method_id = jni->GetStaticMethodID(
             callback_class, "callback", "(Ljava/lang/String;I)V")) != nullptr))
         return;
@@ -120,7 +126,7 @@ ClassFileLoadHook (
     if (!NSK_VERIFY((class_name_string = jni->NewStringUTF(name)) != nullptr))
         return;
 
-    jni->CallStaticObjectMethod(callback_class, method_id, class_name_string, agent_id);
+    NSK_JNI_VERIFY_VOID(jni, jni->CallStaticVoidMethod(callback_class, method_id, class_name_string, agent_id));
 }
 
 
diff --git a/test/hotspot/jtreg/vmTestbase/nsk/share/aod/aod.cpp b/test/hotspot/jtreg/vmTestbase/nsk/share/aod/aod.cpp
index 7f622c24f75..7f82caa7259 100644
--- a/test/hotspot/jtreg/vmTestbase/nsk/share/aod/aod.cpp
+++ b/test/hotspot/jtreg/vmTestbase/nsk/share/aod/aod.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2008, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2008, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -31,6 +31,20 @@ extern "C" {
 
 static volatile int internalError = 0;
 
+/*
+ * Check for pending JNI exceptions after a JNI call.
+ * If an exception is found, describe it, clear it, and return failure.
+ */
+static int nsk_aod_checkJNIException(JNIEnv* jni) {
+    if (jni->ExceptionCheck()) {
+        jni->ExceptionDescribe();
+        jni->ExceptionClear();
+        NSK_COMPLAIN0("Unexpected exception after JNI call\n");
+        return NSK_FALSE;
+    }
+    return NSK_TRUE;
+}
+
 /*
  * This function can be used to inform AOD framework that some non critical for test logic
  * error happened inside shared function (e.g. JVMTI Deallocate failed).
@@ -227,6 +241,10 @@ int nsk_aod_agentLoaded(JNIEnv* jni, const char* agentName) {
 
     jni->CallStaticVoidMethod(targetAppClass, agentLoadedMethod, agentNameString);
 
+    if (!nsk_aod_checkJNIException(jni)) {
+        return NSK_FALSE;
+    }
+
     return NSK_TRUE;
 }
 
@@ -263,6 +281,10 @@ int nsk_aod_agentFinished(JNIEnv* jni, const char* agentName, int success) {
 
     jni->CallStaticVoidMethod(targetAppClass, agentFinishedMethod, agentNameString, success ? JNI_TRUE : JNI_FALSE);
 
+    if (!nsk_aod_checkJNIException(jni)) {
+        return NSK_FALSE;
+    }
+
     return NSK_TRUE;
 }
 

From 2c30f120800cd8ad2a54ef17780ed57dd3c336ad Mon Sep 17 00:00:00 2001
From: Matias Saavedra Silva <matsaave@openjdk.org>
Date: Thu, 16 Apr 2026 18:16:10 +0000
Subject: [PATCH 632/655] 8347248: Rename arg_count to arg_size

Reviewed-by: dlong, iklam
---
 src/hotspot/share/ci/ciMethodData.cpp        | 12 ++++++------
 src/hotspot/share/oops/methodData.cpp        |  4 ++--
 src/hotspot/share/oops/methodData.hpp        |  2 +-
 src/hotspot/share/oops/methodData.inline.hpp |  4 ++--
 src/hotspot/share/prims/jni.cpp              |  3 +--
 src/hotspot/share/prims/whitebox.cpp         |  4 ++--
 6 files changed, 14 insertions(+), 15 deletions(-)

diff --git a/src/hotspot/share/ci/ciMethodData.cpp b/src/hotspot/share/ci/ciMethodData.cpp
index 533e8659968..5e623e2b965 100644
--- a/src/hotspot/share/ci/ciMethodData.cpp
+++ b/src/hotspot/share/ci/ciMethodData.cpp
@@ -537,8 +537,8 @@ void ciMethodData::clear_escape_info() {
   if (mdo != nullptr) {
     mdo->clear_escape_info();
     ArgInfoData *aid = arg_info();
-    int arg_count = (aid == nullptr) ? 0 : aid->number_of_args();
-    for (int i = 0; i < arg_count; i++) {
+    int arg_size = (aid == nullptr) ? 0 : aid->size_of_args();
+    for (int i = 0; i < arg_size; i++) {
       set_arg_modified(i, 0);
     }
   }
@@ -554,8 +554,8 @@ void ciMethodData::update_escape_info() {
     mdo->set_arg_local(_arg_local);
     mdo->set_arg_stack(_arg_stack);
     mdo->set_arg_returned(_arg_returned);
-    int arg_count = mdo->method()->size_of_parameters();
-    for (int i = 0; i < arg_count; i++) {
+    int arg_size = mdo->method()->size_of_parameters();
+    for (int i = 0; i < arg_size; i++) {
       mdo->set_arg_modified(i, arg_modified(i));
     }
   }
@@ -652,7 +652,7 @@ void ciMethodData::set_arg_modified(int arg, uint val) {
   ArgInfoData *aid = arg_info();
   if (aid == nullptr)
     return;
-  assert(arg >= 0 && arg < aid->number_of_args(), "valid argument number");
+  assert(arg >= 0 && arg < aid->size_of_args(), "valid argument number");
   aid->set_arg_modified(arg, val);
 }
 
@@ -672,7 +672,7 @@ uint ciMethodData::arg_modified(int arg) const {
   ArgInfoData *aid = arg_info();
   if (aid == nullptr)
     return 0;
-  assert(arg >= 0 && arg < aid->number_of_args(), "valid argument number");
+  assert(arg >= 0 && arg < aid->size_of_args(), "valid argument number");
   return aid->arg_modified(arg);
 }
 
diff --git a/src/hotspot/share/oops/methodData.cpp b/src/hotspot/share/oops/methodData.cpp
index ad1049ffa34..dc0b8fa9f81 100644
--- a/src/hotspot/share/oops/methodData.cpp
+++ b/src/hotspot/share/oops/methodData.cpp
@@ -667,8 +667,8 @@ void MultiBranchData::print_data_on(outputStream* st, const char* extra) const {
 
 void ArgInfoData::print_data_on(outputStream* st, const char* extra) const {
   print_shared(st, "ArgInfoData", extra);
-  int nargs = number_of_args();
-  for (int i = 0; i < nargs; i++) {
+  int args_size = size_of_args();
+  for (int i = 0; i < args_size; i++) {
     st->print("  0x%x", arg_modified(i));
   }
   st->cr();
diff --git a/src/hotspot/share/oops/methodData.hpp b/src/hotspot/share/oops/methodData.hpp
index 196537359b5..45529618afb 100644
--- a/src/hotspot/share/oops/methodData.hpp
+++ b/src/hotspot/share/oops/methodData.hpp
@@ -1751,7 +1751,7 @@ public:
   virtual bool is_ArgInfoData() const { return true; }
 
 
-  int number_of_args() const {
+  int size_of_args() const {
     return array_len();
   }
 
diff --git a/src/hotspot/share/oops/methodData.inline.hpp b/src/hotspot/share/oops/methodData.inline.hpp
index dee14d49253..b417ba867fc 100644
--- a/src/hotspot/share/oops/methodData.inline.hpp
+++ b/src/hotspot/share/oops/methodData.inline.hpp
@@ -59,7 +59,7 @@ inline uint MethodData::arg_modified(int a) {
   MutexLocker ml(extra_data_lock(), Mutex::_no_safepoint_check_flag);
   ArgInfoData* aid = arg_info();
   assert(aid != nullptr, "arg_info must be not null");
-  assert(a >= 0 && a < aid->number_of_args(), "valid argument number");
+  assert(a >= 0 && a < aid->size_of_args(), "valid argument number");
   return aid->arg_modified(a);
 }
 
@@ -68,7 +68,7 @@ inline void MethodData::set_arg_modified(int a, uint v) {
   MutexLocker ml(extra_data_lock(), Mutex::_no_safepoint_check_flag);
   ArgInfoData* aid = arg_info();
   assert(aid != nullptr, "arg_info must be not null");
-  assert(a >= 0 && a < aid->number_of_args(), "valid argument number");
+  assert(a >= 0 && a < aid->size_of_args(), "valid argument number");
   aid->set_arg_modified(a, v);
 }
 
diff --git a/src/hotspot/share/prims/jni.cpp b/src/hotspot/share/prims/jni.cpp
index 85207fddf29..73082c6047d 100644
--- a/src/hotspot/share/prims/jni.cpp
+++ b/src/hotspot/share/prims/jni.cpp
@@ -867,8 +867,7 @@ static void jni_invoke_static(JNIEnv *env, JavaValue* result, jobject receiver,
   // Create object to hold arguments for the JavaCall, and associate it with
   // the jni parser
   ResourceMark rm(THREAD);
-  int number_of_parameters = method->size_of_parameters();
-  JavaCallArguments java_args(number_of_parameters);
+  JavaCallArguments java_args(method->size_of_parameters());
 
   assert(method->is_static(), "method should be static");
 
diff --git a/src/hotspot/share/prims/whitebox.cpp b/src/hotspot/share/prims/whitebox.cpp
index f50e6ddb3db..de140fb95ff 100644
--- a/src/hotspot/share/prims/whitebox.cpp
+++ b/src/hotspot/share/prims/whitebox.cpp
@@ -1280,8 +1280,8 @@ WB_ENTRY(void, WB_ClearMethodState(JNIEnv* env, jobject o, jobject method))
   if (mdo != nullptr) {
     mdo->init();
     ResourceMark rm(THREAD);
-    int arg_count = mdo->method()->size_of_parameters();
-    for (int i = 0; i < arg_count; i++) {
+    int arg_size = mdo->method()->size_of_parameters();
+    for (int i = 0; i < arg_size; i++) {
       mdo->set_arg_modified(i, 0);
     }
     mdo->clean_method_data(/*always_clean*/true);

From 17ee366ff964ea4e50b419a033bab973c46f601c Mon Sep 17 00:00:00 2001
From: Aleksey Shipilev <shade@openjdk.org>
Date: Thu, 16 Apr 2026 18:20:29 +0000
Subject: [PATCH 633/655] 8382150: Shenandoah: Clean up nmethod entry barrier
 support

Reviewed-by: xpeng, kdnilsen, wkemper
---
 .../gc/shenandoah/shenandoahClosures.hpp      |  3 --
 .../shenandoah/shenandoahClosures.inline.hpp  |  6 +--
 .../gc/shenandoah/shenandoahCodeRoots.cpp     | 37 ++-----------------
 .../gc/shenandoah/shenandoahCodeRoots.hpp     |  5 +--
 .../gc/shenandoah/shenandoahConcurrentGC.cpp  | 17 +++------
 .../gc/shenandoah/shenandoahRootProcessor.cpp |  5 +--
 .../shenandoahRootProcessor.inline.hpp        |  6 +--
 .../share/gc/shenandoah/shenandoahSTWMark.cpp |  2 +-
 8 files changed, 16 insertions(+), 65 deletions(-)

diff --git a/src/hotspot/share/gc/shenandoah/shenandoahClosures.hpp b/src/hotspot/share/gc/shenandoah/shenandoahClosures.hpp
index fefed0340c4..9ab45380c61 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahClosures.hpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahClosures.hpp
@@ -180,9 +180,6 @@ public:
 };
 
 class ShenandoahNMethodAndDisarmClosure : public NMethodToOopClosure {
-private:
-  BarrierSetNMethod* const _bs;
-
 public:
   inline ShenandoahNMethodAndDisarmClosure(OopClosure* cl);
   inline void do_nmethod(nmethod* nm);
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahClosures.inline.hpp b/src/hotspot/share/gc/shenandoah/shenandoahClosures.inline.hpp
index e8d25b1e5a9..96ecbad1145 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahClosures.inline.hpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahClosures.inline.hpp
@@ -209,15 +209,13 @@ void ShenandoahCleanUpdateWeakOopsClosure<CONCURRENT, IsAlive, KeepAlive>::do_oo
 }
 
 ShenandoahNMethodAndDisarmClosure::ShenandoahNMethodAndDisarmClosure(OopClosure* cl) :
-  NMethodToOopClosure(cl, true /* fix_relocations */),
-   _bs(BarrierSet::barrier_set()->barrier_set_nmethod()) {
-}
+  NMethodToOopClosure(cl, true /* fix_relocations */) {}
 
 void ShenandoahNMethodAndDisarmClosure::do_nmethod(nmethod* nm) {
   assert(nm != nullptr, "Sanity");
   assert(!ShenandoahNMethod::gc_data(nm)->is_unregistered(), "Should not be here");
   NMethodToOopClosure::do_nmethod(nm);
-  _bs->disarm(nm);
+  ShenandoahNMethod::disarm_nmethod(nm);
 }
 
 
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahCodeRoots.cpp b/src/hotspot/share/gc/shenandoah/shenandoahCodeRoots.cpp
index 64e135e9a4e..7cf60cdf65c 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahCodeRoots.cpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahCodeRoots.cpp
@@ -40,20 +40,6 @@
 ShenandoahNMethodTable* ShenandoahCodeRoots::_nmethod_table;
 int ShenandoahCodeRoots::_disarmed_value = 1;
 
-bool ShenandoahCodeRoots::use_nmethod_barriers_for_mark() {
-  // Continuations need nmethod barriers for scanning stack chunk nmethods.
-  if (Continuations::enabled()) return true;
-
-  // Concurrent class unloading needs nmethod barriers.
-  // When a nmethod is about to be executed, we need to make sure that all its
-  // metadata are marked. The alternative is to remark thread roots at final mark
-  // pause, which would cause latency issues.
-  if (ShenandoahHeap::heap()->unload_classes()) return true;
-
-  // Otherwise, we can go without nmethod barriers.
-  return false;
-}
-
 void ShenandoahCodeRoots::initialize() {
   _nmethod_table = new ShenandoahNMethodTable();
 }
@@ -68,27 +54,14 @@ void ShenandoahCodeRoots::unregister_nmethod(nmethod* nm) {
   _nmethod_table->unregister_nmethod(nm);
 }
 
-void ShenandoahCodeRoots::arm_nmethods_for_mark() {
-  if (use_nmethod_barriers_for_mark()) {
-    BarrierSet::barrier_set()->barrier_set_nmethod()->arm_all_nmethods();
-  }
-}
-
-void ShenandoahCodeRoots::arm_nmethods_for_evac() {
+void ShenandoahCodeRoots::arm_nmethods() {
   BarrierSet::barrier_set()->barrier_set_nmethod()->arm_all_nmethods();
 }
 
 class ShenandoahDisarmNMethodClosure : public NMethodClosure {
-private:
-  BarrierSetNMethod* const _bs;
-
 public:
-  ShenandoahDisarmNMethodClosure() :
-    _bs(BarrierSet::barrier_set()->barrier_set_nmethod()) {
-  }
-
   virtual void do_nmethod(nmethod* nm) {
-    _bs->disarm(nm);
+    ShenandoahNMethod::disarm_nmethod(nm);
   }
 };
 
@@ -111,10 +84,8 @@ public:
 };
 
 void ShenandoahCodeRoots::disarm_nmethods() {
-  if (use_nmethod_barriers_for_mark()) {
-    ShenandoahDisarmNMethodsTask task;
-    ShenandoahHeap::heap()->workers()->run_task(&task);
-  }
+  ShenandoahDisarmNMethodsTask task;
+  ShenandoahHeap::heap()->workers()->run_task(&task);
 }
 
 class ShenandoahNMethodUnlinkClosure : public NMethodClosure {
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahCodeRoots.hpp b/src/hotspot/share/gc/shenandoah/shenandoahCodeRoots.hpp
index d29c446f210..d395b4516f4 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahCodeRoots.hpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahCodeRoots.hpp
@@ -67,14 +67,11 @@ public:
   // Concurrent nmethod unloading support
   static void unlink(WorkerThreads* workers, bool unloading_occurred);
   static void purge();
-  static void arm_nmethods_for_mark();
-  static void arm_nmethods_for_evac();
+  static void arm_nmethods();
   static void disarm_nmethods();
   static int  disarmed_value()         { return _disarmed_value; }
   static int* disarmed_value_address() { return &_disarmed_value; }
 
-  static bool use_nmethod_barriers_for_mark();
-
 private:
   static ShenandoahNMethodTable* _nmethod_table;
   static int                     _disarmed_value;
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahConcurrentGC.cpp b/src/hotspot/share/gc/shenandoah/shenandoahConcurrentGC.cpp
index ba0aa1a1304..af4cec03221 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahConcurrentGC.cpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahConcurrentGC.cpp
@@ -744,9 +744,8 @@ void ShenandoahConcurrentGC::op_init_mark() {
   // Make above changes visible to worker threads
   OrderAccess::fence();
 
-  // Arm nmethods for concurrent mark
-  ShenandoahCodeRoots::arm_nmethods_for_mark();
-
+  // Arm nmethods/stack for concurrent processing
+  ShenandoahCodeRoots::arm_nmethods();
   ShenandoahStackWatermark::change_epoch_id();
 
   {
@@ -805,7 +804,7 @@ void ShenandoahConcurrentGC::op_final_mark() {
       heap->set_has_forwarded_objects(true);
 
       // Arm nmethods/stack for concurrent processing
-      ShenandoahCodeRoots::arm_nmethods_for_evac();
+      ShenandoahCodeRoots::arm_nmethods();
       ShenandoahStackWatermark::change_epoch_id();
 
     } else {
@@ -1035,14 +1034,10 @@ void ShenandoahConcurrentGC::op_class_unloading() {
 
 class ShenandoahEvacUpdateCodeCacheClosure : public NMethodClosure {
 private:
-  BarrierSetNMethod* const                  _bs;
   ShenandoahEvacuateUpdateMetadataClosure   _cl;
 
 public:
-  ShenandoahEvacUpdateCodeCacheClosure() :
-    _bs(BarrierSet::barrier_set()->barrier_set_nmethod()),
-    _cl() {
-  }
+  ShenandoahEvacUpdateCodeCacheClosure() : _cl() {}
 
   void do_nmethod(nmethod* n) {
     ShenandoahNMethod* data = ShenandoahNMethod::gc_data(n);
@@ -1050,8 +1045,8 @@ public:
     // Setup EvacOOM scope below reentrant lock to avoid deadlock with
     // nmethod_entry_barrier
     ShenandoahEvacOOMScope oom;
-    data->oops_do(&_cl, true/*fix relocation*/);
-    _bs->disarm(n);
+    data->oops_do(&_cl, /* fix_relocations = */ true);
+    ShenandoahNMethod::disarm_nmethod(n);
   }
 };
 
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahRootProcessor.cpp b/src/hotspot/share/gc/shenandoah/shenandoahRootProcessor.cpp
index 7b68e6ac625..80825ac43ad 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahRootProcessor.cpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahRootProcessor.cpp
@@ -200,9 +200,6 @@ ShenandoahRootAdjuster::ShenandoahRootAdjuster(uint n_workers, ShenandoahPhaseTi
 void ShenandoahRootAdjuster::roots_do(uint worker_id, OopClosure* oops) {
   NMethodToOopClosure code_blob_cl(oops, NMethodToOopClosure::FixRelocations);
   ShenandoahNMethodAndDisarmClosure nmethods_and_disarm_Cl(oops);
-  NMethodToOopClosure* adjust_code_closure = ShenandoahCodeRoots::use_nmethod_barriers_for_mark() ?
-                                             static_cast<NMethodToOopClosure*>(&nmethods_and_disarm_Cl) :
-                                             static_cast<NMethodToOopClosure*>(&code_blob_cl);
   CLDToOopClosure adjust_cld_closure(oops, ClassLoaderData::_claim_strong);
 
   // Process light-weight/limited parallel roots then
@@ -211,7 +208,7 @@ void ShenandoahRootAdjuster::roots_do(uint worker_id, OopClosure* oops) {
   _cld_roots.cld_do(&adjust_cld_closure, worker_id);
 
   // Process heavy-weight/fully parallel roots the last
-  _code_roots.nmethods_do(adjust_code_closure, worker_id);
+  _code_roots.nmethods_do(&nmethods_and_disarm_Cl, worker_id);
   _thread_roots.oops_do(oops, nullptr, worker_id);
 }
 
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahRootProcessor.inline.hpp b/src/hotspot/share/gc/shenandoah/shenandoahRootProcessor.inline.hpp
index 6aebec28163..4504ac96819 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahRootProcessor.inline.hpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahRootProcessor.inline.hpp
@@ -172,10 +172,6 @@ template <typename IsAlive, typename KeepAlive>
 void ShenandoahRootUpdater::roots_do(uint worker_id, IsAlive* is_alive, KeepAlive* keep_alive) {
   NMethodToOopClosure update_nmethods(keep_alive, NMethodToOopClosure::FixRelocations);
   ShenandoahNMethodAndDisarmClosure nmethods_and_disarm_Cl(keep_alive);
-  NMethodToOopClosure* codes_cl = ShenandoahCodeRoots::use_nmethod_barriers_for_mark() ?
-                                  static_cast<NMethodToOopClosure*>(&nmethods_and_disarm_Cl) :
-                                  static_cast<NMethodToOopClosure*>(&update_nmethods);
-
   CLDToOopClosure clds(keep_alive, ClassLoaderData::_claim_strong);
 
   // Process light-weight/limited parallel roots then
@@ -184,7 +180,7 @@ void ShenandoahRootUpdater::roots_do(uint worker_id, IsAlive* is_alive, KeepAliv
   _cld_roots.cld_do(&clds, worker_id);
 
   // Process heavy-weight/fully parallel roots the last
-  _code_roots.nmethods_do(codes_cl, worker_id);
+  _code_roots.nmethods_do(&nmethods_and_disarm_Cl, worker_id);
   _thread_roots.oops_do(keep_alive, nullptr, worker_id);
 }
 
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahSTWMark.cpp b/src/hotspot/share/gc/shenandoah/shenandoahSTWMark.cpp
index 117984a6d41..5b4ce6d0bc9 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahSTWMark.cpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahSTWMark.cpp
@@ -74,7 +74,7 @@ void ShenandoahSTWMark::mark() {
 
   // Arm all nmethods. Even though this is STW mark, some marking code
   // piggybacks on nmethod barriers for special instances.
-  ShenandoahCodeRoots::arm_nmethods_for_mark();
+  ShenandoahCodeRoots::arm_nmethods();
 
   // Weak reference processing
   ShenandoahReferenceProcessor* rp = _generation->ref_processor();

From 10e23dd5823258cfbf500175dde23be12cdd99bf Mon Sep 17 00:00:00 2001
From: Aleksey Shipilev <shade@openjdk.org>
Date: Thu, 16 Apr 2026 18:25:35 +0000
Subject: [PATCH 634/655] 8382257: Shenandoah: Clean up stack watermark barrier
 support

Reviewed-by: kdnilsen, wkemper
---
 .../shenandoah/mode/shenandoahPassiveMode.cpp |  1 -
 .../gc/shenandoah/mode/shenandoahSATBMode.cpp |  1 -
 .../gc/shenandoah/shenandoahBarrierSet.cpp    | 22 ++++++++-----------
 .../gc/shenandoah/shenandoah_globals.hpp      |  3 ---
 .../options/TestSelectiveBarrierFlags.java    |  3 +--
 .../options/TestWrongBarrierDisable.java      |  3 +--
 .../options/TestWrongBarrierEnable.java       |  4 +---
 7 files changed, 12 insertions(+), 25 deletions(-)

diff --git a/src/hotspot/share/gc/shenandoah/mode/shenandoahPassiveMode.cpp b/src/hotspot/share/gc/shenandoah/mode/shenandoahPassiveMode.cpp
index 41b2703730b..cc098bc5a21 100644
--- a/src/hotspot/share/gc/shenandoah/mode/shenandoahPassiveMode.cpp
+++ b/src/hotspot/share/gc/shenandoah/mode/shenandoahPassiveMode.cpp
@@ -50,7 +50,6 @@ void ShenandoahPassiveMode::initialize_flags() const {
   SHENANDOAH_ERGO_DISABLE_FLAG(ShenandoahSATBBarrier);
   SHENANDOAH_ERGO_DISABLE_FLAG(ShenandoahCASBarrier);
   SHENANDOAH_ERGO_DISABLE_FLAG(ShenandoahCloneBarrier);
-  SHENANDOAH_ERGO_DISABLE_FLAG(ShenandoahStackWatermarkBarrier);
   SHENANDOAH_ERGO_DISABLE_FLAG(ShenandoahCardBarrier);
 }
 
diff --git a/src/hotspot/share/gc/shenandoah/mode/shenandoahSATBMode.cpp b/src/hotspot/share/gc/shenandoah/mode/shenandoahSATBMode.cpp
index 7ac2d7b818f..e27aa90542d 100644
--- a/src/hotspot/share/gc/shenandoah/mode/shenandoahSATBMode.cpp
+++ b/src/hotspot/share/gc/shenandoah/mode/shenandoahSATBMode.cpp
@@ -42,6 +42,5 @@ void ShenandoahSATBMode::initialize_flags() const {
   SHENANDOAH_CHECK_FLAG_SET(ShenandoahSATBBarrier);
   SHENANDOAH_CHECK_FLAG_SET(ShenandoahCASBarrier);
   SHENANDOAH_CHECK_FLAG_SET(ShenandoahCloneBarrier);
-  SHENANDOAH_CHECK_FLAG_SET(ShenandoahStackWatermarkBarrier);
   SHENANDOAH_CHECK_FLAG_UNSET(ShenandoahCardBarrier);
 }
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahBarrierSet.cpp b/src/hotspot/share/gc/shenandoah/shenandoahBarrierSet.cpp
index cb6ff795c07..0949959b042 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahBarrierSet.cpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahBarrierSet.cpp
@@ -149,11 +149,9 @@ void ShenandoahBarrierSet::on_thread_attach(Thread *thread) {
     BarrierSetNMethod* bs_nm = barrier_set_nmethod();
     thread->set_nmethod_disarmed_guard_value(bs_nm->disarmed_guard_value());
 
-    if (ShenandoahStackWatermarkBarrier) {
-      JavaThread* const jt = JavaThread::cast(thread);
-      StackWatermark* const watermark = new ShenandoahStackWatermark(jt);
-      StackWatermarkSet::add_watermark(jt, watermark);
-    }
+    JavaThread* const jt = JavaThread::cast(thread);
+    StackWatermark* const watermark = new ShenandoahStackWatermark(jt);
+    StackWatermarkSet::add_watermark(jt, watermark);
   }
 }
 
@@ -172,14 +170,12 @@ void ShenandoahBarrierSet::on_thread_detach(Thread *thread) {
     }
 
     // SATB protocol requires to keep alive reachable oops from roots at the beginning of GC
-    if (ShenandoahStackWatermarkBarrier) {
-      if (_heap->is_concurrent_mark_in_progress()) {
-        ShenandoahKeepAliveClosure oops;
-        StackWatermarkSet::finish_processing(JavaThread::cast(thread), &oops, StackWatermarkKind::gc);
-      } else if (_heap->is_concurrent_weak_root_in_progress() && _heap->is_evacuation_in_progress()) {
-        ShenandoahContextEvacuateUpdateRootsClosure oops;
-        StackWatermarkSet::finish_processing(JavaThread::cast(thread), &oops, StackWatermarkKind::gc);
-      }
+    if (_heap->is_concurrent_mark_in_progress()) {
+      ShenandoahKeepAliveClosure oops;
+      StackWatermarkSet::finish_processing(JavaThread::cast(thread), &oops, StackWatermarkKind::gc);
+    } else if (_heap->is_concurrent_weak_root_in_progress() && _heap->is_evacuation_in_progress()) {
+      ShenandoahContextEvacuateUpdateRootsClosure oops;
+      StackWatermarkSet::finish_processing(JavaThread::cast(thread), &oops, StackWatermarkKind::gc);
     }
   }
 }
diff --git a/src/hotspot/share/gc/shenandoah/shenandoah_globals.hpp b/src/hotspot/share/gc/shenandoah/shenandoah_globals.hpp
index bbfa19934d9..2c5ba726ef2 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoah_globals.hpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoah_globals.hpp
@@ -560,9 +560,6 @@
   product(bool, ShenandoahLoadRefBarrier, true, DIAGNOSTIC,                 \
           "Turn on/off load-reference barriers in Shenandoah")              \
                                                                             \
-  product(bool, ShenandoahStackWatermarkBarrier, true, DIAGNOSTIC,          \
-          "Turn on/off stack watermark barriers in Shenandoah")             \
-                                                                            \
   develop(bool, ShenandoahVerifyOptoBarriers, trueInDebug,                  \
           "Verify no missing barriers in C2.")                              \
                                                                             \
diff --git a/test/hotspot/jtreg/gc/shenandoah/options/TestSelectiveBarrierFlags.java b/test/hotspot/jtreg/gc/shenandoah/options/TestSelectiveBarrierFlags.java
index fe29a38c422..da66bb8bbe0 100644
--- a/test/hotspot/jtreg/gc/shenandoah/options/TestSelectiveBarrierFlags.java
+++ b/test/hotspot/jtreg/gc/shenandoah/options/TestSelectiveBarrierFlags.java
@@ -52,8 +52,7 @@ public class TestSelectiveBarrierFlags {
                 new String[] { "ShenandoahLoadRefBarrier" },
                 new String[] { "ShenandoahSATBBarrier" },
                 new String[] { "ShenandoahCASBarrier" },
-                new String[] { "ShenandoahCloneBarrier" },
-                new String[] { "ShenandoahStackWatermarkBarrier" }
+                new String[] { "ShenandoahCloneBarrier" }
         };
 
         int size = 1;
diff --git a/test/hotspot/jtreg/gc/shenandoah/options/TestWrongBarrierDisable.java b/test/hotspot/jtreg/gc/shenandoah/options/TestWrongBarrierDisable.java
index f461bb4ae5c..b5c30f37202 100644
--- a/test/hotspot/jtreg/gc/shenandoah/options/TestWrongBarrierDisable.java
+++ b/test/hotspot/jtreg/gc/shenandoah/options/TestWrongBarrierDisable.java
@@ -41,8 +41,7 @@ public class TestWrongBarrierDisable {
                 "ShenandoahLoadRefBarrier",
                 "ShenandoahSATBBarrier",
                 "ShenandoahCASBarrier",
-                "ShenandoahCloneBarrier",
-                "ShenandoahStackWatermarkBarrier",
+                "ShenandoahCloneBarrier"
         };
 
         String[] generational = {
diff --git a/test/hotspot/jtreg/gc/shenandoah/options/TestWrongBarrierEnable.java b/test/hotspot/jtreg/gc/shenandoah/options/TestWrongBarrierEnable.java
index 348aa5367e9..1bc382dfbb0 100644
--- a/test/hotspot/jtreg/gc/shenandoah/options/TestWrongBarrierEnable.java
+++ b/test/hotspot/jtreg/gc/shenandoah/options/TestWrongBarrierEnable.java
@@ -41,8 +41,7 @@ public class TestWrongBarrierEnable {
                 "ShenandoahLoadRefBarrier",
                 "ShenandoahSATBBarrier",
                 "ShenandoahCASBarrier",
-                "ShenandoahCloneBarrier",
-                "ShenandoahStackWatermarkBarrier",
+                "ShenandoahCloneBarrier"
         };
         String[] generational = { "ShenandoahCardBarrier" };
         String[] all = {
@@ -50,7 +49,6 @@ public class TestWrongBarrierEnable {
                 "ShenandoahSATBBarrier",
                 "ShenandoahCASBarrier",
                 "ShenandoahCloneBarrier",
-                "ShenandoahStackWatermarkBarrier",
                 "ShenandoahCardBarrier"
         };
 

From 115075014272d12333d0955b42b11fee6727d514 Mon Sep 17 00:00:00 2001
From: Fei Yang <fyang@openjdk.org>
Date: Fri, 17 Apr 2026 00:34:54 +0000
Subject: [PATCH 635/655] 8382199: Remove unused parameter "dst" from
 CardTableBarrierSetAssembler::store_check()

Reviewed-by: chagedorn, jsikstro
---
 .../gc/shared/cardTableBarrierSetAssembler_aarch64.cpp    | 8 ++++----
 .../gc/shared/cardTableBarrierSetAssembler_aarch64.hpp    | 4 ++--
 .../x86/gc/shared/cardTableBarrierSetAssembler_x86.cpp    | 8 ++++----
 .../x86/gc/shared/cardTableBarrierSetAssembler_x86.hpp    | 4 ++--
 4 files changed, 12 insertions(+), 12 deletions(-)

diff --git a/src/hotspot/cpu/aarch64/gc/shared/cardTableBarrierSetAssembler_aarch64.cpp b/src/hotspot/cpu/aarch64/gc/shared/cardTableBarrierSetAssembler_aarch64.cpp
index a9c320912cb..7ce4e0f8aed 100644
--- a/src/hotspot/cpu/aarch64/gc/shared/cardTableBarrierSetAssembler_aarch64.cpp
+++ b/src/hotspot/cpu/aarch64/gc/shared/cardTableBarrierSetAssembler_aarch64.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -56,7 +56,7 @@ void CardTableBarrierSetAssembler::store_at(MacroAssembler* masm, DecoratorSet d
   }
 }
 
-void CardTableBarrierSetAssembler::store_check(MacroAssembler* masm, Register obj, Address dst, Register tmp1, Register tmp2) {
+void CardTableBarrierSetAssembler::store_check(MacroAssembler* masm, Register obj, Register tmp1, Register tmp2) {
   precond(tmp1 != noreg);
   precond(tmp2 != noreg);
   assert_different_registers(obj, tmp1, tmp2);
@@ -114,10 +114,10 @@ void CardTableBarrierSetAssembler::oop_store_at(MacroAssembler* masm, DecoratorS
   if (needs_post_barrier) {
     // flatten object address if needed
     if (!precise || (dst.index() == noreg && dst.offset() == 0)) {
-      store_check(masm, dst.base(), dst, tmp1, tmp2);
+      store_check(masm, dst.base(), tmp1, tmp2);
     } else {
       __ lea(tmp3, dst);
-      store_check(masm, tmp3, dst, tmp1, tmp2);
+      store_check(masm, tmp3, tmp1, tmp2);
     }
   }
 }
diff --git a/src/hotspot/cpu/aarch64/gc/shared/cardTableBarrierSetAssembler_aarch64.hpp b/src/hotspot/cpu/aarch64/gc/shared/cardTableBarrierSetAssembler_aarch64.hpp
index e05e9e90e5d..07016381f78 100644
--- a/src/hotspot/cpu/aarch64/gc/shared/cardTableBarrierSetAssembler_aarch64.hpp
+++ b/src/hotspot/cpu/aarch64/gc/shared/cardTableBarrierSetAssembler_aarch64.hpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -46,7 +46,7 @@ protected:
   virtual void store_at(MacroAssembler* masm, DecoratorSet decorators, BasicType type,
                         Address dst, Register val, Register tmp1, Register tmp2, Register tmp3);
 
-  void store_check(MacroAssembler* masm, Register obj, Address dst, Register tmp1, Register tmp2);
+  void store_check(MacroAssembler* masm, Register obj, Register tmp1, Register tmp2);
 };
 
 #endif // CPU_AARCH64_GC_SHARED_CARDTABLEBARRIERSETASSEMBLER_AARCH64_HPP
diff --git a/src/hotspot/cpu/x86/gc/shared/cardTableBarrierSetAssembler_x86.cpp b/src/hotspot/cpu/x86/gc/shared/cardTableBarrierSetAssembler_x86.cpp
index 1de147926bb..c05f37a3bea 100644
--- a/src/hotspot/cpu/x86/gc/shared/cardTableBarrierSetAssembler_x86.cpp
+++ b/src/hotspot/cpu/x86/gc/shared/cardTableBarrierSetAssembler_x86.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -130,7 +130,7 @@ __ BIND(L_loop);
 __ BIND(L_done);
 }
 
-void CardTableBarrierSetAssembler::store_check(MacroAssembler* masm, Register obj, Address dst, Register rscratch) {
+void CardTableBarrierSetAssembler::store_check(MacroAssembler* masm, Register obj, Register rscratch) {
   // Does a store check for the oop in register obj. The content of
   // register obj is destroyed afterwards.
   CardTableBarrierSet* ctbs = CardTableBarrierSet::barrier_set();
@@ -192,10 +192,10 @@ void CardTableBarrierSetAssembler::oop_store_at(MacroAssembler* masm, DecoratorS
   if (needs_post_barrier) {
     // flatten object address if needed
     if (!precise || (dst.index() == noreg && dst.disp() == 0)) {
-      store_check(masm, dst.base(), dst, tmp2);
+      store_check(masm, dst.base(), tmp2);
     } else {
       __ lea(tmp1, dst);
-      store_check(masm, tmp1, dst, tmp2);
+      store_check(masm, tmp1, tmp2);
     }
   }
 }
diff --git a/src/hotspot/cpu/x86/gc/shared/cardTableBarrierSetAssembler_x86.hpp b/src/hotspot/cpu/x86/gc/shared/cardTableBarrierSetAssembler_x86.hpp
index 201c11062f2..c38e16d4d5f 100644
--- a/src/hotspot/cpu/x86/gc/shared/cardTableBarrierSetAssembler_x86.hpp
+++ b/src/hotspot/cpu/x86/gc/shared/cardTableBarrierSetAssembler_x86.hpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -33,7 +33,7 @@ protected:
   virtual void gen_write_ref_array_pre_barrier(MacroAssembler* masm, DecoratorSet decorators,
                                                Register addr, Register count) {}
 
-  void store_check(MacroAssembler* masm, Register obj, Address dst, Register rscratch);
+  void store_check(MacroAssembler* masm, Register obj, Register rscratch);
 
   virtual void gen_write_ref_array_post_barrier(MacroAssembler* masm, DecoratorSet decorators, Register addr, Register count, Register tmp);
 

From 93aa6462f031f36a71a929175e97e5b745ef94aa Mon Sep 17 00:00:00 2001
From: Jatin Bhateja <jbhateja@openjdk.org>
Date: Fri, 17 Apr 2026 04:34:44 +0000
Subject: [PATCH 636/655] 8367761: [VectorAPI] AssertionError with several
 vector API mathlib tests with MaxVectorSize=32

Reviewed-by: xgong, sviswanathan, vlivanov
---
 .../share/classes/jdk/incubator/vector/CPUFeatures.java        | 3 ---
 1 file changed, 3 deletions(-)

diff --git a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/CPUFeatures.java b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/CPUFeatures.java
index 0ad7ba1651d..05b5f6f69f4 100644
--- a/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/CPUFeatures.java
+++ b/src/jdk.incubator.vector/share/classes/jdk/incubator/vector/CPUFeatures.java
@@ -74,9 +74,6 @@ import static jdk.internal.vm.vector.Utils.debug;
             debug("AVX=%b; AVX2=%b; AVX512F=%b; AVX512DQ=%b",
                   SUPPORTS_AVX, SUPPORTS_AVX2, SUPPORTS_AVX512F, SUPPORTS_AVX512DQ);
 
-            assert SUPPORTS_AVX512F == (VectorShape.getMaxVectorBitSize(int.class)   == 512);
-            assert SUPPORTS_AVX2    == (VectorShape.getMaxVectorBitSize(byte.class)  >= 256);
-            assert SUPPORTS_AVX     == (VectorShape.getMaxVectorBitSize(float.class) >= 256);
         }
     }
 

From cbb85a5237a6fbc6ffe6f9e28d27b5df4a35060e Mon Sep 17 00:00:00 2001
From: Aleksey Shipilev <shade@openjdk.org>
Date: Fri, 17 Apr 2026 05:47:55 +0000
Subject: [PATCH 637/655] 8382211: Shenandoah: Clean up and wire up final
 verification

Reviewed-by: kdnilsen, wkemper
---
 .../gc/shenandoah/shenandoahConcurrentGC.cpp  | 34 ++++++++++---------
 .../gc/shenandoah/shenandoahConcurrentGC.hpp  | 10 +++---
 .../gc/shenandoah/shenandoahPhaseTimings.hpp  |  4 +--
 .../share/gc/shenandoah/shenandoahUtils.hpp   |  2 +-
 .../gc/shenandoah/shenandoahVMOperations.cpp  |  8 ++---
 .../gc/shenandoah/shenandoahVMOperations.hpp  | 10 +++---
 .../gc/shenandoah/shenandoahVerifier.cpp      | 19 ++++++++++-
 .../gc/shenandoah/shenandoahVerifier.hpp      |  1 +
 src/hotspot/share/runtime/vmOperation.hpp     |  2 +-
 9 files changed, 55 insertions(+), 35 deletions(-)

diff --git a/src/hotspot/share/gc/shenandoah/shenandoahConcurrentGC.cpp b/src/hotspot/share/gc/shenandoah/shenandoahConcurrentGC.cpp
index af4cec03221..6723bb89021 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahConcurrentGC.cpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahConcurrentGC.cpp
@@ -255,8 +255,10 @@ bool ShenandoahConcurrentGC::collect(GCCause::Cause cause) {
       return false;
     }
 
-    if (VerifyAfterGC) {
-      vmop_entry_verify_final_roots();
+    // In normal cycle, final-update-refs would verify at the end of the cycle.
+    // In abbreviated cycle, we need to verify separately.
+    if (ShenandoahVerify) {
+      vmop_entry_final_verify();
     }
   }
 
@@ -344,14 +346,14 @@ void ShenandoahConcurrentGC::vmop_entry_final_update_refs() {
   VMThread::execute(&op);
 }
 
-void ShenandoahConcurrentGC::vmop_entry_verify_final_roots() {
+void ShenandoahConcurrentGC::vmop_entry_final_verify() {
   ShenandoahHeap* const heap = ShenandoahHeap::heap();
   TraceCollectorStats tcs(heap->monitoring_support()->stw_collection_counters());
-  ShenandoahTimingsTracker timing(ShenandoahPhaseTimings::final_roots_gross);
+  ShenandoahTimingsTracker timing(ShenandoahPhaseTimings::final_verify_gross);
 
   // This phase does not use workers, no need for setup
   heap->try_inject_alloc_failure();
-  VM_ShenandoahFinalRoots op(this);
+  VM_ShenandoahFinalVerify op(this);
   VMThread::execute(&op);
 }
 
@@ -400,12 +402,12 @@ void ShenandoahConcurrentGC::entry_final_update_refs() {
   op_final_update_refs();
 }
 
-void ShenandoahConcurrentGC::entry_verify_final_roots() {
-  const char* msg = verify_final_roots_event_message();
-  ShenandoahPausePhase gc_phase(msg, ShenandoahPhaseTimings::final_roots);
+void ShenandoahConcurrentGC::entry_final_verify() {
+  const char* msg = verify_final_event_message();
+  ShenandoahPausePhase gc_phase(msg, ShenandoahPhaseTimings::final_verify);
   EventMark em("%s", msg);
 
-  op_verify_final_roots();
+  op_verify_final();
 }
 
 void ShenandoahConcurrentGC::entry_reset() {
@@ -1263,10 +1265,10 @@ bool ShenandoahConcurrentGC::entry_final_roots() {
   return true;
 }
 
-void ShenandoahConcurrentGC::op_verify_final_roots() {
-  if (VerifyAfterGC) {
-    Universe::verify();
-  }
+void ShenandoahConcurrentGC::op_verify_final() {
+  assert(ShenandoahVerify, "Should have been checked before");
+  ShenandoahHeap* const heap = ShenandoahHeap::heap();
+  heap->verifier()->verify_after_gc(_generation);
 }
 
 void ShenandoahConcurrentGC::op_cleanup_complete() {
@@ -1351,11 +1353,11 @@ const char* ShenandoahConcurrentGC::conc_reset_after_collect_event_message() con
   }
 }
 
-const char* ShenandoahConcurrentGC::verify_final_roots_event_message() const {
+const char* ShenandoahConcurrentGC::verify_final_event_message() const {
   if (ShenandoahHeap::heap()->unload_classes()) {
-    SHENANDOAH_RETURN_EVENT_MESSAGE(_generation->type(), "Pause Verify Final Roots", " (unload classes)");
+    SHENANDOAH_RETURN_EVENT_MESSAGE(_generation->type(), "Pause Verify Final", " (unload classes)");
   } else {
-    SHENANDOAH_RETURN_EVENT_MESSAGE(_generation->type(), "Pause Verify Final Roots", "");
+    SHENANDOAH_RETURN_EVENT_MESSAGE(_generation->type(), "Pause Verify Final", "");
   }
 }
 
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahConcurrentGC.hpp b/src/hotspot/share/gc/shenandoah/shenandoahConcurrentGC.hpp
index ba228901d72..fde585b4aa9 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahConcurrentGC.hpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahConcurrentGC.hpp
@@ -43,7 +43,7 @@ class ShenandoahConcurrentGC : public ShenandoahGC {
   friend class VM_ShenandoahFinalMarkStartEvac;
   friend class VM_ShenandoahInitUpdateRefs;
   friend class VM_ShenandoahFinalUpdateRefs;
-  friend class VM_ShenandoahFinalRoots;
+  friend class VM_ShenandoahFinalVerify;
 
 protected:
   ShenandoahConcurrentMark    _mark;
@@ -69,7 +69,7 @@ protected:
   void vmop_entry_final_mark();
   void vmop_entry_init_update_refs();
   void vmop_entry_final_update_refs();
-  void vmop_entry_verify_final_roots();
+  void vmop_entry_final_verify();
 
   // Entry methods to normally STW GC operations. These set up logging, monitoring
   // and workers for next VM operation
@@ -77,7 +77,7 @@ protected:
   void entry_final_mark();
   void entry_init_update_refs();
   void entry_final_update_refs();
-  void entry_verify_final_roots();
+  void entry_final_verify();
 
   // Entry methods to normally concurrent GC operations. These set up logging, monitoring
   // for concurrent operation.
@@ -122,7 +122,7 @@ protected:
   void op_update_thread_roots();
   void op_final_update_refs();
 
-  void op_verify_final_roots();
+  void op_verify_final();
   void op_cleanup_complete();
   void op_reset_after_collect();
 
@@ -143,7 +143,7 @@ private:
   // passing around the logging/tracing systems
   const char* init_mark_event_message() const;
   const char* final_mark_event_message() const;
-  const char* verify_final_roots_event_message() const;
+  const char* verify_final_event_message() const;
   const char* conc_final_roots_event_message() const;
   const char* conc_mark_event_message() const;
   const char* conc_reset_event_message() const;
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahPhaseTimings.hpp b/src/hotspot/share/gc/shenandoah/shenandoahPhaseTimings.hpp
index a454de68f00..6a316e2265a 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahPhaseTimings.hpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahPhaseTimings.hpp
@@ -112,8 +112,8 @@ class outputStream;
   f(conc_update_card_table,                         "Concurrent Update Cards")         \
   f(conc_final_roots,                               "Concurrent Final Roots")          \
   f(promote_in_place,                               "  Promote Regions")               \
-  f(final_roots_gross,                              "Pause Verify Final Roots (G)")    \
-  f(final_roots,                                    "Pause Verify Final Roots (N)")    \
+  f(final_verify_gross,                             "Pause Final Verify (G)")          \
+  f(final_verify,                                   "Pause Final Verify (N)")          \
                                                                                        \
   f(init_update_refs_gross,                         "Pause Init Update Refs (G)")      \
   f(init_update_refs,                               "Pause Init Update Refs (N)")      \
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahUtils.hpp b/src/hotspot/share/gc/shenandoah/shenandoahUtils.hpp
index 6ef4cd7c702..0169941c3d9 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahUtils.hpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahUtils.hpp
@@ -187,7 +187,7 @@ public:
            type == VM_Operation::VMOp_ShenandoahFinalMarkStartEvac ||
            type == VM_Operation::VMOp_ShenandoahInitUpdateRefs ||
            type == VM_Operation::VMOp_ShenandoahFinalUpdateRefs ||
-           type == VM_Operation::VMOp_ShenandoahFinalRoots ||
+           type == VM_Operation::VMOp_ShenandoahFinalVerify ||
            type == VM_Operation::VMOp_ShenandoahFullGC ||
            type == VM_Operation::VMOp_ShenandoahDegeneratedGC;
   }
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahVMOperations.cpp b/src/hotspot/share/gc/shenandoah/shenandoahVMOperations.cpp
index 6b45842f781..97dd7e5cda1 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahVMOperations.cpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahVMOperations.cpp
@@ -135,12 +135,12 @@ void VM_ShenandoahFinalUpdateRefs::doit() {
   _gc->entry_final_update_refs();
 }
 
-VM_ShenandoahFinalRoots::VM_ShenandoahFinalRoots(ShenandoahConcurrentGC* gc)
+VM_ShenandoahFinalVerify::VM_ShenandoahFinalVerify(ShenandoahConcurrentGC* gc)
   : VM_ShenandoahOperation(gc->generation()), _gc(gc) {
 }
 
-void VM_ShenandoahFinalRoots::doit() {
-  ShenandoahGCPauseMark mark(_gc_id, "Final Roots", SvcGCMarker::CONCURRENT);
+void VM_ShenandoahFinalVerify::doit() {
+  ShenandoahGCPauseMark mark(_gc_id, "Final Verify", SvcGCMarker::CONCURRENT);
   set_active_generation();
-  _gc->entry_verify_final_roots();
+  _gc->entry_final_verify();
 }
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahVMOperations.hpp b/src/hotspot/share/gc/shenandoah/shenandoahVMOperations.hpp
index d565a3df22c..f8b99c71b14 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahVMOperations.hpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahVMOperations.hpp
@@ -38,7 +38,7 @@ class ShenandoahFullGC;
 //   - VM_ShenandoahFinalMarkStartEvac: finish up concurrent marking, and start evacuation
 //   - VM_ShenandoahInitUpdateRefs: initiate update references
 //   - VM_ShenandoahFinalUpdateRefs: finish up update references
-//   - VM_ShenandoahFinalRoots: finish up roots on a non-evacuating cycle
+//   - VM_ShenandoahFinalVerify: final verification at the end of the cycle
 //   - VM_ShenandoahReferenceOperation:
 //       - VM_ShenandoahFullGC: do full GC
 //       - VM_ShenandoahDegeneratedGC: do STW degenerated GC
@@ -127,12 +127,12 @@ public:
   void doit() override;
 };
 
-class VM_ShenandoahFinalRoots: public VM_ShenandoahOperation {
+class VM_ShenandoahFinalVerify: public VM_ShenandoahOperation {
   ShenandoahConcurrentGC* const _gc;
 public:
-  explicit VM_ShenandoahFinalRoots(ShenandoahConcurrentGC* gc);
-  VM_Operation::VMOp_Type type() const override { return VMOp_ShenandoahFinalRoots; }
-  const char* name()             const override { return "Shenandoah Final Roots"; }
+  explicit VM_ShenandoahFinalVerify(ShenandoahConcurrentGC* gc);
+  VM_Operation::VMOp_Type type() const override { return VMOp_ShenandoahFinalVerify; }
+  const char* name()             const override { return "Shenandoah Final Verify"; }
   void doit() override;
 };
 
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahVerifier.cpp b/src/hotspot/share/gc/shenandoah/shenandoahVerifier.cpp
index afef11640c9..8299cbe62c6 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahVerifier.cpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahVerifier.cpp
@@ -1180,7 +1180,7 @@ void ShenandoahVerifier::verify_before_update_refs(ShenandoahGeneration* generat
   );
 }
 
-// We have not yet cleanup (reclaimed) the collection set
+// We have not yet cleaned up (reclaimed) the collection set
 void ShenandoahVerifier::verify_after_update_refs(ShenandoahGeneration* generation) {
   verify_at_safepoint(
           generation,
@@ -1197,6 +1197,23 @@ void ShenandoahVerifier::verify_after_update_refs(ShenandoahGeneration* generati
   );
 }
 
+// We have not yet cleaned up (reclaimed) the collection set
+void ShenandoahVerifier::verify_after_gc(ShenandoahGeneration* generation) {
+  verify_at_safepoint(
+          generation,
+          "After GC",
+          _verify_remembered_disable,  // do not verify remembered set
+          _verify_forwarded_none,      // no forwarded references
+          _verify_marked_complete,     // bitmaps might be stale, but alloc-after-mark should be well
+          _verify_cset_none,           // no cset references, all updated
+          _verify_liveness_disable,    // no reliable liveness data anymore
+          _verify_regions_nocset,      // no cset regions, trash regions have appeared
+                                       // expect generation and heap sizes to match exactly, including trash
+          _verify_size_exact_including_trash,
+          _verify_gcstate_stable       // GC state was turned off
+  );
+}
+
 void ShenandoahVerifier::verify_after_degenerated(ShenandoahGeneration* generation) {
   verify_at_safepoint(
           generation,
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahVerifier.hpp b/src/hotspot/share/gc/shenandoah/shenandoahVerifier.hpp
index 7e683cf7af8..0479d5f67ce 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahVerifier.hpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahVerifier.hpp
@@ -220,6 +220,7 @@ public:
   void verify_before_evacuation(ShenandoahGeneration* generation);
   void verify_before_update_refs(ShenandoahGeneration* generation);
   void verify_after_update_refs(ShenandoahGeneration* generation);
+  void verify_after_gc(ShenandoahGeneration* generation);
   void verify_before_fullgc(ShenandoahGeneration* generation);
   void verify_after_fullgc(ShenandoahGeneration* generation);
   void verify_after_degenerated(ShenandoahGeneration* generation);
diff --git a/src/hotspot/share/runtime/vmOperation.hpp b/src/hotspot/share/runtime/vmOperation.hpp
index 5140d0401fb..6078600c16e 100644
--- a/src/hotspot/share/runtime/vmOperation.hpp
+++ b/src/hotspot/share/runtime/vmOperation.hpp
@@ -90,7 +90,7 @@
   template(ShenandoahFinalMarkStartEvac)          \
   template(ShenandoahInitUpdateRefs)              \
   template(ShenandoahFinalUpdateRefs)             \
-  template(ShenandoahFinalRoots)                  \
+  template(ShenandoahFinalVerify)                 \
   template(ShenandoahDegeneratedGC)               \
   template(Exit)                                  \
   template(LinuxDllLoad)                          \

From 299973160d55f1318dd6c673267b4dcdefb64ac9 Mon Sep 17 00:00:00 2001
From: Rui Li <ruili@openjdk.org>
Date: Fri, 17 Apr 2026 05:51:52 +0000
Subject: [PATCH 638/655] 8382295: Shenandoah: wrong denominator in full gc
 summary

Reviewed-by: shade, kdnilsen
---
 src/hotspot/share/gc/shenandoah/shenandoahCollectorPolicy.cpp | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/src/hotspot/share/gc/shenandoah/shenandoahCollectorPolicy.cpp b/src/hotspot/share/gc/shenandoah/shenandoahCollectorPolicy.cpp
index bbd9dca1513..cfa79fc055e 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahCollectorPolicy.cpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahCollectorPolicy.cpp
@@ -257,10 +257,10 @@ void ShenandoahCollectorPolicy::print_gc_stats(outputStream* out) const {
 
   out->print_cr("%5zu Full GCs (%.2f%%)", _success_full_gcs, percent_of(_success_full_gcs, completed_gcs));
   if (!ExplicitGCInvokesConcurrent) {
-    out->print_cr("  %5zu invoked explicitly (%.2f%%)", explicit_requests, percent_of(explicit_requests, _success_concurrent_gcs));
+    out->print_cr("  %5zu invoked explicitly (%.2f%%)", explicit_requests, percent_of(explicit_requests, _success_full_gcs));
   }
   if (!ShenandoahImplicitGCInvokesConcurrent) {
-    out->print_cr("  %5zu invoked implicitly (%.2f%%)", implicit_requests, percent_of(implicit_requests, _success_concurrent_gcs));
+    out->print_cr("  %5zu invoked implicitly (%.2f%%)", implicit_requests, percent_of(implicit_requests, _success_full_gcs));
   }
   out->print_cr("  %5zu caused by allocation failure (%.2f%%)", _alloc_failure_full, percent_of(_alloc_failure_full, _success_full_gcs));
   out->print_cr("  %5zu upgraded from Degenerated GC (%.2f%%)", _alloc_failure_degenerated_upgrade_to_full, percent_of(_alloc_failure_degenerated_upgrade_to_full, _success_full_gcs));

From 5c403a8029fd8d8c0f817b76b7f3abcfbb4bcabf Mon Sep 17 00:00:00 2001
From: Dusan Balek <dusan.balek@oracle.com>
Date: Fri, 17 Apr 2026 06:10:25 +0000
Subject: [PATCH 639/655] 8380912: "Trailing white space will be removed"
 incorrectly triggered with \u2028

Reviewed-by: jlahoda
---
 .../tools/javac/parser/TextBlockSupport.java  |  6 +-
 .../langtools/tools/javac/TextBlockU2028.java | 76 +++++++++++++++++++
 2 files changed, 79 insertions(+), 3 deletions(-)
 create mode 100644 test/langtools/tools/javac/TextBlockU2028.java

diff --git a/src/jdk.compiler/share/classes/com/sun/tools/javac/parser/TextBlockSupport.java b/src/jdk.compiler/share/classes/com/sun/tools/javac/parser/TextBlockSupport.java
index d099ceadba0..5112849d45f 100644
--- a/src/jdk.compiler/share/classes/com/sun/tools/javac/parser/TextBlockSupport.java
+++ b/src/jdk.compiler/share/classes/com/sun/tools/javac/parser/TextBlockSupport.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2020, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -56,8 +56,8 @@ class TextBlockSupport {
         // No need to check indentation if opting out (last line is empty.)
         char lastChar = string.charAt(string.length() - 1);
         boolean optOut = lastChar == '\n' || lastChar == '\r';
-        // Split string based at line terminators.
-        String[] lines = string.split("\\R");
+        // Split string using JLS text block line terminators: CRLF, CR, or LF.
+        String[] lines = string.split("\\r\\n|\\r|\\n");
         int length = lines.length;
         // Extract last line.
         String lastLine = length == 0 ? "" : lines[length - 1];
diff --git a/test/langtools/tools/javac/TextBlockU2028.java b/test/langtools/tools/javac/TextBlockU2028.java
new file mode 100644
index 00000000000..a7abfe43263
--- /dev/null
+++ b/test/langtools/tools/javac/TextBlockU2028.java
@@ -0,0 +1,76 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+/*
+ * @test
+ * @bug 8380912
+ * @summary Verify that trailing whitespace warning is not reported for \u2028
+ *          inside text block content
+ * @library /tools/lib
+ * @modules
+ *      jdk.compiler/com.sun.tools.javac.api
+ *      jdk.compiler/com.sun.tools.javac.main
+ * @build toolbox.ToolBox toolbox.JavacTask
+ * @run junit TextBlockU2028
+ */
+
+import java.nio.file.Files;
+import java.nio.file.Path;
+import java.nio.file.Paths;
+
+import toolbox.JavacTask;
+import toolbox.ToolBox;
+
+import org.junit.jupiter.api.BeforeEach;
+import org.junit.jupiter.api.Test;
+import org.junit.jupiter.api.TestInfo;
+
+public class TextBlockU2028 {
+    Path base;
+    ToolBox tb = new ToolBox();
+
+    @Test
+    void testNoFalseTrailingWhitespaceWarning() throws Exception {
+        Path classes = base.resolve("classes");
+        Files.createDirectories(classes);
+        new JavacTask(tb)
+                .options("-d", classes.toString(), "-Xlint:text-blocks", "-XDrawDiagnostics", "-Werror")
+                .sources("""
+                         public class Test {
+                             String s = \"\"\"
+                                        foo \\u2028 bar
+                                        \"\"\";
+                         }
+                         """)
+                .run()
+                .writeAll();
+    }
+
+    @BeforeEach
+    public void setUp(TestInfo info) {
+        base = Paths.get(".")
+                    .resolve(info.getTestMethod()
+                                 .orElseThrow()
+                                 .getName());
+    }
+}

From 15a7eabd4af7e2ec60d3cc0511c28d4fb740595d Mon Sep 17 00:00:00 2001
From: jonghoonpark <dev@jonghoonpark.com>
Date: Fri, 17 Apr 2026 06:37:15 +0000
Subject: [PATCH 640/655] 8381924: Fix include guard in
 lambdaProxyClassDictionary.hpp

Reviewed-by: jwaters, stefank
---
 src/hotspot/share/cds/lambdaProxyClassDictionary.hpp | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/src/hotspot/share/cds/lambdaProxyClassDictionary.hpp b/src/hotspot/share/cds/lambdaProxyClassDictionary.hpp
index dfb75532917..b20e998bba6 100644
--- a/src/hotspot/share/cds/lambdaProxyClassDictionary.hpp
+++ b/src/hotspot/share/cds/lambdaProxyClassDictionary.hpp
@@ -22,8 +22,8 @@
  *
  */
 
-#ifndef SHARE_CDS_LAMBDAPROXYCLASSINFO_HPP
-#define SHARE_CDS_LAMBDAPROXYCLASSINFO_HPP
+#ifndef SHARE_CDS_LAMBDAPROXYCLASSDICTIONARY_HPP
+#define SHARE_CDS_LAMBDAPROXYCLASSDICTIONARY_HPP
 
 #include "cds/aotCompressedPointers.hpp"
 #include "cds/aotMetaspace.hpp"
@@ -331,4 +331,4 @@ public:
   static void print_statistics(outputStream* st,  bool is_static_archive);
 };
 
-#endif // SHARE_CDS_LAMBDAPROXYCLASSINFO_HPP
+#endif // SHARE_CDS_LAMBDAPROXYCLASSDICTIONARY_HPP

From ca643010a27292b99c6f2182764bc7cd4ac93b02 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Markus=20Gr=C3=B6nlund?= <mgronlun@openjdk.org>
Date: Fri, 17 Apr 2026 07:51:44 +0000
Subject: [PATCH 641/655] 8382242: JFR: Metadata reconstruction invalidates
 ConstantMap for java.lang.String

Reviewed-by: egahlin
---
 .../jfr/internal/consumer/ParserFactory.java  |   9 +-
 ...aReconstructionWithRetainedStringPool.java | 106 ++++++++++++++++++
 2 files changed, 112 insertions(+), 3 deletions(-)
 create mode 100644 test/jdk/jdk/jfr/api/consumer/streaming/TestMetadataReconstructionWithRetainedStringPool.java

diff --git a/src/jdk.jfr/share/classes/jdk/jfr/internal/consumer/ParserFactory.java b/src/jdk.jfr/share/classes/jdk/jfr/internal/consumer/ParserFactory.java
index e7dd234ca8d..c973dadb3b7 100644
--- a/src/jdk.jfr/share/classes/jdk/jfr/internal/consumer/ParserFactory.java
+++ b/src/jdk.jfr/share/classes/jdk/jfr/internal/consumer/ParserFactory.java
@@ -132,9 +132,12 @@ final class ParserFactory {
             case "short" -> new ShortParser();
             case "byte" ->  new ByteParser();
             case "java.lang.String" -> {
-                ConstantMap pool = new ConstantMap(ObjectFactory.create(type, timeConverter), type);
-                ConstantLookup lookup = new ConstantLookup(pool, type);
-                constantLookups.put(type.getId(), lookup);
+                ConstantLookup lookup = constantLookups.get(type.getId());
+                if (lookup == null) {
+                    ConstantMap pool = new ConstantMap(ObjectFactory.create(type, timeConverter), type);
+                    lookup = new ConstantLookup(pool, type);
+                    constantLookups.put(type.getId(), lookup);
+                }
                 yield new StringParser(lookup, event);
             }
             default ->  throw new IOException("Unknown primitive type " + type.getName());
diff --git a/test/jdk/jdk/jfr/api/consumer/streaming/TestMetadataReconstructionWithRetainedStringPool.java b/test/jdk/jdk/jfr/api/consumer/streaming/TestMetadataReconstructionWithRetainedStringPool.java
new file mode 100644
index 00000000000..8bbadc6db29
--- /dev/null
+++ b/test/jdk/jdk/jfr/api/consumer/streaming/TestMetadataReconstructionWithRetainedStringPool.java
@@ -0,0 +1,106 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+package jdk.jfr.api.consumer.streaming;
+
+import java.util.concurrent.atomic.AtomicInteger;
+import java.util.concurrent.CountDownLatch;
+
+import jdk.jfr.Event;
+import jdk.jfr.consumer.RecordingStream;
+
+/**
+ * @test
+ * @summary Test that it is possible to register new metadata in a new segment while retaining the string pool.
+ * @requires vm.flagless
+ * @requires vm.hasJFR
+ * @library /test/lib
+ * @run main/othervm jdk.jfr.api.consumer.streaming.TestMetadataReconstructionWithRetainedStringPool
+ */
+public class TestMetadataReconstructionWithRetainedStringPool {
+    /// Minimum string length required to trigger StringPool usage.
+    /// Mirrors `jdk.jfr.internal.StringPool.MIN_LIMIT`.
+    private static final int STRING_POOL_MIN_LIMIT = 16;
+    private static final int EXPECTED_EVENTS = 3;
+
+    // Condition 1: String length > STRING_POOL_MIN_LIMIT triggers CONSTANT_POOL encoding.
+    private static final String TEXT = "a".repeat(STRING_POOL_MIN_LIMIT + 1);;
+
+    static final class EventA extends Event {
+        String text = TEXT;
+    }
+
+    static final class EventB extends Event {
+        String text = TEXT;
+    }
+
+    public static void main(String... args) throws InterruptedException {
+        var aEventsPosted = new CountDownLatch(1);
+        var readyToPostEventB = new CountDownLatch(1);
+        var remaining = new CountDownLatch(EXPECTED_EVENTS);
+
+        try (var rs = new RecordingStream()) {
+            rs.onEvent(e -> {
+                String textValue = e.getValue("text");
+                if (textValue == null) {
+                    throw new RuntimeException("e.getValue(\"text\") returned null");
+                }
+                remaining.countDown();
+                System.out.printf("Event #%d [%s]: text=%s%n",
+                        EXPECTED_EVENTS - remaining.getCount(),
+                        e.getEventType().getName(),
+                        textValue);
+            });
+
+            rs.onFlush(() -> {
+                if (aEventsPosted.getCount() == 0) {
+                    readyToPostEventB.countDown();
+                }
+            });
+
+            rs.startAsync();
+
+            // Condition 2: Two distinct event types are required.
+            //              First, load EventA as the initial event type and emit its first event.
+            //              This first event looks into the StringPool pre-cache. Although the
+            //              string length qualifies for pooling, because it isn't pre-cached,
+            //              the first event encodes the string inline.
+            //              The second event finds the string in the pre-cache and adds it to the
+            //              pool. A constant pool ID to the pooled string is encoded in the event.
+            //
+            new EventA().commit();
+            new EventA().commit();
+            aEventsPosted.countDown();
+
+            // Condition 3: Wait for JFR flush.
+            //              The default flush period is ~1 second.
+            readyToPostEventB.await();
+
+            // Load the second event type, EventB, AFTER the flush segment containing the two events of type EventA.
+            // A new metadata description will be constructed, and we verify that the StringPool added in the previous
+            // segment is still available for the EventB string pool reference to be resolved correctly.
+            new EventB().commit();
+            remaining.await();
+        }
+    }
+}

From 787ff6787e9e87ed2de4058e1d3a0e06b2126fd5 Mon Sep 17 00:00:00 2001
From: Thomas Schatzl <tschatzl@openjdk.org>
Date: Fri, 17 Apr 2026 07:56:31 +0000
Subject: [PATCH 642/655] 8379620: G1: Typing error in jvmFlagConstraintsG1.cpp

Reviewed-by: iwalulya
---
 src/hotspot/share/gc/g1/jvmFlagConstraintsG1.cpp | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/src/hotspot/share/gc/g1/jvmFlagConstraintsG1.cpp b/src/hotspot/share/gc/g1/jvmFlagConstraintsG1.cpp
index b56e82fac3c..df6adeb8041 100644
--- a/src/hotspot/share/gc/g1/jvmFlagConstraintsG1.cpp
+++ b/src/hotspot/share/gc/g1/jvmFlagConstraintsG1.cpp
@@ -70,7 +70,7 @@ JVMFlag::Error G1RemSetHowlMaxNumBucketsConstraintFunc(uint value, bool verbose)
   }
   if (!is_power_of_2(G1RemSetHowlMaxNumBuckets)) {
     JVMFlag::printError(verbose,
-                        "G1RemSetMaxHowlNumBuckets (%u) must be a power of two.\n",
+                        "G1RemSetHowlMaxNumBuckets (%u) must be a power of two.\n",
                         value);
     return JVMFlag::VIOLATES_CONSTRAINT;
   }

From 877425a15825ae4e1eafa4c90807e05679e48474 Mon Sep 17 00:00:00 2001
From: Volkan Yazici <vyazici@openjdk.org>
Date: Fri, 17 Apr 2026 08:18:40 +0000
Subject: [PATCH 643/655] 8380989: HttpRequest.Builder#headers() throws an
 exception if an empty array is passed

Reviewed-by: dfuchs
---
 .../jdk/internal/net/http/HttpRequestBuilderImpl.java       | 4 ++--
 test/jdk/java/net/httpclient/HttpRequestBuilderTest.java    | 6 +++---
 test/jdk/java/net/httpclient/RequestBuilderTest.java        | 3 +--
 3 files changed, 6 insertions(+), 7 deletions(-)

diff --git a/src/java.net.http/share/classes/jdk/internal/net/http/HttpRequestBuilderImpl.java b/src/java.net.http/share/classes/jdk/internal/net/http/HttpRequestBuilderImpl.java
index ef0e2b152bb..c39edf878c9 100644
--- a/src/java.net.http/share/classes/jdk/internal/net/http/HttpRequestBuilderImpl.java
+++ b/src/java.net.http/share/classes/jdk/internal/net/http/HttpRequestBuilderImpl.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2015, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2015, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -145,7 +145,7 @@ public class HttpRequestBuilderImpl implements HttpRequest.Builder {
     @Override
     public HttpRequestBuilderImpl headers(String... params) {
         requireNonNull(params);
-        if (params.length == 0 || params.length % 2 != 0) {
+        if (params.length % 2 != 0) {
             throw newIAE("wrong number, %d, of parameters", params.length);
         }
         for (int i = 0; i < params.length; i += 2) {
diff --git a/test/jdk/java/net/httpclient/HttpRequestBuilderTest.java b/test/jdk/java/net/httpclient/HttpRequestBuilderTest.java
index 4544c85c5e8..dd1e2495382 100644
--- a/test/jdk/java/net/httpclient/HttpRequestBuilderTest.java
+++ b/test/jdk/java/net/httpclient/HttpRequestBuilderTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2016, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2016, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -112,8 +112,8 @@ public class HttpRequestBuilderTest {
         builder = test1("headers", builder, builder::headers, (String[]) null,
                         NullPointerException.class);
 
-        builder = test1("headers", builder, builder::headers, new String[0],
-                        IllegalArgumentException.class);
+        builder = test1("headers", builder, builder::headers, new String[0]
+                        /* no expected exceptions */);
 
         builder = test1("headers", builder, builder::headers,
                         (String[]) new String[] {null, "bar"},
diff --git a/test/jdk/java/net/httpclient/RequestBuilderTest.java b/test/jdk/java/net/httpclient/RequestBuilderTest.java
index 6ba00fcd10f..9285bb55bb8 100644
--- a/test/jdk/java/net/httpclient/RequestBuilderTest.java
+++ b/test/jdk/java/net/httpclient/RequestBuilderTest.java
@@ -202,11 +202,10 @@ public class RequestBuilderTest {
     public void testHeaders() {
         HttpRequest.Builder builder = newBuilder(uri);
 
-        String[] empty = new String[0];
-        assertThrows(IAE, () -> builder.headers(empty).build());
         assertThrows(IAE, () -> builder.headers("1").build());
         assertThrows(IAE, () -> builder.headers("1", "2", "3").build());
         assertThrows(IAE, () -> builder.headers("1", "2", "3", "4", "5").build());
+        assertEquals(0, builder.headers(new String[0]).build().headers().map().size());
         assertEquals(0, builder.build().headers().map().size());
 
         List<HttpRequest> requests = List.of(

From 8a710ae20178c39ecab1e3aaac72916534ad7811 Mon Sep 17 00:00:00 2001
From: Artur Barashev <abarashev@openjdk.org>
Date: Fri, 17 Apr 2026 13:27:25 +0000
Subject: [PATCH 644/655] 8372526: Add support for ZLIB TLS Certificate
 Compression

Co-authored-by: Xue-Lei Andrew Fan <xuelei@openjdk.org>
Reviewed-by: jnimeh, xuelei
---
 .../share/classes/sun/security/ssl/Alert.java |   4 +-
 .../sun/security/ssl/CertificateMessage.java  |  47 ++-
 .../sun/security/ssl/CertificateRequest.java  |   7 +-
 .../security/ssl/CompressCertExtension.java   | 306 ++++++++++++++++++
 .../security/ssl/CompressedCertificate.java   | 264 +++++++++++++++
 .../security/ssl/CompressionAlgorithm.java    | 182 +++++++++++
 .../sun/security/ssl/HandshakeContext.java    |   7 +-
 .../sun/security/ssl/QuicTLSEngineImpl.java   |   1 +
 .../sun/security/ssl/SSLContextImpl.java      |  10 +
 .../sun/security/ssl/SSLExtension.java        |  23 +-
 .../sun/security/ssl/SSLHandshake.java        |  19 +-
 .../classes/sun/security/ssl/ServerHello.java |   7 +-
 test/jdk/java/net/httpclient/HeadTest.java    |  17 +-
 .../net/httpclient/LargeHandshakeTest.java    |  35 +-
 .../BoundDecompressMemory.java                |  86 +++++
 .../ClientCertCompressionExt.java             | 157 +++++++++
 .../CompressedCertMsg.java                    | 151 +++++++++
 .../CompressedCertMsgCache.java               | 197 +++++++++++
 .../jdk/test/lib/security/SecurityUtils.java  |  39 ++-
 19 files changed, 1518 insertions(+), 41 deletions(-)
 create mode 100644 src/java.base/share/classes/sun/security/ssl/CompressCertExtension.java
 create mode 100644 src/java.base/share/classes/sun/security/ssl/CompressedCertificate.java
 create mode 100644 src/java.base/share/classes/sun/security/ssl/CompressionAlgorithm.java
 create mode 100644 test/jdk/sun/security/ssl/CertificateCompression/BoundDecompressMemory.java
 create mode 100644 test/jdk/sun/security/ssl/CertificateCompression/ClientCertCompressionExt.java
 create mode 100644 test/jdk/sun/security/ssl/CertificateCompression/CompressedCertMsg.java
 create mode 100644 test/jdk/sun/security/ssl/CertificateCompression/CompressedCertMsgCache.java

diff --git a/src/java.base/share/classes/sun/security/ssl/Alert.java b/src/java.base/share/classes/sun/security/ssl/Alert.java
index fb06b02a5d4..e9588a09b3d 100644
--- a/src/java.base/share/classes/sun/security/ssl/Alert.java
+++ b/src/java.base/share/classes/sun/security/ssl/Alert.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2003, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2003, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -281,6 +281,8 @@ public enum Alert {
                         // consumer so the state machine doesn't expect it.
                         tc.handshakeContext.handshakeConsumers.remove(
                                 SSLHandshake.CERTIFICATE.id);
+                        tc.handshakeContext.handshakeConsumers.remove(
+                                SSLHandshake.COMPRESSED_CERTIFICATE.id);
                         tc.handshakeContext.handshakeConsumers.remove(
                                 SSLHandshake.CERTIFICATE_VERIFY.id);
                     }
diff --git a/src/java.base/share/classes/sun/security/ssl/CertificateMessage.java b/src/java.base/share/classes/sun/security/ssl/CertificateMessage.java
index c6897d71aa6..af5007d7899 100644
--- a/src/java.base/share/classes/sun/security/ssl/CertificateMessage.java
+++ b/src/java.base/share/classes/sun/security/ssl/CertificateMessage.java
@@ -781,14 +781,6 @@ final class CertificateMessage {
             }
         }
 
-        T13CertificateMessage(HandshakeContext handshakeContext,
-                byte[] requestContext, List<CertificateEntry> certificates) {
-            super(handshakeContext);
-
-            this.requestContext = requestContext.clone();
-            this.certEntries = certificates;
-        }
-
         T13CertificateMessage(HandshakeContext handshakeContext,
                 ByteBuffer m) throws IOException {
             super(handshakeContext);
@@ -925,16 +917,26 @@ final class CertificateMessage {
                 HandshakeMessage message) throws IOException {
             // The producing happens in handshake context only.
             HandshakeContext hc = (HandshakeContext)context;
-            if (hc.sslConfig.isClientMode) {
-                return onProduceCertificate(
-                        (ClientHandshakeContext)context, message);
-            } else {
-                return onProduceCertificate(
+            T13CertificateMessage cm = hc.sslConfig.isClientMode ?
+                onProduceCertificate(
+                        (ClientHandshakeContext)context, message) :
+                onProduceCertificate(
                         (ServerHandshakeContext)context, message);
+
+            // Output the handshake message.
+            if (hc.certDeflater == null) {
+                cm.write(hc.handshakeOutput);
+                hc.handshakeOutput.flush();
+            } else {
+                // Replace with CompressedCertificate message
+                CompressedCertificate.handshakeProducer.produce(hc, cm);
             }
+
+            // The handshake message has been delivered.
+            return null;
         }
 
-        private byte[] onProduceCertificate(ServerHandshakeContext shc,
+        private T13CertificateMessage onProduceCertificate(ServerHandshakeContext shc,
                 HandshakeMessage message) throws IOException {
             ClientHelloMessage clientHello = (ClientHelloMessage)message;
 
@@ -993,12 +995,7 @@ final class CertificateMessage {
                 SSLLogger.fine("Produced server Certificate message", cm);
             }
 
-            // Output the handshake message.
-            cm.write(shc.handshakeOutput);
-            shc.handshakeOutput.flush();
-
-            // The handshake message has been delivered.
-            return null;
+            return cm;
         }
 
         private static SSLPossession choosePossession(
@@ -1045,7 +1042,7 @@ final class CertificateMessage {
             return pos;
         }
 
-        private byte[] onProduceCertificate(ClientHandshakeContext chc,
+        private T13CertificateMessage onProduceCertificate(ClientHandshakeContext chc,
                 HandshakeMessage message) throws IOException {
             ClientHelloMessage clientHello = (ClientHelloMessage)message;
             SSLPossession pos = choosePossession(chc, clientHello);
@@ -1091,12 +1088,7 @@ final class CertificateMessage {
                 SSLLogger.fine("Produced client Certificate message", cm);
             }
 
-            // Output the handshake message.
-            cm.write(chc.handshakeOutput);
-            chc.handshakeOutput.flush();
-
-            // The handshake message has been delivered.
-            return null;
+            return cm;
         }
     }
 
@@ -1116,6 +1108,7 @@ final class CertificateMessage {
             HandshakeContext hc = (HandshakeContext)context;
 
             // clean up this consumer
+            hc.handshakeConsumers.remove(SSLHandshake.COMPRESSED_CERTIFICATE.id);
             hc.handshakeConsumers.remove(SSLHandshake.CERTIFICATE.id);
 
             // Ensure that the Certificate message has not been sent w/o
diff --git a/src/java.base/share/classes/sun/security/ssl/CertificateRequest.java b/src/java.base/share/classes/sun/security/ssl/CertificateRequest.java
index 039399560cd..2eceb4d9ebd 100644
--- a/src/java.base/share/classes/sun/security/ssl/CertificateRequest.java
+++ b/src/java.base/share/classes/sun/security/ssl/CertificateRequest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2015, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2015, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -956,6 +956,11 @@ final class CertificateRequest {
             // update
             //
             shc.certRequestContext = crm.requestContext.clone();
+            if (shc.certInflaters != null && !shc.certInflaters.isEmpty()) {
+                    shc.handshakeConsumers.put(
+                        SSLHandshake.COMPRESSED_CERTIFICATE.id,
+                        SSLHandshake.COMPRESSED_CERTIFICATE);
+            }
             shc.handshakeConsumers.put(SSLHandshake.CERTIFICATE.id,
                     SSLHandshake.CERTIFICATE);
             shc.handshakeConsumers.put(SSLHandshake.CERTIFICATE_VERIFY.id,
diff --git a/src/java.base/share/classes/sun/security/ssl/CompressCertExtension.java b/src/java.base/share/classes/sun/security/ssl/CompressCertExtension.java
new file mode 100644
index 00000000000..eff97857ef0
--- /dev/null
+++ b/src/java.base/share/classes/sun/security/ssl/CompressCertExtension.java
@@ -0,0 +1,306 @@
+/*
+ * Copyright (C) 2022 THL A29 Limited, a Tencent company. All rights reserved.
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.  Oracle designates this
+ * particular file as subject to the "Classpath" exception as provided
+ * by Oracle in the LICENSE file that accompanied this code.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+package sun.security.ssl;
+
+import java.io.IOException;
+import java.nio.ByteBuffer;
+import java.text.MessageFormat;
+import java.util.Locale;
+import java.util.Map;
+import java.util.function.Function;
+import javax.net.ssl.SSLProtocolException;
+import sun.security.ssl.SSLExtension.ExtensionConsumer;
+import sun.security.ssl.SSLExtension.SSLExtensionSpec;
+import sun.security.ssl.SSLHandshake.HandshakeMessage;
+
+/**
+ * Pack of the "compress_certificate" extensions [RFC 5246].
+ */
+final class CompressCertExtension {
+
+    static final HandshakeProducer chNetworkProducer =
+            new CHCompressCertificateProducer();
+    static final ExtensionConsumer chOnLoadConsumer =
+            new CHCompressCertificateConsumer();
+
+    static final HandshakeProducer crNetworkProducer =
+            new CRCompressCertificateProducer();
+    static final ExtensionConsumer crOnLoadConsumer =
+            new CRCompressCertificateConsumer();
+
+    static final SSLStringizer ccStringizer =
+            new CompressCertificateStringizer();
+
+    /**
+     * The "signature_algorithms" extension.
+     */
+    static final class CertCompressionSpec implements SSLExtensionSpec {
+
+        private final int[] compressionAlgorithms;  // non-null
+
+        CertCompressionSpec(
+                Map<Integer, Function<byte[], byte[]>> certInflaters) {
+            compressionAlgorithms = new int[certInflaters.size()];
+            int i = 0;
+            for (Integer id : certInflaters.keySet()) {
+                compressionAlgorithms[i++] = id;
+            }
+        }
+
+        CertCompressionSpec(HandshakeContext hc,
+                ByteBuffer buffer) throws IOException {
+            if (buffer.remaining() < 2) {      // 2: the length of the list
+                throw hc.conContext.fatal(Alert.DECODE_ERROR,
+                        new SSLProtocolException(
+                                "Invalid compress_certificate: insufficient data"));
+            }
+
+            byte[] algs = Record.getBytes8(buffer);
+            if (buffer.hasRemaining()) {
+                throw hc.conContext.fatal(Alert.DECODE_ERROR,
+                        new SSLProtocolException(
+                                "Invalid compress_certificate: unknown extra data"));
+            }
+
+            if (algs.length == 0 || (algs.length & 0x01) != 0) {
+                throw hc.conContext.fatal(Alert.DECODE_ERROR,
+                        new SSLProtocolException(
+                                "Invalid compress_certificate: incomplete data"));
+            }
+
+            int[] compressionAlgs = new int[algs.length / 2];
+            for (int i = 0, j = 0; i < algs.length; ) {
+                byte hash = algs[i++];
+                byte sign = algs[i++];
+                compressionAlgs[j++] = ((hash & 0xFF) << 8) | (sign & 0xFF);
+            }
+
+            this.compressionAlgorithms = compressionAlgs;
+        }
+
+        @Override
+        public String toString() {
+            MessageFormat messageFormat = new MessageFormat(
+                    "\"compression algorithms\": '['{0}']'", Locale.ENGLISH);
+
+            if (compressionAlgorithms.length == 0) {
+                Object[] messageFields = {
+                        "<no supported compression algorithms specified>"
+                };
+                return messageFormat.format(messageFields);
+            } else {
+                StringBuilder builder = new StringBuilder(512);
+                boolean isFirst = true;
+                for (int ca : compressionAlgorithms) {
+                    if (isFirst) {
+                        isFirst = false;
+                    } else {
+                        builder.append(", ");
+                    }
+
+                    builder.append(CompressionAlgorithm.nameOf(ca));
+                }
+
+                Object[] messageFields = {
+                        builder.toString()
+                };
+
+                return messageFormat.format(messageFields);
+            }
+        }
+    }
+
+    private static final
+    class CompressCertificateStringizer implements SSLStringizer {
+
+        @Override
+        public String toString(HandshakeContext hc, ByteBuffer buffer) {
+            try {
+                return (new CertCompressionSpec(hc, buffer)).toString();
+            } catch (IOException ioe) {
+                // For debug logging only, so please swallow exceptions.
+                return ioe.getMessage();
+            }
+        }
+    }
+
+    /**
+     * Network data producer of a "compress_certificate" extension in
+     * the ClientHello handshake message.
+     */
+    private static final
+    class CHCompressCertificateProducer implements HandshakeProducer {
+
+        // Prevent instantiation of this class.
+        private CHCompressCertificateProducer() {
+            // blank
+        }
+
+        @Override
+        public byte[] produce(ConnectionContext context,
+                HandshakeMessage message) throws IOException {
+            // The producing happens in client side only.
+            return produceCompCertExt(context,
+                    SSLExtension.CH_COMPRESS_CERTIFICATE);
+        }
+    }
+
+    /**
+     * Network data consumer of a "compress_certificate" extension in
+     * the ClientHello handshake message.
+     */
+    private static final
+    class CHCompressCertificateConsumer implements ExtensionConsumer {
+
+        // Prevent instantiation of this class.
+        private CHCompressCertificateConsumer() {
+            // blank
+        }
+
+        @Override
+        public void consume(ConnectionContext context,
+                HandshakeMessage message, ByteBuffer buffer)
+                throws IOException {
+            // The consuming happens in server side only.
+            consumeCompCertExt(context, buffer,
+                    SSLExtension.CH_COMPRESS_CERTIFICATE);
+        }
+    }
+
+    /**
+     * Network data producer of a "compress_certificate" extension in
+     * the CertificateRequest handshake message.
+     */
+    private static final
+    class CRCompressCertificateProducer implements HandshakeProducer {
+
+        // Prevent instantiation of this class.
+        private CRCompressCertificateProducer() {
+            // blank
+        }
+
+        @Override
+        public byte[] produce(ConnectionContext context,
+                HandshakeMessage message) throws IOException {
+            // The producing happens in server side only.
+            return produceCompCertExt(context,
+                    SSLExtension.CR_COMPRESS_CERTIFICATE);
+        }
+    }
+
+    /**
+     * Network data consumer of a "compress_certificate" extension in
+     * the CertificateRequest handshake message.
+     */
+    private static final
+    class CRCompressCertificateConsumer implements ExtensionConsumer {
+
+        // Prevent instantiation of this class.
+        private CRCompressCertificateConsumer() {
+            // blank
+        }
+
+        @Override
+        public void consume(ConnectionContext context,
+                HandshakeMessage message, ByteBuffer buffer)
+                throws IOException {
+            // The consuming happens in client side only.
+            consumeCompCertExt(context, buffer,
+                    SSLExtension.CR_COMPRESS_CERTIFICATE);
+        }
+    }
+
+    private static byte[] produceCompCertExt(
+            ConnectionContext context, SSLExtension extension)
+            throws IOException {
+
+        HandshakeContext hc = (HandshakeContext) context;
+        // Is it a supported and enabled extension?
+        if (!hc.sslConfig.isAvailable(extension)) {
+            if (SSLLogger.isOn() && SSLLogger.isOn(SSLLogger.Opt.HANDSHAKE)) {
+                SSLLogger.fine("Ignore unavailable " +
+                        "compress_certificate extension");
+            }
+            return null;
+        }
+
+        // Produce the extension.
+        hc.certInflaters = CompressionAlgorithm.getInflaters();
+
+        if (hc.certInflaters.isEmpty()) {
+            if (SSLLogger.isOn() && SSLLogger.isOn(SSLLogger.Opt.HANDSHAKE)) {
+                SSLLogger.warning("Unable to produce the extension: "
+                        + "no certificate compression inflaters defined");
+            }
+            return null;
+        }
+
+        int vectorLen = CompressionAlgorithm.sizeInRecord() *
+                hc.certInflaters.size();
+        byte[] extData = new byte[vectorLen + 1];
+        ByteBuffer m = ByteBuffer.wrap(extData);
+        Record.putInt8(m, vectorLen);
+        for (Integer algId : hc.certInflaters.keySet()) {
+            Record.putInt16(m, algId);
+        }
+
+        // Update the context.
+        hc.handshakeExtensions.put(
+                extension, new CertCompressionSpec(hc.certInflaters));
+
+        return extData;
+    }
+
+    private static void consumeCompCertExt(ConnectionContext context,
+            ByteBuffer buffer, SSLExtension extension) throws IOException {
+
+        HandshakeContext hc = (HandshakeContext) context;
+        // Is it a supported and enabled extension?
+        if (!hc.sslConfig.isAvailable(extension)) {
+            if (SSLLogger.isOn() && SSLLogger.isOn(SSLLogger.Opt.HANDSHAKE)) {
+                SSLLogger.fine("Ignore unavailable " +
+                        "compress_certificate extension");
+            }
+            return;     // ignore the extension
+        }
+
+        // Parse the extension.
+        CertCompressionSpec spec = new CertCompressionSpec(hc, buffer);
+
+        // Update the context.
+        hc.certDeflater = CompressionAlgorithm.selectDeflater(
+                spec.compressionAlgorithms);
+
+        if (hc.certDeflater == null) {
+            if (SSLLogger.isOn() && SSLLogger.isOn(SSLLogger.Opt.HANDSHAKE)) {
+                SSLLogger.fine("Ignore, no supported " +
+                        "certificate compression algorithms");
+            }
+        }
+        // No impact on session resumption.
+    }
+}
diff --git a/src/java.base/share/classes/sun/security/ssl/CompressedCertificate.java b/src/java.base/share/classes/sun/security/ssl/CompressedCertificate.java
new file mode 100644
index 00000000000..067a0344c9d
--- /dev/null
+++ b/src/java.base/share/classes/sun/security/ssl/CompressedCertificate.java
@@ -0,0 +1,264 @@
+/*
+ * Copyright (C) 2022 THL A29 Limited, a Tencent company. All rights reserved.
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.  Oracle designates this
+ * particular file as subject to the "Classpath" exception as provided
+ * by Oracle in the LICENSE file that accompanied this code.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+package sun.security.ssl;
+
+import java.io.IOException;
+import java.nio.ByteBuffer;
+import java.text.MessageFormat;
+import java.util.Locale;
+import java.util.function.Function;
+import javax.net.ssl.SSLProtocolException;
+import sun.security.ssl.SSLHandshake.HandshakeMessage;
+import sun.security.util.Cache;
+import sun.security.util.Cache.EqualByteArray;
+import sun.security.util.HexDumpEncoder;
+
+/**
+ * Pack of the CompressedCertificate handshake message.
+ */
+final class CompressedCertificate {
+
+    static final SSLConsumer handshakeConsumer =
+            new CompressedCertConsumer();
+    static final HandshakeProducer handshakeProducer =
+            new CompressedCertProducer();
+
+    record CompCertCacheKey(EqualByteArray eba, int algId) {}
+
+    /**
+     * The CompressedCertificate handshake message for TLS 1.3.
+     */
+    static final class CompressedCertMessage extends HandshakeMessage {
+
+        private final int algorithmId;
+        private final int uncompressedLength;
+        private final byte[] compressedCert;
+
+        CompressedCertMessage(HandshakeContext context,
+                int algorithmId, int uncompressedLength,
+                byte[] compressedCert) {
+            super(context);
+
+            this.algorithmId = algorithmId;
+            this.uncompressedLength = uncompressedLength;
+            this.compressedCert = compressedCert;
+        }
+
+        CompressedCertMessage(HandshakeContext handshakeContext,
+                ByteBuffer m) throws IOException {
+            super(handshakeContext);
+
+            // struct {
+            //     CertificateCompressionAlgorithm algorithm;
+            //     uint24 uncompressed_length;
+            //     opaque compressed_certificate_message<1..2^24-1>;
+            // } CompressedCertificate;
+            if (m.remaining() < 9) {
+                throw new SSLProtocolException(
+                        "Invalid CompressedCertificate message: " +
+                                "insufficient data (length=" + m.remaining()
+                                + ")");
+            }
+            this.algorithmId = Record.getInt16(m);
+            this.uncompressedLength = Record.getInt24(m);
+            this.compressedCert = Record.getBytes24(m);
+
+            if (m.hasRemaining()) {
+                throw handshakeContext.conContext.fatal(
+                        Alert.HANDSHAKE_FAILURE,
+                        "Invalid CompressedCertificate message: " +
+                                "unknown extra data");
+            }
+        }
+
+        @Override
+        public SSLHandshake handshakeType() {
+            return SSLHandshake.COMPRESSED_CERTIFICATE;
+        }
+
+        @Override
+        public int messageLength() {
+            return 8 + compressedCert.length;
+        }
+
+        @Override
+        public void send(HandshakeOutStream hos) throws IOException {
+            hos.putInt16(algorithmId);
+            hos.putInt24(uncompressedLength);
+            hos.putBytes24(compressedCert);
+        }
+
+        @Override
+        public String toString() {
+            MessageFormat messageFormat = new MessageFormat(
+                    """
+                    "CompressedCertificate": '{'
+                      "algorithm": "{0}",
+                      "uncompressed_length": {1}
+                      "compressed_certificate_message": [
+                    {2}
+                      ]
+                    '}'""",
+                    Locale.ENGLISH);
+
+            HexDumpEncoder hexEncoder = new HexDumpEncoder();
+            Object[] messageFields = {
+                    CompressionAlgorithm.nameOf(algorithmId),
+                    uncompressedLength,
+                    Utilities.indent(hexEncoder.encode(compressedCert), "    ")
+            };
+
+            return messageFormat.format(messageFields);
+        }
+    }
+
+    /**
+     * The "CompressedCertificate" handshake message producer for TLS 1.3.
+     */
+    private static final
+    class CompressedCertProducer implements HandshakeProducer {
+
+        // Prevent instantiation of this class.
+        private CompressedCertProducer() {
+            // blank
+        }
+
+        // Note this is a special producer, which can only be called from
+        // the CertificateMessage producer.  The input 'message' parameter
+        // represents the Certificate handshake message.
+        @Override
+        public byte[] produce(ConnectionContext context,
+                HandshakeMessage message) throws IOException {
+            // The producing happens in handshake context only.
+            HandshakeContext hc = (HandshakeContext) context;
+
+            // Compress the Certificate message.
+            HandshakeOutStream hos = new HandshakeOutStream(null);
+            message.send(hos);
+            byte[] certMsg = hos.toByteArray();
+            byte[] compressedCertMsg;
+
+            // First byte is the size of certificate_request_context which
+            // should be random if present. Don't cache a randomized message.
+            if (certMsg[0] != 0) {
+                compressedCertMsg = hc.certDeflater.getValue().apply(certMsg);
+            } else {
+                Cache<CompCertCacheKey, byte[]> cache =
+                        hc.sslContext.getCompCertCache();
+                CompCertCacheKey key = new CompCertCacheKey(
+                        new EqualByteArray(certMsg), hc.certDeflater.getKey());
+                compressedCertMsg = cache.get(key);
+
+                if (compressedCertMsg == null) {
+                    compressedCertMsg =
+                            hc.certDeflater.getValue().apply(certMsg);
+
+                    if (SSLLogger.isOn()
+                            && SSLLogger.isOn(SSLLogger.Opt.HANDSHAKE)) {
+                        SSLLogger.fine("Caching CompressedCertificate message");
+                    }
+
+                    cache.put(key, compressedCertMsg);
+                }
+            }
+
+            if (compressedCertMsg == null || compressedCertMsg.length == 0) {
+                throw hc.conContext.fatal(Alert.HANDSHAKE_FAILURE,
+                        "No compressed Certificate data");
+            }
+
+            CompressedCertMessage ccm = new CompressedCertMessage(hc,
+                    hc.certDeflater.getKey(), certMsg.length,
+                    compressedCertMsg);
+
+            if (SSLLogger.isOn() && SSLLogger.isOn(SSLLogger.Opt.HANDSHAKE)) {
+                SSLLogger.fine(
+                        "Produced CompressedCertificate handshake message",
+                        ccm);
+            }
+
+            ccm.write(hc.handshakeOutput);
+            hc.handshakeOutput.flush();
+
+            // The handshake message has been delivered.
+            return null;
+        }
+    }
+
+    /**
+     * The "CompressedCertificate" handshake message consumer for TLS 1.3.
+     */
+    private static final class CompressedCertConsumer implements SSLConsumer {
+
+        // Prevent instantiation of this class.
+        private CompressedCertConsumer() {
+            // blank
+        }
+
+        @Override
+        public void consume(ConnectionContext context,
+                ByteBuffer message) throws IOException {
+            // The consuming happens in handshake context only.
+            HandshakeContext hc = (HandshakeContext) context;
+
+            // clean up this consumer
+            hc.handshakeConsumers.remove(
+                    SSLHandshake.COMPRESSED_CERTIFICATE.id);
+            hc.handshakeConsumers.remove(SSLHandshake.CERTIFICATE.id);
+
+            // Parse the handshake message
+            CompressedCertMessage ccm = new CompressedCertMessage(hc, message);
+            if (SSLLogger.isOn() && SSLLogger.isOn(SSLLogger.Opt.HANDSHAKE)) {
+                SSLLogger.fine(
+                        "Consuming CompressedCertificate handshake message",
+                        ccm);
+            }
+
+            // check the compression algorithm
+            Function<byte[], byte[]> inflater =
+                    hc.certInflaters.get(ccm.algorithmId);
+            if (inflater == null) {
+                throw hc.conContext.fatal(Alert.BAD_CERTIFICATE,
+                        "Unsupported certificate compression algorithm");
+            }
+
+            // decompress
+            byte[] certificateMessage = inflater.apply(ccm.compressedCert);
+
+            // check the uncompressed length
+            if (certificateMessage == null ||
+                    certificateMessage.length != ccm.uncompressedLength) {
+                throw hc.conContext.fatal(Alert.BAD_CERTIFICATE,
+                        "Improper certificate compression");
+            }
+
+            // Call the Certificate handshake message consumer.
+            CertificateMessage.t13HandshakeConsumer.consume(hc,
+                    ByteBuffer.wrap(certificateMessage));
+        }
+    }
+}
diff --git a/src/java.base/share/classes/sun/security/ssl/CompressionAlgorithm.java b/src/java.base/share/classes/sun/security/ssl/CompressionAlgorithm.java
new file mode 100644
index 00000000000..3e9ef154424
--- /dev/null
+++ b/src/java.base/share/classes/sun/security/ssl/CompressionAlgorithm.java
@@ -0,0 +1,182 @@
+/*
+ * Copyright (C) 2022 THL A29 Limited, a Tencent company. All rights reserved.
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.  Oracle designates this
+ * particular file as subject to the "Classpath" exception as provided
+ * by Oracle in the LICENSE file that accompanied this code.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+package sun.security.ssl;
+
+import java.io.ByteArrayOutputStream;
+import java.util.AbstractMap;
+import java.util.Map;
+import java.util.function.Function;
+import java.util.zip.Deflater;
+import java.util.zip.Inflater;
+
+/**
+ * Enum for TLS certificate compression algorithms.
+ * This class also defines internally supported inflate/deflate functions.
+ */
+
+enum CompressionAlgorithm {
+    ZLIB(1);  // Currently only ZLIB is supported.
+
+    final int id;
+
+    CompressionAlgorithm(int id) {
+        this.id = id;
+    }
+
+    static CompressionAlgorithm nameOf(int id) {
+        for (CompressionAlgorithm ca : CompressionAlgorithm.values()) {
+            if (ca.id == id) {
+                return ca;
+            }
+        }
+
+        return null;
+    }
+
+    // Return the size of a compression algorithms structure in TLS record.
+    static int sizeInRecord() {
+        return 2;
+    }
+
+    // The size of compression/decompression buffer.
+    private static final int BUF_SIZE = 1024;
+
+    private static final Map<Integer, Function<byte[], byte[]>> DEFLATORS =
+            Map.of(ZLIB.id, (input) -> {
+                try (Deflater deflater = new Deflater();
+                        ByteArrayOutputStream outputStream =
+                                new ByteArrayOutputStream(input.length)) {
+
+                    deflater.setInput(input);
+                    deflater.finish();
+                    byte[] buffer = new byte[BUF_SIZE];
+
+                    while (!deflater.finished()) {
+                        int compressedSize = deflater.deflate(buffer);
+                        outputStream.write(buffer, 0, compressedSize);
+                    }
+
+                    return outputStream.toByteArray();
+                } catch (Exception e) {
+                    if (SSLLogger.isOn()
+                            && SSLLogger.isOn(SSLLogger.Opt.HANDSHAKE)) {
+                        SSLLogger.warning("Exception during certificate "
+                                + "compression: ", e);
+                    }
+                    return null;
+                }
+            });
+
+    static Map.Entry<Integer, Function<byte[], byte[]>> selectDeflater(
+            int[] compressionAlgorithmIds) {
+
+        for (var entry : DEFLATORS.entrySet()) {
+            for (int id : compressionAlgorithmIds) {
+                if (id == entry.getKey()) {
+                    return new AbstractMap.SimpleImmutableEntry<>(entry);
+                }
+            }
+        }
+
+        return null;
+    }
+
+    private static final Map<Integer, Function<byte[], byte[]>> INFLATORS =
+            Map.of(ZLIB.id, (input) -> {
+                try (Inflater inflater = new Inflater();
+                        ByteArrayOutputStream outputStream =
+                                new ByteArrayOutputStream(input.length)) {
+
+                    inflater.setInput(input);
+                    byte[] buffer = new byte[BUF_SIZE];
+
+                    while (!inflater.finished()) {
+                        int decompressedSize = inflater.inflate(buffer);
+
+                        if (decompressedSize == 0) {
+                            if (inflater.needsDictionary()) {
+                                if (SSLLogger.isOn()
+                                        && SSLLogger.isOn(
+                                        SSLLogger.Opt.HANDSHAKE)) {
+                                    SSLLogger.warning("Compressed input "
+                                            + "requires a dictionary");
+                                }
+
+                                return null;
+                            }
+
+                            if (inflater.needsInput()) {
+                                if (SSLLogger.isOn()
+                                        && SSLLogger.isOn(
+                                        SSLLogger.Opt.HANDSHAKE)) {
+                                    SSLLogger.warning(
+                                            "Incomplete compressed input");
+                                }
+
+                                return null;
+                            }
+
+                            // Else just break the loop.
+                            break;
+                        }
+
+                        outputStream.write(buffer, 0, decompressedSize);
+
+                        // Bound the memory usage.
+                        if (outputStream.size()
+                                > SSLConfiguration.maxHandshakeMessageSize) {
+                            if (SSLLogger.isOn()
+                                    && SSLLogger.isOn(
+                                    SSLLogger.Opt.HANDSHAKE)) {
+                                SSLLogger.warning("The size of the "
+                                        + "uncompressed certificate message "
+                                        + "exceeds maximum allowed size of "
+                                        + SSLConfiguration.maxHandshakeMessageSize
+                                        + " bytes; compressed size: "
+                                        + input.length);
+                            }
+
+                            return null;
+                        }
+                    }
+
+                    return outputStream.toByteArray();
+                } catch (Exception e) {
+                    if (SSLLogger.isOn()
+                            && SSLLogger.isOn(SSLLogger.Opt.HANDSHAKE)) {
+                        SSLLogger.warning(
+                                "Exception during certificate decompression: ",
+                                e);
+                    }
+                    return null;
+                }
+            });
+
+    static Map<Integer, Function<byte[], byte[]>> getInflaters() {
+        return INFLATORS;
+    }
+}
diff --git a/src/java.base/share/classes/sun/security/ssl/HandshakeContext.java b/src/java.base/share/classes/sun/security/ssl/HandshakeContext.java
index 54a2650c058..fbf2c00bbb4 100644
--- a/src/java.base/share/classes/sun/security/ssl/HandshakeContext.java
+++ b/src/java.base/share/classes/sun/security/ssl/HandshakeContext.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -33,6 +33,7 @@ import java.security.AlgorithmConstraints;
 import java.security.CryptoPrimitive;
 import java.util.*;
 import java.util.AbstractMap.SimpleImmutableEntry;
+import java.util.function.Function;
 import javax.crypto.SecretKey;
 import javax.net.ssl.SNIServerName;
 import javax.net.ssl.SSLHandshakeException;
@@ -131,6 +132,10 @@ abstract class HandshakeContext implements ConnectionContext {
     List<SignatureScheme>                   peerRequestedSignatureSchemes;
     List<SignatureScheme>                   peerRequestedCertSignSchemes;
 
+    // CertificateCompressionAlgorithm
+    Map<Integer, Function<byte[], byte[]>>          certInflaters;
+    Map.Entry<Integer, Function<byte[], byte[]>>    certDeflater;
+
     // Known authorities
     X500Principal[]                         peerSupportedAuthorities = null;
 
diff --git a/src/java.base/share/classes/sun/security/ssl/QuicTLSEngineImpl.java b/src/java.base/share/classes/sun/security/ssl/QuicTLSEngineImpl.java
index b5f1eff179c..3384bf5f089 100644
--- a/src/java.base/share/classes/sun/security/ssl/QuicTLSEngineImpl.java
+++ b/src/java.base/share/classes/sun/security/ssl/QuicTLSEngineImpl.java
@@ -73,6 +73,7 @@ public final class QuicTLSEngineImpl implements QuicTLSEngine, SSLTransport {
                     SSLHandshake.ENCRYPTED_EXTENSIONS.id, HANDSHAKE,
                     SSLHandshake.CERTIFICATE_REQUEST.id, HANDSHAKE,
                     SSLHandshake.CERTIFICATE.id, HANDSHAKE,
+                    SSLHandshake.COMPRESSED_CERTIFICATE.id, HANDSHAKE,
                     SSLHandshake.CERTIFICATE_VERIFY.id, HANDSHAKE,
                     SSLHandshake.FINISHED.id, HANDSHAKE,
                     SSLHandshake.NEW_SESSION_TICKET.id, ONE_RTT);
diff --git a/src/java.base/share/classes/sun/security/ssl/SSLContextImpl.java b/src/java.base/share/classes/sun/security/ssl/SSLContextImpl.java
index a1cc3ee112f..fdeb94bb496 100644
--- a/src/java.base/share/classes/sun/security/ssl/SSLContextImpl.java
+++ b/src/java.base/share/classes/sun/security/ssl/SSLContextImpl.java
@@ -34,7 +34,9 @@ import java.util.concurrent.locks.ReentrantLock;
 import java.util.stream.Collectors;
 import javax.net.ssl.*;
 import sun.security.provider.certpath.AlgorithmChecker;
+import sun.security.ssl.CompressedCertificate.CompCertCacheKey;
 import sun.security.ssl.SSLAlgorithmConstraints.SIGNATURE_CONSTRAINTS_MODE;
+import sun.security.util.Cache;
 import sun.security.validator.Validator;
 
 /**
@@ -73,6 +75,10 @@ public abstract class SSLContextImpl extends SSLContextSpi {
 
     private final ReentrantLock contextLock = new ReentrantLock();
 
+    // Avoid compressing local certificates repeatedly for every handshake.
+    private final Cache<CompCertCacheKey, byte[]> compCertCache =
+            Cache.newSoftMemoryCache(12);
+
     SSLContextImpl() {
         ephemeralKeyManager = new EphemeralKeyManager();
         clientCache = new SSLSessionContextImpl(false);
@@ -225,6 +231,10 @@ public abstract class SSLContextImpl extends SSLContextSpi {
         return ephemeralKeyManager;
     }
 
+    Cache<CompCertCacheKey, byte[]> getCompCertCache() {
+        return compCertCache;
+    }
+
     // Used for DTLS in server mode only.
     HelloCookieManager getHelloCookieManager(ProtocolVersion protocolVersion) {
         if (helloCookieManagerBuilder == null) {
diff --git a/src/java.base/share/classes/sun/security/ssl/SSLExtension.java b/src/java.base/share/classes/sun/security/ssl/SSLExtension.java
index aacb9420748..b13edc0359c 100644
--- a/src/java.base/share/classes/sun/security/ssl/SSLExtension.java
+++ b/src/java.base/share/classes/sun/security/ssl/SSLExtension.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -270,6 +270,27 @@ enum SSLExtension implements SSLStringizer {
     // Extensions defined in RFC 7924 (TLS Cached Information Extension)
     CACHED_INFO             (0x0019, "cached_info"),
 
+    // Extensions defined in RFC 8879 (TLS Certificate Compression)
+    CH_COMPRESS_CERTIFICATE (0x001B, "compress_certificate",
+                             SSLHandshake.CLIENT_HELLO,
+                             ProtocolVersion.PROTOCOLS_OF_13,
+                             CompressCertExtension.chNetworkProducer,
+                             CompressCertExtension.chOnLoadConsumer,
+                             null,
+                             null,
+                             null,
+                             CompressCertExtension.ccStringizer),
+
+    CR_COMPRESS_CERTIFICATE (0x001B, "compress_certificate",
+                             SSLHandshake.CERTIFICATE_REQUEST,
+                             ProtocolVersion.PROTOCOLS_OF_13,
+                             CompressCertExtension.crNetworkProducer,
+                             CompressCertExtension.crOnLoadConsumer,
+                             null,
+                             null,
+                             null,
+                             CompressCertExtension.ccStringizer),
+
     // Extensions defined in RFC 5077 (TLS Session Resumption without Server-Side State)
     CH_SESSION_TICKET       (0x0023, "session_ticket",
             SSLHandshake.CLIENT_HELLO,
diff --git a/src/java.base/share/classes/sun/security/ssl/SSLHandshake.java b/src/java.base/share/classes/sun/security/ssl/SSLHandshake.java
index 7c78f6c3005..2c6b58bafa5 100644
--- a/src/java.base/share/classes/sun/security/ssl/SSLHandshake.java
+++ b/src/java.base/share/classes/sun/security/ssl/SSLHandshake.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2006, 2024, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2006, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -370,7 +370,22 @@ enum SSLHandshake implements SSLConsumer, HandshakeProducer {
             }),
 
     // RFC 8879 - TLS Certificate Compression
-    COMPRESSED_CERTIFICATE      ((byte)0x19, "compressed_certificate"),
+    @SuppressWarnings({"unchecked", "rawtypes"})
+    COMPRESSED_CERTIFICATE      ((byte)0x19, "compressed_certificate",
+            (new Map.Entry[] {
+                    new SimpleImmutableEntry<>(
+                            CompressedCertificate.handshakeConsumer,
+                            ProtocolVersion.PROTOCOLS_OF_13
+                    )
+            }),
+            (new Map.Entry[] {
+                    // Note that the producing of this message is delegated to
+                    // CertificateMessage producer.
+                    new SimpleImmutableEntry<>(
+                            CertificateMessage.t13HandshakeProducer,
+                            ProtocolVersion.PROTOCOLS_OF_13
+                    )
+            })),
 
     // RFC 8870 - Encrypted Key Transport for DTLS/Secure RTP
     EKT_KEY                     ((byte)0x1A, "ekt_key"),
diff --git a/src/java.base/share/classes/sun/security/ssl/ServerHello.java b/src/java.base/share/classes/sun/security/ssl/ServerHello.java
index 6980c216697..4bd2b0a059f 100644
--- a/src/java.base/share/classes/sun/security/ssl/ServerHello.java
+++ b/src/java.base/share/classes/sun/security/ssl/ServerHello.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2015, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2015, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -1461,6 +1461,11 @@ final class ServerHello {
             chc.handshakeConsumers.put(
                     SSLHandshake.CERTIFICATE_REQUEST.id,
                     SSLHandshake.CERTIFICATE_REQUEST);
+            if (chc.certInflaters != null && !chc.certInflaters.isEmpty()) {
+                chc.handshakeConsumers.put(
+                        SSLHandshake.COMPRESSED_CERTIFICATE.id,
+                        SSLHandshake.COMPRESSED_CERTIFICATE);
+            }
             chc.handshakeConsumers.put(
                     SSLHandshake.CERTIFICATE.id,
                     SSLHandshake.CERTIFICATE);
diff --git a/test/jdk/java/net/httpclient/HeadTest.java b/test/jdk/java/net/httpclient/HeadTest.java
index c0bef240520..5694e4f6016 100644
--- a/test/jdk/java/net/httpclient/HeadTest.java
+++ b/test/jdk/java/net/httpclient/HeadTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2025, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -22,14 +22,25 @@
  */
 
 /*
- * @test
- * @bug 8203433 8276559
+ * @test id=withCertificateCompression
+ * @bug 8203433 8276559 8372526
  * @summary Tests Client handles HEAD and 304 responses correctly.
  * @library /test/lib /test/jdk/java/net/httpclient/lib
  * @build jdk.test.lib.net.SimpleSSLContext
  * @run junit/othervm -Djdk.httpclient.HttpClient.log=trace,headers,requests ${test.main.class}
  */
 
+/*
+ * @test id=withoutCertificateCompression
+ * @bug 8203433 8276559 8372526
+ * @summary Tests Client handles HEAD and 304 responses correctly.
+ * @library /test/lib /test/jdk/java/net/httpclient/lib
+ * @build jdk.test.lib.net.SimpleSSLContext
+ * @run junit/othervm -Djdk.tls.client.disableExtensions=compress_certificate
+ *                    -Djdk.tls.server.disableExtensions=compress_certificate
+ *                    -Djdk.httpclient.HttpClient.log=trace,headers,requests HeadTest
+ */
+
 import jdk.test.lib.net.SimpleSSLContext;
 
 import javax.net.ssl.SSLContext;
diff --git a/test/jdk/java/net/httpclient/LargeHandshakeTest.java b/test/jdk/java/net/httpclient/LargeHandshakeTest.java
index 59cdad27cbc..ec4cd8be4aa 100644
--- a/test/jdk/java/net/httpclient/LargeHandshakeTest.java
+++ b/test/jdk/java/net/httpclient/LargeHandshakeTest.java
@@ -66,9 +66,9 @@ import static java.net.http.HttpClient.Version.HTTP_3;
 import static java.net.http.HttpOption.Http3DiscoveryMode.HTTP_3_URI_ONLY;
 import static java.net.http.HttpOption.H3_DISCOVERY;
 
-/**
- * @test
- * @bug 8231449
+/*
+ * @test id=withCertificateCompression
+ * @bug 8231449 8372526
  * @summary This test verifies that the HttpClient works correctly when the server
  *          sends a large certificate. This test will not pass without
  *          the fix for JDK-8231449. To regenerate the certificate, modify the
@@ -91,6 +91,35 @@ import static java.net.http.HttpOption.H3_DISCOVERY;
  *                   ${test.main.class}
  *
  */
+
+/*
+ * @test id=withoutCertificateCompression
+ * @bug 8231449 8372526
+ * @summary This test verifies that the HttpClient works correctly when the server
+ *          sends a large certificate. This test will not pass without
+ *          the fix for JDK-8231449. To regenerate the certificate, modify the
+ *          COMMAND constant as you need, possibly changing the start date
+ *          and validity of the certificate in the command, then run the test.
+ *          The test will run with the old certificate, but will print the new command.
+ *          Copy paste the new command printed by this test into a terminal.
+ *          Then modify the at run line to pass the file generated by that command
+ *          as first argument, and copy paste the new values of the COMMAND and
+ *          BASE64_CERT constant printed by the test into the test.
+ *          Then restore the original at run line and test again.
+ * @library /test/lib /test/jdk/java/net/httpclient/lib
+ * @build jdk.httpclient.test.lib.common.HttpServerAdapters jdk.test.lib.net.SimpleSSLContext
+ *        DigestEchoServer
+ *        jdk.httpclient.test.lib.common.TestServerConfigurator
+ * @run main/othervm -Djdk.tls.client.disableExtensions=compress_certificate
+ *                   -Djdk.tls.server.disableExtensions=compress_certificate
+ *                   -Dtest.requiresHost=true
+ *                   -Djdk.httpclient.HttpClient.log=headers
+ *                   -Djdk.internal.httpclient.debug=true
+ *                   -Djdk.tls.maxHandshakeMessageSize=131072
+ *                   LargeHandshakeTest
+ *
+ */
+
 public class LargeHandshakeTest implements HttpServerAdapters {
 
     // Use this command to regenerate the keystore file whose content is
diff --git a/test/jdk/sun/security/ssl/CertificateCompression/BoundDecompressMemory.java b/test/jdk/sun/security/ssl/CertificateCompression/BoundDecompressMemory.java
new file mode 100644
index 00000000000..92e771f2a4a
--- /dev/null
+++ b/test/jdk/sun/security/ssl/CertificateCompression/BoundDecompressMemory.java
@@ -0,0 +1,86 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+import static jdk.test.lib.Asserts.assertEquals;
+import static jdk.test.lib.Asserts.assertNotNull;
+import static jdk.test.lib.Asserts.assertTrue;
+import static jdk.test.lib.Utils.runAndCheckException;
+import static jdk.test.lib.security.SecurityUtils.runAndGetLog;
+
+import java.util.Scanner;
+import javax.net.ssl.SSLHandshakeException;
+
+/*
+ * @test
+ * @bug 8372526
+ * @summary Bound the memory usage when decompressing CompressedCertificate.
+ * @modules java.base/sun.security.x509
+ *          java.base/sun.security.util
+ * @library /javax/net/ssl/templates
+ *          /test/lib
+ * @run main/othervm BoundDecompressMemory
+ */
+
+public class BoundDecompressMemory extends CompressedCertMsgCache {
+
+    private static final int MAX_HANDSHAKE_MESSAGE_SIZE = 4096;
+
+    public static void main(String[] args) throws Exception {
+        System.setProperty("jdk.tls.maxHandshakeMessageSize",
+                Integer.toString(MAX_HANDSHAKE_MESSAGE_SIZE));
+
+        String log = runAndGetLog(() -> {
+            try {
+                // Use highly compressible subject name for server's certificate.
+                serverCertSubjectName = "O=Some-Org"
+                        + "A".repeat(MAX_HANDSHAKE_MESSAGE_SIZE)
+                        + ", L=Some-City, ST=Some-State, C=US";
+
+                setupCertificates();
+                serverSslContext = getSSLContext(trustedCert, serverCert,
+                        serverKeys.getPrivate(), "TLSv1.3");
+                clientSslContext = getSSLContext(trustedCert, clientCert,
+                        clientKeys.getPrivate(), "TLSv1.3");
+
+                runAndCheckException(() -> new BoundDecompressMemory().run(),
+                        serverEx -> {
+                            Throwable clientEx = serverEx.getSuppressed()[0];
+                            assertTrue(
+                                    clientEx instanceof SSLHandshakeException);
+                            assertEquals("(bad_certificate) Improper "
+                                            + "certificate compression",
+                                    clientEx.getMessage());
+                        }
+                );
+            } catch (Exception _) {
+            }
+        });
+
+        // Check for the specific decompression error message.
+        assertNotNull(new Scanner(log).findWithinHorizon("The size of the "
+                + "uncompressed certificate message "
+                + "exceeds maximum allowed size of "
+                + MAX_HANDSHAKE_MESSAGE_SIZE
+                + " bytes; compressed size: \\d+", 0));
+    }
+}
diff --git a/test/jdk/sun/security/ssl/CertificateCompression/ClientCertCompressionExt.java b/test/jdk/sun/security/ssl/CertificateCompression/ClientCertCompressionExt.java
new file mode 100644
index 00000000000..2708f1e6872
--- /dev/null
+++ b/test/jdk/sun/security/ssl/CertificateCompression/ClientCertCompressionExt.java
@@ -0,0 +1,157 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+import static jdk.test.lib.Asserts.assertEquals;
+
+import java.nio.ByteBuffer;
+import java.util.ArrayList;
+import java.util.List;
+import java.util.Objects;
+
+/*
+ * @test
+ * @bug 8372526
+ * @summary Add support for ZLIB TLS Certificate Compression.
+ * @library /javax/net/ssl/templates
+ *          /test/lib
+ *
+ * @run main/othervm ClientCertCompressionExt
+ * @run main/othervm -Djdk.tls.client.disableExtensions=compress_certificate
+ *                   ClientCertCompressionExt
+ *
+ */
+
+public class ClientCertCompressionExt extends SSLEngineTemplate {
+
+    private static final int CLI_HELLO_MSG = 1;
+    private static final int COMP_CERT_EXT = 27;
+    // zlib(1), brotli(2), zstd(3)
+    private static final List<Integer> DEFAULT_COMP_ALGS = List.of(1);
+
+    ClientCertCompressionExt() throws Exception {
+        super();
+    }
+
+    public static void main(String[] args) throws Exception {
+        new ClientCertCompressionExt().runTest(
+                !System.getProperty("jdk.tls.client.disableExtensions", "")
+                        .contains("compress_certificate"));
+    }
+
+    private void runTest(boolean shouldProduceExt) throws Exception {
+        // Produce client_hello
+        clientEngine.wrap(clientOut, cTOs);
+        cTOs.flip();
+
+        checkClientHello(shouldProduceExt);
+    }
+
+    private void checkClientHello(boolean shouldProduceExt) throws Exception {
+        List<Integer> compCertExt = getCompAlgsCliHello(
+                extractHandshakeMsg(cTOs, CLI_HELLO_MSG, false));
+
+        if (shouldProduceExt) {
+            assertEquals(DEFAULT_COMP_ALGS, compCertExt,
+                    "Unexpected compress_certificate extension algorithms: "
+                            + compCertExt);
+        } else {
+            assertEquals(compCertExt.size(), 0,
+                    "compress_certificate extension present in ClientHello");
+        }
+    }
+
+    /**
+     * Parses the ClientHello message and extracts from it a list of
+     * compression algorithm values. It is assumed that the provided
+     * ByteBuffer has its position set at the first byte of the ClientHello
+     * message body (AFTER the handshake header) and contains the entire
+     * hello message.  Upon successful completion of this method the ByteBuffer
+     * will have its position reset to the initial offset in the buffer.
+     * If an exception is thrown the position at the time of the exception
+     * will be preserved.
+     *
+     * @param data The ByteBuffer containing the ClientHello bytes.
+     * @return A List of the compression algorithm values.
+     */
+    private List<Integer> getCompAlgsCliHello(ByteBuffer data) {
+        Objects.requireNonNull(data);
+        data.mark();
+
+        // Skip over the protocol version and client random
+        data.position(data.position() + 34);
+
+        // Jump past the session ID (if there is one)
+        int sessLen = Byte.toUnsignedInt(data.get());
+        if (sessLen != 0) {
+            data.position(data.position() + sessLen);
+        }
+
+        // Jump past the cipher suites
+        int csLen = Short.toUnsignedInt(data.getShort());
+        if (csLen != 0) {
+            data.position(data.position() + csLen);
+        }
+
+        // ...and the compression
+        int compLen = Byte.toUnsignedInt(data.get());
+        if (compLen != 0) {
+            data.position(data.position() + compLen);
+        }
+
+        List<Integer> extSigAlgs = getCompAlgsFromExt(data);
+
+        // We should be at the end of the ClientHello
+        data.reset();
+        return extSigAlgs;
+    }
+
+    /**
+     * Gets compression algorithms from the given TLS extension.
+     * The buffer should be positioned at the start of the extension.
+     */
+    private List<Integer> getCompAlgsFromExt(ByteBuffer data) {
+
+        List<Integer> extCompAlgs = new ArrayList<>();
+        data.getShort(); // read length
+
+        while (data.hasRemaining()) {
+            int extType = Short.toUnsignedInt(data.getShort());
+            int extLen = Short.toUnsignedInt(data.getShort());
+
+            if (extType == COMP_CERT_EXT) {
+                int sigSchemeLen = data.get();
+
+                for (int ssOff = 0; ssOff < sigSchemeLen; ssOff += 2) {
+                    Integer schemeName = Short.toUnsignedInt(data.getShort());
+                    extCompAlgs.add(schemeName);
+                }
+            } else {
+                // Not the extension we're looking for.  Skip past the
+                // extension data
+                data.position(data.position() + extLen);
+            }
+        }
+
+        return extCompAlgs;
+    }
+}
diff --git a/test/jdk/sun/security/ssl/CertificateCompression/CompressedCertMsg.java b/test/jdk/sun/security/ssl/CertificateCompression/CompressedCertMsg.java
new file mode 100644
index 00000000000..265ba3a8fc9
--- /dev/null
+++ b/test/jdk/sun/security/ssl/CertificateCompression/CompressedCertMsg.java
@@ -0,0 +1,151 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+import static jdk.test.lib.Asserts.assertEquals;
+import static jdk.test.lib.security.SecurityUtils.countSubstringOccurrences;
+import static jdk.test.lib.security.SecurityUtils.runAndGetLog;
+
+import javax.net.ssl.SSLParameters;
+import javax.net.ssl.SSLServerSocket;
+
+/*
+ * @test
+ * @bug 8372526
+ * @summary Add support for ZLIB TLS Certificate Compression
+ * @library /javax/net/ssl/templates
+ *          /test/lib
+ *
+ * @run main/othervm CompressedCertMsg
+ * @run main/othervm -Djdk.tls.client.disableExtensions=compress_certificate CompressedCertMsg
+ * @run main/othervm -Djdk.tls.server.disableExtensions=compress_certificate CompressedCertMsg
+ * @run main/othervm -Djdk.tls.client.disableExtensions=compress_certificate
+ *                   -Djdk.tls.server.disableExtensions=compress_certificate
+ *                   CompressedCertMsg
+ */
+
+public class CompressedCertMsg extends SSLSocketTemplate {
+
+    private static final String PRODUCED_COMP_CERT_MSG =
+            """
+            Produced CompressedCertificate handshake message (
+            "CompressedCertificate": {
+              "algorithm": "ZLIB",
+            """;
+
+    private static final String CONSUMING_COMP_CERT_MSG =
+            """
+            Consuming CompressedCertificate handshake message (
+            "CompressedCertificate": {
+              "algorithm": "ZLIB",
+            """;
+
+    private static final String IGNORE_EXT_MSG =
+            """
+            Ignore unknown or unsupported extension (
+            "compress_certificate (27)": {
+            """;
+
+    private static final String CH_EXT =
+            """
+                },
+                "compress_certificate (27)": {
+                  "compression algorithms": [ZLIB]
+                },
+            """;
+
+    private static final String CR_EXT =
+            """
+            "CertificateRequest": {
+              "certificate_request_context": "",
+              "extensions": [
+                "compress_certificate (27)": {
+                  "compression algorithms": [ZLIB]
+            """;
+
+    // Server sends CertificateRequest and gets a certificate
+    // from the client as well as the client from the server.
+    @Override
+    protected void configureServerSocket(SSLServerSocket sslServerSocket) {
+        SSLParameters sslParameters = sslServerSocket.getSSLParameters();
+        sslParameters.setNeedClientAuth(true);
+        sslServerSocket.setSSLParameters(sslParameters);
+    }
+
+    public static void main(String[] args) throws Exception {
+        boolean clientSideEnabled = !System.getProperty(
+                        "jdk.tls.client.disableExtensions", "")
+                .contains("compress_certificate");
+        boolean serverSideEnabled = !System.getProperty(
+                        "jdk.tls.server.disableExtensions", "")
+                .contains("compress_certificate");
+
+        // Complete 1 handshake.
+        String log = runAndGetLog(() -> {
+            try {
+                new CompressedCertMsg().run();
+            } catch (Exception _) {
+            }
+        });
+
+        // To make the test pass on Windows.
+        log = log.replace("\r\n", "\n");
+
+        if (clientSideEnabled && serverSideEnabled) {
+            // Make sure CompressedCertificate message is produced and consumed
+            // twice - by the server and by the client.
+            assertEquals(2, countSubstringOccurrences(log,
+                    PRODUCED_COMP_CERT_MSG));
+            assertEquals(2, countSubstringOccurrences(log,
+                    CONSUMING_COMP_CERT_MSG));
+            // Extensions are produced and consumed, so they appear in the
+            // log twice.
+            assertEquals(2, countSubstringOccurrences(log, CH_EXT));
+            assertEquals(2, countSubstringOccurrences(log, CR_EXT));
+            assertEquals(0, countSubstringOccurrences(log, IGNORE_EXT_MSG));
+        } else if (clientSideEnabled) {
+            assertEquals(0, countSubstringOccurrences(log,
+                    PRODUCED_COMP_CERT_MSG));
+            assertEquals(0, countSubstringOccurrences(log,
+                    CONSUMING_COMP_CERT_MSG));
+            assertEquals(2, countSubstringOccurrences(log, CH_EXT));
+            assertEquals(0, countSubstringOccurrences(log, CR_EXT));
+            assertEquals(1, countSubstringOccurrences(log, IGNORE_EXT_MSG));
+        } else if (serverSideEnabled) {
+            assertEquals(0, countSubstringOccurrences(log,
+                    PRODUCED_COMP_CERT_MSG));
+            assertEquals(0, countSubstringOccurrences(log,
+                    CONSUMING_COMP_CERT_MSG));
+            assertEquals(0, countSubstringOccurrences(log, CH_EXT));
+            assertEquals(2, countSubstringOccurrences(log, CR_EXT));
+            assertEquals(1, countSubstringOccurrences(log, IGNORE_EXT_MSG));
+        } else {
+            assertEquals(0, countSubstringOccurrences(log,
+                    PRODUCED_COMP_CERT_MSG));
+            assertEquals(0, countSubstringOccurrences(log,
+                    CONSUMING_COMP_CERT_MSG));
+            assertEquals(0, countSubstringOccurrences(log, CH_EXT));
+            assertEquals(0, countSubstringOccurrences(log, CR_EXT));
+            assertEquals(0, countSubstringOccurrences(log, IGNORE_EXT_MSG));
+        }
+    }
+}
diff --git a/test/jdk/sun/security/ssl/CertificateCompression/CompressedCertMsgCache.java b/test/jdk/sun/security/ssl/CertificateCompression/CompressedCertMsgCache.java
new file mode 100644
index 00000000000..42e9701c6d0
--- /dev/null
+++ b/test/jdk/sun/security/ssl/CertificateCompression/CompressedCertMsgCache.java
@@ -0,0 +1,197 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+import static jdk.test.lib.Asserts.assertEquals;
+import static jdk.test.lib.security.SecurityUtils.countSubstringOccurrences;
+import static jdk.test.lib.security.SecurityUtils.runAndGetLog;
+
+import java.io.IOException;
+import java.math.BigInteger;
+import java.security.KeyPair;
+import java.security.KeyPairGenerator;
+import java.security.KeyStore;
+import java.security.PrivateKey;
+import java.security.PublicKey;
+import java.security.SecureRandom;
+import java.security.cert.Certificate;
+import java.security.cert.CertificateException;
+import java.security.cert.X509Certificate;
+import java.time.Instant;
+import java.time.temporal.ChronoUnit;
+import java.util.Date;
+import javax.net.ssl.KeyManagerFactory;
+import javax.net.ssl.SSLContext;
+import javax.net.ssl.TrustManagerFactory;
+import jdk.test.lib.security.CertificateBuilder;
+
+/*
+ * @test
+ * @bug 8372526
+ * @summary Check CompressedCertificate message cache.
+ * @modules java.base/sun.security.x509
+ *          java.base/sun.security.util
+ * @library /javax/net/ssl/templates
+ *          /test/lib
+ * @run main/othervm CompressedCertMsgCache
+ */
+
+public class CompressedCertMsgCache extends SSLSocketTemplate {
+
+    protected static String clientCertSubjectName =
+            "CN=localhost, OU=SSL-Client, ST=Some-State, C=US";
+    protected static String serverCertSubjectName =
+            "O=Some-Org, L=Some-City, ST=Some-State, C=US";
+
+    protected static X509Certificate trustedCert;
+    protected static X509Certificate serverCert;
+    protected static X509Certificate clientCert;
+    protected static KeyPair serverKeys;
+    protected static KeyPair clientKeys;
+    protected static SSLContext serverSslContext;
+    protected static SSLContext clientSslContext;
+
+    public static void main(String[] args) throws Exception {
+
+        // Complete 3 handshakes with the same SSLContext.
+        String log = runAndGetLog(() -> {
+            try {
+                setupCertificates();
+                serverSslContext = getSSLContext(trustedCert, serverCert,
+                        serverKeys.getPrivate(), "TLSv1.3");
+                clientSslContext = getSSLContext(trustedCert, clientCert,
+                        clientKeys.getPrivate(), "TLSv1.3");
+
+                new CompressedCertMsgCache().run();
+                new CompressedCertMsgCache().run();
+                new CompressedCertMsgCache().run();
+            } catch (Exception _) {
+            }
+        });
+
+        // The same CompressedCertificate message must be cached only once.
+        assertEquals(1, countSubstringOccurrences(log,
+                "Caching CompressedCertificate message"));
+
+        // Make sure CompressedCertificate message is produced 3 times.
+        assertEquals(3, countSubstringOccurrences(log,
+                "Produced CompressedCertificate handshake message"));
+
+        // Make sure CompressedCertificate message is consumed 3 times.
+        assertEquals(3, countSubstringOccurrences(log,
+                "Consuming CompressedCertificate handshake message"));
+    }
+
+    @Override
+    public SSLContext createServerSSLContext() throws Exception {
+        return serverSslContext;
+    }
+
+    @Override
+    public SSLContext createClientSSLContext() throws Exception {
+        return clientSslContext;
+    }
+
+    protected static SSLContext getSSLContext(
+            X509Certificate trustedCertificate, X509Certificate keyCertificate,
+            PrivateKey privateKey, String protocol)
+            throws Exception {
+
+        // create a key store
+        KeyStore ks = KeyStore.getInstance("PKCS12");
+        ks.load(null, null);
+
+        // import the trusted cert
+        ks.setCertificateEntry("TLS Signer", trustedCertificate);
+
+        // generate certificate chain
+        Certificate[] chain = new Certificate[2];
+        chain[0] = keyCertificate;
+        chain[1] = trustedCertificate;
+
+        // import the key entry.
+        final char[] passphrase = "passphrase".toCharArray();
+        ks.setKeyEntry("Whatever", privateKey, passphrase, chain);
+
+        TrustManagerFactory tmf = TrustManagerFactory.getInstance("PKIX");
+        tmf.init(ks);
+
+        // create SSL context
+        SSLContext ctx = SSLContext.getInstance(protocol);
+
+        KeyManagerFactory kmf = KeyManagerFactory.getInstance("SunX509");
+        kmf.init(ks, passphrase);
+
+        ctx.init(kmf.getKeyManagers(), tmf.getTrustManagers(), null);
+
+        return ctx;
+    }
+
+    // Certificate-building helper methods.
+
+    protected static void setupCertificates() throws Exception {
+        KeyPairGenerator kpg = KeyPairGenerator.getInstance("EC");
+        KeyPair caKeys = kpg.generateKeyPair();
+        serverKeys = kpg.generateKeyPair();
+        clientKeys = kpg.generateKeyPair();
+
+        trustedCert = createTrustedCert(caKeys);
+
+        serverCert = customCertificateBuilder(
+                serverCertSubjectName,
+                serverKeys.getPublic(), caKeys.getPublic())
+                .addBasicConstraintsExt(false, false, -1)
+                .build(trustedCert, caKeys.getPrivate(), "SHA256withECDSA");
+
+        clientCert = customCertificateBuilder(
+                clientCertSubjectName,
+                clientKeys.getPublic(), caKeys.getPublic())
+                .addBasicConstraintsExt(false, false, -1)
+                .build(trustedCert, caKeys.getPrivate(), "SHA256withECDSA");
+    }
+
+    private static X509Certificate createTrustedCert(KeyPair caKeys)
+            throws Exception {
+        return customCertificateBuilder(
+                "O=CA-Org, L=Some-City, ST=Some-State, C=US",
+                caKeys.getPublic(), caKeys.getPublic())
+                .addBasicConstraintsExt(true, true, 1)
+                .build(null, caKeys.getPrivate(), "SHA256withECDSA");
+    }
+
+    private static CertificateBuilder customCertificateBuilder(
+            String subjectName, PublicKey publicKey, PublicKey caKey)
+            throws CertificateException, IOException {
+        return new CertificateBuilder()
+                .setSubjectName(subjectName)
+                .setPublicKey(publicKey)
+                .setNotBefore(
+                        Date.from(Instant.now().minus(1, ChronoUnit.HOURS)))
+                .setNotAfter(Date.from(Instant.now().plus(1, ChronoUnit.HOURS)))
+                .setSerialNumber(BigInteger.valueOf(
+                        new SecureRandom().nextLong(1000000) + 1))
+                .addSubjectKeyIdExt(publicKey)
+                .addAuthorityKeyIdExt(caKey)
+                .addKeyUsageExt(new boolean[]{
+                        true, true, true, true, true, true, true});
+    }
+}
diff --git a/test/lib/jdk/test/lib/security/SecurityUtils.java b/test/lib/jdk/test/lib/security/SecurityUtils.java
index be6ff1cc0e3..78dc2aa2729 100644
--- a/test/lib/jdk/test/lib/security/SecurityUtils.java
+++ b/test/lib/jdk/test/lib/security/SecurityUtils.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,8 +23,10 @@
 
 package jdk.test.lib.security;
 
+import java.io.ByteArrayOutputStream;
 import java.io.File;
 import java.io.IOException;
+import java.io.PrintStream;
 import java.nio.ByteBuffer;
 import java.security.KeyStore;
 import java.security.Security;
@@ -219,5 +221,40 @@ public final class SecurityUtils {
         return ((m.get() & 0xFF) << 8) | (m.get() & 0xFF);
     }
 
+    // Helper method to run and get log.
+    public static String runAndGetLog(Runnable runnable) {
+        System.setProperty("javax.net.debug", "ssl");
+        ByteArrayOutputStream baos = new ByteArrayOutputStream();
+        PrintStream err = new PrintStream(baos);
+        PrintStream origErr = System.err;
+        System.setErr(err);
+
+        runnable.run();
+        err.close();
+
+        // Save the log output and then print it as usual.
+        String log = baos.toString();
+        System.setErr(origErr);
+        System.err.print(log);
+        return log;
+    }
+
+    // Helper method to find log messages.
+    public static int countSubstringOccurrences(String str, String sub) {
+        if (str == null || sub == null || sub.isEmpty()) {
+            return 0;
+        }
+
+        int count = 0;
+        int lastIndex = 0;
+
+        while ((lastIndex = str.indexOf(sub, lastIndex)) != -1) {
+            count++;
+            lastIndex += sub.length();
+        }
+
+        return count;
+    }
+
     private SecurityUtils() {}
 }

From 5ddc36786a0797f346610819bb92353ff63abe7a Mon Sep 17 00:00:00 2001
From: Kelvin Nilsen <kdnilsen@openjdk.org>
Date: Fri, 17 Apr 2026 13:28:56 +0000
Subject: [PATCH 645/655] 8382095: GenShen: Do not clamp young reserve
 unnecessarily

Reviewed-by: wkemper, shade
---
 .../share/gc/shenandoah/shenandoahFreeSet.cpp |  7 +++++--
 .../gc/shenandoah/shenandoahGeneration.cpp    |  9 +-------
 .../shenandoah/shenandoahGenerationalHeap.cpp | 21 +++++++++++++------
 3 files changed, 21 insertions(+), 16 deletions(-)

diff --git a/src/hotspot/share/gc/shenandoah/shenandoahFreeSet.cpp b/src/hotspot/share/gc/shenandoah/shenandoahFreeSet.cpp
index 592c5bffa5a..1807383123b 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahFreeSet.cpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahFreeSet.cpp
@@ -2678,8 +2678,11 @@ void ShenandoahFreeSet::reduce_young_reserve(size_t adjusted_young_reserve, size
  *  1. Memory currently available within old and young
  *  2. Trashed regions currently residing in young and old, which will become available momentarily
  *  3. The value of old_generation->get_region_balance() which represents the number of regions that we plan
- *     to transfer from old generation to young generation.  Prior to each invocation of compute_young_and_old_reserves(),
- *     this value should computed by ShenandoahGenerationalHeap::compute_old_generation_balance().
+ *     to transfer from old generation to young generation. At the end of each GC cycle, we reset region_balance
+ *     to zero. As we prepare to rebuild free set at the end of update-refs, we call
+ *     ShenandoahGenerationalHeap::compute_old_generation_balance() to compute a new value of region_balance.
+ *     This allows us to expand or shrink the size of the Old Collector reserves based on anticipated needs of
+ *     the next GC cycle.
  */
 void ShenandoahFreeSet::compute_young_and_old_reserves(size_t young_trashed_regions, size_t old_trashed_regions,
                                                        size_t& young_reserve_result, size_t& old_reserve_result) const {
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahGeneration.cpp b/src/hotspot/share/gc/shenandoah/shenandoahGeneration.cpp
index 7d082e4a8b0..5b26ee67653 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahGeneration.cpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahGeneration.cpp
@@ -310,16 +310,9 @@ void ShenandoahGeneration::prepare_regions_and_collection_set(bool concurrent) {
     ShenandoahGCPhase phase(concurrent ? ShenandoahPhaseTimings::final_rebuild_freeset :
                             ShenandoahPhaseTimings::degen_gc_final_rebuild_freeset);
     ShenandoahHeapLocker locker(heap->lock());
-
-    // We are preparing for evacuation.
+    // At start of evacation, we do NOT compute_old_generation_balance()
     size_t young_trashed_regions, old_trashed_regions, first_old, last_old, num_old;
     _free_set->prepare_to_rebuild(young_trashed_regions, old_trashed_regions, first_old, last_old, num_old);
-    if (heap->mode()->is_generational()) {
-      ShenandoahGenerationalHeap* gen_heap = ShenandoahGenerationalHeap::heap();
-      size_t allocation_runway =
-        gen_heap->young_generation()->heuristics()->bytes_of_allocation_runway_before_gc_trigger(young_trashed_regions);
-      gen_heap->compute_old_generation_balance(allocation_runway, old_trashed_regions, young_trashed_regions);
-    }
     _free_set->finish_rebuild(young_trashed_regions, old_trashed_regions, num_old);
   }
 }
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahGenerationalHeap.cpp b/src/hotspot/share/gc/shenandoah/shenandoahGenerationalHeap.cpp
index a51449e91f4..1694121b955 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahGenerationalHeap.cpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahGenerationalHeap.cpp
@@ -406,11 +406,14 @@ template oop ShenandoahGenerationalHeap::try_evacuate_object<YOUNG_GENERATION, Y
 template oop ShenandoahGenerationalHeap::try_evacuate_object<YOUNG_GENERATION, OLD_GENERATION>(oop p, Thread* thread, uint from_region_age);
 template oop ShenandoahGenerationalHeap::try_evacuate_object<OLD_GENERATION, OLD_GENERATION>(oop p, Thread* thread, uint from_region_age);
 
+// Call this function at the end of a GC cycle in order to establish proper sizes of young and old reserves,
+// setting the old-generation balance so that GC can perform the anticipated evacuations.
+//
 // Make sure old-generation is large enough, but no larger than is necessary, to hold mixed evacuations
 // and promotions, if we anticipate either. Any deficit is provided by the young generation, subject to
 // mutator_xfer_limit, and any surplus is transferred to the young generation.  mutator_xfer_limit is
-// the maximum we're able to transfer from young to old.  This is called at the end of GC, as we prepare
-// for the idle span that precedes the next GC.
+// the maximum we're able to transfer from young to old. The mutator_xfer_limit constrains the transfer
+// of memory from young to old.  It does not limit young reserves.
 void ShenandoahGenerationalHeap::compute_old_generation_balance(size_t mutator_xfer_limit,
                                                                 size_t old_trashed_regions, size_t young_trashed_regions) {
   shenandoah_assert_heaplocked();
@@ -462,11 +465,17 @@ void ShenandoahGenerationalHeap::compute_old_generation_balance(size_t mutator_x
                                   bound_on_old_reserve));
   assert(mutator_xfer_limit <= young_available,
          "Cannot transfer (%zu) memory that is not available (%zu)", mutator_xfer_limit, young_available);
-  // Young reserves are to be taken out of the mutator_xfer_limit.
-  if (young_reserve > mutator_xfer_limit) {
-    young_reserve = mutator_xfer_limit;
+
+  if (young_reserve > young_available) {
+    young_reserve = young_available;
+  }
+  // We allow young_reserve to exceed mutator_xfer_limit. Essentially, this means the GC is already behind the pace
+  // of mutator allocations, and we'll need to trigger the next GC as soon as possible.
+  if (mutator_xfer_limit > young_reserve) {
+    mutator_xfer_limit -= young_reserve;
+  } else {
+    mutator_xfer_limit = 0;
   }
-  mutator_xfer_limit -= young_reserve;
 
   // Decide how much old space we should reserve for a mixed collection
   size_t proposed_reserve_for_mixed = 0;

From b418cbcdd4b8b200f5fe801469da1e3970eed634 Mon Sep 17 00:00:00 2001
From: Viktor Klang <vklang@openjdk.org>
Date: Fri, 17 Apr 2026 14:03:47 +0000
Subject: [PATCH 646/655] 8381418: Clarifying the identity Parameter in the
 Java Stream.reduce() Method Documentation

Reviewed-by: liach, alanb
---
 src/java.base/share/classes/java/util/stream/Stream.java | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/src/java.base/share/classes/java/util/stream/Stream.java b/src/java.base/share/classes/java/util/stream/Stream.java
index 1dd13133fe1..645f4f033b7 100644
--- a/src/java.base/share/classes/java/util/stream/Stream.java
+++ b/src/java.base/share/classes/java/util/stream/Stream.java
@@ -1002,8 +1002,8 @@ public interface Stream<T> extends BaseStream<T, Stream<T>> {
 
     /**
      * Performs a <a href="package-summary.html#Reduction">reduction</a> on the
-     * elements of this stream, using the provided identity, accumulation and
-     * combining functions.  This is equivalent to:
+     * elements of this stream using the provided identity value, accumulation
+     * function, and combining function.  This is equivalent to:
      * <pre>{@code
      *     U result = identity;
      *     for (T element : this stream)

From c3c59413be1a05e5b2362bb84d5fd50a8cbceff0 Mon Sep 17 00:00:00 2001
From: Quan Anh Mai <qamai@openjdk.org>
Date: Fri, 17 Apr 2026 14:09:07 +0000
Subject: [PATCH 647/655] 8378966: C2: PhaseIdealLoop::pin_nodes_dependent_on
 must not be called with nullptr

Reviewed-by: chagedorn, aseoane
---
 src/hotspot/share/opto/loopopts.cpp | 14 ++++++++++++--
 src/hotspot/share/opto/split_if.cpp |  3 +++
 2 files changed, 15 insertions(+), 2 deletions(-)

diff --git a/src/hotspot/share/opto/loopopts.cpp b/src/hotspot/share/opto/loopopts.cpp
index 11b23d7c365..ccd53129a87 100644
--- a/src/hotspot/share/opto/loopopts.cpp
+++ b/src/hotspot/share/opto/loopopts.cpp
@@ -1307,7 +1307,14 @@ Node* PhaseIdealLoop::place_outside_loop(Node* useblock, IdealLoopTree* loop) co
 
 
 bool PhaseIdealLoop::identical_backtoback_ifs(Node *n) {
-  if (!n->is_If() || n->is_BaseCountedLoopEnd()) {
+  if (!n->is_If()) {
+    return false;
+  }
+  if (n->outcnt() != n->as_If()->required_outcnt()) {
+    assert(false, "malformed IfNode with %d outputs", n->outcnt());
+    return false;
+  }
+  if (n->is_BaseCountedLoopEnd()) {
     return false;
   }
   if (!n->in(0)->is_Region()) {
@@ -1433,7 +1440,10 @@ void PhaseIdealLoop::split_if_with_blocks_post(Node *n) {
 
     // Check some safety conditions
     if (iff->is_If()) {        // Classic split-if?
-      if (iff->in(0) != n_ctrl) {
+      if (iff->outcnt() != iff->as_If()->required_outcnt()) {
+        assert(false, "malformed IfNode with %d outputs", iff->outcnt());
+        return;
+      } else if (iff->in(0) != n_ctrl) {
         return; // Compare must be in same blk as if
       }
     } else if (iff->is_CMove()) { // Trying to split-up a CMOVE
diff --git a/src/hotspot/share/opto/split_if.cpp b/src/hotspot/share/opto/split_if.cpp
index c1303f0d0db..e5f8043ae19 100644
--- a/src/hotspot/share/opto/split_if.cpp
+++ b/src/hotspot/share/opto/split_if.cpp
@@ -704,6 +704,9 @@ void PhaseIdealLoop::do_split_if(Node* iff, RegionNode** new_false_region, Regio
       new_true = ifpx;
     }
   }
+  assert(new_false != nullptr, "iff is malformed");
+  assert(new_true != nullptr, "iff is malformed");
+
   _igvn.remove_dead_node(new_iff, PhaseIterGVN::NodeOrigin::Speculative);
   // Lazy replace IDOM info with the region's dominator
   replace_node_and_forward_ctrl(iff, region_dom);

From 26ccc2eaa491531faaecc6214196f3ca082a7e06 Mon Sep 17 00:00:00 2001
From: Kelvin Nilsen <kdnilsen@openjdk.org>
Date: Fri, 17 Apr 2026 15:30:34 +0000
Subject: [PATCH 648/655] 8380651: [ubsan] gc/logging/TestGCId.java triggers
 runtime error: division by zero in shenandoahAdaptiveHeuristics

Reviewed-by: wkemper, shade, xpeng
---
 .../shenandoahAdaptiveHeuristics.cpp          | 34 ++++++++++++-------
 .../gc/shenandoah/shenandoahControlThread.cpp |  3 +-
 .../shenandoahGenerationalControlThread.cpp   |  5 ++-
 .../share/gc/shenandoah/shenandoahHeap.cpp    |  9 +++--
 .../share/gc/shenandoah/shenandoahHeap.hpp    |  2 +-
 .../share/gc/shenandoah/shenandoahUtils.cpp   |  7 ++--
 .../share/gc/shenandoah/shenandoahUtils.hpp   |  3 +-
 7 files changed, 38 insertions(+), 25 deletions(-)

diff --git a/src/hotspot/share/gc/shenandoah/heuristics/shenandoahAdaptiveHeuristics.cpp b/src/hotspot/share/gc/shenandoah/heuristics/shenandoahAdaptiveHeuristics.cpp
index 6b327d7e4af..c595d1fd9cd 100644
--- a/src/hotspot/share/gc/shenandoah/heuristics/shenandoahAdaptiveHeuristics.cpp
+++ b/src/hotspot/share/gc/shenandoah/heuristics/shenandoahAdaptiveHeuristics.cpp
@@ -209,14 +209,14 @@ void ShenandoahAdaptiveHeuristics::choose_collection_set_from_regiondata(Shenand
   }
 }
 
-void ShenandoahAdaptiveHeuristics::add_degenerated_gc_time(double timestamp, double gc_time) {
+void ShenandoahAdaptiveHeuristics::add_degenerated_gc_time(double time_at_start, double gc_time) {
   // Conservatively add sample into linear model If this time is above the predicted concurrent gc time
-  if (predict_gc_time(timestamp) < gc_time) {
-    add_gc_time(timestamp, gc_time);
+  if (predict_gc_time(time_at_start) < gc_time) {
+    add_gc_time(time_at_start, gc_time);
   }
 }
 
-void ShenandoahAdaptiveHeuristics::add_gc_time(double timestamp, double gc_time) {
+void ShenandoahAdaptiveHeuristics::add_gc_time(double time_at_start, double gc_time) {
   // Update best-fit linear predictor of GC time
   uint index = (_gc_time_first_sample_index + _gc_time_num_samples) % GC_TIME_SAMPLE_SIZE;
   if (_gc_time_num_samples == GC_TIME_SAMPLE_SIZE) {
@@ -225,10 +225,10 @@ void ShenandoahAdaptiveHeuristics::add_gc_time(double timestamp, double gc_time)
     _gc_time_sum_of_xy -= _gc_time_xy[index];
     _gc_time_sum_of_xx -= _gc_time_xx[index];
   }
-  _gc_time_timestamps[index] = timestamp;
+  _gc_time_timestamps[index] = time_at_start;
   _gc_time_samples[index] = gc_time;
-  _gc_time_xy[index] = timestamp * gc_time;
-  _gc_time_xx[index] = timestamp * timestamp;
+  _gc_time_xy[index] = time_at_start * gc_time;
+  _gc_time_xx[index] = time_at_start * time_at_start;
 
   _gc_time_sum_of_timestamps += _gc_time_timestamps[index];
   _gc_time_sum_of_samples += _gc_time_samples[index];
@@ -247,18 +247,26 @@ void ShenandoahAdaptiveHeuristics::add_gc_time(double timestamp, double gc_time)
     _gc_time_b = gc_time;
     _gc_time_sd = 0.0;
   } else if (_gc_time_num_samples == 2) {
-    // Two points define a line
-    double delta_y = gc_time - _gc_time_samples[_gc_time_first_sample_index];
-    double delta_x = timestamp - _gc_time_timestamps[_gc_time_first_sample_index];
-    _gc_time_m = delta_y / delta_x;
 
+    assert(time_at_start > _gc_time_timestamps[_gc_time_first_sample_index],
+           "Two GC cycles cannot finish at same time: %.6f vs %.6f, with GC times %.6f and %.6f", time_at_start,
+           _gc_time_timestamps[_gc_time_first_sample_index], gc_time, _gc_time_samples[_gc_time_first_sample_index]);
+
+    // Two points define a line
+    double delta_x = time_at_start - _gc_time_timestamps[_gc_time_first_sample_index];
+    double delta_y = gc_time - _gc_time_samples[_gc_time_first_sample_index];
+    _gc_time_m = delta_y / delta_x;
     // y = mx + b
     // so b = y0 - mx0
-    _gc_time_b = gc_time - _gc_time_m * timestamp;
+    _gc_time_b = gc_time - _gc_time_m * time_at_start;
     _gc_time_sd = 0.0;
   } else {
+    // Since timestamps are monotonically increasing, denominator does not equal zero.
+    double denominator = _gc_time_num_samples * _gc_time_sum_of_xx - _gc_time_sum_of_timestamps * _gc_time_sum_of_timestamps;
+    assert(denominator != 0.0, "Invariant: samples: %u, sum_of_xx: %.6f, sum_of_timestamps: %.6f",
+           _gc_time_num_samples, _gc_time_sum_of_xx, _gc_time_sum_of_timestamps);
     _gc_time_m = ((_gc_time_num_samples * _gc_time_sum_of_xy - _gc_time_sum_of_timestamps * _gc_time_sum_of_samples) /
-                  (_gc_time_num_samples * _gc_time_sum_of_xx - _gc_time_sum_of_timestamps * _gc_time_sum_of_timestamps));
+                  denominator);
     _gc_time_b = (_gc_time_sum_of_samples - _gc_time_m * _gc_time_sum_of_timestamps) / _gc_time_num_samples;
     double sum_of_squared_deviations = 0.0;
     for (size_t i = 0; i < _gc_time_num_samples; i++) {
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahControlThread.cpp b/src/hotspot/share/gc/shenandoah/shenandoahControlThread.cpp
index 4c6e82c86a5..6175f15676c 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahControlThread.cpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahControlThread.cpp
@@ -346,7 +346,8 @@ void ShenandoahControlThread::service_stw_full_cycle(GCCause::Cause cause) {
 void ShenandoahControlThread::service_stw_degenerated_cycle(GCCause::Cause cause, ShenandoahGC::ShenandoahDegenPoint point) {
   assert (point != ShenandoahGC::_degenerated_unset, "Degenerated point should be set");
   ShenandoahHeap* const heap = ShenandoahHeap::heap();
-  ShenandoahGCSession session(cause, heap->global_generation());
+  ShenandoahGCSession session(cause, heap->global_generation(), true,
+                              point == ShenandoahGC::ShenandoahDegenPoint::_degenerated_outside_cycle);
 
   heap->increment_total_collections(false);
 
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahGenerationalControlThread.cpp b/src/hotspot/share/gc/shenandoah/shenandoahGenerationalControlThread.cpp
index aa6a4a9bab2..bbad82de1dc 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahGenerationalControlThread.cpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahGenerationalControlThread.cpp
@@ -628,11 +628,10 @@ void ShenandoahGenerationalControlThread::service_stw_full_cycle(GCCause::Cause
 
 void ShenandoahGenerationalControlThread::service_stw_degenerated_cycle(const ShenandoahGCRequest& request) {
   assert(_degen_point != ShenandoahGC::_degenerated_unset, "Degenerated point should be set");
-  request.generation->heuristics()->record_degenerated_cycle_start(ShenandoahGC::ShenandoahDegenPoint::_degenerated_outside_cycle
-                                                                  == _degen_point);
   _heap->increment_total_collections(false);
 
-  ShenandoahGCSession session(request.cause, request.generation);
+  ShenandoahGCSession session(request.cause, request.generation, true,
+                              _degen_point == ShenandoahGC::ShenandoahDegenPoint::_degenerated_outside_cycle);
   ShenandoahDegenGC gc(_degen_point, request.generation);
   gc.collect(request.cause);
   _degen_point = ShenandoahGC::_degenerated_unset;
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahHeap.cpp b/src/hotspot/share/gc/shenandoah/shenandoahHeap.cpp
index 75d3ade4e49..4b01ea1cd52 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahHeap.cpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahHeap.cpp
@@ -1650,7 +1650,8 @@ void ShenandoahHeap::set_active_generation(ShenandoahGeneration* generation) {
   _active_generation = generation;
 }
 
-void ShenandoahHeap::on_cycle_start(GCCause::Cause cause, ShenandoahGeneration* generation) {
+void ShenandoahHeap::on_cycle_start(GCCause::Cause cause, ShenandoahGeneration* generation,
+                                    bool is_degenerated, bool is_out_of_cycle) {
   shenandoah_policy()->record_collection_cause(cause);
 
   const GCCause::Cause current = gc_cause();
@@ -1659,7 +1660,11 @@ void ShenandoahHeap::on_cycle_start(GCCause::Cause cause, ShenandoahGeneration*
 
   set_gc_cause(cause);
 
-  generation->heuristics()->record_cycle_start();
+  if (is_degenerated) {
+    generation->heuristics()->record_degenerated_cycle_start(is_out_of_cycle);
+  } else {
+    generation->heuristics()->record_cycle_start();
+  }
 }
 
 void ShenandoahHeap::on_cycle_end(ShenandoahGeneration* generation) {
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahHeap.hpp b/src/hotspot/share/gc/shenandoah/shenandoahHeap.hpp
index ab7dd00b774..bed26a093d0 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahHeap.hpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahHeap.hpp
@@ -564,7 +564,7 @@ public:
     return _evac_tracker;
   }
 
-  void on_cycle_start(GCCause::Cause cause, ShenandoahGeneration* generation);
+  void on_cycle_start(GCCause::Cause cause, ShenandoahGeneration* generation, bool is_degenerated, bool is_out_of_cycle);
   void on_cycle_end(ShenandoahGeneration* generation);
 
   ShenandoahVerifier*        verifier();
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahUtils.cpp b/src/hotspot/share/gc/shenandoah/shenandoahUtils.cpp
index dea47fcbf4f..5af2e274833 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahUtils.cpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahUtils.cpp
@@ -56,15 +56,14 @@ const char* ShenandoahGCSession::cycle_end_message(ShenandoahGenerationType type
   }
 }
 
-ShenandoahGCSession::ShenandoahGCSession(GCCause::Cause cause, ShenandoahGeneration* generation) :
+ShenandoahGCSession::ShenandoahGCSession(GCCause::Cause cause, ShenandoahGeneration* generation,
+                                         bool is_degenerated, bool is_out_of_cycle) :
   _heap(ShenandoahHeap::heap()),
   _generation(generation),
   _timer(_heap->gc_timer()),
   _tracer(_heap->tracer()) {
   assert(!ShenandoahGCPhase::is_current_phase_valid(), "No current GC phase");
-
-  _heap->on_cycle_start(cause, _generation);
-
+  _heap->on_cycle_start(cause, _generation, is_degenerated, is_out_of_cycle);
   _timer->register_gc_start();
   _tracer->report_gc_start(cause, _timer->gc_start());
   _heap->trace_heap_before_gc(_tracer);
diff --git a/src/hotspot/share/gc/shenandoah/shenandoahUtils.hpp b/src/hotspot/share/gc/shenandoah/shenandoahUtils.hpp
index 0169941c3d9..1ed6e43e3e1 100644
--- a/src/hotspot/share/gc/shenandoah/shenandoahUtils.hpp
+++ b/src/hotspot/share/gc/shenandoah/shenandoahUtils.hpp
@@ -70,7 +70,8 @@ private:
 
   static const char* cycle_end_message(ShenandoahGenerationType type);
 public:
-  ShenandoahGCSession(GCCause::Cause cause, ShenandoahGeneration* generation);
+  ShenandoahGCSession(GCCause::Cause cause, ShenandoahGeneration* generation,
+                      bool is_degenerated = false, bool is_out_of_cycle = false);
   ~ShenandoahGCSession();
 };
 

From 7f90efd7d4d97c9d556c0089c27ad3a3c0dfca6d Mon Sep 17 00:00:00 2001
From: Coleen Phillimore <coleenp@openjdk.org>
Date: Fri, 17 Apr 2026 16:12:21 +0000
Subject: [PATCH 649/655] 8381145: Missing ResourceMark in Mutex::print_on()

Reviewed-by: stefank, pchilanomate, dholmes
---
 src/hotspot/share/runtime/mutex.cpp       | 28 +++++++++++++++--------
 src/hotspot/share/runtime/mutex.hpp       |  6 +++--
 test/hotspot/gtest/runtime/test_mutex.cpp |  5 ++--
 3 files changed, 26 insertions(+), 13 deletions(-)

diff --git a/src/hotspot/share/runtime/mutex.cpp b/src/hotspot/share/runtime/mutex.cpp
index c455b5f36a2..8e0c1d10e5c 100644
--- a/src/hotspot/share/runtime/mutex.cpp
+++ b/src/hotspot/share/runtime/mutex.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1998, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1998, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -293,7 +293,8 @@ Mutex::Mutex(Rank rank, const char * name, bool allow_vm_block) : _owner(nullptr
   _rank            = rank;
   _skip_rank_check = false;
 
-  assert(_rank >= static_cast<Rank>(0) && _rank <= safepoint, "Bad lock rank %s: %s", rank_name(), name);
+  assert(_rank >= static_cast<Rank>(0) && _rank <= safepoint, "Bad lock rank %d outside [0, %d]: %s",
+         static_cast<int>(rank), static_cast<int>(safepoint), name);
 
   // The allow_vm_block also includes allowing other non-Java threads to block or
   // allowing Java threads to block in native.
@@ -324,25 +325,33 @@ static const char* _rank_names[] = { "event", "service", "stackwatermark", "tty"
 
 static const int _num_ranks = 7;
 
-static const char* rank_name_internal(Mutex::Rank r) {
+static void print_rank_name_internal(outputStream* st, Mutex::Rank r) {
   // Find closest rank and print out the name
-  stringStream st;
   for (int i = 0; i < _num_ranks; i++) {
     if (r == _ranks[i]) {
-      return _rank_names[i];
+      st->print("%s", _rank_names[i]);
     } else if (r  > _ranks[i] && (i < _num_ranks-1 && r < _ranks[i+1])) {
       int delta = static_cast<int>(_ranks[i+1]) - static_cast<int>(r);
-      st.print("%s-%d", _rank_names[i+1], delta);
-      return st.as_string();
+      st->print("%s-%d", _rank_names[i+1], delta);
     }
   }
-  return "fail";
+}
+
+// Requires caller to have ResourceMark.
+static const char* rank_name_internal(Mutex::Rank r) {
+  stringStream st;
+  print_rank_name_internal(&st, r);
+  return st.as_string();
 }
 
 const char* Mutex::rank_name() const {
   return rank_name_internal(_rank);
 }
 
+// Does not require caller to have ResourceMark.
+void Mutex::print_rank_name(outputStream* st) const {
+  print_rank_name_internal(st, _rank);
+}
 
 void Mutex::assert_no_overlap(Rank orig, Rank adjusted, int adjust) {
   int i = 0;
@@ -364,7 +373,8 @@ void Mutex::print_on(outputStream* st) const {
   if (_allow_vm_block) {
     st->print("%s", " allow_vm_block");
   }
-  DEBUG_ONLY(st->print(" %s", rank_name()));
+  st->print(" ");
+  DEBUG_ONLY(print_rank_name(st));
   st->cr();
 }
 
diff --git a/src/hotspot/share/runtime/mutex.hpp b/src/hotspot/share/runtime/mutex.hpp
index cf2b222d2da..4d30a320cbf 100644
--- a/src/hotspot/share/runtime/mutex.hpp
+++ b/src/hotspot/share/runtime/mutex.hpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1998, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1998, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -130,9 +130,11 @@ class Mutex : public CHeapObj<mtSynchronizer> {
     return _skip_rank_check;
   }
 
+  const char* rank_name() const;
+  void print_rank_name(outputStream* st) const;
+
  public:
   Rank   rank() const          { return _rank; }
-  const char*  rank_name() const;
   Mutex* next()  const         { return _next; }
 #endif // ASSERT
 
diff --git a/test/hotspot/gtest/runtime/test_mutex.cpp b/test/hotspot/gtest/runtime/test_mutex.cpp
index 2ed7b1b3a34..64b7a5207d7 100644
--- a/test/hotspot/gtest/runtime/test_mutex.cpp
+++ b/test/hotspot/gtest/runtime/test_mutex.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2020, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2020, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -323,11 +323,12 @@ TEST_VM_ASSERT_MSG(MutexSafepoint, possible_safepoint_lock,
     ".* Possible safepoint reached by thread that does not allow it") {
   JavaThread* thread = JavaThread::current();
   ThreadInVMfromNative in_native(thread);
-  MutexLocker ml(new Mutex(Mutex::nosafepoint, "SpecialTest_lock"),
+  MutexLocker ml(new Mutex(Mutex::nosafepoint-2, "SpecialTest_lock"),
                    Mutex::_no_safepoint_check_flag);
   thread->print_thread_state_on(tty);
   // If the lock above succeeds, try to safepoint to test the NSV implied with this nosafepoint lock.
   ThreadBlockInVM tbivm(thread);
   thread->print_thread_state_on(tty);
 }
+
 #endif // ASSERT

From 0a8dbed7ef4d12b09f223e81a9a658ddaeca931c Mon Sep 17 00:00:00 2001
From: Artur Barashev <abarashev@openjdk.org>
Date: Fri, 17 Apr 2026 17:02:59 +0000
Subject: [PATCH 650/655] 8370656: Re-examine use of InterruptedIOException in
 sun.security.ssl code

Reviewed-by: weijun, alanb
---
 .../sun/security/ssl/SSLSocketImpl.java       | 67 +++++++------------
 .../security/ssl/SSLSocketInputRecord.java    |  6 +-
 .../sun/security/ssl/SSLTransport.java        |  6 +-
 .../ssl/SSLSession/TestEnabledProtocols.java  | 10 ++-
 4 files changed, 35 insertions(+), 54 deletions(-)

diff --git a/src/java.base/share/classes/sun/security/ssl/SSLSocketImpl.java b/src/java.base/share/classes/sun/security/ssl/SSLSocketImpl.java
index f603cc22949..cef2f43526a 100644
--- a/src/java.base/share/classes/sun/security/ssl/SSLSocketImpl.java
+++ b/src/java.base/share/classes/sun/security/ssl/SSLSocketImpl.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1996, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1996, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -28,13 +28,13 @@ package sun.security.ssl;
 import java.io.EOFException;
 import java.io.IOException;
 import java.io.InputStream;
-import java.io.InterruptedIOException;
 import java.io.OutputStream;
 import java.net.InetAddress;
 import java.net.InetSocketAddress;
 import java.net.Socket;
 import java.net.SocketAddress;
 import java.net.SocketException;
+import java.net.SocketTimeoutException;
 import java.nio.ByteBuffer;
 import java.util.List;
 import java.util.concurrent.TimeUnit;
@@ -77,10 +77,10 @@ public final class SSLSocketImpl
     /**
      * ERROR HANDLING GUIDELINES
      * (which exceptions to throw and catch and which not to throw and catch)
-     *
+     * <p>
      * - if there is an IOException (SocketException) when accessing the
      *   underlying Socket, pass it through
-     *
+     * <p>
      * - do not throw IOExceptions, throw SSLExceptions (or a subclass)
      */
 
@@ -454,12 +454,12 @@ public final class SSLSocketImpl
                 if (!conContext.isNegotiated) {
                     readHandshakeRecord();
                 }
-            } catch (InterruptedIOException iioe) {
+            } catch (SocketTimeoutException e) {
                 if(resumable){
-                    handleException(iioe);
+                    handleException(e);
                 } else{
                     throw conContext.fatal(Alert.HANDSHAKE_FAILURE,
-                            "Couldn't kickstart handshaking", iioe);
+                            "Couldn't kickstart handshaking", e);
                 }
             } catch (SocketException se) {
                 handleException(se);
@@ -1427,7 +1427,7 @@ public final class SSLSocketImpl
                     return 0;
                 }
             } catch (SSLException |
-                    InterruptedIOException | SocketException se) {
+                     SocketTimeoutException | SocketException se) {
                 // Don't change exception in case of timeouts or interrupts
                 // or SocketException.
                 throw se;
@@ -1486,7 +1486,7 @@ public final class SSLSocketImpl
                     return buffer;
                 }
             } catch (SSLException |
-                    InterruptedIOException | SocketException se) {
+                     SocketTimeoutException | SocketException se) {
                 // Don't change exception in case of timeouts or interrupts
                 // or SocketException.
                 throw se;
@@ -1677,40 +1677,23 @@ public final class SSLSocketImpl
             SSLLogger.warning("handling exception", cause);
         }
 
-        // Don't close the Socket in case of timeouts or interrupts.
-        if (cause instanceof InterruptedIOException) {
-            throw (IOException)cause;
-        }
-
-        // need to perform error shutdown
-        boolean isSSLException = (cause instanceof SSLException);
-        Alert alert;
-        if (isSSLException) {
-            if (cause instanceof SSLHandshakeException) {
-                alert = Alert.HANDSHAKE_FAILURE;
-            } else {
-                alert = Alert.UNEXPECTED_MESSAGE;
+        throw switch (cause) {
+            // Don't close the Socket in case of timeouts.
+            case SocketTimeoutException ste -> ste;
+            // Send TLS alert with "fatal", then throw the socket exception.
+            case SocketException se -> {
+                try {
+                    throw conContext.fatal(Alert.UNEXPECTED_MESSAGE, se);
+                } catch (Exception _) {
+                }
+                yield se;
             }
-        } else {
-            if (cause instanceof IOException) {
-                alert = Alert.UNEXPECTED_MESSAGE;
-            } else {
-                // RuntimeException
-                alert = Alert.INTERNAL_ERROR;
-            }
-        }
-
-        if (cause instanceof SocketException) {
-            try {
-                throw conContext.fatal(alert, cause);
-            } catch (Exception e) {
-                // Just delivering the fatal alert, re-throw the socket exception instead.
-            }
-
-            throw (SocketException)cause;
-        }
-
-        throw conContext.fatal(alert, cause);
+            case SSLHandshakeException sslhe ->
+                    conContext.fatal(Alert.HANDSHAKE_FAILURE, sslhe);
+            case IOException ioe ->
+                    conContext.fatal(Alert.UNEXPECTED_MESSAGE, ioe);
+            default -> conContext.fatal(Alert.INTERNAL_ERROR, cause);
+        };
     }
 
     private Plaintext handleEOF(EOFException eofe) throws IOException {
diff --git a/src/java.base/share/classes/sun/security/ssl/SSLSocketInputRecord.java b/src/java.base/share/classes/sun/security/ssl/SSLSocketInputRecord.java
index fd9c4b171e7..fc3d9733150 100644
--- a/src/java.base/share/classes/sun/security/ssl/SSLSocketInputRecord.java
+++ b/src/java.base/share/classes/sun/security/ssl/SSLSocketInputRecord.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1996, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1996, 2026, Oracle and/or its affiliates. All rights reserved.
  * Copyright (c) 2020, Azul Systems, Inc. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
@@ -27,10 +27,10 @@
 package sun.security.ssl;
 
 import java.io.EOFException;
-import java.io.InterruptedIOException;
 import java.io.IOException;
 import java.io.InputStream;
 import java.io.OutputStream;
+import java.net.SocketTimeoutException;
 import java.nio.ByteBuffer;
 import java.security.GeneralSecurityException;
 import java.util.ArrayList;
@@ -180,7 +180,7 @@ final class SSLSocketInputRecord extends InputRecord implements SSLRecord {
             if (plaintext == null) {
                 plaintext = decodeInputRecord();
             }
-        } catch(InterruptedIOException e) {
+        } catch (SocketTimeoutException e) {
             // do not clean header and recordBody in case of Socket Timeout
             cleanInBuffer = false;
             throw e;
diff --git a/src/java.base/share/classes/sun/security/ssl/SSLTransport.java b/src/java.base/share/classes/sun/security/ssl/SSLTransport.java
index 50bff1e6d21..02551b4a8c1 100644
--- a/src/java.base/share/classes/sun/security/ssl/SSLTransport.java
+++ b/src/java.base/share/classes/sun/security/ssl/SSLTransport.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2018, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -27,8 +27,8 @@ package sun.security.ssl;
 
 import java.io.EOFException;
 import java.io.IOException;
-import java.io.InterruptedIOException;
 import java.net.SocketException;
+import java.net.SocketTimeoutException;
 import java.nio.ByteBuffer;
 import javax.crypto.AEADBadTagException;
 import javax.crypto.BadPaddingException;
@@ -138,7 +138,7 @@ interface SSLTransport {
         } catch (EOFException eofe) {
             // rethrow EOFException, the call will handle it if needed.
             throw eofe;
-        } catch (InterruptedIOException | SocketException se) {
+        } catch (SocketTimeoutException | SocketException se) {
             // don't close the Socket in case of timeouts or interrupts or SocketException.
             throw se;
         } catch (IOException ioe) {
diff --git a/test/jdk/javax/net/ssl/SSLSession/TestEnabledProtocols.java b/test/jdk/javax/net/ssl/SSLSession/TestEnabledProtocols.java
index 4e56a9a655b..070991586f3 100644
--- a/test/jdk/javax/net/ssl/SSLSession/TestEnabledProtocols.java
+++ b/test/jdk/javax/net/ssl/SSLSession/TestEnabledProtocols.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2001, 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2001, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -40,10 +40,10 @@
 
 import java.io.IOException;
 import java.io.InputStream;
-import java.io.InterruptedIOException;
 import java.io.OutputStream;
 import java.net.InetAddress;
 import java.net.SocketException;
+import java.net.SocketTimeoutException;
 import java.security.Security;
 import java.util.Arrays;
 
@@ -88,11 +88,9 @@ public class TestEnabledProtocols extends SSLSocketTemplate {
             // log it for debugging
             System.out.println("Server SSLHandshakeException:");
             se.printStackTrace(System.out);
-        } catch (InterruptedIOException ioe) {
-            // must have been interrupted, no harm
-        } catch (SSLException | SocketException se) {
+        } catch (SocketTimeoutException | SSLException | SocketException se) {
             // The client side may have closed the socket.
-            System.out.println("Server SSLException:");
+            System.out.println("Server exception:");
             se.printStackTrace(System.out);
         } catch (Exception e) {
             System.out.println("Server exception:");

From 2ce2d5886bdccabe4f51d79dd92751933def905a Mon Sep 17 00:00:00 2001
From: Coleen Phillimore <coleenp@openjdk.org>
Date: Fri, 17 Apr 2026 18:17:52 +0000
Subject: [PATCH 651/655] 8074292: nsk/jdb/kill/kill001: generateOopMap.cpp
 assert(bb->is_reachable()) failed

Co-authored-by: Tom Rodriguez <never@openjdk.org>
Reviewed-by: sspitsyn, pchilanomate, dlong, never
---
 .../share/interpreter/interpreterRuntime.cpp  |  14 +++
 .../share/interpreter/interpreterRuntime.hpp  |   4 +-
 src/hotspot/share/interpreter/oopMapCache.cpp |  15 ++-
 src/hotspot/share/oops/generateOopMap.cpp     |  80 ++++++-------
 src/hotspot/share/oops/generateOopMap.hpp     |   7 +-
 src/hotspot/share/runtime/globals.hpp         |   3 +
 .../share/runtime/interfaceSupport.cpp        |   7 +-
 .../exceptions/TestAccessErrorInCatch.java    |   3 +-
 .../nsk/jdb/kill/kill003/kill003.java         | 106 ++++++++++++++++++
 .../nsk/jdb/kill/kill003/kill003a.java        |  38 +++++++
 10 files changed, 228 insertions(+), 49 deletions(-)
 create mode 100644 test/hotspot/jtreg/vmTestbase/nsk/jdb/kill/kill003/kill003.java
 create mode 100644 test/hotspot/jtreg/vmTestbase/nsk/jdb/kill/kill003/kill003a.java

diff --git a/src/hotspot/share/interpreter/interpreterRuntime.cpp b/src/hotspot/share/interpreter/interpreterRuntime.cpp
index e7b35b121a2..cd0a062ebc8 100644
--- a/src/hotspot/share/interpreter/interpreterRuntime.cpp
+++ b/src/hotspot/share/interpreter/interpreterRuntime.cpp
@@ -36,6 +36,7 @@
 #include "interpreter/interpreter.hpp"
 #include "interpreter/interpreterRuntime.hpp"
 #include "interpreter/linkResolver.hpp"
+#include "interpreter/oopMapCache.hpp"
 #include "interpreter/templateTable.hpp"
 #include "jvm_io.h"
 #include "logging/log.hpp"
@@ -1527,4 +1528,17 @@ bool InterpreterRuntime::is_preemptable_call(address entry_point) {
          entry_point == CAST_FROM_FN_PTR(address, InterpreterRuntime::resolve_from_cache) ||
          entry_point == CAST_FROM_FN_PTR(address, InterpreterRuntime::_new);
 }
+
+void InterpreterRuntime::generate_oop_map_alot() {
+  JavaThread* current = JavaThread::current();
+  LastFrameAccessor last_frame(current);
+  if (last_frame.is_interpreted_frame()) {
+    ResourceMark rm(current);
+    InterpreterOopMap mask;
+    methodHandle mh(current, last_frame.method());
+    int bci = last_frame.bci();
+    log_info(generateoopmap)("Generating oopmap for method %s at bci %d", mh->name_and_sig_as_C_string(), bci);
+    OopMapCache::compute_one_oop_map(mh, bci, &mask);
+  }
+}
 #endif // ASSERT
diff --git a/src/hotspot/share/interpreter/interpreterRuntime.hpp b/src/hotspot/share/interpreter/interpreterRuntime.hpp
index 70ceeb0b2af..3228027fa93 100644
--- a/src/hotspot/share/interpreter/interpreterRuntime.hpp
+++ b/src/hotspot/share/interpreter/interpreterRuntime.hpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1997, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -173,6 +173,8 @@ private:
 
   // Virtual Thread Preemption
   DEBUG_ONLY(static bool is_preemptable_call(address entry_point);)
+
+  DEBUG_ONLY(static void generate_oop_map_alot();)
 };
 
 
diff --git a/src/hotspot/share/interpreter/oopMapCache.cpp b/src/hotspot/share/interpreter/oopMapCache.cpp
index 5a1ad7b7883..af45f7f9bed 100644
--- a/src/hotspot/share/interpreter/oopMapCache.cpp
+++ b/src/hotspot/share/interpreter/oopMapCache.cpp
@@ -92,11 +92,8 @@ class OopMapForCacheEntry: public GenerateOopMap {
 };
 
 
-OopMapForCacheEntry::OopMapForCacheEntry(const methodHandle& method, int bci, OopMapCacheEntry* entry) : GenerateOopMap(method) {
-  _bci       = bci;
-  _entry     = entry;
-  _stack_top = -1;
-}
+OopMapForCacheEntry::OopMapForCacheEntry(const methodHandle& method, int bci, OopMapCacheEntry* entry) :
+  GenerateOopMap(method, /*all_exception_edges*/ true), _entry(entry), _bci(bci), _stack_top(-1) { }
 
 
 bool OopMapForCacheEntry::compute_map(Thread* current) {
@@ -107,6 +104,11 @@ bool OopMapForCacheEntry::compute_map(Thread* current) {
   } else {
     ResourceMark rm;
     if (!GenerateOopMap::compute_map(current)) {
+      // If compute_map fails, print the exception message, which is generated if
+      // this is a JavaThread, otherwise compute_map calls fatal so we don't get here.
+      if (exception() != nullptr) {
+        exception()->print();
+      }
       fatal("Unrecoverable verification or out-of-memory error");
       return false;
     }
@@ -315,6 +317,9 @@ void OopMapCacheEntry::fill(const methodHandle& method, int bci) {
   } else {
     OopMapForCacheEntry gen(method, bci, this);
     if (!gen.compute_map(Thread::current())) {
+      if (gen.exception() != nullptr) {
+        gen.exception()->print();
+      }
       fatal("Unrecoverable verification or out-of-memory error");
     }
   }
diff --git a/src/hotspot/share/oops/generateOopMap.cpp b/src/hotspot/share/oops/generateOopMap.cpp
index 09912aeaf63..56f3e7e0325 100644
--- a/src/hotspot/share/oops/generateOopMap.cpp
+++ b/src/hotspot/share/oops/generateOopMap.cpp
@@ -1168,42 +1168,46 @@ void GenerateOopMap::interp_bb(BasicBlock *bb) {
 }
 
 void GenerateOopMap::do_exception_edge(BytecodeStream* itr) {
-  // Only check exception edge, if bytecode can trap
-  if (!Bytecodes::can_trap(itr->code())) return;
-  switch (itr->code()) {
-    case Bytecodes::_aload_0:
-      // These bytecodes can trap for rewriting.  We need to assume that
-      // they do not throw exceptions to make the monitor analysis work.
-      return;
 
-    case Bytecodes::_ireturn:
-    case Bytecodes::_lreturn:
-    case Bytecodes::_freturn:
-    case Bytecodes::_dreturn:
-    case Bytecodes::_areturn:
-    case Bytecodes::_return:
-      // If the monitor stack height is not zero when we leave the method,
-      // then we are either exiting with a non-empty stack or we have
-      // found monitor trouble earlier in our analysis.  In either case,
-      // assume an exception could be taken here.
-      if (_monitor_top == 0) {
+  // Only check exception edge, if bytecode can trap or if async exceptions can be thrown
+  // from any bytecode in the interpreter when single stepping.
+  if (!_all_exception_edges) {
+    if (!Bytecodes::can_trap(itr->code())) return;
+    switch (itr->code()) {
+      case Bytecodes::_aload_0:
+        // These bytecodes can trap for rewriting.  We need to assume that
+        // they do not throw exceptions to make the monitor analysis work.
         return;
-      }
-      break;
 
-    case Bytecodes::_monitorexit:
-      // If the monitor stack height is bad_monitors, then we have detected a
-      // monitor matching problem earlier in the analysis.  If the
-      // monitor stack height is 0, we are about to pop a monitor
-      // off of an empty stack.  In either case, the bytecode
-      // could throw an exception.
-      if (_monitor_top != bad_monitors && _monitor_top != 0) {
-        return;
-      }
-      break;
+      case Bytecodes::_ireturn:
+      case Bytecodes::_lreturn:
+      case Bytecodes::_freturn:
+      case Bytecodes::_dreturn:
+      case Bytecodes::_areturn:
+      case Bytecodes::_return:
+        // If the monitor stack height is not zero when we leave the method,
+        // then we are either exiting with a non-empty stack or we have
+        // found monitor trouble earlier in our analysis.  In either case,
+        // assume an exception could be taken here.
+        if (_monitor_top == 0) {
+          return;
+        }
+        break;
 
-    default:
-      break;
+      case Bytecodes::_monitorexit:
+        // If the monitor stack height is bad_monitors, then we have detected a
+        // monitor matching problem earlier in the analysis.  If the
+        // monitor stack height is 0, we are about to pop a monitor
+        // off of an empty stack.  In either case, the bytecode
+        // could throw an exception.
+        if (_monitor_top != bad_monitors && _monitor_top != 0) {
+          return;
+        }
+        break;
+
+      default:
+        break;
+    }
   }
 
   if (_has_exceptions) {
@@ -2055,12 +2059,12 @@ void GenerateOopMap::print_time() {
 //
 //  ============ Main Entry Point ===========
 //
-GenerateOopMap::GenerateOopMap(const methodHandle& method) {
+GenerateOopMap::GenerateOopMap(const methodHandle& method, bool all_exception_edges) :
   // We have to initialize all variables here, that can be queried directly
-  _method = method;
-  _max_locals=0;
-  _init_vars = nullptr;
-}
+  _method(method),
+  _max_locals(0),
+  _all_exception_edges(all_exception_edges),
+  _init_vars(nullptr) {}
 
 bool GenerateOopMap::compute_map(Thread* current) {
 #ifndef PRODUCT
@@ -2187,7 +2191,7 @@ void GenerateOopMap::result_for_basicblock(int bci) {
   // Find basicblock and report results
   BasicBlock* bb = get_basic_block_containing(bci);
   guarantee(bb != nullptr, "no basic block for bci");
-  assert(bb->is_reachable(), "getting result from unreachable basicblock %d", bci);
+  assert(bb->is_reachable(), "getting result from unreachable basicblock at bci %d", bci);
   bb->set_changed(true);
   interp_bb(bb);
 }
diff --git a/src/hotspot/share/oops/generateOopMap.hpp b/src/hotspot/share/oops/generateOopMap.hpp
index 783e295f08a..f0fdfeda57f 100644
--- a/src/hotspot/share/oops/generateOopMap.hpp
+++ b/src/hotspot/share/oops/generateOopMap.hpp
@@ -307,6 +307,7 @@ class GenerateOopMap {
   bool         _did_relocation;             // was relocation necessary
   bool         _monitor_safe;               // The monitors in this method have been determined
                                             // to be safe.
+  bool         _all_exception_edges;        // All bytecodes can reach containing exception handler.
 
   // Working Cell type state
   int            _state_len;                // Size of states
@@ -455,7 +456,7 @@ class GenerateOopMap {
 
   friend class RelocCallback;
  public:
-  GenerateOopMap(const methodHandle& method);
+  GenerateOopMap(const methodHandle& method, bool all_exception_edges);
 
   // Compute the map - returns true on success and false on error.
   bool compute_map(Thread* current);
@@ -516,7 +517,7 @@ class ResolveOopMapConflicts: public GenerateOopMap {
 #endif
 
  public:
-  ResolveOopMapConflicts(const methodHandle& method) : GenerateOopMap(method) { }
+  ResolveOopMapConflicts(const methodHandle& method) : GenerateOopMap(method, true) { }
   methodHandle do_potential_rewrite(TRAPS);
 };
 
@@ -535,7 +536,7 @@ class GeneratePairingInfo: public GenerateOopMap {
                                            CellTypeState* stack,
                                            int stack_top)                 {}
  public:
-  GeneratePairingInfo(const methodHandle& method) : GenerateOopMap(method)       {};
+  GeneratePairingInfo(const methodHandle& method) : GenerateOopMap(method, false)       {};
 
   // Call compute_map() to generate info.
 };
diff --git a/src/hotspot/share/runtime/globals.hpp b/src/hotspot/share/runtime/globals.hpp
index ac1ddec7cbc..9d38a44cbd5 100644
--- a/src/hotspot/share/runtime/globals.hpp
+++ b/src/hotspot/share/runtime/globals.hpp
@@ -871,6 +871,9 @@ const int ObjectAlignmentInBytes = 8;
   develop(bool, TimeOopMap, false,                                          \
           "Time calls to GenerateOopMap::compute_map() in sum")             \
                                                                             \
+  develop(bool, GenerateOopMapALot, false,                                  \
+          "Generate interpreter oopmaps at all safepoints")                 \
+                                                                            \
   develop(bool, TraceFinalizerRegistration, false,                          \
           "Trace registration of final references")                         \
                                                                             \
diff --git a/src/hotspot/share/runtime/interfaceSupport.cpp b/src/hotspot/share/runtime/interfaceSupport.cpp
index 11a7d9fd41f..6ccf63b4c5e 100644
--- a/src/hotspot/share/runtime/interfaceSupport.cpp
+++ b/src/hotspot/share/runtime/interfaceSupport.cpp
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1997, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -23,6 +23,7 @@
  */
 
 #include "gc/shared/collectedHeap.inline.hpp"
+#include "interpreter/interpreterRuntime.hpp"
 #include "logging/log.hpp"
 #include "memory/resourceArea.hpp"
 #include "memory/universe.hpp"
@@ -65,6 +66,10 @@ VMEntryWrapper::~VMEntryWrapper() {
   if (VerifyStack) {
     InterfaceSupport::verify_stack();
   }
+  // Verify interpreter oopmap generation
+  if (GenerateOopMapALot) {
+    InterpreterRuntime::generate_oop_map_alot();
+  }
 }
 
 VMNativeEntryWrapper::VMNativeEntryWrapper() {
diff --git a/test/hotspot/jtreg/compiler/exceptions/TestAccessErrorInCatch.java b/test/hotspot/jtreg/compiler/exceptions/TestAccessErrorInCatch.java
index fa81fa93f11..89dfae5c4da 100644
--- a/test/hotspot/jtreg/compiler/exceptions/TestAccessErrorInCatch.java
+++ b/test/hotspot/jtreg/compiler/exceptions/TestAccessErrorInCatch.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2025, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -37,6 +37,7 @@
  *   -XX:+IgnoreUnrecognizedVMOptions -XX:+VerifyStack
  *   -XX:TieredStopAtLevel=3
  *   TestAccessErrorInCatch
+ * @run main/othervm -XX:+IgnoreUnrecognizedVMOptions -XX:+GenerateOopMapALot TestAccessErrorInCatch
  */
 
 import java.lang.invoke.MethodHandle;
diff --git a/test/hotspot/jtreg/vmTestbase/nsk/jdb/kill/kill003/kill003.java b/test/hotspot/jtreg/vmTestbase/nsk/jdb/kill/kill003/kill003.java
new file mode 100644
index 00000000000..840e8def8bc
--- /dev/null
+++ b/test/hotspot/jtreg/vmTestbase/nsk/jdb/kill/kill003/kill003.java
@@ -0,0 +1,106 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+
+/*
+ * @test
+ * @bug 8074292
+ * @summary Reproduce the bb->is_reachable() assert with GetSetLocals call after async exception.
+ * @library /vmTestbase
+ *          /test/lib
+ * @compile -g kill003a.java
+ * @run driver
+ *      nsk.jdb.kill.kill003.kill003
+ *      -arch=${os.family}-${os.simpleArch}
+ *      -waittime=5
+ *      -verbose
+ *      -debugee.vmkind=java
+ *      -transport.address=dynamic
+ *      -jdb=${test.jdk}/bin/jdb
+ *      -java.options="${test.vm.opts} ${test.java.opts}"
+ *      -workdir=.
+ *      -debugee.vmkeys="${test.vm.opts} ${test.java.opts}"
+ */
+
+package nsk.jdb.kill.kill003;
+
+import nsk.share.*;
+import nsk.share.jdb.*;
+
+import java.io.*;
+import java.util.*;
+
+public class kill003 extends JdbTest {
+
+    public static void main (String argv[]) {
+        debuggeeClass =  DEBUGGEE_CLASS;
+        firstBreak = FIRST_BREAK;
+        new kill003().runTest(argv);
+    }
+
+    static final String PACKAGE_NAME    = "nsk.jdb.kill.kill003";
+    static final String TEST_CLASS      = PACKAGE_NAME + ".kill003";
+    static final String DEBUGGEE_CLASS  = TEST_CLASS + "a";
+    static final String FIRST_BREAK     = DEBUGGEE_CLASS + ".main";
+    static final String MYTHREAD        = "MyThread";
+    static final String DEBUGGEE_THREAD = PACKAGE_NAME + "." + MYTHREAD;
+    static final String DEBUGGEE_EXCEPTION = DEBUGGEE_CLASS + ".exception";
+
+    protected void runCases() {
+        String[] reply;
+        String[] threads;
+
+        // At this point we are at the breakpoint triggered by the firstBreak in main
+        // after creating all the threads. Get the list of debuggee threads.
+        threads = jdb.getThreadIdsByName("main");
+
+        // Stopped at kill.main, so step into synchronized block
+        reply = jdb.receiveReplyFor(JdbCommand.next);
+
+        if (threads.length != 1) {
+            log.complain("jdb should report " + 1 + " instance of " + DEBUGGEE_THREAD);
+            log.complain("Found: " + threads.length);
+            success = false;
+        }
+
+        // Execution is at a bytecode that is not expected to handle an async exception.  Throw one here
+        // to make sure it gets handled without crashing.  The exception will be delivered at the next
+        // bytecode that can handle the async exception.
+        reply = jdb.receiveReplyForWithMessageWait(JdbCommand.kill + threads[0] + " " + DEBUGGEE_EXCEPTION,
+                                                   "killed");
+
+        // Continue the debuggee - the async exception will be delivered to the debuggee.
+        reply = jdb.receiveReplyFor(JdbCommand.cont);
+
+        // Ask the debuggee for its local variables at the bytecode where the async exception was delivered, which
+        // should be reachable.
+        reply = jdb.receiveReplyForWithMessageWait(JdbCommand.locals, "Local variables");
+
+        if (jdb.terminated()) {
+            throw new Failure("Debuggee exited");
+        }
+
+        // The lack of exception handler in the debuggee should cause it to exit when continued.
+        jdb.contToExit(1);
+    }
+}
diff --git a/test/hotspot/jtreg/vmTestbase/nsk/jdb/kill/kill003/kill003a.java b/test/hotspot/jtreg/vmTestbase/nsk/jdb/kill/kill003/kill003a.java
new file mode 100644
index 00000000000..1e72e02a560
--- /dev/null
+++ b/test/hotspot/jtreg/vmTestbase/nsk/jdb/kill/kill003/kill003a.java
@@ -0,0 +1,38 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+package nsk.jdb.kill.kill003;
+
+import nsk.share.jdb.*;
+
+/* This is debuggee application */
+public class kill003a {
+    static NullPointerException exception = new NullPointerException();
+
+    public static void main(String args[]) {
+        synchronized (args) {
+        }
+        System.out.println("done");
+        System.exit(JdbTest.JCK_STATUS_BASE);
+    }
+}

From e95beacb4c2655865f8e8b081ba5137ce9878b82 Mon Sep 17 00:00:00 2001
From: Chad Rakoczy <crakoczy@openjdk.org>
Date: Fri, 17 Apr 2026 18:30:56 +0000
Subject: [PATCH 652/655] 8382146:
 jdk/jfr/event/compiler/TestCodeCacheFull.java fails when C2 is disabled

Reviewed-by: chagedorn
---
 .../jfr/event/compiler/TestCodeCacheFull.java  | 18 ++++++++++++++++--
 1 file changed, 16 insertions(+), 2 deletions(-)

diff --git a/test/jdk/jdk/jfr/event/compiler/TestCodeCacheFull.java b/test/jdk/jdk/jfr/event/compiler/TestCodeCacheFull.java
index 12c9d6c40fa..266eb73a656 100644
--- a/test/jdk/jdk/jfr/event/compiler/TestCodeCacheFull.java
+++ b/test/jdk/jdk/jfr/event/compiler/TestCodeCacheFull.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2013, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2013, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -34,7 +34,7 @@ import jdk.test.whitebox.WhiteBox;
 import jdk.test.whitebox.code.BlobType;
 
 /**
- * @test TestCodeCacheFull
+ * @test id=Default
  * @requires vm.hasJFR
  * @requires vm.opt.UseCodeCacheFlushing == null | vm.opt.UseCodeCacheFlushing == true
  *
@@ -50,6 +50,20 @@ import jdk.test.whitebox.code.BlobType;
  * @run main/othervm -Xbootclasspath/a:.
  *     -XX:+UnlockDiagnosticVMOptions -XX:+WhiteBoxAPI
  *     -XX:-SegmentedCodeCache jdk.jfr.event.compiler.TestCodeCacheFull
+ */
+
+/**
+ * @test id=HotCode
+ * @requires vm.hasJFR
+ * @requires vm.opt.UseCodeCacheFlushing == null | vm.opt.UseCodeCacheFlushing == true
+ * @requires vm.compiler2.enabled
+ *
+ * @library /test/lib
+ * @modules jdk.jfr
+ *          jdk.management.jfr
+ * @build jdk.test.whitebox.WhiteBox
+ * @run driver jdk.test.lib.helpers.ClassFileInstaller jdk.test.whitebox.WhiteBox
+ *
  * @run main/othervm -Xbootclasspath/a:.
  *     -XX:+UnlockDiagnosticVMOptions -XX:+WhiteBoxAPI
  *     -XX:+TieredCompilation -XX:+UnlockExperimentalVMOptions -XX:+HotCodeHeap -XX:HotCodeHeapSize=8M jdk.jfr.event.compiler.TestCodeCacheFull

From 2325c3649dd360043f8434d96dd2892c13ba0141 Mon Sep 17 00:00:00 2001
From: Saint Wesonga <swesonga@openjdk.org>
Date: Fri, 17 Apr 2026 19:55:20 +0000
Subject: [PATCH 653/655] 8378891: Problemlist TestStaticCallStub on Windows
 AArch64

Reviewed-by: mchevalier, chagedorn
---
 test/hotspot/jtreg/ProblemList.txt | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/test/hotspot/jtreg/ProblemList.txt b/test/hotspot/jtreg/ProblemList.txt
index b4f9efff830..202570d6486 100644
--- a/test/hotspot/jtreg/ProblemList.txt
+++ b/test/hotspot/jtreg/ProblemList.txt
@@ -79,7 +79,7 @@ compiler/codecache/CodeCacheFullCountTest.java 8332954 generic-all
 compiler/interpreter/Test6833129.java 8335266 generic-i586
 compiler/intrinsics/TestReturnOopSetForJFRWriteCheckpoint.java 8286300 linux-s390x
 
-compiler/c2/aarch64/TestStaticCallStub.java 8359963 linux-aarch64,macosx-aarch64
+compiler/c2/aarch64/TestStaticCallStub.java 8359963 generic-aarch64
 
 compiler/unsafe/AlignmentGapAccess.java 8373487 generic-all
 

From 804ecc14dcc0465f9cbbfe38608bd989a0df84fd Mon Sep 17 00:00:00 2001
From: Aleksey Shipilev <shade@openjdk.org>
Date: Fri, 17 Apr 2026 20:01:09 +0000
Subject: [PATCH 654/655] 8382436: Build failures after JDK-8326205

Reviewed-by: kvn
---
 src/hotspot/share/runtime/hotCodeCollector.cpp | 1 +
 1 file changed, 1 insertion(+)

diff --git a/src/hotspot/share/runtime/hotCodeCollector.cpp b/src/hotspot/share/runtime/hotCodeCollector.cpp
index 643cf3a8bbb..6bdeee011ce 100644
--- a/src/hotspot/share/runtime/hotCodeCollector.cpp
+++ b/src/hotspot/share/runtime/hotCodeCollector.cpp
@@ -29,6 +29,7 @@
 #include "compiler/compilerDefinitions.inline.hpp"
 #include "logging/log.hpp"
 #include "memory/resourceArea.hpp"
+#include "oops/method.inline.hpp"
 #include "runtime/hotCodeCollector.hpp"
 #include "runtime/hotCodeSampler.hpp"
 #include "runtime/java.hpp"

From 0dd0108c1a7b3658df536adbc2bd68fa5167539d Mon Sep 17 00:00:00 2001
From: Jeremy Wood <jwood@openjdk.org>
Date: Fri, 17 Apr 2026 20:53:42 +0000
Subject: [PATCH 655/655] 8377936: VoiceOver Reads Button Incorrectly

Reviewed-by: prr, kizune
---
 .../classes/sun/lwawt/macosx/CAccessible.java |  22 +---
 .../8377936/VoiceOverNamesAndStates.java      | 107 ++++++++++++++++++
 2 files changed, 112 insertions(+), 17 deletions(-)
 create mode 100644 test/jdk/javax/accessibility/8377936/VoiceOverNamesAndStates.java

diff --git a/src/java.desktop/macosx/classes/sun/lwawt/macosx/CAccessible.java b/src/java.desktop/macosx/classes/sun/lwawt/macosx/CAccessible.java
index 5be7f70b981..4315abe6197 100644
--- a/src/java.desktop/macosx/classes/sun/lwawt/macosx/CAccessible.java
+++ b/src/java.desktop/macosx/classes/sun/lwawt/macosx/CAccessible.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2011, 2025, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2011, 2026, Oracle and/or its affiliates. All rights reserved.
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  *
  * This code is free software; you can redistribute it and/or modify it
@@ -188,10 +188,6 @@ final class CAccessible extends CFRetainedResource implements Accessible {
 
                     // Do send check box state changes to native side
                     if (thisRole == AccessibleRole.CHECK_BOX) {
-                        if (!Objects.equals(newValue, oldValue)) {
-                            valueChanged(ptr);
-                        }
-
                         // Notify native side to handle check box style menuitem
                         if (parentRole == AccessibleRole.POPUP_MENU && newValue != null
                                 && ((AccessibleState)newValue) == AccessibleState.FOCUSED) {
@@ -201,23 +197,12 @@ final class CAccessible extends CFRetainedResource implements Accessible {
 
                     // Do send radio button state changes to native side
                     if (thisRole == AccessibleRole.RADIO_BUTTON) {
-                        if (newValue != null && !newValue.equals(oldValue)) {
-                            valueChanged(ptr);
-                        }
-
                         // Notify native side to handle radio button style menuitem
                         if (parentRole == AccessibleRole.POPUP_MENU && newValue != null
                             && ((AccessibleState)newValue) == AccessibleState.FOCUSED) {
                             menuItemSelected(ptr);
                         }
                     }
-
-                    // Do send toggle button state changes to native side
-                    if (thisRole == AccessibleRole.TOGGLE_BUTTON) {
-                        if (!Objects.equals(newValue, oldValue)) {
-                            valueChanged(ptr);
-                        }
-                    }
                 } else if (name.equals(ACCESSIBLE_NAME_PROPERTY)) {
                     //for now trigger only for JTabbedPane.
                     if (e.getSource() instanceof JTabbedPane) {
@@ -227,7 +212,10 @@ final class CAccessible extends CFRetainedResource implements Accessible {
                     AccessibleRole thisRole = accessible.getAccessibleContext()
                                                         .getAccessibleRole();
                     if (thisRole == AccessibleRole.SLIDER ||
-                            thisRole == AccessibleRole.PROGRESS_BAR) {
+                            thisRole == AccessibleRole.PROGRESS_BAR ||
+                            thisRole == AccessibleRole.CHECK_BOX ||
+                            thisRole == AccessibleRole.RADIO_BUTTON ||
+                            thisRole == AccessibleRole.TOGGLE_BUTTON ) {
                         valueChanged(ptr);
                     }
                 }
diff --git a/test/jdk/javax/accessibility/8377936/VoiceOverNamesAndStates.java b/test/jdk/javax/accessibility/8377936/VoiceOverNamesAndStates.java
new file mode 100644
index 00000000000..9df68cf0ca0
--- /dev/null
+++ b/test/jdk/javax/accessibility/8377936/VoiceOverNamesAndStates.java
@@ -0,0 +1,107 @@
+/*
+ * Copyright (c) 2026, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+
+import java.awt.FlowLayout;
+import javax.swing.AbstractButton;
+import javax.swing.JButton;
+import javax.swing.JCheckBox;
+import javax.swing.JFrame;
+
+/*
+ * @test
+ * @key headful
+ * @bug 8377936
+ * @summary manual test for VoiceOver reading button names and states
+ * @requires os.family == "mac"
+ * @library /java/awt/regtesthelpers
+ * @build PassFailJFrame
+ * @run main/manual VoiceOverNamesAndStates
+ */
+
+public class VoiceOverNamesAndStates {
+    public static void main(String[] args) throws Exception {
+        String INSTRUCTIONS = """
+                INSTRUCTIONS:
+
+                Part A:
+                1. Open VoiceOver
+                2. Move the VoiceOver cursor to the leftmost button.
+                3. Press CTRL + ALT + RIGHT to move to the rightmost button.
+
+                Expected behavior: VoiceOver should announce rightmost button.
+                (It should NOT announce the leftmost button.)
+
+                Part B (Regression for 8061359, 8348936, 8309733):
+                1. Open VoiceOver
+                2. Move the VoiceOver cursor to the leftmost button.
+                3. Press SPACE to trigger Swing's default KeyListeners.
+                4. Repeat step 3 to untoggle button.
+                5. Press CTRL + ALT + SPACE to trigger VO's listeners.
+                6. Repeat step 5 to untoggle button
+
+                Expected behavior: VoiceOver should announce the change in the
+                button state in steps 3-6. (When you use VoiceOver to toggle
+                the button you should hear a small chirp as the button
+                toggles.)
+
+                Part C (Regression for 8345728, 8283400):
+                1. Turn on Screen Magnifier
+                (See System Settings -> Accessibility -> Hover Text)
+                2. Press CMD key and hover mouse over leftmost button
+                3. Click the button
+                4. Release the CMD key
+
+                Expected behavior: both the button and the "hover text" window
+                repaint to show a selected button.
+
+                5. Repeat steps 2-4 to untoggle the button
+
+                Expected behavior: both the button and the "hover text" window
+                repaint to show a deselected button.
+
+                """;
+
+        PassFailJFrame.builder()
+                .title("VoiceOverNamesAndStates Instruction")
+                .instructions(INSTRUCTIONS)
+                .columns(40)
+                .testUI(VoiceOverNamesAndStates::createUI)
+                .build()
+                .awaitAndCheck();
+    }
+
+    private static JFrame createUI() {
+        JFrame f = new JFrame();
+
+        f.getContentPane().setLayout(new FlowLayout());
+
+        AbstractButton button1 = new JCheckBox("chess");
+        AbstractButton button2 = new JButton("backgammon");
+
+        f.getContentPane().add(button1);
+        f.getContentPane().add(button2);
+        f.pack();
+        f.setVisible(true);
+        return f;
+    }
+}